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 switch (VT.SimpleTy) {
7240 return DAG.getNode(X86ISD::BLENDI, DL, VT, V1, V2,
7241 DAG.getConstant(BlendMask, MVT::i8));
7246 // For integer shuffles we need to expand the mask and cast the inputs to
7247 // v8i16s prior to blending.
7248 int Scale = 8 / VT.getVectorNumElements();
7250 for (int i = 0, Size = Mask.size(); i < Size; ++i)
7251 if (Mask[i] >= Size)
7252 for (int j = 0; j < Scale; ++j)
7253 BlendMask |= 1u << (i * Scale + j);
7255 V1 = DAG.getNode(ISD::BITCAST, DL, MVT::v8i16, V1);
7256 V2 = DAG.getNode(ISD::BITCAST, DL, MVT::v8i16, V2);
7257 return DAG.getNode(ISD::BITCAST, DL, VT,
7258 DAG.getNode(X86ISD::BLENDI, DL, MVT::v8i16, V1, V2,
7259 DAG.getConstant(BlendMask, MVT::i8)));
7263 llvm_unreachable("Not a supported integer vector type!");
7267 /// \brief Try to lower a vector shuffle as a byte rotation.
7269 /// We have a generic PALIGNR instruction in x86 that will do an arbitrary
7270 /// byte-rotation of a the concatentation of two vectors. This routine will
7271 /// try to generically lower a vector shuffle through such an instruction. It
7272 /// does not check for the availability of PALIGNR-based lowerings, only the
7273 /// applicability of this strategy to the given mask. This matches shuffle
7274 /// vectors that look like:
7276 /// v8i16 [11, 12, 13, 14, 15, 0, 1, 2]
7278 /// Essentially it concatenates V1 and V2, shifts right by some number of
7279 /// elements, and takes the low elements as the result. Note that while this is
7280 /// specified as a *right shift* because x86 is little-endian, it is a *left
7281 /// rotate* of the vector lanes.
7283 /// Note that this only handles 128-bit vector widths currently.
7284 static SDValue lowerVectorShuffleAsByteRotate(SDLoc DL, MVT VT, SDValue V1,
7287 SelectionDAG &DAG) {
7288 assert(!isNoopShuffleMask(Mask) && "We shouldn't lower no-op shuffles!");
7290 // We need to detect various ways of spelling a rotation:
7291 // [11, 12, 13, 14, 15, 0, 1, 2]
7292 // [-1, 12, 13, 14, -1, -1, 1, -1]
7293 // [-1, -1, -1, -1, -1, -1, 1, 2]
7294 // [ 3, 4, 5, 6, 7, 8, 9, 10]
7295 // [-1, 4, 5, 6, -1, -1, 9, -1]
7296 // [-1, 4, 5, 6, -1, -1, -1, -1]
7299 for (int i = 0, Size = Mask.size(); i < Size; ++i) {
7302 assert(Mask[i] >= 0 && "Only -1 is a valid negative mask element!");
7304 // Based on the mod-Size value of this mask element determine where
7305 // a rotated vector would have started.
7306 int StartIdx = i - (Mask[i] % Size);
7308 // The identity rotation isn't interesting, stop.
7311 // If we found the tail of a vector the rotation must be the missing
7312 // front. If we found the head of a vector, it must be how much of the head.
7313 int CandidateRotation = StartIdx < 0 ? -StartIdx : Size - StartIdx;
7316 Rotation = CandidateRotation;
7317 else if (Rotation != CandidateRotation)
7318 // The rotations don't match, so we can't match this mask.
7321 // Compute which value this mask is pointing at.
7322 SDValue MaskV = Mask[i] < Size ? V1 : V2;
7324 // Compute which of the two target values this index should be assigned to.
7325 // This reflects whether the high elements are remaining or the low elements
7327 SDValue &TargetV = StartIdx < 0 ? Hi : Lo;
7329 // Either set up this value if we've not encountered it before, or check
7330 // that it remains consistent.
7333 else if (TargetV != MaskV)
7334 // This may be a rotation, but it pulls from the inputs in some
7335 // unsupported interleaving.
7339 // Check that we successfully analyzed the mask, and normalize the results.
7340 assert(Rotation != 0 && "Failed to locate a viable rotation!");
7341 assert((Lo || Hi) && "Failed to find a rotated input vector!");
7347 // Cast the inputs to v16i8 to match PALIGNR.
7348 Lo = DAG.getNode(ISD::BITCAST, DL, MVT::v16i8, Lo);
7349 Hi = DAG.getNode(ISD::BITCAST, DL, MVT::v16i8, Hi);
7351 assert(VT.getSizeInBits() == 128 &&
7352 "Rotate-based lowering only supports 128-bit lowering!");
7353 assert(Mask.size() <= 16 &&
7354 "Can shuffle at most 16 bytes in a 128-bit vector!");
7355 // The actual rotate instruction rotates bytes, so we need to scale the
7356 // rotation based on how many bytes are in the vector.
7357 int Scale = 16 / Mask.size();
7359 return DAG.getNode(ISD::BITCAST, DL, VT,
7360 DAG.getNode(X86ISD::PALIGNR, DL, MVT::v16i8, Hi, Lo,
7361 DAG.getConstant(Rotation * Scale, MVT::i8)));
7364 /// \brief Compute whether each element of a shuffle is zeroable.
7366 /// A "zeroable" vector shuffle element is one which can be lowered to zero.
7367 /// Either it is an undef element in the shuffle mask, the element of the input
7368 /// referenced is undef, or the element of the input referenced is known to be
7369 /// zero. Many x86 shuffles can zero lanes cheaply and we often want to handle
7370 /// as many lanes with this technique as possible to simplify the remaining
7372 static SmallBitVector computeZeroableShuffleElements(ArrayRef<int> Mask,
7373 SDValue V1, SDValue V2) {
7374 SmallBitVector Zeroable(Mask.size(), false);
7376 bool V1IsZero = ISD::isBuildVectorAllZeros(V1.getNode());
7377 bool V2IsZero = ISD::isBuildVectorAllZeros(V2.getNode());
7379 for (int i = 0, Size = Mask.size(); i < Size; ++i) {
7381 // Handle the easy cases.
7382 if (M < 0 || (M >= 0 && M < Size && V1IsZero) || (M >= Size && V2IsZero)) {
7387 // If this is an index into a build_vector node, dig out the input value and
7389 SDValue V = M < Size ? V1 : V2;
7390 if (V.getOpcode() != ISD::BUILD_VECTOR)
7393 SDValue Input = V.getOperand(M % Size);
7394 // The UNDEF opcode check really should be dead code here, but not quite
7395 // worth asserting on (it isn't invalid, just unexpected).
7396 if (Input.getOpcode() == ISD::UNDEF || X86::isZeroNode(Input))
7403 /// \brief Lower a vector shuffle as a zero or any extension.
7405 /// Given a specific number of elements, element bit width, and extension
7406 /// stride, produce either a zero or any extension based on the available
7407 /// features of the subtarget.
7408 static SDValue lowerVectorShuffleAsSpecificZeroOrAnyExtend(
7409 SDLoc DL, MVT VT, int NumElements, int Scale, bool AnyExt, SDValue InputV,
7410 const X86Subtarget *Subtarget, SelectionDAG &DAG) {
7411 assert(Scale > 1 && "Need a scale to extend.");
7412 int EltBits = VT.getSizeInBits() / NumElements;
7413 assert((EltBits == 8 || EltBits == 16 || EltBits == 32) &&
7414 "Only 8, 16, and 32 bit elements can be extended.");
7415 assert(Scale * EltBits <= 64 && "Cannot zero extend past 64 bits.");
7417 // Found a valid zext mask! Try various lowering strategies based on the
7418 // input type and available ISA extensions.
7419 if (Subtarget->hasSSE41()) {
7420 MVT InputVT = MVT::getVectorVT(MVT::getIntegerVT(EltBits), NumElements);
7421 MVT ExtVT = MVT::getVectorVT(MVT::getIntegerVT(EltBits * Scale),
7422 NumElements / Scale);
7423 InputV = DAG.getNode(ISD::BITCAST, DL, InputVT, InputV);
7424 return DAG.getNode(ISD::BITCAST, DL, VT,
7425 DAG.getNode(X86ISD::VZEXT, DL, ExtVT, InputV));
7428 // For any extends we can cheat for larger element sizes and use shuffle
7429 // instructions that can fold with a load and/or copy.
7430 if (AnyExt && EltBits == 32) {
7431 int PSHUFDMask[4] = {0, -1, 1, -1};
7433 ISD::BITCAST, DL, VT,
7434 DAG.getNode(X86ISD::PSHUFD, DL, MVT::v4i32,
7435 DAG.getNode(ISD::BITCAST, DL, MVT::v4i32, InputV),
7436 getV4X86ShuffleImm8ForMask(PSHUFDMask, DAG)));
7438 if (AnyExt && EltBits == 16 && Scale > 2) {
7439 int PSHUFDMask[4] = {0, -1, 0, -1};
7440 InputV = DAG.getNode(X86ISD::PSHUFD, DL, MVT::v4i32,
7441 DAG.getNode(ISD::BITCAST, DL, MVT::v4i32, InputV),
7442 getV4X86ShuffleImm8ForMask(PSHUFDMask, DAG));
7443 int PSHUFHWMask[4] = {1, -1, -1, -1};
7445 ISD::BITCAST, DL, VT,
7446 DAG.getNode(X86ISD::PSHUFHW, DL, MVT::v8i16,
7447 DAG.getNode(ISD::BITCAST, DL, MVT::v8i16, InputV),
7448 getV4X86ShuffleImm8ForMask(PSHUFHWMask, DAG)));
7451 // If this would require more than 2 unpack instructions to expand, use
7452 // pshufb when available. We can only use more than 2 unpack instructions
7453 // when zero extending i8 elements which also makes it easier to use pshufb.
7454 if (Scale > 4 && EltBits == 8 && Subtarget->hasSSSE3()) {
7455 assert(NumElements == 16 && "Unexpected byte vector width!");
7456 SDValue PSHUFBMask[16];
7457 for (int i = 0; i < 16; ++i)
7459 DAG.getConstant((i % Scale == 0) ? i / Scale : 0x80, MVT::i8);
7460 InputV = DAG.getNode(ISD::BITCAST, DL, MVT::v16i8, InputV);
7461 return DAG.getNode(ISD::BITCAST, DL, VT,
7462 DAG.getNode(X86ISD::PSHUFB, DL, MVT::v16i8, InputV,
7463 DAG.getNode(ISD::BUILD_VECTOR, DL,
7464 MVT::v16i8, PSHUFBMask)));
7467 // Otherwise emit a sequence of unpacks.
7469 MVT InputVT = MVT::getVectorVT(MVT::getIntegerVT(EltBits), NumElements);
7470 SDValue Ext = AnyExt ? DAG.getUNDEF(InputVT)
7471 : getZeroVector(InputVT, Subtarget, DAG, DL);
7472 InputV = DAG.getNode(ISD::BITCAST, DL, InputVT, InputV);
7473 InputV = DAG.getNode(X86ISD::UNPCKL, DL, InputVT, InputV, Ext);
7477 } while (Scale > 1);
7478 return DAG.getNode(ISD::BITCAST, DL, VT, InputV);
7481 /// \brief Try to lower a vector shuffle as a zero extension on any micrarch.
7483 /// This routine will try to do everything in its power to cleverly lower
7484 /// a shuffle which happens to match the pattern of a zero extend. It doesn't
7485 /// check for the profitability of this lowering, it tries to aggressively
7486 /// match this pattern. It will use all of the micro-architectural details it
7487 /// can to emit an efficient lowering. It handles both blends with all-zero
7488 /// inputs to explicitly zero-extend and undef-lanes (sometimes undef due to
7489 /// masking out later).
7491 /// The reason we have dedicated lowering for zext-style shuffles is that they
7492 /// are both incredibly common and often quite performance sensitive.
7493 static SDValue lowerVectorShuffleAsZeroOrAnyExtend(
7494 SDLoc DL, MVT VT, SDValue V1, SDValue V2, ArrayRef<int> Mask,
7495 const X86Subtarget *Subtarget, SelectionDAG &DAG) {
7496 SmallBitVector Zeroable = computeZeroableShuffleElements(Mask, V1, V2);
7498 int Bits = VT.getSizeInBits();
7499 int NumElements = Mask.size();
7501 // Define a helper function to check a particular ext-scale and lower to it if
7503 auto Lower = [&](int Scale) -> SDValue {
7506 for (int i = 0; i < NumElements; ++i) {
7508 continue; // Valid anywhere but doesn't tell us anything.
7509 if (i % Scale != 0) {
7510 // Each of the extend elements needs to be zeroable.
7514 // We no lorger are in the anyext case.
7519 // Each of the base elements needs to be consecutive indices into the
7520 // same input vector.
7521 SDValue V = Mask[i] < NumElements ? V1 : V2;
7524 else if (InputV != V)
7525 return SDValue(); // Flip-flopping inputs.
7527 if (Mask[i] % NumElements != i / Scale)
7528 return SDValue(); // Non-consecutive strided elemenst.
7531 // If we fail to find an input, we have a zero-shuffle which should always
7532 // have already been handled.
7533 // FIXME: Maybe handle this here in case during blending we end up with one?
7537 return lowerVectorShuffleAsSpecificZeroOrAnyExtend(
7538 DL, VT, NumElements, Scale, AnyExt, InputV, Subtarget, DAG);
7541 // The widest scale possible for extending is to a 64-bit integer.
7542 assert(Bits % 64 == 0 &&
7543 "The number of bits in a vector must be divisible by 64 on x86!");
7544 int NumExtElements = Bits / 64;
7546 // Each iteration, try extending the elements half as much, but into twice as
7548 for (; NumExtElements < NumElements; NumExtElements *= 2) {
7549 assert(NumElements % NumExtElements == 0 &&
7550 "The input vector size must be divisble by the extended size.");
7551 if (SDValue V = Lower(NumElements / NumExtElements))
7555 // No viable ext lowering found.
7559 /// \brief Try to lower insertion of a single element into a zero vector.
7561 /// This is a common pattern that we have especially efficient patterns to lower
7562 /// across all subtarget feature sets.
7563 static SDValue lowerVectorShuffleAsElementInsertion(
7564 MVT VT, SDLoc DL, SDValue V1, SDValue V2, ArrayRef<int> Mask,
7565 const X86Subtarget *Subtarget, SelectionDAG &DAG) {
7566 SmallBitVector Zeroable = computeZeroableShuffleElements(Mask, V1, V2);
7568 int V2Index = std::find_if(Mask.begin(), Mask.end(),
7569 [&Mask](int M) { return M >= (int)Mask.size(); }) -
7571 if (Mask.size() == 2) {
7572 if (!Zeroable[V2Index ^ 1]) {
7573 // For 2-wide masks we may be able to just invert the inputs. We use an xor
7574 // with 2 to flip from {2,3} to {0,1} and vice versa.
7575 int InverseMask[2] = {Mask[0] < 0 ? -1 : (Mask[0] ^ 2),
7576 Mask[1] < 0 ? -1 : (Mask[1] ^ 2)};
7577 if (Zeroable[V2Index])
7578 return lowerVectorShuffleAsElementInsertion(VT, DL, V2, V1, InverseMask,
7584 for (int i = 0, Size = Mask.size(); i < Size; ++i)
7585 if (i != V2Index && !Zeroable[i])
7586 return SDValue(); // Not inserting into a zero vector.
7589 // Step over any bitcasts on either input so we can scan the actual
7590 // BUILD_VECTOR nodes.
7591 while (V1.getOpcode() == ISD::BITCAST)
7592 V1 = V1.getOperand(0);
7593 while (V2.getOpcode() == ISD::BITCAST)
7594 V2 = V2.getOperand(0);
7596 // Check for a single input from a SCALAR_TO_VECTOR node.
7597 // FIXME: All of this should be canonicalized into INSERT_VECTOR_ELT and
7598 // all the smarts here sunk into that routine. However, the current
7599 // lowering of BUILD_VECTOR makes that nearly impossible until the old
7600 // vector shuffle lowering is dead.
7601 if (!((V2.getOpcode() == ISD::SCALAR_TO_VECTOR &&
7602 Mask[V2Index] == (int)Mask.size()) ||
7603 V2.getOpcode() == ISD::BUILD_VECTOR))
7606 SDValue V2S = V2.getOperand(Mask[V2Index] - Mask.size());
7608 // First, we need to zext the scalar if it is smaller than an i32.
7610 MVT EltVT = VT.getVectorElementType();
7611 V2S = DAG.getNode(ISD::BITCAST, DL, EltVT, V2S);
7612 if (EltVT == MVT::i8 || EltVT == MVT::i16) {
7613 // Zero-extend directly to i32.
7615 V2S = DAG.getNode(ISD::ZERO_EXTEND, DL, MVT::i32, V2S);
7618 V2 = DAG.getNode(X86ISD::VZEXT_MOVL, DL, ExtVT,
7619 DAG.getNode(ISD::SCALAR_TO_VECTOR, DL, ExtVT, V2S));
7621 V2 = DAG.getNode(ISD::BITCAST, DL, VT, V2);
7624 // If we have 4 or fewer lanes we can cheaply shuffle the element into
7625 // the desired position. Otherwise it is more efficient to do a vector
7626 // shift left. We know that we can do a vector shift left because all
7627 // the inputs are zero.
7628 if (VT.isFloatingPoint() || VT.getVectorNumElements() <= 4) {
7629 SmallVector<int, 4> V2Shuffle(Mask.size(), 1);
7630 V2Shuffle[V2Index] = 0;
7631 V2 = DAG.getVectorShuffle(VT, DL, V2, DAG.getUNDEF(VT), V2Shuffle);
7633 V2 = DAG.getNode(ISD::BITCAST, DL, MVT::v2i64, V2);
7635 X86ISD::VSHLDQ, DL, MVT::v2i64, V2,
7637 V2Index * EltVT.getSizeInBits(),
7638 DAG.getTargetLoweringInfo().getScalarShiftAmountTy(MVT::v2i64)));
7639 V2 = DAG.getNode(ISD::BITCAST, DL, VT, V2);
7645 /// \brief Handle lowering of 2-lane 64-bit floating point shuffles.
7647 /// This is the basis function for the 2-lane 64-bit shuffles as we have full
7648 /// support for floating point shuffles but not integer shuffles. These
7649 /// instructions will incur a domain crossing penalty on some chips though so
7650 /// it is better to avoid lowering through this for integer vectors where
7652 static SDValue lowerV2F64VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
7653 const X86Subtarget *Subtarget,
7654 SelectionDAG &DAG) {
7656 assert(Op.getSimpleValueType() == MVT::v2f64 && "Bad shuffle type!");
7657 assert(V1.getSimpleValueType() == MVT::v2f64 && "Bad operand type!");
7658 assert(V2.getSimpleValueType() == MVT::v2f64 && "Bad operand type!");
7659 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
7660 ArrayRef<int> Mask = SVOp->getMask();
7661 assert(Mask.size() == 2 && "Unexpected mask size for v2 shuffle!");
7663 if (isSingleInputShuffleMask(Mask)) {
7664 // Straight shuffle of a single input vector. Simulate this by using the
7665 // single input as both of the "inputs" to this instruction..
7666 unsigned SHUFPDMask = (Mask[0] == 1) | ((Mask[1] == 1) << 1);
7668 if (Subtarget->hasAVX()) {
7669 // If we have AVX, we can use VPERMILPS which will allow folding a load
7670 // into the shuffle.
7671 return DAG.getNode(X86ISD::VPERMILP, DL, MVT::v2f64, V1,
7672 DAG.getConstant(SHUFPDMask, MVT::i8));
7675 return DAG.getNode(X86ISD::SHUFP, SDLoc(Op), MVT::v2f64, V1, V1,
7676 DAG.getConstant(SHUFPDMask, MVT::i8));
7678 assert(Mask[0] >= 0 && Mask[0] < 2 && "Non-canonicalized blend!");
7679 assert(Mask[1] >= 2 && "Non-canonicalized blend!");
7681 // Use dedicated unpack instructions for masks that match their pattern.
7682 if (isShuffleEquivalent(Mask, 0, 2))
7683 return DAG.getNode(X86ISD::UNPCKL, DL, MVT::v2f64, V1, V2);
7684 if (isShuffleEquivalent(Mask, 1, 3))
7685 return DAG.getNode(X86ISD::UNPCKH, DL, MVT::v2f64, V1, V2);
7687 // If we have a single input, insert that into V1 if we can do so cheaply.
7688 if ((Mask[0] >= 2) + (Mask[1] >= 2) == 1)
7689 if (SDValue Insertion = lowerVectorShuffleAsElementInsertion(
7690 MVT::v2f64, DL, V1, V2, Mask, Subtarget, DAG))
7693 if (Subtarget->hasSSE41())
7695 lowerVectorShuffleAsBlend(DL, MVT::v2f64, V1, V2, Mask, DAG))
7698 unsigned SHUFPDMask = (Mask[0] == 1) | (((Mask[1] - 2) == 1) << 1);
7699 return DAG.getNode(X86ISD::SHUFP, SDLoc(Op), MVT::v2f64, V1, V2,
7700 DAG.getConstant(SHUFPDMask, MVT::i8));
7703 /// \brief Handle lowering of 2-lane 64-bit integer shuffles.
7705 /// Tries to lower a 2-lane 64-bit shuffle using shuffle operations provided by
7706 /// the integer unit to minimize domain crossing penalties. However, for blends
7707 /// it falls back to the floating point shuffle operation with appropriate bit
7709 static SDValue lowerV2I64VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
7710 const X86Subtarget *Subtarget,
7711 SelectionDAG &DAG) {
7713 assert(Op.getSimpleValueType() == MVT::v2i64 && "Bad shuffle type!");
7714 assert(V1.getSimpleValueType() == MVT::v2i64 && "Bad operand type!");
7715 assert(V2.getSimpleValueType() == MVT::v2i64 && "Bad operand type!");
7716 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
7717 ArrayRef<int> Mask = SVOp->getMask();
7718 assert(Mask.size() == 2 && "Unexpected mask size for v2 shuffle!");
7720 if (isSingleInputShuffleMask(Mask)) {
7721 // Straight shuffle of a single input vector. For everything from SSE2
7722 // onward this has a single fast instruction with no scary immediates.
7723 // We have to map the mask as it is actually a v4i32 shuffle instruction.
7724 V1 = DAG.getNode(ISD::BITCAST, DL, MVT::v4i32, V1);
7725 int WidenedMask[4] = {
7726 std::max(Mask[0], 0) * 2, std::max(Mask[0], 0) * 2 + 1,
7727 std::max(Mask[1], 0) * 2, std::max(Mask[1], 0) * 2 + 1};
7729 ISD::BITCAST, DL, MVT::v2i64,
7730 DAG.getNode(X86ISD::PSHUFD, SDLoc(Op), MVT::v4i32, V1,
7731 getV4X86ShuffleImm8ForMask(WidenedMask, DAG)));
7734 // Use dedicated unpack instructions for masks that match their pattern.
7735 if (isShuffleEquivalent(Mask, 0, 2))
7736 return DAG.getNode(X86ISD::UNPCKL, DL, MVT::v2i64, V1, V2);
7737 if (isShuffleEquivalent(Mask, 1, 3))
7738 return DAG.getNode(X86ISD::UNPCKH, DL, MVT::v2i64, V1, V2);
7740 // If we have a single input from V2 insert that into V1 if we can do so
7742 if ((Mask[0] >= 2) + (Mask[1] >= 2) == 1)
7743 if (SDValue Insertion = lowerVectorShuffleAsElementInsertion(
7744 MVT::v2i64, DL, V1, V2, Mask, Subtarget, DAG))
7747 if (Subtarget->hasSSE41())
7749 lowerVectorShuffleAsBlend(DL, MVT::v2i64, V1, V2, Mask, DAG))
7752 // Try to use rotation instructions if available.
7753 if (Subtarget->hasSSSE3())
7754 if (SDValue Rotate = lowerVectorShuffleAsByteRotate(
7755 DL, MVT::v2i64, V1, V2, Mask, DAG))
7758 // We implement this with SHUFPD which is pretty lame because it will likely
7759 // incur 2 cycles of stall for integer vectors on Nehalem and older chips.
7760 // However, all the alternatives are still more cycles and newer chips don't
7761 // have this problem. It would be really nice if x86 had better shuffles here.
7762 V1 = DAG.getNode(ISD::BITCAST, DL, MVT::v2f64, V1);
7763 V2 = DAG.getNode(ISD::BITCAST, DL, MVT::v2f64, V2);
7764 return DAG.getNode(ISD::BITCAST, DL, MVT::v2i64,
7765 DAG.getVectorShuffle(MVT::v2f64, DL, V1, V2, Mask));
7768 /// \brief Lower 4-lane 32-bit floating point shuffles.
7770 /// Uses instructions exclusively from the floating point unit to minimize
7771 /// domain crossing penalties, as these are sufficient to implement all v4f32
7773 static SDValue lowerV4F32VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
7774 const X86Subtarget *Subtarget,
7775 SelectionDAG &DAG) {
7777 assert(Op.getSimpleValueType() == MVT::v4f32 && "Bad shuffle type!");
7778 assert(V1.getSimpleValueType() == MVT::v4f32 && "Bad operand type!");
7779 assert(V2.getSimpleValueType() == MVT::v4f32 && "Bad operand type!");
7780 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
7781 ArrayRef<int> Mask = SVOp->getMask();
7782 assert(Mask.size() == 4 && "Unexpected mask size for v4 shuffle!");
7784 SDValue LowV = V1, HighV = V2;
7785 int NewMask[4] = {Mask[0], Mask[1], Mask[2], Mask[3]};
7788 std::count_if(Mask.begin(), Mask.end(), [](int M) { return M >= 4; });
7790 if (NumV2Elements == 0) {
7791 if (Subtarget->hasAVX()) {
7792 // If we have AVX, we can use VPERMILPS which will allow folding a load
7793 // into the shuffle.
7794 return DAG.getNode(X86ISD::VPERMILP, DL, MVT::v4f32, V1,
7795 getV4X86ShuffleImm8ForMask(Mask, DAG));
7798 // Otherwise, use a straight shuffle of a single input vector. We pass the
7799 // input vector to both operands to simulate this with a SHUFPS.
7800 return DAG.getNode(X86ISD::SHUFP, DL, MVT::v4f32, V1, V1,
7801 getV4X86ShuffleImm8ForMask(Mask, DAG));
7804 // Use dedicated unpack instructions for masks that match their pattern.
7805 if (isShuffleEquivalent(Mask, 0, 4, 1, 5))
7806 return DAG.getNode(X86ISD::UNPCKL, DL, MVT::v4f32, V1, V2);
7807 if (isShuffleEquivalent(Mask, 2, 6, 3, 7))
7808 return DAG.getNode(X86ISD::UNPCKH, DL, MVT::v4f32, V1, V2);
7810 // There are special ways we can lower some single-element blends. However, we
7811 // have custom ways we can lower more complex single-element blends below that
7812 // we defer to if both this and BLENDPS fail to match, so restrict this to
7813 // when the V2 input is targeting element 0 of the mask -- that is the fast
7815 if (NumV2Elements == 1 && Mask[0] >= 4)
7816 if (SDValue V = lowerVectorShuffleAsElementInsertion(MVT::v4f32, DL, V1, V2,
7817 Mask, Subtarget, DAG))
7820 if (Subtarget->hasSSE41())
7822 lowerVectorShuffleAsBlend(DL, MVT::v4f32, V1, V2, Mask, DAG))
7825 if (NumV2Elements == 1) {
7827 std::find_if(Mask.begin(), Mask.end(), [](int M) { return M >= 4; }) -
7830 // Check for whether we can use INSERTPS to perform the blend. We only use
7831 // INSERTPS when the V1 elements are already in the correct locations
7832 // because otherwise we can just always use two SHUFPS instructions which
7833 // are much smaller to encode than a SHUFPS and an INSERTPS.
7834 if (Subtarget->hasSSE41()) {
7835 // When using INSERTPS we can zero any lane of the destination. Collect
7836 // the zero inputs into a mask and drop them from the lanes of V1 which
7837 // actually need to be present as inputs to the INSERTPS.
7838 SmallBitVector Zeroable = computeZeroableShuffleElements(Mask, V1, V2);
7840 // Synthesize a shuffle mask for the non-zero and non-v2 inputs.
7841 bool InsertNeedsShuffle = false;
7843 for (int i = 0; i < 4; ++i)
7847 } else if (Mask[i] != i) {
7848 InsertNeedsShuffle = true;
7853 // We don't want to use INSERTPS or other insertion techniques if it will
7854 // require shuffling anyways.
7855 if (!InsertNeedsShuffle) {
7856 // If all of V1 is zeroable, replace it with undef.
7857 if ((ZMask | 1 << V2Index) == 0xF)
7858 V1 = DAG.getUNDEF(MVT::v4f32);
7860 unsigned InsertPSMask = (Mask[V2Index] - 4) << 6 | V2Index << 4 | ZMask;
7861 assert((InsertPSMask & ~0xFFu) == 0 && "Invalid mask!");
7863 // Insert the V2 element into the desired position.
7864 return DAG.getNode(X86ISD::INSERTPS, DL, MVT::v4f32, V1, V2,
7865 DAG.getConstant(InsertPSMask, MVT::i8));
7869 // Compute the index adjacent to V2Index and in the same half by toggling
7871 int V2AdjIndex = V2Index ^ 1;
7873 if (Mask[V2AdjIndex] == -1) {
7874 // Handles all the cases where we have a single V2 element and an undef.
7875 // This will only ever happen in the high lanes because we commute the
7876 // vector otherwise.
7878 std::swap(LowV, HighV);
7879 NewMask[V2Index] -= 4;
7881 // Handle the case where the V2 element ends up adjacent to a V1 element.
7882 // To make this work, blend them together as the first step.
7883 int V1Index = V2AdjIndex;
7884 int BlendMask[4] = {Mask[V2Index] - 4, 0, Mask[V1Index], 0};
7885 V2 = DAG.getNode(X86ISD::SHUFP, DL, MVT::v4f32, V2, V1,
7886 getV4X86ShuffleImm8ForMask(BlendMask, DAG));
7888 // Now proceed to reconstruct the final blend as we have the necessary
7889 // high or low half formed.
7896 NewMask[V1Index] = 2; // We put the V1 element in V2[2].
7897 NewMask[V2Index] = 0; // We shifted the V2 element into V2[0].
7899 } else if (NumV2Elements == 2) {
7900 if (Mask[0] < 4 && Mask[1] < 4) {
7901 // Handle the easy case where we have V1 in the low lanes and V2 in the
7902 // high lanes. We never see this reversed because we sort the shuffle.
7906 // We have a mixture of V1 and V2 in both low and high lanes. Rather than
7907 // trying to place elements directly, just blend them and set up the final
7908 // shuffle to place them.
7910 // The first two blend mask elements are for V1, the second two are for
7912 int BlendMask[4] = {Mask[0] < 4 ? Mask[0] : Mask[1],
7913 Mask[2] < 4 ? Mask[2] : Mask[3],
7914 (Mask[0] >= 4 ? Mask[0] : Mask[1]) - 4,
7915 (Mask[2] >= 4 ? Mask[2] : Mask[3]) - 4};
7916 V1 = DAG.getNode(X86ISD::SHUFP, DL, MVT::v4f32, V1, V2,
7917 getV4X86ShuffleImm8ForMask(BlendMask, DAG));
7919 // Now we do a normal shuffle of V1 by giving V1 as both operands to
7922 NewMask[0] = Mask[0] < 4 ? 0 : 2;
7923 NewMask[1] = Mask[0] < 4 ? 2 : 0;
7924 NewMask[2] = Mask[2] < 4 ? 1 : 3;
7925 NewMask[3] = Mask[2] < 4 ? 3 : 1;
7928 return DAG.getNode(X86ISD::SHUFP, DL, MVT::v4f32, LowV, HighV,
7929 getV4X86ShuffleImm8ForMask(NewMask, DAG));
7932 /// \brief Lower 4-lane i32 vector shuffles.
7934 /// We try to handle these with integer-domain shuffles where we can, but for
7935 /// blends we use the floating point domain blend instructions.
7936 static SDValue lowerV4I32VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
7937 const X86Subtarget *Subtarget,
7938 SelectionDAG &DAG) {
7940 assert(Op.getSimpleValueType() == MVT::v4i32 && "Bad shuffle type!");
7941 assert(V1.getSimpleValueType() == MVT::v4i32 && "Bad operand type!");
7942 assert(V2.getSimpleValueType() == MVT::v4i32 && "Bad operand type!");
7943 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
7944 ArrayRef<int> Mask = SVOp->getMask();
7945 assert(Mask.size() == 4 && "Unexpected mask size for v4 shuffle!");
7948 std::count_if(Mask.begin(), Mask.end(), [](int M) { return M >= 4; });
7950 if (NumV2Elements == 0) {
7951 // Straight shuffle of a single input vector. For everything from SSE2
7952 // onward this has a single fast instruction with no scary immediates.
7953 // We coerce the shuffle pattern to be compatible with UNPCK instructions
7954 // but we aren't actually going to use the UNPCK instruction because doing
7955 // so prevents folding a load into this instruction or making a copy.
7956 const int UnpackLoMask[] = {0, 0, 1, 1};
7957 const int UnpackHiMask[] = {2, 2, 3, 3};
7958 if (isShuffleEquivalent(Mask, 0, 0, 1, 1))
7959 Mask = UnpackLoMask;
7960 else if (isShuffleEquivalent(Mask, 2, 2, 3, 3))
7961 Mask = UnpackHiMask;
7963 return DAG.getNode(X86ISD::PSHUFD, DL, MVT::v4i32, V1,
7964 getV4X86ShuffleImm8ForMask(Mask, DAG));
7967 // Whenever we can lower this as a zext, that instruction is strictly faster
7968 // than any alternative.
7969 if (SDValue ZExt = lowerVectorShuffleAsZeroOrAnyExtend(DL, MVT::v4i32, V1, V2,
7970 Mask, Subtarget, DAG))
7973 // Use dedicated unpack instructions for masks that match their pattern.
7974 if (isShuffleEquivalent(Mask, 0, 4, 1, 5))
7975 return DAG.getNode(X86ISD::UNPCKL, DL, MVT::v4i32, V1, V2);
7976 if (isShuffleEquivalent(Mask, 2, 6, 3, 7))
7977 return DAG.getNode(X86ISD::UNPCKH, DL, MVT::v4i32, V1, V2);
7979 // There are special ways we can lower some single-element blends.
7980 if (NumV2Elements == 1)
7981 if (SDValue V = lowerVectorShuffleAsElementInsertion(MVT::v4i32, DL, V1, V2,
7982 Mask, Subtarget, DAG))
7985 if (Subtarget->hasSSE41())
7987 lowerVectorShuffleAsBlend(DL, MVT::v4i32, V1, V2, Mask, DAG))
7990 // Try to use rotation instructions if available.
7991 if (Subtarget->hasSSSE3())
7992 if (SDValue Rotate = lowerVectorShuffleAsByteRotate(
7993 DL, MVT::v4i32, V1, V2, Mask, DAG))
7996 // We implement this with SHUFPS because it can blend from two vectors.
7997 // Because we're going to eventually use SHUFPS, we use SHUFPS even to build
7998 // up the inputs, bypassing domain shift penalties that we would encur if we
7999 // directly used PSHUFD on Nehalem and older. For newer chips, this isn't
8001 return DAG.getNode(ISD::BITCAST, DL, MVT::v4i32,
8002 DAG.getVectorShuffle(
8004 DAG.getNode(ISD::BITCAST, DL, MVT::v4f32, V1),
8005 DAG.getNode(ISD::BITCAST, DL, MVT::v4f32, V2), Mask));
8008 /// \brief Lowering of single-input v8i16 shuffles is the cornerstone of SSE2
8009 /// shuffle lowering, and the most complex part.
8011 /// The lowering strategy is to try to form pairs of input lanes which are
8012 /// targeted at the same half of the final vector, and then use a dword shuffle
8013 /// to place them onto the right half, and finally unpack the paired lanes into
8014 /// their final position.
8016 /// The exact breakdown of how to form these dword pairs and align them on the
8017 /// correct sides is really tricky. See the comments within the function for
8018 /// more of the details.
8019 static SDValue lowerV8I16SingleInputVectorShuffle(
8020 SDLoc DL, SDValue V, MutableArrayRef<int> Mask,
8021 const X86Subtarget *Subtarget, SelectionDAG &DAG) {
8022 assert(V.getSimpleValueType() == MVT::v8i16 && "Bad input type!");
8023 MutableArrayRef<int> LoMask = Mask.slice(0, 4);
8024 MutableArrayRef<int> HiMask = Mask.slice(4, 4);
8026 SmallVector<int, 4> LoInputs;
8027 std::copy_if(LoMask.begin(), LoMask.end(), std::back_inserter(LoInputs),
8028 [](int M) { return M >= 0; });
8029 std::sort(LoInputs.begin(), LoInputs.end());
8030 LoInputs.erase(std::unique(LoInputs.begin(), LoInputs.end()), LoInputs.end());
8031 SmallVector<int, 4> HiInputs;
8032 std::copy_if(HiMask.begin(), HiMask.end(), std::back_inserter(HiInputs),
8033 [](int M) { return M >= 0; });
8034 std::sort(HiInputs.begin(), HiInputs.end());
8035 HiInputs.erase(std::unique(HiInputs.begin(), HiInputs.end()), HiInputs.end());
8037 std::lower_bound(LoInputs.begin(), LoInputs.end(), 4) - LoInputs.begin();
8038 int NumHToL = LoInputs.size() - NumLToL;
8040 std::lower_bound(HiInputs.begin(), HiInputs.end(), 4) - HiInputs.begin();
8041 int NumHToH = HiInputs.size() - NumLToH;
8042 MutableArrayRef<int> LToLInputs(LoInputs.data(), NumLToL);
8043 MutableArrayRef<int> LToHInputs(HiInputs.data(), NumLToH);
8044 MutableArrayRef<int> HToLInputs(LoInputs.data() + NumLToL, NumHToL);
8045 MutableArrayRef<int> HToHInputs(HiInputs.data() + NumLToH, NumHToH);
8047 // Use dedicated unpack instructions for masks that match their pattern.
8048 if (isShuffleEquivalent(Mask, 0, 0, 1, 1, 2, 2, 3, 3))
8049 return DAG.getNode(X86ISD::UNPCKL, DL, MVT::v8i16, V, V);
8050 if (isShuffleEquivalent(Mask, 4, 4, 5, 5, 6, 6, 7, 7))
8051 return DAG.getNode(X86ISD::UNPCKH, DL, MVT::v8i16, V, V);
8053 // Try to use rotation instructions if available.
8054 if (Subtarget->hasSSSE3())
8055 if (SDValue Rotate = lowerVectorShuffleAsByteRotate(
8056 DL, MVT::v8i16, V, V, Mask, DAG))
8059 // Simplify the 1-into-3 and 3-into-1 cases with a single pshufd. For all
8060 // such inputs we can swap two of the dwords across the half mark and end up
8061 // with <=2 inputs to each half in each half. Once there, we can fall through
8062 // to the generic code below. For example:
8064 // Input: [a, b, c, d, e, f, g, h] -PSHUFD[0,2,1,3]-> [a, b, e, f, c, d, g, h]
8065 // Mask: [0, 1, 2, 7, 4, 5, 6, 3] -----------------> [0, 1, 4, 7, 2, 3, 6, 5]
8067 // However in some very rare cases we have a 1-into-3 or 3-into-1 on one half
8068 // and an existing 2-into-2 on the other half. In this case we may have to
8069 // pre-shuffle the 2-into-2 half to avoid turning it into a 3-into-1 or
8070 // 1-into-3 which could cause us to cycle endlessly fixing each side in turn.
8071 // Fortunately, we don't have to handle anything but a 2-into-2 pattern
8072 // because any other situation (including a 3-into-1 or 1-into-3 in the other
8073 // half than the one we target for fixing) will be fixed when we re-enter this
8074 // path. We will also combine away any sequence of PSHUFD instructions that
8075 // result into a single instruction. Here is an example of the tricky case:
8077 // Input: [a, b, c, d, e, f, g, h] -PSHUFD[0,2,1,3]-> [a, b, e, f, c, d, g, h]
8078 // Mask: [3, 7, 1, 0, 2, 7, 3, 5] -THIS-IS-BAD!!!!-> [5, 7, 1, 0, 4, 7, 5, 3]
8080 // This now has a 1-into-3 in the high half! Instead, we do two shuffles:
8082 // Input: [a, b, c, d, e, f, g, h] PSHUFHW[0,2,1,3]-> [a, b, c, d, e, g, f, h]
8083 // Mask: [3, 7, 1, 0, 2, 7, 3, 5] -----------------> [3, 7, 1, 0, 2, 7, 3, 6]
8085 // Input: [a, b, c, d, e, g, f, h] -PSHUFD[0,2,1,3]-> [a, b, e, g, c, d, f, h]
8086 // Mask: [3, 7, 1, 0, 2, 7, 3, 6] -----------------> [5, 7, 1, 0, 4, 7, 5, 6]
8088 // The result is fine to be handled by the generic logic.
8089 auto balanceSides = [&](ArrayRef<int> AToAInputs, ArrayRef<int> BToAInputs,
8090 ArrayRef<int> BToBInputs, ArrayRef<int> AToBInputs,
8091 int AOffset, int BOffset) {
8092 assert((AToAInputs.size() == 3 || AToAInputs.size() == 1) &&
8093 "Must call this with A having 3 or 1 inputs from the A half.");
8094 assert((BToAInputs.size() == 1 || BToAInputs.size() == 3) &&
8095 "Must call this with B having 1 or 3 inputs from the B half.");
8096 assert(AToAInputs.size() + BToAInputs.size() == 4 &&
8097 "Must call this with either 3:1 or 1:3 inputs (summing to 4).");
8099 // Compute the index of dword with only one word among the three inputs in
8100 // a half by taking the sum of the half with three inputs and subtracting
8101 // the sum of the actual three inputs. The difference is the remaining
8104 int &TripleDWord = AToAInputs.size() == 3 ? ADWord : BDWord;
8105 int &OneInputDWord = AToAInputs.size() == 3 ? BDWord : ADWord;
8106 int TripleInputOffset = AToAInputs.size() == 3 ? AOffset : BOffset;
8107 ArrayRef<int> TripleInputs = AToAInputs.size() == 3 ? AToAInputs : BToAInputs;
8108 int OneInput = AToAInputs.size() == 3 ? BToAInputs[0] : AToAInputs[0];
8109 int TripleInputSum = 0 + 1 + 2 + 3 + (4 * TripleInputOffset);
8110 int TripleNonInputIdx =
8111 TripleInputSum - std::accumulate(TripleInputs.begin(), TripleInputs.end(), 0);
8112 TripleDWord = TripleNonInputIdx / 2;
8114 // We use xor with one to compute the adjacent DWord to whichever one the
8116 OneInputDWord = (OneInput / 2) ^ 1;
8118 // Check for one tricky case: We're fixing a 3<-1 or a 1<-3 shuffle for AToA
8119 // and BToA inputs. If there is also such a problem with the BToB and AToB
8120 // inputs, we don't try to fix it necessarily -- we'll recurse and see it in
8121 // the next pass. However, if we have a 2<-2 in the BToB and AToB inputs, it
8122 // is essential that we don't *create* a 3<-1 as then we might oscillate.
8123 if (BToBInputs.size() == 2 && AToBInputs.size() == 2) {
8124 // Compute how many inputs will be flipped by swapping these DWords. We
8126 // to balance this to ensure we don't form a 3-1 shuffle in the other
8128 int NumFlippedAToBInputs =
8129 std::count(AToBInputs.begin(), AToBInputs.end(), 2 * ADWord) +
8130 std::count(AToBInputs.begin(), AToBInputs.end(), 2 * ADWord + 1);
8131 int NumFlippedBToBInputs =
8132 std::count(BToBInputs.begin(), BToBInputs.end(), 2 * BDWord) +
8133 std::count(BToBInputs.begin(), BToBInputs.end(), 2 * BDWord + 1);
8134 if ((NumFlippedAToBInputs == 1 &&
8135 (NumFlippedBToBInputs == 0 || NumFlippedBToBInputs == 2)) ||
8136 (NumFlippedBToBInputs == 1 &&
8137 (NumFlippedAToBInputs == 0 || NumFlippedAToBInputs == 2))) {
8138 // We choose whether to fix the A half or B half based on whether that
8139 // half has zero flipped inputs. At zero, we may not be able to fix it
8140 // with that half. We also bias towards fixing the B half because that
8141 // will more commonly be the high half, and we have to bias one way.
8142 auto FixFlippedInputs = [&V, &DL, &Mask, &DAG](int PinnedIdx, int DWord,
8143 ArrayRef<int> Inputs) {
8144 int FixIdx = PinnedIdx ^ 1; // The adjacent slot to the pinned slot.
8145 bool IsFixIdxInput = std::find(Inputs.begin(), Inputs.end(),
8146 PinnedIdx ^ 1) != Inputs.end();
8147 // Determine whether the free index is in the flipped dword or the
8148 // unflipped dword based on where the pinned index is. We use this bit
8149 // in an xor to conditionally select the adjacent dword.
8150 int FixFreeIdx = 2 * (DWord ^ (PinnedIdx / 2 == DWord));
8151 bool IsFixFreeIdxInput = std::find(Inputs.begin(), Inputs.end(),
8152 FixFreeIdx) != Inputs.end();
8153 if (IsFixIdxInput == IsFixFreeIdxInput)
8155 IsFixFreeIdxInput = std::find(Inputs.begin(), Inputs.end(),
8156 FixFreeIdx) != Inputs.end();
8157 assert(IsFixIdxInput != IsFixFreeIdxInput &&
8158 "We need to be changing the number of flipped inputs!");
8159 int PSHUFHalfMask[] = {0, 1, 2, 3};
8160 std::swap(PSHUFHalfMask[FixFreeIdx % 4], PSHUFHalfMask[FixIdx % 4]);
8161 V = DAG.getNode(FixIdx < 4 ? X86ISD::PSHUFLW : X86ISD::PSHUFHW, DL,
8163 getV4X86ShuffleImm8ForMask(PSHUFHalfMask, DAG));
8166 if (M != -1 && M == FixIdx)
8168 else if (M != -1 && M == FixFreeIdx)
8171 if (NumFlippedBToBInputs != 0) {
8173 BToAInputs.size() == 3 ? TripleNonInputIdx : OneInput;
8174 FixFlippedInputs(BPinnedIdx, BDWord, BToBInputs);
8176 assert(NumFlippedAToBInputs != 0 && "Impossible given predicates!");
8178 AToAInputs.size() == 3 ? TripleNonInputIdx : OneInput;
8179 FixFlippedInputs(APinnedIdx, ADWord, AToBInputs);
8184 int PSHUFDMask[] = {0, 1, 2, 3};
8185 PSHUFDMask[ADWord] = BDWord;
8186 PSHUFDMask[BDWord] = ADWord;
8187 V = DAG.getNode(ISD::BITCAST, DL, MVT::v8i16,
8188 DAG.getNode(X86ISD::PSHUFD, DL, MVT::v4i32,
8189 DAG.getNode(ISD::BITCAST, DL, MVT::v4i32, V),
8190 getV4X86ShuffleImm8ForMask(PSHUFDMask, DAG)));
8192 // Adjust the mask to match the new locations of A and B.
8194 if (M != -1 && M/2 == ADWord)
8195 M = 2 * BDWord + M % 2;
8196 else if (M != -1 && M/2 == BDWord)
8197 M = 2 * ADWord + M % 2;
8199 // Recurse back into this routine to re-compute state now that this isn't
8200 // a 3 and 1 problem.
8201 return DAG.getVectorShuffle(MVT::v8i16, DL, V, DAG.getUNDEF(MVT::v8i16),
8204 if ((NumLToL == 3 && NumHToL == 1) || (NumLToL == 1 && NumHToL == 3))
8205 return balanceSides(LToLInputs, HToLInputs, HToHInputs, LToHInputs, 0, 4);
8206 else if ((NumHToH == 3 && NumLToH == 1) || (NumHToH == 1 && NumLToH == 3))
8207 return balanceSides(HToHInputs, LToHInputs, LToLInputs, HToLInputs, 4, 0);
8209 // At this point there are at most two inputs to the low and high halves from
8210 // each half. That means the inputs can always be grouped into dwords and
8211 // those dwords can then be moved to the correct half with a dword shuffle.
8212 // We use at most one low and one high word shuffle to collect these paired
8213 // inputs into dwords, and finally a dword shuffle to place them.
8214 int PSHUFLMask[4] = {-1, -1, -1, -1};
8215 int PSHUFHMask[4] = {-1, -1, -1, -1};
8216 int PSHUFDMask[4] = {-1, -1, -1, -1};
8218 // First fix the masks for all the inputs that are staying in their
8219 // original halves. This will then dictate the targets of the cross-half
8221 auto fixInPlaceInputs =
8222 [&PSHUFDMask](ArrayRef<int> InPlaceInputs, ArrayRef<int> IncomingInputs,
8223 MutableArrayRef<int> SourceHalfMask,
8224 MutableArrayRef<int> HalfMask, int HalfOffset) {
8225 if (InPlaceInputs.empty())
8227 if (InPlaceInputs.size() == 1) {
8228 SourceHalfMask[InPlaceInputs[0] - HalfOffset] =
8229 InPlaceInputs[0] - HalfOffset;
8230 PSHUFDMask[InPlaceInputs[0] / 2] = InPlaceInputs[0] / 2;
8233 if (IncomingInputs.empty()) {
8234 // Just fix all of the in place inputs.
8235 for (int Input : InPlaceInputs) {
8236 SourceHalfMask[Input - HalfOffset] = Input - HalfOffset;
8237 PSHUFDMask[Input / 2] = Input / 2;
8242 assert(InPlaceInputs.size() == 2 && "Cannot handle 3 or 4 inputs!");
8243 SourceHalfMask[InPlaceInputs[0] - HalfOffset] =
8244 InPlaceInputs[0] - HalfOffset;
8245 // Put the second input next to the first so that they are packed into
8246 // a dword. We find the adjacent index by toggling the low bit.
8247 int AdjIndex = InPlaceInputs[0] ^ 1;
8248 SourceHalfMask[AdjIndex - HalfOffset] = InPlaceInputs[1] - HalfOffset;
8249 std::replace(HalfMask.begin(), HalfMask.end(), InPlaceInputs[1], AdjIndex);
8250 PSHUFDMask[AdjIndex / 2] = AdjIndex / 2;
8252 fixInPlaceInputs(LToLInputs, HToLInputs, PSHUFLMask, LoMask, 0);
8253 fixInPlaceInputs(HToHInputs, LToHInputs, PSHUFHMask, HiMask, 4);
8255 // Now gather the cross-half inputs and place them into a free dword of
8256 // their target half.
8257 // FIXME: This operation could almost certainly be simplified dramatically to
8258 // look more like the 3-1 fixing operation.
8259 auto moveInputsToRightHalf = [&PSHUFDMask](
8260 MutableArrayRef<int> IncomingInputs, ArrayRef<int> ExistingInputs,
8261 MutableArrayRef<int> SourceHalfMask, MutableArrayRef<int> HalfMask,
8262 MutableArrayRef<int> FinalSourceHalfMask, int SourceOffset,
8264 auto isWordClobbered = [](ArrayRef<int> SourceHalfMask, int Word) {
8265 return SourceHalfMask[Word] != -1 && SourceHalfMask[Word] != Word;
8267 auto isDWordClobbered = [&isWordClobbered](ArrayRef<int> SourceHalfMask,
8269 int LowWord = Word & ~1;
8270 int HighWord = Word | 1;
8271 return isWordClobbered(SourceHalfMask, LowWord) ||
8272 isWordClobbered(SourceHalfMask, HighWord);
8275 if (IncomingInputs.empty())
8278 if (ExistingInputs.empty()) {
8279 // Map any dwords with inputs from them into the right half.
8280 for (int Input : IncomingInputs) {
8281 // If the source half mask maps over the inputs, turn those into
8282 // swaps and use the swapped lane.
8283 if (isWordClobbered(SourceHalfMask, Input - SourceOffset)) {
8284 if (SourceHalfMask[SourceHalfMask[Input - SourceOffset]] == -1) {
8285 SourceHalfMask[SourceHalfMask[Input - SourceOffset]] =
8286 Input - SourceOffset;
8287 // We have to swap the uses in our half mask in one sweep.
8288 for (int &M : HalfMask)
8289 if (M == SourceHalfMask[Input - SourceOffset] + SourceOffset)
8291 else if (M == Input)
8292 M = SourceHalfMask[Input - SourceOffset] + SourceOffset;
8294 assert(SourceHalfMask[SourceHalfMask[Input - SourceOffset]] ==
8295 Input - SourceOffset &&
8296 "Previous placement doesn't match!");
8298 // Note that this correctly re-maps both when we do a swap and when
8299 // we observe the other side of the swap above. We rely on that to
8300 // avoid swapping the members of the input list directly.
8301 Input = SourceHalfMask[Input - SourceOffset] + SourceOffset;
8304 // Map the input's dword into the correct half.
8305 if (PSHUFDMask[(Input - SourceOffset + DestOffset) / 2] == -1)
8306 PSHUFDMask[(Input - SourceOffset + DestOffset) / 2] = Input / 2;
8308 assert(PSHUFDMask[(Input - SourceOffset + DestOffset) / 2] ==
8310 "Previous placement doesn't match!");
8313 // And just directly shift any other-half mask elements to be same-half
8314 // as we will have mirrored the dword containing the element into the
8315 // same position within that half.
8316 for (int &M : HalfMask)
8317 if (M >= SourceOffset && M < SourceOffset + 4) {
8318 M = M - SourceOffset + DestOffset;
8319 assert(M >= 0 && "This should never wrap below zero!");
8324 // Ensure we have the input in a viable dword of its current half. This
8325 // is particularly tricky because the original position may be clobbered
8326 // by inputs being moved and *staying* in that half.
8327 if (IncomingInputs.size() == 1) {
8328 if (isWordClobbered(SourceHalfMask, IncomingInputs[0] - SourceOffset)) {
8329 int InputFixed = std::find(std::begin(SourceHalfMask),
8330 std::end(SourceHalfMask), -1) -
8331 std::begin(SourceHalfMask) + SourceOffset;
8332 SourceHalfMask[InputFixed - SourceOffset] =
8333 IncomingInputs[0] - SourceOffset;
8334 std::replace(HalfMask.begin(), HalfMask.end(), IncomingInputs[0],
8336 IncomingInputs[0] = InputFixed;
8338 } else if (IncomingInputs.size() == 2) {
8339 if (IncomingInputs[0] / 2 != IncomingInputs[1] / 2 ||
8340 isDWordClobbered(SourceHalfMask, IncomingInputs[0] - SourceOffset)) {
8341 // We have two non-adjacent or clobbered inputs we need to extract from
8342 // the source half. To do this, we need to map them into some adjacent
8343 // dword slot in the source mask.
8344 int InputsFixed[2] = {IncomingInputs[0] - SourceOffset,
8345 IncomingInputs[1] - SourceOffset};
8347 // If there is a free slot in the source half mask adjacent to one of
8348 // the inputs, place the other input in it. We use (Index XOR 1) to
8349 // compute an adjacent index.
8350 if (!isWordClobbered(SourceHalfMask, InputsFixed[0]) &&
8351 SourceHalfMask[InputsFixed[0] ^ 1] == -1) {
8352 SourceHalfMask[InputsFixed[0]] = InputsFixed[0];
8353 SourceHalfMask[InputsFixed[0] ^ 1] = InputsFixed[1];
8354 InputsFixed[1] = InputsFixed[0] ^ 1;
8355 } else if (!isWordClobbered(SourceHalfMask, InputsFixed[1]) &&
8356 SourceHalfMask[InputsFixed[1] ^ 1] == -1) {
8357 SourceHalfMask[InputsFixed[1]] = InputsFixed[1];
8358 SourceHalfMask[InputsFixed[1] ^ 1] = InputsFixed[0];
8359 InputsFixed[0] = InputsFixed[1] ^ 1;
8360 } else if (SourceHalfMask[2 * ((InputsFixed[0] / 2) ^ 1)] == -1 &&
8361 SourceHalfMask[2 * ((InputsFixed[0] / 2) ^ 1) + 1] == -1) {
8362 // The two inputs are in the same DWord but it is clobbered and the
8363 // adjacent DWord isn't used at all. Move both inputs to the free
8365 SourceHalfMask[2 * ((InputsFixed[0] / 2) ^ 1)] = InputsFixed[0];
8366 SourceHalfMask[2 * ((InputsFixed[0] / 2) ^ 1) + 1] = InputsFixed[1];
8367 InputsFixed[0] = 2 * ((InputsFixed[0] / 2) ^ 1);
8368 InputsFixed[1] = 2 * ((InputsFixed[0] / 2) ^ 1) + 1;
8370 // The only way we hit this point is if there is no clobbering
8371 // (because there are no off-half inputs to this half) and there is no
8372 // free slot adjacent to one of the inputs. In this case, we have to
8373 // swap an input with a non-input.
8374 for (int i = 0; i < 4; ++i)
8375 assert((SourceHalfMask[i] == -1 || SourceHalfMask[i] == i) &&
8376 "We can't handle any clobbers here!");
8377 assert(InputsFixed[1] != (InputsFixed[0] ^ 1) &&
8378 "Cannot have adjacent inputs here!");
8380 SourceHalfMask[InputsFixed[0] ^ 1] = InputsFixed[1];
8381 SourceHalfMask[InputsFixed[1]] = InputsFixed[0] ^ 1;
8383 // We also have to update the final source mask in this case because
8384 // it may need to undo the above swap.
8385 for (int &M : FinalSourceHalfMask)
8386 if (M == (InputsFixed[0] ^ 1) + SourceOffset)
8387 M = InputsFixed[1] + SourceOffset;
8388 else if (M == InputsFixed[1] + SourceOffset)
8389 M = (InputsFixed[0] ^ 1) + SourceOffset;
8391 InputsFixed[1] = InputsFixed[0] ^ 1;
8394 // Point everything at the fixed inputs.
8395 for (int &M : HalfMask)
8396 if (M == IncomingInputs[0])
8397 M = InputsFixed[0] + SourceOffset;
8398 else if (M == IncomingInputs[1])
8399 M = InputsFixed[1] + SourceOffset;
8401 IncomingInputs[0] = InputsFixed[0] + SourceOffset;
8402 IncomingInputs[1] = InputsFixed[1] + SourceOffset;
8405 llvm_unreachable("Unhandled input size!");
8408 // Now hoist the DWord down to the right half.
8409 int FreeDWord = (PSHUFDMask[DestOffset / 2] == -1 ? 0 : 1) + DestOffset / 2;
8410 assert(PSHUFDMask[FreeDWord] == -1 && "DWord not free");
8411 PSHUFDMask[FreeDWord] = IncomingInputs[0] / 2;
8412 for (int &M : HalfMask)
8413 for (int Input : IncomingInputs)
8415 M = FreeDWord * 2 + Input % 2;
8417 moveInputsToRightHalf(HToLInputs, LToLInputs, PSHUFHMask, LoMask, HiMask,
8418 /*SourceOffset*/ 4, /*DestOffset*/ 0);
8419 moveInputsToRightHalf(LToHInputs, HToHInputs, PSHUFLMask, HiMask, LoMask,
8420 /*SourceOffset*/ 0, /*DestOffset*/ 4);
8422 // Now enact all the shuffles we've computed to move the inputs into their
8424 if (!isNoopShuffleMask(PSHUFLMask))
8425 V = DAG.getNode(X86ISD::PSHUFLW, DL, MVT::v8i16, V,
8426 getV4X86ShuffleImm8ForMask(PSHUFLMask, DAG));
8427 if (!isNoopShuffleMask(PSHUFHMask))
8428 V = DAG.getNode(X86ISD::PSHUFHW, DL, MVT::v8i16, V,
8429 getV4X86ShuffleImm8ForMask(PSHUFHMask, DAG));
8430 if (!isNoopShuffleMask(PSHUFDMask))
8431 V = DAG.getNode(ISD::BITCAST, DL, MVT::v8i16,
8432 DAG.getNode(X86ISD::PSHUFD, DL, MVT::v4i32,
8433 DAG.getNode(ISD::BITCAST, DL, MVT::v4i32, V),
8434 getV4X86ShuffleImm8ForMask(PSHUFDMask, DAG)));
8436 // At this point, each half should contain all its inputs, and we can then
8437 // just shuffle them into their final position.
8438 assert(std::count_if(LoMask.begin(), LoMask.end(),
8439 [](int M) { return M >= 4; }) == 0 &&
8440 "Failed to lift all the high half inputs to the low mask!");
8441 assert(std::count_if(HiMask.begin(), HiMask.end(),
8442 [](int M) { return M >= 0 && M < 4; }) == 0 &&
8443 "Failed to lift all the low half inputs to the high mask!");
8445 // Do a half shuffle for the low mask.
8446 if (!isNoopShuffleMask(LoMask))
8447 V = DAG.getNode(X86ISD::PSHUFLW, DL, MVT::v8i16, V,
8448 getV4X86ShuffleImm8ForMask(LoMask, DAG));
8450 // Do a half shuffle with the high mask after shifting its values down.
8451 for (int &M : HiMask)
8454 if (!isNoopShuffleMask(HiMask))
8455 V = DAG.getNode(X86ISD::PSHUFHW, DL, MVT::v8i16, V,
8456 getV4X86ShuffleImm8ForMask(HiMask, DAG));
8461 /// \brief Detect whether the mask pattern should be lowered through
8464 /// This essentially tests whether viewing the mask as an interleaving of two
8465 /// sub-sequences reduces the cross-input traffic of a blend operation. If so,
8466 /// lowering it through interleaving is a significantly better strategy.
8467 static bool shouldLowerAsInterleaving(ArrayRef<int> Mask) {
8468 int NumEvenInputs[2] = {0, 0};
8469 int NumOddInputs[2] = {0, 0};
8470 int NumLoInputs[2] = {0, 0};
8471 int NumHiInputs[2] = {0, 0};
8472 for (int i = 0, Size = Mask.size(); i < Size; ++i) {
8476 int InputIdx = Mask[i] >= Size;
8479 ++NumLoInputs[InputIdx];
8481 ++NumHiInputs[InputIdx];
8484 ++NumEvenInputs[InputIdx];
8486 ++NumOddInputs[InputIdx];
8489 // The minimum number of cross-input results for both the interleaved and
8490 // split cases. If interleaving results in fewer cross-input results, return
8492 int InterleavedCrosses = std::min(NumEvenInputs[1] + NumOddInputs[0],
8493 NumEvenInputs[0] + NumOddInputs[1]);
8494 int SplitCrosses = std::min(NumLoInputs[1] + NumHiInputs[0],
8495 NumLoInputs[0] + NumHiInputs[1]);
8496 return InterleavedCrosses < SplitCrosses;
8499 /// \brief Blend two v8i16 vectors using a naive unpack strategy.
8501 /// This strategy only works when the inputs from each vector fit into a single
8502 /// half of that vector, and generally there are not so many inputs as to leave
8503 /// the in-place shuffles required highly constrained (and thus expensive). It
8504 /// shifts all the inputs into a single side of both input vectors and then
8505 /// uses an unpack to interleave these inputs in a single vector. At that
8506 /// point, we will fall back on the generic single input shuffle lowering.
8507 static SDValue lowerV8I16BasicBlendVectorShuffle(SDLoc DL, SDValue V1,
8509 MutableArrayRef<int> Mask,
8510 const X86Subtarget *Subtarget,
8511 SelectionDAG &DAG) {
8512 assert(V1.getSimpleValueType() == MVT::v8i16 && "Bad input type!");
8513 assert(V2.getSimpleValueType() == MVT::v8i16 && "Bad input type!");
8514 SmallVector<int, 3> LoV1Inputs, HiV1Inputs, LoV2Inputs, HiV2Inputs;
8515 for (int i = 0; i < 8; ++i)
8516 if (Mask[i] >= 0 && Mask[i] < 4)
8517 LoV1Inputs.push_back(i);
8518 else if (Mask[i] >= 4 && Mask[i] < 8)
8519 HiV1Inputs.push_back(i);
8520 else if (Mask[i] >= 8 && Mask[i] < 12)
8521 LoV2Inputs.push_back(i);
8522 else if (Mask[i] >= 12)
8523 HiV2Inputs.push_back(i);
8525 int NumV1Inputs = LoV1Inputs.size() + HiV1Inputs.size();
8526 int NumV2Inputs = LoV2Inputs.size() + HiV2Inputs.size();
8529 assert(NumV1Inputs > 0 && NumV1Inputs <= 3 && "At most 3 inputs supported");
8530 assert(NumV2Inputs > 0 && NumV2Inputs <= 3 && "At most 3 inputs supported");
8531 assert(NumV1Inputs + NumV2Inputs <= 4 && "At most 4 combined inputs");
8533 bool MergeFromLo = LoV1Inputs.size() + LoV2Inputs.size() >=
8534 HiV1Inputs.size() + HiV2Inputs.size();
8536 auto moveInputsToHalf = [&](SDValue V, ArrayRef<int> LoInputs,
8537 ArrayRef<int> HiInputs, bool MoveToLo,
8539 ArrayRef<int> GoodInputs = MoveToLo ? LoInputs : HiInputs;
8540 ArrayRef<int> BadInputs = MoveToLo ? HiInputs : LoInputs;
8541 if (BadInputs.empty())
8544 int MoveMask[] = {-1, -1, -1, -1, -1, -1, -1, -1};
8545 int MoveOffset = MoveToLo ? 0 : 4;
8547 if (GoodInputs.empty()) {
8548 for (int BadInput : BadInputs) {
8549 MoveMask[Mask[BadInput] % 4 + MoveOffset] = Mask[BadInput] - MaskOffset;
8550 Mask[BadInput] = Mask[BadInput] % 4 + MoveOffset + MaskOffset;
8553 if (GoodInputs.size() == 2) {
8554 // If the low inputs are spread across two dwords, pack them into
8556 MoveMask[MoveOffset] = Mask[GoodInputs[0]] - MaskOffset;
8557 MoveMask[MoveOffset + 1] = Mask[GoodInputs[1]] - MaskOffset;
8558 Mask[GoodInputs[0]] = MoveOffset + MaskOffset;
8559 Mask[GoodInputs[1]] = MoveOffset + 1 + MaskOffset;
8561 // Otherwise pin the good inputs.
8562 for (int GoodInput : GoodInputs)
8563 MoveMask[Mask[GoodInput] - MaskOffset] = Mask[GoodInput] - MaskOffset;
8566 if (BadInputs.size() == 2) {
8567 // If we have two bad inputs then there may be either one or two good
8568 // inputs fixed in place. Find a fixed input, and then find the *other*
8569 // two adjacent indices by using modular arithmetic.
8571 std::find_if(std::begin(MoveMask) + MoveOffset, std::end(MoveMask),
8572 [](int M) { return M >= 0; }) -
8573 std::begin(MoveMask);
8575 ((((GoodMaskIdx - MoveOffset) & ~1) + 2) % 4) + MoveOffset;
8576 assert(MoveMask[MoveMaskIdx] == -1 && "Expected empty slot");
8577 assert(MoveMask[MoveMaskIdx + 1] == -1 && "Expected empty slot");
8578 MoveMask[MoveMaskIdx] = Mask[BadInputs[0]] - MaskOffset;
8579 MoveMask[MoveMaskIdx + 1] = Mask[BadInputs[1]] - MaskOffset;
8580 Mask[BadInputs[0]] = MoveMaskIdx + MaskOffset;
8581 Mask[BadInputs[1]] = MoveMaskIdx + 1 + MaskOffset;
8583 assert(BadInputs.size() == 1 && "All sizes handled");
8584 int MoveMaskIdx = std::find(std::begin(MoveMask) + MoveOffset,
8585 std::end(MoveMask), -1) -
8586 std::begin(MoveMask);
8587 MoveMask[MoveMaskIdx] = Mask[BadInputs[0]] - MaskOffset;
8588 Mask[BadInputs[0]] = MoveMaskIdx + MaskOffset;
8592 return DAG.getVectorShuffle(MVT::v8i16, DL, V, DAG.getUNDEF(MVT::v8i16),
8595 V1 = moveInputsToHalf(V1, LoV1Inputs, HiV1Inputs, MergeFromLo,
8597 V2 = moveInputsToHalf(V2, LoV2Inputs, HiV2Inputs, MergeFromLo,
8600 // FIXME: Select an interleaving of the merge of V1 and V2 that minimizes
8601 // cross-half traffic in the final shuffle.
8603 // Munge the mask to be a single-input mask after the unpack merges the
8607 M = 2 * (M % 4) + (M / 8);
8609 return DAG.getVectorShuffle(
8610 MVT::v8i16, DL, DAG.getNode(MergeFromLo ? X86ISD::UNPCKL : X86ISD::UNPCKH,
8611 DL, MVT::v8i16, V1, V2),
8612 DAG.getUNDEF(MVT::v8i16), Mask);
8615 /// \brief Generic lowering of 8-lane i16 shuffles.
8617 /// This handles both single-input shuffles and combined shuffle/blends with
8618 /// two inputs. The single input shuffles are immediately delegated to
8619 /// a dedicated lowering routine.
8621 /// The blends are lowered in one of three fundamental ways. If there are few
8622 /// enough inputs, it delegates to a basic UNPCK-based strategy. If the shuffle
8623 /// of the input is significantly cheaper when lowered as an interleaving of
8624 /// the two inputs, try to interleave them. Otherwise, blend the low and high
8625 /// halves of the inputs separately (making them have relatively few inputs)
8626 /// and then concatenate them.
8627 static SDValue lowerV8I16VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
8628 const X86Subtarget *Subtarget,
8629 SelectionDAG &DAG) {
8631 assert(Op.getSimpleValueType() == MVT::v8i16 && "Bad shuffle type!");
8632 assert(V1.getSimpleValueType() == MVT::v8i16 && "Bad operand type!");
8633 assert(V2.getSimpleValueType() == MVT::v8i16 && "Bad operand type!");
8634 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
8635 ArrayRef<int> OrigMask = SVOp->getMask();
8636 int MaskStorage[8] = {OrigMask[0], OrigMask[1], OrigMask[2], OrigMask[3],
8637 OrigMask[4], OrigMask[5], OrigMask[6], OrigMask[7]};
8638 MutableArrayRef<int> Mask(MaskStorage);
8640 assert(Mask.size() == 8 && "Unexpected mask size for v8 shuffle!");
8642 // Whenever we can lower this as a zext, that instruction is strictly faster
8643 // than any alternative.
8644 if (SDValue ZExt = lowerVectorShuffleAsZeroOrAnyExtend(
8645 DL, MVT::v8i16, V1, V2, OrigMask, Subtarget, DAG))
8648 auto isV1 = [](int M) { return M >= 0 && M < 8; };
8649 auto isV2 = [](int M) { return M >= 8; };
8651 int NumV1Inputs = std::count_if(Mask.begin(), Mask.end(), isV1);
8652 int NumV2Inputs = std::count_if(Mask.begin(), Mask.end(), isV2);
8654 if (NumV2Inputs == 0)
8655 return lowerV8I16SingleInputVectorShuffle(DL, V1, Mask, Subtarget, DAG);
8657 assert(NumV1Inputs > 0 && "All single-input shuffles should be canonicalized "
8658 "to be V1-input shuffles.");
8660 // There are special ways we can lower some single-element blends.
8661 if (NumV2Inputs == 1)
8662 if (SDValue V = lowerVectorShuffleAsElementInsertion(MVT::v8i16, DL, V1, V2,
8663 Mask, Subtarget, DAG))
8666 if (Subtarget->hasSSE41())
8668 lowerVectorShuffleAsBlend(DL, MVT::v8i16, V1, V2, Mask, DAG))
8671 // Try to use rotation instructions if available.
8672 if (Subtarget->hasSSSE3())
8673 if (SDValue Rotate = lowerVectorShuffleAsByteRotate(DL, MVT::v8i16, V1, V2, Mask, DAG))
8676 if (NumV1Inputs + NumV2Inputs <= 4)
8677 return lowerV8I16BasicBlendVectorShuffle(DL, V1, V2, Mask, Subtarget, DAG);
8679 // Check whether an interleaving lowering is likely to be more efficient.
8680 // This isn't perfect but it is a strong heuristic that tends to work well on
8681 // the kinds of shuffles that show up in practice.
8683 // FIXME: Handle 1x, 2x, and 4x interleaving.
8684 if (shouldLowerAsInterleaving(Mask)) {
8685 // FIXME: Figure out whether we should pack these into the low or high
8688 int EMask[8], OMask[8];
8689 for (int i = 0; i < 4; ++i) {
8690 EMask[i] = Mask[2*i];
8691 OMask[i] = Mask[2*i + 1];
8696 SDValue Evens = DAG.getVectorShuffle(MVT::v8i16, DL, V1, V2, EMask);
8697 SDValue Odds = DAG.getVectorShuffle(MVT::v8i16, DL, V1, V2, OMask);
8699 return DAG.getNode(X86ISD::UNPCKL, DL, MVT::v8i16, Evens, Odds);
8702 int LoBlendMask[8] = {-1, -1, -1, -1, -1, -1, -1, -1};
8703 int HiBlendMask[8] = {-1, -1, -1, -1, -1, -1, -1, -1};
8705 for (int i = 0; i < 4; ++i) {
8706 LoBlendMask[i] = Mask[i];
8707 HiBlendMask[i] = Mask[i + 4];
8710 SDValue LoV = DAG.getVectorShuffle(MVT::v8i16, DL, V1, V2, LoBlendMask);
8711 SDValue HiV = DAG.getVectorShuffle(MVT::v8i16, DL, V1, V2, HiBlendMask);
8712 LoV = DAG.getNode(ISD::BITCAST, DL, MVT::v2i64, LoV);
8713 HiV = DAG.getNode(ISD::BITCAST, DL, MVT::v2i64, HiV);
8715 return DAG.getNode(ISD::BITCAST, DL, MVT::v8i16,
8716 DAG.getNode(X86ISD::UNPCKL, DL, MVT::v2i64, LoV, HiV));
8719 /// \brief Check whether a compaction lowering can be done by dropping even
8720 /// elements and compute how many times even elements must be dropped.
8722 /// This handles shuffles which take every Nth element where N is a power of
8723 /// two. Example shuffle masks:
8725 /// N = 1: 0, 2, 4, 6, 8, 10, 12, 14, 0, 2, 4, 6, 8, 10, 12, 14
8726 /// N = 1: 0, 2, 4, 6, 8, 10, 12, 14, 16, 18, 20, 22, 24, 26, 28, 30
8727 /// N = 2: 0, 4, 8, 12, 0, 4, 8, 12, 0, 4, 8, 12, 0, 4, 8, 12
8728 /// N = 2: 0, 4, 8, 12, 16, 20, 24, 28, 0, 4, 8, 12, 16, 20, 24, 28
8729 /// N = 3: 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8
8730 /// N = 3: 0, 8, 16, 24, 0, 8, 16, 24, 0, 8, 16, 24, 0, 8, 16, 24
8732 /// Any of these lanes can of course be undef.
8734 /// This routine only supports N <= 3.
8735 /// FIXME: Evaluate whether either AVX or AVX-512 have any opportunities here
8738 /// \returns N above, or the number of times even elements must be dropped if
8739 /// there is such a number. Otherwise returns zero.
8740 static int canLowerByDroppingEvenElements(ArrayRef<int> Mask) {
8741 // Figure out whether we're looping over two inputs or just one.
8742 bool IsSingleInput = isSingleInputShuffleMask(Mask);
8744 // The modulus for the shuffle vector entries is based on whether this is
8745 // a single input or not.
8746 int ShuffleModulus = Mask.size() * (IsSingleInput ? 1 : 2);
8747 assert(isPowerOf2_32((uint32_t)ShuffleModulus) &&
8748 "We should only be called with masks with a power-of-2 size!");
8750 uint64_t ModMask = (uint64_t)ShuffleModulus - 1;
8752 // We track whether the input is viable for all power-of-2 strides 2^1, 2^2,
8753 // and 2^3 simultaneously. This is because we may have ambiguity with
8754 // partially undef inputs.
8755 bool ViableForN[3] = {true, true, true};
8757 for (int i = 0, e = Mask.size(); i < e; ++i) {
8758 // Ignore undef lanes, we'll optimistically collapse them to the pattern we
8763 bool IsAnyViable = false;
8764 for (unsigned j = 0; j != array_lengthof(ViableForN); ++j)
8765 if (ViableForN[j]) {
8768 // The shuffle mask must be equal to (i * 2^N) % M.
8769 if ((uint64_t)Mask[i] == (((uint64_t)i << N) & ModMask))
8772 ViableForN[j] = false;
8774 // Early exit if we exhaust the possible powers of two.
8779 for (unsigned j = 0; j != array_lengthof(ViableForN); ++j)
8783 // Return 0 as there is no viable power of two.
8787 /// \brief Generic lowering of v16i8 shuffles.
8789 /// This is a hybrid strategy to lower v16i8 vectors. It first attempts to
8790 /// detect any complexity reducing interleaving. If that doesn't help, it uses
8791 /// UNPCK to spread the i8 elements across two i16-element vectors, and uses
8792 /// the existing lowering for v8i16 blends on each half, finally PACK-ing them
8794 static SDValue lowerV16I8VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
8795 const X86Subtarget *Subtarget,
8796 SelectionDAG &DAG) {
8798 assert(Op.getSimpleValueType() == MVT::v16i8 && "Bad shuffle type!");
8799 assert(V1.getSimpleValueType() == MVT::v16i8 && "Bad operand type!");
8800 assert(V2.getSimpleValueType() == MVT::v16i8 && "Bad operand type!");
8801 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
8802 ArrayRef<int> OrigMask = SVOp->getMask();
8803 assert(OrigMask.size() == 16 && "Unexpected mask size for v16 shuffle!");
8805 // Try to use rotation instructions if available.
8806 if (Subtarget->hasSSSE3())
8807 if (SDValue Rotate = lowerVectorShuffleAsByteRotate(DL, MVT::v16i8, V1, V2,
8811 // Try to use a zext lowering.
8812 if (SDValue ZExt = lowerVectorShuffleAsZeroOrAnyExtend(
8813 DL, MVT::v16i8, V1, V2, OrigMask, Subtarget, DAG))
8816 int MaskStorage[16] = {
8817 OrigMask[0], OrigMask[1], OrigMask[2], OrigMask[3],
8818 OrigMask[4], OrigMask[5], OrigMask[6], OrigMask[7],
8819 OrigMask[8], OrigMask[9], OrigMask[10], OrigMask[11],
8820 OrigMask[12], OrigMask[13], OrigMask[14], OrigMask[15]};
8821 MutableArrayRef<int> Mask(MaskStorage);
8822 MutableArrayRef<int> LoMask = Mask.slice(0, 8);
8823 MutableArrayRef<int> HiMask = Mask.slice(8, 8);
8826 std::count_if(Mask.begin(), Mask.end(), [](int M) { return M >= 16; });
8828 // For single-input shuffles, there are some nicer lowering tricks we can use.
8829 if (NumV2Elements == 0) {
8830 // Check whether we can widen this to an i16 shuffle by duplicating bytes.
8831 // Notably, this handles splat and partial-splat shuffles more efficiently.
8832 // However, it only makes sense if the pre-duplication shuffle simplifies
8833 // things significantly. Currently, this means we need to be able to
8834 // express the pre-duplication shuffle as an i16 shuffle.
8836 // FIXME: We should check for other patterns which can be widened into an
8837 // i16 shuffle as well.
8838 auto canWidenViaDuplication = [](ArrayRef<int> Mask) {
8839 for (int i = 0; i < 16; i += 2)
8840 if (Mask[i] != -1 && Mask[i + 1] != -1 && Mask[i] != Mask[i + 1])
8845 auto tryToWidenViaDuplication = [&]() -> SDValue {
8846 if (!canWidenViaDuplication(Mask))
8848 SmallVector<int, 4> LoInputs;
8849 std::copy_if(Mask.begin(), Mask.end(), std::back_inserter(LoInputs),
8850 [](int M) { return M >= 0 && M < 8; });
8851 std::sort(LoInputs.begin(), LoInputs.end());
8852 LoInputs.erase(std::unique(LoInputs.begin(), LoInputs.end()),
8854 SmallVector<int, 4> HiInputs;
8855 std::copy_if(Mask.begin(), Mask.end(), std::back_inserter(HiInputs),
8856 [](int M) { return M >= 8; });
8857 std::sort(HiInputs.begin(), HiInputs.end());
8858 HiInputs.erase(std::unique(HiInputs.begin(), HiInputs.end()),
8861 bool TargetLo = LoInputs.size() >= HiInputs.size();
8862 ArrayRef<int> InPlaceInputs = TargetLo ? LoInputs : HiInputs;
8863 ArrayRef<int> MovingInputs = TargetLo ? HiInputs : LoInputs;
8865 int PreDupI16Shuffle[] = {-1, -1, -1, -1, -1, -1, -1, -1};
8866 SmallDenseMap<int, int, 8> LaneMap;
8867 for (int I : InPlaceInputs) {
8868 PreDupI16Shuffle[I/2] = I/2;
8871 int j = TargetLo ? 0 : 4, je = j + 4;
8872 for (int i = 0, ie = MovingInputs.size(); i < ie; ++i) {
8873 // Check if j is already a shuffle of this input. This happens when
8874 // there are two adjacent bytes after we move the low one.
8875 if (PreDupI16Shuffle[j] != MovingInputs[i] / 2) {
8876 // If we haven't yet mapped the input, search for a slot into which
8878 while (j < je && PreDupI16Shuffle[j] != -1)
8882 // We can't place the inputs into a single half with a simple i16 shuffle, so bail.
8885 // Map this input with the i16 shuffle.
8886 PreDupI16Shuffle[j] = MovingInputs[i] / 2;
8889 // Update the lane map based on the mapping we ended up with.
8890 LaneMap[MovingInputs[i]] = 2 * j + MovingInputs[i] % 2;
8893 ISD::BITCAST, DL, MVT::v16i8,
8894 DAG.getVectorShuffle(MVT::v8i16, DL,
8895 DAG.getNode(ISD::BITCAST, DL, MVT::v8i16, V1),
8896 DAG.getUNDEF(MVT::v8i16), PreDupI16Shuffle));
8898 // Unpack the bytes to form the i16s that will be shuffled into place.
8899 V1 = DAG.getNode(TargetLo ? X86ISD::UNPCKL : X86ISD::UNPCKH, DL,
8900 MVT::v16i8, V1, V1);
8902 int PostDupI16Shuffle[8] = {-1, -1, -1, -1, -1, -1, -1, -1};
8903 for (int i = 0; i < 16; i += 2) {
8905 PostDupI16Shuffle[i / 2] = LaneMap[Mask[i]] - (TargetLo ? 0 : 8);
8906 assert(PostDupI16Shuffle[i / 2] < 8 && "Invalid v8 shuffle mask!");
8909 ISD::BITCAST, DL, MVT::v16i8,
8910 DAG.getVectorShuffle(MVT::v8i16, DL,
8911 DAG.getNode(ISD::BITCAST, DL, MVT::v8i16, V1),
8912 DAG.getUNDEF(MVT::v8i16), PostDupI16Shuffle));
8914 if (SDValue V = tryToWidenViaDuplication())
8918 // Check whether an interleaving lowering is likely to be more efficient.
8919 // This isn't perfect but it is a strong heuristic that tends to work well on
8920 // the kinds of shuffles that show up in practice.
8922 // FIXME: We need to handle other interleaving widths (i16, i32, ...).
8923 if (shouldLowerAsInterleaving(Mask)) {
8924 // FIXME: Figure out whether we should pack these into the low or high
8927 int EMask[16], OMask[16];
8928 for (int i = 0; i < 8; ++i) {
8929 EMask[i] = Mask[2*i];
8930 OMask[i] = Mask[2*i + 1];
8935 SDValue Evens = DAG.getVectorShuffle(MVT::v16i8, DL, V1, V2, EMask);
8936 SDValue Odds = DAG.getVectorShuffle(MVT::v16i8, DL, V1, V2, OMask);
8938 return DAG.getNode(X86ISD::UNPCKL, DL, MVT::v16i8, Evens, Odds);
8941 // Check for SSSE3 which lets us lower all v16i8 shuffles much more directly
8942 // with PSHUFB. It is important to do this before we attempt to generate any
8943 // blends but after all of the single-input lowerings. If the single input
8944 // lowerings can find an instruction sequence that is faster than a PSHUFB, we
8945 // want to preserve that and we can DAG combine any longer sequences into
8946 // a PSHUFB in the end. But once we start blending from multiple inputs,
8947 // the complexity of DAG combining bad patterns back into PSHUFB is too high,
8948 // and there are *very* few patterns that would actually be faster than the
8949 // PSHUFB approach because of its ability to zero lanes.
8951 // FIXME: The only exceptions to the above are blends which are exact
8952 // interleavings with direct instructions supporting them. We currently don't
8953 // handle those well here.
8954 if (Subtarget->hasSSSE3()) {
8957 for (int i = 0; i < 16; ++i)
8958 if (Mask[i] == -1) {
8959 V1Mask[i] = V2Mask[i] = DAG.getConstant(0x80, MVT::i8);
8961 V1Mask[i] = DAG.getConstant(Mask[i] < 16 ? Mask[i] : 0x80, MVT::i8);
8963 DAG.getConstant(Mask[i] < 16 ? 0x80 : Mask[i] - 16, MVT::i8);
8965 V1 = DAG.getNode(X86ISD::PSHUFB, DL, MVT::v16i8, V1,
8966 DAG.getNode(ISD::BUILD_VECTOR, DL, MVT::v16i8, V1Mask));
8967 if (isSingleInputShuffleMask(Mask))
8968 return V1; // Single inputs are easy.
8970 // Otherwise, blend the two.
8971 V2 = DAG.getNode(X86ISD::PSHUFB, DL, MVT::v16i8, V2,
8972 DAG.getNode(ISD::BUILD_VECTOR, DL, MVT::v16i8, V2Mask));
8973 return DAG.getNode(ISD::OR, DL, MVT::v16i8, V1, V2);
8976 // There are special ways we can lower some single-element blends.
8977 if (NumV2Elements == 1)
8978 if (SDValue V = lowerVectorShuffleAsElementInsertion(MVT::v16i8, DL, V1, V2,
8979 Mask, Subtarget, DAG))
8982 // Check whether a compaction lowering can be done. This handles shuffles
8983 // which take every Nth element for some even N. See the helper function for
8986 // We special case these as they can be particularly efficiently handled with
8987 // the PACKUSB instruction on x86 and they show up in common patterns of
8988 // rearranging bytes to truncate wide elements.
8989 if (int NumEvenDrops = canLowerByDroppingEvenElements(Mask)) {
8990 // NumEvenDrops is the power of two stride of the elements. Another way of
8991 // thinking about it is that we need to drop the even elements this many
8992 // times to get the original input.
8993 bool IsSingleInput = isSingleInputShuffleMask(Mask);
8995 // First we need to zero all the dropped bytes.
8996 assert(NumEvenDrops <= 3 &&
8997 "No support for dropping even elements more than 3 times.");
8998 // We use the mask type to pick which bytes are preserved based on how many
8999 // elements are dropped.
9000 MVT MaskVTs[] = { MVT::v8i16, MVT::v4i32, MVT::v2i64 };
9001 SDValue ByteClearMask =
9002 DAG.getNode(ISD::BITCAST, DL, MVT::v16i8,
9003 DAG.getConstant(0xFF, MaskVTs[NumEvenDrops - 1]));
9004 V1 = DAG.getNode(ISD::AND, DL, MVT::v16i8, V1, ByteClearMask);
9006 V2 = DAG.getNode(ISD::AND, DL, MVT::v16i8, V2, ByteClearMask);
9008 // Now pack things back together.
9009 V1 = DAG.getNode(ISD::BITCAST, DL, MVT::v8i16, V1);
9010 V2 = IsSingleInput ? V1 : DAG.getNode(ISD::BITCAST, DL, MVT::v8i16, V2);
9011 SDValue Result = DAG.getNode(X86ISD::PACKUS, DL, MVT::v16i8, V1, V2);
9012 for (int i = 1; i < NumEvenDrops; ++i) {
9013 Result = DAG.getNode(ISD::BITCAST, DL, MVT::v8i16, Result);
9014 Result = DAG.getNode(X86ISD::PACKUS, DL, MVT::v16i8, Result, Result);
9020 int V1LoBlendMask[8] = {-1, -1, -1, -1, -1, -1, -1, -1};
9021 int V1HiBlendMask[8] = {-1, -1, -1, -1, -1, -1, -1, -1};
9022 int V2LoBlendMask[8] = {-1, -1, -1, -1, -1, -1, -1, -1};
9023 int V2HiBlendMask[8] = {-1, -1, -1, -1, -1, -1, -1, -1};
9025 auto buildBlendMasks = [](MutableArrayRef<int> HalfMask,
9026 MutableArrayRef<int> V1HalfBlendMask,
9027 MutableArrayRef<int> V2HalfBlendMask) {
9028 for (int i = 0; i < 8; ++i)
9029 if (HalfMask[i] >= 0 && HalfMask[i] < 16) {
9030 V1HalfBlendMask[i] = HalfMask[i];
9032 } else if (HalfMask[i] >= 16) {
9033 V2HalfBlendMask[i] = HalfMask[i] - 16;
9034 HalfMask[i] = i + 8;
9037 buildBlendMasks(LoMask, V1LoBlendMask, V2LoBlendMask);
9038 buildBlendMasks(HiMask, V1HiBlendMask, V2HiBlendMask);
9040 SDValue Zero = getZeroVector(MVT::v8i16, Subtarget, DAG, DL);
9042 auto buildLoAndHiV8s = [&](SDValue V, MutableArrayRef<int> LoBlendMask,
9043 MutableArrayRef<int> HiBlendMask) {
9045 // Check if any of the odd lanes in the v16i8 are used. If not, we can mask
9046 // them out and avoid using UNPCK{L,H} to extract the elements of V as
9048 if (std::none_of(LoBlendMask.begin(), LoBlendMask.end(),
9049 [](int M) { return M >= 0 && M % 2 == 1; }) &&
9050 std::none_of(HiBlendMask.begin(), HiBlendMask.end(),
9051 [](int M) { return M >= 0 && M % 2 == 1; })) {
9052 // Use a mask to drop the high bytes.
9053 V1 = DAG.getNode(ISD::BITCAST, DL, MVT::v8i16, V);
9054 V1 = DAG.getNode(ISD::AND, DL, MVT::v8i16, V1,
9055 DAG.getConstant(0x00FF, MVT::v8i16));
9057 // This will be a single vector shuffle instead of a blend so nuke V2.
9058 V2 = DAG.getUNDEF(MVT::v8i16);
9060 // Squash the masks to point directly into V1.
9061 for (int &M : LoBlendMask)
9064 for (int &M : HiBlendMask)
9068 // Otherwise just unpack the low half of V into V1 and the high half into
9069 // V2 so that we can blend them as i16s.
9070 V1 = DAG.getNode(ISD::BITCAST, DL, MVT::v8i16,
9071 DAG.getNode(X86ISD::UNPCKL, DL, MVT::v16i8, V, Zero));
9072 V2 = DAG.getNode(ISD::BITCAST, DL, MVT::v8i16,
9073 DAG.getNode(X86ISD::UNPCKH, DL, MVT::v16i8, V, Zero));
9076 SDValue BlendedLo = DAG.getVectorShuffle(MVT::v8i16, DL, V1, V2, LoBlendMask);
9077 SDValue BlendedHi = DAG.getVectorShuffle(MVT::v8i16, DL, V1, V2, HiBlendMask);
9078 return std::make_pair(BlendedLo, BlendedHi);
9080 SDValue V1Lo, V1Hi, V2Lo, V2Hi;
9081 std::tie(V1Lo, V1Hi) = buildLoAndHiV8s(V1, V1LoBlendMask, V1HiBlendMask);
9082 std::tie(V2Lo, V2Hi) = buildLoAndHiV8s(V2, V2LoBlendMask, V2HiBlendMask);
9084 SDValue LoV = DAG.getVectorShuffle(MVT::v8i16, DL, V1Lo, V2Lo, LoMask);
9085 SDValue HiV = DAG.getVectorShuffle(MVT::v8i16, DL, V1Hi, V2Hi, HiMask);
9087 return DAG.getNode(X86ISD::PACKUS, DL, MVT::v16i8, LoV, HiV);
9090 /// \brief Dispatching routine to lower various 128-bit x86 vector shuffles.
9092 /// This routine breaks down the specific type of 128-bit shuffle and
9093 /// dispatches to the lowering routines accordingly.
9094 static SDValue lower128BitVectorShuffle(SDValue Op, SDValue V1, SDValue V2,
9095 MVT VT, const X86Subtarget *Subtarget,
9096 SelectionDAG &DAG) {
9097 switch (VT.SimpleTy) {
9099 return lowerV2I64VectorShuffle(Op, V1, V2, Subtarget, DAG);
9101 return lowerV2F64VectorShuffle(Op, V1, V2, Subtarget, DAG);
9103 return lowerV4I32VectorShuffle(Op, V1, V2, Subtarget, DAG);
9105 return lowerV4F32VectorShuffle(Op, V1, V2, Subtarget, DAG);
9107 return lowerV8I16VectorShuffle(Op, V1, V2, Subtarget, DAG);
9109 return lowerV16I8VectorShuffle(Op, V1, V2, Subtarget, DAG);
9112 llvm_unreachable("Unimplemented!");
9116 /// \brief Test whether there are elements crossing 128-bit lanes in this
9119 /// X86 divides up its shuffles into in-lane and cross-lane shuffle operations
9120 /// and we routinely test for these.
9121 static bool is128BitLaneCrossingShuffleMask(MVT VT, ArrayRef<int> Mask) {
9122 int LaneSize = 128 / VT.getScalarSizeInBits();
9123 int Size = Mask.size();
9124 for (int i = 0; i < Size; ++i)
9125 if (Mask[i] >= 0 && (Mask[i] % Size) / LaneSize != i / LaneSize)
9130 /// \brief Generic routine to split a 256-bit vector shuffle into 128-bit
9133 /// There is a severely limited set of shuffles available in AVX1 for 256-bit
9134 /// vectors resulting in routinely needing to split the shuffle into two 128-bit
9135 /// shuffles. This can be done generically for any 256-bit vector shuffle and so
9136 /// we encode the logic here for specific shuffle lowering routines to bail to
9137 /// when they exhaust the features avaible to more directly handle the shuffle.
9138 static SDValue splitAndLower256BitVectorShuffle(SDValue Op, SDValue V1,
9140 const X86Subtarget *Subtarget,
9141 SelectionDAG &DAG) {
9143 MVT VT = Op.getSimpleValueType();
9144 assert(VT.getSizeInBits() == 256 && "Only for 256-bit vector shuffles!");
9145 assert(V1.getSimpleValueType() == VT && "Bad operand type!");
9146 assert(V2.getSimpleValueType() == VT && "Bad operand type!");
9147 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
9148 ArrayRef<int> Mask = SVOp->getMask();
9150 ArrayRef<int> LoMask = Mask.slice(0, Mask.size()/2);
9151 ArrayRef<int> HiMask = Mask.slice(Mask.size()/2);
9153 int NumElements = VT.getVectorNumElements();
9154 int SplitNumElements = NumElements / 2;
9155 MVT ScalarVT = VT.getScalarType();
9156 MVT SplitVT = MVT::getVectorVT(ScalarVT, NumElements / 2);
9158 SDValue LoV1 = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, SplitVT, V1,
9159 DAG.getIntPtrConstant(0));
9160 SDValue HiV1 = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, SplitVT, V1,
9161 DAG.getIntPtrConstant(SplitNumElements));
9162 SDValue LoV2 = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, SplitVT, V2,
9163 DAG.getIntPtrConstant(0));
9164 SDValue HiV2 = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, SplitVT, V2,
9165 DAG.getIntPtrConstant(SplitNumElements));
9167 // Now create two 4-way blends of these half-width vectors.
9168 auto HalfBlend = [&](ArrayRef<int> HalfMask) {
9169 SmallVector<int, 16> V1BlendMask, V2BlendMask, BlendMask;
9170 for (int i = 0; i < SplitNumElements; ++i) {
9171 int M = HalfMask[i];
9172 if (M >= NumElements) {
9173 V2BlendMask.push_back(M - NumElements);
9174 V1BlendMask.push_back(-1);
9175 BlendMask.push_back(SplitNumElements + i);
9176 } else if (M >= 0) {
9177 V2BlendMask.push_back(-1);
9178 V1BlendMask.push_back(M);
9179 BlendMask.push_back(i);
9181 V2BlendMask.push_back(-1);
9182 V1BlendMask.push_back(-1);
9183 BlendMask.push_back(-1);
9186 SDValue V1Blend = DAG.getVectorShuffle(SplitVT, DL, LoV1, HiV1, V1BlendMask);
9187 SDValue V2Blend = DAG.getVectorShuffle(SplitVT, DL, LoV2, HiV2, V2BlendMask);
9188 return DAG.getVectorShuffle(SplitVT, DL, V1Blend, V2Blend, BlendMask);
9190 SDValue Lo = HalfBlend(LoMask);
9191 SDValue Hi = HalfBlend(HiMask);
9192 return DAG.getNode(ISD::CONCAT_VECTORS, DL, VT, Lo, Hi);
9195 /// \brief Handle lowering of 4-lane 64-bit floating point shuffles.
9197 /// Also ends up handling lowering of 4-lane 64-bit integer shuffles when AVX2
9198 /// isn't available.
9199 static SDValue lowerV4F64VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
9200 const X86Subtarget *Subtarget,
9201 SelectionDAG &DAG) {
9203 assert(V1.getSimpleValueType() == MVT::v4f64 && "Bad operand type!");
9204 assert(V2.getSimpleValueType() == MVT::v4f64 && "Bad operand type!");
9205 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
9206 ArrayRef<int> Mask = SVOp->getMask();
9207 assert(Mask.size() == 4 && "Unexpected mask size for v4 shuffle!");
9209 if (is128BitLaneCrossingShuffleMask(MVT::v4f64, Mask))
9210 return splitAndLower256BitVectorShuffle(Op, V1, V2, Subtarget, DAG);
9212 if (isSingleInputShuffleMask(Mask)) {
9213 // Non-half-crossing single input shuffles can be lowerid with an
9214 // interleaved permutation.
9215 unsigned VPERMILPMask = (Mask[0] == 1) | ((Mask[1] == 1) << 1) |
9216 ((Mask[2] == 3) << 2) | ((Mask[3] == 3) << 3);
9217 return DAG.getNode(X86ISD::VPERMILP, DL, MVT::v4f64, V1,
9218 DAG.getConstant(VPERMILPMask, MVT::i8));
9221 // X86 has dedicated unpack instructions that can handle specific blend
9222 // operations: UNPCKH and UNPCKL.
9223 if (isShuffleEquivalent(Mask, 0, 4, 2, 6))
9224 return DAG.getNode(X86ISD::UNPCKL, DL, MVT::v4f64, V1, V2);
9225 if (isShuffleEquivalent(Mask, 1, 5, 3, 7))
9226 return DAG.getNode(X86ISD::UNPCKH, DL, MVT::v4f64, V1, V2);
9227 if (isShuffleEquivalent(Mask, 4, 0, 6, 2))
9228 return DAG.getNode(X86ISD::UNPCKL, DL, MVT::v4f64, V2, V1);
9229 if (isShuffleEquivalent(Mask, 5, 1, 7, 3))
9230 return DAG.getNode(X86ISD::UNPCKH, DL, MVT::v4f64, V2, V1);
9232 // Check if the blend happens to exactly fit that of SHUFPD.
9233 if (Mask[0] < 4 && (Mask[1] == -1 || Mask[1] >= 4) &&
9234 Mask[2] < 4 && (Mask[3] == -1 || Mask[3] >= 4)) {
9235 unsigned SHUFPDMask = (Mask[0] == 1) | ((Mask[1] == 5) << 1) |
9236 ((Mask[2] == 3) << 2) | ((Mask[3] == 7) << 3);
9237 return DAG.getNode(X86ISD::SHUFP, DL, MVT::v4f64, V1, V2,
9238 DAG.getConstant(SHUFPDMask, MVT::i8));
9240 if ((Mask[0] == -1 || Mask[0] >= 4) && Mask[1] < 4 &&
9241 (Mask[2] == -1 || Mask[2] >= 4) && Mask[3] < 4) {
9242 unsigned SHUFPDMask = (Mask[0] == 5) | ((Mask[1] == 1) << 1) |
9243 ((Mask[2] == 7) << 2) | ((Mask[3] == 3) << 3);
9244 return DAG.getNode(X86ISD::SHUFP, DL, MVT::v4f64, V2, V1,
9245 DAG.getConstant(SHUFPDMask, MVT::i8));
9248 // Shuffle the input elements into the desired positions in V1 and V2 and
9249 // blend them together.
9250 int V1Mask[] = {-1, -1, -1, -1};
9251 int V2Mask[] = {-1, -1, -1, -1};
9252 for (int i = 0; i < 4; ++i)
9253 if (Mask[i] >= 0 && Mask[i] < 4)
9254 V1Mask[i] = Mask[i];
9255 else if (Mask[i] >= 4)
9256 V2Mask[i] = Mask[i] - 4;
9258 V1 = DAG.getVectorShuffle(MVT::v4f64, DL, V1, DAG.getUNDEF(MVT::v4f64), V1Mask);
9259 V2 = DAG.getVectorShuffle(MVT::v4f64, DL, V2, DAG.getUNDEF(MVT::v4f64), V2Mask);
9261 unsigned BlendMask = 0;
9262 for (int i = 0; i < 4; ++i)
9264 BlendMask |= 1 << i;
9266 return DAG.getNode(X86ISD::BLENDI, DL, MVT::v4f64, V1, V2,
9267 DAG.getConstant(BlendMask, MVT::i8));
9270 /// \brief Handle lowering of 4-lane 64-bit integer shuffles.
9272 /// Largely delegates to common code when we have AVX2 and to the floating-point
9273 /// code when we only have AVX.
9274 static SDValue lowerV4I64VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
9275 const X86Subtarget *Subtarget,
9276 SelectionDAG &DAG) {
9278 assert(Op.getSimpleValueType() == MVT::v4i64 && "Bad shuffle type!");
9279 assert(V1.getSimpleValueType() == MVT::v4i64 && "Bad operand type!");
9280 assert(V2.getSimpleValueType() == MVT::v4i64 && "Bad operand type!");
9281 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
9282 ArrayRef<int> Mask = SVOp->getMask();
9283 assert(Mask.size() == 4 && "Unexpected mask size for v4 shuffle!");
9285 // FIXME: If we have AVX2, we should delegate to generic code as crossing
9286 // shuffles aren't a problem and FP and int have the same patterns.
9288 if (is128BitLaneCrossingShuffleMask(MVT::v4i64, Mask))
9289 return splitAndLower256BitVectorShuffle(Op, V1, V2, Subtarget, DAG);
9291 // AVX1 doesn't provide any facilities for v4i64 shuffles, bitcast and
9292 // delegate to floating point code.
9293 V1 = DAG.getNode(ISD::BITCAST, DL, MVT::v4f64, V1);
9294 V2 = DAG.getNode(ISD::BITCAST, DL, MVT::v4f64, V2);
9295 return DAG.getNode(ISD::BITCAST, DL, MVT::v4i64,
9296 lowerV4F64VectorShuffle(Op, V1, V2, Subtarget, DAG));
9299 /// \brief Handle lowering of 8-lane 32-bit floating point shuffles.
9301 /// Also ends up handling lowering of 8-lane 32-bit integer shuffles when AVX2
9302 /// isn't available.
9303 static SDValue lowerV8F32VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
9304 const X86Subtarget *Subtarget,
9305 SelectionDAG &DAG) {
9307 assert(V1.getSimpleValueType() == MVT::v8f32 && "Bad operand type!");
9308 assert(V2.getSimpleValueType() == MVT::v8f32 && "Bad operand type!");
9309 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
9310 ArrayRef<int> Mask = SVOp->getMask();
9311 assert(Mask.size() == 8 && "Unexpected mask size for v8 shuffle!");
9313 if (is128BitLaneCrossingShuffleMask(MVT::v8f32, Mask) ||
9314 isSingleInputShuffleMask(Mask))
9315 return splitAndLower256BitVectorShuffle(Op, V1, V2, Subtarget, DAG);
9317 // Shuffle the input elements into the desired positions in V1 and V2 and
9318 // blend them together.
9319 int V1Mask[] = {-1, -1, -1, -1, -1, -1, -1, -1};
9320 int V2Mask[] = {-1, -1, -1, -1, -1, -1, -1, -1};
9321 unsigned BlendMask = 0;
9322 for (int i = 0; i < 8; ++i)
9323 if (Mask[i] >= 0 && Mask[i] < 8) {
9324 V1Mask[i] = Mask[i];
9325 } else if (Mask[i] >= 8) {
9326 V2Mask[i] = Mask[i] - 8;
9327 BlendMask |= 1 << i;
9330 V1 = DAG.getVectorShuffle(MVT::v8f32, DL, V1, DAG.getUNDEF(MVT::v8f32), V1Mask);
9331 V2 = DAG.getVectorShuffle(MVT::v8f32, DL, V2, DAG.getUNDEF(MVT::v8f32), V2Mask);
9333 return DAG.getNode(X86ISD::BLENDI, DL, MVT::v8f32, V1, V2,
9334 DAG.getConstant(BlendMask, MVT::i8));
9337 /// \brief High-level routine to lower various 256-bit x86 vector shuffles.
9339 /// This routine either breaks down the specific type of a 256-bit x86 vector
9340 /// shuffle or splits it into two 128-bit shuffles and fuses the results back
9341 /// together based on the available instructions.
9342 static SDValue lower256BitVectorShuffle(SDValue Op, SDValue V1, SDValue V2,
9343 MVT VT, const X86Subtarget *Subtarget,
9344 SelectionDAG &DAG) {
9345 switch (VT.SimpleTy) {
9347 return lowerV4F64VectorShuffle(Op, V1, V2, Subtarget, DAG);
9349 return lowerV4I64VectorShuffle(Op, V1, V2, Subtarget, DAG);
9351 return lowerV8F32VectorShuffle(Op, V1, V2, Subtarget, DAG);
9355 // Fall back to the basic pattern of extracting the high half and forming
9357 // FIXME: Add targeted lowering for each type that can document rationale
9358 // for delegating to this when necessary.
9359 return splitAndLower256BitVectorShuffle(Op, V1, V2, Subtarget, DAG);
9362 llvm_unreachable("Not a valid 256-bit x86 vector type!");
9366 /// \brief Tiny helper function to test whether a shuffle mask could be
9367 /// simplified by widening the elements being shuffled.
9368 static bool canWidenShuffleElements(ArrayRef<int> Mask) {
9369 for (int i = 0, Size = Mask.size(); i < Size; i += 2)
9370 if ((Mask[i] != -1 && Mask[i] % 2 != 0) ||
9371 (Mask[i + 1] != -1 && (Mask[i + 1] % 2 != 1 ||
9372 (Mask[i] != -1 && Mask[i] + 1 != Mask[i + 1]))))
9378 /// \brief Top-level lowering for x86 vector shuffles.
9380 /// This handles decomposition, canonicalization, and lowering of all x86
9381 /// vector shuffles. Most of the specific lowering strategies are encapsulated
9382 /// above in helper routines. The canonicalization attempts to widen shuffles
9383 /// to involve fewer lanes of wider elements, consolidate symmetric patterns
9384 /// s.t. only one of the two inputs needs to be tested, etc.
9385 static SDValue lowerVectorShuffle(SDValue Op, const X86Subtarget *Subtarget,
9386 SelectionDAG &DAG) {
9387 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
9388 ArrayRef<int> Mask = SVOp->getMask();
9389 SDValue V1 = Op.getOperand(0);
9390 SDValue V2 = Op.getOperand(1);
9391 MVT VT = Op.getSimpleValueType();
9392 int NumElements = VT.getVectorNumElements();
9395 assert(VT.getSizeInBits() != 64 && "Can't lower MMX shuffles");
9397 bool V1IsUndef = V1.getOpcode() == ISD::UNDEF;
9398 bool V2IsUndef = V2.getOpcode() == ISD::UNDEF;
9399 if (V1IsUndef && V2IsUndef)
9400 return DAG.getUNDEF(VT);
9402 // When we create a shuffle node we put the UNDEF node to second operand,
9403 // but in some cases the first operand may be transformed to UNDEF.
9404 // In this case we should just commute the node.
9406 return DAG.getCommutedVectorShuffle(*SVOp);
9408 // Check for non-undef masks pointing at an undef vector and make the masks
9409 // undef as well. This makes it easier to match the shuffle based solely on
9413 if (M >= NumElements) {
9414 SmallVector<int, 8> NewMask(Mask.begin(), Mask.end());
9415 for (int &M : NewMask)
9416 if (M >= NumElements)
9418 return DAG.getVectorShuffle(VT, dl, V1, V2, NewMask);
9421 // For integer vector shuffles, try to collapse them into a shuffle of fewer
9422 // lanes but wider integers. We cap this to not form integers larger than i64
9423 // but it might be interesting to form i128 integers to handle flipping the
9424 // low and high halves of AVX 256-bit vectors.
9425 if (VT.isInteger() && VT.getScalarSizeInBits() < 64 &&
9426 canWidenShuffleElements(Mask)) {
9427 SmallVector<int, 8> NewMask;
9428 for (int i = 0, Size = Mask.size(); i < Size; i += 2)
9429 NewMask.push_back(Mask[i] != -1
9431 : (Mask[i + 1] != -1 ? Mask[i + 1] / 2 : -1));
9433 MVT::getVectorVT(MVT::getIntegerVT(VT.getScalarSizeInBits() * 2),
9434 VT.getVectorNumElements() / 2);
9435 V1 = DAG.getNode(ISD::BITCAST, dl, NewVT, V1);
9436 V2 = DAG.getNode(ISD::BITCAST, dl, NewVT, V2);
9437 return DAG.getNode(ISD::BITCAST, dl, VT,
9438 DAG.getVectorShuffle(NewVT, dl, V1, V2, NewMask));
9441 int NumV1Elements = 0, NumUndefElements = 0, NumV2Elements = 0;
9442 for (int M : SVOp->getMask())
9445 else if (M < NumElements)
9450 // Commute the shuffle as needed such that more elements come from V1 than
9451 // V2. This allows us to match the shuffle pattern strictly on how many
9452 // elements come from V1 without handling the symmetric cases.
9453 if (NumV2Elements > NumV1Elements)
9454 return DAG.getCommutedVectorShuffle(*SVOp);
9456 // When the number of V1 and V2 elements are the same, try to minimize the
9457 // number of uses of V2 in the low half of the vector.
9458 if (NumV1Elements == NumV2Elements) {
9459 int LowV1Elements = 0, LowV2Elements = 0;
9460 for (int M : SVOp->getMask().slice(0, NumElements / 2))
9461 if (M >= NumElements)
9465 if (LowV2Elements > LowV1Elements)
9466 return DAG.getCommutedVectorShuffle(*SVOp);
9469 // For each vector width, delegate to a specialized lowering routine.
9470 if (VT.getSizeInBits() == 128)
9471 return lower128BitVectorShuffle(Op, V1, V2, VT, Subtarget, DAG);
9473 if (VT.getSizeInBits() == 256)
9474 return lower256BitVectorShuffle(Op, V1, V2, VT, Subtarget, DAG);
9476 llvm_unreachable("Unimplemented!");
9480 //===----------------------------------------------------------------------===//
9481 // Legacy vector shuffle lowering
9483 // This code is the legacy code handling vector shuffles until the above
9484 // replaces its functionality and performance.
9485 //===----------------------------------------------------------------------===//
9487 static bool isBlendMask(ArrayRef<int> MaskVals, MVT VT, bool hasSSE41,
9488 bool hasInt256, unsigned *MaskOut = nullptr) {
9489 MVT EltVT = VT.getVectorElementType();
9491 // There is no blend with immediate in AVX-512.
9492 if (VT.is512BitVector())
9495 if (!hasSSE41 || EltVT == MVT::i8)
9497 if (!hasInt256 && VT == MVT::v16i16)
9500 unsigned MaskValue = 0;
9501 unsigned NumElems = VT.getVectorNumElements();
9502 // There are 2 lanes if (NumElems > 8), and 1 lane otherwise.
9503 unsigned NumLanes = (NumElems - 1) / 8 + 1;
9504 unsigned NumElemsInLane = NumElems / NumLanes;
9506 // Blend for v16i16 should be symetric for the both lanes.
9507 for (unsigned i = 0; i < NumElemsInLane; ++i) {
9509 int SndLaneEltIdx = (NumLanes == 2) ? MaskVals[i + NumElemsInLane] : -1;
9510 int EltIdx = MaskVals[i];
9512 if ((EltIdx < 0 || EltIdx == (int)i) &&
9513 (SndLaneEltIdx < 0 || SndLaneEltIdx == (int)(i + NumElemsInLane)))
9516 if (((unsigned)EltIdx == (i + NumElems)) &&
9517 (SndLaneEltIdx < 0 ||
9518 (unsigned)SndLaneEltIdx == i + NumElems + NumElemsInLane))
9519 MaskValue |= (1 << i);
9525 *MaskOut = MaskValue;
9529 // Try to lower a shuffle node into a simple blend instruction.
9530 // This function assumes isBlendMask returns true for this
9531 // SuffleVectorSDNode
9532 static SDValue LowerVECTOR_SHUFFLEtoBlend(ShuffleVectorSDNode *SVOp,
9534 const X86Subtarget *Subtarget,
9535 SelectionDAG &DAG) {
9536 MVT VT = SVOp->getSimpleValueType(0);
9537 MVT EltVT = VT.getVectorElementType();
9538 assert(isBlendMask(SVOp->getMask(), VT, Subtarget->hasSSE41(),
9539 Subtarget->hasInt256() && "Trying to lower a "
9540 "VECTOR_SHUFFLE to a Blend but "
9541 "with the wrong mask"));
9542 SDValue V1 = SVOp->getOperand(0);
9543 SDValue V2 = SVOp->getOperand(1);
9545 unsigned NumElems = VT.getVectorNumElements();
9547 // Convert i32 vectors to floating point if it is not AVX2.
9548 // AVX2 introduced VPBLENDD instruction for 128 and 256-bit vectors.
9550 if (EltVT == MVT::i64 || (EltVT == MVT::i32 && !Subtarget->hasInt256())) {
9551 BlendVT = MVT::getVectorVT(MVT::getFloatingPointVT(EltVT.getSizeInBits()),
9553 V1 = DAG.getNode(ISD::BITCAST, dl, VT, V1);
9554 V2 = DAG.getNode(ISD::BITCAST, dl, VT, V2);
9557 SDValue Ret = DAG.getNode(X86ISD::BLENDI, dl, BlendVT, V1, V2,
9558 DAG.getConstant(MaskValue, MVT::i32));
9559 return DAG.getNode(ISD::BITCAST, dl, VT, Ret);
9562 /// In vector type \p VT, return true if the element at index \p InputIdx
9563 /// falls on a different 128-bit lane than \p OutputIdx.
9564 static bool ShuffleCrosses128bitLane(MVT VT, unsigned InputIdx,
9565 unsigned OutputIdx) {
9566 unsigned EltSize = VT.getVectorElementType().getSizeInBits();
9567 return InputIdx * EltSize / 128 != OutputIdx * EltSize / 128;
9570 /// Generate a PSHUFB if possible. Selects elements from \p V1 according to
9571 /// \p MaskVals. MaskVals[OutputIdx] = InputIdx specifies that we want to
9572 /// shuffle the element at InputIdx in V1 to OutputIdx in the result. If \p
9573 /// MaskVals refers to elements outside of \p V1 or is undef (-1), insert a
9575 static SDValue getPSHUFB(ArrayRef<int> MaskVals, SDValue V1, SDLoc &dl,
9576 SelectionDAG &DAG) {
9577 MVT VT = V1.getSimpleValueType();
9578 assert(VT.is128BitVector() || VT.is256BitVector());
9580 MVT EltVT = VT.getVectorElementType();
9581 unsigned EltSizeInBytes = EltVT.getSizeInBits() / 8;
9582 unsigned NumElts = VT.getVectorNumElements();
9584 SmallVector<SDValue, 32> PshufbMask;
9585 for (unsigned OutputIdx = 0; OutputIdx < NumElts; ++OutputIdx) {
9586 int InputIdx = MaskVals[OutputIdx];
9587 unsigned InputByteIdx;
9589 if (InputIdx < 0 || NumElts <= (unsigned)InputIdx)
9590 InputByteIdx = 0x80;
9592 // Cross lane is not allowed.
9593 if (ShuffleCrosses128bitLane(VT, InputIdx, OutputIdx))
9595 InputByteIdx = InputIdx * EltSizeInBytes;
9596 // Index is an byte offset within the 128-bit lane.
9597 InputByteIdx &= 0xf;
9600 for (unsigned j = 0; j < EltSizeInBytes; ++j) {
9601 PshufbMask.push_back(DAG.getConstant(InputByteIdx, MVT::i8));
9602 if (InputByteIdx != 0x80)
9607 MVT ShufVT = MVT::getVectorVT(MVT::i8, PshufbMask.size());
9609 V1 = DAG.getNode(ISD::BITCAST, dl, ShufVT, V1);
9610 return DAG.getNode(X86ISD::PSHUFB, dl, ShufVT, V1,
9611 DAG.getNode(ISD::BUILD_VECTOR, dl, ShufVT, PshufbMask));
9614 // v8i16 shuffles - Prefer shuffles in the following order:
9615 // 1. [all] pshuflw, pshufhw, optional move
9616 // 2. [ssse3] 1 x pshufb
9617 // 3. [ssse3] 2 x pshufb + 1 x por
9618 // 4. [all] mov + pshuflw + pshufhw + N x (pextrw + pinsrw)
9620 LowerVECTOR_SHUFFLEv8i16(SDValue Op, const X86Subtarget *Subtarget,
9621 SelectionDAG &DAG) {
9622 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
9623 SDValue V1 = SVOp->getOperand(0);
9624 SDValue V2 = SVOp->getOperand(1);
9626 SmallVector<int, 8> MaskVals;
9628 // Determine if more than 1 of the words in each of the low and high quadwords
9629 // of the result come from the same quadword of one of the two inputs. Undef
9630 // mask values count as coming from any quadword, for better codegen.
9632 // Lo/HiQuad[i] = j indicates how many words from the ith quad of the input
9633 // feeds this quad. For i, 0 and 1 refer to V1, 2 and 3 refer to V2.
9634 unsigned LoQuad[] = { 0, 0, 0, 0 };
9635 unsigned HiQuad[] = { 0, 0, 0, 0 };
9636 // Indices of quads used.
9637 std::bitset<4> InputQuads;
9638 for (unsigned i = 0; i < 8; ++i) {
9639 unsigned *Quad = i < 4 ? LoQuad : HiQuad;
9640 int EltIdx = SVOp->getMaskElt(i);
9641 MaskVals.push_back(EltIdx);
9650 InputQuads.set(EltIdx / 4);
9653 int BestLoQuad = -1;
9654 unsigned MaxQuad = 1;
9655 for (unsigned i = 0; i < 4; ++i) {
9656 if (LoQuad[i] > MaxQuad) {
9658 MaxQuad = LoQuad[i];
9662 int BestHiQuad = -1;
9664 for (unsigned i = 0; i < 4; ++i) {
9665 if (HiQuad[i] > MaxQuad) {
9667 MaxQuad = HiQuad[i];
9671 // For SSSE3, If all 8 words of the result come from only 1 quadword of each
9672 // of the two input vectors, shuffle them into one input vector so only a
9673 // single pshufb instruction is necessary. If there are more than 2 input
9674 // quads, disable the next transformation since it does not help SSSE3.
9675 bool V1Used = InputQuads[0] || InputQuads[1];
9676 bool V2Used = InputQuads[2] || InputQuads[3];
9677 if (Subtarget->hasSSSE3()) {
9678 if (InputQuads.count() == 2 && V1Used && V2Used) {
9679 BestLoQuad = InputQuads[0] ? 0 : 1;
9680 BestHiQuad = InputQuads[2] ? 2 : 3;
9682 if (InputQuads.count() > 2) {
9688 // If BestLoQuad or BestHiQuad are set, shuffle the quads together and update
9689 // the shuffle mask. If a quad is scored as -1, that means that it contains
9690 // words from all 4 input quadwords.
9692 if (BestLoQuad >= 0 || BestHiQuad >= 0) {
9694 BestLoQuad < 0 ? 0 : BestLoQuad,
9695 BestHiQuad < 0 ? 1 : BestHiQuad
9697 NewV = DAG.getVectorShuffle(MVT::v2i64, dl,
9698 DAG.getNode(ISD::BITCAST, dl, MVT::v2i64, V1),
9699 DAG.getNode(ISD::BITCAST, dl, MVT::v2i64, V2), &MaskV[0]);
9700 NewV = DAG.getNode(ISD::BITCAST, dl, MVT::v8i16, NewV);
9702 // Rewrite the MaskVals and assign NewV to V1 if NewV now contains all the
9703 // source words for the shuffle, to aid later transformations.
9704 bool AllWordsInNewV = true;
9705 bool InOrder[2] = { true, true };
9706 for (unsigned i = 0; i != 8; ++i) {
9707 int idx = MaskVals[i];
9709 InOrder[i/4] = false;
9710 if (idx < 0 || (idx/4) == BestLoQuad || (idx/4) == BestHiQuad)
9712 AllWordsInNewV = false;
9716 bool pshuflw = AllWordsInNewV, pshufhw = AllWordsInNewV;
9717 if (AllWordsInNewV) {
9718 for (int i = 0; i != 8; ++i) {
9719 int idx = MaskVals[i];
9722 idx = MaskVals[i] = (idx / 4) == BestLoQuad ? (idx & 3) : (idx & 3) + 4;
9723 if ((idx != i) && idx < 4)
9725 if ((idx != i) && idx > 3)
9734 // If we've eliminated the use of V2, and the new mask is a pshuflw or
9735 // pshufhw, that's as cheap as it gets. Return the new shuffle.
9736 if ((pshufhw && InOrder[0]) || (pshuflw && InOrder[1])) {
9737 unsigned Opc = pshufhw ? X86ISD::PSHUFHW : X86ISD::PSHUFLW;
9738 unsigned TargetMask = 0;
9739 NewV = DAG.getVectorShuffle(MVT::v8i16, dl, NewV,
9740 DAG.getUNDEF(MVT::v8i16), &MaskVals[0]);
9741 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(NewV.getNode());
9742 TargetMask = pshufhw ? getShufflePSHUFHWImmediate(SVOp):
9743 getShufflePSHUFLWImmediate(SVOp);
9744 V1 = NewV.getOperand(0);
9745 return getTargetShuffleNode(Opc, dl, MVT::v8i16, V1, TargetMask, DAG);
9749 // Promote splats to a larger type which usually leads to more efficient code.
9750 // FIXME: Is this true if pshufb is available?
9751 if (SVOp->isSplat())
9752 return PromoteSplat(SVOp, DAG);
9754 // If we have SSSE3, and all words of the result are from 1 input vector,
9755 // case 2 is generated, otherwise case 3 is generated. If no SSSE3
9756 // is present, fall back to case 4.
9757 if (Subtarget->hasSSSE3()) {
9758 SmallVector<SDValue,16> pshufbMask;
9760 // If we have elements from both input vectors, set the high bit of the
9761 // shuffle mask element to zero out elements that come from V2 in the V1
9762 // mask, and elements that come from V1 in the V2 mask, so that the two
9763 // results can be OR'd together.
9764 bool TwoInputs = V1Used && V2Used;
9765 V1 = getPSHUFB(MaskVals, V1, dl, DAG);
9767 return DAG.getNode(ISD::BITCAST, dl, MVT::v8i16, V1);
9769 // Calculate the shuffle mask for the second input, shuffle it, and
9770 // OR it with the first shuffled input.
9771 CommuteVectorShuffleMask(MaskVals, 8);
9772 V2 = getPSHUFB(MaskVals, V2, dl, DAG);
9773 V1 = DAG.getNode(ISD::OR, dl, MVT::v16i8, V1, V2);
9774 return DAG.getNode(ISD::BITCAST, dl, MVT::v8i16, V1);
9777 // If BestLoQuad >= 0, generate a pshuflw to put the low elements in order,
9778 // and update MaskVals with new element order.
9779 std::bitset<8> InOrder;
9780 if (BestLoQuad >= 0) {
9781 int MaskV[] = { -1, -1, -1, -1, 4, 5, 6, 7 };
9782 for (int i = 0; i != 4; ++i) {
9783 int idx = MaskVals[i];
9786 } else if ((idx / 4) == BestLoQuad) {
9791 NewV = DAG.getVectorShuffle(MVT::v8i16, dl, NewV, DAG.getUNDEF(MVT::v8i16),
9794 if (NewV.getOpcode() == ISD::VECTOR_SHUFFLE && Subtarget->hasSSE2()) {
9795 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(NewV.getNode());
9796 NewV = getTargetShuffleNode(X86ISD::PSHUFLW, dl, MVT::v8i16,
9798 getShufflePSHUFLWImmediate(SVOp), DAG);
9802 // If BestHi >= 0, generate a pshufhw to put the high elements in order,
9803 // and update MaskVals with the new element order.
9804 if (BestHiQuad >= 0) {
9805 int MaskV[] = { 0, 1, 2, 3, -1, -1, -1, -1 };
9806 for (unsigned i = 4; i != 8; ++i) {
9807 int idx = MaskVals[i];
9810 } else if ((idx / 4) == BestHiQuad) {
9811 MaskV[i] = (idx & 3) + 4;
9815 NewV = DAG.getVectorShuffle(MVT::v8i16, dl, NewV, DAG.getUNDEF(MVT::v8i16),
9818 if (NewV.getOpcode() == ISD::VECTOR_SHUFFLE && Subtarget->hasSSE2()) {
9819 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(NewV.getNode());
9820 NewV = getTargetShuffleNode(X86ISD::PSHUFHW, dl, MVT::v8i16,
9822 getShufflePSHUFHWImmediate(SVOp), DAG);
9826 // In case BestHi & BestLo were both -1, which means each quadword has a word
9827 // from each of the four input quadwords, calculate the InOrder bitvector now
9828 // before falling through to the insert/extract cleanup.
9829 if (BestLoQuad == -1 && BestHiQuad == -1) {
9831 for (int i = 0; i != 8; ++i)
9832 if (MaskVals[i] < 0 || MaskVals[i] == i)
9836 // The other elements are put in the right place using pextrw and pinsrw.
9837 for (unsigned i = 0; i != 8; ++i) {
9840 int EltIdx = MaskVals[i];
9843 SDValue ExtOp = (EltIdx < 8) ?
9844 DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::i16, V1,
9845 DAG.getIntPtrConstant(EltIdx)) :
9846 DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::i16, V2,
9847 DAG.getIntPtrConstant(EltIdx - 8));
9848 NewV = DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, MVT::v8i16, NewV, ExtOp,
9849 DAG.getIntPtrConstant(i));
9854 /// \brief v16i16 shuffles
9856 /// FIXME: We only support generation of a single pshufb currently. We can
9857 /// generalize the other applicable cases from LowerVECTOR_SHUFFLEv8i16 as
9858 /// well (e.g 2 x pshufb + 1 x por).
9860 LowerVECTOR_SHUFFLEv16i16(SDValue Op, SelectionDAG &DAG) {
9861 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
9862 SDValue V1 = SVOp->getOperand(0);
9863 SDValue V2 = SVOp->getOperand(1);
9866 if (V2.getOpcode() != ISD::UNDEF)
9869 SmallVector<int, 16> MaskVals(SVOp->getMask().begin(), SVOp->getMask().end());
9870 return getPSHUFB(MaskVals, V1, dl, DAG);
9873 // v16i8 shuffles - Prefer shuffles in the following order:
9874 // 1. [ssse3] 1 x pshufb
9875 // 2. [ssse3] 2 x pshufb + 1 x por
9876 // 3. [all] v8i16 shuffle + N x pextrw + rotate + pinsrw
9877 static SDValue LowerVECTOR_SHUFFLEv16i8(ShuffleVectorSDNode *SVOp,
9878 const X86Subtarget* Subtarget,
9879 SelectionDAG &DAG) {
9880 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
9881 SDValue V1 = SVOp->getOperand(0);
9882 SDValue V2 = SVOp->getOperand(1);
9884 ArrayRef<int> MaskVals = SVOp->getMask();
9886 // Promote splats to a larger type which usually leads to more efficient code.
9887 // FIXME: Is this true if pshufb is available?
9888 if (SVOp->isSplat())
9889 return PromoteSplat(SVOp, DAG);
9891 // If we have SSSE3, case 1 is generated when all result bytes come from
9892 // one of the inputs. Otherwise, case 2 is generated. If no SSSE3 is
9893 // present, fall back to case 3.
9895 // If SSSE3, use 1 pshufb instruction per vector with elements in the result.
9896 if (Subtarget->hasSSSE3()) {
9897 SmallVector<SDValue,16> pshufbMask;
9899 // If all result elements are from one input vector, then only translate
9900 // undef mask values to 0x80 (zero out result) in the pshufb mask.
9902 // Otherwise, we have elements from both input vectors, and must zero out
9903 // elements that come from V2 in the first mask, and V1 in the second mask
9904 // so that we can OR them together.
9905 for (unsigned i = 0; i != 16; ++i) {
9906 int EltIdx = MaskVals[i];
9907 if (EltIdx < 0 || EltIdx >= 16)
9909 pshufbMask.push_back(DAG.getConstant(EltIdx, MVT::i8));
9911 V1 = DAG.getNode(X86ISD::PSHUFB, dl, MVT::v16i8, V1,
9912 DAG.getNode(ISD::BUILD_VECTOR, dl,
9913 MVT::v16i8, pshufbMask));
9915 // As PSHUFB will zero elements with negative indices, it's safe to ignore
9916 // the 2nd operand if it's undefined or zero.
9917 if (V2.getOpcode() == ISD::UNDEF ||
9918 ISD::isBuildVectorAllZeros(V2.getNode()))
9921 // Calculate the shuffle mask for the second input, shuffle it, and
9922 // OR it with the first shuffled input.
9924 for (unsigned i = 0; i != 16; ++i) {
9925 int EltIdx = MaskVals[i];
9926 EltIdx = (EltIdx < 16) ? 0x80 : EltIdx - 16;
9927 pshufbMask.push_back(DAG.getConstant(EltIdx, MVT::i8));
9929 V2 = DAG.getNode(X86ISD::PSHUFB, dl, MVT::v16i8, V2,
9930 DAG.getNode(ISD::BUILD_VECTOR, dl,
9931 MVT::v16i8, pshufbMask));
9932 return DAG.getNode(ISD::OR, dl, MVT::v16i8, V1, V2);
9935 // No SSSE3 - Calculate in place words and then fix all out of place words
9936 // With 0-16 extracts & inserts. Worst case is 16 bytes out of order from
9937 // the 16 different words that comprise the two doublequadword input vectors.
9938 V1 = DAG.getNode(ISD::BITCAST, dl, MVT::v8i16, V1);
9939 V2 = DAG.getNode(ISD::BITCAST, dl, MVT::v8i16, V2);
9941 for (int i = 0; i != 8; ++i) {
9942 int Elt0 = MaskVals[i*2];
9943 int Elt1 = MaskVals[i*2+1];
9945 // This word of the result is all undef, skip it.
9946 if (Elt0 < 0 && Elt1 < 0)
9949 // This word of the result is already in the correct place, skip it.
9950 if ((Elt0 == i*2) && (Elt1 == i*2+1))
9953 SDValue Elt0Src = Elt0 < 16 ? V1 : V2;
9954 SDValue Elt1Src = Elt1 < 16 ? V1 : V2;
9957 // If Elt0 and Elt1 are defined, are consecutive, and can be load
9958 // using a single extract together, load it and store it.
9959 if ((Elt0 >= 0) && ((Elt0 + 1) == Elt1) && ((Elt0 & 1) == 0)) {
9960 InsElt = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::i16, Elt1Src,
9961 DAG.getIntPtrConstant(Elt1 / 2));
9962 NewV = DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, MVT::v8i16, NewV, InsElt,
9963 DAG.getIntPtrConstant(i));
9967 // If Elt1 is defined, extract it from the appropriate source. If the
9968 // source byte is not also odd, shift the extracted word left 8 bits
9969 // otherwise clear the bottom 8 bits if we need to do an or.
9971 InsElt = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::i16, Elt1Src,
9972 DAG.getIntPtrConstant(Elt1 / 2));
9973 if ((Elt1 & 1) == 0)
9974 InsElt = DAG.getNode(ISD::SHL, dl, MVT::i16, InsElt,
9976 TLI.getShiftAmountTy(InsElt.getValueType())));
9978 InsElt = DAG.getNode(ISD::AND, dl, MVT::i16, InsElt,
9979 DAG.getConstant(0xFF00, MVT::i16));
9981 // If Elt0 is defined, extract it from the appropriate source. If the
9982 // source byte is not also even, shift the extracted word right 8 bits. If
9983 // Elt1 was also defined, OR the extracted values together before
9984 // inserting them in the result.
9986 SDValue InsElt0 = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::i16,
9987 Elt0Src, DAG.getIntPtrConstant(Elt0 / 2));
9988 if ((Elt0 & 1) != 0)
9989 InsElt0 = DAG.getNode(ISD::SRL, dl, MVT::i16, InsElt0,
9991 TLI.getShiftAmountTy(InsElt0.getValueType())));
9993 InsElt0 = DAG.getNode(ISD::AND, dl, MVT::i16, InsElt0,
9994 DAG.getConstant(0x00FF, MVT::i16));
9995 InsElt = Elt1 >= 0 ? DAG.getNode(ISD::OR, dl, MVT::i16, InsElt, InsElt0)
9998 NewV = DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, MVT::v8i16, NewV, InsElt,
9999 DAG.getIntPtrConstant(i));
10001 return DAG.getNode(ISD::BITCAST, dl, MVT::v16i8, NewV);
10004 // v32i8 shuffles - Translate to VPSHUFB if possible.
10006 SDValue LowerVECTOR_SHUFFLEv32i8(ShuffleVectorSDNode *SVOp,
10007 const X86Subtarget *Subtarget,
10008 SelectionDAG &DAG) {
10009 MVT VT = SVOp->getSimpleValueType(0);
10010 SDValue V1 = SVOp->getOperand(0);
10011 SDValue V2 = SVOp->getOperand(1);
10013 SmallVector<int, 32> MaskVals(SVOp->getMask().begin(), SVOp->getMask().end());
10015 bool V2IsUndef = V2.getOpcode() == ISD::UNDEF;
10016 bool V1IsAllZero = ISD::isBuildVectorAllZeros(V1.getNode());
10017 bool V2IsAllZero = ISD::isBuildVectorAllZeros(V2.getNode());
10019 // VPSHUFB may be generated if
10020 // (1) one of input vector is undefined or zeroinitializer.
10021 // The mask value 0x80 puts 0 in the corresponding slot of the vector.
10022 // And (2) the mask indexes don't cross the 128-bit lane.
10023 if (VT != MVT::v32i8 || !Subtarget->hasInt256() ||
10024 (!V2IsUndef && !V2IsAllZero && !V1IsAllZero))
10027 if (V1IsAllZero && !V2IsAllZero) {
10028 CommuteVectorShuffleMask(MaskVals, 32);
10031 return getPSHUFB(MaskVals, V1, dl, DAG);
10034 /// RewriteAsNarrowerShuffle - Try rewriting v8i16 and v16i8 shuffles as 4 wide
10035 /// ones, or rewriting v4i32 / v4f32 as 2 wide ones if possible. This can be
10036 /// done when every pair / quad of shuffle mask elements point to elements in
10037 /// the right sequence. e.g.
10038 /// vector_shuffle X, Y, <2, 3, | 10, 11, | 0, 1, | 14, 15>
10040 SDValue RewriteAsNarrowerShuffle(ShuffleVectorSDNode *SVOp,
10041 SelectionDAG &DAG) {
10042 MVT VT = SVOp->getSimpleValueType(0);
10044 unsigned NumElems = VT.getVectorNumElements();
10047 switch (VT.SimpleTy) {
10048 default: llvm_unreachable("Unexpected!");
10051 return SDValue(SVOp, 0);
10052 case MVT::v4f32: NewVT = MVT::v2f64; Scale = 2; break;
10053 case MVT::v4i32: NewVT = MVT::v2i64; Scale = 2; break;
10054 case MVT::v8i16: NewVT = MVT::v4i32; Scale = 2; break;
10055 case MVT::v16i8: NewVT = MVT::v4i32; Scale = 4; break;
10056 case MVT::v16i16: NewVT = MVT::v8i32; Scale = 2; break;
10057 case MVT::v32i8: NewVT = MVT::v8i32; Scale = 4; break;
10060 SmallVector<int, 8> MaskVec;
10061 for (unsigned i = 0; i != NumElems; i += Scale) {
10063 for (unsigned j = 0; j != Scale; ++j) {
10064 int EltIdx = SVOp->getMaskElt(i+j);
10068 StartIdx = (EltIdx / Scale);
10069 if (EltIdx != (int)(StartIdx*Scale + j))
10072 MaskVec.push_back(StartIdx);
10075 SDValue V1 = DAG.getNode(ISD::BITCAST, dl, NewVT, SVOp->getOperand(0));
10076 SDValue V2 = DAG.getNode(ISD::BITCAST, dl, NewVT, SVOp->getOperand(1));
10077 return DAG.getVectorShuffle(NewVT, dl, V1, V2, &MaskVec[0]);
10080 /// getVZextMovL - Return a zero-extending vector move low node.
10082 static SDValue getVZextMovL(MVT VT, MVT OpVT,
10083 SDValue SrcOp, SelectionDAG &DAG,
10084 const X86Subtarget *Subtarget, SDLoc dl) {
10085 if (VT == MVT::v2f64 || VT == MVT::v4f32) {
10086 LoadSDNode *LD = nullptr;
10087 if (!isScalarLoadToVector(SrcOp.getNode(), &LD))
10088 LD = dyn_cast<LoadSDNode>(SrcOp);
10090 // movssrr and movsdrr do not clear top bits. Try to use movd, movq
10092 MVT ExtVT = (OpVT == MVT::v2f64) ? MVT::i64 : MVT::i32;
10093 if ((ExtVT != MVT::i64 || Subtarget->is64Bit()) &&
10094 SrcOp.getOpcode() == ISD::SCALAR_TO_VECTOR &&
10095 SrcOp.getOperand(0).getOpcode() == ISD::BITCAST &&
10096 SrcOp.getOperand(0).getOperand(0).getValueType() == ExtVT) {
10098 OpVT = (OpVT == MVT::v2f64) ? MVT::v2i64 : MVT::v4i32;
10099 return DAG.getNode(ISD::BITCAST, dl, VT,
10100 DAG.getNode(X86ISD::VZEXT_MOVL, dl, OpVT,
10101 DAG.getNode(ISD::SCALAR_TO_VECTOR, dl,
10103 SrcOp.getOperand(0)
10109 return DAG.getNode(ISD::BITCAST, dl, VT,
10110 DAG.getNode(X86ISD::VZEXT_MOVL, dl, OpVT,
10111 DAG.getNode(ISD::BITCAST, dl,
10115 /// LowerVECTOR_SHUFFLE_256 - Handle all 256-bit wide vectors shuffles
10116 /// which could not be matched by any known target speficic shuffle
10118 LowerVECTOR_SHUFFLE_256(ShuffleVectorSDNode *SVOp, SelectionDAG &DAG) {
10120 SDValue NewOp = Compact8x32ShuffleNode(SVOp, DAG);
10121 if (NewOp.getNode())
10124 MVT VT = SVOp->getSimpleValueType(0);
10126 unsigned NumElems = VT.getVectorNumElements();
10127 unsigned NumLaneElems = NumElems / 2;
10130 MVT EltVT = VT.getVectorElementType();
10131 MVT NVT = MVT::getVectorVT(EltVT, NumLaneElems);
10134 SmallVector<int, 16> Mask;
10135 for (unsigned l = 0; l < 2; ++l) {
10136 // Build a shuffle mask for the output, discovering on the fly which
10137 // input vectors to use as shuffle operands (recorded in InputUsed).
10138 // If building a suitable shuffle vector proves too hard, then bail
10139 // out with UseBuildVector set.
10140 bool UseBuildVector = false;
10141 int InputUsed[2] = { -1, -1 }; // Not yet discovered.
10142 unsigned LaneStart = l * NumLaneElems;
10143 for (unsigned i = 0; i != NumLaneElems; ++i) {
10144 // The mask element. This indexes into the input.
10145 int Idx = SVOp->getMaskElt(i+LaneStart);
10147 // the mask element does not index into any input vector.
10148 Mask.push_back(-1);
10152 // The input vector this mask element indexes into.
10153 int Input = Idx / NumLaneElems;
10155 // Turn the index into an offset from the start of the input vector.
10156 Idx -= Input * NumLaneElems;
10158 // Find or create a shuffle vector operand to hold this input.
10160 for (OpNo = 0; OpNo < array_lengthof(InputUsed); ++OpNo) {
10161 if (InputUsed[OpNo] == Input)
10162 // This input vector is already an operand.
10164 if (InputUsed[OpNo] < 0) {
10165 // Create a new operand for this input vector.
10166 InputUsed[OpNo] = Input;
10171 if (OpNo >= array_lengthof(InputUsed)) {
10172 // More than two input vectors used! Give up on trying to create a
10173 // shuffle vector. Insert all elements into a BUILD_VECTOR instead.
10174 UseBuildVector = true;
10178 // Add the mask index for the new shuffle vector.
10179 Mask.push_back(Idx + OpNo * NumLaneElems);
10182 if (UseBuildVector) {
10183 SmallVector<SDValue, 16> SVOps;
10184 for (unsigned i = 0; i != NumLaneElems; ++i) {
10185 // The mask element. This indexes into the input.
10186 int Idx = SVOp->getMaskElt(i+LaneStart);
10188 SVOps.push_back(DAG.getUNDEF(EltVT));
10192 // The input vector this mask element indexes into.
10193 int Input = Idx / NumElems;
10195 // Turn the index into an offset from the start of the input vector.
10196 Idx -= Input * NumElems;
10198 // Extract the vector element by hand.
10199 SVOps.push_back(DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, EltVT,
10200 SVOp->getOperand(Input),
10201 DAG.getIntPtrConstant(Idx)));
10204 // Construct the output using a BUILD_VECTOR.
10205 Output[l] = DAG.getNode(ISD::BUILD_VECTOR, dl, NVT, SVOps);
10206 } else if (InputUsed[0] < 0) {
10207 // No input vectors were used! The result is undefined.
10208 Output[l] = DAG.getUNDEF(NVT);
10210 SDValue Op0 = Extract128BitVector(SVOp->getOperand(InputUsed[0] / 2),
10211 (InputUsed[0] % 2) * NumLaneElems,
10213 // If only one input was used, use an undefined vector for the other.
10214 SDValue Op1 = (InputUsed[1] < 0) ? DAG.getUNDEF(NVT) :
10215 Extract128BitVector(SVOp->getOperand(InputUsed[1] / 2),
10216 (InputUsed[1] % 2) * NumLaneElems, DAG, dl);
10217 // At least one input vector was used. Create a new shuffle vector.
10218 Output[l] = DAG.getVectorShuffle(NVT, dl, Op0, Op1, &Mask[0]);
10224 // Concatenate the result back
10225 return DAG.getNode(ISD::CONCAT_VECTORS, dl, VT, Output[0], Output[1]);
10228 /// LowerVECTOR_SHUFFLE_128v4 - Handle all 128-bit wide vectors with
10229 /// 4 elements, and match them with several different shuffle types.
10231 LowerVECTOR_SHUFFLE_128v4(ShuffleVectorSDNode *SVOp, SelectionDAG &DAG) {
10232 SDValue V1 = SVOp->getOperand(0);
10233 SDValue V2 = SVOp->getOperand(1);
10235 MVT VT = SVOp->getSimpleValueType(0);
10237 assert(VT.is128BitVector() && "Unsupported vector size");
10239 std::pair<int, int> Locs[4];
10240 int Mask1[] = { -1, -1, -1, -1 };
10241 SmallVector<int, 8> PermMask(SVOp->getMask().begin(), SVOp->getMask().end());
10243 unsigned NumHi = 0;
10244 unsigned NumLo = 0;
10245 for (unsigned i = 0; i != 4; ++i) {
10246 int Idx = PermMask[i];
10248 Locs[i] = std::make_pair(-1, -1);
10250 assert(Idx < 8 && "Invalid VECTOR_SHUFFLE index!");
10252 Locs[i] = std::make_pair(0, NumLo);
10253 Mask1[NumLo] = Idx;
10256 Locs[i] = std::make_pair(1, NumHi);
10258 Mask1[2+NumHi] = Idx;
10264 if (NumLo <= 2 && NumHi <= 2) {
10265 // If no more than two elements come from either vector. This can be
10266 // implemented with two shuffles. First shuffle gather the elements.
10267 // The second shuffle, which takes the first shuffle as both of its
10268 // vector operands, put the elements into the right order.
10269 V1 = DAG.getVectorShuffle(VT, dl, V1, V2, &Mask1[0]);
10271 int Mask2[] = { -1, -1, -1, -1 };
10273 for (unsigned i = 0; i != 4; ++i)
10274 if (Locs[i].first != -1) {
10275 unsigned Idx = (i < 2) ? 0 : 4;
10276 Idx += Locs[i].first * 2 + Locs[i].second;
10280 return DAG.getVectorShuffle(VT, dl, V1, V1, &Mask2[0]);
10283 if (NumLo == 3 || NumHi == 3) {
10284 // Otherwise, we must have three elements from one vector, call it X, and
10285 // one element from the other, call it Y. First, use a shufps to build an
10286 // intermediate vector with the one element from Y and the element from X
10287 // that will be in the same half in the final destination (the indexes don't
10288 // matter). Then, use a shufps to build the final vector, taking the half
10289 // containing the element from Y from the intermediate, and the other half
10292 // Normalize it so the 3 elements come from V1.
10293 CommuteVectorShuffleMask(PermMask, 4);
10297 // Find the element from V2.
10299 for (HiIndex = 0; HiIndex < 3; ++HiIndex) {
10300 int Val = PermMask[HiIndex];
10307 Mask1[0] = PermMask[HiIndex];
10309 Mask1[2] = PermMask[HiIndex^1];
10311 V2 = DAG.getVectorShuffle(VT, dl, V1, V2, &Mask1[0]);
10313 if (HiIndex >= 2) {
10314 Mask1[0] = PermMask[0];
10315 Mask1[1] = PermMask[1];
10316 Mask1[2] = HiIndex & 1 ? 6 : 4;
10317 Mask1[3] = HiIndex & 1 ? 4 : 6;
10318 return DAG.getVectorShuffle(VT, dl, V1, V2, &Mask1[0]);
10321 Mask1[0] = HiIndex & 1 ? 2 : 0;
10322 Mask1[1] = HiIndex & 1 ? 0 : 2;
10323 Mask1[2] = PermMask[2];
10324 Mask1[3] = PermMask[3];
10329 return DAG.getVectorShuffle(VT, dl, V2, V1, &Mask1[0]);
10332 // Break it into (shuffle shuffle_hi, shuffle_lo).
10333 int LoMask[] = { -1, -1, -1, -1 };
10334 int HiMask[] = { -1, -1, -1, -1 };
10336 int *MaskPtr = LoMask;
10337 unsigned MaskIdx = 0;
10338 unsigned LoIdx = 0;
10339 unsigned HiIdx = 2;
10340 for (unsigned i = 0; i != 4; ++i) {
10347 int Idx = PermMask[i];
10349 Locs[i] = std::make_pair(-1, -1);
10350 } else if (Idx < 4) {
10351 Locs[i] = std::make_pair(MaskIdx, LoIdx);
10352 MaskPtr[LoIdx] = Idx;
10355 Locs[i] = std::make_pair(MaskIdx, HiIdx);
10356 MaskPtr[HiIdx] = Idx;
10361 SDValue LoShuffle = DAG.getVectorShuffle(VT, dl, V1, V2, &LoMask[0]);
10362 SDValue HiShuffle = DAG.getVectorShuffle(VT, dl, V1, V2, &HiMask[0]);
10363 int MaskOps[] = { -1, -1, -1, -1 };
10364 for (unsigned i = 0; i != 4; ++i)
10365 if (Locs[i].first != -1)
10366 MaskOps[i] = Locs[i].first * 4 + Locs[i].second;
10367 return DAG.getVectorShuffle(VT, dl, LoShuffle, HiShuffle, &MaskOps[0]);
10370 static bool MayFoldVectorLoad(SDValue V) {
10371 while (V.hasOneUse() && V.getOpcode() == ISD::BITCAST)
10372 V = V.getOperand(0);
10374 if (V.hasOneUse() && V.getOpcode() == ISD::SCALAR_TO_VECTOR)
10375 V = V.getOperand(0);
10376 if (V.hasOneUse() && V.getOpcode() == ISD::BUILD_VECTOR &&
10377 V.getNumOperands() == 2 && V.getOperand(1).getOpcode() == ISD::UNDEF)
10378 // BUILD_VECTOR (load), undef
10379 V = V.getOperand(0);
10381 return MayFoldLoad(V);
10385 SDValue getMOVDDup(SDValue &Op, SDLoc &dl, SDValue V1, SelectionDAG &DAG) {
10386 MVT VT = Op.getSimpleValueType();
10388 // Canonizalize to v2f64.
10389 V1 = DAG.getNode(ISD::BITCAST, dl, MVT::v2f64, V1);
10390 return DAG.getNode(ISD::BITCAST, dl, VT,
10391 getTargetShuffleNode(X86ISD::MOVDDUP, dl, MVT::v2f64,
10396 SDValue getMOVLowToHigh(SDValue &Op, SDLoc &dl, SelectionDAG &DAG,
10398 SDValue V1 = Op.getOperand(0);
10399 SDValue V2 = Op.getOperand(1);
10400 MVT VT = Op.getSimpleValueType();
10402 assert(VT != MVT::v2i64 && "unsupported shuffle type");
10404 if (HasSSE2 && VT == MVT::v2f64)
10405 return getTargetShuffleNode(X86ISD::MOVLHPD, dl, VT, V1, V2, DAG);
10407 // v4f32 or v4i32: canonizalized to v4f32 (which is legal for SSE1)
10408 return DAG.getNode(ISD::BITCAST, dl, VT,
10409 getTargetShuffleNode(X86ISD::MOVLHPS, dl, MVT::v4f32,
10410 DAG.getNode(ISD::BITCAST, dl, MVT::v4f32, V1),
10411 DAG.getNode(ISD::BITCAST, dl, MVT::v4f32, V2), DAG));
10415 SDValue getMOVHighToLow(SDValue &Op, SDLoc &dl, SelectionDAG &DAG) {
10416 SDValue V1 = Op.getOperand(0);
10417 SDValue V2 = Op.getOperand(1);
10418 MVT VT = Op.getSimpleValueType();
10420 assert((VT == MVT::v4i32 || VT == MVT::v4f32) &&
10421 "unsupported shuffle type");
10423 if (V2.getOpcode() == ISD::UNDEF)
10427 return getTargetShuffleNode(X86ISD::MOVHLPS, dl, VT, V1, V2, DAG);
10431 SDValue getMOVLP(SDValue &Op, SDLoc &dl, SelectionDAG &DAG, bool HasSSE2) {
10432 SDValue V1 = Op.getOperand(0);
10433 SDValue V2 = Op.getOperand(1);
10434 MVT VT = Op.getSimpleValueType();
10435 unsigned NumElems = VT.getVectorNumElements();
10437 // Use MOVLPS and MOVLPD in case V1 or V2 are loads. During isel, the second
10438 // operand of these instructions is only memory, so check if there's a
10439 // potencial load folding here, otherwise use SHUFPS or MOVSD to match the
10441 bool CanFoldLoad = false;
10443 // Trivial case, when V2 comes from a load.
10444 if (MayFoldVectorLoad(V2))
10445 CanFoldLoad = true;
10447 // When V1 is a load, it can be folded later into a store in isel, example:
10448 // (store (v4f32 (X86Movlps (load addr:$src1), VR128:$src2)), addr:$src1)
10450 // (MOVLPSmr addr:$src1, VR128:$src2)
10451 // So, recognize this potential and also use MOVLPS or MOVLPD
10452 else if (MayFoldVectorLoad(V1) && MayFoldIntoStore(Op))
10453 CanFoldLoad = true;
10455 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
10457 if (HasSSE2 && NumElems == 2)
10458 return getTargetShuffleNode(X86ISD::MOVLPD, dl, VT, V1, V2, DAG);
10461 // If we don't care about the second element, proceed to use movss.
10462 if (SVOp->getMaskElt(1) != -1)
10463 return getTargetShuffleNode(X86ISD::MOVLPS, dl, VT, V1, V2, DAG);
10466 // movl and movlp will both match v2i64, but v2i64 is never matched by
10467 // movl earlier because we make it strict to avoid messing with the movlp load
10468 // folding logic (see the code above getMOVLP call). Match it here then,
10469 // this is horrible, but will stay like this until we move all shuffle
10470 // matching to x86 specific nodes. Note that for the 1st condition all
10471 // types are matched with movsd.
10473 // FIXME: isMOVLMask should be checked and matched before getMOVLP,
10474 // as to remove this logic from here, as much as possible
10475 if (NumElems == 2 || !isMOVLMask(SVOp->getMask(), VT))
10476 return getTargetShuffleNode(X86ISD::MOVSD, dl, VT, V1, V2, DAG);
10477 return getTargetShuffleNode(X86ISD::MOVSS, dl, VT, V1, V2, DAG);
10480 assert(VT != MVT::v4i32 && "unsupported shuffle type");
10482 // Invert the operand order and use SHUFPS to match it.
10483 return getTargetShuffleNode(X86ISD::SHUFP, dl, VT, V2, V1,
10484 getShuffleSHUFImmediate(SVOp), DAG);
10487 static SDValue NarrowVectorLoadToElement(LoadSDNode *Load, unsigned Index,
10488 SelectionDAG &DAG) {
10490 MVT VT = Load->getSimpleValueType(0);
10491 MVT EVT = VT.getVectorElementType();
10492 SDValue Addr = Load->getOperand(1);
10493 SDValue NewAddr = DAG.getNode(
10494 ISD::ADD, dl, Addr.getSimpleValueType(), Addr,
10495 DAG.getConstant(Index * EVT.getStoreSize(), Addr.getSimpleValueType()));
10498 DAG.getLoad(EVT, dl, Load->getChain(), NewAddr,
10499 DAG.getMachineFunction().getMachineMemOperand(
10500 Load->getMemOperand(), 0, EVT.getStoreSize()));
10504 // It is only safe to call this function if isINSERTPSMask is true for
10505 // this shufflevector mask.
10506 static SDValue getINSERTPS(ShuffleVectorSDNode *SVOp, SDLoc &dl,
10507 SelectionDAG &DAG) {
10508 // Generate an insertps instruction when inserting an f32 from memory onto a
10509 // v4f32 or when copying a member from one v4f32 to another.
10510 // We also use it for transferring i32 from one register to another,
10511 // since it simply copies the same bits.
10512 // If we're transferring an i32 from memory to a specific element in a
10513 // register, we output a generic DAG that will match the PINSRD
10515 MVT VT = SVOp->getSimpleValueType(0);
10516 MVT EVT = VT.getVectorElementType();
10517 SDValue V1 = SVOp->getOperand(0);
10518 SDValue V2 = SVOp->getOperand(1);
10519 auto Mask = SVOp->getMask();
10520 assert((VT == MVT::v4f32 || VT == MVT::v4i32) &&
10521 "unsupported vector type for insertps/pinsrd");
10523 auto FromV1Predicate = [](const int &i) { return i < 4 && i > -1; };
10524 auto FromV2Predicate = [](const int &i) { return i >= 4; };
10525 int FromV1 = std::count_if(Mask.begin(), Mask.end(), FromV1Predicate);
10529 unsigned DestIndex;
10533 DestIndex = std::find_if(Mask.begin(), Mask.end(), FromV1Predicate) -
10536 // If we have 1 element from each vector, we have to check if we're
10537 // changing V1's element's place. If so, we're done. Otherwise, we
10538 // should assume we're changing V2's element's place and behave
10540 int FromV2 = std::count_if(Mask.begin(), Mask.end(), FromV2Predicate);
10541 assert(DestIndex <= INT32_MAX && "truncated destination index");
10542 if (FromV1 == FromV2 &&
10543 static_cast<int>(DestIndex) == Mask[DestIndex] % 4) {
10547 std::find_if(Mask.begin(), Mask.end(), FromV2Predicate) - Mask.begin();
10550 assert(std::count_if(Mask.begin(), Mask.end(), FromV2Predicate) == 1 &&
10551 "More than one element from V1 and from V2, or no elements from one "
10552 "of the vectors. This case should not have returned true from "
10557 std::find_if(Mask.begin(), Mask.end(), FromV2Predicate) - Mask.begin();
10560 // Get an index into the source vector in the range [0,4) (the mask is
10561 // in the range [0,8) because it can address V1 and V2)
10562 unsigned SrcIndex = Mask[DestIndex] % 4;
10563 if (MayFoldLoad(From)) {
10564 // Trivial case, when From comes from a load and is only used by the
10565 // shuffle. Make it use insertps from the vector that we need from that
10568 NarrowVectorLoadToElement(cast<LoadSDNode>(From), SrcIndex, DAG);
10569 if (!NewLoad.getNode())
10572 if (EVT == MVT::f32) {
10573 // Create this as a scalar to vector to match the instruction pattern.
10574 SDValue LoadScalarToVector =
10575 DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VT, NewLoad);
10576 SDValue InsertpsMask = DAG.getIntPtrConstant(DestIndex << 4);
10577 return DAG.getNode(X86ISD::INSERTPS, dl, VT, To, LoadScalarToVector,
10579 } else { // EVT == MVT::i32
10580 // If we're getting an i32 from memory, use an INSERT_VECTOR_ELT
10581 // instruction, to match the PINSRD instruction, which loads an i32 to a
10582 // certain vector element.
10583 return DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, VT, To, NewLoad,
10584 DAG.getConstant(DestIndex, MVT::i32));
10588 // Vector-element-to-vector
10589 SDValue InsertpsMask = DAG.getIntPtrConstant(DestIndex << 4 | SrcIndex << 6);
10590 return DAG.getNode(X86ISD::INSERTPS, dl, VT, To, From, InsertpsMask);
10593 // Reduce a vector shuffle to zext.
10594 static SDValue LowerVectorIntExtend(SDValue Op, const X86Subtarget *Subtarget,
10595 SelectionDAG &DAG) {
10596 // PMOVZX is only available from SSE41.
10597 if (!Subtarget->hasSSE41())
10600 MVT VT = Op.getSimpleValueType();
10602 // Only AVX2 support 256-bit vector integer extending.
10603 if (!Subtarget->hasInt256() && VT.is256BitVector())
10606 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
10608 SDValue V1 = Op.getOperand(0);
10609 SDValue V2 = Op.getOperand(1);
10610 unsigned NumElems = VT.getVectorNumElements();
10612 // Extending is an unary operation and the element type of the source vector
10613 // won't be equal to or larger than i64.
10614 if (V2.getOpcode() != ISD::UNDEF || !VT.isInteger() ||
10615 VT.getVectorElementType() == MVT::i64)
10618 // Find the expansion ratio, e.g. expanding from i8 to i32 has a ratio of 4.
10619 unsigned Shift = 1; // Start from 2, i.e. 1 << 1.
10620 while ((1U << Shift) < NumElems) {
10621 if (SVOp->getMaskElt(1U << Shift) == 1)
10624 // The maximal ratio is 8, i.e. from i8 to i64.
10629 // Check the shuffle mask.
10630 unsigned Mask = (1U << Shift) - 1;
10631 for (unsigned i = 0; i != NumElems; ++i) {
10632 int EltIdx = SVOp->getMaskElt(i);
10633 if ((i & Mask) != 0 && EltIdx != -1)
10635 if ((i & Mask) == 0 && (unsigned)EltIdx != (i >> Shift))
10639 unsigned NBits = VT.getVectorElementType().getSizeInBits() << Shift;
10640 MVT NeVT = MVT::getIntegerVT(NBits);
10641 MVT NVT = MVT::getVectorVT(NeVT, NumElems >> Shift);
10643 if (!DAG.getTargetLoweringInfo().isTypeLegal(NVT))
10646 // Simplify the operand as it's prepared to be fed into shuffle.
10647 unsigned SignificantBits = NVT.getSizeInBits() >> Shift;
10648 if (V1.getOpcode() == ISD::BITCAST &&
10649 V1.getOperand(0).getOpcode() == ISD::SCALAR_TO_VECTOR &&
10650 V1.getOperand(0).getOperand(0).getOpcode() == ISD::EXTRACT_VECTOR_ELT &&
10651 V1.getOperand(0).getOperand(0)
10652 .getSimpleValueType().getSizeInBits() == SignificantBits) {
10653 // (bitcast (sclr2vec (ext_vec_elt x))) -> (bitcast x)
10654 SDValue V = V1.getOperand(0).getOperand(0).getOperand(0);
10655 ConstantSDNode *CIdx =
10656 dyn_cast<ConstantSDNode>(V1.getOperand(0).getOperand(0).getOperand(1));
10657 // If it's foldable, i.e. normal load with single use, we will let code
10658 // selection to fold it. Otherwise, we will short the conversion sequence.
10659 if (CIdx && CIdx->getZExtValue() == 0 &&
10660 (!ISD::isNormalLoad(V.getNode()) || !V.hasOneUse())) {
10661 MVT FullVT = V.getSimpleValueType();
10662 MVT V1VT = V1.getSimpleValueType();
10663 if (FullVT.getSizeInBits() > V1VT.getSizeInBits()) {
10664 // The "ext_vec_elt" node is wider than the result node.
10665 // In this case we should extract subvector from V.
10666 // (bitcast (sclr2vec (ext_vec_elt x))) -> (bitcast (extract_subvector x)).
10667 unsigned Ratio = FullVT.getSizeInBits() / V1VT.getSizeInBits();
10668 MVT SubVecVT = MVT::getVectorVT(FullVT.getVectorElementType(),
10669 FullVT.getVectorNumElements()/Ratio);
10670 V = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, SubVecVT, V,
10671 DAG.getIntPtrConstant(0));
10673 V1 = DAG.getNode(ISD::BITCAST, DL, V1VT, V);
10677 return DAG.getNode(ISD::BITCAST, DL, VT,
10678 DAG.getNode(X86ISD::VZEXT, DL, NVT, V1));
10681 static SDValue NormalizeVectorShuffle(SDValue Op, const X86Subtarget *Subtarget,
10682 SelectionDAG &DAG) {
10683 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
10684 MVT VT = Op.getSimpleValueType();
10686 SDValue V1 = Op.getOperand(0);
10687 SDValue V2 = Op.getOperand(1);
10689 if (isZeroShuffle(SVOp))
10690 return getZeroVector(VT, Subtarget, DAG, dl);
10692 // Handle splat operations
10693 if (SVOp->isSplat()) {
10694 // Use vbroadcast whenever the splat comes from a foldable load
10695 SDValue Broadcast = LowerVectorBroadcast(Op, Subtarget, DAG);
10696 if (Broadcast.getNode())
10700 // Check integer expanding shuffles.
10701 SDValue NewOp = LowerVectorIntExtend(Op, Subtarget, DAG);
10702 if (NewOp.getNode())
10705 // If the shuffle can be profitably rewritten as a narrower shuffle, then
10707 if (VT == MVT::v8i16 || VT == MVT::v16i8 || VT == MVT::v16i16 ||
10708 VT == MVT::v32i8) {
10709 SDValue NewOp = RewriteAsNarrowerShuffle(SVOp, DAG);
10710 if (NewOp.getNode())
10711 return DAG.getNode(ISD::BITCAST, dl, VT, NewOp);
10712 } else if (VT.is128BitVector() && Subtarget->hasSSE2()) {
10713 // FIXME: Figure out a cleaner way to do this.
10714 if (ISD::isBuildVectorAllZeros(V2.getNode())) {
10715 SDValue NewOp = RewriteAsNarrowerShuffle(SVOp, DAG);
10716 if (NewOp.getNode()) {
10717 MVT NewVT = NewOp.getSimpleValueType();
10718 if (isCommutedMOVLMask(cast<ShuffleVectorSDNode>(NewOp)->getMask(),
10719 NewVT, true, false))
10720 return getVZextMovL(VT, NewVT, NewOp.getOperand(0), DAG, Subtarget,
10723 } else if (ISD::isBuildVectorAllZeros(V1.getNode())) {
10724 SDValue NewOp = RewriteAsNarrowerShuffle(SVOp, DAG);
10725 if (NewOp.getNode()) {
10726 MVT NewVT = NewOp.getSimpleValueType();
10727 if (isMOVLMask(cast<ShuffleVectorSDNode>(NewOp)->getMask(), NewVT))
10728 return getVZextMovL(VT, NewVT, NewOp.getOperand(1), DAG, Subtarget,
10737 X86TargetLowering::LowerVECTOR_SHUFFLE(SDValue Op, SelectionDAG &DAG) const {
10738 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
10739 SDValue V1 = Op.getOperand(0);
10740 SDValue V2 = Op.getOperand(1);
10741 MVT VT = Op.getSimpleValueType();
10743 unsigned NumElems = VT.getVectorNumElements();
10744 bool V1IsUndef = V1.getOpcode() == ISD::UNDEF;
10745 bool V2IsUndef = V2.getOpcode() == ISD::UNDEF;
10746 bool V1IsSplat = false;
10747 bool V2IsSplat = false;
10748 bool HasSSE2 = Subtarget->hasSSE2();
10749 bool HasFp256 = Subtarget->hasFp256();
10750 bool HasInt256 = Subtarget->hasInt256();
10751 MachineFunction &MF = DAG.getMachineFunction();
10752 bool OptForSize = MF.getFunction()->getAttributes().
10753 hasAttribute(AttributeSet::FunctionIndex, Attribute::OptimizeForSize);
10755 // Check if we should use the experimental vector shuffle lowering. If so,
10756 // delegate completely to that code path.
10757 if (ExperimentalVectorShuffleLowering)
10758 return lowerVectorShuffle(Op, Subtarget, DAG);
10760 assert(VT.getSizeInBits() != 64 && "Can't lower MMX shuffles");
10762 if (V1IsUndef && V2IsUndef)
10763 return DAG.getUNDEF(VT);
10765 // When we create a shuffle node we put the UNDEF node to second operand,
10766 // but in some cases the first operand may be transformed to UNDEF.
10767 // In this case we should just commute the node.
10769 return DAG.getCommutedVectorShuffle(*SVOp);
10771 // Vector shuffle lowering takes 3 steps:
10773 // 1) Normalize the input vectors. Here splats, zeroed vectors, profitable
10774 // narrowing and commutation of operands should be handled.
10775 // 2) Matching of shuffles with known shuffle masks to x86 target specific
10777 // 3) Rewriting of unmatched masks into new generic shuffle operations,
10778 // so the shuffle can be broken into other shuffles and the legalizer can
10779 // try the lowering again.
10781 // The general idea is that no vector_shuffle operation should be left to
10782 // be matched during isel, all of them must be converted to a target specific
10785 // Normalize the input vectors. Here splats, zeroed vectors, profitable
10786 // narrowing and commutation of operands should be handled. The actual code
10787 // doesn't include all of those, work in progress...
10788 SDValue NewOp = NormalizeVectorShuffle(Op, Subtarget, DAG);
10789 if (NewOp.getNode())
10792 SmallVector<int, 8> M(SVOp->getMask().begin(), SVOp->getMask().end());
10794 // NOTE: isPSHUFDMask can also match both masks below (unpckl_undef and
10795 // unpckh_undef). Only use pshufd if speed is more important than size.
10796 if (OptForSize && isUNPCKL_v_undef_Mask(M, VT, HasInt256))
10797 return getTargetShuffleNode(X86ISD::UNPCKL, dl, VT, V1, V1, DAG);
10798 if (OptForSize && isUNPCKH_v_undef_Mask(M, VT, HasInt256))
10799 return getTargetShuffleNode(X86ISD::UNPCKH, dl, VT, V1, V1, DAG);
10801 if (isMOVDDUPMask(M, VT) && Subtarget->hasSSE3() &&
10802 V2IsUndef && MayFoldVectorLoad(V1))
10803 return getMOVDDup(Op, dl, V1, DAG);
10805 if (isMOVHLPS_v_undef_Mask(M, VT))
10806 return getMOVHighToLow(Op, dl, DAG);
10808 // Use to match splats
10809 if (HasSSE2 && isUNPCKHMask(M, VT, HasInt256) && V2IsUndef &&
10810 (VT == MVT::v2f64 || VT == MVT::v2i64))
10811 return getTargetShuffleNode(X86ISD::UNPCKH, dl, VT, V1, V1, DAG);
10813 if (isPSHUFDMask(M, VT)) {
10814 // The actual implementation will match the mask in the if above and then
10815 // during isel it can match several different instructions, not only pshufd
10816 // as its name says, sad but true, emulate the behavior for now...
10817 if (isMOVDDUPMask(M, VT) && ((VT == MVT::v4f32 || VT == MVT::v2i64)))
10818 return getTargetShuffleNode(X86ISD::MOVLHPS, dl, VT, V1, V1, DAG);
10820 unsigned TargetMask = getShuffleSHUFImmediate(SVOp);
10822 if (HasSSE2 && (VT == MVT::v4f32 || VT == MVT::v4i32))
10823 return getTargetShuffleNode(X86ISD::PSHUFD, dl, VT, V1, TargetMask, DAG);
10825 if (HasFp256 && (VT == MVT::v4f32 || VT == MVT::v2f64))
10826 return getTargetShuffleNode(X86ISD::VPERMILP, dl, VT, V1, TargetMask,
10829 return getTargetShuffleNode(X86ISD::SHUFP, dl, VT, V1, V1,
10833 if (isPALIGNRMask(M, VT, Subtarget))
10834 return getTargetShuffleNode(X86ISD::PALIGNR, dl, VT, V1, V2,
10835 getShufflePALIGNRImmediate(SVOp),
10838 if (isVALIGNMask(M, VT, Subtarget))
10839 return getTargetShuffleNode(X86ISD::VALIGN, dl, VT, V1, V2,
10840 getShuffleVALIGNImmediate(SVOp),
10843 // Check if this can be converted into a logical shift.
10844 bool isLeft = false;
10845 unsigned ShAmt = 0;
10847 bool isShift = HasSSE2 && isVectorShift(SVOp, DAG, isLeft, ShVal, ShAmt);
10848 if (isShift && ShVal.hasOneUse()) {
10849 // If the shifted value has multiple uses, it may be cheaper to use
10850 // v_set0 + movlhps or movhlps, etc.
10851 MVT EltVT = VT.getVectorElementType();
10852 ShAmt *= EltVT.getSizeInBits();
10853 return getVShift(isLeft, VT, ShVal, ShAmt, DAG, *this, dl);
10856 if (isMOVLMask(M, VT)) {
10857 if (ISD::isBuildVectorAllZeros(V1.getNode()))
10858 return getVZextMovL(VT, VT, V2, DAG, Subtarget, dl);
10859 if (!isMOVLPMask(M, VT)) {
10860 if (HasSSE2 && (VT == MVT::v2i64 || VT == MVT::v2f64))
10861 return getTargetShuffleNode(X86ISD::MOVSD, dl, VT, V1, V2, DAG);
10863 if (VT == MVT::v4i32 || VT == MVT::v4f32)
10864 return getTargetShuffleNode(X86ISD::MOVSS, dl, VT, V1, V2, DAG);
10868 // FIXME: fold these into legal mask.
10869 if (isMOVLHPSMask(M, VT) && !isUNPCKLMask(M, VT, HasInt256))
10870 return getMOVLowToHigh(Op, dl, DAG, HasSSE2);
10872 if (isMOVHLPSMask(M, VT))
10873 return getMOVHighToLow(Op, dl, DAG);
10875 if (V2IsUndef && isMOVSHDUPMask(M, VT, Subtarget))
10876 return getTargetShuffleNode(X86ISD::MOVSHDUP, dl, VT, V1, DAG);
10878 if (V2IsUndef && isMOVSLDUPMask(M, VT, Subtarget))
10879 return getTargetShuffleNode(X86ISD::MOVSLDUP, dl, VT, V1, DAG);
10881 if (isMOVLPMask(M, VT))
10882 return getMOVLP(Op, dl, DAG, HasSSE2);
10884 if (ShouldXformToMOVHLPS(M, VT) ||
10885 ShouldXformToMOVLP(V1.getNode(), V2.getNode(), M, VT))
10886 return DAG.getCommutedVectorShuffle(*SVOp);
10889 // No better options. Use a vshldq / vsrldq.
10890 MVT EltVT = VT.getVectorElementType();
10891 ShAmt *= EltVT.getSizeInBits();
10892 return getVShift(isLeft, VT, ShVal, ShAmt, DAG, *this, dl);
10895 bool Commuted = false;
10896 // FIXME: This should also accept a bitcast of a splat? Be careful, not
10897 // 1,1,1,1 -> v8i16 though.
10898 BitVector UndefElements;
10899 if (auto *BVOp = dyn_cast<BuildVectorSDNode>(V1.getNode()))
10900 if (BVOp->getConstantSplatNode(&UndefElements) && UndefElements.none())
10902 if (auto *BVOp = dyn_cast<BuildVectorSDNode>(V2.getNode()))
10903 if (BVOp->getConstantSplatNode(&UndefElements) && UndefElements.none())
10906 // Canonicalize the splat or undef, if present, to be on the RHS.
10907 if (!V2IsUndef && V1IsSplat && !V2IsSplat) {
10908 CommuteVectorShuffleMask(M, NumElems);
10910 std::swap(V1IsSplat, V2IsSplat);
10914 if (isCommutedMOVLMask(M, VT, V2IsSplat, V2IsUndef)) {
10915 // Shuffling low element of v1 into undef, just return v1.
10918 // If V2 is a splat, the mask may be malformed such as <4,3,3,3>, which
10919 // the instruction selector will not match, so get a canonical MOVL with
10920 // swapped operands to undo the commute.
10921 return getMOVL(DAG, dl, VT, V2, V1);
10924 if (isUNPCKLMask(M, VT, HasInt256))
10925 return getTargetShuffleNode(X86ISD::UNPCKL, dl, VT, V1, V2, DAG);
10927 if (isUNPCKHMask(M, VT, HasInt256))
10928 return getTargetShuffleNode(X86ISD::UNPCKH, dl, VT, V1, V2, DAG);
10931 // Normalize mask so all entries that point to V2 points to its first
10932 // element then try to match unpck{h|l} again. If match, return a
10933 // new vector_shuffle with the corrected mask.p
10934 SmallVector<int, 8> NewMask(M.begin(), M.end());
10935 NormalizeMask(NewMask, NumElems);
10936 if (isUNPCKLMask(NewMask, VT, HasInt256, true))
10937 return getTargetShuffleNode(X86ISD::UNPCKL, dl, VT, V1, V2, DAG);
10938 if (isUNPCKHMask(NewMask, VT, HasInt256, true))
10939 return getTargetShuffleNode(X86ISD::UNPCKH, dl, VT, V1, V2, DAG);
10943 // Commute is back and try unpck* again.
10944 // FIXME: this seems wrong.
10945 CommuteVectorShuffleMask(M, NumElems);
10947 std::swap(V1IsSplat, V2IsSplat);
10949 if (isUNPCKLMask(M, VT, HasInt256))
10950 return getTargetShuffleNode(X86ISD::UNPCKL, dl, VT, V1, V2, DAG);
10952 if (isUNPCKHMask(M, VT, HasInt256))
10953 return getTargetShuffleNode(X86ISD::UNPCKH, dl, VT, V1, V2, DAG);
10956 // Normalize the node to match x86 shuffle ops if needed
10957 if (!V2IsUndef && (isSHUFPMask(M, VT, /* Commuted */ true)))
10958 return DAG.getCommutedVectorShuffle(*SVOp);
10960 // The checks below are all present in isShuffleMaskLegal, but they are
10961 // inlined here right now to enable us to directly emit target specific
10962 // nodes, and remove one by one until they don't return Op anymore.
10964 if (ShuffleVectorSDNode::isSplatMask(&M[0], VT) &&
10965 SVOp->getSplatIndex() == 0 && V2IsUndef) {
10966 if (VT == MVT::v2f64 || VT == MVT::v2i64)
10967 return getTargetShuffleNode(X86ISD::UNPCKL, dl, VT, V1, V1, DAG);
10970 if (isPSHUFHWMask(M, VT, HasInt256))
10971 return getTargetShuffleNode(X86ISD::PSHUFHW, dl, VT, V1,
10972 getShufflePSHUFHWImmediate(SVOp),
10975 if (isPSHUFLWMask(M, VT, HasInt256))
10976 return getTargetShuffleNode(X86ISD::PSHUFLW, dl, VT, V1,
10977 getShufflePSHUFLWImmediate(SVOp),
10980 unsigned MaskValue;
10981 if (isBlendMask(M, VT, Subtarget->hasSSE41(), Subtarget->hasInt256(),
10983 return LowerVECTOR_SHUFFLEtoBlend(SVOp, MaskValue, Subtarget, DAG);
10985 if (isSHUFPMask(M, VT))
10986 return getTargetShuffleNode(X86ISD::SHUFP, dl, VT, V1, V2,
10987 getShuffleSHUFImmediate(SVOp), DAG);
10989 if (isUNPCKL_v_undef_Mask(M, VT, HasInt256))
10990 return getTargetShuffleNode(X86ISD::UNPCKL, dl, VT, V1, V1, DAG);
10991 if (isUNPCKH_v_undef_Mask(M, VT, HasInt256))
10992 return getTargetShuffleNode(X86ISD::UNPCKH, dl, VT, V1, V1, DAG);
10994 //===--------------------------------------------------------------------===//
10995 // Generate target specific nodes for 128 or 256-bit shuffles only
10996 // supported in the AVX instruction set.
10999 // Handle VMOVDDUPY permutations
11000 if (V2IsUndef && isMOVDDUPYMask(M, VT, HasFp256))
11001 return getTargetShuffleNode(X86ISD::MOVDDUP, dl, VT, V1, DAG);
11003 // Handle VPERMILPS/D* permutations
11004 if (isVPERMILPMask(M, VT)) {
11005 if ((HasInt256 && VT == MVT::v8i32) || VT == MVT::v16i32)
11006 return getTargetShuffleNode(X86ISD::PSHUFD, dl, VT, V1,
11007 getShuffleSHUFImmediate(SVOp), DAG);
11008 return getTargetShuffleNode(X86ISD::VPERMILP, dl, VT, V1,
11009 getShuffleSHUFImmediate(SVOp), DAG);
11013 if (VT.is512BitVector() && isINSERT64x4Mask(M, VT, &Idx))
11014 return Insert256BitVector(V1, Extract256BitVector(V2, 0, DAG, dl),
11015 Idx*(NumElems/2), DAG, dl);
11017 // Handle VPERM2F128/VPERM2I128 permutations
11018 if (isVPERM2X128Mask(M, VT, HasFp256))
11019 return getTargetShuffleNode(X86ISD::VPERM2X128, dl, VT, V1,
11020 V2, getShuffleVPERM2X128Immediate(SVOp), DAG);
11022 if (Subtarget->hasSSE41() && isINSERTPSMask(M, VT))
11023 return getINSERTPS(SVOp, dl, DAG);
11026 if (V2IsUndef && HasInt256 && isPermImmMask(M, VT, Imm8))
11027 return getTargetShuffleNode(X86ISD::VPERMI, dl, VT, V1, Imm8, DAG);
11029 if ((V2IsUndef && HasInt256 && VT.is256BitVector() && NumElems == 8) ||
11030 VT.is512BitVector()) {
11031 MVT MaskEltVT = MVT::getIntegerVT(VT.getVectorElementType().getSizeInBits());
11032 MVT MaskVectorVT = MVT::getVectorVT(MaskEltVT, NumElems);
11033 SmallVector<SDValue, 16> permclMask;
11034 for (unsigned i = 0; i != NumElems; ++i) {
11035 permclMask.push_back(DAG.getConstant((M[i]>=0) ? M[i] : 0, MaskEltVT));
11038 SDValue Mask = DAG.getNode(ISD::BUILD_VECTOR, dl, MaskVectorVT, permclMask);
11040 // Bitcast is for VPERMPS since mask is v8i32 but node takes v8f32
11041 return DAG.getNode(X86ISD::VPERMV, dl, VT,
11042 DAG.getNode(ISD::BITCAST, dl, VT, Mask), V1);
11043 return DAG.getNode(X86ISD::VPERMV3, dl, VT, V1,
11044 DAG.getNode(ISD::BITCAST, dl, VT, Mask), V2);
11047 //===--------------------------------------------------------------------===//
11048 // Since no target specific shuffle was selected for this generic one,
11049 // lower it into other known shuffles. FIXME: this isn't true yet, but
11050 // this is the plan.
11053 // Handle v8i16 specifically since SSE can do byte extraction and insertion.
11054 if (VT == MVT::v8i16) {
11055 SDValue NewOp = LowerVECTOR_SHUFFLEv8i16(Op, Subtarget, DAG);
11056 if (NewOp.getNode())
11060 if (VT == MVT::v16i16 && Subtarget->hasInt256()) {
11061 SDValue NewOp = LowerVECTOR_SHUFFLEv16i16(Op, DAG);
11062 if (NewOp.getNode())
11066 if (VT == MVT::v16i8) {
11067 SDValue NewOp = LowerVECTOR_SHUFFLEv16i8(SVOp, Subtarget, DAG);
11068 if (NewOp.getNode())
11072 if (VT == MVT::v32i8) {
11073 SDValue NewOp = LowerVECTOR_SHUFFLEv32i8(SVOp, Subtarget, DAG);
11074 if (NewOp.getNode())
11078 // Handle all 128-bit wide vectors with 4 elements, and match them with
11079 // several different shuffle types.
11080 if (NumElems == 4 && VT.is128BitVector())
11081 return LowerVECTOR_SHUFFLE_128v4(SVOp, DAG);
11083 // Handle general 256-bit shuffles
11084 if (VT.is256BitVector())
11085 return LowerVECTOR_SHUFFLE_256(SVOp, DAG);
11090 // This function assumes its argument is a BUILD_VECTOR of constants or
11091 // undef SDNodes. i.e: ISD::isBuildVectorOfConstantSDNodes(BuildVector) is
11093 static bool BUILD_VECTORtoBlendMask(BuildVectorSDNode *BuildVector,
11094 unsigned &MaskValue) {
11096 unsigned NumElems = BuildVector->getNumOperands();
11097 // There are 2 lanes if (NumElems > 8), and 1 lane otherwise.
11098 unsigned NumLanes = (NumElems - 1) / 8 + 1;
11099 unsigned NumElemsInLane = NumElems / NumLanes;
11101 // Blend for v16i16 should be symetric for the both lanes.
11102 for (unsigned i = 0; i < NumElemsInLane; ++i) {
11103 SDValue EltCond = BuildVector->getOperand(i);
11104 SDValue SndLaneEltCond =
11105 (NumLanes == 2) ? BuildVector->getOperand(i + NumElemsInLane) : EltCond;
11107 int Lane1Cond = -1, Lane2Cond = -1;
11108 if (isa<ConstantSDNode>(EltCond))
11109 Lane1Cond = !isZero(EltCond);
11110 if (isa<ConstantSDNode>(SndLaneEltCond))
11111 Lane2Cond = !isZero(SndLaneEltCond);
11113 if (Lane1Cond == Lane2Cond || Lane2Cond < 0)
11114 // Lane1Cond != 0, means we want the first argument.
11115 // Lane1Cond == 0, means we want the second argument.
11116 // The encoding of this argument is 0 for the first argument, 1
11117 // for the second. Therefore, invert the condition.
11118 MaskValue |= !Lane1Cond << i;
11119 else if (Lane1Cond < 0)
11120 MaskValue |= !Lane2Cond << i;
11127 // Try to lower a vselect node into a simple blend instruction.
11128 static SDValue LowerVSELECTtoBlend(SDValue Op, const X86Subtarget *Subtarget,
11129 SelectionDAG &DAG) {
11130 SDValue Cond = Op.getOperand(0);
11131 SDValue LHS = Op.getOperand(1);
11132 SDValue RHS = Op.getOperand(2);
11134 MVT VT = Op.getSimpleValueType();
11135 MVT EltVT = VT.getVectorElementType();
11136 unsigned NumElems = VT.getVectorNumElements();
11138 // There is no blend with immediate in AVX-512.
11139 if (VT.is512BitVector())
11142 if (!Subtarget->hasSSE41() || EltVT == MVT::i8)
11144 if (!Subtarget->hasInt256() && VT == MVT::v16i16)
11147 if (!ISD::isBuildVectorOfConstantSDNodes(Cond.getNode()))
11150 // Check the mask for BLEND and build the value.
11151 unsigned MaskValue = 0;
11152 if (!BUILD_VECTORtoBlendMask(cast<BuildVectorSDNode>(Cond), MaskValue))
11155 // Convert i32 vectors to floating point if it is not AVX2.
11156 // AVX2 introduced VPBLENDD instruction for 128 and 256-bit vectors.
11158 if (EltVT == MVT::i64 || (EltVT == MVT::i32 && !Subtarget->hasInt256())) {
11159 BlendVT = MVT::getVectorVT(MVT::getFloatingPointVT(EltVT.getSizeInBits()),
11161 LHS = DAG.getNode(ISD::BITCAST, dl, VT, LHS);
11162 RHS = DAG.getNode(ISD::BITCAST, dl, VT, RHS);
11165 SDValue Ret = DAG.getNode(X86ISD::BLENDI, dl, BlendVT, LHS, RHS,
11166 DAG.getConstant(MaskValue, MVT::i32));
11167 return DAG.getNode(ISD::BITCAST, dl, VT, Ret);
11170 SDValue X86TargetLowering::LowerVSELECT(SDValue Op, SelectionDAG &DAG) const {
11171 // A vselect where all conditions and data are constants can be optimized into
11172 // a single vector load by SelectionDAGLegalize::ExpandBUILD_VECTOR().
11173 if (ISD::isBuildVectorOfConstantSDNodes(Op.getOperand(0).getNode()) &&
11174 ISD::isBuildVectorOfConstantSDNodes(Op.getOperand(1).getNode()) &&
11175 ISD::isBuildVectorOfConstantSDNodes(Op.getOperand(2).getNode()))
11178 SDValue BlendOp = LowerVSELECTtoBlend(Op, Subtarget, DAG);
11179 if (BlendOp.getNode())
11182 // Some types for vselect were previously set to Expand, not Legal or
11183 // Custom. Return an empty SDValue so we fall-through to Expand, after
11184 // the Custom lowering phase.
11185 MVT VT = Op.getSimpleValueType();
11186 switch (VT.SimpleTy) {
11191 if (Subtarget->hasBWI() && Subtarget->hasVLX())
11196 // We couldn't create a "Blend with immediate" node.
11197 // This node should still be legal, but we'll have to emit a blendv*
11202 static SDValue LowerEXTRACT_VECTOR_ELT_SSE4(SDValue Op, SelectionDAG &DAG) {
11203 MVT VT = Op.getSimpleValueType();
11206 if (!Op.getOperand(0).getSimpleValueType().is128BitVector())
11209 if (VT.getSizeInBits() == 8) {
11210 SDValue Extract = DAG.getNode(X86ISD::PEXTRB, dl, MVT::i32,
11211 Op.getOperand(0), Op.getOperand(1));
11212 SDValue Assert = DAG.getNode(ISD::AssertZext, dl, MVT::i32, Extract,
11213 DAG.getValueType(VT));
11214 return DAG.getNode(ISD::TRUNCATE, dl, VT, Assert);
11217 if (VT.getSizeInBits() == 16) {
11218 unsigned Idx = cast<ConstantSDNode>(Op.getOperand(1))->getZExtValue();
11219 // If Idx is 0, it's cheaper to do a move instead of a pextrw.
11221 return DAG.getNode(ISD::TRUNCATE, dl, MVT::i16,
11222 DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::i32,
11223 DAG.getNode(ISD::BITCAST, dl,
11226 Op.getOperand(1)));
11227 SDValue Extract = DAG.getNode(X86ISD::PEXTRW, dl, MVT::i32,
11228 Op.getOperand(0), Op.getOperand(1));
11229 SDValue Assert = DAG.getNode(ISD::AssertZext, dl, MVT::i32, Extract,
11230 DAG.getValueType(VT));
11231 return DAG.getNode(ISD::TRUNCATE, dl, VT, Assert);
11234 if (VT == MVT::f32) {
11235 // EXTRACTPS outputs to a GPR32 register which will require a movd to copy
11236 // the result back to FR32 register. It's only worth matching if the
11237 // result has a single use which is a store or a bitcast to i32. And in
11238 // the case of a store, it's not worth it if the index is a constant 0,
11239 // because a MOVSSmr can be used instead, which is smaller and faster.
11240 if (!Op.hasOneUse())
11242 SDNode *User = *Op.getNode()->use_begin();
11243 if ((User->getOpcode() != ISD::STORE ||
11244 (isa<ConstantSDNode>(Op.getOperand(1)) &&
11245 cast<ConstantSDNode>(Op.getOperand(1))->isNullValue())) &&
11246 (User->getOpcode() != ISD::BITCAST ||
11247 User->getValueType(0) != MVT::i32))
11249 SDValue Extract = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::i32,
11250 DAG.getNode(ISD::BITCAST, dl, MVT::v4i32,
11253 return DAG.getNode(ISD::BITCAST, dl, MVT::f32, Extract);
11256 if (VT == MVT::i32 || VT == MVT::i64) {
11257 // ExtractPS/pextrq works with constant index.
11258 if (isa<ConstantSDNode>(Op.getOperand(1)))
11264 /// Extract one bit from mask vector, like v16i1 or v8i1.
11265 /// AVX-512 feature.
11267 X86TargetLowering::ExtractBitFromMaskVector(SDValue Op, SelectionDAG &DAG) const {
11268 SDValue Vec = Op.getOperand(0);
11270 MVT VecVT = Vec.getSimpleValueType();
11271 SDValue Idx = Op.getOperand(1);
11272 MVT EltVT = Op.getSimpleValueType();
11274 assert((EltVT == MVT::i1) && "Unexpected operands in ExtractBitFromMaskVector");
11276 // variable index can't be handled in mask registers,
11277 // extend vector to VR512
11278 if (!isa<ConstantSDNode>(Idx)) {
11279 MVT ExtVT = (VecVT == MVT::v8i1 ? MVT::v8i64 : MVT::v16i32);
11280 SDValue Ext = DAG.getNode(ISD::ZERO_EXTEND, dl, ExtVT, Vec);
11281 SDValue Elt = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl,
11282 ExtVT.getVectorElementType(), Ext, Idx);
11283 return DAG.getNode(ISD::TRUNCATE, dl, EltVT, Elt);
11286 unsigned IdxVal = cast<ConstantSDNode>(Idx)->getZExtValue();
11287 const TargetRegisterClass* rc = getRegClassFor(VecVT);
11288 unsigned MaxSift = rc->getSize()*8 - 1;
11289 Vec = DAG.getNode(X86ISD::VSHLI, dl, VecVT, Vec,
11290 DAG.getConstant(MaxSift - IdxVal, MVT::i8));
11291 Vec = DAG.getNode(X86ISD::VSRLI, dl, VecVT, Vec,
11292 DAG.getConstant(MaxSift, MVT::i8));
11293 return DAG.getNode(X86ISD::VEXTRACT, dl, MVT::i1, Vec,
11294 DAG.getIntPtrConstant(0));
11298 X86TargetLowering::LowerEXTRACT_VECTOR_ELT(SDValue Op,
11299 SelectionDAG &DAG) const {
11301 SDValue Vec = Op.getOperand(0);
11302 MVT VecVT = Vec.getSimpleValueType();
11303 SDValue Idx = Op.getOperand(1);
11305 if (Op.getSimpleValueType() == MVT::i1)
11306 return ExtractBitFromMaskVector(Op, DAG);
11308 if (!isa<ConstantSDNode>(Idx)) {
11309 if (VecVT.is512BitVector() ||
11310 (VecVT.is256BitVector() && Subtarget->hasInt256() &&
11311 VecVT.getVectorElementType().getSizeInBits() == 32)) {
11314 MVT::getIntegerVT(VecVT.getVectorElementType().getSizeInBits());
11315 MVT MaskVT = MVT::getVectorVT(MaskEltVT, VecVT.getSizeInBits() /
11316 MaskEltVT.getSizeInBits());
11318 Idx = DAG.getZExtOrTrunc(Idx, dl, MaskEltVT);
11319 SDValue Mask = DAG.getNode(X86ISD::VINSERT, dl, MaskVT,
11320 getZeroVector(MaskVT, Subtarget, DAG, dl),
11321 Idx, DAG.getConstant(0, getPointerTy()));
11322 SDValue Perm = DAG.getNode(X86ISD::VPERMV, dl, VecVT, Mask, Vec);
11323 return DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, Op.getValueType(),
11324 Perm, DAG.getConstant(0, getPointerTy()));
11329 // If this is a 256-bit vector result, first extract the 128-bit vector and
11330 // then extract the element from the 128-bit vector.
11331 if (VecVT.is256BitVector() || VecVT.is512BitVector()) {
11333 unsigned IdxVal = cast<ConstantSDNode>(Idx)->getZExtValue();
11334 // Get the 128-bit vector.
11335 Vec = Extract128BitVector(Vec, IdxVal, DAG, dl);
11336 MVT EltVT = VecVT.getVectorElementType();
11338 unsigned ElemsPerChunk = 128 / EltVT.getSizeInBits();
11340 //if (IdxVal >= NumElems/2)
11341 // IdxVal -= NumElems/2;
11342 IdxVal -= (IdxVal/ElemsPerChunk)*ElemsPerChunk;
11343 return DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, Op.getValueType(), Vec,
11344 DAG.getConstant(IdxVal, MVT::i32));
11347 assert(VecVT.is128BitVector() && "Unexpected vector length");
11349 if (Subtarget->hasSSE41()) {
11350 SDValue Res = LowerEXTRACT_VECTOR_ELT_SSE4(Op, DAG);
11355 MVT VT = Op.getSimpleValueType();
11356 // TODO: handle v16i8.
11357 if (VT.getSizeInBits() == 16) {
11358 SDValue Vec = Op.getOperand(0);
11359 unsigned Idx = cast<ConstantSDNode>(Op.getOperand(1))->getZExtValue();
11361 return DAG.getNode(ISD::TRUNCATE, dl, MVT::i16,
11362 DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::i32,
11363 DAG.getNode(ISD::BITCAST, dl,
11365 Op.getOperand(1)));
11366 // Transform it so it match pextrw which produces a 32-bit result.
11367 MVT EltVT = MVT::i32;
11368 SDValue Extract = DAG.getNode(X86ISD::PEXTRW, dl, EltVT,
11369 Op.getOperand(0), Op.getOperand(1));
11370 SDValue Assert = DAG.getNode(ISD::AssertZext, dl, EltVT, Extract,
11371 DAG.getValueType(VT));
11372 return DAG.getNode(ISD::TRUNCATE, dl, VT, Assert);
11375 if (VT.getSizeInBits() == 32) {
11376 unsigned Idx = cast<ConstantSDNode>(Op.getOperand(1))->getZExtValue();
11380 // SHUFPS the element to the lowest double word, then movss.
11381 int Mask[4] = { static_cast<int>(Idx), -1, -1, -1 };
11382 MVT VVT = Op.getOperand(0).getSimpleValueType();
11383 SDValue Vec = DAG.getVectorShuffle(VVT, dl, Op.getOperand(0),
11384 DAG.getUNDEF(VVT), Mask);
11385 return DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, VT, Vec,
11386 DAG.getIntPtrConstant(0));
11389 if (VT.getSizeInBits() == 64) {
11390 // FIXME: .td only matches this for <2 x f64>, not <2 x i64> on 32b
11391 // FIXME: seems like this should be unnecessary if mov{h,l}pd were taught
11392 // to match extract_elt for f64.
11393 unsigned Idx = cast<ConstantSDNode>(Op.getOperand(1))->getZExtValue();
11397 // UNPCKHPD the element to the lowest double word, then movsd.
11398 // Note if the lower 64 bits of the result of the UNPCKHPD is then stored
11399 // to a f64mem, the whole operation is folded into a single MOVHPDmr.
11400 int Mask[2] = { 1, -1 };
11401 MVT VVT = Op.getOperand(0).getSimpleValueType();
11402 SDValue Vec = DAG.getVectorShuffle(VVT, dl, Op.getOperand(0),
11403 DAG.getUNDEF(VVT), Mask);
11404 return DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, VT, Vec,
11405 DAG.getIntPtrConstant(0));
11411 /// Insert one bit to mask vector, like v16i1 or v8i1.
11412 /// AVX-512 feature.
11414 X86TargetLowering::InsertBitToMaskVector(SDValue Op, SelectionDAG &DAG) const {
11416 SDValue Vec = Op.getOperand(0);
11417 SDValue Elt = Op.getOperand(1);
11418 SDValue Idx = Op.getOperand(2);
11419 MVT VecVT = Vec.getSimpleValueType();
11421 if (!isa<ConstantSDNode>(Idx)) {
11422 // Non constant index. Extend source and destination,
11423 // insert element and then truncate the result.
11424 MVT ExtVecVT = (VecVT == MVT::v8i1 ? MVT::v8i64 : MVT::v16i32);
11425 MVT ExtEltVT = (VecVT == MVT::v8i1 ? MVT::i64 : MVT::i32);
11426 SDValue ExtOp = DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, ExtVecVT,
11427 DAG.getNode(ISD::ZERO_EXTEND, dl, ExtVecVT, Vec),
11428 DAG.getNode(ISD::ZERO_EXTEND, dl, ExtEltVT, Elt), Idx);
11429 return DAG.getNode(ISD::TRUNCATE, dl, VecVT, ExtOp);
11432 unsigned IdxVal = cast<ConstantSDNode>(Idx)->getZExtValue();
11433 SDValue EltInVec = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VecVT, Elt);
11434 if (Vec.getOpcode() == ISD::UNDEF)
11435 return DAG.getNode(X86ISD::VSHLI, dl, VecVT, EltInVec,
11436 DAG.getConstant(IdxVal, MVT::i8));
11437 const TargetRegisterClass* rc = getRegClassFor(VecVT);
11438 unsigned MaxSift = rc->getSize()*8 - 1;
11439 EltInVec = DAG.getNode(X86ISD::VSHLI, dl, VecVT, EltInVec,
11440 DAG.getConstant(MaxSift, MVT::i8));
11441 EltInVec = DAG.getNode(X86ISD::VSRLI, dl, VecVT, EltInVec,
11442 DAG.getConstant(MaxSift - IdxVal, MVT::i8));
11443 return DAG.getNode(ISD::OR, dl, VecVT, Vec, EltInVec);
11446 SDValue X86TargetLowering::LowerINSERT_VECTOR_ELT(SDValue Op,
11447 SelectionDAG &DAG) const {
11448 MVT VT = Op.getSimpleValueType();
11449 MVT EltVT = VT.getVectorElementType();
11451 if (EltVT == MVT::i1)
11452 return InsertBitToMaskVector(Op, DAG);
11455 SDValue N0 = Op.getOperand(0);
11456 SDValue N1 = Op.getOperand(1);
11457 SDValue N2 = Op.getOperand(2);
11458 if (!isa<ConstantSDNode>(N2))
11460 auto *N2C = cast<ConstantSDNode>(N2);
11461 unsigned IdxVal = N2C->getZExtValue();
11463 // If the vector is wider than 128 bits, extract the 128-bit subvector, insert
11464 // into that, and then insert the subvector back into the result.
11465 if (VT.is256BitVector() || VT.is512BitVector()) {
11466 // Get the desired 128-bit vector half.
11467 SDValue V = Extract128BitVector(N0, IdxVal, DAG, dl);
11469 // Insert the element into the desired half.
11470 unsigned NumEltsIn128 = 128 / EltVT.getSizeInBits();
11471 unsigned IdxIn128 = IdxVal - (IdxVal / NumEltsIn128) * NumEltsIn128;
11473 V = DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, V.getValueType(), V, N1,
11474 DAG.getConstant(IdxIn128, MVT::i32));
11476 // Insert the changed part back to the 256-bit vector
11477 return Insert128BitVector(N0, V, IdxVal, DAG, dl);
11479 assert(VT.is128BitVector() && "Only 128-bit vector types should be left!");
11481 if (Subtarget->hasSSE41()) {
11482 if (EltVT.getSizeInBits() == 8 || EltVT.getSizeInBits() == 16) {
11484 if (VT == MVT::v8i16) {
11485 Opc = X86ISD::PINSRW;
11487 assert(VT == MVT::v16i8);
11488 Opc = X86ISD::PINSRB;
11491 // Transform it so it match pinsr{b,w} which expects a GR32 as its second
11493 if (N1.getValueType() != MVT::i32)
11494 N1 = DAG.getNode(ISD::ANY_EXTEND, dl, MVT::i32, N1);
11495 if (N2.getValueType() != MVT::i32)
11496 N2 = DAG.getIntPtrConstant(IdxVal);
11497 return DAG.getNode(Opc, dl, VT, N0, N1, N2);
11500 if (EltVT == MVT::f32) {
11501 // Bits [7:6] of the constant are the source select. This will always be
11502 // zero here. The DAG Combiner may combine an extract_elt index into
11504 // bits. For example (insert (extract, 3), 2) could be matched by
11506 // the '3' into bits [7:6] of X86ISD::INSERTPS.
11507 // Bits [5:4] of the constant are the destination select. This is the
11508 // value of the incoming immediate.
11509 // Bits [3:0] of the constant are the zero mask. The DAG Combiner may
11510 // combine either bitwise AND or insert of float 0.0 to set these bits.
11511 N2 = DAG.getIntPtrConstant(IdxVal << 4);
11512 // Create this as a scalar to vector..
11513 N1 = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, MVT::v4f32, N1);
11514 return DAG.getNode(X86ISD::INSERTPS, dl, VT, N0, N1, N2);
11517 if (EltVT == MVT::i32 || EltVT == MVT::i64) {
11518 // PINSR* works with constant index.
11523 if (EltVT == MVT::i8)
11526 if (EltVT.getSizeInBits() == 16) {
11527 // Transform it so it match pinsrw which expects a 16-bit value in a GR32
11528 // as its second argument.
11529 if (N1.getValueType() != MVT::i32)
11530 N1 = DAG.getNode(ISD::ANY_EXTEND, dl, MVT::i32, N1);
11531 if (N2.getValueType() != MVT::i32)
11532 N2 = DAG.getIntPtrConstant(IdxVal);
11533 return DAG.getNode(X86ISD::PINSRW, dl, VT, N0, N1, N2);
11538 static SDValue LowerSCALAR_TO_VECTOR(SDValue Op, SelectionDAG &DAG) {
11540 MVT OpVT = Op.getSimpleValueType();
11542 // If this is a 256-bit vector result, first insert into a 128-bit
11543 // vector and then insert into the 256-bit vector.
11544 if (!OpVT.is128BitVector()) {
11545 // Insert into a 128-bit vector.
11546 unsigned SizeFactor = OpVT.getSizeInBits()/128;
11547 MVT VT128 = MVT::getVectorVT(OpVT.getVectorElementType(),
11548 OpVT.getVectorNumElements() / SizeFactor);
11550 Op = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VT128, Op.getOperand(0));
11552 // Insert the 128-bit vector.
11553 return Insert128BitVector(DAG.getUNDEF(OpVT), Op, 0, DAG, dl);
11556 if (OpVT == MVT::v1i64 &&
11557 Op.getOperand(0).getValueType() == MVT::i64)
11558 return DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, MVT::v1i64, Op.getOperand(0));
11560 SDValue AnyExt = DAG.getNode(ISD::ANY_EXTEND, dl, MVT::i32, Op.getOperand(0));
11561 assert(OpVT.is128BitVector() && "Expected an SSE type!");
11562 return DAG.getNode(ISD::BITCAST, dl, OpVT,
11563 DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, MVT::v4i32,AnyExt));
11566 // Lower a node with an EXTRACT_SUBVECTOR opcode. This may result in
11567 // a simple subregister reference or explicit instructions to grab
11568 // upper bits of a vector.
11569 static SDValue LowerEXTRACT_SUBVECTOR(SDValue Op, const X86Subtarget *Subtarget,
11570 SelectionDAG &DAG) {
11572 SDValue In = Op.getOperand(0);
11573 SDValue Idx = Op.getOperand(1);
11574 unsigned IdxVal = cast<ConstantSDNode>(Idx)->getZExtValue();
11575 MVT ResVT = Op.getSimpleValueType();
11576 MVT InVT = In.getSimpleValueType();
11578 if (Subtarget->hasFp256()) {
11579 if (ResVT.is128BitVector() &&
11580 (InVT.is256BitVector() || InVT.is512BitVector()) &&
11581 isa<ConstantSDNode>(Idx)) {
11582 return Extract128BitVector(In, IdxVal, DAG, dl);
11584 if (ResVT.is256BitVector() && InVT.is512BitVector() &&
11585 isa<ConstantSDNode>(Idx)) {
11586 return Extract256BitVector(In, IdxVal, DAG, dl);
11592 // Lower a node with an INSERT_SUBVECTOR opcode. This may result in a
11593 // simple superregister reference or explicit instructions to insert
11594 // the upper bits of a vector.
11595 static SDValue LowerINSERT_SUBVECTOR(SDValue Op, const X86Subtarget *Subtarget,
11596 SelectionDAG &DAG) {
11597 if (Subtarget->hasFp256()) {
11598 SDLoc dl(Op.getNode());
11599 SDValue Vec = Op.getNode()->getOperand(0);
11600 SDValue SubVec = Op.getNode()->getOperand(1);
11601 SDValue Idx = Op.getNode()->getOperand(2);
11603 if ((Op.getNode()->getSimpleValueType(0).is256BitVector() ||
11604 Op.getNode()->getSimpleValueType(0).is512BitVector()) &&
11605 SubVec.getNode()->getSimpleValueType(0).is128BitVector() &&
11606 isa<ConstantSDNode>(Idx)) {
11607 unsigned IdxVal = cast<ConstantSDNode>(Idx)->getZExtValue();
11608 return Insert128BitVector(Vec, SubVec, IdxVal, DAG, dl);
11611 if (Op.getNode()->getSimpleValueType(0).is512BitVector() &&
11612 SubVec.getNode()->getSimpleValueType(0).is256BitVector() &&
11613 isa<ConstantSDNode>(Idx)) {
11614 unsigned IdxVal = cast<ConstantSDNode>(Idx)->getZExtValue();
11615 return Insert256BitVector(Vec, SubVec, IdxVal, DAG, dl);
11621 // ConstantPool, JumpTable, GlobalAddress, and ExternalSymbol are lowered as
11622 // their target countpart wrapped in the X86ISD::Wrapper node. Suppose N is
11623 // one of the above mentioned nodes. It has to be wrapped because otherwise
11624 // Select(N) returns N. So the raw TargetGlobalAddress nodes, etc. can only
11625 // be used to form addressing mode. These wrapped nodes will be selected
11628 X86TargetLowering::LowerConstantPool(SDValue Op, SelectionDAG &DAG) const {
11629 ConstantPoolSDNode *CP = cast<ConstantPoolSDNode>(Op);
11631 // In PIC mode (unless we're in RIPRel PIC mode) we add an offset to the
11632 // global base reg.
11633 unsigned char OpFlag = 0;
11634 unsigned WrapperKind = X86ISD::Wrapper;
11635 CodeModel::Model M = DAG.getTarget().getCodeModel();
11637 if (Subtarget->isPICStyleRIPRel() &&
11638 (M == CodeModel::Small || M == CodeModel::Kernel))
11639 WrapperKind = X86ISD::WrapperRIP;
11640 else if (Subtarget->isPICStyleGOT())
11641 OpFlag = X86II::MO_GOTOFF;
11642 else if (Subtarget->isPICStyleStubPIC())
11643 OpFlag = X86II::MO_PIC_BASE_OFFSET;
11645 SDValue Result = DAG.getTargetConstantPool(CP->getConstVal(), getPointerTy(),
11646 CP->getAlignment(),
11647 CP->getOffset(), OpFlag);
11649 Result = DAG.getNode(WrapperKind, DL, getPointerTy(), Result);
11650 // With PIC, the address is actually $g + Offset.
11652 Result = DAG.getNode(ISD::ADD, DL, getPointerTy(),
11653 DAG.getNode(X86ISD::GlobalBaseReg,
11654 SDLoc(), getPointerTy()),
11661 SDValue X86TargetLowering::LowerJumpTable(SDValue Op, SelectionDAG &DAG) const {
11662 JumpTableSDNode *JT = cast<JumpTableSDNode>(Op);
11664 // In PIC mode (unless we're in RIPRel PIC mode) we add an offset to the
11665 // global base reg.
11666 unsigned char OpFlag = 0;
11667 unsigned WrapperKind = X86ISD::Wrapper;
11668 CodeModel::Model M = DAG.getTarget().getCodeModel();
11670 if (Subtarget->isPICStyleRIPRel() &&
11671 (M == CodeModel::Small || M == CodeModel::Kernel))
11672 WrapperKind = X86ISD::WrapperRIP;
11673 else if (Subtarget->isPICStyleGOT())
11674 OpFlag = X86II::MO_GOTOFF;
11675 else if (Subtarget->isPICStyleStubPIC())
11676 OpFlag = X86II::MO_PIC_BASE_OFFSET;
11678 SDValue Result = DAG.getTargetJumpTable(JT->getIndex(), getPointerTy(),
11681 Result = DAG.getNode(WrapperKind, DL, getPointerTy(), Result);
11683 // With PIC, the address is actually $g + Offset.
11685 Result = DAG.getNode(ISD::ADD, DL, getPointerTy(),
11686 DAG.getNode(X86ISD::GlobalBaseReg,
11687 SDLoc(), getPointerTy()),
11694 X86TargetLowering::LowerExternalSymbol(SDValue Op, SelectionDAG &DAG) const {
11695 const char *Sym = cast<ExternalSymbolSDNode>(Op)->getSymbol();
11697 // In PIC mode (unless we're in RIPRel PIC mode) we add an offset to the
11698 // global base reg.
11699 unsigned char OpFlag = 0;
11700 unsigned WrapperKind = X86ISD::Wrapper;
11701 CodeModel::Model M = DAG.getTarget().getCodeModel();
11703 if (Subtarget->isPICStyleRIPRel() &&
11704 (M == CodeModel::Small || M == CodeModel::Kernel)) {
11705 if (Subtarget->isTargetDarwin() || Subtarget->isTargetELF())
11706 OpFlag = X86II::MO_GOTPCREL;
11707 WrapperKind = X86ISD::WrapperRIP;
11708 } else if (Subtarget->isPICStyleGOT()) {
11709 OpFlag = X86II::MO_GOT;
11710 } else if (Subtarget->isPICStyleStubPIC()) {
11711 OpFlag = X86II::MO_DARWIN_NONLAZY_PIC_BASE;
11712 } else if (Subtarget->isPICStyleStubNoDynamic()) {
11713 OpFlag = X86II::MO_DARWIN_NONLAZY;
11716 SDValue Result = DAG.getTargetExternalSymbol(Sym, getPointerTy(), OpFlag);
11719 Result = DAG.getNode(WrapperKind, DL, getPointerTy(), Result);
11721 // With PIC, the address is actually $g + Offset.
11722 if (DAG.getTarget().getRelocationModel() == Reloc::PIC_ &&
11723 !Subtarget->is64Bit()) {
11724 Result = DAG.getNode(ISD::ADD, DL, getPointerTy(),
11725 DAG.getNode(X86ISD::GlobalBaseReg,
11726 SDLoc(), getPointerTy()),
11730 // For symbols that require a load from a stub to get the address, emit the
11732 if (isGlobalStubReference(OpFlag))
11733 Result = DAG.getLoad(getPointerTy(), DL, DAG.getEntryNode(), Result,
11734 MachinePointerInfo::getGOT(), false, false, false, 0);
11740 X86TargetLowering::LowerBlockAddress(SDValue Op, SelectionDAG &DAG) const {
11741 // Create the TargetBlockAddressAddress node.
11742 unsigned char OpFlags =
11743 Subtarget->ClassifyBlockAddressReference();
11744 CodeModel::Model M = DAG.getTarget().getCodeModel();
11745 const BlockAddress *BA = cast<BlockAddressSDNode>(Op)->getBlockAddress();
11746 int64_t Offset = cast<BlockAddressSDNode>(Op)->getOffset();
11748 SDValue Result = DAG.getTargetBlockAddress(BA, getPointerTy(), Offset,
11751 if (Subtarget->isPICStyleRIPRel() &&
11752 (M == CodeModel::Small || M == CodeModel::Kernel))
11753 Result = DAG.getNode(X86ISD::WrapperRIP, dl, getPointerTy(), Result);
11755 Result = DAG.getNode(X86ISD::Wrapper, dl, getPointerTy(), Result);
11757 // With PIC, the address is actually $g + Offset.
11758 if (isGlobalRelativeToPICBase(OpFlags)) {
11759 Result = DAG.getNode(ISD::ADD, dl, getPointerTy(),
11760 DAG.getNode(X86ISD::GlobalBaseReg, dl, getPointerTy()),
11768 X86TargetLowering::LowerGlobalAddress(const GlobalValue *GV, SDLoc dl,
11769 int64_t Offset, SelectionDAG &DAG) const {
11770 // Create the TargetGlobalAddress node, folding in the constant
11771 // offset if it is legal.
11772 unsigned char OpFlags =
11773 Subtarget->ClassifyGlobalReference(GV, DAG.getTarget());
11774 CodeModel::Model M = DAG.getTarget().getCodeModel();
11776 if (OpFlags == X86II::MO_NO_FLAG &&
11777 X86::isOffsetSuitableForCodeModel(Offset, M)) {
11778 // A direct static reference to a global.
11779 Result = DAG.getTargetGlobalAddress(GV, dl, getPointerTy(), Offset);
11782 Result = DAG.getTargetGlobalAddress(GV, dl, getPointerTy(), 0, OpFlags);
11785 if (Subtarget->isPICStyleRIPRel() &&
11786 (M == CodeModel::Small || M == CodeModel::Kernel))
11787 Result = DAG.getNode(X86ISD::WrapperRIP, dl, getPointerTy(), Result);
11789 Result = DAG.getNode(X86ISD::Wrapper, dl, getPointerTy(), Result);
11791 // With PIC, the address is actually $g + Offset.
11792 if (isGlobalRelativeToPICBase(OpFlags)) {
11793 Result = DAG.getNode(ISD::ADD, dl, getPointerTy(),
11794 DAG.getNode(X86ISD::GlobalBaseReg, dl, getPointerTy()),
11798 // For globals that require a load from a stub to get the address, emit the
11800 if (isGlobalStubReference(OpFlags))
11801 Result = DAG.getLoad(getPointerTy(), dl, DAG.getEntryNode(), Result,
11802 MachinePointerInfo::getGOT(), false, false, false, 0);
11804 // If there was a non-zero offset that we didn't fold, create an explicit
11805 // addition for it.
11807 Result = DAG.getNode(ISD::ADD, dl, getPointerTy(), Result,
11808 DAG.getConstant(Offset, getPointerTy()));
11814 X86TargetLowering::LowerGlobalAddress(SDValue Op, SelectionDAG &DAG) const {
11815 const GlobalValue *GV = cast<GlobalAddressSDNode>(Op)->getGlobal();
11816 int64_t Offset = cast<GlobalAddressSDNode>(Op)->getOffset();
11817 return LowerGlobalAddress(GV, SDLoc(Op), Offset, DAG);
11821 GetTLSADDR(SelectionDAG &DAG, SDValue Chain, GlobalAddressSDNode *GA,
11822 SDValue *InFlag, const EVT PtrVT, unsigned ReturnReg,
11823 unsigned char OperandFlags, bool LocalDynamic = false) {
11824 MachineFrameInfo *MFI = DAG.getMachineFunction().getFrameInfo();
11825 SDVTList NodeTys = DAG.getVTList(MVT::Other, MVT::Glue);
11827 SDValue TGA = DAG.getTargetGlobalAddress(GA->getGlobal(), dl,
11828 GA->getValueType(0),
11832 X86ISD::NodeType CallType = LocalDynamic ? X86ISD::TLSBASEADDR
11836 SDValue Ops[] = { Chain, TGA, *InFlag };
11837 Chain = DAG.getNode(CallType, dl, NodeTys, Ops);
11839 SDValue Ops[] = { Chain, TGA };
11840 Chain = DAG.getNode(CallType, dl, NodeTys, Ops);
11843 // TLSADDR will be codegen'ed as call. Inform MFI that function has calls.
11844 MFI->setAdjustsStack(true);
11846 SDValue Flag = Chain.getValue(1);
11847 return DAG.getCopyFromReg(Chain, dl, ReturnReg, PtrVT, Flag);
11850 // Lower ISD::GlobalTLSAddress using the "general dynamic" model, 32 bit
11852 LowerToTLSGeneralDynamicModel32(GlobalAddressSDNode *GA, SelectionDAG &DAG,
11855 SDLoc dl(GA); // ? function entry point might be better
11856 SDValue Chain = DAG.getCopyToReg(DAG.getEntryNode(), dl, X86::EBX,
11857 DAG.getNode(X86ISD::GlobalBaseReg,
11858 SDLoc(), PtrVT), InFlag);
11859 InFlag = Chain.getValue(1);
11861 return GetTLSADDR(DAG, Chain, GA, &InFlag, PtrVT, X86::EAX, X86II::MO_TLSGD);
11864 // Lower ISD::GlobalTLSAddress using the "general dynamic" model, 64 bit
11866 LowerToTLSGeneralDynamicModel64(GlobalAddressSDNode *GA, SelectionDAG &DAG,
11868 return GetTLSADDR(DAG, DAG.getEntryNode(), GA, nullptr, PtrVT,
11869 X86::RAX, X86II::MO_TLSGD);
11872 static SDValue LowerToTLSLocalDynamicModel(GlobalAddressSDNode *GA,
11878 // Get the start address of the TLS block for this module.
11879 X86MachineFunctionInfo* MFI = DAG.getMachineFunction()
11880 .getInfo<X86MachineFunctionInfo>();
11881 MFI->incNumLocalDynamicTLSAccesses();
11885 Base = GetTLSADDR(DAG, DAG.getEntryNode(), GA, nullptr, PtrVT, X86::RAX,
11886 X86II::MO_TLSLD, /*LocalDynamic=*/true);
11889 SDValue Chain = DAG.getCopyToReg(DAG.getEntryNode(), dl, X86::EBX,
11890 DAG.getNode(X86ISD::GlobalBaseReg, SDLoc(), PtrVT), InFlag);
11891 InFlag = Chain.getValue(1);
11892 Base = GetTLSADDR(DAG, Chain, GA, &InFlag, PtrVT, X86::EAX,
11893 X86II::MO_TLSLDM, /*LocalDynamic=*/true);
11896 // Note: the CleanupLocalDynamicTLSPass will remove redundant computations
11900 unsigned char OperandFlags = X86II::MO_DTPOFF;
11901 unsigned WrapperKind = X86ISD::Wrapper;
11902 SDValue TGA = DAG.getTargetGlobalAddress(GA->getGlobal(), dl,
11903 GA->getValueType(0),
11904 GA->getOffset(), OperandFlags);
11905 SDValue Offset = DAG.getNode(WrapperKind, dl, PtrVT, TGA);
11907 // Add x@dtpoff with the base.
11908 return DAG.getNode(ISD::ADD, dl, PtrVT, Offset, Base);
11911 // Lower ISD::GlobalTLSAddress using the "initial exec" or "local exec" model.
11912 static SDValue LowerToTLSExecModel(GlobalAddressSDNode *GA, SelectionDAG &DAG,
11913 const EVT PtrVT, TLSModel::Model model,
11914 bool is64Bit, bool isPIC) {
11917 // Get the Thread Pointer, which is %gs:0 (32-bit) or %fs:0 (64-bit).
11918 Value *Ptr = Constant::getNullValue(Type::getInt8PtrTy(*DAG.getContext(),
11919 is64Bit ? 257 : 256));
11921 SDValue ThreadPointer =
11922 DAG.getLoad(PtrVT, dl, DAG.getEntryNode(), DAG.getIntPtrConstant(0),
11923 MachinePointerInfo(Ptr), false, false, false, 0);
11925 unsigned char OperandFlags = 0;
11926 // Most TLS accesses are not RIP relative, even on x86-64. One exception is
11928 unsigned WrapperKind = X86ISD::Wrapper;
11929 if (model == TLSModel::LocalExec) {
11930 OperandFlags = is64Bit ? X86II::MO_TPOFF : X86II::MO_NTPOFF;
11931 } else if (model == TLSModel::InitialExec) {
11933 OperandFlags = X86II::MO_GOTTPOFF;
11934 WrapperKind = X86ISD::WrapperRIP;
11936 OperandFlags = isPIC ? X86II::MO_GOTNTPOFF : X86II::MO_INDNTPOFF;
11939 llvm_unreachable("Unexpected model");
11942 // emit "addl x@ntpoff,%eax" (local exec)
11943 // or "addl x@indntpoff,%eax" (initial exec)
11944 // or "addl x@gotntpoff(%ebx) ,%eax" (initial exec, 32-bit pic)
11946 DAG.getTargetGlobalAddress(GA->getGlobal(), dl, GA->getValueType(0),
11947 GA->getOffset(), OperandFlags);
11948 SDValue Offset = DAG.getNode(WrapperKind, dl, PtrVT, TGA);
11950 if (model == TLSModel::InitialExec) {
11951 if (isPIC && !is64Bit) {
11952 Offset = DAG.getNode(ISD::ADD, dl, PtrVT,
11953 DAG.getNode(X86ISD::GlobalBaseReg, SDLoc(), PtrVT),
11957 Offset = DAG.getLoad(PtrVT, dl, DAG.getEntryNode(), Offset,
11958 MachinePointerInfo::getGOT(), false, false, false, 0);
11961 // The address of the thread local variable is the add of the thread
11962 // pointer with the offset of the variable.
11963 return DAG.getNode(ISD::ADD, dl, PtrVT, ThreadPointer, Offset);
11967 X86TargetLowering::LowerGlobalTLSAddress(SDValue Op, SelectionDAG &DAG) const {
11969 GlobalAddressSDNode *GA = cast<GlobalAddressSDNode>(Op);
11970 const GlobalValue *GV = GA->getGlobal();
11972 if (Subtarget->isTargetELF()) {
11973 TLSModel::Model model = DAG.getTarget().getTLSModel(GV);
11976 case TLSModel::GeneralDynamic:
11977 if (Subtarget->is64Bit())
11978 return LowerToTLSGeneralDynamicModel64(GA, DAG, getPointerTy());
11979 return LowerToTLSGeneralDynamicModel32(GA, DAG, getPointerTy());
11980 case TLSModel::LocalDynamic:
11981 return LowerToTLSLocalDynamicModel(GA, DAG, getPointerTy(),
11982 Subtarget->is64Bit());
11983 case TLSModel::InitialExec:
11984 case TLSModel::LocalExec:
11985 return LowerToTLSExecModel(
11986 GA, DAG, getPointerTy(), model, Subtarget->is64Bit(),
11987 DAG.getTarget().getRelocationModel() == Reloc::PIC_);
11989 llvm_unreachable("Unknown TLS model.");
11992 if (Subtarget->isTargetDarwin()) {
11993 // Darwin only has one model of TLS. Lower to that.
11994 unsigned char OpFlag = 0;
11995 unsigned WrapperKind = Subtarget->isPICStyleRIPRel() ?
11996 X86ISD::WrapperRIP : X86ISD::Wrapper;
11998 // In PIC mode (unless we're in RIPRel PIC mode) we add an offset to the
11999 // global base reg.
12000 bool PIC32 = (DAG.getTarget().getRelocationModel() == Reloc::PIC_) &&
12001 !Subtarget->is64Bit();
12003 OpFlag = X86II::MO_TLVP_PIC_BASE;
12005 OpFlag = X86II::MO_TLVP;
12007 SDValue Result = DAG.getTargetGlobalAddress(GA->getGlobal(), DL,
12008 GA->getValueType(0),
12009 GA->getOffset(), OpFlag);
12010 SDValue Offset = DAG.getNode(WrapperKind, DL, getPointerTy(), Result);
12012 // With PIC32, the address is actually $g + Offset.
12014 Offset = DAG.getNode(ISD::ADD, DL, getPointerTy(),
12015 DAG.getNode(X86ISD::GlobalBaseReg,
12016 SDLoc(), getPointerTy()),
12019 // Lowering the machine isd will make sure everything is in the right
12021 SDValue Chain = DAG.getEntryNode();
12022 SDVTList NodeTys = DAG.getVTList(MVT::Other, MVT::Glue);
12023 SDValue Args[] = { Chain, Offset };
12024 Chain = DAG.getNode(X86ISD::TLSCALL, DL, NodeTys, Args);
12026 // TLSCALL will be codegen'ed as call. Inform MFI that function has calls.
12027 MachineFrameInfo *MFI = DAG.getMachineFunction().getFrameInfo();
12028 MFI->setAdjustsStack(true);
12030 // And our return value (tls address) is in the standard call return value
12032 unsigned Reg = Subtarget->is64Bit() ? X86::RAX : X86::EAX;
12033 return DAG.getCopyFromReg(Chain, DL, Reg, getPointerTy(),
12034 Chain.getValue(1));
12037 if (Subtarget->isTargetKnownWindowsMSVC() ||
12038 Subtarget->isTargetWindowsGNU()) {
12039 // Just use the implicit TLS architecture
12040 // Need to generate someting similar to:
12041 // mov rdx, qword [gs:abs 58H]; Load pointer to ThreadLocalStorage
12043 // mov ecx, dword [rel _tls_index]: Load index (from C runtime)
12044 // mov rcx, qword [rdx+rcx*8]
12045 // mov eax, .tls$:tlsvar
12046 // [rax+rcx] contains the address
12047 // Windows 64bit: gs:0x58
12048 // Windows 32bit: fs:__tls_array
12051 SDValue Chain = DAG.getEntryNode();
12053 // Get the Thread Pointer, which is %fs:__tls_array (32-bit) or
12054 // %gs:0x58 (64-bit). On MinGW, __tls_array is not available, so directly
12055 // use its literal value of 0x2C.
12056 Value *Ptr = Constant::getNullValue(Subtarget->is64Bit()
12057 ? Type::getInt8PtrTy(*DAG.getContext(),
12059 : Type::getInt32PtrTy(*DAG.getContext(),
12063 Subtarget->is64Bit()
12064 ? DAG.getIntPtrConstant(0x58)
12065 : (Subtarget->isTargetWindowsGNU()
12066 ? DAG.getIntPtrConstant(0x2C)
12067 : DAG.getExternalSymbol("_tls_array", getPointerTy()));
12069 SDValue ThreadPointer =
12070 DAG.getLoad(getPointerTy(), dl, Chain, TlsArray,
12071 MachinePointerInfo(Ptr), false, false, false, 0);
12073 // Load the _tls_index variable
12074 SDValue IDX = DAG.getExternalSymbol("_tls_index", getPointerTy());
12075 if (Subtarget->is64Bit())
12076 IDX = DAG.getExtLoad(ISD::ZEXTLOAD, dl, getPointerTy(), Chain,
12077 IDX, MachinePointerInfo(), MVT::i32,
12078 false, false, false, 0);
12080 IDX = DAG.getLoad(getPointerTy(), dl, Chain, IDX, MachinePointerInfo(),
12081 false, false, false, 0);
12083 SDValue Scale = DAG.getConstant(Log2_64_Ceil(TD->getPointerSize()),
12085 IDX = DAG.getNode(ISD::SHL, dl, getPointerTy(), IDX, Scale);
12087 SDValue res = DAG.getNode(ISD::ADD, dl, getPointerTy(), ThreadPointer, IDX);
12088 res = DAG.getLoad(getPointerTy(), dl, Chain, res, MachinePointerInfo(),
12089 false, false, false, 0);
12091 // Get the offset of start of .tls section
12092 SDValue TGA = DAG.getTargetGlobalAddress(GA->getGlobal(), dl,
12093 GA->getValueType(0),
12094 GA->getOffset(), X86II::MO_SECREL);
12095 SDValue Offset = DAG.getNode(X86ISD::Wrapper, dl, getPointerTy(), TGA);
12097 // The address of the thread local variable is the add of the thread
12098 // pointer with the offset of the variable.
12099 return DAG.getNode(ISD::ADD, dl, getPointerTy(), res, Offset);
12102 llvm_unreachable("TLS not implemented for this target.");
12105 /// LowerShiftParts - Lower SRA_PARTS and friends, which return two i32 values
12106 /// and take a 2 x i32 value to shift plus a shift amount.
12107 static SDValue LowerShiftParts(SDValue Op, SelectionDAG &DAG) {
12108 assert(Op.getNumOperands() == 3 && "Not a double-shift!");
12109 MVT VT = Op.getSimpleValueType();
12110 unsigned VTBits = VT.getSizeInBits();
12112 bool isSRA = Op.getOpcode() == ISD::SRA_PARTS;
12113 SDValue ShOpLo = Op.getOperand(0);
12114 SDValue ShOpHi = Op.getOperand(1);
12115 SDValue ShAmt = Op.getOperand(2);
12116 // X86ISD::SHLD and X86ISD::SHRD have defined overflow behavior but the
12117 // generic ISD nodes haven't. Insert an AND to be safe, it's optimized away
12119 SDValue SafeShAmt = DAG.getNode(ISD::AND, dl, MVT::i8, ShAmt,
12120 DAG.getConstant(VTBits - 1, MVT::i8));
12121 SDValue Tmp1 = isSRA ? DAG.getNode(ISD::SRA, dl, VT, ShOpHi,
12122 DAG.getConstant(VTBits - 1, MVT::i8))
12123 : DAG.getConstant(0, VT);
12125 SDValue Tmp2, Tmp3;
12126 if (Op.getOpcode() == ISD::SHL_PARTS) {
12127 Tmp2 = DAG.getNode(X86ISD::SHLD, dl, VT, ShOpHi, ShOpLo, ShAmt);
12128 Tmp3 = DAG.getNode(ISD::SHL, dl, VT, ShOpLo, SafeShAmt);
12130 Tmp2 = DAG.getNode(X86ISD::SHRD, dl, VT, ShOpLo, ShOpHi, ShAmt);
12131 Tmp3 = DAG.getNode(isSRA ? ISD::SRA : ISD::SRL, dl, VT, ShOpHi, SafeShAmt);
12134 // If the shift amount is larger or equal than the width of a part we can't
12135 // rely on the results of shld/shrd. Insert a test and select the appropriate
12136 // values for large shift amounts.
12137 SDValue AndNode = DAG.getNode(ISD::AND, dl, MVT::i8, ShAmt,
12138 DAG.getConstant(VTBits, MVT::i8));
12139 SDValue Cond = DAG.getNode(X86ISD::CMP, dl, MVT::i32,
12140 AndNode, DAG.getConstant(0, MVT::i8));
12143 SDValue CC = DAG.getConstant(X86::COND_NE, MVT::i8);
12144 SDValue Ops0[4] = { Tmp2, Tmp3, CC, Cond };
12145 SDValue Ops1[4] = { Tmp3, Tmp1, CC, Cond };
12147 if (Op.getOpcode() == ISD::SHL_PARTS) {
12148 Hi = DAG.getNode(X86ISD::CMOV, dl, VT, Ops0);
12149 Lo = DAG.getNode(X86ISD::CMOV, dl, VT, Ops1);
12151 Lo = DAG.getNode(X86ISD::CMOV, dl, VT, Ops0);
12152 Hi = DAG.getNode(X86ISD::CMOV, dl, VT, Ops1);
12155 SDValue Ops[2] = { Lo, Hi };
12156 return DAG.getMergeValues(Ops, dl);
12159 SDValue X86TargetLowering::LowerSINT_TO_FP(SDValue Op,
12160 SelectionDAG &DAG) const {
12161 MVT SrcVT = Op.getOperand(0).getSimpleValueType();
12163 if (SrcVT.isVector())
12166 assert(SrcVT <= MVT::i64 && SrcVT >= MVT::i16 &&
12167 "Unknown SINT_TO_FP to lower!");
12169 // These are really Legal; return the operand so the caller accepts it as
12171 if (SrcVT == MVT::i32 && isScalarFPTypeInSSEReg(Op.getValueType()))
12173 if (SrcVT == MVT::i64 && isScalarFPTypeInSSEReg(Op.getValueType()) &&
12174 Subtarget->is64Bit()) {
12179 unsigned Size = SrcVT.getSizeInBits()/8;
12180 MachineFunction &MF = DAG.getMachineFunction();
12181 int SSFI = MF.getFrameInfo()->CreateStackObject(Size, Size, false);
12182 SDValue StackSlot = DAG.getFrameIndex(SSFI, getPointerTy());
12183 SDValue Chain = DAG.getStore(DAG.getEntryNode(), dl, Op.getOperand(0),
12185 MachinePointerInfo::getFixedStack(SSFI),
12187 return BuildFILD(Op, SrcVT, Chain, StackSlot, DAG);
12190 SDValue X86TargetLowering::BuildFILD(SDValue Op, EVT SrcVT, SDValue Chain,
12192 SelectionDAG &DAG) const {
12196 bool useSSE = isScalarFPTypeInSSEReg(Op.getValueType());
12198 Tys = DAG.getVTList(MVT::f64, MVT::Other, MVT::Glue);
12200 Tys = DAG.getVTList(Op.getValueType(), MVT::Other);
12202 unsigned ByteSize = SrcVT.getSizeInBits()/8;
12204 FrameIndexSDNode *FI = dyn_cast<FrameIndexSDNode>(StackSlot);
12205 MachineMemOperand *MMO;
12207 int SSFI = FI->getIndex();
12209 DAG.getMachineFunction()
12210 .getMachineMemOperand(MachinePointerInfo::getFixedStack(SSFI),
12211 MachineMemOperand::MOLoad, ByteSize, ByteSize);
12213 MMO = cast<LoadSDNode>(StackSlot)->getMemOperand();
12214 StackSlot = StackSlot.getOperand(1);
12216 SDValue Ops[] = { Chain, StackSlot, DAG.getValueType(SrcVT) };
12217 SDValue Result = DAG.getMemIntrinsicNode(useSSE ? X86ISD::FILD_FLAG :
12219 Tys, Ops, SrcVT, MMO);
12222 Chain = Result.getValue(1);
12223 SDValue InFlag = Result.getValue(2);
12225 // FIXME: Currently the FST is flagged to the FILD_FLAG. This
12226 // shouldn't be necessary except that RFP cannot be live across
12227 // multiple blocks. When stackifier is fixed, they can be uncoupled.
12228 MachineFunction &MF = DAG.getMachineFunction();
12229 unsigned SSFISize = Op.getValueType().getSizeInBits()/8;
12230 int SSFI = MF.getFrameInfo()->CreateStackObject(SSFISize, SSFISize, false);
12231 SDValue StackSlot = DAG.getFrameIndex(SSFI, getPointerTy());
12232 Tys = DAG.getVTList(MVT::Other);
12234 Chain, Result, StackSlot, DAG.getValueType(Op.getValueType()), InFlag
12236 MachineMemOperand *MMO =
12237 DAG.getMachineFunction()
12238 .getMachineMemOperand(MachinePointerInfo::getFixedStack(SSFI),
12239 MachineMemOperand::MOStore, SSFISize, SSFISize);
12241 Chain = DAG.getMemIntrinsicNode(X86ISD::FST, DL, Tys,
12242 Ops, Op.getValueType(), MMO);
12243 Result = DAG.getLoad(Op.getValueType(), DL, Chain, StackSlot,
12244 MachinePointerInfo::getFixedStack(SSFI),
12245 false, false, false, 0);
12251 // LowerUINT_TO_FP_i64 - 64-bit unsigned integer to double expansion.
12252 SDValue X86TargetLowering::LowerUINT_TO_FP_i64(SDValue Op,
12253 SelectionDAG &DAG) const {
12254 // This algorithm is not obvious. Here it is what we're trying to output:
12257 punpckldq (c0), %xmm0 // c0: (uint4){ 0x43300000U, 0x45300000U, 0U, 0U }
12258 subpd (c1), %xmm0 // c1: (double2){ 0x1.0p52, 0x1.0p52 * 0x1.0p32 }
12260 haddpd %xmm0, %xmm0
12262 pshufd $0x4e, %xmm0, %xmm1
12268 LLVMContext *Context = DAG.getContext();
12270 // Build some magic constants.
12271 static const uint32_t CV0[] = { 0x43300000, 0x45300000, 0, 0 };
12272 Constant *C0 = ConstantDataVector::get(*Context, CV0);
12273 SDValue CPIdx0 = DAG.getConstantPool(C0, getPointerTy(), 16);
12275 SmallVector<Constant*,2> CV1;
12277 ConstantFP::get(*Context, APFloat(APFloat::IEEEdouble,
12278 APInt(64, 0x4330000000000000ULL))));
12280 ConstantFP::get(*Context, APFloat(APFloat::IEEEdouble,
12281 APInt(64, 0x4530000000000000ULL))));
12282 Constant *C1 = ConstantVector::get(CV1);
12283 SDValue CPIdx1 = DAG.getConstantPool(C1, getPointerTy(), 16);
12285 // Load the 64-bit value into an XMM register.
12286 SDValue XR1 = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, MVT::v2i64,
12288 SDValue CLod0 = DAG.getLoad(MVT::v4i32, dl, DAG.getEntryNode(), CPIdx0,
12289 MachinePointerInfo::getConstantPool(),
12290 false, false, false, 16);
12291 SDValue Unpck1 = getUnpackl(DAG, dl, MVT::v4i32,
12292 DAG.getNode(ISD::BITCAST, dl, MVT::v4i32, XR1),
12295 SDValue CLod1 = DAG.getLoad(MVT::v2f64, dl, CLod0.getValue(1), CPIdx1,
12296 MachinePointerInfo::getConstantPool(),
12297 false, false, false, 16);
12298 SDValue XR2F = DAG.getNode(ISD::BITCAST, dl, MVT::v2f64, Unpck1);
12299 SDValue Sub = DAG.getNode(ISD::FSUB, dl, MVT::v2f64, XR2F, CLod1);
12302 if (Subtarget->hasSSE3()) {
12303 // FIXME: The 'haddpd' instruction may be slower than 'movhlps + addsd'.
12304 Result = DAG.getNode(X86ISD::FHADD, dl, MVT::v2f64, Sub, Sub);
12306 SDValue S2F = DAG.getNode(ISD::BITCAST, dl, MVT::v4i32, Sub);
12307 SDValue Shuffle = getTargetShuffleNode(X86ISD::PSHUFD, dl, MVT::v4i32,
12309 Result = DAG.getNode(ISD::FADD, dl, MVT::v2f64,
12310 DAG.getNode(ISD::BITCAST, dl, MVT::v2f64, Shuffle),
12314 return DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::f64, Result,
12315 DAG.getIntPtrConstant(0));
12318 // LowerUINT_TO_FP_i32 - 32-bit unsigned integer to float expansion.
12319 SDValue X86TargetLowering::LowerUINT_TO_FP_i32(SDValue Op,
12320 SelectionDAG &DAG) const {
12322 // FP constant to bias correct the final result.
12323 SDValue Bias = DAG.getConstantFP(BitsToDouble(0x4330000000000000ULL),
12326 // Load the 32-bit value into an XMM register.
12327 SDValue Load = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, MVT::v4i32,
12330 // Zero out the upper parts of the register.
12331 Load = getShuffleVectorZeroOrUndef(Load, 0, true, Subtarget, DAG);
12333 Load = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::f64,
12334 DAG.getNode(ISD::BITCAST, dl, MVT::v2f64, Load),
12335 DAG.getIntPtrConstant(0));
12337 // Or the load with the bias.
12338 SDValue Or = DAG.getNode(ISD::OR, dl, MVT::v2i64,
12339 DAG.getNode(ISD::BITCAST, dl, MVT::v2i64,
12340 DAG.getNode(ISD::SCALAR_TO_VECTOR, dl,
12341 MVT::v2f64, Load)),
12342 DAG.getNode(ISD::BITCAST, dl, MVT::v2i64,
12343 DAG.getNode(ISD::SCALAR_TO_VECTOR, dl,
12344 MVT::v2f64, Bias)));
12345 Or = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::f64,
12346 DAG.getNode(ISD::BITCAST, dl, MVT::v2f64, Or),
12347 DAG.getIntPtrConstant(0));
12349 // Subtract the bias.
12350 SDValue Sub = DAG.getNode(ISD::FSUB, dl, MVT::f64, Or, Bias);
12352 // Handle final rounding.
12353 EVT DestVT = Op.getValueType();
12355 if (DestVT.bitsLT(MVT::f64))
12356 return DAG.getNode(ISD::FP_ROUND, dl, DestVT, Sub,
12357 DAG.getIntPtrConstant(0));
12358 if (DestVT.bitsGT(MVT::f64))
12359 return DAG.getNode(ISD::FP_EXTEND, dl, DestVT, Sub);
12361 // Handle final rounding.
12365 SDValue X86TargetLowering::lowerUINT_TO_FP_vec(SDValue Op,
12366 SelectionDAG &DAG) const {
12367 SDValue N0 = Op.getOperand(0);
12368 MVT SVT = N0.getSimpleValueType();
12371 assert((SVT == MVT::v4i8 || SVT == MVT::v4i16 ||
12372 SVT == MVT::v8i8 || SVT == MVT::v8i16) &&
12373 "Custom UINT_TO_FP is not supported!");
12375 MVT NVT = MVT::getVectorVT(MVT::i32, SVT.getVectorNumElements());
12376 return DAG.getNode(ISD::SINT_TO_FP, dl, Op.getValueType(),
12377 DAG.getNode(ISD::ZERO_EXTEND, dl, NVT, N0));
12380 SDValue X86TargetLowering::LowerUINT_TO_FP(SDValue Op,
12381 SelectionDAG &DAG) const {
12382 SDValue N0 = Op.getOperand(0);
12385 if (Op.getValueType().isVector())
12386 return lowerUINT_TO_FP_vec(Op, DAG);
12388 // Since UINT_TO_FP is legal (it's marked custom), dag combiner won't
12389 // optimize it to a SINT_TO_FP when the sign bit is known zero. Perform
12390 // the optimization here.
12391 if (DAG.SignBitIsZero(N0))
12392 return DAG.getNode(ISD::SINT_TO_FP, dl, Op.getValueType(), N0);
12394 MVT SrcVT = N0.getSimpleValueType();
12395 MVT DstVT = Op.getSimpleValueType();
12396 if (SrcVT == MVT::i64 && DstVT == MVT::f64 && X86ScalarSSEf64)
12397 return LowerUINT_TO_FP_i64(Op, DAG);
12398 if (SrcVT == MVT::i32 && X86ScalarSSEf64)
12399 return LowerUINT_TO_FP_i32(Op, DAG);
12400 if (Subtarget->is64Bit() && SrcVT == MVT::i64 && DstVT == MVT::f32)
12403 // Make a 64-bit buffer, and use it to build an FILD.
12404 SDValue StackSlot = DAG.CreateStackTemporary(MVT::i64);
12405 if (SrcVT == MVT::i32) {
12406 SDValue WordOff = DAG.getConstant(4, getPointerTy());
12407 SDValue OffsetSlot = DAG.getNode(ISD::ADD, dl,
12408 getPointerTy(), StackSlot, WordOff);
12409 SDValue Store1 = DAG.getStore(DAG.getEntryNode(), dl, Op.getOperand(0),
12410 StackSlot, MachinePointerInfo(),
12412 SDValue Store2 = DAG.getStore(Store1, dl, DAG.getConstant(0, MVT::i32),
12413 OffsetSlot, MachinePointerInfo(),
12415 SDValue Fild = BuildFILD(Op, MVT::i64, Store2, StackSlot, DAG);
12419 assert(SrcVT == MVT::i64 && "Unexpected type in UINT_TO_FP");
12420 SDValue Store = DAG.getStore(DAG.getEntryNode(), dl, Op.getOperand(0),
12421 StackSlot, MachinePointerInfo(),
12423 // For i64 source, we need to add the appropriate power of 2 if the input
12424 // was negative. This is the same as the optimization in
12425 // DAGTypeLegalizer::ExpandIntOp_UNIT_TO_FP, and for it to be safe here,
12426 // we must be careful to do the computation in x87 extended precision, not
12427 // in SSE. (The generic code can't know it's OK to do this, or how to.)
12428 int SSFI = cast<FrameIndexSDNode>(StackSlot)->getIndex();
12429 MachineMemOperand *MMO =
12430 DAG.getMachineFunction()
12431 .getMachineMemOperand(MachinePointerInfo::getFixedStack(SSFI),
12432 MachineMemOperand::MOLoad, 8, 8);
12434 SDVTList Tys = DAG.getVTList(MVT::f80, MVT::Other);
12435 SDValue Ops[] = { Store, StackSlot, DAG.getValueType(MVT::i64) };
12436 SDValue Fild = DAG.getMemIntrinsicNode(X86ISD::FILD, dl, Tys, Ops,
12439 APInt FF(32, 0x5F800000ULL);
12441 // Check whether the sign bit is set.
12442 SDValue SignSet = DAG.getSetCC(dl,
12443 getSetCCResultType(*DAG.getContext(), MVT::i64),
12444 Op.getOperand(0), DAG.getConstant(0, MVT::i64),
12447 // Build a 64 bit pair (0, FF) in the constant pool, with FF in the lo bits.
12448 SDValue FudgePtr = DAG.getConstantPool(
12449 ConstantInt::get(*DAG.getContext(), FF.zext(64)),
12452 // Get a pointer to FF if the sign bit was set, or to 0 otherwise.
12453 SDValue Zero = DAG.getIntPtrConstant(0);
12454 SDValue Four = DAG.getIntPtrConstant(4);
12455 SDValue Offset = DAG.getNode(ISD::SELECT, dl, Zero.getValueType(), SignSet,
12457 FudgePtr = DAG.getNode(ISD::ADD, dl, getPointerTy(), FudgePtr, Offset);
12459 // Load the value out, extending it from f32 to f80.
12460 // FIXME: Avoid the extend by constructing the right constant pool?
12461 SDValue Fudge = DAG.getExtLoad(ISD::EXTLOAD, dl, MVT::f80, DAG.getEntryNode(),
12462 FudgePtr, MachinePointerInfo::getConstantPool(),
12463 MVT::f32, false, false, false, 4);
12464 // Extend everything to 80 bits to force it to be done on x87.
12465 SDValue Add = DAG.getNode(ISD::FADD, dl, MVT::f80, Fild, Fudge);
12466 return DAG.getNode(ISD::FP_ROUND, dl, DstVT, Add, DAG.getIntPtrConstant(0));
12469 std::pair<SDValue,SDValue>
12470 X86TargetLowering:: FP_TO_INTHelper(SDValue Op, SelectionDAG &DAG,
12471 bool IsSigned, bool IsReplace) const {
12474 EVT DstTy = Op.getValueType();
12476 if (!IsSigned && !isIntegerTypeFTOL(DstTy)) {
12477 assert(DstTy == MVT::i32 && "Unexpected FP_TO_UINT");
12481 assert(DstTy.getSimpleVT() <= MVT::i64 &&
12482 DstTy.getSimpleVT() >= MVT::i16 &&
12483 "Unknown FP_TO_INT to lower!");
12485 // These are really Legal.
12486 if (DstTy == MVT::i32 &&
12487 isScalarFPTypeInSSEReg(Op.getOperand(0).getValueType()))
12488 return std::make_pair(SDValue(), SDValue());
12489 if (Subtarget->is64Bit() &&
12490 DstTy == MVT::i64 &&
12491 isScalarFPTypeInSSEReg(Op.getOperand(0).getValueType()))
12492 return std::make_pair(SDValue(), SDValue());
12494 // We lower FP->int64 either into FISTP64 followed by a load from a temporary
12495 // stack slot, or into the FTOL runtime function.
12496 MachineFunction &MF = DAG.getMachineFunction();
12497 unsigned MemSize = DstTy.getSizeInBits()/8;
12498 int SSFI = MF.getFrameInfo()->CreateStackObject(MemSize, MemSize, false);
12499 SDValue StackSlot = DAG.getFrameIndex(SSFI, getPointerTy());
12502 if (!IsSigned && isIntegerTypeFTOL(DstTy))
12503 Opc = X86ISD::WIN_FTOL;
12505 switch (DstTy.getSimpleVT().SimpleTy) {
12506 default: llvm_unreachable("Invalid FP_TO_SINT to lower!");
12507 case MVT::i16: Opc = X86ISD::FP_TO_INT16_IN_MEM; break;
12508 case MVT::i32: Opc = X86ISD::FP_TO_INT32_IN_MEM; break;
12509 case MVT::i64: Opc = X86ISD::FP_TO_INT64_IN_MEM; break;
12512 SDValue Chain = DAG.getEntryNode();
12513 SDValue Value = Op.getOperand(0);
12514 EVT TheVT = Op.getOperand(0).getValueType();
12515 // FIXME This causes a redundant load/store if the SSE-class value is already
12516 // in memory, such as if it is on the callstack.
12517 if (isScalarFPTypeInSSEReg(TheVT)) {
12518 assert(DstTy == MVT::i64 && "Invalid FP_TO_SINT to lower!");
12519 Chain = DAG.getStore(Chain, DL, Value, StackSlot,
12520 MachinePointerInfo::getFixedStack(SSFI),
12522 SDVTList Tys = DAG.getVTList(Op.getOperand(0).getValueType(), MVT::Other);
12524 Chain, StackSlot, DAG.getValueType(TheVT)
12527 MachineMemOperand *MMO =
12528 MF.getMachineMemOperand(MachinePointerInfo::getFixedStack(SSFI),
12529 MachineMemOperand::MOLoad, MemSize, MemSize);
12530 Value = DAG.getMemIntrinsicNode(X86ISD::FLD, DL, Tys, Ops, DstTy, MMO);
12531 Chain = Value.getValue(1);
12532 SSFI = MF.getFrameInfo()->CreateStackObject(MemSize, MemSize, false);
12533 StackSlot = DAG.getFrameIndex(SSFI, getPointerTy());
12536 MachineMemOperand *MMO =
12537 MF.getMachineMemOperand(MachinePointerInfo::getFixedStack(SSFI),
12538 MachineMemOperand::MOStore, MemSize, MemSize);
12540 if (Opc != X86ISD::WIN_FTOL) {
12541 // Build the FP_TO_INT*_IN_MEM
12542 SDValue Ops[] = { Chain, Value, StackSlot };
12543 SDValue FIST = DAG.getMemIntrinsicNode(Opc, DL, DAG.getVTList(MVT::Other),
12545 return std::make_pair(FIST, StackSlot);
12547 SDValue ftol = DAG.getNode(X86ISD::WIN_FTOL, DL,
12548 DAG.getVTList(MVT::Other, MVT::Glue),
12550 SDValue eax = DAG.getCopyFromReg(ftol, DL, X86::EAX,
12551 MVT::i32, ftol.getValue(1));
12552 SDValue edx = DAG.getCopyFromReg(eax.getValue(1), DL, X86::EDX,
12553 MVT::i32, eax.getValue(2));
12554 SDValue Ops[] = { eax, edx };
12555 SDValue pair = IsReplace
12556 ? DAG.getNode(ISD::BUILD_PAIR, DL, MVT::i64, Ops)
12557 : DAG.getMergeValues(Ops, DL);
12558 return std::make_pair(pair, SDValue());
12562 static SDValue LowerAVXExtend(SDValue Op, SelectionDAG &DAG,
12563 const X86Subtarget *Subtarget) {
12564 MVT VT = Op->getSimpleValueType(0);
12565 SDValue In = Op->getOperand(0);
12566 MVT InVT = In.getSimpleValueType();
12569 // Optimize vectors in AVX mode:
12572 // Use vpunpcklwd for 4 lower elements v8i16 -> v4i32.
12573 // Use vpunpckhwd for 4 upper elements v8i16 -> v4i32.
12574 // Concat upper and lower parts.
12577 // Use vpunpckldq for 4 lower elements v4i32 -> v2i64.
12578 // Use vpunpckhdq for 4 upper elements v4i32 -> v2i64.
12579 // Concat upper and lower parts.
12582 if (((VT != MVT::v16i16) || (InVT != MVT::v16i8)) &&
12583 ((VT != MVT::v8i32) || (InVT != MVT::v8i16)) &&
12584 ((VT != MVT::v4i64) || (InVT != MVT::v4i32)))
12587 if (Subtarget->hasInt256())
12588 return DAG.getNode(X86ISD::VZEXT, dl, VT, In);
12590 SDValue ZeroVec = getZeroVector(InVT, Subtarget, DAG, dl);
12591 SDValue Undef = DAG.getUNDEF(InVT);
12592 bool NeedZero = Op.getOpcode() == ISD::ZERO_EXTEND;
12593 SDValue OpLo = getUnpackl(DAG, dl, InVT, In, NeedZero ? ZeroVec : Undef);
12594 SDValue OpHi = getUnpackh(DAG, dl, InVT, In, NeedZero ? ZeroVec : Undef);
12596 MVT HVT = MVT::getVectorVT(VT.getVectorElementType(),
12597 VT.getVectorNumElements()/2);
12599 OpLo = DAG.getNode(ISD::BITCAST, dl, HVT, OpLo);
12600 OpHi = DAG.getNode(ISD::BITCAST, dl, HVT, OpHi);
12602 return DAG.getNode(ISD::CONCAT_VECTORS, dl, VT, OpLo, OpHi);
12605 static SDValue LowerZERO_EXTEND_AVX512(SDValue Op,
12606 SelectionDAG &DAG) {
12607 MVT VT = Op->getSimpleValueType(0);
12608 SDValue In = Op->getOperand(0);
12609 MVT InVT = In.getSimpleValueType();
12611 unsigned int NumElts = VT.getVectorNumElements();
12612 if (NumElts != 8 && NumElts != 16)
12615 if (VT.is512BitVector() && InVT.getVectorElementType() != MVT::i1)
12616 return DAG.getNode(X86ISD::VZEXT, DL, VT, In);
12618 EVT ExtVT = (NumElts == 8)? MVT::v8i64 : MVT::v16i32;
12619 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
12620 // Now we have only mask extension
12621 assert(InVT.getVectorElementType() == MVT::i1);
12622 SDValue Cst = DAG.getTargetConstant(1, ExtVT.getScalarType());
12623 const Constant *C = (dyn_cast<ConstantSDNode>(Cst))->getConstantIntValue();
12624 SDValue CP = DAG.getConstantPool(C, TLI.getPointerTy());
12625 unsigned Alignment = cast<ConstantPoolSDNode>(CP)->getAlignment();
12626 SDValue Ld = DAG.getLoad(Cst.getValueType(), DL, DAG.getEntryNode(), CP,
12627 MachinePointerInfo::getConstantPool(),
12628 false, false, false, Alignment);
12630 SDValue Brcst = DAG.getNode(X86ISD::VBROADCASTM, DL, ExtVT, In, Ld);
12631 if (VT.is512BitVector())
12633 return DAG.getNode(X86ISD::VTRUNC, DL, VT, Brcst);
12636 static SDValue LowerANY_EXTEND(SDValue Op, const X86Subtarget *Subtarget,
12637 SelectionDAG &DAG) {
12638 if (Subtarget->hasFp256()) {
12639 SDValue Res = LowerAVXExtend(Op, DAG, Subtarget);
12647 static SDValue LowerZERO_EXTEND(SDValue Op, const X86Subtarget *Subtarget,
12648 SelectionDAG &DAG) {
12650 MVT VT = Op.getSimpleValueType();
12651 SDValue In = Op.getOperand(0);
12652 MVT SVT = In.getSimpleValueType();
12654 if (VT.is512BitVector() || SVT.getVectorElementType() == MVT::i1)
12655 return LowerZERO_EXTEND_AVX512(Op, DAG);
12657 if (Subtarget->hasFp256()) {
12658 SDValue Res = LowerAVXExtend(Op, DAG, Subtarget);
12663 assert(!VT.is256BitVector() || !SVT.is128BitVector() ||
12664 VT.getVectorNumElements() != SVT.getVectorNumElements());
12668 SDValue X86TargetLowering::LowerTRUNCATE(SDValue Op, SelectionDAG &DAG) const {
12670 MVT VT = Op.getSimpleValueType();
12671 SDValue In = Op.getOperand(0);
12672 MVT InVT = In.getSimpleValueType();
12674 if (VT == MVT::i1) {
12675 assert((InVT.isInteger() && (InVT.getSizeInBits() <= 64)) &&
12676 "Invalid scalar TRUNCATE operation");
12677 if (InVT.getSizeInBits() >= 32)
12679 In = DAG.getNode(ISD::ANY_EXTEND, DL, MVT::i32, In);
12680 return DAG.getNode(ISD::TRUNCATE, DL, VT, In);
12682 assert(VT.getVectorNumElements() == InVT.getVectorNumElements() &&
12683 "Invalid TRUNCATE operation");
12685 if (InVT.is512BitVector() || VT.getVectorElementType() == MVT::i1) {
12686 if (VT.getVectorElementType().getSizeInBits() >=8)
12687 return DAG.getNode(X86ISD::VTRUNC, DL, VT, In);
12689 assert(VT.getVectorElementType() == MVT::i1 && "Unexpected vector type");
12690 unsigned NumElts = InVT.getVectorNumElements();
12691 assert ((NumElts == 8 || NumElts == 16) && "Unexpected vector type");
12692 if (InVT.getSizeInBits() < 512) {
12693 MVT ExtVT = (NumElts == 16)? MVT::v16i32 : MVT::v8i64;
12694 In = DAG.getNode(ISD::SIGN_EXTEND, DL, ExtVT, In);
12698 SDValue Cst = DAG.getTargetConstant(1, InVT.getVectorElementType());
12699 const Constant *C = (dyn_cast<ConstantSDNode>(Cst))->getConstantIntValue();
12700 SDValue CP = DAG.getConstantPool(C, getPointerTy());
12701 unsigned Alignment = cast<ConstantPoolSDNode>(CP)->getAlignment();
12702 SDValue Ld = DAG.getLoad(Cst.getValueType(), DL, DAG.getEntryNode(), CP,
12703 MachinePointerInfo::getConstantPool(),
12704 false, false, false, Alignment);
12705 SDValue OneV = DAG.getNode(X86ISD::VBROADCAST, DL, InVT, Ld);
12706 SDValue And = DAG.getNode(ISD::AND, DL, InVT, OneV, In);
12707 return DAG.getNode(X86ISD::TESTM, DL, VT, And, And);
12710 if ((VT == MVT::v4i32) && (InVT == MVT::v4i64)) {
12711 // On AVX2, v4i64 -> v4i32 becomes VPERMD.
12712 if (Subtarget->hasInt256()) {
12713 static const int ShufMask[] = {0, 2, 4, 6, -1, -1, -1, -1};
12714 In = DAG.getNode(ISD::BITCAST, DL, MVT::v8i32, In);
12715 In = DAG.getVectorShuffle(MVT::v8i32, DL, In, DAG.getUNDEF(MVT::v8i32),
12717 return DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, VT, In,
12718 DAG.getIntPtrConstant(0));
12721 SDValue OpLo = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, MVT::v2i64, In,
12722 DAG.getIntPtrConstant(0));
12723 SDValue OpHi = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, MVT::v2i64, In,
12724 DAG.getIntPtrConstant(2));
12725 OpLo = DAG.getNode(ISD::BITCAST, DL, MVT::v4i32, OpLo);
12726 OpHi = DAG.getNode(ISD::BITCAST, DL, MVT::v4i32, OpHi);
12727 static const int ShufMask[] = {0, 2, 4, 6};
12728 return DAG.getVectorShuffle(VT, DL, OpLo, OpHi, ShufMask);
12731 if ((VT == MVT::v8i16) && (InVT == MVT::v8i32)) {
12732 // On AVX2, v8i32 -> v8i16 becomed PSHUFB.
12733 if (Subtarget->hasInt256()) {
12734 In = DAG.getNode(ISD::BITCAST, DL, MVT::v32i8, In);
12736 SmallVector<SDValue,32> pshufbMask;
12737 for (unsigned i = 0; i < 2; ++i) {
12738 pshufbMask.push_back(DAG.getConstant(0x0, MVT::i8));
12739 pshufbMask.push_back(DAG.getConstant(0x1, MVT::i8));
12740 pshufbMask.push_back(DAG.getConstant(0x4, MVT::i8));
12741 pshufbMask.push_back(DAG.getConstant(0x5, MVT::i8));
12742 pshufbMask.push_back(DAG.getConstant(0x8, MVT::i8));
12743 pshufbMask.push_back(DAG.getConstant(0x9, MVT::i8));
12744 pshufbMask.push_back(DAG.getConstant(0xc, MVT::i8));
12745 pshufbMask.push_back(DAG.getConstant(0xd, MVT::i8));
12746 for (unsigned j = 0; j < 8; ++j)
12747 pshufbMask.push_back(DAG.getConstant(0x80, MVT::i8));
12749 SDValue BV = DAG.getNode(ISD::BUILD_VECTOR, DL, MVT::v32i8, pshufbMask);
12750 In = DAG.getNode(X86ISD::PSHUFB, DL, MVT::v32i8, In, BV);
12751 In = DAG.getNode(ISD::BITCAST, DL, MVT::v4i64, In);
12753 static const int ShufMask[] = {0, 2, -1, -1};
12754 In = DAG.getVectorShuffle(MVT::v4i64, DL, In, DAG.getUNDEF(MVT::v4i64),
12756 In = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, MVT::v2i64, In,
12757 DAG.getIntPtrConstant(0));
12758 return DAG.getNode(ISD::BITCAST, DL, VT, In);
12761 SDValue OpLo = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, MVT::v4i32, In,
12762 DAG.getIntPtrConstant(0));
12764 SDValue OpHi = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, MVT::v4i32, In,
12765 DAG.getIntPtrConstant(4));
12767 OpLo = DAG.getNode(ISD::BITCAST, DL, MVT::v16i8, OpLo);
12768 OpHi = DAG.getNode(ISD::BITCAST, DL, MVT::v16i8, OpHi);
12770 // The PSHUFB mask:
12771 static const int ShufMask1[] = {0, 1, 4, 5, 8, 9, 12, 13,
12772 -1, -1, -1, -1, -1, -1, -1, -1};
12774 SDValue Undef = DAG.getUNDEF(MVT::v16i8);
12775 OpLo = DAG.getVectorShuffle(MVT::v16i8, DL, OpLo, Undef, ShufMask1);
12776 OpHi = DAG.getVectorShuffle(MVT::v16i8, DL, OpHi, Undef, ShufMask1);
12778 OpLo = DAG.getNode(ISD::BITCAST, DL, MVT::v4i32, OpLo);
12779 OpHi = DAG.getNode(ISD::BITCAST, DL, MVT::v4i32, OpHi);
12781 // The MOVLHPS Mask:
12782 static const int ShufMask2[] = {0, 1, 4, 5};
12783 SDValue res = DAG.getVectorShuffle(MVT::v4i32, DL, OpLo, OpHi, ShufMask2);
12784 return DAG.getNode(ISD::BITCAST, DL, MVT::v8i16, res);
12787 // Handle truncation of V256 to V128 using shuffles.
12788 if (!VT.is128BitVector() || !InVT.is256BitVector())
12791 assert(Subtarget->hasFp256() && "256-bit vector without AVX!");
12793 unsigned NumElems = VT.getVectorNumElements();
12794 MVT NVT = MVT::getVectorVT(VT.getVectorElementType(), NumElems * 2);
12796 SmallVector<int, 16> MaskVec(NumElems * 2, -1);
12797 // Prepare truncation shuffle mask
12798 for (unsigned i = 0; i != NumElems; ++i)
12799 MaskVec[i] = i * 2;
12800 SDValue V = DAG.getVectorShuffle(NVT, DL,
12801 DAG.getNode(ISD::BITCAST, DL, NVT, In),
12802 DAG.getUNDEF(NVT), &MaskVec[0]);
12803 return DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, VT, V,
12804 DAG.getIntPtrConstant(0));
12807 SDValue X86TargetLowering::LowerFP_TO_SINT(SDValue Op,
12808 SelectionDAG &DAG) const {
12809 assert(!Op.getSimpleValueType().isVector());
12811 std::pair<SDValue,SDValue> Vals = FP_TO_INTHelper(Op, DAG,
12812 /*IsSigned=*/ true, /*IsReplace=*/ false);
12813 SDValue FIST = Vals.first, StackSlot = Vals.second;
12814 // If FP_TO_INTHelper failed, the node is actually supposed to be Legal.
12815 if (!FIST.getNode()) return Op;
12817 if (StackSlot.getNode())
12818 // Load the result.
12819 return DAG.getLoad(Op.getValueType(), SDLoc(Op),
12820 FIST, StackSlot, MachinePointerInfo(),
12821 false, false, false, 0);
12823 // The node is the result.
12827 SDValue X86TargetLowering::LowerFP_TO_UINT(SDValue Op,
12828 SelectionDAG &DAG) const {
12829 std::pair<SDValue,SDValue> Vals = FP_TO_INTHelper(Op, DAG,
12830 /*IsSigned=*/ false, /*IsReplace=*/ false);
12831 SDValue FIST = Vals.first, StackSlot = Vals.second;
12832 assert(FIST.getNode() && "Unexpected failure");
12834 if (StackSlot.getNode())
12835 // Load the result.
12836 return DAG.getLoad(Op.getValueType(), SDLoc(Op),
12837 FIST, StackSlot, MachinePointerInfo(),
12838 false, false, false, 0);
12840 // The node is the result.
12844 static SDValue LowerFP_EXTEND(SDValue Op, SelectionDAG &DAG) {
12846 MVT VT = Op.getSimpleValueType();
12847 SDValue In = Op.getOperand(0);
12848 MVT SVT = In.getSimpleValueType();
12850 assert(SVT == MVT::v2f32 && "Only customize MVT::v2f32 type legalization!");
12852 return DAG.getNode(X86ISD::VFPEXT, DL, VT,
12853 DAG.getNode(ISD::CONCAT_VECTORS, DL, MVT::v4f32,
12854 In, DAG.getUNDEF(SVT)));
12857 // The only differences between FABS and FNEG are the mask and the logic op.
12858 static SDValue LowerFABSorFNEG(SDValue Op, SelectionDAG &DAG) {
12859 assert((Op.getOpcode() == ISD::FABS || Op.getOpcode() == ISD::FNEG) &&
12860 "Wrong opcode for lowering FABS or FNEG.");
12862 bool IsFABS = (Op.getOpcode() == ISD::FABS);
12864 MVT VT = Op.getSimpleValueType();
12865 // Assume scalar op for initialization; update for vector if needed.
12866 // Note that there are no scalar bitwise logical SSE/AVX instructions, so we
12867 // generate a 16-byte vector constant and logic op even for the scalar case.
12868 // Using a 16-byte mask allows folding the load of the mask with
12869 // the logic op, so it can save (~4 bytes) on code size.
12871 unsigned NumElts = VT == MVT::f64 ? 2 : 4;
12872 // FIXME: Use function attribute "OptimizeForSize" and/or CodeGenOpt::Level to
12873 // decide if we should generate a 16-byte constant mask when we only need 4 or
12874 // 8 bytes for the scalar case.
12875 if (VT.isVector()) {
12876 EltVT = VT.getVectorElementType();
12877 NumElts = VT.getVectorNumElements();
12880 unsigned EltBits = EltVT.getSizeInBits();
12881 LLVMContext *Context = DAG.getContext();
12882 // For FABS, mask is 0x7f...; for FNEG, mask is 0x80...
12884 IsFABS ? APInt::getSignedMaxValue(EltBits) : APInt::getSignBit(EltBits);
12885 Constant *C = ConstantInt::get(*Context, MaskElt);
12886 C = ConstantVector::getSplat(NumElts, C);
12887 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
12888 SDValue CPIdx = DAG.getConstantPool(C, TLI.getPointerTy());
12889 unsigned Alignment = cast<ConstantPoolSDNode>(CPIdx)->getAlignment();
12890 SDValue Mask = DAG.getLoad(VT, dl, DAG.getEntryNode(), CPIdx,
12891 MachinePointerInfo::getConstantPool(),
12892 false, false, false, Alignment);
12894 if (VT.isVector()) {
12895 // For a vector, cast operands to a vector type, perform the logic op,
12896 // and cast the result back to the original value type.
12897 MVT VecVT = MVT::getVectorVT(MVT::i64, VT.getSizeInBits() / 64);
12898 SDValue Op0Casted = DAG.getNode(ISD::BITCAST, dl, VecVT, Op.getOperand(0));
12899 SDValue MaskCasted = DAG.getNode(ISD::BITCAST, dl, VecVT, Mask);
12900 unsigned LogicOp = IsFABS ? ISD::AND : ISD::XOR;
12901 return DAG.getNode(ISD::BITCAST, dl, VT,
12902 DAG.getNode(LogicOp, dl, VecVT, Op0Casted, MaskCasted));
12904 // If not vector, then scalar.
12905 unsigned LogicOp = IsFABS ? X86ISD::FAND : X86ISD::FXOR;
12906 return DAG.getNode(LogicOp, dl, VT, Op.getOperand(0), Mask);
12909 static SDValue LowerFCOPYSIGN(SDValue Op, SelectionDAG &DAG) {
12910 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
12911 LLVMContext *Context = DAG.getContext();
12912 SDValue Op0 = Op.getOperand(0);
12913 SDValue Op1 = Op.getOperand(1);
12915 MVT VT = Op.getSimpleValueType();
12916 MVT SrcVT = Op1.getSimpleValueType();
12918 // If second operand is smaller, extend it first.
12919 if (SrcVT.bitsLT(VT)) {
12920 Op1 = DAG.getNode(ISD::FP_EXTEND, dl, VT, Op1);
12923 // And if it is bigger, shrink it first.
12924 if (SrcVT.bitsGT(VT)) {
12925 Op1 = DAG.getNode(ISD::FP_ROUND, dl, VT, Op1, DAG.getIntPtrConstant(1));
12929 // At this point the operands and the result should have the same
12930 // type, and that won't be f80 since that is not custom lowered.
12932 // First get the sign bit of second operand.
12933 SmallVector<Constant*,4> CV;
12934 if (SrcVT == MVT::f64) {
12935 const fltSemantics &Sem = APFloat::IEEEdouble;
12936 CV.push_back(ConstantFP::get(*Context, APFloat(Sem, APInt(64, 1ULL << 63))));
12937 CV.push_back(ConstantFP::get(*Context, APFloat(Sem, APInt(64, 0))));
12939 const fltSemantics &Sem = APFloat::IEEEsingle;
12940 CV.push_back(ConstantFP::get(*Context, APFloat(Sem, APInt(32, 1U << 31))));
12941 CV.push_back(ConstantFP::get(*Context, APFloat(Sem, APInt(32, 0))));
12942 CV.push_back(ConstantFP::get(*Context, APFloat(Sem, APInt(32, 0))));
12943 CV.push_back(ConstantFP::get(*Context, APFloat(Sem, APInt(32, 0))));
12945 Constant *C = ConstantVector::get(CV);
12946 SDValue CPIdx = DAG.getConstantPool(C, TLI.getPointerTy(), 16);
12947 SDValue Mask1 = DAG.getLoad(SrcVT, dl, DAG.getEntryNode(), CPIdx,
12948 MachinePointerInfo::getConstantPool(),
12949 false, false, false, 16);
12950 SDValue SignBit = DAG.getNode(X86ISD::FAND, dl, SrcVT, Op1, Mask1);
12952 // Shift sign bit right or left if the two operands have different types.
12953 if (SrcVT.bitsGT(VT)) {
12954 // Op0 is MVT::f32, Op1 is MVT::f64.
12955 SignBit = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, MVT::v2f64, SignBit);
12956 SignBit = DAG.getNode(X86ISD::FSRL, dl, MVT::v2f64, SignBit,
12957 DAG.getConstant(32, MVT::i32));
12958 SignBit = DAG.getNode(ISD::BITCAST, dl, MVT::v4f32, SignBit);
12959 SignBit = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::f32, SignBit,
12960 DAG.getIntPtrConstant(0));
12963 // Clear first operand sign bit.
12965 if (VT == MVT::f64) {
12966 const fltSemantics &Sem = APFloat::IEEEdouble;
12967 CV.push_back(ConstantFP::get(*Context, APFloat(Sem,
12968 APInt(64, ~(1ULL << 63)))));
12969 CV.push_back(ConstantFP::get(*Context, APFloat(Sem, APInt(64, 0))));
12971 const fltSemantics &Sem = APFloat::IEEEsingle;
12972 CV.push_back(ConstantFP::get(*Context, APFloat(Sem,
12973 APInt(32, ~(1U << 31)))));
12974 CV.push_back(ConstantFP::get(*Context, APFloat(Sem, APInt(32, 0))));
12975 CV.push_back(ConstantFP::get(*Context, APFloat(Sem, APInt(32, 0))));
12976 CV.push_back(ConstantFP::get(*Context, APFloat(Sem, APInt(32, 0))));
12978 C = ConstantVector::get(CV);
12979 CPIdx = DAG.getConstantPool(C, TLI.getPointerTy(), 16);
12980 SDValue Mask2 = DAG.getLoad(VT, dl, DAG.getEntryNode(), CPIdx,
12981 MachinePointerInfo::getConstantPool(),
12982 false, false, false, 16);
12983 SDValue Val = DAG.getNode(X86ISD::FAND, dl, VT, Op0, Mask2);
12985 // Or the value with the sign bit.
12986 return DAG.getNode(X86ISD::FOR, dl, VT, Val, SignBit);
12989 static SDValue LowerFGETSIGN(SDValue Op, SelectionDAG &DAG) {
12990 SDValue N0 = Op.getOperand(0);
12992 MVT VT = Op.getSimpleValueType();
12994 // Lower ISD::FGETSIGN to (AND (X86ISD::FGETSIGNx86 ...) 1).
12995 SDValue xFGETSIGN = DAG.getNode(X86ISD::FGETSIGNx86, dl, VT, N0,
12996 DAG.getConstant(1, VT));
12997 return DAG.getNode(ISD::AND, dl, VT, xFGETSIGN, DAG.getConstant(1, VT));
13000 // LowerVectorAllZeroTest - Check whether an OR'd tree is PTEST-able.
13002 static SDValue LowerVectorAllZeroTest(SDValue Op, const X86Subtarget *Subtarget,
13003 SelectionDAG &DAG) {
13004 assert(Op.getOpcode() == ISD::OR && "Only check OR'd tree.");
13006 if (!Subtarget->hasSSE41())
13009 if (!Op->hasOneUse())
13012 SDNode *N = Op.getNode();
13015 SmallVector<SDValue, 8> Opnds;
13016 DenseMap<SDValue, unsigned> VecInMap;
13017 SmallVector<SDValue, 8> VecIns;
13018 EVT VT = MVT::Other;
13020 // Recognize a special case where a vector is casted into wide integer to
13022 Opnds.push_back(N->getOperand(0));
13023 Opnds.push_back(N->getOperand(1));
13025 for (unsigned Slot = 0, e = Opnds.size(); Slot < e; ++Slot) {
13026 SmallVectorImpl<SDValue>::const_iterator I = Opnds.begin() + Slot;
13027 // BFS traverse all OR'd operands.
13028 if (I->getOpcode() == ISD::OR) {
13029 Opnds.push_back(I->getOperand(0));
13030 Opnds.push_back(I->getOperand(1));
13031 // Re-evaluate the number of nodes to be traversed.
13032 e += 2; // 2 more nodes (LHS and RHS) are pushed.
13036 // Quit if a non-EXTRACT_VECTOR_ELT
13037 if (I->getOpcode() != ISD::EXTRACT_VECTOR_ELT)
13040 // Quit if without a constant index.
13041 SDValue Idx = I->getOperand(1);
13042 if (!isa<ConstantSDNode>(Idx))
13045 SDValue ExtractedFromVec = I->getOperand(0);
13046 DenseMap<SDValue, unsigned>::iterator M = VecInMap.find(ExtractedFromVec);
13047 if (M == VecInMap.end()) {
13048 VT = ExtractedFromVec.getValueType();
13049 // Quit if not 128/256-bit vector.
13050 if (!VT.is128BitVector() && !VT.is256BitVector())
13052 // Quit if not the same type.
13053 if (VecInMap.begin() != VecInMap.end() &&
13054 VT != VecInMap.begin()->first.getValueType())
13056 M = VecInMap.insert(std::make_pair(ExtractedFromVec, 0)).first;
13057 VecIns.push_back(ExtractedFromVec);
13059 M->second |= 1U << cast<ConstantSDNode>(Idx)->getZExtValue();
13062 assert((VT.is128BitVector() || VT.is256BitVector()) &&
13063 "Not extracted from 128-/256-bit vector.");
13065 unsigned FullMask = (1U << VT.getVectorNumElements()) - 1U;
13067 for (DenseMap<SDValue, unsigned>::const_iterator
13068 I = VecInMap.begin(), E = VecInMap.end(); I != E; ++I) {
13069 // Quit if not all elements are used.
13070 if (I->second != FullMask)
13074 EVT TestVT = VT.is128BitVector() ? MVT::v2i64 : MVT::v4i64;
13076 // Cast all vectors into TestVT for PTEST.
13077 for (unsigned i = 0, e = VecIns.size(); i < e; ++i)
13078 VecIns[i] = DAG.getNode(ISD::BITCAST, DL, TestVT, VecIns[i]);
13080 // If more than one full vectors are evaluated, OR them first before PTEST.
13081 for (unsigned Slot = 0, e = VecIns.size(); e - Slot > 1; Slot += 2, e += 1) {
13082 // Each iteration will OR 2 nodes and append the result until there is only
13083 // 1 node left, i.e. the final OR'd value of all vectors.
13084 SDValue LHS = VecIns[Slot];
13085 SDValue RHS = VecIns[Slot + 1];
13086 VecIns.push_back(DAG.getNode(ISD::OR, DL, TestVT, LHS, RHS));
13089 return DAG.getNode(X86ISD::PTEST, DL, MVT::i32,
13090 VecIns.back(), VecIns.back());
13093 /// \brief return true if \c Op has a use that doesn't just read flags.
13094 static bool hasNonFlagsUse(SDValue Op) {
13095 for (SDNode::use_iterator UI = Op->use_begin(), UE = Op->use_end(); UI != UE;
13097 SDNode *User = *UI;
13098 unsigned UOpNo = UI.getOperandNo();
13099 if (User->getOpcode() == ISD::TRUNCATE && User->hasOneUse()) {
13100 // Look pass truncate.
13101 UOpNo = User->use_begin().getOperandNo();
13102 User = *User->use_begin();
13105 if (User->getOpcode() != ISD::BRCOND && User->getOpcode() != ISD::SETCC &&
13106 !(User->getOpcode() == ISD::SELECT && UOpNo == 0))
13112 /// Emit nodes that will be selected as "test Op0,Op0", or something
13114 SDValue X86TargetLowering::EmitTest(SDValue Op, unsigned X86CC, SDLoc dl,
13115 SelectionDAG &DAG) const {
13116 if (Op.getValueType() == MVT::i1)
13117 // KORTEST instruction should be selected
13118 return DAG.getNode(X86ISD::CMP, dl, MVT::i32, Op,
13119 DAG.getConstant(0, Op.getValueType()));
13121 // CF and OF aren't always set the way we want. Determine which
13122 // of these we need.
13123 bool NeedCF = false;
13124 bool NeedOF = false;
13127 case X86::COND_A: case X86::COND_AE:
13128 case X86::COND_B: case X86::COND_BE:
13131 case X86::COND_G: case X86::COND_GE:
13132 case X86::COND_L: case X86::COND_LE:
13133 case X86::COND_O: case X86::COND_NO: {
13134 // Check if we really need to set the
13135 // Overflow flag. If NoSignedWrap is present
13136 // that is not actually needed.
13137 switch (Op->getOpcode()) {
13142 const BinaryWithFlagsSDNode *BinNode =
13143 cast<BinaryWithFlagsSDNode>(Op.getNode());
13144 if (BinNode->hasNoSignedWrap())
13154 // See if we can use the EFLAGS value from the operand instead of
13155 // doing a separate TEST. TEST always sets OF and CF to 0, so unless
13156 // we prove that the arithmetic won't overflow, we can't use OF or CF.
13157 if (Op.getResNo() != 0 || NeedOF || NeedCF) {
13158 // Emit a CMP with 0, which is the TEST pattern.
13159 //if (Op.getValueType() == MVT::i1)
13160 // return DAG.getNode(X86ISD::CMP, dl, MVT::i1, Op,
13161 // DAG.getConstant(0, MVT::i1));
13162 return DAG.getNode(X86ISD::CMP, dl, MVT::i32, Op,
13163 DAG.getConstant(0, Op.getValueType()));
13165 unsigned Opcode = 0;
13166 unsigned NumOperands = 0;
13168 // Truncate operations may prevent the merge of the SETCC instruction
13169 // and the arithmetic instruction before it. Attempt to truncate the operands
13170 // of the arithmetic instruction and use a reduced bit-width instruction.
13171 bool NeedTruncation = false;
13172 SDValue ArithOp = Op;
13173 if (Op->getOpcode() == ISD::TRUNCATE && Op->hasOneUse()) {
13174 SDValue Arith = Op->getOperand(0);
13175 // Both the trunc and the arithmetic op need to have one user each.
13176 if (Arith->hasOneUse())
13177 switch (Arith.getOpcode()) {
13184 NeedTruncation = true;
13190 // NOTICE: In the code below we use ArithOp to hold the arithmetic operation
13191 // which may be the result of a CAST. We use the variable 'Op', which is the
13192 // non-casted variable when we check for possible users.
13193 switch (ArithOp.getOpcode()) {
13195 // Due to an isel shortcoming, be conservative if this add is likely to be
13196 // selected as part of a load-modify-store instruction. When the root node
13197 // in a match is a store, isel doesn't know how to remap non-chain non-flag
13198 // uses of other nodes in the match, such as the ADD in this case. This
13199 // leads to the ADD being left around and reselected, with the result being
13200 // two adds in the output. Alas, even if none our users are stores, that
13201 // doesn't prove we're O.K. Ergo, if we have any parents that aren't
13202 // CopyToReg or SETCC, eschew INC/DEC. A better fix seems to require
13203 // climbing the DAG back to the root, and it doesn't seem to be worth the
13205 for (SDNode::use_iterator UI = Op.getNode()->use_begin(),
13206 UE = Op.getNode()->use_end(); UI != UE; ++UI)
13207 if (UI->getOpcode() != ISD::CopyToReg &&
13208 UI->getOpcode() != ISD::SETCC &&
13209 UI->getOpcode() != ISD::STORE)
13212 if (ConstantSDNode *C =
13213 dyn_cast<ConstantSDNode>(ArithOp.getNode()->getOperand(1))) {
13214 // An add of one will be selected as an INC.
13215 if (C->getAPIntValue() == 1 && !Subtarget->slowIncDec()) {
13216 Opcode = X86ISD::INC;
13221 // An add of negative one (subtract of one) will be selected as a DEC.
13222 if (C->getAPIntValue().isAllOnesValue() && !Subtarget->slowIncDec()) {
13223 Opcode = X86ISD::DEC;
13229 // Otherwise use a regular EFLAGS-setting add.
13230 Opcode = X86ISD::ADD;
13235 // If we have a constant logical shift that's only used in a comparison
13236 // against zero turn it into an equivalent AND. This allows turning it into
13237 // a TEST instruction later.
13238 if ((X86CC == X86::COND_E || X86CC == X86::COND_NE) && Op->hasOneUse() &&
13239 isa<ConstantSDNode>(Op->getOperand(1)) && !hasNonFlagsUse(Op)) {
13240 EVT VT = Op.getValueType();
13241 unsigned BitWidth = VT.getSizeInBits();
13242 unsigned ShAmt = Op->getConstantOperandVal(1);
13243 if (ShAmt >= BitWidth) // Avoid undefined shifts.
13245 APInt Mask = ArithOp.getOpcode() == ISD::SRL
13246 ? APInt::getHighBitsSet(BitWidth, BitWidth - ShAmt)
13247 : APInt::getLowBitsSet(BitWidth, BitWidth - ShAmt);
13248 if (!Mask.isSignedIntN(32)) // Avoid large immediates.
13250 SDValue New = DAG.getNode(ISD::AND, dl, VT, Op->getOperand(0),
13251 DAG.getConstant(Mask, VT));
13252 DAG.ReplaceAllUsesWith(Op, New);
13258 // If the primary and result isn't used, don't bother using X86ISD::AND,
13259 // because a TEST instruction will be better.
13260 if (!hasNonFlagsUse(Op))
13266 // Due to the ISEL shortcoming noted above, be conservative if this op is
13267 // likely to be selected as part of a load-modify-store instruction.
13268 for (SDNode::use_iterator UI = Op.getNode()->use_begin(),
13269 UE = Op.getNode()->use_end(); UI != UE; ++UI)
13270 if (UI->getOpcode() == ISD::STORE)
13273 // Otherwise use a regular EFLAGS-setting instruction.
13274 switch (ArithOp.getOpcode()) {
13275 default: llvm_unreachable("unexpected operator!");
13276 case ISD::SUB: Opcode = X86ISD::SUB; break;
13277 case ISD::XOR: Opcode = X86ISD::XOR; break;
13278 case ISD::AND: Opcode = X86ISD::AND; break;
13280 if (!NeedTruncation && (X86CC == X86::COND_E || X86CC == X86::COND_NE)) {
13281 SDValue EFLAGS = LowerVectorAllZeroTest(Op, Subtarget, DAG);
13282 if (EFLAGS.getNode())
13285 Opcode = X86ISD::OR;
13299 return SDValue(Op.getNode(), 1);
13305 // If we found that truncation is beneficial, perform the truncation and
13307 if (NeedTruncation) {
13308 EVT VT = Op.getValueType();
13309 SDValue WideVal = Op->getOperand(0);
13310 EVT WideVT = WideVal.getValueType();
13311 unsigned ConvertedOp = 0;
13312 // Use a target machine opcode to prevent further DAGCombine
13313 // optimizations that may separate the arithmetic operations
13314 // from the setcc node.
13315 switch (WideVal.getOpcode()) {
13317 case ISD::ADD: ConvertedOp = X86ISD::ADD; break;
13318 case ISD::SUB: ConvertedOp = X86ISD::SUB; break;
13319 case ISD::AND: ConvertedOp = X86ISD::AND; break;
13320 case ISD::OR: ConvertedOp = X86ISD::OR; break;
13321 case ISD::XOR: ConvertedOp = X86ISD::XOR; break;
13325 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
13326 if (TLI.isOperationLegal(WideVal.getOpcode(), WideVT)) {
13327 SDValue V0 = DAG.getNode(ISD::TRUNCATE, dl, VT, WideVal.getOperand(0));
13328 SDValue V1 = DAG.getNode(ISD::TRUNCATE, dl, VT, WideVal.getOperand(1));
13329 Op = DAG.getNode(ConvertedOp, dl, VT, V0, V1);
13335 // Emit a CMP with 0, which is the TEST pattern.
13336 return DAG.getNode(X86ISD::CMP, dl, MVT::i32, Op,
13337 DAG.getConstant(0, Op.getValueType()));
13339 SDVTList VTs = DAG.getVTList(Op.getValueType(), MVT::i32);
13340 SmallVector<SDValue, 4> Ops;
13341 for (unsigned i = 0; i != NumOperands; ++i)
13342 Ops.push_back(Op.getOperand(i));
13344 SDValue New = DAG.getNode(Opcode, dl, VTs, Ops);
13345 DAG.ReplaceAllUsesWith(Op, New);
13346 return SDValue(New.getNode(), 1);
13349 /// Emit nodes that will be selected as "cmp Op0,Op1", or something
13351 SDValue X86TargetLowering::EmitCmp(SDValue Op0, SDValue Op1, unsigned X86CC,
13352 SDLoc dl, SelectionDAG &DAG) const {
13353 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op1)) {
13354 if (C->getAPIntValue() == 0)
13355 return EmitTest(Op0, X86CC, dl, DAG);
13357 if (Op0.getValueType() == MVT::i1)
13358 llvm_unreachable("Unexpected comparison operation for MVT::i1 operands");
13361 if ((Op0.getValueType() == MVT::i8 || Op0.getValueType() == MVT::i16 ||
13362 Op0.getValueType() == MVT::i32 || Op0.getValueType() == MVT::i64)) {
13363 // Do the comparison at i32 if it's smaller, besides the Atom case.
13364 // This avoids subregister aliasing issues. Keep the smaller reference
13365 // if we're optimizing for size, however, as that'll allow better folding
13366 // of memory operations.
13367 if (Op0.getValueType() != MVT::i32 && Op0.getValueType() != MVT::i64 &&
13368 !DAG.getMachineFunction().getFunction()->getAttributes().hasAttribute(
13369 AttributeSet::FunctionIndex, Attribute::MinSize) &&
13370 !Subtarget->isAtom()) {
13371 unsigned ExtendOp =
13372 isX86CCUnsigned(X86CC) ? ISD::ZERO_EXTEND : ISD::SIGN_EXTEND;
13373 Op0 = DAG.getNode(ExtendOp, dl, MVT::i32, Op0);
13374 Op1 = DAG.getNode(ExtendOp, dl, MVT::i32, Op1);
13376 // Use SUB instead of CMP to enable CSE between SUB and CMP.
13377 SDVTList VTs = DAG.getVTList(Op0.getValueType(), MVT::i32);
13378 SDValue Sub = DAG.getNode(X86ISD::SUB, dl, VTs,
13380 return SDValue(Sub.getNode(), 1);
13382 return DAG.getNode(X86ISD::CMP, dl, MVT::i32, Op0, Op1);
13385 /// Convert a comparison if required by the subtarget.
13386 SDValue X86TargetLowering::ConvertCmpIfNecessary(SDValue Cmp,
13387 SelectionDAG &DAG) const {
13388 // If the subtarget does not support the FUCOMI instruction, floating-point
13389 // comparisons have to be converted.
13390 if (Subtarget->hasCMov() ||
13391 Cmp.getOpcode() != X86ISD::CMP ||
13392 !Cmp.getOperand(0).getValueType().isFloatingPoint() ||
13393 !Cmp.getOperand(1).getValueType().isFloatingPoint())
13396 // The instruction selector will select an FUCOM instruction instead of
13397 // FUCOMI, which writes the comparison result to FPSW instead of EFLAGS. Hence
13398 // build an SDNode sequence that transfers the result from FPSW into EFLAGS:
13399 // (X86sahf (trunc (srl (X86fp_stsw (trunc (X86cmp ...)), 8))))
13401 SDValue TruncFPSW = DAG.getNode(ISD::TRUNCATE, dl, MVT::i16, Cmp);
13402 SDValue FNStSW = DAG.getNode(X86ISD::FNSTSW16r, dl, MVT::i16, TruncFPSW);
13403 SDValue Srl = DAG.getNode(ISD::SRL, dl, MVT::i16, FNStSW,
13404 DAG.getConstant(8, MVT::i8));
13405 SDValue TruncSrl = DAG.getNode(ISD::TRUNCATE, dl, MVT::i8, Srl);
13406 return DAG.getNode(X86ISD::SAHF, dl, MVT::i32, TruncSrl);
13409 static bool isAllOnes(SDValue V) {
13410 ConstantSDNode *C = dyn_cast<ConstantSDNode>(V);
13411 return C && C->isAllOnesValue();
13414 /// LowerToBT - Result of 'and' is compared against zero. Turn it into a BT node
13415 /// if it's possible.
13416 SDValue X86TargetLowering::LowerToBT(SDValue And, ISD::CondCode CC,
13417 SDLoc dl, SelectionDAG &DAG) const {
13418 SDValue Op0 = And.getOperand(0);
13419 SDValue Op1 = And.getOperand(1);
13420 if (Op0.getOpcode() == ISD::TRUNCATE)
13421 Op0 = Op0.getOperand(0);
13422 if (Op1.getOpcode() == ISD::TRUNCATE)
13423 Op1 = Op1.getOperand(0);
13426 if (Op1.getOpcode() == ISD::SHL)
13427 std::swap(Op0, Op1);
13428 if (Op0.getOpcode() == ISD::SHL) {
13429 if (ConstantSDNode *And00C = dyn_cast<ConstantSDNode>(Op0.getOperand(0)))
13430 if (And00C->getZExtValue() == 1) {
13431 // If we looked past a truncate, check that it's only truncating away
13433 unsigned BitWidth = Op0.getValueSizeInBits();
13434 unsigned AndBitWidth = And.getValueSizeInBits();
13435 if (BitWidth > AndBitWidth) {
13437 DAG.computeKnownBits(Op0, Zeros, Ones);
13438 if (Zeros.countLeadingOnes() < BitWidth - AndBitWidth)
13442 RHS = Op0.getOperand(1);
13444 } else if (Op1.getOpcode() == ISD::Constant) {
13445 ConstantSDNode *AndRHS = cast<ConstantSDNode>(Op1);
13446 uint64_t AndRHSVal = AndRHS->getZExtValue();
13447 SDValue AndLHS = Op0;
13449 if (AndRHSVal == 1 && AndLHS.getOpcode() == ISD::SRL) {
13450 LHS = AndLHS.getOperand(0);
13451 RHS = AndLHS.getOperand(1);
13454 // Use BT if the immediate can't be encoded in a TEST instruction.
13455 if (!isUInt<32>(AndRHSVal) && isPowerOf2_64(AndRHSVal)) {
13457 RHS = DAG.getConstant(Log2_64_Ceil(AndRHSVal), LHS.getValueType());
13461 if (LHS.getNode()) {
13462 // If LHS is i8, promote it to i32 with any_extend. There is no i8 BT
13463 // instruction. Since the shift amount is in-range-or-undefined, we know
13464 // that doing a bittest on the i32 value is ok. We extend to i32 because
13465 // the encoding for the i16 version is larger than the i32 version.
13466 // Also promote i16 to i32 for performance / code size reason.
13467 if (LHS.getValueType() == MVT::i8 ||
13468 LHS.getValueType() == MVT::i16)
13469 LHS = DAG.getNode(ISD::ANY_EXTEND, dl, MVT::i32, LHS);
13471 // If the operand types disagree, extend the shift amount to match. Since
13472 // BT ignores high bits (like shifts) we can use anyextend.
13473 if (LHS.getValueType() != RHS.getValueType())
13474 RHS = DAG.getNode(ISD::ANY_EXTEND, dl, LHS.getValueType(), RHS);
13476 SDValue BT = DAG.getNode(X86ISD::BT, dl, MVT::i32, LHS, RHS);
13477 X86::CondCode Cond = CC == ISD::SETEQ ? X86::COND_AE : X86::COND_B;
13478 return DAG.getNode(X86ISD::SETCC, dl, MVT::i8,
13479 DAG.getConstant(Cond, MVT::i8), BT);
13485 /// \brief - Turns an ISD::CondCode into a value suitable for SSE floating point
13487 static int translateX86FSETCC(ISD::CondCode SetCCOpcode, SDValue &Op0,
13492 // SSE Condition code mapping:
13501 switch (SetCCOpcode) {
13502 default: llvm_unreachable("Unexpected SETCC condition");
13504 case ISD::SETEQ: SSECC = 0; break;
13506 case ISD::SETGT: Swap = true; // Fallthrough
13508 case ISD::SETOLT: SSECC = 1; break;
13510 case ISD::SETGE: Swap = true; // Fallthrough
13512 case ISD::SETOLE: SSECC = 2; break;
13513 case ISD::SETUO: SSECC = 3; break;
13515 case ISD::SETNE: SSECC = 4; break;
13516 case ISD::SETULE: Swap = true; // Fallthrough
13517 case ISD::SETUGE: SSECC = 5; break;
13518 case ISD::SETULT: Swap = true; // Fallthrough
13519 case ISD::SETUGT: SSECC = 6; break;
13520 case ISD::SETO: SSECC = 7; break;
13522 case ISD::SETONE: SSECC = 8; break;
13525 std::swap(Op0, Op1);
13530 // Lower256IntVSETCC - Break a VSETCC 256-bit integer VSETCC into two new 128
13531 // ones, and then concatenate the result back.
13532 static SDValue Lower256IntVSETCC(SDValue Op, SelectionDAG &DAG) {
13533 MVT VT = Op.getSimpleValueType();
13535 assert(VT.is256BitVector() && Op.getOpcode() == ISD::SETCC &&
13536 "Unsupported value type for operation");
13538 unsigned NumElems = VT.getVectorNumElements();
13540 SDValue CC = Op.getOperand(2);
13542 // Extract the LHS vectors
13543 SDValue LHS = Op.getOperand(0);
13544 SDValue LHS1 = Extract128BitVector(LHS, 0, DAG, dl);
13545 SDValue LHS2 = Extract128BitVector(LHS, NumElems/2, DAG, dl);
13547 // Extract the RHS vectors
13548 SDValue RHS = Op.getOperand(1);
13549 SDValue RHS1 = Extract128BitVector(RHS, 0, DAG, dl);
13550 SDValue RHS2 = Extract128BitVector(RHS, NumElems/2, DAG, dl);
13552 // Issue the operation on the smaller types and concatenate the result back
13553 MVT EltVT = VT.getVectorElementType();
13554 MVT NewVT = MVT::getVectorVT(EltVT, NumElems/2);
13555 return DAG.getNode(ISD::CONCAT_VECTORS, dl, VT,
13556 DAG.getNode(Op.getOpcode(), dl, NewVT, LHS1, RHS1, CC),
13557 DAG.getNode(Op.getOpcode(), dl, NewVT, LHS2, RHS2, CC));
13560 static SDValue LowerIntVSETCC_AVX512(SDValue Op, SelectionDAG &DAG,
13561 const X86Subtarget *Subtarget) {
13562 SDValue Op0 = Op.getOperand(0);
13563 SDValue Op1 = Op.getOperand(1);
13564 SDValue CC = Op.getOperand(2);
13565 MVT VT = Op.getSimpleValueType();
13568 assert(Op0.getValueType().getVectorElementType().getSizeInBits() >= 8 &&
13569 Op.getValueType().getScalarType() == MVT::i1 &&
13570 "Cannot set masked compare for this operation");
13572 ISD::CondCode SetCCOpcode = cast<CondCodeSDNode>(CC)->get();
13574 bool Unsigned = false;
13577 switch (SetCCOpcode) {
13578 default: llvm_unreachable("Unexpected SETCC condition");
13579 case ISD::SETNE: SSECC = 4; break;
13580 case ISD::SETEQ: Opc = X86ISD::PCMPEQM; break;
13581 case ISD::SETUGT: SSECC = 6; Unsigned = true; break;
13582 case ISD::SETLT: Swap = true; //fall-through
13583 case ISD::SETGT: Opc = X86ISD::PCMPGTM; break;
13584 case ISD::SETULT: SSECC = 1; Unsigned = true; break;
13585 case ISD::SETUGE: SSECC = 5; Unsigned = true; break; //NLT
13586 case ISD::SETGE: Swap = true; SSECC = 2; break; // LE + swap
13587 case ISD::SETULE: Unsigned = true; //fall-through
13588 case ISD::SETLE: SSECC = 2; break;
13592 std::swap(Op0, Op1);
13594 return DAG.getNode(Opc, dl, VT, Op0, Op1);
13595 Opc = Unsigned ? X86ISD::CMPMU: X86ISD::CMPM;
13596 return DAG.getNode(Opc, dl, VT, Op0, Op1,
13597 DAG.getConstant(SSECC, MVT::i8));
13600 /// \brief Try to turn a VSETULT into a VSETULE by modifying its second
13601 /// operand \p Op1. If non-trivial (for example because it's not constant)
13602 /// return an empty value.
13603 static SDValue ChangeVSETULTtoVSETULE(SDLoc dl, SDValue Op1, SelectionDAG &DAG)
13605 BuildVectorSDNode *BV = dyn_cast<BuildVectorSDNode>(Op1.getNode());
13609 MVT VT = Op1.getSimpleValueType();
13610 MVT EVT = VT.getVectorElementType();
13611 unsigned n = VT.getVectorNumElements();
13612 SmallVector<SDValue, 8> ULTOp1;
13614 for (unsigned i = 0; i < n; ++i) {
13615 ConstantSDNode *Elt = dyn_cast<ConstantSDNode>(BV->getOperand(i));
13616 if (!Elt || Elt->isOpaque() || Elt->getValueType(0) != EVT)
13619 // Avoid underflow.
13620 APInt Val = Elt->getAPIntValue();
13624 ULTOp1.push_back(DAG.getConstant(Val - 1, EVT));
13627 return DAG.getNode(ISD::BUILD_VECTOR, dl, VT, ULTOp1);
13630 static SDValue LowerVSETCC(SDValue Op, const X86Subtarget *Subtarget,
13631 SelectionDAG &DAG) {
13632 SDValue Op0 = Op.getOperand(0);
13633 SDValue Op1 = Op.getOperand(1);
13634 SDValue CC = Op.getOperand(2);
13635 MVT VT = Op.getSimpleValueType();
13636 ISD::CondCode SetCCOpcode = cast<CondCodeSDNode>(CC)->get();
13637 bool isFP = Op.getOperand(1).getSimpleValueType().isFloatingPoint();
13642 MVT EltVT = Op0.getSimpleValueType().getVectorElementType();
13643 assert(EltVT == MVT::f32 || EltVT == MVT::f64);
13646 unsigned SSECC = translateX86FSETCC(SetCCOpcode, Op0, Op1);
13647 unsigned Opc = X86ISD::CMPP;
13648 if (Subtarget->hasAVX512() && VT.getVectorElementType() == MVT::i1) {
13649 assert(VT.getVectorNumElements() <= 16);
13650 Opc = X86ISD::CMPM;
13652 // In the two special cases we can't handle, emit two comparisons.
13655 unsigned CombineOpc;
13656 if (SetCCOpcode == ISD::SETUEQ) {
13657 CC0 = 3; CC1 = 0; CombineOpc = ISD::OR;
13659 assert(SetCCOpcode == ISD::SETONE);
13660 CC0 = 7; CC1 = 4; CombineOpc = ISD::AND;
13663 SDValue Cmp0 = DAG.getNode(Opc, dl, VT, Op0, Op1,
13664 DAG.getConstant(CC0, MVT::i8));
13665 SDValue Cmp1 = DAG.getNode(Opc, dl, VT, Op0, Op1,
13666 DAG.getConstant(CC1, MVT::i8));
13667 return DAG.getNode(CombineOpc, dl, VT, Cmp0, Cmp1);
13669 // Handle all other FP comparisons here.
13670 return DAG.getNode(Opc, dl, VT, Op0, Op1,
13671 DAG.getConstant(SSECC, MVT::i8));
13674 // Break 256-bit integer vector compare into smaller ones.
13675 if (VT.is256BitVector() && !Subtarget->hasInt256())
13676 return Lower256IntVSETCC(Op, DAG);
13678 bool MaskResult = (VT.getVectorElementType() == MVT::i1);
13679 EVT OpVT = Op1.getValueType();
13680 if (Subtarget->hasAVX512()) {
13681 if (Op1.getValueType().is512BitVector() ||
13682 (Subtarget->hasBWI() && Subtarget->hasVLX()) ||
13683 (MaskResult && OpVT.getVectorElementType().getSizeInBits() >= 32))
13684 return LowerIntVSETCC_AVX512(Op, DAG, Subtarget);
13686 // In AVX-512 architecture setcc returns mask with i1 elements,
13687 // But there is no compare instruction for i8 and i16 elements in KNL.
13688 // We are not talking about 512-bit operands in this case, these
13689 // types are illegal.
13691 (OpVT.getVectorElementType().getSizeInBits() < 32 &&
13692 OpVT.getVectorElementType().getSizeInBits() >= 8))
13693 return DAG.getNode(ISD::TRUNCATE, dl, VT,
13694 DAG.getNode(ISD::SETCC, dl, OpVT, Op0, Op1, CC));
13697 // We are handling one of the integer comparisons here. Since SSE only has
13698 // GT and EQ comparisons for integer, swapping operands and multiple
13699 // operations may be required for some comparisons.
13701 bool Swap = false, Invert = false, FlipSigns = false, MinMax = false;
13702 bool Subus = false;
13704 switch (SetCCOpcode) {
13705 default: llvm_unreachable("Unexpected SETCC condition");
13706 case ISD::SETNE: Invert = true;
13707 case ISD::SETEQ: Opc = X86ISD::PCMPEQ; break;
13708 case ISD::SETLT: Swap = true;
13709 case ISD::SETGT: Opc = X86ISD::PCMPGT; break;
13710 case ISD::SETGE: Swap = true;
13711 case ISD::SETLE: Opc = X86ISD::PCMPGT;
13712 Invert = true; break;
13713 case ISD::SETULT: Swap = true;
13714 case ISD::SETUGT: Opc = X86ISD::PCMPGT;
13715 FlipSigns = true; break;
13716 case ISD::SETUGE: Swap = true;
13717 case ISD::SETULE: Opc = X86ISD::PCMPGT;
13718 FlipSigns = true; Invert = true; break;
13721 // Special case: Use min/max operations for SETULE/SETUGE
13722 MVT VET = VT.getVectorElementType();
13724 (Subtarget->hasSSE41() && (VET >= MVT::i8 && VET <= MVT::i32))
13725 || (Subtarget->hasSSE2() && (VET == MVT::i8));
13728 switch (SetCCOpcode) {
13730 case ISD::SETULE: Opc = X86ISD::UMIN; MinMax = true; break;
13731 case ISD::SETUGE: Opc = X86ISD::UMAX; MinMax = true; break;
13734 if (MinMax) { Swap = false; Invert = false; FlipSigns = false; }
13737 bool hasSubus = Subtarget->hasSSE2() && (VET == MVT::i8 || VET == MVT::i16);
13738 if (!MinMax && hasSubus) {
13739 // As another special case, use PSUBUS[BW] when it's profitable. E.g. for
13741 // t = psubus Op0, Op1
13742 // pcmpeq t, <0..0>
13743 switch (SetCCOpcode) {
13745 case ISD::SETULT: {
13746 // If the comparison is against a constant we can turn this into a
13747 // setule. With psubus, setule does not require a swap. This is
13748 // beneficial because the constant in the register is no longer
13749 // destructed as the destination so it can be hoisted out of a loop.
13750 // Only do this pre-AVX since vpcmp* is no longer destructive.
13751 if (Subtarget->hasAVX())
13753 SDValue ULEOp1 = ChangeVSETULTtoVSETULE(dl, Op1, DAG);
13754 if (ULEOp1.getNode()) {
13756 Subus = true; Invert = false; Swap = false;
13760 // Psubus is better than flip-sign because it requires no inversion.
13761 case ISD::SETUGE: Subus = true; Invert = false; Swap = true; break;
13762 case ISD::SETULE: Subus = true; Invert = false; Swap = false; break;
13766 Opc = X86ISD::SUBUS;
13772 std::swap(Op0, Op1);
13774 // Check that the operation in question is available (most are plain SSE2,
13775 // but PCMPGTQ and PCMPEQQ have different requirements).
13776 if (VT == MVT::v2i64) {
13777 if (Opc == X86ISD::PCMPGT && !Subtarget->hasSSE42()) {
13778 assert(Subtarget->hasSSE2() && "Don't know how to lower!");
13780 // First cast everything to the right type.
13781 Op0 = DAG.getNode(ISD::BITCAST, dl, MVT::v4i32, Op0);
13782 Op1 = DAG.getNode(ISD::BITCAST, dl, MVT::v4i32, Op1);
13784 // Since SSE has no unsigned integer comparisons, we need to flip the sign
13785 // bits of the inputs before performing those operations. The lower
13786 // compare is always unsigned.
13789 SB = DAG.getConstant(0x80000000U, MVT::v4i32);
13791 SDValue Sign = DAG.getConstant(0x80000000U, MVT::i32);
13792 SDValue Zero = DAG.getConstant(0x00000000U, MVT::i32);
13793 SB = DAG.getNode(ISD::BUILD_VECTOR, dl, MVT::v4i32,
13794 Sign, Zero, Sign, Zero);
13796 Op0 = DAG.getNode(ISD::XOR, dl, MVT::v4i32, Op0, SB);
13797 Op1 = DAG.getNode(ISD::XOR, dl, MVT::v4i32, Op1, SB);
13799 // Emulate PCMPGTQ with (hi1 > hi2) | ((hi1 == hi2) & (lo1 > lo2))
13800 SDValue GT = DAG.getNode(X86ISD::PCMPGT, dl, MVT::v4i32, Op0, Op1);
13801 SDValue EQ = DAG.getNode(X86ISD::PCMPEQ, dl, MVT::v4i32, Op0, Op1);
13803 // Create masks for only the low parts/high parts of the 64 bit integers.
13804 static const int MaskHi[] = { 1, 1, 3, 3 };
13805 static const int MaskLo[] = { 0, 0, 2, 2 };
13806 SDValue EQHi = DAG.getVectorShuffle(MVT::v4i32, dl, EQ, EQ, MaskHi);
13807 SDValue GTLo = DAG.getVectorShuffle(MVT::v4i32, dl, GT, GT, MaskLo);
13808 SDValue GTHi = DAG.getVectorShuffle(MVT::v4i32, dl, GT, GT, MaskHi);
13810 SDValue Result = DAG.getNode(ISD::AND, dl, MVT::v4i32, EQHi, GTLo);
13811 Result = DAG.getNode(ISD::OR, dl, MVT::v4i32, Result, GTHi);
13814 Result = DAG.getNOT(dl, Result, MVT::v4i32);
13816 return DAG.getNode(ISD::BITCAST, dl, VT, Result);
13819 if (Opc == X86ISD::PCMPEQ && !Subtarget->hasSSE41()) {
13820 // If pcmpeqq is missing but pcmpeqd is available synthesize pcmpeqq with
13821 // pcmpeqd + pshufd + pand.
13822 assert(Subtarget->hasSSE2() && !FlipSigns && "Don't know how to lower!");
13824 // First cast everything to the right type.
13825 Op0 = DAG.getNode(ISD::BITCAST, dl, MVT::v4i32, Op0);
13826 Op1 = DAG.getNode(ISD::BITCAST, dl, MVT::v4i32, Op1);
13829 SDValue Result = DAG.getNode(Opc, dl, MVT::v4i32, Op0, Op1);
13831 // Make sure the lower and upper halves are both all-ones.
13832 static const int Mask[] = { 1, 0, 3, 2 };
13833 SDValue Shuf = DAG.getVectorShuffle(MVT::v4i32, dl, Result, Result, Mask);
13834 Result = DAG.getNode(ISD::AND, dl, MVT::v4i32, Result, Shuf);
13837 Result = DAG.getNOT(dl, Result, MVT::v4i32);
13839 return DAG.getNode(ISD::BITCAST, dl, VT, Result);
13843 // Since SSE has no unsigned integer comparisons, we need to flip the sign
13844 // bits of the inputs before performing those operations.
13846 EVT EltVT = VT.getVectorElementType();
13847 SDValue SB = DAG.getConstant(APInt::getSignBit(EltVT.getSizeInBits()), VT);
13848 Op0 = DAG.getNode(ISD::XOR, dl, VT, Op0, SB);
13849 Op1 = DAG.getNode(ISD::XOR, dl, VT, Op1, SB);
13852 SDValue Result = DAG.getNode(Opc, dl, VT, Op0, Op1);
13854 // If the logical-not of the result is required, perform that now.
13856 Result = DAG.getNOT(dl, Result, VT);
13859 Result = DAG.getNode(X86ISD::PCMPEQ, dl, VT, Op0, Result);
13862 Result = DAG.getNode(X86ISD::PCMPEQ, dl, VT, Result,
13863 getZeroVector(VT, Subtarget, DAG, dl));
13868 SDValue X86TargetLowering::LowerSETCC(SDValue Op, SelectionDAG &DAG) const {
13870 MVT VT = Op.getSimpleValueType();
13872 if (VT.isVector()) return LowerVSETCC(Op, Subtarget, DAG);
13874 assert(((!Subtarget->hasAVX512() && VT == MVT::i8) || (VT == MVT::i1))
13875 && "SetCC type must be 8-bit or 1-bit integer");
13876 SDValue Op0 = Op.getOperand(0);
13877 SDValue Op1 = Op.getOperand(1);
13879 ISD::CondCode CC = cast<CondCodeSDNode>(Op.getOperand(2))->get();
13881 // Optimize to BT if possible.
13882 // Lower (X & (1 << N)) == 0 to BT(X, N).
13883 // Lower ((X >>u N) & 1) != 0 to BT(X, N).
13884 // Lower ((X >>s N) & 1) != 0 to BT(X, N).
13885 if (Op0.getOpcode() == ISD::AND && Op0.hasOneUse() &&
13886 Op1.getOpcode() == ISD::Constant &&
13887 cast<ConstantSDNode>(Op1)->isNullValue() &&
13888 (CC == ISD::SETEQ || CC == ISD::SETNE)) {
13889 SDValue NewSetCC = LowerToBT(Op0, CC, dl, DAG);
13890 if (NewSetCC.getNode())
13894 // Look for X == 0, X == 1, X != 0, or X != 1. We can simplify some forms of
13896 if (Op1.getOpcode() == ISD::Constant &&
13897 (cast<ConstantSDNode>(Op1)->getZExtValue() == 1 ||
13898 cast<ConstantSDNode>(Op1)->isNullValue()) &&
13899 (CC == ISD::SETEQ || CC == ISD::SETNE)) {
13901 // If the input is a setcc, then reuse the input setcc or use a new one with
13902 // the inverted condition.
13903 if (Op0.getOpcode() == X86ISD::SETCC) {
13904 X86::CondCode CCode = (X86::CondCode)Op0.getConstantOperandVal(0);
13905 bool Invert = (CC == ISD::SETNE) ^
13906 cast<ConstantSDNode>(Op1)->isNullValue();
13910 CCode = X86::GetOppositeBranchCondition(CCode);
13911 SDValue SetCC = DAG.getNode(X86ISD::SETCC, dl, MVT::i8,
13912 DAG.getConstant(CCode, MVT::i8),
13913 Op0.getOperand(1));
13915 return DAG.getNode(ISD::TRUNCATE, dl, MVT::i1, SetCC);
13919 if ((Op0.getValueType() == MVT::i1) && (Op1.getOpcode() == ISD::Constant) &&
13920 (cast<ConstantSDNode>(Op1)->getZExtValue() == 1) &&
13921 (CC == ISD::SETEQ || CC == ISD::SETNE)) {
13923 ISD::CondCode NewCC = ISD::getSetCCInverse(CC, true);
13924 return DAG.getSetCC(dl, VT, Op0, DAG.getConstant(0, MVT::i1), NewCC);
13927 bool isFP = Op1.getSimpleValueType().isFloatingPoint();
13928 unsigned X86CC = TranslateX86CC(CC, isFP, Op0, Op1, DAG);
13929 if (X86CC == X86::COND_INVALID)
13932 SDValue EFLAGS = EmitCmp(Op0, Op1, X86CC, dl, DAG);
13933 EFLAGS = ConvertCmpIfNecessary(EFLAGS, DAG);
13934 SDValue SetCC = DAG.getNode(X86ISD::SETCC, dl, MVT::i8,
13935 DAG.getConstant(X86CC, MVT::i8), EFLAGS);
13937 return DAG.getNode(ISD::TRUNCATE, dl, MVT::i1, SetCC);
13941 // isX86LogicalCmp - Return true if opcode is a X86 logical comparison.
13942 static bool isX86LogicalCmp(SDValue Op) {
13943 unsigned Opc = Op.getNode()->getOpcode();
13944 if (Opc == X86ISD::CMP || Opc == X86ISD::COMI || Opc == X86ISD::UCOMI ||
13945 Opc == X86ISD::SAHF)
13947 if (Op.getResNo() == 1 &&
13948 (Opc == X86ISD::ADD ||
13949 Opc == X86ISD::SUB ||
13950 Opc == X86ISD::ADC ||
13951 Opc == X86ISD::SBB ||
13952 Opc == X86ISD::SMUL ||
13953 Opc == X86ISD::UMUL ||
13954 Opc == X86ISD::INC ||
13955 Opc == X86ISD::DEC ||
13956 Opc == X86ISD::OR ||
13957 Opc == X86ISD::XOR ||
13958 Opc == X86ISD::AND))
13961 if (Op.getResNo() == 2 && Opc == X86ISD::UMUL)
13967 static bool isTruncWithZeroHighBitsInput(SDValue V, SelectionDAG &DAG) {
13968 if (V.getOpcode() != ISD::TRUNCATE)
13971 SDValue VOp0 = V.getOperand(0);
13972 unsigned InBits = VOp0.getValueSizeInBits();
13973 unsigned Bits = V.getValueSizeInBits();
13974 return DAG.MaskedValueIsZero(VOp0, APInt::getHighBitsSet(InBits,InBits-Bits));
13977 SDValue X86TargetLowering::LowerSELECT(SDValue Op, SelectionDAG &DAG) const {
13978 bool addTest = true;
13979 SDValue Cond = Op.getOperand(0);
13980 SDValue Op1 = Op.getOperand(1);
13981 SDValue Op2 = Op.getOperand(2);
13983 EVT VT = Op1.getValueType();
13986 // Lower fp selects into a CMP/AND/ANDN/OR sequence when the necessary SSE ops
13987 // are available. Otherwise fp cmovs get lowered into a less efficient branch
13988 // sequence later on.
13989 if (Cond.getOpcode() == ISD::SETCC &&
13990 ((Subtarget->hasSSE2() && (VT == MVT::f32 || VT == MVT::f64)) ||
13991 (Subtarget->hasSSE1() && VT == MVT::f32)) &&
13992 VT == Cond.getOperand(0).getValueType() && Cond->hasOneUse()) {
13993 SDValue CondOp0 = Cond.getOperand(0), CondOp1 = Cond.getOperand(1);
13994 int SSECC = translateX86FSETCC(
13995 cast<CondCodeSDNode>(Cond.getOperand(2))->get(), CondOp0, CondOp1);
13998 if (Subtarget->hasAVX512()) {
13999 SDValue Cmp = DAG.getNode(X86ISD::FSETCC, DL, MVT::i1, CondOp0, CondOp1,
14000 DAG.getConstant(SSECC, MVT::i8));
14001 return DAG.getNode(X86ISD::SELECT, DL, VT, Cmp, Op1, Op2);
14003 SDValue Cmp = DAG.getNode(X86ISD::FSETCC, DL, VT, CondOp0, CondOp1,
14004 DAG.getConstant(SSECC, MVT::i8));
14005 SDValue AndN = DAG.getNode(X86ISD::FANDN, DL, VT, Cmp, Op2);
14006 SDValue And = DAG.getNode(X86ISD::FAND, DL, VT, Cmp, Op1);
14007 return DAG.getNode(X86ISD::FOR, DL, VT, AndN, And);
14011 if (Cond.getOpcode() == ISD::SETCC) {
14012 SDValue NewCond = LowerSETCC(Cond, DAG);
14013 if (NewCond.getNode())
14017 // (select (x == 0), -1, y) -> (sign_bit (x - 1)) | y
14018 // (select (x == 0), y, -1) -> ~(sign_bit (x - 1)) | y
14019 // (select (x != 0), y, -1) -> (sign_bit (x - 1)) | y
14020 // (select (x != 0), -1, y) -> ~(sign_bit (x - 1)) | y
14021 if (Cond.getOpcode() == X86ISD::SETCC &&
14022 Cond.getOperand(1).getOpcode() == X86ISD::CMP &&
14023 isZero(Cond.getOperand(1).getOperand(1))) {
14024 SDValue Cmp = Cond.getOperand(1);
14026 unsigned CondCode =cast<ConstantSDNode>(Cond.getOperand(0))->getZExtValue();
14028 if ((isAllOnes(Op1) || isAllOnes(Op2)) &&
14029 (CondCode == X86::COND_E || CondCode == X86::COND_NE)) {
14030 SDValue Y = isAllOnes(Op2) ? Op1 : Op2;
14032 SDValue CmpOp0 = Cmp.getOperand(0);
14033 // Apply further optimizations for special cases
14034 // (select (x != 0), -1, 0) -> neg & sbb
14035 // (select (x == 0), 0, -1) -> neg & sbb
14036 if (ConstantSDNode *YC = dyn_cast<ConstantSDNode>(Y))
14037 if (YC->isNullValue() &&
14038 (isAllOnes(Op1) == (CondCode == X86::COND_NE))) {
14039 SDVTList VTs = DAG.getVTList(CmpOp0.getValueType(), MVT::i32);
14040 SDValue Neg = DAG.getNode(X86ISD::SUB, DL, VTs,
14041 DAG.getConstant(0, CmpOp0.getValueType()),
14043 SDValue Res = DAG.getNode(X86ISD::SETCC_CARRY, DL, Op.getValueType(),
14044 DAG.getConstant(X86::COND_B, MVT::i8),
14045 SDValue(Neg.getNode(), 1));
14049 Cmp = DAG.getNode(X86ISD::CMP, DL, MVT::i32,
14050 CmpOp0, DAG.getConstant(1, CmpOp0.getValueType()));
14051 Cmp = ConvertCmpIfNecessary(Cmp, DAG);
14053 SDValue Res = // Res = 0 or -1.
14054 DAG.getNode(X86ISD::SETCC_CARRY, DL, Op.getValueType(),
14055 DAG.getConstant(X86::COND_B, MVT::i8), Cmp);
14057 if (isAllOnes(Op1) != (CondCode == X86::COND_E))
14058 Res = DAG.getNOT(DL, Res, Res.getValueType());
14060 ConstantSDNode *N2C = dyn_cast<ConstantSDNode>(Op2);
14061 if (!N2C || !N2C->isNullValue())
14062 Res = DAG.getNode(ISD::OR, DL, Res.getValueType(), Res, Y);
14067 // Look past (and (setcc_carry (cmp ...)), 1).
14068 if (Cond.getOpcode() == ISD::AND &&
14069 Cond.getOperand(0).getOpcode() == X86ISD::SETCC_CARRY) {
14070 ConstantSDNode *C = dyn_cast<ConstantSDNode>(Cond.getOperand(1));
14071 if (C && C->getAPIntValue() == 1)
14072 Cond = Cond.getOperand(0);
14075 // If condition flag is set by a X86ISD::CMP, then use it as the condition
14076 // setting operand in place of the X86ISD::SETCC.
14077 unsigned CondOpcode = Cond.getOpcode();
14078 if (CondOpcode == X86ISD::SETCC ||
14079 CondOpcode == X86ISD::SETCC_CARRY) {
14080 CC = Cond.getOperand(0);
14082 SDValue Cmp = Cond.getOperand(1);
14083 unsigned Opc = Cmp.getOpcode();
14084 MVT VT = Op.getSimpleValueType();
14086 bool IllegalFPCMov = false;
14087 if (VT.isFloatingPoint() && !VT.isVector() &&
14088 !isScalarFPTypeInSSEReg(VT)) // FPStack?
14089 IllegalFPCMov = !hasFPCMov(cast<ConstantSDNode>(CC)->getSExtValue());
14091 if ((isX86LogicalCmp(Cmp) && !IllegalFPCMov) ||
14092 Opc == X86ISD::BT) { // FIXME
14096 } else if (CondOpcode == ISD::USUBO || CondOpcode == ISD::SSUBO ||
14097 CondOpcode == ISD::UADDO || CondOpcode == ISD::SADDO ||
14098 ((CondOpcode == ISD::UMULO || CondOpcode == ISD::SMULO) &&
14099 Cond.getOperand(0).getValueType() != MVT::i8)) {
14100 SDValue LHS = Cond.getOperand(0);
14101 SDValue RHS = Cond.getOperand(1);
14102 unsigned X86Opcode;
14105 switch (CondOpcode) {
14106 case ISD::UADDO: X86Opcode = X86ISD::ADD; X86Cond = X86::COND_B; break;
14107 case ISD::SADDO: X86Opcode = X86ISD::ADD; X86Cond = X86::COND_O; break;
14108 case ISD::USUBO: X86Opcode = X86ISD::SUB; X86Cond = X86::COND_B; break;
14109 case ISD::SSUBO: X86Opcode = X86ISD::SUB; X86Cond = X86::COND_O; break;
14110 case ISD::UMULO: X86Opcode = X86ISD::UMUL; X86Cond = X86::COND_O; break;
14111 case ISD::SMULO: X86Opcode = X86ISD::SMUL; X86Cond = X86::COND_O; break;
14112 default: llvm_unreachable("unexpected overflowing operator");
14114 if (CondOpcode == ISD::UMULO)
14115 VTs = DAG.getVTList(LHS.getValueType(), LHS.getValueType(),
14118 VTs = DAG.getVTList(LHS.getValueType(), MVT::i32);
14120 SDValue X86Op = DAG.getNode(X86Opcode, DL, VTs, LHS, RHS);
14122 if (CondOpcode == ISD::UMULO)
14123 Cond = X86Op.getValue(2);
14125 Cond = X86Op.getValue(1);
14127 CC = DAG.getConstant(X86Cond, MVT::i8);
14132 // Look pass the truncate if the high bits are known zero.
14133 if (isTruncWithZeroHighBitsInput(Cond, DAG))
14134 Cond = Cond.getOperand(0);
14136 // We know the result of AND is compared against zero. Try to match
14138 if (Cond.getOpcode() == ISD::AND && Cond.hasOneUse()) {
14139 SDValue NewSetCC = LowerToBT(Cond, ISD::SETNE, DL, DAG);
14140 if (NewSetCC.getNode()) {
14141 CC = NewSetCC.getOperand(0);
14142 Cond = NewSetCC.getOperand(1);
14149 CC = DAG.getConstant(X86::COND_NE, MVT::i8);
14150 Cond = EmitTest(Cond, X86::COND_NE, DL, DAG);
14153 // a < b ? -1 : 0 -> RES = ~setcc_carry
14154 // a < b ? 0 : -1 -> RES = setcc_carry
14155 // a >= b ? -1 : 0 -> RES = setcc_carry
14156 // a >= b ? 0 : -1 -> RES = ~setcc_carry
14157 if (Cond.getOpcode() == X86ISD::SUB) {
14158 Cond = ConvertCmpIfNecessary(Cond, DAG);
14159 unsigned CondCode = cast<ConstantSDNode>(CC)->getZExtValue();
14161 if ((CondCode == X86::COND_AE || CondCode == X86::COND_B) &&
14162 (isAllOnes(Op1) || isAllOnes(Op2)) && (isZero(Op1) || isZero(Op2))) {
14163 SDValue Res = DAG.getNode(X86ISD::SETCC_CARRY, DL, Op.getValueType(),
14164 DAG.getConstant(X86::COND_B, MVT::i8), Cond);
14165 if (isAllOnes(Op1) != (CondCode == X86::COND_B))
14166 return DAG.getNOT(DL, Res, Res.getValueType());
14171 // X86 doesn't have an i8 cmov. If both operands are the result of a truncate
14172 // widen the cmov and push the truncate through. This avoids introducing a new
14173 // branch during isel and doesn't add any extensions.
14174 if (Op.getValueType() == MVT::i8 &&
14175 Op1.getOpcode() == ISD::TRUNCATE && Op2.getOpcode() == ISD::TRUNCATE) {
14176 SDValue T1 = Op1.getOperand(0), T2 = Op2.getOperand(0);
14177 if (T1.getValueType() == T2.getValueType() &&
14178 // Blacklist CopyFromReg to avoid partial register stalls.
14179 T1.getOpcode() != ISD::CopyFromReg && T2.getOpcode()!=ISD::CopyFromReg){
14180 SDVTList VTs = DAG.getVTList(T1.getValueType(), MVT::Glue);
14181 SDValue Cmov = DAG.getNode(X86ISD::CMOV, DL, VTs, T2, T1, CC, Cond);
14182 return DAG.getNode(ISD::TRUNCATE, DL, Op.getValueType(), Cmov);
14186 // X86ISD::CMOV means set the result (which is operand 1) to the RHS if
14187 // condition is true.
14188 SDVTList VTs = DAG.getVTList(Op.getValueType(), MVT::Glue);
14189 SDValue Ops[] = { Op2, Op1, CC, Cond };
14190 return DAG.getNode(X86ISD::CMOV, DL, VTs, Ops);
14193 static SDValue LowerSIGN_EXTEND_AVX512(SDValue Op, SelectionDAG &DAG) {
14194 MVT VT = Op->getSimpleValueType(0);
14195 SDValue In = Op->getOperand(0);
14196 MVT InVT = In.getSimpleValueType();
14199 unsigned int NumElts = VT.getVectorNumElements();
14200 if (NumElts != 8 && NumElts != 16)
14203 if (VT.is512BitVector() && InVT.getVectorElementType() != MVT::i1)
14204 return DAG.getNode(X86ISD::VSEXT, dl, VT, In);
14206 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
14207 assert (InVT.getVectorElementType() == MVT::i1 && "Unexpected vector type");
14209 MVT ExtVT = (NumElts == 8) ? MVT::v8i64 : MVT::v16i32;
14210 Constant *C = ConstantInt::get(*DAG.getContext(),
14211 APInt::getAllOnesValue(ExtVT.getScalarType().getSizeInBits()));
14213 SDValue CP = DAG.getConstantPool(C, TLI.getPointerTy());
14214 unsigned Alignment = cast<ConstantPoolSDNode>(CP)->getAlignment();
14215 SDValue Ld = DAG.getLoad(ExtVT.getScalarType(), dl, DAG.getEntryNode(), CP,
14216 MachinePointerInfo::getConstantPool(),
14217 false, false, false, Alignment);
14218 SDValue Brcst = DAG.getNode(X86ISD::VBROADCASTM, dl, ExtVT, In, Ld);
14219 if (VT.is512BitVector())
14221 return DAG.getNode(X86ISD::VTRUNC, dl, VT, Brcst);
14224 static SDValue LowerSIGN_EXTEND(SDValue Op, const X86Subtarget *Subtarget,
14225 SelectionDAG &DAG) {
14226 MVT VT = Op->getSimpleValueType(0);
14227 SDValue In = Op->getOperand(0);
14228 MVT InVT = In.getSimpleValueType();
14231 if (VT.is512BitVector() || InVT.getVectorElementType() == MVT::i1)
14232 return LowerSIGN_EXTEND_AVX512(Op, DAG);
14234 if ((VT != MVT::v4i64 || InVT != MVT::v4i32) &&
14235 (VT != MVT::v8i32 || InVT != MVT::v8i16) &&
14236 (VT != MVT::v16i16 || InVT != MVT::v16i8))
14239 if (Subtarget->hasInt256())
14240 return DAG.getNode(X86ISD::VSEXT, dl, VT, In);
14242 // Optimize vectors in AVX mode
14243 // Sign extend v8i16 to v8i32 and
14246 // Divide input vector into two parts
14247 // for v4i32 the shuffle mask will be { 0, 1, -1, -1} {2, 3, -1, -1}
14248 // use vpmovsx instruction to extend v4i32 -> v2i64; v8i16 -> v4i32
14249 // concat the vectors to original VT
14251 unsigned NumElems = InVT.getVectorNumElements();
14252 SDValue Undef = DAG.getUNDEF(InVT);
14254 SmallVector<int,8> ShufMask1(NumElems, -1);
14255 for (unsigned i = 0; i != NumElems/2; ++i)
14258 SDValue OpLo = DAG.getVectorShuffle(InVT, dl, In, Undef, &ShufMask1[0]);
14260 SmallVector<int,8> ShufMask2(NumElems, -1);
14261 for (unsigned i = 0; i != NumElems/2; ++i)
14262 ShufMask2[i] = i + NumElems/2;
14264 SDValue OpHi = DAG.getVectorShuffle(InVT, dl, In, Undef, &ShufMask2[0]);
14266 MVT HalfVT = MVT::getVectorVT(VT.getScalarType(),
14267 VT.getVectorNumElements()/2);
14269 OpLo = DAG.getNode(X86ISD::VSEXT, dl, HalfVT, OpLo);
14270 OpHi = DAG.getNode(X86ISD::VSEXT, dl, HalfVT, OpHi);
14272 return DAG.getNode(ISD::CONCAT_VECTORS, dl, VT, OpLo, OpHi);
14275 // Lower vector extended loads using a shuffle. If SSSE3 is not available we
14276 // may emit an illegal shuffle but the expansion is still better than scalar
14277 // code. We generate X86ISD::VSEXT for SEXTLOADs if it's available, otherwise
14278 // we'll emit a shuffle and a arithmetic shift.
14279 // TODO: It is possible to support ZExt by zeroing the undef values during
14280 // the shuffle phase or after the shuffle.
14281 static SDValue LowerExtendedLoad(SDValue Op, const X86Subtarget *Subtarget,
14282 SelectionDAG &DAG) {
14283 MVT RegVT = Op.getSimpleValueType();
14284 assert(RegVT.isVector() && "We only custom lower vector sext loads.");
14285 assert(RegVT.isInteger() &&
14286 "We only custom lower integer vector sext loads.");
14288 // Nothing useful we can do without SSE2 shuffles.
14289 assert(Subtarget->hasSSE2() && "We only custom lower sext loads with SSE2.");
14291 LoadSDNode *Ld = cast<LoadSDNode>(Op.getNode());
14293 EVT MemVT = Ld->getMemoryVT();
14294 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
14295 unsigned RegSz = RegVT.getSizeInBits();
14297 ISD::LoadExtType Ext = Ld->getExtensionType();
14299 assert((Ext == ISD::EXTLOAD || Ext == ISD::SEXTLOAD)
14300 && "Only anyext and sext are currently implemented.");
14301 assert(MemVT != RegVT && "Cannot extend to the same type");
14302 assert(MemVT.isVector() && "Must load a vector from memory");
14304 unsigned NumElems = RegVT.getVectorNumElements();
14305 unsigned MemSz = MemVT.getSizeInBits();
14306 assert(RegSz > MemSz && "Register size must be greater than the mem size");
14308 if (Ext == ISD::SEXTLOAD && RegSz == 256 && !Subtarget->hasInt256()) {
14309 // The only way in which we have a legal 256-bit vector result but not the
14310 // integer 256-bit operations needed to directly lower a sextload is if we
14311 // have AVX1 but not AVX2. In that case, we can always emit a sextload to
14312 // a 128-bit vector and a normal sign_extend to 256-bits that should get
14313 // correctly legalized. We do this late to allow the canonical form of
14314 // sextload to persist throughout the rest of the DAG combiner -- it wants
14315 // to fold together any extensions it can, and so will fuse a sign_extend
14316 // of an sextload into a sextload targeting a wider value.
14318 if (MemSz == 128) {
14319 // Just switch this to a normal load.
14320 assert(TLI.isTypeLegal(MemVT) && "If the memory type is a 128-bit type, "
14321 "it must be a legal 128-bit vector "
14323 Load = DAG.getLoad(MemVT, dl, Ld->getChain(), Ld->getBasePtr(),
14324 Ld->getPointerInfo(), Ld->isVolatile(), Ld->isNonTemporal(),
14325 Ld->isInvariant(), Ld->getAlignment());
14327 assert(MemSz < 128 &&
14328 "Can't extend a type wider than 128 bits to a 256 bit vector!");
14329 // Do an sext load to a 128-bit vector type. We want to use the same
14330 // number of elements, but elements half as wide. This will end up being
14331 // recursively lowered by this routine, but will succeed as we definitely
14332 // have all the necessary features if we're using AVX1.
14334 EVT::getIntegerVT(*DAG.getContext(), RegVT.getScalarSizeInBits() / 2);
14335 EVT HalfVecVT = EVT::getVectorVT(*DAG.getContext(), HalfEltVT, NumElems);
14337 DAG.getExtLoad(Ext, dl, HalfVecVT, Ld->getChain(), Ld->getBasePtr(),
14338 Ld->getPointerInfo(), MemVT, Ld->isVolatile(),
14339 Ld->isNonTemporal(), Ld->isInvariant(),
14340 Ld->getAlignment());
14343 // Replace chain users with the new chain.
14344 assert(Load->getNumValues() == 2 && "Loads must carry a chain!");
14345 DAG.ReplaceAllUsesOfValueWith(SDValue(Ld, 1), Load.getValue(1));
14347 // Finally, do a normal sign-extend to the desired register.
14348 return DAG.getSExtOrTrunc(Load, dl, RegVT);
14351 // All sizes must be a power of two.
14352 assert(isPowerOf2_32(RegSz * MemSz * NumElems) &&
14353 "Non-power-of-two elements are not custom lowered!");
14355 // Attempt to load the original value using scalar loads.
14356 // Find the largest scalar type that divides the total loaded size.
14357 MVT SclrLoadTy = MVT::i8;
14358 for (unsigned tp = MVT::FIRST_INTEGER_VALUETYPE;
14359 tp < MVT::LAST_INTEGER_VALUETYPE; ++tp) {
14360 MVT Tp = (MVT::SimpleValueType)tp;
14361 if (TLI.isTypeLegal(Tp) && ((MemSz % Tp.getSizeInBits()) == 0)) {
14366 // On 32bit systems, we can't save 64bit integers. Try bitcasting to F64.
14367 if (TLI.isTypeLegal(MVT::f64) && SclrLoadTy.getSizeInBits() < 64 &&
14369 SclrLoadTy = MVT::f64;
14371 // Calculate the number of scalar loads that we need to perform
14372 // in order to load our vector from memory.
14373 unsigned NumLoads = MemSz / SclrLoadTy.getSizeInBits();
14375 assert((Ext != ISD::SEXTLOAD || NumLoads == 1) &&
14376 "Can only lower sext loads with a single scalar load!");
14378 unsigned loadRegZize = RegSz;
14379 if (Ext == ISD::SEXTLOAD && RegSz == 256)
14382 // Represent our vector as a sequence of elements which are the
14383 // largest scalar that we can load.
14384 EVT LoadUnitVecVT = EVT::getVectorVT(
14385 *DAG.getContext(), SclrLoadTy, loadRegZize / SclrLoadTy.getSizeInBits());
14387 // Represent the data using the same element type that is stored in
14388 // memory. In practice, we ''widen'' MemVT.
14390 EVT::getVectorVT(*DAG.getContext(), MemVT.getScalarType(),
14391 loadRegZize / MemVT.getScalarType().getSizeInBits());
14393 assert(WideVecVT.getSizeInBits() == LoadUnitVecVT.getSizeInBits() &&
14394 "Invalid vector type");
14396 // We can't shuffle using an illegal type.
14397 assert(TLI.isTypeLegal(WideVecVT) &&
14398 "We only lower types that form legal widened vector types");
14400 SmallVector<SDValue, 8> Chains;
14401 SDValue Ptr = Ld->getBasePtr();
14402 SDValue Increment =
14403 DAG.getConstant(SclrLoadTy.getSizeInBits() / 8, TLI.getPointerTy());
14404 SDValue Res = DAG.getUNDEF(LoadUnitVecVT);
14406 for (unsigned i = 0; i < NumLoads; ++i) {
14407 // Perform a single load.
14408 SDValue ScalarLoad =
14409 DAG.getLoad(SclrLoadTy, dl, Ld->getChain(), Ptr, Ld->getPointerInfo(),
14410 Ld->isVolatile(), Ld->isNonTemporal(), Ld->isInvariant(),
14411 Ld->getAlignment());
14412 Chains.push_back(ScalarLoad.getValue(1));
14413 // Create the first element type using SCALAR_TO_VECTOR in order to avoid
14414 // another round of DAGCombining.
14416 Res = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, LoadUnitVecVT, ScalarLoad);
14418 Res = DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, LoadUnitVecVT, Res,
14419 ScalarLoad, DAG.getIntPtrConstant(i));
14421 Ptr = DAG.getNode(ISD::ADD, dl, Ptr.getValueType(), Ptr, Increment);
14424 SDValue TF = DAG.getNode(ISD::TokenFactor, dl, MVT::Other, Chains);
14426 // Bitcast the loaded value to a vector of the original element type, in
14427 // the size of the target vector type.
14428 SDValue SlicedVec = DAG.getNode(ISD::BITCAST, dl, WideVecVT, Res);
14429 unsigned SizeRatio = RegSz / MemSz;
14431 if (Ext == ISD::SEXTLOAD) {
14432 // If we have SSE4.1, we can directly emit a VSEXT node.
14433 if (Subtarget->hasSSE41()) {
14434 SDValue Sext = DAG.getNode(X86ISD::VSEXT, dl, RegVT, SlicedVec);
14435 DAG.ReplaceAllUsesOfValueWith(SDValue(Ld, 1), TF);
14439 // Otherwise we'll shuffle the small elements in the high bits of the
14440 // larger type and perform an arithmetic shift. If the shift is not legal
14441 // it's better to scalarize.
14442 assert(TLI.isOperationLegalOrCustom(ISD::SRA, RegVT) &&
14443 "We can't implement a sext load without an arithmetic right shift!");
14445 // Redistribute the loaded elements into the different locations.
14446 SmallVector<int, 16> ShuffleVec(NumElems * SizeRatio, -1);
14447 for (unsigned i = 0; i != NumElems; ++i)
14448 ShuffleVec[i * SizeRatio + SizeRatio - 1] = i;
14450 SDValue Shuff = DAG.getVectorShuffle(
14451 WideVecVT, dl, SlicedVec, DAG.getUNDEF(WideVecVT), &ShuffleVec[0]);
14453 Shuff = DAG.getNode(ISD::BITCAST, dl, RegVT, Shuff);
14455 // Build the arithmetic shift.
14456 unsigned Amt = RegVT.getVectorElementType().getSizeInBits() -
14457 MemVT.getVectorElementType().getSizeInBits();
14459 DAG.getNode(ISD::SRA, dl, RegVT, Shuff, DAG.getConstant(Amt, RegVT));
14461 DAG.ReplaceAllUsesOfValueWith(SDValue(Ld, 1), TF);
14465 // Redistribute the loaded elements into the different locations.
14466 SmallVector<int, 16> ShuffleVec(NumElems * SizeRatio, -1);
14467 for (unsigned i = 0; i != NumElems; ++i)
14468 ShuffleVec[i * SizeRatio] = i;
14470 SDValue Shuff = DAG.getVectorShuffle(WideVecVT, dl, SlicedVec,
14471 DAG.getUNDEF(WideVecVT), &ShuffleVec[0]);
14473 // Bitcast to the requested type.
14474 Shuff = DAG.getNode(ISD::BITCAST, dl, RegVT, Shuff);
14475 DAG.ReplaceAllUsesOfValueWith(SDValue(Ld, 1), TF);
14479 // isAndOrOfSingleUseSetCCs - Return true if node is an ISD::AND or
14480 // ISD::OR of two X86ISD::SETCC nodes each of which has no other use apart
14481 // from the AND / OR.
14482 static bool isAndOrOfSetCCs(SDValue Op, unsigned &Opc) {
14483 Opc = Op.getOpcode();
14484 if (Opc != ISD::OR && Opc != ISD::AND)
14486 return (Op.getOperand(0).getOpcode() == X86ISD::SETCC &&
14487 Op.getOperand(0).hasOneUse() &&
14488 Op.getOperand(1).getOpcode() == X86ISD::SETCC &&
14489 Op.getOperand(1).hasOneUse());
14492 // isXor1OfSetCC - Return true if node is an ISD::XOR of a X86ISD::SETCC and
14493 // 1 and that the SETCC node has a single use.
14494 static bool isXor1OfSetCC(SDValue Op) {
14495 if (Op.getOpcode() != ISD::XOR)
14497 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(Op.getOperand(1));
14498 if (N1C && N1C->getAPIntValue() == 1) {
14499 return Op.getOperand(0).getOpcode() == X86ISD::SETCC &&
14500 Op.getOperand(0).hasOneUse();
14505 SDValue X86TargetLowering::LowerBRCOND(SDValue Op, SelectionDAG &DAG) const {
14506 bool addTest = true;
14507 SDValue Chain = Op.getOperand(0);
14508 SDValue Cond = Op.getOperand(1);
14509 SDValue Dest = Op.getOperand(2);
14512 bool Inverted = false;
14514 if (Cond.getOpcode() == ISD::SETCC) {
14515 // Check for setcc([su]{add,sub,mul}o == 0).
14516 if (cast<CondCodeSDNode>(Cond.getOperand(2))->get() == ISD::SETEQ &&
14517 isa<ConstantSDNode>(Cond.getOperand(1)) &&
14518 cast<ConstantSDNode>(Cond.getOperand(1))->isNullValue() &&
14519 Cond.getOperand(0).getResNo() == 1 &&
14520 (Cond.getOperand(0).getOpcode() == ISD::SADDO ||
14521 Cond.getOperand(0).getOpcode() == ISD::UADDO ||
14522 Cond.getOperand(0).getOpcode() == ISD::SSUBO ||
14523 Cond.getOperand(0).getOpcode() == ISD::USUBO ||
14524 Cond.getOperand(0).getOpcode() == ISD::SMULO ||
14525 Cond.getOperand(0).getOpcode() == ISD::UMULO)) {
14527 Cond = Cond.getOperand(0);
14529 SDValue NewCond = LowerSETCC(Cond, DAG);
14530 if (NewCond.getNode())
14535 // FIXME: LowerXALUO doesn't handle these!!
14536 else if (Cond.getOpcode() == X86ISD::ADD ||
14537 Cond.getOpcode() == X86ISD::SUB ||
14538 Cond.getOpcode() == X86ISD::SMUL ||
14539 Cond.getOpcode() == X86ISD::UMUL)
14540 Cond = LowerXALUO(Cond, DAG);
14543 // Look pass (and (setcc_carry (cmp ...)), 1).
14544 if (Cond.getOpcode() == ISD::AND &&
14545 Cond.getOperand(0).getOpcode() == X86ISD::SETCC_CARRY) {
14546 ConstantSDNode *C = dyn_cast<ConstantSDNode>(Cond.getOperand(1));
14547 if (C && C->getAPIntValue() == 1)
14548 Cond = Cond.getOperand(0);
14551 // If condition flag is set by a X86ISD::CMP, then use it as the condition
14552 // setting operand in place of the X86ISD::SETCC.
14553 unsigned CondOpcode = Cond.getOpcode();
14554 if (CondOpcode == X86ISD::SETCC ||
14555 CondOpcode == X86ISD::SETCC_CARRY) {
14556 CC = Cond.getOperand(0);
14558 SDValue Cmp = Cond.getOperand(1);
14559 unsigned Opc = Cmp.getOpcode();
14560 // FIXME: WHY THE SPECIAL CASING OF LogicalCmp??
14561 if (isX86LogicalCmp(Cmp) || Opc == X86ISD::BT) {
14565 switch (cast<ConstantSDNode>(CC)->getZExtValue()) {
14569 // These can only come from an arithmetic instruction with overflow,
14570 // e.g. SADDO, UADDO.
14571 Cond = Cond.getNode()->getOperand(1);
14577 CondOpcode = Cond.getOpcode();
14578 if (CondOpcode == ISD::UADDO || CondOpcode == ISD::SADDO ||
14579 CondOpcode == ISD::USUBO || CondOpcode == ISD::SSUBO ||
14580 ((CondOpcode == ISD::UMULO || CondOpcode == ISD::SMULO) &&
14581 Cond.getOperand(0).getValueType() != MVT::i8)) {
14582 SDValue LHS = Cond.getOperand(0);
14583 SDValue RHS = Cond.getOperand(1);
14584 unsigned X86Opcode;
14587 // Keep this in sync with LowerXALUO, otherwise we might create redundant
14588 // instructions that can't be removed afterwards (i.e. X86ISD::ADD and
14590 switch (CondOpcode) {
14591 case ISD::UADDO: X86Opcode = X86ISD::ADD; X86Cond = X86::COND_B; break;
14593 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(RHS))
14595 X86Opcode = X86ISD::INC; X86Cond = X86::COND_O;
14598 X86Opcode = X86ISD::ADD; X86Cond = X86::COND_O; break;
14599 case ISD::USUBO: X86Opcode = X86ISD::SUB; X86Cond = X86::COND_B; break;
14601 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(RHS))
14603 X86Opcode = X86ISD::DEC; X86Cond = X86::COND_O;
14606 X86Opcode = X86ISD::SUB; X86Cond = X86::COND_O; break;
14607 case ISD::UMULO: X86Opcode = X86ISD::UMUL; X86Cond = X86::COND_O; break;
14608 case ISD::SMULO: X86Opcode = X86ISD::SMUL; X86Cond = X86::COND_O; break;
14609 default: llvm_unreachable("unexpected overflowing operator");
14612 X86Cond = X86::GetOppositeBranchCondition((X86::CondCode)X86Cond);
14613 if (CondOpcode == ISD::UMULO)
14614 VTs = DAG.getVTList(LHS.getValueType(), LHS.getValueType(),
14617 VTs = DAG.getVTList(LHS.getValueType(), MVT::i32);
14619 SDValue X86Op = DAG.getNode(X86Opcode, dl, VTs, LHS, RHS);
14621 if (CondOpcode == ISD::UMULO)
14622 Cond = X86Op.getValue(2);
14624 Cond = X86Op.getValue(1);
14626 CC = DAG.getConstant(X86Cond, MVT::i8);
14630 if (Cond.hasOneUse() && isAndOrOfSetCCs(Cond, CondOpc)) {
14631 SDValue Cmp = Cond.getOperand(0).getOperand(1);
14632 if (CondOpc == ISD::OR) {
14633 // Also, recognize the pattern generated by an FCMP_UNE. We can emit
14634 // two branches instead of an explicit OR instruction with a
14636 if (Cmp == Cond.getOperand(1).getOperand(1) &&
14637 isX86LogicalCmp(Cmp)) {
14638 CC = Cond.getOperand(0).getOperand(0);
14639 Chain = DAG.getNode(X86ISD::BRCOND, dl, Op.getValueType(),
14640 Chain, Dest, CC, Cmp);
14641 CC = Cond.getOperand(1).getOperand(0);
14645 } else { // ISD::AND
14646 // Also, recognize the pattern generated by an FCMP_OEQ. We can emit
14647 // two branches instead of an explicit AND instruction with a
14648 // separate test. However, we only do this if this block doesn't
14649 // have a fall-through edge, because this requires an explicit
14650 // jmp when the condition is false.
14651 if (Cmp == Cond.getOperand(1).getOperand(1) &&
14652 isX86LogicalCmp(Cmp) &&
14653 Op.getNode()->hasOneUse()) {
14654 X86::CondCode CCode =
14655 (X86::CondCode)Cond.getOperand(0).getConstantOperandVal(0);
14656 CCode = X86::GetOppositeBranchCondition(CCode);
14657 CC = DAG.getConstant(CCode, MVT::i8);
14658 SDNode *User = *Op.getNode()->use_begin();
14659 // Look for an unconditional branch following this conditional branch.
14660 // We need this because we need to reverse the successors in order
14661 // to implement FCMP_OEQ.
14662 if (User->getOpcode() == ISD::BR) {
14663 SDValue FalseBB = User->getOperand(1);
14665 DAG.UpdateNodeOperands(User, User->getOperand(0), Dest);
14666 assert(NewBR == User);
14670 Chain = DAG.getNode(X86ISD::BRCOND, dl, Op.getValueType(),
14671 Chain, Dest, CC, Cmp);
14672 X86::CondCode CCode =
14673 (X86::CondCode)Cond.getOperand(1).getConstantOperandVal(0);
14674 CCode = X86::GetOppositeBranchCondition(CCode);
14675 CC = DAG.getConstant(CCode, MVT::i8);
14681 } else if (Cond.hasOneUse() && isXor1OfSetCC(Cond)) {
14682 // Recognize for xorb (setcc), 1 patterns. The xor inverts the condition.
14683 // It should be transformed during dag combiner except when the condition
14684 // is set by a arithmetics with overflow node.
14685 X86::CondCode CCode =
14686 (X86::CondCode)Cond.getOperand(0).getConstantOperandVal(0);
14687 CCode = X86::GetOppositeBranchCondition(CCode);
14688 CC = DAG.getConstant(CCode, MVT::i8);
14689 Cond = Cond.getOperand(0).getOperand(1);
14691 } else if (Cond.getOpcode() == ISD::SETCC &&
14692 cast<CondCodeSDNode>(Cond.getOperand(2))->get() == ISD::SETOEQ) {
14693 // For FCMP_OEQ, we can emit
14694 // two branches instead of an explicit AND instruction with a
14695 // separate test. However, we only do this if this block doesn't
14696 // have a fall-through edge, because this requires an explicit
14697 // jmp when the condition is false.
14698 if (Op.getNode()->hasOneUse()) {
14699 SDNode *User = *Op.getNode()->use_begin();
14700 // Look for an unconditional branch following this conditional branch.
14701 // We need this because we need to reverse the successors in order
14702 // to implement FCMP_OEQ.
14703 if (User->getOpcode() == ISD::BR) {
14704 SDValue FalseBB = User->getOperand(1);
14706 DAG.UpdateNodeOperands(User, User->getOperand(0), Dest);
14707 assert(NewBR == User);
14711 SDValue Cmp = DAG.getNode(X86ISD::CMP, dl, MVT::i32,
14712 Cond.getOperand(0), Cond.getOperand(1));
14713 Cmp = ConvertCmpIfNecessary(Cmp, DAG);
14714 CC = DAG.getConstant(X86::COND_NE, MVT::i8);
14715 Chain = DAG.getNode(X86ISD::BRCOND, dl, Op.getValueType(),
14716 Chain, Dest, CC, Cmp);
14717 CC = DAG.getConstant(X86::COND_P, MVT::i8);
14722 } else if (Cond.getOpcode() == ISD::SETCC &&
14723 cast<CondCodeSDNode>(Cond.getOperand(2))->get() == ISD::SETUNE) {
14724 // For FCMP_UNE, we can emit
14725 // two branches instead of an explicit AND instruction with a
14726 // separate test. However, we only do this if this block doesn't
14727 // have a fall-through edge, because this requires an explicit
14728 // jmp when the condition is false.
14729 if (Op.getNode()->hasOneUse()) {
14730 SDNode *User = *Op.getNode()->use_begin();
14731 // Look for an unconditional branch following this conditional branch.
14732 // We need this because we need to reverse the successors in order
14733 // to implement FCMP_UNE.
14734 if (User->getOpcode() == ISD::BR) {
14735 SDValue FalseBB = User->getOperand(1);
14737 DAG.UpdateNodeOperands(User, User->getOperand(0), Dest);
14738 assert(NewBR == User);
14741 SDValue Cmp = DAG.getNode(X86ISD::CMP, dl, MVT::i32,
14742 Cond.getOperand(0), Cond.getOperand(1));
14743 Cmp = ConvertCmpIfNecessary(Cmp, DAG);
14744 CC = DAG.getConstant(X86::COND_NE, MVT::i8);
14745 Chain = DAG.getNode(X86ISD::BRCOND, dl, Op.getValueType(),
14746 Chain, Dest, CC, Cmp);
14747 CC = DAG.getConstant(X86::COND_NP, MVT::i8);
14757 // Look pass the truncate if the high bits are known zero.
14758 if (isTruncWithZeroHighBitsInput(Cond, DAG))
14759 Cond = Cond.getOperand(0);
14761 // We know the result of AND is compared against zero. Try to match
14763 if (Cond.getOpcode() == ISD::AND && Cond.hasOneUse()) {
14764 SDValue NewSetCC = LowerToBT(Cond, ISD::SETNE, dl, DAG);
14765 if (NewSetCC.getNode()) {
14766 CC = NewSetCC.getOperand(0);
14767 Cond = NewSetCC.getOperand(1);
14774 X86::CondCode X86Cond = Inverted ? X86::COND_E : X86::COND_NE;
14775 CC = DAG.getConstant(X86Cond, MVT::i8);
14776 Cond = EmitTest(Cond, X86Cond, dl, DAG);
14778 Cond = ConvertCmpIfNecessary(Cond, DAG);
14779 return DAG.getNode(X86ISD::BRCOND, dl, Op.getValueType(),
14780 Chain, Dest, CC, Cond);
14783 // Lower dynamic stack allocation to _alloca call for Cygwin/Mingw targets.
14784 // Calls to _alloca are needed to probe the stack when allocating more than 4k
14785 // bytes in one go. Touching the stack at 4K increments is necessary to ensure
14786 // that the guard pages used by the OS virtual memory manager are allocated in
14787 // correct sequence.
14789 X86TargetLowering::LowerDYNAMIC_STACKALLOC(SDValue Op,
14790 SelectionDAG &DAG) const {
14791 MachineFunction &MF = DAG.getMachineFunction();
14792 bool SplitStack = MF.shouldSplitStack();
14793 bool Lower = (Subtarget->isOSWindows() && !Subtarget->isTargetMacho()) ||
14798 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
14799 SDNode* Node = Op.getNode();
14801 unsigned SPReg = TLI.getStackPointerRegisterToSaveRestore();
14802 assert(SPReg && "Target cannot require DYNAMIC_STACKALLOC expansion and"
14803 " not tell us which reg is the stack pointer!");
14804 EVT VT = Node->getValueType(0);
14805 SDValue Tmp1 = SDValue(Node, 0);
14806 SDValue Tmp2 = SDValue(Node, 1);
14807 SDValue Tmp3 = Node->getOperand(2);
14808 SDValue Chain = Tmp1.getOperand(0);
14810 // Chain the dynamic stack allocation so that it doesn't modify the stack
14811 // pointer when other instructions are using the stack.
14812 Chain = DAG.getCALLSEQ_START(Chain, DAG.getIntPtrConstant(0, true),
14815 SDValue Size = Tmp2.getOperand(1);
14816 SDValue SP = DAG.getCopyFromReg(Chain, dl, SPReg, VT);
14817 Chain = SP.getValue(1);
14818 unsigned Align = cast<ConstantSDNode>(Tmp3)->getZExtValue();
14819 const TargetFrameLowering &TFI = *DAG.getSubtarget().getFrameLowering();
14820 unsigned StackAlign = TFI.getStackAlignment();
14821 Tmp1 = DAG.getNode(ISD::SUB, dl, VT, SP, Size); // Value
14822 if (Align > StackAlign)
14823 Tmp1 = DAG.getNode(ISD::AND, dl, VT, Tmp1,
14824 DAG.getConstant(-(uint64_t)Align, VT));
14825 Chain = DAG.getCopyToReg(Chain, dl, SPReg, Tmp1); // Output chain
14827 Tmp2 = DAG.getCALLSEQ_END(Chain, DAG.getIntPtrConstant(0, true),
14828 DAG.getIntPtrConstant(0, true), SDValue(),
14831 SDValue Ops[2] = { Tmp1, Tmp2 };
14832 return DAG.getMergeValues(Ops, dl);
14836 SDValue Chain = Op.getOperand(0);
14837 SDValue Size = Op.getOperand(1);
14838 unsigned Align = cast<ConstantSDNode>(Op.getOperand(2))->getZExtValue();
14839 EVT VT = Op.getNode()->getValueType(0);
14841 bool Is64Bit = Subtarget->is64Bit();
14842 EVT SPTy = Is64Bit ? MVT::i64 : MVT::i32;
14845 MachineRegisterInfo &MRI = MF.getRegInfo();
14848 // The 64 bit implementation of segmented stacks needs to clobber both r10
14849 // r11. This makes it impossible to use it along with nested parameters.
14850 const Function *F = MF.getFunction();
14852 for (Function::const_arg_iterator I = F->arg_begin(), E = F->arg_end();
14854 if (I->hasNestAttr())
14855 report_fatal_error("Cannot use segmented stacks with functions that "
14856 "have nested arguments.");
14859 const TargetRegisterClass *AddrRegClass =
14860 getRegClassFor(Subtarget->is64Bit() ? MVT::i64:MVT::i32);
14861 unsigned Vreg = MRI.createVirtualRegister(AddrRegClass);
14862 Chain = DAG.getCopyToReg(Chain, dl, Vreg, Size);
14863 SDValue Value = DAG.getNode(X86ISD::SEG_ALLOCA, dl, SPTy, Chain,
14864 DAG.getRegister(Vreg, SPTy));
14865 SDValue Ops1[2] = { Value, Chain };
14866 return DAG.getMergeValues(Ops1, dl);
14869 unsigned Reg = (Subtarget->is64Bit() ? X86::RAX : X86::EAX);
14871 Chain = DAG.getCopyToReg(Chain, dl, Reg, Size, Flag);
14872 Flag = Chain.getValue(1);
14873 SDVTList NodeTys = DAG.getVTList(MVT::Other, MVT::Glue);
14875 Chain = DAG.getNode(X86ISD::WIN_ALLOCA, dl, NodeTys, Chain, Flag);
14877 const X86RegisterInfo *RegInfo = static_cast<const X86RegisterInfo *>(
14878 DAG.getSubtarget().getRegisterInfo());
14879 unsigned SPReg = RegInfo->getStackRegister();
14880 SDValue SP = DAG.getCopyFromReg(Chain, dl, SPReg, SPTy);
14881 Chain = SP.getValue(1);
14884 SP = DAG.getNode(ISD::AND, dl, VT, SP.getValue(0),
14885 DAG.getConstant(-(uint64_t)Align, VT));
14886 Chain = DAG.getCopyToReg(Chain, dl, SPReg, SP);
14889 SDValue Ops1[2] = { SP, Chain };
14890 return DAG.getMergeValues(Ops1, dl);
14894 SDValue X86TargetLowering::LowerVASTART(SDValue Op, SelectionDAG &DAG) const {
14895 MachineFunction &MF = DAG.getMachineFunction();
14896 X86MachineFunctionInfo *FuncInfo = MF.getInfo<X86MachineFunctionInfo>();
14898 const Value *SV = cast<SrcValueSDNode>(Op.getOperand(2))->getValue();
14901 if (!Subtarget->is64Bit() || Subtarget->isTargetWin64()) {
14902 // vastart just stores the address of the VarArgsFrameIndex slot into the
14903 // memory location argument.
14904 SDValue FR = DAG.getFrameIndex(FuncInfo->getVarArgsFrameIndex(),
14906 return DAG.getStore(Op.getOperand(0), DL, FR, Op.getOperand(1),
14907 MachinePointerInfo(SV), false, false, 0);
14911 // gp_offset (0 - 6 * 8)
14912 // fp_offset (48 - 48 + 8 * 16)
14913 // overflow_arg_area (point to parameters coming in memory).
14915 SmallVector<SDValue, 8> MemOps;
14916 SDValue FIN = Op.getOperand(1);
14918 SDValue Store = DAG.getStore(Op.getOperand(0), DL,
14919 DAG.getConstant(FuncInfo->getVarArgsGPOffset(),
14921 FIN, MachinePointerInfo(SV), false, false, 0);
14922 MemOps.push_back(Store);
14925 FIN = DAG.getNode(ISD::ADD, DL, getPointerTy(),
14926 FIN, DAG.getIntPtrConstant(4));
14927 Store = DAG.getStore(Op.getOperand(0), DL,
14928 DAG.getConstant(FuncInfo->getVarArgsFPOffset(),
14930 FIN, MachinePointerInfo(SV, 4), false, false, 0);
14931 MemOps.push_back(Store);
14933 // Store ptr to overflow_arg_area
14934 FIN = DAG.getNode(ISD::ADD, DL, getPointerTy(),
14935 FIN, DAG.getIntPtrConstant(4));
14936 SDValue OVFIN = DAG.getFrameIndex(FuncInfo->getVarArgsFrameIndex(),
14938 Store = DAG.getStore(Op.getOperand(0), DL, OVFIN, FIN,
14939 MachinePointerInfo(SV, 8),
14941 MemOps.push_back(Store);
14943 // Store ptr to reg_save_area.
14944 FIN = DAG.getNode(ISD::ADD, DL, getPointerTy(),
14945 FIN, DAG.getIntPtrConstant(8));
14946 SDValue RSFIN = DAG.getFrameIndex(FuncInfo->getRegSaveFrameIndex(),
14948 Store = DAG.getStore(Op.getOperand(0), DL, RSFIN, FIN,
14949 MachinePointerInfo(SV, 16), false, false, 0);
14950 MemOps.push_back(Store);
14951 return DAG.getNode(ISD::TokenFactor, DL, MVT::Other, MemOps);
14954 SDValue X86TargetLowering::LowerVAARG(SDValue Op, SelectionDAG &DAG) const {
14955 assert(Subtarget->is64Bit() &&
14956 "LowerVAARG only handles 64-bit va_arg!");
14957 assert((Subtarget->isTargetLinux() ||
14958 Subtarget->isTargetDarwin()) &&
14959 "Unhandled target in LowerVAARG");
14960 assert(Op.getNode()->getNumOperands() == 4);
14961 SDValue Chain = Op.getOperand(0);
14962 SDValue SrcPtr = Op.getOperand(1);
14963 const Value *SV = cast<SrcValueSDNode>(Op.getOperand(2))->getValue();
14964 unsigned Align = Op.getConstantOperandVal(3);
14967 EVT ArgVT = Op.getNode()->getValueType(0);
14968 Type *ArgTy = ArgVT.getTypeForEVT(*DAG.getContext());
14969 uint32_t ArgSize = getDataLayout()->getTypeAllocSize(ArgTy);
14972 // Decide which area this value should be read from.
14973 // TODO: Implement the AMD64 ABI in its entirety. This simple
14974 // selection mechanism works only for the basic types.
14975 if (ArgVT == MVT::f80) {
14976 llvm_unreachable("va_arg for f80 not yet implemented");
14977 } else if (ArgVT.isFloatingPoint() && ArgSize <= 16 /*bytes*/) {
14978 ArgMode = 2; // Argument passed in XMM register. Use fp_offset.
14979 } else if (ArgVT.isInteger() && ArgSize <= 32 /*bytes*/) {
14980 ArgMode = 1; // Argument passed in GPR64 register(s). Use gp_offset.
14982 llvm_unreachable("Unhandled argument type in LowerVAARG");
14985 if (ArgMode == 2) {
14986 // Sanity Check: Make sure using fp_offset makes sense.
14987 assert(!DAG.getTarget().Options.UseSoftFloat &&
14988 !(DAG.getMachineFunction()
14989 .getFunction()->getAttributes()
14990 .hasAttribute(AttributeSet::FunctionIndex,
14991 Attribute::NoImplicitFloat)) &&
14992 Subtarget->hasSSE1());
14995 // Insert VAARG_64 node into the DAG
14996 // VAARG_64 returns two values: Variable Argument Address, Chain
14997 SmallVector<SDValue, 11> InstOps;
14998 InstOps.push_back(Chain);
14999 InstOps.push_back(SrcPtr);
15000 InstOps.push_back(DAG.getConstant(ArgSize, MVT::i32));
15001 InstOps.push_back(DAG.getConstant(ArgMode, MVT::i8));
15002 InstOps.push_back(DAG.getConstant(Align, MVT::i32));
15003 SDVTList VTs = DAG.getVTList(getPointerTy(), MVT::Other);
15004 SDValue VAARG = DAG.getMemIntrinsicNode(X86ISD::VAARG_64, dl,
15005 VTs, InstOps, MVT::i64,
15006 MachinePointerInfo(SV),
15008 /*Volatile=*/false,
15010 /*WriteMem=*/true);
15011 Chain = VAARG.getValue(1);
15013 // Load the next argument and return it
15014 return DAG.getLoad(ArgVT, dl,
15017 MachinePointerInfo(),
15018 false, false, false, 0);
15021 static SDValue LowerVACOPY(SDValue Op, const X86Subtarget *Subtarget,
15022 SelectionDAG &DAG) {
15023 // X86-64 va_list is a struct { i32, i32, i8*, i8* }.
15024 assert(Subtarget->is64Bit() && "This code only handles 64-bit va_copy!");
15025 SDValue Chain = Op.getOperand(0);
15026 SDValue DstPtr = Op.getOperand(1);
15027 SDValue SrcPtr = Op.getOperand(2);
15028 const Value *DstSV = cast<SrcValueSDNode>(Op.getOperand(3))->getValue();
15029 const Value *SrcSV = cast<SrcValueSDNode>(Op.getOperand(4))->getValue();
15032 return DAG.getMemcpy(Chain, DL, DstPtr, SrcPtr,
15033 DAG.getIntPtrConstant(24), 8, /*isVolatile*/false,
15035 MachinePointerInfo(DstSV), MachinePointerInfo(SrcSV));
15038 // getTargetVShiftByConstNode - Handle vector element shifts where the shift
15039 // amount is a constant. Takes immediate version of shift as input.
15040 static SDValue getTargetVShiftByConstNode(unsigned Opc, SDLoc dl, MVT VT,
15041 SDValue SrcOp, uint64_t ShiftAmt,
15042 SelectionDAG &DAG) {
15043 MVT ElementType = VT.getVectorElementType();
15045 // Fold this packed shift into its first operand if ShiftAmt is 0.
15049 // Check for ShiftAmt >= element width
15050 if (ShiftAmt >= ElementType.getSizeInBits()) {
15051 if (Opc == X86ISD::VSRAI)
15052 ShiftAmt = ElementType.getSizeInBits() - 1;
15054 return DAG.getConstant(0, VT);
15057 assert((Opc == X86ISD::VSHLI || Opc == X86ISD::VSRLI || Opc == X86ISD::VSRAI)
15058 && "Unknown target vector shift-by-constant node");
15060 // Fold this packed vector shift into a build vector if SrcOp is a
15061 // vector of Constants or UNDEFs, and SrcOp valuetype is the same as VT.
15062 if (VT == SrcOp.getSimpleValueType() &&
15063 ISD::isBuildVectorOfConstantSDNodes(SrcOp.getNode())) {
15064 SmallVector<SDValue, 8> Elts;
15065 unsigned NumElts = SrcOp->getNumOperands();
15066 ConstantSDNode *ND;
15069 default: llvm_unreachable(nullptr);
15070 case X86ISD::VSHLI:
15071 for (unsigned i=0; i!=NumElts; ++i) {
15072 SDValue CurrentOp = SrcOp->getOperand(i);
15073 if (CurrentOp->getOpcode() == ISD::UNDEF) {
15074 Elts.push_back(CurrentOp);
15077 ND = cast<ConstantSDNode>(CurrentOp);
15078 const APInt &C = ND->getAPIntValue();
15079 Elts.push_back(DAG.getConstant(C.shl(ShiftAmt), ElementType));
15082 case X86ISD::VSRLI:
15083 for (unsigned i=0; i!=NumElts; ++i) {
15084 SDValue CurrentOp = SrcOp->getOperand(i);
15085 if (CurrentOp->getOpcode() == ISD::UNDEF) {
15086 Elts.push_back(CurrentOp);
15089 ND = cast<ConstantSDNode>(CurrentOp);
15090 const APInt &C = ND->getAPIntValue();
15091 Elts.push_back(DAG.getConstant(C.lshr(ShiftAmt), ElementType));
15094 case X86ISD::VSRAI:
15095 for (unsigned i=0; i!=NumElts; ++i) {
15096 SDValue CurrentOp = SrcOp->getOperand(i);
15097 if (CurrentOp->getOpcode() == ISD::UNDEF) {
15098 Elts.push_back(CurrentOp);
15101 ND = cast<ConstantSDNode>(CurrentOp);
15102 const APInt &C = ND->getAPIntValue();
15103 Elts.push_back(DAG.getConstant(C.ashr(ShiftAmt), ElementType));
15108 return DAG.getNode(ISD::BUILD_VECTOR, dl, VT, Elts);
15111 return DAG.getNode(Opc, dl, VT, SrcOp, DAG.getConstant(ShiftAmt, MVT::i8));
15114 // getTargetVShiftNode - Handle vector element shifts where the shift amount
15115 // may or may not be a constant. Takes immediate version of shift as input.
15116 static SDValue getTargetVShiftNode(unsigned Opc, SDLoc dl, MVT VT,
15117 SDValue SrcOp, SDValue ShAmt,
15118 SelectionDAG &DAG) {
15119 assert(ShAmt.getValueType() == MVT::i32 && "ShAmt is not i32");
15121 // Catch shift-by-constant.
15122 if (ConstantSDNode *CShAmt = dyn_cast<ConstantSDNode>(ShAmt))
15123 return getTargetVShiftByConstNode(Opc, dl, VT, SrcOp,
15124 CShAmt->getZExtValue(), DAG);
15126 // Change opcode to non-immediate version
15128 default: llvm_unreachable("Unknown target vector shift node");
15129 case X86ISD::VSHLI: Opc = X86ISD::VSHL; break;
15130 case X86ISD::VSRLI: Opc = X86ISD::VSRL; break;
15131 case X86ISD::VSRAI: Opc = X86ISD::VSRA; break;
15134 // Need to build a vector containing shift amount
15135 // Shift amount is 32-bits, but SSE instructions read 64-bit, so fill with 0
15138 ShOps[1] = DAG.getConstant(0, MVT::i32);
15139 ShOps[2] = ShOps[3] = DAG.getUNDEF(MVT::i32);
15140 ShAmt = DAG.getNode(ISD::BUILD_VECTOR, dl, MVT::v4i32, ShOps);
15142 // The return type has to be a 128-bit type with the same element
15143 // type as the input type.
15144 MVT EltVT = VT.getVectorElementType();
15145 EVT ShVT = MVT::getVectorVT(EltVT, 128/EltVT.getSizeInBits());
15147 ShAmt = DAG.getNode(ISD::BITCAST, dl, ShVT, ShAmt);
15148 return DAG.getNode(Opc, dl, VT, SrcOp, ShAmt);
15151 /// \brief Return (vselect \p Mask, \p Op, \p PreservedSrc) along with the
15152 /// necessary casting for \p Mask when lowering masking intrinsics.
15153 static SDValue getVectorMaskingNode(SDValue Op, SDValue Mask,
15154 SDValue PreservedSrc, SelectionDAG &DAG) {
15155 EVT VT = Op.getValueType();
15156 EVT MaskVT = EVT::getVectorVT(*DAG.getContext(),
15157 MVT::i1, VT.getVectorNumElements());
15160 assert(MaskVT.isSimple() && "invalid mask type");
15161 return DAG.getNode(ISD::VSELECT, dl, VT,
15162 DAG.getNode(ISD::BITCAST, dl, MaskVT, Mask),
15166 static unsigned getOpcodeForFMAIntrinsic(unsigned IntNo) {
15168 default: llvm_unreachable("Impossible intrinsic"); // Can't reach here.
15169 case Intrinsic::x86_fma_vfmadd_ps:
15170 case Intrinsic::x86_fma_vfmadd_pd:
15171 case Intrinsic::x86_fma_vfmadd_ps_256:
15172 case Intrinsic::x86_fma_vfmadd_pd_256:
15173 case Intrinsic::x86_fma_mask_vfmadd_ps_512:
15174 case Intrinsic::x86_fma_mask_vfmadd_pd_512:
15175 return X86ISD::FMADD;
15176 case Intrinsic::x86_fma_vfmsub_ps:
15177 case Intrinsic::x86_fma_vfmsub_pd:
15178 case Intrinsic::x86_fma_vfmsub_ps_256:
15179 case Intrinsic::x86_fma_vfmsub_pd_256:
15180 case Intrinsic::x86_fma_mask_vfmsub_ps_512:
15181 case Intrinsic::x86_fma_mask_vfmsub_pd_512:
15182 return X86ISD::FMSUB;
15183 case Intrinsic::x86_fma_vfnmadd_ps:
15184 case Intrinsic::x86_fma_vfnmadd_pd:
15185 case Intrinsic::x86_fma_vfnmadd_ps_256:
15186 case Intrinsic::x86_fma_vfnmadd_pd_256:
15187 case Intrinsic::x86_fma_mask_vfnmadd_ps_512:
15188 case Intrinsic::x86_fma_mask_vfnmadd_pd_512:
15189 return X86ISD::FNMADD;
15190 case Intrinsic::x86_fma_vfnmsub_ps:
15191 case Intrinsic::x86_fma_vfnmsub_pd:
15192 case Intrinsic::x86_fma_vfnmsub_ps_256:
15193 case Intrinsic::x86_fma_vfnmsub_pd_256:
15194 case Intrinsic::x86_fma_mask_vfnmsub_ps_512:
15195 case Intrinsic::x86_fma_mask_vfnmsub_pd_512:
15196 return X86ISD::FNMSUB;
15197 case Intrinsic::x86_fma_vfmaddsub_ps:
15198 case Intrinsic::x86_fma_vfmaddsub_pd:
15199 case Intrinsic::x86_fma_vfmaddsub_ps_256:
15200 case Intrinsic::x86_fma_vfmaddsub_pd_256:
15201 case Intrinsic::x86_fma_mask_vfmaddsub_ps_512:
15202 case Intrinsic::x86_fma_mask_vfmaddsub_pd_512:
15203 return X86ISD::FMADDSUB;
15204 case Intrinsic::x86_fma_vfmsubadd_ps:
15205 case Intrinsic::x86_fma_vfmsubadd_pd:
15206 case Intrinsic::x86_fma_vfmsubadd_ps_256:
15207 case Intrinsic::x86_fma_vfmsubadd_pd_256:
15208 case Intrinsic::x86_fma_mask_vfmsubadd_ps_512:
15209 case Intrinsic::x86_fma_mask_vfmsubadd_pd_512:
15210 return X86ISD::FMSUBADD;
15214 static SDValue LowerINTRINSIC_WO_CHAIN(SDValue Op, SelectionDAG &DAG) {
15216 unsigned IntNo = cast<ConstantSDNode>(Op.getOperand(0))->getZExtValue();
15218 const IntrinsicData* IntrData = getIntrinsicWithoutChain(IntNo);
15220 switch(IntrData->Type) {
15221 case INTR_TYPE_1OP:
15222 return DAG.getNode(IntrData->Opc0, dl, Op.getValueType(), Op.getOperand(1));
15223 case INTR_TYPE_2OP:
15224 return DAG.getNode(IntrData->Opc0, dl, Op.getValueType(), Op.getOperand(1),
15226 case INTR_TYPE_3OP:
15227 return DAG.getNode(IntrData->Opc0, dl, Op.getValueType(), Op.getOperand(1),
15228 Op.getOperand(2), Op.getOperand(3));
15229 case COMI: { // Comparison intrinsics
15230 ISD::CondCode CC = (ISD::CondCode)IntrData->Opc1;
15231 SDValue LHS = Op.getOperand(1);
15232 SDValue RHS = Op.getOperand(2);
15233 unsigned X86CC = TranslateX86CC(CC, true, LHS, RHS, DAG);
15234 assert(X86CC != X86::COND_INVALID && "Unexpected illegal condition!");
15235 SDValue Cond = DAG.getNode(IntrData->Opc0, dl, MVT::i32, LHS, RHS);
15236 SDValue SetCC = DAG.getNode(X86ISD::SETCC, dl, MVT::i8,
15237 DAG.getConstant(X86CC, MVT::i8), Cond);
15238 return DAG.getNode(ISD::ZERO_EXTEND, dl, MVT::i32, SetCC);
15241 return getTargetVShiftNode(IntrData->Opc0, dl, Op.getSimpleValueType(),
15242 Op.getOperand(1), Op.getOperand(2), DAG);
15249 default: return SDValue(); // Don't custom lower most intrinsics.
15251 // Arithmetic intrinsics.
15252 case Intrinsic::x86_sse2_pmulu_dq:
15253 case Intrinsic::x86_avx2_pmulu_dq:
15254 return DAG.getNode(X86ISD::PMULUDQ, dl, Op.getValueType(),
15255 Op.getOperand(1), Op.getOperand(2));
15257 case Intrinsic::x86_sse41_pmuldq:
15258 case Intrinsic::x86_avx2_pmul_dq:
15259 return DAG.getNode(X86ISD::PMULDQ, dl, Op.getValueType(),
15260 Op.getOperand(1), Op.getOperand(2));
15262 case Intrinsic::x86_sse2_pmulhu_w:
15263 case Intrinsic::x86_avx2_pmulhu_w:
15264 return DAG.getNode(ISD::MULHU, dl, Op.getValueType(),
15265 Op.getOperand(1), Op.getOperand(2));
15267 case Intrinsic::x86_sse2_pmulh_w:
15268 case Intrinsic::x86_avx2_pmulh_w:
15269 return DAG.getNode(ISD::MULHS, dl, Op.getValueType(),
15270 Op.getOperand(1), Op.getOperand(2));
15272 // SSE/SSE2/AVX floating point max/min intrinsics.
15273 case Intrinsic::x86_sse_max_ps:
15274 case Intrinsic::x86_sse2_max_pd:
15275 case Intrinsic::x86_avx_max_ps_256:
15276 case Intrinsic::x86_avx_max_pd_256:
15277 case Intrinsic::x86_sse_min_ps:
15278 case Intrinsic::x86_sse2_min_pd:
15279 case Intrinsic::x86_avx_min_ps_256:
15280 case Intrinsic::x86_avx_min_pd_256: {
15283 default: llvm_unreachable("Impossible intrinsic"); // Can't reach here.
15284 case Intrinsic::x86_sse_max_ps:
15285 case Intrinsic::x86_sse2_max_pd:
15286 case Intrinsic::x86_avx_max_ps_256:
15287 case Intrinsic::x86_avx_max_pd_256:
15288 Opcode = X86ISD::FMAX;
15290 case Intrinsic::x86_sse_min_ps:
15291 case Intrinsic::x86_sse2_min_pd:
15292 case Intrinsic::x86_avx_min_ps_256:
15293 case Intrinsic::x86_avx_min_pd_256:
15294 Opcode = X86ISD::FMIN;
15297 return DAG.getNode(Opcode, dl, Op.getValueType(),
15298 Op.getOperand(1), Op.getOperand(2));
15301 // AVX2 variable shift intrinsics
15302 case Intrinsic::x86_avx2_psllv_d:
15303 case Intrinsic::x86_avx2_psllv_q:
15304 case Intrinsic::x86_avx2_psllv_d_256:
15305 case Intrinsic::x86_avx2_psllv_q_256:
15306 case Intrinsic::x86_avx2_psrlv_d:
15307 case Intrinsic::x86_avx2_psrlv_q:
15308 case Intrinsic::x86_avx2_psrlv_d_256:
15309 case Intrinsic::x86_avx2_psrlv_q_256:
15310 case Intrinsic::x86_avx2_psrav_d:
15311 case Intrinsic::x86_avx2_psrav_d_256: {
15314 default: llvm_unreachable("Impossible intrinsic"); // Can't reach here.
15315 case Intrinsic::x86_avx2_psllv_d:
15316 case Intrinsic::x86_avx2_psllv_q:
15317 case Intrinsic::x86_avx2_psllv_d_256:
15318 case Intrinsic::x86_avx2_psllv_q_256:
15321 case Intrinsic::x86_avx2_psrlv_d:
15322 case Intrinsic::x86_avx2_psrlv_q:
15323 case Intrinsic::x86_avx2_psrlv_d_256:
15324 case Intrinsic::x86_avx2_psrlv_q_256:
15327 case Intrinsic::x86_avx2_psrav_d:
15328 case Intrinsic::x86_avx2_psrav_d_256:
15332 return DAG.getNode(Opcode, dl, Op.getValueType(),
15333 Op.getOperand(1), Op.getOperand(2));
15336 case Intrinsic::x86_sse2_packssdw_128:
15337 case Intrinsic::x86_sse2_packsswb_128:
15338 case Intrinsic::x86_avx2_packssdw:
15339 case Intrinsic::x86_avx2_packsswb:
15340 return DAG.getNode(X86ISD::PACKSS, dl, Op.getValueType(),
15341 Op.getOperand(1), Op.getOperand(2));
15343 case Intrinsic::x86_sse2_packuswb_128:
15344 case Intrinsic::x86_sse41_packusdw:
15345 case Intrinsic::x86_avx2_packuswb:
15346 case Intrinsic::x86_avx2_packusdw:
15347 return DAG.getNode(X86ISD::PACKUS, dl, Op.getValueType(),
15348 Op.getOperand(1), Op.getOperand(2));
15350 case Intrinsic::x86_ssse3_pshuf_b_128:
15351 case Intrinsic::x86_avx2_pshuf_b:
15352 return DAG.getNode(X86ISD::PSHUFB, dl, Op.getValueType(),
15353 Op.getOperand(1), Op.getOperand(2));
15355 case Intrinsic::x86_sse2_pshuf_d:
15356 return DAG.getNode(X86ISD::PSHUFD, dl, Op.getValueType(),
15357 Op.getOperand(1), Op.getOperand(2));
15359 case Intrinsic::x86_sse2_pshufl_w:
15360 return DAG.getNode(X86ISD::PSHUFLW, dl, Op.getValueType(),
15361 Op.getOperand(1), Op.getOperand(2));
15363 case Intrinsic::x86_sse2_pshufh_w:
15364 return DAG.getNode(X86ISD::PSHUFHW, dl, Op.getValueType(),
15365 Op.getOperand(1), Op.getOperand(2));
15367 case Intrinsic::x86_ssse3_psign_b_128:
15368 case Intrinsic::x86_ssse3_psign_w_128:
15369 case Intrinsic::x86_ssse3_psign_d_128:
15370 case Intrinsic::x86_avx2_psign_b:
15371 case Intrinsic::x86_avx2_psign_w:
15372 case Intrinsic::x86_avx2_psign_d:
15373 return DAG.getNode(X86ISD::PSIGN, dl, Op.getValueType(),
15374 Op.getOperand(1), Op.getOperand(2));
15376 case Intrinsic::x86_avx2_permd:
15377 case Intrinsic::x86_avx2_permps:
15378 // Operands intentionally swapped. Mask is last operand to intrinsic,
15379 // but second operand for node/instruction.
15380 return DAG.getNode(X86ISD::VPERMV, dl, Op.getValueType(),
15381 Op.getOperand(2), Op.getOperand(1));
15383 case Intrinsic::x86_avx512_mask_valign_q_512:
15384 case Intrinsic::x86_avx512_mask_valign_d_512:
15385 // Vector source operands are swapped.
15386 return getVectorMaskingNode(DAG.getNode(X86ISD::VALIGN, dl,
15387 Op.getValueType(), Op.getOperand(2),
15390 Op.getOperand(5), Op.getOperand(4), DAG);
15392 // ptest and testp intrinsics. The intrinsic these come from are designed to
15393 // return an integer value, not just an instruction so lower it to the ptest
15394 // or testp pattern and a setcc for the result.
15395 case Intrinsic::x86_sse41_ptestz:
15396 case Intrinsic::x86_sse41_ptestc:
15397 case Intrinsic::x86_sse41_ptestnzc:
15398 case Intrinsic::x86_avx_ptestz_256:
15399 case Intrinsic::x86_avx_ptestc_256:
15400 case Intrinsic::x86_avx_ptestnzc_256:
15401 case Intrinsic::x86_avx_vtestz_ps:
15402 case Intrinsic::x86_avx_vtestc_ps:
15403 case Intrinsic::x86_avx_vtestnzc_ps:
15404 case Intrinsic::x86_avx_vtestz_pd:
15405 case Intrinsic::x86_avx_vtestc_pd:
15406 case Intrinsic::x86_avx_vtestnzc_pd:
15407 case Intrinsic::x86_avx_vtestz_ps_256:
15408 case Intrinsic::x86_avx_vtestc_ps_256:
15409 case Intrinsic::x86_avx_vtestnzc_ps_256:
15410 case Intrinsic::x86_avx_vtestz_pd_256:
15411 case Intrinsic::x86_avx_vtestc_pd_256:
15412 case Intrinsic::x86_avx_vtestnzc_pd_256: {
15413 bool IsTestPacked = false;
15416 default: llvm_unreachable("Bad fallthrough in Intrinsic lowering.");
15417 case Intrinsic::x86_avx_vtestz_ps:
15418 case Intrinsic::x86_avx_vtestz_pd:
15419 case Intrinsic::x86_avx_vtestz_ps_256:
15420 case Intrinsic::x86_avx_vtestz_pd_256:
15421 IsTestPacked = true; // Fallthrough
15422 case Intrinsic::x86_sse41_ptestz:
15423 case Intrinsic::x86_avx_ptestz_256:
15425 X86CC = X86::COND_E;
15427 case Intrinsic::x86_avx_vtestc_ps:
15428 case Intrinsic::x86_avx_vtestc_pd:
15429 case Intrinsic::x86_avx_vtestc_ps_256:
15430 case Intrinsic::x86_avx_vtestc_pd_256:
15431 IsTestPacked = true; // Fallthrough
15432 case Intrinsic::x86_sse41_ptestc:
15433 case Intrinsic::x86_avx_ptestc_256:
15435 X86CC = X86::COND_B;
15437 case Intrinsic::x86_avx_vtestnzc_ps:
15438 case Intrinsic::x86_avx_vtestnzc_pd:
15439 case Intrinsic::x86_avx_vtestnzc_ps_256:
15440 case Intrinsic::x86_avx_vtestnzc_pd_256:
15441 IsTestPacked = true; // Fallthrough
15442 case Intrinsic::x86_sse41_ptestnzc:
15443 case Intrinsic::x86_avx_ptestnzc_256:
15445 X86CC = X86::COND_A;
15449 SDValue LHS = Op.getOperand(1);
15450 SDValue RHS = Op.getOperand(2);
15451 unsigned TestOpc = IsTestPacked ? X86ISD::TESTP : X86ISD::PTEST;
15452 SDValue Test = DAG.getNode(TestOpc, dl, MVT::i32, LHS, RHS);
15453 SDValue CC = DAG.getConstant(X86CC, MVT::i8);
15454 SDValue SetCC = DAG.getNode(X86ISD::SETCC, dl, MVT::i8, CC, Test);
15455 return DAG.getNode(ISD::ZERO_EXTEND, dl, MVT::i32, SetCC);
15457 case Intrinsic::x86_avx512_kortestz_w:
15458 case Intrinsic::x86_avx512_kortestc_w: {
15459 unsigned X86CC = (IntNo == Intrinsic::x86_avx512_kortestz_w)? X86::COND_E: X86::COND_B;
15460 SDValue LHS = DAG.getNode(ISD::BITCAST, dl, MVT::v16i1, Op.getOperand(1));
15461 SDValue RHS = DAG.getNode(ISD::BITCAST, dl, MVT::v16i1, Op.getOperand(2));
15462 SDValue CC = DAG.getConstant(X86CC, MVT::i8);
15463 SDValue Test = DAG.getNode(X86ISD::KORTEST, dl, MVT::i32, LHS, RHS);
15464 SDValue SetCC = DAG.getNode(X86ISD::SETCC, dl, MVT::i1, CC, Test);
15465 return DAG.getNode(ISD::ZERO_EXTEND, dl, MVT::i32, SetCC);
15468 case Intrinsic::x86_sse42_pcmpistria128:
15469 case Intrinsic::x86_sse42_pcmpestria128:
15470 case Intrinsic::x86_sse42_pcmpistric128:
15471 case Intrinsic::x86_sse42_pcmpestric128:
15472 case Intrinsic::x86_sse42_pcmpistrio128:
15473 case Intrinsic::x86_sse42_pcmpestrio128:
15474 case Intrinsic::x86_sse42_pcmpistris128:
15475 case Intrinsic::x86_sse42_pcmpestris128:
15476 case Intrinsic::x86_sse42_pcmpistriz128:
15477 case Intrinsic::x86_sse42_pcmpestriz128: {
15481 default: llvm_unreachable("Impossible intrinsic"); // Can't reach here.
15482 case Intrinsic::x86_sse42_pcmpistria128:
15483 Opcode = X86ISD::PCMPISTRI;
15484 X86CC = X86::COND_A;
15486 case Intrinsic::x86_sse42_pcmpestria128:
15487 Opcode = X86ISD::PCMPESTRI;
15488 X86CC = X86::COND_A;
15490 case Intrinsic::x86_sse42_pcmpistric128:
15491 Opcode = X86ISD::PCMPISTRI;
15492 X86CC = X86::COND_B;
15494 case Intrinsic::x86_sse42_pcmpestric128:
15495 Opcode = X86ISD::PCMPESTRI;
15496 X86CC = X86::COND_B;
15498 case Intrinsic::x86_sse42_pcmpistrio128:
15499 Opcode = X86ISD::PCMPISTRI;
15500 X86CC = X86::COND_O;
15502 case Intrinsic::x86_sse42_pcmpestrio128:
15503 Opcode = X86ISD::PCMPESTRI;
15504 X86CC = X86::COND_O;
15506 case Intrinsic::x86_sse42_pcmpistris128:
15507 Opcode = X86ISD::PCMPISTRI;
15508 X86CC = X86::COND_S;
15510 case Intrinsic::x86_sse42_pcmpestris128:
15511 Opcode = X86ISD::PCMPESTRI;
15512 X86CC = X86::COND_S;
15514 case Intrinsic::x86_sse42_pcmpistriz128:
15515 Opcode = X86ISD::PCMPISTRI;
15516 X86CC = X86::COND_E;
15518 case Intrinsic::x86_sse42_pcmpestriz128:
15519 Opcode = X86ISD::PCMPESTRI;
15520 X86CC = X86::COND_E;
15523 SmallVector<SDValue, 5> NewOps(Op->op_begin()+1, Op->op_end());
15524 SDVTList VTs = DAG.getVTList(Op.getValueType(), MVT::i32);
15525 SDValue PCMP = DAG.getNode(Opcode, dl, VTs, NewOps);
15526 SDValue SetCC = DAG.getNode(X86ISD::SETCC, dl, MVT::i8,
15527 DAG.getConstant(X86CC, MVT::i8),
15528 SDValue(PCMP.getNode(), 1));
15529 return DAG.getNode(ISD::ZERO_EXTEND, dl, MVT::i32, SetCC);
15532 case Intrinsic::x86_sse42_pcmpistri128:
15533 case Intrinsic::x86_sse42_pcmpestri128: {
15535 if (IntNo == Intrinsic::x86_sse42_pcmpistri128)
15536 Opcode = X86ISD::PCMPISTRI;
15538 Opcode = X86ISD::PCMPESTRI;
15540 SmallVector<SDValue, 5> NewOps(Op->op_begin()+1, Op->op_end());
15541 SDVTList VTs = DAG.getVTList(Op.getValueType(), MVT::i32);
15542 return DAG.getNode(Opcode, dl, VTs, NewOps);
15545 case Intrinsic::x86_fma_mask_vfmadd_ps_512:
15546 case Intrinsic::x86_fma_mask_vfmadd_pd_512:
15547 case Intrinsic::x86_fma_mask_vfmsub_ps_512:
15548 case Intrinsic::x86_fma_mask_vfmsub_pd_512:
15549 case Intrinsic::x86_fma_mask_vfnmadd_ps_512:
15550 case Intrinsic::x86_fma_mask_vfnmadd_pd_512:
15551 case Intrinsic::x86_fma_mask_vfnmsub_ps_512:
15552 case Intrinsic::x86_fma_mask_vfnmsub_pd_512:
15553 case Intrinsic::x86_fma_mask_vfmaddsub_ps_512:
15554 case Intrinsic::x86_fma_mask_vfmaddsub_pd_512:
15555 case Intrinsic::x86_fma_mask_vfmsubadd_ps_512:
15556 case Intrinsic::x86_fma_mask_vfmsubadd_pd_512: {
15557 auto *SAE = cast<ConstantSDNode>(Op.getOperand(5));
15558 if (SAE->getZExtValue() == X86::STATIC_ROUNDING::CUR_DIRECTION)
15559 return getVectorMaskingNode(DAG.getNode(getOpcodeForFMAIntrinsic(IntNo),
15560 dl, Op.getValueType(),
15564 Op.getOperand(4), Op.getOperand(1), DAG);
15569 case Intrinsic::x86_fma_vfmadd_ps:
15570 case Intrinsic::x86_fma_vfmadd_pd:
15571 case Intrinsic::x86_fma_vfmsub_ps:
15572 case Intrinsic::x86_fma_vfmsub_pd:
15573 case Intrinsic::x86_fma_vfnmadd_ps:
15574 case Intrinsic::x86_fma_vfnmadd_pd:
15575 case Intrinsic::x86_fma_vfnmsub_ps:
15576 case Intrinsic::x86_fma_vfnmsub_pd:
15577 case Intrinsic::x86_fma_vfmaddsub_ps:
15578 case Intrinsic::x86_fma_vfmaddsub_pd:
15579 case Intrinsic::x86_fma_vfmsubadd_ps:
15580 case Intrinsic::x86_fma_vfmsubadd_pd:
15581 case Intrinsic::x86_fma_vfmadd_ps_256:
15582 case Intrinsic::x86_fma_vfmadd_pd_256:
15583 case Intrinsic::x86_fma_vfmsub_ps_256:
15584 case Intrinsic::x86_fma_vfmsub_pd_256:
15585 case Intrinsic::x86_fma_vfnmadd_ps_256:
15586 case Intrinsic::x86_fma_vfnmadd_pd_256:
15587 case Intrinsic::x86_fma_vfnmsub_ps_256:
15588 case Intrinsic::x86_fma_vfnmsub_pd_256:
15589 case Intrinsic::x86_fma_vfmaddsub_ps_256:
15590 case Intrinsic::x86_fma_vfmaddsub_pd_256:
15591 case Intrinsic::x86_fma_vfmsubadd_ps_256:
15592 case Intrinsic::x86_fma_vfmsubadd_pd_256:
15593 return DAG.getNode(getOpcodeForFMAIntrinsic(IntNo), dl, Op.getValueType(),
15594 Op.getOperand(1), Op.getOperand(2), Op.getOperand(3));
15598 static SDValue getGatherNode(unsigned Opc, SDValue Op, SelectionDAG &DAG,
15599 SDValue Src, SDValue Mask, SDValue Base,
15600 SDValue Index, SDValue ScaleOp, SDValue Chain,
15601 const X86Subtarget * Subtarget) {
15603 ConstantSDNode *C = dyn_cast<ConstantSDNode>(ScaleOp);
15604 assert(C && "Invalid scale type");
15605 SDValue Scale = DAG.getTargetConstant(C->getZExtValue(), MVT::i8);
15606 EVT MaskVT = MVT::getVectorVT(MVT::i1,
15607 Index.getSimpleValueType().getVectorNumElements());
15609 ConstantSDNode *MaskC = dyn_cast<ConstantSDNode>(Mask);
15611 MaskInReg = DAG.getTargetConstant(MaskC->getSExtValue(), MaskVT);
15613 MaskInReg = DAG.getNode(ISD::BITCAST, dl, MaskVT, Mask);
15614 SDVTList VTs = DAG.getVTList(Op.getValueType(), MaskVT, MVT::Other);
15615 SDValue Disp = DAG.getTargetConstant(0, MVT::i32);
15616 SDValue Segment = DAG.getRegister(0, MVT::i32);
15617 if (Src.getOpcode() == ISD::UNDEF)
15618 Src = getZeroVector(Op.getValueType(), Subtarget, DAG, dl);
15619 SDValue Ops[] = {Src, MaskInReg, Base, Scale, Index, Disp, Segment, Chain};
15620 SDNode *Res = DAG.getMachineNode(Opc, dl, VTs, Ops);
15621 SDValue RetOps[] = { SDValue(Res, 0), SDValue(Res, 2) };
15622 return DAG.getMergeValues(RetOps, dl);
15625 static SDValue getScatterNode(unsigned Opc, SDValue Op, SelectionDAG &DAG,
15626 SDValue Src, SDValue Mask, SDValue Base,
15627 SDValue Index, SDValue ScaleOp, SDValue Chain) {
15629 ConstantSDNode *C = dyn_cast<ConstantSDNode>(ScaleOp);
15630 assert(C && "Invalid scale type");
15631 SDValue Scale = DAG.getTargetConstant(C->getZExtValue(), MVT::i8);
15632 SDValue Disp = DAG.getTargetConstant(0, MVT::i32);
15633 SDValue Segment = DAG.getRegister(0, MVT::i32);
15634 EVT MaskVT = MVT::getVectorVT(MVT::i1,
15635 Index.getSimpleValueType().getVectorNumElements());
15637 ConstantSDNode *MaskC = dyn_cast<ConstantSDNode>(Mask);
15639 MaskInReg = DAG.getTargetConstant(MaskC->getSExtValue(), MaskVT);
15641 MaskInReg = DAG.getNode(ISD::BITCAST, dl, MaskVT, Mask);
15642 SDVTList VTs = DAG.getVTList(MaskVT, MVT::Other);
15643 SDValue Ops[] = {Base, Scale, Index, Disp, Segment, MaskInReg, Src, Chain};
15644 SDNode *Res = DAG.getMachineNode(Opc, dl, VTs, Ops);
15645 return SDValue(Res, 1);
15648 static SDValue getPrefetchNode(unsigned Opc, SDValue Op, SelectionDAG &DAG,
15649 SDValue Mask, SDValue Base, SDValue Index,
15650 SDValue ScaleOp, SDValue Chain) {
15652 ConstantSDNode *C = dyn_cast<ConstantSDNode>(ScaleOp);
15653 assert(C && "Invalid scale type");
15654 SDValue Scale = DAG.getTargetConstant(C->getZExtValue(), MVT::i8);
15655 SDValue Disp = DAG.getTargetConstant(0, MVT::i32);
15656 SDValue Segment = DAG.getRegister(0, MVT::i32);
15658 MVT::getVectorVT(MVT::i1, Index.getSimpleValueType().getVectorNumElements());
15660 ConstantSDNode *MaskC = dyn_cast<ConstantSDNode>(Mask);
15662 MaskInReg = DAG.getTargetConstant(MaskC->getSExtValue(), MaskVT);
15664 MaskInReg = DAG.getNode(ISD::BITCAST, dl, MaskVT, Mask);
15665 //SDVTList VTs = DAG.getVTList(MVT::Other);
15666 SDValue Ops[] = {MaskInReg, Base, Scale, Index, Disp, Segment, Chain};
15667 SDNode *Res = DAG.getMachineNode(Opc, dl, MVT::Other, Ops);
15668 return SDValue(Res, 0);
15671 // getReadPerformanceCounter - Handles the lowering of builtin intrinsics that
15672 // read performance monitor counters (x86_rdpmc).
15673 static void getReadPerformanceCounter(SDNode *N, SDLoc DL,
15674 SelectionDAG &DAG, const X86Subtarget *Subtarget,
15675 SmallVectorImpl<SDValue> &Results) {
15676 assert(N->getNumOperands() == 3 && "Unexpected number of operands!");
15677 SDVTList Tys = DAG.getVTList(MVT::Other, MVT::Glue);
15680 // The ECX register is used to select the index of the performance counter
15682 SDValue Chain = DAG.getCopyToReg(N->getOperand(0), DL, X86::ECX,
15684 SDValue rd = DAG.getNode(X86ISD::RDPMC_DAG, DL, Tys, Chain);
15686 // Reads the content of a 64-bit performance counter and returns it in the
15687 // registers EDX:EAX.
15688 if (Subtarget->is64Bit()) {
15689 LO = DAG.getCopyFromReg(rd, DL, X86::RAX, MVT::i64, rd.getValue(1));
15690 HI = DAG.getCopyFromReg(LO.getValue(1), DL, X86::RDX, MVT::i64,
15693 LO = DAG.getCopyFromReg(rd, DL, X86::EAX, MVT::i32, rd.getValue(1));
15694 HI = DAG.getCopyFromReg(LO.getValue(1), DL, X86::EDX, MVT::i32,
15697 Chain = HI.getValue(1);
15699 if (Subtarget->is64Bit()) {
15700 // The EAX register is loaded with the low-order 32 bits. The EDX register
15701 // is loaded with the supported high-order bits of the counter.
15702 SDValue Tmp = DAG.getNode(ISD::SHL, DL, MVT::i64, HI,
15703 DAG.getConstant(32, MVT::i8));
15704 Results.push_back(DAG.getNode(ISD::OR, DL, MVT::i64, LO, Tmp));
15705 Results.push_back(Chain);
15709 // Use a buildpair to merge the two 32-bit values into a 64-bit one.
15710 SDValue Ops[] = { LO, HI };
15711 SDValue Pair = DAG.getNode(ISD::BUILD_PAIR, DL, MVT::i64, Ops);
15712 Results.push_back(Pair);
15713 Results.push_back(Chain);
15716 // getReadTimeStampCounter - Handles the lowering of builtin intrinsics that
15717 // read the time stamp counter (x86_rdtsc and x86_rdtscp). This function is
15718 // also used to custom lower READCYCLECOUNTER nodes.
15719 static void getReadTimeStampCounter(SDNode *N, SDLoc DL, unsigned Opcode,
15720 SelectionDAG &DAG, const X86Subtarget *Subtarget,
15721 SmallVectorImpl<SDValue> &Results) {
15722 SDVTList Tys = DAG.getVTList(MVT::Other, MVT::Glue);
15723 SDValue rd = DAG.getNode(Opcode, DL, Tys, N->getOperand(0));
15726 // The processor's time-stamp counter (a 64-bit MSR) is stored into the
15727 // EDX:EAX registers. EDX is loaded with the high-order 32 bits of the MSR
15728 // and the EAX register is loaded with the low-order 32 bits.
15729 if (Subtarget->is64Bit()) {
15730 LO = DAG.getCopyFromReg(rd, DL, X86::RAX, MVT::i64, rd.getValue(1));
15731 HI = DAG.getCopyFromReg(LO.getValue(1), DL, X86::RDX, MVT::i64,
15734 LO = DAG.getCopyFromReg(rd, DL, X86::EAX, MVT::i32, rd.getValue(1));
15735 HI = DAG.getCopyFromReg(LO.getValue(1), DL, X86::EDX, MVT::i32,
15738 SDValue Chain = HI.getValue(1);
15740 if (Opcode == X86ISD::RDTSCP_DAG) {
15741 assert(N->getNumOperands() == 3 && "Unexpected number of operands!");
15743 // Instruction RDTSCP loads the IA32:TSC_AUX_MSR (address C000_0103H) into
15744 // the ECX register. Add 'ecx' explicitly to the chain.
15745 SDValue ecx = DAG.getCopyFromReg(Chain, DL, X86::ECX, MVT::i32,
15747 // Explicitly store the content of ECX at the location passed in input
15748 // to the 'rdtscp' intrinsic.
15749 Chain = DAG.getStore(ecx.getValue(1), DL, ecx, N->getOperand(2),
15750 MachinePointerInfo(), false, false, 0);
15753 if (Subtarget->is64Bit()) {
15754 // The EDX register is loaded with the high-order 32 bits of the MSR, and
15755 // the EAX register is loaded with the low-order 32 bits.
15756 SDValue Tmp = DAG.getNode(ISD::SHL, DL, MVT::i64, HI,
15757 DAG.getConstant(32, MVT::i8));
15758 Results.push_back(DAG.getNode(ISD::OR, DL, MVT::i64, LO, Tmp));
15759 Results.push_back(Chain);
15763 // Use a buildpair to merge the two 32-bit values into a 64-bit one.
15764 SDValue Ops[] = { LO, HI };
15765 SDValue Pair = DAG.getNode(ISD::BUILD_PAIR, DL, MVT::i64, Ops);
15766 Results.push_back(Pair);
15767 Results.push_back(Chain);
15770 static SDValue LowerREADCYCLECOUNTER(SDValue Op, const X86Subtarget *Subtarget,
15771 SelectionDAG &DAG) {
15772 SmallVector<SDValue, 2> Results;
15774 getReadTimeStampCounter(Op.getNode(), DL, X86ISD::RDTSC_DAG, DAG, Subtarget,
15776 return DAG.getMergeValues(Results, DL);
15780 static SDValue LowerINTRINSIC_W_CHAIN(SDValue Op, const X86Subtarget *Subtarget,
15781 SelectionDAG &DAG) {
15782 unsigned IntNo = cast<ConstantSDNode>(Op.getOperand(1))->getZExtValue();
15784 const IntrinsicData* IntrData = getIntrinsicWithChain(IntNo);
15789 switch(IntrData->Type) {
15791 llvm_unreachable("Unknown Intrinsic Type");
15795 // Emit the node with the right value type.
15796 SDVTList VTs = DAG.getVTList(Op->getValueType(0), MVT::Glue, MVT::Other);
15797 SDValue Result = DAG.getNode(IntrData->Opc0, dl, VTs, Op.getOperand(0));
15799 // If the value returned by RDRAND/RDSEED was valid (CF=1), return 1.
15800 // Otherwise return the value from Rand, which is always 0, casted to i32.
15801 SDValue Ops[] = { DAG.getZExtOrTrunc(Result, dl, Op->getValueType(1)),
15802 DAG.getConstant(1, Op->getValueType(1)),
15803 DAG.getConstant(X86::COND_B, MVT::i32),
15804 SDValue(Result.getNode(), 1) };
15805 SDValue isValid = DAG.getNode(X86ISD::CMOV, dl,
15806 DAG.getVTList(Op->getValueType(1), MVT::Glue),
15809 // Return { result, isValid, chain }.
15810 return DAG.getNode(ISD::MERGE_VALUES, dl, Op->getVTList(), Result, isValid,
15811 SDValue(Result.getNode(), 2));
15814 //gather(v1, mask, index, base, scale);
15815 SDValue Chain = Op.getOperand(0);
15816 SDValue Src = Op.getOperand(2);
15817 SDValue Base = Op.getOperand(3);
15818 SDValue Index = Op.getOperand(4);
15819 SDValue Mask = Op.getOperand(5);
15820 SDValue Scale = Op.getOperand(6);
15821 return getGatherNode(IntrData->Opc0, Op, DAG, Src, Mask, Base, Index, Scale, Chain,
15825 //scatter(base, mask, index, v1, scale);
15826 SDValue Chain = Op.getOperand(0);
15827 SDValue Base = Op.getOperand(2);
15828 SDValue Mask = Op.getOperand(3);
15829 SDValue Index = Op.getOperand(4);
15830 SDValue Src = Op.getOperand(5);
15831 SDValue Scale = Op.getOperand(6);
15832 return getScatterNode(IntrData->Opc0, Op, DAG, Src, Mask, Base, Index, Scale, Chain);
15835 SDValue Hint = Op.getOperand(6);
15837 if (dyn_cast<ConstantSDNode> (Hint) == nullptr ||
15838 (HintVal = dyn_cast<ConstantSDNode> (Hint)->getZExtValue()) > 1)
15839 llvm_unreachable("Wrong prefetch hint in intrinsic: should be 0 or 1");
15840 unsigned Opcode = (HintVal ? IntrData->Opc1 : IntrData->Opc0);
15841 SDValue Chain = Op.getOperand(0);
15842 SDValue Mask = Op.getOperand(2);
15843 SDValue Index = Op.getOperand(3);
15844 SDValue Base = Op.getOperand(4);
15845 SDValue Scale = Op.getOperand(5);
15846 return getPrefetchNode(Opcode, Op, DAG, Mask, Base, Index, Scale, Chain);
15848 // Read Time Stamp Counter (RDTSC) and Processor ID (RDTSCP).
15850 SmallVector<SDValue, 2> Results;
15851 getReadTimeStampCounter(Op.getNode(), dl, IntrData->Opc0, DAG, Subtarget, Results);
15852 return DAG.getMergeValues(Results, dl);
15854 // Read Performance Monitoring Counters.
15856 SmallVector<SDValue, 2> Results;
15857 getReadPerformanceCounter(Op.getNode(), dl, DAG, Subtarget, Results);
15858 return DAG.getMergeValues(Results, dl);
15860 // XTEST intrinsics.
15862 SDVTList VTs = DAG.getVTList(Op->getValueType(0), MVT::Other);
15863 SDValue InTrans = DAG.getNode(IntrData->Opc0, dl, VTs, Op.getOperand(0));
15864 SDValue SetCC = DAG.getNode(X86ISD::SETCC, dl, MVT::i8,
15865 DAG.getConstant(X86::COND_NE, MVT::i8),
15867 SDValue Ret = DAG.getNode(ISD::ZERO_EXTEND, dl, Op->getValueType(0), SetCC);
15868 return DAG.getNode(ISD::MERGE_VALUES, dl, Op->getVTList(),
15869 Ret, SDValue(InTrans.getNode(), 1));
15873 SmallVector<SDValue, 2> Results;
15874 SDVTList CFVTs = DAG.getVTList(Op->getValueType(0), MVT::Other);
15875 SDVTList VTs = DAG.getVTList(Op.getOperand(3)->getValueType(0), MVT::Other);
15876 SDValue GenCF = DAG.getNode(X86ISD::ADD, dl, CFVTs, Op.getOperand(2),
15877 DAG.getConstant(-1, MVT::i8));
15878 SDValue Res = DAG.getNode(IntrData->Opc0, dl, VTs, Op.getOperand(3),
15879 Op.getOperand(4), GenCF.getValue(1));
15880 SDValue Store = DAG.getStore(Op.getOperand(0), dl, Res.getValue(0),
15881 Op.getOperand(5), MachinePointerInfo(),
15883 SDValue SetCC = DAG.getNode(X86ISD::SETCC, dl, MVT::i8,
15884 DAG.getConstant(X86::COND_B, MVT::i8),
15886 Results.push_back(SetCC);
15887 Results.push_back(Store);
15888 return DAG.getMergeValues(Results, dl);
15893 SDValue X86TargetLowering::LowerRETURNADDR(SDValue Op,
15894 SelectionDAG &DAG) const {
15895 MachineFrameInfo *MFI = DAG.getMachineFunction().getFrameInfo();
15896 MFI->setReturnAddressIsTaken(true);
15898 if (verifyReturnAddressArgumentIsConstant(Op, DAG))
15901 unsigned Depth = cast<ConstantSDNode>(Op.getOperand(0))->getZExtValue();
15903 EVT PtrVT = getPointerTy();
15906 SDValue FrameAddr = LowerFRAMEADDR(Op, DAG);
15907 const X86RegisterInfo *RegInfo = static_cast<const X86RegisterInfo *>(
15908 DAG.getSubtarget().getRegisterInfo());
15909 SDValue Offset = DAG.getConstant(RegInfo->getSlotSize(), PtrVT);
15910 return DAG.getLoad(PtrVT, dl, DAG.getEntryNode(),
15911 DAG.getNode(ISD::ADD, dl, PtrVT,
15912 FrameAddr, Offset),
15913 MachinePointerInfo(), false, false, false, 0);
15916 // Just load the return address.
15917 SDValue RetAddrFI = getReturnAddressFrameIndex(DAG);
15918 return DAG.getLoad(PtrVT, dl, DAG.getEntryNode(),
15919 RetAddrFI, MachinePointerInfo(), false, false, false, 0);
15922 SDValue X86TargetLowering::LowerFRAMEADDR(SDValue Op, SelectionDAG &DAG) const {
15923 MachineFrameInfo *MFI = DAG.getMachineFunction().getFrameInfo();
15924 MFI->setFrameAddressIsTaken(true);
15926 EVT VT = Op.getValueType();
15927 SDLoc dl(Op); // FIXME probably not meaningful
15928 unsigned Depth = cast<ConstantSDNode>(Op.getOperand(0))->getZExtValue();
15929 const X86RegisterInfo *RegInfo = static_cast<const X86RegisterInfo *>(
15930 DAG.getSubtarget().getRegisterInfo());
15931 unsigned FrameReg = RegInfo->getFrameRegister(DAG.getMachineFunction());
15932 assert(((FrameReg == X86::RBP && VT == MVT::i64) ||
15933 (FrameReg == X86::EBP && VT == MVT::i32)) &&
15934 "Invalid Frame Register!");
15935 SDValue FrameAddr = DAG.getCopyFromReg(DAG.getEntryNode(), dl, FrameReg, VT);
15937 FrameAddr = DAG.getLoad(VT, dl, DAG.getEntryNode(), FrameAddr,
15938 MachinePointerInfo(),
15939 false, false, false, 0);
15943 // FIXME? Maybe this could be a TableGen attribute on some registers and
15944 // this table could be generated automatically from RegInfo.
15945 unsigned X86TargetLowering::getRegisterByName(const char* RegName,
15947 unsigned Reg = StringSwitch<unsigned>(RegName)
15948 .Case("esp", X86::ESP)
15949 .Case("rsp", X86::RSP)
15953 report_fatal_error("Invalid register name global variable");
15956 SDValue X86TargetLowering::LowerFRAME_TO_ARGS_OFFSET(SDValue Op,
15957 SelectionDAG &DAG) const {
15958 const X86RegisterInfo *RegInfo = static_cast<const X86RegisterInfo *>(
15959 DAG.getSubtarget().getRegisterInfo());
15960 return DAG.getIntPtrConstant(2 * RegInfo->getSlotSize());
15963 SDValue X86TargetLowering::LowerEH_RETURN(SDValue Op, SelectionDAG &DAG) const {
15964 SDValue Chain = Op.getOperand(0);
15965 SDValue Offset = Op.getOperand(1);
15966 SDValue Handler = Op.getOperand(2);
15969 EVT PtrVT = getPointerTy();
15970 const X86RegisterInfo *RegInfo = static_cast<const X86RegisterInfo *>(
15971 DAG.getSubtarget().getRegisterInfo());
15972 unsigned FrameReg = RegInfo->getFrameRegister(DAG.getMachineFunction());
15973 assert(((FrameReg == X86::RBP && PtrVT == MVT::i64) ||
15974 (FrameReg == X86::EBP && PtrVT == MVT::i32)) &&
15975 "Invalid Frame Register!");
15976 SDValue Frame = DAG.getCopyFromReg(DAG.getEntryNode(), dl, FrameReg, PtrVT);
15977 unsigned StoreAddrReg = (PtrVT == MVT::i64) ? X86::RCX : X86::ECX;
15979 SDValue StoreAddr = DAG.getNode(ISD::ADD, dl, PtrVT, Frame,
15980 DAG.getIntPtrConstant(RegInfo->getSlotSize()));
15981 StoreAddr = DAG.getNode(ISD::ADD, dl, PtrVT, StoreAddr, Offset);
15982 Chain = DAG.getStore(Chain, dl, Handler, StoreAddr, MachinePointerInfo(),
15984 Chain = DAG.getCopyToReg(Chain, dl, StoreAddrReg, StoreAddr);
15986 return DAG.getNode(X86ISD::EH_RETURN, dl, MVT::Other, Chain,
15987 DAG.getRegister(StoreAddrReg, PtrVT));
15990 SDValue X86TargetLowering::lowerEH_SJLJ_SETJMP(SDValue Op,
15991 SelectionDAG &DAG) const {
15993 return DAG.getNode(X86ISD::EH_SJLJ_SETJMP, DL,
15994 DAG.getVTList(MVT::i32, MVT::Other),
15995 Op.getOperand(0), Op.getOperand(1));
15998 SDValue X86TargetLowering::lowerEH_SJLJ_LONGJMP(SDValue Op,
15999 SelectionDAG &DAG) const {
16001 return DAG.getNode(X86ISD::EH_SJLJ_LONGJMP, DL, MVT::Other,
16002 Op.getOperand(0), Op.getOperand(1));
16005 static SDValue LowerADJUST_TRAMPOLINE(SDValue Op, SelectionDAG &DAG) {
16006 return Op.getOperand(0);
16009 SDValue X86TargetLowering::LowerINIT_TRAMPOLINE(SDValue Op,
16010 SelectionDAG &DAG) const {
16011 SDValue Root = Op.getOperand(0);
16012 SDValue Trmp = Op.getOperand(1); // trampoline
16013 SDValue FPtr = Op.getOperand(2); // nested function
16014 SDValue Nest = Op.getOperand(3); // 'nest' parameter value
16017 const Value *TrmpAddr = cast<SrcValueSDNode>(Op.getOperand(4))->getValue();
16018 const TargetRegisterInfo *TRI = DAG.getSubtarget().getRegisterInfo();
16020 if (Subtarget->is64Bit()) {
16021 SDValue OutChains[6];
16023 // Large code-model.
16024 const unsigned char JMP64r = 0xFF; // 64-bit jmp through register opcode.
16025 const unsigned char MOV64ri = 0xB8; // X86::MOV64ri opcode.
16027 const unsigned char N86R10 = TRI->getEncodingValue(X86::R10) & 0x7;
16028 const unsigned char N86R11 = TRI->getEncodingValue(X86::R11) & 0x7;
16030 const unsigned char REX_WB = 0x40 | 0x08 | 0x01; // REX prefix
16032 // Load the pointer to the nested function into R11.
16033 unsigned OpCode = ((MOV64ri | N86R11) << 8) | REX_WB; // movabsq r11
16034 SDValue Addr = Trmp;
16035 OutChains[0] = DAG.getStore(Root, dl, DAG.getConstant(OpCode, MVT::i16),
16036 Addr, MachinePointerInfo(TrmpAddr),
16039 Addr = DAG.getNode(ISD::ADD, dl, MVT::i64, Trmp,
16040 DAG.getConstant(2, MVT::i64));
16041 OutChains[1] = DAG.getStore(Root, dl, FPtr, Addr,
16042 MachinePointerInfo(TrmpAddr, 2),
16045 // Load the 'nest' parameter value into R10.
16046 // R10 is specified in X86CallingConv.td
16047 OpCode = ((MOV64ri | N86R10) << 8) | REX_WB; // movabsq r10
16048 Addr = DAG.getNode(ISD::ADD, dl, MVT::i64, Trmp,
16049 DAG.getConstant(10, MVT::i64));
16050 OutChains[2] = DAG.getStore(Root, dl, DAG.getConstant(OpCode, MVT::i16),
16051 Addr, MachinePointerInfo(TrmpAddr, 10),
16054 Addr = DAG.getNode(ISD::ADD, dl, MVT::i64, Trmp,
16055 DAG.getConstant(12, MVT::i64));
16056 OutChains[3] = DAG.getStore(Root, dl, Nest, Addr,
16057 MachinePointerInfo(TrmpAddr, 12),
16060 // Jump to the nested function.
16061 OpCode = (JMP64r << 8) | REX_WB; // jmpq *...
16062 Addr = DAG.getNode(ISD::ADD, dl, MVT::i64, Trmp,
16063 DAG.getConstant(20, MVT::i64));
16064 OutChains[4] = DAG.getStore(Root, dl, DAG.getConstant(OpCode, MVT::i16),
16065 Addr, MachinePointerInfo(TrmpAddr, 20),
16068 unsigned char ModRM = N86R11 | (4 << 3) | (3 << 6); // ...r11
16069 Addr = DAG.getNode(ISD::ADD, dl, MVT::i64, Trmp,
16070 DAG.getConstant(22, MVT::i64));
16071 OutChains[5] = DAG.getStore(Root, dl, DAG.getConstant(ModRM, MVT::i8), Addr,
16072 MachinePointerInfo(TrmpAddr, 22),
16075 return DAG.getNode(ISD::TokenFactor, dl, MVT::Other, OutChains);
16077 const Function *Func =
16078 cast<Function>(cast<SrcValueSDNode>(Op.getOperand(5))->getValue());
16079 CallingConv::ID CC = Func->getCallingConv();
16084 llvm_unreachable("Unsupported calling convention");
16085 case CallingConv::C:
16086 case CallingConv::X86_StdCall: {
16087 // Pass 'nest' parameter in ECX.
16088 // Must be kept in sync with X86CallingConv.td
16089 NestReg = X86::ECX;
16091 // Check that ECX wasn't needed by an 'inreg' parameter.
16092 FunctionType *FTy = Func->getFunctionType();
16093 const AttributeSet &Attrs = Func->getAttributes();
16095 if (!Attrs.isEmpty() && !Func->isVarArg()) {
16096 unsigned InRegCount = 0;
16099 for (FunctionType::param_iterator I = FTy->param_begin(),
16100 E = FTy->param_end(); I != E; ++I, ++Idx)
16101 if (Attrs.hasAttribute(Idx, Attribute::InReg))
16102 // FIXME: should only count parameters that are lowered to integers.
16103 InRegCount += (TD->getTypeSizeInBits(*I) + 31) / 32;
16105 if (InRegCount > 2) {
16106 report_fatal_error("Nest register in use - reduce number of inreg"
16112 case CallingConv::X86_FastCall:
16113 case CallingConv::X86_ThisCall:
16114 case CallingConv::Fast:
16115 // Pass 'nest' parameter in EAX.
16116 // Must be kept in sync with X86CallingConv.td
16117 NestReg = X86::EAX;
16121 SDValue OutChains[4];
16122 SDValue Addr, Disp;
16124 Addr = DAG.getNode(ISD::ADD, dl, MVT::i32, Trmp,
16125 DAG.getConstant(10, MVT::i32));
16126 Disp = DAG.getNode(ISD::SUB, dl, MVT::i32, FPtr, Addr);
16128 // This is storing the opcode for MOV32ri.
16129 const unsigned char MOV32ri = 0xB8; // X86::MOV32ri's opcode byte.
16130 const unsigned char N86Reg = TRI->getEncodingValue(NestReg) & 0x7;
16131 OutChains[0] = DAG.getStore(Root, dl,
16132 DAG.getConstant(MOV32ri|N86Reg, MVT::i8),
16133 Trmp, MachinePointerInfo(TrmpAddr),
16136 Addr = DAG.getNode(ISD::ADD, dl, MVT::i32, Trmp,
16137 DAG.getConstant(1, MVT::i32));
16138 OutChains[1] = DAG.getStore(Root, dl, Nest, Addr,
16139 MachinePointerInfo(TrmpAddr, 1),
16142 const unsigned char JMP = 0xE9; // jmp <32bit dst> opcode.
16143 Addr = DAG.getNode(ISD::ADD, dl, MVT::i32, Trmp,
16144 DAG.getConstant(5, MVT::i32));
16145 OutChains[2] = DAG.getStore(Root, dl, DAG.getConstant(JMP, MVT::i8), Addr,
16146 MachinePointerInfo(TrmpAddr, 5),
16149 Addr = DAG.getNode(ISD::ADD, dl, MVT::i32, Trmp,
16150 DAG.getConstant(6, MVT::i32));
16151 OutChains[3] = DAG.getStore(Root, dl, Disp, Addr,
16152 MachinePointerInfo(TrmpAddr, 6),
16155 return DAG.getNode(ISD::TokenFactor, dl, MVT::Other, OutChains);
16159 SDValue X86TargetLowering::LowerFLT_ROUNDS_(SDValue Op,
16160 SelectionDAG &DAG) const {
16162 The rounding mode is in bits 11:10 of FPSR, and has the following
16164 00 Round to nearest
16169 FLT_ROUNDS, on the other hand, expects the following:
16176 To perform the conversion, we do:
16177 (((((FPSR & 0x800) >> 11) | ((FPSR & 0x400) >> 9)) + 1) & 3)
16180 MachineFunction &MF = DAG.getMachineFunction();
16181 const TargetMachine &TM = MF.getTarget();
16182 const TargetFrameLowering &TFI = *TM.getSubtargetImpl()->getFrameLowering();
16183 unsigned StackAlignment = TFI.getStackAlignment();
16184 MVT VT = Op.getSimpleValueType();
16187 // Save FP Control Word to stack slot
16188 int SSFI = MF.getFrameInfo()->CreateStackObject(2, StackAlignment, false);
16189 SDValue StackSlot = DAG.getFrameIndex(SSFI, getPointerTy());
16191 MachineMemOperand *MMO =
16192 MF.getMachineMemOperand(MachinePointerInfo::getFixedStack(SSFI),
16193 MachineMemOperand::MOStore, 2, 2);
16195 SDValue Ops[] = { DAG.getEntryNode(), StackSlot };
16196 SDValue Chain = DAG.getMemIntrinsicNode(X86ISD::FNSTCW16m, DL,
16197 DAG.getVTList(MVT::Other),
16198 Ops, MVT::i16, MMO);
16200 // Load FP Control Word from stack slot
16201 SDValue CWD = DAG.getLoad(MVT::i16, DL, Chain, StackSlot,
16202 MachinePointerInfo(), false, false, false, 0);
16204 // Transform as necessary
16206 DAG.getNode(ISD::SRL, DL, MVT::i16,
16207 DAG.getNode(ISD::AND, DL, MVT::i16,
16208 CWD, DAG.getConstant(0x800, MVT::i16)),
16209 DAG.getConstant(11, MVT::i8));
16211 DAG.getNode(ISD::SRL, DL, MVT::i16,
16212 DAG.getNode(ISD::AND, DL, MVT::i16,
16213 CWD, DAG.getConstant(0x400, MVT::i16)),
16214 DAG.getConstant(9, MVT::i8));
16217 DAG.getNode(ISD::AND, DL, MVT::i16,
16218 DAG.getNode(ISD::ADD, DL, MVT::i16,
16219 DAG.getNode(ISD::OR, DL, MVT::i16, CWD1, CWD2),
16220 DAG.getConstant(1, MVT::i16)),
16221 DAG.getConstant(3, MVT::i16));
16223 return DAG.getNode((VT.getSizeInBits() < 16 ?
16224 ISD::TRUNCATE : ISD::ZERO_EXTEND), DL, VT, RetVal);
16227 static SDValue LowerCTLZ(SDValue Op, SelectionDAG &DAG) {
16228 MVT VT = Op.getSimpleValueType();
16230 unsigned NumBits = VT.getSizeInBits();
16233 Op = Op.getOperand(0);
16234 if (VT == MVT::i8) {
16235 // Zero extend to i32 since there is not an i8 bsr.
16237 Op = DAG.getNode(ISD::ZERO_EXTEND, dl, OpVT, Op);
16240 // Issue a bsr (scan bits in reverse) which also sets EFLAGS.
16241 SDVTList VTs = DAG.getVTList(OpVT, MVT::i32);
16242 Op = DAG.getNode(X86ISD::BSR, dl, VTs, Op);
16244 // If src is zero (i.e. bsr sets ZF), returns NumBits.
16247 DAG.getConstant(NumBits+NumBits-1, OpVT),
16248 DAG.getConstant(X86::COND_E, MVT::i8),
16251 Op = DAG.getNode(X86ISD::CMOV, dl, OpVT, Ops);
16253 // Finally xor with NumBits-1.
16254 Op = DAG.getNode(ISD::XOR, dl, OpVT, Op, DAG.getConstant(NumBits-1, OpVT));
16257 Op = DAG.getNode(ISD::TRUNCATE, dl, MVT::i8, Op);
16261 static SDValue LowerCTLZ_ZERO_UNDEF(SDValue Op, SelectionDAG &DAG) {
16262 MVT VT = Op.getSimpleValueType();
16264 unsigned NumBits = VT.getSizeInBits();
16267 Op = Op.getOperand(0);
16268 if (VT == MVT::i8) {
16269 // Zero extend to i32 since there is not an i8 bsr.
16271 Op = DAG.getNode(ISD::ZERO_EXTEND, dl, OpVT, Op);
16274 // Issue a bsr (scan bits in reverse).
16275 SDVTList VTs = DAG.getVTList(OpVT, MVT::i32);
16276 Op = DAG.getNode(X86ISD::BSR, dl, VTs, Op);
16278 // And xor with NumBits-1.
16279 Op = DAG.getNode(ISD::XOR, dl, OpVT, Op, DAG.getConstant(NumBits-1, OpVT));
16282 Op = DAG.getNode(ISD::TRUNCATE, dl, MVT::i8, Op);
16286 static SDValue LowerCTTZ(SDValue Op, SelectionDAG &DAG) {
16287 MVT VT = Op.getSimpleValueType();
16288 unsigned NumBits = VT.getSizeInBits();
16290 Op = Op.getOperand(0);
16292 // Issue a bsf (scan bits forward) which also sets EFLAGS.
16293 SDVTList VTs = DAG.getVTList(VT, MVT::i32);
16294 Op = DAG.getNode(X86ISD::BSF, dl, VTs, Op);
16296 // If src is zero (i.e. bsf sets ZF), returns NumBits.
16299 DAG.getConstant(NumBits, VT),
16300 DAG.getConstant(X86::COND_E, MVT::i8),
16303 return DAG.getNode(X86ISD::CMOV, dl, VT, Ops);
16306 // Lower256IntArith - Break a 256-bit integer operation into two new 128-bit
16307 // ones, and then concatenate the result back.
16308 static SDValue Lower256IntArith(SDValue Op, SelectionDAG &DAG) {
16309 MVT VT = Op.getSimpleValueType();
16311 assert(VT.is256BitVector() && VT.isInteger() &&
16312 "Unsupported value type for operation");
16314 unsigned NumElems = VT.getVectorNumElements();
16317 // Extract the LHS vectors
16318 SDValue LHS = Op.getOperand(0);
16319 SDValue LHS1 = Extract128BitVector(LHS, 0, DAG, dl);
16320 SDValue LHS2 = Extract128BitVector(LHS, NumElems/2, DAG, dl);
16322 // Extract the RHS vectors
16323 SDValue RHS = Op.getOperand(1);
16324 SDValue RHS1 = Extract128BitVector(RHS, 0, DAG, dl);
16325 SDValue RHS2 = Extract128BitVector(RHS, NumElems/2, DAG, dl);
16327 MVT EltVT = VT.getVectorElementType();
16328 MVT NewVT = MVT::getVectorVT(EltVT, NumElems/2);
16330 return DAG.getNode(ISD::CONCAT_VECTORS, dl, VT,
16331 DAG.getNode(Op.getOpcode(), dl, NewVT, LHS1, RHS1),
16332 DAG.getNode(Op.getOpcode(), dl, NewVT, LHS2, RHS2));
16335 static SDValue LowerADD(SDValue Op, SelectionDAG &DAG) {
16336 assert(Op.getSimpleValueType().is256BitVector() &&
16337 Op.getSimpleValueType().isInteger() &&
16338 "Only handle AVX 256-bit vector integer operation");
16339 return Lower256IntArith(Op, DAG);
16342 static SDValue LowerSUB(SDValue Op, SelectionDAG &DAG) {
16343 assert(Op.getSimpleValueType().is256BitVector() &&
16344 Op.getSimpleValueType().isInteger() &&
16345 "Only handle AVX 256-bit vector integer operation");
16346 return Lower256IntArith(Op, DAG);
16349 static SDValue LowerMUL(SDValue Op, const X86Subtarget *Subtarget,
16350 SelectionDAG &DAG) {
16352 MVT VT = Op.getSimpleValueType();
16354 // Decompose 256-bit ops into smaller 128-bit ops.
16355 if (VT.is256BitVector() && !Subtarget->hasInt256())
16356 return Lower256IntArith(Op, DAG);
16358 SDValue A = Op.getOperand(0);
16359 SDValue B = Op.getOperand(1);
16361 // Lower v4i32 mul as 2x shuffle, 2x pmuludq, 2x shuffle.
16362 if (VT == MVT::v4i32) {
16363 assert(Subtarget->hasSSE2() && !Subtarget->hasSSE41() &&
16364 "Should not custom lower when pmuldq is available!");
16366 // Extract the odd parts.
16367 static const int UnpackMask[] = { 1, -1, 3, -1 };
16368 SDValue Aodds = DAG.getVectorShuffle(VT, dl, A, A, UnpackMask);
16369 SDValue Bodds = DAG.getVectorShuffle(VT, dl, B, B, UnpackMask);
16371 // Multiply the even parts.
16372 SDValue Evens = DAG.getNode(X86ISD::PMULUDQ, dl, MVT::v2i64, A, B);
16373 // Now multiply odd parts.
16374 SDValue Odds = DAG.getNode(X86ISD::PMULUDQ, dl, MVT::v2i64, Aodds, Bodds);
16376 Evens = DAG.getNode(ISD::BITCAST, dl, VT, Evens);
16377 Odds = DAG.getNode(ISD::BITCAST, dl, VT, Odds);
16379 // Merge the two vectors back together with a shuffle. This expands into 2
16381 static const int ShufMask[] = { 0, 4, 2, 6 };
16382 return DAG.getVectorShuffle(VT, dl, Evens, Odds, ShufMask);
16385 assert((VT == MVT::v2i64 || VT == MVT::v4i64 || VT == MVT::v8i64) &&
16386 "Only know how to lower V2I64/V4I64/V8I64 multiply");
16388 // Ahi = psrlqi(a, 32);
16389 // Bhi = psrlqi(b, 32);
16391 // AloBlo = pmuludq(a, b);
16392 // AloBhi = pmuludq(a, Bhi);
16393 // AhiBlo = pmuludq(Ahi, b);
16395 // AloBhi = psllqi(AloBhi, 32);
16396 // AhiBlo = psllqi(AhiBlo, 32);
16397 // return AloBlo + AloBhi + AhiBlo;
16399 SDValue Ahi = getTargetVShiftByConstNode(X86ISD::VSRLI, dl, VT, A, 32, DAG);
16400 SDValue Bhi = getTargetVShiftByConstNode(X86ISD::VSRLI, dl, VT, B, 32, DAG);
16402 // Bit cast to 32-bit vectors for MULUDQ
16403 EVT MulVT = (VT == MVT::v2i64) ? MVT::v4i32 :
16404 (VT == MVT::v4i64) ? MVT::v8i32 : MVT::v16i32;
16405 A = DAG.getNode(ISD::BITCAST, dl, MulVT, A);
16406 B = DAG.getNode(ISD::BITCAST, dl, MulVT, B);
16407 Ahi = DAG.getNode(ISD::BITCAST, dl, MulVT, Ahi);
16408 Bhi = DAG.getNode(ISD::BITCAST, dl, MulVT, Bhi);
16410 SDValue AloBlo = DAG.getNode(X86ISD::PMULUDQ, dl, VT, A, B);
16411 SDValue AloBhi = DAG.getNode(X86ISD::PMULUDQ, dl, VT, A, Bhi);
16412 SDValue AhiBlo = DAG.getNode(X86ISD::PMULUDQ, dl, VT, Ahi, B);
16414 AloBhi = getTargetVShiftByConstNode(X86ISD::VSHLI, dl, VT, AloBhi, 32, DAG);
16415 AhiBlo = getTargetVShiftByConstNode(X86ISD::VSHLI, dl, VT, AhiBlo, 32, DAG);
16417 SDValue Res = DAG.getNode(ISD::ADD, dl, VT, AloBlo, AloBhi);
16418 return DAG.getNode(ISD::ADD, dl, VT, Res, AhiBlo);
16421 SDValue X86TargetLowering::LowerWin64_i128OP(SDValue Op, SelectionDAG &DAG) const {
16422 assert(Subtarget->isTargetWin64() && "Unexpected target");
16423 EVT VT = Op.getValueType();
16424 assert(VT.isInteger() && VT.getSizeInBits() == 128 &&
16425 "Unexpected return type for lowering");
16429 switch (Op->getOpcode()) {
16430 default: llvm_unreachable("Unexpected request for libcall!");
16431 case ISD::SDIV: isSigned = true; LC = RTLIB::SDIV_I128; break;
16432 case ISD::UDIV: isSigned = false; LC = RTLIB::UDIV_I128; break;
16433 case ISD::SREM: isSigned = true; LC = RTLIB::SREM_I128; break;
16434 case ISD::UREM: isSigned = false; LC = RTLIB::UREM_I128; break;
16435 case ISD::SDIVREM: isSigned = true; LC = RTLIB::SDIVREM_I128; break;
16436 case ISD::UDIVREM: isSigned = false; LC = RTLIB::UDIVREM_I128; break;
16440 SDValue InChain = DAG.getEntryNode();
16442 TargetLowering::ArgListTy Args;
16443 TargetLowering::ArgListEntry Entry;
16444 for (unsigned i = 0, e = Op->getNumOperands(); i != e; ++i) {
16445 EVT ArgVT = Op->getOperand(i).getValueType();
16446 assert(ArgVT.isInteger() && ArgVT.getSizeInBits() == 128 &&
16447 "Unexpected argument type for lowering");
16448 SDValue StackPtr = DAG.CreateStackTemporary(ArgVT, 16);
16449 Entry.Node = StackPtr;
16450 InChain = DAG.getStore(InChain, dl, Op->getOperand(i), StackPtr, MachinePointerInfo(),
16452 Type *ArgTy = ArgVT.getTypeForEVT(*DAG.getContext());
16453 Entry.Ty = PointerType::get(ArgTy,0);
16454 Entry.isSExt = false;
16455 Entry.isZExt = false;
16456 Args.push_back(Entry);
16459 SDValue Callee = DAG.getExternalSymbol(getLibcallName(LC),
16462 TargetLowering::CallLoweringInfo CLI(DAG);
16463 CLI.setDebugLoc(dl).setChain(InChain)
16464 .setCallee(getLibcallCallingConv(LC),
16465 static_cast<EVT>(MVT::v2i64).getTypeForEVT(*DAG.getContext()),
16466 Callee, std::move(Args), 0)
16467 .setInRegister().setSExtResult(isSigned).setZExtResult(!isSigned);
16469 std::pair<SDValue, SDValue> CallInfo = LowerCallTo(CLI);
16470 return DAG.getNode(ISD::BITCAST, dl, VT, CallInfo.first);
16473 static SDValue LowerMUL_LOHI(SDValue Op, const X86Subtarget *Subtarget,
16474 SelectionDAG &DAG) {
16475 SDValue Op0 = Op.getOperand(0), Op1 = Op.getOperand(1);
16476 EVT VT = Op0.getValueType();
16479 assert((VT == MVT::v4i32 && Subtarget->hasSSE2()) ||
16480 (VT == MVT::v8i32 && Subtarget->hasInt256()));
16482 // PMULxD operations multiply each even value (starting at 0) of LHS with
16483 // the related value of RHS and produce a widen result.
16484 // E.g., PMULUDQ <4 x i32> <a|b|c|d>, <4 x i32> <e|f|g|h>
16485 // => <2 x i64> <ae|cg>
16487 // In other word, to have all the results, we need to perform two PMULxD:
16488 // 1. one with the even values.
16489 // 2. one with the odd values.
16490 // To achieve #2, with need to place the odd values at an even position.
16492 // Place the odd value at an even position (basically, shift all values 1
16493 // step to the left):
16494 const int Mask[] = {1, -1, 3, -1, 5, -1, 7, -1};
16495 // <a|b|c|d> => <b|undef|d|undef>
16496 SDValue Odd0 = DAG.getVectorShuffle(VT, dl, Op0, Op0, Mask);
16497 // <e|f|g|h> => <f|undef|h|undef>
16498 SDValue Odd1 = DAG.getVectorShuffle(VT, dl, Op1, Op1, Mask);
16500 // Emit two multiplies, one for the lower 2 ints and one for the higher 2
16502 MVT MulVT = VT == MVT::v4i32 ? MVT::v2i64 : MVT::v4i64;
16503 bool IsSigned = Op->getOpcode() == ISD::SMUL_LOHI;
16505 (!IsSigned || !Subtarget->hasSSE41()) ? X86ISD::PMULUDQ : X86ISD::PMULDQ;
16506 // PMULUDQ <4 x i32> <a|b|c|d>, <4 x i32> <e|f|g|h>
16507 // => <2 x i64> <ae|cg>
16508 SDValue Mul1 = DAG.getNode(ISD::BITCAST, dl, VT,
16509 DAG.getNode(Opcode, dl, MulVT, Op0, Op1));
16510 // PMULUDQ <4 x i32> <b|undef|d|undef>, <4 x i32> <f|undef|h|undef>
16511 // => <2 x i64> <bf|dh>
16512 SDValue Mul2 = DAG.getNode(ISD::BITCAST, dl, VT,
16513 DAG.getNode(Opcode, dl, MulVT, Odd0, Odd1));
16515 // Shuffle it back into the right order.
16516 SDValue Highs, Lows;
16517 if (VT == MVT::v8i32) {
16518 const int HighMask[] = {1, 9, 3, 11, 5, 13, 7, 15};
16519 Highs = DAG.getVectorShuffle(VT, dl, Mul1, Mul2, HighMask);
16520 const int LowMask[] = {0, 8, 2, 10, 4, 12, 6, 14};
16521 Lows = DAG.getVectorShuffle(VT, dl, Mul1, Mul2, LowMask);
16523 const int HighMask[] = {1, 5, 3, 7};
16524 Highs = DAG.getVectorShuffle(VT, dl, Mul1, Mul2, HighMask);
16525 const int LowMask[] = {0, 4, 2, 6};
16526 Lows = DAG.getVectorShuffle(VT, dl, Mul1, Mul2, LowMask);
16529 // If we have a signed multiply but no PMULDQ fix up the high parts of a
16530 // unsigned multiply.
16531 if (IsSigned && !Subtarget->hasSSE41()) {
16533 DAG.getConstant(31, DAG.getTargetLoweringInfo().getShiftAmountTy(VT));
16534 SDValue T1 = DAG.getNode(ISD::AND, dl, VT,
16535 DAG.getNode(ISD::SRA, dl, VT, Op0, ShAmt), Op1);
16536 SDValue T2 = DAG.getNode(ISD::AND, dl, VT,
16537 DAG.getNode(ISD::SRA, dl, VT, Op1, ShAmt), Op0);
16539 SDValue Fixup = DAG.getNode(ISD::ADD, dl, VT, T1, T2);
16540 Highs = DAG.getNode(ISD::SUB, dl, VT, Highs, Fixup);
16543 // The first result of MUL_LOHI is actually the low value, followed by the
16545 SDValue Ops[] = {Lows, Highs};
16546 return DAG.getMergeValues(Ops, dl);
16549 static SDValue LowerScalarImmediateShift(SDValue Op, SelectionDAG &DAG,
16550 const X86Subtarget *Subtarget) {
16551 MVT VT = Op.getSimpleValueType();
16553 SDValue R = Op.getOperand(0);
16554 SDValue Amt = Op.getOperand(1);
16556 // Optimize shl/srl/sra with constant shift amount.
16557 if (auto *BVAmt = dyn_cast<BuildVectorSDNode>(Amt)) {
16558 if (auto *ShiftConst = BVAmt->getConstantSplatNode()) {
16559 uint64_t ShiftAmt = ShiftConst->getZExtValue();
16561 if (VT == MVT::v2i64 || VT == MVT::v4i32 || VT == MVT::v8i16 ||
16562 (Subtarget->hasInt256() &&
16563 (VT == MVT::v4i64 || VT == MVT::v8i32 || VT == MVT::v16i16)) ||
16564 (Subtarget->hasAVX512() &&
16565 (VT == MVT::v8i64 || VT == MVT::v16i32))) {
16566 if (Op.getOpcode() == ISD::SHL)
16567 return getTargetVShiftByConstNode(X86ISD::VSHLI, dl, VT, R, ShiftAmt,
16569 if (Op.getOpcode() == ISD::SRL)
16570 return getTargetVShiftByConstNode(X86ISD::VSRLI, dl, VT, R, ShiftAmt,
16572 if (Op.getOpcode() == ISD::SRA && VT != MVT::v2i64 && VT != MVT::v4i64)
16573 return getTargetVShiftByConstNode(X86ISD::VSRAI, dl, VT, R, ShiftAmt,
16577 if (VT == MVT::v16i8) {
16578 if (Op.getOpcode() == ISD::SHL) {
16579 // Make a large shift.
16580 SDValue SHL = getTargetVShiftByConstNode(X86ISD::VSHLI, dl,
16581 MVT::v8i16, R, ShiftAmt,
16583 SHL = DAG.getNode(ISD::BITCAST, dl, VT, SHL);
16584 // Zero out the rightmost bits.
16585 SmallVector<SDValue, 16> V(16,
16586 DAG.getConstant(uint8_t(-1U << ShiftAmt),
16588 return DAG.getNode(ISD::AND, dl, VT, SHL,
16589 DAG.getNode(ISD::BUILD_VECTOR, dl, VT, V));
16591 if (Op.getOpcode() == ISD::SRL) {
16592 // Make a large shift.
16593 SDValue SRL = getTargetVShiftByConstNode(X86ISD::VSRLI, dl,
16594 MVT::v8i16, R, ShiftAmt,
16596 SRL = DAG.getNode(ISD::BITCAST, dl, VT, SRL);
16597 // Zero out the leftmost bits.
16598 SmallVector<SDValue, 16> V(16,
16599 DAG.getConstant(uint8_t(-1U) >> ShiftAmt,
16601 return DAG.getNode(ISD::AND, dl, VT, SRL,
16602 DAG.getNode(ISD::BUILD_VECTOR, dl, VT, V));
16604 if (Op.getOpcode() == ISD::SRA) {
16605 if (ShiftAmt == 7) {
16606 // R s>> 7 === R s< 0
16607 SDValue Zeros = getZeroVector(VT, Subtarget, DAG, dl);
16608 return DAG.getNode(X86ISD::PCMPGT, dl, VT, Zeros, R);
16611 // R s>> a === ((R u>> a) ^ m) - m
16612 SDValue Res = DAG.getNode(ISD::SRL, dl, VT, R, Amt);
16613 SmallVector<SDValue, 16> V(16, DAG.getConstant(128 >> ShiftAmt,
16615 SDValue Mask = DAG.getNode(ISD::BUILD_VECTOR, dl, VT, V);
16616 Res = DAG.getNode(ISD::XOR, dl, VT, Res, Mask);
16617 Res = DAG.getNode(ISD::SUB, dl, VT, Res, Mask);
16620 llvm_unreachable("Unknown shift opcode.");
16623 if (Subtarget->hasInt256() && VT == MVT::v32i8) {
16624 if (Op.getOpcode() == ISD::SHL) {
16625 // Make a large shift.
16626 SDValue SHL = getTargetVShiftByConstNode(X86ISD::VSHLI, dl,
16627 MVT::v16i16, R, ShiftAmt,
16629 SHL = DAG.getNode(ISD::BITCAST, dl, VT, SHL);
16630 // Zero out the rightmost bits.
16631 SmallVector<SDValue, 32> V(32,
16632 DAG.getConstant(uint8_t(-1U << ShiftAmt),
16634 return DAG.getNode(ISD::AND, dl, VT, SHL,
16635 DAG.getNode(ISD::BUILD_VECTOR, dl, VT, V));
16637 if (Op.getOpcode() == ISD::SRL) {
16638 // Make a large shift.
16639 SDValue SRL = getTargetVShiftByConstNode(X86ISD::VSRLI, dl,
16640 MVT::v16i16, R, ShiftAmt,
16642 SRL = DAG.getNode(ISD::BITCAST, dl, VT, SRL);
16643 // Zero out the leftmost bits.
16644 SmallVector<SDValue, 32> V(32,
16645 DAG.getConstant(uint8_t(-1U) >> ShiftAmt,
16647 return DAG.getNode(ISD::AND, dl, VT, SRL,
16648 DAG.getNode(ISD::BUILD_VECTOR, dl, VT, V));
16650 if (Op.getOpcode() == ISD::SRA) {
16651 if (ShiftAmt == 7) {
16652 // R s>> 7 === R s< 0
16653 SDValue Zeros = getZeroVector(VT, Subtarget, DAG, dl);
16654 return DAG.getNode(X86ISD::PCMPGT, dl, VT, Zeros, R);
16657 // R s>> a === ((R u>> a) ^ m) - m
16658 SDValue Res = DAG.getNode(ISD::SRL, dl, VT, R, Amt);
16659 SmallVector<SDValue, 32> V(32, DAG.getConstant(128 >> ShiftAmt,
16661 SDValue Mask = DAG.getNode(ISD::BUILD_VECTOR, dl, VT, V);
16662 Res = DAG.getNode(ISD::XOR, dl, VT, Res, Mask);
16663 Res = DAG.getNode(ISD::SUB, dl, VT, Res, Mask);
16666 llvm_unreachable("Unknown shift opcode.");
16671 // Special case in 32-bit mode, where i64 is expanded into high and low parts.
16672 if (!Subtarget->is64Bit() &&
16673 (VT == MVT::v2i64 || (Subtarget->hasInt256() && VT == MVT::v4i64)) &&
16674 Amt.getOpcode() == ISD::BITCAST &&
16675 Amt.getOperand(0).getOpcode() == ISD::BUILD_VECTOR) {
16676 Amt = Amt.getOperand(0);
16677 unsigned Ratio = Amt.getSimpleValueType().getVectorNumElements() /
16678 VT.getVectorNumElements();
16679 unsigned RatioInLog2 = Log2_32_Ceil(Ratio);
16680 uint64_t ShiftAmt = 0;
16681 for (unsigned i = 0; i != Ratio; ++i) {
16682 ConstantSDNode *C = dyn_cast<ConstantSDNode>(Amt.getOperand(i));
16686 ShiftAmt |= C->getZExtValue() << (i * (1 << (6 - RatioInLog2)));
16688 // Check remaining shift amounts.
16689 for (unsigned i = Ratio; i != Amt.getNumOperands(); i += Ratio) {
16690 uint64_t ShAmt = 0;
16691 for (unsigned j = 0; j != Ratio; ++j) {
16692 ConstantSDNode *C =
16693 dyn_cast<ConstantSDNode>(Amt.getOperand(i + j));
16697 ShAmt |= C->getZExtValue() << (j * (1 << (6 - RatioInLog2)));
16699 if (ShAmt != ShiftAmt)
16702 switch (Op.getOpcode()) {
16704 llvm_unreachable("Unknown shift opcode!");
16706 return getTargetVShiftByConstNode(X86ISD::VSHLI, dl, VT, R, ShiftAmt,
16709 return getTargetVShiftByConstNode(X86ISD::VSRLI, dl, VT, R, ShiftAmt,
16712 return getTargetVShiftByConstNode(X86ISD::VSRAI, dl, VT, R, ShiftAmt,
16720 static SDValue LowerScalarVariableShift(SDValue Op, SelectionDAG &DAG,
16721 const X86Subtarget* Subtarget) {
16722 MVT VT = Op.getSimpleValueType();
16724 SDValue R = Op.getOperand(0);
16725 SDValue Amt = Op.getOperand(1);
16727 if ((VT == MVT::v2i64 && Op.getOpcode() != ISD::SRA) ||
16728 VT == MVT::v4i32 || VT == MVT::v8i16 ||
16729 (Subtarget->hasInt256() &&
16730 ((VT == MVT::v4i64 && Op.getOpcode() != ISD::SRA) ||
16731 VT == MVT::v8i32 || VT == MVT::v16i16)) ||
16732 (Subtarget->hasAVX512() && (VT == MVT::v8i64 || VT == MVT::v16i32))) {
16734 EVT EltVT = VT.getVectorElementType();
16736 if (Amt.getOpcode() == ISD::BUILD_VECTOR) {
16737 unsigned NumElts = VT.getVectorNumElements();
16739 for (i = 0; i != NumElts; ++i) {
16740 if (Amt.getOperand(i).getOpcode() == ISD::UNDEF)
16744 for (j = i; j != NumElts; ++j) {
16745 SDValue Arg = Amt.getOperand(j);
16746 if (Arg.getOpcode() == ISD::UNDEF) continue;
16747 if (Arg != Amt.getOperand(i))
16750 if (i != NumElts && j == NumElts)
16751 BaseShAmt = Amt.getOperand(i);
16753 if (Amt.getOpcode() == ISD::EXTRACT_SUBVECTOR)
16754 Amt = Amt.getOperand(0);
16755 if (Amt.getOpcode() == ISD::VECTOR_SHUFFLE &&
16756 cast<ShuffleVectorSDNode>(Amt)->isSplat()) {
16757 SDValue InVec = Amt.getOperand(0);
16758 if (InVec.getOpcode() == ISD::BUILD_VECTOR) {
16759 unsigned NumElts = InVec.getValueType().getVectorNumElements();
16761 for (; i != NumElts; ++i) {
16762 SDValue Arg = InVec.getOperand(i);
16763 if (Arg.getOpcode() == ISD::UNDEF) continue;
16767 } else if (InVec.getOpcode() == ISD::INSERT_VECTOR_ELT) {
16768 if (ConstantSDNode *C =
16769 dyn_cast<ConstantSDNode>(InVec.getOperand(2))) {
16770 unsigned SplatIdx =
16771 cast<ShuffleVectorSDNode>(Amt)->getSplatIndex();
16772 if (C->getZExtValue() == SplatIdx)
16773 BaseShAmt = InVec.getOperand(1);
16776 if (!BaseShAmt.getNode())
16777 BaseShAmt = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, EltVT, Amt,
16778 DAG.getIntPtrConstant(0));
16782 if (BaseShAmt.getNode()) {
16783 if (EltVT.bitsGT(MVT::i32))
16784 BaseShAmt = DAG.getNode(ISD::TRUNCATE, dl, MVT::i32, BaseShAmt);
16785 else if (EltVT.bitsLT(MVT::i32))
16786 BaseShAmt = DAG.getNode(ISD::ZERO_EXTEND, dl, MVT::i32, BaseShAmt);
16788 switch (Op.getOpcode()) {
16790 llvm_unreachable("Unknown shift opcode!");
16792 switch (VT.SimpleTy) {
16793 default: return SDValue();
16802 return getTargetVShiftNode(X86ISD::VSHLI, dl, VT, R, BaseShAmt, DAG);
16805 switch (VT.SimpleTy) {
16806 default: return SDValue();
16813 return getTargetVShiftNode(X86ISD::VSRAI, dl, VT, R, BaseShAmt, DAG);
16816 switch (VT.SimpleTy) {
16817 default: return SDValue();
16826 return getTargetVShiftNode(X86ISD::VSRLI, dl, VT, R, BaseShAmt, DAG);
16832 // Special case in 32-bit mode, where i64 is expanded into high and low parts.
16833 if (!Subtarget->is64Bit() &&
16834 (VT == MVT::v2i64 || (Subtarget->hasInt256() && VT == MVT::v4i64) ||
16835 (Subtarget->hasAVX512() && VT == MVT::v8i64)) &&
16836 Amt.getOpcode() == ISD::BITCAST &&
16837 Amt.getOperand(0).getOpcode() == ISD::BUILD_VECTOR) {
16838 Amt = Amt.getOperand(0);
16839 unsigned Ratio = Amt.getSimpleValueType().getVectorNumElements() /
16840 VT.getVectorNumElements();
16841 std::vector<SDValue> Vals(Ratio);
16842 for (unsigned i = 0; i != Ratio; ++i)
16843 Vals[i] = Amt.getOperand(i);
16844 for (unsigned i = Ratio; i != Amt.getNumOperands(); i += Ratio) {
16845 for (unsigned j = 0; j != Ratio; ++j)
16846 if (Vals[j] != Amt.getOperand(i + j))
16849 switch (Op.getOpcode()) {
16851 llvm_unreachable("Unknown shift opcode!");
16853 return DAG.getNode(X86ISD::VSHL, dl, VT, R, Op.getOperand(1));
16855 return DAG.getNode(X86ISD::VSRL, dl, VT, R, Op.getOperand(1));
16857 return DAG.getNode(X86ISD::VSRA, dl, VT, R, Op.getOperand(1));
16864 static SDValue LowerShift(SDValue Op, const X86Subtarget* Subtarget,
16865 SelectionDAG &DAG) {
16866 MVT VT = Op.getSimpleValueType();
16868 SDValue R = Op.getOperand(0);
16869 SDValue Amt = Op.getOperand(1);
16872 assert(VT.isVector() && "Custom lowering only for vector shifts!");
16873 assert(Subtarget->hasSSE2() && "Only custom lower when we have SSE2!");
16875 V = LowerScalarImmediateShift(Op, DAG, Subtarget);
16879 V = LowerScalarVariableShift(Op, DAG, Subtarget);
16883 if (Subtarget->hasAVX512() && (VT == MVT::v16i32 || VT == MVT::v8i64))
16885 // AVX2 has VPSLLV/VPSRAV/VPSRLV.
16886 if (Subtarget->hasInt256()) {
16887 if (Op.getOpcode() == ISD::SRL &&
16888 (VT == MVT::v2i64 || VT == MVT::v4i32 ||
16889 VT == MVT::v4i64 || VT == MVT::v8i32))
16891 if (Op.getOpcode() == ISD::SHL &&
16892 (VT == MVT::v2i64 || VT == MVT::v4i32 ||
16893 VT == MVT::v4i64 || VT == MVT::v8i32))
16895 if (Op.getOpcode() == ISD::SRA && (VT == MVT::v4i32 || VT == MVT::v8i32))
16899 // If possible, lower this packed shift into a vector multiply instead of
16900 // expanding it into a sequence of scalar shifts.
16901 // Do this only if the vector shift count is a constant build_vector.
16902 if (Op.getOpcode() == ISD::SHL &&
16903 (VT == MVT::v8i16 || VT == MVT::v4i32 ||
16904 (Subtarget->hasInt256() && VT == MVT::v16i16)) &&
16905 ISD::isBuildVectorOfConstantSDNodes(Amt.getNode())) {
16906 SmallVector<SDValue, 8> Elts;
16907 EVT SVT = VT.getScalarType();
16908 unsigned SVTBits = SVT.getSizeInBits();
16909 const APInt &One = APInt(SVTBits, 1);
16910 unsigned NumElems = VT.getVectorNumElements();
16912 for (unsigned i=0; i !=NumElems; ++i) {
16913 SDValue Op = Amt->getOperand(i);
16914 if (Op->getOpcode() == ISD::UNDEF) {
16915 Elts.push_back(Op);
16919 ConstantSDNode *ND = cast<ConstantSDNode>(Op);
16920 const APInt &C = APInt(SVTBits, ND->getAPIntValue().getZExtValue());
16921 uint64_t ShAmt = C.getZExtValue();
16922 if (ShAmt >= SVTBits) {
16923 Elts.push_back(DAG.getUNDEF(SVT));
16926 Elts.push_back(DAG.getConstant(One.shl(ShAmt), SVT));
16928 SDValue BV = DAG.getNode(ISD::BUILD_VECTOR, dl, VT, Elts);
16929 return DAG.getNode(ISD::MUL, dl, VT, R, BV);
16932 // Lower SHL with variable shift amount.
16933 if (VT == MVT::v4i32 && Op->getOpcode() == ISD::SHL) {
16934 Op = DAG.getNode(ISD::SHL, dl, VT, Amt, DAG.getConstant(23, VT));
16936 Op = DAG.getNode(ISD::ADD, dl, VT, Op, DAG.getConstant(0x3f800000U, VT));
16937 Op = DAG.getNode(ISD::BITCAST, dl, MVT::v4f32, Op);
16938 Op = DAG.getNode(ISD::FP_TO_SINT, dl, VT, Op);
16939 return DAG.getNode(ISD::MUL, dl, VT, Op, R);
16942 // If possible, lower this shift as a sequence of two shifts by
16943 // constant plus a MOVSS/MOVSD instead of scalarizing it.
16945 // (v4i32 (srl A, (build_vector < X, Y, Y, Y>)))
16947 // Could be rewritten as:
16948 // (v4i32 (MOVSS (srl A, <Y,Y,Y,Y>), (srl A, <X,X,X,X>)))
16950 // The advantage is that the two shifts from the example would be
16951 // lowered as X86ISD::VSRLI nodes. This would be cheaper than scalarizing
16952 // the vector shift into four scalar shifts plus four pairs of vector
16954 if ((VT == MVT::v8i16 || VT == MVT::v4i32) &&
16955 ISD::isBuildVectorOfConstantSDNodes(Amt.getNode())) {
16956 unsigned TargetOpcode = X86ISD::MOVSS;
16957 bool CanBeSimplified;
16958 // The splat value for the first packed shift (the 'X' from the example).
16959 SDValue Amt1 = Amt->getOperand(0);
16960 // The splat value for the second packed shift (the 'Y' from the example).
16961 SDValue Amt2 = (VT == MVT::v4i32) ? Amt->getOperand(1) :
16962 Amt->getOperand(2);
16964 // See if it is possible to replace this node with a sequence of
16965 // two shifts followed by a MOVSS/MOVSD
16966 if (VT == MVT::v4i32) {
16967 // Check if it is legal to use a MOVSS.
16968 CanBeSimplified = Amt2 == Amt->getOperand(2) &&
16969 Amt2 == Amt->getOperand(3);
16970 if (!CanBeSimplified) {
16971 // Otherwise, check if we can still simplify this node using a MOVSD.
16972 CanBeSimplified = Amt1 == Amt->getOperand(1) &&
16973 Amt->getOperand(2) == Amt->getOperand(3);
16974 TargetOpcode = X86ISD::MOVSD;
16975 Amt2 = Amt->getOperand(2);
16978 // Do similar checks for the case where the machine value type
16980 CanBeSimplified = Amt1 == Amt->getOperand(1);
16981 for (unsigned i=3; i != 8 && CanBeSimplified; ++i)
16982 CanBeSimplified = Amt2 == Amt->getOperand(i);
16984 if (!CanBeSimplified) {
16985 TargetOpcode = X86ISD::MOVSD;
16986 CanBeSimplified = true;
16987 Amt2 = Amt->getOperand(4);
16988 for (unsigned i=0; i != 4 && CanBeSimplified; ++i)
16989 CanBeSimplified = Amt1 == Amt->getOperand(i);
16990 for (unsigned j=4; j != 8 && CanBeSimplified; ++j)
16991 CanBeSimplified = Amt2 == Amt->getOperand(j);
16995 if (CanBeSimplified && isa<ConstantSDNode>(Amt1) &&
16996 isa<ConstantSDNode>(Amt2)) {
16997 // Replace this node with two shifts followed by a MOVSS/MOVSD.
16998 EVT CastVT = MVT::v4i32;
17000 DAG.getConstant(cast<ConstantSDNode>(Amt1)->getAPIntValue(), VT);
17001 SDValue Shift1 = DAG.getNode(Op->getOpcode(), dl, VT, R, Splat1);
17003 DAG.getConstant(cast<ConstantSDNode>(Amt2)->getAPIntValue(), VT);
17004 SDValue Shift2 = DAG.getNode(Op->getOpcode(), dl, VT, R, Splat2);
17005 if (TargetOpcode == X86ISD::MOVSD)
17006 CastVT = MVT::v2i64;
17007 SDValue BitCast1 = DAG.getNode(ISD::BITCAST, dl, CastVT, Shift1);
17008 SDValue BitCast2 = DAG.getNode(ISD::BITCAST, dl, CastVT, Shift2);
17009 SDValue Result = getTargetShuffleNode(TargetOpcode, dl, CastVT, BitCast2,
17011 return DAG.getNode(ISD::BITCAST, dl, VT, Result);
17015 if (VT == MVT::v16i8 && Op->getOpcode() == ISD::SHL) {
17016 assert(Subtarget->hasSSE2() && "Need SSE2 for pslli/pcmpeq.");
17019 Op = DAG.getNode(ISD::SHL, dl, VT, Amt, DAG.getConstant(5, VT));
17020 Op = DAG.getNode(ISD::BITCAST, dl, VT, Op);
17022 // Turn 'a' into a mask suitable for VSELECT
17023 SDValue VSelM = DAG.getConstant(0x80, VT);
17024 SDValue OpVSel = DAG.getNode(ISD::AND, dl, VT, VSelM, Op);
17025 OpVSel = DAG.getNode(X86ISD::PCMPEQ, dl, VT, OpVSel, VSelM);
17027 SDValue CM1 = DAG.getConstant(0x0f, VT);
17028 SDValue CM2 = DAG.getConstant(0x3f, VT);
17030 // r = VSELECT(r, psllw(r & (char16)15, 4), a);
17031 SDValue M = DAG.getNode(ISD::AND, dl, VT, R, CM1);
17032 M = getTargetVShiftByConstNode(X86ISD::VSHLI, dl, MVT::v8i16, M, 4, DAG);
17033 M = DAG.getNode(ISD::BITCAST, dl, VT, M);
17034 R = DAG.getNode(ISD::VSELECT, dl, VT, OpVSel, M, R);
17037 Op = DAG.getNode(ISD::ADD, dl, VT, Op, Op);
17038 OpVSel = DAG.getNode(ISD::AND, dl, VT, VSelM, Op);
17039 OpVSel = DAG.getNode(X86ISD::PCMPEQ, dl, VT, OpVSel, VSelM);
17041 // r = VSELECT(r, psllw(r & (char16)63, 2), a);
17042 M = DAG.getNode(ISD::AND, dl, VT, R, CM2);
17043 M = getTargetVShiftByConstNode(X86ISD::VSHLI, dl, MVT::v8i16, M, 2, DAG);
17044 M = DAG.getNode(ISD::BITCAST, dl, VT, M);
17045 R = DAG.getNode(ISD::VSELECT, dl, VT, OpVSel, M, R);
17048 Op = DAG.getNode(ISD::ADD, dl, VT, Op, Op);
17049 OpVSel = DAG.getNode(ISD::AND, dl, VT, VSelM, Op);
17050 OpVSel = DAG.getNode(X86ISD::PCMPEQ, dl, VT, OpVSel, VSelM);
17052 // return VSELECT(r, r+r, a);
17053 R = DAG.getNode(ISD::VSELECT, dl, VT, OpVSel,
17054 DAG.getNode(ISD::ADD, dl, VT, R, R), R);
17058 // It's worth extending once and using the v8i32 shifts for 16-bit types, but
17059 // the extra overheads to get from v16i8 to v8i32 make the existing SSE
17060 // solution better.
17061 if (Subtarget->hasInt256() && VT == MVT::v8i16) {
17062 MVT NewVT = VT == MVT::v8i16 ? MVT::v8i32 : MVT::v16i16;
17064 Op.getOpcode() == ISD::SRA ? ISD::SIGN_EXTEND : ISD::ZERO_EXTEND;
17065 R = DAG.getNode(ExtOpc, dl, NewVT, R);
17066 Amt = DAG.getNode(ISD::ANY_EXTEND, dl, NewVT, Amt);
17067 return DAG.getNode(ISD::TRUNCATE, dl, VT,
17068 DAG.getNode(Op.getOpcode(), dl, NewVT, R, Amt));
17071 // Decompose 256-bit shifts into smaller 128-bit shifts.
17072 if (VT.is256BitVector()) {
17073 unsigned NumElems = VT.getVectorNumElements();
17074 MVT EltVT = VT.getVectorElementType();
17075 EVT NewVT = MVT::getVectorVT(EltVT, NumElems/2);
17077 // Extract the two vectors
17078 SDValue V1 = Extract128BitVector(R, 0, DAG, dl);
17079 SDValue V2 = Extract128BitVector(R, NumElems/2, DAG, dl);
17081 // Recreate the shift amount vectors
17082 SDValue Amt1, Amt2;
17083 if (Amt.getOpcode() == ISD::BUILD_VECTOR) {
17084 // Constant shift amount
17085 SmallVector<SDValue, 4> Amt1Csts;
17086 SmallVector<SDValue, 4> Amt2Csts;
17087 for (unsigned i = 0; i != NumElems/2; ++i)
17088 Amt1Csts.push_back(Amt->getOperand(i));
17089 for (unsigned i = NumElems/2; i != NumElems; ++i)
17090 Amt2Csts.push_back(Amt->getOperand(i));
17092 Amt1 = DAG.getNode(ISD::BUILD_VECTOR, dl, NewVT, Amt1Csts);
17093 Amt2 = DAG.getNode(ISD::BUILD_VECTOR, dl, NewVT, Amt2Csts);
17095 // Variable shift amount
17096 Amt1 = Extract128BitVector(Amt, 0, DAG, dl);
17097 Amt2 = Extract128BitVector(Amt, NumElems/2, DAG, dl);
17100 // Issue new vector shifts for the smaller types
17101 V1 = DAG.getNode(Op.getOpcode(), dl, NewVT, V1, Amt1);
17102 V2 = DAG.getNode(Op.getOpcode(), dl, NewVT, V2, Amt2);
17104 // Concatenate the result back
17105 return DAG.getNode(ISD::CONCAT_VECTORS, dl, VT, V1, V2);
17111 static SDValue LowerXALUO(SDValue Op, SelectionDAG &DAG) {
17112 // Lower the "add/sub/mul with overflow" instruction into a regular ins plus
17113 // a "setcc" instruction that checks the overflow flag. The "brcond" lowering
17114 // looks for this combo and may remove the "setcc" instruction if the "setcc"
17115 // has only one use.
17116 SDNode *N = Op.getNode();
17117 SDValue LHS = N->getOperand(0);
17118 SDValue RHS = N->getOperand(1);
17119 unsigned BaseOp = 0;
17122 switch (Op.getOpcode()) {
17123 default: llvm_unreachable("Unknown ovf instruction!");
17125 // A subtract of one will be selected as a INC. Note that INC doesn't
17126 // set CF, so we can't do this for UADDO.
17127 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(RHS))
17129 BaseOp = X86ISD::INC;
17130 Cond = X86::COND_O;
17133 BaseOp = X86ISD::ADD;
17134 Cond = X86::COND_O;
17137 BaseOp = X86ISD::ADD;
17138 Cond = X86::COND_B;
17141 // A subtract of one will be selected as a DEC. Note that DEC doesn't
17142 // set CF, so we can't do this for USUBO.
17143 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(RHS))
17145 BaseOp = X86ISD::DEC;
17146 Cond = X86::COND_O;
17149 BaseOp = X86ISD::SUB;
17150 Cond = X86::COND_O;
17153 BaseOp = X86ISD::SUB;
17154 Cond = X86::COND_B;
17157 BaseOp = X86ISD::SMUL;
17158 Cond = X86::COND_O;
17160 case ISD::UMULO: { // i64, i8 = umulo lhs, rhs --> i64, i64, i32 umul lhs,rhs
17161 SDVTList VTs = DAG.getVTList(N->getValueType(0), N->getValueType(0),
17163 SDValue Sum = DAG.getNode(X86ISD::UMUL, DL, VTs, LHS, RHS);
17166 DAG.getNode(X86ISD::SETCC, DL, MVT::i8,
17167 DAG.getConstant(X86::COND_O, MVT::i32),
17168 SDValue(Sum.getNode(), 2));
17170 return DAG.getNode(ISD::MERGE_VALUES, DL, N->getVTList(), Sum, SetCC);
17174 // Also sets EFLAGS.
17175 SDVTList VTs = DAG.getVTList(N->getValueType(0), MVT::i32);
17176 SDValue Sum = DAG.getNode(BaseOp, DL, VTs, LHS, RHS);
17179 DAG.getNode(X86ISD::SETCC, DL, N->getValueType(1),
17180 DAG.getConstant(Cond, MVT::i32),
17181 SDValue(Sum.getNode(), 1));
17183 return DAG.getNode(ISD::MERGE_VALUES, DL, N->getVTList(), Sum, SetCC);
17186 // Sign extension of the low part of vector elements. This may be used either
17187 // when sign extend instructions are not available or if the vector element
17188 // sizes already match the sign-extended size. If the vector elements are in
17189 // their pre-extended size and sign extend instructions are available, that will
17190 // be handled by LowerSIGN_EXTEND.
17191 SDValue X86TargetLowering::LowerSIGN_EXTEND_INREG(SDValue Op,
17192 SelectionDAG &DAG) const {
17194 EVT ExtraVT = cast<VTSDNode>(Op.getOperand(1))->getVT();
17195 MVT VT = Op.getSimpleValueType();
17197 if (!Subtarget->hasSSE2() || !VT.isVector())
17200 unsigned BitsDiff = VT.getScalarType().getSizeInBits() -
17201 ExtraVT.getScalarType().getSizeInBits();
17203 switch (VT.SimpleTy) {
17204 default: return SDValue();
17207 if (!Subtarget->hasFp256())
17209 if (!Subtarget->hasInt256()) {
17210 // needs to be split
17211 unsigned NumElems = VT.getVectorNumElements();
17213 // Extract the LHS vectors
17214 SDValue LHS = Op.getOperand(0);
17215 SDValue LHS1 = Extract128BitVector(LHS, 0, DAG, dl);
17216 SDValue LHS2 = Extract128BitVector(LHS, NumElems/2, DAG, dl);
17218 MVT EltVT = VT.getVectorElementType();
17219 EVT NewVT = MVT::getVectorVT(EltVT, NumElems/2);
17221 EVT ExtraEltVT = ExtraVT.getVectorElementType();
17222 unsigned ExtraNumElems = ExtraVT.getVectorNumElements();
17223 ExtraVT = EVT::getVectorVT(*DAG.getContext(), ExtraEltVT,
17225 SDValue Extra = DAG.getValueType(ExtraVT);
17227 LHS1 = DAG.getNode(Op.getOpcode(), dl, NewVT, LHS1, Extra);
17228 LHS2 = DAG.getNode(Op.getOpcode(), dl, NewVT, LHS2, Extra);
17230 return DAG.getNode(ISD::CONCAT_VECTORS, dl, VT, LHS1, LHS2);
17235 SDValue Op0 = Op.getOperand(0);
17237 // This is a sign extension of some low part of vector elements without
17238 // changing the size of the vector elements themselves:
17239 // Shift-Left + Shift-Right-Algebraic.
17240 SDValue Shl = getTargetVShiftByConstNode(X86ISD::VSHLI, dl, VT, Op0,
17242 return getTargetVShiftByConstNode(X86ISD::VSRAI, dl, VT, Shl, BitsDiff,
17248 /// Returns true if the operand type is exactly twice the native width, and
17249 /// the corresponding cmpxchg8b or cmpxchg16b instruction is available.
17250 /// Used to know whether to use cmpxchg8/16b when expanding atomic operations
17251 /// (otherwise we leave them alone to become __sync_fetch_and_... calls).
17252 bool X86TargetLowering::needsCmpXchgNb(const Type *MemType) const {
17253 const X86Subtarget &Subtarget =
17254 getTargetMachine().getSubtarget<X86Subtarget>();
17255 unsigned OpWidth = MemType->getPrimitiveSizeInBits();
17258 return !Subtarget.is64Bit(); // FIXME this should be Subtarget.hasCmpxchg8b
17259 else if (OpWidth == 128)
17260 return Subtarget.hasCmpxchg16b();
17265 bool X86TargetLowering::shouldExpandAtomicStoreInIR(StoreInst *SI) const {
17266 return needsCmpXchgNb(SI->getValueOperand()->getType());
17269 bool X86TargetLowering::shouldExpandAtomicLoadInIR(LoadInst *SI) const {
17270 return false; // FIXME, currently these are expanded separately in this file.
17273 bool X86TargetLowering::shouldExpandAtomicRMWInIR(AtomicRMWInst *AI) const {
17274 const X86Subtarget &Subtarget =
17275 getTargetMachine().getSubtarget<X86Subtarget>();
17276 unsigned NativeWidth = Subtarget.is64Bit() ? 64 : 32;
17277 const Type *MemType = AI->getType();
17279 // If the operand is too big, we must see if cmpxchg8/16b is available
17280 // and default to library calls otherwise.
17281 if (MemType->getPrimitiveSizeInBits() > NativeWidth)
17282 return needsCmpXchgNb(MemType);
17284 AtomicRMWInst::BinOp Op = AI->getOperation();
17287 llvm_unreachable("Unknown atomic operation");
17288 case AtomicRMWInst::Xchg:
17289 case AtomicRMWInst::Add:
17290 case AtomicRMWInst::Sub:
17291 // It's better to use xadd, xsub or xchg for these in all cases.
17293 case AtomicRMWInst::Or:
17294 case AtomicRMWInst::And:
17295 case AtomicRMWInst::Xor:
17296 // If the atomicrmw's result isn't actually used, we can just add a "lock"
17297 // prefix to a normal instruction for these operations.
17298 return !AI->use_empty();
17299 case AtomicRMWInst::Nand:
17300 case AtomicRMWInst::Max:
17301 case AtomicRMWInst::Min:
17302 case AtomicRMWInst::UMax:
17303 case AtomicRMWInst::UMin:
17304 // These always require a non-trivial set of data operations on x86. We must
17305 // use a cmpxchg loop.
17310 static SDValue LowerATOMIC_FENCE(SDValue Op, const X86Subtarget *Subtarget,
17311 SelectionDAG &DAG) {
17313 AtomicOrdering FenceOrdering = static_cast<AtomicOrdering>(
17314 cast<ConstantSDNode>(Op.getOperand(1))->getZExtValue());
17315 SynchronizationScope FenceScope = static_cast<SynchronizationScope>(
17316 cast<ConstantSDNode>(Op.getOperand(2))->getZExtValue());
17318 // The only fence that needs an instruction is a sequentially-consistent
17319 // cross-thread fence.
17320 if (FenceOrdering == SequentiallyConsistent && FenceScope == CrossThread) {
17321 // Use mfence if we have SSE2 or we're on x86-64 (even if we asked for
17322 // no-sse2). There isn't any reason to disable it if the target processor
17324 if (Subtarget->hasSSE2() || Subtarget->is64Bit())
17325 return DAG.getNode(X86ISD::MFENCE, dl, MVT::Other, Op.getOperand(0));
17327 SDValue Chain = Op.getOperand(0);
17328 SDValue Zero = DAG.getConstant(0, MVT::i32);
17330 DAG.getRegister(X86::ESP, MVT::i32), // Base
17331 DAG.getTargetConstant(1, MVT::i8), // Scale
17332 DAG.getRegister(0, MVT::i32), // Index
17333 DAG.getTargetConstant(0, MVT::i32), // Disp
17334 DAG.getRegister(0, MVT::i32), // Segment.
17338 SDNode *Res = DAG.getMachineNode(X86::OR32mrLocked, dl, MVT::Other, Ops);
17339 return SDValue(Res, 0);
17342 // MEMBARRIER is a compiler barrier; it codegens to a no-op.
17343 return DAG.getNode(X86ISD::MEMBARRIER, dl, MVT::Other, Op.getOperand(0));
17346 static SDValue LowerCMP_SWAP(SDValue Op, const X86Subtarget *Subtarget,
17347 SelectionDAG &DAG) {
17348 MVT T = Op.getSimpleValueType();
17352 switch(T.SimpleTy) {
17353 default: llvm_unreachable("Invalid value type!");
17354 case MVT::i8: Reg = X86::AL; size = 1; break;
17355 case MVT::i16: Reg = X86::AX; size = 2; break;
17356 case MVT::i32: Reg = X86::EAX; size = 4; break;
17358 assert(Subtarget->is64Bit() && "Node not type legal!");
17359 Reg = X86::RAX; size = 8;
17362 SDValue cpIn = DAG.getCopyToReg(Op.getOperand(0), DL, Reg,
17363 Op.getOperand(2), SDValue());
17364 SDValue Ops[] = { cpIn.getValue(0),
17367 DAG.getTargetConstant(size, MVT::i8),
17368 cpIn.getValue(1) };
17369 SDVTList Tys = DAG.getVTList(MVT::Other, MVT::Glue);
17370 MachineMemOperand *MMO = cast<AtomicSDNode>(Op)->getMemOperand();
17371 SDValue Result = DAG.getMemIntrinsicNode(X86ISD::LCMPXCHG_DAG, DL, Tys,
17375 DAG.getCopyFromReg(Result.getValue(0), DL, Reg, T, Result.getValue(1));
17376 SDValue EFLAGS = DAG.getCopyFromReg(cpOut.getValue(1), DL, X86::EFLAGS,
17377 MVT::i32, cpOut.getValue(2));
17378 SDValue Success = DAG.getNode(X86ISD::SETCC, DL, Op->getValueType(1),
17379 DAG.getConstant(X86::COND_E, MVT::i8), EFLAGS);
17381 DAG.ReplaceAllUsesOfValueWith(Op.getValue(0), cpOut);
17382 DAG.ReplaceAllUsesOfValueWith(Op.getValue(1), Success);
17383 DAG.ReplaceAllUsesOfValueWith(Op.getValue(2), EFLAGS.getValue(1));
17387 static SDValue LowerBITCAST(SDValue Op, const X86Subtarget *Subtarget,
17388 SelectionDAG &DAG) {
17389 MVT SrcVT = Op.getOperand(0).getSimpleValueType();
17390 MVT DstVT = Op.getSimpleValueType();
17392 if (SrcVT == MVT::v2i32 || SrcVT == MVT::v4i16 || SrcVT == MVT::v8i8) {
17393 assert(Subtarget->hasSSE2() && "Requires at least SSE2!");
17394 if (DstVT != MVT::f64)
17395 // This conversion needs to be expanded.
17398 SDValue InVec = Op->getOperand(0);
17400 unsigned NumElts = SrcVT.getVectorNumElements();
17401 EVT SVT = SrcVT.getVectorElementType();
17403 // Widen the vector in input in the case of MVT::v2i32.
17404 // Example: from MVT::v2i32 to MVT::v4i32.
17405 SmallVector<SDValue, 16> Elts;
17406 for (unsigned i = 0, e = NumElts; i != e; ++i)
17407 Elts.push_back(DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, SVT, InVec,
17408 DAG.getIntPtrConstant(i)));
17410 // Explicitly mark the extra elements as Undef.
17411 SDValue Undef = DAG.getUNDEF(SVT);
17412 for (unsigned i = NumElts, e = NumElts * 2; i != e; ++i)
17413 Elts.push_back(Undef);
17415 EVT NewVT = EVT::getVectorVT(*DAG.getContext(), SVT, NumElts * 2);
17416 SDValue BV = DAG.getNode(ISD::BUILD_VECTOR, dl, NewVT, Elts);
17417 SDValue ToV2F64 = DAG.getNode(ISD::BITCAST, dl, MVT::v2f64, BV);
17418 return DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::f64, ToV2F64,
17419 DAG.getIntPtrConstant(0));
17422 assert(Subtarget->is64Bit() && !Subtarget->hasSSE2() &&
17423 Subtarget->hasMMX() && "Unexpected custom BITCAST");
17424 assert((DstVT == MVT::i64 ||
17425 (DstVT.isVector() && DstVT.getSizeInBits()==64)) &&
17426 "Unexpected custom BITCAST");
17427 // i64 <=> MMX conversions are Legal.
17428 if (SrcVT==MVT::i64 && DstVT.isVector())
17430 if (DstVT==MVT::i64 && SrcVT.isVector())
17432 // MMX <=> MMX conversions are Legal.
17433 if (SrcVT.isVector() && DstVT.isVector())
17435 // All other conversions need to be expanded.
17439 static SDValue LowerLOAD_SUB(SDValue Op, SelectionDAG &DAG) {
17440 SDNode *Node = Op.getNode();
17442 EVT T = Node->getValueType(0);
17443 SDValue negOp = DAG.getNode(ISD::SUB, dl, T,
17444 DAG.getConstant(0, T), Node->getOperand(2));
17445 return DAG.getAtomic(ISD::ATOMIC_LOAD_ADD, dl,
17446 cast<AtomicSDNode>(Node)->getMemoryVT(),
17447 Node->getOperand(0),
17448 Node->getOperand(1), negOp,
17449 cast<AtomicSDNode>(Node)->getMemOperand(),
17450 cast<AtomicSDNode>(Node)->getOrdering(),
17451 cast<AtomicSDNode>(Node)->getSynchScope());
17454 static SDValue LowerATOMIC_STORE(SDValue Op, SelectionDAG &DAG) {
17455 SDNode *Node = Op.getNode();
17457 EVT VT = cast<AtomicSDNode>(Node)->getMemoryVT();
17459 // Convert seq_cst store -> xchg
17460 // Convert wide store -> swap (-> cmpxchg8b/cmpxchg16b)
17461 // FIXME: On 32-bit, store -> fist or movq would be more efficient
17462 // (The only way to get a 16-byte store is cmpxchg16b)
17463 // FIXME: 16-byte ATOMIC_SWAP isn't actually hooked up at the moment.
17464 if (cast<AtomicSDNode>(Node)->getOrdering() == SequentiallyConsistent ||
17465 !DAG.getTargetLoweringInfo().isTypeLegal(VT)) {
17466 SDValue Swap = DAG.getAtomic(ISD::ATOMIC_SWAP, dl,
17467 cast<AtomicSDNode>(Node)->getMemoryVT(),
17468 Node->getOperand(0),
17469 Node->getOperand(1), Node->getOperand(2),
17470 cast<AtomicSDNode>(Node)->getMemOperand(),
17471 cast<AtomicSDNode>(Node)->getOrdering(),
17472 cast<AtomicSDNode>(Node)->getSynchScope());
17473 return Swap.getValue(1);
17475 // Other atomic stores have a simple pattern.
17479 static SDValue LowerADDC_ADDE_SUBC_SUBE(SDValue Op, SelectionDAG &DAG) {
17480 EVT VT = Op.getNode()->getSimpleValueType(0);
17482 // Let legalize expand this if it isn't a legal type yet.
17483 if (!DAG.getTargetLoweringInfo().isTypeLegal(VT))
17486 SDVTList VTs = DAG.getVTList(VT, MVT::i32);
17489 bool ExtraOp = false;
17490 switch (Op.getOpcode()) {
17491 default: llvm_unreachable("Invalid code");
17492 case ISD::ADDC: Opc = X86ISD::ADD; break;
17493 case ISD::ADDE: Opc = X86ISD::ADC; ExtraOp = true; break;
17494 case ISD::SUBC: Opc = X86ISD::SUB; break;
17495 case ISD::SUBE: Opc = X86ISD::SBB; ExtraOp = true; break;
17499 return DAG.getNode(Opc, SDLoc(Op), VTs, Op.getOperand(0),
17501 return DAG.getNode(Opc, SDLoc(Op), VTs, Op.getOperand(0),
17502 Op.getOperand(1), Op.getOperand(2));
17505 static SDValue LowerFSINCOS(SDValue Op, const X86Subtarget *Subtarget,
17506 SelectionDAG &DAG) {
17507 assert(Subtarget->isTargetDarwin() && Subtarget->is64Bit());
17509 // For MacOSX, we want to call an alternative entry point: __sincos_stret,
17510 // which returns the values as { float, float } (in XMM0) or
17511 // { double, double } (which is returned in XMM0, XMM1).
17513 SDValue Arg = Op.getOperand(0);
17514 EVT ArgVT = Arg.getValueType();
17515 Type *ArgTy = ArgVT.getTypeForEVT(*DAG.getContext());
17517 TargetLowering::ArgListTy Args;
17518 TargetLowering::ArgListEntry Entry;
17522 Entry.isSExt = false;
17523 Entry.isZExt = false;
17524 Args.push_back(Entry);
17526 bool isF64 = ArgVT == MVT::f64;
17527 // Only optimize x86_64 for now. i386 is a bit messy. For f32,
17528 // the small struct {f32, f32} is returned in (eax, edx). For f64,
17529 // the results are returned via SRet in memory.
17530 const char *LibcallName = isF64 ? "__sincos_stret" : "__sincosf_stret";
17531 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
17532 SDValue Callee = DAG.getExternalSymbol(LibcallName, TLI.getPointerTy());
17534 Type *RetTy = isF64
17535 ? (Type*)StructType::get(ArgTy, ArgTy, NULL)
17536 : (Type*)VectorType::get(ArgTy, 4);
17538 TargetLowering::CallLoweringInfo CLI(DAG);
17539 CLI.setDebugLoc(dl).setChain(DAG.getEntryNode())
17540 .setCallee(CallingConv::C, RetTy, Callee, std::move(Args), 0);
17542 std::pair<SDValue, SDValue> CallResult = TLI.LowerCallTo(CLI);
17545 // Returned in xmm0 and xmm1.
17546 return CallResult.first;
17548 // Returned in bits 0:31 and 32:64 xmm0.
17549 SDValue SinVal = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, ArgVT,
17550 CallResult.first, DAG.getIntPtrConstant(0));
17551 SDValue CosVal = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, ArgVT,
17552 CallResult.first, DAG.getIntPtrConstant(1));
17553 SDVTList Tys = DAG.getVTList(ArgVT, ArgVT);
17554 return DAG.getNode(ISD::MERGE_VALUES, dl, Tys, SinVal, CosVal);
17557 /// LowerOperation - Provide custom lowering hooks for some operations.
17559 SDValue X86TargetLowering::LowerOperation(SDValue Op, SelectionDAG &DAG) const {
17560 switch (Op.getOpcode()) {
17561 default: llvm_unreachable("Should not custom lower this!");
17562 case ISD::SIGN_EXTEND_INREG: return LowerSIGN_EXTEND_INREG(Op,DAG);
17563 case ISD::ATOMIC_FENCE: return LowerATOMIC_FENCE(Op, Subtarget, DAG);
17564 case ISD::ATOMIC_CMP_SWAP_WITH_SUCCESS:
17565 return LowerCMP_SWAP(Op, Subtarget, DAG);
17566 case ISD::ATOMIC_LOAD_SUB: return LowerLOAD_SUB(Op,DAG);
17567 case ISD::ATOMIC_STORE: return LowerATOMIC_STORE(Op,DAG);
17568 case ISD::BUILD_VECTOR: return LowerBUILD_VECTOR(Op, DAG);
17569 case ISD::CONCAT_VECTORS: return LowerCONCAT_VECTORS(Op, DAG);
17570 case ISD::VECTOR_SHUFFLE: return LowerVECTOR_SHUFFLE(Op, DAG);
17571 case ISD::VSELECT: return LowerVSELECT(Op, DAG);
17572 case ISD::EXTRACT_VECTOR_ELT: return LowerEXTRACT_VECTOR_ELT(Op, DAG);
17573 case ISD::INSERT_VECTOR_ELT: return LowerINSERT_VECTOR_ELT(Op, DAG);
17574 case ISD::EXTRACT_SUBVECTOR: return LowerEXTRACT_SUBVECTOR(Op,Subtarget,DAG);
17575 case ISD::INSERT_SUBVECTOR: return LowerINSERT_SUBVECTOR(Op, Subtarget,DAG);
17576 case ISD::SCALAR_TO_VECTOR: return LowerSCALAR_TO_VECTOR(Op, DAG);
17577 case ISD::ConstantPool: return LowerConstantPool(Op, DAG);
17578 case ISD::GlobalAddress: return LowerGlobalAddress(Op, DAG);
17579 case ISD::GlobalTLSAddress: return LowerGlobalTLSAddress(Op, DAG);
17580 case ISD::ExternalSymbol: return LowerExternalSymbol(Op, DAG);
17581 case ISD::BlockAddress: return LowerBlockAddress(Op, DAG);
17582 case ISD::SHL_PARTS:
17583 case ISD::SRA_PARTS:
17584 case ISD::SRL_PARTS: return LowerShiftParts(Op, DAG);
17585 case ISD::SINT_TO_FP: return LowerSINT_TO_FP(Op, DAG);
17586 case ISD::UINT_TO_FP: return LowerUINT_TO_FP(Op, DAG);
17587 case ISD::TRUNCATE: return LowerTRUNCATE(Op, DAG);
17588 case ISD::ZERO_EXTEND: return LowerZERO_EXTEND(Op, Subtarget, DAG);
17589 case ISD::SIGN_EXTEND: return LowerSIGN_EXTEND(Op, Subtarget, DAG);
17590 case ISD::ANY_EXTEND: return LowerANY_EXTEND(Op, Subtarget, DAG);
17591 case ISD::FP_TO_SINT: return LowerFP_TO_SINT(Op, DAG);
17592 case ISD::FP_TO_UINT: return LowerFP_TO_UINT(Op, DAG);
17593 case ISD::FP_EXTEND: return LowerFP_EXTEND(Op, DAG);
17594 case ISD::LOAD: return LowerExtendedLoad(Op, Subtarget, DAG);
17596 case ISD::FNEG: return LowerFABSorFNEG(Op, DAG);
17597 case ISD::FCOPYSIGN: return LowerFCOPYSIGN(Op, DAG);
17598 case ISD::FGETSIGN: return LowerFGETSIGN(Op, DAG);
17599 case ISD::SETCC: return LowerSETCC(Op, DAG);
17600 case ISD::SELECT: return LowerSELECT(Op, DAG);
17601 case ISD::BRCOND: return LowerBRCOND(Op, DAG);
17602 case ISD::JumpTable: return LowerJumpTable(Op, DAG);
17603 case ISD::VASTART: return LowerVASTART(Op, DAG);
17604 case ISD::VAARG: return LowerVAARG(Op, DAG);
17605 case ISD::VACOPY: return LowerVACOPY(Op, Subtarget, DAG);
17606 case ISD::INTRINSIC_WO_CHAIN: return LowerINTRINSIC_WO_CHAIN(Op, DAG);
17607 case ISD::INTRINSIC_VOID:
17608 case ISD::INTRINSIC_W_CHAIN: return LowerINTRINSIC_W_CHAIN(Op, Subtarget, DAG);
17609 case ISD::RETURNADDR: return LowerRETURNADDR(Op, DAG);
17610 case ISD::FRAMEADDR: return LowerFRAMEADDR(Op, DAG);
17611 case ISD::FRAME_TO_ARGS_OFFSET:
17612 return LowerFRAME_TO_ARGS_OFFSET(Op, DAG);
17613 case ISD::DYNAMIC_STACKALLOC: return LowerDYNAMIC_STACKALLOC(Op, DAG);
17614 case ISD::EH_RETURN: return LowerEH_RETURN(Op, DAG);
17615 case ISD::EH_SJLJ_SETJMP: return lowerEH_SJLJ_SETJMP(Op, DAG);
17616 case ISD::EH_SJLJ_LONGJMP: return lowerEH_SJLJ_LONGJMP(Op, DAG);
17617 case ISD::INIT_TRAMPOLINE: return LowerINIT_TRAMPOLINE(Op, DAG);
17618 case ISD::ADJUST_TRAMPOLINE: return LowerADJUST_TRAMPOLINE(Op, DAG);
17619 case ISD::FLT_ROUNDS_: return LowerFLT_ROUNDS_(Op, DAG);
17620 case ISD::CTLZ: return LowerCTLZ(Op, DAG);
17621 case ISD::CTLZ_ZERO_UNDEF: return LowerCTLZ_ZERO_UNDEF(Op, DAG);
17622 case ISD::CTTZ: return LowerCTTZ(Op, DAG);
17623 case ISD::MUL: return LowerMUL(Op, Subtarget, DAG);
17624 case ISD::UMUL_LOHI:
17625 case ISD::SMUL_LOHI: return LowerMUL_LOHI(Op, Subtarget, DAG);
17628 case ISD::SHL: return LowerShift(Op, Subtarget, DAG);
17634 case ISD::UMULO: return LowerXALUO(Op, DAG);
17635 case ISD::READCYCLECOUNTER: return LowerREADCYCLECOUNTER(Op, Subtarget,DAG);
17636 case ISD::BITCAST: return LowerBITCAST(Op, Subtarget, DAG);
17640 case ISD::SUBE: return LowerADDC_ADDE_SUBC_SUBE(Op, DAG);
17641 case ISD::ADD: return LowerADD(Op, DAG);
17642 case ISD::SUB: return LowerSUB(Op, DAG);
17643 case ISD::FSINCOS: return LowerFSINCOS(Op, Subtarget, DAG);
17647 static void ReplaceATOMIC_LOAD(SDNode *Node,
17648 SmallVectorImpl<SDValue> &Results,
17649 SelectionDAG &DAG) {
17651 EVT VT = cast<AtomicSDNode>(Node)->getMemoryVT();
17653 // Convert wide load -> cmpxchg8b/cmpxchg16b
17654 // FIXME: On 32-bit, load -> fild or movq would be more efficient
17655 // (The only way to get a 16-byte load is cmpxchg16b)
17656 // FIXME: 16-byte ATOMIC_CMP_SWAP isn't actually hooked up at the moment.
17657 SDValue Zero = DAG.getConstant(0, VT);
17658 SDVTList VTs = DAG.getVTList(VT, MVT::i1, MVT::Other);
17660 DAG.getAtomicCmpSwap(ISD::ATOMIC_CMP_SWAP_WITH_SUCCESS, dl, VT, VTs,
17661 Node->getOperand(0), Node->getOperand(1), Zero, Zero,
17662 cast<AtomicSDNode>(Node)->getMemOperand(),
17663 cast<AtomicSDNode>(Node)->getOrdering(),
17664 cast<AtomicSDNode>(Node)->getOrdering(),
17665 cast<AtomicSDNode>(Node)->getSynchScope());
17666 Results.push_back(Swap.getValue(0));
17667 Results.push_back(Swap.getValue(2));
17670 /// ReplaceNodeResults - Replace a node with an illegal result type
17671 /// with a new node built out of custom code.
17672 void X86TargetLowering::ReplaceNodeResults(SDNode *N,
17673 SmallVectorImpl<SDValue>&Results,
17674 SelectionDAG &DAG) const {
17676 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
17677 switch (N->getOpcode()) {
17679 llvm_unreachable("Do not know how to custom type legalize this operation!");
17680 case ISD::SIGN_EXTEND_INREG:
17685 // We don't want to expand or promote these.
17692 case ISD::UDIVREM: {
17693 SDValue V = LowerWin64_i128OP(SDValue(N,0), DAG);
17694 Results.push_back(V);
17697 case ISD::FP_TO_SINT:
17698 case ISD::FP_TO_UINT: {
17699 bool IsSigned = N->getOpcode() == ISD::FP_TO_SINT;
17701 if (!IsSigned && !isIntegerTypeFTOL(SDValue(N, 0).getValueType()))
17704 std::pair<SDValue,SDValue> Vals =
17705 FP_TO_INTHelper(SDValue(N, 0), DAG, IsSigned, /*IsReplace=*/ true);
17706 SDValue FIST = Vals.first, StackSlot = Vals.second;
17707 if (FIST.getNode()) {
17708 EVT VT = N->getValueType(0);
17709 // Return a load from the stack slot.
17710 if (StackSlot.getNode())
17711 Results.push_back(DAG.getLoad(VT, dl, FIST, StackSlot,
17712 MachinePointerInfo(),
17713 false, false, false, 0));
17715 Results.push_back(FIST);
17719 case ISD::UINT_TO_FP: {
17720 assert(Subtarget->hasSSE2() && "Requires at least SSE2!");
17721 if (N->getOperand(0).getValueType() != MVT::v2i32 ||
17722 N->getValueType(0) != MVT::v2f32)
17724 SDValue ZExtIn = DAG.getNode(ISD::ZERO_EXTEND, dl, MVT::v2i64,
17726 SDValue Bias = DAG.getConstantFP(BitsToDouble(0x4330000000000000ULL),
17728 SDValue VBias = DAG.getNode(ISD::BUILD_VECTOR, dl, MVT::v2f64, Bias, Bias);
17729 SDValue Or = DAG.getNode(ISD::OR, dl, MVT::v2i64, ZExtIn,
17730 DAG.getNode(ISD::BITCAST, dl, MVT::v2i64, VBias));
17731 Or = DAG.getNode(ISD::BITCAST, dl, MVT::v2f64, Or);
17732 SDValue Sub = DAG.getNode(ISD::FSUB, dl, MVT::v2f64, Or, VBias);
17733 Results.push_back(DAG.getNode(X86ISD::VFPROUND, dl, MVT::v4f32, Sub));
17736 case ISD::FP_ROUND: {
17737 if (!TLI.isTypeLegal(N->getOperand(0).getValueType()))
17739 SDValue V = DAG.getNode(X86ISD::VFPROUND, dl, MVT::v4f32, N->getOperand(0));
17740 Results.push_back(V);
17743 case ISD::INTRINSIC_W_CHAIN: {
17744 unsigned IntNo = cast<ConstantSDNode>(N->getOperand(1))->getZExtValue();
17746 default : llvm_unreachable("Do not know how to custom type "
17747 "legalize this intrinsic operation!");
17748 case Intrinsic::x86_rdtsc:
17749 return getReadTimeStampCounter(N, dl, X86ISD::RDTSC_DAG, DAG, Subtarget,
17751 case Intrinsic::x86_rdtscp:
17752 return getReadTimeStampCounter(N, dl, X86ISD::RDTSCP_DAG, DAG, Subtarget,
17754 case Intrinsic::x86_rdpmc:
17755 return getReadPerformanceCounter(N, dl, DAG, Subtarget, Results);
17758 case ISD::READCYCLECOUNTER: {
17759 return getReadTimeStampCounter(N, dl, X86ISD::RDTSC_DAG, DAG, Subtarget,
17762 case ISD::ATOMIC_CMP_SWAP_WITH_SUCCESS: {
17763 EVT T = N->getValueType(0);
17764 assert((T == MVT::i64 || T == MVT::i128) && "can only expand cmpxchg pair");
17765 bool Regs64bit = T == MVT::i128;
17766 EVT HalfT = Regs64bit ? MVT::i64 : MVT::i32;
17767 SDValue cpInL, cpInH;
17768 cpInL = DAG.getNode(ISD::EXTRACT_ELEMENT, dl, HalfT, N->getOperand(2),
17769 DAG.getConstant(0, HalfT));
17770 cpInH = DAG.getNode(ISD::EXTRACT_ELEMENT, dl, HalfT, N->getOperand(2),
17771 DAG.getConstant(1, HalfT));
17772 cpInL = DAG.getCopyToReg(N->getOperand(0), dl,
17773 Regs64bit ? X86::RAX : X86::EAX,
17775 cpInH = DAG.getCopyToReg(cpInL.getValue(0), dl,
17776 Regs64bit ? X86::RDX : X86::EDX,
17777 cpInH, cpInL.getValue(1));
17778 SDValue swapInL, swapInH;
17779 swapInL = DAG.getNode(ISD::EXTRACT_ELEMENT, dl, HalfT, N->getOperand(3),
17780 DAG.getConstant(0, HalfT));
17781 swapInH = DAG.getNode(ISD::EXTRACT_ELEMENT, dl, HalfT, N->getOperand(3),
17782 DAG.getConstant(1, HalfT));
17783 swapInL = DAG.getCopyToReg(cpInH.getValue(0), dl,
17784 Regs64bit ? X86::RBX : X86::EBX,
17785 swapInL, cpInH.getValue(1));
17786 swapInH = DAG.getCopyToReg(swapInL.getValue(0), dl,
17787 Regs64bit ? X86::RCX : X86::ECX,
17788 swapInH, swapInL.getValue(1));
17789 SDValue Ops[] = { swapInH.getValue(0),
17791 swapInH.getValue(1) };
17792 SDVTList Tys = DAG.getVTList(MVT::Other, MVT::Glue);
17793 MachineMemOperand *MMO = cast<AtomicSDNode>(N)->getMemOperand();
17794 unsigned Opcode = Regs64bit ? X86ISD::LCMPXCHG16_DAG :
17795 X86ISD::LCMPXCHG8_DAG;
17796 SDValue Result = DAG.getMemIntrinsicNode(Opcode, dl, Tys, Ops, T, MMO);
17797 SDValue cpOutL = DAG.getCopyFromReg(Result.getValue(0), dl,
17798 Regs64bit ? X86::RAX : X86::EAX,
17799 HalfT, Result.getValue(1));
17800 SDValue cpOutH = DAG.getCopyFromReg(cpOutL.getValue(1), dl,
17801 Regs64bit ? X86::RDX : X86::EDX,
17802 HalfT, cpOutL.getValue(2));
17803 SDValue OpsF[] = { cpOutL.getValue(0), cpOutH.getValue(0)};
17805 SDValue EFLAGS = DAG.getCopyFromReg(cpOutH.getValue(1), dl, X86::EFLAGS,
17806 MVT::i32, cpOutH.getValue(2));
17808 DAG.getNode(X86ISD::SETCC, dl, MVT::i8,
17809 DAG.getConstant(X86::COND_E, MVT::i8), EFLAGS);
17810 Success = DAG.getZExtOrTrunc(Success, dl, N->getValueType(1));
17812 Results.push_back(DAG.getNode(ISD::BUILD_PAIR, dl, T, OpsF));
17813 Results.push_back(Success);
17814 Results.push_back(EFLAGS.getValue(1));
17817 case ISD::ATOMIC_SWAP:
17818 case ISD::ATOMIC_LOAD_ADD:
17819 case ISD::ATOMIC_LOAD_SUB:
17820 case ISD::ATOMIC_LOAD_AND:
17821 case ISD::ATOMIC_LOAD_OR:
17822 case ISD::ATOMIC_LOAD_XOR:
17823 case ISD::ATOMIC_LOAD_NAND:
17824 case ISD::ATOMIC_LOAD_MIN:
17825 case ISD::ATOMIC_LOAD_MAX:
17826 case ISD::ATOMIC_LOAD_UMIN:
17827 case ISD::ATOMIC_LOAD_UMAX:
17828 // Delegate to generic TypeLegalization. Situations we can really handle
17829 // should have already been dealt with by AtomicExpandPass.cpp.
17831 case ISD::ATOMIC_LOAD: {
17832 ReplaceATOMIC_LOAD(N, Results, DAG);
17835 case ISD::BITCAST: {
17836 assert(Subtarget->hasSSE2() && "Requires at least SSE2!");
17837 EVT DstVT = N->getValueType(0);
17838 EVT SrcVT = N->getOperand(0)->getValueType(0);
17840 if (SrcVT != MVT::f64 ||
17841 (DstVT != MVT::v2i32 && DstVT != MVT::v4i16 && DstVT != MVT::v8i8))
17844 unsigned NumElts = DstVT.getVectorNumElements();
17845 EVT SVT = DstVT.getVectorElementType();
17846 EVT WiderVT = EVT::getVectorVT(*DAG.getContext(), SVT, NumElts * 2);
17847 SDValue Expanded = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl,
17848 MVT::v2f64, N->getOperand(0));
17849 SDValue ToVecInt = DAG.getNode(ISD::BITCAST, dl, WiderVT, Expanded);
17851 if (ExperimentalVectorWideningLegalization) {
17852 // If we are legalizing vectors by widening, we already have the desired
17853 // legal vector type, just return it.
17854 Results.push_back(ToVecInt);
17858 SmallVector<SDValue, 8> Elts;
17859 for (unsigned i = 0, e = NumElts; i != e; ++i)
17860 Elts.push_back(DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, SVT,
17861 ToVecInt, DAG.getIntPtrConstant(i)));
17863 Results.push_back(DAG.getNode(ISD::BUILD_VECTOR, dl, DstVT, Elts));
17868 const char *X86TargetLowering::getTargetNodeName(unsigned Opcode) const {
17870 default: return nullptr;
17871 case X86ISD::BSF: return "X86ISD::BSF";
17872 case X86ISD::BSR: return "X86ISD::BSR";
17873 case X86ISD::SHLD: return "X86ISD::SHLD";
17874 case X86ISD::SHRD: return "X86ISD::SHRD";
17875 case X86ISD::FAND: return "X86ISD::FAND";
17876 case X86ISD::FANDN: return "X86ISD::FANDN";
17877 case X86ISD::FOR: return "X86ISD::FOR";
17878 case X86ISD::FXOR: return "X86ISD::FXOR";
17879 case X86ISD::FSRL: return "X86ISD::FSRL";
17880 case X86ISD::FILD: return "X86ISD::FILD";
17881 case X86ISD::FILD_FLAG: return "X86ISD::FILD_FLAG";
17882 case X86ISD::FP_TO_INT16_IN_MEM: return "X86ISD::FP_TO_INT16_IN_MEM";
17883 case X86ISD::FP_TO_INT32_IN_MEM: return "X86ISD::FP_TO_INT32_IN_MEM";
17884 case X86ISD::FP_TO_INT64_IN_MEM: return "X86ISD::FP_TO_INT64_IN_MEM";
17885 case X86ISD::FLD: return "X86ISD::FLD";
17886 case X86ISD::FST: return "X86ISD::FST";
17887 case X86ISD::CALL: return "X86ISD::CALL";
17888 case X86ISD::RDTSC_DAG: return "X86ISD::RDTSC_DAG";
17889 case X86ISD::RDTSCP_DAG: return "X86ISD::RDTSCP_DAG";
17890 case X86ISD::RDPMC_DAG: return "X86ISD::RDPMC_DAG";
17891 case X86ISD::BT: return "X86ISD::BT";
17892 case X86ISD::CMP: return "X86ISD::CMP";
17893 case X86ISD::COMI: return "X86ISD::COMI";
17894 case X86ISD::UCOMI: return "X86ISD::UCOMI";
17895 case X86ISD::CMPM: return "X86ISD::CMPM";
17896 case X86ISD::CMPMU: return "X86ISD::CMPMU";
17897 case X86ISD::SETCC: return "X86ISD::SETCC";
17898 case X86ISD::SETCC_CARRY: return "X86ISD::SETCC_CARRY";
17899 case X86ISD::FSETCC: return "X86ISD::FSETCC";
17900 case X86ISD::CMOV: return "X86ISD::CMOV";
17901 case X86ISD::BRCOND: return "X86ISD::BRCOND";
17902 case X86ISD::RET_FLAG: return "X86ISD::RET_FLAG";
17903 case X86ISD::REP_STOS: return "X86ISD::REP_STOS";
17904 case X86ISD::REP_MOVS: return "X86ISD::REP_MOVS";
17905 case X86ISD::GlobalBaseReg: return "X86ISD::GlobalBaseReg";
17906 case X86ISD::Wrapper: return "X86ISD::Wrapper";
17907 case X86ISD::WrapperRIP: return "X86ISD::WrapperRIP";
17908 case X86ISD::PEXTRB: return "X86ISD::PEXTRB";
17909 case X86ISD::PEXTRW: return "X86ISD::PEXTRW";
17910 case X86ISD::INSERTPS: return "X86ISD::INSERTPS";
17911 case X86ISD::PINSRB: return "X86ISD::PINSRB";
17912 case X86ISD::PINSRW: return "X86ISD::PINSRW";
17913 case X86ISD::PSHUFB: return "X86ISD::PSHUFB";
17914 case X86ISD::ANDNP: return "X86ISD::ANDNP";
17915 case X86ISD::PSIGN: return "X86ISD::PSIGN";
17916 case X86ISD::BLENDV: return "X86ISD::BLENDV";
17917 case X86ISD::BLENDI: return "X86ISD::BLENDI";
17918 case X86ISD::SUBUS: return "X86ISD::SUBUS";
17919 case X86ISD::HADD: return "X86ISD::HADD";
17920 case X86ISD::HSUB: return "X86ISD::HSUB";
17921 case X86ISD::FHADD: return "X86ISD::FHADD";
17922 case X86ISD::FHSUB: return "X86ISD::FHSUB";
17923 case X86ISD::UMAX: return "X86ISD::UMAX";
17924 case X86ISD::UMIN: return "X86ISD::UMIN";
17925 case X86ISD::SMAX: return "X86ISD::SMAX";
17926 case X86ISD::SMIN: return "X86ISD::SMIN";
17927 case X86ISD::FMAX: return "X86ISD::FMAX";
17928 case X86ISD::FMIN: return "X86ISD::FMIN";
17929 case X86ISD::FMAXC: return "X86ISD::FMAXC";
17930 case X86ISD::FMINC: return "X86ISD::FMINC";
17931 case X86ISD::FRSQRT: return "X86ISD::FRSQRT";
17932 case X86ISD::FRCP: return "X86ISD::FRCP";
17933 case X86ISD::TLSADDR: return "X86ISD::TLSADDR";
17934 case X86ISD::TLSBASEADDR: return "X86ISD::TLSBASEADDR";
17935 case X86ISD::TLSCALL: return "X86ISD::TLSCALL";
17936 case X86ISD::EH_SJLJ_SETJMP: return "X86ISD::EH_SJLJ_SETJMP";
17937 case X86ISD::EH_SJLJ_LONGJMP: return "X86ISD::EH_SJLJ_LONGJMP";
17938 case X86ISD::EH_RETURN: return "X86ISD::EH_RETURN";
17939 case X86ISD::TC_RETURN: return "X86ISD::TC_RETURN";
17940 case X86ISD::FNSTCW16m: return "X86ISD::FNSTCW16m";
17941 case X86ISD::FNSTSW16r: return "X86ISD::FNSTSW16r";
17942 case X86ISD::LCMPXCHG_DAG: return "X86ISD::LCMPXCHG_DAG";
17943 case X86ISD::LCMPXCHG8_DAG: return "X86ISD::LCMPXCHG8_DAG";
17944 case X86ISD::LCMPXCHG16_DAG: return "X86ISD::LCMPXCHG16_DAG";
17945 case X86ISD::VZEXT_MOVL: return "X86ISD::VZEXT_MOVL";
17946 case X86ISD::VZEXT_LOAD: return "X86ISD::VZEXT_LOAD";
17947 case X86ISD::VZEXT: return "X86ISD::VZEXT";
17948 case X86ISD::VSEXT: return "X86ISD::VSEXT";
17949 case X86ISD::VTRUNC: return "X86ISD::VTRUNC";
17950 case X86ISD::VTRUNCM: return "X86ISD::VTRUNCM";
17951 case X86ISD::VINSERT: return "X86ISD::VINSERT";
17952 case X86ISD::VFPEXT: return "X86ISD::VFPEXT";
17953 case X86ISD::VFPROUND: return "X86ISD::VFPROUND";
17954 case X86ISD::VSHLDQ: return "X86ISD::VSHLDQ";
17955 case X86ISD::VSRLDQ: return "X86ISD::VSRLDQ";
17956 case X86ISD::VSHL: return "X86ISD::VSHL";
17957 case X86ISD::VSRL: return "X86ISD::VSRL";
17958 case X86ISD::VSRA: return "X86ISD::VSRA";
17959 case X86ISD::VSHLI: return "X86ISD::VSHLI";
17960 case X86ISD::VSRLI: return "X86ISD::VSRLI";
17961 case X86ISD::VSRAI: return "X86ISD::VSRAI";
17962 case X86ISD::CMPP: return "X86ISD::CMPP";
17963 case X86ISD::PCMPEQ: return "X86ISD::PCMPEQ";
17964 case X86ISD::PCMPGT: return "X86ISD::PCMPGT";
17965 case X86ISD::PCMPEQM: return "X86ISD::PCMPEQM";
17966 case X86ISD::PCMPGTM: return "X86ISD::PCMPGTM";
17967 case X86ISD::ADD: return "X86ISD::ADD";
17968 case X86ISD::SUB: return "X86ISD::SUB";
17969 case X86ISD::ADC: return "X86ISD::ADC";
17970 case X86ISD::SBB: return "X86ISD::SBB";
17971 case X86ISD::SMUL: return "X86ISD::SMUL";
17972 case X86ISD::UMUL: return "X86ISD::UMUL";
17973 case X86ISD::INC: return "X86ISD::INC";
17974 case X86ISD::DEC: return "X86ISD::DEC";
17975 case X86ISD::OR: return "X86ISD::OR";
17976 case X86ISD::XOR: return "X86ISD::XOR";
17977 case X86ISD::AND: return "X86ISD::AND";
17978 case X86ISD::BEXTR: return "X86ISD::BEXTR";
17979 case X86ISD::MUL_IMM: return "X86ISD::MUL_IMM";
17980 case X86ISD::PTEST: return "X86ISD::PTEST";
17981 case X86ISD::TESTP: return "X86ISD::TESTP";
17982 case X86ISD::TESTM: return "X86ISD::TESTM";
17983 case X86ISD::TESTNM: return "X86ISD::TESTNM";
17984 case X86ISD::KORTEST: return "X86ISD::KORTEST";
17985 case X86ISD::PACKSS: return "X86ISD::PACKSS";
17986 case X86ISD::PACKUS: return "X86ISD::PACKUS";
17987 case X86ISD::PALIGNR: return "X86ISD::PALIGNR";
17988 case X86ISD::VALIGN: return "X86ISD::VALIGN";
17989 case X86ISD::PSHUFD: return "X86ISD::PSHUFD";
17990 case X86ISD::PSHUFHW: return "X86ISD::PSHUFHW";
17991 case X86ISD::PSHUFLW: return "X86ISD::PSHUFLW";
17992 case X86ISD::SHUFP: return "X86ISD::SHUFP";
17993 case X86ISD::MOVLHPS: return "X86ISD::MOVLHPS";
17994 case X86ISD::MOVLHPD: return "X86ISD::MOVLHPD";
17995 case X86ISD::MOVHLPS: return "X86ISD::MOVHLPS";
17996 case X86ISD::MOVLPS: return "X86ISD::MOVLPS";
17997 case X86ISD::MOVLPD: return "X86ISD::MOVLPD";
17998 case X86ISD::MOVDDUP: return "X86ISD::MOVDDUP";
17999 case X86ISD::MOVSHDUP: return "X86ISD::MOVSHDUP";
18000 case X86ISD::MOVSLDUP: return "X86ISD::MOVSLDUP";
18001 case X86ISD::MOVSD: return "X86ISD::MOVSD";
18002 case X86ISD::MOVSS: return "X86ISD::MOVSS";
18003 case X86ISD::UNPCKL: return "X86ISD::UNPCKL";
18004 case X86ISD::UNPCKH: return "X86ISD::UNPCKH";
18005 case X86ISD::VBROADCAST: return "X86ISD::VBROADCAST";
18006 case X86ISD::VBROADCASTM: return "X86ISD::VBROADCASTM";
18007 case X86ISD::VEXTRACT: return "X86ISD::VEXTRACT";
18008 case X86ISD::VPERMILP: return "X86ISD::VPERMILP";
18009 case X86ISD::VPERM2X128: return "X86ISD::VPERM2X128";
18010 case X86ISD::VPERMV: return "X86ISD::VPERMV";
18011 case X86ISD::VPERMV3: return "X86ISD::VPERMV3";
18012 case X86ISD::VPERMIV3: return "X86ISD::VPERMIV3";
18013 case X86ISD::VPERMI: return "X86ISD::VPERMI";
18014 case X86ISD::PMULUDQ: return "X86ISD::PMULUDQ";
18015 case X86ISD::PMULDQ: return "X86ISD::PMULDQ";
18016 case X86ISD::VASTART_SAVE_XMM_REGS: return "X86ISD::VASTART_SAVE_XMM_REGS";
18017 case X86ISD::VAARG_64: return "X86ISD::VAARG_64";
18018 case X86ISD::WIN_ALLOCA: return "X86ISD::WIN_ALLOCA";
18019 case X86ISD::MEMBARRIER: return "X86ISD::MEMBARRIER";
18020 case X86ISD::SEG_ALLOCA: return "X86ISD::SEG_ALLOCA";
18021 case X86ISD::WIN_FTOL: return "X86ISD::WIN_FTOL";
18022 case X86ISD::SAHF: return "X86ISD::SAHF";
18023 case X86ISD::RDRAND: return "X86ISD::RDRAND";
18024 case X86ISD::RDSEED: return "X86ISD::RDSEED";
18025 case X86ISD::FMADD: return "X86ISD::FMADD";
18026 case X86ISD::FMSUB: return "X86ISD::FMSUB";
18027 case X86ISD::FNMADD: return "X86ISD::FNMADD";
18028 case X86ISD::FNMSUB: return "X86ISD::FNMSUB";
18029 case X86ISD::FMADDSUB: return "X86ISD::FMADDSUB";
18030 case X86ISD::FMSUBADD: return "X86ISD::FMSUBADD";
18031 case X86ISD::PCMPESTRI: return "X86ISD::PCMPESTRI";
18032 case X86ISD::PCMPISTRI: return "X86ISD::PCMPISTRI";
18033 case X86ISD::XTEST: return "X86ISD::XTEST";
18037 // isLegalAddressingMode - Return true if the addressing mode represented
18038 // by AM is legal for this target, for a load/store of the specified type.
18039 bool X86TargetLowering::isLegalAddressingMode(const AddrMode &AM,
18041 // X86 supports extremely general addressing modes.
18042 CodeModel::Model M = getTargetMachine().getCodeModel();
18043 Reloc::Model R = getTargetMachine().getRelocationModel();
18045 // X86 allows a sign-extended 32-bit immediate field as a displacement.
18046 if (!X86::isOffsetSuitableForCodeModel(AM.BaseOffs, M, AM.BaseGV != nullptr))
18051 Subtarget->ClassifyGlobalReference(AM.BaseGV, getTargetMachine());
18053 // If a reference to this global requires an extra load, we can't fold it.
18054 if (isGlobalStubReference(GVFlags))
18057 // If BaseGV requires a register for the PIC base, we cannot also have a
18058 // BaseReg specified.
18059 if (AM.HasBaseReg && isGlobalRelativeToPICBase(GVFlags))
18062 // If lower 4G is not available, then we must use rip-relative addressing.
18063 if ((M != CodeModel::Small || R != Reloc::Static) &&
18064 Subtarget->is64Bit() && (AM.BaseOffs || AM.Scale > 1))
18068 switch (AM.Scale) {
18074 // These scales always work.
18079 // These scales are formed with basereg+scalereg. Only accept if there is
18084 default: // Other stuff never works.
18091 bool X86TargetLowering::isVectorShiftByScalarCheap(Type *Ty) const {
18092 unsigned Bits = Ty->getScalarSizeInBits();
18094 // 8-bit shifts are always expensive, but versions with a scalar amount aren't
18095 // particularly cheaper than those without.
18099 // On AVX2 there are new vpsllv[dq] instructions (and other shifts), that make
18100 // variable shifts just as cheap as scalar ones.
18101 if (Subtarget->hasInt256() && (Bits == 32 || Bits == 64))
18104 // Otherwise, it's significantly cheaper to shift by a scalar amount than by a
18105 // fully general vector.
18109 bool X86TargetLowering::isTruncateFree(Type *Ty1, Type *Ty2) const {
18110 if (!Ty1->isIntegerTy() || !Ty2->isIntegerTy())
18112 unsigned NumBits1 = Ty1->getPrimitiveSizeInBits();
18113 unsigned NumBits2 = Ty2->getPrimitiveSizeInBits();
18114 return NumBits1 > NumBits2;
18117 bool X86TargetLowering::allowTruncateForTailCall(Type *Ty1, Type *Ty2) const {
18118 if (!Ty1->isIntegerTy() || !Ty2->isIntegerTy())
18121 if (!isTypeLegal(EVT::getEVT(Ty1)))
18124 assert(Ty1->getPrimitiveSizeInBits() <= 64 && "i128 is probably not a noop");
18126 // Assuming the caller doesn't have a zeroext or signext return parameter,
18127 // truncation all the way down to i1 is valid.
18131 bool X86TargetLowering::isLegalICmpImmediate(int64_t Imm) const {
18132 return isInt<32>(Imm);
18135 bool X86TargetLowering::isLegalAddImmediate(int64_t Imm) const {
18136 // Can also use sub to handle negated immediates.
18137 return isInt<32>(Imm);
18140 bool X86TargetLowering::isTruncateFree(EVT VT1, EVT VT2) const {
18141 if (!VT1.isInteger() || !VT2.isInteger())
18143 unsigned NumBits1 = VT1.getSizeInBits();
18144 unsigned NumBits2 = VT2.getSizeInBits();
18145 return NumBits1 > NumBits2;
18148 bool X86TargetLowering::isZExtFree(Type *Ty1, Type *Ty2) const {
18149 // x86-64 implicitly zero-extends 32-bit results in 64-bit registers.
18150 return Ty1->isIntegerTy(32) && Ty2->isIntegerTy(64) && Subtarget->is64Bit();
18153 bool X86TargetLowering::isZExtFree(EVT VT1, EVT VT2) const {
18154 // x86-64 implicitly zero-extends 32-bit results in 64-bit registers.
18155 return VT1 == MVT::i32 && VT2 == MVT::i64 && Subtarget->is64Bit();
18158 bool X86TargetLowering::isZExtFree(SDValue Val, EVT VT2) const {
18159 EVT VT1 = Val.getValueType();
18160 if (isZExtFree(VT1, VT2))
18163 if (Val.getOpcode() != ISD::LOAD)
18166 if (!VT1.isSimple() || !VT1.isInteger() ||
18167 !VT2.isSimple() || !VT2.isInteger())
18170 switch (VT1.getSimpleVT().SimpleTy) {
18175 // X86 has 8, 16, and 32-bit zero-extending loads.
18183 X86TargetLowering::isFMAFasterThanFMulAndFAdd(EVT VT) const {
18184 if (!(Subtarget->hasFMA() || Subtarget->hasFMA4()))
18187 VT = VT.getScalarType();
18189 if (!VT.isSimple())
18192 switch (VT.getSimpleVT().SimpleTy) {
18203 bool X86TargetLowering::isNarrowingProfitable(EVT VT1, EVT VT2) const {
18204 // i16 instructions are longer (0x66 prefix) and potentially slower.
18205 return !(VT1 == MVT::i32 && VT2 == MVT::i16);
18208 /// isShuffleMaskLegal - Targets can use this to indicate that they only
18209 /// support *some* VECTOR_SHUFFLE operations, those with specific masks.
18210 /// By default, if a target supports the VECTOR_SHUFFLE node, all mask values
18211 /// are assumed to be legal.
18213 X86TargetLowering::isShuffleMaskLegal(const SmallVectorImpl<int> &M,
18215 if (!VT.isSimple())
18218 MVT SVT = VT.getSimpleVT();
18220 // Very little shuffling can be done for 64-bit vectors right now.
18221 if (VT.getSizeInBits() == 64)
18224 // If this is a single-input shuffle with no 128 bit lane crossings we can
18225 // lower it into pshufb.
18226 if ((SVT.is128BitVector() && Subtarget->hasSSSE3()) ||
18227 (SVT.is256BitVector() && Subtarget->hasInt256())) {
18228 bool isLegal = true;
18229 for (unsigned I = 0, E = M.size(); I != E; ++I) {
18230 if (M[I] >= (int)SVT.getVectorNumElements() ||
18231 ShuffleCrosses128bitLane(SVT, I, M[I])) {
18240 // FIXME: blends, shifts.
18241 return (SVT.getVectorNumElements() == 2 ||
18242 ShuffleVectorSDNode::isSplatMask(&M[0], VT) ||
18243 isMOVLMask(M, SVT) ||
18244 isMOVHLPSMask(M, SVT) ||
18245 isSHUFPMask(M, SVT) ||
18246 isPSHUFDMask(M, SVT) ||
18247 isPSHUFHWMask(M, SVT, Subtarget->hasInt256()) ||
18248 isPSHUFLWMask(M, SVT, Subtarget->hasInt256()) ||
18249 isPALIGNRMask(M, SVT, Subtarget) ||
18250 isUNPCKLMask(M, SVT, Subtarget->hasInt256()) ||
18251 isUNPCKHMask(M, SVT, Subtarget->hasInt256()) ||
18252 isUNPCKL_v_undef_Mask(M, SVT, Subtarget->hasInt256()) ||
18253 isUNPCKH_v_undef_Mask(M, SVT, Subtarget->hasInt256()) ||
18254 isBlendMask(M, SVT, Subtarget->hasSSE41(), Subtarget->hasInt256()));
18258 X86TargetLowering::isVectorClearMaskLegal(const SmallVectorImpl<int> &Mask,
18260 if (!VT.isSimple())
18263 MVT SVT = VT.getSimpleVT();
18264 unsigned NumElts = SVT.getVectorNumElements();
18265 // FIXME: This collection of masks seems suspect.
18268 if (NumElts == 4 && SVT.is128BitVector()) {
18269 return (isMOVLMask(Mask, SVT) ||
18270 isCommutedMOVLMask(Mask, SVT, true) ||
18271 isSHUFPMask(Mask, SVT) ||
18272 isSHUFPMask(Mask, SVT, /* Commuted */ true));
18277 //===----------------------------------------------------------------------===//
18278 // X86 Scheduler Hooks
18279 //===----------------------------------------------------------------------===//
18281 /// Utility function to emit xbegin specifying the start of an RTM region.
18282 static MachineBasicBlock *EmitXBegin(MachineInstr *MI, MachineBasicBlock *MBB,
18283 const TargetInstrInfo *TII) {
18284 DebugLoc DL = MI->getDebugLoc();
18286 const BasicBlock *BB = MBB->getBasicBlock();
18287 MachineFunction::iterator I = MBB;
18290 // For the v = xbegin(), we generate
18301 MachineBasicBlock *thisMBB = MBB;
18302 MachineFunction *MF = MBB->getParent();
18303 MachineBasicBlock *mainMBB = MF->CreateMachineBasicBlock(BB);
18304 MachineBasicBlock *sinkMBB = MF->CreateMachineBasicBlock(BB);
18305 MF->insert(I, mainMBB);
18306 MF->insert(I, sinkMBB);
18308 // Transfer the remainder of BB and its successor edges to sinkMBB.
18309 sinkMBB->splice(sinkMBB->begin(), MBB,
18310 std::next(MachineBasicBlock::iterator(MI)), MBB->end());
18311 sinkMBB->transferSuccessorsAndUpdatePHIs(MBB);
18315 // # fallthrough to mainMBB
18316 // # abortion to sinkMBB
18317 BuildMI(thisMBB, DL, TII->get(X86::XBEGIN_4)).addMBB(sinkMBB);
18318 thisMBB->addSuccessor(mainMBB);
18319 thisMBB->addSuccessor(sinkMBB);
18323 BuildMI(mainMBB, DL, TII->get(X86::MOV32ri), X86::EAX).addImm(-1);
18324 mainMBB->addSuccessor(sinkMBB);
18327 // EAX is live into the sinkMBB
18328 sinkMBB->addLiveIn(X86::EAX);
18329 BuildMI(*sinkMBB, sinkMBB->begin(), DL,
18330 TII->get(TargetOpcode::COPY), MI->getOperand(0).getReg())
18333 MI->eraseFromParent();
18337 // FIXME: When we get size specific XMM0 registers, i.e. XMM0_V16I8
18338 // or XMM0_V32I8 in AVX all of this code can be replaced with that
18339 // in the .td file.
18340 static MachineBasicBlock *EmitPCMPSTRM(MachineInstr *MI, MachineBasicBlock *BB,
18341 const TargetInstrInfo *TII) {
18343 switch (MI->getOpcode()) {
18344 default: llvm_unreachable("illegal opcode!");
18345 case X86::PCMPISTRM128REG: Opc = X86::PCMPISTRM128rr; break;
18346 case X86::VPCMPISTRM128REG: Opc = X86::VPCMPISTRM128rr; break;
18347 case X86::PCMPISTRM128MEM: Opc = X86::PCMPISTRM128rm; break;
18348 case X86::VPCMPISTRM128MEM: Opc = X86::VPCMPISTRM128rm; break;
18349 case X86::PCMPESTRM128REG: Opc = X86::PCMPESTRM128rr; break;
18350 case X86::VPCMPESTRM128REG: Opc = X86::VPCMPESTRM128rr; break;
18351 case X86::PCMPESTRM128MEM: Opc = X86::PCMPESTRM128rm; break;
18352 case X86::VPCMPESTRM128MEM: Opc = X86::VPCMPESTRM128rm; break;
18355 DebugLoc dl = MI->getDebugLoc();
18356 MachineInstrBuilder MIB = BuildMI(*BB, MI, dl, TII->get(Opc));
18358 unsigned NumArgs = MI->getNumOperands();
18359 for (unsigned i = 1; i < NumArgs; ++i) {
18360 MachineOperand &Op = MI->getOperand(i);
18361 if (!(Op.isReg() && Op.isImplicit()))
18362 MIB.addOperand(Op);
18364 if (MI->hasOneMemOperand())
18365 MIB->setMemRefs(MI->memoperands_begin(), MI->memoperands_end());
18367 BuildMI(*BB, MI, dl,
18368 TII->get(TargetOpcode::COPY), MI->getOperand(0).getReg())
18369 .addReg(X86::XMM0);
18371 MI->eraseFromParent();
18375 // FIXME: Custom handling because TableGen doesn't support multiple implicit
18376 // defs in an instruction pattern
18377 static MachineBasicBlock *EmitPCMPSTRI(MachineInstr *MI, MachineBasicBlock *BB,
18378 const TargetInstrInfo *TII) {
18380 switch (MI->getOpcode()) {
18381 default: llvm_unreachable("illegal opcode!");
18382 case X86::PCMPISTRIREG: Opc = X86::PCMPISTRIrr; break;
18383 case X86::VPCMPISTRIREG: Opc = X86::VPCMPISTRIrr; break;
18384 case X86::PCMPISTRIMEM: Opc = X86::PCMPISTRIrm; break;
18385 case X86::VPCMPISTRIMEM: Opc = X86::VPCMPISTRIrm; break;
18386 case X86::PCMPESTRIREG: Opc = X86::PCMPESTRIrr; break;
18387 case X86::VPCMPESTRIREG: Opc = X86::VPCMPESTRIrr; break;
18388 case X86::PCMPESTRIMEM: Opc = X86::PCMPESTRIrm; break;
18389 case X86::VPCMPESTRIMEM: Opc = X86::VPCMPESTRIrm; break;
18392 DebugLoc dl = MI->getDebugLoc();
18393 MachineInstrBuilder MIB = BuildMI(*BB, MI, dl, TII->get(Opc));
18395 unsigned NumArgs = MI->getNumOperands(); // remove the results
18396 for (unsigned i = 1; i < NumArgs; ++i) {
18397 MachineOperand &Op = MI->getOperand(i);
18398 if (!(Op.isReg() && Op.isImplicit()))
18399 MIB.addOperand(Op);
18401 if (MI->hasOneMemOperand())
18402 MIB->setMemRefs(MI->memoperands_begin(), MI->memoperands_end());
18404 BuildMI(*BB, MI, dl,
18405 TII->get(TargetOpcode::COPY), MI->getOperand(0).getReg())
18408 MI->eraseFromParent();
18412 static MachineBasicBlock * EmitMonitor(MachineInstr *MI, MachineBasicBlock *BB,
18413 const TargetInstrInfo *TII,
18414 const X86Subtarget* Subtarget) {
18415 DebugLoc dl = MI->getDebugLoc();
18417 // Address into RAX/EAX, other two args into ECX, EDX.
18418 unsigned MemOpc = Subtarget->is64Bit() ? X86::LEA64r : X86::LEA32r;
18419 unsigned MemReg = Subtarget->is64Bit() ? X86::RAX : X86::EAX;
18420 MachineInstrBuilder MIB = BuildMI(*BB, MI, dl, TII->get(MemOpc), MemReg);
18421 for (int i = 0; i < X86::AddrNumOperands; ++i)
18422 MIB.addOperand(MI->getOperand(i));
18424 unsigned ValOps = X86::AddrNumOperands;
18425 BuildMI(*BB, MI, dl, TII->get(TargetOpcode::COPY), X86::ECX)
18426 .addReg(MI->getOperand(ValOps).getReg());
18427 BuildMI(*BB, MI, dl, TII->get(TargetOpcode::COPY), X86::EDX)
18428 .addReg(MI->getOperand(ValOps+1).getReg());
18430 // The instruction doesn't actually take any operands though.
18431 BuildMI(*BB, MI, dl, TII->get(X86::MONITORrrr));
18433 MI->eraseFromParent(); // The pseudo is gone now.
18437 MachineBasicBlock *
18438 X86TargetLowering::EmitVAARG64WithCustomInserter(
18440 MachineBasicBlock *MBB) const {
18441 // Emit va_arg instruction on X86-64.
18443 // Operands to this pseudo-instruction:
18444 // 0 ) Output : destination address (reg)
18445 // 1-5) Input : va_list address (addr, i64mem)
18446 // 6 ) ArgSize : Size (in bytes) of vararg type
18447 // 7 ) ArgMode : 0=overflow only, 1=use gp_offset, 2=use fp_offset
18448 // 8 ) Align : Alignment of type
18449 // 9 ) EFLAGS (implicit-def)
18451 assert(MI->getNumOperands() == 10 && "VAARG_64 should have 10 operands!");
18452 assert(X86::AddrNumOperands == 5 && "VAARG_64 assumes 5 address operands");
18454 unsigned DestReg = MI->getOperand(0).getReg();
18455 MachineOperand &Base = MI->getOperand(1);
18456 MachineOperand &Scale = MI->getOperand(2);
18457 MachineOperand &Index = MI->getOperand(3);
18458 MachineOperand &Disp = MI->getOperand(4);
18459 MachineOperand &Segment = MI->getOperand(5);
18460 unsigned ArgSize = MI->getOperand(6).getImm();
18461 unsigned ArgMode = MI->getOperand(7).getImm();
18462 unsigned Align = MI->getOperand(8).getImm();
18464 // Memory Reference
18465 assert(MI->hasOneMemOperand() && "Expected VAARG_64 to have one memoperand");
18466 MachineInstr::mmo_iterator MMOBegin = MI->memoperands_begin();
18467 MachineInstr::mmo_iterator MMOEnd = MI->memoperands_end();
18469 // Machine Information
18470 const TargetInstrInfo *TII = MBB->getParent()->getSubtarget().getInstrInfo();
18471 MachineRegisterInfo &MRI = MBB->getParent()->getRegInfo();
18472 const TargetRegisterClass *AddrRegClass = getRegClassFor(MVT::i64);
18473 const TargetRegisterClass *OffsetRegClass = getRegClassFor(MVT::i32);
18474 DebugLoc DL = MI->getDebugLoc();
18476 // struct va_list {
18479 // i64 overflow_area (address)
18480 // i64 reg_save_area (address)
18482 // sizeof(va_list) = 24
18483 // alignment(va_list) = 8
18485 unsigned TotalNumIntRegs = 6;
18486 unsigned TotalNumXMMRegs = 8;
18487 bool UseGPOffset = (ArgMode == 1);
18488 bool UseFPOffset = (ArgMode == 2);
18489 unsigned MaxOffset = TotalNumIntRegs * 8 +
18490 (UseFPOffset ? TotalNumXMMRegs * 16 : 0);
18492 /* Align ArgSize to a multiple of 8 */
18493 unsigned ArgSizeA8 = (ArgSize + 7) & ~7;
18494 bool NeedsAlign = (Align > 8);
18496 MachineBasicBlock *thisMBB = MBB;
18497 MachineBasicBlock *overflowMBB;
18498 MachineBasicBlock *offsetMBB;
18499 MachineBasicBlock *endMBB;
18501 unsigned OffsetDestReg = 0; // Argument address computed by offsetMBB
18502 unsigned OverflowDestReg = 0; // Argument address computed by overflowMBB
18503 unsigned OffsetReg = 0;
18505 if (!UseGPOffset && !UseFPOffset) {
18506 // If we only pull from the overflow region, we don't create a branch.
18507 // We don't need to alter control flow.
18508 OffsetDestReg = 0; // unused
18509 OverflowDestReg = DestReg;
18511 offsetMBB = nullptr;
18512 overflowMBB = thisMBB;
18515 // First emit code to check if gp_offset (or fp_offset) is below the bound.
18516 // If so, pull the argument from reg_save_area. (branch to offsetMBB)
18517 // If not, pull from overflow_area. (branch to overflowMBB)
18522 // offsetMBB overflowMBB
18527 // Registers for the PHI in endMBB
18528 OffsetDestReg = MRI.createVirtualRegister(AddrRegClass);
18529 OverflowDestReg = MRI.createVirtualRegister(AddrRegClass);
18531 const BasicBlock *LLVM_BB = MBB->getBasicBlock();
18532 MachineFunction *MF = MBB->getParent();
18533 overflowMBB = MF->CreateMachineBasicBlock(LLVM_BB);
18534 offsetMBB = MF->CreateMachineBasicBlock(LLVM_BB);
18535 endMBB = MF->CreateMachineBasicBlock(LLVM_BB);
18537 MachineFunction::iterator MBBIter = MBB;
18540 // Insert the new basic blocks
18541 MF->insert(MBBIter, offsetMBB);
18542 MF->insert(MBBIter, overflowMBB);
18543 MF->insert(MBBIter, endMBB);
18545 // Transfer the remainder of MBB and its successor edges to endMBB.
18546 endMBB->splice(endMBB->begin(), thisMBB,
18547 std::next(MachineBasicBlock::iterator(MI)), thisMBB->end());
18548 endMBB->transferSuccessorsAndUpdatePHIs(thisMBB);
18550 // Make offsetMBB and overflowMBB successors of thisMBB
18551 thisMBB->addSuccessor(offsetMBB);
18552 thisMBB->addSuccessor(overflowMBB);
18554 // endMBB is a successor of both offsetMBB and overflowMBB
18555 offsetMBB->addSuccessor(endMBB);
18556 overflowMBB->addSuccessor(endMBB);
18558 // Load the offset value into a register
18559 OffsetReg = MRI.createVirtualRegister(OffsetRegClass);
18560 BuildMI(thisMBB, DL, TII->get(X86::MOV32rm), OffsetReg)
18564 .addDisp(Disp, UseFPOffset ? 4 : 0)
18565 .addOperand(Segment)
18566 .setMemRefs(MMOBegin, MMOEnd);
18568 // Check if there is enough room left to pull this argument.
18569 BuildMI(thisMBB, DL, TII->get(X86::CMP32ri))
18571 .addImm(MaxOffset + 8 - ArgSizeA8);
18573 // Branch to "overflowMBB" if offset >= max
18574 // Fall through to "offsetMBB" otherwise
18575 BuildMI(thisMBB, DL, TII->get(X86::GetCondBranchFromCond(X86::COND_AE)))
18576 .addMBB(overflowMBB);
18579 // In offsetMBB, emit code to use the reg_save_area.
18581 assert(OffsetReg != 0);
18583 // Read the reg_save_area address.
18584 unsigned RegSaveReg = MRI.createVirtualRegister(AddrRegClass);
18585 BuildMI(offsetMBB, DL, TII->get(X86::MOV64rm), RegSaveReg)
18590 .addOperand(Segment)
18591 .setMemRefs(MMOBegin, MMOEnd);
18593 // Zero-extend the offset
18594 unsigned OffsetReg64 = MRI.createVirtualRegister(AddrRegClass);
18595 BuildMI(offsetMBB, DL, TII->get(X86::SUBREG_TO_REG), OffsetReg64)
18598 .addImm(X86::sub_32bit);
18600 // Add the offset to the reg_save_area to get the final address.
18601 BuildMI(offsetMBB, DL, TII->get(X86::ADD64rr), OffsetDestReg)
18602 .addReg(OffsetReg64)
18603 .addReg(RegSaveReg);
18605 // Compute the offset for the next argument
18606 unsigned NextOffsetReg = MRI.createVirtualRegister(OffsetRegClass);
18607 BuildMI(offsetMBB, DL, TII->get(X86::ADD32ri), NextOffsetReg)
18609 .addImm(UseFPOffset ? 16 : 8);
18611 // Store it back into the va_list.
18612 BuildMI(offsetMBB, DL, TII->get(X86::MOV32mr))
18616 .addDisp(Disp, UseFPOffset ? 4 : 0)
18617 .addOperand(Segment)
18618 .addReg(NextOffsetReg)
18619 .setMemRefs(MMOBegin, MMOEnd);
18622 BuildMI(offsetMBB, DL, TII->get(X86::JMP_4))
18627 // Emit code to use overflow area
18630 // Load the overflow_area address into a register.
18631 unsigned OverflowAddrReg = MRI.createVirtualRegister(AddrRegClass);
18632 BuildMI(overflowMBB, DL, TII->get(X86::MOV64rm), OverflowAddrReg)
18637 .addOperand(Segment)
18638 .setMemRefs(MMOBegin, MMOEnd);
18640 // If we need to align it, do so. Otherwise, just copy the address
18641 // to OverflowDestReg.
18643 // Align the overflow address
18644 assert((Align & (Align-1)) == 0 && "Alignment must be a power of 2");
18645 unsigned TmpReg = MRI.createVirtualRegister(AddrRegClass);
18647 // aligned_addr = (addr + (align-1)) & ~(align-1)
18648 BuildMI(overflowMBB, DL, TII->get(X86::ADD64ri32), TmpReg)
18649 .addReg(OverflowAddrReg)
18652 BuildMI(overflowMBB, DL, TII->get(X86::AND64ri32), OverflowDestReg)
18654 .addImm(~(uint64_t)(Align-1));
18656 BuildMI(overflowMBB, DL, TII->get(TargetOpcode::COPY), OverflowDestReg)
18657 .addReg(OverflowAddrReg);
18660 // Compute the next overflow address after this argument.
18661 // (the overflow address should be kept 8-byte aligned)
18662 unsigned NextAddrReg = MRI.createVirtualRegister(AddrRegClass);
18663 BuildMI(overflowMBB, DL, TII->get(X86::ADD64ri32), NextAddrReg)
18664 .addReg(OverflowDestReg)
18665 .addImm(ArgSizeA8);
18667 // Store the new overflow address.
18668 BuildMI(overflowMBB, DL, TII->get(X86::MOV64mr))
18673 .addOperand(Segment)
18674 .addReg(NextAddrReg)
18675 .setMemRefs(MMOBegin, MMOEnd);
18677 // If we branched, emit the PHI to the front of endMBB.
18679 BuildMI(*endMBB, endMBB->begin(), DL,
18680 TII->get(X86::PHI), DestReg)
18681 .addReg(OffsetDestReg).addMBB(offsetMBB)
18682 .addReg(OverflowDestReg).addMBB(overflowMBB);
18685 // Erase the pseudo instruction
18686 MI->eraseFromParent();
18691 MachineBasicBlock *
18692 X86TargetLowering::EmitVAStartSaveXMMRegsWithCustomInserter(
18694 MachineBasicBlock *MBB) const {
18695 // Emit code to save XMM registers to the stack. The ABI says that the
18696 // number of registers to save is given in %al, so it's theoretically
18697 // possible to do an indirect jump trick to avoid saving all of them,
18698 // however this code takes a simpler approach and just executes all
18699 // of the stores if %al is non-zero. It's less code, and it's probably
18700 // easier on the hardware branch predictor, and stores aren't all that
18701 // expensive anyway.
18703 // Create the new basic blocks. One block contains all the XMM stores,
18704 // and one block is the final destination regardless of whether any
18705 // stores were performed.
18706 const BasicBlock *LLVM_BB = MBB->getBasicBlock();
18707 MachineFunction *F = MBB->getParent();
18708 MachineFunction::iterator MBBIter = MBB;
18710 MachineBasicBlock *XMMSaveMBB = F->CreateMachineBasicBlock(LLVM_BB);
18711 MachineBasicBlock *EndMBB = F->CreateMachineBasicBlock(LLVM_BB);
18712 F->insert(MBBIter, XMMSaveMBB);
18713 F->insert(MBBIter, EndMBB);
18715 // Transfer the remainder of MBB and its successor edges to EndMBB.
18716 EndMBB->splice(EndMBB->begin(), MBB,
18717 std::next(MachineBasicBlock::iterator(MI)), MBB->end());
18718 EndMBB->transferSuccessorsAndUpdatePHIs(MBB);
18720 // The original block will now fall through to the XMM save block.
18721 MBB->addSuccessor(XMMSaveMBB);
18722 // The XMMSaveMBB will fall through to the end block.
18723 XMMSaveMBB->addSuccessor(EndMBB);
18725 // Now add the instructions.
18726 const TargetInstrInfo *TII = MBB->getParent()->getSubtarget().getInstrInfo();
18727 DebugLoc DL = MI->getDebugLoc();
18729 unsigned CountReg = MI->getOperand(0).getReg();
18730 int64_t RegSaveFrameIndex = MI->getOperand(1).getImm();
18731 int64_t VarArgsFPOffset = MI->getOperand(2).getImm();
18733 if (!Subtarget->isTargetWin64()) {
18734 // If %al is 0, branch around the XMM save block.
18735 BuildMI(MBB, DL, TII->get(X86::TEST8rr)).addReg(CountReg).addReg(CountReg);
18736 BuildMI(MBB, DL, TII->get(X86::JE_4)).addMBB(EndMBB);
18737 MBB->addSuccessor(EndMBB);
18740 // Make sure the last operand is EFLAGS, which gets clobbered by the branch
18741 // that was just emitted, but clearly shouldn't be "saved".
18742 assert((MI->getNumOperands() <= 3 ||
18743 !MI->getOperand(MI->getNumOperands() - 1).isReg() ||
18744 MI->getOperand(MI->getNumOperands() - 1).getReg() == X86::EFLAGS)
18745 && "Expected last argument to be EFLAGS");
18746 unsigned MOVOpc = Subtarget->hasFp256() ? X86::VMOVAPSmr : X86::MOVAPSmr;
18747 // In the XMM save block, save all the XMM argument registers.
18748 for (int i = 3, e = MI->getNumOperands() - 1; i != e; ++i) {
18749 int64_t Offset = (i - 3) * 16 + VarArgsFPOffset;
18750 MachineMemOperand *MMO =
18751 F->getMachineMemOperand(
18752 MachinePointerInfo::getFixedStack(RegSaveFrameIndex, Offset),
18753 MachineMemOperand::MOStore,
18754 /*Size=*/16, /*Align=*/16);
18755 BuildMI(XMMSaveMBB, DL, TII->get(MOVOpc))
18756 .addFrameIndex(RegSaveFrameIndex)
18757 .addImm(/*Scale=*/1)
18758 .addReg(/*IndexReg=*/0)
18759 .addImm(/*Disp=*/Offset)
18760 .addReg(/*Segment=*/0)
18761 .addReg(MI->getOperand(i).getReg())
18762 .addMemOperand(MMO);
18765 MI->eraseFromParent(); // The pseudo instruction is gone now.
18770 // The EFLAGS operand of SelectItr might be missing a kill marker
18771 // because there were multiple uses of EFLAGS, and ISel didn't know
18772 // which to mark. Figure out whether SelectItr should have had a
18773 // kill marker, and set it if it should. Returns the correct kill
18775 static bool checkAndUpdateEFLAGSKill(MachineBasicBlock::iterator SelectItr,
18776 MachineBasicBlock* BB,
18777 const TargetRegisterInfo* TRI) {
18778 // Scan forward through BB for a use/def of EFLAGS.
18779 MachineBasicBlock::iterator miI(std::next(SelectItr));
18780 for (MachineBasicBlock::iterator miE = BB->end(); miI != miE; ++miI) {
18781 const MachineInstr& mi = *miI;
18782 if (mi.readsRegister(X86::EFLAGS))
18784 if (mi.definesRegister(X86::EFLAGS))
18785 break; // Should have kill-flag - update below.
18788 // If we hit the end of the block, check whether EFLAGS is live into a
18790 if (miI == BB->end()) {
18791 for (MachineBasicBlock::succ_iterator sItr = BB->succ_begin(),
18792 sEnd = BB->succ_end();
18793 sItr != sEnd; ++sItr) {
18794 MachineBasicBlock* succ = *sItr;
18795 if (succ->isLiveIn(X86::EFLAGS))
18800 // We found a def, or hit the end of the basic block and EFLAGS wasn't live
18801 // out. SelectMI should have a kill flag on EFLAGS.
18802 SelectItr->addRegisterKilled(X86::EFLAGS, TRI);
18806 MachineBasicBlock *
18807 X86TargetLowering::EmitLoweredSelect(MachineInstr *MI,
18808 MachineBasicBlock *BB) const {
18809 const TargetInstrInfo *TII = BB->getParent()->getSubtarget().getInstrInfo();
18810 DebugLoc DL = MI->getDebugLoc();
18812 // To "insert" a SELECT_CC instruction, we actually have to insert the
18813 // diamond control-flow pattern. The incoming instruction knows the
18814 // destination vreg to set, the condition code register to branch on, the
18815 // true/false values to select between, and a branch opcode to use.
18816 const BasicBlock *LLVM_BB = BB->getBasicBlock();
18817 MachineFunction::iterator It = BB;
18823 // cmpTY ccX, r1, r2
18825 // fallthrough --> copy0MBB
18826 MachineBasicBlock *thisMBB = BB;
18827 MachineFunction *F = BB->getParent();
18828 MachineBasicBlock *copy0MBB = F->CreateMachineBasicBlock(LLVM_BB);
18829 MachineBasicBlock *sinkMBB = F->CreateMachineBasicBlock(LLVM_BB);
18830 F->insert(It, copy0MBB);
18831 F->insert(It, sinkMBB);
18833 // If the EFLAGS register isn't dead in the terminator, then claim that it's
18834 // live into the sink and copy blocks.
18835 const TargetRegisterInfo *TRI =
18836 BB->getParent()->getSubtarget().getRegisterInfo();
18837 if (!MI->killsRegister(X86::EFLAGS) &&
18838 !checkAndUpdateEFLAGSKill(MI, BB, TRI)) {
18839 copy0MBB->addLiveIn(X86::EFLAGS);
18840 sinkMBB->addLiveIn(X86::EFLAGS);
18843 // Transfer the remainder of BB and its successor edges to sinkMBB.
18844 sinkMBB->splice(sinkMBB->begin(), BB,
18845 std::next(MachineBasicBlock::iterator(MI)), BB->end());
18846 sinkMBB->transferSuccessorsAndUpdatePHIs(BB);
18848 // Add the true and fallthrough blocks as its successors.
18849 BB->addSuccessor(copy0MBB);
18850 BB->addSuccessor(sinkMBB);
18852 // Create the conditional branch instruction.
18854 X86::GetCondBranchFromCond((X86::CondCode)MI->getOperand(3).getImm());
18855 BuildMI(BB, DL, TII->get(Opc)).addMBB(sinkMBB);
18858 // %FalseValue = ...
18859 // # fallthrough to sinkMBB
18860 copy0MBB->addSuccessor(sinkMBB);
18863 // %Result = phi [ %FalseValue, copy0MBB ], [ %TrueValue, thisMBB ]
18865 BuildMI(*sinkMBB, sinkMBB->begin(), DL,
18866 TII->get(X86::PHI), MI->getOperand(0).getReg())
18867 .addReg(MI->getOperand(1).getReg()).addMBB(copy0MBB)
18868 .addReg(MI->getOperand(2).getReg()).addMBB(thisMBB);
18870 MI->eraseFromParent(); // The pseudo instruction is gone now.
18874 MachineBasicBlock *
18875 X86TargetLowering::EmitLoweredSegAlloca(MachineInstr *MI, MachineBasicBlock *BB,
18876 bool Is64Bit) const {
18877 MachineFunction *MF = BB->getParent();
18878 const TargetInstrInfo *TII = MF->getSubtarget().getInstrInfo();
18879 DebugLoc DL = MI->getDebugLoc();
18880 const BasicBlock *LLVM_BB = BB->getBasicBlock();
18882 assert(MF->shouldSplitStack());
18884 unsigned TlsReg = Is64Bit ? X86::FS : X86::GS;
18885 unsigned TlsOffset = Is64Bit ? 0x70 : 0x30;
18888 // ... [Till the alloca]
18889 // If stacklet is not large enough, jump to mallocMBB
18892 // Allocate by subtracting from RSP
18893 // Jump to continueMBB
18896 // Allocate by call to runtime
18900 // [rest of original BB]
18903 MachineBasicBlock *mallocMBB = MF->CreateMachineBasicBlock(LLVM_BB);
18904 MachineBasicBlock *bumpMBB = MF->CreateMachineBasicBlock(LLVM_BB);
18905 MachineBasicBlock *continueMBB = MF->CreateMachineBasicBlock(LLVM_BB);
18907 MachineRegisterInfo &MRI = MF->getRegInfo();
18908 const TargetRegisterClass *AddrRegClass =
18909 getRegClassFor(Is64Bit ? MVT::i64:MVT::i32);
18911 unsigned mallocPtrVReg = MRI.createVirtualRegister(AddrRegClass),
18912 bumpSPPtrVReg = MRI.createVirtualRegister(AddrRegClass),
18913 tmpSPVReg = MRI.createVirtualRegister(AddrRegClass),
18914 SPLimitVReg = MRI.createVirtualRegister(AddrRegClass),
18915 sizeVReg = MI->getOperand(1).getReg(),
18916 physSPReg = Is64Bit ? X86::RSP : X86::ESP;
18918 MachineFunction::iterator MBBIter = BB;
18921 MF->insert(MBBIter, bumpMBB);
18922 MF->insert(MBBIter, mallocMBB);
18923 MF->insert(MBBIter, continueMBB);
18925 continueMBB->splice(continueMBB->begin(), BB,
18926 std::next(MachineBasicBlock::iterator(MI)), BB->end());
18927 continueMBB->transferSuccessorsAndUpdatePHIs(BB);
18929 // Add code to the main basic block to check if the stack limit has been hit,
18930 // and if so, jump to mallocMBB otherwise to bumpMBB.
18931 BuildMI(BB, DL, TII->get(TargetOpcode::COPY), tmpSPVReg).addReg(physSPReg);
18932 BuildMI(BB, DL, TII->get(Is64Bit ? X86::SUB64rr:X86::SUB32rr), SPLimitVReg)
18933 .addReg(tmpSPVReg).addReg(sizeVReg);
18934 BuildMI(BB, DL, TII->get(Is64Bit ? X86::CMP64mr:X86::CMP32mr))
18935 .addReg(0).addImm(1).addReg(0).addImm(TlsOffset).addReg(TlsReg)
18936 .addReg(SPLimitVReg);
18937 BuildMI(BB, DL, TII->get(X86::JG_4)).addMBB(mallocMBB);
18939 // bumpMBB simply decreases the stack pointer, since we know the current
18940 // stacklet has enough space.
18941 BuildMI(bumpMBB, DL, TII->get(TargetOpcode::COPY), physSPReg)
18942 .addReg(SPLimitVReg);
18943 BuildMI(bumpMBB, DL, TII->get(TargetOpcode::COPY), bumpSPPtrVReg)
18944 .addReg(SPLimitVReg);
18945 BuildMI(bumpMBB, DL, TII->get(X86::JMP_4)).addMBB(continueMBB);
18947 // Calls into a routine in libgcc to allocate more space from the heap.
18948 const uint32_t *RegMask = MF->getTarget()
18949 .getSubtargetImpl()
18950 ->getRegisterInfo()
18951 ->getCallPreservedMask(CallingConv::C);
18953 BuildMI(mallocMBB, DL, TII->get(X86::MOV64rr), X86::RDI)
18955 BuildMI(mallocMBB, DL, TII->get(X86::CALL64pcrel32))
18956 .addExternalSymbol("__morestack_allocate_stack_space")
18957 .addRegMask(RegMask)
18958 .addReg(X86::RDI, RegState::Implicit)
18959 .addReg(X86::RAX, RegState::ImplicitDefine);
18961 BuildMI(mallocMBB, DL, TII->get(X86::SUB32ri), physSPReg).addReg(physSPReg)
18963 BuildMI(mallocMBB, DL, TII->get(X86::PUSH32r)).addReg(sizeVReg);
18964 BuildMI(mallocMBB, DL, TII->get(X86::CALLpcrel32))
18965 .addExternalSymbol("__morestack_allocate_stack_space")
18966 .addRegMask(RegMask)
18967 .addReg(X86::EAX, RegState::ImplicitDefine);
18971 BuildMI(mallocMBB, DL, TII->get(X86::ADD32ri), physSPReg).addReg(physSPReg)
18974 BuildMI(mallocMBB, DL, TII->get(TargetOpcode::COPY), mallocPtrVReg)
18975 .addReg(Is64Bit ? X86::RAX : X86::EAX);
18976 BuildMI(mallocMBB, DL, TII->get(X86::JMP_4)).addMBB(continueMBB);
18978 // Set up the CFG correctly.
18979 BB->addSuccessor(bumpMBB);
18980 BB->addSuccessor(mallocMBB);
18981 mallocMBB->addSuccessor(continueMBB);
18982 bumpMBB->addSuccessor(continueMBB);
18984 // Take care of the PHI nodes.
18985 BuildMI(*continueMBB, continueMBB->begin(), DL, TII->get(X86::PHI),
18986 MI->getOperand(0).getReg())
18987 .addReg(mallocPtrVReg).addMBB(mallocMBB)
18988 .addReg(bumpSPPtrVReg).addMBB(bumpMBB);
18990 // Delete the original pseudo instruction.
18991 MI->eraseFromParent();
18994 return continueMBB;
18997 MachineBasicBlock *
18998 X86TargetLowering::EmitLoweredWinAlloca(MachineInstr *MI,
18999 MachineBasicBlock *BB) const {
19000 const TargetInstrInfo *TII = BB->getParent()->getSubtarget().getInstrInfo();
19001 DebugLoc DL = MI->getDebugLoc();
19003 assert(!Subtarget->isTargetMacho());
19005 // The lowering is pretty easy: we're just emitting the call to _alloca. The
19006 // non-trivial part is impdef of ESP.
19008 if (Subtarget->isTargetWin64()) {
19009 if (Subtarget->isTargetCygMing()) {
19010 // ___chkstk(Mingw64):
19011 // Clobbers R10, R11, RAX and EFLAGS.
19013 BuildMI(*BB, MI, DL, TII->get(X86::W64ALLOCA))
19014 .addExternalSymbol("___chkstk")
19015 .addReg(X86::RAX, RegState::Implicit)
19016 .addReg(X86::RSP, RegState::Implicit)
19017 .addReg(X86::RAX, RegState::Define | RegState::Implicit)
19018 .addReg(X86::RSP, RegState::Define | RegState::Implicit)
19019 .addReg(X86::EFLAGS, RegState::Define | RegState::Implicit);
19021 // __chkstk(MSVCRT): does not update stack pointer.
19022 // Clobbers R10, R11 and EFLAGS.
19023 BuildMI(*BB, MI, DL, TII->get(X86::W64ALLOCA))
19024 .addExternalSymbol("__chkstk")
19025 .addReg(X86::RAX, RegState::Implicit)
19026 .addReg(X86::EFLAGS, RegState::Define | RegState::Implicit);
19027 // RAX has the offset to be subtracted from RSP.
19028 BuildMI(*BB, MI, DL, TII->get(X86::SUB64rr), X86::RSP)
19033 const char *StackProbeSymbol =
19034 Subtarget->isTargetKnownWindowsMSVC() ? "_chkstk" : "_alloca";
19036 BuildMI(*BB, MI, DL, TII->get(X86::CALLpcrel32))
19037 .addExternalSymbol(StackProbeSymbol)
19038 .addReg(X86::EAX, RegState::Implicit)
19039 .addReg(X86::ESP, RegState::Implicit)
19040 .addReg(X86::EAX, RegState::Define | RegState::Implicit)
19041 .addReg(X86::ESP, RegState::Define | RegState::Implicit)
19042 .addReg(X86::EFLAGS, RegState::Define | RegState::Implicit);
19045 MI->eraseFromParent(); // The pseudo instruction is gone now.
19049 MachineBasicBlock *
19050 X86TargetLowering::EmitLoweredTLSCall(MachineInstr *MI,
19051 MachineBasicBlock *BB) const {
19052 // This is pretty easy. We're taking the value that we received from
19053 // our load from the relocation, sticking it in either RDI (x86-64)
19054 // or EAX and doing an indirect call. The return value will then
19055 // be in the normal return register.
19056 MachineFunction *F = BB->getParent();
19057 const X86InstrInfo *TII =
19058 static_cast<const X86InstrInfo *>(F->getSubtarget().getInstrInfo());
19059 DebugLoc DL = MI->getDebugLoc();
19061 assert(Subtarget->isTargetDarwin() && "Darwin only instr emitted?");
19062 assert(MI->getOperand(3).isGlobal() && "This should be a global");
19064 // Get a register mask for the lowered call.
19065 // FIXME: The 32-bit calls have non-standard calling conventions. Use a
19066 // proper register mask.
19067 const uint32_t *RegMask = F->getTarget()
19068 .getSubtargetImpl()
19069 ->getRegisterInfo()
19070 ->getCallPreservedMask(CallingConv::C);
19071 if (Subtarget->is64Bit()) {
19072 MachineInstrBuilder MIB = BuildMI(*BB, MI, DL,
19073 TII->get(X86::MOV64rm), X86::RDI)
19075 .addImm(0).addReg(0)
19076 .addGlobalAddress(MI->getOperand(3).getGlobal(), 0,
19077 MI->getOperand(3).getTargetFlags())
19079 MIB = BuildMI(*BB, MI, DL, TII->get(X86::CALL64m));
19080 addDirectMem(MIB, X86::RDI);
19081 MIB.addReg(X86::RAX, RegState::ImplicitDefine).addRegMask(RegMask);
19082 } else if (F->getTarget().getRelocationModel() != Reloc::PIC_) {
19083 MachineInstrBuilder MIB = BuildMI(*BB, MI, DL,
19084 TII->get(X86::MOV32rm), X86::EAX)
19086 .addImm(0).addReg(0)
19087 .addGlobalAddress(MI->getOperand(3).getGlobal(), 0,
19088 MI->getOperand(3).getTargetFlags())
19090 MIB = BuildMI(*BB, MI, DL, TII->get(X86::CALL32m));
19091 addDirectMem(MIB, X86::EAX);
19092 MIB.addReg(X86::EAX, RegState::ImplicitDefine).addRegMask(RegMask);
19094 MachineInstrBuilder MIB = BuildMI(*BB, MI, DL,
19095 TII->get(X86::MOV32rm), X86::EAX)
19096 .addReg(TII->getGlobalBaseReg(F))
19097 .addImm(0).addReg(0)
19098 .addGlobalAddress(MI->getOperand(3).getGlobal(), 0,
19099 MI->getOperand(3).getTargetFlags())
19101 MIB = BuildMI(*BB, MI, DL, TII->get(X86::CALL32m));
19102 addDirectMem(MIB, X86::EAX);
19103 MIB.addReg(X86::EAX, RegState::ImplicitDefine).addRegMask(RegMask);
19106 MI->eraseFromParent(); // The pseudo instruction is gone now.
19110 MachineBasicBlock *
19111 X86TargetLowering::emitEHSjLjSetJmp(MachineInstr *MI,
19112 MachineBasicBlock *MBB) const {
19113 DebugLoc DL = MI->getDebugLoc();
19114 MachineFunction *MF = MBB->getParent();
19115 const TargetInstrInfo *TII = MF->getSubtarget().getInstrInfo();
19116 MachineRegisterInfo &MRI = MF->getRegInfo();
19118 const BasicBlock *BB = MBB->getBasicBlock();
19119 MachineFunction::iterator I = MBB;
19122 // Memory Reference
19123 MachineInstr::mmo_iterator MMOBegin = MI->memoperands_begin();
19124 MachineInstr::mmo_iterator MMOEnd = MI->memoperands_end();
19127 unsigned MemOpndSlot = 0;
19129 unsigned CurOp = 0;
19131 DstReg = MI->getOperand(CurOp++).getReg();
19132 const TargetRegisterClass *RC = MRI.getRegClass(DstReg);
19133 assert(RC->hasType(MVT::i32) && "Invalid destination!");
19134 unsigned mainDstReg = MRI.createVirtualRegister(RC);
19135 unsigned restoreDstReg = MRI.createVirtualRegister(RC);
19137 MemOpndSlot = CurOp;
19139 MVT PVT = getPointerTy();
19140 assert((PVT == MVT::i64 || PVT == MVT::i32) &&
19141 "Invalid Pointer Size!");
19143 // For v = setjmp(buf), we generate
19146 // buf[LabelOffset] = restoreMBB
19147 // SjLjSetup restoreMBB
19153 // v = phi(main, restore)
19158 MachineBasicBlock *thisMBB = MBB;
19159 MachineBasicBlock *mainMBB = MF->CreateMachineBasicBlock(BB);
19160 MachineBasicBlock *sinkMBB = MF->CreateMachineBasicBlock(BB);
19161 MachineBasicBlock *restoreMBB = MF->CreateMachineBasicBlock(BB);
19162 MF->insert(I, mainMBB);
19163 MF->insert(I, sinkMBB);
19164 MF->push_back(restoreMBB);
19166 MachineInstrBuilder MIB;
19168 // Transfer the remainder of BB and its successor edges to sinkMBB.
19169 sinkMBB->splice(sinkMBB->begin(), MBB,
19170 std::next(MachineBasicBlock::iterator(MI)), MBB->end());
19171 sinkMBB->transferSuccessorsAndUpdatePHIs(MBB);
19174 unsigned PtrStoreOpc = 0;
19175 unsigned LabelReg = 0;
19176 const int64_t LabelOffset = 1 * PVT.getStoreSize();
19177 Reloc::Model RM = MF->getTarget().getRelocationModel();
19178 bool UseImmLabel = (MF->getTarget().getCodeModel() == CodeModel::Small) &&
19179 (RM == Reloc::Static || RM == Reloc::DynamicNoPIC);
19181 // Prepare IP either in reg or imm.
19182 if (!UseImmLabel) {
19183 PtrStoreOpc = (PVT == MVT::i64) ? X86::MOV64mr : X86::MOV32mr;
19184 const TargetRegisterClass *PtrRC = getRegClassFor(PVT);
19185 LabelReg = MRI.createVirtualRegister(PtrRC);
19186 if (Subtarget->is64Bit()) {
19187 MIB = BuildMI(*thisMBB, MI, DL, TII->get(X86::LEA64r), LabelReg)
19191 .addMBB(restoreMBB)
19194 const X86InstrInfo *XII = static_cast<const X86InstrInfo*>(TII);
19195 MIB = BuildMI(*thisMBB, MI, DL, TII->get(X86::LEA32r), LabelReg)
19196 .addReg(XII->getGlobalBaseReg(MF))
19199 .addMBB(restoreMBB, Subtarget->ClassifyBlockAddressReference())
19203 PtrStoreOpc = (PVT == MVT::i64) ? X86::MOV64mi32 : X86::MOV32mi;
19205 MIB = BuildMI(*thisMBB, MI, DL, TII->get(PtrStoreOpc));
19206 for (unsigned i = 0; i < X86::AddrNumOperands; ++i) {
19207 if (i == X86::AddrDisp)
19208 MIB.addDisp(MI->getOperand(MemOpndSlot + i), LabelOffset);
19210 MIB.addOperand(MI->getOperand(MemOpndSlot + i));
19213 MIB.addReg(LabelReg);
19215 MIB.addMBB(restoreMBB);
19216 MIB.setMemRefs(MMOBegin, MMOEnd);
19218 MIB = BuildMI(*thisMBB, MI, DL, TII->get(X86::EH_SjLj_Setup))
19219 .addMBB(restoreMBB);
19221 const X86RegisterInfo *RegInfo = static_cast<const X86RegisterInfo *>(
19222 MF->getSubtarget().getRegisterInfo());
19223 MIB.addRegMask(RegInfo->getNoPreservedMask());
19224 thisMBB->addSuccessor(mainMBB);
19225 thisMBB->addSuccessor(restoreMBB);
19229 BuildMI(mainMBB, DL, TII->get(X86::MOV32r0), mainDstReg);
19230 mainMBB->addSuccessor(sinkMBB);
19233 BuildMI(*sinkMBB, sinkMBB->begin(), DL,
19234 TII->get(X86::PHI), DstReg)
19235 .addReg(mainDstReg).addMBB(mainMBB)
19236 .addReg(restoreDstReg).addMBB(restoreMBB);
19239 BuildMI(restoreMBB, DL, TII->get(X86::MOV32ri), restoreDstReg).addImm(1);
19240 BuildMI(restoreMBB, DL, TII->get(X86::JMP_4)).addMBB(sinkMBB);
19241 restoreMBB->addSuccessor(sinkMBB);
19243 MI->eraseFromParent();
19247 MachineBasicBlock *
19248 X86TargetLowering::emitEHSjLjLongJmp(MachineInstr *MI,
19249 MachineBasicBlock *MBB) const {
19250 DebugLoc DL = MI->getDebugLoc();
19251 MachineFunction *MF = MBB->getParent();
19252 const TargetInstrInfo *TII = MF->getSubtarget().getInstrInfo();
19253 MachineRegisterInfo &MRI = MF->getRegInfo();
19255 // Memory Reference
19256 MachineInstr::mmo_iterator MMOBegin = MI->memoperands_begin();
19257 MachineInstr::mmo_iterator MMOEnd = MI->memoperands_end();
19259 MVT PVT = getPointerTy();
19260 assert((PVT == MVT::i64 || PVT == MVT::i32) &&
19261 "Invalid Pointer Size!");
19263 const TargetRegisterClass *RC =
19264 (PVT == MVT::i64) ? &X86::GR64RegClass : &X86::GR32RegClass;
19265 unsigned Tmp = MRI.createVirtualRegister(RC);
19266 // Since FP is only updated here but NOT referenced, it's treated as GPR.
19267 const X86RegisterInfo *RegInfo = static_cast<const X86RegisterInfo *>(
19268 MF->getSubtarget().getRegisterInfo());
19269 unsigned FP = (PVT == MVT::i64) ? X86::RBP : X86::EBP;
19270 unsigned SP = RegInfo->getStackRegister();
19272 MachineInstrBuilder MIB;
19274 const int64_t LabelOffset = 1 * PVT.getStoreSize();
19275 const int64_t SPOffset = 2 * PVT.getStoreSize();
19277 unsigned PtrLoadOpc = (PVT == MVT::i64) ? X86::MOV64rm : X86::MOV32rm;
19278 unsigned IJmpOpc = (PVT == MVT::i64) ? X86::JMP64r : X86::JMP32r;
19281 MIB = BuildMI(*MBB, MI, DL, TII->get(PtrLoadOpc), FP);
19282 for (unsigned i = 0; i < X86::AddrNumOperands; ++i)
19283 MIB.addOperand(MI->getOperand(i));
19284 MIB.setMemRefs(MMOBegin, MMOEnd);
19286 MIB = BuildMI(*MBB, MI, DL, TII->get(PtrLoadOpc), Tmp);
19287 for (unsigned i = 0; i < X86::AddrNumOperands; ++i) {
19288 if (i == X86::AddrDisp)
19289 MIB.addDisp(MI->getOperand(i), LabelOffset);
19291 MIB.addOperand(MI->getOperand(i));
19293 MIB.setMemRefs(MMOBegin, MMOEnd);
19295 MIB = BuildMI(*MBB, MI, DL, TII->get(PtrLoadOpc), SP);
19296 for (unsigned i = 0; i < X86::AddrNumOperands; ++i) {
19297 if (i == X86::AddrDisp)
19298 MIB.addDisp(MI->getOperand(i), SPOffset);
19300 MIB.addOperand(MI->getOperand(i));
19302 MIB.setMemRefs(MMOBegin, MMOEnd);
19304 BuildMI(*MBB, MI, DL, TII->get(IJmpOpc)).addReg(Tmp);
19306 MI->eraseFromParent();
19310 // Replace 213-type (isel default) FMA3 instructions with 231-type for
19311 // accumulator loops. Writing back to the accumulator allows the coalescer
19312 // to remove extra copies in the loop.
19313 MachineBasicBlock *
19314 X86TargetLowering::emitFMA3Instr(MachineInstr *MI,
19315 MachineBasicBlock *MBB) const {
19316 MachineOperand &AddendOp = MI->getOperand(3);
19318 // Bail out early if the addend isn't a register - we can't switch these.
19319 if (!AddendOp.isReg())
19322 MachineFunction &MF = *MBB->getParent();
19323 MachineRegisterInfo &MRI = MF.getRegInfo();
19325 // Check whether the addend is defined by a PHI:
19326 assert(MRI.hasOneDef(AddendOp.getReg()) && "Multiple defs in SSA?");
19327 MachineInstr &AddendDef = *MRI.def_instr_begin(AddendOp.getReg());
19328 if (!AddendDef.isPHI())
19331 // Look for the following pattern:
19333 // %addend = phi [%entry, 0], [%loop, %result]
19335 // %result<tied1> = FMA213 %m2<tied0>, %m1, %addend
19339 // %addend = phi [%entry, 0], [%loop, %result]
19341 // %result<tied1> = FMA231 %addend<tied0>, %m1, %m2
19343 for (unsigned i = 1, e = AddendDef.getNumOperands(); i < e; i += 2) {
19344 assert(AddendDef.getOperand(i).isReg());
19345 MachineOperand PHISrcOp = AddendDef.getOperand(i);
19346 MachineInstr &PHISrcInst = *MRI.def_instr_begin(PHISrcOp.getReg());
19347 if (&PHISrcInst == MI) {
19348 // Found a matching instruction.
19349 unsigned NewFMAOpc = 0;
19350 switch (MI->getOpcode()) {
19351 case X86::VFMADDPDr213r: NewFMAOpc = X86::VFMADDPDr231r; break;
19352 case X86::VFMADDPSr213r: NewFMAOpc = X86::VFMADDPSr231r; break;
19353 case X86::VFMADDSDr213r: NewFMAOpc = X86::VFMADDSDr231r; break;
19354 case X86::VFMADDSSr213r: NewFMAOpc = X86::VFMADDSSr231r; break;
19355 case X86::VFMSUBPDr213r: NewFMAOpc = X86::VFMSUBPDr231r; break;
19356 case X86::VFMSUBPSr213r: NewFMAOpc = X86::VFMSUBPSr231r; break;
19357 case X86::VFMSUBSDr213r: NewFMAOpc = X86::VFMSUBSDr231r; break;
19358 case X86::VFMSUBSSr213r: NewFMAOpc = X86::VFMSUBSSr231r; break;
19359 case X86::VFNMADDPDr213r: NewFMAOpc = X86::VFNMADDPDr231r; break;
19360 case X86::VFNMADDPSr213r: NewFMAOpc = X86::VFNMADDPSr231r; break;
19361 case X86::VFNMADDSDr213r: NewFMAOpc = X86::VFNMADDSDr231r; break;
19362 case X86::VFNMADDSSr213r: NewFMAOpc = X86::VFNMADDSSr231r; break;
19363 case X86::VFNMSUBPDr213r: NewFMAOpc = X86::VFNMSUBPDr231r; break;
19364 case X86::VFNMSUBPSr213r: NewFMAOpc = X86::VFNMSUBPSr231r; break;
19365 case X86::VFNMSUBSDr213r: NewFMAOpc = X86::VFNMSUBSDr231r; break;
19366 case X86::VFNMSUBSSr213r: NewFMAOpc = X86::VFNMSUBSSr231r; break;
19367 case X86::VFMADDPDr213rY: NewFMAOpc = X86::VFMADDPDr231rY; break;
19368 case X86::VFMADDPSr213rY: NewFMAOpc = X86::VFMADDPSr231rY; break;
19369 case X86::VFMSUBPDr213rY: NewFMAOpc = X86::VFMSUBPDr231rY; break;
19370 case X86::VFMSUBPSr213rY: NewFMAOpc = X86::VFMSUBPSr231rY; break;
19371 case X86::VFNMADDPDr213rY: NewFMAOpc = X86::VFNMADDPDr231rY; break;
19372 case X86::VFNMADDPSr213rY: NewFMAOpc = X86::VFNMADDPSr231rY; break;
19373 case X86::VFNMSUBPDr213rY: NewFMAOpc = X86::VFNMSUBPDr231rY; break;
19374 case X86::VFNMSUBPSr213rY: NewFMAOpc = X86::VFNMSUBPSr231rY; break;
19375 default: llvm_unreachable("Unrecognized FMA variant.");
19378 const TargetInstrInfo &TII = *MF.getSubtarget().getInstrInfo();
19379 MachineInstrBuilder MIB =
19380 BuildMI(MF, MI->getDebugLoc(), TII.get(NewFMAOpc))
19381 .addOperand(MI->getOperand(0))
19382 .addOperand(MI->getOperand(3))
19383 .addOperand(MI->getOperand(2))
19384 .addOperand(MI->getOperand(1));
19385 MBB->insert(MachineBasicBlock::iterator(MI), MIB);
19386 MI->eraseFromParent();
19393 MachineBasicBlock *
19394 X86TargetLowering::EmitInstrWithCustomInserter(MachineInstr *MI,
19395 MachineBasicBlock *BB) const {
19396 switch (MI->getOpcode()) {
19397 default: llvm_unreachable("Unexpected instr type to insert");
19398 case X86::TAILJMPd64:
19399 case X86::TAILJMPr64:
19400 case X86::TAILJMPm64:
19401 llvm_unreachable("TAILJMP64 would not be touched here.");
19402 case X86::TCRETURNdi64:
19403 case X86::TCRETURNri64:
19404 case X86::TCRETURNmi64:
19406 case X86::WIN_ALLOCA:
19407 return EmitLoweredWinAlloca(MI, BB);
19408 case X86::SEG_ALLOCA_32:
19409 return EmitLoweredSegAlloca(MI, BB, false);
19410 case X86::SEG_ALLOCA_64:
19411 return EmitLoweredSegAlloca(MI, BB, true);
19412 case X86::TLSCall_32:
19413 case X86::TLSCall_64:
19414 return EmitLoweredTLSCall(MI, BB);
19415 case X86::CMOV_GR8:
19416 case X86::CMOV_FR32:
19417 case X86::CMOV_FR64:
19418 case X86::CMOV_V4F32:
19419 case X86::CMOV_V2F64:
19420 case X86::CMOV_V2I64:
19421 case X86::CMOV_V8F32:
19422 case X86::CMOV_V4F64:
19423 case X86::CMOV_V4I64:
19424 case X86::CMOV_V16F32:
19425 case X86::CMOV_V8F64:
19426 case X86::CMOV_V8I64:
19427 case X86::CMOV_GR16:
19428 case X86::CMOV_GR32:
19429 case X86::CMOV_RFP32:
19430 case X86::CMOV_RFP64:
19431 case X86::CMOV_RFP80:
19432 return EmitLoweredSelect(MI, BB);
19434 case X86::FP32_TO_INT16_IN_MEM:
19435 case X86::FP32_TO_INT32_IN_MEM:
19436 case X86::FP32_TO_INT64_IN_MEM:
19437 case X86::FP64_TO_INT16_IN_MEM:
19438 case X86::FP64_TO_INT32_IN_MEM:
19439 case X86::FP64_TO_INT64_IN_MEM:
19440 case X86::FP80_TO_INT16_IN_MEM:
19441 case X86::FP80_TO_INT32_IN_MEM:
19442 case X86::FP80_TO_INT64_IN_MEM: {
19443 MachineFunction *F = BB->getParent();
19444 const TargetInstrInfo *TII = F->getSubtarget().getInstrInfo();
19445 DebugLoc DL = MI->getDebugLoc();
19447 // Change the floating point control register to use "round towards zero"
19448 // mode when truncating to an integer value.
19449 int CWFrameIdx = F->getFrameInfo()->CreateStackObject(2, 2, false);
19450 addFrameReference(BuildMI(*BB, MI, DL,
19451 TII->get(X86::FNSTCW16m)), CWFrameIdx);
19453 // Load the old value of the high byte of the control word...
19455 F->getRegInfo().createVirtualRegister(&X86::GR16RegClass);
19456 addFrameReference(BuildMI(*BB, MI, DL, TII->get(X86::MOV16rm), OldCW),
19459 // Set the high part to be round to zero...
19460 addFrameReference(BuildMI(*BB, MI, DL, TII->get(X86::MOV16mi)), CWFrameIdx)
19463 // Reload the modified control word now...
19464 addFrameReference(BuildMI(*BB, MI, DL,
19465 TII->get(X86::FLDCW16m)), CWFrameIdx);
19467 // Restore the memory image of control word to original value
19468 addFrameReference(BuildMI(*BB, MI, DL, TII->get(X86::MOV16mr)), CWFrameIdx)
19471 // Get the X86 opcode to use.
19473 switch (MI->getOpcode()) {
19474 default: llvm_unreachable("illegal opcode!");
19475 case X86::FP32_TO_INT16_IN_MEM: Opc = X86::IST_Fp16m32; break;
19476 case X86::FP32_TO_INT32_IN_MEM: Opc = X86::IST_Fp32m32; break;
19477 case X86::FP32_TO_INT64_IN_MEM: Opc = X86::IST_Fp64m32; break;
19478 case X86::FP64_TO_INT16_IN_MEM: Opc = X86::IST_Fp16m64; break;
19479 case X86::FP64_TO_INT32_IN_MEM: Opc = X86::IST_Fp32m64; break;
19480 case X86::FP64_TO_INT64_IN_MEM: Opc = X86::IST_Fp64m64; break;
19481 case X86::FP80_TO_INT16_IN_MEM: Opc = X86::IST_Fp16m80; break;
19482 case X86::FP80_TO_INT32_IN_MEM: Opc = X86::IST_Fp32m80; break;
19483 case X86::FP80_TO_INT64_IN_MEM: Opc = X86::IST_Fp64m80; break;
19487 MachineOperand &Op = MI->getOperand(0);
19489 AM.BaseType = X86AddressMode::RegBase;
19490 AM.Base.Reg = Op.getReg();
19492 AM.BaseType = X86AddressMode::FrameIndexBase;
19493 AM.Base.FrameIndex = Op.getIndex();
19495 Op = MI->getOperand(1);
19497 AM.Scale = Op.getImm();
19498 Op = MI->getOperand(2);
19500 AM.IndexReg = Op.getImm();
19501 Op = MI->getOperand(3);
19502 if (Op.isGlobal()) {
19503 AM.GV = Op.getGlobal();
19505 AM.Disp = Op.getImm();
19507 addFullAddress(BuildMI(*BB, MI, DL, TII->get(Opc)), AM)
19508 .addReg(MI->getOperand(X86::AddrNumOperands).getReg());
19510 // Reload the original control word now.
19511 addFrameReference(BuildMI(*BB, MI, DL,
19512 TII->get(X86::FLDCW16m)), CWFrameIdx);
19514 MI->eraseFromParent(); // The pseudo instruction is gone now.
19517 // String/text processing lowering.
19518 case X86::PCMPISTRM128REG:
19519 case X86::VPCMPISTRM128REG:
19520 case X86::PCMPISTRM128MEM:
19521 case X86::VPCMPISTRM128MEM:
19522 case X86::PCMPESTRM128REG:
19523 case X86::VPCMPESTRM128REG:
19524 case X86::PCMPESTRM128MEM:
19525 case X86::VPCMPESTRM128MEM:
19526 assert(Subtarget->hasSSE42() &&
19527 "Target must have SSE4.2 or AVX features enabled");
19528 return EmitPCMPSTRM(MI, BB, BB->getParent()->getSubtarget().getInstrInfo());
19530 // String/text processing lowering.
19531 case X86::PCMPISTRIREG:
19532 case X86::VPCMPISTRIREG:
19533 case X86::PCMPISTRIMEM:
19534 case X86::VPCMPISTRIMEM:
19535 case X86::PCMPESTRIREG:
19536 case X86::VPCMPESTRIREG:
19537 case X86::PCMPESTRIMEM:
19538 case X86::VPCMPESTRIMEM:
19539 assert(Subtarget->hasSSE42() &&
19540 "Target must have SSE4.2 or AVX features enabled");
19541 return EmitPCMPSTRI(MI, BB, BB->getParent()->getSubtarget().getInstrInfo());
19543 // Thread synchronization.
19545 return EmitMonitor(MI, BB, BB->getParent()->getSubtarget().getInstrInfo(),
19550 return EmitXBegin(MI, BB, BB->getParent()->getSubtarget().getInstrInfo());
19552 case X86::VASTART_SAVE_XMM_REGS:
19553 return EmitVAStartSaveXMMRegsWithCustomInserter(MI, BB);
19555 case X86::VAARG_64:
19556 return EmitVAARG64WithCustomInserter(MI, BB);
19558 case X86::EH_SjLj_SetJmp32:
19559 case X86::EH_SjLj_SetJmp64:
19560 return emitEHSjLjSetJmp(MI, BB);
19562 case X86::EH_SjLj_LongJmp32:
19563 case X86::EH_SjLj_LongJmp64:
19564 return emitEHSjLjLongJmp(MI, BB);
19566 case TargetOpcode::STACKMAP:
19567 case TargetOpcode::PATCHPOINT:
19568 return emitPatchPoint(MI, BB);
19570 case X86::VFMADDPDr213r:
19571 case X86::VFMADDPSr213r:
19572 case X86::VFMADDSDr213r:
19573 case X86::VFMADDSSr213r:
19574 case X86::VFMSUBPDr213r:
19575 case X86::VFMSUBPSr213r:
19576 case X86::VFMSUBSDr213r:
19577 case X86::VFMSUBSSr213r:
19578 case X86::VFNMADDPDr213r:
19579 case X86::VFNMADDPSr213r:
19580 case X86::VFNMADDSDr213r:
19581 case X86::VFNMADDSSr213r:
19582 case X86::VFNMSUBPDr213r:
19583 case X86::VFNMSUBPSr213r:
19584 case X86::VFNMSUBSDr213r:
19585 case X86::VFNMSUBSSr213r:
19586 case X86::VFMADDPDr213rY:
19587 case X86::VFMADDPSr213rY:
19588 case X86::VFMSUBPDr213rY:
19589 case X86::VFMSUBPSr213rY:
19590 case X86::VFNMADDPDr213rY:
19591 case X86::VFNMADDPSr213rY:
19592 case X86::VFNMSUBPDr213rY:
19593 case X86::VFNMSUBPSr213rY:
19594 return emitFMA3Instr(MI, BB);
19598 //===----------------------------------------------------------------------===//
19599 // X86 Optimization Hooks
19600 //===----------------------------------------------------------------------===//
19602 void X86TargetLowering::computeKnownBitsForTargetNode(const SDValue Op,
19605 const SelectionDAG &DAG,
19606 unsigned Depth) const {
19607 unsigned BitWidth = KnownZero.getBitWidth();
19608 unsigned Opc = Op.getOpcode();
19609 assert((Opc >= ISD::BUILTIN_OP_END ||
19610 Opc == ISD::INTRINSIC_WO_CHAIN ||
19611 Opc == ISD::INTRINSIC_W_CHAIN ||
19612 Opc == ISD::INTRINSIC_VOID) &&
19613 "Should use MaskedValueIsZero if you don't know whether Op"
19614 " is a target node!");
19616 KnownZero = KnownOne = APInt(BitWidth, 0); // Don't know anything.
19630 // These nodes' second result is a boolean.
19631 if (Op.getResNo() == 0)
19634 case X86ISD::SETCC:
19635 KnownZero |= APInt::getHighBitsSet(BitWidth, BitWidth - 1);
19637 case ISD::INTRINSIC_WO_CHAIN: {
19638 unsigned IntId = cast<ConstantSDNode>(Op.getOperand(0))->getZExtValue();
19639 unsigned NumLoBits = 0;
19642 case Intrinsic::x86_sse_movmsk_ps:
19643 case Intrinsic::x86_avx_movmsk_ps_256:
19644 case Intrinsic::x86_sse2_movmsk_pd:
19645 case Intrinsic::x86_avx_movmsk_pd_256:
19646 case Intrinsic::x86_mmx_pmovmskb:
19647 case Intrinsic::x86_sse2_pmovmskb_128:
19648 case Intrinsic::x86_avx2_pmovmskb: {
19649 // High bits of movmskp{s|d}, pmovmskb are known zero.
19651 default: llvm_unreachable("Impossible intrinsic"); // Can't reach here.
19652 case Intrinsic::x86_sse_movmsk_ps: NumLoBits = 4; break;
19653 case Intrinsic::x86_avx_movmsk_ps_256: NumLoBits = 8; break;
19654 case Intrinsic::x86_sse2_movmsk_pd: NumLoBits = 2; break;
19655 case Intrinsic::x86_avx_movmsk_pd_256: NumLoBits = 4; break;
19656 case Intrinsic::x86_mmx_pmovmskb: NumLoBits = 8; break;
19657 case Intrinsic::x86_sse2_pmovmskb_128: NumLoBits = 16; break;
19658 case Intrinsic::x86_avx2_pmovmskb: NumLoBits = 32; break;
19660 KnownZero = APInt::getHighBitsSet(BitWidth, BitWidth - NumLoBits);
19669 unsigned X86TargetLowering::ComputeNumSignBitsForTargetNode(
19671 const SelectionDAG &,
19672 unsigned Depth) const {
19673 // SETCC_CARRY sets the dest to ~0 for true or 0 for false.
19674 if (Op.getOpcode() == X86ISD::SETCC_CARRY)
19675 return Op.getValueType().getScalarType().getSizeInBits();
19681 /// isGAPlusOffset - Returns true (and the GlobalValue and the offset) if the
19682 /// node is a GlobalAddress + offset.
19683 bool X86TargetLowering::isGAPlusOffset(SDNode *N,
19684 const GlobalValue* &GA,
19685 int64_t &Offset) const {
19686 if (N->getOpcode() == X86ISD::Wrapper) {
19687 if (isa<GlobalAddressSDNode>(N->getOperand(0))) {
19688 GA = cast<GlobalAddressSDNode>(N->getOperand(0))->getGlobal();
19689 Offset = cast<GlobalAddressSDNode>(N->getOperand(0))->getOffset();
19693 return TargetLowering::isGAPlusOffset(N, GA, Offset);
19696 /// isShuffleHigh128VectorInsertLow - Checks whether the shuffle node is the
19697 /// same as extracting the high 128-bit part of 256-bit vector and then
19698 /// inserting the result into the low part of a new 256-bit vector
19699 static bool isShuffleHigh128VectorInsertLow(ShuffleVectorSDNode *SVOp) {
19700 EVT VT = SVOp->getValueType(0);
19701 unsigned NumElems = VT.getVectorNumElements();
19703 // vector_shuffle <4, 5, 6, 7, u, u, u, u> or <2, 3, u, u>
19704 for (unsigned i = 0, j = NumElems/2; i != NumElems/2; ++i, ++j)
19705 if (!isUndefOrEqual(SVOp->getMaskElt(i), j) ||
19706 SVOp->getMaskElt(j) >= 0)
19712 /// isShuffleLow128VectorInsertHigh - Checks whether the shuffle node is the
19713 /// same as extracting the low 128-bit part of 256-bit vector and then
19714 /// inserting the result into the high part of a new 256-bit vector
19715 static bool isShuffleLow128VectorInsertHigh(ShuffleVectorSDNode *SVOp) {
19716 EVT VT = SVOp->getValueType(0);
19717 unsigned NumElems = VT.getVectorNumElements();
19719 // vector_shuffle <u, u, u, u, 0, 1, 2, 3> or <u, u, 0, 1>
19720 for (unsigned i = NumElems/2, j = 0; i != NumElems; ++i, ++j)
19721 if (!isUndefOrEqual(SVOp->getMaskElt(i), j) ||
19722 SVOp->getMaskElt(j) >= 0)
19728 /// PerformShuffleCombine256 - Performs shuffle combines for 256-bit vectors.
19729 static SDValue PerformShuffleCombine256(SDNode *N, SelectionDAG &DAG,
19730 TargetLowering::DAGCombinerInfo &DCI,
19731 const X86Subtarget* Subtarget) {
19733 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(N);
19734 SDValue V1 = SVOp->getOperand(0);
19735 SDValue V2 = SVOp->getOperand(1);
19736 EVT VT = SVOp->getValueType(0);
19737 unsigned NumElems = VT.getVectorNumElements();
19739 if (V1.getOpcode() == ISD::CONCAT_VECTORS &&
19740 V2.getOpcode() == ISD::CONCAT_VECTORS) {
19744 // V UNDEF BUILD_VECTOR UNDEF
19746 // CONCAT_VECTOR CONCAT_VECTOR
19749 // RESULT: V + zero extended
19751 if (V2.getOperand(0).getOpcode() != ISD::BUILD_VECTOR ||
19752 V2.getOperand(1).getOpcode() != ISD::UNDEF ||
19753 V1.getOperand(1).getOpcode() != ISD::UNDEF)
19756 if (!ISD::isBuildVectorAllZeros(V2.getOperand(0).getNode()))
19759 // To match the shuffle mask, the first half of the mask should
19760 // be exactly the first vector, and all the rest a splat with the
19761 // first element of the second one.
19762 for (unsigned i = 0; i != NumElems/2; ++i)
19763 if (!isUndefOrEqual(SVOp->getMaskElt(i), i) ||
19764 !isUndefOrEqual(SVOp->getMaskElt(i+NumElems/2), NumElems))
19767 // If V1 is coming from a vector load then just fold to a VZEXT_LOAD.
19768 if (LoadSDNode *Ld = dyn_cast<LoadSDNode>(V1.getOperand(0))) {
19769 if (Ld->hasNUsesOfValue(1, 0)) {
19770 SDVTList Tys = DAG.getVTList(MVT::v4i64, MVT::Other);
19771 SDValue Ops[] = { Ld->getChain(), Ld->getBasePtr() };
19773 DAG.getMemIntrinsicNode(X86ISD::VZEXT_LOAD, dl, Tys, Ops,
19775 Ld->getPointerInfo(),
19776 Ld->getAlignment(),
19777 false/*isVolatile*/, true/*ReadMem*/,
19778 false/*WriteMem*/);
19780 // Make sure the newly-created LOAD is in the same position as Ld in
19781 // terms of dependency. We create a TokenFactor for Ld and ResNode,
19782 // and update uses of Ld's output chain to use the TokenFactor.
19783 if (Ld->hasAnyUseOfValue(1)) {
19784 SDValue NewChain = DAG.getNode(ISD::TokenFactor, dl, MVT::Other,
19785 SDValue(Ld, 1), SDValue(ResNode.getNode(), 1));
19786 DAG.ReplaceAllUsesOfValueWith(SDValue(Ld, 1), NewChain);
19787 DAG.UpdateNodeOperands(NewChain.getNode(), SDValue(Ld, 1),
19788 SDValue(ResNode.getNode(), 1));
19791 return DAG.getNode(ISD::BITCAST, dl, VT, ResNode);
19795 // Emit a zeroed vector and insert the desired subvector on its
19797 SDValue Zeros = getZeroVector(VT, Subtarget, DAG, dl);
19798 SDValue InsV = Insert128BitVector(Zeros, V1.getOperand(0), 0, DAG, dl);
19799 return DCI.CombineTo(N, InsV);
19802 //===--------------------------------------------------------------------===//
19803 // Combine some shuffles into subvector extracts and inserts:
19806 // vector_shuffle <4, 5, 6, 7, u, u, u, u> or <2, 3, u, u>
19807 if (isShuffleHigh128VectorInsertLow(SVOp)) {
19808 SDValue V = Extract128BitVector(V1, NumElems/2, DAG, dl);
19809 SDValue InsV = Insert128BitVector(DAG.getUNDEF(VT), V, 0, DAG, dl);
19810 return DCI.CombineTo(N, InsV);
19813 // vector_shuffle <u, u, u, u, 0, 1, 2, 3> or <u, u, 0, 1>
19814 if (isShuffleLow128VectorInsertHigh(SVOp)) {
19815 SDValue V = Extract128BitVector(V1, 0, DAG, dl);
19816 SDValue InsV = Insert128BitVector(DAG.getUNDEF(VT), V, NumElems/2, DAG, dl);
19817 return DCI.CombineTo(N, InsV);
19823 /// \brief Combine an arbitrary chain of shuffles into a single instruction if
19826 /// This is the leaf of the recursive combinine below. When we have found some
19827 /// chain of single-use x86 shuffle instructions and accumulated the combined
19828 /// shuffle mask represented by them, this will try to pattern match that mask
19829 /// into either a single instruction if there is a special purpose instruction
19830 /// for this operation, or into a PSHUFB instruction which is a fully general
19831 /// instruction but should only be used to replace chains over a certain depth.
19832 static bool combineX86ShuffleChain(SDValue Op, SDValue Root, ArrayRef<int> Mask,
19833 int Depth, bool HasPSHUFB, SelectionDAG &DAG,
19834 TargetLowering::DAGCombinerInfo &DCI,
19835 const X86Subtarget *Subtarget) {
19836 assert(!Mask.empty() && "Cannot combine an empty shuffle mask!");
19838 // Find the operand that enters the chain. Note that multiple uses are OK
19839 // here, we're not going to remove the operand we find.
19840 SDValue Input = Op.getOperand(0);
19841 while (Input.getOpcode() == ISD::BITCAST)
19842 Input = Input.getOperand(0);
19844 MVT VT = Input.getSimpleValueType();
19845 MVT RootVT = Root.getSimpleValueType();
19848 // Just remove no-op shuffle masks.
19849 if (Mask.size() == 1) {
19850 DCI.CombineTo(Root.getNode(), DAG.getNode(ISD::BITCAST, DL, RootVT, Input),
19855 // Use the float domain if the operand type is a floating point type.
19856 bool FloatDomain = VT.isFloatingPoint();
19858 // For floating point shuffles, we don't have free copies in the shuffle
19859 // instructions or the ability to load as part of the instruction, so
19860 // canonicalize their shuffles to UNPCK or MOV variants.
19862 // Note that even with AVX we prefer the PSHUFD form of shuffle for integer
19863 // vectors because it can have a load folded into it that UNPCK cannot. This
19864 // doesn't preclude something switching to the shorter encoding post-RA.
19866 if (Mask.equals(0, 0) || Mask.equals(1, 1)) {
19867 bool Lo = Mask.equals(0, 0);
19870 // Check if we have SSE3 which will let us use MOVDDUP. That instruction
19871 // is no slower than UNPCKLPD but has the option to fold the input operand
19872 // into even an unaligned memory load.
19873 if (Lo && Subtarget->hasSSE3()) {
19874 Shuffle = X86ISD::MOVDDUP;
19875 ShuffleVT = MVT::v2f64;
19877 // We have MOVLHPS and MOVHLPS throughout SSE and they encode smaller
19878 // than the UNPCK variants.
19879 Shuffle = Lo ? X86ISD::MOVLHPS : X86ISD::MOVHLPS;
19880 ShuffleVT = MVT::v4f32;
19882 if (Depth == 1 && Root->getOpcode() == Shuffle)
19883 return false; // Nothing to do!
19884 Op = DAG.getNode(ISD::BITCAST, DL, ShuffleVT, Input);
19885 DCI.AddToWorklist(Op.getNode());
19886 if (Shuffle == X86ISD::MOVDDUP)
19887 Op = DAG.getNode(Shuffle, DL, ShuffleVT, Op);
19889 Op = DAG.getNode(Shuffle, DL, ShuffleVT, Op, Op);
19890 DCI.AddToWorklist(Op.getNode());
19891 DCI.CombineTo(Root.getNode(), DAG.getNode(ISD::BITCAST, DL, RootVT, Op),
19895 if (Subtarget->hasSSE3() &&
19896 (Mask.equals(0, 0, 2, 2) || Mask.equals(1, 1, 3, 3))) {
19897 bool Lo = Mask.equals(0, 0, 2, 2);
19898 unsigned Shuffle = Lo ? X86ISD::MOVSLDUP : X86ISD::MOVSHDUP;
19899 MVT ShuffleVT = MVT::v4f32;
19900 if (Depth == 1 && Root->getOpcode() == Shuffle)
19901 return false; // Nothing to do!
19902 Op = DAG.getNode(ISD::BITCAST, DL, ShuffleVT, Input);
19903 DCI.AddToWorklist(Op.getNode());
19904 Op = DAG.getNode(Shuffle, DL, ShuffleVT, Op);
19905 DCI.AddToWorklist(Op.getNode());
19906 DCI.CombineTo(Root.getNode(), DAG.getNode(ISD::BITCAST, DL, RootVT, Op),
19910 if (Mask.equals(0, 0, 1, 1) || Mask.equals(2, 2, 3, 3)) {
19911 bool Lo = Mask.equals(0, 0, 1, 1);
19912 unsigned Shuffle = Lo ? X86ISD::UNPCKL : X86ISD::UNPCKH;
19913 MVT ShuffleVT = MVT::v4f32;
19914 if (Depth == 1 && Root->getOpcode() == Shuffle)
19915 return false; // Nothing to do!
19916 Op = DAG.getNode(ISD::BITCAST, DL, ShuffleVT, Input);
19917 DCI.AddToWorklist(Op.getNode());
19918 Op = DAG.getNode(Shuffle, DL, ShuffleVT, Op, Op);
19919 DCI.AddToWorklist(Op.getNode());
19920 DCI.CombineTo(Root.getNode(), DAG.getNode(ISD::BITCAST, DL, RootVT, Op),
19926 // We always canonicalize the 8 x i16 and 16 x i8 shuffles into their UNPCK
19927 // variants as none of these have single-instruction variants that are
19928 // superior to the UNPCK formulation.
19929 if (!FloatDomain &&
19930 (Mask.equals(0, 0, 1, 1, 2, 2, 3, 3) ||
19931 Mask.equals(4, 4, 5, 5, 6, 6, 7, 7) ||
19932 Mask.equals(0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7) ||
19933 Mask.equals(8, 8, 9, 9, 10, 10, 11, 11, 12, 12, 13, 13, 14, 14, 15,
19935 bool Lo = Mask[0] == 0;
19936 unsigned Shuffle = Lo ? X86ISD::UNPCKL : X86ISD::UNPCKH;
19937 if (Depth == 1 && Root->getOpcode() == Shuffle)
19938 return false; // Nothing to do!
19940 switch (Mask.size()) {
19942 ShuffleVT = MVT::v8i16;
19945 ShuffleVT = MVT::v16i8;
19948 llvm_unreachable("Impossible mask size!");
19950 Op = DAG.getNode(ISD::BITCAST, DL, ShuffleVT, Input);
19951 DCI.AddToWorklist(Op.getNode());
19952 Op = DAG.getNode(Shuffle, DL, ShuffleVT, Op, Op);
19953 DCI.AddToWorklist(Op.getNode());
19954 DCI.CombineTo(Root.getNode(), DAG.getNode(ISD::BITCAST, DL, RootVT, Op),
19959 // Don't try to re-form single instruction chains under any circumstances now
19960 // that we've done encoding canonicalization for them.
19964 // If we have 3 or more shuffle instructions or a chain involving PSHUFB, we
19965 // can replace them with a single PSHUFB instruction profitably. Intel's
19966 // manuals suggest only using PSHUFB if doing so replacing 5 instructions, but
19967 // in practice PSHUFB tends to be *very* fast so we're more aggressive.
19968 if ((Depth >= 3 || HasPSHUFB) && Subtarget->hasSSSE3()) {
19969 SmallVector<SDValue, 16> PSHUFBMask;
19970 assert(Mask.size() <= 16 && "Can't shuffle elements smaller than bytes!");
19971 int Ratio = 16 / Mask.size();
19972 for (unsigned i = 0; i < 16; ++i) {
19973 int M = Mask[i / Ratio] != SM_SentinelZero
19974 ? Ratio * Mask[i / Ratio] + i % Ratio
19976 PSHUFBMask.push_back(DAG.getConstant(M, MVT::i8));
19978 Op = DAG.getNode(ISD::BITCAST, DL, MVT::v16i8, Input);
19979 DCI.AddToWorklist(Op.getNode());
19980 SDValue PSHUFBMaskOp =
19981 DAG.getNode(ISD::BUILD_VECTOR, DL, MVT::v16i8, PSHUFBMask);
19982 DCI.AddToWorklist(PSHUFBMaskOp.getNode());
19983 Op = DAG.getNode(X86ISD::PSHUFB, DL, MVT::v16i8, Op, PSHUFBMaskOp);
19984 DCI.AddToWorklist(Op.getNode());
19985 DCI.CombineTo(Root.getNode(), DAG.getNode(ISD::BITCAST, DL, RootVT, Op),
19990 // Failed to find any combines.
19994 /// \brief Fully generic combining of x86 shuffle instructions.
19996 /// This should be the last combine run over the x86 shuffle instructions. Once
19997 /// they have been fully optimized, this will recursively consider all chains
19998 /// of single-use shuffle instructions, build a generic model of the cumulative
19999 /// shuffle operation, and check for simpler instructions which implement this
20000 /// operation. We use this primarily for two purposes:
20002 /// 1) Collapse generic shuffles to specialized single instructions when
20003 /// equivalent. In most cases, this is just an encoding size win, but
20004 /// sometimes we will collapse multiple generic shuffles into a single
20005 /// special-purpose shuffle.
20006 /// 2) Look for sequences of shuffle instructions with 3 or more total
20007 /// instructions, and replace them with the slightly more expensive SSSE3
20008 /// PSHUFB instruction if available. We do this as the last combining step
20009 /// to ensure we avoid using PSHUFB if we can implement the shuffle with
20010 /// a suitable short sequence of other instructions. The PHUFB will either
20011 /// use a register or have to read from memory and so is slightly (but only
20012 /// slightly) more expensive than the other shuffle instructions.
20014 /// Because this is inherently a quadratic operation (for each shuffle in
20015 /// a chain, we recurse up the chain), the depth is limited to 8 instructions.
20016 /// This should never be an issue in practice as the shuffle lowering doesn't
20017 /// produce sequences of more than 8 instructions.
20019 /// FIXME: We will currently miss some cases where the redundant shuffling
20020 /// would simplify under the threshold for PSHUFB formation because of
20021 /// combine-ordering. To fix this, we should do the redundant instruction
20022 /// combining in this recursive walk.
20023 static bool combineX86ShufflesRecursively(SDValue Op, SDValue Root,
20024 ArrayRef<int> RootMask,
20025 int Depth, bool HasPSHUFB,
20027 TargetLowering::DAGCombinerInfo &DCI,
20028 const X86Subtarget *Subtarget) {
20029 // Bound the depth of our recursive combine because this is ultimately
20030 // quadratic in nature.
20034 // Directly rip through bitcasts to find the underlying operand.
20035 while (Op.getOpcode() == ISD::BITCAST && Op.getOperand(0).hasOneUse())
20036 Op = Op.getOperand(0);
20038 MVT VT = Op.getSimpleValueType();
20039 if (!VT.isVector())
20040 return false; // Bail if we hit a non-vector.
20041 // FIXME: This routine should be taught about 256-bit shuffles, or a 256-bit
20042 // version should be added.
20043 if (VT.getSizeInBits() != 128)
20046 assert(Root.getSimpleValueType().isVector() &&
20047 "Shuffles operate on vector types!");
20048 assert(VT.getSizeInBits() == Root.getSimpleValueType().getSizeInBits() &&
20049 "Can only combine shuffles of the same vector register size.");
20051 if (!isTargetShuffle(Op.getOpcode()))
20053 SmallVector<int, 16> OpMask;
20055 bool HaveMask = getTargetShuffleMask(Op.getNode(), VT, OpMask, IsUnary);
20056 // We only can combine unary shuffles which we can decode the mask for.
20057 if (!HaveMask || !IsUnary)
20060 assert(VT.getVectorNumElements() == OpMask.size() &&
20061 "Different mask size from vector size!");
20062 assert(((RootMask.size() > OpMask.size() &&
20063 RootMask.size() % OpMask.size() == 0) ||
20064 (OpMask.size() > RootMask.size() &&
20065 OpMask.size() % RootMask.size() == 0) ||
20066 OpMask.size() == RootMask.size()) &&
20067 "The smaller number of elements must divide the larger.");
20068 int RootRatio = std::max<int>(1, OpMask.size() / RootMask.size());
20069 int OpRatio = std::max<int>(1, RootMask.size() / OpMask.size());
20070 assert(((RootRatio == 1 && OpRatio == 1) ||
20071 (RootRatio == 1) != (OpRatio == 1)) &&
20072 "Must not have a ratio for both incoming and op masks!");
20074 SmallVector<int, 16> Mask;
20075 Mask.reserve(std::max(OpMask.size(), RootMask.size()));
20077 // Merge this shuffle operation's mask into our accumulated mask. Note that
20078 // this shuffle's mask will be the first applied to the input, followed by the
20079 // root mask to get us all the way to the root value arrangement. The reason
20080 // for this order is that we are recursing up the operation chain.
20081 for (int i = 0, e = std::max(OpMask.size(), RootMask.size()); i < e; ++i) {
20082 int RootIdx = i / RootRatio;
20083 if (RootMask[RootIdx] == SM_SentinelZero) {
20084 // This is a zero-ed lane, we're done.
20085 Mask.push_back(SM_SentinelZero);
20089 int RootMaskedIdx = RootMask[RootIdx] * RootRatio + i % RootRatio;
20090 int OpIdx = RootMaskedIdx / OpRatio;
20091 if (OpMask[OpIdx] == SM_SentinelZero) {
20092 // The incoming lanes are zero, it doesn't matter which ones we are using.
20093 Mask.push_back(SM_SentinelZero);
20097 // Ok, we have non-zero lanes, map them through.
20098 Mask.push_back(OpMask[OpIdx] * OpRatio +
20099 RootMaskedIdx % OpRatio);
20102 // See if we can recurse into the operand to combine more things.
20103 switch (Op.getOpcode()) {
20104 case X86ISD::PSHUFB:
20106 case X86ISD::PSHUFD:
20107 case X86ISD::PSHUFHW:
20108 case X86ISD::PSHUFLW:
20109 if (Op.getOperand(0).hasOneUse() &&
20110 combineX86ShufflesRecursively(Op.getOperand(0), Root, Mask, Depth + 1,
20111 HasPSHUFB, DAG, DCI, Subtarget))
20115 case X86ISD::UNPCKL:
20116 case X86ISD::UNPCKH:
20117 assert(Op.getOperand(0) == Op.getOperand(1) && "We only combine unary shuffles!");
20118 // We can't check for single use, we have to check that this shuffle is the only user.
20119 if (Op->isOnlyUserOf(Op.getOperand(0).getNode()) &&
20120 combineX86ShufflesRecursively(Op.getOperand(0), Root, Mask, Depth + 1,
20121 HasPSHUFB, DAG, DCI, Subtarget))
20126 // Minor canonicalization of the accumulated shuffle mask to make it easier
20127 // to match below. All this does is detect masks with squential pairs of
20128 // elements, and shrink them to the half-width mask. It does this in a loop
20129 // so it will reduce the size of the mask to the minimal width mask which
20130 // performs an equivalent shuffle.
20131 while (Mask.size() > 1 && canWidenShuffleElements(Mask)) {
20132 for (int i = 0, e = Mask.size() / 2; i < e; ++i)
20133 Mask[i] = Mask[2 * i] / 2;
20134 Mask.resize(Mask.size() / 2);
20137 return combineX86ShuffleChain(Op, Root, Mask, Depth, HasPSHUFB, DAG, DCI,
20141 /// \brief Get the PSHUF-style mask from PSHUF node.
20143 /// This is a very minor wrapper around getTargetShuffleMask to easy forming v4
20144 /// PSHUF-style masks that can be reused with such instructions.
20145 static SmallVector<int, 4> getPSHUFShuffleMask(SDValue N) {
20146 SmallVector<int, 4> Mask;
20148 bool HaveMask = getTargetShuffleMask(N.getNode(), N.getSimpleValueType(), Mask, IsUnary);
20152 switch (N.getOpcode()) {
20153 case X86ISD::PSHUFD:
20155 case X86ISD::PSHUFLW:
20158 case X86ISD::PSHUFHW:
20159 Mask.erase(Mask.begin(), Mask.begin() + 4);
20160 for (int &M : Mask)
20164 llvm_unreachable("No valid shuffle instruction found!");
20168 /// \brief Search for a combinable shuffle across a chain ending in pshufd.
20170 /// We walk up the chain and look for a combinable shuffle, skipping over
20171 /// shuffles that we could hoist this shuffle's transformation past without
20172 /// altering anything.
20174 combineRedundantDWordShuffle(SDValue N, MutableArrayRef<int> Mask,
20176 TargetLowering::DAGCombinerInfo &DCI) {
20177 assert(N.getOpcode() == X86ISD::PSHUFD &&
20178 "Called with something other than an x86 128-bit half shuffle!");
20181 // Walk up a single-use chain looking for a combinable shuffle. Keep a stack
20182 // of the shuffles in the chain so that we can form a fresh chain to replace
20184 SmallVector<SDValue, 8> Chain;
20185 SDValue V = N.getOperand(0);
20186 for (; V.hasOneUse(); V = V.getOperand(0)) {
20187 switch (V.getOpcode()) {
20189 return SDValue(); // Nothing combined!
20192 // Skip bitcasts as we always know the type for the target specific
20196 case X86ISD::PSHUFD:
20197 // Found another dword shuffle.
20200 case X86ISD::PSHUFLW:
20201 // Check that the low words (being shuffled) are the identity in the
20202 // dword shuffle, and the high words are self-contained.
20203 if (Mask[0] != 0 || Mask[1] != 1 ||
20204 !(Mask[2] >= 2 && Mask[2] < 4 && Mask[3] >= 2 && Mask[3] < 4))
20207 Chain.push_back(V);
20210 case X86ISD::PSHUFHW:
20211 // Check that the high words (being shuffled) are the identity in the
20212 // dword shuffle, and the low words are self-contained.
20213 if (Mask[2] != 2 || Mask[3] != 3 ||
20214 !(Mask[0] >= 0 && Mask[0] < 2 && Mask[1] >= 0 && Mask[1] < 2))
20217 Chain.push_back(V);
20220 case X86ISD::UNPCKL:
20221 case X86ISD::UNPCKH:
20222 // For either i8 -> i16 or i16 -> i32 unpacks, we can combine a dword
20223 // shuffle into a preceding word shuffle.
20224 if (V.getValueType() != MVT::v16i8 && V.getValueType() != MVT::v8i16)
20227 // Search for a half-shuffle which we can combine with.
20228 unsigned CombineOp =
20229 V.getOpcode() == X86ISD::UNPCKL ? X86ISD::PSHUFLW : X86ISD::PSHUFHW;
20230 if (V.getOperand(0) != V.getOperand(1) ||
20231 !V->isOnlyUserOf(V.getOperand(0).getNode()))
20233 Chain.push_back(V);
20234 V = V.getOperand(0);
20236 switch (V.getOpcode()) {
20238 return SDValue(); // Nothing to combine.
20240 case X86ISD::PSHUFLW:
20241 case X86ISD::PSHUFHW:
20242 if (V.getOpcode() == CombineOp)
20245 Chain.push_back(V);
20249 V = V.getOperand(0);
20253 } while (V.hasOneUse());
20256 // Break out of the loop if we break out of the switch.
20260 if (!V.hasOneUse())
20261 // We fell out of the loop without finding a viable combining instruction.
20264 // Merge this node's mask and our incoming mask.
20265 SmallVector<int, 4> VMask = getPSHUFShuffleMask(V);
20266 for (int &M : Mask)
20268 V = DAG.getNode(V.getOpcode(), DL, V.getValueType(), V.getOperand(0),
20269 getV4X86ShuffleImm8ForMask(Mask, DAG));
20271 // Rebuild the chain around this new shuffle.
20272 while (!Chain.empty()) {
20273 SDValue W = Chain.pop_back_val();
20275 if (V.getValueType() != W.getOperand(0).getValueType())
20276 V = DAG.getNode(ISD::BITCAST, DL, W.getOperand(0).getValueType(), V);
20278 switch (W.getOpcode()) {
20280 llvm_unreachable("Only PSHUF and UNPCK instructions get here!");
20282 case X86ISD::UNPCKL:
20283 case X86ISD::UNPCKH:
20284 V = DAG.getNode(W.getOpcode(), DL, W.getValueType(), V, V);
20287 case X86ISD::PSHUFD:
20288 case X86ISD::PSHUFLW:
20289 case X86ISD::PSHUFHW:
20290 V = DAG.getNode(W.getOpcode(), DL, W.getValueType(), V, W.getOperand(1));
20294 if (V.getValueType() != N.getValueType())
20295 V = DAG.getNode(ISD::BITCAST, DL, N.getValueType(), V);
20297 // Return the new chain to replace N.
20301 /// \brief Search for a combinable shuffle across a chain ending in pshuflw or pshufhw.
20303 /// We walk up the chain, skipping shuffles of the other half and looking
20304 /// through shuffles which switch halves trying to find a shuffle of the same
20305 /// pair of dwords.
20306 static bool combineRedundantHalfShuffle(SDValue N, MutableArrayRef<int> Mask,
20308 TargetLowering::DAGCombinerInfo &DCI) {
20310 (N.getOpcode() == X86ISD::PSHUFLW || N.getOpcode() == X86ISD::PSHUFHW) &&
20311 "Called with something other than an x86 128-bit half shuffle!");
20313 unsigned CombineOpcode = N.getOpcode();
20315 // Walk up a single-use chain looking for a combinable shuffle.
20316 SDValue V = N.getOperand(0);
20317 for (; V.hasOneUse(); V = V.getOperand(0)) {
20318 switch (V.getOpcode()) {
20320 return false; // Nothing combined!
20323 // Skip bitcasts as we always know the type for the target specific
20327 case X86ISD::PSHUFLW:
20328 case X86ISD::PSHUFHW:
20329 if (V.getOpcode() == CombineOpcode)
20332 // Other-half shuffles are no-ops.
20335 // Break out of the loop if we break out of the switch.
20339 if (!V.hasOneUse())
20340 // We fell out of the loop without finding a viable combining instruction.
20343 // Combine away the bottom node as its shuffle will be accumulated into
20344 // a preceding shuffle.
20345 DCI.CombineTo(N.getNode(), N.getOperand(0), /*AddTo*/ true);
20347 // Record the old value.
20350 // Merge this node's mask and our incoming mask (adjusted to account for all
20351 // the pshufd instructions encountered).
20352 SmallVector<int, 4> VMask = getPSHUFShuffleMask(V);
20353 for (int &M : Mask)
20355 V = DAG.getNode(V.getOpcode(), DL, MVT::v8i16, V.getOperand(0),
20356 getV4X86ShuffleImm8ForMask(Mask, DAG));
20358 // Check that the shuffles didn't cancel each other out. If not, we need to
20359 // combine to the new one.
20361 // Replace the combinable shuffle with the combined one, updating all users
20362 // so that we re-evaluate the chain here.
20363 DCI.CombineTo(Old.getNode(), V, /*AddTo*/ true);
20368 /// \brief Try to combine x86 target specific shuffles.
20369 static SDValue PerformTargetShuffleCombine(SDValue N, SelectionDAG &DAG,
20370 TargetLowering::DAGCombinerInfo &DCI,
20371 const X86Subtarget *Subtarget) {
20373 MVT VT = N.getSimpleValueType();
20374 SmallVector<int, 4> Mask;
20376 switch (N.getOpcode()) {
20377 case X86ISD::PSHUFD:
20378 case X86ISD::PSHUFLW:
20379 case X86ISD::PSHUFHW:
20380 Mask = getPSHUFShuffleMask(N);
20381 assert(Mask.size() == 4);
20387 // Nuke no-op shuffles that show up after combining.
20388 if (isNoopShuffleMask(Mask))
20389 return DCI.CombineTo(N.getNode(), N.getOperand(0), /*AddTo*/ true);
20391 // Look for simplifications involving one or two shuffle instructions.
20392 SDValue V = N.getOperand(0);
20393 switch (N.getOpcode()) {
20396 case X86ISD::PSHUFLW:
20397 case X86ISD::PSHUFHW:
20398 assert(VT == MVT::v8i16);
20401 if (combineRedundantHalfShuffle(N, Mask, DAG, DCI))
20402 return SDValue(); // We combined away this shuffle, so we're done.
20404 // See if this reduces to a PSHUFD which is no more expensive and can
20405 // combine with more operations.
20406 if (canWidenShuffleElements(Mask)) {
20407 int DMask[] = {-1, -1, -1, -1};
20408 int DOffset = N.getOpcode() == X86ISD::PSHUFLW ? 0 : 2;
20409 DMask[DOffset + 0] = DOffset + Mask[0] / 2;
20410 DMask[DOffset + 1] = DOffset + Mask[2] / 2;
20411 V = DAG.getNode(ISD::BITCAST, DL, MVT::v4i32, V);
20412 DCI.AddToWorklist(V.getNode());
20413 V = DAG.getNode(X86ISD::PSHUFD, DL, MVT::v4i32, V,
20414 getV4X86ShuffleImm8ForMask(DMask, DAG));
20415 DCI.AddToWorklist(V.getNode());
20416 return DAG.getNode(ISD::BITCAST, DL, MVT::v8i16, V);
20419 // Look for shuffle patterns which can be implemented as a single unpack.
20420 // FIXME: This doesn't handle the location of the PSHUFD generically, and
20421 // only works when we have a PSHUFD followed by two half-shuffles.
20422 if (Mask[0] == Mask[1] && Mask[2] == Mask[3] &&
20423 (V.getOpcode() == X86ISD::PSHUFLW ||
20424 V.getOpcode() == X86ISD::PSHUFHW) &&
20425 V.getOpcode() != N.getOpcode() &&
20427 SDValue D = V.getOperand(0);
20428 while (D.getOpcode() == ISD::BITCAST && D.hasOneUse())
20429 D = D.getOperand(0);
20430 if (D.getOpcode() == X86ISD::PSHUFD && D.hasOneUse()) {
20431 SmallVector<int, 4> VMask = getPSHUFShuffleMask(V);
20432 SmallVector<int, 4> DMask = getPSHUFShuffleMask(D);
20433 int NOffset = N.getOpcode() == X86ISD::PSHUFLW ? 0 : 4;
20434 int VOffset = V.getOpcode() == X86ISD::PSHUFLW ? 0 : 4;
20436 for (int i = 0; i < 4; ++i) {
20437 WordMask[i + NOffset] = Mask[i] + NOffset;
20438 WordMask[i + VOffset] = VMask[i] + VOffset;
20440 // Map the word mask through the DWord mask.
20442 for (int i = 0; i < 8; ++i)
20443 MappedMask[i] = 2 * DMask[WordMask[i] / 2] + WordMask[i] % 2;
20444 const int UnpackLoMask[] = {0, 0, 1, 1, 2, 2, 3, 3};
20445 const int UnpackHiMask[] = {4, 4, 5, 5, 6, 6, 7, 7};
20446 if (std::equal(std::begin(MappedMask), std::end(MappedMask),
20447 std::begin(UnpackLoMask)) ||
20448 std::equal(std::begin(MappedMask), std::end(MappedMask),
20449 std::begin(UnpackHiMask))) {
20450 // We can replace all three shuffles with an unpack.
20451 V = DAG.getNode(ISD::BITCAST, DL, MVT::v8i16, D.getOperand(0));
20452 DCI.AddToWorklist(V.getNode());
20453 return DAG.getNode(MappedMask[0] == 0 ? X86ISD::UNPCKL
20455 DL, MVT::v8i16, V, V);
20462 case X86ISD::PSHUFD:
20463 if (SDValue NewN = combineRedundantDWordShuffle(N, Mask, DAG, DCI))
20472 /// \brief Try to combine a shuffle into a target-specific add-sub node.
20474 /// We combine this directly on the abstract vector shuffle nodes so it is
20475 /// easier to generically match. We also insert dummy vector shuffle nodes for
20476 /// the operands which explicitly discard the lanes which are unused by this
20477 /// operation to try to flow through the rest of the combiner the fact that
20478 /// they're unused.
20479 static SDValue combineShuffleToAddSub(SDNode *N, SelectionDAG &DAG) {
20481 EVT VT = N->getValueType(0);
20483 // We only handle target-independent shuffles.
20484 // FIXME: It would be easy and harmless to use the target shuffle mask
20485 // extraction tool to support more.
20486 if (N->getOpcode() != ISD::VECTOR_SHUFFLE)
20489 auto *SVN = cast<ShuffleVectorSDNode>(N);
20490 ArrayRef<int> Mask = SVN->getMask();
20491 SDValue V1 = N->getOperand(0);
20492 SDValue V2 = N->getOperand(1);
20494 // We require the first shuffle operand to be the SUB node, and the second to
20495 // be the ADD node.
20496 // FIXME: We should support the commuted patterns.
20497 if (V1->getOpcode() != ISD::FSUB || V2->getOpcode() != ISD::FADD)
20500 // If there are other uses of these operations we can't fold them.
20501 if (!V1->hasOneUse() || !V2->hasOneUse())
20504 // Ensure that both operations have the same operands. Note that we can
20505 // commute the FADD operands.
20506 SDValue LHS = V1->getOperand(0), RHS = V1->getOperand(1);
20507 if ((V2->getOperand(0) != LHS || V2->getOperand(1) != RHS) &&
20508 (V2->getOperand(0) != RHS || V2->getOperand(1) != LHS))
20511 // We're looking for blends between FADD and FSUB nodes. We insist on these
20512 // nodes being lined up in a specific expected pattern.
20513 if (!(isShuffleEquivalent(Mask, 0, 3) ||
20514 isShuffleEquivalent(Mask, 0, 5, 2, 7) ||
20515 isShuffleEquivalent(Mask, 0, 9, 2, 11, 4, 13, 6, 15)))
20518 // Only specific types are legal at this point, assert so we notice if and
20519 // when these change.
20520 assert((VT == MVT::v4f32 || VT == MVT::v2f64 || VT == MVT::v8f32 ||
20521 VT == MVT::v4f64) &&
20522 "Unknown vector type encountered!");
20524 return DAG.getNode(X86ISD::ADDSUB, DL, VT, LHS, RHS);
20527 /// PerformShuffleCombine - Performs several different shuffle combines.
20528 static SDValue PerformShuffleCombine(SDNode *N, SelectionDAG &DAG,
20529 TargetLowering::DAGCombinerInfo &DCI,
20530 const X86Subtarget *Subtarget) {
20532 SDValue N0 = N->getOperand(0);
20533 SDValue N1 = N->getOperand(1);
20534 EVT VT = N->getValueType(0);
20536 // Don't create instructions with illegal types after legalize types has run.
20537 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
20538 if (!DCI.isBeforeLegalize() && !TLI.isTypeLegal(VT.getVectorElementType()))
20541 // If we have legalized the vector types, look for blends of FADD and FSUB
20542 // nodes that we can fuse into an ADDSUB node.
20543 if (TLI.isTypeLegal(VT) && Subtarget->hasSSE3())
20544 if (SDValue AddSub = combineShuffleToAddSub(N, DAG))
20547 // Combine 256-bit vector shuffles. This is only profitable when in AVX mode
20548 if (Subtarget->hasFp256() && VT.is256BitVector() &&
20549 N->getOpcode() == ISD::VECTOR_SHUFFLE)
20550 return PerformShuffleCombine256(N, DAG, DCI, Subtarget);
20552 // During Type Legalization, when promoting illegal vector types,
20553 // the backend might introduce new shuffle dag nodes and bitcasts.
20555 // This code performs the following transformation:
20556 // fold: (shuffle (bitcast (BINOP A, B)), Undef, <Mask>) ->
20557 // (shuffle (BINOP (bitcast A), (bitcast B)), Undef, <Mask>)
20559 // We do this only if both the bitcast and the BINOP dag nodes have
20560 // one use. Also, perform this transformation only if the new binary
20561 // operation is legal. This is to avoid introducing dag nodes that
20562 // potentially need to be further expanded (or custom lowered) into a
20563 // less optimal sequence of dag nodes.
20564 if (!DCI.isBeforeLegalize() && DCI.isBeforeLegalizeOps() &&
20565 N1.getOpcode() == ISD::UNDEF && N0.hasOneUse() &&
20566 N0.getOpcode() == ISD::BITCAST) {
20567 SDValue BC0 = N0.getOperand(0);
20568 EVT SVT = BC0.getValueType();
20569 unsigned Opcode = BC0.getOpcode();
20570 unsigned NumElts = VT.getVectorNumElements();
20572 if (BC0.hasOneUse() && SVT.isVector() &&
20573 SVT.getVectorNumElements() * 2 == NumElts &&
20574 TLI.isOperationLegal(Opcode, VT)) {
20575 bool CanFold = false;
20587 unsigned SVTNumElts = SVT.getVectorNumElements();
20588 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(N);
20589 for (unsigned i = 0, e = SVTNumElts; i != e && CanFold; ++i)
20590 CanFold = SVOp->getMaskElt(i) == (int)(i * 2);
20591 for (unsigned i = SVTNumElts, e = NumElts; i != e && CanFold; ++i)
20592 CanFold = SVOp->getMaskElt(i) < 0;
20595 SDValue BC00 = DAG.getNode(ISD::BITCAST, dl, VT, BC0.getOperand(0));
20596 SDValue BC01 = DAG.getNode(ISD::BITCAST, dl, VT, BC0.getOperand(1));
20597 SDValue NewBinOp = DAG.getNode(BC0.getOpcode(), dl, VT, BC00, BC01);
20598 return DAG.getVectorShuffle(VT, dl, NewBinOp, N1, &SVOp->getMask()[0]);
20603 // Only handle 128 wide vector from here on.
20604 if (!VT.is128BitVector())
20607 // Combine a vector_shuffle that is equal to build_vector load1, load2, load3,
20608 // load4, <0, 1, 2, 3> into a 128-bit load if the load addresses are
20609 // consecutive, non-overlapping, and in the right order.
20610 SmallVector<SDValue, 16> Elts;
20611 for (unsigned i = 0, e = VT.getVectorNumElements(); i != e; ++i)
20612 Elts.push_back(getShuffleScalarElt(N, i, DAG, 0));
20614 SDValue LD = EltsFromConsecutiveLoads(VT, Elts, dl, DAG, true);
20618 if (isTargetShuffle(N->getOpcode())) {
20620 PerformTargetShuffleCombine(SDValue(N, 0), DAG, DCI, Subtarget);
20621 if (Shuffle.getNode())
20624 // Try recursively combining arbitrary sequences of x86 shuffle
20625 // instructions into higher-order shuffles. We do this after combining
20626 // specific PSHUF instruction sequences into their minimal form so that we
20627 // can evaluate how many specialized shuffle instructions are involved in
20628 // a particular chain.
20629 SmallVector<int, 1> NonceMask; // Just a placeholder.
20630 NonceMask.push_back(0);
20631 if (combineX86ShufflesRecursively(SDValue(N, 0), SDValue(N, 0), NonceMask,
20632 /*Depth*/ 1, /*HasPSHUFB*/ false, DAG,
20634 return SDValue(); // This routine will use CombineTo to replace N.
20640 /// PerformTruncateCombine - Converts truncate operation to
20641 /// a sequence of vector shuffle operations.
20642 /// It is possible when we truncate 256-bit vector to 128-bit vector
20643 static SDValue PerformTruncateCombine(SDNode *N, SelectionDAG &DAG,
20644 TargetLowering::DAGCombinerInfo &DCI,
20645 const X86Subtarget *Subtarget) {
20649 /// XFormVExtractWithShuffleIntoLoad - Check if a vector extract from a target
20650 /// specific shuffle of a load can be folded into a single element load.
20651 /// Similar handling for VECTOR_SHUFFLE is performed by DAGCombiner, but
20652 /// shuffles have been customed lowered so we need to handle those here.
20653 static SDValue XFormVExtractWithShuffleIntoLoad(SDNode *N, SelectionDAG &DAG,
20654 TargetLowering::DAGCombinerInfo &DCI) {
20655 if (DCI.isBeforeLegalizeOps())
20658 SDValue InVec = N->getOperand(0);
20659 SDValue EltNo = N->getOperand(1);
20661 if (!isa<ConstantSDNode>(EltNo))
20664 EVT VT = InVec.getValueType();
20666 if (InVec.getOpcode() == ISD::BITCAST) {
20667 // Don't duplicate a load with other uses.
20668 if (!InVec.hasOneUse())
20670 EVT BCVT = InVec.getOperand(0).getValueType();
20671 if (BCVT.getVectorNumElements() != VT.getVectorNumElements())
20673 InVec = InVec.getOperand(0);
20676 if (!isTargetShuffle(InVec.getOpcode()))
20679 // Don't duplicate a load with other uses.
20680 if (!InVec.hasOneUse())
20683 SmallVector<int, 16> ShuffleMask;
20685 if (!getTargetShuffleMask(InVec.getNode(), VT.getSimpleVT(), ShuffleMask,
20689 // Select the input vector, guarding against out of range extract vector.
20690 unsigned NumElems = VT.getVectorNumElements();
20691 int Elt = cast<ConstantSDNode>(EltNo)->getZExtValue();
20692 int Idx = (Elt > (int)NumElems) ? -1 : ShuffleMask[Elt];
20693 SDValue LdNode = (Idx < (int)NumElems) ? InVec.getOperand(0)
20694 : InVec.getOperand(1);
20696 // If inputs to shuffle are the same for both ops, then allow 2 uses
20697 unsigned AllowedUses = InVec.getOperand(0) == InVec.getOperand(1) ? 2 : 1;
20699 if (LdNode.getOpcode() == ISD::BITCAST) {
20700 // Don't duplicate a load with other uses.
20701 if (!LdNode.getNode()->hasNUsesOfValue(AllowedUses, 0))
20704 AllowedUses = 1; // only allow 1 load use if we have a bitcast
20705 LdNode = LdNode.getOperand(0);
20708 if (!ISD::isNormalLoad(LdNode.getNode()))
20711 LoadSDNode *LN0 = cast<LoadSDNode>(LdNode);
20713 if (!LN0 ||!LN0->hasNUsesOfValue(AllowedUses, 0) || LN0->isVolatile())
20716 EVT EltVT = N->getValueType(0);
20717 // If there's a bitcast before the shuffle, check if the load type and
20718 // alignment is valid.
20719 unsigned Align = LN0->getAlignment();
20720 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
20721 unsigned NewAlign = TLI.getDataLayout()->getABITypeAlignment(
20722 EltVT.getTypeForEVT(*DAG.getContext()));
20724 if (NewAlign > Align || !TLI.isOperationLegalOrCustom(ISD::LOAD, EltVT))
20727 // All checks match so transform back to vector_shuffle so that DAG combiner
20728 // can finish the job
20731 // Create shuffle node taking into account the case that its a unary shuffle
20732 SDValue Shuffle = (UnaryShuffle) ? DAG.getUNDEF(VT) : InVec.getOperand(1);
20733 Shuffle = DAG.getVectorShuffle(InVec.getValueType(), dl,
20734 InVec.getOperand(0), Shuffle,
20736 Shuffle = DAG.getNode(ISD::BITCAST, dl, VT, Shuffle);
20737 return DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, N->getValueType(0), Shuffle,
20741 /// PerformEXTRACT_VECTOR_ELTCombine - Detect vector gather/scatter index
20742 /// generation and convert it from being a bunch of shuffles and extracts
20743 /// to a simple store and scalar loads to extract the elements.
20744 static SDValue PerformEXTRACT_VECTOR_ELTCombine(SDNode *N, SelectionDAG &DAG,
20745 TargetLowering::DAGCombinerInfo &DCI) {
20746 SDValue NewOp = XFormVExtractWithShuffleIntoLoad(N, DAG, DCI);
20747 if (NewOp.getNode())
20750 SDValue InputVector = N->getOperand(0);
20752 // Detect whether we are trying to convert from mmx to i32 and the bitcast
20753 // from mmx to v2i32 has a single usage.
20754 if (InputVector.getNode()->getOpcode() == llvm::ISD::BITCAST &&
20755 InputVector.getNode()->getOperand(0).getValueType() == MVT::x86mmx &&
20756 InputVector.hasOneUse() && N->getValueType(0) == MVT::i32)
20757 return DAG.getNode(X86ISD::MMX_MOVD2W, SDLoc(InputVector),
20758 N->getValueType(0),
20759 InputVector.getNode()->getOperand(0));
20761 // Only operate on vectors of 4 elements, where the alternative shuffling
20762 // gets to be more expensive.
20763 if (InputVector.getValueType() != MVT::v4i32)
20766 // Check whether every use of InputVector is an EXTRACT_VECTOR_ELT with a
20767 // single use which is a sign-extend or zero-extend, and all elements are
20769 SmallVector<SDNode *, 4> Uses;
20770 unsigned ExtractedElements = 0;
20771 for (SDNode::use_iterator UI = InputVector.getNode()->use_begin(),
20772 UE = InputVector.getNode()->use_end(); UI != UE; ++UI) {
20773 if (UI.getUse().getResNo() != InputVector.getResNo())
20776 SDNode *Extract = *UI;
20777 if (Extract->getOpcode() != ISD::EXTRACT_VECTOR_ELT)
20780 if (Extract->getValueType(0) != MVT::i32)
20782 if (!Extract->hasOneUse())
20784 if (Extract->use_begin()->getOpcode() != ISD::SIGN_EXTEND &&
20785 Extract->use_begin()->getOpcode() != ISD::ZERO_EXTEND)
20787 if (!isa<ConstantSDNode>(Extract->getOperand(1)))
20790 // Record which element was extracted.
20791 ExtractedElements |=
20792 1 << cast<ConstantSDNode>(Extract->getOperand(1))->getZExtValue();
20794 Uses.push_back(Extract);
20797 // If not all the elements were used, this may not be worthwhile.
20798 if (ExtractedElements != 15)
20801 // Ok, we've now decided to do the transformation.
20802 SDLoc dl(InputVector);
20804 // Store the value to a temporary stack slot.
20805 SDValue StackPtr = DAG.CreateStackTemporary(InputVector.getValueType());
20806 SDValue Ch = DAG.getStore(DAG.getEntryNode(), dl, InputVector, StackPtr,
20807 MachinePointerInfo(), false, false, 0);
20809 // Replace each use (extract) with a load of the appropriate element.
20810 for (SmallVectorImpl<SDNode *>::iterator UI = Uses.begin(),
20811 UE = Uses.end(); UI != UE; ++UI) {
20812 SDNode *Extract = *UI;
20814 // cOMpute the element's address.
20815 SDValue Idx = Extract->getOperand(1);
20817 InputVector.getValueType().getVectorElementType().getSizeInBits()/8;
20818 uint64_t Offset = EltSize * cast<ConstantSDNode>(Idx)->getZExtValue();
20819 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
20820 SDValue OffsetVal = DAG.getConstant(Offset, TLI.getPointerTy());
20822 SDValue ScalarAddr = DAG.getNode(ISD::ADD, dl, TLI.getPointerTy(),
20823 StackPtr, OffsetVal);
20825 // Load the scalar.
20826 SDValue LoadScalar = DAG.getLoad(Extract->getValueType(0), dl, Ch,
20827 ScalarAddr, MachinePointerInfo(),
20828 false, false, false, 0);
20830 // Replace the exact with the load.
20831 DAG.ReplaceAllUsesOfValueWith(SDValue(Extract, 0), LoadScalar);
20834 // The replacement was made in place; don't return anything.
20838 /// \brief Matches a VSELECT onto min/max or return 0 if the node doesn't match.
20839 static std::pair<unsigned, bool>
20840 matchIntegerMINMAX(SDValue Cond, EVT VT, SDValue LHS, SDValue RHS,
20841 SelectionDAG &DAG, const X86Subtarget *Subtarget) {
20842 if (!VT.isVector())
20843 return std::make_pair(0, false);
20845 bool NeedSplit = false;
20846 switch (VT.getSimpleVT().SimpleTy) {
20847 default: return std::make_pair(0, false);
20851 if (!Subtarget->hasAVX2())
20853 if (!Subtarget->hasAVX())
20854 return std::make_pair(0, false);
20859 if (!Subtarget->hasSSE2())
20860 return std::make_pair(0, false);
20863 // SSE2 has only a small subset of the operations.
20864 bool hasUnsigned = Subtarget->hasSSE41() ||
20865 (Subtarget->hasSSE2() && VT == MVT::v16i8);
20866 bool hasSigned = Subtarget->hasSSE41() ||
20867 (Subtarget->hasSSE2() && VT == MVT::v8i16);
20869 ISD::CondCode CC = cast<CondCodeSDNode>(Cond.getOperand(2))->get();
20872 // Check for x CC y ? x : y.
20873 if (DAG.isEqualTo(LHS, Cond.getOperand(0)) &&
20874 DAG.isEqualTo(RHS, Cond.getOperand(1))) {
20879 Opc = hasUnsigned ? X86ISD::UMIN : 0; break;
20882 Opc = hasUnsigned ? X86ISD::UMAX : 0; break;
20885 Opc = hasSigned ? X86ISD::SMIN : 0; break;
20888 Opc = hasSigned ? X86ISD::SMAX : 0; break;
20890 // Check for x CC y ? y : x -- a min/max with reversed arms.
20891 } else if (DAG.isEqualTo(LHS, Cond.getOperand(1)) &&
20892 DAG.isEqualTo(RHS, Cond.getOperand(0))) {
20897 Opc = hasUnsigned ? X86ISD::UMAX : 0; break;
20900 Opc = hasUnsigned ? X86ISD::UMIN : 0; break;
20903 Opc = hasSigned ? X86ISD::SMAX : 0; break;
20906 Opc = hasSigned ? X86ISD::SMIN : 0; break;
20910 return std::make_pair(Opc, NeedSplit);
20914 TransformVSELECTtoBlendVECTOR_SHUFFLE(SDNode *N, SelectionDAG &DAG,
20915 const X86Subtarget *Subtarget) {
20917 SDValue Cond = N->getOperand(0);
20918 SDValue LHS = N->getOperand(1);
20919 SDValue RHS = N->getOperand(2);
20921 if (Cond.getOpcode() == ISD::SIGN_EXTEND) {
20922 SDValue CondSrc = Cond->getOperand(0);
20923 if (CondSrc->getOpcode() == ISD::SIGN_EXTEND_INREG)
20924 Cond = CondSrc->getOperand(0);
20927 MVT VT = N->getSimpleValueType(0);
20928 MVT EltVT = VT.getVectorElementType();
20929 unsigned NumElems = VT.getVectorNumElements();
20930 // There is no blend with immediate in AVX-512.
20931 if (VT.is512BitVector())
20934 if (!Subtarget->hasSSE41() || EltVT == MVT::i8)
20936 if (!Subtarget->hasInt256() && VT == MVT::v16i16)
20939 if (!ISD::isBuildVectorOfConstantSDNodes(Cond.getNode()))
20942 // A vselect where all conditions and data are constants can be optimized into
20943 // a single vector load by SelectionDAGLegalize::ExpandBUILD_VECTOR().
20944 if (ISD::isBuildVectorOfConstantSDNodes(LHS.getNode()) &&
20945 ISD::isBuildVectorOfConstantSDNodes(RHS.getNode()))
20948 unsigned MaskValue = 0;
20949 if (!BUILD_VECTORtoBlendMask(cast<BuildVectorSDNode>(Cond), MaskValue))
20952 SmallVector<int, 8> ShuffleMask(NumElems, -1);
20953 for (unsigned i = 0; i < NumElems; ++i) {
20954 // Be sure we emit undef where we can.
20955 if (Cond.getOperand(i)->getOpcode() == ISD::UNDEF)
20956 ShuffleMask[i] = -1;
20958 ShuffleMask[i] = i + NumElems * ((MaskValue >> i) & 1);
20961 return DAG.getVectorShuffle(VT, dl, LHS, RHS, &ShuffleMask[0]);
20964 /// PerformSELECTCombine - Do target-specific dag combines on SELECT and VSELECT
20966 static SDValue PerformSELECTCombine(SDNode *N, SelectionDAG &DAG,
20967 TargetLowering::DAGCombinerInfo &DCI,
20968 const X86Subtarget *Subtarget) {
20970 SDValue Cond = N->getOperand(0);
20971 // Get the LHS/RHS of the select.
20972 SDValue LHS = N->getOperand(1);
20973 SDValue RHS = N->getOperand(2);
20974 EVT VT = LHS.getValueType();
20975 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
20977 // If we have SSE[12] support, try to form min/max nodes. SSE min/max
20978 // instructions match the semantics of the common C idiom x<y?x:y but not
20979 // x<=y?x:y, because of how they handle negative zero (which can be
20980 // ignored in unsafe-math mode).
20981 if (Cond.getOpcode() == ISD::SETCC && VT.isFloatingPoint() &&
20982 VT != MVT::f80 && TLI.isTypeLegal(VT) &&
20983 (Subtarget->hasSSE2() ||
20984 (Subtarget->hasSSE1() && VT.getScalarType() == MVT::f32))) {
20985 ISD::CondCode CC = cast<CondCodeSDNode>(Cond.getOperand(2))->get();
20987 unsigned Opcode = 0;
20988 // Check for x CC y ? x : y.
20989 if (DAG.isEqualTo(LHS, Cond.getOperand(0)) &&
20990 DAG.isEqualTo(RHS, Cond.getOperand(1))) {
20994 // Converting this to a min would handle NaNs incorrectly, and swapping
20995 // the operands would cause it to handle comparisons between positive
20996 // and negative zero incorrectly.
20997 if (!DAG.isKnownNeverNaN(LHS) || !DAG.isKnownNeverNaN(RHS)) {
20998 if (!DAG.getTarget().Options.UnsafeFPMath &&
20999 !(DAG.isKnownNeverZero(LHS) || DAG.isKnownNeverZero(RHS)))
21001 std::swap(LHS, RHS);
21003 Opcode = X86ISD::FMIN;
21006 // Converting this to a min would handle comparisons between positive
21007 // and negative zero incorrectly.
21008 if (!DAG.getTarget().Options.UnsafeFPMath &&
21009 !DAG.isKnownNeverZero(LHS) && !DAG.isKnownNeverZero(RHS))
21011 Opcode = X86ISD::FMIN;
21014 // Converting this to a min would handle both negative zeros and NaNs
21015 // incorrectly, but we can swap the operands to fix both.
21016 std::swap(LHS, RHS);
21020 Opcode = X86ISD::FMIN;
21024 // Converting this to a max would handle comparisons between positive
21025 // and negative zero incorrectly.
21026 if (!DAG.getTarget().Options.UnsafeFPMath &&
21027 !DAG.isKnownNeverZero(LHS) && !DAG.isKnownNeverZero(RHS))
21029 Opcode = X86ISD::FMAX;
21032 // Converting this to a max would handle NaNs incorrectly, and swapping
21033 // the operands would cause it to handle comparisons between positive
21034 // and negative zero incorrectly.
21035 if (!DAG.isKnownNeverNaN(LHS) || !DAG.isKnownNeverNaN(RHS)) {
21036 if (!DAG.getTarget().Options.UnsafeFPMath &&
21037 !(DAG.isKnownNeverZero(LHS) || DAG.isKnownNeverZero(RHS)))
21039 std::swap(LHS, RHS);
21041 Opcode = X86ISD::FMAX;
21044 // Converting this to a max would handle both negative zeros and NaNs
21045 // incorrectly, but we can swap the operands to fix both.
21046 std::swap(LHS, RHS);
21050 Opcode = X86ISD::FMAX;
21053 // Check for x CC y ? y : x -- a min/max with reversed arms.
21054 } else if (DAG.isEqualTo(LHS, Cond.getOperand(1)) &&
21055 DAG.isEqualTo(RHS, Cond.getOperand(0))) {
21059 // Converting this to a min would handle comparisons between positive
21060 // and negative zero incorrectly, and swapping the operands would
21061 // cause it to handle NaNs incorrectly.
21062 if (!DAG.getTarget().Options.UnsafeFPMath &&
21063 !(DAG.isKnownNeverZero(LHS) || DAG.isKnownNeverZero(RHS))) {
21064 if (!DAG.isKnownNeverNaN(LHS) || !DAG.isKnownNeverNaN(RHS))
21066 std::swap(LHS, RHS);
21068 Opcode = X86ISD::FMIN;
21071 // Converting this to a min would handle NaNs incorrectly.
21072 if (!DAG.getTarget().Options.UnsafeFPMath &&
21073 (!DAG.isKnownNeverNaN(LHS) || !DAG.isKnownNeverNaN(RHS)))
21075 Opcode = X86ISD::FMIN;
21078 // Converting this to a min would handle both negative zeros and NaNs
21079 // incorrectly, but we can swap the operands to fix both.
21080 std::swap(LHS, RHS);
21084 Opcode = X86ISD::FMIN;
21088 // Converting this to a max would handle NaNs incorrectly.
21089 if (!DAG.isKnownNeverNaN(LHS) || !DAG.isKnownNeverNaN(RHS))
21091 Opcode = X86ISD::FMAX;
21094 // Converting this to a max would handle comparisons between positive
21095 // and negative zero incorrectly, and swapping the operands would
21096 // cause it to handle NaNs incorrectly.
21097 if (!DAG.getTarget().Options.UnsafeFPMath &&
21098 !DAG.isKnownNeverZero(LHS) && !DAG.isKnownNeverZero(RHS)) {
21099 if (!DAG.isKnownNeverNaN(LHS) || !DAG.isKnownNeverNaN(RHS))
21101 std::swap(LHS, RHS);
21103 Opcode = X86ISD::FMAX;
21106 // Converting this to a max would handle both negative zeros and NaNs
21107 // incorrectly, but we can swap the operands to fix both.
21108 std::swap(LHS, RHS);
21112 Opcode = X86ISD::FMAX;
21118 return DAG.getNode(Opcode, DL, N->getValueType(0), LHS, RHS);
21121 EVT CondVT = Cond.getValueType();
21122 if (Subtarget->hasAVX512() && VT.isVector() && CondVT.isVector() &&
21123 CondVT.getVectorElementType() == MVT::i1) {
21124 // v16i8 (select v16i1, v16i8, v16i8) does not have a proper
21125 // lowering on KNL. In this case we convert it to
21126 // v16i8 (select v16i8, v16i8, v16i8) and use AVX instruction.
21127 // The same situation for all 128 and 256-bit vectors of i8 and i16.
21128 // Since SKX these selects have a proper lowering.
21129 EVT OpVT = LHS.getValueType();
21130 if ((OpVT.is128BitVector() || OpVT.is256BitVector()) &&
21131 (OpVT.getVectorElementType() == MVT::i8 ||
21132 OpVT.getVectorElementType() == MVT::i16) &&
21133 !(Subtarget->hasBWI() && Subtarget->hasVLX())) {
21134 Cond = DAG.getNode(ISD::SIGN_EXTEND, DL, OpVT, Cond);
21135 DCI.AddToWorklist(Cond.getNode());
21136 return DAG.getNode(N->getOpcode(), DL, OpVT, Cond, LHS, RHS);
21139 // If this is a select between two integer constants, try to do some
21141 if (ConstantSDNode *TrueC = dyn_cast<ConstantSDNode>(LHS)) {
21142 if (ConstantSDNode *FalseC = dyn_cast<ConstantSDNode>(RHS))
21143 // Don't do this for crazy integer types.
21144 if (DAG.getTargetLoweringInfo().isTypeLegal(LHS.getValueType())) {
21145 // If this is efficiently invertible, canonicalize the LHSC/RHSC values
21146 // so that TrueC (the true value) is larger than FalseC.
21147 bool NeedsCondInvert = false;
21149 if (TrueC->getAPIntValue().ult(FalseC->getAPIntValue()) &&
21150 // Efficiently invertible.
21151 (Cond.getOpcode() == ISD::SETCC || // setcc -> invertible.
21152 (Cond.getOpcode() == ISD::XOR && // xor(X, C) -> invertible.
21153 isa<ConstantSDNode>(Cond.getOperand(1))))) {
21154 NeedsCondInvert = true;
21155 std::swap(TrueC, FalseC);
21158 // Optimize C ? 8 : 0 -> zext(C) << 3. Likewise for any pow2/0.
21159 if (FalseC->getAPIntValue() == 0 &&
21160 TrueC->getAPIntValue().isPowerOf2()) {
21161 if (NeedsCondInvert) // Invert the condition if needed.
21162 Cond = DAG.getNode(ISD::XOR, DL, Cond.getValueType(), Cond,
21163 DAG.getConstant(1, Cond.getValueType()));
21165 // Zero extend the condition if needed.
21166 Cond = DAG.getNode(ISD::ZERO_EXTEND, DL, LHS.getValueType(), Cond);
21168 unsigned ShAmt = TrueC->getAPIntValue().logBase2();
21169 return DAG.getNode(ISD::SHL, DL, LHS.getValueType(), Cond,
21170 DAG.getConstant(ShAmt, MVT::i8));
21173 // Optimize Cond ? cst+1 : cst -> zext(setcc(C)+cst.
21174 if (FalseC->getAPIntValue()+1 == TrueC->getAPIntValue()) {
21175 if (NeedsCondInvert) // Invert the condition if needed.
21176 Cond = DAG.getNode(ISD::XOR, DL, Cond.getValueType(), Cond,
21177 DAG.getConstant(1, Cond.getValueType()));
21179 // Zero extend the condition if needed.
21180 Cond = DAG.getNode(ISD::ZERO_EXTEND, DL,
21181 FalseC->getValueType(0), Cond);
21182 return DAG.getNode(ISD::ADD, DL, Cond.getValueType(), Cond,
21183 SDValue(FalseC, 0));
21186 // Optimize cases that will turn into an LEA instruction. This requires
21187 // an i32 or i64 and an efficient multiplier (1, 2, 3, 4, 5, 8, 9).
21188 if (N->getValueType(0) == MVT::i32 || N->getValueType(0) == MVT::i64) {
21189 uint64_t Diff = TrueC->getZExtValue()-FalseC->getZExtValue();
21190 if (N->getValueType(0) == MVT::i32) Diff = (unsigned)Diff;
21192 bool isFastMultiplier = false;
21194 switch ((unsigned char)Diff) {
21196 case 1: // result = add base, cond
21197 case 2: // result = lea base( , cond*2)
21198 case 3: // result = lea base(cond, cond*2)
21199 case 4: // result = lea base( , cond*4)
21200 case 5: // result = lea base(cond, cond*4)
21201 case 8: // result = lea base( , cond*8)
21202 case 9: // result = lea base(cond, cond*8)
21203 isFastMultiplier = true;
21208 if (isFastMultiplier) {
21209 APInt Diff = TrueC->getAPIntValue()-FalseC->getAPIntValue();
21210 if (NeedsCondInvert) // Invert the condition if needed.
21211 Cond = DAG.getNode(ISD::XOR, DL, Cond.getValueType(), Cond,
21212 DAG.getConstant(1, Cond.getValueType()));
21214 // Zero extend the condition if needed.
21215 Cond = DAG.getNode(ISD::ZERO_EXTEND, DL, FalseC->getValueType(0),
21217 // Scale the condition by the difference.
21219 Cond = DAG.getNode(ISD::MUL, DL, Cond.getValueType(), Cond,
21220 DAG.getConstant(Diff, Cond.getValueType()));
21222 // Add the base if non-zero.
21223 if (FalseC->getAPIntValue() != 0)
21224 Cond = DAG.getNode(ISD::ADD, DL, Cond.getValueType(), Cond,
21225 SDValue(FalseC, 0));
21232 // Canonicalize max and min:
21233 // (x > y) ? x : y -> (x >= y) ? x : y
21234 // (x < y) ? x : y -> (x <= y) ? x : y
21235 // This allows use of COND_S / COND_NS (see TranslateX86CC) which eliminates
21236 // the need for an extra compare
21237 // against zero. e.g.
21238 // (x - y) > 0 : (x - y) ? 0 -> (x - y) >= 0 : (x - y) ? 0
21240 // testl %edi, %edi
21242 // cmovgl %edi, %eax
21246 // cmovsl %eax, %edi
21247 if (N->getOpcode() == ISD::SELECT && Cond.getOpcode() == ISD::SETCC &&
21248 DAG.isEqualTo(LHS, Cond.getOperand(0)) &&
21249 DAG.isEqualTo(RHS, Cond.getOperand(1))) {
21250 ISD::CondCode CC = cast<CondCodeSDNode>(Cond.getOperand(2))->get();
21255 ISD::CondCode NewCC = (CC == ISD::SETLT) ? ISD::SETLE : ISD::SETGE;
21256 Cond = DAG.getSetCC(SDLoc(Cond), Cond.getValueType(),
21257 Cond.getOperand(0), Cond.getOperand(1), NewCC);
21258 return DAG.getNode(ISD::SELECT, DL, VT, Cond, LHS, RHS);
21263 // Early exit check
21264 if (!TLI.isTypeLegal(VT))
21267 // Match VSELECTs into subs with unsigned saturation.
21268 if (N->getOpcode() == ISD::VSELECT && Cond.getOpcode() == ISD::SETCC &&
21269 // psubus is available in SSE2 and AVX2 for i8 and i16 vectors.
21270 ((Subtarget->hasSSE2() && (VT == MVT::v16i8 || VT == MVT::v8i16)) ||
21271 (Subtarget->hasAVX2() && (VT == MVT::v32i8 || VT == MVT::v16i16)))) {
21272 ISD::CondCode CC = cast<CondCodeSDNode>(Cond.getOperand(2))->get();
21274 // Check if one of the arms of the VSELECT is a zero vector. If it's on the
21275 // left side invert the predicate to simplify logic below.
21277 if (ISD::isBuildVectorAllZeros(LHS.getNode())) {
21279 CC = ISD::getSetCCInverse(CC, true);
21280 } else if (ISD::isBuildVectorAllZeros(RHS.getNode())) {
21284 if (Other.getNode() && Other->getNumOperands() == 2 &&
21285 DAG.isEqualTo(Other->getOperand(0), Cond.getOperand(0))) {
21286 SDValue OpLHS = Other->getOperand(0), OpRHS = Other->getOperand(1);
21287 SDValue CondRHS = Cond->getOperand(1);
21289 // Look for a general sub with unsigned saturation first.
21290 // x >= y ? x-y : 0 --> subus x, y
21291 // x > y ? x-y : 0 --> subus x, y
21292 if ((CC == ISD::SETUGE || CC == ISD::SETUGT) &&
21293 Other->getOpcode() == ISD::SUB && DAG.isEqualTo(OpRHS, CondRHS))
21294 return DAG.getNode(X86ISD::SUBUS, DL, VT, OpLHS, OpRHS);
21296 if (auto *OpRHSBV = dyn_cast<BuildVectorSDNode>(OpRHS))
21297 if (auto *OpRHSConst = OpRHSBV->getConstantSplatNode()) {
21298 if (auto *CondRHSBV = dyn_cast<BuildVectorSDNode>(CondRHS))
21299 if (auto *CondRHSConst = CondRHSBV->getConstantSplatNode())
21300 // If the RHS is a constant we have to reverse the const
21301 // canonicalization.
21302 // x > C-1 ? x+-C : 0 --> subus x, C
21303 if (CC == ISD::SETUGT && Other->getOpcode() == ISD::ADD &&
21304 CondRHSConst->getAPIntValue() ==
21305 (-OpRHSConst->getAPIntValue() - 1))
21306 return DAG.getNode(
21307 X86ISD::SUBUS, DL, VT, OpLHS,
21308 DAG.getConstant(-OpRHSConst->getAPIntValue(), VT));
21310 // Another special case: If C was a sign bit, the sub has been
21311 // canonicalized into a xor.
21312 // FIXME: Would it be better to use computeKnownBits to determine
21313 // whether it's safe to decanonicalize the xor?
21314 // x s< 0 ? x^C : 0 --> subus x, C
21315 if (CC == ISD::SETLT && Other->getOpcode() == ISD::XOR &&
21316 ISD::isBuildVectorAllZeros(CondRHS.getNode()) &&
21317 OpRHSConst->getAPIntValue().isSignBit())
21318 // Note that we have to rebuild the RHS constant here to ensure we
21319 // don't rely on particular values of undef lanes.
21320 return DAG.getNode(
21321 X86ISD::SUBUS, DL, VT, OpLHS,
21322 DAG.getConstant(OpRHSConst->getAPIntValue(), VT));
21327 // Try to match a min/max vector operation.
21328 if (N->getOpcode() == ISD::VSELECT && Cond.getOpcode() == ISD::SETCC) {
21329 std::pair<unsigned, bool> ret = matchIntegerMINMAX(Cond, VT, LHS, RHS, DAG, Subtarget);
21330 unsigned Opc = ret.first;
21331 bool NeedSplit = ret.second;
21333 if (Opc && NeedSplit) {
21334 unsigned NumElems = VT.getVectorNumElements();
21335 // Extract the LHS vectors
21336 SDValue LHS1 = Extract128BitVector(LHS, 0, DAG, DL);
21337 SDValue LHS2 = Extract128BitVector(LHS, NumElems/2, DAG, DL);
21339 // Extract the RHS vectors
21340 SDValue RHS1 = Extract128BitVector(RHS, 0, DAG, DL);
21341 SDValue RHS2 = Extract128BitVector(RHS, NumElems/2, DAG, DL);
21343 // Create min/max for each subvector
21344 LHS = DAG.getNode(Opc, DL, LHS1.getValueType(), LHS1, RHS1);
21345 RHS = DAG.getNode(Opc, DL, LHS2.getValueType(), LHS2, RHS2);
21347 // Merge the result
21348 return DAG.getNode(ISD::CONCAT_VECTORS, DL, VT, LHS, RHS);
21350 return DAG.getNode(Opc, DL, VT, LHS, RHS);
21353 // Simplify vector selection if the selector will be produced by CMPP*/PCMP*.
21354 if (N->getOpcode() == ISD::VSELECT && Cond.getOpcode() == ISD::SETCC &&
21355 // Check if SETCC has already been promoted
21356 TLI.getSetCCResultType(*DAG.getContext(), VT) == CondVT &&
21357 // Check that condition value type matches vselect operand type
21360 assert(Cond.getValueType().isVector() &&
21361 "vector select expects a vector selector!");
21363 bool TValIsAllOnes = ISD::isBuildVectorAllOnes(LHS.getNode());
21364 bool FValIsAllZeros = ISD::isBuildVectorAllZeros(RHS.getNode());
21366 if (!TValIsAllOnes && !FValIsAllZeros) {
21367 // Try invert the condition if true value is not all 1s and false value
21369 bool TValIsAllZeros = ISD::isBuildVectorAllZeros(LHS.getNode());
21370 bool FValIsAllOnes = ISD::isBuildVectorAllOnes(RHS.getNode());
21372 if (TValIsAllZeros || FValIsAllOnes) {
21373 SDValue CC = Cond.getOperand(2);
21374 ISD::CondCode NewCC =
21375 ISD::getSetCCInverse(cast<CondCodeSDNode>(CC)->get(),
21376 Cond.getOperand(0).getValueType().isInteger());
21377 Cond = DAG.getSetCC(DL, CondVT, Cond.getOperand(0), Cond.getOperand(1), NewCC);
21378 std::swap(LHS, RHS);
21379 TValIsAllOnes = FValIsAllOnes;
21380 FValIsAllZeros = TValIsAllZeros;
21384 if (TValIsAllOnes || FValIsAllZeros) {
21387 if (TValIsAllOnes && FValIsAllZeros)
21389 else if (TValIsAllOnes)
21390 Ret = DAG.getNode(ISD::OR, DL, CondVT, Cond,
21391 DAG.getNode(ISD::BITCAST, DL, CondVT, RHS));
21392 else if (FValIsAllZeros)
21393 Ret = DAG.getNode(ISD::AND, DL, CondVT, Cond,
21394 DAG.getNode(ISD::BITCAST, DL, CondVT, LHS));
21396 return DAG.getNode(ISD::BITCAST, DL, VT, Ret);
21400 // Try to fold this VSELECT into a MOVSS/MOVSD
21401 if (N->getOpcode() == ISD::VSELECT &&
21402 Cond.getOpcode() == ISD::BUILD_VECTOR && !DCI.isBeforeLegalize()) {
21403 if (VT == MVT::v4i32 || VT == MVT::v4f32 ||
21404 (Subtarget->hasSSE2() && (VT == MVT::v2i64 || VT == MVT::v2f64))) {
21405 bool CanFold = false;
21406 unsigned NumElems = Cond.getNumOperands();
21410 if (isZero(Cond.getOperand(0))) {
21413 // fold (vselect <0,-1,-1,-1>, A, B) -> (movss A, B)
21414 // fold (vselect <0,-1> -> (movsd A, B)
21415 for (unsigned i = 1, e = NumElems; i != e && CanFold; ++i)
21416 CanFold = isAllOnes(Cond.getOperand(i));
21417 } else if (isAllOnes(Cond.getOperand(0))) {
21421 // fold (vselect <-1,0,0,0>, A, B) -> (movss B, A)
21422 // fold (vselect <-1,0> -> (movsd B, A)
21423 for (unsigned i = 1, e = NumElems; i != e && CanFold; ++i)
21424 CanFold = isZero(Cond.getOperand(i));
21428 if (VT == MVT::v4i32 || VT == MVT::v4f32)
21429 return getTargetShuffleNode(X86ISD::MOVSS, DL, VT, A, B, DAG);
21430 return getTargetShuffleNode(X86ISD::MOVSD, DL, VT, A, B, DAG);
21433 if (Subtarget->hasSSE2() && (VT == MVT::v4i32 || VT == MVT::v4f32)) {
21434 // fold (v4i32: vselect <0,0,-1,-1>, A, B) ->
21435 // (v4i32 (bitcast (movsd (v2i64 (bitcast A)),
21436 // (v2i64 (bitcast B)))))
21438 // fold (v4f32: vselect <0,0,-1,-1>, A, B) ->
21439 // (v4f32 (bitcast (movsd (v2f64 (bitcast A)),
21440 // (v2f64 (bitcast B)))))
21442 // fold (v4i32: vselect <-1,-1,0,0>, A, B) ->
21443 // (v4i32 (bitcast (movsd (v2i64 (bitcast B)),
21444 // (v2i64 (bitcast A)))))
21446 // fold (v4f32: vselect <-1,-1,0,0>, A, B) ->
21447 // (v4f32 (bitcast (movsd (v2f64 (bitcast B)),
21448 // (v2f64 (bitcast A)))))
21450 CanFold = (isZero(Cond.getOperand(0)) &&
21451 isZero(Cond.getOperand(1)) &&
21452 isAllOnes(Cond.getOperand(2)) &&
21453 isAllOnes(Cond.getOperand(3)));
21455 if (!CanFold && isAllOnes(Cond.getOperand(0)) &&
21456 isAllOnes(Cond.getOperand(1)) &&
21457 isZero(Cond.getOperand(2)) &&
21458 isZero(Cond.getOperand(3))) {
21460 std::swap(LHS, RHS);
21464 EVT NVT = (VT == MVT::v4i32) ? MVT::v2i64 : MVT::v2f64;
21465 SDValue NewA = DAG.getNode(ISD::BITCAST, DL, NVT, LHS);
21466 SDValue NewB = DAG.getNode(ISD::BITCAST, DL, NVT, RHS);
21467 SDValue Select = getTargetShuffleNode(X86ISD::MOVSD, DL, NVT, NewA,
21469 return DAG.getNode(ISD::BITCAST, DL, VT, Select);
21475 // If we know that this node is legal then we know that it is going to be
21476 // matched by one of the SSE/AVX BLEND instructions. These instructions only
21477 // depend on the highest bit in each word. Try to use SimplifyDemandedBits
21478 // to simplify previous instructions.
21479 if (N->getOpcode() == ISD::VSELECT && DCI.isBeforeLegalizeOps() &&
21480 !DCI.isBeforeLegalize() &&
21481 // We explicitly check against v8i16 and v16i16 because, although
21482 // they're marked as Custom, they might only be legal when Cond is a
21483 // build_vector of constants. This will be taken care in a later
21485 (TLI.isOperationLegalOrCustom(ISD::VSELECT, VT) && VT != MVT::v16i16 &&
21486 VT != MVT::v8i16)) {
21487 unsigned BitWidth = Cond.getValueType().getScalarType().getSizeInBits();
21489 // Don't optimize vector selects that map to mask-registers.
21493 // Check all uses of that condition operand to check whether it will be
21494 // consumed by non-BLEND instructions, which may depend on all bits are set
21496 for (SDNode::use_iterator I = Cond->use_begin(),
21497 E = Cond->use_end(); I != E; ++I)
21498 if (I->getOpcode() != ISD::VSELECT)
21499 // TODO: Add other opcodes eventually lowered into BLEND.
21502 assert(BitWidth >= 8 && BitWidth <= 64 && "Invalid mask size");
21503 APInt DemandedMask = APInt::getHighBitsSet(BitWidth, 1);
21505 APInt KnownZero, KnownOne;
21506 TargetLowering::TargetLoweringOpt TLO(DAG, DCI.isBeforeLegalize(),
21507 DCI.isBeforeLegalizeOps());
21508 if (TLO.ShrinkDemandedConstant(Cond, DemandedMask) ||
21509 TLI.SimplifyDemandedBits(Cond, DemandedMask, KnownZero, KnownOne, TLO))
21510 DCI.CommitTargetLoweringOpt(TLO);
21513 // We should generate an X86ISD::BLENDI from a vselect if its argument
21514 // is a sign_extend_inreg of an any_extend of a BUILD_VECTOR of
21515 // constants. This specific pattern gets generated when we split a
21516 // selector for a 512 bit vector in a machine without AVX512 (but with
21517 // 256-bit vectors), during legalization:
21519 // (vselect (sign_extend (any_extend (BUILD_VECTOR)) i1) LHS RHS)
21521 // Iff we find this pattern and the build_vectors are built from
21522 // constants, we translate the vselect into a shuffle_vector that we
21523 // know will be matched by LowerVECTOR_SHUFFLEtoBlend.
21524 if (N->getOpcode() == ISD::VSELECT && !DCI.isBeforeLegalize()) {
21525 SDValue Shuffle = TransformVSELECTtoBlendVECTOR_SHUFFLE(N, DAG, Subtarget);
21526 if (Shuffle.getNode())
21533 // Check whether a boolean test is testing a boolean value generated by
21534 // X86ISD::SETCC. If so, return the operand of that SETCC and proper condition
21537 // Simplify the following patterns:
21538 // (Op (CMP (SETCC Cond EFLAGS) 1) EQ) or
21539 // (Op (CMP (SETCC Cond EFLAGS) 0) NEQ)
21540 // to (Op EFLAGS Cond)
21542 // (Op (CMP (SETCC Cond EFLAGS) 0) EQ) or
21543 // (Op (CMP (SETCC Cond EFLAGS) 1) NEQ)
21544 // to (Op EFLAGS !Cond)
21546 // where Op could be BRCOND or CMOV.
21548 static SDValue checkBoolTestSetCCCombine(SDValue Cmp, X86::CondCode &CC) {
21549 // Quit if not CMP and SUB with its value result used.
21550 if (Cmp.getOpcode() != X86ISD::CMP &&
21551 (Cmp.getOpcode() != X86ISD::SUB || Cmp.getNode()->hasAnyUseOfValue(0)))
21554 // Quit if not used as a boolean value.
21555 if (CC != X86::COND_E && CC != X86::COND_NE)
21558 // Check CMP operands. One of them should be 0 or 1 and the other should be
21559 // an SetCC or extended from it.
21560 SDValue Op1 = Cmp.getOperand(0);
21561 SDValue Op2 = Cmp.getOperand(1);
21564 const ConstantSDNode* C = nullptr;
21565 bool needOppositeCond = (CC == X86::COND_E);
21566 bool checkAgainstTrue = false; // Is it a comparison against 1?
21568 if ((C = dyn_cast<ConstantSDNode>(Op1)))
21570 else if ((C = dyn_cast<ConstantSDNode>(Op2)))
21572 else // Quit if all operands are not constants.
21575 if (C->getZExtValue() == 1) {
21576 needOppositeCond = !needOppositeCond;
21577 checkAgainstTrue = true;
21578 } else if (C->getZExtValue() != 0)
21579 // Quit if the constant is neither 0 or 1.
21582 bool truncatedToBoolWithAnd = false;
21583 // Skip (zext $x), (trunc $x), or (and $x, 1) node.
21584 while (SetCC.getOpcode() == ISD::ZERO_EXTEND ||
21585 SetCC.getOpcode() == ISD::TRUNCATE ||
21586 SetCC.getOpcode() == ISD::AND) {
21587 if (SetCC.getOpcode() == ISD::AND) {
21589 ConstantSDNode *CS;
21590 if ((CS = dyn_cast<ConstantSDNode>(SetCC.getOperand(0))) &&
21591 CS->getZExtValue() == 1)
21593 if ((CS = dyn_cast<ConstantSDNode>(SetCC.getOperand(1))) &&
21594 CS->getZExtValue() == 1)
21598 SetCC = SetCC.getOperand(OpIdx);
21599 truncatedToBoolWithAnd = true;
21601 SetCC = SetCC.getOperand(0);
21604 switch (SetCC.getOpcode()) {
21605 case X86ISD::SETCC_CARRY:
21606 // Since SETCC_CARRY gives output based on R = CF ? ~0 : 0, it's unsafe to
21607 // simplify it if the result of SETCC_CARRY is not canonicalized to 0 or 1,
21608 // i.e. it's a comparison against true but the result of SETCC_CARRY is not
21609 // truncated to i1 using 'and'.
21610 if (checkAgainstTrue && !truncatedToBoolWithAnd)
21612 assert(X86::CondCode(SetCC.getConstantOperandVal(0)) == X86::COND_B &&
21613 "Invalid use of SETCC_CARRY!");
21615 case X86ISD::SETCC:
21616 // Set the condition code or opposite one if necessary.
21617 CC = X86::CondCode(SetCC.getConstantOperandVal(0));
21618 if (needOppositeCond)
21619 CC = X86::GetOppositeBranchCondition(CC);
21620 return SetCC.getOperand(1);
21621 case X86ISD::CMOV: {
21622 // Check whether false/true value has canonical one, i.e. 0 or 1.
21623 ConstantSDNode *FVal = dyn_cast<ConstantSDNode>(SetCC.getOperand(0));
21624 ConstantSDNode *TVal = dyn_cast<ConstantSDNode>(SetCC.getOperand(1));
21625 // Quit if true value is not a constant.
21628 // Quit if false value is not a constant.
21630 SDValue Op = SetCC.getOperand(0);
21631 // Skip 'zext' or 'trunc' node.
21632 if (Op.getOpcode() == ISD::ZERO_EXTEND ||
21633 Op.getOpcode() == ISD::TRUNCATE)
21634 Op = Op.getOperand(0);
21635 // A special case for rdrand/rdseed, where 0 is set if false cond is
21637 if ((Op.getOpcode() != X86ISD::RDRAND &&
21638 Op.getOpcode() != X86ISD::RDSEED) || Op.getResNo() != 0)
21641 // Quit if false value is not the constant 0 or 1.
21642 bool FValIsFalse = true;
21643 if (FVal && FVal->getZExtValue() != 0) {
21644 if (FVal->getZExtValue() != 1)
21646 // If FVal is 1, opposite cond is needed.
21647 needOppositeCond = !needOppositeCond;
21648 FValIsFalse = false;
21650 // Quit if TVal is not the constant opposite of FVal.
21651 if (FValIsFalse && TVal->getZExtValue() != 1)
21653 if (!FValIsFalse && TVal->getZExtValue() != 0)
21655 CC = X86::CondCode(SetCC.getConstantOperandVal(2));
21656 if (needOppositeCond)
21657 CC = X86::GetOppositeBranchCondition(CC);
21658 return SetCC.getOperand(3);
21665 /// Optimize X86ISD::CMOV [LHS, RHS, CONDCODE (e.g. X86::COND_NE), CONDVAL]
21666 static SDValue PerformCMOVCombine(SDNode *N, SelectionDAG &DAG,
21667 TargetLowering::DAGCombinerInfo &DCI,
21668 const X86Subtarget *Subtarget) {
21671 // If the flag operand isn't dead, don't touch this CMOV.
21672 if (N->getNumValues() == 2 && !SDValue(N, 1).use_empty())
21675 SDValue FalseOp = N->getOperand(0);
21676 SDValue TrueOp = N->getOperand(1);
21677 X86::CondCode CC = (X86::CondCode)N->getConstantOperandVal(2);
21678 SDValue Cond = N->getOperand(3);
21680 if (CC == X86::COND_E || CC == X86::COND_NE) {
21681 switch (Cond.getOpcode()) {
21685 // If operand of BSR / BSF are proven never zero, then ZF cannot be set.
21686 if (DAG.isKnownNeverZero(Cond.getOperand(0)))
21687 return (CC == X86::COND_E) ? FalseOp : TrueOp;
21693 Flags = checkBoolTestSetCCCombine(Cond, CC);
21694 if (Flags.getNode() &&
21695 // Extra check as FCMOV only supports a subset of X86 cond.
21696 (FalseOp.getValueType() != MVT::f80 || hasFPCMov(CC))) {
21697 SDValue Ops[] = { FalseOp, TrueOp,
21698 DAG.getConstant(CC, MVT::i8), Flags };
21699 return DAG.getNode(X86ISD::CMOV, DL, N->getVTList(), Ops);
21702 // If this is a select between two integer constants, try to do some
21703 // optimizations. Note that the operands are ordered the opposite of SELECT
21705 if (ConstantSDNode *TrueC = dyn_cast<ConstantSDNode>(TrueOp)) {
21706 if (ConstantSDNode *FalseC = dyn_cast<ConstantSDNode>(FalseOp)) {
21707 // Canonicalize the TrueC/FalseC values so that TrueC (the true value) is
21708 // larger than FalseC (the false value).
21709 if (TrueC->getAPIntValue().ult(FalseC->getAPIntValue())) {
21710 CC = X86::GetOppositeBranchCondition(CC);
21711 std::swap(TrueC, FalseC);
21712 std::swap(TrueOp, FalseOp);
21715 // Optimize C ? 8 : 0 -> zext(setcc(C)) << 3. Likewise for any pow2/0.
21716 // This is efficient for any integer data type (including i8/i16) and
21718 if (FalseC->getAPIntValue() == 0 && TrueC->getAPIntValue().isPowerOf2()) {
21719 Cond = DAG.getNode(X86ISD::SETCC, DL, MVT::i8,
21720 DAG.getConstant(CC, MVT::i8), Cond);
21722 // Zero extend the condition if needed.
21723 Cond = DAG.getNode(ISD::ZERO_EXTEND, DL, TrueC->getValueType(0), Cond);
21725 unsigned ShAmt = TrueC->getAPIntValue().logBase2();
21726 Cond = DAG.getNode(ISD::SHL, DL, Cond.getValueType(), Cond,
21727 DAG.getConstant(ShAmt, MVT::i8));
21728 if (N->getNumValues() == 2) // Dead flag value?
21729 return DCI.CombineTo(N, Cond, SDValue());
21733 // Optimize Cond ? cst+1 : cst -> zext(setcc(C)+cst. This is efficient
21734 // for any integer data type, including i8/i16.
21735 if (FalseC->getAPIntValue()+1 == TrueC->getAPIntValue()) {
21736 Cond = DAG.getNode(X86ISD::SETCC, DL, MVT::i8,
21737 DAG.getConstant(CC, MVT::i8), Cond);
21739 // Zero extend the condition if needed.
21740 Cond = DAG.getNode(ISD::ZERO_EXTEND, DL,
21741 FalseC->getValueType(0), Cond);
21742 Cond = DAG.getNode(ISD::ADD, DL, Cond.getValueType(), Cond,
21743 SDValue(FalseC, 0));
21745 if (N->getNumValues() == 2) // Dead flag value?
21746 return DCI.CombineTo(N, Cond, SDValue());
21750 // Optimize cases that will turn into an LEA instruction. This requires
21751 // an i32 or i64 and an efficient multiplier (1, 2, 3, 4, 5, 8, 9).
21752 if (N->getValueType(0) == MVT::i32 || N->getValueType(0) == MVT::i64) {
21753 uint64_t Diff = TrueC->getZExtValue()-FalseC->getZExtValue();
21754 if (N->getValueType(0) == MVT::i32) Diff = (unsigned)Diff;
21756 bool isFastMultiplier = false;
21758 switch ((unsigned char)Diff) {
21760 case 1: // result = add base, cond
21761 case 2: // result = lea base( , cond*2)
21762 case 3: // result = lea base(cond, cond*2)
21763 case 4: // result = lea base( , cond*4)
21764 case 5: // result = lea base(cond, cond*4)
21765 case 8: // result = lea base( , cond*8)
21766 case 9: // result = lea base(cond, cond*8)
21767 isFastMultiplier = true;
21772 if (isFastMultiplier) {
21773 APInt Diff = TrueC->getAPIntValue()-FalseC->getAPIntValue();
21774 Cond = DAG.getNode(X86ISD::SETCC, DL, MVT::i8,
21775 DAG.getConstant(CC, MVT::i8), Cond);
21776 // Zero extend the condition if needed.
21777 Cond = DAG.getNode(ISD::ZERO_EXTEND, DL, FalseC->getValueType(0),
21779 // Scale the condition by the difference.
21781 Cond = DAG.getNode(ISD::MUL, DL, Cond.getValueType(), Cond,
21782 DAG.getConstant(Diff, Cond.getValueType()));
21784 // Add the base if non-zero.
21785 if (FalseC->getAPIntValue() != 0)
21786 Cond = DAG.getNode(ISD::ADD, DL, Cond.getValueType(), Cond,
21787 SDValue(FalseC, 0));
21788 if (N->getNumValues() == 2) // Dead flag value?
21789 return DCI.CombineTo(N, Cond, SDValue());
21796 // Handle these cases:
21797 // (select (x != c), e, c) -> select (x != c), e, x),
21798 // (select (x == c), c, e) -> select (x == c), x, e)
21799 // where the c is an integer constant, and the "select" is the combination
21800 // of CMOV and CMP.
21802 // The rationale for this change is that the conditional-move from a constant
21803 // needs two instructions, however, conditional-move from a register needs
21804 // only one instruction.
21806 // CAVEAT: By replacing a constant with a symbolic value, it may obscure
21807 // some instruction-combining opportunities. This opt needs to be
21808 // postponed as late as possible.
21810 if (!DCI.isBeforeLegalize() && !DCI.isBeforeLegalizeOps()) {
21811 // the DCI.xxxx conditions are provided to postpone the optimization as
21812 // late as possible.
21814 ConstantSDNode *CmpAgainst = nullptr;
21815 if ((Cond.getOpcode() == X86ISD::CMP || Cond.getOpcode() == X86ISD::SUB) &&
21816 (CmpAgainst = dyn_cast<ConstantSDNode>(Cond.getOperand(1))) &&
21817 !isa<ConstantSDNode>(Cond.getOperand(0))) {
21819 if (CC == X86::COND_NE &&
21820 CmpAgainst == dyn_cast<ConstantSDNode>(FalseOp)) {
21821 CC = X86::GetOppositeBranchCondition(CC);
21822 std::swap(TrueOp, FalseOp);
21825 if (CC == X86::COND_E &&
21826 CmpAgainst == dyn_cast<ConstantSDNode>(TrueOp)) {
21827 SDValue Ops[] = { FalseOp, Cond.getOperand(0),
21828 DAG.getConstant(CC, MVT::i8), Cond };
21829 return DAG.getNode(X86ISD::CMOV, DL, N->getVTList (), Ops);
21837 static SDValue PerformINTRINSIC_WO_CHAINCombine(SDNode *N, SelectionDAG &DAG,
21838 const X86Subtarget *Subtarget) {
21839 unsigned IntNo = cast<ConstantSDNode>(N->getOperand(0))->getZExtValue();
21841 default: return SDValue();
21842 // SSE/AVX/AVX2 blend intrinsics.
21843 case Intrinsic::x86_avx2_pblendvb:
21844 case Intrinsic::x86_avx2_pblendw:
21845 case Intrinsic::x86_avx2_pblendd_128:
21846 case Intrinsic::x86_avx2_pblendd_256:
21847 // Don't try to simplify this intrinsic if we don't have AVX2.
21848 if (!Subtarget->hasAVX2())
21851 case Intrinsic::x86_avx_blend_pd_256:
21852 case Intrinsic::x86_avx_blend_ps_256:
21853 case Intrinsic::x86_avx_blendv_pd_256:
21854 case Intrinsic::x86_avx_blendv_ps_256:
21855 // Don't try to simplify this intrinsic if we don't have AVX.
21856 if (!Subtarget->hasAVX())
21859 case Intrinsic::x86_sse41_pblendw:
21860 case Intrinsic::x86_sse41_blendpd:
21861 case Intrinsic::x86_sse41_blendps:
21862 case Intrinsic::x86_sse41_blendvps:
21863 case Intrinsic::x86_sse41_blendvpd:
21864 case Intrinsic::x86_sse41_pblendvb: {
21865 SDValue Op0 = N->getOperand(1);
21866 SDValue Op1 = N->getOperand(2);
21867 SDValue Mask = N->getOperand(3);
21869 // Don't try to simplify this intrinsic if we don't have SSE4.1.
21870 if (!Subtarget->hasSSE41())
21873 // fold (blend A, A, Mask) -> A
21876 // fold (blend A, B, allZeros) -> A
21877 if (ISD::isBuildVectorAllZeros(Mask.getNode()))
21879 // fold (blend A, B, allOnes) -> B
21880 if (ISD::isBuildVectorAllOnes(Mask.getNode()))
21883 // Simplify the case where the mask is a constant i32 value.
21884 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Mask)) {
21885 if (C->isNullValue())
21887 if (C->isAllOnesValue())
21894 // Packed SSE2/AVX2 arithmetic shift immediate intrinsics.
21895 case Intrinsic::x86_sse2_psrai_w:
21896 case Intrinsic::x86_sse2_psrai_d:
21897 case Intrinsic::x86_avx2_psrai_w:
21898 case Intrinsic::x86_avx2_psrai_d:
21899 case Intrinsic::x86_sse2_psra_w:
21900 case Intrinsic::x86_sse2_psra_d:
21901 case Intrinsic::x86_avx2_psra_w:
21902 case Intrinsic::x86_avx2_psra_d: {
21903 SDValue Op0 = N->getOperand(1);
21904 SDValue Op1 = N->getOperand(2);
21905 EVT VT = Op0.getValueType();
21906 assert(VT.isVector() && "Expected a vector type!");
21908 if (isa<BuildVectorSDNode>(Op1))
21909 Op1 = Op1.getOperand(0);
21911 if (!isa<ConstantSDNode>(Op1))
21914 EVT SVT = VT.getVectorElementType();
21915 unsigned SVTBits = SVT.getSizeInBits();
21917 ConstantSDNode *CND = cast<ConstantSDNode>(Op1);
21918 const APInt &C = APInt(SVTBits, CND->getAPIntValue().getZExtValue());
21919 uint64_t ShAmt = C.getZExtValue();
21921 // Don't try to convert this shift into a ISD::SRA if the shift
21922 // count is bigger than or equal to the element size.
21923 if (ShAmt >= SVTBits)
21926 // Trivial case: if the shift count is zero, then fold this
21927 // into the first operand.
21931 // Replace this packed shift intrinsic with a target independent
21933 SDValue Splat = DAG.getConstant(C, VT);
21934 return DAG.getNode(ISD::SRA, SDLoc(N), VT, Op0, Splat);
21939 /// PerformMulCombine - Optimize a single multiply with constant into two
21940 /// in order to implement it with two cheaper instructions, e.g.
21941 /// LEA + SHL, LEA + LEA.
21942 static SDValue PerformMulCombine(SDNode *N, SelectionDAG &DAG,
21943 TargetLowering::DAGCombinerInfo &DCI) {
21944 if (DCI.isBeforeLegalize() || DCI.isCalledByLegalizer())
21947 EVT VT = N->getValueType(0);
21948 if (VT != MVT::i64)
21951 ConstantSDNode *C = dyn_cast<ConstantSDNode>(N->getOperand(1));
21954 uint64_t MulAmt = C->getZExtValue();
21955 if (isPowerOf2_64(MulAmt) || MulAmt == 3 || MulAmt == 5 || MulAmt == 9)
21958 uint64_t MulAmt1 = 0;
21959 uint64_t MulAmt2 = 0;
21960 if ((MulAmt % 9) == 0) {
21962 MulAmt2 = MulAmt / 9;
21963 } else if ((MulAmt % 5) == 0) {
21965 MulAmt2 = MulAmt / 5;
21966 } else if ((MulAmt % 3) == 0) {
21968 MulAmt2 = MulAmt / 3;
21971 (isPowerOf2_64(MulAmt2) || MulAmt2 == 3 || MulAmt2 == 5 || MulAmt2 == 9)){
21974 if (isPowerOf2_64(MulAmt2) &&
21975 !(N->hasOneUse() && N->use_begin()->getOpcode() == ISD::ADD))
21976 // If second multiplifer is pow2, issue it first. We want the multiply by
21977 // 3, 5, or 9 to be folded into the addressing mode unless the lone use
21979 std::swap(MulAmt1, MulAmt2);
21982 if (isPowerOf2_64(MulAmt1))
21983 NewMul = DAG.getNode(ISD::SHL, DL, VT, N->getOperand(0),
21984 DAG.getConstant(Log2_64(MulAmt1), MVT::i8));
21986 NewMul = DAG.getNode(X86ISD::MUL_IMM, DL, VT, N->getOperand(0),
21987 DAG.getConstant(MulAmt1, VT));
21989 if (isPowerOf2_64(MulAmt2))
21990 NewMul = DAG.getNode(ISD::SHL, DL, VT, NewMul,
21991 DAG.getConstant(Log2_64(MulAmt2), MVT::i8));
21993 NewMul = DAG.getNode(X86ISD::MUL_IMM, DL, VT, NewMul,
21994 DAG.getConstant(MulAmt2, VT));
21996 // Do not add new nodes to DAG combiner worklist.
21997 DCI.CombineTo(N, NewMul, false);
22002 static SDValue PerformSHLCombine(SDNode *N, SelectionDAG &DAG) {
22003 SDValue N0 = N->getOperand(0);
22004 SDValue N1 = N->getOperand(1);
22005 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1);
22006 EVT VT = N0.getValueType();
22008 // fold (shl (and (setcc_c), c1), c2) -> (and setcc_c, (c1 << c2))
22009 // since the result of setcc_c is all zero's or all ones.
22010 if (VT.isInteger() && !VT.isVector() &&
22011 N1C && N0.getOpcode() == ISD::AND &&
22012 N0.getOperand(1).getOpcode() == ISD::Constant) {
22013 SDValue N00 = N0.getOperand(0);
22014 if (N00.getOpcode() == X86ISD::SETCC_CARRY ||
22015 ((N00.getOpcode() == ISD::ANY_EXTEND ||
22016 N00.getOpcode() == ISD::ZERO_EXTEND) &&
22017 N00.getOperand(0).getOpcode() == X86ISD::SETCC_CARRY)) {
22018 APInt Mask = cast<ConstantSDNode>(N0.getOperand(1))->getAPIntValue();
22019 APInt ShAmt = N1C->getAPIntValue();
22020 Mask = Mask.shl(ShAmt);
22022 return DAG.getNode(ISD::AND, SDLoc(N), VT,
22023 N00, DAG.getConstant(Mask, VT));
22027 // Hardware support for vector shifts is sparse which makes us scalarize the
22028 // vector operations in many cases. Also, on sandybridge ADD is faster than
22030 // (shl V, 1) -> add V,V
22031 if (auto *N1BV = dyn_cast<BuildVectorSDNode>(N1))
22032 if (auto *N1SplatC = N1BV->getConstantSplatNode()) {
22033 assert(N0.getValueType().isVector() && "Invalid vector shift type");
22034 // We shift all of the values by one. In many cases we do not have
22035 // hardware support for this operation. This is better expressed as an ADD
22037 if (N1SplatC->getZExtValue() == 1)
22038 return DAG.getNode(ISD::ADD, SDLoc(N), VT, N0, N0);
22044 /// \brief Returns a vector of 0s if the node in input is a vector logical
22045 /// shift by a constant amount which is known to be bigger than or equal
22046 /// to the vector element size in bits.
22047 static SDValue performShiftToAllZeros(SDNode *N, SelectionDAG &DAG,
22048 const X86Subtarget *Subtarget) {
22049 EVT VT = N->getValueType(0);
22051 if (VT != MVT::v2i64 && VT != MVT::v4i32 && VT != MVT::v8i16 &&
22052 (!Subtarget->hasInt256() ||
22053 (VT != MVT::v4i64 && VT != MVT::v8i32 && VT != MVT::v16i16)))
22056 SDValue Amt = N->getOperand(1);
22058 if (auto *AmtBV = dyn_cast<BuildVectorSDNode>(Amt))
22059 if (auto *AmtSplat = AmtBV->getConstantSplatNode()) {
22060 APInt ShiftAmt = AmtSplat->getAPIntValue();
22061 unsigned MaxAmount = VT.getVectorElementType().getSizeInBits();
22063 // SSE2/AVX2 logical shifts always return a vector of 0s
22064 // if the shift amount is bigger than or equal to
22065 // the element size. The constant shift amount will be
22066 // encoded as a 8-bit immediate.
22067 if (ShiftAmt.trunc(8).uge(MaxAmount))
22068 return getZeroVector(VT, Subtarget, DAG, DL);
22074 /// PerformShiftCombine - Combine shifts.
22075 static SDValue PerformShiftCombine(SDNode* N, SelectionDAG &DAG,
22076 TargetLowering::DAGCombinerInfo &DCI,
22077 const X86Subtarget *Subtarget) {
22078 if (N->getOpcode() == ISD::SHL) {
22079 SDValue V = PerformSHLCombine(N, DAG);
22080 if (V.getNode()) return V;
22083 if (N->getOpcode() != ISD::SRA) {
22084 // Try to fold this logical shift into a zero vector.
22085 SDValue V = performShiftToAllZeros(N, DAG, Subtarget);
22086 if (V.getNode()) return V;
22092 // CMPEQCombine - Recognize the distinctive (AND (setcc ...) (setcc ..))
22093 // where both setccs reference the same FP CMP, and rewrite for CMPEQSS
22094 // and friends. Likewise for OR -> CMPNEQSS.
22095 static SDValue CMPEQCombine(SDNode *N, SelectionDAG &DAG,
22096 TargetLowering::DAGCombinerInfo &DCI,
22097 const X86Subtarget *Subtarget) {
22100 // SSE1 supports CMP{eq|ne}SS, and SSE2 added CMP{eq|ne}SD, but
22101 // we're requiring SSE2 for both.
22102 if (Subtarget->hasSSE2() && isAndOrOfSetCCs(SDValue(N, 0U), opcode)) {
22103 SDValue N0 = N->getOperand(0);
22104 SDValue N1 = N->getOperand(1);
22105 SDValue CMP0 = N0->getOperand(1);
22106 SDValue CMP1 = N1->getOperand(1);
22109 // The SETCCs should both refer to the same CMP.
22110 if (CMP0.getOpcode() != X86ISD::CMP || CMP0 != CMP1)
22113 SDValue CMP00 = CMP0->getOperand(0);
22114 SDValue CMP01 = CMP0->getOperand(1);
22115 EVT VT = CMP00.getValueType();
22117 if (VT == MVT::f32 || VT == MVT::f64) {
22118 bool ExpectingFlags = false;
22119 // Check for any users that want flags:
22120 for (SDNode::use_iterator UI = N->use_begin(), UE = N->use_end();
22121 !ExpectingFlags && UI != UE; ++UI)
22122 switch (UI->getOpcode()) {
22127 ExpectingFlags = true;
22129 case ISD::CopyToReg:
22130 case ISD::SIGN_EXTEND:
22131 case ISD::ZERO_EXTEND:
22132 case ISD::ANY_EXTEND:
22136 if (!ExpectingFlags) {
22137 enum X86::CondCode cc0 = (enum X86::CondCode)N0.getConstantOperandVal(0);
22138 enum X86::CondCode cc1 = (enum X86::CondCode)N1.getConstantOperandVal(0);
22140 if (cc1 == X86::COND_E || cc1 == X86::COND_NE) {
22141 X86::CondCode tmp = cc0;
22146 if ((cc0 == X86::COND_E && cc1 == X86::COND_NP) ||
22147 (cc0 == X86::COND_NE && cc1 == X86::COND_P)) {
22148 // FIXME: need symbolic constants for these magic numbers.
22149 // See X86ATTInstPrinter.cpp:printSSECC().
22150 unsigned x86cc = (cc0 == X86::COND_E) ? 0 : 4;
22151 if (Subtarget->hasAVX512()) {
22152 SDValue FSetCC = DAG.getNode(X86ISD::FSETCC, DL, MVT::i1, CMP00,
22153 CMP01, DAG.getConstant(x86cc, MVT::i8));
22154 if (N->getValueType(0) != MVT::i1)
22155 return DAG.getNode(ISD::ZERO_EXTEND, DL, N->getValueType(0),
22159 SDValue OnesOrZeroesF = DAG.getNode(X86ISD::FSETCC, DL,
22160 CMP00.getValueType(), CMP00, CMP01,
22161 DAG.getConstant(x86cc, MVT::i8));
22163 bool is64BitFP = (CMP00.getValueType() == MVT::f64);
22164 MVT IntVT = is64BitFP ? MVT::i64 : MVT::i32;
22166 if (is64BitFP && !Subtarget->is64Bit()) {
22167 // On a 32-bit target, we cannot bitcast the 64-bit float to a
22168 // 64-bit integer, since that's not a legal type. Since
22169 // OnesOrZeroesF is all ones of all zeroes, we don't need all the
22170 // bits, but can do this little dance to extract the lowest 32 bits
22171 // and work with those going forward.
22172 SDValue Vector64 = DAG.getNode(ISD::SCALAR_TO_VECTOR, DL, MVT::v2f64,
22174 SDValue Vector32 = DAG.getNode(ISD::BITCAST, DL, MVT::v4f32,
22176 OnesOrZeroesF = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, DL, MVT::f32,
22177 Vector32, DAG.getIntPtrConstant(0));
22181 SDValue OnesOrZeroesI = DAG.getNode(ISD::BITCAST, DL, IntVT, OnesOrZeroesF);
22182 SDValue ANDed = DAG.getNode(ISD::AND, DL, IntVT, OnesOrZeroesI,
22183 DAG.getConstant(1, IntVT));
22184 SDValue OneBitOfTruth = DAG.getNode(ISD::TRUNCATE, DL, MVT::i8, ANDed);
22185 return OneBitOfTruth;
22193 /// CanFoldXORWithAllOnes - Test whether the XOR operand is a AllOnes vector
22194 /// so it can be folded inside ANDNP.
22195 static bool CanFoldXORWithAllOnes(const SDNode *N) {
22196 EVT VT = N->getValueType(0);
22198 // Match direct AllOnes for 128 and 256-bit vectors
22199 if (ISD::isBuildVectorAllOnes(N))
22202 // Look through a bit convert.
22203 if (N->getOpcode() == ISD::BITCAST)
22204 N = N->getOperand(0).getNode();
22206 // Sometimes the operand may come from a insert_subvector building a 256-bit
22208 if (VT.is256BitVector() &&
22209 N->getOpcode() == ISD::INSERT_SUBVECTOR) {
22210 SDValue V1 = N->getOperand(0);
22211 SDValue V2 = N->getOperand(1);
22213 if (V1.getOpcode() == ISD::INSERT_SUBVECTOR &&
22214 V1.getOperand(0).getOpcode() == ISD::UNDEF &&
22215 ISD::isBuildVectorAllOnes(V1.getOperand(1).getNode()) &&
22216 ISD::isBuildVectorAllOnes(V2.getNode()))
22223 // On AVX/AVX2 the type v8i1 is legalized to v8i16, which is an XMM sized
22224 // register. In most cases we actually compare or select YMM-sized registers
22225 // and mixing the two types creates horrible code. This method optimizes
22226 // some of the transition sequences.
22227 static SDValue WidenMaskArithmetic(SDNode *N, SelectionDAG &DAG,
22228 TargetLowering::DAGCombinerInfo &DCI,
22229 const X86Subtarget *Subtarget) {
22230 EVT VT = N->getValueType(0);
22231 if (!VT.is256BitVector())
22234 assert((N->getOpcode() == ISD::ANY_EXTEND ||
22235 N->getOpcode() == ISD::ZERO_EXTEND ||
22236 N->getOpcode() == ISD::SIGN_EXTEND) && "Invalid Node");
22238 SDValue Narrow = N->getOperand(0);
22239 EVT NarrowVT = Narrow->getValueType(0);
22240 if (!NarrowVT.is128BitVector())
22243 if (Narrow->getOpcode() != ISD::XOR &&
22244 Narrow->getOpcode() != ISD::AND &&
22245 Narrow->getOpcode() != ISD::OR)
22248 SDValue N0 = Narrow->getOperand(0);
22249 SDValue N1 = Narrow->getOperand(1);
22252 // The Left side has to be a trunc.
22253 if (N0.getOpcode() != ISD::TRUNCATE)
22256 // The type of the truncated inputs.
22257 EVT WideVT = N0->getOperand(0)->getValueType(0);
22261 // The right side has to be a 'trunc' or a constant vector.
22262 bool RHSTrunc = N1.getOpcode() == ISD::TRUNCATE;
22263 ConstantSDNode *RHSConstSplat = nullptr;
22264 if (auto *RHSBV = dyn_cast<BuildVectorSDNode>(N1))
22265 RHSConstSplat = RHSBV->getConstantSplatNode();
22266 if (!RHSTrunc && !RHSConstSplat)
22269 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
22271 if (!TLI.isOperationLegalOrPromote(Narrow->getOpcode(), WideVT))
22274 // Set N0 and N1 to hold the inputs to the new wide operation.
22275 N0 = N0->getOperand(0);
22276 if (RHSConstSplat) {
22277 N1 = DAG.getNode(ISD::ZERO_EXTEND, DL, WideVT.getScalarType(),
22278 SDValue(RHSConstSplat, 0));
22279 SmallVector<SDValue, 8> C(WideVT.getVectorNumElements(), N1);
22280 N1 = DAG.getNode(ISD::BUILD_VECTOR, DL, WideVT, C);
22281 } else if (RHSTrunc) {
22282 N1 = N1->getOperand(0);
22285 // Generate the wide operation.
22286 SDValue Op = DAG.getNode(Narrow->getOpcode(), DL, WideVT, N0, N1);
22287 unsigned Opcode = N->getOpcode();
22289 case ISD::ANY_EXTEND:
22291 case ISD::ZERO_EXTEND: {
22292 unsigned InBits = NarrowVT.getScalarType().getSizeInBits();
22293 APInt Mask = APInt::getAllOnesValue(InBits);
22294 Mask = Mask.zext(VT.getScalarType().getSizeInBits());
22295 return DAG.getNode(ISD::AND, DL, VT,
22296 Op, DAG.getConstant(Mask, VT));
22298 case ISD::SIGN_EXTEND:
22299 return DAG.getNode(ISD::SIGN_EXTEND_INREG, DL, VT,
22300 Op, DAG.getValueType(NarrowVT));
22302 llvm_unreachable("Unexpected opcode");
22306 static SDValue PerformAndCombine(SDNode *N, SelectionDAG &DAG,
22307 TargetLowering::DAGCombinerInfo &DCI,
22308 const X86Subtarget *Subtarget) {
22309 EVT VT = N->getValueType(0);
22310 if (DCI.isBeforeLegalizeOps())
22313 SDValue R = CMPEQCombine(N, DAG, DCI, Subtarget);
22317 // Create BEXTR instructions
22318 // BEXTR is ((X >> imm) & (2**size-1))
22319 if (VT == MVT::i32 || VT == MVT::i64) {
22320 SDValue N0 = N->getOperand(0);
22321 SDValue N1 = N->getOperand(1);
22324 // Check for BEXTR.
22325 if ((Subtarget->hasBMI() || Subtarget->hasTBM()) &&
22326 (N0.getOpcode() == ISD::SRA || N0.getOpcode() == ISD::SRL)) {
22327 ConstantSDNode *MaskNode = dyn_cast<ConstantSDNode>(N1);
22328 ConstantSDNode *ShiftNode = dyn_cast<ConstantSDNode>(N0.getOperand(1));
22329 if (MaskNode && ShiftNode) {
22330 uint64_t Mask = MaskNode->getZExtValue();
22331 uint64_t Shift = ShiftNode->getZExtValue();
22332 if (isMask_64(Mask)) {
22333 uint64_t MaskSize = CountPopulation_64(Mask);
22334 if (Shift + MaskSize <= VT.getSizeInBits())
22335 return DAG.getNode(X86ISD::BEXTR, DL, VT, N0.getOperand(0),
22336 DAG.getConstant(Shift | (MaskSize << 8), VT));
22344 // Want to form ANDNP nodes:
22345 // 1) In the hopes of then easily combining them with OR and AND nodes
22346 // to form PBLEND/PSIGN.
22347 // 2) To match ANDN packed intrinsics
22348 if (VT != MVT::v2i64 && VT != MVT::v4i64)
22351 SDValue N0 = N->getOperand(0);
22352 SDValue N1 = N->getOperand(1);
22355 // Check LHS for vnot
22356 if (N0.getOpcode() == ISD::XOR &&
22357 //ISD::isBuildVectorAllOnes(N0.getOperand(1).getNode()))
22358 CanFoldXORWithAllOnes(N0.getOperand(1).getNode()))
22359 return DAG.getNode(X86ISD::ANDNP, DL, VT, N0.getOperand(0), N1);
22361 // Check RHS for vnot
22362 if (N1.getOpcode() == ISD::XOR &&
22363 //ISD::isBuildVectorAllOnes(N1.getOperand(1).getNode()))
22364 CanFoldXORWithAllOnes(N1.getOperand(1).getNode()))
22365 return DAG.getNode(X86ISD::ANDNP, DL, VT, N1.getOperand(0), N0);
22370 static SDValue PerformOrCombine(SDNode *N, SelectionDAG &DAG,
22371 TargetLowering::DAGCombinerInfo &DCI,
22372 const X86Subtarget *Subtarget) {
22373 if (DCI.isBeforeLegalizeOps())
22376 SDValue R = CMPEQCombine(N, DAG, DCI, Subtarget);
22380 SDValue N0 = N->getOperand(0);
22381 SDValue N1 = N->getOperand(1);
22382 EVT VT = N->getValueType(0);
22384 // look for psign/blend
22385 if (VT == MVT::v2i64 || VT == MVT::v4i64) {
22386 if (!Subtarget->hasSSSE3() ||
22387 (VT == MVT::v4i64 && !Subtarget->hasInt256()))
22390 // Canonicalize pandn to RHS
22391 if (N0.getOpcode() == X86ISD::ANDNP)
22393 // or (and (m, y), (pandn m, x))
22394 if (N0.getOpcode() == ISD::AND && N1.getOpcode() == X86ISD::ANDNP) {
22395 SDValue Mask = N1.getOperand(0);
22396 SDValue X = N1.getOperand(1);
22398 if (N0.getOperand(0) == Mask)
22399 Y = N0.getOperand(1);
22400 if (N0.getOperand(1) == Mask)
22401 Y = N0.getOperand(0);
22403 // Check to see if the mask appeared in both the AND and ANDNP and
22407 // Validate that X, Y, and Mask are BIT_CONVERTS, and see through them.
22408 // Look through mask bitcast.
22409 if (Mask.getOpcode() == ISD::BITCAST)
22410 Mask = Mask.getOperand(0);
22411 if (X.getOpcode() == ISD::BITCAST)
22412 X = X.getOperand(0);
22413 if (Y.getOpcode() == ISD::BITCAST)
22414 Y = Y.getOperand(0);
22416 EVT MaskVT = Mask.getValueType();
22418 // Validate that the Mask operand is a vector sra node.
22419 // FIXME: what to do for bytes, since there is a psignb/pblendvb, but
22420 // there is no psrai.b
22421 unsigned EltBits = MaskVT.getVectorElementType().getSizeInBits();
22422 unsigned SraAmt = ~0;
22423 if (Mask.getOpcode() == ISD::SRA) {
22424 if (auto *AmtBV = dyn_cast<BuildVectorSDNode>(Mask.getOperand(1)))
22425 if (auto *AmtConst = AmtBV->getConstantSplatNode())
22426 SraAmt = AmtConst->getZExtValue();
22427 } else if (Mask.getOpcode() == X86ISD::VSRAI) {
22428 SDValue SraC = Mask.getOperand(1);
22429 SraAmt = cast<ConstantSDNode>(SraC)->getZExtValue();
22431 if ((SraAmt + 1) != EltBits)
22436 // Now we know we at least have a plendvb with the mask val. See if
22437 // we can form a psignb/w/d.
22438 // psign = x.type == y.type == mask.type && y = sub(0, x);
22439 if (Y.getOpcode() == ISD::SUB && Y.getOperand(1) == X &&
22440 ISD::isBuildVectorAllZeros(Y.getOperand(0).getNode()) &&
22441 X.getValueType() == MaskVT && Y.getValueType() == MaskVT) {
22442 assert((EltBits == 8 || EltBits == 16 || EltBits == 32) &&
22443 "Unsupported VT for PSIGN");
22444 Mask = DAG.getNode(X86ISD::PSIGN, DL, MaskVT, X, Mask.getOperand(0));
22445 return DAG.getNode(ISD::BITCAST, DL, VT, Mask);
22447 // PBLENDVB only available on SSE 4.1
22448 if (!Subtarget->hasSSE41())
22451 EVT BlendVT = (VT == MVT::v4i64) ? MVT::v32i8 : MVT::v16i8;
22453 X = DAG.getNode(ISD::BITCAST, DL, BlendVT, X);
22454 Y = DAG.getNode(ISD::BITCAST, DL, BlendVT, Y);
22455 Mask = DAG.getNode(ISD::BITCAST, DL, BlendVT, Mask);
22456 Mask = DAG.getNode(ISD::VSELECT, DL, BlendVT, Mask, Y, X);
22457 return DAG.getNode(ISD::BITCAST, DL, VT, Mask);
22461 if (VT != MVT::i16 && VT != MVT::i32 && VT != MVT::i64)
22464 // fold (or (x << c) | (y >> (64 - c))) ==> (shld64 x, y, c)
22465 MachineFunction &MF = DAG.getMachineFunction();
22466 bool OptForSize = MF.getFunction()->getAttributes().
22467 hasAttribute(AttributeSet::FunctionIndex, Attribute::OptimizeForSize);
22469 // SHLD/SHRD instructions have lower register pressure, but on some
22470 // platforms they have higher latency than the equivalent
22471 // series of shifts/or that would otherwise be generated.
22472 // Don't fold (or (x << c) | (y >> (64 - c))) if SHLD/SHRD instructions
22473 // have higher latencies and we are not optimizing for size.
22474 if (!OptForSize && Subtarget->isSHLDSlow())
22477 if (N0.getOpcode() == ISD::SRL && N1.getOpcode() == ISD::SHL)
22479 if (N0.getOpcode() != ISD::SHL || N1.getOpcode() != ISD::SRL)
22481 if (!N0.hasOneUse() || !N1.hasOneUse())
22484 SDValue ShAmt0 = N0.getOperand(1);
22485 if (ShAmt0.getValueType() != MVT::i8)
22487 SDValue ShAmt1 = N1.getOperand(1);
22488 if (ShAmt1.getValueType() != MVT::i8)
22490 if (ShAmt0.getOpcode() == ISD::TRUNCATE)
22491 ShAmt0 = ShAmt0.getOperand(0);
22492 if (ShAmt1.getOpcode() == ISD::TRUNCATE)
22493 ShAmt1 = ShAmt1.getOperand(0);
22496 unsigned Opc = X86ISD::SHLD;
22497 SDValue Op0 = N0.getOperand(0);
22498 SDValue Op1 = N1.getOperand(0);
22499 if (ShAmt0.getOpcode() == ISD::SUB) {
22500 Opc = X86ISD::SHRD;
22501 std::swap(Op0, Op1);
22502 std::swap(ShAmt0, ShAmt1);
22505 unsigned Bits = VT.getSizeInBits();
22506 if (ShAmt1.getOpcode() == ISD::SUB) {
22507 SDValue Sum = ShAmt1.getOperand(0);
22508 if (ConstantSDNode *SumC = dyn_cast<ConstantSDNode>(Sum)) {
22509 SDValue ShAmt1Op1 = ShAmt1.getOperand(1);
22510 if (ShAmt1Op1.getNode()->getOpcode() == ISD::TRUNCATE)
22511 ShAmt1Op1 = ShAmt1Op1.getOperand(0);
22512 if (SumC->getSExtValue() == Bits && ShAmt1Op1 == ShAmt0)
22513 return DAG.getNode(Opc, DL, VT,
22515 DAG.getNode(ISD::TRUNCATE, DL,
22518 } else if (ConstantSDNode *ShAmt1C = dyn_cast<ConstantSDNode>(ShAmt1)) {
22519 ConstantSDNode *ShAmt0C = dyn_cast<ConstantSDNode>(ShAmt0);
22521 ShAmt0C->getSExtValue() + ShAmt1C->getSExtValue() == Bits)
22522 return DAG.getNode(Opc, DL, VT,
22523 N0.getOperand(0), N1.getOperand(0),
22524 DAG.getNode(ISD::TRUNCATE, DL,
22531 // Generate NEG and CMOV for integer abs.
22532 static SDValue performIntegerAbsCombine(SDNode *N, SelectionDAG &DAG) {
22533 EVT VT = N->getValueType(0);
22535 // Since X86 does not have CMOV for 8-bit integer, we don't convert
22536 // 8-bit integer abs to NEG and CMOV.
22537 if (VT.isInteger() && VT.getSizeInBits() == 8)
22540 SDValue N0 = N->getOperand(0);
22541 SDValue N1 = N->getOperand(1);
22544 // Check pattern of XOR(ADD(X,Y), Y) where Y is SRA(X, size(X)-1)
22545 // and change it to SUB and CMOV.
22546 if (VT.isInteger() && N->getOpcode() == ISD::XOR &&
22547 N0.getOpcode() == ISD::ADD &&
22548 N0.getOperand(1) == N1 &&
22549 N1.getOpcode() == ISD::SRA &&
22550 N1.getOperand(0) == N0.getOperand(0))
22551 if (ConstantSDNode *Y1C = dyn_cast<ConstantSDNode>(N1.getOperand(1)))
22552 if (Y1C->getAPIntValue() == VT.getSizeInBits()-1) {
22553 // Generate SUB & CMOV.
22554 SDValue Neg = DAG.getNode(X86ISD::SUB, DL, DAG.getVTList(VT, MVT::i32),
22555 DAG.getConstant(0, VT), N0.getOperand(0));
22557 SDValue Ops[] = { N0.getOperand(0), Neg,
22558 DAG.getConstant(X86::COND_GE, MVT::i8),
22559 SDValue(Neg.getNode(), 1) };
22560 return DAG.getNode(X86ISD::CMOV, DL, DAG.getVTList(VT, MVT::Glue), Ops);
22565 // PerformXorCombine - Attempts to turn XOR nodes into BLSMSK nodes
22566 static SDValue PerformXorCombine(SDNode *N, SelectionDAG &DAG,
22567 TargetLowering::DAGCombinerInfo &DCI,
22568 const X86Subtarget *Subtarget) {
22569 if (DCI.isBeforeLegalizeOps())
22572 if (Subtarget->hasCMov()) {
22573 SDValue RV = performIntegerAbsCombine(N, DAG);
22581 /// PerformLOADCombine - Do target-specific dag combines on LOAD nodes.
22582 static SDValue PerformLOADCombine(SDNode *N, SelectionDAG &DAG,
22583 TargetLowering::DAGCombinerInfo &DCI,
22584 const X86Subtarget *Subtarget) {
22585 LoadSDNode *Ld = cast<LoadSDNode>(N);
22586 EVT RegVT = Ld->getValueType(0);
22587 EVT MemVT = Ld->getMemoryVT();
22589 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
22591 // On Sandybridge unaligned 256bit loads are inefficient.
22592 ISD::LoadExtType Ext = Ld->getExtensionType();
22593 unsigned Alignment = Ld->getAlignment();
22594 bool IsAligned = Alignment == 0 || Alignment >= MemVT.getSizeInBits()/8;
22595 if (RegVT.is256BitVector() && !Subtarget->hasInt256() &&
22596 !DCI.isBeforeLegalizeOps() && !IsAligned && Ext == ISD::NON_EXTLOAD) {
22597 unsigned NumElems = RegVT.getVectorNumElements();
22601 SDValue Ptr = Ld->getBasePtr();
22602 SDValue Increment = DAG.getConstant(16, TLI.getPointerTy());
22604 EVT HalfVT = EVT::getVectorVT(*DAG.getContext(), MemVT.getScalarType(),
22606 SDValue Load1 = DAG.getLoad(HalfVT, dl, Ld->getChain(), Ptr,
22607 Ld->getPointerInfo(), Ld->isVolatile(),
22608 Ld->isNonTemporal(), Ld->isInvariant(),
22610 Ptr = DAG.getNode(ISD::ADD, dl, Ptr.getValueType(), Ptr, Increment);
22611 SDValue Load2 = DAG.getLoad(HalfVT, dl, Ld->getChain(), Ptr,
22612 Ld->getPointerInfo(), Ld->isVolatile(),
22613 Ld->isNonTemporal(), Ld->isInvariant(),
22614 std::min(16U, Alignment));
22615 SDValue TF = DAG.getNode(ISD::TokenFactor, dl, MVT::Other,
22617 Load2.getValue(1));
22619 SDValue NewVec = DAG.getUNDEF(RegVT);
22620 NewVec = Insert128BitVector(NewVec, Load1, 0, DAG, dl);
22621 NewVec = Insert128BitVector(NewVec, Load2, NumElems/2, DAG, dl);
22622 return DCI.CombineTo(N, NewVec, TF, true);
22628 /// PerformSTORECombine - Do target-specific dag combines on STORE nodes.
22629 static SDValue PerformSTORECombine(SDNode *N, SelectionDAG &DAG,
22630 const X86Subtarget *Subtarget) {
22631 StoreSDNode *St = cast<StoreSDNode>(N);
22632 EVT VT = St->getValue().getValueType();
22633 EVT StVT = St->getMemoryVT();
22635 SDValue StoredVal = St->getOperand(1);
22636 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
22638 // If we are saving a concatenation of two XMM registers, perform two stores.
22639 // On Sandy Bridge, 256-bit memory operations are executed by two
22640 // 128-bit ports. However, on Haswell it is better to issue a single 256-bit
22641 // memory operation.
22642 unsigned Alignment = St->getAlignment();
22643 bool IsAligned = Alignment == 0 || Alignment >= VT.getSizeInBits()/8;
22644 if (VT.is256BitVector() && !Subtarget->hasInt256() &&
22645 StVT == VT && !IsAligned) {
22646 unsigned NumElems = VT.getVectorNumElements();
22650 SDValue Value0 = Extract128BitVector(StoredVal, 0, DAG, dl);
22651 SDValue Value1 = Extract128BitVector(StoredVal, NumElems/2, DAG, dl);
22653 SDValue Stride = DAG.getConstant(16, TLI.getPointerTy());
22654 SDValue Ptr0 = St->getBasePtr();
22655 SDValue Ptr1 = DAG.getNode(ISD::ADD, dl, Ptr0.getValueType(), Ptr0, Stride);
22657 SDValue Ch0 = DAG.getStore(St->getChain(), dl, Value0, Ptr0,
22658 St->getPointerInfo(), St->isVolatile(),
22659 St->isNonTemporal(), Alignment);
22660 SDValue Ch1 = DAG.getStore(St->getChain(), dl, Value1, Ptr1,
22661 St->getPointerInfo(), St->isVolatile(),
22662 St->isNonTemporal(),
22663 std::min(16U, Alignment));
22664 return DAG.getNode(ISD::TokenFactor, dl, MVT::Other, Ch0, Ch1);
22667 // Optimize trunc store (of multiple scalars) to shuffle and store.
22668 // First, pack all of the elements in one place. Next, store to memory
22669 // in fewer chunks.
22670 if (St->isTruncatingStore() && VT.isVector()) {
22671 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
22672 unsigned NumElems = VT.getVectorNumElements();
22673 assert(StVT != VT && "Cannot truncate to the same type");
22674 unsigned FromSz = VT.getVectorElementType().getSizeInBits();
22675 unsigned ToSz = StVT.getVectorElementType().getSizeInBits();
22677 // From, To sizes and ElemCount must be pow of two
22678 if (!isPowerOf2_32(NumElems * FromSz * ToSz)) return SDValue();
22679 // We are going to use the original vector elt for storing.
22680 // Accumulated smaller vector elements must be a multiple of the store size.
22681 if (0 != (NumElems * FromSz) % ToSz) return SDValue();
22683 unsigned SizeRatio = FromSz / ToSz;
22685 assert(SizeRatio * NumElems * ToSz == VT.getSizeInBits());
22687 // Create a type on which we perform the shuffle
22688 EVT WideVecVT = EVT::getVectorVT(*DAG.getContext(),
22689 StVT.getScalarType(), NumElems*SizeRatio);
22691 assert(WideVecVT.getSizeInBits() == VT.getSizeInBits());
22693 SDValue WideVec = DAG.getNode(ISD::BITCAST, dl, WideVecVT, St->getValue());
22694 SmallVector<int, 8> ShuffleVec(NumElems * SizeRatio, -1);
22695 for (unsigned i = 0; i != NumElems; ++i)
22696 ShuffleVec[i] = i * SizeRatio;
22698 // Can't shuffle using an illegal type.
22699 if (!TLI.isTypeLegal(WideVecVT))
22702 SDValue Shuff = DAG.getVectorShuffle(WideVecVT, dl, WideVec,
22703 DAG.getUNDEF(WideVecVT),
22705 // At this point all of the data is stored at the bottom of the
22706 // register. We now need to save it to mem.
22708 // Find the largest store unit
22709 MVT StoreType = MVT::i8;
22710 for (unsigned tp = MVT::FIRST_INTEGER_VALUETYPE;
22711 tp < MVT::LAST_INTEGER_VALUETYPE; ++tp) {
22712 MVT Tp = (MVT::SimpleValueType)tp;
22713 if (TLI.isTypeLegal(Tp) && Tp.getSizeInBits() <= NumElems * ToSz)
22717 // On 32bit systems, we can't save 64bit integers. Try bitcasting to F64.
22718 if (TLI.isTypeLegal(MVT::f64) && StoreType.getSizeInBits() < 64 &&
22719 (64 <= NumElems * ToSz))
22720 StoreType = MVT::f64;
22722 // Bitcast the original vector into a vector of store-size units
22723 EVT StoreVecVT = EVT::getVectorVT(*DAG.getContext(),
22724 StoreType, VT.getSizeInBits()/StoreType.getSizeInBits());
22725 assert(StoreVecVT.getSizeInBits() == VT.getSizeInBits());
22726 SDValue ShuffWide = DAG.getNode(ISD::BITCAST, dl, StoreVecVT, Shuff);
22727 SmallVector<SDValue, 8> Chains;
22728 SDValue Increment = DAG.getConstant(StoreType.getSizeInBits()/8,
22729 TLI.getPointerTy());
22730 SDValue Ptr = St->getBasePtr();
22732 // Perform one or more big stores into memory.
22733 for (unsigned i=0, e=(ToSz*NumElems)/StoreType.getSizeInBits(); i!=e; ++i) {
22734 SDValue SubVec = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl,
22735 StoreType, ShuffWide,
22736 DAG.getIntPtrConstant(i));
22737 SDValue Ch = DAG.getStore(St->getChain(), dl, SubVec, Ptr,
22738 St->getPointerInfo(), St->isVolatile(),
22739 St->isNonTemporal(), St->getAlignment());
22740 Ptr = DAG.getNode(ISD::ADD, dl, Ptr.getValueType(), Ptr, Increment);
22741 Chains.push_back(Ch);
22744 return DAG.getNode(ISD::TokenFactor, dl, MVT::Other, Chains);
22747 // Turn load->store of MMX types into GPR load/stores. This avoids clobbering
22748 // the FP state in cases where an emms may be missing.
22749 // A preferable solution to the general problem is to figure out the right
22750 // places to insert EMMS. This qualifies as a quick hack.
22752 // Similarly, turn load->store of i64 into double load/stores in 32-bit mode.
22753 if (VT.getSizeInBits() != 64)
22756 const Function *F = DAG.getMachineFunction().getFunction();
22757 bool NoImplicitFloatOps = F->getAttributes().
22758 hasAttribute(AttributeSet::FunctionIndex, Attribute::NoImplicitFloat);
22759 bool F64IsLegal = !DAG.getTarget().Options.UseSoftFloat && !NoImplicitFloatOps
22760 && Subtarget->hasSSE2();
22761 if ((VT.isVector() ||
22762 (VT == MVT::i64 && F64IsLegal && !Subtarget->is64Bit())) &&
22763 isa<LoadSDNode>(St->getValue()) &&
22764 !cast<LoadSDNode>(St->getValue())->isVolatile() &&
22765 St->getChain().hasOneUse() && !St->isVolatile()) {
22766 SDNode* LdVal = St->getValue().getNode();
22767 LoadSDNode *Ld = nullptr;
22768 int TokenFactorIndex = -1;
22769 SmallVector<SDValue, 8> Ops;
22770 SDNode* ChainVal = St->getChain().getNode();
22771 // Must be a store of a load. We currently handle two cases: the load
22772 // is a direct child, and it's under an intervening TokenFactor. It is
22773 // possible to dig deeper under nested TokenFactors.
22774 if (ChainVal == LdVal)
22775 Ld = cast<LoadSDNode>(St->getChain());
22776 else if (St->getValue().hasOneUse() &&
22777 ChainVal->getOpcode() == ISD::TokenFactor) {
22778 for (unsigned i = 0, e = ChainVal->getNumOperands(); i != e; ++i) {
22779 if (ChainVal->getOperand(i).getNode() == LdVal) {
22780 TokenFactorIndex = i;
22781 Ld = cast<LoadSDNode>(St->getValue());
22783 Ops.push_back(ChainVal->getOperand(i));
22787 if (!Ld || !ISD::isNormalLoad(Ld))
22790 // If this is not the MMX case, i.e. we are just turning i64 load/store
22791 // into f64 load/store, avoid the transformation if there are multiple
22792 // uses of the loaded value.
22793 if (!VT.isVector() && !Ld->hasNUsesOfValue(1, 0))
22798 // If we are a 64-bit capable x86, lower to a single movq load/store pair.
22799 // Otherwise, if it's legal to use f64 SSE instructions, use f64 load/store
22801 if (Subtarget->is64Bit() || F64IsLegal) {
22802 EVT LdVT = Subtarget->is64Bit() ? MVT::i64 : MVT::f64;
22803 SDValue NewLd = DAG.getLoad(LdVT, LdDL, Ld->getChain(), Ld->getBasePtr(),
22804 Ld->getPointerInfo(), Ld->isVolatile(),
22805 Ld->isNonTemporal(), Ld->isInvariant(),
22806 Ld->getAlignment());
22807 SDValue NewChain = NewLd.getValue(1);
22808 if (TokenFactorIndex != -1) {
22809 Ops.push_back(NewChain);
22810 NewChain = DAG.getNode(ISD::TokenFactor, LdDL, MVT::Other, Ops);
22812 return DAG.getStore(NewChain, StDL, NewLd, St->getBasePtr(),
22813 St->getPointerInfo(),
22814 St->isVolatile(), St->isNonTemporal(),
22815 St->getAlignment());
22818 // Otherwise, lower to two pairs of 32-bit loads / stores.
22819 SDValue LoAddr = Ld->getBasePtr();
22820 SDValue HiAddr = DAG.getNode(ISD::ADD, LdDL, MVT::i32, LoAddr,
22821 DAG.getConstant(4, MVT::i32));
22823 SDValue LoLd = DAG.getLoad(MVT::i32, LdDL, Ld->getChain(), LoAddr,
22824 Ld->getPointerInfo(),
22825 Ld->isVolatile(), Ld->isNonTemporal(),
22826 Ld->isInvariant(), Ld->getAlignment());
22827 SDValue HiLd = DAG.getLoad(MVT::i32, LdDL, Ld->getChain(), HiAddr,
22828 Ld->getPointerInfo().getWithOffset(4),
22829 Ld->isVolatile(), Ld->isNonTemporal(),
22831 MinAlign(Ld->getAlignment(), 4));
22833 SDValue NewChain = LoLd.getValue(1);
22834 if (TokenFactorIndex != -1) {
22835 Ops.push_back(LoLd);
22836 Ops.push_back(HiLd);
22837 NewChain = DAG.getNode(ISD::TokenFactor, LdDL, MVT::Other, Ops);
22840 LoAddr = St->getBasePtr();
22841 HiAddr = DAG.getNode(ISD::ADD, StDL, MVT::i32, LoAddr,
22842 DAG.getConstant(4, MVT::i32));
22844 SDValue LoSt = DAG.getStore(NewChain, StDL, LoLd, LoAddr,
22845 St->getPointerInfo(),
22846 St->isVolatile(), St->isNonTemporal(),
22847 St->getAlignment());
22848 SDValue HiSt = DAG.getStore(NewChain, StDL, HiLd, HiAddr,
22849 St->getPointerInfo().getWithOffset(4),
22851 St->isNonTemporal(),
22852 MinAlign(St->getAlignment(), 4));
22853 return DAG.getNode(ISD::TokenFactor, StDL, MVT::Other, LoSt, HiSt);
22858 /// isHorizontalBinOp - Return 'true' if this vector operation is "horizontal"
22859 /// and return the operands for the horizontal operation in LHS and RHS. A
22860 /// horizontal operation performs the binary operation on successive elements
22861 /// of its first operand, then on successive elements of its second operand,
22862 /// returning the resulting values in a vector. For example, if
22863 /// A = < float a0, float a1, float a2, float a3 >
22865 /// B = < float b0, float b1, float b2, float b3 >
22866 /// then the result of doing a horizontal operation on A and B is
22867 /// A horizontal-op B = < a0 op a1, a2 op a3, b0 op b1, b2 op b3 >.
22868 /// In short, LHS and RHS are inspected to see if LHS op RHS is of the form
22869 /// A horizontal-op B, for some already available A and B, and if so then LHS is
22870 /// set to A, RHS to B, and the routine returns 'true'.
22871 /// Note that the binary operation should have the property that if one of the
22872 /// operands is UNDEF then the result is UNDEF.
22873 static bool isHorizontalBinOp(SDValue &LHS, SDValue &RHS, bool IsCommutative) {
22874 // Look for the following pattern: if
22875 // A = < float a0, float a1, float a2, float a3 >
22876 // B = < float b0, float b1, float b2, float b3 >
22878 // LHS = VECTOR_SHUFFLE A, B, <0, 2, 4, 6>
22879 // RHS = VECTOR_SHUFFLE A, B, <1, 3, 5, 7>
22880 // then LHS op RHS = < a0 op a1, a2 op a3, b0 op b1, b2 op b3 >
22881 // which is A horizontal-op B.
22883 // At least one of the operands should be a vector shuffle.
22884 if (LHS.getOpcode() != ISD::VECTOR_SHUFFLE &&
22885 RHS.getOpcode() != ISD::VECTOR_SHUFFLE)
22888 MVT VT = LHS.getSimpleValueType();
22890 assert((VT.is128BitVector() || VT.is256BitVector()) &&
22891 "Unsupported vector type for horizontal add/sub");
22893 // Handle 128 and 256-bit vector lengths. AVX defines horizontal add/sub to
22894 // operate independently on 128-bit lanes.
22895 unsigned NumElts = VT.getVectorNumElements();
22896 unsigned NumLanes = VT.getSizeInBits()/128;
22897 unsigned NumLaneElts = NumElts / NumLanes;
22898 assert((NumLaneElts % 2 == 0) &&
22899 "Vector type should have an even number of elements in each lane");
22900 unsigned HalfLaneElts = NumLaneElts/2;
22902 // View LHS in the form
22903 // LHS = VECTOR_SHUFFLE A, B, LMask
22904 // If LHS is not a shuffle then pretend it is the shuffle
22905 // LHS = VECTOR_SHUFFLE LHS, undef, <0, 1, ..., N-1>
22906 // NOTE: in what follows a default initialized SDValue represents an UNDEF of
22909 SmallVector<int, 16> LMask(NumElts);
22910 if (LHS.getOpcode() == ISD::VECTOR_SHUFFLE) {
22911 if (LHS.getOperand(0).getOpcode() != ISD::UNDEF)
22912 A = LHS.getOperand(0);
22913 if (LHS.getOperand(1).getOpcode() != ISD::UNDEF)
22914 B = LHS.getOperand(1);
22915 ArrayRef<int> Mask = cast<ShuffleVectorSDNode>(LHS.getNode())->getMask();
22916 std::copy(Mask.begin(), Mask.end(), LMask.begin());
22918 if (LHS.getOpcode() != ISD::UNDEF)
22920 for (unsigned i = 0; i != NumElts; ++i)
22924 // Likewise, view RHS in the form
22925 // RHS = VECTOR_SHUFFLE C, D, RMask
22927 SmallVector<int, 16> RMask(NumElts);
22928 if (RHS.getOpcode() == ISD::VECTOR_SHUFFLE) {
22929 if (RHS.getOperand(0).getOpcode() != ISD::UNDEF)
22930 C = RHS.getOperand(0);
22931 if (RHS.getOperand(1).getOpcode() != ISD::UNDEF)
22932 D = RHS.getOperand(1);
22933 ArrayRef<int> Mask = cast<ShuffleVectorSDNode>(RHS.getNode())->getMask();
22934 std::copy(Mask.begin(), Mask.end(), RMask.begin());
22936 if (RHS.getOpcode() != ISD::UNDEF)
22938 for (unsigned i = 0; i != NumElts; ++i)
22942 // Check that the shuffles are both shuffling the same vectors.
22943 if (!(A == C && B == D) && !(A == D && B == C))
22946 // If everything is UNDEF then bail out: it would be better to fold to UNDEF.
22947 if (!A.getNode() && !B.getNode())
22950 // If A and B occur in reverse order in RHS, then "swap" them (which means
22951 // rewriting the mask).
22953 CommuteVectorShuffleMask(RMask, NumElts);
22955 // At this point LHS and RHS are equivalent to
22956 // LHS = VECTOR_SHUFFLE A, B, LMask
22957 // RHS = VECTOR_SHUFFLE A, B, RMask
22958 // Check that the masks correspond to performing a horizontal operation.
22959 for (unsigned l = 0; l != NumElts; l += NumLaneElts) {
22960 for (unsigned i = 0; i != NumLaneElts; ++i) {
22961 int LIdx = LMask[i+l], RIdx = RMask[i+l];
22963 // Ignore any UNDEF components.
22964 if (LIdx < 0 || RIdx < 0 ||
22965 (!A.getNode() && (LIdx < (int)NumElts || RIdx < (int)NumElts)) ||
22966 (!B.getNode() && (LIdx >= (int)NumElts || RIdx >= (int)NumElts)))
22969 // Check that successive elements are being operated on. If not, this is
22970 // not a horizontal operation.
22971 unsigned Src = (i/HalfLaneElts); // each lane is split between srcs
22972 int Index = 2*(i%HalfLaneElts) + NumElts*Src + l;
22973 if (!(LIdx == Index && RIdx == Index + 1) &&
22974 !(IsCommutative && LIdx == Index + 1 && RIdx == Index))
22979 LHS = A.getNode() ? A : B; // If A is 'UNDEF', use B for it.
22980 RHS = B.getNode() ? B : A; // If B is 'UNDEF', use A for it.
22984 /// PerformFADDCombine - Do target-specific dag combines on floating point adds.
22985 static SDValue PerformFADDCombine(SDNode *N, SelectionDAG &DAG,
22986 const X86Subtarget *Subtarget) {
22987 EVT VT = N->getValueType(0);
22988 SDValue LHS = N->getOperand(0);
22989 SDValue RHS = N->getOperand(1);
22991 // Try to synthesize horizontal adds from adds of shuffles.
22992 if (((Subtarget->hasSSE3() && (VT == MVT::v4f32 || VT == MVT::v2f64)) ||
22993 (Subtarget->hasFp256() && (VT == MVT::v8f32 || VT == MVT::v4f64))) &&
22994 isHorizontalBinOp(LHS, RHS, true))
22995 return DAG.getNode(X86ISD::FHADD, SDLoc(N), VT, LHS, RHS);
22999 /// PerformFSUBCombine - Do target-specific dag combines on floating point subs.
23000 static SDValue PerformFSUBCombine(SDNode *N, SelectionDAG &DAG,
23001 const X86Subtarget *Subtarget) {
23002 EVT VT = N->getValueType(0);
23003 SDValue LHS = N->getOperand(0);
23004 SDValue RHS = N->getOperand(1);
23006 // Try to synthesize horizontal subs from subs of shuffles.
23007 if (((Subtarget->hasSSE3() && (VT == MVT::v4f32 || VT == MVT::v2f64)) ||
23008 (Subtarget->hasFp256() && (VT == MVT::v8f32 || VT == MVT::v4f64))) &&
23009 isHorizontalBinOp(LHS, RHS, false))
23010 return DAG.getNode(X86ISD::FHSUB, SDLoc(N), VT, LHS, RHS);
23014 /// PerformFORCombine - Do target-specific dag combines on X86ISD::FOR and
23015 /// X86ISD::FXOR nodes.
23016 static SDValue PerformFORCombine(SDNode *N, SelectionDAG &DAG) {
23017 assert(N->getOpcode() == X86ISD::FOR || N->getOpcode() == X86ISD::FXOR);
23018 // F[X]OR(0.0, x) -> x
23019 // F[X]OR(x, 0.0) -> x
23020 if (ConstantFPSDNode *C = dyn_cast<ConstantFPSDNode>(N->getOperand(0)))
23021 if (C->getValueAPF().isPosZero())
23022 return N->getOperand(1);
23023 if (ConstantFPSDNode *C = dyn_cast<ConstantFPSDNode>(N->getOperand(1)))
23024 if (C->getValueAPF().isPosZero())
23025 return N->getOperand(0);
23029 /// PerformFMinFMaxCombine - Do target-specific dag combines on X86ISD::FMIN and
23030 /// X86ISD::FMAX nodes.
23031 static SDValue PerformFMinFMaxCombine(SDNode *N, SelectionDAG &DAG) {
23032 assert(N->getOpcode() == X86ISD::FMIN || N->getOpcode() == X86ISD::FMAX);
23034 // Only perform optimizations if UnsafeMath is used.
23035 if (!DAG.getTarget().Options.UnsafeFPMath)
23038 // If we run in unsafe-math mode, then convert the FMAX and FMIN nodes
23039 // into FMINC and FMAXC, which are Commutative operations.
23040 unsigned NewOp = 0;
23041 switch (N->getOpcode()) {
23042 default: llvm_unreachable("unknown opcode");
23043 case X86ISD::FMIN: NewOp = X86ISD::FMINC; break;
23044 case X86ISD::FMAX: NewOp = X86ISD::FMAXC; break;
23047 return DAG.getNode(NewOp, SDLoc(N), N->getValueType(0),
23048 N->getOperand(0), N->getOperand(1));
23051 /// PerformFANDCombine - Do target-specific dag combines on X86ISD::FAND nodes.
23052 static SDValue PerformFANDCombine(SDNode *N, SelectionDAG &DAG) {
23053 // FAND(0.0, x) -> 0.0
23054 // FAND(x, 0.0) -> 0.0
23055 if (ConstantFPSDNode *C = dyn_cast<ConstantFPSDNode>(N->getOperand(0)))
23056 if (C->getValueAPF().isPosZero())
23057 return N->getOperand(0);
23058 if (ConstantFPSDNode *C = dyn_cast<ConstantFPSDNode>(N->getOperand(1)))
23059 if (C->getValueAPF().isPosZero())
23060 return N->getOperand(1);
23064 /// PerformFANDNCombine - Do target-specific dag combines on X86ISD::FANDN nodes
23065 static SDValue PerformFANDNCombine(SDNode *N, SelectionDAG &DAG) {
23066 // FANDN(x, 0.0) -> 0.0
23067 // FANDN(0.0, x) -> x
23068 if (ConstantFPSDNode *C = dyn_cast<ConstantFPSDNode>(N->getOperand(0)))
23069 if (C->getValueAPF().isPosZero())
23070 return N->getOperand(1);
23071 if (ConstantFPSDNode *C = dyn_cast<ConstantFPSDNode>(N->getOperand(1)))
23072 if (C->getValueAPF().isPosZero())
23073 return N->getOperand(1);
23077 static SDValue PerformBTCombine(SDNode *N,
23079 TargetLowering::DAGCombinerInfo &DCI) {
23080 // BT ignores high bits in the bit index operand.
23081 SDValue Op1 = N->getOperand(1);
23082 if (Op1.hasOneUse()) {
23083 unsigned BitWidth = Op1.getValueSizeInBits();
23084 APInt DemandedMask = APInt::getLowBitsSet(BitWidth, Log2_32(BitWidth));
23085 APInt KnownZero, KnownOne;
23086 TargetLowering::TargetLoweringOpt TLO(DAG, !DCI.isBeforeLegalize(),
23087 !DCI.isBeforeLegalizeOps());
23088 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
23089 if (TLO.ShrinkDemandedConstant(Op1, DemandedMask) ||
23090 TLI.SimplifyDemandedBits(Op1, DemandedMask, KnownZero, KnownOne, TLO))
23091 DCI.CommitTargetLoweringOpt(TLO);
23096 static SDValue PerformVZEXT_MOVLCombine(SDNode *N, SelectionDAG &DAG) {
23097 SDValue Op = N->getOperand(0);
23098 if (Op.getOpcode() == ISD::BITCAST)
23099 Op = Op.getOperand(0);
23100 EVT VT = N->getValueType(0), OpVT = Op.getValueType();
23101 if (Op.getOpcode() == X86ISD::VZEXT_LOAD &&
23102 VT.getVectorElementType().getSizeInBits() ==
23103 OpVT.getVectorElementType().getSizeInBits()) {
23104 return DAG.getNode(ISD::BITCAST, SDLoc(N), VT, Op);
23109 static SDValue PerformSIGN_EXTEND_INREGCombine(SDNode *N, SelectionDAG &DAG,
23110 const X86Subtarget *Subtarget) {
23111 EVT VT = N->getValueType(0);
23112 if (!VT.isVector())
23115 SDValue N0 = N->getOperand(0);
23116 SDValue N1 = N->getOperand(1);
23117 EVT ExtraVT = cast<VTSDNode>(N1)->getVT();
23120 // The SIGN_EXTEND_INREG to v4i64 is expensive operation on the
23121 // both SSE and AVX2 since there is no sign-extended shift right
23122 // operation on a vector with 64-bit elements.
23123 //(sext_in_reg (v4i64 anyext (v4i32 x )), ExtraVT) ->
23124 // (v4i64 sext (v4i32 sext_in_reg (v4i32 x , ExtraVT)))
23125 if (VT == MVT::v4i64 && (N0.getOpcode() == ISD::ANY_EXTEND ||
23126 N0.getOpcode() == ISD::SIGN_EXTEND)) {
23127 SDValue N00 = N0.getOperand(0);
23129 // EXTLOAD has a better solution on AVX2,
23130 // it may be replaced with X86ISD::VSEXT node.
23131 if (N00.getOpcode() == ISD::LOAD && Subtarget->hasInt256())
23132 if (!ISD::isNormalLoad(N00.getNode()))
23135 if (N00.getValueType() == MVT::v4i32 && ExtraVT.getSizeInBits() < 128) {
23136 SDValue Tmp = DAG.getNode(ISD::SIGN_EXTEND_INREG, dl, MVT::v4i32,
23138 return DAG.getNode(ISD::SIGN_EXTEND, dl, MVT::v4i64, Tmp);
23144 static SDValue PerformSExtCombine(SDNode *N, SelectionDAG &DAG,
23145 TargetLowering::DAGCombinerInfo &DCI,
23146 const X86Subtarget *Subtarget) {
23147 if (!DCI.isBeforeLegalizeOps())
23150 if (!Subtarget->hasFp256())
23153 EVT VT = N->getValueType(0);
23154 if (VT.isVector() && VT.getSizeInBits() == 256) {
23155 SDValue R = WidenMaskArithmetic(N, DAG, DCI, Subtarget);
23163 static SDValue PerformFMACombine(SDNode *N, SelectionDAG &DAG,
23164 const X86Subtarget* Subtarget) {
23166 EVT VT = N->getValueType(0);
23168 // Let legalize expand this if it isn't a legal type yet.
23169 if (!DAG.getTargetLoweringInfo().isTypeLegal(VT))
23172 EVT ScalarVT = VT.getScalarType();
23173 if ((ScalarVT != MVT::f32 && ScalarVT != MVT::f64) ||
23174 (!Subtarget->hasFMA() && !Subtarget->hasFMA4()))
23177 SDValue A = N->getOperand(0);
23178 SDValue B = N->getOperand(1);
23179 SDValue C = N->getOperand(2);
23181 bool NegA = (A.getOpcode() == ISD::FNEG);
23182 bool NegB = (B.getOpcode() == ISD::FNEG);
23183 bool NegC = (C.getOpcode() == ISD::FNEG);
23185 // Negative multiplication when NegA xor NegB
23186 bool NegMul = (NegA != NegB);
23188 A = A.getOperand(0);
23190 B = B.getOperand(0);
23192 C = C.getOperand(0);
23196 Opcode = (!NegC) ? X86ISD::FMADD : X86ISD::FMSUB;
23198 Opcode = (!NegC) ? X86ISD::FNMADD : X86ISD::FNMSUB;
23200 return DAG.getNode(Opcode, dl, VT, A, B, C);
23203 static SDValue PerformZExtCombine(SDNode *N, SelectionDAG &DAG,
23204 TargetLowering::DAGCombinerInfo &DCI,
23205 const X86Subtarget *Subtarget) {
23206 // (i32 zext (and (i8 x86isd::setcc_carry), 1)) ->
23207 // (and (i32 x86isd::setcc_carry), 1)
23208 // This eliminates the zext. This transformation is necessary because
23209 // ISD::SETCC is always legalized to i8.
23211 SDValue N0 = N->getOperand(0);
23212 EVT VT = N->getValueType(0);
23214 if (N0.getOpcode() == ISD::AND &&
23216 N0.getOperand(0).hasOneUse()) {
23217 SDValue N00 = N0.getOperand(0);
23218 if (N00.getOpcode() == X86ISD::SETCC_CARRY) {
23219 ConstantSDNode *C = dyn_cast<ConstantSDNode>(N0.getOperand(1));
23220 if (!C || C->getZExtValue() != 1)
23222 return DAG.getNode(ISD::AND, dl, VT,
23223 DAG.getNode(X86ISD::SETCC_CARRY, dl, VT,
23224 N00.getOperand(0), N00.getOperand(1)),
23225 DAG.getConstant(1, VT));
23229 if (N0.getOpcode() == ISD::TRUNCATE &&
23231 N0.getOperand(0).hasOneUse()) {
23232 SDValue N00 = N0.getOperand(0);
23233 if (N00.getOpcode() == X86ISD::SETCC_CARRY) {
23234 return DAG.getNode(ISD::AND, dl, VT,
23235 DAG.getNode(X86ISD::SETCC_CARRY, dl, VT,
23236 N00.getOperand(0), N00.getOperand(1)),
23237 DAG.getConstant(1, VT));
23240 if (VT.is256BitVector()) {
23241 SDValue R = WidenMaskArithmetic(N, DAG, DCI, Subtarget);
23249 // Optimize x == -y --> x+y == 0
23250 // x != -y --> x+y != 0
23251 static SDValue PerformISDSETCCCombine(SDNode *N, SelectionDAG &DAG,
23252 const X86Subtarget* Subtarget) {
23253 ISD::CondCode CC = cast<CondCodeSDNode>(N->getOperand(2))->get();
23254 SDValue LHS = N->getOperand(0);
23255 SDValue RHS = N->getOperand(1);
23256 EVT VT = N->getValueType(0);
23259 if ((CC == ISD::SETNE || CC == ISD::SETEQ) && LHS.getOpcode() == ISD::SUB)
23260 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(LHS.getOperand(0)))
23261 if (C->getAPIntValue() == 0 && LHS.hasOneUse()) {
23262 SDValue addV = DAG.getNode(ISD::ADD, SDLoc(N),
23263 LHS.getValueType(), RHS, LHS.getOperand(1));
23264 return DAG.getSetCC(SDLoc(N), N->getValueType(0),
23265 addV, DAG.getConstant(0, addV.getValueType()), CC);
23267 if ((CC == ISD::SETNE || CC == ISD::SETEQ) && RHS.getOpcode() == ISD::SUB)
23268 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(RHS.getOperand(0)))
23269 if (C->getAPIntValue() == 0 && RHS.hasOneUse()) {
23270 SDValue addV = DAG.getNode(ISD::ADD, SDLoc(N),
23271 RHS.getValueType(), LHS, RHS.getOperand(1));
23272 return DAG.getSetCC(SDLoc(N), N->getValueType(0),
23273 addV, DAG.getConstant(0, addV.getValueType()), CC);
23276 if (VT.getScalarType() == MVT::i1) {
23277 bool IsSEXT0 = (LHS.getOpcode() == ISD::SIGN_EXTEND) &&
23278 (LHS.getOperand(0).getValueType().getScalarType() == MVT::i1);
23279 bool IsVZero0 = ISD::isBuildVectorAllZeros(LHS.getNode());
23280 if (!IsSEXT0 && !IsVZero0)
23282 bool IsSEXT1 = (RHS.getOpcode() == ISD::SIGN_EXTEND) &&
23283 (RHS.getOperand(0).getValueType().getScalarType() == MVT::i1);
23284 bool IsVZero1 = ISD::isBuildVectorAllZeros(RHS.getNode());
23286 if (!IsSEXT1 && !IsVZero1)
23289 if (IsSEXT0 && IsVZero1) {
23290 assert(VT == LHS.getOperand(0).getValueType() && "Uexpected operand type");
23291 if (CC == ISD::SETEQ)
23292 return DAG.getNOT(DL, LHS.getOperand(0), VT);
23293 return LHS.getOperand(0);
23295 if (IsSEXT1 && IsVZero0) {
23296 assert(VT == RHS.getOperand(0).getValueType() && "Uexpected operand type");
23297 if (CC == ISD::SETEQ)
23298 return DAG.getNOT(DL, RHS.getOperand(0), VT);
23299 return RHS.getOperand(0);
23306 static SDValue PerformINSERTPSCombine(SDNode *N, SelectionDAG &DAG,
23307 const X86Subtarget *Subtarget) {
23309 MVT VT = N->getOperand(1)->getSimpleValueType(0);
23310 assert((VT == MVT::v4f32 || VT == MVT::v4i32) &&
23311 "X86insertps is only defined for v4x32");
23313 SDValue Ld = N->getOperand(1);
23314 if (MayFoldLoad(Ld)) {
23315 // Extract the countS bits from the immediate so we can get the proper
23316 // address when narrowing the vector load to a specific element.
23317 // When the second source op is a memory address, interps doesn't use
23318 // countS and just gets an f32 from that address.
23319 unsigned DestIndex =
23320 cast<ConstantSDNode>(N->getOperand(2))->getZExtValue() >> 6;
23321 Ld = NarrowVectorLoadToElement(cast<LoadSDNode>(Ld), DestIndex, DAG);
23325 // Create this as a scalar to vector to match the instruction pattern.
23326 SDValue LoadScalarToVector = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VT, Ld);
23327 // countS bits are ignored when loading from memory on insertps, which
23328 // means we don't need to explicitly set them to 0.
23329 return DAG.getNode(X86ISD::INSERTPS, dl, VT, N->getOperand(0),
23330 LoadScalarToVector, N->getOperand(2));
23333 // Helper function of PerformSETCCCombine. It is to materialize "setb reg"
23334 // as "sbb reg,reg", since it can be extended without zext and produces
23335 // an all-ones bit which is more useful than 0/1 in some cases.
23336 static SDValue MaterializeSETB(SDLoc DL, SDValue EFLAGS, SelectionDAG &DAG,
23339 return DAG.getNode(ISD::AND, DL, VT,
23340 DAG.getNode(X86ISD::SETCC_CARRY, DL, MVT::i8,
23341 DAG.getConstant(X86::COND_B, MVT::i8), EFLAGS),
23342 DAG.getConstant(1, VT));
23343 assert (VT == MVT::i1 && "Unexpected type for SECCC node");
23344 return DAG.getNode(ISD::TRUNCATE, DL, MVT::i1,
23345 DAG.getNode(X86ISD::SETCC_CARRY, DL, MVT::i8,
23346 DAG.getConstant(X86::COND_B, MVT::i8), EFLAGS));
23349 // Optimize RES = X86ISD::SETCC CONDCODE, EFLAG_INPUT
23350 static SDValue PerformSETCCCombine(SDNode *N, SelectionDAG &DAG,
23351 TargetLowering::DAGCombinerInfo &DCI,
23352 const X86Subtarget *Subtarget) {
23354 X86::CondCode CC = X86::CondCode(N->getConstantOperandVal(0));
23355 SDValue EFLAGS = N->getOperand(1);
23357 if (CC == X86::COND_A) {
23358 // Try to convert COND_A into COND_B in an attempt to facilitate
23359 // materializing "setb reg".
23361 // Do not flip "e > c", where "c" is a constant, because Cmp instruction
23362 // cannot take an immediate as its first operand.
23364 if (EFLAGS.getOpcode() == X86ISD::SUB && EFLAGS.hasOneUse() &&
23365 EFLAGS.getValueType().isInteger() &&
23366 !isa<ConstantSDNode>(EFLAGS.getOperand(1))) {
23367 SDValue NewSub = DAG.getNode(X86ISD::SUB, SDLoc(EFLAGS),
23368 EFLAGS.getNode()->getVTList(),
23369 EFLAGS.getOperand(1), EFLAGS.getOperand(0));
23370 SDValue NewEFLAGS = SDValue(NewSub.getNode(), EFLAGS.getResNo());
23371 return MaterializeSETB(DL, NewEFLAGS, DAG, N->getSimpleValueType(0));
23375 // Materialize "setb reg" as "sbb reg,reg", since it can be extended without
23376 // a zext and produces an all-ones bit which is more useful than 0/1 in some
23378 if (CC == X86::COND_B)
23379 return MaterializeSETB(DL, EFLAGS, DAG, N->getSimpleValueType(0));
23383 Flags = checkBoolTestSetCCCombine(EFLAGS, CC);
23384 if (Flags.getNode()) {
23385 SDValue Cond = DAG.getConstant(CC, MVT::i8);
23386 return DAG.getNode(X86ISD::SETCC, DL, N->getVTList(), Cond, Flags);
23392 // Optimize branch condition evaluation.
23394 static SDValue PerformBrCondCombine(SDNode *N, SelectionDAG &DAG,
23395 TargetLowering::DAGCombinerInfo &DCI,
23396 const X86Subtarget *Subtarget) {
23398 SDValue Chain = N->getOperand(0);
23399 SDValue Dest = N->getOperand(1);
23400 SDValue EFLAGS = N->getOperand(3);
23401 X86::CondCode CC = X86::CondCode(N->getConstantOperandVal(2));
23405 Flags = checkBoolTestSetCCCombine(EFLAGS, CC);
23406 if (Flags.getNode()) {
23407 SDValue Cond = DAG.getConstant(CC, MVT::i8);
23408 return DAG.getNode(X86ISD::BRCOND, DL, N->getVTList(), Chain, Dest, Cond,
23415 static SDValue performVectorCompareAndMaskUnaryOpCombine(SDNode *N,
23416 SelectionDAG &DAG) {
23417 // Take advantage of vector comparisons producing 0 or -1 in each lane to
23418 // optimize away operation when it's from a constant.
23420 // The general transformation is:
23421 // UNARYOP(AND(VECTOR_CMP(x,y), constant)) -->
23422 // AND(VECTOR_CMP(x,y), constant2)
23423 // constant2 = UNARYOP(constant)
23425 // Early exit if this isn't a vector operation, the operand of the
23426 // unary operation isn't a bitwise AND, or if the sizes of the operations
23427 // aren't the same.
23428 EVT VT = N->getValueType(0);
23429 if (!VT.isVector() || N->getOperand(0)->getOpcode() != ISD::AND ||
23430 N->getOperand(0)->getOperand(0)->getOpcode() != ISD::SETCC ||
23431 VT.getSizeInBits() != N->getOperand(0)->getValueType(0).getSizeInBits())
23434 // Now check that the other operand of the AND is a constant. We could
23435 // make the transformation for non-constant splats as well, but it's unclear
23436 // that would be a benefit as it would not eliminate any operations, just
23437 // perform one more step in scalar code before moving to the vector unit.
23438 if (BuildVectorSDNode *BV =
23439 dyn_cast<BuildVectorSDNode>(N->getOperand(0)->getOperand(1))) {
23440 // Bail out if the vector isn't a constant.
23441 if (!BV->isConstant())
23444 // Everything checks out. Build up the new and improved node.
23446 EVT IntVT = BV->getValueType(0);
23447 // Create a new constant of the appropriate type for the transformed
23449 SDValue SourceConst = DAG.getNode(N->getOpcode(), DL, VT, SDValue(BV, 0));
23450 // The AND node needs bitcasts to/from an integer vector type around it.
23451 SDValue MaskConst = DAG.getNode(ISD::BITCAST, DL, IntVT, SourceConst);
23452 SDValue NewAnd = DAG.getNode(ISD::AND, DL, IntVT,
23453 N->getOperand(0)->getOperand(0), MaskConst);
23454 SDValue Res = DAG.getNode(ISD::BITCAST, DL, VT, NewAnd);
23461 static SDValue PerformSINT_TO_FPCombine(SDNode *N, SelectionDAG &DAG,
23462 const X86TargetLowering *XTLI) {
23463 // First try to optimize away the conversion entirely when it's
23464 // conditionally from a constant. Vectors only.
23465 SDValue Res = performVectorCompareAndMaskUnaryOpCombine(N, DAG);
23466 if (Res != SDValue())
23469 // Now move on to more general possibilities.
23470 SDValue Op0 = N->getOperand(0);
23471 EVT InVT = Op0->getValueType(0);
23473 // SINT_TO_FP(v4i8) -> SINT_TO_FP(SEXT(v4i8 to v4i32))
23474 if (InVT == MVT::v8i8 || InVT == MVT::v4i8) {
23476 MVT DstVT = InVT == MVT::v4i8 ? MVT::v4i32 : MVT::v8i32;
23477 SDValue P = DAG.getNode(ISD::SIGN_EXTEND, dl, DstVT, Op0);
23478 return DAG.getNode(ISD::SINT_TO_FP, dl, N->getValueType(0), P);
23481 // Transform (SINT_TO_FP (i64 ...)) into an x87 operation if we have
23482 // a 32-bit target where SSE doesn't support i64->FP operations.
23483 if (Op0.getOpcode() == ISD::LOAD) {
23484 LoadSDNode *Ld = cast<LoadSDNode>(Op0.getNode());
23485 EVT VT = Ld->getValueType(0);
23486 if (!Ld->isVolatile() && !N->getValueType(0).isVector() &&
23487 ISD::isNON_EXTLoad(Op0.getNode()) && Op0.hasOneUse() &&
23488 !XTLI->getSubtarget()->is64Bit() &&
23490 SDValue FILDChain = XTLI->BuildFILD(SDValue(N, 0), Ld->getValueType(0),
23491 Ld->getChain(), Op0, DAG);
23492 DAG.ReplaceAllUsesOfValueWith(Op0.getValue(1), FILDChain.getValue(1));
23499 // Optimize RES, EFLAGS = X86ISD::ADC LHS, RHS, EFLAGS
23500 static SDValue PerformADCCombine(SDNode *N, SelectionDAG &DAG,
23501 X86TargetLowering::DAGCombinerInfo &DCI) {
23502 // If the LHS and RHS of the ADC node are zero, then it can't overflow and
23503 // the result is either zero or one (depending on the input carry bit).
23504 // Strength reduce this down to a "set on carry" aka SETCC_CARRY&1.
23505 if (X86::isZeroNode(N->getOperand(0)) &&
23506 X86::isZeroNode(N->getOperand(1)) &&
23507 // We don't have a good way to replace an EFLAGS use, so only do this when
23509 SDValue(N, 1).use_empty()) {
23511 EVT VT = N->getValueType(0);
23512 SDValue CarryOut = DAG.getConstant(0, N->getValueType(1));
23513 SDValue Res1 = DAG.getNode(ISD::AND, DL, VT,
23514 DAG.getNode(X86ISD::SETCC_CARRY, DL, VT,
23515 DAG.getConstant(X86::COND_B,MVT::i8),
23517 DAG.getConstant(1, VT));
23518 return DCI.CombineTo(N, Res1, CarryOut);
23524 // fold (add Y, (sete X, 0)) -> adc 0, Y
23525 // (add Y, (setne X, 0)) -> sbb -1, Y
23526 // (sub (sete X, 0), Y) -> sbb 0, Y
23527 // (sub (setne X, 0), Y) -> adc -1, Y
23528 static SDValue OptimizeConditionalInDecrement(SDNode *N, SelectionDAG &DAG) {
23531 // Look through ZExts.
23532 SDValue Ext = N->getOperand(N->getOpcode() == ISD::SUB ? 1 : 0);
23533 if (Ext.getOpcode() != ISD::ZERO_EXTEND || !Ext.hasOneUse())
23536 SDValue SetCC = Ext.getOperand(0);
23537 if (SetCC.getOpcode() != X86ISD::SETCC || !SetCC.hasOneUse())
23540 X86::CondCode CC = (X86::CondCode)SetCC.getConstantOperandVal(0);
23541 if (CC != X86::COND_E && CC != X86::COND_NE)
23544 SDValue Cmp = SetCC.getOperand(1);
23545 if (Cmp.getOpcode() != X86ISD::CMP || !Cmp.hasOneUse() ||
23546 !X86::isZeroNode(Cmp.getOperand(1)) ||
23547 !Cmp.getOperand(0).getValueType().isInteger())
23550 SDValue CmpOp0 = Cmp.getOperand(0);
23551 SDValue NewCmp = DAG.getNode(X86ISD::CMP, DL, MVT::i32, CmpOp0,
23552 DAG.getConstant(1, CmpOp0.getValueType()));
23554 SDValue OtherVal = N->getOperand(N->getOpcode() == ISD::SUB ? 0 : 1);
23555 if (CC == X86::COND_NE)
23556 return DAG.getNode(N->getOpcode() == ISD::SUB ? X86ISD::ADC : X86ISD::SBB,
23557 DL, OtherVal.getValueType(), OtherVal,
23558 DAG.getConstant(-1ULL, OtherVal.getValueType()), NewCmp);
23559 return DAG.getNode(N->getOpcode() == ISD::SUB ? X86ISD::SBB : X86ISD::ADC,
23560 DL, OtherVal.getValueType(), OtherVal,
23561 DAG.getConstant(0, OtherVal.getValueType()), NewCmp);
23564 /// PerformADDCombine - Do target-specific dag combines on integer adds.
23565 static SDValue PerformAddCombine(SDNode *N, SelectionDAG &DAG,
23566 const X86Subtarget *Subtarget) {
23567 EVT VT = N->getValueType(0);
23568 SDValue Op0 = N->getOperand(0);
23569 SDValue Op1 = N->getOperand(1);
23571 // Try to synthesize horizontal adds from adds of shuffles.
23572 if (((Subtarget->hasSSSE3() && (VT == MVT::v8i16 || VT == MVT::v4i32)) ||
23573 (Subtarget->hasInt256() && (VT == MVT::v16i16 || VT == MVT::v8i32))) &&
23574 isHorizontalBinOp(Op0, Op1, true))
23575 return DAG.getNode(X86ISD::HADD, SDLoc(N), VT, Op0, Op1);
23577 return OptimizeConditionalInDecrement(N, DAG);
23580 static SDValue PerformSubCombine(SDNode *N, SelectionDAG &DAG,
23581 const X86Subtarget *Subtarget) {
23582 SDValue Op0 = N->getOperand(0);
23583 SDValue Op1 = N->getOperand(1);
23585 // X86 can't encode an immediate LHS of a sub. See if we can push the
23586 // negation into a preceding instruction.
23587 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op0)) {
23588 // If the RHS of the sub is a XOR with one use and a constant, invert the
23589 // immediate. Then add one to the LHS of the sub so we can turn
23590 // X-Y -> X+~Y+1, saving one register.
23591 if (Op1->hasOneUse() && Op1.getOpcode() == ISD::XOR &&
23592 isa<ConstantSDNode>(Op1.getOperand(1))) {
23593 APInt XorC = cast<ConstantSDNode>(Op1.getOperand(1))->getAPIntValue();
23594 EVT VT = Op0.getValueType();
23595 SDValue NewXor = DAG.getNode(ISD::XOR, SDLoc(Op1), VT,
23597 DAG.getConstant(~XorC, VT));
23598 return DAG.getNode(ISD::ADD, SDLoc(N), VT, NewXor,
23599 DAG.getConstant(C->getAPIntValue()+1, VT));
23603 // Try to synthesize horizontal adds from adds of shuffles.
23604 EVT VT = N->getValueType(0);
23605 if (((Subtarget->hasSSSE3() && (VT == MVT::v8i16 || VT == MVT::v4i32)) ||
23606 (Subtarget->hasInt256() && (VT == MVT::v16i16 || VT == MVT::v8i32))) &&
23607 isHorizontalBinOp(Op0, Op1, true))
23608 return DAG.getNode(X86ISD::HSUB, SDLoc(N), VT, Op0, Op1);
23610 return OptimizeConditionalInDecrement(N, DAG);
23613 /// performVZEXTCombine - Performs build vector combines
23614 static SDValue performVZEXTCombine(SDNode *N, SelectionDAG &DAG,
23615 TargetLowering::DAGCombinerInfo &DCI,
23616 const X86Subtarget *Subtarget) {
23617 // (vzext (bitcast (vzext (x)) -> (vzext x)
23618 SDValue In = N->getOperand(0);
23619 while (In.getOpcode() == ISD::BITCAST)
23620 In = In.getOperand(0);
23622 if (In.getOpcode() != X86ISD::VZEXT)
23625 return DAG.getNode(X86ISD::VZEXT, SDLoc(N), N->getValueType(0),
23629 SDValue X86TargetLowering::PerformDAGCombine(SDNode *N,
23630 DAGCombinerInfo &DCI) const {
23631 SelectionDAG &DAG = DCI.DAG;
23632 switch (N->getOpcode()) {
23634 case ISD::EXTRACT_VECTOR_ELT:
23635 return PerformEXTRACT_VECTOR_ELTCombine(N, DAG, DCI);
23637 case ISD::SELECT: return PerformSELECTCombine(N, DAG, DCI, Subtarget);
23638 case X86ISD::CMOV: return PerformCMOVCombine(N, DAG, DCI, Subtarget);
23639 case ISD::ADD: return PerformAddCombine(N, DAG, Subtarget);
23640 case ISD::SUB: return PerformSubCombine(N, DAG, Subtarget);
23641 case X86ISD::ADC: return PerformADCCombine(N, DAG, DCI);
23642 case ISD::MUL: return PerformMulCombine(N, DAG, DCI);
23645 case ISD::SRL: return PerformShiftCombine(N, DAG, DCI, Subtarget);
23646 case ISD::AND: return PerformAndCombine(N, DAG, DCI, Subtarget);
23647 case ISD::OR: return PerformOrCombine(N, DAG, DCI, Subtarget);
23648 case ISD::XOR: return PerformXorCombine(N, DAG, DCI, Subtarget);
23649 case ISD::LOAD: return PerformLOADCombine(N, DAG, DCI, Subtarget);
23650 case ISD::STORE: return PerformSTORECombine(N, DAG, Subtarget);
23651 case ISD::SINT_TO_FP: return PerformSINT_TO_FPCombine(N, DAG, this);
23652 case ISD::FADD: return PerformFADDCombine(N, DAG, Subtarget);
23653 case ISD::FSUB: return PerformFSUBCombine(N, DAG, Subtarget);
23655 case X86ISD::FOR: return PerformFORCombine(N, DAG);
23657 case X86ISD::FMAX: return PerformFMinFMaxCombine(N, DAG);
23658 case X86ISD::FAND: return PerformFANDCombine(N, DAG);
23659 case X86ISD::FANDN: return PerformFANDNCombine(N, DAG);
23660 case X86ISD::BT: return PerformBTCombine(N, DAG, DCI);
23661 case X86ISD::VZEXT_MOVL: return PerformVZEXT_MOVLCombine(N, DAG);
23662 case ISD::ANY_EXTEND:
23663 case ISD::ZERO_EXTEND: return PerformZExtCombine(N, DAG, DCI, Subtarget);
23664 case ISD::SIGN_EXTEND: return PerformSExtCombine(N, DAG, DCI, Subtarget);
23665 case ISD::SIGN_EXTEND_INREG:
23666 return PerformSIGN_EXTEND_INREGCombine(N, DAG, Subtarget);
23667 case ISD::TRUNCATE: return PerformTruncateCombine(N, DAG,DCI,Subtarget);
23668 case ISD::SETCC: return PerformISDSETCCCombine(N, DAG, Subtarget);
23669 case X86ISD::SETCC: return PerformSETCCCombine(N, DAG, DCI, Subtarget);
23670 case X86ISD::BRCOND: return PerformBrCondCombine(N, DAG, DCI, Subtarget);
23671 case X86ISD::VZEXT: return performVZEXTCombine(N, DAG, DCI, Subtarget);
23672 case X86ISD::SHUFP: // Handle all target specific shuffles
23673 case X86ISD::PALIGNR:
23674 case X86ISD::UNPCKH:
23675 case X86ISD::UNPCKL:
23676 case X86ISD::MOVHLPS:
23677 case X86ISD::MOVLHPS:
23678 case X86ISD::PSHUFB:
23679 case X86ISD::PSHUFD:
23680 case X86ISD::PSHUFHW:
23681 case X86ISD::PSHUFLW:
23682 case X86ISD::MOVSS:
23683 case X86ISD::MOVSD:
23684 case X86ISD::VPERMILP:
23685 case X86ISD::VPERM2X128:
23686 case ISD::VECTOR_SHUFFLE: return PerformShuffleCombine(N, DAG, DCI,Subtarget);
23687 case ISD::FMA: return PerformFMACombine(N, DAG, Subtarget);
23688 case ISD::INTRINSIC_WO_CHAIN:
23689 return PerformINTRINSIC_WO_CHAINCombine(N, DAG, Subtarget);
23690 case X86ISD::INSERTPS:
23691 return PerformINSERTPSCombine(N, DAG, Subtarget);
23692 case ISD::BUILD_VECTOR: return PerformBUILD_VECTORCombine(N, DAG, Subtarget);
23698 /// isTypeDesirableForOp - Return true if the target has native support for
23699 /// the specified value type and it is 'desirable' to use the type for the
23700 /// given node type. e.g. On x86 i16 is legal, but undesirable since i16
23701 /// instruction encodings are longer and some i16 instructions are slow.
23702 bool X86TargetLowering::isTypeDesirableForOp(unsigned Opc, EVT VT) const {
23703 if (!isTypeLegal(VT))
23705 if (VT != MVT::i16)
23712 case ISD::SIGN_EXTEND:
23713 case ISD::ZERO_EXTEND:
23714 case ISD::ANY_EXTEND:
23727 /// IsDesirableToPromoteOp - This method query the target whether it is
23728 /// beneficial for dag combiner to promote the specified node. If true, it
23729 /// should return the desired promotion type by reference.
23730 bool X86TargetLowering::IsDesirableToPromoteOp(SDValue Op, EVT &PVT) const {
23731 EVT VT = Op.getValueType();
23732 if (VT != MVT::i16)
23735 bool Promote = false;
23736 bool Commute = false;
23737 switch (Op.getOpcode()) {
23740 LoadSDNode *LD = cast<LoadSDNode>(Op);
23741 // If the non-extending load has a single use and it's not live out, then it
23742 // might be folded.
23743 if (LD->getExtensionType() == ISD::NON_EXTLOAD /*&&
23744 Op.hasOneUse()*/) {
23745 for (SDNode::use_iterator UI = Op.getNode()->use_begin(),
23746 UE = Op.getNode()->use_end(); UI != UE; ++UI) {
23747 // The only case where we'd want to promote LOAD (rather then it being
23748 // promoted as an operand is when it's only use is liveout.
23749 if (UI->getOpcode() != ISD::CopyToReg)
23756 case ISD::SIGN_EXTEND:
23757 case ISD::ZERO_EXTEND:
23758 case ISD::ANY_EXTEND:
23763 SDValue N0 = Op.getOperand(0);
23764 // Look out for (store (shl (load), x)).
23765 if (MayFoldLoad(N0) && MayFoldIntoStore(Op))
23778 SDValue N0 = Op.getOperand(0);
23779 SDValue N1 = Op.getOperand(1);
23780 if (!Commute && MayFoldLoad(N1))
23782 // Avoid disabling potential load folding opportunities.
23783 if (MayFoldLoad(N0) && (!isa<ConstantSDNode>(N1) || MayFoldIntoStore(Op)))
23785 if (MayFoldLoad(N1) && (!isa<ConstantSDNode>(N0) || MayFoldIntoStore(Op)))
23795 //===----------------------------------------------------------------------===//
23796 // X86 Inline Assembly Support
23797 //===----------------------------------------------------------------------===//
23800 // Helper to match a string separated by whitespace.
23801 bool matchAsmImpl(StringRef s, ArrayRef<const StringRef *> args) {
23802 s = s.substr(s.find_first_not_of(" \t")); // Skip leading whitespace.
23804 for (unsigned i = 0, e = args.size(); i != e; ++i) {
23805 StringRef piece(*args[i]);
23806 if (!s.startswith(piece)) // Check if the piece matches.
23809 s = s.substr(piece.size());
23810 StringRef::size_type pos = s.find_first_not_of(" \t");
23811 if (pos == 0) // We matched a prefix.
23819 const VariadicFunction1<bool, StringRef, StringRef, matchAsmImpl> matchAsm={};
23822 static bool clobbersFlagRegisters(const SmallVector<StringRef, 4> &AsmPieces) {
23824 if (AsmPieces.size() == 3 || AsmPieces.size() == 4) {
23825 if (std::count(AsmPieces.begin(), AsmPieces.end(), "~{cc}") &&
23826 std::count(AsmPieces.begin(), AsmPieces.end(), "~{flags}") &&
23827 std::count(AsmPieces.begin(), AsmPieces.end(), "~{fpsr}")) {
23829 if (AsmPieces.size() == 3)
23831 else if (std::count(AsmPieces.begin(), AsmPieces.end(), "~{dirflag}"))
23838 bool X86TargetLowering::ExpandInlineAsm(CallInst *CI) const {
23839 InlineAsm *IA = cast<InlineAsm>(CI->getCalledValue());
23841 std::string AsmStr = IA->getAsmString();
23843 IntegerType *Ty = dyn_cast<IntegerType>(CI->getType());
23844 if (!Ty || Ty->getBitWidth() % 16 != 0)
23847 // TODO: should remove alternatives from the asmstring: "foo {a|b}" -> "foo a"
23848 SmallVector<StringRef, 4> AsmPieces;
23849 SplitString(AsmStr, AsmPieces, ";\n");
23851 switch (AsmPieces.size()) {
23852 default: return false;
23854 // FIXME: this should verify that we are targeting a 486 or better. If not,
23855 // we will turn this bswap into something that will be lowered to logical
23856 // ops instead of emitting the bswap asm. For now, we don't support 486 or
23857 // lower so don't worry about this.
23859 if (matchAsm(AsmPieces[0], "bswap", "$0") ||
23860 matchAsm(AsmPieces[0], "bswapl", "$0") ||
23861 matchAsm(AsmPieces[0], "bswapq", "$0") ||
23862 matchAsm(AsmPieces[0], "bswap", "${0:q}") ||
23863 matchAsm(AsmPieces[0], "bswapl", "${0:q}") ||
23864 matchAsm(AsmPieces[0], "bswapq", "${0:q}")) {
23865 // No need to check constraints, nothing other than the equivalent of
23866 // "=r,0" would be valid here.
23867 return IntrinsicLowering::LowerToByteSwap(CI);
23870 // rorw $$8, ${0:w} --> llvm.bswap.i16
23871 if (CI->getType()->isIntegerTy(16) &&
23872 IA->getConstraintString().compare(0, 5, "=r,0,") == 0 &&
23873 (matchAsm(AsmPieces[0], "rorw", "$$8,", "${0:w}") ||
23874 matchAsm(AsmPieces[0], "rolw", "$$8,", "${0:w}"))) {
23876 const std::string &ConstraintsStr = IA->getConstraintString();
23877 SplitString(StringRef(ConstraintsStr).substr(5), AsmPieces, ",");
23878 array_pod_sort(AsmPieces.begin(), AsmPieces.end());
23879 if (clobbersFlagRegisters(AsmPieces))
23880 return IntrinsicLowering::LowerToByteSwap(CI);
23884 if (CI->getType()->isIntegerTy(32) &&
23885 IA->getConstraintString().compare(0, 5, "=r,0,") == 0 &&
23886 matchAsm(AsmPieces[0], "rorw", "$$8,", "${0:w}") &&
23887 matchAsm(AsmPieces[1], "rorl", "$$16,", "$0") &&
23888 matchAsm(AsmPieces[2], "rorw", "$$8,", "${0:w}")) {
23890 const std::string &ConstraintsStr = IA->getConstraintString();
23891 SplitString(StringRef(ConstraintsStr).substr(5), AsmPieces, ",");
23892 array_pod_sort(AsmPieces.begin(), AsmPieces.end());
23893 if (clobbersFlagRegisters(AsmPieces))
23894 return IntrinsicLowering::LowerToByteSwap(CI);
23897 if (CI->getType()->isIntegerTy(64)) {
23898 InlineAsm::ConstraintInfoVector Constraints = IA->ParseConstraints();
23899 if (Constraints.size() >= 2 &&
23900 Constraints[0].Codes.size() == 1 && Constraints[0].Codes[0] == "A" &&
23901 Constraints[1].Codes.size() == 1 && Constraints[1].Codes[0] == "0") {
23902 // bswap %eax / bswap %edx / xchgl %eax, %edx -> llvm.bswap.i64
23903 if (matchAsm(AsmPieces[0], "bswap", "%eax") &&
23904 matchAsm(AsmPieces[1], "bswap", "%edx") &&
23905 matchAsm(AsmPieces[2], "xchgl", "%eax,", "%edx"))
23906 return IntrinsicLowering::LowerToByteSwap(CI);
23914 /// getConstraintType - Given a constraint letter, return the type of
23915 /// constraint it is for this target.
23916 X86TargetLowering::ConstraintType
23917 X86TargetLowering::getConstraintType(const std::string &Constraint) const {
23918 if (Constraint.size() == 1) {
23919 switch (Constraint[0]) {
23930 return C_RegisterClass;
23954 return TargetLowering::getConstraintType(Constraint);
23957 /// Examine constraint type and operand type and determine a weight value.
23958 /// This object must already have been set up with the operand type
23959 /// and the current alternative constraint selected.
23960 TargetLowering::ConstraintWeight
23961 X86TargetLowering::getSingleConstraintMatchWeight(
23962 AsmOperandInfo &info, const char *constraint) const {
23963 ConstraintWeight weight = CW_Invalid;
23964 Value *CallOperandVal = info.CallOperandVal;
23965 // If we don't have a value, we can't do a match,
23966 // but allow it at the lowest weight.
23967 if (!CallOperandVal)
23969 Type *type = CallOperandVal->getType();
23970 // Look at the constraint type.
23971 switch (*constraint) {
23973 weight = TargetLowering::getSingleConstraintMatchWeight(info, constraint);
23984 if (CallOperandVal->getType()->isIntegerTy())
23985 weight = CW_SpecificReg;
23990 if (type->isFloatingPointTy())
23991 weight = CW_SpecificReg;
23994 if (type->isX86_MMXTy() && Subtarget->hasMMX())
23995 weight = CW_SpecificReg;
23999 if (((type->getPrimitiveSizeInBits() == 128) && Subtarget->hasSSE1()) ||
24000 ((type->getPrimitiveSizeInBits() == 256) && Subtarget->hasFp256()))
24001 weight = CW_Register;
24004 if (ConstantInt *C = dyn_cast<ConstantInt>(info.CallOperandVal)) {
24005 if (C->getZExtValue() <= 31)
24006 weight = CW_Constant;
24010 if (ConstantInt *C = dyn_cast<ConstantInt>(CallOperandVal)) {
24011 if (C->getZExtValue() <= 63)
24012 weight = CW_Constant;
24016 if (ConstantInt *C = dyn_cast<ConstantInt>(CallOperandVal)) {
24017 if ((C->getSExtValue() >= -0x80) && (C->getSExtValue() <= 0x7f))
24018 weight = CW_Constant;
24022 if (ConstantInt *C = dyn_cast<ConstantInt>(CallOperandVal)) {
24023 if ((C->getZExtValue() == 0xff) || (C->getZExtValue() == 0xffff))
24024 weight = CW_Constant;
24028 if (ConstantInt *C = dyn_cast<ConstantInt>(CallOperandVal)) {
24029 if (C->getZExtValue() <= 3)
24030 weight = CW_Constant;
24034 if (ConstantInt *C = dyn_cast<ConstantInt>(CallOperandVal)) {
24035 if (C->getZExtValue() <= 0xff)
24036 weight = CW_Constant;
24041 if (dyn_cast<ConstantFP>(CallOperandVal)) {
24042 weight = CW_Constant;
24046 if (ConstantInt *C = dyn_cast<ConstantInt>(CallOperandVal)) {
24047 if ((C->getSExtValue() >= -0x80000000LL) &&
24048 (C->getSExtValue() <= 0x7fffffffLL))
24049 weight = CW_Constant;
24053 if (ConstantInt *C = dyn_cast<ConstantInt>(CallOperandVal)) {
24054 if (C->getZExtValue() <= 0xffffffff)
24055 weight = CW_Constant;
24062 /// LowerXConstraint - try to replace an X constraint, which matches anything,
24063 /// with another that has more specific requirements based on the type of the
24064 /// corresponding operand.
24065 const char *X86TargetLowering::
24066 LowerXConstraint(EVT ConstraintVT) const {
24067 // FP X constraints get lowered to SSE1/2 registers if available, otherwise
24068 // 'f' like normal targets.
24069 if (ConstraintVT.isFloatingPoint()) {
24070 if (Subtarget->hasSSE2())
24072 if (Subtarget->hasSSE1())
24076 return TargetLowering::LowerXConstraint(ConstraintVT);
24079 /// LowerAsmOperandForConstraint - Lower the specified operand into the Ops
24080 /// vector. If it is invalid, don't add anything to Ops.
24081 void X86TargetLowering::LowerAsmOperandForConstraint(SDValue Op,
24082 std::string &Constraint,
24083 std::vector<SDValue>&Ops,
24084 SelectionDAG &DAG) const {
24087 // Only support length 1 constraints for now.
24088 if (Constraint.length() > 1) return;
24090 char ConstraintLetter = Constraint[0];
24091 switch (ConstraintLetter) {
24094 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op)) {
24095 if (C->getZExtValue() <= 31) {
24096 Result = DAG.getTargetConstant(C->getZExtValue(), Op.getValueType());
24102 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op)) {
24103 if (C->getZExtValue() <= 63) {
24104 Result = DAG.getTargetConstant(C->getZExtValue(), Op.getValueType());
24110 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op)) {
24111 if (isInt<8>(C->getSExtValue())) {
24112 Result = DAG.getTargetConstant(C->getZExtValue(), Op.getValueType());
24118 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op)) {
24119 if (C->getZExtValue() <= 255) {
24120 Result = DAG.getTargetConstant(C->getZExtValue(), Op.getValueType());
24126 // 32-bit signed value
24127 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op)) {
24128 if (ConstantInt::isValueValidForType(Type::getInt32Ty(*DAG.getContext()),
24129 C->getSExtValue())) {
24130 // Widen to 64 bits here to get it sign extended.
24131 Result = DAG.getTargetConstant(C->getSExtValue(), MVT::i64);
24134 // FIXME gcc accepts some relocatable values here too, but only in certain
24135 // memory models; it's complicated.
24140 // 32-bit unsigned value
24141 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op)) {
24142 if (ConstantInt::isValueValidForType(Type::getInt32Ty(*DAG.getContext()),
24143 C->getZExtValue())) {
24144 Result = DAG.getTargetConstant(C->getZExtValue(), Op.getValueType());
24148 // FIXME gcc accepts some relocatable values here too, but only in certain
24149 // memory models; it's complicated.
24153 // Literal immediates are always ok.
24154 if (ConstantSDNode *CST = dyn_cast<ConstantSDNode>(Op)) {
24155 // Widen to 64 bits here to get it sign extended.
24156 Result = DAG.getTargetConstant(CST->getSExtValue(), MVT::i64);
24160 // In any sort of PIC mode addresses need to be computed at runtime by
24161 // adding in a register or some sort of table lookup. These can't
24162 // be used as immediates.
24163 if (Subtarget->isPICStyleGOT() || Subtarget->isPICStyleStubPIC())
24166 // If we are in non-pic codegen mode, we allow the address of a global (with
24167 // an optional displacement) to be used with 'i'.
24168 GlobalAddressSDNode *GA = nullptr;
24169 int64_t Offset = 0;
24171 // Match either (GA), (GA+C), (GA+C1+C2), etc.
24173 if ((GA = dyn_cast<GlobalAddressSDNode>(Op))) {
24174 Offset += GA->getOffset();
24176 } else if (Op.getOpcode() == ISD::ADD) {
24177 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op.getOperand(1))) {
24178 Offset += C->getZExtValue();
24179 Op = Op.getOperand(0);
24182 } else if (Op.getOpcode() == ISD::SUB) {
24183 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op.getOperand(1))) {
24184 Offset += -C->getZExtValue();
24185 Op = Op.getOperand(0);
24190 // Otherwise, this isn't something we can handle, reject it.
24194 const GlobalValue *GV = GA->getGlobal();
24195 // If we require an extra load to get this address, as in PIC mode, we
24196 // can't accept it.
24197 if (isGlobalStubReference(
24198 Subtarget->ClassifyGlobalReference(GV, DAG.getTarget())))
24201 Result = DAG.getTargetGlobalAddress(GV, SDLoc(Op),
24202 GA->getValueType(0), Offset);
24207 if (Result.getNode()) {
24208 Ops.push_back(Result);
24211 return TargetLowering::LowerAsmOperandForConstraint(Op, Constraint, Ops, DAG);
24214 std::pair<unsigned, const TargetRegisterClass*>
24215 X86TargetLowering::getRegForInlineAsmConstraint(const std::string &Constraint,
24217 // First, see if this is a constraint that directly corresponds to an LLVM
24219 if (Constraint.size() == 1) {
24220 // GCC Constraint Letters
24221 switch (Constraint[0]) {
24223 // TODO: Slight differences here in allocation order and leaving
24224 // RIP in the class. Do they matter any more here than they do
24225 // in the normal allocation?
24226 case 'q': // GENERAL_REGS in 64-bit mode, Q_REGS in 32-bit mode.
24227 if (Subtarget->is64Bit()) {
24228 if (VT == MVT::i32 || VT == MVT::f32)
24229 return std::make_pair(0U, &X86::GR32RegClass);
24230 if (VT == MVT::i16)
24231 return std::make_pair(0U, &X86::GR16RegClass);
24232 if (VT == MVT::i8 || VT == MVT::i1)
24233 return std::make_pair(0U, &X86::GR8RegClass);
24234 if (VT == MVT::i64 || VT == MVT::f64)
24235 return std::make_pair(0U, &X86::GR64RegClass);
24238 // 32-bit fallthrough
24239 case 'Q': // Q_REGS
24240 if (VT == MVT::i32 || VT == MVT::f32)
24241 return std::make_pair(0U, &X86::GR32_ABCDRegClass);
24242 if (VT == MVT::i16)
24243 return std::make_pair(0U, &X86::GR16_ABCDRegClass);
24244 if (VT == MVT::i8 || VT == MVT::i1)
24245 return std::make_pair(0U, &X86::GR8_ABCD_LRegClass);
24246 if (VT == MVT::i64)
24247 return std::make_pair(0U, &X86::GR64_ABCDRegClass);
24249 case 'r': // GENERAL_REGS
24250 case 'l': // INDEX_REGS
24251 if (VT == MVT::i8 || VT == MVT::i1)
24252 return std::make_pair(0U, &X86::GR8RegClass);
24253 if (VT == MVT::i16)
24254 return std::make_pair(0U, &X86::GR16RegClass);
24255 if (VT == MVT::i32 || VT == MVT::f32 || !Subtarget->is64Bit())
24256 return std::make_pair(0U, &X86::GR32RegClass);
24257 return std::make_pair(0U, &X86::GR64RegClass);
24258 case 'R': // LEGACY_REGS
24259 if (VT == MVT::i8 || VT == MVT::i1)
24260 return std::make_pair(0U, &X86::GR8_NOREXRegClass);
24261 if (VT == MVT::i16)
24262 return std::make_pair(0U, &X86::GR16_NOREXRegClass);
24263 if (VT == MVT::i32 || !Subtarget->is64Bit())
24264 return std::make_pair(0U, &X86::GR32_NOREXRegClass);
24265 return std::make_pair(0U, &X86::GR64_NOREXRegClass);
24266 case 'f': // FP Stack registers.
24267 // If SSE is enabled for this VT, use f80 to ensure the isel moves the
24268 // value to the correct fpstack register class.
24269 if (VT == MVT::f32 && !isScalarFPTypeInSSEReg(VT))
24270 return std::make_pair(0U, &X86::RFP32RegClass);
24271 if (VT == MVT::f64 && !isScalarFPTypeInSSEReg(VT))
24272 return std::make_pair(0U, &X86::RFP64RegClass);
24273 return std::make_pair(0U, &X86::RFP80RegClass);
24274 case 'y': // MMX_REGS if MMX allowed.
24275 if (!Subtarget->hasMMX()) break;
24276 return std::make_pair(0U, &X86::VR64RegClass);
24277 case 'Y': // SSE_REGS if SSE2 allowed
24278 if (!Subtarget->hasSSE2()) break;
24280 case 'x': // SSE_REGS if SSE1 allowed or AVX_REGS if AVX allowed
24281 if (!Subtarget->hasSSE1()) break;
24283 switch (VT.SimpleTy) {
24285 // Scalar SSE types.
24288 return std::make_pair(0U, &X86::FR32RegClass);
24291 return std::make_pair(0U, &X86::FR64RegClass);
24299 return std::make_pair(0U, &X86::VR128RegClass);
24307 return std::make_pair(0U, &X86::VR256RegClass);
24312 return std::make_pair(0U, &X86::VR512RegClass);
24318 // Use the default implementation in TargetLowering to convert the register
24319 // constraint into a member of a register class.
24320 std::pair<unsigned, const TargetRegisterClass*> Res;
24321 Res = TargetLowering::getRegForInlineAsmConstraint(Constraint, VT);
24323 // Not found as a standard register?
24325 // Map st(0) -> st(7) -> ST0
24326 if (Constraint.size() == 7 && Constraint[0] == '{' &&
24327 tolower(Constraint[1]) == 's' &&
24328 tolower(Constraint[2]) == 't' &&
24329 Constraint[3] == '(' &&
24330 (Constraint[4] >= '0' && Constraint[4] <= '7') &&
24331 Constraint[5] == ')' &&
24332 Constraint[6] == '}') {
24334 Res.first = X86::FP0+Constraint[4]-'0';
24335 Res.second = &X86::RFP80RegClass;
24339 // GCC allows "st(0)" to be called just plain "st".
24340 if (StringRef("{st}").equals_lower(Constraint)) {
24341 Res.first = X86::FP0;
24342 Res.second = &X86::RFP80RegClass;
24347 if (StringRef("{flags}").equals_lower(Constraint)) {
24348 Res.first = X86::EFLAGS;
24349 Res.second = &X86::CCRRegClass;
24353 // 'A' means EAX + EDX.
24354 if (Constraint == "A") {
24355 Res.first = X86::EAX;
24356 Res.second = &X86::GR32_ADRegClass;
24362 // Otherwise, check to see if this is a register class of the wrong value
24363 // type. For example, we want to map "{ax},i32" -> {eax}, we don't want it to
24364 // turn into {ax},{dx}.
24365 if (Res.second->hasType(VT))
24366 return Res; // Correct type already, nothing to do.
24368 // All of the single-register GCC register classes map their values onto
24369 // 16-bit register pieces "ax","dx","cx","bx","si","di","bp","sp". If we
24370 // really want an 8-bit or 32-bit register, map to the appropriate register
24371 // class and return the appropriate register.
24372 if (Res.second == &X86::GR16RegClass) {
24373 if (VT == MVT::i8 || VT == MVT::i1) {
24374 unsigned DestReg = 0;
24375 switch (Res.first) {
24377 case X86::AX: DestReg = X86::AL; break;
24378 case X86::DX: DestReg = X86::DL; break;
24379 case X86::CX: DestReg = X86::CL; break;
24380 case X86::BX: DestReg = X86::BL; break;
24383 Res.first = DestReg;
24384 Res.second = &X86::GR8RegClass;
24386 } else if (VT == MVT::i32 || VT == MVT::f32) {
24387 unsigned DestReg = 0;
24388 switch (Res.first) {
24390 case X86::AX: DestReg = X86::EAX; break;
24391 case X86::DX: DestReg = X86::EDX; break;
24392 case X86::CX: DestReg = X86::ECX; break;
24393 case X86::BX: DestReg = X86::EBX; break;
24394 case X86::SI: DestReg = X86::ESI; break;
24395 case X86::DI: DestReg = X86::EDI; break;
24396 case X86::BP: DestReg = X86::EBP; break;
24397 case X86::SP: DestReg = X86::ESP; break;
24400 Res.first = DestReg;
24401 Res.second = &X86::GR32RegClass;
24403 } else if (VT == MVT::i64 || VT == MVT::f64) {
24404 unsigned DestReg = 0;
24405 switch (Res.first) {
24407 case X86::AX: DestReg = X86::RAX; break;
24408 case X86::DX: DestReg = X86::RDX; break;
24409 case X86::CX: DestReg = X86::RCX; break;
24410 case X86::BX: DestReg = X86::RBX; break;
24411 case X86::SI: DestReg = X86::RSI; break;
24412 case X86::DI: DestReg = X86::RDI; break;
24413 case X86::BP: DestReg = X86::RBP; break;
24414 case X86::SP: DestReg = X86::RSP; break;
24417 Res.first = DestReg;
24418 Res.second = &X86::GR64RegClass;
24421 } else if (Res.second == &X86::FR32RegClass ||
24422 Res.second == &X86::FR64RegClass ||
24423 Res.second == &X86::VR128RegClass ||
24424 Res.second == &X86::VR256RegClass ||
24425 Res.second == &X86::FR32XRegClass ||
24426 Res.second == &X86::FR64XRegClass ||
24427 Res.second == &X86::VR128XRegClass ||
24428 Res.second == &X86::VR256XRegClass ||
24429 Res.second == &X86::VR512RegClass) {
24430 // Handle references to XMM physical registers that got mapped into the
24431 // wrong class. This can happen with constraints like {xmm0} where the
24432 // target independent register mapper will just pick the first match it can
24433 // find, ignoring the required type.
24435 if (VT == MVT::f32 || VT == MVT::i32)
24436 Res.second = &X86::FR32RegClass;
24437 else if (VT == MVT::f64 || VT == MVT::i64)
24438 Res.second = &X86::FR64RegClass;
24439 else if (X86::VR128RegClass.hasType(VT))
24440 Res.second = &X86::VR128RegClass;
24441 else if (X86::VR256RegClass.hasType(VT))
24442 Res.second = &X86::VR256RegClass;
24443 else if (X86::VR512RegClass.hasType(VT))
24444 Res.second = &X86::VR512RegClass;
24450 int X86TargetLowering::getScalingFactorCost(const AddrMode &AM,
24452 // Scaling factors are not free at all.
24453 // An indexed folded instruction, i.e., inst (reg1, reg2, scale),
24454 // will take 2 allocations in the out of order engine instead of 1
24455 // for plain addressing mode, i.e. inst (reg1).
24457 // vaddps (%rsi,%drx), %ymm0, %ymm1
24458 // Requires two allocations (one for the load, one for the computation)
24460 // vaddps (%rsi), %ymm0, %ymm1
24461 // Requires just 1 allocation, i.e., freeing allocations for other operations
24462 // and having less micro operations to execute.
24464 // For some X86 architectures, this is even worse because for instance for
24465 // stores, the complex addressing mode forces the instruction to use the
24466 // "load" ports instead of the dedicated "store" port.
24467 // E.g., on Haswell:
24468 // vmovaps %ymm1, (%r8, %rdi) can use port 2 or 3.
24469 // vmovaps %ymm1, (%r8) can use port 2, 3, or 7.
24470 if (isLegalAddressingMode(AM, Ty))
24471 // Scale represents reg2 * scale, thus account for 1
24472 // as soon as we use a second register.
24473 return AM.Scale != 0;
24477 bool X86TargetLowering::isTargetFTOL() const {
24478 return Subtarget->isTargetKnownWindowsMSVC() && !Subtarget->is64Bit();