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 if (V.getOpcode() == ISD::BUILD_VECTOR ||
7746 (Idx == 0 && V.getOpcode() == ISD::SCALAR_TO_VECTOR))
7747 return V.getOperand(Idx);
7752 /// \brief Try to lower insertion of a single element into a zero vector.
7754 /// This is a common pattern that we have especially efficient patterns to lower
7755 /// across all subtarget feature sets.
7756 static SDValue lowerVectorShuffleAsElementInsertion(
7757 MVT VT, SDLoc DL, SDValue V1, SDValue V2, ArrayRef<int> Mask,
7758 const X86Subtarget *Subtarget, SelectionDAG &DAG) {
7759 SmallBitVector Zeroable = computeZeroableShuffleElements(Mask, V1, V2);
7761 int V2Index = std::find_if(Mask.begin(), Mask.end(),
7762 [&Mask](int M) { return M >= (int)Mask.size(); }) -
7764 if (Mask.size() == 2) {
7765 if (!Zeroable[V2Index ^ 1]) {
7766 // For 2-wide masks we may be able to just invert the inputs. We use an xor
7767 // with 2 to flip from {2,3} to {0,1} and vice versa.
7768 int InverseMask[2] = {Mask[0] < 0 ? -1 : (Mask[0] ^ 2),
7769 Mask[1] < 0 ? -1 : (Mask[1] ^ 2)};
7770 if (Zeroable[V2Index])
7771 return lowerVectorShuffleAsElementInsertion(VT, DL, V2, V1, InverseMask,
7777 for (int i = 0, Size = Mask.size(); i < Size; ++i)
7778 if (i != V2Index && !Zeroable[i])
7779 return SDValue(); // Not inserting into a zero vector.
7782 // Check for a single input from a SCALAR_TO_VECTOR node.
7783 // FIXME: All of this should be canonicalized into INSERT_VECTOR_ELT and
7784 // all the smarts here sunk into that routine. However, the current
7785 // lowering of BUILD_VECTOR makes that nearly impossible until the old
7786 // vector shuffle lowering is dead.
7787 SDValue V2S = getScalarValueForVectorElement(V2, Mask[V2Index] - Mask.size());
7791 // First, we need to zext the scalar if it is smaller than an i32.
7793 MVT EltVT = VT.getVectorElementType();
7794 V2S = DAG.getNode(ISD::BITCAST, DL, EltVT, V2S);
7795 if (EltVT == MVT::i8 || EltVT == MVT::i16) {
7796 // Zero-extend directly to i32.
7798 V2S = DAG.getNode(ISD::ZERO_EXTEND, DL, MVT::i32, V2S);
7801 V2 = DAG.getNode(X86ISD::VZEXT_MOVL, DL, ExtVT,
7802 DAG.getNode(ISD::SCALAR_TO_VECTOR, DL, ExtVT, V2S));
7804 V2 = DAG.getNode(ISD::BITCAST, DL, VT, V2);
7807 // If we have 4 or fewer lanes we can cheaply shuffle the element into
7808 // the desired position. Otherwise it is more efficient to do a vector
7809 // shift left. We know that we can do a vector shift left because all
7810 // the inputs are zero.
7811 if (VT.isFloatingPoint() || VT.getVectorNumElements() <= 4) {
7812 SmallVector<int, 4> V2Shuffle(Mask.size(), 1);
7813 V2Shuffle[V2Index] = 0;
7814 V2 = DAG.getVectorShuffle(VT, DL, V2, DAG.getUNDEF(VT), V2Shuffle);
7816 V2 = DAG.getNode(ISD::BITCAST, DL, MVT::v2i64, V2);
7818 X86ISD::VSHLDQ, DL, MVT::v2i64, V2,
7820 V2Index * EltVT.getSizeInBits(),
7821 DAG.getTargetLoweringInfo().getScalarShiftAmountTy(MVT::v2i64)));
7822 V2 = DAG.getNode(ISD::BITCAST, DL, VT, V2);
7828 /// \brief Try to lower broadcast of a single element.
7830 /// For convenience, this code also bundles all of the subtarget feature set
7831 /// filtering. While a little annoying to re-dispatch on type here, there isn't
7832 /// a convenient way to factor it out.
7833 static SDValue lowerVectorShuffleAsBroadcast(MVT VT, SDLoc DL, SDValue V,
7835 const X86Subtarget *Subtarget,
7836 SelectionDAG &DAG) {
7837 if (!Subtarget->hasAVX())
7839 if (VT.isInteger() && !Subtarget->hasAVX2())
7842 // Check that the mask is a broadcast.
7843 int BroadcastIdx = -1;
7845 if (M >= 0 && BroadcastIdx == -1)
7847 else if (M >= 0 && M != BroadcastIdx)
7850 assert(BroadcastIdx < (int)Mask.size() && "We only expect to be called with "
7851 "a sorted mask where the broadcast "
7854 // Check if this is a broadcast of a scalar. We special case lowering for
7855 // scalars so that we can more effectively fold with loads.
7856 if (V.getOpcode() == ISD::BUILD_VECTOR ||
7857 (V.getOpcode() == ISD::SCALAR_TO_VECTOR && BroadcastIdx == 0)) {
7858 V = V.getOperand(BroadcastIdx);
7860 // If the scalar isn't a load we can't broadcast from it in AVX1, only with
7862 if (!Subtarget->hasAVX2() && !ISD::isNON_EXTLoad(V.getNode()))
7864 } else if (BroadcastIdx != 0 || !Subtarget->hasAVX2()) {
7865 // We can't broadcast from a vector register w/o AVX2, and we can only
7866 // broadcast from the zero-element of a vector register.
7870 return DAG.getNode(X86ISD::VBROADCAST, DL, VT, V);
7873 /// \brief Handle lowering of 2-lane 64-bit floating point shuffles.
7875 /// This is the basis function for the 2-lane 64-bit shuffles as we have full
7876 /// support for floating point shuffles but not integer shuffles. These
7877 /// instructions will incur a domain crossing penalty on some chips though so
7878 /// it is better to avoid lowering through this for integer vectors where
7880 static SDValue lowerV2F64VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
7881 const X86Subtarget *Subtarget,
7882 SelectionDAG &DAG) {
7884 assert(Op.getSimpleValueType() == MVT::v2f64 && "Bad shuffle type!");
7885 assert(V1.getSimpleValueType() == MVT::v2f64 && "Bad operand type!");
7886 assert(V2.getSimpleValueType() == MVT::v2f64 && "Bad operand type!");
7887 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
7888 ArrayRef<int> Mask = SVOp->getMask();
7889 assert(Mask.size() == 2 && "Unexpected mask size for v2 shuffle!");
7891 if (isSingleInputShuffleMask(Mask)) {
7892 // Straight shuffle of a single input vector. Simulate this by using the
7893 // single input as both of the "inputs" to this instruction..
7894 unsigned SHUFPDMask = (Mask[0] == 1) | ((Mask[1] == 1) << 1);
7896 if (Subtarget->hasAVX()) {
7897 // If we have AVX, we can use VPERMILPS which will allow folding a load
7898 // into the shuffle.
7899 return DAG.getNode(X86ISD::VPERMILPI, DL, MVT::v2f64, V1,
7900 DAG.getConstant(SHUFPDMask, MVT::i8));
7903 return DAG.getNode(X86ISD::SHUFP, SDLoc(Op), MVT::v2f64, V1, V1,
7904 DAG.getConstant(SHUFPDMask, MVT::i8));
7906 assert(Mask[0] >= 0 && Mask[0] < 2 && "Non-canonicalized blend!");
7907 assert(Mask[1] >= 2 && "Non-canonicalized blend!");
7909 // Use dedicated unpack instructions for masks that match their pattern.
7910 if (isShuffleEquivalent(Mask, 0, 2))
7911 return DAG.getNode(X86ISD::UNPCKL, DL, MVT::v2f64, V1, V2);
7912 if (isShuffleEquivalent(Mask, 1, 3))
7913 return DAG.getNode(X86ISD::UNPCKH, DL, MVT::v2f64, V1, V2);
7915 // If we have a single input, insert that into V1 if we can do so cheaply.
7916 if ((Mask[0] >= 2) + (Mask[1] >= 2) == 1)
7917 if (SDValue Insertion = lowerVectorShuffleAsElementInsertion(
7918 MVT::v2f64, DL, V1, V2, Mask, Subtarget, DAG))
7921 // Try to use one of the special instruction patterns to handle two common
7922 // blend patterns if a zero-blend above didn't work.
7923 if (isShuffleEquivalent(Mask, 0, 3) || isShuffleEquivalent(Mask, 1, 3))
7924 if (SDValue V1S = getScalarValueForVectorElement(V1, Mask[0]))
7925 // We can either use a special instruction to load over the low double or
7926 // to move just the low double.
7927 return DAG.getNode(ISD::isNON_EXTLoad(V1S.getNode()) ? X86ISD::MOVLPD
7929 DL, MVT::v2f64, V2, V1S);
7931 if (Subtarget->hasSSE41())
7932 if (SDValue Blend = lowerVectorShuffleAsBlend(DL, MVT::v2f64, V1, V2, Mask,
7936 unsigned SHUFPDMask = (Mask[0] == 1) | (((Mask[1] - 2) == 1) << 1);
7937 return DAG.getNode(X86ISD::SHUFP, SDLoc(Op), MVT::v2f64, V1, V2,
7938 DAG.getConstant(SHUFPDMask, MVT::i8));
7941 /// \brief Handle lowering of 2-lane 64-bit integer shuffles.
7943 /// Tries to lower a 2-lane 64-bit shuffle using shuffle operations provided by
7944 /// the integer unit to minimize domain crossing penalties. However, for blends
7945 /// it falls back to the floating point shuffle operation with appropriate bit
7947 static SDValue lowerV2I64VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
7948 const X86Subtarget *Subtarget,
7949 SelectionDAG &DAG) {
7951 assert(Op.getSimpleValueType() == MVT::v2i64 && "Bad shuffle type!");
7952 assert(V1.getSimpleValueType() == MVT::v2i64 && "Bad operand type!");
7953 assert(V2.getSimpleValueType() == MVT::v2i64 && "Bad operand type!");
7954 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
7955 ArrayRef<int> Mask = SVOp->getMask();
7956 assert(Mask.size() == 2 && "Unexpected mask size for v2 shuffle!");
7958 if (isSingleInputShuffleMask(Mask)) {
7959 // Check for being able to broadcast a single element.
7960 if (SDValue Broadcast = lowerVectorShuffleAsBroadcast(MVT::v2i64, DL, V1,
7961 Mask, Subtarget, DAG))
7964 // Straight shuffle of a single input vector. For everything from SSE2
7965 // onward this has a single fast instruction with no scary immediates.
7966 // We have to map the mask as it is actually a v4i32 shuffle instruction.
7967 V1 = DAG.getNode(ISD::BITCAST, DL, MVT::v4i32, V1);
7968 int WidenedMask[4] = {
7969 std::max(Mask[0], 0) * 2, std::max(Mask[0], 0) * 2 + 1,
7970 std::max(Mask[1], 0) * 2, std::max(Mask[1], 0) * 2 + 1};
7972 ISD::BITCAST, DL, MVT::v2i64,
7973 DAG.getNode(X86ISD::PSHUFD, SDLoc(Op), MVT::v4i32, V1,
7974 getV4X86ShuffleImm8ForMask(WidenedMask, DAG)));
7977 // Use dedicated unpack instructions for masks that match their pattern.
7978 if (isShuffleEquivalent(Mask, 0, 2))
7979 return DAG.getNode(X86ISD::UNPCKL, DL, MVT::v2i64, V1, V2);
7980 if (isShuffleEquivalent(Mask, 1, 3))
7981 return DAG.getNode(X86ISD::UNPCKH, DL, MVT::v2i64, V1, V2);
7983 // If we have a single input from V2 insert that into V1 if we can do so
7985 if ((Mask[0] >= 2) + (Mask[1] >= 2) == 1)
7986 if (SDValue Insertion = lowerVectorShuffleAsElementInsertion(
7987 MVT::v2i64, DL, V1, V2, Mask, Subtarget, DAG))
7990 if (Subtarget->hasSSE41())
7991 if (SDValue Blend = lowerVectorShuffleAsBlend(DL, MVT::v2i64, V1, V2, Mask,
7995 // Try to use rotation instructions if available.
7996 if (Subtarget->hasSSSE3())
7997 if (SDValue Rotate = lowerVectorShuffleAsByteRotate(
7998 DL, MVT::v2i64, V1, V2, Mask, DAG))
8001 // We implement this with SHUFPD which is pretty lame because it will likely
8002 // incur 2 cycles of stall for integer vectors on Nehalem and older chips.
8003 // However, all the alternatives are still more cycles and newer chips don't
8004 // have this problem. It would be really nice if x86 had better shuffles here.
8005 V1 = DAG.getNode(ISD::BITCAST, DL, MVT::v2f64, V1);
8006 V2 = DAG.getNode(ISD::BITCAST, DL, MVT::v2f64, V2);
8007 return DAG.getNode(ISD::BITCAST, DL, MVT::v2i64,
8008 DAG.getVectorShuffle(MVT::v2f64, DL, V1, V2, Mask));
8011 /// \brief Lower a vector shuffle using the SHUFPS instruction.
8013 /// This is a helper routine dedicated to lowering vector shuffles using SHUFPS.
8014 /// It makes no assumptions about whether this is the *best* lowering, it simply
8016 static SDValue lowerVectorShuffleWithSHUFPS(SDLoc DL, MVT VT,
8017 ArrayRef<int> Mask, SDValue V1,
8018 SDValue V2, SelectionDAG &DAG) {
8019 SDValue LowV = V1, HighV = V2;
8020 int NewMask[4] = {Mask[0], Mask[1], Mask[2], Mask[3]};
8023 std::count_if(Mask.begin(), Mask.end(), [](int M) { return M >= 4; });
8025 if (NumV2Elements == 1) {
8027 std::find_if(Mask.begin(), Mask.end(), [](int M) { return M >= 4; }) -
8030 // Compute the index adjacent to V2Index and in the same half by toggling
8032 int V2AdjIndex = V2Index ^ 1;
8034 if (Mask[V2AdjIndex] == -1) {
8035 // Handles all the cases where we have a single V2 element and an undef.
8036 // This will only ever happen in the high lanes because we commute the
8037 // vector otherwise.
8039 std::swap(LowV, HighV);
8040 NewMask[V2Index] -= 4;
8042 // Handle the case where the V2 element ends up adjacent to a V1 element.
8043 // To make this work, blend them together as the first step.
8044 int V1Index = V2AdjIndex;
8045 int BlendMask[4] = {Mask[V2Index] - 4, 0, Mask[V1Index], 0};
8046 V2 = DAG.getNode(X86ISD::SHUFP, DL, VT, V2, V1,
8047 getV4X86ShuffleImm8ForMask(BlendMask, DAG));
8049 // Now proceed to reconstruct the final blend as we have the necessary
8050 // high or low half formed.
8057 NewMask[V1Index] = 2; // We put the V1 element in V2[2].
8058 NewMask[V2Index] = 0; // We shifted the V2 element into V2[0].
8060 } else if (NumV2Elements == 2) {
8061 if (Mask[0] < 4 && Mask[1] < 4) {
8062 // Handle the easy case where we have V1 in the low lanes and V2 in the
8066 } else if (Mask[2] < 4 && Mask[3] < 4) {
8067 // We also handle the reversed case because this utility may get called
8068 // when we detect a SHUFPS pattern but can't easily commute the shuffle to
8069 // arrange things in the right direction.
8075 // We have a mixture of V1 and V2 in both low and high lanes. Rather than
8076 // trying to place elements directly, just blend them and set up the final
8077 // shuffle to place them.
8079 // The first two blend mask elements are for V1, the second two are for
8081 int BlendMask[4] = {Mask[0] < 4 ? Mask[0] : Mask[1],
8082 Mask[2] < 4 ? Mask[2] : Mask[3],
8083 (Mask[0] >= 4 ? Mask[0] : Mask[1]) - 4,
8084 (Mask[2] >= 4 ? Mask[2] : Mask[3]) - 4};
8085 V1 = DAG.getNode(X86ISD::SHUFP, DL, VT, V1, V2,
8086 getV4X86ShuffleImm8ForMask(BlendMask, DAG));
8088 // Now we do a normal shuffle of V1 by giving V1 as both operands to
8091 NewMask[0] = Mask[0] < 4 ? 0 : 2;
8092 NewMask[1] = Mask[0] < 4 ? 2 : 0;
8093 NewMask[2] = Mask[2] < 4 ? 1 : 3;
8094 NewMask[3] = Mask[2] < 4 ? 3 : 1;
8097 return DAG.getNode(X86ISD::SHUFP, DL, VT, LowV, HighV,
8098 getV4X86ShuffleImm8ForMask(NewMask, DAG));
8101 /// \brief Lower 4-lane 32-bit floating point shuffles.
8103 /// Uses instructions exclusively from the floating point unit to minimize
8104 /// domain crossing penalties, as these are sufficient to implement all v4f32
8106 static SDValue lowerV4F32VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
8107 const X86Subtarget *Subtarget,
8108 SelectionDAG &DAG) {
8110 assert(Op.getSimpleValueType() == MVT::v4f32 && "Bad shuffle type!");
8111 assert(V1.getSimpleValueType() == MVT::v4f32 && "Bad operand type!");
8112 assert(V2.getSimpleValueType() == MVT::v4f32 && "Bad operand type!");
8113 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
8114 ArrayRef<int> Mask = SVOp->getMask();
8115 assert(Mask.size() == 4 && "Unexpected mask size for v4 shuffle!");
8118 std::count_if(Mask.begin(), Mask.end(), [](int M) { return M >= 4; });
8120 if (NumV2Elements == 0) {
8121 // Check for being able to broadcast a single element.
8122 if (SDValue Broadcast = lowerVectorShuffleAsBroadcast(MVT::v4f32, DL, V1,
8123 Mask, Subtarget, DAG))
8126 if (Subtarget->hasAVX()) {
8127 // If we have AVX, we can use VPERMILPS which will allow folding a load
8128 // into the shuffle.
8129 return DAG.getNode(X86ISD::VPERMILPI, DL, MVT::v4f32, V1,
8130 getV4X86ShuffleImm8ForMask(Mask, DAG));
8133 // Otherwise, use a straight shuffle of a single input vector. We pass the
8134 // input vector to both operands to simulate this with a SHUFPS.
8135 return DAG.getNode(X86ISD::SHUFP, DL, MVT::v4f32, V1, V1,
8136 getV4X86ShuffleImm8ForMask(Mask, DAG));
8139 // Use dedicated unpack instructions for masks that match their pattern.
8140 if (isShuffleEquivalent(Mask, 0, 4, 1, 5))
8141 return DAG.getNode(X86ISD::UNPCKL, DL, MVT::v4f32, V1, V2);
8142 if (isShuffleEquivalent(Mask, 2, 6, 3, 7))
8143 return DAG.getNode(X86ISD::UNPCKH, DL, MVT::v4f32, V1, V2);
8145 // There are special ways we can lower some single-element blends. However, we
8146 // have custom ways we can lower more complex single-element blends below that
8147 // we defer to if both this and BLENDPS fail to match, so restrict this to
8148 // when the V2 input is targeting element 0 of the mask -- that is the fast
8150 if (NumV2Elements == 1 && Mask[0] >= 4)
8151 if (SDValue V = lowerVectorShuffleAsElementInsertion(MVT::v4f32, DL, V1, V2,
8152 Mask, Subtarget, DAG))
8155 if (Subtarget->hasSSE41())
8156 if (SDValue Blend = lowerVectorShuffleAsBlend(DL, MVT::v4f32, V1, V2, Mask,
8160 // Check for whether we can use INSERTPS to perform the blend. We only use
8161 // INSERTPS when the V1 elements are already in the correct locations
8162 // because otherwise we can just always use two SHUFPS instructions which
8163 // are much smaller to encode than a SHUFPS and an INSERTPS.
8164 if (NumV2Elements == 1 && Subtarget->hasSSE41()) {
8166 std::find_if(Mask.begin(), Mask.end(), [](int M) { return M >= 4; }) -
8169 // When using INSERTPS we can zero any lane of the destination. Collect
8170 // the zero inputs into a mask and drop them from the lanes of V1 which
8171 // actually need to be present as inputs to the INSERTPS.
8172 SmallBitVector Zeroable = computeZeroableShuffleElements(Mask, V1, V2);
8174 // Synthesize a shuffle mask for the non-zero and non-v2 inputs.
8175 bool InsertNeedsShuffle = false;
8177 for (int i = 0; i < 4; ++i)
8181 } else if (Mask[i] != i) {
8182 InsertNeedsShuffle = true;
8187 // We don't want to use INSERTPS or other insertion techniques if it will
8188 // require shuffling anyways.
8189 if (!InsertNeedsShuffle) {
8190 // If all of V1 is zeroable, replace it with undef.
8191 if ((ZMask | 1 << V2Index) == 0xF)
8192 V1 = DAG.getUNDEF(MVT::v4f32);
8194 unsigned InsertPSMask = (Mask[V2Index] - 4) << 6 | V2Index << 4 | ZMask;
8195 assert((InsertPSMask & ~0xFFu) == 0 && "Invalid mask!");
8197 // Insert the V2 element into the desired position.
8198 return DAG.getNode(X86ISD::INSERTPS, DL, MVT::v4f32, V1, V2,
8199 DAG.getConstant(InsertPSMask, MVT::i8));
8203 // Otherwise fall back to a SHUFPS lowering strategy.
8204 return lowerVectorShuffleWithSHUFPS(DL, MVT::v4f32, Mask, V1, V2, DAG);
8207 /// \brief Lower 4-lane i32 vector shuffles.
8209 /// We try to handle these with integer-domain shuffles where we can, but for
8210 /// blends we use the floating point domain blend instructions.
8211 static SDValue lowerV4I32VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
8212 const X86Subtarget *Subtarget,
8213 SelectionDAG &DAG) {
8215 assert(Op.getSimpleValueType() == MVT::v4i32 && "Bad shuffle type!");
8216 assert(V1.getSimpleValueType() == MVT::v4i32 && "Bad operand type!");
8217 assert(V2.getSimpleValueType() == MVT::v4i32 && "Bad operand type!");
8218 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
8219 ArrayRef<int> Mask = SVOp->getMask();
8220 assert(Mask.size() == 4 && "Unexpected mask size for v4 shuffle!");
8222 // Whenever we can lower this as a zext, that instruction is strictly faster
8223 // than any alternative. It also allows us to fold memory operands into the
8224 // shuffle in many cases.
8225 if (SDValue ZExt = lowerVectorShuffleAsZeroOrAnyExtend(DL, MVT::v4i32, V1, V2,
8226 Mask, Subtarget, DAG))
8230 std::count_if(Mask.begin(), Mask.end(), [](int M) { return M >= 4; });
8232 if (NumV2Elements == 0) {
8233 // Check for being able to broadcast a single element.
8234 if (SDValue Broadcast = lowerVectorShuffleAsBroadcast(MVT::v4i32, DL, V1,
8235 Mask, Subtarget, DAG))
8238 // Straight shuffle of a single input vector. For everything from SSE2
8239 // onward this has a single fast instruction with no scary immediates.
8240 // We coerce the shuffle pattern to be compatible with UNPCK instructions
8241 // but we aren't actually going to use the UNPCK instruction because doing
8242 // so prevents folding a load into this instruction or making a copy.
8243 const int UnpackLoMask[] = {0, 0, 1, 1};
8244 const int UnpackHiMask[] = {2, 2, 3, 3};
8245 if (isShuffleEquivalent(Mask, 0, 0, 1, 1))
8246 Mask = UnpackLoMask;
8247 else if (isShuffleEquivalent(Mask, 2, 2, 3, 3))
8248 Mask = UnpackHiMask;
8250 return DAG.getNode(X86ISD::PSHUFD, DL, MVT::v4i32, V1,
8251 getV4X86ShuffleImm8ForMask(Mask, DAG));
8254 // Use dedicated unpack instructions for masks that match their pattern.
8255 if (isShuffleEquivalent(Mask, 0, 4, 1, 5))
8256 return DAG.getNode(X86ISD::UNPCKL, DL, MVT::v4i32, V1, V2);
8257 if (isShuffleEquivalent(Mask, 2, 6, 3, 7))
8258 return DAG.getNode(X86ISD::UNPCKH, DL, MVT::v4i32, V1, V2);
8260 // There are special ways we can lower some single-element blends.
8261 if (NumV2Elements == 1)
8262 if (SDValue V = lowerVectorShuffleAsElementInsertion(MVT::v4i32, DL, V1, V2,
8263 Mask, Subtarget, DAG))
8266 if (Subtarget->hasSSE41())
8267 if (SDValue Blend = lowerVectorShuffleAsBlend(DL, MVT::v4i32, V1, V2, Mask,
8271 // Try to use rotation instructions if available.
8272 if (Subtarget->hasSSSE3())
8273 if (SDValue Rotate = lowerVectorShuffleAsByteRotate(
8274 DL, MVT::v4i32, V1, V2, Mask, DAG))
8277 // We implement this with SHUFPS because it can blend from two vectors.
8278 // Because we're going to eventually use SHUFPS, we use SHUFPS even to build
8279 // up the inputs, bypassing domain shift penalties that we would encur if we
8280 // directly used PSHUFD on Nehalem and older. For newer chips, this isn't
8282 return DAG.getNode(ISD::BITCAST, DL, MVT::v4i32,
8283 DAG.getVectorShuffle(
8285 DAG.getNode(ISD::BITCAST, DL, MVT::v4f32, V1),
8286 DAG.getNode(ISD::BITCAST, DL, MVT::v4f32, V2), Mask));
8289 /// \brief Lowering of single-input v8i16 shuffles is the cornerstone of SSE2
8290 /// shuffle lowering, and the most complex part.
8292 /// The lowering strategy is to try to form pairs of input lanes which are
8293 /// targeted at the same half of the final vector, and then use a dword shuffle
8294 /// to place them onto the right half, and finally unpack the paired lanes into
8295 /// their final position.
8297 /// The exact breakdown of how to form these dword pairs and align them on the
8298 /// correct sides is really tricky. See the comments within the function for
8299 /// more of the details.
8300 static SDValue lowerV8I16SingleInputVectorShuffle(
8301 SDLoc DL, SDValue V, MutableArrayRef<int> Mask,
8302 const X86Subtarget *Subtarget, SelectionDAG &DAG) {
8303 assert(V.getSimpleValueType() == MVT::v8i16 && "Bad input type!");
8304 MutableArrayRef<int> LoMask = Mask.slice(0, 4);
8305 MutableArrayRef<int> HiMask = Mask.slice(4, 4);
8307 SmallVector<int, 4> LoInputs;
8308 std::copy_if(LoMask.begin(), LoMask.end(), std::back_inserter(LoInputs),
8309 [](int M) { return M >= 0; });
8310 std::sort(LoInputs.begin(), LoInputs.end());
8311 LoInputs.erase(std::unique(LoInputs.begin(), LoInputs.end()), LoInputs.end());
8312 SmallVector<int, 4> HiInputs;
8313 std::copy_if(HiMask.begin(), HiMask.end(), std::back_inserter(HiInputs),
8314 [](int M) { return M >= 0; });
8315 std::sort(HiInputs.begin(), HiInputs.end());
8316 HiInputs.erase(std::unique(HiInputs.begin(), HiInputs.end()), HiInputs.end());
8318 std::lower_bound(LoInputs.begin(), LoInputs.end(), 4) - LoInputs.begin();
8319 int NumHToL = LoInputs.size() - NumLToL;
8321 std::lower_bound(HiInputs.begin(), HiInputs.end(), 4) - HiInputs.begin();
8322 int NumHToH = HiInputs.size() - NumLToH;
8323 MutableArrayRef<int> LToLInputs(LoInputs.data(), NumLToL);
8324 MutableArrayRef<int> LToHInputs(HiInputs.data(), NumLToH);
8325 MutableArrayRef<int> HToLInputs(LoInputs.data() + NumLToL, NumHToL);
8326 MutableArrayRef<int> HToHInputs(HiInputs.data() + NumLToH, NumHToH);
8328 // Check for being able to broadcast a single element.
8329 if (SDValue Broadcast = lowerVectorShuffleAsBroadcast(MVT::v8i16, DL, V,
8330 Mask, Subtarget, DAG))
8333 // Use dedicated unpack instructions for masks that match their pattern.
8334 if (isShuffleEquivalent(Mask, 0, 0, 1, 1, 2, 2, 3, 3))
8335 return DAG.getNode(X86ISD::UNPCKL, DL, MVT::v8i16, V, V);
8336 if (isShuffleEquivalent(Mask, 4, 4, 5, 5, 6, 6, 7, 7))
8337 return DAG.getNode(X86ISD::UNPCKH, DL, MVT::v8i16, V, V);
8339 // Try to use rotation instructions if available.
8340 if (Subtarget->hasSSSE3())
8341 if (SDValue Rotate = lowerVectorShuffleAsByteRotate(
8342 DL, MVT::v8i16, V, V, Mask, DAG))
8345 // Simplify the 1-into-3 and 3-into-1 cases with a single pshufd. For all
8346 // such inputs we can swap two of the dwords across the half mark and end up
8347 // with <=2 inputs to each half in each half. Once there, we can fall through
8348 // to the generic code below. For example:
8350 // Input: [a, b, c, d, e, f, g, h] -PSHUFD[0,2,1,3]-> [a, b, e, f, c, d, g, h]
8351 // Mask: [0, 1, 2, 7, 4, 5, 6, 3] -----------------> [0, 1, 4, 7, 2, 3, 6, 5]
8353 // However in some very rare cases we have a 1-into-3 or 3-into-1 on one half
8354 // and an existing 2-into-2 on the other half. In this case we may have to
8355 // pre-shuffle the 2-into-2 half to avoid turning it into a 3-into-1 or
8356 // 1-into-3 which could cause us to cycle endlessly fixing each side in turn.
8357 // Fortunately, we don't have to handle anything but a 2-into-2 pattern
8358 // because any other situation (including a 3-into-1 or 1-into-3 in the other
8359 // half than the one we target for fixing) will be fixed when we re-enter this
8360 // path. We will also combine away any sequence of PSHUFD instructions that
8361 // result into a single instruction. Here is an example of the tricky case:
8363 // Input: [a, b, c, d, e, f, g, h] -PSHUFD[0,2,1,3]-> [a, b, e, f, c, d, g, h]
8364 // Mask: [3, 7, 1, 0, 2, 7, 3, 5] -THIS-IS-BAD!!!!-> [5, 7, 1, 0, 4, 7, 5, 3]
8366 // This now has a 1-into-3 in the high half! Instead, we do two shuffles:
8368 // Input: [a, b, c, d, e, f, g, h] PSHUFHW[0,2,1,3]-> [a, b, c, d, e, g, f, h]
8369 // Mask: [3, 7, 1, 0, 2, 7, 3, 5] -----------------> [3, 7, 1, 0, 2, 7, 3, 6]
8371 // Input: [a, b, c, d, e, g, f, h] -PSHUFD[0,2,1,3]-> [a, b, e, g, c, d, f, h]
8372 // Mask: [3, 7, 1, 0, 2, 7, 3, 6] -----------------> [5, 7, 1, 0, 4, 7, 5, 6]
8374 // The result is fine to be handled by the generic logic.
8375 auto balanceSides = [&](ArrayRef<int> AToAInputs, ArrayRef<int> BToAInputs,
8376 ArrayRef<int> BToBInputs, ArrayRef<int> AToBInputs,
8377 int AOffset, int BOffset) {
8378 assert((AToAInputs.size() == 3 || AToAInputs.size() == 1) &&
8379 "Must call this with A having 3 or 1 inputs from the A half.");
8380 assert((BToAInputs.size() == 1 || BToAInputs.size() == 3) &&
8381 "Must call this with B having 1 or 3 inputs from the B half.");
8382 assert(AToAInputs.size() + BToAInputs.size() == 4 &&
8383 "Must call this with either 3:1 or 1:3 inputs (summing to 4).");
8385 // Compute the index of dword with only one word among the three inputs in
8386 // a half by taking the sum of the half with three inputs and subtracting
8387 // the sum of the actual three inputs. The difference is the remaining
8390 int &TripleDWord = AToAInputs.size() == 3 ? ADWord : BDWord;
8391 int &OneInputDWord = AToAInputs.size() == 3 ? BDWord : ADWord;
8392 int TripleInputOffset = AToAInputs.size() == 3 ? AOffset : BOffset;
8393 ArrayRef<int> TripleInputs = AToAInputs.size() == 3 ? AToAInputs : BToAInputs;
8394 int OneInput = AToAInputs.size() == 3 ? BToAInputs[0] : AToAInputs[0];
8395 int TripleInputSum = 0 + 1 + 2 + 3 + (4 * TripleInputOffset);
8396 int TripleNonInputIdx =
8397 TripleInputSum - std::accumulate(TripleInputs.begin(), TripleInputs.end(), 0);
8398 TripleDWord = TripleNonInputIdx / 2;
8400 // We use xor with one to compute the adjacent DWord to whichever one the
8402 OneInputDWord = (OneInput / 2) ^ 1;
8404 // Check for one tricky case: We're fixing a 3<-1 or a 1<-3 shuffle for AToA
8405 // and BToA inputs. If there is also such a problem with the BToB and AToB
8406 // inputs, we don't try to fix it necessarily -- we'll recurse and see it in
8407 // the next pass. However, if we have a 2<-2 in the BToB and AToB inputs, it
8408 // is essential that we don't *create* a 3<-1 as then we might oscillate.
8409 if (BToBInputs.size() == 2 && AToBInputs.size() == 2) {
8410 // Compute how many inputs will be flipped by swapping these DWords. We
8412 // to balance this to ensure we don't form a 3-1 shuffle in the other
8414 int NumFlippedAToBInputs =
8415 std::count(AToBInputs.begin(), AToBInputs.end(), 2 * ADWord) +
8416 std::count(AToBInputs.begin(), AToBInputs.end(), 2 * ADWord + 1);
8417 int NumFlippedBToBInputs =
8418 std::count(BToBInputs.begin(), BToBInputs.end(), 2 * BDWord) +
8419 std::count(BToBInputs.begin(), BToBInputs.end(), 2 * BDWord + 1);
8420 if ((NumFlippedAToBInputs == 1 &&
8421 (NumFlippedBToBInputs == 0 || NumFlippedBToBInputs == 2)) ||
8422 (NumFlippedBToBInputs == 1 &&
8423 (NumFlippedAToBInputs == 0 || NumFlippedAToBInputs == 2))) {
8424 // We choose whether to fix the A half or B half based on whether that
8425 // half has zero flipped inputs. At zero, we may not be able to fix it
8426 // with that half. We also bias towards fixing the B half because that
8427 // will more commonly be the high half, and we have to bias one way.
8428 auto FixFlippedInputs = [&V, &DL, &Mask, &DAG](int PinnedIdx, int DWord,
8429 ArrayRef<int> Inputs) {
8430 int FixIdx = PinnedIdx ^ 1; // The adjacent slot to the pinned slot.
8431 bool IsFixIdxInput = std::find(Inputs.begin(), Inputs.end(),
8432 PinnedIdx ^ 1) != Inputs.end();
8433 // Determine whether the free index is in the flipped dword or the
8434 // unflipped dword based on where the pinned index is. We use this bit
8435 // in an xor to conditionally select the adjacent dword.
8436 int FixFreeIdx = 2 * (DWord ^ (PinnedIdx / 2 == DWord));
8437 bool IsFixFreeIdxInput = std::find(Inputs.begin(), Inputs.end(),
8438 FixFreeIdx) != Inputs.end();
8439 if (IsFixIdxInput == IsFixFreeIdxInput)
8441 IsFixFreeIdxInput = std::find(Inputs.begin(), Inputs.end(),
8442 FixFreeIdx) != Inputs.end();
8443 assert(IsFixIdxInput != IsFixFreeIdxInput &&
8444 "We need to be changing the number of flipped inputs!");
8445 int PSHUFHalfMask[] = {0, 1, 2, 3};
8446 std::swap(PSHUFHalfMask[FixFreeIdx % 4], PSHUFHalfMask[FixIdx % 4]);
8447 V = DAG.getNode(FixIdx < 4 ? X86ISD::PSHUFLW : X86ISD::PSHUFHW, DL,
8449 getV4X86ShuffleImm8ForMask(PSHUFHalfMask, DAG));
8452 if (M != -1 && M == FixIdx)
8454 else if (M != -1 && M == FixFreeIdx)
8457 if (NumFlippedBToBInputs != 0) {
8459 BToAInputs.size() == 3 ? TripleNonInputIdx : OneInput;
8460 FixFlippedInputs(BPinnedIdx, BDWord, BToBInputs);
8462 assert(NumFlippedAToBInputs != 0 && "Impossible given predicates!");
8464 AToAInputs.size() == 3 ? TripleNonInputIdx : OneInput;
8465 FixFlippedInputs(APinnedIdx, ADWord, AToBInputs);
8470 int PSHUFDMask[] = {0, 1, 2, 3};
8471 PSHUFDMask[ADWord] = BDWord;
8472 PSHUFDMask[BDWord] = ADWord;
8473 V = DAG.getNode(ISD::BITCAST, DL, MVT::v8i16,
8474 DAG.getNode(X86ISD::PSHUFD, DL, MVT::v4i32,
8475 DAG.getNode(ISD::BITCAST, DL, MVT::v4i32, V),
8476 getV4X86ShuffleImm8ForMask(PSHUFDMask, DAG)));
8478 // Adjust the mask to match the new locations of A and B.
8480 if (M != -1 && M/2 == ADWord)
8481 M = 2 * BDWord + M % 2;
8482 else if (M != -1 && M/2 == BDWord)
8483 M = 2 * ADWord + M % 2;
8485 // Recurse back into this routine to re-compute state now that this isn't
8486 // a 3 and 1 problem.
8487 return DAG.getVectorShuffle(MVT::v8i16, DL, V, DAG.getUNDEF(MVT::v8i16),
8490 if ((NumLToL == 3 && NumHToL == 1) || (NumLToL == 1 && NumHToL == 3))
8491 return balanceSides(LToLInputs, HToLInputs, HToHInputs, LToHInputs, 0, 4);
8492 else if ((NumHToH == 3 && NumLToH == 1) || (NumHToH == 1 && NumLToH == 3))
8493 return balanceSides(HToHInputs, LToHInputs, LToLInputs, HToLInputs, 4, 0);
8495 // At this point there are at most two inputs to the low and high halves from
8496 // each half. That means the inputs can always be grouped into dwords and
8497 // those dwords can then be moved to the correct half with a dword shuffle.
8498 // We use at most one low and one high word shuffle to collect these paired
8499 // inputs into dwords, and finally a dword shuffle to place them.
8500 int PSHUFLMask[4] = {-1, -1, -1, -1};
8501 int PSHUFHMask[4] = {-1, -1, -1, -1};
8502 int PSHUFDMask[4] = {-1, -1, -1, -1};
8504 // First fix the masks for all the inputs that are staying in their
8505 // original halves. This will then dictate the targets of the cross-half
8507 auto fixInPlaceInputs =
8508 [&PSHUFDMask](ArrayRef<int> InPlaceInputs, ArrayRef<int> IncomingInputs,
8509 MutableArrayRef<int> SourceHalfMask,
8510 MutableArrayRef<int> HalfMask, int HalfOffset) {
8511 if (InPlaceInputs.empty())
8513 if (InPlaceInputs.size() == 1) {
8514 SourceHalfMask[InPlaceInputs[0] - HalfOffset] =
8515 InPlaceInputs[0] - HalfOffset;
8516 PSHUFDMask[InPlaceInputs[0] / 2] = InPlaceInputs[0] / 2;
8519 if (IncomingInputs.empty()) {
8520 // Just fix all of the in place inputs.
8521 for (int Input : InPlaceInputs) {
8522 SourceHalfMask[Input - HalfOffset] = Input - HalfOffset;
8523 PSHUFDMask[Input / 2] = Input / 2;
8528 assert(InPlaceInputs.size() == 2 && "Cannot handle 3 or 4 inputs!");
8529 SourceHalfMask[InPlaceInputs[0] - HalfOffset] =
8530 InPlaceInputs[0] - HalfOffset;
8531 // Put the second input next to the first so that they are packed into
8532 // a dword. We find the adjacent index by toggling the low bit.
8533 int AdjIndex = InPlaceInputs[0] ^ 1;
8534 SourceHalfMask[AdjIndex - HalfOffset] = InPlaceInputs[1] - HalfOffset;
8535 std::replace(HalfMask.begin(), HalfMask.end(), InPlaceInputs[1], AdjIndex);
8536 PSHUFDMask[AdjIndex / 2] = AdjIndex / 2;
8538 fixInPlaceInputs(LToLInputs, HToLInputs, PSHUFLMask, LoMask, 0);
8539 fixInPlaceInputs(HToHInputs, LToHInputs, PSHUFHMask, HiMask, 4);
8541 // Now gather the cross-half inputs and place them into a free dword of
8542 // their target half.
8543 // FIXME: This operation could almost certainly be simplified dramatically to
8544 // look more like the 3-1 fixing operation.
8545 auto moveInputsToRightHalf = [&PSHUFDMask](
8546 MutableArrayRef<int> IncomingInputs, ArrayRef<int> ExistingInputs,
8547 MutableArrayRef<int> SourceHalfMask, MutableArrayRef<int> HalfMask,
8548 MutableArrayRef<int> FinalSourceHalfMask, int SourceOffset,
8550 auto isWordClobbered = [](ArrayRef<int> SourceHalfMask, int Word) {
8551 return SourceHalfMask[Word] != -1 && SourceHalfMask[Word] != Word;
8553 auto isDWordClobbered = [&isWordClobbered](ArrayRef<int> SourceHalfMask,
8555 int LowWord = Word & ~1;
8556 int HighWord = Word | 1;
8557 return isWordClobbered(SourceHalfMask, LowWord) ||
8558 isWordClobbered(SourceHalfMask, HighWord);
8561 if (IncomingInputs.empty())
8564 if (ExistingInputs.empty()) {
8565 // Map any dwords with inputs from them into the right half.
8566 for (int Input : IncomingInputs) {
8567 // If the source half mask maps over the inputs, turn those into
8568 // swaps and use the swapped lane.
8569 if (isWordClobbered(SourceHalfMask, Input - SourceOffset)) {
8570 if (SourceHalfMask[SourceHalfMask[Input - SourceOffset]] == -1) {
8571 SourceHalfMask[SourceHalfMask[Input - SourceOffset]] =
8572 Input - SourceOffset;
8573 // We have to swap the uses in our half mask in one sweep.
8574 for (int &M : HalfMask)
8575 if (M == SourceHalfMask[Input - SourceOffset] + SourceOffset)
8577 else if (M == Input)
8578 M = SourceHalfMask[Input - SourceOffset] + SourceOffset;
8580 assert(SourceHalfMask[SourceHalfMask[Input - SourceOffset]] ==
8581 Input - SourceOffset &&
8582 "Previous placement doesn't match!");
8584 // Note that this correctly re-maps both when we do a swap and when
8585 // we observe the other side of the swap above. We rely on that to
8586 // avoid swapping the members of the input list directly.
8587 Input = SourceHalfMask[Input - SourceOffset] + SourceOffset;
8590 // Map the input's dword into the correct half.
8591 if (PSHUFDMask[(Input - SourceOffset + DestOffset) / 2] == -1)
8592 PSHUFDMask[(Input - SourceOffset + DestOffset) / 2] = Input / 2;
8594 assert(PSHUFDMask[(Input - SourceOffset + DestOffset) / 2] ==
8596 "Previous placement doesn't match!");
8599 // And just directly shift any other-half mask elements to be same-half
8600 // as we will have mirrored the dword containing the element into the
8601 // same position within that half.
8602 for (int &M : HalfMask)
8603 if (M >= SourceOffset && M < SourceOffset + 4) {
8604 M = M - SourceOffset + DestOffset;
8605 assert(M >= 0 && "This should never wrap below zero!");
8610 // Ensure we have the input in a viable dword of its current half. This
8611 // is particularly tricky because the original position may be clobbered
8612 // by inputs being moved and *staying* in that half.
8613 if (IncomingInputs.size() == 1) {
8614 if (isWordClobbered(SourceHalfMask, IncomingInputs[0] - SourceOffset)) {
8615 int InputFixed = std::find(std::begin(SourceHalfMask),
8616 std::end(SourceHalfMask), -1) -
8617 std::begin(SourceHalfMask) + SourceOffset;
8618 SourceHalfMask[InputFixed - SourceOffset] =
8619 IncomingInputs[0] - SourceOffset;
8620 std::replace(HalfMask.begin(), HalfMask.end(), IncomingInputs[0],
8622 IncomingInputs[0] = InputFixed;
8624 } else if (IncomingInputs.size() == 2) {
8625 if (IncomingInputs[0] / 2 != IncomingInputs[1] / 2 ||
8626 isDWordClobbered(SourceHalfMask, IncomingInputs[0] - SourceOffset)) {
8627 // We have two non-adjacent or clobbered inputs we need to extract from
8628 // the source half. To do this, we need to map them into some adjacent
8629 // dword slot in the source mask.
8630 int InputsFixed[2] = {IncomingInputs[0] - SourceOffset,
8631 IncomingInputs[1] - SourceOffset};
8633 // If there is a free slot in the source half mask adjacent to one of
8634 // the inputs, place the other input in it. We use (Index XOR 1) to
8635 // compute an adjacent index.
8636 if (!isWordClobbered(SourceHalfMask, InputsFixed[0]) &&
8637 SourceHalfMask[InputsFixed[0] ^ 1] == -1) {
8638 SourceHalfMask[InputsFixed[0]] = InputsFixed[0];
8639 SourceHalfMask[InputsFixed[0] ^ 1] = InputsFixed[1];
8640 InputsFixed[1] = InputsFixed[0] ^ 1;
8641 } else if (!isWordClobbered(SourceHalfMask, InputsFixed[1]) &&
8642 SourceHalfMask[InputsFixed[1] ^ 1] == -1) {
8643 SourceHalfMask[InputsFixed[1]] = InputsFixed[1];
8644 SourceHalfMask[InputsFixed[1] ^ 1] = InputsFixed[0];
8645 InputsFixed[0] = InputsFixed[1] ^ 1;
8646 } else if (SourceHalfMask[2 * ((InputsFixed[0] / 2) ^ 1)] == -1 &&
8647 SourceHalfMask[2 * ((InputsFixed[0] / 2) ^ 1) + 1] == -1) {
8648 // The two inputs are in the same DWord but it is clobbered and the
8649 // adjacent DWord isn't used at all. Move both inputs to the free
8651 SourceHalfMask[2 * ((InputsFixed[0] / 2) ^ 1)] = InputsFixed[0];
8652 SourceHalfMask[2 * ((InputsFixed[0] / 2) ^ 1) + 1] = InputsFixed[1];
8653 InputsFixed[0] = 2 * ((InputsFixed[0] / 2) ^ 1);
8654 InputsFixed[1] = 2 * ((InputsFixed[0] / 2) ^ 1) + 1;
8656 // The only way we hit this point is if there is no clobbering
8657 // (because there are no off-half inputs to this half) and there is no
8658 // free slot adjacent to one of the inputs. In this case, we have to
8659 // swap an input with a non-input.
8660 for (int i = 0; i < 4; ++i)
8661 assert((SourceHalfMask[i] == -1 || SourceHalfMask[i] == i) &&
8662 "We can't handle any clobbers here!");
8663 assert(InputsFixed[1] != (InputsFixed[0] ^ 1) &&
8664 "Cannot have adjacent inputs here!");
8666 SourceHalfMask[InputsFixed[0] ^ 1] = InputsFixed[1];
8667 SourceHalfMask[InputsFixed[1]] = InputsFixed[0] ^ 1;
8669 // We also have to update the final source mask in this case because
8670 // it may need to undo the above swap.
8671 for (int &M : FinalSourceHalfMask)
8672 if (M == (InputsFixed[0] ^ 1) + SourceOffset)
8673 M = InputsFixed[1] + SourceOffset;
8674 else if (M == InputsFixed[1] + SourceOffset)
8675 M = (InputsFixed[0] ^ 1) + SourceOffset;
8677 InputsFixed[1] = InputsFixed[0] ^ 1;
8680 // Point everything at the fixed inputs.
8681 for (int &M : HalfMask)
8682 if (M == IncomingInputs[0])
8683 M = InputsFixed[0] + SourceOffset;
8684 else if (M == IncomingInputs[1])
8685 M = InputsFixed[1] + SourceOffset;
8687 IncomingInputs[0] = InputsFixed[0] + SourceOffset;
8688 IncomingInputs[1] = InputsFixed[1] + SourceOffset;
8691 llvm_unreachable("Unhandled input size!");
8694 // Now hoist the DWord down to the right half.
8695 int FreeDWord = (PSHUFDMask[DestOffset / 2] == -1 ? 0 : 1) + DestOffset / 2;
8696 assert(PSHUFDMask[FreeDWord] == -1 && "DWord not free");
8697 PSHUFDMask[FreeDWord] = IncomingInputs[0] / 2;
8698 for (int &M : HalfMask)
8699 for (int Input : IncomingInputs)
8701 M = FreeDWord * 2 + Input % 2;
8703 moveInputsToRightHalf(HToLInputs, LToLInputs, PSHUFHMask, LoMask, HiMask,
8704 /*SourceOffset*/ 4, /*DestOffset*/ 0);
8705 moveInputsToRightHalf(LToHInputs, HToHInputs, PSHUFLMask, HiMask, LoMask,
8706 /*SourceOffset*/ 0, /*DestOffset*/ 4);
8708 // Now enact all the shuffles we've computed to move the inputs into their
8710 if (!isNoopShuffleMask(PSHUFLMask))
8711 V = DAG.getNode(X86ISD::PSHUFLW, DL, MVT::v8i16, V,
8712 getV4X86ShuffleImm8ForMask(PSHUFLMask, DAG));
8713 if (!isNoopShuffleMask(PSHUFHMask))
8714 V = DAG.getNode(X86ISD::PSHUFHW, DL, MVT::v8i16, V,
8715 getV4X86ShuffleImm8ForMask(PSHUFHMask, DAG));
8716 if (!isNoopShuffleMask(PSHUFDMask))
8717 V = DAG.getNode(ISD::BITCAST, DL, MVT::v8i16,
8718 DAG.getNode(X86ISD::PSHUFD, DL, MVT::v4i32,
8719 DAG.getNode(ISD::BITCAST, DL, MVT::v4i32, V),
8720 getV4X86ShuffleImm8ForMask(PSHUFDMask, DAG)));
8722 // At this point, each half should contain all its inputs, and we can then
8723 // just shuffle them into their final position.
8724 assert(std::count_if(LoMask.begin(), LoMask.end(),
8725 [](int M) { return M >= 4; }) == 0 &&
8726 "Failed to lift all the high half inputs to the low mask!");
8727 assert(std::count_if(HiMask.begin(), HiMask.end(),
8728 [](int M) { return M >= 0 && M < 4; }) == 0 &&
8729 "Failed to lift all the low half inputs to the high mask!");
8731 // Do a half shuffle for the low mask.
8732 if (!isNoopShuffleMask(LoMask))
8733 V = DAG.getNode(X86ISD::PSHUFLW, DL, MVT::v8i16, V,
8734 getV4X86ShuffleImm8ForMask(LoMask, DAG));
8736 // Do a half shuffle with the high mask after shifting its values down.
8737 for (int &M : HiMask)
8740 if (!isNoopShuffleMask(HiMask))
8741 V = DAG.getNode(X86ISD::PSHUFHW, DL, MVT::v8i16, V,
8742 getV4X86ShuffleImm8ForMask(HiMask, DAG));
8747 /// \brief Detect whether the mask pattern should be lowered through
8750 /// This essentially tests whether viewing the mask as an interleaving of two
8751 /// sub-sequences reduces the cross-input traffic of a blend operation. If so,
8752 /// lowering it through interleaving is a significantly better strategy.
8753 static bool shouldLowerAsInterleaving(ArrayRef<int> Mask) {
8754 int NumEvenInputs[2] = {0, 0};
8755 int NumOddInputs[2] = {0, 0};
8756 int NumLoInputs[2] = {0, 0};
8757 int NumHiInputs[2] = {0, 0};
8758 for (int i = 0, Size = Mask.size(); i < Size; ++i) {
8762 int InputIdx = Mask[i] >= Size;
8765 ++NumLoInputs[InputIdx];
8767 ++NumHiInputs[InputIdx];
8770 ++NumEvenInputs[InputIdx];
8772 ++NumOddInputs[InputIdx];
8775 // The minimum number of cross-input results for both the interleaved and
8776 // split cases. If interleaving results in fewer cross-input results, return
8778 int InterleavedCrosses = std::min(NumEvenInputs[1] + NumOddInputs[0],
8779 NumEvenInputs[0] + NumOddInputs[1]);
8780 int SplitCrosses = std::min(NumLoInputs[1] + NumHiInputs[0],
8781 NumLoInputs[0] + NumHiInputs[1]);
8782 return InterleavedCrosses < SplitCrosses;
8785 /// \brief Blend two v8i16 vectors using a naive unpack strategy.
8787 /// This strategy only works when the inputs from each vector fit into a single
8788 /// half of that vector, and generally there are not so many inputs as to leave
8789 /// the in-place shuffles required highly constrained (and thus expensive). It
8790 /// shifts all the inputs into a single side of both input vectors and then
8791 /// uses an unpack to interleave these inputs in a single vector. At that
8792 /// point, we will fall back on the generic single input shuffle lowering.
8793 static SDValue lowerV8I16BasicBlendVectorShuffle(SDLoc DL, SDValue V1,
8795 MutableArrayRef<int> Mask,
8796 const X86Subtarget *Subtarget,
8797 SelectionDAG &DAG) {
8798 assert(V1.getSimpleValueType() == MVT::v8i16 && "Bad input type!");
8799 assert(V2.getSimpleValueType() == MVT::v8i16 && "Bad input type!");
8800 SmallVector<int, 3> LoV1Inputs, HiV1Inputs, LoV2Inputs, HiV2Inputs;
8801 for (int i = 0; i < 8; ++i)
8802 if (Mask[i] >= 0 && Mask[i] < 4)
8803 LoV1Inputs.push_back(i);
8804 else if (Mask[i] >= 4 && Mask[i] < 8)
8805 HiV1Inputs.push_back(i);
8806 else if (Mask[i] >= 8 && Mask[i] < 12)
8807 LoV2Inputs.push_back(i);
8808 else if (Mask[i] >= 12)
8809 HiV2Inputs.push_back(i);
8811 int NumV1Inputs = LoV1Inputs.size() + HiV1Inputs.size();
8812 int NumV2Inputs = LoV2Inputs.size() + HiV2Inputs.size();
8815 assert(NumV1Inputs > 0 && NumV1Inputs <= 3 && "At most 3 inputs supported");
8816 assert(NumV2Inputs > 0 && NumV2Inputs <= 3 && "At most 3 inputs supported");
8817 assert(NumV1Inputs + NumV2Inputs <= 4 && "At most 4 combined inputs");
8819 bool MergeFromLo = LoV1Inputs.size() + LoV2Inputs.size() >=
8820 HiV1Inputs.size() + HiV2Inputs.size();
8822 auto moveInputsToHalf = [&](SDValue V, ArrayRef<int> LoInputs,
8823 ArrayRef<int> HiInputs, bool MoveToLo,
8825 ArrayRef<int> GoodInputs = MoveToLo ? LoInputs : HiInputs;
8826 ArrayRef<int> BadInputs = MoveToLo ? HiInputs : LoInputs;
8827 if (BadInputs.empty())
8830 int MoveMask[] = {-1, -1, -1, -1, -1, -1, -1, -1};
8831 int MoveOffset = MoveToLo ? 0 : 4;
8833 if (GoodInputs.empty()) {
8834 for (int BadInput : BadInputs) {
8835 MoveMask[Mask[BadInput] % 4 + MoveOffset] = Mask[BadInput] - MaskOffset;
8836 Mask[BadInput] = Mask[BadInput] % 4 + MoveOffset + MaskOffset;
8839 if (GoodInputs.size() == 2) {
8840 // If the low inputs are spread across two dwords, pack them into
8842 MoveMask[MoveOffset] = Mask[GoodInputs[0]] - MaskOffset;
8843 MoveMask[MoveOffset + 1] = Mask[GoodInputs[1]] - MaskOffset;
8844 Mask[GoodInputs[0]] = MoveOffset + MaskOffset;
8845 Mask[GoodInputs[1]] = MoveOffset + 1 + MaskOffset;
8847 // Otherwise pin the good inputs.
8848 for (int GoodInput : GoodInputs)
8849 MoveMask[Mask[GoodInput] - MaskOffset] = Mask[GoodInput] - MaskOffset;
8852 if (BadInputs.size() == 2) {
8853 // If we have two bad inputs then there may be either one or two good
8854 // inputs fixed in place. Find a fixed input, and then find the *other*
8855 // two adjacent indices by using modular arithmetic.
8857 std::find_if(std::begin(MoveMask) + MoveOffset, std::end(MoveMask),
8858 [](int M) { return M >= 0; }) -
8859 std::begin(MoveMask);
8861 ((((GoodMaskIdx - MoveOffset) & ~1) + 2) % 4) + MoveOffset;
8862 assert(MoveMask[MoveMaskIdx] == -1 && "Expected empty slot");
8863 assert(MoveMask[MoveMaskIdx + 1] == -1 && "Expected empty slot");
8864 MoveMask[MoveMaskIdx] = Mask[BadInputs[0]] - MaskOffset;
8865 MoveMask[MoveMaskIdx + 1] = Mask[BadInputs[1]] - MaskOffset;
8866 Mask[BadInputs[0]] = MoveMaskIdx + MaskOffset;
8867 Mask[BadInputs[1]] = MoveMaskIdx + 1 + MaskOffset;
8869 assert(BadInputs.size() == 1 && "All sizes handled");
8870 int MoveMaskIdx = std::find(std::begin(MoveMask) + MoveOffset,
8871 std::end(MoveMask), -1) -
8872 std::begin(MoveMask);
8873 MoveMask[MoveMaskIdx] = Mask[BadInputs[0]] - MaskOffset;
8874 Mask[BadInputs[0]] = MoveMaskIdx + MaskOffset;
8878 return DAG.getVectorShuffle(MVT::v8i16, DL, V, DAG.getUNDEF(MVT::v8i16),
8881 V1 = moveInputsToHalf(V1, LoV1Inputs, HiV1Inputs, MergeFromLo,
8883 V2 = moveInputsToHalf(V2, LoV2Inputs, HiV2Inputs, MergeFromLo,
8886 // FIXME: Select an interleaving of the merge of V1 and V2 that minimizes
8887 // cross-half traffic in the final shuffle.
8889 // Munge the mask to be a single-input mask after the unpack merges the
8893 M = 2 * (M % 4) + (M / 8);
8895 return DAG.getVectorShuffle(
8896 MVT::v8i16, DL, DAG.getNode(MergeFromLo ? X86ISD::UNPCKL : X86ISD::UNPCKH,
8897 DL, MVT::v8i16, V1, V2),
8898 DAG.getUNDEF(MVT::v8i16), Mask);
8901 /// \brief Generic lowering of 8-lane i16 shuffles.
8903 /// This handles both single-input shuffles and combined shuffle/blends with
8904 /// two inputs. The single input shuffles are immediately delegated to
8905 /// a dedicated lowering routine.
8907 /// The blends are lowered in one of three fundamental ways. If there are few
8908 /// enough inputs, it delegates to a basic UNPCK-based strategy. If the shuffle
8909 /// of the input is significantly cheaper when lowered as an interleaving of
8910 /// the two inputs, try to interleave them. Otherwise, blend the low and high
8911 /// halves of the inputs separately (making them have relatively few inputs)
8912 /// and then concatenate them.
8913 static SDValue lowerV8I16VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
8914 const X86Subtarget *Subtarget,
8915 SelectionDAG &DAG) {
8917 assert(Op.getSimpleValueType() == MVT::v8i16 && "Bad shuffle type!");
8918 assert(V1.getSimpleValueType() == MVT::v8i16 && "Bad operand type!");
8919 assert(V2.getSimpleValueType() == MVT::v8i16 && "Bad operand type!");
8920 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
8921 ArrayRef<int> OrigMask = SVOp->getMask();
8922 int MaskStorage[8] = {OrigMask[0], OrigMask[1], OrigMask[2], OrigMask[3],
8923 OrigMask[4], OrigMask[5], OrigMask[6], OrigMask[7]};
8924 MutableArrayRef<int> Mask(MaskStorage);
8926 assert(Mask.size() == 8 && "Unexpected mask size for v8 shuffle!");
8928 // Whenever we can lower this as a zext, that instruction is strictly faster
8929 // than any alternative.
8930 if (SDValue ZExt = lowerVectorShuffleAsZeroOrAnyExtend(
8931 DL, MVT::v8i16, V1, V2, OrigMask, Subtarget, DAG))
8934 auto isV1 = [](int M) { return M >= 0 && M < 8; };
8935 auto isV2 = [](int M) { return M >= 8; };
8937 int NumV1Inputs = std::count_if(Mask.begin(), Mask.end(), isV1);
8938 int NumV2Inputs = std::count_if(Mask.begin(), Mask.end(), isV2);
8940 if (NumV2Inputs == 0)
8941 return lowerV8I16SingleInputVectorShuffle(DL, V1, Mask, Subtarget, DAG);
8943 assert(NumV1Inputs > 0 && "All single-input shuffles should be canonicalized "
8944 "to be V1-input shuffles.");
8946 // There are special ways we can lower some single-element blends.
8947 if (NumV2Inputs == 1)
8948 if (SDValue V = lowerVectorShuffleAsElementInsertion(MVT::v8i16, DL, V1, V2,
8949 Mask, Subtarget, DAG))
8952 if (Subtarget->hasSSE41())
8953 if (SDValue Blend = lowerVectorShuffleAsBlend(DL, MVT::v8i16, V1, V2, Mask,
8957 // Try to use rotation instructions if available.
8958 if (Subtarget->hasSSSE3())
8959 if (SDValue Rotate = lowerVectorShuffleAsByteRotate(DL, MVT::v8i16, V1, V2, Mask, DAG))
8962 if (NumV1Inputs + NumV2Inputs <= 4)
8963 return lowerV8I16BasicBlendVectorShuffle(DL, V1, V2, Mask, Subtarget, DAG);
8965 // Check whether an interleaving lowering is likely to be more efficient.
8966 // This isn't perfect but it is a strong heuristic that tends to work well on
8967 // the kinds of shuffles that show up in practice.
8969 // FIXME: Handle 1x, 2x, and 4x interleaving.
8970 if (shouldLowerAsInterleaving(Mask)) {
8971 // FIXME: Figure out whether we should pack these into the low or high
8974 int EMask[8], OMask[8];
8975 for (int i = 0; i < 4; ++i) {
8976 EMask[i] = Mask[2*i];
8977 OMask[i] = Mask[2*i + 1];
8982 SDValue Evens = DAG.getVectorShuffle(MVT::v8i16, DL, V1, V2, EMask);
8983 SDValue Odds = DAG.getVectorShuffle(MVT::v8i16, DL, V1, V2, OMask);
8985 return DAG.getNode(X86ISD::UNPCKL, DL, MVT::v8i16, Evens, Odds);
8988 int LoBlendMask[8] = {-1, -1, -1, -1, -1, -1, -1, -1};
8989 int HiBlendMask[8] = {-1, -1, -1, -1, -1, -1, -1, -1};
8991 for (int i = 0; i < 4; ++i) {
8992 LoBlendMask[i] = Mask[i];
8993 HiBlendMask[i] = Mask[i + 4];
8996 SDValue LoV = DAG.getVectorShuffle(MVT::v8i16, DL, V1, V2, LoBlendMask);
8997 SDValue HiV = DAG.getVectorShuffle(MVT::v8i16, DL, V1, V2, HiBlendMask);
8998 LoV = DAG.getNode(ISD::BITCAST, DL, MVT::v2i64, LoV);
8999 HiV = DAG.getNode(ISD::BITCAST, DL, MVT::v2i64, HiV);
9001 return DAG.getNode(ISD::BITCAST, DL, MVT::v8i16,
9002 DAG.getNode(X86ISD::UNPCKL, DL, MVT::v2i64, LoV, HiV));
9005 /// \brief Check whether a compaction lowering can be done by dropping even
9006 /// elements and compute how many times even elements must be dropped.
9008 /// This handles shuffles which take every Nth element where N is a power of
9009 /// two. Example shuffle masks:
9011 /// N = 1: 0, 2, 4, 6, 8, 10, 12, 14, 0, 2, 4, 6, 8, 10, 12, 14
9012 /// N = 1: 0, 2, 4, 6, 8, 10, 12, 14, 16, 18, 20, 22, 24, 26, 28, 30
9013 /// N = 2: 0, 4, 8, 12, 0, 4, 8, 12, 0, 4, 8, 12, 0, 4, 8, 12
9014 /// N = 2: 0, 4, 8, 12, 16, 20, 24, 28, 0, 4, 8, 12, 16, 20, 24, 28
9015 /// N = 3: 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8
9016 /// N = 3: 0, 8, 16, 24, 0, 8, 16, 24, 0, 8, 16, 24, 0, 8, 16, 24
9018 /// Any of these lanes can of course be undef.
9020 /// This routine only supports N <= 3.
9021 /// FIXME: Evaluate whether either AVX or AVX-512 have any opportunities here
9024 /// \returns N above, or the number of times even elements must be dropped if
9025 /// there is such a number. Otherwise returns zero.
9026 static int canLowerByDroppingEvenElements(ArrayRef<int> Mask) {
9027 // Figure out whether we're looping over two inputs or just one.
9028 bool IsSingleInput = isSingleInputShuffleMask(Mask);
9030 // The modulus for the shuffle vector entries is based on whether this is
9031 // a single input or not.
9032 int ShuffleModulus = Mask.size() * (IsSingleInput ? 1 : 2);
9033 assert(isPowerOf2_32((uint32_t)ShuffleModulus) &&
9034 "We should only be called with masks with a power-of-2 size!");
9036 uint64_t ModMask = (uint64_t)ShuffleModulus - 1;
9038 // We track whether the input is viable for all power-of-2 strides 2^1, 2^2,
9039 // and 2^3 simultaneously. This is because we may have ambiguity with
9040 // partially undef inputs.
9041 bool ViableForN[3] = {true, true, true};
9043 for (int i = 0, e = Mask.size(); i < e; ++i) {
9044 // Ignore undef lanes, we'll optimistically collapse them to the pattern we
9049 bool IsAnyViable = false;
9050 for (unsigned j = 0; j != array_lengthof(ViableForN); ++j)
9051 if (ViableForN[j]) {
9054 // The shuffle mask must be equal to (i * 2^N) % M.
9055 if ((uint64_t)Mask[i] == (((uint64_t)i << N) & ModMask))
9058 ViableForN[j] = false;
9060 // Early exit if we exhaust the possible powers of two.
9065 for (unsigned j = 0; j != array_lengthof(ViableForN); ++j)
9069 // Return 0 as there is no viable power of two.
9073 /// \brief Generic lowering of v16i8 shuffles.
9075 /// This is a hybrid strategy to lower v16i8 vectors. It first attempts to
9076 /// detect any complexity reducing interleaving. If that doesn't help, it uses
9077 /// UNPCK to spread the i8 elements across two i16-element vectors, and uses
9078 /// the existing lowering for v8i16 blends on each half, finally PACK-ing them
9080 static SDValue lowerV16I8VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
9081 const X86Subtarget *Subtarget,
9082 SelectionDAG &DAG) {
9084 assert(Op.getSimpleValueType() == MVT::v16i8 && "Bad shuffle type!");
9085 assert(V1.getSimpleValueType() == MVT::v16i8 && "Bad operand type!");
9086 assert(V2.getSimpleValueType() == MVT::v16i8 && "Bad operand type!");
9087 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
9088 ArrayRef<int> OrigMask = SVOp->getMask();
9089 assert(OrigMask.size() == 16 && "Unexpected mask size for v16 shuffle!");
9091 // Try to use rotation instructions if available.
9092 if (Subtarget->hasSSSE3())
9093 if (SDValue Rotate = lowerVectorShuffleAsByteRotate(DL, MVT::v16i8, V1, V2,
9097 // Try to use a zext lowering.
9098 if (SDValue ZExt = lowerVectorShuffleAsZeroOrAnyExtend(
9099 DL, MVT::v16i8, V1, V2, OrigMask, Subtarget, DAG))
9102 int MaskStorage[16] = {
9103 OrigMask[0], OrigMask[1], OrigMask[2], OrigMask[3],
9104 OrigMask[4], OrigMask[5], OrigMask[6], OrigMask[7],
9105 OrigMask[8], OrigMask[9], OrigMask[10], OrigMask[11],
9106 OrigMask[12], OrigMask[13], OrigMask[14], OrigMask[15]};
9107 MutableArrayRef<int> Mask(MaskStorage);
9108 MutableArrayRef<int> LoMask = Mask.slice(0, 8);
9109 MutableArrayRef<int> HiMask = Mask.slice(8, 8);
9112 std::count_if(Mask.begin(), Mask.end(), [](int M) { return M >= 16; });
9114 // For single-input shuffles, there are some nicer lowering tricks we can use.
9115 if (NumV2Elements == 0) {
9116 // Check for being able to broadcast a single element.
9117 if (SDValue Broadcast = lowerVectorShuffleAsBroadcast(MVT::v16i8, DL, V1,
9118 Mask, Subtarget, DAG))
9121 // Check whether we can widen this to an i16 shuffle by duplicating bytes.
9122 // Notably, this handles splat and partial-splat shuffles more efficiently.
9123 // However, it only makes sense if the pre-duplication shuffle simplifies
9124 // things significantly. Currently, this means we need to be able to
9125 // express the pre-duplication shuffle as an i16 shuffle.
9127 // FIXME: We should check for other patterns which can be widened into an
9128 // i16 shuffle as well.
9129 auto canWidenViaDuplication = [](ArrayRef<int> Mask) {
9130 for (int i = 0; i < 16; i += 2)
9131 if (Mask[i] != -1 && Mask[i + 1] != -1 && Mask[i] != Mask[i + 1])
9136 auto tryToWidenViaDuplication = [&]() -> SDValue {
9137 if (!canWidenViaDuplication(Mask))
9139 SmallVector<int, 4> LoInputs;
9140 std::copy_if(Mask.begin(), Mask.end(), std::back_inserter(LoInputs),
9141 [](int M) { return M >= 0 && M < 8; });
9142 std::sort(LoInputs.begin(), LoInputs.end());
9143 LoInputs.erase(std::unique(LoInputs.begin(), LoInputs.end()),
9145 SmallVector<int, 4> HiInputs;
9146 std::copy_if(Mask.begin(), Mask.end(), std::back_inserter(HiInputs),
9147 [](int M) { return M >= 8; });
9148 std::sort(HiInputs.begin(), HiInputs.end());
9149 HiInputs.erase(std::unique(HiInputs.begin(), HiInputs.end()),
9152 bool TargetLo = LoInputs.size() >= HiInputs.size();
9153 ArrayRef<int> InPlaceInputs = TargetLo ? LoInputs : HiInputs;
9154 ArrayRef<int> MovingInputs = TargetLo ? HiInputs : LoInputs;
9156 int PreDupI16Shuffle[] = {-1, -1, -1, -1, -1, -1, -1, -1};
9157 SmallDenseMap<int, int, 8> LaneMap;
9158 for (int I : InPlaceInputs) {
9159 PreDupI16Shuffle[I/2] = I/2;
9162 int j = TargetLo ? 0 : 4, je = j + 4;
9163 for (int i = 0, ie = MovingInputs.size(); i < ie; ++i) {
9164 // Check if j is already a shuffle of this input. This happens when
9165 // there are two adjacent bytes after we move the low one.
9166 if (PreDupI16Shuffle[j] != MovingInputs[i] / 2) {
9167 // If we haven't yet mapped the input, search for a slot into which
9169 while (j < je && PreDupI16Shuffle[j] != -1)
9173 // We can't place the inputs into a single half with a simple i16 shuffle, so bail.
9176 // Map this input with the i16 shuffle.
9177 PreDupI16Shuffle[j] = MovingInputs[i] / 2;
9180 // Update the lane map based on the mapping we ended up with.
9181 LaneMap[MovingInputs[i]] = 2 * j + MovingInputs[i] % 2;
9184 ISD::BITCAST, DL, MVT::v16i8,
9185 DAG.getVectorShuffle(MVT::v8i16, DL,
9186 DAG.getNode(ISD::BITCAST, DL, MVT::v8i16, V1),
9187 DAG.getUNDEF(MVT::v8i16), PreDupI16Shuffle));
9189 // Unpack the bytes to form the i16s that will be shuffled into place.
9190 V1 = DAG.getNode(TargetLo ? X86ISD::UNPCKL : X86ISD::UNPCKH, DL,
9191 MVT::v16i8, V1, V1);
9193 int PostDupI16Shuffle[8] = {-1, -1, -1, -1, -1, -1, -1, -1};
9194 for (int i = 0; i < 16; ++i)
9195 if (Mask[i] != -1) {
9196 int MappedMask = LaneMap[Mask[i]] - (TargetLo ? 0 : 8);
9197 assert(MappedMask < 8 && "Invalid v8 shuffle mask!");
9198 if (PostDupI16Shuffle[i / 2] == -1)
9199 PostDupI16Shuffle[i / 2] = MappedMask;
9201 assert(PostDupI16Shuffle[i / 2] == MappedMask &&
9202 "Conflicting entrties in the original shuffle!");
9205 ISD::BITCAST, DL, MVT::v16i8,
9206 DAG.getVectorShuffle(MVT::v8i16, DL,
9207 DAG.getNode(ISD::BITCAST, DL, MVT::v8i16, V1),
9208 DAG.getUNDEF(MVT::v8i16), PostDupI16Shuffle));
9210 if (SDValue V = tryToWidenViaDuplication())
9214 // Check whether an interleaving lowering is likely to be more efficient.
9215 // This isn't perfect but it is a strong heuristic that tends to work well on
9216 // the kinds of shuffles that show up in practice.
9218 // FIXME: We need to handle other interleaving widths (i16, i32, ...).
9219 if (shouldLowerAsInterleaving(Mask)) {
9220 // FIXME: Figure out whether we should pack these into the low or high
9223 int EMask[16], OMask[16];
9224 for (int i = 0; i < 8; ++i) {
9225 EMask[i] = Mask[2*i];
9226 OMask[i] = Mask[2*i + 1];
9231 SDValue Evens = DAG.getVectorShuffle(MVT::v16i8, DL, V1, V2, EMask);
9232 SDValue Odds = DAG.getVectorShuffle(MVT::v16i8, DL, V1, V2, OMask);
9234 return DAG.getNode(X86ISD::UNPCKL, DL, MVT::v16i8, Evens, Odds);
9237 // Check for SSSE3 which lets us lower all v16i8 shuffles much more directly
9238 // with PSHUFB. It is important to do this before we attempt to generate any
9239 // blends but after all of the single-input lowerings. If the single input
9240 // lowerings can find an instruction sequence that is faster than a PSHUFB, we
9241 // want to preserve that and we can DAG combine any longer sequences into
9242 // a PSHUFB in the end. But once we start blending from multiple inputs,
9243 // the complexity of DAG combining bad patterns back into PSHUFB is too high,
9244 // and there are *very* few patterns that would actually be faster than the
9245 // PSHUFB approach because of its ability to zero lanes.
9247 // FIXME: The only exceptions to the above are blends which are exact
9248 // interleavings with direct instructions supporting them. We currently don't
9249 // handle those well here.
9250 if (Subtarget->hasSSSE3()) {
9253 for (int i = 0; i < 16; ++i)
9254 if (Mask[i] == -1) {
9255 V1Mask[i] = V2Mask[i] = DAG.getUNDEF(MVT::i8);
9257 V1Mask[i] = DAG.getConstant(Mask[i] < 16 ? Mask[i] : 0x80, MVT::i8);
9259 DAG.getConstant(Mask[i] < 16 ? 0x80 : Mask[i] - 16, MVT::i8);
9261 V1 = DAG.getNode(X86ISD::PSHUFB, DL, MVT::v16i8, V1,
9262 DAG.getNode(ISD::BUILD_VECTOR, DL, MVT::v16i8, V1Mask));
9263 if (isSingleInputShuffleMask(Mask))
9264 return V1; // Single inputs are easy.
9266 // Otherwise, blend the two.
9267 V2 = DAG.getNode(X86ISD::PSHUFB, DL, MVT::v16i8, V2,
9268 DAG.getNode(ISD::BUILD_VECTOR, DL, MVT::v16i8, V2Mask));
9269 return DAG.getNode(ISD::OR, DL, MVT::v16i8, V1, V2);
9272 // There are special ways we can lower some single-element blends.
9273 if (NumV2Elements == 1)
9274 if (SDValue V = lowerVectorShuffleAsElementInsertion(MVT::v16i8, DL, V1, V2,
9275 Mask, Subtarget, DAG))
9278 // Check whether a compaction lowering can be done. This handles shuffles
9279 // which take every Nth element for some even N. See the helper function for
9282 // We special case these as they can be particularly efficiently handled with
9283 // the PACKUSB instruction on x86 and they show up in common patterns of
9284 // rearranging bytes to truncate wide elements.
9285 if (int NumEvenDrops = canLowerByDroppingEvenElements(Mask)) {
9286 // NumEvenDrops is the power of two stride of the elements. Another way of
9287 // thinking about it is that we need to drop the even elements this many
9288 // times to get the original input.
9289 bool IsSingleInput = isSingleInputShuffleMask(Mask);
9291 // First we need to zero all the dropped bytes.
9292 assert(NumEvenDrops <= 3 &&
9293 "No support for dropping even elements more than 3 times.");
9294 // We use the mask type to pick which bytes are preserved based on how many
9295 // elements are dropped.
9296 MVT MaskVTs[] = { MVT::v8i16, MVT::v4i32, MVT::v2i64 };
9297 SDValue ByteClearMask =
9298 DAG.getNode(ISD::BITCAST, DL, MVT::v16i8,
9299 DAG.getConstant(0xFF, MaskVTs[NumEvenDrops - 1]));
9300 V1 = DAG.getNode(ISD::AND, DL, MVT::v16i8, V1, ByteClearMask);
9302 V2 = DAG.getNode(ISD::AND, DL, MVT::v16i8, V2, ByteClearMask);
9304 // Now pack things back together.
9305 V1 = DAG.getNode(ISD::BITCAST, DL, MVT::v8i16, V1);
9306 V2 = IsSingleInput ? V1 : DAG.getNode(ISD::BITCAST, DL, MVT::v8i16, V2);
9307 SDValue Result = DAG.getNode(X86ISD::PACKUS, DL, MVT::v16i8, V1, V2);
9308 for (int i = 1; i < NumEvenDrops; ++i) {
9309 Result = DAG.getNode(ISD::BITCAST, DL, MVT::v8i16, Result);
9310 Result = DAG.getNode(X86ISD::PACKUS, DL, MVT::v16i8, Result, Result);
9316 int V1LoBlendMask[8] = {-1, -1, -1, -1, -1, -1, -1, -1};
9317 int V1HiBlendMask[8] = {-1, -1, -1, -1, -1, -1, -1, -1};
9318 int V2LoBlendMask[8] = {-1, -1, -1, -1, -1, -1, -1, -1};
9319 int V2HiBlendMask[8] = {-1, -1, -1, -1, -1, -1, -1, -1};
9321 auto buildBlendMasks = [](MutableArrayRef<int> HalfMask,
9322 MutableArrayRef<int> V1HalfBlendMask,
9323 MutableArrayRef<int> V2HalfBlendMask) {
9324 for (int i = 0; i < 8; ++i)
9325 if (HalfMask[i] >= 0 && HalfMask[i] < 16) {
9326 V1HalfBlendMask[i] = HalfMask[i];
9328 } else if (HalfMask[i] >= 16) {
9329 V2HalfBlendMask[i] = HalfMask[i] - 16;
9330 HalfMask[i] = i + 8;
9333 buildBlendMasks(LoMask, V1LoBlendMask, V2LoBlendMask);
9334 buildBlendMasks(HiMask, V1HiBlendMask, V2HiBlendMask);
9336 SDValue Zero = getZeroVector(MVT::v8i16, Subtarget, DAG, DL);
9338 auto buildLoAndHiV8s = [&](SDValue V, MutableArrayRef<int> LoBlendMask,
9339 MutableArrayRef<int> HiBlendMask) {
9341 // Check if any of the odd lanes in the v16i8 are used. If not, we can mask
9342 // them out and avoid using UNPCK{L,H} to extract the elements of V as
9344 if (std::none_of(LoBlendMask.begin(), LoBlendMask.end(),
9345 [](int M) { return M >= 0 && M % 2 == 1; }) &&
9346 std::none_of(HiBlendMask.begin(), HiBlendMask.end(),
9347 [](int M) { return M >= 0 && M % 2 == 1; })) {
9348 // Use a mask to drop the high bytes.
9349 V1 = DAG.getNode(ISD::BITCAST, DL, MVT::v8i16, V);
9350 V1 = DAG.getNode(ISD::AND, DL, MVT::v8i16, V1,
9351 DAG.getConstant(0x00FF, MVT::v8i16));
9353 // This will be a single vector shuffle instead of a blend so nuke V2.
9354 V2 = DAG.getUNDEF(MVT::v8i16);
9356 // Squash the masks to point directly into V1.
9357 for (int &M : LoBlendMask)
9360 for (int &M : HiBlendMask)
9364 // Otherwise just unpack the low half of V into V1 and the high half into
9365 // V2 so that we can blend them as i16s.
9366 V1 = DAG.getNode(ISD::BITCAST, DL, MVT::v8i16,
9367 DAG.getNode(X86ISD::UNPCKL, DL, MVT::v16i8, V, Zero));
9368 V2 = DAG.getNode(ISD::BITCAST, DL, MVT::v8i16,
9369 DAG.getNode(X86ISD::UNPCKH, DL, MVT::v16i8, V, Zero));
9372 SDValue BlendedLo = DAG.getVectorShuffle(MVT::v8i16, DL, V1, V2, LoBlendMask);
9373 SDValue BlendedHi = DAG.getVectorShuffle(MVT::v8i16, DL, V1, V2, HiBlendMask);
9374 return std::make_pair(BlendedLo, BlendedHi);
9376 SDValue V1Lo, V1Hi, V2Lo, V2Hi;
9377 std::tie(V1Lo, V1Hi) = buildLoAndHiV8s(V1, V1LoBlendMask, V1HiBlendMask);
9378 std::tie(V2Lo, V2Hi) = buildLoAndHiV8s(V2, V2LoBlendMask, V2HiBlendMask);
9380 SDValue LoV = DAG.getVectorShuffle(MVT::v8i16, DL, V1Lo, V2Lo, LoMask);
9381 SDValue HiV = DAG.getVectorShuffle(MVT::v8i16, DL, V1Hi, V2Hi, HiMask);
9383 return DAG.getNode(X86ISD::PACKUS, DL, MVT::v16i8, LoV, HiV);
9386 /// \brief Dispatching routine to lower various 128-bit x86 vector shuffles.
9388 /// This routine breaks down the specific type of 128-bit shuffle and
9389 /// dispatches to the lowering routines accordingly.
9390 static SDValue lower128BitVectorShuffle(SDValue Op, SDValue V1, SDValue V2,
9391 MVT VT, const X86Subtarget *Subtarget,
9392 SelectionDAG &DAG) {
9393 switch (VT.SimpleTy) {
9395 return lowerV2I64VectorShuffle(Op, V1, V2, Subtarget, DAG);
9397 return lowerV2F64VectorShuffle(Op, V1, V2, Subtarget, DAG);
9399 return lowerV4I32VectorShuffle(Op, V1, V2, Subtarget, DAG);
9401 return lowerV4F32VectorShuffle(Op, V1, V2, Subtarget, DAG);
9403 return lowerV8I16VectorShuffle(Op, V1, V2, Subtarget, DAG);
9405 return lowerV16I8VectorShuffle(Op, V1, V2, Subtarget, DAG);
9408 llvm_unreachable("Unimplemented!");
9412 /// \brief Generic routine to split ector shuffle into half-sized shuffles.
9414 /// This routine just extracts two subvectors, shuffles them independently, and
9415 /// then concatenates them back together. This should work effectively with all
9416 /// AVX vector shuffle types.
9417 static SDValue splitAndLowerVectorShuffle(SDLoc DL, MVT VT, SDValue V1,
9418 SDValue V2, ArrayRef<int> Mask,
9419 SelectionDAG &DAG) {
9420 assert(VT.getSizeInBits() >= 256 &&
9421 "Only for 256-bit or wider vector shuffles!");
9422 assert(V1.getSimpleValueType() == VT && "Bad operand type!");
9423 assert(V2.getSimpleValueType() == VT && "Bad operand type!");
9425 ArrayRef<int> LoMask = Mask.slice(0, Mask.size() / 2);
9426 ArrayRef<int> HiMask = Mask.slice(Mask.size() / 2);
9428 int NumElements = VT.getVectorNumElements();
9429 int SplitNumElements = NumElements / 2;
9430 MVT ScalarVT = VT.getScalarType();
9431 MVT SplitVT = MVT::getVectorVT(ScalarVT, NumElements / 2);
9433 SDValue LoV1 = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, SplitVT, V1,
9434 DAG.getIntPtrConstant(0));
9435 SDValue HiV1 = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, SplitVT, V1,
9436 DAG.getIntPtrConstant(SplitNumElements));
9437 SDValue LoV2 = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, SplitVT, V2,
9438 DAG.getIntPtrConstant(0));
9439 SDValue HiV2 = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, SplitVT, V2,
9440 DAG.getIntPtrConstant(SplitNumElements));
9442 // Now create two 4-way blends of these half-width vectors.
9443 auto HalfBlend = [&](ArrayRef<int> HalfMask) {
9444 SmallVector<int, 32> V1BlendMask, V2BlendMask, BlendMask;
9445 for (int i = 0; i < SplitNumElements; ++i) {
9446 int M = HalfMask[i];
9447 if (M >= NumElements) {
9448 V2BlendMask.push_back(M - NumElements);
9449 V1BlendMask.push_back(-1);
9450 BlendMask.push_back(SplitNumElements + i);
9451 } else if (M >= 0) {
9452 V2BlendMask.push_back(-1);
9453 V1BlendMask.push_back(M);
9454 BlendMask.push_back(i);
9456 V2BlendMask.push_back(-1);
9457 V1BlendMask.push_back(-1);
9458 BlendMask.push_back(-1);
9462 DAG.getVectorShuffle(SplitVT, DL, LoV1, HiV1, V1BlendMask);
9464 DAG.getVectorShuffle(SplitVT, DL, LoV2, HiV2, V2BlendMask);
9465 return DAG.getVectorShuffle(SplitVT, DL, V1Blend, V2Blend, BlendMask);
9467 SDValue Lo = HalfBlend(LoMask);
9468 SDValue Hi = HalfBlend(HiMask);
9469 return DAG.getNode(ISD::CONCAT_VECTORS, DL, VT, Lo, Hi);
9472 /// \brief Lower a vector shuffle crossing multiple 128-bit lanes as
9473 /// a permutation and blend of those lanes.
9475 /// This essentially blends the out-of-lane inputs to each lane into the lane
9476 /// from a permuted copy of the vector. This lowering strategy results in four
9477 /// instructions in the worst case for a single-input cross lane shuffle which
9478 /// is lower than any other fully general cross-lane shuffle strategy I'm aware
9479 /// of. Special cases for each particular shuffle pattern should be handled
9480 /// prior to trying this lowering.
9481 static SDValue lowerVectorShuffleAsLanePermuteAndBlend(SDLoc DL, MVT VT,
9482 SDValue V1, SDValue V2,
9484 SelectionDAG &DAG) {
9485 // FIXME: This should probably be generalized for 512-bit vectors as well.
9486 assert(VT.getSizeInBits() == 256 && "Only for 256-bit vector shuffles!");
9487 int LaneSize = Mask.size() / 2;
9489 // If there are only inputs from one 128-bit lane, splitting will in fact be
9490 // less expensive. The flags track wether the given lane contains an element
9491 // that crosses to another lane.
9492 bool LaneCrossing[2] = {false, false};
9493 for (int i = 0, Size = Mask.size(); i < Size; ++i)
9494 if (Mask[i] >= 0 && (Mask[i] % Size) / LaneSize != i / LaneSize)
9495 LaneCrossing[(Mask[i] % Size) / LaneSize] = true;
9496 if (!LaneCrossing[0] || !LaneCrossing[1])
9497 return splitAndLowerVectorShuffle(DL, VT, V1, V2, Mask, DAG);
9499 if (isSingleInputShuffleMask(Mask)) {
9500 SmallVector<int, 32> FlippedBlendMask;
9501 for (int i = 0, Size = Mask.size(); i < Size; ++i)
9502 FlippedBlendMask.push_back(
9503 Mask[i] < 0 ? -1 : (((Mask[i] % Size) / LaneSize == i / LaneSize)
9505 : Mask[i] % LaneSize +
9506 (i / LaneSize) * LaneSize + Size));
9508 // Flip the vector, and blend the results which should now be in-lane. The
9509 // VPERM2X128 mask uses the low 2 bits for the low source and bits 4 and
9510 // 5 for the high source. The value 3 selects the high half of source 2 and
9511 // the value 2 selects the low half of source 2. We only use source 2 to
9512 // allow folding it into a memory operand.
9513 unsigned PERMMask = 3 | 2 << 4;
9514 SDValue Flipped = DAG.getNode(X86ISD::VPERM2X128, DL, VT, DAG.getUNDEF(VT),
9515 V1, DAG.getConstant(PERMMask, MVT::i8));
9516 return DAG.getVectorShuffle(VT, DL, V1, Flipped, FlippedBlendMask);
9519 // This now reduces to two single-input shuffles of V1 and V2 which at worst
9520 // will be handled by the above logic and a blend of the results, much like
9521 // other patterns in AVX.
9522 return lowerVectorShuffleAsDecomposedShuffleBlend(DL, VT, V1, V2, Mask, DAG);
9525 /// \brief Handle lowering of 4-lane 64-bit floating point shuffles.
9527 /// Also ends up handling lowering of 4-lane 64-bit integer shuffles when AVX2
9528 /// isn't available.
9529 static SDValue lowerV4F64VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
9530 const X86Subtarget *Subtarget,
9531 SelectionDAG &DAG) {
9533 assert(V1.getSimpleValueType() == MVT::v4f64 && "Bad operand type!");
9534 assert(V2.getSimpleValueType() == MVT::v4f64 && "Bad operand type!");
9535 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
9536 ArrayRef<int> Mask = SVOp->getMask();
9537 assert(Mask.size() == 4 && "Unexpected mask size for v4 shuffle!");
9539 if (isSingleInputShuffleMask(Mask)) {
9540 // Check for being able to broadcast a single element.
9541 if (SDValue Broadcast = lowerVectorShuffleAsBroadcast(MVT::v4f64, DL, V1,
9542 Mask, Subtarget, DAG))
9545 if (!is128BitLaneCrossingShuffleMask(MVT::v4f64, Mask)) {
9546 // Non-half-crossing single input shuffles can be lowerid with an
9547 // interleaved permutation.
9548 unsigned VPERMILPMask = (Mask[0] == 1) | ((Mask[1] == 1) << 1) |
9549 ((Mask[2] == 3) << 2) | ((Mask[3] == 3) << 3);
9550 return DAG.getNode(X86ISD::VPERMILPI, DL, MVT::v4f64, V1,
9551 DAG.getConstant(VPERMILPMask, MVT::i8));
9554 // With AVX2 we have direct support for this permutation.
9555 if (Subtarget->hasAVX2())
9556 return DAG.getNode(X86ISD::VPERMI, DL, MVT::v4f64, V1,
9557 getV4X86ShuffleImm8ForMask(Mask, DAG));
9559 // Otherwise, fall back.
9560 return lowerVectorShuffleAsLanePermuteAndBlend(DL, MVT::v4f64, V1, V2, Mask,
9564 // X86 has dedicated unpack instructions that can handle specific blend
9565 // operations: UNPCKH and UNPCKL.
9566 if (isShuffleEquivalent(Mask, 0, 4, 2, 6))
9567 return DAG.getNode(X86ISD::UNPCKL, DL, MVT::v4f64, V1, V2);
9568 if (isShuffleEquivalent(Mask, 1, 5, 3, 7))
9569 return DAG.getNode(X86ISD::UNPCKH, DL, MVT::v4f64, V1, V2);
9571 // If we have a single input to the zero element, insert that into V1 if we
9572 // can do so cheaply.
9574 std::count_if(Mask.begin(), Mask.end(), [](int M) { return M >= 4; });
9575 if (NumV2Elements == 1 && Mask[0] >= 4)
9576 if (SDValue Insertion = lowerVectorShuffleAsElementInsertion(
9577 MVT::v4f64, DL, V1, V2, Mask, Subtarget, DAG))
9580 if (SDValue Blend = lowerVectorShuffleAsBlend(DL, MVT::v4f64, V1, V2, Mask,
9584 // Check if the blend happens to exactly fit that of SHUFPD.
9585 if ((Mask[0] == -1 || Mask[0] < 2) &&
9586 (Mask[1] == -1 || (Mask[1] >= 4 && Mask[1] < 6)) &&
9587 (Mask[2] == -1 || (Mask[2] >= 2 && Mask[2] < 4)) &&
9588 (Mask[3] == -1 || Mask[3] >= 6)) {
9589 unsigned SHUFPDMask = (Mask[0] == 1) | ((Mask[1] == 5) << 1) |
9590 ((Mask[2] == 3) << 2) | ((Mask[3] == 7) << 3);
9591 return DAG.getNode(X86ISD::SHUFP, DL, MVT::v4f64, V1, V2,
9592 DAG.getConstant(SHUFPDMask, MVT::i8));
9594 if ((Mask[0] == -1 || (Mask[0] >= 4 && Mask[0] < 6)) &&
9595 (Mask[1] == -1 || Mask[1] < 2) &&
9596 (Mask[2] == -1 || Mask[2] >= 6) &&
9597 (Mask[3] == -1 || (Mask[3] >= 2 && Mask[3] < 4))) {
9598 unsigned SHUFPDMask = (Mask[0] == 5) | ((Mask[1] == 1) << 1) |
9599 ((Mask[2] == 7) << 2) | ((Mask[3] == 3) << 3);
9600 return DAG.getNode(X86ISD::SHUFP, DL, MVT::v4f64, V2, V1,
9601 DAG.getConstant(SHUFPDMask, MVT::i8));
9604 // Otherwise fall back on generic blend lowering.
9605 return lowerVectorShuffleAsDecomposedShuffleBlend(DL, MVT::v4f64, V1, V2,
9609 /// \brief Handle lowering of 4-lane 64-bit integer shuffles.
9611 /// This routine is only called when we have AVX2 and thus a reasonable
9612 /// instruction set for v4i64 shuffling..
9613 static SDValue lowerV4I64VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
9614 const X86Subtarget *Subtarget,
9615 SelectionDAG &DAG) {
9617 assert(V1.getSimpleValueType() == MVT::v4i64 && "Bad operand type!");
9618 assert(V2.getSimpleValueType() == MVT::v4i64 && "Bad operand type!");
9619 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
9620 ArrayRef<int> Mask = SVOp->getMask();
9621 assert(Mask.size() == 4 && "Unexpected mask size for v4 shuffle!");
9622 assert(Subtarget->hasAVX2() && "We can only lower v4i64 with AVX2!");
9624 if (SDValue Blend = lowerVectorShuffleAsBlend(DL, MVT::v4i64, V1, V2, Mask,
9628 // Check for being able to broadcast a single element.
9629 if (SDValue Broadcast = lowerVectorShuffleAsBroadcast(MVT::v4i64, DL, V1,
9630 Mask, Subtarget, DAG))
9633 // When the shuffle is mirrored between the 128-bit lanes of the unit, we can
9634 // use lower latency instructions that will operate on both 128-bit lanes.
9635 SmallVector<int, 2> RepeatedMask;
9636 if (is128BitLaneRepeatedShuffleMask(MVT::v4i64, Mask, RepeatedMask)) {
9637 if (isSingleInputShuffleMask(Mask)) {
9638 int PSHUFDMask[] = {-1, -1, -1, -1};
9639 for (int i = 0; i < 2; ++i)
9640 if (RepeatedMask[i] >= 0) {
9641 PSHUFDMask[2 * i] = 2 * RepeatedMask[i];
9642 PSHUFDMask[2 * i + 1] = 2 * RepeatedMask[i] + 1;
9645 ISD::BITCAST, DL, MVT::v4i64,
9646 DAG.getNode(X86ISD::PSHUFD, DL, MVT::v8i32,
9647 DAG.getNode(ISD::BITCAST, DL, MVT::v8i32, V1),
9648 getV4X86ShuffleImm8ForMask(PSHUFDMask, DAG)));
9651 // Use dedicated unpack instructions for masks that match their pattern.
9652 if (isShuffleEquivalent(Mask, 0, 4, 2, 6))
9653 return DAG.getNode(X86ISD::UNPCKL, DL, MVT::v4i64, V1, V2);
9654 if (isShuffleEquivalent(Mask, 1, 5, 3, 7))
9655 return DAG.getNode(X86ISD::UNPCKH, DL, MVT::v4i64, V1, V2);
9658 // AVX2 provides a direct instruction for permuting a single input across
9660 if (isSingleInputShuffleMask(Mask))
9661 return DAG.getNode(X86ISD::VPERMI, DL, MVT::v4i64, V1,
9662 getV4X86ShuffleImm8ForMask(Mask, DAG));
9664 // Otherwise fall back on generic blend lowering.
9665 return lowerVectorShuffleAsDecomposedShuffleBlend(DL, MVT::v4i64, V1, V2,
9669 /// \brief Handle lowering of 8-lane 32-bit floating point shuffles.
9671 /// Also ends up handling lowering of 8-lane 32-bit integer shuffles when AVX2
9672 /// isn't available.
9673 static SDValue lowerV8F32VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
9674 const X86Subtarget *Subtarget,
9675 SelectionDAG &DAG) {
9677 assert(V1.getSimpleValueType() == MVT::v8f32 && "Bad operand type!");
9678 assert(V2.getSimpleValueType() == MVT::v8f32 && "Bad operand type!");
9679 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
9680 ArrayRef<int> Mask = SVOp->getMask();
9681 assert(Mask.size() == 8 && "Unexpected mask size for v8 shuffle!");
9683 if (SDValue Blend = lowerVectorShuffleAsBlend(DL, MVT::v8f32, V1, V2, Mask,
9687 // Check for being able to broadcast a single element.
9688 if (SDValue Broadcast = lowerVectorShuffleAsBroadcast(MVT::v8f32, DL, V1,
9689 Mask, Subtarget, DAG))
9692 // If the shuffle mask is repeated in each 128-bit lane, we have many more
9693 // options to efficiently lower the shuffle.
9694 SmallVector<int, 4> RepeatedMask;
9695 if (is128BitLaneRepeatedShuffleMask(MVT::v8f32, Mask, RepeatedMask)) {
9696 assert(RepeatedMask.size() == 4 &&
9697 "Repeated masks must be half the mask width!");
9698 if (isSingleInputShuffleMask(Mask))
9699 return DAG.getNode(X86ISD::VPERMILPI, DL, MVT::v8f32, V1,
9700 getV4X86ShuffleImm8ForMask(RepeatedMask, DAG));
9702 // Use dedicated unpack instructions for masks that match their pattern.
9703 if (isShuffleEquivalent(Mask, 0, 8, 1, 9, 4, 12, 5, 13))
9704 return DAG.getNode(X86ISD::UNPCKL, DL, MVT::v8f32, V1, V2);
9705 if (isShuffleEquivalent(Mask, 2, 10, 3, 11, 6, 14, 7, 15))
9706 return DAG.getNode(X86ISD::UNPCKH, DL, MVT::v8f32, V1, V2);
9708 // Otherwise, fall back to a SHUFPS sequence. Here it is important that we
9709 // have already handled any direct blends. We also need to squash the
9710 // repeated mask into a simulated v4f32 mask.
9711 for (int i = 0; i < 4; ++i)
9712 if (RepeatedMask[i] >= 8)
9713 RepeatedMask[i] -= 4;
9714 return lowerVectorShuffleWithSHUFPS(DL, MVT::v8f32, RepeatedMask, V1, V2, DAG);
9717 // If we have a single input shuffle with different shuffle patterns in the
9718 // two 128-bit lanes use the variable mask to VPERMILPS.
9719 if (isSingleInputShuffleMask(Mask)) {
9720 SDValue VPermMask[8];
9721 for (int i = 0; i < 8; ++i)
9722 VPermMask[i] = Mask[i] < 0 ? DAG.getUNDEF(MVT::i32)
9723 : DAG.getConstant(Mask[i], MVT::i32);
9724 if (!is128BitLaneCrossingShuffleMask(MVT::v8f32, Mask))
9726 X86ISD::VPERMILPV, DL, MVT::v8f32, V1,
9727 DAG.getNode(ISD::BUILD_VECTOR, DL, MVT::v8i32, VPermMask));
9729 if (Subtarget->hasAVX2())
9730 return DAG.getNode(X86ISD::VPERMV, DL, MVT::v8f32,
9731 DAG.getNode(ISD::BITCAST, DL, MVT::v8f32,
9732 DAG.getNode(ISD::BUILD_VECTOR, DL,
9733 MVT::v8i32, VPermMask)),
9736 // Otherwise, fall back.
9737 return lowerVectorShuffleAsLanePermuteAndBlend(DL, MVT::v8f32, V1, V2, Mask,
9741 // Otherwise fall back on generic blend lowering.
9742 return lowerVectorShuffleAsDecomposedShuffleBlend(DL, MVT::v8f32, V1, V2,
9746 /// \brief Handle lowering of 8-lane 32-bit integer shuffles.
9748 /// This routine is only called when we have AVX2 and thus a reasonable
9749 /// instruction set for v8i32 shuffling..
9750 static SDValue lowerV8I32VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
9751 const X86Subtarget *Subtarget,
9752 SelectionDAG &DAG) {
9754 assert(V1.getSimpleValueType() == MVT::v8i32 && "Bad operand type!");
9755 assert(V2.getSimpleValueType() == MVT::v8i32 && "Bad operand type!");
9756 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
9757 ArrayRef<int> Mask = SVOp->getMask();
9758 assert(Mask.size() == 8 && "Unexpected mask size for v8 shuffle!");
9759 assert(Subtarget->hasAVX2() && "We can only lower v8i32 with AVX2!");
9761 if (SDValue Blend = lowerVectorShuffleAsBlend(DL, MVT::v8i32, V1, V2, Mask,
9765 // Check for being able to broadcast a single element.
9766 if (SDValue Broadcast = lowerVectorShuffleAsBroadcast(MVT::v8i32, DL, V1,
9767 Mask, Subtarget, DAG))
9770 // If the shuffle mask is repeated in each 128-bit lane we can use more
9771 // efficient instructions that mirror the shuffles across the two 128-bit
9773 SmallVector<int, 4> RepeatedMask;
9774 if (is128BitLaneRepeatedShuffleMask(MVT::v8i32, Mask, RepeatedMask)) {
9775 assert(RepeatedMask.size() == 4 && "Unexpected repeated mask size!");
9776 if (isSingleInputShuffleMask(Mask))
9777 return DAG.getNode(X86ISD::PSHUFD, DL, MVT::v8i32, V1,
9778 getV4X86ShuffleImm8ForMask(RepeatedMask, DAG));
9780 // Use dedicated unpack instructions for masks that match their pattern.
9781 if (isShuffleEquivalent(Mask, 0, 8, 1, 9, 4, 12, 5, 13))
9782 return DAG.getNode(X86ISD::UNPCKL, DL, MVT::v8i32, V1, V2);
9783 if (isShuffleEquivalent(Mask, 2, 10, 3, 11, 6, 14, 7, 15))
9784 return DAG.getNode(X86ISD::UNPCKH, DL, MVT::v8i32, V1, V2);
9787 // If the shuffle patterns aren't repeated but it is a single input, directly
9788 // generate a cross-lane VPERMD instruction.
9789 if (isSingleInputShuffleMask(Mask)) {
9790 SDValue VPermMask[8];
9791 for (int i = 0; i < 8; ++i)
9792 VPermMask[i] = Mask[i] < 0 ? DAG.getUNDEF(MVT::i32)
9793 : DAG.getConstant(Mask[i], MVT::i32);
9795 X86ISD::VPERMV, DL, MVT::v8i32,
9796 DAG.getNode(ISD::BUILD_VECTOR, DL, MVT::v8i32, VPermMask), V1);
9799 // Otherwise fall back on generic blend lowering.
9800 return lowerVectorShuffleAsDecomposedShuffleBlend(DL, MVT::v8i32, V1, V2,
9804 /// \brief Handle lowering of 16-lane 16-bit integer shuffles.
9806 /// This routine is only called when we have AVX2 and thus a reasonable
9807 /// instruction set for v16i16 shuffling..
9808 static SDValue lowerV16I16VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
9809 const X86Subtarget *Subtarget,
9810 SelectionDAG &DAG) {
9812 assert(V1.getSimpleValueType() == MVT::v16i16 && "Bad operand type!");
9813 assert(V2.getSimpleValueType() == MVT::v16i16 && "Bad operand type!");
9814 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
9815 ArrayRef<int> Mask = SVOp->getMask();
9816 assert(Mask.size() == 16 && "Unexpected mask size for v16 shuffle!");
9817 assert(Subtarget->hasAVX2() && "We can only lower v16i16 with AVX2!");
9819 // Check for being able to broadcast a single element.
9820 if (SDValue Broadcast = lowerVectorShuffleAsBroadcast(MVT::v16i16, DL, V1,
9821 Mask, Subtarget, DAG))
9824 // There are no generalized cross-lane shuffle operations available on i16
9826 if (is128BitLaneCrossingShuffleMask(MVT::v16i16, Mask))
9827 return lowerVectorShuffleAsLanePermuteAndBlend(DL, MVT::v16i16, V1, V2,
9830 if (SDValue Blend = lowerVectorShuffleAsBlend(DL, MVT::v16i16, V1, V2, Mask,
9834 // Use dedicated unpack instructions for masks that match their pattern.
9835 if (isShuffleEquivalent(Mask,
9836 // First 128-bit lane:
9837 0, 16, 1, 17, 2, 18, 3, 19,
9838 // Second 128-bit lane:
9839 8, 24, 9, 25, 10, 26, 11, 27))
9840 return DAG.getNode(X86ISD::UNPCKL, DL, MVT::v16i16, V1, V2);
9841 if (isShuffleEquivalent(Mask,
9842 // First 128-bit lane:
9843 4, 20, 5, 21, 6, 22, 7, 23,
9844 // Second 128-bit lane:
9845 12, 28, 13, 29, 14, 30, 15, 31))
9846 return DAG.getNode(X86ISD::UNPCKH, DL, MVT::v16i16, V1, V2);
9848 if (isSingleInputShuffleMask(Mask)) {
9849 SDValue PSHUFBMask[32];
9850 for (int i = 0; i < 16; ++i) {
9851 if (Mask[i] == -1) {
9852 PSHUFBMask[2 * i] = PSHUFBMask[2 * i + 1] = DAG.getUNDEF(MVT::i8);
9856 int M = i < 8 ? Mask[i] : Mask[i] - 8;
9857 assert(M >= 0 && M < 8 && "Invalid single-input mask!");
9858 PSHUFBMask[2 * i] = DAG.getConstant(2 * M, MVT::i8);
9859 PSHUFBMask[2 * i + 1] = DAG.getConstant(2 * M + 1, MVT::i8);
9862 ISD::BITCAST, DL, MVT::v16i16,
9864 X86ISD::PSHUFB, DL, MVT::v32i8,
9865 DAG.getNode(ISD::BITCAST, DL, MVT::v32i8, V1),
9866 DAG.getNode(ISD::BUILD_VECTOR, DL, MVT::v32i8, PSHUFBMask)));
9869 // Otherwise fall back on generic blend lowering.
9870 return lowerVectorShuffleAsDecomposedShuffleBlend(DL, MVT::v16i16, V1, V2,
9874 /// \brief Handle lowering of 32-lane 8-bit integer shuffles.
9876 /// This routine is only called when we have AVX2 and thus a reasonable
9877 /// instruction set for v32i8 shuffling..
9878 static SDValue lowerV32I8VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
9879 const X86Subtarget *Subtarget,
9880 SelectionDAG &DAG) {
9882 assert(V1.getSimpleValueType() == MVT::v32i8 && "Bad operand type!");
9883 assert(V2.getSimpleValueType() == MVT::v32i8 && "Bad operand type!");
9884 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
9885 ArrayRef<int> Mask = SVOp->getMask();
9886 assert(Mask.size() == 32 && "Unexpected mask size for v32 shuffle!");
9887 assert(Subtarget->hasAVX2() && "We can only lower v32i8 with AVX2!");
9889 // Check for being able to broadcast a single element.
9890 if (SDValue Broadcast = lowerVectorShuffleAsBroadcast(MVT::v32i8, DL, V1,
9891 Mask, Subtarget, DAG))
9894 // There are no generalized cross-lane shuffle operations available on i8
9896 if (is128BitLaneCrossingShuffleMask(MVT::v32i8, Mask))
9897 return lowerVectorShuffleAsLanePermuteAndBlend(DL, MVT::v32i8, V1, V2,
9900 if (SDValue Blend = lowerVectorShuffleAsBlend(DL, MVT::v32i8, V1, V2, Mask,
9904 // Use dedicated unpack instructions for masks that match their pattern.
9905 // Note that these are repeated 128-bit lane unpacks, not unpacks across all
9907 if (isShuffleEquivalent(
9909 // First 128-bit lane:
9910 0, 32, 1, 33, 2, 34, 3, 35, 4, 36, 5, 37, 6, 38, 7, 39,
9911 // Second 128-bit lane:
9912 16, 48, 17, 49, 18, 50, 19, 51, 20, 52, 21, 53, 22, 54, 23, 55))
9913 return DAG.getNode(X86ISD::UNPCKL, DL, MVT::v32i8, V1, V2);
9914 if (isShuffleEquivalent(
9916 // First 128-bit lane:
9917 8, 40, 9, 41, 10, 42, 11, 43, 12, 44, 13, 45, 14, 46, 15, 47,
9918 // Second 128-bit lane:
9919 24, 56, 25, 57, 26, 58, 27, 59, 28, 60, 29, 61, 30, 62, 31, 63))
9920 return DAG.getNode(X86ISD::UNPCKH, DL, MVT::v32i8, V1, V2);
9922 if (isSingleInputShuffleMask(Mask)) {
9923 SDValue PSHUFBMask[32];
9924 for (int i = 0; i < 32; ++i)
9927 ? DAG.getUNDEF(MVT::i8)
9928 : DAG.getConstant(Mask[i] < 16 ? Mask[i] : Mask[i] - 16, MVT::i8);
9931 X86ISD::PSHUFB, DL, MVT::v32i8, V1,
9932 DAG.getNode(ISD::BUILD_VECTOR, DL, MVT::v32i8, PSHUFBMask));
9935 // Otherwise fall back on generic blend lowering.
9936 return lowerVectorShuffleAsDecomposedShuffleBlend(DL, MVT::v32i8, V1, V2,
9940 /// \brief High-level routine to lower various 256-bit x86 vector shuffles.
9942 /// This routine either breaks down the specific type of a 256-bit x86 vector
9943 /// shuffle or splits it into two 128-bit shuffles and fuses the results back
9944 /// together based on the available instructions.
9945 static SDValue lower256BitVectorShuffle(SDValue Op, SDValue V1, SDValue V2,
9946 MVT VT, const X86Subtarget *Subtarget,
9947 SelectionDAG &DAG) {
9949 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
9950 ArrayRef<int> Mask = SVOp->getMask();
9952 // There is a really nice hard cut-over between AVX1 and AVX2 that means we can
9953 // check for those subtargets here and avoid much of the subtarget querying in
9954 // the per-vector-type lowering routines. With AVX1 we have essentially *zero*
9955 // ability to manipulate a 256-bit vector with integer types. Since we'll use
9956 // floating point types there eventually, just immediately cast everything to
9957 // a float and operate entirely in that domain.
9958 if (VT.isInteger() && !Subtarget->hasAVX2()) {
9959 int ElementBits = VT.getScalarSizeInBits();
9960 if (ElementBits < 32)
9961 // No floating point type available, decompose into 128-bit vectors.
9962 return splitAndLowerVectorShuffle(DL, VT, V1, V2, Mask, DAG);
9964 MVT FpVT = MVT::getVectorVT(MVT::getFloatingPointVT(ElementBits),
9965 VT.getVectorNumElements());
9966 V1 = DAG.getNode(ISD::BITCAST, DL, FpVT, V1);
9967 V2 = DAG.getNode(ISD::BITCAST, DL, FpVT, V2);
9968 return DAG.getNode(ISD::BITCAST, DL, VT,
9969 DAG.getVectorShuffle(FpVT, DL, V1, V2, Mask));
9972 switch (VT.SimpleTy) {
9974 return lowerV4F64VectorShuffle(Op, V1, V2, Subtarget, DAG);
9976 return lowerV4I64VectorShuffle(Op, V1, V2, Subtarget, DAG);
9978 return lowerV8F32VectorShuffle(Op, V1, V2, Subtarget, DAG);
9980 return lowerV8I32VectorShuffle(Op, V1, V2, Subtarget, DAG);
9982 return lowerV16I16VectorShuffle(Op, V1, V2, Subtarget, DAG);
9984 return lowerV32I8VectorShuffle(Op, V1, V2, Subtarget, DAG);
9987 llvm_unreachable("Not a valid 256-bit x86 vector type!");
9991 /// \brief Handle lowering of 8-lane 64-bit floating point shuffles.
9992 static SDValue lowerV8F64VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
9993 const X86Subtarget *Subtarget,
9994 SelectionDAG &DAG) {
9996 assert(V1.getSimpleValueType() == MVT::v8f64 && "Bad operand type!");
9997 assert(V2.getSimpleValueType() == MVT::v8f64 && "Bad operand type!");
9998 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
9999 ArrayRef<int> Mask = SVOp->getMask();
10000 assert(Mask.size() == 8 && "Unexpected mask size for v8 shuffle!");
10002 // FIXME: Implement direct support for this type!
10003 return splitAndLowerVectorShuffle(DL, MVT::v8f64, V1, V2, Mask, DAG);
10006 /// \brief Handle lowering of 16-lane 32-bit floating point shuffles.
10007 static SDValue lowerV16F32VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
10008 const X86Subtarget *Subtarget,
10009 SelectionDAG &DAG) {
10011 assert(V1.getSimpleValueType() == MVT::v16f32 && "Bad operand type!");
10012 assert(V2.getSimpleValueType() == MVT::v16f32 && "Bad operand type!");
10013 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
10014 ArrayRef<int> Mask = SVOp->getMask();
10015 assert(Mask.size() == 16 && "Unexpected mask size for v16 shuffle!");
10017 // FIXME: Implement direct support for this type!
10018 return splitAndLowerVectorShuffle(DL, MVT::v16f32, V1, V2, Mask, DAG);
10021 /// \brief Handle lowering of 8-lane 64-bit integer shuffles.
10022 static SDValue lowerV8I64VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
10023 const X86Subtarget *Subtarget,
10024 SelectionDAG &DAG) {
10026 assert(V1.getSimpleValueType() == MVT::v8i64 && "Bad operand type!");
10027 assert(V2.getSimpleValueType() == MVT::v8i64 && "Bad operand type!");
10028 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
10029 ArrayRef<int> Mask = SVOp->getMask();
10030 assert(Mask.size() == 8 && "Unexpected mask size for v8 shuffle!");
10031 assert(Subtarget->hasDQI() && "We can only lower v8i64 with AVX-512-DQI");
10033 // FIXME: Implement direct support for this type!
10034 return splitAndLowerVectorShuffle(DL, MVT::v8i64, V1, V2, Mask, DAG);
10037 /// \brief Handle lowering of 16-lane 32-bit integer shuffles.
10038 static SDValue lowerV16I32VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
10039 const X86Subtarget *Subtarget,
10040 SelectionDAG &DAG) {
10042 assert(V1.getSimpleValueType() == MVT::v16i32 && "Bad operand type!");
10043 assert(V2.getSimpleValueType() == MVT::v16i32 && "Bad operand type!");
10044 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
10045 ArrayRef<int> Mask = SVOp->getMask();
10046 assert(Mask.size() == 16 && "Unexpected mask size for v16 shuffle!");
10047 assert(Subtarget->hasDQI() && "We can only lower v16i32 with AVX-512-DQI!");
10049 // FIXME: Implement direct support for this type!
10050 return splitAndLowerVectorShuffle(DL, MVT::v16i32, V1, V2, Mask, DAG);
10053 /// \brief Handle lowering of 32-lane 16-bit integer shuffles.
10054 static SDValue lowerV32I16VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
10055 const X86Subtarget *Subtarget,
10056 SelectionDAG &DAG) {
10058 assert(V1.getSimpleValueType() == MVT::v32i16 && "Bad operand type!");
10059 assert(V2.getSimpleValueType() == MVT::v32i16 && "Bad operand type!");
10060 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
10061 ArrayRef<int> Mask = SVOp->getMask();
10062 assert(Mask.size() == 32 && "Unexpected mask size for v32 shuffle!");
10063 assert(Subtarget->hasBWI() && "We can only lower v32i16 with AVX-512-BWI!");
10065 // FIXME: Implement direct support for this type!
10066 return splitAndLowerVectorShuffle(DL, MVT::v32i16, V1, V2, Mask, DAG);
10069 /// \brief Handle lowering of 64-lane 8-bit integer shuffles.
10070 static SDValue lowerV64I8VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
10071 const X86Subtarget *Subtarget,
10072 SelectionDAG &DAG) {
10074 assert(V1.getSimpleValueType() == MVT::v64i8 && "Bad operand type!");
10075 assert(V2.getSimpleValueType() == MVT::v64i8 && "Bad operand type!");
10076 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
10077 ArrayRef<int> Mask = SVOp->getMask();
10078 assert(Mask.size() == 64 && "Unexpected mask size for v64 shuffle!");
10079 assert(Subtarget->hasBWI() && "We can only lower v64i8 with AVX-512-BWI!");
10081 // FIXME: Implement direct support for this type!
10082 return splitAndLowerVectorShuffle(DL, MVT::v64i8, V1, V2, Mask, DAG);
10085 /// \brief High-level routine to lower various 512-bit x86 vector shuffles.
10087 /// This routine either breaks down the specific type of a 512-bit x86 vector
10088 /// shuffle or splits it into two 256-bit shuffles and fuses the results back
10089 /// together based on the available instructions.
10090 static SDValue lower512BitVectorShuffle(SDValue Op, SDValue V1, SDValue V2,
10091 MVT VT, const X86Subtarget *Subtarget,
10092 SelectionDAG &DAG) {
10094 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
10095 ArrayRef<int> Mask = SVOp->getMask();
10096 assert(Subtarget->hasAVX512() &&
10097 "Cannot lower 512-bit vectors w/ basic ISA!");
10099 // Dispatch to each element type for lowering. If we don't have supprot for
10100 // specific element type shuffles at 512 bits, immediately split them and
10101 // lower them. Each lowering routine of a given type is allowed to assume that
10102 // the requisite ISA extensions for that element type are available.
10103 switch (VT.SimpleTy) {
10105 return lowerV8F64VectorShuffle(Op, V1, V2, Subtarget, DAG);
10107 return lowerV16F32VectorShuffle(Op, V1, V2, Subtarget, DAG);
10109 if (Subtarget->hasDQI())
10110 return lowerV8I64VectorShuffle(Op, V1, V2, Subtarget, DAG);
10113 if (Subtarget->hasDQI())
10114 return lowerV16I32VectorShuffle(Op, V1, V2, Subtarget, DAG);
10117 if (Subtarget->hasBWI())
10118 return lowerV32I16VectorShuffle(Op, V1, V2, Subtarget, DAG);
10121 if (Subtarget->hasBWI())
10122 return lowerV64I8VectorShuffle(Op, V1, V2, Subtarget, DAG);
10126 llvm_unreachable("Not a valid 512-bit x86 vector type!");
10129 // Otherwise fall back on splitting.
10130 return splitAndLowerVectorShuffle(DL, VT, V1, V2, Mask, DAG);
10133 /// \brief Helper function to test whether a shuffle mask could be
10134 /// simplified by widening the elements being shuffled.
10136 /// Appends the mask for wider elements in WidenedMask if valid. Otherwise
10137 /// leaves it in an unspecified state.
10139 /// NOTE: This must handle normal vector shuffle masks and *target* vector
10140 /// shuffle masks. The latter have the special property of a '-2' representing
10141 /// a zero-ed lane of a vector.
10142 static bool canWidenShuffleElements(ArrayRef<int> Mask,
10143 SmallVectorImpl<int> &WidenedMask) {
10144 for (int i = 0, Size = Mask.size(); i < Size; i += 2) {
10145 // If both elements are undef, its trivial.
10146 if (Mask[i] == SM_SentinelUndef && Mask[i + 1] == SM_SentinelUndef) {
10147 WidenedMask.push_back(SM_SentinelUndef);
10151 // Check for an undef mask and a mask value properly aligned to fit with
10152 // a pair of values. If we find such a case, use the non-undef mask's value.
10153 if (Mask[i] == SM_SentinelUndef && Mask[i + 1] >= 0 && Mask[i + 1] % 2 == 1) {
10154 WidenedMask.push_back(Mask[i + 1] / 2);
10157 if (Mask[i + 1] == SM_SentinelUndef && Mask[i] >= 0 && Mask[i] % 2 == 0) {
10158 WidenedMask.push_back(Mask[i] / 2);
10162 // When zeroing, we need to spread the zeroing across both lanes to widen.
10163 if (Mask[i] == SM_SentinelZero || Mask[i + 1] == SM_SentinelZero) {
10164 if ((Mask[i] == SM_SentinelZero || Mask[i] == SM_SentinelUndef) &&
10165 (Mask[i + 1] == SM_SentinelZero || Mask[i + 1] == SM_SentinelUndef)) {
10166 WidenedMask.push_back(SM_SentinelZero);
10172 // Finally check if the two mask values are adjacent and aligned with
10174 if (Mask[i] != SM_SentinelUndef && Mask[i] % 2 == 0 && Mask[i] + 1 == Mask[i + 1]) {
10175 WidenedMask.push_back(Mask[i] / 2);
10179 // Otherwise we can't safely widen the elements used in this shuffle.
10182 assert(WidenedMask.size() == Mask.size() / 2 &&
10183 "Incorrect size of mask after widening the elements!");
10188 /// \brief Top-level lowering for x86 vector shuffles.
10190 /// This handles decomposition, canonicalization, and lowering of all x86
10191 /// vector shuffles. Most of the specific lowering strategies are encapsulated
10192 /// above in helper routines. The canonicalization attempts to widen shuffles
10193 /// to involve fewer lanes of wider elements, consolidate symmetric patterns
10194 /// s.t. only one of the two inputs needs to be tested, etc.
10195 static SDValue lowerVectorShuffle(SDValue Op, const X86Subtarget *Subtarget,
10196 SelectionDAG &DAG) {
10197 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
10198 ArrayRef<int> Mask = SVOp->getMask();
10199 SDValue V1 = Op.getOperand(0);
10200 SDValue V2 = Op.getOperand(1);
10201 MVT VT = Op.getSimpleValueType();
10202 int NumElements = VT.getVectorNumElements();
10205 assert(VT.getSizeInBits() != 64 && "Can't lower MMX shuffles");
10207 bool V1IsUndef = V1.getOpcode() == ISD::UNDEF;
10208 bool V2IsUndef = V2.getOpcode() == ISD::UNDEF;
10209 if (V1IsUndef && V2IsUndef)
10210 return DAG.getUNDEF(VT);
10212 // When we create a shuffle node we put the UNDEF node to second operand,
10213 // but in some cases the first operand may be transformed to UNDEF.
10214 // In this case we should just commute the node.
10216 return DAG.getCommutedVectorShuffle(*SVOp);
10218 // Check for non-undef masks pointing at an undef vector and make the masks
10219 // undef as well. This makes it easier to match the shuffle based solely on
10223 if (M >= NumElements) {
10224 SmallVector<int, 8> NewMask(Mask.begin(), Mask.end());
10225 for (int &M : NewMask)
10226 if (M >= NumElements)
10228 return DAG.getVectorShuffle(VT, dl, V1, V2, NewMask);
10231 // For integer vector shuffles, try to collapse them into a shuffle of fewer
10232 // lanes but wider integers. We cap this to not form integers larger than i64
10233 // but it might be interesting to form i128 integers to handle flipping the
10234 // low and high halves of AVX 256-bit vectors.
10235 SmallVector<int, 16> WidenedMask;
10236 if (VT.isInteger() && VT.getScalarSizeInBits() < 64 &&
10237 canWidenShuffleElements(Mask, WidenedMask)) {
10239 MVT::getVectorVT(MVT::getIntegerVT(VT.getScalarSizeInBits() * 2),
10240 VT.getVectorNumElements() / 2);
10241 V1 = DAG.getNode(ISD::BITCAST, dl, NewVT, V1);
10242 V2 = DAG.getNode(ISD::BITCAST, dl, NewVT, V2);
10243 return DAG.getNode(ISD::BITCAST, dl, VT,
10244 DAG.getVectorShuffle(NewVT, dl, V1, V2, WidenedMask));
10247 int NumV1Elements = 0, NumUndefElements = 0, NumV2Elements = 0;
10248 for (int M : SVOp->getMask())
10250 ++NumUndefElements;
10251 else if (M < NumElements)
10256 // Commute the shuffle as needed such that more elements come from V1 than
10257 // V2. This allows us to match the shuffle pattern strictly on how many
10258 // elements come from V1 without handling the symmetric cases.
10259 if (NumV2Elements > NumV1Elements)
10260 return DAG.getCommutedVectorShuffle(*SVOp);
10262 // When the number of V1 and V2 elements are the same, try to minimize the
10263 // number of uses of V2 in the low half of the vector. When that is tied,
10264 // ensure that the sum of indices for V1 is equal to or lower than the sum
10266 if (NumV1Elements == NumV2Elements) {
10267 int LowV1Elements = 0, LowV2Elements = 0;
10268 for (int M : SVOp->getMask().slice(0, NumElements / 2))
10269 if (M >= NumElements)
10273 if (LowV2Elements > LowV1Elements) {
10274 return DAG.getCommutedVectorShuffle(*SVOp);
10275 } else if (LowV2Elements == LowV1Elements) {
10276 int SumV1Indices = 0, SumV2Indices = 0;
10277 for (int i = 0, Size = SVOp->getMask().size(); i < Size; ++i)
10278 if (SVOp->getMask()[i] >= NumElements)
10280 else if (SVOp->getMask()[i] >= 0)
10282 if (SumV2Indices < SumV1Indices)
10283 return DAG.getCommutedVectorShuffle(*SVOp);
10287 // For each vector width, delegate to a specialized lowering routine.
10288 if (VT.getSizeInBits() == 128)
10289 return lower128BitVectorShuffle(Op, V1, V2, VT, Subtarget, DAG);
10291 if (VT.getSizeInBits() == 256)
10292 return lower256BitVectorShuffle(Op, V1, V2, VT, Subtarget, DAG);
10294 // Force AVX-512 vectors to be scalarized for now.
10295 // FIXME: Implement AVX-512 support!
10296 if (VT.getSizeInBits() == 512)
10297 return lower512BitVectorShuffle(Op, V1, V2, VT, Subtarget, DAG);
10299 llvm_unreachable("Unimplemented!");
10303 //===----------------------------------------------------------------------===//
10304 // Legacy vector shuffle lowering
10306 // This code is the legacy code handling vector shuffles until the above
10307 // replaces its functionality and performance.
10308 //===----------------------------------------------------------------------===//
10310 static bool isBlendMask(ArrayRef<int> MaskVals, MVT VT, bool hasSSE41,
10311 bool hasInt256, unsigned *MaskOut = nullptr) {
10312 MVT EltVT = VT.getVectorElementType();
10314 // There is no blend with immediate in AVX-512.
10315 if (VT.is512BitVector())
10318 if (!hasSSE41 || EltVT == MVT::i8)
10320 if (!hasInt256 && VT == MVT::v16i16)
10323 unsigned MaskValue = 0;
10324 unsigned NumElems = VT.getVectorNumElements();
10325 // There are 2 lanes if (NumElems > 8), and 1 lane otherwise.
10326 unsigned NumLanes = (NumElems - 1) / 8 + 1;
10327 unsigned NumElemsInLane = NumElems / NumLanes;
10329 // Blend for v16i16 should be symetric for the both lanes.
10330 for (unsigned i = 0; i < NumElemsInLane; ++i) {
10332 int SndLaneEltIdx = (NumLanes == 2) ? MaskVals[i + NumElemsInLane] : -1;
10333 int EltIdx = MaskVals[i];
10335 if ((EltIdx < 0 || EltIdx == (int)i) &&
10336 (SndLaneEltIdx < 0 || SndLaneEltIdx == (int)(i + NumElemsInLane)))
10339 if (((unsigned)EltIdx == (i + NumElems)) &&
10340 (SndLaneEltIdx < 0 ||
10341 (unsigned)SndLaneEltIdx == i + NumElems + NumElemsInLane))
10342 MaskValue |= (1 << i);
10348 *MaskOut = MaskValue;
10352 // Try to lower a shuffle node into a simple blend instruction.
10353 // This function assumes isBlendMask returns true for this
10354 // SuffleVectorSDNode
10355 static SDValue LowerVECTOR_SHUFFLEtoBlend(ShuffleVectorSDNode *SVOp,
10356 unsigned MaskValue,
10357 const X86Subtarget *Subtarget,
10358 SelectionDAG &DAG) {
10359 MVT VT = SVOp->getSimpleValueType(0);
10360 MVT EltVT = VT.getVectorElementType();
10361 assert(isBlendMask(SVOp->getMask(), VT, Subtarget->hasSSE41(),
10362 Subtarget->hasInt256() && "Trying to lower a "
10363 "VECTOR_SHUFFLE to a Blend but "
10364 "with the wrong mask"));
10365 SDValue V1 = SVOp->getOperand(0);
10366 SDValue V2 = SVOp->getOperand(1);
10368 unsigned NumElems = VT.getVectorNumElements();
10370 // Convert i32 vectors to floating point if it is not AVX2.
10371 // AVX2 introduced VPBLENDD instruction for 128 and 256-bit vectors.
10373 if (EltVT == MVT::i64 || (EltVT == MVT::i32 && !Subtarget->hasInt256())) {
10374 BlendVT = MVT::getVectorVT(MVT::getFloatingPointVT(EltVT.getSizeInBits()),
10376 V1 = DAG.getNode(ISD::BITCAST, dl, VT, V1);
10377 V2 = DAG.getNode(ISD::BITCAST, dl, VT, V2);
10380 SDValue Ret = DAG.getNode(X86ISD::BLENDI, dl, BlendVT, V1, V2,
10381 DAG.getConstant(MaskValue, MVT::i32));
10382 return DAG.getNode(ISD::BITCAST, dl, VT, Ret);
10385 /// In vector type \p VT, return true if the element at index \p InputIdx
10386 /// falls on a different 128-bit lane than \p OutputIdx.
10387 static bool ShuffleCrosses128bitLane(MVT VT, unsigned InputIdx,
10388 unsigned OutputIdx) {
10389 unsigned EltSize = VT.getVectorElementType().getSizeInBits();
10390 return InputIdx * EltSize / 128 != OutputIdx * EltSize / 128;
10393 /// Generate a PSHUFB if possible. Selects elements from \p V1 according to
10394 /// \p MaskVals. MaskVals[OutputIdx] = InputIdx specifies that we want to
10395 /// shuffle the element at InputIdx in V1 to OutputIdx in the result. If \p
10396 /// MaskVals refers to elements outside of \p V1 or is undef (-1), insert a
10398 static SDValue getPSHUFB(ArrayRef<int> MaskVals, SDValue V1, SDLoc &dl,
10399 SelectionDAG &DAG) {
10400 MVT VT = V1.getSimpleValueType();
10401 assert(VT.is128BitVector() || VT.is256BitVector());
10403 MVT EltVT = VT.getVectorElementType();
10404 unsigned EltSizeInBytes = EltVT.getSizeInBits() / 8;
10405 unsigned NumElts = VT.getVectorNumElements();
10407 SmallVector<SDValue, 32> PshufbMask;
10408 for (unsigned OutputIdx = 0; OutputIdx < NumElts; ++OutputIdx) {
10409 int InputIdx = MaskVals[OutputIdx];
10410 unsigned InputByteIdx;
10412 if (InputIdx < 0 || NumElts <= (unsigned)InputIdx)
10413 InputByteIdx = 0x80;
10415 // Cross lane is not allowed.
10416 if (ShuffleCrosses128bitLane(VT, InputIdx, OutputIdx))
10418 InputByteIdx = InputIdx * EltSizeInBytes;
10419 // Index is an byte offset within the 128-bit lane.
10420 InputByteIdx &= 0xf;
10423 for (unsigned j = 0; j < EltSizeInBytes; ++j) {
10424 PshufbMask.push_back(DAG.getConstant(InputByteIdx, MVT::i8));
10425 if (InputByteIdx != 0x80)
10430 MVT ShufVT = MVT::getVectorVT(MVT::i8, PshufbMask.size());
10432 V1 = DAG.getNode(ISD::BITCAST, dl, ShufVT, V1);
10433 return DAG.getNode(X86ISD::PSHUFB, dl, ShufVT, V1,
10434 DAG.getNode(ISD::BUILD_VECTOR, dl, ShufVT, PshufbMask));
10437 // v8i16 shuffles - Prefer shuffles in the following order:
10438 // 1. [all] pshuflw, pshufhw, optional move
10439 // 2. [ssse3] 1 x pshufb
10440 // 3. [ssse3] 2 x pshufb + 1 x por
10441 // 4. [all] mov + pshuflw + pshufhw + N x (pextrw + pinsrw)
10443 LowerVECTOR_SHUFFLEv8i16(SDValue Op, const X86Subtarget *Subtarget,
10444 SelectionDAG &DAG) {
10445 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
10446 SDValue V1 = SVOp->getOperand(0);
10447 SDValue V2 = SVOp->getOperand(1);
10449 SmallVector<int, 8> MaskVals;
10451 // Determine if more than 1 of the words in each of the low and high quadwords
10452 // of the result come from the same quadword of one of the two inputs. Undef
10453 // mask values count as coming from any quadword, for better codegen.
10455 // Lo/HiQuad[i] = j indicates how many words from the ith quad of the input
10456 // feeds this quad. For i, 0 and 1 refer to V1, 2 and 3 refer to V2.
10457 unsigned LoQuad[] = { 0, 0, 0, 0 };
10458 unsigned HiQuad[] = { 0, 0, 0, 0 };
10459 // Indices of quads used.
10460 std::bitset<4> InputQuads;
10461 for (unsigned i = 0; i < 8; ++i) {
10462 unsigned *Quad = i < 4 ? LoQuad : HiQuad;
10463 int EltIdx = SVOp->getMaskElt(i);
10464 MaskVals.push_back(EltIdx);
10472 ++Quad[EltIdx / 4];
10473 InputQuads.set(EltIdx / 4);
10476 int BestLoQuad = -1;
10477 unsigned MaxQuad = 1;
10478 for (unsigned i = 0; i < 4; ++i) {
10479 if (LoQuad[i] > MaxQuad) {
10481 MaxQuad = LoQuad[i];
10485 int BestHiQuad = -1;
10487 for (unsigned i = 0; i < 4; ++i) {
10488 if (HiQuad[i] > MaxQuad) {
10490 MaxQuad = HiQuad[i];
10494 // For SSSE3, If all 8 words of the result come from only 1 quadword of each
10495 // of the two input vectors, shuffle them into one input vector so only a
10496 // single pshufb instruction is necessary. If there are more than 2 input
10497 // quads, disable the next transformation since it does not help SSSE3.
10498 bool V1Used = InputQuads[0] || InputQuads[1];
10499 bool V2Used = InputQuads[2] || InputQuads[3];
10500 if (Subtarget->hasSSSE3()) {
10501 if (InputQuads.count() == 2 && V1Used && V2Used) {
10502 BestLoQuad = InputQuads[0] ? 0 : 1;
10503 BestHiQuad = InputQuads[2] ? 2 : 3;
10505 if (InputQuads.count() > 2) {
10511 // If BestLoQuad or BestHiQuad are set, shuffle the quads together and update
10512 // the shuffle mask. If a quad is scored as -1, that means that it contains
10513 // words from all 4 input quadwords.
10515 if (BestLoQuad >= 0 || BestHiQuad >= 0) {
10517 BestLoQuad < 0 ? 0 : BestLoQuad,
10518 BestHiQuad < 0 ? 1 : BestHiQuad
10520 NewV = DAG.getVectorShuffle(MVT::v2i64, dl,
10521 DAG.getNode(ISD::BITCAST, dl, MVT::v2i64, V1),
10522 DAG.getNode(ISD::BITCAST, dl, MVT::v2i64, V2), &MaskV[0]);
10523 NewV = DAG.getNode(ISD::BITCAST, dl, MVT::v8i16, NewV);
10525 // Rewrite the MaskVals and assign NewV to V1 if NewV now contains all the
10526 // source words for the shuffle, to aid later transformations.
10527 bool AllWordsInNewV = true;
10528 bool InOrder[2] = { true, true };
10529 for (unsigned i = 0; i != 8; ++i) {
10530 int idx = MaskVals[i];
10532 InOrder[i/4] = false;
10533 if (idx < 0 || (idx/4) == BestLoQuad || (idx/4) == BestHiQuad)
10535 AllWordsInNewV = false;
10539 bool pshuflw = AllWordsInNewV, pshufhw = AllWordsInNewV;
10540 if (AllWordsInNewV) {
10541 for (int i = 0; i != 8; ++i) {
10542 int idx = MaskVals[i];
10545 idx = MaskVals[i] = (idx / 4) == BestLoQuad ? (idx & 3) : (idx & 3) + 4;
10546 if ((idx != i) && idx < 4)
10548 if ((idx != i) && idx > 3)
10557 // If we've eliminated the use of V2, and the new mask is a pshuflw or
10558 // pshufhw, that's as cheap as it gets. Return the new shuffle.
10559 if ((pshufhw && InOrder[0]) || (pshuflw && InOrder[1])) {
10560 unsigned Opc = pshufhw ? X86ISD::PSHUFHW : X86ISD::PSHUFLW;
10561 unsigned TargetMask = 0;
10562 NewV = DAG.getVectorShuffle(MVT::v8i16, dl, NewV,
10563 DAG.getUNDEF(MVT::v8i16), &MaskVals[0]);
10564 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(NewV.getNode());
10565 TargetMask = pshufhw ? getShufflePSHUFHWImmediate(SVOp):
10566 getShufflePSHUFLWImmediate(SVOp);
10567 V1 = NewV.getOperand(0);
10568 return getTargetShuffleNode(Opc, dl, MVT::v8i16, V1, TargetMask, DAG);
10572 // Promote splats to a larger type which usually leads to more efficient code.
10573 // FIXME: Is this true if pshufb is available?
10574 if (SVOp->isSplat())
10575 return PromoteSplat(SVOp, DAG);
10577 // If we have SSSE3, and all words of the result are from 1 input vector,
10578 // case 2 is generated, otherwise case 3 is generated. If no SSSE3
10579 // is present, fall back to case 4.
10580 if (Subtarget->hasSSSE3()) {
10581 SmallVector<SDValue,16> pshufbMask;
10583 // If we have elements from both input vectors, set the high bit of the
10584 // shuffle mask element to zero out elements that come from V2 in the V1
10585 // mask, and elements that come from V1 in the V2 mask, so that the two
10586 // results can be OR'd together.
10587 bool TwoInputs = V1Used && V2Used;
10588 V1 = getPSHUFB(MaskVals, V1, dl, DAG);
10590 return DAG.getNode(ISD::BITCAST, dl, MVT::v8i16, V1);
10592 // Calculate the shuffle mask for the second input, shuffle it, and
10593 // OR it with the first shuffled input.
10594 CommuteVectorShuffleMask(MaskVals, 8);
10595 V2 = getPSHUFB(MaskVals, V2, dl, DAG);
10596 V1 = DAG.getNode(ISD::OR, dl, MVT::v16i8, V1, V2);
10597 return DAG.getNode(ISD::BITCAST, dl, MVT::v8i16, V1);
10600 // If BestLoQuad >= 0, generate a pshuflw to put the low elements in order,
10601 // and update MaskVals with new element order.
10602 std::bitset<8> InOrder;
10603 if (BestLoQuad >= 0) {
10604 int MaskV[] = { -1, -1, -1, -1, 4, 5, 6, 7 };
10605 for (int i = 0; i != 4; ++i) {
10606 int idx = MaskVals[i];
10609 } else if ((idx / 4) == BestLoQuad) {
10610 MaskV[i] = idx & 3;
10614 NewV = DAG.getVectorShuffle(MVT::v8i16, dl, NewV, DAG.getUNDEF(MVT::v8i16),
10617 if (NewV.getOpcode() == ISD::VECTOR_SHUFFLE && Subtarget->hasSSE2()) {
10618 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(NewV.getNode());
10619 NewV = getTargetShuffleNode(X86ISD::PSHUFLW, dl, MVT::v8i16,
10620 NewV.getOperand(0),
10621 getShufflePSHUFLWImmediate(SVOp), DAG);
10625 // If BestHi >= 0, generate a pshufhw to put the high elements in order,
10626 // and update MaskVals with the new element order.
10627 if (BestHiQuad >= 0) {
10628 int MaskV[] = { 0, 1, 2, 3, -1, -1, -1, -1 };
10629 for (unsigned i = 4; i != 8; ++i) {
10630 int idx = MaskVals[i];
10633 } else if ((idx / 4) == BestHiQuad) {
10634 MaskV[i] = (idx & 3) + 4;
10638 NewV = DAG.getVectorShuffle(MVT::v8i16, dl, NewV, DAG.getUNDEF(MVT::v8i16),
10641 if (NewV.getOpcode() == ISD::VECTOR_SHUFFLE && Subtarget->hasSSE2()) {
10642 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(NewV.getNode());
10643 NewV = getTargetShuffleNode(X86ISD::PSHUFHW, dl, MVT::v8i16,
10644 NewV.getOperand(0),
10645 getShufflePSHUFHWImmediate(SVOp), DAG);
10649 // In case BestHi & BestLo were both -1, which means each quadword has a word
10650 // from each of the four input quadwords, calculate the InOrder bitvector now
10651 // before falling through to the insert/extract cleanup.
10652 if (BestLoQuad == -1 && BestHiQuad == -1) {
10654 for (int i = 0; i != 8; ++i)
10655 if (MaskVals[i] < 0 || MaskVals[i] == i)
10659 // The other elements are put in the right place using pextrw and pinsrw.
10660 for (unsigned i = 0; i != 8; ++i) {
10663 int EltIdx = MaskVals[i];
10666 SDValue ExtOp = (EltIdx < 8) ?
10667 DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::i16, V1,
10668 DAG.getIntPtrConstant(EltIdx)) :
10669 DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::i16, V2,
10670 DAG.getIntPtrConstant(EltIdx - 8));
10671 NewV = DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, MVT::v8i16, NewV, ExtOp,
10672 DAG.getIntPtrConstant(i));
10677 /// \brief v16i16 shuffles
10679 /// FIXME: We only support generation of a single pshufb currently. We can
10680 /// generalize the other applicable cases from LowerVECTOR_SHUFFLEv8i16 as
10681 /// well (e.g 2 x pshufb + 1 x por).
10683 LowerVECTOR_SHUFFLEv16i16(SDValue Op, SelectionDAG &DAG) {
10684 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
10685 SDValue V1 = SVOp->getOperand(0);
10686 SDValue V2 = SVOp->getOperand(1);
10689 if (V2.getOpcode() != ISD::UNDEF)
10692 SmallVector<int, 16> MaskVals(SVOp->getMask().begin(), SVOp->getMask().end());
10693 return getPSHUFB(MaskVals, V1, dl, DAG);
10696 // v16i8 shuffles - Prefer shuffles in the following order:
10697 // 1. [ssse3] 1 x pshufb
10698 // 2. [ssse3] 2 x pshufb + 1 x por
10699 // 3. [all] v8i16 shuffle + N x pextrw + rotate + pinsrw
10700 static SDValue LowerVECTOR_SHUFFLEv16i8(ShuffleVectorSDNode *SVOp,
10701 const X86Subtarget* Subtarget,
10702 SelectionDAG &DAG) {
10703 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
10704 SDValue V1 = SVOp->getOperand(0);
10705 SDValue V2 = SVOp->getOperand(1);
10707 ArrayRef<int> MaskVals = SVOp->getMask();
10709 // Promote splats to a larger type which usually leads to more efficient code.
10710 // FIXME: Is this true if pshufb is available?
10711 if (SVOp->isSplat())
10712 return PromoteSplat(SVOp, DAG);
10714 // If we have SSSE3, case 1 is generated when all result bytes come from
10715 // one of the inputs. Otherwise, case 2 is generated. If no SSSE3 is
10716 // present, fall back to case 3.
10718 // If SSSE3, use 1 pshufb instruction per vector with elements in the result.
10719 if (Subtarget->hasSSSE3()) {
10720 SmallVector<SDValue,16> pshufbMask;
10722 // If all result elements are from one input vector, then only translate
10723 // undef mask values to 0x80 (zero out result) in the pshufb mask.
10725 // Otherwise, we have elements from both input vectors, and must zero out
10726 // elements that come from V2 in the first mask, and V1 in the second mask
10727 // so that we can OR them together.
10728 for (unsigned i = 0; i != 16; ++i) {
10729 int EltIdx = MaskVals[i];
10730 if (EltIdx < 0 || EltIdx >= 16)
10732 pshufbMask.push_back(DAG.getConstant(EltIdx, MVT::i8));
10734 V1 = DAG.getNode(X86ISD::PSHUFB, dl, MVT::v16i8, V1,
10735 DAG.getNode(ISD::BUILD_VECTOR, dl,
10736 MVT::v16i8, pshufbMask));
10738 // As PSHUFB will zero elements with negative indices, it's safe to ignore
10739 // the 2nd operand if it's undefined or zero.
10740 if (V2.getOpcode() == ISD::UNDEF ||
10741 ISD::isBuildVectorAllZeros(V2.getNode()))
10744 // Calculate the shuffle mask for the second input, shuffle it, and
10745 // OR it with the first shuffled input.
10746 pshufbMask.clear();
10747 for (unsigned i = 0; i != 16; ++i) {
10748 int EltIdx = MaskVals[i];
10749 EltIdx = (EltIdx < 16) ? 0x80 : EltIdx - 16;
10750 pshufbMask.push_back(DAG.getConstant(EltIdx, MVT::i8));
10752 V2 = DAG.getNode(X86ISD::PSHUFB, dl, MVT::v16i8, V2,
10753 DAG.getNode(ISD::BUILD_VECTOR, dl,
10754 MVT::v16i8, pshufbMask));
10755 return DAG.getNode(ISD::OR, dl, MVT::v16i8, V1, V2);
10758 // No SSSE3 - Calculate in place words and then fix all out of place words
10759 // With 0-16 extracts & inserts. Worst case is 16 bytes out of order from
10760 // the 16 different words that comprise the two doublequadword input vectors.
10761 V1 = DAG.getNode(ISD::BITCAST, dl, MVT::v8i16, V1);
10762 V2 = DAG.getNode(ISD::BITCAST, dl, MVT::v8i16, V2);
10764 for (int i = 0; i != 8; ++i) {
10765 int Elt0 = MaskVals[i*2];
10766 int Elt1 = MaskVals[i*2+1];
10768 // This word of the result is all undef, skip it.
10769 if (Elt0 < 0 && Elt1 < 0)
10772 // This word of the result is already in the correct place, skip it.
10773 if ((Elt0 == i*2) && (Elt1 == i*2+1))
10776 SDValue Elt0Src = Elt0 < 16 ? V1 : V2;
10777 SDValue Elt1Src = Elt1 < 16 ? V1 : V2;
10780 // If Elt0 and Elt1 are defined, are consecutive, and can be load
10781 // using a single extract together, load it and store it.
10782 if ((Elt0 >= 0) && ((Elt0 + 1) == Elt1) && ((Elt0 & 1) == 0)) {
10783 InsElt = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::i16, Elt1Src,
10784 DAG.getIntPtrConstant(Elt1 / 2));
10785 NewV = DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, MVT::v8i16, NewV, InsElt,
10786 DAG.getIntPtrConstant(i));
10790 // If Elt1 is defined, extract it from the appropriate source. If the
10791 // source byte is not also odd, shift the extracted word left 8 bits
10792 // otherwise clear the bottom 8 bits if we need to do an or.
10794 InsElt = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::i16, Elt1Src,
10795 DAG.getIntPtrConstant(Elt1 / 2));
10796 if ((Elt1 & 1) == 0)
10797 InsElt = DAG.getNode(ISD::SHL, dl, MVT::i16, InsElt,
10799 TLI.getShiftAmountTy(InsElt.getValueType())));
10800 else if (Elt0 >= 0)
10801 InsElt = DAG.getNode(ISD::AND, dl, MVT::i16, InsElt,
10802 DAG.getConstant(0xFF00, MVT::i16));
10804 // If Elt0 is defined, extract it from the appropriate source. If the
10805 // source byte is not also even, shift the extracted word right 8 bits. If
10806 // Elt1 was also defined, OR the extracted values together before
10807 // inserting them in the result.
10809 SDValue InsElt0 = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::i16,
10810 Elt0Src, DAG.getIntPtrConstant(Elt0 / 2));
10811 if ((Elt0 & 1) != 0)
10812 InsElt0 = DAG.getNode(ISD::SRL, dl, MVT::i16, InsElt0,
10814 TLI.getShiftAmountTy(InsElt0.getValueType())));
10815 else if (Elt1 >= 0)
10816 InsElt0 = DAG.getNode(ISD::AND, dl, MVT::i16, InsElt0,
10817 DAG.getConstant(0x00FF, MVT::i16));
10818 InsElt = Elt1 >= 0 ? DAG.getNode(ISD::OR, dl, MVT::i16, InsElt, InsElt0)
10821 NewV = DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, MVT::v8i16, NewV, InsElt,
10822 DAG.getIntPtrConstant(i));
10824 return DAG.getNode(ISD::BITCAST, dl, MVT::v16i8, NewV);
10827 // v32i8 shuffles - Translate to VPSHUFB if possible.
10829 SDValue LowerVECTOR_SHUFFLEv32i8(ShuffleVectorSDNode *SVOp,
10830 const X86Subtarget *Subtarget,
10831 SelectionDAG &DAG) {
10832 MVT VT = SVOp->getSimpleValueType(0);
10833 SDValue V1 = SVOp->getOperand(0);
10834 SDValue V2 = SVOp->getOperand(1);
10836 SmallVector<int, 32> MaskVals(SVOp->getMask().begin(), SVOp->getMask().end());
10838 bool V2IsUndef = V2.getOpcode() == ISD::UNDEF;
10839 bool V1IsAllZero = ISD::isBuildVectorAllZeros(V1.getNode());
10840 bool V2IsAllZero = ISD::isBuildVectorAllZeros(V2.getNode());
10842 // VPSHUFB may be generated if
10843 // (1) one of input vector is undefined or zeroinitializer.
10844 // The mask value 0x80 puts 0 in the corresponding slot of the vector.
10845 // And (2) the mask indexes don't cross the 128-bit lane.
10846 if (VT != MVT::v32i8 || !Subtarget->hasInt256() ||
10847 (!V2IsUndef && !V2IsAllZero && !V1IsAllZero))
10850 if (V1IsAllZero && !V2IsAllZero) {
10851 CommuteVectorShuffleMask(MaskVals, 32);
10854 return getPSHUFB(MaskVals, V1, dl, DAG);
10857 /// RewriteAsNarrowerShuffle - Try rewriting v8i16 and v16i8 shuffles as 4 wide
10858 /// ones, or rewriting v4i32 / v4f32 as 2 wide ones if possible. This can be
10859 /// done when every pair / quad of shuffle mask elements point to elements in
10860 /// the right sequence. e.g.
10861 /// vector_shuffle X, Y, <2, 3, | 10, 11, | 0, 1, | 14, 15>
10863 SDValue RewriteAsNarrowerShuffle(ShuffleVectorSDNode *SVOp,
10864 SelectionDAG &DAG) {
10865 MVT VT = SVOp->getSimpleValueType(0);
10867 unsigned NumElems = VT.getVectorNumElements();
10870 switch (VT.SimpleTy) {
10871 default: llvm_unreachable("Unexpected!");
10874 return SDValue(SVOp, 0);
10875 case MVT::v4f32: NewVT = MVT::v2f64; Scale = 2; break;
10876 case MVT::v4i32: NewVT = MVT::v2i64; Scale = 2; break;
10877 case MVT::v8i16: NewVT = MVT::v4i32; Scale = 2; break;
10878 case MVT::v16i8: NewVT = MVT::v4i32; Scale = 4; break;
10879 case MVT::v16i16: NewVT = MVT::v8i32; Scale = 2; break;
10880 case MVT::v32i8: NewVT = MVT::v8i32; Scale = 4; break;
10883 SmallVector<int, 8> MaskVec;
10884 for (unsigned i = 0; i != NumElems; i += Scale) {
10886 for (unsigned j = 0; j != Scale; ++j) {
10887 int EltIdx = SVOp->getMaskElt(i+j);
10891 StartIdx = (EltIdx / Scale);
10892 if (EltIdx != (int)(StartIdx*Scale + j))
10895 MaskVec.push_back(StartIdx);
10898 SDValue V1 = DAG.getNode(ISD::BITCAST, dl, NewVT, SVOp->getOperand(0));
10899 SDValue V2 = DAG.getNode(ISD::BITCAST, dl, NewVT, SVOp->getOperand(1));
10900 return DAG.getVectorShuffle(NewVT, dl, V1, V2, &MaskVec[0]);
10903 /// getVZextMovL - Return a zero-extending vector move low node.
10905 static SDValue getVZextMovL(MVT VT, MVT OpVT,
10906 SDValue SrcOp, SelectionDAG &DAG,
10907 const X86Subtarget *Subtarget, SDLoc dl) {
10908 if (VT == MVT::v2f64 || VT == MVT::v4f32) {
10909 LoadSDNode *LD = nullptr;
10910 if (!isScalarLoadToVector(SrcOp.getNode(), &LD))
10911 LD = dyn_cast<LoadSDNode>(SrcOp);
10913 // movssrr and movsdrr do not clear top bits. Try to use movd, movq
10915 MVT ExtVT = (OpVT == MVT::v2f64) ? MVT::i64 : MVT::i32;
10916 if ((ExtVT != MVT::i64 || Subtarget->is64Bit()) &&
10917 SrcOp.getOpcode() == ISD::SCALAR_TO_VECTOR &&
10918 SrcOp.getOperand(0).getOpcode() == ISD::BITCAST &&
10919 SrcOp.getOperand(0).getOperand(0).getValueType() == ExtVT) {
10921 OpVT = (OpVT == MVT::v2f64) ? MVT::v2i64 : MVT::v4i32;
10922 return DAG.getNode(ISD::BITCAST, dl, VT,
10923 DAG.getNode(X86ISD::VZEXT_MOVL, dl, OpVT,
10924 DAG.getNode(ISD::SCALAR_TO_VECTOR, dl,
10926 SrcOp.getOperand(0)
10932 return DAG.getNode(ISD::BITCAST, dl, VT,
10933 DAG.getNode(X86ISD::VZEXT_MOVL, dl, OpVT,
10934 DAG.getNode(ISD::BITCAST, dl,
10938 /// LowerVECTOR_SHUFFLE_256 - Handle all 256-bit wide vectors shuffles
10939 /// which could not be matched by any known target speficic shuffle
10941 LowerVECTOR_SHUFFLE_256(ShuffleVectorSDNode *SVOp, SelectionDAG &DAG) {
10943 SDValue NewOp = Compact8x32ShuffleNode(SVOp, DAG);
10944 if (NewOp.getNode())
10947 MVT VT = SVOp->getSimpleValueType(0);
10949 unsigned NumElems = VT.getVectorNumElements();
10950 unsigned NumLaneElems = NumElems / 2;
10953 MVT EltVT = VT.getVectorElementType();
10954 MVT NVT = MVT::getVectorVT(EltVT, NumLaneElems);
10957 SmallVector<int, 16> Mask;
10958 for (unsigned l = 0; l < 2; ++l) {
10959 // Build a shuffle mask for the output, discovering on the fly which
10960 // input vectors to use as shuffle operands (recorded in InputUsed).
10961 // If building a suitable shuffle vector proves too hard, then bail
10962 // out with UseBuildVector set.
10963 bool UseBuildVector = false;
10964 int InputUsed[2] = { -1, -1 }; // Not yet discovered.
10965 unsigned LaneStart = l * NumLaneElems;
10966 for (unsigned i = 0; i != NumLaneElems; ++i) {
10967 // The mask element. This indexes into the input.
10968 int Idx = SVOp->getMaskElt(i+LaneStart);
10970 // the mask element does not index into any input vector.
10971 Mask.push_back(-1);
10975 // The input vector this mask element indexes into.
10976 int Input = Idx / NumLaneElems;
10978 // Turn the index into an offset from the start of the input vector.
10979 Idx -= Input * NumLaneElems;
10981 // Find or create a shuffle vector operand to hold this input.
10983 for (OpNo = 0; OpNo < array_lengthof(InputUsed); ++OpNo) {
10984 if (InputUsed[OpNo] == Input)
10985 // This input vector is already an operand.
10987 if (InputUsed[OpNo] < 0) {
10988 // Create a new operand for this input vector.
10989 InputUsed[OpNo] = Input;
10994 if (OpNo >= array_lengthof(InputUsed)) {
10995 // More than two input vectors used! Give up on trying to create a
10996 // shuffle vector. Insert all elements into a BUILD_VECTOR instead.
10997 UseBuildVector = true;
11001 // Add the mask index for the new shuffle vector.
11002 Mask.push_back(Idx + OpNo * NumLaneElems);
11005 if (UseBuildVector) {
11006 SmallVector<SDValue, 16> SVOps;
11007 for (unsigned i = 0; i != NumLaneElems; ++i) {
11008 // The mask element. This indexes into the input.
11009 int Idx = SVOp->getMaskElt(i+LaneStart);
11011 SVOps.push_back(DAG.getUNDEF(EltVT));
11015 // The input vector this mask element indexes into.
11016 int Input = Idx / NumElems;
11018 // Turn the index into an offset from the start of the input vector.
11019 Idx -= Input * NumElems;
11021 // Extract the vector element by hand.
11022 SVOps.push_back(DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, EltVT,
11023 SVOp->getOperand(Input),
11024 DAG.getIntPtrConstant(Idx)));
11027 // Construct the output using a BUILD_VECTOR.
11028 Output[l] = DAG.getNode(ISD::BUILD_VECTOR, dl, NVT, SVOps);
11029 } else if (InputUsed[0] < 0) {
11030 // No input vectors were used! The result is undefined.
11031 Output[l] = DAG.getUNDEF(NVT);
11033 SDValue Op0 = Extract128BitVector(SVOp->getOperand(InputUsed[0] / 2),
11034 (InputUsed[0] % 2) * NumLaneElems,
11036 // If only one input was used, use an undefined vector for the other.
11037 SDValue Op1 = (InputUsed[1] < 0) ? DAG.getUNDEF(NVT) :
11038 Extract128BitVector(SVOp->getOperand(InputUsed[1] / 2),
11039 (InputUsed[1] % 2) * NumLaneElems, DAG, dl);
11040 // At least one input vector was used. Create a new shuffle vector.
11041 Output[l] = DAG.getVectorShuffle(NVT, dl, Op0, Op1, &Mask[0]);
11047 // Concatenate the result back
11048 return DAG.getNode(ISD::CONCAT_VECTORS, dl, VT, Output[0], Output[1]);
11051 /// LowerVECTOR_SHUFFLE_128v4 - Handle all 128-bit wide vectors with
11052 /// 4 elements, and match them with several different shuffle types.
11054 LowerVECTOR_SHUFFLE_128v4(ShuffleVectorSDNode *SVOp, SelectionDAG &DAG) {
11055 SDValue V1 = SVOp->getOperand(0);
11056 SDValue V2 = SVOp->getOperand(1);
11058 MVT VT = SVOp->getSimpleValueType(0);
11060 assert(VT.is128BitVector() && "Unsupported vector size");
11062 std::pair<int, int> Locs[4];
11063 int Mask1[] = { -1, -1, -1, -1 };
11064 SmallVector<int, 8> PermMask(SVOp->getMask().begin(), SVOp->getMask().end());
11066 unsigned NumHi = 0;
11067 unsigned NumLo = 0;
11068 for (unsigned i = 0; i != 4; ++i) {
11069 int Idx = PermMask[i];
11071 Locs[i] = std::make_pair(-1, -1);
11073 assert(Idx < 8 && "Invalid VECTOR_SHUFFLE index!");
11075 Locs[i] = std::make_pair(0, NumLo);
11076 Mask1[NumLo] = Idx;
11079 Locs[i] = std::make_pair(1, NumHi);
11081 Mask1[2+NumHi] = Idx;
11087 if (NumLo <= 2 && NumHi <= 2) {
11088 // If no more than two elements come from either vector. This can be
11089 // implemented with two shuffles. First shuffle gather the elements.
11090 // The second shuffle, which takes the first shuffle as both of its
11091 // vector operands, put the elements into the right order.
11092 V1 = DAG.getVectorShuffle(VT, dl, V1, V2, &Mask1[0]);
11094 int Mask2[] = { -1, -1, -1, -1 };
11096 for (unsigned i = 0; i != 4; ++i)
11097 if (Locs[i].first != -1) {
11098 unsigned Idx = (i < 2) ? 0 : 4;
11099 Idx += Locs[i].first * 2 + Locs[i].second;
11103 return DAG.getVectorShuffle(VT, dl, V1, V1, &Mask2[0]);
11106 if (NumLo == 3 || NumHi == 3) {
11107 // Otherwise, we must have three elements from one vector, call it X, and
11108 // one element from the other, call it Y. First, use a shufps to build an
11109 // intermediate vector with the one element from Y and the element from X
11110 // that will be in the same half in the final destination (the indexes don't
11111 // matter). Then, use a shufps to build the final vector, taking the half
11112 // containing the element from Y from the intermediate, and the other half
11115 // Normalize it so the 3 elements come from V1.
11116 CommuteVectorShuffleMask(PermMask, 4);
11120 // Find the element from V2.
11122 for (HiIndex = 0; HiIndex < 3; ++HiIndex) {
11123 int Val = PermMask[HiIndex];
11130 Mask1[0] = PermMask[HiIndex];
11132 Mask1[2] = PermMask[HiIndex^1];
11134 V2 = DAG.getVectorShuffle(VT, dl, V1, V2, &Mask1[0]);
11136 if (HiIndex >= 2) {
11137 Mask1[0] = PermMask[0];
11138 Mask1[1] = PermMask[1];
11139 Mask1[2] = HiIndex & 1 ? 6 : 4;
11140 Mask1[3] = HiIndex & 1 ? 4 : 6;
11141 return DAG.getVectorShuffle(VT, dl, V1, V2, &Mask1[0]);
11144 Mask1[0] = HiIndex & 1 ? 2 : 0;
11145 Mask1[1] = HiIndex & 1 ? 0 : 2;
11146 Mask1[2] = PermMask[2];
11147 Mask1[3] = PermMask[3];
11152 return DAG.getVectorShuffle(VT, dl, V2, V1, &Mask1[0]);
11155 // Break it into (shuffle shuffle_hi, shuffle_lo).
11156 int LoMask[] = { -1, -1, -1, -1 };
11157 int HiMask[] = { -1, -1, -1, -1 };
11159 int *MaskPtr = LoMask;
11160 unsigned MaskIdx = 0;
11161 unsigned LoIdx = 0;
11162 unsigned HiIdx = 2;
11163 for (unsigned i = 0; i != 4; ++i) {
11170 int Idx = PermMask[i];
11172 Locs[i] = std::make_pair(-1, -1);
11173 } else if (Idx < 4) {
11174 Locs[i] = std::make_pair(MaskIdx, LoIdx);
11175 MaskPtr[LoIdx] = Idx;
11178 Locs[i] = std::make_pair(MaskIdx, HiIdx);
11179 MaskPtr[HiIdx] = Idx;
11184 SDValue LoShuffle = DAG.getVectorShuffle(VT, dl, V1, V2, &LoMask[0]);
11185 SDValue HiShuffle = DAG.getVectorShuffle(VT, dl, V1, V2, &HiMask[0]);
11186 int MaskOps[] = { -1, -1, -1, -1 };
11187 for (unsigned i = 0; i != 4; ++i)
11188 if (Locs[i].first != -1)
11189 MaskOps[i] = Locs[i].first * 4 + Locs[i].second;
11190 return DAG.getVectorShuffle(VT, dl, LoShuffle, HiShuffle, &MaskOps[0]);
11193 static bool MayFoldVectorLoad(SDValue V) {
11194 while (V.hasOneUse() && V.getOpcode() == ISD::BITCAST)
11195 V = V.getOperand(0);
11197 if (V.hasOneUse() && V.getOpcode() == ISD::SCALAR_TO_VECTOR)
11198 V = V.getOperand(0);
11199 if (V.hasOneUse() && V.getOpcode() == ISD::BUILD_VECTOR &&
11200 V.getNumOperands() == 2 && V.getOperand(1).getOpcode() == ISD::UNDEF)
11201 // BUILD_VECTOR (load), undef
11202 V = V.getOperand(0);
11204 return MayFoldLoad(V);
11208 SDValue getMOVDDup(SDValue &Op, SDLoc &dl, SDValue V1, SelectionDAG &DAG) {
11209 MVT VT = Op.getSimpleValueType();
11211 // Canonizalize to v2f64.
11212 V1 = DAG.getNode(ISD::BITCAST, dl, MVT::v2f64, V1);
11213 return DAG.getNode(ISD::BITCAST, dl, VT,
11214 getTargetShuffleNode(X86ISD::MOVDDUP, dl, MVT::v2f64,
11219 SDValue getMOVLowToHigh(SDValue &Op, SDLoc &dl, SelectionDAG &DAG,
11221 SDValue V1 = Op.getOperand(0);
11222 SDValue V2 = Op.getOperand(1);
11223 MVT VT = Op.getSimpleValueType();
11225 assert(VT != MVT::v2i64 && "unsupported shuffle type");
11227 if (HasSSE2 && VT == MVT::v2f64)
11228 return getTargetShuffleNode(X86ISD::MOVLHPD, dl, VT, V1, V2, DAG);
11230 // v4f32 or v4i32: canonizalized to v4f32 (which is legal for SSE1)
11231 return DAG.getNode(ISD::BITCAST, dl, VT,
11232 getTargetShuffleNode(X86ISD::MOVLHPS, dl, MVT::v4f32,
11233 DAG.getNode(ISD::BITCAST, dl, MVT::v4f32, V1),
11234 DAG.getNode(ISD::BITCAST, dl, MVT::v4f32, V2), DAG));
11238 SDValue getMOVHighToLow(SDValue &Op, SDLoc &dl, SelectionDAG &DAG) {
11239 SDValue V1 = Op.getOperand(0);
11240 SDValue V2 = Op.getOperand(1);
11241 MVT VT = Op.getSimpleValueType();
11243 assert((VT == MVT::v4i32 || VT == MVT::v4f32) &&
11244 "unsupported shuffle type");
11246 if (V2.getOpcode() == ISD::UNDEF)
11250 return getTargetShuffleNode(X86ISD::MOVHLPS, dl, VT, V1, V2, DAG);
11254 SDValue getMOVLP(SDValue &Op, SDLoc &dl, SelectionDAG &DAG, bool HasSSE2) {
11255 SDValue V1 = Op.getOperand(0);
11256 SDValue V2 = Op.getOperand(1);
11257 MVT VT = Op.getSimpleValueType();
11258 unsigned NumElems = VT.getVectorNumElements();
11260 // Use MOVLPS and MOVLPD in case V1 or V2 are loads. During isel, the second
11261 // operand of these instructions is only memory, so check if there's a
11262 // potencial load folding here, otherwise use SHUFPS or MOVSD to match the
11264 bool CanFoldLoad = false;
11266 // Trivial case, when V2 comes from a load.
11267 if (MayFoldVectorLoad(V2))
11268 CanFoldLoad = true;
11270 // When V1 is a load, it can be folded later into a store in isel, example:
11271 // (store (v4f32 (X86Movlps (load addr:$src1), VR128:$src2)), addr:$src1)
11273 // (MOVLPSmr addr:$src1, VR128:$src2)
11274 // So, recognize this potential and also use MOVLPS or MOVLPD
11275 else if (MayFoldVectorLoad(V1) && MayFoldIntoStore(Op))
11276 CanFoldLoad = true;
11278 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
11280 if (HasSSE2 && NumElems == 2)
11281 return getTargetShuffleNode(X86ISD::MOVLPD, dl, VT, V1, V2, DAG);
11284 // If we don't care about the second element, proceed to use movss.
11285 if (SVOp->getMaskElt(1) != -1)
11286 return getTargetShuffleNode(X86ISD::MOVLPS, dl, VT, V1, V2, DAG);
11289 // movl and movlp will both match v2i64, but v2i64 is never matched by
11290 // movl earlier because we make it strict to avoid messing with the movlp load
11291 // folding logic (see the code above getMOVLP call). Match it here then,
11292 // this is horrible, but will stay like this until we move all shuffle
11293 // matching to x86 specific nodes. Note that for the 1st condition all
11294 // types are matched with movsd.
11296 // FIXME: isMOVLMask should be checked and matched before getMOVLP,
11297 // as to remove this logic from here, as much as possible
11298 if (NumElems == 2 || !isMOVLMask(SVOp->getMask(), VT))
11299 return getTargetShuffleNode(X86ISD::MOVSD, dl, VT, V1, V2, DAG);
11300 return getTargetShuffleNode(X86ISD::MOVSS, dl, VT, V1, V2, DAG);
11303 assert(VT != MVT::v4i32 && "unsupported shuffle type");
11305 // Invert the operand order and use SHUFPS to match it.
11306 return getTargetShuffleNode(X86ISD::SHUFP, dl, VT, V2, V1,
11307 getShuffleSHUFImmediate(SVOp), DAG);
11310 static SDValue NarrowVectorLoadToElement(LoadSDNode *Load, unsigned Index,
11311 SelectionDAG &DAG) {
11313 MVT VT = Load->getSimpleValueType(0);
11314 MVT EVT = VT.getVectorElementType();
11315 SDValue Addr = Load->getOperand(1);
11316 SDValue NewAddr = DAG.getNode(
11317 ISD::ADD, dl, Addr.getSimpleValueType(), Addr,
11318 DAG.getConstant(Index * EVT.getStoreSize(), Addr.getSimpleValueType()));
11321 DAG.getLoad(EVT, dl, Load->getChain(), NewAddr,
11322 DAG.getMachineFunction().getMachineMemOperand(
11323 Load->getMemOperand(), 0, EVT.getStoreSize()));
11327 // It is only safe to call this function if isINSERTPSMask is true for
11328 // this shufflevector mask.
11329 static SDValue getINSERTPS(ShuffleVectorSDNode *SVOp, SDLoc &dl,
11330 SelectionDAG &DAG) {
11331 // Generate an insertps instruction when inserting an f32 from memory onto a
11332 // v4f32 or when copying a member from one v4f32 to another.
11333 // We also use it for transferring i32 from one register to another,
11334 // since it simply copies the same bits.
11335 // If we're transferring an i32 from memory to a specific element in a
11336 // register, we output a generic DAG that will match the PINSRD
11338 MVT VT = SVOp->getSimpleValueType(0);
11339 MVT EVT = VT.getVectorElementType();
11340 SDValue V1 = SVOp->getOperand(0);
11341 SDValue V2 = SVOp->getOperand(1);
11342 auto Mask = SVOp->getMask();
11343 assert((VT == MVT::v4f32 || VT == MVT::v4i32) &&
11344 "unsupported vector type for insertps/pinsrd");
11346 auto FromV1Predicate = [](const int &i) { return i < 4 && i > -1; };
11347 auto FromV2Predicate = [](const int &i) { return i >= 4; };
11348 int FromV1 = std::count_if(Mask.begin(), Mask.end(), FromV1Predicate);
11352 unsigned DestIndex;
11356 DestIndex = std::find_if(Mask.begin(), Mask.end(), FromV1Predicate) -
11359 // If we have 1 element from each vector, we have to check if we're
11360 // changing V1's element's place. If so, we're done. Otherwise, we
11361 // should assume we're changing V2's element's place and behave
11363 int FromV2 = std::count_if(Mask.begin(), Mask.end(), FromV2Predicate);
11364 assert(DestIndex <= INT32_MAX && "truncated destination index");
11365 if (FromV1 == FromV2 &&
11366 static_cast<int>(DestIndex) == Mask[DestIndex] % 4) {
11370 std::find_if(Mask.begin(), Mask.end(), FromV2Predicate) - Mask.begin();
11373 assert(std::count_if(Mask.begin(), Mask.end(), FromV2Predicate) == 1 &&
11374 "More than one element from V1 and from V2, or no elements from one "
11375 "of the vectors. This case should not have returned true from "
11380 std::find_if(Mask.begin(), Mask.end(), FromV2Predicate) - Mask.begin();
11383 // Get an index into the source vector in the range [0,4) (the mask is
11384 // in the range [0,8) because it can address V1 and V2)
11385 unsigned SrcIndex = Mask[DestIndex] % 4;
11386 if (MayFoldLoad(From)) {
11387 // Trivial case, when From comes from a load and is only used by the
11388 // shuffle. Make it use insertps from the vector that we need from that
11391 NarrowVectorLoadToElement(cast<LoadSDNode>(From), SrcIndex, DAG);
11392 if (!NewLoad.getNode())
11395 if (EVT == MVT::f32) {
11396 // Create this as a scalar to vector to match the instruction pattern.
11397 SDValue LoadScalarToVector =
11398 DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VT, NewLoad);
11399 SDValue InsertpsMask = DAG.getIntPtrConstant(DestIndex << 4);
11400 return DAG.getNode(X86ISD::INSERTPS, dl, VT, To, LoadScalarToVector,
11402 } else { // EVT == MVT::i32
11403 // If we're getting an i32 from memory, use an INSERT_VECTOR_ELT
11404 // instruction, to match the PINSRD instruction, which loads an i32 to a
11405 // certain vector element.
11406 return DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, VT, To, NewLoad,
11407 DAG.getConstant(DestIndex, MVT::i32));
11411 // Vector-element-to-vector
11412 SDValue InsertpsMask = DAG.getIntPtrConstant(DestIndex << 4 | SrcIndex << 6);
11413 return DAG.getNode(X86ISD::INSERTPS, dl, VT, To, From, InsertpsMask);
11416 // Reduce a vector shuffle to zext.
11417 static SDValue LowerVectorIntExtend(SDValue Op, const X86Subtarget *Subtarget,
11418 SelectionDAG &DAG) {
11419 // PMOVZX is only available from SSE41.
11420 if (!Subtarget->hasSSE41())
11423 MVT VT = Op.getSimpleValueType();
11425 // Only AVX2 support 256-bit vector integer extending.
11426 if (!Subtarget->hasInt256() && VT.is256BitVector())
11429 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
11431 SDValue V1 = Op.getOperand(0);
11432 SDValue V2 = Op.getOperand(1);
11433 unsigned NumElems = VT.getVectorNumElements();
11435 // Extending is an unary operation and the element type of the source vector
11436 // won't be equal to or larger than i64.
11437 if (V2.getOpcode() != ISD::UNDEF || !VT.isInteger() ||
11438 VT.getVectorElementType() == MVT::i64)
11441 // Find the expansion ratio, e.g. expanding from i8 to i32 has a ratio of 4.
11442 unsigned Shift = 1; // Start from 2, i.e. 1 << 1.
11443 while ((1U << Shift) < NumElems) {
11444 if (SVOp->getMaskElt(1U << Shift) == 1)
11447 // The maximal ratio is 8, i.e. from i8 to i64.
11452 // Check the shuffle mask.
11453 unsigned Mask = (1U << Shift) - 1;
11454 for (unsigned i = 0; i != NumElems; ++i) {
11455 int EltIdx = SVOp->getMaskElt(i);
11456 if ((i & Mask) != 0 && EltIdx != -1)
11458 if ((i & Mask) == 0 && (unsigned)EltIdx != (i >> Shift))
11462 unsigned NBits = VT.getVectorElementType().getSizeInBits() << Shift;
11463 MVT NeVT = MVT::getIntegerVT(NBits);
11464 MVT NVT = MVT::getVectorVT(NeVT, NumElems >> Shift);
11466 if (!DAG.getTargetLoweringInfo().isTypeLegal(NVT))
11469 // Simplify the operand as it's prepared to be fed into shuffle.
11470 unsigned SignificantBits = NVT.getSizeInBits() >> Shift;
11471 if (V1.getOpcode() == ISD::BITCAST &&
11472 V1.getOperand(0).getOpcode() == ISD::SCALAR_TO_VECTOR &&
11473 V1.getOperand(0).getOperand(0).getOpcode() == ISD::EXTRACT_VECTOR_ELT &&
11474 V1.getOperand(0).getOperand(0)
11475 .getSimpleValueType().getSizeInBits() == SignificantBits) {
11476 // (bitcast (sclr2vec (ext_vec_elt x))) -> (bitcast x)
11477 SDValue V = V1.getOperand(0).getOperand(0).getOperand(0);
11478 ConstantSDNode *CIdx =
11479 dyn_cast<ConstantSDNode>(V1.getOperand(0).getOperand(0).getOperand(1));
11480 // If it's foldable, i.e. normal load with single use, we will let code
11481 // selection to fold it. Otherwise, we will short the conversion sequence.
11482 if (CIdx && CIdx->getZExtValue() == 0 &&
11483 (!ISD::isNormalLoad(V.getNode()) || !V.hasOneUse())) {
11484 MVT FullVT = V.getSimpleValueType();
11485 MVT V1VT = V1.getSimpleValueType();
11486 if (FullVT.getSizeInBits() > V1VT.getSizeInBits()) {
11487 // The "ext_vec_elt" node is wider than the result node.
11488 // In this case we should extract subvector from V.
11489 // (bitcast (sclr2vec (ext_vec_elt x))) -> (bitcast (extract_subvector x)).
11490 unsigned Ratio = FullVT.getSizeInBits() / V1VT.getSizeInBits();
11491 MVT SubVecVT = MVT::getVectorVT(FullVT.getVectorElementType(),
11492 FullVT.getVectorNumElements()/Ratio);
11493 V = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, SubVecVT, V,
11494 DAG.getIntPtrConstant(0));
11496 V1 = DAG.getNode(ISD::BITCAST, DL, V1VT, V);
11500 return DAG.getNode(ISD::BITCAST, DL, VT,
11501 DAG.getNode(X86ISD::VZEXT, DL, NVT, V1));
11504 static SDValue NormalizeVectorShuffle(SDValue Op, const X86Subtarget *Subtarget,
11505 SelectionDAG &DAG) {
11506 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
11507 MVT VT = Op.getSimpleValueType();
11509 SDValue V1 = Op.getOperand(0);
11510 SDValue V2 = Op.getOperand(1);
11512 if (isZeroShuffle(SVOp))
11513 return getZeroVector(VT, Subtarget, DAG, dl);
11515 // Handle splat operations
11516 if (SVOp->isSplat()) {
11517 // Use vbroadcast whenever the splat comes from a foldable load
11518 SDValue Broadcast = LowerVectorBroadcast(Op, Subtarget, DAG);
11519 if (Broadcast.getNode())
11523 // Check integer expanding shuffles.
11524 SDValue NewOp = LowerVectorIntExtend(Op, Subtarget, DAG);
11525 if (NewOp.getNode())
11528 // If the shuffle can be profitably rewritten as a narrower shuffle, then
11530 if (VT == MVT::v8i16 || VT == MVT::v16i8 || VT == MVT::v16i16 ||
11531 VT == MVT::v32i8) {
11532 SDValue NewOp = RewriteAsNarrowerShuffle(SVOp, DAG);
11533 if (NewOp.getNode())
11534 return DAG.getNode(ISD::BITCAST, dl, VT, NewOp);
11535 } else if (VT.is128BitVector() && Subtarget->hasSSE2()) {
11536 // FIXME: Figure out a cleaner way to do this.
11537 if (ISD::isBuildVectorAllZeros(V2.getNode())) {
11538 SDValue NewOp = RewriteAsNarrowerShuffle(SVOp, DAG);
11539 if (NewOp.getNode()) {
11540 MVT NewVT = NewOp.getSimpleValueType();
11541 if (isCommutedMOVLMask(cast<ShuffleVectorSDNode>(NewOp)->getMask(),
11542 NewVT, true, false))
11543 return getVZextMovL(VT, NewVT, NewOp.getOperand(0), DAG, Subtarget,
11546 } else if (ISD::isBuildVectorAllZeros(V1.getNode())) {
11547 SDValue NewOp = RewriteAsNarrowerShuffle(SVOp, DAG);
11548 if (NewOp.getNode()) {
11549 MVT NewVT = NewOp.getSimpleValueType();
11550 if (isMOVLMask(cast<ShuffleVectorSDNode>(NewOp)->getMask(), NewVT))
11551 return getVZextMovL(VT, NewVT, NewOp.getOperand(1), DAG, Subtarget,
11560 X86TargetLowering::LowerVECTOR_SHUFFLE(SDValue Op, SelectionDAG &DAG) const {
11561 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
11562 SDValue V1 = Op.getOperand(0);
11563 SDValue V2 = Op.getOperand(1);
11564 MVT VT = Op.getSimpleValueType();
11566 unsigned NumElems = VT.getVectorNumElements();
11567 bool V1IsUndef = V1.getOpcode() == ISD::UNDEF;
11568 bool V2IsUndef = V2.getOpcode() == ISD::UNDEF;
11569 bool V1IsSplat = false;
11570 bool V2IsSplat = false;
11571 bool HasSSE2 = Subtarget->hasSSE2();
11572 bool HasFp256 = Subtarget->hasFp256();
11573 bool HasInt256 = Subtarget->hasInt256();
11574 MachineFunction &MF = DAG.getMachineFunction();
11575 bool OptForSize = MF.getFunction()->getAttributes().
11576 hasAttribute(AttributeSet::FunctionIndex, Attribute::OptimizeForSize);
11578 // Check if we should use the experimental vector shuffle lowering. If so,
11579 // delegate completely to that code path.
11580 if (ExperimentalVectorShuffleLowering)
11581 return lowerVectorShuffle(Op, Subtarget, DAG);
11583 assert(VT.getSizeInBits() != 64 && "Can't lower MMX shuffles");
11585 if (V1IsUndef && V2IsUndef)
11586 return DAG.getUNDEF(VT);
11588 // When we create a shuffle node we put the UNDEF node to second operand,
11589 // but in some cases the first operand may be transformed to UNDEF.
11590 // In this case we should just commute the node.
11592 return DAG.getCommutedVectorShuffle(*SVOp);
11594 // Vector shuffle lowering takes 3 steps:
11596 // 1) Normalize the input vectors. Here splats, zeroed vectors, profitable
11597 // narrowing and commutation of operands should be handled.
11598 // 2) Matching of shuffles with known shuffle masks to x86 target specific
11600 // 3) Rewriting of unmatched masks into new generic shuffle operations,
11601 // so the shuffle can be broken into other shuffles and the legalizer can
11602 // try the lowering again.
11604 // The general idea is that no vector_shuffle operation should be left to
11605 // be matched during isel, all of them must be converted to a target specific
11608 // Normalize the input vectors. Here splats, zeroed vectors, profitable
11609 // narrowing and commutation of operands should be handled. The actual code
11610 // doesn't include all of those, work in progress...
11611 SDValue NewOp = NormalizeVectorShuffle(Op, Subtarget, DAG);
11612 if (NewOp.getNode())
11615 SmallVector<int, 8> M(SVOp->getMask().begin(), SVOp->getMask().end());
11617 // NOTE: isPSHUFDMask can also match both masks below (unpckl_undef and
11618 // unpckh_undef). Only use pshufd if speed is more important than size.
11619 if (OptForSize && isUNPCKL_v_undef_Mask(M, VT, HasInt256))
11620 return getTargetShuffleNode(X86ISD::UNPCKL, dl, VT, V1, V1, DAG);
11621 if (OptForSize && isUNPCKH_v_undef_Mask(M, VT, HasInt256))
11622 return getTargetShuffleNode(X86ISD::UNPCKH, dl, VT, V1, V1, DAG);
11624 if (isMOVDDUPMask(M, VT) && Subtarget->hasSSE3() &&
11625 V2IsUndef && MayFoldVectorLoad(V1))
11626 return getMOVDDup(Op, dl, V1, DAG);
11628 if (isMOVHLPS_v_undef_Mask(M, VT))
11629 return getMOVHighToLow(Op, dl, DAG);
11631 // Use to match splats
11632 if (HasSSE2 && isUNPCKHMask(M, VT, HasInt256) && V2IsUndef &&
11633 (VT == MVT::v2f64 || VT == MVT::v2i64))
11634 return getTargetShuffleNode(X86ISD::UNPCKH, dl, VT, V1, V1, DAG);
11636 if (isPSHUFDMask(M, VT)) {
11637 // The actual implementation will match the mask in the if above and then
11638 // during isel it can match several different instructions, not only pshufd
11639 // as its name says, sad but true, emulate the behavior for now...
11640 if (isMOVDDUPMask(M, VT) && ((VT == MVT::v4f32 || VT == MVT::v2i64)))
11641 return getTargetShuffleNode(X86ISD::MOVLHPS, dl, VT, V1, V1, DAG);
11643 unsigned TargetMask = getShuffleSHUFImmediate(SVOp);
11645 if (HasSSE2 && (VT == MVT::v4f32 || VT == MVT::v4i32))
11646 return getTargetShuffleNode(X86ISD::PSHUFD, dl, VT, V1, TargetMask, DAG);
11648 if (HasFp256 && (VT == MVT::v4f32 || VT == MVT::v2f64))
11649 return getTargetShuffleNode(X86ISD::VPERMILPI, dl, VT, V1, TargetMask,
11652 return getTargetShuffleNode(X86ISD::SHUFP, dl, VT, V1, V1,
11656 if (isPALIGNRMask(M, VT, Subtarget))
11657 return getTargetShuffleNode(X86ISD::PALIGNR, dl, VT, V1, V2,
11658 getShufflePALIGNRImmediate(SVOp),
11661 if (isVALIGNMask(M, VT, Subtarget))
11662 return getTargetShuffleNode(X86ISD::VALIGN, dl, VT, V1, V2,
11663 getShuffleVALIGNImmediate(SVOp),
11666 // Check if this can be converted into a logical shift.
11667 bool isLeft = false;
11668 unsigned ShAmt = 0;
11670 bool isShift = HasSSE2 && isVectorShift(SVOp, DAG, isLeft, ShVal, ShAmt);
11671 if (isShift && ShVal.hasOneUse()) {
11672 // If the shifted value has multiple uses, it may be cheaper to use
11673 // v_set0 + movlhps or movhlps, etc.
11674 MVT EltVT = VT.getVectorElementType();
11675 ShAmt *= EltVT.getSizeInBits();
11676 return getVShift(isLeft, VT, ShVal, ShAmt, DAG, *this, dl);
11679 if (isMOVLMask(M, VT)) {
11680 if (ISD::isBuildVectorAllZeros(V1.getNode()))
11681 return getVZextMovL(VT, VT, V2, DAG, Subtarget, dl);
11682 if (!isMOVLPMask(M, VT)) {
11683 if (HasSSE2 && (VT == MVT::v2i64 || VT == MVT::v2f64))
11684 return getTargetShuffleNode(X86ISD::MOVSD, dl, VT, V1, V2, DAG);
11686 if (VT == MVT::v4i32 || VT == MVT::v4f32)
11687 return getTargetShuffleNode(X86ISD::MOVSS, dl, VT, V1, V2, DAG);
11691 // FIXME: fold these into legal mask.
11692 if (isMOVLHPSMask(M, VT) && !isUNPCKLMask(M, VT, HasInt256))
11693 return getMOVLowToHigh(Op, dl, DAG, HasSSE2);
11695 if (isMOVHLPSMask(M, VT))
11696 return getMOVHighToLow(Op, dl, DAG);
11698 if (V2IsUndef && isMOVSHDUPMask(M, VT, Subtarget))
11699 return getTargetShuffleNode(X86ISD::MOVSHDUP, dl, VT, V1, DAG);
11701 if (V2IsUndef && isMOVSLDUPMask(M, VT, Subtarget))
11702 return getTargetShuffleNode(X86ISD::MOVSLDUP, dl, VT, V1, DAG);
11704 if (isMOVLPMask(M, VT))
11705 return getMOVLP(Op, dl, DAG, HasSSE2);
11707 if (ShouldXformToMOVHLPS(M, VT) ||
11708 ShouldXformToMOVLP(V1.getNode(), V2.getNode(), M, VT))
11709 return DAG.getCommutedVectorShuffle(*SVOp);
11712 // No better options. Use a vshldq / vsrldq.
11713 MVT EltVT = VT.getVectorElementType();
11714 ShAmt *= EltVT.getSizeInBits();
11715 return getVShift(isLeft, VT, ShVal, ShAmt, DAG, *this, dl);
11718 bool Commuted = false;
11719 // FIXME: This should also accept a bitcast of a splat? Be careful, not
11720 // 1,1,1,1 -> v8i16 though.
11721 BitVector UndefElements;
11722 if (auto *BVOp = dyn_cast<BuildVectorSDNode>(V1.getNode()))
11723 if (BVOp->getConstantSplatNode(&UndefElements) && UndefElements.none())
11725 if (auto *BVOp = dyn_cast<BuildVectorSDNode>(V2.getNode()))
11726 if (BVOp->getConstantSplatNode(&UndefElements) && UndefElements.none())
11729 // Canonicalize the splat or undef, if present, to be on the RHS.
11730 if (!V2IsUndef && V1IsSplat && !V2IsSplat) {
11731 CommuteVectorShuffleMask(M, NumElems);
11733 std::swap(V1IsSplat, V2IsSplat);
11737 if (isCommutedMOVLMask(M, VT, V2IsSplat, V2IsUndef)) {
11738 // Shuffling low element of v1 into undef, just return v1.
11741 // If V2 is a splat, the mask may be malformed such as <4,3,3,3>, which
11742 // the instruction selector will not match, so get a canonical MOVL with
11743 // swapped operands to undo the commute.
11744 return getMOVL(DAG, dl, VT, V2, V1);
11747 if (isUNPCKLMask(M, VT, HasInt256))
11748 return getTargetShuffleNode(X86ISD::UNPCKL, dl, VT, V1, V2, DAG);
11750 if (isUNPCKHMask(M, VT, HasInt256))
11751 return getTargetShuffleNode(X86ISD::UNPCKH, dl, VT, V1, V2, DAG);
11754 // Normalize mask so all entries that point to V2 points to its first
11755 // element then try to match unpck{h|l} again. If match, return a
11756 // new vector_shuffle with the corrected mask.p
11757 SmallVector<int, 8> NewMask(M.begin(), M.end());
11758 NormalizeMask(NewMask, NumElems);
11759 if (isUNPCKLMask(NewMask, VT, HasInt256, true))
11760 return getTargetShuffleNode(X86ISD::UNPCKL, dl, VT, V1, V2, DAG);
11761 if (isUNPCKHMask(NewMask, VT, HasInt256, true))
11762 return getTargetShuffleNode(X86ISD::UNPCKH, dl, VT, V1, V2, DAG);
11766 // Commute is back and try unpck* again.
11767 // FIXME: this seems wrong.
11768 CommuteVectorShuffleMask(M, NumElems);
11770 std::swap(V1IsSplat, V2IsSplat);
11772 if (isUNPCKLMask(M, VT, HasInt256))
11773 return getTargetShuffleNode(X86ISD::UNPCKL, dl, VT, V1, V2, DAG);
11775 if (isUNPCKHMask(M, VT, HasInt256))
11776 return getTargetShuffleNode(X86ISD::UNPCKH, dl, VT, V1, V2, DAG);
11779 // Normalize the node to match x86 shuffle ops if needed
11780 if (!V2IsUndef && (isSHUFPMask(M, VT, /* Commuted */ true)))
11781 return DAG.getCommutedVectorShuffle(*SVOp);
11783 // The checks below are all present in isShuffleMaskLegal, but they are
11784 // inlined here right now to enable us to directly emit target specific
11785 // nodes, and remove one by one until they don't return Op anymore.
11787 if (ShuffleVectorSDNode::isSplatMask(&M[0], VT) &&
11788 SVOp->getSplatIndex() == 0 && V2IsUndef) {
11789 if (VT == MVT::v2f64 || VT == MVT::v2i64)
11790 return getTargetShuffleNode(X86ISD::UNPCKL, dl, VT, V1, V1, DAG);
11793 if (isPSHUFHWMask(M, VT, HasInt256))
11794 return getTargetShuffleNode(X86ISD::PSHUFHW, dl, VT, V1,
11795 getShufflePSHUFHWImmediate(SVOp),
11798 if (isPSHUFLWMask(M, VT, HasInt256))
11799 return getTargetShuffleNode(X86ISD::PSHUFLW, dl, VT, V1,
11800 getShufflePSHUFLWImmediate(SVOp),
11803 unsigned MaskValue;
11804 if (isBlendMask(M, VT, Subtarget->hasSSE41(), Subtarget->hasInt256(),
11806 return LowerVECTOR_SHUFFLEtoBlend(SVOp, MaskValue, Subtarget, DAG);
11808 if (isSHUFPMask(M, VT))
11809 return getTargetShuffleNode(X86ISD::SHUFP, dl, VT, V1, V2,
11810 getShuffleSHUFImmediate(SVOp), DAG);
11812 if (isUNPCKL_v_undef_Mask(M, VT, HasInt256))
11813 return getTargetShuffleNode(X86ISD::UNPCKL, dl, VT, V1, V1, DAG);
11814 if (isUNPCKH_v_undef_Mask(M, VT, HasInt256))
11815 return getTargetShuffleNode(X86ISD::UNPCKH, dl, VT, V1, V1, DAG);
11817 //===--------------------------------------------------------------------===//
11818 // Generate target specific nodes for 128 or 256-bit shuffles only
11819 // supported in the AVX instruction set.
11822 // Handle VMOVDDUPY permutations
11823 if (V2IsUndef && isMOVDDUPYMask(M, VT, HasFp256))
11824 return getTargetShuffleNode(X86ISD::MOVDDUP, dl, VT, V1, DAG);
11826 // Handle VPERMILPS/D* permutations
11827 if (isVPERMILPMask(M, VT)) {
11828 if ((HasInt256 && VT == MVT::v8i32) || VT == MVT::v16i32)
11829 return getTargetShuffleNode(X86ISD::PSHUFD, dl, VT, V1,
11830 getShuffleSHUFImmediate(SVOp), DAG);
11831 return getTargetShuffleNode(X86ISD::VPERMILPI, dl, VT, V1,
11832 getShuffleSHUFImmediate(SVOp), DAG);
11836 if (VT.is512BitVector() && isINSERT64x4Mask(M, VT, &Idx))
11837 return Insert256BitVector(V1, Extract256BitVector(V2, 0, DAG, dl),
11838 Idx*(NumElems/2), DAG, dl);
11840 // Handle VPERM2F128/VPERM2I128 permutations
11841 if (isVPERM2X128Mask(M, VT, HasFp256))
11842 return getTargetShuffleNode(X86ISD::VPERM2X128, dl, VT, V1,
11843 V2, getShuffleVPERM2X128Immediate(SVOp), DAG);
11845 if (Subtarget->hasSSE41() && isINSERTPSMask(M, VT))
11846 return getINSERTPS(SVOp, dl, DAG);
11849 if (V2IsUndef && HasInt256 && isPermImmMask(M, VT, Imm8))
11850 return getTargetShuffleNode(X86ISD::VPERMI, dl, VT, V1, Imm8, DAG);
11852 if ((V2IsUndef && HasInt256 && VT.is256BitVector() && NumElems == 8) ||
11853 VT.is512BitVector()) {
11854 MVT MaskEltVT = MVT::getIntegerVT(VT.getVectorElementType().getSizeInBits());
11855 MVT MaskVectorVT = MVT::getVectorVT(MaskEltVT, NumElems);
11856 SmallVector<SDValue, 16> permclMask;
11857 for (unsigned i = 0; i != NumElems; ++i) {
11858 permclMask.push_back(DAG.getConstant((M[i]>=0) ? M[i] : 0, MaskEltVT));
11861 SDValue Mask = DAG.getNode(ISD::BUILD_VECTOR, dl, MaskVectorVT, permclMask);
11863 // Bitcast is for VPERMPS since mask is v8i32 but node takes v8f32
11864 return DAG.getNode(X86ISD::VPERMV, dl, VT,
11865 DAG.getNode(ISD::BITCAST, dl, VT, Mask), V1);
11866 return DAG.getNode(X86ISD::VPERMV3, dl, VT, V1,
11867 DAG.getNode(ISD::BITCAST, dl, VT, Mask), V2);
11870 //===--------------------------------------------------------------------===//
11871 // Since no target specific shuffle was selected for this generic one,
11872 // lower it into other known shuffles. FIXME: this isn't true yet, but
11873 // this is the plan.
11876 // Handle v8i16 specifically since SSE can do byte extraction and insertion.
11877 if (VT == MVT::v8i16) {
11878 SDValue NewOp = LowerVECTOR_SHUFFLEv8i16(Op, Subtarget, DAG);
11879 if (NewOp.getNode())
11883 if (VT == MVT::v16i16 && Subtarget->hasInt256()) {
11884 SDValue NewOp = LowerVECTOR_SHUFFLEv16i16(Op, DAG);
11885 if (NewOp.getNode())
11889 if (VT == MVT::v16i8) {
11890 SDValue NewOp = LowerVECTOR_SHUFFLEv16i8(SVOp, Subtarget, DAG);
11891 if (NewOp.getNode())
11895 if (VT == MVT::v32i8) {
11896 SDValue NewOp = LowerVECTOR_SHUFFLEv32i8(SVOp, Subtarget, DAG);
11897 if (NewOp.getNode())
11901 // Handle all 128-bit wide vectors with 4 elements, and match them with
11902 // several different shuffle types.
11903 if (NumElems == 4 && VT.is128BitVector())
11904 return LowerVECTOR_SHUFFLE_128v4(SVOp, DAG);
11906 // Handle general 256-bit shuffles
11907 if (VT.is256BitVector())
11908 return LowerVECTOR_SHUFFLE_256(SVOp, DAG);
11913 // This function assumes its argument is a BUILD_VECTOR of constants or
11914 // undef SDNodes. i.e: ISD::isBuildVectorOfConstantSDNodes(BuildVector) is
11916 static bool BUILD_VECTORtoBlendMask(BuildVectorSDNode *BuildVector,
11917 unsigned &MaskValue) {
11919 unsigned NumElems = BuildVector->getNumOperands();
11920 // There are 2 lanes if (NumElems > 8), and 1 lane otherwise.
11921 unsigned NumLanes = (NumElems - 1) / 8 + 1;
11922 unsigned NumElemsInLane = NumElems / NumLanes;
11924 // Blend for v16i16 should be symetric for the both lanes.
11925 for (unsigned i = 0; i < NumElemsInLane; ++i) {
11926 SDValue EltCond = BuildVector->getOperand(i);
11927 SDValue SndLaneEltCond =
11928 (NumLanes == 2) ? BuildVector->getOperand(i + NumElemsInLane) : EltCond;
11930 int Lane1Cond = -1, Lane2Cond = -1;
11931 if (isa<ConstantSDNode>(EltCond))
11932 Lane1Cond = !isZero(EltCond);
11933 if (isa<ConstantSDNode>(SndLaneEltCond))
11934 Lane2Cond = !isZero(SndLaneEltCond);
11936 if (Lane1Cond == Lane2Cond || Lane2Cond < 0)
11937 // Lane1Cond != 0, means we want the first argument.
11938 // Lane1Cond == 0, means we want the second argument.
11939 // The encoding of this argument is 0 for the first argument, 1
11940 // for the second. Therefore, invert the condition.
11941 MaskValue |= !Lane1Cond << i;
11942 else if (Lane1Cond < 0)
11943 MaskValue |= !Lane2Cond << i;
11950 /// \brief Try to lower a VSELECT instruction to an immediate-controlled blend
11952 static SDValue lowerVSELECTtoBLENDI(SDValue Op, const X86Subtarget *Subtarget,
11953 SelectionDAG &DAG) {
11954 SDValue Cond = Op.getOperand(0);
11955 SDValue LHS = Op.getOperand(1);
11956 SDValue RHS = Op.getOperand(2);
11958 MVT VT = Op.getSimpleValueType();
11959 MVT EltVT = VT.getVectorElementType();
11960 unsigned NumElems = VT.getVectorNumElements();
11962 // There is no blend with immediate in AVX-512.
11963 if (VT.is512BitVector())
11966 if (!Subtarget->hasSSE41() || EltVT == MVT::i8)
11968 if (!Subtarget->hasInt256() && VT == MVT::v16i16)
11971 if (!ISD::isBuildVectorOfConstantSDNodes(Cond.getNode()))
11974 // Check the mask for BLEND and build the value.
11975 unsigned MaskValue = 0;
11976 if (!BUILD_VECTORtoBlendMask(cast<BuildVectorSDNode>(Cond), MaskValue))
11979 // Convert i32 vectors to floating point if it is not AVX2.
11980 // AVX2 introduced VPBLENDD instruction for 128 and 256-bit vectors.
11982 if (EltVT == MVT::i64 || (EltVT == MVT::i32 && !Subtarget->hasInt256())) {
11983 BlendVT = MVT::getVectorVT(MVT::getFloatingPointVT(EltVT.getSizeInBits()),
11985 LHS = DAG.getNode(ISD::BITCAST, dl, VT, LHS);
11986 RHS = DAG.getNode(ISD::BITCAST, dl, VT, RHS);
11989 SDValue Ret = DAG.getNode(X86ISD::BLENDI, dl, BlendVT, LHS, RHS,
11990 DAG.getConstant(MaskValue, MVT::i32));
11991 return DAG.getNode(ISD::BITCAST, dl, VT, Ret);
11994 SDValue X86TargetLowering::LowerVSELECT(SDValue Op, SelectionDAG &DAG) const {
11995 // A vselect where all conditions and data are constants can be optimized into
11996 // a single vector load by SelectionDAGLegalize::ExpandBUILD_VECTOR().
11997 if (ISD::isBuildVectorOfConstantSDNodes(Op.getOperand(0).getNode()) &&
11998 ISD::isBuildVectorOfConstantSDNodes(Op.getOperand(1).getNode()) &&
11999 ISD::isBuildVectorOfConstantSDNodes(Op.getOperand(2).getNode()))
12002 SDValue BlendOp = lowerVSELECTtoBLENDI(Op, Subtarget, DAG);
12003 if (BlendOp.getNode())
12006 // Some types for vselect were previously set to Expand, not Legal or
12007 // Custom. Return an empty SDValue so we fall-through to Expand, after
12008 // the Custom lowering phase.
12009 MVT VT = Op.getSimpleValueType();
12010 switch (VT.SimpleTy) {
12015 if (Subtarget->hasBWI() && Subtarget->hasVLX())
12020 // We couldn't create a "Blend with immediate" node.
12021 // This node should still be legal, but we'll have to emit a blendv*
12026 static SDValue LowerEXTRACT_VECTOR_ELT_SSE4(SDValue Op, SelectionDAG &DAG) {
12027 MVT VT = Op.getSimpleValueType();
12030 if (!Op.getOperand(0).getSimpleValueType().is128BitVector())
12033 if (VT.getSizeInBits() == 8) {
12034 SDValue Extract = DAG.getNode(X86ISD::PEXTRB, dl, MVT::i32,
12035 Op.getOperand(0), Op.getOperand(1));
12036 SDValue Assert = DAG.getNode(ISD::AssertZext, dl, MVT::i32, Extract,
12037 DAG.getValueType(VT));
12038 return DAG.getNode(ISD::TRUNCATE, dl, VT, Assert);
12041 if (VT.getSizeInBits() == 16) {
12042 unsigned Idx = cast<ConstantSDNode>(Op.getOperand(1))->getZExtValue();
12043 // If Idx is 0, it's cheaper to do a move instead of a pextrw.
12045 return DAG.getNode(ISD::TRUNCATE, dl, MVT::i16,
12046 DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::i32,
12047 DAG.getNode(ISD::BITCAST, dl,
12050 Op.getOperand(1)));
12051 SDValue Extract = DAG.getNode(X86ISD::PEXTRW, dl, MVT::i32,
12052 Op.getOperand(0), Op.getOperand(1));
12053 SDValue Assert = DAG.getNode(ISD::AssertZext, dl, MVT::i32, Extract,
12054 DAG.getValueType(VT));
12055 return DAG.getNode(ISD::TRUNCATE, dl, VT, Assert);
12058 if (VT == MVT::f32) {
12059 // EXTRACTPS outputs to a GPR32 register which will require a movd to copy
12060 // the result back to FR32 register. It's only worth matching if the
12061 // result has a single use which is a store or a bitcast to i32. And in
12062 // the case of a store, it's not worth it if the index is a constant 0,
12063 // because a MOVSSmr can be used instead, which is smaller and faster.
12064 if (!Op.hasOneUse())
12066 SDNode *User = *Op.getNode()->use_begin();
12067 if ((User->getOpcode() != ISD::STORE ||
12068 (isa<ConstantSDNode>(Op.getOperand(1)) &&
12069 cast<ConstantSDNode>(Op.getOperand(1))->isNullValue())) &&
12070 (User->getOpcode() != ISD::BITCAST ||
12071 User->getValueType(0) != MVT::i32))
12073 SDValue Extract = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::i32,
12074 DAG.getNode(ISD::BITCAST, dl, MVT::v4i32,
12077 return DAG.getNode(ISD::BITCAST, dl, MVT::f32, Extract);
12080 if (VT == MVT::i32 || VT == MVT::i64) {
12081 // ExtractPS/pextrq works with constant index.
12082 if (isa<ConstantSDNode>(Op.getOperand(1)))
12088 /// Extract one bit from mask vector, like v16i1 or v8i1.
12089 /// AVX-512 feature.
12091 X86TargetLowering::ExtractBitFromMaskVector(SDValue Op, SelectionDAG &DAG) const {
12092 SDValue Vec = Op.getOperand(0);
12094 MVT VecVT = Vec.getSimpleValueType();
12095 SDValue Idx = Op.getOperand(1);
12096 MVT EltVT = Op.getSimpleValueType();
12098 assert((EltVT == MVT::i1) && "Unexpected operands in ExtractBitFromMaskVector");
12100 // variable index can't be handled in mask registers,
12101 // extend vector to VR512
12102 if (!isa<ConstantSDNode>(Idx)) {
12103 MVT ExtVT = (VecVT == MVT::v8i1 ? MVT::v8i64 : MVT::v16i32);
12104 SDValue Ext = DAG.getNode(ISD::ZERO_EXTEND, dl, ExtVT, Vec);
12105 SDValue Elt = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl,
12106 ExtVT.getVectorElementType(), Ext, Idx);
12107 return DAG.getNode(ISD::TRUNCATE, dl, EltVT, Elt);
12110 unsigned IdxVal = cast<ConstantSDNode>(Idx)->getZExtValue();
12111 const TargetRegisterClass* rc = getRegClassFor(VecVT);
12112 unsigned MaxSift = rc->getSize()*8 - 1;
12113 Vec = DAG.getNode(X86ISD::VSHLI, dl, VecVT, Vec,
12114 DAG.getConstant(MaxSift - IdxVal, MVT::i8));
12115 Vec = DAG.getNode(X86ISD::VSRLI, dl, VecVT, Vec,
12116 DAG.getConstant(MaxSift, MVT::i8));
12117 return DAG.getNode(X86ISD::VEXTRACT, dl, MVT::i1, Vec,
12118 DAG.getIntPtrConstant(0));
12122 X86TargetLowering::LowerEXTRACT_VECTOR_ELT(SDValue Op,
12123 SelectionDAG &DAG) const {
12125 SDValue Vec = Op.getOperand(0);
12126 MVT VecVT = Vec.getSimpleValueType();
12127 SDValue Idx = Op.getOperand(1);
12129 if (Op.getSimpleValueType() == MVT::i1)
12130 return ExtractBitFromMaskVector(Op, DAG);
12132 if (!isa<ConstantSDNode>(Idx)) {
12133 if (VecVT.is512BitVector() ||
12134 (VecVT.is256BitVector() && Subtarget->hasInt256() &&
12135 VecVT.getVectorElementType().getSizeInBits() == 32)) {
12138 MVT::getIntegerVT(VecVT.getVectorElementType().getSizeInBits());
12139 MVT MaskVT = MVT::getVectorVT(MaskEltVT, VecVT.getSizeInBits() /
12140 MaskEltVT.getSizeInBits());
12142 Idx = DAG.getZExtOrTrunc(Idx, dl, MaskEltVT);
12143 SDValue Mask = DAG.getNode(X86ISD::VINSERT, dl, MaskVT,
12144 getZeroVector(MaskVT, Subtarget, DAG, dl),
12145 Idx, DAG.getConstant(0, getPointerTy()));
12146 SDValue Perm = DAG.getNode(X86ISD::VPERMV, dl, VecVT, Mask, Vec);
12147 return DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, Op.getValueType(),
12148 Perm, DAG.getConstant(0, getPointerTy()));
12153 // If this is a 256-bit vector result, first extract the 128-bit vector and
12154 // then extract the element from the 128-bit vector.
12155 if (VecVT.is256BitVector() || VecVT.is512BitVector()) {
12157 unsigned IdxVal = cast<ConstantSDNode>(Idx)->getZExtValue();
12158 // Get the 128-bit vector.
12159 Vec = Extract128BitVector(Vec, IdxVal, DAG, dl);
12160 MVT EltVT = VecVT.getVectorElementType();
12162 unsigned ElemsPerChunk = 128 / EltVT.getSizeInBits();
12164 //if (IdxVal >= NumElems/2)
12165 // IdxVal -= NumElems/2;
12166 IdxVal -= (IdxVal/ElemsPerChunk)*ElemsPerChunk;
12167 return DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, Op.getValueType(), Vec,
12168 DAG.getConstant(IdxVal, MVT::i32));
12171 assert(VecVT.is128BitVector() && "Unexpected vector length");
12173 if (Subtarget->hasSSE41()) {
12174 SDValue Res = LowerEXTRACT_VECTOR_ELT_SSE4(Op, DAG);
12179 MVT VT = Op.getSimpleValueType();
12180 // TODO: handle v16i8.
12181 if (VT.getSizeInBits() == 16) {
12182 SDValue Vec = Op.getOperand(0);
12183 unsigned Idx = cast<ConstantSDNode>(Op.getOperand(1))->getZExtValue();
12185 return DAG.getNode(ISD::TRUNCATE, dl, MVT::i16,
12186 DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::i32,
12187 DAG.getNode(ISD::BITCAST, dl,
12189 Op.getOperand(1)));
12190 // Transform it so it match pextrw which produces a 32-bit result.
12191 MVT EltVT = MVT::i32;
12192 SDValue Extract = DAG.getNode(X86ISD::PEXTRW, dl, EltVT,
12193 Op.getOperand(0), Op.getOperand(1));
12194 SDValue Assert = DAG.getNode(ISD::AssertZext, dl, EltVT, Extract,
12195 DAG.getValueType(VT));
12196 return DAG.getNode(ISD::TRUNCATE, dl, VT, Assert);
12199 if (VT.getSizeInBits() == 32) {
12200 unsigned Idx = cast<ConstantSDNode>(Op.getOperand(1))->getZExtValue();
12204 // SHUFPS the element to the lowest double word, then movss.
12205 int Mask[4] = { static_cast<int>(Idx), -1, -1, -1 };
12206 MVT VVT = Op.getOperand(0).getSimpleValueType();
12207 SDValue Vec = DAG.getVectorShuffle(VVT, dl, Op.getOperand(0),
12208 DAG.getUNDEF(VVT), Mask);
12209 return DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, VT, Vec,
12210 DAG.getIntPtrConstant(0));
12213 if (VT.getSizeInBits() == 64) {
12214 // FIXME: .td only matches this for <2 x f64>, not <2 x i64> on 32b
12215 // FIXME: seems like this should be unnecessary if mov{h,l}pd were taught
12216 // to match extract_elt for f64.
12217 unsigned Idx = cast<ConstantSDNode>(Op.getOperand(1))->getZExtValue();
12221 // UNPCKHPD the element to the lowest double word, then movsd.
12222 // Note if the lower 64 bits of the result of the UNPCKHPD is then stored
12223 // to a f64mem, the whole operation is folded into a single MOVHPDmr.
12224 int Mask[2] = { 1, -1 };
12225 MVT VVT = Op.getOperand(0).getSimpleValueType();
12226 SDValue Vec = DAG.getVectorShuffle(VVT, dl, Op.getOperand(0),
12227 DAG.getUNDEF(VVT), Mask);
12228 return DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, VT, Vec,
12229 DAG.getIntPtrConstant(0));
12235 /// Insert one bit to mask vector, like v16i1 or v8i1.
12236 /// AVX-512 feature.
12238 X86TargetLowering::InsertBitToMaskVector(SDValue Op, SelectionDAG &DAG) const {
12240 SDValue Vec = Op.getOperand(0);
12241 SDValue Elt = Op.getOperand(1);
12242 SDValue Idx = Op.getOperand(2);
12243 MVT VecVT = Vec.getSimpleValueType();
12245 if (!isa<ConstantSDNode>(Idx)) {
12246 // Non constant index. Extend source and destination,
12247 // insert element and then truncate the result.
12248 MVT ExtVecVT = (VecVT == MVT::v8i1 ? MVT::v8i64 : MVT::v16i32);
12249 MVT ExtEltVT = (VecVT == MVT::v8i1 ? MVT::i64 : MVT::i32);
12250 SDValue ExtOp = DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, ExtVecVT,
12251 DAG.getNode(ISD::ZERO_EXTEND, dl, ExtVecVT, Vec),
12252 DAG.getNode(ISD::ZERO_EXTEND, dl, ExtEltVT, Elt), Idx);
12253 return DAG.getNode(ISD::TRUNCATE, dl, VecVT, ExtOp);
12256 unsigned IdxVal = cast<ConstantSDNode>(Idx)->getZExtValue();
12257 SDValue EltInVec = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VecVT, Elt);
12258 if (Vec.getOpcode() == ISD::UNDEF)
12259 return DAG.getNode(X86ISD::VSHLI, dl, VecVT, EltInVec,
12260 DAG.getConstant(IdxVal, MVT::i8));
12261 const TargetRegisterClass* rc = getRegClassFor(VecVT);
12262 unsigned MaxSift = rc->getSize()*8 - 1;
12263 EltInVec = DAG.getNode(X86ISD::VSHLI, dl, VecVT, EltInVec,
12264 DAG.getConstant(MaxSift, MVT::i8));
12265 EltInVec = DAG.getNode(X86ISD::VSRLI, dl, VecVT, EltInVec,
12266 DAG.getConstant(MaxSift - IdxVal, MVT::i8));
12267 return DAG.getNode(ISD::OR, dl, VecVT, Vec, EltInVec);
12270 SDValue X86TargetLowering::LowerINSERT_VECTOR_ELT(SDValue Op,
12271 SelectionDAG &DAG) const {
12272 MVT VT = Op.getSimpleValueType();
12273 MVT EltVT = VT.getVectorElementType();
12275 if (EltVT == MVT::i1)
12276 return InsertBitToMaskVector(Op, DAG);
12279 SDValue N0 = Op.getOperand(0);
12280 SDValue N1 = Op.getOperand(1);
12281 SDValue N2 = Op.getOperand(2);
12282 if (!isa<ConstantSDNode>(N2))
12284 auto *N2C = cast<ConstantSDNode>(N2);
12285 unsigned IdxVal = N2C->getZExtValue();
12287 // If the vector is wider than 128 bits, extract the 128-bit subvector, insert
12288 // into that, and then insert the subvector back into the result.
12289 if (VT.is256BitVector() || VT.is512BitVector()) {
12290 // Get the desired 128-bit vector half.
12291 SDValue V = Extract128BitVector(N0, IdxVal, DAG, dl);
12293 // Insert the element into the desired half.
12294 unsigned NumEltsIn128 = 128 / EltVT.getSizeInBits();
12295 unsigned IdxIn128 = IdxVal - (IdxVal / NumEltsIn128) * NumEltsIn128;
12297 V = DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, V.getValueType(), V, N1,
12298 DAG.getConstant(IdxIn128, MVT::i32));
12300 // Insert the changed part back to the 256-bit vector
12301 return Insert128BitVector(N0, V, IdxVal, DAG, dl);
12303 assert(VT.is128BitVector() && "Only 128-bit vector types should be left!");
12305 if (Subtarget->hasSSE41()) {
12306 if (EltVT.getSizeInBits() == 8 || EltVT.getSizeInBits() == 16) {
12308 if (VT == MVT::v8i16) {
12309 Opc = X86ISD::PINSRW;
12311 assert(VT == MVT::v16i8);
12312 Opc = X86ISD::PINSRB;
12315 // Transform it so it match pinsr{b,w} which expects a GR32 as its second
12317 if (N1.getValueType() != MVT::i32)
12318 N1 = DAG.getNode(ISD::ANY_EXTEND, dl, MVT::i32, N1);
12319 if (N2.getValueType() != MVT::i32)
12320 N2 = DAG.getIntPtrConstant(IdxVal);
12321 return DAG.getNode(Opc, dl, VT, N0, N1, N2);
12324 if (EltVT == MVT::f32) {
12325 // Bits [7:6] of the constant are the source select. This will always be
12326 // zero here. The DAG Combiner may combine an extract_elt index into
12328 // bits. For example (insert (extract, 3), 2) could be matched by
12330 // the '3' into bits [7:6] of X86ISD::INSERTPS.
12331 // Bits [5:4] of the constant are the destination select. This is the
12332 // value of the incoming immediate.
12333 // Bits [3:0] of the constant are the zero mask. The DAG Combiner may
12334 // combine either bitwise AND or insert of float 0.0 to set these bits.
12335 N2 = DAG.getIntPtrConstant(IdxVal << 4);
12336 // Create this as a scalar to vector..
12337 N1 = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, MVT::v4f32, N1);
12338 return DAG.getNode(X86ISD::INSERTPS, dl, VT, N0, N1, N2);
12341 if (EltVT == MVT::i32 || EltVT == MVT::i64) {
12342 // PINSR* works with constant index.
12347 if (EltVT == MVT::i8)
12350 if (EltVT.getSizeInBits() == 16) {
12351 // Transform it so it match pinsrw which expects a 16-bit value in a GR32
12352 // as its second argument.
12353 if (N1.getValueType() != MVT::i32)
12354 N1 = DAG.getNode(ISD::ANY_EXTEND, dl, MVT::i32, N1);
12355 if (N2.getValueType() != MVT::i32)
12356 N2 = DAG.getIntPtrConstant(IdxVal);
12357 return DAG.getNode(X86ISD::PINSRW, dl, VT, N0, N1, N2);
12362 static SDValue LowerSCALAR_TO_VECTOR(SDValue Op, SelectionDAG &DAG) {
12364 MVT OpVT = Op.getSimpleValueType();
12366 // If this is a 256-bit vector result, first insert into a 128-bit
12367 // vector and then insert into the 256-bit vector.
12368 if (!OpVT.is128BitVector()) {
12369 // Insert into a 128-bit vector.
12370 unsigned SizeFactor = OpVT.getSizeInBits()/128;
12371 MVT VT128 = MVT::getVectorVT(OpVT.getVectorElementType(),
12372 OpVT.getVectorNumElements() / SizeFactor);
12374 Op = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VT128, Op.getOperand(0));
12376 // Insert the 128-bit vector.
12377 return Insert128BitVector(DAG.getUNDEF(OpVT), Op, 0, DAG, dl);
12380 if (OpVT == MVT::v1i64 &&
12381 Op.getOperand(0).getValueType() == MVT::i64)
12382 return DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, MVT::v1i64, Op.getOperand(0));
12384 SDValue AnyExt = DAG.getNode(ISD::ANY_EXTEND, dl, MVT::i32, Op.getOperand(0));
12385 assert(OpVT.is128BitVector() && "Expected an SSE type!");
12386 return DAG.getNode(ISD::BITCAST, dl, OpVT,
12387 DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, MVT::v4i32,AnyExt));
12390 // Lower a node with an EXTRACT_SUBVECTOR opcode. This may result in
12391 // a simple subregister reference or explicit instructions to grab
12392 // upper bits of a vector.
12393 static SDValue LowerEXTRACT_SUBVECTOR(SDValue Op, const X86Subtarget *Subtarget,
12394 SelectionDAG &DAG) {
12396 SDValue In = Op.getOperand(0);
12397 SDValue Idx = Op.getOperand(1);
12398 unsigned IdxVal = cast<ConstantSDNode>(Idx)->getZExtValue();
12399 MVT ResVT = Op.getSimpleValueType();
12400 MVT InVT = In.getSimpleValueType();
12402 if (Subtarget->hasFp256()) {
12403 if (ResVT.is128BitVector() &&
12404 (InVT.is256BitVector() || InVT.is512BitVector()) &&
12405 isa<ConstantSDNode>(Idx)) {
12406 return Extract128BitVector(In, IdxVal, DAG, dl);
12408 if (ResVT.is256BitVector() && InVT.is512BitVector() &&
12409 isa<ConstantSDNode>(Idx)) {
12410 return Extract256BitVector(In, IdxVal, DAG, dl);
12416 // Lower a node with an INSERT_SUBVECTOR opcode. This may result in a
12417 // simple superregister reference or explicit instructions to insert
12418 // the upper bits of a vector.
12419 static SDValue LowerINSERT_SUBVECTOR(SDValue Op, const X86Subtarget *Subtarget,
12420 SelectionDAG &DAG) {
12421 if (Subtarget->hasFp256()) {
12422 SDLoc dl(Op.getNode());
12423 SDValue Vec = Op.getNode()->getOperand(0);
12424 SDValue SubVec = Op.getNode()->getOperand(1);
12425 SDValue Idx = Op.getNode()->getOperand(2);
12427 if ((Op.getNode()->getSimpleValueType(0).is256BitVector() ||
12428 Op.getNode()->getSimpleValueType(0).is512BitVector()) &&
12429 SubVec.getNode()->getSimpleValueType(0).is128BitVector() &&
12430 isa<ConstantSDNode>(Idx)) {
12431 unsigned IdxVal = cast<ConstantSDNode>(Idx)->getZExtValue();
12432 return Insert128BitVector(Vec, SubVec, IdxVal, DAG, dl);
12435 if (Op.getNode()->getSimpleValueType(0).is512BitVector() &&
12436 SubVec.getNode()->getSimpleValueType(0).is256BitVector() &&
12437 isa<ConstantSDNode>(Idx)) {
12438 unsigned IdxVal = cast<ConstantSDNode>(Idx)->getZExtValue();
12439 return Insert256BitVector(Vec, SubVec, IdxVal, DAG, dl);
12445 // ConstantPool, JumpTable, GlobalAddress, and ExternalSymbol are lowered as
12446 // their target countpart wrapped in the X86ISD::Wrapper node. Suppose N is
12447 // one of the above mentioned nodes. It has to be wrapped because otherwise
12448 // Select(N) returns N. So the raw TargetGlobalAddress nodes, etc. can only
12449 // be used to form addressing mode. These wrapped nodes will be selected
12452 X86TargetLowering::LowerConstantPool(SDValue Op, SelectionDAG &DAG) const {
12453 ConstantPoolSDNode *CP = cast<ConstantPoolSDNode>(Op);
12455 // In PIC mode (unless we're in RIPRel PIC mode) we add an offset to the
12456 // global base reg.
12457 unsigned char OpFlag = 0;
12458 unsigned WrapperKind = X86ISD::Wrapper;
12459 CodeModel::Model M = DAG.getTarget().getCodeModel();
12461 if (Subtarget->isPICStyleRIPRel() &&
12462 (M == CodeModel::Small || M == CodeModel::Kernel))
12463 WrapperKind = X86ISD::WrapperRIP;
12464 else if (Subtarget->isPICStyleGOT())
12465 OpFlag = X86II::MO_GOTOFF;
12466 else if (Subtarget->isPICStyleStubPIC())
12467 OpFlag = X86II::MO_PIC_BASE_OFFSET;
12469 SDValue Result = DAG.getTargetConstantPool(CP->getConstVal(), getPointerTy(),
12470 CP->getAlignment(),
12471 CP->getOffset(), OpFlag);
12473 Result = DAG.getNode(WrapperKind, DL, getPointerTy(), Result);
12474 // With PIC, the address is actually $g + Offset.
12476 Result = DAG.getNode(ISD::ADD, DL, getPointerTy(),
12477 DAG.getNode(X86ISD::GlobalBaseReg,
12478 SDLoc(), getPointerTy()),
12485 SDValue X86TargetLowering::LowerJumpTable(SDValue Op, SelectionDAG &DAG) const {
12486 JumpTableSDNode *JT = cast<JumpTableSDNode>(Op);
12488 // In PIC mode (unless we're in RIPRel PIC mode) we add an offset to the
12489 // global base reg.
12490 unsigned char OpFlag = 0;
12491 unsigned WrapperKind = X86ISD::Wrapper;
12492 CodeModel::Model M = DAG.getTarget().getCodeModel();
12494 if (Subtarget->isPICStyleRIPRel() &&
12495 (M == CodeModel::Small || M == CodeModel::Kernel))
12496 WrapperKind = X86ISD::WrapperRIP;
12497 else if (Subtarget->isPICStyleGOT())
12498 OpFlag = X86II::MO_GOTOFF;
12499 else if (Subtarget->isPICStyleStubPIC())
12500 OpFlag = X86II::MO_PIC_BASE_OFFSET;
12502 SDValue Result = DAG.getTargetJumpTable(JT->getIndex(), getPointerTy(),
12505 Result = DAG.getNode(WrapperKind, DL, getPointerTy(), Result);
12507 // With PIC, the address is actually $g + Offset.
12509 Result = DAG.getNode(ISD::ADD, DL, getPointerTy(),
12510 DAG.getNode(X86ISD::GlobalBaseReg,
12511 SDLoc(), getPointerTy()),
12518 X86TargetLowering::LowerExternalSymbol(SDValue Op, SelectionDAG &DAG) const {
12519 const char *Sym = cast<ExternalSymbolSDNode>(Op)->getSymbol();
12521 // In PIC mode (unless we're in RIPRel PIC mode) we add an offset to the
12522 // global base reg.
12523 unsigned char OpFlag = 0;
12524 unsigned WrapperKind = X86ISD::Wrapper;
12525 CodeModel::Model M = DAG.getTarget().getCodeModel();
12527 if (Subtarget->isPICStyleRIPRel() &&
12528 (M == CodeModel::Small || M == CodeModel::Kernel)) {
12529 if (Subtarget->isTargetDarwin() || Subtarget->isTargetELF())
12530 OpFlag = X86II::MO_GOTPCREL;
12531 WrapperKind = X86ISD::WrapperRIP;
12532 } else if (Subtarget->isPICStyleGOT()) {
12533 OpFlag = X86II::MO_GOT;
12534 } else if (Subtarget->isPICStyleStubPIC()) {
12535 OpFlag = X86II::MO_DARWIN_NONLAZY_PIC_BASE;
12536 } else if (Subtarget->isPICStyleStubNoDynamic()) {
12537 OpFlag = X86II::MO_DARWIN_NONLAZY;
12540 SDValue Result = DAG.getTargetExternalSymbol(Sym, getPointerTy(), OpFlag);
12543 Result = DAG.getNode(WrapperKind, DL, getPointerTy(), Result);
12545 // With PIC, the address is actually $g + Offset.
12546 if (DAG.getTarget().getRelocationModel() == Reloc::PIC_ &&
12547 !Subtarget->is64Bit()) {
12548 Result = DAG.getNode(ISD::ADD, DL, getPointerTy(),
12549 DAG.getNode(X86ISD::GlobalBaseReg,
12550 SDLoc(), getPointerTy()),
12554 // For symbols that require a load from a stub to get the address, emit the
12556 if (isGlobalStubReference(OpFlag))
12557 Result = DAG.getLoad(getPointerTy(), DL, DAG.getEntryNode(), Result,
12558 MachinePointerInfo::getGOT(), false, false, false, 0);
12564 X86TargetLowering::LowerBlockAddress(SDValue Op, SelectionDAG &DAG) const {
12565 // Create the TargetBlockAddressAddress node.
12566 unsigned char OpFlags =
12567 Subtarget->ClassifyBlockAddressReference();
12568 CodeModel::Model M = DAG.getTarget().getCodeModel();
12569 const BlockAddress *BA = cast<BlockAddressSDNode>(Op)->getBlockAddress();
12570 int64_t Offset = cast<BlockAddressSDNode>(Op)->getOffset();
12572 SDValue Result = DAG.getTargetBlockAddress(BA, getPointerTy(), Offset,
12575 if (Subtarget->isPICStyleRIPRel() &&
12576 (M == CodeModel::Small || M == CodeModel::Kernel))
12577 Result = DAG.getNode(X86ISD::WrapperRIP, dl, getPointerTy(), Result);
12579 Result = DAG.getNode(X86ISD::Wrapper, dl, getPointerTy(), Result);
12581 // With PIC, the address is actually $g + Offset.
12582 if (isGlobalRelativeToPICBase(OpFlags)) {
12583 Result = DAG.getNode(ISD::ADD, dl, getPointerTy(),
12584 DAG.getNode(X86ISD::GlobalBaseReg, dl, getPointerTy()),
12592 X86TargetLowering::LowerGlobalAddress(const GlobalValue *GV, SDLoc dl,
12593 int64_t Offset, SelectionDAG &DAG) const {
12594 // Create the TargetGlobalAddress node, folding in the constant
12595 // offset if it is legal.
12596 unsigned char OpFlags =
12597 Subtarget->ClassifyGlobalReference(GV, DAG.getTarget());
12598 CodeModel::Model M = DAG.getTarget().getCodeModel();
12600 if (OpFlags == X86II::MO_NO_FLAG &&
12601 X86::isOffsetSuitableForCodeModel(Offset, M)) {
12602 // A direct static reference to a global.
12603 Result = DAG.getTargetGlobalAddress(GV, dl, getPointerTy(), Offset);
12606 Result = DAG.getTargetGlobalAddress(GV, dl, getPointerTy(), 0, OpFlags);
12609 if (Subtarget->isPICStyleRIPRel() &&
12610 (M == CodeModel::Small || M == CodeModel::Kernel))
12611 Result = DAG.getNode(X86ISD::WrapperRIP, dl, getPointerTy(), Result);
12613 Result = DAG.getNode(X86ISD::Wrapper, dl, getPointerTy(), Result);
12615 // With PIC, the address is actually $g + Offset.
12616 if (isGlobalRelativeToPICBase(OpFlags)) {
12617 Result = DAG.getNode(ISD::ADD, dl, getPointerTy(),
12618 DAG.getNode(X86ISD::GlobalBaseReg, dl, getPointerTy()),
12622 // For globals that require a load from a stub to get the address, emit the
12624 if (isGlobalStubReference(OpFlags))
12625 Result = DAG.getLoad(getPointerTy(), dl, DAG.getEntryNode(), Result,
12626 MachinePointerInfo::getGOT(), false, false, false, 0);
12628 // If there was a non-zero offset that we didn't fold, create an explicit
12629 // addition for it.
12631 Result = DAG.getNode(ISD::ADD, dl, getPointerTy(), Result,
12632 DAG.getConstant(Offset, getPointerTy()));
12638 X86TargetLowering::LowerGlobalAddress(SDValue Op, SelectionDAG &DAG) const {
12639 const GlobalValue *GV = cast<GlobalAddressSDNode>(Op)->getGlobal();
12640 int64_t Offset = cast<GlobalAddressSDNode>(Op)->getOffset();
12641 return LowerGlobalAddress(GV, SDLoc(Op), Offset, DAG);
12645 GetTLSADDR(SelectionDAG &DAG, SDValue Chain, GlobalAddressSDNode *GA,
12646 SDValue *InFlag, const EVT PtrVT, unsigned ReturnReg,
12647 unsigned char OperandFlags, bool LocalDynamic = false) {
12648 MachineFrameInfo *MFI = DAG.getMachineFunction().getFrameInfo();
12649 SDVTList NodeTys = DAG.getVTList(MVT::Other, MVT::Glue);
12651 SDValue TGA = DAG.getTargetGlobalAddress(GA->getGlobal(), dl,
12652 GA->getValueType(0),
12656 X86ISD::NodeType CallType = LocalDynamic ? X86ISD::TLSBASEADDR
12660 SDValue Ops[] = { Chain, TGA, *InFlag };
12661 Chain = DAG.getNode(CallType, dl, NodeTys, Ops);
12663 SDValue Ops[] = { Chain, TGA };
12664 Chain = DAG.getNode(CallType, dl, NodeTys, Ops);
12667 // TLSADDR will be codegen'ed as call. Inform MFI that function has calls.
12668 MFI->setAdjustsStack(true);
12670 SDValue Flag = Chain.getValue(1);
12671 return DAG.getCopyFromReg(Chain, dl, ReturnReg, PtrVT, Flag);
12674 // Lower ISD::GlobalTLSAddress using the "general dynamic" model, 32 bit
12676 LowerToTLSGeneralDynamicModel32(GlobalAddressSDNode *GA, SelectionDAG &DAG,
12679 SDLoc dl(GA); // ? function entry point might be better
12680 SDValue Chain = DAG.getCopyToReg(DAG.getEntryNode(), dl, X86::EBX,
12681 DAG.getNode(X86ISD::GlobalBaseReg,
12682 SDLoc(), PtrVT), InFlag);
12683 InFlag = Chain.getValue(1);
12685 return GetTLSADDR(DAG, Chain, GA, &InFlag, PtrVT, X86::EAX, X86II::MO_TLSGD);
12688 // Lower ISD::GlobalTLSAddress using the "general dynamic" model, 64 bit
12690 LowerToTLSGeneralDynamicModel64(GlobalAddressSDNode *GA, SelectionDAG &DAG,
12692 return GetTLSADDR(DAG, DAG.getEntryNode(), GA, nullptr, PtrVT,
12693 X86::RAX, X86II::MO_TLSGD);
12696 static SDValue LowerToTLSLocalDynamicModel(GlobalAddressSDNode *GA,
12702 // Get the start address of the TLS block for this module.
12703 X86MachineFunctionInfo* MFI = DAG.getMachineFunction()
12704 .getInfo<X86MachineFunctionInfo>();
12705 MFI->incNumLocalDynamicTLSAccesses();
12709 Base = GetTLSADDR(DAG, DAG.getEntryNode(), GA, nullptr, PtrVT, X86::RAX,
12710 X86II::MO_TLSLD, /*LocalDynamic=*/true);
12713 SDValue Chain = DAG.getCopyToReg(DAG.getEntryNode(), dl, X86::EBX,
12714 DAG.getNode(X86ISD::GlobalBaseReg, SDLoc(), PtrVT), InFlag);
12715 InFlag = Chain.getValue(1);
12716 Base = GetTLSADDR(DAG, Chain, GA, &InFlag, PtrVT, X86::EAX,
12717 X86II::MO_TLSLDM, /*LocalDynamic=*/true);
12720 // Note: the CleanupLocalDynamicTLSPass will remove redundant computations
12724 unsigned char OperandFlags = X86II::MO_DTPOFF;
12725 unsigned WrapperKind = X86ISD::Wrapper;
12726 SDValue TGA = DAG.getTargetGlobalAddress(GA->getGlobal(), dl,
12727 GA->getValueType(0),
12728 GA->getOffset(), OperandFlags);
12729 SDValue Offset = DAG.getNode(WrapperKind, dl, PtrVT, TGA);
12731 // Add x@dtpoff with the base.
12732 return DAG.getNode(ISD::ADD, dl, PtrVT, Offset, Base);
12735 // Lower ISD::GlobalTLSAddress using the "initial exec" or "local exec" model.
12736 static SDValue LowerToTLSExecModel(GlobalAddressSDNode *GA, SelectionDAG &DAG,
12737 const EVT PtrVT, TLSModel::Model model,
12738 bool is64Bit, bool isPIC) {
12741 // Get the Thread Pointer, which is %gs:0 (32-bit) or %fs:0 (64-bit).
12742 Value *Ptr = Constant::getNullValue(Type::getInt8PtrTy(*DAG.getContext(),
12743 is64Bit ? 257 : 256));
12745 SDValue ThreadPointer =
12746 DAG.getLoad(PtrVT, dl, DAG.getEntryNode(), DAG.getIntPtrConstant(0),
12747 MachinePointerInfo(Ptr), false, false, false, 0);
12749 unsigned char OperandFlags = 0;
12750 // Most TLS accesses are not RIP relative, even on x86-64. One exception is
12752 unsigned WrapperKind = X86ISD::Wrapper;
12753 if (model == TLSModel::LocalExec) {
12754 OperandFlags = is64Bit ? X86II::MO_TPOFF : X86II::MO_NTPOFF;
12755 } else if (model == TLSModel::InitialExec) {
12757 OperandFlags = X86II::MO_GOTTPOFF;
12758 WrapperKind = X86ISD::WrapperRIP;
12760 OperandFlags = isPIC ? X86II::MO_GOTNTPOFF : X86II::MO_INDNTPOFF;
12763 llvm_unreachable("Unexpected model");
12766 // emit "addl x@ntpoff,%eax" (local exec)
12767 // or "addl x@indntpoff,%eax" (initial exec)
12768 // or "addl x@gotntpoff(%ebx) ,%eax" (initial exec, 32-bit pic)
12770 DAG.getTargetGlobalAddress(GA->getGlobal(), dl, GA->getValueType(0),
12771 GA->getOffset(), OperandFlags);
12772 SDValue Offset = DAG.getNode(WrapperKind, dl, PtrVT, TGA);
12774 if (model == TLSModel::InitialExec) {
12775 if (isPIC && !is64Bit) {
12776 Offset = DAG.getNode(ISD::ADD, dl, PtrVT,
12777 DAG.getNode(X86ISD::GlobalBaseReg, SDLoc(), PtrVT),
12781 Offset = DAG.getLoad(PtrVT, dl, DAG.getEntryNode(), Offset,
12782 MachinePointerInfo::getGOT(), false, false, false, 0);
12785 // The address of the thread local variable is the add of the thread
12786 // pointer with the offset of the variable.
12787 return DAG.getNode(ISD::ADD, dl, PtrVT, ThreadPointer, Offset);
12791 X86TargetLowering::LowerGlobalTLSAddress(SDValue Op, SelectionDAG &DAG) const {
12793 GlobalAddressSDNode *GA = cast<GlobalAddressSDNode>(Op);
12794 const GlobalValue *GV = GA->getGlobal();
12796 if (Subtarget->isTargetELF()) {
12797 TLSModel::Model model = DAG.getTarget().getTLSModel(GV);
12800 case TLSModel::GeneralDynamic:
12801 if (Subtarget->is64Bit())
12802 return LowerToTLSGeneralDynamicModel64(GA, DAG, getPointerTy());
12803 return LowerToTLSGeneralDynamicModel32(GA, DAG, getPointerTy());
12804 case TLSModel::LocalDynamic:
12805 return LowerToTLSLocalDynamicModel(GA, DAG, getPointerTy(),
12806 Subtarget->is64Bit());
12807 case TLSModel::InitialExec:
12808 case TLSModel::LocalExec:
12809 return LowerToTLSExecModel(
12810 GA, DAG, getPointerTy(), model, Subtarget->is64Bit(),
12811 DAG.getTarget().getRelocationModel() == Reloc::PIC_);
12813 llvm_unreachable("Unknown TLS model.");
12816 if (Subtarget->isTargetDarwin()) {
12817 // Darwin only has one model of TLS. Lower to that.
12818 unsigned char OpFlag = 0;
12819 unsigned WrapperKind = Subtarget->isPICStyleRIPRel() ?
12820 X86ISD::WrapperRIP : X86ISD::Wrapper;
12822 // In PIC mode (unless we're in RIPRel PIC mode) we add an offset to the
12823 // global base reg.
12824 bool PIC32 = (DAG.getTarget().getRelocationModel() == Reloc::PIC_) &&
12825 !Subtarget->is64Bit();
12827 OpFlag = X86II::MO_TLVP_PIC_BASE;
12829 OpFlag = X86II::MO_TLVP;
12831 SDValue Result = DAG.getTargetGlobalAddress(GA->getGlobal(), DL,
12832 GA->getValueType(0),
12833 GA->getOffset(), OpFlag);
12834 SDValue Offset = DAG.getNode(WrapperKind, DL, getPointerTy(), Result);
12836 // With PIC32, the address is actually $g + Offset.
12838 Offset = DAG.getNode(ISD::ADD, DL, getPointerTy(),
12839 DAG.getNode(X86ISD::GlobalBaseReg,
12840 SDLoc(), getPointerTy()),
12843 // Lowering the machine isd will make sure everything is in the right
12845 SDValue Chain = DAG.getEntryNode();
12846 SDVTList NodeTys = DAG.getVTList(MVT::Other, MVT::Glue);
12847 SDValue Args[] = { Chain, Offset };
12848 Chain = DAG.getNode(X86ISD::TLSCALL, DL, NodeTys, Args);
12850 // TLSCALL will be codegen'ed as call. Inform MFI that function has calls.
12851 MachineFrameInfo *MFI = DAG.getMachineFunction().getFrameInfo();
12852 MFI->setAdjustsStack(true);
12854 // And our return value (tls address) is in the standard call return value
12856 unsigned Reg = Subtarget->is64Bit() ? X86::RAX : X86::EAX;
12857 return DAG.getCopyFromReg(Chain, DL, Reg, getPointerTy(),
12858 Chain.getValue(1));
12861 if (Subtarget->isTargetKnownWindowsMSVC() ||
12862 Subtarget->isTargetWindowsGNU()) {
12863 // Just use the implicit TLS architecture
12864 // Need to generate someting similar to:
12865 // mov rdx, qword [gs:abs 58H]; Load pointer to ThreadLocalStorage
12867 // mov ecx, dword [rel _tls_index]: Load index (from C runtime)
12868 // mov rcx, qword [rdx+rcx*8]
12869 // mov eax, .tls$:tlsvar
12870 // [rax+rcx] contains the address
12871 // Windows 64bit: gs:0x58
12872 // Windows 32bit: fs:__tls_array
12875 SDValue Chain = DAG.getEntryNode();
12877 // Get the Thread Pointer, which is %fs:__tls_array (32-bit) or
12878 // %gs:0x58 (64-bit). On MinGW, __tls_array is not available, so directly
12879 // use its literal value of 0x2C.
12880 Value *Ptr = Constant::getNullValue(Subtarget->is64Bit()
12881 ? Type::getInt8PtrTy(*DAG.getContext(),
12883 : Type::getInt32PtrTy(*DAG.getContext(),
12887 Subtarget->is64Bit()
12888 ? DAG.getIntPtrConstant(0x58)
12889 : (Subtarget->isTargetWindowsGNU()
12890 ? DAG.getIntPtrConstant(0x2C)
12891 : DAG.getExternalSymbol("_tls_array", getPointerTy()));
12893 SDValue ThreadPointer =
12894 DAG.getLoad(getPointerTy(), dl, Chain, TlsArray,
12895 MachinePointerInfo(Ptr), false, false, false, 0);
12897 // Load the _tls_index variable
12898 SDValue IDX = DAG.getExternalSymbol("_tls_index", getPointerTy());
12899 if (Subtarget->is64Bit())
12900 IDX = DAG.getExtLoad(ISD::ZEXTLOAD, dl, getPointerTy(), Chain,
12901 IDX, MachinePointerInfo(), MVT::i32,
12902 false, false, false, 0);
12904 IDX = DAG.getLoad(getPointerTy(), dl, Chain, IDX, MachinePointerInfo(),
12905 false, false, false, 0);
12907 SDValue Scale = DAG.getConstant(Log2_64_Ceil(TD->getPointerSize()),
12909 IDX = DAG.getNode(ISD::SHL, dl, getPointerTy(), IDX, Scale);
12911 SDValue res = DAG.getNode(ISD::ADD, dl, getPointerTy(), ThreadPointer, IDX);
12912 res = DAG.getLoad(getPointerTy(), dl, Chain, res, MachinePointerInfo(),
12913 false, false, false, 0);
12915 // Get the offset of start of .tls section
12916 SDValue TGA = DAG.getTargetGlobalAddress(GA->getGlobal(), dl,
12917 GA->getValueType(0),
12918 GA->getOffset(), X86II::MO_SECREL);
12919 SDValue Offset = DAG.getNode(X86ISD::Wrapper, dl, getPointerTy(), TGA);
12921 // The address of the thread local variable is the add of the thread
12922 // pointer with the offset of the variable.
12923 return DAG.getNode(ISD::ADD, dl, getPointerTy(), res, Offset);
12926 llvm_unreachable("TLS not implemented for this target.");
12929 /// LowerShiftParts - Lower SRA_PARTS and friends, which return two i32 values
12930 /// and take a 2 x i32 value to shift plus a shift amount.
12931 static SDValue LowerShiftParts(SDValue Op, SelectionDAG &DAG) {
12932 assert(Op.getNumOperands() == 3 && "Not a double-shift!");
12933 MVT VT = Op.getSimpleValueType();
12934 unsigned VTBits = VT.getSizeInBits();
12936 bool isSRA = Op.getOpcode() == ISD::SRA_PARTS;
12937 SDValue ShOpLo = Op.getOperand(0);
12938 SDValue ShOpHi = Op.getOperand(1);
12939 SDValue ShAmt = Op.getOperand(2);
12940 // X86ISD::SHLD and X86ISD::SHRD have defined overflow behavior but the
12941 // generic ISD nodes haven't. Insert an AND to be safe, it's optimized away
12943 SDValue SafeShAmt = DAG.getNode(ISD::AND, dl, MVT::i8, ShAmt,
12944 DAG.getConstant(VTBits - 1, MVT::i8));
12945 SDValue Tmp1 = isSRA ? DAG.getNode(ISD::SRA, dl, VT, ShOpHi,
12946 DAG.getConstant(VTBits - 1, MVT::i8))
12947 : DAG.getConstant(0, VT);
12949 SDValue Tmp2, Tmp3;
12950 if (Op.getOpcode() == ISD::SHL_PARTS) {
12951 Tmp2 = DAG.getNode(X86ISD::SHLD, dl, VT, ShOpHi, ShOpLo, ShAmt);
12952 Tmp3 = DAG.getNode(ISD::SHL, dl, VT, ShOpLo, SafeShAmt);
12954 Tmp2 = DAG.getNode(X86ISD::SHRD, dl, VT, ShOpLo, ShOpHi, ShAmt);
12955 Tmp3 = DAG.getNode(isSRA ? ISD::SRA : ISD::SRL, dl, VT, ShOpHi, SafeShAmt);
12958 // If the shift amount is larger or equal than the width of a part we can't
12959 // rely on the results of shld/shrd. Insert a test and select the appropriate
12960 // values for large shift amounts.
12961 SDValue AndNode = DAG.getNode(ISD::AND, dl, MVT::i8, ShAmt,
12962 DAG.getConstant(VTBits, MVT::i8));
12963 SDValue Cond = DAG.getNode(X86ISD::CMP, dl, MVT::i32,
12964 AndNode, DAG.getConstant(0, MVT::i8));
12967 SDValue CC = DAG.getConstant(X86::COND_NE, MVT::i8);
12968 SDValue Ops0[4] = { Tmp2, Tmp3, CC, Cond };
12969 SDValue Ops1[4] = { Tmp3, Tmp1, CC, Cond };
12971 if (Op.getOpcode() == ISD::SHL_PARTS) {
12972 Hi = DAG.getNode(X86ISD::CMOV, dl, VT, Ops0);
12973 Lo = DAG.getNode(X86ISD::CMOV, dl, VT, Ops1);
12975 Lo = DAG.getNode(X86ISD::CMOV, dl, VT, Ops0);
12976 Hi = DAG.getNode(X86ISD::CMOV, dl, VT, Ops1);
12979 SDValue Ops[2] = { Lo, Hi };
12980 return DAG.getMergeValues(Ops, dl);
12983 SDValue X86TargetLowering::LowerSINT_TO_FP(SDValue Op,
12984 SelectionDAG &DAG) const {
12985 MVT SrcVT = Op.getOperand(0).getSimpleValueType();
12987 if (SrcVT.isVector())
12990 assert(SrcVT <= MVT::i64 && SrcVT >= MVT::i16 &&
12991 "Unknown SINT_TO_FP to lower!");
12993 // These are really Legal; return the operand so the caller accepts it as
12995 if (SrcVT == MVT::i32 && isScalarFPTypeInSSEReg(Op.getValueType()))
12997 if (SrcVT == MVT::i64 && isScalarFPTypeInSSEReg(Op.getValueType()) &&
12998 Subtarget->is64Bit()) {
13003 unsigned Size = SrcVT.getSizeInBits()/8;
13004 MachineFunction &MF = DAG.getMachineFunction();
13005 int SSFI = MF.getFrameInfo()->CreateStackObject(Size, Size, false);
13006 SDValue StackSlot = DAG.getFrameIndex(SSFI, getPointerTy());
13007 SDValue Chain = DAG.getStore(DAG.getEntryNode(), dl, Op.getOperand(0),
13009 MachinePointerInfo::getFixedStack(SSFI),
13011 return BuildFILD(Op, SrcVT, Chain, StackSlot, DAG);
13014 SDValue X86TargetLowering::BuildFILD(SDValue Op, EVT SrcVT, SDValue Chain,
13016 SelectionDAG &DAG) const {
13020 bool useSSE = isScalarFPTypeInSSEReg(Op.getValueType());
13022 Tys = DAG.getVTList(MVT::f64, MVT::Other, MVT::Glue);
13024 Tys = DAG.getVTList(Op.getValueType(), MVT::Other);
13026 unsigned ByteSize = SrcVT.getSizeInBits()/8;
13028 FrameIndexSDNode *FI = dyn_cast<FrameIndexSDNode>(StackSlot);
13029 MachineMemOperand *MMO;
13031 int SSFI = FI->getIndex();
13033 DAG.getMachineFunction()
13034 .getMachineMemOperand(MachinePointerInfo::getFixedStack(SSFI),
13035 MachineMemOperand::MOLoad, ByteSize, ByteSize);
13037 MMO = cast<LoadSDNode>(StackSlot)->getMemOperand();
13038 StackSlot = StackSlot.getOperand(1);
13040 SDValue Ops[] = { Chain, StackSlot, DAG.getValueType(SrcVT) };
13041 SDValue Result = DAG.getMemIntrinsicNode(useSSE ? X86ISD::FILD_FLAG :
13043 Tys, Ops, SrcVT, MMO);
13046 Chain = Result.getValue(1);
13047 SDValue InFlag = Result.getValue(2);
13049 // FIXME: Currently the FST is flagged to the FILD_FLAG. This
13050 // shouldn't be necessary except that RFP cannot be live across
13051 // multiple blocks. When stackifier is fixed, they can be uncoupled.
13052 MachineFunction &MF = DAG.getMachineFunction();
13053 unsigned SSFISize = Op.getValueType().getSizeInBits()/8;
13054 int SSFI = MF.getFrameInfo()->CreateStackObject(SSFISize, SSFISize, false);
13055 SDValue StackSlot = DAG.getFrameIndex(SSFI, getPointerTy());
13056 Tys = DAG.getVTList(MVT::Other);
13058 Chain, Result, StackSlot, DAG.getValueType(Op.getValueType()), InFlag
13060 MachineMemOperand *MMO =
13061 DAG.getMachineFunction()
13062 .getMachineMemOperand(MachinePointerInfo::getFixedStack(SSFI),
13063 MachineMemOperand::MOStore, SSFISize, SSFISize);
13065 Chain = DAG.getMemIntrinsicNode(X86ISD::FST, DL, Tys,
13066 Ops, Op.getValueType(), MMO);
13067 Result = DAG.getLoad(Op.getValueType(), DL, Chain, StackSlot,
13068 MachinePointerInfo::getFixedStack(SSFI),
13069 false, false, false, 0);
13075 // LowerUINT_TO_FP_i64 - 64-bit unsigned integer to double expansion.
13076 SDValue X86TargetLowering::LowerUINT_TO_FP_i64(SDValue Op,
13077 SelectionDAG &DAG) const {
13078 // This algorithm is not obvious. Here it is what we're trying to output:
13081 punpckldq (c0), %xmm0 // c0: (uint4){ 0x43300000U, 0x45300000U, 0U, 0U }
13082 subpd (c1), %xmm0 // c1: (double2){ 0x1.0p52, 0x1.0p52 * 0x1.0p32 }
13084 haddpd %xmm0, %xmm0
13086 pshufd $0x4e, %xmm0, %xmm1
13092 LLVMContext *Context = DAG.getContext();
13094 // Build some magic constants.
13095 static const uint32_t CV0[] = { 0x43300000, 0x45300000, 0, 0 };
13096 Constant *C0 = ConstantDataVector::get(*Context, CV0);
13097 SDValue CPIdx0 = DAG.getConstantPool(C0, getPointerTy(), 16);
13099 SmallVector<Constant*,2> CV1;
13101 ConstantFP::get(*Context, APFloat(APFloat::IEEEdouble,
13102 APInt(64, 0x4330000000000000ULL))));
13104 ConstantFP::get(*Context, APFloat(APFloat::IEEEdouble,
13105 APInt(64, 0x4530000000000000ULL))));
13106 Constant *C1 = ConstantVector::get(CV1);
13107 SDValue CPIdx1 = DAG.getConstantPool(C1, getPointerTy(), 16);
13109 // Load the 64-bit value into an XMM register.
13110 SDValue XR1 = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, MVT::v2i64,
13112 SDValue CLod0 = DAG.getLoad(MVT::v4i32, dl, DAG.getEntryNode(), CPIdx0,
13113 MachinePointerInfo::getConstantPool(),
13114 false, false, false, 16);
13115 SDValue Unpck1 = getUnpackl(DAG, dl, MVT::v4i32,
13116 DAG.getNode(ISD::BITCAST, dl, MVT::v4i32, XR1),
13119 SDValue CLod1 = DAG.getLoad(MVT::v2f64, dl, CLod0.getValue(1), CPIdx1,
13120 MachinePointerInfo::getConstantPool(),
13121 false, false, false, 16);
13122 SDValue XR2F = DAG.getNode(ISD::BITCAST, dl, MVT::v2f64, Unpck1);
13123 SDValue Sub = DAG.getNode(ISD::FSUB, dl, MVT::v2f64, XR2F, CLod1);
13126 if (Subtarget->hasSSE3()) {
13127 // FIXME: The 'haddpd' instruction may be slower than 'movhlps + addsd'.
13128 Result = DAG.getNode(X86ISD::FHADD, dl, MVT::v2f64, Sub, Sub);
13130 SDValue S2F = DAG.getNode(ISD::BITCAST, dl, MVT::v4i32, Sub);
13131 SDValue Shuffle = getTargetShuffleNode(X86ISD::PSHUFD, dl, MVT::v4i32,
13133 Result = DAG.getNode(ISD::FADD, dl, MVT::v2f64,
13134 DAG.getNode(ISD::BITCAST, dl, MVT::v2f64, Shuffle),
13138 return DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::f64, Result,
13139 DAG.getIntPtrConstant(0));
13142 // LowerUINT_TO_FP_i32 - 32-bit unsigned integer to float expansion.
13143 SDValue X86TargetLowering::LowerUINT_TO_FP_i32(SDValue Op,
13144 SelectionDAG &DAG) const {
13146 // FP constant to bias correct the final result.
13147 SDValue Bias = DAG.getConstantFP(BitsToDouble(0x4330000000000000ULL),
13150 // Load the 32-bit value into an XMM register.
13151 SDValue Load = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, MVT::v4i32,
13154 // Zero out the upper parts of the register.
13155 Load = getShuffleVectorZeroOrUndef(Load, 0, true, Subtarget, DAG);
13157 Load = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::f64,
13158 DAG.getNode(ISD::BITCAST, dl, MVT::v2f64, Load),
13159 DAG.getIntPtrConstant(0));
13161 // Or the load with the bias.
13162 SDValue Or = DAG.getNode(ISD::OR, dl, MVT::v2i64,
13163 DAG.getNode(ISD::BITCAST, dl, MVT::v2i64,
13164 DAG.getNode(ISD::SCALAR_TO_VECTOR, dl,
13165 MVT::v2f64, Load)),
13166 DAG.getNode(ISD::BITCAST, dl, MVT::v2i64,
13167 DAG.getNode(ISD::SCALAR_TO_VECTOR, dl,
13168 MVT::v2f64, Bias)));
13169 Or = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::f64,
13170 DAG.getNode(ISD::BITCAST, dl, MVT::v2f64, Or),
13171 DAG.getIntPtrConstant(0));
13173 // Subtract the bias.
13174 SDValue Sub = DAG.getNode(ISD::FSUB, dl, MVT::f64, Or, Bias);
13176 // Handle final rounding.
13177 EVT DestVT = Op.getValueType();
13179 if (DestVT.bitsLT(MVT::f64))
13180 return DAG.getNode(ISD::FP_ROUND, dl, DestVT, Sub,
13181 DAG.getIntPtrConstant(0));
13182 if (DestVT.bitsGT(MVT::f64))
13183 return DAG.getNode(ISD::FP_EXTEND, dl, DestVT, Sub);
13185 // Handle final rounding.
13189 SDValue X86TargetLowering::lowerUINT_TO_FP_vec(SDValue Op,
13190 SelectionDAG &DAG) const {
13191 SDValue N0 = Op.getOperand(0);
13192 MVT SVT = N0.getSimpleValueType();
13195 assert((SVT == MVT::v4i8 || SVT == MVT::v4i16 ||
13196 SVT == MVT::v8i8 || SVT == MVT::v8i16) &&
13197 "Custom UINT_TO_FP is not supported!");
13199 MVT NVT = MVT::getVectorVT(MVT::i32, SVT.getVectorNumElements());
13200 return DAG.getNode(ISD::SINT_TO_FP, dl, Op.getValueType(),
13201 DAG.getNode(ISD::ZERO_EXTEND, dl, NVT, N0));
13204 SDValue X86TargetLowering::LowerUINT_TO_FP(SDValue Op,
13205 SelectionDAG &DAG) const {
13206 SDValue N0 = Op.getOperand(0);
13209 if (Op.getValueType().isVector())
13210 return lowerUINT_TO_FP_vec(Op, DAG);
13212 // Since UINT_TO_FP is legal (it's marked custom), dag combiner won't
13213 // optimize it to a SINT_TO_FP when the sign bit is known zero. Perform
13214 // the optimization here.
13215 if (DAG.SignBitIsZero(N0))
13216 return DAG.getNode(ISD::SINT_TO_FP, dl, Op.getValueType(), N0);
13218 MVT SrcVT = N0.getSimpleValueType();
13219 MVT DstVT = Op.getSimpleValueType();
13220 if (SrcVT == MVT::i64 && DstVT == MVT::f64 && X86ScalarSSEf64)
13221 return LowerUINT_TO_FP_i64(Op, DAG);
13222 if (SrcVT == MVT::i32 && X86ScalarSSEf64)
13223 return LowerUINT_TO_FP_i32(Op, DAG);
13224 if (Subtarget->is64Bit() && SrcVT == MVT::i64 && DstVT == MVT::f32)
13227 // Make a 64-bit buffer, and use it to build an FILD.
13228 SDValue StackSlot = DAG.CreateStackTemporary(MVT::i64);
13229 if (SrcVT == MVT::i32) {
13230 SDValue WordOff = DAG.getConstant(4, getPointerTy());
13231 SDValue OffsetSlot = DAG.getNode(ISD::ADD, dl,
13232 getPointerTy(), StackSlot, WordOff);
13233 SDValue Store1 = DAG.getStore(DAG.getEntryNode(), dl, Op.getOperand(0),
13234 StackSlot, MachinePointerInfo(),
13236 SDValue Store2 = DAG.getStore(Store1, dl, DAG.getConstant(0, MVT::i32),
13237 OffsetSlot, MachinePointerInfo(),
13239 SDValue Fild = BuildFILD(Op, MVT::i64, Store2, StackSlot, DAG);
13243 assert(SrcVT == MVT::i64 && "Unexpected type in UINT_TO_FP");
13244 SDValue Store = DAG.getStore(DAG.getEntryNode(), dl, Op.getOperand(0),
13245 StackSlot, MachinePointerInfo(),
13247 // For i64 source, we need to add the appropriate power of 2 if the input
13248 // was negative. This is the same as the optimization in
13249 // DAGTypeLegalizer::ExpandIntOp_UNIT_TO_FP, and for it to be safe here,
13250 // we must be careful to do the computation in x87 extended precision, not
13251 // in SSE. (The generic code can't know it's OK to do this, or how to.)
13252 int SSFI = cast<FrameIndexSDNode>(StackSlot)->getIndex();
13253 MachineMemOperand *MMO =
13254 DAG.getMachineFunction()
13255 .getMachineMemOperand(MachinePointerInfo::getFixedStack(SSFI),
13256 MachineMemOperand::MOLoad, 8, 8);
13258 SDVTList Tys = DAG.getVTList(MVT::f80, MVT::Other);
13259 SDValue Ops[] = { Store, StackSlot, DAG.getValueType(MVT::i64) };
13260 SDValue Fild = DAG.getMemIntrinsicNode(X86ISD::FILD, dl, Tys, Ops,
13263 APInt FF(32, 0x5F800000ULL);
13265 // Check whether the sign bit is set.
13266 SDValue SignSet = DAG.getSetCC(dl,
13267 getSetCCResultType(*DAG.getContext(), MVT::i64),
13268 Op.getOperand(0), DAG.getConstant(0, MVT::i64),
13271 // Build a 64 bit pair (0, FF) in the constant pool, with FF in the lo bits.
13272 SDValue FudgePtr = DAG.getConstantPool(
13273 ConstantInt::get(*DAG.getContext(), FF.zext(64)),
13276 // Get a pointer to FF if the sign bit was set, or to 0 otherwise.
13277 SDValue Zero = DAG.getIntPtrConstant(0);
13278 SDValue Four = DAG.getIntPtrConstant(4);
13279 SDValue Offset = DAG.getNode(ISD::SELECT, dl, Zero.getValueType(), SignSet,
13281 FudgePtr = DAG.getNode(ISD::ADD, dl, getPointerTy(), FudgePtr, Offset);
13283 // Load the value out, extending it from f32 to f80.
13284 // FIXME: Avoid the extend by constructing the right constant pool?
13285 SDValue Fudge = DAG.getExtLoad(ISD::EXTLOAD, dl, MVT::f80, DAG.getEntryNode(),
13286 FudgePtr, MachinePointerInfo::getConstantPool(),
13287 MVT::f32, false, false, false, 4);
13288 // Extend everything to 80 bits to force it to be done on x87.
13289 SDValue Add = DAG.getNode(ISD::FADD, dl, MVT::f80, Fild, Fudge);
13290 return DAG.getNode(ISD::FP_ROUND, dl, DstVT, Add, DAG.getIntPtrConstant(0));
13293 std::pair<SDValue,SDValue>
13294 X86TargetLowering:: FP_TO_INTHelper(SDValue Op, SelectionDAG &DAG,
13295 bool IsSigned, bool IsReplace) const {
13298 EVT DstTy = Op.getValueType();
13300 if (!IsSigned && !isIntegerTypeFTOL(DstTy)) {
13301 assert(DstTy == MVT::i32 && "Unexpected FP_TO_UINT");
13305 assert(DstTy.getSimpleVT() <= MVT::i64 &&
13306 DstTy.getSimpleVT() >= MVT::i16 &&
13307 "Unknown FP_TO_INT to lower!");
13309 // These are really Legal.
13310 if (DstTy == MVT::i32 &&
13311 isScalarFPTypeInSSEReg(Op.getOperand(0).getValueType()))
13312 return std::make_pair(SDValue(), SDValue());
13313 if (Subtarget->is64Bit() &&
13314 DstTy == MVT::i64 &&
13315 isScalarFPTypeInSSEReg(Op.getOperand(0).getValueType()))
13316 return std::make_pair(SDValue(), SDValue());
13318 // We lower FP->int64 either into FISTP64 followed by a load from a temporary
13319 // stack slot, or into the FTOL runtime function.
13320 MachineFunction &MF = DAG.getMachineFunction();
13321 unsigned MemSize = DstTy.getSizeInBits()/8;
13322 int SSFI = MF.getFrameInfo()->CreateStackObject(MemSize, MemSize, false);
13323 SDValue StackSlot = DAG.getFrameIndex(SSFI, getPointerTy());
13326 if (!IsSigned && isIntegerTypeFTOL(DstTy))
13327 Opc = X86ISD::WIN_FTOL;
13329 switch (DstTy.getSimpleVT().SimpleTy) {
13330 default: llvm_unreachable("Invalid FP_TO_SINT to lower!");
13331 case MVT::i16: Opc = X86ISD::FP_TO_INT16_IN_MEM; break;
13332 case MVT::i32: Opc = X86ISD::FP_TO_INT32_IN_MEM; break;
13333 case MVT::i64: Opc = X86ISD::FP_TO_INT64_IN_MEM; break;
13336 SDValue Chain = DAG.getEntryNode();
13337 SDValue Value = Op.getOperand(0);
13338 EVT TheVT = Op.getOperand(0).getValueType();
13339 // FIXME This causes a redundant load/store if the SSE-class value is already
13340 // in memory, such as if it is on the callstack.
13341 if (isScalarFPTypeInSSEReg(TheVT)) {
13342 assert(DstTy == MVT::i64 && "Invalid FP_TO_SINT to lower!");
13343 Chain = DAG.getStore(Chain, DL, Value, StackSlot,
13344 MachinePointerInfo::getFixedStack(SSFI),
13346 SDVTList Tys = DAG.getVTList(Op.getOperand(0).getValueType(), MVT::Other);
13348 Chain, StackSlot, DAG.getValueType(TheVT)
13351 MachineMemOperand *MMO =
13352 MF.getMachineMemOperand(MachinePointerInfo::getFixedStack(SSFI),
13353 MachineMemOperand::MOLoad, MemSize, MemSize);
13354 Value = DAG.getMemIntrinsicNode(X86ISD::FLD, DL, Tys, Ops, DstTy, MMO);
13355 Chain = Value.getValue(1);
13356 SSFI = MF.getFrameInfo()->CreateStackObject(MemSize, MemSize, false);
13357 StackSlot = DAG.getFrameIndex(SSFI, getPointerTy());
13360 MachineMemOperand *MMO =
13361 MF.getMachineMemOperand(MachinePointerInfo::getFixedStack(SSFI),
13362 MachineMemOperand::MOStore, MemSize, MemSize);
13364 if (Opc != X86ISD::WIN_FTOL) {
13365 // Build the FP_TO_INT*_IN_MEM
13366 SDValue Ops[] = { Chain, Value, StackSlot };
13367 SDValue FIST = DAG.getMemIntrinsicNode(Opc, DL, DAG.getVTList(MVT::Other),
13369 return std::make_pair(FIST, StackSlot);
13371 SDValue ftol = DAG.getNode(X86ISD::WIN_FTOL, DL,
13372 DAG.getVTList(MVT::Other, MVT::Glue),
13374 SDValue eax = DAG.getCopyFromReg(ftol, DL, X86::EAX,
13375 MVT::i32, ftol.getValue(1));
13376 SDValue edx = DAG.getCopyFromReg(eax.getValue(1), DL, X86::EDX,
13377 MVT::i32, eax.getValue(2));
13378 SDValue Ops[] = { eax, edx };
13379 SDValue pair = IsReplace
13380 ? DAG.getNode(ISD::BUILD_PAIR, DL, MVT::i64, Ops)
13381 : DAG.getMergeValues(Ops, DL);
13382 return std::make_pair(pair, SDValue());
13386 static SDValue LowerAVXExtend(SDValue Op, SelectionDAG &DAG,
13387 const X86Subtarget *Subtarget) {
13388 MVT VT = Op->getSimpleValueType(0);
13389 SDValue In = Op->getOperand(0);
13390 MVT InVT = In.getSimpleValueType();
13393 // Optimize vectors in AVX mode:
13396 // Use vpunpcklwd for 4 lower elements v8i16 -> v4i32.
13397 // Use vpunpckhwd for 4 upper elements v8i16 -> v4i32.
13398 // Concat upper and lower parts.
13401 // Use vpunpckldq for 4 lower elements v4i32 -> v2i64.
13402 // Use vpunpckhdq for 4 upper elements v4i32 -> v2i64.
13403 // Concat upper and lower parts.
13406 if (((VT != MVT::v16i16) || (InVT != MVT::v16i8)) &&
13407 ((VT != MVT::v8i32) || (InVT != MVT::v8i16)) &&
13408 ((VT != MVT::v4i64) || (InVT != MVT::v4i32)))
13411 if (Subtarget->hasInt256())
13412 return DAG.getNode(X86ISD::VZEXT, dl, VT, In);
13414 SDValue ZeroVec = getZeroVector(InVT, Subtarget, DAG, dl);
13415 SDValue Undef = DAG.getUNDEF(InVT);
13416 bool NeedZero = Op.getOpcode() == ISD::ZERO_EXTEND;
13417 SDValue OpLo = getUnpackl(DAG, dl, InVT, In, NeedZero ? ZeroVec : Undef);
13418 SDValue OpHi = getUnpackh(DAG, dl, InVT, In, NeedZero ? ZeroVec : Undef);
13420 MVT HVT = MVT::getVectorVT(VT.getVectorElementType(),
13421 VT.getVectorNumElements()/2);
13423 OpLo = DAG.getNode(ISD::BITCAST, dl, HVT, OpLo);
13424 OpHi = DAG.getNode(ISD::BITCAST, dl, HVT, OpHi);
13426 return DAG.getNode(ISD::CONCAT_VECTORS, dl, VT, OpLo, OpHi);
13429 static SDValue LowerZERO_EXTEND_AVX512(SDValue Op,
13430 SelectionDAG &DAG) {
13431 MVT VT = Op->getSimpleValueType(0);
13432 SDValue In = Op->getOperand(0);
13433 MVT InVT = In.getSimpleValueType();
13435 unsigned int NumElts = VT.getVectorNumElements();
13436 if (NumElts != 8 && NumElts != 16)
13439 if (VT.is512BitVector() && InVT.getVectorElementType() != MVT::i1)
13440 return DAG.getNode(X86ISD::VZEXT, DL, VT, In);
13442 EVT ExtVT = (NumElts == 8)? MVT::v8i64 : MVT::v16i32;
13443 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
13444 // Now we have only mask extension
13445 assert(InVT.getVectorElementType() == MVT::i1);
13446 SDValue Cst = DAG.getTargetConstant(1, ExtVT.getScalarType());
13447 const Constant *C = (dyn_cast<ConstantSDNode>(Cst))->getConstantIntValue();
13448 SDValue CP = DAG.getConstantPool(C, TLI.getPointerTy());
13449 unsigned Alignment = cast<ConstantPoolSDNode>(CP)->getAlignment();
13450 SDValue Ld = DAG.getLoad(Cst.getValueType(), DL, DAG.getEntryNode(), CP,
13451 MachinePointerInfo::getConstantPool(),
13452 false, false, false, Alignment);
13454 SDValue Brcst = DAG.getNode(X86ISD::VBROADCASTM, DL, ExtVT, In, Ld);
13455 if (VT.is512BitVector())
13457 return DAG.getNode(X86ISD::VTRUNC, DL, VT, Brcst);
13460 static SDValue LowerANY_EXTEND(SDValue Op, const X86Subtarget *Subtarget,
13461 SelectionDAG &DAG) {
13462 if (Subtarget->hasFp256()) {
13463 SDValue Res = LowerAVXExtend(Op, DAG, Subtarget);
13471 static SDValue LowerZERO_EXTEND(SDValue Op, const X86Subtarget *Subtarget,
13472 SelectionDAG &DAG) {
13474 MVT VT = Op.getSimpleValueType();
13475 SDValue In = Op.getOperand(0);
13476 MVT SVT = In.getSimpleValueType();
13478 if (VT.is512BitVector() || SVT.getVectorElementType() == MVT::i1)
13479 return LowerZERO_EXTEND_AVX512(Op, DAG);
13481 if (Subtarget->hasFp256()) {
13482 SDValue Res = LowerAVXExtend(Op, DAG, Subtarget);
13487 assert(!VT.is256BitVector() || !SVT.is128BitVector() ||
13488 VT.getVectorNumElements() != SVT.getVectorNumElements());
13492 SDValue X86TargetLowering::LowerTRUNCATE(SDValue Op, SelectionDAG &DAG) const {
13494 MVT VT = Op.getSimpleValueType();
13495 SDValue In = Op.getOperand(0);
13496 MVT InVT = In.getSimpleValueType();
13498 if (VT == MVT::i1) {
13499 assert((InVT.isInteger() && (InVT.getSizeInBits() <= 64)) &&
13500 "Invalid scalar TRUNCATE operation");
13501 if (InVT.getSizeInBits() >= 32)
13503 In = DAG.getNode(ISD::ANY_EXTEND, DL, MVT::i32, In);
13504 return DAG.getNode(ISD::TRUNCATE, DL, VT, In);
13506 assert(VT.getVectorNumElements() == InVT.getVectorNumElements() &&
13507 "Invalid TRUNCATE operation");
13509 if (InVT.is512BitVector() || VT.getVectorElementType() == MVT::i1) {
13510 if (VT.getVectorElementType().getSizeInBits() >=8)
13511 return DAG.getNode(X86ISD::VTRUNC, DL, VT, In);
13513 assert(VT.getVectorElementType() == MVT::i1 && "Unexpected vector type");
13514 unsigned NumElts = InVT.getVectorNumElements();
13515 assert ((NumElts == 8 || NumElts == 16) && "Unexpected vector type");
13516 if (InVT.getSizeInBits() < 512) {
13517 MVT ExtVT = (NumElts == 16)? MVT::v16i32 : MVT::v8i64;
13518 In = DAG.getNode(ISD::SIGN_EXTEND, DL, ExtVT, In);
13522 SDValue Cst = DAG.getTargetConstant(1, InVT.getVectorElementType());
13523 const Constant *C = (dyn_cast<ConstantSDNode>(Cst))->getConstantIntValue();
13524 SDValue CP = DAG.getConstantPool(C, getPointerTy());
13525 unsigned Alignment = cast<ConstantPoolSDNode>(CP)->getAlignment();
13526 SDValue Ld = DAG.getLoad(Cst.getValueType(), DL, DAG.getEntryNode(), CP,
13527 MachinePointerInfo::getConstantPool(),
13528 false, false, false, Alignment);
13529 SDValue OneV = DAG.getNode(X86ISD::VBROADCAST, DL, InVT, Ld);
13530 SDValue And = DAG.getNode(ISD::AND, DL, InVT, OneV, In);
13531 return DAG.getNode(X86ISD::TESTM, DL, VT, And, And);
13534 if ((VT == MVT::v4i32) && (InVT == MVT::v4i64)) {
13535 // On AVX2, v4i64 -> v4i32 becomes VPERMD.
13536 if (Subtarget->hasInt256()) {
13537 static const int ShufMask[] = {0, 2, 4, 6, -1, -1, -1, -1};
13538 In = DAG.getNode(ISD::BITCAST, DL, MVT::v8i32, In);
13539 In = DAG.getVectorShuffle(MVT::v8i32, DL, In, DAG.getUNDEF(MVT::v8i32),
13541 return DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, VT, In,
13542 DAG.getIntPtrConstant(0));
13545 SDValue OpLo = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, MVT::v2i64, In,
13546 DAG.getIntPtrConstant(0));
13547 SDValue OpHi = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, MVT::v2i64, In,
13548 DAG.getIntPtrConstant(2));
13549 OpLo = DAG.getNode(ISD::BITCAST, DL, MVT::v4i32, OpLo);
13550 OpHi = DAG.getNode(ISD::BITCAST, DL, MVT::v4i32, OpHi);
13551 static const int ShufMask[] = {0, 2, 4, 6};
13552 return DAG.getVectorShuffle(VT, DL, OpLo, OpHi, ShufMask);
13555 if ((VT == MVT::v8i16) && (InVT == MVT::v8i32)) {
13556 // On AVX2, v8i32 -> v8i16 becomed PSHUFB.
13557 if (Subtarget->hasInt256()) {
13558 In = DAG.getNode(ISD::BITCAST, DL, MVT::v32i8, In);
13560 SmallVector<SDValue,32> pshufbMask;
13561 for (unsigned i = 0; i < 2; ++i) {
13562 pshufbMask.push_back(DAG.getConstant(0x0, MVT::i8));
13563 pshufbMask.push_back(DAG.getConstant(0x1, MVT::i8));
13564 pshufbMask.push_back(DAG.getConstant(0x4, MVT::i8));
13565 pshufbMask.push_back(DAG.getConstant(0x5, MVT::i8));
13566 pshufbMask.push_back(DAG.getConstant(0x8, MVT::i8));
13567 pshufbMask.push_back(DAG.getConstant(0x9, MVT::i8));
13568 pshufbMask.push_back(DAG.getConstant(0xc, MVT::i8));
13569 pshufbMask.push_back(DAG.getConstant(0xd, MVT::i8));
13570 for (unsigned j = 0; j < 8; ++j)
13571 pshufbMask.push_back(DAG.getConstant(0x80, MVT::i8));
13573 SDValue BV = DAG.getNode(ISD::BUILD_VECTOR, DL, MVT::v32i8, pshufbMask);
13574 In = DAG.getNode(X86ISD::PSHUFB, DL, MVT::v32i8, In, BV);
13575 In = DAG.getNode(ISD::BITCAST, DL, MVT::v4i64, In);
13577 static const int ShufMask[] = {0, 2, -1, -1};
13578 In = DAG.getVectorShuffle(MVT::v4i64, DL, In, DAG.getUNDEF(MVT::v4i64),
13580 In = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, MVT::v2i64, In,
13581 DAG.getIntPtrConstant(0));
13582 return DAG.getNode(ISD::BITCAST, DL, VT, In);
13585 SDValue OpLo = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, MVT::v4i32, In,
13586 DAG.getIntPtrConstant(0));
13588 SDValue OpHi = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, MVT::v4i32, In,
13589 DAG.getIntPtrConstant(4));
13591 OpLo = DAG.getNode(ISD::BITCAST, DL, MVT::v16i8, OpLo);
13592 OpHi = DAG.getNode(ISD::BITCAST, DL, MVT::v16i8, OpHi);
13594 // The PSHUFB mask:
13595 static const int ShufMask1[] = {0, 1, 4, 5, 8, 9, 12, 13,
13596 -1, -1, -1, -1, -1, -1, -1, -1};
13598 SDValue Undef = DAG.getUNDEF(MVT::v16i8);
13599 OpLo = DAG.getVectorShuffle(MVT::v16i8, DL, OpLo, Undef, ShufMask1);
13600 OpHi = DAG.getVectorShuffle(MVT::v16i8, DL, OpHi, Undef, ShufMask1);
13602 OpLo = DAG.getNode(ISD::BITCAST, DL, MVT::v4i32, OpLo);
13603 OpHi = DAG.getNode(ISD::BITCAST, DL, MVT::v4i32, OpHi);
13605 // The MOVLHPS Mask:
13606 static const int ShufMask2[] = {0, 1, 4, 5};
13607 SDValue res = DAG.getVectorShuffle(MVT::v4i32, DL, OpLo, OpHi, ShufMask2);
13608 return DAG.getNode(ISD::BITCAST, DL, MVT::v8i16, res);
13611 // Handle truncation of V256 to V128 using shuffles.
13612 if (!VT.is128BitVector() || !InVT.is256BitVector())
13615 assert(Subtarget->hasFp256() && "256-bit vector without AVX!");
13617 unsigned NumElems = VT.getVectorNumElements();
13618 MVT NVT = MVT::getVectorVT(VT.getVectorElementType(), NumElems * 2);
13620 SmallVector<int, 16> MaskVec(NumElems * 2, -1);
13621 // Prepare truncation shuffle mask
13622 for (unsigned i = 0; i != NumElems; ++i)
13623 MaskVec[i] = i * 2;
13624 SDValue V = DAG.getVectorShuffle(NVT, DL,
13625 DAG.getNode(ISD::BITCAST, DL, NVT, In),
13626 DAG.getUNDEF(NVT), &MaskVec[0]);
13627 return DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, VT, V,
13628 DAG.getIntPtrConstant(0));
13631 SDValue X86TargetLowering::LowerFP_TO_SINT(SDValue Op,
13632 SelectionDAG &DAG) const {
13633 assert(!Op.getSimpleValueType().isVector());
13635 std::pair<SDValue,SDValue> Vals = FP_TO_INTHelper(Op, DAG,
13636 /*IsSigned=*/ true, /*IsReplace=*/ false);
13637 SDValue FIST = Vals.first, StackSlot = Vals.second;
13638 // If FP_TO_INTHelper failed, the node is actually supposed to be Legal.
13639 if (!FIST.getNode()) return Op;
13641 if (StackSlot.getNode())
13642 // Load the result.
13643 return DAG.getLoad(Op.getValueType(), SDLoc(Op),
13644 FIST, StackSlot, MachinePointerInfo(),
13645 false, false, false, 0);
13647 // The node is the result.
13651 SDValue X86TargetLowering::LowerFP_TO_UINT(SDValue Op,
13652 SelectionDAG &DAG) const {
13653 std::pair<SDValue,SDValue> Vals = FP_TO_INTHelper(Op, DAG,
13654 /*IsSigned=*/ false, /*IsReplace=*/ false);
13655 SDValue FIST = Vals.first, StackSlot = Vals.second;
13656 assert(FIST.getNode() && "Unexpected failure");
13658 if (StackSlot.getNode())
13659 // Load the result.
13660 return DAG.getLoad(Op.getValueType(), SDLoc(Op),
13661 FIST, StackSlot, MachinePointerInfo(),
13662 false, false, false, 0);
13664 // The node is the result.
13668 static SDValue LowerFP_EXTEND(SDValue Op, SelectionDAG &DAG) {
13670 MVT VT = Op.getSimpleValueType();
13671 SDValue In = Op.getOperand(0);
13672 MVT SVT = In.getSimpleValueType();
13674 assert(SVT == MVT::v2f32 && "Only customize MVT::v2f32 type legalization!");
13676 return DAG.getNode(X86ISD::VFPEXT, DL, VT,
13677 DAG.getNode(ISD::CONCAT_VECTORS, DL, MVT::v4f32,
13678 In, DAG.getUNDEF(SVT)));
13681 // The only differences between FABS and FNEG are the mask and the logic op.
13682 static SDValue LowerFABSorFNEG(SDValue Op, SelectionDAG &DAG) {
13683 assert((Op.getOpcode() == ISD::FABS || Op.getOpcode() == ISD::FNEG) &&
13684 "Wrong opcode for lowering FABS or FNEG.");
13686 bool IsFABS = (Op.getOpcode() == ISD::FABS);
13688 MVT VT = Op.getSimpleValueType();
13689 // Assume scalar op for initialization; update for vector if needed.
13690 // Note that there are no scalar bitwise logical SSE/AVX instructions, so we
13691 // generate a 16-byte vector constant and logic op even for the scalar case.
13692 // Using a 16-byte mask allows folding the load of the mask with
13693 // the logic op, so it can save (~4 bytes) on code size.
13695 unsigned NumElts = VT == MVT::f64 ? 2 : 4;
13696 // FIXME: Use function attribute "OptimizeForSize" and/or CodeGenOpt::Level to
13697 // decide if we should generate a 16-byte constant mask when we only need 4 or
13698 // 8 bytes for the scalar case.
13699 if (VT.isVector()) {
13700 EltVT = VT.getVectorElementType();
13701 NumElts = VT.getVectorNumElements();
13704 unsigned EltBits = EltVT.getSizeInBits();
13705 LLVMContext *Context = DAG.getContext();
13706 // For FABS, mask is 0x7f...; for FNEG, mask is 0x80...
13708 IsFABS ? APInt::getSignedMaxValue(EltBits) : APInt::getSignBit(EltBits);
13709 Constant *C = ConstantInt::get(*Context, MaskElt);
13710 C = ConstantVector::getSplat(NumElts, C);
13711 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
13712 SDValue CPIdx = DAG.getConstantPool(C, TLI.getPointerTy());
13713 unsigned Alignment = cast<ConstantPoolSDNode>(CPIdx)->getAlignment();
13714 SDValue Mask = DAG.getLoad(VT, dl, DAG.getEntryNode(), CPIdx,
13715 MachinePointerInfo::getConstantPool(),
13716 false, false, false, Alignment);
13718 if (VT.isVector()) {
13719 // For a vector, cast operands to a vector type, perform the logic op,
13720 // and cast the result back to the original value type.
13721 MVT VecVT = MVT::getVectorVT(MVT::i64, VT.getSizeInBits() / 64);
13722 SDValue Op0Casted = DAG.getNode(ISD::BITCAST, dl, VecVT, Op.getOperand(0));
13723 SDValue MaskCasted = DAG.getNode(ISD::BITCAST, dl, VecVT, Mask);
13724 unsigned LogicOp = IsFABS ? ISD::AND : ISD::XOR;
13725 return DAG.getNode(ISD::BITCAST, dl, VT,
13726 DAG.getNode(LogicOp, dl, VecVT, Op0Casted, MaskCasted));
13728 // If not vector, then scalar.
13729 unsigned LogicOp = IsFABS ? X86ISD::FAND : X86ISD::FXOR;
13730 return DAG.getNode(LogicOp, dl, VT, Op.getOperand(0), Mask);
13733 static SDValue LowerFCOPYSIGN(SDValue Op, SelectionDAG &DAG) {
13734 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
13735 LLVMContext *Context = DAG.getContext();
13736 SDValue Op0 = Op.getOperand(0);
13737 SDValue Op1 = Op.getOperand(1);
13739 MVT VT = Op.getSimpleValueType();
13740 MVT SrcVT = Op1.getSimpleValueType();
13742 // If second operand is smaller, extend it first.
13743 if (SrcVT.bitsLT(VT)) {
13744 Op1 = DAG.getNode(ISD::FP_EXTEND, dl, VT, Op1);
13747 // And if it is bigger, shrink it first.
13748 if (SrcVT.bitsGT(VT)) {
13749 Op1 = DAG.getNode(ISD::FP_ROUND, dl, VT, Op1, DAG.getIntPtrConstant(1));
13753 // At this point the operands and the result should have the same
13754 // type, and that won't be f80 since that is not custom lowered.
13756 // First get the sign bit of second operand.
13757 SmallVector<Constant*,4> CV;
13758 if (SrcVT == MVT::f64) {
13759 const fltSemantics &Sem = APFloat::IEEEdouble;
13760 CV.push_back(ConstantFP::get(*Context, APFloat(Sem, APInt(64, 1ULL << 63))));
13761 CV.push_back(ConstantFP::get(*Context, APFloat(Sem, APInt(64, 0))));
13763 const fltSemantics &Sem = APFloat::IEEEsingle;
13764 CV.push_back(ConstantFP::get(*Context, APFloat(Sem, APInt(32, 1U << 31))));
13765 CV.push_back(ConstantFP::get(*Context, APFloat(Sem, APInt(32, 0))));
13766 CV.push_back(ConstantFP::get(*Context, APFloat(Sem, APInt(32, 0))));
13767 CV.push_back(ConstantFP::get(*Context, APFloat(Sem, APInt(32, 0))));
13769 Constant *C = ConstantVector::get(CV);
13770 SDValue CPIdx = DAG.getConstantPool(C, TLI.getPointerTy(), 16);
13771 SDValue Mask1 = DAG.getLoad(SrcVT, dl, DAG.getEntryNode(), CPIdx,
13772 MachinePointerInfo::getConstantPool(),
13773 false, false, false, 16);
13774 SDValue SignBit = DAG.getNode(X86ISD::FAND, dl, SrcVT, Op1, Mask1);
13776 // Shift sign bit right or left if the two operands have different types.
13777 if (SrcVT.bitsGT(VT)) {
13778 // Op0 is MVT::f32, Op1 is MVT::f64.
13779 SignBit = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, MVT::v2f64, SignBit);
13780 SignBit = DAG.getNode(X86ISD::FSRL, dl, MVT::v2f64, SignBit,
13781 DAG.getConstant(32, MVT::i32));
13782 SignBit = DAG.getNode(ISD::BITCAST, dl, MVT::v4f32, SignBit);
13783 SignBit = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::f32, SignBit,
13784 DAG.getIntPtrConstant(0));
13787 // Clear first operand sign bit.
13789 if (VT == MVT::f64) {
13790 const fltSemantics &Sem = APFloat::IEEEdouble;
13791 CV.push_back(ConstantFP::get(*Context, APFloat(Sem,
13792 APInt(64, ~(1ULL << 63)))));
13793 CV.push_back(ConstantFP::get(*Context, APFloat(Sem, APInt(64, 0))));
13795 const fltSemantics &Sem = APFloat::IEEEsingle;
13796 CV.push_back(ConstantFP::get(*Context, APFloat(Sem,
13797 APInt(32, ~(1U << 31)))));
13798 CV.push_back(ConstantFP::get(*Context, APFloat(Sem, APInt(32, 0))));
13799 CV.push_back(ConstantFP::get(*Context, APFloat(Sem, APInt(32, 0))));
13800 CV.push_back(ConstantFP::get(*Context, APFloat(Sem, APInt(32, 0))));
13802 C = ConstantVector::get(CV);
13803 CPIdx = DAG.getConstantPool(C, TLI.getPointerTy(), 16);
13804 SDValue Mask2 = DAG.getLoad(VT, dl, DAG.getEntryNode(), CPIdx,
13805 MachinePointerInfo::getConstantPool(),
13806 false, false, false, 16);
13807 SDValue Val = DAG.getNode(X86ISD::FAND, dl, VT, Op0, Mask2);
13809 // Or the value with the sign bit.
13810 return DAG.getNode(X86ISD::FOR, dl, VT, Val, SignBit);
13813 static SDValue LowerFGETSIGN(SDValue Op, SelectionDAG &DAG) {
13814 SDValue N0 = Op.getOperand(0);
13816 MVT VT = Op.getSimpleValueType();
13818 // Lower ISD::FGETSIGN to (AND (X86ISD::FGETSIGNx86 ...) 1).
13819 SDValue xFGETSIGN = DAG.getNode(X86ISD::FGETSIGNx86, dl, VT, N0,
13820 DAG.getConstant(1, VT));
13821 return DAG.getNode(ISD::AND, dl, VT, xFGETSIGN, DAG.getConstant(1, VT));
13824 // Check whether an OR'd tree is PTEST-able.
13825 static SDValue LowerVectorAllZeroTest(SDValue Op, const X86Subtarget *Subtarget,
13826 SelectionDAG &DAG) {
13827 assert(Op.getOpcode() == ISD::OR && "Only check OR'd tree.");
13829 if (!Subtarget->hasSSE41())
13832 if (!Op->hasOneUse())
13835 SDNode *N = Op.getNode();
13838 SmallVector<SDValue, 8> Opnds;
13839 DenseMap<SDValue, unsigned> VecInMap;
13840 SmallVector<SDValue, 8> VecIns;
13841 EVT VT = MVT::Other;
13843 // Recognize a special case where a vector is casted into wide integer to
13845 Opnds.push_back(N->getOperand(0));
13846 Opnds.push_back(N->getOperand(1));
13848 for (unsigned Slot = 0, e = Opnds.size(); Slot < e; ++Slot) {
13849 SmallVectorImpl<SDValue>::const_iterator I = Opnds.begin() + Slot;
13850 // BFS traverse all OR'd operands.
13851 if (I->getOpcode() == ISD::OR) {
13852 Opnds.push_back(I->getOperand(0));
13853 Opnds.push_back(I->getOperand(1));
13854 // Re-evaluate the number of nodes to be traversed.
13855 e += 2; // 2 more nodes (LHS and RHS) are pushed.
13859 // Quit if a non-EXTRACT_VECTOR_ELT
13860 if (I->getOpcode() != ISD::EXTRACT_VECTOR_ELT)
13863 // Quit if without a constant index.
13864 SDValue Idx = I->getOperand(1);
13865 if (!isa<ConstantSDNode>(Idx))
13868 SDValue ExtractedFromVec = I->getOperand(0);
13869 DenseMap<SDValue, unsigned>::iterator M = VecInMap.find(ExtractedFromVec);
13870 if (M == VecInMap.end()) {
13871 VT = ExtractedFromVec.getValueType();
13872 // Quit if not 128/256-bit vector.
13873 if (!VT.is128BitVector() && !VT.is256BitVector())
13875 // Quit if not the same type.
13876 if (VecInMap.begin() != VecInMap.end() &&
13877 VT != VecInMap.begin()->first.getValueType())
13879 M = VecInMap.insert(std::make_pair(ExtractedFromVec, 0)).first;
13880 VecIns.push_back(ExtractedFromVec);
13882 M->second |= 1U << cast<ConstantSDNode>(Idx)->getZExtValue();
13885 assert((VT.is128BitVector() || VT.is256BitVector()) &&
13886 "Not extracted from 128-/256-bit vector.");
13888 unsigned FullMask = (1U << VT.getVectorNumElements()) - 1U;
13890 for (DenseMap<SDValue, unsigned>::const_iterator
13891 I = VecInMap.begin(), E = VecInMap.end(); I != E; ++I) {
13892 // Quit if not all elements are used.
13893 if (I->second != FullMask)
13897 EVT TestVT = VT.is128BitVector() ? MVT::v2i64 : MVT::v4i64;
13899 // Cast all vectors into TestVT for PTEST.
13900 for (unsigned i = 0, e = VecIns.size(); i < e; ++i)
13901 VecIns[i] = DAG.getNode(ISD::BITCAST, DL, TestVT, VecIns[i]);
13903 // If more than one full vectors are evaluated, OR them first before PTEST.
13904 for (unsigned Slot = 0, e = VecIns.size(); e - Slot > 1; Slot += 2, e += 1) {
13905 // Each iteration will OR 2 nodes and append the result until there is only
13906 // 1 node left, i.e. the final OR'd value of all vectors.
13907 SDValue LHS = VecIns[Slot];
13908 SDValue RHS = VecIns[Slot + 1];
13909 VecIns.push_back(DAG.getNode(ISD::OR, DL, TestVT, LHS, RHS));
13912 return DAG.getNode(X86ISD::PTEST, DL, MVT::i32,
13913 VecIns.back(), VecIns.back());
13916 /// \brief return true if \c Op has a use that doesn't just read flags.
13917 static bool hasNonFlagsUse(SDValue Op) {
13918 for (SDNode::use_iterator UI = Op->use_begin(), UE = Op->use_end(); UI != UE;
13920 SDNode *User = *UI;
13921 unsigned UOpNo = UI.getOperandNo();
13922 if (User->getOpcode() == ISD::TRUNCATE && User->hasOneUse()) {
13923 // Look pass truncate.
13924 UOpNo = User->use_begin().getOperandNo();
13925 User = *User->use_begin();
13928 if (User->getOpcode() != ISD::BRCOND && User->getOpcode() != ISD::SETCC &&
13929 !(User->getOpcode() == ISD::SELECT && UOpNo == 0))
13935 /// Emit nodes that will be selected as "test Op0,Op0", or something
13937 SDValue X86TargetLowering::EmitTest(SDValue Op, unsigned X86CC, SDLoc dl,
13938 SelectionDAG &DAG) const {
13939 if (Op.getValueType() == MVT::i1)
13940 // KORTEST instruction should be selected
13941 return DAG.getNode(X86ISD::CMP, dl, MVT::i32, Op,
13942 DAG.getConstant(0, Op.getValueType()));
13944 // CF and OF aren't always set the way we want. Determine which
13945 // of these we need.
13946 bool NeedCF = false;
13947 bool NeedOF = false;
13950 case X86::COND_A: case X86::COND_AE:
13951 case X86::COND_B: case X86::COND_BE:
13954 case X86::COND_G: case X86::COND_GE:
13955 case X86::COND_L: case X86::COND_LE:
13956 case X86::COND_O: case X86::COND_NO: {
13957 // Check if we really need to set the
13958 // Overflow flag. If NoSignedWrap is present
13959 // that is not actually needed.
13960 switch (Op->getOpcode()) {
13965 const BinaryWithFlagsSDNode *BinNode =
13966 cast<BinaryWithFlagsSDNode>(Op.getNode());
13967 if (BinNode->hasNoSignedWrap())
13977 // See if we can use the EFLAGS value from the operand instead of
13978 // doing a separate TEST. TEST always sets OF and CF to 0, so unless
13979 // we prove that the arithmetic won't overflow, we can't use OF or CF.
13980 if (Op.getResNo() != 0 || NeedOF || NeedCF) {
13981 // Emit a CMP with 0, which is the TEST pattern.
13982 //if (Op.getValueType() == MVT::i1)
13983 // return DAG.getNode(X86ISD::CMP, dl, MVT::i1, Op,
13984 // DAG.getConstant(0, MVT::i1));
13985 return DAG.getNode(X86ISD::CMP, dl, MVT::i32, Op,
13986 DAG.getConstant(0, Op.getValueType()));
13988 unsigned Opcode = 0;
13989 unsigned NumOperands = 0;
13991 // Truncate operations may prevent the merge of the SETCC instruction
13992 // and the arithmetic instruction before it. Attempt to truncate the operands
13993 // of the arithmetic instruction and use a reduced bit-width instruction.
13994 bool NeedTruncation = false;
13995 SDValue ArithOp = Op;
13996 if (Op->getOpcode() == ISD::TRUNCATE && Op->hasOneUse()) {
13997 SDValue Arith = Op->getOperand(0);
13998 // Both the trunc and the arithmetic op need to have one user each.
13999 if (Arith->hasOneUse())
14000 switch (Arith.getOpcode()) {
14007 NeedTruncation = true;
14013 // NOTICE: In the code below we use ArithOp to hold the arithmetic operation
14014 // which may be the result of a CAST. We use the variable 'Op', which is the
14015 // non-casted variable when we check for possible users.
14016 switch (ArithOp.getOpcode()) {
14018 // Due to an isel shortcoming, be conservative if this add is likely to be
14019 // selected as part of a load-modify-store instruction. When the root node
14020 // in a match is a store, isel doesn't know how to remap non-chain non-flag
14021 // uses of other nodes in the match, such as the ADD in this case. This
14022 // leads to the ADD being left around and reselected, with the result being
14023 // two adds in the output. Alas, even if none our users are stores, that
14024 // doesn't prove we're O.K. Ergo, if we have any parents that aren't
14025 // CopyToReg or SETCC, eschew INC/DEC. A better fix seems to require
14026 // climbing the DAG back to the root, and it doesn't seem to be worth the
14028 for (SDNode::use_iterator UI = Op.getNode()->use_begin(),
14029 UE = Op.getNode()->use_end(); UI != UE; ++UI)
14030 if (UI->getOpcode() != ISD::CopyToReg &&
14031 UI->getOpcode() != ISD::SETCC &&
14032 UI->getOpcode() != ISD::STORE)
14035 if (ConstantSDNode *C =
14036 dyn_cast<ConstantSDNode>(ArithOp.getNode()->getOperand(1))) {
14037 // An add of one will be selected as an INC.
14038 if (C->getAPIntValue() == 1 && !Subtarget->slowIncDec()) {
14039 Opcode = X86ISD::INC;
14044 // An add of negative one (subtract of one) will be selected as a DEC.
14045 if (C->getAPIntValue().isAllOnesValue() && !Subtarget->slowIncDec()) {
14046 Opcode = X86ISD::DEC;
14052 // Otherwise use a regular EFLAGS-setting add.
14053 Opcode = X86ISD::ADD;
14058 // If we have a constant logical shift that's only used in a comparison
14059 // against zero turn it into an equivalent AND. This allows turning it into
14060 // a TEST instruction later.
14061 if ((X86CC == X86::COND_E || X86CC == X86::COND_NE) && Op->hasOneUse() &&
14062 isa<ConstantSDNode>(Op->getOperand(1)) && !hasNonFlagsUse(Op)) {
14063 EVT VT = Op.getValueType();
14064 unsigned BitWidth = VT.getSizeInBits();
14065 unsigned ShAmt = Op->getConstantOperandVal(1);
14066 if (ShAmt >= BitWidth) // Avoid undefined shifts.
14068 APInt Mask = ArithOp.getOpcode() == ISD::SRL
14069 ? APInt::getHighBitsSet(BitWidth, BitWidth - ShAmt)
14070 : APInt::getLowBitsSet(BitWidth, BitWidth - ShAmt);
14071 if (!Mask.isSignedIntN(32)) // Avoid large immediates.
14073 SDValue New = DAG.getNode(ISD::AND, dl, VT, Op->getOperand(0),
14074 DAG.getConstant(Mask, VT));
14075 DAG.ReplaceAllUsesWith(Op, New);
14081 // If the primary and result isn't used, don't bother using X86ISD::AND,
14082 // because a TEST instruction will be better.
14083 if (!hasNonFlagsUse(Op))
14089 // Due to the ISEL shortcoming noted above, be conservative if this op is
14090 // likely to be selected as part of a load-modify-store instruction.
14091 for (SDNode::use_iterator UI = Op.getNode()->use_begin(),
14092 UE = Op.getNode()->use_end(); UI != UE; ++UI)
14093 if (UI->getOpcode() == ISD::STORE)
14096 // Otherwise use a regular EFLAGS-setting instruction.
14097 switch (ArithOp.getOpcode()) {
14098 default: llvm_unreachable("unexpected operator!");
14099 case ISD::SUB: Opcode = X86ISD::SUB; break;
14100 case ISD::XOR: Opcode = X86ISD::XOR; break;
14101 case ISD::AND: Opcode = X86ISD::AND; break;
14103 if (!NeedTruncation && (X86CC == X86::COND_E || X86CC == X86::COND_NE)) {
14104 SDValue EFLAGS = LowerVectorAllZeroTest(Op, Subtarget, DAG);
14105 if (EFLAGS.getNode())
14108 Opcode = X86ISD::OR;
14122 return SDValue(Op.getNode(), 1);
14128 // If we found that truncation is beneficial, perform the truncation and
14130 if (NeedTruncation) {
14131 EVT VT = Op.getValueType();
14132 SDValue WideVal = Op->getOperand(0);
14133 EVT WideVT = WideVal.getValueType();
14134 unsigned ConvertedOp = 0;
14135 // Use a target machine opcode to prevent further DAGCombine
14136 // optimizations that may separate the arithmetic operations
14137 // from the setcc node.
14138 switch (WideVal.getOpcode()) {
14140 case ISD::ADD: ConvertedOp = X86ISD::ADD; break;
14141 case ISD::SUB: ConvertedOp = X86ISD::SUB; break;
14142 case ISD::AND: ConvertedOp = X86ISD::AND; break;
14143 case ISD::OR: ConvertedOp = X86ISD::OR; break;
14144 case ISD::XOR: ConvertedOp = X86ISD::XOR; break;
14148 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
14149 if (TLI.isOperationLegal(WideVal.getOpcode(), WideVT)) {
14150 SDValue V0 = DAG.getNode(ISD::TRUNCATE, dl, VT, WideVal.getOperand(0));
14151 SDValue V1 = DAG.getNode(ISD::TRUNCATE, dl, VT, WideVal.getOperand(1));
14152 Op = DAG.getNode(ConvertedOp, dl, VT, V0, V1);
14158 // Emit a CMP with 0, which is the TEST pattern.
14159 return DAG.getNode(X86ISD::CMP, dl, MVT::i32, Op,
14160 DAG.getConstant(0, Op.getValueType()));
14162 SDVTList VTs = DAG.getVTList(Op.getValueType(), MVT::i32);
14163 SmallVector<SDValue, 4> Ops;
14164 for (unsigned i = 0; i != NumOperands; ++i)
14165 Ops.push_back(Op.getOperand(i));
14167 SDValue New = DAG.getNode(Opcode, dl, VTs, Ops);
14168 DAG.ReplaceAllUsesWith(Op, New);
14169 return SDValue(New.getNode(), 1);
14172 /// Emit nodes that will be selected as "cmp Op0,Op1", or something
14174 SDValue X86TargetLowering::EmitCmp(SDValue Op0, SDValue Op1, unsigned X86CC,
14175 SDLoc dl, SelectionDAG &DAG) const {
14176 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op1)) {
14177 if (C->getAPIntValue() == 0)
14178 return EmitTest(Op0, X86CC, dl, DAG);
14180 if (Op0.getValueType() == MVT::i1)
14181 llvm_unreachable("Unexpected comparison operation for MVT::i1 operands");
14184 if ((Op0.getValueType() == MVT::i8 || Op0.getValueType() == MVT::i16 ||
14185 Op0.getValueType() == MVT::i32 || Op0.getValueType() == MVT::i64)) {
14186 // Do the comparison at i32 if it's smaller, besides the Atom case.
14187 // This avoids subregister aliasing issues. Keep the smaller reference
14188 // if we're optimizing for size, however, as that'll allow better folding
14189 // of memory operations.
14190 if (Op0.getValueType() != MVT::i32 && Op0.getValueType() != MVT::i64 &&
14191 !DAG.getMachineFunction().getFunction()->getAttributes().hasAttribute(
14192 AttributeSet::FunctionIndex, Attribute::MinSize) &&
14193 !Subtarget->isAtom()) {
14194 unsigned ExtendOp =
14195 isX86CCUnsigned(X86CC) ? ISD::ZERO_EXTEND : ISD::SIGN_EXTEND;
14196 Op0 = DAG.getNode(ExtendOp, dl, MVT::i32, Op0);
14197 Op1 = DAG.getNode(ExtendOp, dl, MVT::i32, Op1);
14199 // Use SUB instead of CMP to enable CSE between SUB and CMP.
14200 SDVTList VTs = DAG.getVTList(Op0.getValueType(), MVT::i32);
14201 SDValue Sub = DAG.getNode(X86ISD::SUB, dl, VTs,
14203 return SDValue(Sub.getNode(), 1);
14205 return DAG.getNode(X86ISD::CMP, dl, MVT::i32, Op0, Op1);
14208 /// Convert a comparison if required by the subtarget.
14209 SDValue X86TargetLowering::ConvertCmpIfNecessary(SDValue Cmp,
14210 SelectionDAG &DAG) const {
14211 // If the subtarget does not support the FUCOMI instruction, floating-point
14212 // comparisons have to be converted.
14213 if (Subtarget->hasCMov() ||
14214 Cmp.getOpcode() != X86ISD::CMP ||
14215 !Cmp.getOperand(0).getValueType().isFloatingPoint() ||
14216 !Cmp.getOperand(1).getValueType().isFloatingPoint())
14219 // The instruction selector will select an FUCOM instruction instead of
14220 // FUCOMI, which writes the comparison result to FPSW instead of EFLAGS. Hence
14221 // build an SDNode sequence that transfers the result from FPSW into EFLAGS:
14222 // (X86sahf (trunc (srl (X86fp_stsw (trunc (X86cmp ...)), 8))))
14224 SDValue TruncFPSW = DAG.getNode(ISD::TRUNCATE, dl, MVT::i16, Cmp);
14225 SDValue FNStSW = DAG.getNode(X86ISD::FNSTSW16r, dl, MVT::i16, TruncFPSW);
14226 SDValue Srl = DAG.getNode(ISD::SRL, dl, MVT::i16, FNStSW,
14227 DAG.getConstant(8, MVT::i8));
14228 SDValue TruncSrl = DAG.getNode(ISD::TRUNCATE, dl, MVT::i8, Srl);
14229 return DAG.getNode(X86ISD::SAHF, dl, MVT::i32, TruncSrl);
14232 static bool isAllOnes(SDValue V) {
14233 ConstantSDNode *C = dyn_cast<ConstantSDNode>(V);
14234 return C && C->isAllOnesValue();
14237 /// LowerToBT - Result of 'and' is compared against zero. Turn it into a BT node
14238 /// if it's possible.
14239 SDValue X86TargetLowering::LowerToBT(SDValue And, ISD::CondCode CC,
14240 SDLoc dl, SelectionDAG &DAG) const {
14241 SDValue Op0 = And.getOperand(0);
14242 SDValue Op1 = And.getOperand(1);
14243 if (Op0.getOpcode() == ISD::TRUNCATE)
14244 Op0 = Op0.getOperand(0);
14245 if (Op1.getOpcode() == ISD::TRUNCATE)
14246 Op1 = Op1.getOperand(0);
14249 if (Op1.getOpcode() == ISD::SHL)
14250 std::swap(Op0, Op1);
14251 if (Op0.getOpcode() == ISD::SHL) {
14252 if (ConstantSDNode *And00C = dyn_cast<ConstantSDNode>(Op0.getOperand(0)))
14253 if (And00C->getZExtValue() == 1) {
14254 // If we looked past a truncate, check that it's only truncating away
14256 unsigned BitWidth = Op0.getValueSizeInBits();
14257 unsigned AndBitWidth = And.getValueSizeInBits();
14258 if (BitWidth > AndBitWidth) {
14260 DAG.computeKnownBits(Op0, Zeros, Ones);
14261 if (Zeros.countLeadingOnes() < BitWidth - AndBitWidth)
14265 RHS = Op0.getOperand(1);
14267 } else if (Op1.getOpcode() == ISD::Constant) {
14268 ConstantSDNode *AndRHS = cast<ConstantSDNode>(Op1);
14269 uint64_t AndRHSVal = AndRHS->getZExtValue();
14270 SDValue AndLHS = Op0;
14272 if (AndRHSVal == 1 && AndLHS.getOpcode() == ISD::SRL) {
14273 LHS = AndLHS.getOperand(0);
14274 RHS = AndLHS.getOperand(1);
14277 // Use BT if the immediate can't be encoded in a TEST instruction.
14278 if (!isUInt<32>(AndRHSVal) && isPowerOf2_64(AndRHSVal)) {
14280 RHS = DAG.getConstant(Log2_64_Ceil(AndRHSVal), LHS.getValueType());
14284 if (LHS.getNode()) {
14285 // If LHS is i8, promote it to i32 with any_extend. There is no i8 BT
14286 // instruction. Since the shift amount is in-range-or-undefined, we know
14287 // that doing a bittest on the i32 value is ok. We extend to i32 because
14288 // the encoding for the i16 version is larger than the i32 version.
14289 // Also promote i16 to i32 for performance / code size reason.
14290 if (LHS.getValueType() == MVT::i8 ||
14291 LHS.getValueType() == MVT::i16)
14292 LHS = DAG.getNode(ISD::ANY_EXTEND, dl, MVT::i32, LHS);
14294 // If the operand types disagree, extend the shift amount to match. Since
14295 // BT ignores high bits (like shifts) we can use anyextend.
14296 if (LHS.getValueType() != RHS.getValueType())
14297 RHS = DAG.getNode(ISD::ANY_EXTEND, dl, LHS.getValueType(), RHS);
14299 SDValue BT = DAG.getNode(X86ISD::BT, dl, MVT::i32, LHS, RHS);
14300 X86::CondCode Cond = CC == ISD::SETEQ ? X86::COND_AE : X86::COND_B;
14301 return DAG.getNode(X86ISD::SETCC, dl, MVT::i8,
14302 DAG.getConstant(Cond, MVT::i8), BT);
14308 /// \brief - Turns an ISD::CondCode into a value suitable for SSE floating point
14310 static int translateX86FSETCC(ISD::CondCode SetCCOpcode, SDValue &Op0,
14315 // SSE Condition code mapping:
14324 switch (SetCCOpcode) {
14325 default: llvm_unreachable("Unexpected SETCC condition");
14327 case ISD::SETEQ: SSECC = 0; break;
14329 case ISD::SETGT: Swap = true; // Fallthrough
14331 case ISD::SETOLT: SSECC = 1; break;
14333 case ISD::SETGE: Swap = true; // Fallthrough
14335 case ISD::SETOLE: SSECC = 2; break;
14336 case ISD::SETUO: SSECC = 3; break;
14338 case ISD::SETNE: SSECC = 4; break;
14339 case ISD::SETULE: Swap = true; // Fallthrough
14340 case ISD::SETUGE: SSECC = 5; break;
14341 case ISD::SETULT: Swap = true; // Fallthrough
14342 case ISD::SETUGT: SSECC = 6; break;
14343 case ISD::SETO: SSECC = 7; break;
14345 case ISD::SETONE: SSECC = 8; break;
14348 std::swap(Op0, Op1);
14353 // Lower256IntVSETCC - Break a VSETCC 256-bit integer VSETCC into two new 128
14354 // ones, and then concatenate the result back.
14355 static SDValue Lower256IntVSETCC(SDValue Op, SelectionDAG &DAG) {
14356 MVT VT = Op.getSimpleValueType();
14358 assert(VT.is256BitVector() && Op.getOpcode() == ISD::SETCC &&
14359 "Unsupported value type for operation");
14361 unsigned NumElems = VT.getVectorNumElements();
14363 SDValue CC = Op.getOperand(2);
14365 // Extract the LHS vectors
14366 SDValue LHS = Op.getOperand(0);
14367 SDValue LHS1 = Extract128BitVector(LHS, 0, DAG, dl);
14368 SDValue LHS2 = Extract128BitVector(LHS, NumElems/2, DAG, dl);
14370 // Extract the RHS vectors
14371 SDValue RHS = Op.getOperand(1);
14372 SDValue RHS1 = Extract128BitVector(RHS, 0, DAG, dl);
14373 SDValue RHS2 = Extract128BitVector(RHS, NumElems/2, DAG, dl);
14375 // Issue the operation on the smaller types and concatenate the result back
14376 MVT EltVT = VT.getVectorElementType();
14377 MVT NewVT = MVT::getVectorVT(EltVT, NumElems/2);
14378 return DAG.getNode(ISD::CONCAT_VECTORS, dl, VT,
14379 DAG.getNode(Op.getOpcode(), dl, NewVT, LHS1, RHS1, CC),
14380 DAG.getNode(Op.getOpcode(), dl, NewVT, LHS2, RHS2, CC));
14383 static SDValue LowerIntVSETCC_AVX512(SDValue Op, SelectionDAG &DAG,
14384 const X86Subtarget *Subtarget) {
14385 SDValue Op0 = Op.getOperand(0);
14386 SDValue Op1 = Op.getOperand(1);
14387 SDValue CC = Op.getOperand(2);
14388 MVT VT = Op.getSimpleValueType();
14391 assert(Op0.getValueType().getVectorElementType().getSizeInBits() >= 8 &&
14392 Op.getValueType().getScalarType() == MVT::i1 &&
14393 "Cannot set masked compare for this operation");
14395 ISD::CondCode SetCCOpcode = cast<CondCodeSDNode>(CC)->get();
14397 bool Unsigned = false;
14400 switch (SetCCOpcode) {
14401 default: llvm_unreachable("Unexpected SETCC condition");
14402 case ISD::SETNE: SSECC = 4; break;
14403 case ISD::SETEQ: Opc = X86ISD::PCMPEQM; break;
14404 case ISD::SETUGT: SSECC = 6; Unsigned = true; break;
14405 case ISD::SETLT: Swap = true; //fall-through
14406 case ISD::SETGT: Opc = X86ISD::PCMPGTM; break;
14407 case ISD::SETULT: SSECC = 1; Unsigned = true; break;
14408 case ISD::SETUGE: SSECC = 5; Unsigned = true; break; //NLT
14409 case ISD::SETGE: Swap = true; SSECC = 2; break; // LE + swap
14410 case ISD::SETULE: Unsigned = true; //fall-through
14411 case ISD::SETLE: SSECC = 2; break;
14415 std::swap(Op0, Op1);
14417 return DAG.getNode(Opc, dl, VT, Op0, Op1);
14418 Opc = Unsigned ? X86ISD::CMPMU: X86ISD::CMPM;
14419 return DAG.getNode(Opc, dl, VT, Op0, Op1,
14420 DAG.getConstant(SSECC, MVT::i8));
14423 /// \brief Try to turn a VSETULT into a VSETULE by modifying its second
14424 /// operand \p Op1. If non-trivial (for example because it's not constant)
14425 /// return an empty value.
14426 static SDValue ChangeVSETULTtoVSETULE(SDLoc dl, SDValue Op1, SelectionDAG &DAG)
14428 BuildVectorSDNode *BV = dyn_cast<BuildVectorSDNode>(Op1.getNode());
14432 MVT VT = Op1.getSimpleValueType();
14433 MVT EVT = VT.getVectorElementType();
14434 unsigned n = VT.getVectorNumElements();
14435 SmallVector<SDValue, 8> ULTOp1;
14437 for (unsigned i = 0; i < n; ++i) {
14438 ConstantSDNode *Elt = dyn_cast<ConstantSDNode>(BV->getOperand(i));
14439 if (!Elt || Elt->isOpaque() || Elt->getValueType(0) != EVT)
14442 // Avoid underflow.
14443 APInt Val = Elt->getAPIntValue();
14447 ULTOp1.push_back(DAG.getConstant(Val - 1, EVT));
14450 return DAG.getNode(ISD::BUILD_VECTOR, dl, VT, ULTOp1);
14453 static SDValue LowerVSETCC(SDValue Op, const X86Subtarget *Subtarget,
14454 SelectionDAG &DAG) {
14455 SDValue Op0 = Op.getOperand(0);
14456 SDValue Op1 = Op.getOperand(1);
14457 SDValue CC = Op.getOperand(2);
14458 MVT VT = Op.getSimpleValueType();
14459 ISD::CondCode SetCCOpcode = cast<CondCodeSDNode>(CC)->get();
14460 bool isFP = Op.getOperand(1).getSimpleValueType().isFloatingPoint();
14465 MVT EltVT = Op0.getSimpleValueType().getVectorElementType();
14466 assert(EltVT == MVT::f32 || EltVT == MVT::f64);
14469 unsigned SSECC = translateX86FSETCC(SetCCOpcode, Op0, Op1);
14470 unsigned Opc = X86ISD::CMPP;
14471 if (Subtarget->hasAVX512() && VT.getVectorElementType() == MVT::i1) {
14472 assert(VT.getVectorNumElements() <= 16);
14473 Opc = X86ISD::CMPM;
14475 // In the two special cases we can't handle, emit two comparisons.
14478 unsigned CombineOpc;
14479 if (SetCCOpcode == ISD::SETUEQ) {
14480 CC0 = 3; CC1 = 0; CombineOpc = ISD::OR;
14482 assert(SetCCOpcode == ISD::SETONE);
14483 CC0 = 7; CC1 = 4; CombineOpc = ISD::AND;
14486 SDValue Cmp0 = DAG.getNode(Opc, dl, VT, Op0, Op1,
14487 DAG.getConstant(CC0, MVT::i8));
14488 SDValue Cmp1 = DAG.getNode(Opc, dl, VT, Op0, Op1,
14489 DAG.getConstant(CC1, MVT::i8));
14490 return DAG.getNode(CombineOpc, dl, VT, Cmp0, Cmp1);
14492 // Handle all other FP comparisons here.
14493 return DAG.getNode(Opc, dl, VT, Op0, Op1,
14494 DAG.getConstant(SSECC, MVT::i8));
14497 // Break 256-bit integer vector compare into smaller ones.
14498 if (VT.is256BitVector() && !Subtarget->hasInt256())
14499 return Lower256IntVSETCC(Op, DAG);
14501 bool MaskResult = (VT.getVectorElementType() == MVT::i1);
14502 EVT OpVT = Op1.getValueType();
14503 if (Subtarget->hasAVX512()) {
14504 if (Op1.getValueType().is512BitVector() ||
14505 (Subtarget->hasBWI() && Subtarget->hasVLX()) ||
14506 (MaskResult && OpVT.getVectorElementType().getSizeInBits() >= 32))
14507 return LowerIntVSETCC_AVX512(Op, DAG, Subtarget);
14509 // In AVX-512 architecture setcc returns mask with i1 elements,
14510 // But there is no compare instruction for i8 and i16 elements in KNL.
14511 // We are not talking about 512-bit operands in this case, these
14512 // types are illegal.
14514 (OpVT.getVectorElementType().getSizeInBits() < 32 &&
14515 OpVT.getVectorElementType().getSizeInBits() >= 8))
14516 return DAG.getNode(ISD::TRUNCATE, dl, VT,
14517 DAG.getNode(ISD::SETCC, dl, OpVT, Op0, Op1, CC));
14520 // We are handling one of the integer comparisons here. Since SSE only has
14521 // GT and EQ comparisons for integer, swapping operands and multiple
14522 // operations may be required for some comparisons.
14524 bool Swap = false, Invert = false, FlipSigns = false, MinMax = false;
14525 bool Subus = false;
14527 switch (SetCCOpcode) {
14528 default: llvm_unreachable("Unexpected SETCC condition");
14529 case ISD::SETNE: Invert = true;
14530 case ISD::SETEQ: Opc = X86ISD::PCMPEQ; break;
14531 case ISD::SETLT: Swap = true;
14532 case ISD::SETGT: Opc = X86ISD::PCMPGT; break;
14533 case ISD::SETGE: Swap = true;
14534 case ISD::SETLE: Opc = X86ISD::PCMPGT;
14535 Invert = true; break;
14536 case ISD::SETULT: Swap = true;
14537 case ISD::SETUGT: Opc = X86ISD::PCMPGT;
14538 FlipSigns = true; break;
14539 case ISD::SETUGE: Swap = true;
14540 case ISD::SETULE: Opc = X86ISD::PCMPGT;
14541 FlipSigns = true; Invert = true; break;
14544 // Special case: Use min/max operations for SETULE/SETUGE
14545 MVT VET = VT.getVectorElementType();
14547 (Subtarget->hasSSE41() && (VET >= MVT::i8 && VET <= MVT::i32))
14548 || (Subtarget->hasSSE2() && (VET == MVT::i8));
14551 switch (SetCCOpcode) {
14553 case ISD::SETULE: Opc = X86ISD::UMIN; MinMax = true; break;
14554 case ISD::SETUGE: Opc = X86ISD::UMAX; MinMax = true; break;
14557 if (MinMax) { Swap = false; Invert = false; FlipSigns = false; }
14560 bool hasSubus = Subtarget->hasSSE2() && (VET == MVT::i8 || VET == MVT::i16);
14561 if (!MinMax && hasSubus) {
14562 // As another special case, use PSUBUS[BW] when it's profitable. E.g. for
14564 // t = psubus Op0, Op1
14565 // pcmpeq t, <0..0>
14566 switch (SetCCOpcode) {
14568 case ISD::SETULT: {
14569 // If the comparison is against a constant we can turn this into a
14570 // setule. With psubus, setule does not require a swap. This is
14571 // beneficial because the constant in the register is no longer
14572 // destructed as the destination so it can be hoisted out of a loop.
14573 // Only do this pre-AVX since vpcmp* is no longer destructive.
14574 if (Subtarget->hasAVX())
14576 SDValue ULEOp1 = ChangeVSETULTtoVSETULE(dl, Op1, DAG);
14577 if (ULEOp1.getNode()) {
14579 Subus = true; Invert = false; Swap = false;
14583 // Psubus is better than flip-sign because it requires no inversion.
14584 case ISD::SETUGE: Subus = true; Invert = false; Swap = true; break;
14585 case ISD::SETULE: Subus = true; Invert = false; Swap = false; break;
14589 Opc = X86ISD::SUBUS;
14595 std::swap(Op0, Op1);
14597 // Check that the operation in question is available (most are plain SSE2,
14598 // but PCMPGTQ and PCMPEQQ have different requirements).
14599 if (VT == MVT::v2i64) {
14600 if (Opc == X86ISD::PCMPGT && !Subtarget->hasSSE42()) {
14601 assert(Subtarget->hasSSE2() && "Don't know how to lower!");
14603 // First cast everything to the right type.
14604 Op0 = DAG.getNode(ISD::BITCAST, dl, MVT::v4i32, Op0);
14605 Op1 = DAG.getNode(ISD::BITCAST, dl, MVT::v4i32, Op1);
14607 // Since SSE has no unsigned integer comparisons, we need to flip the sign
14608 // bits of the inputs before performing those operations. The lower
14609 // compare is always unsigned.
14612 SB = DAG.getConstant(0x80000000U, MVT::v4i32);
14614 SDValue Sign = DAG.getConstant(0x80000000U, MVT::i32);
14615 SDValue Zero = DAG.getConstant(0x00000000U, MVT::i32);
14616 SB = DAG.getNode(ISD::BUILD_VECTOR, dl, MVT::v4i32,
14617 Sign, Zero, Sign, Zero);
14619 Op0 = DAG.getNode(ISD::XOR, dl, MVT::v4i32, Op0, SB);
14620 Op1 = DAG.getNode(ISD::XOR, dl, MVT::v4i32, Op1, SB);
14622 // Emulate PCMPGTQ with (hi1 > hi2) | ((hi1 == hi2) & (lo1 > lo2))
14623 SDValue GT = DAG.getNode(X86ISD::PCMPGT, dl, MVT::v4i32, Op0, Op1);
14624 SDValue EQ = DAG.getNode(X86ISD::PCMPEQ, dl, MVT::v4i32, Op0, Op1);
14626 // Create masks for only the low parts/high parts of the 64 bit integers.
14627 static const int MaskHi[] = { 1, 1, 3, 3 };
14628 static const int MaskLo[] = { 0, 0, 2, 2 };
14629 SDValue EQHi = DAG.getVectorShuffle(MVT::v4i32, dl, EQ, EQ, MaskHi);
14630 SDValue GTLo = DAG.getVectorShuffle(MVT::v4i32, dl, GT, GT, MaskLo);
14631 SDValue GTHi = DAG.getVectorShuffle(MVT::v4i32, dl, GT, GT, MaskHi);
14633 SDValue Result = DAG.getNode(ISD::AND, dl, MVT::v4i32, EQHi, GTLo);
14634 Result = DAG.getNode(ISD::OR, dl, MVT::v4i32, Result, GTHi);
14637 Result = DAG.getNOT(dl, Result, MVT::v4i32);
14639 return DAG.getNode(ISD::BITCAST, dl, VT, Result);
14642 if (Opc == X86ISD::PCMPEQ && !Subtarget->hasSSE41()) {
14643 // If pcmpeqq is missing but pcmpeqd is available synthesize pcmpeqq with
14644 // pcmpeqd + pshufd + pand.
14645 assert(Subtarget->hasSSE2() && !FlipSigns && "Don't know how to lower!");
14647 // First cast everything to the right type.
14648 Op0 = DAG.getNode(ISD::BITCAST, dl, MVT::v4i32, Op0);
14649 Op1 = DAG.getNode(ISD::BITCAST, dl, MVT::v4i32, Op1);
14652 SDValue Result = DAG.getNode(Opc, dl, MVT::v4i32, Op0, Op1);
14654 // Make sure the lower and upper halves are both all-ones.
14655 static const int Mask[] = { 1, 0, 3, 2 };
14656 SDValue Shuf = DAG.getVectorShuffle(MVT::v4i32, dl, Result, Result, Mask);
14657 Result = DAG.getNode(ISD::AND, dl, MVT::v4i32, Result, Shuf);
14660 Result = DAG.getNOT(dl, Result, MVT::v4i32);
14662 return DAG.getNode(ISD::BITCAST, dl, VT, Result);
14666 // Since SSE has no unsigned integer comparisons, we need to flip the sign
14667 // bits of the inputs before performing those operations.
14669 EVT EltVT = VT.getVectorElementType();
14670 SDValue SB = DAG.getConstant(APInt::getSignBit(EltVT.getSizeInBits()), VT);
14671 Op0 = DAG.getNode(ISD::XOR, dl, VT, Op0, SB);
14672 Op1 = DAG.getNode(ISD::XOR, dl, VT, Op1, SB);
14675 SDValue Result = DAG.getNode(Opc, dl, VT, Op0, Op1);
14677 // If the logical-not of the result is required, perform that now.
14679 Result = DAG.getNOT(dl, Result, VT);
14682 Result = DAG.getNode(X86ISD::PCMPEQ, dl, VT, Op0, Result);
14685 Result = DAG.getNode(X86ISD::PCMPEQ, dl, VT, Result,
14686 getZeroVector(VT, Subtarget, DAG, dl));
14691 SDValue X86TargetLowering::LowerSETCC(SDValue Op, SelectionDAG &DAG) const {
14693 MVT VT = Op.getSimpleValueType();
14695 if (VT.isVector()) return LowerVSETCC(Op, Subtarget, DAG);
14697 assert(((!Subtarget->hasAVX512() && VT == MVT::i8) || (VT == MVT::i1))
14698 && "SetCC type must be 8-bit or 1-bit integer");
14699 SDValue Op0 = Op.getOperand(0);
14700 SDValue Op1 = Op.getOperand(1);
14702 ISD::CondCode CC = cast<CondCodeSDNode>(Op.getOperand(2))->get();
14704 // Optimize to BT if possible.
14705 // Lower (X & (1 << N)) == 0 to BT(X, N).
14706 // Lower ((X >>u N) & 1) != 0 to BT(X, N).
14707 // Lower ((X >>s N) & 1) != 0 to BT(X, N).
14708 if (Op0.getOpcode() == ISD::AND && Op0.hasOneUse() &&
14709 Op1.getOpcode() == ISD::Constant &&
14710 cast<ConstantSDNode>(Op1)->isNullValue() &&
14711 (CC == ISD::SETEQ || CC == ISD::SETNE)) {
14712 SDValue NewSetCC = LowerToBT(Op0, CC, dl, DAG);
14713 if (NewSetCC.getNode())
14717 // Look for X == 0, X == 1, X != 0, or X != 1. We can simplify some forms of
14719 if (Op1.getOpcode() == ISD::Constant &&
14720 (cast<ConstantSDNode>(Op1)->getZExtValue() == 1 ||
14721 cast<ConstantSDNode>(Op1)->isNullValue()) &&
14722 (CC == ISD::SETEQ || CC == ISD::SETNE)) {
14724 // If the input is a setcc, then reuse the input setcc or use a new one with
14725 // the inverted condition.
14726 if (Op0.getOpcode() == X86ISD::SETCC) {
14727 X86::CondCode CCode = (X86::CondCode)Op0.getConstantOperandVal(0);
14728 bool Invert = (CC == ISD::SETNE) ^
14729 cast<ConstantSDNode>(Op1)->isNullValue();
14733 CCode = X86::GetOppositeBranchCondition(CCode);
14734 SDValue SetCC = DAG.getNode(X86ISD::SETCC, dl, MVT::i8,
14735 DAG.getConstant(CCode, MVT::i8),
14736 Op0.getOperand(1));
14738 return DAG.getNode(ISD::TRUNCATE, dl, MVT::i1, SetCC);
14742 if ((Op0.getValueType() == MVT::i1) && (Op1.getOpcode() == ISD::Constant) &&
14743 (cast<ConstantSDNode>(Op1)->getZExtValue() == 1) &&
14744 (CC == ISD::SETEQ || CC == ISD::SETNE)) {
14746 ISD::CondCode NewCC = ISD::getSetCCInverse(CC, true);
14747 return DAG.getSetCC(dl, VT, Op0, DAG.getConstant(0, MVT::i1), NewCC);
14750 bool isFP = Op1.getSimpleValueType().isFloatingPoint();
14751 unsigned X86CC = TranslateX86CC(CC, isFP, Op0, Op1, DAG);
14752 if (X86CC == X86::COND_INVALID)
14755 SDValue EFLAGS = EmitCmp(Op0, Op1, X86CC, dl, DAG);
14756 EFLAGS = ConvertCmpIfNecessary(EFLAGS, DAG);
14757 SDValue SetCC = DAG.getNode(X86ISD::SETCC, dl, MVT::i8,
14758 DAG.getConstant(X86CC, MVT::i8), EFLAGS);
14760 return DAG.getNode(ISD::TRUNCATE, dl, MVT::i1, SetCC);
14764 // isX86LogicalCmp - Return true if opcode is a X86 logical comparison.
14765 static bool isX86LogicalCmp(SDValue Op) {
14766 unsigned Opc = Op.getNode()->getOpcode();
14767 if (Opc == X86ISD::CMP || Opc == X86ISD::COMI || Opc == X86ISD::UCOMI ||
14768 Opc == X86ISD::SAHF)
14770 if (Op.getResNo() == 1 &&
14771 (Opc == X86ISD::ADD ||
14772 Opc == X86ISD::SUB ||
14773 Opc == X86ISD::ADC ||
14774 Opc == X86ISD::SBB ||
14775 Opc == X86ISD::SMUL ||
14776 Opc == X86ISD::UMUL ||
14777 Opc == X86ISD::INC ||
14778 Opc == X86ISD::DEC ||
14779 Opc == X86ISD::OR ||
14780 Opc == X86ISD::XOR ||
14781 Opc == X86ISD::AND))
14784 if (Op.getResNo() == 2 && Opc == X86ISD::UMUL)
14790 static bool isTruncWithZeroHighBitsInput(SDValue V, SelectionDAG &DAG) {
14791 if (V.getOpcode() != ISD::TRUNCATE)
14794 SDValue VOp0 = V.getOperand(0);
14795 unsigned InBits = VOp0.getValueSizeInBits();
14796 unsigned Bits = V.getValueSizeInBits();
14797 return DAG.MaskedValueIsZero(VOp0, APInt::getHighBitsSet(InBits,InBits-Bits));
14800 SDValue X86TargetLowering::LowerSELECT(SDValue Op, SelectionDAG &DAG) const {
14801 bool addTest = true;
14802 SDValue Cond = Op.getOperand(0);
14803 SDValue Op1 = Op.getOperand(1);
14804 SDValue Op2 = Op.getOperand(2);
14806 EVT VT = Op1.getValueType();
14809 // Lower fp selects into a CMP/AND/ANDN/OR sequence when the necessary SSE ops
14810 // are available. Otherwise fp cmovs get lowered into a less efficient branch
14811 // sequence later on.
14812 if (Cond.getOpcode() == ISD::SETCC &&
14813 ((Subtarget->hasSSE2() && (VT == MVT::f32 || VT == MVT::f64)) ||
14814 (Subtarget->hasSSE1() && VT == MVT::f32)) &&
14815 VT == Cond.getOperand(0).getValueType() && Cond->hasOneUse()) {
14816 SDValue CondOp0 = Cond.getOperand(0), CondOp1 = Cond.getOperand(1);
14817 int SSECC = translateX86FSETCC(
14818 cast<CondCodeSDNode>(Cond.getOperand(2))->get(), CondOp0, CondOp1);
14821 if (Subtarget->hasAVX512()) {
14822 SDValue Cmp = DAG.getNode(X86ISD::FSETCC, DL, MVT::i1, CondOp0, CondOp1,
14823 DAG.getConstant(SSECC, MVT::i8));
14824 return DAG.getNode(X86ISD::SELECT, DL, VT, Cmp, Op1, Op2);
14826 SDValue Cmp = DAG.getNode(X86ISD::FSETCC, DL, VT, CondOp0, CondOp1,
14827 DAG.getConstant(SSECC, MVT::i8));
14828 SDValue AndN = DAG.getNode(X86ISD::FANDN, DL, VT, Cmp, Op2);
14829 SDValue And = DAG.getNode(X86ISD::FAND, DL, VT, Cmp, Op1);
14830 return DAG.getNode(X86ISD::FOR, DL, VT, AndN, And);
14834 if (Cond.getOpcode() == ISD::SETCC) {
14835 SDValue NewCond = LowerSETCC(Cond, DAG);
14836 if (NewCond.getNode())
14840 // (select (x == 0), -1, y) -> (sign_bit (x - 1)) | y
14841 // (select (x == 0), y, -1) -> ~(sign_bit (x - 1)) | y
14842 // (select (x != 0), y, -1) -> (sign_bit (x - 1)) | y
14843 // (select (x != 0), -1, y) -> ~(sign_bit (x - 1)) | y
14844 if (Cond.getOpcode() == X86ISD::SETCC &&
14845 Cond.getOperand(1).getOpcode() == X86ISD::CMP &&
14846 isZero(Cond.getOperand(1).getOperand(1))) {
14847 SDValue Cmp = Cond.getOperand(1);
14849 unsigned CondCode =cast<ConstantSDNode>(Cond.getOperand(0))->getZExtValue();
14851 if ((isAllOnes(Op1) || isAllOnes(Op2)) &&
14852 (CondCode == X86::COND_E || CondCode == X86::COND_NE)) {
14853 SDValue Y = isAllOnes(Op2) ? Op1 : Op2;
14855 SDValue CmpOp0 = Cmp.getOperand(0);
14856 // Apply further optimizations for special cases
14857 // (select (x != 0), -1, 0) -> neg & sbb
14858 // (select (x == 0), 0, -1) -> neg & sbb
14859 if (ConstantSDNode *YC = dyn_cast<ConstantSDNode>(Y))
14860 if (YC->isNullValue() &&
14861 (isAllOnes(Op1) == (CondCode == X86::COND_NE))) {
14862 SDVTList VTs = DAG.getVTList(CmpOp0.getValueType(), MVT::i32);
14863 SDValue Neg = DAG.getNode(X86ISD::SUB, DL, VTs,
14864 DAG.getConstant(0, CmpOp0.getValueType()),
14866 SDValue Res = DAG.getNode(X86ISD::SETCC_CARRY, DL, Op.getValueType(),
14867 DAG.getConstant(X86::COND_B, MVT::i8),
14868 SDValue(Neg.getNode(), 1));
14872 Cmp = DAG.getNode(X86ISD::CMP, DL, MVT::i32,
14873 CmpOp0, DAG.getConstant(1, CmpOp0.getValueType()));
14874 Cmp = ConvertCmpIfNecessary(Cmp, DAG);
14876 SDValue Res = // Res = 0 or -1.
14877 DAG.getNode(X86ISD::SETCC_CARRY, DL, Op.getValueType(),
14878 DAG.getConstant(X86::COND_B, MVT::i8), Cmp);
14880 if (isAllOnes(Op1) != (CondCode == X86::COND_E))
14881 Res = DAG.getNOT(DL, Res, Res.getValueType());
14883 ConstantSDNode *N2C = dyn_cast<ConstantSDNode>(Op2);
14884 if (!N2C || !N2C->isNullValue())
14885 Res = DAG.getNode(ISD::OR, DL, Res.getValueType(), Res, Y);
14890 // Look past (and (setcc_carry (cmp ...)), 1).
14891 if (Cond.getOpcode() == ISD::AND &&
14892 Cond.getOperand(0).getOpcode() == X86ISD::SETCC_CARRY) {
14893 ConstantSDNode *C = dyn_cast<ConstantSDNode>(Cond.getOperand(1));
14894 if (C && C->getAPIntValue() == 1)
14895 Cond = Cond.getOperand(0);
14898 // If condition flag is set by a X86ISD::CMP, then use it as the condition
14899 // setting operand in place of the X86ISD::SETCC.
14900 unsigned CondOpcode = Cond.getOpcode();
14901 if (CondOpcode == X86ISD::SETCC ||
14902 CondOpcode == X86ISD::SETCC_CARRY) {
14903 CC = Cond.getOperand(0);
14905 SDValue Cmp = Cond.getOperand(1);
14906 unsigned Opc = Cmp.getOpcode();
14907 MVT VT = Op.getSimpleValueType();
14909 bool IllegalFPCMov = false;
14910 if (VT.isFloatingPoint() && !VT.isVector() &&
14911 !isScalarFPTypeInSSEReg(VT)) // FPStack?
14912 IllegalFPCMov = !hasFPCMov(cast<ConstantSDNode>(CC)->getSExtValue());
14914 if ((isX86LogicalCmp(Cmp) && !IllegalFPCMov) ||
14915 Opc == X86ISD::BT) { // FIXME
14919 } else if (CondOpcode == ISD::USUBO || CondOpcode == ISD::SSUBO ||
14920 CondOpcode == ISD::UADDO || CondOpcode == ISD::SADDO ||
14921 ((CondOpcode == ISD::UMULO || CondOpcode == ISD::SMULO) &&
14922 Cond.getOperand(0).getValueType() != MVT::i8)) {
14923 SDValue LHS = Cond.getOperand(0);
14924 SDValue RHS = Cond.getOperand(1);
14925 unsigned X86Opcode;
14928 switch (CondOpcode) {
14929 case ISD::UADDO: X86Opcode = X86ISD::ADD; X86Cond = X86::COND_B; break;
14930 case ISD::SADDO: X86Opcode = X86ISD::ADD; X86Cond = X86::COND_O; break;
14931 case ISD::USUBO: X86Opcode = X86ISD::SUB; X86Cond = X86::COND_B; break;
14932 case ISD::SSUBO: X86Opcode = X86ISD::SUB; X86Cond = X86::COND_O; break;
14933 case ISD::UMULO: X86Opcode = X86ISD::UMUL; X86Cond = X86::COND_O; break;
14934 case ISD::SMULO: X86Opcode = X86ISD::SMUL; X86Cond = X86::COND_O; break;
14935 default: llvm_unreachable("unexpected overflowing operator");
14937 if (CondOpcode == ISD::UMULO)
14938 VTs = DAG.getVTList(LHS.getValueType(), LHS.getValueType(),
14941 VTs = DAG.getVTList(LHS.getValueType(), MVT::i32);
14943 SDValue X86Op = DAG.getNode(X86Opcode, DL, VTs, LHS, RHS);
14945 if (CondOpcode == ISD::UMULO)
14946 Cond = X86Op.getValue(2);
14948 Cond = X86Op.getValue(1);
14950 CC = DAG.getConstant(X86Cond, MVT::i8);
14955 // Look pass the truncate if the high bits are known zero.
14956 if (isTruncWithZeroHighBitsInput(Cond, DAG))
14957 Cond = Cond.getOperand(0);
14959 // We know the result of AND is compared against zero. Try to match
14961 if (Cond.getOpcode() == ISD::AND && Cond.hasOneUse()) {
14962 SDValue NewSetCC = LowerToBT(Cond, ISD::SETNE, DL, DAG);
14963 if (NewSetCC.getNode()) {
14964 CC = NewSetCC.getOperand(0);
14965 Cond = NewSetCC.getOperand(1);
14972 CC = DAG.getConstant(X86::COND_NE, MVT::i8);
14973 Cond = EmitTest(Cond, X86::COND_NE, DL, DAG);
14976 // a < b ? -1 : 0 -> RES = ~setcc_carry
14977 // a < b ? 0 : -1 -> RES = setcc_carry
14978 // a >= b ? -1 : 0 -> RES = setcc_carry
14979 // a >= b ? 0 : -1 -> RES = ~setcc_carry
14980 if (Cond.getOpcode() == X86ISD::SUB) {
14981 Cond = ConvertCmpIfNecessary(Cond, DAG);
14982 unsigned CondCode = cast<ConstantSDNode>(CC)->getZExtValue();
14984 if ((CondCode == X86::COND_AE || CondCode == X86::COND_B) &&
14985 (isAllOnes(Op1) || isAllOnes(Op2)) && (isZero(Op1) || isZero(Op2))) {
14986 SDValue Res = DAG.getNode(X86ISD::SETCC_CARRY, DL, Op.getValueType(),
14987 DAG.getConstant(X86::COND_B, MVT::i8), Cond);
14988 if (isAllOnes(Op1) != (CondCode == X86::COND_B))
14989 return DAG.getNOT(DL, Res, Res.getValueType());
14994 // X86 doesn't have an i8 cmov. If both operands are the result of a truncate
14995 // widen the cmov and push the truncate through. This avoids introducing a new
14996 // branch during isel and doesn't add any extensions.
14997 if (Op.getValueType() == MVT::i8 &&
14998 Op1.getOpcode() == ISD::TRUNCATE && Op2.getOpcode() == ISD::TRUNCATE) {
14999 SDValue T1 = Op1.getOperand(0), T2 = Op2.getOperand(0);
15000 if (T1.getValueType() == T2.getValueType() &&
15001 // Blacklist CopyFromReg to avoid partial register stalls.
15002 T1.getOpcode() != ISD::CopyFromReg && T2.getOpcode()!=ISD::CopyFromReg){
15003 SDVTList VTs = DAG.getVTList(T1.getValueType(), MVT::Glue);
15004 SDValue Cmov = DAG.getNode(X86ISD::CMOV, DL, VTs, T2, T1, CC, Cond);
15005 return DAG.getNode(ISD::TRUNCATE, DL, Op.getValueType(), Cmov);
15009 // X86ISD::CMOV means set the result (which is operand 1) to the RHS if
15010 // condition is true.
15011 SDVTList VTs = DAG.getVTList(Op.getValueType(), MVT::Glue);
15012 SDValue Ops[] = { Op2, Op1, CC, Cond };
15013 return DAG.getNode(X86ISD::CMOV, DL, VTs, Ops);
15016 static SDValue LowerSIGN_EXTEND_AVX512(SDValue Op, SelectionDAG &DAG) {
15017 MVT VT = Op->getSimpleValueType(0);
15018 SDValue In = Op->getOperand(0);
15019 MVT InVT = In.getSimpleValueType();
15022 unsigned int NumElts = VT.getVectorNumElements();
15023 if (NumElts != 8 && NumElts != 16)
15026 if (VT.is512BitVector() && InVT.getVectorElementType() != MVT::i1)
15027 return DAG.getNode(X86ISD::VSEXT, dl, VT, In);
15029 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
15030 assert (InVT.getVectorElementType() == MVT::i1 && "Unexpected vector type");
15032 MVT ExtVT = (NumElts == 8) ? MVT::v8i64 : MVT::v16i32;
15033 Constant *C = ConstantInt::get(*DAG.getContext(),
15034 APInt::getAllOnesValue(ExtVT.getScalarType().getSizeInBits()));
15036 SDValue CP = DAG.getConstantPool(C, TLI.getPointerTy());
15037 unsigned Alignment = cast<ConstantPoolSDNode>(CP)->getAlignment();
15038 SDValue Ld = DAG.getLoad(ExtVT.getScalarType(), dl, DAG.getEntryNode(), CP,
15039 MachinePointerInfo::getConstantPool(),
15040 false, false, false, Alignment);
15041 SDValue Brcst = DAG.getNode(X86ISD::VBROADCASTM, dl, ExtVT, In, Ld);
15042 if (VT.is512BitVector())
15044 return DAG.getNode(X86ISD::VTRUNC, dl, VT, Brcst);
15047 static SDValue LowerSIGN_EXTEND(SDValue Op, const X86Subtarget *Subtarget,
15048 SelectionDAG &DAG) {
15049 MVT VT = Op->getSimpleValueType(0);
15050 SDValue In = Op->getOperand(0);
15051 MVT InVT = In.getSimpleValueType();
15054 if (VT.is512BitVector() || InVT.getVectorElementType() == MVT::i1)
15055 return LowerSIGN_EXTEND_AVX512(Op, DAG);
15057 if ((VT != MVT::v4i64 || InVT != MVT::v4i32) &&
15058 (VT != MVT::v8i32 || InVT != MVT::v8i16) &&
15059 (VT != MVT::v16i16 || InVT != MVT::v16i8))
15062 if (Subtarget->hasInt256())
15063 return DAG.getNode(X86ISD::VSEXT, dl, VT, In);
15065 // Optimize vectors in AVX mode
15066 // Sign extend v8i16 to v8i32 and
15069 // Divide input vector into two parts
15070 // for v4i32 the shuffle mask will be { 0, 1, -1, -1} {2, 3, -1, -1}
15071 // use vpmovsx instruction to extend v4i32 -> v2i64; v8i16 -> v4i32
15072 // concat the vectors to original VT
15074 unsigned NumElems = InVT.getVectorNumElements();
15075 SDValue Undef = DAG.getUNDEF(InVT);
15077 SmallVector<int,8> ShufMask1(NumElems, -1);
15078 for (unsigned i = 0; i != NumElems/2; ++i)
15081 SDValue OpLo = DAG.getVectorShuffle(InVT, dl, In, Undef, &ShufMask1[0]);
15083 SmallVector<int,8> ShufMask2(NumElems, -1);
15084 for (unsigned i = 0; i != NumElems/2; ++i)
15085 ShufMask2[i] = i + NumElems/2;
15087 SDValue OpHi = DAG.getVectorShuffle(InVT, dl, In, Undef, &ShufMask2[0]);
15089 MVT HalfVT = MVT::getVectorVT(VT.getScalarType(),
15090 VT.getVectorNumElements()/2);
15092 OpLo = DAG.getNode(X86ISD::VSEXT, dl, HalfVT, OpLo);
15093 OpHi = DAG.getNode(X86ISD::VSEXT, dl, HalfVT, OpHi);
15095 return DAG.getNode(ISD::CONCAT_VECTORS, dl, VT, OpLo, OpHi);
15098 // Lower vector extended loads using a shuffle. If SSSE3 is not available we
15099 // may emit an illegal shuffle but the expansion is still better than scalar
15100 // code. We generate X86ISD::VSEXT for SEXTLOADs if it's available, otherwise
15101 // we'll emit a shuffle and a arithmetic shift.
15102 // TODO: It is possible to support ZExt by zeroing the undef values during
15103 // the shuffle phase or after the shuffle.
15104 static SDValue LowerExtendedLoad(SDValue Op, const X86Subtarget *Subtarget,
15105 SelectionDAG &DAG) {
15106 MVT RegVT = Op.getSimpleValueType();
15107 assert(RegVT.isVector() && "We only custom lower vector sext loads.");
15108 assert(RegVT.isInteger() &&
15109 "We only custom lower integer vector sext loads.");
15111 // Nothing useful we can do without SSE2 shuffles.
15112 assert(Subtarget->hasSSE2() && "We only custom lower sext loads with SSE2.");
15114 LoadSDNode *Ld = cast<LoadSDNode>(Op.getNode());
15116 EVT MemVT = Ld->getMemoryVT();
15117 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
15118 unsigned RegSz = RegVT.getSizeInBits();
15120 ISD::LoadExtType Ext = Ld->getExtensionType();
15122 assert((Ext == ISD::EXTLOAD || Ext == ISD::SEXTLOAD)
15123 && "Only anyext and sext are currently implemented.");
15124 assert(MemVT != RegVT && "Cannot extend to the same type");
15125 assert(MemVT.isVector() && "Must load a vector from memory");
15127 unsigned NumElems = RegVT.getVectorNumElements();
15128 unsigned MemSz = MemVT.getSizeInBits();
15129 assert(RegSz > MemSz && "Register size must be greater than the mem size");
15131 if (Ext == ISD::SEXTLOAD && RegSz == 256 && !Subtarget->hasInt256()) {
15132 // The only way in which we have a legal 256-bit vector result but not the
15133 // integer 256-bit operations needed to directly lower a sextload is if we
15134 // have AVX1 but not AVX2. In that case, we can always emit a sextload to
15135 // a 128-bit vector and a normal sign_extend to 256-bits that should get
15136 // correctly legalized. We do this late to allow the canonical form of
15137 // sextload to persist throughout the rest of the DAG combiner -- it wants
15138 // to fold together any extensions it can, and so will fuse a sign_extend
15139 // of an sextload into a sextload targeting a wider value.
15141 if (MemSz == 128) {
15142 // Just switch this to a normal load.
15143 assert(TLI.isTypeLegal(MemVT) && "If the memory type is a 128-bit type, "
15144 "it must be a legal 128-bit vector "
15146 Load = DAG.getLoad(MemVT, dl, Ld->getChain(), Ld->getBasePtr(),
15147 Ld->getPointerInfo(), Ld->isVolatile(), Ld->isNonTemporal(),
15148 Ld->isInvariant(), Ld->getAlignment());
15150 assert(MemSz < 128 &&
15151 "Can't extend a type wider than 128 bits to a 256 bit vector!");
15152 // Do an sext load to a 128-bit vector type. We want to use the same
15153 // number of elements, but elements half as wide. This will end up being
15154 // recursively lowered by this routine, but will succeed as we definitely
15155 // have all the necessary features if we're using AVX1.
15157 EVT::getIntegerVT(*DAG.getContext(), RegVT.getScalarSizeInBits() / 2);
15158 EVT HalfVecVT = EVT::getVectorVT(*DAG.getContext(), HalfEltVT, NumElems);
15160 DAG.getExtLoad(Ext, dl, HalfVecVT, Ld->getChain(), Ld->getBasePtr(),
15161 Ld->getPointerInfo(), MemVT, Ld->isVolatile(),
15162 Ld->isNonTemporal(), Ld->isInvariant(),
15163 Ld->getAlignment());
15166 // Replace chain users with the new chain.
15167 assert(Load->getNumValues() == 2 && "Loads must carry a chain!");
15168 DAG.ReplaceAllUsesOfValueWith(SDValue(Ld, 1), Load.getValue(1));
15170 // Finally, do a normal sign-extend to the desired register.
15171 return DAG.getSExtOrTrunc(Load, dl, RegVT);
15174 // All sizes must be a power of two.
15175 assert(isPowerOf2_32(RegSz * MemSz * NumElems) &&
15176 "Non-power-of-two elements are not custom lowered!");
15178 // Attempt to load the original value using scalar loads.
15179 // Find the largest scalar type that divides the total loaded size.
15180 MVT SclrLoadTy = MVT::i8;
15181 for (unsigned tp = MVT::FIRST_INTEGER_VALUETYPE;
15182 tp < MVT::LAST_INTEGER_VALUETYPE; ++tp) {
15183 MVT Tp = (MVT::SimpleValueType)tp;
15184 if (TLI.isTypeLegal(Tp) && ((MemSz % Tp.getSizeInBits()) == 0)) {
15189 // On 32bit systems, we can't save 64bit integers. Try bitcasting to F64.
15190 if (TLI.isTypeLegal(MVT::f64) && SclrLoadTy.getSizeInBits() < 64 &&
15192 SclrLoadTy = MVT::f64;
15194 // Calculate the number of scalar loads that we need to perform
15195 // in order to load our vector from memory.
15196 unsigned NumLoads = MemSz / SclrLoadTy.getSizeInBits();
15198 assert((Ext != ISD::SEXTLOAD || NumLoads == 1) &&
15199 "Can only lower sext loads with a single scalar load!");
15201 unsigned loadRegZize = RegSz;
15202 if (Ext == ISD::SEXTLOAD && RegSz == 256)
15205 // Represent our vector as a sequence of elements which are the
15206 // largest scalar that we can load.
15207 EVT LoadUnitVecVT = EVT::getVectorVT(
15208 *DAG.getContext(), SclrLoadTy, loadRegZize / SclrLoadTy.getSizeInBits());
15210 // Represent the data using the same element type that is stored in
15211 // memory. In practice, we ''widen'' MemVT.
15213 EVT::getVectorVT(*DAG.getContext(), MemVT.getScalarType(),
15214 loadRegZize / MemVT.getScalarType().getSizeInBits());
15216 assert(WideVecVT.getSizeInBits() == LoadUnitVecVT.getSizeInBits() &&
15217 "Invalid vector type");
15219 // We can't shuffle using an illegal type.
15220 assert(TLI.isTypeLegal(WideVecVT) &&
15221 "We only lower types that form legal widened vector types");
15223 SmallVector<SDValue, 8> Chains;
15224 SDValue Ptr = Ld->getBasePtr();
15225 SDValue Increment =
15226 DAG.getConstant(SclrLoadTy.getSizeInBits() / 8, TLI.getPointerTy());
15227 SDValue Res = DAG.getUNDEF(LoadUnitVecVT);
15229 for (unsigned i = 0; i < NumLoads; ++i) {
15230 // Perform a single load.
15231 SDValue ScalarLoad =
15232 DAG.getLoad(SclrLoadTy, dl, Ld->getChain(), Ptr, Ld->getPointerInfo(),
15233 Ld->isVolatile(), Ld->isNonTemporal(), Ld->isInvariant(),
15234 Ld->getAlignment());
15235 Chains.push_back(ScalarLoad.getValue(1));
15236 // Create the first element type using SCALAR_TO_VECTOR in order to avoid
15237 // another round of DAGCombining.
15239 Res = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, LoadUnitVecVT, ScalarLoad);
15241 Res = DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, LoadUnitVecVT, Res,
15242 ScalarLoad, DAG.getIntPtrConstant(i));
15244 Ptr = DAG.getNode(ISD::ADD, dl, Ptr.getValueType(), Ptr, Increment);
15247 SDValue TF = DAG.getNode(ISD::TokenFactor, dl, MVT::Other, Chains);
15249 // Bitcast the loaded value to a vector of the original element type, in
15250 // the size of the target vector type.
15251 SDValue SlicedVec = DAG.getNode(ISD::BITCAST, dl, WideVecVT, Res);
15252 unsigned SizeRatio = RegSz / MemSz;
15254 if (Ext == ISD::SEXTLOAD) {
15255 // If we have SSE4.1, we can directly emit a VSEXT node.
15256 if (Subtarget->hasSSE41()) {
15257 SDValue Sext = DAG.getNode(X86ISD::VSEXT, dl, RegVT, SlicedVec);
15258 DAG.ReplaceAllUsesOfValueWith(SDValue(Ld, 1), TF);
15262 // Otherwise we'll shuffle the small elements in the high bits of the
15263 // larger type and perform an arithmetic shift. If the shift is not legal
15264 // it's better to scalarize.
15265 assert(TLI.isOperationLegalOrCustom(ISD::SRA, RegVT) &&
15266 "We can't implement a sext load without an arithmetic right shift!");
15268 // Redistribute the loaded elements into the different locations.
15269 SmallVector<int, 16> ShuffleVec(NumElems * SizeRatio, -1);
15270 for (unsigned i = 0; i != NumElems; ++i)
15271 ShuffleVec[i * SizeRatio + SizeRatio - 1] = i;
15273 SDValue Shuff = DAG.getVectorShuffle(
15274 WideVecVT, dl, SlicedVec, DAG.getUNDEF(WideVecVT), &ShuffleVec[0]);
15276 Shuff = DAG.getNode(ISD::BITCAST, dl, RegVT, Shuff);
15278 // Build the arithmetic shift.
15279 unsigned Amt = RegVT.getVectorElementType().getSizeInBits() -
15280 MemVT.getVectorElementType().getSizeInBits();
15282 DAG.getNode(ISD::SRA, dl, RegVT, Shuff, DAG.getConstant(Amt, RegVT));
15284 DAG.ReplaceAllUsesOfValueWith(SDValue(Ld, 1), TF);
15288 // Redistribute the loaded elements into the different locations.
15289 SmallVector<int, 16> ShuffleVec(NumElems * SizeRatio, -1);
15290 for (unsigned i = 0; i != NumElems; ++i)
15291 ShuffleVec[i * SizeRatio] = i;
15293 SDValue Shuff = DAG.getVectorShuffle(WideVecVT, dl, SlicedVec,
15294 DAG.getUNDEF(WideVecVT), &ShuffleVec[0]);
15296 // Bitcast to the requested type.
15297 Shuff = DAG.getNode(ISD::BITCAST, dl, RegVT, Shuff);
15298 DAG.ReplaceAllUsesOfValueWith(SDValue(Ld, 1), TF);
15302 // isAndOrOfSingleUseSetCCs - Return true if node is an ISD::AND or
15303 // ISD::OR of two X86ISD::SETCC nodes each of which has no other use apart
15304 // from the AND / OR.
15305 static bool isAndOrOfSetCCs(SDValue Op, unsigned &Opc) {
15306 Opc = Op.getOpcode();
15307 if (Opc != ISD::OR && Opc != ISD::AND)
15309 return (Op.getOperand(0).getOpcode() == X86ISD::SETCC &&
15310 Op.getOperand(0).hasOneUse() &&
15311 Op.getOperand(1).getOpcode() == X86ISD::SETCC &&
15312 Op.getOperand(1).hasOneUse());
15315 // isXor1OfSetCC - Return true if node is an ISD::XOR of a X86ISD::SETCC and
15316 // 1 and that the SETCC node has a single use.
15317 static bool isXor1OfSetCC(SDValue Op) {
15318 if (Op.getOpcode() != ISD::XOR)
15320 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(Op.getOperand(1));
15321 if (N1C && N1C->getAPIntValue() == 1) {
15322 return Op.getOperand(0).getOpcode() == X86ISD::SETCC &&
15323 Op.getOperand(0).hasOneUse();
15328 SDValue X86TargetLowering::LowerBRCOND(SDValue Op, SelectionDAG &DAG) const {
15329 bool addTest = true;
15330 SDValue Chain = Op.getOperand(0);
15331 SDValue Cond = Op.getOperand(1);
15332 SDValue Dest = Op.getOperand(2);
15335 bool Inverted = false;
15337 if (Cond.getOpcode() == ISD::SETCC) {
15338 // Check for setcc([su]{add,sub,mul}o == 0).
15339 if (cast<CondCodeSDNode>(Cond.getOperand(2))->get() == ISD::SETEQ &&
15340 isa<ConstantSDNode>(Cond.getOperand(1)) &&
15341 cast<ConstantSDNode>(Cond.getOperand(1))->isNullValue() &&
15342 Cond.getOperand(0).getResNo() == 1 &&
15343 (Cond.getOperand(0).getOpcode() == ISD::SADDO ||
15344 Cond.getOperand(0).getOpcode() == ISD::UADDO ||
15345 Cond.getOperand(0).getOpcode() == ISD::SSUBO ||
15346 Cond.getOperand(0).getOpcode() == ISD::USUBO ||
15347 Cond.getOperand(0).getOpcode() == ISD::SMULO ||
15348 Cond.getOperand(0).getOpcode() == ISD::UMULO)) {
15350 Cond = Cond.getOperand(0);
15352 SDValue NewCond = LowerSETCC(Cond, DAG);
15353 if (NewCond.getNode())
15358 // FIXME: LowerXALUO doesn't handle these!!
15359 else if (Cond.getOpcode() == X86ISD::ADD ||
15360 Cond.getOpcode() == X86ISD::SUB ||
15361 Cond.getOpcode() == X86ISD::SMUL ||
15362 Cond.getOpcode() == X86ISD::UMUL)
15363 Cond = LowerXALUO(Cond, DAG);
15366 // Look pass (and (setcc_carry (cmp ...)), 1).
15367 if (Cond.getOpcode() == ISD::AND &&
15368 Cond.getOperand(0).getOpcode() == X86ISD::SETCC_CARRY) {
15369 ConstantSDNode *C = dyn_cast<ConstantSDNode>(Cond.getOperand(1));
15370 if (C && C->getAPIntValue() == 1)
15371 Cond = Cond.getOperand(0);
15374 // If condition flag is set by a X86ISD::CMP, then use it as the condition
15375 // setting operand in place of the X86ISD::SETCC.
15376 unsigned CondOpcode = Cond.getOpcode();
15377 if (CondOpcode == X86ISD::SETCC ||
15378 CondOpcode == X86ISD::SETCC_CARRY) {
15379 CC = Cond.getOperand(0);
15381 SDValue Cmp = Cond.getOperand(1);
15382 unsigned Opc = Cmp.getOpcode();
15383 // FIXME: WHY THE SPECIAL CASING OF LogicalCmp??
15384 if (isX86LogicalCmp(Cmp) || Opc == X86ISD::BT) {
15388 switch (cast<ConstantSDNode>(CC)->getZExtValue()) {
15392 // These can only come from an arithmetic instruction with overflow,
15393 // e.g. SADDO, UADDO.
15394 Cond = Cond.getNode()->getOperand(1);
15400 CondOpcode = Cond.getOpcode();
15401 if (CondOpcode == ISD::UADDO || CondOpcode == ISD::SADDO ||
15402 CondOpcode == ISD::USUBO || CondOpcode == ISD::SSUBO ||
15403 ((CondOpcode == ISD::UMULO || CondOpcode == ISD::SMULO) &&
15404 Cond.getOperand(0).getValueType() != MVT::i8)) {
15405 SDValue LHS = Cond.getOperand(0);
15406 SDValue RHS = Cond.getOperand(1);
15407 unsigned X86Opcode;
15410 // Keep this in sync with LowerXALUO, otherwise we might create redundant
15411 // instructions that can't be removed afterwards (i.e. X86ISD::ADD and
15413 switch (CondOpcode) {
15414 case ISD::UADDO: X86Opcode = X86ISD::ADD; X86Cond = X86::COND_B; break;
15416 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(RHS))
15418 X86Opcode = X86ISD::INC; X86Cond = X86::COND_O;
15421 X86Opcode = X86ISD::ADD; X86Cond = X86::COND_O; break;
15422 case ISD::USUBO: X86Opcode = X86ISD::SUB; X86Cond = X86::COND_B; break;
15424 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(RHS))
15426 X86Opcode = X86ISD::DEC; X86Cond = X86::COND_O;
15429 X86Opcode = X86ISD::SUB; X86Cond = X86::COND_O; break;
15430 case ISD::UMULO: X86Opcode = X86ISD::UMUL; X86Cond = X86::COND_O; break;
15431 case ISD::SMULO: X86Opcode = X86ISD::SMUL; X86Cond = X86::COND_O; break;
15432 default: llvm_unreachable("unexpected overflowing operator");
15435 X86Cond = X86::GetOppositeBranchCondition((X86::CondCode)X86Cond);
15436 if (CondOpcode == ISD::UMULO)
15437 VTs = DAG.getVTList(LHS.getValueType(), LHS.getValueType(),
15440 VTs = DAG.getVTList(LHS.getValueType(), MVT::i32);
15442 SDValue X86Op = DAG.getNode(X86Opcode, dl, VTs, LHS, RHS);
15444 if (CondOpcode == ISD::UMULO)
15445 Cond = X86Op.getValue(2);
15447 Cond = X86Op.getValue(1);
15449 CC = DAG.getConstant(X86Cond, MVT::i8);
15453 if (Cond.hasOneUse() && isAndOrOfSetCCs(Cond, CondOpc)) {
15454 SDValue Cmp = Cond.getOperand(0).getOperand(1);
15455 if (CondOpc == ISD::OR) {
15456 // Also, recognize the pattern generated by an FCMP_UNE. We can emit
15457 // two branches instead of an explicit OR instruction with a
15459 if (Cmp == Cond.getOperand(1).getOperand(1) &&
15460 isX86LogicalCmp(Cmp)) {
15461 CC = Cond.getOperand(0).getOperand(0);
15462 Chain = DAG.getNode(X86ISD::BRCOND, dl, Op.getValueType(),
15463 Chain, Dest, CC, Cmp);
15464 CC = Cond.getOperand(1).getOperand(0);
15468 } else { // ISD::AND
15469 // Also, recognize the pattern generated by an FCMP_OEQ. We can emit
15470 // two branches instead of an explicit AND instruction with a
15471 // separate test. However, we only do this if this block doesn't
15472 // have a fall-through edge, because this requires an explicit
15473 // jmp when the condition is false.
15474 if (Cmp == Cond.getOperand(1).getOperand(1) &&
15475 isX86LogicalCmp(Cmp) &&
15476 Op.getNode()->hasOneUse()) {
15477 X86::CondCode CCode =
15478 (X86::CondCode)Cond.getOperand(0).getConstantOperandVal(0);
15479 CCode = X86::GetOppositeBranchCondition(CCode);
15480 CC = DAG.getConstant(CCode, MVT::i8);
15481 SDNode *User = *Op.getNode()->use_begin();
15482 // Look for an unconditional branch following this conditional branch.
15483 // We need this because we need to reverse the successors in order
15484 // to implement FCMP_OEQ.
15485 if (User->getOpcode() == ISD::BR) {
15486 SDValue FalseBB = User->getOperand(1);
15488 DAG.UpdateNodeOperands(User, User->getOperand(0), Dest);
15489 assert(NewBR == User);
15493 Chain = DAG.getNode(X86ISD::BRCOND, dl, Op.getValueType(),
15494 Chain, Dest, CC, Cmp);
15495 X86::CondCode CCode =
15496 (X86::CondCode)Cond.getOperand(1).getConstantOperandVal(0);
15497 CCode = X86::GetOppositeBranchCondition(CCode);
15498 CC = DAG.getConstant(CCode, MVT::i8);
15504 } else if (Cond.hasOneUse() && isXor1OfSetCC(Cond)) {
15505 // Recognize for xorb (setcc), 1 patterns. The xor inverts the condition.
15506 // It should be transformed during dag combiner except when the condition
15507 // is set by a arithmetics with overflow node.
15508 X86::CondCode CCode =
15509 (X86::CondCode)Cond.getOperand(0).getConstantOperandVal(0);
15510 CCode = X86::GetOppositeBranchCondition(CCode);
15511 CC = DAG.getConstant(CCode, MVT::i8);
15512 Cond = Cond.getOperand(0).getOperand(1);
15514 } else if (Cond.getOpcode() == ISD::SETCC &&
15515 cast<CondCodeSDNode>(Cond.getOperand(2))->get() == ISD::SETOEQ) {
15516 // For FCMP_OEQ, we can emit
15517 // two branches instead of an explicit AND instruction with a
15518 // separate test. However, we only do this if this block doesn't
15519 // have a fall-through edge, because this requires an explicit
15520 // jmp when the condition is false.
15521 if (Op.getNode()->hasOneUse()) {
15522 SDNode *User = *Op.getNode()->use_begin();
15523 // Look for an unconditional branch following this conditional branch.
15524 // We need this because we need to reverse the successors in order
15525 // to implement FCMP_OEQ.
15526 if (User->getOpcode() == ISD::BR) {
15527 SDValue FalseBB = User->getOperand(1);
15529 DAG.UpdateNodeOperands(User, User->getOperand(0), Dest);
15530 assert(NewBR == User);
15534 SDValue Cmp = DAG.getNode(X86ISD::CMP, dl, MVT::i32,
15535 Cond.getOperand(0), Cond.getOperand(1));
15536 Cmp = ConvertCmpIfNecessary(Cmp, DAG);
15537 CC = DAG.getConstant(X86::COND_NE, MVT::i8);
15538 Chain = DAG.getNode(X86ISD::BRCOND, dl, Op.getValueType(),
15539 Chain, Dest, CC, Cmp);
15540 CC = DAG.getConstant(X86::COND_P, MVT::i8);
15545 } else if (Cond.getOpcode() == ISD::SETCC &&
15546 cast<CondCodeSDNode>(Cond.getOperand(2))->get() == ISD::SETUNE) {
15547 // For FCMP_UNE, we can emit
15548 // two branches instead of an explicit AND instruction with a
15549 // separate test. However, we only do this if this block doesn't
15550 // have a fall-through edge, because this requires an explicit
15551 // jmp when the condition is false.
15552 if (Op.getNode()->hasOneUse()) {
15553 SDNode *User = *Op.getNode()->use_begin();
15554 // Look for an unconditional branch following this conditional branch.
15555 // We need this because we need to reverse the successors in order
15556 // to implement FCMP_UNE.
15557 if (User->getOpcode() == ISD::BR) {
15558 SDValue FalseBB = User->getOperand(1);
15560 DAG.UpdateNodeOperands(User, User->getOperand(0), Dest);
15561 assert(NewBR == User);
15564 SDValue Cmp = DAG.getNode(X86ISD::CMP, dl, MVT::i32,
15565 Cond.getOperand(0), Cond.getOperand(1));
15566 Cmp = ConvertCmpIfNecessary(Cmp, DAG);
15567 CC = DAG.getConstant(X86::COND_NE, MVT::i8);
15568 Chain = DAG.getNode(X86ISD::BRCOND, dl, Op.getValueType(),
15569 Chain, Dest, CC, Cmp);
15570 CC = DAG.getConstant(X86::COND_NP, MVT::i8);
15580 // Look pass the truncate if the high bits are known zero.
15581 if (isTruncWithZeroHighBitsInput(Cond, DAG))
15582 Cond = Cond.getOperand(0);
15584 // We know the result of AND is compared against zero. Try to match
15586 if (Cond.getOpcode() == ISD::AND && Cond.hasOneUse()) {
15587 SDValue NewSetCC = LowerToBT(Cond, ISD::SETNE, dl, DAG);
15588 if (NewSetCC.getNode()) {
15589 CC = NewSetCC.getOperand(0);
15590 Cond = NewSetCC.getOperand(1);
15597 X86::CondCode X86Cond = Inverted ? X86::COND_E : X86::COND_NE;
15598 CC = DAG.getConstant(X86Cond, MVT::i8);
15599 Cond = EmitTest(Cond, X86Cond, dl, DAG);
15601 Cond = ConvertCmpIfNecessary(Cond, DAG);
15602 return DAG.getNode(X86ISD::BRCOND, dl, Op.getValueType(),
15603 Chain, Dest, CC, Cond);
15606 // Lower dynamic stack allocation to _alloca call for Cygwin/Mingw targets.
15607 // Calls to _alloca are needed to probe the stack when allocating more than 4k
15608 // bytes in one go. Touching the stack at 4K increments is necessary to ensure
15609 // that the guard pages used by the OS virtual memory manager are allocated in
15610 // correct sequence.
15612 X86TargetLowering::LowerDYNAMIC_STACKALLOC(SDValue Op,
15613 SelectionDAG &DAG) const {
15614 MachineFunction &MF = DAG.getMachineFunction();
15615 bool SplitStack = MF.shouldSplitStack();
15616 bool Lower = (Subtarget->isOSWindows() && !Subtarget->isTargetMacho()) ||
15621 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
15622 SDNode* Node = Op.getNode();
15624 unsigned SPReg = TLI.getStackPointerRegisterToSaveRestore();
15625 assert(SPReg && "Target cannot require DYNAMIC_STACKALLOC expansion and"
15626 " not tell us which reg is the stack pointer!");
15627 EVT VT = Node->getValueType(0);
15628 SDValue Tmp1 = SDValue(Node, 0);
15629 SDValue Tmp2 = SDValue(Node, 1);
15630 SDValue Tmp3 = Node->getOperand(2);
15631 SDValue Chain = Tmp1.getOperand(0);
15633 // Chain the dynamic stack allocation so that it doesn't modify the stack
15634 // pointer when other instructions are using the stack.
15635 Chain = DAG.getCALLSEQ_START(Chain, DAG.getIntPtrConstant(0, true),
15638 SDValue Size = Tmp2.getOperand(1);
15639 SDValue SP = DAG.getCopyFromReg(Chain, dl, SPReg, VT);
15640 Chain = SP.getValue(1);
15641 unsigned Align = cast<ConstantSDNode>(Tmp3)->getZExtValue();
15642 const TargetFrameLowering &TFI = *DAG.getSubtarget().getFrameLowering();
15643 unsigned StackAlign = TFI.getStackAlignment();
15644 Tmp1 = DAG.getNode(ISD::SUB, dl, VT, SP, Size); // Value
15645 if (Align > StackAlign)
15646 Tmp1 = DAG.getNode(ISD::AND, dl, VT, Tmp1,
15647 DAG.getConstant(-(uint64_t)Align, VT));
15648 Chain = DAG.getCopyToReg(Chain, dl, SPReg, Tmp1); // Output chain
15650 Tmp2 = DAG.getCALLSEQ_END(Chain, DAG.getIntPtrConstant(0, true),
15651 DAG.getIntPtrConstant(0, true), SDValue(),
15654 SDValue Ops[2] = { Tmp1, Tmp2 };
15655 return DAG.getMergeValues(Ops, dl);
15659 SDValue Chain = Op.getOperand(0);
15660 SDValue Size = Op.getOperand(1);
15661 unsigned Align = cast<ConstantSDNode>(Op.getOperand(2))->getZExtValue();
15662 EVT VT = Op.getNode()->getValueType(0);
15664 bool Is64Bit = Subtarget->is64Bit();
15665 EVT SPTy = getPointerTy();
15668 MachineRegisterInfo &MRI = MF.getRegInfo();
15671 // The 64 bit implementation of segmented stacks needs to clobber both r10
15672 // r11. This makes it impossible to use it along with nested parameters.
15673 const Function *F = MF.getFunction();
15675 for (Function::const_arg_iterator I = F->arg_begin(), E = F->arg_end();
15677 if (I->hasNestAttr())
15678 report_fatal_error("Cannot use segmented stacks with functions that "
15679 "have nested arguments.");
15682 const TargetRegisterClass *AddrRegClass =
15683 getRegClassFor(getPointerTy());
15684 unsigned Vreg = MRI.createVirtualRegister(AddrRegClass);
15685 Chain = DAG.getCopyToReg(Chain, dl, Vreg, Size);
15686 SDValue Value = DAG.getNode(X86ISD::SEG_ALLOCA, dl, SPTy, Chain,
15687 DAG.getRegister(Vreg, SPTy));
15688 SDValue Ops1[2] = { Value, Chain };
15689 return DAG.getMergeValues(Ops1, dl);
15692 const unsigned Reg = (Subtarget->isTarget64BitLP64() ? X86::RAX : X86::EAX);
15694 Chain = DAG.getCopyToReg(Chain, dl, Reg, Size, Flag);
15695 Flag = Chain.getValue(1);
15696 SDVTList NodeTys = DAG.getVTList(MVT::Other, MVT::Glue);
15698 Chain = DAG.getNode(X86ISD::WIN_ALLOCA, dl, NodeTys, Chain, Flag);
15700 const X86RegisterInfo *RegInfo = static_cast<const X86RegisterInfo *>(
15701 DAG.getSubtarget().getRegisterInfo());
15702 unsigned SPReg = RegInfo->getStackRegister();
15703 SDValue SP = DAG.getCopyFromReg(Chain, dl, SPReg, SPTy);
15704 Chain = SP.getValue(1);
15707 SP = DAG.getNode(ISD::AND, dl, VT, SP.getValue(0),
15708 DAG.getConstant(-(uint64_t)Align, VT));
15709 Chain = DAG.getCopyToReg(Chain, dl, SPReg, SP);
15712 SDValue Ops1[2] = { SP, Chain };
15713 return DAG.getMergeValues(Ops1, dl);
15717 SDValue X86TargetLowering::LowerVASTART(SDValue Op, SelectionDAG &DAG) const {
15718 MachineFunction &MF = DAG.getMachineFunction();
15719 X86MachineFunctionInfo *FuncInfo = MF.getInfo<X86MachineFunctionInfo>();
15721 const Value *SV = cast<SrcValueSDNode>(Op.getOperand(2))->getValue();
15724 if (!Subtarget->is64Bit() || Subtarget->isTargetWin64()) {
15725 // vastart just stores the address of the VarArgsFrameIndex slot into the
15726 // memory location argument.
15727 SDValue FR = DAG.getFrameIndex(FuncInfo->getVarArgsFrameIndex(),
15729 return DAG.getStore(Op.getOperand(0), DL, FR, Op.getOperand(1),
15730 MachinePointerInfo(SV), false, false, 0);
15734 // gp_offset (0 - 6 * 8)
15735 // fp_offset (48 - 48 + 8 * 16)
15736 // overflow_arg_area (point to parameters coming in memory).
15738 SmallVector<SDValue, 8> MemOps;
15739 SDValue FIN = Op.getOperand(1);
15741 SDValue Store = DAG.getStore(Op.getOperand(0), DL,
15742 DAG.getConstant(FuncInfo->getVarArgsGPOffset(),
15744 FIN, MachinePointerInfo(SV), false, false, 0);
15745 MemOps.push_back(Store);
15748 FIN = DAG.getNode(ISD::ADD, DL, getPointerTy(),
15749 FIN, DAG.getIntPtrConstant(4));
15750 Store = DAG.getStore(Op.getOperand(0), DL,
15751 DAG.getConstant(FuncInfo->getVarArgsFPOffset(),
15753 FIN, MachinePointerInfo(SV, 4), false, false, 0);
15754 MemOps.push_back(Store);
15756 // Store ptr to overflow_arg_area
15757 FIN = DAG.getNode(ISD::ADD, DL, getPointerTy(),
15758 FIN, DAG.getIntPtrConstant(4));
15759 SDValue OVFIN = DAG.getFrameIndex(FuncInfo->getVarArgsFrameIndex(),
15761 Store = DAG.getStore(Op.getOperand(0), DL, OVFIN, FIN,
15762 MachinePointerInfo(SV, 8),
15764 MemOps.push_back(Store);
15766 // Store ptr to reg_save_area.
15767 FIN = DAG.getNode(ISD::ADD, DL, getPointerTy(),
15768 FIN, DAG.getIntPtrConstant(8));
15769 SDValue RSFIN = DAG.getFrameIndex(FuncInfo->getRegSaveFrameIndex(),
15771 Store = DAG.getStore(Op.getOperand(0), DL, RSFIN, FIN,
15772 MachinePointerInfo(SV, 16), false, false, 0);
15773 MemOps.push_back(Store);
15774 return DAG.getNode(ISD::TokenFactor, DL, MVT::Other, MemOps);
15777 SDValue X86TargetLowering::LowerVAARG(SDValue Op, SelectionDAG &DAG) const {
15778 assert(Subtarget->is64Bit() &&
15779 "LowerVAARG only handles 64-bit va_arg!");
15780 assert((Subtarget->isTargetLinux() ||
15781 Subtarget->isTargetDarwin()) &&
15782 "Unhandled target in LowerVAARG");
15783 assert(Op.getNode()->getNumOperands() == 4);
15784 SDValue Chain = Op.getOperand(0);
15785 SDValue SrcPtr = Op.getOperand(1);
15786 const Value *SV = cast<SrcValueSDNode>(Op.getOperand(2))->getValue();
15787 unsigned Align = Op.getConstantOperandVal(3);
15790 EVT ArgVT = Op.getNode()->getValueType(0);
15791 Type *ArgTy = ArgVT.getTypeForEVT(*DAG.getContext());
15792 uint32_t ArgSize = getDataLayout()->getTypeAllocSize(ArgTy);
15795 // Decide which area this value should be read from.
15796 // TODO: Implement the AMD64 ABI in its entirety. This simple
15797 // selection mechanism works only for the basic types.
15798 if (ArgVT == MVT::f80) {
15799 llvm_unreachable("va_arg for f80 not yet implemented");
15800 } else if (ArgVT.isFloatingPoint() && ArgSize <= 16 /*bytes*/) {
15801 ArgMode = 2; // Argument passed in XMM register. Use fp_offset.
15802 } else if (ArgVT.isInteger() && ArgSize <= 32 /*bytes*/) {
15803 ArgMode = 1; // Argument passed in GPR64 register(s). Use gp_offset.
15805 llvm_unreachable("Unhandled argument type in LowerVAARG");
15808 if (ArgMode == 2) {
15809 // Sanity Check: Make sure using fp_offset makes sense.
15810 assert(!DAG.getTarget().Options.UseSoftFloat &&
15811 !(DAG.getMachineFunction()
15812 .getFunction()->getAttributes()
15813 .hasAttribute(AttributeSet::FunctionIndex,
15814 Attribute::NoImplicitFloat)) &&
15815 Subtarget->hasSSE1());
15818 // Insert VAARG_64 node into the DAG
15819 // VAARG_64 returns two values: Variable Argument Address, Chain
15820 SmallVector<SDValue, 11> InstOps;
15821 InstOps.push_back(Chain);
15822 InstOps.push_back(SrcPtr);
15823 InstOps.push_back(DAG.getConstant(ArgSize, MVT::i32));
15824 InstOps.push_back(DAG.getConstant(ArgMode, MVT::i8));
15825 InstOps.push_back(DAG.getConstant(Align, MVT::i32));
15826 SDVTList VTs = DAG.getVTList(getPointerTy(), MVT::Other);
15827 SDValue VAARG = DAG.getMemIntrinsicNode(X86ISD::VAARG_64, dl,
15828 VTs, InstOps, MVT::i64,
15829 MachinePointerInfo(SV),
15831 /*Volatile=*/false,
15833 /*WriteMem=*/true);
15834 Chain = VAARG.getValue(1);
15836 // Load the next argument and return it
15837 return DAG.getLoad(ArgVT, dl,
15840 MachinePointerInfo(),
15841 false, false, false, 0);
15844 static SDValue LowerVACOPY(SDValue Op, const X86Subtarget *Subtarget,
15845 SelectionDAG &DAG) {
15846 // X86-64 va_list is a struct { i32, i32, i8*, i8* }.
15847 assert(Subtarget->is64Bit() && "This code only handles 64-bit va_copy!");
15848 SDValue Chain = Op.getOperand(0);
15849 SDValue DstPtr = Op.getOperand(1);
15850 SDValue SrcPtr = Op.getOperand(2);
15851 const Value *DstSV = cast<SrcValueSDNode>(Op.getOperand(3))->getValue();
15852 const Value *SrcSV = cast<SrcValueSDNode>(Op.getOperand(4))->getValue();
15855 return DAG.getMemcpy(Chain, DL, DstPtr, SrcPtr,
15856 DAG.getIntPtrConstant(24), 8, /*isVolatile*/false,
15858 MachinePointerInfo(DstSV), MachinePointerInfo(SrcSV));
15861 // getTargetVShiftByConstNode - Handle vector element shifts where the shift
15862 // amount is a constant. Takes immediate version of shift as input.
15863 static SDValue getTargetVShiftByConstNode(unsigned Opc, SDLoc dl, MVT VT,
15864 SDValue SrcOp, uint64_t ShiftAmt,
15865 SelectionDAG &DAG) {
15866 MVT ElementType = VT.getVectorElementType();
15868 // Fold this packed shift into its first operand if ShiftAmt is 0.
15872 // Check for ShiftAmt >= element width
15873 if (ShiftAmt >= ElementType.getSizeInBits()) {
15874 if (Opc == X86ISD::VSRAI)
15875 ShiftAmt = ElementType.getSizeInBits() - 1;
15877 return DAG.getConstant(0, VT);
15880 assert((Opc == X86ISD::VSHLI || Opc == X86ISD::VSRLI || Opc == X86ISD::VSRAI)
15881 && "Unknown target vector shift-by-constant node");
15883 // Fold this packed vector shift into a build vector if SrcOp is a
15884 // vector of Constants or UNDEFs, and SrcOp valuetype is the same as VT.
15885 if (VT == SrcOp.getSimpleValueType() &&
15886 ISD::isBuildVectorOfConstantSDNodes(SrcOp.getNode())) {
15887 SmallVector<SDValue, 8> Elts;
15888 unsigned NumElts = SrcOp->getNumOperands();
15889 ConstantSDNode *ND;
15892 default: llvm_unreachable(nullptr);
15893 case X86ISD::VSHLI:
15894 for (unsigned i=0; i!=NumElts; ++i) {
15895 SDValue CurrentOp = SrcOp->getOperand(i);
15896 if (CurrentOp->getOpcode() == ISD::UNDEF) {
15897 Elts.push_back(CurrentOp);
15900 ND = cast<ConstantSDNode>(CurrentOp);
15901 const APInt &C = ND->getAPIntValue();
15902 Elts.push_back(DAG.getConstant(C.shl(ShiftAmt), ElementType));
15905 case X86ISD::VSRLI:
15906 for (unsigned i=0; i!=NumElts; ++i) {
15907 SDValue CurrentOp = SrcOp->getOperand(i);
15908 if (CurrentOp->getOpcode() == ISD::UNDEF) {
15909 Elts.push_back(CurrentOp);
15912 ND = cast<ConstantSDNode>(CurrentOp);
15913 const APInt &C = ND->getAPIntValue();
15914 Elts.push_back(DAG.getConstant(C.lshr(ShiftAmt), ElementType));
15917 case X86ISD::VSRAI:
15918 for (unsigned i=0; i!=NumElts; ++i) {
15919 SDValue CurrentOp = SrcOp->getOperand(i);
15920 if (CurrentOp->getOpcode() == ISD::UNDEF) {
15921 Elts.push_back(CurrentOp);
15924 ND = cast<ConstantSDNode>(CurrentOp);
15925 const APInt &C = ND->getAPIntValue();
15926 Elts.push_back(DAG.getConstant(C.ashr(ShiftAmt), ElementType));
15931 return DAG.getNode(ISD::BUILD_VECTOR, dl, VT, Elts);
15934 return DAG.getNode(Opc, dl, VT, SrcOp, DAG.getConstant(ShiftAmt, MVT::i8));
15937 // getTargetVShiftNode - Handle vector element shifts where the shift amount
15938 // may or may not be a constant. Takes immediate version of shift as input.
15939 static SDValue getTargetVShiftNode(unsigned Opc, SDLoc dl, MVT VT,
15940 SDValue SrcOp, SDValue ShAmt,
15941 SelectionDAG &DAG) {
15942 assert(ShAmt.getValueType() == MVT::i32 && "ShAmt is not i32");
15944 // Catch shift-by-constant.
15945 if (ConstantSDNode *CShAmt = dyn_cast<ConstantSDNode>(ShAmt))
15946 return getTargetVShiftByConstNode(Opc, dl, VT, SrcOp,
15947 CShAmt->getZExtValue(), DAG);
15949 // Change opcode to non-immediate version
15951 default: llvm_unreachable("Unknown target vector shift node");
15952 case X86ISD::VSHLI: Opc = X86ISD::VSHL; break;
15953 case X86ISD::VSRLI: Opc = X86ISD::VSRL; break;
15954 case X86ISD::VSRAI: Opc = X86ISD::VSRA; break;
15957 // Need to build a vector containing shift amount
15958 // Shift amount is 32-bits, but SSE instructions read 64-bit, so fill with 0
15961 ShOps[1] = DAG.getConstant(0, MVT::i32);
15962 ShOps[2] = ShOps[3] = DAG.getUNDEF(MVT::i32);
15963 ShAmt = DAG.getNode(ISD::BUILD_VECTOR, dl, MVT::v4i32, ShOps);
15965 // The return type has to be a 128-bit type with the same element
15966 // type as the input type.
15967 MVT EltVT = VT.getVectorElementType();
15968 EVT ShVT = MVT::getVectorVT(EltVT, 128/EltVT.getSizeInBits());
15970 ShAmt = DAG.getNode(ISD::BITCAST, dl, ShVT, ShAmt);
15971 return DAG.getNode(Opc, dl, VT, SrcOp, ShAmt);
15974 /// \brief Return (and \p Op, \p Mask) for compare instructions or
15975 /// (vselect \p Mask, \p Op, \p PreservedSrc) for others along with the
15976 /// necessary casting for \p Mask when lowering masking intrinsics.
15977 static SDValue getVectorMaskingNode(SDValue Op, SDValue Mask,
15978 SDValue PreservedSrc, SelectionDAG &DAG) {
15979 EVT VT = Op.getValueType();
15980 EVT MaskVT = EVT::getVectorVT(*DAG.getContext(),
15981 MVT::i1, VT.getVectorNumElements());
15982 EVT BitcastVT = EVT::getVectorVT(*DAG.getContext(), MVT::i1,
15983 Mask.getValueType().getSizeInBits());
15986 assert(MaskVT.isSimple() && "invalid mask type");
15988 if (isAllOnes(Mask))
15991 // In case when MaskVT equals v2i1 or v4i1, low 2 or 4 elements
15992 // are extracted by EXTRACT_SUBVECTOR.
15993 SDValue VMask = DAG.getNode(ISD::EXTRACT_SUBVECTOR, dl, MaskVT,
15994 DAG.getNode(ISD::BITCAST, dl, BitcastVT, Mask),
15995 DAG.getIntPtrConstant(0));
15997 switch (Op.getOpcode()) {
15999 case X86ISD::PCMPEQM:
16000 case X86ISD::PCMPGTM:
16002 case X86ISD::CMPMU:
16003 return DAG.getNode(ISD::AND, dl, VT, Op, VMask);
16006 return DAG.getNode(ISD::VSELECT, dl, VT, VMask, Op, PreservedSrc);
16009 static unsigned getOpcodeForFMAIntrinsic(unsigned IntNo) {
16011 default: llvm_unreachable("Impossible intrinsic"); // Can't reach here.
16012 case Intrinsic::x86_fma_vfmadd_ps:
16013 case Intrinsic::x86_fma_vfmadd_pd:
16014 case Intrinsic::x86_fma_vfmadd_ps_256:
16015 case Intrinsic::x86_fma_vfmadd_pd_256:
16016 case Intrinsic::x86_fma_mask_vfmadd_ps_512:
16017 case Intrinsic::x86_fma_mask_vfmadd_pd_512:
16018 return X86ISD::FMADD;
16019 case Intrinsic::x86_fma_vfmsub_ps:
16020 case Intrinsic::x86_fma_vfmsub_pd:
16021 case Intrinsic::x86_fma_vfmsub_ps_256:
16022 case Intrinsic::x86_fma_vfmsub_pd_256:
16023 case Intrinsic::x86_fma_mask_vfmsub_ps_512:
16024 case Intrinsic::x86_fma_mask_vfmsub_pd_512:
16025 return X86ISD::FMSUB;
16026 case Intrinsic::x86_fma_vfnmadd_ps:
16027 case Intrinsic::x86_fma_vfnmadd_pd:
16028 case Intrinsic::x86_fma_vfnmadd_ps_256:
16029 case Intrinsic::x86_fma_vfnmadd_pd_256:
16030 case Intrinsic::x86_fma_mask_vfnmadd_ps_512:
16031 case Intrinsic::x86_fma_mask_vfnmadd_pd_512:
16032 return X86ISD::FNMADD;
16033 case Intrinsic::x86_fma_vfnmsub_ps:
16034 case Intrinsic::x86_fma_vfnmsub_pd:
16035 case Intrinsic::x86_fma_vfnmsub_ps_256:
16036 case Intrinsic::x86_fma_vfnmsub_pd_256:
16037 case Intrinsic::x86_fma_mask_vfnmsub_ps_512:
16038 case Intrinsic::x86_fma_mask_vfnmsub_pd_512:
16039 return X86ISD::FNMSUB;
16040 case Intrinsic::x86_fma_vfmaddsub_ps:
16041 case Intrinsic::x86_fma_vfmaddsub_pd:
16042 case Intrinsic::x86_fma_vfmaddsub_ps_256:
16043 case Intrinsic::x86_fma_vfmaddsub_pd_256:
16044 case Intrinsic::x86_fma_mask_vfmaddsub_ps_512:
16045 case Intrinsic::x86_fma_mask_vfmaddsub_pd_512:
16046 return X86ISD::FMADDSUB;
16047 case Intrinsic::x86_fma_vfmsubadd_ps:
16048 case Intrinsic::x86_fma_vfmsubadd_pd:
16049 case Intrinsic::x86_fma_vfmsubadd_ps_256:
16050 case Intrinsic::x86_fma_vfmsubadd_pd_256:
16051 case Intrinsic::x86_fma_mask_vfmsubadd_ps_512:
16052 case Intrinsic::x86_fma_mask_vfmsubadd_pd_512:
16053 return X86ISD::FMSUBADD;
16057 static SDValue LowerINTRINSIC_WO_CHAIN(SDValue Op, SelectionDAG &DAG) {
16059 unsigned IntNo = cast<ConstantSDNode>(Op.getOperand(0))->getZExtValue();
16061 const IntrinsicData* IntrData = getIntrinsicWithoutChain(IntNo);
16063 switch(IntrData->Type) {
16064 case INTR_TYPE_1OP:
16065 return DAG.getNode(IntrData->Opc0, dl, Op.getValueType(), Op.getOperand(1));
16066 case INTR_TYPE_2OP:
16067 return DAG.getNode(IntrData->Opc0, dl, Op.getValueType(), Op.getOperand(1),
16069 case INTR_TYPE_3OP:
16070 return DAG.getNode(IntrData->Opc0, dl, Op.getValueType(), Op.getOperand(1),
16071 Op.getOperand(2), Op.getOperand(3));
16073 // Comparison intrinsics with masks.
16074 // Example of transformation:
16075 // (i8 (int_x86_avx512_mask_pcmpeq_q_128
16076 // (v2i64 %a), (v2i64 %b), (i8 %mask))) ->
16078 // (v8i1 (insert_subvector undef,
16079 // (v2i1 (and (PCMPEQM %a, %b),
16080 // (extract_subvector
16081 // (v8i1 (bitcast %mask)), 0))), 0))))
16082 EVT VT = Op.getOperand(1).getValueType();
16083 EVT MaskVT = EVT::getVectorVT(*DAG.getContext(), MVT::i1,
16084 VT.getVectorNumElements());
16085 SDValue Mask = Op.getOperand(3);
16086 EVT BitcastVT = EVT::getVectorVT(*DAG.getContext(), MVT::i1,
16087 Mask.getValueType().getSizeInBits());
16088 SDValue Cmp = DAG.getNode(IntrData->Opc0, dl, MaskVT,
16089 Op.getOperand(1), Op.getOperand(2));
16090 SDValue CmpMask = getVectorMaskingNode(Cmp, Op.getOperand(3),
16091 DAG.getTargetConstant(0, MaskVT), DAG);
16092 SDValue Res = DAG.getNode(ISD::INSERT_SUBVECTOR, dl, BitcastVT,
16093 DAG.getUNDEF(BitcastVT), CmpMask,
16094 DAG.getIntPtrConstant(0));
16095 return DAG.getNode(ISD::BITCAST, dl, Op.getValueType(), Res);
16097 case COMI: { // Comparison intrinsics
16098 ISD::CondCode CC = (ISD::CondCode)IntrData->Opc1;
16099 SDValue LHS = Op.getOperand(1);
16100 SDValue RHS = Op.getOperand(2);
16101 unsigned X86CC = TranslateX86CC(CC, true, LHS, RHS, DAG);
16102 assert(X86CC != X86::COND_INVALID && "Unexpected illegal condition!");
16103 SDValue Cond = DAG.getNode(IntrData->Opc0, dl, MVT::i32, LHS, RHS);
16104 SDValue SetCC = DAG.getNode(X86ISD::SETCC, dl, MVT::i8,
16105 DAG.getConstant(X86CC, MVT::i8), Cond);
16106 return DAG.getNode(ISD::ZERO_EXTEND, dl, MVT::i32, SetCC);
16109 return getTargetVShiftNode(IntrData->Opc0, dl, Op.getSimpleValueType(),
16110 Op.getOperand(1), Op.getOperand(2), DAG);
16117 default: return SDValue(); // Don't custom lower most intrinsics.
16119 // Arithmetic intrinsics.
16120 case Intrinsic::x86_sse2_pmulu_dq:
16121 case Intrinsic::x86_avx2_pmulu_dq:
16122 return DAG.getNode(X86ISD::PMULUDQ, dl, Op.getValueType(),
16123 Op.getOperand(1), Op.getOperand(2));
16125 case Intrinsic::x86_sse41_pmuldq:
16126 case Intrinsic::x86_avx2_pmul_dq:
16127 return DAG.getNode(X86ISD::PMULDQ, dl, Op.getValueType(),
16128 Op.getOperand(1), Op.getOperand(2));
16130 case Intrinsic::x86_sse2_pmulhu_w:
16131 case Intrinsic::x86_avx2_pmulhu_w:
16132 return DAG.getNode(ISD::MULHU, dl, Op.getValueType(),
16133 Op.getOperand(1), Op.getOperand(2));
16135 case Intrinsic::x86_sse2_pmulh_w:
16136 case Intrinsic::x86_avx2_pmulh_w:
16137 return DAG.getNode(ISD::MULHS, dl, Op.getValueType(),
16138 Op.getOperand(1), Op.getOperand(2));
16140 // SSE/SSE2/AVX floating point max/min intrinsics.
16141 case Intrinsic::x86_sse_max_ps:
16142 case Intrinsic::x86_sse2_max_pd:
16143 case Intrinsic::x86_avx_max_ps_256:
16144 case Intrinsic::x86_avx_max_pd_256:
16145 case Intrinsic::x86_sse_min_ps:
16146 case Intrinsic::x86_sse2_min_pd:
16147 case Intrinsic::x86_avx_min_ps_256:
16148 case Intrinsic::x86_avx_min_pd_256: {
16151 default: llvm_unreachable("Impossible intrinsic"); // Can't reach here.
16152 case Intrinsic::x86_sse_max_ps:
16153 case Intrinsic::x86_sse2_max_pd:
16154 case Intrinsic::x86_avx_max_ps_256:
16155 case Intrinsic::x86_avx_max_pd_256:
16156 Opcode = X86ISD::FMAX;
16158 case Intrinsic::x86_sse_min_ps:
16159 case Intrinsic::x86_sse2_min_pd:
16160 case Intrinsic::x86_avx_min_ps_256:
16161 case Intrinsic::x86_avx_min_pd_256:
16162 Opcode = X86ISD::FMIN;
16165 return DAG.getNode(Opcode, dl, Op.getValueType(),
16166 Op.getOperand(1), Op.getOperand(2));
16169 // AVX2 variable shift intrinsics
16170 case Intrinsic::x86_avx2_psllv_d:
16171 case Intrinsic::x86_avx2_psllv_q:
16172 case Intrinsic::x86_avx2_psllv_d_256:
16173 case Intrinsic::x86_avx2_psllv_q_256:
16174 case Intrinsic::x86_avx2_psrlv_d:
16175 case Intrinsic::x86_avx2_psrlv_q:
16176 case Intrinsic::x86_avx2_psrlv_d_256:
16177 case Intrinsic::x86_avx2_psrlv_q_256:
16178 case Intrinsic::x86_avx2_psrav_d:
16179 case Intrinsic::x86_avx2_psrav_d_256: {
16182 default: llvm_unreachable("Impossible intrinsic"); // Can't reach here.
16183 case Intrinsic::x86_avx2_psllv_d:
16184 case Intrinsic::x86_avx2_psllv_q:
16185 case Intrinsic::x86_avx2_psllv_d_256:
16186 case Intrinsic::x86_avx2_psllv_q_256:
16189 case Intrinsic::x86_avx2_psrlv_d:
16190 case Intrinsic::x86_avx2_psrlv_q:
16191 case Intrinsic::x86_avx2_psrlv_d_256:
16192 case Intrinsic::x86_avx2_psrlv_q_256:
16195 case Intrinsic::x86_avx2_psrav_d:
16196 case Intrinsic::x86_avx2_psrav_d_256:
16200 return DAG.getNode(Opcode, dl, Op.getValueType(),
16201 Op.getOperand(1), Op.getOperand(2));
16204 case Intrinsic::x86_sse2_packssdw_128:
16205 case Intrinsic::x86_sse2_packsswb_128:
16206 case Intrinsic::x86_avx2_packssdw:
16207 case Intrinsic::x86_avx2_packsswb:
16208 return DAG.getNode(X86ISD::PACKSS, dl, Op.getValueType(),
16209 Op.getOperand(1), Op.getOperand(2));
16211 case Intrinsic::x86_sse2_packuswb_128:
16212 case Intrinsic::x86_sse41_packusdw:
16213 case Intrinsic::x86_avx2_packuswb:
16214 case Intrinsic::x86_avx2_packusdw:
16215 return DAG.getNode(X86ISD::PACKUS, dl, Op.getValueType(),
16216 Op.getOperand(1), Op.getOperand(2));
16218 case Intrinsic::x86_ssse3_pshuf_b_128:
16219 case Intrinsic::x86_avx2_pshuf_b:
16220 return DAG.getNode(X86ISD::PSHUFB, dl, Op.getValueType(),
16221 Op.getOperand(1), Op.getOperand(2));
16223 case Intrinsic::x86_sse2_pshuf_d:
16224 return DAG.getNode(X86ISD::PSHUFD, dl, Op.getValueType(),
16225 Op.getOperand(1), Op.getOperand(2));
16227 case Intrinsic::x86_sse2_pshufl_w:
16228 return DAG.getNode(X86ISD::PSHUFLW, dl, Op.getValueType(),
16229 Op.getOperand(1), Op.getOperand(2));
16231 case Intrinsic::x86_sse2_pshufh_w:
16232 return DAG.getNode(X86ISD::PSHUFHW, dl, Op.getValueType(),
16233 Op.getOperand(1), Op.getOperand(2));
16235 case Intrinsic::x86_ssse3_psign_b_128:
16236 case Intrinsic::x86_ssse3_psign_w_128:
16237 case Intrinsic::x86_ssse3_psign_d_128:
16238 case Intrinsic::x86_avx2_psign_b:
16239 case Intrinsic::x86_avx2_psign_w:
16240 case Intrinsic::x86_avx2_psign_d:
16241 return DAG.getNode(X86ISD::PSIGN, dl, Op.getValueType(),
16242 Op.getOperand(1), Op.getOperand(2));
16244 case Intrinsic::x86_avx2_permd:
16245 case Intrinsic::x86_avx2_permps:
16246 // Operands intentionally swapped. Mask is last operand to intrinsic,
16247 // but second operand for node/instruction.
16248 return DAG.getNode(X86ISD::VPERMV, dl, Op.getValueType(),
16249 Op.getOperand(2), Op.getOperand(1));
16251 case Intrinsic::x86_avx512_mask_valign_q_512:
16252 case Intrinsic::x86_avx512_mask_valign_d_512:
16253 // Vector source operands are swapped.
16254 return getVectorMaskingNode(DAG.getNode(X86ISD::VALIGN, dl,
16255 Op.getValueType(), Op.getOperand(2),
16258 Op.getOperand(5), Op.getOperand(4), DAG);
16260 // ptest and testp intrinsics. The intrinsic these come from are designed to
16261 // return an integer value, not just an instruction so lower it to the ptest
16262 // or testp pattern and a setcc for the result.
16263 case Intrinsic::x86_sse41_ptestz:
16264 case Intrinsic::x86_sse41_ptestc:
16265 case Intrinsic::x86_sse41_ptestnzc:
16266 case Intrinsic::x86_avx_ptestz_256:
16267 case Intrinsic::x86_avx_ptestc_256:
16268 case Intrinsic::x86_avx_ptestnzc_256:
16269 case Intrinsic::x86_avx_vtestz_ps:
16270 case Intrinsic::x86_avx_vtestc_ps:
16271 case Intrinsic::x86_avx_vtestnzc_ps:
16272 case Intrinsic::x86_avx_vtestz_pd:
16273 case Intrinsic::x86_avx_vtestc_pd:
16274 case Intrinsic::x86_avx_vtestnzc_pd:
16275 case Intrinsic::x86_avx_vtestz_ps_256:
16276 case Intrinsic::x86_avx_vtestc_ps_256:
16277 case Intrinsic::x86_avx_vtestnzc_ps_256:
16278 case Intrinsic::x86_avx_vtestz_pd_256:
16279 case Intrinsic::x86_avx_vtestc_pd_256:
16280 case Intrinsic::x86_avx_vtestnzc_pd_256: {
16281 bool IsTestPacked = false;
16284 default: llvm_unreachable("Bad fallthrough in Intrinsic lowering.");
16285 case Intrinsic::x86_avx_vtestz_ps:
16286 case Intrinsic::x86_avx_vtestz_pd:
16287 case Intrinsic::x86_avx_vtestz_ps_256:
16288 case Intrinsic::x86_avx_vtestz_pd_256:
16289 IsTestPacked = true; // Fallthrough
16290 case Intrinsic::x86_sse41_ptestz:
16291 case Intrinsic::x86_avx_ptestz_256:
16293 X86CC = X86::COND_E;
16295 case Intrinsic::x86_avx_vtestc_ps:
16296 case Intrinsic::x86_avx_vtestc_pd:
16297 case Intrinsic::x86_avx_vtestc_ps_256:
16298 case Intrinsic::x86_avx_vtestc_pd_256:
16299 IsTestPacked = true; // Fallthrough
16300 case Intrinsic::x86_sse41_ptestc:
16301 case Intrinsic::x86_avx_ptestc_256:
16303 X86CC = X86::COND_B;
16305 case Intrinsic::x86_avx_vtestnzc_ps:
16306 case Intrinsic::x86_avx_vtestnzc_pd:
16307 case Intrinsic::x86_avx_vtestnzc_ps_256:
16308 case Intrinsic::x86_avx_vtestnzc_pd_256:
16309 IsTestPacked = true; // Fallthrough
16310 case Intrinsic::x86_sse41_ptestnzc:
16311 case Intrinsic::x86_avx_ptestnzc_256:
16313 X86CC = X86::COND_A;
16317 SDValue LHS = Op.getOperand(1);
16318 SDValue RHS = Op.getOperand(2);
16319 unsigned TestOpc = IsTestPacked ? X86ISD::TESTP : X86ISD::PTEST;
16320 SDValue Test = DAG.getNode(TestOpc, dl, MVT::i32, LHS, RHS);
16321 SDValue CC = DAG.getConstant(X86CC, MVT::i8);
16322 SDValue SetCC = DAG.getNode(X86ISD::SETCC, dl, MVT::i8, CC, Test);
16323 return DAG.getNode(ISD::ZERO_EXTEND, dl, MVT::i32, SetCC);
16325 case Intrinsic::x86_avx512_kortestz_w:
16326 case Intrinsic::x86_avx512_kortestc_w: {
16327 unsigned X86CC = (IntNo == Intrinsic::x86_avx512_kortestz_w)? X86::COND_E: X86::COND_B;
16328 SDValue LHS = DAG.getNode(ISD::BITCAST, dl, MVT::v16i1, Op.getOperand(1));
16329 SDValue RHS = DAG.getNode(ISD::BITCAST, dl, MVT::v16i1, Op.getOperand(2));
16330 SDValue CC = DAG.getConstant(X86CC, MVT::i8);
16331 SDValue Test = DAG.getNode(X86ISD::KORTEST, dl, MVT::i32, LHS, RHS);
16332 SDValue SetCC = DAG.getNode(X86ISD::SETCC, dl, MVT::i1, CC, Test);
16333 return DAG.getNode(ISD::ZERO_EXTEND, dl, MVT::i32, SetCC);
16336 case Intrinsic::x86_sse42_pcmpistria128:
16337 case Intrinsic::x86_sse42_pcmpestria128:
16338 case Intrinsic::x86_sse42_pcmpistric128:
16339 case Intrinsic::x86_sse42_pcmpestric128:
16340 case Intrinsic::x86_sse42_pcmpistrio128:
16341 case Intrinsic::x86_sse42_pcmpestrio128:
16342 case Intrinsic::x86_sse42_pcmpistris128:
16343 case Intrinsic::x86_sse42_pcmpestris128:
16344 case Intrinsic::x86_sse42_pcmpistriz128:
16345 case Intrinsic::x86_sse42_pcmpestriz128: {
16349 default: llvm_unreachable("Impossible intrinsic"); // Can't reach here.
16350 case Intrinsic::x86_sse42_pcmpistria128:
16351 Opcode = X86ISD::PCMPISTRI;
16352 X86CC = X86::COND_A;
16354 case Intrinsic::x86_sse42_pcmpestria128:
16355 Opcode = X86ISD::PCMPESTRI;
16356 X86CC = X86::COND_A;
16358 case Intrinsic::x86_sse42_pcmpistric128:
16359 Opcode = X86ISD::PCMPISTRI;
16360 X86CC = X86::COND_B;
16362 case Intrinsic::x86_sse42_pcmpestric128:
16363 Opcode = X86ISD::PCMPESTRI;
16364 X86CC = X86::COND_B;
16366 case Intrinsic::x86_sse42_pcmpistrio128:
16367 Opcode = X86ISD::PCMPISTRI;
16368 X86CC = X86::COND_O;
16370 case Intrinsic::x86_sse42_pcmpestrio128:
16371 Opcode = X86ISD::PCMPESTRI;
16372 X86CC = X86::COND_O;
16374 case Intrinsic::x86_sse42_pcmpistris128:
16375 Opcode = X86ISD::PCMPISTRI;
16376 X86CC = X86::COND_S;
16378 case Intrinsic::x86_sse42_pcmpestris128:
16379 Opcode = X86ISD::PCMPESTRI;
16380 X86CC = X86::COND_S;
16382 case Intrinsic::x86_sse42_pcmpistriz128:
16383 Opcode = X86ISD::PCMPISTRI;
16384 X86CC = X86::COND_E;
16386 case Intrinsic::x86_sse42_pcmpestriz128:
16387 Opcode = X86ISD::PCMPESTRI;
16388 X86CC = X86::COND_E;
16391 SmallVector<SDValue, 5> NewOps(Op->op_begin()+1, Op->op_end());
16392 SDVTList VTs = DAG.getVTList(Op.getValueType(), MVT::i32);
16393 SDValue PCMP = DAG.getNode(Opcode, dl, VTs, NewOps);
16394 SDValue SetCC = DAG.getNode(X86ISD::SETCC, dl, MVT::i8,
16395 DAG.getConstant(X86CC, MVT::i8),
16396 SDValue(PCMP.getNode(), 1));
16397 return DAG.getNode(ISD::ZERO_EXTEND, dl, MVT::i32, SetCC);
16400 case Intrinsic::x86_sse42_pcmpistri128:
16401 case Intrinsic::x86_sse42_pcmpestri128: {
16403 if (IntNo == Intrinsic::x86_sse42_pcmpistri128)
16404 Opcode = X86ISD::PCMPISTRI;
16406 Opcode = X86ISD::PCMPESTRI;
16408 SmallVector<SDValue, 5> NewOps(Op->op_begin()+1, Op->op_end());
16409 SDVTList VTs = DAG.getVTList(Op.getValueType(), MVT::i32);
16410 return DAG.getNode(Opcode, dl, VTs, NewOps);
16413 case Intrinsic::x86_fma_mask_vfmadd_ps_512:
16414 case Intrinsic::x86_fma_mask_vfmadd_pd_512:
16415 case Intrinsic::x86_fma_mask_vfmsub_ps_512:
16416 case Intrinsic::x86_fma_mask_vfmsub_pd_512:
16417 case Intrinsic::x86_fma_mask_vfnmadd_ps_512:
16418 case Intrinsic::x86_fma_mask_vfnmadd_pd_512:
16419 case Intrinsic::x86_fma_mask_vfnmsub_ps_512:
16420 case Intrinsic::x86_fma_mask_vfnmsub_pd_512:
16421 case Intrinsic::x86_fma_mask_vfmaddsub_ps_512:
16422 case Intrinsic::x86_fma_mask_vfmaddsub_pd_512:
16423 case Intrinsic::x86_fma_mask_vfmsubadd_ps_512:
16424 case Intrinsic::x86_fma_mask_vfmsubadd_pd_512: {
16425 auto *SAE = cast<ConstantSDNode>(Op.getOperand(5));
16426 if (SAE->getZExtValue() == X86::STATIC_ROUNDING::CUR_DIRECTION)
16427 return getVectorMaskingNode(DAG.getNode(getOpcodeForFMAIntrinsic(IntNo),
16428 dl, Op.getValueType(),
16432 Op.getOperand(4), Op.getOperand(1), DAG);
16437 case Intrinsic::x86_fma_vfmadd_ps:
16438 case Intrinsic::x86_fma_vfmadd_pd:
16439 case Intrinsic::x86_fma_vfmsub_ps:
16440 case Intrinsic::x86_fma_vfmsub_pd:
16441 case Intrinsic::x86_fma_vfnmadd_ps:
16442 case Intrinsic::x86_fma_vfnmadd_pd:
16443 case Intrinsic::x86_fma_vfnmsub_ps:
16444 case Intrinsic::x86_fma_vfnmsub_pd:
16445 case Intrinsic::x86_fma_vfmaddsub_ps:
16446 case Intrinsic::x86_fma_vfmaddsub_pd:
16447 case Intrinsic::x86_fma_vfmsubadd_ps:
16448 case Intrinsic::x86_fma_vfmsubadd_pd:
16449 case Intrinsic::x86_fma_vfmadd_ps_256:
16450 case Intrinsic::x86_fma_vfmadd_pd_256:
16451 case Intrinsic::x86_fma_vfmsub_ps_256:
16452 case Intrinsic::x86_fma_vfmsub_pd_256:
16453 case Intrinsic::x86_fma_vfnmadd_ps_256:
16454 case Intrinsic::x86_fma_vfnmadd_pd_256:
16455 case Intrinsic::x86_fma_vfnmsub_ps_256:
16456 case Intrinsic::x86_fma_vfnmsub_pd_256:
16457 case Intrinsic::x86_fma_vfmaddsub_ps_256:
16458 case Intrinsic::x86_fma_vfmaddsub_pd_256:
16459 case Intrinsic::x86_fma_vfmsubadd_ps_256:
16460 case Intrinsic::x86_fma_vfmsubadd_pd_256:
16461 return DAG.getNode(getOpcodeForFMAIntrinsic(IntNo), dl, Op.getValueType(),
16462 Op.getOperand(1), Op.getOperand(2), Op.getOperand(3));
16466 static SDValue getGatherNode(unsigned Opc, SDValue Op, SelectionDAG &DAG,
16467 SDValue Src, SDValue Mask, SDValue Base,
16468 SDValue Index, SDValue ScaleOp, SDValue Chain,
16469 const X86Subtarget * Subtarget) {
16471 ConstantSDNode *C = dyn_cast<ConstantSDNode>(ScaleOp);
16472 assert(C && "Invalid scale type");
16473 SDValue Scale = DAG.getTargetConstant(C->getZExtValue(), MVT::i8);
16474 EVT MaskVT = MVT::getVectorVT(MVT::i1,
16475 Index.getSimpleValueType().getVectorNumElements());
16477 ConstantSDNode *MaskC = dyn_cast<ConstantSDNode>(Mask);
16479 MaskInReg = DAG.getTargetConstant(MaskC->getSExtValue(), MaskVT);
16481 MaskInReg = DAG.getNode(ISD::BITCAST, dl, MaskVT, Mask);
16482 SDVTList VTs = DAG.getVTList(Op.getValueType(), MaskVT, MVT::Other);
16483 SDValue Disp = DAG.getTargetConstant(0, MVT::i32);
16484 SDValue Segment = DAG.getRegister(0, MVT::i32);
16485 if (Src.getOpcode() == ISD::UNDEF)
16486 Src = getZeroVector(Op.getValueType(), Subtarget, DAG, dl);
16487 SDValue Ops[] = {Src, MaskInReg, Base, Scale, Index, Disp, Segment, Chain};
16488 SDNode *Res = DAG.getMachineNode(Opc, dl, VTs, Ops);
16489 SDValue RetOps[] = { SDValue(Res, 0), SDValue(Res, 2) };
16490 return DAG.getMergeValues(RetOps, dl);
16493 static SDValue getScatterNode(unsigned Opc, SDValue Op, SelectionDAG &DAG,
16494 SDValue Src, SDValue Mask, SDValue Base,
16495 SDValue Index, SDValue ScaleOp, SDValue Chain) {
16497 ConstantSDNode *C = dyn_cast<ConstantSDNode>(ScaleOp);
16498 assert(C && "Invalid scale type");
16499 SDValue Scale = DAG.getTargetConstant(C->getZExtValue(), MVT::i8);
16500 SDValue Disp = DAG.getTargetConstant(0, MVT::i32);
16501 SDValue Segment = DAG.getRegister(0, MVT::i32);
16502 EVT MaskVT = MVT::getVectorVT(MVT::i1,
16503 Index.getSimpleValueType().getVectorNumElements());
16505 ConstantSDNode *MaskC = dyn_cast<ConstantSDNode>(Mask);
16507 MaskInReg = DAG.getTargetConstant(MaskC->getSExtValue(), MaskVT);
16509 MaskInReg = DAG.getNode(ISD::BITCAST, dl, MaskVT, Mask);
16510 SDVTList VTs = DAG.getVTList(MaskVT, MVT::Other);
16511 SDValue Ops[] = {Base, Scale, Index, Disp, Segment, MaskInReg, Src, Chain};
16512 SDNode *Res = DAG.getMachineNode(Opc, dl, VTs, Ops);
16513 return SDValue(Res, 1);
16516 static SDValue getPrefetchNode(unsigned Opc, SDValue Op, SelectionDAG &DAG,
16517 SDValue Mask, SDValue Base, SDValue Index,
16518 SDValue ScaleOp, SDValue Chain) {
16520 ConstantSDNode *C = dyn_cast<ConstantSDNode>(ScaleOp);
16521 assert(C && "Invalid scale type");
16522 SDValue Scale = DAG.getTargetConstant(C->getZExtValue(), MVT::i8);
16523 SDValue Disp = DAG.getTargetConstant(0, MVT::i32);
16524 SDValue Segment = DAG.getRegister(0, MVT::i32);
16526 MVT::getVectorVT(MVT::i1, Index.getSimpleValueType().getVectorNumElements());
16528 ConstantSDNode *MaskC = dyn_cast<ConstantSDNode>(Mask);
16530 MaskInReg = DAG.getTargetConstant(MaskC->getSExtValue(), MaskVT);
16532 MaskInReg = DAG.getNode(ISD::BITCAST, dl, MaskVT, Mask);
16533 //SDVTList VTs = DAG.getVTList(MVT::Other);
16534 SDValue Ops[] = {MaskInReg, Base, Scale, Index, Disp, Segment, Chain};
16535 SDNode *Res = DAG.getMachineNode(Opc, dl, MVT::Other, Ops);
16536 return SDValue(Res, 0);
16539 // getReadPerformanceCounter - Handles the lowering of builtin intrinsics that
16540 // read performance monitor counters (x86_rdpmc).
16541 static void getReadPerformanceCounter(SDNode *N, SDLoc DL,
16542 SelectionDAG &DAG, const X86Subtarget *Subtarget,
16543 SmallVectorImpl<SDValue> &Results) {
16544 assert(N->getNumOperands() == 3 && "Unexpected number of operands!");
16545 SDVTList Tys = DAG.getVTList(MVT::Other, MVT::Glue);
16548 // The ECX register is used to select the index of the performance counter
16550 SDValue Chain = DAG.getCopyToReg(N->getOperand(0), DL, X86::ECX,
16552 SDValue rd = DAG.getNode(X86ISD::RDPMC_DAG, DL, Tys, Chain);
16554 // Reads the content of a 64-bit performance counter and returns it in the
16555 // registers EDX:EAX.
16556 if (Subtarget->is64Bit()) {
16557 LO = DAG.getCopyFromReg(rd, DL, X86::RAX, MVT::i64, rd.getValue(1));
16558 HI = DAG.getCopyFromReg(LO.getValue(1), DL, X86::RDX, MVT::i64,
16561 LO = DAG.getCopyFromReg(rd, DL, X86::EAX, MVT::i32, rd.getValue(1));
16562 HI = DAG.getCopyFromReg(LO.getValue(1), DL, X86::EDX, MVT::i32,
16565 Chain = HI.getValue(1);
16567 if (Subtarget->is64Bit()) {
16568 // The EAX register is loaded with the low-order 32 bits. The EDX register
16569 // is loaded with the supported high-order bits of the counter.
16570 SDValue Tmp = DAG.getNode(ISD::SHL, DL, MVT::i64, HI,
16571 DAG.getConstant(32, MVT::i8));
16572 Results.push_back(DAG.getNode(ISD::OR, DL, MVT::i64, LO, Tmp));
16573 Results.push_back(Chain);
16577 // Use a buildpair to merge the two 32-bit values into a 64-bit one.
16578 SDValue Ops[] = { LO, HI };
16579 SDValue Pair = DAG.getNode(ISD::BUILD_PAIR, DL, MVT::i64, Ops);
16580 Results.push_back(Pair);
16581 Results.push_back(Chain);
16584 // getReadTimeStampCounter - Handles the lowering of builtin intrinsics that
16585 // read the time stamp counter (x86_rdtsc and x86_rdtscp). This function is
16586 // also used to custom lower READCYCLECOUNTER nodes.
16587 static void getReadTimeStampCounter(SDNode *N, SDLoc DL, unsigned Opcode,
16588 SelectionDAG &DAG, const X86Subtarget *Subtarget,
16589 SmallVectorImpl<SDValue> &Results) {
16590 SDVTList Tys = DAG.getVTList(MVT::Other, MVT::Glue);
16591 SDValue rd = DAG.getNode(Opcode, DL, Tys, N->getOperand(0));
16594 // The processor's time-stamp counter (a 64-bit MSR) is stored into the
16595 // EDX:EAX registers. EDX is loaded with the high-order 32 bits of the MSR
16596 // and the EAX register is loaded with the low-order 32 bits.
16597 if (Subtarget->is64Bit()) {
16598 LO = DAG.getCopyFromReg(rd, DL, X86::RAX, MVT::i64, rd.getValue(1));
16599 HI = DAG.getCopyFromReg(LO.getValue(1), DL, X86::RDX, MVT::i64,
16602 LO = DAG.getCopyFromReg(rd, DL, X86::EAX, MVT::i32, rd.getValue(1));
16603 HI = DAG.getCopyFromReg(LO.getValue(1), DL, X86::EDX, MVT::i32,
16606 SDValue Chain = HI.getValue(1);
16608 if (Opcode == X86ISD::RDTSCP_DAG) {
16609 assert(N->getNumOperands() == 3 && "Unexpected number of operands!");
16611 // Instruction RDTSCP loads the IA32:TSC_AUX_MSR (address C000_0103H) into
16612 // the ECX register. Add 'ecx' explicitly to the chain.
16613 SDValue ecx = DAG.getCopyFromReg(Chain, DL, X86::ECX, MVT::i32,
16615 // Explicitly store the content of ECX at the location passed in input
16616 // to the 'rdtscp' intrinsic.
16617 Chain = DAG.getStore(ecx.getValue(1), DL, ecx, N->getOperand(2),
16618 MachinePointerInfo(), false, false, 0);
16621 if (Subtarget->is64Bit()) {
16622 // The EDX register is loaded with the high-order 32 bits of the MSR, and
16623 // the EAX register is loaded with the low-order 32 bits.
16624 SDValue Tmp = DAG.getNode(ISD::SHL, DL, MVT::i64, HI,
16625 DAG.getConstant(32, MVT::i8));
16626 Results.push_back(DAG.getNode(ISD::OR, DL, MVT::i64, LO, Tmp));
16627 Results.push_back(Chain);
16631 // Use a buildpair to merge the two 32-bit values into a 64-bit one.
16632 SDValue Ops[] = { LO, HI };
16633 SDValue Pair = DAG.getNode(ISD::BUILD_PAIR, DL, MVT::i64, Ops);
16634 Results.push_back(Pair);
16635 Results.push_back(Chain);
16638 static SDValue LowerREADCYCLECOUNTER(SDValue Op, const X86Subtarget *Subtarget,
16639 SelectionDAG &DAG) {
16640 SmallVector<SDValue, 2> Results;
16642 getReadTimeStampCounter(Op.getNode(), DL, X86ISD::RDTSC_DAG, DAG, Subtarget,
16644 return DAG.getMergeValues(Results, DL);
16648 static SDValue LowerINTRINSIC_W_CHAIN(SDValue Op, const X86Subtarget *Subtarget,
16649 SelectionDAG &DAG) {
16650 unsigned IntNo = cast<ConstantSDNode>(Op.getOperand(1))->getZExtValue();
16652 const IntrinsicData* IntrData = getIntrinsicWithChain(IntNo);
16657 switch(IntrData->Type) {
16659 llvm_unreachable("Unknown Intrinsic Type");
16663 // Emit the node with the right value type.
16664 SDVTList VTs = DAG.getVTList(Op->getValueType(0), MVT::Glue, MVT::Other);
16665 SDValue Result = DAG.getNode(IntrData->Opc0, dl, VTs, Op.getOperand(0));
16667 // If the value returned by RDRAND/RDSEED was valid (CF=1), return 1.
16668 // Otherwise return the value from Rand, which is always 0, casted to i32.
16669 SDValue Ops[] = { DAG.getZExtOrTrunc(Result, dl, Op->getValueType(1)),
16670 DAG.getConstant(1, Op->getValueType(1)),
16671 DAG.getConstant(X86::COND_B, MVT::i32),
16672 SDValue(Result.getNode(), 1) };
16673 SDValue isValid = DAG.getNode(X86ISD::CMOV, dl,
16674 DAG.getVTList(Op->getValueType(1), MVT::Glue),
16677 // Return { result, isValid, chain }.
16678 return DAG.getNode(ISD::MERGE_VALUES, dl, Op->getVTList(), Result, isValid,
16679 SDValue(Result.getNode(), 2));
16682 //gather(v1, mask, index, base, scale);
16683 SDValue Chain = Op.getOperand(0);
16684 SDValue Src = Op.getOperand(2);
16685 SDValue Base = Op.getOperand(3);
16686 SDValue Index = Op.getOperand(4);
16687 SDValue Mask = Op.getOperand(5);
16688 SDValue Scale = Op.getOperand(6);
16689 return getGatherNode(IntrData->Opc0, Op, DAG, Src, Mask, Base, Index, Scale, Chain,
16693 //scatter(base, mask, index, v1, scale);
16694 SDValue Chain = Op.getOperand(0);
16695 SDValue Base = Op.getOperand(2);
16696 SDValue Mask = Op.getOperand(3);
16697 SDValue Index = Op.getOperand(4);
16698 SDValue Src = Op.getOperand(5);
16699 SDValue Scale = Op.getOperand(6);
16700 return getScatterNode(IntrData->Opc0, Op, DAG, Src, Mask, Base, Index, Scale, Chain);
16703 SDValue Hint = Op.getOperand(6);
16705 if (dyn_cast<ConstantSDNode> (Hint) == nullptr ||
16706 (HintVal = dyn_cast<ConstantSDNode> (Hint)->getZExtValue()) > 1)
16707 llvm_unreachable("Wrong prefetch hint in intrinsic: should be 0 or 1");
16708 unsigned Opcode = (HintVal ? IntrData->Opc1 : IntrData->Opc0);
16709 SDValue Chain = Op.getOperand(0);
16710 SDValue Mask = Op.getOperand(2);
16711 SDValue Index = Op.getOperand(3);
16712 SDValue Base = Op.getOperand(4);
16713 SDValue Scale = Op.getOperand(5);
16714 return getPrefetchNode(Opcode, Op, DAG, Mask, Base, Index, Scale, Chain);
16716 // Read Time Stamp Counter (RDTSC) and Processor ID (RDTSCP).
16718 SmallVector<SDValue, 2> Results;
16719 getReadTimeStampCounter(Op.getNode(), dl, IntrData->Opc0, DAG, Subtarget, Results);
16720 return DAG.getMergeValues(Results, dl);
16722 // Read Performance Monitoring Counters.
16724 SmallVector<SDValue, 2> Results;
16725 getReadPerformanceCounter(Op.getNode(), dl, DAG, Subtarget, Results);
16726 return DAG.getMergeValues(Results, dl);
16728 // XTEST intrinsics.
16730 SDVTList VTs = DAG.getVTList(Op->getValueType(0), MVT::Other);
16731 SDValue InTrans = DAG.getNode(IntrData->Opc0, dl, VTs, Op.getOperand(0));
16732 SDValue SetCC = DAG.getNode(X86ISD::SETCC, dl, MVT::i8,
16733 DAG.getConstant(X86::COND_NE, MVT::i8),
16735 SDValue Ret = DAG.getNode(ISD::ZERO_EXTEND, dl, Op->getValueType(0), SetCC);
16736 return DAG.getNode(ISD::MERGE_VALUES, dl, Op->getVTList(),
16737 Ret, SDValue(InTrans.getNode(), 1));
16741 SmallVector<SDValue, 2> Results;
16742 SDVTList CFVTs = DAG.getVTList(Op->getValueType(0), MVT::Other);
16743 SDVTList VTs = DAG.getVTList(Op.getOperand(3)->getValueType(0), MVT::Other);
16744 SDValue GenCF = DAG.getNode(X86ISD::ADD, dl, CFVTs, Op.getOperand(2),
16745 DAG.getConstant(-1, MVT::i8));
16746 SDValue Res = DAG.getNode(IntrData->Opc0, dl, VTs, Op.getOperand(3),
16747 Op.getOperand(4), GenCF.getValue(1));
16748 SDValue Store = DAG.getStore(Op.getOperand(0), dl, Res.getValue(0),
16749 Op.getOperand(5), MachinePointerInfo(),
16751 SDValue SetCC = DAG.getNode(X86ISD::SETCC, dl, MVT::i8,
16752 DAG.getConstant(X86::COND_B, MVT::i8),
16754 Results.push_back(SetCC);
16755 Results.push_back(Store);
16756 return DAG.getMergeValues(Results, dl);
16761 SDValue X86TargetLowering::LowerRETURNADDR(SDValue Op,
16762 SelectionDAG &DAG) const {
16763 MachineFrameInfo *MFI = DAG.getMachineFunction().getFrameInfo();
16764 MFI->setReturnAddressIsTaken(true);
16766 if (verifyReturnAddressArgumentIsConstant(Op, DAG))
16769 unsigned Depth = cast<ConstantSDNode>(Op.getOperand(0))->getZExtValue();
16771 EVT PtrVT = getPointerTy();
16774 SDValue FrameAddr = LowerFRAMEADDR(Op, DAG);
16775 const X86RegisterInfo *RegInfo = static_cast<const X86RegisterInfo *>(
16776 DAG.getSubtarget().getRegisterInfo());
16777 SDValue Offset = DAG.getConstant(RegInfo->getSlotSize(), PtrVT);
16778 return DAG.getLoad(PtrVT, dl, DAG.getEntryNode(),
16779 DAG.getNode(ISD::ADD, dl, PtrVT,
16780 FrameAddr, Offset),
16781 MachinePointerInfo(), false, false, false, 0);
16784 // Just load the return address.
16785 SDValue RetAddrFI = getReturnAddressFrameIndex(DAG);
16786 return DAG.getLoad(PtrVT, dl, DAG.getEntryNode(),
16787 RetAddrFI, MachinePointerInfo(), false, false, false, 0);
16790 SDValue X86TargetLowering::LowerFRAMEADDR(SDValue Op, SelectionDAG &DAG) const {
16791 MachineFrameInfo *MFI = DAG.getMachineFunction().getFrameInfo();
16792 MFI->setFrameAddressIsTaken(true);
16794 EVT VT = Op.getValueType();
16795 SDLoc dl(Op); // FIXME probably not meaningful
16796 unsigned Depth = cast<ConstantSDNode>(Op.getOperand(0))->getZExtValue();
16797 const X86RegisterInfo *RegInfo = static_cast<const X86RegisterInfo *>(
16798 DAG.getSubtarget().getRegisterInfo());
16799 unsigned FrameReg = RegInfo->getFrameRegister(DAG.getMachineFunction());
16800 assert(((FrameReg == X86::RBP && VT == MVT::i64) ||
16801 (FrameReg == X86::EBP && VT == MVT::i32)) &&
16802 "Invalid Frame Register!");
16803 SDValue FrameAddr = DAG.getCopyFromReg(DAG.getEntryNode(), dl, FrameReg, VT);
16805 FrameAddr = DAG.getLoad(VT, dl, DAG.getEntryNode(), FrameAddr,
16806 MachinePointerInfo(),
16807 false, false, false, 0);
16811 // FIXME? Maybe this could be a TableGen attribute on some registers and
16812 // this table could be generated automatically from RegInfo.
16813 unsigned X86TargetLowering::getRegisterByName(const char* RegName,
16815 unsigned Reg = StringSwitch<unsigned>(RegName)
16816 .Case("esp", X86::ESP)
16817 .Case("rsp", X86::RSP)
16821 report_fatal_error("Invalid register name global variable");
16824 SDValue X86TargetLowering::LowerFRAME_TO_ARGS_OFFSET(SDValue Op,
16825 SelectionDAG &DAG) const {
16826 const X86RegisterInfo *RegInfo = static_cast<const X86RegisterInfo *>(
16827 DAG.getSubtarget().getRegisterInfo());
16828 return DAG.getIntPtrConstant(2 * RegInfo->getSlotSize());
16831 SDValue X86TargetLowering::LowerEH_RETURN(SDValue Op, SelectionDAG &DAG) const {
16832 SDValue Chain = Op.getOperand(0);
16833 SDValue Offset = Op.getOperand(1);
16834 SDValue Handler = Op.getOperand(2);
16837 EVT PtrVT = getPointerTy();
16838 const X86RegisterInfo *RegInfo = static_cast<const X86RegisterInfo *>(
16839 DAG.getSubtarget().getRegisterInfo());
16840 unsigned FrameReg = RegInfo->getFrameRegister(DAG.getMachineFunction());
16841 assert(((FrameReg == X86::RBP && PtrVT == MVT::i64) ||
16842 (FrameReg == X86::EBP && PtrVT == MVT::i32)) &&
16843 "Invalid Frame Register!");
16844 SDValue Frame = DAG.getCopyFromReg(DAG.getEntryNode(), dl, FrameReg, PtrVT);
16845 unsigned StoreAddrReg = (PtrVT == MVT::i64) ? X86::RCX : X86::ECX;
16847 SDValue StoreAddr = DAG.getNode(ISD::ADD, dl, PtrVT, Frame,
16848 DAG.getIntPtrConstant(RegInfo->getSlotSize()));
16849 StoreAddr = DAG.getNode(ISD::ADD, dl, PtrVT, StoreAddr, Offset);
16850 Chain = DAG.getStore(Chain, dl, Handler, StoreAddr, MachinePointerInfo(),
16852 Chain = DAG.getCopyToReg(Chain, dl, StoreAddrReg, StoreAddr);
16854 return DAG.getNode(X86ISD::EH_RETURN, dl, MVT::Other, Chain,
16855 DAG.getRegister(StoreAddrReg, PtrVT));
16858 SDValue X86TargetLowering::lowerEH_SJLJ_SETJMP(SDValue Op,
16859 SelectionDAG &DAG) const {
16861 return DAG.getNode(X86ISD::EH_SJLJ_SETJMP, DL,
16862 DAG.getVTList(MVT::i32, MVT::Other),
16863 Op.getOperand(0), Op.getOperand(1));
16866 SDValue X86TargetLowering::lowerEH_SJLJ_LONGJMP(SDValue Op,
16867 SelectionDAG &DAG) const {
16869 return DAG.getNode(X86ISD::EH_SJLJ_LONGJMP, DL, MVT::Other,
16870 Op.getOperand(0), Op.getOperand(1));
16873 static SDValue LowerADJUST_TRAMPOLINE(SDValue Op, SelectionDAG &DAG) {
16874 return Op.getOperand(0);
16877 SDValue X86TargetLowering::LowerINIT_TRAMPOLINE(SDValue Op,
16878 SelectionDAG &DAG) const {
16879 SDValue Root = Op.getOperand(0);
16880 SDValue Trmp = Op.getOperand(1); // trampoline
16881 SDValue FPtr = Op.getOperand(2); // nested function
16882 SDValue Nest = Op.getOperand(3); // 'nest' parameter value
16885 const Value *TrmpAddr = cast<SrcValueSDNode>(Op.getOperand(4))->getValue();
16886 const TargetRegisterInfo *TRI = DAG.getSubtarget().getRegisterInfo();
16888 if (Subtarget->is64Bit()) {
16889 SDValue OutChains[6];
16891 // Large code-model.
16892 const unsigned char JMP64r = 0xFF; // 64-bit jmp through register opcode.
16893 const unsigned char MOV64ri = 0xB8; // X86::MOV64ri opcode.
16895 const unsigned char N86R10 = TRI->getEncodingValue(X86::R10) & 0x7;
16896 const unsigned char N86R11 = TRI->getEncodingValue(X86::R11) & 0x7;
16898 const unsigned char REX_WB = 0x40 | 0x08 | 0x01; // REX prefix
16900 // Load the pointer to the nested function into R11.
16901 unsigned OpCode = ((MOV64ri | N86R11) << 8) | REX_WB; // movabsq r11
16902 SDValue Addr = Trmp;
16903 OutChains[0] = DAG.getStore(Root, dl, DAG.getConstant(OpCode, MVT::i16),
16904 Addr, MachinePointerInfo(TrmpAddr),
16907 Addr = DAG.getNode(ISD::ADD, dl, MVT::i64, Trmp,
16908 DAG.getConstant(2, MVT::i64));
16909 OutChains[1] = DAG.getStore(Root, dl, FPtr, Addr,
16910 MachinePointerInfo(TrmpAddr, 2),
16913 // Load the 'nest' parameter value into R10.
16914 // R10 is specified in X86CallingConv.td
16915 OpCode = ((MOV64ri | N86R10) << 8) | REX_WB; // movabsq r10
16916 Addr = DAG.getNode(ISD::ADD, dl, MVT::i64, Trmp,
16917 DAG.getConstant(10, MVT::i64));
16918 OutChains[2] = DAG.getStore(Root, dl, DAG.getConstant(OpCode, MVT::i16),
16919 Addr, MachinePointerInfo(TrmpAddr, 10),
16922 Addr = DAG.getNode(ISD::ADD, dl, MVT::i64, Trmp,
16923 DAG.getConstant(12, MVT::i64));
16924 OutChains[3] = DAG.getStore(Root, dl, Nest, Addr,
16925 MachinePointerInfo(TrmpAddr, 12),
16928 // Jump to the nested function.
16929 OpCode = (JMP64r << 8) | REX_WB; // jmpq *...
16930 Addr = DAG.getNode(ISD::ADD, dl, MVT::i64, Trmp,
16931 DAG.getConstant(20, MVT::i64));
16932 OutChains[4] = DAG.getStore(Root, dl, DAG.getConstant(OpCode, MVT::i16),
16933 Addr, MachinePointerInfo(TrmpAddr, 20),
16936 unsigned char ModRM = N86R11 | (4 << 3) | (3 << 6); // ...r11
16937 Addr = DAG.getNode(ISD::ADD, dl, MVT::i64, Trmp,
16938 DAG.getConstant(22, MVT::i64));
16939 OutChains[5] = DAG.getStore(Root, dl, DAG.getConstant(ModRM, MVT::i8), Addr,
16940 MachinePointerInfo(TrmpAddr, 22),
16943 return DAG.getNode(ISD::TokenFactor, dl, MVT::Other, OutChains);
16945 const Function *Func =
16946 cast<Function>(cast<SrcValueSDNode>(Op.getOperand(5))->getValue());
16947 CallingConv::ID CC = Func->getCallingConv();
16952 llvm_unreachable("Unsupported calling convention");
16953 case CallingConv::C:
16954 case CallingConv::X86_StdCall: {
16955 // Pass 'nest' parameter in ECX.
16956 // Must be kept in sync with X86CallingConv.td
16957 NestReg = X86::ECX;
16959 // Check that ECX wasn't needed by an 'inreg' parameter.
16960 FunctionType *FTy = Func->getFunctionType();
16961 const AttributeSet &Attrs = Func->getAttributes();
16963 if (!Attrs.isEmpty() && !Func->isVarArg()) {
16964 unsigned InRegCount = 0;
16967 for (FunctionType::param_iterator I = FTy->param_begin(),
16968 E = FTy->param_end(); I != E; ++I, ++Idx)
16969 if (Attrs.hasAttribute(Idx, Attribute::InReg))
16970 // FIXME: should only count parameters that are lowered to integers.
16971 InRegCount += (TD->getTypeSizeInBits(*I) + 31) / 32;
16973 if (InRegCount > 2) {
16974 report_fatal_error("Nest register in use - reduce number of inreg"
16980 case CallingConv::X86_FastCall:
16981 case CallingConv::X86_ThisCall:
16982 case CallingConv::Fast:
16983 // Pass 'nest' parameter in EAX.
16984 // Must be kept in sync with X86CallingConv.td
16985 NestReg = X86::EAX;
16989 SDValue OutChains[4];
16990 SDValue Addr, Disp;
16992 Addr = DAG.getNode(ISD::ADD, dl, MVT::i32, Trmp,
16993 DAG.getConstant(10, MVT::i32));
16994 Disp = DAG.getNode(ISD::SUB, dl, MVT::i32, FPtr, Addr);
16996 // This is storing the opcode for MOV32ri.
16997 const unsigned char MOV32ri = 0xB8; // X86::MOV32ri's opcode byte.
16998 const unsigned char N86Reg = TRI->getEncodingValue(NestReg) & 0x7;
16999 OutChains[0] = DAG.getStore(Root, dl,
17000 DAG.getConstant(MOV32ri|N86Reg, MVT::i8),
17001 Trmp, MachinePointerInfo(TrmpAddr),
17004 Addr = DAG.getNode(ISD::ADD, dl, MVT::i32, Trmp,
17005 DAG.getConstant(1, MVT::i32));
17006 OutChains[1] = DAG.getStore(Root, dl, Nest, Addr,
17007 MachinePointerInfo(TrmpAddr, 1),
17010 const unsigned char JMP = 0xE9; // jmp <32bit dst> opcode.
17011 Addr = DAG.getNode(ISD::ADD, dl, MVT::i32, Trmp,
17012 DAG.getConstant(5, MVT::i32));
17013 OutChains[2] = DAG.getStore(Root, dl, DAG.getConstant(JMP, MVT::i8), Addr,
17014 MachinePointerInfo(TrmpAddr, 5),
17017 Addr = DAG.getNode(ISD::ADD, dl, MVT::i32, Trmp,
17018 DAG.getConstant(6, MVT::i32));
17019 OutChains[3] = DAG.getStore(Root, dl, Disp, Addr,
17020 MachinePointerInfo(TrmpAddr, 6),
17023 return DAG.getNode(ISD::TokenFactor, dl, MVT::Other, OutChains);
17027 SDValue X86TargetLowering::LowerFLT_ROUNDS_(SDValue Op,
17028 SelectionDAG &DAG) const {
17030 The rounding mode is in bits 11:10 of FPSR, and has the following
17032 00 Round to nearest
17037 FLT_ROUNDS, on the other hand, expects the following:
17044 To perform the conversion, we do:
17045 (((((FPSR & 0x800) >> 11) | ((FPSR & 0x400) >> 9)) + 1) & 3)
17048 MachineFunction &MF = DAG.getMachineFunction();
17049 const TargetMachine &TM = MF.getTarget();
17050 const TargetFrameLowering &TFI = *TM.getSubtargetImpl()->getFrameLowering();
17051 unsigned StackAlignment = TFI.getStackAlignment();
17052 MVT VT = Op.getSimpleValueType();
17055 // Save FP Control Word to stack slot
17056 int SSFI = MF.getFrameInfo()->CreateStackObject(2, StackAlignment, false);
17057 SDValue StackSlot = DAG.getFrameIndex(SSFI, getPointerTy());
17059 MachineMemOperand *MMO =
17060 MF.getMachineMemOperand(MachinePointerInfo::getFixedStack(SSFI),
17061 MachineMemOperand::MOStore, 2, 2);
17063 SDValue Ops[] = { DAG.getEntryNode(), StackSlot };
17064 SDValue Chain = DAG.getMemIntrinsicNode(X86ISD::FNSTCW16m, DL,
17065 DAG.getVTList(MVT::Other),
17066 Ops, MVT::i16, MMO);
17068 // Load FP Control Word from stack slot
17069 SDValue CWD = DAG.getLoad(MVT::i16, DL, Chain, StackSlot,
17070 MachinePointerInfo(), false, false, false, 0);
17072 // Transform as necessary
17074 DAG.getNode(ISD::SRL, DL, MVT::i16,
17075 DAG.getNode(ISD::AND, DL, MVT::i16,
17076 CWD, DAG.getConstant(0x800, MVT::i16)),
17077 DAG.getConstant(11, MVT::i8));
17079 DAG.getNode(ISD::SRL, DL, MVT::i16,
17080 DAG.getNode(ISD::AND, DL, MVT::i16,
17081 CWD, DAG.getConstant(0x400, MVT::i16)),
17082 DAG.getConstant(9, MVT::i8));
17085 DAG.getNode(ISD::AND, DL, MVT::i16,
17086 DAG.getNode(ISD::ADD, DL, MVT::i16,
17087 DAG.getNode(ISD::OR, DL, MVT::i16, CWD1, CWD2),
17088 DAG.getConstant(1, MVT::i16)),
17089 DAG.getConstant(3, MVT::i16));
17091 return DAG.getNode((VT.getSizeInBits() < 16 ?
17092 ISD::TRUNCATE : ISD::ZERO_EXTEND), DL, VT, RetVal);
17095 static SDValue LowerCTLZ(SDValue Op, SelectionDAG &DAG) {
17096 MVT VT = Op.getSimpleValueType();
17098 unsigned NumBits = VT.getSizeInBits();
17101 Op = Op.getOperand(0);
17102 if (VT == MVT::i8) {
17103 // Zero extend to i32 since there is not an i8 bsr.
17105 Op = DAG.getNode(ISD::ZERO_EXTEND, dl, OpVT, Op);
17108 // Issue a bsr (scan bits in reverse) which also sets EFLAGS.
17109 SDVTList VTs = DAG.getVTList(OpVT, MVT::i32);
17110 Op = DAG.getNode(X86ISD::BSR, dl, VTs, Op);
17112 // If src is zero (i.e. bsr sets ZF), returns NumBits.
17115 DAG.getConstant(NumBits+NumBits-1, OpVT),
17116 DAG.getConstant(X86::COND_E, MVT::i8),
17119 Op = DAG.getNode(X86ISD::CMOV, dl, OpVT, Ops);
17121 // Finally xor with NumBits-1.
17122 Op = DAG.getNode(ISD::XOR, dl, OpVT, Op, DAG.getConstant(NumBits-1, OpVT));
17125 Op = DAG.getNode(ISD::TRUNCATE, dl, MVT::i8, Op);
17129 static SDValue LowerCTLZ_ZERO_UNDEF(SDValue Op, SelectionDAG &DAG) {
17130 MVT VT = Op.getSimpleValueType();
17132 unsigned NumBits = VT.getSizeInBits();
17135 Op = Op.getOperand(0);
17136 if (VT == MVT::i8) {
17137 // Zero extend to i32 since there is not an i8 bsr.
17139 Op = DAG.getNode(ISD::ZERO_EXTEND, dl, OpVT, Op);
17142 // Issue a bsr (scan bits in reverse).
17143 SDVTList VTs = DAG.getVTList(OpVT, MVT::i32);
17144 Op = DAG.getNode(X86ISD::BSR, dl, VTs, Op);
17146 // And xor with NumBits-1.
17147 Op = DAG.getNode(ISD::XOR, dl, OpVT, Op, DAG.getConstant(NumBits-1, OpVT));
17150 Op = DAG.getNode(ISD::TRUNCATE, dl, MVT::i8, Op);
17154 static SDValue LowerCTTZ(SDValue Op, SelectionDAG &DAG) {
17155 MVT VT = Op.getSimpleValueType();
17156 unsigned NumBits = VT.getSizeInBits();
17158 Op = Op.getOperand(0);
17160 // Issue a bsf (scan bits forward) which also sets EFLAGS.
17161 SDVTList VTs = DAG.getVTList(VT, MVT::i32);
17162 Op = DAG.getNode(X86ISD::BSF, dl, VTs, Op);
17164 // If src is zero (i.e. bsf sets ZF), returns NumBits.
17167 DAG.getConstant(NumBits, VT),
17168 DAG.getConstant(X86::COND_E, MVT::i8),
17171 return DAG.getNode(X86ISD::CMOV, dl, VT, Ops);
17174 // Lower256IntArith - Break a 256-bit integer operation into two new 128-bit
17175 // ones, and then concatenate the result back.
17176 static SDValue Lower256IntArith(SDValue Op, SelectionDAG &DAG) {
17177 MVT VT = Op.getSimpleValueType();
17179 assert(VT.is256BitVector() && VT.isInteger() &&
17180 "Unsupported value type for operation");
17182 unsigned NumElems = VT.getVectorNumElements();
17185 // Extract the LHS vectors
17186 SDValue LHS = Op.getOperand(0);
17187 SDValue LHS1 = Extract128BitVector(LHS, 0, DAG, dl);
17188 SDValue LHS2 = Extract128BitVector(LHS, NumElems/2, DAG, dl);
17190 // Extract the RHS vectors
17191 SDValue RHS = Op.getOperand(1);
17192 SDValue RHS1 = Extract128BitVector(RHS, 0, DAG, dl);
17193 SDValue RHS2 = Extract128BitVector(RHS, NumElems/2, DAG, dl);
17195 MVT EltVT = VT.getVectorElementType();
17196 MVT NewVT = MVT::getVectorVT(EltVT, NumElems/2);
17198 return DAG.getNode(ISD::CONCAT_VECTORS, dl, VT,
17199 DAG.getNode(Op.getOpcode(), dl, NewVT, LHS1, RHS1),
17200 DAG.getNode(Op.getOpcode(), dl, NewVT, LHS2, RHS2));
17203 static SDValue LowerADD(SDValue Op, SelectionDAG &DAG) {
17204 assert(Op.getSimpleValueType().is256BitVector() &&
17205 Op.getSimpleValueType().isInteger() &&
17206 "Only handle AVX 256-bit vector integer operation");
17207 return Lower256IntArith(Op, DAG);
17210 static SDValue LowerSUB(SDValue Op, SelectionDAG &DAG) {
17211 assert(Op.getSimpleValueType().is256BitVector() &&
17212 Op.getSimpleValueType().isInteger() &&
17213 "Only handle AVX 256-bit vector integer operation");
17214 return Lower256IntArith(Op, DAG);
17217 static SDValue LowerMUL(SDValue Op, const X86Subtarget *Subtarget,
17218 SelectionDAG &DAG) {
17220 MVT VT = Op.getSimpleValueType();
17222 // Decompose 256-bit ops into smaller 128-bit ops.
17223 if (VT.is256BitVector() && !Subtarget->hasInt256())
17224 return Lower256IntArith(Op, DAG);
17226 SDValue A = Op.getOperand(0);
17227 SDValue B = Op.getOperand(1);
17229 // Lower v4i32 mul as 2x shuffle, 2x pmuludq, 2x shuffle.
17230 if (VT == MVT::v4i32) {
17231 assert(Subtarget->hasSSE2() && !Subtarget->hasSSE41() &&
17232 "Should not custom lower when pmuldq is available!");
17234 // Extract the odd parts.
17235 static const int UnpackMask[] = { 1, -1, 3, -1 };
17236 SDValue Aodds = DAG.getVectorShuffle(VT, dl, A, A, UnpackMask);
17237 SDValue Bodds = DAG.getVectorShuffle(VT, dl, B, B, UnpackMask);
17239 // Multiply the even parts.
17240 SDValue Evens = DAG.getNode(X86ISD::PMULUDQ, dl, MVT::v2i64, A, B);
17241 // Now multiply odd parts.
17242 SDValue Odds = DAG.getNode(X86ISD::PMULUDQ, dl, MVT::v2i64, Aodds, Bodds);
17244 Evens = DAG.getNode(ISD::BITCAST, dl, VT, Evens);
17245 Odds = DAG.getNode(ISD::BITCAST, dl, VT, Odds);
17247 // Merge the two vectors back together with a shuffle. This expands into 2
17249 static const int ShufMask[] = { 0, 4, 2, 6 };
17250 return DAG.getVectorShuffle(VT, dl, Evens, Odds, ShufMask);
17253 assert((VT == MVT::v2i64 || VT == MVT::v4i64 || VT == MVT::v8i64) &&
17254 "Only know how to lower V2I64/V4I64/V8I64 multiply");
17256 // Ahi = psrlqi(a, 32);
17257 // Bhi = psrlqi(b, 32);
17259 // AloBlo = pmuludq(a, b);
17260 // AloBhi = pmuludq(a, Bhi);
17261 // AhiBlo = pmuludq(Ahi, b);
17263 // AloBhi = psllqi(AloBhi, 32);
17264 // AhiBlo = psllqi(AhiBlo, 32);
17265 // return AloBlo + AloBhi + AhiBlo;
17267 SDValue Ahi = getTargetVShiftByConstNode(X86ISD::VSRLI, dl, VT, A, 32, DAG);
17268 SDValue Bhi = getTargetVShiftByConstNode(X86ISD::VSRLI, dl, VT, B, 32, DAG);
17270 // Bit cast to 32-bit vectors for MULUDQ
17271 EVT MulVT = (VT == MVT::v2i64) ? MVT::v4i32 :
17272 (VT == MVT::v4i64) ? MVT::v8i32 : MVT::v16i32;
17273 A = DAG.getNode(ISD::BITCAST, dl, MulVT, A);
17274 B = DAG.getNode(ISD::BITCAST, dl, MulVT, B);
17275 Ahi = DAG.getNode(ISD::BITCAST, dl, MulVT, Ahi);
17276 Bhi = DAG.getNode(ISD::BITCAST, dl, MulVT, Bhi);
17278 SDValue AloBlo = DAG.getNode(X86ISD::PMULUDQ, dl, VT, A, B);
17279 SDValue AloBhi = DAG.getNode(X86ISD::PMULUDQ, dl, VT, A, Bhi);
17280 SDValue AhiBlo = DAG.getNode(X86ISD::PMULUDQ, dl, VT, Ahi, B);
17282 AloBhi = getTargetVShiftByConstNode(X86ISD::VSHLI, dl, VT, AloBhi, 32, DAG);
17283 AhiBlo = getTargetVShiftByConstNode(X86ISD::VSHLI, dl, VT, AhiBlo, 32, DAG);
17285 SDValue Res = DAG.getNode(ISD::ADD, dl, VT, AloBlo, AloBhi);
17286 return DAG.getNode(ISD::ADD, dl, VT, Res, AhiBlo);
17289 SDValue X86TargetLowering::LowerWin64_i128OP(SDValue Op, SelectionDAG &DAG) const {
17290 assert(Subtarget->isTargetWin64() && "Unexpected target");
17291 EVT VT = Op.getValueType();
17292 assert(VT.isInteger() && VT.getSizeInBits() == 128 &&
17293 "Unexpected return type for lowering");
17297 switch (Op->getOpcode()) {
17298 default: llvm_unreachable("Unexpected request for libcall!");
17299 case ISD::SDIV: isSigned = true; LC = RTLIB::SDIV_I128; break;
17300 case ISD::UDIV: isSigned = false; LC = RTLIB::UDIV_I128; break;
17301 case ISD::SREM: isSigned = true; LC = RTLIB::SREM_I128; break;
17302 case ISD::UREM: isSigned = false; LC = RTLIB::UREM_I128; break;
17303 case ISD::SDIVREM: isSigned = true; LC = RTLIB::SDIVREM_I128; break;
17304 case ISD::UDIVREM: isSigned = false; LC = RTLIB::UDIVREM_I128; break;
17308 SDValue InChain = DAG.getEntryNode();
17310 TargetLowering::ArgListTy Args;
17311 TargetLowering::ArgListEntry Entry;
17312 for (unsigned i = 0, e = Op->getNumOperands(); i != e; ++i) {
17313 EVT ArgVT = Op->getOperand(i).getValueType();
17314 assert(ArgVT.isInteger() && ArgVT.getSizeInBits() == 128 &&
17315 "Unexpected argument type for lowering");
17316 SDValue StackPtr = DAG.CreateStackTemporary(ArgVT, 16);
17317 Entry.Node = StackPtr;
17318 InChain = DAG.getStore(InChain, dl, Op->getOperand(i), StackPtr, MachinePointerInfo(),
17320 Type *ArgTy = ArgVT.getTypeForEVT(*DAG.getContext());
17321 Entry.Ty = PointerType::get(ArgTy,0);
17322 Entry.isSExt = false;
17323 Entry.isZExt = false;
17324 Args.push_back(Entry);
17327 SDValue Callee = DAG.getExternalSymbol(getLibcallName(LC),
17330 TargetLowering::CallLoweringInfo CLI(DAG);
17331 CLI.setDebugLoc(dl).setChain(InChain)
17332 .setCallee(getLibcallCallingConv(LC),
17333 static_cast<EVT>(MVT::v2i64).getTypeForEVT(*DAG.getContext()),
17334 Callee, std::move(Args), 0)
17335 .setInRegister().setSExtResult(isSigned).setZExtResult(!isSigned);
17337 std::pair<SDValue, SDValue> CallInfo = LowerCallTo(CLI);
17338 return DAG.getNode(ISD::BITCAST, dl, VT, CallInfo.first);
17341 static SDValue LowerMUL_LOHI(SDValue Op, const X86Subtarget *Subtarget,
17342 SelectionDAG &DAG) {
17343 SDValue Op0 = Op.getOperand(0), Op1 = Op.getOperand(1);
17344 EVT VT = Op0.getValueType();
17347 assert((VT == MVT::v4i32 && Subtarget->hasSSE2()) ||
17348 (VT == MVT::v8i32 && Subtarget->hasInt256()));
17350 // PMULxD operations multiply each even value (starting at 0) of LHS with
17351 // the related value of RHS and produce a widen result.
17352 // E.g., PMULUDQ <4 x i32> <a|b|c|d>, <4 x i32> <e|f|g|h>
17353 // => <2 x i64> <ae|cg>
17355 // In other word, to have all the results, we need to perform two PMULxD:
17356 // 1. one with the even values.
17357 // 2. one with the odd values.
17358 // To achieve #2, with need to place the odd values at an even position.
17360 // Place the odd value at an even position (basically, shift all values 1
17361 // step to the left):
17362 const int Mask[] = {1, -1, 3, -1, 5, -1, 7, -1};
17363 // <a|b|c|d> => <b|undef|d|undef>
17364 SDValue Odd0 = DAG.getVectorShuffle(VT, dl, Op0, Op0, Mask);
17365 // <e|f|g|h> => <f|undef|h|undef>
17366 SDValue Odd1 = DAG.getVectorShuffle(VT, dl, Op1, Op1, Mask);
17368 // Emit two multiplies, one for the lower 2 ints and one for the higher 2
17370 MVT MulVT = VT == MVT::v4i32 ? MVT::v2i64 : MVT::v4i64;
17371 bool IsSigned = Op->getOpcode() == ISD::SMUL_LOHI;
17373 (!IsSigned || !Subtarget->hasSSE41()) ? X86ISD::PMULUDQ : X86ISD::PMULDQ;
17374 // PMULUDQ <4 x i32> <a|b|c|d>, <4 x i32> <e|f|g|h>
17375 // => <2 x i64> <ae|cg>
17376 SDValue Mul1 = DAG.getNode(ISD::BITCAST, dl, VT,
17377 DAG.getNode(Opcode, dl, MulVT, Op0, Op1));
17378 // PMULUDQ <4 x i32> <b|undef|d|undef>, <4 x i32> <f|undef|h|undef>
17379 // => <2 x i64> <bf|dh>
17380 SDValue Mul2 = DAG.getNode(ISD::BITCAST, dl, VT,
17381 DAG.getNode(Opcode, dl, MulVT, Odd0, Odd1));
17383 // Shuffle it back into the right order.
17384 SDValue Highs, Lows;
17385 if (VT == MVT::v8i32) {
17386 const int HighMask[] = {1, 9, 3, 11, 5, 13, 7, 15};
17387 Highs = DAG.getVectorShuffle(VT, dl, Mul1, Mul2, HighMask);
17388 const int LowMask[] = {0, 8, 2, 10, 4, 12, 6, 14};
17389 Lows = DAG.getVectorShuffle(VT, dl, Mul1, Mul2, LowMask);
17391 const int HighMask[] = {1, 5, 3, 7};
17392 Highs = DAG.getVectorShuffle(VT, dl, Mul1, Mul2, HighMask);
17393 const int LowMask[] = {0, 4, 2, 6};
17394 Lows = DAG.getVectorShuffle(VT, dl, Mul1, Mul2, LowMask);
17397 // If we have a signed multiply but no PMULDQ fix up the high parts of a
17398 // unsigned multiply.
17399 if (IsSigned && !Subtarget->hasSSE41()) {
17401 DAG.getConstant(31, DAG.getTargetLoweringInfo().getShiftAmountTy(VT));
17402 SDValue T1 = DAG.getNode(ISD::AND, dl, VT,
17403 DAG.getNode(ISD::SRA, dl, VT, Op0, ShAmt), Op1);
17404 SDValue T2 = DAG.getNode(ISD::AND, dl, VT,
17405 DAG.getNode(ISD::SRA, dl, VT, Op1, ShAmt), Op0);
17407 SDValue Fixup = DAG.getNode(ISD::ADD, dl, VT, T1, T2);
17408 Highs = DAG.getNode(ISD::SUB, dl, VT, Highs, Fixup);
17411 // The first result of MUL_LOHI is actually the low value, followed by the
17413 SDValue Ops[] = {Lows, Highs};
17414 return DAG.getMergeValues(Ops, dl);
17417 static SDValue LowerScalarImmediateShift(SDValue Op, SelectionDAG &DAG,
17418 const X86Subtarget *Subtarget) {
17419 MVT VT = Op.getSimpleValueType();
17421 SDValue R = Op.getOperand(0);
17422 SDValue Amt = Op.getOperand(1);
17424 // Optimize shl/srl/sra with constant shift amount.
17425 if (auto *BVAmt = dyn_cast<BuildVectorSDNode>(Amt)) {
17426 if (auto *ShiftConst = BVAmt->getConstantSplatNode()) {
17427 uint64_t ShiftAmt = ShiftConst->getZExtValue();
17429 if (VT == MVT::v2i64 || VT == MVT::v4i32 || VT == MVT::v8i16 ||
17430 (Subtarget->hasInt256() &&
17431 (VT == MVT::v4i64 || VT == MVT::v8i32 || VT == MVT::v16i16)) ||
17432 (Subtarget->hasAVX512() &&
17433 (VT == MVT::v8i64 || VT == MVT::v16i32))) {
17434 if (Op.getOpcode() == ISD::SHL)
17435 return getTargetVShiftByConstNode(X86ISD::VSHLI, dl, VT, R, ShiftAmt,
17437 if (Op.getOpcode() == ISD::SRL)
17438 return getTargetVShiftByConstNode(X86ISD::VSRLI, dl, VT, R, ShiftAmt,
17440 if (Op.getOpcode() == ISD::SRA && VT != MVT::v2i64 && VT != MVT::v4i64)
17441 return getTargetVShiftByConstNode(X86ISD::VSRAI, dl, VT, R, ShiftAmt,
17445 if (VT == MVT::v16i8) {
17446 if (Op.getOpcode() == ISD::SHL) {
17447 // Make a large shift.
17448 SDValue SHL = getTargetVShiftByConstNode(X86ISD::VSHLI, dl,
17449 MVT::v8i16, R, ShiftAmt,
17451 SHL = DAG.getNode(ISD::BITCAST, dl, VT, SHL);
17452 // Zero out the rightmost bits.
17453 SmallVector<SDValue, 16> V(16,
17454 DAG.getConstant(uint8_t(-1U << ShiftAmt),
17456 return DAG.getNode(ISD::AND, dl, VT, SHL,
17457 DAG.getNode(ISD::BUILD_VECTOR, dl, VT, V));
17459 if (Op.getOpcode() == ISD::SRL) {
17460 // Make a large shift.
17461 SDValue SRL = getTargetVShiftByConstNode(X86ISD::VSRLI, dl,
17462 MVT::v8i16, R, ShiftAmt,
17464 SRL = DAG.getNode(ISD::BITCAST, dl, VT, SRL);
17465 // Zero out the leftmost bits.
17466 SmallVector<SDValue, 16> V(16,
17467 DAG.getConstant(uint8_t(-1U) >> ShiftAmt,
17469 return DAG.getNode(ISD::AND, dl, VT, SRL,
17470 DAG.getNode(ISD::BUILD_VECTOR, dl, VT, V));
17472 if (Op.getOpcode() == ISD::SRA) {
17473 if (ShiftAmt == 7) {
17474 // R s>> 7 === R s< 0
17475 SDValue Zeros = getZeroVector(VT, Subtarget, DAG, dl);
17476 return DAG.getNode(X86ISD::PCMPGT, dl, VT, Zeros, R);
17479 // R s>> a === ((R u>> a) ^ m) - m
17480 SDValue Res = DAG.getNode(ISD::SRL, dl, VT, R, Amt);
17481 SmallVector<SDValue, 16> V(16, DAG.getConstant(128 >> ShiftAmt,
17483 SDValue Mask = DAG.getNode(ISD::BUILD_VECTOR, dl, VT, V);
17484 Res = DAG.getNode(ISD::XOR, dl, VT, Res, Mask);
17485 Res = DAG.getNode(ISD::SUB, dl, VT, Res, Mask);
17488 llvm_unreachable("Unknown shift opcode.");
17491 if (Subtarget->hasInt256() && VT == MVT::v32i8) {
17492 if (Op.getOpcode() == ISD::SHL) {
17493 // Make a large shift.
17494 SDValue SHL = getTargetVShiftByConstNode(X86ISD::VSHLI, dl,
17495 MVT::v16i16, R, ShiftAmt,
17497 SHL = DAG.getNode(ISD::BITCAST, dl, VT, SHL);
17498 // Zero out the rightmost bits.
17499 SmallVector<SDValue, 32> V(32,
17500 DAG.getConstant(uint8_t(-1U << ShiftAmt),
17502 return DAG.getNode(ISD::AND, dl, VT, SHL,
17503 DAG.getNode(ISD::BUILD_VECTOR, dl, VT, V));
17505 if (Op.getOpcode() == ISD::SRL) {
17506 // Make a large shift.
17507 SDValue SRL = getTargetVShiftByConstNode(X86ISD::VSRLI, dl,
17508 MVT::v16i16, R, ShiftAmt,
17510 SRL = DAG.getNode(ISD::BITCAST, dl, VT, SRL);
17511 // Zero out the leftmost bits.
17512 SmallVector<SDValue, 32> V(32,
17513 DAG.getConstant(uint8_t(-1U) >> ShiftAmt,
17515 return DAG.getNode(ISD::AND, dl, VT, SRL,
17516 DAG.getNode(ISD::BUILD_VECTOR, dl, VT, V));
17518 if (Op.getOpcode() == ISD::SRA) {
17519 if (ShiftAmt == 7) {
17520 // R s>> 7 === R s< 0
17521 SDValue Zeros = getZeroVector(VT, Subtarget, DAG, dl);
17522 return DAG.getNode(X86ISD::PCMPGT, dl, VT, Zeros, R);
17525 // R s>> a === ((R u>> a) ^ m) - m
17526 SDValue Res = DAG.getNode(ISD::SRL, dl, VT, R, Amt);
17527 SmallVector<SDValue, 32> V(32, DAG.getConstant(128 >> ShiftAmt,
17529 SDValue Mask = DAG.getNode(ISD::BUILD_VECTOR, dl, VT, V);
17530 Res = DAG.getNode(ISD::XOR, dl, VT, Res, Mask);
17531 Res = DAG.getNode(ISD::SUB, dl, VT, Res, Mask);
17534 llvm_unreachable("Unknown shift opcode.");
17539 // Special case in 32-bit mode, where i64 is expanded into high and low parts.
17540 if (!Subtarget->is64Bit() &&
17541 (VT == MVT::v2i64 || (Subtarget->hasInt256() && VT == MVT::v4i64)) &&
17542 Amt.getOpcode() == ISD::BITCAST &&
17543 Amt.getOperand(0).getOpcode() == ISD::BUILD_VECTOR) {
17544 Amt = Amt.getOperand(0);
17545 unsigned Ratio = Amt.getSimpleValueType().getVectorNumElements() /
17546 VT.getVectorNumElements();
17547 unsigned RatioInLog2 = Log2_32_Ceil(Ratio);
17548 uint64_t ShiftAmt = 0;
17549 for (unsigned i = 0; i != Ratio; ++i) {
17550 ConstantSDNode *C = dyn_cast<ConstantSDNode>(Amt.getOperand(i));
17554 ShiftAmt |= C->getZExtValue() << (i * (1 << (6 - RatioInLog2)));
17556 // Check remaining shift amounts.
17557 for (unsigned i = Ratio; i != Amt.getNumOperands(); i += Ratio) {
17558 uint64_t ShAmt = 0;
17559 for (unsigned j = 0; j != Ratio; ++j) {
17560 ConstantSDNode *C =
17561 dyn_cast<ConstantSDNode>(Amt.getOperand(i + j));
17565 ShAmt |= C->getZExtValue() << (j * (1 << (6 - RatioInLog2)));
17567 if (ShAmt != ShiftAmt)
17570 switch (Op.getOpcode()) {
17572 llvm_unreachable("Unknown shift opcode!");
17574 return getTargetVShiftByConstNode(X86ISD::VSHLI, dl, VT, R, ShiftAmt,
17577 return getTargetVShiftByConstNode(X86ISD::VSRLI, dl, VT, R, ShiftAmt,
17580 return getTargetVShiftByConstNode(X86ISD::VSRAI, dl, VT, R, ShiftAmt,
17588 static SDValue LowerScalarVariableShift(SDValue Op, SelectionDAG &DAG,
17589 const X86Subtarget* Subtarget) {
17590 MVT VT = Op.getSimpleValueType();
17592 SDValue R = Op.getOperand(0);
17593 SDValue Amt = Op.getOperand(1);
17595 if ((VT == MVT::v2i64 && Op.getOpcode() != ISD::SRA) ||
17596 VT == MVT::v4i32 || VT == MVT::v8i16 ||
17597 (Subtarget->hasInt256() &&
17598 ((VT == MVT::v4i64 && Op.getOpcode() != ISD::SRA) ||
17599 VT == MVT::v8i32 || VT == MVT::v16i16)) ||
17600 (Subtarget->hasAVX512() && (VT == MVT::v8i64 || VT == MVT::v16i32))) {
17602 EVT EltVT = VT.getVectorElementType();
17604 if (Amt.getOpcode() == ISD::BUILD_VECTOR) {
17605 unsigned NumElts = VT.getVectorNumElements();
17607 for (i = 0; i != NumElts; ++i) {
17608 if (Amt.getOperand(i).getOpcode() == ISD::UNDEF)
17612 for (j = i; j != NumElts; ++j) {
17613 SDValue Arg = Amt.getOperand(j);
17614 if (Arg.getOpcode() == ISD::UNDEF) continue;
17615 if (Arg != Amt.getOperand(i))
17618 if (i != NumElts && j == NumElts)
17619 BaseShAmt = Amt.getOperand(i);
17621 if (Amt.getOpcode() == ISD::EXTRACT_SUBVECTOR)
17622 Amt = Amt.getOperand(0);
17623 if (Amt.getOpcode() == ISD::VECTOR_SHUFFLE &&
17624 cast<ShuffleVectorSDNode>(Amt)->isSplat()) {
17625 SDValue InVec = Amt.getOperand(0);
17626 if (InVec.getOpcode() == ISD::BUILD_VECTOR) {
17627 unsigned NumElts = InVec.getValueType().getVectorNumElements();
17629 for (; i != NumElts; ++i) {
17630 SDValue Arg = InVec.getOperand(i);
17631 if (Arg.getOpcode() == ISD::UNDEF) continue;
17635 } else if (InVec.getOpcode() == ISD::INSERT_VECTOR_ELT) {
17636 if (ConstantSDNode *C =
17637 dyn_cast<ConstantSDNode>(InVec.getOperand(2))) {
17638 unsigned SplatIdx =
17639 cast<ShuffleVectorSDNode>(Amt)->getSplatIndex();
17640 if (C->getZExtValue() == SplatIdx)
17641 BaseShAmt = InVec.getOperand(1);
17644 if (!BaseShAmt.getNode())
17645 BaseShAmt = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, EltVT, Amt,
17646 DAG.getIntPtrConstant(0));
17650 if (BaseShAmt.getNode()) {
17651 if (EltVT.bitsGT(MVT::i32))
17652 BaseShAmt = DAG.getNode(ISD::TRUNCATE, dl, MVT::i32, BaseShAmt);
17653 else if (EltVT.bitsLT(MVT::i32))
17654 BaseShAmt = DAG.getNode(ISD::ZERO_EXTEND, dl, MVT::i32, BaseShAmt);
17656 switch (Op.getOpcode()) {
17658 llvm_unreachable("Unknown shift opcode!");
17660 switch (VT.SimpleTy) {
17661 default: return SDValue();
17670 return getTargetVShiftNode(X86ISD::VSHLI, dl, VT, R, BaseShAmt, DAG);
17673 switch (VT.SimpleTy) {
17674 default: return SDValue();
17681 return getTargetVShiftNode(X86ISD::VSRAI, dl, VT, R, BaseShAmt, DAG);
17684 switch (VT.SimpleTy) {
17685 default: return SDValue();
17694 return getTargetVShiftNode(X86ISD::VSRLI, dl, VT, R, BaseShAmt, DAG);
17700 // Special case in 32-bit mode, where i64 is expanded into high and low parts.
17701 if (!Subtarget->is64Bit() &&
17702 (VT == MVT::v2i64 || (Subtarget->hasInt256() && VT == MVT::v4i64) ||
17703 (Subtarget->hasAVX512() && VT == MVT::v8i64)) &&
17704 Amt.getOpcode() == ISD::BITCAST &&
17705 Amt.getOperand(0).getOpcode() == ISD::BUILD_VECTOR) {
17706 Amt = Amt.getOperand(0);
17707 unsigned Ratio = Amt.getSimpleValueType().getVectorNumElements() /
17708 VT.getVectorNumElements();
17709 std::vector<SDValue> Vals(Ratio);
17710 for (unsigned i = 0; i != Ratio; ++i)
17711 Vals[i] = Amt.getOperand(i);
17712 for (unsigned i = Ratio; i != Amt.getNumOperands(); i += Ratio) {
17713 for (unsigned j = 0; j != Ratio; ++j)
17714 if (Vals[j] != Amt.getOperand(i + j))
17717 switch (Op.getOpcode()) {
17719 llvm_unreachable("Unknown shift opcode!");
17721 return DAG.getNode(X86ISD::VSHL, dl, VT, R, Op.getOperand(1));
17723 return DAG.getNode(X86ISD::VSRL, dl, VT, R, Op.getOperand(1));
17725 return DAG.getNode(X86ISD::VSRA, dl, VT, R, Op.getOperand(1));
17732 static SDValue LowerShift(SDValue Op, const X86Subtarget* Subtarget,
17733 SelectionDAG &DAG) {
17734 MVT VT = Op.getSimpleValueType();
17736 SDValue R = Op.getOperand(0);
17737 SDValue Amt = Op.getOperand(1);
17740 assert(VT.isVector() && "Custom lowering only for vector shifts!");
17741 assert(Subtarget->hasSSE2() && "Only custom lower when we have SSE2!");
17743 V = LowerScalarImmediateShift(Op, DAG, Subtarget);
17747 V = LowerScalarVariableShift(Op, DAG, Subtarget);
17751 if (Subtarget->hasAVX512() && (VT == MVT::v16i32 || VT == MVT::v8i64))
17753 // AVX2 has VPSLLV/VPSRAV/VPSRLV.
17754 if (Subtarget->hasInt256()) {
17755 if (Op.getOpcode() == ISD::SRL &&
17756 (VT == MVT::v2i64 || VT == MVT::v4i32 ||
17757 VT == MVT::v4i64 || VT == MVT::v8i32))
17759 if (Op.getOpcode() == ISD::SHL &&
17760 (VT == MVT::v2i64 || VT == MVT::v4i32 ||
17761 VT == MVT::v4i64 || VT == MVT::v8i32))
17763 if (Op.getOpcode() == ISD::SRA && (VT == MVT::v4i32 || VT == MVT::v8i32))
17767 // If possible, lower this packed shift into a vector multiply instead of
17768 // expanding it into a sequence of scalar shifts.
17769 // Do this only if the vector shift count is a constant build_vector.
17770 if (Op.getOpcode() == ISD::SHL &&
17771 (VT == MVT::v8i16 || VT == MVT::v4i32 ||
17772 (Subtarget->hasInt256() && VT == MVT::v16i16)) &&
17773 ISD::isBuildVectorOfConstantSDNodes(Amt.getNode())) {
17774 SmallVector<SDValue, 8> Elts;
17775 EVT SVT = VT.getScalarType();
17776 unsigned SVTBits = SVT.getSizeInBits();
17777 const APInt &One = APInt(SVTBits, 1);
17778 unsigned NumElems = VT.getVectorNumElements();
17780 for (unsigned i=0; i !=NumElems; ++i) {
17781 SDValue Op = Amt->getOperand(i);
17782 if (Op->getOpcode() == ISD::UNDEF) {
17783 Elts.push_back(Op);
17787 ConstantSDNode *ND = cast<ConstantSDNode>(Op);
17788 const APInt &C = APInt(SVTBits, ND->getAPIntValue().getZExtValue());
17789 uint64_t ShAmt = C.getZExtValue();
17790 if (ShAmt >= SVTBits) {
17791 Elts.push_back(DAG.getUNDEF(SVT));
17794 Elts.push_back(DAG.getConstant(One.shl(ShAmt), SVT));
17796 SDValue BV = DAG.getNode(ISD::BUILD_VECTOR, dl, VT, Elts);
17797 return DAG.getNode(ISD::MUL, dl, VT, R, BV);
17800 // Lower SHL with variable shift amount.
17801 if (VT == MVT::v4i32 && Op->getOpcode() == ISD::SHL) {
17802 Op = DAG.getNode(ISD::SHL, dl, VT, Amt, DAG.getConstant(23, VT));
17804 Op = DAG.getNode(ISD::ADD, dl, VT, Op, DAG.getConstant(0x3f800000U, VT));
17805 Op = DAG.getNode(ISD::BITCAST, dl, MVT::v4f32, Op);
17806 Op = DAG.getNode(ISD::FP_TO_SINT, dl, VT, Op);
17807 return DAG.getNode(ISD::MUL, dl, VT, Op, R);
17810 // If possible, lower this shift as a sequence of two shifts by
17811 // constant plus a MOVSS/MOVSD instead of scalarizing it.
17813 // (v4i32 (srl A, (build_vector < X, Y, Y, Y>)))
17815 // Could be rewritten as:
17816 // (v4i32 (MOVSS (srl A, <Y,Y,Y,Y>), (srl A, <X,X,X,X>)))
17818 // The advantage is that the two shifts from the example would be
17819 // lowered as X86ISD::VSRLI nodes. This would be cheaper than scalarizing
17820 // the vector shift into four scalar shifts plus four pairs of vector
17822 if ((VT == MVT::v8i16 || VT == MVT::v4i32) &&
17823 ISD::isBuildVectorOfConstantSDNodes(Amt.getNode())) {
17824 unsigned TargetOpcode = X86ISD::MOVSS;
17825 bool CanBeSimplified;
17826 // The splat value for the first packed shift (the 'X' from the example).
17827 SDValue Amt1 = Amt->getOperand(0);
17828 // The splat value for the second packed shift (the 'Y' from the example).
17829 SDValue Amt2 = (VT == MVT::v4i32) ? Amt->getOperand(1) :
17830 Amt->getOperand(2);
17832 // See if it is possible to replace this node with a sequence of
17833 // two shifts followed by a MOVSS/MOVSD
17834 if (VT == MVT::v4i32) {
17835 // Check if it is legal to use a MOVSS.
17836 CanBeSimplified = Amt2 == Amt->getOperand(2) &&
17837 Amt2 == Amt->getOperand(3);
17838 if (!CanBeSimplified) {
17839 // Otherwise, check if we can still simplify this node using a MOVSD.
17840 CanBeSimplified = Amt1 == Amt->getOperand(1) &&
17841 Amt->getOperand(2) == Amt->getOperand(3);
17842 TargetOpcode = X86ISD::MOVSD;
17843 Amt2 = Amt->getOperand(2);
17846 // Do similar checks for the case where the machine value type
17848 CanBeSimplified = Amt1 == Amt->getOperand(1);
17849 for (unsigned i=3; i != 8 && CanBeSimplified; ++i)
17850 CanBeSimplified = Amt2 == Amt->getOperand(i);
17852 if (!CanBeSimplified) {
17853 TargetOpcode = X86ISD::MOVSD;
17854 CanBeSimplified = true;
17855 Amt2 = Amt->getOperand(4);
17856 for (unsigned i=0; i != 4 && CanBeSimplified; ++i)
17857 CanBeSimplified = Amt1 == Amt->getOperand(i);
17858 for (unsigned j=4; j != 8 && CanBeSimplified; ++j)
17859 CanBeSimplified = Amt2 == Amt->getOperand(j);
17863 if (CanBeSimplified && isa<ConstantSDNode>(Amt1) &&
17864 isa<ConstantSDNode>(Amt2)) {
17865 // Replace this node with two shifts followed by a MOVSS/MOVSD.
17866 EVT CastVT = MVT::v4i32;
17868 DAG.getConstant(cast<ConstantSDNode>(Amt1)->getAPIntValue(), VT);
17869 SDValue Shift1 = DAG.getNode(Op->getOpcode(), dl, VT, R, Splat1);
17871 DAG.getConstant(cast<ConstantSDNode>(Amt2)->getAPIntValue(), VT);
17872 SDValue Shift2 = DAG.getNode(Op->getOpcode(), dl, VT, R, Splat2);
17873 if (TargetOpcode == X86ISD::MOVSD)
17874 CastVT = MVT::v2i64;
17875 SDValue BitCast1 = DAG.getNode(ISD::BITCAST, dl, CastVT, Shift1);
17876 SDValue BitCast2 = DAG.getNode(ISD::BITCAST, dl, CastVT, Shift2);
17877 SDValue Result = getTargetShuffleNode(TargetOpcode, dl, CastVT, BitCast2,
17879 return DAG.getNode(ISD::BITCAST, dl, VT, Result);
17883 if (VT == MVT::v16i8 && Op->getOpcode() == ISD::SHL) {
17884 assert(Subtarget->hasSSE2() && "Need SSE2 for pslli/pcmpeq.");
17887 Op = DAG.getNode(ISD::SHL, dl, VT, Amt, DAG.getConstant(5, VT));
17888 Op = DAG.getNode(ISD::BITCAST, dl, VT, Op);
17890 // Turn 'a' into a mask suitable for VSELECT
17891 SDValue VSelM = DAG.getConstant(0x80, VT);
17892 SDValue OpVSel = DAG.getNode(ISD::AND, dl, VT, VSelM, Op);
17893 OpVSel = DAG.getNode(X86ISD::PCMPEQ, dl, VT, OpVSel, VSelM);
17895 SDValue CM1 = DAG.getConstant(0x0f, VT);
17896 SDValue CM2 = DAG.getConstant(0x3f, VT);
17898 // r = VSELECT(r, psllw(r & (char16)15, 4), a);
17899 SDValue M = DAG.getNode(ISD::AND, dl, VT, R, CM1);
17900 M = getTargetVShiftByConstNode(X86ISD::VSHLI, dl, MVT::v8i16, M, 4, DAG);
17901 M = DAG.getNode(ISD::BITCAST, dl, VT, M);
17902 R = DAG.getNode(ISD::VSELECT, dl, VT, OpVSel, M, R);
17905 Op = DAG.getNode(ISD::ADD, dl, VT, Op, Op);
17906 OpVSel = DAG.getNode(ISD::AND, dl, VT, VSelM, Op);
17907 OpVSel = DAG.getNode(X86ISD::PCMPEQ, dl, VT, OpVSel, VSelM);
17909 // r = VSELECT(r, psllw(r & (char16)63, 2), a);
17910 M = DAG.getNode(ISD::AND, dl, VT, R, CM2);
17911 M = getTargetVShiftByConstNode(X86ISD::VSHLI, dl, MVT::v8i16, M, 2, DAG);
17912 M = DAG.getNode(ISD::BITCAST, dl, VT, M);
17913 R = DAG.getNode(ISD::VSELECT, dl, VT, OpVSel, M, R);
17916 Op = DAG.getNode(ISD::ADD, dl, VT, Op, Op);
17917 OpVSel = DAG.getNode(ISD::AND, dl, VT, VSelM, Op);
17918 OpVSel = DAG.getNode(X86ISD::PCMPEQ, dl, VT, OpVSel, VSelM);
17920 // return VSELECT(r, r+r, a);
17921 R = DAG.getNode(ISD::VSELECT, dl, VT, OpVSel,
17922 DAG.getNode(ISD::ADD, dl, VT, R, R), R);
17926 // It's worth extending once and using the v8i32 shifts for 16-bit types, but
17927 // the extra overheads to get from v16i8 to v8i32 make the existing SSE
17928 // solution better.
17929 if (Subtarget->hasInt256() && VT == MVT::v8i16) {
17930 MVT NewVT = VT == MVT::v8i16 ? MVT::v8i32 : MVT::v16i16;
17932 Op.getOpcode() == ISD::SRA ? ISD::SIGN_EXTEND : ISD::ZERO_EXTEND;
17933 R = DAG.getNode(ExtOpc, dl, NewVT, R);
17934 Amt = DAG.getNode(ISD::ANY_EXTEND, dl, NewVT, Amt);
17935 return DAG.getNode(ISD::TRUNCATE, dl, VT,
17936 DAG.getNode(Op.getOpcode(), dl, NewVT, R, Amt));
17939 // Decompose 256-bit shifts into smaller 128-bit shifts.
17940 if (VT.is256BitVector()) {
17941 unsigned NumElems = VT.getVectorNumElements();
17942 MVT EltVT = VT.getVectorElementType();
17943 EVT NewVT = MVT::getVectorVT(EltVT, NumElems/2);
17945 // Extract the two vectors
17946 SDValue V1 = Extract128BitVector(R, 0, DAG, dl);
17947 SDValue V2 = Extract128BitVector(R, NumElems/2, DAG, dl);
17949 // Recreate the shift amount vectors
17950 SDValue Amt1, Amt2;
17951 if (Amt.getOpcode() == ISD::BUILD_VECTOR) {
17952 // Constant shift amount
17953 SmallVector<SDValue, 4> Amt1Csts;
17954 SmallVector<SDValue, 4> Amt2Csts;
17955 for (unsigned i = 0; i != NumElems/2; ++i)
17956 Amt1Csts.push_back(Amt->getOperand(i));
17957 for (unsigned i = NumElems/2; i != NumElems; ++i)
17958 Amt2Csts.push_back(Amt->getOperand(i));
17960 Amt1 = DAG.getNode(ISD::BUILD_VECTOR, dl, NewVT, Amt1Csts);
17961 Amt2 = DAG.getNode(ISD::BUILD_VECTOR, dl, NewVT, Amt2Csts);
17963 // Variable shift amount
17964 Amt1 = Extract128BitVector(Amt, 0, DAG, dl);
17965 Amt2 = Extract128BitVector(Amt, NumElems/2, DAG, dl);
17968 // Issue new vector shifts for the smaller types
17969 V1 = DAG.getNode(Op.getOpcode(), dl, NewVT, V1, Amt1);
17970 V2 = DAG.getNode(Op.getOpcode(), dl, NewVT, V2, Amt2);
17972 // Concatenate the result back
17973 return DAG.getNode(ISD::CONCAT_VECTORS, dl, VT, V1, V2);
17979 static SDValue LowerXALUO(SDValue Op, SelectionDAG &DAG) {
17980 // Lower the "add/sub/mul with overflow" instruction into a regular ins plus
17981 // a "setcc" instruction that checks the overflow flag. The "brcond" lowering
17982 // looks for this combo and may remove the "setcc" instruction if the "setcc"
17983 // has only one use.
17984 SDNode *N = Op.getNode();
17985 SDValue LHS = N->getOperand(0);
17986 SDValue RHS = N->getOperand(1);
17987 unsigned BaseOp = 0;
17990 switch (Op.getOpcode()) {
17991 default: llvm_unreachable("Unknown ovf instruction!");
17993 // A subtract of one will be selected as a INC. Note that INC doesn't
17994 // set CF, so we can't do this for UADDO.
17995 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(RHS))
17997 BaseOp = X86ISD::INC;
17998 Cond = X86::COND_O;
18001 BaseOp = X86ISD::ADD;
18002 Cond = X86::COND_O;
18005 BaseOp = X86ISD::ADD;
18006 Cond = X86::COND_B;
18009 // A subtract of one will be selected as a DEC. Note that DEC doesn't
18010 // set CF, so we can't do this for USUBO.
18011 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(RHS))
18013 BaseOp = X86ISD::DEC;
18014 Cond = X86::COND_O;
18017 BaseOp = X86ISD::SUB;
18018 Cond = X86::COND_O;
18021 BaseOp = X86ISD::SUB;
18022 Cond = X86::COND_B;
18025 BaseOp = X86ISD::SMUL;
18026 Cond = X86::COND_O;
18028 case ISD::UMULO: { // i64, i8 = umulo lhs, rhs --> i64, i64, i32 umul lhs,rhs
18029 SDVTList VTs = DAG.getVTList(N->getValueType(0), N->getValueType(0),
18031 SDValue Sum = DAG.getNode(X86ISD::UMUL, DL, VTs, LHS, RHS);
18034 DAG.getNode(X86ISD::SETCC, DL, MVT::i8,
18035 DAG.getConstant(X86::COND_O, MVT::i32),
18036 SDValue(Sum.getNode(), 2));
18038 return DAG.getNode(ISD::MERGE_VALUES, DL, N->getVTList(), Sum, SetCC);
18042 // Also sets EFLAGS.
18043 SDVTList VTs = DAG.getVTList(N->getValueType(0), MVT::i32);
18044 SDValue Sum = DAG.getNode(BaseOp, DL, VTs, LHS, RHS);
18047 DAG.getNode(X86ISD::SETCC, DL, N->getValueType(1),
18048 DAG.getConstant(Cond, MVT::i32),
18049 SDValue(Sum.getNode(), 1));
18051 return DAG.getNode(ISD::MERGE_VALUES, DL, N->getVTList(), Sum, SetCC);
18054 // Sign extension of the low part of vector elements. This may be used either
18055 // when sign extend instructions are not available or if the vector element
18056 // sizes already match the sign-extended size. If the vector elements are in
18057 // their pre-extended size and sign extend instructions are available, that will
18058 // be handled by LowerSIGN_EXTEND.
18059 SDValue X86TargetLowering::LowerSIGN_EXTEND_INREG(SDValue Op,
18060 SelectionDAG &DAG) const {
18062 EVT ExtraVT = cast<VTSDNode>(Op.getOperand(1))->getVT();
18063 MVT VT = Op.getSimpleValueType();
18065 if (!Subtarget->hasSSE2() || !VT.isVector())
18068 unsigned BitsDiff = VT.getScalarType().getSizeInBits() -
18069 ExtraVT.getScalarType().getSizeInBits();
18071 switch (VT.SimpleTy) {
18072 default: return SDValue();
18075 if (!Subtarget->hasFp256())
18077 if (!Subtarget->hasInt256()) {
18078 // needs to be split
18079 unsigned NumElems = VT.getVectorNumElements();
18081 // Extract the LHS vectors
18082 SDValue LHS = Op.getOperand(0);
18083 SDValue LHS1 = Extract128BitVector(LHS, 0, DAG, dl);
18084 SDValue LHS2 = Extract128BitVector(LHS, NumElems/2, DAG, dl);
18086 MVT EltVT = VT.getVectorElementType();
18087 EVT NewVT = MVT::getVectorVT(EltVT, NumElems/2);
18089 EVT ExtraEltVT = ExtraVT.getVectorElementType();
18090 unsigned ExtraNumElems = ExtraVT.getVectorNumElements();
18091 ExtraVT = EVT::getVectorVT(*DAG.getContext(), ExtraEltVT,
18093 SDValue Extra = DAG.getValueType(ExtraVT);
18095 LHS1 = DAG.getNode(Op.getOpcode(), dl, NewVT, LHS1, Extra);
18096 LHS2 = DAG.getNode(Op.getOpcode(), dl, NewVT, LHS2, Extra);
18098 return DAG.getNode(ISD::CONCAT_VECTORS, dl, VT, LHS1, LHS2);
18103 SDValue Op0 = Op.getOperand(0);
18105 // This is a sign extension of some low part of vector elements without
18106 // changing the size of the vector elements themselves:
18107 // Shift-Left + Shift-Right-Algebraic.
18108 SDValue Shl = getTargetVShiftByConstNode(X86ISD::VSHLI, dl, VT, Op0,
18110 return getTargetVShiftByConstNode(X86ISD::VSRAI, dl, VT, Shl, BitsDiff,
18116 /// Returns true if the operand type is exactly twice the native width, and
18117 /// the corresponding cmpxchg8b or cmpxchg16b instruction is available.
18118 /// Used to know whether to use cmpxchg8/16b when expanding atomic operations
18119 /// (otherwise we leave them alone to become __sync_fetch_and_... calls).
18120 bool X86TargetLowering::needsCmpXchgNb(const Type *MemType) const {
18121 const X86Subtarget &Subtarget =
18122 getTargetMachine().getSubtarget<X86Subtarget>();
18123 unsigned OpWidth = MemType->getPrimitiveSizeInBits();
18126 return !Subtarget.is64Bit(); // FIXME this should be Subtarget.hasCmpxchg8b
18127 else if (OpWidth == 128)
18128 return Subtarget.hasCmpxchg16b();
18133 bool X86TargetLowering::shouldExpandAtomicStoreInIR(StoreInst *SI) const {
18134 return needsCmpXchgNb(SI->getValueOperand()->getType());
18137 // Note: this turns large loads into lock cmpxchg8b/16b.
18138 // FIXME: On 32 bits x86, fild/movq might be faster than lock cmpxchg8b.
18139 bool X86TargetLowering::shouldExpandAtomicLoadInIR(LoadInst *LI) const {
18140 auto PTy = cast<PointerType>(LI->getPointerOperand()->getType());
18141 return needsCmpXchgNb(PTy->getElementType());
18144 bool X86TargetLowering::shouldExpandAtomicRMWInIR(AtomicRMWInst *AI) const {
18145 const X86Subtarget &Subtarget =
18146 getTargetMachine().getSubtarget<X86Subtarget>();
18147 unsigned NativeWidth = Subtarget.is64Bit() ? 64 : 32;
18148 const Type *MemType = AI->getType();
18150 // If the operand is too big, we must see if cmpxchg8/16b is available
18151 // and default to library calls otherwise.
18152 if (MemType->getPrimitiveSizeInBits() > NativeWidth)
18153 return needsCmpXchgNb(MemType);
18155 AtomicRMWInst::BinOp Op = AI->getOperation();
18158 llvm_unreachable("Unknown atomic operation");
18159 case AtomicRMWInst::Xchg:
18160 case AtomicRMWInst::Add:
18161 case AtomicRMWInst::Sub:
18162 // It's better to use xadd, xsub or xchg for these in all cases.
18164 case AtomicRMWInst::Or:
18165 case AtomicRMWInst::And:
18166 case AtomicRMWInst::Xor:
18167 // If the atomicrmw's result isn't actually used, we can just add a "lock"
18168 // prefix to a normal instruction for these operations.
18169 return !AI->use_empty();
18170 case AtomicRMWInst::Nand:
18171 case AtomicRMWInst::Max:
18172 case AtomicRMWInst::Min:
18173 case AtomicRMWInst::UMax:
18174 case AtomicRMWInst::UMin:
18175 // These always require a non-trivial set of data operations on x86. We must
18176 // use a cmpxchg loop.
18181 static bool hasMFENCE(const X86Subtarget& Subtarget) {
18182 // Use mfence if we have SSE2 or we're on x86-64 (even if we asked for
18183 // no-sse2). There isn't any reason to disable it if the target processor
18185 return Subtarget.hasSSE2() || Subtarget.is64Bit();
18189 X86TargetLowering::lowerIdempotentRMWIntoFencedLoad(AtomicRMWInst *AI) const {
18190 const X86Subtarget &Subtarget =
18191 getTargetMachine().getSubtarget<X86Subtarget>();
18192 unsigned NativeWidth = Subtarget.is64Bit() ? 64 : 32;
18193 const Type *MemType = AI->getType();
18194 // Accesses larger than the native width are turned into cmpxchg/libcalls, so
18195 // there is no benefit in turning such RMWs into loads, and it is actually
18196 // harmful as it introduces a mfence.
18197 if (MemType->getPrimitiveSizeInBits() > NativeWidth)
18200 auto Builder = IRBuilder<>(AI);
18201 Module *M = Builder.GetInsertBlock()->getParent()->getParent();
18202 auto SynchScope = AI->getSynchScope();
18203 // We must restrict the ordering to avoid generating loads with Release or
18204 // ReleaseAcquire orderings.
18205 auto Order = AtomicCmpXchgInst::getStrongestFailureOrdering(AI->getOrdering());
18206 auto Ptr = AI->getPointerOperand();
18208 // Before the load we need a fence. Here is an example lifted from
18209 // http://www.hpl.hp.com/techreports/2012/HPL-2012-68.pdf showing why a fence
18212 // x.store(1, relaxed);
18213 // r1 = y.fetch_add(0, release);
18215 // y.fetch_add(42, acquire);
18216 // r2 = x.load(relaxed);
18217 // r1 = r2 = 0 is impossible, but becomes possible if the idempotent rmw is
18218 // lowered to just a load without a fence. A mfence flushes the store buffer,
18219 // making the optimization clearly correct.
18220 // FIXME: it is required if isAtLeastRelease(Order) but it is not clear
18221 // otherwise, we might be able to be more agressive on relaxed idempotent
18222 // rmw. In practice, they do not look useful, so we don't try to be
18223 // especially clever.
18224 if (SynchScope == SingleThread) {
18225 // FIXME: we could just insert an X86ISD::MEMBARRIER here, except we are at
18226 // the IR level, so we must wrap it in an intrinsic.
18228 } else if (hasMFENCE(Subtarget)) {
18229 Function *MFence = llvm::Intrinsic::getDeclaration(M,
18230 Intrinsic::x86_sse2_mfence);
18231 Builder.CreateCall(MFence);
18233 // FIXME: it might make sense to use a locked operation here but on a
18234 // different cache-line to prevent cache-line bouncing. In practice it
18235 // is probably a small win, and x86 processors without mfence are rare
18236 // enough that we do not bother.
18240 // Finally we can emit the atomic load.
18241 LoadInst *Loaded = Builder.CreateAlignedLoad(Ptr,
18242 AI->getType()->getPrimitiveSizeInBits());
18243 Loaded->setAtomic(Order, SynchScope);
18244 AI->replaceAllUsesWith(Loaded);
18245 AI->eraseFromParent();
18249 static SDValue LowerATOMIC_FENCE(SDValue Op, const X86Subtarget *Subtarget,
18250 SelectionDAG &DAG) {
18252 AtomicOrdering FenceOrdering = static_cast<AtomicOrdering>(
18253 cast<ConstantSDNode>(Op.getOperand(1))->getZExtValue());
18254 SynchronizationScope FenceScope = static_cast<SynchronizationScope>(
18255 cast<ConstantSDNode>(Op.getOperand(2))->getZExtValue());
18257 // The only fence that needs an instruction is a sequentially-consistent
18258 // cross-thread fence.
18259 if (FenceOrdering == SequentiallyConsistent && FenceScope == CrossThread) {
18260 if (hasMFENCE(*Subtarget))
18261 return DAG.getNode(X86ISD::MFENCE, dl, MVT::Other, Op.getOperand(0));
18263 SDValue Chain = Op.getOperand(0);
18264 SDValue Zero = DAG.getConstant(0, MVT::i32);
18266 DAG.getRegister(X86::ESP, MVT::i32), // Base
18267 DAG.getTargetConstant(1, MVT::i8), // Scale
18268 DAG.getRegister(0, MVT::i32), // Index
18269 DAG.getTargetConstant(0, MVT::i32), // Disp
18270 DAG.getRegister(0, MVT::i32), // Segment.
18274 SDNode *Res = DAG.getMachineNode(X86::OR32mrLocked, dl, MVT::Other, Ops);
18275 return SDValue(Res, 0);
18278 // MEMBARRIER is a compiler barrier; it codegens to a no-op.
18279 return DAG.getNode(X86ISD::MEMBARRIER, dl, MVT::Other, Op.getOperand(0));
18282 static SDValue LowerCMP_SWAP(SDValue Op, const X86Subtarget *Subtarget,
18283 SelectionDAG &DAG) {
18284 MVT T = Op.getSimpleValueType();
18288 switch(T.SimpleTy) {
18289 default: llvm_unreachable("Invalid value type!");
18290 case MVT::i8: Reg = X86::AL; size = 1; break;
18291 case MVT::i16: Reg = X86::AX; size = 2; break;
18292 case MVT::i32: Reg = X86::EAX; size = 4; break;
18294 assert(Subtarget->is64Bit() && "Node not type legal!");
18295 Reg = X86::RAX; size = 8;
18298 SDValue cpIn = DAG.getCopyToReg(Op.getOperand(0), DL, Reg,
18299 Op.getOperand(2), SDValue());
18300 SDValue Ops[] = { cpIn.getValue(0),
18303 DAG.getTargetConstant(size, MVT::i8),
18304 cpIn.getValue(1) };
18305 SDVTList Tys = DAG.getVTList(MVT::Other, MVT::Glue);
18306 MachineMemOperand *MMO = cast<AtomicSDNode>(Op)->getMemOperand();
18307 SDValue Result = DAG.getMemIntrinsicNode(X86ISD::LCMPXCHG_DAG, DL, Tys,
18311 DAG.getCopyFromReg(Result.getValue(0), DL, Reg, T, Result.getValue(1));
18312 SDValue EFLAGS = DAG.getCopyFromReg(cpOut.getValue(1), DL, X86::EFLAGS,
18313 MVT::i32, cpOut.getValue(2));
18314 SDValue Success = DAG.getNode(X86ISD::SETCC, DL, Op->getValueType(1),
18315 DAG.getConstant(X86::COND_E, MVT::i8), EFLAGS);
18317 DAG.ReplaceAllUsesOfValueWith(Op.getValue(0), cpOut);
18318 DAG.ReplaceAllUsesOfValueWith(Op.getValue(1), Success);
18319 DAG.ReplaceAllUsesOfValueWith(Op.getValue(2), EFLAGS.getValue(1));
18323 static SDValue LowerBITCAST(SDValue Op, const X86Subtarget *Subtarget,
18324 SelectionDAG &DAG) {
18325 MVT SrcVT = Op.getOperand(0).getSimpleValueType();
18326 MVT DstVT = Op.getSimpleValueType();
18328 if (SrcVT == MVT::v2i32 || SrcVT == MVT::v4i16 || SrcVT == MVT::v8i8) {
18329 assert(Subtarget->hasSSE2() && "Requires at least SSE2!");
18330 if (DstVT != MVT::f64)
18331 // This conversion needs to be expanded.
18334 SDValue InVec = Op->getOperand(0);
18336 unsigned NumElts = SrcVT.getVectorNumElements();
18337 EVT SVT = SrcVT.getVectorElementType();
18339 // Widen the vector in input in the case of MVT::v2i32.
18340 // Example: from MVT::v2i32 to MVT::v4i32.
18341 SmallVector<SDValue, 16> Elts;
18342 for (unsigned i = 0, e = NumElts; i != e; ++i)
18343 Elts.push_back(DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, SVT, InVec,
18344 DAG.getIntPtrConstant(i)));
18346 // Explicitly mark the extra elements as Undef.
18347 SDValue Undef = DAG.getUNDEF(SVT);
18348 for (unsigned i = NumElts, e = NumElts * 2; i != e; ++i)
18349 Elts.push_back(Undef);
18351 EVT NewVT = EVT::getVectorVT(*DAG.getContext(), SVT, NumElts * 2);
18352 SDValue BV = DAG.getNode(ISD::BUILD_VECTOR, dl, NewVT, Elts);
18353 SDValue ToV2F64 = DAG.getNode(ISD::BITCAST, dl, MVT::v2f64, BV);
18354 return DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::f64, ToV2F64,
18355 DAG.getIntPtrConstant(0));
18358 assert(Subtarget->is64Bit() && !Subtarget->hasSSE2() &&
18359 Subtarget->hasMMX() && "Unexpected custom BITCAST");
18360 assert((DstVT == MVT::i64 ||
18361 (DstVT.isVector() && DstVT.getSizeInBits()==64)) &&
18362 "Unexpected custom BITCAST");
18363 // i64 <=> MMX conversions are Legal.
18364 if (SrcVT==MVT::i64 && DstVT.isVector())
18366 if (DstVT==MVT::i64 && SrcVT.isVector())
18368 // MMX <=> MMX conversions are Legal.
18369 if (SrcVT.isVector() && DstVT.isVector())
18371 // All other conversions need to be expanded.
18375 static SDValue LowerLOAD_SUB(SDValue Op, SelectionDAG &DAG) {
18376 SDNode *Node = Op.getNode();
18378 EVT T = Node->getValueType(0);
18379 SDValue negOp = DAG.getNode(ISD::SUB, dl, T,
18380 DAG.getConstant(0, T), Node->getOperand(2));
18381 return DAG.getAtomic(ISD::ATOMIC_LOAD_ADD, dl,
18382 cast<AtomicSDNode>(Node)->getMemoryVT(),
18383 Node->getOperand(0),
18384 Node->getOperand(1), negOp,
18385 cast<AtomicSDNode>(Node)->getMemOperand(),
18386 cast<AtomicSDNode>(Node)->getOrdering(),
18387 cast<AtomicSDNode>(Node)->getSynchScope());
18390 static SDValue LowerATOMIC_STORE(SDValue Op, SelectionDAG &DAG) {
18391 SDNode *Node = Op.getNode();
18393 EVT VT = cast<AtomicSDNode>(Node)->getMemoryVT();
18395 // Convert seq_cst store -> xchg
18396 // Convert wide store -> swap (-> cmpxchg8b/cmpxchg16b)
18397 // FIXME: On 32-bit, store -> fist or movq would be more efficient
18398 // (The only way to get a 16-byte store is cmpxchg16b)
18399 // FIXME: 16-byte ATOMIC_SWAP isn't actually hooked up at the moment.
18400 if (cast<AtomicSDNode>(Node)->getOrdering() == SequentiallyConsistent ||
18401 !DAG.getTargetLoweringInfo().isTypeLegal(VT)) {
18402 SDValue Swap = DAG.getAtomic(ISD::ATOMIC_SWAP, dl,
18403 cast<AtomicSDNode>(Node)->getMemoryVT(),
18404 Node->getOperand(0),
18405 Node->getOperand(1), Node->getOperand(2),
18406 cast<AtomicSDNode>(Node)->getMemOperand(),
18407 cast<AtomicSDNode>(Node)->getOrdering(),
18408 cast<AtomicSDNode>(Node)->getSynchScope());
18409 return Swap.getValue(1);
18411 // Other atomic stores have a simple pattern.
18415 static SDValue LowerADDC_ADDE_SUBC_SUBE(SDValue Op, SelectionDAG &DAG) {
18416 EVT VT = Op.getNode()->getSimpleValueType(0);
18418 // Let legalize expand this if it isn't a legal type yet.
18419 if (!DAG.getTargetLoweringInfo().isTypeLegal(VT))
18422 SDVTList VTs = DAG.getVTList(VT, MVT::i32);
18425 bool ExtraOp = false;
18426 switch (Op.getOpcode()) {
18427 default: llvm_unreachable("Invalid code");
18428 case ISD::ADDC: Opc = X86ISD::ADD; break;
18429 case ISD::ADDE: Opc = X86ISD::ADC; ExtraOp = true; break;
18430 case ISD::SUBC: Opc = X86ISD::SUB; break;
18431 case ISD::SUBE: Opc = X86ISD::SBB; ExtraOp = true; break;
18435 return DAG.getNode(Opc, SDLoc(Op), VTs, Op.getOperand(0),
18437 return DAG.getNode(Opc, SDLoc(Op), VTs, Op.getOperand(0),
18438 Op.getOperand(1), Op.getOperand(2));
18441 static SDValue LowerFSINCOS(SDValue Op, const X86Subtarget *Subtarget,
18442 SelectionDAG &DAG) {
18443 assert(Subtarget->isTargetDarwin() && Subtarget->is64Bit());
18445 // For MacOSX, we want to call an alternative entry point: __sincos_stret,
18446 // which returns the values as { float, float } (in XMM0) or
18447 // { double, double } (which is returned in XMM0, XMM1).
18449 SDValue Arg = Op.getOperand(0);
18450 EVT ArgVT = Arg.getValueType();
18451 Type *ArgTy = ArgVT.getTypeForEVT(*DAG.getContext());
18453 TargetLowering::ArgListTy Args;
18454 TargetLowering::ArgListEntry Entry;
18458 Entry.isSExt = false;
18459 Entry.isZExt = false;
18460 Args.push_back(Entry);
18462 bool isF64 = ArgVT == MVT::f64;
18463 // Only optimize x86_64 for now. i386 is a bit messy. For f32,
18464 // the small struct {f32, f32} is returned in (eax, edx). For f64,
18465 // the results are returned via SRet in memory.
18466 const char *LibcallName = isF64 ? "__sincos_stret" : "__sincosf_stret";
18467 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
18468 SDValue Callee = DAG.getExternalSymbol(LibcallName, TLI.getPointerTy());
18470 Type *RetTy = isF64
18471 ? (Type*)StructType::get(ArgTy, ArgTy, NULL)
18472 : (Type*)VectorType::get(ArgTy, 4);
18474 TargetLowering::CallLoweringInfo CLI(DAG);
18475 CLI.setDebugLoc(dl).setChain(DAG.getEntryNode())
18476 .setCallee(CallingConv::C, RetTy, Callee, std::move(Args), 0);
18478 std::pair<SDValue, SDValue> CallResult = TLI.LowerCallTo(CLI);
18481 // Returned in xmm0 and xmm1.
18482 return CallResult.first;
18484 // Returned in bits 0:31 and 32:64 xmm0.
18485 SDValue SinVal = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, ArgVT,
18486 CallResult.first, DAG.getIntPtrConstant(0));
18487 SDValue CosVal = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, ArgVT,
18488 CallResult.first, DAG.getIntPtrConstant(1));
18489 SDVTList Tys = DAG.getVTList(ArgVT, ArgVT);
18490 return DAG.getNode(ISD::MERGE_VALUES, dl, Tys, SinVal, CosVal);
18493 /// LowerOperation - Provide custom lowering hooks for some operations.
18495 SDValue X86TargetLowering::LowerOperation(SDValue Op, SelectionDAG &DAG) const {
18496 switch (Op.getOpcode()) {
18497 default: llvm_unreachable("Should not custom lower this!");
18498 case ISD::SIGN_EXTEND_INREG: return LowerSIGN_EXTEND_INREG(Op,DAG);
18499 case ISD::ATOMIC_FENCE: return LowerATOMIC_FENCE(Op, Subtarget, DAG);
18500 case ISD::ATOMIC_CMP_SWAP_WITH_SUCCESS:
18501 return LowerCMP_SWAP(Op, Subtarget, DAG);
18502 case ISD::ATOMIC_LOAD_SUB: return LowerLOAD_SUB(Op,DAG);
18503 case ISD::ATOMIC_STORE: return LowerATOMIC_STORE(Op,DAG);
18504 case ISD::BUILD_VECTOR: return LowerBUILD_VECTOR(Op, DAG);
18505 case ISD::CONCAT_VECTORS: return LowerCONCAT_VECTORS(Op, DAG);
18506 case ISD::VECTOR_SHUFFLE: return LowerVECTOR_SHUFFLE(Op, DAG);
18507 case ISD::VSELECT: return LowerVSELECT(Op, DAG);
18508 case ISD::EXTRACT_VECTOR_ELT: return LowerEXTRACT_VECTOR_ELT(Op, DAG);
18509 case ISD::INSERT_VECTOR_ELT: return LowerINSERT_VECTOR_ELT(Op, DAG);
18510 case ISD::EXTRACT_SUBVECTOR: return LowerEXTRACT_SUBVECTOR(Op,Subtarget,DAG);
18511 case ISD::INSERT_SUBVECTOR: return LowerINSERT_SUBVECTOR(Op, Subtarget,DAG);
18512 case ISD::SCALAR_TO_VECTOR: return LowerSCALAR_TO_VECTOR(Op, DAG);
18513 case ISD::ConstantPool: return LowerConstantPool(Op, DAG);
18514 case ISD::GlobalAddress: return LowerGlobalAddress(Op, DAG);
18515 case ISD::GlobalTLSAddress: return LowerGlobalTLSAddress(Op, DAG);
18516 case ISD::ExternalSymbol: return LowerExternalSymbol(Op, DAG);
18517 case ISD::BlockAddress: return LowerBlockAddress(Op, DAG);
18518 case ISD::SHL_PARTS:
18519 case ISD::SRA_PARTS:
18520 case ISD::SRL_PARTS: return LowerShiftParts(Op, DAG);
18521 case ISD::SINT_TO_FP: return LowerSINT_TO_FP(Op, DAG);
18522 case ISD::UINT_TO_FP: return LowerUINT_TO_FP(Op, DAG);
18523 case ISD::TRUNCATE: return LowerTRUNCATE(Op, DAG);
18524 case ISD::ZERO_EXTEND: return LowerZERO_EXTEND(Op, Subtarget, DAG);
18525 case ISD::SIGN_EXTEND: return LowerSIGN_EXTEND(Op, Subtarget, DAG);
18526 case ISD::ANY_EXTEND: return LowerANY_EXTEND(Op, Subtarget, DAG);
18527 case ISD::FP_TO_SINT: return LowerFP_TO_SINT(Op, DAG);
18528 case ISD::FP_TO_UINT: return LowerFP_TO_UINT(Op, DAG);
18529 case ISD::FP_EXTEND: return LowerFP_EXTEND(Op, DAG);
18530 case ISD::LOAD: return LowerExtendedLoad(Op, Subtarget, DAG);
18532 case ISD::FNEG: return LowerFABSorFNEG(Op, DAG);
18533 case ISD::FCOPYSIGN: return LowerFCOPYSIGN(Op, DAG);
18534 case ISD::FGETSIGN: return LowerFGETSIGN(Op, DAG);
18535 case ISD::SETCC: return LowerSETCC(Op, DAG);
18536 case ISD::SELECT: return LowerSELECT(Op, DAG);
18537 case ISD::BRCOND: return LowerBRCOND(Op, DAG);
18538 case ISD::JumpTable: return LowerJumpTable(Op, DAG);
18539 case ISD::VASTART: return LowerVASTART(Op, DAG);
18540 case ISD::VAARG: return LowerVAARG(Op, DAG);
18541 case ISD::VACOPY: return LowerVACOPY(Op, Subtarget, DAG);
18542 case ISD::INTRINSIC_WO_CHAIN: return LowerINTRINSIC_WO_CHAIN(Op, DAG);
18543 case ISD::INTRINSIC_VOID:
18544 case ISD::INTRINSIC_W_CHAIN: return LowerINTRINSIC_W_CHAIN(Op, Subtarget, DAG);
18545 case ISD::RETURNADDR: return LowerRETURNADDR(Op, DAG);
18546 case ISD::FRAMEADDR: return LowerFRAMEADDR(Op, DAG);
18547 case ISD::FRAME_TO_ARGS_OFFSET:
18548 return LowerFRAME_TO_ARGS_OFFSET(Op, DAG);
18549 case ISD::DYNAMIC_STACKALLOC: return LowerDYNAMIC_STACKALLOC(Op, DAG);
18550 case ISD::EH_RETURN: return LowerEH_RETURN(Op, DAG);
18551 case ISD::EH_SJLJ_SETJMP: return lowerEH_SJLJ_SETJMP(Op, DAG);
18552 case ISD::EH_SJLJ_LONGJMP: return lowerEH_SJLJ_LONGJMP(Op, DAG);
18553 case ISD::INIT_TRAMPOLINE: return LowerINIT_TRAMPOLINE(Op, DAG);
18554 case ISD::ADJUST_TRAMPOLINE: return LowerADJUST_TRAMPOLINE(Op, DAG);
18555 case ISD::FLT_ROUNDS_: return LowerFLT_ROUNDS_(Op, DAG);
18556 case ISD::CTLZ: return LowerCTLZ(Op, DAG);
18557 case ISD::CTLZ_ZERO_UNDEF: return LowerCTLZ_ZERO_UNDEF(Op, DAG);
18558 case ISD::CTTZ: return LowerCTTZ(Op, DAG);
18559 case ISD::MUL: return LowerMUL(Op, Subtarget, DAG);
18560 case ISD::UMUL_LOHI:
18561 case ISD::SMUL_LOHI: return LowerMUL_LOHI(Op, Subtarget, DAG);
18564 case ISD::SHL: return LowerShift(Op, Subtarget, DAG);
18570 case ISD::UMULO: return LowerXALUO(Op, DAG);
18571 case ISD::READCYCLECOUNTER: return LowerREADCYCLECOUNTER(Op, Subtarget,DAG);
18572 case ISD::BITCAST: return LowerBITCAST(Op, Subtarget, DAG);
18576 case ISD::SUBE: return LowerADDC_ADDE_SUBC_SUBE(Op, DAG);
18577 case ISD::ADD: return LowerADD(Op, DAG);
18578 case ISD::SUB: return LowerSUB(Op, DAG);
18579 case ISD::FSINCOS: return LowerFSINCOS(Op, Subtarget, DAG);
18583 /// ReplaceNodeResults - Replace a node with an illegal result type
18584 /// with a new node built out of custom code.
18585 void X86TargetLowering::ReplaceNodeResults(SDNode *N,
18586 SmallVectorImpl<SDValue>&Results,
18587 SelectionDAG &DAG) const {
18589 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
18590 switch (N->getOpcode()) {
18592 llvm_unreachable("Do not know how to custom type legalize this operation!");
18593 case ISD::SIGN_EXTEND_INREG:
18598 // We don't want to expand or promote these.
18605 case ISD::UDIVREM: {
18606 SDValue V = LowerWin64_i128OP(SDValue(N,0), DAG);
18607 Results.push_back(V);
18610 case ISD::FP_TO_SINT:
18611 case ISD::FP_TO_UINT: {
18612 bool IsSigned = N->getOpcode() == ISD::FP_TO_SINT;
18614 if (!IsSigned && !isIntegerTypeFTOL(SDValue(N, 0).getValueType()))
18617 std::pair<SDValue,SDValue> Vals =
18618 FP_TO_INTHelper(SDValue(N, 0), DAG, IsSigned, /*IsReplace=*/ true);
18619 SDValue FIST = Vals.first, StackSlot = Vals.second;
18620 if (FIST.getNode()) {
18621 EVT VT = N->getValueType(0);
18622 // Return a load from the stack slot.
18623 if (StackSlot.getNode())
18624 Results.push_back(DAG.getLoad(VT, dl, FIST, StackSlot,
18625 MachinePointerInfo(),
18626 false, false, false, 0));
18628 Results.push_back(FIST);
18632 case ISD::UINT_TO_FP: {
18633 assert(Subtarget->hasSSE2() && "Requires at least SSE2!");
18634 if (N->getOperand(0).getValueType() != MVT::v2i32 ||
18635 N->getValueType(0) != MVT::v2f32)
18637 SDValue ZExtIn = DAG.getNode(ISD::ZERO_EXTEND, dl, MVT::v2i64,
18639 SDValue Bias = DAG.getConstantFP(BitsToDouble(0x4330000000000000ULL),
18641 SDValue VBias = DAG.getNode(ISD::BUILD_VECTOR, dl, MVT::v2f64, Bias, Bias);
18642 SDValue Or = DAG.getNode(ISD::OR, dl, MVT::v2i64, ZExtIn,
18643 DAG.getNode(ISD::BITCAST, dl, MVT::v2i64, VBias));
18644 Or = DAG.getNode(ISD::BITCAST, dl, MVT::v2f64, Or);
18645 SDValue Sub = DAG.getNode(ISD::FSUB, dl, MVT::v2f64, Or, VBias);
18646 Results.push_back(DAG.getNode(X86ISD::VFPROUND, dl, MVT::v4f32, Sub));
18649 case ISD::FP_ROUND: {
18650 if (!TLI.isTypeLegal(N->getOperand(0).getValueType()))
18652 SDValue V = DAG.getNode(X86ISD::VFPROUND, dl, MVT::v4f32, N->getOperand(0));
18653 Results.push_back(V);
18656 case ISD::INTRINSIC_W_CHAIN: {
18657 unsigned IntNo = cast<ConstantSDNode>(N->getOperand(1))->getZExtValue();
18659 default : llvm_unreachable("Do not know how to custom type "
18660 "legalize this intrinsic operation!");
18661 case Intrinsic::x86_rdtsc:
18662 return getReadTimeStampCounter(N, dl, X86ISD::RDTSC_DAG, DAG, Subtarget,
18664 case Intrinsic::x86_rdtscp:
18665 return getReadTimeStampCounter(N, dl, X86ISD::RDTSCP_DAG, DAG, Subtarget,
18667 case Intrinsic::x86_rdpmc:
18668 return getReadPerformanceCounter(N, dl, DAG, Subtarget, Results);
18671 case ISD::READCYCLECOUNTER: {
18672 return getReadTimeStampCounter(N, dl, X86ISD::RDTSC_DAG, DAG, Subtarget,
18675 case ISD::ATOMIC_CMP_SWAP_WITH_SUCCESS: {
18676 EVT T = N->getValueType(0);
18677 assert((T == MVT::i64 || T == MVT::i128) && "can only expand cmpxchg pair");
18678 bool Regs64bit = T == MVT::i128;
18679 EVT HalfT = Regs64bit ? MVT::i64 : MVT::i32;
18680 SDValue cpInL, cpInH;
18681 cpInL = DAG.getNode(ISD::EXTRACT_ELEMENT, dl, HalfT, N->getOperand(2),
18682 DAG.getConstant(0, HalfT));
18683 cpInH = DAG.getNode(ISD::EXTRACT_ELEMENT, dl, HalfT, N->getOperand(2),
18684 DAG.getConstant(1, HalfT));
18685 cpInL = DAG.getCopyToReg(N->getOperand(0), dl,
18686 Regs64bit ? X86::RAX : X86::EAX,
18688 cpInH = DAG.getCopyToReg(cpInL.getValue(0), dl,
18689 Regs64bit ? X86::RDX : X86::EDX,
18690 cpInH, cpInL.getValue(1));
18691 SDValue swapInL, swapInH;
18692 swapInL = DAG.getNode(ISD::EXTRACT_ELEMENT, dl, HalfT, N->getOperand(3),
18693 DAG.getConstant(0, HalfT));
18694 swapInH = DAG.getNode(ISD::EXTRACT_ELEMENT, dl, HalfT, N->getOperand(3),
18695 DAG.getConstant(1, HalfT));
18696 swapInL = DAG.getCopyToReg(cpInH.getValue(0), dl,
18697 Regs64bit ? X86::RBX : X86::EBX,
18698 swapInL, cpInH.getValue(1));
18699 swapInH = DAG.getCopyToReg(swapInL.getValue(0), dl,
18700 Regs64bit ? X86::RCX : X86::ECX,
18701 swapInH, swapInL.getValue(1));
18702 SDValue Ops[] = { swapInH.getValue(0),
18704 swapInH.getValue(1) };
18705 SDVTList Tys = DAG.getVTList(MVT::Other, MVT::Glue);
18706 MachineMemOperand *MMO = cast<AtomicSDNode>(N)->getMemOperand();
18707 unsigned Opcode = Regs64bit ? X86ISD::LCMPXCHG16_DAG :
18708 X86ISD::LCMPXCHG8_DAG;
18709 SDValue Result = DAG.getMemIntrinsicNode(Opcode, dl, Tys, Ops, T, MMO);
18710 SDValue cpOutL = DAG.getCopyFromReg(Result.getValue(0), dl,
18711 Regs64bit ? X86::RAX : X86::EAX,
18712 HalfT, Result.getValue(1));
18713 SDValue cpOutH = DAG.getCopyFromReg(cpOutL.getValue(1), dl,
18714 Regs64bit ? X86::RDX : X86::EDX,
18715 HalfT, cpOutL.getValue(2));
18716 SDValue OpsF[] = { cpOutL.getValue(0), cpOutH.getValue(0)};
18718 SDValue EFLAGS = DAG.getCopyFromReg(cpOutH.getValue(1), dl, X86::EFLAGS,
18719 MVT::i32, cpOutH.getValue(2));
18721 DAG.getNode(X86ISD::SETCC, dl, MVT::i8,
18722 DAG.getConstant(X86::COND_E, MVT::i8), EFLAGS);
18723 Success = DAG.getZExtOrTrunc(Success, dl, N->getValueType(1));
18725 Results.push_back(DAG.getNode(ISD::BUILD_PAIR, dl, T, OpsF));
18726 Results.push_back(Success);
18727 Results.push_back(EFLAGS.getValue(1));
18730 case ISD::ATOMIC_SWAP:
18731 case ISD::ATOMIC_LOAD_ADD:
18732 case ISD::ATOMIC_LOAD_SUB:
18733 case ISD::ATOMIC_LOAD_AND:
18734 case ISD::ATOMIC_LOAD_OR:
18735 case ISD::ATOMIC_LOAD_XOR:
18736 case ISD::ATOMIC_LOAD_NAND:
18737 case ISD::ATOMIC_LOAD_MIN:
18738 case ISD::ATOMIC_LOAD_MAX:
18739 case ISD::ATOMIC_LOAD_UMIN:
18740 case ISD::ATOMIC_LOAD_UMAX:
18741 case ISD::ATOMIC_LOAD: {
18742 // Delegate to generic TypeLegalization. Situations we can really handle
18743 // should have already been dealt with by AtomicExpandPass.cpp.
18746 case ISD::BITCAST: {
18747 assert(Subtarget->hasSSE2() && "Requires at least SSE2!");
18748 EVT DstVT = N->getValueType(0);
18749 EVT SrcVT = N->getOperand(0)->getValueType(0);
18751 if (SrcVT != MVT::f64 ||
18752 (DstVT != MVT::v2i32 && DstVT != MVT::v4i16 && DstVT != MVT::v8i8))
18755 unsigned NumElts = DstVT.getVectorNumElements();
18756 EVT SVT = DstVT.getVectorElementType();
18757 EVT WiderVT = EVT::getVectorVT(*DAG.getContext(), SVT, NumElts * 2);
18758 SDValue Expanded = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl,
18759 MVT::v2f64, N->getOperand(0));
18760 SDValue ToVecInt = DAG.getNode(ISD::BITCAST, dl, WiderVT, Expanded);
18762 if (ExperimentalVectorWideningLegalization) {
18763 // If we are legalizing vectors by widening, we already have the desired
18764 // legal vector type, just return it.
18765 Results.push_back(ToVecInt);
18769 SmallVector<SDValue, 8> Elts;
18770 for (unsigned i = 0, e = NumElts; i != e; ++i)
18771 Elts.push_back(DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, SVT,
18772 ToVecInt, DAG.getIntPtrConstant(i)));
18774 Results.push_back(DAG.getNode(ISD::BUILD_VECTOR, dl, DstVT, Elts));
18779 const char *X86TargetLowering::getTargetNodeName(unsigned Opcode) const {
18781 default: return nullptr;
18782 case X86ISD::BSF: return "X86ISD::BSF";
18783 case X86ISD::BSR: return "X86ISD::BSR";
18784 case X86ISD::SHLD: return "X86ISD::SHLD";
18785 case X86ISD::SHRD: return "X86ISD::SHRD";
18786 case X86ISD::FAND: return "X86ISD::FAND";
18787 case X86ISD::FANDN: return "X86ISD::FANDN";
18788 case X86ISD::FOR: return "X86ISD::FOR";
18789 case X86ISD::FXOR: return "X86ISD::FXOR";
18790 case X86ISD::FSRL: return "X86ISD::FSRL";
18791 case X86ISD::FILD: return "X86ISD::FILD";
18792 case X86ISD::FILD_FLAG: return "X86ISD::FILD_FLAG";
18793 case X86ISD::FP_TO_INT16_IN_MEM: return "X86ISD::FP_TO_INT16_IN_MEM";
18794 case X86ISD::FP_TO_INT32_IN_MEM: return "X86ISD::FP_TO_INT32_IN_MEM";
18795 case X86ISD::FP_TO_INT64_IN_MEM: return "X86ISD::FP_TO_INT64_IN_MEM";
18796 case X86ISD::FLD: return "X86ISD::FLD";
18797 case X86ISD::FST: return "X86ISD::FST";
18798 case X86ISD::CALL: return "X86ISD::CALL";
18799 case X86ISD::RDTSC_DAG: return "X86ISD::RDTSC_DAG";
18800 case X86ISD::RDTSCP_DAG: return "X86ISD::RDTSCP_DAG";
18801 case X86ISD::RDPMC_DAG: return "X86ISD::RDPMC_DAG";
18802 case X86ISD::BT: return "X86ISD::BT";
18803 case X86ISD::CMP: return "X86ISD::CMP";
18804 case X86ISD::COMI: return "X86ISD::COMI";
18805 case X86ISD::UCOMI: return "X86ISD::UCOMI";
18806 case X86ISD::CMPM: return "X86ISD::CMPM";
18807 case X86ISD::CMPMU: return "X86ISD::CMPMU";
18808 case X86ISD::SETCC: return "X86ISD::SETCC";
18809 case X86ISD::SETCC_CARRY: return "X86ISD::SETCC_CARRY";
18810 case X86ISD::FSETCC: return "X86ISD::FSETCC";
18811 case X86ISD::CMOV: return "X86ISD::CMOV";
18812 case X86ISD::BRCOND: return "X86ISD::BRCOND";
18813 case X86ISD::RET_FLAG: return "X86ISD::RET_FLAG";
18814 case X86ISD::REP_STOS: return "X86ISD::REP_STOS";
18815 case X86ISD::REP_MOVS: return "X86ISD::REP_MOVS";
18816 case X86ISD::GlobalBaseReg: return "X86ISD::GlobalBaseReg";
18817 case X86ISD::Wrapper: return "X86ISD::Wrapper";
18818 case X86ISD::WrapperRIP: return "X86ISD::WrapperRIP";
18819 case X86ISD::PEXTRB: return "X86ISD::PEXTRB";
18820 case X86ISD::PEXTRW: return "X86ISD::PEXTRW";
18821 case X86ISD::INSERTPS: return "X86ISD::INSERTPS";
18822 case X86ISD::PINSRB: return "X86ISD::PINSRB";
18823 case X86ISD::PINSRW: return "X86ISD::PINSRW";
18824 case X86ISD::PSHUFB: return "X86ISD::PSHUFB";
18825 case X86ISD::ANDNP: return "X86ISD::ANDNP";
18826 case X86ISD::PSIGN: return "X86ISD::PSIGN";
18827 case X86ISD::BLENDI: return "X86ISD::BLENDI";
18828 case X86ISD::SUBUS: return "X86ISD::SUBUS";
18829 case X86ISD::HADD: return "X86ISD::HADD";
18830 case X86ISD::HSUB: return "X86ISD::HSUB";
18831 case X86ISD::FHADD: return "X86ISD::FHADD";
18832 case X86ISD::FHSUB: return "X86ISD::FHSUB";
18833 case X86ISD::UMAX: return "X86ISD::UMAX";
18834 case X86ISD::UMIN: return "X86ISD::UMIN";
18835 case X86ISD::SMAX: return "X86ISD::SMAX";
18836 case X86ISD::SMIN: return "X86ISD::SMIN";
18837 case X86ISD::FMAX: return "X86ISD::FMAX";
18838 case X86ISD::FMIN: return "X86ISD::FMIN";
18839 case X86ISD::FMAXC: return "X86ISD::FMAXC";
18840 case X86ISD::FMINC: return "X86ISD::FMINC";
18841 case X86ISD::FRSQRT: return "X86ISD::FRSQRT";
18842 case X86ISD::FRCP: return "X86ISD::FRCP";
18843 case X86ISD::TLSADDR: return "X86ISD::TLSADDR";
18844 case X86ISD::TLSBASEADDR: return "X86ISD::TLSBASEADDR";
18845 case X86ISD::TLSCALL: return "X86ISD::TLSCALL";
18846 case X86ISD::EH_SJLJ_SETJMP: return "X86ISD::EH_SJLJ_SETJMP";
18847 case X86ISD::EH_SJLJ_LONGJMP: return "X86ISD::EH_SJLJ_LONGJMP";
18848 case X86ISD::EH_RETURN: return "X86ISD::EH_RETURN";
18849 case X86ISD::TC_RETURN: return "X86ISD::TC_RETURN";
18850 case X86ISD::FNSTCW16m: return "X86ISD::FNSTCW16m";
18851 case X86ISD::FNSTSW16r: return "X86ISD::FNSTSW16r";
18852 case X86ISD::LCMPXCHG_DAG: return "X86ISD::LCMPXCHG_DAG";
18853 case X86ISD::LCMPXCHG8_DAG: return "X86ISD::LCMPXCHG8_DAG";
18854 case X86ISD::LCMPXCHG16_DAG: return "X86ISD::LCMPXCHG16_DAG";
18855 case X86ISD::VZEXT_MOVL: return "X86ISD::VZEXT_MOVL";
18856 case X86ISD::VZEXT_LOAD: return "X86ISD::VZEXT_LOAD";
18857 case X86ISD::VZEXT: return "X86ISD::VZEXT";
18858 case X86ISD::VSEXT: return "X86ISD::VSEXT";
18859 case X86ISD::VTRUNC: return "X86ISD::VTRUNC";
18860 case X86ISD::VTRUNCM: return "X86ISD::VTRUNCM";
18861 case X86ISD::VINSERT: return "X86ISD::VINSERT";
18862 case X86ISD::VFPEXT: return "X86ISD::VFPEXT";
18863 case X86ISD::VFPROUND: return "X86ISD::VFPROUND";
18864 case X86ISD::VSHLDQ: return "X86ISD::VSHLDQ";
18865 case X86ISD::VSRLDQ: return "X86ISD::VSRLDQ";
18866 case X86ISD::VSHL: return "X86ISD::VSHL";
18867 case X86ISD::VSRL: return "X86ISD::VSRL";
18868 case X86ISD::VSRA: return "X86ISD::VSRA";
18869 case X86ISD::VSHLI: return "X86ISD::VSHLI";
18870 case X86ISD::VSRLI: return "X86ISD::VSRLI";
18871 case X86ISD::VSRAI: return "X86ISD::VSRAI";
18872 case X86ISD::CMPP: return "X86ISD::CMPP";
18873 case X86ISD::PCMPEQ: return "X86ISD::PCMPEQ";
18874 case X86ISD::PCMPGT: return "X86ISD::PCMPGT";
18875 case X86ISD::PCMPEQM: return "X86ISD::PCMPEQM";
18876 case X86ISD::PCMPGTM: return "X86ISD::PCMPGTM";
18877 case X86ISD::ADD: return "X86ISD::ADD";
18878 case X86ISD::SUB: return "X86ISD::SUB";
18879 case X86ISD::ADC: return "X86ISD::ADC";
18880 case X86ISD::SBB: return "X86ISD::SBB";
18881 case X86ISD::SMUL: return "X86ISD::SMUL";
18882 case X86ISD::UMUL: return "X86ISD::UMUL";
18883 case X86ISD::INC: return "X86ISD::INC";
18884 case X86ISD::DEC: return "X86ISD::DEC";
18885 case X86ISD::OR: return "X86ISD::OR";
18886 case X86ISD::XOR: return "X86ISD::XOR";
18887 case X86ISD::AND: return "X86ISD::AND";
18888 case X86ISD::BEXTR: return "X86ISD::BEXTR";
18889 case X86ISD::MUL_IMM: return "X86ISD::MUL_IMM";
18890 case X86ISD::PTEST: return "X86ISD::PTEST";
18891 case X86ISD::TESTP: return "X86ISD::TESTP";
18892 case X86ISD::TESTM: return "X86ISD::TESTM";
18893 case X86ISD::TESTNM: return "X86ISD::TESTNM";
18894 case X86ISD::KORTEST: return "X86ISD::KORTEST";
18895 case X86ISD::PACKSS: return "X86ISD::PACKSS";
18896 case X86ISD::PACKUS: return "X86ISD::PACKUS";
18897 case X86ISD::PALIGNR: return "X86ISD::PALIGNR";
18898 case X86ISD::VALIGN: return "X86ISD::VALIGN";
18899 case X86ISD::PSHUFD: return "X86ISD::PSHUFD";
18900 case X86ISD::PSHUFHW: return "X86ISD::PSHUFHW";
18901 case X86ISD::PSHUFLW: return "X86ISD::PSHUFLW";
18902 case X86ISD::SHUFP: return "X86ISD::SHUFP";
18903 case X86ISD::MOVLHPS: return "X86ISD::MOVLHPS";
18904 case X86ISD::MOVLHPD: return "X86ISD::MOVLHPD";
18905 case X86ISD::MOVHLPS: return "X86ISD::MOVHLPS";
18906 case X86ISD::MOVLPS: return "X86ISD::MOVLPS";
18907 case X86ISD::MOVLPD: return "X86ISD::MOVLPD";
18908 case X86ISD::MOVDDUP: return "X86ISD::MOVDDUP";
18909 case X86ISD::MOVSHDUP: return "X86ISD::MOVSHDUP";
18910 case X86ISD::MOVSLDUP: return "X86ISD::MOVSLDUP";
18911 case X86ISD::MOVSD: return "X86ISD::MOVSD";
18912 case X86ISD::MOVSS: return "X86ISD::MOVSS";
18913 case X86ISD::UNPCKL: return "X86ISD::UNPCKL";
18914 case X86ISD::UNPCKH: return "X86ISD::UNPCKH";
18915 case X86ISD::VBROADCAST: return "X86ISD::VBROADCAST";
18916 case X86ISD::VBROADCASTM: return "X86ISD::VBROADCASTM";
18917 case X86ISD::VEXTRACT: return "X86ISD::VEXTRACT";
18918 case X86ISD::VPERMILPI: return "X86ISD::VPERMILPI";
18919 case X86ISD::VPERM2X128: return "X86ISD::VPERM2X128";
18920 case X86ISD::VPERMV: return "X86ISD::VPERMV";
18921 case X86ISD::VPERMV3: return "X86ISD::VPERMV3";
18922 case X86ISD::VPERMIV3: return "X86ISD::VPERMIV3";
18923 case X86ISD::VPERMI: return "X86ISD::VPERMI";
18924 case X86ISD::PMULUDQ: return "X86ISD::PMULUDQ";
18925 case X86ISD::PMULDQ: return "X86ISD::PMULDQ";
18926 case X86ISD::VASTART_SAVE_XMM_REGS: return "X86ISD::VASTART_SAVE_XMM_REGS";
18927 case X86ISD::VAARG_64: return "X86ISD::VAARG_64";
18928 case X86ISD::WIN_ALLOCA: return "X86ISD::WIN_ALLOCA";
18929 case X86ISD::MEMBARRIER: return "X86ISD::MEMBARRIER";
18930 case X86ISD::SEG_ALLOCA: return "X86ISD::SEG_ALLOCA";
18931 case X86ISD::WIN_FTOL: return "X86ISD::WIN_FTOL";
18932 case X86ISD::SAHF: return "X86ISD::SAHF";
18933 case X86ISD::RDRAND: return "X86ISD::RDRAND";
18934 case X86ISD::RDSEED: return "X86ISD::RDSEED";
18935 case X86ISD::FMADD: return "X86ISD::FMADD";
18936 case X86ISD::FMSUB: return "X86ISD::FMSUB";
18937 case X86ISD::FNMADD: return "X86ISD::FNMADD";
18938 case X86ISD::FNMSUB: return "X86ISD::FNMSUB";
18939 case X86ISD::FMADDSUB: return "X86ISD::FMADDSUB";
18940 case X86ISD::FMSUBADD: return "X86ISD::FMSUBADD";
18941 case X86ISD::PCMPESTRI: return "X86ISD::PCMPESTRI";
18942 case X86ISD::PCMPISTRI: return "X86ISD::PCMPISTRI";
18943 case X86ISD::XTEST: return "X86ISD::XTEST";
18947 // isLegalAddressingMode - Return true if the addressing mode represented
18948 // by AM is legal for this target, for a load/store of the specified type.
18949 bool X86TargetLowering::isLegalAddressingMode(const AddrMode &AM,
18951 // X86 supports extremely general addressing modes.
18952 CodeModel::Model M = getTargetMachine().getCodeModel();
18953 Reloc::Model R = getTargetMachine().getRelocationModel();
18955 // X86 allows a sign-extended 32-bit immediate field as a displacement.
18956 if (!X86::isOffsetSuitableForCodeModel(AM.BaseOffs, M, AM.BaseGV != nullptr))
18961 Subtarget->ClassifyGlobalReference(AM.BaseGV, getTargetMachine());
18963 // If a reference to this global requires an extra load, we can't fold it.
18964 if (isGlobalStubReference(GVFlags))
18967 // If BaseGV requires a register for the PIC base, we cannot also have a
18968 // BaseReg specified.
18969 if (AM.HasBaseReg && isGlobalRelativeToPICBase(GVFlags))
18972 // If lower 4G is not available, then we must use rip-relative addressing.
18973 if ((M != CodeModel::Small || R != Reloc::Static) &&
18974 Subtarget->is64Bit() && (AM.BaseOffs || AM.Scale > 1))
18978 switch (AM.Scale) {
18984 // These scales always work.
18989 // These scales are formed with basereg+scalereg. Only accept if there is
18994 default: // Other stuff never works.
19001 bool X86TargetLowering::isVectorShiftByScalarCheap(Type *Ty) const {
19002 unsigned Bits = Ty->getScalarSizeInBits();
19004 // 8-bit shifts are always expensive, but versions with a scalar amount aren't
19005 // particularly cheaper than those without.
19009 // On AVX2 there are new vpsllv[dq] instructions (and other shifts), that make
19010 // variable shifts just as cheap as scalar ones.
19011 if (Subtarget->hasInt256() && (Bits == 32 || Bits == 64))
19014 // Otherwise, it's significantly cheaper to shift by a scalar amount than by a
19015 // fully general vector.
19019 bool X86TargetLowering::isTruncateFree(Type *Ty1, Type *Ty2) const {
19020 if (!Ty1->isIntegerTy() || !Ty2->isIntegerTy())
19022 unsigned NumBits1 = Ty1->getPrimitiveSizeInBits();
19023 unsigned NumBits2 = Ty2->getPrimitiveSizeInBits();
19024 return NumBits1 > NumBits2;
19027 bool X86TargetLowering::allowTruncateForTailCall(Type *Ty1, Type *Ty2) const {
19028 if (!Ty1->isIntegerTy() || !Ty2->isIntegerTy())
19031 if (!isTypeLegal(EVT::getEVT(Ty1)))
19034 assert(Ty1->getPrimitiveSizeInBits() <= 64 && "i128 is probably not a noop");
19036 // Assuming the caller doesn't have a zeroext or signext return parameter,
19037 // truncation all the way down to i1 is valid.
19041 bool X86TargetLowering::isLegalICmpImmediate(int64_t Imm) const {
19042 return isInt<32>(Imm);
19045 bool X86TargetLowering::isLegalAddImmediate(int64_t Imm) const {
19046 // Can also use sub to handle negated immediates.
19047 return isInt<32>(Imm);
19050 bool X86TargetLowering::isTruncateFree(EVT VT1, EVT VT2) const {
19051 if (!VT1.isInteger() || !VT2.isInteger())
19053 unsigned NumBits1 = VT1.getSizeInBits();
19054 unsigned NumBits2 = VT2.getSizeInBits();
19055 return NumBits1 > NumBits2;
19058 bool X86TargetLowering::isZExtFree(Type *Ty1, Type *Ty2) const {
19059 // x86-64 implicitly zero-extends 32-bit results in 64-bit registers.
19060 return Ty1->isIntegerTy(32) && Ty2->isIntegerTy(64) && Subtarget->is64Bit();
19063 bool X86TargetLowering::isZExtFree(EVT VT1, EVT VT2) const {
19064 // x86-64 implicitly zero-extends 32-bit results in 64-bit registers.
19065 return VT1 == MVT::i32 && VT2 == MVT::i64 && Subtarget->is64Bit();
19068 bool X86TargetLowering::isZExtFree(SDValue Val, EVT VT2) const {
19069 EVT VT1 = Val.getValueType();
19070 if (isZExtFree(VT1, VT2))
19073 if (Val.getOpcode() != ISD::LOAD)
19076 if (!VT1.isSimple() || !VT1.isInteger() ||
19077 !VT2.isSimple() || !VT2.isInteger())
19080 switch (VT1.getSimpleVT().SimpleTy) {
19085 // X86 has 8, 16, and 32-bit zero-extending loads.
19093 X86TargetLowering::isFMAFasterThanFMulAndFAdd(EVT VT) const {
19094 if (!(Subtarget->hasFMA() || Subtarget->hasFMA4()))
19097 VT = VT.getScalarType();
19099 if (!VT.isSimple())
19102 switch (VT.getSimpleVT().SimpleTy) {
19113 bool X86TargetLowering::isNarrowingProfitable(EVT VT1, EVT VT2) const {
19114 // i16 instructions are longer (0x66 prefix) and potentially slower.
19115 return !(VT1 == MVT::i32 && VT2 == MVT::i16);
19118 /// isShuffleMaskLegal - Targets can use this to indicate that they only
19119 /// support *some* VECTOR_SHUFFLE operations, those with specific masks.
19120 /// By default, if a target supports the VECTOR_SHUFFLE node, all mask values
19121 /// are assumed to be legal.
19123 X86TargetLowering::isShuffleMaskLegal(const SmallVectorImpl<int> &M,
19125 if (!VT.isSimple())
19128 MVT SVT = VT.getSimpleVT();
19130 // Very little shuffling can be done for 64-bit vectors right now.
19131 if (VT.getSizeInBits() == 64)
19134 // If this is a single-input shuffle with no 128 bit lane crossings we can
19135 // lower it into pshufb.
19136 if ((SVT.is128BitVector() && Subtarget->hasSSSE3()) ||
19137 (SVT.is256BitVector() && Subtarget->hasInt256())) {
19138 bool isLegal = true;
19139 for (unsigned I = 0, E = M.size(); I != E; ++I) {
19140 if (M[I] >= (int)SVT.getVectorNumElements() ||
19141 ShuffleCrosses128bitLane(SVT, I, M[I])) {
19150 // FIXME: blends, shifts.
19151 return (SVT.getVectorNumElements() == 2 ||
19152 ShuffleVectorSDNode::isSplatMask(&M[0], VT) ||
19153 isMOVLMask(M, SVT) ||
19154 isMOVHLPSMask(M, SVT) ||
19155 isSHUFPMask(M, SVT) ||
19156 isPSHUFDMask(M, SVT) ||
19157 isPSHUFHWMask(M, SVT, Subtarget->hasInt256()) ||
19158 isPSHUFLWMask(M, SVT, Subtarget->hasInt256()) ||
19159 isPALIGNRMask(M, SVT, Subtarget) ||
19160 isUNPCKLMask(M, SVT, Subtarget->hasInt256()) ||
19161 isUNPCKHMask(M, SVT, Subtarget->hasInt256()) ||
19162 isUNPCKL_v_undef_Mask(M, SVT, Subtarget->hasInt256()) ||
19163 isUNPCKH_v_undef_Mask(M, SVT, Subtarget->hasInt256()) ||
19164 isBlendMask(M, SVT, Subtarget->hasSSE41(), Subtarget->hasInt256()));
19168 X86TargetLowering::isVectorClearMaskLegal(const SmallVectorImpl<int> &Mask,
19170 if (!VT.isSimple())
19173 MVT SVT = VT.getSimpleVT();
19174 unsigned NumElts = SVT.getVectorNumElements();
19175 // FIXME: This collection of masks seems suspect.
19178 if (NumElts == 4 && SVT.is128BitVector()) {
19179 return (isMOVLMask(Mask, SVT) ||
19180 isCommutedMOVLMask(Mask, SVT, true) ||
19181 isSHUFPMask(Mask, SVT) ||
19182 isSHUFPMask(Mask, SVT, /* Commuted */ true));
19187 //===----------------------------------------------------------------------===//
19188 // X86 Scheduler Hooks
19189 //===----------------------------------------------------------------------===//
19191 /// Utility function to emit xbegin specifying the start of an RTM region.
19192 static MachineBasicBlock *EmitXBegin(MachineInstr *MI, MachineBasicBlock *MBB,
19193 const TargetInstrInfo *TII) {
19194 DebugLoc DL = MI->getDebugLoc();
19196 const BasicBlock *BB = MBB->getBasicBlock();
19197 MachineFunction::iterator I = MBB;
19200 // For the v = xbegin(), we generate
19211 MachineBasicBlock *thisMBB = MBB;
19212 MachineFunction *MF = MBB->getParent();
19213 MachineBasicBlock *mainMBB = MF->CreateMachineBasicBlock(BB);
19214 MachineBasicBlock *sinkMBB = MF->CreateMachineBasicBlock(BB);
19215 MF->insert(I, mainMBB);
19216 MF->insert(I, sinkMBB);
19218 // Transfer the remainder of BB and its successor edges to sinkMBB.
19219 sinkMBB->splice(sinkMBB->begin(), MBB,
19220 std::next(MachineBasicBlock::iterator(MI)), MBB->end());
19221 sinkMBB->transferSuccessorsAndUpdatePHIs(MBB);
19225 // # fallthrough to mainMBB
19226 // # abortion to sinkMBB
19227 BuildMI(thisMBB, DL, TII->get(X86::XBEGIN_4)).addMBB(sinkMBB);
19228 thisMBB->addSuccessor(mainMBB);
19229 thisMBB->addSuccessor(sinkMBB);
19233 BuildMI(mainMBB, DL, TII->get(X86::MOV32ri), X86::EAX).addImm(-1);
19234 mainMBB->addSuccessor(sinkMBB);
19237 // EAX is live into the sinkMBB
19238 sinkMBB->addLiveIn(X86::EAX);
19239 BuildMI(*sinkMBB, sinkMBB->begin(), DL,
19240 TII->get(TargetOpcode::COPY), MI->getOperand(0).getReg())
19243 MI->eraseFromParent();
19247 // FIXME: When we get size specific XMM0 registers, i.e. XMM0_V16I8
19248 // or XMM0_V32I8 in AVX all of this code can be replaced with that
19249 // in the .td file.
19250 static MachineBasicBlock *EmitPCMPSTRM(MachineInstr *MI, MachineBasicBlock *BB,
19251 const TargetInstrInfo *TII) {
19253 switch (MI->getOpcode()) {
19254 default: llvm_unreachable("illegal opcode!");
19255 case X86::PCMPISTRM128REG: Opc = X86::PCMPISTRM128rr; break;
19256 case X86::VPCMPISTRM128REG: Opc = X86::VPCMPISTRM128rr; break;
19257 case X86::PCMPISTRM128MEM: Opc = X86::PCMPISTRM128rm; break;
19258 case X86::VPCMPISTRM128MEM: Opc = X86::VPCMPISTRM128rm; break;
19259 case X86::PCMPESTRM128REG: Opc = X86::PCMPESTRM128rr; break;
19260 case X86::VPCMPESTRM128REG: Opc = X86::VPCMPESTRM128rr; break;
19261 case X86::PCMPESTRM128MEM: Opc = X86::PCMPESTRM128rm; break;
19262 case X86::VPCMPESTRM128MEM: Opc = X86::VPCMPESTRM128rm; break;
19265 DebugLoc dl = MI->getDebugLoc();
19266 MachineInstrBuilder MIB = BuildMI(*BB, MI, dl, TII->get(Opc));
19268 unsigned NumArgs = MI->getNumOperands();
19269 for (unsigned i = 1; i < NumArgs; ++i) {
19270 MachineOperand &Op = MI->getOperand(i);
19271 if (!(Op.isReg() && Op.isImplicit()))
19272 MIB.addOperand(Op);
19274 if (MI->hasOneMemOperand())
19275 MIB->setMemRefs(MI->memoperands_begin(), MI->memoperands_end());
19277 BuildMI(*BB, MI, dl,
19278 TII->get(TargetOpcode::COPY), MI->getOperand(0).getReg())
19279 .addReg(X86::XMM0);
19281 MI->eraseFromParent();
19285 // FIXME: Custom handling because TableGen doesn't support multiple implicit
19286 // defs in an instruction pattern
19287 static MachineBasicBlock *EmitPCMPSTRI(MachineInstr *MI, MachineBasicBlock *BB,
19288 const TargetInstrInfo *TII) {
19290 switch (MI->getOpcode()) {
19291 default: llvm_unreachable("illegal opcode!");
19292 case X86::PCMPISTRIREG: Opc = X86::PCMPISTRIrr; break;
19293 case X86::VPCMPISTRIREG: Opc = X86::VPCMPISTRIrr; break;
19294 case X86::PCMPISTRIMEM: Opc = X86::PCMPISTRIrm; break;
19295 case X86::VPCMPISTRIMEM: Opc = X86::VPCMPISTRIrm; break;
19296 case X86::PCMPESTRIREG: Opc = X86::PCMPESTRIrr; break;
19297 case X86::VPCMPESTRIREG: Opc = X86::VPCMPESTRIrr; break;
19298 case X86::PCMPESTRIMEM: Opc = X86::PCMPESTRIrm; break;
19299 case X86::VPCMPESTRIMEM: Opc = X86::VPCMPESTRIrm; break;
19302 DebugLoc dl = MI->getDebugLoc();
19303 MachineInstrBuilder MIB = BuildMI(*BB, MI, dl, TII->get(Opc));
19305 unsigned NumArgs = MI->getNumOperands(); // remove the results
19306 for (unsigned i = 1; i < NumArgs; ++i) {
19307 MachineOperand &Op = MI->getOperand(i);
19308 if (!(Op.isReg() && Op.isImplicit()))
19309 MIB.addOperand(Op);
19311 if (MI->hasOneMemOperand())
19312 MIB->setMemRefs(MI->memoperands_begin(), MI->memoperands_end());
19314 BuildMI(*BB, MI, dl,
19315 TII->get(TargetOpcode::COPY), MI->getOperand(0).getReg())
19318 MI->eraseFromParent();
19322 static MachineBasicBlock * EmitMonitor(MachineInstr *MI, MachineBasicBlock *BB,
19323 const TargetInstrInfo *TII,
19324 const X86Subtarget* Subtarget) {
19325 DebugLoc dl = MI->getDebugLoc();
19327 // Address into RAX/EAX, other two args into ECX, EDX.
19328 unsigned MemOpc = Subtarget->is64Bit() ? X86::LEA64r : X86::LEA32r;
19329 unsigned MemReg = Subtarget->is64Bit() ? X86::RAX : X86::EAX;
19330 MachineInstrBuilder MIB = BuildMI(*BB, MI, dl, TII->get(MemOpc), MemReg);
19331 for (int i = 0; i < X86::AddrNumOperands; ++i)
19332 MIB.addOperand(MI->getOperand(i));
19334 unsigned ValOps = X86::AddrNumOperands;
19335 BuildMI(*BB, MI, dl, TII->get(TargetOpcode::COPY), X86::ECX)
19336 .addReg(MI->getOperand(ValOps).getReg());
19337 BuildMI(*BB, MI, dl, TII->get(TargetOpcode::COPY), X86::EDX)
19338 .addReg(MI->getOperand(ValOps+1).getReg());
19340 // The instruction doesn't actually take any operands though.
19341 BuildMI(*BB, MI, dl, TII->get(X86::MONITORrrr));
19343 MI->eraseFromParent(); // The pseudo is gone now.
19347 MachineBasicBlock *
19348 X86TargetLowering::EmitVAARG64WithCustomInserter(
19350 MachineBasicBlock *MBB) const {
19351 // Emit va_arg instruction on X86-64.
19353 // Operands to this pseudo-instruction:
19354 // 0 ) Output : destination address (reg)
19355 // 1-5) Input : va_list address (addr, i64mem)
19356 // 6 ) ArgSize : Size (in bytes) of vararg type
19357 // 7 ) ArgMode : 0=overflow only, 1=use gp_offset, 2=use fp_offset
19358 // 8 ) Align : Alignment of type
19359 // 9 ) EFLAGS (implicit-def)
19361 assert(MI->getNumOperands() == 10 && "VAARG_64 should have 10 operands!");
19362 assert(X86::AddrNumOperands == 5 && "VAARG_64 assumes 5 address operands");
19364 unsigned DestReg = MI->getOperand(0).getReg();
19365 MachineOperand &Base = MI->getOperand(1);
19366 MachineOperand &Scale = MI->getOperand(2);
19367 MachineOperand &Index = MI->getOperand(3);
19368 MachineOperand &Disp = MI->getOperand(4);
19369 MachineOperand &Segment = MI->getOperand(5);
19370 unsigned ArgSize = MI->getOperand(6).getImm();
19371 unsigned ArgMode = MI->getOperand(7).getImm();
19372 unsigned Align = MI->getOperand(8).getImm();
19374 // Memory Reference
19375 assert(MI->hasOneMemOperand() && "Expected VAARG_64 to have one memoperand");
19376 MachineInstr::mmo_iterator MMOBegin = MI->memoperands_begin();
19377 MachineInstr::mmo_iterator MMOEnd = MI->memoperands_end();
19379 // Machine Information
19380 const TargetInstrInfo *TII = MBB->getParent()->getSubtarget().getInstrInfo();
19381 MachineRegisterInfo &MRI = MBB->getParent()->getRegInfo();
19382 const TargetRegisterClass *AddrRegClass = getRegClassFor(MVT::i64);
19383 const TargetRegisterClass *OffsetRegClass = getRegClassFor(MVT::i32);
19384 DebugLoc DL = MI->getDebugLoc();
19386 // struct va_list {
19389 // i64 overflow_area (address)
19390 // i64 reg_save_area (address)
19392 // sizeof(va_list) = 24
19393 // alignment(va_list) = 8
19395 unsigned TotalNumIntRegs = 6;
19396 unsigned TotalNumXMMRegs = 8;
19397 bool UseGPOffset = (ArgMode == 1);
19398 bool UseFPOffset = (ArgMode == 2);
19399 unsigned MaxOffset = TotalNumIntRegs * 8 +
19400 (UseFPOffset ? TotalNumXMMRegs * 16 : 0);
19402 /* Align ArgSize to a multiple of 8 */
19403 unsigned ArgSizeA8 = (ArgSize + 7) & ~7;
19404 bool NeedsAlign = (Align > 8);
19406 MachineBasicBlock *thisMBB = MBB;
19407 MachineBasicBlock *overflowMBB;
19408 MachineBasicBlock *offsetMBB;
19409 MachineBasicBlock *endMBB;
19411 unsigned OffsetDestReg = 0; // Argument address computed by offsetMBB
19412 unsigned OverflowDestReg = 0; // Argument address computed by overflowMBB
19413 unsigned OffsetReg = 0;
19415 if (!UseGPOffset && !UseFPOffset) {
19416 // If we only pull from the overflow region, we don't create a branch.
19417 // We don't need to alter control flow.
19418 OffsetDestReg = 0; // unused
19419 OverflowDestReg = DestReg;
19421 offsetMBB = nullptr;
19422 overflowMBB = thisMBB;
19425 // First emit code to check if gp_offset (or fp_offset) is below the bound.
19426 // If so, pull the argument from reg_save_area. (branch to offsetMBB)
19427 // If not, pull from overflow_area. (branch to overflowMBB)
19432 // offsetMBB overflowMBB
19437 // Registers for the PHI in endMBB
19438 OffsetDestReg = MRI.createVirtualRegister(AddrRegClass);
19439 OverflowDestReg = MRI.createVirtualRegister(AddrRegClass);
19441 const BasicBlock *LLVM_BB = MBB->getBasicBlock();
19442 MachineFunction *MF = MBB->getParent();
19443 overflowMBB = MF->CreateMachineBasicBlock(LLVM_BB);
19444 offsetMBB = MF->CreateMachineBasicBlock(LLVM_BB);
19445 endMBB = MF->CreateMachineBasicBlock(LLVM_BB);
19447 MachineFunction::iterator MBBIter = MBB;
19450 // Insert the new basic blocks
19451 MF->insert(MBBIter, offsetMBB);
19452 MF->insert(MBBIter, overflowMBB);
19453 MF->insert(MBBIter, endMBB);
19455 // Transfer the remainder of MBB and its successor edges to endMBB.
19456 endMBB->splice(endMBB->begin(), thisMBB,
19457 std::next(MachineBasicBlock::iterator(MI)), thisMBB->end());
19458 endMBB->transferSuccessorsAndUpdatePHIs(thisMBB);
19460 // Make offsetMBB and overflowMBB successors of thisMBB
19461 thisMBB->addSuccessor(offsetMBB);
19462 thisMBB->addSuccessor(overflowMBB);
19464 // endMBB is a successor of both offsetMBB and overflowMBB
19465 offsetMBB->addSuccessor(endMBB);
19466 overflowMBB->addSuccessor(endMBB);
19468 // Load the offset value into a register
19469 OffsetReg = MRI.createVirtualRegister(OffsetRegClass);
19470 BuildMI(thisMBB, DL, TII->get(X86::MOV32rm), OffsetReg)
19474 .addDisp(Disp, UseFPOffset ? 4 : 0)
19475 .addOperand(Segment)
19476 .setMemRefs(MMOBegin, MMOEnd);
19478 // Check if there is enough room left to pull this argument.
19479 BuildMI(thisMBB, DL, TII->get(X86::CMP32ri))
19481 .addImm(MaxOffset + 8 - ArgSizeA8);
19483 // Branch to "overflowMBB" if offset >= max
19484 // Fall through to "offsetMBB" otherwise
19485 BuildMI(thisMBB, DL, TII->get(X86::GetCondBranchFromCond(X86::COND_AE)))
19486 .addMBB(overflowMBB);
19489 // In offsetMBB, emit code to use the reg_save_area.
19491 assert(OffsetReg != 0);
19493 // Read the reg_save_area address.
19494 unsigned RegSaveReg = MRI.createVirtualRegister(AddrRegClass);
19495 BuildMI(offsetMBB, DL, TII->get(X86::MOV64rm), RegSaveReg)
19500 .addOperand(Segment)
19501 .setMemRefs(MMOBegin, MMOEnd);
19503 // Zero-extend the offset
19504 unsigned OffsetReg64 = MRI.createVirtualRegister(AddrRegClass);
19505 BuildMI(offsetMBB, DL, TII->get(X86::SUBREG_TO_REG), OffsetReg64)
19508 .addImm(X86::sub_32bit);
19510 // Add the offset to the reg_save_area to get the final address.
19511 BuildMI(offsetMBB, DL, TII->get(X86::ADD64rr), OffsetDestReg)
19512 .addReg(OffsetReg64)
19513 .addReg(RegSaveReg);
19515 // Compute the offset for the next argument
19516 unsigned NextOffsetReg = MRI.createVirtualRegister(OffsetRegClass);
19517 BuildMI(offsetMBB, DL, TII->get(X86::ADD32ri), NextOffsetReg)
19519 .addImm(UseFPOffset ? 16 : 8);
19521 // Store it back into the va_list.
19522 BuildMI(offsetMBB, DL, TII->get(X86::MOV32mr))
19526 .addDisp(Disp, UseFPOffset ? 4 : 0)
19527 .addOperand(Segment)
19528 .addReg(NextOffsetReg)
19529 .setMemRefs(MMOBegin, MMOEnd);
19532 BuildMI(offsetMBB, DL, TII->get(X86::JMP_4))
19537 // Emit code to use overflow area
19540 // Load the overflow_area address into a register.
19541 unsigned OverflowAddrReg = MRI.createVirtualRegister(AddrRegClass);
19542 BuildMI(overflowMBB, DL, TII->get(X86::MOV64rm), OverflowAddrReg)
19547 .addOperand(Segment)
19548 .setMemRefs(MMOBegin, MMOEnd);
19550 // If we need to align it, do so. Otherwise, just copy the address
19551 // to OverflowDestReg.
19553 // Align the overflow address
19554 assert((Align & (Align-1)) == 0 && "Alignment must be a power of 2");
19555 unsigned TmpReg = MRI.createVirtualRegister(AddrRegClass);
19557 // aligned_addr = (addr + (align-1)) & ~(align-1)
19558 BuildMI(overflowMBB, DL, TII->get(X86::ADD64ri32), TmpReg)
19559 .addReg(OverflowAddrReg)
19562 BuildMI(overflowMBB, DL, TII->get(X86::AND64ri32), OverflowDestReg)
19564 .addImm(~(uint64_t)(Align-1));
19566 BuildMI(overflowMBB, DL, TII->get(TargetOpcode::COPY), OverflowDestReg)
19567 .addReg(OverflowAddrReg);
19570 // Compute the next overflow address after this argument.
19571 // (the overflow address should be kept 8-byte aligned)
19572 unsigned NextAddrReg = MRI.createVirtualRegister(AddrRegClass);
19573 BuildMI(overflowMBB, DL, TII->get(X86::ADD64ri32), NextAddrReg)
19574 .addReg(OverflowDestReg)
19575 .addImm(ArgSizeA8);
19577 // Store the new overflow address.
19578 BuildMI(overflowMBB, DL, TII->get(X86::MOV64mr))
19583 .addOperand(Segment)
19584 .addReg(NextAddrReg)
19585 .setMemRefs(MMOBegin, MMOEnd);
19587 // If we branched, emit the PHI to the front of endMBB.
19589 BuildMI(*endMBB, endMBB->begin(), DL,
19590 TII->get(X86::PHI), DestReg)
19591 .addReg(OffsetDestReg).addMBB(offsetMBB)
19592 .addReg(OverflowDestReg).addMBB(overflowMBB);
19595 // Erase the pseudo instruction
19596 MI->eraseFromParent();
19601 MachineBasicBlock *
19602 X86TargetLowering::EmitVAStartSaveXMMRegsWithCustomInserter(
19604 MachineBasicBlock *MBB) const {
19605 // Emit code to save XMM registers to the stack. The ABI says that the
19606 // number of registers to save is given in %al, so it's theoretically
19607 // possible to do an indirect jump trick to avoid saving all of them,
19608 // however this code takes a simpler approach and just executes all
19609 // of the stores if %al is non-zero. It's less code, and it's probably
19610 // easier on the hardware branch predictor, and stores aren't all that
19611 // expensive anyway.
19613 // Create the new basic blocks. One block contains all the XMM stores,
19614 // and one block is the final destination regardless of whether any
19615 // stores were performed.
19616 const BasicBlock *LLVM_BB = MBB->getBasicBlock();
19617 MachineFunction *F = MBB->getParent();
19618 MachineFunction::iterator MBBIter = MBB;
19620 MachineBasicBlock *XMMSaveMBB = F->CreateMachineBasicBlock(LLVM_BB);
19621 MachineBasicBlock *EndMBB = F->CreateMachineBasicBlock(LLVM_BB);
19622 F->insert(MBBIter, XMMSaveMBB);
19623 F->insert(MBBIter, EndMBB);
19625 // Transfer the remainder of MBB and its successor edges to EndMBB.
19626 EndMBB->splice(EndMBB->begin(), MBB,
19627 std::next(MachineBasicBlock::iterator(MI)), MBB->end());
19628 EndMBB->transferSuccessorsAndUpdatePHIs(MBB);
19630 // The original block will now fall through to the XMM save block.
19631 MBB->addSuccessor(XMMSaveMBB);
19632 // The XMMSaveMBB will fall through to the end block.
19633 XMMSaveMBB->addSuccessor(EndMBB);
19635 // Now add the instructions.
19636 const TargetInstrInfo *TII = MBB->getParent()->getSubtarget().getInstrInfo();
19637 DebugLoc DL = MI->getDebugLoc();
19639 unsigned CountReg = MI->getOperand(0).getReg();
19640 int64_t RegSaveFrameIndex = MI->getOperand(1).getImm();
19641 int64_t VarArgsFPOffset = MI->getOperand(2).getImm();
19643 if (!Subtarget->isTargetWin64()) {
19644 // If %al is 0, branch around the XMM save block.
19645 BuildMI(MBB, DL, TII->get(X86::TEST8rr)).addReg(CountReg).addReg(CountReg);
19646 BuildMI(MBB, DL, TII->get(X86::JE_4)).addMBB(EndMBB);
19647 MBB->addSuccessor(EndMBB);
19650 // Make sure the last operand is EFLAGS, which gets clobbered by the branch
19651 // that was just emitted, but clearly shouldn't be "saved".
19652 assert((MI->getNumOperands() <= 3 ||
19653 !MI->getOperand(MI->getNumOperands() - 1).isReg() ||
19654 MI->getOperand(MI->getNumOperands() - 1).getReg() == X86::EFLAGS)
19655 && "Expected last argument to be EFLAGS");
19656 unsigned MOVOpc = Subtarget->hasFp256() ? X86::VMOVAPSmr : X86::MOVAPSmr;
19657 // In the XMM save block, save all the XMM argument registers.
19658 for (int i = 3, e = MI->getNumOperands() - 1; i != e; ++i) {
19659 int64_t Offset = (i - 3) * 16 + VarArgsFPOffset;
19660 MachineMemOperand *MMO =
19661 F->getMachineMemOperand(
19662 MachinePointerInfo::getFixedStack(RegSaveFrameIndex, Offset),
19663 MachineMemOperand::MOStore,
19664 /*Size=*/16, /*Align=*/16);
19665 BuildMI(XMMSaveMBB, DL, TII->get(MOVOpc))
19666 .addFrameIndex(RegSaveFrameIndex)
19667 .addImm(/*Scale=*/1)
19668 .addReg(/*IndexReg=*/0)
19669 .addImm(/*Disp=*/Offset)
19670 .addReg(/*Segment=*/0)
19671 .addReg(MI->getOperand(i).getReg())
19672 .addMemOperand(MMO);
19675 MI->eraseFromParent(); // The pseudo instruction is gone now.
19680 // The EFLAGS operand of SelectItr might be missing a kill marker
19681 // because there were multiple uses of EFLAGS, and ISel didn't know
19682 // which to mark. Figure out whether SelectItr should have had a
19683 // kill marker, and set it if it should. Returns the correct kill
19685 static bool checkAndUpdateEFLAGSKill(MachineBasicBlock::iterator SelectItr,
19686 MachineBasicBlock* BB,
19687 const TargetRegisterInfo* TRI) {
19688 // Scan forward through BB for a use/def of EFLAGS.
19689 MachineBasicBlock::iterator miI(std::next(SelectItr));
19690 for (MachineBasicBlock::iterator miE = BB->end(); miI != miE; ++miI) {
19691 const MachineInstr& mi = *miI;
19692 if (mi.readsRegister(X86::EFLAGS))
19694 if (mi.definesRegister(X86::EFLAGS))
19695 break; // Should have kill-flag - update below.
19698 // If we hit the end of the block, check whether EFLAGS is live into a
19700 if (miI == BB->end()) {
19701 for (MachineBasicBlock::succ_iterator sItr = BB->succ_begin(),
19702 sEnd = BB->succ_end();
19703 sItr != sEnd; ++sItr) {
19704 MachineBasicBlock* succ = *sItr;
19705 if (succ->isLiveIn(X86::EFLAGS))
19710 // We found a def, or hit the end of the basic block and EFLAGS wasn't live
19711 // out. SelectMI should have a kill flag on EFLAGS.
19712 SelectItr->addRegisterKilled(X86::EFLAGS, TRI);
19716 MachineBasicBlock *
19717 X86TargetLowering::EmitLoweredSelect(MachineInstr *MI,
19718 MachineBasicBlock *BB) const {
19719 const TargetInstrInfo *TII = BB->getParent()->getSubtarget().getInstrInfo();
19720 DebugLoc DL = MI->getDebugLoc();
19722 // To "insert" a SELECT_CC instruction, we actually have to insert the
19723 // diamond control-flow pattern. The incoming instruction knows the
19724 // destination vreg to set, the condition code register to branch on, the
19725 // true/false values to select between, and a branch opcode to use.
19726 const BasicBlock *LLVM_BB = BB->getBasicBlock();
19727 MachineFunction::iterator It = BB;
19733 // cmpTY ccX, r1, r2
19735 // fallthrough --> copy0MBB
19736 MachineBasicBlock *thisMBB = BB;
19737 MachineFunction *F = BB->getParent();
19738 MachineBasicBlock *copy0MBB = F->CreateMachineBasicBlock(LLVM_BB);
19739 MachineBasicBlock *sinkMBB = F->CreateMachineBasicBlock(LLVM_BB);
19740 F->insert(It, copy0MBB);
19741 F->insert(It, sinkMBB);
19743 // If the EFLAGS register isn't dead in the terminator, then claim that it's
19744 // live into the sink and copy blocks.
19745 const TargetRegisterInfo *TRI =
19746 BB->getParent()->getSubtarget().getRegisterInfo();
19747 if (!MI->killsRegister(X86::EFLAGS) &&
19748 !checkAndUpdateEFLAGSKill(MI, BB, TRI)) {
19749 copy0MBB->addLiveIn(X86::EFLAGS);
19750 sinkMBB->addLiveIn(X86::EFLAGS);
19753 // Transfer the remainder of BB and its successor edges to sinkMBB.
19754 sinkMBB->splice(sinkMBB->begin(), BB,
19755 std::next(MachineBasicBlock::iterator(MI)), BB->end());
19756 sinkMBB->transferSuccessorsAndUpdatePHIs(BB);
19758 // Add the true and fallthrough blocks as its successors.
19759 BB->addSuccessor(copy0MBB);
19760 BB->addSuccessor(sinkMBB);
19762 // Create the conditional branch instruction.
19764 X86::GetCondBranchFromCond((X86::CondCode)MI->getOperand(3).getImm());
19765 BuildMI(BB, DL, TII->get(Opc)).addMBB(sinkMBB);
19768 // %FalseValue = ...
19769 // # fallthrough to sinkMBB
19770 copy0MBB->addSuccessor(sinkMBB);
19773 // %Result = phi [ %FalseValue, copy0MBB ], [ %TrueValue, thisMBB ]
19775 BuildMI(*sinkMBB, sinkMBB->begin(), DL,
19776 TII->get(X86::PHI), MI->getOperand(0).getReg())
19777 .addReg(MI->getOperand(1).getReg()).addMBB(copy0MBB)
19778 .addReg(MI->getOperand(2).getReg()).addMBB(thisMBB);
19780 MI->eraseFromParent(); // The pseudo instruction is gone now.
19784 MachineBasicBlock *
19785 X86TargetLowering::EmitLoweredSegAlloca(MachineInstr *MI,
19786 MachineBasicBlock *BB) const {
19787 MachineFunction *MF = BB->getParent();
19788 const TargetInstrInfo *TII = MF->getSubtarget().getInstrInfo();
19789 DebugLoc DL = MI->getDebugLoc();
19790 const BasicBlock *LLVM_BB = BB->getBasicBlock();
19792 assert(MF->shouldSplitStack());
19794 const bool Is64Bit = Subtarget->is64Bit();
19795 const bool IsLP64 = Subtarget->isTarget64BitLP64();
19797 const unsigned TlsReg = Is64Bit ? X86::FS : X86::GS;
19798 const unsigned TlsOffset = IsLP64 ? 0x70 : Is64Bit ? 0x40 : 0x30;
19801 // ... [Till the alloca]
19802 // If stacklet is not large enough, jump to mallocMBB
19805 // Allocate by subtracting from RSP
19806 // Jump to continueMBB
19809 // Allocate by call to runtime
19813 // [rest of original BB]
19816 MachineBasicBlock *mallocMBB = MF->CreateMachineBasicBlock(LLVM_BB);
19817 MachineBasicBlock *bumpMBB = MF->CreateMachineBasicBlock(LLVM_BB);
19818 MachineBasicBlock *continueMBB = MF->CreateMachineBasicBlock(LLVM_BB);
19820 MachineRegisterInfo &MRI = MF->getRegInfo();
19821 const TargetRegisterClass *AddrRegClass =
19822 getRegClassFor(getPointerTy());
19824 unsigned mallocPtrVReg = MRI.createVirtualRegister(AddrRegClass),
19825 bumpSPPtrVReg = MRI.createVirtualRegister(AddrRegClass),
19826 tmpSPVReg = MRI.createVirtualRegister(AddrRegClass),
19827 SPLimitVReg = MRI.createVirtualRegister(AddrRegClass),
19828 sizeVReg = MI->getOperand(1).getReg(),
19829 physSPReg = IsLP64 || Subtarget->isTargetNaCl64() ? X86::RSP : X86::ESP;
19831 MachineFunction::iterator MBBIter = BB;
19834 MF->insert(MBBIter, bumpMBB);
19835 MF->insert(MBBIter, mallocMBB);
19836 MF->insert(MBBIter, continueMBB);
19838 continueMBB->splice(continueMBB->begin(), BB,
19839 std::next(MachineBasicBlock::iterator(MI)), BB->end());
19840 continueMBB->transferSuccessorsAndUpdatePHIs(BB);
19842 // Add code to the main basic block to check if the stack limit has been hit,
19843 // and if so, jump to mallocMBB otherwise to bumpMBB.
19844 BuildMI(BB, DL, TII->get(TargetOpcode::COPY), tmpSPVReg).addReg(physSPReg);
19845 BuildMI(BB, DL, TII->get(IsLP64 ? X86::SUB64rr:X86::SUB32rr), SPLimitVReg)
19846 .addReg(tmpSPVReg).addReg(sizeVReg);
19847 BuildMI(BB, DL, TII->get(IsLP64 ? X86::CMP64mr:X86::CMP32mr))
19848 .addReg(0).addImm(1).addReg(0).addImm(TlsOffset).addReg(TlsReg)
19849 .addReg(SPLimitVReg);
19850 BuildMI(BB, DL, TII->get(X86::JG_4)).addMBB(mallocMBB);
19852 // bumpMBB simply decreases the stack pointer, since we know the current
19853 // stacklet has enough space.
19854 BuildMI(bumpMBB, DL, TII->get(TargetOpcode::COPY), physSPReg)
19855 .addReg(SPLimitVReg);
19856 BuildMI(bumpMBB, DL, TII->get(TargetOpcode::COPY), bumpSPPtrVReg)
19857 .addReg(SPLimitVReg);
19858 BuildMI(bumpMBB, DL, TII->get(X86::JMP_4)).addMBB(continueMBB);
19860 // Calls into a routine in libgcc to allocate more space from the heap.
19861 const uint32_t *RegMask = MF->getTarget()
19862 .getSubtargetImpl()
19863 ->getRegisterInfo()
19864 ->getCallPreservedMask(CallingConv::C);
19866 BuildMI(mallocMBB, DL, TII->get(X86::MOV64rr), X86::RDI)
19868 BuildMI(mallocMBB, DL, TII->get(X86::CALL64pcrel32))
19869 .addExternalSymbol("__morestack_allocate_stack_space")
19870 .addRegMask(RegMask)
19871 .addReg(X86::RDI, RegState::Implicit)
19872 .addReg(X86::RAX, RegState::ImplicitDefine);
19873 } else if (Is64Bit) {
19874 BuildMI(mallocMBB, DL, TII->get(X86::MOV32rr), X86::EDI)
19876 BuildMI(mallocMBB, DL, TII->get(X86::CALL64pcrel32))
19877 .addExternalSymbol("__morestack_allocate_stack_space")
19878 .addRegMask(RegMask)
19879 .addReg(X86::EDI, RegState::Implicit)
19880 .addReg(X86::EAX, RegState::ImplicitDefine);
19882 BuildMI(mallocMBB, DL, TII->get(X86::SUB32ri), physSPReg).addReg(physSPReg)
19884 BuildMI(mallocMBB, DL, TII->get(X86::PUSH32r)).addReg(sizeVReg);
19885 BuildMI(mallocMBB, DL, TII->get(X86::CALLpcrel32))
19886 .addExternalSymbol("__morestack_allocate_stack_space")
19887 .addRegMask(RegMask)
19888 .addReg(X86::EAX, RegState::ImplicitDefine);
19892 BuildMI(mallocMBB, DL, TII->get(X86::ADD32ri), physSPReg).addReg(physSPReg)
19895 BuildMI(mallocMBB, DL, TII->get(TargetOpcode::COPY), mallocPtrVReg)
19896 .addReg(IsLP64 ? X86::RAX : X86::EAX);
19897 BuildMI(mallocMBB, DL, TII->get(X86::JMP_4)).addMBB(continueMBB);
19899 // Set up the CFG correctly.
19900 BB->addSuccessor(bumpMBB);
19901 BB->addSuccessor(mallocMBB);
19902 mallocMBB->addSuccessor(continueMBB);
19903 bumpMBB->addSuccessor(continueMBB);
19905 // Take care of the PHI nodes.
19906 BuildMI(*continueMBB, continueMBB->begin(), DL, TII->get(X86::PHI),
19907 MI->getOperand(0).getReg())
19908 .addReg(mallocPtrVReg).addMBB(mallocMBB)
19909 .addReg(bumpSPPtrVReg).addMBB(bumpMBB);
19911 // Delete the original pseudo instruction.
19912 MI->eraseFromParent();
19915 return continueMBB;
19918 MachineBasicBlock *
19919 X86TargetLowering::EmitLoweredWinAlloca(MachineInstr *MI,
19920 MachineBasicBlock *BB) const {
19921 const TargetInstrInfo *TII = BB->getParent()->getSubtarget().getInstrInfo();
19922 DebugLoc DL = MI->getDebugLoc();
19924 assert(!Subtarget->isTargetMacho());
19926 // The lowering is pretty easy: we're just emitting the call to _alloca. The
19927 // non-trivial part is impdef of ESP.
19929 if (Subtarget->isTargetWin64()) {
19930 if (Subtarget->isTargetCygMing()) {
19931 // ___chkstk(Mingw64):
19932 // Clobbers R10, R11, RAX and EFLAGS.
19934 BuildMI(*BB, MI, DL, TII->get(X86::W64ALLOCA))
19935 .addExternalSymbol("___chkstk")
19936 .addReg(X86::RAX, RegState::Implicit)
19937 .addReg(X86::RSP, RegState::Implicit)
19938 .addReg(X86::RAX, RegState::Define | RegState::Implicit)
19939 .addReg(X86::RSP, RegState::Define | RegState::Implicit)
19940 .addReg(X86::EFLAGS, RegState::Define | RegState::Implicit);
19942 // __chkstk(MSVCRT): does not update stack pointer.
19943 // Clobbers R10, R11 and EFLAGS.
19944 BuildMI(*BB, MI, DL, TII->get(X86::W64ALLOCA))
19945 .addExternalSymbol("__chkstk")
19946 .addReg(X86::RAX, RegState::Implicit)
19947 .addReg(X86::EFLAGS, RegState::Define | RegState::Implicit);
19948 // RAX has the offset to be subtracted from RSP.
19949 BuildMI(*BB, MI, DL, TII->get(X86::SUB64rr), X86::RSP)
19954 const char *StackProbeSymbol =
19955 Subtarget->isTargetKnownWindowsMSVC() ? "_chkstk" : "_alloca";
19957 BuildMI(*BB, MI, DL, TII->get(X86::CALLpcrel32))
19958 .addExternalSymbol(StackProbeSymbol)
19959 .addReg(X86::EAX, RegState::Implicit)
19960 .addReg(X86::ESP, RegState::Implicit)
19961 .addReg(X86::EAX, RegState::Define | RegState::Implicit)
19962 .addReg(X86::ESP, RegState::Define | RegState::Implicit)
19963 .addReg(X86::EFLAGS, RegState::Define | RegState::Implicit);
19966 MI->eraseFromParent(); // The pseudo instruction is gone now.
19970 MachineBasicBlock *
19971 X86TargetLowering::EmitLoweredTLSCall(MachineInstr *MI,
19972 MachineBasicBlock *BB) const {
19973 // This is pretty easy. We're taking the value that we received from
19974 // our load from the relocation, sticking it in either RDI (x86-64)
19975 // or EAX and doing an indirect call. The return value will then
19976 // be in the normal return register.
19977 MachineFunction *F = BB->getParent();
19978 const X86InstrInfo *TII =
19979 static_cast<const X86InstrInfo *>(F->getSubtarget().getInstrInfo());
19980 DebugLoc DL = MI->getDebugLoc();
19982 assert(Subtarget->isTargetDarwin() && "Darwin only instr emitted?");
19983 assert(MI->getOperand(3).isGlobal() && "This should be a global");
19985 // Get a register mask for the lowered call.
19986 // FIXME: The 32-bit calls have non-standard calling conventions. Use a
19987 // proper register mask.
19988 const uint32_t *RegMask = F->getTarget()
19989 .getSubtargetImpl()
19990 ->getRegisterInfo()
19991 ->getCallPreservedMask(CallingConv::C);
19992 if (Subtarget->is64Bit()) {
19993 MachineInstrBuilder MIB = BuildMI(*BB, MI, DL,
19994 TII->get(X86::MOV64rm), X86::RDI)
19996 .addImm(0).addReg(0)
19997 .addGlobalAddress(MI->getOperand(3).getGlobal(), 0,
19998 MI->getOperand(3).getTargetFlags())
20000 MIB = BuildMI(*BB, MI, DL, TII->get(X86::CALL64m));
20001 addDirectMem(MIB, X86::RDI);
20002 MIB.addReg(X86::RAX, RegState::ImplicitDefine).addRegMask(RegMask);
20003 } else if (F->getTarget().getRelocationModel() != Reloc::PIC_) {
20004 MachineInstrBuilder MIB = BuildMI(*BB, MI, DL,
20005 TII->get(X86::MOV32rm), X86::EAX)
20007 .addImm(0).addReg(0)
20008 .addGlobalAddress(MI->getOperand(3).getGlobal(), 0,
20009 MI->getOperand(3).getTargetFlags())
20011 MIB = BuildMI(*BB, MI, DL, TII->get(X86::CALL32m));
20012 addDirectMem(MIB, X86::EAX);
20013 MIB.addReg(X86::EAX, RegState::ImplicitDefine).addRegMask(RegMask);
20015 MachineInstrBuilder MIB = BuildMI(*BB, MI, DL,
20016 TII->get(X86::MOV32rm), X86::EAX)
20017 .addReg(TII->getGlobalBaseReg(F))
20018 .addImm(0).addReg(0)
20019 .addGlobalAddress(MI->getOperand(3).getGlobal(), 0,
20020 MI->getOperand(3).getTargetFlags())
20022 MIB = BuildMI(*BB, MI, DL, TII->get(X86::CALL32m));
20023 addDirectMem(MIB, X86::EAX);
20024 MIB.addReg(X86::EAX, RegState::ImplicitDefine).addRegMask(RegMask);
20027 MI->eraseFromParent(); // The pseudo instruction is gone now.
20031 MachineBasicBlock *
20032 X86TargetLowering::emitEHSjLjSetJmp(MachineInstr *MI,
20033 MachineBasicBlock *MBB) const {
20034 DebugLoc DL = MI->getDebugLoc();
20035 MachineFunction *MF = MBB->getParent();
20036 const TargetInstrInfo *TII = MF->getSubtarget().getInstrInfo();
20037 MachineRegisterInfo &MRI = MF->getRegInfo();
20039 const BasicBlock *BB = MBB->getBasicBlock();
20040 MachineFunction::iterator I = MBB;
20043 // Memory Reference
20044 MachineInstr::mmo_iterator MMOBegin = MI->memoperands_begin();
20045 MachineInstr::mmo_iterator MMOEnd = MI->memoperands_end();
20048 unsigned MemOpndSlot = 0;
20050 unsigned CurOp = 0;
20052 DstReg = MI->getOperand(CurOp++).getReg();
20053 const TargetRegisterClass *RC = MRI.getRegClass(DstReg);
20054 assert(RC->hasType(MVT::i32) && "Invalid destination!");
20055 unsigned mainDstReg = MRI.createVirtualRegister(RC);
20056 unsigned restoreDstReg = MRI.createVirtualRegister(RC);
20058 MemOpndSlot = CurOp;
20060 MVT PVT = getPointerTy();
20061 assert((PVT == MVT::i64 || PVT == MVT::i32) &&
20062 "Invalid Pointer Size!");
20064 // For v = setjmp(buf), we generate
20067 // buf[LabelOffset] = restoreMBB
20068 // SjLjSetup restoreMBB
20074 // v = phi(main, restore)
20079 MachineBasicBlock *thisMBB = MBB;
20080 MachineBasicBlock *mainMBB = MF->CreateMachineBasicBlock(BB);
20081 MachineBasicBlock *sinkMBB = MF->CreateMachineBasicBlock(BB);
20082 MachineBasicBlock *restoreMBB = MF->CreateMachineBasicBlock(BB);
20083 MF->insert(I, mainMBB);
20084 MF->insert(I, sinkMBB);
20085 MF->push_back(restoreMBB);
20087 MachineInstrBuilder MIB;
20089 // Transfer the remainder of BB and its successor edges to sinkMBB.
20090 sinkMBB->splice(sinkMBB->begin(), MBB,
20091 std::next(MachineBasicBlock::iterator(MI)), MBB->end());
20092 sinkMBB->transferSuccessorsAndUpdatePHIs(MBB);
20095 unsigned PtrStoreOpc = 0;
20096 unsigned LabelReg = 0;
20097 const int64_t LabelOffset = 1 * PVT.getStoreSize();
20098 Reloc::Model RM = MF->getTarget().getRelocationModel();
20099 bool UseImmLabel = (MF->getTarget().getCodeModel() == CodeModel::Small) &&
20100 (RM == Reloc::Static || RM == Reloc::DynamicNoPIC);
20102 // Prepare IP either in reg or imm.
20103 if (!UseImmLabel) {
20104 PtrStoreOpc = (PVT == MVT::i64) ? X86::MOV64mr : X86::MOV32mr;
20105 const TargetRegisterClass *PtrRC = getRegClassFor(PVT);
20106 LabelReg = MRI.createVirtualRegister(PtrRC);
20107 if (Subtarget->is64Bit()) {
20108 MIB = BuildMI(*thisMBB, MI, DL, TII->get(X86::LEA64r), LabelReg)
20112 .addMBB(restoreMBB)
20115 const X86InstrInfo *XII = static_cast<const X86InstrInfo*>(TII);
20116 MIB = BuildMI(*thisMBB, MI, DL, TII->get(X86::LEA32r), LabelReg)
20117 .addReg(XII->getGlobalBaseReg(MF))
20120 .addMBB(restoreMBB, Subtarget->ClassifyBlockAddressReference())
20124 PtrStoreOpc = (PVT == MVT::i64) ? X86::MOV64mi32 : X86::MOV32mi;
20126 MIB = BuildMI(*thisMBB, MI, DL, TII->get(PtrStoreOpc));
20127 for (unsigned i = 0; i < X86::AddrNumOperands; ++i) {
20128 if (i == X86::AddrDisp)
20129 MIB.addDisp(MI->getOperand(MemOpndSlot + i), LabelOffset);
20131 MIB.addOperand(MI->getOperand(MemOpndSlot + i));
20134 MIB.addReg(LabelReg);
20136 MIB.addMBB(restoreMBB);
20137 MIB.setMemRefs(MMOBegin, MMOEnd);
20139 MIB = BuildMI(*thisMBB, MI, DL, TII->get(X86::EH_SjLj_Setup))
20140 .addMBB(restoreMBB);
20142 const X86RegisterInfo *RegInfo = static_cast<const X86RegisterInfo *>(
20143 MF->getSubtarget().getRegisterInfo());
20144 MIB.addRegMask(RegInfo->getNoPreservedMask());
20145 thisMBB->addSuccessor(mainMBB);
20146 thisMBB->addSuccessor(restoreMBB);
20150 BuildMI(mainMBB, DL, TII->get(X86::MOV32r0), mainDstReg);
20151 mainMBB->addSuccessor(sinkMBB);
20154 BuildMI(*sinkMBB, sinkMBB->begin(), DL,
20155 TII->get(X86::PHI), DstReg)
20156 .addReg(mainDstReg).addMBB(mainMBB)
20157 .addReg(restoreDstReg).addMBB(restoreMBB);
20160 BuildMI(restoreMBB, DL, TII->get(X86::MOV32ri), restoreDstReg).addImm(1);
20161 BuildMI(restoreMBB, DL, TII->get(X86::JMP_4)).addMBB(sinkMBB);
20162 restoreMBB->addSuccessor(sinkMBB);
20164 MI->eraseFromParent();
20168 MachineBasicBlock *
20169 X86TargetLowering::emitEHSjLjLongJmp(MachineInstr *MI,
20170 MachineBasicBlock *MBB) const {
20171 DebugLoc DL = MI->getDebugLoc();
20172 MachineFunction *MF = MBB->getParent();
20173 const TargetInstrInfo *TII = MF->getSubtarget().getInstrInfo();
20174 MachineRegisterInfo &MRI = MF->getRegInfo();
20176 // Memory Reference
20177 MachineInstr::mmo_iterator MMOBegin = MI->memoperands_begin();
20178 MachineInstr::mmo_iterator MMOEnd = MI->memoperands_end();
20180 MVT PVT = getPointerTy();
20181 assert((PVT == MVT::i64 || PVT == MVT::i32) &&
20182 "Invalid Pointer Size!");
20184 const TargetRegisterClass *RC =
20185 (PVT == MVT::i64) ? &X86::GR64RegClass : &X86::GR32RegClass;
20186 unsigned Tmp = MRI.createVirtualRegister(RC);
20187 // Since FP is only updated here but NOT referenced, it's treated as GPR.
20188 const X86RegisterInfo *RegInfo = static_cast<const X86RegisterInfo *>(
20189 MF->getSubtarget().getRegisterInfo());
20190 unsigned FP = (PVT == MVT::i64) ? X86::RBP : X86::EBP;
20191 unsigned SP = RegInfo->getStackRegister();
20193 MachineInstrBuilder MIB;
20195 const int64_t LabelOffset = 1 * PVT.getStoreSize();
20196 const int64_t SPOffset = 2 * PVT.getStoreSize();
20198 unsigned PtrLoadOpc = (PVT == MVT::i64) ? X86::MOV64rm : X86::MOV32rm;
20199 unsigned IJmpOpc = (PVT == MVT::i64) ? X86::JMP64r : X86::JMP32r;
20202 MIB = BuildMI(*MBB, MI, DL, TII->get(PtrLoadOpc), FP);
20203 for (unsigned i = 0; i < X86::AddrNumOperands; ++i)
20204 MIB.addOperand(MI->getOperand(i));
20205 MIB.setMemRefs(MMOBegin, MMOEnd);
20207 MIB = BuildMI(*MBB, MI, DL, TII->get(PtrLoadOpc), Tmp);
20208 for (unsigned i = 0; i < X86::AddrNumOperands; ++i) {
20209 if (i == X86::AddrDisp)
20210 MIB.addDisp(MI->getOperand(i), LabelOffset);
20212 MIB.addOperand(MI->getOperand(i));
20214 MIB.setMemRefs(MMOBegin, MMOEnd);
20216 MIB = BuildMI(*MBB, MI, DL, TII->get(PtrLoadOpc), SP);
20217 for (unsigned i = 0; i < X86::AddrNumOperands; ++i) {
20218 if (i == X86::AddrDisp)
20219 MIB.addDisp(MI->getOperand(i), SPOffset);
20221 MIB.addOperand(MI->getOperand(i));
20223 MIB.setMemRefs(MMOBegin, MMOEnd);
20225 BuildMI(*MBB, MI, DL, TII->get(IJmpOpc)).addReg(Tmp);
20227 MI->eraseFromParent();
20231 // Replace 213-type (isel default) FMA3 instructions with 231-type for
20232 // accumulator loops. Writing back to the accumulator allows the coalescer
20233 // to remove extra copies in the loop.
20234 MachineBasicBlock *
20235 X86TargetLowering::emitFMA3Instr(MachineInstr *MI,
20236 MachineBasicBlock *MBB) const {
20237 MachineOperand &AddendOp = MI->getOperand(3);
20239 // Bail out early if the addend isn't a register - we can't switch these.
20240 if (!AddendOp.isReg())
20243 MachineFunction &MF = *MBB->getParent();
20244 MachineRegisterInfo &MRI = MF.getRegInfo();
20246 // Check whether the addend is defined by a PHI:
20247 assert(MRI.hasOneDef(AddendOp.getReg()) && "Multiple defs in SSA?");
20248 MachineInstr &AddendDef = *MRI.def_instr_begin(AddendOp.getReg());
20249 if (!AddendDef.isPHI())
20252 // Look for the following pattern:
20254 // %addend = phi [%entry, 0], [%loop, %result]
20256 // %result<tied1> = FMA213 %m2<tied0>, %m1, %addend
20260 // %addend = phi [%entry, 0], [%loop, %result]
20262 // %result<tied1> = FMA231 %addend<tied0>, %m1, %m2
20264 for (unsigned i = 1, e = AddendDef.getNumOperands(); i < e; i += 2) {
20265 assert(AddendDef.getOperand(i).isReg());
20266 MachineOperand PHISrcOp = AddendDef.getOperand(i);
20267 MachineInstr &PHISrcInst = *MRI.def_instr_begin(PHISrcOp.getReg());
20268 if (&PHISrcInst == MI) {
20269 // Found a matching instruction.
20270 unsigned NewFMAOpc = 0;
20271 switch (MI->getOpcode()) {
20272 case X86::VFMADDPDr213r: NewFMAOpc = X86::VFMADDPDr231r; break;
20273 case X86::VFMADDPSr213r: NewFMAOpc = X86::VFMADDPSr231r; break;
20274 case X86::VFMADDSDr213r: NewFMAOpc = X86::VFMADDSDr231r; break;
20275 case X86::VFMADDSSr213r: NewFMAOpc = X86::VFMADDSSr231r; break;
20276 case X86::VFMSUBPDr213r: NewFMAOpc = X86::VFMSUBPDr231r; break;
20277 case X86::VFMSUBPSr213r: NewFMAOpc = X86::VFMSUBPSr231r; break;
20278 case X86::VFMSUBSDr213r: NewFMAOpc = X86::VFMSUBSDr231r; break;
20279 case X86::VFMSUBSSr213r: NewFMAOpc = X86::VFMSUBSSr231r; break;
20280 case X86::VFNMADDPDr213r: NewFMAOpc = X86::VFNMADDPDr231r; break;
20281 case X86::VFNMADDPSr213r: NewFMAOpc = X86::VFNMADDPSr231r; break;
20282 case X86::VFNMADDSDr213r: NewFMAOpc = X86::VFNMADDSDr231r; break;
20283 case X86::VFNMADDSSr213r: NewFMAOpc = X86::VFNMADDSSr231r; break;
20284 case X86::VFNMSUBPDr213r: NewFMAOpc = X86::VFNMSUBPDr231r; break;
20285 case X86::VFNMSUBPSr213r: NewFMAOpc = X86::VFNMSUBPSr231r; break;
20286 case X86::VFNMSUBSDr213r: NewFMAOpc = X86::VFNMSUBSDr231r; break;
20287 case X86::VFNMSUBSSr213r: NewFMAOpc = X86::VFNMSUBSSr231r; break;
20288 case X86::VFMADDPDr213rY: NewFMAOpc = X86::VFMADDPDr231rY; break;
20289 case X86::VFMADDPSr213rY: NewFMAOpc = X86::VFMADDPSr231rY; break;
20290 case X86::VFMSUBPDr213rY: NewFMAOpc = X86::VFMSUBPDr231rY; break;
20291 case X86::VFMSUBPSr213rY: NewFMAOpc = X86::VFMSUBPSr231rY; break;
20292 case X86::VFNMADDPDr213rY: NewFMAOpc = X86::VFNMADDPDr231rY; break;
20293 case X86::VFNMADDPSr213rY: NewFMAOpc = X86::VFNMADDPSr231rY; break;
20294 case X86::VFNMSUBPDr213rY: NewFMAOpc = X86::VFNMSUBPDr231rY; break;
20295 case X86::VFNMSUBPSr213rY: NewFMAOpc = X86::VFNMSUBPSr231rY; break;
20296 default: llvm_unreachable("Unrecognized FMA variant.");
20299 const TargetInstrInfo &TII = *MF.getSubtarget().getInstrInfo();
20300 MachineInstrBuilder MIB =
20301 BuildMI(MF, MI->getDebugLoc(), TII.get(NewFMAOpc))
20302 .addOperand(MI->getOperand(0))
20303 .addOperand(MI->getOperand(3))
20304 .addOperand(MI->getOperand(2))
20305 .addOperand(MI->getOperand(1));
20306 MBB->insert(MachineBasicBlock::iterator(MI), MIB);
20307 MI->eraseFromParent();
20314 MachineBasicBlock *
20315 X86TargetLowering::EmitInstrWithCustomInserter(MachineInstr *MI,
20316 MachineBasicBlock *BB) const {
20317 switch (MI->getOpcode()) {
20318 default: llvm_unreachable("Unexpected instr type to insert");
20319 case X86::TAILJMPd64:
20320 case X86::TAILJMPr64:
20321 case X86::TAILJMPm64:
20322 llvm_unreachable("TAILJMP64 would not be touched here.");
20323 case X86::TCRETURNdi64:
20324 case X86::TCRETURNri64:
20325 case X86::TCRETURNmi64:
20327 case X86::WIN_ALLOCA:
20328 return EmitLoweredWinAlloca(MI, BB);
20329 case X86::SEG_ALLOCA_32:
20330 case X86::SEG_ALLOCA_64:
20331 return EmitLoweredSegAlloca(MI, BB);
20332 case X86::TLSCall_32:
20333 case X86::TLSCall_64:
20334 return EmitLoweredTLSCall(MI, BB);
20335 case X86::CMOV_GR8:
20336 case X86::CMOV_FR32:
20337 case X86::CMOV_FR64:
20338 case X86::CMOV_V4F32:
20339 case X86::CMOV_V2F64:
20340 case X86::CMOV_V2I64:
20341 case X86::CMOV_V8F32:
20342 case X86::CMOV_V4F64:
20343 case X86::CMOV_V4I64:
20344 case X86::CMOV_V16F32:
20345 case X86::CMOV_V8F64:
20346 case X86::CMOV_V8I64:
20347 case X86::CMOV_GR16:
20348 case X86::CMOV_GR32:
20349 case X86::CMOV_RFP32:
20350 case X86::CMOV_RFP64:
20351 case X86::CMOV_RFP80:
20352 return EmitLoweredSelect(MI, BB);
20354 case X86::FP32_TO_INT16_IN_MEM:
20355 case X86::FP32_TO_INT32_IN_MEM:
20356 case X86::FP32_TO_INT64_IN_MEM:
20357 case X86::FP64_TO_INT16_IN_MEM:
20358 case X86::FP64_TO_INT32_IN_MEM:
20359 case X86::FP64_TO_INT64_IN_MEM:
20360 case X86::FP80_TO_INT16_IN_MEM:
20361 case X86::FP80_TO_INT32_IN_MEM:
20362 case X86::FP80_TO_INT64_IN_MEM: {
20363 MachineFunction *F = BB->getParent();
20364 const TargetInstrInfo *TII = F->getSubtarget().getInstrInfo();
20365 DebugLoc DL = MI->getDebugLoc();
20367 // Change the floating point control register to use "round towards zero"
20368 // mode when truncating to an integer value.
20369 int CWFrameIdx = F->getFrameInfo()->CreateStackObject(2, 2, false);
20370 addFrameReference(BuildMI(*BB, MI, DL,
20371 TII->get(X86::FNSTCW16m)), CWFrameIdx);
20373 // Load the old value of the high byte of the control word...
20375 F->getRegInfo().createVirtualRegister(&X86::GR16RegClass);
20376 addFrameReference(BuildMI(*BB, MI, DL, TII->get(X86::MOV16rm), OldCW),
20379 // Set the high part to be round to zero...
20380 addFrameReference(BuildMI(*BB, MI, DL, TII->get(X86::MOV16mi)), CWFrameIdx)
20383 // Reload the modified control word now...
20384 addFrameReference(BuildMI(*BB, MI, DL,
20385 TII->get(X86::FLDCW16m)), CWFrameIdx);
20387 // Restore the memory image of control word to original value
20388 addFrameReference(BuildMI(*BB, MI, DL, TII->get(X86::MOV16mr)), CWFrameIdx)
20391 // Get the X86 opcode to use.
20393 switch (MI->getOpcode()) {
20394 default: llvm_unreachable("illegal opcode!");
20395 case X86::FP32_TO_INT16_IN_MEM: Opc = X86::IST_Fp16m32; break;
20396 case X86::FP32_TO_INT32_IN_MEM: Opc = X86::IST_Fp32m32; break;
20397 case X86::FP32_TO_INT64_IN_MEM: Opc = X86::IST_Fp64m32; break;
20398 case X86::FP64_TO_INT16_IN_MEM: Opc = X86::IST_Fp16m64; break;
20399 case X86::FP64_TO_INT32_IN_MEM: Opc = X86::IST_Fp32m64; break;
20400 case X86::FP64_TO_INT64_IN_MEM: Opc = X86::IST_Fp64m64; break;
20401 case X86::FP80_TO_INT16_IN_MEM: Opc = X86::IST_Fp16m80; break;
20402 case X86::FP80_TO_INT32_IN_MEM: Opc = X86::IST_Fp32m80; break;
20403 case X86::FP80_TO_INT64_IN_MEM: Opc = X86::IST_Fp64m80; break;
20407 MachineOperand &Op = MI->getOperand(0);
20409 AM.BaseType = X86AddressMode::RegBase;
20410 AM.Base.Reg = Op.getReg();
20412 AM.BaseType = X86AddressMode::FrameIndexBase;
20413 AM.Base.FrameIndex = Op.getIndex();
20415 Op = MI->getOperand(1);
20417 AM.Scale = Op.getImm();
20418 Op = MI->getOperand(2);
20420 AM.IndexReg = Op.getImm();
20421 Op = MI->getOperand(3);
20422 if (Op.isGlobal()) {
20423 AM.GV = Op.getGlobal();
20425 AM.Disp = Op.getImm();
20427 addFullAddress(BuildMI(*BB, MI, DL, TII->get(Opc)), AM)
20428 .addReg(MI->getOperand(X86::AddrNumOperands).getReg());
20430 // Reload the original control word now.
20431 addFrameReference(BuildMI(*BB, MI, DL,
20432 TII->get(X86::FLDCW16m)), CWFrameIdx);
20434 MI->eraseFromParent(); // The pseudo instruction is gone now.
20437 // String/text processing lowering.
20438 case X86::PCMPISTRM128REG:
20439 case X86::VPCMPISTRM128REG:
20440 case X86::PCMPISTRM128MEM:
20441 case X86::VPCMPISTRM128MEM:
20442 case X86::PCMPESTRM128REG:
20443 case X86::VPCMPESTRM128REG:
20444 case X86::PCMPESTRM128MEM:
20445 case X86::VPCMPESTRM128MEM:
20446 assert(Subtarget->hasSSE42() &&
20447 "Target must have SSE4.2 or AVX features enabled");
20448 return EmitPCMPSTRM(MI, BB, BB->getParent()->getSubtarget().getInstrInfo());
20450 // String/text processing lowering.
20451 case X86::PCMPISTRIREG:
20452 case X86::VPCMPISTRIREG:
20453 case X86::PCMPISTRIMEM:
20454 case X86::VPCMPISTRIMEM:
20455 case X86::PCMPESTRIREG:
20456 case X86::VPCMPESTRIREG:
20457 case X86::PCMPESTRIMEM:
20458 case X86::VPCMPESTRIMEM:
20459 assert(Subtarget->hasSSE42() &&
20460 "Target must have SSE4.2 or AVX features enabled");
20461 return EmitPCMPSTRI(MI, BB, BB->getParent()->getSubtarget().getInstrInfo());
20463 // Thread synchronization.
20465 return EmitMonitor(MI, BB, BB->getParent()->getSubtarget().getInstrInfo(),
20470 return EmitXBegin(MI, BB, BB->getParent()->getSubtarget().getInstrInfo());
20472 case X86::VASTART_SAVE_XMM_REGS:
20473 return EmitVAStartSaveXMMRegsWithCustomInserter(MI, BB);
20475 case X86::VAARG_64:
20476 return EmitVAARG64WithCustomInserter(MI, BB);
20478 case X86::EH_SjLj_SetJmp32:
20479 case X86::EH_SjLj_SetJmp64:
20480 return emitEHSjLjSetJmp(MI, BB);
20482 case X86::EH_SjLj_LongJmp32:
20483 case X86::EH_SjLj_LongJmp64:
20484 return emitEHSjLjLongJmp(MI, BB);
20486 case TargetOpcode::STACKMAP:
20487 case TargetOpcode::PATCHPOINT:
20488 return emitPatchPoint(MI, BB);
20490 case X86::VFMADDPDr213r:
20491 case X86::VFMADDPSr213r:
20492 case X86::VFMADDSDr213r:
20493 case X86::VFMADDSSr213r:
20494 case X86::VFMSUBPDr213r:
20495 case X86::VFMSUBPSr213r:
20496 case X86::VFMSUBSDr213r:
20497 case X86::VFMSUBSSr213r:
20498 case X86::VFNMADDPDr213r:
20499 case X86::VFNMADDPSr213r:
20500 case X86::VFNMADDSDr213r:
20501 case X86::VFNMADDSSr213r:
20502 case X86::VFNMSUBPDr213r:
20503 case X86::VFNMSUBPSr213r:
20504 case X86::VFNMSUBSDr213r:
20505 case X86::VFNMSUBSSr213r:
20506 case X86::VFMADDPDr213rY:
20507 case X86::VFMADDPSr213rY:
20508 case X86::VFMSUBPDr213rY:
20509 case X86::VFMSUBPSr213rY:
20510 case X86::VFNMADDPDr213rY:
20511 case X86::VFNMADDPSr213rY:
20512 case X86::VFNMSUBPDr213rY:
20513 case X86::VFNMSUBPSr213rY:
20514 return emitFMA3Instr(MI, BB);
20518 //===----------------------------------------------------------------------===//
20519 // X86 Optimization Hooks
20520 //===----------------------------------------------------------------------===//
20522 void X86TargetLowering::computeKnownBitsForTargetNode(const SDValue Op,
20525 const SelectionDAG &DAG,
20526 unsigned Depth) const {
20527 unsigned BitWidth = KnownZero.getBitWidth();
20528 unsigned Opc = Op.getOpcode();
20529 assert((Opc >= ISD::BUILTIN_OP_END ||
20530 Opc == ISD::INTRINSIC_WO_CHAIN ||
20531 Opc == ISD::INTRINSIC_W_CHAIN ||
20532 Opc == ISD::INTRINSIC_VOID) &&
20533 "Should use MaskedValueIsZero if you don't know whether Op"
20534 " is a target node!");
20536 KnownZero = KnownOne = APInt(BitWidth, 0); // Don't know anything.
20550 // These nodes' second result is a boolean.
20551 if (Op.getResNo() == 0)
20554 case X86ISD::SETCC:
20555 KnownZero |= APInt::getHighBitsSet(BitWidth, BitWidth - 1);
20557 case ISD::INTRINSIC_WO_CHAIN: {
20558 unsigned IntId = cast<ConstantSDNode>(Op.getOperand(0))->getZExtValue();
20559 unsigned NumLoBits = 0;
20562 case Intrinsic::x86_sse_movmsk_ps:
20563 case Intrinsic::x86_avx_movmsk_ps_256:
20564 case Intrinsic::x86_sse2_movmsk_pd:
20565 case Intrinsic::x86_avx_movmsk_pd_256:
20566 case Intrinsic::x86_mmx_pmovmskb:
20567 case Intrinsic::x86_sse2_pmovmskb_128:
20568 case Intrinsic::x86_avx2_pmovmskb: {
20569 // High bits of movmskp{s|d}, pmovmskb are known zero.
20571 default: llvm_unreachable("Impossible intrinsic"); // Can't reach here.
20572 case Intrinsic::x86_sse_movmsk_ps: NumLoBits = 4; break;
20573 case Intrinsic::x86_avx_movmsk_ps_256: NumLoBits = 8; break;
20574 case Intrinsic::x86_sse2_movmsk_pd: NumLoBits = 2; break;
20575 case Intrinsic::x86_avx_movmsk_pd_256: NumLoBits = 4; break;
20576 case Intrinsic::x86_mmx_pmovmskb: NumLoBits = 8; break;
20577 case Intrinsic::x86_sse2_pmovmskb_128: NumLoBits = 16; break;
20578 case Intrinsic::x86_avx2_pmovmskb: NumLoBits = 32; break;
20580 KnownZero = APInt::getHighBitsSet(BitWidth, BitWidth - NumLoBits);
20589 unsigned X86TargetLowering::ComputeNumSignBitsForTargetNode(
20591 const SelectionDAG &,
20592 unsigned Depth) const {
20593 // SETCC_CARRY sets the dest to ~0 for true or 0 for false.
20594 if (Op.getOpcode() == X86ISD::SETCC_CARRY)
20595 return Op.getValueType().getScalarType().getSizeInBits();
20601 /// isGAPlusOffset - Returns true (and the GlobalValue and the offset) if the
20602 /// node is a GlobalAddress + offset.
20603 bool X86TargetLowering::isGAPlusOffset(SDNode *N,
20604 const GlobalValue* &GA,
20605 int64_t &Offset) const {
20606 if (N->getOpcode() == X86ISD::Wrapper) {
20607 if (isa<GlobalAddressSDNode>(N->getOperand(0))) {
20608 GA = cast<GlobalAddressSDNode>(N->getOperand(0))->getGlobal();
20609 Offset = cast<GlobalAddressSDNode>(N->getOperand(0))->getOffset();
20613 return TargetLowering::isGAPlusOffset(N, GA, Offset);
20616 /// isShuffleHigh128VectorInsertLow - Checks whether the shuffle node is the
20617 /// same as extracting the high 128-bit part of 256-bit vector and then
20618 /// inserting the result into the low part of a new 256-bit vector
20619 static bool isShuffleHigh128VectorInsertLow(ShuffleVectorSDNode *SVOp) {
20620 EVT VT = SVOp->getValueType(0);
20621 unsigned NumElems = VT.getVectorNumElements();
20623 // vector_shuffle <4, 5, 6, 7, u, u, u, u> or <2, 3, u, u>
20624 for (unsigned i = 0, j = NumElems/2; i != NumElems/2; ++i, ++j)
20625 if (!isUndefOrEqual(SVOp->getMaskElt(i), j) ||
20626 SVOp->getMaskElt(j) >= 0)
20632 /// isShuffleLow128VectorInsertHigh - Checks whether the shuffle node is the
20633 /// same as extracting the low 128-bit part of 256-bit vector and then
20634 /// inserting the result into the high part of a new 256-bit vector
20635 static bool isShuffleLow128VectorInsertHigh(ShuffleVectorSDNode *SVOp) {
20636 EVT VT = SVOp->getValueType(0);
20637 unsigned NumElems = VT.getVectorNumElements();
20639 // vector_shuffle <u, u, u, u, 0, 1, 2, 3> or <u, u, 0, 1>
20640 for (unsigned i = NumElems/2, j = 0; i != NumElems; ++i, ++j)
20641 if (!isUndefOrEqual(SVOp->getMaskElt(i), j) ||
20642 SVOp->getMaskElt(j) >= 0)
20648 /// PerformShuffleCombine256 - Performs shuffle combines for 256-bit vectors.
20649 static SDValue PerformShuffleCombine256(SDNode *N, SelectionDAG &DAG,
20650 TargetLowering::DAGCombinerInfo &DCI,
20651 const X86Subtarget* Subtarget) {
20653 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(N);
20654 SDValue V1 = SVOp->getOperand(0);
20655 SDValue V2 = SVOp->getOperand(1);
20656 EVT VT = SVOp->getValueType(0);
20657 unsigned NumElems = VT.getVectorNumElements();
20659 if (V1.getOpcode() == ISD::CONCAT_VECTORS &&
20660 V2.getOpcode() == ISD::CONCAT_VECTORS) {
20664 // V UNDEF BUILD_VECTOR UNDEF
20666 // CONCAT_VECTOR CONCAT_VECTOR
20669 // RESULT: V + zero extended
20671 if (V2.getOperand(0).getOpcode() != ISD::BUILD_VECTOR ||
20672 V2.getOperand(1).getOpcode() != ISD::UNDEF ||
20673 V1.getOperand(1).getOpcode() != ISD::UNDEF)
20676 if (!ISD::isBuildVectorAllZeros(V2.getOperand(0).getNode()))
20679 // To match the shuffle mask, the first half of the mask should
20680 // be exactly the first vector, and all the rest a splat with the
20681 // first element of the second one.
20682 for (unsigned i = 0; i != NumElems/2; ++i)
20683 if (!isUndefOrEqual(SVOp->getMaskElt(i), i) ||
20684 !isUndefOrEqual(SVOp->getMaskElt(i+NumElems/2), NumElems))
20687 // If V1 is coming from a vector load then just fold to a VZEXT_LOAD.
20688 if (LoadSDNode *Ld = dyn_cast<LoadSDNode>(V1.getOperand(0))) {
20689 if (Ld->hasNUsesOfValue(1, 0)) {
20690 SDVTList Tys = DAG.getVTList(MVT::v4i64, MVT::Other);
20691 SDValue Ops[] = { Ld->getChain(), Ld->getBasePtr() };
20693 DAG.getMemIntrinsicNode(X86ISD::VZEXT_LOAD, dl, Tys, Ops,
20695 Ld->getPointerInfo(),
20696 Ld->getAlignment(),
20697 false/*isVolatile*/, true/*ReadMem*/,
20698 false/*WriteMem*/);
20700 // Make sure the newly-created LOAD is in the same position as Ld in
20701 // terms of dependency. We create a TokenFactor for Ld and ResNode,
20702 // and update uses of Ld's output chain to use the TokenFactor.
20703 if (Ld->hasAnyUseOfValue(1)) {
20704 SDValue NewChain = DAG.getNode(ISD::TokenFactor, dl, MVT::Other,
20705 SDValue(Ld, 1), SDValue(ResNode.getNode(), 1));
20706 DAG.ReplaceAllUsesOfValueWith(SDValue(Ld, 1), NewChain);
20707 DAG.UpdateNodeOperands(NewChain.getNode(), SDValue(Ld, 1),
20708 SDValue(ResNode.getNode(), 1));
20711 return DAG.getNode(ISD::BITCAST, dl, VT, ResNode);
20715 // Emit a zeroed vector and insert the desired subvector on its
20717 SDValue Zeros = getZeroVector(VT, Subtarget, DAG, dl);
20718 SDValue InsV = Insert128BitVector(Zeros, V1.getOperand(0), 0, DAG, dl);
20719 return DCI.CombineTo(N, InsV);
20722 //===--------------------------------------------------------------------===//
20723 // Combine some shuffles into subvector extracts and inserts:
20726 // vector_shuffle <4, 5, 6, 7, u, u, u, u> or <2, 3, u, u>
20727 if (isShuffleHigh128VectorInsertLow(SVOp)) {
20728 SDValue V = Extract128BitVector(V1, NumElems/2, DAG, dl);
20729 SDValue InsV = Insert128BitVector(DAG.getUNDEF(VT), V, 0, DAG, dl);
20730 return DCI.CombineTo(N, InsV);
20733 // vector_shuffle <u, u, u, u, 0, 1, 2, 3> or <u, u, 0, 1>
20734 if (isShuffleLow128VectorInsertHigh(SVOp)) {
20735 SDValue V = Extract128BitVector(V1, 0, DAG, dl);
20736 SDValue InsV = Insert128BitVector(DAG.getUNDEF(VT), V, NumElems/2, DAG, dl);
20737 return DCI.CombineTo(N, InsV);
20743 /// \brief Combine an arbitrary chain of shuffles into a single instruction if
20746 /// This is the leaf of the recursive combinine below. When we have found some
20747 /// chain of single-use x86 shuffle instructions and accumulated the combined
20748 /// shuffle mask represented by them, this will try to pattern match that mask
20749 /// into either a single instruction if there is a special purpose instruction
20750 /// for this operation, or into a PSHUFB instruction which is a fully general
20751 /// instruction but should only be used to replace chains over a certain depth.
20752 static bool combineX86ShuffleChain(SDValue Op, SDValue Root, ArrayRef<int> Mask,
20753 int Depth, bool HasPSHUFB, SelectionDAG &DAG,
20754 TargetLowering::DAGCombinerInfo &DCI,
20755 const X86Subtarget *Subtarget) {
20756 assert(!Mask.empty() && "Cannot combine an empty shuffle mask!");
20758 // Find the operand that enters the chain. Note that multiple uses are OK
20759 // here, we're not going to remove the operand we find.
20760 SDValue Input = Op.getOperand(0);
20761 while (Input.getOpcode() == ISD::BITCAST)
20762 Input = Input.getOperand(0);
20764 MVT VT = Input.getSimpleValueType();
20765 MVT RootVT = Root.getSimpleValueType();
20768 // Just remove no-op shuffle masks.
20769 if (Mask.size() == 1) {
20770 DCI.CombineTo(Root.getNode(), DAG.getNode(ISD::BITCAST, DL, RootVT, Input),
20775 // Use the float domain if the operand type is a floating point type.
20776 bool FloatDomain = VT.isFloatingPoint();
20778 // For floating point shuffles, we don't have free copies in the shuffle
20779 // instructions or the ability to load as part of the instruction, so
20780 // canonicalize their shuffles to UNPCK or MOV variants.
20782 // Note that even with AVX we prefer the PSHUFD form of shuffle for integer
20783 // vectors because it can have a load folded into it that UNPCK cannot. This
20784 // doesn't preclude something switching to the shorter encoding post-RA.
20786 if (Mask.equals(0, 0) || Mask.equals(1, 1)) {
20787 bool Lo = Mask.equals(0, 0);
20790 // Check if we have SSE3 which will let us use MOVDDUP. That instruction
20791 // is no slower than UNPCKLPD but has the option to fold the input operand
20792 // into even an unaligned memory load.
20793 if (Lo && Subtarget->hasSSE3()) {
20794 Shuffle = X86ISD::MOVDDUP;
20795 ShuffleVT = MVT::v2f64;
20797 // We have MOVLHPS and MOVHLPS throughout SSE and they encode smaller
20798 // than the UNPCK variants.
20799 Shuffle = Lo ? X86ISD::MOVLHPS : X86ISD::MOVHLPS;
20800 ShuffleVT = MVT::v4f32;
20802 if (Depth == 1 && Root->getOpcode() == Shuffle)
20803 return false; // Nothing to do!
20804 Op = DAG.getNode(ISD::BITCAST, DL, ShuffleVT, Input);
20805 DCI.AddToWorklist(Op.getNode());
20806 if (Shuffle == X86ISD::MOVDDUP)
20807 Op = DAG.getNode(Shuffle, DL, ShuffleVT, Op);
20809 Op = DAG.getNode(Shuffle, DL, ShuffleVT, Op, Op);
20810 DCI.AddToWorklist(Op.getNode());
20811 DCI.CombineTo(Root.getNode(), DAG.getNode(ISD::BITCAST, DL, RootVT, Op),
20815 if (Subtarget->hasSSE3() &&
20816 (Mask.equals(0, 0, 2, 2) || Mask.equals(1, 1, 3, 3))) {
20817 bool Lo = Mask.equals(0, 0, 2, 2);
20818 unsigned Shuffle = Lo ? X86ISD::MOVSLDUP : X86ISD::MOVSHDUP;
20819 MVT ShuffleVT = MVT::v4f32;
20820 if (Depth == 1 && Root->getOpcode() == Shuffle)
20821 return false; // Nothing to do!
20822 Op = DAG.getNode(ISD::BITCAST, DL, ShuffleVT, Input);
20823 DCI.AddToWorklist(Op.getNode());
20824 Op = DAG.getNode(Shuffle, DL, ShuffleVT, Op);
20825 DCI.AddToWorklist(Op.getNode());
20826 DCI.CombineTo(Root.getNode(), DAG.getNode(ISD::BITCAST, DL, RootVT, Op),
20830 if (Mask.equals(0, 0, 1, 1) || Mask.equals(2, 2, 3, 3)) {
20831 bool Lo = Mask.equals(0, 0, 1, 1);
20832 unsigned Shuffle = Lo ? X86ISD::UNPCKL : X86ISD::UNPCKH;
20833 MVT ShuffleVT = MVT::v4f32;
20834 if (Depth == 1 && Root->getOpcode() == Shuffle)
20835 return false; // Nothing to do!
20836 Op = DAG.getNode(ISD::BITCAST, DL, ShuffleVT, Input);
20837 DCI.AddToWorklist(Op.getNode());
20838 Op = DAG.getNode(Shuffle, DL, ShuffleVT, Op, Op);
20839 DCI.AddToWorklist(Op.getNode());
20840 DCI.CombineTo(Root.getNode(), DAG.getNode(ISD::BITCAST, DL, RootVT, Op),
20846 // We always canonicalize the 8 x i16 and 16 x i8 shuffles into their UNPCK
20847 // variants as none of these have single-instruction variants that are
20848 // superior to the UNPCK formulation.
20849 if (!FloatDomain &&
20850 (Mask.equals(0, 0, 1, 1, 2, 2, 3, 3) ||
20851 Mask.equals(4, 4, 5, 5, 6, 6, 7, 7) ||
20852 Mask.equals(0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7) ||
20853 Mask.equals(8, 8, 9, 9, 10, 10, 11, 11, 12, 12, 13, 13, 14, 14, 15,
20855 bool Lo = Mask[0] == 0;
20856 unsigned Shuffle = Lo ? X86ISD::UNPCKL : X86ISD::UNPCKH;
20857 if (Depth == 1 && Root->getOpcode() == Shuffle)
20858 return false; // Nothing to do!
20860 switch (Mask.size()) {
20862 ShuffleVT = MVT::v8i16;
20865 ShuffleVT = MVT::v16i8;
20868 llvm_unreachable("Impossible mask size!");
20870 Op = DAG.getNode(ISD::BITCAST, DL, ShuffleVT, Input);
20871 DCI.AddToWorklist(Op.getNode());
20872 Op = DAG.getNode(Shuffle, DL, ShuffleVT, Op, Op);
20873 DCI.AddToWorklist(Op.getNode());
20874 DCI.CombineTo(Root.getNode(), DAG.getNode(ISD::BITCAST, DL, RootVT, Op),
20879 // Don't try to re-form single instruction chains under any circumstances now
20880 // that we've done encoding canonicalization for them.
20884 // If we have 3 or more shuffle instructions or a chain involving PSHUFB, we
20885 // can replace them with a single PSHUFB instruction profitably. Intel's
20886 // manuals suggest only using PSHUFB if doing so replacing 5 instructions, but
20887 // in practice PSHUFB tends to be *very* fast so we're more aggressive.
20888 if ((Depth >= 3 || HasPSHUFB) && Subtarget->hasSSSE3()) {
20889 SmallVector<SDValue, 16> PSHUFBMask;
20890 assert(Mask.size() <= 16 && "Can't shuffle elements smaller than bytes!");
20891 int Ratio = 16 / Mask.size();
20892 for (unsigned i = 0; i < 16; ++i) {
20893 if (Mask[i / Ratio] == SM_SentinelUndef) {
20894 PSHUFBMask.push_back(DAG.getUNDEF(MVT::i8));
20897 int M = Mask[i / Ratio] != SM_SentinelZero
20898 ? Ratio * Mask[i / Ratio] + i % Ratio
20900 PSHUFBMask.push_back(DAG.getConstant(M, MVT::i8));
20902 Op = DAG.getNode(ISD::BITCAST, DL, MVT::v16i8, Input);
20903 DCI.AddToWorklist(Op.getNode());
20904 SDValue PSHUFBMaskOp =
20905 DAG.getNode(ISD::BUILD_VECTOR, DL, MVT::v16i8, PSHUFBMask);
20906 DCI.AddToWorklist(PSHUFBMaskOp.getNode());
20907 Op = DAG.getNode(X86ISD::PSHUFB, DL, MVT::v16i8, Op, PSHUFBMaskOp);
20908 DCI.AddToWorklist(Op.getNode());
20909 DCI.CombineTo(Root.getNode(), DAG.getNode(ISD::BITCAST, DL, RootVT, Op),
20914 // Failed to find any combines.
20918 /// \brief Fully generic combining of x86 shuffle instructions.
20920 /// This should be the last combine run over the x86 shuffle instructions. Once
20921 /// they have been fully optimized, this will recursively consider all chains
20922 /// of single-use shuffle instructions, build a generic model of the cumulative
20923 /// shuffle operation, and check for simpler instructions which implement this
20924 /// operation. We use this primarily for two purposes:
20926 /// 1) Collapse generic shuffles to specialized single instructions when
20927 /// equivalent. In most cases, this is just an encoding size win, but
20928 /// sometimes we will collapse multiple generic shuffles into a single
20929 /// special-purpose shuffle.
20930 /// 2) Look for sequences of shuffle instructions with 3 or more total
20931 /// instructions, and replace them with the slightly more expensive SSSE3
20932 /// PSHUFB instruction if available. We do this as the last combining step
20933 /// to ensure we avoid using PSHUFB if we can implement the shuffle with
20934 /// a suitable short sequence of other instructions. The PHUFB will either
20935 /// use a register or have to read from memory and so is slightly (but only
20936 /// slightly) more expensive than the other shuffle instructions.
20938 /// Because this is inherently a quadratic operation (for each shuffle in
20939 /// a chain, we recurse up the chain), the depth is limited to 8 instructions.
20940 /// This should never be an issue in practice as the shuffle lowering doesn't
20941 /// produce sequences of more than 8 instructions.
20943 /// FIXME: We will currently miss some cases where the redundant shuffling
20944 /// would simplify under the threshold for PSHUFB formation because of
20945 /// combine-ordering. To fix this, we should do the redundant instruction
20946 /// combining in this recursive walk.
20947 static bool combineX86ShufflesRecursively(SDValue Op, SDValue Root,
20948 ArrayRef<int> RootMask,
20949 int Depth, bool HasPSHUFB,
20951 TargetLowering::DAGCombinerInfo &DCI,
20952 const X86Subtarget *Subtarget) {
20953 // Bound the depth of our recursive combine because this is ultimately
20954 // quadratic in nature.
20958 // Directly rip through bitcasts to find the underlying operand.
20959 while (Op.getOpcode() == ISD::BITCAST && Op.getOperand(0).hasOneUse())
20960 Op = Op.getOperand(0);
20962 MVT VT = Op.getSimpleValueType();
20963 if (!VT.isVector())
20964 return false; // Bail if we hit a non-vector.
20965 // FIXME: This routine should be taught about 256-bit shuffles, or a 256-bit
20966 // version should be added.
20967 if (VT.getSizeInBits() != 128)
20970 assert(Root.getSimpleValueType().isVector() &&
20971 "Shuffles operate on vector types!");
20972 assert(VT.getSizeInBits() == Root.getSimpleValueType().getSizeInBits() &&
20973 "Can only combine shuffles of the same vector register size.");
20975 if (!isTargetShuffle(Op.getOpcode()))
20977 SmallVector<int, 16> OpMask;
20979 bool HaveMask = getTargetShuffleMask(Op.getNode(), VT, OpMask, IsUnary);
20980 // We only can combine unary shuffles which we can decode the mask for.
20981 if (!HaveMask || !IsUnary)
20984 assert(VT.getVectorNumElements() == OpMask.size() &&
20985 "Different mask size from vector size!");
20986 assert(((RootMask.size() > OpMask.size() &&
20987 RootMask.size() % OpMask.size() == 0) ||
20988 (OpMask.size() > RootMask.size() &&
20989 OpMask.size() % RootMask.size() == 0) ||
20990 OpMask.size() == RootMask.size()) &&
20991 "The smaller number of elements must divide the larger.");
20992 int RootRatio = std::max<int>(1, OpMask.size() / RootMask.size());
20993 int OpRatio = std::max<int>(1, RootMask.size() / OpMask.size());
20994 assert(((RootRatio == 1 && OpRatio == 1) ||
20995 (RootRatio == 1) != (OpRatio == 1)) &&
20996 "Must not have a ratio for both incoming and op masks!");
20998 SmallVector<int, 16> Mask;
20999 Mask.reserve(std::max(OpMask.size(), RootMask.size()));
21001 // Merge this shuffle operation's mask into our accumulated mask. Note that
21002 // this shuffle's mask will be the first applied to the input, followed by the
21003 // root mask to get us all the way to the root value arrangement. The reason
21004 // for this order is that we are recursing up the operation chain.
21005 for (int i = 0, e = std::max(OpMask.size(), RootMask.size()); i < e; ++i) {
21006 int RootIdx = i / RootRatio;
21007 if (RootMask[RootIdx] < 0) {
21008 // This is a zero or undef lane, we're done.
21009 Mask.push_back(RootMask[RootIdx]);
21013 int RootMaskedIdx = RootMask[RootIdx] * RootRatio + i % RootRatio;
21014 int OpIdx = RootMaskedIdx / OpRatio;
21015 if (OpMask[OpIdx] < 0) {
21016 // The incoming lanes are zero or undef, it doesn't matter which ones we
21018 Mask.push_back(OpMask[OpIdx]);
21022 // Ok, we have non-zero lanes, map them through.
21023 Mask.push_back(OpMask[OpIdx] * OpRatio +
21024 RootMaskedIdx % OpRatio);
21027 // See if we can recurse into the operand to combine more things.
21028 switch (Op.getOpcode()) {
21029 case X86ISD::PSHUFB:
21031 case X86ISD::PSHUFD:
21032 case X86ISD::PSHUFHW:
21033 case X86ISD::PSHUFLW:
21034 if (Op.getOperand(0).hasOneUse() &&
21035 combineX86ShufflesRecursively(Op.getOperand(0), Root, Mask, Depth + 1,
21036 HasPSHUFB, DAG, DCI, Subtarget))
21040 case X86ISD::UNPCKL:
21041 case X86ISD::UNPCKH:
21042 assert(Op.getOperand(0) == Op.getOperand(1) && "We only combine unary shuffles!");
21043 // We can't check for single use, we have to check that this shuffle is the only user.
21044 if (Op->isOnlyUserOf(Op.getOperand(0).getNode()) &&
21045 combineX86ShufflesRecursively(Op.getOperand(0), Root, Mask, Depth + 1,
21046 HasPSHUFB, DAG, DCI, Subtarget))
21051 // Minor canonicalization of the accumulated shuffle mask to make it easier
21052 // to match below. All this does is detect masks with squential pairs of
21053 // elements, and shrink them to the half-width mask. It does this in a loop
21054 // so it will reduce the size of the mask to the minimal width mask which
21055 // performs an equivalent shuffle.
21056 SmallVector<int, 16> WidenedMask;
21057 while (Mask.size() > 1 && canWidenShuffleElements(Mask, WidenedMask)) {
21058 Mask = std::move(WidenedMask);
21059 WidenedMask.clear();
21062 return combineX86ShuffleChain(Op, Root, Mask, Depth, HasPSHUFB, DAG, DCI,
21066 /// \brief Get the PSHUF-style mask from PSHUF node.
21068 /// This is a very minor wrapper around getTargetShuffleMask to easy forming v4
21069 /// PSHUF-style masks that can be reused with such instructions.
21070 static SmallVector<int, 4> getPSHUFShuffleMask(SDValue N) {
21071 SmallVector<int, 4> Mask;
21073 bool HaveMask = getTargetShuffleMask(N.getNode(), N.getSimpleValueType(), Mask, IsUnary);
21077 switch (N.getOpcode()) {
21078 case X86ISD::PSHUFD:
21080 case X86ISD::PSHUFLW:
21083 case X86ISD::PSHUFHW:
21084 Mask.erase(Mask.begin(), Mask.begin() + 4);
21085 for (int &M : Mask)
21089 llvm_unreachable("No valid shuffle instruction found!");
21093 /// \brief Search for a combinable shuffle across a chain ending in pshufd.
21095 /// We walk up the chain and look for a combinable shuffle, skipping over
21096 /// shuffles that we could hoist this shuffle's transformation past without
21097 /// altering anything.
21099 combineRedundantDWordShuffle(SDValue N, MutableArrayRef<int> Mask,
21101 TargetLowering::DAGCombinerInfo &DCI) {
21102 assert(N.getOpcode() == X86ISD::PSHUFD &&
21103 "Called with something other than an x86 128-bit half shuffle!");
21106 // Walk up a single-use chain looking for a combinable shuffle. Keep a stack
21107 // of the shuffles in the chain so that we can form a fresh chain to replace
21109 SmallVector<SDValue, 8> Chain;
21110 SDValue V = N.getOperand(0);
21111 for (; V.hasOneUse(); V = V.getOperand(0)) {
21112 switch (V.getOpcode()) {
21114 return SDValue(); // Nothing combined!
21117 // Skip bitcasts as we always know the type for the target specific
21121 case X86ISD::PSHUFD:
21122 // Found another dword shuffle.
21125 case X86ISD::PSHUFLW:
21126 // Check that the low words (being shuffled) are the identity in the
21127 // dword shuffle, and the high words are self-contained.
21128 if (Mask[0] != 0 || Mask[1] != 1 ||
21129 !(Mask[2] >= 2 && Mask[2] < 4 && Mask[3] >= 2 && Mask[3] < 4))
21132 Chain.push_back(V);
21135 case X86ISD::PSHUFHW:
21136 // Check that the high words (being shuffled) are the identity in the
21137 // dword shuffle, and the low words are self-contained.
21138 if (Mask[2] != 2 || Mask[3] != 3 ||
21139 !(Mask[0] >= 0 && Mask[0] < 2 && Mask[1] >= 0 && Mask[1] < 2))
21142 Chain.push_back(V);
21145 case X86ISD::UNPCKL:
21146 case X86ISD::UNPCKH:
21147 // For either i8 -> i16 or i16 -> i32 unpacks, we can combine a dword
21148 // shuffle into a preceding word shuffle.
21149 if (V.getValueType() != MVT::v16i8 && V.getValueType() != MVT::v8i16)
21152 // Search for a half-shuffle which we can combine with.
21153 unsigned CombineOp =
21154 V.getOpcode() == X86ISD::UNPCKL ? X86ISD::PSHUFLW : X86ISD::PSHUFHW;
21155 if (V.getOperand(0) != V.getOperand(1) ||
21156 !V->isOnlyUserOf(V.getOperand(0).getNode()))
21158 Chain.push_back(V);
21159 V = V.getOperand(0);
21161 switch (V.getOpcode()) {
21163 return SDValue(); // Nothing to combine.
21165 case X86ISD::PSHUFLW:
21166 case X86ISD::PSHUFHW:
21167 if (V.getOpcode() == CombineOp)
21170 Chain.push_back(V);
21174 V = V.getOperand(0);
21178 } while (V.hasOneUse());
21181 // Break out of the loop if we break out of the switch.
21185 if (!V.hasOneUse())
21186 // We fell out of the loop without finding a viable combining instruction.
21189 // Merge this node's mask and our incoming mask.
21190 SmallVector<int, 4> VMask = getPSHUFShuffleMask(V);
21191 for (int &M : Mask)
21193 V = DAG.getNode(V.getOpcode(), DL, V.getValueType(), V.getOperand(0),
21194 getV4X86ShuffleImm8ForMask(Mask, DAG));
21196 // Rebuild the chain around this new shuffle.
21197 while (!Chain.empty()) {
21198 SDValue W = Chain.pop_back_val();
21200 if (V.getValueType() != W.getOperand(0).getValueType())
21201 V = DAG.getNode(ISD::BITCAST, DL, W.getOperand(0).getValueType(), V);
21203 switch (W.getOpcode()) {
21205 llvm_unreachable("Only PSHUF and UNPCK instructions get here!");
21207 case X86ISD::UNPCKL:
21208 case X86ISD::UNPCKH:
21209 V = DAG.getNode(W.getOpcode(), DL, W.getValueType(), V, V);
21212 case X86ISD::PSHUFD:
21213 case X86ISD::PSHUFLW:
21214 case X86ISD::PSHUFHW:
21215 V = DAG.getNode(W.getOpcode(), DL, W.getValueType(), V, W.getOperand(1));
21219 if (V.getValueType() != N.getValueType())
21220 V = DAG.getNode(ISD::BITCAST, DL, N.getValueType(), V);
21222 // Return the new chain to replace N.
21226 /// \brief Search for a combinable shuffle across a chain ending in pshuflw or pshufhw.
21228 /// We walk up the chain, skipping shuffles of the other half and looking
21229 /// through shuffles which switch halves trying to find a shuffle of the same
21230 /// pair of dwords.
21231 static bool combineRedundantHalfShuffle(SDValue N, MutableArrayRef<int> Mask,
21233 TargetLowering::DAGCombinerInfo &DCI) {
21235 (N.getOpcode() == X86ISD::PSHUFLW || N.getOpcode() == X86ISD::PSHUFHW) &&
21236 "Called with something other than an x86 128-bit half shuffle!");
21238 unsigned CombineOpcode = N.getOpcode();
21240 // Walk up a single-use chain looking for a combinable shuffle.
21241 SDValue V = N.getOperand(0);
21242 for (; V.hasOneUse(); V = V.getOperand(0)) {
21243 switch (V.getOpcode()) {
21245 return false; // Nothing combined!
21248 // Skip bitcasts as we always know the type for the target specific
21252 case X86ISD::PSHUFLW:
21253 case X86ISD::PSHUFHW:
21254 if (V.getOpcode() == CombineOpcode)
21257 // Other-half shuffles are no-ops.
21260 // Break out of the loop if we break out of the switch.
21264 if (!V.hasOneUse())
21265 // We fell out of the loop without finding a viable combining instruction.
21268 // Combine away the bottom node as its shuffle will be accumulated into
21269 // a preceding shuffle.
21270 DCI.CombineTo(N.getNode(), N.getOperand(0), /*AddTo*/ true);
21272 // Record the old value.
21275 // Merge this node's mask and our incoming mask (adjusted to account for all
21276 // the pshufd instructions encountered).
21277 SmallVector<int, 4> VMask = getPSHUFShuffleMask(V);
21278 for (int &M : Mask)
21280 V = DAG.getNode(V.getOpcode(), DL, MVT::v8i16, V.getOperand(0),
21281 getV4X86ShuffleImm8ForMask(Mask, DAG));
21283 // Check that the shuffles didn't cancel each other out. If not, we need to
21284 // combine to the new one.
21286 // Replace the combinable shuffle with the combined one, updating all users
21287 // so that we re-evaluate the chain here.
21288 DCI.CombineTo(Old.getNode(), V, /*AddTo*/ true);
21293 /// \brief Try to combine x86 target specific shuffles.
21294 static SDValue PerformTargetShuffleCombine(SDValue N, SelectionDAG &DAG,
21295 TargetLowering::DAGCombinerInfo &DCI,
21296 const X86Subtarget *Subtarget) {
21298 MVT VT = N.getSimpleValueType();
21299 SmallVector<int, 4> Mask;
21301 switch (N.getOpcode()) {
21302 case X86ISD::PSHUFD:
21303 case X86ISD::PSHUFLW:
21304 case X86ISD::PSHUFHW:
21305 Mask = getPSHUFShuffleMask(N);
21306 assert(Mask.size() == 4);
21312 // Nuke no-op shuffles that show up after combining.
21313 if (isNoopShuffleMask(Mask))
21314 return DCI.CombineTo(N.getNode(), N.getOperand(0), /*AddTo*/ true);
21316 // Look for simplifications involving one or two shuffle instructions.
21317 SDValue V = N.getOperand(0);
21318 switch (N.getOpcode()) {
21321 case X86ISD::PSHUFLW:
21322 case X86ISD::PSHUFHW:
21323 assert(VT == MVT::v8i16);
21326 if (combineRedundantHalfShuffle(N, Mask, DAG, DCI))
21327 return SDValue(); // We combined away this shuffle, so we're done.
21329 // See if this reduces to a PSHUFD which is no more expensive and can
21330 // combine with more operations. Note that it has to at least flip the
21331 // dwords as otherwise it would have been removed as a no-op.
21332 if (Mask[0] == 2 && Mask[1] == 3 && Mask[2] == 0 && Mask[3] == 1) {
21333 int DMask[] = {0, 1, 2, 3};
21334 int DOffset = N.getOpcode() == X86ISD::PSHUFLW ? 0 : 2;
21335 DMask[DOffset + 0] = DOffset + 1;
21336 DMask[DOffset + 1] = DOffset + 0;
21337 V = DAG.getNode(ISD::BITCAST, DL, MVT::v4i32, V);
21338 DCI.AddToWorklist(V.getNode());
21339 V = DAG.getNode(X86ISD::PSHUFD, DL, MVT::v4i32, V,
21340 getV4X86ShuffleImm8ForMask(DMask, DAG));
21341 DCI.AddToWorklist(V.getNode());
21342 return DAG.getNode(ISD::BITCAST, DL, MVT::v8i16, V);
21345 // Look for shuffle patterns which can be implemented as a single unpack.
21346 // FIXME: This doesn't handle the location of the PSHUFD generically, and
21347 // only works when we have a PSHUFD followed by two half-shuffles.
21348 if (Mask[0] == Mask[1] && Mask[2] == Mask[3] &&
21349 (V.getOpcode() == X86ISD::PSHUFLW ||
21350 V.getOpcode() == X86ISD::PSHUFHW) &&
21351 V.getOpcode() != N.getOpcode() &&
21353 SDValue D = V.getOperand(0);
21354 while (D.getOpcode() == ISD::BITCAST && D.hasOneUse())
21355 D = D.getOperand(0);
21356 if (D.getOpcode() == X86ISD::PSHUFD && D.hasOneUse()) {
21357 SmallVector<int, 4> VMask = getPSHUFShuffleMask(V);
21358 SmallVector<int, 4> DMask = getPSHUFShuffleMask(D);
21359 int NOffset = N.getOpcode() == X86ISD::PSHUFLW ? 0 : 4;
21360 int VOffset = V.getOpcode() == X86ISD::PSHUFLW ? 0 : 4;
21362 for (int i = 0; i < 4; ++i) {
21363 WordMask[i + NOffset] = Mask[i] + NOffset;
21364 WordMask[i + VOffset] = VMask[i] + VOffset;
21366 // Map the word mask through the DWord mask.
21368 for (int i = 0; i < 8; ++i)
21369 MappedMask[i] = 2 * DMask[WordMask[i] / 2] + WordMask[i] % 2;
21370 const int UnpackLoMask[] = {0, 0, 1, 1, 2, 2, 3, 3};
21371 const int UnpackHiMask[] = {4, 4, 5, 5, 6, 6, 7, 7};
21372 if (std::equal(std::begin(MappedMask), std::end(MappedMask),
21373 std::begin(UnpackLoMask)) ||
21374 std::equal(std::begin(MappedMask), std::end(MappedMask),
21375 std::begin(UnpackHiMask))) {
21376 // We can replace all three shuffles with an unpack.
21377 V = DAG.getNode(ISD::BITCAST, DL, MVT::v8i16, D.getOperand(0));
21378 DCI.AddToWorklist(V.getNode());
21379 return DAG.getNode(MappedMask[0] == 0 ? X86ISD::UNPCKL
21381 DL, MVT::v8i16, V, V);
21388 case X86ISD::PSHUFD:
21389 if (SDValue NewN = combineRedundantDWordShuffle(N, Mask, DAG, DCI))
21398 /// \brief Try to combine a shuffle into a target-specific add-sub node.
21400 /// We combine this directly on the abstract vector shuffle nodes so it is
21401 /// easier to generically match. We also insert dummy vector shuffle nodes for
21402 /// the operands which explicitly discard the lanes which are unused by this
21403 /// operation to try to flow through the rest of the combiner the fact that
21404 /// they're unused.
21405 static SDValue combineShuffleToAddSub(SDNode *N, SelectionDAG &DAG) {
21407 EVT VT = N->getValueType(0);
21409 // We only handle target-independent shuffles.
21410 // FIXME: It would be easy and harmless to use the target shuffle mask
21411 // extraction tool to support more.
21412 if (N->getOpcode() != ISD::VECTOR_SHUFFLE)
21415 auto *SVN = cast<ShuffleVectorSDNode>(N);
21416 ArrayRef<int> Mask = SVN->getMask();
21417 SDValue V1 = N->getOperand(0);
21418 SDValue V2 = N->getOperand(1);
21420 // We require the first shuffle operand to be the SUB node, and the second to
21421 // be the ADD node.
21422 // FIXME: We should support the commuted patterns.
21423 if (V1->getOpcode() != ISD::FSUB || V2->getOpcode() != ISD::FADD)
21426 // If there are other uses of these operations we can't fold them.
21427 if (!V1->hasOneUse() || !V2->hasOneUse())
21430 // Ensure that both operations have the same operands. Note that we can
21431 // commute the FADD operands.
21432 SDValue LHS = V1->getOperand(0), RHS = V1->getOperand(1);
21433 if ((V2->getOperand(0) != LHS || V2->getOperand(1) != RHS) &&
21434 (V2->getOperand(0) != RHS || V2->getOperand(1) != LHS))
21437 // We're looking for blends between FADD and FSUB nodes. We insist on these
21438 // nodes being lined up in a specific expected pattern.
21439 if (!(isShuffleEquivalent(Mask, 0, 3) ||
21440 isShuffleEquivalent(Mask, 0, 5, 2, 7) ||
21441 isShuffleEquivalent(Mask, 0, 9, 2, 11, 4, 13, 6, 15)))
21444 // Only specific types are legal at this point, assert so we notice if and
21445 // when these change.
21446 assert((VT == MVT::v4f32 || VT == MVT::v2f64 || VT == MVT::v8f32 ||
21447 VT == MVT::v4f64) &&
21448 "Unknown vector type encountered!");
21450 return DAG.getNode(X86ISD::ADDSUB, DL, VT, LHS, RHS);
21453 /// PerformShuffleCombine - Performs several different shuffle combines.
21454 static SDValue PerformShuffleCombine(SDNode *N, SelectionDAG &DAG,
21455 TargetLowering::DAGCombinerInfo &DCI,
21456 const X86Subtarget *Subtarget) {
21458 SDValue N0 = N->getOperand(0);
21459 SDValue N1 = N->getOperand(1);
21460 EVT VT = N->getValueType(0);
21462 // Don't create instructions with illegal types after legalize types has run.
21463 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
21464 if (!DCI.isBeforeLegalize() && !TLI.isTypeLegal(VT.getVectorElementType()))
21467 // If we have legalized the vector types, look for blends of FADD and FSUB
21468 // nodes that we can fuse into an ADDSUB node.
21469 if (TLI.isTypeLegal(VT) && Subtarget->hasSSE3())
21470 if (SDValue AddSub = combineShuffleToAddSub(N, DAG))
21473 // Combine 256-bit vector shuffles. This is only profitable when in AVX mode
21474 if (Subtarget->hasFp256() && VT.is256BitVector() &&
21475 N->getOpcode() == ISD::VECTOR_SHUFFLE)
21476 return PerformShuffleCombine256(N, DAG, DCI, Subtarget);
21478 // During Type Legalization, when promoting illegal vector types,
21479 // the backend might introduce new shuffle dag nodes and bitcasts.
21481 // This code performs the following transformation:
21482 // fold: (shuffle (bitcast (BINOP A, B)), Undef, <Mask>) ->
21483 // (shuffle (BINOP (bitcast A), (bitcast B)), Undef, <Mask>)
21485 // We do this only if both the bitcast and the BINOP dag nodes have
21486 // one use. Also, perform this transformation only if the new binary
21487 // operation is legal. This is to avoid introducing dag nodes that
21488 // potentially need to be further expanded (or custom lowered) into a
21489 // less optimal sequence of dag nodes.
21490 if (!DCI.isBeforeLegalize() && DCI.isBeforeLegalizeOps() &&
21491 N1.getOpcode() == ISD::UNDEF && N0.hasOneUse() &&
21492 N0.getOpcode() == ISD::BITCAST) {
21493 SDValue BC0 = N0.getOperand(0);
21494 EVT SVT = BC0.getValueType();
21495 unsigned Opcode = BC0.getOpcode();
21496 unsigned NumElts = VT.getVectorNumElements();
21498 if (BC0.hasOneUse() && SVT.isVector() &&
21499 SVT.getVectorNumElements() * 2 == NumElts &&
21500 TLI.isOperationLegal(Opcode, VT)) {
21501 bool CanFold = false;
21513 unsigned SVTNumElts = SVT.getVectorNumElements();
21514 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(N);
21515 for (unsigned i = 0, e = SVTNumElts; i != e && CanFold; ++i)
21516 CanFold = SVOp->getMaskElt(i) == (int)(i * 2);
21517 for (unsigned i = SVTNumElts, e = NumElts; i != e && CanFold; ++i)
21518 CanFold = SVOp->getMaskElt(i) < 0;
21521 SDValue BC00 = DAG.getNode(ISD::BITCAST, dl, VT, BC0.getOperand(0));
21522 SDValue BC01 = DAG.getNode(ISD::BITCAST, dl, VT, BC0.getOperand(1));
21523 SDValue NewBinOp = DAG.getNode(BC0.getOpcode(), dl, VT, BC00, BC01);
21524 return DAG.getVectorShuffle(VT, dl, NewBinOp, N1, &SVOp->getMask()[0]);
21529 // Only handle 128 wide vector from here on.
21530 if (!VT.is128BitVector())
21533 // Combine a vector_shuffle that is equal to build_vector load1, load2, load3,
21534 // load4, <0, 1, 2, 3> into a 128-bit load if the load addresses are
21535 // consecutive, non-overlapping, and in the right order.
21536 SmallVector<SDValue, 16> Elts;
21537 for (unsigned i = 0, e = VT.getVectorNumElements(); i != e; ++i)
21538 Elts.push_back(getShuffleScalarElt(N, i, DAG, 0));
21540 SDValue LD = EltsFromConsecutiveLoads(VT, Elts, dl, DAG, true);
21544 if (isTargetShuffle(N->getOpcode())) {
21546 PerformTargetShuffleCombine(SDValue(N, 0), DAG, DCI, Subtarget);
21547 if (Shuffle.getNode())
21550 // Try recursively combining arbitrary sequences of x86 shuffle
21551 // instructions into higher-order shuffles. We do this after combining
21552 // specific PSHUF instruction sequences into their minimal form so that we
21553 // can evaluate how many specialized shuffle instructions are involved in
21554 // a particular chain.
21555 SmallVector<int, 1> NonceMask; // Just a placeholder.
21556 NonceMask.push_back(0);
21557 if (combineX86ShufflesRecursively(SDValue(N, 0), SDValue(N, 0), NonceMask,
21558 /*Depth*/ 1, /*HasPSHUFB*/ false, DAG,
21560 return SDValue(); // This routine will use CombineTo to replace N.
21566 /// PerformTruncateCombine - Converts truncate operation to
21567 /// a sequence of vector shuffle operations.
21568 /// It is possible when we truncate 256-bit vector to 128-bit vector
21569 static SDValue PerformTruncateCombine(SDNode *N, SelectionDAG &DAG,
21570 TargetLowering::DAGCombinerInfo &DCI,
21571 const X86Subtarget *Subtarget) {
21575 /// XFormVExtractWithShuffleIntoLoad - Check if a vector extract from a target
21576 /// specific shuffle of a load can be folded into a single element load.
21577 /// Similar handling for VECTOR_SHUFFLE is performed by DAGCombiner, but
21578 /// shuffles have been customed lowered so we need to handle those here.
21579 static SDValue XFormVExtractWithShuffleIntoLoad(SDNode *N, SelectionDAG &DAG,
21580 TargetLowering::DAGCombinerInfo &DCI) {
21581 if (DCI.isBeforeLegalizeOps())
21584 SDValue InVec = N->getOperand(0);
21585 SDValue EltNo = N->getOperand(1);
21587 if (!isa<ConstantSDNode>(EltNo))
21590 EVT VT = InVec.getValueType();
21592 if (InVec.getOpcode() == ISD::BITCAST) {
21593 // Don't duplicate a load with other uses.
21594 if (!InVec.hasOneUse())
21596 EVT BCVT = InVec.getOperand(0).getValueType();
21597 if (BCVT.getVectorNumElements() != VT.getVectorNumElements())
21599 InVec = InVec.getOperand(0);
21602 if (!isTargetShuffle(InVec.getOpcode()))
21605 // Don't duplicate a load with other uses.
21606 if (!InVec.hasOneUse())
21609 SmallVector<int, 16> ShuffleMask;
21611 if (!getTargetShuffleMask(InVec.getNode(), VT.getSimpleVT(), ShuffleMask,
21615 // Select the input vector, guarding against out of range extract vector.
21616 unsigned NumElems = VT.getVectorNumElements();
21617 int Elt = cast<ConstantSDNode>(EltNo)->getZExtValue();
21618 int Idx = (Elt > (int)NumElems) ? -1 : ShuffleMask[Elt];
21619 SDValue LdNode = (Idx < (int)NumElems) ? InVec.getOperand(0)
21620 : InVec.getOperand(1);
21622 // If inputs to shuffle are the same for both ops, then allow 2 uses
21623 unsigned AllowedUses = InVec.getOperand(0) == InVec.getOperand(1) ? 2 : 1;
21625 if (LdNode.getOpcode() == ISD::BITCAST) {
21626 // Don't duplicate a load with other uses.
21627 if (!LdNode.getNode()->hasNUsesOfValue(AllowedUses, 0))
21630 AllowedUses = 1; // only allow 1 load use if we have a bitcast
21631 LdNode = LdNode.getOperand(0);
21634 if (!ISD::isNormalLoad(LdNode.getNode()))
21637 LoadSDNode *LN0 = cast<LoadSDNode>(LdNode);
21639 if (!LN0 ||!LN0->hasNUsesOfValue(AllowedUses, 0) || LN0->isVolatile())
21642 EVT EltVT = N->getValueType(0);
21643 // If there's a bitcast before the shuffle, check if the load type and
21644 // alignment is valid.
21645 unsigned Align = LN0->getAlignment();
21646 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
21647 unsigned NewAlign = TLI.getDataLayout()->getABITypeAlignment(
21648 EltVT.getTypeForEVT(*DAG.getContext()));
21650 if (NewAlign > Align || !TLI.isOperationLegalOrCustom(ISD::LOAD, EltVT))
21653 // All checks match so transform back to vector_shuffle so that DAG combiner
21654 // can finish the job
21657 // Create shuffle node taking into account the case that its a unary shuffle
21658 SDValue Shuffle = (UnaryShuffle) ? DAG.getUNDEF(VT) : InVec.getOperand(1);
21659 Shuffle = DAG.getVectorShuffle(InVec.getValueType(), dl,
21660 InVec.getOperand(0), Shuffle,
21662 Shuffle = DAG.getNode(ISD::BITCAST, dl, VT, Shuffle);
21663 return DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, N->getValueType(0), Shuffle,
21667 /// PerformEXTRACT_VECTOR_ELTCombine - Detect vector gather/scatter index
21668 /// generation and convert it from being a bunch of shuffles and extracts
21669 /// to a simple store and scalar loads to extract the elements.
21670 static SDValue PerformEXTRACT_VECTOR_ELTCombine(SDNode *N, SelectionDAG &DAG,
21671 TargetLowering::DAGCombinerInfo &DCI) {
21672 SDValue NewOp = XFormVExtractWithShuffleIntoLoad(N, DAG, DCI);
21673 if (NewOp.getNode())
21676 SDValue InputVector = N->getOperand(0);
21678 // Detect whether we are trying to convert from mmx to i32 and the bitcast
21679 // from mmx to v2i32 has a single usage.
21680 if (InputVector.getNode()->getOpcode() == llvm::ISD::BITCAST &&
21681 InputVector.getNode()->getOperand(0).getValueType() == MVT::x86mmx &&
21682 InputVector.hasOneUse() && N->getValueType(0) == MVT::i32)
21683 return DAG.getNode(X86ISD::MMX_MOVD2W, SDLoc(InputVector),
21684 N->getValueType(0),
21685 InputVector.getNode()->getOperand(0));
21687 // Only operate on vectors of 4 elements, where the alternative shuffling
21688 // gets to be more expensive.
21689 if (InputVector.getValueType() != MVT::v4i32)
21692 // Check whether every use of InputVector is an EXTRACT_VECTOR_ELT with a
21693 // single use which is a sign-extend or zero-extend, and all elements are
21695 SmallVector<SDNode *, 4> Uses;
21696 unsigned ExtractedElements = 0;
21697 for (SDNode::use_iterator UI = InputVector.getNode()->use_begin(),
21698 UE = InputVector.getNode()->use_end(); UI != UE; ++UI) {
21699 if (UI.getUse().getResNo() != InputVector.getResNo())
21702 SDNode *Extract = *UI;
21703 if (Extract->getOpcode() != ISD::EXTRACT_VECTOR_ELT)
21706 if (Extract->getValueType(0) != MVT::i32)
21708 if (!Extract->hasOneUse())
21710 if (Extract->use_begin()->getOpcode() != ISD::SIGN_EXTEND &&
21711 Extract->use_begin()->getOpcode() != ISD::ZERO_EXTEND)
21713 if (!isa<ConstantSDNode>(Extract->getOperand(1)))
21716 // Record which element was extracted.
21717 ExtractedElements |=
21718 1 << cast<ConstantSDNode>(Extract->getOperand(1))->getZExtValue();
21720 Uses.push_back(Extract);
21723 // If not all the elements were used, this may not be worthwhile.
21724 if (ExtractedElements != 15)
21727 // Ok, we've now decided to do the transformation.
21728 SDLoc dl(InputVector);
21730 // Store the value to a temporary stack slot.
21731 SDValue StackPtr = DAG.CreateStackTemporary(InputVector.getValueType());
21732 SDValue Ch = DAG.getStore(DAG.getEntryNode(), dl, InputVector, StackPtr,
21733 MachinePointerInfo(), false, false, 0);
21735 // Replace each use (extract) with a load of the appropriate element.
21736 for (SmallVectorImpl<SDNode *>::iterator UI = Uses.begin(),
21737 UE = Uses.end(); UI != UE; ++UI) {
21738 SDNode *Extract = *UI;
21740 // cOMpute the element's address.
21741 SDValue Idx = Extract->getOperand(1);
21743 InputVector.getValueType().getVectorElementType().getSizeInBits()/8;
21744 uint64_t Offset = EltSize * cast<ConstantSDNode>(Idx)->getZExtValue();
21745 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
21746 SDValue OffsetVal = DAG.getConstant(Offset, TLI.getPointerTy());
21748 SDValue ScalarAddr = DAG.getNode(ISD::ADD, dl, TLI.getPointerTy(),
21749 StackPtr, OffsetVal);
21751 // Load the scalar.
21752 SDValue LoadScalar = DAG.getLoad(Extract->getValueType(0), dl, Ch,
21753 ScalarAddr, MachinePointerInfo(),
21754 false, false, false, 0);
21756 // Replace the exact with the load.
21757 DAG.ReplaceAllUsesOfValueWith(SDValue(Extract, 0), LoadScalar);
21760 // The replacement was made in place; don't return anything.
21764 /// \brief Matches a VSELECT onto min/max or return 0 if the node doesn't match.
21765 static std::pair<unsigned, bool>
21766 matchIntegerMINMAX(SDValue Cond, EVT VT, SDValue LHS, SDValue RHS,
21767 SelectionDAG &DAG, const X86Subtarget *Subtarget) {
21768 if (!VT.isVector())
21769 return std::make_pair(0, false);
21771 bool NeedSplit = false;
21772 switch (VT.getSimpleVT().SimpleTy) {
21773 default: return std::make_pair(0, false);
21777 if (!Subtarget->hasAVX2())
21779 if (!Subtarget->hasAVX())
21780 return std::make_pair(0, false);
21785 if (!Subtarget->hasSSE2())
21786 return std::make_pair(0, false);
21789 // SSE2 has only a small subset of the operations.
21790 bool hasUnsigned = Subtarget->hasSSE41() ||
21791 (Subtarget->hasSSE2() && VT == MVT::v16i8);
21792 bool hasSigned = Subtarget->hasSSE41() ||
21793 (Subtarget->hasSSE2() && VT == MVT::v8i16);
21795 ISD::CondCode CC = cast<CondCodeSDNode>(Cond.getOperand(2))->get();
21798 // Check for x CC y ? x : y.
21799 if (DAG.isEqualTo(LHS, Cond.getOperand(0)) &&
21800 DAG.isEqualTo(RHS, Cond.getOperand(1))) {
21805 Opc = hasUnsigned ? X86ISD::UMIN : 0; break;
21808 Opc = hasUnsigned ? X86ISD::UMAX : 0; break;
21811 Opc = hasSigned ? X86ISD::SMIN : 0; break;
21814 Opc = hasSigned ? X86ISD::SMAX : 0; break;
21816 // Check for x CC y ? y : x -- a min/max with reversed arms.
21817 } else if (DAG.isEqualTo(LHS, Cond.getOperand(1)) &&
21818 DAG.isEqualTo(RHS, Cond.getOperand(0))) {
21823 Opc = hasUnsigned ? X86ISD::UMAX : 0; break;
21826 Opc = hasUnsigned ? X86ISD::UMIN : 0; break;
21829 Opc = hasSigned ? X86ISD::SMAX : 0; break;
21832 Opc = hasSigned ? X86ISD::SMIN : 0; break;
21836 return std::make_pair(Opc, NeedSplit);
21840 TransformVSELECTtoBlendVECTOR_SHUFFLE(SDNode *N, SelectionDAG &DAG,
21841 const X86Subtarget *Subtarget) {
21843 SDValue Cond = N->getOperand(0);
21844 SDValue LHS = N->getOperand(1);
21845 SDValue RHS = N->getOperand(2);
21847 if (Cond.getOpcode() == ISD::SIGN_EXTEND) {
21848 SDValue CondSrc = Cond->getOperand(0);
21849 if (CondSrc->getOpcode() == ISD::SIGN_EXTEND_INREG)
21850 Cond = CondSrc->getOperand(0);
21853 MVT VT = N->getSimpleValueType(0);
21854 MVT EltVT = VT.getVectorElementType();
21855 unsigned NumElems = VT.getVectorNumElements();
21856 // There is no blend with immediate in AVX-512.
21857 if (VT.is512BitVector())
21860 if (!Subtarget->hasSSE41() || EltVT == MVT::i8)
21862 if (!Subtarget->hasInt256() && VT == MVT::v16i16)
21865 if (!ISD::isBuildVectorOfConstantSDNodes(Cond.getNode()))
21868 // A vselect where all conditions and data are constants can be optimized into
21869 // a single vector load by SelectionDAGLegalize::ExpandBUILD_VECTOR().
21870 if (ISD::isBuildVectorOfConstantSDNodes(LHS.getNode()) &&
21871 ISD::isBuildVectorOfConstantSDNodes(RHS.getNode()))
21874 unsigned MaskValue = 0;
21875 if (!BUILD_VECTORtoBlendMask(cast<BuildVectorSDNode>(Cond), MaskValue))
21878 SmallVector<int, 8> ShuffleMask(NumElems, -1);
21879 for (unsigned i = 0; i < NumElems; ++i) {
21880 // Be sure we emit undef where we can.
21881 if (Cond.getOperand(i)->getOpcode() == ISD::UNDEF)
21882 ShuffleMask[i] = -1;
21884 ShuffleMask[i] = i + NumElems * ((MaskValue >> i) & 1);
21887 return DAG.getVectorShuffle(VT, dl, LHS, RHS, &ShuffleMask[0]);
21890 /// PerformSELECTCombine - Do target-specific dag combines on SELECT and VSELECT
21892 static SDValue PerformSELECTCombine(SDNode *N, SelectionDAG &DAG,
21893 TargetLowering::DAGCombinerInfo &DCI,
21894 const X86Subtarget *Subtarget) {
21896 SDValue Cond = N->getOperand(0);
21897 // Get the LHS/RHS of the select.
21898 SDValue LHS = N->getOperand(1);
21899 SDValue RHS = N->getOperand(2);
21900 EVT VT = LHS.getValueType();
21901 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
21903 // If we have SSE[12] support, try to form min/max nodes. SSE min/max
21904 // instructions match the semantics of the common C idiom x<y?x:y but not
21905 // x<=y?x:y, because of how they handle negative zero (which can be
21906 // ignored in unsafe-math mode).
21907 if (Cond.getOpcode() == ISD::SETCC && VT.isFloatingPoint() &&
21908 VT != MVT::f80 && TLI.isTypeLegal(VT) &&
21909 (Subtarget->hasSSE2() ||
21910 (Subtarget->hasSSE1() && VT.getScalarType() == MVT::f32))) {
21911 ISD::CondCode CC = cast<CondCodeSDNode>(Cond.getOperand(2))->get();
21913 unsigned Opcode = 0;
21914 // Check for x CC y ? x : y.
21915 if (DAG.isEqualTo(LHS, Cond.getOperand(0)) &&
21916 DAG.isEqualTo(RHS, Cond.getOperand(1))) {
21920 // Converting this to a min would handle NaNs incorrectly, and swapping
21921 // the operands would cause it to handle comparisons between positive
21922 // and negative zero incorrectly.
21923 if (!DAG.isKnownNeverNaN(LHS) || !DAG.isKnownNeverNaN(RHS)) {
21924 if (!DAG.getTarget().Options.UnsafeFPMath &&
21925 !(DAG.isKnownNeverZero(LHS) || DAG.isKnownNeverZero(RHS)))
21927 std::swap(LHS, RHS);
21929 Opcode = X86ISD::FMIN;
21932 // Converting this to a min would handle comparisons between positive
21933 // and negative zero incorrectly.
21934 if (!DAG.getTarget().Options.UnsafeFPMath &&
21935 !DAG.isKnownNeverZero(LHS) && !DAG.isKnownNeverZero(RHS))
21937 Opcode = X86ISD::FMIN;
21940 // Converting this to a min would handle both negative zeros and NaNs
21941 // incorrectly, but we can swap the operands to fix both.
21942 std::swap(LHS, RHS);
21946 Opcode = X86ISD::FMIN;
21950 // Converting this to a max would handle comparisons between positive
21951 // and negative zero incorrectly.
21952 if (!DAG.getTarget().Options.UnsafeFPMath &&
21953 !DAG.isKnownNeverZero(LHS) && !DAG.isKnownNeverZero(RHS))
21955 Opcode = X86ISD::FMAX;
21958 // Converting this to a max would handle NaNs incorrectly, and swapping
21959 // the operands would cause it to handle comparisons between positive
21960 // and negative zero incorrectly.
21961 if (!DAG.isKnownNeverNaN(LHS) || !DAG.isKnownNeverNaN(RHS)) {
21962 if (!DAG.getTarget().Options.UnsafeFPMath &&
21963 !(DAG.isKnownNeverZero(LHS) || DAG.isKnownNeverZero(RHS)))
21965 std::swap(LHS, RHS);
21967 Opcode = X86ISD::FMAX;
21970 // Converting this to a max would handle both negative zeros and NaNs
21971 // incorrectly, but we can swap the operands to fix both.
21972 std::swap(LHS, RHS);
21976 Opcode = X86ISD::FMAX;
21979 // Check for x CC y ? y : x -- a min/max with reversed arms.
21980 } else if (DAG.isEqualTo(LHS, Cond.getOperand(1)) &&
21981 DAG.isEqualTo(RHS, Cond.getOperand(0))) {
21985 // Converting this to a min would handle comparisons between positive
21986 // and negative zero incorrectly, and swapping the operands would
21987 // cause it to handle NaNs incorrectly.
21988 if (!DAG.getTarget().Options.UnsafeFPMath &&
21989 !(DAG.isKnownNeverZero(LHS) || DAG.isKnownNeverZero(RHS))) {
21990 if (!DAG.isKnownNeverNaN(LHS) || !DAG.isKnownNeverNaN(RHS))
21992 std::swap(LHS, RHS);
21994 Opcode = X86ISD::FMIN;
21997 // Converting this to a min would handle NaNs incorrectly.
21998 if (!DAG.getTarget().Options.UnsafeFPMath &&
21999 (!DAG.isKnownNeverNaN(LHS) || !DAG.isKnownNeverNaN(RHS)))
22001 Opcode = X86ISD::FMIN;
22004 // Converting this to a min would handle both negative zeros and NaNs
22005 // incorrectly, but we can swap the operands to fix both.
22006 std::swap(LHS, RHS);
22010 Opcode = X86ISD::FMIN;
22014 // Converting this to a max would handle NaNs incorrectly.
22015 if (!DAG.isKnownNeverNaN(LHS) || !DAG.isKnownNeverNaN(RHS))
22017 Opcode = X86ISD::FMAX;
22020 // Converting this to a max would handle comparisons between positive
22021 // and negative zero incorrectly, and swapping the operands would
22022 // cause it to handle NaNs incorrectly.
22023 if (!DAG.getTarget().Options.UnsafeFPMath &&
22024 !DAG.isKnownNeverZero(LHS) && !DAG.isKnownNeverZero(RHS)) {
22025 if (!DAG.isKnownNeverNaN(LHS) || !DAG.isKnownNeverNaN(RHS))
22027 std::swap(LHS, RHS);
22029 Opcode = X86ISD::FMAX;
22032 // Converting this to a max would handle both negative zeros and NaNs
22033 // incorrectly, but we can swap the operands to fix both.
22034 std::swap(LHS, RHS);
22038 Opcode = X86ISD::FMAX;
22044 return DAG.getNode(Opcode, DL, N->getValueType(0), LHS, RHS);
22047 EVT CondVT = Cond.getValueType();
22048 if (Subtarget->hasAVX512() && VT.isVector() && CondVT.isVector() &&
22049 CondVT.getVectorElementType() == MVT::i1) {
22050 // v16i8 (select v16i1, v16i8, v16i8) does not have a proper
22051 // lowering on KNL. In this case we convert it to
22052 // v16i8 (select v16i8, v16i8, v16i8) and use AVX instruction.
22053 // The same situation for all 128 and 256-bit vectors of i8 and i16.
22054 // Since SKX these selects have a proper lowering.
22055 EVT OpVT = LHS.getValueType();
22056 if ((OpVT.is128BitVector() || OpVT.is256BitVector()) &&
22057 (OpVT.getVectorElementType() == MVT::i8 ||
22058 OpVT.getVectorElementType() == MVT::i16) &&
22059 !(Subtarget->hasBWI() && Subtarget->hasVLX())) {
22060 Cond = DAG.getNode(ISD::SIGN_EXTEND, DL, OpVT, Cond);
22061 DCI.AddToWorklist(Cond.getNode());
22062 return DAG.getNode(N->getOpcode(), DL, OpVT, Cond, LHS, RHS);
22065 // If this is a select between two integer constants, try to do some
22067 if (ConstantSDNode *TrueC = dyn_cast<ConstantSDNode>(LHS)) {
22068 if (ConstantSDNode *FalseC = dyn_cast<ConstantSDNode>(RHS))
22069 // Don't do this for crazy integer types.
22070 if (DAG.getTargetLoweringInfo().isTypeLegal(LHS.getValueType())) {
22071 // If this is efficiently invertible, canonicalize the LHSC/RHSC values
22072 // so that TrueC (the true value) is larger than FalseC.
22073 bool NeedsCondInvert = false;
22075 if (TrueC->getAPIntValue().ult(FalseC->getAPIntValue()) &&
22076 // Efficiently invertible.
22077 (Cond.getOpcode() == ISD::SETCC || // setcc -> invertible.
22078 (Cond.getOpcode() == ISD::XOR && // xor(X, C) -> invertible.
22079 isa<ConstantSDNode>(Cond.getOperand(1))))) {
22080 NeedsCondInvert = true;
22081 std::swap(TrueC, FalseC);
22084 // Optimize C ? 8 : 0 -> zext(C) << 3. Likewise for any pow2/0.
22085 if (FalseC->getAPIntValue() == 0 &&
22086 TrueC->getAPIntValue().isPowerOf2()) {
22087 if (NeedsCondInvert) // Invert the condition if needed.
22088 Cond = DAG.getNode(ISD::XOR, DL, Cond.getValueType(), Cond,
22089 DAG.getConstant(1, Cond.getValueType()));
22091 // Zero extend the condition if needed.
22092 Cond = DAG.getNode(ISD::ZERO_EXTEND, DL, LHS.getValueType(), Cond);
22094 unsigned ShAmt = TrueC->getAPIntValue().logBase2();
22095 return DAG.getNode(ISD::SHL, DL, LHS.getValueType(), Cond,
22096 DAG.getConstant(ShAmt, MVT::i8));
22099 // Optimize Cond ? cst+1 : cst -> zext(setcc(C)+cst.
22100 if (FalseC->getAPIntValue()+1 == TrueC->getAPIntValue()) {
22101 if (NeedsCondInvert) // Invert the condition if needed.
22102 Cond = DAG.getNode(ISD::XOR, DL, Cond.getValueType(), Cond,
22103 DAG.getConstant(1, Cond.getValueType()));
22105 // Zero extend the condition if needed.
22106 Cond = DAG.getNode(ISD::ZERO_EXTEND, DL,
22107 FalseC->getValueType(0), Cond);
22108 return DAG.getNode(ISD::ADD, DL, Cond.getValueType(), Cond,
22109 SDValue(FalseC, 0));
22112 // Optimize cases that will turn into an LEA instruction. This requires
22113 // an i32 or i64 and an efficient multiplier (1, 2, 3, 4, 5, 8, 9).
22114 if (N->getValueType(0) == MVT::i32 || N->getValueType(0) == MVT::i64) {
22115 uint64_t Diff = TrueC->getZExtValue()-FalseC->getZExtValue();
22116 if (N->getValueType(0) == MVT::i32) Diff = (unsigned)Diff;
22118 bool isFastMultiplier = false;
22120 switch ((unsigned char)Diff) {
22122 case 1: // result = add base, cond
22123 case 2: // result = lea base( , cond*2)
22124 case 3: // result = lea base(cond, cond*2)
22125 case 4: // result = lea base( , cond*4)
22126 case 5: // result = lea base(cond, cond*4)
22127 case 8: // result = lea base( , cond*8)
22128 case 9: // result = lea base(cond, cond*8)
22129 isFastMultiplier = true;
22134 if (isFastMultiplier) {
22135 APInt Diff = TrueC->getAPIntValue()-FalseC->getAPIntValue();
22136 if (NeedsCondInvert) // Invert the condition if needed.
22137 Cond = DAG.getNode(ISD::XOR, DL, Cond.getValueType(), Cond,
22138 DAG.getConstant(1, Cond.getValueType()));
22140 // Zero extend the condition if needed.
22141 Cond = DAG.getNode(ISD::ZERO_EXTEND, DL, FalseC->getValueType(0),
22143 // Scale the condition by the difference.
22145 Cond = DAG.getNode(ISD::MUL, DL, Cond.getValueType(), Cond,
22146 DAG.getConstant(Diff, Cond.getValueType()));
22148 // Add the base if non-zero.
22149 if (FalseC->getAPIntValue() != 0)
22150 Cond = DAG.getNode(ISD::ADD, DL, Cond.getValueType(), Cond,
22151 SDValue(FalseC, 0));
22158 // Canonicalize max and min:
22159 // (x > y) ? x : y -> (x >= y) ? x : y
22160 // (x < y) ? x : y -> (x <= y) ? x : y
22161 // This allows use of COND_S / COND_NS (see TranslateX86CC) which eliminates
22162 // the need for an extra compare
22163 // against zero. e.g.
22164 // (x - y) > 0 : (x - y) ? 0 -> (x - y) >= 0 : (x - y) ? 0
22166 // testl %edi, %edi
22168 // cmovgl %edi, %eax
22172 // cmovsl %eax, %edi
22173 if (N->getOpcode() == ISD::SELECT && Cond.getOpcode() == ISD::SETCC &&
22174 DAG.isEqualTo(LHS, Cond.getOperand(0)) &&
22175 DAG.isEqualTo(RHS, Cond.getOperand(1))) {
22176 ISD::CondCode CC = cast<CondCodeSDNode>(Cond.getOperand(2))->get();
22181 ISD::CondCode NewCC = (CC == ISD::SETLT) ? ISD::SETLE : ISD::SETGE;
22182 Cond = DAG.getSetCC(SDLoc(Cond), Cond.getValueType(),
22183 Cond.getOperand(0), Cond.getOperand(1), NewCC);
22184 return DAG.getNode(ISD::SELECT, DL, VT, Cond, LHS, RHS);
22189 // Early exit check
22190 if (!TLI.isTypeLegal(VT))
22193 // Match VSELECTs into subs with unsigned saturation.
22194 if (N->getOpcode() == ISD::VSELECT && Cond.getOpcode() == ISD::SETCC &&
22195 // psubus is available in SSE2 and AVX2 for i8 and i16 vectors.
22196 ((Subtarget->hasSSE2() && (VT == MVT::v16i8 || VT == MVT::v8i16)) ||
22197 (Subtarget->hasAVX2() && (VT == MVT::v32i8 || VT == MVT::v16i16)))) {
22198 ISD::CondCode CC = cast<CondCodeSDNode>(Cond.getOperand(2))->get();
22200 // Check if one of the arms of the VSELECT is a zero vector. If it's on the
22201 // left side invert the predicate to simplify logic below.
22203 if (ISD::isBuildVectorAllZeros(LHS.getNode())) {
22205 CC = ISD::getSetCCInverse(CC, true);
22206 } else if (ISD::isBuildVectorAllZeros(RHS.getNode())) {
22210 if (Other.getNode() && Other->getNumOperands() == 2 &&
22211 DAG.isEqualTo(Other->getOperand(0), Cond.getOperand(0))) {
22212 SDValue OpLHS = Other->getOperand(0), OpRHS = Other->getOperand(1);
22213 SDValue CondRHS = Cond->getOperand(1);
22215 // Look for a general sub with unsigned saturation first.
22216 // x >= y ? x-y : 0 --> subus x, y
22217 // x > y ? x-y : 0 --> subus x, y
22218 if ((CC == ISD::SETUGE || CC == ISD::SETUGT) &&
22219 Other->getOpcode() == ISD::SUB && DAG.isEqualTo(OpRHS, CondRHS))
22220 return DAG.getNode(X86ISD::SUBUS, DL, VT, OpLHS, OpRHS);
22222 if (auto *OpRHSBV = dyn_cast<BuildVectorSDNode>(OpRHS))
22223 if (auto *OpRHSConst = OpRHSBV->getConstantSplatNode()) {
22224 if (auto *CondRHSBV = dyn_cast<BuildVectorSDNode>(CondRHS))
22225 if (auto *CondRHSConst = CondRHSBV->getConstantSplatNode())
22226 // If the RHS is a constant we have to reverse the const
22227 // canonicalization.
22228 // x > C-1 ? x+-C : 0 --> subus x, C
22229 if (CC == ISD::SETUGT && Other->getOpcode() == ISD::ADD &&
22230 CondRHSConst->getAPIntValue() ==
22231 (-OpRHSConst->getAPIntValue() - 1))
22232 return DAG.getNode(
22233 X86ISD::SUBUS, DL, VT, OpLHS,
22234 DAG.getConstant(-OpRHSConst->getAPIntValue(), VT));
22236 // Another special case: If C was a sign bit, the sub has been
22237 // canonicalized into a xor.
22238 // FIXME: Would it be better to use computeKnownBits to determine
22239 // whether it's safe to decanonicalize the xor?
22240 // x s< 0 ? x^C : 0 --> subus x, C
22241 if (CC == ISD::SETLT && Other->getOpcode() == ISD::XOR &&
22242 ISD::isBuildVectorAllZeros(CondRHS.getNode()) &&
22243 OpRHSConst->getAPIntValue().isSignBit())
22244 // Note that we have to rebuild the RHS constant here to ensure we
22245 // don't rely on particular values of undef lanes.
22246 return DAG.getNode(
22247 X86ISD::SUBUS, DL, VT, OpLHS,
22248 DAG.getConstant(OpRHSConst->getAPIntValue(), VT));
22253 // Try to match a min/max vector operation.
22254 if (N->getOpcode() == ISD::VSELECT && Cond.getOpcode() == ISD::SETCC) {
22255 std::pair<unsigned, bool> ret = matchIntegerMINMAX(Cond, VT, LHS, RHS, DAG, Subtarget);
22256 unsigned Opc = ret.first;
22257 bool NeedSplit = ret.second;
22259 if (Opc && NeedSplit) {
22260 unsigned NumElems = VT.getVectorNumElements();
22261 // Extract the LHS vectors
22262 SDValue LHS1 = Extract128BitVector(LHS, 0, DAG, DL);
22263 SDValue LHS2 = Extract128BitVector(LHS, NumElems/2, DAG, DL);
22265 // Extract the RHS vectors
22266 SDValue RHS1 = Extract128BitVector(RHS, 0, DAG, DL);
22267 SDValue RHS2 = Extract128BitVector(RHS, NumElems/2, DAG, DL);
22269 // Create min/max for each subvector
22270 LHS = DAG.getNode(Opc, DL, LHS1.getValueType(), LHS1, RHS1);
22271 RHS = DAG.getNode(Opc, DL, LHS2.getValueType(), LHS2, RHS2);
22273 // Merge the result
22274 return DAG.getNode(ISD::CONCAT_VECTORS, DL, VT, LHS, RHS);
22276 return DAG.getNode(Opc, DL, VT, LHS, RHS);
22279 // Simplify vector selection if the selector will be produced by CMPP*/PCMP*.
22280 if (N->getOpcode() == ISD::VSELECT && Cond.getOpcode() == ISD::SETCC &&
22281 // Check if SETCC has already been promoted
22282 TLI.getSetCCResultType(*DAG.getContext(), VT) == CondVT &&
22283 // Check that condition value type matches vselect operand type
22286 assert(Cond.getValueType().isVector() &&
22287 "vector select expects a vector selector!");
22289 bool TValIsAllOnes = ISD::isBuildVectorAllOnes(LHS.getNode());
22290 bool FValIsAllZeros = ISD::isBuildVectorAllZeros(RHS.getNode());
22292 if (!TValIsAllOnes && !FValIsAllZeros) {
22293 // Try invert the condition if true value is not all 1s and false value
22295 bool TValIsAllZeros = ISD::isBuildVectorAllZeros(LHS.getNode());
22296 bool FValIsAllOnes = ISD::isBuildVectorAllOnes(RHS.getNode());
22298 if (TValIsAllZeros || FValIsAllOnes) {
22299 SDValue CC = Cond.getOperand(2);
22300 ISD::CondCode NewCC =
22301 ISD::getSetCCInverse(cast<CondCodeSDNode>(CC)->get(),
22302 Cond.getOperand(0).getValueType().isInteger());
22303 Cond = DAG.getSetCC(DL, CondVT, Cond.getOperand(0), Cond.getOperand(1), NewCC);
22304 std::swap(LHS, RHS);
22305 TValIsAllOnes = FValIsAllOnes;
22306 FValIsAllZeros = TValIsAllZeros;
22310 if (TValIsAllOnes || FValIsAllZeros) {
22313 if (TValIsAllOnes && FValIsAllZeros)
22315 else if (TValIsAllOnes)
22316 Ret = DAG.getNode(ISD::OR, DL, CondVT, Cond,
22317 DAG.getNode(ISD::BITCAST, DL, CondVT, RHS));
22318 else if (FValIsAllZeros)
22319 Ret = DAG.getNode(ISD::AND, DL, CondVT, Cond,
22320 DAG.getNode(ISD::BITCAST, DL, CondVT, LHS));
22322 return DAG.getNode(ISD::BITCAST, DL, VT, Ret);
22326 // Try to fold this VSELECT into a MOVSS/MOVSD
22327 if (N->getOpcode() == ISD::VSELECT &&
22328 Cond.getOpcode() == ISD::BUILD_VECTOR && !DCI.isBeforeLegalize()) {
22329 if (VT == MVT::v4i32 || VT == MVT::v4f32 ||
22330 (Subtarget->hasSSE2() && (VT == MVT::v2i64 || VT == MVT::v2f64))) {
22331 bool CanFold = false;
22332 unsigned NumElems = Cond.getNumOperands();
22336 if (isZero(Cond.getOperand(0))) {
22339 // fold (vselect <0,-1,-1,-1>, A, B) -> (movss A, B)
22340 // fold (vselect <0,-1> -> (movsd A, B)
22341 for (unsigned i = 1, e = NumElems; i != e && CanFold; ++i)
22342 CanFold = isAllOnes(Cond.getOperand(i));
22343 } else if (isAllOnes(Cond.getOperand(0))) {
22347 // fold (vselect <-1,0,0,0>, A, B) -> (movss B, A)
22348 // fold (vselect <-1,0> -> (movsd B, A)
22349 for (unsigned i = 1, e = NumElems; i != e && CanFold; ++i)
22350 CanFold = isZero(Cond.getOperand(i));
22354 if (VT == MVT::v4i32 || VT == MVT::v4f32)
22355 return getTargetShuffleNode(X86ISD::MOVSS, DL, VT, A, B, DAG);
22356 return getTargetShuffleNode(X86ISD::MOVSD, DL, VT, A, B, DAG);
22359 if (Subtarget->hasSSE2() && (VT == MVT::v4i32 || VT == MVT::v4f32)) {
22360 // fold (v4i32: vselect <0,0,-1,-1>, A, B) ->
22361 // (v4i32 (bitcast (movsd (v2i64 (bitcast A)),
22362 // (v2i64 (bitcast B)))))
22364 // fold (v4f32: vselect <0,0,-1,-1>, A, B) ->
22365 // (v4f32 (bitcast (movsd (v2f64 (bitcast A)),
22366 // (v2f64 (bitcast B)))))
22368 // fold (v4i32: vselect <-1,-1,0,0>, A, B) ->
22369 // (v4i32 (bitcast (movsd (v2i64 (bitcast B)),
22370 // (v2i64 (bitcast A)))))
22372 // fold (v4f32: vselect <-1,-1,0,0>, A, B) ->
22373 // (v4f32 (bitcast (movsd (v2f64 (bitcast B)),
22374 // (v2f64 (bitcast A)))))
22376 CanFold = (isZero(Cond.getOperand(0)) &&
22377 isZero(Cond.getOperand(1)) &&
22378 isAllOnes(Cond.getOperand(2)) &&
22379 isAllOnes(Cond.getOperand(3)));
22381 if (!CanFold && isAllOnes(Cond.getOperand(0)) &&
22382 isAllOnes(Cond.getOperand(1)) &&
22383 isZero(Cond.getOperand(2)) &&
22384 isZero(Cond.getOperand(3))) {
22386 std::swap(LHS, RHS);
22390 EVT NVT = (VT == MVT::v4i32) ? MVT::v2i64 : MVT::v2f64;
22391 SDValue NewA = DAG.getNode(ISD::BITCAST, DL, NVT, LHS);
22392 SDValue NewB = DAG.getNode(ISD::BITCAST, DL, NVT, RHS);
22393 SDValue Select = getTargetShuffleNode(X86ISD::MOVSD, DL, NVT, NewA,
22395 return DAG.getNode(ISD::BITCAST, DL, VT, Select);
22401 // If we know that this node is legal then we know that it is going to be
22402 // matched by one of the SSE/AVX BLEND instructions. These instructions only
22403 // depend on the highest bit in each word. Try to use SimplifyDemandedBits
22404 // to simplify previous instructions.
22405 if (N->getOpcode() == ISD::VSELECT && DCI.isBeforeLegalizeOps() &&
22406 !DCI.isBeforeLegalize() &&
22407 // We explicitly check against v8i16 and v16i16 because, although
22408 // they're marked as Custom, they might only be legal when Cond is a
22409 // build_vector of constants. This will be taken care in a later
22411 (TLI.isOperationLegalOrCustom(ISD::VSELECT, VT) && VT != MVT::v16i16 &&
22412 VT != MVT::v8i16)) {
22413 unsigned BitWidth = Cond.getValueType().getScalarType().getSizeInBits();
22415 // Don't optimize vector selects that map to mask-registers.
22419 // Check all uses of that condition operand to check whether it will be
22420 // consumed by non-BLEND instructions, which may depend on all bits are set
22422 for (SDNode::use_iterator I = Cond->use_begin(),
22423 E = Cond->use_end(); I != E; ++I)
22424 if (I->getOpcode() != ISD::VSELECT)
22425 // TODO: Add other opcodes eventually lowered into BLEND.
22428 assert(BitWidth >= 8 && BitWidth <= 64 && "Invalid mask size");
22429 APInt DemandedMask = APInt::getHighBitsSet(BitWidth, 1);
22431 APInt KnownZero, KnownOne;
22432 TargetLowering::TargetLoweringOpt TLO(DAG, DCI.isBeforeLegalize(),
22433 DCI.isBeforeLegalizeOps());
22434 if (TLO.ShrinkDemandedConstant(Cond, DemandedMask) ||
22435 TLI.SimplifyDemandedBits(Cond, DemandedMask, KnownZero, KnownOne, TLO))
22436 DCI.CommitTargetLoweringOpt(TLO);
22439 // We should generate an X86ISD::BLENDI from a vselect if its argument
22440 // is a sign_extend_inreg of an any_extend of a BUILD_VECTOR of
22441 // constants. This specific pattern gets generated when we split a
22442 // selector for a 512 bit vector in a machine without AVX512 (but with
22443 // 256-bit vectors), during legalization:
22445 // (vselect (sign_extend (any_extend (BUILD_VECTOR)) i1) LHS RHS)
22447 // Iff we find this pattern and the build_vectors are built from
22448 // constants, we translate the vselect into a shuffle_vector that we
22449 // know will be matched by LowerVECTOR_SHUFFLEtoBlend.
22450 if (N->getOpcode() == ISD::VSELECT && !DCI.isBeforeLegalize()) {
22451 SDValue Shuffle = TransformVSELECTtoBlendVECTOR_SHUFFLE(N, DAG, Subtarget);
22452 if (Shuffle.getNode())
22459 // Check whether a boolean test is testing a boolean value generated by
22460 // X86ISD::SETCC. If so, return the operand of that SETCC and proper condition
22463 // Simplify the following patterns:
22464 // (Op (CMP (SETCC Cond EFLAGS) 1) EQ) or
22465 // (Op (CMP (SETCC Cond EFLAGS) 0) NEQ)
22466 // to (Op EFLAGS Cond)
22468 // (Op (CMP (SETCC Cond EFLAGS) 0) EQ) or
22469 // (Op (CMP (SETCC Cond EFLAGS) 1) NEQ)
22470 // to (Op EFLAGS !Cond)
22472 // where Op could be BRCOND or CMOV.
22474 static SDValue checkBoolTestSetCCCombine(SDValue Cmp, X86::CondCode &CC) {
22475 // Quit if not CMP and SUB with its value result used.
22476 if (Cmp.getOpcode() != X86ISD::CMP &&
22477 (Cmp.getOpcode() != X86ISD::SUB || Cmp.getNode()->hasAnyUseOfValue(0)))
22480 // Quit if not used as a boolean value.
22481 if (CC != X86::COND_E && CC != X86::COND_NE)
22484 // Check CMP operands. One of them should be 0 or 1 and the other should be
22485 // an SetCC or extended from it.
22486 SDValue Op1 = Cmp.getOperand(0);
22487 SDValue Op2 = Cmp.getOperand(1);
22490 const ConstantSDNode* C = nullptr;
22491 bool needOppositeCond = (CC == X86::COND_E);
22492 bool checkAgainstTrue = false; // Is it a comparison against 1?
22494 if ((C = dyn_cast<ConstantSDNode>(Op1)))
22496 else if ((C = dyn_cast<ConstantSDNode>(Op2)))
22498 else // Quit if all operands are not constants.
22501 if (C->getZExtValue() == 1) {
22502 needOppositeCond = !needOppositeCond;
22503 checkAgainstTrue = true;
22504 } else if (C->getZExtValue() != 0)
22505 // Quit if the constant is neither 0 or 1.
22508 bool truncatedToBoolWithAnd = false;
22509 // Skip (zext $x), (trunc $x), or (and $x, 1) node.
22510 while (SetCC.getOpcode() == ISD::ZERO_EXTEND ||
22511 SetCC.getOpcode() == ISD::TRUNCATE ||
22512 SetCC.getOpcode() == ISD::AND) {
22513 if (SetCC.getOpcode() == ISD::AND) {
22515 ConstantSDNode *CS;
22516 if ((CS = dyn_cast<ConstantSDNode>(SetCC.getOperand(0))) &&
22517 CS->getZExtValue() == 1)
22519 if ((CS = dyn_cast<ConstantSDNode>(SetCC.getOperand(1))) &&
22520 CS->getZExtValue() == 1)
22524 SetCC = SetCC.getOperand(OpIdx);
22525 truncatedToBoolWithAnd = true;
22527 SetCC = SetCC.getOperand(0);
22530 switch (SetCC.getOpcode()) {
22531 case X86ISD::SETCC_CARRY:
22532 // Since SETCC_CARRY gives output based on R = CF ? ~0 : 0, it's unsafe to
22533 // simplify it if the result of SETCC_CARRY is not canonicalized to 0 or 1,
22534 // i.e. it's a comparison against true but the result of SETCC_CARRY is not
22535 // truncated to i1 using 'and'.
22536 if (checkAgainstTrue && !truncatedToBoolWithAnd)
22538 assert(X86::CondCode(SetCC.getConstantOperandVal(0)) == X86::COND_B &&
22539 "Invalid use of SETCC_CARRY!");
22541 case X86ISD::SETCC:
22542 // Set the condition code or opposite one if necessary.
22543 CC = X86::CondCode(SetCC.getConstantOperandVal(0));
22544 if (needOppositeCond)
22545 CC = X86::GetOppositeBranchCondition(CC);
22546 return SetCC.getOperand(1);
22547 case X86ISD::CMOV: {
22548 // Check whether false/true value has canonical one, i.e. 0 or 1.
22549 ConstantSDNode *FVal = dyn_cast<ConstantSDNode>(SetCC.getOperand(0));
22550 ConstantSDNode *TVal = dyn_cast<ConstantSDNode>(SetCC.getOperand(1));
22551 // Quit if true value is not a constant.
22554 // Quit if false value is not a constant.
22556 SDValue Op = SetCC.getOperand(0);
22557 // Skip 'zext' or 'trunc' node.
22558 if (Op.getOpcode() == ISD::ZERO_EXTEND ||
22559 Op.getOpcode() == ISD::TRUNCATE)
22560 Op = Op.getOperand(0);
22561 // A special case for rdrand/rdseed, where 0 is set if false cond is
22563 if ((Op.getOpcode() != X86ISD::RDRAND &&
22564 Op.getOpcode() != X86ISD::RDSEED) || Op.getResNo() != 0)
22567 // Quit if false value is not the constant 0 or 1.
22568 bool FValIsFalse = true;
22569 if (FVal && FVal->getZExtValue() != 0) {
22570 if (FVal->getZExtValue() != 1)
22572 // If FVal is 1, opposite cond is needed.
22573 needOppositeCond = !needOppositeCond;
22574 FValIsFalse = false;
22576 // Quit if TVal is not the constant opposite of FVal.
22577 if (FValIsFalse && TVal->getZExtValue() != 1)
22579 if (!FValIsFalse && TVal->getZExtValue() != 0)
22581 CC = X86::CondCode(SetCC.getConstantOperandVal(2));
22582 if (needOppositeCond)
22583 CC = X86::GetOppositeBranchCondition(CC);
22584 return SetCC.getOperand(3);
22591 /// Optimize X86ISD::CMOV [LHS, RHS, CONDCODE (e.g. X86::COND_NE), CONDVAL]
22592 static SDValue PerformCMOVCombine(SDNode *N, SelectionDAG &DAG,
22593 TargetLowering::DAGCombinerInfo &DCI,
22594 const X86Subtarget *Subtarget) {
22597 // If the flag operand isn't dead, don't touch this CMOV.
22598 if (N->getNumValues() == 2 && !SDValue(N, 1).use_empty())
22601 SDValue FalseOp = N->getOperand(0);
22602 SDValue TrueOp = N->getOperand(1);
22603 X86::CondCode CC = (X86::CondCode)N->getConstantOperandVal(2);
22604 SDValue Cond = N->getOperand(3);
22606 if (CC == X86::COND_E || CC == X86::COND_NE) {
22607 switch (Cond.getOpcode()) {
22611 // If operand of BSR / BSF are proven never zero, then ZF cannot be set.
22612 if (DAG.isKnownNeverZero(Cond.getOperand(0)))
22613 return (CC == X86::COND_E) ? FalseOp : TrueOp;
22619 Flags = checkBoolTestSetCCCombine(Cond, CC);
22620 if (Flags.getNode() &&
22621 // Extra check as FCMOV only supports a subset of X86 cond.
22622 (FalseOp.getValueType() != MVT::f80 || hasFPCMov(CC))) {
22623 SDValue Ops[] = { FalseOp, TrueOp,
22624 DAG.getConstant(CC, MVT::i8), Flags };
22625 return DAG.getNode(X86ISD::CMOV, DL, N->getVTList(), Ops);
22628 // If this is a select between two integer constants, try to do some
22629 // optimizations. Note that the operands are ordered the opposite of SELECT
22631 if (ConstantSDNode *TrueC = dyn_cast<ConstantSDNode>(TrueOp)) {
22632 if (ConstantSDNode *FalseC = dyn_cast<ConstantSDNode>(FalseOp)) {
22633 // Canonicalize the TrueC/FalseC values so that TrueC (the true value) is
22634 // larger than FalseC (the false value).
22635 if (TrueC->getAPIntValue().ult(FalseC->getAPIntValue())) {
22636 CC = X86::GetOppositeBranchCondition(CC);
22637 std::swap(TrueC, FalseC);
22638 std::swap(TrueOp, FalseOp);
22641 // Optimize C ? 8 : 0 -> zext(setcc(C)) << 3. Likewise for any pow2/0.
22642 // This is efficient for any integer data type (including i8/i16) and
22644 if (FalseC->getAPIntValue() == 0 && TrueC->getAPIntValue().isPowerOf2()) {
22645 Cond = DAG.getNode(X86ISD::SETCC, DL, MVT::i8,
22646 DAG.getConstant(CC, MVT::i8), Cond);
22648 // Zero extend the condition if needed.
22649 Cond = DAG.getNode(ISD::ZERO_EXTEND, DL, TrueC->getValueType(0), Cond);
22651 unsigned ShAmt = TrueC->getAPIntValue().logBase2();
22652 Cond = DAG.getNode(ISD::SHL, DL, Cond.getValueType(), Cond,
22653 DAG.getConstant(ShAmt, MVT::i8));
22654 if (N->getNumValues() == 2) // Dead flag value?
22655 return DCI.CombineTo(N, Cond, SDValue());
22659 // Optimize Cond ? cst+1 : cst -> zext(setcc(C)+cst. This is efficient
22660 // for any integer data type, including i8/i16.
22661 if (FalseC->getAPIntValue()+1 == TrueC->getAPIntValue()) {
22662 Cond = DAG.getNode(X86ISD::SETCC, DL, MVT::i8,
22663 DAG.getConstant(CC, MVT::i8), Cond);
22665 // Zero extend the condition if needed.
22666 Cond = DAG.getNode(ISD::ZERO_EXTEND, DL,
22667 FalseC->getValueType(0), Cond);
22668 Cond = DAG.getNode(ISD::ADD, DL, Cond.getValueType(), Cond,
22669 SDValue(FalseC, 0));
22671 if (N->getNumValues() == 2) // Dead flag value?
22672 return DCI.CombineTo(N, Cond, SDValue());
22676 // Optimize cases that will turn into an LEA instruction. This requires
22677 // an i32 or i64 and an efficient multiplier (1, 2, 3, 4, 5, 8, 9).
22678 if (N->getValueType(0) == MVT::i32 || N->getValueType(0) == MVT::i64) {
22679 uint64_t Diff = TrueC->getZExtValue()-FalseC->getZExtValue();
22680 if (N->getValueType(0) == MVT::i32) Diff = (unsigned)Diff;
22682 bool isFastMultiplier = false;
22684 switch ((unsigned char)Diff) {
22686 case 1: // result = add base, cond
22687 case 2: // result = lea base( , cond*2)
22688 case 3: // result = lea base(cond, cond*2)
22689 case 4: // result = lea base( , cond*4)
22690 case 5: // result = lea base(cond, cond*4)
22691 case 8: // result = lea base( , cond*8)
22692 case 9: // result = lea base(cond, cond*8)
22693 isFastMultiplier = true;
22698 if (isFastMultiplier) {
22699 APInt Diff = TrueC->getAPIntValue()-FalseC->getAPIntValue();
22700 Cond = DAG.getNode(X86ISD::SETCC, DL, MVT::i8,
22701 DAG.getConstant(CC, MVT::i8), Cond);
22702 // Zero extend the condition if needed.
22703 Cond = DAG.getNode(ISD::ZERO_EXTEND, DL, FalseC->getValueType(0),
22705 // Scale the condition by the difference.
22707 Cond = DAG.getNode(ISD::MUL, DL, Cond.getValueType(), Cond,
22708 DAG.getConstant(Diff, Cond.getValueType()));
22710 // Add the base if non-zero.
22711 if (FalseC->getAPIntValue() != 0)
22712 Cond = DAG.getNode(ISD::ADD, DL, Cond.getValueType(), Cond,
22713 SDValue(FalseC, 0));
22714 if (N->getNumValues() == 2) // Dead flag value?
22715 return DCI.CombineTo(N, Cond, SDValue());
22722 // Handle these cases:
22723 // (select (x != c), e, c) -> select (x != c), e, x),
22724 // (select (x == c), c, e) -> select (x == c), x, e)
22725 // where the c is an integer constant, and the "select" is the combination
22726 // of CMOV and CMP.
22728 // The rationale for this change is that the conditional-move from a constant
22729 // needs two instructions, however, conditional-move from a register needs
22730 // only one instruction.
22732 // CAVEAT: By replacing a constant with a symbolic value, it may obscure
22733 // some instruction-combining opportunities. This opt needs to be
22734 // postponed as late as possible.
22736 if (!DCI.isBeforeLegalize() && !DCI.isBeforeLegalizeOps()) {
22737 // the DCI.xxxx conditions are provided to postpone the optimization as
22738 // late as possible.
22740 ConstantSDNode *CmpAgainst = nullptr;
22741 if ((Cond.getOpcode() == X86ISD::CMP || Cond.getOpcode() == X86ISD::SUB) &&
22742 (CmpAgainst = dyn_cast<ConstantSDNode>(Cond.getOperand(1))) &&
22743 !isa<ConstantSDNode>(Cond.getOperand(0))) {
22745 if (CC == X86::COND_NE &&
22746 CmpAgainst == dyn_cast<ConstantSDNode>(FalseOp)) {
22747 CC = X86::GetOppositeBranchCondition(CC);
22748 std::swap(TrueOp, FalseOp);
22751 if (CC == X86::COND_E &&
22752 CmpAgainst == dyn_cast<ConstantSDNode>(TrueOp)) {
22753 SDValue Ops[] = { FalseOp, Cond.getOperand(0),
22754 DAG.getConstant(CC, MVT::i8), Cond };
22755 return DAG.getNode(X86ISD::CMOV, DL, N->getVTList (), Ops);
22763 static SDValue PerformINTRINSIC_WO_CHAINCombine(SDNode *N, SelectionDAG &DAG,
22764 const X86Subtarget *Subtarget) {
22765 unsigned IntNo = cast<ConstantSDNode>(N->getOperand(0))->getZExtValue();
22767 default: return SDValue();
22768 // SSE/AVX/AVX2 blend intrinsics.
22769 case Intrinsic::x86_avx2_pblendvb:
22770 case Intrinsic::x86_avx2_pblendw:
22771 case Intrinsic::x86_avx2_pblendd_128:
22772 case Intrinsic::x86_avx2_pblendd_256:
22773 // Don't try to simplify this intrinsic if we don't have AVX2.
22774 if (!Subtarget->hasAVX2())
22777 case Intrinsic::x86_avx_blend_pd_256:
22778 case Intrinsic::x86_avx_blend_ps_256:
22779 case Intrinsic::x86_avx_blendv_pd_256:
22780 case Intrinsic::x86_avx_blendv_ps_256:
22781 // Don't try to simplify this intrinsic if we don't have AVX.
22782 if (!Subtarget->hasAVX())
22785 case Intrinsic::x86_sse41_pblendw:
22786 case Intrinsic::x86_sse41_blendpd:
22787 case Intrinsic::x86_sse41_blendps:
22788 case Intrinsic::x86_sse41_blendvps:
22789 case Intrinsic::x86_sse41_blendvpd:
22790 case Intrinsic::x86_sse41_pblendvb: {
22791 SDValue Op0 = N->getOperand(1);
22792 SDValue Op1 = N->getOperand(2);
22793 SDValue Mask = N->getOperand(3);
22795 // Don't try to simplify this intrinsic if we don't have SSE4.1.
22796 if (!Subtarget->hasSSE41())
22799 // fold (blend A, A, Mask) -> A
22802 // fold (blend A, B, allZeros) -> A
22803 if (ISD::isBuildVectorAllZeros(Mask.getNode()))
22805 // fold (blend A, B, allOnes) -> B
22806 if (ISD::isBuildVectorAllOnes(Mask.getNode()))
22809 // Simplify the case where the mask is a constant i32 value.
22810 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Mask)) {
22811 if (C->isNullValue())
22813 if (C->isAllOnesValue())
22820 // Packed SSE2/AVX2 arithmetic shift immediate intrinsics.
22821 case Intrinsic::x86_sse2_psrai_w:
22822 case Intrinsic::x86_sse2_psrai_d:
22823 case Intrinsic::x86_avx2_psrai_w:
22824 case Intrinsic::x86_avx2_psrai_d:
22825 case Intrinsic::x86_sse2_psra_w:
22826 case Intrinsic::x86_sse2_psra_d:
22827 case Intrinsic::x86_avx2_psra_w:
22828 case Intrinsic::x86_avx2_psra_d: {
22829 SDValue Op0 = N->getOperand(1);
22830 SDValue Op1 = N->getOperand(2);
22831 EVT VT = Op0.getValueType();
22832 assert(VT.isVector() && "Expected a vector type!");
22834 if (isa<BuildVectorSDNode>(Op1))
22835 Op1 = Op1.getOperand(0);
22837 if (!isa<ConstantSDNode>(Op1))
22840 EVT SVT = VT.getVectorElementType();
22841 unsigned SVTBits = SVT.getSizeInBits();
22843 ConstantSDNode *CND = cast<ConstantSDNode>(Op1);
22844 const APInt &C = APInt(SVTBits, CND->getAPIntValue().getZExtValue());
22845 uint64_t ShAmt = C.getZExtValue();
22847 // Don't try to convert this shift into a ISD::SRA if the shift
22848 // count is bigger than or equal to the element size.
22849 if (ShAmt >= SVTBits)
22852 // Trivial case: if the shift count is zero, then fold this
22853 // into the first operand.
22857 // Replace this packed shift intrinsic with a target independent
22859 SDValue Splat = DAG.getConstant(C, VT);
22860 return DAG.getNode(ISD::SRA, SDLoc(N), VT, Op0, Splat);
22865 /// PerformMulCombine - Optimize a single multiply with constant into two
22866 /// in order to implement it with two cheaper instructions, e.g.
22867 /// LEA + SHL, LEA + LEA.
22868 static SDValue PerformMulCombine(SDNode *N, SelectionDAG &DAG,
22869 TargetLowering::DAGCombinerInfo &DCI) {
22870 if (DCI.isBeforeLegalize() || DCI.isCalledByLegalizer())
22873 EVT VT = N->getValueType(0);
22874 if (VT != MVT::i64)
22877 ConstantSDNode *C = dyn_cast<ConstantSDNode>(N->getOperand(1));
22880 uint64_t MulAmt = C->getZExtValue();
22881 if (isPowerOf2_64(MulAmt) || MulAmt == 3 || MulAmt == 5 || MulAmt == 9)
22884 uint64_t MulAmt1 = 0;
22885 uint64_t MulAmt2 = 0;
22886 if ((MulAmt % 9) == 0) {
22888 MulAmt2 = MulAmt / 9;
22889 } else if ((MulAmt % 5) == 0) {
22891 MulAmt2 = MulAmt / 5;
22892 } else if ((MulAmt % 3) == 0) {
22894 MulAmt2 = MulAmt / 3;
22897 (isPowerOf2_64(MulAmt2) || MulAmt2 == 3 || MulAmt2 == 5 || MulAmt2 == 9)){
22900 if (isPowerOf2_64(MulAmt2) &&
22901 !(N->hasOneUse() && N->use_begin()->getOpcode() == ISD::ADD))
22902 // If second multiplifer is pow2, issue it first. We want the multiply by
22903 // 3, 5, or 9 to be folded into the addressing mode unless the lone use
22905 std::swap(MulAmt1, MulAmt2);
22908 if (isPowerOf2_64(MulAmt1))
22909 NewMul = DAG.getNode(ISD::SHL, DL, VT, N->getOperand(0),
22910 DAG.getConstant(Log2_64(MulAmt1), MVT::i8));
22912 NewMul = DAG.getNode(X86ISD::MUL_IMM, DL, VT, N->getOperand(0),
22913 DAG.getConstant(MulAmt1, VT));
22915 if (isPowerOf2_64(MulAmt2))
22916 NewMul = DAG.getNode(ISD::SHL, DL, VT, NewMul,
22917 DAG.getConstant(Log2_64(MulAmt2), MVT::i8));
22919 NewMul = DAG.getNode(X86ISD::MUL_IMM, DL, VT, NewMul,
22920 DAG.getConstant(MulAmt2, VT));
22922 // Do not add new nodes to DAG combiner worklist.
22923 DCI.CombineTo(N, NewMul, false);
22928 static SDValue PerformSHLCombine(SDNode *N, SelectionDAG &DAG) {
22929 SDValue N0 = N->getOperand(0);
22930 SDValue N1 = N->getOperand(1);
22931 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1);
22932 EVT VT = N0.getValueType();
22934 // fold (shl (and (setcc_c), c1), c2) -> (and setcc_c, (c1 << c2))
22935 // since the result of setcc_c is all zero's or all ones.
22936 if (VT.isInteger() && !VT.isVector() &&
22937 N1C && N0.getOpcode() == ISD::AND &&
22938 N0.getOperand(1).getOpcode() == ISD::Constant) {
22939 SDValue N00 = N0.getOperand(0);
22940 if (N00.getOpcode() == X86ISD::SETCC_CARRY ||
22941 ((N00.getOpcode() == ISD::ANY_EXTEND ||
22942 N00.getOpcode() == ISD::ZERO_EXTEND) &&
22943 N00.getOperand(0).getOpcode() == X86ISD::SETCC_CARRY)) {
22944 APInt Mask = cast<ConstantSDNode>(N0.getOperand(1))->getAPIntValue();
22945 APInt ShAmt = N1C->getAPIntValue();
22946 Mask = Mask.shl(ShAmt);
22948 return DAG.getNode(ISD::AND, SDLoc(N), VT,
22949 N00, DAG.getConstant(Mask, VT));
22953 // Hardware support for vector shifts is sparse which makes us scalarize the
22954 // vector operations in many cases. Also, on sandybridge ADD is faster than
22956 // (shl V, 1) -> add V,V
22957 if (auto *N1BV = dyn_cast<BuildVectorSDNode>(N1))
22958 if (auto *N1SplatC = N1BV->getConstantSplatNode()) {
22959 assert(N0.getValueType().isVector() && "Invalid vector shift type");
22960 // We shift all of the values by one. In many cases we do not have
22961 // hardware support for this operation. This is better expressed as an ADD
22963 if (N1SplatC->getZExtValue() == 1)
22964 return DAG.getNode(ISD::ADD, SDLoc(N), VT, N0, N0);
22970 /// \brief Returns a vector of 0s if the node in input is a vector logical
22971 /// shift by a constant amount which is known to be bigger than or equal
22972 /// to the vector element size in bits.
22973 static SDValue performShiftToAllZeros(SDNode *N, SelectionDAG &DAG,
22974 const X86Subtarget *Subtarget) {
22975 EVT VT = N->getValueType(0);
22977 if (VT != MVT::v2i64 && VT != MVT::v4i32 && VT != MVT::v8i16 &&
22978 (!Subtarget->hasInt256() ||
22979 (VT != MVT::v4i64 && VT != MVT::v8i32 && VT != MVT::v16i16)))
22982 SDValue Amt = N->getOperand(1);
22984 if (auto *AmtBV = dyn_cast<BuildVectorSDNode>(Amt))
22985 if (auto *AmtSplat = AmtBV->getConstantSplatNode()) {
22986 APInt ShiftAmt = AmtSplat->getAPIntValue();
22987 unsigned MaxAmount = VT.getVectorElementType().getSizeInBits();
22989 // SSE2/AVX2 logical shifts always return a vector of 0s
22990 // if the shift amount is bigger than or equal to
22991 // the element size. The constant shift amount will be
22992 // encoded as a 8-bit immediate.
22993 if (ShiftAmt.trunc(8).uge(MaxAmount))
22994 return getZeroVector(VT, Subtarget, DAG, DL);
23000 /// PerformShiftCombine - Combine shifts.
23001 static SDValue PerformShiftCombine(SDNode* N, SelectionDAG &DAG,
23002 TargetLowering::DAGCombinerInfo &DCI,
23003 const X86Subtarget *Subtarget) {
23004 if (N->getOpcode() == ISD::SHL) {
23005 SDValue V = PerformSHLCombine(N, DAG);
23006 if (V.getNode()) return V;
23009 if (N->getOpcode() != ISD::SRA) {
23010 // Try to fold this logical shift into a zero vector.
23011 SDValue V = performShiftToAllZeros(N, DAG, Subtarget);
23012 if (V.getNode()) return V;
23018 // CMPEQCombine - Recognize the distinctive (AND (setcc ...) (setcc ..))
23019 // where both setccs reference the same FP CMP, and rewrite for CMPEQSS
23020 // and friends. Likewise for OR -> CMPNEQSS.
23021 static SDValue CMPEQCombine(SDNode *N, SelectionDAG &DAG,
23022 TargetLowering::DAGCombinerInfo &DCI,
23023 const X86Subtarget *Subtarget) {
23026 // SSE1 supports CMP{eq|ne}SS, and SSE2 added CMP{eq|ne}SD, but
23027 // we're requiring SSE2 for both.
23028 if (Subtarget->hasSSE2() && isAndOrOfSetCCs(SDValue(N, 0U), opcode)) {
23029 SDValue N0 = N->getOperand(0);
23030 SDValue N1 = N->getOperand(1);
23031 SDValue CMP0 = N0->getOperand(1);
23032 SDValue CMP1 = N1->getOperand(1);
23035 // The SETCCs should both refer to the same CMP.
23036 if (CMP0.getOpcode() != X86ISD::CMP || CMP0 != CMP1)
23039 SDValue CMP00 = CMP0->getOperand(0);
23040 SDValue CMP01 = CMP0->getOperand(1);
23041 EVT VT = CMP00.getValueType();
23043 if (VT == MVT::f32 || VT == MVT::f64) {
23044 bool ExpectingFlags = false;
23045 // Check for any users that want flags:
23046 for (SDNode::use_iterator UI = N->use_begin(), UE = N->use_end();
23047 !ExpectingFlags && UI != UE; ++UI)
23048 switch (UI->getOpcode()) {
23053 ExpectingFlags = true;
23055 case ISD::CopyToReg:
23056 case ISD::SIGN_EXTEND:
23057 case ISD::ZERO_EXTEND:
23058 case ISD::ANY_EXTEND:
23062 if (!ExpectingFlags) {
23063 enum X86::CondCode cc0 = (enum X86::CondCode)N0.getConstantOperandVal(0);
23064 enum X86::CondCode cc1 = (enum X86::CondCode)N1.getConstantOperandVal(0);
23066 if (cc1 == X86::COND_E || cc1 == X86::COND_NE) {
23067 X86::CondCode tmp = cc0;
23072 if ((cc0 == X86::COND_E && cc1 == X86::COND_NP) ||
23073 (cc0 == X86::COND_NE && cc1 == X86::COND_P)) {
23074 // FIXME: need symbolic constants for these magic numbers.
23075 // See X86ATTInstPrinter.cpp:printSSECC().
23076 unsigned x86cc = (cc0 == X86::COND_E) ? 0 : 4;
23077 if (Subtarget->hasAVX512()) {
23078 SDValue FSetCC = DAG.getNode(X86ISD::FSETCC, DL, MVT::i1, CMP00,
23079 CMP01, DAG.getConstant(x86cc, MVT::i8));
23080 if (N->getValueType(0) != MVT::i1)
23081 return DAG.getNode(ISD::ZERO_EXTEND, DL, N->getValueType(0),
23085 SDValue OnesOrZeroesF = DAG.getNode(X86ISD::FSETCC, DL,
23086 CMP00.getValueType(), CMP00, CMP01,
23087 DAG.getConstant(x86cc, MVT::i8));
23089 bool is64BitFP = (CMP00.getValueType() == MVT::f64);
23090 MVT IntVT = is64BitFP ? MVT::i64 : MVT::i32;
23092 if (is64BitFP && !Subtarget->is64Bit()) {
23093 // On a 32-bit target, we cannot bitcast the 64-bit float to a
23094 // 64-bit integer, since that's not a legal type. Since
23095 // OnesOrZeroesF is all ones of all zeroes, we don't need all the
23096 // bits, but can do this little dance to extract the lowest 32 bits
23097 // and work with those going forward.
23098 SDValue Vector64 = DAG.getNode(ISD::SCALAR_TO_VECTOR, DL, MVT::v2f64,
23100 SDValue Vector32 = DAG.getNode(ISD::BITCAST, DL, MVT::v4f32,
23102 OnesOrZeroesF = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, DL, MVT::f32,
23103 Vector32, DAG.getIntPtrConstant(0));
23107 SDValue OnesOrZeroesI = DAG.getNode(ISD::BITCAST, DL, IntVT, OnesOrZeroesF);
23108 SDValue ANDed = DAG.getNode(ISD::AND, DL, IntVT, OnesOrZeroesI,
23109 DAG.getConstant(1, IntVT));
23110 SDValue OneBitOfTruth = DAG.getNode(ISD::TRUNCATE, DL, MVT::i8, ANDed);
23111 return OneBitOfTruth;
23119 /// CanFoldXORWithAllOnes - Test whether the XOR operand is a AllOnes vector
23120 /// so it can be folded inside ANDNP.
23121 static bool CanFoldXORWithAllOnes(const SDNode *N) {
23122 EVT VT = N->getValueType(0);
23124 // Match direct AllOnes for 128 and 256-bit vectors
23125 if (ISD::isBuildVectorAllOnes(N))
23128 // Look through a bit convert.
23129 if (N->getOpcode() == ISD::BITCAST)
23130 N = N->getOperand(0).getNode();
23132 // Sometimes the operand may come from a insert_subvector building a 256-bit
23134 if (VT.is256BitVector() &&
23135 N->getOpcode() == ISD::INSERT_SUBVECTOR) {
23136 SDValue V1 = N->getOperand(0);
23137 SDValue V2 = N->getOperand(1);
23139 if (V1.getOpcode() == ISD::INSERT_SUBVECTOR &&
23140 V1.getOperand(0).getOpcode() == ISD::UNDEF &&
23141 ISD::isBuildVectorAllOnes(V1.getOperand(1).getNode()) &&
23142 ISD::isBuildVectorAllOnes(V2.getNode()))
23149 // On AVX/AVX2 the type v8i1 is legalized to v8i16, which is an XMM sized
23150 // register. In most cases we actually compare or select YMM-sized registers
23151 // and mixing the two types creates horrible code. This method optimizes
23152 // some of the transition sequences.
23153 static SDValue WidenMaskArithmetic(SDNode *N, SelectionDAG &DAG,
23154 TargetLowering::DAGCombinerInfo &DCI,
23155 const X86Subtarget *Subtarget) {
23156 EVT VT = N->getValueType(0);
23157 if (!VT.is256BitVector())
23160 assert((N->getOpcode() == ISD::ANY_EXTEND ||
23161 N->getOpcode() == ISD::ZERO_EXTEND ||
23162 N->getOpcode() == ISD::SIGN_EXTEND) && "Invalid Node");
23164 SDValue Narrow = N->getOperand(0);
23165 EVT NarrowVT = Narrow->getValueType(0);
23166 if (!NarrowVT.is128BitVector())
23169 if (Narrow->getOpcode() != ISD::XOR &&
23170 Narrow->getOpcode() != ISD::AND &&
23171 Narrow->getOpcode() != ISD::OR)
23174 SDValue N0 = Narrow->getOperand(0);
23175 SDValue N1 = Narrow->getOperand(1);
23178 // The Left side has to be a trunc.
23179 if (N0.getOpcode() != ISD::TRUNCATE)
23182 // The type of the truncated inputs.
23183 EVT WideVT = N0->getOperand(0)->getValueType(0);
23187 // The right side has to be a 'trunc' or a constant vector.
23188 bool RHSTrunc = N1.getOpcode() == ISD::TRUNCATE;
23189 ConstantSDNode *RHSConstSplat = nullptr;
23190 if (auto *RHSBV = dyn_cast<BuildVectorSDNode>(N1))
23191 RHSConstSplat = RHSBV->getConstantSplatNode();
23192 if (!RHSTrunc && !RHSConstSplat)
23195 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
23197 if (!TLI.isOperationLegalOrPromote(Narrow->getOpcode(), WideVT))
23200 // Set N0 and N1 to hold the inputs to the new wide operation.
23201 N0 = N0->getOperand(0);
23202 if (RHSConstSplat) {
23203 N1 = DAG.getNode(ISD::ZERO_EXTEND, DL, WideVT.getScalarType(),
23204 SDValue(RHSConstSplat, 0));
23205 SmallVector<SDValue, 8> C(WideVT.getVectorNumElements(), N1);
23206 N1 = DAG.getNode(ISD::BUILD_VECTOR, DL, WideVT, C);
23207 } else if (RHSTrunc) {
23208 N1 = N1->getOperand(0);
23211 // Generate the wide operation.
23212 SDValue Op = DAG.getNode(Narrow->getOpcode(), DL, WideVT, N0, N1);
23213 unsigned Opcode = N->getOpcode();
23215 case ISD::ANY_EXTEND:
23217 case ISD::ZERO_EXTEND: {
23218 unsigned InBits = NarrowVT.getScalarType().getSizeInBits();
23219 APInt Mask = APInt::getAllOnesValue(InBits);
23220 Mask = Mask.zext(VT.getScalarType().getSizeInBits());
23221 return DAG.getNode(ISD::AND, DL, VT,
23222 Op, DAG.getConstant(Mask, VT));
23224 case ISD::SIGN_EXTEND:
23225 return DAG.getNode(ISD::SIGN_EXTEND_INREG, DL, VT,
23226 Op, DAG.getValueType(NarrowVT));
23228 llvm_unreachable("Unexpected opcode");
23232 static SDValue PerformAndCombine(SDNode *N, SelectionDAG &DAG,
23233 TargetLowering::DAGCombinerInfo &DCI,
23234 const X86Subtarget *Subtarget) {
23235 EVT VT = N->getValueType(0);
23236 if (DCI.isBeforeLegalizeOps())
23239 SDValue R = CMPEQCombine(N, DAG, DCI, Subtarget);
23243 // Create BEXTR instructions
23244 // BEXTR is ((X >> imm) & (2**size-1))
23245 if (VT == MVT::i32 || VT == MVT::i64) {
23246 SDValue N0 = N->getOperand(0);
23247 SDValue N1 = N->getOperand(1);
23250 // Check for BEXTR.
23251 if ((Subtarget->hasBMI() || Subtarget->hasTBM()) &&
23252 (N0.getOpcode() == ISD::SRA || N0.getOpcode() == ISD::SRL)) {
23253 ConstantSDNode *MaskNode = dyn_cast<ConstantSDNode>(N1);
23254 ConstantSDNode *ShiftNode = dyn_cast<ConstantSDNode>(N0.getOperand(1));
23255 if (MaskNode && ShiftNode) {
23256 uint64_t Mask = MaskNode->getZExtValue();
23257 uint64_t Shift = ShiftNode->getZExtValue();
23258 if (isMask_64(Mask)) {
23259 uint64_t MaskSize = CountPopulation_64(Mask);
23260 if (Shift + MaskSize <= VT.getSizeInBits())
23261 return DAG.getNode(X86ISD::BEXTR, DL, VT, N0.getOperand(0),
23262 DAG.getConstant(Shift | (MaskSize << 8), VT));
23270 // Want to form ANDNP nodes:
23271 // 1) In the hopes of then easily combining them with OR and AND nodes
23272 // to form PBLEND/PSIGN.
23273 // 2) To match ANDN packed intrinsics
23274 if (VT != MVT::v2i64 && VT != MVT::v4i64)
23277 SDValue N0 = N->getOperand(0);
23278 SDValue N1 = N->getOperand(1);
23281 // Check LHS for vnot
23282 if (N0.getOpcode() == ISD::XOR &&
23283 //ISD::isBuildVectorAllOnes(N0.getOperand(1).getNode()))
23284 CanFoldXORWithAllOnes(N0.getOperand(1).getNode()))
23285 return DAG.getNode(X86ISD::ANDNP, DL, VT, N0.getOperand(0), N1);
23287 // Check RHS for vnot
23288 if (N1.getOpcode() == ISD::XOR &&
23289 //ISD::isBuildVectorAllOnes(N1.getOperand(1).getNode()))
23290 CanFoldXORWithAllOnes(N1.getOperand(1).getNode()))
23291 return DAG.getNode(X86ISD::ANDNP, DL, VT, N1.getOperand(0), N0);
23296 static SDValue PerformOrCombine(SDNode *N, SelectionDAG &DAG,
23297 TargetLowering::DAGCombinerInfo &DCI,
23298 const X86Subtarget *Subtarget) {
23299 if (DCI.isBeforeLegalizeOps())
23302 SDValue R = CMPEQCombine(N, DAG, DCI, Subtarget);
23306 SDValue N0 = N->getOperand(0);
23307 SDValue N1 = N->getOperand(1);
23308 EVT VT = N->getValueType(0);
23310 // look for psign/blend
23311 if (VT == MVT::v2i64 || VT == MVT::v4i64) {
23312 if (!Subtarget->hasSSSE3() ||
23313 (VT == MVT::v4i64 && !Subtarget->hasInt256()))
23316 // Canonicalize pandn to RHS
23317 if (N0.getOpcode() == X86ISD::ANDNP)
23319 // or (and (m, y), (pandn m, x))
23320 if (N0.getOpcode() == ISD::AND && N1.getOpcode() == X86ISD::ANDNP) {
23321 SDValue Mask = N1.getOperand(0);
23322 SDValue X = N1.getOperand(1);
23324 if (N0.getOperand(0) == Mask)
23325 Y = N0.getOperand(1);
23326 if (N0.getOperand(1) == Mask)
23327 Y = N0.getOperand(0);
23329 // Check to see if the mask appeared in both the AND and ANDNP and
23333 // Validate that X, Y, and Mask are BIT_CONVERTS, and see through them.
23334 // Look through mask bitcast.
23335 if (Mask.getOpcode() == ISD::BITCAST)
23336 Mask = Mask.getOperand(0);
23337 if (X.getOpcode() == ISD::BITCAST)
23338 X = X.getOperand(0);
23339 if (Y.getOpcode() == ISD::BITCAST)
23340 Y = Y.getOperand(0);
23342 EVT MaskVT = Mask.getValueType();
23344 // Validate that the Mask operand is a vector sra node.
23345 // FIXME: what to do for bytes, since there is a psignb/pblendvb, but
23346 // there is no psrai.b
23347 unsigned EltBits = MaskVT.getVectorElementType().getSizeInBits();
23348 unsigned SraAmt = ~0;
23349 if (Mask.getOpcode() == ISD::SRA) {
23350 if (auto *AmtBV = dyn_cast<BuildVectorSDNode>(Mask.getOperand(1)))
23351 if (auto *AmtConst = AmtBV->getConstantSplatNode())
23352 SraAmt = AmtConst->getZExtValue();
23353 } else if (Mask.getOpcode() == X86ISD::VSRAI) {
23354 SDValue SraC = Mask.getOperand(1);
23355 SraAmt = cast<ConstantSDNode>(SraC)->getZExtValue();
23357 if ((SraAmt + 1) != EltBits)
23362 // Now we know we at least have a plendvb with the mask val. See if
23363 // we can form a psignb/w/d.
23364 // psign = x.type == y.type == mask.type && y = sub(0, x);
23365 if (Y.getOpcode() == ISD::SUB && Y.getOperand(1) == X &&
23366 ISD::isBuildVectorAllZeros(Y.getOperand(0).getNode()) &&
23367 X.getValueType() == MaskVT && Y.getValueType() == MaskVT) {
23368 assert((EltBits == 8 || EltBits == 16 || EltBits == 32) &&
23369 "Unsupported VT for PSIGN");
23370 Mask = DAG.getNode(X86ISD::PSIGN, DL, MaskVT, X, Mask.getOperand(0));
23371 return DAG.getNode(ISD::BITCAST, DL, VT, Mask);
23373 // PBLENDVB only available on SSE 4.1
23374 if (!Subtarget->hasSSE41())
23377 EVT BlendVT = (VT == MVT::v4i64) ? MVT::v32i8 : MVT::v16i8;
23379 X = DAG.getNode(ISD::BITCAST, DL, BlendVT, X);
23380 Y = DAG.getNode(ISD::BITCAST, DL, BlendVT, Y);
23381 Mask = DAG.getNode(ISD::BITCAST, DL, BlendVT, Mask);
23382 Mask = DAG.getNode(ISD::VSELECT, DL, BlendVT, Mask, Y, X);
23383 return DAG.getNode(ISD::BITCAST, DL, VT, Mask);
23387 if (VT != MVT::i16 && VT != MVT::i32 && VT != MVT::i64)
23390 // fold (or (x << c) | (y >> (64 - c))) ==> (shld64 x, y, c)
23391 MachineFunction &MF = DAG.getMachineFunction();
23392 bool OptForSize = MF.getFunction()->getAttributes().
23393 hasAttribute(AttributeSet::FunctionIndex, Attribute::OptimizeForSize);
23395 // SHLD/SHRD instructions have lower register pressure, but on some
23396 // platforms they have higher latency than the equivalent
23397 // series of shifts/or that would otherwise be generated.
23398 // Don't fold (or (x << c) | (y >> (64 - c))) if SHLD/SHRD instructions
23399 // have higher latencies and we are not optimizing for size.
23400 if (!OptForSize && Subtarget->isSHLDSlow())
23403 if (N0.getOpcode() == ISD::SRL && N1.getOpcode() == ISD::SHL)
23405 if (N0.getOpcode() != ISD::SHL || N1.getOpcode() != ISD::SRL)
23407 if (!N0.hasOneUse() || !N1.hasOneUse())
23410 SDValue ShAmt0 = N0.getOperand(1);
23411 if (ShAmt0.getValueType() != MVT::i8)
23413 SDValue ShAmt1 = N1.getOperand(1);
23414 if (ShAmt1.getValueType() != MVT::i8)
23416 if (ShAmt0.getOpcode() == ISD::TRUNCATE)
23417 ShAmt0 = ShAmt0.getOperand(0);
23418 if (ShAmt1.getOpcode() == ISD::TRUNCATE)
23419 ShAmt1 = ShAmt1.getOperand(0);
23422 unsigned Opc = X86ISD::SHLD;
23423 SDValue Op0 = N0.getOperand(0);
23424 SDValue Op1 = N1.getOperand(0);
23425 if (ShAmt0.getOpcode() == ISD::SUB) {
23426 Opc = X86ISD::SHRD;
23427 std::swap(Op0, Op1);
23428 std::swap(ShAmt0, ShAmt1);
23431 unsigned Bits = VT.getSizeInBits();
23432 if (ShAmt1.getOpcode() == ISD::SUB) {
23433 SDValue Sum = ShAmt1.getOperand(0);
23434 if (ConstantSDNode *SumC = dyn_cast<ConstantSDNode>(Sum)) {
23435 SDValue ShAmt1Op1 = ShAmt1.getOperand(1);
23436 if (ShAmt1Op1.getNode()->getOpcode() == ISD::TRUNCATE)
23437 ShAmt1Op1 = ShAmt1Op1.getOperand(0);
23438 if (SumC->getSExtValue() == Bits && ShAmt1Op1 == ShAmt0)
23439 return DAG.getNode(Opc, DL, VT,
23441 DAG.getNode(ISD::TRUNCATE, DL,
23444 } else if (ConstantSDNode *ShAmt1C = dyn_cast<ConstantSDNode>(ShAmt1)) {
23445 ConstantSDNode *ShAmt0C = dyn_cast<ConstantSDNode>(ShAmt0);
23447 ShAmt0C->getSExtValue() + ShAmt1C->getSExtValue() == Bits)
23448 return DAG.getNode(Opc, DL, VT,
23449 N0.getOperand(0), N1.getOperand(0),
23450 DAG.getNode(ISD::TRUNCATE, DL,
23457 // Generate NEG and CMOV for integer abs.
23458 static SDValue performIntegerAbsCombine(SDNode *N, SelectionDAG &DAG) {
23459 EVT VT = N->getValueType(0);
23461 // Since X86 does not have CMOV for 8-bit integer, we don't convert
23462 // 8-bit integer abs to NEG and CMOV.
23463 if (VT.isInteger() && VT.getSizeInBits() == 8)
23466 SDValue N0 = N->getOperand(0);
23467 SDValue N1 = N->getOperand(1);
23470 // Check pattern of XOR(ADD(X,Y), Y) where Y is SRA(X, size(X)-1)
23471 // and change it to SUB and CMOV.
23472 if (VT.isInteger() && N->getOpcode() == ISD::XOR &&
23473 N0.getOpcode() == ISD::ADD &&
23474 N0.getOperand(1) == N1 &&
23475 N1.getOpcode() == ISD::SRA &&
23476 N1.getOperand(0) == N0.getOperand(0))
23477 if (ConstantSDNode *Y1C = dyn_cast<ConstantSDNode>(N1.getOperand(1)))
23478 if (Y1C->getAPIntValue() == VT.getSizeInBits()-1) {
23479 // Generate SUB & CMOV.
23480 SDValue Neg = DAG.getNode(X86ISD::SUB, DL, DAG.getVTList(VT, MVT::i32),
23481 DAG.getConstant(0, VT), N0.getOperand(0));
23483 SDValue Ops[] = { N0.getOperand(0), Neg,
23484 DAG.getConstant(X86::COND_GE, MVT::i8),
23485 SDValue(Neg.getNode(), 1) };
23486 return DAG.getNode(X86ISD::CMOV, DL, DAG.getVTList(VT, MVT::Glue), Ops);
23491 // PerformXorCombine - Attempts to turn XOR nodes into BLSMSK nodes
23492 static SDValue PerformXorCombine(SDNode *N, SelectionDAG &DAG,
23493 TargetLowering::DAGCombinerInfo &DCI,
23494 const X86Subtarget *Subtarget) {
23495 if (DCI.isBeforeLegalizeOps())
23498 if (Subtarget->hasCMov()) {
23499 SDValue RV = performIntegerAbsCombine(N, DAG);
23507 /// PerformLOADCombine - Do target-specific dag combines on LOAD nodes.
23508 static SDValue PerformLOADCombine(SDNode *N, SelectionDAG &DAG,
23509 TargetLowering::DAGCombinerInfo &DCI,
23510 const X86Subtarget *Subtarget) {
23511 LoadSDNode *Ld = cast<LoadSDNode>(N);
23512 EVT RegVT = Ld->getValueType(0);
23513 EVT MemVT = Ld->getMemoryVT();
23515 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
23517 // On Sandybridge unaligned 256bit loads are inefficient.
23518 ISD::LoadExtType Ext = Ld->getExtensionType();
23519 unsigned Alignment = Ld->getAlignment();
23520 bool IsAligned = Alignment == 0 || Alignment >= MemVT.getSizeInBits()/8;
23521 if (RegVT.is256BitVector() && !Subtarget->hasInt256() &&
23522 !DCI.isBeforeLegalizeOps() && !IsAligned && Ext == ISD::NON_EXTLOAD) {
23523 unsigned NumElems = RegVT.getVectorNumElements();
23527 SDValue Ptr = Ld->getBasePtr();
23528 SDValue Increment = DAG.getConstant(16, TLI.getPointerTy());
23530 EVT HalfVT = EVT::getVectorVT(*DAG.getContext(), MemVT.getScalarType(),
23532 SDValue Load1 = DAG.getLoad(HalfVT, dl, Ld->getChain(), Ptr,
23533 Ld->getPointerInfo(), Ld->isVolatile(),
23534 Ld->isNonTemporal(), Ld->isInvariant(),
23536 Ptr = DAG.getNode(ISD::ADD, dl, Ptr.getValueType(), Ptr, Increment);
23537 SDValue Load2 = DAG.getLoad(HalfVT, dl, Ld->getChain(), Ptr,
23538 Ld->getPointerInfo(), Ld->isVolatile(),
23539 Ld->isNonTemporal(), Ld->isInvariant(),
23540 std::min(16U, Alignment));
23541 SDValue TF = DAG.getNode(ISD::TokenFactor, dl, MVT::Other,
23543 Load2.getValue(1));
23545 SDValue NewVec = DAG.getUNDEF(RegVT);
23546 NewVec = Insert128BitVector(NewVec, Load1, 0, DAG, dl);
23547 NewVec = Insert128BitVector(NewVec, Load2, NumElems/2, DAG, dl);
23548 return DCI.CombineTo(N, NewVec, TF, true);
23554 /// PerformSTORECombine - Do target-specific dag combines on STORE nodes.
23555 static SDValue PerformSTORECombine(SDNode *N, SelectionDAG &DAG,
23556 const X86Subtarget *Subtarget) {
23557 StoreSDNode *St = cast<StoreSDNode>(N);
23558 EVT VT = St->getValue().getValueType();
23559 EVT StVT = St->getMemoryVT();
23561 SDValue StoredVal = St->getOperand(1);
23562 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
23564 // If we are saving a concatenation of two XMM registers, perform two stores.
23565 // On Sandy Bridge, 256-bit memory operations are executed by two
23566 // 128-bit ports. However, on Haswell it is better to issue a single 256-bit
23567 // memory operation.
23568 unsigned Alignment = St->getAlignment();
23569 bool IsAligned = Alignment == 0 || Alignment >= VT.getSizeInBits()/8;
23570 if (VT.is256BitVector() && !Subtarget->hasInt256() &&
23571 StVT == VT && !IsAligned) {
23572 unsigned NumElems = VT.getVectorNumElements();
23576 SDValue Value0 = Extract128BitVector(StoredVal, 0, DAG, dl);
23577 SDValue Value1 = Extract128BitVector(StoredVal, NumElems/2, DAG, dl);
23579 SDValue Stride = DAG.getConstant(16, TLI.getPointerTy());
23580 SDValue Ptr0 = St->getBasePtr();
23581 SDValue Ptr1 = DAG.getNode(ISD::ADD, dl, Ptr0.getValueType(), Ptr0, Stride);
23583 SDValue Ch0 = DAG.getStore(St->getChain(), dl, Value0, Ptr0,
23584 St->getPointerInfo(), St->isVolatile(),
23585 St->isNonTemporal(), Alignment);
23586 SDValue Ch1 = DAG.getStore(St->getChain(), dl, Value1, Ptr1,
23587 St->getPointerInfo(), St->isVolatile(),
23588 St->isNonTemporal(),
23589 std::min(16U, Alignment));
23590 return DAG.getNode(ISD::TokenFactor, dl, MVT::Other, Ch0, Ch1);
23593 // Optimize trunc store (of multiple scalars) to shuffle and store.
23594 // First, pack all of the elements in one place. Next, store to memory
23595 // in fewer chunks.
23596 if (St->isTruncatingStore() && VT.isVector()) {
23597 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
23598 unsigned NumElems = VT.getVectorNumElements();
23599 assert(StVT != VT && "Cannot truncate to the same type");
23600 unsigned FromSz = VT.getVectorElementType().getSizeInBits();
23601 unsigned ToSz = StVT.getVectorElementType().getSizeInBits();
23603 // From, To sizes and ElemCount must be pow of two
23604 if (!isPowerOf2_32(NumElems * FromSz * ToSz)) return SDValue();
23605 // We are going to use the original vector elt for storing.
23606 // Accumulated smaller vector elements must be a multiple of the store size.
23607 if (0 != (NumElems * FromSz) % ToSz) return SDValue();
23609 unsigned SizeRatio = FromSz / ToSz;
23611 assert(SizeRatio * NumElems * ToSz == VT.getSizeInBits());
23613 // Create a type on which we perform the shuffle
23614 EVT WideVecVT = EVT::getVectorVT(*DAG.getContext(),
23615 StVT.getScalarType(), NumElems*SizeRatio);
23617 assert(WideVecVT.getSizeInBits() == VT.getSizeInBits());
23619 SDValue WideVec = DAG.getNode(ISD::BITCAST, dl, WideVecVT, St->getValue());
23620 SmallVector<int, 8> ShuffleVec(NumElems * SizeRatio, -1);
23621 for (unsigned i = 0; i != NumElems; ++i)
23622 ShuffleVec[i] = i * SizeRatio;
23624 // Can't shuffle using an illegal type.
23625 if (!TLI.isTypeLegal(WideVecVT))
23628 SDValue Shuff = DAG.getVectorShuffle(WideVecVT, dl, WideVec,
23629 DAG.getUNDEF(WideVecVT),
23631 // At this point all of the data is stored at the bottom of the
23632 // register. We now need to save it to mem.
23634 // Find the largest store unit
23635 MVT StoreType = MVT::i8;
23636 for (unsigned tp = MVT::FIRST_INTEGER_VALUETYPE;
23637 tp < MVT::LAST_INTEGER_VALUETYPE; ++tp) {
23638 MVT Tp = (MVT::SimpleValueType)tp;
23639 if (TLI.isTypeLegal(Tp) && Tp.getSizeInBits() <= NumElems * ToSz)
23643 // On 32bit systems, we can't save 64bit integers. Try bitcasting to F64.
23644 if (TLI.isTypeLegal(MVT::f64) && StoreType.getSizeInBits() < 64 &&
23645 (64 <= NumElems * ToSz))
23646 StoreType = MVT::f64;
23648 // Bitcast the original vector into a vector of store-size units
23649 EVT StoreVecVT = EVT::getVectorVT(*DAG.getContext(),
23650 StoreType, VT.getSizeInBits()/StoreType.getSizeInBits());
23651 assert(StoreVecVT.getSizeInBits() == VT.getSizeInBits());
23652 SDValue ShuffWide = DAG.getNode(ISD::BITCAST, dl, StoreVecVT, Shuff);
23653 SmallVector<SDValue, 8> Chains;
23654 SDValue Increment = DAG.getConstant(StoreType.getSizeInBits()/8,
23655 TLI.getPointerTy());
23656 SDValue Ptr = St->getBasePtr();
23658 // Perform one or more big stores into memory.
23659 for (unsigned i=0, e=(ToSz*NumElems)/StoreType.getSizeInBits(); i!=e; ++i) {
23660 SDValue SubVec = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl,
23661 StoreType, ShuffWide,
23662 DAG.getIntPtrConstant(i));
23663 SDValue Ch = DAG.getStore(St->getChain(), dl, SubVec, Ptr,
23664 St->getPointerInfo(), St->isVolatile(),
23665 St->isNonTemporal(), St->getAlignment());
23666 Ptr = DAG.getNode(ISD::ADD, dl, Ptr.getValueType(), Ptr, Increment);
23667 Chains.push_back(Ch);
23670 return DAG.getNode(ISD::TokenFactor, dl, MVT::Other, Chains);
23673 // Turn load->store of MMX types into GPR load/stores. This avoids clobbering
23674 // the FP state in cases where an emms may be missing.
23675 // A preferable solution to the general problem is to figure out the right
23676 // places to insert EMMS. This qualifies as a quick hack.
23678 // Similarly, turn load->store of i64 into double load/stores in 32-bit mode.
23679 if (VT.getSizeInBits() != 64)
23682 const Function *F = DAG.getMachineFunction().getFunction();
23683 bool NoImplicitFloatOps = F->getAttributes().
23684 hasAttribute(AttributeSet::FunctionIndex, Attribute::NoImplicitFloat);
23685 bool F64IsLegal = !DAG.getTarget().Options.UseSoftFloat && !NoImplicitFloatOps
23686 && Subtarget->hasSSE2();
23687 if ((VT.isVector() ||
23688 (VT == MVT::i64 && F64IsLegal && !Subtarget->is64Bit())) &&
23689 isa<LoadSDNode>(St->getValue()) &&
23690 !cast<LoadSDNode>(St->getValue())->isVolatile() &&
23691 St->getChain().hasOneUse() && !St->isVolatile()) {
23692 SDNode* LdVal = St->getValue().getNode();
23693 LoadSDNode *Ld = nullptr;
23694 int TokenFactorIndex = -1;
23695 SmallVector<SDValue, 8> Ops;
23696 SDNode* ChainVal = St->getChain().getNode();
23697 // Must be a store of a load. We currently handle two cases: the load
23698 // is a direct child, and it's under an intervening TokenFactor. It is
23699 // possible to dig deeper under nested TokenFactors.
23700 if (ChainVal == LdVal)
23701 Ld = cast<LoadSDNode>(St->getChain());
23702 else if (St->getValue().hasOneUse() &&
23703 ChainVal->getOpcode() == ISD::TokenFactor) {
23704 for (unsigned i = 0, e = ChainVal->getNumOperands(); i != e; ++i) {
23705 if (ChainVal->getOperand(i).getNode() == LdVal) {
23706 TokenFactorIndex = i;
23707 Ld = cast<LoadSDNode>(St->getValue());
23709 Ops.push_back(ChainVal->getOperand(i));
23713 if (!Ld || !ISD::isNormalLoad(Ld))
23716 // If this is not the MMX case, i.e. we are just turning i64 load/store
23717 // into f64 load/store, avoid the transformation if there are multiple
23718 // uses of the loaded value.
23719 if (!VT.isVector() && !Ld->hasNUsesOfValue(1, 0))
23724 // If we are a 64-bit capable x86, lower to a single movq load/store pair.
23725 // Otherwise, if it's legal to use f64 SSE instructions, use f64 load/store
23727 if (Subtarget->is64Bit() || F64IsLegal) {
23728 EVT LdVT = Subtarget->is64Bit() ? MVT::i64 : MVT::f64;
23729 SDValue NewLd = DAG.getLoad(LdVT, LdDL, Ld->getChain(), Ld->getBasePtr(),
23730 Ld->getPointerInfo(), Ld->isVolatile(),
23731 Ld->isNonTemporal(), Ld->isInvariant(),
23732 Ld->getAlignment());
23733 SDValue NewChain = NewLd.getValue(1);
23734 if (TokenFactorIndex != -1) {
23735 Ops.push_back(NewChain);
23736 NewChain = DAG.getNode(ISD::TokenFactor, LdDL, MVT::Other, Ops);
23738 return DAG.getStore(NewChain, StDL, NewLd, St->getBasePtr(),
23739 St->getPointerInfo(),
23740 St->isVolatile(), St->isNonTemporal(),
23741 St->getAlignment());
23744 // Otherwise, lower to two pairs of 32-bit loads / stores.
23745 SDValue LoAddr = Ld->getBasePtr();
23746 SDValue HiAddr = DAG.getNode(ISD::ADD, LdDL, MVT::i32, LoAddr,
23747 DAG.getConstant(4, MVT::i32));
23749 SDValue LoLd = DAG.getLoad(MVT::i32, LdDL, Ld->getChain(), LoAddr,
23750 Ld->getPointerInfo(),
23751 Ld->isVolatile(), Ld->isNonTemporal(),
23752 Ld->isInvariant(), Ld->getAlignment());
23753 SDValue HiLd = DAG.getLoad(MVT::i32, LdDL, Ld->getChain(), HiAddr,
23754 Ld->getPointerInfo().getWithOffset(4),
23755 Ld->isVolatile(), Ld->isNonTemporal(),
23757 MinAlign(Ld->getAlignment(), 4));
23759 SDValue NewChain = LoLd.getValue(1);
23760 if (TokenFactorIndex != -1) {
23761 Ops.push_back(LoLd);
23762 Ops.push_back(HiLd);
23763 NewChain = DAG.getNode(ISD::TokenFactor, LdDL, MVT::Other, Ops);
23766 LoAddr = St->getBasePtr();
23767 HiAddr = DAG.getNode(ISD::ADD, StDL, MVT::i32, LoAddr,
23768 DAG.getConstant(4, MVT::i32));
23770 SDValue LoSt = DAG.getStore(NewChain, StDL, LoLd, LoAddr,
23771 St->getPointerInfo(),
23772 St->isVolatile(), St->isNonTemporal(),
23773 St->getAlignment());
23774 SDValue HiSt = DAG.getStore(NewChain, StDL, HiLd, HiAddr,
23775 St->getPointerInfo().getWithOffset(4),
23777 St->isNonTemporal(),
23778 MinAlign(St->getAlignment(), 4));
23779 return DAG.getNode(ISD::TokenFactor, StDL, MVT::Other, LoSt, HiSt);
23784 /// isHorizontalBinOp - Return 'true' if this vector operation is "horizontal"
23785 /// and return the operands for the horizontal operation in LHS and RHS. A
23786 /// horizontal operation performs the binary operation on successive elements
23787 /// of its first operand, then on successive elements of its second operand,
23788 /// returning the resulting values in a vector. For example, if
23789 /// A = < float a0, float a1, float a2, float a3 >
23791 /// B = < float b0, float b1, float b2, float b3 >
23792 /// then the result of doing a horizontal operation on A and B is
23793 /// A horizontal-op B = < a0 op a1, a2 op a3, b0 op b1, b2 op b3 >.
23794 /// In short, LHS and RHS are inspected to see if LHS op RHS is of the form
23795 /// A horizontal-op B, for some already available A and B, and if so then LHS is
23796 /// set to A, RHS to B, and the routine returns 'true'.
23797 /// Note that the binary operation should have the property that if one of the
23798 /// operands is UNDEF then the result is UNDEF.
23799 static bool isHorizontalBinOp(SDValue &LHS, SDValue &RHS, bool IsCommutative) {
23800 // Look for the following pattern: if
23801 // A = < float a0, float a1, float a2, float a3 >
23802 // B = < float b0, float b1, float b2, float b3 >
23804 // LHS = VECTOR_SHUFFLE A, B, <0, 2, 4, 6>
23805 // RHS = VECTOR_SHUFFLE A, B, <1, 3, 5, 7>
23806 // then LHS op RHS = < a0 op a1, a2 op a3, b0 op b1, b2 op b3 >
23807 // which is A horizontal-op B.
23809 // At least one of the operands should be a vector shuffle.
23810 if (LHS.getOpcode() != ISD::VECTOR_SHUFFLE &&
23811 RHS.getOpcode() != ISD::VECTOR_SHUFFLE)
23814 MVT VT = LHS.getSimpleValueType();
23816 assert((VT.is128BitVector() || VT.is256BitVector()) &&
23817 "Unsupported vector type for horizontal add/sub");
23819 // Handle 128 and 256-bit vector lengths. AVX defines horizontal add/sub to
23820 // operate independently on 128-bit lanes.
23821 unsigned NumElts = VT.getVectorNumElements();
23822 unsigned NumLanes = VT.getSizeInBits()/128;
23823 unsigned NumLaneElts = NumElts / NumLanes;
23824 assert((NumLaneElts % 2 == 0) &&
23825 "Vector type should have an even number of elements in each lane");
23826 unsigned HalfLaneElts = NumLaneElts/2;
23828 // View LHS in the form
23829 // LHS = VECTOR_SHUFFLE A, B, LMask
23830 // If LHS is not a shuffle then pretend it is the shuffle
23831 // LHS = VECTOR_SHUFFLE LHS, undef, <0, 1, ..., N-1>
23832 // NOTE: in what follows a default initialized SDValue represents an UNDEF of
23835 SmallVector<int, 16> LMask(NumElts);
23836 if (LHS.getOpcode() == ISD::VECTOR_SHUFFLE) {
23837 if (LHS.getOperand(0).getOpcode() != ISD::UNDEF)
23838 A = LHS.getOperand(0);
23839 if (LHS.getOperand(1).getOpcode() != ISD::UNDEF)
23840 B = LHS.getOperand(1);
23841 ArrayRef<int> Mask = cast<ShuffleVectorSDNode>(LHS.getNode())->getMask();
23842 std::copy(Mask.begin(), Mask.end(), LMask.begin());
23844 if (LHS.getOpcode() != ISD::UNDEF)
23846 for (unsigned i = 0; i != NumElts; ++i)
23850 // Likewise, view RHS in the form
23851 // RHS = VECTOR_SHUFFLE C, D, RMask
23853 SmallVector<int, 16> RMask(NumElts);
23854 if (RHS.getOpcode() == ISD::VECTOR_SHUFFLE) {
23855 if (RHS.getOperand(0).getOpcode() != ISD::UNDEF)
23856 C = RHS.getOperand(0);
23857 if (RHS.getOperand(1).getOpcode() != ISD::UNDEF)
23858 D = RHS.getOperand(1);
23859 ArrayRef<int> Mask = cast<ShuffleVectorSDNode>(RHS.getNode())->getMask();
23860 std::copy(Mask.begin(), Mask.end(), RMask.begin());
23862 if (RHS.getOpcode() != ISD::UNDEF)
23864 for (unsigned i = 0; i != NumElts; ++i)
23868 // Check that the shuffles are both shuffling the same vectors.
23869 if (!(A == C && B == D) && !(A == D && B == C))
23872 // If everything is UNDEF then bail out: it would be better to fold to UNDEF.
23873 if (!A.getNode() && !B.getNode())
23876 // If A and B occur in reverse order in RHS, then "swap" them (which means
23877 // rewriting the mask).
23879 CommuteVectorShuffleMask(RMask, NumElts);
23881 // At this point LHS and RHS are equivalent to
23882 // LHS = VECTOR_SHUFFLE A, B, LMask
23883 // RHS = VECTOR_SHUFFLE A, B, RMask
23884 // Check that the masks correspond to performing a horizontal operation.
23885 for (unsigned l = 0; l != NumElts; l += NumLaneElts) {
23886 for (unsigned i = 0; i != NumLaneElts; ++i) {
23887 int LIdx = LMask[i+l], RIdx = RMask[i+l];
23889 // Ignore any UNDEF components.
23890 if (LIdx < 0 || RIdx < 0 ||
23891 (!A.getNode() && (LIdx < (int)NumElts || RIdx < (int)NumElts)) ||
23892 (!B.getNode() && (LIdx >= (int)NumElts || RIdx >= (int)NumElts)))
23895 // Check that successive elements are being operated on. If not, this is
23896 // not a horizontal operation.
23897 unsigned Src = (i/HalfLaneElts); // each lane is split between srcs
23898 int Index = 2*(i%HalfLaneElts) + NumElts*Src + l;
23899 if (!(LIdx == Index && RIdx == Index + 1) &&
23900 !(IsCommutative && LIdx == Index + 1 && RIdx == Index))
23905 LHS = A.getNode() ? A : B; // If A is 'UNDEF', use B for it.
23906 RHS = B.getNode() ? B : A; // If B is 'UNDEF', use A for it.
23910 /// PerformFADDCombine - Do target-specific dag combines on floating point adds.
23911 static SDValue PerformFADDCombine(SDNode *N, SelectionDAG &DAG,
23912 const X86Subtarget *Subtarget) {
23913 EVT VT = N->getValueType(0);
23914 SDValue LHS = N->getOperand(0);
23915 SDValue RHS = N->getOperand(1);
23917 // Try to synthesize horizontal adds from adds of shuffles.
23918 if (((Subtarget->hasSSE3() && (VT == MVT::v4f32 || VT == MVT::v2f64)) ||
23919 (Subtarget->hasFp256() && (VT == MVT::v8f32 || VT == MVT::v4f64))) &&
23920 isHorizontalBinOp(LHS, RHS, true))
23921 return DAG.getNode(X86ISD::FHADD, SDLoc(N), VT, LHS, RHS);
23925 /// PerformFSUBCombine - Do target-specific dag combines on floating point subs.
23926 static SDValue PerformFSUBCombine(SDNode *N, SelectionDAG &DAG,
23927 const X86Subtarget *Subtarget) {
23928 EVT VT = N->getValueType(0);
23929 SDValue LHS = N->getOperand(0);
23930 SDValue RHS = N->getOperand(1);
23932 // Try to synthesize horizontal subs from subs of shuffles.
23933 if (((Subtarget->hasSSE3() && (VT == MVT::v4f32 || VT == MVT::v2f64)) ||
23934 (Subtarget->hasFp256() && (VT == MVT::v8f32 || VT == MVT::v4f64))) &&
23935 isHorizontalBinOp(LHS, RHS, false))
23936 return DAG.getNode(X86ISD::FHSUB, SDLoc(N), VT, LHS, RHS);
23940 /// PerformFORCombine - Do target-specific dag combines on X86ISD::FOR and
23941 /// X86ISD::FXOR nodes.
23942 static SDValue PerformFORCombine(SDNode *N, SelectionDAG &DAG) {
23943 assert(N->getOpcode() == X86ISD::FOR || N->getOpcode() == X86ISD::FXOR);
23944 // F[X]OR(0.0, x) -> x
23945 // F[X]OR(x, 0.0) -> x
23946 if (ConstantFPSDNode *C = dyn_cast<ConstantFPSDNode>(N->getOperand(0)))
23947 if (C->getValueAPF().isPosZero())
23948 return N->getOperand(1);
23949 if (ConstantFPSDNode *C = dyn_cast<ConstantFPSDNode>(N->getOperand(1)))
23950 if (C->getValueAPF().isPosZero())
23951 return N->getOperand(0);
23955 /// PerformFMinFMaxCombine - Do target-specific dag combines on X86ISD::FMIN and
23956 /// X86ISD::FMAX nodes.
23957 static SDValue PerformFMinFMaxCombine(SDNode *N, SelectionDAG &DAG) {
23958 assert(N->getOpcode() == X86ISD::FMIN || N->getOpcode() == X86ISD::FMAX);
23960 // Only perform optimizations if UnsafeMath is used.
23961 if (!DAG.getTarget().Options.UnsafeFPMath)
23964 // If we run in unsafe-math mode, then convert the FMAX and FMIN nodes
23965 // into FMINC and FMAXC, which are Commutative operations.
23966 unsigned NewOp = 0;
23967 switch (N->getOpcode()) {
23968 default: llvm_unreachable("unknown opcode");
23969 case X86ISD::FMIN: NewOp = X86ISD::FMINC; break;
23970 case X86ISD::FMAX: NewOp = X86ISD::FMAXC; break;
23973 return DAG.getNode(NewOp, SDLoc(N), N->getValueType(0),
23974 N->getOperand(0), N->getOperand(1));
23977 /// PerformFANDCombine - Do target-specific dag combines on X86ISD::FAND nodes.
23978 static SDValue PerformFANDCombine(SDNode *N, SelectionDAG &DAG) {
23979 // FAND(0.0, x) -> 0.0
23980 // FAND(x, 0.0) -> 0.0
23981 if (ConstantFPSDNode *C = dyn_cast<ConstantFPSDNode>(N->getOperand(0)))
23982 if (C->getValueAPF().isPosZero())
23983 return N->getOperand(0);
23984 if (ConstantFPSDNode *C = dyn_cast<ConstantFPSDNode>(N->getOperand(1)))
23985 if (C->getValueAPF().isPosZero())
23986 return N->getOperand(1);
23990 /// PerformFANDNCombine - Do target-specific dag combines on X86ISD::FANDN nodes
23991 static SDValue PerformFANDNCombine(SDNode *N, SelectionDAG &DAG) {
23992 // FANDN(x, 0.0) -> 0.0
23993 // FANDN(0.0, x) -> x
23994 if (ConstantFPSDNode *C = dyn_cast<ConstantFPSDNode>(N->getOperand(0)))
23995 if (C->getValueAPF().isPosZero())
23996 return N->getOperand(1);
23997 if (ConstantFPSDNode *C = dyn_cast<ConstantFPSDNode>(N->getOperand(1)))
23998 if (C->getValueAPF().isPosZero())
23999 return N->getOperand(1);
24003 static SDValue PerformBTCombine(SDNode *N,
24005 TargetLowering::DAGCombinerInfo &DCI) {
24006 // BT ignores high bits in the bit index operand.
24007 SDValue Op1 = N->getOperand(1);
24008 if (Op1.hasOneUse()) {
24009 unsigned BitWidth = Op1.getValueSizeInBits();
24010 APInt DemandedMask = APInt::getLowBitsSet(BitWidth, Log2_32(BitWidth));
24011 APInt KnownZero, KnownOne;
24012 TargetLowering::TargetLoweringOpt TLO(DAG, !DCI.isBeforeLegalize(),
24013 !DCI.isBeforeLegalizeOps());
24014 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
24015 if (TLO.ShrinkDemandedConstant(Op1, DemandedMask) ||
24016 TLI.SimplifyDemandedBits(Op1, DemandedMask, KnownZero, KnownOne, TLO))
24017 DCI.CommitTargetLoweringOpt(TLO);
24022 static SDValue PerformVZEXT_MOVLCombine(SDNode *N, SelectionDAG &DAG) {
24023 SDValue Op = N->getOperand(0);
24024 if (Op.getOpcode() == ISD::BITCAST)
24025 Op = Op.getOperand(0);
24026 EVT VT = N->getValueType(0), OpVT = Op.getValueType();
24027 if (Op.getOpcode() == X86ISD::VZEXT_LOAD &&
24028 VT.getVectorElementType().getSizeInBits() ==
24029 OpVT.getVectorElementType().getSizeInBits()) {
24030 return DAG.getNode(ISD::BITCAST, SDLoc(N), VT, Op);
24035 static SDValue PerformSIGN_EXTEND_INREGCombine(SDNode *N, SelectionDAG &DAG,
24036 const X86Subtarget *Subtarget) {
24037 EVT VT = N->getValueType(0);
24038 if (!VT.isVector())
24041 SDValue N0 = N->getOperand(0);
24042 SDValue N1 = N->getOperand(1);
24043 EVT ExtraVT = cast<VTSDNode>(N1)->getVT();
24046 // The SIGN_EXTEND_INREG to v4i64 is expensive operation on the
24047 // both SSE and AVX2 since there is no sign-extended shift right
24048 // operation on a vector with 64-bit elements.
24049 //(sext_in_reg (v4i64 anyext (v4i32 x )), ExtraVT) ->
24050 // (v4i64 sext (v4i32 sext_in_reg (v4i32 x , ExtraVT)))
24051 if (VT == MVT::v4i64 && (N0.getOpcode() == ISD::ANY_EXTEND ||
24052 N0.getOpcode() == ISD::SIGN_EXTEND)) {
24053 SDValue N00 = N0.getOperand(0);
24055 // EXTLOAD has a better solution on AVX2,
24056 // it may be replaced with X86ISD::VSEXT node.
24057 if (N00.getOpcode() == ISD::LOAD && Subtarget->hasInt256())
24058 if (!ISD::isNormalLoad(N00.getNode()))
24061 if (N00.getValueType() == MVT::v4i32 && ExtraVT.getSizeInBits() < 128) {
24062 SDValue Tmp = DAG.getNode(ISD::SIGN_EXTEND_INREG, dl, MVT::v4i32,
24064 return DAG.getNode(ISD::SIGN_EXTEND, dl, MVT::v4i64, Tmp);
24070 static SDValue PerformSExtCombine(SDNode *N, SelectionDAG &DAG,
24071 TargetLowering::DAGCombinerInfo &DCI,
24072 const X86Subtarget *Subtarget) {
24073 if (!DCI.isBeforeLegalizeOps())
24076 if (!Subtarget->hasFp256())
24079 EVT VT = N->getValueType(0);
24080 if (VT.isVector() && VT.getSizeInBits() == 256) {
24081 SDValue R = WidenMaskArithmetic(N, DAG, DCI, Subtarget);
24089 static SDValue PerformFMACombine(SDNode *N, SelectionDAG &DAG,
24090 const X86Subtarget* Subtarget) {
24092 EVT VT = N->getValueType(0);
24094 // Let legalize expand this if it isn't a legal type yet.
24095 if (!DAG.getTargetLoweringInfo().isTypeLegal(VT))
24098 EVT ScalarVT = VT.getScalarType();
24099 if ((ScalarVT != MVT::f32 && ScalarVT != MVT::f64) ||
24100 (!Subtarget->hasFMA() && !Subtarget->hasFMA4()))
24103 SDValue A = N->getOperand(0);
24104 SDValue B = N->getOperand(1);
24105 SDValue C = N->getOperand(2);
24107 bool NegA = (A.getOpcode() == ISD::FNEG);
24108 bool NegB = (B.getOpcode() == ISD::FNEG);
24109 bool NegC = (C.getOpcode() == ISD::FNEG);
24111 // Negative multiplication when NegA xor NegB
24112 bool NegMul = (NegA != NegB);
24114 A = A.getOperand(0);
24116 B = B.getOperand(0);
24118 C = C.getOperand(0);
24122 Opcode = (!NegC) ? X86ISD::FMADD : X86ISD::FMSUB;
24124 Opcode = (!NegC) ? X86ISD::FNMADD : X86ISD::FNMSUB;
24126 return DAG.getNode(Opcode, dl, VT, A, B, C);
24129 static SDValue PerformZExtCombine(SDNode *N, SelectionDAG &DAG,
24130 TargetLowering::DAGCombinerInfo &DCI,
24131 const X86Subtarget *Subtarget) {
24132 // (i32 zext (and (i8 x86isd::setcc_carry), 1)) ->
24133 // (and (i32 x86isd::setcc_carry), 1)
24134 // This eliminates the zext. This transformation is necessary because
24135 // ISD::SETCC is always legalized to i8.
24137 SDValue N0 = N->getOperand(0);
24138 EVT VT = N->getValueType(0);
24140 if (N0.getOpcode() == ISD::AND &&
24142 N0.getOperand(0).hasOneUse()) {
24143 SDValue N00 = N0.getOperand(0);
24144 if (N00.getOpcode() == X86ISD::SETCC_CARRY) {
24145 ConstantSDNode *C = dyn_cast<ConstantSDNode>(N0.getOperand(1));
24146 if (!C || C->getZExtValue() != 1)
24148 return DAG.getNode(ISD::AND, dl, VT,
24149 DAG.getNode(X86ISD::SETCC_CARRY, dl, VT,
24150 N00.getOperand(0), N00.getOperand(1)),
24151 DAG.getConstant(1, VT));
24155 if (N0.getOpcode() == ISD::TRUNCATE &&
24157 N0.getOperand(0).hasOneUse()) {
24158 SDValue N00 = N0.getOperand(0);
24159 if (N00.getOpcode() == X86ISD::SETCC_CARRY) {
24160 return DAG.getNode(ISD::AND, dl, VT,
24161 DAG.getNode(X86ISD::SETCC_CARRY, dl, VT,
24162 N00.getOperand(0), N00.getOperand(1)),
24163 DAG.getConstant(1, VT));
24166 if (VT.is256BitVector()) {
24167 SDValue R = WidenMaskArithmetic(N, DAG, DCI, Subtarget);
24175 // Optimize x == -y --> x+y == 0
24176 // x != -y --> x+y != 0
24177 static SDValue PerformISDSETCCCombine(SDNode *N, SelectionDAG &DAG,
24178 const X86Subtarget* Subtarget) {
24179 ISD::CondCode CC = cast<CondCodeSDNode>(N->getOperand(2))->get();
24180 SDValue LHS = N->getOperand(0);
24181 SDValue RHS = N->getOperand(1);
24182 EVT VT = N->getValueType(0);
24185 if ((CC == ISD::SETNE || CC == ISD::SETEQ) && LHS.getOpcode() == ISD::SUB)
24186 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(LHS.getOperand(0)))
24187 if (C->getAPIntValue() == 0 && LHS.hasOneUse()) {
24188 SDValue addV = DAG.getNode(ISD::ADD, SDLoc(N),
24189 LHS.getValueType(), RHS, LHS.getOperand(1));
24190 return DAG.getSetCC(SDLoc(N), N->getValueType(0),
24191 addV, DAG.getConstant(0, addV.getValueType()), CC);
24193 if ((CC == ISD::SETNE || CC == ISD::SETEQ) && RHS.getOpcode() == ISD::SUB)
24194 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(RHS.getOperand(0)))
24195 if (C->getAPIntValue() == 0 && RHS.hasOneUse()) {
24196 SDValue addV = DAG.getNode(ISD::ADD, SDLoc(N),
24197 RHS.getValueType(), LHS, RHS.getOperand(1));
24198 return DAG.getSetCC(SDLoc(N), N->getValueType(0),
24199 addV, DAG.getConstant(0, addV.getValueType()), CC);
24202 if (VT.getScalarType() == MVT::i1) {
24203 bool IsSEXT0 = (LHS.getOpcode() == ISD::SIGN_EXTEND) &&
24204 (LHS.getOperand(0).getValueType().getScalarType() == MVT::i1);
24205 bool IsVZero0 = ISD::isBuildVectorAllZeros(LHS.getNode());
24206 if (!IsSEXT0 && !IsVZero0)
24208 bool IsSEXT1 = (RHS.getOpcode() == ISD::SIGN_EXTEND) &&
24209 (RHS.getOperand(0).getValueType().getScalarType() == MVT::i1);
24210 bool IsVZero1 = ISD::isBuildVectorAllZeros(RHS.getNode());
24212 if (!IsSEXT1 && !IsVZero1)
24215 if (IsSEXT0 && IsVZero1) {
24216 assert(VT == LHS.getOperand(0).getValueType() && "Uexpected operand type");
24217 if (CC == ISD::SETEQ)
24218 return DAG.getNOT(DL, LHS.getOperand(0), VT);
24219 return LHS.getOperand(0);
24221 if (IsSEXT1 && IsVZero0) {
24222 assert(VT == RHS.getOperand(0).getValueType() && "Uexpected operand type");
24223 if (CC == ISD::SETEQ)
24224 return DAG.getNOT(DL, RHS.getOperand(0), VT);
24225 return RHS.getOperand(0);
24232 static SDValue PerformINSERTPSCombine(SDNode *N, SelectionDAG &DAG,
24233 const X86Subtarget *Subtarget) {
24235 MVT VT = N->getOperand(1)->getSimpleValueType(0);
24236 assert((VT == MVT::v4f32 || VT == MVT::v4i32) &&
24237 "X86insertps is only defined for v4x32");
24239 SDValue Ld = N->getOperand(1);
24240 if (MayFoldLoad(Ld)) {
24241 // Extract the countS bits from the immediate so we can get the proper
24242 // address when narrowing the vector load to a specific element.
24243 // When the second source op is a memory address, interps doesn't use
24244 // countS and just gets an f32 from that address.
24245 unsigned DestIndex =
24246 cast<ConstantSDNode>(N->getOperand(2))->getZExtValue() >> 6;
24247 Ld = NarrowVectorLoadToElement(cast<LoadSDNode>(Ld), DestIndex, DAG);
24251 // Create this as a scalar to vector to match the instruction pattern.
24252 SDValue LoadScalarToVector = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VT, Ld);
24253 // countS bits are ignored when loading from memory on insertps, which
24254 // means we don't need to explicitly set them to 0.
24255 return DAG.getNode(X86ISD::INSERTPS, dl, VT, N->getOperand(0),
24256 LoadScalarToVector, N->getOperand(2));
24259 // Helper function of PerformSETCCCombine. It is to materialize "setb reg"
24260 // as "sbb reg,reg", since it can be extended without zext and produces
24261 // an all-ones bit which is more useful than 0/1 in some cases.
24262 static SDValue MaterializeSETB(SDLoc DL, SDValue EFLAGS, SelectionDAG &DAG,
24265 return DAG.getNode(ISD::AND, DL, VT,
24266 DAG.getNode(X86ISD::SETCC_CARRY, DL, MVT::i8,
24267 DAG.getConstant(X86::COND_B, MVT::i8), EFLAGS),
24268 DAG.getConstant(1, VT));
24269 assert (VT == MVT::i1 && "Unexpected type for SECCC node");
24270 return DAG.getNode(ISD::TRUNCATE, DL, MVT::i1,
24271 DAG.getNode(X86ISD::SETCC_CARRY, DL, MVT::i8,
24272 DAG.getConstant(X86::COND_B, MVT::i8), EFLAGS));
24275 // Optimize RES = X86ISD::SETCC CONDCODE, EFLAG_INPUT
24276 static SDValue PerformSETCCCombine(SDNode *N, SelectionDAG &DAG,
24277 TargetLowering::DAGCombinerInfo &DCI,
24278 const X86Subtarget *Subtarget) {
24280 X86::CondCode CC = X86::CondCode(N->getConstantOperandVal(0));
24281 SDValue EFLAGS = N->getOperand(1);
24283 if (CC == X86::COND_A) {
24284 // Try to convert COND_A into COND_B in an attempt to facilitate
24285 // materializing "setb reg".
24287 // Do not flip "e > c", where "c" is a constant, because Cmp instruction
24288 // cannot take an immediate as its first operand.
24290 if (EFLAGS.getOpcode() == X86ISD::SUB && EFLAGS.hasOneUse() &&
24291 EFLAGS.getValueType().isInteger() &&
24292 !isa<ConstantSDNode>(EFLAGS.getOperand(1))) {
24293 SDValue NewSub = DAG.getNode(X86ISD::SUB, SDLoc(EFLAGS),
24294 EFLAGS.getNode()->getVTList(),
24295 EFLAGS.getOperand(1), EFLAGS.getOperand(0));
24296 SDValue NewEFLAGS = SDValue(NewSub.getNode(), EFLAGS.getResNo());
24297 return MaterializeSETB(DL, NewEFLAGS, DAG, N->getSimpleValueType(0));
24301 // Materialize "setb reg" as "sbb reg,reg", since it can be extended without
24302 // a zext and produces an all-ones bit which is more useful than 0/1 in some
24304 if (CC == X86::COND_B)
24305 return MaterializeSETB(DL, EFLAGS, DAG, N->getSimpleValueType(0));
24309 Flags = checkBoolTestSetCCCombine(EFLAGS, CC);
24310 if (Flags.getNode()) {
24311 SDValue Cond = DAG.getConstant(CC, MVT::i8);
24312 return DAG.getNode(X86ISD::SETCC, DL, N->getVTList(), Cond, Flags);
24318 // Optimize branch condition evaluation.
24320 static SDValue PerformBrCondCombine(SDNode *N, SelectionDAG &DAG,
24321 TargetLowering::DAGCombinerInfo &DCI,
24322 const X86Subtarget *Subtarget) {
24324 SDValue Chain = N->getOperand(0);
24325 SDValue Dest = N->getOperand(1);
24326 SDValue EFLAGS = N->getOperand(3);
24327 X86::CondCode CC = X86::CondCode(N->getConstantOperandVal(2));
24331 Flags = checkBoolTestSetCCCombine(EFLAGS, CC);
24332 if (Flags.getNode()) {
24333 SDValue Cond = DAG.getConstant(CC, MVT::i8);
24334 return DAG.getNode(X86ISD::BRCOND, DL, N->getVTList(), Chain, Dest, Cond,
24341 static SDValue performVectorCompareAndMaskUnaryOpCombine(SDNode *N,
24342 SelectionDAG &DAG) {
24343 // Take advantage of vector comparisons producing 0 or -1 in each lane to
24344 // optimize away operation when it's from a constant.
24346 // The general transformation is:
24347 // UNARYOP(AND(VECTOR_CMP(x,y), constant)) -->
24348 // AND(VECTOR_CMP(x,y), constant2)
24349 // constant2 = UNARYOP(constant)
24351 // Early exit if this isn't a vector operation, the operand of the
24352 // unary operation isn't a bitwise AND, or if the sizes of the operations
24353 // aren't the same.
24354 EVT VT = N->getValueType(0);
24355 if (!VT.isVector() || N->getOperand(0)->getOpcode() != ISD::AND ||
24356 N->getOperand(0)->getOperand(0)->getOpcode() != ISD::SETCC ||
24357 VT.getSizeInBits() != N->getOperand(0)->getValueType(0).getSizeInBits())
24360 // Now check that the other operand of the AND is a constant. We could
24361 // make the transformation for non-constant splats as well, but it's unclear
24362 // that would be a benefit as it would not eliminate any operations, just
24363 // perform one more step in scalar code before moving to the vector unit.
24364 if (BuildVectorSDNode *BV =
24365 dyn_cast<BuildVectorSDNode>(N->getOperand(0)->getOperand(1))) {
24366 // Bail out if the vector isn't a constant.
24367 if (!BV->isConstant())
24370 // Everything checks out. Build up the new and improved node.
24372 EVT IntVT = BV->getValueType(0);
24373 // Create a new constant of the appropriate type for the transformed
24375 SDValue SourceConst = DAG.getNode(N->getOpcode(), DL, VT, SDValue(BV, 0));
24376 // The AND node needs bitcasts to/from an integer vector type around it.
24377 SDValue MaskConst = DAG.getNode(ISD::BITCAST, DL, IntVT, SourceConst);
24378 SDValue NewAnd = DAG.getNode(ISD::AND, DL, IntVT,
24379 N->getOperand(0)->getOperand(0), MaskConst);
24380 SDValue Res = DAG.getNode(ISD::BITCAST, DL, VT, NewAnd);
24387 static SDValue PerformSINT_TO_FPCombine(SDNode *N, SelectionDAG &DAG,
24388 const X86TargetLowering *XTLI) {
24389 // First try to optimize away the conversion entirely when it's
24390 // conditionally from a constant. Vectors only.
24391 SDValue Res = performVectorCompareAndMaskUnaryOpCombine(N, DAG);
24392 if (Res != SDValue())
24395 // Now move on to more general possibilities.
24396 SDValue Op0 = N->getOperand(0);
24397 EVT InVT = Op0->getValueType(0);
24399 // SINT_TO_FP(v4i8) -> SINT_TO_FP(SEXT(v4i8 to v4i32))
24400 if (InVT == MVT::v8i8 || InVT == MVT::v4i8) {
24402 MVT DstVT = InVT == MVT::v4i8 ? MVT::v4i32 : MVT::v8i32;
24403 SDValue P = DAG.getNode(ISD::SIGN_EXTEND, dl, DstVT, Op0);
24404 return DAG.getNode(ISD::SINT_TO_FP, dl, N->getValueType(0), P);
24407 // Transform (SINT_TO_FP (i64 ...)) into an x87 operation if we have
24408 // a 32-bit target where SSE doesn't support i64->FP operations.
24409 if (Op0.getOpcode() == ISD::LOAD) {
24410 LoadSDNode *Ld = cast<LoadSDNode>(Op0.getNode());
24411 EVT VT = Ld->getValueType(0);
24412 if (!Ld->isVolatile() && !N->getValueType(0).isVector() &&
24413 ISD::isNON_EXTLoad(Op0.getNode()) && Op0.hasOneUse() &&
24414 !XTLI->getSubtarget()->is64Bit() &&
24416 SDValue FILDChain = XTLI->BuildFILD(SDValue(N, 0), Ld->getValueType(0),
24417 Ld->getChain(), Op0, DAG);
24418 DAG.ReplaceAllUsesOfValueWith(Op0.getValue(1), FILDChain.getValue(1));
24425 // Optimize RES, EFLAGS = X86ISD::ADC LHS, RHS, EFLAGS
24426 static SDValue PerformADCCombine(SDNode *N, SelectionDAG &DAG,
24427 X86TargetLowering::DAGCombinerInfo &DCI) {
24428 // If the LHS and RHS of the ADC node are zero, then it can't overflow and
24429 // the result is either zero or one (depending on the input carry bit).
24430 // Strength reduce this down to a "set on carry" aka SETCC_CARRY&1.
24431 if (X86::isZeroNode(N->getOperand(0)) &&
24432 X86::isZeroNode(N->getOperand(1)) &&
24433 // We don't have a good way to replace an EFLAGS use, so only do this when
24435 SDValue(N, 1).use_empty()) {
24437 EVT VT = N->getValueType(0);
24438 SDValue CarryOut = DAG.getConstant(0, N->getValueType(1));
24439 SDValue Res1 = DAG.getNode(ISD::AND, DL, VT,
24440 DAG.getNode(X86ISD::SETCC_CARRY, DL, VT,
24441 DAG.getConstant(X86::COND_B,MVT::i8),
24443 DAG.getConstant(1, VT));
24444 return DCI.CombineTo(N, Res1, CarryOut);
24450 // fold (add Y, (sete X, 0)) -> adc 0, Y
24451 // (add Y, (setne X, 0)) -> sbb -1, Y
24452 // (sub (sete X, 0), Y) -> sbb 0, Y
24453 // (sub (setne X, 0), Y) -> adc -1, Y
24454 static SDValue OptimizeConditionalInDecrement(SDNode *N, SelectionDAG &DAG) {
24457 // Look through ZExts.
24458 SDValue Ext = N->getOperand(N->getOpcode() == ISD::SUB ? 1 : 0);
24459 if (Ext.getOpcode() != ISD::ZERO_EXTEND || !Ext.hasOneUse())
24462 SDValue SetCC = Ext.getOperand(0);
24463 if (SetCC.getOpcode() != X86ISD::SETCC || !SetCC.hasOneUse())
24466 X86::CondCode CC = (X86::CondCode)SetCC.getConstantOperandVal(0);
24467 if (CC != X86::COND_E && CC != X86::COND_NE)
24470 SDValue Cmp = SetCC.getOperand(1);
24471 if (Cmp.getOpcode() != X86ISD::CMP || !Cmp.hasOneUse() ||
24472 !X86::isZeroNode(Cmp.getOperand(1)) ||
24473 !Cmp.getOperand(0).getValueType().isInteger())
24476 SDValue CmpOp0 = Cmp.getOperand(0);
24477 SDValue NewCmp = DAG.getNode(X86ISD::CMP, DL, MVT::i32, CmpOp0,
24478 DAG.getConstant(1, CmpOp0.getValueType()));
24480 SDValue OtherVal = N->getOperand(N->getOpcode() == ISD::SUB ? 0 : 1);
24481 if (CC == X86::COND_NE)
24482 return DAG.getNode(N->getOpcode() == ISD::SUB ? X86ISD::ADC : X86ISD::SBB,
24483 DL, OtherVal.getValueType(), OtherVal,
24484 DAG.getConstant(-1ULL, OtherVal.getValueType()), NewCmp);
24485 return DAG.getNode(N->getOpcode() == ISD::SUB ? X86ISD::SBB : X86ISD::ADC,
24486 DL, OtherVal.getValueType(), OtherVal,
24487 DAG.getConstant(0, OtherVal.getValueType()), NewCmp);
24490 /// PerformADDCombine - Do target-specific dag combines on integer adds.
24491 static SDValue PerformAddCombine(SDNode *N, SelectionDAG &DAG,
24492 const X86Subtarget *Subtarget) {
24493 EVT VT = N->getValueType(0);
24494 SDValue Op0 = N->getOperand(0);
24495 SDValue Op1 = N->getOperand(1);
24497 // Try to synthesize horizontal adds from adds of shuffles.
24498 if (((Subtarget->hasSSSE3() && (VT == MVT::v8i16 || VT == MVT::v4i32)) ||
24499 (Subtarget->hasInt256() && (VT == MVT::v16i16 || VT == MVT::v8i32))) &&
24500 isHorizontalBinOp(Op0, Op1, true))
24501 return DAG.getNode(X86ISD::HADD, SDLoc(N), VT, Op0, Op1);
24503 return OptimizeConditionalInDecrement(N, DAG);
24506 static SDValue PerformSubCombine(SDNode *N, SelectionDAG &DAG,
24507 const X86Subtarget *Subtarget) {
24508 SDValue Op0 = N->getOperand(0);
24509 SDValue Op1 = N->getOperand(1);
24511 // X86 can't encode an immediate LHS of a sub. See if we can push the
24512 // negation into a preceding instruction.
24513 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op0)) {
24514 // If the RHS of the sub is a XOR with one use and a constant, invert the
24515 // immediate. Then add one to the LHS of the sub so we can turn
24516 // X-Y -> X+~Y+1, saving one register.
24517 if (Op1->hasOneUse() && Op1.getOpcode() == ISD::XOR &&
24518 isa<ConstantSDNode>(Op1.getOperand(1))) {
24519 APInt XorC = cast<ConstantSDNode>(Op1.getOperand(1))->getAPIntValue();
24520 EVT VT = Op0.getValueType();
24521 SDValue NewXor = DAG.getNode(ISD::XOR, SDLoc(Op1), VT,
24523 DAG.getConstant(~XorC, VT));
24524 return DAG.getNode(ISD::ADD, SDLoc(N), VT, NewXor,
24525 DAG.getConstant(C->getAPIntValue()+1, VT));
24529 // Try to synthesize horizontal adds from adds of shuffles.
24530 EVT VT = N->getValueType(0);
24531 if (((Subtarget->hasSSSE3() && (VT == MVT::v8i16 || VT == MVT::v4i32)) ||
24532 (Subtarget->hasInt256() && (VT == MVT::v16i16 || VT == MVT::v8i32))) &&
24533 isHorizontalBinOp(Op0, Op1, true))
24534 return DAG.getNode(X86ISD::HSUB, SDLoc(N), VT, Op0, Op1);
24536 return OptimizeConditionalInDecrement(N, DAG);
24539 /// performVZEXTCombine - Performs build vector combines
24540 static SDValue performVZEXTCombine(SDNode *N, SelectionDAG &DAG,
24541 TargetLowering::DAGCombinerInfo &DCI,
24542 const X86Subtarget *Subtarget) {
24543 // (vzext (bitcast (vzext (x)) -> (vzext x)
24544 SDValue In = N->getOperand(0);
24545 while (In.getOpcode() == ISD::BITCAST)
24546 In = In.getOperand(0);
24548 if (In.getOpcode() != X86ISD::VZEXT)
24551 return DAG.getNode(X86ISD::VZEXT, SDLoc(N), N->getValueType(0),
24555 SDValue X86TargetLowering::PerformDAGCombine(SDNode *N,
24556 DAGCombinerInfo &DCI) const {
24557 SelectionDAG &DAG = DCI.DAG;
24558 switch (N->getOpcode()) {
24560 case ISD::EXTRACT_VECTOR_ELT:
24561 return PerformEXTRACT_VECTOR_ELTCombine(N, DAG, DCI);
24563 case ISD::SELECT: return PerformSELECTCombine(N, DAG, DCI, Subtarget);
24564 case X86ISD::CMOV: return PerformCMOVCombine(N, DAG, DCI, Subtarget);
24565 case ISD::ADD: return PerformAddCombine(N, DAG, Subtarget);
24566 case ISD::SUB: return PerformSubCombine(N, DAG, Subtarget);
24567 case X86ISD::ADC: return PerformADCCombine(N, DAG, DCI);
24568 case ISD::MUL: return PerformMulCombine(N, DAG, DCI);
24571 case ISD::SRL: return PerformShiftCombine(N, DAG, DCI, Subtarget);
24572 case ISD::AND: return PerformAndCombine(N, DAG, DCI, Subtarget);
24573 case ISD::OR: return PerformOrCombine(N, DAG, DCI, Subtarget);
24574 case ISD::XOR: return PerformXorCombine(N, DAG, DCI, Subtarget);
24575 case ISD::LOAD: return PerformLOADCombine(N, DAG, DCI, Subtarget);
24576 case ISD::STORE: return PerformSTORECombine(N, DAG, Subtarget);
24577 case ISD::SINT_TO_FP: return PerformSINT_TO_FPCombine(N, DAG, this);
24578 case ISD::FADD: return PerformFADDCombine(N, DAG, Subtarget);
24579 case ISD::FSUB: return PerformFSUBCombine(N, DAG, Subtarget);
24581 case X86ISD::FOR: return PerformFORCombine(N, DAG);
24583 case X86ISD::FMAX: return PerformFMinFMaxCombine(N, DAG);
24584 case X86ISD::FAND: return PerformFANDCombine(N, DAG);
24585 case X86ISD::FANDN: return PerformFANDNCombine(N, DAG);
24586 case X86ISD::BT: return PerformBTCombine(N, DAG, DCI);
24587 case X86ISD::VZEXT_MOVL: return PerformVZEXT_MOVLCombine(N, DAG);
24588 case ISD::ANY_EXTEND:
24589 case ISD::ZERO_EXTEND: return PerformZExtCombine(N, DAG, DCI, Subtarget);
24590 case ISD::SIGN_EXTEND: return PerformSExtCombine(N, DAG, DCI, Subtarget);
24591 case ISD::SIGN_EXTEND_INREG:
24592 return PerformSIGN_EXTEND_INREGCombine(N, DAG, Subtarget);
24593 case ISD::TRUNCATE: return PerformTruncateCombine(N, DAG,DCI,Subtarget);
24594 case ISD::SETCC: return PerformISDSETCCCombine(N, DAG, Subtarget);
24595 case X86ISD::SETCC: return PerformSETCCCombine(N, DAG, DCI, Subtarget);
24596 case X86ISD::BRCOND: return PerformBrCondCombine(N, DAG, DCI, Subtarget);
24597 case X86ISD::VZEXT: return performVZEXTCombine(N, DAG, DCI, Subtarget);
24598 case X86ISD::SHUFP: // Handle all target specific shuffles
24599 case X86ISD::PALIGNR:
24600 case X86ISD::UNPCKH:
24601 case X86ISD::UNPCKL:
24602 case X86ISD::MOVHLPS:
24603 case X86ISD::MOVLHPS:
24604 case X86ISD::PSHUFB:
24605 case X86ISD::PSHUFD:
24606 case X86ISD::PSHUFHW:
24607 case X86ISD::PSHUFLW:
24608 case X86ISD::MOVSS:
24609 case X86ISD::MOVSD:
24610 case X86ISD::VPERMILPI:
24611 case X86ISD::VPERM2X128:
24612 case ISD::VECTOR_SHUFFLE: return PerformShuffleCombine(N, DAG, DCI,Subtarget);
24613 case ISD::FMA: return PerformFMACombine(N, DAG, Subtarget);
24614 case ISD::INTRINSIC_WO_CHAIN:
24615 return PerformINTRINSIC_WO_CHAINCombine(N, DAG, Subtarget);
24616 case X86ISD::INSERTPS:
24617 return PerformINSERTPSCombine(N, DAG, Subtarget);
24618 case ISD::BUILD_VECTOR: return PerformBUILD_VECTORCombine(N, DAG, Subtarget);
24624 /// isTypeDesirableForOp - Return true if the target has native support for
24625 /// the specified value type and it is 'desirable' to use the type for the
24626 /// given node type. e.g. On x86 i16 is legal, but undesirable since i16
24627 /// instruction encodings are longer and some i16 instructions are slow.
24628 bool X86TargetLowering::isTypeDesirableForOp(unsigned Opc, EVT VT) const {
24629 if (!isTypeLegal(VT))
24631 if (VT != MVT::i16)
24638 case ISD::SIGN_EXTEND:
24639 case ISD::ZERO_EXTEND:
24640 case ISD::ANY_EXTEND:
24653 /// IsDesirableToPromoteOp - This method query the target whether it is
24654 /// beneficial for dag combiner to promote the specified node. If true, it
24655 /// should return the desired promotion type by reference.
24656 bool X86TargetLowering::IsDesirableToPromoteOp(SDValue Op, EVT &PVT) const {
24657 EVT VT = Op.getValueType();
24658 if (VT != MVT::i16)
24661 bool Promote = false;
24662 bool Commute = false;
24663 switch (Op.getOpcode()) {
24666 LoadSDNode *LD = cast<LoadSDNode>(Op);
24667 // If the non-extending load has a single use and it's not live out, then it
24668 // might be folded.
24669 if (LD->getExtensionType() == ISD::NON_EXTLOAD /*&&
24670 Op.hasOneUse()*/) {
24671 for (SDNode::use_iterator UI = Op.getNode()->use_begin(),
24672 UE = Op.getNode()->use_end(); UI != UE; ++UI) {
24673 // The only case where we'd want to promote LOAD (rather then it being
24674 // promoted as an operand is when it's only use is liveout.
24675 if (UI->getOpcode() != ISD::CopyToReg)
24682 case ISD::SIGN_EXTEND:
24683 case ISD::ZERO_EXTEND:
24684 case ISD::ANY_EXTEND:
24689 SDValue N0 = Op.getOperand(0);
24690 // Look out for (store (shl (load), x)).
24691 if (MayFoldLoad(N0) && MayFoldIntoStore(Op))
24704 SDValue N0 = Op.getOperand(0);
24705 SDValue N1 = Op.getOperand(1);
24706 if (!Commute && MayFoldLoad(N1))
24708 // Avoid disabling potential load folding opportunities.
24709 if (MayFoldLoad(N0) && (!isa<ConstantSDNode>(N1) || MayFoldIntoStore(Op)))
24711 if (MayFoldLoad(N1) && (!isa<ConstantSDNode>(N0) || MayFoldIntoStore(Op)))
24721 //===----------------------------------------------------------------------===//
24722 // X86 Inline Assembly Support
24723 //===----------------------------------------------------------------------===//
24726 // Helper to match a string separated by whitespace.
24727 bool matchAsmImpl(StringRef s, ArrayRef<const StringRef *> args) {
24728 s = s.substr(s.find_first_not_of(" \t")); // Skip leading whitespace.
24730 for (unsigned i = 0, e = args.size(); i != e; ++i) {
24731 StringRef piece(*args[i]);
24732 if (!s.startswith(piece)) // Check if the piece matches.
24735 s = s.substr(piece.size());
24736 StringRef::size_type pos = s.find_first_not_of(" \t");
24737 if (pos == 0) // We matched a prefix.
24745 const VariadicFunction1<bool, StringRef, StringRef, matchAsmImpl> matchAsm={};
24748 static bool clobbersFlagRegisters(const SmallVector<StringRef, 4> &AsmPieces) {
24750 if (AsmPieces.size() == 3 || AsmPieces.size() == 4) {
24751 if (std::count(AsmPieces.begin(), AsmPieces.end(), "~{cc}") &&
24752 std::count(AsmPieces.begin(), AsmPieces.end(), "~{flags}") &&
24753 std::count(AsmPieces.begin(), AsmPieces.end(), "~{fpsr}")) {
24755 if (AsmPieces.size() == 3)
24757 else if (std::count(AsmPieces.begin(), AsmPieces.end(), "~{dirflag}"))
24764 bool X86TargetLowering::ExpandInlineAsm(CallInst *CI) const {
24765 InlineAsm *IA = cast<InlineAsm>(CI->getCalledValue());
24767 std::string AsmStr = IA->getAsmString();
24769 IntegerType *Ty = dyn_cast<IntegerType>(CI->getType());
24770 if (!Ty || Ty->getBitWidth() % 16 != 0)
24773 // TODO: should remove alternatives from the asmstring: "foo {a|b}" -> "foo a"
24774 SmallVector<StringRef, 4> AsmPieces;
24775 SplitString(AsmStr, AsmPieces, ";\n");
24777 switch (AsmPieces.size()) {
24778 default: return false;
24780 // FIXME: this should verify that we are targeting a 486 or better. If not,
24781 // we will turn this bswap into something that will be lowered to logical
24782 // ops instead of emitting the bswap asm. For now, we don't support 486 or
24783 // lower so don't worry about this.
24785 if (matchAsm(AsmPieces[0], "bswap", "$0") ||
24786 matchAsm(AsmPieces[0], "bswapl", "$0") ||
24787 matchAsm(AsmPieces[0], "bswapq", "$0") ||
24788 matchAsm(AsmPieces[0], "bswap", "${0:q}") ||
24789 matchAsm(AsmPieces[0], "bswapl", "${0:q}") ||
24790 matchAsm(AsmPieces[0], "bswapq", "${0:q}")) {
24791 // No need to check constraints, nothing other than the equivalent of
24792 // "=r,0" would be valid here.
24793 return IntrinsicLowering::LowerToByteSwap(CI);
24796 // rorw $$8, ${0:w} --> llvm.bswap.i16
24797 if (CI->getType()->isIntegerTy(16) &&
24798 IA->getConstraintString().compare(0, 5, "=r,0,") == 0 &&
24799 (matchAsm(AsmPieces[0], "rorw", "$$8,", "${0:w}") ||
24800 matchAsm(AsmPieces[0], "rolw", "$$8,", "${0:w}"))) {
24802 const std::string &ConstraintsStr = IA->getConstraintString();
24803 SplitString(StringRef(ConstraintsStr).substr(5), AsmPieces, ",");
24804 array_pod_sort(AsmPieces.begin(), AsmPieces.end());
24805 if (clobbersFlagRegisters(AsmPieces))
24806 return IntrinsicLowering::LowerToByteSwap(CI);
24810 if (CI->getType()->isIntegerTy(32) &&
24811 IA->getConstraintString().compare(0, 5, "=r,0,") == 0 &&
24812 matchAsm(AsmPieces[0], "rorw", "$$8,", "${0:w}") &&
24813 matchAsm(AsmPieces[1], "rorl", "$$16,", "$0") &&
24814 matchAsm(AsmPieces[2], "rorw", "$$8,", "${0:w}")) {
24816 const std::string &ConstraintsStr = IA->getConstraintString();
24817 SplitString(StringRef(ConstraintsStr).substr(5), AsmPieces, ",");
24818 array_pod_sort(AsmPieces.begin(), AsmPieces.end());
24819 if (clobbersFlagRegisters(AsmPieces))
24820 return IntrinsicLowering::LowerToByteSwap(CI);
24823 if (CI->getType()->isIntegerTy(64)) {
24824 InlineAsm::ConstraintInfoVector Constraints = IA->ParseConstraints();
24825 if (Constraints.size() >= 2 &&
24826 Constraints[0].Codes.size() == 1 && Constraints[0].Codes[0] == "A" &&
24827 Constraints[1].Codes.size() == 1 && Constraints[1].Codes[0] == "0") {
24828 // bswap %eax / bswap %edx / xchgl %eax, %edx -> llvm.bswap.i64
24829 if (matchAsm(AsmPieces[0], "bswap", "%eax") &&
24830 matchAsm(AsmPieces[1], "bswap", "%edx") &&
24831 matchAsm(AsmPieces[2], "xchgl", "%eax,", "%edx"))
24832 return IntrinsicLowering::LowerToByteSwap(CI);
24840 /// getConstraintType - Given a constraint letter, return the type of
24841 /// constraint it is for this target.
24842 X86TargetLowering::ConstraintType
24843 X86TargetLowering::getConstraintType(const std::string &Constraint) const {
24844 if (Constraint.size() == 1) {
24845 switch (Constraint[0]) {
24856 return C_RegisterClass;
24880 return TargetLowering::getConstraintType(Constraint);
24883 /// Examine constraint type and operand type and determine a weight value.
24884 /// This object must already have been set up with the operand type
24885 /// and the current alternative constraint selected.
24886 TargetLowering::ConstraintWeight
24887 X86TargetLowering::getSingleConstraintMatchWeight(
24888 AsmOperandInfo &info, const char *constraint) const {
24889 ConstraintWeight weight = CW_Invalid;
24890 Value *CallOperandVal = info.CallOperandVal;
24891 // If we don't have a value, we can't do a match,
24892 // but allow it at the lowest weight.
24893 if (!CallOperandVal)
24895 Type *type = CallOperandVal->getType();
24896 // Look at the constraint type.
24897 switch (*constraint) {
24899 weight = TargetLowering::getSingleConstraintMatchWeight(info, constraint);
24910 if (CallOperandVal->getType()->isIntegerTy())
24911 weight = CW_SpecificReg;
24916 if (type->isFloatingPointTy())
24917 weight = CW_SpecificReg;
24920 if (type->isX86_MMXTy() && Subtarget->hasMMX())
24921 weight = CW_SpecificReg;
24925 if (((type->getPrimitiveSizeInBits() == 128) && Subtarget->hasSSE1()) ||
24926 ((type->getPrimitiveSizeInBits() == 256) && Subtarget->hasFp256()))
24927 weight = CW_Register;
24930 if (ConstantInt *C = dyn_cast<ConstantInt>(info.CallOperandVal)) {
24931 if (C->getZExtValue() <= 31)
24932 weight = CW_Constant;
24936 if (ConstantInt *C = dyn_cast<ConstantInt>(CallOperandVal)) {
24937 if (C->getZExtValue() <= 63)
24938 weight = CW_Constant;
24942 if (ConstantInt *C = dyn_cast<ConstantInt>(CallOperandVal)) {
24943 if ((C->getSExtValue() >= -0x80) && (C->getSExtValue() <= 0x7f))
24944 weight = CW_Constant;
24948 if (ConstantInt *C = dyn_cast<ConstantInt>(CallOperandVal)) {
24949 if ((C->getZExtValue() == 0xff) || (C->getZExtValue() == 0xffff))
24950 weight = CW_Constant;
24954 if (ConstantInt *C = dyn_cast<ConstantInt>(CallOperandVal)) {
24955 if (C->getZExtValue() <= 3)
24956 weight = CW_Constant;
24960 if (ConstantInt *C = dyn_cast<ConstantInt>(CallOperandVal)) {
24961 if (C->getZExtValue() <= 0xff)
24962 weight = CW_Constant;
24967 if (dyn_cast<ConstantFP>(CallOperandVal)) {
24968 weight = CW_Constant;
24972 if (ConstantInt *C = dyn_cast<ConstantInt>(CallOperandVal)) {
24973 if ((C->getSExtValue() >= -0x80000000LL) &&
24974 (C->getSExtValue() <= 0x7fffffffLL))
24975 weight = CW_Constant;
24979 if (ConstantInt *C = dyn_cast<ConstantInt>(CallOperandVal)) {
24980 if (C->getZExtValue() <= 0xffffffff)
24981 weight = CW_Constant;
24988 /// LowerXConstraint - try to replace an X constraint, which matches anything,
24989 /// with another that has more specific requirements based on the type of the
24990 /// corresponding operand.
24991 const char *X86TargetLowering::
24992 LowerXConstraint(EVT ConstraintVT) const {
24993 // FP X constraints get lowered to SSE1/2 registers if available, otherwise
24994 // 'f' like normal targets.
24995 if (ConstraintVT.isFloatingPoint()) {
24996 if (Subtarget->hasSSE2())
24998 if (Subtarget->hasSSE1())
25002 return TargetLowering::LowerXConstraint(ConstraintVT);
25005 /// LowerAsmOperandForConstraint - Lower the specified operand into the Ops
25006 /// vector. If it is invalid, don't add anything to Ops.
25007 void X86TargetLowering::LowerAsmOperandForConstraint(SDValue Op,
25008 std::string &Constraint,
25009 std::vector<SDValue>&Ops,
25010 SelectionDAG &DAG) const {
25013 // Only support length 1 constraints for now.
25014 if (Constraint.length() > 1) return;
25016 char ConstraintLetter = Constraint[0];
25017 switch (ConstraintLetter) {
25020 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op)) {
25021 if (C->getZExtValue() <= 31) {
25022 Result = DAG.getTargetConstant(C->getZExtValue(), Op.getValueType());
25028 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op)) {
25029 if (C->getZExtValue() <= 63) {
25030 Result = DAG.getTargetConstant(C->getZExtValue(), Op.getValueType());
25036 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op)) {
25037 if (isInt<8>(C->getSExtValue())) {
25038 Result = DAG.getTargetConstant(C->getZExtValue(), Op.getValueType());
25044 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op)) {
25045 if (C->getZExtValue() <= 255) {
25046 Result = DAG.getTargetConstant(C->getZExtValue(), Op.getValueType());
25052 // 32-bit signed value
25053 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op)) {
25054 if (ConstantInt::isValueValidForType(Type::getInt32Ty(*DAG.getContext()),
25055 C->getSExtValue())) {
25056 // Widen to 64 bits here to get it sign extended.
25057 Result = DAG.getTargetConstant(C->getSExtValue(), MVT::i64);
25060 // FIXME gcc accepts some relocatable values here too, but only in certain
25061 // memory models; it's complicated.
25066 // 32-bit unsigned value
25067 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op)) {
25068 if (ConstantInt::isValueValidForType(Type::getInt32Ty(*DAG.getContext()),
25069 C->getZExtValue())) {
25070 Result = DAG.getTargetConstant(C->getZExtValue(), Op.getValueType());
25074 // FIXME gcc accepts some relocatable values here too, but only in certain
25075 // memory models; it's complicated.
25079 // Literal immediates are always ok.
25080 if (ConstantSDNode *CST = dyn_cast<ConstantSDNode>(Op)) {
25081 // Widen to 64 bits here to get it sign extended.
25082 Result = DAG.getTargetConstant(CST->getSExtValue(), MVT::i64);
25086 // In any sort of PIC mode addresses need to be computed at runtime by
25087 // adding in a register or some sort of table lookup. These can't
25088 // be used as immediates.
25089 if (Subtarget->isPICStyleGOT() || Subtarget->isPICStyleStubPIC())
25092 // If we are in non-pic codegen mode, we allow the address of a global (with
25093 // an optional displacement) to be used with 'i'.
25094 GlobalAddressSDNode *GA = nullptr;
25095 int64_t Offset = 0;
25097 // Match either (GA), (GA+C), (GA+C1+C2), etc.
25099 if ((GA = dyn_cast<GlobalAddressSDNode>(Op))) {
25100 Offset += GA->getOffset();
25102 } else if (Op.getOpcode() == ISD::ADD) {
25103 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op.getOperand(1))) {
25104 Offset += C->getZExtValue();
25105 Op = Op.getOperand(0);
25108 } else if (Op.getOpcode() == ISD::SUB) {
25109 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op.getOperand(1))) {
25110 Offset += -C->getZExtValue();
25111 Op = Op.getOperand(0);
25116 // Otherwise, this isn't something we can handle, reject it.
25120 const GlobalValue *GV = GA->getGlobal();
25121 // If we require an extra load to get this address, as in PIC mode, we
25122 // can't accept it.
25123 if (isGlobalStubReference(
25124 Subtarget->ClassifyGlobalReference(GV, DAG.getTarget())))
25127 Result = DAG.getTargetGlobalAddress(GV, SDLoc(Op),
25128 GA->getValueType(0), Offset);
25133 if (Result.getNode()) {
25134 Ops.push_back(Result);
25137 return TargetLowering::LowerAsmOperandForConstraint(Op, Constraint, Ops, DAG);
25140 std::pair<unsigned, const TargetRegisterClass*>
25141 X86TargetLowering::getRegForInlineAsmConstraint(const std::string &Constraint,
25143 // First, see if this is a constraint that directly corresponds to an LLVM
25145 if (Constraint.size() == 1) {
25146 // GCC Constraint Letters
25147 switch (Constraint[0]) {
25149 // TODO: Slight differences here in allocation order and leaving
25150 // RIP in the class. Do they matter any more here than they do
25151 // in the normal allocation?
25152 case 'q': // GENERAL_REGS in 64-bit mode, Q_REGS in 32-bit mode.
25153 if (Subtarget->is64Bit()) {
25154 if (VT == MVT::i32 || VT == MVT::f32)
25155 return std::make_pair(0U, &X86::GR32RegClass);
25156 if (VT == MVT::i16)
25157 return std::make_pair(0U, &X86::GR16RegClass);
25158 if (VT == MVT::i8 || VT == MVT::i1)
25159 return std::make_pair(0U, &X86::GR8RegClass);
25160 if (VT == MVT::i64 || VT == MVT::f64)
25161 return std::make_pair(0U, &X86::GR64RegClass);
25164 // 32-bit fallthrough
25165 case 'Q': // Q_REGS
25166 if (VT == MVT::i32 || VT == MVT::f32)
25167 return std::make_pair(0U, &X86::GR32_ABCDRegClass);
25168 if (VT == MVT::i16)
25169 return std::make_pair(0U, &X86::GR16_ABCDRegClass);
25170 if (VT == MVT::i8 || VT == MVT::i1)
25171 return std::make_pair(0U, &X86::GR8_ABCD_LRegClass);
25172 if (VT == MVT::i64)
25173 return std::make_pair(0U, &X86::GR64_ABCDRegClass);
25175 case 'r': // GENERAL_REGS
25176 case 'l': // INDEX_REGS
25177 if (VT == MVT::i8 || VT == MVT::i1)
25178 return std::make_pair(0U, &X86::GR8RegClass);
25179 if (VT == MVT::i16)
25180 return std::make_pair(0U, &X86::GR16RegClass);
25181 if (VT == MVT::i32 || VT == MVT::f32 || !Subtarget->is64Bit())
25182 return std::make_pair(0U, &X86::GR32RegClass);
25183 return std::make_pair(0U, &X86::GR64RegClass);
25184 case 'R': // LEGACY_REGS
25185 if (VT == MVT::i8 || VT == MVT::i1)
25186 return std::make_pair(0U, &X86::GR8_NOREXRegClass);
25187 if (VT == MVT::i16)
25188 return std::make_pair(0U, &X86::GR16_NOREXRegClass);
25189 if (VT == MVT::i32 || !Subtarget->is64Bit())
25190 return std::make_pair(0U, &X86::GR32_NOREXRegClass);
25191 return std::make_pair(0U, &X86::GR64_NOREXRegClass);
25192 case 'f': // FP Stack registers.
25193 // If SSE is enabled for this VT, use f80 to ensure the isel moves the
25194 // value to the correct fpstack register class.
25195 if (VT == MVT::f32 && !isScalarFPTypeInSSEReg(VT))
25196 return std::make_pair(0U, &X86::RFP32RegClass);
25197 if (VT == MVT::f64 && !isScalarFPTypeInSSEReg(VT))
25198 return std::make_pair(0U, &X86::RFP64RegClass);
25199 return std::make_pair(0U, &X86::RFP80RegClass);
25200 case 'y': // MMX_REGS if MMX allowed.
25201 if (!Subtarget->hasMMX()) break;
25202 return std::make_pair(0U, &X86::VR64RegClass);
25203 case 'Y': // SSE_REGS if SSE2 allowed
25204 if (!Subtarget->hasSSE2()) break;
25206 case 'x': // SSE_REGS if SSE1 allowed or AVX_REGS if AVX allowed
25207 if (!Subtarget->hasSSE1()) break;
25209 switch (VT.SimpleTy) {
25211 // Scalar SSE types.
25214 return std::make_pair(0U, &X86::FR32RegClass);
25217 return std::make_pair(0U, &X86::FR64RegClass);
25225 return std::make_pair(0U, &X86::VR128RegClass);
25233 return std::make_pair(0U, &X86::VR256RegClass);
25238 return std::make_pair(0U, &X86::VR512RegClass);
25244 // Use the default implementation in TargetLowering to convert the register
25245 // constraint into a member of a register class.
25246 std::pair<unsigned, const TargetRegisterClass*> Res;
25247 Res = TargetLowering::getRegForInlineAsmConstraint(Constraint, VT);
25249 // Not found as a standard register?
25251 // Map st(0) -> st(7) -> ST0
25252 if (Constraint.size() == 7 && Constraint[0] == '{' &&
25253 tolower(Constraint[1]) == 's' &&
25254 tolower(Constraint[2]) == 't' &&
25255 Constraint[3] == '(' &&
25256 (Constraint[4] >= '0' && Constraint[4] <= '7') &&
25257 Constraint[5] == ')' &&
25258 Constraint[6] == '}') {
25260 Res.first = X86::FP0+Constraint[4]-'0';
25261 Res.second = &X86::RFP80RegClass;
25265 // GCC allows "st(0)" to be called just plain "st".
25266 if (StringRef("{st}").equals_lower(Constraint)) {
25267 Res.first = X86::FP0;
25268 Res.second = &X86::RFP80RegClass;
25273 if (StringRef("{flags}").equals_lower(Constraint)) {
25274 Res.first = X86::EFLAGS;
25275 Res.second = &X86::CCRRegClass;
25279 // 'A' means EAX + EDX.
25280 if (Constraint == "A") {
25281 Res.first = X86::EAX;
25282 Res.second = &X86::GR32_ADRegClass;
25288 // Otherwise, check to see if this is a register class of the wrong value
25289 // type. For example, we want to map "{ax},i32" -> {eax}, we don't want it to
25290 // turn into {ax},{dx}.
25291 if (Res.second->hasType(VT))
25292 return Res; // Correct type already, nothing to do.
25294 // All of the single-register GCC register classes map their values onto
25295 // 16-bit register pieces "ax","dx","cx","bx","si","di","bp","sp". If we
25296 // really want an 8-bit or 32-bit register, map to the appropriate register
25297 // class and return the appropriate register.
25298 if (Res.second == &X86::GR16RegClass) {
25299 if (VT == MVT::i8 || VT == MVT::i1) {
25300 unsigned DestReg = 0;
25301 switch (Res.first) {
25303 case X86::AX: DestReg = X86::AL; break;
25304 case X86::DX: DestReg = X86::DL; break;
25305 case X86::CX: DestReg = X86::CL; break;
25306 case X86::BX: DestReg = X86::BL; break;
25309 Res.first = DestReg;
25310 Res.second = &X86::GR8RegClass;
25312 } else if (VT == MVT::i32 || VT == MVT::f32) {
25313 unsigned DestReg = 0;
25314 switch (Res.first) {
25316 case X86::AX: DestReg = X86::EAX; break;
25317 case X86::DX: DestReg = X86::EDX; break;
25318 case X86::CX: DestReg = X86::ECX; break;
25319 case X86::BX: DestReg = X86::EBX; break;
25320 case X86::SI: DestReg = X86::ESI; break;
25321 case X86::DI: DestReg = X86::EDI; break;
25322 case X86::BP: DestReg = X86::EBP; break;
25323 case X86::SP: DestReg = X86::ESP; break;
25326 Res.first = DestReg;
25327 Res.second = &X86::GR32RegClass;
25329 } else if (VT == MVT::i64 || VT == MVT::f64) {
25330 unsigned DestReg = 0;
25331 switch (Res.first) {
25333 case X86::AX: DestReg = X86::RAX; break;
25334 case X86::DX: DestReg = X86::RDX; break;
25335 case X86::CX: DestReg = X86::RCX; break;
25336 case X86::BX: DestReg = X86::RBX; break;
25337 case X86::SI: DestReg = X86::RSI; break;
25338 case X86::DI: DestReg = X86::RDI; break;
25339 case X86::BP: DestReg = X86::RBP; break;
25340 case X86::SP: DestReg = X86::RSP; break;
25343 Res.first = DestReg;
25344 Res.second = &X86::GR64RegClass;
25347 } else if (Res.second == &X86::FR32RegClass ||
25348 Res.second == &X86::FR64RegClass ||
25349 Res.second == &X86::VR128RegClass ||
25350 Res.second == &X86::VR256RegClass ||
25351 Res.second == &X86::FR32XRegClass ||
25352 Res.second == &X86::FR64XRegClass ||
25353 Res.second == &X86::VR128XRegClass ||
25354 Res.second == &X86::VR256XRegClass ||
25355 Res.second == &X86::VR512RegClass) {
25356 // Handle references to XMM physical registers that got mapped into the
25357 // wrong class. This can happen with constraints like {xmm0} where the
25358 // target independent register mapper will just pick the first match it can
25359 // find, ignoring the required type.
25361 if (VT == MVT::f32 || VT == MVT::i32)
25362 Res.second = &X86::FR32RegClass;
25363 else if (VT == MVT::f64 || VT == MVT::i64)
25364 Res.second = &X86::FR64RegClass;
25365 else if (X86::VR128RegClass.hasType(VT))
25366 Res.second = &X86::VR128RegClass;
25367 else if (X86::VR256RegClass.hasType(VT))
25368 Res.second = &X86::VR256RegClass;
25369 else if (X86::VR512RegClass.hasType(VT))
25370 Res.second = &X86::VR512RegClass;
25376 int X86TargetLowering::getScalingFactorCost(const AddrMode &AM,
25378 // Scaling factors are not free at all.
25379 // An indexed folded instruction, i.e., inst (reg1, reg2, scale),
25380 // will take 2 allocations in the out of order engine instead of 1
25381 // for plain addressing mode, i.e. inst (reg1).
25383 // vaddps (%rsi,%drx), %ymm0, %ymm1
25384 // Requires two allocations (one for the load, one for the computation)
25386 // vaddps (%rsi), %ymm0, %ymm1
25387 // Requires just 1 allocation, i.e., freeing allocations for other operations
25388 // and having less micro operations to execute.
25390 // For some X86 architectures, this is even worse because for instance for
25391 // stores, the complex addressing mode forces the instruction to use the
25392 // "load" ports instead of the dedicated "store" port.
25393 // E.g., on Haswell:
25394 // vmovaps %ymm1, (%r8, %rdi) can use port 2 or 3.
25395 // vmovaps %ymm1, (%r8) can use port 2, 3, or 7.
25396 if (isLegalAddressingMode(AM, Ty))
25397 // Scale represents reg2 * scale, thus account for 1
25398 // as soon as we use a second register.
25399 return AM.Scale != 0;
25403 bool X86TargetLowering::isTargetFTOL() const {
25404 return Subtarget->isTargetKnownWindowsMSVC() && !Subtarget->is64Bit();