1 //===-- X86ISelLowering.cpp - X86 DAG Lowering Implementation -------------===//
3 // The LLVM Compiler Infrastructure
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // This file defines the interfaces that X86 uses to lower LLVM code into a
13 //===----------------------------------------------------------------------===//
15 #include "X86ISelLowering.h"
16 #include "Utils/X86ShuffleDecode.h"
17 #include "X86CallingConv.h"
18 #include "X86InstrBuilder.h"
19 #include "X86MachineFunctionInfo.h"
20 #include "X86TargetMachine.h"
21 #include "X86TargetObjectFile.h"
22 #include "llvm/ADT/SmallBitVector.h"
23 #include "llvm/ADT/SmallSet.h"
24 #include "llvm/ADT/Statistic.h"
25 #include "llvm/ADT/StringExtras.h"
26 #include "llvm/ADT/StringSwitch.h"
27 #include "llvm/ADT/VariadicFunction.h"
28 #include "llvm/CodeGen/IntrinsicLowering.h"
29 #include "llvm/CodeGen/MachineFrameInfo.h"
30 #include "llvm/CodeGen/MachineFunction.h"
31 #include "llvm/CodeGen/MachineInstrBuilder.h"
32 #include "llvm/CodeGen/MachineJumpTableInfo.h"
33 #include "llvm/CodeGen/MachineModuleInfo.h"
34 #include "llvm/CodeGen/MachineRegisterInfo.h"
35 #include "llvm/IR/CallSite.h"
36 #include "llvm/IR/CallingConv.h"
37 #include "llvm/IR/Constants.h"
38 #include "llvm/IR/DerivedTypes.h"
39 #include "llvm/IR/Function.h"
40 #include "llvm/IR/GlobalAlias.h"
41 #include "llvm/IR/GlobalVariable.h"
42 #include "llvm/IR/Instructions.h"
43 #include "llvm/IR/Intrinsics.h"
44 #include "llvm/MC/MCAsmInfo.h"
45 #include "llvm/MC/MCContext.h"
46 #include "llvm/MC/MCExpr.h"
47 #include "llvm/MC/MCSymbol.h"
48 #include "llvm/Support/CommandLine.h"
49 #include "llvm/Support/Debug.h"
50 #include "llvm/Support/ErrorHandling.h"
51 #include "llvm/Support/MathExtras.h"
52 #include "llvm/Target/TargetOptions.h"
53 #include "X86IntrinsicsInfo.h"
59 #define DEBUG_TYPE "x86-isel"
61 STATISTIC(NumTailCalls, "Number of tail calls");
63 static cl::opt<bool> ExperimentalVectorWideningLegalization(
64 "x86-experimental-vector-widening-legalization", cl::init(false),
65 cl::desc("Enable an experimental vector type legalization through widening "
66 "rather than promotion."),
69 static cl::opt<bool> ExperimentalVectorShuffleLowering(
70 "x86-experimental-vector-shuffle-lowering", cl::init(false),
71 cl::desc("Enable an experimental vector shuffle lowering code path."),
74 // Forward declarations.
75 static SDValue getMOVL(SelectionDAG &DAG, SDLoc dl, EVT VT, SDValue V1,
78 static SDValue ExtractSubVector(SDValue Vec, unsigned IdxVal,
79 SelectionDAG &DAG, SDLoc dl,
80 unsigned vectorWidth) {
81 assert((vectorWidth == 128 || vectorWidth == 256) &&
82 "Unsupported vector width");
83 EVT VT = Vec.getValueType();
84 EVT ElVT = VT.getVectorElementType();
85 unsigned Factor = VT.getSizeInBits()/vectorWidth;
86 EVT ResultVT = EVT::getVectorVT(*DAG.getContext(), ElVT,
87 VT.getVectorNumElements()/Factor);
89 // Extract from UNDEF is UNDEF.
90 if (Vec.getOpcode() == ISD::UNDEF)
91 return DAG.getUNDEF(ResultVT);
93 // Extract the relevant vectorWidth bits. Generate an EXTRACT_SUBVECTOR
94 unsigned ElemsPerChunk = vectorWidth / ElVT.getSizeInBits();
96 // This is the index of the first element of the vectorWidth-bit chunk
98 unsigned NormalizedIdxVal = (((IdxVal * ElVT.getSizeInBits()) / vectorWidth)
101 // If the input is a buildvector just emit a smaller one.
102 if (Vec.getOpcode() == ISD::BUILD_VECTOR)
103 return DAG.getNode(ISD::BUILD_VECTOR, dl, ResultVT,
104 makeArrayRef(Vec->op_begin()+NormalizedIdxVal,
107 SDValue VecIdx = DAG.getIntPtrConstant(NormalizedIdxVal);
108 SDValue Result = DAG.getNode(ISD::EXTRACT_SUBVECTOR, dl, ResultVT, Vec,
114 /// Generate a DAG to grab 128-bits from a vector > 128 bits. This
115 /// sets things up to match to an AVX VEXTRACTF128 / VEXTRACTI128
116 /// or AVX-512 VEXTRACTF32x4 / VEXTRACTI32x4
117 /// instructions or a simple subregister reference. Idx is an index in the
118 /// 128 bits we want. It need not be aligned to a 128-bit bounday. That makes
119 /// lowering EXTRACT_VECTOR_ELT operations easier.
120 static SDValue Extract128BitVector(SDValue Vec, unsigned IdxVal,
121 SelectionDAG &DAG, SDLoc dl) {
122 assert((Vec.getValueType().is256BitVector() ||
123 Vec.getValueType().is512BitVector()) && "Unexpected vector size!");
124 return ExtractSubVector(Vec, IdxVal, DAG, dl, 128);
127 /// Generate a DAG to grab 256-bits from a 512-bit vector.
128 static SDValue Extract256BitVector(SDValue Vec, unsigned IdxVal,
129 SelectionDAG &DAG, SDLoc dl) {
130 assert(Vec.getValueType().is512BitVector() && "Unexpected vector size!");
131 return ExtractSubVector(Vec, IdxVal, DAG, dl, 256);
134 static SDValue InsertSubVector(SDValue Result, SDValue Vec,
135 unsigned IdxVal, SelectionDAG &DAG,
136 SDLoc dl, unsigned vectorWidth) {
137 assert((vectorWidth == 128 || vectorWidth == 256) &&
138 "Unsupported vector width");
139 // Inserting UNDEF is Result
140 if (Vec.getOpcode() == ISD::UNDEF)
142 EVT VT = Vec.getValueType();
143 EVT ElVT = VT.getVectorElementType();
144 EVT ResultVT = Result.getValueType();
146 // Insert the relevant vectorWidth bits.
147 unsigned ElemsPerChunk = vectorWidth/ElVT.getSizeInBits();
149 // This is the index of the first element of the vectorWidth-bit chunk
151 unsigned NormalizedIdxVal = (((IdxVal * ElVT.getSizeInBits())/vectorWidth)
154 SDValue VecIdx = DAG.getIntPtrConstant(NormalizedIdxVal);
155 return DAG.getNode(ISD::INSERT_SUBVECTOR, dl, ResultVT, Result, Vec,
158 /// Generate a DAG to put 128-bits into a vector > 128 bits. This
159 /// sets things up to match to an AVX VINSERTF128/VINSERTI128 or
160 /// AVX-512 VINSERTF32x4/VINSERTI32x4 instructions or a
161 /// simple superregister reference. Idx is an index in the 128 bits
162 /// we want. It need not be aligned to a 128-bit bounday. That makes
163 /// lowering INSERT_VECTOR_ELT operations easier.
164 static SDValue Insert128BitVector(SDValue Result, SDValue Vec,
165 unsigned IdxVal, SelectionDAG &DAG,
167 assert(Vec.getValueType().is128BitVector() && "Unexpected vector size!");
168 return InsertSubVector(Result, Vec, IdxVal, DAG, dl, 128);
171 static SDValue Insert256BitVector(SDValue Result, SDValue Vec,
172 unsigned IdxVal, SelectionDAG &DAG,
174 assert(Vec.getValueType().is256BitVector() && "Unexpected vector size!");
175 return InsertSubVector(Result, Vec, IdxVal, DAG, dl, 256);
178 /// Concat two 128-bit vectors into a 256 bit vector using VINSERTF128
179 /// instructions. This is used because creating CONCAT_VECTOR nodes of
180 /// BUILD_VECTORS returns a larger BUILD_VECTOR while we're trying to lower
181 /// large BUILD_VECTORS.
182 static SDValue Concat128BitVectors(SDValue V1, SDValue V2, EVT VT,
183 unsigned NumElems, SelectionDAG &DAG,
185 SDValue V = Insert128BitVector(DAG.getUNDEF(VT), V1, 0, DAG, dl);
186 return Insert128BitVector(V, V2, NumElems/2, DAG, dl);
189 static SDValue Concat256BitVectors(SDValue V1, SDValue V2, EVT VT,
190 unsigned NumElems, SelectionDAG &DAG,
192 SDValue V = Insert256BitVector(DAG.getUNDEF(VT), V1, 0, DAG, dl);
193 return Insert256BitVector(V, V2, NumElems/2, DAG, dl);
196 static TargetLoweringObjectFile *createTLOF(const Triple &TT) {
197 if (TT.isOSBinFormatMachO()) {
198 if (TT.getArch() == Triple::x86_64)
199 return new X86_64MachoTargetObjectFile();
200 return new TargetLoweringObjectFileMachO();
204 return new X86LinuxTargetObjectFile();
205 if (TT.isOSBinFormatELF())
206 return new TargetLoweringObjectFileELF();
207 if (TT.isKnownWindowsMSVCEnvironment())
208 return new X86WindowsTargetObjectFile();
209 if (TT.isOSBinFormatCOFF())
210 return new TargetLoweringObjectFileCOFF();
211 llvm_unreachable("unknown subtarget type");
214 // FIXME: This should stop caching the target machine as soon as
215 // we can remove resetOperationActions et al.
216 X86TargetLowering::X86TargetLowering(X86TargetMachine &TM)
217 : TargetLowering(TM, createTLOF(Triple(TM.getTargetTriple()))) {
218 Subtarget = &TM.getSubtarget<X86Subtarget>();
219 X86ScalarSSEf64 = Subtarget->hasSSE2();
220 X86ScalarSSEf32 = Subtarget->hasSSE1();
221 TD = getDataLayout();
223 resetOperationActions();
226 void X86TargetLowering::resetOperationActions() {
227 const TargetMachine &TM = getTargetMachine();
228 static bool FirstTimeThrough = true;
230 // If none of the target options have changed, then we don't need to reset the
231 // operation actions.
232 if (!FirstTimeThrough && TO == TM.Options) return;
234 if (!FirstTimeThrough) {
235 // Reinitialize the actions.
237 FirstTimeThrough = false;
242 // Set up the TargetLowering object.
243 static const MVT IntVTs[] = { MVT::i8, MVT::i16, MVT::i32, MVT::i64 };
245 // X86 is weird, it always uses i8 for shift amounts and setcc results.
246 setBooleanContents(ZeroOrOneBooleanContent);
247 // X86-SSE is even stranger. It uses -1 or 0 for vector masks.
248 setBooleanVectorContents(ZeroOrNegativeOneBooleanContent);
250 // For 64-bit since we have so many registers use the ILP scheduler, for
251 // 32-bit code use the register pressure specific scheduling.
252 // For Atom, always use ILP scheduling.
253 if (Subtarget->isAtom())
254 setSchedulingPreference(Sched::ILP);
255 else if (Subtarget->is64Bit())
256 setSchedulingPreference(Sched::ILP);
258 setSchedulingPreference(Sched::RegPressure);
259 const X86RegisterInfo *RegInfo =
260 TM.getSubtarget<X86Subtarget>().getRegisterInfo();
261 setStackPointerRegisterToSaveRestore(RegInfo->getStackRegister());
263 // Bypass expensive divides on Atom when compiling with O2
264 if (Subtarget->hasSlowDivide() && TM.getOptLevel() >= CodeGenOpt::Default) {
265 addBypassSlowDiv(32, 8);
266 if (Subtarget->is64Bit())
267 addBypassSlowDiv(64, 16);
270 if (Subtarget->isTargetKnownWindowsMSVC()) {
271 // Setup Windows compiler runtime calls.
272 setLibcallName(RTLIB::SDIV_I64, "_alldiv");
273 setLibcallName(RTLIB::UDIV_I64, "_aulldiv");
274 setLibcallName(RTLIB::SREM_I64, "_allrem");
275 setLibcallName(RTLIB::UREM_I64, "_aullrem");
276 setLibcallName(RTLIB::MUL_I64, "_allmul");
277 setLibcallCallingConv(RTLIB::SDIV_I64, CallingConv::X86_StdCall);
278 setLibcallCallingConv(RTLIB::UDIV_I64, CallingConv::X86_StdCall);
279 setLibcallCallingConv(RTLIB::SREM_I64, CallingConv::X86_StdCall);
280 setLibcallCallingConv(RTLIB::UREM_I64, CallingConv::X86_StdCall);
281 setLibcallCallingConv(RTLIB::MUL_I64, CallingConv::X86_StdCall);
283 // The _ftol2 runtime function has an unusual calling conv, which
284 // is modeled by a special pseudo-instruction.
285 setLibcallName(RTLIB::FPTOUINT_F64_I64, nullptr);
286 setLibcallName(RTLIB::FPTOUINT_F32_I64, nullptr);
287 setLibcallName(RTLIB::FPTOUINT_F64_I32, nullptr);
288 setLibcallName(RTLIB::FPTOUINT_F32_I32, nullptr);
291 if (Subtarget->isTargetDarwin()) {
292 // Darwin should use _setjmp/_longjmp instead of setjmp/longjmp.
293 setUseUnderscoreSetJmp(false);
294 setUseUnderscoreLongJmp(false);
295 } else if (Subtarget->isTargetWindowsGNU()) {
296 // MS runtime is weird: it exports _setjmp, but longjmp!
297 setUseUnderscoreSetJmp(true);
298 setUseUnderscoreLongJmp(false);
300 setUseUnderscoreSetJmp(true);
301 setUseUnderscoreLongJmp(true);
304 // Set up the register classes.
305 addRegisterClass(MVT::i8, &X86::GR8RegClass);
306 addRegisterClass(MVT::i16, &X86::GR16RegClass);
307 addRegisterClass(MVT::i32, &X86::GR32RegClass);
308 if (Subtarget->is64Bit())
309 addRegisterClass(MVT::i64, &X86::GR64RegClass);
311 setLoadExtAction(ISD::SEXTLOAD, MVT::i1, Promote);
313 // We don't accept any truncstore of integer registers.
314 setTruncStoreAction(MVT::i64, MVT::i32, Expand);
315 setTruncStoreAction(MVT::i64, MVT::i16, Expand);
316 setTruncStoreAction(MVT::i64, MVT::i8 , Expand);
317 setTruncStoreAction(MVT::i32, MVT::i16, Expand);
318 setTruncStoreAction(MVT::i32, MVT::i8 , Expand);
319 setTruncStoreAction(MVT::i16, MVT::i8, Expand);
321 setTruncStoreAction(MVT::f64, MVT::f32, Expand);
323 // SETOEQ and SETUNE require checking two conditions.
324 setCondCodeAction(ISD::SETOEQ, MVT::f32, Expand);
325 setCondCodeAction(ISD::SETOEQ, MVT::f64, Expand);
326 setCondCodeAction(ISD::SETOEQ, MVT::f80, Expand);
327 setCondCodeAction(ISD::SETUNE, MVT::f32, Expand);
328 setCondCodeAction(ISD::SETUNE, MVT::f64, Expand);
329 setCondCodeAction(ISD::SETUNE, MVT::f80, Expand);
331 // Promote all UINT_TO_FP to larger SINT_TO_FP's, as X86 doesn't have this
333 setOperationAction(ISD::UINT_TO_FP , MVT::i1 , Promote);
334 setOperationAction(ISD::UINT_TO_FP , MVT::i8 , Promote);
335 setOperationAction(ISD::UINT_TO_FP , MVT::i16 , Promote);
337 if (Subtarget->is64Bit()) {
338 setOperationAction(ISD::UINT_TO_FP , MVT::i32 , Promote);
339 setOperationAction(ISD::UINT_TO_FP , MVT::i64 , Custom);
340 } else if (!TM.Options.UseSoftFloat) {
341 // We have an algorithm for SSE2->double, and we turn this into a
342 // 64-bit FILD followed by conditional FADD for other targets.
343 setOperationAction(ISD::UINT_TO_FP , MVT::i64 , Custom);
344 // We have an algorithm for SSE2, and we turn this into a 64-bit
345 // FILD for other targets.
346 setOperationAction(ISD::UINT_TO_FP , MVT::i32 , Custom);
349 // Promote i1/i8 SINT_TO_FP to larger SINT_TO_FP's, as X86 doesn't have
351 setOperationAction(ISD::SINT_TO_FP , MVT::i1 , Promote);
352 setOperationAction(ISD::SINT_TO_FP , MVT::i8 , Promote);
354 if (!TM.Options.UseSoftFloat) {
355 // SSE has no i16 to fp conversion, only i32
356 if (X86ScalarSSEf32) {
357 setOperationAction(ISD::SINT_TO_FP , MVT::i16 , Promote);
358 // f32 and f64 cases are Legal, f80 case is not
359 setOperationAction(ISD::SINT_TO_FP , MVT::i32 , Custom);
361 setOperationAction(ISD::SINT_TO_FP , MVT::i16 , Custom);
362 setOperationAction(ISD::SINT_TO_FP , MVT::i32 , Custom);
365 setOperationAction(ISD::SINT_TO_FP , MVT::i16 , Promote);
366 setOperationAction(ISD::SINT_TO_FP , MVT::i32 , Promote);
369 // In 32-bit mode these are custom lowered. In 64-bit mode F32 and F64
370 // are Legal, f80 is custom lowered.
371 setOperationAction(ISD::FP_TO_SINT , MVT::i64 , Custom);
372 setOperationAction(ISD::SINT_TO_FP , MVT::i64 , Custom);
374 // Promote i1/i8 FP_TO_SINT to larger FP_TO_SINTS's, as X86 doesn't have
376 setOperationAction(ISD::FP_TO_SINT , MVT::i1 , Promote);
377 setOperationAction(ISD::FP_TO_SINT , MVT::i8 , Promote);
379 if (X86ScalarSSEf32) {
380 setOperationAction(ISD::FP_TO_SINT , MVT::i16 , Promote);
381 // f32 and f64 cases are Legal, f80 case is not
382 setOperationAction(ISD::FP_TO_SINT , MVT::i32 , Custom);
384 setOperationAction(ISD::FP_TO_SINT , MVT::i16 , Custom);
385 setOperationAction(ISD::FP_TO_SINT , MVT::i32 , Custom);
388 // Handle FP_TO_UINT by promoting the destination to a larger signed
390 setOperationAction(ISD::FP_TO_UINT , MVT::i1 , Promote);
391 setOperationAction(ISD::FP_TO_UINT , MVT::i8 , Promote);
392 setOperationAction(ISD::FP_TO_UINT , MVT::i16 , Promote);
394 if (Subtarget->is64Bit()) {
395 setOperationAction(ISD::FP_TO_UINT , MVT::i64 , Expand);
396 setOperationAction(ISD::FP_TO_UINT , MVT::i32 , Promote);
397 } else if (!TM.Options.UseSoftFloat) {
398 // Since AVX is a superset of SSE3, only check for SSE here.
399 if (Subtarget->hasSSE1() && !Subtarget->hasSSE3())
400 // Expand FP_TO_UINT into a select.
401 // FIXME: We would like to use a Custom expander here eventually to do
402 // the optimal thing for SSE vs. the default expansion in the legalizer.
403 setOperationAction(ISD::FP_TO_UINT , MVT::i32 , Expand);
405 // With SSE3 we can use fisttpll to convert to a signed i64; without
406 // SSE, we're stuck with a fistpll.
407 setOperationAction(ISD::FP_TO_UINT , MVT::i32 , Custom);
410 if (isTargetFTOL()) {
411 // Use the _ftol2 runtime function, which has a pseudo-instruction
412 // to handle its weird calling convention.
413 setOperationAction(ISD::FP_TO_UINT , MVT::i64 , Custom);
416 // TODO: when we have SSE, these could be more efficient, by using movd/movq.
417 if (!X86ScalarSSEf64) {
418 setOperationAction(ISD::BITCAST , MVT::f32 , Expand);
419 setOperationAction(ISD::BITCAST , MVT::i32 , Expand);
420 if (Subtarget->is64Bit()) {
421 setOperationAction(ISD::BITCAST , MVT::f64 , Expand);
422 // Without SSE, i64->f64 goes through memory.
423 setOperationAction(ISD::BITCAST , MVT::i64 , Expand);
427 // Scalar integer divide and remainder are lowered to use operations that
428 // produce two results, to match the available instructions. This exposes
429 // the two-result form to trivial CSE, which is able to combine x/y and x%y
430 // into a single instruction.
432 // Scalar integer multiply-high is also lowered to use two-result
433 // operations, to match the available instructions. However, plain multiply
434 // (low) operations are left as Legal, as there are single-result
435 // instructions for this in x86. Using the two-result multiply instructions
436 // when both high and low results are needed must be arranged by dagcombine.
437 for (unsigned i = 0; i != array_lengthof(IntVTs); ++i) {
439 setOperationAction(ISD::MULHS, VT, Expand);
440 setOperationAction(ISD::MULHU, VT, Expand);
441 setOperationAction(ISD::SDIV, VT, Expand);
442 setOperationAction(ISD::UDIV, VT, Expand);
443 setOperationAction(ISD::SREM, VT, Expand);
444 setOperationAction(ISD::UREM, VT, Expand);
446 // Add/Sub overflow ops with MVT::Glues are lowered to EFLAGS dependences.
447 setOperationAction(ISD::ADDC, VT, Custom);
448 setOperationAction(ISD::ADDE, VT, Custom);
449 setOperationAction(ISD::SUBC, VT, Custom);
450 setOperationAction(ISD::SUBE, VT, Custom);
453 setOperationAction(ISD::BR_JT , MVT::Other, Expand);
454 setOperationAction(ISD::BRCOND , MVT::Other, Custom);
455 setOperationAction(ISD::BR_CC , MVT::f32, Expand);
456 setOperationAction(ISD::BR_CC , MVT::f64, Expand);
457 setOperationAction(ISD::BR_CC , MVT::f80, Expand);
458 setOperationAction(ISD::BR_CC , MVT::i8, Expand);
459 setOperationAction(ISD::BR_CC , MVT::i16, Expand);
460 setOperationAction(ISD::BR_CC , MVT::i32, Expand);
461 setOperationAction(ISD::BR_CC , MVT::i64, Expand);
462 setOperationAction(ISD::SELECT_CC , MVT::f32, Expand);
463 setOperationAction(ISD::SELECT_CC , MVT::f64, Expand);
464 setOperationAction(ISD::SELECT_CC , MVT::f80, Expand);
465 setOperationAction(ISD::SELECT_CC , MVT::i8, Expand);
466 setOperationAction(ISD::SELECT_CC , MVT::i16, Expand);
467 setOperationAction(ISD::SELECT_CC , MVT::i32, Expand);
468 setOperationAction(ISD::SELECT_CC , MVT::i64, Expand);
469 if (Subtarget->is64Bit())
470 setOperationAction(ISD::SIGN_EXTEND_INREG, MVT::i32, Legal);
471 setOperationAction(ISD::SIGN_EXTEND_INREG, MVT::i16 , Legal);
472 setOperationAction(ISD::SIGN_EXTEND_INREG, MVT::i8 , Legal);
473 setOperationAction(ISD::SIGN_EXTEND_INREG, MVT::i1 , Expand);
474 setOperationAction(ISD::FP_ROUND_INREG , MVT::f32 , Expand);
475 setOperationAction(ISD::FREM , MVT::f32 , Expand);
476 setOperationAction(ISD::FREM , MVT::f64 , Expand);
477 setOperationAction(ISD::FREM , MVT::f80 , Expand);
478 setOperationAction(ISD::FLT_ROUNDS_ , MVT::i32 , Custom);
480 // Promote the i8 variants and force them on up to i32 which has a shorter
482 setOperationAction(ISD::CTTZ , MVT::i8 , Promote);
483 AddPromotedToType (ISD::CTTZ , MVT::i8 , MVT::i32);
484 setOperationAction(ISD::CTTZ_ZERO_UNDEF , MVT::i8 , Promote);
485 AddPromotedToType (ISD::CTTZ_ZERO_UNDEF , MVT::i8 , MVT::i32);
486 if (Subtarget->hasBMI()) {
487 setOperationAction(ISD::CTTZ_ZERO_UNDEF, MVT::i16 , Expand);
488 setOperationAction(ISD::CTTZ_ZERO_UNDEF, MVT::i32 , Expand);
489 if (Subtarget->is64Bit())
490 setOperationAction(ISD::CTTZ_ZERO_UNDEF, MVT::i64, Expand);
492 setOperationAction(ISD::CTTZ , MVT::i16 , Custom);
493 setOperationAction(ISD::CTTZ , MVT::i32 , Custom);
494 if (Subtarget->is64Bit())
495 setOperationAction(ISD::CTTZ , MVT::i64 , Custom);
498 if (Subtarget->hasLZCNT()) {
499 // When promoting the i8 variants, force them to i32 for a shorter
501 setOperationAction(ISD::CTLZ , MVT::i8 , Promote);
502 AddPromotedToType (ISD::CTLZ , MVT::i8 , MVT::i32);
503 setOperationAction(ISD::CTLZ_ZERO_UNDEF, MVT::i8 , Promote);
504 AddPromotedToType (ISD::CTLZ_ZERO_UNDEF, MVT::i8 , MVT::i32);
505 setOperationAction(ISD::CTLZ_ZERO_UNDEF, MVT::i16 , Expand);
506 setOperationAction(ISD::CTLZ_ZERO_UNDEF, MVT::i32 , Expand);
507 if (Subtarget->is64Bit())
508 setOperationAction(ISD::CTLZ_ZERO_UNDEF, MVT::i64, Expand);
510 setOperationAction(ISD::CTLZ , MVT::i8 , Custom);
511 setOperationAction(ISD::CTLZ , MVT::i16 , Custom);
512 setOperationAction(ISD::CTLZ , MVT::i32 , Custom);
513 setOperationAction(ISD::CTLZ_ZERO_UNDEF, MVT::i8 , Custom);
514 setOperationAction(ISD::CTLZ_ZERO_UNDEF, MVT::i16 , Custom);
515 setOperationAction(ISD::CTLZ_ZERO_UNDEF, MVT::i32 , Custom);
516 if (Subtarget->is64Bit()) {
517 setOperationAction(ISD::CTLZ , MVT::i64 , Custom);
518 setOperationAction(ISD::CTLZ_ZERO_UNDEF, MVT::i64, Custom);
522 // Special handling for half-precision floating point conversions.
523 // If we don't have F16C support, then lower half float conversions
524 // into library calls.
525 if (TM.Options.UseSoftFloat || !Subtarget->hasF16C()) {
526 setOperationAction(ISD::FP16_TO_FP, MVT::f32, Expand);
527 setOperationAction(ISD::FP_TO_FP16, MVT::f32, Expand);
530 // There's never any support for operations beyond MVT::f32.
531 setOperationAction(ISD::FP16_TO_FP, MVT::f64, Expand);
532 setOperationAction(ISD::FP16_TO_FP, MVT::f80, Expand);
533 setOperationAction(ISD::FP_TO_FP16, MVT::f64, Expand);
534 setOperationAction(ISD::FP_TO_FP16, MVT::f80, Expand);
536 setLoadExtAction(ISD::EXTLOAD, MVT::f16, Expand);
537 setTruncStoreAction(MVT::f32, MVT::f16, Expand);
538 setTruncStoreAction(MVT::f64, MVT::f16, Expand);
539 setTruncStoreAction(MVT::f80, MVT::f16, Expand);
541 if (Subtarget->hasPOPCNT()) {
542 setOperationAction(ISD::CTPOP , MVT::i8 , Promote);
544 setOperationAction(ISD::CTPOP , MVT::i8 , Expand);
545 setOperationAction(ISD::CTPOP , MVT::i16 , Expand);
546 setOperationAction(ISD::CTPOP , MVT::i32 , Expand);
547 if (Subtarget->is64Bit())
548 setOperationAction(ISD::CTPOP , MVT::i64 , Expand);
551 setOperationAction(ISD::READCYCLECOUNTER , MVT::i64 , Custom);
553 if (!Subtarget->hasMOVBE())
554 setOperationAction(ISD::BSWAP , MVT::i16 , Expand);
556 // These should be promoted to a larger select which is supported.
557 setOperationAction(ISD::SELECT , MVT::i1 , Promote);
558 // X86 wants to expand cmov itself.
559 setOperationAction(ISD::SELECT , MVT::i8 , Custom);
560 setOperationAction(ISD::SELECT , MVT::i16 , Custom);
561 setOperationAction(ISD::SELECT , MVT::i32 , Custom);
562 setOperationAction(ISD::SELECT , MVT::f32 , Custom);
563 setOperationAction(ISD::SELECT , MVT::f64 , Custom);
564 setOperationAction(ISD::SELECT , MVT::f80 , Custom);
565 setOperationAction(ISD::SETCC , MVT::i8 , Custom);
566 setOperationAction(ISD::SETCC , MVT::i16 , Custom);
567 setOperationAction(ISD::SETCC , MVT::i32 , Custom);
568 setOperationAction(ISD::SETCC , MVT::f32 , Custom);
569 setOperationAction(ISD::SETCC , MVT::f64 , Custom);
570 setOperationAction(ISD::SETCC , MVT::f80 , Custom);
571 if (Subtarget->is64Bit()) {
572 setOperationAction(ISD::SELECT , MVT::i64 , Custom);
573 setOperationAction(ISD::SETCC , MVT::i64 , Custom);
575 setOperationAction(ISD::EH_RETURN , MVT::Other, Custom);
576 // NOTE: EH_SJLJ_SETJMP/_LONGJMP supported here is NOT intended to support
577 // SjLj exception handling but a light-weight setjmp/longjmp replacement to
578 // support continuation, user-level threading, and etc.. As a result, no
579 // other SjLj exception interfaces are implemented and please don't build
580 // your own exception handling based on them.
581 // LLVM/Clang supports zero-cost DWARF exception handling.
582 setOperationAction(ISD::EH_SJLJ_SETJMP, MVT::i32, Custom);
583 setOperationAction(ISD::EH_SJLJ_LONGJMP, MVT::Other, Custom);
586 setOperationAction(ISD::ConstantPool , MVT::i32 , Custom);
587 setOperationAction(ISD::JumpTable , MVT::i32 , Custom);
588 setOperationAction(ISD::GlobalAddress , MVT::i32 , Custom);
589 setOperationAction(ISD::GlobalTLSAddress, MVT::i32 , Custom);
590 if (Subtarget->is64Bit())
591 setOperationAction(ISD::GlobalTLSAddress, MVT::i64, Custom);
592 setOperationAction(ISD::ExternalSymbol , MVT::i32 , Custom);
593 setOperationAction(ISD::BlockAddress , MVT::i32 , Custom);
594 if (Subtarget->is64Bit()) {
595 setOperationAction(ISD::ConstantPool , MVT::i64 , Custom);
596 setOperationAction(ISD::JumpTable , MVT::i64 , Custom);
597 setOperationAction(ISD::GlobalAddress , MVT::i64 , Custom);
598 setOperationAction(ISD::ExternalSymbol, MVT::i64 , Custom);
599 setOperationAction(ISD::BlockAddress , MVT::i64 , Custom);
601 // 64-bit addm sub, shl, sra, srl (iff 32-bit x86)
602 setOperationAction(ISD::SHL_PARTS , MVT::i32 , Custom);
603 setOperationAction(ISD::SRA_PARTS , MVT::i32 , Custom);
604 setOperationAction(ISD::SRL_PARTS , MVT::i32 , Custom);
605 if (Subtarget->is64Bit()) {
606 setOperationAction(ISD::SHL_PARTS , MVT::i64 , Custom);
607 setOperationAction(ISD::SRA_PARTS , MVT::i64 , Custom);
608 setOperationAction(ISD::SRL_PARTS , MVT::i64 , Custom);
611 if (Subtarget->hasSSE1())
612 setOperationAction(ISD::PREFETCH , MVT::Other, Legal);
614 setOperationAction(ISD::ATOMIC_FENCE , MVT::Other, Custom);
616 // Expand certain atomics
617 for (unsigned i = 0; i != array_lengthof(IntVTs); ++i) {
619 setOperationAction(ISD::ATOMIC_CMP_SWAP_WITH_SUCCESS, VT, Custom);
620 setOperationAction(ISD::ATOMIC_LOAD_SUB, VT, Custom);
621 setOperationAction(ISD::ATOMIC_STORE, VT, Custom);
624 if (Subtarget->hasCmpxchg16b()) {
625 setOperationAction(ISD::ATOMIC_CMP_SWAP_WITH_SUCCESS, MVT::i128, Custom);
628 // FIXME - use subtarget debug flags
629 if (!Subtarget->isTargetDarwin() && !Subtarget->isTargetELF() &&
630 !Subtarget->isTargetCygMing() && !Subtarget->isTargetWin64()) {
631 setOperationAction(ISD::EH_LABEL, MVT::Other, Expand);
634 if (Subtarget->is64Bit()) {
635 setExceptionPointerRegister(X86::RAX);
636 setExceptionSelectorRegister(X86::RDX);
638 setExceptionPointerRegister(X86::EAX);
639 setExceptionSelectorRegister(X86::EDX);
641 setOperationAction(ISD::FRAME_TO_ARGS_OFFSET, MVT::i32, Custom);
642 setOperationAction(ISD::FRAME_TO_ARGS_OFFSET, MVT::i64, Custom);
644 setOperationAction(ISD::INIT_TRAMPOLINE, MVT::Other, Custom);
645 setOperationAction(ISD::ADJUST_TRAMPOLINE, MVT::Other, Custom);
647 setOperationAction(ISD::TRAP, MVT::Other, Legal);
648 setOperationAction(ISD::DEBUGTRAP, MVT::Other, Legal);
650 // VASTART needs to be custom lowered to use the VarArgsFrameIndex
651 setOperationAction(ISD::VASTART , MVT::Other, Custom);
652 setOperationAction(ISD::VAEND , MVT::Other, Expand);
653 if (Subtarget->is64Bit() && !Subtarget->isTargetWin64()) {
654 // TargetInfo::X86_64ABIBuiltinVaList
655 setOperationAction(ISD::VAARG , MVT::Other, Custom);
656 setOperationAction(ISD::VACOPY , MVT::Other, Custom);
658 // TargetInfo::CharPtrBuiltinVaList
659 setOperationAction(ISD::VAARG , MVT::Other, Expand);
660 setOperationAction(ISD::VACOPY , MVT::Other, Expand);
663 setOperationAction(ISD::STACKSAVE, MVT::Other, Expand);
664 setOperationAction(ISD::STACKRESTORE, MVT::Other, Expand);
666 setOperationAction(ISD::DYNAMIC_STACKALLOC, getPointerTy(), Custom);
668 if (!TM.Options.UseSoftFloat && X86ScalarSSEf64) {
669 // f32 and f64 use SSE.
670 // Set up the FP register classes.
671 addRegisterClass(MVT::f32, &X86::FR32RegClass);
672 addRegisterClass(MVT::f64, &X86::FR64RegClass);
674 // Use ANDPD to simulate FABS.
675 setOperationAction(ISD::FABS , MVT::f64, Custom);
676 setOperationAction(ISD::FABS , MVT::f32, Custom);
678 // Use XORP to simulate FNEG.
679 setOperationAction(ISD::FNEG , MVT::f64, Custom);
680 setOperationAction(ISD::FNEG , MVT::f32, Custom);
682 // Use ANDPD and ORPD to simulate FCOPYSIGN.
683 setOperationAction(ISD::FCOPYSIGN, MVT::f64, Custom);
684 setOperationAction(ISD::FCOPYSIGN, MVT::f32, Custom);
686 // Lower this to FGETSIGNx86 plus an AND.
687 setOperationAction(ISD::FGETSIGN, MVT::i64, Custom);
688 setOperationAction(ISD::FGETSIGN, MVT::i32, Custom);
690 // We don't support sin/cos/fmod
691 setOperationAction(ISD::FSIN , MVT::f64, Expand);
692 setOperationAction(ISD::FCOS , MVT::f64, Expand);
693 setOperationAction(ISD::FSINCOS, MVT::f64, Expand);
694 setOperationAction(ISD::FSIN , MVT::f32, Expand);
695 setOperationAction(ISD::FCOS , MVT::f32, Expand);
696 setOperationAction(ISD::FSINCOS, MVT::f32, Expand);
698 // Expand FP immediates into loads from the stack, except for the special
700 addLegalFPImmediate(APFloat(+0.0)); // xorpd
701 addLegalFPImmediate(APFloat(+0.0f)); // xorps
702 } else if (!TM.Options.UseSoftFloat && X86ScalarSSEf32) {
703 // Use SSE for f32, x87 for f64.
704 // Set up the FP register classes.
705 addRegisterClass(MVT::f32, &X86::FR32RegClass);
706 addRegisterClass(MVT::f64, &X86::RFP64RegClass);
708 // Use ANDPS to simulate FABS.
709 setOperationAction(ISD::FABS , MVT::f32, Custom);
711 // Use XORP to simulate FNEG.
712 setOperationAction(ISD::FNEG , MVT::f32, Custom);
714 setOperationAction(ISD::UNDEF, MVT::f64, Expand);
716 // Use ANDPS and ORPS to simulate FCOPYSIGN.
717 setOperationAction(ISD::FCOPYSIGN, MVT::f64, Expand);
718 setOperationAction(ISD::FCOPYSIGN, MVT::f32, Custom);
720 // We don't support sin/cos/fmod
721 setOperationAction(ISD::FSIN , MVT::f32, Expand);
722 setOperationAction(ISD::FCOS , MVT::f32, Expand);
723 setOperationAction(ISD::FSINCOS, MVT::f32, Expand);
725 // Special cases we handle for FP constants.
726 addLegalFPImmediate(APFloat(+0.0f)); // xorps
727 addLegalFPImmediate(APFloat(+0.0)); // FLD0
728 addLegalFPImmediate(APFloat(+1.0)); // FLD1
729 addLegalFPImmediate(APFloat(-0.0)); // FLD0/FCHS
730 addLegalFPImmediate(APFloat(-1.0)); // FLD1/FCHS
732 if (!TM.Options.UnsafeFPMath) {
733 setOperationAction(ISD::FSIN , MVT::f64, Expand);
734 setOperationAction(ISD::FCOS , MVT::f64, Expand);
735 setOperationAction(ISD::FSINCOS, MVT::f64, Expand);
737 } else if (!TM.Options.UseSoftFloat) {
738 // f32 and f64 in x87.
739 // Set up the FP register classes.
740 addRegisterClass(MVT::f64, &X86::RFP64RegClass);
741 addRegisterClass(MVT::f32, &X86::RFP32RegClass);
743 setOperationAction(ISD::UNDEF, MVT::f64, Expand);
744 setOperationAction(ISD::UNDEF, MVT::f32, Expand);
745 setOperationAction(ISD::FCOPYSIGN, MVT::f64, Expand);
746 setOperationAction(ISD::FCOPYSIGN, MVT::f32, Expand);
748 if (!TM.Options.UnsafeFPMath) {
749 setOperationAction(ISD::FSIN , MVT::f64, Expand);
750 setOperationAction(ISD::FSIN , MVT::f32, Expand);
751 setOperationAction(ISD::FCOS , MVT::f64, Expand);
752 setOperationAction(ISD::FCOS , MVT::f32, Expand);
753 setOperationAction(ISD::FSINCOS, MVT::f64, Expand);
754 setOperationAction(ISD::FSINCOS, MVT::f32, Expand);
756 addLegalFPImmediate(APFloat(+0.0)); // FLD0
757 addLegalFPImmediate(APFloat(+1.0)); // FLD1
758 addLegalFPImmediate(APFloat(-0.0)); // FLD0/FCHS
759 addLegalFPImmediate(APFloat(-1.0)); // FLD1/FCHS
760 addLegalFPImmediate(APFloat(+0.0f)); // FLD0
761 addLegalFPImmediate(APFloat(+1.0f)); // FLD1
762 addLegalFPImmediate(APFloat(-0.0f)); // FLD0/FCHS
763 addLegalFPImmediate(APFloat(-1.0f)); // FLD1/FCHS
766 // We don't support FMA.
767 setOperationAction(ISD::FMA, MVT::f64, Expand);
768 setOperationAction(ISD::FMA, MVT::f32, Expand);
770 // Long double always uses X87.
771 if (!TM.Options.UseSoftFloat) {
772 addRegisterClass(MVT::f80, &X86::RFP80RegClass);
773 setOperationAction(ISD::UNDEF, MVT::f80, Expand);
774 setOperationAction(ISD::FCOPYSIGN, MVT::f80, Expand);
776 APFloat TmpFlt = APFloat::getZero(APFloat::x87DoubleExtended);
777 addLegalFPImmediate(TmpFlt); // FLD0
779 addLegalFPImmediate(TmpFlt); // FLD0/FCHS
782 APFloat TmpFlt2(+1.0);
783 TmpFlt2.convert(APFloat::x87DoubleExtended, APFloat::rmNearestTiesToEven,
785 addLegalFPImmediate(TmpFlt2); // FLD1
786 TmpFlt2.changeSign();
787 addLegalFPImmediate(TmpFlt2); // FLD1/FCHS
790 if (!TM.Options.UnsafeFPMath) {
791 setOperationAction(ISD::FSIN , MVT::f80, Expand);
792 setOperationAction(ISD::FCOS , MVT::f80, Expand);
793 setOperationAction(ISD::FSINCOS, MVT::f80, Expand);
796 setOperationAction(ISD::FFLOOR, MVT::f80, Expand);
797 setOperationAction(ISD::FCEIL, MVT::f80, Expand);
798 setOperationAction(ISD::FTRUNC, MVT::f80, Expand);
799 setOperationAction(ISD::FRINT, MVT::f80, Expand);
800 setOperationAction(ISD::FNEARBYINT, MVT::f80, Expand);
801 setOperationAction(ISD::FMA, MVT::f80, Expand);
804 // Always use a library call for pow.
805 setOperationAction(ISD::FPOW , MVT::f32 , Expand);
806 setOperationAction(ISD::FPOW , MVT::f64 , Expand);
807 setOperationAction(ISD::FPOW , MVT::f80 , Expand);
809 setOperationAction(ISD::FLOG, MVT::f80, Expand);
810 setOperationAction(ISD::FLOG2, MVT::f80, Expand);
811 setOperationAction(ISD::FLOG10, MVT::f80, Expand);
812 setOperationAction(ISD::FEXP, MVT::f80, Expand);
813 setOperationAction(ISD::FEXP2, MVT::f80, Expand);
815 // First set operation action for all vector types to either promote
816 // (for widening) or expand (for scalarization). Then we will selectively
817 // turn on ones that can be effectively codegen'd.
818 for (int i = MVT::FIRST_VECTOR_VALUETYPE;
819 i <= MVT::LAST_VECTOR_VALUETYPE; ++i) {
820 MVT VT = (MVT::SimpleValueType)i;
821 setOperationAction(ISD::ADD , VT, Expand);
822 setOperationAction(ISD::SUB , VT, Expand);
823 setOperationAction(ISD::FADD, VT, Expand);
824 setOperationAction(ISD::FNEG, VT, Expand);
825 setOperationAction(ISD::FSUB, VT, Expand);
826 setOperationAction(ISD::MUL , VT, Expand);
827 setOperationAction(ISD::FMUL, VT, Expand);
828 setOperationAction(ISD::SDIV, VT, Expand);
829 setOperationAction(ISD::UDIV, VT, Expand);
830 setOperationAction(ISD::FDIV, VT, Expand);
831 setOperationAction(ISD::SREM, VT, Expand);
832 setOperationAction(ISD::UREM, VT, Expand);
833 setOperationAction(ISD::LOAD, VT, Expand);
834 setOperationAction(ISD::VECTOR_SHUFFLE, VT, Expand);
835 setOperationAction(ISD::EXTRACT_VECTOR_ELT, VT,Expand);
836 setOperationAction(ISD::INSERT_VECTOR_ELT, VT, Expand);
837 setOperationAction(ISD::EXTRACT_SUBVECTOR, VT,Expand);
838 setOperationAction(ISD::INSERT_SUBVECTOR, VT,Expand);
839 setOperationAction(ISD::FABS, VT, Expand);
840 setOperationAction(ISD::FSIN, VT, Expand);
841 setOperationAction(ISD::FSINCOS, VT, Expand);
842 setOperationAction(ISD::FCOS, VT, Expand);
843 setOperationAction(ISD::FSINCOS, VT, Expand);
844 setOperationAction(ISD::FREM, VT, Expand);
845 setOperationAction(ISD::FMA, VT, Expand);
846 setOperationAction(ISD::FPOWI, VT, Expand);
847 setOperationAction(ISD::FSQRT, VT, Expand);
848 setOperationAction(ISD::FCOPYSIGN, VT, Expand);
849 setOperationAction(ISD::FFLOOR, VT, Expand);
850 setOperationAction(ISD::FCEIL, VT, Expand);
851 setOperationAction(ISD::FTRUNC, VT, Expand);
852 setOperationAction(ISD::FRINT, VT, Expand);
853 setOperationAction(ISD::FNEARBYINT, VT, Expand);
854 setOperationAction(ISD::SMUL_LOHI, VT, Expand);
855 setOperationAction(ISD::MULHS, VT, Expand);
856 setOperationAction(ISD::UMUL_LOHI, VT, Expand);
857 setOperationAction(ISD::MULHU, VT, Expand);
858 setOperationAction(ISD::SDIVREM, VT, Expand);
859 setOperationAction(ISD::UDIVREM, VT, Expand);
860 setOperationAction(ISD::FPOW, VT, Expand);
861 setOperationAction(ISD::CTPOP, VT, Expand);
862 setOperationAction(ISD::CTTZ, VT, Expand);
863 setOperationAction(ISD::CTTZ_ZERO_UNDEF, VT, Expand);
864 setOperationAction(ISD::CTLZ, VT, Expand);
865 setOperationAction(ISD::CTLZ_ZERO_UNDEF, VT, Expand);
866 setOperationAction(ISD::SHL, VT, Expand);
867 setOperationAction(ISD::SRA, VT, Expand);
868 setOperationAction(ISD::SRL, VT, Expand);
869 setOperationAction(ISD::ROTL, VT, Expand);
870 setOperationAction(ISD::ROTR, VT, Expand);
871 setOperationAction(ISD::BSWAP, VT, Expand);
872 setOperationAction(ISD::SETCC, VT, Expand);
873 setOperationAction(ISD::FLOG, VT, Expand);
874 setOperationAction(ISD::FLOG2, VT, Expand);
875 setOperationAction(ISD::FLOG10, VT, Expand);
876 setOperationAction(ISD::FEXP, VT, Expand);
877 setOperationAction(ISD::FEXP2, VT, Expand);
878 setOperationAction(ISD::FP_TO_UINT, VT, Expand);
879 setOperationAction(ISD::FP_TO_SINT, VT, Expand);
880 setOperationAction(ISD::UINT_TO_FP, VT, Expand);
881 setOperationAction(ISD::SINT_TO_FP, VT, Expand);
882 setOperationAction(ISD::SIGN_EXTEND_INREG, VT,Expand);
883 setOperationAction(ISD::TRUNCATE, VT, Expand);
884 setOperationAction(ISD::SIGN_EXTEND, VT, Expand);
885 setOperationAction(ISD::ZERO_EXTEND, VT, Expand);
886 setOperationAction(ISD::ANY_EXTEND, VT, Expand);
887 setOperationAction(ISD::VSELECT, VT, Expand);
888 setOperationAction(ISD::SELECT_CC, VT, Expand);
889 for (int InnerVT = MVT::FIRST_VECTOR_VALUETYPE;
890 InnerVT <= MVT::LAST_VECTOR_VALUETYPE; ++InnerVT)
891 setTruncStoreAction(VT,
892 (MVT::SimpleValueType)InnerVT, Expand);
893 setLoadExtAction(ISD::SEXTLOAD, VT, Expand);
894 setLoadExtAction(ISD::ZEXTLOAD, VT, Expand);
896 // N.b. ISD::EXTLOAD legality is basically ignored except for i1-like types,
897 // we have to deal with them whether we ask for Expansion or not. Setting
898 // Expand causes its own optimisation problems though, so leave them legal.
899 if (VT.getVectorElementType() == MVT::i1)
900 setLoadExtAction(ISD::EXTLOAD, VT, Expand);
903 // FIXME: In order to prevent SSE instructions being expanded to MMX ones
904 // with -msoft-float, disable use of MMX as well.
905 if (!TM.Options.UseSoftFloat && Subtarget->hasMMX()) {
906 addRegisterClass(MVT::x86mmx, &X86::VR64RegClass);
907 // No operations on x86mmx supported, everything uses intrinsics.
910 // MMX-sized vectors (other than x86mmx) are expected to be expanded
911 // into smaller operations.
912 setOperationAction(ISD::MULHS, MVT::v8i8, Expand);
913 setOperationAction(ISD::MULHS, MVT::v4i16, Expand);
914 setOperationAction(ISD::MULHS, MVT::v2i32, Expand);
915 setOperationAction(ISD::MULHS, MVT::v1i64, Expand);
916 setOperationAction(ISD::AND, MVT::v8i8, Expand);
917 setOperationAction(ISD::AND, MVT::v4i16, Expand);
918 setOperationAction(ISD::AND, MVT::v2i32, Expand);
919 setOperationAction(ISD::AND, MVT::v1i64, Expand);
920 setOperationAction(ISD::OR, MVT::v8i8, Expand);
921 setOperationAction(ISD::OR, MVT::v4i16, Expand);
922 setOperationAction(ISD::OR, MVT::v2i32, Expand);
923 setOperationAction(ISD::OR, MVT::v1i64, Expand);
924 setOperationAction(ISD::XOR, MVT::v8i8, Expand);
925 setOperationAction(ISD::XOR, MVT::v4i16, Expand);
926 setOperationAction(ISD::XOR, MVT::v2i32, Expand);
927 setOperationAction(ISD::XOR, MVT::v1i64, Expand);
928 setOperationAction(ISD::SCALAR_TO_VECTOR, MVT::v8i8, Expand);
929 setOperationAction(ISD::SCALAR_TO_VECTOR, MVT::v4i16, Expand);
930 setOperationAction(ISD::SCALAR_TO_VECTOR, MVT::v2i32, Expand);
931 setOperationAction(ISD::SCALAR_TO_VECTOR, MVT::v1i64, Expand);
932 setOperationAction(ISD::INSERT_VECTOR_ELT, MVT::v1i64, Expand);
933 setOperationAction(ISD::SELECT, MVT::v8i8, Expand);
934 setOperationAction(ISD::SELECT, MVT::v4i16, Expand);
935 setOperationAction(ISD::SELECT, MVT::v2i32, Expand);
936 setOperationAction(ISD::SELECT, MVT::v1i64, Expand);
937 setOperationAction(ISD::BITCAST, MVT::v8i8, Expand);
938 setOperationAction(ISD::BITCAST, MVT::v4i16, Expand);
939 setOperationAction(ISD::BITCAST, MVT::v2i32, Expand);
940 setOperationAction(ISD::BITCAST, MVT::v1i64, Expand);
942 if (!TM.Options.UseSoftFloat && Subtarget->hasSSE1()) {
943 addRegisterClass(MVT::v4f32, &X86::VR128RegClass);
945 setOperationAction(ISD::FADD, MVT::v4f32, Legal);
946 setOperationAction(ISD::FSUB, MVT::v4f32, Legal);
947 setOperationAction(ISD::FMUL, MVT::v4f32, Legal);
948 setOperationAction(ISD::FDIV, MVT::v4f32, Legal);
949 setOperationAction(ISD::FSQRT, MVT::v4f32, Legal);
950 setOperationAction(ISD::FNEG, MVT::v4f32, Custom);
951 setOperationAction(ISD::FABS, MVT::v4f32, Custom);
952 setOperationAction(ISD::LOAD, MVT::v4f32, Legal);
953 setOperationAction(ISD::BUILD_VECTOR, MVT::v4f32, Custom);
954 setOperationAction(ISD::VECTOR_SHUFFLE, MVT::v4f32, Custom);
955 setOperationAction(ISD::EXTRACT_VECTOR_ELT, MVT::v4f32, Custom);
956 setOperationAction(ISD::SELECT, MVT::v4f32, Custom);
959 if (!TM.Options.UseSoftFloat && Subtarget->hasSSE2()) {
960 addRegisterClass(MVT::v2f64, &X86::VR128RegClass);
962 // FIXME: Unfortunately, -soft-float and -no-implicit-float mean XMM
963 // registers cannot be used even for integer operations.
964 addRegisterClass(MVT::v16i8, &X86::VR128RegClass);
965 addRegisterClass(MVT::v8i16, &X86::VR128RegClass);
966 addRegisterClass(MVT::v4i32, &X86::VR128RegClass);
967 addRegisterClass(MVT::v2i64, &X86::VR128RegClass);
969 setOperationAction(ISD::ADD, MVT::v16i8, Legal);
970 setOperationAction(ISD::ADD, MVT::v8i16, Legal);
971 setOperationAction(ISD::ADD, MVT::v4i32, Legal);
972 setOperationAction(ISD::ADD, MVT::v2i64, Legal);
973 setOperationAction(ISD::MUL, MVT::v4i32, Custom);
974 setOperationAction(ISD::MUL, MVT::v2i64, Custom);
975 setOperationAction(ISD::UMUL_LOHI, MVT::v4i32, Custom);
976 setOperationAction(ISD::SMUL_LOHI, MVT::v4i32, Custom);
977 setOperationAction(ISD::MULHU, MVT::v8i16, Legal);
978 setOperationAction(ISD::MULHS, MVT::v8i16, Legal);
979 setOperationAction(ISD::SUB, MVT::v16i8, Legal);
980 setOperationAction(ISD::SUB, MVT::v8i16, Legal);
981 setOperationAction(ISD::SUB, MVT::v4i32, Legal);
982 setOperationAction(ISD::SUB, MVT::v2i64, Legal);
983 setOperationAction(ISD::MUL, MVT::v8i16, Legal);
984 setOperationAction(ISD::FADD, MVT::v2f64, Legal);
985 setOperationAction(ISD::FSUB, MVT::v2f64, Legal);
986 setOperationAction(ISD::FMUL, MVT::v2f64, Legal);
987 setOperationAction(ISD::FDIV, MVT::v2f64, Legal);
988 setOperationAction(ISD::FSQRT, MVT::v2f64, Legal);
989 setOperationAction(ISD::FNEG, MVT::v2f64, Custom);
990 setOperationAction(ISD::FABS, MVT::v2f64, Custom);
992 setOperationAction(ISD::SETCC, MVT::v2i64, Custom);
993 setOperationAction(ISD::SETCC, MVT::v16i8, Custom);
994 setOperationAction(ISD::SETCC, MVT::v8i16, Custom);
995 setOperationAction(ISD::SETCC, MVT::v4i32, Custom);
997 setOperationAction(ISD::SCALAR_TO_VECTOR, MVT::v16i8, Custom);
998 setOperationAction(ISD::SCALAR_TO_VECTOR, MVT::v8i16, Custom);
999 setOperationAction(ISD::INSERT_VECTOR_ELT, MVT::v8i16, Custom);
1000 setOperationAction(ISD::INSERT_VECTOR_ELT, MVT::v4i32, Custom);
1001 setOperationAction(ISD::INSERT_VECTOR_ELT, MVT::v4f32, Custom);
1003 // Custom lower build_vector, vector_shuffle, and extract_vector_elt.
1004 for (int i = MVT::v16i8; i != MVT::v2i64; ++i) {
1005 MVT VT = (MVT::SimpleValueType)i;
1006 // Do not attempt to custom lower non-power-of-2 vectors
1007 if (!isPowerOf2_32(VT.getVectorNumElements()))
1009 // Do not attempt to custom lower non-128-bit vectors
1010 if (!VT.is128BitVector())
1012 setOperationAction(ISD::BUILD_VECTOR, VT, Custom);
1013 setOperationAction(ISD::VECTOR_SHUFFLE, VT, Custom);
1014 setOperationAction(ISD::EXTRACT_VECTOR_ELT, VT, Custom);
1017 // We support custom legalizing of sext and anyext loads for specific
1018 // memory vector types which we can load as a scalar (or sequence of
1019 // scalars) and extend in-register to a legal 128-bit vector type. For sext
1020 // loads these must work with a single scalar load.
1021 setLoadExtAction(ISD::SEXTLOAD, MVT::v4i8, Custom);
1022 setLoadExtAction(ISD::SEXTLOAD, MVT::v4i16, Custom);
1023 setLoadExtAction(ISD::SEXTLOAD, MVT::v8i8, Custom);
1024 setLoadExtAction(ISD::EXTLOAD, MVT::v2i8, Custom);
1025 setLoadExtAction(ISD::EXTLOAD, MVT::v2i16, Custom);
1026 setLoadExtAction(ISD::EXTLOAD, MVT::v2i32, Custom);
1027 setLoadExtAction(ISD::EXTLOAD, MVT::v4i8, Custom);
1028 setLoadExtAction(ISD::EXTLOAD, MVT::v4i16, Custom);
1029 setLoadExtAction(ISD::EXTLOAD, MVT::v8i8, Custom);
1031 setOperationAction(ISD::BUILD_VECTOR, MVT::v2f64, Custom);
1032 setOperationAction(ISD::BUILD_VECTOR, MVT::v2i64, Custom);
1033 setOperationAction(ISD::VECTOR_SHUFFLE, MVT::v2f64, Custom);
1034 setOperationAction(ISD::VECTOR_SHUFFLE, MVT::v2i64, Custom);
1035 setOperationAction(ISD::INSERT_VECTOR_ELT, MVT::v2f64, Custom);
1036 setOperationAction(ISD::EXTRACT_VECTOR_ELT, MVT::v2f64, Custom);
1038 if (Subtarget->is64Bit()) {
1039 setOperationAction(ISD::INSERT_VECTOR_ELT, MVT::v2i64, Custom);
1040 setOperationAction(ISD::EXTRACT_VECTOR_ELT, MVT::v2i64, Custom);
1043 // Promote v16i8, v8i16, v4i32 load, select, and, or, xor to v2i64.
1044 for (int i = MVT::v16i8; i != MVT::v2i64; ++i) {
1045 MVT VT = (MVT::SimpleValueType)i;
1047 // Do not attempt to promote non-128-bit vectors
1048 if (!VT.is128BitVector())
1051 setOperationAction(ISD::AND, VT, Promote);
1052 AddPromotedToType (ISD::AND, VT, MVT::v2i64);
1053 setOperationAction(ISD::OR, VT, Promote);
1054 AddPromotedToType (ISD::OR, VT, MVT::v2i64);
1055 setOperationAction(ISD::XOR, VT, Promote);
1056 AddPromotedToType (ISD::XOR, VT, MVT::v2i64);
1057 setOperationAction(ISD::LOAD, VT, Promote);
1058 AddPromotedToType (ISD::LOAD, VT, MVT::v2i64);
1059 setOperationAction(ISD::SELECT, VT, Promote);
1060 AddPromotedToType (ISD::SELECT, VT, MVT::v2i64);
1063 // Custom lower v2i64 and v2f64 selects.
1064 setOperationAction(ISD::LOAD, MVT::v2f64, Legal);
1065 setOperationAction(ISD::LOAD, MVT::v2i64, Legal);
1066 setOperationAction(ISD::SELECT, MVT::v2f64, Custom);
1067 setOperationAction(ISD::SELECT, MVT::v2i64, Custom);
1069 setOperationAction(ISD::FP_TO_SINT, MVT::v4i32, Legal);
1070 setOperationAction(ISD::SINT_TO_FP, MVT::v4i32, Legal);
1072 setOperationAction(ISD::UINT_TO_FP, MVT::v4i8, Custom);
1073 setOperationAction(ISD::UINT_TO_FP, MVT::v4i16, Custom);
1074 // As there is no 64-bit GPR available, we need build a special custom
1075 // sequence to convert from v2i32 to v2f32.
1076 if (!Subtarget->is64Bit())
1077 setOperationAction(ISD::UINT_TO_FP, MVT::v2f32, Custom);
1079 setOperationAction(ISD::FP_EXTEND, MVT::v2f32, Custom);
1080 setOperationAction(ISD::FP_ROUND, MVT::v2f32, Custom);
1082 setLoadExtAction(ISD::EXTLOAD, MVT::v2f32, Legal);
1084 setOperationAction(ISD::BITCAST, MVT::v2i32, Custom);
1085 setOperationAction(ISD::BITCAST, MVT::v4i16, Custom);
1086 setOperationAction(ISD::BITCAST, MVT::v8i8, Custom);
1089 if (!TM.Options.UseSoftFloat && Subtarget->hasSSE41()) {
1090 setOperationAction(ISD::FFLOOR, MVT::f32, Legal);
1091 setOperationAction(ISD::FCEIL, MVT::f32, Legal);
1092 setOperationAction(ISD::FTRUNC, MVT::f32, Legal);
1093 setOperationAction(ISD::FRINT, MVT::f32, Legal);
1094 setOperationAction(ISD::FNEARBYINT, MVT::f32, Legal);
1095 setOperationAction(ISD::FFLOOR, MVT::f64, Legal);
1096 setOperationAction(ISD::FCEIL, MVT::f64, Legal);
1097 setOperationAction(ISD::FTRUNC, MVT::f64, Legal);
1098 setOperationAction(ISD::FRINT, MVT::f64, Legal);
1099 setOperationAction(ISD::FNEARBYINT, MVT::f64, Legal);
1101 setOperationAction(ISD::FFLOOR, MVT::v4f32, Legal);
1102 setOperationAction(ISD::FCEIL, MVT::v4f32, Legal);
1103 setOperationAction(ISD::FTRUNC, MVT::v4f32, Legal);
1104 setOperationAction(ISD::FRINT, MVT::v4f32, Legal);
1105 setOperationAction(ISD::FNEARBYINT, MVT::v4f32, Legal);
1106 setOperationAction(ISD::FFLOOR, MVT::v2f64, Legal);
1107 setOperationAction(ISD::FCEIL, MVT::v2f64, Legal);
1108 setOperationAction(ISD::FTRUNC, MVT::v2f64, Legal);
1109 setOperationAction(ISD::FRINT, MVT::v2f64, Legal);
1110 setOperationAction(ISD::FNEARBYINT, MVT::v2f64, Legal);
1112 // FIXME: Do we need to handle scalar-to-vector here?
1113 setOperationAction(ISD::MUL, MVT::v4i32, Legal);
1115 setOperationAction(ISD::VSELECT, MVT::v2f64, Custom);
1116 setOperationAction(ISD::VSELECT, MVT::v2i64, Custom);
1117 setOperationAction(ISD::VSELECT, MVT::v4i32, Custom);
1118 setOperationAction(ISD::VSELECT, MVT::v4f32, Custom);
1119 setOperationAction(ISD::VSELECT, MVT::v8i16, Custom);
1120 // There is no BLENDI for byte vectors. We don't need to custom lower
1121 // some vselects for now.
1122 setOperationAction(ISD::VSELECT, MVT::v16i8, Legal);
1124 // SSE41 brings specific instructions for doing vector sign extend even in
1125 // cases where we don't have SRA.
1126 setLoadExtAction(ISD::SEXTLOAD, MVT::v2i8, Custom);
1127 setLoadExtAction(ISD::SEXTLOAD, MVT::v2i16, Custom);
1128 setLoadExtAction(ISD::SEXTLOAD, MVT::v2i32, Custom);
1130 // i8 and i16 vectors are custom because the source register and source
1131 // source memory operand types are not the same width. f32 vectors are
1132 // custom since the immediate controlling the insert encodes additional
1134 setOperationAction(ISD::INSERT_VECTOR_ELT, MVT::v16i8, Custom);
1135 setOperationAction(ISD::INSERT_VECTOR_ELT, MVT::v8i16, Custom);
1136 setOperationAction(ISD::INSERT_VECTOR_ELT, MVT::v4i32, Custom);
1137 setOperationAction(ISD::INSERT_VECTOR_ELT, MVT::v4f32, Custom);
1139 setOperationAction(ISD::EXTRACT_VECTOR_ELT, MVT::v16i8, Custom);
1140 setOperationAction(ISD::EXTRACT_VECTOR_ELT, MVT::v8i16, Custom);
1141 setOperationAction(ISD::EXTRACT_VECTOR_ELT, MVT::v4i32, Custom);
1142 setOperationAction(ISD::EXTRACT_VECTOR_ELT, MVT::v4f32, Custom);
1144 // FIXME: these should be Legal, but that's only for the case where
1145 // the index is constant. For now custom expand to deal with that.
1146 if (Subtarget->is64Bit()) {
1147 setOperationAction(ISD::INSERT_VECTOR_ELT, MVT::v2i64, Custom);
1148 setOperationAction(ISD::EXTRACT_VECTOR_ELT, MVT::v2i64, Custom);
1152 if (Subtarget->hasSSE2()) {
1153 setOperationAction(ISD::SRL, MVT::v8i16, Custom);
1154 setOperationAction(ISD::SRL, MVT::v16i8, Custom);
1156 setOperationAction(ISD::SHL, MVT::v8i16, Custom);
1157 setOperationAction(ISD::SHL, MVT::v16i8, Custom);
1159 setOperationAction(ISD::SRA, MVT::v8i16, Custom);
1160 setOperationAction(ISD::SRA, MVT::v16i8, Custom);
1162 // In the customized shift lowering, the legal cases in AVX2 will be
1164 setOperationAction(ISD::SRL, MVT::v2i64, Custom);
1165 setOperationAction(ISD::SRL, MVT::v4i32, Custom);
1167 setOperationAction(ISD::SHL, MVT::v2i64, Custom);
1168 setOperationAction(ISD::SHL, MVT::v4i32, Custom);
1170 setOperationAction(ISD::SRA, MVT::v4i32, Custom);
1173 if (!TM.Options.UseSoftFloat && Subtarget->hasFp256()) {
1174 addRegisterClass(MVT::v32i8, &X86::VR256RegClass);
1175 addRegisterClass(MVT::v16i16, &X86::VR256RegClass);
1176 addRegisterClass(MVT::v8i32, &X86::VR256RegClass);
1177 addRegisterClass(MVT::v8f32, &X86::VR256RegClass);
1178 addRegisterClass(MVT::v4i64, &X86::VR256RegClass);
1179 addRegisterClass(MVT::v4f64, &X86::VR256RegClass);
1181 setOperationAction(ISD::LOAD, MVT::v8f32, Legal);
1182 setOperationAction(ISD::LOAD, MVT::v4f64, Legal);
1183 setOperationAction(ISD::LOAD, MVT::v4i64, Legal);
1185 setOperationAction(ISD::FADD, MVT::v8f32, Legal);
1186 setOperationAction(ISD::FSUB, MVT::v8f32, Legal);
1187 setOperationAction(ISD::FMUL, MVT::v8f32, Legal);
1188 setOperationAction(ISD::FDIV, MVT::v8f32, Legal);
1189 setOperationAction(ISD::FSQRT, MVT::v8f32, Legal);
1190 setOperationAction(ISD::FFLOOR, MVT::v8f32, Legal);
1191 setOperationAction(ISD::FCEIL, MVT::v8f32, Legal);
1192 setOperationAction(ISD::FTRUNC, MVT::v8f32, Legal);
1193 setOperationAction(ISD::FRINT, MVT::v8f32, Legal);
1194 setOperationAction(ISD::FNEARBYINT, MVT::v8f32, Legal);
1195 setOperationAction(ISD::FNEG, MVT::v8f32, Custom);
1196 setOperationAction(ISD::FABS, MVT::v8f32, Custom);
1198 setOperationAction(ISD::FADD, MVT::v4f64, Legal);
1199 setOperationAction(ISD::FSUB, MVT::v4f64, Legal);
1200 setOperationAction(ISD::FMUL, MVT::v4f64, Legal);
1201 setOperationAction(ISD::FDIV, MVT::v4f64, Legal);
1202 setOperationAction(ISD::FSQRT, MVT::v4f64, Legal);
1203 setOperationAction(ISD::FFLOOR, MVT::v4f64, Legal);
1204 setOperationAction(ISD::FCEIL, MVT::v4f64, Legal);
1205 setOperationAction(ISD::FTRUNC, MVT::v4f64, Legal);
1206 setOperationAction(ISD::FRINT, MVT::v4f64, Legal);
1207 setOperationAction(ISD::FNEARBYINT, MVT::v4f64, Legal);
1208 setOperationAction(ISD::FNEG, MVT::v4f64, Custom);
1209 setOperationAction(ISD::FABS, MVT::v4f64, Custom);
1211 // (fp_to_int:v8i16 (v8f32 ..)) requires the result type to be promoted
1212 // even though v8i16 is a legal type.
1213 setOperationAction(ISD::FP_TO_SINT, MVT::v8i16, Promote);
1214 setOperationAction(ISD::FP_TO_UINT, MVT::v8i16, Promote);
1215 setOperationAction(ISD::FP_TO_SINT, MVT::v8i32, Legal);
1217 setOperationAction(ISD::SINT_TO_FP, MVT::v8i16, Promote);
1218 setOperationAction(ISD::SINT_TO_FP, MVT::v8i32, Legal);
1219 setOperationAction(ISD::FP_ROUND, MVT::v4f32, Legal);
1221 setOperationAction(ISD::UINT_TO_FP, MVT::v8i8, Custom);
1222 setOperationAction(ISD::UINT_TO_FP, MVT::v8i16, Custom);
1224 setLoadExtAction(ISD::EXTLOAD, MVT::v4f32, Legal);
1226 setOperationAction(ISD::SRL, MVT::v16i16, Custom);
1227 setOperationAction(ISD::SRL, MVT::v32i8, Custom);
1229 setOperationAction(ISD::SHL, MVT::v16i16, Custom);
1230 setOperationAction(ISD::SHL, MVT::v32i8, Custom);
1232 setOperationAction(ISD::SRA, MVT::v16i16, Custom);
1233 setOperationAction(ISD::SRA, MVT::v32i8, Custom);
1235 setOperationAction(ISD::SETCC, MVT::v32i8, Custom);
1236 setOperationAction(ISD::SETCC, MVT::v16i16, Custom);
1237 setOperationAction(ISD::SETCC, MVT::v8i32, Custom);
1238 setOperationAction(ISD::SETCC, MVT::v4i64, Custom);
1240 setOperationAction(ISD::SELECT, MVT::v4f64, Custom);
1241 setOperationAction(ISD::SELECT, MVT::v4i64, Custom);
1242 setOperationAction(ISD::SELECT, MVT::v8f32, Custom);
1244 setOperationAction(ISD::VSELECT, MVT::v4f64, Custom);
1245 setOperationAction(ISD::VSELECT, MVT::v4i64, Custom);
1246 setOperationAction(ISD::VSELECT, MVT::v8i32, Custom);
1247 setOperationAction(ISD::VSELECT, MVT::v8f32, Custom);
1249 setOperationAction(ISD::SIGN_EXTEND, MVT::v4i64, Custom);
1250 setOperationAction(ISD::SIGN_EXTEND, MVT::v8i32, Custom);
1251 setOperationAction(ISD::SIGN_EXTEND, MVT::v16i16, Custom);
1252 setOperationAction(ISD::ZERO_EXTEND, MVT::v4i64, Custom);
1253 setOperationAction(ISD::ZERO_EXTEND, MVT::v8i32, Custom);
1254 setOperationAction(ISD::ZERO_EXTEND, MVT::v16i16, Custom);
1255 setOperationAction(ISD::ANY_EXTEND, MVT::v4i64, Custom);
1256 setOperationAction(ISD::ANY_EXTEND, MVT::v8i32, Custom);
1257 setOperationAction(ISD::ANY_EXTEND, MVT::v16i16, Custom);
1258 setOperationAction(ISD::TRUNCATE, MVT::v16i8, Custom);
1259 setOperationAction(ISD::TRUNCATE, MVT::v8i16, Custom);
1260 setOperationAction(ISD::TRUNCATE, MVT::v4i32, Custom);
1262 if (Subtarget->hasFMA() || Subtarget->hasFMA4()) {
1263 setOperationAction(ISD::FMA, MVT::v8f32, Legal);
1264 setOperationAction(ISD::FMA, MVT::v4f64, Legal);
1265 setOperationAction(ISD::FMA, MVT::v4f32, Legal);
1266 setOperationAction(ISD::FMA, MVT::v2f64, Legal);
1267 setOperationAction(ISD::FMA, MVT::f32, Legal);
1268 setOperationAction(ISD::FMA, MVT::f64, Legal);
1271 if (Subtarget->hasInt256()) {
1272 setOperationAction(ISD::ADD, MVT::v4i64, Legal);
1273 setOperationAction(ISD::ADD, MVT::v8i32, Legal);
1274 setOperationAction(ISD::ADD, MVT::v16i16, Legal);
1275 setOperationAction(ISD::ADD, MVT::v32i8, Legal);
1277 setOperationAction(ISD::SUB, MVT::v4i64, Legal);
1278 setOperationAction(ISD::SUB, MVT::v8i32, Legal);
1279 setOperationAction(ISD::SUB, MVT::v16i16, Legal);
1280 setOperationAction(ISD::SUB, MVT::v32i8, Legal);
1282 setOperationAction(ISD::MUL, MVT::v4i64, Custom);
1283 setOperationAction(ISD::MUL, MVT::v8i32, Legal);
1284 setOperationAction(ISD::MUL, MVT::v16i16, Legal);
1285 // Don't lower v32i8 because there is no 128-bit byte mul
1287 setOperationAction(ISD::UMUL_LOHI, MVT::v8i32, Custom);
1288 setOperationAction(ISD::SMUL_LOHI, MVT::v8i32, Custom);
1289 setOperationAction(ISD::MULHU, MVT::v16i16, Legal);
1290 setOperationAction(ISD::MULHS, MVT::v16i16, Legal);
1292 setOperationAction(ISD::VSELECT, MVT::v16i16, Custom);
1293 setOperationAction(ISD::VSELECT, MVT::v32i8, Legal);
1295 setOperationAction(ISD::ADD, MVT::v4i64, Custom);
1296 setOperationAction(ISD::ADD, MVT::v8i32, Custom);
1297 setOperationAction(ISD::ADD, MVT::v16i16, Custom);
1298 setOperationAction(ISD::ADD, MVT::v32i8, Custom);
1300 setOperationAction(ISD::SUB, MVT::v4i64, Custom);
1301 setOperationAction(ISD::SUB, MVT::v8i32, Custom);
1302 setOperationAction(ISD::SUB, MVT::v16i16, Custom);
1303 setOperationAction(ISD::SUB, MVT::v32i8, Custom);
1305 setOperationAction(ISD::MUL, MVT::v4i64, Custom);
1306 setOperationAction(ISD::MUL, MVT::v8i32, Custom);
1307 setOperationAction(ISD::MUL, MVT::v16i16, Custom);
1308 // Don't lower v32i8 because there is no 128-bit byte mul
1311 // In the customized shift lowering, the legal cases in AVX2 will be
1313 setOperationAction(ISD::SRL, MVT::v4i64, Custom);
1314 setOperationAction(ISD::SRL, MVT::v8i32, Custom);
1316 setOperationAction(ISD::SHL, MVT::v4i64, Custom);
1317 setOperationAction(ISD::SHL, MVT::v8i32, Custom);
1319 setOperationAction(ISD::SRA, MVT::v8i32, Custom);
1321 // Custom lower several nodes for 256-bit types.
1322 for (int i = MVT::FIRST_VECTOR_VALUETYPE;
1323 i <= MVT::LAST_VECTOR_VALUETYPE; ++i) {
1324 MVT VT = (MVT::SimpleValueType)i;
1326 // Extract subvector is special because the value type
1327 // (result) is 128-bit but the source is 256-bit wide.
1328 if (VT.is128BitVector())
1329 setOperationAction(ISD::EXTRACT_SUBVECTOR, VT, Custom);
1331 // Do not attempt to custom lower other non-256-bit vectors
1332 if (!VT.is256BitVector())
1335 setOperationAction(ISD::BUILD_VECTOR, VT, Custom);
1336 setOperationAction(ISD::VECTOR_SHUFFLE, VT, Custom);
1337 setOperationAction(ISD::INSERT_VECTOR_ELT, VT, Custom);
1338 setOperationAction(ISD::EXTRACT_VECTOR_ELT, VT, Custom);
1339 setOperationAction(ISD::SCALAR_TO_VECTOR, VT, Custom);
1340 setOperationAction(ISD::INSERT_SUBVECTOR, VT, Custom);
1341 setOperationAction(ISD::CONCAT_VECTORS, VT, Custom);
1344 // Promote v32i8, v16i16, v8i32 select, and, or, xor to v4i64.
1345 for (int i = MVT::v32i8; i != MVT::v4i64; ++i) {
1346 MVT VT = (MVT::SimpleValueType)i;
1348 // Do not attempt to promote non-256-bit vectors
1349 if (!VT.is256BitVector())
1352 setOperationAction(ISD::AND, VT, Promote);
1353 AddPromotedToType (ISD::AND, VT, MVT::v4i64);
1354 setOperationAction(ISD::OR, VT, Promote);
1355 AddPromotedToType (ISD::OR, VT, MVT::v4i64);
1356 setOperationAction(ISD::XOR, VT, Promote);
1357 AddPromotedToType (ISD::XOR, VT, MVT::v4i64);
1358 setOperationAction(ISD::LOAD, VT, Promote);
1359 AddPromotedToType (ISD::LOAD, VT, MVT::v4i64);
1360 setOperationAction(ISD::SELECT, VT, Promote);
1361 AddPromotedToType (ISD::SELECT, VT, MVT::v4i64);
1365 if (!TM.Options.UseSoftFloat && Subtarget->hasAVX512()) {
1366 addRegisterClass(MVT::v16i32, &X86::VR512RegClass);
1367 addRegisterClass(MVT::v16f32, &X86::VR512RegClass);
1368 addRegisterClass(MVT::v8i64, &X86::VR512RegClass);
1369 addRegisterClass(MVT::v8f64, &X86::VR512RegClass);
1371 addRegisterClass(MVT::i1, &X86::VK1RegClass);
1372 addRegisterClass(MVT::v8i1, &X86::VK8RegClass);
1373 addRegisterClass(MVT::v16i1, &X86::VK16RegClass);
1375 setOperationAction(ISD::BR_CC, MVT::i1, Expand);
1376 setOperationAction(ISD::SETCC, MVT::i1, Custom);
1377 setOperationAction(ISD::XOR, MVT::i1, Legal);
1378 setOperationAction(ISD::OR, MVT::i1, Legal);
1379 setOperationAction(ISD::AND, MVT::i1, Legal);
1380 setLoadExtAction(ISD::EXTLOAD, MVT::v8f32, Legal);
1381 setOperationAction(ISD::LOAD, MVT::v16f32, Legal);
1382 setOperationAction(ISD::LOAD, MVT::v8f64, Legal);
1383 setOperationAction(ISD::LOAD, MVT::v8i64, Legal);
1384 setOperationAction(ISD::LOAD, MVT::v16i32, Legal);
1385 setOperationAction(ISD::LOAD, MVT::v16i1, Legal);
1387 setOperationAction(ISD::FADD, MVT::v16f32, Legal);
1388 setOperationAction(ISD::FSUB, MVT::v16f32, Legal);
1389 setOperationAction(ISD::FMUL, MVT::v16f32, Legal);
1390 setOperationAction(ISD::FDIV, MVT::v16f32, Legal);
1391 setOperationAction(ISD::FSQRT, MVT::v16f32, Legal);
1392 setOperationAction(ISD::FNEG, MVT::v16f32, Custom);
1394 setOperationAction(ISD::FADD, MVT::v8f64, Legal);
1395 setOperationAction(ISD::FSUB, MVT::v8f64, Legal);
1396 setOperationAction(ISD::FMUL, MVT::v8f64, Legal);
1397 setOperationAction(ISD::FDIV, MVT::v8f64, Legal);
1398 setOperationAction(ISD::FSQRT, MVT::v8f64, Legal);
1399 setOperationAction(ISD::FNEG, MVT::v8f64, Custom);
1400 setOperationAction(ISD::FMA, MVT::v8f64, Legal);
1401 setOperationAction(ISD::FMA, MVT::v16f32, Legal);
1403 setOperationAction(ISD::FP_TO_SINT, MVT::i32, Legal);
1404 setOperationAction(ISD::FP_TO_UINT, MVT::i32, Legal);
1405 setOperationAction(ISD::SINT_TO_FP, MVT::i32, Legal);
1406 setOperationAction(ISD::UINT_TO_FP, MVT::i32, Legal);
1407 if (Subtarget->is64Bit()) {
1408 setOperationAction(ISD::FP_TO_UINT, MVT::i64, Legal);
1409 setOperationAction(ISD::FP_TO_SINT, MVT::i64, Legal);
1410 setOperationAction(ISD::SINT_TO_FP, MVT::i64, Legal);
1411 setOperationAction(ISD::UINT_TO_FP, MVT::i64, Legal);
1413 setOperationAction(ISD::FP_TO_SINT, MVT::v16i32, Legal);
1414 setOperationAction(ISD::FP_TO_UINT, MVT::v16i32, Legal);
1415 setOperationAction(ISD::FP_TO_UINT, MVT::v8i32, Legal);
1416 setOperationAction(ISD::FP_TO_UINT, MVT::v4i32, Legal);
1417 setOperationAction(ISD::SINT_TO_FP, MVT::v16i32, Legal);
1418 setOperationAction(ISD::UINT_TO_FP, MVT::v16i32, Legal);
1419 setOperationAction(ISD::UINT_TO_FP, MVT::v8i32, Legal);
1420 setOperationAction(ISD::UINT_TO_FP, MVT::v4i32, Legal);
1421 setOperationAction(ISD::FP_ROUND, MVT::v8f32, Legal);
1422 setOperationAction(ISD::FP_EXTEND, MVT::v8f32, Legal);
1424 setOperationAction(ISD::TRUNCATE, MVT::i1, Custom);
1425 setOperationAction(ISD::TRUNCATE, MVT::v16i8, Custom);
1426 setOperationAction(ISD::TRUNCATE, MVT::v8i32, Custom);
1427 setOperationAction(ISD::TRUNCATE, MVT::v8i1, Custom);
1428 setOperationAction(ISD::TRUNCATE, MVT::v16i1, Custom);
1429 setOperationAction(ISD::TRUNCATE, MVT::v16i16, Custom);
1430 setOperationAction(ISD::ZERO_EXTEND, MVT::v16i32, Custom);
1431 setOperationAction(ISD::ZERO_EXTEND, MVT::v8i64, Custom);
1432 setOperationAction(ISD::SIGN_EXTEND, MVT::v16i32, Custom);
1433 setOperationAction(ISD::SIGN_EXTEND, MVT::v8i64, Custom);
1434 setOperationAction(ISD::SIGN_EXTEND, MVT::v16i8, Custom);
1435 setOperationAction(ISD::SIGN_EXTEND, MVT::v8i16, Custom);
1436 setOperationAction(ISD::SIGN_EXTEND, MVT::v16i16, Custom);
1438 setOperationAction(ISD::CONCAT_VECTORS, MVT::v8f64, Custom);
1439 setOperationAction(ISD::CONCAT_VECTORS, MVT::v8i64, Custom);
1440 setOperationAction(ISD::CONCAT_VECTORS, MVT::v16f32, Custom);
1441 setOperationAction(ISD::CONCAT_VECTORS, MVT::v16i32, Custom);
1442 setOperationAction(ISD::CONCAT_VECTORS, MVT::v8i1, Custom);
1443 setOperationAction(ISD::CONCAT_VECTORS, MVT::v16i1, Legal);
1445 setOperationAction(ISD::SETCC, MVT::v16i1, Custom);
1446 setOperationAction(ISD::SETCC, MVT::v8i1, Custom);
1448 setOperationAction(ISD::MUL, MVT::v8i64, Custom);
1450 setOperationAction(ISD::EXTRACT_VECTOR_ELT, MVT::v8i1, Custom);
1451 setOperationAction(ISD::EXTRACT_VECTOR_ELT, MVT::v16i1, Custom);
1452 setOperationAction(ISD::INSERT_VECTOR_ELT, MVT::v16i1, Custom);
1453 setOperationAction(ISD::INSERT_VECTOR_ELT, MVT::v8i1, Custom);
1454 setOperationAction(ISD::BUILD_VECTOR, MVT::v8i1, Custom);
1455 setOperationAction(ISD::BUILD_VECTOR, MVT::v16i1, Custom);
1456 setOperationAction(ISD::SELECT, MVT::v8f64, Custom);
1457 setOperationAction(ISD::SELECT, MVT::v8i64, Custom);
1458 setOperationAction(ISD::SELECT, MVT::v16f32, Custom);
1460 setOperationAction(ISD::ADD, MVT::v8i64, Legal);
1461 setOperationAction(ISD::ADD, MVT::v16i32, Legal);
1463 setOperationAction(ISD::SUB, MVT::v8i64, Legal);
1464 setOperationAction(ISD::SUB, MVT::v16i32, Legal);
1466 setOperationAction(ISD::MUL, MVT::v16i32, Legal);
1468 setOperationAction(ISD::SRL, MVT::v8i64, Custom);
1469 setOperationAction(ISD::SRL, MVT::v16i32, Custom);
1471 setOperationAction(ISD::SHL, MVT::v8i64, Custom);
1472 setOperationAction(ISD::SHL, MVT::v16i32, Custom);
1474 setOperationAction(ISD::SRA, MVT::v8i64, Custom);
1475 setOperationAction(ISD::SRA, MVT::v16i32, Custom);
1477 setOperationAction(ISD::AND, MVT::v8i64, Legal);
1478 setOperationAction(ISD::OR, MVT::v8i64, Legal);
1479 setOperationAction(ISD::XOR, MVT::v8i64, Legal);
1480 setOperationAction(ISD::AND, MVT::v16i32, Legal);
1481 setOperationAction(ISD::OR, MVT::v16i32, Legal);
1482 setOperationAction(ISD::XOR, MVT::v16i32, Legal);
1484 if (Subtarget->hasCDI()) {
1485 setOperationAction(ISD::CTLZ, MVT::v8i64, Legal);
1486 setOperationAction(ISD::CTLZ, MVT::v16i32, Legal);
1489 // Custom lower several nodes.
1490 for (int i = MVT::FIRST_VECTOR_VALUETYPE;
1491 i <= MVT::LAST_VECTOR_VALUETYPE; ++i) {
1492 MVT VT = (MVT::SimpleValueType)i;
1494 unsigned EltSize = VT.getVectorElementType().getSizeInBits();
1495 // Extract subvector is special because the value type
1496 // (result) is 256/128-bit but the source is 512-bit wide.
1497 if (VT.is128BitVector() || VT.is256BitVector())
1498 setOperationAction(ISD::EXTRACT_SUBVECTOR, VT, Custom);
1500 if (VT.getVectorElementType() == MVT::i1)
1501 setOperationAction(ISD::EXTRACT_SUBVECTOR, VT, Legal);
1503 // Do not attempt to custom lower other non-512-bit vectors
1504 if (!VT.is512BitVector())
1507 if ( EltSize >= 32) {
1508 setOperationAction(ISD::VECTOR_SHUFFLE, VT, Custom);
1509 setOperationAction(ISD::INSERT_VECTOR_ELT, VT, Custom);
1510 setOperationAction(ISD::BUILD_VECTOR, VT, Custom);
1511 setOperationAction(ISD::VSELECT, VT, Legal);
1512 setOperationAction(ISD::EXTRACT_VECTOR_ELT, VT, Custom);
1513 setOperationAction(ISD::SCALAR_TO_VECTOR, VT, Custom);
1514 setOperationAction(ISD::INSERT_SUBVECTOR, VT, Custom);
1517 for (int i = MVT::v32i8; i != MVT::v8i64; ++i) {
1518 MVT VT = (MVT::SimpleValueType)i;
1520 // Do not attempt to promote non-256-bit vectors
1521 if (!VT.is512BitVector())
1524 setOperationAction(ISD::SELECT, VT, Promote);
1525 AddPromotedToType (ISD::SELECT, VT, MVT::v8i64);
1529 if (!TM.Options.UseSoftFloat && Subtarget->hasBWI()) {
1530 addRegisterClass(MVT::v32i16, &X86::VR512RegClass);
1531 addRegisterClass(MVT::v64i8, &X86::VR512RegClass);
1533 addRegisterClass(MVT::v32i1, &X86::VK32RegClass);
1534 addRegisterClass(MVT::v64i1, &X86::VK64RegClass);
1536 setOperationAction(ISD::LOAD, MVT::v32i16, Legal);
1537 setOperationAction(ISD::LOAD, MVT::v64i8, Legal);
1538 setOperationAction(ISD::SETCC, MVT::v32i1, Custom);
1539 setOperationAction(ISD::SETCC, MVT::v64i1, Custom);
1541 for (int i = MVT::v32i8; i != MVT::v8i64; ++i) {
1542 const MVT VT = (MVT::SimpleValueType)i;
1544 const unsigned EltSize = VT.getVectorElementType().getSizeInBits();
1546 // Do not attempt to promote non-256-bit vectors
1547 if (!VT.is512BitVector())
1550 if ( EltSize < 32) {
1551 setOperationAction(ISD::BUILD_VECTOR, VT, Custom);
1552 setOperationAction(ISD::VSELECT, VT, Legal);
1557 if (!TM.Options.UseSoftFloat && Subtarget->hasVLX()) {
1558 addRegisterClass(MVT::v4i1, &X86::VK4RegClass);
1559 addRegisterClass(MVT::v2i1, &X86::VK2RegClass);
1561 setOperationAction(ISD::SETCC, MVT::v4i1, Custom);
1562 setOperationAction(ISD::SETCC, MVT::v2i1, Custom);
1565 // SIGN_EXTEND_INREGs are evaluated by the extend type. Handle the expansion
1566 // of this type with custom code.
1567 for (int VT = MVT::FIRST_VECTOR_VALUETYPE;
1568 VT != MVT::LAST_VECTOR_VALUETYPE; VT++) {
1569 setOperationAction(ISD::SIGN_EXTEND_INREG, (MVT::SimpleValueType)VT,
1573 // We want to custom lower some of our intrinsics.
1574 setOperationAction(ISD::INTRINSIC_WO_CHAIN, MVT::Other, Custom);
1575 setOperationAction(ISD::INTRINSIC_W_CHAIN, MVT::Other, Custom);
1576 setOperationAction(ISD::INTRINSIC_VOID, MVT::Other, Custom);
1577 if (!Subtarget->is64Bit())
1578 setOperationAction(ISD::INTRINSIC_W_CHAIN, MVT::i64, Custom);
1580 // Only custom-lower 64-bit SADDO and friends on 64-bit because we don't
1581 // handle type legalization for these operations here.
1583 // FIXME: We really should do custom legalization for addition and
1584 // subtraction on x86-32 once PR3203 is fixed. We really can't do much better
1585 // than generic legalization for 64-bit multiplication-with-overflow, though.
1586 for (unsigned i = 0, e = 3+Subtarget->is64Bit(); i != e; ++i) {
1587 // Add/Sub/Mul with overflow operations are custom lowered.
1589 setOperationAction(ISD::SADDO, VT, Custom);
1590 setOperationAction(ISD::UADDO, VT, Custom);
1591 setOperationAction(ISD::SSUBO, VT, Custom);
1592 setOperationAction(ISD::USUBO, VT, Custom);
1593 setOperationAction(ISD::SMULO, VT, Custom);
1594 setOperationAction(ISD::UMULO, VT, Custom);
1597 // There are no 8-bit 3-address imul/mul instructions
1598 setOperationAction(ISD::SMULO, MVT::i8, Expand);
1599 setOperationAction(ISD::UMULO, MVT::i8, Expand);
1601 if (!Subtarget->is64Bit()) {
1602 // These libcalls are not available in 32-bit.
1603 setLibcallName(RTLIB::SHL_I128, nullptr);
1604 setLibcallName(RTLIB::SRL_I128, nullptr);
1605 setLibcallName(RTLIB::SRA_I128, nullptr);
1608 // Combine sin / cos into one node or libcall if possible.
1609 if (Subtarget->hasSinCos()) {
1610 setLibcallName(RTLIB::SINCOS_F32, "sincosf");
1611 setLibcallName(RTLIB::SINCOS_F64, "sincos");
1612 if (Subtarget->isTargetDarwin()) {
1613 // For MacOSX, we don't want to the normal expansion of a libcall to
1614 // sincos. We want to issue a libcall to __sincos_stret to avoid memory
1616 setOperationAction(ISD::FSINCOS, MVT::f64, Custom);
1617 setOperationAction(ISD::FSINCOS, MVT::f32, Custom);
1621 if (Subtarget->isTargetWin64()) {
1622 setOperationAction(ISD::SDIV, MVT::i128, Custom);
1623 setOperationAction(ISD::UDIV, MVT::i128, Custom);
1624 setOperationAction(ISD::SREM, MVT::i128, Custom);
1625 setOperationAction(ISD::UREM, MVT::i128, Custom);
1626 setOperationAction(ISD::SDIVREM, MVT::i128, Custom);
1627 setOperationAction(ISD::UDIVREM, MVT::i128, Custom);
1630 // We have target-specific dag combine patterns for the following nodes:
1631 setTargetDAGCombine(ISD::VECTOR_SHUFFLE);
1632 setTargetDAGCombine(ISD::EXTRACT_VECTOR_ELT);
1633 setTargetDAGCombine(ISD::VSELECT);
1634 setTargetDAGCombine(ISD::SELECT);
1635 setTargetDAGCombine(ISD::SHL);
1636 setTargetDAGCombine(ISD::SRA);
1637 setTargetDAGCombine(ISD::SRL);
1638 setTargetDAGCombine(ISD::OR);
1639 setTargetDAGCombine(ISD::AND);
1640 setTargetDAGCombine(ISD::ADD);
1641 setTargetDAGCombine(ISD::FADD);
1642 setTargetDAGCombine(ISD::FSUB);
1643 setTargetDAGCombine(ISD::FMA);
1644 setTargetDAGCombine(ISD::SUB);
1645 setTargetDAGCombine(ISD::LOAD);
1646 setTargetDAGCombine(ISD::STORE);
1647 setTargetDAGCombine(ISD::ZERO_EXTEND);
1648 setTargetDAGCombine(ISD::ANY_EXTEND);
1649 setTargetDAGCombine(ISD::SIGN_EXTEND);
1650 setTargetDAGCombine(ISD::SIGN_EXTEND_INREG);
1651 setTargetDAGCombine(ISD::TRUNCATE);
1652 setTargetDAGCombine(ISD::SINT_TO_FP);
1653 setTargetDAGCombine(ISD::SETCC);
1654 setTargetDAGCombine(ISD::INTRINSIC_WO_CHAIN);
1655 setTargetDAGCombine(ISD::BUILD_VECTOR);
1656 if (Subtarget->is64Bit())
1657 setTargetDAGCombine(ISD::MUL);
1658 setTargetDAGCombine(ISD::XOR);
1660 computeRegisterProperties();
1662 // On Darwin, -Os means optimize for size without hurting performance,
1663 // do not reduce the limit.
1664 MaxStoresPerMemset = 16; // For @llvm.memset -> sequence of stores
1665 MaxStoresPerMemsetOptSize = Subtarget->isTargetDarwin() ? 16 : 8;
1666 MaxStoresPerMemcpy = 8; // For @llvm.memcpy -> sequence of stores
1667 MaxStoresPerMemcpyOptSize = Subtarget->isTargetDarwin() ? 8 : 4;
1668 MaxStoresPerMemmove = 8; // For @llvm.memmove -> sequence of stores
1669 MaxStoresPerMemmoveOptSize = Subtarget->isTargetDarwin() ? 8 : 4;
1670 setPrefLoopAlignment(4); // 2^4 bytes.
1672 // Predictable cmov don't hurt on atom because it's in-order.
1673 PredictableSelectIsExpensive = !Subtarget->isAtom();
1675 setPrefFunctionAlignment(4); // 2^4 bytes.
1677 verifyIntrinsicTables();
1680 // This has so far only been implemented for 64-bit MachO.
1681 bool X86TargetLowering::useLoadStackGuardNode() const {
1682 return Subtarget->getTargetTriple().getObjectFormat() == Triple::MachO &&
1683 Subtarget->is64Bit();
1686 TargetLoweringBase::LegalizeTypeAction
1687 X86TargetLowering::getPreferredVectorAction(EVT VT) const {
1688 if (ExperimentalVectorWideningLegalization &&
1689 VT.getVectorNumElements() != 1 &&
1690 VT.getVectorElementType().getSimpleVT() != MVT::i1)
1691 return TypeWidenVector;
1693 return TargetLoweringBase::getPreferredVectorAction(VT);
1696 EVT X86TargetLowering::getSetCCResultType(LLVMContext &, EVT VT) const {
1698 return Subtarget->hasAVX512() ? MVT::i1: MVT::i8;
1700 const unsigned NumElts = VT.getVectorNumElements();
1701 const EVT EltVT = VT.getVectorElementType();
1702 if (VT.is512BitVector()) {
1703 if (Subtarget->hasAVX512())
1704 if (EltVT == MVT::i32 || EltVT == MVT::i64 ||
1705 EltVT == MVT::f32 || EltVT == MVT::f64)
1707 case 8: return MVT::v8i1;
1708 case 16: return MVT::v16i1;
1710 if (Subtarget->hasBWI())
1711 if (EltVT == MVT::i8 || EltVT == MVT::i16)
1713 case 32: return MVT::v32i1;
1714 case 64: return MVT::v64i1;
1718 if (VT.is256BitVector() || VT.is128BitVector()) {
1719 if (Subtarget->hasVLX())
1720 if (EltVT == MVT::i32 || EltVT == MVT::i64 ||
1721 EltVT == MVT::f32 || EltVT == MVT::f64)
1723 case 2: return MVT::v2i1;
1724 case 4: return MVT::v4i1;
1725 case 8: return MVT::v8i1;
1727 if (Subtarget->hasBWI() && Subtarget->hasVLX())
1728 if (EltVT == MVT::i8 || EltVT == MVT::i16)
1730 case 8: return MVT::v8i1;
1731 case 16: return MVT::v16i1;
1732 case 32: return MVT::v32i1;
1736 return VT.changeVectorElementTypeToInteger();
1739 /// getMaxByValAlign - Helper for getByValTypeAlignment to determine
1740 /// the desired ByVal argument alignment.
1741 static void getMaxByValAlign(Type *Ty, unsigned &MaxAlign) {
1744 if (VectorType *VTy = dyn_cast<VectorType>(Ty)) {
1745 if (VTy->getBitWidth() == 128)
1747 } else if (ArrayType *ATy = dyn_cast<ArrayType>(Ty)) {
1748 unsigned EltAlign = 0;
1749 getMaxByValAlign(ATy->getElementType(), EltAlign);
1750 if (EltAlign > MaxAlign)
1751 MaxAlign = EltAlign;
1752 } else if (StructType *STy = dyn_cast<StructType>(Ty)) {
1753 for (unsigned i = 0, e = STy->getNumElements(); i != e; ++i) {
1754 unsigned EltAlign = 0;
1755 getMaxByValAlign(STy->getElementType(i), EltAlign);
1756 if (EltAlign > MaxAlign)
1757 MaxAlign = EltAlign;
1764 /// getByValTypeAlignment - Return the desired alignment for ByVal aggregate
1765 /// function arguments in the caller parameter area. For X86, aggregates
1766 /// that contain SSE vectors are placed at 16-byte boundaries while the rest
1767 /// are at 4-byte boundaries.
1768 unsigned X86TargetLowering::getByValTypeAlignment(Type *Ty) const {
1769 if (Subtarget->is64Bit()) {
1770 // Max of 8 and alignment of type.
1771 unsigned TyAlign = TD->getABITypeAlignment(Ty);
1778 if (Subtarget->hasSSE1())
1779 getMaxByValAlign(Ty, Align);
1783 /// getOptimalMemOpType - Returns the target specific optimal type for load
1784 /// and store operations as a result of memset, memcpy, and memmove
1785 /// lowering. If DstAlign is zero that means it's safe to destination
1786 /// alignment can satisfy any constraint. Similarly if SrcAlign is zero it
1787 /// means there isn't a need to check it against alignment requirement,
1788 /// probably because the source does not need to be loaded. If 'IsMemset' is
1789 /// true, that means it's expanding a memset. If 'ZeroMemset' is true, that
1790 /// means it's a memset of zero. 'MemcpyStrSrc' indicates whether the memcpy
1791 /// source is constant so it does not need to be loaded.
1792 /// It returns EVT::Other if the type should be determined using generic
1793 /// target-independent logic.
1795 X86TargetLowering::getOptimalMemOpType(uint64_t Size,
1796 unsigned DstAlign, unsigned SrcAlign,
1797 bool IsMemset, bool ZeroMemset,
1799 MachineFunction &MF) const {
1800 const Function *F = MF.getFunction();
1801 if ((!IsMemset || ZeroMemset) &&
1802 !F->getAttributes().hasAttribute(AttributeSet::FunctionIndex,
1803 Attribute::NoImplicitFloat)) {
1805 (Subtarget->isUnalignedMemAccessFast() ||
1806 ((DstAlign == 0 || DstAlign >= 16) &&
1807 (SrcAlign == 0 || SrcAlign >= 16)))) {
1809 if (Subtarget->hasInt256())
1811 if (Subtarget->hasFp256())
1814 if (Subtarget->hasSSE2())
1816 if (Subtarget->hasSSE1())
1818 } else if (!MemcpyStrSrc && Size >= 8 &&
1819 !Subtarget->is64Bit() &&
1820 Subtarget->hasSSE2()) {
1821 // Do not use f64 to lower memcpy if source is string constant. It's
1822 // better to use i32 to avoid the loads.
1826 if (Subtarget->is64Bit() && Size >= 8)
1831 bool X86TargetLowering::isSafeMemOpType(MVT VT) const {
1833 return X86ScalarSSEf32;
1834 else if (VT == MVT::f64)
1835 return X86ScalarSSEf64;
1840 X86TargetLowering::allowsMisalignedMemoryAccesses(EVT VT,
1845 *Fast = Subtarget->isUnalignedMemAccessFast();
1849 /// getJumpTableEncoding - Return the entry encoding for a jump table in the
1850 /// current function. The returned value is a member of the
1851 /// MachineJumpTableInfo::JTEntryKind enum.
1852 unsigned X86TargetLowering::getJumpTableEncoding() const {
1853 // In GOT pic mode, each entry in the jump table is emitted as a @GOTOFF
1855 if (getTargetMachine().getRelocationModel() == Reloc::PIC_ &&
1856 Subtarget->isPICStyleGOT())
1857 return MachineJumpTableInfo::EK_Custom32;
1859 // Otherwise, use the normal jump table encoding heuristics.
1860 return TargetLowering::getJumpTableEncoding();
1864 X86TargetLowering::LowerCustomJumpTableEntry(const MachineJumpTableInfo *MJTI,
1865 const MachineBasicBlock *MBB,
1866 unsigned uid,MCContext &Ctx) const{
1867 assert(MBB->getParent()->getTarget().getRelocationModel() == Reloc::PIC_ &&
1868 Subtarget->isPICStyleGOT());
1869 // In 32-bit ELF systems, our jump table entries are formed with @GOTOFF
1871 return MCSymbolRefExpr::Create(MBB->getSymbol(),
1872 MCSymbolRefExpr::VK_GOTOFF, Ctx);
1875 /// getPICJumpTableRelocaBase - Returns relocation base for the given PIC
1877 SDValue X86TargetLowering::getPICJumpTableRelocBase(SDValue Table,
1878 SelectionDAG &DAG) const {
1879 if (!Subtarget->is64Bit())
1880 // This doesn't have SDLoc associated with it, but is not really the
1881 // same as a Register.
1882 return DAG.getNode(X86ISD::GlobalBaseReg, SDLoc(), getPointerTy());
1886 /// getPICJumpTableRelocBaseExpr - This returns the relocation base for the
1887 /// given PIC jumptable, the same as getPICJumpTableRelocBase, but as an
1889 const MCExpr *X86TargetLowering::
1890 getPICJumpTableRelocBaseExpr(const MachineFunction *MF, unsigned JTI,
1891 MCContext &Ctx) const {
1892 // X86-64 uses RIP relative addressing based on the jump table label.
1893 if (Subtarget->isPICStyleRIPRel())
1894 return TargetLowering::getPICJumpTableRelocBaseExpr(MF, JTI, Ctx);
1896 // Otherwise, the reference is relative to the PIC base.
1897 return MCSymbolRefExpr::Create(MF->getPICBaseSymbol(), Ctx);
1900 // FIXME: Why this routine is here? Move to RegInfo!
1901 std::pair<const TargetRegisterClass*, uint8_t>
1902 X86TargetLowering::findRepresentativeClass(MVT VT) const{
1903 const TargetRegisterClass *RRC = nullptr;
1905 switch (VT.SimpleTy) {
1907 return TargetLowering::findRepresentativeClass(VT);
1908 case MVT::i8: case MVT::i16: case MVT::i32: case MVT::i64:
1909 RRC = Subtarget->is64Bit() ? &X86::GR64RegClass : &X86::GR32RegClass;
1912 RRC = &X86::VR64RegClass;
1914 case MVT::f32: case MVT::f64:
1915 case MVT::v16i8: case MVT::v8i16: case MVT::v4i32: case MVT::v2i64:
1916 case MVT::v4f32: case MVT::v2f64:
1917 case MVT::v32i8: case MVT::v8i32: case MVT::v4i64: case MVT::v8f32:
1919 RRC = &X86::VR128RegClass;
1922 return std::make_pair(RRC, Cost);
1925 bool X86TargetLowering::getStackCookieLocation(unsigned &AddressSpace,
1926 unsigned &Offset) const {
1927 if (!Subtarget->isTargetLinux())
1930 if (Subtarget->is64Bit()) {
1931 // %fs:0x28, unless we're using a Kernel code model, in which case it's %gs:
1933 if (getTargetMachine().getCodeModel() == CodeModel::Kernel)
1945 bool X86TargetLowering::isNoopAddrSpaceCast(unsigned SrcAS,
1946 unsigned DestAS) const {
1947 assert(SrcAS != DestAS && "Expected different address spaces!");
1949 return SrcAS < 256 && DestAS < 256;
1952 //===----------------------------------------------------------------------===//
1953 // Return Value Calling Convention Implementation
1954 //===----------------------------------------------------------------------===//
1956 #include "X86GenCallingConv.inc"
1959 X86TargetLowering::CanLowerReturn(CallingConv::ID CallConv,
1960 MachineFunction &MF, bool isVarArg,
1961 const SmallVectorImpl<ISD::OutputArg> &Outs,
1962 LLVMContext &Context) const {
1963 SmallVector<CCValAssign, 16> RVLocs;
1964 CCState CCInfo(CallConv, isVarArg, MF, RVLocs, Context);
1965 return CCInfo.CheckReturn(Outs, RetCC_X86);
1968 const MCPhysReg *X86TargetLowering::getScratchRegisters(CallingConv::ID) const {
1969 static const MCPhysReg ScratchRegs[] = { X86::R11, 0 };
1974 X86TargetLowering::LowerReturn(SDValue Chain,
1975 CallingConv::ID CallConv, bool isVarArg,
1976 const SmallVectorImpl<ISD::OutputArg> &Outs,
1977 const SmallVectorImpl<SDValue> &OutVals,
1978 SDLoc dl, SelectionDAG &DAG) const {
1979 MachineFunction &MF = DAG.getMachineFunction();
1980 X86MachineFunctionInfo *FuncInfo = MF.getInfo<X86MachineFunctionInfo>();
1982 SmallVector<CCValAssign, 16> RVLocs;
1983 CCState CCInfo(CallConv, isVarArg, MF, RVLocs, *DAG.getContext());
1984 CCInfo.AnalyzeReturn(Outs, RetCC_X86);
1987 SmallVector<SDValue, 6> RetOps;
1988 RetOps.push_back(Chain); // Operand #0 = Chain (updated below)
1989 // Operand #1 = Bytes To Pop
1990 RetOps.push_back(DAG.getTargetConstant(FuncInfo->getBytesToPopOnReturn(),
1993 // Copy the result values into the output registers.
1994 for (unsigned i = 0; i != RVLocs.size(); ++i) {
1995 CCValAssign &VA = RVLocs[i];
1996 assert(VA.isRegLoc() && "Can only return in registers!");
1997 SDValue ValToCopy = OutVals[i];
1998 EVT ValVT = ValToCopy.getValueType();
2000 // Promote values to the appropriate types
2001 if (VA.getLocInfo() == CCValAssign::SExt)
2002 ValToCopy = DAG.getNode(ISD::SIGN_EXTEND, dl, VA.getLocVT(), ValToCopy);
2003 else if (VA.getLocInfo() == CCValAssign::ZExt)
2004 ValToCopy = DAG.getNode(ISD::ZERO_EXTEND, dl, VA.getLocVT(), ValToCopy);
2005 else if (VA.getLocInfo() == CCValAssign::AExt)
2006 ValToCopy = DAG.getNode(ISD::ANY_EXTEND, dl, VA.getLocVT(), ValToCopy);
2007 else if (VA.getLocInfo() == CCValAssign::BCvt)
2008 ValToCopy = DAG.getNode(ISD::BITCAST, dl, VA.getLocVT(), ValToCopy);
2010 assert(VA.getLocInfo() != CCValAssign::FPExt &&
2011 "Unexpected FP-extend for return value.");
2013 // If this is x86-64, and we disabled SSE, we can't return FP values,
2014 // or SSE or MMX vectors.
2015 if ((ValVT == MVT::f32 || ValVT == MVT::f64 ||
2016 VA.getLocReg() == X86::XMM0 || VA.getLocReg() == X86::XMM1) &&
2017 (Subtarget->is64Bit() && !Subtarget->hasSSE1())) {
2018 report_fatal_error("SSE register return with SSE disabled");
2020 // Likewise we can't return F64 values with SSE1 only. gcc does so, but
2021 // llvm-gcc has never done it right and no one has noticed, so this
2022 // should be OK for now.
2023 if (ValVT == MVT::f64 &&
2024 (Subtarget->is64Bit() && !Subtarget->hasSSE2()))
2025 report_fatal_error("SSE2 register return with SSE2 disabled");
2027 // Returns in ST0/ST1 are handled specially: these are pushed as operands to
2028 // the RET instruction and handled by the FP Stackifier.
2029 if (VA.getLocReg() == X86::FP0 ||
2030 VA.getLocReg() == X86::FP1) {
2031 // If this is a copy from an xmm register to ST(0), use an FPExtend to
2032 // change the value to the FP stack register class.
2033 if (isScalarFPTypeInSSEReg(VA.getValVT()))
2034 ValToCopy = DAG.getNode(ISD::FP_EXTEND, dl, MVT::f80, ValToCopy);
2035 RetOps.push_back(ValToCopy);
2036 // Don't emit a copytoreg.
2040 // 64-bit vector (MMX) values are returned in XMM0 / XMM1 except for v1i64
2041 // which is returned in RAX / RDX.
2042 if (Subtarget->is64Bit()) {
2043 if (ValVT == MVT::x86mmx) {
2044 if (VA.getLocReg() == X86::XMM0 || VA.getLocReg() == X86::XMM1) {
2045 ValToCopy = DAG.getNode(ISD::BITCAST, dl, MVT::i64, ValToCopy);
2046 ValToCopy = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, MVT::v2i64,
2048 // If we don't have SSE2 available, convert to v4f32 so the generated
2049 // register is legal.
2050 if (!Subtarget->hasSSE2())
2051 ValToCopy = DAG.getNode(ISD::BITCAST, dl, MVT::v4f32,ValToCopy);
2056 Chain = DAG.getCopyToReg(Chain, dl, VA.getLocReg(), ValToCopy, Flag);
2057 Flag = Chain.getValue(1);
2058 RetOps.push_back(DAG.getRegister(VA.getLocReg(), VA.getLocVT()));
2061 // The x86-64 ABIs require that for returning structs by value we copy
2062 // the sret argument into %rax/%eax (depending on ABI) for the return.
2063 // Win32 requires us to put the sret argument to %eax as well.
2064 // We saved the argument into a virtual register in the entry block,
2065 // so now we copy the value out and into %rax/%eax.
2066 if (DAG.getMachineFunction().getFunction()->hasStructRetAttr() &&
2067 (Subtarget->is64Bit() || Subtarget->isTargetKnownWindowsMSVC())) {
2068 MachineFunction &MF = DAG.getMachineFunction();
2069 X86MachineFunctionInfo *FuncInfo = MF.getInfo<X86MachineFunctionInfo>();
2070 unsigned Reg = FuncInfo->getSRetReturnReg();
2072 "SRetReturnReg should have been set in LowerFormalArguments().");
2073 SDValue Val = DAG.getCopyFromReg(Chain, dl, Reg, getPointerTy());
2076 = (Subtarget->is64Bit() && !Subtarget->isTarget64BitILP32()) ?
2077 X86::RAX : X86::EAX;
2078 Chain = DAG.getCopyToReg(Chain, dl, RetValReg, Val, Flag);
2079 Flag = Chain.getValue(1);
2081 // RAX/EAX now acts like a return value.
2082 RetOps.push_back(DAG.getRegister(RetValReg, getPointerTy()));
2085 RetOps[0] = Chain; // Update chain.
2087 // Add the flag if we have it.
2089 RetOps.push_back(Flag);
2091 return DAG.getNode(X86ISD::RET_FLAG, dl, MVT::Other, RetOps);
2094 bool X86TargetLowering::isUsedByReturnOnly(SDNode *N, SDValue &Chain) const {
2095 if (N->getNumValues() != 1)
2097 if (!N->hasNUsesOfValue(1, 0))
2100 SDValue TCChain = Chain;
2101 SDNode *Copy = *N->use_begin();
2102 if (Copy->getOpcode() == ISD::CopyToReg) {
2103 // If the copy has a glue operand, we conservatively assume it isn't safe to
2104 // perform a tail call.
2105 if (Copy->getOperand(Copy->getNumOperands()-1).getValueType() == MVT::Glue)
2107 TCChain = Copy->getOperand(0);
2108 } else if (Copy->getOpcode() != ISD::FP_EXTEND)
2111 bool HasRet = false;
2112 for (SDNode::use_iterator UI = Copy->use_begin(), UE = Copy->use_end();
2114 if (UI->getOpcode() != X86ISD::RET_FLAG)
2116 // If we are returning more than one value, we can definitely
2117 // not make a tail call see PR19530
2118 if (UI->getNumOperands() > 4)
2120 if (UI->getNumOperands() == 4 &&
2121 UI->getOperand(UI->getNumOperands()-1).getValueType() != MVT::Glue)
2134 X86TargetLowering::getTypeForExtArgOrReturn(LLVMContext &Context, EVT VT,
2135 ISD::NodeType ExtendKind) const {
2137 // TODO: Is this also valid on 32-bit?
2138 if (Subtarget->is64Bit() && VT == MVT::i1 && ExtendKind == ISD::ZERO_EXTEND)
2139 ReturnMVT = MVT::i8;
2141 ReturnMVT = MVT::i32;
2143 EVT MinVT = getRegisterType(Context, ReturnMVT);
2144 return VT.bitsLT(MinVT) ? MinVT : VT;
2147 /// LowerCallResult - Lower the result values of a call into the
2148 /// appropriate copies out of appropriate physical registers.
2151 X86TargetLowering::LowerCallResult(SDValue Chain, SDValue InFlag,
2152 CallingConv::ID CallConv, bool isVarArg,
2153 const SmallVectorImpl<ISD::InputArg> &Ins,
2154 SDLoc dl, SelectionDAG &DAG,
2155 SmallVectorImpl<SDValue> &InVals) const {
2157 // Assign locations to each value returned by this call.
2158 SmallVector<CCValAssign, 16> RVLocs;
2159 bool Is64Bit = Subtarget->is64Bit();
2160 CCState CCInfo(CallConv, isVarArg, DAG.getMachineFunction(), RVLocs,
2162 CCInfo.AnalyzeCallResult(Ins, RetCC_X86);
2164 // Copy all of the result registers out of their specified physreg.
2165 for (unsigned i = 0, e = RVLocs.size(); i != e; ++i) {
2166 CCValAssign &VA = RVLocs[i];
2167 EVT CopyVT = VA.getValVT();
2169 // If this is x86-64, and we disabled SSE, we can't return FP values
2170 if ((CopyVT == MVT::f32 || CopyVT == MVT::f64) &&
2171 ((Is64Bit || Ins[i].Flags.isInReg()) && !Subtarget->hasSSE1())) {
2172 report_fatal_error("SSE register return with SSE disabled");
2175 // If we prefer to use the value in xmm registers, copy it out as f80 and
2176 // use a truncate to move it from fp stack reg to xmm reg.
2177 if ((VA.getLocReg() == X86::FP0 || VA.getLocReg() == X86::FP1) &&
2178 isScalarFPTypeInSSEReg(VA.getValVT()))
2181 Chain = DAG.getCopyFromReg(Chain, dl, VA.getLocReg(),
2182 CopyVT, InFlag).getValue(1);
2183 SDValue Val = Chain.getValue(0);
2185 if (CopyVT != VA.getValVT())
2186 Val = DAG.getNode(ISD::FP_ROUND, dl, VA.getValVT(), Val,
2187 // This truncation won't change the value.
2188 DAG.getIntPtrConstant(1));
2190 InFlag = Chain.getValue(2);
2191 InVals.push_back(Val);
2197 //===----------------------------------------------------------------------===//
2198 // C & StdCall & Fast Calling Convention implementation
2199 //===----------------------------------------------------------------------===//
2200 // StdCall calling convention seems to be standard for many Windows' API
2201 // routines and around. It differs from C calling convention just a little:
2202 // callee should clean up the stack, not caller. Symbols should be also
2203 // decorated in some fancy way :) It doesn't support any vector arguments.
2204 // For info on fast calling convention see Fast Calling Convention (tail call)
2205 // implementation LowerX86_32FastCCCallTo.
2207 /// CallIsStructReturn - Determines whether a call uses struct return
2209 enum StructReturnType {
2214 static StructReturnType
2215 callIsStructReturn(const SmallVectorImpl<ISD::OutputArg> &Outs) {
2217 return NotStructReturn;
2219 const ISD::ArgFlagsTy &Flags = Outs[0].Flags;
2220 if (!Flags.isSRet())
2221 return NotStructReturn;
2222 if (Flags.isInReg())
2223 return RegStructReturn;
2224 return StackStructReturn;
2227 /// ArgsAreStructReturn - Determines whether a function uses struct
2228 /// return semantics.
2229 static StructReturnType
2230 argsAreStructReturn(const SmallVectorImpl<ISD::InputArg> &Ins) {
2232 return NotStructReturn;
2234 const ISD::ArgFlagsTy &Flags = Ins[0].Flags;
2235 if (!Flags.isSRet())
2236 return NotStructReturn;
2237 if (Flags.isInReg())
2238 return RegStructReturn;
2239 return StackStructReturn;
2242 /// CreateCopyOfByValArgument - Make a copy of an aggregate at address specified
2243 /// by "Src" to address "Dst" with size and alignment information specified by
2244 /// the specific parameter attribute. The copy will be passed as a byval
2245 /// function parameter.
2247 CreateCopyOfByValArgument(SDValue Src, SDValue Dst, SDValue Chain,
2248 ISD::ArgFlagsTy Flags, SelectionDAG &DAG,
2250 SDValue SizeNode = DAG.getConstant(Flags.getByValSize(), MVT::i32);
2252 return DAG.getMemcpy(Chain, dl, Dst, Src, SizeNode, Flags.getByValAlign(),
2253 /*isVolatile*/false, /*AlwaysInline=*/true,
2254 MachinePointerInfo(), MachinePointerInfo());
2257 /// IsTailCallConvention - Return true if the calling convention is one that
2258 /// supports tail call optimization.
2259 static bool IsTailCallConvention(CallingConv::ID CC) {
2260 return (CC == CallingConv::Fast || CC == CallingConv::GHC ||
2261 CC == CallingConv::HiPE);
2264 /// \brief Return true if the calling convention is a C calling convention.
2265 static bool IsCCallConvention(CallingConv::ID CC) {
2266 return (CC == CallingConv::C || CC == CallingConv::X86_64_Win64 ||
2267 CC == CallingConv::X86_64_SysV);
2270 bool X86TargetLowering::mayBeEmittedAsTailCall(CallInst *CI) const {
2271 if (!CI->isTailCall() || getTargetMachine().Options.DisableTailCalls)
2275 CallingConv::ID CalleeCC = CS.getCallingConv();
2276 if (!IsTailCallConvention(CalleeCC) && !IsCCallConvention(CalleeCC))
2282 /// FuncIsMadeTailCallSafe - Return true if the function is being made into
2283 /// a tailcall target by changing its ABI.
2284 static bool FuncIsMadeTailCallSafe(CallingConv::ID CC,
2285 bool GuaranteedTailCallOpt) {
2286 return GuaranteedTailCallOpt && IsTailCallConvention(CC);
2290 X86TargetLowering::LowerMemArgument(SDValue Chain,
2291 CallingConv::ID CallConv,
2292 const SmallVectorImpl<ISD::InputArg> &Ins,
2293 SDLoc dl, SelectionDAG &DAG,
2294 const CCValAssign &VA,
2295 MachineFrameInfo *MFI,
2297 // Create the nodes corresponding to a load from this parameter slot.
2298 ISD::ArgFlagsTy Flags = Ins[i].Flags;
2299 bool AlwaysUseMutable = FuncIsMadeTailCallSafe(
2300 CallConv, DAG.getTarget().Options.GuaranteedTailCallOpt);
2301 bool isImmutable = !AlwaysUseMutable && !Flags.isByVal();
2304 // If value is passed by pointer we have address passed instead of the value
2306 if (VA.getLocInfo() == CCValAssign::Indirect)
2307 ValVT = VA.getLocVT();
2309 ValVT = VA.getValVT();
2311 // FIXME: For now, all byval parameter objects are marked mutable. This can be
2312 // changed with more analysis.
2313 // In case of tail call optimization mark all arguments mutable. Since they
2314 // could be overwritten by lowering of arguments in case of a tail call.
2315 if (Flags.isByVal()) {
2316 unsigned Bytes = Flags.getByValSize();
2317 if (Bytes == 0) Bytes = 1; // Don't create zero-sized stack objects.
2318 int FI = MFI->CreateFixedObject(Bytes, VA.getLocMemOffset(), isImmutable);
2319 return DAG.getFrameIndex(FI, getPointerTy());
2321 int FI = MFI->CreateFixedObject(ValVT.getSizeInBits()/8,
2322 VA.getLocMemOffset(), isImmutable);
2323 SDValue FIN = DAG.getFrameIndex(FI, getPointerTy());
2324 return DAG.getLoad(ValVT, dl, Chain, FIN,
2325 MachinePointerInfo::getFixedStack(FI),
2326 false, false, false, 0);
2330 // FIXME: Get this from tablegen.
2331 static ArrayRef<MCPhysReg> get64BitArgumentGPRs(CallingConv::ID CallConv,
2332 const X86Subtarget *Subtarget) {
2333 assert(Subtarget->is64Bit());
2335 if (Subtarget->isCallingConvWin64(CallConv)) {
2336 static const MCPhysReg GPR64ArgRegsWin64[] = {
2337 X86::RCX, X86::RDX, X86::R8, X86::R9
2339 return makeArrayRef(std::begin(GPR64ArgRegsWin64), std::end(GPR64ArgRegsWin64));
2342 static const MCPhysReg GPR64ArgRegs64Bit[] = {
2343 X86::RDI, X86::RSI, X86::RDX, X86::RCX, X86::R8, X86::R9
2345 return makeArrayRef(std::begin(GPR64ArgRegs64Bit), std::end(GPR64ArgRegs64Bit));
2348 // FIXME: Get this from tablegen.
2349 static ArrayRef<MCPhysReg> get64BitArgumentXMMs(MachineFunction &MF,
2350 CallingConv::ID CallConv,
2351 const X86Subtarget *Subtarget) {
2352 assert(Subtarget->is64Bit());
2353 if (Subtarget->isCallingConvWin64(CallConv)) {
2354 // The XMM registers which might contain var arg parameters are shadowed
2355 // in their paired GPR. So we only need to save the GPR to their home
2357 // TODO: __vectorcall will change this.
2361 const Function *Fn = MF.getFunction();
2362 bool NoImplicitFloatOps = Fn->getAttributes().
2363 hasAttribute(AttributeSet::FunctionIndex, Attribute::NoImplicitFloat);
2364 assert(!(MF.getTarget().Options.UseSoftFloat && NoImplicitFloatOps) &&
2365 "SSE register cannot be used when SSE is disabled!");
2366 if (MF.getTarget().Options.UseSoftFloat || NoImplicitFloatOps ||
2367 !Subtarget->hasSSE1())
2368 // Kernel mode asks for SSE to be disabled, so there are no XMM argument
2372 static const MCPhysReg XMMArgRegs64Bit[] = {
2373 X86::XMM0, X86::XMM1, X86::XMM2, X86::XMM3,
2374 X86::XMM4, X86::XMM5, X86::XMM6, X86::XMM7
2376 return makeArrayRef(std::begin(XMMArgRegs64Bit), std::end(XMMArgRegs64Bit));
2380 X86TargetLowering::LowerFormalArguments(SDValue Chain,
2381 CallingConv::ID CallConv,
2383 const SmallVectorImpl<ISD::InputArg> &Ins,
2386 SmallVectorImpl<SDValue> &InVals)
2388 MachineFunction &MF = DAG.getMachineFunction();
2389 X86MachineFunctionInfo *FuncInfo = MF.getInfo<X86MachineFunctionInfo>();
2391 const Function* Fn = MF.getFunction();
2392 if (Fn->hasExternalLinkage() &&
2393 Subtarget->isTargetCygMing() &&
2394 Fn->getName() == "main")
2395 FuncInfo->setForceFramePointer(true);
2397 MachineFrameInfo *MFI = MF.getFrameInfo();
2398 bool Is64Bit = Subtarget->is64Bit();
2399 bool IsWin64 = Subtarget->isCallingConvWin64(CallConv);
2401 assert(!(isVarArg && IsTailCallConvention(CallConv)) &&
2402 "Var args not supported with calling convention fastcc, ghc or hipe");
2404 // Assign locations to all of the incoming arguments.
2405 SmallVector<CCValAssign, 16> ArgLocs;
2406 CCState CCInfo(CallConv, isVarArg, MF, ArgLocs, *DAG.getContext());
2408 // Allocate shadow area for Win64
2410 CCInfo.AllocateStack(32, 8);
2412 CCInfo.AnalyzeFormalArguments(Ins, CC_X86);
2414 unsigned LastVal = ~0U;
2416 for (unsigned i = 0, e = ArgLocs.size(); i != e; ++i) {
2417 CCValAssign &VA = ArgLocs[i];
2418 // TODO: If an arg is passed in two places (e.g. reg and stack), skip later
2420 assert(VA.getValNo() != LastVal &&
2421 "Don't support value assigned to multiple locs yet");
2423 LastVal = VA.getValNo();
2425 if (VA.isRegLoc()) {
2426 EVT RegVT = VA.getLocVT();
2427 const TargetRegisterClass *RC;
2428 if (RegVT == MVT::i32)
2429 RC = &X86::GR32RegClass;
2430 else if (Is64Bit && RegVT == MVT::i64)
2431 RC = &X86::GR64RegClass;
2432 else if (RegVT == MVT::f32)
2433 RC = &X86::FR32RegClass;
2434 else if (RegVT == MVT::f64)
2435 RC = &X86::FR64RegClass;
2436 else if (RegVT.is512BitVector())
2437 RC = &X86::VR512RegClass;
2438 else if (RegVT.is256BitVector())
2439 RC = &X86::VR256RegClass;
2440 else if (RegVT.is128BitVector())
2441 RC = &X86::VR128RegClass;
2442 else if (RegVT == MVT::x86mmx)
2443 RC = &X86::VR64RegClass;
2444 else if (RegVT == MVT::i1)
2445 RC = &X86::VK1RegClass;
2446 else if (RegVT == MVT::v8i1)
2447 RC = &X86::VK8RegClass;
2448 else if (RegVT == MVT::v16i1)
2449 RC = &X86::VK16RegClass;
2450 else if (RegVT == MVT::v32i1)
2451 RC = &X86::VK32RegClass;
2452 else if (RegVT == MVT::v64i1)
2453 RC = &X86::VK64RegClass;
2455 llvm_unreachable("Unknown argument type!");
2457 unsigned Reg = MF.addLiveIn(VA.getLocReg(), RC);
2458 ArgValue = DAG.getCopyFromReg(Chain, dl, Reg, RegVT);
2460 // If this is an 8 or 16-bit value, it is really passed promoted to 32
2461 // bits. Insert an assert[sz]ext to capture this, then truncate to the
2463 if (VA.getLocInfo() == CCValAssign::SExt)
2464 ArgValue = DAG.getNode(ISD::AssertSext, dl, RegVT, ArgValue,
2465 DAG.getValueType(VA.getValVT()));
2466 else if (VA.getLocInfo() == CCValAssign::ZExt)
2467 ArgValue = DAG.getNode(ISD::AssertZext, dl, RegVT, ArgValue,
2468 DAG.getValueType(VA.getValVT()));
2469 else if (VA.getLocInfo() == CCValAssign::BCvt)
2470 ArgValue = DAG.getNode(ISD::BITCAST, dl, VA.getValVT(), ArgValue);
2472 if (VA.isExtInLoc()) {
2473 // Handle MMX values passed in XMM regs.
2474 if (RegVT.isVector())
2475 ArgValue = DAG.getNode(X86ISD::MOVDQ2Q, dl, VA.getValVT(), ArgValue);
2477 ArgValue = DAG.getNode(ISD::TRUNCATE, dl, VA.getValVT(), ArgValue);
2480 assert(VA.isMemLoc());
2481 ArgValue = LowerMemArgument(Chain, CallConv, Ins, dl, DAG, VA, MFI, i);
2484 // If value is passed via pointer - do a load.
2485 if (VA.getLocInfo() == CCValAssign::Indirect)
2486 ArgValue = DAG.getLoad(VA.getValVT(), dl, Chain, ArgValue,
2487 MachinePointerInfo(), false, false, false, 0);
2489 InVals.push_back(ArgValue);
2492 if (Subtarget->is64Bit() || Subtarget->isTargetKnownWindowsMSVC()) {
2493 for (unsigned i = 0, e = ArgLocs.size(); i != e; ++i) {
2494 // The x86-64 ABIs require that for returning structs by value we copy
2495 // the sret argument into %rax/%eax (depending on ABI) for the return.
2496 // Win32 requires us to put the sret argument to %eax as well.
2497 // Save the argument into a virtual register so that we can access it
2498 // from the return points.
2499 if (Ins[i].Flags.isSRet()) {
2500 unsigned Reg = FuncInfo->getSRetReturnReg();
2502 MVT PtrTy = getPointerTy();
2503 Reg = MF.getRegInfo().createVirtualRegister(getRegClassFor(PtrTy));
2504 FuncInfo->setSRetReturnReg(Reg);
2506 SDValue Copy = DAG.getCopyToReg(DAG.getEntryNode(), dl, Reg, InVals[i]);
2507 Chain = DAG.getNode(ISD::TokenFactor, dl, MVT::Other, Copy, Chain);
2513 unsigned StackSize = CCInfo.getNextStackOffset();
2514 // Align stack specially for tail calls.
2515 if (FuncIsMadeTailCallSafe(CallConv,
2516 MF.getTarget().Options.GuaranteedTailCallOpt))
2517 StackSize = GetAlignedArgumentStackSize(StackSize, DAG);
2519 // If the function takes variable number of arguments, make a frame index for
2520 // the start of the first vararg value... for expansion of llvm.va_start. We
2521 // can skip this if there are no va_start calls.
2522 if (MFI->hasVAStart() &&
2523 (Is64Bit || (CallConv != CallingConv::X86_FastCall &&
2524 CallConv != CallingConv::X86_ThisCall))) {
2525 FuncInfo->setVarArgsFrameIndex(
2526 MFI->CreateFixedObject(1, StackSize, true));
2529 // 64-bit calling conventions support varargs and register parameters, so we
2530 // have to do extra work to spill them in the prologue or forward them to
2532 if (Is64Bit && isVarArg &&
2533 (MFI->hasVAStart() || MFI->hasMustTailInVarArgFunc())) {
2534 // Find the first unallocated argument registers.
2535 ArrayRef<MCPhysReg> ArgGPRs = get64BitArgumentGPRs(CallConv, Subtarget);
2536 ArrayRef<MCPhysReg> ArgXMMs = get64BitArgumentXMMs(MF, CallConv, Subtarget);
2537 unsigned NumIntRegs =
2538 CCInfo.getFirstUnallocated(ArgGPRs.data(), ArgGPRs.size());
2539 unsigned NumXMMRegs =
2540 CCInfo.getFirstUnallocated(ArgXMMs.data(), ArgXMMs.size());
2541 assert(!(NumXMMRegs && !Subtarget->hasSSE1()) &&
2542 "SSE register cannot be used when SSE is disabled!");
2544 // Gather all the live in physical registers.
2545 SmallVector<SDValue, 6> LiveGPRs;
2546 SmallVector<SDValue, 8> LiveXMMRegs;
2548 for (MCPhysReg Reg : ArgGPRs.slice(NumIntRegs)) {
2549 unsigned GPR = MF.addLiveIn(Reg, &X86::GR64RegClass);
2551 DAG.getCopyFromReg(Chain, dl, GPR, MVT::i64));
2553 if (!ArgXMMs.empty()) {
2554 unsigned AL = MF.addLiveIn(X86::AL, &X86::GR8RegClass);
2555 ALVal = DAG.getCopyFromReg(Chain, dl, AL, MVT::i8);
2556 for (MCPhysReg Reg : ArgXMMs.slice(NumXMMRegs)) {
2557 unsigned XMMReg = MF.addLiveIn(Reg, &X86::VR128RegClass);
2558 LiveXMMRegs.push_back(
2559 DAG.getCopyFromReg(Chain, dl, XMMReg, MVT::v4f32));
2563 // Store them to the va_list returned by va_start.
2564 if (MFI->hasVAStart()) {
2566 const TargetFrameLowering &TFI = *MF.getSubtarget().getFrameLowering();
2567 // Get to the caller-allocated home save location. Add 8 to account
2568 // for the return address.
2569 int HomeOffset = TFI.getOffsetOfLocalArea() + 8;
2570 FuncInfo->setRegSaveFrameIndex(
2571 MFI->CreateFixedObject(1, NumIntRegs * 8 + HomeOffset, false));
2572 // Fixup to set vararg frame on shadow area (4 x i64).
2574 FuncInfo->setVarArgsFrameIndex(FuncInfo->getRegSaveFrameIndex());
2576 // For X86-64, if there are vararg parameters that are passed via
2577 // registers, then we must store them to their spots on the stack so
2578 // they may be loaded by deferencing the result of va_next.
2579 FuncInfo->setVarArgsGPOffset(NumIntRegs * 8);
2580 FuncInfo->setVarArgsFPOffset(ArgGPRs.size() * 8 + NumXMMRegs * 16);
2581 FuncInfo->setRegSaveFrameIndex(MFI->CreateStackObject(
2582 ArgGPRs.size() * 8 + ArgXMMs.size() * 16, 16, false));
2585 // Store the integer parameter registers.
2586 SmallVector<SDValue, 8> MemOps;
2587 SDValue RSFIN = DAG.getFrameIndex(FuncInfo->getRegSaveFrameIndex(),
2589 unsigned Offset = FuncInfo->getVarArgsGPOffset();
2590 for (SDValue Val : LiveGPRs) {
2591 SDValue FIN = DAG.getNode(ISD::ADD, dl, getPointerTy(), RSFIN,
2592 DAG.getIntPtrConstant(Offset));
2594 DAG.getStore(Val.getValue(1), dl, Val, FIN,
2595 MachinePointerInfo::getFixedStack(
2596 FuncInfo->getRegSaveFrameIndex(), Offset),
2598 MemOps.push_back(Store);
2602 if (!ArgXMMs.empty() && NumXMMRegs != ArgXMMs.size()) {
2603 // Now store the XMM (fp + vector) parameter registers.
2604 SmallVector<SDValue, 12> SaveXMMOps;
2605 SaveXMMOps.push_back(Chain);
2606 SaveXMMOps.push_back(ALVal);
2607 SaveXMMOps.push_back(DAG.getIntPtrConstant(
2608 FuncInfo->getRegSaveFrameIndex()));
2609 SaveXMMOps.push_back(DAG.getIntPtrConstant(
2610 FuncInfo->getVarArgsFPOffset()));
2611 SaveXMMOps.insert(SaveXMMOps.end(), LiveXMMRegs.begin(),
2613 MemOps.push_back(DAG.getNode(X86ISD::VASTART_SAVE_XMM_REGS, dl,
2614 MVT::Other, SaveXMMOps));
2617 if (!MemOps.empty())
2618 Chain = DAG.getNode(ISD::TokenFactor, dl, MVT::Other, MemOps);
2620 // Add all GPRs, al, and XMMs to the list of forwards. We will add then
2621 // to the liveout set on a musttail call.
2622 assert(MFI->hasMustTailInVarArgFunc());
2623 auto &Forwards = FuncInfo->getForwardedMustTailRegParms();
2624 typedef X86MachineFunctionInfo::Forward Forward;
2626 for (unsigned I = 0, E = LiveGPRs.size(); I != E; ++I) {
2628 MF.getRegInfo().createVirtualRegister(&X86::GR64RegClass);
2629 Chain = DAG.getCopyToReg(Chain, dl, VReg, LiveGPRs[I]);
2630 Forwards.push_back(Forward(VReg, ArgGPRs[NumIntRegs + I], MVT::i64));
2633 if (!ArgXMMs.empty()) {
2635 MF.getRegInfo().createVirtualRegister(&X86::GR8RegClass);
2636 Chain = DAG.getCopyToReg(Chain, dl, ALVReg, ALVal);
2637 Forwards.push_back(Forward(ALVReg, X86::AL, MVT::i8));
2639 for (unsigned I = 0, E = LiveXMMRegs.size(); I != E; ++I) {
2641 MF.getRegInfo().createVirtualRegister(&X86::VR128RegClass);
2642 Chain = DAG.getCopyToReg(Chain, dl, VReg, LiveXMMRegs[I]);
2644 Forward(VReg, ArgXMMs[NumXMMRegs + I], MVT::v4f32));
2650 // Some CCs need callee pop.
2651 if (X86::isCalleePop(CallConv, Is64Bit, isVarArg,
2652 MF.getTarget().Options.GuaranteedTailCallOpt)) {
2653 FuncInfo->setBytesToPopOnReturn(StackSize); // Callee pops everything.
2655 FuncInfo->setBytesToPopOnReturn(0); // Callee pops nothing.
2656 // If this is an sret function, the return should pop the hidden pointer.
2657 if (!Is64Bit && !IsTailCallConvention(CallConv) &&
2658 !Subtarget->getTargetTriple().isOSMSVCRT() &&
2659 argsAreStructReturn(Ins) == StackStructReturn)
2660 FuncInfo->setBytesToPopOnReturn(4);
2664 // RegSaveFrameIndex is X86-64 only.
2665 FuncInfo->setRegSaveFrameIndex(0xAAAAAAA);
2666 if (CallConv == CallingConv::X86_FastCall ||
2667 CallConv == CallingConv::X86_ThisCall)
2668 // fastcc functions can't have varargs.
2669 FuncInfo->setVarArgsFrameIndex(0xAAAAAAA);
2672 FuncInfo->setArgumentStackSize(StackSize);
2678 X86TargetLowering::LowerMemOpCallTo(SDValue Chain,
2679 SDValue StackPtr, SDValue Arg,
2680 SDLoc dl, SelectionDAG &DAG,
2681 const CCValAssign &VA,
2682 ISD::ArgFlagsTy Flags) const {
2683 unsigned LocMemOffset = VA.getLocMemOffset();
2684 SDValue PtrOff = DAG.getIntPtrConstant(LocMemOffset);
2685 PtrOff = DAG.getNode(ISD::ADD, dl, getPointerTy(), StackPtr, PtrOff);
2686 if (Flags.isByVal())
2687 return CreateCopyOfByValArgument(Arg, PtrOff, Chain, Flags, DAG, dl);
2689 return DAG.getStore(Chain, dl, Arg, PtrOff,
2690 MachinePointerInfo::getStack(LocMemOffset),
2694 /// EmitTailCallLoadRetAddr - Emit a load of return address if tail call
2695 /// optimization is performed and it is required.
2697 X86TargetLowering::EmitTailCallLoadRetAddr(SelectionDAG &DAG,
2698 SDValue &OutRetAddr, SDValue Chain,
2699 bool IsTailCall, bool Is64Bit,
2700 int FPDiff, SDLoc dl) const {
2701 // Adjust the Return address stack slot.
2702 EVT VT = getPointerTy();
2703 OutRetAddr = getReturnAddressFrameIndex(DAG);
2705 // Load the "old" Return address.
2706 OutRetAddr = DAG.getLoad(VT, dl, Chain, OutRetAddr, MachinePointerInfo(),
2707 false, false, false, 0);
2708 return SDValue(OutRetAddr.getNode(), 1);
2711 /// EmitTailCallStoreRetAddr - Emit a store of the return address if tail call
2712 /// optimization is performed and it is required (FPDiff!=0).
2713 static SDValue EmitTailCallStoreRetAddr(SelectionDAG &DAG, MachineFunction &MF,
2714 SDValue Chain, SDValue RetAddrFrIdx,
2715 EVT PtrVT, unsigned SlotSize,
2716 int FPDiff, SDLoc dl) {
2717 // Store the return address to the appropriate stack slot.
2718 if (!FPDiff) return Chain;
2719 // Calculate the new stack slot for the return address.
2720 int NewReturnAddrFI =
2721 MF.getFrameInfo()->CreateFixedObject(SlotSize, (int64_t)FPDiff - SlotSize,
2723 SDValue NewRetAddrFrIdx = DAG.getFrameIndex(NewReturnAddrFI, PtrVT);
2724 Chain = DAG.getStore(Chain, dl, RetAddrFrIdx, NewRetAddrFrIdx,
2725 MachinePointerInfo::getFixedStack(NewReturnAddrFI),
2731 X86TargetLowering::LowerCall(TargetLowering::CallLoweringInfo &CLI,
2732 SmallVectorImpl<SDValue> &InVals) const {
2733 SelectionDAG &DAG = CLI.DAG;
2735 SmallVectorImpl<ISD::OutputArg> &Outs = CLI.Outs;
2736 SmallVectorImpl<SDValue> &OutVals = CLI.OutVals;
2737 SmallVectorImpl<ISD::InputArg> &Ins = CLI.Ins;
2738 SDValue Chain = CLI.Chain;
2739 SDValue Callee = CLI.Callee;
2740 CallingConv::ID CallConv = CLI.CallConv;
2741 bool &isTailCall = CLI.IsTailCall;
2742 bool isVarArg = CLI.IsVarArg;
2744 MachineFunction &MF = DAG.getMachineFunction();
2745 bool Is64Bit = Subtarget->is64Bit();
2746 bool IsWin64 = Subtarget->isCallingConvWin64(CallConv);
2747 StructReturnType SR = callIsStructReturn(Outs);
2748 bool IsSibcall = false;
2749 X86MachineFunctionInfo *X86Info = MF.getInfo<X86MachineFunctionInfo>();
2751 if (MF.getTarget().Options.DisableTailCalls)
2754 bool IsMustTail = CLI.CS && CLI.CS->isMustTailCall();
2756 // Force this to be a tail call. The verifier rules are enough to ensure
2757 // that we can lower this successfully without moving the return address
2760 } else if (isTailCall) {
2761 // Check if it's really possible to do a tail call.
2762 isTailCall = IsEligibleForTailCallOptimization(Callee, CallConv,
2763 isVarArg, SR != NotStructReturn,
2764 MF.getFunction()->hasStructRetAttr(), CLI.RetTy,
2765 Outs, OutVals, Ins, DAG);
2767 // Sibcalls are automatically detected tailcalls which do not require
2769 if (!MF.getTarget().Options.GuaranteedTailCallOpt && isTailCall)
2776 assert(!(isVarArg && IsTailCallConvention(CallConv)) &&
2777 "Var args not supported with calling convention fastcc, ghc or hipe");
2779 // Analyze operands of the call, assigning locations to each operand.
2780 SmallVector<CCValAssign, 16> ArgLocs;
2781 CCState CCInfo(CallConv, isVarArg, MF, ArgLocs, *DAG.getContext());
2783 // Allocate shadow area for Win64
2785 CCInfo.AllocateStack(32, 8);
2787 CCInfo.AnalyzeCallOperands(Outs, CC_X86);
2789 // Get a count of how many bytes are to be pushed on the stack.
2790 unsigned NumBytes = CCInfo.getNextStackOffset();
2792 // This is a sibcall. The memory operands are available in caller's
2793 // own caller's stack.
2795 else if (MF.getTarget().Options.GuaranteedTailCallOpt &&
2796 IsTailCallConvention(CallConv))
2797 NumBytes = GetAlignedArgumentStackSize(NumBytes, DAG);
2800 if (isTailCall && !IsSibcall && !IsMustTail) {
2801 // Lower arguments at fp - stackoffset + fpdiff.
2802 unsigned NumBytesCallerPushed = X86Info->getBytesToPopOnReturn();
2804 FPDiff = NumBytesCallerPushed - NumBytes;
2806 // Set the delta of movement of the returnaddr stackslot.
2807 // But only set if delta is greater than previous delta.
2808 if (FPDiff < X86Info->getTCReturnAddrDelta())
2809 X86Info->setTCReturnAddrDelta(FPDiff);
2812 unsigned NumBytesToPush = NumBytes;
2813 unsigned NumBytesToPop = NumBytes;
2815 // If we have an inalloca argument, all stack space has already been allocated
2816 // for us and be right at the top of the stack. We don't support multiple
2817 // arguments passed in memory when using inalloca.
2818 if (!Outs.empty() && Outs.back().Flags.isInAlloca()) {
2820 if (!ArgLocs.back().isMemLoc())
2821 report_fatal_error("cannot use inalloca attribute on a register "
2823 if (ArgLocs.back().getLocMemOffset() != 0)
2824 report_fatal_error("any parameter with the inalloca attribute must be "
2825 "the only memory argument");
2829 Chain = DAG.getCALLSEQ_START(
2830 Chain, DAG.getIntPtrConstant(NumBytesToPush, true), dl);
2832 SDValue RetAddrFrIdx;
2833 // Load return address for tail calls.
2834 if (isTailCall && FPDiff)
2835 Chain = EmitTailCallLoadRetAddr(DAG, RetAddrFrIdx, Chain, isTailCall,
2836 Is64Bit, FPDiff, dl);
2838 SmallVector<std::pair<unsigned, SDValue>, 8> RegsToPass;
2839 SmallVector<SDValue, 8> MemOpChains;
2842 // Walk the register/memloc assignments, inserting copies/loads. In the case
2843 // of tail call optimization arguments are handle later.
2844 const X86RegisterInfo *RegInfo = static_cast<const X86RegisterInfo *>(
2845 DAG.getSubtarget().getRegisterInfo());
2846 for (unsigned i = 0, e = ArgLocs.size(); i != e; ++i) {
2847 // Skip inalloca arguments, they have already been written.
2848 ISD::ArgFlagsTy Flags = Outs[i].Flags;
2849 if (Flags.isInAlloca())
2852 CCValAssign &VA = ArgLocs[i];
2853 EVT RegVT = VA.getLocVT();
2854 SDValue Arg = OutVals[i];
2855 bool isByVal = Flags.isByVal();
2857 // Promote the value if needed.
2858 switch (VA.getLocInfo()) {
2859 default: llvm_unreachable("Unknown loc info!");
2860 case CCValAssign::Full: break;
2861 case CCValAssign::SExt:
2862 Arg = DAG.getNode(ISD::SIGN_EXTEND, dl, RegVT, Arg);
2864 case CCValAssign::ZExt:
2865 Arg = DAG.getNode(ISD::ZERO_EXTEND, dl, RegVT, Arg);
2867 case CCValAssign::AExt:
2868 if (RegVT.is128BitVector()) {
2869 // Special case: passing MMX values in XMM registers.
2870 Arg = DAG.getNode(ISD::BITCAST, dl, MVT::i64, Arg);
2871 Arg = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, MVT::v2i64, Arg);
2872 Arg = getMOVL(DAG, dl, MVT::v2i64, DAG.getUNDEF(MVT::v2i64), Arg);
2874 Arg = DAG.getNode(ISD::ANY_EXTEND, dl, RegVT, Arg);
2876 case CCValAssign::BCvt:
2877 Arg = DAG.getNode(ISD::BITCAST, dl, RegVT, Arg);
2879 case CCValAssign::Indirect: {
2880 // Store the argument.
2881 SDValue SpillSlot = DAG.CreateStackTemporary(VA.getValVT());
2882 int FI = cast<FrameIndexSDNode>(SpillSlot)->getIndex();
2883 Chain = DAG.getStore(Chain, dl, Arg, SpillSlot,
2884 MachinePointerInfo::getFixedStack(FI),
2891 if (VA.isRegLoc()) {
2892 RegsToPass.push_back(std::make_pair(VA.getLocReg(), Arg));
2893 if (isVarArg && IsWin64) {
2894 // Win64 ABI requires argument XMM reg to be copied to the corresponding
2895 // shadow reg if callee is a varargs function.
2896 unsigned ShadowReg = 0;
2897 switch (VA.getLocReg()) {
2898 case X86::XMM0: ShadowReg = X86::RCX; break;
2899 case X86::XMM1: ShadowReg = X86::RDX; break;
2900 case X86::XMM2: ShadowReg = X86::R8; break;
2901 case X86::XMM3: ShadowReg = X86::R9; break;
2904 RegsToPass.push_back(std::make_pair(ShadowReg, Arg));
2906 } else if (!IsSibcall && (!isTailCall || isByVal)) {
2907 assert(VA.isMemLoc());
2908 if (!StackPtr.getNode())
2909 StackPtr = DAG.getCopyFromReg(Chain, dl, RegInfo->getStackRegister(),
2911 MemOpChains.push_back(LowerMemOpCallTo(Chain, StackPtr, Arg,
2912 dl, DAG, VA, Flags));
2916 if (!MemOpChains.empty())
2917 Chain = DAG.getNode(ISD::TokenFactor, dl, MVT::Other, MemOpChains);
2919 if (Subtarget->isPICStyleGOT()) {
2920 // ELF / PIC requires GOT in the EBX register before function calls via PLT
2923 RegsToPass.push_back(std::make_pair(unsigned(X86::EBX),
2924 DAG.getNode(X86ISD::GlobalBaseReg, SDLoc(), getPointerTy())));
2926 // If we are tail calling and generating PIC/GOT style code load the
2927 // address of the callee into ECX. The value in ecx is used as target of
2928 // the tail jump. This is done to circumvent the ebx/callee-saved problem
2929 // for tail calls on PIC/GOT architectures. Normally we would just put the
2930 // address of GOT into ebx and then call target@PLT. But for tail calls
2931 // ebx would be restored (since ebx is callee saved) before jumping to the
2934 // Note: The actual moving to ECX is done further down.
2935 GlobalAddressSDNode *G = dyn_cast<GlobalAddressSDNode>(Callee);
2936 if (G && !G->getGlobal()->hasHiddenVisibility() &&
2937 !G->getGlobal()->hasProtectedVisibility())
2938 Callee = LowerGlobalAddress(Callee, DAG);
2939 else if (isa<ExternalSymbolSDNode>(Callee))
2940 Callee = LowerExternalSymbol(Callee, DAG);
2944 if (Is64Bit && isVarArg && !IsWin64 && !IsMustTail) {
2945 // From AMD64 ABI document:
2946 // For calls that may call functions that use varargs or stdargs
2947 // (prototype-less calls or calls to functions containing ellipsis (...) in
2948 // the declaration) %al is used as hidden argument to specify the number
2949 // of SSE registers used. The contents of %al do not need to match exactly
2950 // the number of registers, but must be an ubound on the number of SSE
2951 // registers used and is in the range 0 - 8 inclusive.
2953 // Count the number of XMM registers allocated.
2954 static const MCPhysReg XMMArgRegs[] = {
2955 X86::XMM0, X86::XMM1, X86::XMM2, X86::XMM3,
2956 X86::XMM4, X86::XMM5, X86::XMM6, X86::XMM7
2958 unsigned NumXMMRegs = CCInfo.getFirstUnallocated(XMMArgRegs, 8);
2959 assert((Subtarget->hasSSE1() || !NumXMMRegs)
2960 && "SSE registers cannot be used when SSE is disabled");
2962 RegsToPass.push_back(std::make_pair(unsigned(X86::AL),
2963 DAG.getConstant(NumXMMRegs, MVT::i8)));
2966 if (Is64Bit && isVarArg && IsMustTail) {
2967 const auto &Forwards = X86Info->getForwardedMustTailRegParms();
2968 for (const auto &F : Forwards) {
2969 SDValue Val = DAG.getCopyFromReg(Chain, dl, F.VReg, F.VT);
2970 RegsToPass.push_back(std::make_pair(unsigned(F.PReg), Val));
2974 // For tail calls lower the arguments to the 'real' stack slots. Sibcalls
2975 // don't need this because the eligibility check rejects calls that require
2976 // shuffling arguments passed in memory.
2977 if (!IsSibcall && isTailCall) {
2978 // Force all the incoming stack arguments to be loaded from the stack
2979 // before any new outgoing arguments are stored to the stack, because the
2980 // outgoing stack slots may alias the incoming argument stack slots, and
2981 // the alias isn't otherwise explicit. This is slightly more conservative
2982 // than necessary, because it means that each store effectively depends
2983 // on every argument instead of just those arguments it would clobber.
2984 SDValue ArgChain = DAG.getStackArgumentTokenFactor(Chain);
2986 SmallVector<SDValue, 8> MemOpChains2;
2989 for (unsigned i = 0, e = ArgLocs.size(); i != e; ++i) {
2990 CCValAssign &VA = ArgLocs[i];
2993 assert(VA.isMemLoc());
2994 SDValue Arg = OutVals[i];
2995 ISD::ArgFlagsTy Flags = Outs[i].Flags;
2996 // Skip inalloca arguments. They don't require any work.
2997 if (Flags.isInAlloca())
2999 // Create frame index.
3000 int32_t Offset = VA.getLocMemOffset()+FPDiff;
3001 uint32_t OpSize = (VA.getLocVT().getSizeInBits()+7)/8;
3002 FI = MF.getFrameInfo()->CreateFixedObject(OpSize, Offset, true);
3003 FIN = DAG.getFrameIndex(FI, getPointerTy());
3005 if (Flags.isByVal()) {
3006 // Copy relative to framepointer.
3007 SDValue Source = DAG.getIntPtrConstant(VA.getLocMemOffset());
3008 if (!StackPtr.getNode())
3009 StackPtr = DAG.getCopyFromReg(Chain, dl,
3010 RegInfo->getStackRegister(),
3012 Source = DAG.getNode(ISD::ADD, dl, getPointerTy(), StackPtr, Source);
3014 MemOpChains2.push_back(CreateCopyOfByValArgument(Source, FIN,
3018 // Store relative to framepointer.
3019 MemOpChains2.push_back(
3020 DAG.getStore(ArgChain, dl, Arg, FIN,
3021 MachinePointerInfo::getFixedStack(FI),
3026 if (!MemOpChains2.empty())
3027 Chain = DAG.getNode(ISD::TokenFactor, dl, MVT::Other, MemOpChains2);
3029 // Store the return address to the appropriate stack slot.
3030 Chain = EmitTailCallStoreRetAddr(DAG, MF, Chain, RetAddrFrIdx,
3031 getPointerTy(), RegInfo->getSlotSize(),
3035 // Build a sequence of copy-to-reg nodes chained together with token chain
3036 // and flag operands which copy the outgoing args into registers.
3038 for (unsigned i = 0, e = RegsToPass.size(); i != e; ++i) {
3039 Chain = DAG.getCopyToReg(Chain, dl, RegsToPass[i].first,
3040 RegsToPass[i].second, InFlag);
3041 InFlag = Chain.getValue(1);
3044 if (DAG.getTarget().getCodeModel() == CodeModel::Large) {
3045 assert(Is64Bit && "Large code model is only legal in 64-bit mode.");
3046 // In the 64-bit large code model, we have to make all calls
3047 // through a register, since the call instruction's 32-bit
3048 // pc-relative offset may not be large enough to hold the whole
3050 } else if (GlobalAddressSDNode *G = dyn_cast<GlobalAddressSDNode>(Callee)) {
3051 // If the callee is a GlobalAddress node (quite common, every direct call
3052 // is) turn it into a TargetGlobalAddress node so that legalize doesn't hack
3055 // We should use extra load for direct calls to dllimported functions in
3057 const GlobalValue *GV = G->getGlobal();
3058 if (!GV->hasDLLImportStorageClass()) {
3059 unsigned char OpFlags = 0;
3060 bool ExtraLoad = false;
3061 unsigned WrapperKind = ISD::DELETED_NODE;
3063 // On ELF targets, in both X86-64 and X86-32 mode, direct calls to
3064 // external symbols most go through the PLT in PIC mode. If the symbol
3065 // has hidden or protected visibility, or if it is static or local, then
3066 // we don't need to use the PLT - we can directly call it.
3067 if (Subtarget->isTargetELF() &&
3068 DAG.getTarget().getRelocationModel() == Reloc::PIC_ &&
3069 GV->hasDefaultVisibility() && !GV->hasLocalLinkage()) {
3070 OpFlags = X86II::MO_PLT;
3071 } else if (Subtarget->isPICStyleStubAny() &&
3072 (GV->isDeclaration() || GV->isWeakForLinker()) &&
3073 (!Subtarget->getTargetTriple().isMacOSX() ||
3074 Subtarget->getTargetTriple().isMacOSXVersionLT(10, 5))) {
3075 // PC-relative references to external symbols should go through $stub,
3076 // unless we're building with the leopard linker or later, which
3077 // automatically synthesizes these stubs.
3078 OpFlags = X86II::MO_DARWIN_STUB;
3079 } else if (Subtarget->isPICStyleRIPRel() &&
3080 isa<Function>(GV) &&
3081 cast<Function>(GV)->getAttributes().
3082 hasAttribute(AttributeSet::FunctionIndex,
3083 Attribute::NonLazyBind)) {
3084 // If the function is marked as non-lazy, generate an indirect call
3085 // which loads from the GOT directly. This avoids runtime overhead
3086 // at the cost of eager binding (and one extra byte of encoding).
3087 OpFlags = X86II::MO_GOTPCREL;
3088 WrapperKind = X86ISD::WrapperRIP;
3092 Callee = DAG.getTargetGlobalAddress(GV, dl, getPointerTy(),
3093 G->getOffset(), OpFlags);
3095 // Add a wrapper if needed.
3096 if (WrapperKind != ISD::DELETED_NODE)
3097 Callee = DAG.getNode(X86ISD::WrapperRIP, dl, getPointerTy(), Callee);
3098 // Add extra indirection if needed.
3100 Callee = DAG.getLoad(getPointerTy(), dl, DAG.getEntryNode(), Callee,
3101 MachinePointerInfo::getGOT(),
3102 false, false, false, 0);
3104 } else if (ExternalSymbolSDNode *S = dyn_cast<ExternalSymbolSDNode>(Callee)) {
3105 unsigned char OpFlags = 0;
3107 // On ELF targets, in either X86-64 or X86-32 mode, direct calls to
3108 // external symbols should go through the PLT.
3109 if (Subtarget->isTargetELF() &&
3110 DAG.getTarget().getRelocationModel() == Reloc::PIC_) {
3111 OpFlags = X86II::MO_PLT;
3112 } else if (Subtarget->isPICStyleStubAny() &&
3113 (!Subtarget->getTargetTriple().isMacOSX() ||
3114 Subtarget->getTargetTriple().isMacOSXVersionLT(10, 5))) {
3115 // PC-relative references to external symbols should go through $stub,
3116 // unless we're building with the leopard linker or later, which
3117 // automatically synthesizes these stubs.
3118 OpFlags = X86II::MO_DARWIN_STUB;
3121 Callee = DAG.getTargetExternalSymbol(S->getSymbol(), getPointerTy(),
3123 } else if (Subtarget->isTarget64BitILP32() && Callee->getValueType(0) == MVT::i32) {
3124 // Zero-extend the 32-bit Callee address into a 64-bit according to x32 ABI
3125 Callee = DAG.getNode(ISD::ZERO_EXTEND, dl, MVT::i64, Callee);
3128 // Returns a chain & a flag for retval copy to use.
3129 SDVTList NodeTys = DAG.getVTList(MVT::Other, MVT::Glue);
3130 SmallVector<SDValue, 8> Ops;
3132 if (!IsSibcall && isTailCall) {
3133 Chain = DAG.getCALLSEQ_END(Chain,
3134 DAG.getIntPtrConstant(NumBytesToPop, true),
3135 DAG.getIntPtrConstant(0, true), InFlag, dl);
3136 InFlag = Chain.getValue(1);
3139 Ops.push_back(Chain);
3140 Ops.push_back(Callee);
3143 Ops.push_back(DAG.getConstant(FPDiff, MVT::i32));
3145 // Add argument registers to the end of the list so that they are known live
3147 for (unsigned i = 0, e = RegsToPass.size(); i != e; ++i)
3148 Ops.push_back(DAG.getRegister(RegsToPass[i].first,
3149 RegsToPass[i].second.getValueType()));
3151 // Add a register mask operand representing the call-preserved registers.
3152 const TargetRegisterInfo *TRI = DAG.getSubtarget().getRegisterInfo();
3153 const uint32_t *Mask = TRI->getCallPreservedMask(CallConv);
3154 assert(Mask && "Missing call preserved mask for calling convention");
3155 Ops.push_back(DAG.getRegisterMask(Mask));
3157 if (InFlag.getNode())
3158 Ops.push_back(InFlag);
3162 //// If this is the first return lowered for this function, add the regs
3163 //// to the liveout set for the function.
3164 // This isn't right, although it's probably harmless on x86; liveouts
3165 // should be computed from returns not tail calls. Consider a void
3166 // function making a tail call to a function returning int.
3167 return DAG.getNode(X86ISD::TC_RETURN, dl, NodeTys, Ops);
3170 Chain = DAG.getNode(X86ISD::CALL, dl, NodeTys, Ops);
3171 InFlag = Chain.getValue(1);
3173 // Create the CALLSEQ_END node.
3174 unsigned NumBytesForCalleeToPop;
3175 if (X86::isCalleePop(CallConv, Is64Bit, isVarArg,
3176 DAG.getTarget().Options.GuaranteedTailCallOpt))
3177 NumBytesForCalleeToPop = NumBytes; // Callee pops everything
3178 else if (!Is64Bit && !IsTailCallConvention(CallConv) &&
3179 !Subtarget->getTargetTriple().isOSMSVCRT() &&
3180 SR == StackStructReturn)
3181 // If this is a call to a struct-return function, the callee
3182 // pops the hidden struct pointer, so we have to push it back.
3183 // This is common for Darwin/X86, Linux & Mingw32 targets.
3184 // For MSVC Win32 targets, the caller pops the hidden struct pointer.
3185 NumBytesForCalleeToPop = 4;
3187 NumBytesForCalleeToPop = 0; // Callee pops nothing.
3189 // Returns a flag for retval copy to use.
3191 Chain = DAG.getCALLSEQ_END(Chain,
3192 DAG.getIntPtrConstant(NumBytesToPop, true),
3193 DAG.getIntPtrConstant(NumBytesForCalleeToPop,
3196 InFlag = Chain.getValue(1);
3199 // Handle result values, copying them out of physregs into vregs that we
3201 return LowerCallResult(Chain, InFlag, CallConv, isVarArg,
3202 Ins, dl, DAG, InVals);
3205 //===----------------------------------------------------------------------===//
3206 // Fast Calling Convention (tail call) implementation
3207 //===----------------------------------------------------------------------===//
3209 // Like std call, callee cleans arguments, convention except that ECX is
3210 // reserved for storing the tail called function address. Only 2 registers are
3211 // free for argument passing (inreg). Tail call optimization is performed
3213 // * tailcallopt is enabled
3214 // * caller/callee are fastcc
3215 // On X86_64 architecture with GOT-style position independent code only local
3216 // (within module) calls are supported at the moment.
3217 // To keep the stack aligned according to platform abi the function
3218 // GetAlignedArgumentStackSize ensures that argument delta is always multiples
3219 // of stack alignment. (Dynamic linkers need this - darwin's dyld for example)
3220 // If a tail called function callee has more arguments than the caller the
3221 // caller needs to make sure that there is room to move the RETADDR to. This is
3222 // achieved by reserving an area the size of the argument delta right after the
3223 // original RETADDR, but before the saved framepointer or the spilled registers
3224 // e.g. caller(arg1, arg2) calls callee(arg1, arg2,arg3,arg4)
3236 /// GetAlignedArgumentStackSize - Make the stack size align e.g 16n + 12 aligned
3237 /// for a 16 byte align requirement.
3239 X86TargetLowering::GetAlignedArgumentStackSize(unsigned StackSize,
3240 SelectionDAG& DAG) const {
3241 MachineFunction &MF = DAG.getMachineFunction();
3242 const TargetMachine &TM = MF.getTarget();
3243 const X86RegisterInfo *RegInfo = static_cast<const X86RegisterInfo *>(
3244 TM.getSubtargetImpl()->getRegisterInfo());
3245 const TargetFrameLowering &TFI = *TM.getSubtargetImpl()->getFrameLowering();
3246 unsigned StackAlignment = TFI.getStackAlignment();
3247 uint64_t AlignMask = StackAlignment - 1;
3248 int64_t Offset = StackSize;
3249 unsigned SlotSize = RegInfo->getSlotSize();
3250 if ( (Offset & AlignMask) <= (StackAlignment - SlotSize) ) {
3251 // Number smaller than 12 so just add the difference.
3252 Offset += ((StackAlignment - SlotSize) - (Offset & AlignMask));
3254 // Mask out lower bits, add stackalignment once plus the 12 bytes.
3255 Offset = ((~AlignMask) & Offset) + StackAlignment +
3256 (StackAlignment-SlotSize);
3261 /// MatchingStackOffset - Return true if the given stack call argument is
3262 /// already available in the same position (relatively) of the caller's
3263 /// incoming argument stack.
3265 bool MatchingStackOffset(SDValue Arg, unsigned Offset, ISD::ArgFlagsTy Flags,
3266 MachineFrameInfo *MFI, const MachineRegisterInfo *MRI,
3267 const X86InstrInfo *TII) {
3268 unsigned Bytes = Arg.getValueType().getSizeInBits() / 8;
3270 if (Arg.getOpcode() == ISD::CopyFromReg) {
3271 unsigned VR = cast<RegisterSDNode>(Arg.getOperand(1))->getReg();
3272 if (!TargetRegisterInfo::isVirtualRegister(VR))
3274 MachineInstr *Def = MRI->getVRegDef(VR);
3277 if (!Flags.isByVal()) {
3278 if (!TII->isLoadFromStackSlot(Def, FI))
3281 unsigned Opcode = Def->getOpcode();
3282 if ((Opcode == X86::LEA32r || Opcode == X86::LEA64r) &&
3283 Def->getOperand(1).isFI()) {
3284 FI = Def->getOperand(1).getIndex();
3285 Bytes = Flags.getByValSize();
3289 } else if (LoadSDNode *Ld = dyn_cast<LoadSDNode>(Arg)) {
3290 if (Flags.isByVal())
3291 // ByVal argument is passed in as a pointer but it's now being
3292 // dereferenced. e.g.
3293 // define @foo(%struct.X* %A) {
3294 // tail call @bar(%struct.X* byval %A)
3297 SDValue Ptr = Ld->getBasePtr();
3298 FrameIndexSDNode *FINode = dyn_cast<FrameIndexSDNode>(Ptr);
3301 FI = FINode->getIndex();
3302 } else if (Arg.getOpcode() == ISD::FrameIndex && Flags.isByVal()) {
3303 FrameIndexSDNode *FINode = cast<FrameIndexSDNode>(Arg);
3304 FI = FINode->getIndex();
3305 Bytes = Flags.getByValSize();
3309 assert(FI != INT_MAX);
3310 if (!MFI->isFixedObjectIndex(FI))
3312 return Offset == MFI->getObjectOffset(FI) && Bytes == MFI->getObjectSize(FI);
3315 /// IsEligibleForTailCallOptimization - Check whether the call is eligible
3316 /// for tail call optimization. Targets which want to do tail call
3317 /// optimization should implement this function.
3319 X86TargetLowering::IsEligibleForTailCallOptimization(SDValue Callee,
3320 CallingConv::ID CalleeCC,
3322 bool isCalleeStructRet,
3323 bool isCallerStructRet,
3325 const SmallVectorImpl<ISD::OutputArg> &Outs,
3326 const SmallVectorImpl<SDValue> &OutVals,
3327 const SmallVectorImpl<ISD::InputArg> &Ins,
3328 SelectionDAG &DAG) const {
3329 if (!IsTailCallConvention(CalleeCC) && !IsCCallConvention(CalleeCC))
3332 // If -tailcallopt is specified, make fastcc functions tail-callable.
3333 const MachineFunction &MF = DAG.getMachineFunction();
3334 const Function *CallerF = MF.getFunction();
3336 // If the function return type is x86_fp80 and the callee return type is not,
3337 // then the FP_EXTEND of the call result is not a nop. It's not safe to
3338 // perform a tailcall optimization here.
3339 if (CallerF->getReturnType()->isX86_FP80Ty() && !RetTy->isX86_FP80Ty())
3342 CallingConv::ID CallerCC = CallerF->getCallingConv();
3343 bool CCMatch = CallerCC == CalleeCC;
3344 bool IsCalleeWin64 = Subtarget->isCallingConvWin64(CalleeCC);
3345 bool IsCallerWin64 = Subtarget->isCallingConvWin64(CallerCC);
3347 if (DAG.getTarget().Options.GuaranteedTailCallOpt) {
3348 if (IsTailCallConvention(CalleeCC) && CCMatch)
3353 // Look for obvious safe cases to perform tail call optimization that do not
3354 // require ABI changes. This is what gcc calls sibcall.
3356 // Can't do sibcall if stack needs to be dynamically re-aligned. PEI needs to
3357 // emit a special epilogue.
3358 const X86RegisterInfo *RegInfo = static_cast<const X86RegisterInfo *>(
3359 DAG.getSubtarget().getRegisterInfo());
3360 if (RegInfo->needsStackRealignment(MF))
3363 // Also avoid sibcall optimization if either caller or callee uses struct
3364 // return semantics.
3365 if (isCalleeStructRet || isCallerStructRet)
3368 // An stdcall/thiscall caller is expected to clean up its arguments; the
3369 // callee isn't going to do that.
3370 // FIXME: this is more restrictive than needed. We could produce a tailcall
3371 // when the stack adjustment matches. For example, with a thiscall that takes
3372 // only one argument.
3373 if (!CCMatch && (CallerCC == CallingConv::X86_StdCall ||
3374 CallerCC == CallingConv::X86_ThisCall))
3377 // Do not sibcall optimize vararg calls unless all arguments are passed via
3379 if (isVarArg && !Outs.empty()) {
3381 // Optimizing for varargs on Win64 is unlikely to be safe without
3382 // additional testing.
3383 if (IsCalleeWin64 || IsCallerWin64)
3386 SmallVector<CCValAssign, 16> ArgLocs;
3387 CCState CCInfo(CalleeCC, isVarArg, DAG.getMachineFunction(), ArgLocs,
3390 CCInfo.AnalyzeCallOperands(Outs, CC_X86);
3391 for (unsigned i = 0, e = ArgLocs.size(); i != e; ++i)
3392 if (!ArgLocs[i].isRegLoc())
3396 // If the call result is in ST0 / ST1, it needs to be popped off the x87
3397 // stack. Therefore, if it's not used by the call it is not safe to optimize
3398 // this into a sibcall.
3399 bool Unused = false;
3400 for (unsigned i = 0, e = Ins.size(); i != e; ++i) {
3407 SmallVector<CCValAssign, 16> RVLocs;
3408 CCState CCInfo(CalleeCC, false, DAG.getMachineFunction(), RVLocs,
3410 CCInfo.AnalyzeCallResult(Ins, RetCC_X86);
3411 for (unsigned i = 0, e = RVLocs.size(); i != e; ++i) {
3412 CCValAssign &VA = RVLocs[i];
3413 if (VA.getLocReg() == X86::FP0 || VA.getLocReg() == X86::FP1)
3418 // If the calling conventions do not match, then we'd better make sure the
3419 // results are returned in the same way as what the caller expects.
3421 SmallVector<CCValAssign, 16> RVLocs1;
3422 CCState CCInfo1(CalleeCC, false, DAG.getMachineFunction(), RVLocs1,
3424 CCInfo1.AnalyzeCallResult(Ins, RetCC_X86);
3426 SmallVector<CCValAssign, 16> RVLocs2;
3427 CCState CCInfo2(CallerCC, false, DAG.getMachineFunction(), RVLocs2,
3429 CCInfo2.AnalyzeCallResult(Ins, RetCC_X86);
3431 if (RVLocs1.size() != RVLocs2.size())
3433 for (unsigned i = 0, e = RVLocs1.size(); i != e; ++i) {
3434 if (RVLocs1[i].isRegLoc() != RVLocs2[i].isRegLoc())
3436 if (RVLocs1[i].getLocInfo() != RVLocs2[i].getLocInfo())
3438 if (RVLocs1[i].isRegLoc()) {
3439 if (RVLocs1[i].getLocReg() != RVLocs2[i].getLocReg())
3442 if (RVLocs1[i].getLocMemOffset() != RVLocs2[i].getLocMemOffset())
3448 // If the callee takes no arguments then go on to check the results of the
3450 if (!Outs.empty()) {
3451 // Check if stack adjustment is needed. For now, do not do this if any
3452 // argument is passed on the stack.
3453 SmallVector<CCValAssign, 16> ArgLocs;
3454 CCState CCInfo(CalleeCC, isVarArg, DAG.getMachineFunction(), ArgLocs,
3457 // Allocate shadow area for Win64
3459 CCInfo.AllocateStack(32, 8);
3461 CCInfo.AnalyzeCallOperands(Outs, CC_X86);
3462 if (CCInfo.getNextStackOffset()) {
3463 MachineFunction &MF = DAG.getMachineFunction();
3464 if (MF.getInfo<X86MachineFunctionInfo>()->getBytesToPopOnReturn())
3467 // Check if the arguments are already laid out in the right way as
3468 // the caller's fixed stack objects.
3469 MachineFrameInfo *MFI = MF.getFrameInfo();
3470 const MachineRegisterInfo *MRI = &MF.getRegInfo();
3471 const X86InstrInfo *TII =
3472 static_cast<const X86InstrInfo *>(DAG.getSubtarget().getInstrInfo());
3473 for (unsigned i = 0, e = ArgLocs.size(); i != e; ++i) {
3474 CCValAssign &VA = ArgLocs[i];
3475 SDValue Arg = OutVals[i];
3476 ISD::ArgFlagsTy Flags = Outs[i].Flags;
3477 if (VA.getLocInfo() == CCValAssign::Indirect)
3479 if (!VA.isRegLoc()) {
3480 if (!MatchingStackOffset(Arg, VA.getLocMemOffset(), Flags,
3487 // If the tailcall address may be in a register, then make sure it's
3488 // possible to register allocate for it. In 32-bit, the call address can
3489 // only target EAX, EDX, or ECX since the tail call must be scheduled after
3490 // callee-saved registers are restored. These happen to be the same
3491 // registers used to pass 'inreg' arguments so watch out for those.
3492 if (!Subtarget->is64Bit() &&
3493 ((!isa<GlobalAddressSDNode>(Callee) &&
3494 !isa<ExternalSymbolSDNode>(Callee)) ||
3495 DAG.getTarget().getRelocationModel() == Reloc::PIC_)) {
3496 unsigned NumInRegs = 0;
3497 // In PIC we need an extra register to formulate the address computation
3499 unsigned MaxInRegs =
3500 (DAG.getTarget().getRelocationModel() == Reloc::PIC_) ? 2 : 3;
3502 for (unsigned i = 0, e = ArgLocs.size(); i != e; ++i) {
3503 CCValAssign &VA = ArgLocs[i];
3506 unsigned Reg = VA.getLocReg();
3509 case X86::EAX: case X86::EDX: case X86::ECX:
3510 if (++NumInRegs == MaxInRegs)
3522 X86TargetLowering::createFastISel(FunctionLoweringInfo &funcInfo,
3523 const TargetLibraryInfo *libInfo) const {
3524 return X86::createFastISel(funcInfo, libInfo);
3527 //===----------------------------------------------------------------------===//
3528 // Other Lowering Hooks
3529 //===----------------------------------------------------------------------===//
3531 static bool MayFoldLoad(SDValue Op) {
3532 return Op.hasOneUse() && ISD::isNormalLoad(Op.getNode());
3535 static bool MayFoldIntoStore(SDValue Op) {
3536 return Op.hasOneUse() && ISD::isNormalStore(*Op.getNode()->use_begin());
3539 static bool isTargetShuffle(unsigned Opcode) {
3541 default: return false;
3542 case X86ISD::PSHUFB:
3543 case X86ISD::PSHUFD:
3544 case X86ISD::PSHUFHW:
3545 case X86ISD::PSHUFLW:
3547 case X86ISD::PALIGNR:
3548 case X86ISD::MOVLHPS:
3549 case X86ISD::MOVLHPD:
3550 case X86ISD::MOVHLPS:
3551 case X86ISD::MOVLPS:
3552 case X86ISD::MOVLPD:
3553 case X86ISD::MOVSHDUP:
3554 case X86ISD::MOVSLDUP:
3555 case X86ISD::MOVDDUP:
3558 case X86ISD::UNPCKL:
3559 case X86ISD::UNPCKH:
3560 case X86ISD::VPERMILP:
3561 case X86ISD::VPERM2X128:
3562 case X86ISD::VPERMI:
3567 static SDValue getTargetShuffleNode(unsigned Opc, SDLoc dl, EVT VT,
3568 SDValue V1, SelectionDAG &DAG) {
3570 default: llvm_unreachable("Unknown x86 shuffle node");
3571 case X86ISD::MOVSHDUP:
3572 case X86ISD::MOVSLDUP:
3573 case X86ISD::MOVDDUP:
3574 return DAG.getNode(Opc, dl, VT, V1);
3578 static SDValue getTargetShuffleNode(unsigned Opc, SDLoc dl, EVT VT,
3579 SDValue V1, unsigned TargetMask,
3580 SelectionDAG &DAG) {
3582 default: llvm_unreachable("Unknown x86 shuffle node");
3583 case X86ISD::PSHUFD:
3584 case X86ISD::PSHUFHW:
3585 case X86ISD::PSHUFLW:
3586 case X86ISD::VPERMILP:
3587 case X86ISD::VPERMI:
3588 return DAG.getNode(Opc, dl, VT, V1, DAG.getConstant(TargetMask, MVT::i8));
3592 static SDValue getTargetShuffleNode(unsigned Opc, SDLoc dl, EVT VT,
3593 SDValue V1, SDValue V2, unsigned TargetMask,
3594 SelectionDAG &DAG) {
3596 default: llvm_unreachable("Unknown x86 shuffle node");
3597 case X86ISD::PALIGNR:
3598 case X86ISD::VALIGN:
3600 case X86ISD::VPERM2X128:
3601 return DAG.getNode(Opc, dl, VT, V1, V2,
3602 DAG.getConstant(TargetMask, MVT::i8));
3606 static SDValue getTargetShuffleNode(unsigned Opc, SDLoc dl, EVT VT,
3607 SDValue V1, SDValue V2, SelectionDAG &DAG) {
3609 default: llvm_unreachable("Unknown x86 shuffle node");
3610 case X86ISD::MOVLHPS:
3611 case X86ISD::MOVLHPD:
3612 case X86ISD::MOVHLPS:
3613 case X86ISD::MOVLPS:
3614 case X86ISD::MOVLPD:
3617 case X86ISD::UNPCKL:
3618 case X86ISD::UNPCKH:
3619 return DAG.getNode(Opc, dl, VT, V1, V2);
3623 SDValue X86TargetLowering::getReturnAddressFrameIndex(SelectionDAG &DAG) const {
3624 MachineFunction &MF = DAG.getMachineFunction();
3625 const X86RegisterInfo *RegInfo = static_cast<const X86RegisterInfo *>(
3626 DAG.getSubtarget().getRegisterInfo());
3627 X86MachineFunctionInfo *FuncInfo = MF.getInfo<X86MachineFunctionInfo>();
3628 int ReturnAddrIndex = FuncInfo->getRAIndex();
3630 if (ReturnAddrIndex == 0) {
3631 // Set up a frame object for the return address.
3632 unsigned SlotSize = RegInfo->getSlotSize();
3633 ReturnAddrIndex = MF.getFrameInfo()->CreateFixedObject(SlotSize,
3636 FuncInfo->setRAIndex(ReturnAddrIndex);
3639 return DAG.getFrameIndex(ReturnAddrIndex, getPointerTy());
3642 bool X86::isOffsetSuitableForCodeModel(int64_t Offset, CodeModel::Model M,
3643 bool hasSymbolicDisplacement) {
3644 // Offset should fit into 32 bit immediate field.
3645 if (!isInt<32>(Offset))
3648 // If we don't have a symbolic displacement - we don't have any extra
3650 if (!hasSymbolicDisplacement)
3653 // FIXME: Some tweaks might be needed for medium code model.
3654 if (M != CodeModel::Small && M != CodeModel::Kernel)
3657 // For small code model we assume that latest object is 16MB before end of 31
3658 // bits boundary. We may also accept pretty large negative constants knowing
3659 // that all objects are in the positive half of address space.
3660 if (M == CodeModel::Small && Offset < 16*1024*1024)
3663 // For kernel code model we know that all object resist in the negative half
3664 // of 32bits address space. We may not accept negative offsets, since they may
3665 // be just off and we may accept pretty large positive ones.
3666 if (M == CodeModel::Kernel && Offset > 0)
3672 /// isCalleePop - Determines whether the callee is required to pop its
3673 /// own arguments. Callee pop is necessary to support tail calls.
3674 bool X86::isCalleePop(CallingConv::ID CallingConv,
3675 bool is64Bit, bool IsVarArg, bool TailCallOpt) {
3676 switch (CallingConv) {
3679 case CallingConv::X86_StdCall:
3680 case CallingConv::X86_FastCall:
3681 case CallingConv::X86_ThisCall:
3683 case CallingConv::Fast:
3684 case CallingConv::GHC:
3685 case CallingConv::HiPE:
3692 /// \brief Return true if the condition is an unsigned comparison operation.
3693 static bool isX86CCUnsigned(unsigned X86CC) {
3695 default: llvm_unreachable("Invalid integer condition!");
3696 case X86::COND_E: return true;
3697 case X86::COND_G: return false;
3698 case X86::COND_GE: return false;
3699 case X86::COND_L: return false;
3700 case X86::COND_LE: return false;
3701 case X86::COND_NE: return true;
3702 case X86::COND_B: return true;
3703 case X86::COND_A: return true;
3704 case X86::COND_BE: return true;
3705 case X86::COND_AE: return true;
3707 llvm_unreachable("covered switch fell through?!");
3710 /// TranslateX86CC - do a one to one translation of a ISD::CondCode to the X86
3711 /// specific condition code, returning the condition code and the LHS/RHS of the
3712 /// comparison to make.
3713 static unsigned TranslateX86CC(ISD::CondCode SetCCOpcode, bool isFP,
3714 SDValue &LHS, SDValue &RHS, SelectionDAG &DAG) {
3716 if (ConstantSDNode *RHSC = dyn_cast<ConstantSDNode>(RHS)) {
3717 if (SetCCOpcode == ISD::SETGT && RHSC->isAllOnesValue()) {
3718 // X > -1 -> X == 0, jump !sign.
3719 RHS = DAG.getConstant(0, RHS.getValueType());
3720 return X86::COND_NS;
3722 if (SetCCOpcode == ISD::SETLT && RHSC->isNullValue()) {
3723 // X < 0 -> X == 0, jump on sign.
3726 if (SetCCOpcode == ISD::SETLT && RHSC->getZExtValue() == 1) {
3728 RHS = DAG.getConstant(0, RHS.getValueType());
3729 return X86::COND_LE;
3733 switch (SetCCOpcode) {
3734 default: llvm_unreachable("Invalid integer condition!");
3735 case ISD::SETEQ: return X86::COND_E;
3736 case ISD::SETGT: return X86::COND_G;
3737 case ISD::SETGE: return X86::COND_GE;
3738 case ISD::SETLT: return X86::COND_L;
3739 case ISD::SETLE: return X86::COND_LE;
3740 case ISD::SETNE: return X86::COND_NE;
3741 case ISD::SETULT: return X86::COND_B;
3742 case ISD::SETUGT: return X86::COND_A;
3743 case ISD::SETULE: return X86::COND_BE;
3744 case ISD::SETUGE: return X86::COND_AE;
3748 // First determine if it is required or is profitable to flip the operands.
3750 // If LHS is a foldable load, but RHS is not, flip the condition.
3751 if (ISD::isNON_EXTLoad(LHS.getNode()) &&
3752 !ISD::isNON_EXTLoad(RHS.getNode())) {
3753 SetCCOpcode = getSetCCSwappedOperands(SetCCOpcode);
3754 std::swap(LHS, RHS);
3757 switch (SetCCOpcode) {
3763 std::swap(LHS, RHS);
3767 // On a floating point condition, the flags are set as follows:
3769 // 0 | 0 | 0 | X > Y
3770 // 0 | 0 | 1 | X < Y
3771 // 1 | 0 | 0 | X == Y
3772 // 1 | 1 | 1 | unordered
3773 switch (SetCCOpcode) {
3774 default: llvm_unreachable("Condcode should be pre-legalized away");
3776 case ISD::SETEQ: return X86::COND_E;
3777 case ISD::SETOLT: // flipped
3779 case ISD::SETGT: return X86::COND_A;
3780 case ISD::SETOLE: // flipped
3782 case ISD::SETGE: return X86::COND_AE;
3783 case ISD::SETUGT: // flipped
3785 case ISD::SETLT: return X86::COND_B;
3786 case ISD::SETUGE: // flipped
3788 case ISD::SETLE: return X86::COND_BE;
3790 case ISD::SETNE: return X86::COND_NE;
3791 case ISD::SETUO: return X86::COND_P;
3792 case ISD::SETO: return X86::COND_NP;
3794 case ISD::SETUNE: return X86::COND_INVALID;
3798 /// hasFPCMov - is there a floating point cmov for the specific X86 condition
3799 /// code. Current x86 isa includes the following FP cmov instructions:
3800 /// fcmovb, fcomvbe, fcomve, fcmovu, fcmovae, fcmova, fcmovne, fcmovnu.
3801 static bool hasFPCMov(unsigned X86CC) {
3817 /// isFPImmLegal - Returns true if the target can instruction select the
3818 /// specified FP immediate natively. If false, the legalizer will
3819 /// materialize the FP immediate as a load from a constant pool.
3820 bool X86TargetLowering::isFPImmLegal(const APFloat &Imm, EVT VT) const {
3821 for (unsigned i = 0, e = LegalFPImmediates.size(); i != e; ++i) {
3822 if (Imm.bitwiseIsEqual(LegalFPImmediates[i]))
3828 /// \brief Returns true if it is beneficial to convert a load of a constant
3829 /// to just the constant itself.
3830 bool X86TargetLowering::shouldConvertConstantLoadToIntImm(const APInt &Imm,
3832 assert(Ty->isIntegerTy());
3834 unsigned BitSize = Ty->getPrimitiveSizeInBits();
3835 if (BitSize == 0 || BitSize > 64)
3840 /// isUndefOrInRange - Return true if Val is undef or if its value falls within
3841 /// the specified range (L, H].
3842 static bool isUndefOrInRange(int Val, int Low, int Hi) {
3843 return (Val < 0) || (Val >= Low && Val < Hi);
3846 /// isUndefOrEqual - Val is either less than zero (undef) or equal to the
3847 /// specified value.
3848 static bool isUndefOrEqual(int Val, int CmpVal) {
3849 return (Val < 0 || Val == CmpVal);
3852 /// isSequentialOrUndefInRange - Return true if every element in Mask, beginning
3853 /// from position Pos and ending in Pos+Size, falls within the specified
3854 /// sequential range (L, L+Pos]. or is undef.
3855 static bool isSequentialOrUndefInRange(ArrayRef<int> Mask,
3856 unsigned Pos, unsigned Size, int Low) {
3857 for (unsigned i = Pos, e = Pos+Size; i != e; ++i, ++Low)
3858 if (!isUndefOrEqual(Mask[i], Low))
3863 /// isPSHUFDMask - Return true if the node specifies a shuffle of elements that
3864 /// is suitable for input to PSHUFD or PSHUFW. That is, it doesn't reference
3865 /// the second operand.
3866 static bool isPSHUFDMask(ArrayRef<int> Mask, MVT VT) {
3867 if (VT == MVT::v4f32 || VT == MVT::v4i32 )
3868 return (Mask[0] < 4 && Mask[1] < 4 && Mask[2] < 4 && Mask[3] < 4);
3869 if (VT == MVT::v2f64 || VT == MVT::v2i64)
3870 return (Mask[0] < 2 && Mask[1] < 2);
3874 /// isPSHUFHWMask - Return true if the node specifies a shuffle of elements that
3875 /// is suitable for input to PSHUFHW.
3876 static bool isPSHUFHWMask(ArrayRef<int> Mask, MVT VT, bool HasInt256) {
3877 if (VT != MVT::v8i16 && (!HasInt256 || VT != MVT::v16i16))
3880 // Lower quadword copied in order or undef.
3881 if (!isSequentialOrUndefInRange(Mask, 0, 4, 0))
3884 // Upper quadword shuffled.
3885 for (unsigned i = 4; i != 8; ++i)
3886 if (!isUndefOrInRange(Mask[i], 4, 8))
3889 if (VT == MVT::v16i16) {
3890 // Lower quadword copied in order or undef.
3891 if (!isSequentialOrUndefInRange(Mask, 8, 4, 8))
3894 // Upper quadword shuffled.
3895 for (unsigned i = 12; i != 16; ++i)
3896 if (!isUndefOrInRange(Mask[i], 12, 16))
3903 /// isPSHUFLWMask - Return true if the node specifies a shuffle of elements that
3904 /// is suitable for input to PSHUFLW.
3905 static bool isPSHUFLWMask(ArrayRef<int> Mask, MVT VT, bool HasInt256) {
3906 if (VT != MVT::v8i16 && (!HasInt256 || VT != MVT::v16i16))
3909 // Upper quadword copied in order.
3910 if (!isSequentialOrUndefInRange(Mask, 4, 4, 4))
3913 // Lower quadword shuffled.
3914 for (unsigned i = 0; i != 4; ++i)
3915 if (!isUndefOrInRange(Mask[i], 0, 4))
3918 if (VT == MVT::v16i16) {
3919 // Upper quadword copied in order.
3920 if (!isSequentialOrUndefInRange(Mask, 12, 4, 12))
3923 // Lower quadword shuffled.
3924 for (unsigned i = 8; i != 12; ++i)
3925 if (!isUndefOrInRange(Mask[i], 8, 12))
3932 /// \brief Return true if the mask specifies a shuffle of elements that is
3933 /// suitable for input to intralane (palignr) or interlane (valign) vector
3935 static bool isAlignrMask(ArrayRef<int> Mask, MVT VT, bool InterLane) {
3936 unsigned NumElts = VT.getVectorNumElements();
3937 unsigned NumLanes = InterLane ? 1: VT.getSizeInBits()/128;
3938 unsigned NumLaneElts = NumElts/NumLanes;
3940 // Do not handle 64-bit element shuffles with palignr.
3941 if (NumLaneElts == 2)
3944 for (unsigned l = 0; l != NumElts; l+=NumLaneElts) {
3946 for (i = 0; i != NumLaneElts; ++i) {
3951 // Lane is all undef, go to next lane
3952 if (i == NumLaneElts)
3955 int Start = Mask[i+l];
3957 // Make sure its in this lane in one of the sources
3958 if (!isUndefOrInRange(Start, l, l+NumLaneElts) &&
3959 !isUndefOrInRange(Start, l+NumElts, l+NumElts+NumLaneElts))
3962 // If not lane 0, then we must match lane 0
3963 if (l != 0 && Mask[i] >= 0 && !isUndefOrEqual(Start, Mask[i]+l))
3966 // Correct second source to be contiguous with first source
3967 if (Start >= (int)NumElts)
3968 Start -= NumElts - NumLaneElts;
3970 // Make sure we're shifting in the right direction.
3971 if (Start <= (int)(i+l))
3976 // Check the rest of the elements to see if they are consecutive.
3977 for (++i; i != NumLaneElts; ++i) {
3978 int Idx = Mask[i+l];
3980 // Make sure its in this lane
3981 if (!isUndefOrInRange(Idx, l, l+NumLaneElts) &&
3982 !isUndefOrInRange(Idx, l+NumElts, l+NumElts+NumLaneElts))
3985 // If not lane 0, then we must match lane 0
3986 if (l != 0 && Mask[i] >= 0 && !isUndefOrEqual(Idx, Mask[i]+l))
3989 if (Idx >= (int)NumElts)
3990 Idx -= NumElts - NumLaneElts;
3992 if (!isUndefOrEqual(Idx, Start+i))
4001 /// \brief Return true if the node specifies a shuffle of elements that is
4002 /// suitable for input to PALIGNR.
4003 static bool isPALIGNRMask(ArrayRef<int> Mask, MVT VT,
4004 const X86Subtarget *Subtarget) {
4005 if ((VT.is128BitVector() && !Subtarget->hasSSSE3()) ||
4006 (VT.is256BitVector() && !Subtarget->hasInt256()) ||
4007 VT.is512BitVector())
4008 // FIXME: Add AVX512BW.
4011 return isAlignrMask(Mask, VT, false);
4014 /// \brief Return true if the node specifies a shuffle of elements that is
4015 /// suitable for input to VALIGN.
4016 static bool isVALIGNMask(ArrayRef<int> Mask, MVT VT,
4017 const X86Subtarget *Subtarget) {
4018 // FIXME: Add AVX512VL.
4019 if (!VT.is512BitVector() || !Subtarget->hasAVX512())
4021 return isAlignrMask(Mask, VT, true);
4024 /// CommuteVectorShuffleMask - Change values in a shuffle permute mask assuming
4025 /// the two vector operands have swapped position.
4026 static void CommuteVectorShuffleMask(SmallVectorImpl<int> &Mask,
4027 unsigned NumElems) {
4028 for (unsigned i = 0; i != NumElems; ++i) {
4032 else if (idx < (int)NumElems)
4033 Mask[i] = idx + NumElems;
4035 Mask[i] = idx - NumElems;
4039 /// isSHUFPMask - Return true if the specified VECTOR_SHUFFLE operand
4040 /// specifies a shuffle of elements that is suitable for input to 128/256-bit
4041 /// SHUFPS and SHUFPD. If Commuted is true, then it checks for sources to be
4042 /// reverse of what x86 shuffles want.
4043 static bool isSHUFPMask(ArrayRef<int> Mask, MVT VT, bool Commuted = false) {
4045 unsigned NumElems = VT.getVectorNumElements();
4046 unsigned NumLanes = VT.getSizeInBits()/128;
4047 unsigned NumLaneElems = NumElems/NumLanes;
4049 if (NumLaneElems != 2 && NumLaneElems != 4)
4052 unsigned EltSize = VT.getVectorElementType().getSizeInBits();
4053 bool symetricMaskRequired =
4054 (VT.getSizeInBits() >= 256) && (EltSize == 32);
4056 // VSHUFPSY divides the resulting vector into 4 chunks.
4057 // The sources are also splitted into 4 chunks, and each destination
4058 // chunk must come from a different source chunk.
4060 // SRC1 => X7 X6 X5 X4 X3 X2 X1 X0
4061 // SRC2 => Y7 Y6 Y5 Y4 Y3 Y2 Y1 Y9
4063 // DST => Y7..Y4, Y7..Y4, X7..X4, X7..X4,
4064 // Y3..Y0, Y3..Y0, X3..X0, X3..X0
4066 // VSHUFPDY divides the resulting vector into 4 chunks.
4067 // The sources are also splitted into 4 chunks, and each destination
4068 // chunk must come from a different source chunk.
4070 // SRC1 => X3 X2 X1 X0
4071 // SRC2 => Y3 Y2 Y1 Y0
4073 // DST => Y3..Y2, X3..X2, Y1..Y0, X1..X0
4075 SmallVector<int, 4> MaskVal(NumLaneElems, -1);
4076 unsigned HalfLaneElems = NumLaneElems/2;
4077 for (unsigned l = 0; l != NumElems; l += NumLaneElems) {
4078 for (unsigned i = 0; i != NumLaneElems; ++i) {
4079 int Idx = Mask[i+l];
4080 unsigned RngStart = l + ((Commuted == (i<HalfLaneElems)) ? NumElems : 0);
4081 if (!isUndefOrInRange(Idx, RngStart, RngStart+NumLaneElems))
4083 // For VSHUFPSY, the mask of the second half must be the same as the
4084 // first but with the appropriate offsets. This works in the same way as
4085 // VPERMILPS works with masks.
4086 if (!symetricMaskRequired || Idx < 0)
4088 if (MaskVal[i] < 0) {
4089 MaskVal[i] = Idx - l;
4092 if ((signed)(Idx - l) != MaskVal[i])
4100 /// isMOVHLPSMask - Return true if the specified VECTOR_SHUFFLE operand
4101 /// specifies a shuffle of elements that is suitable for input to MOVHLPS.
4102 static bool isMOVHLPSMask(ArrayRef<int> Mask, MVT VT) {
4103 if (!VT.is128BitVector())
4106 unsigned NumElems = VT.getVectorNumElements();
4111 // Expect bit0 == 6, bit1 == 7, bit2 == 2, bit3 == 3
4112 return isUndefOrEqual(Mask[0], 6) &&
4113 isUndefOrEqual(Mask[1], 7) &&
4114 isUndefOrEqual(Mask[2], 2) &&
4115 isUndefOrEqual(Mask[3], 3);
4118 /// isMOVHLPS_v_undef_Mask - Special case of isMOVHLPSMask for canonical form
4119 /// of vector_shuffle v, v, <2, 3, 2, 3>, i.e. vector_shuffle v, undef,
4121 static bool isMOVHLPS_v_undef_Mask(ArrayRef<int> Mask, MVT VT) {
4122 if (!VT.is128BitVector())
4125 unsigned NumElems = VT.getVectorNumElements();
4130 return isUndefOrEqual(Mask[0], 2) &&
4131 isUndefOrEqual(Mask[1], 3) &&
4132 isUndefOrEqual(Mask[2], 2) &&
4133 isUndefOrEqual(Mask[3], 3);
4136 /// isMOVLPMask - Return true if the specified VECTOR_SHUFFLE operand
4137 /// specifies a shuffle of elements that is suitable for input to MOVLP{S|D}.
4138 static bool isMOVLPMask(ArrayRef<int> Mask, MVT VT) {
4139 if (!VT.is128BitVector())
4142 unsigned NumElems = VT.getVectorNumElements();
4144 if (NumElems != 2 && NumElems != 4)
4147 for (unsigned i = 0, e = NumElems/2; i != e; ++i)
4148 if (!isUndefOrEqual(Mask[i], i + NumElems))
4151 for (unsigned i = NumElems/2, e = NumElems; i != e; ++i)
4152 if (!isUndefOrEqual(Mask[i], i))
4158 /// isMOVLHPSMask - Return true if the specified VECTOR_SHUFFLE operand
4159 /// specifies a shuffle of elements that is suitable for input to MOVLHPS.
4160 static bool isMOVLHPSMask(ArrayRef<int> Mask, MVT VT) {
4161 if (!VT.is128BitVector())
4164 unsigned NumElems = VT.getVectorNumElements();
4166 if (NumElems != 2 && NumElems != 4)
4169 for (unsigned i = 0, e = NumElems/2; i != e; ++i)
4170 if (!isUndefOrEqual(Mask[i], i))
4173 for (unsigned i = 0, e = NumElems/2; i != e; ++i)
4174 if (!isUndefOrEqual(Mask[i + e], i + NumElems))
4180 /// isINSERTPSMask - Return true if the specified VECTOR_SHUFFLE operand
4181 /// specifies a shuffle of elements that is suitable for input to INSERTPS.
4182 /// i. e: If all but one element come from the same vector.
4183 static bool isINSERTPSMask(ArrayRef<int> Mask, MVT VT) {
4184 // TODO: Deal with AVX's VINSERTPS
4185 if (!VT.is128BitVector() || (VT != MVT::v4f32 && VT != MVT::v4i32))
4188 unsigned CorrectPosV1 = 0;
4189 unsigned CorrectPosV2 = 0;
4190 for (int i = 0, e = (int)VT.getVectorNumElements(); i != e; ++i) {
4191 if (Mask[i] == -1) {
4199 else if (Mask[i] == i + 4)
4203 if (CorrectPosV1 == 3 || CorrectPosV2 == 3)
4204 // We have 3 elements (undefs count as elements from any vector) from one
4205 // vector, and one from another.
4212 // Some special combinations that can be optimized.
4215 SDValue Compact8x32ShuffleNode(ShuffleVectorSDNode *SVOp,
4216 SelectionDAG &DAG) {
4217 MVT VT = SVOp->getSimpleValueType(0);
4220 if (VT != MVT::v8i32 && VT != MVT::v8f32)
4223 ArrayRef<int> Mask = SVOp->getMask();
4225 // These are the special masks that may be optimized.
4226 static const int MaskToOptimizeEven[] = {0, 8, 2, 10, 4, 12, 6, 14};
4227 static const int MaskToOptimizeOdd[] = {1, 9, 3, 11, 5, 13, 7, 15};
4228 bool MatchEvenMask = true;
4229 bool MatchOddMask = true;
4230 for (int i=0; i<8; ++i) {
4231 if (!isUndefOrEqual(Mask[i], MaskToOptimizeEven[i]))
4232 MatchEvenMask = false;
4233 if (!isUndefOrEqual(Mask[i], MaskToOptimizeOdd[i]))
4234 MatchOddMask = false;
4237 if (!MatchEvenMask && !MatchOddMask)
4240 SDValue UndefNode = DAG.getNode(ISD::UNDEF, dl, VT);
4242 SDValue Op0 = SVOp->getOperand(0);
4243 SDValue Op1 = SVOp->getOperand(1);
4245 if (MatchEvenMask) {
4246 // Shift the second operand right to 32 bits.
4247 static const int ShiftRightMask[] = {-1, 0, -1, 2, -1, 4, -1, 6 };
4248 Op1 = DAG.getVectorShuffle(VT, dl, Op1, UndefNode, ShiftRightMask);
4250 // Shift the first operand left to 32 bits.
4251 static const int ShiftLeftMask[] = {1, -1, 3, -1, 5, -1, 7, -1 };
4252 Op0 = DAG.getVectorShuffle(VT, dl, Op0, UndefNode, ShiftLeftMask);
4254 static const int BlendMask[] = {0, 9, 2, 11, 4, 13, 6, 15};
4255 return DAG.getVectorShuffle(VT, dl, Op0, Op1, BlendMask);
4258 /// isUNPCKLMask - Return true if the specified VECTOR_SHUFFLE operand
4259 /// specifies a shuffle of elements that is suitable for input to UNPCKL.
4260 static bool isUNPCKLMask(ArrayRef<int> Mask, MVT VT,
4261 bool HasInt256, bool V2IsSplat = false) {
4263 assert(VT.getSizeInBits() >= 128 &&
4264 "Unsupported vector type for unpckl");
4266 unsigned NumElts = VT.getVectorNumElements();
4267 if (VT.is256BitVector() && NumElts != 4 && NumElts != 8 &&
4268 (!HasInt256 || (NumElts != 16 && NumElts != 32)))
4271 assert((!VT.is512BitVector() || VT.getScalarType().getSizeInBits() >= 32) &&
4272 "Unsupported vector type for unpckh");
4274 // AVX defines UNPCK* to operate independently on 128-bit lanes.
4275 unsigned NumLanes = VT.getSizeInBits()/128;
4276 unsigned NumLaneElts = NumElts/NumLanes;
4278 for (unsigned l = 0; l != NumElts; l += NumLaneElts) {
4279 for (unsigned i = 0, j = l; i != NumLaneElts; i += 2, ++j) {
4280 int BitI = Mask[l+i];
4281 int BitI1 = Mask[l+i+1];
4282 if (!isUndefOrEqual(BitI, j))
4285 if (!isUndefOrEqual(BitI1, NumElts))
4288 if (!isUndefOrEqual(BitI1, j + NumElts))
4297 /// isUNPCKHMask - Return true if the specified VECTOR_SHUFFLE operand
4298 /// specifies a shuffle of elements that is suitable for input to UNPCKH.
4299 static bool isUNPCKHMask(ArrayRef<int> Mask, MVT VT,
4300 bool HasInt256, bool V2IsSplat = false) {
4301 assert(VT.getSizeInBits() >= 128 &&
4302 "Unsupported vector type for unpckh");
4304 unsigned NumElts = VT.getVectorNumElements();
4305 if (VT.is256BitVector() && NumElts != 4 && NumElts != 8 &&
4306 (!HasInt256 || (NumElts != 16 && NumElts != 32)))
4309 assert((!VT.is512BitVector() || VT.getScalarType().getSizeInBits() >= 32) &&
4310 "Unsupported vector type for unpckh");
4312 // AVX defines UNPCK* to operate independently on 128-bit lanes.
4313 unsigned NumLanes = VT.getSizeInBits()/128;
4314 unsigned NumLaneElts = NumElts/NumLanes;
4316 for (unsigned l = 0; l != NumElts; l += NumLaneElts) {
4317 for (unsigned i = 0, j = l+NumLaneElts/2; i != NumLaneElts; i += 2, ++j) {
4318 int BitI = Mask[l+i];
4319 int BitI1 = Mask[l+i+1];
4320 if (!isUndefOrEqual(BitI, j))
4323 if (isUndefOrEqual(BitI1, NumElts))
4326 if (!isUndefOrEqual(BitI1, j+NumElts))
4334 /// isUNPCKL_v_undef_Mask - Special case of isUNPCKLMask for canonical form
4335 /// of vector_shuffle v, v, <0, 4, 1, 5>, i.e. vector_shuffle v, undef,
4337 static bool isUNPCKL_v_undef_Mask(ArrayRef<int> Mask, MVT VT, bool HasInt256) {
4338 unsigned NumElts = VT.getVectorNumElements();
4339 bool Is256BitVec = VT.is256BitVector();
4341 if (VT.is512BitVector())
4343 assert((VT.is128BitVector() || VT.is256BitVector()) &&
4344 "Unsupported vector type for unpckh");
4346 if (Is256BitVec && NumElts != 4 && NumElts != 8 &&
4347 (!HasInt256 || (NumElts != 16 && NumElts != 32)))
4350 // For 256-bit i64/f64, use MOVDDUPY instead, so reject the matching pattern
4351 // FIXME: Need a better way to get rid of this, there's no latency difference
4352 // between UNPCKLPD and MOVDDUP, the later should always be checked first and
4353 // the former later. We should also remove the "_undef" special mask.
4354 if (NumElts == 4 && Is256BitVec)
4357 // Handle 128 and 256-bit vector lengths. AVX defines UNPCK* to operate
4358 // independently on 128-bit lanes.
4359 unsigned NumLanes = VT.getSizeInBits()/128;
4360 unsigned NumLaneElts = NumElts/NumLanes;
4362 for (unsigned l = 0; l != NumElts; l += NumLaneElts) {
4363 for (unsigned i = 0, j = l; i != NumLaneElts; i += 2, ++j) {
4364 int BitI = Mask[l+i];
4365 int BitI1 = Mask[l+i+1];
4367 if (!isUndefOrEqual(BitI, j))
4369 if (!isUndefOrEqual(BitI1, j))
4377 /// isUNPCKH_v_undef_Mask - Special case of isUNPCKHMask for canonical form
4378 /// of vector_shuffle v, v, <2, 6, 3, 7>, i.e. vector_shuffle v, undef,
4380 static bool isUNPCKH_v_undef_Mask(ArrayRef<int> Mask, MVT VT, bool HasInt256) {
4381 unsigned NumElts = VT.getVectorNumElements();
4383 if (VT.is512BitVector())
4386 assert((VT.is128BitVector() || VT.is256BitVector()) &&
4387 "Unsupported vector type for unpckh");
4389 if (VT.is256BitVector() && NumElts != 4 && NumElts != 8 &&
4390 (!HasInt256 || (NumElts != 16 && NumElts != 32)))
4393 // Handle 128 and 256-bit vector lengths. AVX defines UNPCK* to operate
4394 // independently on 128-bit lanes.
4395 unsigned NumLanes = VT.getSizeInBits()/128;
4396 unsigned NumLaneElts = NumElts/NumLanes;
4398 for (unsigned l = 0; l != NumElts; l += NumLaneElts) {
4399 for (unsigned i = 0, j = l+NumLaneElts/2; i != NumLaneElts; i += 2, ++j) {
4400 int BitI = Mask[l+i];
4401 int BitI1 = Mask[l+i+1];
4402 if (!isUndefOrEqual(BitI, j))
4404 if (!isUndefOrEqual(BitI1, j))
4411 // Match for INSERTI64x4 INSERTF64x4 instructions (src0[0], src1[0]) or
4412 // (src1[0], src0[1]), manipulation with 256-bit sub-vectors
4413 static bool isINSERT64x4Mask(ArrayRef<int> Mask, MVT VT, unsigned int *Imm) {
4414 if (!VT.is512BitVector())
4417 unsigned NumElts = VT.getVectorNumElements();
4418 unsigned HalfSize = NumElts/2;
4419 if (isSequentialOrUndefInRange(Mask, 0, HalfSize, 0)) {
4420 if (isSequentialOrUndefInRange(Mask, HalfSize, HalfSize, NumElts)) {
4425 if (isSequentialOrUndefInRange(Mask, 0, HalfSize, NumElts)) {
4426 if (isSequentialOrUndefInRange(Mask, HalfSize, HalfSize, HalfSize)) {
4434 /// isMOVLMask - Return true if the specified VECTOR_SHUFFLE operand
4435 /// specifies a shuffle of elements that is suitable for input to MOVSS,
4436 /// MOVSD, and MOVD, i.e. setting the lowest element.
4437 static bool isMOVLMask(ArrayRef<int> Mask, EVT VT) {
4438 if (VT.getVectorElementType().getSizeInBits() < 32)
4440 if (!VT.is128BitVector())
4443 unsigned NumElts = VT.getVectorNumElements();
4445 if (!isUndefOrEqual(Mask[0], NumElts))
4448 for (unsigned i = 1; i != NumElts; ++i)
4449 if (!isUndefOrEqual(Mask[i], i))
4455 /// isVPERM2X128Mask - Match 256-bit shuffles where the elements are considered
4456 /// as permutations between 128-bit chunks or halves. As an example: this
4458 /// vector_shuffle <4, 5, 6, 7, 12, 13, 14, 15>
4459 /// The first half comes from the second half of V1 and the second half from the
4460 /// the second half of V2.
4461 static bool isVPERM2X128Mask(ArrayRef<int> Mask, MVT VT, bool HasFp256) {
4462 if (!HasFp256 || !VT.is256BitVector())
4465 // The shuffle result is divided into half A and half B. In total the two
4466 // sources have 4 halves, namely: C, D, E, F. The final values of A and
4467 // B must come from C, D, E or F.
4468 unsigned HalfSize = VT.getVectorNumElements()/2;
4469 bool MatchA = false, MatchB = false;
4471 // Check if A comes from one of C, D, E, F.
4472 for (unsigned Half = 0; Half != 4; ++Half) {
4473 if (isSequentialOrUndefInRange(Mask, 0, HalfSize, Half*HalfSize)) {
4479 // Check if B comes from one of C, D, E, F.
4480 for (unsigned Half = 0; Half != 4; ++Half) {
4481 if (isSequentialOrUndefInRange(Mask, HalfSize, HalfSize, Half*HalfSize)) {
4487 return MatchA && MatchB;
4490 /// getShuffleVPERM2X128Immediate - Return the appropriate immediate to shuffle
4491 /// the specified VECTOR_MASK mask with VPERM2F128/VPERM2I128 instructions.
4492 static unsigned getShuffleVPERM2X128Immediate(ShuffleVectorSDNode *SVOp) {
4493 MVT VT = SVOp->getSimpleValueType(0);
4495 unsigned HalfSize = VT.getVectorNumElements()/2;
4497 unsigned FstHalf = 0, SndHalf = 0;
4498 for (unsigned i = 0; i < HalfSize; ++i) {
4499 if (SVOp->getMaskElt(i) > 0) {
4500 FstHalf = SVOp->getMaskElt(i)/HalfSize;
4504 for (unsigned i = HalfSize; i < HalfSize*2; ++i) {
4505 if (SVOp->getMaskElt(i) > 0) {
4506 SndHalf = SVOp->getMaskElt(i)/HalfSize;
4511 return (FstHalf | (SndHalf << 4));
4514 // Symetric in-lane mask. Each lane has 4 elements (for imm8)
4515 static bool isPermImmMask(ArrayRef<int> Mask, MVT VT, unsigned& Imm8) {
4516 unsigned EltSize = VT.getVectorElementType().getSizeInBits();
4520 unsigned NumElts = VT.getVectorNumElements();
4522 if (VT.is128BitVector() || (VT.is256BitVector() && EltSize == 64)) {
4523 for (unsigned i = 0; i != NumElts; ++i) {
4526 Imm8 |= Mask[i] << (i*2);
4531 unsigned LaneSize = 4;
4532 SmallVector<int, 4> MaskVal(LaneSize, -1);
4534 for (unsigned l = 0; l != NumElts; l += LaneSize) {
4535 for (unsigned i = 0; i != LaneSize; ++i) {
4536 if (!isUndefOrInRange(Mask[i+l], l, l+LaneSize))
4540 if (MaskVal[i] < 0) {
4541 MaskVal[i] = Mask[i+l] - l;
4542 Imm8 |= MaskVal[i] << (i*2);
4545 if (Mask[i+l] != (signed)(MaskVal[i]+l))
4552 /// isVPERMILPMask - Return true if the specified VECTOR_SHUFFLE operand
4553 /// specifies a shuffle of elements that is suitable for input to VPERMILPD*.
4554 /// Note that VPERMIL mask matching is different depending whether theunderlying
4555 /// type is 32 or 64. In the VPERMILPS the high half of the mask should point
4556 /// to the same elements of the low, but to the higher half of the source.
4557 /// In VPERMILPD the two lanes could be shuffled independently of each other
4558 /// with the same restriction that lanes can't be crossed. Also handles PSHUFDY.
4559 static bool isVPERMILPMask(ArrayRef<int> Mask, MVT VT) {
4560 unsigned EltSize = VT.getVectorElementType().getSizeInBits();
4561 if (VT.getSizeInBits() < 256 || EltSize < 32)
4563 bool symetricMaskRequired = (EltSize == 32);
4564 unsigned NumElts = VT.getVectorNumElements();
4566 unsigned NumLanes = VT.getSizeInBits()/128;
4567 unsigned LaneSize = NumElts/NumLanes;
4568 // 2 or 4 elements in one lane
4570 SmallVector<int, 4> ExpectedMaskVal(LaneSize, -1);
4571 for (unsigned l = 0; l != NumElts; l += LaneSize) {
4572 for (unsigned i = 0; i != LaneSize; ++i) {
4573 if (!isUndefOrInRange(Mask[i+l], l, l+LaneSize))
4575 if (symetricMaskRequired) {
4576 if (ExpectedMaskVal[i] < 0 && Mask[i+l] >= 0) {
4577 ExpectedMaskVal[i] = Mask[i+l] - l;
4580 if (!isUndefOrEqual(Mask[i+l], ExpectedMaskVal[i]+l))
4588 /// isCommutedMOVLMask - Returns true if the shuffle mask is except the reverse
4589 /// of what x86 movss want. X86 movs requires the lowest element to be lowest
4590 /// element of vector 2 and the other elements to come from vector 1 in order.
4591 static bool isCommutedMOVLMask(ArrayRef<int> Mask, MVT VT,
4592 bool V2IsSplat = false, bool V2IsUndef = false) {
4593 if (!VT.is128BitVector())
4596 unsigned NumOps = VT.getVectorNumElements();
4597 if (NumOps != 2 && NumOps != 4 && NumOps != 8 && NumOps != 16)
4600 if (!isUndefOrEqual(Mask[0], 0))
4603 for (unsigned i = 1; i != NumOps; ++i)
4604 if (!(isUndefOrEqual(Mask[i], i+NumOps) ||
4605 (V2IsUndef && isUndefOrInRange(Mask[i], NumOps, NumOps*2)) ||
4606 (V2IsSplat && isUndefOrEqual(Mask[i], NumOps))))
4612 /// isMOVSHDUPMask - Return true if the specified VECTOR_SHUFFLE operand
4613 /// specifies a shuffle of elements that is suitable for input to MOVSHDUP.
4614 /// Masks to match: <1, 1, 3, 3> or <1, 1, 3, 3, 5, 5, 7, 7>
4615 static bool isMOVSHDUPMask(ArrayRef<int> Mask, MVT VT,
4616 const X86Subtarget *Subtarget) {
4617 if (!Subtarget->hasSSE3())
4620 unsigned NumElems = VT.getVectorNumElements();
4622 if ((VT.is128BitVector() && NumElems != 4) ||
4623 (VT.is256BitVector() && NumElems != 8) ||
4624 (VT.is512BitVector() && NumElems != 16))
4627 // "i+1" is the value the indexed mask element must have
4628 for (unsigned i = 0; i != NumElems; i += 2)
4629 if (!isUndefOrEqual(Mask[i], i+1) ||
4630 !isUndefOrEqual(Mask[i+1], i+1))
4636 /// isMOVSLDUPMask - Return true if the specified VECTOR_SHUFFLE operand
4637 /// specifies a shuffle of elements that is suitable for input to MOVSLDUP.
4638 /// Masks to match: <0, 0, 2, 2> or <0, 0, 2, 2, 4, 4, 6, 6>
4639 static bool isMOVSLDUPMask(ArrayRef<int> Mask, MVT VT,
4640 const X86Subtarget *Subtarget) {
4641 if (!Subtarget->hasSSE3())
4644 unsigned NumElems = VT.getVectorNumElements();
4646 if ((VT.is128BitVector() && NumElems != 4) ||
4647 (VT.is256BitVector() && NumElems != 8) ||
4648 (VT.is512BitVector() && NumElems != 16))
4651 // "i" is the value the indexed mask element must have
4652 for (unsigned i = 0; i != NumElems; i += 2)
4653 if (!isUndefOrEqual(Mask[i], i) ||
4654 !isUndefOrEqual(Mask[i+1], i))
4660 /// isMOVDDUPYMask - Return true if the specified VECTOR_SHUFFLE operand
4661 /// specifies a shuffle of elements that is suitable for input to 256-bit
4662 /// version of MOVDDUP.
4663 static bool isMOVDDUPYMask(ArrayRef<int> Mask, MVT VT, bool HasFp256) {
4664 if (!HasFp256 || !VT.is256BitVector())
4667 unsigned NumElts = VT.getVectorNumElements();
4671 for (unsigned i = 0; i != NumElts/2; ++i)
4672 if (!isUndefOrEqual(Mask[i], 0))
4674 for (unsigned i = NumElts/2; i != NumElts; ++i)
4675 if (!isUndefOrEqual(Mask[i], NumElts/2))
4680 /// isMOVDDUPMask - Return true if the specified VECTOR_SHUFFLE operand
4681 /// specifies a shuffle of elements that is suitable for input to 128-bit
4682 /// version of MOVDDUP.
4683 static bool isMOVDDUPMask(ArrayRef<int> Mask, MVT VT) {
4684 if (!VT.is128BitVector())
4687 unsigned e = VT.getVectorNumElements() / 2;
4688 for (unsigned i = 0; i != e; ++i)
4689 if (!isUndefOrEqual(Mask[i], i))
4691 for (unsigned i = 0; i != e; ++i)
4692 if (!isUndefOrEqual(Mask[e+i], i))
4697 /// isVEXTRACTIndex - Return true if the specified
4698 /// EXTRACT_SUBVECTOR operand specifies a vector extract that is
4699 /// suitable for instruction that extract 128 or 256 bit vectors
4700 static bool isVEXTRACTIndex(SDNode *N, unsigned vecWidth) {
4701 assert((vecWidth == 128 || vecWidth == 256) && "Unexpected vector width");
4702 if (!isa<ConstantSDNode>(N->getOperand(1).getNode()))
4705 // The index should be aligned on a vecWidth-bit boundary.
4707 cast<ConstantSDNode>(N->getOperand(1).getNode())->getZExtValue();
4709 MVT VT = N->getSimpleValueType(0);
4710 unsigned ElSize = VT.getVectorElementType().getSizeInBits();
4711 bool Result = (Index * ElSize) % vecWidth == 0;
4716 /// isVINSERTIndex - Return true if the specified INSERT_SUBVECTOR
4717 /// operand specifies a subvector insert that is suitable for input to
4718 /// insertion of 128 or 256-bit subvectors
4719 static bool isVINSERTIndex(SDNode *N, unsigned vecWidth) {
4720 assert((vecWidth == 128 || vecWidth == 256) && "Unexpected vector width");
4721 if (!isa<ConstantSDNode>(N->getOperand(2).getNode()))
4723 // The index should be aligned on a vecWidth-bit boundary.
4725 cast<ConstantSDNode>(N->getOperand(2).getNode())->getZExtValue();
4727 MVT VT = N->getSimpleValueType(0);
4728 unsigned ElSize = VT.getVectorElementType().getSizeInBits();
4729 bool Result = (Index * ElSize) % vecWidth == 0;
4734 bool X86::isVINSERT128Index(SDNode *N) {
4735 return isVINSERTIndex(N, 128);
4738 bool X86::isVINSERT256Index(SDNode *N) {
4739 return isVINSERTIndex(N, 256);
4742 bool X86::isVEXTRACT128Index(SDNode *N) {
4743 return isVEXTRACTIndex(N, 128);
4746 bool X86::isVEXTRACT256Index(SDNode *N) {
4747 return isVEXTRACTIndex(N, 256);
4750 /// getShuffleSHUFImmediate - Return the appropriate immediate to shuffle
4751 /// the specified VECTOR_SHUFFLE mask with PSHUF* and SHUFP* instructions.
4752 /// Handles 128-bit and 256-bit.
4753 static unsigned getShuffleSHUFImmediate(ShuffleVectorSDNode *N) {
4754 MVT VT = N->getSimpleValueType(0);
4756 assert((VT.getSizeInBits() >= 128) &&
4757 "Unsupported vector type for PSHUF/SHUFP");
4759 // Handle 128 and 256-bit vector lengths. AVX defines PSHUF/SHUFP to operate
4760 // independently on 128-bit lanes.
4761 unsigned NumElts = VT.getVectorNumElements();
4762 unsigned NumLanes = VT.getSizeInBits()/128;
4763 unsigned NumLaneElts = NumElts/NumLanes;
4765 assert((NumLaneElts == 2 || NumLaneElts == 4 || NumLaneElts == 8) &&
4766 "Only supports 2, 4 or 8 elements per lane");
4768 unsigned Shift = (NumLaneElts >= 4) ? 1 : 0;
4770 for (unsigned i = 0; i != NumElts; ++i) {
4771 int Elt = N->getMaskElt(i);
4772 if (Elt < 0) continue;
4773 Elt &= NumLaneElts - 1;
4774 unsigned ShAmt = (i << Shift) % 8;
4775 Mask |= Elt << ShAmt;
4781 /// getShufflePSHUFHWImmediate - Return the appropriate immediate to shuffle
4782 /// the specified VECTOR_SHUFFLE mask with the PSHUFHW instruction.
4783 static unsigned getShufflePSHUFHWImmediate(ShuffleVectorSDNode *N) {
4784 MVT VT = N->getSimpleValueType(0);
4786 assert((VT == MVT::v8i16 || VT == MVT::v16i16) &&
4787 "Unsupported vector type for PSHUFHW");
4789 unsigned NumElts = VT.getVectorNumElements();
4792 for (unsigned l = 0; l != NumElts; l += 8) {
4793 // 8 nodes per lane, but we only care about the last 4.
4794 for (unsigned i = 0; i < 4; ++i) {
4795 int Elt = N->getMaskElt(l+i+4);
4796 if (Elt < 0) continue;
4797 Elt &= 0x3; // only 2-bits.
4798 Mask |= Elt << (i * 2);
4805 /// getShufflePSHUFLWImmediate - Return the appropriate immediate to shuffle
4806 /// the specified VECTOR_SHUFFLE mask with the PSHUFLW instruction.
4807 static unsigned getShufflePSHUFLWImmediate(ShuffleVectorSDNode *N) {
4808 MVT VT = N->getSimpleValueType(0);
4810 assert((VT == MVT::v8i16 || VT == MVT::v16i16) &&
4811 "Unsupported vector type for PSHUFHW");
4813 unsigned NumElts = VT.getVectorNumElements();
4816 for (unsigned l = 0; l != NumElts; l += 8) {
4817 // 8 nodes per lane, but we only care about the first 4.
4818 for (unsigned i = 0; i < 4; ++i) {
4819 int Elt = N->getMaskElt(l+i);
4820 if (Elt < 0) continue;
4821 Elt &= 0x3; // only 2-bits
4822 Mask |= Elt << (i * 2);
4829 /// \brief Return the appropriate immediate to shuffle the specified
4830 /// VECTOR_SHUFFLE mask with the PALIGNR (if InterLane is false) or with
4831 /// VALIGN (if Interlane is true) instructions.
4832 static unsigned getShuffleAlignrImmediate(ShuffleVectorSDNode *SVOp,
4834 MVT VT = SVOp->getSimpleValueType(0);
4835 unsigned EltSize = InterLane ? 1 :
4836 VT.getVectorElementType().getSizeInBits() >> 3;
4838 unsigned NumElts = VT.getVectorNumElements();
4839 unsigned NumLanes = VT.is512BitVector() ? 1 : VT.getSizeInBits()/128;
4840 unsigned NumLaneElts = NumElts/NumLanes;
4844 for (i = 0; i != NumElts; ++i) {
4845 Val = SVOp->getMaskElt(i);
4849 if (Val >= (int)NumElts)
4850 Val -= NumElts - NumLaneElts;
4852 assert(Val - i > 0 && "PALIGNR imm should be positive");
4853 return (Val - i) * EltSize;
4856 /// \brief Return the appropriate immediate to shuffle the specified
4857 /// VECTOR_SHUFFLE mask with the PALIGNR instruction.
4858 static unsigned getShufflePALIGNRImmediate(ShuffleVectorSDNode *SVOp) {
4859 return getShuffleAlignrImmediate(SVOp, false);
4862 /// \brief Return the appropriate immediate to shuffle the specified
4863 /// VECTOR_SHUFFLE mask with the VALIGN instruction.
4864 static unsigned getShuffleVALIGNImmediate(ShuffleVectorSDNode *SVOp) {
4865 return getShuffleAlignrImmediate(SVOp, true);
4869 static unsigned getExtractVEXTRACTImmediate(SDNode *N, unsigned vecWidth) {
4870 assert((vecWidth == 128 || vecWidth == 256) && "Unsupported vector width");
4871 if (!isa<ConstantSDNode>(N->getOperand(1).getNode()))
4872 llvm_unreachable("Illegal extract subvector for VEXTRACT");
4875 cast<ConstantSDNode>(N->getOperand(1).getNode())->getZExtValue();
4877 MVT VecVT = N->getOperand(0).getSimpleValueType();
4878 MVT ElVT = VecVT.getVectorElementType();
4880 unsigned NumElemsPerChunk = vecWidth / ElVT.getSizeInBits();
4881 return Index / NumElemsPerChunk;
4884 static unsigned getInsertVINSERTImmediate(SDNode *N, unsigned vecWidth) {
4885 assert((vecWidth == 128 || vecWidth == 256) && "Unsupported vector width");
4886 if (!isa<ConstantSDNode>(N->getOperand(2).getNode()))
4887 llvm_unreachable("Illegal insert subvector for VINSERT");
4890 cast<ConstantSDNode>(N->getOperand(2).getNode())->getZExtValue();
4892 MVT VecVT = N->getSimpleValueType(0);
4893 MVT ElVT = VecVT.getVectorElementType();
4895 unsigned NumElemsPerChunk = vecWidth / ElVT.getSizeInBits();
4896 return Index / NumElemsPerChunk;
4899 /// getExtractVEXTRACT128Immediate - Return the appropriate immediate
4900 /// to extract the specified EXTRACT_SUBVECTOR index with VEXTRACTF128
4901 /// and VINSERTI128 instructions.
4902 unsigned X86::getExtractVEXTRACT128Immediate(SDNode *N) {
4903 return getExtractVEXTRACTImmediate(N, 128);
4906 /// getExtractVEXTRACT256Immediate - Return the appropriate immediate
4907 /// to extract the specified EXTRACT_SUBVECTOR index with VEXTRACTF64x4
4908 /// and VINSERTI64x4 instructions.
4909 unsigned X86::getExtractVEXTRACT256Immediate(SDNode *N) {
4910 return getExtractVEXTRACTImmediate(N, 256);
4913 /// getInsertVINSERT128Immediate - Return the appropriate immediate
4914 /// to insert at the specified INSERT_SUBVECTOR index with VINSERTF128
4915 /// and VINSERTI128 instructions.
4916 unsigned X86::getInsertVINSERT128Immediate(SDNode *N) {
4917 return getInsertVINSERTImmediate(N, 128);
4920 /// getInsertVINSERT256Immediate - Return the appropriate immediate
4921 /// to insert at the specified INSERT_SUBVECTOR index with VINSERTF46x4
4922 /// and VINSERTI64x4 instructions.
4923 unsigned X86::getInsertVINSERT256Immediate(SDNode *N) {
4924 return getInsertVINSERTImmediate(N, 256);
4927 /// isZero - Returns true if Elt is a constant integer zero
4928 static bool isZero(SDValue V) {
4929 ConstantSDNode *C = dyn_cast<ConstantSDNode>(V);
4930 return C && C->isNullValue();
4933 /// isZeroNode - Returns true if Elt is a constant zero or a floating point
4935 bool X86::isZeroNode(SDValue Elt) {
4938 if (ConstantFPSDNode *CFP = dyn_cast<ConstantFPSDNode>(Elt))
4939 return CFP->getValueAPF().isPosZero();
4943 /// ShouldXformToMOVHLPS - Return true if the node should be transformed to
4944 /// match movhlps. The lower half elements should come from upper half of
4945 /// V1 (and in order), and the upper half elements should come from the upper
4946 /// half of V2 (and in order).
4947 static bool ShouldXformToMOVHLPS(ArrayRef<int> Mask, MVT VT) {
4948 if (!VT.is128BitVector())
4950 if (VT.getVectorNumElements() != 4)
4952 for (unsigned i = 0, e = 2; i != e; ++i)
4953 if (!isUndefOrEqual(Mask[i], i+2))
4955 for (unsigned i = 2; i != 4; ++i)
4956 if (!isUndefOrEqual(Mask[i], i+4))
4961 /// isScalarLoadToVector - Returns true if the node is a scalar load that
4962 /// is promoted to a vector. It also returns the LoadSDNode by reference if
4964 static bool isScalarLoadToVector(SDNode *N, LoadSDNode **LD = nullptr) {
4965 if (N->getOpcode() != ISD::SCALAR_TO_VECTOR)
4967 N = N->getOperand(0).getNode();
4968 if (!ISD::isNON_EXTLoad(N))
4971 *LD = cast<LoadSDNode>(N);
4975 // Test whether the given value is a vector value which will be legalized
4977 static bool WillBeConstantPoolLoad(SDNode *N) {
4978 if (N->getOpcode() != ISD::BUILD_VECTOR)
4981 // Check for any non-constant elements.
4982 for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i)
4983 switch (N->getOperand(i).getNode()->getOpcode()) {
4985 case ISD::ConstantFP:
4992 // Vectors of all-zeros and all-ones are materialized with special
4993 // instructions rather than being loaded.
4994 return !ISD::isBuildVectorAllZeros(N) &&
4995 !ISD::isBuildVectorAllOnes(N);
4998 /// ShouldXformToMOVLP{S|D} - Return true if the node should be transformed to
4999 /// match movlp{s|d}. The lower half elements should come from lower half of
5000 /// V1 (and in order), and the upper half elements should come from the upper
5001 /// half of V2 (and in order). And since V1 will become the source of the
5002 /// MOVLP, it must be either a vector load or a scalar load to vector.
5003 static bool ShouldXformToMOVLP(SDNode *V1, SDNode *V2,
5004 ArrayRef<int> Mask, MVT VT) {
5005 if (!VT.is128BitVector())
5008 if (!ISD::isNON_EXTLoad(V1) && !isScalarLoadToVector(V1))
5010 // Is V2 is a vector load, don't do this transformation. We will try to use
5011 // load folding shufps op.
5012 if (ISD::isNON_EXTLoad(V2) || WillBeConstantPoolLoad(V2))
5015 unsigned NumElems = VT.getVectorNumElements();
5017 if (NumElems != 2 && NumElems != 4)
5019 for (unsigned i = 0, e = NumElems/2; i != e; ++i)
5020 if (!isUndefOrEqual(Mask[i], i))
5022 for (unsigned i = NumElems/2, e = NumElems; i != e; ++i)
5023 if (!isUndefOrEqual(Mask[i], i+NumElems))
5028 /// isZeroShuffle - Returns true if N is a VECTOR_SHUFFLE that can be resolved
5029 /// to an zero vector.
5030 /// FIXME: move to dag combiner / method on ShuffleVectorSDNode
5031 static bool isZeroShuffle(ShuffleVectorSDNode *N) {
5032 SDValue V1 = N->getOperand(0);
5033 SDValue V2 = N->getOperand(1);
5034 unsigned NumElems = N->getValueType(0).getVectorNumElements();
5035 for (unsigned i = 0; i != NumElems; ++i) {
5036 int Idx = N->getMaskElt(i);
5037 if (Idx >= (int)NumElems) {
5038 unsigned Opc = V2.getOpcode();
5039 if (Opc == ISD::UNDEF || ISD::isBuildVectorAllZeros(V2.getNode()))
5041 if (Opc != ISD::BUILD_VECTOR ||
5042 !X86::isZeroNode(V2.getOperand(Idx-NumElems)))
5044 } else if (Idx >= 0) {
5045 unsigned Opc = V1.getOpcode();
5046 if (Opc == ISD::UNDEF || ISD::isBuildVectorAllZeros(V1.getNode()))
5048 if (Opc != ISD::BUILD_VECTOR ||
5049 !X86::isZeroNode(V1.getOperand(Idx)))
5056 /// getZeroVector - Returns a vector of specified type with all zero elements.
5058 static SDValue getZeroVector(EVT VT, const X86Subtarget *Subtarget,
5059 SelectionDAG &DAG, SDLoc dl) {
5060 assert(VT.isVector() && "Expected a vector type");
5062 // Always build SSE zero vectors as <4 x i32> bitcasted
5063 // to their dest type. This ensures they get CSE'd.
5065 if (VT.is128BitVector()) { // SSE
5066 if (Subtarget->hasSSE2()) { // SSE2
5067 SDValue Cst = DAG.getTargetConstant(0, MVT::i32);
5068 Vec = DAG.getNode(ISD::BUILD_VECTOR, dl, MVT::v4i32, Cst, Cst, Cst, Cst);
5070 SDValue Cst = DAG.getTargetConstantFP(+0.0, MVT::f32);
5071 Vec = DAG.getNode(ISD::BUILD_VECTOR, dl, MVT::v4f32, Cst, Cst, Cst, Cst);
5073 } else if (VT.is256BitVector()) { // AVX
5074 if (Subtarget->hasInt256()) { // AVX2
5075 SDValue Cst = DAG.getTargetConstant(0, MVT::i32);
5076 SDValue Ops[] = { Cst, Cst, Cst, Cst, Cst, Cst, Cst, Cst };
5077 Vec = DAG.getNode(ISD::BUILD_VECTOR, dl, MVT::v8i32, Ops);
5079 // 256-bit logic and arithmetic instructions in AVX are all
5080 // floating-point, no support for integer ops. Emit fp zeroed vectors.
5081 SDValue Cst = DAG.getTargetConstantFP(+0.0, MVT::f32);
5082 SDValue Ops[] = { Cst, Cst, Cst, Cst, Cst, Cst, Cst, Cst };
5083 Vec = DAG.getNode(ISD::BUILD_VECTOR, dl, MVT::v8f32, Ops);
5085 } else if (VT.is512BitVector()) { // AVX-512
5086 SDValue Cst = DAG.getTargetConstant(0, MVT::i32);
5087 SDValue Ops[] = { Cst, Cst, Cst, Cst, Cst, Cst, Cst, Cst,
5088 Cst, Cst, Cst, Cst, Cst, Cst, Cst, Cst };
5089 Vec = DAG.getNode(ISD::BUILD_VECTOR, dl, MVT::v16i32, Ops);
5090 } else if (VT.getScalarType() == MVT::i1) {
5091 assert(VT.getVectorNumElements() <= 16 && "Unexpected vector type");
5092 SDValue Cst = DAG.getTargetConstant(0, MVT::i1);
5093 SmallVector<SDValue, 16> Ops(VT.getVectorNumElements(), Cst);
5094 return DAG.getNode(ISD::BUILD_VECTOR, dl, VT, Ops);
5096 llvm_unreachable("Unexpected vector type");
5098 return DAG.getNode(ISD::BITCAST, dl, VT, Vec);
5101 /// getOnesVector - Returns a vector of specified type with all bits set.
5102 /// Always build ones vectors as <4 x i32> or <8 x i32>. For 256-bit types with
5103 /// no AVX2 supprt, use two <4 x i32> inserted in a <8 x i32> appropriately.
5104 /// Then bitcast to their original type, ensuring they get CSE'd.
5105 static SDValue getOnesVector(MVT VT, bool HasInt256, SelectionDAG &DAG,
5107 assert(VT.isVector() && "Expected a vector type");
5109 SDValue Cst = DAG.getTargetConstant(~0U, MVT::i32);
5111 if (VT.is256BitVector()) {
5112 if (HasInt256) { // AVX2
5113 SDValue Ops[] = { Cst, Cst, Cst, Cst, Cst, Cst, Cst, Cst };
5114 Vec = DAG.getNode(ISD::BUILD_VECTOR, dl, MVT::v8i32, Ops);
5116 Vec = DAG.getNode(ISD::BUILD_VECTOR, dl, MVT::v4i32, Cst, Cst, Cst, Cst);
5117 Vec = Concat128BitVectors(Vec, Vec, MVT::v8i32, 8, DAG, dl);
5119 } else if (VT.is128BitVector()) {
5120 Vec = DAG.getNode(ISD::BUILD_VECTOR, dl, MVT::v4i32, Cst, Cst, Cst, Cst);
5122 llvm_unreachable("Unexpected vector type");
5124 return DAG.getNode(ISD::BITCAST, dl, VT, Vec);
5127 /// NormalizeMask - V2 is a splat, modify the mask (if needed) so all elements
5128 /// that point to V2 points to its first element.
5129 static void NormalizeMask(SmallVectorImpl<int> &Mask, unsigned NumElems) {
5130 for (unsigned i = 0; i != NumElems; ++i) {
5131 if (Mask[i] > (int)NumElems) {
5137 /// getMOVLMask - Returns a vector_shuffle mask for an movs{s|d}, movd
5138 /// operation of specified width.
5139 static SDValue getMOVL(SelectionDAG &DAG, SDLoc dl, EVT VT, SDValue V1,
5141 unsigned NumElems = VT.getVectorNumElements();
5142 SmallVector<int, 8> Mask;
5143 Mask.push_back(NumElems);
5144 for (unsigned i = 1; i != NumElems; ++i)
5146 return DAG.getVectorShuffle(VT, dl, V1, V2, &Mask[0]);
5149 /// getUnpackl - Returns a vector_shuffle node for an unpackl operation.
5150 static SDValue getUnpackl(SelectionDAG &DAG, SDLoc dl, MVT VT, SDValue V1,
5152 unsigned NumElems = VT.getVectorNumElements();
5153 SmallVector<int, 8> Mask;
5154 for (unsigned i = 0, e = NumElems/2; i != e; ++i) {
5156 Mask.push_back(i + NumElems);
5158 return DAG.getVectorShuffle(VT, dl, V1, V2, &Mask[0]);
5161 /// getUnpackh - Returns a vector_shuffle node for an unpackh operation.
5162 static SDValue getUnpackh(SelectionDAG &DAG, SDLoc dl, MVT VT, SDValue V1,
5164 unsigned NumElems = VT.getVectorNumElements();
5165 SmallVector<int, 8> Mask;
5166 for (unsigned i = 0, Half = NumElems/2; i != Half; ++i) {
5167 Mask.push_back(i + Half);
5168 Mask.push_back(i + NumElems + Half);
5170 return DAG.getVectorShuffle(VT, dl, V1, V2, &Mask[0]);
5173 // PromoteSplati8i16 - All i16 and i8 vector types can't be used directly by
5174 // a generic shuffle instruction because the target has no such instructions.
5175 // Generate shuffles which repeat i16 and i8 several times until they can be
5176 // represented by v4f32 and then be manipulated by target suported shuffles.
5177 static SDValue PromoteSplati8i16(SDValue V, SelectionDAG &DAG, int &EltNo) {
5178 MVT VT = V.getSimpleValueType();
5179 int NumElems = VT.getVectorNumElements();
5182 while (NumElems > 4) {
5183 if (EltNo < NumElems/2) {
5184 V = getUnpackl(DAG, dl, VT, V, V);
5186 V = getUnpackh(DAG, dl, VT, V, V);
5187 EltNo -= NumElems/2;
5194 /// getLegalSplat - Generate a legal splat with supported x86 shuffles
5195 static SDValue getLegalSplat(SelectionDAG &DAG, SDValue V, int EltNo) {
5196 MVT VT = V.getSimpleValueType();
5199 if (VT.is128BitVector()) {
5200 V = DAG.getNode(ISD::BITCAST, dl, MVT::v4f32, V);
5201 int SplatMask[4] = { EltNo, EltNo, EltNo, EltNo };
5202 V = DAG.getVectorShuffle(MVT::v4f32, dl, V, DAG.getUNDEF(MVT::v4f32),
5204 } else if (VT.is256BitVector()) {
5205 // To use VPERMILPS to splat scalars, the second half of indicies must
5206 // refer to the higher part, which is a duplication of the lower one,
5207 // because VPERMILPS can only handle in-lane permutations.
5208 int SplatMask[8] = { EltNo, EltNo, EltNo, EltNo,
5209 EltNo+4, EltNo+4, EltNo+4, EltNo+4 };
5211 V = DAG.getNode(ISD::BITCAST, dl, MVT::v8f32, V);
5212 V = DAG.getVectorShuffle(MVT::v8f32, dl, V, DAG.getUNDEF(MVT::v8f32),
5215 llvm_unreachable("Vector size not supported");
5217 return DAG.getNode(ISD::BITCAST, dl, VT, V);
5220 /// PromoteSplat - Splat is promoted to target supported vector shuffles.
5221 static SDValue PromoteSplat(ShuffleVectorSDNode *SV, SelectionDAG &DAG) {
5222 MVT SrcVT = SV->getSimpleValueType(0);
5223 SDValue V1 = SV->getOperand(0);
5226 int EltNo = SV->getSplatIndex();
5227 int NumElems = SrcVT.getVectorNumElements();
5228 bool Is256BitVec = SrcVT.is256BitVector();
5230 assert(((SrcVT.is128BitVector() && NumElems > 4) || Is256BitVec) &&
5231 "Unknown how to promote splat for type");
5233 // Extract the 128-bit part containing the splat element and update
5234 // the splat element index when it refers to the higher register.
5236 V1 = Extract128BitVector(V1, EltNo, DAG, dl);
5237 if (EltNo >= NumElems/2)
5238 EltNo -= NumElems/2;
5241 // All i16 and i8 vector types can't be used directly by a generic shuffle
5242 // instruction because the target has no such instruction. Generate shuffles
5243 // which repeat i16 and i8 several times until they fit in i32, and then can
5244 // be manipulated by target suported shuffles.
5245 MVT EltVT = SrcVT.getVectorElementType();
5246 if (EltVT == MVT::i8 || EltVT == MVT::i16)
5247 V1 = PromoteSplati8i16(V1, DAG, EltNo);
5249 // Recreate the 256-bit vector and place the same 128-bit vector
5250 // into the low and high part. This is necessary because we want
5251 // to use VPERM* to shuffle the vectors
5253 V1 = DAG.getNode(ISD::CONCAT_VECTORS, dl, SrcVT, V1, V1);
5256 return getLegalSplat(DAG, V1, EltNo);
5259 /// getShuffleVectorZeroOrUndef - Return a vector_shuffle of the specified
5260 /// vector of zero or undef vector. This produces a shuffle where the low
5261 /// element of V2 is swizzled into the zero/undef vector, landing at element
5262 /// Idx. This produces a shuffle mask like 4,1,2,3 (idx=0) or 0,1,2,4 (idx=3).
5263 static SDValue getShuffleVectorZeroOrUndef(SDValue V2, unsigned Idx,
5265 const X86Subtarget *Subtarget,
5266 SelectionDAG &DAG) {
5267 MVT VT = V2.getSimpleValueType();
5269 ? getZeroVector(VT, Subtarget, DAG, SDLoc(V2)) : DAG.getUNDEF(VT);
5270 unsigned NumElems = VT.getVectorNumElements();
5271 SmallVector<int, 16> MaskVec;
5272 for (unsigned i = 0; i != NumElems; ++i)
5273 // If this is the insertion idx, put the low elt of V2 here.
5274 MaskVec.push_back(i == Idx ? NumElems : i);
5275 return DAG.getVectorShuffle(VT, SDLoc(V2), V1, V2, &MaskVec[0]);
5278 /// getTargetShuffleMask - Calculates the shuffle mask corresponding to the
5279 /// target specific opcode. Returns true if the Mask could be calculated. Sets
5280 /// IsUnary to true if only uses one source. Note that this will set IsUnary for
5281 /// shuffles which use a single input multiple times, and in those cases it will
5282 /// adjust the mask to only have indices within that single input.
5283 static bool getTargetShuffleMask(SDNode *N, MVT VT,
5284 SmallVectorImpl<int> &Mask, bool &IsUnary) {
5285 unsigned NumElems = VT.getVectorNumElements();
5289 bool IsFakeUnary = false;
5290 switch(N->getOpcode()) {
5292 ImmN = N->getOperand(N->getNumOperands()-1);
5293 DecodeSHUFPMask(VT, cast<ConstantSDNode>(ImmN)->getZExtValue(), Mask);
5294 IsUnary = IsFakeUnary = N->getOperand(0) == N->getOperand(1);
5296 case X86ISD::UNPCKH:
5297 DecodeUNPCKHMask(VT, Mask);
5298 IsUnary = IsFakeUnary = N->getOperand(0) == N->getOperand(1);
5300 case X86ISD::UNPCKL:
5301 DecodeUNPCKLMask(VT, Mask);
5302 IsUnary = IsFakeUnary = N->getOperand(0) == N->getOperand(1);
5304 case X86ISD::MOVHLPS:
5305 DecodeMOVHLPSMask(NumElems, Mask);
5306 IsUnary = IsFakeUnary = N->getOperand(0) == N->getOperand(1);
5308 case X86ISD::MOVLHPS:
5309 DecodeMOVLHPSMask(NumElems, Mask);
5310 IsUnary = IsFakeUnary = N->getOperand(0) == N->getOperand(1);
5312 case X86ISD::PALIGNR:
5313 ImmN = N->getOperand(N->getNumOperands()-1);
5314 DecodePALIGNRMask(VT, cast<ConstantSDNode>(ImmN)->getZExtValue(), Mask);
5316 case X86ISD::PSHUFD:
5317 case X86ISD::VPERMILP:
5318 ImmN = N->getOperand(N->getNumOperands()-1);
5319 DecodePSHUFMask(VT, cast<ConstantSDNode>(ImmN)->getZExtValue(), Mask);
5322 case X86ISD::PSHUFHW:
5323 ImmN = N->getOperand(N->getNumOperands()-1);
5324 DecodePSHUFHWMask(VT, cast<ConstantSDNode>(ImmN)->getZExtValue(), Mask);
5327 case X86ISD::PSHUFLW:
5328 ImmN = N->getOperand(N->getNumOperands()-1);
5329 DecodePSHUFLWMask(VT, cast<ConstantSDNode>(ImmN)->getZExtValue(), Mask);
5332 case X86ISD::PSHUFB: {
5334 SDValue MaskNode = N->getOperand(1);
5335 while (MaskNode->getOpcode() == ISD::BITCAST)
5336 MaskNode = MaskNode->getOperand(0);
5338 if (MaskNode->getOpcode() == ISD::BUILD_VECTOR) {
5339 // If we have a build-vector, then things are easy.
5340 EVT VT = MaskNode.getValueType();
5341 assert(VT.isVector() &&
5342 "Can't produce a non-vector with a build_vector!");
5343 if (!VT.isInteger())
5346 int NumBytesPerElement = VT.getVectorElementType().getSizeInBits() / 8;
5348 SmallVector<uint64_t, 32> RawMask;
5349 for (int i = 0, e = MaskNode->getNumOperands(); i < e; ++i) {
5350 auto *CN = dyn_cast<ConstantSDNode>(MaskNode->getOperand(i));
5353 APInt MaskElement = CN->getAPIntValue();
5355 // We now have to decode the element which could be any integer size and
5356 // extract each byte of it.
5357 for (int j = 0; j < NumBytesPerElement; ++j) {
5358 // Note that this is x86 and so always little endian: the low byte is
5359 // the first byte of the mask.
5360 RawMask.push_back(MaskElement.getLoBits(8).getZExtValue());
5361 MaskElement = MaskElement.lshr(8);
5364 DecodePSHUFBMask(RawMask, Mask);
5368 auto *MaskLoad = dyn_cast<LoadSDNode>(MaskNode);
5372 SDValue Ptr = MaskLoad->getBasePtr();
5373 if (Ptr->getOpcode() == X86ISD::Wrapper)
5374 Ptr = Ptr->getOperand(0);
5376 auto *MaskCP = dyn_cast<ConstantPoolSDNode>(Ptr);
5377 if (!MaskCP || MaskCP->isMachineConstantPoolEntry())
5380 if (auto *C = dyn_cast<ConstantDataSequential>(MaskCP->getConstVal())) {
5381 // FIXME: Support AVX-512 here.
5382 if (!C->getType()->isVectorTy() ||
5383 (C->getNumElements() != 16 && C->getNumElements() != 32))
5386 assert(C->getType()->isVectorTy() && "Expected a vector constant.");
5387 DecodePSHUFBMask(C, Mask);
5393 case X86ISD::VPERMI:
5394 ImmN = N->getOperand(N->getNumOperands()-1);
5395 DecodeVPERMMask(cast<ConstantSDNode>(ImmN)->getZExtValue(), Mask);
5399 case X86ISD::MOVSD: {
5400 // The index 0 always comes from the first element of the second source,
5401 // this is why MOVSS and MOVSD are used in the first place. The other
5402 // elements come from the other positions of the first source vector
5403 Mask.push_back(NumElems);
5404 for (unsigned i = 1; i != NumElems; ++i) {
5409 case X86ISD::VPERM2X128:
5410 ImmN = N->getOperand(N->getNumOperands()-1);
5411 DecodeVPERM2X128Mask(VT, cast<ConstantSDNode>(ImmN)->getZExtValue(), Mask);
5412 if (Mask.empty()) return false;
5414 case X86ISD::MOVSLDUP:
5415 DecodeMOVSLDUPMask(VT, Mask);
5417 case X86ISD::MOVSHDUP:
5418 DecodeMOVSHDUPMask(VT, Mask);
5420 case X86ISD::MOVDDUP:
5421 case X86ISD::MOVLHPD:
5422 case X86ISD::MOVLPD:
5423 case X86ISD::MOVLPS:
5424 // Not yet implemented
5426 default: llvm_unreachable("unknown target shuffle node");
5429 // If we have a fake unary shuffle, the shuffle mask is spread across two
5430 // inputs that are actually the same node. Re-map the mask to always point
5431 // into the first input.
5434 if (M >= (int)Mask.size())
5440 /// getShuffleScalarElt - Returns the scalar element that will make up the ith
5441 /// element of the result of the vector shuffle.
5442 static SDValue getShuffleScalarElt(SDNode *N, unsigned Index, SelectionDAG &DAG,
5445 return SDValue(); // Limit search depth.
5447 SDValue V = SDValue(N, 0);
5448 EVT VT = V.getValueType();
5449 unsigned Opcode = V.getOpcode();
5451 // Recurse into ISD::VECTOR_SHUFFLE node to find scalars.
5452 if (const ShuffleVectorSDNode *SV = dyn_cast<ShuffleVectorSDNode>(N)) {
5453 int Elt = SV->getMaskElt(Index);
5456 return DAG.getUNDEF(VT.getVectorElementType());
5458 unsigned NumElems = VT.getVectorNumElements();
5459 SDValue NewV = (Elt < (int)NumElems) ? SV->getOperand(0)
5460 : SV->getOperand(1);
5461 return getShuffleScalarElt(NewV.getNode(), Elt % NumElems, DAG, Depth+1);
5464 // Recurse into target specific vector shuffles to find scalars.
5465 if (isTargetShuffle(Opcode)) {
5466 MVT ShufVT = V.getSimpleValueType();
5467 unsigned NumElems = ShufVT.getVectorNumElements();
5468 SmallVector<int, 16> ShuffleMask;
5471 if (!getTargetShuffleMask(N, ShufVT, ShuffleMask, IsUnary))
5474 int Elt = ShuffleMask[Index];
5476 return DAG.getUNDEF(ShufVT.getVectorElementType());
5478 SDValue NewV = (Elt < (int)NumElems) ? N->getOperand(0)
5480 return getShuffleScalarElt(NewV.getNode(), Elt % NumElems, DAG,
5484 // Actual nodes that may contain scalar elements
5485 if (Opcode == ISD::BITCAST) {
5486 V = V.getOperand(0);
5487 EVT SrcVT = V.getValueType();
5488 unsigned NumElems = VT.getVectorNumElements();
5490 if (!SrcVT.isVector() || SrcVT.getVectorNumElements() != NumElems)
5494 if (V.getOpcode() == ISD::SCALAR_TO_VECTOR)
5495 return (Index == 0) ? V.getOperand(0)
5496 : DAG.getUNDEF(VT.getVectorElementType());
5498 if (V.getOpcode() == ISD::BUILD_VECTOR)
5499 return V.getOperand(Index);
5504 /// getNumOfConsecutiveZeros - Return the number of elements of a vector
5505 /// shuffle operation which come from a consecutively from a zero. The
5506 /// search can start in two different directions, from left or right.
5507 /// We count undefs as zeros until PreferredNum is reached.
5508 static unsigned getNumOfConsecutiveZeros(ShuffleVectorSDNode *SVOp,
5509 unsigned NumElems, bool ZerosFromLeft,
5511 unsigned PreferredNum = -1U) {
5512 unsigned NumZeros = 0;
5513 for (unsigned i = 0; i != NumElems; ++i) {
5514 unsigned Index = ZerosFromLeft ? i : NumElems - i - 1;
5515 SDValue Elt = getShuffleScalarElt(SVOp, Index, DAG, 0);
5519 if (X86::isZeroNode(Elt))
5521 else if (Elt.getOpcode() == ISD::UNDEF) // Undef as zero up to PreferredNum.
5522 NumZeros = std::min(NumZeros + 1, PreferredNum);
5530 /// isShuffleMaskConsecutive - Check if the shuffle mask indicies [MaskI, MaskE)
5531 /// correspond consecutively to elements from one of the vector operands,
5532 /// starting from its index OpIdx. Also tell OpNum which source vector operand.
5534 bool isShuffleMaskConsecutive(ShuffleVectorSDNode *SVOp,
5535 unsigned MaskI, unsigned MaskE, unsigned OpIdx,
5536 unsigned NumElems, unsigned &OpNum) {
5537 bool SeenV1 = false;
5538 bool SeenV2 = false;
5540 for (unsigned i = MaskI; i != MaskE; ++i, ++OpIdx) {
5541 int Idx = SVOp->getMaskElt(i);
5542 // Ignore undef indicies
5546 if (Idx < (int)NumElems)
5551 // Only accept consecutive elements from the same vector
5552 if ((Idx % NumElems != OpIdx) || (SeenV1 && SeenV2))
5556 OpNum = SeenV1 ? 0 : 1;
5560 /// isVectorShiftRight - Returns true if the shuffle can be implemented as a
5561 /// logical left shift of a vector.
5562 static bool isVectorShiftRight(ShuffleVectorSDNode *SVOp, SelectionDAG &DAG,
5563 bool &isLeft, SDValue &ShVal, unsigned &ShAmt) {
5565 SVOp->getSimpleValueType(0).getVectorNumElements();
5566 unsigned NumZeros = getNumOfConsecutiveZeros(
5567 SVOp, NumElems, false /* check zeros from right */, DAG,
5568 SVOp->getMaskElt(0));
5574 // Considering the elements in the mask that are not consecutive zeros,
5575 // check if they consecutively come from only one of the source vectors.
5577 // V1 = {X, A, B, C} 0
5579 // vector_shuffle V1, V2 <1, 2, 3, X>
5581 if (!isShuffleMaskConsecutive(SVOp,
5582 0, // Mask Start Index
5583 NumElems-NumZeros, // Mask End Index(exclusive)
5584 NumZeros, // Where to start looking in the src vector
5585 NumElems, // Number of elements in vector
5586 OpSrc)) // Which source operand ?
5591 ShVal = SVOp->getOperand(OpSrc);
5595 /// isVectorShiftLeft - Returns true if the shuffle can be implemented as a
5596 /// logical left shift of a vector.
5597 static bool isVectorShiftLeft(ShuffleVectorSDNode *SVOp, SelectionDAG &DAG,
5598 bool &isLeft, SDValue &ShVal, unsigned &ShAmt) {
5600 SVOp->getSimpleValueType(0).getVectorNumElements();
5601 unsigned NumZeros = getNumOfConsecutiveZeros(
5602 SVOp, NumElems, true /* check zeros from left */, DAG,
5603 NumElems - SVOp->getMaskElt(NumElems - 1) - 1);
5609 // Considering the elements in the mask that are not consecutive zeros,
5610 // check if they consecutively come from only one of the source vectors.
5612 // 0 { A, B, X, X } = V2
5614 // vector_shuffle V1, V2 <X, X, 4, 5>
5616 if (!isShuffleMaskConsecutive(SVOp,
5617 NumZeros, // Mask Start Index
5618 NumElems, // Mask End Index(exclusive)
5619 0, // Where to start looking in the src vector
5620 NumElems, // Number of elements in vector
5621 OpSrc)) // Which source operand ?
5626 ShVal = SVOp->getOperand(OpSrc);
5630 /// isVectorShift - Returns true if the shuffle can be implemented as a
5631 /// logical left or right shift of a vector.
5632 static bool isVectorShift(ShuffleVectorSDNode *SVOp, SelectionDAG &DAG,
5633 bool &isLeft, SDValue &ShVal, unsigned &ShAmt) {
5634 // Although the logic below support any bitwidth size, there are no
5635 // shift instructions which handle more than 128-bit vectors.
5636 if (!SVOp->getSimpleValueType(0).is128BitVector())
5639 if (isVectorShiftLeft(SVOp, DAG, isLeft, ShVal, ShAmt) ||
5640 isVectorShiftRight(SVOp, DAG, isLeft, ShVal, ShAmt))
5646 /// LowerBuildVectorv16i8 - Custom lower build_vector of v16i8.
5648 static SDValue LowerBuildVectorv16i8(SDValue Op, unsigned NonZeros,
5649 unsigned NumNonZero, unsigned NumZero,
5651 const X86Subtarget* Subtarget,
5652 const TargetLowering &TLI) {
5659 for (unsigned i = 0; i < 16; ++i) {
5660 bool ThisIsNonZero = (NonZeros & (1 << i)) != 0;
5661 if (ThisIsNonZero && First) {
5663 V = getZeroVector(MVT::v8i16, Subtarget, DAG, dl);
5665 V = DAG.getUNDEF(MVT::v8i16);
5670 SDValue ThisElt, LastElt;
5671 bool LastIsNonZero = (NonZeros & (1 << (i-1))) != 0;
5672 if (LastIsNonZero) {
5673 LastElt = DAG.getNode(ISD::ZERO_EXTEND, dl,
5674 MVT::i16, Op.getOperand(i-1));
5676 if (ThisIsNonZero) {
5677 ThisElt = DAG.getNode(ISD::ZERO_EXTEND, dl, MVT::i16, Op.getOperand(i));
5678 ThisElt = DAG.getNode(ISD::SHL, dl, MVT::i16,
5679 ThisElt, DAG.getConstant(8, MVT::i8));
5681 ThisElt = DAG.getNode(ISD::OR, dl, MVT::i16, ThisElt, LastElt);
5685 if (ThisElt.getNode())
5686 V = DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, MVT::v8i16, V, ThisElt,
5687 DAG.getIntPtrConstant(i/2));
5691 return DAG.getNode(ISD::BITCAST, dl, MVT::v16i8, V);
5694 /// LowerBuildVectorv8i16 - Custom lower build_vector of v8i16.
5696 static SDValue LowerBuildVectorv8i16(SDValue Op, unsigned NonZeros,
5697 unsigned NumNonZero, unsigned NumZero,
5699 const X86Subtarget* Subtarget,
5700 const TargetLowering &TLI) {
5707 for (unsigned i = 0; i < 8; ++i) {
5708 bool isNonZero = (NonZeros & (1 << i)) != 0;
5712 V = getZeroVector(MVT::v8i16, Subtarget, DAG, dl);
5714 V = DAG.getUNDEF(MVT::v8i16);
5717 V = DAG.getNode(ISD::INSERT_VECTOR_ELT, dl,
5718 MVT::v8i16, V, Op.getOperand(i),
5719 DAG.getIntPtrConstant(i));
5726 /// LowerBuildVectorv4x32 - Custom lower build_vector of v4i32 or v4f32.
5727 static SDValue LowerBuildVectorv4x32(SDValue Op, unsigned NumElems,
5728 unsigned NonZeros, unsigned NumNonZero,
5729 unsigned NumZero, SelectionDAG &DAG,
5730 const X86Subtarget *Subtarget,
5731 const TargetLowering &TLI) {
5732 // We know there's at least one non-zero element
5733 unsigned FirstNonZeroIdx = 0;
5734 SDValue FirstNonZero = Op->getOperand(FirstNonZeroIdx);
5735 while (FirstNonZero.getOpcode() == ISD::UNDEF ||
5736 X86::isZeroNode(FirstNonZero)) {
5738 FirstNonZero = Op->getOperand(FirstNonZeroIdx);
5741 if (FirstNonZero.getOpcode() != ISD::EXTRACT_VECTOR_ELT ||
5742 !isa<ConstantSDNode>(FirstNonZero.getOperand(1)))
5745 SDValue V = FirstNonZero.getOperand(0);
5746 MVT VVT = V.getSimpleValueType();
5747 if (!Subtarget->hasSSE41() || (VVT != MVT::v4f32 && VVT != MVT::v4i32))
5750 unsigned FirstNonZeroDst =
5751 cast<ConstantSDNode>(FirstNonZero.getOperand(1))->getZExtValue();
5752 unsigned CorrectIdx = FirstNonZeroDst == FirstNonZeroIdx;
5753 unsigned IncorrectIdx = CorrectIdx ? -1U : FirstNonZeroIdx;
5754 unsigned IncorrectDst = CorrectIdx ? -1U : FirstNonZeroDst;
5756 for (unsigned Idx = FirstNonZeroIdx + 1; Idx < NumElems; ++Idx) {
5757 SDValue Elem = Op.getOperand(Idx);
5758 if (Elem.getOpcode() == ISD::UNDEF || X86::isZeroNode(Elem))
5761 // TODO: What else can be here? Deal with it.
5762 if (Elem.getOpcode() != ISD::EXTRACT_VECTOR_ELT)
5765 // TODO: Some optimizations are still possible here
5766 // ex: Getting one element from a vector, and the rest from another.
5767 if (Elem.getOperand(0) != V)
5770 unsigned Dst = cast<ConstantSDNode>(Elem.getOperand(1))->getZExtValue();
5773 else if (IncorrectIdx == -1U) {
5777 // There was already one element with an incorrect index.
5778 // We can't optimize this case to an insertps.
5782 if (NumNonZero == CorrectIdx || NumNonZero == CorrectIdx + 1) {
5784 EVT VT = Op.getSimpleValueType();
5785 unsigned ElementMoveMask = 0;
5786 if (IncorrectIdx == -1U)
5787 ElementMoveMask = FirstNonZeroIdx << 6 | FirstNonZeroIdx << 4;
5789 ElementMoveMask = IncorrectDst << 6 | IncorrectIdx << 4;
5791 SDValue InsertpsMask =
5792 DAG.getIntPtrConstant(ElementMoveMask | (~NonZeros & 0xf));
5793 return DAG.getNode(X86ISD::INSERTPS, dl, VT, V, V, InsertpsMask);
5799 /// getVShift - Return a vector logical shift node.
5801 static SDValue getVShift(bool isLeft, EVT VT, SDValue SrcOp,
5802 unsigned NumBits, SelectionDAG &DAG,
5803 const TargetLowering &TLI, SDLoc dl) {
5804 assert(VT.is128BitVector() && "Unknown type for VShift");
5805 EVT ShVT = MVT::v2i64;
5806 unsigned Opc = isLeft ? X86ISD::VSHLDQ : X86ISD::VSRLDQ;
5807 SrcOp = DAG.getNode(ISD::BITCAST, dl, ShVT, SrcOp);
5808 return DAG.getNode(ISD::BITCAST, dl, VT,
5809 DAG.getNode(Opc, dl, ShVT, SrcOp,
5810 DAG.getConstant(NumBits,
5811 TLI.getScalarShiftAmountTy(SrcOp.getValueType()))));
5815 LowerAsSplatVectorLoad(SDValue SrcOp, MVT VT, SDLoc dl, SelectionDAG &DAG) {
5817 // Check if the scalar load can be widened into a vector load. And if
5818 // the address is "base + cst" see if the cst can be "absorbed" into
5819 // the shuffle mask.
5820 if (LoadSDNode *LD = dyn_cast<LoadSDNode>(SrcOp)) {
5821 SDValue Ptr = LD->getBasePtr();
5822 if (!ISD::isNormalLoad(LD) || LD->isVolatile())
5824 EVT PVT = LD->getValueType(0);
5825 if (PVT != MVT::i32 && PVT != MVT::f32)
5830 if (FrameIndexSDNode *FINode = dyn_cast<FrameIndexSDNode>(Ptr)) {
5831 FI = FINode->getIndex();
5833 } else if (DAG.isBaseWithConstantOffset(Ptr) &&
5834 isa<FrameIndexSDNode>(Ptr.getOperand(0))) {
5835 FI = cast<FrameIndexSDNode>(Ptr.getOperand(0))->getIndex();
5836 Offset = Ptr.getConstantOperandVal(1);
5837 Ptr = Ptr.getOperand(0);
5842 // FIXME: 256-bit vector instructions don't require a strict alignment,
5843 // improve this code to support it better.
5844 unsigned RequiredAlign = VT.getSizeInBits()/8;
5845 SDValue Chain = LD->getChain();
5846 // Make sure the stack object alignment is at least 16 or 32.
5847 MachineFrameInfo *MFI = DAG.getMachineFunction().getFrameInfo();
5848 if (DAG.InferPtrAlignment(Ptr) < RequiredAlign) {
5849 if (MFI->isFixedObjectIndex(FI)) {
5850 // Can't change the alignment. FIXME: It's possible to compute
5851 // the exact stack offset and reference FI + adjust offset instead.
5852 // If someone *really* cares about this. That's the way to implement it.
5855 MFI->setObjectAlignment(FI, RequiredAlign);
5859 // (Offset % 16 or 32) must be multiple of 4. Then address is then
5860 // Ptr + (Offset & ~15).
5863 if ((Offset % RequiredAlign) & 3)
5865 int64_t StartOffset = Offset & ~(RequiredAlign-1);
5867 Ptr = DAG.getNode(ISD::ADD, SDLoc(Ptr), Ptr.getValueType(),
5868 Ptr,DAG.getConstant(StartOffset, Ptr.getValueType()));
5870 int EltNo = (Offset - StartOffset) >> 2;
5871 unsigned NumElems = VT.getVectorNumElements();
5873 EVT NVT = EVT::getVectorVT(*DAG.getContext(), PVT, NumElems);
5874 SDValue V1 = DAG.getLoad(NVT, dl, Chain, Ptr,
5875 LD->getPointerInfo().getWithOffset(StartOffset),
5876 false, false, false, 0);
5878 SmallVector<int, 8> Mask;
5879 for (unsigned i = 0; i != NumElems; ++i)
5880 Mask.push_back(EltNo);
5882 return DAG.getVectorShuffle(NVT, dl, V1, DAG.getUNDEF(NVT), &Mask[0]);
5888 /// EltsFromConsecutiveLoads - Given the initializing elements 'Elts' of a
5889 /// vector of type 'VT', see if the elements can be replaced by a single large
5890 /// load which has the same value as a build_vector whose operands are 'elts'.
5892 /// Example: <load i32 *a, load i32 *a+4, undef, undef> -> zextload a
5894 /// FIXME: we'd also like to handle the case where the last elements are zero
5895 /// rather than undef via VZEXT_LOAD, but we do not detect that case today.
5896 /// There's even a handy isZeroNode for that purpose.
5897 static SDValue EltsFromConsecutiveLoads(EVT VT, SmallVectorImpl<SDValue> &Elts,
5898 SDLoc &DL, SelectionDAG &DAG,
5899 bool isAfterLegalize) {
5900 EVT EltVT = VT.getVectorElementType();
5901 unsigned NumElems = Elts.size();
5903 LoadSDNode *LDBase = nullptr;
5904 unsigned LastLoadedElt = -1U;
5906 // For each element in the initializer, see if we've found a load or an undef.
5907 // If we don't find an initial load element, or later load elements are
5908 // non-consecutive, bail out.
5909 for (unsigned i = 0; i < NumElems; ++i) {
5910 SDValue Elt = Elts[i];
5912 if (!Elt.getNode() ||
5913 (Elt.getOpcode() != ISD::UNDEF && !ISD::isNON_EXTLoad(Elt.getNode())))
5916 if (Elt.getNode()->getOpcode() == ISD::UNDEF)
5918 LDBase = cast<LoadSDNode>(Elt.getNode());
5922 if (Elt.getOpcode() == ISD::UNDEF)
5925 LoadSDNode *LD = cast<LoadSDNode>(Elt);
5926 if (!DAG.isConsecutiveLoad(LD, LDBase, EltVT.getSizeInBits()/8, i))
5931 // If we have found an entire vector of loads and undefs, then return a large
5932 // load of the entire vector width starting at the base pointer. If we found
5933 // consecutive loads for the low half, generate a vzext_load node.
5934 if (LastLoadedElt == NumElems - 1) {
5936 if (isAfterLegalize &&
5937 !DAG.getTargetLoweringInfo().isOperationLegal(ISD::LOAD, VT))
5940 SDValue NewLd = SDValue();
5942 if (DAG.InferPtrAlignment(LDBase->getBasePtr()) >= 16)
5943 NewLd = DAG.getLoad(VT, DL, LDBase->getChain(), LDBase->getBasePtr(),
5944 LDBase->getPointerInfo(),
5945 LDBase->isVolatile(), LDBase->isNonTemporal(),
5946 LDBase->isInvariant(), 0);
5947 NewLd = DAG.getLoad(VT, DL, LDBase->getChain(), LDBase->getBasePtr(),
5948 LDBase->getPointerInfo(),
5949 LDBase->isVolatile(), LDBase->isNonTemporal(),
5950 LDBase->isInvariant(), LDBase->getAlignment());
5952 if (LDBase->hasAnyUseOfValue(1)) {
5953 SDValue NewChain = DAG.getNode(ISD::TokenFactor, DL, MVT::Other,
5955 SDValue(NewLd.getNode(), 1));
5956 DAG.ReplaceAllUsesOfValueWith(SDValue(LDBase, 1), NewChain);
5957 DAG.UpdateNodeOperands(NewChain.getNode(), SDValue(LDBase, 1),
5958 SDValue(NewLd.getNode(), 1));
5963 if (NumElems == 4 && LastLoadedElt == 1 &&
5964 DAG.getTargetLoweringInfo().isTypeLegal(MVT::v2i64)) {
5965 SDVTList Tys = DAG.getVTList(MVT::v2i64, MVT::Other);
5966 SDValue Ops[] = { LDBase->getChain(), LDBase->getBasePtr() };
5968 DAG.getMemIntrinsicNode(X86ISD::VZEXT_LOAD, DL, Tys, Ops, MVT::i64,
5969 LDBase->getPointerInfo(),
5970 LDBase->getAlignment(),
5971 false/*isVolatile*/, true/*ReadMem*/,
5974 // Make sure the newly-created LOAD is in the same position as LDBase in
5975 // terms of dependency. We create a TokenFactor for LDBase and ResNode, and
5976 // update uses of LDBase's output chain to use the TokenFactor.
5977 if (LDBase->hasAnyUseOfValue(1)) {
5978 SDValue NewChain = DAG.getNode(ISD::TokenFactor, DL, MVT::Other,
5979 SDValue(LDBase, 1), SDValue(ResNode.getNode(), 1));
5980 DAG.ReplaceAllUsesOfValueWith(SDValue(LDBase, 1), NewChain);
5981 DAG.UpdateNodeOperands(NewChain.getNode(), SDValue(LDBase, 1),
5982 SDValue(ResNode.getNode(), 1));
5985 return DAG.getNode(ISD::BITCAST, DL, VT, ResNode);
5990 /// LowerVectorBroadcast - Attempt to use the vbroadcast instruction
5991 /// to generate a splat value for the following cases:
5992 /// 1. A splat BUILD_VECTOR which uses a single scalar load, or a constant.
5993 /// 2. A splat shuffle which uses a scalar_to_vector node which comes from
5994 /// a scalar load, or a constant.
5995 /// The VBROADCAST node is returned when a pattern is found,
5996 /// or SDValue() otherwise.
5997 static SDValue LowerVectorBroadcast(SDValue Op, const X86Subtarget* Subtarget,
5998 SelectionDAG &DAG) {
5999 if (!Subtarget->hasFp256())
6002 MVT VT = Op.getSimpleValueType();
6005 assert((VT.is128BitVector() || VT.is256BitVector() || VT.is512BitVector()) &&
6006 "Unsupported vector type for broadcast.");
6011 switch (Op.getOpcode()) {
6013 // Unknown pattern found.
6016 case ISD::BUILD_VECTOR: {
6017 auto *BVOp = cast<BuildVectorSDNode>(Op.getNode());
6018 BitVector UndefElements;
6019 SDValue Splat = BVOp->getSplatValue(&UndefElements);
6021 // We need a splat of a single value to use broadcast, and it doesn't
6022 // make any sense if the value is only in one element of the vector.
6023 if (!Splat || (VT.getVectorNumElements() - UndefElements.count()) <= 1)
6027 ConstSplatVal = (Ld.getOpcode() == ISD::Constant ||
6028 Ld.getOpcode() == ISD::ConstantFP);
6030 // Make sure that all of the users of a non-constant load are from the
6031 // BUILD_VECTOR node.
6032 if (!ConstSplatVal && !BVOp->isOnlyUserOf(Ld.getNode()))
6037 case ISD::VECTOR_SHUFFLE: {
6038 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
6040 // Shuffles must have a splat mask where the first element is
6042 if ((!SVOp->isSplat()) || SVOp->getMaskElt(0) != 0)
6045 SDValue Sc = Op.getOperand(0);
6046 if (Sc.getOpcode() != ISD::SCALAR_TO_VECTOR &&
6047 Sc.getOpcode() != ISD::BUILD_VECTOR) {
6049 if (!Subtarget->hasInt256())
6052 // Use the register form of the broadcast instruction available on AVX2.
6053 if (VT.getSizeInBits() >= 256)
6054 Sc = Extract128BitVector(Sc, 0, DAG, dl);
6055 return DAG.getNode(X86ISD::VBROADCAST, dl, VT, Sc);
6058 Ld = Sc.getOperand(0);
6059 ConstSplatVal = (Ld.getOpcode() == ISD::Constant ||
6060 Ld.getOpcode() == ISD::ConstantFP);
6062 // The scalar_to_vector node and the suspected
6063 // load node must have exactly one user.
6064 // Constants may have multiple users.
6066 // AVX-512 has register version of the broadcast
6067 bool hasRegVer = Subtarget->hasAVX512() && VT.is512BitVector() &&
6068 Ld.getValueType().getSizeInBits() >= 32;
6069 if (!ConstSplatVal && ((!Sc.hasOneUse() || !Ld.hasOneUse()) &&
6076 bool IsGE256 = (VT.getSizeInBits() >= 256);
6078 // Handle the broadcasting a single constant scalar from the constant pool
6079 // into a vector. On Sandybridge it is still better to load a constant vector
6080 // from the constant pool and not to broadcast it from a scalar.
6081 if (ConstSplatVal && Subtarget->hasInt256()) {
6082 EVT CVT = Ld.getValueType();
6083 assert(!CVT.isVector() && "Must not broadcast a vector type");
6084 unsigned ScalarSize = CVT.getSizeInBits();
6086 if (ScalarSize == 32 || (IsGE256 && ScalarSize == 64)) {
6087 const Constant *C = nullptr;
6088 if (ConstantSDNode *CI = dyn_cast<ConstantSDNode>(Ld))
6089 C = CI->getConstantIntValue();
6090 else if (ConstantFPSDNode *CF = dyn_cast<ConstantFPSDNode>(Ld))
6091 C = CF->getConstantFPValue();
6093 assert(C && "Invalid constant type");
6095 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
6096 SDValue CP = DAG.getConstantPool(C, TLI.getPointerTy());
6097 unsigned Alignment = cast<ConstantPoolSDNode>(CP)->getAlignment();
6098 Ld = DAG.getLoad(CVT, dl, DAG.getEntryNode(), CP,
6099 MachinePointerInfo::getConstantPool(),
6100 false, false, false, Alignment);
6102 return DAG.getNode(X86ISD::VBROADCAST, dl, VT, Ld);
6106 bool IsLoad = ISD::isNormalLoad(Ld.getNode());
6107 unsigned ScalarSize = Ld.getValueType().getSizeInBits();
6109 // Handle AVX2 in-register broadcasts.
6110 if (!IsLoad && Subtarget->hasInt256() &&
6111 (ScalarSize == 32 || (IsGE256 && ScalarSize == 64)))
6112 return DAG.getNode(X86ISD::VBROADCAST, dl, VT, Ld);
6114 // The scalar source must be a normal load.
6118 if (ScalarSize == 32 || (IsGE256 && ScalarSize == 64))
6119 return DAG.getNode(X86ISD::VBROADCAST, dl, VT, Ld);
6121 // The integer check is needed for the 64-bit into 128-bit so it doesn't match
6122 // double since there is no vbroadcastsd xmm
6123 if (Subtarget->hasInt256() && Ld.getValueType().isInteger()) {
6124 if (ScalarSize == 8 || ScalarSize == 16 || ScalarSize == 64)
6125 return DAG.getNode(X86ISD::VBROADCAST, dl, VT, Ld);
6128 // Unsupported broadcast.
6132 /// \brief For an EXTRACT_VECTOR_ELT with a constant index return the real
6133 /// underlying vector and index.
6135 /// Modifies \p ExtractedFromVec to the real vector and returns the real
6137 static int getUnderlyingExtractedFromVec(SDValue &ExtractedFromVec,
6139 int Idx = cast<ConstantSDNode>(ExtIdx)->getZExtValue();
6140 if (!isa<ShuffleVectorSDNode>(ExtractedFromVec))
6143 // For 256-bit vectors, LowerEXTRACT_VECTOR_ELT_SSE4 may have already
6145 // (extract_vector_elt (v8f32 %vreg1), Constant<6>)
6147 // (extract_vector_elt (vector_shuffle<2,u,u,u>
6148 // (extract_subvector (v8f32 %vreg0), Constant<4>),
6151 // In this case the vector is the extract_subvector expression and the index
6152 // is 2, as specified by the shuffle.
6153 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(ExtractedFromVec);
6154 SDValue ShuffleVec = SVOp->getOperand(0);
6155 MVT ShuffleVecVT = ShuffleVec.getSimpleValueType();
6156 assert(ShuffleVecVT.getVectorElementType() ==
6157 ExtractedFromVec.getSimpleValueType().getVectorElementType());
6159 int ShuffleIdx = SVOp->getMaskElt(Idx);
6160 if (isUndefOrInRange(ShuffleIdx, 0, ShuffleVecVT.getVectorNumElements())) {
6161 ExtractedFromVec = ShuffleVec;
6167 static SDValue buildFromShuffleMostly(SDValue Op, SelectionDAG &DAG) {
6168 MVT VT = Op.getSimpleValueType();
6170 // Skip if insert_vec_elt is not supported.
6171 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
6172 if (!TLI.isOperationLegalOrCustom(ISD::INSERT_VECTOR_ELT, VT))
6176 unsigned NumElems = Op.getNumOperands();
6180 SmallVector<unsigned, 4> InsertIndices;
6181 SmallVector<int, 8> Mask(NumElems, -1);
6183 for (unsigned i = 0; i != NumElems; ++i) {
6184 unsigned Opc = Op.getOperand(i).getOpcode();
6186 if (Opc == ISD::UNDEF)
6189 if (Opc != ISD::EXTRACT_VECTOR_ELT) {
6190 // Quit if more than 1 elements need inserting.
6191 if (InsertIndices.size() > 1)
6194 InsertIndices.push_back(i);
6198 SDValue ExtractedFromVec = Op.getOperand(i).getOperand(0);
6199 SDValue ExtIdx = Op.getOperand(i).getOperand(1);
6200 // Quit if non-constant index.
6201 if (!isa<ConstantSDNode>(ExtIdx))
6203 int Idx = getUnderlyingExtractedFromVec(ExtractedFromVec, ExtIdx);
6205 // Quit if extracted from vector of different type.
6206 if (ExtractedFromVec.getValueType() != VT)
6209 if (!VecIn1.getNode())
6210 VecIn1 = ExtractedFromVec;
6211 else if (VecIn1 != ExtractedFromVec) {
6212 if (!VecIn2.getNode())
6213 VecIn2 = ExtractedFromVec;
6214 else if (VecIn2 != ExtractedFromVec)
6215 // Quit if more than 2 vectors to shuffle
6219 if (ExtractedFromVec == VecIn1)
6221 else if (ExtractedFromVec == VecIn2)
6222 Mask[i] = Idx + NumElems;
6225 if (!VecIn1.getNode())
6228 VecIn2 = VecIn2.getNode() ? VecIn2 : DAG.getUNDEF(VT);
6229 SDValue NV = DAG.getVectorShuffle(VT, DL, VecIn1, VecIn2, &Mask[0]);
6230 for (unsigned i = 0, e = InsertIndices.size(); i != e; ++i) {
6231 unsigned Idx = InsertIndices[i];
6232 NV = DAG.getNode(ISD::INSERT_VECTOR_ELT, DL, VT, NV, Op.getOperand(Idx),
6233 DAG.getIntPtrConstant(Idx));
6239 // Lower BUILD_VECTOR operation for v8i1 and v16i1 types.
6241 X86TargetLowering::LowerBUILD_VECTORvXi1(SDValue Op, SelectionDAG &DAG) const {
6243 MVT VT = Op.getSimpleValueType();
6244 assert((VT.getVectorElementType() == MVT::i1) && (VT.getSizeInBits() <= 16) &&
6245 "Unexpected type in LowerBUILD_VECTORvXi1!");
6248 if (ISD::isBuildVectorAllZeros(Op.getNode())) {
6249 SDValue Cst = DAG.getTargetConstant(0, MVT::i1);
6250 SmallVector<SDValue, 16> Ops(VT.getVectorNumElements(), Cst);
6251 return DAG.getNode(ISD::BUILD_VECTOR, dl, VT, Ops);
6254 if (ISD::isBuildVectorAllOnes(Op.getNode())) {
6255 SDValue Cst = DAG.getTargetConstant(1, MVT::i1);
6256 SmallVector<SDValue, 16> Ops(VT.getVectorNumElements(), Cst);
6257 return DAG.getNode(ISD::BUILD_VECTOR, dl, VT, Ops);
6260 bool AllContants = true;
6261 uint64_t Immediate = 0;
6262 int NonConstIdx = -1;
6263 bool IsSplat = true;
6264 unsigned NumNonConsts = 0;
6265 unsigned NumConsts = 0;
6266 for (unsigned idx = 0, e = Op.getNumOperands(); idx < e; ++idx) {
6267 SDValue In = Op.getOperand(idx);
6268 if (In.getOpcode() == ISD::UNDEF)
6270 if (!isa<ConstantSDNode>(In)) {
6271 AllContants = false;
6277 if (cast<ConstantSDNode>(In)->getZExtValue())
6278 Immediate |= (1ULL << idx);
6280 if (In != Op.getOperand(0))
6285 SDValue FullMask = DAG.getNode(ISD::BITCAST, dl, MVT::v16i1,
6286 DAG.getConstant(Immediate, MVT::i16));
6287 return DAG.getNode(ISD::EXTRACT_SUBVECTOR, dl, VT, FullMask,
6288 DAG.getIntPtrConstant(0));
6291 if (NumNonConsts == 1 && NonConstIdx != 0) {
6294 SDValue VecAsImm = DAG.getConstant(Immediate,
6295 MVT::getIntegerVT(VT.getSizeInBits()));
6296 DstVec = DAG.getNode(ISD::BITCAST, dl, VT, VecAsImm);
6299 DstVec = DAG.getUNDEF(VT);
6300 return DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, VT, DstVec,
6301 Op.getOperand(NonConstIdx),
6302 DAG.getIntPtrConstant(NonConstIdx));
6304 if (!IsSplat && (NonConstIdx != 0))
6305 llvm_unreachable("Unsupported BUILD_VECTOR operation");
6306 MVT SelectVT = (VT == MVT::v16i1)? MVT::i16 : MVT::i8;
6309 Select = DAG.getNode(ISD::SELECT, dl, SelectVT, Op.getOperand(0),
6310 DAG.getConstant(-1, SelectVT),
6311 DAG.getConstant(0, SelectVT));
6313 Select = DAG.getNode(ISD::SELECT, dl, SelectVT, Op.getOperand(0),
6314 DAG.getConstant((Immediate | 1), SelectVT),
6315 DAG.getConstant(Immediate, SelectVT));
6316 return DAG.getNode(ISD::BITCAST, dl, VT, Select);
6319 /// \brief Return true if \p N implements a horizontal binop and return the
6320 /// operands for the horizontal binop into V0 and V1.
6322 /// This is a helper function of PerformBUILD_VECTORCombine.
6323 /// This function checks that the build_vector \p N in input implements a
6324 /// horizontal operation. Parameter \p Opcode defines the kind of horizontal
6325 /// operation to match.
6326 /// For example, if \p Opcode is equal to ISD::ADD, then this function
6327 /// checks if \p N implements a horizontal arithmetic add; if instead \p Opcode
6328 /// is equal to ISD::SUB, then this function checks if this is a horizontal
6331 /// This function only analyzes elements of \p N whose indices are
6332 /// in range [BaseIdx, LastIdx).
6333 static bool isHorizontalBinOp(const BuildVectorSDNode *N, unsigned Opcode,
6335 unsigned BaseIdx, unsigned LastIdx,
6336 SDValue &V0, SDValue &V1) {
6337 EVT VT = N->getValueType(0);
6339 assert(BaseIdx * 2 <= LastIdx && "Invalid Indices in input!");
6340 assert(VT.isVector() && VT.getVectorNumElements() >= LastIdx &&
6341 "Invalid Vector in input!");
6343 bool IsCommutable = (Opcode == ISD::ADD || Opcode == ISD::FADD);
6344 bool CanFold = true;
6345 unsigned ExpectedVExtractIdx = BaseIdx;
6346 unsigned NumElts = LastIdx - BaseIdx;
6347 V0 = DAG.getUNDEF(VT);
6348 V1 = DAG.getUNDEF(VT);
6350 // Check if N implements a horizontal binop.
6351 for (unsigned i = 0, e = NumElts; i != e && CanFold; ++i) {
6352 SDValue Op = N->getOperand(i + BaseIdx);
6355 if (Op->getOpcode() == ISD::UNDEF) {
6356 // Update the expected vector extract index.
6357 if (i * 2 == NumElts)
6358 ExpectedVExtractIdx = BaseIdx;
6359 ExpectedVExtractIdx += 2;
6363 CanFold = Op->getOpcode() == Opcode && Op->hasOneUse();
6368 SDValue Op0 = Op.getOperand(0);
6369 SDValue Op1 = Op.getOperand(1);
6371 // Try to match the following pattern:
6372 // (BINOP (extract_vector_elt A, I), (extract_vector_elt A, I+1))
6373 CanFold = (Op0.getOpcode() == ISD::EXTRACT_VECTOR_ELT &&
6374 Op1.getOpcode() == ISD::EXTRACT_VECTOR_ELT &&
6375 Op0.getOperand(0) == Op1.getOperand(0) &&
6376 isa<ConstantSDNode>(Op0.getOperand(1)) &&
6377 isa<ConstantSDNode>(Op1.getOperand(1)));
6381 unsigned I0 = cast<ConstantSDNode>(Op0.getOperand(1))->getZExtValue();
6382 unsigned I1 = cast<ConstantSDNode>(Op1.getOperand(1))->getZExtValue();
6384 if (i * 2 < NumElts) {
6385 if (V0.getOpcode() == ISD::UNDEF)
6386 V0 = Op0.getOperand(0);
6388 if (V1.getOpcode() == ISD::UNDEF)
6389 V1 = Op0.getOperand(0);
6390 if (i * 2 == NumElts)
6391 ExpectedVExtractIdx = BaseIdx;
6394 SDValue Expected = (i * 2 < NumElts) ? V0 : V1;
6395 if (I0 == ExpectedVExtractIdx)
6396 CanFold = I1 == I0 + 1 && Op0.getOperand(0) == Expected;
6397 else if (IsCommutable && I1 == ExpectedVExtractIdx) {
6398 // Try to match the following dag sequence:
6399 // (BINOP (extract_vector_elt A, I+1), (extract_vector_elt A, I))
6400 CanFold = I0 == I1 + 1 && Op1.getOperand(0) == Expected;
6404 ExpectedVExtractIdx += 2;
6410 /// \brief Emit a sequence of two 128-bit horizontal add/sub followed by
6411 /// a concat_vector.
6413 /// This is a helper function of PerformBUILD_VECTORCombine.
6414 /// This function expects two 256-bit vectors called V0 and V1.
6415 /// At first, each vector is split into two separate 128-bit vectors.
6416 /// Then, the resulting 128-bit vectors are used to implement two
6417 /// horizontal binary operations.
6419 /// The kind of horizontal binary operation is defined by \p X86Opcode.
6421 /// \p Mode specifies how the 128-bit parts of V0 and V1 are passed in input to
6422 /// the two new horizontal binop.
6423 /// When Mode is set, the first horizontal binop dag node would take as input
6424 /// the lower 128-bit of V0 and the upper 128-bit of V0. The second
6425 /// horizontal binop dag node would take as input the lower 128-bit of V1
6426 /// and the upper 128-bit of V1.
6428 /// HADD V0_LO, V0_HI
6429 /// HADD V1_LO, V1_HI
6431 /// Otherwise, the first horizontal binop dag node takes as input the lower
6432 /// 128-bit of V0 and the lower 128-bit of V1, and the second horizontal binop
6433 /// dag node takes the the upper 128-bit of V0 and the upper 128-bit of V1.
6435 /// HADD V0_LO, V1_LO
6436 /// HADD V0_HI, V1_HI
6438 /// If \p isUndefLO is set, then the algorithm propagates UNDEF to the lower
6439 /// 128-bits of the result. If \p isUndefHI is set, then UNDEF is propagated to
6440 /// the upper 128-bits of the result.
6441 static SDValue ExpandHorizontalBinOp(const SDValue &V0, const SDValue &V1,
6442 SDLoc DL, SelectionDAG &DAG,
6443 unsigned X86Opcode, bool Mode,
6444 bool isUndefLO, bool isUndefHI) {
6445 EVT VT = V0.getValueType();
6446 assert(VT.is256BitVector() && VT == V1.getValueType() &&
6447 "Invalid nodes in input!");
6449 unsigned NumElts = VT.getVectorNumElements();
6450 SDValue V0_LO = Extract128BitVector(V0, 0, DAG, DL);
6451 SDValue V0_HI = Extract128BitVector(V0, NumElts/2, DAG, DL);
6452 SDValue V1_LO = Extract128BitVector(V1, 0, DAG, DL);
6453 SDValue V1_HI = Extract128BitVector(V1, NumElts/2, DAG, DL);
6454 EVT NewVT = V0_LO.getValueType();
6456 SDValue LO = DAG.getUNDEF(NewVT);
6457 SDValue HI = DAG.getUNDEF(NewVT);
6460 // Don't emit a horizontal binop if the result is expected to be UNDEF.
6461 if (!isUndefLO && V0->getOpcode() != ISD::UNDEF)
6462 LO = DAG.getNode(X86Opcode, DL, NewVT, V0_LO, V0_HI);
6463 if (!isUndefHI && V1->getOpcode() != ISD::UNDEF)
6464 HI = DAG.getNode(X86Opcode, DL, NewVT, V1_LO, V1_HI);
6466 // Don't emit a horizontal binop if the result is expected to be UNDEF.
6467 if (!isUndefLO && (V0_LO->getOpcode() != ISD::UNDEF ||
6468 V1_LO->getOpcode() != ISD::UNDEF))
6469 LO = DAG.getNode(X86Opcode, DL, NewVT, V0_LO, V1_LO);
6471 if (!isUndefHI && (V0_HI->getOpcode() != ISD::UNDEF ||
6472 V1_HI->getOpcode() != ISD::UNDEF))
6473 HI = DAG.getNode(X86Opcode, DL, NewVT, V0_HI, V1_HI);
6476 return DAG.getNode(ISD::CONCAT_VECTORS, DL, VT, LO, HI);
6479 /// \brief Try to fold a build_vector that performs an 'addsub' into the
6480 /// sequence of 'vadd + vsub + blendi'.
6481 static SDValue matchAddSub(const BuildVectorSDNode *BV, SelectionDAG &DAG,
6482 const X86Subtarget *Subtarget) {
6484 EVT VT = BV->getValueType(0);
6485 unsigned NumElts = VT.getVectorNumElements();
6486 SDValue InVec0 = DAG.getUNDEF(VT);
6487 SDValue InVec1 = DAG.getUNDEF(VT);
6489 assert((VT == MVT::v8f32 || VT == MVT::v4f64 || VT == MVT::v4f32 ||
6490 VT == MVT::v2f64) && "build_vector with an invalid type found!");
6492 // Odd-numbered elements in the input build vector are obtained from
6493 // adding two integer/float elements.
6494 // Even-numbered elements in the input build vector are obtained from
6495 // subtracting two integer/float elements.
6496 unsigned ExpectedOpcode = ISD::FSUB;
6497 unsigned NextExpectedOpcode = ISD::FADD;
6498 bool AddFound = false;
6499 bool SubFound = false;
6501 for (unsigned i = 0, e = NumElts; i != e; i++) {
6502 SDValue Op = BV->getOperand(i);
6504 // Skip 'undef' values.
6505 unsigned Opcode = Op.getOpcode();
6506 if (Opcode == ISD::UNDEF) {
6507 std::swap(ExpectedOpcode, NextExpectedOpcode);
6511 // Early exit if we found an unexpected opcode.
6512 if (Opcode != ExpectedOpcode)
6515 SDValue Op0 = Op.getOperand(0);
6516 SDValue Op1 = Op.getOperand(1);
6518 // Try to match the following pattern:
6519 // (BINOP (extract_vector_elt A, i), (extract_vector_elt B, i))
6520 // Early exit if we cannot match that sequence.
6521 if (Op0.getOpcode() != ISD::EXTRACT_VECTOR_ELT ||
6522 Op1.getOpcode() != ISD::EXTRACT_VECTOR_ELT ||
6523 !isa<ConstantSDNode>(Op0.getOperand(1)) ||
6524 !isa<ConstantSDNode>(Op1.getOperand(1)) ||
6525 Op0.getOperand(1) != Op1.getOperand(1))
6528 unsigned I0 = cast<ConstantSDNode>(Op0.getOperand(1))->getZExtValue();
6532 // We found a valid add/sub node. Update the information accordingly.
6538 // Update InVec0 and InVec1.
6539 if (InVec0.getOpcode() == ISD::UNDEF)
6540 InVec0 = Op0.getOperand(0);
6541 if (InVec1.getOpcode() == ISD::UNDEF)
6542 InVec1 = Op1.getOperand(0);
6544 // Make sure that operands in input to each add/sub node always
6545 // come from a same pair of vectors.
6546 if (InVec0 != Op0.getOperand(0)) {
6547 if (ExpectedOpcode == ISD::FSUB)
6550 // FADD is commutable. Try to commute the operands
6551 // and then test again.
6552 std::swap(Op0, Op1);
6553 if (InVec0 != Op0.getOperand(0))
6557 if (InVec1 != Op1.getOperand(0))
6560 // Update the pair of expected opcodes.
6561 std::swap(ExpectedOpcode, NextExpectedOpcode);
6564 // Don't try to fold this build_vector into an ADDSUB if the inputs are undef.
6565 if (AddFound && SubFound && InVec0.getOpcode() != ISD::UNDEF &&
6566 InVec1.getOpcode() != ISD::UNDEF)
6567 return DAG.getNode(X86ISD::ADDSUB, DL, VT, InVec0, InVec1);
6572 static SDValue PerformBUILD_VECTORCombine(SDNode *N, SelectionDAG &DAG,
6573 const X86Subtarget *Subtarget) {
6575 EVT VT = N->getValueType(0);
6576 unsigned NumElts = VT.getVectorNumElements();
6577 BuildVectorSDNode *BV = cast<BuildVectorSDNode>(N);
6578 SDValue InVec0, InVec1;
6580 // Try to match an ADDSUB.
6581 if ((Subtarget->hasSSE3() && (VT == MVT::v4f32 || VT == MVT::v2f64)) ||
6582 (Subtarget->hasAVX() && (VT == MVT::v8f32 || VT == MVT::v4f64))) {
6583 SDValue Value = matchAddSub(BV, DAG, Subtarget);
6584 if (Value.getNode())
6588 // Try to match horizontal ADD/SUB.
6589 unsigned NumUndefsLO = 0;
6590 unsigned NumUndefsHI = 0;
6591 unsigned Half = NumElts/2;
6593 // Count the number of UNDEF operands in the build_vector in input.
6594 for (unsigned i = 0, e = Half; i != e; ++i)
6595 if (BV->getOperand(i)->getOpcode() == ISD::UNDEF)
6598 for (unsigned i = Half, e = NumElts; i != e; ++i)
6599 if (BV->getOperand(i)->getOpcode() == ISD::UNDEF)
6602 // Early exit if this is either a build_vector of all UNDEFs or all the
6603 // operands but one are UNDEF.
6604 if (NumUndefsLO + NumUndefsHI + 1 >= NumElts)
6607 if ((VT == MVT::v4f32 || VT == MVT::v2f64) && Subtarget->hasSSE3()) {
6608 // Try to match an SSE3 float HADD/HSUB.
6609 if (isHorizontalBinOp(BV, ISD::FADD, DAG, 0, NumElts, InVec0, InVec1))
6610 return DAG.getNode(X86ISD::FHADD, DL, VT, InVec0, InVec1);
6612 if (isHorizontalBinOp(BV, ISD::FSUB, DAG, 0, NumElts, InVec0, InVec1))
6613 return DAG.getNode(X86ISD::FHSUB, DL, VT, InVec0, InVec1);
6614 } else if ((VT == MVT::v4i32 || VT == MVT::v8i16) && Subtarget->hasSSSE3()) {
6615 // Try to match an SSSE3 integer HADD/HSUB.
6616 if (isHorizontalBinOp(BV, ISD::ADD, DAG, 0, NumElts, InVec0, InVec1))
6617 return DAG.getNode(X86ISD::HADD, DL, VT, InVec0, InVec1);
6619 if (isHorizontalBinOp(BV, ISD::SUB, DAG, 0, NumElts, InVec0, InVec1))
6620 return DAG.getNode(X86ISD::HSUB, DL, VT, InVec0, InVec1);
6623 if (!Subtarget->hasAVX())
6626 if ((VT == MVT::v8f32 || VT == MVT::v4f64)) {
6627 // Try to match an AVX horizontal add/sub of packed single/double
6628 // precision floating point values from 256-bit vectors.
6629 SDValue InVec2, InVec3;
6630 if (isHorizontalBinOp(BV, ISD::FADD, DAG, 0, Half, InVec0, InVec1) &&
6631 isHorizontalBinOp(BV, ISD::FADD, DAG, Half, NumElts, InVec2, InVec3) &&
6632 ((InVec0.getOpcode() == ISD::UNDEF ||
6633 InVec2.getOpcode() == ISD::UNDEF) || InVec0 == InVec2) &&
6634 ((InVec1.getOpcode() == ISD::UNDEF ||
6635 InVec3.getOpcode() == ISD::UNDEF) || InVec1 == InVec3))
6636 return DAG.getNode(X86ISD::FHADD, DL, VT, InVec0, InVec1);
6638 if (isHorizontalBinOp(BV, ISD::FSUB, DAG, 0, Half, InVec0, InVec1) &&
6639 isHorizontalBinOp(BV, ISD::FSUB, DAG, Half, NumElts, InVec2, InVec3) &&
6640 ((InVec0.getOpcode() == ISD::UNDEF ||
6641 InVec2.getOpcode() == ISD::UNDEF) || InVec0 == InVec2) &&
6642 ((InVec1.getOpcode() == ISD::UNDEF ||
6643 InVec3.getOpcode() == ISD::UNDEF) || InVec1 == InVec3))
6644 return DAG.getNode(X86ISD::FHSUB, DL, VT, InVec0, InVec1);
6645 } else if (VT == MVT::v8i32 || VT == MVT::v16i16) {
6646 // Try to match an AVX2 horizontal add/sub of signed integers.
6647 SDValue InVec2, InVec3;
6649 bool CanFold = true;
6651 if (isHorizontalBinOp(BV, ISD::ADD, DAG, 0, Half, InVec0, InVec1) &&
6652 isHorizontalBinOp(BV, ISD::ADD, DAG, Half, NumElts, InVec2, InVec3) &&
6653 ((InVec0.getOpcode() == ISD::UNDEF ||
6654 InVec2.getOpcode() == ISD::UNDEF) || InVec0 == InVec2) &&
6655 ((InVec1.getOpcode() == ISD::UNDEF ||
6656 InVec3.getOpcode() == ISD::UNDEF) || InVec1 == InVec3))
6657 X86Opcode = X86ISD::HADD;
6658 else if (isHorizontalBinOp(BV, ISD::SUB, DAG, 0, Half, InVec0, InVec1) &&
6659 isHorizontalBinOp(BV, ISD::SUB, DAG, Half, NumElts, InVec2, InVec3) &&
6660 ((InVec0.getOpcode() == ISD::UNDEF ||
6661 InVec2.getOpcode() == ISD::UNDEF) || InVec0 == InVec2) &&
6662 ((InVec1.getOpcode() == ISD::UNDEF ||
6663 InVec3.getOpcode() == ISD::UNDEF) || InVec1 == InVec3))
6664 X86Opcode = X86ISD::HSUB;
6669 // Fold this build_vector into a single horizontal add/sub.
6670 // Do this only if the target has AVX2.
6671 if (Subtarget->hasAVX2())
6672 return DAG.getNode(X86Opcode, DL, VT, InVec0, InVec1);
6674 // Do not try to expand this build_vector into a pair of horizontal
6675 // add/sub if we can emit a pair of scalar add/sub.
6676 if (NumUndefsLO + 1 == Half || NumUndefsHI + 1 == Half)
6679 // Convert this build_vector into a pair of horizontal binop followed by
6681 bool isUndefLO = NumUndefsLO == Half;
6682 bool isUndefHI = NumUndefsHI == Half;
6683 return ExpandHorizontalBinOp(InVec0, InVec1, DL, DAG, X86Opcode, false,
6684 isUndefLO, isUndefHI);
6688 if ((VT == MVT::v8f32 || VT == MVT::v4f64 || VT == MVT::v8i32 ||
6689 VT == MVT::v16i16) && Subtarget->hasAVX()) {
6691 if (isHorizontalBinOp(BV, ISD::ADD, DAG, 0, NumElts, InVec0, InVec1))
6692 X86Opcode = X86ISD::HADD;
6693 else if (isHorizontalBinOp(BV, ISD::SUB, DAG, 0, NumElts, InVec0, InVec1))
6694 X86Opcode = X86ISD::HSUB;
6695 else if (isHorizontalBinOp(BV, ISD::FADD, DAG, 0, NumElts, InVec0, InVec1))
6696 X86Opcode = X86ISD::FHADD;
6697 else if (isHorizontalBinOp(BV, ISD::FSUB, DAG, 0, NumElts, InVec0, InVec1))
6698 X86Opcode = X86ISD::FHSUB;
6702 // Don't try to expand this build_vector into a pair of horizontal add/sub
6703 // if we can simply emit a pair of scalar add/sub.
6704 if (NumUndefsLO + 1 == Half || NumUndefsHI + 1 == Half)
6707 // Convert this build_vector into two horizontal add/sub followed by
6709 bool isUndefLO = NumUndefsLO == Half;
6710 bool isUndefHI = NumUndefsHI == Half;
6711 return ExpandHorizontalBinOp(InVec0, InVec1, DL, DAG, X86Opcode, true,
6712 isUndefLO, isUndefHI);
6719 X86TargetLowering::LowerBUILD_VECTOR(SDValue Op, SelectionDAG &DAG) const {
6722 MVT VT = Op.getSimpleValueType();
6723 MVT ExtVT = VT.getVectorElementType();
6724 unsigned NumElems = Op.getNumOperands();
6726 // Generate vectors for predicate vectors.
6727 if (VT.getScalarType() == MVT::i1 && Subtarget->hasAVX512())
6728 return LowerBUILD_VECTORvXi1(Op, DAG);
6730 // Vectors containing all zeros can be matched by pxor and xorps later
6731 if (ISD::isBuildVectorAllZeros(Op.getNode())) {
6732 // Canonicalize this to <4 x i32> to 1) ensure the zero vectors are CSE'd
6733 // and 2) ensure that i64 scalars are eliminated on x86-32 hosts.
6734 if (VT == MVT::v4i32 || VT == MVT::v8i32 || VT == MVT::v16i32)
6737 return getZeroVector(VT, Subtarget, DAG, dl);
6740 // Vectors containing all ones can be matched by pcmpeqd on 128-bit width
6741 // vectors or broken into v4i32 operations on 256-bit vectors. AVX2 can use
6742 // vpcmpeqd on 256-bit vectors.
6743 if (Subtarget->hasSSE2() && ISD::isBuildVectorAllOnes(Op.getNode())) {
6744 if (VT == MVT::v4i32 || (VT == MVT::v8i32 && Subtarget->hasInt256()))
6747 if (!VT.is512BitVector())
6748 return getOnesVector(VT, Subtarget->hasInt256(), DAG, dl);
6751 SDValue Broadcast = LowerVectorBroadcast(Op, Subtarget, DAG);
6752 if (Broadcast.getNode())
6755 unsigned EVTBits = ExtVT.getSizeInBits();
6757 unsigned NumZero = 0;
6758 unsigned NumNonZero = 0;
6759 unsigned NonZeros = 0;
6760 bool IsAllConstants = true;
6761 SmallSet<SDValue, 8> Values;
6762 for (unsigned i = 0; i < NumElems; ++i) {
6763 SDValue Elt = Op.getOperand(i);
6764 if (Elt.getOpcode() == ISD::UNDEF)
6767 if (Elt.getOpcode() != ISD::Constant &&
6768 Elt.getOpcode() != ISD::ConstantFP)
6769 IsAllConstants = false;
6770 if (X86::isZeroNode(Elt))
6773 NonZeros |= (1 << i);
6778 // All undef vector. Return an UNDEF. All zero vectors were handled above.
6779 if (NumNonZero == 0)
6780 return DAG.getUNDEF(VT);
6782 // Special case for single non-zero, non-undef, element.
6783 if (NumNonZero == 1) {
6784 unsigned Idx = countTrailingZeros(NonZeros);
6785 SDValue Item = Op.getOperand(Idx);
6787 // If this is an insertion of an i64 value on x86-32, and if the top bits of
6788 // the value are obviously zero, truncate the value to i32 and do the
6789 // insertion that way. Only do this if the value is non-constant or if the
6790 // value is a constant being inserted into element 0. It is cheaper to do
6791 // a constant pool load than it is to do a movd + shuffle.
6792 if (ExtVT == MVT::i64 && !Subtarget->is64Bit() &&
6793 (!IsAllConstants || Idx == 0)) {
6794 if (DAG.MaskedValueIsZero(Item, APInt::getBitsSet(64, 32, 64))) {
6796 assert(VT == MVT::v2i64 && "Expected an SSE value type!");
6797 EVT VecVT = MVT::v4i32;
6798 unsigned VecElts = 4;
6800 // Truncate the value (which may itself be a constant) to i32, and
6801 // convert it to a vector with movd (S2V+shuffle to zero extend).
6802 Item = DAG.getNode(ISD::TRUNCATE, dl, MVT::i32, Item);
6803 Item = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VecVT, Item);
6805 // If using the new shuffle lowering, just directly insert this.
6806 if (ExperimentalVectorShuffleLowering)
6808 ISD::BITCAST, dl, VT,
6809 getShuffleVectorZeroOrUndef(Item, Idx * 2, true, Subtarget, DAG));
6811 Item = getShuffleVectorZeroOrUndef(Item, 0, true, Subtarget, DAG);
6813 // Now we have our 32-bit value zero extended in the low element of
6814 // a vector. If Idx != 0, swizzle it into place.
6816 SmallVector<int, 4> Mask;
6817 Mask.push_back(Idx);
6818 for (unsigned i = 1; i != VecElts; ++i)
6820 Item = DAG.getVectorShuffle(VecVT, dl, Item, DAG.getUNDEF(VecVT),
6823 return DAG.getNode(ISD::BITCAST, dl, VT, Item);
6827 // If we have a constant or non-constant insertion into the low element of
6828 // a vector, we can do this with SCALAR_TO_VECTOR + shuffle of zero into
6829 // the rest of the elements. This will be matched as movd/movq/movss/movsd
6830 // depending on what the source datatype is.
6833 return DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VT, Item);
6835 if (ExtVT == MVT::i32 || ExtVT == MVT::f32 || ExtVT == MVT::f64 ||
6836 (ExtVT == MVT::i64 && Subtarget->is64Bit())) {
6837 if (VT.is256BitVector() || VT.is512BitVector()) {
6838 SDValue ZeroVec = getZeroVector(VT, Subtarget, DAG, dl);
6839 return DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, VT, ZeroVec,
6840 Item, DAG.getIntPtrConstant(0));
6842 assert(VT.is128BitVector() && "Expected an SSE value type!");
6843 Item = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VT, Item);
6844 // Turn it into a MOVL (i.e. movss, movsd, or movd) to a zero vector.
6845 return getShuffleVectorZeroOrUndef(Item, 0, true, Subtarget, DAG);
6848 if (ExtVT == MVT::i16 || ExtVT == MVT::i8) {
6849 Item = DAG.getNode(ISD::ZERO_EXTEND, dl, MVT::i32, Item);
6850 Item = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, MVT::v4i32, Item);
6851 if (VT.is256BitVector()) {
6852 SDValue ZeroVec = getZeroVector(MVT::v8i32, Subtarget, DAG, dl);
6853 Item = Insert128BitVector(ZeroVec, Item, 0, DAG, dl);
6855 assert(VT.is128BitVector() && "Expected an SSE value type!");
6856 Item = getShuffleVectorZeroOrUndef(Item, 0, true, Subtarget, DAG);
6858 return DAG.getNode(ISD::BITCAST, dl, VT, Item);
6862 // Is it a vector logical left shift?
6863 if (NumElems == 2 && Idx == 1 &&
6864 X86::isZeroNode(Op.getOperand(0)) &&
6865 !X86::isZeroNode(Op.getOperand(1))) {
6866 unsigned NumBits = VT.getSizeInBits();
6867 return getVShift(true, VT,
6868 DAG.getNode(ISD::SCALAR_TO_VECTOR, dl,
6869 VT, Op.getOperand(1)),
6870 NumBits/2, DAG, *this, dl);
6873 if (IsAllConstants) // Otherwise, it's better to do a constpool load.
6876 // Otherwise, if this is a vector with i32 or f32 elements, and the element
6877 // is a non-constant being inserted into an element other than the low one,
6878 // we can't use a constant pool load. Instead, use SCALAR_TO_VECTOR (aka
6879 // movd/movss) to move this into the low element, then shuffle it into
6881 if (EVTBits == 32) {
6882 Item = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VT, Item);
6884 // If using the new shuffle lowering, just directly insert this.
6885 if (ExperimentalVectorShuffleLowering)
6886 return getShuffleVectorZeroOrUndef(Item, Idx, NumZero > 0, Subtarget, DAG);
6888 // Turn it into a shuffle of zero and zero-extended scalar to vector.
6889 Item = getShuffleVectorZeroOrUndef(Item, 0, NumZero > 0, Subtarget, DAG);
6890 SmallVector<int, 8> MaskVec;
6891 for (unsigned i = 0; i != NumElems; ++i)
6892 MaskVec.push_back(i == Idx ? 0 : 1);
6893 return DAG.getVectorShuffle(VT, dl, Item, DAG.getUNDEF(VT), &MaskVec[0]);
6897 // Splat is obviously ok. Let legalizer expand it to a shuffle.
6898 if (Values.size() == 1) {
6899 if (EVTBits == 32) {
6900 // Instead of a shuffle like this:
6901 // shuffle (scalar_to_vector (load (ptr + 4))), undef, <0, 0, 0, 0>
6902 // Check if it's possible to issue this instead.
6903 // shuffle (vload ptr)), undef, <1, 1, 1, 1>
6904 unsigned Idx = countTrailingZeros(NonZeros);
6905 SDValue Item = Op.getOperand(Idx);
6906 if (Op.getNode()->isOnlyUserOf(Item.getNode()))
6907 return LowerAsSplatVectorLoad(Item, VT, dl, DAG);
6912 // A vector full of immediates; various special cases are already
6913 // handled, so this is best done with a single constant-pool load.
6917 // For AVX-length vectors, build the individual 128-bit pieces and use
6918 // shuffles to put them in place.
6919 if (VT.is256BitVector() || VT.is512BitVector()) {
6920 SmallVector<SDValue, 64> V;
6921 for (unsigned i = 0; i != NumElems; ++i)
6922 V.push_back(Op.getOperand(i));
6924 EVT HVT = EVT::getVectorVT(*DAG.getContext(), ExtVT, NumElems/2);
6926 // Build both the lower and upper subvector.
6927 SDValue Lower = DAG.getNode(ISD::BUILD_VECTOR, dl, HVT,
6928 makeArrayRef(&V[0], NumElems/2));
6929 SDValue Upper = DAG.getNode(ISD::BUILD_VECTOR, dl, HVT,
6930 makeArrayRef(&V[NumElems / 2], NumElems/2));
6932 // Recreate the wider vector with the lower and upper part.
6933 if (VT.is256BitVector())
6934 return Concat128BitVectors(Lower, Upper, VT, NumElems, DAG, dl);
6935 return Concat256BitVectors(Lower, Upper, VT, NumElems, DAG, dl);
6938 // Let legalizer expand 2-wide build_vectors.
6939 if (EVTBits == 64) {
6940 if (NumNonZero == 1) {
6941 // One half is zero or undef.
6942 unsigned Idx = countTrailingZeros(NonZeros);
6943 SDValue V2 = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VT,
6944 Op.getOperand(Idx));
6945 return getShuffleVectorZeroOrUndef(V2, Idx, true, Subtarget, DAG);
6950 // If element VT is < 32 bits, convert it to inserts into a zero vector.
6951 if (EVTBits == 8 && NumElems == 16) {
6952 SDValue V = LowerBuildVectorv16i8(Op, NonZeros,NumNonZero,NumZero, DAG,
6954 if (V.getNode()) return V;
6957 if (EVTBits == 16 && NumElems == 8) {
6958 SDValue V = LowerBuildVectorv8i16(Op, NonZeros,NumNonZero,NumZero, DAG,
6960 if (V.getNode()) return V;
6963 // If element VT is == 32 bits and has 4 elems, try to generate an INSERTPS
6964 if (EVTBits == 32 && NumElems == 4) {
6965 SDValue V = LowerBuildVectorv4x32(Op, NumElems, NonZeros, NumNonZero,
6966 NumZero, DAG, Subtarget, *this);
6971 // If element VT is == 32 bits, turn it into a number of shuffles.
6972 SmallVector<SDValue, 8> V(NumElems);
6973 if (NumElems == 4 && NumZero > 0) {
6974 for (unsigned i = 0; i < 4; ++i) {
6975 bool isZero = !(NonZeros & (1 << i));
6977 V[i] = getZeroVector(VT, Subtarget, DAG, dl);
6979 V[i] = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VT, Op.getOperand(i));
6982 for (unsigned i = 0; i < 2; ++i) {
6983 switch ((NonZeros & (0x3 << i*2)) >> (i*2)) {
6986 V[i] = V[i*2]; // Must be a zero vector.
6989 V[i] = getMOVL(DAG, dl, VT, V[i*2+1], V[i*2]);
6992 V[i] = getMOVL(DAG, dl, VT, V[i*2], V[i*2+1]);
6995 V[i] = getUnpackl(DAG, dl, VT, V[i*2], V[i*2+1]);
7000 bool Reverse1 = (NonZeros & 0x3) == 2;
7001 bool Reverse2 = ((NonZeros & (0x3 << 2)) >> 2) == 2;
7005 static_cast<int>(Reverse2 ? NumElems+1 : NumElems),
7006 static_cast<int>(Reverse2 ? NumElems : NumElems+1)
7008 return DAG.getVectorShuffle(VT, dl, V[0], V[1], &MaskVec[0]);
7011 if (Values.size() > 1 && VT.is128BitVector()) {
7012 // Check for a build vector of consecutive loads.
7013 for (unsigned i = 0; i < NumElems; ++i)
7014 V[i] = Op.getOperand(i);
7016 // Check for elements which are consecutive loads.
7017 SDValue LD = EltsFromConsecutiveLoads(VT, V, dl, DAG, false);
7021 // Check for a build vector from mostly shuffle plus few inserting.
7022 SDValue Sh = buildFromShuffleMostly(Op, DAG);
7026 // For SSE 4.1, use insertps to put the high elements into the low element.
7027 if (getSubtarget()->hasSSE41()) {
7029 if (Op.getOperand(0).getOpcode() != ISD::UNDEF)
7030 Result = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VT, Op.getOperand(0));
7032 Result = DAG.getUNDEF(VT);
7034 for (unsigned i = 1; i < NumElems; ++i) {
7035 if (Op.getOperand(i).getOpcode() == ISD::UNDEF) continue;
7036 Result = DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, VT, Result,
7037 Op.getOperand(i), DAG.getIntPtrConstant(i));
7042 // Otherwise, expand into a number of unpckl*, start by extending each of
7043 // our (non-undef) elements to the full vector width with the element in the
7044 // bottom slot of the vector (which generates no code for SSE).
7045 for (unsigned i = 0; i < NumElems; ++i) {
7046 if (Op.getOperand(i).getOpcode() != ISD::UNDEF)
7047 V[i] = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VT, Op.getOperand(i));
7049 V[i] = DAG.getUNDEF(VT);
7052 // Next, we iteratively mix elements, e.g. for v4f32:
7053 // Step 1: unpcklps 0, 2 ==> X: <?, ?, 2, 0>
7054 // : unpcklps 1, 3 ==> Y: <?, ?, 3, 1>
7055 // Step 2: unpcklps X, Y ==> <3, 2, 1, 0>
7056 unsigned EltStride = NumElems >> 1;
7057 while (EltStride != 0) {
7058 for (unsigned i = 0; i < EltStride; ++i) {
7059 // If V[i+EltStride] is undef and this is the first round of mixing,
7060 // then it is safe to just drop this shuffle: V[i] is already in the
7061 // right place, the one element (since it's the first round) being
7062 // inserted as undef can be dropped. This isn't safe for successive
7063 // rounds because they will permute elements within both vectors.
7064 if (V[i+EltStride].getOpcode() == ISD::UNDEF &&
7065 EltStride == NumElems/2)
7068 V[i] = getUnpackl(DAG, dl, VT, V[i], V[i + EltStride]);
7077 // LowerAVXCONCAT_VECTORS - 256-bit AVX can use the vinsertf128 instruction
7078 // to create 256-bit vectors from two other 128-bit ones.
7079 static SDValue LowerAVXCONCAT_VECTORS(SDValue Op, SelectionDAG &DAG) {
7081 MVT ResVT = Op.getSimpleValueType();
7083 assert((ResVT.is256BitVector() ||
7084 ResVT.is512BitVector()) && "Value type must be 256-/512-bit wide");
7086 SDValue V1 = Op.getOperand(0);
7087 SDValue V2 = Op.getOperand(1);
7088 unsigned NumElems = ResVT.getVectorNumElements();
7089 if(ResVT.is256BitVector())
7090 return Concat128BitVectors(V1, V2, ResVT, NumElems, DAG, dl);
7092 if (Op.getNumOperands() == 4) {
7093 MVT HalfVT = MVT::getVectorVT(ResVT.getScalarType(),
7094 ResVT.getVectorNumElements()/2);
7095 SDValue V3 = Op.getOperand(2);
7096 SDValue V4 = Op.getOperand(3);
7097 return Concat256BitVectors(Concat128BitVectors(V1, V2, HalfVT, NumElems/2, DAG, dl),
7098 Concat128BitVectors(V3, V4, HalfVT, NumElems/2, DAG, dl), ResVT, NumElems, DAG, dl);
7100 return Concat256BitVectors(V1, V2, ResVT, NumElems, DAG, dl);
7103 static SDValue LowerCONCAT_VECTORS(SDValue Op, SelectionDAG &DAG) {
7104 MVT LLVM_ATTRIBUTE_UNUSED VT = Op.getSimpleValueType();
7105 assert((VT.is256BitVector() && Op.getNumOperands() == 2) ||
7106 (VT.is512BitVector() && (Op.getNumOperands() == 2 ||
7107 Op.getNumOperands() == 4)));
7109 // AVX can use the vinsertf128 instruction to create 256-bit vectors
7110 // from two other 128-bit ones.
7112 // 512-bit vector may contain 2 256-bit vectors or 4 128-bit vectors
7113 return LowerAVXCONCAT_VECTORS(Op, DAG);
7117 //===----------------------------------------------------------------------===//
7118 // Vector shuffle lowering
7120 // This is an experimental code path for lowering vector shuffles on x86. It is
7121 // designed to handle arbitrary vector shuffles and blends, gracefully
7122 // degrading performance as necessary. It works hard to recognize idiomatic
7123 // shuffles and lower them to optimal instruction patterns without leaving
7124 // a framework that allows reasonably efficient handling of all vector shuffle
7126 //===----------------------------------------------------------------------===//
7128 /// \brief Tiny helper function to identify a no-op mask.
7130 /// This is a somewhat boring predicate function. It checks whether the mask
7131 /// array input, which is assumed to be a single-input shuffle mask of the kind
7132 /// used by the X86 shuffle instructions (not a fully general
7133 /// ShuffleVectorSDNode mask) requires any shuffles to occur. Both undef and an
7134 /// in-place shuffle are 'no-op's.
7135 static bool isNoopShuffleMask(ArrayRef<int> Mask) {
7136 for (int i = 0, Size = Mask.size(); i < Size; ++i)
7137 if (Mask[i] != -1 && Mask[i] != i)
7142 /// \brief Helper function to classify a mask as a single-input mask.
7144 /// This isn't a generic single-input test because in the vector shuffle
7145 /// lowering we canonicalize single inputs to be the first input operand. This
7146 /// means we can more quickly test for a single input by only checking whether
7147 /// an input from the second operand exists. We also assume that the size of
7148 /// mask corresponds to the size of the input vectors which isn't true in the
7149 /// fully general case.
7150 static bool isSingleInputShuffleMask(ArrayRef<int> Mask) {
7152 if (M >= (int)Mask.size())
7157 // Hide this symbol with an anonymous namespace instead of 'static' so that MSVC
7158 // 2013 will allow us to use it as a non-type template parameter.
7161 /// \brief Implementation of the \c isShuffleEquivalent variadic functor.
7163 /// See its documentation for details.
7164 bool isShuffleEquivalentImpl(ArrayRef<int> Mask, ArrayRef<const int *> Args) {
7165 if (Mask.size() != Args.size())
7167 for (int i = 0, e = Mask.size(); i < e; ++i) {
7168 assert(*Args[i] >= 0 && "Arguments must be positive integers!");
7169 assert(*Args[i] < (int)Args.size() * 2 &&
7170 "Argument outside the range of possible shuffle inputs!");
7171 if (Mask[i] != -1 && Mask[i] != *Args[i])
7179 /// \brief Checks whether a shuffle mask is equivalent to an explicit list of
7182 /// This is a fast way to test a shuffle mask against a fixed pattern:
7184 /// if (isShuffleEquivalent(Mask, 3, 2, 1, 0)) { ... }
7186 /// It returns true if the mask is exactly as wide as the argument list, and
7187 /// each element of the mask is either -1 (signifying undef) or the value given
7188 /// in the argument.
7189 static const VariadicFunction1<
7190 bool, ArrayRef<int>, int, isShuffleEquivalentImpl> isShuffleEquivalent = {};
7192 /// \brief Get a 4-lane 8-bit shuffle immediate for a mask.
7194 /// This helper function produces an 8-bit shuffle immediate corresponding to
7195 /// the ubiquitous shuffle encoding scheme used in x86 instructions for
7196 /// shuffling 4 lanes. It can be used with most of the PSHUF instructions for
7199 /// NB: We rely heavily on "undef" masks preserving the input lane.
7200 static SDValue getV4X86ShuffleImm8ForMask(ArrayRef<int> Mask,
7201 SelectionDAG &DAG) {
7202 assert(Mask.size() == 4 && "Only 4-lane shuffle masks");
7203 assert(Mask[0] >= -1 && Mask[0] < 4 && "Out of bound mask element!");
7204 assert(Mask[1] >= -1 && Mask[1] < 4 && "Out of bound mask element!");
7205 assert(Mask[2] >= -1 && Mask[2] < 4 && "Out of bound mask element!");
7206 assert(Mask[3] >= -1 && Mask[3] < 4 && "Out of bound mask element!");
7209 Imm |= (Mask[0] == -1 ? 0 : Mask[0]) << 0;
7210 Imm |= (Mask[1] == -1 ? 1 : Mask[1]) << 2;
7211 Imm |= (Mask[2] == -1 ? 2 : Mask[2]) << 4;
7212 Imm |= (Mask[3] == -1 ? 3 : Mask[3]) << 6;
7213 return DAG.getConstant(Imm, MVT::i8);
7216 /// \brief Try to emit a blend instruction for a shuffle.
7218 /// This doesn't do any checks for the availability of instructions for blending
7219 /// these values. It relies on the availability of the X86ISD::BLENDI pattern to
7220 /// be matched in the backend with the type given. What it does check for is
7221 /// that the shuffle mask is in fact a blend.
7222 static SDValue lowerVectorShuffleAsBlend(SDLoc DL, MVT VT, SDValue V1,
7223 SDValue V2, ArrayRef<int> Mask,
7224 SelectionDAG &DAG) {
7226 unsigned BlendMask = 0;
7227 for (int i = 0, Size = Mask.size(); i < Size; ++i) {
7228 if (Mask[i] >= Size) {
7229 if (Mask[i] != i + Size)
7230 return SDValue(); // Shuffled V2 input!
7231 BlendMask |= 1u << i;
7234 if (Mask[i] >= 0 && Mask[i] != i)
7235 return SDValue(); // Shuffled V1 input!
7237 if (VT == MVT::v4f32 || VT == MVT::v2f64)
7238 return DAG.getNode(X86ISD::BLENDI, DL, VT, V1, V2,
7239 DAG.getConstant(BlendMask, MVT::i8));
7240 assert(!VT.isFloatingPoint() && "Only v4f32 and v2f64 are supported!");
7242 // For integer shuffles we need to expand the mask and cast the inputs to
7243 // v8i16s prior to blending.
7244 assert((VT == MVT::v8i16 || VT == MVT::v4i32 || VT == MVT::v2i64) &&
7245 "Not a supported integer vector type!");
7246 int Scale = 8 / VT.getVectorNumElements();
7248 for (int i = 0, Size = Mask.size(); i < Size; ++i)
7249 if (Mask[i] >= Size)
7250 for (int j = 0; j < Scale; ++j)
7251 BlendMask |= 1u << (i * Scale + j);
7253 V1 = DAG.getNode(ISD::BITCAST, DL, MVT::v8i16, V1);
7254 V2 = DAG.getNode(ISD::BITCAST, DL, MVT::v8i16, V2);
7255 return DAG.getNode(ISD::BITCAST, DL, VT,
7256 DAG.getNode(X86ISD::BLENDI, DL, MVT::v8i16, V1, V2,
7257 DAG.getConstant(BlendMask, MVT::i8)));
7260 /// \brief Try to lower a vector shuffle as a byte rotation.
7262 /// We have a generic PALIGNR instruction in x86 that will do an arbitrary
7263 /// byte-rotation of a the concatentation of two vectors. This routine will
7264 /// try to generically lower a vector shuffle through such an instruction. It
7265 /// does not check for the availability of PALIGNR-based lowerings, only the
7266 /// applicability of this strategy to the given mask. This matches shuffle
7267 /// vectors that look like:
7269 /// v8i16 [11, 12, 13, 14, 15, 0, 1, 2]
7271 /// Essentially it concatenates V1 and V2, shifts right by some number of
7272 /// elements, and takes the low elements as the result. Note that while this is
7273 /// specified as a *right shift* because x86 is little-endian, it is a *left
7274 /// rotate* of the vector lanes.
7276 /// Note that this only handles 128-bit vector widths currently.
7277 static SDValue lowerVectorShuffleAsByteRotate(SDLoc DL, MVT VT, SDValue V1,
7280 SelectionDAG &DAG) {
7281 assert(!isNoopShuffleMask(Mask) && "We shouldn't lower no-op shuffles!");
7283 // We need to detect various ways of spelling a rotation:
7284 // [11, 12, 13, 14, 15, 0, 1, 2]
7285 // [-1, 12, 13, 14, -1, -1, 1, -1]
7286 // [-1, -1, -1, -1, -1, -1, 1, 2]
7287 // [ 3, 4, 5, 6, 7, 8, 9, 10]
7288 // [-1, 4, 5, 6, -1, -1, 9, -1]
7289 // [-1, 4, 5, 6, -1, -1, -1, -1]
7292 for (int i = 0, Size = Mask.size(); i < Size; ++i) {
7295 assert(Mask[i] >= 0 && "Only -1 is a valid negative mask element!");
7297 // Based on the mod-Size value of this mask element determine where
7298 // a rotated vector would have started.
7299 int StartIdx = i - (Mask[i] % Size);
7301 // The identity rotation isn't interesting, stop.
7304 // If we found the tail of a vector the rotation must be the missing
7305 // front. If we found the head of a vector, it must be how much of the head.
7306 int CandidateRotation = StartIdx < 0 ? -StartIdx : Size - StartIdx;
7309 Rotation = CandidateRotation;
7310 else if (Rotation != CandidateRotation)
7311 // The rotations don't match, so we can't match this mask.
7314 // Compute which value this mask is pointing at.
7315 SDValue MaskV = Mask[i] < Size ? V1 : V2;
7317 // Compute which of the two target values this index should be assigned to.
7318 // This reflects whether the high elements are remaining or the low elements
7320 SDValue &TargetV = StartIdx < 0 ? Hi : Lo;
7322 // Either set up this value if we've not encountered it before, or check
7323 // that it remains consistent.
7326 else if (TargetV != MaskV)
7327 // This may be a rotation, but it pulls from the inputs in some
7328 // unsupported interleaving.
7332 // Check that we successfully analyzed the mask, and normalize the results.
7333 assert(Rotation != 0 && "Failed to locate a viable rotation!");
7334 assert((Lo || Hi) && "Failed to find a rotated input vector!");
7340 // Cast the inputs to v16i8 to match PALIGNR.
7341 Lo = DAG.getNode(ISD::BITCAST, DL, MVT::v16i8, Lo);
7342 Hi = DAG.getNode(ISD::BITCAST, DL, MVT::v16i8, Hi);
7344 assert(VT.getSizeInBits() == 128 &&
7345 "Rotate-based lowering only supports 128-bit lowering!");
7346 assert(Mask.size() <= 16 &&
7347 "Can shuffle at most 16 bytes in a 128-bit vector!");
7348 // The actual rotate instruction rotates bytes, so we need to scale the
7349 // rotation based on how many bytes are in the vector.
7350 int Scale = 16 / Mask.size();
7352 return DAG.getNode(ISD::BITCAST, DL, VT,
7353 DAG.getNode(X86ISD::PALIGNR, DL, MVT::v16i8, Hi, Lo,
7354 DAG.getConstant(Rotation * Scale, MVT::i8)));
7357 /// \brief Compute whether each element of a shuffle is zeroable.
7359 /// A "zeroable" vector shuffle element is one which can be lowered to zero.
7360 /// Either it is an undef element in the shuffle mask, the element of the input
7361 /// referenced is undef, or the element of the input referenced is known to be
7362 /// zero. Many x86 shuffles can zero lanes cheaply and we often want to handle
7363 /// as many lanes with this technique as possible to simplify the remaining
7365 static SmallBitVector computeZeroableShuffleElements(ArrayRef<int> Mask,
7366 SDValue V1, SDValue V2) {
7367 SmallBitVector Zeroable(Mask.size(), false);
7369 bool V1IsZero = ISD::isBuildVectorAllZeros(V1.getNode());
7370 bool V2IsZero = ISD::isBuildVectorAllZeros(V2.getNode());
7372 for (int i = 0, Size = Mask.size(); i < Size; ++i) {
7374 // Handle the easy cases.
7375 if (M < 0 || (M >= 0 && M < Size && V1IsZero) || (M >= Size && V2IsZero)) {
7380 // If this is an index into a build_vector node, dig out the input value and
7382 SDValue V = M < Size ? V1 : V2;
7383 if (V.getOpcode() != ISD::BUILD_VECTOR)
7386 SDValue Input = V.getOperand(M % Size);
7387 // The UNDEF opcode check really should be dead code here, but not quite
7388 // worth asserting on (it isn't invalid, just unexpected).
7389 if (Input.getOpcode() == ISD::UNDEF || X86::isZeroNode(Input))
7396 /// \brief Lower a vector shuffle as a zero or any extension.
7398 /// Given a specific number of elements, element bit width, and extension
7399 /// stride, produce either a zero or any extension based on the available
7400 /// features of the subtarget.
7401 static SDValue lowerVectorShuffleAsSpecificZeroOrAnyExtend(
7402 SDLoc DL, MVT VT, int NumElements, int Scale, bool AnyExt, SDValue InputV,
7403 const X86Subtarget *Subtarget, SelectionDAG &DAG) {
7404 assert(Scale > 1 && "Need a scale to extend.");
7405 int EltBits = VT.getSizeInBits() / NumElements;
7406 assert((EltBits == 8 || EltBits == 16 || EltBits == 32) &&
7407 "Only 8, 16, and 32 bit elements can be extended.");
7408 assert(Scale * EltBits <= 64 && "Cannot zero extend past 64 bits.");
7410 // Found a valid zext mask! Try various lowering strategies based on the
7411 // input type and available ISA extensions.
7412 if (Subtarget->hasSSE41()) {
7413 MVT InputVT = MVT::getVectorVT(MVT::getIntegerVT(EltBits), NumElements);
7414 MVT ExtVT = MVT::getVectorVT(MVT::getIntegerVT(EltBits * Scale),
7415 NumElements / Scale);
7416 InputV = DAG.getNode(ISD::BITCAST, DL, InputVT, InputV);
7417 return DAG.getNode(ISD::BITCAST, DL, VT,
7418 DAG.getNode(X86ISD::VZEXT, DL, ExtVT, InputV));
7421 // For any extends we can cheat for larger element sizes and use shuffle
7422 // instructions that can fold with a load and/or copy.
7423 if (AnyExt && EltBits == 32) {
7424 int PSHUFDMask[4] = {0, -1, 1, -1};
7426 ISD::BITCAST, DL, VT,
7427 DAG.getNode(X86ISD::PSHUFD, DL, MVT::v4i32,
7428 DAG.getNode(ISD::BITCAST, DL, MVT::v4i32, InputV),
7429 getV4X86ShuffleImm8ForMask(PSHUFDMask, DAG)));
7431 if (AnyExt && EltBits == 16 && Scale > 2) {
7432 int PSHUFDMask[4] = {0, -1, 0, -1};
7433 InputV = DAG.getNode(X86ISD::PSHUFD, DL, MVT::v4i32,
7434 DAG.getNode(ISD::BITCAST, DL, MVT::v4i32, InputV),
7435 getV4X86ShuffleImm8ForMask(PSHUFDMask, DAG));
7436 int PSHUFHWMask[4] = {1, -1, -1, -1};
7438 ISD::BITCAST, DL, VT,
7439 DAG.getNode(X86ISD::PSHUFHW, DL, MVT::v8i16,
7440 DAG.getNode(ISD::BITCAST, DL, MVT::v8i16, InputV),
7441 getV4X86ShuffleImm8ForMask(PSHUFHWMask, DAG)));
7444 // If this would require more than 2 unpack instructions to expand, use
7445 // pshufb when available. We can only use more than 2 unpack instructions
7446 // when zero extending i8 elements which also makes it easier to use pshufb.
7447 if (Scale > 4 && EltBits == 8 && Subtarget->hasSSSE3()) {
7448 assert(NumElements == 16 && "Unexpected byte vector width!");
7449 SDValue PSHUFBMask[16];
7450 for (int i = 0; i < 16; ++i)
7452 DAG.getConstant((i % Scale == 0) ? i / Scale : 0x80, MVT::i8);
7453 InputV = DAG.getNode(ISD::BITCAST, DL, MVT::v16i8, InputV);
7454 return DAG.getNode(ISD::BITCAST, DL, VT,
7455 DAG.getNode(X86ISD::PSHUFB, DL, MVT::v16i8, InputV,
7456 DAG.getNode(ISD::BUILD_VECTOR, DL,
7457 MVT::v16i8, PSHUFBMask)));
7460 // Otherwise emit a sequence of unpacks.
7462 MVT InputVT = MVT::getVectorVT(MVT::getIntegerVT(EltBits), NumElements);
7463 SDValue Ext = AnyExt ? DAG.getUNDEF(InputVT)
7464 : getZeroVector(InputVT, Subtarget, DAG, DL);
7465 InputV = DAG.getNode(ISD::BITCAST, DL, InputVT, InputV);
7466 InputV = DAG.getNode(X86ISD::UNPCKL, DL, InputVT, InputV, Ext);
7470 } while (Scale > 1);
7471 return DAG.getNode(ISD::BITCAST, DL, VT, InputV);
7474 /// \brief Try to lower a vector shuffle as a zero extension on any micrarch.
7476 /// This routine will try to do everything in its power to cleverly lower
7477 /// a shuffle which happens to match the pattern of a zero extend. It doesn't
7478 /// check for the profitability of this lowering, it tries to aggressively
7479 /// match this pattern. It will use all of the micro-architectural details it
7480 /// can to emit an efficient lowering. It handles both blends with all-zero
7481 /// inputs to explicitly zero-extend and undef-lanes (sometimes undef due to
7482 /// masking out later).
7484 /// The reason we have dedicated lowering for zext-style shuffles is that they
7485 /// are both incredibly common and often quite performance sensitive.
7486 static SDValue lowerVectorShuffleAsZeroOrAnyExtend(
7487 SDLoc DL, MVT VT, SDValue V1, SDValue V2, ArrayRef<int> Mask,
7488 const X86Subtarget *Subtarget, SelectionDAG &DAG) {
7489 SmallBitVector Zeroable = computeZeroableShuffleElements(Mask, V1, V2);
7491 int Bits = VT.getSizeInBits();
7492 int NumElements = Mask.size();
7494 // Define a helper function to check a particular ext-scale and lower to it if
7496 auto Lower = [&](int Scale) -> SDValue {
7499 for (int i = 0; i < NumElements; ++i) {
7501 continue; // Valid anywhere but doesn't tell us anything.
7502 if (i % Scale != 0) {
7503 // Each of the extend elements needs to be zeroable.
7507 // We no lorger are in the anyext case.
7512 // Each of the base elements needs to be consecutive indices into the
7513 // same input vector.
7514 SDValue V = Mask[i] < NumElements ? V1 : V2;
7517 else if (InputV != V)
7518 return SDValue(); // Flip-flopping inputs.
7520 if (Mask[i] % NumElements != i / Scale)
7521 return SDValue(); // Non-consecutive strided elemenst.
7524 // If we fail to find an input, we have a zero-shuffle which should always
7525 // have already been handled.
7526 // FIXME: Maybe handle this here in case during blending we end up with one?
7530 return lowerVectorShuffleAsSpecificZeroOrAnyExtend(
7531 DL, VT, NumElements, Scale, AnyExt, InputV, Subtarget, DAG);
7534 // The widest scale possible for extending is to a 64-bit integer.
7535 assert(Bits % 64 == 0 &&
7536 "The number of bits in a vector must be divisible by 64 on x86!");
7537 int NumExtElements = Bits / 64;
7539 // Each iteration, try extending the elements half as much, but into twice as
7541 for (; NumExtElements < NumElements; NumExtElements *= 2) {
7542 assert(NumElements % NumExtElements == 0 &&
7543 "The input vector size must be divisble by the extended size.");
7544 if (SDValue V = Lower(NumElements / NumExtElements))
7548 // No viable ext lowering found.
7552 /// \brief Try to lower insertion of a single element into a zero vector.
7554 /// This is a common pattern that we have especially efficient patterns to lower
7555 /// across all subtarget feature sets.
7556 static SDValue lowerVectorShuffleAsElementInsertion(
7557 MVT VT, SDLoc DL, SDValue V1, SDValue V2, ArrayRef<int> Mask,
7558 const X86Subtarget *Subtarget, SelectionDAG &DAG) {
7559 SmallBitVector Zeroable = computeZeroableShuffleElements(Mask, V1, V2);
7561 int V2Index = std::find_if(Mask.begin(), Mask.end(),
7562 [&Mask](int M) { return M >= (int)Mask.size(); }) -
7564 if (Mask.size() == 2) {
7565 if (!Zeroable[V2Index ^ 1]) {
7566 // For 2-wide masks we may be able to just invert the inputs. We use an xor
7567 // with 2 to flip from {2,3} to {0,1} and vice versa.
7568 int InverseMask[2] = {Mask[0] < 0 ? -1 : (Mask[0] ^ 2),
7569 Mask[1] < 0 ? -1 : (Mask[1] ^ 2)};
7570 if (Zeroable[V2Index])
7571 return lowerVectorShuffleAsElementInsertion(VT, DL, V2, V1, InverseMask,
7577 for (int i = 0, Size = Mask.size(); i < Size; ++i)
7578 if (i != V2Index && !Zeroable[i])
7579 return SDValue(); // Not inserting into a zero vector.
7582 // Step over any bitcasts on either input so we can scan the actual
7583 // BUILD_VECTOR nodes.
7584 while (V1.getOpcode() == ISD::BITCAST)
7585 V1 = V1.getOperand(0);
7586 while (V2.getOpcode() == ISD::BITCAST)
7587 V2 = V2.getOperand(0);
7589 // Check for a single input from a SCALAR_TO_VECTOR node.
7590 // FIXME: All of this should be canonicalized into INSERT_VECTOR_ELT and
7591 // all the smarts here sunk into that routine. However, the current
7592 // lowering of BUILD_VECTOR makes that nearly impossible until the old
7593 // vector shuffle lowering is dead.
7594 if (!((V2.getOpcode() == ISD::SCALAR_TO_VECTOR &&
7595 Mask[V2Index] == (int)Mask.size()) ||
7596 V2.getOpcode() == ISD::BUILD_VECTOR))
7599 SDValue V2S = V2.getOperand(Mask[V2Index] - Mask.size());
7601 // First, we need to zext the scalar if it is smaller than an i32.
7603 MVT EltVT = VT.getVectorElementType();
7604 V2S = DAG.getNode(ISD::BITCAST, DL, EltVT, V2S);
7605 if (EltVT == MVT::i8 || EltVT == MVT::i16) {
7606 // Zero-extend directly to i32.
7608 V2S = DAG.getNode(ISD::ZERO_EXTEND, DL, MVT::i32, V2S);
7611 V2 = DAG.getNode(X86ISD::VZEXT_MOVL, DL, ExtVT,
7612 DAG.getNode(ISD::SCALAR_TO_VECTOR, DL, ExtVT, V2S));
7614 V2 = DAG.getNode(ISD::BITCAST, DL, VT, V2);
7617 // If we have 4 or fewer lanes we can cheaply shuffle the element into
7618 // the desired position. Otherwise it is more efficient to do a vector
7619 // shift left. We know that we can do a vector shift left because all
7620 // the inputs are zero.
7621 if (VT.isFloatingPoint() || VT.getVectorNumElements() <= 4) {
7622 SmallVector<int, 4> V2Shuffle(Mask.size(), 1);
7623 V2Shuffle[V2Index] = 0;
7624 V2 = DAG.getVectorShuffle(VT, DL, V2, DAG.getUNDEF(VT), V2Shuffle);
7626 V2 = DAG.getNode(ISD::BITCAST, DL, MVT::v2i64, V2);
7628 X86ISD::VSHLDQ, DL, MVT::v2i64, V2,
7630 V2Index * EltVT.getSizeInBits(),
7631 DAG.getTargetLoweringInfo().getScalarShiftAmountTy(MVT::v2i64)));
7632 V2 = DAG.getNode(ISD::BITCAST, DL, VT, V2);
7638 /// \brief Handle lowering of 2-lane 64-bit floating point shuffles.
7640 /// This is the basis function for the 2-lane 64-bit shuffles as we have full
7641 /// support for floating point shuffles but not integer shuffles. These
7642 /// instructions will incur a domain crossing penalty on some chips though so
7643 /// it is better to avoid lowering through this for integer vectors where
7645 static SDValue lowerV2F64VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
7646 const X86Subtarget *Subtarget,
7647 SelectionDAG &DAG) {
7649 assert(Op.getSimpleValueType() == MVT::v2f64 && "Bad shuffle type!");
7650 assert(V1.getSimpleValueType() == MVT::v2f64 && "Bad operand type!");
7651 assert(V2.getSimpleValueType() == MVT::v2f64 && "Bad operand type!");
7652 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
7653 ArrayRef<int> Mask = SVOp->getMask();
7654 assert(Mask.size() == 2 && "Unexpected mask size for v2 shuffle!");
7656 if (isSingleInputShuffleMask(Mask)) {
7657 // Straight shuffle of a single input vector. Simulate this by using the
7658 // single input as both of the "inputs" to this instruction..
7659 unsigned SHUFPDMask = (Mask[0] == 1) | ((Mask[1] == 1) << 1);
7660 return DAG.getNode(X86ISD::SHUFP, SDLoc(Op), MVT::v2f64, V1, V1,
7661 DAG.getConstant(SHUFPDMask, MVT::i8));
7663 assert(Mask[0] >= 0 && Mask[0] < 2 && "Non-canonicalized blend!");
7664 assert(Mask[1] >= 2 && "Non-canonicalized blend!");
7666 // Use dedicated unpack instructions for masks that match their pattern.
7667 if (isShuffleEquivalent(Mask, 0, 2))
7668 return DAG.getNode(X86ISD::UNPCKL, DL, MVT::v2f64, V1, V2);
7669 if (isShuffleEquivalent(Mask, 1, 3))
7670 return DAG.getNode(X86ISD::UNPCKH, DL, MVT::v2f64, V1, V2);
7672 // If we have a single input, insert that into V1 if we can do so cheaply.
7673 if ((Mask[0] >= 2) + (Mask[1] >= 2) == 1)
7674 if (SDValue Insertion = lowerVectorShuffleAsElementInsertion(
7675 MVT::v2f64, DL, V1, V2, Mask, Subtarget, DAG))
7678 if (Subtarget->hasSSE41())
7680 lowerVectorShuffleAsBlend(DL, MVT::v2f64, V1, V2, Mask, DAG))
7683 unsigned SHUFPDMask = (Mask[0] == 1) | (((Mask[1] - 2) == 1) << 1);
7684 return DAG.getNode(X86ISD::SHUFP, SDLoc(Op), MVT::v2f64, V1, V2,
7685 DAG.getConstant(SHUFPDMask, MVT::i8));
7688 /// \brief Handle lowering of 2-lane 64-bit integer shuffles.
7690 /// Tries to lower a 2-lane 64-bit shuffle using shuffle operations provided by
7691 /// the integer unit to minimize domain crossing penalties. However, for blends
7692 /// it falls back to the floating point shuffle operation with appropriate bit
7694 static SDValue lowerV2I64VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
7695 const X86Subtarget *Subtarget,
7696 SelectionDAG &DAG) {
7698 assert(Op.getSimpleValueType() == MVT::v2i64 && "Bad shuffle type!");
7699 assert(V1.getSimpleValueType() == MVT::v2i64 && "Bad operand type!");
7700 assert(V2.getSimpleValueType() == MVT::v2i64 && "Bad operand type!");
7701 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
7702 ArrayRef<int> Mask = SVOp->getMask();
7703 assert(Mask.size() == 2 && "Unexpected mask size for v2 shuffle!");
7705 if (isSingleInputShuffleMask(Mask)) {
7706 // Straight shuffle of a single input vector. For everything from SSE2
7707 // onward this has a single fast instruction with no scary immediates.
7708 // We have to map the mask as it is actually a v4i32 shuffle instruction.
7709 V1 = DAG.getNode(ISD::BITCAST, DL, MVT::v4i32, V1);
7710 int WidenedMask[4] = {
7711 std::max(Mask[0], 0) * 2, std::max(Mask[0], 0) * 2 + 1,
7712 std::max(Mask[1], 0) * 2, std::max(Mask[1], 0) * 2 + 1};
7714 ISD::BITCAST, DL, MVT::v2i64,
7715 DAG.getNode(X86ISD::PSHUFD, SDLoc(Op), MVT::v4i32, V1,
7716 getV4X86ShuffleImm8ForMask(WidenedMask, DAG)));
7719 // Use dedicated unpack instructions for masks that match their pattern.
7720 if (isShuffleEquivalent(Mask, 0, 2))
7721 return DAG.getNode(X86ISD::UNPCKL, DL, MVT::v2i64, V1, V2);
7722 if (isShuffleEquivalent(Mask, 1, 3))
7723 return DAG.getNode(X86ISD::UNPCKH, DL, MVT::v2i64, V1, V2);
7725 // If we have a single input from V2 insert that into V1 if we can do so
7727 if ((Mask[0] >= 2) + (Mask[1] >= 2) == 1)
7728 if (SDValue Insertion = lowerVectorShuffleAsElementInsertion(
7729 MVT::v2i64, DL, V1, V2, Mask, Subtarget, DAG))
7732 if (Subtarget->hasSSE41())
7734 lowerVectorShuffleAsBlend(DL, MVT::v2i64, V1, V2, Mask, DAG))
7737 // Try to use rotation instructions if available.
7738 if (Subtarget->hasSSSE3())
7739 if (SDValue Rotate = lowerVectorShuffleAsByteRotate(
7740 DL, MVT::v2i64, V1, V2, Mask, DAG))
7743 // We implement this with SHUFPD which is pretty lame because it will likely
7744 // incur 2 cycles of stall for integer vectors on Nehalem and older chips.
7745 // However, all the alternatives are still more cycles and newer chips don't
7746 // have this problem. It would be really nice if x86 had better shuffles here.
7747 V1 = DAG.getNode(ISD::BITCAST, DL, MVT::v2f64, V1);
7748 V2 = DAG.getNode(ISD::BITCAST, DL, MVT::v2f64, V2);
7749 return DAG.getNode(ISD::BITCAST, DL, MVT::v2i64,
7750 DAG.getVectorShuffle(MVT::v2f64, DL, V1, V2, Mask));
7753 /// \brief Lower 4-lane 32-bit floating point shuffles.
7755 /// Uses instructions exclusively from the floating point unit to minimize
7756 /// domain crossing penalties, as these are sufficient to implement all v4f32
7758 static SDValue lowerV4F32VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
7759 const X86Subtarget *Subtarget,
7760 SelectionDAG &DAG) {
7762 assert(Op.getSimpleValueType() == MVT::v4f32 && "Bad shuffle type!");
7763 assert(V1.getSimpleValueType() == MVT::v4f32 && "Bad operand type!");
7764 assert(V2.getSimpleValueType() == MVT::v4f32 && "Bad operand type!");
7765 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
7766 ArrayRef<int> Mask = SVOp->getMask();
7767 assert(Mask.size() == 4 && "Unexpected mask size for v4 shuffle!");
7769 SDValue LowV = V1, HighV = V2;
7770 int NewMask[4] = {Mask[0], Mask[1], Mask[2], Mask[3]};
7773 std::count_if(Mask.begin(), Mask.end(), [](int M) { return M >= 4; });
7775 if (NumV2Elements == 0)
7776 // Straight shuffle of a single input vector. We pass the input vector to
7777 // both operands to simulate this with a SHUFPS.
7778 return DAG.getNode(X86ISD::SHUFP, DL, MVT::v4f32, V1, V1,
7779 getV4X86ShuffleImm8ForMask(Mask, DAG));
7781 // Use dedicated unpack instructions for masks that match their pattern.
7782 if (isShuffleEquivalent(Mask, 0, 4, 1, 5))
7783 return DAG.getNode(X86ISD::UNPCKL, DL, MVT::v4f32, V1, V2);
7784 if (isShuffleEquivalent(Mask, 2, 6, 3, 7))
7785 return DAG.getNode(X86ISD::UNPCKH, DL, MVT::v4f32, V1, V2);
7787 // There are special ways we can lower some single-element blends. However, we
7788 // have custom ways we can lower more complex single-element blends below that
7789 // we defer to if both this and BLENDPS fail to match, so restrict this to
7790 // when the V2 input is targeting element 0 of the mask -- that is the fast
7792 if (NumV2Elements == 1 && Mask[0] >= 4)
7793 if (SDValue V = lowerVectorShuffleAsElementInsertion(MVT::v4f32, DL, V1, V2,
7794 Mask, Subtarget, DAG))
7797 if (Subtarget->hasSSE41())
7799 lowerVectorShuffleAsBlend(DL, MVT::v4f32, V1, V2, Mask, DAG))
7802 if (NumV2Elements == 1) {
7804 std::find_if(Mask.begin(), Mask.end(), [](int M) { return M >= 4; }) -
7807 // Check for whether we can use INSERTPS to perform the blend. We only use
7808 // INSERTPS when the V1 elements are already in the correct locations
7809 // because otherwise we can just always use two SHUFPS instructions which
7810 // are much smaller to encode than a SHUFPS and an INSERTPS.
7811 if (Subtarget->hasSSE41()) {
7812 // When using INSERTPS we can zero any lane of the destination. Collect
7813 // the zero inputs into a mask and drop them from the lanes of V1 which
7814 // actually need to be present as inputs to the INSERTPS.
7815 SmallBitVector Zeroable = computeZeroableShuffleElements(Mask, V1, V2);
7817 // Synthesize a shuffle mask for the non-zero and non-v2 inputs.
7818 bool InsertNeedsShuffle = false;
7820 for (int i = 0; i < 4; ++i)
7824 } else if (Mask[i] != i) {
7825 InsertNeedsShuffle = true;
7830 // We don't want to use INSERTPS or other insertion techniques if it will
7831 // require shuffling anyways.
7832 if (!InsertNeedsShuffle) {
7833 // If all of V1 is zeroable, replace it with undef.
7834 if ((ZMask | 1 << V2Index) == 0xF)
7835 V1 = DAG.getUNDEF(MVT::v4f32);
7837 unsigned InsertPSMask = (Mask[V2Index] - 4) << 6 | V2Index << 4 | ZMask;
7838 assert((InsertPSMask & ~0xFFu) == 0 && "Invalid mask!");
7840 // Insert the V2 element into the desired position.
7841 return DAG.getNode(X86ISD::INSERTPS, DL, MVT::v4f32, V1, V2,
7842 DAG.getConstant(InsertPSMask, MVT::i8));
7846 // Compute the index adjacent to V2Index and in the same half by toggling
7848 int V2AdjIndex = V2Index ^ 1;
7850 if (Mask[V2AdjIndex] == -1) {
7851 // Handles all the cases where we have a single V2 element and an undef.
7852 // This will only ever happen in the high lanes because we commute the
7853 // vector otherwise.
7855 std::swap(LowV, HighV);
7856 NewMask[V2Index] -= 4;
7858 // Handle the case where the V2 element ends up adjacent to a V1 element.
7859 // To make this work, blend them together as the first step.
7860 int V1Index = V2AdjIndex;
7861 int BlendMask[4] = {Mask[V2Index] - 4, 0, Mask[V1Index], 0};
7862 V2 = DAG.getNode(X86ISD::SHUFP, DL, MVT::v4f32, V2, V1,
7863 getV4X86ShuffleImm8ForMask(BlendMask, DAG));
7865 // Now proceed to reconstruct the final blend as we have the necessary
7866 // high or low half formed.
7873 NewMask[V1Index] = 2; // We put the V1 element in V2[2].
7874 NewMask[V2Index] = 0; // We shifted the V2 element into V2[0].
7876 } else if (NumV2Elements == 2) {
7877 if (Mask[0] < 4 && Mask[1] < 4) {
7878 // Handle the easy case where we have V1 in the low lanes and V2 in the
7879 // high lanes. We never see this reversed because we sort the shuffle.
7883 // We have a mixture of V1 and V2 in both low and high lanes. Rather than
7884 // trying to place elements directly, just blend them and set up the final
7885 // shuffle to place them.
7887 // The first two blend mask elements are for V1, the second two are for
7889 int BlendMask[4] = {Mask[0] < 4 ? Mask[0] : Mask[1],
7890 Mask[2] < 4 ? Mask[2] : Mask[3],
7891 (Mask[0] >= 4 ? Mask[0] : Mask[1]) - 4,
7892 (Mask[2] >= 4 ? Mask[2] : Mask[3]) - 4};
7893 V1 = DAG.getNode(X86ISD::SHUFP, DL, MVT::v4f32, V1, V2,
7894 getV4X86ShuffleImm8ForMask(BlendMask, DAG));
7896 // Now we do a normal shuffle of V1 by giving V1 as both operands to
7899 NewMask[0] = Mask[0] < 4 ? 0 : 2;
7900 NewMask[1] = Mask[0] < 4 ? 2 : 0;
7901 NewMask[2] = Mask[2] < 4 ? 1 : 3;
7902 NewMask[3] = Mask[2] < 4 ? 3 : 1;
7905 return DAG.getNode(X86ISD::SHUFP, DL, MVT::v4f32, LowV, HighV,
7906 getV4X86ShuffleImm8ForMask(NewMask, DAG));
7909 /// \brief Lower 4-lane i32 vector shuffles.
7911 /// We try to handle these with integer-domain shuffles where we can, but for
7912 /// blends we use the floating point domain blend instructions.
7913 static SDValue lowerV4I32VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
7914 const X86Subtarget *Subtarget,
7915 SelectionDAG &DAG) {
7917 assert(Op.getSimpleValueType() == MVT::v4i32 && "Bad shuffle type!");
7918 assert(V1.getSimpleValueType() == MVT::v4i32 && "Bad operand type!");
7919 assert(V2.getSimpleValueType() == MVT::v4i32 && "Bad operand type!");
7920 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
7921 ArrayRef<int> Mask = SVOp->getMask();
7922 assert(Mask.size() == 4 && "Unexpected mask size for v4 shuffle!");
7925 std::count_if(Mask.begin(), Mask.end(), [](int M) { return M >= 4; });
7927 if (NumV2Elements == 0) {
7928 // Straight shuffle of a single input vector. For everything from SSE2
7929 // onward this has a single fast instruction with no scary immediates.
7930 // We coerce the shuffle pattern to be compatible with UNPCK instructions
7931 // but we aren't actually going to use the UNPCK instruction because doing
7932 // so prevents folding a load into this instruction or making a copy.
7933 const int UnpackLoMask[] = {0, 0, 1, 1};
7934 const int UnpackHiMask[] = {2, 2, 3, 3};
7935 if (isShuffleEquivalent(Mask, 0, 0, 1, 1))
7936 Mask = UnpackLoMask;
7937 else if (isShuffleEquivalent(Mask, 2, 2, 3, 3))
7938 Mask = UnpackHiMask;
7940 return DAG.getNode(X86ISD::PSHUFD, DL, MVT::v4i32, V1,
7941 getV4X86ShuffleImm8ForMask(Mask, DAG));
7944 // Whenever we can lower this as a zext, that instruction is strictly faster
7945 // than any alternative.
7946 if (SDValue ZExt = lowerVectorShuffleAsZeroOrAnyExtend(DL, MVT::v4i32, V1, V2,
7947 Mask, Subtarget, DAG))
7950 // Use dedicated unpack instructions for masks that match their pattern.
7951 if (isShuffleEquivalent(Mask, 0, 4, 1, 5))
7952 return DAG.getNode(X86ISD::UNPCKL, DL, MVT::v4i32, V1, V2);
7953 if (isShuffleEquivalent(Mask, 2, 6, 3, 7))
7954 return DAG.getNode(X86ISD::UNPCKH, DL, MVT::v4i32, V1, V2);
7956 // There are special ways we can lower some single-element blends.
7957 if (NumV2Elements == 1)
7958 if (SDValue V = lowerVectorShuffleAsElementInsertion(MVT::v4i32, DL, V1, V2,
7959 Mask, Subtarget, DAG))
7962 if (Subtarget->hasSSE41())
7964 lowerVectorShuffleAsBlend(DL, MVT::v4i32, V1, V2, Mask, DAG))
7967 // Try to use rotation instructions if available.
7968 if (Subtarget->hasSSSE3())
7969 if (SDValue Rotate = lowerVectorShuffleAsByteRotate(
7970 DL, MVT::v4i32, V1, V2, Mask, DAG))
7973 // We implement this with SHUFPS because it can blend from two vectors.
7974 // Because we're going to eventually use SHUFPS, we use SHUFPS even to build
7975 // up the inputs, bypassing domain shift penalties that we would encur if we
7976 // directly used PSHUFD on Nehalem and older. For newer chips, this isn't
7978 return DAG.getNode(ISD::BITCAST, DL, MVT::v4i32,
7979 DAG.getVectorShuffle(
7981 DAG.getNode(ISD::BITCAST, DL, MVT::v4f32, V1),
7982 DAG.getNode(ISD::BITCAST, DL, MVT::v4f32, V2), Mask));
7985 /// \brief Lowering of single-input v8i16 shuffles is the cornerstone of SSE2
7986 /// shuffle lowering, and the most complex part.
7988 /// The lowering strategy is to try to form pairs of input lanes which are
7989 /// targeted at the same half of the final vector, and then use a dword shuffle
7990 /// to place them onto the right half, and finally unpack the paired lanes into
7991 /// their final position.
7993 /// The exact breakdown of how to form these dword pairs and align them on the
7994 /// correct sides is really tricky. See the comments within the function for
7995 /// more of the details.
7996 static SDValue lowerV8I16SingleInputVectorShuffle(
7997 SDLoc DL, SDValue V, MutableArrayRef<int> Mask,
7998 const X86Subtarget *Subtarget, SelectionDAG &DAG) {
7999 assert(V.getSimpleValueType() == MVT::v8i16 && "Bad input type!");
8000 MutableArrayRef<int> LoMask = Mask.slice(0, 4);
8001 MutableArrayRef<int> HiMask = Mask.slice(4, 4);
8003 SmallVector<int, 4> LoInputs;
8004 std::copy_if(LoMask.begin(), LoMask.end(), std::back_inserter(LoInputs),
8005 [](int M) { return M >= 0; });
8006 std::sort(LoInputs.begin(), LoInputs.end());
8007 LoInputs.erase(std::unique(LoInputs.begin(), LoInputs.end()), LoInputs.end());
8008 SmallVector<int, 4> HiInputs;
8009 std::copy_if(HiMask.begin(), HiMask.end(), std::back_inserter(HiInputs),
8010 [](int M) { return M >= 0; });
8011 std::sort(HiInputs.begin(), HiInputs.end());
8012 HiInputs.erase(std::unique(HiInputs.begin(), HiInputs.end()), HiInputs.end());
8014 std::lower_bound(LoInputs.begin(), LoInputs.end(), 4) - LoInputs.begin();
8015 int NumHToL = LoInputs.size() - NumLToL;
8017 std::lower_bound(HiInputs.begin(), HiInputs.end(), 4) - HiInputs.begin();
8018 int NumHToH = HiInputs.size() - NumLToH;
8019 MutableArrayRef<int> LToLInputs(LoInputs.data(), NumLToL);
8020 MutableArrayRef<int> LToHInputs(HiInputs.data(), NumLToH);
8021 MutableArrayRef<int> HToLInputs(LoInputs.data() + NumLToL, NumHToL);
8022 MutableArrayRef<int> HToHInputs(HiInputs.data() + NumLToH, NumHToH);
8024 // Use dedicated unpack instructions for masks that match their pattern.
8025 if (isShuffleEquivalent(Mask, 0, 0, 1, 1, 2, 2, 3, 3))
8026 return DAG.getNode(X86ISD::UNPCKL, DL, MVT::v8i16, V, V);
8027 if (isShuffleEquivalent(Mask, 4, 4, 5, 5, 6, 6, 7, 7))
8028 return DAG.getNode(X86ISD::UNPCKH, DL, MVT::v8i16, V, V);
8030 // Try to use rotation instructions if available.
8031 if (Subtarget->hasSSSE3())
8032 if (SDValue Rotate = lowerVectorShuffleAsByteRotate(
8033 DL, MVT::v8i16, V, V, Mask, DAG))
8036 // Simplify the 1-into-3 and 3-into-1 cases with a single pshufd. For all
8037 // such inputs we can swap two of the dwords across the half mark and end up
8038 // with <=2 inputs to each half in each half. Once there, we can fall through
8039 // to the generic code below. For example:
8041 // Input: [a, b, c, d, e, f, g, h] -PSHUFD[0,2,1,3]-> [a, b, e, f, c, d, g, h]
8042 // Mask: [0, 1, 2, 7, 4, 5, 6, 3] -----------------> [0, 1, 4, 7, 2, 3, 6, 5]
8044 // However in some very rare cases we have a 1-into-3 or 3-into-1 on one half
8045 // and an existing 2-into-2 on the other half. In this case we may have to
8046 // pre-shuffle the 2-into-2 half to avoid turning it into a 3-into-1 or
8047 // 1-into-3 which could cause us to cycle endlessly fixing each side in turn.
8048 // Fortunately, we don't have to handle anything but a 2-into-2 pattern
8049 // because any other situation (including a 3-into-1 or 1-into-3 in the other
8050 // half than the one we target for fixing) will be fixed when we re-enter this
8051 // path. We will also combine away any sequence of PSHUFD instructions that
8052 // result into a single instruction. Here is an example of the tricky case:
8054 // Input: [a, b, c, d, e, f, g, h] -PSHUFD[0,2,1,3]-> [a, b, e, f, c, d, g, h]
8055 // Mask: [3, 7, 1, 0, 2, 7, 3, 5] -THIS-IS-BAD!!!!-> [5, 7, 1, 0, 4, 7, 5, 3]
8057 // This now has a 1-into-3 in the high half! Instead, we do two shuffles:
8059 // Input: [a, b, c, d, e, f, g, h] PSHUFHW[0,2,1,3]-> [a, b, c, d, e, g, f, h]
8060 // Mask: [3, 7, 1, 0, 2, 7, 3, 5] -----------------> [3, 7, 1, 0, 2, 7, 3, 6]
8062 // Input: [a, b, c, d, e, g, f, h] -PSHUFD[0,2,1,3]-> [a, b, e, g, c, d, f, h]
8063 // Mask: [3, 7, 1, 0, 2, 7, 3, 6] -----------------> [5, 7, 1, 0, 4, 7, 5, 6]
8065 // The result is fine to be handled by the generic logic.
8066 auto balanceSides = [&](ArrayRef<int> AToAInputs, ArrayRef<int> BToAInputs,
8067 ArrayRef<int> BToBInputs, ArrayRef<int> AToBInputs,
8068 int AOffset, int BOffset) {
8069 assert((AToAInputs.size() == 3 || AToAInputs.size() == 1) &&
8070 "Must call this with A having 3 or 1 inputs from the A half.");
8071 assert((BToAInputs.size() == 1 || BToAInputs.size() == 3) &&
8072 "Must call this with B having 1 or 3 inputs from the B half.");
8073 assert(AToAInputs.size() + BToAInputs.size() == 4 &&
8074 "Must call this with either 3:1 or 1:3 inputs (summing to 4).");
8076 // Compute the index of dword with only one word among the three inputs in
8077 // a half by taking the sum of the half with three inputs and subtracting
8078 // the sum of the actual three inputs. The difference is the remaining
8081 int &TripleDWord = AToAInputs.size() == 3 ? ADWord : BDWord;
8082 int &OneInputDWord = AToAInputs.size() == 3 ? BDWord : ADWord;
8083 int TripleInputOffset = AToAInputs.size() == 3 ? AOffset : BOffset;
8084 ArrayRef<int> TripleInputs = AToAInputs.size() == 3 ? AToAInputs : BToAInputs;
8085 int OneInput = AToAInputs.size() == 3 ? BToAInputs[0] : AToAInputs[0];
8086 int TripleInputSum = 0 + 1 + 2 + 3 + (4 * TripleInputOffset);
8087 int TripleNonInputIdx =
8088 TripleInputSum - std::accumulate(TripleInputs.begin(), TripleInputs.end(), 0);
8089 TripleDWord = TripleNonInputIdx / 2;
8091 // We use xor with one to compute the adjacent DWord to whichever one the
8093 OneInputDWord = (OneInput / 2) ^ 1;
8095 // Check for one tricky case: We're fixing a 3<-1 or a 1<-3 shuffle for AToA
8096 // and BToA inputs. If there is also such a problem with the BToB and AToB
8097 // inputs, we don't try to fix it necessarily -- we'll recurse and see it in
8098 // the next pass. However, if we have a 2<-2 in the BToB and AToB inputs, it
8099 // is essential that we don't *create* a 3<-1 as then we might oscillate.
8100 if (BToBInputs.size() == 2 && AToBInputs.size() == 2) {
8101 // Compute how many inputs will be flipped by swapping these DWords. We
8103 // to balance this to ensure we don't form a 3-1 shuffle in the other
8105 int NumFlippedAToBInputs =
8106 std::count(AToBInputs.begin(), AToBInputs.end(), 2 * ADWord) +
8107 std::count(AToBInputs.begin(), AToBInputs.end(), 2 * ADWord + 1);
8108 int NumFlippedBToBInputs =
8109 std::count(BToBInputs.begin(), BToBInputs.end(), 2 * BDWord) +
8110 std::count(BToBInputs.begin(), BToBInputs.end(), 2 * BDWord + 1);
8111 if ((NumFlippedAToBInputs == 1 &&
8112 (NumFlippedBToBInputs == 0 || NumFlippedBToBInputs == 2)) ||
8113 (NumFlippedBToBInputs == 1 &&
8114 (NumFlippedAToBInputs == 0 || NumFlippedAToBInputs == 2))) {
8115 // We choose whether to fix the A half or B half based on whether that
8116 // half has zero flipped inputs. At zero, we may not be able to fix it
8117 // with that half. We also bias towards fixing the B half because that
8118 // will more commonly be the high half, and we have to bias one way.
8119 auto FixFlippedInputs = [&V, &DL, &Mask, &DAG](int PinnedIdx, int DWord,
8120 ArrayRef<int> Inputs) {
8121 int FixIdx = PinnedIdx ^ 1; // The adjacent slot to the pinned slot.
8122 bool IsFixIdxInput = std::find(Inputs.begin(), Inputs.end(),
8123 PinnedIdx ^ 1) != Inputs.end();
8124 // Determine whether the free index is in the flipped dword or the
8125 // unflipped dword based on where the pinned index is. We use this bit
8126 // in an xor to conditionally select the adjacent dword.
8127 int FixFreeIdx = 2 * (DWord ^ (PinnedIdx / 2 == DWord));
8128 bool IsFixFreeIdxInput = std::find(Inputs.begin(), Inputs.end(),
8129 FixFreeIdx) != Inputs.end();
8130 if (IsFixIdxInput == IsFixFreeIdxInput)
8132 IsFixFreeIdxInput = std::find(Inputs.begin(), Inputs.end(),
8133 FixFreeIdx) != Inputs.end();
8134 assert(IsFixIdxInput != IsFixFreeIdxInput &&
8135 "We need to be changing the number of flipped inputs!");
8136 int PSHUFHalfMask[] = {0, 1, 2, 3};
8137 std::swap(PSHUFHalfMask[FixFreeIdx % 4], PSHUFHalfMask[FixIdx % 4]);
8138 V = DAG.getNode(FixIdx < 4 ? X86ISD::PSHUFLW : X86ISD::PSHUFHW, DL,
8140 getV4X86ShuffleImm8ForMask(PSHUFHalfMask, DAG));
8143 if (M != -1 && M == FixIdx)
8145 else if (M != -1 && M == FixFreeIdx)
8148 if (NumFlippedBToBInputs != 0) {
8150 BToAInputs.size() == 3 ? TripleNonInputIdx : OneInput;
8151 FixFlippedInputs(BPinnedIdx, BDWord, BToBInputs);
8153 assert(NumFlippedAToBInputs != 0 && "Impossible given predicates!");
8155 AToAInputs.size() == 3 ? TripleNonInputIdx : OneInput;
8156 FixFlippedInputs(APinnedIdx, ADWord, AToBInputs);
8161 int PSHUFDMask[] = {0, 1, 2, 3};
8162 PSHUFDMask[ADWord] = BDWord;
8163 PSHUFDMask[BDWord] = ADWord;
8164 V = DAG.getNode(ISD::BITCAST, DL, MVT::v8i16,
8165 DAG.getNode(X86ISD::PSHUFD, DL, MVT::v4i32,
8166 DAG.getNode(ISD::BITCAST, DL, MVT::v4i32, V),
8167 getV4X86ShuffleImm8ForMask(PSHUFDMask, DAG)));
8169 // Adjust the mask to match the new locations of A and B.
8171 if (M != -1 && M/2 == ADWord)
8172 M = 2 * BDWord + M % 2;
8173 else if (M != -1 && M/2 == BDWord)
8174 M = 2 * ADWord + M % 2;
8176 // Recurse back into this routine to re-compute state now that this isn't
8177 // a 3 and 1 problem.
8178 return DAG.getVectorShuffle(MVT::v8i16, DL, V, DAG.getUNDEF(MVT::v8i16),
8181 if ((NumLToL == 3 && NumHToL == 1) || (NumLToL == 1 && NumHToL == 3))
8182 return balanceSides(LToLInputs, HToLInputs, HToHInputs, LToHInputs, 0, 4);
8183 else if ((NumHToH == 3 && NumLToH == 1) || (NumHToH == 1 && NumLToH == 3))
8184 return balanceSides(HToHInputs, LToHInputs, LToLInputs, HToLInputs, 4, 0);
8186 // At this point there are at most two inputs to the low and high halves from
8187 // each half. That means the inputs can always be grouped into dwords and
8188 // those dwords can then be moved to the correct half with a dword shuffle.
8189 // We use at most one low and one high word shuffle to collect these paired
8190 // inputs into dwords, and finally a dword shuffle to place them.
8191 int PSHUFLMask[4] = {-1, -1, -1, -1};
8192 int PSHUFHMask[4] = {-1, -1, -1, -1};
8193 int PSHUFDMask[4] = {-1, -1, -1, -1};
8195 // First fix the masks for all the inputs that are staying in their
8196 // original halves. This will then dictate the targets of the cross-half
8198 auto fixInPlaceInputs =
8199 [&PSHUFDMask](ArrayRef<int> InPlaceInputs, ArrayRef<int> IncomingInputs,
8200 MutableArrayRef<int> SourceHalfMask,
8201 MutableArrayRef<int> HalfMask, int HalfOffset) {
8202 if (InPlaceInputs.empty())
8204 if (InPlaceInputs.size() == 1) {
8205 SourceHalfMask[InPlaceInputs[0] - HalfOffset] =
8206 InPlaceInputs[0] - HalfOffset;
8207 PSHUFDMask[InPlaceInputs[0] / 2] = InPlaceInputs[0] / 2;
8210 if (IncomingInputs.empty()) {
8211 // Just fix all of the in place inputs.
8212 for (int Input : InPlaceInputs) {
8213 SourceHalfMask[Input - HalfOffset] = Input - HalfOffset;
8214 PSHUFDMask[Input / 2] = Input / 2;
8219 assert(InPlaceInputs.size() == 2 && "Cannot handle 3 or 4 inputs!");
8220 SourceHalfMask[InPlaceInputs[0] - HalfOffset] =
8221 InPlaceInputs[0] - HalfOffset;
8222 // Put the second input next to the first so that they are packed into
8223 // a dword. We find the adjacent index by toggling the low bit.
8224 int AdjIndex = InPlaceInputs[0] ^ 1;
8225 SourceHalfMask[AdjIndex - HalfOffset] = InPlaceInputs[1] - HalfOffset;
8226 std::replace(HalfMask.begin(), HalfMask.end(), InPlaceInputs[1], AdjIndex);
8227 PSHUFDMask[AdjIndex / 2] = AdjIndex / 2;
8229 fixInPlaceInputs(LToLInputs, HToLInputs, PSHUFLMask, LoMask, 0);
8230 fixInPlaceInputs(HToHInputs, LToHInputs, PSHUFHMask, HiMask, 4);
8232 // Now gather the cross-half inputs and place them into a free dword of
8233 // their target half.
8234 // FIXME: This operation could almost certainly be simplified dramatically to
8235 // look more like the 3-1 fixing operation.
8236 auto moveInputsToRightHalf = [&PSHUFDMask](
8237 MutableArrayRef<int> IncomingInputs, ArrayRef<int> ExistingInputs,
8238 MutableArrayRef<int> SourceHalfMask, MutableArrayRef<int> HalfMask,
8239 MutableArrayRef<int> FinalSourceHalfMask, int SourceOffset,
8241 auto isWordClobbered = [](ArrayRef<int> SourceHalfMask, int Word) {
8242 return SourceHalfMask[Word] != -1 && SourceHalfMask[Word] != Word;
8244 auto isDWordClobbered = [&isWordClobbered](ArrayRef<int> SourceHalfMask,
8246 int LowWord = Word & ~1;
8247 int HighWord = Word | 1;
8248 return isWordClobbered(SourceHalfMask, LowWord) ||
8249 isWordClobbered(SourceHalfMask, HighWord);
8252 if (IncomingInputs.empty())
8255 if (ExistingInputs.empty()) {
8256 // Map any dwords with inputs from them into the right half.
8257 for (int Input : IncomingInputs) {
8258 // If the source half mask maps over the inputs, turn those into
8259 // swaps and use the swapped lane.
8260 if (isWordClobbered(SourceHalfMask, Input - SourceOffset)) {
8261 if (SourceHalfMask[SourceHalfMask[Input - SourceOffset]] == -1) {
8262 SourceHalfMask[SourceHalfMask[Input - SourceOffset]] =
8263 Input - SourceOffset;
8264 // We have to swap the uses in our half mask in one sweep.
8265 for (int &M : HalfMask)
8266 if (M == SourceHalfMask[Input - SourceOffset] + SourceOffset)
8268 else if (M == Input)
8269 M = SourceHalfMask[Input - SourceOffset] + SourceOffset;
8271 assert(SourceHalfMask[SourceHalfMask[Input - SourceOffset]] ==
8272 Input - SourceOffset &&
8273 "Previous placement doesn't match!");
8275 // Note that this correctly re-maps both when we do a swap and when
8276 // we observe the other side of the swap above. We rely on that to
8277 // avoid swapping the members of the input list directly.
8278 Input = SourceHalfMask[Input - SourceOffset] + SourceOffset;
8281 // Map the input's dword into the correct half.
8282 if (PSHUFDMask[(Input - SourceOffset + DestOffset) / 2] == -1)
8283 PSHUFDMask[(Input - SourceOffset + DestOffset) / 2] = Input / 2;
8285 assert(PSHUFDMask[(Input - SourceOffset + DestOffset) / 2] ==
8287 "Previous placement doesn't match!");
8290 // And just directly shift any other-half mask elements to be same-half
8291 // as we will have mirrored the dword containing the element into the
8292 // same position within that half.
8293 for (int &M : HalfMask)
8294 if (M >= SourceOffset && M < SourceOffset + 4) {
8295 M = M - SourceOffset + DestOffset;
8296 assert(M >= 0 && "This should never wrap below zero!");
8301 // Ensure we have the input in a viable dword of its current half. This
8302 // is particularly tricky because the original position may be clobbered
8303 // by inputs being moved and *staying* in that half.
8304 if (IncomingInputs.size() == 1) {
8305 if (isWordClobbered(SourceHalfMask, IncomingInputs[0] - SourceOffset)) {
8306 int InputFixed = std::find(std::begin(SourceHalfMask),
8307 std::end(SourceHalfMask), -1) -
8308 std::begin(SourceHalfMask) + SourceOffset;
8309 SourceHalfMask[InputFixed - SourceOffset] =
8310 IncomingInputs[0] - SourceOffset;
8311 std::replace(HalfMask.begin(), HalfMask.end(), IncomingInputs[0],
8313 IncomingInputs[0] = InputFixed;
8315 } else if (IncomingInputs.size() == 2) {
8316 if (IncomingInputs[0] / 2 != IncomingInputs[1] / 2 ||
8317 isDWordClobbered(SourceHalfMask, IncomingInputs[0] - SourceOffset)) {
8318 // We have two non-adjacent or clobbered inputs we need to extract from
8319 // the source half. To do this, we need to map them into some adjacent
8320 // dword slot in the source mask.
8321 int InputsFixed[2] = {IncomingInputs[0] - SourceOffset,
8322 IncomingInputs[1] - SourceOffset};
8324 // If there is a free slot in the source half mask adjacent to one of
8325 // the inputs, place the other input in it. We use (Index XOR 1) to
8326 // compute an adjacent index.
8327 if (!isWordClobbered(SourceHalfMask, InputsFixed[0]) &&
8328 SourceHalfMask[InputsFixed[0] ^ 1] == -1) {
8329 SourceHalfMask[InputsFixed[0]] = InputsFixed[0];
8330 SourceHalfMask[InputsFixed[0] ^ 1] = InputsFixed[1];
8331 InputsFixed[1] = InputsFixed[0] ^ 1;
8332 } else if (!isWordClobbered(SourceHalfMask, InputsFixed[1]) &&
8333 SourceHalfMask[InputsFixed[1] ^ 1] == -1) {
8334 SourceHalfMask[InputsFixed[1]] = InputsFixed[1];
8335 SourceHalfMask[InputsFixed[1] ^ 1] = InputsFixed[0];
8336 InputsFixed[0] = InputsFixed[1] ^ 1;
8337 } else if (SourceHalfMask[2 * ((InputsFixed[0] / 2) ^ 1)] == -1 &&
8338 SourceHalfMask[2 * ((InputsFixed[0] / 2) ^ 1) + 1] == -1) {
8339 // The two inputs are in the same DWord but it is clobbered and the
8340 // adjacent DWord isn't used at all. Move both inputs to the free
8342 SourceHalfMask[2 * ((InputsFixed[0] / 2) ^ 1)] = InputsFixed[0];
8343 SourceHalfMask[2 * ((InputsFixed[0] / 2) ^ 1) + 1] = InputsFixed[1];
8344 InputsFixed[0] = 2 * ((InputsFixed[0] / 2) ^ 1);
8345 InputsFixed[1] = 2 * ((InputsFixed[0] / 2) ^ 1) + 1;
8347 // The only way we hit this point is if there is no clobbering
8348 // (because there are no off-half inputs to this half) and there is no
8349 // free slot adjacent to one of the inputs. In this case, we have to
8350 // swap an input with a non-input.
8351 for (int i = 0; i < 4; ++i)
8352 assert((SourceHalfMask[i] == -1 || SourceHalfMask[i] == i) &&
8353 "We can't handle any clobbers here!");
8354 assert(InputsFixed[1] != (InputsFixed[0] ^ 1) &&
8355 "Cannot have adjacent inputs here!");
8357 SourceHalfMask[InputsFixed[0] ^ 1] = InputsFixed[1];
8358 SourceHalfMask[InputsFixed[1]] = InputsFixed[0] ^ 1;
8360 // We also have to update the final source mask in this case because
8361 // it may need to undo the above swap.
8362 for (int &M : FinalSourceHalfMask)
8363 if (M == (InputsFixed[0] ^ 1) + SourceOffset)
8364 M = InputsFixed[1] + SourceOffset;
8365 else if (M == InputsFixed[1] + SourceOffset)
8366 M = (InputsFixed[0] ^ 1) + SourceOffset;
8368 InputsFixed[1] = InputsFixed[0] ^ 1;
8371 // Point everything at the fixed inputs.
8372 for (int &M : HalfMask)
8373 if (M == IncomingInputs[0])
8374 M = InputsFixed[0] + SourceOffset;
8375 else if (M == IncomingInputs[1])
8376 M = InputsFixed[1] + SourceOffset;
8378 IncomingInputs[0] = InputsFixed[0] + SourceOffset;
8379 IncomingInputs[1] = InputsFixed[1] + SourceOffset;
8382 llvm_unreachable("Unhandled input size!");
8385 // Now hoist the DWord down to the right half.
8386 int FreeDWord = (PSHUFDMask[DestOffset / 2] == -1 ? 0 : 1) + DestOffset / 2;
8387 assert(PSHUFDMask[FreeDWord] == -1 && "DWord not free");
8388 PSHUFDMask[FreeDWord] = IncomingInputs[0] / 2;
8389 for (int &M : HalfMask)
8390 for (int Input : IncomingInputs)
8392 M = FreeDWord * 2 + Input % 2;
8394 moveInputsToRightHalf(HToLInputs, LToLInputs, PSHUFHMask, LoMask, HiMask,
8395 /*SourceOffset*/ 4, /*DestOffset*/ 0);
8396 moveInputsToRightHalf(LToHInputs, HToHInputs, PSHUFLMask, HiMask, LoMask,
8397 /*SourceOffset*/ 0, /*DestOffset*/ 4);
8399 // Now enact all the shuffles we've computed to move the inputs into their
8401 if (!isNoopShuffleMask(PSHUFLMask))
8402 V = DAG.getNode(X86ISD::PSHUFLW, DL, MVT::v8i16, V,
8403 getV4X86ShuffleImm8ForMask(PSHUFLMask, DAG));
8404 if (!isNoopShuffleMask(PSHUFHMask))
8405 V = DAG.getNode(X86ISD::PSHUFHW, DL, MVT::v8i16, V,
8406 getV4X86ShuffleImm8ForMask(PSHUFHMask, DAG));
8407 if (!isNoopShuffleMask(PSHUFDMask))
8408 V = DAG.getNode(ISD::BITCAST, DL, MVT::v8i16,
8409 DAG.getNode(X86ISD::PSHUFD, DL, MVT::v4i32,
8410 DAG.getNode(ISD::BITCAST, DL, MVT::v4i32, V),
8411 getV4X86ShuffleImm8ForMask(PSHUFDMask, DAG)));
8413 // At this point, each half should contain all its inputs, and we can then
8414 // just shuffle them into their final position.
8415 assert(std::count_if(LoMask.begin(), LoMask.end(),
8416 [](int M) { return M >= 4; }) == 0 &&
8417 "Failed to lift all the high half inputs to the low mask!");
8418 assert(std::count_if(HiMask.begin(), HiMask.end(),
8419 [](int M) { return M >= 0 && M < 4; }) == 0 &&
8420 "Failed to lift all the low half inputs to the high mask!");
8422 // Do a half shuffle for the low mask.
8423 if (!isNoopShuffleMask(LoMask))
8424 V = DAG.getNode(X86ISD::PSHUFLW, DL, MVT::v8i16, V,
8425 getV4X86ShuffleImm8ForMask(LoMask, DAG));
8427 // Do a half shuffle with the high mask after shifting its values down.
8428 for (int &M : HiMask)
8431 if (!isNoopShuffleMask(HiMask))
8432 V = DAG.getNode(X86ISD::PSHUFHW, DL, MVT::v8i16, V,
8433 getV4X86ShuffleImm8ForMask(HiMask, DAG));
8438 /// \brief Detect whether the mask pattern should be lowered through
8441 /// This essentially tests whether viewing the mask as an interleaving of two
8442 /// sub-sequences reduces the cross-input traffic of a blend operation. If so,
8443 /// lowering it through interleaving is a significantly better strategy.
8444 static bool shouldLowerAsInterleaving(ArrayRef<int> Mask) {
8445 int NumEvenInputs[2] = {0, 0};
8446 int NumOddInputs[2] = {0, 0};
8447 int NumLoInputs[2] = {0, 0};
8448 int NumHiInputs[2] = {0, 0};
8449 for (int i = 0, Size = Mask.size(); i < Size; ++i) {
8453 int InputIdx = Mask[i] >= Size;
8456 ++NumLoInputs[InputIdx];
8458 ++NumHiInputs[InputIdx];
8461 ++NumEvenInputs[InputIdx];
8463 ++NumOddInputs[InputIdx];
8466 // The minimum number of cross-input results for both the interleaved and
8467 // split cases. If interleaving results in fewer cross-input results, return
8469 int InterleavedCrosses = std::min(NumEvenInputs[1] + NumOddInputs[0],
8470 NumEvenInputs[0] + NumOddInputs[1]);
8471 int SplitCrosses = std::min(NumLoInputs[1] + NumHiInputs[0],
8472 NumLoInputs[0] + NumHiInputs[1]);
8473 return InterleavedCrosses < SplitCrosses;
8476 /// \brief Blend two v8i16 vectors using a naive unpack strategy.
8478 /// This strategy only works when the inputs from each vector fit into a single
8479 /// half of that vector, and generally there are not so many inputs as to leave
8480 /// the in-place shuffles required highly constrained (and thus expensive). It
8481 /// shifts all the inputs into a single side of both input vectors and then
8482 /// uses an unpack to interleave these inputs in a single vector. At that
8483 /// point, we will fall back on the generic single input shuffle lowering.
8484 static SDValue lowerV8I16BasicBlendVectorShuffle(SDLoc DL, SDValue V1,
8486 MutableArrayRef<int> Mask,
8487 const X86Subtarget *Subtarget,
8488 SelectionDAG &DAG) {
8489 assert(V1.getSimpleValueType() == MVT::v8i16 && "Bad input type!");
8490 assert(V2.getSimpleValueType() == MVT::v8i16 && "Bad input type!");
8491 SmallVector<int, 3> LoV1Inputs, HiV1Inputs, LoV2Inputs, HiV2Inputs;
8492 for (int i = 0; i < 8; ++i)
8493 if (Mask[i] >= 0 && Mask[i] < 4)
8494 LoV1Inputs.push_back(i);
8495 else if (Mask[i] >= 4 && Mask[i] < 8)
8496 HiV1Inputs.push_back(i);
8497 else if (Mask[i] >= 8 && Mask[i] < 12)
8498 LoV2Inputs.push_back(i);
8499 else if (Mask[i] >= 12)
8500 HiV2Inputs.push_back(i);
8502 int NumV1Inputs = LoV1Inputs.size() + HiV1Inputs.size();
8503 int NumV2Inputs = LoV2Inputs.size() + HiV2Inputs.size();
8506 assert(NumV1Inputs > 0 && NumV1Inputs <= 3 && "At most 3 inputs supported");
8507 assert(NumV2Inputs > 0 && NumV2Inputs <= 3 && "At most 3 inputs supported");
8508 assert(NumV1Inputs + NumV2Inputs <= 4 && "At most 4 combined inputs");
8510 bool MergeFromLo = LoV1Inputs.size() + LoV2Inputs.size() >=
8511 HiV1Inputs.size() + HiV2Inputs.size();
8513 auto moveInputsToHalf = [&](SDValue V, ArrayRef<int> LoInputs,
8514 ArrayRef<int> HiInputs, bool MoveToLo,
8516 ArrayRef<int> GoodInputs = MoveToLo ? LoInputs : HiInputs;
8517 ArrayRef<int> BadInputs = MoveToLo ? HiInputs : LoInputs;
8518 if (BadInputs.empty())
8521 int MoveMask[] = {-1, -1, -1, -1, -1, -1, -1, -1};
8522 int MoveOffset = MoveToLo ? 0 : 4;
8524 if (GoodInputs.empty()) {
8525 for (int BadInput : BadInputs) {
8526 MoveMask[Mask[BadInput] % 4 + MoveOffset] = Mask[BadInput] - MaskOffset;
8527 Mask[BadInput] = Mask[BadInput] % 4 + MoveOffset + MaskOffset;
8530 if (GoodInputs.size() == 2) {
8531 // If the low inputs are spread across two dwords, pack them into
8533 MoveMask[MoveOffset] = Mask[GoodInputs[0]] - MaskOffset;
8534 MoveMask[MoveOffset + 1] = Mask[GoodInputs[1]] - MaskOffset;
8535 Mask[GoodInputs[0]] = MoveOffset + MaskOffset;
8536 Mask[GoodInputs[1]] = MoveOffset + 1 + MaskOffset;
8538 // Otherwise pin the good inputs.
8539 for (int GoodInput : GoodInputs)
8540 MoveMask[Mask[GoodInput] - MaskOffset] = Mask[GoodInput] - MaskOffset;
8543 if (BadInputs.size() == 2) {
8544 // If we have two bad inputs then there may be either one or two good
8545 // inputs fixed in place. Find a fixed input, and then find the *other*
8546 // two adjacent indices by using modular arithmetic.
8548 std::find_if(std::begin(MoveMask) + MoveOffset, std::end(MoveMask),
8549 [](int M) { return M >= 0; }) -
8550 std::begin(MoveMask);
8552 ((((GoodMaskIdx - MoveOffset) & ~1) + 2) % 4) + MoveOffset;
8553 assert(MoveMask[MoveMaskIdx] == -1 && "Expected empty slot");
8554 assert(MoveMask[MoveMaskIdx + 1] == -1 && "Expected empty slot");
8555 MoveMask[MoveMaskIdx] = Mask[BadInputs[0]] - MaskOffset;
8556 MoveMask[MoveMaskIdx + 1] = Mask[BadInputs[1]] - MaskOffset;
8557 Mask[BadInputs[0]] = MoveMaskIdx + MaskOffset;
8558 Mask[BadInputs[1]] = MoveMaskIdx + 1 + MaskOffset;
8560 assert(BadInputs.size() == 1 && "All sizes handled");
8561 int MoveMaskIdx = std::find(std::begin(MoveMask) + MoveOffset,
8562 std::end(MoveMask), -1) -
8563 std::begin(MoveMask);
8564 MoveMask[MoveMaskIdx] = Mask[BadInputs[0]] - MaskOffset;
8565 Mask[BadInputs[0]] = MoveMaskIdx + MaskOffset;
8569 return DAG.getVectorShuffle(MVT::v8i16, DL, V, DAG.getUNDEF(MVT::v8i16),
8572 V1 = moveInputsToHalf(V1, LoV1Inputs, HiV1Inputs, MergeFromLo,
8574 V2 = moveInputsToHalf(V2, LoV2Inputs, HiV2Inputs, MergeFromLo,
8577 // FIXME: Select an interleaving of the merge of V1 and V2 that minimizes
8578 // cross-half traffic in the final shuffle.
8580 // Munge the mask to be a single-input mask after the unpack merges the
8584 M = 2 * (M % 4) + (M / 8);
8586 return DAG.getVectorShuffle(
8587 MVT::v8i16, DL, DAG.getNode(MergeFromLo ? X86ISD::UNPCKL : X86ISD::UNPCKH,
8588 DL, MVT::v8i16, V1, V2),
8589 DAG.getUNDEF(MVT::v8i16), Mask);
8592 /// \brief Generic lowering of 8-lane i16 shuffles.
8594 /// This handles both single-input shuffles and combined shuffle/blends with
8595 /// two inputs. The single input shuffles are immediately delegated to
8596 /// a dedicated lowering routine.
8598 /// The blends are lowered in one of three fundamental ways. If there are few
8599 /// enough inputs, it delegates to a basic UNPCK-based strategy. If the shuffle
8600 /// of the input is significantly cheaper when lowered as an interleaving of
8601 /// the two inputs, try to interleave them. Otherwise, blend the low and high
8602 /// halves of the inputs separately (making them have relatively few inputs)
8603 /// and then concatenate them.
8604 static SDValue lowerV8I16VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
8605 const X86Subtarget *Subtarget,
8606 SelectionDAG &DAG) {
8608 assert(Op.getSimpleValueType() == MVT::v8i16 && "Bad shuffle type!");
8609 assert(V1.getSimpleValueType() == MVT::v8i16 && "Bad operand type!");
8610 assert(V2.getSimpleValueType() == MVT::v8i16 && "Bad operand type!");
8611 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
8612 ArrayRef<int> OrigMask = SVOp->getMask();
8613 int MaskStorage[8] = {OrigMask[0], OrigMask[1], OrigMask[2], OrigMask[3],
8614 OrigMask[4], OrigMask[5], OrigMask[6], OrigMask[7]};
8615 MutableArrayRef<int> Mask(MaskStorage);
8617 assert(Mask.size() == 8 && "Unexpected mask size for v8 shuffle!");
8619 // Whenever we can lower this as a zext, that instruction is strictly faster
8620 // than any alternative.
8621 if (SDValue ZExt = lowerVectorShuffleAsZeroOrAnyExtend(
8622 DL, MVT::v8i16, V1, V2, OrigMask, Subtarget, DAG))
8625 auto isV1 = [](int M) { return M >= 0 && M < 8; };
8626 auto isV2 = [](int M) { return M >= 8; };
8628 int NumV1Inputs = std::count_if(Mask.begin(), Mask.end(), isV1);
8629 int NumV2Inputs = std::count_if(Mask.begin(), Mask.end(), isV2);
8631 if (NumV2Inputs == 0)
8632 return lowerV8I16SingleInputVectorShuffle(DL, V1, Mask, Subtarget, DAG);
8634 assert(NumV1Inputs > 0 && "All single-input shuffles should be canonicalized "
8635 "to be V1-input shuffles.");
8637 // There are special ways we can lower some single-element blends.
8638 if (NumV2Inputs == 1)
8639 if (SDValue V = lowerVectorShuffleAsElementInsertion(MVT::v8i16, DL, V1, V2,
8640 Mask, Subtarget, DAG))
8643 if (Subtarget->hasSSE41())
8645 lowerVectorShuffleAsBlend(DL, MVT::v8i16, V1, V2, Mask, DAG))
8648 // Try to use rotation instructions if available.
8649 if (Subtarget->hasSSSE3())
8650 if (SDValue Rotate = lowerVectorShuffleAsByteRotate(DL, MVT::v8i16, V1, V2, Mask, DAG))
8653 if (NumV1Inputs + NumV2Inputs <= 4)
8654 return lowerV8I16BasicBlendVectorShuffle(DL, V1, V2, Mask, Subtarget, DAG);
8656 // Check whether an interleaving lowering is likely to be more efficient.
8657 // This isn't perfect but it is a strong heuristic that tends to work well on
8658 // the kinds of shuffles that show up in practice.
8660 // FIXME: Handle 1x, 2x, and 4x interleaving.
8661 if (shouldLowerAsInterleaving(Mask)) {
8662 // FIXME: Figure out whether we should pack these into the low or high
8665 int EMask[8], OMask[8];
8666 for (int i = 0; i < 4; ++i) {
8667 EMask[i] = Mask[2*i];
8668 OMask[i] = Mask[2*i + 1];
8673 SDValue Evens = DAG.getVectorShuffle(MVT::v8i16, DL, V1, V2, EMask);
8674 SDValue Odds = DAG.getVectorShuffle(MVT::v8i16, DL, V1, V2, OMask);
8676 return DAG.getNode(X86ISD::UNPCKL, DL, MVT::v8i16, Evens, Odds);
8679 int LoBlendMask[8] = {-1, -1, -1, -1, -1, -1, -1, -1};
8680 int HiBlendMask[8] = {-1, -1, -1, -1, -1, -1, -1, -1};
8682 for (int i = 0; i < 4; ++i) {
8683 LoBlendMask[i] = Mask[i];
8684 HiBlendMask[i] = Mask[i + 4];
8687 SDValue LoV = DAG.getVectorShuffle(MVT::v8i16, DL, V1, V2, LoBlendMask);
8688 SDValue HiV = DAG.getVectorShuffle(MVT::v8i16, DL, V1, V2, HiBlendMask);
8689 LoV = DAG.getNode(ISD::BITCAST, DL, MVT::v2i64, LoV);
8690 HiV = DAG.getNode(ISD::BITCAST, DL, MVT::v2i64, HiV);
8692 return DAG.getNode(ISD::BITCAST, DL, MVT::v8i16,
8693 DAG.getNode(X86ISD::UNPCKL, DL, MVT::v2i64, LoV, HiV));
8696 /// \brief Check whether a compaction lowering can be done by dropping even
8697 /// elements and compute how many times even elements must be dropped.
8699 /// This handles shuffles which take every Nth element where N is a power of
8700 /// two. Example shuffle masks:
8702 /// N = 1: 0, 2, 4, 6, 8, 10, 12, 14, 0, 2, 4, 6, 8, 10, 12, 14
8703 /// N = 1: 0, 2, 4, 6, 8, 10, 12, 14, 16, 18, 20, 22, 24, 26, 28, 30
8704 /// N = 2: 0, 4, 8, 12, 0, 4, 8, 12, 0, 4, 8, 12, 0, 4, 8, 12
8705 /// N = 2: 0, 4, 8, 12, 16, 20, 24, 28, 0, 4, 8, 12, 16, 20, 24, 28
8706 /// N = 3: 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8
8707 /// N = 3: 0, 8, 16, 24, 0, 8, 16, 24, 0, 8, 16, 24, 0, 8, 16, 24
8709 /// Any of these lanes can of course be undef.
8711 /// This routine only supports N <= 3.
8712 /// FIXME: Evaluate whether either AVX or AVX-512 have any opportunities here
8715 /// \returns N above, or the number of times even elements must be dropped if
8716 /// there is such a number. Otherwise returns zero.
8717 static int canLowerByDroppingEvenElements(ArrayRef<int> Mask) {
8718 // Figure out whether we're looping over two inputs or just one.
8719 bool IsSingleInput = isSingleInputShuffleMask(Mask);
8721 // The modulus for the shuffle vector entries is based on whether this is
8722 // a single input or not.
8723 int ShuffleModulus = Mask.size() * (IsSingleInput ? 1 : 2);
8724 assert(isPowerOf2_32((uint32_t)ShuffleModulus) &&
8725 "We should only be called with masks with a power-of-2 size!");
8727 uint64_t ModMask = (uint64_t)ShuffleModulus - 1;
8729 // We track whether the input is viable for all power-of-2 strides 2^1, 2^2,
8730 // and 2^3 simultaneously. This is because we may have ambiguity with
8731 // partially undef inputs.
8732 bool ViableForN[3] = {true, true, true};
8734 for (int i = 0, e = Mask.size(); i < e; ++i) {
8735 // Ignore undef lanes, we'll optimistically collapse them to the pattern we
8740 bool IsAnyViable = false;
8741 for (unsigned j = 0; j != array_lengthof(ViableForN); ++j)
8742 if (ViableForN[j]) {
8745 // The shuffle mask must be equal to (i * 2^N) % M.
8746 if ((uint64_t)Mask[i] == (((uint64_t)i << N) & ModMask))
8749 ViableForN[j] = false;
8751 // Early exit if we exhaust the possible powers of two.
8756 for (unsigned j = 0; j != array_lengthof(ViableForN); ++j)
8760 // Return 0 as there is no viable power of two.
8764 /// \brief Generic lowering of v16i8 shuffles.
8766 /// This is a hybrid strategy to lower v16i8 vectors. It first attempts to
8767 /// detect any complexity reducing interleaving. If that doesn't help, it uses
8768 /// UNPCK to spread the i8 elements across two i16-element vectors, and uses
8769 /// the existing lowering for v8i16 blends on each half, finally PACK-ing them
8771 static SDValue lowerV16I8VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
8772 const X86Subtarget *Subtarget,
8773 SelectionDAG &DAG) {
8775 assert(Op.getSimpleValueType() == MVT::v16i8 && "Bad shuffle type!");
8776 assert(V1.getSimpleValueType() == MVT::v16i8 && "Bad operand type!");
8777 assert(V2.getSimpleValueType() == MVT::v16i8 && "Bad operand type!");
8778 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
8779 ArrayRef<int> OrigMask = SVOp->getMask();
8780 assert(OrigMask.size() == 16 && "Unexpected mask size for v16 shuffle!");
8782 // Try to use rotation instructions if available.
8783 if (Subtarget->hasSSSE3())
8784 if (SDValue Rotate = lowerVectorShuffleAsByteRotate(DL, MVT::v16i8, V1, V2,
8788 // Try to use a zext lowering.
8789 if (SDValue ZExt = lowerVectorShuffleAsZeroOrAnyExtend(
8790 DL, MVT::v16i8, V1, V2, OrigMask, Subtarget, DAG))
8793 int MaskStorage[16] = {
8794 OrigMask[0], OrigMask[1], OrigMask[2], OrigMask[3],
8795 OrigMask[4], OrigMask[5], OrigMask[6], OrigMask[7],
8796 OrigMask[8], OrigMask[9], OrigMask[10], OrigMask[11],
8797 OrigMask[12], OrigMask[13], OrigMask[14], OrigMask[15]};
8798 MutableArrayRef<int> Mask(MaskStorage);
8799 MutableArrayRef<int> LoMask = Mask.slice(0, 8);
8800 MutableArrayRef<int> HiMask = Mask.slice(8, 8);
8803 std::count_if(Mask.begin(), Mask.end(), [](int M) { return M >= 16; });
8805 // For single-input shuffles, there are some nicer lowering tricks we can use.
8806 if (NumV2Elements == 0) {
8807 // Check whether we can widen this to an i16 shuffle by duplicating bytes.
8808 // Notably, this handles splat and partial-splat shuffles more efficiently.
8809 // However, it only makes sense if the pre-duplication shuffle simplifies
8810 // things significantly. Currently, this means we need to be able to
8811 // express the pre-duplication shuffle as an i16 shuffle.
8813 // FIXME: We should check for other patterns which can be widened into an
8814 // i16 shuffle as well.
8815 auto canWidenViaDuplication = [](ArrayRef<int> Mask) {
8816 for (int i = 0; i < 16; i += 2)
8817 if (Mask[i] != -1 && Mask[i + 1] != -1 && Mask[i] != Mask[i + 1])
8822 auto tryToWidenViaDuplication = [&]() -> SDValue {
8823 if (!canWidenViaDuplication(Mask))
8825 SmallVector<int, 4> LoInputs;
8826 std::copy_if(Mask.begin(), Mask.end(), std::back_inserter(LoInputs),
8827 [](int M) { return M >= 0 && M < 8; });
8828 std::sort(LoInputs.begin(), LoInputs.end());
8829 LoInputs.erase(std::unique(LoInputs.begin(), LoInputs.end()),
8831 SmallVector<int, 4> HiInputs;
8832 std::copy_if(Mask.begin(), Mask.end(), std::back_inserter(HiInputs),
8833 [](int M) { return M >= 8; });
8834 std::sort(HiInputs.begin(), HiInputs.end());
8835 HiInputs.erase(std::unique(HiInputs.begin(), HiInputs.end()),
8838 bool TargetLo = LoInputs.size() >= HiInputs.size();
8839 ArrayRef<int> InPlaceInputs = TargetLo ? LoInputs : HiInputs;
8840 ArrayRef<int> MovingInputs = TargetLo ? HiInputs : LoInputs;
8842 int PreDupI16Shuffle[] = {-1, -1, -1, -1, -1, -1, -1, -1};
8843 SmallDenseMap<int, int, 8> LaneMap;
8844 for (int I : InPlaceInputs) {
8845 PreDupI16Shuffle[I/2] = I/2;
8848 int j = TargetLo ? 0 : 4, je = j + 4;
8849 for (int i = 0, ie = MovingInputs.size(); i < ie; ++i) {
8850 // Check if j is already a shuffle of this input. This happens when
8851 // there are two adjacent bytes after we move the low one.
8852 if (PreDupI16Shuffle[j] != MovingInputs[i] / 2) {
8853 // If we haven't yet mapped the input, search for a slot into which
8855 while (j < je && PreDupI16Shuffle[j] != -1)
8859 // We can't place the inputs into a single half with a simple i16 shuffle, so bail.
8862 // Map this input with the i16 shuffle.
8863 PreDupI16Shuffle[j] = MovingInputs[i] / 2;
8866 // Update the lane map based on the mapping we ended up with.
8867 LaneMap[MovingInputs[i]] = 2 * j + MovingInputs[i] % 2;
8870 ISD::BITCAST, DL, MVT::v16i8,
8871 DAG.getVectorShuffle(MVT::v8i16, DL,
8872 DAG.getNode(ISD::BITCAST, DL, MVT::v8i16, V1),
8873 DAG.getUNDEF(MVT::v8i16), PreDupI16Shuffle));
8875 // Unpack the bytes to form the i16s that will be shuffled into place.
8876 V1 = DAG.getNode(TargetLo ? X86ISD::UNPCKL : X86ISD::UNPCKH, DL,
8877 MVT::v16i8, V1, V1);
8879 int PostDupI16Shuffle[8] = {-1, -1, -1, -1, -1, -1, -1, -1};
8880 for (int i = 0; i < 16; i += 2) {
8882 PostDupI16Shuffle[i / 2] = LaneMap[Mask[i]] - (TargetLo ? 0 : 8);
8883 assert(PostDupI16Shuffle[i / 2] < 8 && "Invalid v8 shuffle mask!");
8886 ISD::BITCAST, DL, MVT::v16i8,
8887 DAG.getVectorShuffle(MVT::v8i16, DL,
8888 DAG.getNode(ISD::BITCAST, DL, MVT::v8i16, V1),
8889 DAG.getUNDEF(MVT::v8i16), PostDupI16Shuffle));
8891 if (SDValue V = tryToWidenViaDuplication())
8895 // Check whether an interleaving lowering is likely to be more efficient.
8896 // This isn't perfect but it is a strong heuristic that tends to work well on
8897 // the kinds of shuffles that show up in practice.
8899 // FIXME: We need to handle other interleaving widths (i16, i32, ...).
8900 if (shouldLowerAsInterleaving(Mask)) {
8901 // FIXME: Figure out whether we should pack these into the low or high
8904 int EMask[16], OMask[16];
8905 for (int i = 0; i < 8; ++i) {
8906 EMask[i] = Mask[2*i];
8907 OMask[i] = Mask[2*i + 1];
8912 SDValue Evens = DAG.getVectorShuffle(MVT::v16i8, DL, V1, V2, EMask);
8913 SDValue Odds = DAG.getVectorShuffle(MVT::v16i8, DL, V1, V2, OMask);
8915 return DAG.getNode(X86ISD::UNPCKL, DL, MVT::v16i8, Evens, Odds);
8918 // Check for SSSE3 which lets us lower all v16i8 shuffles much more directly
8919 // with PSHUFB. It is important to do this before we attempt to generate any
8920 // blends but after all of the single-input lowerings. If the single input
8921 // lowerings can find an instruction sequence that is faster than a PSHUFB, we
8922 // want to preserve that and we can DAG combine any longer sequences into
8923 // a PSHUFB in the end. But once we start blending from multiple inputs,
8924 // the complexity of DAG combining bad patterns back into PSHUFB is too high,
8925 // and there are *very* few patterns that would actually be faster than the
8926 // PSHUFB approach because of its ability to zero lanes.
8928 // FIXME: The only exceptions to the above are blends which are exact
8929 // interleavings with direct instructions supporting them. We currently don't
8930 // handle those well here.
8931 if (Subtarget->hasSSSE3()) {
8934 for (int i = 0; i < 16; ++i)
8935 if (Mask[i] == -1) {
8936 V1Mask[i] = V2Mask[i] = DAG.getConstant(0x80, MVT::i8);
8938 V1Mask[i] = DAG.getConstant(Mask[i] < 16 ? Mask[i] : 0x80, MVT::i8);
8940 DAG.getConstant(Mask[i] < 16 ? 0x80 : Mask[i] - 16, MVT::i8);
8942 V1 = DAG.getNode(X86ISD::PSHUFB, DL, MVT::v16i8, V1,
8943 DAG.getNode(ISD::BUILD_VECTOR, DL, MVT::v16i8, V1Mask));
8944 if (isSingleInputShuffleMask(Mask))
8945 return V1; // Single inputs are easy.
8947 // Otherwise, blend the two.
8948 V2 = DAG.getNode(X86ISD::PSHUFB, DL, MVT::v16i8, V2,
8949 DAG.getNode(ISD::BUILD_VECTOR, DL, MVT::v16i8, V2Mask));
8950 return DAG.getNode(ISD::OR, DL, MVT::v16i8, V1, V2);
8953 // There are special ways we can lower some single-element blends.
8954 if (NumV2Elements == 1)
8955 if (SDValue V = lowerVectorShuffleAsElementInsertion(MVT::v16i8, DL, V1, V2,
8956 Mask, Subtarget, DAG))
8959 // Check whether a compaction lowering can be done. This handles shuffles
8960 // which take every Nth element for some even N. See the helper function for
8963 // We special case these as they can be particularly efficiently handled with
8964 // the PACKUSB instruction on x86 and they show up in common patterns of
8965 // rearranging bytes to truncate wide elements.
8966 if (int NumEvenDrops = canLowerByDroppingEvenElements(Mask)) {
8967 // NumEvenDrops is the power of two stride of the elements. Another way of
8968 // thinking about it is that we need to drop the even elements this many
8969 // times to get the original input.
8970 bool IsSingleInput = isSingleInputShuffleMask(Mask);
8972 // First we need to zero all the dropped bytes.
8973 assert(NumEvenDrops <= 3 &&
8974 "No support for dropping even elements more than 3 times.");
8975 // We use the mask type to pick which bytes are preserved based on how many
8976 // elements are dropped.
8977 MVT MaskVTs[] = { MVT::v8i16, MVT::v4i32, MVT::v2i64 };
8978 SDValue ByteClearMask =
8979 DAG.getNode(ISD::BITCAST, DL, MVT::v16i8,
8980 DAG.getConstant(0xFF, MaskVTs[NumEvenDrops - 1]));
8981 V1 = DAG.getNode(ISD::AND, DL, MVT::v16i8, V1, ByteClearMask);
8983 V2 = DAG.getNode(ISD::AND, DL, MVT::v16i8, V2, ByteClearMask);
8985 // Now pack things back together.
8986 V1 = DAG.getNode(ISD::BITCAST, DL, MVT::v8i16, V1);
8987 V2 = IsSingleInput ? V1 : DAG.getNode(ISD::BITCAST, DL, MVT::v8i16, V2);
8988 SDValue Result = DAG.getNode(X86ISD::PACKUS, DL, MVT::v16i8, V1, V2);
8989 for (int i = 1; i < NumEvenDrops; ++i) {
8990 Result = DAG.getNode(ISD::BITCAST, DL, MVT::v8i16, Result);
8991 Result = DAG.getNode(X86ISD::PACKUS, DL, MVT::v16i8, Result, Result);
8997 int V1LoBlendMask[8] = {-1, -1, -1, -1, -1, -1, -1, -1};
8998 int V1HiBlendMask[8] = {-1, -1, -1, -1, -1, -1, -1, -1};
8999 int V2LoBlendMask[8] = {-1, -1, -1, -1, -1, -1, -1, -1};
9000 int V2HiBlendMask[8] = {-1, -1, -1, -1, -1, -1, -1, -1};
9002 auto buildBlendMasks = [](MutableArrayRef<int> HalfMask,
9003 MutableArrayRef<int> V1HalfBlendMask,
9004 MutableArrayRef<int> V2HalfBlendMask) {
9005 for (int i = 0; i < 8; ++i)
9006 if (HalfMask[i] >= 0 && HalfMask[i] < 16) {
9007 V1HalfBlendMask[i] = HalfMask[i];
9009 } else if (HalfMask[i] >= 16) {
9010 V2HalfBlendMask[i] = HalfMask[i] - 16;
9011 HalfMask[i] = i + 8;
9014 buildBlendMasks(LoMask, V1LoBlendMask, V2LoBlendMask);
9015 buildBlendMasks(HiMask, V1HiBlendMask, V2HiBlendMask);
9017 SDValue Zero = getZeroVector(MVT::v8i16, Subtarget, DAG, DL);
9019 auto buildLoAndHiV8s = [&](SDValue V, MutableArrayRef<int> LoBlendMask,
9020 MutableArrayRef<int> HiBlendMask) {
9022 // Check if any of the odd lanes in the v16i8 are used. If not, we can mask
9023 // them out and avoid using UNPCK{L,H} to extract the elements of V as
9025 if (std::none_of(LoBlendMask.begin(), LoBlendMask.end(),
9026 [](int M) { return M >= 0 && M % 2 == 1; }) &&
9027 std::none_of(HiBlendMask.begin(), HiBlendMask.end(),
9028 [](int M) { return M >= 0 && M % 2 == 1; })) {
9029 // Use a mask to drop the high bytes.
9030 V1 = DAG.getNode(ISD::BITCAST, DL, MVT::v8i16, V);
9031 V1 = DAG.getNode(ISD::AND, DL, MVT::v8i16, V1,
9032 DAG.getConstant(0x00FF, MVT::v8i16));
9034 // This will be a single vector shuffle instead of a blend so nuke V2.
9035 V2 = DAG.getUNDEF(MVT::v8i16);
9037 // Squash the masks to point directly into V1.
9038 for (int &M : LoBlendMask)
9041 for (int &M : HiBlendMask)
9045 // Otherwise just unpack the low half of V into V1 and the high half into
9046 // V2 so that we can blend them as i16s.
9047 V1 = DAG.getNode(ISD::BITCAST, DL, MVT::v8i16,
9048 DAG.getNode(X86ISD::UNPCKL, DL, MVT::v16i8, V, Zero));
9049 V2 = DAG.getNode(ISD::BITCAST, DL, MVT::v8i16,
9050 DAG.getNode(X86ISD::UNPCKH, DL, MVT::v16i8, V, Zero));
9053 SDValue BlendedLo = DAG.getVectorShuffle(MVT::v8i16, DL, V1, V2, LoBlendMask);
9054 SDValue BlendedHi = DAG.getVectorShuffle(MVT::v8i16, DL, V1, V2, HiBlendMask);
9055 return std::make_pair(BlendedLo, BlendedHi);
9057 SDValue V1Lo, V1Hi, V2Lo, V2Hi;
9058 std::tie(V1Lo, V1Hi) = buildLoAndHiV8s(V1, V1LoBlendMask, V1HiBlendMask);
9059 std::tie(V2Lo, V2Hi) = buildLoAndHiV8s(V2, V2LoBlendMask, V2HiBlendMask);
9061 SDValue LoV = DAG.getVectorShuffle(MVT::v8i16, DL, V1Lo, V2Lo, LoMask);
9062 SDValue HiV = DAG.getVectorShuffle(MVT::v8i16, DL, V1Hi, V2Hi, HiMask);
9064 return DAG.getNode(X86ISD::PACKUS, DL, MVT::v16i8, LoV, HiV);
9067 /// \brief Dispatching routine to lower various 128-bit x86 vector shuffles.
9069 /// This routine breaks down the specific type of 128-bit shuffle and
9070 /// dispatches to the lowering routines accordingly.
9071 static SDValue lower128BitVectorShuffle(SDValue Op, SDValue V1, SDValue V2,
9072 MVT VT, const X86Subtarget *Subtarget,
9073 SelectionDAG &DAG) {
9074 switch (VT.SimpleTy) {
9076 return lowerV2I64VectorShuffle(Op, V1, V2, Subtarget, DAG);
9078 return lowerV2F64VectorShuffle(Op, V1, V2, Subtarget, DAG);
9080 return lowerV4I32VectorShuffle(Op, V1, V2, Subtarget, DAG);
9082 return lowerV4F32VectorShuffle(Op, V1, V2, Subtarget, DAG);
9084 return lowerV8I16VectorShuffle(Op, V1, V2, Subtarget, DAG);
9086 return lowerV16I8VectorShuffle(Op, V1, V2, Subtarget, DAG);
9089 llvm_unreachable("Unimplemented!");
9093 static bool isHalfCrossingShuffleMask(ArrayRef<int> Mask) {
9094 int Size = Mask.size();
9095 for (int M : Mask.slice(0, Size / 2))
9096 if (M >= 0 && (M % Size) >= Size / 2)
9098 for (int M : Mask.slice(Size / 2, Size / 2))
9099 if (M >= 0 && (M % Size) < Size / 2)
9104 /// \brief Generic routine to split a 256-bit vector shuffle into 128-bit
9107 /// There is a severely limited set of shuffles available in AVX1 for 256-bit
9108 /// vectors resulting in routinely needing to split the shuffle into two 128-bit
9109 /// shuffles. This can be done generically for any 256-bit vector shuffle and so
9110 /// we encode the logic here for specific shuffle lowering routines to bail to
9111 /// when they exhaust the features avaible to more directly handle the shuffle.
9112 static SDValue splitAndLower256BitVectorShuffle(SDValue Op, SDValue V1,
9114 const X86Subtarget *Subtarget,
9115 SelectionDAG &DAG) {
9117 MVT VT = Op.getSimpleValueType();
9118 assert(VT.getSizeInBits() == 256 && "Only for 256-bit vector shuffles!");
9119 assert(V1.getSimpleValueType() == VT && "Bad operand type!");
9120 assert(V2.getSimpleValueType() == VT && "Bad operand type!");
9121 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
9122 ArrayRef<int> Mask = SVOp->getMask();
9124 ArrayRef<int> LoMask = Mask.slice(0, Mask.size()/2);
9125 ArrayRef<int> HiMask = Mask.slice(Mask.size()/2);
9127 int NumElements = VT.getVectorNumElements();
9128 int SplitNumElements = NumElements / 2;
9129 MVT ScalarVT = VT.getScalarType();
9130 MVT SplitVT = MVT::getVectorVT(ScalarVT, NumElements / 2);
9132 SDValue LoV1 = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, SplitVT, V1,
9133 DAG.getIntPtrConstant(0));
9134 SDValue HiV1 = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, SplitVT, V1,
9135 DAG.getIntPtrConstant(SplitNumElements));
9136 SDValue LoV2 = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, SplitVT, V2,
9137 DAG.getIntPtrConstant(0));
9138 SDValue HiV2 = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, SplitVT, V2,
9139 DAG.getIntPtrConstant(SplitNumElements));
9141 // Now create two 4-way blends of these half-width vectors.
9142 auto HalfBlend = [&](ArrayRef<int> HalfMask) {
9143 SmallVector<int, 16> V1BlendMask, V2BlendMask, BlendMask;
9144 for (int i = 0; i < SplitNumElements; ++i) {
9145 int M = HalfMask[i];
9146 if (M >= NumElements) {
9147 V2BlendMask.push_back(M - NumElements);
9148 V1BlendMask.push_back(-1);
9149 BlendMask.push_back(SplitNumElements + i);
9150 } else if (M >= 0) {
9151 V2BlendMask.push_back(-1);
9152 V1BlendMask.push_back(M);
9153 BlendMask.push_back(i);
9155 V2BlendMask.push_back(-1);
9156 V1BlendMask.push_back(-1);
9157 BlendMask.push_back(-1);
9160 SDValue V1Blend = DAG.getVectorShuffle(SplitVT, DL, LoV1, HiV1, V1BlendMask);
9161 SDValue V2Blend = DAG.getVectorShuffle(SplitVT, DL, LoV2, HiV2, V2BlendMask);
9162 return DAG.getVectorShuffle(SplitVT, DL, V1Blend, V2Blend, BlendMask);
9164 SDValue Lo = HalfBlend(LoMask);
9165 SDValue Hi = HalfBlend(HiMask);
9166 return DAG.getNode(ISD::CONCAT_VECTORS, DL, VT, Lo, Hi);
9169 /// \brief Handle lowering of 4-lane 64-bit floating point shuffles.
9171 /// Also ends up handling lowering of 4-lane 64-bit integer shuffles when AVX2
9172 /// isn't available.
9173 static SDValue lowerV4F64VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
9174 const X86Subtarget *Subtarget,
9175 SelectionDAG &DAG) {
9177 assert(V1.getSimpleValueType() == MVT::v4f64 && "Bad operand type!");
9178 assert(V2.getSimpleValueType() == MVT::v4f64 && "Bad operand type!");
9179 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
9180 ArrayRef<int> Mask = SVOp->getMask();
9181 assert(Mask.size() == 4 && "Unexpected mask size for v4 shuffle!");
9183 // FIXME: If we have AVX2, we should delegate to generic code as crossing
9184 // shuffles aren't a problem and FP and int have the same patterns.
9186 // FIXME: We can handle these more cleverly than splitting for v4f64.
9187 if (isHalfCrossingShuffleMask(Mask))
9188 return splitAndLower256BitVectorShuffle(Op, V1, V2, Subtarget, DAG);
9190 if (isSingleInputShuffleMask(Mask)) {
9191 // Non-half-crossing single input shuffles can be lowerid with an
9192 // interleaved permutation.
9193 unsigned VPERMILPMask = (Mask[0] == 1) | ((Mask[1] == 1) << 1) |
9194 ((Mask[2] == 3) << 2) | ((Mask[3] == 3) << 3);
9195 return DAG.getNode(X86ISD::VPERMILP, DL, MVT::v4f64, V1,
9196 DAG.getConstant(VPERMILPMask, MVT::i8));
9199 // X86 has dedicated unpack instructions that can handle specific blend
9200 // operations: UNPCKH and UNPCKL.
9201 if (isShuffleEquivalent(Mask, 0, 4, 2, 6))
9202 return DAG.getNode(X86ISD::UNPCKL, DL, MVT::v4f64, V1, V2);
9203 if (isShuffleEquivalent(Mask, 1, 5, 3, 7))
9204 return DAG.getNode(X86ISD::UNPCKH, DL, MVT::v4f64, V1, V2);
9205 // FIXME: It would be nice to find a way to get canonicalization to commute
9207 if (isShuffleEquivalent(Mask, 4, 0, 6, 2))
9208 return DAG.getNode(X86ISD::UNPCKL, DL, MVT::v4f64, V2, V1);
9209 if (isShuffleEquivalent(Mask, 5, 1, 7, 3))
9210 return DAG.getNode(X86ISD::UNPCKH, DL, MVT::v4f64, V2, V1);
9212 // Check if the blend happens to exactly fit that of SHUFPD.
9213 if (Mask[0] < 4 && (Mask[1] == -1 || Mask[1] >= 4) &&
9214 Mask[2] < 4 && (Mask[3] == -1 || Mask[3] >= 4)) {
9215 unsigned SHUFPDMask = (Mask[0] == 1) | ((Mask[1] == 5) << 1) |
9216 ((Mask[2] == 3) << 2) | ((Mask[3] == 7) << 3);
9217 return DAG.getNode(X86ISD::SHUFP, DL, MVT::v4f64, V1, V2,
9218 DAG.getConstant(SHUFPDMask, MVT::i8));
9220 if ((Mask[0] == -1 || Mask[0] >= 4) && Mask[1] < 4 &&
9221 (Mask[2] == -1 || Mask[2] >= 4) && Mask[3] < 4) {
9222 unsigned SHUFPDMask = (Mask[0] == 5) | ((Mask[1] == 1) << 1) |
9223 ((Mask[2] == 7) << 2) | ((Mask[3] == 3) << 3);
9224 return DAG.getNode(X86ISD::SHUFP, DL, MVT::v4f64, V2, V1,
9225 DAG.getConstant(SHUFPDMask, MVT::i8));
9228 // Shuffle the input elements into the desired positions in V1 and V2 and
9229 // blend them together.
9230 int V1Mask[] = {-1, -1, -1, -1};
9231 int V2Mask[] = {-1, -1, -1, -1};
9232 for (int i = 0; i < 4; ++i)
9233 if (Mask[i] >= 0 && Mask[i] < 4)
9234 V1Mask[i] = Mask[i];
9235 else if (Mask[i] >= 4)
9236 V2Mask[i] = Mask[i] - 4;
9238 V1 = DAG.getVectorShuffle(MVT::v4f64, DL, V1, DAG.getUNDEF(MVT::v4f64), V1Mask);
9239 V2 = DAG.getVectorShuffle(MVT::v4f64, DL, V2, DAG.getUNDEF(MVT::v4f64), V2Mask);
9241 unsigned BlendMask = 0;
9242 for (int i = 0; i < 4; ++i)
9244 BlendMask |= 1 << i;
9246 return DAG.getNode(X86ISD::BLENDI, DL, MVT::v4f64, V1, V2,
9247 DAG.getConstant(BlendMask, MVT::i8));
9250 /// \brief Handle lowering of 4-lane 64-bit integer shuffles.
9252 /// Largely delegates to common code when we have AVX2 and to the floating-point
9253 /// code when we only have AVX.
9254 static SDValue lowerV4I64VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
9255 const X86Subtarget *Subtarget,
9256 SelectionDAG &DAG) {
9258 assert(Op.getSimpleValueType() == MVT::v4i64 && "Bad shuffle type!");
9259 assert(V1.getSimpleValueType() == MVT::v4i64 && "Bad operand type!");
9260 assert(V2.getSimpleValueType() == MVT::v4i64 && "Bad operand type!");
9261 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
9262 ArrayRef<int> Mask = SVOp->getMask();
9263 assert(Mask.size() == 4 && "Unexpected mask size for v4 shuffle!");
9265 // FIXME: If we have AVX2, we should delegate to generic code as crossing
9266 // shuffles aren't a problem and FP and int have the same patterns.
9268 if (isHalfCrossingShuffleMask(Mask))
9269 return splitAndLower256BitVectorShuffle(Op, V1, V2, Subtarget, DAG);
9271 // AVX1 doesn't provide any facilities for v4i64 shuffles, bitcast and
9272 // delegate to floating point code.
9273 V1 = DAG.getNode(ISD::BITCAST, DL, MVT::v4f64, V1);
9274 V2 = DAG.getNode(ISD::BITCAST, DL, MVT::v4f64, V2);
9275 return DAG.getNode(ISD::BITCAST, DL, MVT::v4i64,
9276 lowerV4F64VectorShuffle(Op, V1, V2, Subtarget, DAG));
9279 /// \brief High-level routine to lower various 256-bit x86 vector shuffles.
9281 /// This routine either breaks down the specific type of a 256-bit x86 vector
9282 /// shuffle or splits it into two 128-bit shuffles and fuses the results back
9283 /// together based on the available instructions.
9284 static SDValue lower256BitVectorShuffle(SDValue Op, SDValue V1, SDValue V2,
9285 MVT VT, const X86Subtarget *Subtarget,
9286 SelectionDAG &DAG) {
9287 switch (VT.SimpleTy) {
9289 return lowerV4F64VectorShuffle(Op, V1, V2, Subtarget, DAG);
9291 return lowerV4I64VectorShuffle(Op, V1, V2, Subtarget, DAG);
9296 // Fall back to the basic pattern of extracting the high half and forming
9298 // FIXME: Add targeted lowering for each type that can document rationale
9299 // for delegating to this when necessary.
9300 return splitAndLower256BitVectorShuffle(Op, V1, V2, Subtarget, DAG);
9303 llvm_unreachable("Not a valid 256-bit x86 vector type!");
9307 /// \brief Tiny helper function to test whether a shuffle mask could be
9308 /// simplified by widening the elements being shuffled.
9309 static bool canWidenShuffleElements(ArrayRef<int> Mask) {
9310 for (int i = 0, Size = Mask.size(); i < Size; i += 2)
9311 if ((Mask[i] != -1 && Mask[i] % 2 != 0) ||
9312 (Mask[i + 1] != -1 && (Mask[i + 1] % 2 != 1 ||
9313 (Mask[i] != -1 && Mask[i] + 1 != Mask[i + 1]))))
9319 /// \brief Top-level lowering for x86 vector shuffles.
9321 /// This handles decomposition, canonicalization, and lowering of all x86
9322 /// vector shuffles. Most of the specific lowering strategies are encapsulated
9323 /// above in helper routines. The canonicalization attempts to widen shuffles
9324 /// to involve fewer lanes of wider elements, consolidate symmetric patterns
9325 /// s.t. only one of the two inputs needs to be tested, etc.
9326 static SDValue lowerVectorShuffle(SDValue Op, const X86Subtarget *Subtarget,
9327 SelectionDAG &DAG) {
9328 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
9329 ArrayRef<int> Mask = SVOp->getMask();
9330 SDValue V1 = Op.getOperand(0);
9331 SDValue V2 = Op.getOperand(1);
9332 MVT VT = Op.getSimpleValueType();
9333 int NumElements = VT.getVectorNumElements();
9336 assert(VT.getSizeInBits() != 64 && "Can't lower MMX shuffles");
9338 bool V1IsUndef = V1.getOpcode() == ISD::UNDEF;
9339 bool V2IsUndef = V2.getOpcode() == ISD::UNDEF;
9340 if (V1IsUndef && V2IsUndef)
9341 return DAG.getUNDEF(VT);
9343 // When we create a shuffle node we put the UNDEF node to second operand,
9344 // but in some cases the first operand may be transformed to UNDEF.
9345 // In this case we should just commute the node.
9347 return DAG.getCommutedVectorShuffle(*SVOp);
9349 // Check for non-undef masks pointing at an undef vector and make the masks
9350 // undef as well. This makes it easier to match the shuffle based solely on
9354 if (M >= NumElements) {
9355 SmallVector<int, 8> NewMask(Mask.begin(), Mask.end());
9356 for (int &M : NewMask)
9357 if (M >= NumElements)
9359 return DAG.getVectorShuffle(VT, dl, V1, V2, NewMask);
9362 // For integer vector shuffles, try to collapse them into a shuffle of fewer
9363 // lanes but wider integers. We cap this to not form integers larger than i64
9364 // but it might be interesting to form i128 integers to handle flipping the
9365 // low and high halves of AVX 256-bit vectors.
9366 if (VT.isInteger() && VT.getScalarSizeInBits() < 64 &&
9367 canWidenShuffleElements(Mask)) {
9368 SmallVector<int, 8> NewMask;
9369 for (int i = 0, Size = Mask.size(); i < Size; i += 2)
9370 NewMask.push_back(Mask[i] != -1
9372 : (Mask[i + 1] != -1 ? Mask[i + 1] / 2 : -1));
9374 MVT::getVectorVT(MVT::getIntegerVT(VT.getScalarSizeInBits() * 2),
9375 VT.getVectorNumElements() / 2);
9376 V1 = DAG.getNode(ISD::BITCAST, dl, NewVT, V1);
9377 V2 = DAG.getNode(ISD::BITCAST, dl, NewVT, V2);
9378 return DAG.getNode(ISD::BITCAST, dl, VT,
9379 DAG.getVectorShuffle(NewVT, dl, V1, V2, NewMask));
9382 int NumV1Elements = 0, NumUndefElements = 0, NumV2Elements = 0;
9383 for (int M : SVOp->getMask())
9386 else if (M < NumElements)
9391 // Commute the shuffle as needed such that more elements come from V1 than
9392 // V2. This allows us to match the shuffle pattern strictly on how many
9393 // elements come from V1 without handling the symmetric cases.
9394 if (NumV2Elements > NumV1Elements)
9395 return DAG.getCommutedVectorShuffle(*SVOp);
9397 // When the number of V1 and V2 elements are the same, try to minimize the
9398 // number of uses of V2 in the low half of the vector.
9399 if (NumV1Elements == NumV2Elements) {
9400 int LowV1Elements = 0, LowV2Elements = 0;
9401 for (int M : SVOp->getMask().slice(0, NumElements / 2))
9402 if (M >= NumElements)
9406 if (LowV2Elements > LowV1Elements)
9407 return DAG.getCommutedVectorShuffle(*SVOp);
9410 // For each vector width, delegate to a specialized lowering routine.
9411 if (VT.getSizeInBits() == 128)
9412 return lower128BitVectorShuffle(Op, V1, V2, VT, Subtarget, DAG);
9414 if (VT.getSizeInBits() == 256)
9415 return lower256BitVectorShuffle(Op, V1, V2, VT, Subtarget, DAG);
9417 llvm_unreachable("Unimplemented!");
9421 //===----------------------------------------------------------------------===//
9422 // Legacy vector shuffle lowering
9424 // This code is the legacy code handling vector shuffles until the above
9425 // replaces its functionality and performance.
9426 //===----------------------------------------------------------------------===//
9428 static bool isBlendMask(ArrayRef<int> MaskVals, MVT VT, bool hasSSE41,
9429 bool hasInt256, unsigned *MaskOut = nullptr) {
9430 MVT EltVT = VT.getVectorElementType();
9432 // There is no blend with immediate in AVX-512.
9433 if (VT.is512BitVector())
9436 if (!hasSSE41 || EltVT == MVT::i8)
9438 if (!hasInt256 && VT == MVT::v16i16)
9441 unsigned MaskValue = 0;
9442 unsigned NumElems = VT.getVectorNumElements();
9443 // There are 2 lanes if (NumElems > 8), and 1 lane otherwise.
9444 unsigned NumLanes = (NumElems - 1) / 8 + 1;
9445 unsigned NumElemsInLane = NumElems / NumLanes;
9447 // Blend for v16i16 should be symetric for the both lanes.
9448 for (unsigned i = 0; i < NumElemsInLane; ++i) {
9450 int SndLaneEltIdx = (NumLanes == 2) ? MaskVals[i + NumElemsInLane] : -1;
9451 int EltIdx = MaskVals[i];
9453 if ((EltIdx < 0 || EltIdx == (int)i) &&
9454 (SndLaneEltIdx < 0 || SndLaneEltIdx == (int)(i + NumElemsInLane)))
9457 if (((unsigned)EltIdx == (i + NumElems)) &&
9458 (SndLaneEltIdx < 0 ||
9459 (unsigned)SndLaneEltIdx == i + NumElems + NumElemsInLane))
9460 MaskValue |= (1 << i);
9466 *MaskOut = MaskValue;
9470 // Try to lower a shuffle node into a simple blend instruction.
9471 // This function assumes isBlendMask returns true for this
9472 // SuffleVectorSDNode
9473 static SDValue LowerVECTOR_SHUFFLEtoBlend(ShuffleVectorSDNode *SVOp,
9475 const X86Subtarget *Subtarget,
9476 SelectionDAG &DAG) {
9477 MVT VT = SVOp->getSimpleValueType(0);
9478 MVT EltVT = VT.getVectorElementType();
9479 assert(isBlendMask(SVOp->getMask(), VT, Subtarget->hasSSE41(),
9480 Subtarget->hasInt256() && "Trying to lower a "
9481 "VECTOR_SHUFFLE to a Blend but "
9482 "with the wrong mask"));
9483 SDValue V1 = SVOp->getOperand(0);
9484 SDValue V2 = SVOp->getOperand(1);
9486 unsigned NumElems = VT.getVectorNumElements();
9488 // Convert i32 vectors to floating point if it is not AVX2.
9489 // AVX2 introduced VPBLENDD instruction for 128 and 256-bit vectors.
9491 if (EltVT == MVT::i64 || (EltVT == MVT::i32 && !Subtarget->hasInt256())) {
9492 BlendVT = MVT::getVectorVT(MVT::getFloatingPointVT(EltVT.getSizeInBits()),
9494 V1 = DAG.getNode(ISD::BITCAST, dl, VT, V1);
9495 V2 = DAG.getNode(ISD::BITCAST, dl, VT, V2);
9498 SDValue Ret = DAG.getNode(X86ISD::BLENDI, dl, BlendVT, V1, V2,
9499 DAG.getConstant(MaskValue, MVT::i32));
9500 return DAG.getNode(ISD::BITCAST, dl, VT, Ret);
9503 /// In vector type \p VT, return true if the element at index \p InputIdx
9504 /// falls on a different 128-bit lane than \p OutputIdx.
9505 static bool ShuffleCrosses128bitLane(MVT VT, unsigned InputIdx,
9506 unsigned OutputIdx) {
9507 unsigned EltSize = VT.getVectorElementType().getSizeInBits();
9508 return InputIdx * EltSize / 128 != OutputIdx * EltSize / 128;
9511 /// Generate a PSHUFB if possible. Selects elements from \p V1 according to
9512 /// \p MaskVals. MaskVals[OutputIdx] = InputIdx specifies that we want to
9513 /// shuffle the element at InputIdx in V1 to OutputIdx in the result. If \p
9514 /// MaskVals refers to elements outside of \p V1 or is undef (-1), insert a
9516 static SDValue getPSHUFB(ArrayRef<int> MaskVals, SDValue V1, SDLoc &dl,
9517 SelectionDAG &DAG) {
9518 MVT VT = V1.getSimpleValueType();
9519 assert(VT.is128BitVector() || VT.is256BitVector());
9521 MVT EltVT = VT.getVectorElementType();
9522 unsigned EltSizeInBytes = EltVT.getSizeInBits() / 8;
9523 unsigned NumElts = VT.getVectorNumElements();
9525 SmallVector<SDValue, 32> PshufbMask;
9526 for (unsigned OutputIdx = 0; OutputIdx < NumElts; ++OutputIdx) {
9527 int InputIdx = MaskVals[OutputIdx];
9528 unsigned InputByteIdx;
9530 if (InputIdx < 0 || NumElts <= (unsigned)InputIdx)
9531 InputByteIdx = 0x80;
9533 // Cross lane is not allowed.
9534 if (ShuffleCrosses128bitLane(VT, InputIdx, OutputIdx))
9536 InputByteIdx = InputIdx * EltSizeInBytes;
9537 // Index is an byte offset within the 128-bit lane.
9538 InputByteIdx &= 0xf;
9541 for (unsigned j = 0; j < EltSizeInBytes; ++j) {
9542 PshufbMask.push_back(DAG.getConstant(InputByteIdx, MVT::i8));
9543 if (InputByteIdx != 0x80)
9548 MVT ShufVT = MVT::getVectorVT(MVT::i8, PshufbMask.size());
9550 V1 = DAG.getNode(ISD::BITCAST, dl, ShufVT, V1);
9551 return DAG.getNode(X86ISD::PSHUFB, dl, ShufVT, V1,
9552 DAG.getNode(ISD::BUILD_VECTOR, dl, ShufVT, PshufbMask));
9555 // v8i16 shuffles - Prefer shuffles in the following order:
9556 // 1. [all] pshuflw, pshufhw, optional move
9557 // 2. [ssse3] 1 x pshufb
9558 // 3. [ssse3] 2 x pshufb + 1 x por
9559 // 4. [all] mov + pshuflw + pshufhw + N x (pextrw + pinsrw)
9561 LowerVECTOR_SHUFFLEv8i16(SDValue Op, const X86Subtarget *Subtarget,
9562 SelectionDAG &DAG) {
9563 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
9564 SDValue V1 = SVOp->getOperand(0);
9565 SDValue V2 = SVOp->getOperand(1);
9567 SmallVector<int, 8> MaskVals;
9569 // Determine if more than 1 of the words in each of the low and high quadwords
9570 // of the result come from the same quadword of one of the two inputs. Undef
9571 // mask values count as coming from any quadword, for better codegen.
9573 // Lo/HiQuad[i] = j indicates how many words from the ith quad of the input
9574 // feeds this quad. For i, 0 and 1 refer to V1, 2 and 3 refer to V2.
9575 unsigned LoQuad[] = { 0, 0, 0, 0 };
9576 unsigned HiQuad[] = { 0, 0, 0, 0 };
9577 // Indices of quads used.
9578 std::bitset<4> InputQuads;
9579 for (unsigned i = 0; i < 8; ++i) {
9580 unsigned *Quad = i < 4 ? LoQuad : HiQuad;
9581 int EltIdx = SVOp->getMaskElt(i);
9582 MaskVals.push_back(EltIdx);
9591 InputQuads.set(EltIdx / 4);
9594 int BestLoQuad = -1;
9595 unsigned MaxQuad = 1;
9596 for (unsigned i = 0; i < 4; ++i) {
9597 if (LoQuad[i] > MaxQuad) {
9599 MaxQuad = LoQuad[i];
9603 int BestHiQuad = -1;
9605 for (unsigned i = 0; i < 4; ++i) {
9606 if (HiQuad[i] > MaxQuad) {
9608 MaxQuad = HiQuad[i];
9612 // For SSSE3, If all 8 words of the result come from only 1 quadword of each
9613 // of the two input vectors, shuffle them into one input vector so only a
9614 // single pshufb instruction is necessary. If there are more than 2 input
9615 // quads, disable the next transformation since it does not help SSSE3.
9616 bool V1Used = InputQuads[0] || InputQuads[1];
9617 bool V2Used = InputQuads[2] || InputQuads[3];
9618 if (Subtarget->hasSSSE3()) {
9619 if (InputQuads.count() == 2 && V1Used && V2Used) {
9620 BestLoQuad = InputQuads[0] ? 0 : 1;
9621 BestHiQuad = InputQuads[2] ? 2 : 3;
9623 if (InputQuads.count() > 2) {
9629 // If BestLoQuad or BestHiQuad are set, shuffle the quads together and update
9630 // the shuffle mask. If a quad is scored as -1, that means that it contains
9631 // words from all 4 input quadwords.
9633 if (BestLoQuad >= 0 || BestHiQuad >= 0) {
9635 BestLoQuad < 0 ? 0 : BestLoQuad,
9636 BestHiQuad < 0 ? 1 : BestHiQuad
9638 NewV = DAG.getVectorShuffle(MVT::v2i64, dl,
9639 DAG.getNode(ISD::BITCAST, dl, MVT::v2i64, V1),
9640 DAG.getNode(ISD::BITCAST, dl, MVT::v2i64, V2), &MaskV[0]);
9641 NewV = DAG.getNode(ISD::BITCAST, dl, MVT::v8i16, NewV);
9643 // Rewrite the MaskVals and assign NewV to V1 if NewV now contains all the
9644 // source words for the shuffle, to aid later transformations.
9645 bool AllWordsInNewV = true;
9646 bool InOrder[2] = { true, true };
9647 for (unsigned i = 0; i != 8; ++i) {
9648 int idx = MaskVals[i];
9650 InOrder[i/4] = false;
9651 if (idx < 0 || (idx/4) == BestLoQuad || (idx/4) == BestHiQuad)
9653 AllWordsInNewV = false;
9657 bool pshuflw = AllWordsInNewV, pshufhw = AllWordsInNewV;
9658 if (AllWordsInNewV) {
9659 for (int i = 0; i != 8; ++i) {
9660 int idx = MaskVals[i];
9663 idx = MaskVals[i] = (idx / 4) == BestLoQuad ? (idx & 3) : (idx & 3) + 4;
9664 if ((idx != i) && idx < 4)
9666 if ((idx != i) && idx > 3)
9675 // If we've eliminated the use of V2, and the new mask is a pshuflw or
9676 // pshufhw, that's as cheap as it gets. Return the new shuffle.
9677 if ((pshufhw && InOrder[0]) || (pshuflw && InOrder[1])) {
9678 unsigned Opc = pshufhw ? X86ISD::PSHUFHW : X86ISD::PSHUFLW;
9679 unsigned TargetMask = 0;
9680 NewV = DAG.getVectorShuffle(MVT::v8i16, dl, NewV,
9681 DAG.getUNDEF(MVT::v8i16), &MaskVals[0]);
9682 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(NewV.getNode());
9683 TargetMask = pshufhw ? getShufflePSHUFHWImmediate(SVOp):
9684 getShufflePSHUFLWImmediate(SVOp);
9685 V1 = NewV.getOperand(0);
9686 return getTargetShuffleNode(Opc, dl, MVT::v8i16, V1, TargetMask, DAG);
9690 // Promote splats to a larger type which usually leads to more efficient code.
9691 // FIXME: Is this true if pshufb is available?
9692 if (SVOp->isSplat())
9693 return PromoteSplat(SVOp, DAG);
9695 // If we have SSSE3, and all words of the result are from 1 input vector,
9696 // case 2 is generated, otherwise case 3 is generated. If no SSSE3
9697 // is present, fall back to case 4.
9698 if (Subtarget->hasSSSE3()) {
9699 SmallVector<SDValue,16> pshufbMask;
9701 // If we have elements from both input vectors, set the high bit of the
9702 // shuffle mask element to zero out elements that come from V2 in the V1
9703 // mask, and elements that come from V1 in the V2 mask, so that the two
9704 // results can be OR'd together.
9705 bool TwoInputs = V1Used && V2Used;
9706 V1 = getPSHUFB(MaskVals, V1, dl, DAG);
9708 return DAG.getNode(ISD::BITCAST, dl, MVT::v8i16, V1);
9710 // Calculate the shuffle mask for the second input, shuffle it, and
9711 // OR it with the first shuffled input.
9712 CommuteVectorShuffleMask(MaskVals, 8);
9713 V2 = getPSHUFB(MaskVals, V2, dl, DAG);
9714 V1 = DAG.getNode(ISD::OR, dl, MVT::v16i8, V1, V2);
9715 return DAG.getNode(ISD::BITCAST, dl, MVT::v8i16, V1);
9718 // If BestLoQuad >= 0, generate a pshuflw to put the low elements in order,
9719 // and update MaskVals with new element order.
9720 std::bitset<8> InOrder;
9721 if (BestLoQuad >= 0) {
9722 int MaskV[] = { -1, -1, -1, -1, 4, 5, 6, 7 };
9723 for (int i = 0; i != 4; ++i) {
9724 int idx = MaskVals[i];
9727 } else if ((idx / 4) == BestLoQuad) {
9732 NewV = DAG.getVectorShuffle(MVT::v8i16, dl, NewV, DAG.getUNDEF(MVT::v8i16),
9735 if (NewV.getOpcode() == ISD::VECTOR_SHUFFLE && Subtarget->hasSSE2()) {
9736 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(NewV.getNode());
9737 NewV = getTargetShuffleNode(X86ISD::PSHUFLW, dl, MVT::v8i16,
9739 getShufflePSHUFLWImmediate(SVOp), DAG);
9743 // If BestHi >= 0, generate a pshufhw to put the high elements in order,
9744 // and update MaskVals with the new element order.
9745 if (BestHiQuad >= 0) {
9746 int MaskV[] = { 0, 1, 2, 3, -1, -1, -1, -1 };
9747 for (unsigned i = 4; i != 8; ++i) {
9748 int idx = MaskVals[i];
9751 } else if ((idx / 4) == BestHiQuad) {
9752 MaskV[i] = (idx & 3) + 4;
9756 NewV = DAG.getVectorShuffle(MVT::v8i16, dl, NewV, DAG.getUNDEF(MVT::v8i16),
9759 if (NewV.getOpcode() == ISD::VECTOR_SHUFFLE && Subtarget->hasSSE2()) {
9760 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(NewV.getNode());
9761 NewV = getTargetShuffleNode(X86ISD::PSHUFHW, dl, MVT::v8i16,
9763 getShufflePSHUFHWImmediate(SVOp), DAG);
9767 // In case BestHi & BestLo were both -1, which means each quadword has a word
9768 // from each of the four input quadwords, calculate the InOrder bitvector now
9769 // before falling through to the insert/extract cleanup.
9770 if (BestLoQuad == -1 && BestHiQuad == -1) {
9772 for (int i = 0; i != 8; ++i)
9773 if (MaskVals[i] < 0 || MaskVals[i] == i)
9777 // The other elements are put in the right place using pextrw and pinsrw.
9778 for (unsigned i = 0; i != 8; ++i) {
9781 int EltIdx = MaskVals[i];
9784 SDValue ExtOp = (EltIdx < 8) ?
9785 DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::i16, V1,
9786 DAG.getIntPtrConstant(EltIdx)) :
9787 DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::i16, V2,
9788 DAG.getIntPtrConstant(EltIdx - 8));
9789 NewV = DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, MVT::v8i16, NewV, ExtOp,
9790 DAG.getIntPtrConstant(i));
9795 /// \brief v16i16 shuffles
9797 /// FIXME: We only support generation of a single pshufb currently. We can
9798 /// generalize the other applicable cases from LowerVECTOR_SHUFFLEv8i16 as
9799 /// well (e.g 2 x pshufb + 1 x por).
9801 LowerVECTOR_SHUFFLEv16i16(SDValue Op, SelectionDAG &DAG) {
9802 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
9803 SDValue V1 = SVOp->getOperand(0);
9804 SDValue V2 = SVOp->getOperand(1);
9807 if (V2.getOpcode() != ISD::UNDEF)
9810 SmallVector<int, 16> MaskVals(SVOp->getMask().begin(), SVOp->getMask().end());
9811 return getPSHUFB(MaskVals, V1, dl, DAG);
9814 // v16i8 shuffles - Prefer shuffles in the following order:
9815 // 1. [ssse3] 1 x pshufb
9816 // 2. [ssse3] 2 x pshufb + 1 x por
9817 // 3. [all] v8i16 shuffle + N x pextrw + rotate + pinsrw
9818 static SDValue LowerVECTOR_SHUFFLEv16i8(ShuffleVectorSDNode *SVOp,
9819 const X86Subtarget* Subtarget,
9820 SelectionDAG &DAG) {
9821 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
9822 SDValue V1 = SVOp->getOperand(0);
9823 SDValue V2 = SVOp->getOperand(1);
9825 ArrayRef<int> MaskVals = SVOp->getMask();
9827 // Promote splats to a larger type which usually leads to more efficient code.
9828 // FIXME: Is this true if pshufb is available?
9829 if (SVOp->isSplat())
9830 return PromoteSplat(SVOp, DAG);
9832 // If we have SSSE3, case 1 is generated when all result bytes come from
9833 // one of the inputs. Otherwise, case 2 is generated. If no SSSE3 is
9834 // present, fall back to case 3.
9836 // If SSSE3, use 1 pshufb instruction per vector with elements in the result.
9837 if (Subtarget->hasSSSE3()) {
9838 SmallVector<SDValue,16> pshufbMask;
9840 // If all result elements are from one input vector, then only translate
9841 // undef mask values to 0x80 (zero out result) in the pshufb mask.
9843 // Otherwise, we have elements from both input vectors, and must zero out
9844 // elements that come from V2 in the first mask, and V1 in the second mask
9845 // so that we can OR them together.
9846 for (unsigned i = 0; i != 16; ++i) {
9847 int EltIdx = MaskVals[i];
9848 if (EltIdx < 0 || EltIdx >= 16)
9850 pshufbMask.push_back(DAG.getConstant(EltIdx, MVT::i8));
9852 V1 = DAG.getNode(X86ISD::PSHUFB, dl, MVT::v16i8, V1,
9853 DAG.getNode(ISD::BUILD_VECTOR, dl,
9854 MVT::v16i8, pshufbMask));
9856 // As PSHUFB will zero elements with negative indices, it's safe to ignore
9857 // the 2nd operand if it's undefined or zero.
9858 if (V2.getOpcode() == ISD::UNDEF ||
9859 ISD::isBuildVectorAllZeros(V2.getNode()))
9862 // Calculate the shuffle mask for the second input, shuffle it, and
9863 // OR it with the first shuffled input.
9865 for (unsigned i = 0; i != 16; ++i) {
9866 int EltIdx = MaskVals[i];
9867 EltIdx = (EltIdx < 16) ? 0x80 : EltIdx - 16;
9868 pshufbMask.push_back(DAG.getConstant(EltIdx, MVT::i8));
9870 V2 = DAG.getNode(X86ISD::PSHUFB, dl, MVT::v16i8, V2,
9871 DAG.getNode(ISD::BUILD_VECTOR, dl,
9872 MVT::v16i8, pshufbMask));
9873 return DAG.getNode(ISD::OR, dl, MVT::v16i8, V1, V2);
9876 // No SSSE3 - Calculate in place words and then fix all out of place words
9877 // With 0-16 extracts & inserts. Worst case is 16 bytes out of order from
9878 // the 16 different words that comprise the two doublequadword input vectors.
9879 V1 = DAG.getNode(ISD::BITCAST, dl, MVT::v8i16, V1);
9880 V2 = DAG.getNode(ISD::BITCAST, dl, MVT::v8i16, V2);
9882 for (int i = 0; i != 8; ++i) {
9883 int Elt0 = MaskVals[i*2];
9884 int Elt1 = MaskVals[i*2+1];
9886 // This word of the result is all undef, skip it.
9887 if (Elt0 < 0 && Elt1 < 0)
9890 // This word of the result is already in the correct place, skip it.
9891 if ((Elt0 == i*2) && (Elt1 == i*2+1))
9894 SDValue Elt0Src = Elt0 < 16 ? V1 : V2;
9895 SDValue Elt1Src = Elt1 < 16 ? V1 : V2;
9898 // If Elt0 and Elt1 are defined, are consecutive, and can be load
9899 // using a single extract together, load it and store it.
9900 if ((Elt0 >= 0) && ((Elt0 + 1) == Elt1) && ((Elt0 & 1) == 0)) {
9901 InsElt = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::i16, Elt1Src,
9902 DAG.getIntPtrConstant(Elt1 / 2));
9903 NewV = DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, MVT::v8i16, NewV, InsElt,
9904 DAG.getIntPtrConstant(i));
9908 // If Elt1 is defined, extract it from the appropriate source. If the
9909 // source byte is not also odd, shift the extracted word left 8 bits
9910 // otherwise clear the bottom 8 bits if we need to do an or.
9912 InsElt = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::i16, Elt1Src,
9913 DAG.getIntPtrConstant(Elt1 / 2));
9914 if ((Elt1 & 1) == 0)
9915 InsElt = DAG.getNode(ISD::SHL, dl, MVT::i16, InsElt,
9917 TLI.getShiftAmountTy(InsElt.getValueType())));
9919 InsElt = DAG.getNode(ISD::AND, dl, MVT::i16, InsElt,
9920 DAG.getConstant(0xFF00, MVT::i16));
9922 // If Elt0 is defined, extract it from the appropriate source. If the
9923 // source byte is not also even, shift the extracted word right 8 bits. If
9924 // Elt1 was also defined, OR the extracted values together before
9925 // inserting them in the result.
9927 SDValue InsElt0 = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::i16,
9928 Elt0Src, DAG.getIntPtrConstant(Elt0 / 2));
9929 if ((Elt0 & 1) != 0)
9930 InsElt0 = DAG.getNode(ISD::SRL, dl, MVT::i16, InsElt0,
9932 TLI.getShiftAmountTy(InsElt0.getValueType())));
9934 InsElt0 = DAG.getNode(ISD::AND, dl, MVT::i16, InsElt0,
9935 DAG.getConstant(0x00FF, MVT::i16));
9936 InsElt = Elt1 >= 0 ? DAG.getNode(ISD::OR, dl, MVT::i16, InsElt, InsElt0)
9939 NewV = DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, MVT::v8i16, NewV, InsElt,
9940 DAG.getIntPtrConstant(i));
9942 return DAG.getNode(ISD::BITCAST, dl, MVT::v16i8, NewV);
9945 // v32i8 shuffles - Translate to VPSHUFB if possible.
9947 SDValue LowerVECTOR_SHUFFLEv32i8(ShuffleVectorSDNode *SVOp,
9948 const X86Subtarget *Subtarget,
9949 SelectionDAG &DAG) {
9950 MVT VT = SVOp->getSimpleValueType(0);
9951 SDValue V1 = SVOp->getOperand(0);
9952 SDValue V2 = SVOp->getOperand(1);
9954 SmallVector<int, 32> MaskVals(SVOp->getMask().begin(), SVOp->getMask().end());
9956 bool V2IsUndef = V2.getOpcode() == ISD::UNDEF;
9957 bool V1IsAllZero = ISD::isBuildVectorAllZeros(V1.getNode());
9958 bool V2IsAllZero = ISD::isBuildVectorAllZeros(V2.getNode());
9960 // VPSHUFB may be generated if
9961 // (1) one of input vector is undefined or zeroinitializer.
9962 // The mask value 0x80 puts 0 in the corresponding slot of the vector.
9963 // And (2) the mask indexes don't cross the 128-bit lane.
9964 if (VT != MVT::v32i8 || !Subtarget->hasInt256() ||
9965 (!V2IsUndef && !V2IsAllZero && !V1IsAllZero))
9968 if (V1IsAllZero && !V2IsAllZero) {
9969 CommuteVectorShuffleMask(MaskVals, 32);
9972 return getPSHUFB(MaskVals, V1, dl, DAG);
9975 /// RewriteAsNarrowerShuffle - Try rewriting v8i16 and v16i8 shuffles as 4 wide
9976 /// ones, or rewriting v4i32 / v4f32 as 2 wide ones if possible. This can be
9977 /// done when every pair / quad of shuffle mask elements point to elements in
9978 /// the right sequence. e.g.
9979 /// vector_shuffle X, Y, <2, 3, | 10, 11, | 0, 1, | 14, 15>
9981 SDValue RewriteAsNarrowerShuffle(ShuffleVectorSDNode *SVOp,
9982 SelectionDAG &DAG) {
9983 MVT VT = SVOp->getSimpleValueType(0);
9985 unsigned NumElems = VT.getVectorNumElements();
9988 switch (VT.SimpleTy) {
9989 default: llvm_unreachable("Unexpected!");
9992 return SDValue(SVOp, 0);
9993 case MVT::v4f32: NewVT = MVT::v2f64; Scale = 2; break;
9994 case MVT::v4i32: NewVT = MVT::v2i64; Scale = 2; break;
9995 case MVT::v8i16: NewVT = MVT::v4i32; Scale = 2; break;
9996 case MVT::v16i8: NewVT = MVT::v4i32; Scale = 4; break;
9997 case MVT::v16i16: NewVT = MVT::v8i32; Scale = 2; break;
9998 case MVT::v32i8: NewVT = MVT::v8i32; Scale = 4; break;
10001 SmallVector<int, 8> MaskVec;
10002 for (unsigned i = 0; i != NumElems; i += Scale) {
10004 for (unsigned j = 0; j != Scale; ++j) {
10005 int EltIdx = SVOp->getMaskElt(i+j);
10009 StartIdx = (EltIdx / Scale);
10010 if (EltIdx != (int)(StartIdx*Scale + j))
10013 MaskVec.push_back(StartIdx);
10016 SDValue V1 = DAG.getNode(ISD::BITCAST, dl, NewVT, SVOp->getOperand(0));
10017 SDValue V2 = DAG.getNode(ISD::BITCAST, dl, NewVT, SVOp->getOperand(1));
10018 return DAG.getVectorShuffle(NewVT, dl, V1, V2, &MaskVec[0]);
10021 /// getVZextMovL - Return a zero-extending vector move low node.
10023 static SDValue getVZextMovL(MVT VT, MVT OpVT,
10024 SDValue SrcOp, SelectionDAG &DAG,
10025 const X86Subtarget *Subtarget, SDLoc dl) {
10026 if (VT == MVT::v2f64 || VT == MVT::v4f32) {
10027 LoadSDNode *LD = nullptr;
10028 if (!isScalarLoadToVector(SrcOp.getNode(), &LD))
10029 LD = dyn_cast<LoadSDNode>(SrcOp);
10031 // movssrr and movsdrr do not clear top bits. Try to use movd, movq
10033 MVT ExtVT = (OpVT == MVT::v2f64) ? MVT::i64 : MVT::i32;
10034 if ((ExtVT != MVT::i64 || Subtarget->is64Bit()) &&
10035 SrcOp.getOpcode() == ISD::SCALAR_TO_VECTOR &&
10036 SrcOp.getOperand(0).getOpcode() == ISD::BITCAST &&
10037 SrcOp.getOperand(0).getOperand(0).getValueType() == ExtVT) {
10039 OpVT = (OpVT == MVT::v2f64) ? MVT::v2i64 : MVT::v4i32;
10040 return DAG.getNode(ISD::BITCAST, dl, VT,
10041 DAG.getNode(X86ISD::VZEXT_MOVL, dl, OpVT,
10042 DAG.getNode(ISD::SCALAR_TO_VECTOR, dl,
10044 SrcOp.getOperand(0)
10050 return DAG.getNode(ISD::BITCAST, dl, VT,
10051 DAG.getNode(X86ISD::VZEXT_MOVL, dl, OpVT,
10052 DAG.getNode(ISD::BITCAST, dl,
10056 /// LowerVECTOR_SHUFFLE_256 - Handle all 256-bit wide vectors shuffles
10057 /// which could not be matched by any known target speficic shuffle
10059 LowerVECTOR_SHUFFLE_256(ShuffleVectorSDNode *SVOp, SelectionDAG &DAG) {
10061 SDValue NewOp = Compact8x32ShuffleNode(SVOp, DAG);
10062 if (NewOp.getNode())
10065 MVT VT = SVOp->getSimpleValueType(0);
10067 unsigned NumElems = VT.getVectorNumElements();
10068 unsigned NumLaneElems = NumElems / 2;
10071 MVT EltVT = VT.getVectorElementType();
10072 MVT NVT = MVT::getVectorVT(EltVT, NumLaneElems);
10075 SmallVector<int, 16> Mask;
10076 for (unsigned l = 0; l < 2; ++l) {
10077 // Build a shuffle mask for the output, discovering on the fly which
10078 // input vectors to use as shuffle operands (recorded in InputUsed).
10079 // If building a suitable shuffle vector proves too hard, then bail
10080 // out with UseBuildVector set.
10081 bool UseBuildVector = false;
10082 int InputUsed[2] = { -1, -1 }; // Not yet discovered.
10083 unsigned LaneStart = l * NumLaneElems;
10084 for (unsigned i = 0; i != NumLaneElems; ++i) {
10085 // The mask element. This indexes into the input.
10086 int Idx = SVOp->getMaskElt(i+LaneStart);
10088 // the mask element does not index into any input vector.
10089 Mask.push_back(-1);
10093 // The input vector this mask element indexes into.
10094 int Input = Idx / NumLaneElems;
10096 // Turn the index into an offset from the start of the input vector.
10097 Idx -= Input * NumLaneElems;
10099 // Find or create a shuffle vector operand to hold this input.
10101 for (OpNo = 0; OpNo < array_lengthof(InputUsed); ++OpNo) {
10102 if (InputUsed[OpNo] == Input)
10103 // This input vector is already an operand.
10105 if (InputUsed[OpNo] < 0) {
10106 // Create a new operand for this input vector.
10107 InputUsed[OpNo] = Input;
10112 if (OpNo >= array_lengthof(InputUsed)) {
10113 // More than two input vectors used! Give up on trying to create a
10114 // shuffle vector. Insert all elements into a BUILD_VECTOR instead.
10115 UseBuildVector = true;
10119 // Add the mask index for the new shuffle vector.
10120 Mask.push_back(Idx + OpNo * NumLaneElems);
10123 if (UseBuildVector) {
10124 SmallVector<SDValue, 16> SVOps;
10125 for (unsigned i = 0; i != NumLaneElems; ++i) {
10126 // The mask element. This indexes into the input.
10127 int Idx = SVOp->getMaskElt(i+LaneStart);
10129 SVOps.push_back(DAG.getUNDEF(EltVT));
10133 // The input vector this mask element indexes into.
10134 int Input = Idx / NumElems;
10136 // Turn the index into an offset from the start of the input vector.
10137 Idx -= Input * NumElems;
10139 // Extract the vector element by hand.
10140 SVOps.push_back(DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, EltVT,
10141 SVOp->getOperand(Input),
10142 DAG.getIntPtrConstant(Idx)));
10145 // Construct the output using a BUILD_VECTOR.
10146 Output[l] = DAG.getNode(ISD::BUILD_VECTOR, dl, NVT, SVOps);
10147 } else if (InputUsed[0] < 0) {
10148 // No input vectors were used! The result is undefined.
10149 Output[l] = DAG.getUNDEF(NVT);
10151 SDValue Op0 = Extract128BitVector(SVOp->getOperand(InputUsed[0] / 2),
10152 (InputUsed[0] % 2) * NumLaneElems,
10154 // If only one input was used, use an undefined vector for the other.
10155 SDValue Op1 = (InputUsed[1] < 0) ? DAG.getUNDEF(NVT) :
10156 Extract128BitVector(SVOp->getOperand(InputUsed[1] / 2),
10157 (InputUsed[1] % 2) * NumLaneElems, DAG, dl);
10158 // At least one input vector was used. Create a new shuffle vector.
10159 Output[l] = DAG.getVectorShuffle(NVT, dl, Op0, Op1, &Mask[0]);
10165 // Concatenate the result back
10166 return DAG.getNode(ISD::CONCAT_VECTORS, dl, VT, Output[0], Output[1]);
10169 /// LowerVECTOR_SHUFFLE_128v4 - Handle all 128-bit wide vectors with
10170 /// 4 elements, and match them with several different shuffle types.
10172 LowerVECTOR_SHUFFLE_128v4(ShuffleVectorSDNode *SVOp, SelectionDAG &DAG) {
10173 SDValue V1 = SVOp->getOperand(0);
10174 SDValue V2 = SVOp->getOperand(1);
10176 MVT VT = SVOp->getSimpleValueType(0);
10178 assert(VT.is128BitVector() && "Unsupported vector size");
10180 std::pair<int, int> Locs[4];
10181 int Mask1[] = { -1, -1, -1, -1 };
10182 SmallVector<int, 8> PermMask(SVOp->getMask().begin(), SVOp->getMask().end());
10184 unsigned NumHi = 0;
10185 unsigned NumLo = 0;
10186 for (unsigned i = 0; i != 4; ++i) {
10187 int Idx = PermMask[i];
10189 Locs[i] = std::make_pair(-1, -1);
10191 assert(Idx < 8 && "Invalid VECTOR_SHUFFLE index!");
10193 Locs[i] = std::make_pair(0, NumLo);
10194 Mask1[NumLo] = Idx;
10197 Locs[i] = std::make_pair(1, NumHi);
10199 Mask1[2+NumHi] = Idx;
10205 if (NumLo <= 2 && NumHi <= 2) {
10206 // If no more than two elements come from either vector. This can be
10207 // implemented with two shuffles. First shuffle gather the elements.
10208 // The second shuffle, which takes the first shuffle as both of its
10209 // vector operands, put the elements into the right order.
10210 V1 = DAG.getVectorShuffle(VT, dl, V1, V2, &Mask1[0]);
10212 int Mask2[] = { -1, -1, -1, -1 };
10214 for (unsigned i = 0; i != 4; ++i)
10215 if (Locs[i].first != -1) {
10216 unsigned Idx = (i < 2) ? 0 : 4;
10217 Idx += Locs[i].first * 2 + Locs[i].second;
10221 return DAG.getVectorShuffle(VT, dl, V1, V1, &Mask2[0]);
10224 if (NumLo == 3 || NumHi == 3) {
10225 // Otherwise, we must have three elements from one vector, call it X, and
10226 // one element from the other, call it Y. First, use a shufps to build an
10227 // intermediate vector with the one element from Y and the element from X
10228 // that will be in the same half in the final destination (the indexes don't
10229 // matter). Then, use a shufps to build the final vector, taking the half
10230 // containing the element from Y from the intermediate, and the other half
10233 // Normalize it so the 3 elements come from V1.
10234 CommuteVectorShuffleMask(PermMask, 4);
10238 // Find the element from V2.
10240 for (HiIndex = 0; HiIndex < 3; ++HiIndex) {
10241 int Val = PermMask[HiIndex];
10248 Mask1[0] = PermMask[HiIndex];
10250 Mask1[2] = PermMask[HiIndex^1];
10252 V2 = DAG.getVectorShuffle(VT, dl, V1, V2, &Mask1[0]);
10254 if (HiIndex >= 2) {
10255 Mask1[0] = PermMask[0];
10256 Mask1[1] = PermMask[1];
10257 Mask1[2] = HiIndex & 1 ? 6 : 4;
10258 Mask1[3] = HiIndex & 1 ? 4 : 6;
10259 return DAG.getVectorShuffle(VT, dl, V1, V2, &Mask1[0]);
10262 Mask1[0] = HiIndex & 1 ? 2 : 0;
10263 Mask1[1] = HiIndex & 1 ? 0 : 2;
10264 Mask1[2] = PermMask[2];
10265 Mask1[3] = PermMask[3];
10270 return DAG.getVectorShuffle(VT, dl, V2, V1, &Mask1[0]);
10273 // Break it into (shuffle shuffle_hi, shuffle_lo).
10274 int LoMask[] = { -1, -1, -1, -1 };
10275 int HiMask[] = { -1, -1, -1, -1 };
10277 int *MaskPtr = LoMask;
10278 unsigned MaskIdx = 0;
10279 unsigned LoIdx = 0;
10280 unsigned HiIdx = 2;
10281 for (unsigned i = 0; i != 4; ++i) {
10288 int Idx = PermMask[i];
10290 Locs[i] = std::make_pair(-1, -1);
10291 } else if (Idx < 4) {
10292 Locs[i] = std::make_pair(MaskIdx, LoIdx);
10293 MaskPtr[LoIdx] = Idx;
10296 Locs[i] = std::make_pair(MaskIdx, HiIdx);
10297 MaskPtr[HiIdx] = Idx;
10302 SDValue LoShuffle = DAG.getVectorShuffle(VT, dl, V1, V2, &LoMask[0]);
10303 SDValue HiShuffle = DAG.getVectorShuffle(VT, dl, V1, V2, &HiMask[0]);
10304 int MaskOps[] = { -1, -1, -1, -1 };
10305 for (unsigned i = 0; i != 4; ++i)
10306 if (Locs[i].first != -1)
10307 MaskOps[i] = Locs[i].first * 4 + Locs[i].second;
10308 return DAG.getVectorShuffle(VT, dl, LoShuffle, HiShuffle, &MaskOps[0]);
10311 static bool MayFoldVectorLoad(SDValue V) {
10312 while (V.hasOneUse() && V.getOpcode() == ISD::BITCAST)
10313 V = V.getOperand(0);
10315 if (V.hasOneUse() && V.getOpcode() == ISD::SCALAR_TO_VECTOR)
10316 V = V.getOperand(0);
10317 if (V.hasOneUse() && V.getOpcode() == ISD::BUILD_VECTOR &&
10318 V.getNumOperands() == 2 && V.getOperand(1).getOpcode() == ISD::UNDEF)
10319 // BUILD_VECTOR (load), undef
10320 V = V.getOperand(0);
10322 return MayFoldLoad(V);
10326 SDValue getMOVDDup(SDValue &Op, SDLoc &dl, SDValue V1, SelectionDAG &DAG) {
10327 MVT VT = Op.getSimpleValueType();
10329 // Canonizalize to v2f64.
10330 V1 = DAG.getNode(ISD::BITCAST, dl, MVT::v2f64, V1);
10331 return DAG.getNode(ISD::BITCAST, dl, VT,
10332 getTargetShuffleNode(X86ISD::MOVDDUP, dl, MVT::v2f64,
10337 SDValue getMOVLowToHigh(SDValue &Op, SDLoc &dl, SelectionDAG &DAG,
10339 SDValue V1 = Op.getOperand(0);
10340 SDValue V2 = Op.getOperand(1);
10341 MVT VT = Op.getSimpleValueType();
10343 assert(VT != MVT::v2i64 && "unsupported shuffle type");
10345 if (HasSSE2 && VT == MVT::v2f64)
10346 return getTargetShuffleNode(X86ISD::MOVLHPD, dl, VT, V1, V2, DAG);
10348 // v4f32 or v4i32: canonizalized to v4f32 (which is legal for SSE1)
10349 return DAG.getNode(ISD::BITCAST, dl, VT,
10350 getTargetShuffleNode(X86ISD::MOVLHPS, dl, MVT::v4f32,
10351 DAG.getNode(ISD::BITCAST, dl, MVT::v4f32, V1),
10352 DAG.getNode(ISD::BITCAST, dl, MVT::v4f32, V2), DAG));
10356 SDValue getMOVHighToLow(SDValue &Op, SDLoc &dl, SelectionDAG &DAG) {
10357 SDValue V1 = Op.getOperand(0);
10358 SDValue V2 = Op.getOperand(1);
10359 MVT VT = Op.getSimpleValueType();
10361 assert((VT == MVT::v4i32 || VT == MVT::v4f32) &&
10362 "unsupported shuffle type");
10364 if (V2.getOpcode() == ISD::UNDEF)
10368 return getTargetShuffleNode(X86ISD::MOVHLPS, dl, VT, V1, V2, DAG);
10372 SDValue getMOVLP(SDValue &Op, SDLoc &dl, SelectionDAG &DAG, bool HasSSE2) {
10373 SDValue V1 = Op.getOperand(0);
10374 SDValue V2 = Op.getOperand(1);
10375 MVT VT = Op.getSimpleValueType();
10376 unsigned NumElems = VT.getVectorNumElements();
10378 // Use MOVLPS and MOVLPD in case V1 or V2 are loads. During isel, the second
10379 // operand of these instructions is only memory, so check if there's a
10380 // potencial load folding here, otherwise use SHUFPS or MOVSD to match the
10382 bool CanFoldLoad = false;
10384 // Trivial case, when V2 comes from a load.
10385 if (MayFoldVectorLoad(V2))
10386 CanFoldLoad = true;
10388 // When V1 is a load, it can be folded later into a store in isel, example:
10389 // (store (v4f32 (X86Movlps (load addr:$src1), VR128:$src2)), addr:$src1)
10391 // (MOVLPSmr addr:$src1, VR128:$src2)
10392 // So, recognize this potential and also use MOVLPS or MOVLPD
10393 else if (MayFoldVectorLoad(V1) && MayFoldIntoStore(Op))
10394 CanFoldLoad = true;
10396 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
10398 if (HasSSE2 && NumElems == 2)
10399 return getTargetShuffleNode(X86ISD::MOVLPD, dl, VT, V1, V2, DAG);
10402 // If we don't care about the second element, proceed to use movss.
10403 if (SVOp->getMaskElt(1) != -1)
10404 return getTargetShuffleNode(X86ISD::MOVLPS, dl, VT, V1, V2, DAG);
10407 // movl and movlp will both match v2i64, but v2i64 is never matched by
10408 // movl earlier because we make it strict to avoid messing with the movlp load
10409 // folding logic (see the code above getMOVLP call). Match it here then,
10410 // this is horrible, but will stay like this until we move all shuffle
10411 // matching to x86 specific nodes. Note that for the 1st condition all
10412 // types are matched with movsd.
10414 // FIXME: isMOVLMask should be checked and matched before getMOVLP,
10415 // as to remove this logic from here, as much as possible
10416 if (NumElems == 2 || !isMOVLMask(SVOp->getMask(), VT))
10417 return getTargetShuffleNode(X86ISD::MOVSD, dl, VT, V1, V2, DAG);
10418 return getTargetShuffleNode(X86ISD::MOVSS, dl, VT, V1, V2, DAG);
10421 assert(VT != MVT::v4i32 && "unsupported shuffle type");
10423 // Invert the operand order and use SHUFPS to match it.
10424 return getTargetShuffleNode(X86ISD::SHUFP, dl, VT, V2, V1,
10425 getShuffleSHUFImmediate(SVOp), DAG);
10428 static SDValue NarrowVectorLoadToElement(LoadSDNode *Load, unsigned Index,
10429 SelectionDAG &DAG) {
10431 MVT VT = Load->getSimpleValueType(0);
10432 MVT EVT = VT.getVectorElementType();
10433 SDValue Addr = Load->getOperand(1);
10434 SDValue NewAddr = DAG.getNode(
10435 ISD::ADD, dl, Addr.getSimpleValueType(), Addr,
10436 DAG.getConstant(Index * EVT.getStoreSize(), Addr.getSimpleValueType()));
10439 DAG.getLoad(EVT, dl, Load->getChain(), NewAddr,
10440 DAG.getMachineFunction().getMachineMemOperand(
10441 Load->getMemOperand(), 0, EVT.getStoreSize()));
10445 // It is only safe to call this function if isINSERTPSMask is true for
10446 // this shufflevector mask.
10447 static SDValue getINSERTPS(ShuffleVectorSDNode *SVOp, SDLoc &dl,
10448 SelectionDAG &DAG) {
10449 // Generate an insertps instruction when inserting an f32 from memory onto a
10450 // v4f32 or when copying a member from one v4f32 to another.
10451 // We also use it for transferring i32 from one register to another,
10452 // since it simply copies the same bits.
10453 // If we're transferring an i32 from memory to a specific element in a
10454 // register, we output a generic DAG that will match the PINSRD
10456 MVT VT = SVOp->getSimpleValueType(0);
10457 MVT EVT = VT.getVectorElementType();
10458 SDValue V1 = SVOp->getOperand(0);
10459 SDValue V2 = SVOp->getOperand(1);
10460 auto Mask = SVOp->getMask();
10461 assert((VT == MVT::v4f32 || VT == MVT::v4i32) &&
10462 "unsupported vector type for insertps/pinsrd");
10464 auto FromV1Predicate = [](const int &i) { return i < 4 && i > -1; };
10465 auto FromV2Predicate = [](const int &i) { return i >= 4; };
10466 int FromV1 = std::count_if(Mask.begin(), Mask.end(), FromV1Predicate);
10470 unsigned DestIndex;
10474 DestIndex = std::find_if(Mask.begin(), Mask.end(), FromV1Predicate) -
10477 // If we have 1 element from each vector, we have to check if we're
10478 // changing V1's element's place. If so, we're done. Otherwise, we
10479 // should assume we're changing V2's element's place and behave
10481 int FromV2 = std::count_if(Mask.begin(), Mask.end(), FromV2Predicate);
10482 assert(DestIndex <= INT32_MAX && "truncated destination index");
10483 if (FromV1 == FromV2 &&
10484 static_cast<int>(DestIndex) == Mask[DestIndex] % 4) {
10488 std::find_if(Mask.begin(), Mask.end(), FromV2Predicate) - Mask.begin();
10491 assert(std::count_if(Mask.begin(), Mask.end(), FromV2Predicate) == 1 &&
10492 "More than one element from V1 and from V2, or no elements from one "
10493 "of the vectors. This case should not have returned true from "
10498 std::find_if(Mask.begin(), Mask.end(), FromV2Predicate) - Mask.begin();
10501 // Get an index into the source vector in the range [0,4) (the mask is
10502 // in the range [0,8) because it can address V1 and V2)
10503 unsigned SrcIndex = Mask[DestIndex] % 4;
10504 if (MayFoldLoad(From)) {
10505 // Trivial case, when From comes from a load and is only used by the
10506 // shuffle. Make it use insertps from the vector that we need from that
10509 NarrowVectorLoadToElement(cast<LoadSDNode>(From), SrcIndex, DAG);
10510 if (!NewLoad.getNode())
10513 if (EVT == MVT::f32) {
10514 // Create this as a scalar to vector to match the instruction pattern.
10515 SDValue LoadScalarToVector =
10516 DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VT, NewLoad);
10517 SDValue InsertpsMask = DAG.getIntPtrConstant(DestIndex << 4);
10518 return DAG.getNode(X86ISD::INSERTPS, dl, VT, To, LoadScalarToVector,
10520 } else { // EVT == MVT::i32
10521 // If we're getting an i32 from memory, use an INSERT_VECTOR_ELT
10522 // instruction, to match the PINSRD instruction, which loads an i32 to a
10523 // certain vector element.
10524 return DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, VT, To, NewLoad,
10525 DAG.getConstant(DestIndex, MVT::i32));
10529 // Vector-element-to-vector
10530 SDValue InsertpsMask = DAG.getIntPtrConstant(DestIndex << 4 | SrcIndex << 6);
10531 return DAG.getNode(X86ISD::INSERTPS, dl, VT, To, From, InsertpsMask);
10534 // Reduce a vector shuffle to zext.
10535 static SDValue LowerVectorIntExtend(SDValue Op, const X86Subtarget *Subtarget,
10536 SelectionDAG &DAG) {
10537 // PMOVZX is only available from SSE41.
10538 if (!Subtarget->hasSSE41())
10541 MVT VT = Op.getSimpleValueType();
10543 // Only AVX2 support 256-bit vector integer extending.
10544 if (!Subtarget->hasInt256() && VT.is256BitVector())
10547 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
10549 SDValue V1 = Op.getOperand(0);
10550 SDValue V2 = Op.getOperand(1);
10551 unsigned NumElems = VT.getVectorNumElements();
10553 // Extending is an unary operation and the element type of the source vector
10554 // won't be equal to or larger than i64.
10555 if (V2.getOpcode() != ISD::UNDEF || !VT.isInteger() ||
10556 VT.getVectorElementType() == MVT::i64)
10559 // Find the expansion ratio, e.g. expanding from i8 to i32 has a ratio of 4.
10560 unsigned Shift = 1; // Start from 2, i.e. 1 << 1.
10561 while ((1U << Shift) < NumElems) {
10562 if (SVOp->getMaskElt(1U << Shift) == 1)
10565 // The maximal ratio is 8, i.e. from i8 to i64.
10570 // Check the shuffle mask.
10571 unsigned Mask = (1U << Shift) - 1;
10572 for (unsigned i = 0; i != NumElems; ++i) {
10573 int EltIdx = SVOp->getMaskElt(i);
10574 if ((i & Mask) != 0 && EltIdx != -1)
10576 if ((i & Mask) == 0 && (unsigned)EltIdx != (i >> Shift))
10580 unsigned NBits = VT.getVectorElementType().getSizeInBits() << Shift;
10581 MVT NeVT = MVT::getIntegerVT(NBits);
10582 MVT NVT = MVT::getVectorVT(NeVT, NumElems >> Shift);
10584 if (!DAG.getTargetLoweringInfo().isTypeLegal(NVT))
10587 // Simplify the operand as it's prepared to be fed into shuffle.
10588 unsigned SignificantBits = NVT.getSizeInBits() >> Shift;
10589 if (V1.getOpcode() == ISD::BITCAST &&
10590 V1.getOperand(0).getOpcode() == ISD::SCALAR_TO_VECTOR &&
10591 V1.getOperand(0).getOperand(0).getOpcode() == ISD::EXTRACT_VECTOR_ELT &&
10592 V1.getOperand(0).getOperand(0)
10593 .getSimpleValueType().getSizeInBits() == SignificantBits) {
10594 // (bitcast (sclr2vec (ext_vec_elt x))) -> (bitcast x)
10595 SDValue V = V1.getOperand(0).getOperand(0).getOperand(0);
10596 ConstantSDNode *CIdx =
10597 dyn_cast<ConstantSDNode>(V1.getOperand(0).getOperand(0).getOperand(1));
10598 // If it's foldable, i.e. normal load with single use, we will let code
10599 // selection to fold it. Otherwise, we will short the conversion sequence.
10600 if (CIdx && CIdx->getZExtValue() == 0 &&
10601 (!ISD::isNormalLoad(V.getNode()) || !V.hasOneUse())) {
10602 MVT FullVT = V.getSimpleValueType();
10603 MVT V1VT = V1.getSimpleValueType();
10604 if (FullVT.getSizeInBits() > V1VT.getSizeInBits()) {
10605 // The "ext_vec_elt" node is wider than the result node.
10606 // In this case we should extract subvector from V.
10607 // (bitcast (sclr2vec (ext_vec_elt x))) -> (bitcast (extract_subvector x)).
10608 unsigned Ratio = FullVT.getSizeInBits() / V1VT.getSizeInBits();
10609 MVT SubVecVT = MVT::getVectorVT(FullVT.getVectorElementType(),
10610 FullVT.getVectorNumElements()/Ratio);
10611 V = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, SubVecVT, V,
10612 DAG.getIntPtrConstant(0));
10614 V1 = DAG.getNode(ISD::BITCAST, DL, V1VT, V);
10618 return DAG.getNode(ISD::BITCAST, DL, VT,
10619 DAG.getNode(X86ISD::VZEXT, DL, NVT, V1));
10622 static SDValue NormalizeVectorShuffle(SDValue Op, const X86Subtarget *Subtarget,
10623 SelectionDAG &DAG) {
10624 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
10625 MVT VT = Op.getSimpleValueType();
10627 SDValue V1 = Op.getOperand(0);
10628 SDValue V2 = Op.getOperand(1);
10630 if (isZeroShuffle(SVOp))
10631 return getZeroVector(VT, Subtarget, DAG, dl);
10633 // Handle splat operations
10634 if (SVOp->isSplat()) {
10635 // Use vbroadcast whenever the splat comes from a foldable load
10636 SDValue Broadcast = LowerVectorBroadcast(Op, Subtarget, DAG);
10637 if (Broadcast.getNode())
10641 // Check integer expanding shuffles.
10642 SDValue NewOp = LowerVectorIntExtend(Op, Subtarget, DAG);
10643 if (NewOp.getNode())
10646 // If the shuffle can be profitably rewritten as a narrower shuffle, then
10648 if (VT == MVT::v8i16 || VT == MVT::v16i8 || VT == MVT::v16i16 ||
10649 VT == MVT::v32i8) {
10650 SDValue NewOp = RewriteAsNarrowerShuffle(SVOp, DAG);
10651 if (NewOp.getNode())
10652 return DAG.getNode(ISD::BITCAST, dl, VT, NewOp);
10653 } else if (VT.is128BitVector() && Subtarget->hasSSE2()) {
10654 // FIXME: Figure out a cleaner way to do this.
10655 if (ISD::isBuildVectorAllZeros(V2.getNode())) {
10656 SDValue NewOp = RewriteAsNarrowerShuffle(SVOp, DAG);
10657 if (NewOp.getNode()) {
10658 MVT NewVT = NewOp.getSimpleValueType();
10659 if (isCommutedMOVLMask(cast<ShuffleVectorSDNode>(NewOp)->getMask(),
10660 NewVT, true, false))
10661 return getVZextMovL(VT, NewVT, NewOp.getOperand(0), DAG, Subtarget,
10664 } else if (ISD::isBuildVectorAllZeros(V1.getNode())) {
10665 SDValue NewOp = RewriteAsNarrowerShuffle(SVOp, DAG);
10666 if (NewOp.getNode()) {
10667 MVT NewVT = NewOp.getSimpleValueType();
10668 if (isMOVLMask(cast<ShuffleVectorSDNode>(NewOp)->getMask(), NewVT))
10669 return getVZextMovL(VT, NewVT, NewOp.getOperand(1), DAG, Subtarget,
10678 X86TargetLowering::LowerVECTOR_SHUFFLE(SDValue Op, SelectionDAG &DAG) const {
10679 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
10680 SDValue V1 = Op.getOperand(0);
10681 SDValue V2 = Op.getOperand(1);
10682 MVT VT = Op.getSimpleValueType();
10684 unsigned NumElems = VT.getVectorNumElements();
10685 bool V1IsUndef = V1.getOpcode() == ISD::UNDEF;
10686 bool V2IsUndef = V2.getOpcode() == ISD::UNDEF;
10687 bool V1IsSplat = false;
10688 bool V2IsSplat = false;
10689 bool HasSSE2 = Subtarget->hasSSE2();
10690 bool HasFp256 = Subtarget->hasFp256();
10691 bool HasInt256 = Subtarget->hasInt256();
10692 MachineFunction &MF = DAG.getMachineFunction();
10693 bool OptForSize = MF.getFunction()->getAttributes().
10694 hasAttribute(AttributeSet::FunctionIndex, Attribute::OptimizeForSize);
10696 // Check if we should use the experimental vector shuffle lowering. If so,
10697 // delegate completely to that code path.
10698 if (ExperimentalVectorShuffleLowering)
10699 return lowerVectorShuffle(Op, Subtarget, DAG);
10701 assert(VT.getSizeInBits() != 64 && "Can't lower MMX shuffles");
10703 if (V1IsUndef && V2IsUndef)
10704 return DAG.getUNDEF(VT);
10706 // When we create a shuffle node we put the UNDEF node to second operand,
10707 // but in some cases the first operand may be transformed to UNDEF.
10708 // In this case we should just commute the node.
10710 return DAG.getCommutedVectorShuffle(*SVOp);
10712 // Vector shuffle lowering takes 3 steps:
10714 // 1) Normalize the input vectors. Here splats, zeroed vectors, profitable
10715 // narrowing and commutation of operands should be handled.
10716 // 2) Matching of shuffles with known shuffle masks to x86 target specific
10718 // 3) Rewriting of unmatched masks into new generic shuffle operations,
10719 // so the shuffle can be broken into other shuffles and the legalizer can
10720 // try the lowering again.
10722 // The general idea is that no vector_shuffle operation should be left to
10723 // be matched during isel, all of them must be converted to a target specific
10726 // Normalize the input vectors. Here splats, zeroed vectors, profitable
10727 // narrowing and commutation of operands should be handled. The actual code
10728 // doesn't include all of those, work in progress...
10729 SDValue NewOp = NormalizeVectorShuffle(Op, Subtarget, DAG);
10730 if (NewOp.getNode())
10733 SmallVector<int, 8> M(SVOp->getMask().begin(), SVOp->getMask().end());
10735 // NOTE: isPSHUFDMask can also match both masks below (unpckl_undef and
10736 // unpckh_undef). Only use pshufd if speed is more important than size.
10737 if (OptForSize && isUNPCKL_v_undef_Mask(M, VT, HasInt256))
10738 return getTargetShuffleNode(X86ISD::UNPCKL, dl, VT, V1, V1, DAG);
10739 if (OptForSize && isUNPCKH_v_undef_Mask(M, VT, HasInt256))
10740 return getTargetShuffleNode(X86ISD::UNPCKH, dl, VT, V1, V1, DAG);
10742 if (isMOVDDUPMask(M, VT) && Subtarget->hasSSE3() &&
10743 V2IsUndef && MayFoldVectorLoad(V1))
10744 return getMOVDDup(Op, dl, V1, DAG);
10746 if (isMOVHLPS_v_undef_Mask(M, VT))
10747 return getMOVHighToLow(Op, dl, DAG);
10749 // Use to match splats
10750 if (HasSSE2 && isUNPCKHMask(M, VT, HasInt256) && V2IsUndef &&
10751 (VT == MVT::v2f64 || VT == MVT::v2i64))
10752 return getTargetShuffleNode(X86ISD::UNPCKH, dl, VT, V1, V1, DAG);
10754 if (isPSHUFDMask(M, VT)) {
10755 // The actual implementation will match the mask in the if above and then
10756 // during isel it can match several different instructions, not only pshufd
10757 // as its name says, sad but true, emulate the behavior for now...
10758 if (isMOVDDUPMask(M, VT) && ((VT == MVT::v4f32 || VT == MVT::v2i64)))
10759 return getTargetShuffleNode(X86ISD::MOVLHPS, dl, VT, V1, V1, DAG);
10761 unsigned TargetMask = getShuffleSHUFImmediate(SVOp);
10763 if (HasSSE2 && (VT == MVT::v4f32 || VT == MVT::v4i32))
10764 return getTargetShuffleNode(X86ISD::PSHUFD, dl, VT, V1, TargetMask, DAG);
10766 if (HasFp256 && (VT == MVT::v4f32 || VT == MVT::v2f64))
10767 return getTargetShuffleNode(X86ISD::VPERMILP, dl, VT, V1, TargetMask,
10770 return getTargetShuffleNode(X86ISD::SHUFP, dl, VT, V1, V1,
10774 if (isPALIGNRMask(M, VT, Subtarget))
10775 return getTargetShuffleNode(X86ISD::PALIGNR, dl, VT, V1, V2,
10776 getShufflePALIGNRImmediate(SVOp),
10779 if (isVALIGNMask(M, VT, Subtarget))
10780 return getTargetShuffleNode(X86ISD::VALIGN, dl, VT, V1, V2,
10781 getShuffleVALIGNImmediate(SVOp),
10784 // Check if this can be converted into a logical shift.
10785 bool isLeft = false;
10786 unsigned ShAmt = 0;
10788 bool isShift = HasSSE2 && isVectorShift(SVOp, DAG, isLeft, ShVal, ShAmt);
10789 if (isShift && ShVal.hasOneUse()) {
10790 // If the shifted value has multiple uses, it may be cheaper to use
10791 // v_set0 + movlhps or movhlps, etc.
10792 MVT EltVT = VT.getVectorElementType();
10793 ShAmt *= EltVT.getSizeInBits();
10794 return getVShift(isLeft, VT, ShVal, ShAmt, DAG, *this, dl);
10797 if (isMOVLMask(M, VT)) {
10798 if (ISD::isBuildVectorAllZeros(V1.getNode()))
10799 return getVZextMovL(VT, VT, V2, DAG, Subtarget, dl);
10800 if (!isMOVLPMask(M, VT)) {
10801 if (HasSSE2 && (VT == MVT::v2i64 || VT == MVT::v2f64))
10802 return getTargetShuffleNode(X86ISD::MOVSD, dl, VT, V1, V2, DAG);
10804 if (VT == MVT::v4i32 || VT == MVT::v4f32)
10805 return getTargetShuffleNode(X86ISD::MOVSS, dl, VT, V1, V2, DAG);
10809 // FIXME: fold these into legal mask.
10810 if (isMOVLHPSMask(M, VT) && !isUNPCKLMask(M, VT, HasInt256))
10811 return getMOVLowToHigh(Op, dl, DAG, HasSSE2);
10813 if (isMOVHLPSMask(M, VT))
10814 return getMOVHighToLow(Op, dl, DAG);
10816 if (V2IsUndef && isMOVSHDUPMask(M, VT, Subtarget))
10817 return getTargetShuffleNode(X86ISD::MOVSHDUP, dl, VT, V1, DAG);
10819 if (V2IsUndef && isMOVSLDUPMask(M, VT, Subtarget))
10820 return getTargetShuffleNode(X86ISD::MOVSLDUP, dl, VT, V1, DAG);
10822 if (isMOVLPMask(M, VT))
10823 return getMOVLP(Op, dl, DAG, HasSSE2);
10825 if (ShouldXformToMOVHLPS(M, VT) ||
10826 ShouldXformToMOVLP(V1.getNode(), V2.getNode(), M, VT))
10827 return DAG.getCommutedVectorShuffle(*SVOp);
10830 // No better options. Use a vshldq / vsrldq.
10831 MVT EltVT = VT.getVectorElementType();
10832 ShAmt *= EltVT.getSizeInBits();
10833 return getVShift(isLeft, VT, ShVal, ShAmt, DAG, *this, dl);
10836 bool Commuted = false;
10837 // FIXME: This should also accept a bitcast of a splat? Be careful, not
10838 // 1,1,1,1 -> v8i16 though.
10839 BitVector UndefElements;
10840 if (auto *BVOp = dyn_cast<BuildVectorSDNode>(V1.getNode()))
10841 if (BVOp->getConstantSplatNode(&UndefElements) && UndefElements.none())
10843 if (auto *BVOp = dyn_cast<BuildVectorSDNode>(V2.getNode()))
10844 if (BVOp->getConstantSplatNode(&UndefElements) && UndefElements.none())
10847 // Canonicalize the splat or undef, if present, to be on the RHS.
10848 if (!V2IsUndef && V1IsSplat && !V2IsSplat) {
10849 CommuteVectorShuffleMask(M, NumElems);
10851 std::swap(V1IsSplat, V2IsSplat);
10855 if (isCommutedMOVLMask(M, VT, V2IsSplat, V2IsUndef)) {
10856 // Shuffling low element of v1 into undef, just return v1.
10859 // If V2 is a splat, the mask may be malformed such as <4,3,3,3>, which
10860 // the instruction selector will not match, so get a canonical MOVL with
10861 // swapped operands to undo the commute.
10862 return getMOVL(DAG, dl, VT, V2, V1);
10865 if (isUNPCKLMask(M, VT, HasInt256))
10866 return getTargetShuffleNode(X86ISD::UNPCKL, dl, VT, V1, V2, DAG);
10868 if (isUNPCKHMask(M, VT, HasInt256))
10869 return getTargetShuffleNode(X86ISD::UNPCKH, dl, VT, V1, V2, DAG);
10872 // Normalize mask so all entries that point to V2 points to its first
10873 // element then try to match unpck{h|l} again. If match, return a
10874 // new vector_shuffle with the corrected mask.p
10875 SmallVector<int, 8> NewMask(M.begin(), M.end());
10876 NormalizeMask(NewMask, NumElems);
10877 if (isUNPCKLMask(NewMask, VT, HasInt256, true))
10878 return getTargetShuffleNode(X86ISD::UNPCKL, dl, VT, V1, V2, DAG);
10879 if (isUNPCKHMask(NewMask, VT, HasInt256, true))
10880 return getTargetShuffleNode(X86ISD::UNPCKH, dl, VT, V1, V2, DAG);
10884 // Commute is back and try unpck* again.
10885 // FIXME: this seems wrong.
10886 CommuteVectorShuffleMask(M, NumElems);
10888 std::swap(V1IsSplat, V2IsSplat);
10890 if (isUNPCKLMask(M, VT, HasInt256))
10891 return getTargetShuffleNode(X86ISD::UNPCKL, dl, VT, V1, V2, DAG);
10893 if (isUNPCKHMask(M, VT, HasInt256))
10894 return getTargetShuffleNode(X86ISD::UNPCKH, dl, VT, V1, V2, DAG);
10897 // Normalize the node to match x86 shuffle ops if needed
10898 if (!V2IsUndef && (isSHUFPMask(M, VT, /* Commuted */ true)))
10899 return DAG.getCommutedVectorShuffle(*SVOp);
10901 // The checks below are all present in isShuffleMaskLegal, but they are
10902 // inlined here right now to enable us to directly emit target specific
10903 // nodes, and remove one by one until they don't return Op anymore.
10905 if (ShuffleVectorSDNode::isSplatMask(&M[0], VT) &&
10906 SVOp->getSplatIndex() == 0 && V2IsUndef) {
10907 if (VT == MVT::v2f64 || VT == MVT::v2i64)
10908 return getTargetShuffleNode(X86ISD::UNPCKL, dl, VT, V1, V1, DAG);
10911 if (isPSHUFHWMask(M, VT, HasInt256))
10912 return getTargetShuffleNode(X86ISD::PSHUFHW, dl, VT, V1,
10913 getShufflePSHUFHWImmediate(SVOp),
10916 if (isPSHUFLWMask(M, VT, HasInt256))
10917 return getTargetShuffleNode(X86ISD::PSHUFLW, dl, VT, V1,
10918 getShufflePSHUFLWImmediate(SVOp),
10921 unsigned MaskValue;
10922 if (isBlendMask(M, VT, Subtarget->hasSSE41(), Subtarget->hasInt256(),
10924 return LowerVECTOR_SHUFFLEtoBlend(SVOp, MaskValue, Subtarget, DAG);
10926 if (isSHUFPMask(M, VT))
10927 return getTargetShuffleNode(X86ISD::SHUFP, dl, VT, V1, V2,
10928 getShuffleSHUFImmediate(SVOp), DAG);
10930 if (isUNPCKL_v_undef_Mask(M, VT, HasInt256))
10931 return getTargetShuffleNode(X86ISD::UNPCKL, dl, VT, V1, V1, DAG);
10932 if (isUNPCKH_v_undef_Mask(M, VT, HasInt256))
10933 return getTargetShuffleNode(X86ISD::UNPCKH, dl, VT, V1, V1, DAG);
10935 //===--------------------------------------------------------------------===//
10936 // Generate target specific nodes for 128 or 256-bit shuffles only
10937 // supported in the AVX instruction set.
10940 // Handle VMOVDDUPY permutations
10941 if (V2IsUndef && isMOVDDUPYMask(M, VT, HasFp256))
10942 return getTargetShuffleNode(X86ISD::MOVDDUP, dl, VT, V1, DAG);
10944 // Handle VPERMILPS/D* permutations
10945 if (isVPERMILPMask(M, VT)) {
10946 if ((HasInt256 && VT == MVT::v8i32) || VT == MVT::v16i32)
10947 return getTargetShuffleNode(X86ISD::PSHUFD, dl, VT, V1,
10948 getShuffleSHUFImmediate(SVOp), DAG);
10949 return getTargetShuffleNode(X86ISD::VPERMILP, dl, VT, V1,
10950 getShuffleSHUFImmediate(SVOp), DAG);
10954 if (VT.is512BitVector() && isINSERT64x4Mask(M, VT, &Idx))
10955 return Insert256BitVector(V1, Extract256BitVector(V2, 0, DAG, dl),
10956 Idx*(NumElems/2), DAG, dl);
10958 // Handle VPERM2F128/VPERM2I128 permutations
10959 if (isVPERM2X128Mask(M, VT, HasFp256))
10960 return getTargetShuffleNode(X86ISD::VPERM2X128, dl, VT, V1,
10961 V2, getShuffleVPERM2X128Immediate(SVOp), DAG);
10963 if (Subtarget->hasSSE41() && isINSERTPSMask(M, VT))
10964 return getINSERTPS(SVOp, dl, DAG);
10967 if (V2IsUndef && HasInt256 && isPermImmMask(M, VT, Imm8))
10968 return getTargetShuffleNode(X86ISD::VPERMI, dl, VT, V1, Imm8, DAG);
10970 if ((V2IsUndef && HasInt256 && VT.is256BitVector() && NumElems == 8) ||
10971 VT.is512BitVector()) {
10972 MVT MaskEltVT = MVT::getIntegerVT(VT.getVectorElementType().getSizeInBits());
10973 MVT MaskVectorVT = MVT::getVectorVT(MaskEltVT, NumElems);
10974 SmallVector<SDValue, 16> permclMask;
10975 for (unsigned i = 0; i != NumElems; ++i) {
10976 permclMask.push_back(DAG.getConstant((M[i]>=0) ? M[i] : 0, MaskEltVT));
10979 SDValue Mask = DAG.getNode(ISD::BUILD_VECTOR, dl, MaskVectorVT, permclMask);
10981 // Bitcast is for VPERMPS since mask is v8i32 but node takes v8f32
10982 return DAG.getNode(X86ISD::VPERMV, dl, VT,
10983 DAG.getNode(ISD::BITCAST, dl, VT, Mask), V1);
10984 return DAG.getNode(X86ISD::VPERMV3, dl, VT, V1,
10985 DAG.getNode(ISD::BITCAST, dl, VT, Mask), V2);
10988 //===--------------------------------------------------------------------===//
10989 // Since no target specific shuffle was selected for this generic one,
10990 // lower it into other known shuffles. FIXME: this isn't true yet, but
10991 // this is the plan.
10994 // Handle v8i16 specifically since SSE can do byte extraction and insertion.
10995 if (VT == MVT::v8i16) {
10996 SDValue NewOp = LowerVECTOR_SHUFFLEv8i16(Op, Subtarget, DAG);
10997 if (NewOp.getNode())
11001 if (VT == MVT::v16i16 && Subtarget->hasInt256()) {
11002 SDValue NewOp = LowerVECTOR_SHUFFLEv16i16(Op, DAG);
11003 if (NewOp.getNode())
11007 if (VT == MVT::v16i8) {
11008 SDValue NewOp = LowerVECTOR_SHUFFLEv16i8(SVOp, Subtarget, DAG);
11009 if (NewOp.getNode())
11013 if (VT == MVT::v32i8) {
11014 SDValue NewOp = LowerVECTOR_SHUFFLEv32i8(SVOp, Subtarget, DAG);
11015 if (NewOp.getNode())
11019 // Handle all 128-bit wide vectors with 4 elements, and match them with
11020 // several different shuffle types.
11021 if (NumElems == 4 && VT.is128BitVector())
11022 return LowerVECTOR_SHUFFLE_128v4(SVOp, DAG);
11024 // Handle general 256-bit shuffles
11025 if (VT.is256BitVector())
11026 return LowerVECTOR_SHUFFLE_256(SVOp, DAG);
11031 // This function assumes its argument is a BUILD_VECTOR of constants or
11032 // undef SDNodes. i.e: ISD::isBuildVectorOfConstantSDNodes(BuildVector) is
11034 static bool BUILD_VECTORtoBlendMask(BuildVectorSDNode *BuildVector,
11035 unsigned &MaskValue) {
11037 unsigned NumElems = BuildVector->getNumOperands();
11038 // There are 2 lanes if (NumElems > 8), and 1 lane otherwise.
11039 unsigned NumLanes = (NumElems - 1) / 8 + 1;
11040 unsigned NumElemsInLane = NumElems / NumLanes;
11042 // Blend for v16i16 should be symetric for the both lanes.
11043 for (unsigned i = 0; i < NumElemsInLane; ++i) {
11044 SDValue EltCond = BuildVector->getOperand(i);
11045 SDValue SndLaneEltCond =
11046 (NumLanes == 2) ? BuildVector->getOperand(i + NumElemsInLane) : EltCond;
11048 int Lane1Cond = -1, Lane2Cond = -1;
11049 if (isa<ConstantSDNode>(EltCond))
11050 Lane1Cond = !isZero(EltCond);
11051 if (isa<ConstantSDNode>(SndLaneEltCond))
11052 Lane2Cond = !isZero(SndLaneEltCond);
11054 if (Lane1Cond == Lane2Cond || Lane2Cond < 0)
11055 // Lane1Cond != 0, means we want the first argument.
11056 // Lane1Cond == 0, means we want the second argument.
11057 // The encoding of this argument is 0 for the first argument, 1
11058 // for the second. Therefore, invert the condition.
11059 MaskValue |= !Lane1Cond << i;
11060 else if (Lane1Cond < 0)
11061 MaskValue |= !Lane2Cond << i;
11068 // Try to lower a vselect node into a simple blend instruction.
11069 static SDValue LowerVSELECTtoBlend(SDValue Op, const X86Subtarget *Subtarget,
11070 SelectionDAG &DAG) {
11071 SDValue Cond = Op.getOperand(0);
11072 SDValue LHS = Op.getOperand(1);
11073 SDValue RHS = Op.getOperand(2);
11075 MVT VT = Op.getSimpleValueType();
11076 MVT EltVT = VT.getVectorElementType();
11077 unsigned NumElems = VT.getVectorNumElements();
11079 // There is no blend with immediate in AVX-512.
11080 if (VT.is512BitVector())
11083 if (!Subtarget->hasSSE41() || EltVT == MVT::i8)
11085 if (!Subtarget->hasInt256() && VT == MVT::v16i16)
11088 if (!ISD::isBuildVectorOfConstantSDNodes(Cond.getNode()))
11091 // Check the mask for BLEND and build the value.
11092 unsigned MaskValue = 0;
11093 if (!BUILD_VECTORtoBlendMask(cast<BuildVectorSDNode>(Cond), MaskValue))
11096 // Convert i32 vectors to floating point if it is not AVX2.
11097 // AVX2 introduced VPBLENDD instruction for 128 and 256-bit vectors.
11099 if (EltVT == MVT::i64 || (EltVT == MVT::i32 && !Subtarget->hasInt256())) {
11100 BlendVT = MVT::getVectorVT(MVT::getFloatingPointVT(EltVT.getSizeInBits()),
11102 LHS = DAG.getNode(ISD::BITCAST, dl, VT, LHS);
11103 RHS = DAG.getNode(ISD::BITCAST, dl, VT, RHS);
11106 SDValue Ret = DAG.getNode(X86ISD::BLENDI, dl, BlendVT, LHS, RHS,
11107 DAG.getConstant(MaskValue, MVT::i32));
11108 return DAG.getNode(ISD::BITCAST, dl, VT, Ret);
11111 SDValue X86TargetLowering::LowerVSELECT(SDValue Op, SelectionDAG &DAG) const {
11112 // A vselect where all conditions and data are constants can be optimized into
11113 // a single vector load by SelectionDAGLegalize::ExpandBUILD_VECTOR().
11114 if (ISD::isBuildVectorOfConstantSDNodes(Op.getOperand(0).getNode()) &&
11115 ISD::isBuildVectorOfConstantSDNodes(Op.getOperand(1).getNode()) &&
11116 ISD::isBuildVectorOfConstantSDNodes(Op.getOperand(2).getNode()))
11119 SDValue BlendOp = LowerVSELECTtoBlend(Op, Subtarget, DAG);
11120 if (BlendOp.getNode())
11123 // Some types for vselect were previously set to Expand, not Legal or
11124 // Custom. Return an empty SDValue so we fall-through to Expand, after
11125 // the Custom lowering phase.
11126 MVT VT = Op.getSimpleValueType();
11127 switch (VT.SimpleTy) {
11132 if (Subtarget->hasBWI() && Subtarget->hasVLX())
11137 // We couldn't create a "Blend with immediate" node.
11138 // This node should still be legal, but we'll have to emit a blendv*
11143 static SDValue LowerEXTRACT_VECTOR_ELT_SSE4(SDValue Op, SelectionDAG &DAG) {
11144 MVT VT = Op.getSimpleValueType();
11147 if (!Op.getOperand(0).getSimpleValueType().is128BitVector())
11150 if (VT.getSizeInBits() == 8) {
11151 SDValue Extract = DAG.getNode(X86ISD::PEXTRB, dl, MVT::i32,
11152 Op.getOperand(0), Op.getOperand(1));
11153 SDValue Assert = DAG.getNode(ISD::AssertZext, dl, MVT::i32, Extract,
11154 DAG.getValueType(VT));
11155 return DAG.getNode(ISD::TRUNCATE, dl, VT, Assert);
11158 if (VT.getSizeInBits() == 16) {
11159 unsigned Idx = cast<ConstantSDNode>(Op.getOperand(1))->getZExtValue();
11160 // If Idx is 0, it's cheaper to do a move instead of a pextrw.
11162 return DAG.getNode(ISD::TRUNCATE, dl, MVT::i16,
11163 DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::i32,
11164 DAG.getNode(ISD::BITCAST, dl,
11167 Op.getOperand(1)));
11168 SDValue Extract = DAG.getNode(X86ISD::PEXTRW, dl, MVT::i32,
11169 Op.getOperand(0), Op.getOperand(1));
11170 SDValue Assert = DAG.getNode(ISD::AssertZext, dl, MVT::i32, Extract,
11171 DAG.getValueType(VT));
11172 return DAG.getNode(ISD::TRUNCATE, dl, VT, Assert);
11175 if (VT == MVT::f32) {
11176 // EXTRACTPS outputs to a GPR32 register which will require a movd to copy
11177 // the result back to FR32 register. It's only worth matching if the
11178 // result has a single use which is a store or a bitcast to i32. And in
11179 // the case of a store, it's not worth it if the index is a constant 0,
11180 // because a MOVSSmr can be used instead, which is smaller and faster.
11181 if (!Op.hasOneUse())
11183 SDNode *User = *Op.getNode()->use_begin();
11184 if ((User->getOpcode() != ISD::STORE ||
11185 (isa<ConstantSDNode>(Op.getOperand(1)) &&
11186 cast<ConstantSDNode>(Op.getOperand(1))->isNullValue())) &&
11187 (User->getOpcode() != ISD::BITCAST ||
11188 User->getValueType(0) != MVT::i32))
11190 SDValue Extract = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::i32,
11191 DAG.getNode(ISD::BITCAST, dl, MVT::v4i32,
11194 return DAG.getNode(ISD::BITCAST, dl, MVT::f32, Extract);
11197 if (VT == MVT::i32 || VT == MVT::i64) {
11198 // ExtractPS/pextrq works with constant index.
11199 if (isa<ConstantSDNode>(Op.getOperand(1)))
11205 /// Extract one bit from mask vector, like v16i1 or v8i1.
11206 /// AVX-512 feature.
11208 X86TargetLowering::ExtractBitFromMaskVector(SDValue Op, SelectionDAG &DAG) const {
11209 SDValue Vec = Op.getOperand(0);
11211 MVT VecVT = Vec.getSimpleValueType();
11212 SDValue Idx = Op.getOperand(1);
11213 MVT EltVT = Op.getSimpleValueType();
11215 assert((EltVT == MVT::i1) && "Unexpected operands in ExtractBitFromMaskVector");
11217 // variable index can't be handled in mask registers,
11218 // extend vector to VR512
11219 if (!isa<ConstantSDNode>(Idx)) {
11220 MVT ExtVT = (VecVT == MVT::v8i1 ? MVT::v8i64 : MVT::v16i32);
11221 SDValue Ext = DAG.getNode(ISD::ZERO_EXTEND, dl, ExtVT, Vec);
11222 SDValue Elt = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl,
11223 ExtVT.getVectorElementType(), Ext, Idx);
11224 return DAG.getNode(ISD::TRUNCATE, dl, EltVT, Elt);
11227 unsigned IdxVal = cast<ConstantSDNode>(Idx)->getZExtValue();
11228 const TargetRegisterClass* rc = getRegClassFor(VecVT);
11229 unsigned MaxSift = rc->getSize()*8 - 1;
11230 Vec = DAG.getNode(X86ISD::VSHLI, dl, VecVT, Vec,
11231 DAG.getConstant(MaxSift - IdxVal, MVT::i8));
11232 Vec = DAG.getNode(X86ISD::VSRLI, dl, VecVT, Vec,
11233 DAG.getConstant(MaxSift, MVT::i8));
11234 return DAG.getNode(X86ISD::VEXTRACT, dl, MVT::i1, Vec,
11235 DAG.getIntPtrConstant(0));
11239 X86TargetLowering::LowerEXTRACT_VECTOR_ELT(SDValue Op,
11240 SelectionDAG &DAG) const {
11242 SDValue Vec = Op.getOperand(0);
11243 MVT VecVT = Vec.getSimpleValueType();
11244 SDValue Idx = Op.getOperand(1);
11246 if (Op.getSimpleValueType() == MVT::i1)
11247 return ExtractBitFromMaskVector(Op, DAG);
11249 if (!isa<ConstantSDNode>(Idx)) {
11250 if (VecVT.is512BitVector() ||
11251 (VecVT.is256BitVector() && Subtarget->hasInt256() &&
11252 VecVT.getVectorElementType().getSizeInBits() == 32)) {
11255 MVT::getIntegerVT(VecVT.getVectorElementType().getSizeInBits());
11256 MVT MaskVT = MVT::getVectorVT(MaskEltVT, VecVT.getSizeInBits() /
11257 MaskEltVT.getSizeInBits());
11259 Idx = DAG.getZExtOrTrunc(Idx, dl, MaskEltVT);
11260 SDValue Mask = DAG.getNode(X86ISD::VINSERT, dl, MaskVT,
11261 getZeroVector(MaskVT, Subtarget, DAG, dl),
11262 Idx, DAG.getConstant(0, getPointerTy()));
11263 SDValue Perm = DAG.getNode(X86ISD::VPERMV, dl, VecVT, Mask, Vec);
11264 return DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, Op.getValueType(),
11265 Perm, DAG.getConstant(0, getPointerTy()));
11270 // If this is a 256-bit vector result, first extract the 128-bit vector and
11271 // then extract the element from the 128-bit vector.
11272 if (VecVT.is256BitVector() || VecVT.is512BitVector()) {
11274 unsigned IdxVal = cast<ConstantSDNode>(Idx)->getZExtValue();
11275 // Get the 128-bit vector.
11276 Vec = Extract128BitVector(Vec, IdxVal, DAG, dl);
11277 MVT EltVT = VecVT.getVectorElementType();
11279 unsigned ElemsPerChunk = 128 / EltVT.getSizeInBits();
11281 //if (IdxVal >= NumElems/2)
11282 // IdxVal -= NumElems/2;
11283 IdxVal -= (IdxVal/ElemsPerChunk)*ElemsPerChunk;
11284 return DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, Op.getValueType(), Vec,
11285 DAG.getConstant(IdxVal, MVT::i32));
11288 assert(VecVT.is128BitVector() && "Unexpected vector length");
11290 if (Subtarget->hasSSE41()) {
11291 SDValue Res = LowerEXTRACT_VECTOR_ELT_SSE4(Op, DAG);
11296 MVT VT = Op.getSimpleValueType();
11297 // TODO: handle v16i8.
11298 if (VT.getSizeInBits() == 16) {
11299 SDValue Vec = Op.getOperand(0);
11300 unsigned Idx = cast<ConstantSDNode>(Op.getOperand(1))->getZExtValue();
11302 return DAG.getNode(ISD::TRUNCATE, dl, MVT::i16,
11303 DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::i32,
11304 DAG.getNode(ISD::BITCAST, dl,
11306 Op.getOperand(1)));
11307 // Transform it so it match pextrw which produces a 32-bit result.
11308 MVT EltVT = MVT::i32;
11309 SDValue Extract = DAG.getNode(X86ISD::PEXTRW, dl, EltVT,
11310 Op.getOperand(0), Op.getOperand(1));
11311 SDValue Assert = DAG.getNode(ISD::AssertZext, dl, EltVT, Extract,
11312 DAG.getValueType(VT));
11313 return DAG.getNode(ISD::TRUNCATE, dl, VT, Assert);
11316 if (VT.getSizeInBits() == 32) {
11317 unsigned Idx = cast<ConstantSDNode>(Op.getOperand(1))->getZExtValue();
11321 // SHUFPS the element to the lowest double word, then movss.
11322 int Mask[4] = { static_cast<int>(Idx), -1, -1, -1 };
11323 MVT VVT = Op.getOperand(0).getSimpleValueType();
11324 SDValue Vec = DAG.getVectorShuffle(VVT, dl, Op.getOperand(0),
11325 DAG.getUNDEF(VVT), Mask);
11326 return DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, VT, Vec,
11327 DAG.getIntPtrConstant(0));
11330 if (VT.getSizeInBits() == 64) {
11331 // FIXME: .td only matches this for <2 x f64>, not <2 x i64> on 32b
11332 // FIXME: seems like this should be unnecessary if mov{h,l}pd were taught
11333 // to match extract_elt for f64.
11334 unsigned Idx = cast<ConstantSDNode>(Op.getOperand(1))->getZExtValue();
11338 // UNPCKHPD the element to the lowest double word, then movsd.
11339 // Note if the lower 64 bits of the result of the UNPCKHPD is then stored
11340 // to a f64mem, the whole operation is folded into a single MOVHPDmr.
11341 int Mask[2] = { 1, -1 };
11342 MVT VVT = Op.getOperand(0).getSimpleValueType();
11343 SDValue Vec = DAG.getVectorShuffle(VVT, dl, Op.getOperand(0),
11344 DAG.getUNDEF(VVT), Mask);
11345 return DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, VT, Vec,
11346 DAG.getIntPtrConstant(0));
11352 /// Insert one bit to mask vector, like v16i1 or v8i1.
11353 /// AVX-512 feature.
11355 X86TargetLowering::InsertBitToMaskVector(SDValue Op, SelectionDAG &DAG) const {
11357 SDValue Vec = Op.getOperand(0);
11358 SDValue Elt = Op.getOperand(1);
11359 SDValue Idx = Op.getOperand(2);
11360 MVT VecVT = Vec.getSimpleValueType();
11362 if (!isa<ConstantSDNode>(Idx)) {
11363 // Non constant index. Extend source and destination,
11364 // insert element and then truncate the result.
11365 MVT ExtVecVT = (VecVT == MVT::v8i1 ? MVT::v8i64 : MVT::v16i32);
11366 MVT ExtEltVT = (VecVT == MVT::v8i1 ? MVT::i64 : MVT::i32);
11367 SDValue ExtOp = DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, ExtVecVT,
11368 DAG.getNode(ISD::ZERO_EXTEND, dl, ExtVecVT, Vec),
11369 DAG.getNode(ISD::ZERO_EXTEND, dl, ExtEltVT, Elt), Idx);
11370 return DAG.getNode(ISD::TRUNCATE, dl, VecVT, ExtOp);
11373 unsigned IdxVal = cast<ConstantSDNode>(Idx)->getZExtValue();
11374 SDValue EltInVec = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VecVT, Elt);
11375 if (Vec.getOpcode() == ISD::UNDEF)
11376 return DAG.getNode(X86ISD::VSHLI, dl, VecVT, EltInVec,
11377 DAG.getConstant(IdxVal, MVT::i8));
11378 const TargetRegisterClass* rc = getRegClassFor(VecVT);
11379 unsigned MaxSift = rc->getSize()*8 - 1;
11380 EltInVec = DAG.getNode(X86ISD::VSHLI, dl, VecVT, EltInVec,
11381 DAG.getConstant(MaxSift, MVT::i8));
11382 EltInVec = DAG.getNode(X86ISD::VSRLI, dl, VecVT, EltInVec,
11383 DAG.getConstant(MaxSift - IdxVal, MVT::i8));
11384 return DAG.getNode(ISD::OR, dl, VecVT, Vec, EltInVec);
11387 SDValue X86TargetLowering::LowerINSERT_VECTOR_ELT(SDValue Op,
11388 SelectionDAG &DAG) const {
11389 MVT VT = Op.getSimpleValueType();
11390 MVT EltVT = VT.getVectorElementType();
11392 if (EltVT == MVT::i1)
11393 return InsertBitToMaskVector(Op, DAG);
11396 SDValue N0 = Op.getOperand(0);
11397 SDValue N1 = Op.getOperand(1);
11398 SDValue N2 = Op.getOperand(2);
11399 if (!isa<ConstantSDNode>(N2))
11401 auto *N2C = cast<ConstantSDNode>(N2);
11402 unsigned IdxVal = N2C->getZExtValue();
11404 // If the vector is wider than 128 bits, extract the 128-bit subvector, insert
11405 // into that, and then insert the subvector back into the result.
11406 if (VT.is256BitVector() || VT.is512BitVector()) {
11407 // Get the desired 128-bit vector half.
11408 SDValue V = Extract128BitVector(N0, IdxVal, DAG, dl);
11410 // Insert the element into the desired half.
11411 unsigned NumEltsIn128 = 128 / EltVT.getSizeInBits();
11412 unsigned IdxIn128 = IdxVal - (IdxVal / NumEltsIn128) * NumEltsIn128;
11414 V = DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, V.getValueType(), V, N1,
11415 DAG.getConstant(IdxIn128, MVT::i32));
11417 // Insert the changed part back to the 256-bit vector
11418 return Insert128BitVector(N0, V, IdxVal, DAG, dl);
11420 assert(VT.is128BitVector() && "Only 128-bit vector types should be left!");
11422 if (Subtarget->hasSSE41()) {
11423 if (EltVT.getSizeInBits() == 8 || EltVT.getSizeInBits() == 16) {
11425 if (VT == MVT::v8i16) {
11426 Opc = X86ISD::PINSRW;
11428 assert(VT == MVT::v16i8);
11429 Opc = X86ISD::PINSRB;
11432 // Transform it so it match pinsr{b,w} which expects a GR32 as its second
11434 if (N1.getValueType() != MVT::i32)
11435 N1 = DAG.getNode(ISD::ANY_EXTEND, dl, MVT::i32, N1);
11436 if (N2.getValueType() != MVT::i32)
11437 N2 = DAG.getIntPtrConstant(IdxVal);
11438 return DAG.getNode(Opc, dl, VT, N0, N1, N2);
11441 if (EltVT == MVT::f32) {
11442 // Bits [7:6] of the constant are the source select. This will always be
11443 // zero here. The DAG Combiner may combine an extract_elt index into
11445 // bits. For example (insert (extract, 3), 2) could be matched by
11447 // the '3' into bits [7:6] of X86ISD::INSERTPS.
11448 // Bits [5:4] of the constant are the destination select. This is the
11449 // value of the incoming immediate.
11450 // Bits [3:0] of the constant are the zero mask. The DAG Combiner may
11451 // combine either bitwise AND or insert of float 0.0 to set these bits.
11452 N2 = DAG.getIntPtrConstant(IdxVal << 4);
11453 // Create this as a scalar to vector..
11454 N1 = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, MVT::v4f32, N1);
11455 return DAG.getNode(X86ISD::INSERTPS, dl, VT, N0, N1, N2);
11458 if (EltVT == MVT::i32 || EltVT == MVT::i64) {
11459 // PINSR* works with constant index.
11464 if (EltVT == MVT::i8)
11467 if (EltVT.getSizeInBits() == 16) {
11468 // Transform it so it match pinsrw which expects a 16-bit value in a GR32
11469 // as its second argument.
11470 if (N1.getValueType() != MVT::i32)
11471 N1 = DAG.getNode(ISD::ANY_EXTEND, dl, MVT::i32, N1);
11472 if (N2.getValueType() != MVT::i32)
11473 N2 = DAG.getIntPtrConstant(IdxVal);
11474 return DAG.getNode(X86ISD::PINSRW, dl, VT, N0, N1, N2);
11479 static SDValue LowerSCALAR_TO_VECTOR(SDValue Op, SelectionDAG &DAG) {
11481 MVT OpVT = Op.getSimpleValueType();
11483 // If this is a 256-bit vector result, first insert into a 128-bit
11484 // vector and then insert into the 256-bit vector.
11485 if (!OpVT.is128BitVector()) {
11486 // Insert into a 128-bit vector.
11487 unsigned SizeFactor = OpVT.getSizeInBits()/128;
11488 MVT VT128 = MVT::getVectorVT(OpVT.getVectorElementType(),
11489 OpVT.getVectorNumElements() / SizeFactor);
11491 Op = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VT128, Op.getOperand(0));
11493 // Insert the 128-bit vector.
11494 return Insert128BitVector(DAG.getUNDEF(OpVT), Op, 0, DAG, dl);
11497 if (OpVT == MVT::v1i64 &&
11498 Op.getOperand(0).getValueType() == MVT::i64)
11499 return DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, MVT::v1i64, Op.getOperand(0));
11501 SDValue AnyExt = DAG.getNode(ISD::ANY_EXTEND, dl, MVT::i32, Op.getOperand(0));
11502 assert(OpVT.is128BitVector() && "Expected an SSE type!");
11503 return DAG.getNode(ISD::BITCAST, dl, OpVT,
11504 DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, MVT::v4i32,AnyExt));
11507 // Lower a node with an EXTRACT_SUBVECTOR opcode. This may result in
11508 // a simple subregister reference or explicit instructions to grab
11509 // upper bits of a vector.
11510 static SDValue LowerEXTRACT_SUBVECTOR(SDValue Op, const X86Subtarget *Subtarget,
11511 SelectionDAG &DAG) {
11513 SDValue In = Op.getOperand(0);
11514 SDValue Idx = Op.getOperand(1);
11515 unsigned IdxVal = cast<ConstantSDNode>(Idx)->getZExtValue();
11516 MVT ResVT = Op.getSimpleValueType();
11517 MVT InVT = In.getSimpleValueType();
11519 if (Subtarget->hasFp256()) {
11520 if (ResVT.is128BitVector() &&
11521 (InVT.is256BitVector() || InVT.is512BitVector()) &&
11522 isa<ConstantSDNode>(Idx)) {
11523 return Extract128BitVector(In, IdxVal, DAG, dl);
11525 if (ResVT.is256BitVector() && InVT.is512BitVector() &&
11526 isa<ConstantSDNode>(Idx)) {
11527 return Extract256BitVector(In, IdxVal, DAG, dl);
11533 // Lower a node with an INSERT_SUBVECTOR opcode. This may result in a
11534 // simple superregister reference or explicit instructions to insert
11535 // the upper bits of a vector.
11536 static SDValue LowerINSERT_SUBVECTOR(SDValue Op, const X86Subtarget *Subtarget,
11537 SelectionDAG &DAG) {
11538 if (Subtarget->hasFp256()) {
11539 SDLoc dl(Op.getNode());
11540 SDValue Vec = Op.getNode()->getOperand(0);
11541 SDValue SubVec = Op.getNode()->getOperand(1);
11542 SDValue Idx = Op.getNode()->getOperand(2);
11544 if ((Op.getNode()->getSimpleValueType(0).is256BitVector() ||
11545 Op.getNode()->getSimpleValueType(0).is512BitVector()) &&
11546 SubVec.getNode()->getSimpleValueType(0).is128BitVector() &&
11547 isa<ConstantSDNode>(Idx)) {
11548 unsigned IdxVal = cast<ConstantSDNode>(Idx)->getZExtValue();
11549 return Insert128BitVector(Vec, SubVec, IdxVal, DAG, dl);
11552 if (Op.getNode()->getSimpleValueType(0).is512BitVector() &&
11553 SubVec.getNode()->getSimpleValueType(0).is256BitVector() &&
11554 isa<ConstantSDNode>(Idx)) {
11555 unsigned IdxVal = cast<ConstantSDNode>(Idx)->getZExtValue();
11556 return Insert256BitVector(Vec, SubVec, IdxVal, DAG, dl);
11562 // ConstantPool, JumpTable, GlobalAddress, and ExternalSymbol are lowered as
11563 // their target countpart wrapped in the X86ISD::Wrapper node. Suppose N is
11564 // one of the above mentioned nodes. It has to be wrapped because otherwise
11565 // Select(N) returns N. So the raw TargetGlobalAddress nodes, etc. can only
11566 // be used to form addressing mode. These wrapped nodes will be selected
11569 X86TargetLowering::LowerConstantPool(SDValue Op, SelectionDAG &DAG) const {
11570 ConstantPoolSDNode *CP = cast<ConstantPoolSDNode>(Op);
11572 // In PIC mode (unless we're in RIPRel PIC mode) we add an offset to the
11573 // global base reg.
11574 unsigned char OpFlag = 0;
11575 unsigned WrapperKind = X86ISD::Wrapper;
11576 CodeModel::Model M = DAG.getTarget().getCodeModel();
11578 if (Subtarget->isPICStyleRIPRel() &&
11579 (M == CodeModel::Small || M == CodeModel::Kernel))
11580 WrapperKind = X86ISD::WrapperRIP;
11581 else if (Subtarget->isPICStyleGOT())
11582 OpFlag = X86II::MO_GOTOFF;
11583 else if (Subtarget->isPICStyleStubPIC())
11584 OpFlag = X86II::MO_PIC_BASE_OFFSET;
11586 SDValue Result = DAG.getTargetConstantPool(CP->getConstVal(), getPointerTy(),
11587 CP->getAlignment(),
11588 CP->getOffset(), OpFlag);
11590 Result = DAG.getNode(WrapperKind, DL, getPointerTy(), Result);
11591 // With PIC, the address is actually $g + Offset.
11593 Result = DAG.getNode(ISD::ADD, DL, getPointerTy(),
11594 DAG.getNode(X86ISD::GlobalBaseReg,
11595 SDLoc(), getPointerTy()),
11602 SDValue X86TargetLowering::LowerJumpTable(SDValue Op, SelectionDAG &DAG) const {
11603 JumpTableSDNode *JT = cast<JumpTableSDNode>(Op);
11605 // In PIC mode (unless we're in RIPRel PIC mode) we add an offset to the
11606 // global base reg.
11607 unsigned char OpFlag = 0;
11608 unsigned WrapperKind = X86ISD::Wrapper;
11609 CodeModel::Model M = DAG.getTarget().getCodeModel();
11611 if (Subtarget->isPICStyleRIPRel() &&
11612 (M == CodeModel::Small || M == CodeModel::Kernel))
11613 WrapperKind = X86ISD::WrapperRIP;
11614 else if (Subtarget->isPICStyleGOT())
11615 OpFlag = X86II::MO_GOTOFF;
11616 else if (Subtarget->isPICStyleStubPIC())
11617 OpFlag = X86II::MO_PIC_BASE_OFFSET;
11619 SDValue Result = DAG.getTargetJumpTable(JT->getIndex(), getPointerTy(),
11622 Result = DAG.getNode(WrapperKind, DL, getPointerTy(), Result);
11624 // With PIC, the address is actually $g + Offset.
11626 Result = DAG.getNode(ISD::ADD, DL, getPointerTy(),
11627 DAG.getNode(X86ISD::GlobalBaseReg,
11628 SDLoc(), getPointerTy()),
11635 X86TargetLowering::LowerExternalSymbol(SDValue Op, SelectionDAG &DAG) const {
11636 const char *Sym = cast<ExternalSymbolSDNode>(Op)->getSymbol();
11638 // In PIC mode (unless we're in RIPRel PIC mode) we add an offset to the
11639 // global base reg.
11640 unsigned char OpFlag = 0;
11641 unsigned WrapperKind = X86ISD::Wrapper;
11642 CodeModel::Model M = DAG.getTarget().getCodeModel();
11644 if (Subtarget->isPICStyleRIPRel() &&
11645 (M == CodeModel::Small || M == CodeModel::Kernel)) {
11646 if (Subtarget->isTargetDarwin() || Subtarget->isTargetELF())
11647 OpFlag = X86II::MO_GOTPCREL;
11648 WrapperKind = X86ISD::WrapperRIP;
11649 } else if (Subtarget->isPICStyleGOT()) {
11650 OpFlag = X86II::MO_GOT;
11651 } else if (Subtarget->isPICStyleStubPIC()) {
11652 OpFlag = X86II::MO_DARWIN_NONLAZY_PIC_BASE;
11653 } else if (Subtarget->isPICStyleStubNoDynamic()) {
11654 OpFlag = X86II::MO_DARWIN_NONLAZY;
11657 SDValue Result = DAG.getTargetExternalSymbol(Sym, getPointerTy(), OpFlag);
11660 Result = DAG.getNode(WrapperKind, DL, getPointerTy(), Result);
11662 // With PIC, the address is actually $g + Offset.
11663 if (DAG.getTarget().getRelocationModel() == Reloc::PIC_ &&
11664 !Subtarget->is64Bit()) {
11665 Result = DAG.getNode(ISD::ADD, DL, getPointerTy(),
11666 DAG.getNode(X86ISD::GlobalBaseReg,
11667 SDLoc(), getPointerTy()),
11671 // For symbols that require a load from a stub to get the address, emit the
11673 if (isGlobalStubReference(OpFlag))
11674 Result = DAG.getLoad(getPointerTy(), DL, DAG.getEntryNode(), Result,
11675 MachinePointerInfo::getGOT(), false, false, false, 0);
11681 X86TargetLowering::LowerBlockAddress(SDValue Op, SelectionDAG &DAG) const {
11682 // Create the TargetBlockAddressAddress node.
11683 unsigned char OpFlags =
11684 Subtarget->ClassifyBlockAddressReference();
11685 CodeModel::Model M = DAG.getTarget().getCodeModel();
11686 const BlockAddress *BA = cast<BlockAddressSDNode>(Op)->getBlockAddress();
11687 int64_t Offset = cast<BlockAddressSDNode>(Op)->getOffset();
11689 SDValue Result = DAG.getTargetBlockAddress(BA, getPointerTy(), Offset,
11692 if (Subtarget->isPICStyleRIPRel() &&
11693 (M == CodeModel::Small || M == CodeModel::Kernel))
11694 Result = DAG.getNode(X86ISD::WrapperRIP, dl, getPointerTy(), Result);
11696 Result = DAG.getNode(X86ISD::Wrapper, dl, getPointerTy(), Result);
11698 // With PIC, the address is actually $g + Offset.
11699 if (isGlobalRelativeToPICBase(OpFlags)) {
11700 Result = DAG.getNode(ISD::ADD, dl, getPointerTy(),
11701 DAG.getNode(X86ISD::GlobalBaseReg, dl, getPointerTy()),
11709 X86TargetLowering::LowerGlobalAddress(const GlobalValue *GV, SDLoc dl,
11710 int64_t Offset, SelectionDAG &DAG) const {
11711 // Create the TargetGlobalAddress node, folding in the constant
11712 // offset if it is legal.
11713 unsigned char OpFlags =
11714 Subtarget->ClassifyGlobalReference(GV, DAG.getTarget());
11715 CodeModel::Model M = DAG.getTarget().getCodeModel();
11717 if (OpFlags == X86II::MO_NO_FLAG &&
11718 X86::isOffsetSuitableForCodeModel(Offset, M)) {
11719 // A direct static reference to a global.
11720 Result = DAG.getTargetGlobalAddress(GV, dl, getPointerTy(), Offset);
11723 Result = DAG.getTargetGlobalAddress(GV, dl, getPointerTy(), 0, OpFlags);
11726 if (Subtarget->isPICStyleRIPRel() &&
11727 (M == CodeModel::Small || M == CodeModel::Kernel))
11728 Result = DAG.getNode(X86ISD::WrapperRIP, dl, getPointerTy(), Result);
11730 Result = DAG.getNode(X86ISD::Wrapper, dl, getPointerTy(), Result);
11732 // With PIC, the address is actually $g + Offset.
11733 if (isGlobalRelativeToPICBase(OpFlags)) {
11734 Result = DAG.getNode(ISD::ADD, dl, getPointerTy(),
11735 DAG.getNode(X86ISD::GlobalBaseReg, dl, getPointerTy()),
11739 // For globals that require a load from a stub to get the address, emit the
11741 if (isGlobalStubReference(OpFlags))
11742 Result = DAG.getLoad(getPointerTy(), dl, DAG.getEntryNode(), Result,
11743 MachinePointerInfo::getGOT(), false, false, false, 0);
11745 // If there was a non-zero offset that we didn't fold, create an explicit
11746 // addition for it.
11748 Result = DAG.getNode(ISD::ADD, dl, getPointerTy(), Result,
11749 DAG.getConstant(Offset, getPointerTy()));
11755 X86TargetLowering::LowerGlobalAddress(SDValue Op, SelectionDAG &DAG) const {
11756 const GlobalValue *GV = cast<GlobalAddressSDNode>(Op)->getGlobal();
11757 int64_t Offset = cast<GlobalAddressSDNode>(Op)->getOffset();
11758 return LowerGlobalAddress(GV, SDLoc(Op), Offset, DAG);
11762 GetTLSADDR(SelectionDAG &DAG, SDValue Chain, GlobalAddressSDNode *GA,
11763 SDValue *InFlag, const EVT PtrVT, unsigned ReturnReg,
11764 unsigned char OperandFlags, bool LocalDynamic = false) {
11765 MachineFrameInfo *MFI = DAG.getMachineFunction().getFrameInfo();
11766 SDVTList NodeTys = DAG.getVTList(MVT::Other, MVT::Glue);
11768 SDValue TGA = DAG.getTargetGlobalAddress(GA->getGlobal(), dl,
11769 GA->getValueType(0),
11773 X86ISD::NodeType CallType = LocalDynamic ? X86ISD::TLSBASEADDR
11777 SDValue Ops[] = { Chain, TGA, *InFlag };
11778 Chain = DAG.getNode(CallType, dl, NodeTys, Ops);
11780 SDValue Ops[] = { Chain, TGA };
11781 Chain = DAG.getNode(CallType, dl, NodeTys, Ops);
11784 // TLSADDR will be codegen'ed as call. Inform MFI that function has calls.
11785 MFI->setAdjustsStack(true);
11787 SDValue Flag = Chain.getValue(1);
11788 return DAG.getCopyFromReg(Chain, dl, ReturnReg, PtrVT, Flag);
11791 // Lower ISD::GlobalTLSAddress using the "general dynamic" model, 32 bit
11793 LowerToTLSGeneralDynamicModel32(GlobalAddressSDNode *GA, SelectionDAG &DAG,
11796 SDLoc dl(GA); // ? function entry point might be better
11797 SDValue Chain = DAG.getCopyToReg(DAG.getEntryNode(), dl, X86::EBX,
11798 DAG.getNode(X86ISD::GlobalBaseReg,
11799 SDLoc(), PtrVT), InFlag);
11800 InFlag = Chain.getValue(1);
11802 return GetTLSADDR(DAG, Chain, GA, &InFlag, PtrVT, X86::EAX, X86II::MO_TLSGD);
11805 // Lower ISD::GlobalTLSAddress using the "general dynamic" model, 64 bit
11807 LowerToTLSGeneralDynamicModel64(GlobalAddressSDNode *GA, SelectionDAG &DAG,
11809 return GetTLSADDR(DAG, DAG.getEntryNode(), GA, nullptr, PtrVT,
11810 X86::RAX, X86II::MO_TLSGD);
11813 static SDValue LowerToTLSLocalDynamicModel(GlobalAddressSDNode *GA,
11819 // Get the start address of the TLS block for this module.
11820 X86MachineFunctionInfo* MFI = DAG.getMachineFunction()
11821 .getInfo<X86MachineFunctionInfo>();
11822 MFI->incNumLocalDynamicTLSAccesses();
11826 Base = GetTLSADDR(DAG, DAG.getEntryNode(), GA, nullptr, PtrVT, X86::RAX,
11827 X86II::MO_TLSLD, /*LocalDynamic=*/true);
11830 SDValue Chain = DAG.getCopyToReg(DAG.getEntryNode(), dl, X86::EBX,
11831 DAG.getNode(X86ISD::GlobalBaseReg, SDLoc(), PtrVT), InFlag);
11832 InFlag = Chain.getValue(1);
11833 Base = GetTLSADDR(DAG, Chain, GA, &InFlag, PtrVT, X86::EAX,
11834 X86II::MO_TLSLDM, /*LocalDynamic=*/true);
11837 // Note: the CleanupLocalDynamicTLSPass will remove redundant computations
11841 unsigned char OperandFlags = X86II::MO_DTPOFF;
11842 unsigned WrapperKind = X86ISD::Wrapper;
11843 SDValue TGA = DAG.getTargetGlobalAddress(GA->getGlobal(), dl,
11844 GA->getValueType(0),
11845 GA->getOffset(), OperandFlags);
11846 SDValue Offset = DAG.getNode(WrapperKind, dl, PtrVT, TGA);
11848 // Add x@dtpoff with the base.
11849 return DAG.getNode(ISD::ADD, dl, PtrVT, Offset, Base);
11852 // Lower ISD::GlobalTLSAddress using the "initial exec" or "local exec" model.
11853 static SDValue LowerToTLSExecModel(GlobalAddressSDNode *GA, SelectionDAG &DAG,
11854 const EVT PtrVT, TLSModel::Model model,
11855 bool is64Bit, bool isPIC) {
11858 // Get the Thread Pointer, which is %gs:0 (32-bit) or %fs:0 (64-bit).
11859 Value *Ptr = Constant::getNullValue(Type::getInt8PtrTy(*DAG.getContext(),
11860 is64Bit ? 257 : 256));
11862 SDValue ThreadPointer =
11863 DAG.getLoad(PtrVT, dl, DAG.getEntryNode(), DAG.getIntPtrConstant(0),
11864 MachinePointerInfo(Ptr), false, false, false, 0);
11866 unsigned char OperandFlags = 0;
11867 // Most TLS accesses are not RIP relative, even on x86-64. One exception is
11869 unsigned WrapperKind = X86ISD::Wrapper;
11870 if (model == TLSModel::LocalExec) {
11871 OperandFlags = is64Bit ? X86II::MO_TPOFF : X86II::MO_NTPOFF;
11872 } else if (model == TLSModel::InitialExec) {
11874 OperandFlags = X86II::MO_GOTTPOFF;
11875 WrapperKind = X86ISD::WrapperRIP;
11877 OperandFlags = isPIC ? X86II::MO_GOTNTPOFF : X86II::MO_INDNTPOFF;
11880 llvm_unreachable("Unexpected model");
11883 // emit "addl x@ntpoff,%eax" (local exec)
11884 // or "addl x@indntpoff,%eax" (initial exec)
11885 // or "addl x@gotntpoff(%ebx) ,%eax" (initial exec, 32-bit pic)
11887 DAG.getTargetGlobalAddress(GA->getGlobal(), dl, GA->getValueType(0),
11888 GA->getOffset(), OperandFlags);
11889 SDValue Offset = DAG.getNode(WrapperKind, dl, PtrVT, TGA);
11891 if (model == TLSModel::InitialExec) {
11892 if (isPIC && !is64Bit) {
11893 Offset = DAG.getNode(ISD::ADD, dl, PtrVT,
11894 DAG.getNode(X86ISD::GlobalBaseReg, SDLoc(), PtrVT),
11898 Offset = DAG.getLoad(PtrVT, dl, DAG.getEntryNode(), Offset,
11899 MachinePointerInfo::getGOT(), false, false, false, 0);
11902 // The address of the thread local variable is the add of the thread
11903 // pointer with the offset of the variable.
11904 return DAG.getNode(ISD::ADD, dl, PtrVT, ThreadPointer, Offset);
11908 X86TargetLowering::LowerGlobalTLSAddress(SDValue Op, SelectionDAG &DAG) const {
11910 GlobalAddressSDNode *GA = cast<GlobalAddressSDNode>(Op);
11911 const GlobalValue *GV = GA->getGlobal();
11913 if (Subtarget->isTargetELF()) {
11914 TLSModel::Model model = DAG.getTarget().getTLSModel(GV);
11917 case TLSModel::GeneralDynamic:
11918 if (Subtarget->is64Bit())
11919 return LowerToTLSGeneralDynamicModel64(GA, DAG, getPointerTy());
11920 return LowerToTLSGeneralDynamicModel32(GA, DAG, getPointerTy());
11921 case TLSModel::LocalDynamic:
11922 return LowerToTLSLocalDynamicModel(GA, DAG, getPointerTy(),
11923 Subtarget->is64Bit());
11924 case TLSModel::InitialExec:
11925 case TLSModel::LocalExec:
11926 return LowerToTLSExecModel(
11927 GA, DAG, getPointerTy(), model, Subtarget->is64Bit(),
11928 DAG.getTarget().getRelocationModel() == Reloc::PIC_);
11930 llvm_unreachable("Unknown TLS model.");
11933 if (Subtarget->isTargetDarwin()) {
11934 // Darwin only has one model of TLS. Lower to that.
11935 unsigned char OpFlag = 0;
11936 unsigned WrapperKind = Subtarget->isPICStyleRIPRel() ?
11937 X86ISD::WrapperRIP : X86ISD::Wrapper;
11939 // In PIC mode (unless we're in RIPRel PIC mode) we add an offset to the
11940 // global base reg.
11941 bool PIC32 = (DAG.getTarget().getRelocationModel() == Reloc::PIC_) &&
11942 !Subtarget->is64Bit();
11944 OpFlag = X86II::MO_TLVP_PIC_BASE;
11946 OpFlag = X86II::MO_TLVP;
11948 SDValue Result = DAG.getTargetGlobalAddress(GA->getGlobal(), DL,
11949 GA->getValueType(0),
11950 GA->getOffset(), OpFlag);
11951 SDValue Offset = DAG.getNode(WrapperKind, DL, getPointerTy(), Result);
11953 // With PIC32, the address is actually $g + Offset.
11955 Offset = DAG.getNode(ISD::ADD, DL, getPointerTy(),
11956 DAG.getNode(X86ISD::GlobalBaseReg,
11957 SDLoc(), getPointerTy()),
11960 // Lowering the machine isd will make sure everything is in the right
11962 SDValue Chain = DAG.getEntryNode();
11963 SDVTList NodeTys = DAG.getVTList(MVT::Other, MVT::Glue);
11964 SDValue Args[] = { Chain, Offset };
11965 Chain = DAG.getNode(X86ISD::TLSCALL, DL, NodeTys, Args);
11967 // TLSCALL will be codegen'ed as call. Inform MFI that function has calls.
11968 MachineFrameInfo *MFI = DAG.getMachineFunction().getFrameInfo();
11969 MFI->setAdjustsStack(true);
11971 // And our return value (tls address) is in the standard call return value
11973 unsigned Reg = Subtarget->is64Bit() ? X86::RAX : X86::EAX;
11974 return DAG.getCopyFromReg(Chain, DL, Reg, getPointerTy(),
11975 Chain.getValue(1));
11978 if (Subtarget->isTargetKnownWindowsMSVC() ||
11979 Subtarget->isTargetWindowsGNU()) {
11980 // Just use the implicit TLS architecture
11981 // Need to generate someting similar to:
11982 // mov rdx, qword [gs:abs 58H]; Load pointer to ThreadLocalStorage
11984 // mov ecx, dword [rel _tls_index]: Load index (from C runtime)
11985 // mov rcx, qword [rdx+rcx*8]
11986 // mov eax, .tls$:tlsvar
11987 // [rax+rcx] contains the address
11988 // Windows 64bit: gs:0x58
11989 // Windows 32bit: fs:__tls_array
11992 SDValue Chain = DAG.getEntryNode();
11994 // Get the Thread Pointer, which is %fs:__tls_array (32-bit) or
11995 // %gs:0x58 (64-bit). On MinGW, __tls_array is not available, so directly
11996 // use its literal value of 0x2C.
11997 Value *Ptr = Constant::getNullValue(Subtarget->is64Bit()
11998 ? Type::getInt8PtrTy(*DAG.getContext(),
12000 : Type::getInt32PtrTy(*DAG.getContext(),
12004 Subtarget->is64Bit()
12005 ? DAG.getIntPtrConstant(0x58)
12006 : (Subtarget->isTargetWindowsGNU()
12007 ? DAG.getIntPtrConstant(0x2C)
12008 : DAG.getExternalSymbol("_tls_array", getPointerTy()));
12010 SDValue ThreadPointer =
12011 DAG.getLoad(getPointerTy(), dl, Chain, TlsArray,
12012 MachinePointerInfo(Ptr), false, false, false, 0);
12014 // Load the _tls_index variable
12015 SDValue IDX = DAG.getExternalSymbol("_tls_index", getPointerTy());
12016 if (Subtarget->is64Bit())
12017 IDX = DAG.getExtLoad(ISD::ZEXTLOAD, dl, getPointerTy(), Chain,
12018 IDX, MachinePointerInfo(), MVT::i32,
12019 false, false, false, 0);
12021 IDX = DAG.getLoad(getPointerTy(), dl, Chain, IDX, MachinePointerInfo(),
12022 false, false, false, 0);
12024 SDValue Scale = DAG.getConstant(Log2_64_Ceil(TD->getPointerSize()),
12026 IDX = DAG.getNode(ISD::SHL, dl, getPointerTy(), IDX, Scale);
12028 SDValue res = DAG.getNode(ISD::ADD, dl, getPointerTy(), ThreadPointer, IDX);
12029 res = DAG.getLoad(getPointerTy(), dl, Chain, res, MachinePointerInfo(),
12030 false, false, false, 0);
12032 // Get the offset of start of .tls section
12033 SDValue TGA = DAG.getTargetGlobalAddress(GA->getGlobal(), dl,
12034 GA->getValueType(0),
12035 GA->getOffset(), X86II::MO_SECREL);
12036 SDValue Offset = DAG.getNode(X86ISD::Wrapper, dl, getPointerTy(), TGA);
12038 // The address of the thread local variable is the add of the thread
12039 // pointer with the offset of the variable.
12040 return DAG.getNode(ISD::ADD, dl, getPointerTy(), res, Offset);
12043 llvm_unreachable("TLS not implemented for this target.");
12046 /// LowerShiftParts - Lower SRA_PARTS and friends, which return two i32 values
12047 /// and take a 2 x i32 value to shift plus a shift amount.
12048 static SDValue LowerShiftParts(SDValue Op, SelectionDAG &DAG) {
12049 assert(Op.getNumOperands() == 3 && "Not a double-shift!");
12050 MVT VT = Op.getSimpleValueType();
12051 unsigned VTBits = VT.getSizeInBits();
12053 bool isSRA = Op.getOpcode() == ISD::SRA_PARTS;
12054 SDValue ShOpLo = Op.getOperand(0);
12055 SDValue ShOpHi = Op.getOperand(1);
12056 SDValue ShAmt = Op.getOperand(2);
12057 // X86ISD::SHLD and X86ISD::SHRD have defined overflow behavior but the
12058 // generic ISD nodes haven't. Insert an AND to be safe, it's optimized away
12060 SDValue SafeShAmt = DAG.getNode(ISD::AND, dl, MVT::i8, ShAmt,
12061 DAG.getConstant(VTBits - 1, MVT::i8));
12062 SDValue Tmp1 = isSRA ? DAG.getNode(ISD::SRA, dl, VT, ShOpHi,
12063 DAG.getConstant(VTBits - 1, MVT::i8))
12064 : DAG.getConstant(0, VT);
12066 SDValue Tmp2, Tmp3;
12067 if (Op.getOpcode() == ISD::SHL_PARTS) {
12068 Tmp2 = DAG.getNode(X86ISD::SHLD, dl, VT, ShOpHi, ShOpLo, ShAmt);
12069 Tmp3 = DAG.getNode(ISD::SHL, dl, VT, ShOpLo, SafeShAmt);
12071 Tmp2 = DAG.getNode(X86ISD::SHRD, dl, VT, ShOpLo, ShOpHi, ShAmt);
12072 Tmp3 = DAG.getNode(isSRA ? ISD::SRA : ISD::SRL, dl, VT, ShOpHi, SafeShAmt);
12075 // If the shift amount is larger or equal than the width of a part we can't
12076 // rely on the results of shld/shrd. Insert a test and select the appropriate
12077 // values for large shift amounts.
12078 SDValue AndNode = DAG.getNode(ISD::AND, dl, MVT::i8, ShAmt,
12079 DAG.getConstant(VTBits, MVT::i8));
12080 SDValue Cond = DAG.getNode(X86ISD::CMP, dl, MVT::i32,
12081 AndNode, DAG.getConstant(0, MVT::i8));
12084 SDValue CC = DAG.getConstant(X86::COND_NE, MVT::i8);
12085 SDValue Ops0[4] = { Tmp2, Tmp3, CC, Cond };
12086 SDValue Ops1[4] = { Tmp3, Tmp1, CC, Cond };
12088 if (Op.getOpcode() == ISD::SHL_PARTS) {
12089 Hi = DAG.getNode(X86ISD::CMOV, dl, VT, Ops0);
12090 Lo = DAG.getNode(X86ISD::CMOV, dl, VT, Ops1);
12092 Lo = DAG.getNode(X86ISD::CMOV, dl, VT, Ops0);
12093 Hi = DAG.getNode(X86ISD::CMOV, dl, VT, Ops1);
12096 SDValue Ops[2] = { Lo, Hi };
12097 return DAG.getMergeValues(Ops, dl);
12100 SDValue X86TargetLowering::LowerSINT_TO_FP(SDValue Op,
12101 SelectionDAG &DAG) const {
12102 MVT SrcVT = Op.getOperand(0).getSimpleValueType();
12104 if (SrcVT.isVector())
12107 assert(SrcVT <= MVT::i64 && SrcVT >= MVT::i16 &&
12108 "Unknown SINT_TO_FP to lower!");
12110 // These are really Legal; return the operand so the caller accepts it as
12112 if (SrcVT == MVT::i32 && isScalarFPTypeInSSEReg(Op.getValueType()))
12114 if (SrcVT == MVT::i64 && isScalarFPTypeInSSEReg(Op.getValueType()) &&
12115 Subtarget->is64Bit()) {
12120 unsigned Size = SrcVT.getSizeInBits()/8;
12121 MachineFunction &MF = DAG.getMachineFunction();
12122 int SSFI = MF.getFrameInfo()->CreateStackObject(Size, Size, false);
12123 SDValue StackSlot = DAG.getFrameIndex(SSFI, getPointerTy());
12124 SDValue Chain = DAG.getStore(DAG.getEntryNode(), dl, Op.getOperand(0),
12126 MachinePointerInfo::getFixedStack(SSFI),
12128 return BuildFILD(Op, SrcVT, Chain, StackSlot, DAG);
12131 SDValue X86TargetLowering::BuildFILD(SDValue Op, EVT SrcVT, SDValue Chain,
12133 SelectionDAG &DAG) const {
12137 bool useSSE = isScalarFPTypeInSSEReg(Op.getValueType());
12139 Tys = DAG.getVTList(MVT::f64, MVT::Other, MVT::Glue);
12141 Tys = DAG.getVTList(Op.getValueType(), MVT::Other);
12143 unsigned ByteSize = SrcVT.getSizeInBits()/8;
12145 FrameIndexSDNode *FI = dyn_cast<FrameIndexSDNode>(StackSlot);
12146 MachineMemOperand *MMO;
12148 int SSFI = FI->getIndex();
12150 DAG.getMachineFunction()
12151 .getMachineMemOperand(MachinePointerInfo::getFixedStack(SSFI),
12152 MachineMemOperand::MOLoad, ByteSize, ByteSize);
12154 MMO = cast<LoadSDNode>(StackSlot)->getMemOperand();
12155 StackSlot = StackSlot.getOperand(1);
12157 SDValue Ops[] = { Chain, StackSlot, DAG.getValueType(SrcVT) };
12158 SDValue Result = DAG.getMemIntrinsicNode(useSSE ? X86ISD::FILD_FLAG :
12160 Tys, Ops, SrcVT, MMO);
12163 Chain = Result.getValue(1);
12164 SDValue InFlag = Result.getValue(2);
12166 // FIXME: Currently the FST is flagged to the FILD_FLAG. This
12167 // shouldn't be necessary except that RFP cannot be live across
12168 // multiple blocks. When stackifier is fixed, they can be uncoupled.
12169 MachineFunction &MF = DAG.getMachineFunction();
12170 unsigned SSFISize = Op.getValueType().getSizeInBits()/8;
12171 int SSFI = MF.getFrameInfo()->CreateStackObject(SSFISize, SSFISize, false);
12172 SDValue StackSlot = DAG.getFrameIndex(SSFI, getPointerTy());
12173 Tys = DAG.getVTList(MVT::Other);
12175 Chain, Result, StackSlot, DAG.getValueType(Op.getValueType()), InFlag
12177 MachineMemOperand *MMO =
12178 DAG.getMachineFunction()
12179 .getMachineMemOperand(MachinePointerInfo::getFixedStack(SSFI),
12180 MachineMemOperand::MOStore, SSFISize, SSFISize);
12182 Chain = DAG.getMemIntrinsicNode(X86ISD::FST, DL, Tys,
12183 Ops, Op.getValueType(), MMO);
12184 Result = DAG.getLoad(Op.getValueType(), DL, Chain, StackSlot,
12185 MachinePointerInfo::getFixedStack(SSFI),
12186 false, false, false, 0);
12192 // LowerUINT_TO_FP_i64 - 64-bit unsigned integer to double expansion.
12193 SDValue X86TargetLowering::LowerUINT_TO_FP_i64(SDValue Op,
12194 SelectionDAG &DAG) const {
12195 // This algorithm is not obvious. Here it is what we're trying to output:
12198 punpckldq (c0), %xmm0 // c0: (uint4){ 0x43300000U, 0x45300000U, 0U, 0U }
12199 subpd (c1), %xmm0 // c1: (double2){ 0x1.0p52, 0x1.0p52 * 0x1.0p32 }
12201 haddpd %xmm0, %xmm0
12203 pshufd $0x4e, %xmm0, %xmm1
12209 LLVMContext *Context = DAG.getContext();
12211 // Build some magic constants.
12212 static const uint32_t CV0[] = { 0x43300000, 0x45300000, 0, 0 };
12213 Constant *C0 = ConstantDataVector::get(*Context, CV0);
12214 SDValue CPIdx0 = DAG.getConstantPool(C0, getPointerTy(), 16);
12216 SmallVector<Constant*,2> CV1;
12218 ConstantFP::get(*Context, APFloat(APFloat::IEEEdouble,
12219 APInt(64, 0x4330000000000000ULL))));
12221 ConstantFP::get(*Context, APFloat(APFloat::IEEEdouble,
12222 APInt(64, 0x4530000000000000ULL))));
12223 Constant *C1 = ConstantVector::get(CV1);
12224 SDValue CPIdx1 = DAG.getConstantPool(C1, getPointerTy(), 16);
12226 // Load the 64-bit value into an XMM register.
12227 SDValue XR1 = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, MVT::v2i64,
12229 SDValue CLod0 = DAG.getLoad(MVT::v4i32, dl, DAG.getEntryNode(), CPIdx0,
12230 MachinePointerInfo::getConstantPool(),
12231 false, false, false, 16);
12232 SDValue Unpck1 = getUnpackl(DAG, dl, MVT::v4i32,
12233 DAG.getNode(ISD::BITCAST, dl, MVT::v4i32, XR1),
12236 SDValue CLod1 = DAG.getLoad(MVT::v2f64, dl, CLod0.getValue(1), CPIdx1,
12237 MachinePointerInfo::getConstantPool(),
12238 false, false, false, 16);
12239 SDValue XR2F = DAG.getNode(ISD::BITCAST, dl, MVT::v2f64, Unpck1);
12240 SDValue Sub = DAG.getNode(ISD::FSUB, dl, MVT::v2f64, XR2F, CLod1);
12243 if (Subtarget->hasSSE3()) {
12244 // FIXME: The 'haddpd' instruction may be slower than 'movhlps + addsd'.
12245 Result = DAG.getNode(X86ISD::FHADD, dl, MVT::v2f64, Sub, Sub);
12247 SDValue S2F = DAG.getNode(ISD::BITCAST, dl, MVT::v4i32, Sub);
12248 SDValue Shuffle = getTargetShuffleNode(X86ISD::PSHUFD, dl, MVT::v4i32,
12250 Result = DAG.getNode(ISD::FADD, dl, MVT::v2f64,
12251 DAG.getNode(ISD::BITCAST, dl, MVT::v2f64, Shuffle),
12255 return DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::f64, Result,
12256 DAG.getIntPtrConstant(0));
12259 // LowerUINT_TO_FP_i32 - 32-bit unsigned integer to float expansion.
12260 SDValue X86TargetLowering::LowerUINT_TO_FP_i32(SDValue Op,
12261 SelectionDAG &DAG) const {
12263 // FP constant to bias correct the final result.
12264 SDValue Bias = DAG.getConstantFP(BitsToDouble(0x4330000000000000ULL),
12267 // Load the 32-bit value into an XMM register.
12268 SDValue Load = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, MVT::v4i32,
12271 // Zero out the upper parts of the register.
12272 Load = getShuffleVectorZeroOrUndef(Load, 0, true, Subtarget, DAG);
12274 Load = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::f64,
12275 DAG.getNode(ISD::BITCAST, dl, MVT::v2f64, Load),
12276 DAG.getIntPtrConstant(0));
12278 // Or the load with the bias.
12279 SDValue Or = DAG.getNode(ISD::OR, dl, MVT::v2i64,
12280 DAG.getNode(ISD::BITCAST, dl, MVT::v2i64,
12281 DAG.getNode(ISD::SCALAR_TO_VECTOR, dl,
12282 MVT::v2f64, Load)),
12283 DAG.getNode(ISD::BITCAST, dl, MVT::v2i64,
12284 DAG.getNode(ISD::SCALAR_TO_VECTOR, dl,
12285 MVT::v2f64, Bias)));
12286 Or = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::f64,
12287 DAG.getNode(ISD::BITCAST, dl, MVT::v2f64, Or),
12288 DAG.getIntPtrConstant(0));
12290 // Subtract the bias.
12291 SDValue Sub = DAG.getNode(ISD::FSUB, dl, MVT::f64, Or, Bias);
12293 // Handle final rounding.
12294 EVT DestVT = Op.getValueType();
12296 if (DestVT.bitsLT(MVT::f64))
12297 return DAG.getNode(ISD::FP_ROUND, dl, DestVT, Sub,
12298 DAG.getIntPtrConstant(0));
12299 if (DestVT.bitsGT(MVT::f64))
12300 return DAG.getNode(ISD::FP_EXTEND, dl, DestVT, Sub);
12302 // Handle final rounding.
12306 SDValue X86TargetLowering::lowerUINT_TO_FP_vec(SDValue Op,
12307 SelectionDAG &DAG) const {
12308 SDValue N0 = Op.getOperand(0);
12309 MVT SVT = N0.getSimpleValueType();
12312 assert((SVT == MVT::v4i8 || SVT == MVT::v4i16 ||
12313 SVT == MVT::v8i8 || SVT == MVT::v8i16) &&
12314 "Custom UINT_TO_FP is not supported!");
12316 MVT NVT = MVT::getVectorVT(MVT::i32, SVT.getVectorNumElements());
12317 return DAG.getNode(ISD::SINT_TO_FP, dl, Op.getValueType(),
12318 DAG.getNode(ISD::ZERO_EXTEND, dl, NVT, N0));
12321 SDValue X86TargetLowering::LowerUINT_TO_FP(SDValue Op,
12322 SelectionDAG &DAG) const {
12323 SDValue N0 = Op.getOperand(0);
12326 if (Op.getValueType().isVector())
12327 return lowerUINT_TO_FP_vec(Op, DAG);
12329 // Since UINT_TO_FP is legal (it's marked custom), dag combiner won't
12330 // optimize it to a SINT_TO_FP when the sign bit is known zero. Perform
12331 // the optimization here.
12332 if (DAG.SignBitIsZero(N0))
12333 return DAG.getNode(ISD::SINT_TO_FP, dl, Op.getValueType(), N0);
12335 MVT SrcVT = N0.getSimpleValueType();
12336 MVT DstVT = Op.getSimpleValueType();
12337 if (SrcVT == MVT::i64 && DstVT == MVT::f64 && X86ScalarSSEf64)
12338 return LowerUINT_TO_FP_i64(Op, DAG);
12339 if (SrcVT == MVT::i32 && X86ScalarSSEf64)
12340 return LowerUINT_TO_FP_i32(Op, DAG);
12341 if (Subtarget->is64Bit() && SrcVT == MVT::i64 && DstVT == MVT::f32)
12344 // Make a 64-bit buffer, and use it to build an FILD.
12345 SDValue StackSlot = DAG.CreateStackTemporary(MVT::i64);
12346 if (SrcVT == MVT::i32) {
12347 SDValue WordOff = DAG.getConstant(4, getPointerTy());
12348 SDValue OffsetSlot = DAG.getNode(ISD::ADD, dl,
12349 getPointerTy(), StackSlot, WordOff);
12350 SDValue Store1 = DAG.getStore(DAG.getEntryNode(), dl, Op.getOperand(0),
12351 StackSlot, MachinePointerInfo(),
12353 SDValue Store2 = DAG.getStore(Store1, dl, DAG.getConstant(0, MVT::i32),
12354 OffsetSlot, MachinePointerInfo(),
12356 SDValue Fild = BuildFILD(Op, MVT::i64, Store2, StackSlot, DAG);
12360 assert(SrcVT == MVT::i64 && "Unexpected type in UINT_TO_FP");
12361 SDValue Store = DAG.getStore(DAG.getEntryNode(), dl, Op.getOperand(0),
12362 StackSlot, MachinePointerInfo(),
12364 // For i64 source, we need to add the appropriate power of 2 if the input
12365 // was negative. This is the same as the optimization in
12366 // DAGTypeLegalizer::ExpandIntOp_UNIT_TO_FP, and for it to be safe here,
12367 // we must be careful to do the computation in x87 extended precision, not
12368 // in SSE. (The generic code can't know it's OK to do this, or how to.)
12369 int SSFI = cast<FrameIndexSDNode>(StackSlot)->getIndex();
12370 MachineMemOperand *MMO =
12371 DAG.getMachineFunction()
12372 .getMachineMemOperand(MachinePointerInfo::getFixedStack(SSFI),
12373 MachineMemOperand::MOLoad, 8, 8);
12375 SDVTList Tys = DAG.getVTList(MVT::f80, MVT::Other);
12376 SDValue Ops[] = { Store, StackSlot, DAG.getValueType(MVT::i64) };
12377 SDValue Fild = DAG.getMemIntrinsicNode(X86ISD::FILD, dl, Tys, Ops,
12380 APInt FF(32, 0x5F800000ULL);
12382 // Check whether the sign bit is set.
12383 SDValue SignSet = DAG.getSetCC(dl,
12384 getSetCCResultType(*DAG.getContext(), MVT::i64),
12385 Op.getOperand(0), DAG.getConstant(0, MVT::i64),
12388 // Build a 64 bit pair (0, FF) in the constant pool, with FF in the lo bits.
12389 SDValue FudgePtr = DAG.getConstantPool(
12390 ConstantInt::get(*DAG.getContext(), FF.zext(64)),
12393 // Get a pointer to FF if the sign bit was set, or to 0 otherwise.
12394 SDValue Zero = DAG.getIntPtrConstant(0);
12395 SDValue Four = DAG.getIntPtrConstant(4);
12396 SDValue Offset = DAG.getNode(ISD::SELECT, dl, Zero.getValueType(), SignSet,
12398 FudgePtr = DAG.getNode(ISD::ADD, dl, getPointerTy(), FudgePtr, Offset);
12400 // Load the value out, extending it from f32 to f80.
12401 // FIXME: Avoid the extend by constructing the right constant pool?
12402 SDValue Fudge = DAG.getExtLoad(ISD::EXTLOAD, dl, MVT::f80, DAG.getEntryNode(),
12403 FudgePtr, MachinePointerInfo::getConstantPool(),
12404 MVT::f32, false, false, false, 4);
12405 // Extend everything to 80 bits to force it to be done on x87.
12406 SDValue Add = DAG.getNode(ISD::FADD, dl, MVT::f80, Fild, Fudge);
12407 return DAG.getNode(ISD::FP_ROUND, dl, DstVT, Add, DAG.getIntPtrConstant(0));
12410 std::pair<SDValue,SDValue>
12411 X86TargetLowering:: FP_TO_INTHelper(SDValue Op, SelectionDAG &DAG,
12412 bool IsSigned, bool IsReplace) const {
12415 EVT DstTy = Op.getValueType();
12417 if (!IsSigned && !isIntegerTypeFTOL(DstTy)) {
12418 assert(DstTy == MVT::i32 && "Unexpected FP_TO_UINT");
12422 assert(DstTy.getSimpleVT() <= MVT::i64 &&
12423 DstTy.getSimpleVT() >= MVT::i16 &&
12424 "Unknown FP_TO_INT to lower!");
12426 // These are really Legal.
12427 if (DstTy == MVT::i32 &&
12428 isScalarFPTypeInSSEReg(Op.getOperand(0).getValueType()))
12429 return std::make_pair(SDValue(), SDValue());
12430 if (Subtarget->is64Bit() &&
12431 DstTy == MVT::i64 &&
12432 isScalarFPTypeInSSEReg(Op.getOperand(0).getValueType()))
12433 return std::make_pair(SDValue(), SDValue());
12435 // We lower FP->int64 either into FISTP64 followed by a load from a temporary
12436 // stack slot, or into the FTOL runtime function.
12437 MachineFunction &MF = DAG.getMachineFunction();
12438 unsigned MemSize = DstTy.getSizeInBits()/8;
12439 int SSFI = MF.getFrameInfo()->CreateStackObject(MemSize, MemSize, false);
12440 SDValue StackSlot = DAG.getFrameIndex(SSFI, getPointerTy());
12443 if (!IsSigned && isIntegerTypeFTOL(DstTy))
12444 Opc = X86ISD::WIN_FTOL;
12446 switch (DstTy.getSimpleVT().SimpleTy) {
12447 default: llvm_unreachable("Invalid FP_TO_SINT to lower!");
12448 case MVT::i16: Opc = X86ISD::FP_TO_INT16_IN_MEM; break;
12449 case MVT::i32: Opc = X86ISD::FP_TO_INT32_IN_MEM; break;
12450 case MVT::i64: Opc = X86ISD::FP_TO_INT64_IN_MEM; break;
12453 SDValue Chain = DAG.getEntryNode();
12454 SDValue Value = Op.getOperand(0);
12455 EVT TheVT = Op.getOperand(0).getValueType();
12456 // FIXME This causes a redundant load/store if the SSE-class value is already
12457 // in memory, such as if it is on the callstack.
12458 if (isScalarFPTypeInSSEReg(TheVT)) {
12459 assert(DstTy == MVT::i64 && "Invalid FP_TO_SINT to lower!");
12460 Chain = DAG.getStore(Chain, DL, Value, StackSlot,
12461 MachinePointerInfo::getFixedStack(SSFI),
12463 SDVTList Tys = DAG.getVTList(Op.getOperand(0).getValueType(), MVT::Other);
12465 Chain, StackSlot, DAG.getValueType(TheVT)
12468 MachineMemOperand *MMO =
12469 MF.getMachineMemOperand(MachinePointerInfo::getFixedStack(SSFI),
12470 MachineMemOperand::MOLoad, MemSize, MemSize);
12471 Value = DAG.getMemIntrinsicNode(X86ISD::FLD, DL, Tys, Ops, DstTy, MMO);
12472 Chain = Value.getValue(1);
12473 SSFI = MF.getFrameInfo()->CreateStackObject(MemSize, MemSize, false);
12474 StackSlot = DAG.getFrameIndex(SSFI, getPointerTy());
12477 MachineMemOperand *MMO =
12478 MF.getMachineMemOperand(MachinePointerInfo::getFixedStack(SSFI),
12479 MachineMemOperand::MOStore, MemSize, MemSize);
12481 if (Opc != X86ISD::WIN_FTOL) {
12482 // Build the FP_TO_INT*_IN_MEM
12483 SDValue Ops[] = { Chain, Value, StackSlot };
12484 SDValue FIST = DAG.getMemIntrinsicNode(Opc, DL, DAG.getVTList(MVT::Other),
12486 return std::make_pair(FIST, StackSlot);
12488 SDValue ftol = DAG.getNode(X86ISD::WIN_FTOL, DL,
12489 DAG.getVTList(MVT::Other, MVT::Glue),
12491 SDValue eax = DAG.getCopyFromReg(ftol, DL, X86::EAX,
12492 MVT::i32, ftol.getValue(1));
12493 SDValue edx = DAG.getCopyFromReg(eax.getValue(1), DL, X86::EDX,
12494 MVT::i32, eax.getValue(2));
12495 SDValue Ops[] = { eax, edx };
12496 SDValue pair = IsReplace
12497 ? DAG.getNode(ISD::BUILD_PAIR, DL, MVT::i64, Ops)
12498 : DAG.getMergeValues(Ops, DL);
12499 return std::make_pair(pair, SDValue());
12503 static SDValue LowerAVXExtend(SDValue Op, SelectionDAG &DAG,
12504 const X86Subtarget *Subtarget) {
12505 MVT VT = Op->getSimpleValueType(0);
12506 SDValue In = Op->getOperand(0);
12507 MVT InVT = In.getSimpleValueType();
12510 // Optimize vectors in AVX mode:
12513 // Use vpunpcklwd for 4 lower elements v8i16 -> v4i32.
12514 // Use vpunpckhwd for 4 upper elements v8i16 -> v4i32.
12515 // Concat upper and lower parts.
12518 // Use vpunpckldq for 4 lower elements v4i32 -> v2i64.
12519 // Use vpunpckhdq for 4 upper elements v4i32 -> v2i64.
12520 // Concat upper and lower parts.
12523 if (((VT != MVT::v16i16) || (InVT != MVT::v16i8)) &&
12524 ((VT != MVT::v8i32) || (InVT != MVT::v8i16)) &&
12525 ((VT != MVT::v4i64) || (InVT != MVT::v4i32)))
12528 if (Subtarget->hasInt256())
12529 return DAG.getNode(X86ISD::VZEXT, dl, VT, In);
12531 SDValue ZeroVec = getZeroVector(InVT, Subtarget, DAG, dl);
12532 SDValue Undef = DAG.getUNDEF(InVT);
12533 bool NeedZero = Op.getOpcode() == ISD::ZERO_EXTEND;
12534 SDValue OpLo = getUnpackl(DAG, dl, InVT, In, NeedZero ? ZeroVec : Undef);
12535 SDValue OpHi = getUnpackh(DAG, dl, InVT, In, NeedZero ? ZeroVec : Undef);
12537 MVT HVT = MVT::getVectorVT(VT.getVectorElementType(),
12538 VT.getVectorNumElements()/2);
12540 OpLo = DAG.getNode(ISD::BITCAST, dl, HVT, OpLo);
12541 OpHi = DAG.getNode(ISD::BITCAST, dl, HVT, OpHi);
12543 return DAG.getNode(ISD::CONCAT_VECTORS, dl, VT, OpLo, OpHi);
12546 static SDValue LowerZERO_EXTEND_AVX512(SDValue Op,
12547 SelectionDAG &DAG) {
12548 MVT VT = Op->getSimpleValueType(0);
12549 SDValue In = Op->getOperand(0);
12550 MVT InVT = In.getSimpleValueType();
12552 unsigned int NumElts = VT.getVectorNumElements();
12553 if (NumElts != 8 && NumElts != 16)
12556 if (VT.is512BitVector() && InVT.getVectorElementType() != MVT::i1)
12557 return DAG.getNode(X86ISD::VZEXT, DL, VT, In);
12559 EVT ExtVT = (NumElts == 8)? MVT::v8i64 : MVT::v16i32;
12560 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
12561 // Now we have only mask extension
12562 assert(InVT.getVectorElementType() == MVT::i1);
12563 SDValue Cst = DAG.getTargetConstant(1, ExtVT.getScalarType());
12564 const Constant *C = (dyn_cast<ConstantSDNode>(Cst))->getConstantIntValue();
12565 SDValue CP = DAG.getConstantPool(C, TLI.getPointerTy());
12566 unsigned Alignment = cast<ConstantPoolSDNode>(CP)->getAlignment();
12567 SDValue Ld = DAG.getLoad(Cst.getValueType(), DL, DAG.getEntryNode(), CP,
12568 MachinePointerInfo::getConstantPool(),
12569 false, false, false, Alignment);
12571 SDValue Brcst = DAG.getNode(X86ISD::VBROADCASTM, DL, ExtVT, In, Ld);
12572 if (VT.is512BitVector())
12574 return DAG.getNode(X86ISD::VTRUNC, DL, VT, Brcst);
12577 static SDValue LowerANY_EXTEND(SDValue Op, const X86Subtarget *Subtarget,
12578 SelectionDAG &DAG) {
12579 if (Subtarget->hasFp256()) {
12580 SDValue Res = LowerAVXExtend(Op, DAG, Subtarget);
12588 static SDValue LowerZERO_EXTEND(SDValue Op, const X86Subtarget *Subtarget,
12589 SelectionDAG &DAG) {
12591 MVT VT = Op.getSimpleValueType();
12592 SDValue In = Op.getOperand(0);
12593 MVT SVT = In.getSimpleValueType();
12595 if (VT.is512BitVector() || SVT.getVectorElementType() == MVT::i1)
12596 return LowerZERO_EXTEND_AVX512(Op, DAG);
12598 if (Subtarget->hasFp256()) {
12599 SDValue Res = LowerAVXExtend(Op, DAG, Subtarget);
12604 assert(!VT.is256BitVector() || !SVT.is128BitVector() ||
12605 VT.getVectorNumElements() != SVT.getVectorNumElements());
12609 SDValue X86TargetLowering::LowerTRUNCATE(SDValue Op, SelectionDAG &DAG) const {
12611 MVT VT = Op.getSimpleValueType();
12612 SDValue In = Op.getOperand(0);
12613 MVT InVT = In.getSimpleValueType();
12615 if (VT == MVT::i1) {
12616 assert((InVT.isInteger() && (InVT.getSizeInBits() <= 64)) &&
12617 "Invalid scalar TRUNCATE operation");
12618 if (InVT.getSizeInBits() >= 32)
12620 In = DAG.getNode(ISD::ANY_EXTEND, DL, MVT::i32, In);
12621 return DAG.getNode(ISD::TRUNCATE, DL, VT, In);
12623 assert(VT.getVectorNumElements() == InVT.getVectorNumElements() &&
12624 "Invalid TRUNCATE operation");
12626 if (InVT.is512BitVector() || VT.getVectorElementType() == MVT::i1) {
12627 if (VT.getVectorElementType().getSizeInBits() >=8)
12628 return DAG.getNode(X86ISD::VTRUNC, DL, VT, In);
12630 assert(VT.getVectorElementType() == MVT::i1 && "Unexpected vector type");
12631 unsigned NumElts = InVT.getVectorNumElements();
12632 assert ((NumElts == 8 || NumElts == 16) && "Unexpected vector type");
12633 if (InVT.getSizeInBits() < 512) {
12634 MVT ExtVT = (NumElts == 16)? MVT::v16i32 : MVT::v8i64;
12635 In = DAG.getNode(ISD::SIGN_EXTEND, DL, ExtVT, In);
12639 SDValue Cst = DAG.getTargetConstant(1, InVT.getVectorElementType());
12640 const Constant *C = (dyn_cast<ConstantSDNode>(Cst))->getConstantIntValue();
12641 SDValue CP = DAG.getConstantPool(C, getPointerTy());
12642 unsigned Alignment = cast<ConstantPoolSDNode>(CP)->getAlignment();
12643 SDValue Ld = DAG.getLoad(Cst.getValueType(), DL, DAG.getEntryNode(), CP,
12644 MachinePointerInfo::getConstantPool(),
12645 false, false, false, Alignment);
12646 SDValue OneV = DAG.getNode(X86ISD::VBROADCAST, DL, InVT, Ld);
12647 SDValue And = DAG.getNode(ISD::AND, DL, InVT, OneV, In);
12648 return DAG.getNode(X86ISD::TESTM, DL, VT, And, And);
12651 if ((VT == MVT::v4i32) && (InVT == MVT::v4i64)) {
12652 // On AVX2, v4i64 -> v4i32 becomes VPERMD.
12653 if (Subtarget->hasInt256()) {
12654 static const int ShufMask[] = {0, 2, 4, 6, -1, -1, -1, -1};
12655 In = DAG.getNode(ISD::BITCAST, DL, MVT::v8i32, In);
12656 In = DAG.getVectorShuffle(MVT::v8i32, DL, In, DAG.getUNDEF(MVT::v8i32),
12658 return DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, VT, In,
12659 DAG.getIntPtrConstant(0));
12662 SDValue OpLo = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, MVT::v2i64, In,
12663 DAG.getIntPtrConstant(0));
12664 SDValue OpHi = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, MVT::v2i64, In,
12665 DAG.getIntPtrConstant(2));
12666 OpLo = DAG.getNode(ISD::BITCAST, DL, MVT::v4i32, OpLo);
12667 OpHi = DAG.getNode(ISD::BITCAST, DL, MVT::v4i32, OpHi);
12668 static const int ShufMask[] = {0, 2, 4, 6};
12669 return DAG.getVectorShuffle(VT, DL, OpLo, OpHi, ShufMask);
12672 if ((VT == MVT::v8i16) && (InVT == MVT::v8i32)) {
12673 // On AVX2, v8i32 -> v8i16 becomed PSHUFB.
12674 if (Subtarget->hasInt256()) {
12675 In = DAG.getNode(ISD::BITCAST, DL, MVT::v32i8, In);
12677 SmallVector<SDValue,32> pshufbMask;
12678 for (unsigned i = 0; i < 2; ++i) {
12679 pshufbMask.push_back(DAG.getConstant(0x0, MVT::i8));
12680 pshufbMask.push_back(DAG.getConstant(0x1, MVT::i8));
12681 pshufbMask.push_back(DAG.getConstant(0x4, MVT::i8));
12682 pshufbMask.push_back(DAG.getConstant(0x5, MVT::i8));
12683 pshufbMask.push_back(DAG.getConstant(0x8, MVT::i8));
12684 pshufbMask.push_back(DAG.getConstant(0x9, MVT::i8));
12685 pshufbMask.push_back(DAG.getConstant(0xc, MVT::i8));
12686 pshufbMask.push_back(DAG.getConstant(0xd, MVT::i8));
12687 for (unsigned j = 0; j < 8; ++j)
12688 pshufbMask.push_back(DAG.getConstant(0x80, MVT::i8));
12690 SDValue BV = DAG.getNode(ISD::BUILD_VECTOR, DL, MVT::v32i8, pshufbMask);
12691 In = DAG.getNode(X86ISD::PSHUFB, DL, MVT::v32i8, In, BV);
12692 In = DAG.getNode(ISD::BITCAST, DL, MVT::v4i64, In);
12694 static const int ShufMask[] = {0, 2, -1, -1};
12695 In = DAG.getVectorShuffle(MVT::v4i64, DL, In, DAG.getUNDEF(MVT::v4i64),
12697 In = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, MVT::v2i64, In,
12698 DAG.getIntPtrConstant(0));
12699 return DAG.getNode(ISD::BITCAST, DL, VT, In);
12702 SDValue OpLo = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, MVT::v4i32, In,
12703 DAG.getIntPtrConstant(0));
12705 SDValue OpHi = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, MVT::v4i32, In,
12706 DAG.getIntPtrConstant(4));
12708 OpLo = DAG.getNode(ISD::BITCAST, DL, MVT::v16i8, OpLo);
12709 OpHi = DAG.getNode(ISD::BITCAST, DL, MVT::v16i8, OpHi);
12711 // The PSHUFB mask:
12712 static const int ShufMask1[] = {0, 1, 4, 5, 8, 9, 12, 13,
12713 -1, -1, -1, -1, -1, -1, -1, -1};
12715 SDValue Undef = DAG.getUNDEF(MVT::v16i8);
12716 OpLo = DAG.getVectorShuffle(MVT::v16i8, DL, OpLo, Undef, ShufMask1);
12717 OpHi = DAG.getVectorShuffle(MVT::v16i8, DL, OpHi, Undef, ShufMask1);
12719 OpLo = DAG.getNode(ISD::BITCAST, DL, MVT::v4i32, OpLo);
12720 OpHi = DAG.getNode(ISD::BITCAST, DL, MVT::v4i32, OpHi);
12722 // The MOVLHPS Mask:
12723 static const int ShufMask2[] = {0, 1, 4, 5};
12724 SDValue res = DAG.getVectorShuffle(MVT::v4i32, DL, OpLo, OpHi, ShufMask2);
12725 return DAG.getNode(ISD::BITCAST, DL, MVT::v8i16, res);
12728 // Handle truncation of V256 to V128 using shuffles.
12729 if (!VT.is128BitVector() || !InVT.is256BitVector())
12732 assert(Subtarget->hasFp256() && "256-bit vector without AVX!");
12734 unsigned NumElems = VT.getVectorNumElements();
12735 MVT NVT = MVT::getVectorVT(VT.getVectorElementType(), NumElems * 2);
12737 SmallVector<int, 16> MaskVec(NumElems * 2, -1);
12738 // Prepare truncation shuffle mask
12739 for (unsigned i = 0; i != NumElems; ++i)
12740 MaskVec[i] = i * 2;
12741 SDValue V = DAG.getVectorShuffle(NVT, DL,
12742 DAG.getNode(ISD::BITCAST, DL, NVT, In),
12743 DAG.getUNDEF(NVT), &MaskVec[0]);
12744 return DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, VT, V,
12745 DAG.getIntPtrConstant(0));
12748 SDValue X86TargetLowering::LowerFP_TO_SINT(SDValue Op,
12749 SelectionDAG &DAG) const {
12750 assert(!Op.getSimpleValueType().isVector());
12752 std::pair<SDValue,SDValue> Vals = FP_TO_INTHelper(Op, DAG,
12753 /*IsSigned=*/ true, /*IsReplace=*/ false);
12754 SDValue FIST = Vals.first, StackSlot = Vals.second;
12755 // If FP_TO_INTHelper failed, the node is actually supposed to be Legal.
12756 if (!FIST.getNode()) return Op;
12758 if (StackSlot.getNode())
12759 // Load the result.
12760 return DAG.getLoad(Op.getValueType(), SDLoc(Op),
12761 FIST, StackSlot, MachinePointerInfo(),
12762 false, false, false, 0);
12764 // The node is the result.
12768 SDValue X86TargetLowering::LowerFP_TO_UINT(SDValue Op,
12769 SelectionDAG &DAG) const {
12770 std::pair<SDValue,SDValue> Vals = FP_TO_INTHelper(Op, DAG,
12771 /*IsSigned=*/ false, /*IsReplace=*/ false);
12772 SDValue FIST = Vals.first, StackSlot = Vals.second;
12773 assert(FIST.getNode() && "Unexpected failure");
12775 if (StackSlot.getNode())
12776 // Load the result.
12777 return DAG.getLoad(Op.getValueType(), SDLoc(Op),
12778 FIST, StackSlot, MachinePointerInfo(),
12779 false, false, false, 0);
12781 // The node is the result.
12785 static SDValue LowerFP_EXTEND(SDValue Op, SelectionDAG &DAG) {
12787 MVT VT = Op.getSimpleValueType();
12788 SDValue In = Op.getOperand(0);
12789 MVT SVT = In.getSimpleValueType();
12791 assert(SVT == MVT::v2f32 && "Only customize MVT::v2f32 type legalization!");
12793 return DAG.getNode(X86ISD::VFPEXT, DL, VT,
12794 DAG.getNode(ISD::CONCAT_VECTORS, DL, MVT::v4f32,
12795 In, DAG.getUNDEF(SVT)));
12798 // The only differences between FABS and FNEG are the mask and the logic op.
12799 static SDValue LowerFABSorFNEG(SDValue Op, SelectionDAG &DAG) {
12800 assert((Op.getOpcode() == ISD::FABS || Op.getOpcode() == ISD::FNEG) &&
12801 "Wrong opcode for lowering FABS or FNEG.");
12803 bool IsFABS = (Op.getOpcode() == ISD::FABS);
12805 MVT VT = Op.getSimpleValueType();
12806 // Assume scalar op for initialization; update for vector if needed.
12807 // Note that there are no scalar bitwise logical SSE/AVX instructions, so we
12808 // generate a 16-byte vector constant and logic op even for the scalar case.
12809 // Using a 16-byte mask allows folding the load of the mask with
12810 // the logic op, so it can save (~4 bytes) on code size.
12812 unsigned NumElts = VT == MVT::f64 ? 2 : 4;
12813 // FIXME: Use function attribute "OptimizeForSize" and/or CodeGenOpt::Level to
12814 // decide if we should generate a 16-byte constant mask when we only need 4 or
12815 // 8 bytes for the scalar case.
12816 if (VT.isVector()) {
12817 EltVT = VT.getVectorElementType();
12818 NumElts = VT.getVectorNumElements();
12821 unsigned EltBits = EltVT.getSizeInBits();
12822 LLVMContext *Context = DAG.getContext();
12823 // For FABS, mask is 0x7f...; for FNEG, mask is 0x80...
12825 IsFABS ? APInt::getSignedMaxValue(EltBits) : APInt::getSignBit(EltBits);
12826 Constant *C = ConstantInt::get(*Context, MaskElt);
12827 C = ConstantVector::getSplat(NumElts, C);
12828 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
12829 SDValue CPIdx = DAG.getConstantPool(C, TLI.getPointerTy());
12830 unsigned Alignment = cast<ConstantPoolSDNode>(CPIdx)->getAlignment();
12831 SDValue Mask = DAG.getLoad(VT, dl, DAG.getEntryNode(), CPIdx,
12832 MachinePointerInfo::getConstantPool(),
12833 false, false, false, Alignment);
12835 if (VT.isVector()) {
12836 // For a vector, cast operands to a vector type, perform the logic op,
12837 // and cast the result back to the original value type.
12838 MVT VecVT = MVT::getVectorVT(MVT::i64, VT.getSizeInBits() / 64);
12839 SDValue Op0Casted = DAG.getNode(ISD::BITCAST, dl, VecVT, Op.getOperand(0));
12840 SDValue MaskCasted = DAG.getNode(ISD::BITCAST, dl, VecVT, Mask);
12841 unsigned LogicOp = IsFABS ? ISD::AND : ISD::XOR;
12842 return DAG.getNode(ISD::BITCAST, dl, VT,
12843 DAG.getNode(LogicOp, dl, VecVT, Op0Casted, MaskCasted));
12845 // If not vector, then scalar.
12846 unsigned LogicOp = IsFABS ? X86ISD::FAND : X86ISD::FXOR;
12847 return DAG.getNode(LogicOp, dl, VT, Op.getOperand(0), Mask);
12850 static SDValue LowerFCOPYSIGN(SDValue Op, SelectionDAG &DAG) {
12851 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
12852 LLVMContext *Context = DAG.getContext();
12853 SDValue Op0 = Op.getOperand(0);
12854 SDValue Op1 = Op.getOperand(1);
12856 MVT VT = Op.getSimpleValueType();
12857 MVT SrcVT = Op1.getSimpleValueType();
12859 // If second operand is smaller, extend it first.
12860 if (SrcVT.bitsLT(VT)) {
12861 Op1 = DAG.getNode(ISD::FP_EXTEND, dl, VT, Op1);
12864 // And if it is bigger, shrink it first.
12865 if (SrcVT.bitsGT(VT)) {
12866 Op1 = DAG.getNode(ISD::FP_ROUND, dl, VT, Op1, DAG.getIntPtrConstant(1));
12870 // At this point the operands and the result should have the same
12871 // type, and that won't be f80 since that is not custom lowered.
12873 // First get the sign bit of second operand.
12874 SmallVector<Constant*,4> CV;
12875 if (SrcVT == MVT::f64) {
12876 const fltSemantics &Sem = APFloat::IEEEdouble;
12877 CV.push_back(ConstantFP::get(*Context, APFloat(Sem, APInt(64, 1ULL << 63))));
12878 CV.push_back(ConstantFP::get(*Context, APFloat(Sem, APInt(64, 0))));
12880 const fltSemantics &Sem = APFloat::IEEEsingle;
12881 CV.push_back(ConstantFP::get(*Context, APFloat(Sem, APInt(32, 1U << 31))));
12882 CV.push_back(ConstantFP::get(*Context, APFloat(Sem, APInt(32, 0))));
12883 CV.push_back(ConstantFP::get(*Context, APFloat(Sem, APInt(32, 0))));
12884 CV.push_back(ConstantFP::get(*Context, APFloat(Sem, APInt(32, 0))));
12886 Constant *C = ConstantVector::get(CV);
12887 SDValue CPIdx = DAG.getConstantPool(C, TLI.getPointerTy(), 16);
12888 SDValue Mask1 = DAG.getLoad(SrcVT, dl, DAG.getEntryNode(), CPIdx,
12889 MachinePointerInfo::getConstantPool(),
12890 false, false, false, 16);
12891 SDValue SignBit = DAG.getNode(X86ISD::FAND, dl, SrcVT, Op1, Mask1);
12893 // Shift sign bit right or left if the two operands have different types.
12894 if (SrcVT.bitsGT(VT)) {
12895 // Op0 is MVT::f32, Op1 is MVT::f64.
12896 SignBit = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, MVT::v2f64, SignBit);
12897 SignBit = DAG.getNode(X86ISD::FSRL, dl, MVT::v2f64, SignBit,
12898 DAG.getConstant(32, MVT::i32));
12899 SignBit = DAG.getNode(ISD::BITCAST, dl, MVT::v4f32, SignBit);
12900 SignBit = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::f32, SignBit,
12901 DAG.getIntPtrConstant(0));
12904 // Clear first operand sign bit.
12906 if (VT == MVT::f64) {
12907 const fltSemantics &Sem = APFloat::IEEEdouble;
12908 CV.push_back(ConstantFP::get(*Context, APFloat(Sem,
12909 APInt(64, ~(1ULL << 63)))));
12910 CV.push_back(ConstantFP::get(*Context, APFloat(Sem, APInt(64, 0))));
12912 const fltSemantics &Sem = APFloat::IEEEsingle;
12913 CV.push_back(ConstantFP::get(*Context, APFloat(Sem,
12914 APInt(32, ~(1U << 31)))));
12915 CV.push_back(ConstantFP::get(*Context, APFloat(Sem, APInt(32, 0))));
12916 CV.push_back(ConstantFP::get(*Context, APFloat(Sem, APInt(32, 0))));
12917 CV.push_back(ConstantFP::get(*Context, APFloat(Sem, APInt(32, 0))));
12919 C = ConstantVector::get(CV);
12920 CPIdx = DAG.getConstantPool(C, TLI.getPointerTy(), 16);
12921 SDValue Mask2 = DAG.getLoad(VT, dl, DAG.getEntryNode(), CPIdx,
12922 MachinePointerInfo::getConstantPool(),
12923 false, false, false, 16);
12924 SDValue Val = DAG.getNode(X86ISD::FAND, dl, VT, Op0, Mask2);
12926 // Or the value with the sign bit.
12927 return DAG.getNode(X86ISD::FOR, dl, VT, Val, SignBit);
12930 static SDValue LowerFGETSIGN(SDValue Op, SelectionDAG &DAG) {
12931 SDValue N0 = Op.getOperand(0);
12933 MVT VT = Op.getSimpleValueType();
12935 // Lower ISD::FGETSIGN to (AND (X86ISD::FGETSIGNx86 ...) 1).
12936 SDValue xFGETSIGN = DAG.getNode(X86ISD::FGETSIGNx86, dl, VT, N0,
12937 DAG.getConstant(1, VT));
12938 return DAG.getNode(ISD::AND, dl, VT, xFGETSIGN, DAG.getConstant(1, VT));
12941 // LowerVectorAllZeroTest - Check whether an OR'd tree is PTEST-able.
12943 static SDValue LowerVectorAllZeroTest(SDValue Op, const X86Subtarget *Subtarget,
12944 SelectionDAG &DAG) {
12945 assert(Op.getOpcode() == ISD::OR && "Only check OR'd tree.");
12947 if (!Subtarget->hasSSE41())
12950 if (!Op->hasOneUse())
12953 SDNode *N = Op.getNode();
12956 SmallVector<SDValue, 8> Opnds;
12957 DenseMap<SDValue, unsigned> VecInMap;
12958 SmallVector<SDValue, 8> VecIns;
12959 EVT VT = MVT::Other;
12961 // Recognize a special case where a vector is casted into wide integer to
12963 Opnds.push_back(N->getOperand(0));
12964 Opnds.push_back(N->getOperand(1));
12966 for (unsigned Slot = 0, e = Opnds.size(); Slot < e; ++Slot) {
12967 SmallVectorImpl<SDValue>::const_iterator I = Opnds.begin() + Slot;
12968 // BFS traverse all OR'd operands.
12969 if (I->getOpcode() == ISD::OR) {
12970 Opnds.push_back(I->getOperand(0));
12971 Opnds.push_back(I->getOperand(1));
12972 // Re-evaluate the number of nodes to be traversed.
12973 e += 2; // 2 more nodes (LHS and RHS) are pushed.
12977 // Quit if a non-EXTRACT_VECTOR_ELT
12978 if (I->getOpcode() != ISD::EXTRACT_VECTOR_ELT)
12981 // Quit if without a constant index.
12982 SDValue Idx = I->getOperand(1);
12983 if (!isa<ConstantSDNode>(Idx))
12986 SDValue ExtractedFromVec = I->getOperand(0);
12987 DenseMap<SDValue, unsigned>::iterator M = VecInMap.find(ExtractedFromVec);
12988 if (M == VecInMap.end()) {
12989 VT = ExtractedFromVec.getValueType();
12990 // Quit if not 128/256-bit vector.
12991 if (!VT.is128BitVector() && !VT.is256BitVector())
12993 // Quit if not the same type.
12994 if (VecInMap.begin() != VecInMap.end() &&
12995 VT != VecInMap.begin()->first.getValueType())
12997 M = VecInMap.insert(std::make_pair(ExtractedFromVec, 0)).first;
12998 VecIns.push_back(ExtractedFromVec);
13000 M->second |= 1U << cast<ConstantSDNode>(Idx)->getZExtValue();
13003 assert((VT.is128BitVector() || VT.is256BitVector()) &&
13004 "Not extracted from 128-/256-bit vector.");
13006 unsigned FullMask = (1U << VT.getVectorNumElements()) - 1U;
13008 for (DenseMap<SDValue, unsigned>::const_iterator
13009 I = VecInMap.begin(), E = VecInMap.end(); I != E; ++I) {
13010 // Quit if not all elements are used.
13011 if (I->second != FullMask)
13015 EVT TestVT = VT.is128BitVector() ? MVT::v2i64 : MVT::v4i64;
13017 // Cast all vectors into TestVT for PTEST.
13018 for (unsigned i = 0, e = VecIns.size(); i < e; ++i)
13019 VecIns[i] = DAG.getNode(ISD::BITCAST, DL, TestVT, VecIns[i]);
13021 // If more than one full vectors are evaluated, OR them first before PTEST.
13022 for (unsigned Slot = 0, e = VecIns.size(); e - Slot > 1; Slot += 2, e += 1) {
13023 // Each iteration will OR 2 nodes and append the result until there is only
13024 // 1 node left, i.e. the final OR'd value of all vectors.
13025 SDValue LHS = VecIns[Slot];
13026 SDValue RHS = VecIns[Slot + 1];
13027 VecIns.push_back(DAG.getNode(ISD::OR, DL, TestVT, LHS, RHS));
13030 return DAG.getNode(X86ISD::PTEST, DL, MVT::i32,
13031 VecIns.back(), VecIns.back());
13034 /// \brief return true if \c Op has a use that doesn't just read flags.
13035 static bool hasNonFlagsUse(SDValue Op) {
13036 for (SDNode::use_iterator UI = Op->use_begin(), UE = Op->use_end(); UI != UE;
13038 SDNode *User = *UI;
13039 unsigned UOpNo = UI.getOperandNo();
13040 if (User->getOpcode() == ISD::TRUNCATE && User->hasOneUse()) {
13041 // Look pass truncate.
13042 UOpNo = User->use_begin().getOperandNo();
13043 User = *User->use_begin();
13046 if (User->getOpcode() != ISD::BRCOND && User->getOpcode() != ISD::SETCC &&
13047 !(User->getOpcode() == ISD::SELECT && UOpNo == 0))
13053 /// Emit nodes that will be selected as "test Op0,Op0", or something
13055 SDValue X86TargetLowering::EmitTest(SDValue Op, unsigned X86CC, SDLoc dl,
13056 SelectionDAG &DAG) const {
13057 if (Op.getValueType() == MVT::i1)
13058 // KORTEST instruction should be selected
13059 return DAG.getNode(X86ISD::CMP, dl, MVT::i32, Op,
13060 DAG.getConstant(0, Op.getValueType()));
13062 // CF and OF aren't always set the way we want. Determine which
13063 // of these we need.
13064 bool NeedCF = false;
13065 bool NeedOF = false;
13068 case X86::COND_A: case X86::COND_AE:
13069 case X86::COND_B: case X86::COND_BE:
13072 case X86::COND_G: case X86::COND_GE:
13073 case X86::COND_L: case X86::COND_LE:
13074 case X86::COND_O: case X86::COND_NO: {
13075 // Check if we really need to set the
13076 // Overflow flag. If NoSignedWrap is present
13077 // that is not actually needed.
13078 switch (Op->getOpcode()) {
13083 const BinaryWithFlagsSDNode *BinNode =
13084 cast<BinaryWithFlagsSDNode>(Op.getNode());
13085 if (BinNode->hasNoSignedWrap())
13095 // See if we can use the EFLAGS value from the operand instead of
13096 // doing a separate TEST. TEST always sets OF and CF to 0, so unless
13097 // we prove that the arithmetic won't overflow, we can't use OF or CF.
13098 if (Op.getResNo() != 0 || NeedOF || NeedCF) {
13099 // Emit a CMP with 0, which is the TEST pattern.
13100 //if (Op.getValueType() == MVT::i1)
13101 // return DAG.getNode(X86ISD::CMP, dl, MVT::i1, Op,
13102 // DAG.getConstant(0, MVT::i1));
13103 return DAG.getNode(X86ISD::CMP, dl, MVT::i32, Op,
13104 DAG.getConstant(0, Op.getValueType()));
13106 unsigned Opcode = 0;
13107 unsigned NumOperands = 0;
13109 // Truncate operations may prevent the merge of the SETCC instruction
13110 // and the arithmetic instruction before it. Attempt to truncate the operands
13111 // of the arithmetic instruction and use a reduced bit-width instruction.
13112 bool NeedTruncation = false;
13113 SDValue ArithOp = Op;
13114 if (Op->getOpcode() == ISD::TRUNCATE && Op->hasOneUse()) {
13115 SDValue Arith = Op->getOperand(0);
13116 // Both the trunc and the arithmetic op need to have one user each.
13117 if (Arith->hasOneUse())
13118 switch (Arith.getOpcode()) {
13125 NeedTruncation = true;
13131 // NOTICE: In the code below we use ArithOp to hold the arithmetic operation
13132 // which may be the result of a CAST. We use the variable 'Op', which is the
13133 // non-casted variable when we check for possible users.
13134 switch (ArithOp.getOpcode()) {
13136 // Due to an isel shortcoming, be conservative if this add is likely to be
13137 // selected as part of a load-modify-store instruction. When the root node
13138 // in a match is a store, isel doesn't know how to remap non-chain non-flag
13139 // uses of other nodes in the match, such as the ADD in this case. This
13140 // leads to the ADD being left around and reselected, with the result being
13141 // two adds in the output. Alas, even if none our users are stores, that
13142 // doesn't prove we're O.K. Ergo, if we have any parents that aren't
13143 // CopyToReg or SETCC, eschew INC/DEC. A better fix seems to require
13144 // climbing the DAG back to the root, and it doesn't seem to be worth the
13146 for (SDNode::use_iterator UI = Op.getNode()->use_begin(),
13147 UE = Op.getNode()->use_end(); UI != UE; ++UI)
13148 if (UI->getOpcode() != ISD::CopyToReg &&
13149 UI->getOpcode() != ISD::SETCC &&
13150 UI->getOpcode() != ISD::STORE)
13153 if (ConstantSDNode *C =
13154 dyn_cast<ConstantSDNode>(ArithOp.getNode()->getOperand(1))) {
13155 // An add of one will be selected as an INC.
13156 if (C->getAPIntValue() == 1 && !Subtarget->slowIncDec()) {
13157 Opcode = X86ISD::INC;
13162 // An add of negative one (subtract of one) will be selected as a DEC.
13163 if (C->getAPIntValue().isAllOnesValue() && !Subtarget->slowIncDec()) {
13164 Opcode = X86ISD::DEC;
13170 // Otherwise use a regular EFLAGS-setting add.
13171 Opcode = X86ISD::ADD;
13176 // If we have a constant logical shift that's only used in a comparison
13177 // against zero turn it into an equivalent AND. This allows turning it into
13178 // a TEST instruction later.
13179 if ((X86CC == X86::COND_E || X86CC == X86::COND_NE) && Op->hasOneUse() &&
13180 isa<ConstantSDNode>(Op->getOperand(1)) && !hasNonFlagsUse(Op)) {
13181 EVT VT = Op.getValueType();
13182 unsigned BitWidth = VT.getSizeInBits();
13183 unsigned ShAmt = Op->getConstantOperandVal(1);
13184 if (ShAmt >= BitWidth) // Avoid undefined shifts.
13186 APInt Mask = ArithOp.getOpcode() == ISD::SRL
13187 ? APInt::getHighBitsSet(BitWidth, BitWidth - ShAmt)
13188 : APInt::getLowBitsSet(BitWidth, BitWidth - ShAmt);
13189 if (!Mask.isSignedIntN(32)) // Avoid large immediates.
13191 SDValue New = DAG.getNode(ISD::AND, dl, VT, Op->getOperand(0),
13192 DAG.getConstant(Mask, VT));
13193 DAG.ReplaceAllUsesWith(Op, New);
13199 // If the primary and result isn't used, don't bother using X86ISD::AND,
13200 // because a TEST instruction will be better.
13201 if (!hasNonFlagsUse(Op))
13207 // Due to the ISEL shortcoming noted above, be conservative if this op is
13208 // likely to be selected as part of a load-modify-store instruction.
13209 for (SDNode::use_iterator UI = Op.getNode()->use_begin(),
13210 UE = Op.getNode()->use_end(); UI != UE; ++UI)
13211 if (UI->getOpcode() == ISD::STORE)
13214 // Otherwise use a regular EFLAGS-setting instruction.
13215 switch (ArithOp.getOpcode()) {
13216 default: llvm_unreachable("unexpected operator!");
13217 case ISD::SUB: Opcode = X86ISD::SUB; break;
13218 case ISD::XOR: Opcode = X86ISD::XOR; break;
13219 case ISD::AND: Opcode = X86ISD::AND; break;
13221 if (!NeedTruncation && (X86CC == X86::COND_E || X86CC == X86::COND_NE)) {
13222 SDValue EFLAGS = LowerVectorAllZeroTest(Op, Subtarget, DAG);
13223 if (EFLAGS.getNode())
13226 Opcode = X86ISD::OR;
13240 return SDValue(Op.getNode(), 1);
13246 // If we found that truncation is beneficial, perform the truncation and
13248 if (NeedTruncation) {
13249 EVT VT = Op.getValueType();
13250 SDValue WideVal = Op->getOperand(0);
13251 EVT WideVT = WideVal.getValueType();
13252 unsigned ConvertedOp = 0;
13253 // Use a target machine opcode to prevent further DAGCombine
13254 // optimizations that may separate the arithmetic operations
13255 // from the setcc node.
13256 switch (WideVal.getOpcode()) {
13258 case ISD::ADD: ConvertedOp = X86ISD::ADD; break;
13259 case ISD::SUB: ConvertedOp = X86ISD::SUB; break;
13260 case ISD::AND: ConvertedOp = X86ISD::AND; break;
13261 case ISD::OR: ConvertedOp = X86ISD::OR; break;
13262 case ISD::XOR: ConvertedOp = X86ISD::XOR; break;
13266 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
13267 if (TLI.isOperationLegal(WideVal.getOpcode(), WideVT)) {
13268 SDValue V0 = DAG.getNode(ISD::TRUNCATE, dl, VT, WideVal.getOperand(0));
13269 SDValue V1 = DAG.getNode(ISD::TRUNCATE, dl, VT, WideVal.getOperand(1));
13270 Op = DAG.getNode(ConvertedOp, dl, VT, V0, V1);
13276 // Emit a CMP with 0, which is the TEST pattern.
13277 return DAG.getNode(X86ISD::CMP, dl, MVT::i32, Op,
13278 DAG.getConstant(0, Op.getValueType()));
13280 SDVTList VTs = DAG.getVTList(Op.getValueType(), MVT::i32);
13281 SmallVector<SDValue, 4> Ops;
13282 for (unsigned i = 0; i != NumOperands; ++i)
13283 Ops.push_back(Op.getOperand(i));
13285 SDValue New = DAG.getNode(Opcode, dl, VTs, Ops);
13286 DAG.ReplaceAllUsesWith(Op, New);
13287 return SDValue(New.getNode(), 1);
13290 /// Emit nodes that will be selected as "cmp Op0,Op1", or something
13292 SDValue X86TargetLowering::EmitCmp(SDValue Op0, SDValue Op1, unsigned X86CC,
13293 SDLoc dl, SelectionDAG &DAG) const {
13294 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op1)) {
13295 if (C->getAPIntValue() == 0)
13296 return EmitTest(Op0, X86CC, dl, DAG);
13298 if (Op0.getValueType() == MVT::i1)
13299 llvm_unreachable("Unexpected comparison operation for MVT::i1 operands");
13302 if ((Op0.getValueType() == MVT::i8 || Op0.getValueType() == MVT::i16 ||
13303 Op0.getValueType() == MVT::i32 || Op0.getValueType() == MVT::i64)) {
13304 // Do the comparison at i32 if it's smaller, besides the Atom case.
13305 // This avoids subregister aliasing issues. Keep the smaller reference
13306 // if we're optimizing for size, however, as that'll allow better folding
13307 // of memory operations.
13308 if (Op0.getValueType() != MVT::i32 && Op0.getValueType() != MVT::i64 &&
13309 !DAG.getMachineFunction().getFunction()->getAttributes().hasAttribute(
13310 AttributeSet::FunctionIndex, Attribute::MinSize) &&
13311 !Subtarget->isAtom()) {
13312 unsigned ExtendOp =
13313 isX86CCUnsigned(X86CC) ? ISD::ZERO_EXTEND : ISD::SIGN_EXTEND;
13314 Op0 = DAG.getNode(ExtendOp, dl, MVT::i32, Op0);
13315 Op1 = DAG.getNode(ExtendOp, dl, MVT::i32, Op1);
13317 // Use SUB instead of CMP to enable CSE between SUB and CMP.
13318 SDVTList VTs = DAG.getVTList(Op0.getValueType(), MVT::i32);
13319 SDValue Sub = DAG.getNode(X86ISD::SUB, dl, VTs,
13321 return SDValue(Sub.getNode(), 1);
13323 return DAG.getNode(X86ISD::CMP, dl, MVT::i32, Op0, Op1);
13326 /// Convert a comparison if required by the subtarget.
13327 SDValue X86TargetLowering::ConvertCmpIfNecessary(SDValue Cmp,
13328 SelectionDAG &DAG) const {
13329 // If the subtarget does not support the FUCOMI instruction, floating-point
13330 // comparisons have to be converted.
13331 if (Subtarget->hasCMov() ||
13332 Cmp.getOpcode() != X86ISD::CMP ||
13333 !Cmp.getOperand(0).getValueType().isFloatingPoint() ||
13334 !Cmp.getOperand(1).getValueType().isFloatingPoint())
13337 // The instruction selector will select an FUCOM instruction instead of
13338 // FUCOMI, which writes the comparison result to FPSW instead of EFLAGS. Hence
13339 // build an SDNode sequence that transfers the result from FPSW into EFLAGS:
13340 // (X86sahf (trunc (srl (X86fp_stsw (trunc (X86cmp ...)), 8))))
13342 SDValue TruncFPSW = DAG.getNode(ISD::TRUNCATE, dl, MVT::i16, Cmp);
13343 SDValue FNStSW = DAG.getNode(X86ISD::FNSTSW16r, dl, MVT::i16, TruncFPSW);
13344 SDValue Srl = DAG.getNode(ISD::SRL, dl, MVT::i16, FNStSW,
13345 DAG.getConstant(8, MVT::i8));
13346 SDValue TruncSrl = DAG.getNode(ISD::TRUNCATE, dl, MVT::i8, Srl);
13347 return DAG.getNode(X86ISD::SAHF, dl, MVT::i32, TruncSrl);
13350 static bool isAllOnes(SDValue V) {
13351 ConstantSDNode *C = dyn_cast<ConstantSDNode>(V);
13352 return C && C->isAllOnesValue();
13355 /// LowerToBT - Result of 'and' is compared against zero. Turn it into a BT node
13356 /// if it's possible.
13357 SDValue X86TargetLowering::LowerToBT(SDValue And, ISD::CondCode CC,
13358 SDLoc dl, SelectionDAG &DAG) const {
13359 SDValue Op0 = And.getOperand(0);
13360 SDValue Op1 = And.getOperand(1);
13361 if (Op0.getOpcode() == ISD::TRUNCATE)
13362 Op0 = Op0.getOperand(0);
13363 if (Op1.getOpcode() == ISD::TRUNCATE)
13364 Op1 = Op1.getOperand(0);
13367 if (Op1.getOpcode() == ISD::SHL)
13368 std::swap(Op0, Op1);
13369 if (Op0.getOpcode() == ISD::SHL) {
13370 if (ConstantSDNode *And00C = dyn_cast<ConstantSDNode>(Op0.getOperand(0)))
13371 if (And00C->getZExtValue() == 1) {
13372 // If we looked past a truncate, check that it's only truncating away
13374 unsigned BitWidth = Op0.getValueSizeInBits();
13375 unsigned AndBitWidth = And.getValueSizeInBits();
13376 if (BitWidth > AndBitWidth) {
13378 DAG.computeKnownBits(Op0, Zeros, Ones);
13379 if (Zeros.countLeadingOnes() < BitWidth - AndBitWidth)
13383 RHS = Op0.getOperand(1);
13385 } else if (Op1.getOpcode() == ISD::Constant) {
13386 ConstantSDNode *AndRHS = cast<ConstantSDNode>(Op1);
13387 uint64_t AndRHSVal = AndRHS->getZExtValue();
13388 SDValue AndLHS = Op0;
13390 if (AndRHSVal == 1 && AndLHS.getOpcode() == ISD::SRL) {
13391 LHS = AndLHS.getOperand(0);
13392 RHS = AndLHS.getOperand(1);
13395 // Use BT if the immediate can't be encoded in a TEST instruction.
13396 if (!isUInt<32>(AndRHSVal) && isPowerOf2_64(AndRHSVal)) {
13398 RHS = DAG.getConstant(Log2_64_Ceil(AndRHSVal), LHS.getValueType());
13402 if (LHS.getNode()) {
13403 // If LHS is i8, promote it to i32 with any_extend. There is no i8 BT
13404 // instruction. Since the shift amount is in-range-or-undefined, we know
13405 // that doing a bittest on the i32 value is ok. We extend to i32 because
13406 // the encoding for the i16 version is larger than the i32 version.
13407 // Also promote i16 to i32 for performance / code size reason.
13408 if (LHS.getValueType() == MVT::i8 ||
13409 LHS.getValueType() == MVT::i16)
13410 LHS = DAG.getNode(ISD::ANY_EXTEND, dl, MVT::i32, LHS);
13412 // If the operand types disagree, extend the shift amount to match. Since
13413 // BT ignores high bits (like shifts) we can use anyextend.
13414 if (LHS.getValueType() != RHS.getValueType())
13415 RHS = DAG.getNode(ISD::ANY_EXTEND, dl, LHS.getValueType(), RHS);
13417 SDValue BT = DAG.getNode(X86ISD::BT, dl, MVT::i32, LHS, RHS);
13418 X86::CondCode Cond = CC == ISD::SETEQ ? X86::COND_AE : X86::COND_B;
13419 return DAG.getNode(X86ISD::SETCC, dl, MVT::i8,
13420 DAG.getConstant(Cond, MVT::i8), BT);
13426 /// \brief - Turns an ISD::CondCode into a value suitable for SSE floating point
13428 static int translateX86FSETCC(ISD::CondCode SetCCOpcode, SDValue &Op0,
13433 // SSE Condition code mapping:
13442 switch (SetCCOpcode) {
13443 default: llvm_unreachable("Unexpected SETCC condition");
13445 case ISD::SETEQ: SSECC = 0; break;
13447 case ISD::SETGT: Swap = true; // Fallthrough
13449 case ISD::SETOLT: SSECC = 1; break;
13451 case ISD::SETGE: Swap = true; // Fallthrough
13453 case ISD::SETOLE: SSECC = 2; break;
13454 case ISD::SETUO: SSECC = 3; break;
13456 case ISD::SETNE: SSECC = 4; break;
13457 case ISD::SETULE: Swap = true; // Fallthrough
13458 case ISD::SETUGE: SSECC = 5; break;
13459 case ISD::SETULT: Swap = true; // Fallthrough
13460 case ISD::SETUGT: SSECC = 6; break;
13461 case ISD::SETO: SSECC = 7; break;
13463 case ISD::SETONE: SSECC = 8; break;
13466 std::swap(Op0, Op1);
13471 // Lower256IntVSETCC - Break a VSETCC 256-bit integer VSETCC into two new 128
13472 // ones, and then concatenate the result back.
13473 static SDValue Lower256IntVSETCC(SDValue Op, SelectionDAG &DAG) {
13474 MVT VT = Op.getSimpleValueType();
13476 assert(VT.is256BitVector() && Op.getOpcode() == ISD::SETCC &&
13477 "Unsupported value type for operation");
13479 unsigned NumElems = VT.getVectorNumElements();
13481 SDValue CC = Op.getOperand(2);
13483 // Extract the LHS vectors
13484 SDValue LHS = Op.getOperand(0);
13485 SDValue LHS1 = Extract128BitVector(LHS, 0, DAG, dl);
13486 SDValue LHS2 = Extract128BitVector(LHS, NumElems/2, DAG, dl);
13488 // Extract the RHS vectors
13489 SDValue RHS = Op.getOperand(1);
13490 SDValue RHS1 = Extract128BitVector(RHS, 0, DAG, dl);
13491 SDValue RHS2 = Extract128BitVector(RHS, NumElems/2, DAG, dl);
13493 // Issue the operation on the smaller types and concatenate the result back
13494 MVT EltVT = VT.getVectorElementType();
13495 MVT NewVT = MVT::getVectorVT(EltVT, NumElems/2);
13496 return DAG.getNode(ISD::CONCAT_VECTORS, dl, VT,
13497 DAG.getNode(Op.getOpcode(), dl, NewVT, LHS1, RHS1, CC),
13498 DAG.getNode(Op.getOpcode(), dl, NewVT, LHS2, RHS2, CC));
13501 static SDValue LowerIntVSETCC_AVX512(SDValue Op, SelectionDAG &DAG,
13502 const X86Subtarget *Subtarget) {
13503 SDValue Op0 = Op.getOperand(0);
13504 SDValue Op1 = Op.getOperand(1);
13505 SDValue CC = Op.getOperand(2);
13506 MVT VT = Op.getSimpleValueType();
13509 assert(Op0.getValueType().getVectorElementType().getSizeInBits() >= 8 &&
13510 Op.getValueType().getScalarType() == MVT::i1 &&
13511 "Cannot set masked compare for this operation");
13513 ISD::CondCode SetCCOpcode = cast<CondCodeSDNode>(CC)->get();
13515 bool Unsigned = false;
13518 switch (SetCCOpcode) {
13519 default: llvm_unreachable("Unexpected SETCC condition");
13520 case ISD::SETNE: SSECC = 4; break;
13521 case ISD::SETEQ: Opc = X86ISD::PCMPEQM; break;
13522 case ISD::SETUGT: SSECC = 6; Unsigned = true; break;
13523 case ISD::SETLT: Swap = true; //fall-through
13524 case ISD::SETGT: Opc = X86ISD::PCMPGTM; break;
13525 case ISD::SETULT: SSECC = 1; Unsigned = true; break;
13526 case ISD::SETUGE: SSECC = 5; Unsigned = true; break; //NLT
13527 case ISD::SETGE: Swap = true; SSECC = 2; break; // LE + swap
13528 case ISD::SETULE: Unsigned = true; //fall-through
13529 case ISD::SETLE: SSECC = 2; break;
13533 std::swap(Op0, Op1);
13535 return DAG.getNode(Opc, dl, VT, Op0, Op1);
13536 Opc = Unsigned ? X86ISD::CMPMU: X86ISD::CMPM;
13537 return DAG.getNode(Opc, dl, VT, Op0, Op1,
13538 DAG.getConstant(SSECC, MVT::i8));
13541 /// \brief Try to turn a VSETULT into a VSETULE by modifying its second
13542 /// operand \p Op1. If non-trivial (for example because it's not constant)
13543 /// return an empty value.
13544 static SDValue ChangeVSETULTtoVSETULE(SDLoc dl, SDValue Op1, SelectionDAG &DAG)
13546 BuildVectorSDNode *BV = dyn_cast<BuildVectorSDNode>(Op1.getNode());
13550 MVT VT = Op1.getSimpleValueType();
13551 MVT EVT = VT.getVectorElementType();
13552 unsigned n = VT.getVectorNumElements();
13553 SmallVector<SDValue, 8> ULTOp1;
13555 for (unsigned i = 0; i < n; ++i) {
13556 ConstantSDNode *Elt = dyn_cast<ConstantSDNode>(BV->getOperand(i));
13557 if (!Elt || Elt->isOpaque() || Elt->getValueType(0) != EVT)
13560 // Avoid underflow.
13561 APInt Val = Elt->getAPIntValue();
13565 ULTOp1.push_back(DAG.getConstant(Val - 1, EVT));
13568 return DAG.getNode(ISD::BUILD_VECTOR, dl, VT, ULTOp1);
13571 static SDValue LowerVSETCC(SDValue Op, const X86Subtarget *Subtarget,
13572 SelectionDAG &DAG) {
13573 SDValue Op0 = Op.getOperand(0);
13574 SDValue Op1 = Op.getOperand(1);
13575 SDValue CC = Op.getOperand(2);
13576 MVT VT = Op.getSimpleValueType();
13577 ISD::CondCode SetCCOpcode = cast<CondCodeSDNode>(CC)->get();
13578 bool isFP = Op.getOperand(1).getSimpleValueType().isFloatingPoint();
13583 MVT EltVT = Op0.getSimpleValueType().getVectorElementType();
13584 assert(EltVT == MVT::f32 || EltVT == MVT::f64);
13587 unsigned SSECC = translateX86FSETCC(SetCCOpcode, Op0, Op1);
13588 unsigned Opc = X86ISD::CMPP;
13589 if (Subtarget->hasAVX512() && VT.getVectorElementType() == MVT::i1) {
13590 assert(VT.getVectorNumElements() <= 16);
13591 Opc = X86ISD::CMPM;
13593 // In the two special cases we can't handle, emit two comparisons.
13596 unsigned CombineOpc;
13597 if (SetCCOpcode == ISD::SETUEQ) {
13598 CC0 = 3; CC1 = 0; CombineOpc = ISD::OR;
13600 assert(SetCCOpcode == ISD::SETONE);
13601 CC0 = 7; CC1 = 4; CombineOpc = ISD::AND;
13604 SDValue Cmp0 = DAG.getNode(Opc, dl, VT, Op0, Op1,
13605 DAG.getConstant(CC0, MVT::i8));
13606 SDValue Cmp1 = DAG.getNode(Opc, dl, VT, Op0, Op1,
13607 DAG.getConstant(CC1, MVT::i8));
13608 return DAG.getNode(CombineOpc, dl, VT, Cmp0, Cmp1);
13610 // Handle all other FP comparisons here.
13611 return DAG.getNode(Opc, dl, VT, Op0, Op1,
13612 DAG.getConstant(SSECC, MVT::i8));
13615 // Break 256-bit integer vector compare into smaller ones.
13616 if (VT.is256BitVector() && !Subtarget->hasInt256())
13617 return Lower256IntVSETCC(Op, DAG);
13619 bool MaskResult = (VT.getVectorElementType() == MVT::i1);
13620 EVT OpVT = Op1.getValueType();
13621 if (Subtarget->hasAVX512()) {
13622 if (Op1.getValueType().is512BitVector() ||
13623 (Subtarget->hasBWI() && Subtarget->hasVLX()) ||
13624 (MaskResult && OpVT.getVectorElementType().getSizeInBits() >= 32))
13625 return LowerIntVSETCC_AVX512(Op, DAG, Subtarget);
13627 // In AVX-512 architecture setcc returns mask with i1 elements,
13628 // But there is no compare instruction for i8 and i16 elements in KNL.
13629 // We are not talking about 512-bit operands in this case, these
13630 // types are illegal.
13632 (OpVT.getVectorElementType().getSizeInBits() < 32 &&
13633 OpVT.getVectorElementType().getSizeInBits() >= 8))
13634 return DAG.getNode(ISD::TRUNCATE, dl, VT,
13635 DAG.getNode(ISD::SETCC, dl, OpVT, Op0, Op1, CC));
13638 // We are handling one of the integer comparisons here. Since SSE only has
13639 // GT and EQ comparisons for integer, swapping operands and multiple
13640 // operations may be required for some comparisons.
13642 bool Swap = false, Invert = false, FlipSigns = false, MinMax = false;
13643 bool Subus = false;
13645 switch (SetCCOpcode) {
13646 default: llvm_unreachable("Unexpected SETCC condition");
13647 case ISD::SETNE: Invert = true;
13648 case ISD::SETEQ: Opc = X86ISD::PCMPEQ; break;
13649 case ISD::SETLT: Swap = true;
13650 case ISD::SETGT: Opc = X86ISD::PCMPGT; break;
13651 case ISD::SETGE: Swap = true;
13652 case ISD::SETLE: Opc = X86ISD::PCMPGT;
13653 Invert = true; break;
13654 case ISD::SETULT: Swap = true;
13655 case ISD::SETUGT: Opc = X86ISD::PCMPGT;
13656 FlipSigns = true; break;
13657 case ISD::SETUGE: Swap = true;
13658 case ISD::SETULE: Opc = X86ISD::PCMPGT;
13659 FlipSigns = true; Invert = true; break;
13662 // Special case: Use min/max operations for SETULE/SETUGE
13663 MVT VET = VT.getVectorElementType();
13665 (Subtarget->hasSSE41() && (VET >= MVT::i8 && VET <= MVT::i32))
13666 || (Subtarget->hasSSE2() && (VET == MVT::i8));
13669 switch (SetCCOpcode) {
13671 case ISD::SETULE: Opc = X86ISD::UMIN; MinMax = true; break;
13672 case ISD::SETUGE: Opc = X86ISD::UMAX; MinMax = true; break;
13675 if (MinMax) { Swap = false; Invert = false; FlipSigns = false; }
13678 bool hasSubus = Subtarget->hasSSE2() && (VET == MVT::i8 || VET == MVT::i16);
13679 if (!MinMax && hasSubus) {
13680 // As another special case, use PSUBUS[BW] when it's profitable. E.g. for
13682 // t = psubus Op0, Op1
13683 // pcmpeq t, <0..0>
13684 switch (SetCCOpcode) {
13686 case ISD::SETULT: {
13687 // If the comparison is against a constant we can turn this into a
13688 // setule. With psubus, setule does not require a swap. This is
13689 // beneficial because the constant in the register is no longer
13690 // destructed as the destination so it can be hoisted out of a loop.
13691 // Only do this pre-AVX since vpcmp* is no longer destructive.
13692 if (Subtarget->hasAVX())
13694 SDValue ULEOp1 = ChangeVSETULTtoVSETULE(dl, Op1, DAG);
13695 if (ULEOp1.getNode()) {
13697 Subus = true; Invert = false; Swap = false;
13701 // Psubus is better than flip-sign because it requires no inversion.
13702 case ISD::SETUGE: Subus = true; Invert = false; Swap = true; break;
13703 case ISD::SETULE: Subus = true; Invert = false; Swap = false; break;
13707 Opc = X86ISD::SUBUS;
13713 std::swap(Op0, Op1);
13715 // Check that the operation in question is available (most are plain SSE2,
13716 // but PCMPGTQ and PCMPEQQ have different requirements).
13717 if (VT == MVT::v2i64) {
13718 if (Opc == X86ISD::PCMPGT && !Subtarget->hasSSE42()) {
13719 assert(Subtarget->hasSSE2() && "Don't know how to lower!");
13721 // First cast everything to the right type.
13722 Op0 = DAG.getNode(ISD::BITCAST, dl, MVT::v4i32, Op0);
13723 Op1 = DAG.getNode(ISD::BITCAST, dl, MVT::v4i32, Op1);
13725 // Since SSE has no unsigned integer comparisons, we need to flip the sign
13726 // bits of the inputs before performing those operations. The lower
13727 // compare is always unsigned.
13730 SB = DAG.getConstant(0x80000000U, MVT::v4i32);
13732 SDValue Sign = DAG.getConstant(0x80000000U, MVT::i32);
13733 SDValue Zero = DAG.getConstant(0x00000000U, MVT::i32);
13734 SB = DAG.getNode(ISD::BUILD_VECTOR, dl, MVT::v4i32,
13735 Sign, Zero, Sign, Zero);
13737 Op0 = DAG.getNode(ISD::XOR, dl, MVT::v4i32, Op0, SB);
13738 Op1 = DAG.getNode(ISD::XOR, dl, MVT::v4i32, Op1, SB);
13740 // Emulate PCMPGTQ with (hi1 > hi2) | ((hi1 == hi2) & (lo1 > lo2))
13741 SDValue GT = DAG.getNode(X86ISD::PCMPGT, dl, MVT::v4i32, Op0, Op1);
13742 SDValue EQ = DAG.getNode(X86ISD::PCMPEQ, dl, MVT::v4i32, Op0, Op1);
13744 // Create masks for only the low parts/high parts of the 64 bit integers.
13745 static const int MaskHi[] = { 1, 1, 3, 3 };
13746 static const int MaskLo[] = { 0, 0, 2, 2 };
13747 SDValue EQHi = DAG.getVectorShuffle(MVT::v4i32, dl, EQ, EQ, MaskHi);
13748 SDValue GTLo = DAG.getVectorShuffle(MVT::v4i32, dl, GT, GT, MaskLo);
13749 SDValue GTHi = DAG.getVectorShuffle(MVT::v4i32, dl, GT, GT, MaskHi);
13751 SDValue Result = DAG.getNode(ISD::AND, dl, MVT::v4i32, EQHi, GTLo);
13752 Result = DAG.getNode(ISD::OR, dl, MVT::v4i32, Result, GTHi);
13755 Result = DAG.getNOT(dl, Result, MVT::v4i32);
13757 return DAG.getNode(ISD::BITCAST, dl, VT, Result);
13760 if (Opc == X86ISD::PCMPEQ && !Subtarget->hasSSE41()) {
13761 // If pcmpeqq is missing but pcmpeqd is available synthesize pcmpeqq with
13762 // pcmpeqd + pshufd + pand.
13763 assert(Subtarget->hasSSE2() && !FlipSigns && "Don't know how to lower!");
13765 // First cast everything to the right type.
13766 Op0 = DAG.getNode(ISD::BITCAST, dl, MVT::v4i32, Op0);
13767 Op1 = DAG.getNode(ISD::BITCAST, dl, MVT::v4i32, Op1);
13770 SDValue Result = DAG.getNode(Opc, dl, MVT::v4i32, Op0, Op1);
13772 // Make sure the lower and upper halves are both all-ones.
13773 static const int Mask[] = { 1, 0, 3, 2 };
13774 SDValue Shuf = DAG.getVectorShuffle(MVT::v4i32, dl, Result, Result, Mask);
13775 Result = DAG.getNode(ISD::AND, dl, MVT::v4i32, Result, Shuf);
13778 Result = DAG.getNOT(dl, Result, MVT::v4i32);
13780 return DAG.getNode(ISD::BITCAST, dl, VT, Result);
13784 // Since SSE has no unsigned integer comparisons, we need to flip the sign
13785 // bits of the inputs before performing those operations.
13787 EVT EltVT = VT.getVectorElementType();
13788 SDValue SB = DAG.getConstant(APInt::getSignBit(EltVT.getSizeInBits()), VT);
13789 Op0 = DAG.getNode(ISD::XOR, dl, VT, Op0, SB);
13790 Op1 = DAG.getNode(ISD::XOR, dl, VT, Op1, SB);
13793 SDValue Result = DAG.getNode(Opc, dl, VT, Op0, Op1);
13795 // If the logical-not of the result is required, perform that now.
13797 Result = DAG.getNOT(dl, Result, VT);
13800 Result = DAG.getNode(X86ISD::PCMPEQ, dl, VT, Op0, Result);
13803 Result = DAG.getNode(X86ISD::PCMPEQ, dl, VT, Result,
13804 getZeroVector(VT, Subtarget, DAG, dl));
13809 SDValue X86TargetLowering::LowerSETCC(SDValue Op, SelectionDAG &DAG) const {
13811 MVT VT = Op.getSimpleValueType();
13813 if (VT.isVector()) return LowerVSETCC(Op, Subtarget, DAG);
13815 assert(((!Subtarget->hasAVX512() && VT == MVT::i8) || (VT == MVT::i1))
13816 && "SetCC type must be 8-bit or 1-bit integer");
13817 SDValue Op0 = Op.getOperand(0);
13818 SDValue Op1 = Op.getOperand(1);
13820 ISD::CondCode CC = cast<CondCodeSDNode>(Op.getOperand(2))->get();
13822 // Optimize to BT if possible.
13823 // Lower (X & (1 << N)) == 0 to BT(X, N).
13824 // Lower ((X >>u N) & 1) != 0 to BT(X, N).
13825 // Lower ((X >>s N) & 1) != 0 to BT(X, N).
13826 if (Op0.getOpcode() == ISD::AND && Op0.hasOneUse() &&
13827 Op1.getOpcode() == ISD::Constant &&
13828 cast<ConstantSDNode>(Op1)->isNullValue() &&
13829 (CC == ISD::SETEQ || CC == ISD::SETNE)) {
13830 SDValue NewSetCC = LowerToBT(Op0, CC, dl, DAG);
13831 if (NewSetCC.getNode())
13835 // Look for X == 0, X == 1, X != 0, or X != 1. We can simplify some forms of
13837 if (Op1.getOpcode() == ISD::Constant &&
13838 (cast<ConstantSDNode>(Op1)->getZExtValue() == 1 ||
13839 cast<ConstantSDNode>(Op1)->isNullValue()) &&
13840 (CC == ISD::SETEQ || CC == ISD::SETNE)) {
13842 // If the input is a setcc, then reuse the input setcc or use a new one with
13843 // the inverted condition.
13844 if (Op0.getOpcode() == X86ISD::SETCC) {
13845 X86::CondCode CCode = (X86::CondCode)Op0.getConstantOperandVal(0);
13846 bool Invert = (CC == ISD::SETNE) ^
13847 cast<ConstantSDNode>(Op1)->isNullValue();
13851 CCode = X86::GetOppositeBranchCondition(CCode);
13852 SDValue SetCC = DAG.getNode(X86ISD::SETCC, dl, MVT::i8,
13853 DAG.getConstant(CCode, MVT::i8),
13854 Op0.getOperand(1));
13856 return DAG.getNode(ISD::TRUNCATE, dl, MVT::i1, SetCC);
13860 if ((Op0.getValueType() == MVT::i1) && (Op1.getOpcode() == ISD::Constant) &&
13861 (cast<ConstantSDNode>(Op1)->getZExtValue() == 1) &&
13862 (CC == ISD::SETEQ || CC == ISD::SETNE)) {
13864 ISD::CondCode NewCC = ISD::getSetCCInverse(CC, true);
13865 return DAG.getSetCC(dl, VT, Op0, DAG.getConstant(0, MVT::i1), NewCC);
13868 bool isFP = Op1.getSimpleValueType().isFloatingPoint();
13869 unsigned X86CC = TranslateX86CC(CC, isFP, Op0, Op1, DAG);
13870 if (X86CC == X86::COND_INVALID)
13873 SDValue EFLAGS = EmitCmp(Op0, Op1, X86CC, dl, DAG);
13874 EFLAGS = ConvertCmpIfNecessary(EFLAGS, DAG);
13875 SDValue SetCC = DAG.getNode(X86ISD::SETCC, dl, MVT::i8,
13876 DAG.getConstant(X86CC, MVT::i8), EFLAGS);
13878 return DAG.getNode(ISD::TRUNCATE, dl, MVT::i1, SetCC);
13882 // isX86LogicalCmp - Return true if opcode is a X86 logical comparison.
13883 static bool isX86LogicalCmp(SDValue Op) {
13884 unsigned Opc = Op.getNode()->getOpcode();
13885 if (Opc == X86ISD::CMP || Opc == X86ISD::COMI || Opc == X86ISD::UCOMI ||
13886 Opc == X86ISD::SAHF)
13888 if (Op.getResNo() == 1 &&
13889 (Opc == X86ISD::ADD ||
13890 Opc == X86ISD::SUB ||
13891 Opc == X86ISD::ADC ||
13892 Opc == X86ISD::SBB ||
13893 Opc == X86ISD::SMUL ||
13894 Opc == X86ISD::UMUL ||
13895 Opc == X86ISD::INC ||
13896 Opc == X86ISD::DEC ||
13897 Opc == X86ISD::OR ||
13898 Opc == X86ISD::XOR ||
13899 Opc == X86ISD::AND))
13902 if (Op.getResNo() == 2 && Opc == X86ISD::UMUL)
13908 static bool isTruncWithZeroHighBitsInput(SDValue V, SelectionDAG &DAG) {
13909 if (V.getOpcode() != ISD::TRUNCATE)
13912 SDValue VOp0 = V.getOperand(0);
13913 unsigned InBits = VOp0.getValueSizeInBits();
13914 unsigned Bits = V.getValueSizeInBits();
13915 return DAG.MaskedValueIsZero(VOp0, APInt::getHighBitsSet(InBits,InBits-Bits));
13918 SDValue X86TargetLowering::LowerSELECT(SDValue Op, SelectionDAG &DAG) const {
13919 bool addTest = true;
13920 SDValue Cond = Op.getOperand(0);
13921 SDValue Op1 = Op.getOperand(1);
13922 SDValue Op2 = Op.getOperand(2);
13924 EVT VT = Op1.getValueType();
13927 // Lower fp selects into a CMP/AND/ANDN/OR sequence when the necessary SSE ops
13928 // are available. Otherwise fp cmovs get lowered into a less efficient branch
13929 // sequence later on.
13930 if (Cond.getOpcode() == ISD::SETCC &&
13931 ((Subtarget->hasSSE2() && (VT == MVT::f32 || VT == MVT::f64)) ||
13932 (Subtarget->hasSSE1() && VT == MVT::f32)) &&
13933 VT == Cond.getOperand(0).getValueType() && Cond->hasOneUse()) {
13934 SDValue CondOp0 = Cond.getOperand(0), CondOp1 = Cond.getOperand(1);
13935 int SSECC = translateX86FSETCC(
13936 cast<CondCodeSDNode>(Cond.getOperand(2))->get(), CondOp0, CondOp1);
13939 if (Subtarget->hasAVX512()) {
13940 SDValue Cmp = DAG.getNode(X86ISD::FSETCC, DL, MVT::i1, CondOp0, CondOp1,
13941 DAG.getConstant(SSECC, MVT::i8));
13942 return DAG.getNode(X86ISD::SELECT, DL, VT, Cmp, Op1, Op2);
13944 SDValue Cmp = DAG.getNode(X86ISD::FSETCC, DL, VT, CondOp0, CondOp1,
13945 DAG.getConstant(SSECC, MVT::i8));
13946 SDValue AndN = DAG.getNode(X86ISD::FANDN, DL, VT, Cmp, Op2);
13947 SDValue And = DAG.getNode(X86ISD::FAND, DL, VT, Cmp, Op1);
13948 return DAG.getNode(X86ISD::FOR, DL, VT, AndN, And);
13952 if (Cond.getOpcode() == ISD::SETCC) {
13953 SDValue NewCond = LowerSETCC(Cond, DAG);
13954 if (NewCond.getNode())
13958 // (select (x == 0), -1, y) -> (sign_bit (x - 1)) | y
13959 // (select (x == 0), y, -1) -> ~(sign_bit (x - 1)) | y
13960 // (select (x != 0), y, -1) -> (sign_bit (x - 1)) | y
13961 // (select (x != 0), -1, y) -> ~(sign_bit (x - 1)) | y
13962 if (Cond.getOpcode() == X86ISD::SETCC &&
13963 Cond.getOperand(1).getOpcode() == X86ISD::CMP &&
13964 isZero(Cond.getOperand(1).getOperand(1))) {
13965 SDValue Cmp = Cond.getOperand(1);
13967 unsigned CondCode =cast<ConstantSDNode>(Cond.getOperand(0))->getZExtValue();
13969 if ((isAllOnes(Op1) || isAllOnes(Op2)) &&
13970 (CondCode == X86::COND_E || CondCode == X86::COND_NE)) {
13971 SDValue Y = isAllOnes(Op2) ? Op1 : Op2;
13973 SDValue CmpOp0 = Cmp.getOperand(0);
13974 // Apply further optimizations for special cases
13975 // (select (x != 0), -1, 0) -> neg & sbb
13976 // (select (x == 0), 0, -1) -> neg & sbb
13977 if (ConstantSDNode *YC = dyn_cast<ConstantSDNode>(Y))
13978 if (YC->isNullValue() &&
13979 (isAllOnes(Op1) == (CondCode == X86::COND_NE))) {
13980 SDVTList VTs = DAG.getVTList(CmpOp0.getValueType(), MVT::i32);
13981 SDValue Neg = DAG.getNode(X86ISD::SUB, DL, VTs,
13982 DAG.getConstant(0, CmpOp0.getValueType()),
13984 SDValue Res = DAG.getNode(X86ISD::SETCC_CARRY, DL, Op.getValueType(),
13985 DAG.getConstant(X86::COND_B, MVT::i8),
13986 SDValue(Neg.getNode(), 1));
13990 Cmp = DAG.getNode(X86ISD::CMP, DL, MVT::i32,
13991 CmpOp0, DAG.getConstant(1, CmpOp0.getValueType()));
13992 Cmp = ConvertCmpIfNecessary(Cmp, DAG);
13994 SDValue Res = // Res = 0 or -1.
13995 DAG.getNode(X86ISD::SETCC_CARRY, DL, Op.getValueType(),
13996 DAG.getConstant(X86::COND_B, MVT::i8), Cmp);
13998 if (isAllOnes(Op1) != (CondCode == X86::COND_E))
13999 Res = DAG.getNOT(DL, Res, Res.getValueType());
14001 ConstantSDNode *N2C = dyn_cast<ConstantSDNode>(Op2);
14002 if (!N2C || !N2C->isNullValue())
14003 Res = DAG.getNode(ISD::OR, DL, Res.getValueType(), Res, Y);
14008 // Look past (and (setcc_carry (cmp ...)), 1).
14009 if (Cond.getOpcode() == ISD::AND &&
14010 Cond.getOperand(0).getOpcode() == X86ISD::SETCC_CARRY) {
14011 ConstantSDNode *C = dyn_cast<ConstantSDNode>(Cond.getOperand(1));
14012 if (C && C->getAPIntValue() == 1)
14013 Cond = Cond.getOperand(0);
14016 // If condition flag is set by a X86ISD::CMP, then use it as the condition
14017 // setting operand in place of the X86ISD::SETCC.
14018 unsigned CondOpcode = Cond.getOpcode();
14019 if (CondOpcode == X86ISD::SETCC ||
14020 CondOpcode == X86ISD::SETCC_CARRY) {
14021 CC = Cond.getOperand(0);
14023 SDValue Cmp = Cond.getOperand(1);
14024 unsigned Opc = Cmp.getOpcode();
14025 MVT VT = Op.getSimpleValueType();
14027 bool IllegalFPCMov = false;
14028 if (VT.isFloatingPoint() && !VT.isVector() &&
14029 !isScalarFPTypeInSSEReg(VT)) // FPStack?
14030 IllegalFPCMov = !hasFPCMov(cast<ConstantSDNode>(CC)->getSExtValue());
14032 if ((isX86LogicalCmp(Cmp) && !IllegalFPCMov) ||
14033 Opc == X86ISD::BT) { // FIXME
14037 } else if (CondOpcode == ISD::USUBO || CondOpcode == ISD::SSUBO ||
14038 CondOpcode == ISD::UADDO || CondOpcode == ISD::SADDO ||
14039 ((CondOpcode == ISD::UMULO || CondOpcode == ISD::SMULO) &&
14040 Cond.getOperand(0).getValueType() != MVT::i8)) {
14041 SDValue LHS = Cond.getOperand(0);
14042 SDValue RHS = Cond.getOperand(1);
14043 unsigned X86Opcode;
14046 switch (CondOpcode) {
14047 case ISD::UADDO: X86Opcode = X86ISD::ADD; X86Cond = X86::COND_B; break;
14048 case ISD::SADDO: X86Opcode = X86ISD::ADD; X86Cond = X86::COND_O; break;
14049 case ISD::USUBO: X86Opcode = X86ISD::SUB; X86Cond = X86::COND_B; break;
14050 case ISD::SSUBO: X86Opcode = X86ISD::SUB; X86Cond = X86::COND_O; break;
14051 case ISD::UMULO: X86Opcode = X86ISD::UMUL; X86Cond = X86::COND_O; break;
14052 case ISD::SMULO: X86Opcode = X86ISD::SMUL; X86Cond = X86::COND_O; break;
14053 default: llvm_unreachable("unexpected overflowing operator");
14055 if (CondOpcode == ISD::UMULO)
14056 VTs = DAG.getVTList(LHS.getValueType(), LHS.getValueType(),
14059 VTs = DAG.getVTList(LHS.getValueType(), MVT::i32);
14061 SDValue X86Op = DAG.getNode(X86Opcode, DL, VTs, LHS, RHS);
14063 if (CondOpcode == ISD::UMULO)
14064 Cond = X86Op.getValue(2);
14066 Cond = X86Op.getValue(1);
14068 CC = DAG.getConstant(X86Cond, MVT::i8);
14073 // Look pass the truncate if the high bits are known zero.
14074 if (isTruncWithZeroHighBitsInput(Cond, DAG))
14075 Cond = Cond.getOperand(0);
14077 // We know the result of AND is compared against zero. Try to match
14079 if (Cond.getOpcode() == ISD::AND && Cond.hasOneUse()) {
14080 SDValue NewSetCC = LowerToBT(Cond, ISD::SETNE, DL, DAG);
14081 if (NewSetCC.getNode()) {
14082 CC = NewSetCC.getOperand(0);
14083 Cond = NewSetCC.getOperand(1);
14090 CC = DAG.getConstant(X86::COND_NE, MVT::i8);
14091 Cond = EmitTest(Cond, X86::COND_NE, DL, DAG);
14094 // a < b ? -1 : 0 -> RES = ~setcc_carry
14095 // a < b ? 0 : -1 -> RES = setcc_carry
14096 // a >= b ? -1 : 0 -> RES = setcc_carry
14097 // a >= b ? 0 : -1 -> RES = ~setcc_carry
14098 if (Cond.getOpcode() == X86ISD::SUB) {
14099 Cond = ConvertCmpIfNecessary(Cond, DAG);
14100 unsigned CondCode = cast<ConstantSDNode>(CC)->getZExtValue();
14102 if ((CondCode == X86::COND_AE || CondCode == X86::COND_B) &&
14103 (isAllOnes(Op1) || isAllOnes(Op2)) && (isZero(Op1) || isZero(Op2))) {
14104 SDValue Res = DAG.getNode(X86ISD::SETCC_CARRY, DL, Op.getValueType(),
14105 DAG.getConstant(X86::COND_B, MVT::i8), Cond);
14106 if (isAllOnes(Op1) != (CondCode == X86::COND_B))
14107 return DAG.getNOT(DL, Res, Res.getValueType());
14112 // X86 doesn't have an i8 cmov. If both operands are the result of a truncate
14113 // widen the cmov and push the truncate through. This avoids introducing a new
14114 // branch during isel and doesn't add any extensions.
14115 if (Op.getValueType() == MVT::i8 &&
14116 Op1.getOpcode() == ISD::TRUNCATE && Op2.getOpcode() == ISD::TRUNCATE) {
14117 SDValue T1 = Op1.getOperand(0), T2 = Op2.getOperand(0);
14118 if (T1.getValueType() == T2.getValueType() &&
14119 // Blacklist CopyFromReg to avoid partial register stalls.
14120 T1.getOpcode() != ISD::CopyFromReg && T2.getOpcode()!=ISD::CopyFromReg){
14121 SDVTList VTs = DAG.getVTList(T1.getValueType(), MVT::Glue);
14122 SDValue Cmov = DAG.getNode(X86ISD::CMOV, DL, VTs, T2, T1, CC, Cond);
14123 return DAG.getNode(ISD::TRUNCATE, DL, Op.getValueType(), Cmov);
14127 // X86ISD::CMOV means set the result (which is operand 1) to the RHS if
14128 // condition is true.
14129 SDVTList VTs = DAG.getVTList(Op.getValueType(), MVT::Glue);
14130 SDValue Ops[] = { Op2, Op1, CC, Cond };
14131 return DAG.getNode(X86ISD::CMOV, DL, VTs, Ops);
14134 static SDValue LowerSIGN_EXTEND_AVX512(SDValue Op, SelectionDAG &DAG) {
14135 MVT VT = Op->getSimpleValueType(0);
14136 SDValue In = Op->getOperand(0);
14137 MVT InVT = In.getSimpleValueType();
14140 unsigned int NumElts = VT.getVectorNumElements();
14141 if (NumElts != 8 && NumElts != 16)
14144 if (VT.is512BitVector() && InVT.getVectorElementType() != MVT::i1)
14145 return DAG.getNode(X86ISD::VSEXT, dl, VT, In);
14147 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
14148 assert (InVT.getVectorElementType() == MVT::i1 && "Unexpected vector type");
14150 MVT ExtVT = (NumElts == 8) ? MVT::v8i64 : MVT::v16i32;
14151 Constant *C = ConstantInt::get(*DAG.getContext(),
14152 APInt::getAllOnesValue(ExtVT.getScalarType().getSizeInBits()));
14154 SDValue CP = DAG.getConstantPool(C, TLI.getPointerTy());
14155 unsigned Alignment = cast<ConstantPoolSDNode>(CP)->getAlignment();
14156 SDValue Ld = DAG.getLoad(ExtVT.getScalarType(), dl, DAG.getEntryNode(), CP,
14157 MachinePointerInfo::getConstantPool(),
14158 false, false, false, Alignment);
14159 SDValue Brcst = DAG.getNode(X86ISD::VBROADCASTM, dl, ExtVT, In, Ld);
14160 if (VT.is512BitVector())
14162 return DAG.getNode(X86ISD::VTRUNC, dl, VT, Brcst);
14165 static SDValue LowerSIGN_EXTEND(SDValue Op, const X86Subtarget *Subtarget,
14166 SelectionDAG &DAG) {
14167 MVT VT = Op->getSimpleValueType(0);
14168 SDValue In = Op->getOperand(0);
14169 MVT InVT = In.getSimpleValueType();
14172 if (VT.is512BitVector() || InVT.getVectorElementType() == MVT::i1)
14173 return LowerSIGN_EXTEND_AVX512(Op, DAG);
14175 if ((VT != MVT::v4i64 || InVT != MVT::v4i32) &&
14176 (VT != MVT::v8i32 || InVT != MVT::v8i16) &&
14177 (VT != MVT::v16i16 || InVT != MVT::v16i8))
14180 if (Subtarget->hasInt256())
14181 return DAG.getNode(X86ISD::VSEXT, dl, VT, In);
14183 // Optimize vectors in AVX mode
14184 // Sign extend v8i16 to v8i32 and
14187 // Divide input vector into two parts
14188 // for v4i32 the shuffle mask will be { 0, 1, -1, -1} {2, 3, -1, -1}
14189 // use vpmovsx instruction to extend v4i32 -> v2i64; v8i16 -> v4i32
14190 // concat the vectors to original VT
14192 unsigned NumElems = InVT.getVectorNumElements();
14193 SDValue Undef = DAG.getUNDEF(InVT);
14195 SmallVector<int,8> ShufMask1(NumElems, -1);
14196 for (unsigned i = 0; i != NumElems/2; ++i)
14199 SDValue OpLo = DAG.getVectorShuffle(InVT, dl, In, Undef, &ShufMask1[0]);
14201 SmallVector<int,8> ShufMask2(NumElems, -1);
14202 for (unsigned i = 0; i != NumElems/2; ++i)
14203 ShufMask2[i] = i + NumElems/2;
14205 SDValue OpHi = DAG.getVectorShuffle(InVT, dl, In, Undef, &ShufMask2[0]);
14207 MVT HalfVT = MVT::getVectorVT(VT.getScalarType(),
14208 VT.getVectorNumElements()/2);
14210 OpLo = DAG.getNode(X86ISD::VSEXT, dl, HalfVT, OpLo);
14211 OpHi = DAG.getNode(X86ISD::VSEXT, dl, HalfVT, OpHi);
14213 return DAG.getNode(ISD::CONCAT_VECTORS, dl, VT, OpLo, OpHi);
14216 // Lower vector extended loads using a shuffle. If SSSE3 is not available we
14217 // may emit an illegal shuffle but the expansion is still better than scalar
14218 // code. We generate X86ISD::VSEXT for SEXTLOADs if it's available, otherwise
14219 // we'll emit a shuffle and a arithmetic shift.
14220 // TODO: It is possible to support ZExt by zeroing the undef values during
14221 // the shuffle phase or after the shuffle.
14222 static SDValue LowerExtendedLoad(SDValue Op, const X86Subtarget *Subtarget,
14223 SelectionDAG &DAG) {
14224 MVT RegVT = Op.getSimpleValueType();
14225 assert(RegVT.isVector() && "We only custom lower vector sext loads.");
14226 assert(RegVT.isInteger() &&
14227 "We only custom lower integer vector sext loads.");
14229 // Nothing useful we can do without SSE2 shuffles.
14230 assert(Subtarget->hasSSE2() && "We only custom lower sext loads with SSE2.");
14232 LoadSDNode *Ld = cast<LoadSDNode>(Op.getNode());
14234 EVT MemVT = Ld->getMemoryVT();
14235 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
14236 unsigned RegSz = RegVT.getSizeInBits();
14238 ISD::LoadExtType Ext = Ld->getExtensionType();
14240 assert((Ext == ISD::EXTLOAD || Ext == ISD::SEXTLOAD)
14241 && "Only anyext and sext are currently implemented.");
14242 assert(MemVT != RegVT && "Cannot extend to the same type");
14243 assert(MemVT.isVector() && "Must load a vector from memory");
14245 unsigned NumElems = RegVT.getVectorNumElements();
14246 unsigned MemSz = MemVT.getSizeInBits();
14247 assert(RegSz > MemSz && "Register size must be greater than the mem size");
14249 if (Ext == ISD::SEXTLOAD && RegSz == 256 && !Subtarget->hasInt256()) {
14250 // The only way in which we have a legal 256-bit vector result but not the
14251 // integer 256-bit operations needed to directly lower a sextload is if we
14252 // have AVX1 but not AVX2. In that case, we can always emit a sextload to
14253 // a 128-bit vector and a normal sign_extend to 256-bits that should get
14254 // correctly legalized. We do this late to allow the canonical form of
14255 // sextload to persist throughout the rest of the DAG combiner -- it wants
14256 // to fold together any extensions it can, and so will fuse a sign_extend
14257 // of an sextload into a sextload targeting a wider value.
14259 if (MemSz == 128) {
14260 // Just switch this to a normal load.
14261 assert(TLI.isTypeLegal(MemVT) && "If the memory type is a 128-bit type, "
14262 "it must be a legal 128-bit vector "
14264 Load = DAG.getLoad(MemVT, dl, Ld->getChain(), Ld->getBasePtr(),
14265 Ld->getPointerInfo(), Ld->isVolatile(), Ld->isNonTemporal(),
14266 Ld->isInvariant(), Ld->getAlignment());
14268 assert(MemSz < 128 &&
14269 "Can't extend a type wider than 128 bits to a 256 bit vector!");
14270 // Do an sext load to a 128-bit vector type. We want to use the same
14271 // number of elements, but elements half as wide. This will end up being
14272 // recursively lowered by this routine, but will succeed as we definitely
14273 // have all the necessary features if we're using AVX1.
14275 EVT::getIntegerVT(*DAG.getContext(), RegVT.getScalarSizeInBits() / 2);
14276 EVT HalfVecVT = EVT::getVectorVT(*DAG.getContext(), HalfEltVT, NumElems);
14278 DAG.getExtLoad(Ext, dl, HalfVecVT, Ld->getChain(), Ld->getBasePtr(),
14279 Ld->getPointerInfo(), MemVT, Ld->isVolatile(),
14280 Ld->isNonTemporal(), Ld->isInvariant(),
14281 Ld->getAlignment());
14284 // Replace chain users with the new chain.
14285 assert(Load->getNumValues() == 2 && "Loads must carry a chain!");
14286 DAG.ReplaceAllUsesOfValueWith(SDValue(Ld, 1), Load.getValue(1));
14288 // Finally, do a normal sign-extend to the desired register.
14289 return DAG.getSExtOrTrunc(Load, dl, RegVT);
14292 // All sizes must be a power of two.
14293 assert(isPowerOf2_32(RegSz * MemSz * NumElems) &&
14294 "Non-power-of-two elements are not custom lowered!");
14296 // Attempt to load the original value using scalar loads.
14297 // Find the largest scalar type that divides the total loaded size.
14298 MVT SclrLoadTy = MVT::i8;
14299 for (unsigned tp = MVT::FIRST_INTEGER_VALUETYPE;
14300 tp < MVT::LAST_INTEGER_VALUETYPE; ++tp) {
14301 MVT Tp = (MVT::SimpleValueType)tp;
14302 if (TLI.isTypeLegal(Tp) && ((MemSz % Tp.getSizeInBits()) == 0)) {
14307 // On 32bit systems, we can't save 64bit integers. Try bitcasting to F64.
14308 if (TLI.isTypeLegal(MVT::f64) && SclrLoadTy.getSizeInBits() < 64 &&
14310 SclrLoadTy = MVT::f64;
14312 // Calculate the number of scalar loads that we need to perform
14313 // in order to load our vector from memory.
14314 unsigned NumLoads = MemSz / SclrLoadTy.getSizeInBits();
14316 assert((Ext != ISD::SEXTLOAD || NumLoads == 1) &&
14317 "Can only lower sext loads with a single scalar load!");
14319 unsigned loadRegZize = RegSz;
14320 if (Ext == ISD::SEXTLOAD && RegSz == 256)
14323 // Represent our vector as a sequence of elements which are the
14324 // largest scalar that we can load.
14325 EVT LoadUnitVecVT = EVT::getVectorVT(
14326 *DAG.getContext(), SclrLoadTy, loadRegZize / SclrLoadTy.getSizeInBits());
14328 // Represent the data using the same element type that is stored in
14329 // memory. In practice, we ''widen'' MemVT.
14331 EVT::getVectorVT(*DAG.getContext(), MemVT.getScalarType(),
14332 loadRegZize / MemVT.getScalarType().getSizeInBits());
14334 assert(WideVecVT.getSizeInBits() == LoadUnitVecVT.getSizeInBits() &&
14335 "Invalid vector type");
14337 // We can't shuffle using an illegal type.
14338 assert(TLI.isTypeLegal(WideVecVT) &&
14339 "We only lower types that form legal widened vector types");
14341 SmallVector<SDValue, 8> Chains;
14342 SDValue Ptr = Ld->getBasePtr();
14343 SDValue Increment =
14344 DAG.getConstant(SclrLoadTy.getSizeInBits() / 8, TLI.getPointerTy());
14345 SDValue Res = DAG.getUNDEF(LoadUnitVecVT);
14347 for (unsigned i = 0; i < NumLoads; ++i) {
14348 // Perform a single load.
14349 SDValue ScalarLoad =
14350 DAG.getLoad(SclrLoadTy, dl, Ld->getChain(), Ptr, Ld->getPointerInfo(),
14351 Ld->isVolatile(), Ld->isNonTemporal(), Ld->isInvariant(),
14352 Ld->getAlignment());
14353 Chains.push_back(ScalarLoad.getValue(1));
14354 // Create the first element type using SCALAR_TO_VECTOR in order to avoid
14355 // another round of DAGCombining.
14357 Res = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, LoadUnitVecVT, ScalarLoad);
14359 Res = DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, LoadUnitVecVT, Res,
14360 ScalarLoad, DAG.getIntPtrConstant(i));
14362 Ptr = DAG.getNode(ISD::ADD, dl, Ptr.getValueType(), Ptr, Increment);
14365 SDValue TF = DAG.getNode(ISD::TokenFactor, dl, MVT::Other, Chains);
14367 // Bitcast the loaded value to a vector of the original element type, in
14368 // the size of the target vector type.
14369 SDValue SlicedVec = DAG.getNode(ISD::BITCAST, dl, WideVecVT, Res);
14370 unsigned SizeRatio = RegSz / MemSz;
14372 if (Ext == ISD::SEXTLOAD) {
14373 // If we have SSE4.1, we can directly emit a VSEXT node.
14374 if (Subtarget->hasSSE41()) {
14375 SDValue Sext = DAG.getNode(X86ISD::VSEXT, dl, RegVT, SlicedVec);
14376 DAG.ReplaceAllUsesOfValueWith(SDValue(Ld, 1), TF);
14380 // Otherwise we'll shuffle the small elements in the high bits of the
14381 // larger type and perform an arithmetic shift. If the shift is not legal
14382 // it's better to scalarize.
14383 assert(TLI.isOperationLegalOrCustom(ISD::SRA, RegVT) &&
14384 "We can't implement a sext load without an arithmetic right shift!");
14386 // Redistribute the loaded elements into the different locations.
14387 SmallVector<int, 16> ShuffleVec(NumElems * SizeRatio, -1);
14388 for (unsigned i = 0; i != NumElems; ++i)
14389 ShuffleVec[i * SizeRatio + SizeRatio - 1] = i;
14391 SDValue Shuff = DAG.getVectorShuffle(
14392 WideVecVT, dl, SlicedVec, DAG.getUNDEF(WideVecVT), &ShuffleVec[0]);
14394 Shuff = DAG.getNode(ISD::BITCAST, dl, RegVT, Shuff);
14396 // Build the arithmetic shift.
14397 unsigned Amt = RegVT.getVectorElementType().getSizeInBits() -
14398 MemVT.getVectorElementType().getSizeInBits();
14400 DAG.getNode(ISD::SRA, dl, RegVT, Shuff, DAG.getConstant(Amt, RegVT));
14402 DAG.ReplaceAllUsesOfValueWith(SDValue(Ld, 1), TF);
14406 // Redistribute the loaded elements into the different locations.
14407 SmallVector<int, 16> ShuffleVec(NumElems * SizeRatio, -1);
14408 for (unsigned i = 0; i != NumElems; ++i)
14409 ShuffleVec[i * SizeRatio] = i;
14411 SDValue Shuff = DAG.getVectorShuffle(WideVecVT, dl, SlicedVec,
14412 DAG.getUNDEF(WideVecVT), &ShuffleVec[0]);
14414 // Bitcast to the requested type.
14415 Shuff = DAG.getNode(ISD::BITCAST, dl, RegVT, Shuff);
14416 DAG.ReplaceAllUsesOfValueWith(SDValue(Ld, 1), TF);
14420 // isAndOrOfSingleUseSetCCs - Return true if node is an ISD::AND or
14421 // ISD::OR of two X86ISD::SETCC nodes each of which has no other use apart
14422 // from the AND / OR.
14423 static bool isAndOrOfSetCCs(SDValue Op, unsigned &Opc) {
14424 Opc = Op.getOpcode();
14425 if (Opc != ISD::OR && Opc != ISD::AND)
14427 return (Op.getOperand(0).getOpcode() == X86ISD::SETCC &&
14428 Op.getOperand(0).hasOneUse() &&
14429 Op.getOperand(1).getOpcode() == X86ISD::SETCC &&
14430 Op.getOperand(1).hasOneUse());
14433 // isXor1OfSetCC - Return true if node is an ISD::XOR of a X86ISD::SETCC and
14434 // 1 and that the SETCC node has a single use.
14435 static bool isXor1OfSetCC(SDValue Op) {
14436 if (Op.getOpcode() != ISD::XOR)
14438 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(Op.getOperand(1));
14439 if (N1C && N1C->getAPIntValue() == 1) {
14440 return Op.getOperand(0).getOpcode() == X86ISD::SETCC &&
14441 Op.getOperand(0).hasOneUse();
14446 SDValue X86TargetLowering::LowerBRCOND(SDValue Op, SelectionDAG &DAG) const {
14447 bool addTest = true;
14448 SDValue Chain = Op.getOperand(0);
14449 SDValue Cond = Op.getOperand(1);
14450 SDValue Dest = Op.getOperand(2);
14453 bool Inverted = false;
14455 if (Cond.getOpcode() == ISD::SETCC) {
14456 // Check for setcc([su]{add,sub,mul}o == 0).
14457 if (cast<CondCodeSDNode>(Cond.getOperand(2))->get() == ISD::SETEQ &&
14458 isa<ConstantSDNode>(Cond.getOperand(1)) &&
14459 cast<ConstantSDNode>(Cond.getOperand(1))->isNullValue() &&
14460 Cond.getOperand(0).getResNo() == 1 &&
14461 (Cond.getOperand(0).getOpcode() == ISD::SADDO ||
14462 Cond.getOperand(0).getOpcode() == ISD::UADDO ||
14463 Cond.getOperand(0).getOpcode() == ISD::SSUBO ||
14464 Cond.getOperand(0).getOpcode() == ISD::USUBO ||
14465 Cond.getOperand(0).getOpcode() == ISD::SMULO ||
14466 Cond.getOperand(0).getOpcode() == ISD::UMULO)) {
14468 Cond = Cond.getOperand(0);
14470 SDValue NewCond = LowerSETCC(Cond, DAG);
14471 if (NewCond.getNode())
14476 // FIXME: LowerXALUO doesn't handle these!!
14477 else if (Cond.getOpcode() == X86ISD::ADD ||
14478 Cond.getOpcode() == X86ISD::SUB ||
14479 Cond.getOpcode() == X86ISD::SMUL ||
14480 Cond.getOpcode() == X86ISD::UMUL)
14481 Cond = LowerXALUO(Cond, DAG);
14484 // Look pass (and (setcc_carry (cmp ...)), 1).
14485 if (Cond.getOpcode() == ISD::AND &&
14486 Cond.getOperand(0).getOpcode() == X86ISD::SETCC_CARRY) {
14487 ConstantSDNode *C = dyn_cast<ConstantSDNode>(Cond.getOperand(1));
14488 if (C && C->getAPIntValue() == 1)
14489 Cond = Cond.getOperand(0);
14492 // If condition flag is set by a X86ISD::CMP, then use it as the condition
14493 // setting operand in place of the X86ISD::SETCC.
14494 unsigned CondOpcode = Cond.getOpcode();
14495 if (CondOpcode == X86ISD::SETCC ||
14496 CondOpcode == X86ISD::SETCC_CARRY) {
14497 CC = Cond.getOperand(0);
14499 SDValue Cmp = Cond.getOperand(1);
14500 unsigned Opc = Cmp.getOpcode();
14501 // FIXME: WHY THE SPECIAL CASING OF LogicalCmp??
14502 if (isX86LogicalCmp(Cmp) || Opc == X86ISD::BT) {
14506 switch (cast<ConstantSDNode>(CC)->getZExtValue()) {
14510 // These can only come from an arithmetic instruction with overflow,
14511 // e.g. SADDO, UADDO.
14512 Cond = Cond.getNode()->getOperand(1);
14518 CondOpcode = Cond.getOpcode();
14519 if (CondOpcode == ISD::UADDO || CondOpcode == ISD::SADDO ||
14520 CondOpcode == ISD::USUBO || CondOpcode == ISD::SSUBO ||
14521 ((CondOpcode == ISD::UMULO || CondOpcode == ISD::SMULO) &&
14522 Cond.getOperand(0).getValueType() != MVT::i8)) {
14523 SDValue LHS = Cond.getOperand(0);
14524 SDValue RHS = Cond.getOperand(1);
14525 unsigned X86Opcode;
14528 // Keep this in sync with LowerXALUO, otherwise we might create redundant
14529 // instructions that can't be removed afterwards (i.e. X86ISD::ADD and
14531 switch (CondOpcode) {
14532 case ISD::UADDO: X86Opcode = X86ISD::ADD; X86Cond = X86::COND_B; break;
14534 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(RHS))
14536 X86Opcode = X86ISD::INC; X86Cond = X86::COND_O;
14539 X86Opcode = X86ISD::ADD; X86Cond = X86::COND_O; break;
14540 case ISD::USUBO: X86Opcode = X86ISD::SUB; X86Cond = X86::COND_B; break;
14542 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(RHS))
14544 X86Opcode = X86ISD::DEC; X86Cond = X86::COND_O;
14547 X86Opcode = X86ISD::SUB; X86Cond = X86::COND_O; break;
14548 case ISD::UMULO: X86Opcode = X86ISD::UMUL; X86Cond = X86::COND_O; break;
14549 case ISD::SMULO: X86Opcode = X86ISD::SMUL; X86Cond = X86::COND_O; break;
14550 default: llvm_unreachable("unexpected overflowing operator");
14553 X86Cond = X86::GetOppositeBranchCondition((X86::CondCode)X86Cond);
14554 if (CondOpcode == ISD::UMULO)
14555 VTs = DAG.getVTList(LHS.getValueType(), LHS.getValueType(),
14558 VTs = DAG.getVTList(LHS.getValueType(), MVT::i32);
14560 SDValue X86Op = DAG.getNode(X86Opcode, dl, VTs, LHS, RHS);
14562 if (CondOpcode == ISD::UMULO)
14563 Cond = X86Op.getValue(2);
14565 Cond = X86Op.getValue(1);
14567 CC = DAG.getConstant(X86Cond, MVT::i8);
14571 if (Cond.hasOneUse() && isAndOrOfSetCCs(Cond, CondOpc)) {
14572 SDValue Cmp = Cond.getOperand(0).getOperand(1);
14573 if (CondOpc == ISD::OR) {
14574 // Also, recognize the pattern generated by an FCMP_UNE. We can emit
14575 // two branches instead of an explicit OR instruction with a
14577 if (Cmp == Cond.getOperand(1).getOperand(1) &&
14578 isX86LogicalCmp(Cmp)) {
14579 CC = Cond.getOperand(0).getOperand(0);
14580 Chain = DAG.getNode(X86ISD::BRCOND, dl, Op.getValueType(),
14581 Chain, Dest, CC, Cmp);
14582 CC = Cond.getOperand(1).getOperand(0);
14586 } else { // ISD::AND
14587 // Also, recognize the pattern generated by an FCMP_OEQ. We can emit
14588 // two branches instead of an explicit AND instruction with a
14589 // separate test. However, we only do this if this block doesn't
14590 // have a fall-through edge, because this requires an explicit
14591 // jmp when the condition is false.
14592 if (Cmp == Cond.getOperand(1).getOperand(1) &&
14593 isX86LogicalCmp(Cmp) &&
14594 Op.getNode()->hasOneUse()) {
14595 X86::CondCode CCode =
14596 (X86::CondCode)Cond.getOperand(0).getConstantOperandVal(0);
14597 CCode = X86::GetOppositeBranchCondition(CCode);
14598 CC = DAG.getConstant(CCode, MVT::i8);
14599 SDNode *User = *Op.getNode()->use_begin();
14600 // Look for an unconditional branch following this conditional branch.
14601 // We need this because we need to reverse the successors in order
14602 // to implement FCMP_OEQ.
14603 if (User->getOpcode() == ISD::BR) {
14604 SDValue FalseBB = User->getOperand(1);
14606 DAG.UpdateNodeOperands(User, User->getOperand(0), Dest);
14607 assert(NewBR == User);
14611 Chain = DAG.getNode(X86ISD::BRCOND, dl, Op.getValueType(),
14612 Chain, Dest, CC, Cmp);
14613 X86::CondCode CCode =
14614 (X86::CondCode)Cond.getOperand(1).getConstantOperandVal(0);
14615 CCode = X86::GetOppositeBranchCondition(CCode);
14616 CC = DAG.getConstant(CCode, MVT::i8);
14622 } else if (Cond.hasOneUse() && isXor1OfSetCC(Cond)) {
14623 // Recognize for xorb (setcc), 1 patterns. The xor inverts the condition.
14624 // It should be transformed during dag combiner except when the condition
14625 // is set by a arithmetics with overflow node.
14626 X86::CondCode CCode =
14627 (X86::CondCode)Cond.getOperand(0).getConstantOperandVal(0);
14628 CCode = X86::GetOppositeBranchCondition(CCode);
14629 CC = DAG.getConstant(CCode, MVT::i8);
14630 Cond = Cond.getOperand(0).getOperand(1);
14632 } else if (Cond.getOpcode() == ISD::SETCC &&
14633 cast<CondCodeSDNode>(Cond.getOperand(2))->get() == ISD::SETOEQ) {
14634 // For FCMP_OEQ, we can emit
14635 // two branches instead of an explicit AND instruction with a
14636 // separate test. However, we only do this if this block doesn't
14637 // have a fall-through edge, because this requires an explicit
14638 // jmp when the condition is false.
14639 if (Op.getNode()->hasOneUse()) {
14640 SDNode *User = *Op.getNode()->use_begin();
14641 // Look for an unconditional branch following this conditional branch.
14642 // We need this because we need to reverse the successors in order
14643 // to implement FCMP_OEQ.
14644 if (User->getOpcode() == ISD::BR) {
14645 SDValue FalseBB = User->getOperand(1);
14647 DAG.UpdateNodeOperands(User, User->getOperand(0), Dest);
14648 assert(NewBR == User);
14652 SDValue Cmp = DAG.getNode(X86ISD::CMP, dl, MVT::i32,
14653 Cond.getOperand(0), Cond.getOperand(1));
14654 Cmp = ConvertCmpIfNecessary(Cmp, DAG);
14655 CC = DAG.getConstant(X86::COND_NE, MVT::i8);
14656 Chain = DAG.getNode(X86ISD::BRCOND, dl, Op.getValueType(),
14657 Chain, Dest, CC, Cmp);
14658 CC = DAG.getConstant(X86::COND_P, MVT::i8);
14663 } else if (Cond.getOpcode() == ISD::SETCC &&
14664 cast<CondCodeSDNode>(Cond.getOperand(2))->get() == ISD::SETUNE) {
14665 // For FCMP_UNE, we can emit
14666 // two branches instead of an explicit AND instruction with a
14667 // separate test. However, we only do this if this block doesn't
14668 // have a fall-through edge, because this requires an explicit
14669 // jmp when the condition is false.
14670 if (Op.getNode()->hasOneUse()) {
14671 SDNode *User = *Op.getNode()->use_begin();
14672 // Look for an unconditional branch following this conditional branch.
14673 // We need this because we need to reverse the successors in order
14674 // to implement FCMP_UNE.
14675 if (User->getOpcode() == ISD::BR) {
14676 SDValue FalseBB = User->getOperand(1);
14678 DAG.UpdateNodeOperands(User, User->getOperand(0), Dest);
14679 assert(NewBR == User);
14682 SDValue Cmp = DAG.getNode(X86ISD::CMP, dl, MVT::i32,
14683 Cond.getOperand(0), Cond.getOperand(1));
14684 Cmp = ConvertCmpIfNecessary(Cmp, DAG);
14685 CC = DAG.getConstant(X86::COND_NE, MVT::i8);
14686 Chain = DAG.getNode(X86ISD::BRCOND, dl, Op.getValueType(),
14687 Chain, Dest, CC, Cmp);
14688 CC = DAG.getConstant(X86::COND_NP, MVT::i8);
14698 // Look pass the truncate if the high bits are known zero.
14699 if (isTruncWithZeroHighBitsInput(Cond, DAG))
14700 Cond = Cond.getOperand(0);
14702 // We know the result of AND is compared against zero. Try to match
14704 if (Cond.getOpcode() == ISD::AND && Cond.hasOneUse()) {
14705 SDValue NewSetCC = LowerToBT(Cond, ISD::SETNE, dl, DAG);
14706 if (NewSetCC.getNode()) {
14707 CC = NewSetCC.getOperand(0);
14708 Cond = NewSetCC.getOperand(1);
14715 X86::CondCode X86Cond = Inverted ? X86::COND_E : X86::COND_NE;
14716 CC = DAG.getConstant(X86Cond, MVT::i8);
14717 Cond = EmitTest(Cond, X86Cond, dl, DAG);
14719 Cond = ConvertCmpIfNecessary(Cond, DAG);
14720 return DAG.getNode(X86ISD::BRCOND, dl, Op.getValueType(),
14721 Chain, Dest, CC, Cond);
14724 // Lower dynamic stack allocation to _alloca call for Cygwin/Mingw targets.
14725 // Calls to _alloca are needed to probe the stack when allocating more than 4k
14726 // bytes in one go. Touching the stack at 4K increments is necessary to ensure
14727 // that the guard pages used by the OS virtual memory manager are allocated in
14728 // correct sequence.
14730 X86TargetLowering::LowerDYNAMIC_STACKALLOC(SDValue Op,
14731 SelectionDAG &DAG) const {
14732 MachineFunction &MF = DAG.getMachineFunction();
14733 bool SplitStack = MF.shouldSplitStack();
14734 bool Lower = (Subtarget->isOSWindows() && !Subtarget->isTargetMacho()) ||
14739 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
14740 SDNode* Node = Op.getNode();
14742 unsigned SPReg = TLI.getStackPointerRegisterToSaveRestore();
14743 assert(SPReg && "Target cannot require DYNAMIC_STACKALLOC expansion and"
14744 " not tell us which reg is the stack pointer!");
14745 EVT VT = Node->getValueType(0);
14746 SDValue Tmp1 = SDValue(Node, 0);
14747 SDValue Tmp2 = SDValue(Node, 1);
14748 SDValue Tmp3 = Node->getOperand(2);
14749 SDValue Chain = Tmp1.getOperand(0);
14751 // Chain the dynamic stack allocation so that it doesn't modify the stack
14752 // pointer when other instructions are using the stack.
14753 Chain = DAG.getCALLSEQ_START(Chain, DAG.getIntPtrConstant(0, true),
14756 SDValue Size = Tmp2.getOperand(1);
14757 SDValue SP = DAG.getCopyFromReg(Chain, dl, SPReg, VT);
14758 Chain = SP.getValue(1);
14759 unsigned Align = cast<ConstantSDNode>(Tmp3)->getZExtValue();
14760 const TargetFrameLowering &TFI = *DAG.getSubtarget().getFrameLowering();
14761 unsigned StackAlign = TFI.getStackAlignment();
14762 Tmp1 = DAG.getNode(ISD::SUB, dl, VT, SP, Size); // Value
14763 if (Align > StackAlign)
14764 Tmp1 = DAG.getNode(ISD::AND, dl, VT, Tmp1,
14765 DAG.getConstant(-(uint64_t)Align, VT));
14766 Chain = DAG.getCopyToReg(Chain, dl, SPReg, Tmp1); // Output chain
14768 Tmp2 = DAG.getCALLSEQ_END(Chain, DAG.getIntPtrConstant(0, true),
14769 DAG.getIntPtrConstant(0, true), SDValue(),
14772 SDValue Ops[2] = { Tmp1, Tmp2 };
14773 return DAG.getMergeValues(Ops, dl);
14777 SDValue Chain = Op.getOperand(0);
14778 SDValue Size = Op.getOperand(1);
14779 unsigned Align = cast<ConstantSDNode>(Op.getOperand(2))->getZExtValue();
14780 EVT VT = Op.getNode()->getValueType(0);
14782 bool Is64Bit = Subtarget->is64Bit();
14783 EVT SPTy = Is64Bit ? MVT::i64 : MVT::i32;
14786 MachineRegisterInfo &MRI = MF.getRegInfo();
14789 // The 64 bit implementation of segmented stacks needs to clobber both r10
14790 // r11. This makes it impossible to use it along with nested parameters.
14791 const Function *F = MF.getFunction();
14793 for (Function::const_arg_iterator I = F->arg_begin(), E = F->arg_end();
14795 if (I->hasNestAttr())
14796 report_fatal_error("Cannot use segmented stacks with functions that "
14797 "have nested arguments.");
14800 const TargetRegisterClass *AddrRegClass =
14801 getRegClassFor(Subtarget->is64Bit() ? MVT::i64:MVT::i32);
14802 unsigned Vreg = MRI.createVirtualRegister(AddrRegClass);
14803 Chain = DAG.getCopyToReg(Chain, dl, Vreg, Size);
14804 SDValue Value = DAG.getNode(X86ISD::SEG_ALLOCA, dl, SPTy, Chain,
14805 DAG.getRegister(Vreg, SPTy));
14806 SDValue Ops1[2] = { Value, Chain };
14807 return DAG.getMergeValues(Ops1, dl);
14810 unsigned Reg = (Subtarget->is64Bit() ? X86::RAX : X86::EAX);
14812 Chain = DAG.getCopyToReg(Chain, dl, Reg, Size, Flag);
14813 Flag = Chain.getValue(1);
14814 SDVTList NodeTys = DAG.getVTList(MVT::Other, MVT::Glue);
14816 Chain = DAG.getNode(X86ISD::WIN_ALLOCA, dl, NodeTys, Chain, Flag);
14818 const X86RegisterInfo *RegInfo = static_cast<const X86RegisterInfo *>(
14819 DAG.getSubtarget().getRegisterInfo());
14820 unsigned SPReg = RegInfo->getStackRegister();
14821 SDValue SP = DAG.getCopyFromReg(Chain, dl, SPReg, SPTy);
14822 Chain = SP.getValue(1);
14825 SP = DAG.getNode(ISD::AND, dl, VT, SP.getValue(0),
14826 DAG.getConstant(-(uint64_t)Align, VT));
14827 Chain = DAG.getCopyToReg(Chain, dl, SPReg, SP);
14830 SDValue Ops1[2] = { SP, Chain };
14831 return DAG.getMergeValues(Ops1, dl);
14835 SDValue X86TargetLowering::LowerVASTART(SDValue Op, SelectionDAG &DAG) const {
14836 MachineFunction &MF = DAG.getMachineFunction();
14837 X86MachineFunctionInfo *FuncInfo = MF.getInfo<X86MachineFunctionInfo>();
14839 const Value *SV = cast<SrcValueSDNode>(Op.getOperand(2))->getValue();
14842 if (!Subtarget->is64Bit() || Subtarget->isTargetWin64()) {
14843 // vastart just stores the address of the VarArgsFrameIndex slot into the
14844 // memory location argument.
14845 SDValue FR = DAG.getFrameIndex(FuncInfo->getVarArgsFrameIndex(),
14847 return DAG.getStore(Op.getOperand(0), DL, FR, Op.getOperand(1),
14848 MachinePointerInfo(SV), false, false, 0);
14852 // gp_offset (0 - 6 * 8)
14853 // fp_offset (48 - 48 + 8 * 16)
14854 // overflow_arg_area (point to parameters coming in memory).
14856 SmallVector<SDValue, 8> MemOps;
14857 SDValue FIN = Op.getOperand(1);
14859 SDValue Store = DAG.getStore(Op.getOperand(0), DL,
14860 DAG.getConstant(FuncInfo->getVarArgsGPOffset(),
14862 FIN, MachinePointerInfo(SV), false, false, 0);
14863 MemOps.push_back(Store);
14866 FIN = DAG.getNode(ISD::ADD, DL, getPointerTy(),
14867 FIN, DAG.getIntPtrConstant(4));
14868 Store = DAG.getStore(Op.getOperand(0), DL,
14869 DAG.getConstant(FuncInfo->getVarArgsFPOffset(),
14871 FIN, MachinePointerInfo(SV, 4), false, false, 0);
14872 MemOps.push_back(Store);
14874 // Store ptr to overflow_arg_area
14875 FIN = DAG.getNode(ISD::ADD, DL, getPointerTy(),
14876 FIN, DAG.getIntPtrConstant(4));
14877 SDValue OVFIN = DAG.getFrameIndex(FuncInfo->getVarArgsFrameIndex(),
14879 Store = DAG.getStore(Op.getOperand(0), DL, OVFIN, FIN,
14880 MachinePointerInfo(SV, 8),
14882 MemOps.push_back(Store);
14884 // Store ptr to reg_save_area.
14885 FIN = DAG.getNode(ISD::ADD, DL, getPointerTy(),
14886 FIN, DAG.getIntPtrConstant(8));
14887 SDValue RSFIN = DAG.getFrameIndex(FuncInfo->getRegSaveFrameIndex(),
14889 Store = DAG.getStore(Op.getOperand(0), DL, RSFIN, FIN,
14890 MachinePointerInfo(SV, 16), false, false, 0);
14891 MemOps.push_back(Store);
14892 return DAG.getNode(ISD::TokenFactor, DL, MVT::Other, MemOps);
14895 SDValue X86TargetLowering::LowerVAARG(SDValue Op, SelectionDAG &DAG) const {
14896 assert(Subtarget->is64Bit() &&
14897 "LowerVAARG only handles 64-bit va_arg!");
14898 assert((Subtarget->isTargetLinux() ||
14899 Subtarget->isTargetDarwin()) &&
14900 "Unhandled target in LowerVAARG");
14901 assert(Op.getNode()->getNumOperands() == 4);
14902 SDValue Chain = Op.getOperand(0);
14903 SDValue SrcPtr = Op.getOperand(1);
14904 const Value *SV = cast<SrcValueSDNode>(Op.getOperand(2))->getValue();
14905 unsigned Align = Op.getConstantOperandVal(3);
14908 EVT ArgVT = Op.getNode()->getValueType(0);
14909 Type *ArgTy = ArgVT.getTypeForEVT(*DAG.getContext());
14910 uint32_t ArgSize = getDataLayout()->getTypeAllocSize(ArgTy);
14913 // Decide which area this value should be read from.
14914 // TODO: Implement the AMD64 ABI in its entirety. This simple
14915 // selection mechanism works only for the basic types.
14916 if (ArgVT == MVT::f80) {
14917 llvm_unreachable("va_arg for f80 not yet implemented");
14918 } else if (ArgVT.isFloatingPoint() && ArgSize <= 16 /*bytes*/) {
14919 ArgMode = 2; // Argument passed in XMM register. Use fp_offset.
14920 } else if (ArgVT.isInteger() && ArgSize <= 32 /*bytes*/) {
14921 ArgMode = 1; // Argument passed in GPR64 register(s). Use gp_offset.
14923 llvm_unreachable("Unhandled argument type in LowerVAARG");
14926 if (ArgMode == 2) {
14927 // Sanity Check: Make sure using fp_offset makes sense.
14928 assert(!DAG.getTarget().Options.UseSoftFloat &&
14929 !(DAG.getMachineFunction()
14930 .getFunction()->getAttributes()
14931 .hasAttribute(AttributeSet::FunctionIndex,
14932 Attribute::NoImplicitFloat)) &&
14933 Subtarget->hasSSE1());
14936 // Insert VAARG_64 node into the DAG
14937 // VAARG_64 returns two values: Variable Argument Address, Chain
14938 SmallVector<SDValue, 11> InstOps;
14939 InstOps.push_back(Chain);
14940 InstOps.push_back(SrcPtr);
14941 InstOps.push_back(DAG.getConstant(ArgSize, MVT::i32));
14942 InstOps.push_back(DAG.getConstant(ArgMode, MVT::i8));
14943 InstOps.push_back(DAG.getConstant(Align, MVT::i32));
14944 SDVTList VTs = DAG.getVTList(getPointerTy(), MVT::Other);
14945 SDValue VAARG = DAG.getMemIntrinsicNode(X86ISD::VAARG_64, dl,
14946 VTs, InstOps, MVT::i64,
14947 MachinePointerInfo(SV),
14949 /*Volatile=*/false,
14951 /*WriteMem=*/true);
14952 Chain = VAARG.getValue(1);
14954 // Load the next argument and return it
14955 return DAG.getLoad(ArgVT, dl,
14958 MachinePointerInfo(),
14959 false, false, false, 0);
14962 static SDValue LowerVACOPY(SDValue Op, const X86Subtarget *Subtarget,
14963 SelectionDAG &DAG) {
14964 // X86-64 va_list is a struct { i32, i32, i8*, i8* }.
14965 assert(Subtarget->is64Bit() && "This code only handles 64-bit va_copy!");
14966 SDValue Chain = Op.getOperand(0);
14967 SDValue DstPtr = Op.getOperand(1);
14968 SDValue SrcPtr = Op.getOperand(2);
14969 const Value *DstSV = cast<SrcValueSDNode>(Op.getOperand(3))->getValue();
14970 const Value *SrcSV = cast<SrcValueSDNode>(Op.getOperand(4))->getValue();
14973 return DAG.getMemcpy(Chain, DL, DstPtr, SrcPtr,
14974 DAG.getIntPtrConstant(24), 8, /*isVolatile*/false,
14976 MachinePointerInfo(DstSV), MachinePointerInfo(SrcSV));
14979 // getTargetVShiftByConstNode - Handle vector element shifts where the shift
14980 // amount is a constant. Takes immediate version of shift as input.
14981 static SDValue getTargetVShiftByConstNode(unsigned Opc, SDLoc dl, MVT VT,
14982 SDValue SrcOp, uint64_t ShiftAmt,
14983 SelectionDAG &DAG) {
14984 MVT ElementType = VT.getVectorElementType();
14986 // Fold this packed shift into its first operand if ShiftAmt is 0.
14990 // Check for ShiftAmt >= element width
14991 if (ShiftAmt >= ElementType.getSizeInBits()) {
14992 if (Opc == X86ISD::VSRAI)
14993 ShiftAmt = ElementType.getSizeInBits() - 1;
14995 return DAG.getConstant(0, VT);
14998 assert((Opc == X86ISD::VSHLI || Opc == X86ISD::VSRLI || Opc == X86ISD::VSRAI)
14999 && "Unknown target vector shift-by-constant node");
15001 // Fold this packed vector shift into a build vector if SrcOp is a
15002 // vector of Constants or UNDEFs, and SrcOp valuetype is the same as VT.
15003 if (VT == SrcOp.getSimpleValueType() &&
15004 ISD::isBuildVectorOfConstantSDNodes(SrcOp.getNode())) {
15005 SmallVector<SDValue, 8> Elts;
15006 unsigned NumElts = SrcOp->getNumOperands();
15007 ConstantSDNode *ND;
15010 default: llvm_unreachable(nullptr);
15011 case X86ISD::VSHLI:
15012 for (unsigned i=0; i!=NumElts; ++i) {
15013 SDValue CurrentOp = SrcOp->getOperand(i);
15014 if (CurrentOp->getOpcode() == ISD::UNDEF) {
15015 Elts.push_back(CurrentOp);
15018 ND = cast<ConstantSDNode>(CurrentOp);
15019 const APInt &C = ND->getAPIntValue();
15020 Elts.push_back(DAG.getConstant(C.shl(ShiftAmt), ElementType));
15023 case X86ISD::VSRLI:
15024 for (unsigned i=0; i!=NumElts; ++i) {
15025 SDValue CurrentOp = SrcOp->getOperand(i);
15026 if (CurrentOp->getOpcode() == ISD::UNDEF) {
15027 Elts.push_back(CurrentOp);
15030 ND = cast<ConstantSDNode>(CurrentOp);
15031 const APInt &C = ND->getAPIntValue();
15032 Elts.push_back(DAG.getConstant(C.lshr(ShiftAmt), ElementType));
15035 case X86ISD::VSRAI:
15036 for (unsigned i=0; i!=NumElts; ++i) {
15037 SDValue CurrentOp = SrcOp->getOperand(i);
15038 if (CurrentOp->getOpcode() == ISD::UNDEF) {
15039 Elts.push_back(CurrentOp);
15042 ND = cast<ConstantSDNode>(CurrentOp);
15043 const APInt &C = ND->getAPIntValue();
15044 Elts.push_back(DAG.getConstant(C.ashr(ShiftAmt), ElementType));
15049 return DAG.getNode(ISD::BUILD_VECTOR, dl, VT, Elts);
15052 return DAG.getNode(Opc, dl, VT, SrcOp, DAG.getConstant(ShiftAmt, MVT::i8));
15055 // getTargetVShiftNode - Handle vector element shifts where the shift amount
15056 // may or may not be a constant. Takes immediate version of shift as input.
15057 static SDValue getTargetVShiftNode(unsigned Opc, SDLoc dl, MVT VT,
15058 SDValue SrcOp, SDValue ShAmt,
15059 SelectionDAG &DAG) {
15060 assert(ShAmt.getValueType() == MVT::i32 && "ShAmt is not i32");
15062 // Catch shift-by-constant.
15063 if (ConstantSDNode *CShAmt = dyn_cast<ConstantSDNode>(ShAmt))
15064 return getTargetVShiftByConstNode(Opc, dl, VT, SrcOp,
15065 CShAmt->getZExtValue(), DAG);
15067 // Change opcode to non-immediate version
15069 default: llvm_unreachable("Unknown target vector shift node");
15070 case X86ISD::VSHLI: Opc = X86ISD::VSHL; break;
15071 case X86ISD::VSRLI: Opc = X86ISD::VSRL; break;
15072 case X86ISD::VSRAI: Opc = X86ISD::VSRA; break;
15075 // Need to build a vector containing shift amount
15076 // Shift amount is 32-bits, but SSE instructions read 64-bit, so fill with 0
15079 ShOps[1] = DAG.getConstant(0, MVT::i32);
15080 ShOps[2] = ShOps[3] = DAG.getUNDEF(MVT::i32);
15081 ShAmt = DAG.getNode(ISD::BUILD_VECTOR, dl, MVT::v4i32, ShOps);
15083 // The return type has to be a 128-bit type with the same element
15084 // type as the input type.
15085 MVT EltVT = VT.getVectorElementType();
15086 EVT ShVT = MVT::getVectorVT(EltVT, 128/EltVT.getSizeInBits());
15088 ShAmt = DAG.getNode(ISD::BITCAST, dl, ShVT, ShAmt);
15089 return DAG.getNode(Opc, dl, VT, SrcOp, ShAmt);
15092 /// \brief Return (vselect \p Mask, \p Op, \p PreservedSrc) along with the
15093 /// necessary casting for \p Mask when lowering masking intrinsics.
15094 static SDValue getVectorMaskingNode(SDValue Op, SDValue Mask,
15095 SDValue PreservedSrc, SelectionDAG &DAG) {
15096 EVT VT = Op.getValueType();
15097 EVT MaskVT = EVT::getVectorVT(*DAG.getContext(),
15098 MVT::i1, VT.getVectorNumElements());
15101 assert(MaskVT.isSimple() && "invalid mask type");
15102 return DAG.getNode(ISD::VSELECT, dl, VT,
15103 DAG.getNode(ISD::BITCAST, dl, MaskVT, Mask),
15107 static unsigned getOpcodeForFMAIntrinsic(unsigned IntNo) {
15109 default: llvm_unreachable("Impossible intrinsic"); // Can't reach here.
15110 case Intrinsic::x86_fma_vfmadd_ps:
15111 case Intrinsic::x86_fma_vfmadd_pd:
15112 case Intrinsic::x86_fma_vfmadd_ps_256:
15113 case Intrinsic::x86_fma_vfmadd_pd_256:
15114 case Intrinsic::x86_fma_mask_vfmadd_ps_512:
15115 case Intrinsic::x86_fma_mask_vfmadd_pd_512:
15116 return X86ISD::FMADD;
15117 case Intrinsic::x86_fma_vfmsub_ps:
15118 case Intrinsic::x86_fma_vfmsub_pd:
15119 case Intrinsic::x86_fma_vfmsub_ps_256:
15120 case Intrinsic::x86_fma_vfmsub_pd_256:
15121 case Intrinsic::x86_fma_mask_vfmsub_ps_512:
15122 case Intrinsic::x86_fma_mask_vfmsub_pd_512:
15123 return X86ISD::FMSUB;
15124 case Intrinsic::x86_fma_vfnmadd_ps:
15125 case Intrinsic::x86_fma_vfnmadd_pd:
15126 case Intrinsic::x86_fma_vfnmadd_ps_256:
15127 case Intrinsic::x86_fma_vfnmadd_pd_256:
15128 case Intrinsic::x86_fma_mask_vfnmadd_ps_512:
15129 case Intrinsic::x86_fma_mask_vfnmadd_pd_512:
15130 return X86ISD::FNMADD;
15131 case Intrinsic::x86_fma_vfnmsub_ps:
15132 case Intrinsic::x86_fma_vfnmsub_pd:
15133 case Intrinsic::x86_fma_vfnmsub_ps_256:
15134 case Intrinsic::x86_fma_vfnmsub_pd_256:
15135 case Intrinsic::x86_fma_mask_vfnmsub_ps_512:
15136 case Intrinsic::x86_fma_mask_vfnmsub_pd_512:
15137 return X86ISD::FNMSUB;
15138 case Intrinsic::x86_fma_vfmaddsub_ps:
15139 case Intrinsic::x86_fma_vfmaddsub_pd:
15140 case Intrinsic::x86_fma_vfmaddsub_ps_256:
15141 case Intrinsic::x86_fma_vfmaddsub_pd_256:
15142 case Intrinsic::x86_fma_mask_vfmaddsub_ps_512:
15143 case Intrinsic::x86_fma_mask_vfmaddsub_pd_512:
15144 return X86ISD::FMADDSUB;
15145 case Intrinsic::x86_fma_vfmsubadd_ps:
15146 case Intrinsic::x86_fma_vfmsubadd_pd:
15147 case Intrinsic::x86_fma_vfmsubadd_ps_256:
15148 case Intrinsic::x86_fma_vfmsubadd_pd_256:
15149 case Intrinsic::x86_fma_mask_vfmsubadd_ps_512:
15150 case Intrinsic::x86_fma_mask_vfmsubadd_pd_512:
15151 return X86ISD::FMSUBADD;
15155 static SDValue LowerINTRINSIC_WO_CHAIN(SDValue Op, SelectionDAG &DAG) {
15157 unsigned IntNo = cast<ConstantSDNode>(Op.getOperand(0))->getZExtValue();
15159 const IntrinsicData* IntrData = getIntrinsicWithoutChain(IntNo);
15161 switch(IntrData->Type) {
15162 case INTR_TYPE_1OP:
15163 return DAG.getNode(IntrData->Opc0, dl, Op.getValueType(), Op.getOperand(1));
15164 case INTR_TYPE_2OP:
15165 return DAG.getNode(IntrData->Opc0, dl, Op.getValueType(), Op.getOperand(1),
15167 case INTR_TYPE_3OP:
15168 return DAG.getNode(IntrData->Opc0, dl, Op.getValueType(), Op.getOperand(1),
15169 Op.getOperand(2), Op.getOperand(3));
15170 case COMI: { // Comparison intrinsics
15171 ISD::CondCode CC = (ISD::CondCode)IntrData->Opc1;
15172 SDValue LHS = Op.getOperand(1);
15173 SDValue RHS = Op.getOperand(2);
15174 unsigned X86CC = TranslateX86CC(CC, true, LHS, RHS, DAG);
15175 assert(X86CC != X86::COND_INVALID && "Unexpected illegal condition!");
15176 SDValue Cond = DAG.getNode(IntrData->Opc0, dl, MVT::i32, LHS, RHS);
15177 SDValue SetCC = DAG.getNode(X86ISD::SETCC, dl, MVT::i8,
15178 DAG.getConstant(X86CC, MVT::i8), Cond);
15179 return DAG.getNode(ISD::ZERO_EXTEND, dl, MVT::i32, SetCC);
15182 return getTargetVShiftNode(IntrData->Opc0, dl, Op.getSimpleValueType(),
15183 Op.getOperand(1), Op.getOperand(2), DAG);
15190 default: return SDValue(); // Don't custom lower most intrinsics.
15192 // Arithmetic intrinsics.
15193 case Intrinsic::x86_sse2_pmulu_dq:
15194 case Intrinsic::x86_avx2_pmulu_dq:
15195 return DAG.getNode(X86ISD::PMULUDQ, dl, Op.getValueType(),
15196 Op.getOperand(1), Op.getOperand(2));
15198 case Intrinsic::x86_sse41_pmuldq:
15199 case Intrinsic::x86_avx2_pmul_dq:
15200 return DAG.getNode(X86ISD::PMULDQ, dl, Op.getValueType(),
15201 Op.getOperand(1), Op.getOperand(2));
15203 case Intrinsic::x86_sse2_pmulhu_w:
15204 case Intrinsic::x86_avx2_pmulhu_w:
15205 return DAG.getNode(ISD::MULHU, dl, Op.getValueType(),
15206 Op.getOperand(1), Op.getOperand(2));
15208 case Intrinsic::x86_sse2_pmulh_w:
15209 case Intrinsic::x86_avx2_pmulh_w:
15210 return DAG.getNode(ISD::MULHS, dl, Op.getValueType(),
15211 Op.getOperand(1), Op.getOperand(2));
15213 // SSE/SSE2/AVX floating point max/min intrinsics.
15214 case Intrinsic::x86_sse_max_ps:
15215 case Intrinsic::x86_sse2_max_pd:
15216 case Intrinsic::x86_avx_max_ps_256:
15217 case Intrinsic::x86_avx_max_pd_256:
15218 case Intrinsic::x86_sse_min_ps:
15219 case Intrinsic::x86_sse2_min_pd:
15220 case Intrinsic::x86_avx_min_ps_256:
15221 case Intrinsic::x86_avx_min_pd_256: {
15224 default: llvm_unreachable("Impossible intrinsic"); // Can't reach here.
15225 case Intrinsic::x86_sse_max_ps:
15226 case Intrinsic::x86_sse2_max_pd:
15227 case Intrinsic::x86_avx_max_ps_256:
15228 case Intrinsic::x86_avx_max_pd_256:
15229 Opcode = X86ISD::FMAX;
15231 case Intrinsic::x86_sse_min_ps:
15232 case Intrinsic::x86_sse2_min_pd:
15233 case Intrinsic::x86_avx_min_ps_256:
15234 case Intrinsic::x86_avx_min_pd_256:
15235 Opcode = X86ISD::FMIN;
15238 return DAG.getNode(Opcode, dl, Op.getValueType(),
15239 Op.getOperand(1), Op.getOperand(2));
15242 // AVX2 variable shift intrinsics
15243 case Intrinsic::x86_avx2_psllv_d:
15244 case Intrinsic::x86_avx2_psllv_q:
15245 case Intrinsic::x86_avx2_psllv_d_256:
15246 case Intrinsic::x86_avx2_psllv_q_256:
15247 case Intrinsic::x86_avx2_psrlv_d:
15248 case Intrinsic::x86_avx2_psrlv_q:
15249 case Intrinsic::x86_avx2_psrlv_d_256:
15250 case Intrinsic::x86_avx2_psrlv_q_256:
15251 case Intrinsic::x86_avx2_psrav_d:
15252 case Intrinsic::x86_avx2_psrav_d_256: {
15255 default: llvm_unreachable("Impossible intrinsic"); // Can't reach here.
15256 case Intrinsic::x86_avx2_psllv_d:
15257 case Intrinsic::x86_avx2_psllv_q:
15258 case Intrinsic::x86_avx2_psllv_d_256:
15259 case Intrinsic::x86_avx2_psllv_q_256:
15262 case Intrinsic::x86_avx2_psrlv_d:
15263 case Intrinsic::x86_avx2_psrlv_q:
15264 case Intrinsic::x86_avx2_psrlv_d_256:
15265 case Intrinsic::x86_avx2_psrlv_q_256:
15268 case Intrinsic::x86_avx2_psrav_d:
15269 case Intrinsic::x86_avx2_psrav_d_256:
15273 return DAG.getNode(Opcode, dl, Op.getValueType(),
15274 Op.getOperand(1), Op.getOperand(2));
15277 case Intrinsic::x86_sse2_packssdw_128:
15278 case Intrinsic::x86_sse2_packsswb_128:
15279 case Intrinsic::x86_avx2_packssdw:
15280 case Intrinsic::x86_avx2_packsswb:
15281 return DAG.getNode(X86ISD::PACKSS, dl, Op.getValueType(),
15282 Op.getOperand(1), Op.getOperand(2));
15284 case Intrinsic::x86_sse2_packuswb_128:
15285 case Intrinsic::x86_sse41_packusdw:
15286 case Intrinsic::x86_avx2_packuswb:
15287 case Intrinsic::x86_avx2_packusdw:
15288 return DAG.getNode(X86ISD::PACKUS, dl, Op.getValueType(),
15289 Op.getOperand(1), Op.getOperand(2));
15291 case Intrinsic::x86_ssse3_pshuf_b_128:
15292 case Intrinsic::x86_avx2_pshuf_b:
15293 return DAG.getNode(X86ISD::PSHUFB, dl, Op.getValueType(),
15294 Op.getOperand(1), Op.getOperand(2));
15296 case Intrinsic::x86_sse2_pshuf_d:
15297 return DAG.getNode(X86ISD::PSHUFD, dl, Op.getValueType(),
15298 Op.getOperand(1), Op.getOperand(2));
15300 case Intrinsic::x86_sse2_pshufl_w:
15301 return DAG.getNode(X86ISD::PSHUFLW, dl, Op.getValueType(),
15302 Op.getOperand(1), Op.getOperand(2));
15304 case Intrinsic::x86_sse2_pshufh_w:
15305 return DAG.getNode(X86ISD::PSHUFHW, dl, Op.getValueType(),
15306 Op.getOperand(1), Op.getOperand(2));
15308 case Intrinsic::x86_ssse3_psign_b_128:
15309 case Intrinsic::x86_ssse3_psign_w_128:
15310 case Intrinsic::x86_ssse3_psign_d_128:
15311 case Intrinsic::x86_avx2_psign_b:
15312 case Intrinsic::x86_avx2_psign_w:
15313 case Intrinsic::x86_avx2_psign_d:
15314 return DAG.getNode(X86ISD::PSIGN, dl, Op.getValueType(),
15315 Op.getOperand(1), Op.getOperand(2));
15317 case Intrinsic::x86_avx2_permd:
15318 case Intrinsic::x86_avx2_permps:
15319 // Operands intentionally swapped. Mask is last operand to intrinsic,
15320 // but second operand for node/instruction.
15321 return DAG.getNode(X86ISD::VPERMV, dl, Op.getValueType(),
15322 Op.getOperand(2), Op.getOperand(1));
15324 case Intrinsic::x86_avx512_mask_valign_q_512:
15325 case Intrinsic::x86_avx512_mask_valign_d_512:
15326 // Vector source operands are swapped.
15327 return getVectorMaskingNode(DAG.getNode(X86ISD::VALIGN, dl,
15328 Op.getValueType(), Op.getOperand(2),
15331 Op.getOperand(5), Op.getOperand(4), DAG);
15333 // ptest and testp intrinsics. The intrinsic these come from are designed to
15334 // return an integer value, not just an instruction so lower it to the ptest
15335 // or testp pattern and a setcc for the result.
15336 case Intrinsic::x86_sse41_ptestz:
15337 case Intrinsic::x86_sse41_ptestc:
15338 case Intrinsic::x86_sse41_ptestnzc:
15339 case Intrinsic::x86_avx_ptestz_256:
15340 case Intrinsic::x86_avx_ptestc_256:
15341 case Intrinsic::x86_avx_ptestnzc_256:
15342 case Intrinsic::x86_avx_vtestz_ps:
15343 case Intrinsic::x86_avx_vtestc_ps:
15344 case Intrinsic::x86_avx_vtestnzc_ps:
15345 case Intrinsic::x86_avx_vtestz_pd:
15346 case Intrinsic::x86_avx_vtestc_pd:
15347 case Intrinsic::x86_avx_vtestnzc_pd:
15348 case Intrinsic::x86_avx_vtestz_ps_256:
15349 case Intrinsic::x86_avx_vtestc_ps_256:
15350 case Intrinsic::x86_avx_vtestnzc_ps_256:
15351 case Intrinsic::x86_avx_vtestz_pd_256:
15352 case Intrinsic::x86_avx_vtestc_pd_256:
15353 case Intrinsic::x86_avx_vtestnzc_pd_256: {
15354 bool IsTestPacked = false;
15357 default: llvm_unreachable("Bad fallthrough in Intrinsic lowering.");
15358 case Intrinsic::x86_avx_vtestz_ps:
15359 case Intrinsic::x86_avx_vtestz_pd:
15360 case Intrinsic::x86_avx_vtestz_ps_256:
15361 case Intrinsic::x86_avx_vtestz_pd_256:
15362 IsTestPacked = true; // Fallthrough
15363 case Intrinsic::x86_sse41_ptestz:
15364 case Intrinsic::x86_avx_ptestz_256:
15366 X86CC = X86::COND_E;
15368 case Intrinsic::x86_avx_vtestc_ps:
15369 case Intrinsic::x86_avx_vtestc_pd:
15370 case Intrinsic::x86_avx_vtestc_ps_256:
15371 case Intrinsic::x86_avx_vtestc_pd_256:
15372 IsTestPacked = true; // Fallthrough
15373 case Intrinsic::x86_sse41_ptestc:
15374 case Intrinsic::x86_avx_ptestc_256:
15376 X86CC = X86::COND_B;
15378 case Intrinsic::x86_avx_vtestnzc_ps:
15379 case Intrinsic::x86_avx_vtestnzc_pd:
15380 case Intrinsic::x86_avx_vtestnzc_ps_256:
15381 case Intrinsic::x86_avx_vtestnzc_pd_256:
15382 IsTestPacked = true; // Fallthrough
15383 case Intrinsic::x86_sse41_ptestnzc:
15384 case Intrinsic::x86_avx_ptestnzc_256:
15386 X86CC = X86::COND_A;
15390 SDValue LHS = Op.getOperand(1);
15391 SDValue RHS = Op.getOperand(2);
15392 unsigned TestOpc = IsTestPacked ? X86ISD::TESTP : X86ISD::PTEST;
15393 SDValue Test = DAG.getNode(TestOpc, dl, MVT::i32, LHS, RHS);
15394 SDValue CC = DAG.getConstant(X86CC, MVT::i8);
15395 SDValue SetCC = DAG.getNode(X86ISD::SETCC, dl, MVT::i8, CC, Test);
15396 return DAG.getNode(ISD::ZERO_EXTEND, dl, MVT::i32, SetCC);
15398 case Intrinsic::x86_avx512_kortestz_w:
15399 case Intrinsic::x86_avx512_kortestc_w: {
15400 unsigned X86CC = (IntNo == Intrinsic::x86_avx512_kortestz_w)? X86::COND_E: X86::COND_B;
15401 SDValue LHS = DAG.getNode(ISD::BITCAST, dl, MVT::v16i1, Op.getOperand(1));
15402 SDValue RHS = DAG.getNode(ISD::BITCAST, dl, MVT::v16i1, Op.getOperand(2));
15403 SDValue CC = DAG.getConstant(X86CC, MVT::i8);
15404 SDValue Test = DAG.getNode(X86ISD::KORTEST, dl, MVT::i32, LHS, RHS);
15405 SDValue SetCC = DAG.getNode(X86ISD::SETCC, dl, MVT::i1, CC, Test);
15406 return DAG.getNode(ISD::ZERO_EXTEND, dl, MVT::i32, SetCC);
15409 case Intrinsic::x86_sse42_pcmpistria128:
15410 case Intrinsic::x86_sse42_pcmpestria128:
15411 case Intrinsic::x86_sse42_pcmpistric128:
15412 case Intrinsic::x86_sse42_pcmpestric128:
15413 case Intrinsic::x86_sse42_pcmpistrio128:
15414 case Intrinsic::x86_sse42_pcmpestrio128:
15415 case Intrinsic::x86_sse42_pcmpistris128:
15416 case Intrinsic::x86_sse42_pcmpestris128:
15417 case Intrinsic::x86_sse42_pcmpistriz128:
15418 case Intrinsic::x86_sse42_pcmpestriz128: {
15422 default: llvm_unreachable("Impossible intrinsic"); // Can't reach here.
15423 case Intrinsic::x86_sse42_pcmpistria128:
15424 Opcode = X86ISD::PCMPISTRI;
15425 X86CC = X86::COND_A;
15427 case Intrinsic::x86_sse42_pcmpestria128:
15428 Opcode = X86ISD::PCMPESTRI;
15429 X86CC = X86::COND_A;
15431 case Intrinsic::x86_sse42_pcmpistric128:
15432 Opcode = X86ISD::PCMPISTRI;
15433 X86CC = X86::COND_B;
15435 case Intrinsic::x86_sse42_pcmpestric128:
15436 Opcode = X86ISD::PCMPESTRI;
15437 X86CC = X86::COND_B;
15439 case Intrinsic::x86_sse42_pcmpistrio128:
15440 Opcode = X86ISD::PCMPISTRI;
15441 X86CC = X86::COND_O;
15443 case Intrinsic::x86_sse42_pcmpestrio128:
15444 Opcode = X86ISD::PCMPESTRI;
15445 X86CC = X86::COND_O;
15447 case Intrinsic::x86_sse42_pcmpistris128:
15448 Opcode = X86ISD::PCMPISTRI;
15449 X86CC = X86::COND_S;
15451 case Intrinsic::x86_sse42_pcmpestris128:
15452 Opcode = X86ISD::PCMPESTRI;
15453 X86CC = X86::COND_S;
15455 case Intrinsic::x86_sse42_pcmpistriz128:
15456 Opcode = X86ISD::PCMPISTRI;
15457 X86CC = X86::COND_E;
15459 case Intrinsic::x86_sse42_pcmpestriz128:
15460 Opcode = X86ISD::PCMPESTRI;
15461 X86CC = X86::COND_E;
15464 SmallVector<SDValue, 5> NewOps(Op->op_begin()+1, Op->op_end());
15465 SDVTList VTs = DAG.getVTList(Op.getValueType(), MVT::i32);
15466 SDValue PCMP = DAG.getNode(Opcode, dl, VTs, NewOps);
15467 SDValue SetCC = DAG.getNode(X86ISD::SETCC, dl, MVT::i8,
15468 DAG.getConstant(X86CC, MVT::i8),
15469 SDValue(PCMP.getNode(), 1));
15470 return DAG.getNode(ISD::ZERO_EXTEND, dl, MVT::i32, SetCC);
15473 case Intrinsic::x86_sse42_pcmpistri128:
15474 case Intrinsic::x86_sse42_pcmpestri128: {
15476 if (IntNo == Intrinsic::x86_sse42_pcmpistri128)
15477 Opcode = X86ISD::PCMPISTRI;
15479 Opcode = X86ISD::PCMPESTRI;
15481 SmallVector<SDValue, 5> NewOps(Op->op_begin()+1, Op->op_end());
15482 SDVTList VTs = DAG.getVTList(Op.getValueType(), MVT::i32);
15483 return DAG.getNode(Opcode, dl, VTs, NewOps);
15486 case Intrinsic::x86_fma_mask_vfmadd_ps_512:
15487 case Intrinsic::x86_fma_mask_vfmadd_pd_512:
15488 case Intrinsic::x86_fma_mask_vfmsub_ps_512:
15489 case Intrinsic::x86_fma_mask_vfmsub_pd_512:
15490 case Intrinsic::x86_fma_mask_vfnmadd_ps_512:
15491 case Intrinsic::x86_fma_mask_vfnmadd_pd_512:
15492 case Intrinsic::x86_fma_mask_vfnmsub_ps_512:
15493 case Intrinsic::x86_fma_mask_vfnmsub_pd_512:
15494 case Intrinsic::x86_fma_mask_vfmaddsub_ps_512:
15495 case Intrinsic::x86_fma_mask_vfmaddsub_pd_512:
15496 case Intrinsic::x86_fma_mask_vfmsubadd_ps_512:
15497 case Intrinsic::x86_fma_mask_vfmsubadd_pd_512: {
15498 auto *SAE = cast<ConstantSDNode>(Op.getOperand(5));
15499 if (SAE->getZExtValue() == X86::STATIC_ROUNDING::CUR_DIRECTION)
15500 return getVectorMaskingNode(DAG.getNode(getOpcodeForFMAIntrinsic(IntNo),
15501 dl, Op.getValueType(),
15505 Op.getOperand(4), Op.getOperand(1), DAG);
15510 case Intrinsic::x86_fma_vfmadd_ps:
15511 case Intrinsic::x86_fma_vfmadd_pd:
15512 case Intrinsic::x86_fma_vfmsub_ps:
15513 case Intrinsic::x86_fma_vfmsub_pd:
15514 case Intrinsic::x86_fma_vfnmadd_ps:
15515 case Intrinsic::x86_fma_vfnmadd_pd:
15516 case Intrinsic::x86_fma_vfnmsub_ps:
15517 case Intrinsic::x86_fma_vfnmsub_pd:
15518 case Intrinsic::x86_fma_vfmaddsub_ps:
15519 case Intrinsic::x86_fma_vfmaddsub_pd:
15520 case Intrinsic::x86_fma_vfmsubadd_ps:
15521 case Intrinsic::x86_fma_vfmsubadd_pd:
15522 case Intrinsic::x86_fma_vfmadd_ps_256:
15523 case Intrinsic::x86_fma_vfmadd_pd_256:
15524 case Intrinsic::x86_fma_vfmsub_ps_256:
15525 case Intrinsic::x86_fma_vfmsub_pd_256:
15526 case Intrinsic::x86_fma_vfnmadd_ps_256:
15527 case Intrinsic::x86_fma_vfnmadd_pd_256:
15528 case Intrinsic::x86_fma_vfnmsub_ps_256:
15529 case Intrinsic::x86_fma_vfnmsub_pd_256:
15530 case Intrinsic::x86_fma_vfmaddsub_ps_256:
15531 case Intrinsic::x86_fma_vfmaddsub_pd_256:
15532 case Intrinsic::x86_fma_vfmsubadd_ps_256:
15533 case Intrinsic::x86_fma_vfmsubadd_pd_256:
15534 return DAG.getNode(getOpcodeForFMAIntrinsic(IntNo), dl, Op.getValueType(),
15535 Op.getOperand(1), Op.getOperand(2), Op.getOperand(3));
15539 static SDValue getGatherNode(unsigned Opc, SDValue Op, SelectionDAG &DAG,
15540 SDValue Src, SDValue Mask, SDValue Base,
15541 SDValue Index, SDValue ScaleOp, SDValue Chain,
15542 const X86Subtarget * Subtarget) {
15544 ConstantSDNode *C = dyn_cast<ConstantSDNode>(ScaleOp);
15545 assert(C && "Invalid scale type");
15546 SDValue Scale = DAG.getTargetConstant(C->getZExtValue(), MVT::i8);
15547 EVT MaskVT = MVT::getVectorVT(MVT::i1,
15548 Index.getSimpleValueType().getVectorNumElements());
15550 ConstantSDNode *MaskC = dyn_cast<ConstantSDNode>(Mask);
15552 MaskInReg = DAG.getTargetConstant(MaskC->getSExtValue(), MaskVT);
15554 MaskInReg = DAG.getNode(ISD::BITCAST, dl, MaskVT, Mask);
15555 SDVTList VTs = DAG.getVTList(Op.getValueType(), MaskVT, MVT::Other);
15556 SDValue Disp = DAG.getTargetConstant(0, MVT::i32);
15557 SDValue Segment = DAG.getRegister(0, MVT::i32);
15558 if (Src.getOpcode() == ISD::UNDEF)
15559 Src = getZeroVector(Op.getValueType(), Subtarget, DAG, dl);
15560 SDValue Ops[] = {Src, MaskInReg, Base, Scale, Index, Disp, Segment, Chain};
15561 SDNode *Res = DAG.getMachineNode(Opc, dl, VTs, Ops);
15562 SDValue RetOps[] = { SDValue(Res, 0), SDValue(Res, 2) };
15563 return DAG.getMergeValues(RetOps, dl);
15566 static SDValue getScatterNode(unsigned Opc, SDValue Op, SelectionDAG &DAG,
15567 SDValue Src, SDValue Mask, SDValue Base,
15568 SDValue Index, SDValue ScaleOp, SDValue Chain) {
15570 ConstantSDNode *C = dyn_cast<ConstantSDNode>(ScaleOp);
15571 assert(C && "Invalid scale type");
15572 SDValue Scale = DAG.getTargetConstant(C->getZExtValue(), MVT::i8);
15573 SDValue Disp = DAG.getTargetConstant(0, MVT::i32);
15574 SDValue Segment = DAG.getRegister(0, MVT::i32);
15575 EVT MaskVT = MVT::getVectorVT(MVT::i1,
15576 Index.getSimpleValueType().getVectorNumElements());
15578 ConstantSDNode *MaskC = dyn_cast<ConstantSDNode>(Mask);
15580 MaskInReg = DAG.getTargetConstant(MaskC->getSExtValue(), MaskVT);
15582 MaskInReg = DAG.getNode(ISD::BITCAST, dl, MaskVT, Mask);
15583 SDVTList VTs = DAG.getVTList(MaskVT, MVT::Other);
15584 SDValue Ops[] = {Base, Scale, Index, Disp, Segment, MaskInReg, Src, Chain};
15585 SDNode *Res = DAG.getMachineNode(Opc, dl, VTs, Ops);
15586 return SDValue(Res, 1);
15589 static SDValue getPrefetchNode(unsigned Opc, SDValue Op, SelectionDAG &DAG,
15590 SDValue Mask, SDValue Base, SDValue Index,
15591 SDValue ScaleOp, SDValue Chain) {
15593 ConstantSDNode *C = dyn_cast<ConstantSDNode>(ScaleOp);
15594 assert(C && "Invalid scale type");
15595 SDValue Scale = DAG.getTargetConstant(C->getZExtValue(), MVT::i8);
15596 SDValue Disp = DAG.getTargetConstant(0, MVT::i32);
15597 SDValue Segment = DAG.getRegister(0, MVT::i32);
15599 MVT::getVectorVT(MVT::i1, Index.getSimpleValueType().getVectorNumElements());
15601 ConstantSDNode *MaskC = dyn_cast<ConstantSDNode>(Mask);
15603 MaskInReg = DAG.getTargetConstant(MaskC->getSExtValue(), MaskVT);
15605 MaskInReg = DAG.getNode(ISD::BITCAST, dl, MaskVT, Mask);
15606 //SDVTList VTs = DAG.getVTList(MVT::Other);
15607 SDValue Ops[] = {MaskInReg, Base, Scale, Index, Disp, Segment, Chain};
15608 SDNode *Res = DAG.getMachineNode(Opc, dl, MVT::Other, Ops);
15609 return SDValue(Res, 0);
15612 // getReadPerformanceCounter - Handles the lowering of builtin intrinsics that
15613 // read performance monitor counters (x86_rdpmc).
15614 static void getReadPerformanceCounter(SDNode *N, SDLoc DL,
15615 SelectionDAG &DAG, const X86Subtarget *Subtarget,
15616 SmallVectorImpl<SDValue> &Results) {
15617 assert(N->getNumOperands() == 3 && "Unexpected number of operands!");
15618 SDVTList Tys = DAG.getVTList(MVT::Other, MVT::Glue);
15621 // The ECX register is used to select the index of the performance counter
15623 SDValue Chain = DAG.getCopyToReg(N->getOperand(0), DL, X86::ECX,
15625 SDValue rd = DAG.getNode(X86ISD::RDPMC_DAG, DL, Tys, Chain);
15627 // Reads the content of a 64-bit performance counter and returns it in the
15628 // registers EDX:EAX.
15629 if (Subtarget->is64Bit()) {
15630 LO = DAG.getCopyFromReg(rd, DL, X86::RAX, MVT::i64, rd.getValue(1));
15631 HI = DAG.getCopyFromReg(LO.getValue(1), DL, X86::RDX, MVT::i64,
15634 LO = DAG.getCopyFromReg(rd, DL, X86::EAX, MVT::i32, rd.getValue(1));
15635 HI = DAG.getCopyFromReg(LO.getValue(1), DL, X86::EDX, MVT::i32,
15638 Chain = HI.getValue(1);
15640 if (Subtarget->is64Bit()) {
15641 // The EAX register is loaded with the low-order 32 bits. The EDX register
15642 // is loaded with the supported high-order bits of the counter.
15643 SDValue Tmp = DAG.getNode(ISD::SHL, DL, MVT::i64, HI,
15644 DAG.getConstant(32, MVT::i8));
15645 Results.push_back(DAG.getNode(ISD::OR, DL, MVT::i64, LO, Tmp));
15646 Results.push_back(Chain);
15650 // Use a buildpair to merge the two 32-bit values into a 64-bit one.
15651 SDValue Ops[] = { LO, HI };
15652 SDValue Pair = DAG.getNode(ISD::BUILD_PAIR, DL, MVT::i64, Ops);
15653 Results.push_back(Pair);
15654 Results.push_back(Chain);
15657 // getReadTimeStampCounter - Handles the lowering of builtin intrinsics that
15658 // read the time stamp counter (x86_rdtsc and x86_rdtscp). This function is
15659 // also used to custom lower READCYCLECOUNTER nodes.
15660 static void getReadTimeStampCounter(SDNode *N, SDLoc DL, unsigned Opcode,
15661 SelectionDAG &DAG, const X86Subtarget *Subtarget,
15662 SmallVectorImpl<SDValue> &Results) {
15663 SDVTList Tys = DAG.getVTList(MVT::Other, MVT::Glue);
15664 SDValue rd = DAG.getNode(Opcode, DL, Tys, N->getOperand(0));
15667 // The processor's time-stamp counter (a 64-bit MSR) is stored into the
15668 // EDX:EAX registers. EDX is loaded with the high-order 32 bits of the MSR
15669 // and the EAX register is loaded with the low-order 32 bits.
15670 if (Subtarget->is64Bit()) {
15671 LO = DAG.getCopyFromReg(rd, DL, X86::RAX, MVT::i64, rd.getValue(1));
15672 HI = DAG.getCopyFromReg(LO.getValue(1), DL, X86::RDX, MVT::i64,
15675 LO = DAG.getCopyFromReg(rd, DL, X86::EAX, MVT::i32, rd.getValue(1));
15676 HI = DAG.getCopyFromReg(LO.getValue(1), DL, X86::EDX, MVT::i32,
15679 SDValue Chain = HI.getValue(1);
15681 if (Opcode == X86ISD::RDTSCP_DAG) {
15682 assert(N->getNumOperands() == 3 && "Unexpected number of operands!");
15684 // Instruction RDTSCP loads the IA32:TSC_AUX_MSR (address C000_0103H) into
15685 // the ECX register. Add 'ecx' explicitly to the chain.
15686 SDValue ecx = DAG.getCopyFromReg(Chain, DL, X86::ECX, MVT::i32,
15688 // Explicitly store the content of ECX at the location passed in input
15689 // to the 'rdtscp' intrinsic.
15690 Chain = DAG.getStore(ecx.getValue(1), DL, ecx, N->getOperand(2),
15691 MachinePointerInfo(), false, false, 0);
15694 if (Subtarget->is64Bit()) {
15695 // The EDX register is loaded with the high-order 32 bits of the MSR, and
15696 // the EAX register is loaded with the low-order 32 bits.
15697 SDValue Tmp = DAG.getNode(ISD::SHL, DL, MVT::i64, HI,
15698 DAG.getConstant(32, MVT::i8));
15699 Results.push_back(DAG.getNode(ISD::OR, DL, MVT::i64, LO, Tmp));
15700 Results.push_back(Chain);
15704 // Use a buildpair to merge the two 32-bit values into a 64-bit one.
15705 SDValue Ops[] = { LO, HI };
15706 SDValue Pair = DAG.getNode(ISD::BUILD_PAIR, DL, MVT::i64, Ops);
15707 Results.push_back(Pair);
15708 Results.push_back(Chain);
15711 static SDValue LowerREADCYCLECOUNTER(SDValue Op, const X86Subtarget *Subtarget,
15712 SelectionDAG &DAG) {
15713 SmallVector<SDValue, 2> Results;
15715 getReadTimeStampCounter(Op.getNode(), DL, X86ISD::RDTSC_DAG, DAG, Subtarget,
15717 return DAG.getMergeValues(Results, DL);
15721 static SDValue LowerINTRINSIC_W_CHAIN(SDValue Op, const X86Subtarget *Subtarget,
15722 SelectionDAG &DAG) {
15723 unsigned IntNo = cast<ConstantSDNode>(Op.getOperand(1))->getZExtValue();
15725 const IntrinsicData* IntrData = getIntrinsicWithChain(IntNo);
15730 switch(IntrData->Type) {
15732 llvm_unreachable("Unknown Intrinsic Type");
15736 // Emit the node with the right value type.
15737 SDVTList VTs = DAG.getVTList(Op->getValueType(0), MVT::Glue, MVT::Other);
15738 SDValue Result = DAG.getNode(IntrData->Opc0, dl, VTs, Op.getOperand(0));
15740 // If the value returned by RDRAND/RDSEED was valid (CF=1), return 1.
15741 // Otherwise return the value from Rand, which is always 0, casted to i32.
15742 SDValue Ops[] = { DAG.getZExtOrTrunc(Result, dl, Op->getValueType(1)),
15743 DAG.getConstant(1, Op->getValueType(1)),
15744 DAG.getConstant(X86::COND_B, MVT::i32),
15745 SDValue(Result.getNode(), 1) };
15746 SDValue isValid = DAG.getNode(X86ISD::CMOV, dl,
15747 DAG.getVTList(Op->getValueType(1), MVT::Glue),
15750 // Return { result, isValid, chain }.
15751 return DAG.getNode(ISD::MERGE_VALUES, dl, Op->getVTList(), Result, isValid,
15752 SDValue(Result.getNode(), 2));
15755 //gather(v1, mask, index, base, scale);
15756 SDValue Chain = Op.getOperand(0);
15757 SDValue Src = Op.getOperand(2);
15758 SDValue Base = Op.getOperand(3);
15759 SDValue Index = Op.getOperand(4);
15760 SDValue Mask = Op.getOperand(5);
15761 SDValue Scale = Op.getOperand(6);
15762 return getGatherNode(IntrData->Opc0, Op, DAG, Src, Mask, Base, Index, Scale, Chain,
15766 //scatter(base, mask, index, v1, scale);
15767 SDValue Chain = Op.getOperand(0);
15768 SDValue Base = Op.getOperand(2);
15769 SDValue Mask = Op.getOperand(3);
15770 SDValue Index = Op.getOperand(4);
15771 SDValue Src = Op.getOperand(5);
15772 SDValue Scale = Op.getOperand(6);
15773 return getScatterNode(IntrData->Opc0, Op, DAG, Src, Mask, Base, Index, Scale, Chain);
15776 SDValue Hint = Op.getOperand(6);
15778 if (dyn_cast<ConstantSDNode> (Hint) == nullptr ||
15779 (HintVal = dyn_cast<ConstantSDNode> (Hint)->getZExtValue()) > 1)
15780 llvm_unreachable("Wrong prefetch hint in intrinsic: should be 0 or 1");
15781 unsigned Opcode = (HintVal ? IntrData->Opc1 : IntrData->Opc0);
15782 SDValue Chain = Op.getOperand(0);
15783 SDValue Mask = Op.getOperand(2);
15784 SDValue Index = Op.getOperand(3);
15785 SDValue Base = Op.getOperand(4);
15786 SDValue Scale = Op.getOperand(5);
15787 return getPrefetchNode(Opcode, Op, DAG, Mask, Base, Index, Scale, Chain);
15789 // Read Time Stamp Counter (RDTSC) and Processor ID (RDTSCP).
15791 SmallVector<SDValue, 2> Results;
15792 getReadTimeStampCounter(Op.getNode(), dl, IntrData->Opc0, DAG, Subtarget, Results);
15793 return DAG.getMergeValues(Results, dl);
15795 // Read Performance Monitoring Counters.
15797 SmallVector<SDValue, 2> Results;
15798 getReadPerformanceCounter(Op.getNode(), dl, DAG, Subtarget, Results);
15799 return DAG.getMergeValues(Results, dl);
15801 // XTEST intrinsics.
15803 SDVTList VTs = DAG.getVTList(Op->getValueType(0), MVT::Other);
15804 SDValue InTrans = DAG.getNode(IntrData->Opc0, dl, VTs, Op.getOperand(0));
15805 SDValue SetCC = DAG.getNode(X86ISD::SETCC, dl, MVT::i8,
15806 DAG.getConstant(X86::COND_NE, MVT::i8),
15808 SDValue Ret = DAG.getNode(ISD::ZERO_EXTEND, dl, Op->getValueType(0), SetCC);
15809 return DAG.getNode(ISD::MERGE_VALUES, dl, Op->getVTList(),
15810 Ret, SDValue(InTrans.getNode(), 1));
15814 SmallVector<SDValue, 2> Results;
15815 SDVTList CFVTs = DAG.getVTList(Op->getValueType(0), MVT::Other);
15816 SDVTList VTs = DAG.getVTList(Op.getOperand(3)->getValueType(0), MVT::Other);
15817 SDValue GenCF = DAG.getNode(X86ISD::ADD, dl, CFVTs, Op.getOperand(2),
15818 DAG.getConstant(-1, MVT::i8));
15819 SDValue Res = DAG.getNode(IntrData->Opc0, dl, VTs, Op.getOperand(3),
15820 Op.getOperand(4), GenCF.getValue(1));
15821 SDValue Store = DAG.getStore(Op.getOperand(0), dl, Res.getValue(0),
15822 Op.getOperand(5), MachinePointerInfo(),
15824 SDValue SetCC = DAG.getNode(X86ISD::SETCC, dl, MVT::i8,
15825 DAG.getConstant(X86::COND_B, MVT::i8),
15827 Results.push_back(SetCC);
15828 Results.push_back(Store);
15829 return DAG.getMergeValues(Results, dl);
15834 SDValue X86TargetLowering::LowerRETURNADDR(SDValue Op,
15835 SelectionDAG &DAG) const {
15836 MachineFrameInfo *MFI = DAG.getMachineFunction().getFrameInfo();
15837 MFI->setReturnAddressIsTaken(true);
15839 if (verifyReturnAddressArgumentIsConstant(Op, DAG))
15842 unsigned Depth = cast<ConstantSDNode>(Op.getOperand(0))->getZExtValue();
15844 EVT PtrVT = getPointerTy();
15847 SDValue FrameAddr = LowerFRAMEADDR(Op, DAG);
15848 const X86RegisterInfo *RegInfo = static_cast<const X86RegisterInfo *>(
15849 DAG.getSubtarget().getRegisterInfo());
15850 SDValue Offset = DAG.getConstant(RegInfo->getSlotSize(), PtrVT);
15851 return DAG.getLoad(PtrVT, dl, DAG.getEntryNode(),
15852 DAG.getNode(ISD::ADD, dl, PtrVT,
15853 FrameAddr, Offset),
15854 MachinePointerInfo(), false, false, false, 0);
15857 // Just load the return address.
15858 SDValue RetAddrFI = getReturnAddressFrameIndex(DAG);
15859 return DAG.getLoad(PtrVT, dl, DAG.getEntryNode(),
15860 RetAddrFI, MachinePointerInfo(), false, false, false, 0);
15863 SDValue X86TargetLowering::LowerFRAMEADDR(SDValue Op, SelectionDAG &DAG) const {
15864 MachineFrameInfo *MFI = DAG.getMachineFunction().getFrameInfo();
15865 MFI->setFrameAddressIsTaken(true);
15867 EVT VT = Op.getValueType();
15868 SDLoc dl(Op); // FIXME probably not meaningful
15869 unsigned Depth = cast<ConstantSDNode>(Op.getOperand(0))->getZExtValue();
15870 const X86RegisterInfo *RegInfo = static_cast<const X86RegisterInfo *>(
15871 DAG.getSubtarget().getRegisterInfo());
15872 unsigned FrameReg = RegInfo->getFrameRegister(DAG.getMachineFunction());
15873 assert(((FrameReg == X86::RBP && VT == MVT::i64) ||
15874 (FrameReg == X86::EBP && VT == MVT::i32)) &&
15875 "Invalid Frame Register!");
15876 SDValue FrameAddr = DAG.getCopyFromReg(DAG.getEntryNode(), dl, FrameReg, VT);
15878 FrameAddr = DAG.getLoad(VT, dl, DAG.getEntryNode(), FrameAddr,
15879 MachinePointerInfo(),
15880 false, false, false, 0);
15884 // FIXME? Maybe this could be a TableGen attribute on some registers and
15885 // this table could be generated automatically from RegInfo.
15886 unsigned X86TargetLowering::getRegisterByName(const char* RegName,
15888 unsigned Reg = StringSwitch<unsigned>(RegName)
15889 .Case("esp", X86::ESP)
15890 .Case("rsp", X86::RSP)
15894 report_fatal_error("Invalid register name global variable");
15897 SDValue X86TargetLowering::LowerFRAME_TO_ARGS_OFFSET(SDValue Op,
15898 SelectionDAG &DAG) const {
15899 const X86RegisterInfo *RegInfo = static_cast<const X86RegisterInfo *>(
15900 DAG.getSubtarget().getRegisterInfo());
15901 return DAG.getIntPtrConstant(2 * RegInfo->getSlotSize());
15904 SDValue X86TargetLowering::LowerEH_RETURN(SDValue Op, SelectionDAG &DAG) const {
15905 SDValue Chain = Op.getOperand(0);
15906 SDValue Offset = Op.getOperand(1);
15907 SDValue Handler = Op.getOperand(2);
15910 EVT PtrVT = getPointerTy();
15911 const X86RegisterInfo *RegInfo = static_cast<const X86RegisterInfo *>(
15912 DAG.getSubtarget().getRegisterInfo());
15913 unsigned FrameReg = RegInfo->getFrameRegister(DAG.getMachineFunction());
15914 assert(((FrameReg == X86::RBP && PtrVT == MVT::i64) ||
15915 (FrameReg == X86::EBP && PtrVT == MVT::i32)) &&
15916 "Invalid Frame Register!");
15917 SDValue Frame = DAG.getCopyFromReg(DAG.getEntryNode(), dl, FrameReg, PtrVT);
15918 unsigned StoreAddrReg = (PtrVT == MVT::i64) ? X86::RCX : X86::ECX;
15920 SDValue StoreAddr = DAG.getNode(ISD::ADD, dl, PtrVT, Frame,
15921 DAG.getIntPtrConstant(RegInfo->getSlotSize()));
15922 StoreAddr = DAG.getNode(ISD::ADD, dl, PtrVT, StoreAddr, Offset);
15923 Chain = DAG.getStore(Chain, dl, Handler, StoreAddr, MachinePointerInfo(),
15925 Chain = DAG.getCopyToReg(Chain, dl, StoreAddrReg, StoreAddr);
15927 return DAG.getNode(X86ISD::EH_RETURN, dl, MVT::Other, Chain,
15928 DAG.getRegister(StoreAddrReg, PtrVT));
15931 SDValue X86TargetLowering::lowerEH_SJLJ_SETJMP(SDValue Op,
15932 SelectionDAG &DAG) const {
15934 return DAG.getNode(X86ISD::EH_SJLJ_SETJMP, DL,
15935 DAG.getVTList(MVT::i32, MVT::Other),
15936 Op.getOperand(0), Op.getOperand(1));
15939 SDValue X86TargetLowering::lowerEH_SJLJ_LONGJMP(SDValue Op,
15940 SelectionDAG &DAG) const {
15942 return DAG.getNode(X86ISD::EH_SJLJ_LONGJMP, DL, MVT::Other,
15943 Op.getOperand(0), Op.getOperand(1));
15946 static SDValue LowerADJUST_TRAMPOLINE(SDValue Op, SelectionDAG &DAG) {
15947 return Op.getOperand(0);
15950 SDValue X86TargetLowering::LowerINIT_TRAMPOLINE(SDValue Op,
15951 SelectionDAG &DAG) const {
15952 SDValue Root = Op.getOperand(0);
15953 SDValue Trmp = Op.getOperand(1); // trampoline
15954 SDValue FPtr = Op.getOperand(2); // nested function
15955 SDValue Nest = Op.getOperand(3); // 'nest' parameter value
15958 const Value *TrmpAddr = cast<SrcValueSDNode>(Op.getOperand(4))->getValue();
15959 const TargetRegisterInfo *TRI = DAG.getSubtarget().getRegisterInfo();
15961 if (Subtarget->is64Bit()) {
15962 SDValue OutChains[6];
15964 // Large code-model.
15965 const unsigned char JMP64r = 0xFF; // 64-bit jmp through register opcode.
15966 const unsigned char MOV64ri = 0xB8; // X86::MOV64ri opcode.
15968 const unsigned char N86R10 = TRI->getEncodingValue(X86::R10) & 0x7;
15969 const unsigned char N86R11 = TRI->getEncodingValue(X86::R11) & 0x7;
15971 const unsigned char REX_WB = 0x40 | 0x08 | 0x01; // REX prefix
15973 // Load the pointer to the nested function into R11.
15974 unsigned OpCode = ((MOV64ri | N86R11) << 8) | REX_WB; // movabsq r11
15975 SDValue Addr = Trmp;
15976 OutChains[0] = DAG.getStore(Root, dl, DAG.getConstant(OpCode, MVT::i16),
15977 Addr, MachinePointerInfo(TrmpAddr),
15980 Addr = DAG.getNode(ISD::ADD, dl, MVT::i64, Trmp,
15981 DAG.getConstant(2, MVT::i64));
15982 OutChains[1] = DAG.getStore(Root, dl, FPtr, Addr,
15983 MachinePointerInfo(TrmpAddr, 2),
15986 // Load the 'nest' parameter value into R10.
15987 // R10 is specified in X86CallingConv.td
15988 OpCode = ((MOV64ri | N86R10) << 8) | REX_WB; // movabsq r10
15989 Addr = DAG.getNode(ISD::ADD, dl, MVT::i64, Trmp,
15990 DAG.getConstant(10, MVT::i64));
15991 OutChains[2] = DAG.getStore(Root, dl, DAG.getConstant(OpCode, MVT::i16),
15992 Addr, MachinePointerInfo(TrmpAddr, 10),
15995 Addr = DAG.getNode(ISD::ADD, dl, MVT::i64, Trmp,
15996 DAG.getConstant(12, MVT::i64));
15997 OutChains[3] = DAG.getStore(Root, dl, Nest, Addr,
15998 MachinePointerInfo(TrmpAddr, 12),
16001 // Jump to the nested function.
16002 OpCode = (JMP64r << 8) | REX_WB; // jmpq *...
16003 Addr = DAG.getNode(ISD::ADD, dl, MVT::i64, Trmp,
16004 DAG.getConstant(20, MVT::i64));
16005 OutChains[4] = DAG.getStore(Root, dl, DAG.getConstant(OpCode, MVT::i16),
16006 Addr, MachinePointerInfo(TrmpAddr, 20),
16009 unsigned char ModRM = N86R11 | (4 << 3) | (3 << 6); // ...r11
16010 Addr = DAG.getNode(ISD::ADD, dl, MVT::i64, Trmp,
16011 DAG.getConstant(22, MVT::i64));
16012 OutChains[5] = DAG.getStore(Root, dl, DAG.getConstant(ModRM, MVT::i8), Addr,
16013 MachinePointerInfo(TrmpAddr, 22),
16016 return DAG.getNode(ISD::TokenFactor, dl, MVT::Other, OutChains);
16018 const Function *Func =
16019 cast<Function>(cast<SrcValueSDNode>(Op.getOperand(5))->getValue());
16020 CallingConv::ID CC = Func->getCallingConv();
16025 llvm_unreachable("Unsupported calling convention");
16026 case CallingConv::C:
16027 case CallingConv::X86_StdCall: {
16028 // Pass 'nest' parameter in ECX.
16029 // Must be kept in sync with X86CallingConv.td
16030 NestReg = X86::ECX;
16032 // Check that ECX wasn't needed by an 'inreg' parameter.
16033 FunctionType *FTy = Func->getFunctionType();
16034 const AttributeSet &Attrs = Func->getAttributes();
16036 if (!Attrs.isEmpty() && !Func->isVarArg()) {
16037 unsigned InRegCount = 0;
16040 for (FunctionType::param_iterator I = FTy->param_begin(),
16041 E = FTy->param_end(); I != E; ++I, ++Idx)
16042 if (Attrs.hasAttribute(Idx, Attribute::InReg))
16043 // FIXME: should only count parameters that are lowered to integers.
16044 InRegCount += (TD->getTypeSizeInBits(*I) + 31) / 32;
16046 if (InRegCount > 2) {
16047 report_fatal_error("Nest register in use - reduce number of inreg"
16053 case CallingConv::X86_FastCall:
16054 case CallingConv::X86_ThisCall:
16055 case CallingConv::Fast:
16056 // Pass 'nest' parameter in EAX.
16057 // Must be kept in sync with X86CallingConv.td
16058 NestReg = X86::EAX;
16062 SDValue OutChains[4];
16063 SDValue Addr, Disp;
16065 Addr = DAG.getNode(ISD::ADD, dl, MVT::i32, Trmp,
16066 DAG.getConstant(10, MVT::i32));
16067 Disp = DAG.getNode(ISD::SUB, dl, MVT::i32, FPtr, Addr);
16069 // This is storing the opcode for MOV32ri.
16070 const unsigned char MOV32ri = 0xB8; // X86::MOV32ri's opcode byte.
16071 const unsigned char N86Reg = TRI->getEncodingValue(NestReg) & 0x7;
16072 OutChains[0] = DAG.getStore(Root, dl,
16073 DAG.getConstant(MOV32ri|N86Reg, MVT::i8),
16074 Trmp, MachinePointerInfo(TrmpAddr),
16077 Addr = DAG.getNode(ISD::ADD, dl, MVT::i32, Trmp,
16078 DAG.getConstant(1, MVT::i32));
16079 OutChains[1] = DAG.getStore(Root, dl, Nest, Addr,
16080 MachinePointerInfo(TrmpAddr, 1),
16083 const unsigned char JMP = 0xE9; // jmp <32bit dst> opcode.
16084 Addr = DAG.getNode(ISD::ADD, dl, MVT::i32, Trmp,
16085 DAG.getConstant(5, MVT::i32));
16086 OutChains[2] = DAG.getStore(Root, dl, DAG.getConstant(JMP, MVT::i8), Addr,
16087 MachinePointerInfo(TrmpAddr, 5),
16090 Addr = DAG.getNode(ISD::ADD, dl, MVT::i32, Trmp,
16091 DAG.getConstant(6, MVT::i32));
16092 OutChains[3] = DAG.getStore(Root, dl, Disp, Addr,
16093 MachinePointerInfo(TrmpAddr, 6),
16096 return DAG.getNode(ISD::TokenFactor, dl, MVT::Other, OutChains);
16100 SDValue X86TargetLowering::LowerFLT_ROUNDS_(SDValue Op,
16101 SelectionDAG &DAG) const {
16103 The rounding mode is in bits 11:10 of FPSR, and has the following
16105 00 Round to nearest
16110 FLT_ROUNDS, on the other hand, expects the following:
16117 To perform the conversion, we do:
16118 (((((FPSR & 0x800) >> 11) | ((FPSR & 0x400) >> 9)) + 1) & 3)
16121 MachineFunction &MF = DAG.getMachineFunction();
16122 const TargetMachine &TM = MF.getTarget();
16123 const TargetFrameLowering &TFI = *TM.getSubtargetImpl()->getFrameLowering();
16124 unsigned StackAlignment = TFI.getStackAlignment();
16125 MVT VT = Op.getSimpleValueType();
16128 // Save FP Control Word to stack slot
16129 int SSFI = MF.getFrameInfo()->CreateStackObject(2, StackAlignment, false);
16130 SDValue StackSlot = DAG.getFrameIndex(SSFI, getPointerTy());
16132 MachineMemOperand *MMO =
16133 MF.getMachineMemOperand(MachinePointerInfo::getFixedStack(SSFI),
16134 MachineMemOperand::MOStore, 2, 2);
16136 SDValue Ops[] = { DAG.getEntryNode(), StackSlot };
16137 SDValue Chain = DAG.getMemIntrinsicNode(X86ISD::FNSTCW16m, DL,
16138 DAG.getVTList(MVT::Other),
16139 Ops, MVT::i16, MMO);
16141 // Load FP Control Word from stack slot
16142 SDValue CWD = DAG.getLoad(MVT::i16, DL, Chain, StackSlot,
16143 MachinePointerInfo(), false, false, false, 0);
16145 // Transform as necessary
16147 DAG.getNode(ISD::SRL, DL, MVT::i16,
16148 DAG.getNode(ISD::AND, DL, MVT::i16,
16149 CWD, DAG.getConstant(0x800, MVT::i16)),
16150 DAG.getConstant(11, MVT::i8));
16152 DAG.getNode(ISD::SRL, DL, MVT::i16,
16153 DAG.getNode(ISD::AND, DL, MVT::i16,
16154 CWD, DAG.getConstant(0x400, MVT::i16)),
16155 DAG.getConstant(9, MVT::i8));
16158 DAG.getNode(ISD::AND, DL, MVT::i16,
16159 DAG.getNode(ISD::ADD, DL, MVT::i16,
16160 DAG.getNode(ISD::OR, DL, MVT::i16, CWD1, CWD2),
16161 DAG.getConstant(1, MVT::i16)),
16162 DAG.getConstant(3, MVT::i16));
16164 return DAG.getNode((VT.getSizeInBits() < 16 ?
16165 ISD::TRUNCATE : ISD::ZERO_EXTEND), DL, VT, RetVal);
16168 static SDValue LowerCTLZ(SDValue Op, SelectionDAG &DAG) {
16169 MVT VT = Op.getSimpleValueType();
16171 unsigned NumBits = VT.getSizeInBits();
16174 Op = Op.getOperand(0);
16175 if (VT == MVT::i8) {
16176 // Zero extend to i32 since there is not an i8 bsr.
16178 Op = DAG.getNode(ISD::ZERO_EXTEND, dl, OpVT, Op);
16181 // Issue a bsr (scan bits in reverse) which also sets EFLAGS.
16182 SDVTList VTs = DAG.getVTList(OpVT, MVT::i32);
16183 Op = DAG.getNode(X86ISD::BSR, dl, VTs, Op);
16185 // If src is zero (i.e. bsr sets ZF), returns NumBits.
16188 DAG.getConstant(NumBits+NumBits-1, OpVT),
16189 DAG.getConstant(X86::COND_E, MVT::i8),
16192 Op = DAG.getNode(X86ISD::CMOV, dl, OpVT, Ops);
16194 // Finally xor with NumBits-1.
16195 Op = DAG.getNode(ISD::XOR, dl, OpVT, Op, DAG.getConstant(NumBits-1, OpVT));
16198 Op = DAG.getNode(ISD::TRUNCATE, dl, MVT::i8, Op);
16202 static SDValue LowerCTLZ_ZERO_UNDEF(SDValue Op, SelectionDAG &DAG) {
16203 MVT VT = Op.getSimpleValueType();
16205 unsigned NumBits = VT.getSizeInBits();
16208 Op = Op.getOperand(0);
16209 if (VT == MVT::i8) {
16210 // Zero extend to i32 since there is not an i8 bsr.
16212 Op = DAG.getNode(ISD::ZERO_EXTEND, dl, OpVT, Op);
16215 // Issue a bsr (scan bits in reverse).
16216 SDVTList VTs = DAG.getVTList(OpVT, MVT::i32);
16217 Op = DAG.getNode(X86ISD::BSR, dl, VTs, Op);
16219 // And xor with NumBits-1.
16220 Op = DAG.getNode(ISD::XOR, dl, OpVT, Op, DAG.getConstant(NumBits-1, OpVT));
16223 Op = DAG.getNode(ISD::TRUNCATE, dl, MVT::i8, Op);
16227 static SDValue LowerCTTZ(SDValue Op, SelectionDAG &DAG) {
16228 MVT VT = Op.getSimpleValueType();
16229 unsigned NumBits = VT.getSizeInBits();
16231 Op = Op.getOperand(0);
16233 // Issue a bsf (scan bits forward) which also sets EFLAGS.
16234 SDVTList VTs = DAG.getVTList(VT, MVT::i32);
16235 Op = DAG.getNode(X86ISD::BSF, dl, VTs, Op);
16237 // If src is zero (i.e. bsf sets ZF), returns NumBits.
16240 DAG.getConstant(NumBits, VT),
16241 DAG.getConstant(X86::COND_E, MVT::i8),
16244 return DAG.getNode(X86ISD::CMOV, dl, VT, Ops);
16247 // Lower256IntArith - Break a 256-bit integer operation into two new 128-bit
16248 // ones, and then concatenate the result back.
16249 static SDValue Lower256IntArith(SDValue Op, SelectionDAG &DAG) {
16250 MVT VT = Op.getSimpleValueType();
16252 assert(VT.is256BitVector() && VT.isInteger() &&
16253 "Unsupported value type for operation");
16255 unsigned NumElems = VT.getVectorNumElements();
16258 // Extract the LHS vectors
16259 SDValue LHS = Op.getOperand(0);
16260 SDValue LHS1 = Extract128BitVector(LHS, 0, DAG, dl);
16261 SDValue LHS2 = Extract128BitVector(LHS, NumElems/2, DAG, dl);
16263 // Extract the RHS vectors
16264 SDValue RHS = Op.getOperand(1);
16265 SDValue RHS1 = Extract128BitVector(RHS, 0, DAG, dl);
16266 SDValue RHS2 = Extract128BitVector(RHS, NumElems/2, DAG, dl);
16268 MVT EltVT = VT.getVectorElementType();
16269 MVT NewVT = MVT::getVectorVT(EltVT, NumElems/2);
16271 return DAG.getNode(ISD::CONCAT_VECTORS, dl, VT,
16272 DAG.getNode(Op.getOpcode(), dl, NewVT, LHS1, RHS1),
16273 DAG.getNode(Op.getOpcode(), dl, NewVT, LHS2, RHS2));
16276 static SDValue LowerADD(SDValue Op, SelectionDAG &DAG) {
16277 assert(Op.getSimpleValueType().is256BitVector() &&
16278 Op.getSimpleValueType().isInteger() &&
16279 "Only handle AVX 256-bit vector integer operation");
16280 return Lower256IntArith(Op, DAG);
16283 static SDValue LowerSUB(SDValue Op, SelectionDAG &DAG) {
16284 assert(Op.getSimpleValueType().is256BitVector() &&
16285 Op.getSimpleValueType().isInteger() &&
16286 "Only handle AVX 256-bit vector integer operation");
16287 return Lower256IntArith(Op, DAG);
16290 static SDValue LowerMUL(SDValue Op, const X86Subtarget *Subtarget,
16291 SelectionDAG &DAG) {
16293 MVT VT = Op.getSimpleValueType();
16295 // Decompose 256-bit ops into smaller 128-bit ops.
16296 if (VT.is256BitVector() && !Subtarget->hasInt256())
16297 return Lower256IntArith(Op, DAG);
16299 SDValue A = Op.getOperand(0);
16300 SDValue B = Op.getOperand(1);
16302 // Lower v4i32 mul as 2x shuffle, 2x pmuludq, 2x shuffle.
16303 if (VT == MVT::v4i32) {
16304 assert(Subtarget->hasSSE2() && !Subtarget->hasSSE41() &&
16305 "Should not custom lower when pmuldq is available!");
16307 // Extract the odd parts.
16308 static const int UnpackMask[] = { 1, -1, 3, -1 };
16309 SDValue Aodds = DAG.getVectorShuffle(VT, dl, A, A, UnpackMask);
16310 SDValue Bodds = DAG.getVectorShuffle(VT, dl, B, B, UnpackMask);
16312 // Multiply the even parts.
16313 SDValue Evens = DAG.getNode(X86ISD::PMULUDQ, dl, MVT::v2i64, A, B);
16314 // Now multiply odd parts.
16315 SDValue Odds = DAG.getNode(X86ISD::PMULUDQ, dl, MVT::v2i64, Aodds, Bodds);
16317 Evens = DAG.getNode(ISD::BITCAST, dl, VT, Evens);
16318 Odds = DAG.getNode(ISD::BITCAST, dl, VT, Odds);
16320 // Merge the two vectors back together with a shuffle. This expands into 2
16322 static const int ShufMask[] = { 0, 4, 2, 6 };
16323 return DAG.getVectorShuffle(VT, dl, Evens, Odds, ShufMask);
16326 assert((VT == MVT::v2i64 || VT == MVT::v4i64 || VT == MVT::v8i64) &&
16327 "Only know how to lower V2I64/V4I64/V8I64 multiply");
16329 // Ahi = psrlqi(a, 32);
16330 // Bhi = psrlqi(b, 32);
16332 // AloBlo = pmuludq(a, b);
16333 // AloBhi = pmuludq(a, Bhi);
16334 // AhiBlo = pmuludq(Ahi, b);
16336 // AloBhi = psllqi(AloBhi, 32);
16337 // AhiBlo = psllqi(AhiBlo, 32);
16338 // return AloBlo + AloBhi + AhiBlo;
16340 SDValue Ahi = getTargetVShiftByConstNode(X86ISD::VSRLI, dl, VT, A, 32, DAG);
16341 SDValue Bhi = getTargetVShiftByConstNode(X86ISD::VSRLI, dl, VT, B, 32, DAG);
16343 // Bit cast to 32-bit vectors for MULUDQ
16344 EVT MulVT = (VT == MVT::v2i64) ? MVT::v4i32 :
16345 (VT == MVT::v4i64) ? MVT::v8i32 : MVT::v16i32;
16346 A = DAG.getNode(ISD::BITCAST, dl, MulVT, A);
16347 B = DAG.getNode(ISD::BITCAST, dl, MulVT, B);
16348 Ahi = DAG.getNode(ISD::BITCAST, dl, MulVT, Ahi);
16349 Bhi = DAG.getNode(ISD::BITCAST, dl, MulVT, Bhi);
16351 SDValue AloBlo = DAG.getNode(X86ISD::PMULUDQ, dl, VT, A, B);
16352 SDValue AloBhi = DAG.getNode(X86ISD::PMULUDQ, dl, VT, A, Bhi);
16353 SDValue AhiBlo = DAG.getNode(X86ISD::PMULUDQ, dl, VT, Ahi, B);
16355 AloBhi = getTargetVShiftByConstNode(X86ISD::VSHLI, dl, VT, AloBhi, 32, DAG);
16356 AhiBlo = getTargetVShiftByConstNode(X86ISD::VSHLI, dl, VT, AhiBlo, 32, DAG);
16358 SDValue Res = DAG.getNode(ISD::ADD, dl, VT, AloBlo, AloBhi);
16359 return DAG.getNode(ISD::ADD, dl, VT, Res, AhiBlo);
16362 SDValue X86TargetLowering::LowerWin64_i128OP(SDValue Op, SelectionDAG &DAG) const {
16363 assert(Subtarget->isTargetWin64() && "Unexpected target");
16364 EVT VT = Op.getValueType();
16365 assert(VT.isInteger() && VT.getSizeInBits() == 128 &&
16366 "Unexpected return type for lowering");
16370 switch (Op->getOpcode()) {
16371 default: llvm_unreachable("Unexpected request for libcall!");
16372 case ISD::SDIV: isSigned = true; LC = RTLIB::SDIV_I128; break;
16373 case ISD::UDIV: isSigned = false; LC = RTLIB::UDIV_I128; break;
16374 case ISD::SREM: isSigned = true; LC = RTLIB::SREM_I128; break;
16375 case ISD::UREM: isSigned = false; LC = RTLIB::UREM_I128; break;
16376 case ISD::SDIVREM: isSigned = true; LC = RTLIB::SDIVREM_I128; break;
16377 case ISD::UDIVREM: isSigned = false; LC = RTLIB::UDIVREM_I128; break;
16381 SDValue InChain = DAG.getEntryNode();
16383 TargetLowering::ArgListTy Args;
16384 TargetLowering::ArgListEntry Entry;
16385 for (unsigned i = 0, e = Op->getNumOperands(); i != e; ++i) {
16386 EVT ArgVT = Op->getOperand(i).getValueType();
16387 assert(ArgVT.isInteger() && ArgVT.getSizeInBits() == 128 &&
16388 "Unexpected argument type for lowering");
16389 SDValue StackPtr = DAG.CreateStackTemporary(ArgVT, 16);
16390 Entry.Node = StackPtr;
16391 InChain = DAG.getStore(InChain, dl, Op->getOperand(i), StackPtr, MachinePointerInfo(),
16393 Type *ArgTy = ArgVT.getTypeForEVT(*DAG.getContext());
16394 Entry.Ty = PointerType::get(ArgTy,0);
16395 Entry.isSExt = false;
16396 Entry.isZExt = false;
16397 Args.push_back(Entry);
16400 SDValue Callee = DAG.getExternalSymbol(getLibcallName(LC),
16403 TargetLowering::CallLoweringInfo CLI(DAG);
16404 CLI.setDebugLoc(dl).setChain(InChain)
16405 .setCallee(getLibcallCallingConv(LC),
16406 static_cast<EVT>(MVT::v2i64).getTypeForEVT(*DAG.getContext()),
16407 Callee, std::move(Args), 0)
16408 .setInRegister().setSExtResult(isSigned).setZExtResult(!isSigned);
16410 std::pair<SDValue, SDValue> CallInfo = LowerCallTo(CLI);
16411 return DAG.getNode(ISD::BITCAST, dl, VT, CallInfo.first);
16414 static SDValue LowerMUL_LOHI(SDValue Op, const X86Subtarget *Subtarget,
16415 SelectionDAG &DAG) {
16416 SDValue Op0 = Op.getOperand(0), Op1 = Op.getOperand(1);
16417 EVT VT = Op0.getValueType();
16420 assert((VT == MVT::v4i32 && Subtarget->hasSSE2()) ||
16421 (VT == MVT::v8i32 && Subtarget->hasInt256()));
16423 // PMULxD operations multiply each even value (starting at 0) of LHS with
16424 // the related value of RHS and produce a widen result.
16425 // E.g., PMULUDQ <4 x i32> <a|b|c|d>, <4 x i32> <e|f|g|h>
16426 // => <2 x i64> <ae|cg>
16428 // In other word, to have all the results, we need to perform two PMULxD:
16429 // 1. one with the even values.
16430 // 2. one with the odd values.
16431 // To achieve #2, with need to place the odd values at an even position.
16433 // Place the odd value at an even position (basically, shift all values 1
16434 // step to the left):
16435 const int Mask[] = {1, -1, 3, -1, 5, -1, 7, -1};
16436 // <a|b|c|d> => <b|undef|d|undef>
16437 SDValue Odd0 = DAG.getVectorShuffle(VT, dl, Op0, Op0, Mask);
16438 // <e|f|g|h> => <f|undef|h|undef>
16439 SDValue Odd1 = DAG.getVectorShuffle(VT, dl, Op1, Op1, Mask);
16441 // Emit two multiplies, one for the lower 2 ints and one for the higher 2
16443 MVT MulVT = VT == MVT::v4i32 ? MVT::v2i64 : MVT::v4i64;
16444 bool IsSigned = Op->getOpcode() == ISD::SMUL_LOHI;
16446 (!IsSigned || !Subtarget->hasSSE41()) ? X86ISD::PMULUDQ : X86ISD::PMULDQ;
16447 // PMULUDQ <4 x i32> <a|b|c|d>, <4 x i32> <e|f|g|h>
16448 // => <2 x i64> <ae|cg>
16449 SDValue Mul1 = DAG.getNode(ISD::BITCAST, dl, VT,
16450 DAG.getNode(Opcode, dl, MulVT, Op0, Op1));
16451 // PMULUDQ <4 x i32> <b|undef|d|undef>, <4 x i32> <f|undef|h|undef>
16452 // => <2 x i64> <bf|dh>
16453 SDValue Mul2 = DAG.getNode(ISD::BITCAST, dl, VT,
16454 DAG.getNode(Opcode, dl, MulVT, Odd0, Odd1));
16456 // Shuffle it back into the right order.
16457 SDValue Highs, Lows;
16458 if (VT == MVT::v8i32) {
16459 const int HighMask[] = {1, 9, 3, 11, 5, 13, 7, 15};
16460 Highs = DAG.getVectorShuffle(VT, dl, Mul1, Mul2, HighMask);
16461 const int LowMask[] = {0, 8, 2, 10, 4, 12, 6, 14};
16462 Lows = DAG.getVectorShuffle(VT, dl, Mul1, Mul2, LowMask);
16464 const int HighMask[] = {1, 5, 3, 7};
16465 Highs = DAG.getVectorShuffle(VT, dl, Mul1, Mul2, HighMask);
16466 const int LowMask[] = {0, 4, 2, 6};
16467 Lows = DAG.getVectorShuffle(VT, dl, Mul1, Mul2, LowMask);
16470 // If we have a signed multiply but no PMULDQ fix up the high parts of a
16471 // unsigned multiply.
16472 if (IsSigned && !Subtarget->hasSSE41()) {
16474 DAG.getConstant(31, DAG.getTargetLoweringInfo().getShiftAmountTy(VT));
16475 SDValue T1 = DAG.getNode(ISD::AND, dl, VT,
16476 DAG.getNode(ISD::SRA, dl, VT, Op0, ShAmt), Op1);
16477 SDValue T2 = DAG.getNode(ISD::AND, dl, VT,
16478 DAG.getNode(ISD::SRA, dl, VT, Op1, ShAmt), Op0);
16480 SDValue Fixup = DAG.getNode(ISD::ADD, dl, VT, T1, T2);
16481 Highs = DAG.getNode(ISD::SUB, dl, VT, Highs, Fixup);
16484 // The first result of MUL_LOHI is actually the low value, followed by the
16486 SDValue Ops[] = {Lows, Highs};
16487 return DAG.getMergeValues(Ops, dl);
16490 static SDValue LowerScalarImmediateShift(SDValue Op, SelectionDAG &DAG,
16491 const X86Subtarget *Subtarget) {
16492 MVT VT = Op.getSimpleValueType();
16494 SDValue R = Op.getOperand(0);
16495 SDValue Amt = Op.getOperand(1);
16497 // Optimize shl/srl/sra with constant shift amount.
16498 if (auto *BVAmt = dyn_cast<BuildVectorSDNode>(Amt)) {
16499 if (auto *ShiftConst = BVAmt->getConstantSplatNode()) {
16500 uint64_t ShiftAmt = ShiftConst->getZExtValue();
16502 if (VT == MVT::v2i64 || VT == MVT::v4i32 || VT == MVT::v8i16 ||
16503 (Subtarget->hasInt256() &&
16504 (VT == MVT::v4i64 || VT == MVT::v8i32 || VT == MVT::v16i16)) ||
16505 (Subtarget->hasAVX512() &&
16506 (VT == MVT::v8i64 || VT == MVT::v16i32))) {
16507 if (Op.getOpcode() == ISD::SHL)
16508 return getTargetVShiftByConstNode(X86ISD::VSHLI, dl, VT, R, ShiftAmt,
16510 if (Op.getOpcode() == ISD::SRL)
16511 return getTargetVShiftByConstNode(X86ISD::VSRLI, dl, VT, R, ShiftAmt,
16513 if (Op.getOpcode() == ISD::SRA && VT != MVT::v2i64 && VT != MVT::v4i64)
16514 return getTargetVShiftByConstNode(X86ISD::VSRAI, dl, VT, R, ShiftAmt,
16518 if (VT == MVT::v16i8) {
16519 if (Op.getOpcode() == ISD::SHL) {
16520 // Make a large shift.
16521 SDValue SHL = getTargetVShiftByConstNode(X86ISD::VSHLI, dl,
16522 MVT::v8i16, R, ShiftAmt,
16524 SHL = DAG.getNode(ISD::BITCAST, dl, VT, SHL);
16525 // Zero out the rightmost bits.
16526 SmallVector<SDValue, 16> V(16,
16527 DAG.getConstant(uint8_t(-1U << ShiftAmt),
16529 return DAG.getNode(ISD::AND, dl, VT, SHL,
16530 DAG.getNode(ISD::BUILD_VECTOR, dl, VT, V));
16532 if (Op.getOpcode() == ISD::SRL) {
16533 // Make a large shift.
16534 SDValue SRL = getTargetVShiftByConstNode(X86ISD::VSRLI, dl,
16535 MVT::v8i16, R, ShiftAmt,
16537 SRL = DAG.getNode(ISD::BITCAST, dl, VT, SRL);
16538 // Zero out the leftmost bits.
16539 SmallVector<SDValue, 16> V(16,
16540 DAG.getConstant(uint8_t(-1U) >> ShiftAmt,
16542 return DAG.getNode(ISD::AND, dl, VT, SRL,
16543 DAG.getNode(ISD::BUILD_VECTOR, dl, VT, V));
16545 if (Op.getOpcode() == ISD::SRA) {
16546 if (ShiftAmt == 7) {
16547 // R s>> 7 === R s< 0
16548 SDValue Zeros = getZeroVector(VT, Subtarget, DAG, dl);
16549 return DAG.getNode(X86ISD::PCMPGT, dl, VT, Zeros, R);
16552 // R s>> a === ((R u>> a) ^ m) - m
16553 SDValue Res = DAG.getNode(ISD::SRL, dl, VT, R, Amt);
16554 SmallVector<SDValue, 16> V(16, DAG.getConstant(128 >> ShiftAmt,
16556 SDValue Mask = DAG.getNode(ISD::BUILD_VECTOR, dl, VT, V);
16557 Res = DAG.getNode(ISD::XOR, dl, VT, Res, Mask);
16558 Res = DAG.getNode(ISD::SUB, dl, VT, Res, Mask);
16561 llvm_unreachable("Unknown shift opcode.");
16564 if (Subtarget->hasInt256() && VT == MVT::v32i8) {
16565 if (Op.getOpcode() == ISD::SHL) {
16566 // Make a large shift.
16567 SDValue SHL = getTargetVShiftByConstNode(X86ISD::VSHLI, dl,
16568 MVT::v16i16, R, ShiftAmt,
16570 SHL = DAG.getNode(ISD::BITCAST, dl, VT, SHL);
16571 // Zero out the rightmost bits.
16572 SmallVector<SDValue, 32> V(32,
16573 DAG.getConstant(uint8_t(-1U << ShiftAmt),
16575 return DAG.getNode(ISD::AND, dl, VT, SHL,
16576 DAG.getNode(ISD::BUILD_VECTOR, dl, VT, V));
16578 if (Op.getOpcode() == ISD::SRL) {
16579 // Make a large shift.
16580 SDValue SRL = getTargetVShiftByConstNode(X86ISD::VSRLI, dl,
16581 MVT::v16i16, R, ShiftAmt,
16583 SRL = DAG.getNode(ISD::BITCAST, dl, VT, SRL);
16584 // Zero out the leftmost bits.
16585 SmallVector<SDValue, 32> V(32,
16586 DAG.getConstant(uint8_t(-1U) >> ShiftAmt,
16588 return DAG.getNode(ISD::AND, dl, VT, SRL,
16589 DAG.getNode(ISD::BUILD_VECTOR, dl, VT, V));
16591 if (Op.getOpcode() == ISD::SRA) {
16592 if (ShiftAmt == 7) {
16593 // R s>> 7 === R s< 0
16594 SDValue Zeros = getZeroVector(VT, Subtarget, DAG, dl);
16595 return DAG.getNode(X86ISD::PCMPGT, dl, VT, Zeros, R);
16598 // R s>> a === ((R u>> a) ^ m) - m
16599 SDValue Res = DAG.getNode(ISD::SRL, dl, VT, R, Amt);
16600 SmallVector<SDValue, 32> V(32, DAG.getConstant(128 >> ShiftAmt,
16602 SDValue Mask = DAG.getNode(ISD::BUILD_VECTOR, dl, VT, V);
16603 Res = DAG.getNode(ISD::XOR, dl, VT, Res, Mask);
16604 Res = DAG.getNode(ISD::SUB, dl, VT, Res, Mask);
16607 llvm_unreachable("Unknown shift opcode.");
16612 // Special case in 32-bit mode, where i64 is expanded into high and low parts.
16613 if (!Subtarget->is64Bit() &&
16614 (VT == MVT::v2i64 || (Subtarget->hasInt256() && VT == MVT::v4i64)) &&
16615 Amt.getOpcode() == ISD::BITCAST &&
16616 Amt.getOperand(0).getOpcode() == ISD::BUILD_VECTOR) {
16617 Amt = Amt.getOperand(0);
16618 unsigned Ratio = Amt.getSimpleValueType().getVectorNumElements() /
16619 VT.getVectorNumElements();
16620 unsigned RatioInLog2 = Log2_32_Ceil(Ratio);
16621 uint64_t ShiftAmt = 0;
16622 for (unsigned i = 0; i != Ratio; ++i) {
16623 ConstantSDNode *C = dyn_cast<ConstantSDNode>(Amt.getOperand(i));
16627 ShiftAmt |= C->getZExtValue() << (i * (1 << (6 - RatioInLog2)));
16629 // Check remaining shift amounts.
16630 for (unsigned i = Ratio; i != Amt.getNumOperands(); i += Ratio) {
16631 uint64_t ShAmt = 0;
16632 for (unsigned j = 0; j != Ratio; ++j) {
16633 ConstantSDNode *C =
16634 dyn_cast<ConstantSDNode>(Amt.getOperand(i + j));
16638 ShAmt |= C->getZExtValue() << (j * (1 << (6 - RatioInLog2)));
16640 if (ShAmt != ShiftAmt)
16643 switch (Op.getOpcode()) {
16645 llvm_unreachable("Unknown shift opcode!");
16647 return getTargetVShiftByConstNode(X86ISD::VSHLI, dl, VT, R, ShiftAmt,
16650 return getTargetVShiftByConstNode(X86ISD::VSRLI, dl, VT, R, ShiftAmt,
16653 return getTargetVShiftByConstNode(X86ISD::VSRAI, dl, VT, R, ShiftAmt,
16661 static SDValue LowerScalarVariableShift(SDValue Op, SelectionDAG &DAG,
16662 const X86Subtarget* Subtarget) {
16663 MVT VT = Op.getSimpleValueType();
16665 SDValue R = Op.getOperand(0);
16666 SDValue Amt = Op.getOperand(1);
16668 if ((VT == MVT::v2i64 && Op.getOpcode() != ISD::SRA) ||
16669 VT == MVT::v4i32 || VT == MVT::v8i16 ||
16670 (Subtarget->hasInt256() &&
16671 ((VT == MVT::v4i64 && Op.getOpcode() != ISD::SRA) ||
16672 VT == MVT::v8i32 || VT == MVT::v16i16)) ||
16673 (Subtarget->hasAVX512() && (VT == MVT::v8i64 || VT == MVT::v16i32))) {
16675 EVT EltVT = VT.getVectorElementType();
16677 if (Amt.getOpcode() == ISD::BUILD_VECTOR) {
16678 unsigned NumElts = VT.getVectorNumElements();
16680 for (i = 0; i != NumElts; ++i) {
16681 if (Amt.getOperand(i).getOpcode() == ISD::UNDEF)
16685 for (j = i; j != NumElts; ++j) {
16686 SDValue Arg = Amt.getOperand(j);
16687 if (Arg.getOpcode() == ISD::UNDEF) continue;
16688 if (Arg != Amt.getOperand(i))
16691 if (i != NumElts && j == NumElts)
16692 BaseShAmt = Amt.getOperand(i);
16694 if (Amt.getOpcode() == ISD::EXTRACT_SUBVECTOR)
16695 Amt = Amt.getOperand(0);
16696 if (Amt.getOpcode() == ISD::VECTOR_SHUFFLE &&
16697 cast<ShuffleVectorSDNode>(Amt)->isSplat()) {
16698 SDValue InVec = Amt.getOperand(0);
16699 if (InVec.getOpcode() == ISD::BUILD_VECTOR) {
16700 unsigned NumElts = InVec.getValueType().getVectorNumElements();
16702 for (; i != NumElts; ++i) {
16703 SDValue Arg = InVec.getOperand(i);
16704 if (Arg.getOpcode() == ISD::UNDEF) continue;
16708 } else if (InVec.getOpcode() == ISD::INSERT_VECTOR_ELT) {
16709 if (ConstantSDNode *C =
16710 dyn_cast<ConstantSDNode>(InVec.getOperand(2))) {
16711 unsigned SplatIdx =
16712 cast<ShuffleVectorSDNode>(Amt)->getSplatIndex();
16713 if (C->getZExtValue() == SplatIdx)
16714 BaseShAmt = InVec.getOperand(1);
16717 if (!BaseShAmt.getNode())
16718 BaseShAmt = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, EltVT, Amt,
16719 DAG.getIntPtrConstant(0));
16723 if (BaseShAmt.getNode()) {
16724 if (EltVT.bitsGT(MVT::i32))
16725 BaseShAmt = DAG.getNode(ISD::TRUNCATE, dl, MVT::i32, BaseShAmt);
16726 else if (EltVT.bitsLT(MVT::i32))
16727 BaseShAmt = DAG.getNode(ISD::ZERO_EXTEND, dl, MVT::i32, BaseShAmt);
16729 switch (Op.getOpcode()) {
16731 llvm_unreachable("Unknown shift opcode!");
16733 switch (VT.SimpleTy) {
16734 default: return SDValue();
16743 return getTargetVShiftNode(X86ISD::VSHLI, dl, VT, R, BaseShAmt, DAG);
16746 switch (VT.SimpleTy) {
16747 default: return SDValue();
16754 return getTargetVShiftNode(X86ISD::VSRAI, dl, VT, R, BaseShAmt, DAG);
16757 switch (VT.SimpleTy) {
16758 default: return SDValue();
16767 return getTargetVShiftNode(X86ISD::VSRLI, dl, VT, R, BaseShAmt, DAG);
16773 // Special case in 32-bit mode, where i64 is expanded into high and low parts.
16774 if (!Subtarget->is64Bit() &&
16775 (VT == MVT::v2i64 || (Subtarget->hasInt256() && VT == MVT::v4i64) ||
16776 (Subtarget->hasAVX512() && VT == MVT::v8i64)) &&
16777 Amt.getOpcode() == ISD::BITCAST &&
16778 Amt.getOperand(0).getOpcode() == ISD::BUILD_VECTOR) {
16779 Amt = Amt.getOperand(0);
16780 unsigned Ratio = Amt.getSimpleValueType().getVectorNumElements() /
16781 VT.getVectorNumElements();
16782 std::vector<SDValue> Vals(Ratio);
16783 for (unsigned i = 0; i != Ratio; ++i)
16784 Vals[i] = Amt.getOperand(i);
16785 for (unsigned i = Ratio; i != Amt.getNumOperands(); i += Ratio) {
16786 for (unsigned j = 0; j != Ratio; ++j)
16787 if (Vals[j] != Amt.getOperand(i + j))
16790 switch (Op.getOpcode()) {
16792 llvm_unreachable("Unknown shift opcode!");
16794 return DAG.getNode(X86ISD::VSHL, dl, VT, R, Op.getOperand(1));
16796 return DAG.getNode(X86ISD::VSRL, dl, VT, R, Op.getOperand(1));
16798 return DAG.getNode(X86ISD::VSRA, dl, VT, R, Op.getOperand(1));
16805 static SDValue LowerShift(SDValue Op, const X86Subtarget* Subtarget,
16806 SelectionDAG &DAG) {
16807 MVT VT = Op.getSimpleValueType();
16809 SDValue R = Op.getOperand(0);
16810 SDValue Amt = Op.getOperand(1);
16813 assert(VT.isVector() && "Custom lowering only for vector shifts!");
16814 assert(Subtarget->hasSSE2() && "Only custom lower when we have SSE2!");
16816 V = LowerScalarImmediateShift(Op, DAG, Subtarget);
16820 V = LowerScalarVariableShift(Op, DAG, Subtarget);
16824 if (Subtarget->hasAVX512() && (VT == MVT::v16i32 || VT == MVT::v8i64))
16826 // AVX2 has VPSLLV/VPSRAV/VPSRLV.
16827 if (Subtarget->hasInt256()) {
16828 if (Op.getOpcode() == ISD::SRL &&
16829 (VT == MVT::v2i64 || VT == MVT::v4i32 ||
16830 VT == MVT::v4i64 || VT == MVT::v8i32))
16832 if (Op.getOpcode() == ISD::SHL &&
16833 (VT == MVT::v2i64 || VT == MVT::v4i32 ||
16834 VT == MVT::v4i64 || VT == MVT::v8i32))
16836 if (Op.getOpcode() == ISD::SRA && (VT == MVT::v4i32 || VT == MVT::v8i32))
16840 // If possible, lower this packed shift into a vector multiply instead of
16841 // expanding it into a sequence of scalar shifts.
16842 // Do this only if the vector shift count is a constant build_vector.
16843 if (Op.getOpcode() == ISD::SHL &&
16844 (VT == MVT::v8i16 || VT == MVT::v4i32 ||
16845 (Subtarget->hasInt256() && VT == MVT::v16i16)) &&
16846 ISD::isBuildVectorOfConstantSDNodes(Amt.getNode())) {
16847 SmallVector<SDValue, 8> Elts;
16848 EVT SVT = VT.getScalarType();
16849 unsigned SVTBits = SVT.getSizeInBits();
16850 const APInt &One = APInt(SVTBits, 1);
16851 unsigned NumElems = VT.getVectorNumElements();
16853 for (unsigned i=0; i !=NumElems; ++i) {
16854 SDValue Op = Amt->getOperand(i);
16855 if (Op->getOpcode() == ISD::UNDEF) {
16856 Elts.push_back(Op);
16860 ConstantSDNode *ND = cast<ConstantSDNode>(Op);
16861 const APInt &C = APInt(SVTBits, ND->getAPIntValue().getZExtValue());
16862 uint64_t ShAmt = C.getZExtValue();
16863 if (ShAmt >= SVTBits) {
16864 Elts.push_back(DAG.getUNDEF(SVT));
16867 Elts.push_back(DAG.getConstant(One.shl(ShAmt), SVT));
16869 SDValue BV = DAG.getNode(ISD::BUILD_VECTOR, dl, VT, Elts);
16870 return DAG.getNode(ISD::MUL, dl, VT, R, BV);
16873 // Lower SHL with variable shift amount.
16874 if (VT == MVT::v4i32 && Op->getOpcode() == ISD::SHL) {
16875 Op = DAG.getNode(ISD::SHL, dl, VT, Amt, DAG.getConstant(23, VT));
16877 Op = DAG.getNode(ISD::ADD, dl, VT, Op, DAG.getConstant(0x3f800000U, VT));
16878 Op = DAG.getNode(ISD::BITCAST, dl, MVT::v4f32, Op);
16879 Op = DAG.getNode(ISD::FP_TO_SINT, dl, VT, Op);
16880 return DAG.getNode(ISD::MUL, dl, VT, Op, R);
16883 // If possible, lower this shift as a sequence of two shifts by
16884 // constant plus a MOVSS/MOVSD instead of scalarizing it.
16886 // (v4i32 (srl A, (build_vector < X, Y, Y, Y>)))
16888 // Could be rewritten as:
16889 // (v4i32 (MOVSS (srl A, <Y,Y,Y,Y>), (srl A, <X,X,X,X>)))
16891 // The advantage is that the two shifts from the example would be
16892 // lowered as X86ISD::VSRLI nodes. This would be cheaper than scalarizing
16893 // the vector shift into four scalar shifts plus four pairs of vector
16895 if ((VT == MVT::v8i16 || VT == MVT::v4i32) &&
16896 ISD::isBuildVectorOfConstantSDNodes(Amt.getNode())) {
16897 unsigned TargetOpcode = X86ISD::MOVSS;
16898 bool CanBeSimplified;
16899 // The splat value for the first packed shift (the 'X' from the example).
16900 SDValue Amt1 = Amt->getOperand(0);
16901 // The splat value for the second packed shift (the 'Y' from the example).
16902 SDValue Amt2 = (VT == MVT::v4i32) ? Amt->getOperand(1) :
16903 Amt->getOperand(2);
16905 // See if it is possible to replace this node with a sequence of
16906 // two shifts followed by a MOVSS/MOVSD
16907 if (VT == MVT::v4i32) {
16908 // Check if it is legal to use a MOVSS.
16909 CanBeSimplified = Amt2 == Amt->getOperand(2) &&
16910 Amt2 == Amt->getOperand(3);
16911 if (!CanBeSimplified) {
16912 // Otherwise, check if we can still simplify this node using a MOVSD.
16913 CanBeSimplified = Amt1 == Amt->getOperand(1) &&
16914 Amt->getOperand(2) == Amt->getOperand(3);
16915 TargetOpcode = X86ISD::MOVSD;
16916 Amt2 = Amt->getOperand(2);
16919 // Do similar checks for the case where the machine value type
16921 CanBeSimplified = Amt1 == Amt->getOperand(1);
16922 for (unsigned i=3; i != 8 && CanBeSimplified; ++i)
16923 CanBeSimplified = Amt2 == Amt->getOperand(i);
16925 if (!CanBeSimplified) {
16926 TargetOpcode = X86ISD::MOVSD;
16927 CanBeSimplified = true;
16928 Amt2 = Amt->getOperand(4);
16929 for (unsigned i=0; i != 4 && CanBeSimplified; ++i)
16930 CanBeSimplified = Amt1 == Amt->getOperand(i);
16931 for (unsigned j=4; j != 8 && CanBeSimplified; ++j)
16932 CanBeSimplified = Amt2 == Amt->getOperand(j);
16936 if (CanBeSimplified && isa<ConstantSDNode>(Amt1) &&
16937 isa<ConstantSDNode>(Amt2)) {
16938 // Replace this node with two shifts followed by a MOVSS/MOVSD.
16939 EVT CastVT = MVT::v4i32;
16941 DAG.getConstant(cast<ConstantSDNode>(Amt1)->getAPIntValue(), VT);
16942 SDValue Shift1 = DAG.getNode(Op->getOpcode(), dl, VT, R, Splat1);
16944 DAG.getConstant(cast<ConstantSDNode>(Amt2)->getAPIntValue(), VT);
16945 SDValue Shift2 = DAG.getNode(Op->getOpcode(), dl, VT, R, Splat2);
16946 if (TargetOpcode == X86ISD::MOVSD)
16947 CastVT = MVT::v2i64;
16948 SDValue BitCast1 = DAG.getNode(ISD::BITCAST, dl, CastVT, Shift1);
16949 SDValue BitCast2 = DAG.getNode(ISD::BITCAST, dl, CastVT, Shift2);
16950 SDValue Result = getTargetShuffleNode(TargetOpcode, dl, CastVT, BitCast2,
16952 return DAG.getNode(ISD::BITCAST, dl, VT, Result);
16956 if (VT == MVT::v16i8 && Op->getOpcode() == ISD::SHL) {
16957 assert(Subtarget->hasSSE2() && "Need SSE2 for pslli/pcmpeq.");
16960 Op = DAG.getNode(ISD::SHL, dl, VT, Amt, DAG.getConstant(5, VT));
16961 Op = DAG.getNode(ISD::BITCAST, dl, VT, Op);
16963 // Turn 'a' into a mask suitable for VSELECT
16964 SDValue VSelM = DAG.getConstant(0x80, VT);
16965 SDValue OpVSel = DAG.getNode(ISD::AND, dl, VT, VSelM, Op);
16966 OpVSel = DAG.getNode(X86ISD::PCMPEQ, dl, VT, OpVSel, VSelM);
16968 SDValue CM1 = DAG.getConstant(0x0f, VT);
16969 SDValue CM2 = DAG.getConstant(0x3f, VT);
16971 // r = VSELECT(r, psllw(r & (char16)15, 4), a);
16972 SDValue M = DAG.getNode(ISD::AND, dl, VT, R, CM1);
16973 M = getTargetVShiftByConstNode(X86ISD::VSHLI, dl, MVT::v8i16, M, 4, DAG);
16974 M = DAG.getNode(ISD::BITCAST, dl, VT, M);
16975 R = DAG.getNode(ISD::VSELECT, dl, VT, OpVSel, M, R);
16978 Op = DAG.getNode(ISD::ADD, dl, VT, Op, Op);
16979 OpVSel = DAG.getNode(ISD::AND, dl, VT, VSelM, Op);
16980 OpVSel = DAG.getNode(X86ISD::PCMPEQ, dl, VT, OpVSel, VSelM);
16982 // r = VSELECT(r, psllw(r & (char16)63, 2), a);
16983 M = DAG.getNode(ISD::AND, dl, VT, R, CM2);
16984 M = getTargetVShiftByConstNode(X86ISD::VSHLI, dl, MVT::v8i16, M, 2, DAG);
16985 M = DAG.getNode(ISD::BITCAST, dl, VT, M);
16986 R = DAG.getNode(ISD::VSELECT, dl, VT, OpVSel, M, R);
16989 Op = DAG.getNode(ISD::ADD, dl, VT, Op, Op);
16990 OpVSel = DAG.getNode(ISD::AND, dl, VT, VSelM, Op);
16991 OpVSel = DAG.getNode(X86ISD::PCMPEQ, dl, VT, OpVSel, VSelM);
16993 // return VSELECT(r, r+r, a);
16994 R = DAG.getNode(ISD::VSELECT, dl, VT, OpVSel,
16995 DAG.getNode(ISD::ADD, dl, VT, R, R), R);
16999 // It's worth extending once and using the v8i32 shifts for 16-bit types, but
17000 // the extra overheads to get from v16i8 to v8i32 make the existing SSE
17001 // solution better.
17002 if (Subtarget->hasInt256() && VT == MVT::v8i16) {
17003 MVT NewVT = VT == MVT::v8i16 ? MVT::v8i32 : MVT::v16i16;
17005 Op.getOpcode() == ISD::SRA ? ISD::SIGN_EXTEND : ISD::ZERO_EXTEND;
17006 R = DAG.getNode(ExtOpc, dl, NewVT, R);
17007 Amt = DAG.getNode(ISD::ANY_EXTEND, dl, NewVT, Amt);
17008 return DAG.getNode(ISD::TRUNCATE, dl, VT,
17009 DAG.getNode(Op.getOpcode(), dl, NewVT, R, Amt));
17012 // Decompose 256-bit shifts into smaller 128-bit shifts.
17013 if (VT.is256BitVector()) {
17014 unsigned NumElems = VT.getVectorNumElements();
17015 MVT EltVT = VT.getVectorElementType();
17016 EVT NewVT = MVT::getVectorVT(EltVT, NumElems/2);
17018 // Extract the two vectors
17019 SDValue V1 = Extract128BitVector(R, 0, DAG, dl);
17020 SDValue V2 = Extract128BitVector(R, NumElems/2, DAG, dl);
17022 // Recreate the shift amount vectors
17023 SDValue Amt1, Amt2;
17024 if (Amt.getOpcode() == ISD::BUILD_VECTOR) {
17025 // Constant shift amount
17026 SmallVector<SDValue, 4> Amt1Csts;
17027 SmallVector<SDValue, 4> Amt2Csts;
17028 for (unsigned i = 0; i != NumElems/2; ++i)
17029 Amt1Csts.push_back(Amt->getOperand(i));
17030 for (unsigned i = NumElems/2; i != NumElems; ++i)
17031 Amt2Csts.push_back(Amt->getOperand(i));
17033 Amt1 = DAG.getNode(ISD::BUILD_VECTOR, dl, NewVT, Amt1Csts);
17034 Amt2 = DAG.getNode(ISD::BUILD_VECTOR, dl, NewVT, Amt2Csts);
17036 // Variable shift amount
17037 Amt1 = Extract128BitVector(Amt, 0, DAG, dl);
17038 Amt2 = Extract128BitVector(Amt, NumElems/2, DAG, dl);
17041 // Issue new vector shifts for the smaller types
17042 V1 = DAG.getNode(Op.getOpcode(), dl, NewVT, V1, Amt1);
17043 V2 = DAG.getNode(Op.getOpcode(), dl, NewVT, V2, Amt2);
17045 // Concatenate the result back
17046 return DAG.getNode(ISD::CONCAT_VECTORS, dl, VT, V1, V2);
17052 static SDValue LowerXALUO(SDValue Op, SelectionDAG &DAG) {
17053 // Lower the "add/sub/mul with overflow" instruction into a regular ins plus
17054 // a "setcc" instruction that checks the overflow flag. The "brcond" lowering
17055 // looks for this combo and may remove the "setcc" instruction if the "setcc"
17056 // has only one use.
17057 SDNode *N = Op.getNode();
17058 SDValue LHS = N->getOperand(0);
17059 SDValue RHS = N->getOperand(1);
17060 unsigned BaseOp = 0;
17063 switch (Op.getOpcode()) {
17064 default: llvm_unreachable("Unknown ovf instruction!");
17066 // A subtract of one will be selected as a INC. Note that INC doesn't
17067 // set CF, so we can't do this for UADDO.
17068 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(RHS))
17070 BaseOp = X86ISD::INC;
17071 Cond = X86::COND_O;
17074 BaseOp = X86ISD::ADD;
17075 Cond = X86::COND_O;
17078 BaseOp = X86ISD::ADD;
17079 Cond = X86::COND_B;
17082 // A subtract of one will be selected as a DEC. Note that DEC doesn't
17083 // set CF, so we can't do this for USUBO.
17084 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(RHS))
17086 BaseOp = X86ISD::DEC;
17087 Cond = X86::COND_O;
17090 BaseOp = X86ISD::SUB;
17091 Cond = X86::COND_O;
17094 BaseOp = X86ISD::SUB;
17095 Cond = X86::COND_B;
17098 BaseOp = X86ISD::SMUL;
17099 Cond = X86::COND_O;
17101 case ISD::UMULO: { // i64, i8 = umulo lhs, rhs --> i64, i64, i32 umul lhs,rhs
17102 SDVTList VTs = DAG.getVTList(N->getValueType(0), N->getValueType(0),
17104 SDValue Sum = DAG.getNode(X86ISD::UMUL, DL, VTs, LHS, RHS);
17107 DAG.getNode(X86ISD::SETCC, DL, MVT::i8,
17108 DAG.getConstant(X86::COND_O, MVT::i32),
17109 SDValue(Sum.getNode(), 2));
17111 return DAG.getNode(ISD::MERGE_VALUES, DL, N->getVTList(), Sum, SetCC);
17115 // Also sets EFLAGS.
17116 SDVTList VTs = DAG.getVTList(N->getValueType(0), MVT::i32);
17117 SDValue Sum = DAG.getNode(BaseOp, DL, VTs, LHS, RHS);
17120 DAG.getNode(X86ISD::SETCC, DL, N->getValueType(1),
17121 DAG.getConstant(Cond, MVT::i32),
17122 SDValue(Sum.getNode(), 1));
17124 return DAG.getNode(ISD::MERGE_VALUES, DL, N->getVTList(), Sum, SetCC);
17127 // Sign extension of the low part of vector elements. This may be used either
17128 // when sign extend instructions are not available or if the vector element
17129 // sizes already match the sign-extended size. If the vector elements are in
17130 // their pre-extended size and sign extend instructions are available, that will
17131 // be handled by LowerSIGN_EXTEND.
17132 SDValue X86TargetLowering::LowerSIGN_EXTEND_INREG(SDValue Op,
17133 SelectionDAG &DAG) const {
17135 EVT ExtraVT = cast<VTSDNode>(Op.getOperand(1))->getVT();
17136 MVT VT = Op.getSimpleValueType();
17138 if (!Subtarget->hasSSE2() || !VT.isVector())
17141 unsigned BitsDiff = VT.getScalarType().getSizeInBits() -
17142 ExtraVT.getScalarType().getSizeInBits();
17144 switch (VT.SimpleTy) {
17145 default: return SDValue();
17148 if (!Subtarget->hasFp256())
17150 if (!Subtarget->hasInt256()) {
17151 // needs to be split
17152 unsigned NumElems = VT.getVectorNumElements();
17154 // Extract the LHS vectors
17155 SDValue LHS = Op.getOperand(0);
17156 SDValue LHS1 = Extract128BitVector(LHS, 0, DAG, dl);
17157 SDValue LHS2 = Extract128BitVector(LHS, NumElems/2, DAG, dl);
17159 MVT EltVT = VT.getVectorElementType();
17160 EVT NewVT = MVT::getVectorVT(EltVT, NumElems/2);
17162 EVT ExtraEltVT = ExtraVT.getVectorElementType();
17163 unsigned ExtraNumElems = ExtraVT.getVectorNumElements();
17164 ExtraVT = EVT::getVectorVT(*DAG.getContext(), ExtraEltVT,
17166 SDValue Extra = DAG.getValueType(ExtraVT);
17168 LHS1 = DAG.getNode(Op.getOpcode(), dl, NewVT, LHS1, Extra);
17169 LHS2 = DAG.getNode(Op.getOpcode(), dl, NewVT, LHS2, Extra);
17171 return DAG.getNode(ISD::CONCAT_VECTORS, dl, VT, LHS1, LHS2);
17176 SDValue Op0 = Op.getOperand(0);
17178 // This is a sign extension of some low part of vector elements without
17179 // changing the size of the vector elements themselves:
17180 // Shift-Left + Shift-Right-Algebraic.
17181 SDValue Shl = getTargetVShiftByConstNode(X86ISD::VSHLI, dl, VT, Op0,
17183 return getTargetVShiftByConstNode(X86ISD::VSRAI, dl, VT, Shl, BitsDiff,
17189 /// Returns true if the operand type is exactly twice the native width, and
17190 /// the corresponding cmpxchg8b or cmpxchg16b instruction is available.
17191 /// Used to know whether to use cmpxchg8/16b when expanding atomic operations
17192 /// (otherwise we leave them alone to become __sync_fetch_and_... calls).
17193 bool X86TargetLowering::needsCmpXchgNb(const Type *MemType) const {
17194 const X86Subtarget &Subtarget =
17195 getTargetMachine().getSubtarget<X86Subtarget>();
17196 unsigned OpWidth = MemType->getPrimitiveSizeInBits();
17199 return !Subtarget.is64Bit(); // FIXME this should be Subtarget.hasCmpxchg8b
17200 else if (OpWidth == 128)
17201 return Subtarget.hasCmpxchg16b();
17206 bool X86TargetLowering::shouldExpandAtomicStoreInIR(StoreInst *SI) const {
17207 return needsCmpXchgNb(SI->getValueOperand()->getType());
17210 bool X86TargetLowering::shouldExpandAtomicLoadInIR(LoadInst *SI) const {
17211 return false; // FIXME, currently these are expanded separately in this file.
17214 bool X86TargetLowering::shouldExpandAtomicRMWInIR(AtomicRMWInst *AI) const {
17215 const X86Subtarget &Subtarget =
17216 getTargetMachine().getSubtarget<X86Subtarget>();
17217 unsigned NativeWidth = Subtarget.is64Bit() ? 64 : 32;
17218 const Type *MemType = AI->getType();
17220 // If the operand is too big, we must see if cmpxchg8/16b is available
17221 // and default to library calls otherwise.
17222 if (MemType->getPrimitiveSizeInBits() > NativeWidth)
17223 return needsCmpXchgNb(MemType);
17225 AtomicRMWInst::BinOp Op = AI->getOperation();
17228 llvm_unreachable("Unknown atomic operation");
17229 case AtomicRMWInst::Xchg:
17230 case AtomicRMWInst::Add:
17231 case AtomicRMWInst::Sub:
17232 // It's better to use xadd, xsub or xchg for these in all cases.
17234 case AtomicRMWInst::Or:
17235 case AtomicRMWInst::And:
17236 case AtomicRMWInst::Xor:
17237 // If the atomicrmw's result isn't actually used, we can just add a "lock"
17238 // prefix to a normal instruction for these operations.
17239 return !AI->use_empty();
17240 case AtomicRMWInst::Nand:
17241 case AtomicRMWInst::Max:
17242 case AtomicRMWInst::Min:
17243 case AtomicRMWInst::UMax:
17244 case AtomicRMWInst::UMin:
17245 // These always require a non-trivial set of data operations on x86. We must
17246 // use a cmpxchg loop.
17251 static SDValue LowerATOMIC_FENCE(SDValue Op, const X86Subtarget *Subtarget,
17252 SelectionDAG &DAG) {
17254 AtomicOrdering FenceOrdering = static_cast<AtomicOrdering>(
17255 cast<ConstantSDNode>(Op.getOperand(1))->getZExtValue());
17256 SynchronizationScope FenceScope = static_cast<SynchronizationScope>(
17257 cast<ConstantSDNode>(Op.getOperand(2))->getZExtValue());
17259 // The only fence that needs an instruction is a sequentially-consistent
17260 // cross-thread fence.
17261 if (FenceOrdering == SequentiallyConsistent && FenceScope == CrossThread) {
17262 // Use mfence if we have SSE2 or we're on x86-64 (even if we asked for
17263 // no-sse2). There isn't any reason to disable it if the target processor
17265 if (Subtarget->hasSSE2() || Subtarget->is64Bit())
17266 return DAG.getNode(X86ISD::MFENCE, dl, MVT::Other, Op.getOperand(0));
17268 SDValue Chain = Op.getOperand(0);
17269 SDValue Zero = DAG.getConstant(0, MVT::i32);
17271 DAG.getRegister(X86::ESP, MVT::i32), // Base
17272 DAG.getTargetConstant(1, MVT::i8), // Scale
17273 DAG.getRegister(0, MVT::i32), // Index
17274 DAG.getTargetConstant(0, MVT::i32), // Disp
17275 DAG.getRegister(0, MVT::i32), // Segment.
17279 SDNode *Res = DAG.getMachineNode(X86::OR32mrLocked, dl, MVT::Other, Ops);
17280 return SDValue(Res, 0);
17283 // MEMBARRIER is a compiler barrier; it codegens to a no-op.
17284 return DAG.getNode(X86ISD::MEMBARRIER, dl, MVT::Other, Op.getOperand(0));
17287 static SDValue LowerCMP_SWAP(SDValue Op, const X86Subtarget *Subtarget,
17288 SelectionDAG &DAG) {
17289 MVT T = Op.getSimpleValueType();
17293 switch(T.SimpleTy) {
17294 default: llvm_unreachable("Invalid value type!");
17295 case MVT::i8: Reg = X86::AL; size = 1; break;
17296 case MVT::i16: Reg = X86::AX; size = 2; break;
17297 case MVT::i32: Reg = X86::EAX; size = 4; break;
17299 assert(Subtarget->is64Bit() && "Node not type legal!");
17300 Reg = X86::RAX; size = 8;
17303 SDValue cpIn = DAG.getCopyToReg(Op.getOperand(0), DL, Reg,
17304 Op.getOperand(2), SDValue());
17305 SDValue Ops[] = { cpIn.getValue(0),
17308 DAG.getTargetConstant(size, MVT::i8),
17309 cpIn.getValue(1) };
17310 SDVTList Tys = DAG.getVTList(MVT::Other, MVT::Glue);
17311 MachineMemOperand *MMO = cast<AtomicSDNode>(Op)->getMemOperand();
17312 SDValue Result = DAG.getMemIntrinsicNode(X86ISD::LCMPXCHG_DAG, DL, Tys,
17316 DAG.getCopyFromReg(Result.getValue(0), DL, Reg, T, Result.getValue(1));
17317 SDValue EFLAGS = DAG.getCopyFromReg(cpOut.getValue(1), DL, X86::EFLAGS,
17318 MVT::i32, cpOut.getValue(2));
17319 SDValue Success = DAG.getNode(X86ISD::SETCC, DL, Op->getValueType(1),
17320 DAG.getConstant(X86::COND_E, MVT::i8), EFLAGS);
17322 DAG.ReplaceAllUsesOfValueWith(Op.getValue(0), cpOut);
17323 DAG.ReplaceAllUsesOfValueWith(Op.getValue(1), Success);
17324 DAG.ReplaceAllUsesOfValueWith(Op.getValue(2), EFLAGS.getValue(1));
17328 static SDValue LowerBITCAST(SDValue Op, const X86Subtarget *Subtarget,
17329 SelectionDAG &DAG) {
17330 MVT SrcVT = Op.getOperand(0).getSimpleValueType();
17331 MVT DstVT = Op.getSimpleValueType();
17333 if (SrcVT == MVT::v2i32 || SrcVT == MVT::v4i16 || SrcVT == MVT::v8i8) {
17334 assert(Subtarget->hasSSE2() && "Requires at least SSE2!");
17335 if (DstVT != MVT::f64)
17336 // This conversion needs to be expanded.
17339 SDValue InVec = Op->getOperand(0);
17341 unsigned NumElts = SrcVT.getVectorNumElements();
17342 EVT SVT = SrcVT.getVectorElementType();
17344 // Widen the vector in input in the case of MVT::v2i32.
17345 // Example: from MVT::v2i32 to MVT::v4i32.
17346 SmallVector<SDValue, 16> Elts;
17347 for (unsigned i = 0, e = NumElts; i != e; ++i)
17348 Elts.push_back(DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, SVT, InVec,
17349 DAG.getIntPtrConstant(i)));
17351 // Explicitly mark the extra elements as Undef.
17352 SDValue Undef = DAG.getUNDEF(SVT);
17353 for (unsigned i = NumElts, e = NumElts * 2; i != e; ++i)
17354 Elts.push_back(Undef);
17356 EVT NewVT = EVT::getVectorVT(*DAG.getContext(), SVT, NumElts * 2);
17357 SDValue BV = DAG.getNode(ISD::BUILD_VECTOR, dl, NewVT, Elts);
17358 SDValue ToV2F64 = DAG.getNode(ISD::BITCAST, dl, MVT::v2f64, BV);
17359 return DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::f64, ToV2F64,
17360 DAG.getIntPtrConstant(0));
17363 assert(Subtarget->is64Bit() && !Subtarget->hasSSE2() &&
17364 Subtarget->hasMMX() && "Unexpected custom BITCAST");
17365 assert((DstVT == MVT::i64 ||
17366 (DstVT.isVector() && DstVT.getSizeInBits()==64)) &&
17367 "Unexpected custom BITCAST");
17368 // i64 <=> MMX conversions are Legal.
17369 if (SrcVT==MVT::i64 && DstVT.isVector())
17371 if (DstVT==MVT::i64 && SrcVT.isVector())
17373 // MMX <=> MMX conversions are Legal.
17374 if (SrcVT.isVector() && DstVT.isVector())
17376 // All other conversions need to be expanded.
17380 static SDValue LowerLOAD_SUB(SDValue Op, SelectionDAG &DAG) {
17381 SDNode *Node = Op.getNode();
17383 EVT T = Node->getValueType(0);
17384 SDValue negOp = DAG.getNode(ISD::SUB, dl, T,
17385 DAG.getConstant(0, T), Node->getOperand(2));
17386 return DAG.getAtomic(ISD::ATOMIC_LOAD_ADD, dl,
17387 cast<AtomicSDNode>(Node)->getMemoryVT(),
17388 Node->getOperand(0),
17389 Node->getOperand(1), negOp,
17390 cast<AtomicSDNode>(Node)->getMemOperand(),
17391 cast<AtomicSDNode>(Node)->getOrdering(),
17392 cast<AtomicSDNode>(Node)->getSynchScope());
17395 static SDValue LowerATOMIC_STORE(SDValue Op, SelectionDAG &DAG) {
17396 SDNode *Node = Op.getNode();
17398 EVT VT = cast<AtomicSDNode>(Node)->getMemoryVT();
17400 // Convert seq_cst store -> xchg
17401 // Convert wide store -> swap (-> cmpxchg8b/cmpxchg16b)
17402 // FIXME: On 32-bit, store -> fist or movq would be more efficient
17403 // (The only way to get a 16-byte store is cmpxchg16b)
17404 // FIXME: 16-byte ATOMIC_SWAP isn't actually hooked up at the moment.
17405 if (cast<AtomicSDNode>(Node)->getOrdering() == SequentiallyConsistent ||
17406 !DAG.getTargetLoweringInfo().isTypeLegal(VT)) {
17407 SDValue Swap = DAG.getAtomic(ISD::ATOMIC_SWAP, dl,
17408 cast<AtomicSDNode>(Node)->getMemoryVT(),
17409 Node->getOperand(0),
17410 Node->getOperand(1), Node->getOperand(2),
17411 cast<AtomicSDNode>(Node)->getMemOperand(),
17412 cast<AtomicSDNode>(Node)->getOrdering(),
17413 cast<AtomicSDNode>(Node)->getSynchScope());
17414 return Swap.getValue(1);
17416 // Other atomic stores have a simple pattern.
17420 static SDValue LowerADDC_ADDE_SUBC_SUBE(SDValue Op, SelectionDAG &DAG) {
17421 EVT VT = Op.getNode()->getSimpleValueType(0);
17423 // Let legalize expand this if it isn't a legal type yet.
17424 if (!DAG.getTargetLoweringInfo().isTypeLegal(VT))
17427 SDVTList VTs = DAG.getVTList(VT, MVT::i32);
17430 bool ExtraOp = false;
17431 switch (Op.getOpcode()) {
17432 default: llvm_unreachable("Invalid code");
17433 case ISD::ADDC: Opc = X86ISD::ADD; break;
17434 case ISD::ADDE: Opc = X86ISD::ADC; ExtraOp = true; break;
17435 case ISD::SUBC: Opc = X86ISD::SUB; break;
17436 case ISD::SUBE: Opc = X86ISD::SBB; ExtraOp = true; break;
17440 return DAG.getNode(Opc, SDLoc(Op), VTs, Op.getOperand(0),
17442 return DAG.getNode(Opc, SDLoc(Op), VTs, Op.getOperand(0),
17443 Op.getOperand(1), Op.getOperand(2));
17446 static SDValue LowerFSINCOS(SDValue Op, const X86Subtarget *Subtarget,
17447 SelectionDAG &DAG) {
17448 assert(Subtarget->isTargetDarwin() && Subtarget->is64Bit());
17450 // For MacOSX, we want to call an alternative entry point: __sincos_stret,
17451 // which returns the values as { float, float } (in XMM0) or
17452 // { double, double } (which is returned in XMM0, XMM1).
17454 SDValue Arg = Op.getOperand(0);
17455 EVT ArgVT = Arg.getValueType();
17456 Type *ArgTy = ArgVT.getTypeForEVT(*DAG.getContext());
17458 TargetLowering::ArgListTy Args;
17459 TargetLowering::ArgListEntry Entry;
17463 Entry.isSExt = false;
17464 Entry.isZExt = false;
17465 Args.push_back(Entry);
17467 bool isF64 = ArgVT == MVT::f64;
17468 // Only optimize x86_64 for now. i386 is a bit messy. For f32,
17469 // the small struct {f32, f32} is returned in (eax, edx). For f64,
17470 // the results are returned via SRet in memory.
17471 const char *LibcallName = isF64 ? "__sincos_stret" : "__sincosf_stret";
17472 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
17473 SDValue Callee = DAG.getExternalSymbol(LibcallName, TLI.getPointerTy());
17475 Type *RetTy = isF64
17476 ? (Type*)StructType::get(ArgTy, ArgTy, NULL)
17477 : (Type*)VectorType::get(ArgTy, 4);
17479 TargetLowering::CallLoweringInfo CLI(DAG);
17480 CLI.setDebugLoc(dl).setChain(DAG.getEntryNode())
17481 .setCallee(CallingConv::C, RetTy, Callee, std::move(Args), 0);
17483 std::pair<SDValue, SDValue> CallResult = TLI.LowerCallTo(CLI);
17486 // Returned in xmm0 and xmm1.
17487 return CallResult.first;
17489 // Returned in bits 0:31 and 32:64 xmm0.
17490 SDValue SinVal = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, ArgVT,
17491 CallResult.first, DAG.getIntPtrConstant(0));
17492 SDValue CosVal = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, ArgVT,
17493 CallResult.first, DAG.getIntPtrConstant(1));
17494 SDVTList Tys = DAG.getVTList(ArgVT, ArgVT);
17495 return DAG.getNode(ISD::MERGE_VALUES, dl, Tys, SinVal, CosVal);
17498 /// LowerOperation - Provide custom lowering hooks for some operations.
17500 SDValue X86TargetLowering::LowerOperation(SDValue Op, SelectionDAG &DAG) const {
17501 switch (Op.getOpcode()) {
17502 default: llvm_unreachable("Should not custom lower this!");
17503 case ISD::SIGN_EXTEND_INREG: return LowerSIGN_EXTEND_INREG(Op,DAG);
17504 case ISD::ATOMIC_FENCE: return LowerATOMIC_FENCE(Op, Subtarget, DAG);
17505 case ISD::ATOMIC_CMP_SWAP_WITH_SUCCESS:
17506 return LowerCMP_SWAP(Op, Subtarget, DAG);
17507 case ISD::ATOMIC_LOAD_SUB: return LowerLOAD_SUB(Op,DAG);
17508 case ISD::ATOMIC_STORE: return LowerATOMIC_STORE(Op,DAG);
17509 case ISD::BUILD_VECTOR: return LowerBUILD_VECTOR(Op, DAG);
17510 case ISD::CONCAT_VECTORS: return LowerCONCAT_VECTORS(Op, DAG);
17511 case ISD::VECTOR_SHUFFLE: return LowerVECTOR_SHUFFLE(Op, DAG);
17512 case ISD::VSELECT: return LowerVSELECT(Op, DAG);
17513 case ISD::EXTRACT_VECTOR_ELT: return LowerEXTRACT_VECTOR_ELT(Op, DAG);
17514 case ISD::INSERT_VECTOR_ELT: return LowerINSERT_VECTOR_ELT(Op, DAG);
17515 case ISD::EXTRACT_SUBVECTOR: return LowerEXTRACT_SUBVECTOR(Op,Subtarget,DAG);
17516 case ISD::INSERT_SUBVECTOR: return LowerINSERT_SUBVECTOR(Op, Subtarget,DAG);
17517 case ISD::SCALAR_TO_VECTOR: return LowerSCALAR_TO_VECTOR(Op, DAG);
17518 case ISD::ConstantPool: return LowerConstantPool(Op, DAG);
17519 case ISD::GlobalAddress: return LowerGlobalAddress(Op, DAG);
17520 case ISD::GlobalTLSAddress: return LowerGlobalTLSAddress(Op, DAG);
17521 case ISD::ExternalSymbol: return LowerExternalSymbol(Op, DAG);
17522 case ISD::BlockAddress: return LowerBlockAddress(Op, DAG);
17523 case ISD::SHL_PARTS:
17524 case ISD::SRA_PARTS:
17525 case ISD::SRL_PARTS: return LowerShiftParts(Op, DAG);
17526 case ISD::SINT_TO_FP: return LowerSINT_TO_FP(Op, DAG);
17527 case ISD::UINT_TO_FP: return LowerUINT_TO_FP(Op, DAG);
17528 case ISD::TRUNCATE: return LowerTRUNCATE(Op, DAG);
17529 case ISD::ZERO_EXTEND: return LowerZERO_EXTEND(Op, Subtarget, DAG);
17530 case ISD::SIGN_EXTEND: return LowerSIGN_EXTEND(Op, Subtarget, DAG);
17531 case ISD::ANY_EXTEND: return LowerANY_EXTEND(Op, Subtarget, DAG);
17532 case ISD::FP_TO_SINT: return LowerFP_TO_SINT(Op, DAG);
17533 case ISD::FP_TO_UINT: return LowerFP_TO_UINT(Op, DAG);
17534 case ISD::FP_EXTEND: return LowerFP_EXTEND(Op, DAG);
17535 case ISD::LOAD: return LowerExtendedLoad(Op, Subtarget, DAG);
17537 case ISD::FNEG: return LowerFABSorFNEG(Op, DAG);
17538 case ISD::FCOPYSIGN: return LowerFCOPYSIGN(Op, DAG);
17539 case ISD::FGETSIGN: return LowerFGETSIGN(Op, DAG);
17540 case ISD::SETCC: return LowerSETCC(Op, DAG);
17541 case ISD::SELECT: return LowerSELECT(Op, DAG);
17542 case ISD::BRCOND: return LowerBRCOND(Op, DAG);
17543 case ISD::JumpTable: return LowerJumpTable(Op, DAG);
17544 case ISD::VASTART: return LowerVASTART(Op, DAG);
17545 case ISD::VAARG: return LowerVAARG(Op, DAG);
17546 case ISD::VACOPY: return LowerVACOPY(Op, Subtarget, DAG);
17547 case ISD::INTRINSIC_WO_CHAIN: return LowerINTRINSIC_WO_CHAIN(Op, DAG);
17548 case ISD::INTRINSIC_VOID:
17549 case ISD::INTRINSIC_W_CHAIN: return LowerINTRINSIC_W_CHAIN(Op, Subtarget, DAG);
17550 case ISD::RETURNADDR: return LowerRETURNADDR(Op, DAG);
17551 case ISD::FRAMEADDR: return LowerFRAMEADDR(Op, DAG);
17552 case ISD::FRAME_TO_ARGS_OFFSET:
17553 return LowerFRAME_TO_ARGS_OFFSET(Op, DAG);
17554 case ISD::DYNAMIC_STACKALLOC: return LowerDYNAMIC_STACKALLOC(Op, DAG);
17555 case ISD::EH_RETURN: return LowerEH_RETURN(Op, DAG);
17556 case ISD::EH_SJLJ_SETJMP: return lowerEH_SJLJ_SETJMP(Op, DAG);
17557 case ISD::EH_SJLJ_LONGJMP: return lowerEH_SJLJ_LONGJMP(Op, DAG);
17558 case ISD::INIT_TRAMPOLINE: return LowerINIT_TRAMPOLINE(Op, DAG);
17559 case ISD::ADJUST_TRAMPOLINE: return LowerADJUST_TRAMPOLINE(Op, DAG);
17560 case ISD::FLT_ROUNDS_: return LowerFLT_ROUNDS_(Op, DAG);
17561 case ISD::CTLZ: return LowerCTLZ(Op, DAG);
17562 case ISD::CTLZ_ZERO_UNDEF: return LowerCTLZ_ZERO_UNDEF(Op, DAG);
17563 case ISD::CTTZ: return LowerCTTZ(Op, DAG);
17564 case ISD::MUL: return LowerMUL(Op, Subtarget, DAG);
17565 case ISD::UMUL_LOHI:
17566 case ISD::SMUL_LOHI: return LowerMUL_LOHI(Op, Subtarget, DAG);
17569 case ISD::SHL: return LowerShift(Op, Subtarget, DAG);
17575 case ISD::UMULO: return LowerXALUO(Op, DAG);
17576 case ISD::READCYCLECOUNTER: return LowerREADCYCLECOUNTER(Op, Subtarget,DAG);
17577 case ISD::BITCAST: return LowerBITCAST(Op, Subtarget, DAG);
17581 case ISD::SUBE: return LowerADDC_ADDE_SUBC_SUBE(Op, DAG);
17582 case ISD::ADD: return LowerADD(Op, DAG);
17583 case ISD::SUB: return LowerSUB(Op, DAG);
17584 case ISD::FSINCOS: return LowerFSINCOS(Op, Subtarget, DAG);
17588 static void ReplaceATOMIC_LOAD(SDNode *Node,
17589 SmallVectorImpl<SDValue> &Results,
17590 SelectionDAG &DAG) {
17592 EVT VT = cast<AtomicSDNode>(Node)->getMemoryVT();
17594 // Convert wide load -> cmpxchg8b/cmpxchg16b
17595 // FIXME: On 32-bit, load -> fild or movq would be more efficient
17596 // (The only way to get a 16-byte load is cmpxchg16b)
17597 // FIXME: 16-byte ATOMIC_CMP_SWAP isn't actually hooked up at the moment.
17598 SDValue Zero = DAG.getConstant(0, VT);
17599 SDVTList VTs = DAG.getVTList(VT, MVT::i1, MVT::Other);
17601 DAG.getAtomicCmpSwap(ISD::ATOMIC_CMP_SWAP_WITH_SUCCESS, dl, VT, VTs,
17602 Node->getOperand(0), Node->getOperand(1), Zero, Zero,
17603 cast<AtomicSDNode>(Node)->getMemOperand(),
17604 cast<AtomicSDNode>(Node)->getOrdering(),
17605 cast<AtomicSDNode>(Node)->getOrdering(),
17606 cast<AtomicSDNode>(Node)->getSynchScope());
17607 Results.push_back(Swap.getValue(0));
17608 Results.push_back(Swap.getValue(2));
17611 /// ReplaceNodeResults - Replace a node with an illegal result type
17612 /// with a new node built out of custom code.
17613 void X86TargetLowering::ReplaceNodeResults(SDNode *N,
17614 SmallVectorImpl<SDValue>&Results,
17615 SelectionDAG &DAG) const {
17617 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
17618 switch (N->getOpcode()) {
17620 llvm_unreachable("Do not know how to custom type legalize this operation!");
17621 case ISD::SIGN_EXTEND_INREG:
17626 // We don't want to expand or promote these.
17633 case ISD::UDIVREM: {
17634 SDValue V = LowerWin64_i128OP(SDValue(N,0), DAG);
17635 Results.push_back(V);
17638 case ISD::FP_TO_SINT:
17639 case ISD::FP_TO_UINT: {
17640 bool IsSigned = N->getOpcode() == ISD::FP_TO_SINT;
17642 if (!IsSigned && !isIntegerTypeFTOL(SDValue(N, 0).getValueType()))
17645 std::pair<SDValue,SDValue> Vals =
17646 FP_TO_INTHelper(SDValue(N, 0), DAG, IsSigned, /*IsReplace=*/ true);
17647 SDValue FIST = Vals.first, StackSlot = Vals.second;
17648 if (FIST.getNode()) {
17649 EVT VT = N->getValueType(0);
17650 // Return a load from the stack slot.
17651 if (StackSlot.getNode())
17652 Results.push_back(DAG.getLoad(VT, dl, FIST, StackSlot,
17653 MachinePointerInfo(),
17654 false, false, false, 0));
17656 Results.push_back(FIST);
17660 case ISD::UINT_TO_FP: {
17661 assert(Subtarget->hasSSE2() && "Requires at least SSE2!");
17662 if (N->getOperand(0).getValueType() != MVT::v2i32 ||
17663 N->getValueType(0) != MVT::v2f32)
17665 SDValue ZExtIn = DAG.getNode(ISD::ZERO_EXTEND, dl, MVT::v2i64,
17667 SDValue Bias = DAG.getConstantFP(BitsToDouble(0x4330000000000000ULL),
17669 SDValue VBias = DAG.getNode(ISD::BUILD_VECTOR, dl, MVT::v2f64, Bias, Bias);
17670 SDValue Or = DAG.getNode(ISD::OR, dl, MVT::v2i64, ZExtIn,
17671 DAG.getNode(ISD::BITCAST, dl, MVT::v2i64, VBias));
17672 Or = DAG.getNode(ISD::BITCAST, dl, MVT::v2f64, Or);
17673 SDValue Sub = DAG.getNode(ISD::FSUB, dl, MVT::v2f64, Or, VBias);
17674 Results.push_back(DAG.getNode(X86ISD::VFPROUND, dl, MVT::v4f32, Sub));
17677 case ISD::FP_ROUND: {
17678 if (!TLI.isTypeLegal(N->getOperand(0).getValueType()))
17680 SDValue V = DAG.getNode(X86ISD::VFPROUND, dl, MVT::v4f32, N->getOperand(0));
17681 Results.push_back(V);
17684 case ISD::INTRINSIC_W_CHAIN: {
17685 unsigned IntNo = cast<ConstantSDNode>(N->getOperand(1))->getZExtValue();
17687 default : llvm_unreachable("Do not know how to custom type "
17688 "legalize this intrinsic operation!");
17689 case Intrinsic::x86_rdtsc:
17690 return getReadTimeStampCounter(N, dl, X86ISD::RDTSC_DAG, DAG, Subtarget,
17692 case Intrinsic::x86_rdtscp:
17693 return getReadTimeStampCounter(N, dl, X86ISD::RDTSCP_DAG, DAG, Subtarget,
17695 case Intrinsic::x86_rdpmc:
17696 return getReadPerformanceCounter(N, dl, DAG, Subtarget, Results);
17699 case ISD::READCYCLECOUNTER: {
17700 return getReadTimeStampCounter(N, dl, X86ISD::RDTSC_DAG, DAG, Subtarget,
17703 case ISD::ATOMIC_CMP_SWAP_WITH_SUCCESS: {
17704 EVT T = N->getValueType(0);
17705 assert((T == MVT::i64 || T == MVT::i128) && "can only expand cmpxchg pair");
17706 bool Regs64bit = T == MVT::i128;
17707 EVT HalfT = Regs64bit ? MVT::i64 : MVT::i32;
17708 SDValue cpInL, cpInH;
17709 cpInL = DAG.getNode(ISD::EXTRACT_ELEMENT, dl, HalfT, N->getOperand(2),
17710 DAG.getConstant(0, HalfT));
17711 cpInH = DAG.getNode(ISD::EXTRACT_ELEMENT, dl, HalfT, N->getOperand(2),
17712 DAG.getConstant(1, HalfT));
17713 cpInL = DAG.getCopyToReg(N->getOperand(0), dl,
17714 Regs64bit ? X86::RAX : X86::EAX,
17716 cpInH = DAG.getCopyToReg(cpInL.getValue(0), dl,
17717 Regs64bit ? X86::RDX : X86::EDX,
17718 cpInH, cpInL.getValue(1));
17719 SDValue swapInL, swapInH;
17720 swapInL = DAG.getNode(ISD::EXTRACT_ELEMENT, dl, HalfT, N->getOperand(3),
17721 DAG.getConstant(0, HalfT));
17722 swapInH = DAG.getNode(ISD::EXTRACT_ELEMENT, dl, HalfT, N->getOperand(3),
17723 DAG.getConstant(1, HalfT));
17724 swapInL = DAG.getCopyToReg(cpInH.getValue(0), dl,
17725 Regs64bit ? X86::RBX : X86::EBX,
17726 swapInL, cpInH.getValue(1));
17727 swapInH = DAG.getCopyToReg(swapInL.getValue(0), dl,
17728 Regs64bit ? X86::RCX : X86::ECX,
17729 swapInH, swapInL.getValue(1));
17730 SDValue Ops[] = { swapInH.getValue(0),
17732 swapInH.getValue(1) };
17733 SDVTList Tys = DAG.getVTList(MVT::Other, MVT::Glue);
17734 MachineMemOperand *MMO = cast<AtomicSDNode>(N)->getMemOperand();
17735 unsigned Opcode = Regs64bit ? X86ISD::LCMPXCHG16_DAG :
17736 X86ISD::LCMPXCHG8_DAG;
17737 SDValue Result = DAG.getMemIntrinsicNode(Opcode, dl, Tys, Ops, T, MMO);
17738 SDValue cpOutL = DAG.getCopyFromReg(Result.getValue(0), dl,
17739 Regs64bit ? X86::RAX : X86::EAX,
17740 HalfT, Result.getValue(1));
17741 SDValue cpOutH = DAG.getCopyFromReg(cpOutL.getValue(1), dl,
17742 Regs64bit ? X86::RDX : X86::EDX,
17743 HalfT, cpOutL.getValue(2));
17744 SDValue OpsF[] = { cpOutL.getValue(0), cpOutH.getValue(0)};
17746 SDValue EFLAGS = DAG.getCopyFromReg(cpOutH.getValue(1), dl, X86::EFLAGS,
17747 MVT::i32, cpOutH.getValue(2));
17749 DAG.getNode(X86ISD::SETCC, dl, MVT::i8,
17750 DAG.getConstant(X86::COND_E, MVT::i8), EFLAGS);
17751 Success = DAG.getZExtOrTrunc(Success, dl, N->getValueType(1));
17753 Results.push_back(DAG.getNode(ISD::BUILD_PAIR, dl, T, OpsF));
17754 Results.push_back(Success);
17755 Results.push_back(EFLAGS.getValue(1));
17758 case ISD::ATOMIC_SWAP:
17759 case ISD::ATOMIC_LOAD_ADD:
17760 case ISD::ATOMIC_LOAD_SUB:
17761 case ISD::ATOMIC_LOAD_AND:
17762 case ISD::ATOMIC_LOAD_OR:
17763 case ISD::ATOMIC_LOAD_XOR:
17764 case ISD::ATOMIC_LOAD_NAND:
17765 case ISD::ATOMIC_LOAD_MIN:
17766 case ISD::ATOMIC_LOAD_MAX:
17767 case ISD::ATOMIC_LOAD_UMIN:
17768 case ISD::ATOMIC_LOAD_UMAX:
17769 // Delegate to generic TypeLegalization. Situations we can really handle
17770 // should have already been dealt with by AtomicExpandPass.cpp.
17772 case ISD::ATOMIC_LOAD: {
17773 ReplaceATOMIC_LOAD(N, Results, DAG);
17776 case ISD::BITCAST: {
17777 assert(Subtarget->hasSSE2() && "Requires at least SSE2!");
17778 EVT DstVT = N->getValueType(0);
17779 EVT SrcVT = N->getOperand(0)->getValueType(0);
17781 if (SrcVT != MVT::f64 ||
17782 (DstVT != MVT::v2i32 && DstVT != MVT::v4i16 && DstVT != MVT::v8i8))
17785 unsigned NumElts = DstVT.getVectorNumElements();
17786 EVT SVT = DstVT.getVectorElementType();
17787 EVT WiderVT = EVT::getVectorVT(*DAG.getContext(), SVT, NumElts * 2);
17788 SDValue Expanded = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl,
17789 MVT::v2f64, N->getOperand(0));
17790 SDValue ToVecInt = DAG.getNode(ISD::BITCAST, dl, WiderVT, Expanded);
17792 if (ExperimentalVectorWideningLegalization) {
17793 // If we are legalizing vectors by widening, we already have the desired
17794 // legal vector type, just return it.
17795 Results.push_back(ToVecInt);
17799 SmallVector<SDValue, 8> Elts;
17800 for (unsigned i = 0, e = NumElts; i != e; ++i)
17801 Elts.push_back(DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, SVT,
17802 ToVecInt, DAG.getIntPtrConstant(i)));
17804 Results.push_back(DAG.getNode(ISD::BUILD_VECTOR, dl, DstVT, Elts));
17809 const char *X86TargetLowering::getTargetNodeName(unsigned Opcode) const {
17811 default: return nullptr;
17812 case X86ISD::BSF: return "X86ISD::BSF";
17813 case X86ISD::BSR: return "X86ISD::BSR";
17814 case X86ISD::SHLD: return "X86ISD::SHLD";
17815 case X86ISD::SHRD: return "X86ISD::SHRD";
17816 case X86ISD::FAND: return "X86ISD::FAND";
17817 case X86ISD::FANDN: return "X86ISD::FANDN";
17818 case X86ISD::FOR: return "X86ISD::FOR";
17819 case X86ISD::FXOR: return "X86ISD::FXOR";
17820 case X86ISD::FSRL: return "X86ISD::FSRL";
17821 case X86ISD::FILD: return "X86ISD::FILD";
17822 case X86ISD::FILD_FLAG: return "X86ISD::FILD_FLAG";
17823 case X86ISD::FP_TO_INT16_IN_MEM: return "X86ISD::FP_TO_INT16_IN_MEM";
17824 case X86ISD::FP_TO_INT32_IN_MEM: return "X86ISD::FP_TO_INT32_IN_MEM";
17825 case X86ISD::FP_TO_INT64_IN_MEM: return "X86ISD::FP_TO_INT64_IN_MEM";
17826 case X86ISD::FLD: return "X86ISD::FLD";
17827 case X86ISD::FST: return "X86ISD::FST";
17828 case X86ISD::CALL: return "X86ISD::CALL";
17829 case X86ISD::RDTSC_DAG: return "X86ISD::RDTSC_DAG";
17830 case X86ISD::RDTSCP_DAG: return "X86ISD::RDTSCP_DAG";
17831 case X86ISD::RDPMC_DAG: return "X86ISD::RDPMC_DAG";
17832 case X86ISD::BT: return "X86ISD::BT";
17833 case X86ISD::CMP: return "X86ISD::CMP";
17834 case X86ISD::COMI: return "X86ISD::COMI";
17835 case X86ISD::UCOMI: return "X86ISD::UCOMI";
17836 case X86ISD::CMPM: return "X86ISD::CMPM";
17837 case X86ISD::CMPMU: return "X86ISD::CMPMU";
17838 case X86ISD::SETCC: return "X86ISD::SETCC";
17839 case X86ISD::SETCC_CARRY: return "X86ISD::SETCC_CARRY";
17840 case X86ISD::FSETCC: return "X86ISD::FSETCC";
17841 case X86ISD::CMOV: return "X86ISD::CMOV";
17842 case X86ISD::BRCOND: return "X86ISD::BRCOND";
17843 case X86ISD::RET_FLAG: return "X86ISD::RET_FLAG";
17844 case X86ISD::REP_STOS: return "X86ISD::REP_STOS";
17845 case X86ISD::REP_MOVS: return "X86ISD::REP_MOVS";
17846 case X86ISD::GlobalBaseReg: return "X86ISD::GlobalBaseReg";
17847 case X86ISD::Wrapper: return "X86ISD::Wrapper";
17848 case X86ISD::WrapperRIP: return "X86ISD::WrapperRIP";
17849 case X86ISD::PEXTRB: return "X86ISD::PEXTRB";
17850 case X86ISD::PEXTRW: return "X86ISD::PEXTRW";
17851 case X86ISD::INSERTPS: return "X86ISD::INSERTPS";
17852 case X86ISD::PINSRB: return "X86ISD::PINSRB";
17853 case X86ISD::PINSRW: return "X86ISD::PINSRW";
17854 case X86ISD::PSHUFB: return "X86ISD::PSHUFB";
17855 case X86ISD::ANDNP: return "X86ISD::ANDNP";
17856 case X86ISD::PSIGN: return "X86ISD::PSIGN";
17857 case X86ISD::BLENDV: return "X86ISD::BLENDV";
17858 case X86ISD::BLENDI: return "X86ISD::BLENDI";
17859 case X86ISD::SUBUS: return "X86ISD::SUBUS";
17860 case X86ISD::HADD: return "X86ISD::HADD";
17861 case X86ISD::HSUB: return "X86ISD::HSUB";
17862 case X86ISD::FHADD: return "X86ISD::FHADD";
17863 case X86ISD::FHSUB: return "X86ISD::FHSUB";
17864 case X86ISD::UMAX: return "X86ISD::UMAX";
17865 case X86ISD::UMIN: return "X86ISD::UMIN";
17866 case X86ISD::SMAX: return "X86ISD::SMAX";
17867 case X86ISD::SMIN: return "X86ISD::SMIN";
17868 case X86ISD::FMAX: return "X86ISD::FMAX";
17869 case X86ISD::FMIN: return "X86ISD::FMIN";
17870 case X86ISD::FMAXC: return "X86ISD::FMAXC";
17871 case X86ISD::FMINC: return "X86ISD::FMINC";
17872 case X86ISD::FRSQRT: return "X86ISD::FRSQRT";
17873 case X86ISD::FRCP: return "X86ISD::FRCP";
17874 case X86ISD::TLSADDR: return "X86ISD::TLSADDR";
17875 case X86ISD::TLSBASEADDR: return "X86ISD::TLSBASEADDR";
17876 case X86ISD::TLSCALL: return "X86ISD::TLSCALL";
17877 case X86ISD::EH_SJLJ_SETJMP: return "X86ISD::EH_SJLJ_SETJMP";
17878 case X86ISD::EH_SJLJ_LONGJMP: return "X86ISD::EH_SJLJ_LONGJMP";
17879 case X86ISD::EH_RETURN: return "X86ISD::EH_RETURN";
17880 case X86ISD::TC_RETURN: return "X86ISD::TC_RETURN";
17881 case X86ISD::FNSTCW16m: return "X86ISD::FNSTCW16m";
17882 case X86ISD::FNSTSW16r: return "X86ISD::FNSTSW16r";
17883 case X86ISD::LCMPXCHG_DAG: return "X86ISD::LCMPXCHG_DAG";
17884 case X86ISD::LCMPXCHG8_DAG: return "X86ISD::LCMPXCHG8_DAG";
17885 case X86ISD::LCMPXCHG16_DAG: return "X86ISD::LCMPXCHG16_DAG";
17886 case X86ISD::VZEXT_MOVL: return "X86ISD::VZEXT_MOVL";
17887 case X86ISD::VZEXT_LOAD: return "X86ISD::VZEXT_LOAD";
17888 case X86ISD::VZEXT: return "X86ISD::VZEXT";
17889 case X86ISD::VSEXT: return "X86ISD::VSEXT";
17890 case X86ISD::VTRUNC: return "X86ISD::VTRUNC";
17891 case X86ISD::VTRUNCM: return "X86ISD::VTRUNCM";
17892 case X86ISD::VINSERT: return "X86ISD::VINSERT";
17893 case X86ISD::VFPEXT: return "X86ISD::VFPEXT";
17894 case X86ISD::VFPROUND: return "X86ISD::VFPROUND";
17895 case X86ISD::VSHLDQ: return "X86ISD::VSHLDQ";
17896 case X86ISD::VSRLDQ: return "X86ISD::VSRLDQ";
17897 case X86ISD::VSHL: return "X86ISD::VSHL";
17898 case X86ISD::VSRL: return "X86ISD::VSRL";
17899 case X86ISD::VSRA: return "X86ISD::VSRA";
17900 case X86ISD::VSHLI: return "X86ISD::VSHLI";
17901 case X86ISD::VSRLI: return "X86ISD::VSRLI";
17902 case X86ISD::VSRAI: return "X86ISD::VSRAI";
17903 case X86ISD::CMPP: return "X86ISD::CMPP";
17904 case X86ISD::PCMPEQ: return "X86ISD::PCMPEQ";
17905 case X86ISD::PCMPGT: return "X86ISD::PCMPGT";
17906 case X86ISD::PCMPEQM: return "X86ISD::PCMPEQM";
17907 case X86ISD::PCMPGTM: return "X86ISD::PCMPGTM";
17908 case X86ISD::ADD: return "X86ISD::ADD";
17909 case X86ISD::SUB: return "X86ISD::SUB";
17910 case X86ISD::ADC: return "X86ISD::ADC";
17911 case X86ISD::SBB: return "X86ISD::SBB";
17912 case X86ISD::SMUL: return "X86ISD::SMUL";
17913 case X86ISD::UMUL: return "X86ISD::UMUL";
17914 case X86ISD::INC: return "X86ISD::INC";
17915 case X86ISD::DEC: return "X86ISD::DEC";
17916 case X86ISD::OR: return "X86ISD::OR";
17917 case X86ISD::XOR: return "X86ISD::XOR";
17918 case X86ISD::AND: return "X86ISD::AND";
17919 case X86ISD::BEXTR: return "X86ISD::BEXTR";
17920 case X86ISD::MUL_IMM: return "X86ISD::MUL_IMM";
17921 case X86ISD::PTEST: return "X86ISD::PTEST";
17922 case X86ISD::TESTP: return "X86ISD::TESTP";
17923 case X86ISD::TESTM: return "X86ISD::TESTM";
17924 case X86ISD::TESTNM: return "X86ISD::TESTNM";
17925 case X86ISD::KORTEST: return "X86ISD::KORTEST";
17926 case X86ISD::PACKSS: return "X86ISD::PACKSS";
17927 case X86ISD::PACKUS: return "X86ISD::PACKUS";
17928 case X86ISD::PALIGNR: return "X86ISD::PALIGNR";
17929 case X86ISD::VALIGN: return "X86ISD::VALIGN";
17930 case X86ISD::PSHUFD: return "X86ISD::PSHUFD";
17931 case X86ISD::PSHUFHW: return "X86ISD::PSHUFHW";
17932 case X86ISD::PSHUFLW: return "X86ISD::PSHUFLW";
17933 case X86ISD::SHUFP: return "X86ISD::SHUFP";
17934 case X86ISD::MOVLHPS: return "X86ISD::MOVLHPS";
17935 case X86ISD::MOVLHPD: return "X86ISD::MOVLHPD";
17936 case X86ISD::MOVHLPS: return "X86ISD::MOVHLPS";
17937 case X86ISD::MOVLPS: return "X86ISD::MOVLPS";
17938 case X86ISD::MOVLPD: return "X86ISD::MOVLPD";
17939 case X86ISD::MOVDDUP: return "X86ISD::MOVDDUP";
17940 case X86ISD::MOVSHDUP: return "X86ISD::MOVSHDUP";
17941 case X86ISD::MOVSLDUP: return "X86ISD::MOVSLDUP";
17942 case X86ISD::MOVSD: return "X86ISD::MOVSD";
17943 case X86ISD::MOVSS: return "X86ISD::MOVSS";
17944 case X86ISD::UNPCKL: return "X86ISD::UNPCKL";
17945 case X86ISD::UNPCKH: return "X86ISD::UNPCKH";
17946 case X86ISD::VBROADCAST: return "X86ISD::VBROADCAST";
17947 case X86ISD::VBROADCASTM: return "X86ISD::VBROADCASTM";
17948 case X86ISD::VEXTRACT: return "X86ISD::VEXTRACT";
17949 case X86ISD::VPERMILP: return "X86ISD::VPERMILP";
17950 case X86ISD::VPERM2X128: return "X86ISD::VPERM2X128";
17951 case X86ISD::VPERMV: return "X86ISD::VPERMV";
17952 case X86ISD::VPERMV3: return "X86ISD::VPERMV3";
17953 case X86ISD::VPERMIV3: return "X86ISD::VPERMIV3";
17954 case X86ISD::VPERMI: return "X86ISD::VPERMI";
17955 case X86ISD::PMULUDQ: return "X86ISD::PMULUDQ";
17956 case X86ISD::PMULDQ: return "X86ISD::PMULDQ";
17957 case X86ISD::VASTART_SAVE_XMM_REGS: return "X86ISD::VASTART_SAVE_XMM_REGS";
17958 case X86ISD::VAARG_64: return "X86ISD::VAARG_64";
17959 case X86ISD::WIN_ALLOCA: return "X86ISD::WIN_ALLOCA";
17960 case X86ISD::MEMBARRIER: return "X86ISD::MEMBARRIER";
17961 case X86ISD::SEG_ALLOCA: return "X86ISD::SEG_ALLOCA";
17962 case X86ISD::WIN_FTOL: return "X86ISD::WIN_FTOL";
17963 case X86ISD::SAHF: return "X86ISD::SAHF";
17964 case X86ISD::RDRAND: return "X86ISD::RDRAND";
17965 case X86ISD::RDSEED: return "X86ISD::RDSEED";
17966 case X86ISD::FMADD: return "X86ISD::FMADD";
17967 case X86ISD::FMSUB: return "X86ISD::FMSUB";
17968 case X86ISD::FNMADD: return "X86ISD::FNMADD";
17969 case X86ISD::FNMSUB: return "X86ISD::FNMSUB";
17970 case X86ISD::FMADDSUB: return "X86ISD::FMADDSUB";
17971 case X86ISD::FMSUBADD: return "X86ISD::FMSUBADD";
17972 case X86ISD::PCMPESTRI: return "X86ISD::PCMPESTRI";
17973 case X86ISD::PCMPISTRI: return "X86ISD::PCMPISTRI";
17974 case X86ISD::XTEST: return "X86ISD::XTEST";
17978 // isLegalAddressingMode - Return true if the addressing mode represented
17979 // by AM is legal for this target, for a load/store of the specified type.
17980 bool X86TargetLowering::isLegalAddressingMode(const AddrMode &AM,
17982 // X86 supports extremely general addressing modes.
17983 CodeModel::Model M = getTargetMachine().getCodeModel();
17984 Reloc::Model R = getTargetMachine().getRelocationModel();
17986 // X86 allows a sign-extended 32-bit immediate field as a displacement.
17987 if (!X86::isOffsetSuitableForCodeModel(AM.BaseOffs, M, AM.BaseGV != nullptr))
17992 Subtarget->ClassifyGlobalReference(AM.BaseGV, getTargetMachine());
17994 // If a reference to this global requires an extra load, we can't fold it.
17995 if (isGlobalStubReference(GVFlags))
17998 // If BaseGV requires a register for the PIC base, we cannot also have a
17999 // BaseReg specified.
18000 if (AM.HasBaseReg && isGlobalRelativeToPICBase(GVFlags))
18003 // If lower 4G is not available, then we must use rip-relative addressing.
18004 if ((M != CodeModel::Small || R != Reloc::Static) &&
18005 Subtarget->is64Bit() && (AM.BaseOffs || AM.Scale > 1))
18009 switch (AM.Scale) {
18015 // These scales always work.
18020 // These scales are formed with basereg+scalereg. Only accept if there is
18025 default: // Other stuff never works.
18032 bool X86TargetLowering::isVectorShiftByScalarCheap(Type *Ty) const {
18033 unsigned Bits = Ty->getScalarSizeInBits();
18035 // 8-bit shifts are always expensive, but versions with a scalar amount aren't
18036 // particularly cheaper than those without.
18040 // On AVX2 there are new vpsllv[dq] instructions (and other shifts), that make
18041 // variable shifts just as cheap as scalar ones.
18042 if (Subtarget->hasInt256() && (Bits == 32 || Bits == 64))
18045 // Otherwise, it's significantly cheaper to shift by a scalar amount than by a
18046 // fully general vector.
18050 bool X86TargetLowering::isTruncateFree(Type *Ty1, Type *Ty2) const {
18051 if (!Ty1->isIntegerTy() || !Ty2->isIntegerTy())
18053 unsigned NumBits1 = Ty1->getPrimitiveSizeInBits();
18054 unsigned NumBits2 = Ty2->getPrimitiveSizeInBits();
18055 return NumBits1 > NumBits2;
18058 bool X86TargetLowering::allowTruncateForTailCall(Type *Ty1, Type *Ty2) const {
18059 if (!Ty1->isIntegerTy() || !Ty2->isIntegerTy())
18062 if (!isTypeLegal(EVT::getEVT(Ty1)))
18065 assert(Ty1->getPrimitiveSizeInBits() <= 64 && "i128 is probably not a noop");
18067 // Assuming the caller doesn't have a zeroext or signext return parameter,
18068 // truncation all the way down to i1 is valid.
18072 bool X86TargetLowering::isLegalICmpImmediate(int64_t Imm) const {
18073 return isInt<32>(Imm);
18076 bool X86TargetLowering::isLegalAddImmediate(int64_t Imm) const {
18077 // Can also use sub to handle negated immediates.
18078 return isInt<32>(Imm);
18081 bool X86TargetLowering::isTruncateFree(EVT VT1, EVT VT2) const {
18082 if (!VT1.isInteger() || !VT2.isInteger())
18084 unsigned NumBits1 = VT1.getSizeInBits();
18085 unsigned NumBits2 = VT2.getSizeInBits();
18086 return NumBits1 > NumBits2;
18089 bool X86TargetLowering::isZExtFree(Type *Ty1, Type *Ty2) const {
18090 // x86-64 implicitly zero-extends 32-bit results in 64-bit registers.
18091 return Ty1->isIntegerTy(32) && Ty2->isIntegerTy(64) && Subtarget->is64Bit();
18094 bool X86TargetLowering::isZExtFree(EVT VT1, EVT VT2) const {
18095 // x86-64 implicitly zero-extends 32-bit results in 64-bit registers.
18096 return VT1 == MVT::i32 && VT2 == MVT::i64 && Subtarget->is64Bit();
18099 bool X86TargetLowering::isZExtFree(SDValue Val, EVT VT2) const {
18100 EVT VT1 = Val.getValueType();
18101 if (isZExtFree(VT1, VT2))
18104 if (Val.getOpcode() != ISD::LOAD)
18107 if (!VT1.isSimple() || !VT1.isInteger() ||
18108 !VT2.isSimple() || !VT2.isInteger())
18111 switch (VT1.getSimpleVT().SimpleTy) {
18116 // X86 has 8, 16, and 32-bit zero-extending loads.
18124 X86TargetLowering::isFMAFasterThanFMulAndFAdd(EVT VT) const {
18125 if (!(Subtarget->hasFMA() || Subtarget->hasFMA4()))
18128 VT = VT.getScalarType();
18130 if (!VT.isSimple())
18133 switch (VT.getSimpleVT().SimpleTy) {
18144 bool X86TargetLowering::isNarrowingProfitable(EVT VT1, EVT VT2) const {
18145 // i16 instructions are longer (0x66 prefix) and potentially slower.
18146 return !(VT1 == MVT::i32 && VT2 == MVT::i16);
18149 /// isShuffleMaskLegal - Targets can use this to indicate that they only
18150 /// support *some* VECTOR_SHUFFLE operations, those with specific masks.
18151 /// By default, if a target supports the VECTOR_SHUFFLE node, all mask values
18152 /// are assumed to be legal.
18154 X86TargetLowering::isShuffleMaskLegal(const SmallVectorImpl<int> &M,
18156 if (!VT.isSimple())
18159 MVT SVT = VT.getSimpleVT();
18161 // Very little shuffling can be done for 64-bit vectors right now.
18162 if (VT.getSizeInBits() == 64)
18165 // If this is a single-input shuffle with no 128 bit lane crossings we can
18166 // lower it into pshufb.
18167 if ((SVT.is128BitVector() && Subtarget->hasSSSE3()) ||
18168 (SVT.is256BitVector() && Subtarget->hasInt256())) {
18169 bool isLegal = true;
18170 for (unsigned I = 0, E = M.size(); I != E; ++I) {
18171 if (M[I] >= (int)SVT.getVectorNumElements() ||
18172 ShuffleCrosses128bitLane(SVT, I, M[I])) {
18181 // FIXME: blends, shifts.
18182 return (SVT.getVectorNumElements() == 2 ||
18183 ShuffleVectorSDNode::isSplatMask(&M[0], VT) ||
18184 isMOVLMask(M, SVT) ||
18185 isMOVHLPSMask(M, SVT) ||
18186 isSHUFPMask(M, SVT) ||
18187 isPSHUFDMask(M, SVT) ||
18188 isPSHUFHWMask(M, SVT, Subtarget->hasInt256()) ||
18189 isPSHUFLWMask(M, SVT, Subtarget->hasInt256()) ||
18190 isPALIGNRMask(M, SVT, Subtarget) ||
18191 isUNPCKLMask(M, SVT, Subtarget->hasInt256()) ||
18192 isUNPCKHMask(M, SVT, Subtarget->hasInt256()) ||
18193 isUNPCKL_v_undef_Mask(M, SVT, Subtarget->hasInt256()) ||
18194 isUNPCKH_v_undef_Mask(M, SVT, Subtarget->hasInt256()) ||
18195 isBlendMask(M, SVT, Subtarget->hasSSE41(), Subtarget->hasInt256()));
18199 X86TargetLowering::isVectorClearMaskLegal(const SmallVectorImpl<int> &Mask,
18201 if (!VT.isSimple())
18204 MVT SVT = VT.getSimpleVT();
18205 unsigned NumElts = SVT.getVectorNumElements();
18206 // FIXME: This collection of masks seems suspect.
18209 if (NumElts == 4 && SVT.is128BitVector()) {
18210 return (isMOVLMask(Mask, SVT) ||
18211 isCommutedMOVLMask(Mask, SVT, true) ||
18212 isSHUFPMask(Mask, SVT) ||
18213 isSHUFPMask(Mask, SVT, /* Commuted */ true));
18218 //===----------------------------------------------------------------------===//
18219 // X86 Scheduler Hooks
18220 //===----------------------------------------------------------------------===//
18222 /// Utility function to emit xbegin specifying the start of an RTM region.
18223 static MachineBasicBlock *EmitXBegin(MachineInstr *MI, MachineBasicBlock *MBB,
18224 const TargetInstrInfo *TII) {
18225 DebugLoc DL = MI->getDebugLoc();
18227 const BasicBlock *BB = MBB->getBasicBlock();
18228 MachineFunction::iterator I = MBB;
18231 // For the v = xbegin(), we generate
18242 MachineBasicBlock *thisMBB = MBB;
18243 MachineFunction *MF = MBB->getParent();
18244 MachineBasicBlock *mainMBB = MF->CreateMachineBasicBlock(BB);
18245 MachineBasicBlock *sinkMBB = MF->CreateMachineBasicBlock(BB);
18246 MF->insert(I, mainMBB);
18247 MF->insert(I, sinkMBB);
18249 // Transfer the remainder of BB and its successor edges to sinkMBB.
18250 sinkMBB->splice(sinkMBB->begin(), MBB,
18251 std::next(MachineBasicBlock::iterator(MI)), MBB->end());
18252 sinkMBB->transferSuccessorsAndUpdatePHIs(MBB);
18256 // # fallthrough to mainMBB
18257 // # abortion to sinkMBB
18258 BuildMI(thisMBB, DL, TII->get(X86::XBEGIN_4)).addMBB(sinkMBB);
18259 thisMBB->addSuccessor(mainMBB);
18260 thisMBB->addSuccessor(sinkMBB);
18264 BuildMI(mainMBB, DL, TII->get(X86::MOV32ri), X86::EAX).addImm(-1);
18265 mainMBB->addSuccessor(sinkMBB);
18268 // EAX is live into the sinkMBB
18269 sinkMBB->addLiveIn(X86::EAX);
18270 BuildMI(*sinkMBB, sinkMBB->begin(), DL,
18271 TII->get(TargetOpcode::COPY), MI->getOperand(0).getReg())
18274 MI->eraseFromParent();
18278 // FIXME: When we get size specific XMM0 registers, i.e. XMM0_V16I8
18279 // or XMM0_V32I8 in AVX all of this code can be replaced with that
18280 // in the .td file.
18281 static MachineBasicBlock *EmitPCMPSTRM(MachineInstr *MI, MachineBasicBlock *BB,
18282 const TargetInstrInfo *TII) {
18284 switch (MI->getOpcode()) {
18285 default: llvm_unreachable("illegal opcode!");
18286 case X86::PCMPISTRM128REG: Opc = X86::PCMPISTRM128rr; break;
18287 case X86::VPCMPISTRM128REG: Opc = X86::VPCMPISTRM128rr; break;
18288 case X86::PCMPISTRM128MEM: Opc = X86::PCMPISTRM128rm; break;
18289 case X86::VPCMPISTRM128MEM: Opc = X86::VPCMPISTRM128rm; break;
18290 case X86::PCMPESTRM128REG: Opc = X86::PCMPESTRM128rr; break;
18291 case X86::VPCMPESTRM128REG: Opc = X86::VPCMPESTRM128rr; break;
18292 case X86::PCMPESTRM128MEM: Opc = X86::PCMPESTRM128rm; break;
18293 case X86::VPCMPESTRM128MEM: Opc = X86::VPCMPESTRM128rm; break;
18296 DebugLoc dl = MI->getDebugLoc();
18297 MachineInstrBuilder MIB = BuildMI(*BB, MI, dl, TII->get(Opc));
18299 unsigned NumArgs = MI->getNumOperands();
18300 for (unsigned i = 1; i < NumArgs; ++i) {
18301 MachineOperand &Op = MI->getOperand(i);
18302 if (!(Op.isReg() && Op.isImplicit()))
18303 MIB.addOperand(Op);
18305 if (MI->hasOneMemOperand())
18306 MIB->setMemRefs(MI->memoperands_begin(), MI->memoperands_end());
18308 BuildMI(*BB, MI, dl,
18309 TII->get(TargetOpcode::COPY), MI->getOperand(0).getReg())
18310 .addReg(X86::XMM0);
18312 MI->eraseFromParent();
18316 // FIXME: Custom handling because TableGen doesn't support multiple implicit
18317 // defs in an instruction pattern
18318 static MachineBasicBlock *EmitPCMPSTRI(MachineInstr *MI, MachineBasicBlock *BB,
18319 const TargetInstrInfo *TII) {
18321 switch (MI->getOpcode()) {
18322 default: llvm_unreachable("illegal opcode!");
18323 case X86::PCMPISTRIREG: Opc = X86::PCMPISTRIrr; break;
18324 case X86::VPCMPISTRIREG: Opc = X86::VPCMPISTRIrr; break;
18325 case X86::PCMPISTRIMEM: Opc = X86::PCMPISTRIrm; break;
18326 case X86::VPCMPISTRIMEM: Opc = X86::VPCMPISTRIrm; break;
18327 case X86::PCMPESTRIREG: Opc = X86::PCMPESTRIrr; break;
18328 case X86::VPCMPESTRIREG: Opc = X86::VPCMPESTRIrr; break;
18329 case X86::PCMPESTRIMEM: Opc = X86::PCMPESTRIrm; break;
18330 case X86::VPCMPESTRIMEM: Opc = X86::VPCMPESTRIrm; break;
18333 DebugLoc dl = MI->getDebugLoc();
18334 MachineInstrBuilder MIB = BuildMI(*BB, MI, dl, TII->get(Opc));
18336 unsigned NumArgs = MI->getNumOperands(); // remove the results
18337 for (unsigned i = 1; i < NumArgs; ++i) {
18338 MachineOperand &Op = MI->getOperand(i);
18339 if (!(Op.isReg() && Op.isImplicit()))
18340 MIB.addOperand(Op);
18342 if (MI->hasOneMemOperand())
18343 MIB->setMemRefs(MI->memoperands_begin(), MI->memoperands_end());
18345 BuildMI(*BB, MI, dl,
18346 TII->get(TargetOpcode::COPY), MI->getOperand(0).getReg())
18349 MI->eraseFromParent();
18353 static MachineBasicBlock * EmitMonitor(MachineInstr *MI, MachineBasicBlock *BB,
18354 const TargetInstrInfo *TII,
18355 const X86Subtarget* Subtarget) {
18356 DebugLoc dl = MI->getDebugLoc();
18358 // Address into RAX/EAX, other two args into ECX, EDX.
18359 unsigned MemOpc = Subtarget->is64Bit() ? X86::LEA64r : X86::LEA32r;
18360 unsigned MemReg = Subtarget->is64Bit() ? X86::RAX : X86::EAX;
18361 MachineInstrBuilder MIB = BuildMI(*BB, MI, dl, TII->get(MemOpc), MemReg);
18362 for (int i = 0; i < X86::AddrNumOperands; ++i)
18363 MIB.addOperand(MI->getOperand(i));
18365 unsigned ValOps = X86::AddrNumOperands;
18366 BuildMI(*BB, MI, dl, TII->get(TargetOpcode::COPY), X86::ECX)
18367 .addReg(MI->getOperand(ValOps).getReg());
18368 BuildMI(*BB, MI, dl, TII->get(TargetOpcode::COPY), X86::EDX)
18369 .addReg(MI->getOperand(ValOps+1).getReg());
18371 // The instruction doesn't actually take any operands though.
18372 BuildMI(*BB, MI, dl, TII->get(X86::MONITORrrr));
18374 MI->eraseFromParent(); // The pseudo is gone now.
18378 MachineBasicBlock *
18379 X86TargetLowering::EmitVAARG64WithCustomInserter(
18381 MachineBasicBlock *MBB) const {
18382 // Emit va_arg instruction on X86-64.
18384 // Operands to this pseudo-instruction:
18385 // 0 ) Output : destination address (reg)
18386 // 1-5) Input : va_list address (addr, i64mem)
18387 // 6 ) ArgSize : Size (in bytes) of vararg type
18388 // 7 ) ArgMode : 0=overflow only, 1=use gp_offset, 2=use fp_offset
18389 // 8 ) Align : Alignment of type
18390 // 9 ) EFLAGS (implicit-def)
18392 assert(MI->getNumOperands() == 10 && "VAARG_64 should have 10 operands!");
18393 assert(X86::AddrNumOperands == 5 && "VAARG_64 assumes 5 address operands");
18395 unsigned DestReg = MI->getOperand(0).getReg();
18396 MachineOperand &Base = MI->getOperand(1);
18397 MachineOperand &Scale = MI->getOperand(2);
18398 MachineOperand &Index = MI->getOperand(3);
18399 MachineOperand &Disp = MI->getOperand(4);
18400 MachineOperand &Segment = MI->getOperand(5);
18401 unsigned ArgSize = MI->getOperand(6).getImm();
18402 unsigned ArgMode = MI->getOperand(7).getImm();
18403 unsigned Align = MI->getOperand(8).getImm();
18405 // Memory Reference
18406 assert(MI->hasOneMemOperand() && "Expected VAARG_64 to have one memoperand");
18407 MachineInstr::mmo_iterator MMOBegin = MI->memoperands_begin();
18408 MachineInstr::mmo_iterator MMOEnd = MI->memoperands_end();
18410 // Machine Information
18411 const TargetInstrInfo *TII = MBB->getParent()->getSubtarget().getInstrInfo();
18412 MachineRegisterInfo &MRI = MBB->getParent()->getRegInfo();
18413 const TargetRegisterClass *AddrRegClass = getRegClassFor(MVT::i64);
18414 const TargetRegisterClass *OffsetRegClass = getRegClassFor(MVT::i32);
18415 DebugLoc DL = MI->getDebugLoc();
18417 // struct va_list {
18420 // i64 overflow_area (address)
18421 // i64 reg_save_area (address)
18423 // sizeof(va_list) = 24
18424 // alignment(va_list) = 8
18426 unsigned TotalNumIntRegs = 6;
18427 unsigned TotalNumXMMRegs = 8;
18428 bool UseGPOffset = (ArgMode == 1);
18429 bool UseFPOffset = (ArgMode == 2);
18430 unsigned MaxOffset = TotalNumIntRegs * 8 +
18431 (UseFPOffset ? TotalNumXMMRegs * 16 : 0);
18433 /* Align ArgSize to a multiple of 8 */
18434 unsigned ArgSizeA8 = (ArgSize + 7) & ~7;
18435 bool NeedsAlign = (Align > 8);
18437 MachineBasicBlock *thisMBB = MBB;
18438 MachineBasicBlock *overflowMBB;
18439 MachineBasicBlock *offsetMBB;
18440 MachineBasicBlock *endMBB;
18442 unsigned OffsetDestReg = 0; // Argument address computed by offsetMBB
18443 unsigned OverflowDestReg = 0; // Argument address computed by overflowMBB
18444 unsigned OffsetReg = 0;
18446 if (!UseGPOffset && !UseFPOffset) {
18447 // If we only pull from the overflow region, we don't create a branch.
18448 // We don't need to alter control flow.
18449 OffsetDestReg = 0; // unused
18450 OverflowDestReg = DestReg;
18452 offsetMBB = nullptr;
18453 overflowMBB = thisMBB;
18456 // First emit code to check if gp_offset (or fp_offset) is below the bound.
18457 // If so, pull the argument from reg_save_area. (branch to offsetMBB)
18458 // If not, pull from overflow_area. (branch to overflowMBB)
18463 // offsetMBB overflowMBB
18468 // Registers for the PHI in endMBB
18469 OffsetDestReg = MRI.createVirtualRegister(AddrRegClass);
18470 OverflowDestReg = MRI.createVirtualRegister(AddrRegClass);
18472 const BasicBlock *LLVM_BB = MBB->getBasicBlock();
18473 MachineFunction *MF = MBB->getParent();
18474 overflowMBB = MF->CreateMachineBasicBlock(LLVM_BB);
18475 offsetMBB = MF->CreateMachineBasicBlock(LLVM_BB);
18476 endMBB = MF->CreateMachineBasicBlock(LLVM_BB);
18478 MachineFunction::iterator MBBIter = MBB;
18481 // Insert the new basic blocks
18482 MF->insert(MBBIter, offsetMBB);
18483 MF->insert(MBBIter, overflowMBB);
18484 MF->insert(MBBIter, endMBB);
18486 // Transfer the remainder of MBB and its successor edges to endMBB.
18487 endMBB->splice(endMBB->begin(), thisMBB,
18488 std::next(MachineBasicBlock::iterator(MI)), thisMBB->end());
18489 endMBB->transferSuccessorsAndUpdatePHIs(thisMBB);
18491 // Make offsetMBB and overflowMBB successors of thisMBB
18492 thisMBB->addSuccessor(offsetMBB);
18493 thisMBB->addSuccessor(overflowMBB);
18495 // endMBB is a successor of both offsetMBB and overflowMBB
18496 offsetMBB->addSuccessor(endMBB);
18497 overflowMBB->addSuccessor(endMBB);
18499 // Load the offset value into a register
18500 OffsetReg = MRI.createVirtualRegister(OffsetRegClass);
18501 BuildMI(thisMBB, DL, TII->get(X86::MOV32rm), OffsetReg)
18505 .addDisp(Disp, UseFPOffset ? 4 : 0)
18506 .addOperand(Segment)
18507 .setMemRefs(MMOBegin, MMOEnd);
18509 // Check if there is enough room left to pull this argument.
18510 BuildMI(thisMBB, DL, TII->get(X86::CMP32ri))
18512 .addImm(MaxOffset + 8 - ArgSizeA8);
18514 // Branch to "overflowMBB" if offset >= max
18515 // Fall through to "offsetMBB" otherwise
18516 BuildMI(thisMBB, DL, TII->get(X86::GetCondBranchFromCond(X86::COND_AE)))
18517 .addMBB(overflowMBB);
18520 // In offsetMBB, emit code to use the reg_save_area.
18522 assert(OffsetReg != 0);
18524 // Read the reg_save_area address.
18525 unsigned RegSaveReg = MRI.createVirtualRegister(AddrRegClass);
18526 BuildMI(offsetMBB, DL, TII->get(X86::MOV64rm), RegSaveReg)
18531 .addOperand(Segment)
18532 .setMemRefs(MMOBegin, MMOEnd);
18534 // Zero-extend the offset
18535 unsigned OffsetReg64 = MRI.createVirtualRegister(AddrRegClass);
18536 BuildMI(offsetMBB, DL, TII->get(X86::SUBREG_TO_REG), OffsetReg64)
18539 .addImm(X86::sub_32bit);
18541 // Add the offset to the reg_save_area to get the final address.
18542 BuildMI(offsetMBB, DL, TII->get(X86::ADD64rr), OffsetDestReg)
18543 .addReg(OffsetReg64)
18544 .addReg(RegSaveReg);
18546 // Compute the offset for the next argument
18547 unsigned NextOffsetReg = MRI.createVirtualRegister(OffsetRegClass);
18548 BuildMI(offsetMBB, DL, TII->get(X86::ADD32ri), NextOffsetReg)
18550 .addImm(UseFPOffset ? 16 : 8);
18552 // Store it back into the va_list.
18553 BuildMI(offsetMBB, DL, TII->get(X86::MOV32mr))
18557 .addDisp(Disp, UseFPOffset ? 4 : 0)
18558 .addOperand(Segment)
18559 .addReg(NextOffsetReg)
18560 .setMemRefs(MMOBegin, MMOEnd);
18563 BuildMI(offsetMBB, DL, TII->get(X86::JMP_4))
18568 // Emit code to use overflow area
18571 // Load the overflow_area address into a register.
18572 unsigned OverflowAddrReg = MRI.createVirtualRegister(AddrRegClass);
18573 BuildMI(overflowMBB, DL, TII->get(X86::MOV64rm), OverflowAddrReg)
18578 .addOperand(Segment)
18579 .setMemRefs(MMOBegin, MMOEnd);
18581 // If we need to align it, do so. Otherwise, just copy the address
18582 // to OverflowDestReg.
18584 // Align the overflow address
18585 assert((Align & (Align-1)) == 0 && "Alignment must be a power of 2");
18586 unsigned TmpReg = MRI.createVirtualRegister(AddrRegClass);
18588 // aligned_addr = (addr + (align-1)) & ~(align-1)
18589 BuildMI(overflowMBB, DL, TII->get(X86::ADD64ri32), TmpReg)
18590 .addReg(OverflowAddrReg)
18593 BuildMI(overflowMBB, DL, TII->get(X86::AND64ri32), OverflowDestReg)
18595 .addImm(~(uint64_t)(Align-1));
18597 BuildMI(overflowMBB, DL, TII->get(TargetOpcode::COPY), OverflowDestReg)
18598 .addReg(OverflowAddrReg);
18601 // Compute the next overflow address after this argument.
18602 // (the overflow address should be kept 8-byte aligned)
18603 unsigned NextAddrReg = MRI.createVirtualRegister(AddrRegClass);
18604 BuildMI(overflowMBB, DL, TII->get(X86::ADD64ri32), NextAddrReg)
18605 .addReg(OverflowDestReg)
18606 .addImm(ArgSizeA8);
18608 // Store the new overflow address.
18609 BuildMI(overflowMBB, DL, TII->get(X86::MOV64mr))
18614 .addOperand(Segment)
18615 .addReg(NextAddrReg)
18616 .setMemRefs(MMOBegin, MMOEnd);
18618 // If we branched, emit the PHI to the front of endMBB.
18620 BuildMI(*endMBB, endMBB->begin(), DL,
18621 TII->get(X86::PHI), DestReg)
18622 .addReg(OffsetDestReg).addMBB(offsetMBB)
18623 .addReg(OverflowDestReg).addMBB(overflowMBB);
18626 // Erase the pseudo instruction
18627 MI->eraseFromParent();
18632 MachineBasicBlock *
18633 X86TargetLowering::EmitVAStartSaveXMMRegsWithCustomInserter(
18635 MachineBasicBlock *MBB) const {
18636 // Emit code to save XMM registers to the stack. The ABI says that the
18637 // number of registers to save is given in %al, so it's theoretically
18638 // possible to do an indirect jump trick to avoid saving all of them,
18639 // however this code takes a simpler approach and just executes all
18640 // of the stores if %al is non-zero. It's less code, and it's probably
18641 // easier on the hardware branch predictor, and stores aren't all that
18642 // expensive anyway.
18644 // Create the new basic blocks. One block contains all the XMM stores,
18645 // and one block is the final destination regardless of whether any
18646 // stores were performed.
18647 const BasicBlock *LLVM_BB = MBB->getBasicBlock();
18648 MachineFunction *F = MBB->getParent();
18649 MachineFunction::iterator MBBIter = MBB;
18651 MachineBasicBlock *XMMSaveMBB = F->CreateMachineBasicBlock(LLVM_BB);
18652 MachineBasicBlock *EndMBB = F->CreateMachineBasicBlock(LLVM_BB);
18653 F->insert(MBBIter, XMMSaveMBB);
18654 F->insert(MBBIter, EndMBB);
18656 // Transfer the remainder of MBB and its successor edges to EndMBB.
18657 EndMBB->splice(EndMBB->begin(), MBB,
18658 std::next(MachineBasicBlock::iterator(MI)), MBB->end());
18659 EndMBB->transferSuccessorsAndUpdatePHIs(MBB);
18661 // The original block will now fall through to the XMM save block.
18662 MBB->addSuccessor(XMMSaveMBB);
18663 // The XMMSaveMBB will fall through to the end block.
18664 XMMSaveMBB->addSuccessor(EndMBB);
18666 // Now add the instructions.
18667 const TargetInstrInfo *TII = MBB->getParent()->getSubtarget().getInstrInfo();
18668 DebugLoc DL = MI->getDebugLoc();
18670 unsigned CountReg = MI->getOperand(0).getReg();
18671 int64_t RegSaveFrameIndex = MI->getOperand(1).getImm();
18672 int64_t VarArgsFPOffset = MI->getOperand(2).getImm();
18674 if (!Subtarget->isTargetWin64()) {
18675 // If %al is 0, branch around the XMM save block.
18676 BuildMI(MBB, DL, TII->get(X86::TEST8rr)).addReg(CountReg).addReg(CountReg);
18677 BuildMI(MBB, DL, TII->get(X86::JE_4)).addMBB(EndMBB);
18678 MBB->addSuccessor(EndMBB);
18681 // Make sure the last operand is EFLAGS, which gets clobbered by the branch
18682 // that was just emitted, but clearly shouldn't be "saved".
18683 assert((MI->getNumOperands() <= 3 ||
18684 !MI->getOperand(MI->getNumOperands() - 1).isReg() ||
18685 MI->getOperand(MI->getNumOperands() - 1).getReg() == X86::EFLAGS)
18686 && "Expected last argument to be EFLAGS");
18687 unsigned MOVOpc = Subtarget->hasFp256() ? X86::VMOVAPSmr : X86::MOVAPSmr;
18688 // In the XMM save block, save all the XMM argument registers.
18689 for (int i = 3, e = MI->getNumOperands() - 1; i != e; ++i) {
18690 int64_t Offset = (i - 3) * 16 + VarArgsFPOffset;
18691 MachineMemOperand *MMO =
18692 F->getMachineMemOperand(
18693 MachinePointerInfo::getFixedStack(RegSaveFrameIndex, Offset),
18694 MachineMemOperand::MOStore,
18695 /*Size=*/16, /*Align=*/16);
18696 BuildMI(XMMSaveMBB, DL, TII->get(MOVOpc))
18697 .addFrameIndex(RegSaveFrameIndex)
18698 .addImm(/*Scale=*/1)
18699 .addReg(/*IndexReg=*/0)
18700 .addImm(/*Disp=*/Offset)
18701 .addReg(/*Segment=*/0)
18702 .addReg(MI->getOperand(i).getReg())
18703 .addMemOperand(MMO);
18706 MI->eraseFromParent(); // The pseudo instruction is gone now.
18711 // The EFLAGS operand of SelectItr might be missing a kill marker
18712 // because there were multiple uses of EFLAGS, and ISel didn't know
18713 // which to mark. Figure out whether SelectItr should have had a
18714 // kill marker, and set it if it should. Returns the correct kill
18716 static bool checkAndUpdateEFLAGSKill(MachineBasicBlock::iterator SelectItr,
18717 MachineBasicBlock* BB,
18718 const TargetRegisterInfo* TRI) {
18719 // Scan forward through BB for a use/def of EFLAGS.
18720 MachineBasicBlock::iterator miI(std::next(SelectItr));
18721 for (MachineBasicBlock::iterator miE = BB->end(); miI != miE; ++miI) {
18722 const MachineInstr& mi = *miI;
18723 if (mi.readsRegister(X86::EFLAGS))
18725 if (mi.definesRegister(X86::EFLAGS))
18726 break; // Should have kill-flag - update below.
18729 // If we hit the end of the block, check whether EFLAGS is live into a
18731 if (miI == BB->end()) {
18732 for (MachineBasicBlock::succ_iterator sItr = BB->succ_begin(),
18733 sEnd = BB->succ_end();
18734 sItr != sEnd; ++sItr) {
18735 MachineBasicBlock* succ = *sItr;
18736 if (succ->isLiveIn(X86::EFLAGS))
18741 // We found a def, or hit the end of the basic block and EFLAGS wasn't live
18742 // out. SelectMI should have a kill flag on EFLAGS.
18743 SelectItr->addRegisterKilled(X86::EFLAGS, TRI);
18747 MachineBasicBlock *
18748 X86TargetLowering::EmitLoweredSelect(MachineInstr *MI,
18749 MachineBasicBlock *BB) const {
18750 const TargetInstrInfo *TII = BB->getParent()->getSubtarget().getInstrInfo();
18751 DebugLoc DL = MI->getDebugLoc();
18753 // To "insert" a SELECT_CC instruction, we actually have to insert the
18754 // diamond control-flow pattern. The incoming instruction knows the
18755 // destination vreg to set, the condition code register to branch on, the
18756 // true/false values to select between, and a branch opcode to use.
18757 const BasicBlock *LLVM_BB = BB->getBasicBlock();
18758 MachineFunction::iterator It = BB;
18764 // cmpTY ccX, r1, r2
18766 // fallthrough --> copy0MBB
18767 MachineBasicBlock *thisMBB = BB;
18768 MachineFunction *F = BB->getParent();
18769 MachineBasicBlock *copy0MBB = F->CreateMachineBasicBlock(LLVM_BB);
18770 MachineBasicBlock *sinkMBB = F->CreateMachineBasicBlock(LLVM_BB);
18771 F->insert(It, copy0MBB);
18772 F->insert(It, sinkMBB);
18774 // If the EFLAGS register isn't dead in the terminator, then claim that it's
18775 // live into the sink and copy blocks.
18776 const TargetRegisterInfo *TRI =
18777 BB->getParent()->getSubtarget().getRegisterInfo();
18778 if (!MI->killsRegister(X86::EFLAGS) &&
18779 !checkAndUpdateEFLAGSKill(MI, BB, TRI)) {
18780 copy0MBB->addLiveIn(X86::EFLAGS);
18781 sinkMBB->addLiveIn(X86::EFLAGS);
18784 // Transfer the remainder of BB and its successor edges to sinkMBB.
18785 sinkMBB->splice(sinkMBB->begin(), BB,
18786 std::next(MachineBasicBlock::iterator(MI)), BB->end());
18787 sinkMBB->transferSuccessorsAndUpdatePHIs(BB);
18789 // Add the true and fallthrough blocks as its successors.
18790 BB->addSuccessor(copy0MBB);
18791 BB->addSuccessor(sinkMBB);
18793 // Create the conditional branch instruction.
18795 X86::GetCondBranchFromCond((X86::CondCode)MI->getOperand(3).getImm());
18796 BuildMI(BB, DL, TII->get(Opc)).addMBB(sinkMBB);
18799 // %FalseValue = ...
18800 // # fallthrough to sinkMBB
18801 copy0MBB->addSuccessor(sinkMBB);
18804 // %Result = phi [ %FalseValue, copy0MBB ], [ %TrueValue, thisMBB ]
18806 BuildMI(*sinkMBB, sinkMBB->begin(), DL,
18807 TII->get(X86::PHI), MI->getOperand(0).getReg())
18808 .addReg(MI->getOperand(1).getReg()).addMBB(copy0MBB)
18809 .addReg(MI->getOperand(2).getReg()).addMBB(thisMBB);
18811 MI->eraseFromParent(); // The pseudo instruction is gone now.
18815 MachineBasicBlock *
18816 X86TargetLowering::EmitLoweredSegAlloca(MachineInstr *MI, MachineBasicBlock *BB,
18817 bool Is64Bit) const {
18818 MachineFunction *MF = BB->getParent();
18819 const TargetInstrInfo *TII = MF->getSubtarget().getInstrInfo();
18820 DebugLoc DL = MI->getDebugLoc();
18821 const BasicBlock *LLVM_BB = BB->getBasicBlock();
18823 assert(MF->shouldSplitStack());
18825 unsigned TlsReg = Is64Bit ? X86::FS : X86::GS;
18826 unsigned TlsOffset = Is64Bit ? 0x70 : 0x30;
18829 // ... [Till the alloca]
18830 // If stacklet is not large enough, jump to mallocMBB
18833 // Allocate by subtracting from RSP
18834 // Jump to continueMBB
18837 // Allocate by call to runtime
18841 // [rest of original BB]
18844 MachineBasicBlock *mallocMBB = MF->CreateMachineBasicBlock(LLVM_BB);
18845 MachineBasicBlock *bumpMBB = MF->CreateMachineBasicBlock(LLVM_BB);
18846 MachineBasicBlock *continueMBB = MF->CreateMachineBasicBlock(LLVM_BB);
18848 MachineRegisterInfo &MRI = MF->getRegInfo();
18849 const TargetRegisterClass *AddrRegClass =
18850 getRegClassFor(Is64Bit ? MVT::i64:MVT::i32);
18852 unsigned mallocPtrVReg = MRI.createVirtualRegister(AddrRegClass),
18853 bumpSPPtrVReg = MRI.createVirtualRegister(AddrRegClass),
18854 tmpSPVReg = MRI.createVirtualRegister(AddrRegClass),
18855 SPLimitVReg = MRI.createVirtualRegister(AddrRegClass),
18856 sizeVReg = MI->getOperand(1).getReg(),
18857 physSPReg = Is64Bit ? X86::RSP : X86::ESP;
18859 MachineFunction::iterator MBBIter = BB;
18862 MF->insert(MBBIter, bumpMBB);
18863 MF->insert(MBBIter, mallocMBB);
18864 MF->insert(MBBIter, continueMBB);
18866 continueMBB->splice(continueMBB->begin(), BB,
18867 std::next(MachineBasicBlock::iterator(MI)), BB->end());
18868 continueMBB->transferSuccessorsAndUpdatePHIs(BB);
18870 // Add code to the main basic block to check if the stack limit has been hit,
18871 // and if so, jump to mallocMBB otherwise to bumpMBB.
18872 BuildMI(BB, DL, TII->get(TargetOpcode::COPY), tmpSPVReg).addReg(physSPReg);
18873 BuildMI(BB, DL, TII->get(Is64Bit ? X86::SUB64rr:X86::SUB32rr), SPLimitVReg)
18874 .addReg(tmpSPVReg).addReg(sizeVReg);
18875 BuildMI(BB, DL, TII->get(Is64Bit ? X86::CMP64mr:X86::CMP32mr))
18876 .addReg(0).addImm(1).addReg(0).addImm(TlsOffset).addReg(TlsReg)
18877 .addReg(SPLimitVReg);
18878 BuildMI(BB, DL, TII->get(X86::JG_4)).addMBB(mallocMBB);
18880 // bumpMBB simply decreases the stack pointer, since we know the current
18881 // stacklet has enough space.
18882 BuildMI(bumpMBB, DL, TII->get(TargetOpcode::COPY), physSPReg)
18883 .addReg(SPLimitVReg);
18884 BuildMI(bumpMBB, DL, TII->get(TargetOpcode::COPY), bumpSPPtrVReg)
18885 .addReg(SPLimitVReg);
18886 BuildMI(bumpMBB, DL, TII->get(X86::JMP_4)).addMBB(continueMBB);
18888 // Calls into a routine in libgcc to allocate more space from the heap.
18889 const uint32_t *RegMask = MF->getTarget()
18890 .getSubtargetImpl()
18891 ->getRegisterInfo()
18892 ->getCallPreservedMask(CallingConv::C);
18894 BuildMI(mallocMBB, DL, TII->get(X86::MOV64rr), X86::RDI)
18896 BuildMI(mallocMBB, DL, TII->get(X86::CALL64pcrel32))
18897 .addExternalSymbol("__morestack_allocate_stack_space")
18898 .addRegMask(RegMask)
18899 .addReg(X86::RDI, RegState::Implicit)
18900 .addReg(X86::RAX, RegState::ImplicitDefine);
18902 BuildMI(mallocMBB, DL, TII->get(X86::SUB32ri), physSPReg).addReg(physSPReg)
18904 BuildMI(mallocMBB, DL, TII->get(X86::PUSH32r)).addReg(sizeVReg);
18905 BuildMI(mallocMBB, DL, TII->get(X86::CALLpcrel32))
18906 .addExternalSymbol("__morestack_allocate_stack_space")
18907 .addRegMask(RegMask)
18908 .addReg(X86::EAX, RegState::ImplicitDefine);
18912 BuildMI(mallocMBB, DL, TII->get(X86::ADD32ri), physSPReg).addReg(physSPReg)
18915 BuildMI(mallocMBB, DL, TII->get(TargetOpcode::COPY), mallocPtrVReg)
18916 .addReg(Is64Bit ? X86::RAX : X86::EAX);
18917 BuildMI(mallocMBB, DL, TII->get(X86::JMP_4)).addMBB(continueMBB);
18919 // Set up the CFG correctly.
18920 BB->addSuccessor(bumpMBB);
18921 BB->addSuccessor(mallocMBB);
18922 mallocMBB->addSuccessor(continueMBB);
18923 bumpMBB->addSuccessor(continueMBB);
18925 // Take care of the PHI nodes.
18926 BuildMI(*continueMBB, continueMBB->begin(), DL, TII->get(X86::PHI),
18927 MI->getOperand(0).getReg())
18928 .addReg(mallocPtrVReg).addMBB(mallocMBB)
18929 .addReg(bumpSPPtrVReg).addMBB(bumpMBB);
18931 // Delete the original pseudo instruction.
18932 MI->eraseFromParent();
18935 return continueMBB;
18938 MachineBasicBlock *
18939 X86TargetLowering::EmitLoweredWinAlloca(MachineInstr *MI,
18940 MachineBasicBlock *BB) const {
18941 const TargetInstrInfo *TII = BB->getParent()->getSubtarget().getInstrInfo();
18942 DebugLoc DL = MI->getDebugLoc();
18944 assert(!Subtarget->isTargetMacho());
18946 // The lowering is pretty easy: we're just emitting the call to _alloca. The
18947 // non-trivial part is impdef of ESP.
18949 if (Subtarget->isTargetWin64()) {
18950 if (Subtarget->isTargetCygMing()) {
18951 // ___chkstk(Mingw64):
18952 // Clobbers R10, R11, RAX and EFLAGS.
18954 BuildMI(*BB, MI, DL, TII->get(X86::W64ALLOCA))
18955 .addExternalSymbol("___chkstk")
18956 .addReg(X86::RAX, RegState::Implicit)
18957 .addReg(X86::RSP, RegState::Implicit)
18958 .addReg(X86::RAX, RegState::Define | RegState::Implicit)
18959 .addReg(X86::RSP, RegState::Define | RegState::Implicit)
18960 .addReg(X86::EFLAGS, RegState::Define | RegState::Implicit);
18962 // __chkstk(MSVCRT): does not update stack pointer.
18963 // Clobbers R10, R11 and EFLAGS.
18964 BuildMI(*BB, MI, DL, TII->get(X86::W64ALLOCA))
18965 .addExternalSymbol("__chkstk")
18966 .addReg(X86::RAX, RegState::Implicit)
18967 .addReg(X86::EFLAGS, RegState::Define | RegState::Implicit);
18968 // RAX has the offset to be subtracted from RSP.
18969 BuildMI(*BB, MI, DL, TII->get(X86::SUB64rr), X86::RSP)
18974 const char *StackProbeSymbol =
18975 Subtarget->isTargetKnownWindowsMSVC() ? "_chkstk" : "_alloca";
18977 BuildMI(*BB, MI, DL, TII->get(X86::CALLpcrel32))
18978 .addExternalSymbol(StackProbeSymbol)
18979 .addReg(X86::EAX, RegState::Implicit)
18980 .addReg(X86::ESP, RegState::Implicit)
18981 .addReg(X86::EAX, RegState::Define | RegState::Implicit)
18982 .addReg(X86::ESP, RegState::Define | RegState::Implicit)
18983 .addReg(X86::EFLAGS, RegState::Define | RegState::Implicit);
18986 MI->eraseFromParent(); // The pseudo instruction is gone now.
18990 MachineBasicBlock *
18991 X86TargetLowering::EmitLoweredTLSCall(MachineInstr *MI,
18992 MachineBasicBlock *BB) const {
18993 // This is pretty easy. We're taking the value that we received from
18994 // our load from the relocation, sticking it in either RDI (x86-64)
18995 // or EAX and doing an indirect call. The return value will then
18996 // be in the normal return register.
18997 MachineFunction *F = BB->getParent();
18998 const X86InstrInfo *TII =
18999 static_cast<const X86InstrInfo *>(F->getSubtarget().getInstrInfo());
19000 DebugLoc DL = MI->getDebugLoc();
19002 assert(Subtarget->isTargetDarwin() && "Darwin only instr emitted?");
19003 assert(MI->getOperand(3).isGlobal() && "This should be a global");
19005 // Get a register mask for the lowered call.
19006 // FIXME: The 32-bit calls have non-standard calling conventions. Use a
19007 // proper register mask.
19008 const uint32_t *RegMask = F->getTarget()
19009 .getSubtargetImpl()
19010 ->getRegisterInfo()
19011 ->getCallPreservedMask(CallingConv::C);
19012 if (Subtarget->is64Bit()) {
19013 MachineInstrBuilder MIB = BuildMI(*BB, MI, DL,
19014 TII->get(X86::MOV64rm), X86::RDI)
19016 .addImm(0).addReg(0)
19017 .addGlobalAddress(MI->getOperand(3).getGlobal(), 0,
19018 MI->getOperand(3).getTargetFlags())
19020 MIB = BuildMI(*BB, MI, DL, TII->get(X86::CALL64m));
19021 addDirectMem(MIB, X86::RDI);
19022 MIB.addReg(X86::RAX, RegState::ImplicitDefine).addRegMask(RegMask);
19023 } else if (F->getTarget().getRelocationModel() != Reloc::PIC_) {
19024 MachineInstrBuilder MIB = BuildMI(*BB, MI, DL,
19025 TII->get(X86::MOV32rm), X86::EAX)
19027 .addImm(0).addReg(0)
19028 .addGlobalAddress(MI->getOperand(3).getGlobal(), 0,
19029 MI->getOperand(3).getTargetFlags())
19031 MIB = BuildMI(*BB, MI, DL, TII->get(X86::CALL32m));
19032 addDirectMem(MIB, X86::EAX);
19033 MIB.addReg(X86::EAX, RegState::ImplicitDefine).addRegMask(RegMask);
19035 MachineInstrBuilder MIB = BuildMI(*BB, MI, DL,
19036 TII->get(X86::MOV32rm), X86::EAX)
19037 .addReg(TII->getGlobalBaseReg(F))
19038 .addImm(0).addReg(0)
19039 .addGlobalAddress(MI->getOperand(3).getGlobal(), 0,
19040 MI->getOperand(3).getTargetFlags())
19042 MIB = BuildMI(*BB, MI, DL, TII->get(X86::CALL32m));
19043 addDirectMem(MIB, X86::EAX);
19044 MIB.addReg(X86::EAX, RegState::ImplicitDefine).addRegMask(RegMask);
19047 MI->eraseFromParent(); // The pseudo instruction is gone now.
19051 MachineBasicBlock *
19052 X86TargetLowering::emitEHSjLjSetJmp(MachineInstr *MI,
19053 MachineBasicBlock *MBB) const {
19054 DebugLoc DL = MI->getDebugLoc();
19055 MachineFunction *MF = MBB->getParent();
19056 const TargetInstrInfo *TII = MF->getSubtarget().getInstrInfo();
19057 MachineRegisterInfo &MRI = MF->getRegInfo();
19059 const BasicBlock *BB = MBB->getBasicBlock();
19060 MachineFunction::iterator I = MBB;
19063 // Memory Reference
19064 MachineInstr::mmo_iterator MMOBegin = MI->memoperands_begin();
19065 MachineInstr::mmo_iterator MMOEnd = MI->memoperands_end();
19068 unsigned MemOpndSlot = 0;
19070 unsigned CurOp = 0;
19072 DstReg = MI->getOperand(CurOp++).getReg();
19073 const TargetRegisterClass *RC = MRI.getRegClass(DstReg);
19074 assert(RC->hasType(MVT::i32) && "Invalid destination!");
19075 unsigned mainDstReg = MRI.createVirtualRegister(RC);
19076 unsigned restoreDstReg = MRI.createVirtualRegister(RC);
19078 MemOpndSlot = CurOp;
19080 MVT PVT = getPointerTy();
19081 assert((PVT == MVT::i64 || PVT == MVT::i32) &&
19082 "Invalid Pointer Size!");
19084 // For v = setjmp(buf), we generate
19087 // buf[LabelOffset] = restoreMBB
19088 // SjLjSetup restoreMBB
19094 // v = phi(main, restore)
19099 MachineBasicBlock *thisMBB = MBB;
19100 MachineBasicBlock *mainMBB = MF->CreateMachineBasicBlock(BB);
19101 MachineBasicBlock *sinkMBB = MF->CreateMachineBasicBlock(BB);
19102 MachineBasicBlock *restoreMBB = MF->CreateMachineBasicBlock(BB);
19103 MF->insert(I, mainMBB);
19104 MF->insert(I, sinkMBB);
19105 MF->push_back(restoreMBB);
19107 MachineInstrBuilder MIB;
19109 // Transfer the remainder of BB and its successor edges to sinkMBB.
19110 sinkMBB->splice(sinkMBB->begin(), MBB,
19111 std::next(MachineBasicBlock::iterator(MI)), MBB->end());
19112 sinkMBB->transferSuccessorsAndUpdatePHIs(MBB);
19115 unsigned PtrStoreOpc = 0;
19116 unsigned LabelReg = 0;
19117 const int64_t LabelOffset = 1 * PVT.getStoreSize();
19118 Reloc::Model RM = MF->getTarget().getRelocationModel();
19119 bool UseImmLabel = (MF->getTarget().getCodeModel() == CodeModel::Small) &&
19120 (RM == Reloc::Static || RM == Reloc::DynamicNoPIC);
19122 // Prepare IP either in reg or imm.
19123 if (!UseImmLabel) {
19124 PtrStoreOpc = (PVT == MVT::i64) ? X86::MOV64mr : X86::MOV32mr;
19125 const TargetRegisterClass *PtrRC = getRegClassFor(PVT);
19126 LabelReg = MRI.createVirtualRegister(PtrRC);
19127 if (Subtarget->is64Bit()) {
19128 MIB = BuildMI(*thisMBB, MI, DL, TII->get(X86::LEA64r), LabelReg)
19132 .addMBB(restoreMBB)
19135 const X86InstrInfo *XII = static_cast<const X86InstrInfo*>(TII);
19136 MIB = BuildMI(*thisMBB, MI, DL, TII->get(X86::LEA32r), LabelReg)
19137 .addReg(XII->getGlobalBaseReg(MF))
19140 .addMBB(restoreMBB, Subtarget->ClassifyBlockAddressReference())
19144 PtrStoreOpc = (PVT == MVT::i64) ? X86::MOV64mi32 : X86::MOV32mi;
19146 MIB = BuildMI(*thisMBB, MI, DL, TII->get(PtrStoreOpc));
19147 for (unsigned i = 0; i < X86::AddrNumOperands; ++i) {
19148 if (i == X86::AddrDisp)
19149 MIB.addDisp(MI->getOperand(MemOpndSlot + i), LabelOffset);
19151 MIB.addOperand(MI->getOperand(MemOpndSlot + i));
19154 MIB.addReg(LabelReg);
19156 MIB.addMBB(restoreMBB);
19157 MIB.setMemRefs(MMOBegin, MMOEnd);
19159 MIB = BuildMI(*thisMBB, MI, DL, TII->get(X86::EH_SjLj_Setup))
19160 .addMBB(restoreMBB);
19162 const X86RegisterInfo *RegInfo = static_cast<const X86RegisterInfo *>(
19163 MF->getSubtarget().getRegisterInfo());
19164 MIB.addRegMask(RegInfo->getNoPreservedMask());
19165 thisMBB->addSuccessor(mainMBB);
19166 thisMBB->addSuccessor(restoreMBB);
19170 BuildMI(mainMBB, DL, TII->get(X86::MOV32r0), mainDstReg);
19171 mainMBB->addSuccessor(sinkMBB);
19174 BuildMI(*sinkMBB, sinkMBB->begin(), DL,
19175 TII->get(X86::PHI), DstReg)
19176 .addReg(mainDstReg).addMBB(mainMBB)
19177 .addReg(restoreDstReg).addMBB(restoreMBB);
19180 BuildMI(restoreMBB, DL, TII->get(X86::MOV32ri), restoreDstReg).addImm(1);
19181 BuildMI(restoreMBB, DL, TII->get(X86::JMP_4)).addMBB(sinkMBB);
19182 restoreMBB->addSuccessor(sinkMBB);
19184 MI->eraseFromParent();
19188 MachineBasicBlock *
19189 X86TargetLowering::emitEHSjLjLongJmp(MachineInstr *MI,
19190 MachineBasicBlock *MBB) const {
19191 DebugLoc DL = MI->getDebugLoc();
19192 MachineFunction *MF = MBB->getParent();
19193 const TargetInstrInfo *TII = MF->getSubtarget().getInstrInfo();
19194 MachineRegisterInfo &MRI = MF->getRegInfo();
19196 // Memory Reference
19197 MachineInstr::mmo_iterator MMOBegin = MI->memoperands_begin();
19198 MachineInstr::mmo_iterator MMOEnd = MI->memoperands_end();
19200 MVT PVT = getPointerTy();
19201 assert((PVT == MVT::i64 || PVT == MVT::i32) &&
19202 "Invalid Pointer Size!");
19204 const TargetRegisterClass *RC =
19205 (PVT == MVT::i64) ? &X86::GR64RegClass : &X86::GR32RegClass;
19206 unsigned Tmp = MRI.createVirtualRegister(RC);
19207 // Since FP is only updated here but NOT referenced, it's treated as GPR.
19208 const X86RegisterInfo *RegInfo = static_cast<const X86RegisterInfo *>(
19209 MF->getSubtarget().getRegisterInfo());
19210 unsigned FP = (PVT == MVT::i64) ? X86::RBP : X86::EBP;
19211 unsigned SP = RegInfo->getStackRegister();
19213 MachineInstrBuilder MIB;
19215 const int64_t LabelOffset = 1 * PVT.getStoreSize();
19216 const int64_t SPOffset = 2 * PVT.getStoreSize();
19218 unsigned PtrLoadOpc = (PVT == MVT::i64) ? X86::MOV64rm : X86::MOV32rm;
19219 unsigned IJmpOpc = (PVT == MVT::i64) ? X86::JMP64r : X86::JMP32r;
19222 MIB = BuildMI(*MBB, MI, DL, TII->get(PtrLoadOpc), FP);
19223 for (unsigned i = 0; i < X86::AddrNumOperands; ++i)
19224 MIB.addOperand(MI->getOperand(i));
19225 MIB.setMemRefs(MMOBegin, MMOEnd);
19227 MIB = BuildMI(*MBB, MI, DL, TII->get(PtrLoadOpc), Tmp);
19228 for (unsigned i = 0; i < X86::AddrNumOperands; ++i) {
19229 if (i == X86::AddrDisp)
19230 MIB.addDisp(MI->getOperand(i), LabelOffset);
19232 MIB.addOperand(MI->getOperand(i));
19234 MIB.setMemRefs(MMOBegin, MMOEnd);
19236 MIB = BuildMI(*MBB, MI, DL, TII->get(PtrLoadOpc), SP);
19237 for (unsigned i = 0; i < X86::AddrNumOperands; ++i) {
19238 if (i == X86::AddrDisp)
19239 MIB.addDisp(MI->getOperand(i), SPOffset);
19241 MIB.addOperand(MI->getOperand(i));
19243 MIB.setMemRefs(MMOBegin, MMOEnd);
19245 BuildMI(*MBB, MI, DL, TII->get(IJmpOpc)).addReg(Tmp);
19247 MI->eraseFromParent();
19251 // Replace 213-type (isel default) FMA3 instructions with 231-type for
19252 // accumulator loops. Writing back to the accumulator allows the coalescer
19253 // to remove extra copies in the loop.
19254 MachineBasicBlock *
19255 X86TargetLowering::emitFMA3Instr(MachineInstr *MI,
19256 MachineBasicBlock *MBB) const {
19257 MachineOperand &AddendOp = MI->getOperand(3);
19259 // Bail out early if the addend isn't a register - we can't switch these.
19260 if (!AddendOp.isReg())
19263 MachineFunction &MF = *MBB->getParent();
19264 MachineRegisterInfo &MRI = MF.getRegInfo();
19266 // Check whether the addend is defined by a PHI:
19267 assert(MRI.hasOneDef(AddendOp.getReg()) && "Multiple defs in SSA?");
19268 MachineInstr &AddendDef = *MRI.def_instr_begin(AddendOp.getReg());
19269 if (!AddendDef.isPHI())
19272 // Look for the following pattern:
19274 // %addend = phi [%entry, 0], [%loop, %result]
19276 // %result<tied1> = FMA213 %m2<tied0>, %m1, %addend
19280 // %addend = phi [%entry, 0], [%loop, %result]
19282 // %result<tied1> = FMA231 %addend<tied0>, %m1, %m2
19284 for (unsigned i = 1, e = AddendDef.getNumOperands(); i < e; i += 2) {
19285 assert(AddendDef.getOperand(i).isReg());
19286 MachineOperand PHISrcOp = AddendDef.getOperand(i);
19287 MachineInstr &PHISrcInst = *MRI.def_instr_begin(PHISrcOp.getReg());
19288 if (&PHISrcInst == MI) {
19289 // Found a matching instruction.
19290 unsigned NewFMAOpc = 0;
19291 switch (MI->getOpcode()) {
19292 case X86::VFMADDPDr213r: NewFMAOpc = X86::VFMADDPDr231r; break;
19293 case X86::VFMADDPSr213r: NewFMAOpc = X86::VFMADDPSr231r; break;
19294 case X86::VFMADDSDr213r: NewFMAOpc = X86::VFMADDSDr231r; break;
19295 case X86::VFMADDSSr213r: NewFMAOpc = X86::VFMADDSSr231r; break;
19296 case X86::VFMSUBPDr213r: NewFMAOpc = X86::VFMSUBPDr231r; break;
19297 case X86::VFMSUBPSr213r: NewFMAOpc = X86::VFMSUBPSr231r; break;
19298 case X86::VFMSUBSDr213r: NewFMAOpc = X86::VFMSUBSDr231r; break;
19299 case X86::VFMSUBSSr213r: NewFMAOpc = X86::VFMSUBSSr231r; break;
19300 case X86::VFNMADDPDr213r: NewFMAOpc = X86::VFNMADDPDr231r; break;
19301 case X86::VFNMADDPSr213r: NewFMAOpc = X86::VFNMADDPSr231r; break;
19302 case X86::VFNMADDSDr213r: NewFMAOpc = X86::VFNMADDSDr231r; break;
19303 case X86::VFNMADDSSr213r: NewFMAOpc = X86::VFNMADDSSr231r; break;
19304 case X86::VFNMSUBPDr213r: NewFMAOpc = X86::VFNMSUBPDr231r; break;
19305 case X86::VFNMSUBPSr213r: NewFMAOpc = X86::VFNMSUBPSr231r; break;
19306 case X86::VFNMSUBSDr213r: NewFMAOpc = X86::VFNMSUBSDr231r; break;
19307 case X86::VFNMSUBSSr213r: NewFMAOpc = X86::VFNMSUBSSr231r; break;
19308 case X86::VFMADDPDr213rY: NewFMAOpc = X86::VFMADDPDr231rY; break;
19309 case X86::VFMADDPSr213rY: NewFMAOpc = X86::VFMADDPSr231rY; break;
19310 case X86::VFMSUBPDr213rY: NewFMAOpc = X86::VFMSUBPDr231rY; break;
19311 case X86::VFMSUBPSr213rY: NewFMAOpc = X86::VFMSUBPSr231rY; break;
19312 case X86::VFNMADDPDr213rY: NewFMAOpc = X86::VFNMADDPDr231rY; break;
19313 case X86::VFNMADDPSr213rY: NewFMAOpc = X86::VFNMADDPSr231rY; break;
19314 case X86::VFNMSUBPDr213rY: NewFMAOpc = X86::VFNMSUBPDr231rY; break;
19315 case X86::VFNMSUBPSr213rY: NewFMAOpc = X86::VFNMSUBPSr231rY; break;
19316 default: llvm_unreachable("Unrecognized FMA variant.");
19319 const TargetInstrInfo &TII = *MF.getSubtarget().getInstrInfo();
19320 MachineInstrBuilder MIB =
19321 BuildMI(MF, MI->getDebugLoc(), TII.get(NewFMAOpc))
19322 .addOperand(MI->getOperand(0))
19323 .addOperand(MI->getOperand(3))
19324 .addOperand(MI->getOperand(2))
19325 .addOperand(MI->getOperand(1));
19326 MBB->insert(MachineBasicBlock::iterator(MI), MIB);
19327 MI->eraseFromParent();
19334 MachineBasicBlock *
19335 X86TargetLowering::EmitInstrWithCustomInserter(MachineInstr *MI,
19336 MachineBasicBlock *BB) const {
19337 switch (MI->getOpcode()) {
19338 default: llvm_unreachable("Unexpected instr type to insert");
19339 case X86::TAILJMPd64:
19340 case X86::TAILJMPr64:
19341 case X86::TAILJMPm64:
19342 llvm_unreachable("TAILJMP64 would not be touched here.");
19343 case X86::TCRETURNdi64:
19344 case X86::TCRETURNri64:
19345 case X86::TCRETURNmi64:
19347 case X86::WIN_ALLOCA:
19348 return EmitLoweredWinAlloca(MI, BB);
19349 case X86::SEG_ALLOCA_32:
19350 return EmitLoweredSegAlloca(MI, BB, false);
19351 case X86::SEG_ALLOCA_64:
19352 return EmitLoweredSegAlloca(MI, BB, true);
19353 case X86::TLSCall_32:
19354 case X86::TLSCall_64:
19355 return EmitLoweredTLSCall(MI, BB);
19356 case X86::CMOV_GR8:
19357 case X86::CMOV_FR32:
19358 case X86::CMOV_FR64:
19359 case X86::CMOV_V4F32:
19360 case X86::CMOV_V2F64:
19361 case X86::CMOV_V2I64:
19362 case X86::CMOV_V8F32:
19363 case X86::CMOV_V4F64:
19364 case X86::CMOV_V4I64:
19365 case X86::CMOV_V16F32:
19366 case X86::CMOV_V8F64:
19367 case X86::CMOV_V8I64:
19368 case X86::CMOV_GR16:
19369 case X86::CMOV_GR32:
19370 case X86::CMOV_RFP32:
19371 case X86::CMOV_RFP64:
19372 case X86::CMOV_RFP80:
19373 return EmitLoweredSelect(MI, BB);
19375 case X86::FP32_TO_INT16_IN_MEM:
19376 case X86::FP32_TO_INT32_IN_MEM:
19377 case X86::FP32_TO_INT64_IN_MEM:
19378 case X86::FP64_TO_INT16_IN_MEM:
19379 case X86::FP64_TO_INT32_IN_MEM:
19380 case X86::FP64_TO_INT64_IN_MEM:
19381 case X86::FP80_TO_INT16_IN_MEM:
19382 case X86::FP80_TO_INT32_IN_MEM:
19383 case X86::FP80_TO_INT64_IN_MEM: {
19384 MachineFunction *F = BB->getParent();
19385 const TargetInstrInfo *TII = F->getSubtarget().getInstrInfo();
19386 DebugLoc DL = MI->getDebugLoc();
19388 // Change the floating point control register to use "round towards zero"
19389 // mode when truncating to an integer value.
19390 int CWFrameIdx = F->getFrameInfo()->CreateStackObject(2, 2, false);
19391 addFrameReference(BuildMI(*BB, MI, DL,
19392 TII->get(X86::FNSTCW16m)), CWFrameIdx);
19394 // Load the old value of the high byte of the control word...
19396 F->getRegInfo().createVirtualRegister(&X86::GR16RegClass);
19397 addFrameReference(BuildMI(*BB, MI, DL, TII->get(X86::MOV16rm), OldCW),
19400 // Set the high part to be round to zero...
19401 addFrameReference(BuildMI(*BB, MI, DL, TII->get(X86::MOV16mi)), CWFrameIdx)
19404 // Reload the modified control word now...
19405 addFrameReference(BuildMI(*BB, MI, DL,
19406 TII->get(X86::FLDCW16m)), CWFrameIdx);
19408 // Restore the memory image of control word to original value
19409 addFrameReference(BuildMI(*BB, MI, DL, TII->get(X86::MOV16mr)), CWFrameIdx)
19412 // Get the X86 opcode to use.
19414 switch (MI->getOpcode()) {
19415 default: llvm_unreachable("illegal opcode!");
19416 case X86::FP32_TO_INT16_IN_MEM: Opc = X86::IST_Fp16m32; break;
19417 case X86::FP32_TO_INT32_IN_MEM: Opc = X86::IST_Fp32m32; break;
19418 case X86::FP32_TO_INT64_IN_MEM: Opc = X86::IST_Fp64m32; break;
19419 case X86::FP64_TO_INT16_IN_MEM: Opc = X86::IST_Fp16m64; break;
19420 case X86::FP64_TO_INT32_IN_MEM: Opc = X86::IST_Fp32m64; break;
19421 case X86::FP64_TO_INT64_IN_MEM: Opc = X86::IST_Fp64m64; break;
19422 case X86::FP80_TO_INT16_IN_MEM: Opc = X86::IST_Fp16m80; break;
19423 case X86::FP80_TO_INT32_IN_MEM: Opc = X86::IST_Fp32m80; break;
19424 case X86::FP80_TO_INT64_IN_MEM: Opc = X86::IST_Fp64m80; break;
19428 MachineOperand &Op = MI->getOperand(0);
19430 AM.BaseType = X86AddressMode::RegBase;
19431 AM.Base.Reg = Op.getReg();
19433 AM.BaseType = X86AddressMode::FrameIndexBase;
19434 AM.Base.FrameIndex = Op.getIndex();
19436 Op = MI->getOperand(1);
19438 AM.Scale = Op.getImm();
19439 Op = MI->getOperand(2);
19441 AM.IndexReg = Op.getImm();
19442 Op = MI->getOperand(3);
19443 if (Op.isGlobal()) {
19444 AM.GV = Op.getGlobal();
19446 AM.Disp = Op.getImm();
19448 addFullAddress(BuildMI(*BB, MI, DL, TII->get(Opc)), AM)
19449 .addReg(MI->getOperand(X86::AddrNumOperands).getReg());
19451 // Reload the original control word now.
19452 addFrameReference(BuildMI(*BB, MI, DL,
19453 TII->get(X86::FLDCW16m)), CWFrameIdx);
19455 MI->eraseFromParent(); // The pseudo instruction is gone now.
19458 // String/text processing lowering.
19459 case X86::PCMPISTRM128REG:
19460 case X86::VPCMPISTRM128REG:
19461 case X86::PCMPISTRM128MEM:
19462 case X86::VPCMPISTRM128MEM:
19463 case X86::PCMPESTRM128REG:
19464 case X86::VPCMPESTRM128REG:
19465 case X86::PCMPESTRM128MEM:
19466 case X86::VPCMPESTRM128MEM:
19467 assert(Subtarget->hasSSE42() &&
19468 "Target must have SSE4.2 or AVX features enabled");
19469 return EmitPCMPSTRM(MI, BB, BB->getParent()->getSubtarget().getInstrInfo());
19471 // String/text processing lowering.
19472 case X86::PCMPISTRIREG:
19473 case X86::VPCMPISTRIREG:
19474 case X86::PCMPISTRIMEM:
19475 case X86::VPCMPISTRIMEM:
19476 case X86::PCMPESTRIREG:
19477 case X86::VPCMPESTRIREG:
19478 case X86::PCMPESTRIMEM:
19479 case X86::VPCMPESTRIMEM:
19480 assert(Subtarget->hasSSE42() &&
19481 "Target must have SSE4.2 or AVX features enabled");
19482 return EmitPCMPSTRI(MI, BB, BB->getParent()->getSubtarget().getInstrInfo());
19484 // Thread synchronization.
19486 return EmitMonitor(MI, BB, BB->getParent()->getSubtarget().getInstrInfo(),
19491 return EmitXBegin(MI, BB, BB->getParent()->getSubtarget().getInstrInfo());
19493 case X86::VASTART_SAVE_XMM_REGS:
19494 return EmitVAStartSaveXMMRegsWithCustomInserter(MI, BB);
19496 case X86::VAARG_64:
19497 return EmitVAARG64WithCustomInserter(MI, BB);
19499 case X86::EH_SjLj_SetJmp32:
19500 case X86::EH_SjLj_SetJmp64:
19501 return emitEHSjLjSetJmp(MI, BB);
19503 case X86::EH_SjLj_LongJmp32:
19504 case X86::EH_SjLj_LongJmp64:
19505 return emitEHSjLjLongJmp(MI, BB);
19507 case TargetOpcode::STACKMAP:
19508 case TargetOpcode::PATCHPOINT:
19509 return emitPatchPoint(MI, BB);
19511 case X86::VFMADDPDr213r:
19512 case X86::VFMADDPSr213r:
19513 case X86::VFMADDSDr213r:
19514 case X86::VFMADDSSr213r:
19515 case X86::VFMSUBPDr213r:
19516 case X86::VFMSUBPSr213r:
19517 case X86::VFMSUBSDr213r:
19518 case X86::VFMSUBSSr213r:
19519 case X86::VFNMADDPDr213r:
19520 case X86::VFNMADDPSr213r:
19521 case X86::VFNMADDSDr213r:
19522 case X86::VFNMADDSSr213r:
19523 case X86::VFNMSUBPDr213r:
19524 case X86::VFNMSUBPSr213r:
19525 case X86::VFNMSUBSDr213r:
19526 case X86::VFNMSUBSSr213r:
19527 case X86::VFMADDPDr213rY:
19528 case X86::VFMADDPSr213rY:
19529 case X86::VFMSUBPDr213rY:
19530 case X86::VFMSUBPSr213rY:
19531 case X86::VFNMADDPDr213rY:
19532 case X86::VFNMADDPSr213rY:
19533 case X86::VFNMSUBPDr213rY:
19534 case X86::VFNMSUBPSr213rY:
19535 return emitFMA3Instr(MI, BB);
19539 //===----------------------------------------------------------------------===//
19540 // X86 Optimization Hooks
19541 //===----------------------------------------------------------------------===//
19543 void X86TargetLowering::computeKnownBitsForTargetNode(const SDValue Op,
19546 const SelectionDAG &DAG,
19547 unsigned Depth) const {
19548 unsigned BitWidth = KnownZero.getBitWidth();
19549 unsigned Opc = Op.getOpcode();
19550 assert((Opc >= ISD::BUILTIN_OP_END ||
19551 Opc == ISD::INTRINSIC_WO_CHAIN ||
19552 Opc == ISD::INTRINSIC_W_CHAIN ||
19553 Opc == ISD::INTRINSIC_VOID) &&
19554 "Should use MaskedValueIsZero if you don't know whether Op"
19555 " is a target node!");
19557 KnownZero = KnownOne = APInt(BitWidth, 0); // Don't know anything.
19571 // These nodes' second result is a boolean.
19572 if (Op.getResNo() == 0)
19575 case X86ISD::SETCC:
19576 KnownZero |= APInt::getHighBitsSet(BitWidth, BitWidth - 1);
19578 case ISD::INTRINSIC_WO_CHAIN: {
19579 unsigned IntId = cast<ConstantSDNode>(Op.getOperand(0))->getZExtValue();
19580 unsigned NumLoBits = 0;
19583 case Intrinsic::x86_sse_movmsk_ps:
19584 case Intrinsic::x86_avx_movmsk_ps_256:
19585 case Intrinsic::x86_sse2_movmsk_pd:
19586 case Intrinsic::x86_avx_movmsk_pd_256:
19587 case Intrinsic::x86_mmx_pmovmskb:
19588 case Intrinsic::x86_sse2_pmovmskb_128:
19589 case Intrinsic::x86_avx2_pmovmskb: {
19590 // High bits of movmskp{s|d}, pmovmskb are known zero.
19592 default: llvm_unreachable("Impossible intrinsic"); // Can't reach here.
19593 case Intrinsic::x86_sse_movmsk_ps: NumLoBits = 4; break;
19594 case Intrinsic::x86_avx_movmsk_ps_256: NumLoBits = 8; break;
19595 case Intrinsic::x86_sse2_movmsk_pd: NumLoBits = 2; break;
19596 case Intrinsic::x86_avx_movmsk_pd_256: NumLoBits = 4; break;
19597 case Intrinsic::x86_mmx_pmovmskb: NumLoBits = 8; break;
19598 case Intrinsic::x86_sse2_pmovmskb_128: NumLoBits = 16; break;
19599 case Intrinsic::x86_avx2_pmovmskb: NumLoBits = 32; break;
19601 KnownZero = APInt::getHighBitsSet(BitWidth, BitWidth - NumLoBits);
19610 unsigned X86TargetLowering::ComputeNumSignBitsForTargetNode(
19612 const SelectionDAG &,
19613 unsigned Depth) const {
19614 // SETCC_CARRY sets the dest to ~0 for true or 0 for false.
19615 if (Op.getOpcode() == X86ISD::SETCC_CARRY)
19616 return Op.getValueType().getScalarType().getSizeInBits();
19622 /// isGAPlusOffset - Returns true (and the GlobalValue and the offset) if the
19623 /// node is a GlobalAddress + offset.
19624 bool X86TargetLowering::isGAPlusOffset(SDNode *N,
19625 const GlobalValue* &GA,
19626 int64_t &Offset) const {
19627 if (N->getOpcode() == X86ISD::Wrapper) {
19628 if (isa<GlobalAddressSDNode>(N->getOperand(0))) {
19629 GA = cast<GlobalAddressSDNode>(N->getOperand(0))->getGlobal();
19630 Offset = cast<GlobalAddressSDNode>(N->getOperand(0))->getOffset();
19634 return TargetLowering::isGAPlusOffset(N, GA, Offset);
19637 /// isShuffleHigh128VectorInsertLow - Checks whether the shuffle node is the
19638 /// same as extracting the high 128-bit part of 256-bit vector and then
19639 /// inserting the result into the low part of a new 256-bit vector
19640 static bool isShuffleHigh128VectorInsertLow(ShuffleVectorSDNode *SVOp) {
19641 EVT VT = SVOp->getValueType(0);
19642 unsigned NumElems = VT.getVectorNumElements();
19644 // vector_shuffle <4, 5, 6, 7, u, u, u, u> or <2, 3, u, u>
19645 for (unsigned i = 0, j = NumElems/2; i != NumElems/2; ++i, ++j)
19646 if (!isUndefOrEqual(SVOp->getMaskElt(i), j) ||
19647 SVOp->getMaskElt(j) >= 0)
19653 /// isShuffleLow128VectorInsertHigh - Checks whether the shuffle node is the
19654 /// same as extracting the low 128-bit part of 256-bit vector and then
19655 /// inserting the result into the high part of a new 256-bit vector
19656 static bool isShuffleLow128VectorInsertHigh(ShuffleVectorSDNode *SVOp) {
19657 EVT VT = SVOp->getValueType(0);
19658 unsigned NumElems = VT.getVectorNumElements();
19660 // vector_shuffle <u, u, u, u, 0, 1, 2, 3> or <u, u, 0, 1>
19661 for (unsigned i = NumElems/2, j = 0; i != NumElems; ++i, ++j)
19662 if (!isUndefOrEqual(SVOp->getMaskElt(i), j) ||
19663 SVOp->getMaskElt(j) >= 0)
19669 /// PerformShuffleCombine256 - Performs shuffle combines for 256-bit vectors.
19670 static SDValue PerformShuffleCombine256(SDNode *N, SelectionDAG &DAG,
19671 TargetLowering::DAGCombinerInfo &DCI,
19672 const X86Subtarget* Subtarget) {
19674 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(N);
19675 SDValue V1 = SVOp->getOperand(0);
19676 SDValue V2 = SVOp->getOperand(1);
19677 EVT VT = SVOp->getValueType(0);
19678 unsigned NumElems = VT.getVectorNumElements();
19680 if (V1.getOpcode() == ISD::CONCAT_VECTORS &&
19681 V2.getOpcode() == ISD::CONCAT_VECTORS) {
19685 // V UNDEF BUILD_VECTOR UNDEF
19687 // CONCAT_VECTOR CONCAT_VECTOR
19690 // RESULT: V + zero extended
19692 if (V2.getOperand(0).getOpcode() != ISD::BUILD_VECTOR ||
19693 V2.getOperand(1).getOpcode() != ISD::UNDEF ||
19694 V1.getOperand(1).getOpcode() != ISD::UNDEF)
19697 if (!ISD::isBuildVectorAllZeros(V2.getOperand(0).getNode()))
19700 // To match the shuffle mask, the first half of the mask should
19701 // be exactly the first vector, and all the rest a splat with the
19702 // first element of the second one.
19703 for (unsigned i = 0; i != NumElems/2; ++i)
19704 if (!isUndefOrEqual(SVOp->getMaskElt(i), i) ||
19705 !isUndefOrEqual(SVOp->getMaskElt(i+NumElems/2), NumElems))
19708 // If V1 is coming from a vector load then just fold to a VZEXT_LOAD.
19709 if (LoadSDNode *Ld = dyn_cast<LoadSDNode>(V1.getOperand(0))) {
19710 if (Ld->hasNUsesOfValue(1, 0)) {
19711 SDVTList Tys = DAG.getVTList(MVT::v4i64, MVT::Other);
19712 SDValue Ops[] = { Ld->getChain(), Ld->getBasePtr() };
19714 DAG.getMemIntrinsicNode(X86ISD::VZEXT_LOAD, dl, Tys, Ops,
19716 Ld->getPointerInfo(),
19717 Ld->getAlignment(),
19718 false/*isVolatile*/, true/*ReadMem*/,
19719 false/*WriteMem*/);
19721 // Make sure the newly-created LOAD is in the same position as Ld in
19722 // terms of dependency. We create a TokenFactor for Ld and ResNode,
19723 // and update uses of Ld's output chain to use the TokenFactor.
19724 if (Ld->hasAnyUseOfValue(1)) {
19725 SDValue NewChain = DAG.getNode(ISD::TokenFactor, dl, MVT::Other,
19726 SDValue(Ld, 1), SDValue(ResNode.getNode(), 1));
19727 DAG.ReplaceAllUsesOfValueWith(SDValue(Ld, 1), NewChain);
19728 DAG.UpdateNodeOperands(NewChain.getNode(), SDValue(Ld, 1),
19729 SDValue(ResNode.getNode(), 1));
19732 return DAG.getNode(ISD::BITCAST, dl, VT, ResNode);
19736 // Emit a zeroed vector and insert the desired subvector on its
19738 SDValue Zeros = getZeroVector(VT, Subtarget, DAG, dl);
19739 SDValue InsV = Insert128BitVector(Zeros, V1.getOperand(0), 0, DAG, dl);
19740 return DCI.CombineTo(N, InsV);
19743 //===--------------------------------------------------------------------===//
19744 // Combine some shuffles into subvector extracts and inserts:
19747 // vector_shuffle <4, 5, 6, 7, u, u, u, u> or <2, 3, u, u>
19748 if (isShuffleHigh128VectorInsertLow(SVOp)) {
19749 SDValue V = Extract128BitVector(V1, NumElems/2, DAG, dl);
19750 SDValue InsV = Insert128BitVector(DAG.getUNDEF(VT), V, 0, DAG, dl);
19751 return DCI.CombineTo(N, InsV);
19754 // vector_shuffle <u, u, u, u, 0, 1, 2, 3> or <u, u, 0, 1>
19755 if (isShuffleLow128VectorInsertHigh(SVOp)) {
19756 SDValue V = Extract128BitVector(V1, 0, DAG, dl);
19757 SDValue InsV = Insert128BitVector(DAG.getUNDEF(VT), V, NumElems/2, DAG, dl);
19758 return DCI.CombineTo(N, InsV);
19764 /// \brief Combine an arbitrary chain of shuffles into a single instruction if
19767 /// This is the leaf of the recursive combinine below. When we have found some
19768 /// chain of single-use x86 shuffle instructions and accumulated the combined
19769 /// shuffle mask represented by them, this will try to pattern match that mask
19770 /// into either a single instruction if there is a special purpose instruction
19771 /// for this operation, or into a PSHUFB instruction which is a fully general
19772 /// instruction but should only be used to replace chains over a certain depth.
19773 static bool combineX86ShuffleChain(SDValue Op, SDValue Root, ArrayRef<int> Mask,
19774 int Depth, bool HasPSHUFB, SelectionDAG &DAG,
19775 TargetLowering::DAGCombinerInfo &DCI,
19776 const X86Subtarget *Subtarget) {
19777 assert(!Mask.empty() && "Cannot combine an empty shuffle mask!");
19779 // Find the operand that enters the chain. Note that multiple uses are OK
19780 // here, we're not going to remove the operand we find.
19781 SDValue Input = Op.getOperand(0);
19782 while (Input.getOpcode() == ISD::BITCAST)
19783 Input = Input.getOperand(0);
19785 MVT VT = Input.getSimpleValueType();
19786 MVT RootVT = Root.getSimpleValueType();
19789 // Just remove no-op shuffle masks.
19790 if (Mask.size() == 1) {
19791 DCI.CombineTo(Root.getNode(), DAG.getNode(ISD::BITCAST, DL, RootVT, Input),
19796 // Use the float domain if the operand type is a floating point type.
19797 bool FloatDomain = VT.isFloatingPoint();
19799 // For floating point shuffles, we don't have free copies in the shuffle
19800 // instructions or the ability to load as part of the instruction, so
19801 // canonicalize their shuffles to UNPCK or MOV variants.
19803 // Note that even with AVX we prefer the PSHUFD form of shuffle for integer
19804 // vectors because it can have a load folded into it that UNPCK cannot. This
19805 // doesn't preclude something switching to the shorter encoding post-RA.
19807 if (Mask.equals(0, 0) || Mask.equals(1, 1)) {
19808 bool Lo = Mask.equals(0, 0);
19811 // Check if we have SSE3 which will let us use MOVDDUP. That instruction
19812 // is no slower than UNPCKLPD but has the option to fold the input operand
19813 // into even an unaligned memory load.
19814 if (Lo && Subtarget->hasSSE3()) {
19815 Shuffle = X86ISD::MOVDDUP;
19816 ShuffleVT = MVT::v2f64;
19818 // We have MOVLHPS and MOVHLPS throughout SSE and they encode smaller
19819 // than the UNPCK variants.
19820 Shuffle = Lo ? X86ISD::MOVLHPS : X86ISD::MOVHLPS;
19821 ShuffleVT = MVT::v4f32;
19823 if (Depth == 1 && Root->getOpcode() == Shuffle)
19824 return false; // Nothing to do!
19825 Op = DAG.getNode(ISD::BITCAST, DL, ShuffleVT, Input);
19826 DCI.AddToWorklist(Op.getNode());
19827 if (Shuffle == X86ISD::MOVDDUP)
19828 Op = DAG.getNode(Shuffle, DL, ShuffleVT, Op);
19830 Op = DAG.getNode(Shuffle, DL, ShuffleVT, Op, Op);
19831 DCI.AddToWorklist(Op.getNode());
19832 DCI.CombineTo(Root.getNode(), DAG.getNode(ISD::BITCAST, DL, RootVT, Op),
19836 if (Subtarget->hasSSE3() &&
19837 (Mask.equals(0, 0, 2, 2) || Mask.equals(1, 1, 3, 3))) {
19838 bool Lo = Mask.equals(0, 0, 2, 2);
19839 unsigned Shuffle = Lo ? X86ISD::MOVSLDUP : X86ISD::MOVSHDUP;
19840 MVT ShuffleVT = MVT::v4f32;
19841 if (Depth == 1 && Root->getOpcode() == Shuffle)
19842 return false; // Nothing to do!
19843 Op = DAG.getNode(ISD::BITCAST, DL, ShuffleVT, Input);
19844 DCI.AddToWorklist(Op.getNode());
19845 Op = DAG.getNode(Shuffle, DL, ShuffleVT, Op);
19846 DCI.AddToWorklist(Op.getNode());
19847 DCI.CombineTo(Root.getNode(), DAG.getNode(ISD::BITCAST, DL, RootVT, Op),
19851 if (Mask.equals(0, 0, 1, 1) || Mask.equals(2, 2, 3, 3)) {
19852 bool Lo = Mask.equals(0, 0, 1, 1);
19853 unsigned Shuffle = Lo ? X86ISD::UNPCKL : X86ISD::UNPCKH;
19854 MVT ShuffleVT = MVT::v4f32;
19855 if (Depth == 1 && Root->getOpcode() == Shuffle)
19856 return false; // Nothing to do!
19857 Op = DAG.getNode(ISD::BITCAST, DL, ShuffleVT, Input);
19858 DCI.AddToWorklist(Op.getNode());
19859 Op = DAG.getNode(Shuffle, DL, ShuffleVT, Op, Op);
19860 DCI.AddToWorklist(Op.getNode());
19861 DCI.CombineTo(Root.getNode(), DAG.getNode(ISD::BITCAST, DL, RootVT, Op),
19867 // We always canonicalize the 8 x i16 and 16 x i8 shuffles into their UNPCK
19868 // variants as none of these have single-instruction variants that are
19869 // superior to the UNPCK formulation.
19870 if (!FloatDomain &&
19871 (Mask.equals(0, 0, 1, 1, 2, 2, 3, 3) ||
19872 Mask.equals(4, 4, 5, 5, 6, 6, 7, 7) ||
19873 Mask.equals(0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7) ||
19874 Mask.equals(8, 8, 9, 9, 10, 10, 11, 11, 12, 12, 13, 13, 14, 14, 15,
19876 bool Lo = Mask[0] == 0;
19877 unsigned Shuffle = Lo ? X86ISD::UNPCKL : X86ISD::UNPCKH;
19878 if (Depth == 1 && Root->getOpcode() == Shuffle)
19879 return false; // Nothing to do!
19881 switch (Mask.size()) {
19883 ShuffleVT = MVT::v8i16;
19886 ShuffleVT = MVT::v16i8;
19889 llvm_unreachable("Impossible mask size!");
19891 Op = DAG.getNode(ISD::BITCAST, DL, ShuffleVT, Input);
19892 DCI.AddToWorklist(Op.getNode());
19893 Op = DAG.getNode(Shuffle, DL, ShuffleVT, Op, Op);
19894 DCI.AddToWorklist(Op.getNode());
19895 DCI.CombineTo(Root.getNode(), DAG.getNode(ISD::BITCAST, DL, RootVT, Op),
19900 // Don't try to re-form single instruction chains under any circumstances now
19901 // that we've done encoding canonicalization for them.
19905 // If we have 3 or more shuffle instructions or a chain involving PSHUFB, we
19906 // can replace them with a single PSHUFB instruction profitably. Intel's
19907 // manuals suggest only using PSHUFB if doing so replacing 5 instructions, but
19908 // in practice PSHUFB tends to be *very* fast so we're more aggressive.
19909 if ((Depth >= 3 || HasPSHUFB) && Subtarget->hasSSSE3()) {
19910 SmallVector<SDValue, 16> PSHUFBMask;
19911 assert(Mask.size() <= 16 && "Can't shuffle elements smaller than bytes!");
19912 int Ratio = 16 / Mask.size();
19913 for (unsigned i = 0; i < 16; ++i) {
19914 int M = Mask[i / Ratio] != SM_SentinelZero
19915 ? Ratio * Mask[i / Ratio] + i % Ratio
19917 PSHUFBMask.push_back(DAG.getConstant(M, MVT::i8));
19919 Op = DAG.getNode(ISD::BITCAST, DL, MVT::v16i8, Input);
19920 DCI.AddToWorklist(Op.getNode());
19921 SDValue PSHUFBMaskOp =
19922 DAG.getNode(ISD::BUILD_VECTOR, DL, MVT::v16i8, PSHUFBMask);
19923 DCI.AddToWorklist(PSHUFBMaskOp.getNode());
19924 Op = DAG.getNode(X86ISD::PSHUFB, DL, MVT::v16i8, Op, PSHUFBMaskOp);
19925 DCI.AddToWorklist(Op.getNode());
19926 DCI.CombineTo(Root.getNode(), DAG.getNode(ISD::BITCAST, DL, RootVT, Op),
19931 // Failed to find any combines.
19935 /// \brief Fully generic combining of x86 shuffle instructions.
19937 /// This should be the last combine run over the x86 shuffle instructions. Once
19938 /// they have been fully optimized, this will recursively consider all chains
19939 /// of single-use shuffle instructions, build a generic model of the cumulative
19940 /// shuffle operation, and check for simpler instructions which implement this
19941 /// operation. We use this primarily for two purposes:
19943 /// 1) Collapse generic shuffles to specialized single instructions when
19944 /// equivalent. In most cases, this is just an encoding size win, but
19945 /// sometimes we will collapse multiple generic shuffles into a single
19946 /// special-purpose shuffle.
19947 /// 2) Look for sequences of shuffle instructions with 3 or more total
19948 /// instructions, and replace them with the slightly more expensive SSSE3
19949 /// PSHUFB instruction if available. We do this as the last combining step
19950 /// to ensure we avoid using PSHUFB if we can implement the shuffle with
19951 /// a suitable short sequence of other instructions. The PHUFB will either
19952 /// use a register or have to read from memory and so is slightly (but only
19953 /// slightly) more expensive than the other shuffle instructions.
19955 /// Because this is inherently a quadratic operation (for each shuffle in
19956 /// a chain, we recurse up the chain), the depth is limited to 8 instructions.
19957 /// This should never be an issue in practice as the shuffle lowering doesn't
19958 /// produce sequences of more than 8 instructions.
19960 /// FIXME: We will currently miss some cases where the redundant shuffling
19961 /// would simplify under the threshold for PSHUFB formation because of
19962 /// combine-ordering. To fix this, we should do the redundant instruction
19963 /// combining in this recursive walk.
19964 static bool combineX86ShufflesRecursively(SDValue Op, SDValue Root,
19965 ArrayRef<int> RootMask,
19966 int Depth, bool HasPSHUFB,
19968 TargetLowering::DAGCombinerInfo &DCI,
19969 const X86Subtarget *Subtarget) {
19970 // Bound the depth of our recursive combine because this is ultimately
19971 // quadratic in nature.
19975 // Directly rip through bitcasts to find the underlying operand.
19976 while (Op.getOpcode() == ISD::BITCAST && Op.getOperand(0).hasOneUse())
19977 Op = Op.getOperand(0);
19979 MVT VT = Op.getSimpleValueType();
19980 if (!VT.isVector())
19981 return false; // Bail if we hit a non-vector.
19982 // FIXME: This routine should be taught about 256-bit shuffles, or a 256-bit
19983 // version should be added.
19984 if (VT.getSizeInBits() != 128)
19987 assert(Root.getSimpleValueType().isVector() &&
19988 "Shuffles operate on vector types!");
19989 assert(VT.getSizeInBits() == Root.getSimpleValueType().getSizeInBits() &&
19990 "Can only combine shuffles of the same vector register size.");
19992 if (!isTargetShuffle(Op.getOpcode()))
19994 SmallVector<int, 16> OpMask;
19996 bool HaveMask = getTargetShuffleMask(Op.getNode(), VT, OpMask, IsUnary);
19997 // We only can combine unary shuffles which we can decode the mask for.
19998 if (!HaveMask || !IsUnary)
20001 assert(VT.getVectorNumElements() == OpMask.size() &&
20002 "Different mask size from vector size!");
20003 assert(((RootMask.size() > OpMask.size() &&
20004 RootMask.size() % OpMask.size() == 0) ||
20005 (OpMask.size() > RootMask.size() &&
20006 OpMask.size() % RootMask.size() == 0) ||
20007 OpMask.size() == RootMask.size()) &&
20008 "The smaller number of elements must divide the larger.");
20009 int RootRatio = std::max<int>(1, OpMask.size() / RootMask.size());
20010 int OpRatio = std::max<int>(1, RootMask.size() / OpMask.size());
20011 assert(((RootRatio == 1 && OpRatio == 1) ||
20012 (RootRatio == 1) != (OpRatio == 1)) &&
20013 "Must not have a ratio for both incoming and op masks!");
20015 SmallVector<int, 16> Mask;
20016 Mask.reserve(std::max(OpMask.size(), RootMask.size()));
20018 // Merge this shuffle operation's mask into our accumulated mask. Note that
20019 // this shuffle's mask will be the first applied to the input, followed by the
20020 // root mask to get us all the way to the root value arrangement. The reason
20021 // for this order is that we are recursing up the operation chain.
20022 for (int i = 0, e = std::max(OpMask.size(), RootMask.size()); i < e; ++i) {
20023 int RootIdx = i / RootRatio;
20024 if (RootMask[RootIdx] == SM_SentinelZero) {
20025 // This is a zero-ed lane, we're done.
20026 Mask.push_back(SM_SentinelZero);
20030 int RootMaskedIdx = RootMask[RootIdx] * RootRatio + i % RootRatio;
20031 int OpIdx = RootMaskedIdx / OpRatio;
20032 if (OpMask[OpIdx] == SM_SentinelZero) {
20033 // The incoming lanes are zero, it doesn't matter which ones we are using.
20034 Mask.push_back(SM_SentinelZero);
20038 // Ok, we have non-zero lanes, map them through.
20039 Mask.push_back(OpMask[OpIdx] * OpRatio +
20040 RootMaskedIdx % OpRatio);
20043 // See if we can recurse into the operand to combine more things.
20044 switch (Op.getOpcode()) {
20045 case X86ISD::PSHUFB:
20047 case X86ISD::PSHUFD:
20048 case X86ISD::PSHUFHW:
20049 case X86ISD::PSHUFLW:
20050 if (Op.getOperand(0).hasOneUse() &&
20051 combineX86ShufflesRecursively(Op.getOperand(0), Root, Mask, Depth + 1,
20052 HasPSHUFB, DAG, DCI, Subtarget))
20056 case X86ISD::UNPCKL:
20057 case X86ISD::UNPCKH:
20058 assert(Op.getOperand(0) == Op.getOperand(1) && "We only combine unary shuffles!");
20059 // We can't check for single use, we have to check that this shuffle is the only user.
20060 if (Op->isOnlyUserOf(Op.getOperand(0).getNode()) &&
20061 combineX86ShufflesRecursively(Op.getOperand(0), Root, Mask, Depth + 1,
20062 HasPSHUFB, DAG, DCI, Subtarget))
20067 // Minor canonicalization of the accumulated shuffle mask to make it easier
20068 // to match below. All this does is detect masks with squential pairs of
20069 // elements, and shrink them to the half-width mask. It does this in a loop
20070 // so it will reduce the size of the mask to the minimal width mask which
20071 // performs an equivalent shuffle.
20072 while (Mask.size() > 1 && canWidenShuffleElements(Mask)) {
20073 for (int i = 0, e = Mask.size() / 2; i < e; ++i)
20074 Mask[i] = Mask[2 * i] / 2;
20075 Mask.resize(Mask.size() / 2);
20078 return combineX86ShuffleChain(Op, Root, Mask, Depth, HasPSHUFB, DAG, DCI,
20082 /// \brief Get the PSHUF-style mask from PSHUF node.
20084 /// This is a very minor wrapper around getTargetShuffleMask to easy forming v4
20085 /// PSHUF-style masks that can be reused with such instructions.
20086 static SmallVector<int, 4> getPSHUFShuffleMask(SDValue N) {
20087 SmallVector<int, 4> Mask;
20089 bool HaveMask = getTargetShuffleMask(N.getNode(), N.getSimpleValueType(), Mask, IsUnary);
20093 switch (N.getOpcode()) {
20094 case X86ISD::PSHUFD:
20096 case X86ISD::PSHUFLW:
20099 case X86ISD::PSHUFHW:
20100 Mask.erase(Mask.begin(), Mask.begin() + 4);
20101 for (int &M : Mask)
20105 llvm_unreachable("No valid shuffle instruction found!");
20109 /// \brief Search for a combinable shuffle across a chain ending in pshufd.
20111 /// We walk up the chain and look for a combinable shuffle, skipping over
20112 /// shuffles that we could hoist this shuffle's transformation past without
20113 /// altering anything.
20115 combineRedundantDWordShuffle(SDValue N, MutableArrayRef<int> Mask,
20117 TargetLowering::DAGCombinerInfo &DCI) {
20118 assert(N.getOpcode() == X86ISD::PSHUFD &&
20119 "Called with something other than an x86 128-bit half shuffle!");
20122 // Walk up a single-use chain looking for a combinable shuffle. Keep a stack
20123 // of the shuffles in the chain so that we can form a fresh chain to replace
20125 SmallVector<SDValue, 8> Chain;
20126 SDValue V = N.getOperand(0);
20127 for (; V.hasOneUse(); V = V.getOperand(0)) {
20128 switch (V.getOpcode()) {
20130 return SDValue(); // Nothing combined!
20133 // Skip bitcasts as we always know the type for the target specific
20137 case X86ISD::PSHUFD:
20138 // Found another dword shuffle.
20141 case X86ISD::PSHUFLW:
20142 // Check that the low words (being shuffled) are the identity in the
20143 // dword shuffle, and the high words are self-contained.
20144 if (Mask[0] != 0 || Mask[1] != 1 ||
20145 !(Mask[2] >= 2 && Mask[2] < 4 && Mask[3] >= 2 && Mask[3] < 4))
20148 Chain.push_back(V);
20151 case X86ISD::PSHUFHW:
20152 // Check that the high words (being shuffled) are the identity in the
20153 // dword shuffle, and the low words are self-contained.
20154 if (Mask[2] != 2 || Mask[3] != 3 ||
20155 !(Mask[0] >= 0 && Mask[0] < 2 && Mask[1] >= 0 && Mask[1] < 2))
20158 Chain.push_back(V);
20161 case X86ISD::UNPCKL:
20162 case X86ISD::UNPCKH:
20163 // For either i8 -> i16 or i16 -> i32 unpacks, we can combine a dword
20164 // shuffle into a preceding word shuffle.
20165 if (V.getValueType() != MVT::v16i8 && V.getValueType() != MVT::v8i16)
20168 // Search for a half-shuffle which we can combine with.
20169 unsigned CombineOp =
20170 V.getOpcode() == X86ISD::UNPCKL ? X86ISD::PSHUFLW : X86ISD::PSHUFHW;
20171 if (V.getOperand(0) != V.getOperand(1) ||
20172 !V->isOnlyUserOf(V.getOperand(0).getNode()))
20174 Chain.push_back(V);
20175 V = V.getOperand(0);
20177 switch (V.getOpcode()) {
20179 return SDValue(); // Nothing to combine.
20181 case X86ISD::PSHUFLW:
20182 case X86ISD::PSHUFHW:
20183 if (V.getOpcode() == CombineOp)
20186 Chain.push_back(V);
20190 V = V.getOperand(0);
20194 } while (V.hasOneUse());
20197 // Break out of the loop if we break out of the switch.
20201 if (!V.hasOneUse())
20202 // We fell out of the loop without finding a viable combining instruction.
20205 // Merge this node's mask and our incoming mask.
20206 SmallVector<int, 4> VMask = getPSHUFShuffleMask(V);
20207 for (int &M : Mask)
20209 V = DAG.getNode(V.getOpcode(), DL, V.getValueType(), V.getOperand(0),
20210 getV4X86ShuffleImm8ForMask(Mask, DAG));
20212 // Rebuild the chain around this new shuffle.
20213 while (!Chain.empty()) {
20214 SDValue W = Chain.pop_back_val();
20216 if (V.getValueType() != W.getOperand(0).getValueType())
20217 V = DAG.getNode(ISD::BITCAST, DL, W.getOperand(0).getValueType(), V);
20219 switch (W.getOpcode()) {
20221 llvm_unreachable("Only PSHUF and UNPCK instructions get here!");
20223 case X86ISD::UNPCKL:
20224 case X86ISD::UNPCKH:
20225 V = DAG.getNode(W.getOpcode(), DL, W.getValueType(), V, V);
20228 case X86ISD::PSHUFD:
20229 case X86ISD::PSHUFLW:
20230 case X86ISD::PSHUFHW:
20231 V = DAG.getNode(W.getOpcode(), DL, W.getValueType(), V, W.getOperand(1));
20235 if (V.getValueType() != N.getValueType())
20236 V = DAG.getNode(ISD::BITCAST, DL, N.getValueType(), V);
20238 // Return the new chain to replace N.
20242 /// \brief Search for a combinable shuffle across a chain ending in pshuflw or pshufhw.
20244 /// We walk up the chain, skipping shuffles of the other half and looking
20245 /// through shuffles which switch halves trying to find a shuffle of the same
20246 /// pair of dwords.
20247 static bool combineRedundantHalfShuffle(SDValue N, MutableArrayRef<int> Mask,
20249 TargetLowering::DAGCombinerInfo &DCI) {
20251 (N.getOpcode() == X86ISD::PSHUFLW || N.getOpcode() == X86ISD::PSHUFHW) &&
20252 "Called with something other than an x86 128-bit half shuffle!");
20254 unsigned CombineOpcode = N.getOpcode();
20256 // Walk up a single-use chain looking for a combinable shuffle.
20257 SDValue V = N.getOperand(0);
20258 for (; V.hasOneUse(); V = V.getOperand(0)) {
20259 switch (V.getOpcode()) {
20261 return false; // Nothing combined!
20264 // Skip bitcasts as we always know the type for the target specific
20268 case X86ISD::PSHUFLW:
20269 case X86ISD::PSHUFHW:
20270 if (V.getOpcode() == CombineOpcode)
20273 // Other-half shuffles are no-ops.
20276 // Break out of the loop if we break out of the switch.
20280 if (!V.hasOneUse())
20281 // We fell out of the loop without finding a viable combining instruction.
20284 // Combine away the bottom node as its shuffle will be accumulated into
20285 // a preceding shuffle.
20286 DCI.CombineTo(N.getNode(), N.getOperand(0), /*AddTo*/ true);
20288 // Record the old value.
20291 // Merge this node's mask and our incoming mask (adjusted to account for all
20292 // the pshufd instructions encountered).
20293 SmallVector<int, 4> VMask = getPSHUFShuffleMask(V);
20294 for (int &M : Mask)
20296 V = DAG.getNode(V.getOpcode(), DL, MVT::v8i16, V.getOperand(0),
20297 getV4X86ShuffleImm8ForMask(Mask, DAG));
20299 // Check that the shuffles didn't cancel each other out. If not, we need to
20300 // combine to the new one.
20302 // Replace the combinable shuffle with the combined one, updating all users
20303 // so that we re-evaluate the chain here.
20304 DCI.CombineTo(Old.getNode(), V, /*AddTo*/ true);
20309 /// \brief Try to combine x86 target specific shuffles.
20310 static SDValue PerformTargetShuffleCombine(SDValue N, SelectionDAG &DAG,
20311 TargetLowering::DAGCombinerInfo &DCI,
20312 const X86Subtarget *Subtarget) {
20314 MVT VT = N.getSimpleValueType();
20315 SmallVector<int, 4> Mask;
20317 switch (N.getOpcode()) {
20318 case X86ISD::PSHUFD:
20319 case X86ISD::PSHUFLW:
20320 case X86ISD::PSHUFHW:
20321 Mask = getPSHUFShuffleMask(N);
20322 assert(Mask.size() == 4);
20328 // Nuke no-op shuffles that show up after combining.
20329 if (isNoopShuffleMask(Mask))
20330 return DCI.CombineTo(N.getNode(), N.getOperand(0), /*AddTo*/ true);
20332 // Look for simplifications involving one or two shuffle instructions.
20333 SDValue V = N.getOperand(0);
20334 switch (N.getOpcode()) {
20337 case X86ISD::PSHUFLW:
20338 case X86ISD::PSHUFHW:
20339 assert(VT == MVT::v8i16);
20342 if (combineRedundantHalfShuffle(N, Mask, DAG, DCI))
20343 return SDValue(); // We combined away this shuffle, so we're done.
20345 // See if this reduces to a PSHUFD which is no more expensive and can
20346 // combine with more operations.
20347 if (canWidenShuffleElements(Mask)) {
20348 int DMask[] = {-1, -1, -1, -1};
20349 int DOffset = N.getOpcode() == X86ISD::PSHUFLW ? 0 : 2;
20350 DMask[DOffset + 0] = DOffset + Mask[0] / 2;
20351 DMask[DOffset + 1] = DOffset + Mask[2] / 2;
20352 V = DAG.getNode(ISD::BITCAST, DL, MVT::v4i32, V);
20353 DCI.AddToWorklist(V.getNode());
20354 V = DAG.getNode(X86ISD::PSHUFD, DL, MVT::v4i32, V,
20355 getV4X86ShuffleImm8ForMask(DMask, DAG));
20356 DCI.AddToWorklist(V.getNode());
20357 return DAG.getNode(ISD::BITCAST, DL, MVT::v8i16, V);
20360 // Look for shuffle patterns which can be implemented as a single unpack.
20361 // FIXME: This doesn't handle the location of the PSHUFD generically, and
20362 // only works when we have a PSHUFD followed by two half-shuffles.
20363 if (Mask[0] == Mask[1] && Mask[2] == Mask[3] &&
20364 (V.getOpcode() == X86ISD::PSHUFLW ||
20365 V.getOpcode() == X86ISD::PSHUFHW) &&
20366 V.getOpcode() != N.getOpcode() &&
20368 SDValue D = V.getOperand(0);
20369 while (D.getOpcode() == ISD::BITCAST && D.hasOneUse())
20370 D = D.getOperand(0);
20371 if (D.getOpcode() == X86ISD::PSHUFD && D.hasOneUse()) {
20372 SmallVector<int, 4> VMask = getPSHUFShuffleMask(V);
20373 SmallVector<int, 4> DMask = getPSHUFShuffleMask(D);
20374 int NOffset = N.getOpcode() == X86ISD::PSHUFLW ? 0 : 4;
20375 int VOffset = V.getOpcode() == X86ISD::PSHUFLW ? 0 : 4;
20377 for (int i = 0; i < 4; ++i) {
20378 WordMask[i + NOffset] = Mask[i] + NOffset;
20379 WordMask[i + VOffset] = VMask[i] + VOffset;
20381 // Map the word mask through the DWord mask.
20383 for (int i = 0; i < 8; ++i)
20384 MappedMask[i] = 2 * DMask[WordMask[i] / 2] + WordMask[i] % 2;
20385 const int UnpackLoMask[] = {0, 0, 1, 1, 2, 2, 3, 3};
20386 const int UnpackHiMask[] = {4, 4, 5, 5, 6, 6, 7, 7};
20387 if (std::equal(std::begin(MappedMask), std::end(MappedMask),
20388 std::begin(UnpackLoMask)) ||
20389 std::equal(std::begin(MappedMask), std::end(MappedMask),
20390 std::begin(UnpackHiMask))) {
20391 // We can replace all three shuffles with an unpack.
20392 V = DAG.getNode(ISD::BITCAST, DL, MVT::v8i16, D.getOperand(0));
20393 DCI.AddToWorklist(V.getNode());
20394 return DAG.getNode(MappedMask[0] == 0 ? X86ISD::UNPCKL
20396 DL, MVT::v8i16, V, V);
20403 case X86ISD::PSHUFD:
20404 if (SDValue NewN = combineRedundantDWordShuffle(N, Mask, DAG, DCI))
20413 /// \brief Try to combine a shuffle into a target-specific add-sub node.
20415 /// We combine this directly on the abstract vector shuffle nodes so it is
20416 /// easier to generically match. We also insert dummy vector shuffle nodes for
20417 /// the operands which explicitly discard the lanes which are unused by this
20418 /// operation to try to flow through the rest of the combiner the fact that
20419 /// they're unused.
20420 static SDValue combineShuffleToAddSub(SDNode *N, SelectionDAG &DAG) {
20422 EVT VT = N->getValueType(0);
20424 // We only handle target-independent shuffles.
20425 // FIXME: It would be easy and harmless to use the target shuffle mask
20426 // extraction tool to support more.
20427 if (N->getOpcode() != ISD::VECTOR_SHUFFLE)
20430 auto *SVN = cast<ShuffleVectorSDNode>(N);
20431 ArrayRef<int> Mask = SVN->getMask();
20432 SDValue V1 = N->getOperand(0);
20433 SDValue V2 = N->getOperand(1);
20435 // We require the first shuffle operand to be the SUB node, and the second to
20436 // be the ADD node.
20437 // FIXME: We should support the commuted patterns.
20438 if (V1->getOpcode() != ISD::FSUB || V2->getOpcode() != ISD::FADD)
20441 // If there are other uses of these operations we can't fold them.
20442 if (!V1->hasOneUse() || !V2->hasOneUse())
20445 // Ensure that both operations have the same operands. Note that we can
20446 // commute the FADD operands.
20447 SDValue LHS = V1->getOperand(0), RHS = V1->getOperand(1);
20448 if ((V2->getOperand(0) != LHS || V2->getOperand(1) != RHS) &&
20449 (V2->getOperand(0) != RHS || V2->getOperand(1) != LHS))
20452 // We're looking for blends between FADD and FSUB nodes. We insist on these
20453 // nodes being lined up in a specific expected pattern.
20454 if (!(isShuffleEquivalent(Mask, 0, 3) ||
20455 isShuffleEquivalent(Mask, 0, 5, 2, 7) ||
20456 isShuffleEquivalent(Mask, 0, 9, 2, 11, 4, 13, 6, 15)))
20459 // Only specific types are legal at this point, assert so we notice if and
20460 // when these change.
20461 assert((VT == MVT::v4f32 || VT == MVT::v2f64 || VT == MVT::v8f32 ||
20462 VT == MVT::v4f64) &&
20463 "Unknown vector type encountered!");
20465 return DAG.getNode(X86ISD::ADDSUB, DL, VT, LHS, RHS);
20468 /// PerformShuffleCombine - Performs several different shuffle combines.
20469 static SDValue PerformShuffleCombine(SDNode *N, SelectionDAG &DAG,
20470 TargetLowering::DAGCombinerInfo &DCI,
20471 const X86Subtarget *Subtarget) {
20473 SDValue N0 = N->getOperand(0);
20474 SDValue N1 = N->getOperand(1);
20475 EVT VT = N->getValueType(0);
20477 // Don't create instructions with illegal types after legalize types has run.
20478 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
20479 if (!DCI.isBeforeLegalize() && !TLI.isTypeLegal(VT.getVectorElementType()))
20482 // If we have legalized the vector types, look for blends of FADD and FSUB
20483 // nodes that we can fuse into an ADDSUB node.
20484 if (TLI.isTypeLegal(VT) && Subtarget->hasSSE3())
20485 if (SDValue AddSub = combineShuffleToAddSub(N, DAG))
20488 // Combine 256-bit vector shuffles. This is only profitable when in AVX mode
20489 if (Subtarget->hasFp256() && VT.is256BitVector() &&
20490 N->getOpcode() == ISD::VECTOR_SHUFFLE)
20491 return PerformShuffleCombine256(N, DAG, DCI, Subtarget);
20493 // During Type Legalization, when promoting illegal vector types,
20494 // the backend might introduce new shuffle dag nodes and bitcasts.
20496 // This code performs the following transformation:
20497 // fold: (shuffle (bitcast (BINOP A, B)), Undef, <Mask>) ->
20498 // (shuffle (BINOP (bitcast A), (bitcast B)), Undef, <Mask>)
20500 // We do this only if both the bitcast and the BINOP dag nodes have
20501 // one use. Also, perform this transformation only if the new binary
20502 // operation is legal. This is to avoid introducing dag nodes that
20503 // potentially need to be further expanded (or custom lowered) into a
20504 // less optimal sequence of dag nodes.
20505 if (!DCI.isBeforeLegalize() && DCI.isBeforeLegalizeOps() &&
20506 N1.getOpcode() == ISD::UNDEF && N0.hasOneUse() &&
20507 N0.getOpcode() == ISD::BITCAST) {
20508 SDValue BC0 = N0.getOperand(0);
20509 EVT SVT = BC0.getValueType();
20510 unsigned Opcode = BC0.getOpcode();
20511 unsigned NumElts = VT.getVectorNumElements();
20513 if (BC0.hasOneUse() && SVT.isVector() &&
20514 SVT.getVectorNumElements() * 2 == NumElts &&
20515 TLI.isOperationLegal(Opcode, VT)) {
20516 bool CanFold = false;
20528 unsigned SVTNumElts = SVT.getVectorNumElements();
20529 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(N);
20530 for (unsigned i = 0, e = SVTNumElts; i != e && CanFold; ++i)
20531 CanFold = SVOp->getMaskElt(i) == (int)(i * 2);
20532 for (unsigned i = SVTNumElts, e = NumElts; i != e && CanFold; ++i)
20533 CanFold = SVOp->getMaskElt(i) < 0;
20536 SDValue BC00 = DAG.getNode(ISD::BITCAST, dl, VT, BC0.getOperand(0));
20537 SDValue BC01 = DAG.getNode(ISD::BITCAST, dl, VT, BC0.getOperand(1));
20538 SDValue NewBinOp = DAG.getNode(BC0.getOpcode(), dl, VT, BC00, BC01);
20539 return DAG.getVectorShuffle(VT, dl, NewBinOp, N1, &SVOp->getMask()[0]);
20544 // Only handle 128 wide vector from here on.
20545 if (!VT.is128BitVector())
20548 // Combine a vector_shuffle that is equal to build_vector load1, load2, load3,
20549 // load4, <0, 1, 2, 3> into a 128-bit load if the load addresses are
20550 // consecutive, non-overlapping, and in the right order.
20551 SmallVector<SDValue, 16> Elts;
20552 for (unsigned i = 0, e = VT.getVectorNumElements(); i != e; ++i)
20553 Elts.push_back(getShuffleScalarElt(N, i, DAG, 0));
20555 SDValue LD = EltsFromConsecutiveLoads(VT, Elts, dl, DAG, true);
20559 if (isTargetShuffle(N->getOpcode())) {
20561 PerformTargetShuffleCombine(SDValue(N, 0), DAG, DCI, Subtarget);
20562 if (Shuffle.getNode())
20565 // Try recursively combining arbitrary sequences of x86 shuffle
20566 // instructions into higher-order shuffles. We do this after combining
20567 // specific PSHUF instruction sequences into their minimal form so that we
20568 // can evaluate how many specialized shuffle instructions are involved in
20569 // a particular chain.
20570 SmallVector<int, 1> NonceMask; // Just a placeholder.
20571 NonceMask.push_back(0);
20572 if (combineX86ShufflesRecursively(SDValue(N, 0), SDValue(N, 0), NonceMask,
20573 /*Depth*/ 1, /*HasPSHUFB*/ false, DAG,
20575 return SDValue(); // This routine will use CombineTo to replace N.
20581 /// PerformTruncateCombine - Converts truncate operation to
20582 /// a sequence of vector shuffle operations.
20583 /// It is possible when we truncate 256-bit vector to 128-bit vector
20584 static SDValue PerformTruncateCombine(SDNode *N, SelectionDAG &DAG,
20585 TargetLowering::DAGCombinerInfo &DCI,
20586 const X86Subtarget *Subtarget) {
20590 /// XFormVExtractWithShuffleIntoLoad - Check if a vector extract from a target
20591 /// specific shuffle of a load can be folded into a single element load.
20592 /// Similar handling for VECTOR_SHUFFLE is performed by DAGCombiner, but
20593 /// shuffles have been customed lowered so we need to handle those here.
20594 static SDValue XFormVExtractWithShuffleIntoLoad(SDNode *N, SelectionDAG &DAG,
20595 TargetLowering::DAGCombinerInfo &DCI) {
20596 if (DCI.isBeforeLegalizeOps())
20599 SDValue InVec = N->getOperand(0);
20600 SDValue EltNo = N->getOperand(1);
20602 if (!isa<ConstantSDNode>(EltNo))
20605 EVT VT = InVec.getValueType();
20607 if (InVec.getOpcode() == ISD::BITCAST) {
20608 // Don't duplicate a load with other uses.
20609 if (!InVec.hasOneUse())
20611 EVT BCVT = InVec.getOperand(0).getValueType();
20612 if (BCVT.getVectorNumElements() != VT.getVectorNumElements())
20614 InVec = InVec.getOperand(0);
20617 if (!isTargetShuffle(InVec.getOpcode()))
20620 // Don't duplicate a load with other uses.
20621 if (!InVec.hasOneUse())
20624 SmallVector<int, 16> ShuffleMask;
20626 if (!getTargetShuffleMask(InVec.getNode(), VT.getSimpleVT(), ShuffleMask,
20630 // Select the input vector, guarding against out of range extract vector.
20631 unsigned NumElems = VT.getVectorNumElements();
20632 int Elt = cast<ConstantSDNode>(EltNo)->getZExtValue();
20633 int Idx = (Elt > (int)NumElems) ? -1 : ShuffleMask[Elt];
20634 SDValue LdNode = (Idx < (int)NumElems) ? InVec.getOperand(0)
20635 : InVec.getOperand(1);
20637 // If inputs to shuffle are the same for both ops, then allow 2 uses
20638 unsigned AllowedUses = InVec.getOperand(0) == InVec.getOperand(1) ? 2 : 1;
20640 if (LdNode.getOpcode() == ISD::BITCAST) {
20641 // Don't duplicate a load with other uses.
20642 if (!LdNode.getNode()->hasNUsesOfValue(AllowedUses, 0))
20645 AllowedUses = 1; // only allow 1 load use if we have a bitcast
20646 LdNode = LdNode.getOperand(0);
20649 if (!ISD::isNormalLoad(LdNode.getNode()))
20652 LoadSDNode *LN0 = cast<LoadSDNode>(LdNode);
20654 if (!LN0 ||!LN0->hasNUsesOfValue(AllowedUses, 0) || LN0->isVolatile())
20657 EVT EltVT = N->getValueType(0);
20658 // If there's a bitcast before the shuffle, check if the load type and
20659 // alignment is valid.
20660 unsigned Align = LN0->getAlignment();
20661 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
20662 unsigned NewAlign = TLI.getDataLayout()->getABITypeAlignment(
20663 EltVT.getTypeForEVT(*DAG.getContext()));
20665 if (NewAlign > Align || !TLI.isOperationLegalOrCustom(ISD::LOAD, EltVT))
20668 // All checks match so transform back to vector_shuffle so that DAG combiner
20669 // can finish the job
20672 // Create shuffle node taking into account the case that its a unary shuffle
20673 SDValue Shuffle = (UnaryShuffle) ? DAG.getUNDEF(VT) : InVec.getOperand(1);
20674 Shuffle = DAG.getVectorShuffle(InVec.getValueType(), dl,
20675 InVec.getOperand(0), Shuffle,
20677 Shuffle = DAG.getNode(ISD::BITCAST, dl, VT, Shuffle);
20678 return DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, N->getValueType(0), Shuffle,
20682 /// PerformEXTRACT_VECTOR_ELTCombine - Detect vector gather/scatter index
20683 /// generation and convert it from being a bunch of shuffles and extracts
20684 /// to a simple store and scalar loads to extract the elements.
20685 static SDValue PerformEXTRACT_VECTOR_ELTCombine(SDNode *N, SelectionDAG &DAG,
20686 TargetLowering::DAGCombinerInfo &DCI) {
20687 SDValue NewOp = XFormVExtractWithShuffleIntoLoad(N, DAG, DCI);
20688 if (NewOp.getNode())
20691 SDValue InputVector = N->getOperand(0);
20693 // Detect whether we are trying to convert from mmx to i32 and the bitcast
20694 // from mmx to v2i32 has a single usage.
20695 if (InputVector.getNode()->getOpcode() == llvm::ISD::BITCAST &&
20696 InputVector.getNode()->getOperand(0).getValueType() == MVT::x86mmx &&
20697 InputVector.hasOneUse() && N->getValueType(0) == MVT::i32)
20698 return DAG.getNode(X86ISD::MMX_MOVD2W, SDLoc(InputVector),
20699 N->getValueType(0),
20700 InputVector.getNode()->getOperand(0));
20702 // Only operate on vectors of 4 elements, where the alternative shuffling
20703 // gets to be more expensive.
20704 if (InputVector.getValueType() != MVT::v4i32)
20707 // Check whether every use of InputVector is an EXTRACT_VECTOR_ELT with a
20708 // single use which is a sign-extend or zero-extend, and all elements are
20710 SmallVector<SDNode *, 4> Uses;
20711 unsigned ExtractedElements = 0;
20712 for (SDNode::use_iterator UI = InputVector.getNode()->use_begin(),
20713 UE = InputVector.getNode()->use_end(); UI != UE; ++UI) {
20714 if (UI.getUse().getResNo() != InputVector.getResNo())
20717 SDNode *Extract = *UI;
20718 if (Extract->getOpcode() != ISD::EXTRACT_VECTOR_ELT)
20721 if (Extract->getValueType(0) != MVT::i32)
20723 if (!Extract->hasOneUse())
20725 if (Extract->use_begin()->getOpcode() != ISD::SIGN_EXTEND &&
20726 Extract->use_begin()->getOpcode() != ISD::ZERO_EXTEND)
20728 if (!isa<ConstantSDNode>(Extract->getOperand(1)))
20731 // Record which element was extracted.
20732 ExtractedElements |=
20733 1 << cast<ConstantSDNode>(Extract->getOperand(1))->getZExtValue();
20735 Uses.push_back(Extract);
20738 // If not all the elements were used, this may not be worthwhile.
20739 if (ExtractedElements != 15)
20742 // Ok, we've now decided to do the transformation.
20743 SDLoc dl(InputVector);
20745 // Store the value to a temporary stack slot.
20746 SDValue StackPtr = DAG.CreateStackTemporary(InputVector.getValueType());
20747 SDValue Ch = DAG.getStore(DAG.getEntryNode(), dl, InputVector, StackPtr,
20748 MachinePointerInfo(), false, false, 0);
20750 // Replace each use (extract) with a load of the appropriate element.
20751 for (SmallVectorImpl<SDNode *>::iterator UI = Uses.begin(),
20752 UE = Uses.end(); UI != UE; ++UI) {
20753 SDNode *Extract = *UI;
20755 // cOMpute the element's address.
20756 SDValue Idx = Extract->getOperand(1);
20758 InputVector.getValueType().getVectorElementType().getSizeInBits()/8;
20759 uint64_t Offset = EltSize * cast<ConstantSDNode>(Idx)->getZExtValue();
20760 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
20761 SDValue OffsetVal = DAG.getConstant(Offset, TLI.getPointerTy());
20763 SDValue ScalarAddr = DAG.getNode(ISD::ADD, dl, TLI.getPointerTy(),
20764 StackPtr, OffsetVal);
20766 // Load the scalar.
20767 SDValue LoadScalar = DAG.getLoad(Extract->getValueType(0), dl, Ch,
20768 ScalarAddr, MachinePointerInfo(),
20769 false, false, false, 0);
20771 // Replace the exact with the load.
20772 DAG.ReplaceAllUsesOfValueWith(SDValue(Extract, 0), LoadScalar);
20775 // The replacement was made in place; don't return anything.
20779 /// \brief Matches a VSELECT onto min/max or return 0 if the node doesn't match.
20780 static std::pair<unsigned, bool>
20781 matchIntegerMINMAX(SDValue Cond, EVT VT, SDValue LHS, SDValue RHS,
20782 SelectionDAG &DAG, const X86Subtarget *Subtarget) {
20783 if (!VT.isVector())
20784 return std::make_pair(0, false);
20786 bool NeedSplit = false;
20787 switch (VT.getSimpleVT().SimpleTy) {
20788 default: return std::make_pair(0, false);
20792 if (!Subtarget->hasAVX2())
20794 if (!Subtarget->hasAVX())
20795 return std::make_pair(0, false);
20800 if (!Subtarget->hasSSE2())
20801 return std::make_pair(0, false);
20804 // SSE2 has only a small subset of the operations.
20805 bool hasUnsigned = Subtarget->hasSSE41() ||
20806 (Subtarget->hasSSE2() && VT == MVT::v16i8);
20807 bool hasSigned = Subtarget->hasSSE41() ||
20808 (Subtarget->hasSSE2() && VT == MVT::v8i16);
20810 ISD::CondCode CC = cast<CondCodeSDNode>(Cond.getOperand(2))->get();
20813 // Check for x CC y ? x : y.
20814 if (DAG.isEqualTo(LHS, Cond.getOperand(0)) &&
20815 DAG.isEqualTo(RHS, Cond.getOperand(1))) {
20820 Opc = hasUnsigned ? X86ISD::UMIN : 0; break;
20823 Opc = hasUnsigned ? X86ISD::UMAX : 0; break;
20826 Opc = hasSigned ? X86ISD::SMIN : 0; break;
20829 Opc = hasSigned ? X86ISD::SMAX : 0; break;
20831 // Check for x CC y ? y : x -- a min/max with reversed arms.
20832 } else if (DAG.isEqualTo(LHS, Cond.getOperand(1)) &&
20833 DAG.isEqualTo(RHS, Cond.getOperand(0))) {
20838 Opc = hasUnsigned ? X86ISD::UMAX : 0; break;
20841 Opc = hasUnsigned ? X86ISD::UMIN : 0; break;
20844 Opc = hasSigned ? X86ISD::SMAX : 0; break;
20847 Opc = hasSigned ? X86ISD::SMIN : 0; break;
20851 return std::make_pair(Opc, NeedSplit);
20855 TransformVSELECTtoBlendVECTOR_SHUFFLE(SDNode *N, SelectionDAG &DAG,
20856 const X86Subtarget *Subtarget) {
20858 SDValue Cond = N->getOperand(0);
20859 SDValue LHS = N->getOperand(1);
20860 SDValue RHS = N->getOperand(2);
20862 if (Cond.getOpcode() == ISD::SIGN_EXTEND) {
20863 SDValue CondSrc = Cond->getOperand(0);
20864 if (CondSrc->getOpcode() == ISD::SIGN_EXTEND_INREG)
20865 Cond = CondSrc->getOperand(0);
20868 MVT VT = N->getSimpleValueType(0);
20869 MVT EltVT = VT.getVectorElementType();
20870 unsigned NumElems = VT.getVectorNumElements();
20871 // There is no blend with immediate in AVX-512.
20872 if (VT.is512BitVector())
20875 if (!Subtarget->hasSSE41() || EltVT == MVT::i8)
20877 if (!Subtarget->hasInt256() && VT == MVT::v16i16)
20880 if (!ISD::isBuildVectorOfConstantSDNodes(Cond.getNode()))
20883 // A vselect where all conditions and data are constants can be optimized into
20884 // a single vector load by SelectionDAGLegalize::ExpandBUILD_VECTOR().
20885 if (ISD::isBuildVectorOfConstantSDNodes(LHS.getNode()) &&
20886 ISD::isBuildVectorOfConstantSDNodes(RHS.getNode()))
20889 unsigned MaskValue = 0;
20890 if (!BUILD_VECTORtoBlendMask(cast<BuildVectorSDNode>(Cond), MaskValue))
20893 SmallVector<int, 8> ShuffleMask(NumElems, -1);
20894 for (unsigned i = 0; i < NumElems; ++i) {
20895 // Be sure we emit undef where we can.
20896 if (Cond.getOperand(i)->getOpcode() == ISD::UNDEF)
20897 ShuffleMask[i] = -1;
20899 ShuffleMask[i] = i + NumElems * ((MaskValue >> i) & 1);
20902 return DAG.getVectorShuffle(VT, dl, LHS, RHS, &ShuffleMask[0]);
20905 /// PerformSELECTCombine - Do target-specific dag combines on SELECT and VSELECT
20907 static SDValue PerformSELECTCombine(SDNode *N, SelectionDAG &DAG,
20908 TargetLowering::DAGCombinerInfo &DCI,
20909 const X86Subtarget *Subtarget) {
20911 SDValue Cond = N->getOperand(0);
20912 // Get the LHS/RHS of the select.
20913 SDValue LHS = N->getOperand(1);
20914 SDValue RHS = N->getOperand(2);
20915 EVT VT = LHS.getValueType();
20916 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
20918 // If we have SSE[12] support, try to form min/max nodes. SSE min/max
20919 // instructions match the semantics of the common C idiom x<y?x:y but not
20920 // x<=y?x:y, because of how they handle negative zero (which can be
20921 // ignored in unsafe-math mode).
20922 if (Cond.getOpcode() == ISD::SETCC && VT.isFloatingPoint() &&
20923 VT != MVT::f80 && TLI.isTypeLegal(VT) &&
20924 (Subtarget->hasSSE2() ||
20925 (Subtarget->hasSSE1() && VT.getScalarType() == MVT::f32))) {
20926 ISD::CondCode CC = cast<CondCodeSDNode>(Cond.getOperand(2))->get();
20928 unsigned Opcode = 0;
20929 // Check for x CC y ? x : y.
20930 if (DAG.isEqualTo(LHS, Cond.getOperand(0)) &&
20931 DAG.isEqualTo(RHS, Cond.getOperand(1))) {
20935 // Converting this to a min would handle NaNs incorrectly, and swapping
20936 // the operands would cause it to handle comparisons between positive
20937 // and negative zero incorrectly.
20938 if (!DAG.isKnownNeverNaN(LHS) || !DAG.isKnownNeverNaN(RHS)) {
20939 if (!DAG.getTarget().Options.UnsafeFPMath &&
20940 !(DAG.isKnownNeverZero(LHS) || DAG.isKnownNeverZero(RHS)))
20942 std::swap(LHS, RHS);
20944 Opcode = X86ISD::FMIN;
20947 // Converting this to a min would handle comparisons between positive
20948 // and negative zero incorrectly.
20949 if (!DAG.getTarget().Options.UnsafeFPMath &&
20950 !DAG.isKnownNeverZero(LHS) && !DAG.isKnownNeverZero(RHS))
20952 Opcode = X86ISD::FMIN;
20955 // Converting this to a min would handle both negative zeros and NaNs
20956 // incorrectly, but we can swap the operands to fix both.
20957 std::swap(LHS, RHS);
20961 Opcode = X86ISD::FMIN;
20965 // Converting this to a max would handle comparisons between positive
20966 // and negative zero incorrectly.
20967 if (!DAG.getTarget().Options.UnsafeFPMath &&
20968 !DAG.isKnownNeverZero(LHS) && !DAG.isKnownNeverZero(RHS))
20970 Opcode = X86ISD::FMAX;
20973 // Converting this to a max would handle NaNs incorrectly, and swapping
20974 // the operands would cause it to handle comparisons between positive
20975 // and negative zero incorrectly.
20976 if (!DAG.isKnownNeverNaN(LHS) || !DAG.isKnownNeverNaN(RHS)) {
20977 if (!DAG.getTarget().Options.UnsafeFPMath &&
20978 !(DAG.isKnownNeverZero(LHS) || DAG.isKnownNeverZero(RHS)))
20980 std::swap(LHS, RHS);
20982 Opcode = X86ISD::FMAX;
20985 // Converting this to a max would handle both negative zeros and NaNs
20986 // incorrectly, but we can swap the operands to fix both.
20987 std::swap(LHS, RHS);
20991 Opcode = X86ISD::FMAX;
20994 // Check for x CC y ? y : x -- a min/max with reversed arms.
20995 } else if (DAG.isEqualTo(LHS, Cond.getOperand(1)) &&
20996 DAG.isEqualTo(RHS, Cond.getOperand(0))) {
21000 // Converting this to a min would handle comparisons between positive
21001 // and negative zero incorrectly, and swapping the operands would
21002 // cause it to handle NaNs incorrectly.
21003 if (!DAG.getTarget().Options.UnsafeFPMath &&
21004 !(DAG.isKnownNeverZero(LHS) || DAG.isKnownNeverZero(RHS))) {
21005 if (!DAG.isKnownNeverNaN(LHS) || !DAG.isKnownNeverNaN(RHS))
21007 std::swap(LHS, RHS);
21009 Opcode = X86ISD::FMIN;
21012 // Converting this to a min would handle NaNs incorrectly.
21013 if (!DAG.getTarget().Options.UnsafeFPMath &&
21014 (!DAG.isKnownNeverNaN(LHS) || !DAG.isKnownNeverNaN(RHS)))
21016 Opcode = X86ISD::FMIN;
21019 // Converting this to a min would handle both negative zeros and NaNs
21020 // incorrectly, but we can swap the operands to fix both.
21021 std::swap(LHS, RHS);
21025 Opcode = X86ISD::FMIN;
21029 // Converting this to a max would handle NaNs incorrectly.
21030 if (!DAG.isKnownNeverNaN(LHS) || !DAG.isKnownNeverNaN(RHS))
21032 Opcode = X86ISD::FMAX;
21035 // Converting this to a max would handle comparisons between positive
21036 // and negative zero incorrectly, and swapping the operands would
21037 // cause it to handle NaNs incorrectly.
21038 if (!DAG.getTarget().Options.UnsafeFPMath &&
21039 !DAG.isKnownNeverZero(LHS) && !DAG.isKnownNeverZero(RHS)) {
21040 if (!DAG.isKnownNeverNaN(LHS) || !DAG.isKnownNeverNaN(RHS))
21042 std::swap(LHS, RHS);
21044 Opcode = X86ISD::FMAX;
21047 // Converting this to a max would handle both negative zeros and NaNs
21048 // incorrectly, but we can swap the operands to fix both.
21049 std::swap(LHS, RHS);
21053 Opcode = X86ISD::FMAX;
21059 return DAG.getNode(Opcode, DL, N->getValueType(0), LHS, RHS);
21062 EVT CondVT = Cond.getValueType();
21063 if (Subtarget->hasAVX512() && VT.isVector() && CondVT.isVector() &&
21064 CondVT.getVectorElementType() == MVT::i1) {
21065 // v16i8 (select v16i1, v16i8, v16i8) does not have a proper
21066 // lowering on KNL. In this case we convert it to
21067 // v16i8 (select v16i8, v16i8, v16i8) and use AVX instruction.
21068 // The same situation for all 128 and 256-bit vectors of i8 and i16.
21069 // Since SKX these selects have a proper lowering.
21070 EVT OpVT = LHS.getValueType();
21071 if ((OpVT.is128BitVector() || OpVT.is256BitVector()) &&
21072 (OpVT.getVectorElementType() == MVT::i8 ||
21073 OpVT.getVectorElementType() == MVT::i16) &&
21074 !(Subtarget->hasBWI() && Subtarget->hasVLX())) {
21075 Cond = DAG.getNode(ISD::SIGN_EXTEND, DL, OpVT, Cond);
21076 DCI.AddToWorklist(Cond.getNode());
21077 return DAG.getNode(N->getOpcode(), DL, OpVT, Cond, LHS, RHS);
21080 // If this is a select between two integer constants, try to do some
21082 if (ConstantSDNode *TrueC = dyn_cast<ConstantSDNode>(LHS)) {
21083 if (ConstantSDNode *FalseC = dyn_cast<ConstantSDNode>(RHS))
21084 // Don't do this for crazy integer types.
21085 if (DAG.getTargetLoweringInfo().isTypeLegal(LHS.getValueType())) {
21086 // If this is efficiently invertible, canonicalize the LHSC/RHSC values
21087 // so that TrueC (the true value) is larger than FalseC.
21088 bool NeedsCondInvert = false;
21090 if (TrueC->getAPIntValue().ult(FalseC->getAPIntValue()) &&
21091 // Efficiently invertible.
21092 (Cond.getOpcode() == ISD::SETCC || // setcc -> invertible.
21093 (Cond.getOpcode() == ISD::XOR && // xor(X, C) -> invertible.
21094 isa<ConstantSDNode>(Cond.getOperand(1))))) {
21095 NeedsCondInvert = true;
21096 std::swap(TrueC, FalseC);
21099 // Optimize C ? 8 : 0 -> zext(C) << 3. Likewise for any pow2/0.
21100 if (FalseC->getAPIntValue() == 0 &&
21101 TrueC->getAPIntValue().isPowerOf2()) {
21102 if (NeedsCondInvert) // Invert the condition if needed.
21103 Cond = DAG.getNode(ISD::XOR, DL, Cond.getValueType(), Cond,
21104 DAG.getConstant(1, Cond.getValueType()));
21106 // Zero extend the condition if needed.
21107 Cond = DAG.getNode(ISD::ZERO_EXTEND, DL, LHS.getValueType(), Cond);
21109 unsigned ShAmt = TrueC->getAPIntValue().logBase2();
21110 return DAG.getNode(ISD::SHL, DL, LHS.getValueType(), Cond,
21111 DAG.getConstant(ShAmt, MVT::i8));
21114 // Optimize Cond ? cst+1 : cst -> zext(setcc(C)+cst.
21115 if (FalseC->getAPIntValue()+1 == TrueC->getAPIntValue()) {
21116 if (NeedsCondInvert) // Invert the condition if needed.
21117 Cond = DAG.getNode(ISD::XOR, DL, Cond.getValueType(), Cond,
21118 DAG.getConstant(1, Cond.getValueType()));
21120 // Zero extend the condition if needed.
21121 Cond = DAG.getNode(ISD::ZERO_EXTEND, DL,
21122 FalseC->getValueType(0), Cond);
21123 return DAG.getNode(ISD::ADD, DL, Cond.getValueType(), Cond,
21124 SDValue(FalseC, 0));
21127 // Optimize cases that will turn into an LEA instruction. This requires
21128 // an i32 or i64 and an efficient multiplier (1, 2, 3, 4, 5, 8, 9).
21129 if (N->getValueType(0) == MVT::i32 || N->getValueType(0) == MVT::i64) {
21130 uint64_t Diff = TrueC->getZExtValue()-FalseC->getZExtValue();
21131 if (N->getValueType(0) == MVT::i32) Diff = (unsigned)Diff;
21133 bool isFastMultiplier = false;
21135 switch ((unsigned char)Diff) {
21137 case 1: // result = add base, cond
21138 case 2: // result = lea base( , cond*2)
21139 case 3: // result = lea base(cond, cond*2)
21140 case 4: // result = lea base( , cond*4)
21141 case 5: // result = lea base(cond, cond*4)
21142 case 8: // result = lea base( , cond*8)
21143 case 9: // result = lea base(cond, cond*8)
21144 isFastMultiplier = true;
21149 if (isFastMultiplier) {
21150 APInt Diff = TrueC->getAPIntValue()-FalseC->getAPIntValue();
21151 if (NeedsCondInvert) // Invert the condition if needed.
21152 Cond = DAG.getNode(ISD::XOR, DL, Cond.getValueType(), Cond,
21153 DAG.getConstant(1, Cond.getValueType()));
21155 // Zero extend the condition if needed.
21156 Cond = DAG.getNode(ISD::ZERO_EXTEND, DL, FalseC->getValueType(0),
21158 // Scale the condition by the difference.
21160 Cond = DAG.getNode(ISD::MUL, DL, Cond.getValueType(), Cond,
21161 DAG.getConstant(Diff, Cond.getValueType()));
21163 // Add the base if non-zero.
21164 if (FalseC->getAPIntValue() != 0)
21165 Cond = DAG.getNode(ISD::ADD, DL, Cond.getValueType(), Cond,
21166 SDValue(FalseC, 0));
21173 // Canonicalize max and min:
21174 // (x > y) ? x : y -> (x >= y) ? x : y
21175 // (x < y) ? x : y -> (x <= y) ? x : y
21176 // This allows use of COND_S / COND_NS (see TranslateX86CC) which eliminates
21177 // the need for an extra compare
21178 // against zero. e.g.
21179 // (x - y) > 0 : (x - y) ? 0 -> (x - y) >= 0 : (x - y) ? 0
21181 // testl %edi, %edi
21183 // cmovgl %edi, %eax
21187 // cmovsl %eax, %edi
21188 if (N->getOpcode() == ISD::SELECT && Cond.getOpcode() == ISD::SETCC &&
21189 DAG.isEqualTo(LHS, Cond.getOperand(0)) &&
21190 DAG.isEqualTo(RHS, Cond.getOperand(1))) {
21191 ISD::CondCode CC = cast<CondCodeSDNode>(Cond.getOperand(2))->get();
21196 ISD::CondCode NewCC = (CC == ISD::SETLT) ? ISD::SETLE : ISD::SETGE;
21197 Cond = DAG.getSetCC(SDLoc(Cond), Cond.getValueType(),
21198 Cond.getOperand(0), Cond.getOperand(1), NewCC);
21199 return DAG.getNode(ISD::SELECT, DL, VT, Cond, LHS, RHS);
21204 // Early exit check
21205 if (!TLI.isTypeLegal(VT))
21208 // Match VSELECTs into subs with unsigned saturation.
21209 if (N->getOpcode() == ISD::VSELECT && Cond.getOpcode() == ISD::SETCC &&
21210 // psubus is available in SSE2 and AVX2 for i8 and i16 vectors.
21211 ((Subtarget->hasSSE2() && (VT == MVT::v16i8 || VT == MVT::v8i16)) ||
21212 (Subtarget->hasAVX2() && (VT == MVT::v32i8 || VT == MVT::v16i16)))) {
21213 ISD::CondCode CC = cast<CondCodeSDNode>(Cond.getOperand(2))->get();
21215 // Check if one of the arms of the VSELECT is a zero vector. If it's on the
21216 // left side invert the predicate to simplify logic below.
21218 if (ISD::isBuildVectorAllZeros(LHS.getNode())) {
21220 CC = ISD::getSetCCInverse(CC, true);
21221 } else if (ISD::isBuildVectorAllZeros(RHS.getNode())) {
21225 if (Other.getNode() && Other->getNumOperands() == 2 &&
21226 DAG.isEqualTo(Other->getOperand(0), Cond.getOperand(0))) {
21227 SDValue OpLHS = Other->getOperand(0), OpRHS = Other->getOperand(1);
21228 SDValue CondRHS = Cond->getOperand(1);
21230 // Look for a general sub with unsigned saturation first.
21231 // x >= y ? x-y : 0 --> subus x, y
21232 // x > y ? x-y : 0 --> subus x, y
21233 if ((CC == ISD::SETUGE || CC == ISD::SETUGT) &&
21234 Other->getOpcode() == ISD::SUB && DAG.isEqualTo(OpRHS, CondRHS))
21235 return DAG.getNode(X86ISD::SUBUS, DL, VT, OpLHS, OpRHS);
21237 if (auto *OpRHSBV = dyn_cast<BuildVectorSDNode>(OpRHS))
21238 if (auto *OpRHSConst = OpRHSBV->getConstantSplatNode()) {
21239 if (auto *CondRHSBV = dyn_cast<BuildVectorSDNode>(CondRHS))
21240 if (auto *CondRHSConst = CondRHSBV->getConstantSplatNode())
21241 // If the RHS is a constant we have to reverse the const
21242 // canonicalization.
21243 // x > C-1 ? x+-C : 0 --> subus x, C
21244 if (CC == ISD::SETUGT && Other->getOpcode() == ISD::ADD &&
21245 CondRHSConst->getAPIntValue() ==
21246 (-OpRHSConst->getAPIntValue() - 1))
21247 return DAG.getNode(
21248 X86ISD::SUBUS, DL, VT, OpLHS,
21249 DAG.getConstant(-OpRHSConst->getAPIntValue(), VT));
21251 // Another special case: If C was a sign bit, the sub has been
21252 // canonicalized into a xor.
21253 // FIXME: Would it be better to use computeKnownBits to determine
21254 // whether it's safe to decanonicalize the xor?
21255 // x s< 0 ? x^C : 0 --> subus x, C
21256 if (CC == ISD::SETLT && Other->getOpcode() == ISD::XOR &&
21257 ISD::isBuildVectorAllZeros(CondRHS.getNode()) &&
21258 OpRHSConst->getAPIntValue().isSignBit())
21259 // Note that we have to rebuild the RHS constant here to ensure we
21260 // don't rely on particular values of undef lanes.
21261 return DAG.getNode(
21262 X86ISD::SUBUS, DL, VT, OpLHS,
21263 DAG.getConstant(OpRHSConst->getAPIntValue(), VT));
21268 // Try to match a min/max vector operation.
21269 if (N->getOpcode() == ISD::VSELECT && Cond.getOpcode() == ISD::SETCC) {
21270 std::pair<unsigned, bool> ret = matchIntegerMINMAX(Cond, VT, LHS, RHS, DAG, Subtarget);
21271 unsigned Opc = ret.first;
21272 bool NeedSplit = ret.second;
21274 if (Opc && NeedSplit) {
21275 unsigned NumElems = VT.getVectorNumElements();
21276 // Extract the LHS vectors
21277 SDValue LHS1 = Extract128BitVector(LHS, 0, DAG, DL);
21278 SDValue LHS2 = Extract128BitVector(LHS, NumElems/2, DAG, DL);
21280 // Extract the RHS vectors
21281 SDValue RHS1 = Extract128BitVector(RHS, 0, DAG, DL);
21282 SDValue RHS2 = Extract128BitVector(RHS, NumElems/2, DAG, DL);
21284 // Create min/max for each subvector
21285 LHS = DAG.getNode(Opc, DL, LHS1.getValueType(), LHS1, RHS1);
21286 RHS = DAG.getNode(Opc, DL, LHS2.getValueType(), LHS2, RHS2);
21288 // Merge the result
21289 return DAG.getNode(ISD::CONCAT_VECTORS, DL, VT, LHS, RHS);
21291 return DAG.getNode(Opc, DL, VT, LHS, RHS);
21294 // Simplify vector selection if the selector will be produced by CMPP*/PCMP*.
21295 if (N->getOpcode() == ISD::VSELECT && Cond.getOpcode() == ISD::SETCC &&
21296 // Check if SETCC has already been promoted
21297 TLI.getSetCCResultType(*DAG.getContext(), VT) == CondVT &&
21298 // Check that condition value type matches vselect operand type
21301 assert(Cond.getValueType().isVector() &&
21302 "vector select expects a vector selector!");
21304 bool TValIsAllOnes = ISD::isBuildVectorAllOnes(LHS.getNode());
21305 bool FValIsAllZeros = ISD::isBuildVectorAllZeros(RHS.getNode());
21307 if (!TValIsAllOnes && !FValIsAllZeros) {
21308 // Try invert the condition if true value is not all 1s and false value
21310 bool TValIsAllZeros = ISD::isBuildVectorAllZeros(LHS.getNode());
21311 bool FValIsAllOnes = ISD::isBuildVectorAllOnes(RHS.getNode());
21313 if (TValIsAllZeros || FValIsAllOnes) {
21314 SDValue CC = Cond.getOperand(2);
21315 ISD::CondCode NewCC =
21316 ISD::getSetCCInverse(cast<CondCodeSDNode>(CC)->get(),
21317 Cond.getOperand(0).getValueType().isInteger());
21318 Cond = DAG.getSetCC(DL, CondVT, Cond.getOperand(0), Cond.getOperand(1), NewCC);
21319 std::swap(LHS, RHS);
21320 TValIsAllOnes = FValIsAllOnes;
21321 FValIsAllZeros = TValIsAllZeros;
21325 if (TValIsAllOnes || FValIsAllZeros) {
21328 if (TValIsAllOnes && FValIsAllZeros)
21330 else if (TValIsAllOnes)
21331 Ret = DAG.getNode(ISD::OR, DL, CondVT, Cond,
21332 DAG.getNode(ISD::BITCAST, DL, CondVT, RHS));
21333 else if (FValIsAllZeros)
21334 Ret = DAG.getNode(ISD::AND, DL, CondVT, Cond,
21335 DAG.getNode(ISD::BITCAST, DL, CondVT, LHS));
21337 return DAG.getNode(ISD::BITCAST, DL, VT, Ret);
21341 // Try to fold this VSELECT into a MOVSS/MOVSD
21342 if (N->getOpcode() == ISD::VSELECT &&
21343 Cond.getOpcode() == ISD::BUILD_VECTOR && !DCI.isBeforeLegalize()) {
21344 if (VT == MVT::v4i32 || VT == MVT::v4f32 ||
21345 (Subtarget->hasSSE2() && (VT == MVT::v2i64 || VT == MVT::v2f64))) {
21346 bool CanFold = false;
21347 unsigned NumElems = Cond.getNumOperands();
21351 if (isZero(Cond.getOperand(0))) {
21354 // fold (vselect <0,-1,-1,-1>, A, B) -> (movss A, B)
21355 // fold (vselect <0,-1> -> (movsd A, B)
21356 for (unsigned i = 1, e = NumElems; i != e && CanFold; ++i)
21357 CanFold = isAllOnes(Cond.getOperand(i));
21358 } else if (isAllOnes(Cond.getOperand(0))) {
21362 // fold (vselect <-1,0,0,0>, A, B) -> (movss B, A)
21363 // fold (vselect <-1,0> -> (movsd B, A)
21364 for (unsigned i = 1, e = NumElems; i != e && CanFold; ++i)
21365 CanFold = isZero(Cond.getOperand(i));
21369 if (VT == MVT::v4i32 || VT == MVT::v4f32)
21370 return getTargetShuffleNode(X86ISD::MOVSS, DL, VT, A, B, DAG);
21371 return getTargetShuffleNode(X86ISD::MOVSD, DL, VT, A, B, DAG);
21374 if (Subtarget->hasSSE2() && (VT == MVT::v4i32 || VT == MVT::v4f32)) {
21375 // fold (v4i32: vselect <0,0,-1,-1>, A, B) ->
21376 // (v4i32 (bitcast (movsd (v2i64 (bitcast A)),
21377 // (v2i64 (bitcast B)))))
21379 // fold (v4f32: vselect <0,0,-1,-1>, A, B) ->
21380 // (v4f32 (bitcast (movsd (v2f64 (bitcast A)),
21381 // (v2f64 (bitcast B)))))
21383 // fold (v4i32: vselect <-1,-1,0,0>, A, B) ->
21384 // (v4i32 (bitcast (movsd (v2i64 (bitcast B)),
21385 // (v2i64 (bitcast A)))))
21387 // fold (v4f32: vselect <-1,-1,0,0>, A, B) ->
21388 // (v4f32 (bitcast (movsd (v2f64 (bitcast B)),
21389 // (v2f64 (bitcast A)))))
21391 CanFold = (isZero(Cond.getOperand(0)) &&
21392 isZero(Cond.getOperand(1)) &&
21393 isAllOnes(Cond.getOperand(2)) &&
21394 isAllOnes(Cond.getOperand(3)));
21396 if (!CanFold && isAllOnes(Cond.getOperand(0)) &&
21397 isAllOnes(Cond.getOperand(1)) &&
21398 isZero(Cond.getOperand(2)) &&
21399 isZero(Cond.getOperand(3))) {
21401 std::swap(LHS, RHS);
21405 EVT NVT = (VT == MVT::v4i32) ? MVT::v2i64 : MVT::v2f64;
21406 SDValue NewA = DAG.getNode(ISD::BITCAST, DL, NVT, LHS);
21407 SDValue NewB = DAG.getNode(ISD::BITCAST, DL, NVT, RHS);
21408 SDValue Select = getTargetShuffleNode(X86ISD::MOVSD, DL, NVT, NewA,
21410 return DAG.getNode(ISD::BITCAST, DL, VT, Select);
21416 // If we know that this node is legal then we know that it is going to be
21417 // matched by one of the SSE/AVX BLEND instructions. These instructions only
21418 // depend on the highest bit in each word. Try to use SimplifyDemandedBits
21419 // to simplify previous instructions.
21420 if (N->getOpcode() == ISD::VSELECT && DCI.isBeforeLegalizeOps() &&
21421 !DCI.isBeforeLegalize() &&
21422 // We explicitly check against v8i16 and v16i16 because, although
21423 // they're marked as Custom, they might only be legal when Cond is a
21424 // build_vector of constants. This will be taken care in a later
21426 (TLI.isOperationLegalOrCustom(ISD::VSELECT, VT) && VT != MVT::v16i16 &&
21427 VT != MVT::v8i16)) {
21428 unsigned BitWidth = Cond.getValueType().getScalarType().getSizeInBits();
21430 // Don't optimize vector selects that map to mask-registers.
21434 // Check all uses of that condition operand to check whether it will be
21435 // consumed by non-BLEND instructions, which may depend on all bits are set
21437 for (SDNode::use_iterator I = Cond->use_begin(),
21438 E = Cond->use_end(); I != E; ++I)
21439 if (I->getOpcode() != ISD::VSELECT)
21440 // TODO: Add other opcodes eventually lowered into BLEND.
21443 assert(BitWidth >= 8 && BitWidth <= 64 && "Invalid mask size");
21444 APInt DemandedMask = APInt::getHighBitsSet(BitWidth, 1);
21446 APInt KnownZero, KnownOne;
21447 TargetLowering::TargetLoweringOpt TLO(DAG, DCI.isBeforeLegalize(),
21448 DCI.isBeforeLegalizeOps());
21449 if (TLO.ShrinkDemandedConstant(Cond, DemandedMask) ||
21450 TLI.SimplifyDemandedBits(Cond, DemandedMask, KnownZero, KnownOne, TLO))
21451 DCI.CommitTargetLoweringOpt(TLO);
21454 // We should generate an X86ISD::BLENDI from a vselect if its argument
21455 // is a sign_extend_inreg of an any_extend of a BUILD_VECTOR of
21456 // constants. This specific pattern gets generated when we split a
21457 // selector for a 512 bit vector in a machine without AVX512 (but with
21458 // 256-bit vectors), during legalization:
21460 // (vselect (sign_extend (any_extend (BUILD_VECTOR)) i1) LHS RHS)
21462 // Iff we find this pattern and the build_vectors are built from
21463 // constants, we translate the vselect into a shuffle_vector that we
21464 // know will be matched by LowerVECTOR_SHUFFLEtoBlend.
21465 if (N->getOpcode() == ISD::VSELECT && !DCI.isBeforeLegalize()) {
21466 SDValue Shuffle = TransformVSELECTtoBlendVECTOR_SHUFFLE(N, DAG, Subtarget);
21467 if (Shuffle.getNode())
21474 // Check whether a boolean test is testing a boolean value generated by
21475 // X86ISD::SETCC. If so, return the operand of that SETCC and proper condition
21478 // Simplify the following patterns:
21479 // (Op (CMP (SETCC Cond EFLAGS) 1) EQ) or
21480 // (Op (CMP (SETCC Cond EFLAGS) 0) NEQ)
21481 // to (Op EFLAGS Cond)
21483 // (Op (CMP (SETCC Cond EFLAGS) 0) EQ) or
21484 // (Op (CMP (SETCC Cond EFLAGS) 1) NEQ)
21485 // to (Op EFLAGS !Cond)
21487 // where Op could be BRCOND or CMOV.
21489 static SDValue checkBoolTestSetCCCombine(SDValue Cmp, X86::CondCode &CC) {
21490 // Quit if not CMP and SUB with its value result used.
21491 if (Cmp.getOpcode() != X86ISD::CMP &&
21492 (Cmp.getOpcode() != X86ISD::SUB || Cmp.getNode()->hasAnyUseOfValue(0)))
21495 // Quit if not used as a boolean value.
21496 if (CC != X86::COND_E && CC != X86::COND_NE)
21499 // Check CMP operands. One of them should be 0 or 1 and the other should be
21500 // an SetCC or extended from it.
21501 SDValue Op1 = Cmp.getOperand(0);
21502 SDValue Op2 = Cmp.getOperand(1);
21505 const ConstantSDNode* C = nullptr;
21506 bool needOppositeCond = (CC == X86::COND_E);
21507 bool checkAgainstTrue = false; // Is it a comparison against 1?
21509 if ((C = dyn_cast<ConstantSDNode>(Op1)))
21511 else if ((C = dyn_cast<ConstantSDNode>(Op2)))
21513 else // Quit if all operands are not constants.
21516 if (C->getZExtValue() == 1) {
21517 needOppositeCond = !needOppositeCond;
21518 checkAgainstTrue = true;
21519 } else if (C->getZExtValue() != 0)
21520 // Quit if the constant is neither 0 or 1.
21523 bool truncatedToBoolWithAnd = false;
21524 // Skip (zext $x), (trunc $x), or (and $x, 1) node.
21525 while (SetCC.getOpcode() == ISD::ZERO_EXTEND ||
21526 SetCC.getOpcode() == ISD::TRUNCATE ||
21527 SetCC.getOpcode() == ISD::AND) {
21528 if (SetCC.getOpcode() == ISD::AND) {
21530 ConstantSDNode *CS;
21531 if ((CS = dyn_cast<ConstantSDNode>(SetCC.getOperand(0))) &&
21532 CS->getZExtValue() == 1)
21534 if ((CS = dyn_cast<ConstantSDNode>(SetCC.getOperand(1))) &&
21535 CS->getZExtValue() == 1)
21539 SetCC = SetCC.getOperand(OpIdx);
21540 truncatedToBoolWithAnd = true;
21542 SetCC = SetCC.getOperand(0);
21545 switch (SetCC.getOpcode()) {
21546 case X86ISD::SETCC_CARRY:
21547 // Since SETCC_CARRY gives output based on R = CF ? ~0 : 0, it's unsafe to
21548 // simplify it if the result of SETCC_CARRY is not canonicalized to 0 or 1,
21549 // i.e. it's a comparison against true but the result of SETCC_CARRY is not
21550 // truncated to i1 using 'and'.
21551 if (checkAgainstTrue && !truncatedToBoolWithAnd)
21553 assert(X86::CondCode(SetCC.getConstantOperandVal(0)) == X86::COND_B &&
21554 "Invalid use of SETCC_CARRY!");
21556 case X86ISD::SETCC:
21557 // Set the condition code or opposite one if necessary.
21558 CC = X86::CondCode(SetCC.getConstantOperandVal(0));
21559 if (needOppositeCond)
21560 CC = X86::GetOppositeBranchCondition(CC);
21561 return SetCC.getOperand(1);
21562 case X86ISD::CMOV: {
21563 // Check whether false/true value has canonical one, i.e. 0 or 1.
21564 ConstantSDNode *FVal = dyn_cast<ConstantSDNode>(SetCC.getOperand(0));
21565 ConstantSDNode *TVal = dyn_cast<ConstantSDNode>(SetCC.getOperand(1));
21566 // Quit if true value is not a constant.
21569 // Quit if false value is not a constant.
21571 SDValue Op = SetCC.getOperand(0);
21572 // Skip 'zext' or 'trunc' node.
21573 if (Op.getOpcode() == ISD::ZERO_EXTEND ||
21574 Op.getOpcode() == ISD::TRUNCATE)
21575 Op = Op.getOperand(0);
21576 // A special case for rdrand/rdseed, where 0 is set if false cond is
21578 if ((Op.getOpcode() != X86ISD::RDRAND &&
21579 Op.getOpcode() != X86ISD::RDSEED) || Op.getResNo() != 0)
21582 // Quit if false value is not the constant 0 or 1.
21583 bool FValIsFalse = true;
21584 if (FVal && FVal->getZExtValue() != 0) {
21585 if (FVal->getZExtValue() != 1)
21587 // If FVal is 1, opposite cond is needed.
21588 needOppositeCond = !needOppositeCond;
21589 FValIsFalse = false;
21591 // Quit if TVal is not the constant opposite of FVal.
21592 if (FValIsFalse && TVal->getZExtValue() != 1)
21594 if (!FValIsFalse && TVal->getZExtValue() != 0)
21596 CC = X86::CondCode(SetCC.getConstantOperandVal(2));
21597 if (needOppositeCond)
21598 CC = X86::GetOppositeBranchCondition(CC);
21599 return SetCC.getOperand(3);
21606 /// Optimize X86ISD::CMOV [LHS, RHS, CONDCODE (e.g. X86::COND_NE), CONDVAL]
21607 static SDValue PerformCMOVCombine(SDNode *N, SelectionDAG &DAG,
21608 TargetLowering::DAGCombinerInfo &DCI,
21609 const X86Subtarget *Subtarget) {
21612 // If the flag operand isn't dead, don't touch this CMOV.
21613 if (N->getNumValues() == 2 && !SDValue(N, 1).use_empty())
21616 SDValue FalseOp = N->getOperand(0);
21617 SDValue TrueOp = N->getOperand(1);
21618 X86::CondCode CC = (X86::CondCode)N->getConstantOperandVal(2);
21619 SDValue Cond = N->getOperand(3);
21621 if (CC == X86::COND_E || CC == X86::COND_NE) {
21622 switch (Cond.getOpcode()) {
21626 // If operand of BSR / BSF are proven never zero, then ZF cannot be set.
21627 if (DAG.isKnownNeverZero(Cond.getOperand(0)))
21628 return (CC == X86::COND_E) ? FalseOp : TrueOp;
21634 Flags = checkBoolTestSetCCCombine(Cond, CC);
21635 if (Flags.getNode() &&
21636 // Extra check as FCMOV only supports a subset of X86 cond.
21637 (FalseOp.getValueType() != MVT::f80 || hasFPCMov(CC))) {
21638 SDValue Ops[] = { FalseOp, TrueOp,
21639 DAG.getConstant(CC, MVT::i8), Flags };
21640 return DAG.getNode(X86ISD::CMOV, DL, N->getVTList(), Ops);
21643 // If this is a select between two integer constants, try to do some
21644 // optimizations. Note that the operands are ordered the opposite of SELECT
21646 if (ConstantSDNode *TrueC = dyn_cast<ConstantSDNode>(TrueOp)) {
21647 if (ConstantSDNode *FalseC = dyn_cast<ConstantSDNode>(FalseOp)) {
21648 // Canonicalize the TrueC/FalseC values so that TrueC (the true value) is
21649 // larger than FalseC (the false value).
21650 if (TrueC->getAPIntValue().ult(FalseC->getAPIntValue())) {
21651 CC = X86::GetOppositeBranchCondition(CC);
21652 std::swap(TrueC, FalseC);
21653 std::swap(TrueOp, FalseOp);
21656 // Optimize C ? 8 : 0 -> zext(setcc(C)) << 3. Likewise for any pow2/0.
21657 // This is efficient for any integer data type (including i8/i16) and
21659 if (FalseC->getAPIntValue() == 0 && TrueC->getAPIntValue().isPowerOf2()) {
21660 Cond = DAG.getNode(X86ISD::SETCC, DL, MVT::i8,
21661 DAG.getConstant(CC, MVT::i8), Cond);
21663 // Zero extend the condition if needed.
21664 Cond = DAG.getNode(ISD::ZERO_EXTEND, DL, TrueC->getValueType(0), Cond);
21666 unsigned ShAmt = TrueC->getAPIntValue().logBase2();
21667 Cond = DAG.getNode(ISD::SHL, DL, Cond.getValueType(), Cond,
21668 DAG.getConstant(ShAmt, MVT::i8));
21669 if (N->getNumValues() == 2) // Dead flag value?
21670 return DCI.CombineTo(N, Cond, SDValue());
21674 // Optimize Cond ? cst+1 : cst -> zext(setcc(C)+cst. This is efficient
21675 // for any integer data type, including i8/i16.
21676 if (FalseC->getAPIntValue()+1 == TrueC->getAPIntValue()) {
21677 Cond = DAG.getNode(X86ISD::SETCC, DL, MVT::i8,
21678 DAG.getConstant(CC, MVT::i8), Cond);
21680 // Zero extend the condition if needed.
21681 Cond = DAG.getNode(ISD::ZERO_EXTEND, DL,
21682 FalseC->getValueType(0), Cond);
21683 Cond = DAG.getNode(ISD::ADD, DL, Cond.getValueType(), Cond,
21684 SDValue(FalseC, 0));
21686 if (N->getNumValues() == 2) // Dead flag value?
21687 return DCI.CombineTo(N, Cond, SDValue());
21691 // Optimize cases that will turn into an LEA instruction. This requires
21692 // an i32 or i64 and an efficient multiplier (1, 2, 3, 4, 5, 8, 9).
21693 if (N->getValueType(0) == MVT::i32 || N->getValueType(0) == MVT::i64) {
21694 uint64_t Diff = TrueC->getZExtValue()-FalseC->getZExtValue();
21695 if (N->getValueType(0) == MVT::i32) Diff = (unsigned)Diff;
21697 bool isFastMultiplier = false;
21699 switch ((unsigned char)Diff) {
21701 case 1: // result = add base, cond
21702 case 2: // result = lea base( , cond*2)
21703 case 3: // result = lea base(cond, cond*2)
21704 case 4: // result = lea base( , cond*4)
21705 case 5: // result = lea base(cond, cond*4)
21706 case 8: // result = lea base( , cond*8)
21707 case 9: // result = lea base(cond, cond*8)
21708 isFastMultiplier = true;
21713 if (isFastMultiplier) {
21714 APInt Diff = TrueC->getAPIntValue()-FalseC->getAPIntValue();
21715 Cond = DAG.getNode(X86ISD::SETCC, DL, MVT::i8,
21716 DAG.getConstant(CC, MVT::i8), Cond);
21717 // Zero extend the condition if needed.
21718 Cond = DAG.getNode(ISD::ZERO_EXTEND, DL, FalseC->getValueType(0),
21720 // Scale the condition by the difference.
21722 Cond = DAG.getNode(ISD::MUL, DL, Cond.getValueType(), Cond,
21723 DAG.getConstant(Diff, Cond.getValueType()));
21725 // Add the base if non-zero.
21726 if (FalseC->getAPIntValue() != 0)
21727 Cond = DAG.getNode(ISD::ADD, DL, Cond.getValueType(), Cond,
21728 SDValue(FalseC, 0));
21729 if (N->getNumValues() == 2) // Dead flag value?
21730 return DCI.CombineTo(N, Cond, SDValue());
21737 // Handle these cases:
21738 // (select (x != c), e, c) -> select (x != c), e, x),
21739 // (select (x == c), c, e) -> select (x == c), x, e)
21740 // where the c is an integer constant, and the "select" is the combination
21741 // of CMOV and CMP.
21743 // The rationale for this change is that the conditional-move from a constant
21744 // needs two instructions, however, conditional-move from a register needs
21745 // only one instruction.
21747 // CAVEAT: By replacing a constant with a symbolic value, it may obscure
21748 // some instruction-combining opportunities. This opt needs to be
21749 // postponed as late as possible.
21751 if (!DCI.isBeforeLegalize() && !DCI.isBeforeLegalizeOps()) {
21752 // the DCI.xxxx conditions are provided to postpone the optimization as
21753 // late as possible.
21755 ConstantSDNode *CmpAgainst = nullptr;
21756 if ((Cond.getOpcode() == X86ISD::CMP || Cond.getOpcode() == X86ISD::SUB) &&
21757 (CmpAgainst = dyn_cast<ConstantSDNode>(Cond.getOperand(1))) &&
21758 !isa<ConstantSDNode>(Cond.getOperand(0))) {
21760 if (CC == X86::COND_NE &&
21761 CmpAgainst == dyn_cast<ConstantSDNode>(FalseOp)) {
21762 CC = X86::GetOppositeBranchCondition(CC);
21763 std::swap(TrueOp, FalseOp);
21766 if (CC == X86::COND_E &&
21767 CmpAgainst == dyn_cast<ConstantSDNode>(TrueOp)) {
21768 SDValue Ops[] = { FalseOp, Cond.getOperand(0),
21769 DAG.getConstant(CC, MVT::i8), Cond };
21770 return DAG.getNode(X86ISD::CMOV, DL, N->getVTList (), Ops);
21778 static SDValue PerformINTRINSIC_WO_CHAINCombine(SDNode *N, SelectionDAG &DAG,
21779 const X86Subtarget *Subtarget) {
21780 unsigned IntNo = cast<ConstantSDNode>(N->getOperand(0))->getZExtValue();
21782 default: return SDValue();
21783 // SSE/AVX/AVX2 blend intrinsics.
21784 case Intrinsic::x86_avx2_pblendvb:
21785 case Intrinsic::x86_avx2_pblendw:
21786 case Intrinsic::x86_avx2_pblendd_128:
21787 case Intrinsic::x86_avx2_pblendd_256:
21788 // Don't try to simplify this intrinsic if we don't have AVX2.
21789 if (!Subtarget->hasAVX2())
21792 case Intrinsic::x86_avx_blend_pd_256:
21793 case Intrinsic::x86_avx_blend_ps_256:
21794 case Intrinsic::x86_avx_blendv_pd_256:
21795 case Intrinsic::x86_avx_blendv_ps_256:
21796 // Don't try to simplify this intrinsic if we don't have AVX.
21797 if (!Subtarget->hasAVX())
21800 case Intrinsic::x86_sse41_pblendw:
21801 case Intrinsic::x86_sse41_blendpd:
21802 case Intrinsic::x86_sse41_blendps:
21803 case Intrinsic::x86_sse41_blendvps:
21804 case Intrinsic::x86_sse41_blendvpd:
21805 case Intrinsic::x86_sse41_pblendvb: {
21806 SDValue Op0 = N->getOperand(1);
21807 SDValue Op1 = N->getOperand(2);
21808 SDValue Mask = N->getOperand(3);
21810 // Don't try to simplify this intrinsic if we don't have SSE4.1.
21811 if (!Subtarget->hasSSE41())
21814 // fold (blend A, A, Mask) -> A
21817 // fold (blend A, B, allZeros) -> A
21818 if (ISD::isBuildVectorAllZeros(Mask.getNode()))
21820 // fold (blend A, B, allOnes) -> B
21821 if (ISD::isBuildVectorAllOnes(Mask.getNode()))
21824 // Simplify the case where the mask is a constant i32 value.
21825 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Mask)) {
21826 if (C->isNullValue())
21828 if (C->isAllOnesValue())
21835 // Packed SSE2/AVX2 arithmetic shift immediate intrinsics.
21836 case Intrinsic::x86_sse2_psrai_w:
21837 case Intrinsic::x86_sse2_psrai_d:
21838 case Intrinsic::x86_avx2_psrai_w:
21839 case Intrinsic::x86_avx2_psrai_d:
21840 case Intrinsic::x86_sse2_psra_w:
21841 case Intrinsic::x86_sse2_psra_d:
21842 case Intrinsic::x86_avx2_psra_w:
21843 case Intrinsic::x86_avx2_psra_d: {
21844 SDValue Op0 = N->getOperand(1);
21845 SDValue Op1 = N->getOperand(2);
21846 EVT VT = Op0.getValueType();
21847 assert(VT.isVector() && "Expected a vector type!");
21849 if (isa<BuildVectorSDNode>(Op1))
21850 Op1 = Op1.getOperand(0);
21852 if (!isa<ConstantSDNode>(Op1))
21855 EVT SVT = VT.getVectorElementType();
21856 unsigned SVTBits = SVT.getSizeInBits();
21858 ConstantSDNode *CND = cast<ConstantSDNode>(Op1);
21859 const APInt &C = APInt(SVTBits, CND->getAPIntValue().getZExtValue());
21860 uint64_t ShAmt = C.getZExtValue();
21862 // Don't try to convert this shift into a ISD::SRA if the shift
21863 // count is bigger than or equal to the element size.
21864 if (ShAmt >= SVTBits)
21867 // Trivial case: if the shift count is zero, then fold this
21868 // into the first operand.
21872 // Replace this packed shift intrinsic with a target independent
21874 SDValue Splat = DAG.getConstant(C, VT);
21875 return DAG.getNode(ISD::SRA, SDLoc(N), VT, Op0, Splat);
21880 /// PerformMulCombine - Optimize a single multiply with constant into two
21881 /// in order to implement it with two cheaper instructions, e.g.
21882 /// LEA + SHL, LEA + LEA.
21883 static SDValue PerformMulCombine(SDNode *N, SelectionDAG &DAG,
21884 TargetLowering::DAGCombinerInfo &DCI) {
21885 if (DCI.isBeforeLegalize() || DCI.isCalledByLegalizer())
21888 EVT VT = N->getValueType(0);
21889 if (VT != MVT::i64)
21892 ConstantSDNode *C = dyn_cast<ConstantSDNode>(N->getOperand(1));
21895 uint64_t MulAmt = C->getZExtValue();
21896 if (isPowerOf2_64(MulAmt) || MulAmt == 3 || MulAmt == 5 || MulAmt == 9)
21899 uint64_t MulAmt1 = 0;
21900 uint64_t MulAmt2 = 0;
21901 if ((MulAmt % 9) == 0) {
21903 MulAmt2 = MulAmt / 9;
21904 } else if ((MulAmt % 5) == 0) {
21906 MulAmt2 = MulAmt / 5;
21907 } else if ((MulAmt % 3) == 0) {
21909 MulAmt2 = MulAmt / 3;
21912 (isPowerOf2_64(MulAmt2) || MulAmt2 == 3 || MulAmt2 == 5 || MulAmt2 == 9)){
21915 if (isPowerOf2_64(MulAmt2) &&
21916 !(N->hasOneUse() && N->use_begin()->getOpcode() == ISD::ADD))
21917 // If second multiplifer is pow2, issue it first. We want the multiply by
21918 // 3, 5, or 9 to be folded into the addressing mode unless the lone use
21920 std::swap(MulAmt1, MulAmt2);
21923 if (isPowerOf2_64(MulAmt1))
21924 NewMul = DAG.getNode(ISD::SHL, DL, VT, N->getOperand(0),
21925 DAG.getConstant(Log2_64(MulAmt1), MVT::i8));
21927 NewMul = DAG.getNode(X86ISD::MUL_IMM, DL, VT, N->getOperand(0),
21928 DAG.getConstant(MulAmt1, VT));
21930 if (isPowerOf2_64(MulAmt2))
21931 NewMul = DAG.getNode(ISD::SHL, DL, VT, NewMul,
21932 DAG.getConstant(Log2_64(MulAmt2), MVT::i8));
21934 NewMul = DAG.getNode(X86ISD::MUL_IMM, DL, VT, NewMul,
21935 DAG.getConstant(MulAmt2, VT));
21937 // Do not add new nodes to DAG combiner worklist.
21938 DCI.CombineTo(N, NewMul, false);
21943 static SDValue PerformSHLCombine(SDNode *N, SelectionDAG &DAG) {
21944 SDValue N0 = N->getOperand(0);
21945 SDValue N1 = N->getOperand(1);
21946 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1);
21947 EVT VT = N0.getValueType();
21949 // fold (shl (and (setcc_c), c1), c2) -> (and setcc_c, (c1 << c2))
21950 // since the result of setcc_c is all zero's or all ones.
21951 if (VT.isInteger() && !VT.isVector() &&
21952 N1C && N0.getOpcode() == ISD::AND &&
21953 N0.getOperand(1).getOpcode() == ISD::Constant) {
21954 SDValue N00 = N0.getOperand(0);
21955 if (N00.getOpcode() == X86ISD::SETCC_CARRY ||
21956 ((N00.getOpcode() == ISD::ANY_EXTEND ||
21957 N00.getOpcode() == ISD::ZERO_EXTEND) &&
21958 N00.getOperand(0).getOpcode() == X86ISD::SETCC_CARRY)) {
21959 APInt Mask = cast<ConstantSDNode>(N0.getOperand(1))->getAPIntValue();
21960 APInt ShAmt = N1C->getAPIntValue();
21961 Mask = Mask.shl(ShAmt);
21963 return DAG.getNode(ISD::AND, SDLoc(N), VT,
21964 N00, DAG.getConstant(Mask, VT));
21968 // Hardware support for vector shifts is sparse which makes us scalarize the
21969 // vector operations in many cases. Also, on sandybridge ADD is faster than
21971 // (shl V, 1) -> add V,V
21972 if (auto *N1BV = dyn_cast<BuildVectorSDNode>(N1))
21973 if (auto *N1SplatC = N1BV->getConstantSplatNode()) {
21974 assert(N0.getValueType().isVector() && "Invalid vector shift type");
21975 // We shift all of the values by one. In many cases we do not have
21976 // hardware support for this operation. This is better expressed as an ADD
21978 if (N1SplatC->getZExtValue() == 1)
21979 return DAG.getNode(ISD::ADD, SDLoc(N), VT, N0, N0);
21985 /// \brief Returns a vector of 0s if the node in input is a vector logical
21986 /// shift by a constant amount which is known to be bigger than or equal
21987 /// to the vector element size in bits.
21988 static SDValue performShiftToAllZeros(SDNode *N, SelectionDAG &DAG,
21989 const X86Subtarget *Subtarget) {
21990 EVT VT = N->getValueType(0);
21992 if (VT != MVT::v2i64 && VT != MVT::v4i32 && VT != MVT::v8i16 &&
21993 (!Subtarget->hasInt256() ||
21994 (VT != MVT::v4i64 && VT != MVT::v8i32 && VT != MVT::v16i16)))
21997 SDValue Amt = N->getOperand(1);
21999 if (auto *AmtBV = dyn_cast<BuildVectorSDNode>(Amt))
22000 if (auto *AmtSplat = AmtBV->getConstantSplatNode()) {
22001 APInt ShiftAmt = AmtSplat->getAPIntValue();
22002 unsigned MaxAmount = VT.getVectorElementType().getSizeInBits();
22004 // SSE2/AVX2 logical shifts always return a vector of 0s
22005 // if the shift amount is bigger than or equal to
22006 // the element size. The constant shift amount will be
22007 // encoded as a 8-bit immediate.
22008 if (ShiftAmt.trunc(8).uge(MaxAmount))
22009 return getZeroVector(VT, Subtarget, DAG, DL);
22015 /// PerformShiftCombine - Combine shifts.
22016 static SDValue PerformShiftCombine(SDNode* N, SelectionDAG &DAG,
22017 TargetLowering::DAGCombinerInfo &DCI,
22018 const X86Subtarget *Subtarget) {
22019 if (N->getOpcode() == ISD::SHL) {
22020 SDValue V = PerformSHLCombine(N, DAG);
22021 if (V.getNode()) return V;
22024 if (N->getOpcode() != ISD::SRA) {
22025 // Try to fold this logical shift into a zero vector.
22026 SDValue V = performShiftToAllZeros(N, DAG, Subtarget);
22027 if (V.getNode()) return V;
22033 // CMPEQCombine - Recognize the distinctive (AND (setcc ...) (setcc ..))
22034 // where both setccs reference the same FP CMP, and rewrite for CMPEQSS
22035 // and friends. Likewise for OR -> CMPNEQSS.
22036 static SDValue CMPEQCombine(SDNode *N, SelectionDAG &DAG,
22037 TargetLowering::DAGCombinerInfo &DCI,
22038 const X86Subtarget *Subtarget) {
22041 // SSE1 supports CMP{eq|ne}SS, and SSE2 added CMP{eq|ne}SD, but
22042 // we're requiring SSE2 for both.
22043 if (Subtarget->hasSSE2() && isAndOrOfSetCCs(SDValue(N, 0U), opcode)) {
22044 SDValue N0 = N->getOperand(0);
22045 SDValue N1 = N->getOperand(1);
22046 SDValue CMP0 = N0->getOperand(1);
22047 SDValue CMP1 = N1->getOperand(1);
22050 // The SETCCs should both refer to the same CMP.
22051 if (CMP0.getOpcode() != X86ISD::CMP || CMP0 != CMP1)
22054 SDValue CMP00 = CMP0->getOperand(0);
22055 SDValue CMP01 = CMP0->getOperand(1);
22056 EVT VT = CMP00.getValueType();
22058 if (VT == MVT::f32 || VT == MVT::f64) {
22059 bool ExpectingFlags = false;
22060 // Check for any users that want flags:
22061 for (SDNode::use_iterator UI = N->use_begin(), UE = N->use_end();
22062 !ExpectingFlags && UI != UE; ++UI)
22063 switch (UI->getOpcode()) {
22068 ExpectingFlags = true;
22070 case ISD::CopyToReg:
22071 case ISD::SIGN_EXTEND:
22072 case ISD::ZERO_EXTEND:
22073 case ISD::ANY_EXTEND:
22077 if (!ExpectingFlags) {
22078 enum X86::CondCode cc0 = (enum X86::CondCode)N0.getConstantOperandVal(0);
22079 enum X86::CondCode cc1 = (enum X86::CondCode)N1.getConstantOperandVal(0);
22081 if (cc1 == X86::COND_E || cc1 == X86::COND_NE) {
22082 X86::CondCode tmp = cc0;
22087 if ((cc0 == X86::COND_E && cc1 == X86::COND_NP) ||
22088 (cc0 == X86::COND_NE && cc1 == X86::COND_P)) {
22089 // FIXME: need symbolic constants for these magic numbers.
22090 // See X86ATTInstPrinter.cpp:printSSECC().
22091 unsigned x86cc = (cc0 == X86::COND_E) ? 0 : 4;
22092 if (Subtarget->hasAVX512()) {
22093 SDValue FSetCC = DAG.getNode(X86ISD::FSETCC, DL, MVT::i1, CMP00,
22094 CMP01, DAG.getConstant(x86cc, MVT::i8));
22095 if (N->getValueType(0) != MVT::i1)
22096 return DAG.getNode(ISD::ZERO_EXTEND, DL, N->getValueType(0),
22100 SDValue OnesOrZeroesF = DAG.getNode(X86ISD::FSETCC, DL,
22101 CMP00.getValueType(), CMP00, CMP01,
22102 DAG.getConstant(x86cc, MVT::i8));
22104 bool is64BitFP = (CMP00.getValueType() == MVT::f64);
22105 MVT IntVT = is64BitFP ? MVT::i64 : MVT::i32;
22107 if (is64BitFP && !Subtarget->is64Bit()) {
22108 // On a 32-bit target, we cannot bitcast the 64-bit float to a
22109 // 64-bit integer, since that's not a legal type. Since
22110 // OnesOrZeroesF is all ones of all zeroes, we don't need all the
22111 // bits, but can do this little dance to extract the lowest 32 bits
22112 // and work with those going forward.
22113 SDValue Vector64 = DAG.getNode(ISD::SCALAR_TO_VECTOR, DL, MVT::v2f64,
22115 SDValue Vector32 = DAG.getNode(ISD::BITCAST, DL, MVT::v4f32,
22117 OnesOrZeroesF = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, DL, MVT::f32,
22118 Vector32, DAG.getIntPtrConstant(0));
22122 SDValue OnesOrZeroesI = DAG.getNode(ISD::BITCAST, DL, IntVT, OnesOrZeroesF);
22123 SDValue ANDed = DAG.getNode(ISD::AND, DL, IntVT, OnesOrZeroesI,
22124 DAG.getConstant(1, IntVT));
22125 SDValue OneBitOfTruth = DAG.getNode(ISD::TRUNCATE, DL, MVT::i8, ANDed);
22126 return OneBitOfTruth;
22134 /// CanFoldXORWithAllOnes - Test whether the XOR operand is a AllOnes vector
22135 /// so it can be folded inside ANDNP.
22136 static bool CanFoldXORWithAllOnes(const SDNode *N) {
22137 EVT VT = N->getValueType(0);
22139 // Match direct AllOnes for 128 and 256-bit vectors
22140 if (ISD::isBuildVectorAllOnes(N))
22143 // Look through a bit convert.
22144 if (N->getOpcode() == ISD::BITCAST)
22145 N = N->getOperand(0).getNode();
22147 // Sometimes the operand may come from a insert_subvector building a 256-bit
22149 if (VT.is256BitVector() &&
22150 N->getOpcode() == ISD::INSERT_SUBVECTOR) {
22151 SDValue V1 = N->getOperand(0);
22152 SDValue V2 = N->getOperand(1);
22154 if (V1.getOpcode() == ISD::INSERT_SUBVECTOR &&
22155 V1.getOperand(0).getOpcode() == ISD::UNDEF &&
22156 ISD::isBuildVectorAllOnes(V1.getOperand(1).getNode()) &&
22157 ISD::isBuildVectorAllOnes(V2.getNode()))
22164 // On AVX/AVX2 the type v8i1 is legalized to v8i16, which is an XMM sized
22165 // register. In most cases we actually compare or select YMM-sized registers
22166 // and mixing the two types creates horrible code. This method optimizes
22167 // some of the transition sequences.
22168 static SDValue WidenMaskArithmetic(SDNode *N, SelectionDAG &DAG,
22169 TargetLowering::DAGCombinerInfo &DCI,
22170 const X86Subtarget *Subtarget) {
22171 EVT VT = N->getValueType(0);
22172 if (!VT.is256BitVector())
22175 assert((N->getOpcode() == ISD::ANY_EXTEND ||
22176 N->getOpcode() == ISD::ZERO_EXTEND ||
22177 N->getOpcode() == ISD::SIGN_EXTEND) && "Invalid Node");
22179 SDValue Narrow = N->getOperand(0);
22180 EVT NarrowVT = Narrow->getValueType(0);
22181 if (!NarrowVT.is128BitVector())
22184 if (Narrow->getOpcode() != ISD::XOR &&
22185 Narrow->getOpcode() != ISD::AND &&
22186 Narrow->getOpcode() != ISD::OR)
22189 SDValue N0 = Narrow->getOperand(0);
22190 SDValue N1 = Narrow->getOperand(1);
22193 // The Left side has to be a trunc.
22194 if (N0.getOpcode() != ISD::TRUNCATE)
22197 // The type of the truncated inputs.
22198 EVT WideVT = N0->getOperand(0)->getValueType(0);
22202 // The right side has to be a 'trunc' or a constant vector.
22203 bool RHSTrunc = N1.getOpcode() == ISD::TRUNCATE;
22204 ConstantSDNode *RHSConstSplat = nullptr;
22205 if (auto *RHSBV = dyn_cast<BuildVectorSDNode>(N1))
22206 RHSConstSplat = RHSBV->getConstantSplatNode();
22207 if (!RHSTrunc && !RHSConstSplat)
22210 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
22212 if (!TLI.isOperationLegalOrPromote(Narrow->getOpcode(), WideVT))
22215 // Set N0 and N1 to hold the inputs to the new wide operation.
22216 N0 = N0->getOperand(0);
22217 if (RHSConstSplat) {
22218 N1 = DAG.getNode(ISD::ZERO_EXTEND, DL, WideVT.getScalarType(),
22219 SDValue(RHSConstSplat, 0));
22220 SmallVector<SDValue, 8> C(WideVT.getVectorNumElements(), N1);
22221 N1 = DAG.getNode(ISD::BUILD_VECTOR, DL, WideVT, C);
22222 } else if (RHSTrunc) {
22223 N1 = N1->getOperand(0);
22226 // Generate the wide operation.
22227 SDValue Op = DAG.getNode(Narrow->getOpcode(), DL, WideVT, N0, N1);
22228 unsigned Opcode = N->getOpcode();
22230 case ISD::ANY_EXTEND:
22232 case ISD::ZERO_EXTEND: {
22233 unsigned InBits = NarrowVT.getScalarType().getSizeInBits();
22234 APInt Mask = APInt::getAllOnesValue(InBits);
22235 Mask = Mask.zext(VT.getScalarType().getSizeInBits());
22236 return DAG.getNode(ISD::AND, DL, VT,
22237 Op, DAG.getConstant(Mask, VT));
22239 case ISD::SIGN_EXTEND:
22240 return DAG.getNode(ISD::SIGN_EXTEND_INREG, DL, VT,
22241 Op, DAG.getValueType(NarrowVT));
22243 llvm_unreachable("Unexpected opcode");
22247 static SDValue PerformAndCombine(SDNode *N, SelectionDAG &DAG,
22248 TargetLowering::DAGCombinerInfo &DCI,
22249 const X86Subtarget *Subtarget) {
22250 EVT VT = N->getValueType(0);
22251 if (DCI.isBeforeLegalizeOps())
22254 SDValue R = CMPEQCombine(N, DAG, DCI, Subtarget);
22258 // Create BEXTR instructions
22259 // BEXTR is ((X >> imm) & (2**size-1))
22260 if (VT == MVT::i32 || VT == MVT::i64) {
22261 SDValue N0 = N->getOperand(0);
22262 SDValue N1 = N->getOperand(1);
22265 // Check for BEXTR.
22266 if ((Subtarget->hasBMI() || Subtarget->hasTBM()) &&
22267 (N0.getOpcode() == ISD::SRA || N0.getOpcode() == ISD::SRL)) {
22268 ConstantSDNode *MaskNode = dyn_cast<ConstantSDNode>(N1);
22269 ConstantSDNode *ShiftNode = dyn_cast<ConstantSDNode>(N0.getOperand(1));
22270 if (MaskNode && ShiftNode) {
22271 uint64_t Mask = MaskNode->getZExtValue();
22272 uint64_t Shift = ShiftNode->getZExtValue();
22273 if (isMask_64(Mask)) {
22274 uint64_t MaskSize = CountPopulation_64(Mask);
22275 if (Shift + MaskSize <= VT.getSizeInBits())
22276 return DAG.getNode(X86ISD::BEXTR, DL, VT, N0.getOperand(0),
22277 DAG.getConstant(Shift | (MaskSize << 8), VT));
22285 // Want to form ANDNP nodes:
22286 // 1) In the hopes of then easily combining them with OR and AND nodes
22287 // to form PBLEND/PSIGN.
22288 // 2) To match ANDN packed intrinsics
22289 if (VT != MVT::v2i64 && VT != MVT::v4i64)
22292 SDValue N0 = N->getOperand(0);
22293 SDValue N1 = N->getOperand(1);
22296 // Check LHS for vnot
22297 if (N0.getOpcode() == ISD::XOR &&
22298 //ISD::isBuildVectorAllOnes(N0.getOperand(1).getNode()))
22299 CanFoldXORWithAllOnes(N0.getOperand(1).getNode()))
22300 return DAG.getNode(X86ISD::ANDNP, DL, VT, N0.getOperand(0), N1);
22302 // Check RHS for vnot
22303 if (N1.getOpcode() == ISD::XOR &&
22304 //ISD::isBuildVectorAllOnes(N1.getOperand(1).getNode()))
22305 CanFoldXORWithAllOnes(N1.getOperand(1).getNode()))
22306 return DAG.getNode(X86ISD::ANDNP, DL, VT, N1.getOperand(0), N0);
22311 static SDValue PerformOrCombine(SDNode *N, SelectionDAG &DAG,
22312 TargetLowering::DAGCombinerInfo &DCI,
22313 const X86Subtarget *Subtarget) {
22314 if (DCI.isBeforeLegalizeOps())
22317 SDValue R = CMPEQCombine(N, DAG, DCI, Subtarget);
22321 SDValue N0 = N->getOperand(0);
22322 SDValue N1 = N->getOperand(1);
22323 EVT VT = N->getValueType(0);
22325 // look for psign/blend
22326 if (VT == MVT::v2i64 || VT == MVT::v4i64) {
22327 if (!Subtarget->hasSSSE3() ||
22328 (VT == MVT::v4i64 && !Subtarget->hasInt256()))
22331 // Canonicalize pandn to RHS
22332 if (N0.getOpcode() == X86ISD::ANDNP)
22334 // or (and (m, y), (pandn m, x))
22335 if (N0.getOpcode() == ISD::AND && N1.getOpcode() == X86ISD::ANDNP) {
22336 SDValue Mask = N1.getOperand(0);
22337 SDValue X = N1.getOperand(1);
22339 if (N0.getOperand(0) == Mask)
22340 Y = N0.getOperand(1);
22341 if (N0.getOperand(1) == Mask)
22342 Y = N0.getOperand(0);
22344 // Check to see if the mask appeared in both the AND and ANDNP and
22348 // Validate that X, Y, and Mask are BIT_CONVERTS, and see through them.
22349 // Look through mask bitcast.
22350 if (Mask.getOpcode() == ISD::BITCAST)
22351 Mask = Mask.getOperand(0);
22352 if (X.getOpcode() == ISD::BITCAST)
22353 X = X.getOperand(0);
22354 if (Y.getOpcode() == ISD::BITCAST)
22355 Y = Y.getOperand(0);
22357 EVT MaskVT = Mask.getValueType();
22359 // Validate that the Mask operand is a vector sra node.
22360 // FIXME: what to do for bytes, since there is a psignb/pblendvb, but
22361 // there is no psrai.b
22362 unsigned EltBits = MaskVT.getVectorElementType().getSizeInBits();
22363 unsigned SraAmt = ~0;
22364 if (Mask.getOpcode() == ISD::SRA) {
22365 if (auto *AmtBV = dyn_cast<BuildVectorSDNode>(Mask.getOperand(1)))
22366 if (auto *AmtConst = AmtBV->getConstantSplatNode())
22367 SraAmt = AmtConst->getZExtValue();
22368 } else if (Mask.getOpcode() == X86ISD::VSRAI) {
22369 SDValue SraC = Mask.getOperand(1);
22370 SraAmt = cast<ConstantSDNode>(SraC)->getZExtValue();
22372 if ((SraAmt + 1) != EltBits)
22377 // Now we know we at least have a plendvb with the mask val. See if
22378 // we can form a psignb/w/d.
22379 // psign = x.type == y.type == mask.type && y = sub(0, x);
22380 if (Y.getOpcode() == ISD::SUB && Y.getOperand(1) == X &&
22381 ISD::isBuildVectorAllZeros(Y.getOperand(0).getNode()) &&
22382 X.getValueType() == MaskVT && Y.getValueType() == MaskVT) {
22383 assert((EltBits == 8 || EltBits == 16 || EltBits == 32) &&
22384 "Unsupported VT for PSIGN");
22385 Mask = DAG.getNode(X86ISD::PSIGN, DL, MaskVT, X, Mask.getOperand(0));
22386 return DAG.getNode(ISD::BITCAST, DL, VT, Mask);
22388 // PBLENDVB only available on SSE 4.1
22389 if (!Subtarget->hasSSE41())
22392 EVT BlendVT = (VT == MVT::v4i64) ? MVT::v32i8 : MVT::v16i8;
22394 X = DAG.getNode(ISD::BITCAST, DL, BlendVT, X);
22395 Y = DAG.getNode(ISD::BITCAST, DL, BlendVT, Y);
22396 Mask = DAG.getNode(ISD::BITCAST, DL, BlendVT, Mask);
22397 Mask = DAG.getNode(ISD::VSELECT, DL, BlendVT, Mask, Y, X);
22398 return DAG.getNode(ISD::BITCAST, DL, VT, Mask);
22402 if (VT != MVT::i16 && VT != MVT::i32 && VT != MVT::i64)
22405 // fold (or (x << c) | (y >> (64 - c))) ==> (shld64 x, y, c)
22406 MachineFunction &MF = DAG.getMachineFunction();
22407 bool OptForSize = MF.getFunction()->getAttributes().
22408 hasAttribute(AttributeSet::FunctionIndex, Attribute::OptimizeForSize);
22410 // SHLD/SHRD instructions have lower register pressure, but on some
22411 // platforms they have higher latency than the equivalent
22412 // series of shifts/or that would otherwise be generated.
22413 // Don't fold (or (x << c) | (y >> (64 - c))) if SHLD/SHRD instructions
22414 // have higher latencies and we are not optimizing for size.
22415 if (!OptForSize && Subtarget->isSHLDSlow())
22418 if (N0.getOpcode() == ISD::SRL && N1.getOpcode() == ISD::SHL)
22420 if (N0.getOpcode() != ISD::SHL || N1.getOpcode() != ISD::SRL)
22422 if (!N0.hasOneUse() || !N1.hasOneUse())
22425 SDValue ShAmt0 = N0.getOperand(1);
22426 if (ShAmt0.getValueType() != MVT::i8)
22428 SDValue ShAmt1 = N1.getOperand(1);
22429 if (ShAmt1.getValueType() != MVT::i8)
22431 if (ShAmt0.getOpcode() == ISD::TRUNCATE)
22432 ShAmt0 = ShAmt0.getOperand(0);
22433 if (ShAmt1.getOpcode() == ISD::TRUNCATE)
22434 ShAmt1 = ShAmt1.getOperand(0);
22437 unsigned Opc = X86ISD::SHLD;
22438 SDValue Op0 = N0.getOperand(0);
22439 SDValue Op1 = N1.getOperand(0);
22440 if (ShAmt0.getOpcode() == ISD::SUB) {
22441 Opc = X86ISD::SHRD;
22442 std::swap(Op0, Op1);
22443 std::swap(ShAmt0, ShAmt1);
22446 unsigned Bits = VT.getSizeInBits();
22447 if (ShAmt1.getOpcode() == ISD::SUB) {
22448 SDValue Sum = ShAmt1.getOperand(0);
22449 if (ConstantSDNode *SumC = dyn_cast<ConstantSDNode>(Sum)) {
22450 SDValue ShAmt1Op1 = ShAmt1.getOperand(1);
22451 if (ShAmt1Op1.getNode()->getOpcode() == ISD::TRUNCATE)
22452 ShAmt1Op1 = ShAmt1Op1.getOperand(0);
22453 if (SumC->getSExtValue() == Bits && ShAmt1Op1 == ShAmt0)
22454 return DAG.getNode(Opc, DL, VT,
22456 DAG.getNode(ISD::TRUNCATE, DL,
22459 } else if (ConstantSDNode *ShAmt1C = dyn_cast<ConstantSDNode>(ShAmt1)) {
22460 ConstantSDNode *ShAmt0C = dyn_cast<ConstantSDNode>(ShAmt0);
22462 ShAmt0C->getSExtValue() + ShAmt1C->getSExtValue() == Bits)
22463 return DAG.getNode(Opc, DL, VT,
22464 N0.getOperand(0), N1.getOperand(0),
22465 DAG.getNode(ISD::TRUNCATE, DL,
22472 // Generate NEG and CMOV for integer abs.
22473 static SDValue performIntegerAbsCombine(SDNode *N, SelectionDAG &DAG) {
22474 EVT VT = N->getValueType(0);
22476 // Since X86 does not have CMOV for 8-bit integer, we don't convert
22477 // 8-bit integer abs to NEG and CMOV.
22478 if (VT.isInteger() && VT.getSizeInBits() == 8)
22481 SDValue N0 = N->getOperand(0);
22482 SDValue N1 = N->getOperand(1);
22485 // Check pattern of XOR(ADD(X,Y), Y) where Y is SRA(X, size(X)-1)
22486 // and change it to SUB and CMOV.
22487 if (VT.isInteger() && N->getOpcode() == ISD::XOR &&
22488 N0.getOpcode() == ISD::ADD &&
22489 N0.getOperand(1) == N1 &&
22490 N1.getOpcode() == ISD::SRA &&
22491 N1.getOperand(0) == N0.getOperand(0))
22492 if (ConstantSDNode *Y1C = dyn_cast<ConstantSDNode>(N1.getOperand(1)))
22493 if (Y1C->getAPIntValue() == VT.getSizeInBits()-1) {
22494 // Generate SUB & CMOV.
22495 SDValue Neg = DAG.getNode(X86ISD::SUB, DL, DAG.getVTList(VT, MVT::i32),
22496 DAG.getConstant(0, VT), N0.getOperand(0));
22498 SDValue Ops[] = { N0.getOperand(0), Neg,
22499 DAG.getConstant(X86::COND_GE, MVT::i8),
22500 SDValue(Neg.getNode(), 1) };
22501 return DAG.getNode(X86ISD::CMOV, DL, DAG.getVTList(VT, MVT::Glue), Ops);
22506 // PerformXorCombine - Attempts to turn XOR nodes into BLSMSK nodes
22507 static SDValue PerformXorCombine(SDNode *N, SelectionDAG &DAG,
22508 TargetLowering::DAGCombinerInfo &DCI,
22509 const X86Subtarget *Subtarget) {
22510 if (DCI.isBeforeLegalizeOps())
22513 if (Subtarget->hasCMov()) {
22514 SDValue RV = performIntegerAbsCombine(N, DAG);
22522 /// PerformLOADCombine - Do target-specific dag combines on LOAD nodes.
22523 static SDValue PerformLOADCombine(SDNode *N, SelectionDAG &DAG,
22524 TargetLowering::DAGCombinerInfo &DCI,
22525 const X86Subtarget *Subtarget) {
22526 LoadSDNode *Ld = cast<LoadSDNode>(N);
22527 EVT RegVT = Ld->getValueType(0);
22528 EVT MemVT = Ld->getMemoryVT();
22530 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
22532 // On Sandybridge unaligned 256bit loads are inefficient.
22533 ISD::LoadExtType Ext = Ld->getExtensionType();
22534 unsigned Alignment = Ld->getAlignment();
22535 bool IsAligned = Alignment == 0 || Alignment >= MemVT.getSizeInBits()/8;
22536 if (RegVT.is256BitVector() && !Subtarget->hasInt256() &&
22537 !DCI.isBeforeLegalizeOps() && !IsAligned && Ext == ISD::NON_EXTLOAD) {
22538 unsigned NumElems = RegVT.getVectorNumElements();
22542 SDValue Ptr = Ld->getBasePtr();
22543 SDValue Increment = DAG.getConstant(16, TLI.getPointerTy());
22545 EVT HalfVT = EVT::getVectorVT(*DAG.getContext(), MemVT.getScalarType(),
22547 SDValue Load1 = DAG.getLoad(HalfVT, dl, Ld->getChain(), Ptr,
22548 Ld->getPointerInfo(), Ld->isVolatile(),
22549 Ld->isNonTemporal(), Ld->isInvariant(),
22551 Ptr = DAG.getNode(ISD::ADD, dl, Ptr.getValueType(), Ptr, Increment);
22552 SDValue Load2 = DAG.getLoad(HalfVT, dl, Ld->getChain(), Ptr,
22553 Ld->getPointerInfo(), Ld->isVolatile(),
22554 Ld->isNonTemporal(), Ld->isInvariant(),
22555 std::min(16U, Alignment));
22556 SDValue TF = DAG.getNode(ISD::TokenFactor, dl, MVT::Other,
22558 Load2.getValue(1));
22560 SDValue NewVec = DAG.getUNDEF(RegVT);
22561 NewVec = Insert128BitVector(NewVec, Load1, 0, DAG, dl);
22562 NewVec = Insert128BitVector(NewVec, Load2, NumElems/2, DAG, dl);
22563 return DCI.CombineTo(N, NewVec, TF, true);
22569 /// PerformSTORECombine - Do target-specific dag combines on STORE nodes.
22570 static SDValue PerformSTORECombine(SDNode *N, SelectionDAG &DAG,
22571 const X86Subtarget *Subtarget) {
22572 StoreSDNode *St = cast<StoreSDNode>(N);
22573 EVT VT = St->getValue().getValueType();
22574 EVT StVT = St->getMemoryVT();
22576 SDValue StoredVal = St->getOperand(1);
22577 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
22579 // If we are saving a concatenation of two XMM registers, perform two stores.
22580 // On Sandy Bridge, 256-bit memory operations are executed by two
22581 // 128-bit ports. However, on Haswell it is better to issue a single 256-bit
22582 // memory operation.
22583 unsigned Alignment = St->getAlignment();
22584 bool IsAligned = Alignment == 0 || Alignment >= VT.getSizeInBits()/8;
22585 if (VT.is256BitVector() && !Subtarget->hasInt256() &&
22586 StVT == VT && !IsAligned) {
22587 unsigned NumElems = VT.getVectorNumElements();
22591 SDValue Value0 = Extract128BitVector(StoredVal, 0, DAG, dl);
22592 SDValue Value1 = Extract128BitVector(StoredVal, NumElems/2, DAG, dl);
22594 SDValue Stride = DAG.getConstant(16, TLI.getPointerTy());
22595 SDValue Ptr0 = St->getBasePtr();
22596 SDValue Ptr1 = DAG.getNode(ISD::ADD, dl, Ptr0.getValueType(), Ptr0, Stride);
22598 SDValue Ch0 = DAG.getStore(St->getChain(), dl, Value0, Ptr0,
22599 St->getPointerInfo(), St->isVolatile(),
22600 St->isNonTemporal(), Alignment);
22601 SDValue Ch1 = DAG.getStore(St->getChain(), dl, Value1, Ptr1,
22602 St->getPointerInfo(), St->isVolatile(),
22603 St->isNonTemporal(),
22604 std::min(16U, Alignment));
22605 return DAG.getNode(ISD::TokenFactor, dl, MVT::Other, Ch0, Ch1);
22608 // Optimize trunc store (of multiple scalars) to shuffle and store.
22609 // First, pack all of the elements in one place. Next, store to memory
22610 // in fewer chunks.
22611 if (St->isTruncatingStore() && VT.isVector()) {
22612 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
22613 unsigned NumElems = VT.getVectorNumElements();
22614 assert(StVT != VT && "Cannot truncate to the same type");
22615 unsigned FromSz = VT.getVectorElementType().getSizeInBits();
22616 unsigned ToSz = StVT.getVectorElementType().getSizeInBits();
22618 // From, To sizes and ElemCount must be pow of two
22619 if (!isPowerOf2_32(NumElems * FromSz * ToSz)) return SDValue();
22620 // We are going to use the original vector elt for storing.
22621 // Accumulated smaller vector elements must be a multiple of the store size.
22622 if (0 != (NumElems * FromSz) % ToSz) return SDValue();
22624 unsigned SizeRatio = FromSz / ToSz;
22626 assert(SizeRatio * NumElems * ToSz == VT.getSizeInBits());
22628 // Create a type on which we perform the shuffle
22629 EVT WideVecVT = EVT::getVectorVT(*DAG.getContext(),
22630 StVT.getScalarType(), NumElems*SizeRatio);
22632 assert(WideVecVT.getSizeInBits() == VT.getSizeInBits());
22634 SDValue WideVec = DAG.getNode(ISD::BITCAST, dl, WideVecVT, St->getValue());
22635 SmallVector<int, 8> ShuffleVec(NumElems * SizeRatio, -1);
22636 for (unsigned i = 0; i != NumElems; ++i)
22637 ShuffleVec[i] = i * SizeRatio;
22639 // Can't shuffle using an illegal type.
22640 if (!TLI.isTypeLegal(WideVecVT))
22643 SDValue Shuff = DAG.getVectorShuffle(WideVecVT, dl, WideVec,
22644 DAG.getUNDEF(WideVecVT),
22646 // At this point all of the data is stored at the bottom of the
22647 // register. We now need to save it to mem.
22649 // Find the largest store unit
22650 MVT StoreType = MVT::i8;
22651 for (unsigned tp = MVT::FIRST_INTEGER_VALUETYPE;
22652 tp < MVT::LAST_INTEGER_VALUETYPE; ++tp) {
22653 MVT Tp = (MVT::SimpleValueType)tp;
22654 if (TLI.isTypeLegal(Tp) && Tp.getSizeInBits() <= NumElems * ToSz)
22658 // On 32bit systems, we can't save 64bit integers. Try bitcasting to F64.
22659 if (TLI.isTypeLegal(MVT::f64) && StoreType.getSizeInBits() < 64 &&
22660 (64 <= NumElems * ToSz))
22661 StoreType = MVT::f64;
22663 // Bitcast the original vector into a vector of store-size units
22664 EVT StoreVecVT = EVT::getVectorVT(*DAG.getContext(),
22665 StoreType, VT.getSizeInBits()/StoreType.getSizeInBits());
22666 assert(StoreVecVT.getSizeInBits() == VT.getSizeInBits());
22667 SDValue ShuffWide = DAG.getNode(ISD::BITCAST, dl, StoreVecVT, Shuff);
22668 SmallVector<SDValue, 8> Chains;
22669 SDValue Increment = DAG.getConstant(StoreType.getSizeInBits()/8,
22670 TLI.getPointerTy());
22671 SDValue Ptr = St->getBasePtr();
22673 // Perform one or more big stores into memory.
22674 for (unsigned i=0, e=(ToSz*NumElems)/StoreType.getSizeInBits(); i!=e; ++i) {
22675 SDValue SubVec = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl,
22676 StoreType, ShuffWide,
22677 DAG.getIntPtrConstant(i));
22678 SDValue Ch = DAG.getStore(St->getChain(), dl, SubVec, Ptr,
22679 St->getPointerInfo(), St->isVolatile(),
22680 St->isNonTemporal(), St->getAlignment());
22681 Ptr = DAG.getNode(ISD::ADD, dl, Ptr.getValueType(), Ptr, Increment);
22682 Chains.push_back(Ch);
22685 return DAG.getNode(ISD::TokenFactor, dl, MVT::Other, Chains);
22688 // Turn load->store of MMX types into GPR load/stores. This avoids clobbering
22689 // the FP state in cases where an emms may be missing.
22690 // A preferable solution to the general problem is to figure out the right
22691 // places to insert EMMS. This qualifies as a quick hack.
22693 // Similarly, turn load->store of i64 into double load/stores in 32-bit mode.
22694 if (VT.getSizeInBits() != 64)
22697 const Function *F = DAG.getMachineFunction().getFunction();
22698 bool NoImplicitFloatOps = F->getAttributes().
22699 hasAttribute(AttributeSet::FunctionIndex, Attribute::NoImplicitFloat);
22700 bool F64IsLegal = !DAG.getTarget().Options.UseSoftFloat && !NoImplicitFloatOps
22701 && Subtarget->hasSSE2();
22702 if ((VT.isVector() ||
22703 (VT == MVT::i64 && F64IsLegal && !Subtarget->is64Bit())) &&
22704 isa<LoadSDNode>(St->getValue()) &&
22705 !cast<LoadSDNode>(St->getValue())->isVolatile() &&
22706 St->getChain().hasOneUse() && !St->isVolatile()) {
22707 SDNode* LdVal = St->getValue().getNode();
22708 LoadSDNode *Ld = nullptr;
22709 int TokenFactorIndex = -1;
22710 SmallVector<SDValue, 8> Ops;
22711 SDNode* ChainVal = St->getChain().getNode();
22712 // Must be a store of a load. We currently handle two cases: the load
22713 // is a direct child, and it's under an intervening TokenFactor. It is
22714 // possible to dig deeper under nested TokenFactors.
22715 if (ChainVal == LdVal)
22716 Ld = cast<LoadSDNode>(St->getChain());
22717 else if (St->getValue().hasOneUse() &&
22718 ChainVal->getOpcode() == ISD::TokenFactor) {
22719 for (unsigned i = 0, e = ChainVal->getNumOperands(); i != e; ++i) {
22720 if (ChainVal->getOperand(i).getNode() == LdVal) {
22721 TokenFactorIndex = i;
22722 Ld = cast<LoadSDNode>(St->getValue());
22724 Ops.push_back(ChainVal->getOperand(i));
22728 if (!Ld || !ISD::isNormalLoad(Ld))
22731 // If this is not the MMX case, i.e. we are just turning i64 load/store
22732 // into f64 load/store, avoid the transformation if there are multiple
22733 // uses of the loaded value.
22734 if (!VT.isVector() && !Ld->hasNUsesOfValue(1, 0))
22739 // If we are a 64-bit capable x86, lower to a single movq load/store pair.
22740 // Otherwise, if it's legal to use f64 SSE instructions, use f64 load/store
22742 if (Subtarget->is64Bit() || F64IsLegal) {
22743 EVT LdVT = Subtarget->is64Bit() ? MVT::i64 : MVT::f64;
22744 SDValue NewLd = DAG.getLoad(LdVT, LdDL, Ld->getChain(), Ld->getBasePtr(),
22745 Ld->getPointerInfo(), Ld->isVolatile(),
22746 Ld->isNonTemporal(), Ld->isInvariant(),
22747 Ld->getAlignment());
22748 SDValue NewChain = NewLd.getValue(1);
22749 if (TokenFactorIndex != -1) {
22750 Ops.push_back(NewChain);
22751 NewChain = DAG.getNode(ISD::TokenFactor, LdDL, MVT::Other, Ops);
22753 return DAG.getStore(NewChain, StDL, NewLd, St->getBasePtr(),
22754 St->getPointerInfo(),
22755 St->isVolatile(), St->isNonTemporal(),
22756 St->getAlignment());
22759 // Otherwise, lower to two pairs of 32-bit loads / stores.
22760 SDValue LoAddr = Ld->getBasePtr();
22761 SDValue HiAddr = DAG.getNode(ISD::ADD, LdDL, MVT::i32, LoAddr,
22762 DAG.getConstant(4, MVT::i32));
22764 SDValue LoLd = DAG.getLoad(MVT::i32, LdDL, Ld->getChain(), LoAddr,
22765 Ld->getPointerInfo(),
22766 Ld->isVolatile(), Ld->isNonTemporal(),
22767 Ld->isInvariant(), Ld->getAlignment());
22768 SDValue HiLd = DAG.getLoad(MVT::i32, LdDL, Ld->getChain(), HiAddr,
22769 Ld->getPointerInfo().getWithOffset(4),
22770 Ld->isVolatile(), Ld->isNonTemporal(),
22772 MinAlign(Ld->getAlignment(), 4));
22774 SDValue NewChain = LoLd.getValue(1);
22775 if (TokenFactorIndex != -1) {
22776 Ops.push_back(LoLd);
22777 Ops.push_back(HiLd);
22778 NewChain = DAG.getNode(ISD::TokenFactor, LdDL, MVT::Other, Ops);
22781 LoAddr = St->getBasePtr();
22782 HiAddr = DAG.getNode(ISD::ADD, StDL, MVT::i32, LoAddr,
22783 DAG.getConstant(4, MVT::i32));
22785 SDValue LoSt = DAG.getStore(NewChain, StDL, LoLd, LoAddr,
22786 St->getPointerInfo(),
22787 St->isVolatile(), St->isNonTemporal(),
22788 St->getAlignment());
22789 SDValue HiSt = DAG.getStore(NewChain, StDL, HiLd, HiAddr,
22790 St->getPointerInfo().getWithOffset(4),
22792 St->isNonTemporal(),
22793 MinAlign(St->getAlignment(), 4));
22794 return DAG.getNode(ISD::TokenFactor, StDL, MVT::Other, LoSt, HiSt);
22799 /// isHorizontalBinOp - Return 'true' if this vector operation is "horizontal"
22800 /// and return the operands for the horizontal operation in LHS and RHS. A
22801 /// horizontal operation performs the binary operation on successive elements
22802 /// of its first operand, then on successive elements of its second operand,
22803 /// returning the resulting values in a vector. For example, if
22804 /// A = < float a0, float a1, float a2, float a3 >
22806 /// B = < float b0, float b1, float b2, float b3 >
22807 /// then the result of doing a horizontal operation on A and B is
22808 /// A horizontal-op B = < a0 op a1, a2 op a3, b0 op b1, b2 op b3 >.
22809 /// In short, LHS and RHS are inspected to see if LHS op RHS is of the form
22810 /// A horizontal-op B, for some already available A and B, and if so then LHS is
22811 /// set to A, RHS to B, and the routine returns 'true'.
22812 /// Note that the binary operation should have the property that if one of the
22813 /// operands is UNDEF then the result is UNDEF.
22814 static bool isHorizontalBinOp(SDValue &LHS, SDValue &RHS, bool IsCommutative) {
22815 // Look for the following pattern: if
22816 // A = < float a0, float a1, float a2, float a3 >
22817 // B = < float b0, float b1, float b2, float b3 >
22819 // LHS = VECTOR_SHUFFLE A, B, <0, 2, 4, 6>
22820 // RHS = VECTOR_SHUFFLE A, B, <1, 3, 5, 7>
22821 // then LHS op RHS = < a0 op a1, a2 op a3, b0 op b1, b2 op b3 >
22822 // which is A horizontal-op B.
22824 // At least one of the operands should be a vector shuffle.
22825 if (LHS.getOpcode() != ISD::VECTOR_SHUFFLE &&
22826 RHS.getOpcode() != ISD::VECTOR_SHUFFLE)
22829 MVT VT = LHS.getSimpleValueType();
22831 assert((VT.is128BitVector() || VT.is256BitVector()) &&
22832 "Unsupported vector type for horizontal add/sub");
22834 // Handle 128 and 256-bit vector lengths. AVX defines horizontal add/sub to
22835 // operate independently on 128-bit lanes.
22836 unsigned NumElts = VT.getVectorNumElements();
22837 unsigned NumLanes = VT.getSizeInBits()/128;
22838 unsigned NumLaneElts = NumElts / NumLanes;
22839 assert((NumLaneElts % 2 == 0) &&
22840 "Vector type should have an even number of elements in each lane");
22841 unsigned HalfLaneElts = NumLaneElts/2;
22843 // View LHS in the form
22844 // LHS = VECTOR_SHUFFLE A, B, LMask
22845 // If LHS is not a shuffle then pretend it is the shuffle
22846 // LHS = VECTOR_SHUFFLE LHS, undef, <0, 1, ..., N-1>
22847 // NOTE: in what follows a default initialized SDValue represents an UNDEF of
22850 SmallVector<int, 16> LMask(NumElts);
22851 if (LHS.getOpcode() == ISD::VECTOR_SHUFFLE) {
22852 if (LHS.getOperand(0).getOpcode() != ISD::UNDEF)
22853 A = LHS.getOperand(0);
22854 if (LHS.getOperand(1).getOpcode() != ISD::UNDEF)
22855 B = LHS.getOperand(1);
22856 ArrayRef<int> Mask = cast<ShuffleVectorSDNode>(LHS.getNode())->getMask();
22857 std::copy(Mask.begin(), Mask.end(), LMask.begin());
22859 if (LHS.getOpcode() != ISD::UNDEF)
22861 for (unsigned i = 0; i != NumElts; ++i)
22865 // Likewise, view RHS in the form
22866 // RHS = VECTOR_SHUFFLE C, D, RMask
22868 SmallVector<int, 16> RMask(NumElts);
22869 if (RHS.getOpcode() == ISD::VECTOR_SHUFFLE) {
22870 if (RHS.getOperand(0).getOpcode() != ISD::UNDEF)
22871 C = RHS.getOperand(0);
22872 if (RHS.getOperand(1).getOpcode() != ISD::UNDEF)
22873 D = RHS.getOperand(1);
22874 ArrayRef<int> Mask = cast<ShuffleVectorSDNode>(RHS.getNode())->getMask();
22875 std::copy(Mask.begin(), Mask.end(), RMask.begin());
22877 if (RHS.getOpcode() != ISD::UNDEF)
22879 for (unsigned i = 0; i != NumElts; ++i)
22883 // Check that the shuffles are both shuffling the same vectors.
22884 if (!(A == C && B == D) && !(A == D && B == C))
22887 // If everything is UNDEF then bail out: it would be better to fold to UNDEF.
22888 if (!A.getNode() && !B.getNode())
22891 // If A and B occur in reverse order in RHS, then "swap" them (which means
22892 // rewriting the mask).
22894 CommuteVectorShuffleMask(RMask, NumElts);
22896 // At this point LHS and RHS are equivalent to
22897 // LHS = VECTOR_SHUFFLE A, B, LMask
22898 // RHS = VECTOR_SHUFFLE A, B, RMask
22899 // Check that the masks correspond to performing a horizontal operation.
22900 for (unsigned l = 0; l != NumElts; l += NumLaneElts) {
22901 for (unsigned i = 0; i != NumLaneElts; ++i) {
22902 int LIdx = LMask[i+l], RIdx = RMask[i+l];
22904 // Ignore any UNDEF components.
22905 if (LIdx < 0 || RIdx < 0 ||
22906 (!A.getNode() && (LIdx < (int)NumElts || RIdx < (int)NumElts)) ||
22907 (!B.getNode() && (LIdx >= (int)NumElts || RIdx >= (int)NumElts)))
22910 // Check that successive elements are being operated on. If not, this is
22911 // not a horizontal operation.
22912 unsigned Src = (i/HalfLaneElts); // each lane is split between srcs
22913 int Index = 2*(i%HalfLaneElts) + NumElts*Src + l;
22914 if (!(LIdx == Index && RIdx == Index + 1) &&
22915 !(IsCommutative && LIdx == Index + 1 && RIdx == Index))
22920 LHS = A.getNode() ? A : B; // If A is 'UNDEF', use B for it.
22921 RHS = B.getNode() ? B : A; // If B is 'UNDEF', use A for it.
22925 /// PerformFADDCombine - Do target-specific dag combines on floating point adds.
22926 static SDValue PerformFADDCombine(SDNode *N, SelectionDAG &DAG,
22927 const X86Subtarget *Subtarget) {
22928 EVT VT = N->getValueType(0);
22929 SDValue LHS = N->getOperand(0);
22930 SDValue RHS = N->getOperand(1);
22932 // Try to synthesize horizontal adds from adds of shuffles.
22933 if (((Subtarget->hasSSE3() && (VT == MVT::v4f32 || VT == MVT::v2f64)) ||
22934 (Subtarget->hasFp256() && (VT == MVT::v8f32 || VT == MVT::v4f64))) &&
22935 isHorizontalBinOp(LHS, RHS, true))
22936 return DAG.getNode(X86ISD::FHADD, SDLoc(N), VT, LHS, RHS);
22940 /// PerformFSUBCombine - Do target-specific dag combines on floating point subs.
22941 static SDValue PerformFSUBCombine(SDNode *N, SelectionDAG &DAG,
22942 const X86Subtarget *Subtarget) {
22943 EVT VT = N->getValueType(0);
22944 SDValue LHS = N->getOperand(0);
22945 SDValue RHS = N->getOperand(1);
22947 // Try to synthesize horizontal subs from subs of shuffles.
22948 if (((Subtarget->hasSSE3() && (VT == MVT::v4f32 || VT == MVT::v2f64)) ||
22949 (Subtarget->hasFp256() && (VT == MVT::v8f32 || VT == MVT::v4f64))) &&
22950 isHorizontalBinOp(LHS, RHS, false))
22951 return DAG.getNode(X86ISD::FHSUB, SDLoc(N), VT, LHS, RHS);
22955 /// PerformFORCombine - Do target-specific dag combines on X86ISD::FOR and
22956 /// X86ISD::FXOR nodes.
22957 static SDValue PerformFORCombine(SDNode *N, SelectionDAG &DAG) {
22958 assert(N->getOpcode() == X86ISD::FOR || N->getOpcode() == X86ISD::FXOR);
22959 // F[X]OR(0.0, x) -> x
22960 // F[X]OR(x, 0.0) -> x
22961 if (ConstantFPSDNode *C = dyn_cast<ConstantFPSDNode>(N->getOperand(0)))
22962 if (C->getValueAPF().isPosZero())
22963 return N->getOperand(1);
22964 if (ConstantFPSDNode *C = dyn_cast<ConstantFPSDNode>(N->getOperand(1)))
22965 if (C->getValueAPF().isPosZero())
22966 return N->getOperand(0);
22970 /// PerformFMinFMaxCombine - Do target-specific dag combines on X86ISD::FMIN and
22971 /// X86ISD::FMAX nodes.
22972 static SDValue PerformFMinFMaxCombine(SDNode *N, SelectionDAG &DAG) {
22973 assert(N->getOpcode() == X86ISD::FMIN || N->getOpcode() == X86ISD::FMAX);
22975 // Only perform optimizations if UnsafeMath is used.
22976 if (!DAG.getTarget().Options.UnsafeFPMath)
22979 // If we run in unsafe-math mode, then convert the FMAX and FMIN nodes
22980 // into FMINC and FMAXC, which are Commutative operations.
22981 unsigned NewOp = 0;
22982 switch (N->getOpcode()) {
22983 default: llvm_unreachable("unknown opcode");
22984 case X86ISD::FMIN: NewOp = X86ISD::FMINC; break;
22985 case X86ISD::FMAX: NewOp = X86ISD::FMAXC; break;
22988 return DAG.getNode(NewOp, SDLoc(N), N->getValueType(0),
22989 N->getOperand(0), N->getOperand(1));
22992 /// PerformFANDCombine - Do target-specific dag combines on X86ISD::FAND nodes.
22993 static SDValue PerformFANDCombine(SDNode *N, SelectionDAG &DAG) {
22994 // FAND(0.0, x) -> 0.0
22995 // FAND(x, 0.0) -> 0.0
22996 if (ConstantFPSDNode *C = dyn_cast<ConstantFPSDNode>(N->getOperand(0)))
22997 if (C->getValueAPF().isPosZero())
22998 return N->getOperand(0);
22999 if (ConstantFPSDNode *C = dyn_cast<ConstantFPSDNode>(N->getOperand(1)))
23000 if (C->getValueAPF().isPosZero())
23001 return N->getOperand(1);
23005 /// PerformFANDNCombine - Do target-specific dag combines on X86ISD::FANDN nodes
23006 static SDValue PerformFANDNCombine(SDNode *N, SelectionDAG &DAG) {
23007 // FANDN(x, 0.0) -> 0.0
23008 // FANDN(0.0, x) -> x
23009 if (ConstantFPSDNode *C = dyn_cast<ConstantFPSDNode>(N->getOperand(0)))
23010 if (C->getValueAPF().isPosZero())
23011 return N->getOperand(1);
23012 if (ConstantFPSDNode *C = dyn_cast<ConstantFPSDNode>(N->getOperand(1)))
23013 if (C->getValueAPF().isPosZero())
23014 return N->getOperand(1);
23018 static SDValue PerformBTCombine(SDNode *N,
23020 TargetLowering::DAGCombinerInfo &DCI) {
23021 // BT ignores high bits in the bit index operand.
23022 SDValue Op1 = N->getOperand(1);
23023 if (Op1.hasOneUse()) {
23024 unsigned BitWidth = Op1.getValueSizeInBits();
23025 APInt DemandedMask = APInt::getLowBitsSet(BitWidth, Log2_32(BitWidth));
23026 APInt KnownZero, KnownOne;
23027 TargetLowering::TargetLoweringOpt TLO(DAG, !DCI.isBeforeLegalize(),
23028 !DCI.isBeforeLegalizeOps());
23029 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
23030 if (TLO.ShrinkDemandedConstant(Op1, DemandedMask) ||
23031 TLI.SimplifyDemandedBits(Op1, DemandedMask, KnownZero, KnownOne, TLO))
23032 DCI.CommitTargetLoweringOpt(TLO);
23037 static SDValue PerformVZEXT_MOVLCombine(SDNode *N, SelectionDAG &DAG) {
23038 SDValue Op = N->getOperand(0);
23039 if (Op.getOpcode() == ISD::BITCAST)
23040 Op = Op.getOperand(0);
23041 EVT VT = N->getValueType(0), OpVT = Op.getValueType();
23042 if (Op.getOpcode() == X86ISD::VZEXT_LOAD &&
23043 VT.getVectorElementType().getSizeInBits() ==
23044 OpVT.getVectorElementType().getSizeInBits()) {
23045 return DAG.getNode(ISD::BITCAST, SDLoc(N), VT, Op);
23050 static SDValue PerformSIGN_EXTEND_INREGCombine(SDNode *N, SelectionDAG &DAG,
23051 const X86Subtarget *Subtarget) {
23052 EVT VT = N->getValueType(0);
23053 if (!VT.isVector())
23056 SDValue N0 = N->getOperand(0);
23057 SDValue N1 = N->getOperand(1);
23058 EVT ExtraVT = cast<VTSDNode>(N1)->getVT();
23061 // The SIGN_EXTEND_INREG to v4i64 is expensive operation on the
23062 // both SSE and AVX2 since there is no sign-extended shift right
23063 // operation on a vector with 64-bit elements.
23064 //(sext_in_reg (v4i64 anyext (v4i32 x )), ExtraVT) ->
23065 // (v4i64 sext (v4i32 sext_in_reg (v4i32 x , ExtraVT)))
23066 if (VT == MVT::v4i64 && (N0.getOpcode() == ISD::ANY_EXTEND ||
23067 N0.getOpcode() == ISD::SIGN_EXTEND)) {
23068 SDValue N00 = N0.getOperand(0);
23070 // EXTLOAD has a better solution on AVX2,
23071 // it may be replaced with X86ISD::VSEXT node.
23072 if (N00.getOpcode() == ISD::LOAD && Subtarget->hasInt256())
23073 if (!ISD::isNormalLoad(N00.getNode()))
23076 if (N00.getValueType() == MVT::v4i32 && ExtraVT.getSizeInBits() < 128) {
23077 SDValue Tmp = DAG.getNode(ISD::SIGN_EXTEND_INREG, dl, MVT::v4i32,
23079 return DAG.getNode(ISD::SIGN_EXTEND, dl, MVT::v4i64, Tmp);
23085 static SDValue PerformSExtCombine(SDNode *N, SelectionDAG &DAG,
23086 TargetLowering::DAGCombinerInfo &DCI,
23087 const X86Subtarget *Subtarget) {
23088 if (!DCI.isBeforeLegalizeOps())
23091 if (!Subtarget->hasFp256())
23094 EVT VT = N->getValueType(0);
23095 if (VT.isVector() && VT.getSizeInBits() == 256) {
23096 SDValue R = WidenMaskArithmetic(N, DAG, DCI, Subtarget);
23104 static SDValue PerformFMACombine(SDNode *N, SelectionDAG &DAG,
23105 const X86Subtarget* Subtarget) {
23107 EVT VT = N->getValueType(0);
23109 // Let legalize expand this if it isn't a legal type yet.
23110 if (!DAG.getTargetLoweringInfo().isTypeLegal(VT))
23113 EVT ScalarVT = VT.getScalarType();
23114 if ((ScalarVT != MVT::f32 && ScalarVT != MVT::f64) ||
23115 (!Subtarget->hasFMA() && !Subtarget->hasFMA4()))
23118 SDValue A = N->getOperand(0);
23119 SDValue B = N->getOperand(1);
23120 SDValue C = N->getOperand(2);
23122 bool NegA = (A.getOpcode() == ISD::FNEG);
23123 bool NegB = (B.getOpcode() == ISD::FNEG);
23124 bool NegC = (C.getOpcode() == ISD::FNEG);
23126 // Negative multiplication when NegA xor NegB
23127 bool NegMul = (NegA != NegB);
23129 A = A.getOperand(0);
23131 B = B.getOperand(0);
23133 C = C.getOperand(0);
23137 Opcode = (!NegC) ? X86ISD::FMADD : X86ISD::FMSUB;
23139 Opcode = (!NegC) ? X86ISD::FNMADD : X86ISD::FNMSUB;
23141 return DAG.getNode(Opcode, dl, VT, A, B, C);
23144 static SDValue PerformZExtCombine(SDNode *N, SelectionDAG &DAG,
23145 TargetLowering::DAGCombinerInfo &DCI,
23146 const X86Subtarget *Subtarget) {
23147 // (i32 zext (and (i8 x86isd::setcc_carry), 1)) ->
23148 // (and (i32 x86isd::setcc_carry), 1)
23149 // This eliminates the zext. This transformation is necessary because
23150 // ISD::SETCC is always legalized to i8.
23152 SDValue N0 = N->getOperand(0);
23153 EVT VT = N->getValueType(0);
23155 if (N0.getOpcode() == ISD::AND &&
23157 N0.getOperand(0).hasOneUse()) {
23158 SDValue N00 = N0.getOperand(0);
23159 if (N00.getOpcode() == X86ISD::SETCC_CARRY) {
23160 ConstantSDNode *C = dyn_cast<ConstantSDNode>(N0.getOperand(1));
23161 if (!C || C->getZExtValue() != 1)
23163 return DAG.getNode(ISD::AND, dl, VT,
23164 DAG.getNode(X86ISD::SETCC_CARRY, dl, VT,
23165 N00.getOperand(0), N00.getOperand(1)),
23166 DAG.getConstant(1, VT));
23170 if (N0.getOpcode() == ISD::TRUNCATE &&
23172 N0.getOperand(0).hasOneUse()) {
23173 SDValue N00 = N0.getOperand(0);
23174 if (N00.getOpcode() == X86ISD::SETCC_CARRY) {
23175 return DAG.getNode(ISD::AND, dl, VT,
23176 DAG.getNode(X86ISD::SETCC_CARRY, dl, VT,
23177 N00.getOperand(0), N00.getOperand(1)),
23178 DAG.getConstant(1, VT));
23181 if (VT.is256BitVector()) {
23182 SDValue R = WidenMaskArithmetic(N, DAG, DCI, Subtarget);
23190 // Optimize x == -y --> x+y == 0
23191 // x != -y --> x+y != 0
23192 static SDValue PerformISDSETCCCombine(SDNode *N, SelectionDAG &DAG,
23193 const X86Subtarget* Subtarget) {
23194 ISD::CondCode CC = cast<CondCodeSDNode>(N->getOperand(2))->get();
23195 SDValue LHS = N->getOperand(0);
23196 SDValue RHS = N->getOperand(1);
23197 EVT VT = N->getValueType(0);
23200 if ((CC == ISD::SETNE || CC == ISD::SETEQ) && LHS.getOpcode() == ISD::SUB)
23201 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(LHS.getOperand(0)))
23202 if (C->getAPIntValue() == 0 && LHS.hasOneUse()) {
23203 SDValue addV = DAG.getNode(ISD::ADD, SDLoc(N),
23204 LHS.getValueType(), RHS, LHS.getOperand(1));
23205 return DAG.getSetCC(SDLoc(N), N->getValueType(0),
23206 addV, DAG.getConstant(0, addV.getValueType()), CC);
23208 if ((CC == ISD::SETNE || CC == ISD::SETEQ) && RHS.getOpcode() == ISD::SUB)
23209 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(RHS.getOperand(0)))
23210 if (C->getAPIntValue() == 0 && RHS.hasOneUse()) {
23211 SDValue addV = DAG.getNode(ISD::ADD, SDLoc(N),
23212 RHS.getValueType(), LHS, RHS.getOperand(1));
23213 return DAG.getSetCC(SDLoc(N), N->getValueType(0),
23214 addV, DAG.getConstant(0, addV.getValueType()), CC);
23217 if (VT.getScalarType() == MVT::i1) {
23218 bool IsSEXT0 = (LHS.getOpcode() == ISD::SIGN_EXTEND) &&
23219 (LHS.getOperand(0).getValueType().getScalarType() == MVT::i1);
23220 bool IsVZero0 = ISD::isBuildVectorAllZeros(LHS.getNode());
23221 if (!IsSEXT0 && !IsVZero0)
23223 bool IsSEXT1 = (RHS.getOpcode() == ISD::SIGN_EXTEND) &&
23224 (RHS.getOperand(0).getValueType().getScalarType() == MVT::i1);
23225 bool IsVZero1 = ISD::isBuildVectorAllZeros(RHS.getNode());
23227 if (!IsSEXT1 && !IsVZero1)
23230 if (IsSEXT0 && IsVZero1) {
23231 assert(VT == LHS.getOperand(0).getValueType() && "Uexpected operand type");
23232 if (CC == ISD::SETEQ)
23233 return DAG.getNOT(DL, LHS.getOperand(0), VT);
23234 return LHS.getOperand(0);
23236 if (IsSEXT1 && IsVZero0) {
23237 assert(VT == RHS.getOperand(0).getValueType() && "Uexpected operand type");
23238 if (CC == ISD::SETEQ)
23239 return DAG.getNOT(DL, RHS.getOperand(0), VT);
23240 return RHS.getOperand(0);
23247 static SDValue PerformINSERTPSCombine(SDNode *N, SelectionDAG &DAG,
23248 const X86Subtarget *Subtarget) {
23250 MVT VT = N->getOperand(1)->getSimpleValueType(0);
23251 assert((VT == MVT::v4f32 || VT == MVT::v4i32) &&
23252 "X86insertps is only defined for v4x32");
23254 SDValue Ld = N->getOperand(1);
23255 if (MayFoldLoad(Ld)) {
23256 // Extract the countS bits from the immediate so we can get the proper
23257 // address when narrowing the vector load to a specific element.
23258 // When the second source op is a memory address, interps doesn't use
23259 // countS and just gets an f32 from that address.
23260 unsigned DestIndex =
23261 cast<ConstantSDNode>(N->getOperand(2))->getZExtValue() >> 6;
23262 Ld = NarrowVectorLoadToElement(cast<LoadSDNode>(Ld), DestIndex, DAG);
23266 // Create this as a scalar to vector to match the instruction pattern.
23267 SDValue LoadScalarToVector = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VT, Ld);
23268 // countS bits are ignored when loading from memory on insertps, which
23269 // means we don't need to explicitly set them to 0.
23270 return DAG.getNode(X86ISD::INSERTPS, dl, VT, N->getOperand(0),
23271 LoadScalarToVector, N->getOperand(2));
23274 // Helper function of PerformSETCCCombine. It is to materialize "setb reg"
23275 // as "sbb reg,reg", since it can be extended without zext and produces
23276 // an all-ones bit which is more useful than 0/1 in some cases.
23277 static SDValue MaterializeSETB(SDLoc DL, SDValue EFLAGS, SelectionDAG &DAG,
23280 return DAG.getNode(ISD::AND, DL, VT,
23281 DAG.getNode(X86ISD::SETCC_CARRY, DL, MVT::i8,
23282 DAG.getConstant(X86::COND_B, MVT::i8), EFLAGS),
23283 DAG.getConstant(1, VT));
23284 assert (VT == MVT::i1 && "Unexpected type for SECCC node");
23285 return DAG.getNode(ISD::TRUNCATE, DL, MVT::i1,
23286 DAG.getNode(X86ISD::SETCC_CARRY, DL, MVT::i8,
23287 DAG.getConstant(X86::COND_B, MVT::i8), EFLAGS));
23290 // Optimize RES = X86ISD::SETCC CONDCODE, EFLAG_INPUT
23291 static SDValue PerformSETCCCombine(SDNode *N, SelectionDAG &DAG,
23292 TargetLowering::DAGCombinerInfo &DCI,
23293 const X86Subtarget *Subtarget) {
23295 X86::CondCode CC = X86::CondCode(N->getConstantOperandVal(0));
23296 SDValue EFLAGS = N->getOperand(1);
23298 if (CC == X86::COND_A) {
23299 // Try to convert COND_A into COND_B in an attempt to facilitate
23300 // materializing "setb reg".
23302 // Do not flip "e > c", where "c" is a constant, because Cmp instruction
23303 // cannot take an immediate as its first operand.
23305 if (EFLAGS.getOpcode() == X86ISD::SUB && EFLAGS.hasOneUse() &&
23306 EFLAGS.getValueType().isInteger() &&
23307 !isa<ConstantSDNode>(EFLAGS.getOperand(1))) {
23308 SDValue NewSub = DAG.getNode(X86ISD::SUB, SDLoc(EFLAGS),
23309 EFLAGS.getNode()->getVTList(),
23310 EFLAGS.getOperand(1), EFLAGS.getOperand(0));
23311 SDValue NewEFLAGS = SDValue(NewSub.getNode(), EFLAGS.getResNo());
23312 return MaterializeSETB(DL, NewEFLAGS, DAG, N->getSimpleValueType(0));
23316 // Materialize "setb reg" as "sbb reg,reg", since it can be extended without
23317 // a zext and produces an all-ones bit which is more useful than 0/1 in some
23319 if (CC == X86::COND_B)
23320 return MaterializeSETB(DL, EFLAGS, DAG, N->getSimpleValueType(0));
23324 Flags = checkBoolTestSetCCCombine(EFLAGS, CC);
23325 if (Flags.getNode()) {
23326 SDValue Cond = DAG.getConstant(CC, MVT::i8);
23327 return DAG.getNode(X86ISD::SETCC, DL, N->getVTList(), Cond, Flags);
23333 // Optimize branch condition evaluation.
23335 static SDValue PerformBrCondCombine(SDNode *N, SelectionDAG &DAG,
23336 TargetLowering::DAGCombinerInfo &DCI,
23337 const X86Subtarget *Subtarget) {
23339 SDValue Chain = N->getOperand(0);
23340 SDValue Dest = N->getOperand(1);
23341 SDValue EFLAGS = N->getOperand(3);
23342 X86::CondCode CC = X86::CondCode(N->getConstantOperandVal(2));
23346 Flags = checkBoolTestSetCCCombine(EFLAGS, CC);
23347 if (Flags.getNode()) {
23348 SDValue Cond = DAG.getConstant(CC, MVT::i8);
23349 return DAG.getNode(X86ISD::BRCOND, DL, N->getVTList(), Chain, Dest, Cond,
23356 static SDValue performVectorCompareAndMaskUnaryOpCombine(SDNode *N,
23357 SelectionDAG &DAG) {
23358 // Take advantage of vector comparisons producing 0 or -1 in each lane to
23359 // optimize away operation when it's from a constant.
23361 // The general transformation is:
23362 // UNARYOP(AND(VECTOR_CMP(x,y), constant)) -->
23363 // AND(VECTOR_CMP(x,y), constant2)
23364 // constant2 = UNARYOP(constant)
23366 // Early exit if this isn't a vector operation, the operand of the
23367 // unary operation isn't a bitwise AND, or if the sizes of the operations
23368 // aren't the same.
23369 EVT VT = N->getValueType(0);
23370 if (!VT.isVector() || N->getOperand(0)->getOpcode() != ISD::AND ||
23371 N->getOperand(0)->getOperand(0)->getOpcode() != ISD::SETCC ||
23372 VT.getSizeInBits() != N->getOperand(0)->getValueType(0).getSizeInBits())
23375 // Now check that the other operand of the AND is a constant. We could
23376 // make the transformation for non-constant splats as well, but it's unclear
23377 // that would be a benefit as it would not eliminate any operations, just
23378 // perform one more step in scalar code before moving to the vector unit.
23379 if (BuildVectorSDNode *BV =
23380 dyn_cast<BuildVectorSDNode>(N->getOperand(0)->getOperand(1))) {
23381 // Bail out if the vector isn't a constant.
23382 if (!BV->isConstant())
23385 // Everything checks out. Build up the new and improved node.
23387 EVT IntVT = BV->getValueType(0);
23388 // Create a new constant of the appropriate type for the transformed
23390 SDValue SourceConst = DAG.getNode(N->getOpcode(), DL, VT, SDValue(BV, 0));
23391 // The AND node needs bitcasts to/from an integer vector type around it.
23392 SDValue MaskConst = DAG.getNode(ISD::BITCAST, DL, IntVT, SourceConst);
23393 SDValue NewAnd = DAG.getNode(ISD::AND, DL, IntVT,
23394 N->getOperand(0)->getOperand(0), MaskConst);
23395 SDValue Res = DAG.getNode(ISD::BITCAST, DL, VT, NewAnd);
23402 static SDValue PerformSINT_TO_FPCombine(SDNode *N, SelectionDAG &DAG,
23403 const X86TargetLowering *XTLI) {
23404 // First try to optimize away the conversion entirely when it's
23405 // conditionally from a constant. Vectors only.
23406 SDValue Res = performVectorCompareAndMaskUnaryOpCombine(N, DAG);
23407 if (Res != SDValue())
23410 // Now move on to more general possibilities.
23411 SDValue Op0 = N->getOperand(0);
23412 EVT InVT = Op0->getValueType(0);
23414 // SINT_TO_FP(v4i8) -> SINT_TO_FP(SEXT(v4i8 to v4i32))
23415 if (InVT == MVT::v8i8 || InVT == MVT::v4i8) {
23417 MVT DstVT = InVT == MVT::v4i8 ? MVT::v4i32 : MVT::v8i32;
23418 SDValue P = DAG.getNode(ISD::SIGN_EXTEND, dl, DstVT, Op0);
23419 return DAG.getNode(ISD::SINT_TO_FP, dl, N->getValueType(0), P);
23422 // Transform (SINT_TO_FP (i64 ...)) into an x87 operation if we have
23423 // a 32-bit target where SSE doesn't support i64->FP operations.
23424 if (Op0.getOpcode() == ISD::LOAD) {
23425 LoadSDNode *Ld = cast<LoadSDNode>(Op0.getNode());
23426 EVT VT = Ld->getValueType(0);
23427 if (!Ld->isVolatile() && !N->getValueType(0).isVector() &&
23428 ISD::isNON_EXTLoad(Op0.getNode()) && Op0.hasOneUse() &&
23429 !XTLI->getSubtarget()->is64Bit() &&
23431 SDValue FILDChain = XTLI->BuildFILD(SDValue(N, 0), Ld->getValueType(0),
23432 Ld->getChain(), Op0, DAG);
23433 DAG.ReplaceAllUsesOfValueWith(Op0.getValue(1), FILDChain.getValue(1));
23440 // Optimize RES, EFLAGS = X86ISD::ADC LHS, RHS, EFLAGS
23441 static SDValue PerformADCCombine(SDNode *N, SelectionDAG &DAG,
23442 X86TargetLowering::DAGCombinerInfo &DCI) {
23443 // If the LHS and RHS of the ADC node are zero, then it can't overflow and
23444 // the result is either zero or one (depending on the input carry bit).
23445 // Strength reduce this down to a "set on carry" aka SETCC_CARRY&1.
23446 if (X86::isZeroNode(N->getOperand(0)) &&
23447 X86::isZeroNode(N->getOperand(1)) &&
23448 // We don't have a good way to replace an EFLAGS use, so only do this when
23450 SDValue(N, 1).use_empty()) {
23452 EVT VT = N->getValueType(0);
23453 SDValue CarryOut = DAG.getConstant(0, N->getValueType(1));
23454 SDValue Res1 = DAG.getNode(ISD::AND, DL, VT,
23455 DAG.getNode(X86ISD::SETCC_CARRY, DL, VT,
23456 DAG.getConstant(X86::COND_B,MVT::i8),
23458 DAG.getConstant(1, VT));
23459 return DCI.CombineTo(N, Res1, CarryOut);
23465 // fold (add Y, (sete X, 0)) -> adc 0, Y
23466 // (add Y, (setne X, 0)) -> sbb -1, Y
23467 // (sub (sete X, 0), Y) -> sbb 0, Y
23468 // (sub (setne X, 0), Y) -> adc -1, Y
23469 static SDValue OptimizeConditionalInDecrement(SDNode *N, SelectionDAG &DAG) {
23472 // Look through ZExts.
23473 SDValue Ext = N->getOperand(N->getOpcode() == ISD::SUB ? 1 : 0);
23474 if (Ext.getOpcode() != ISD::ZERO_EXTEND || !Ext.hasOneUse())
23477 SDValue SetCC = Ext.getOperand(0);
23478 if (SetCC.getOpcode() != X86ISD::SETCC || !SetCC.hasOneUse())
23481 X86::CondCode CC = (X86::CondCode)SetCC.getConstantOperandVal(0);
23482 if (CC != X86::COND_E && CC != X86::COND_NE)
23485 SDValue Cmp = SetCC.getOperand(1);
23486 if (Cmp.getOpcode() != X86ISD::CMP || !Cmp.hasOneUse() ||
23487 !X86::isZeroNode(Cmp.getOperand(1)) ||
23488 !Cmp.getOperand(0).getValueType().isInteger())
23491 SDValue CmpOp0 = Cmp.getOperand(0);
23492 SDValue NewCmp = DAG.getNode(X86ISD::CMP, DL, MVT::i32, CmpOp0,
23493 DAG.getConstant(1, CmpOp0.getValueType()));
23495 SDValue OtherVal = N->getOperand(N->getOpcode() == ISD::SUB ? 0 : 1);
23496 if (CC == X86::COND_NE)
23497 return DAG.getNode(N->getOpcode() == ISD::SUB ? X86ISD::ADC : X86ISD::SBB,
23498 DL, OtherVal.getValueType(), OtherVal,
23499 DAG.getConstant(-1ULL, OtherVal.getValueType()), NewCmp);
23500 return DAG.getNode(N->getOpcode() == ISD::SUB ? X86ISD::SBB : X86ISD::ADC,
23501 DL, OtherVal.getValueType(), OtherVal,
23502 DAG.getConstant(0, OtherVal.getValueType()), NewCmp);
23505 /// PerformADDCombine - Do target-specific dag combines on integer adds.
23506 static SDValue PerformAddCombine(SDNode *N, SelectionDAG &DAG,
23507 const X86Subtarget *Subtarget) {
23508 EVT VT = N->getValueType(0);
23509 SDValue Op0 = N->getOperand(0);
23510 SDValue Op1 = N->getOperand(1);
23512 // Try to synthesize horizontal adds from adds of shuffles.
23513 if (((Subtarget->hasSSSE3() && (VT == MVT::v8i16 || VT == MVT::v4i32)) ||
23514 (Subtarget->hasInt256() && (VT == MVT::v16i16 || VT == MVT::v8i32))) &&
23515 isHorizontalBinOp(Op0, Op1, true))
23516 return DAG.getNode(X86ISD::HADD, SDLoc(N), VT, Op0, Op1);
23518 return OptimizeConditionalInDecrement(N, DAG);
23521 static SDValue PerformSubCombine(SDNode *N, SelectionDAG &DAG,
23522 const X86Subtarget *Subtarget) {
23523 SDValue Op0 = N->getOperand(0);
23524 SDValue Op1 = N->getOperand(1);
23526 // X86 can't encode an immediate LHS of a sub. See if we can push the
23527 // negation into a preceding instruction.
23528 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op0)) {
23529 // If the RHS of the sub is a XOR with one use and a constant, invert the
23530 // immediate. Then add one to the LHS of the sub so we can turn
23531 // X-Y -> X+~Y+1, saving one register.
23532 if (Op1->hasOneUse() && Op1.getOpcode() == ISD::XOR &&
23533 isa<ConstantSDNode>(Op1.getOperand(1))) {
23534 APInt XorC = cast<ConstantSDNode>(Op1.getOperand(1))->getAPIntValue();
23535 EVT VT = Op0.getValueType();
23536 SDValue NewXor = DAG.getNode(ISD::XOR, SDLoc(Op1), VT,
23538 DAG.getConstant(~XorC, VT));
23539 return DAG.getNode(ISD::ADD, SDLoc(N), VT, NewXor,
23540 DAG.getConstant(C->getAPIntValue()+1, VT));
23544 // Try to synthesize horizontal adds from adds of shuffles.
23545 EVT VT = N->getValueType(0);
23546 if (((Subtarget->hasSSSE3() && (VT == MVT::v8i16 || VT == MVT::v4i32)) ||
23547 (Subtarget->hasInt256() && (VT == MVT::v16i16 || VT == MVT::v8i32))) &&
23548 isHorizontalBinOp(Op0, Op1, true))
23549 return DAG.getNode(X86ISD::HSUB, SDLoc(N), VT, Op0, Op1);
23551 return OptimizeConditionalInDecrement(N, DAG);
23554 /// performVZEXTCombine - Performs build vector combines
23555 static SDValue performVZEXTCombine(SDNode *N, SelectionDAG &DAG,
23556 TargetLowering::DAGCombinerInfo &DCI,
23557 const X86Subtarget *Subtarget) {
23558 // (vzext (bitcast (vzext (x)) -> (vzext x)
23559 SDValue In = N->getOperand(0);
23560 while (In.getOpcode() == ISD::BITCAST)
23561 In = In.getOperand(0);
23563 if (In.getOpcode() != X86ISD::VZEXT)
23566 return DAG.getNode(X86ISD::VZEXT, SDLoc(N), N->getValueType(0),
23570 SDValue X86TargetLowering::PerformDAGCombine(SDNode *N,
23571 DAGCombinerInfo &DCI) const {
23572 SelectionDAG &DAG = DCI.DAG;
23573 switch (N->getOpcode()) {
23575 case ISD::EXTRACT_VECTOR_ELT:
23576 return PerformEXTRACT_VECTOR_ELTCombine(N, DAG, DCI);
23578 case ISD::SELECT: return PerformSELECTCombine(N, DAG, DCI, Subtarget);
23579 case X86ISD::CMOV: return PerformCMOVCombine(N, DAG, DCI, Subtarget);
23580 case ISD::ADD: return PerformAddCombine(N, DAG, Subtarget);
23581 case ISD::SUB: return PerformSubCombine(N, DAG, Subtarget);
23582 case X86ISD::ADC: return PerformADCCombine(N, DAG, DCI);
23583 case ISD::MUL: return PerformMulCombine(N, DAG, DCI);
23586 case ISD::SRL: return PerformShiftCombine(N, DAG, DCI, Subtarget);
23587 case ISD::AND: return PerformAndCombine(N, DAG, DCI, Subtarget);
23588 case ISD::OR: return PerformOrCombine(N, DAG, DCI, Subtarget);
23589 case ISD::XOR: return PerformXorCombine(N, DAG, DCI, Subtarget);
23590 case ISD::LOAD: return PerformLOADCombine(N, DAG, DCI, Subtarget);
23591 case ISD::STORE: return PerformSTORECombine(N, DAG, Subtarget);
23592 case ISD::SINT_TO_FP: return PerformSINT_TO_FPCombine(N, DAG, this);
23593 case ISD::FADD: return PerformFADDCombine(N, DAG, Subtarget);
23594 case ISD::FSUB: return PerformFSUBCombine(N, DAG, Subtarget);
23596 case X86ISD::FOR: return PerformFORCombine(N, DAG);
23598 case X86ISD::FMAX: return PerformFMinFMaxCombine(N, DAG);
23599 case X86ISD::FAND: return PerformFANDCombine(N, DAG);
23600 case X86ISD::FANDN: return PerformFANDNCombine(N, DAG);
23601 case X86ISD::BT: return PerformBTCombine(N, DAG, DCI);
23602 case X86ISD::VZEXT_MOVL: return PerformVZEXT_MOVLCombine(N, DAG);
23603 case ISD::ANY_EXTEND:
23604 case ISD::ZERO_EXTEND: return PerformZExtCombine(N, DAG, DCI, Subtarget);
23605 case ISD::SIGN_EXTEND: return PerformSExtCombine(N, DAG, DCI, Subtarget);
23606 case ISD::SIGN_EXTEND_INREG:
23607 return PerformSIGN_EXTEND_INREGCombine(N, DAG, Subtarget);
23608 case ISD::TRUNCATE: return PerformTruncateCombine(N, DAG,DCI,Subtarget);
23609 case ISD::SETCC: return PerformISDSETCCCombine(N, DAG, Subtarget);
23610 case X86ISD::SETCC: return PerformSETCCCombine(N, DAG, DCI, Subtarget);
23611 case X86ISD::BRCOND: return PerformBrCondCombine(N, DAG, DCI, Subtarget);
23612 case X86ISD::VZEXT: return performVZEXTCombine(N, DAG, DCI, Subtarget);
23613 case X86ISD::SHUFP: // Handle all target specific shuffles
23614 case X86ISD::PALIGNR:
23615 case X86ISD::UNPCKH:
23616 case X86ISD::UNPCKL:
23617 case X86ISD::MOVHLPS:
23618 case X86ISD::MOVLHPS:
23619 case X86ISD::PSHUFB:
23620 case X86ISD::PSHUFD:
23621 case X86ISD::PSHUFHW:
23622 case X86ISD::PSHUFLW:
23623 case X86ISD::MOVSS:
23624 case X86ISD::MOVSD:
23625 case X86ISD::VPERMILP:
23626 case X86ISD::VPERM2X128:
23627 case ISD::VECTOR_SHUFFLE: return PerformShuffleCombine(N, DAG, DCI,Subtarget);
23628 case ISD::FMA: return PerformFMACombine(N, DAG, Subtarget);
23629 case ISD::INTRINSIC_WO_CHAIN:
23630 return PerformINTRINSIC_WO_CHAINCombine(N, DAG, Subtarget);
23631 case X86ISD::INSERTPS:
23632 return PerformINSERTPSCombine(N, DAG, Subtarget);
23633 case ISD::BUILD_VECTOR: return PerformBUILD_VECTORCombine(N, DAG, Subtarget);
23639 /// isTypeDesirableForOp - Return true if the target has native support for
23640 /// the specified value type and it is 'desirable' to use the type for the
23641 /// given node type. e.g. On x86 i16 is legal, but undesirable since i16
23642 /// instruction encodings are longer and some i16 instructions are slow.
23643 bool X86TargetLowering::isTypeDesirableForOp(unsigned Opc, EVT VT) const {
23644 if (!isTypeLegal(VT))
23646 if (VT != MVT::i16)
23653 case ISD::SIGN_EXTEND:
23654 case ISD::ZERO_EXTEND:
23655 case ISD::ANY_EXTEND:
23668 /// IsDesirableToPromoteOp - This method query the target whether it is
23669 /// beneficial for dag combiner to promote the specified node. If true, it
23670 /// should return the desired promotion type by reference.
23671 bool X86TargetLowering::IsDesirableToPromoteOp(SDValue Op, EVT &PVT) const {
23672 EVT VT = Op.getValueType();
23673 if (VT != MVT::i16)
23676 bool Promote = false;
23677 bool Commute = false;
23678 switch (Op.getOpcode()) {
23681 LoadSDNode *LD = cast<LoadSDNode>(Op);
23682 // If the non-extending load has a single use and it's not live out, then it
23683 // might be folded.
23684 if (LD->getExtensionType() == ISD::NON_EXTLOAD /*&&
23685 Op.hasOneUse()*/) {
23686 for (SDNode::use_iterator UI = Op.getNode()->use_begin(),
23687 UE = Op.getNode()->use_end(); UI != UE; ++UI) {
23688 // The only case where we'd want to promote LOAD (rather then it being
23689 // promoted as an operand is when it's only use is liveout.
23690 if (UI->getOpcode() != ISD::CopyToReg)
23697 case ISD::SIGN_EXTEND:
23698 case ISD::ZERO_EXTEND:
23699 case ISD::ANY_EXTEND:
23704 SDValue N0 = Op.getOperand(0);
23705 // Look out for (store (shl (load), x)).
23706 if (MayFoldLoad(N0) && MayFoldIntoStore(Op))
23719 SDValue N0 = Op.getOperand(0);
23720 SDValue N1 = Op.getOperand(1);
23721 if (!Commute && MayFoldLoad(N1))
23723 // Avoid disabling potential load folding opportunities.
23724 if (MayFoldLoad(N0) && (!isa<ConstantSDNode>(N1) || MayFoldIntoStore(Op)))
23726 if (MayFoldLoad(N1) && (!isa<ConstantSDNode>(N0) || MayFoldIntoStore(Op)))
23736 //===----------------------------------------------------------------------===//
23737 // X86 Inline Assembly Support
23738 //===----------------------------------------------------------------------===//
23741 // Helper to match a string separated by whitespace.
23742 bool matchAsmImpl(StringRef s, ArrayRef<const StringRef *> args) {
23743 s = s.substr(s.find_first_not_of(" \t")); // Skip leading whitespace.
23745 for (unsigned i = 0, e = args.size(); i != e; ++i) {
23746 StringRef piece(*args[i]);
23747 if (!s.startswith(piece)) // Check if the piece matches.
23750 s = s.substr(piece.size());
23751 StringRef::size_type pos = s.find_first_not_of(" \t");
23752 if (pos == 0) // We matched a prefix.
23760 const VariadicFunction1<bool, StringRef, StringRef, matchAsmImpl> matchAsm={};
23763 static bool clobbersFlagRegisters(const SmallVector<StringRef, 4> &AsmPieces) {
23765 if (AsmPieces.size() == 3 || AsmPieces.size() == 4) {
23766 if (std::count(AsmPieces.begin(), AsmPieces.end(), "~{cc}") &&
23767 std::count(AsmPieces.begin(), AsmPieces.end(), "~{flags}") &&
23768 std::count(AsmPieces.begin(), AsmPieces.end(), "~{fpsr}")) {
23770 if (AsmPieces.size() == 3)
23772 else if (std::count(AsmPieces.begin(), AsmPieces.end(), "~{dirflag}"))
23779 bool X86TargetLowering::ExpandInlineAsm(CallInst *CI) const {
23780 InlineAsm *IA = cast<InlineAsm>(CI->getCalledValue());
23782 std::string AsmStr = IA->getAsmString();
23784 IntegerType *Ty = dyn_cast<IntegerType>(CI->getType());
23785 if (!Ty || Ty->getBitWidth() % 16 != 0)
23788 // TODO: should remove alternatives from the asmstring: "foo {a|b}" -> "foo a"
23789 SmallVector<StringRef, 4> AsmPieces;
23790 SplitString(AsmStr, AsmPieces, ";\n");
23792 switch (AsmPieces.size()) {
23793 default: return false;
23795 // FIXME: this should verify that we are targeting a 486 or better. If not,
23796 // we will turn this bswap into something that will be lowered to logical
23797 // ops instead of emitting the bswap asm. For now, we don't support 486 or
23798 // lower so don't worry about this.
23800 if (matchAsm(AsmPieces[0], "bswap", "$0") ||
23801 matchAsm(AsmPieces[0], "bswapl", "$0") ||
23802 matchAsm(AsmPieces[0], "bswapq", "$0") ||
23803 matchAsm(AsmPieces[0], "bswap", "${0:q}") ||
23804 matchAsm(AsmPieces[0], "bswapl", "${0:q}") ||
23805 matchAsm(AsmPieces[0], "bswapq", "${0:q}")) {
23806 // No need to check constraints, nothing other than the equivalent of
23807 // "=r,0" would be valid here.
23808 return IntrinsicLowering::LowerToByteSwap(CI);
23811 // rorw $$8, ${0:w} --> llvm.bswap.i16
23812 if (CI->getType()->isIntegerTy(16) &&
23813 IA->getConstraintString().compare(0, 5, "=r,0,") == 0 &&
23814 (matchAsm(AsmPieces[0], "rorw", "$$8,", "${0:w}") ||
23815 matchAsm(AsmPieces[0], "rolw", "$$8,", "${0:w}"))) {
23817 const std::string &ConstraintsStr = IA->getConstraintString();
23818 SplitString(StringRef(ConstraintsStr).substr(5), AsmPieces, ",");
23819 array_pod_sort(AsmPieces.begin(), AsmPieces.end());
23820 if (clobbersFlagRegisters(AsmPieces))
23821 return IntrinsicLowering::LowerToByteSwap(CI);
23825 if (CI->getType()->isIntegerTy(32) &&
23826 IA->getConstraintString().compare(0, 5, "=r,0,") == 0 &&
23827 matchAsm(AsmPieces[0], "rorw", "$$8,", "${0:w}") &&
23828 matchAsm(AsmPieces[1], "rorl", "$$16,", "$0") &&
23829 matchAsm(AsmPieces[2], "rorw", "$$8,", "${0:w}")) {
23831 const std::string &ConstraintsStr = IA->getConstraintString();
23832 SplitString(StringRef(ConstraintsStr).substr(5), AsmPieces, ",");
23833 array_pod_sort(AsmPieces.begin(), AsmPieces.end());
23834 if (clobbersFlagRegisters(AsmPieces))
23835 return IntrinsicLowering::LowerToByteSwap(CI);
23838 if (CI->getType()->isIntegerTy(64)) {
23839 InlineAsm::ConstraintInfoVector Constraints = IA->ParseConstraints();
23840 if (Constraints.size() >= 2 &&
23841 Constraints[0].Codes.size() == 1 && Constraints[0].Codes[0] == "A" &&
23842 Constraints[1].Codes.size() == 1 && Constraints[1].Codes[0] == "0") {
23843 // bswap %eax / bswap %edx / xchgl %eax, %edx -> llvm.bswap.i64
23844 if (matchAsm(AsmPieces[0], "bswap", "%eax") &&
23845 matchAsm(AsmPieces[1], "bswap", "%edx") &&
23846 matchAsm(AsmPieces[2], "xchgl", "%eax,", "%edx"))
23847 return IntrinsicLowering::LowerToByteSwap(CI);
23855 /// getConstraintType - Given a constraint letter, return the type of
23856 /// constraint it is for this target.
23857 X86TargetLowering::ConstraintType
23858 X86TargetLowering::getConstraintType(const std::string &Constraint) const {
23859 if (Constraint.size() == 1) {
23860 switch (Constraint[0]) {
23871 return C_RegisterClass;
23895 return TargetLowering::getConstraintType(Constraint);
23898 /// Examine constraint type and operand type and determine a weight value.
23899 /// This object must already have been set up with the operand type
23900 /// and the current alternative constraint selected.
23901 TargetLowering::ConstraintWeight
23902 X86TargetLowering::getSingleConstraintMatchWeight(
23903 AsmOperandInfo &info, const char *constraint) const {
23904 ConstraintWeight weight = CW_Invalid;
23905 Value *CallOperandVal = info.CallOperandVal;
23906 // If we don't have a value, we can't do a match,
23907 // but allow it at the lowest weight.
23908 if (!CallOperandVal)
23910 Type *type = CallOperandVal->getType();
23911 // Look at the constraint type.
23912 switch (*constraint) {
23914 weight = TargetLowering::getSingleConstraintMatchWeight(info, constraint);
23925 if (CallOperandVal->getType()->isIntegerTy())
23926 weight = CW_SpecificReg;
23931 if (type->isFloatingPointTy())
23932 weight = CW_SpecificReg;
23935 if (type->isX86_MMXTy() && Subtarget->hasMMX())
23936 weight = CW_SpecificReg;
23940 if (((type->getPrimitiveSizeInBits() == 128) && Subtarget->hasSSE1()) ||
23941 ((type->getPrimitiveSizeInBits() == 256) && Subtarget->hasFp256()))
23942 weight = CW_Register;
23945 if (ConstantInt *C = dyn_cast<ConstantInt>(info.CallOperandVal)) {
23946 if (C->getZExtValue() <= 31)
23947 weight = CW_Constant;
23951 if (ConstantInt *C = dyn_cast<ConstantInt>(CallOperandVal)) {
23952 if (C->getZExtValue() <= 63)
23953 weight = CW_Constant;
23957 if (ConstantInt *C = dyn_cast<ConstantInt>(CallOperandVal)) {
23958 if ((C->getSExtValue() >= -0x80) && (C->getSExtValue() <= 0x7f))
23959 weight = CW_Constant;
23963 if (ConstantInt *C = dyn_cast<ConstantInt>(CallOperandVal)) {
23964 if ((C->getZExtValue() == 0xff) || (C->getZExtValue() == 0xffff))
23965 weight = CW_Constant;
23969 if (ConstantInt *C = dyn_cast<ConstantInt>(CallOperandVal)) {
23970 if (C->getZExtValue() <= 3)
23971 weight = CW_Constant;
23975 if (ConstantInt *C = dyn_cast<ConstantInt>(CallOperandVal)) {
23976 if (C->getZExtValue() <= 0xff)
23977 weight = CW_Constant;
23982 if (dyn_cast<ConstantFP>(CallOperandVal)) {
23983 weight = CW_Constant;
23987 if (ConstantInt *C = dyn_cast<ConstantInt>(CallOperandVal)) {
23988 if ((C->getSExtValue() >= -0x80000000LL) &&
23989 (C->getSExtValue() <= 0x7fffffffLL))
23990 weight = CW_Constant;
23994 if (ConstantInt *C = dyn_cast<ConstantInt>(CallOperandVal)) {
23995 if (C->getZExtValue() <= 0xffffffff)
23996 weight = CW_Constant;
24003 /// LowerXConstraint - try to replace an X constraint, which matches anything,
24004 /// with another that has more specific requirements based on the type of the
24005 /// corresponding operand.
24006 const char *X86TargetLowering::
24007 LowerXConstraint(EVT ConstraintVT) const {
24008 // FP X constraints get lowered to SSE1/2 registers if available, otherwise
24009 // 'f' like normal targets.
24010 if (ConstraintVT.isFloatingPoint()) {
24011 if (Subtarget->hasSSE2())
24013 if (Subtarget->hasSSE1())
24017 return TargetLowering::LowerXConstraint(ConstraintVT);
24020 /// LowerAsmOperandForConstraint - Lower the specified operand into the Ops
24021 /// vector. If it is invalid, don't add anything to Ops.
24022 void X86TargetLowering::LowerAsmOperandForConstraint(SDValue Op,
24023 std::string &Constraint,
24024 std::vector<SDValue>&Ops,
24025 SelectionDAG &DAG) const {
24028 // Only support length 1 constraints for now.
24029 if (Constraint.length() > 1) return;
24031 char ConstraintLetter = Constraint[0];
24032 switch (ConstraintLetter) {
24035 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op)) {
24036 if (C->getZExtValue() <= 31) {
24037 Result = DAG.getTargetConstant(C->getZExtValue(), Op.getValueType());
24043 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op)) {
24044 if (C->getZExtValue() <= 63) {
24045 Result = DAG.getTargetConstant(C->getZExtValue(), Op.getValueType());
24051 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op)) {
24052 if (isInt<8>(C->getSExtValue())) {
24053 Result = DAG.getTargetConstant(C->getZExtValue(), Op.getValueType());
24059 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op)) {
24060 if (C->getZExtValue() <= 255) {
24061 Result = DAG.getTargetConstant(C->getZExtValue(), Op.getValueType());
24067 // 32-bit signed value
24068 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op)) {
24069 if (ConstantInt::isValueValidForType(Type::getInt32Ty(*DAG.getContext()),
24070 C->getSExtValue())) {
24071 // Widen to 64 bits here to get it sign extended.
24072 Result = DAG.getTargetConstant(C->getSExtValue(), MVT::i64);
24075 // FIXME gcc accepts some relocatable values here too, but only in certain
24076 // memory models; it's complicated.
24081 // 32-bit unsigned value
24082 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op)) {
24083 if (ConstantInt::isValueValidForType(Type::getInt32Ty(*DAG.getContext()),
24084 C->getZExtValue())) {
24085 Result = DAG.getTargetConstant(C->getZExtValue(), Op.getValueType());
24089 // FIXME gcc accepts some relocatable values here too, but only in certain
24090 // memory models; it's complicated.
24094 // Literal immediates are always ok.
24095 if (ConstantSDNode *CST = dyn_cast<ConstantSDNode>(Op)) {
24096 // Widen to 64 bits here to get it sign extended.
24097 Result = DAG.getTargetConstant(CST->getSExtValue(), MVT::i64);
24101 // In any sort of PIC mode addresses need to be computed at runtime by
24102 // adding in a register or some sort of table lookup. These can't
24103 // be used as immediates.
24104 if (Subtarget->isPICStyleGOT() || Subtarget->isPICStyleStubPIC())
24107 // If we are in non-pic codegen mode, we allow the address of a global (with
24108 // an optional displacement) to be used with 'i'.
24109 GlobalAddressSDNode *GA = nullptr;
24110 int64_t Offset = 0;
24112 // Match either (GA), (GA+C), (GA+C1+C2), etc.
24114 if ((GA = dyn_cast<GlobalAddressSDNode>(Op))) {
24115 Offset += GA->getOffset();
24117 } else if (Op.getOpcode() == ISD::ADD) {
24118 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op.getOperand(1))) {
24119 Offset += C->getZExtValue();
24120 Op = Op.getOperand(0);
24123 } else if (Op.getOpcode() == ISD::SUB) {
24124 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op.getOperand(1))) {
24125 Offset += -C->getZExtValue();
24126 Op = Op.getOperand(0);
24131 // Otherwise, this isn't something we can handle, reject it.
24135 const GlobalValue *GV = GA->getGlobal();
24136 // If we require an extra load to get this address, as in PIC mode, we
24137 // can't accept it.
24138 if (isGlobalStubReference(
24139 Subtarget->ClassifyGlobalReference(GV, DAG.getTarget())))
24142 Result = DAG.getTargetGlobalAddress(GV, SDLoc(Op),
24143 GA->getValueType(0), Offset);
24148 if (Result.getNode()) {
24149 Ops.push_back(Result);
24152 return TargetLowering::LowerAsmOperandForConstraint(Op, Constraint, Ops, DAG);
24155 std::pair<unsigned, const TargetRegisterClass*>
24156 X86TargetLowering::getRegForInlineAsmConstraint(const std::string &Constraint,
24158 // First, see if this is a constraint that directly corresponds to an LLVM
24160 if (Constraint.size() == 1) {
24161 // GCC Constraint Letters
24162 switch (Constraint[0]) {
24164 // TODO: Slight differences here in allocation order and leaving
24165 // RIP in the class. Do they matter any more here than they do
24166 // in the normal allocation?
24167 case 'q': // GENERAL_REGS in 64-bit mode, Q_REGS in 32-bit mode.
24168 if (Subtarget->is64Bit()) {
24169 if (VT == MVT::i32 || VT == MVT::f32)
24170 return std::make_pair(0U, &X86::GR32RegClass);
24171 if (VT == MVT::i16)
24172 return std::make_pair(0U, &X86::GR16RegClass);
24173 if (VT == MVT::i8 || VT == MVT::i1)
24174 return std::make_pair(0U, &X86::GR8RegClass);
24175 if (VT == MVT::i64 || VT == MVT::f64)
24176 return std::make_pair(0U, &X86::GR64RegClass);
24179 // 32-bit fallthrough
24180 case 'Q': // Q_REGS
24181 if (VT == MVT::i32 || VT == MVT::f32)
24182 return std::make_pair(0U, &X86::GR32_ABCDRegClass);
24183 if (VT == MVT::i16)
24184 return std::make_pair(0U, &X86::GR16_ABCDRegClass);
24185 if (VT == MVT::i8 || VT == MVT::i1)
24186 return std::make_pair(0U, &X86::GR8_ABCD_LRegClass);
24187 if (VT == MVT::i64)
24188 return std::make_pair(0U, &X86::GR64_ABCDRegClass);
24190 case 'r': // GENERAL_REGS
24191 case 'l': // INDEX_REGS
24192 if (VT == MVT::i8 || VT == MVT::i1)
24193 return std::make_pair(0U, &X86::GR8RegClass);
24194 if (VT == MVT::i16)
24195 return std::make_pair(0U, &X86::GR16RegClass);
24196 if (VT == MVT::i32 || VT == MVT::f32 || !Subtarget->is64Bit())
24197 return std::make_pair(0U, &X86::GR32RegClass);
24198 return std::make_pair(0U, &X86::GR64RegClass);
24199 case 'R': // LEGACY_REGS
24200 if (VT == MVT::i8 || VT == MVT::i1)
24201 return std::make_pair(0U, &X86::GR8_NOREXRegClass);
24202 if (VT == MVT::i16)
24203 return std::make_pair(0U, &X86::GR16_NOREXRegClass);
24204 if (VT == MVT::i32 || !Subtarget->is64Bit())
24205 return std::make_pair(0U, &X86::GR32_NOREXRegClass);
24206 return std::make_pair(0U, &X86::GR64_NOREXRegClass);
24207 case 'f': // FP Stack registers.
24208 // If SSE is enabled for this VT, use f80 to ensure the isel moves the
24209 // value to the correct fpstack register class.
24210 if (VT == MVT::f32 && !isScalarFPTypeInSSEReg(VT))
24211 return std::make_pair(0U, &X86::RFP32RegClass);
24212 if (VT == MVT::f64 && !isScalarFPTypeInSSEReg(VT))
24213 return std::make_pair(0U, &X86::RFP64RegClass);
24214 return std::make_pair(0U, &X86::RFP80RegClass);
24215 case 'y': // MMX_REGS if MMX allowed.
24216 if (!Subtarget->hasMMX()) break;
24217 return std::make_pair(0U, &X86::VR64RegClass);
24218 case 'Y': // SSE_REGS if SSE2 allowed
24219 if (!Subtarget->hasSSE2()) break;
24221 case 'x': // SSE_REGS if SSE1 allowed or AVX_REGS if AVX allowed
24222 if (!Subtarget->hasSSE1()) break;
24224 switch (VT.SimpleTy) {
24226 // Scalar SSE types.
24229 return std::make_pair(0U, &X86::FR32RegClass);
24232 return std::make_pair(0U, &X86::FR64RegClass);
24240 return std::make_pair(0U, &X86::VR128RegClass);
24248 return std::make_pair(0U, &X86::VR256RegClass);
24253 return std::make_pair(0U, &X86::VR512RegClass);
24259 // Use the default implementation in TargetLowering to convert the register
24260 // constraint into a member of a register class.
24261 std::pair<unsigned, const TargetRegisterClass*> Res;
24262 Res = TargetLowering::getRegForInlineAsmConstraint(Constraint, VT);
24264 // Not found as a standard register?
24266 // Map st(0) -> st(7) -> ST0
24267 if (Constraint.size() == 7 && Constraint[0] == '{' &&
24268 tolower(Constraint[1]) == 's' &&
24269 tolower(Constraint[2]) == 't' &&
24270 Constraint[3] == '(' &&
24271 (Constraint[4] >= '0' && Constraint[4] <= '7') &&
24272 Constraint[5] == ')' &&
24273 Constraint[6] == '}') {
24275 Res.first = X86::FP0+Constraint[4]-'0';
24276 Res.second = &X86::RFP80RegClass;
24280 // GCC allows "st(0)" to be called just plain "st".
24281 if (StringRef("{st}").equals_lower(Constraint)) {
24282 Res.first = X86::FP0;
24283 Res.second = &X86::RFP80RegClass;
24288 if (StringRef("{flags}").equals_lower(Constraint)) {
24289 Res.first = X86::EFLAGS;
24290 Res.second = &X86::CCRRegClass;
24294 // 'A' means EAX + EDX.
24295 if (Constraint == "A") {
24296 Res.first = X86::EAX;
24297 Res.second = &X86::GR32_ADRegClass;
24303 // Otherwise, check to see if this is a register class of the wrong value
24304 // type. For example, we want to map "{ax},i32" -> {eax}, we don't want it to
24305 // turn into {ax},{dx}.
24306 if (Res.second->hasType(VT))
24307 return Res; // Correct type already, nothing to do.
24309 // All of the single-register GCC register classes map their values onto
24310 // 16-bit register pieces "ax","dx","cx","bx","si","di","bp","sp". If we
24311 // really want an 8-bit or 32-bit register, map to the appropriate register
24312 // class and return the appropriate register.
24313 if (Res.second == &X86::GR16RegClass) {
24314 if (VT == MVT::i8 || VT == MVT::i1) {
24315 unsigned DestReg = 0;
24316 switch (Res.first) {
24318 case X86::AX: DestReg = X86::AL; break;
24319 case X86::DX: DestReg = X86::DL; break;
24320 case X86::CX: DestReg = X86::CL; break;
24321 case X86::BX: DestReg = X86::BL; break;
24324 Res.first = DestReg;
24325 Res.second = &X86::GR8RegClass;
24327 } else if (VT == MVT::i32 || VT == MVT::f32) {
24328 unsigned DestReg = 0;
24329 switch (Res.first) {
24331 case X86::AX: DestReg = X86::EAX; break;
24332 case X86::DX: DestReg = X86::EDX; break;
24333 case X86::CX: DestReg = X86::ECX; break;
24334 case X86::BX: DestReg = X86::EBX; break;
24335 case X86::SI: DestReg = X86::ESI; break;
24336 case X86::DI: DestReg = X86::EDI; break;
24337 case X86::BP: DestReg = X86::EBP; break;
24338 case X86::SP: DestReg = X86::ESP; break;
24341 Res.first = DestReg;
24342 Res.second = &X86::GR32RegClass;
24344 } else if (VT == MVT::i64 || VT == MVT::f64) {
24345 unsigned DestReg = 0;
24346 switch (Res.first) {
24348 case X86::AX: DestReg = X86::RAX; break;
24349 case X86::DX: DestReg = X86::RDX; break;
24350 case X86::CX: DestReg = X86::RCX; break;
24351 case X86::BX: DestReg = X86::RBX; break;
24352 case X86::SI: DestReg = X86::RSI; break;
24353 case X86::DI: DestReg = X86::RDI; break;
24354 case X86::BP: DestReg = X86::RBP; break;
24355 case X86::SP: DestReg = X86::RSP; break;
24358 Res.first = DestReg;
24359 Res.second = &X86::GR64RegClass;
24362 } else if (Res.second == &X86::FR32RegClass ||
24363 Res.second == &X86::FR64RegClass ||
24364 Res.second == &X86::VR128RegClass ||
24365 Res.second == &X86::VR256RegClass ||
24366 Res.second == &X86::FR32XRegClass ||
24367 Res.second == &X86::FR64XRegClass ||
24368 Res.second == &X86::VR128XRegClass ||
24369 Res.second == &X86::VR256XRegClass ||
24370 Res.second == &X86::VR512RegClass) {
24371 // Handle references to XMM physical registers that got mapped into the
24372 // wrong class. This can happen with constraints like {xmm0} where the
24373 // target independent register mapper will just pick the first match it can
24374 // find, ignoring the required type.
24376 if (VT == MVT::f32 || VT == MVT::i32)
24377 Res.second = &X86::FR32RegClass;
24378 else if (VT == MVT::f64 || VT == MVT::i64)
24379 Res.second = &X86::FR64RegClass;
24380 else if (X86::VR128RegClass.hasType(VT))
24381 Res.second = &X86::VR128RegClass;
24382 else if (X86::VR256RegClass.hasType(VT))
24383 Res.second = &X86::VR256RegClass;
24384 else if (X86::VR512RegClass.hasType(VT))
24385 Res.second = &X86::VR512RegClass;
24391 int X86TargetLowering::getScalingFactorCost(const AddrMode &AM,
24393 // Scaling factors are not free at all.
24394 // An indexed folded instruction, i.e., inst (reg1, reg2, scale),
24395 // will take 2 allocations in the out of order engine instead of 1
24396 // for plain addressing mode, i.e. inst (reg1).
24398 // vaddps (%rsi,%drx), %ymm0, %ymm1
24399 // Requires two allocations (one for the load, one for the computation)
24401 // vaddps (%rsi), %ymm0, %ymm1
24402 // Requires just 1 allocation, i.e., freeing allocations for other operations
24403 // and having less micro operations to execute.
24405 // For some X86 architectures, this is even worse because for instance for
24406 // stores, the complex addressing mode forces the instruction to use the
24407 // "load" ports instead of the dedicated "store" port.
24408 // E.g., on Haswell:
24409 // vmovaps %ymm1, (%r8, %rdi) can use port 2 or 3.
24410 // vmovaps %ymm1, (%r8) can use port 2, 3, or 7.
24411 if (isLegalAddressingMode(AM, Ty))
24412 // Scale represents reg2 * scale, thus account for 1
24413 // as soon as we use a second register.
24414 return AM.Scale != 0;
24418 bool X86TargetLowering::isTargetFTOL() const {
24419 return Subtarget->isTargetKnownWindowsMSVC() && !Subtarget->is64Bit();