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(true),
71 cl::desc("Enable an experimental vector shuffle lowering code path."),
74 // Forward declarations.
75 static SDValue getMOVL(SelectionDAG &DAG, SDLoc dl, EVT VT, SDValue V1,
78 static SDValue ExtractSubVector(SDValue Vec, unsigned IdxVal,
79 SelectionDAG &DAG, SDLoc dl,
80 unsigned vectorWidth) {
81 assert((vectorWidth == 128 || vectorWidth == 256) &&
82 "Unsupported vector width");
83 EVT VT = Vec.getValueType();
84 EVT ElVT = VT.getVectorElementType();
85 unsigned Factor = VT.getSizeInBits()/vectorWidth;
86 EVT ResultVT = EVT::getVectorVT(*DAG.getContext(), ElVT,
87 VT.getVectorNumElements()/Factor);
89 // Extract from UNDEF is UNDEF.
90 if (Vec.getOpcode() == ISD::UNDEF)
91 return DAG.getUNDEF(ResultVT);
93 // Extract the relevant vectorWidth bits. Generate an EXTRACT_SUBVECTOR
94 unsigned ElemsPerChunk = vectorWidth / ElVT.getSizeInBits();
96 // This is the index of the first element of the vectorWidth-bit chunk
98 unsigned NormalizedIdxVal = (((IdxVal * ElVT.getSizeInBits()) / vectorWidth)
101 // If the input is a buildvector just emit a smaller one.
102 if (Vec.getOpcode() == ISD::BUILD_VECTOR)
103 return DAG.getNode(ISD::BUILD_VECTOR, dl, ResultVT,
104 makeArrayRef(Vec->op_begin()+NormalizedIdxVal,
107 SDValue VecIdx = DAG.getIntPtrConstant(NormalizedIdxVal);
108 SDValue Result = DAG.getNode(ISD::EXTRACT_SUBVECTOR, dl, ResultVT, Vec,
114 /// Generate a DAG to grab 128-bits from a vector > 128 bits. This
115 /// sets things up to match to an AVX VEXTRACTF128 / VEXTRACTI128
116 /// or AVX-512 VEXTRACTF32x4 / VEXTRACTI32x4
117 /// instructions or a simple subregister reference. Idx is an index in the
118 /// 128 bits we want. It need not be aligned to a 128-bit bounday. That makes
119 /// lowering EXTRACT_VECTOR_ELT operations easier.
120 static SDValue Extract128BitVector(SDValue Vec, unsigned IdxVal,
121 SelectionDAG &DAG, SDLoc dl) {
122 assert((Vec.getValueType().is256BitVector() ||
123 Vec.getValueType().is512BitVector()) && "Unexpected vector size!");
124 return ExtractSubVector(Vec, IdxVal, DAG, dl, 128);
127 /// Generate a DAG to grab 256-bits from a 512-bit vector.
128 static SDValue Extract256BitVector(SDValue Vec, unsigned IdxVal,
129 SelectionDAG &DAG, SDLoc dl) {
130 assert(Vec.getValueType().is512BitVector() && "Unexpected vector size!");
131 return ExtractSubVector(Vec, IdxVal, DAG, dl, 256);
134 static SDValue InsertSubVector(SDValue Result, SDValue Vec,
135 unsigned IdxVal, SelectionDAG &DAG,
136 SDLoc dl, unsigned vectorWidth) {
137 assert((vectorWidth == 128 || vectorWidth == 256) &&
138 "Unsupported vector width");
139 // Inserting UNDEF is Result
140 if (Vec.getOpcode() == ISD::UNDEF)
142 EVT VT = Vec.getValueType();
143 EVT ElVT = VT.getVectorElementType();
144 EVT ResultVT = Result.getValueType();
146 // Insert the relevant vectorWidth bits.
147 unsigned ElemsPerChunk = vectorWidth/ElVT.getSizeInBits();
149 // This is the index of the first element of the vectorWidth-bit chunk
151 unsigned NormalizedIdxVal = (((IdxVal * ElVT.getSizeInBits())/vectorWidth)
154 SDValue VecIdx = DAG.getIntPtrConstant(NormalizedIdxVal);
155 return DAG.getNode(ISD::INSERT_SUBVECTOR, dl, ResultVT, Result, Vec,
158 /// Generate a DAG to put 128-bits into a vector > 128 bits. This
159 /// sets things up to match to an AVX VINSERTF128/VINSERTI128 or
160 /// AVX-512 VINSERTF32x4/VINSERTI32x4 instructions or a
161 /// simple superregister reference. Idx is an index in the 128 bits
162 /// we want. It need not be aligned to a 128-bit bounday. That makes
163 /// lowering INSERT_VECTOR_ELT operations easier.
164 static SDValue Insert128BitVector(SDValue Result, SDValue Vec,
165 unsigned IdxVal, SelectionDAG &DAG,
167 assert(Vec.getValueType().is128BitVector() && "Unexpected vector size!");
168 return InsertSubVector(Result, Vec, IdxVal, DAG, dl, 128);
171 static SDValue Insert256BitVector(SDValue Result, SDValue Vec,
172 unsigned IdxVal, SelectionDAG &DAG,
174 assert(Vec.getValueType().is256BitVector() && "Unexpected vector size!");
175 return InsertSubVector(Result, Vec, IdxVal, DAG, dl, 256);
178 /// Concat two 128-bit vectors into a 256 bit vector using VINSERTF128
179 /// instructions. This is used because creating CONCAT_VECTOR nodes of
180 /// BUILD_VECTORS returns a larger BUILD_VECTOR while we're trying to lower
181 /// large BUILD_VECTORS.
182 static SDValue Concat128BitVectors(SDValue V1, SDValue V2, EVT VT,
183 unsigned NumElems, SelectionDAG &DAG,
185 SDValue V = Insert128BitVector(DAG.getUNDEF(VT), V1, 0, DAG, dl);
186 return Insert128BitVector(V, V2, NumElems/2, DAG, dl);
189 static SDValue Concat256BitVectors(SDValue V1, SDValue V2, EVT VT,
190 unsigned NumElems, SelectionDAG &DAG,
192 SDValue V = Insert256BitVector(DAG.getUNDEF(VT), V1, 0, DAG, dl);
193 return Insert256BitVector(V, V2, NumElems/2, DAG, dl);
196 static TargetLoweringObjectFile *createTLOF(const Triple &TT) {
197 if (TT.isOSBinFormatMachO()) {
198 if (TT.getArch() == Triple::x86_64)
199 return new X86_64MachoTargetObjectFile();
200 return new TargetLoweringObjectFileMachO();
204 return new X86LinuxTargetObjectFile();
205 if (TT.isOSBinFormatELF())
206 return new TargetLoweringObjectFileELF();
207 if (TT.isKnownWindowsMSVCEnvironment())
208 return new X86WindowsTargetObjectFile();
209 if (TT.isOSBinFormatCOFF())
210 return new TargetLoweringObjectFileCOFF();
211 llvm_unreachable("unknown subtarget type");
214 // FIXME: This should stop caching the target machine as soon as
215 // we can remove resetOperationActions et al.
216 X86TargetLowering::X86TargetLowering(const X86TargetMachine &TM)
217 : TargetLowering(TM, createTLOF(Triple(TM.getTargetTriple()))) {
218 Subtarget = &TM.getSubtarget<X86Subtarget>();
219 X86ScalarSSEf64 = Subtarget->hasSSE2();
220 X86ScalarSSEf32 = Subtarget->hasSSE1();
221 TD = getDataLayout();
223 resetOperationActions();
226 void X86TargetLowering::resetOperationActions() {
227 const TargetMachine &TM = getTargetMachine();
228 static bool FirstTimeThrough = true;
230 // If none of the target options have changed, then we don't need to reset the
231 // operation actions.
232 if (!FirstTimeThrough && TO == TM.Options) return;
234 if (!FirstTimeThrough) {
235 // Reinitialize the actions.
237 FirstTimeThrough = false;
242 // Set up the TargetLowering object.
243 static const MVT IntVTs[] = { MVT::i8, MVT::i16, MVT::i32, MVT::i64 };
245 // X86 is weird, it always uses i8 for shift amounts and setcc results.
246 setBooleanContents(ZeroOrOneBooleanContent);
247 // X86-SSE is even stranger. It uses -1 or 0 for vector masks.
248 setBooleanVectorContents(ZeroOrNegativeOneBooleanContent);
250 // For 64-bit since we have so many registers use the ILP scheduler, for
251 // 32-bit code use the register pressure specific scheduling.
252 // For Atom, always use ILP scheduling.
253 if (Subtarget->isAtom())
254 setSchedulingPreference(Sched::ILP);
255 else if (Subtarget->is64Bit())
256 setSchedulingPreference(Sched::ILP);
258 setSchedulingPreference(Sched::RegPressure);
259 const X86RegisterInfo *RegInfo =
260 TM.getSubtarget<X86Subtarget>().getRegisterInfo();
261 setStackPointerRegisterToSaveRestore(RegInfo->getStackRegister());
263 // Bypass expensive divides on Atom when compiling with O2
264 if (Subtarget->hasSlowDivide() && TM.getOptLevel() >= CodeGenOpt::Default) {
265 addBypassSlowDiv(32, 8);
266 if (Subtarget->is64Bit())
267 addBypassSlowDiv(64, 16);
270 if (Subtarget->isTargetKnownWindowsMSVC()) {
271 // Setup Windows compiler runtime calls.
272 setLibcallName(RTLIB::SDIV_I64, "_alldiv");
273 setLibcallName(RTLIB::UDIV_I64, "_aulldiv");
274 setLibcallName(RTLIB::SREM_I64, "_allrem");
275 setLibcallName(RTLIB::UREM_I64, "_aullrem");
276 setLibcallName(RTLIB::MUL_I64, "_allmul");
277 setLibcallCallingConv(RTLIB::SDIV_I64, CallingConv::X86_StdCall);
278 setLibcallCallingConv(RTLIB::UDIV_I64, CallingConv::X86_StdCall);
279 setLibcallCallingConv(RTLIB::SREM_I64, CallingConv::X86_StdCall);
280 setLibcallCallingConv(RTLIB::UREM_I64, CallingConv::X86_StdCall);
281 setLibcallCallingConv(RTLIB::MUL_I64, CallingConv::X86_StdCall);
283 // The _ftol2 runtime function has an unusual calling conv, which
284 // is modeled by a special pseudo-instruction.
285 setLibcallName(RTLIB::FPTOUINT_F64_I64, nullptr);
286 setLibcallName(RTLIB::FPTOUINT_F32_I64, nullptr);
287 setLibcallName(RTLIB::FPTOUINT_F64_I32, nullptr);
288 setLibcallName(RTLIB::FPTOUINT_F32_I32, nullptr);
291 if (Subtarget->isTargetDarwin()) {
292 // Darwin should use _setjmp/_longjmp instead of setjmp/longjmp.
293 setUseUnderscoreSetJmp(false);
294 setUseUnderscoreLongJmp(false);
295 } else if (Subtarget->isTargetWindowsGNU()) {
296 // MS runtime is weird: it exports _setjmp, but longjmp!
297 setUseUnderscoreSetJmp(true);
298 setUseUnderscoreLongJmp(false);
300 setUseUnderscoreSetJmp(true);
301 setUseUnderscoreLongJmp(true);
304 // Set up the register classes.
305 addRegisterClass(MVT::i8, &X86::GR8RegClass);
306 addRegisterClass(MVT::i16, &X86::GR16RegClass);
307 addRegisterClass(MVT::i32, &X86::GR32RegClass);
308 if (Subtarget->is64Bit())
309 addRegisterClass(MVT::i64, &X86::GR64RegClass);
311 setLoadExtAction(ISD::SEXTLOAD, MVT::i1, Promote);
313 // We don't accept any truncstore of integer registers.
314 setTruncStoreAction(MVT::i64, MVT::i32, Expand);
315 setTruncStoreAction(MVT::i64, MVT::i16, Expand);
316 setTruncStoreAction(MVT::i64, MVT::i8 , Expand);
317 setTruncStoreAction(MVT::i32, MVT::i16, Expand);
318 setTruncStoreAction(MVT::i32, MVT::i8 , Expand);
319 setTruncStoreAction(MVT::i16, MVT::i8, Expand);
321 setTruncStoreAction(MVT::f64, MVT::f32, Expand);
323 // SETOEQ and SETUNE require checking two conditions.
324 setCondCodeAction(ISD::SETOEQ, MVT::f32, Expand);
325 setCondCodeAction(ISD::SETOEQ, MVT::f64, Expand);
326 setCondCodeAction(ISD::SETOEQ, MVT::f80, Expand);
327 setCondCodeAction(ISD::SETUNE, MVT::f32, Expand);
328 setCondCodeAction(ISD::SETUNE, MVT::f64, Expand);
329 setCondCodeAction(ISD::SETUNE, MVT::f80, Expand);
331 // Promote all UINT_TO_FP to larger SINT_TO_FP's, as X86 doesn't have this
333 setOperationAction(ISD::UINT_TO_FP , MVT::i1 , Promote);
334 setOperationAction(ISD::UINT_TO_FP , MVT::i8 , Promote);
335 setOperationAction(ISD::UINT_TO_FP , MVT::i16 , Promote);
337 if (Subtarget->is64Bit()) {
338 setOperationAction(ISD::UINT_TO_FP , MVT::i32 , Promote);
339 setOperationAction(ISD::UINT_TO_FP , MVT::i64 , Custom);
340 } else if (!TM.Options.UseSoftFloat) {
341 // We have an algorithm for SSE2->double, and we turn this into a
342 // 64-bit FILD followed by conditional FADD for other targets.
343 setOperationAction(ISD::UINT_TO_FP , MVT::i64 , Custom);
344 // We have an algorithm for SSE2, and we turn this into a 64-bit
345 // FILD for other targets.
346 setOperationAction(ISD::UINT_TO_FP , MVT::i32 , Custom);
349 // Promote i1/i8 SINT_TO_FP to larger SINT_TO_FP's, as X86 doesn't have
351 setOperationAction(ISD::SINT_TO_FP , MVT::i1 , Promote);
352 setOperationAction(ISD::SINT_TO_FP , MVT::i8 , Promote);
354 if (!TM.Options.UseSoftFloat) {
355 // SSE has no i16 to fp conversion, only i32
356 if (X86ScalarSSEf32) {
357 setOperationAction(ISD::SINT_TO_FP , MVT::i16 , Promote);
358 // f32 and f64 cases are Legal, f80 case is not
359 setOperationAction(ISD::SINT_TO_FP , MVT::i32 , Custom);
361 setOperationAction(ISD::SINT_TO_FP , MVT::i16 , Custom);
362 setOperationAction(ISD::SINT_TO_FP , MVT::i32 , Custom);
365 setOperationAction(ISD::SINT_TO_FP , MVT::i16 , Promote);
366 setOperationAction(ISD::SINT_TO_FP , MVT::i32 , Promote);
369 // In 32-bit mode these are custom lowered. In 64-bit mode F32 and F64
370 // are Legal, f80 is custom lowered.
371 setOperationAction(ISD::FP_TO_SINT , MVT::i64 , Custom);
372 setOperationAction(ISD::SINT_TO_FP , MVT::i64 , Custom);
374 // Promote i1/i8 FP_TO_SINT to larger FP_TO_SINTS's, as X86 doesn't have
376 setOperationAction(ISD::FP_TO_SINT , MVT::i1 , Promote);
377 setOperationAction(ISD::FP_TO_SINT , MVT::i8 , Promote);
379 if (X86ScalarSSEf32) {
380 setOperationAction(ISD::FP_TO_SINT , MVT::i16 , Promote);
381 // f32 and f64 cases are Legal, f80 case is not
382 setOperationAction(ISD::FP_TO_SINT , MVT::i32 , Custom);
384 setOperationAction(ISD::FP_TO_SINT , MVT::i16 , Custom);
385 setOperationAction(ISD::FP_TO_SINT , MVT::i32 , Custom);
388 // Handle FP_TO_UINT by promoting the destination to a larger signed
390 setOperationAction(ISD::FP_TO_UINT , MVT::i1 , Promote);
391 setOperationAction(ISD::FP_TO_UINT , MVT::i8 , Promote);
392 setOperationAction(ISD::FP_TO_UINT , MVT::i16 , Promote);
394 if (Subtarget->is64Bit()) {
395 setOperationAction(ISD::FP_TO_UINT , MVT::i64 , Expand);
396 setOperationAction(ISD::FP_TO_UINT , MVT::i32 , Promote);
397 } else if (!TM.Options.UseSoftFloat) {
398 // Since AVX is a superset of SSE3, only check for SSE here.
399 if (Subtarget->hasSSE1() && !Subtarget->hasSSE3())
400 // Expand FP_TO_UINT into a select.
401 // FIXME: We would like to use a Custom expander here eventually to do
402 // the optimal thing for SSE vs. the default expansion in the legalizer.
403 setOperationAction(ISD::FP_TO_UINT , MVT::i32 , Expand);
405 // With SSE3 we can use fisttpll to convert to a signed i64; without
406 // SSE, we're stuck with a fistpll.
407 setOperationAction(ISD::FP_TO_UINT , MVT::i32 , Custom);
410 if (isTargetFTOL()) {
411 // Use the _ftol2 runtime function, which has a pseudo-instruction
412 // to handle its weird calling convention.
413 setOperationAction(ISD::FP_TO_UINT , MVT::i64 , Custom);
416 // TODO: when we have SSE, these could be more efficient, by using movd/movq.
417 if (!X86ScalarSSEf64) {
418 setOperationAction(ISD::BITCAST , MVT::f32 , Expand);
419 setOperationAction(ISD::BITCAST , MVT::i32 , Expand);
420 if (Subtarget->is64Bit()) {
421 setOperationAction(ISD::BITCAST , MVT::f64 , Expand);
422 // Without SSE, i64->f64 goes through memory.
423 setOperationAction(ISD::BITCAST , MVT::i64 , Expand);
427 // Scalar integer divide and remainder are lowered to use operations that
428 // produce two results, to match the available instructions. This exposes
429 // the two-result form to trivial CSE, which is able to combine x/y and x%y
430 // into a single instruction.
432 // Scalar integer multiply-high is also lowered to use two-result
433 // operations, to match the available instructions. However, plain multiply
434 // (low) operations are left as Legal, as there are single-result
435 // instructions for this in x86. Using the two-result multiply instructions
436 // when both high and low results are needed must be arranged by dagcombine.
437 for (unsigned i = 0; i != array_lengthof(IntVTs); ++i) {
439 setOperationAction(ISD::MULHS, VT, Expand);
440 setOperationAction(ISD::MULHU, VT, Expand);
441 setOperationAction(ISD::SDIV, VT, Expand);
442 setOperationAction(ISD::UDIV, VT, Expand);
443 setOperationAction(ISD::SREM, VT, Expand);
444 setOperationAction(ISD::UREM, VT, Expand);
446 // Add/Sub overflow ops with MVT::Glues are lowered to EFLAGS dependences.
447 setOperationAction(ISD::ADDC, VT, Custom);
448 setOperationAction(ISD::ADDE, VT, Custom);
449 setOperationAction(ISD::SUBC, VT, Custom);
450 setOperationAction(ISD::SUBE, VT, Custom);
453 setOperationAction(ISD::BR_JT , MVT::Other, Expand);
454 setOperationAction(ISD::BRCOND , MVT::Other, Custom);
455 setOperationAction(ISD::BR_CC , MVT::f32, Expand);
456 setOperationAction(ISD::BR_CC , MVT::f64, Expand);
457 setOperationAction(ISD::BR_CC , MVT::f80, Expand);
458 setOperationAction(ISD::BR_CC , MVT::i8, Expand);
459 setOperationAction(ISD::BR_CC , MVT::i16, Expand);
460 setOperationAction(ISD::BR_CC , MVT::i32, Expand);
461 setOperationAction(ISD::BR_CC , MVT::i64, Expand);
462 setOperationAction(ISD::SELECT_CC , MVT::f32, Expand);
463 setOperationAction(ISD::SELECT_CC , MVT::f64, Expand);
464 setOperationAction(ISD::SELECT_CC , MVT::f80, Expand);
465 setOperationAction(ISD::SELECT_CC , MVT::i8, Expand);
466 setOperationAction(ISD::SELECT_CC , MVT::i16, Expand);
467 setOperationAction(ISD::SELECT_CC , MVT::i32, Expand);
468 setOperationAction(ISD::SELECT_CC , MVT::i64, Expand);
469 if (Subtarget->is64Bit())
470 setOperationAction(ISD::SIGN_EXTEND_INREG, MVT::i32, Legal);
471 setOperationAction(ISD::SIGN_EXTEND_INREG, MVT::i16 , Legal);
472 setOperationAction(ISD::SIGN_EXTEND_INREG, MVT::i8 , Legal);
473 setOperationAction(ISD::SIGN_EXTEND_INREG, MVT::i1 , Expand);
474 setOperationAction(ISD::FP_ROUND_INREG , MVT::f32 , Expand);
475 setOperationAction(ISD::FREM , MVT::f32 , Expand);
476 setOperationAction(ISD::FREM , MVT::f64 , Expand);
477 setOperationAction(ISD::FREM , MVT::f80 , Expand);
478 setOperationAction(ISD::FLT_ROUNDS_ , MVT::i32 , Custom);
480 // Promote the i8 variants and force them on up to i32 which has a shorter
482 setOperationAction(ISD::CTTZ , MVT::i8 , Promote);
483 AddPromotedToType (ISD::CTTZ , MVT::i8 , MVT::i32);
484 setOperationAction(ISD::CTTZ_ZERO_UNDEF , MVT::i8 , Promote);
485 AddPromotedToType (ISD::CTTZ_ZERO_UNDEF , MVT::i8 , MVT::i32);
486 if (Subtarget->hasBMI()) {
487 setOperationAction(ISD::CTTZ_ZERO_UNDEF, MVT::i16 , Expand);
488 setOperationAction(ISD::CTTZ_ZERO_UNDEF, MVT::i32 , Expand);
489 if (Subtarget->is64Bit())
490 setOperationAction(ISD::CTTZ_ZERO_UNDEF, MVT::i64, Expand);
492 setOperationAction(ISD::CTTZ , MVT::i16 , Custom);
493 setOperationAction(ISD::CTTZ , MVT::i32 , Custom);
494 if (Subtarget->is64Bit())
495 setOperationAction(ISD::CTTZ , MVT::i64 , Custom);
498 if (Subtarget->hasLZCNT()) {
499 // When promoting the i8 variants, force them to i32 for a shorter
501 setOperationAction(ISD::CTLZ , MVT::i8 , Promote);
502 AddPromotedToType (ISD::CTLZ , MVT::i8 , MVT::i32);
503 setOperationAction(ISD::CTLZ_ZERO_UNDEF, MVT::i8 , Promote);
504 AddPromotedToType (ISD::CTLZ_ZERO_UNDEF, MVT::i8 , MVT::i32);
505 setOperationAction(ISD::CTLZ_ZERO_UNDEF, MVT::i16 , Expand);
506 setOperationAction(ISD::CTLZ_ZERO_UNDEF, MVT::i32 , Expand);
507 if (Subtarget->is64Bit())
508 setOperationAction(ISD::CTLZ_ZERO_UNDEF, MVT::i64, Expand);
510 setOperationAction(ISD::CTLZ , MVT::i8 , Custom);
511 setOperationAction(ISD::CTLZ , MVT::i16 , Custom);
512 setOperationAction(ISD::CTLZ , MVT::i32 , Custom);
513 setOperationAction(ISD::CTLZ_ZERO_UNDEF, MVT::i8 , Custom);
514 setOperationAction(ISD::CTLZ_ZERO_UNDEF, MVT::i16 , Custom);
515 setOperationAction(ISD::CTLZ_ZERO_UNDEF, MVT::i32 , Custom);
516 if (Subtarget->is64Bit()) {
517 setOperationAction(ISD::CTLZ , MVT::i64 , Custom);
518 setOperationAction(ISD::CTLZ_ZERO_UNDEF, MVT::i64, Custom);
522 // Special handling for half-precision floating point conversions.
523 // If we don't have F16C support, then lower half float conversions
524 // into library calls.
525 if (TM.Options.UseSoftFloat || !Subtarget->hasF16C()) {
526 setOperationAction(ISD::FP16_TO_FP, MVT::f32, Expand);
527 setOperationAction(ISD::FP_TO_FP16, MVT::f32, Expand);
530 // There's never any support for operations beyond MVT::f32.
531 setOperationAction(ISD::FP16_TO_FP, MVT::f64, Expand);
532 setOperationAction(ISD::FP16_TO_FP, MVT::f80, Expand);
533 setOperationAction(ISD::FP_TO_FP16, MVT::f64, Expand);
534 setOperationAction(ISD::FP_TO_FP16, MVT::f80, Expand);
536 setLoadExtAction(ISD::EXTLOAD, MVT::f16, Expand);
537 setTruncStoreAction(MVT::f32, MVT::f16, Expand);
538 setTruncStoreAction(MVT::f64, MVT::f16, Expand);
539 setTruncStoreAction(MVT::f80, MVT::f16, Expand);
541 if (Subtarget->hasPOPCNT()) {
542 setOperationAction(ISD::CTPOP , MVT::i8 , Promote);
544 setOperationAction(ISD::CTPOP , MVT::i8 , Expand);
545 setOperationAction(ISD::CTPOP , MVT::i16 , Expand);
546 setOperationAction(ISD::CTPOP , MVT::i32 , Expand);
547 if (Subtarget->is64Bit())
548 setOperationAction(ISD::CTPOP , MVT::i64 , Expand);
551 setOperationAction(ISD::READCYCLECOUNTER , MVT::i64 , Custom);
553 if (!Subtarget->hasMOVBE())
554 setOperationAction(ISD::BSWAP , MVT::i16 , Expand);
556 // These should be promoted to a larger select which is supported.
557 setOperationAction(ISD::SELECT , MVT::i1 , Promote);
558 // X86 wants to expand cmov itself.
559 setOperationAction(ISD::SELECT , MVT::i8 , Custom);
560 setOperationAction(ISD::SELECT , MVT::i16 , Custom);
561 setOperationAction(ISD::SELECT , MVT::i32 , Custom);
562 setOperationAction(ISD::SELECT , MVT::f32 , Custom);
563 setOperationAction(ISD::SELECT , MVT::f64 , Custom);
564 setOperationAction(ISD::SELECT , MVT::f80 , Custom);
565 setOperationAction(ISD::SETCC , MVT::i8 , Custom);
566 setOperationAction(ISD::SETCC , MVT::i16 , Custom);
567 setOperationAction(ISD::SETCC , MVT::i32 , Custom);
568 setOperationAction(ISD::SETCC , MVT::f32 , Custom);
569 setOperationAction(ISD::SETCC , MVT::f64 , Custom);
570 setOperationAction(ISD::SETCC , MVT::f80 , Custom);
571 if (Subtarget->is64Bit()) {
572 setOperationAction(ISD::SELECT , MVT::i64 , Custom);
573 setOperationAction(ISD::SETCC , MVT::i64 , Custom);
575 setOperationAction(ISD::EH_RETURN , MVT::Other, Custom);
576 // NOTE: EH_SJLJ_SETJMP/_LONGJMP supported here is NOT intended to support
577 // SjLj exception handling but a light-weight setjmp/longjmp replacement to
578 // support continuation, user-level threading, and etc.. As a result, no
579 // other SjLj exception interfaces are implemented and please don't build
580 // your own exception handling based on them.
581 // LLVM/Clang supports zero-cost DWARF exception handling.
582 setOperationAction(ISD::EH_SJLJ_SETJMP, MVT::i32, Custom);
583 setOperationAction(ISD::EH_SJLJ_LONGJMP, MVT::Other, Custom);
586 setOperationAction(ISD::ConstantPool , MVT::i32 , Custom);
587 setOperationAction(ISD::JumpTable , MVT::i32 , Custom);
588 setOperationAction(ISD::GlobalAddress , MVT::i32 , Custom);
589 setOperationAction(ISD::GlobalTLSAddress, MVT::i32 , Custom);
590 if (Subtarget->is64Bit())
591 setOperationAction(ISD::GlobalTLSAddress, MVT::i64, Custom);
592 setOperationAction(ISD::ExternalSymbol , MVT::i32 , Custom);
593 setOperationAction(ISD::BlockAddress , MVT::i32 , Custom);
594 if (Subtarget->is64Bit()) {
595 setOperationAction(ISD::ConstantPool , MVT::i64 , Custom);
596 setOperationAction(ISD::JumpTable , MVT::i64 , Custom);
597 setOperationAction(ISD::GlobalAddress , MVT::i64 , Custom);
598 setOperationAction(ISD::ExternalSymbol, MVT::i64 , Custom);
599 setOperationAction(ISD::BlockAddress , MVT::i64 , Custom);
601 // 64-bit addm sub, shl, sra, srl (iff 32-bit x86)
602 setOperationAction(ISD::SHL_PARTS , MVT::i32 , Custom);
603 setOperationAction(ISD::SRA_PARTS , MVT::i32 , Custom);
604 setOperationAction(ISD::SRL_PARTS , MVT::i32 , Custom);
605 if (Subtarget->is64Bit()) {
606 setOperationAction(ISD::SHL_PARTS , MVT::i64 , Custom);
607 setOperationAction(ISD::SRA_PARTS , MVT::i64 , Custom);
608 setOperationAction(ISD::SRL_PARTS , MVT::i64 , Custom);
611 if (Subtarget->hasSSE1())
612 setOperationAction(ISD::PREFETCH , MVT::Other, Legal);
614 setOperationAction(ISD::ATOMIC_FENCE , MVT::Other, Custom);
616 // Expand certain atomics
617 for (unsigned i = 0; i != array_lengthof(IntVTs); ++i) {
619 setOperationAction(ISD::ATOMIC_CMP_SWAP_WITH_SUCCESS, VT, Custom);
620 setOperationAction(ISD::ATOMIC_LOAD_SUB, VT, Custom);
621 setOperationAction(ISD::ATOMIC_STORE, VT, Custom);
624 if (Subtarget->hasCmpxchg16b()) {
625 setOperationAction(ISD::ATOMIC_CMP_SWAP_WITH_SUCCESS, MVT::i128, Custom);
628 // FIXME - use subtarget debug flags
629 if (!Subtarget->isTargetDarwin() && !Subtarget->isTargetELF() &&
630 !Subtarget->isTargetCygMing() && !Subtarget->isTargetWin64()) {
631 setOperationAction(ISD::EH_LABEL, MVT::Other, Expand);
634 if (Subtarget->is64Bit()) {
635 setExceptionPointerRegister(X86::RAX);
636 setExceptionSelectorRegister(X86::RDX);
638 setExceptionPointerRegister(X86::EAX);
639 setExceptionSelectorRegister(X86::EDX);
641 setOperationAction(ISD::FRAME_TO_ARGS_OFFSET, MVT::i32, Custom);
642 setOperationAction(ISD::FRAME_TO_ARGS_OFFSET, MVT::i64, Custom);
644 setOperationAction(ISD::INIT_TRAMPOLINE, MVT::Other, Custom);
645 setOperationAction(ISD::ADJUST_TRAMPOLINE, MVT::Other, Custom);
647 setOperationAction(ISD::TRAP, MVT::Other, Legal);
648 setOperationAction(ISD::DEBUGTRAP, MVT::Other, Legal);
650 // VASTART needs to be custom lowered to use the VarArgsFrameIndex
651 setOperationAction(ISD::VASTART , MVT::Other, Custom);
652 setOperationAction(ISD::VAEND , MVT::Other, Expand);
653 if (Subtarget->is64Bit() && !Subtarget->isTargetWin64()) {
654 // TargetInfo::X86_64ABIBuiltinVaList
655 setOperationAction(ISD::VAARG , MVT::Other, Custom);
656 setOperationAction(ISD::VACOPY , MVT::Other, Custom);
658 // TargetInfo::CharPtrBuiltinVaList
659 setOperationAction(ISD::VAARG , MVT::Other, Expand);
660 setOperationAction(ISD::VACOPY , MVT::Other, Expand);
663 setOperationAction(ISD::STACKSAVE, MVT::Other, Expand);
664 setOperationAction(ISD::STACKRESTORE, MVT::Other, Expand);
666 setOperationAction(ISD::DYNAMIC_STACKALLOC, getPointerTy(), Custom);
668 if (!TM.Options.UseSoftFloat && X86ScalarSSEf64) {
669 // f32 and f64 use SSE.
670 // Set up the FP register classes.
671 addRegisterClass(MVT::f32, &X86::FR32RegClass);
672 addRegisterClass(MVT::f64, &X86::FR64RegClass);
674 // Use ANDPD to simulate FABS.
675 setOperationAction(ISD::FABS , MVT::f64, Custom);
676 setOperationAction(ISD::FABS , MVT::f32, Custom);
678 // Use XORP to simulate FNEG.
679 setOperationAction(ISD::FNEG , MVT::f64, Custom);
680 setOperationAction(ISD::FNEG , MVT::f32, Custom);
682 // Use ANDPD and ORPD to simulate FCOPYSIGN.
683 setOperationAction(ISD::FCOPYSIGN, MVT::f64, Custom);
684 setOperationAction(ISD::FCOPYSIGN, MVT::f32, Custom);
686 // Lower this to FGETSIGNx86 plus an AND.
687 setOperationAction(ISD::FGETSIGN, MVT::i64, Custom);
688 setOperationAction(ISD::FGETSIGN, MVT::i32, Custom);
690 // We don't support sin/cos/fmod
691 setOperationAction(ISD::FSIN , MVT::f64, Expand);
692 setOperationAction(ISD::FCOS , MVT::f64, Expand);
693 setOperationAction(ISD::FSINCOS, MVT::f64, Expand);
694 setOperationAction(ISD::FSIN , MVT::f32, Expand);
695 setOperationAction(ISD::FCOS , MVT::f32, Expand);
696 setOperationAction(ISD::FSINCOS, MVT::f32, Expand);
698 // Expand FP immediates into loads from the stack, except for the special
700 addLegalFPImmediate(APFloat(+0.0)); // xorpd
701 addLegalFPImmediate(APFloat(+0.0f)); // xorps
702 } else if (!TM.Options.UseSoftFloat && X86ScalarSSEf32) {
703 // Use SSE for f32, x87 for f64.
704 // Set up the FP register classes.
705 addRegisterClass(MVT::f32, &X86::FR32RegClass);
706 addRegisterClass(MVT::f64, &X86::RFP64RegClass);
708 // Use ANDPS to simulate FABS.
709 setOperationAction(ISD::FABS , MVT::f32, Custom);
711 // Use XORP to simulate FNEG.
712 setOperationAction(ISD::FNEG , MVT::f32, Custom);
714 setOperationAction(ISD::UNDEF, MVT::f64, Expand);
716 // Use ANDPS and ORPS to simulate FCOPYSIGN.
717 setOperationAction(ISD::FCOPYSIGN, MVT::f64, Expand);
718 setOperationAction(ISD::FCOPYSIGN, MVT::f32, Custom);
720 // We don't support sin/cos/fmod
721 setOperationAction(ISD::FSIN , MVT::f32, Expand);
722 setOperationAction(ISD::FCOS , MVT::f32, Expand);
723 setOperationAction(ISD::FSINCOS, MVT::f32, Expand);
725 // Special cases we handle for FP constants.
726 addLegalFPImmediate(APFloat(+0.0f)); // xorps
727 addLegalFPImmediate(APFloat(+0.0)); // FLD0
728 addLegalFPImmediate(APFloat(+1.0)); // FLD1
729 addLegalFPImmediate(APFloat(-0.0)); // FLD0/FCHS
730 addLegalFPImmediate(APFloat(-1.0)); // FLD1/FCHS
732 if (!TM.Options.UnsafeFPMath) {
733 setOperationAction(ISD::FSIN , MVT::f64, Expand);
734 setOperationAction(ISD::FCOS , MVT::f64, Expand);
735 setOperationAction(ISD::FSINCOS, MVT::f64, Expand);
737 } else if (!TM.Options.UseSoftFloat) {
738 // f32 and f64 in x87.
739 // Set up the FP register classes.
740 addRegisterClass(MVT::f64, &X86::RFP64RegClass);
741 addRegisterClass(MVT::f32, &X86::RFP32RegClass);
743 setOperationAction(ISD::UNDEF, MVT::f64, Expand);
744 setOperationAction(ISD::UNDEF, MVT::f32, Expand);
745 setOperationAction(ISD::FCOPYSIGN, MVT::f64, Expand);
746 setOperationAction(ISD::FCOPYSIGN, MVT::f32, Expand);
748 if (!TM.Options.UnsafeFPMath) {
749 setOperationAction(ISD::FSIN , MVT::f64, Expand);
750 setOperationAction(ISD::FSIN , MVT::f32, Expand);
751 setOperationAction(ISD::FCOS , MVT::f64, Expand);
752 setOperationAction(ISD::FCOS , MVT::f32, Expand);
753 setOperationAction(ISD::FSINCOS, MVT::f64, Expand);
754 setOperationAction(ISD::FSINCOS, MVT::f32, Expand);
756 addLegalFPImmediate(APFloat(+0.0)); // FLD0
757 addLegalFPImmediate(APFloat(+1.0)); // FLD1
758 addLegalFPImmediate(APFloat(-0.0)); // FLD0/FCHS
759 addLegalFPImmediate(APFloat(-1.0)); // FLD1/FCHS
760 addLegalFPImmediate(APFloat(+0.0f)); // FLD0
761 addLegalFPImmediate(APFloat(+1.0f)); // FLD1
762 addLegalFPImmediate(APFloat(-0.0f)); // FLD0/FCHS
763 addLegalFPImmediate(APFloat(-1.0f)); // FLD1/FCHS
766 // We don't support FMA.
767 setOperationAction(ISD::FMA, MVT::f64, Expand);
768 setOperationAction(ISD::FMA, MVT::f32, Expand);
770 // Long double always uses X87.
771 if (!TM.Options.UseSoftFloat) {
772 addRegisterClass(MVT::f80, &X86::RFP80RegClass);
773 setOperationAction(ISD::UNDEF, MVT::f80, Expand);
774 setOperationAction(ISD::FCOPYSIGN, MVT::f80, Expand);
776 APFloat TmpFlt = APFloat::getZero(APFloat::x87DoubleExtended);
777 addLegalFPImmediate(TmpFlt); // FLD0
779 addLegalFPImmediate(TmpFlt); // FLD0/FCHS
782 APFloat TmpFlt2(+1.0);
783 TmpFlt2.convert(APFloat::x87DoubleExtended, APFloat::rmNearestTiesToEven,
785 addLegalFPImmediate(TmpFlt2); // FLD1
786 TmpFlt2.changeSign();
787 addLegalFPImmediate(TmpFlt2); // FLD1/FCHS
790 if (!TM.Options.UnsafeFPMath) {
791 setOperationAction(ISD::FSIN , MVT::f80, Expand);
792 setOperationAction(ISD::FCOS , MVT::f80, Expand);
793 setOperationAction(ISD::FSINCOS, MVT::f80, Expand);
796 setOperationAction(ISD::FFLOOR, MVT::f80, Expand);
797 setOperationAction(ISD::FCEIL, MVT::f80, Expand);
798 setOperationAction(ISD::FTRUNC, MVT::f80, Expand);
799 setOperationAction(ISD::FRINT, MVT::f80, Expand);
800 setOperationAction(ISD::FNEARBYINT, MVT::f80, Expand);
801 setOperationAction(ISD::FMA, MVT::f80, Expand);
804 // Always use a library call for pow.
805 setOperationAction(ISD::FPOW , MVT::f32 , Expand);
806 setOperationAction(ISD::FPOW , MVT::f64 , Expand);
807 setOperationAction(ISD::FPOW , MVT::f80 , Expand);
809 setOperationAction(ISD::FLOG, MVT::f80, Expand);
810 setOperationAction(ISD::FLOG2, MVT::f80, Expand);
811 setOperationAction(ISD::FLOG10, MVT::f80, Expand);
812 setOperationAction(ISD::FEXP, MVT::f80, Expand);
813 setOperationAction(ISD::FEXP2, MVT::f80, Expand);
814 setOperationAction(ISD::FMINNUM, MVT::f80, Expand);
815 setOperationAction(ISD::FMAXNUM, MVT::f80, Expand);
817 // First set operation action for all vector types to either promote
818 // (for widening) or expand (for scalarization). Then we will selectively
819 // turn on ones that can be effectively codegen'd.
820 for (int i = MVT::FIRST_VECTOR_VALUETYPE;
821 i <= MVT::LAST_VECTOR_VALUETYPE; ++i) {
822 MVT VT = (MVT::SimpleValueType)i;
823 setOperationAction(ISD::ADD , VT, Expand);
824 setOperationAction(ISD::SUB , VT, Expand);
825 setOperationAction(ISD::FADD, VT, Expand);
826 setOperationAction(ISD::FNEG, VT, Expand);
827 setOperationAction(ISD::FSUB, VT, Expand);
828 setOperationAction(ISD::MUL , VT, Expand);
829 setOperationAction(ISD::FMUL, VT, Expand);
830 setOperationAction(ISD::SDIV, VT, Expand);
831 setOperationAction(ISD::UDIV, VT, Expand);
832 setOperationAction(ISD::FDIV, VT, Expand);
833 setOperationAction(ISD::SREM, VT, Expand);
834 setOperationAction(ISD::UREM, VT, Expand);
835 setOperationAction(ISD::LOAD, VT, Expand);
836 setOperationAction(ISD::VECTOR_SHUFFLE, VT, Expand);
837 setOperationAction(ISD::EXTRACT_VECTOR_ELT, VT,Expand);
838 setOperationAction(ISD::INSERT_VECTOR_ELT, VT, Expand);
839 setOperationAction(ISD::EXTRACT_SUBVECTOR, VT,Expand);
840 setOperationAction(ISD::INSERT_SUBVECTOR, VT,Expand);
841 setOperationAction(ISD::FABS, VT, Expand);
842 setOperationAction(ISD::FSIN, VT, Expand);
843 setOperationAction(ISD::FSINCOS, VT, Expand);
844 setOperationAction(ISD::FCOS, VT, Expand);
845 setOperationAction(ISD::FSINCOS, VT, Expand);
846 setOperationAction(ISD::FREM, VT, Expand);
847 setOperationAction(ISD::FMA, VT, Expand);
848 setOperationAction(ISD::FPOWI, VT, Expand);
849 setOperationAction(ISD::FSQRT, VT, Expand);
850 setOperationAction(ISD::FCOPYSIGN, VT, Expand);
851 setOperationAction(ISD::FFLOOR, VT, Expand);
852 setOperationAction(ISD::FCEIL, VT, Expand);
853 setOperationAction(ISD::FTRUNC, VT, Expand);
854 setOperationAction(ISD::FRINT, VT, Expand);
855 setOperationAction(ISD::FNEARBYINT, VT, Expand);
856 setOperationAction(ISD::SMUL_LOHI, VT, Expand);
857 setOperationAction(ISD::MULHS, VT, Expand);
858 setOperationAction(ISD::UMUL_LOHI, VT, Expand);
859 setOperationAction(ISD::MULHU, VT, Expand);
860 setOperationAction(ISD::SDIVREM, VT, Expand);
861 setOperationAction(ISD::UDIVREM, VT, Expand);
862 setOperationAction(ISD::FPOW, VT, Expand);
863 setOperationAction(ISD::CTPOP, VT, Expand);
864 setOperationAction(ISD::CTTZ, VT, Expand);
865 setOperationAction(ISD::CTTZ_ZERO_UNDEF, VT, Expand);
866 setOperationAction(ISD::CTLZ, VT, Expand);
867 setOperationAction(ISD::CTLZ_ZERO_UNDEF, VT, Expand);
868 setOperationAction(ISD::SHL, VT, Expand);
869 setOperationAction(ISD::SRA, VT, Expand);
870 setOperationAction(ISD::SRL, VT, Expand);
871 setOperationAction(ISD::ROTL, VT, Expand);
872 setOperationAction(ISD::ROTR, VT, Expand);
873 setOperationAction(ISD::BSWAP, VT, Expand);
874 setOperationAction(ISD::SETCC, VT, Expand);
875 setOperationAction(ISD::FLOG, VT, Expand);
876 setOperationAction(ISD::FLOG2, VT, Expand);
877 setOperationAction(ISD::FLOG10, VT, Expand);
878 setOperationAction(ISD::FEXP, VT, Expand);
879 setOperationAction(ISD::FEXP2, VT, Expand);
880 setOperationAction(ISD::FP_TO_UINT, VT, Expand);
881 setOperationAction(ISD::FP_TO_SINT, VT, Expand);
882 setOperationAction(ISD::UINT_TO_FP, VT, Expand);
883 setOperationAction(ISD::SINT_TO_FP, VT, Expand);
884 setOperationAction(ISD::SIGN_EXTEND_INREG, VT,Expand);
885 setOperationAction(ISD::TRUNCATE, VT, Expand);
886 setOperationAction(ISD::SIGN_EXTEND, VT, Expand);
887 setOperationAction(ISD::ZERO_EXTEND, VT, Expand);
888 setOperationAction(ISD::ANY_EXTEND, VT, Expand);
889 setOperationAction(ISD::VSELECT, VT, Expand);
890 setOperationAction(ISD::SELECT_CC, VT, Expand);
891 for (int InnerVT = MVT::FIRST_VECTOR_VALUETYPE;
892 InnerVT <= MVT::LAST_VECTOR_VALUETYPE; ++InnerVT)
893 setTruncStoreAction(VT,
894 (MVT::SimpleValueType)InnerVT, Expand);
895 setLoadExtAction(ISD::SEXTLOAD, VT, Expand);
896 setLoadExtAction(ISD::ZEXTLOAD, VT, Expand);
898 // N.b. ISD::EXTLOAD legality is basically ignored except for i1-like types,
899 // we have to deal with them whether we ask for Expansion or not. Setting
900 // Expand causes its own optimisation problems though, so leave them legal.
901 if (VT.getVectorElementType() == MVT::i1)
902 setLoadExtAction(ISD::EXTLOAD, VT, Expand);
905 // FIXME: In order to prevent SSE instructions being expanded to MMX ones
906 // with -msoft-float, disable use of MMX as well.
907 if (!TM.Options.UseSoftFloat && Subtarget->hasMMX()) {
908 addRegisterClass(MVT::x86mmx, &X86::VR64RegClass);
909 // No operations on x86mmx supported, everything uses intrinsics.
912 // MMX-sized vectors (other than x86mmx) are expected to be expanded
913 // into smaller operations.
914 setOperationAction(ISD::MULHS, MVT::v8i8, Expand);
915 setOperationAction(ISD::MULHS, MVT::v4i16, Expand);
916 setOperationAction(ISD::MULHS, MVT::v2i32, Expand);
917 setOperationAction(ISD::MULHS, MVT::v1i64, Expand);
918 setOperationAction(ISD::AND, MVT::v8i8, Expand);
919 setOperationAction(ISD::AND, MVT::v4i16, Expand);
920 setOperationAction(ISD::AND, MVT::v2i32, Expand);
921 setOperationAction(ISD::AND, MVT::v1i64, Expand);
922 setOperationAction(ISD::OR, MVT::v8i8, Expand);
923 setOperationAction(ISD::OR, MVT::v4i16, Expand);
924 setOperationAction(ISD::OR, MVT::v2i32, Expand);
925 setOperationAction(ISD::OR, MVT::v1i64, Expand);
926 setOperationAction(ISD::XOR, MVT::v8i8, Expand);
927 setOperationAction(ISD::XOR, MVT::v4i16, Expand);
928 setOperationAction(ISD::XOR, MVT::v2i32, Expand);
929 setOperationAction(ISD::XOR, MVT::v1i64, Expand);
930 setOperationAction(ISD::SCALAR_TO_VECTOR, MVT::v8i8, Expand);
931 setOperationAction(ISD::SCALAR_TO_VECTOR, MVT::v4i16, Expand);
932 setOperationAction(ISD::SCALAR_TO_VECTOR, MVT::v2i32, Expand);
933 setOperationAction(ISD::SCALAR_TO_VECTOR, MVT::v1i64, Expand);
934 setOperationAction(ISD::INSERT_VECTOR_ELT, MVT::v1i64, Expand);
935 setOperationAction(ISD::SELECT, MVT::v8i8, Expand);
936 setOperationAction(ISD::SELECT, MVT::v4i16, Expand);
937 setOperationAction(ISD::SELECT, MVT::v2i32, Expand);
938 setOperationAction(ISD::SELECT, MVT::v1i64, Expand);
939 setOperationAction(ISD::BITCAST, MVT::v8i8, Expand);
940 setOperationAction(ISD::BITCAST, MVT::v4i16, Expand);
941 setOperationAction(ISD::BITCAST, MVT::v2i32, Expand);
942 setOperationAction(ISD::BITCAST, MVT::v1i64, Expand);
944 if (!TM.Options.UseSoftFloat && Subtarget->hasSSE1()) {
945 addRegisterClass(MVT::v4f32, &X86::VR128RegClass);
947 setOperationAction(ISD::FADD, MVT::v4f32, Legal);
948 setOperationAction(ISD::FSUB, MVT::v4f32, Legal);
949 setOperationAction(ISD::FMUL, MVT::v4f32, Legal);
950 setOperationAction(ISD::FDIV, MVT::v4f32, Legal);
951 setOperationAction(ISD::FSQRT, MVT::v4f32, Legal);
952 setOperationAction(ISD::FNEG, MVT::v4f32, Custom);
953 setOperationAction(ISD::FABS, MVT::v4f32, Custom);
954 setOperationAction(ISD::LOAD, MVT::v4f32, Legal);
955 setOperationAction(ISD::BUILD_VECTOR, MVT::v4f32, Custom);
956 setOperationAction(ISD::VECTOR_SHUFFLE, MVT::v4f32, Custom);
957 setOperationAction(ISD::EXTRACT_VECTOR_ELT, MVT::v4f32, Custom);
958 setOperationAction(ISD::SELECT, MVT::v4f32, Custom);
959 setOperationAction(ISD::UINT_TO_FP, MVT::v4i32, Custom);
962 if (!TM.Options.UseSoftFloat && Subtarget->hasSSE2()) {
963 addRegisterClass(MVT::v2f64, &X86::VR128RegClass);
965 // FIXME: Unfortunately, -soft-float and -no-implicit-float mean XMM
966 // registers cannot be used even for integer operations.
967 addRegisterClass(MVT::v16i8, &X86::VR128RegClass);
968 addRegisterClass(MVT::v8i16, &X86::VR128RegClass);
969 addRegisterClass(MVT::v4i32, &X86::VR128RegClass);
970 addRegisterClass(MVT::v2i64, &X86::VR128RegClass);
972 setOperationAction(ISD::ADD, MVT::v16i8, Legal);
973 setOperationAction(ISD::ADD, MVT::v8i16, Legal);
974 setOperationAction(ISD::ADD, MVT::v4i32, Legal);
975 setOperationAction(ISD::ADD, MVT::v2i64, Legal);
976 setOperationAction(ISD::MUL, MVT::v4i32, Custom);
977 setOperationAction(ISD::MUL, MVT::v2i64, Custom);
978 setOperationAction(ISD::UMUL_LOHI, MVT::v4i32, Custom);
979 setOperationAction(ISD::SMUL_LOHI, MVT::v4i32, Custom);
980 setOperationAction(ISD::MULHU, MVT::v8i16, Legal);
981 setOperationAction(ISD::MULHS, MVT::v8i16, Legal);
982 setOperationAction(ISD::SUB, MVT::v16i8, Legal);
983 setOperationAction(ISD::SUB, MVT::v8i16, Legal);
984 setOperationAction(ISD::SUB, MVT::v4i32, Legal);
985 setOperationAction(ISD::SUB, MVT::v2i64, Legal);
986 setOperationAction(ISD::MUL, MVT::v8i16, Legal);
987 setOperationAction(ISD::FADD, MVT::v2f64, Legal);
988 setOperationAction(ISD::FSUB, MVT::v2f64, Legal);
989 setOperationAction(ISD::FMUL, MVT::v2f64, Legal);
990 setOperationAction(ISD::FDIV, MVT::v2f64, Legal);
991 setOperationAction(ISD::FSQRT, MVT::v2f64, Legal);
992 setOperationAction(ISD::FNEG, MVT::v2f64, Custom);
993 setOperationAction(ISD::FABS, MVT::v2f64, Custom);
995 setOperationAction(ISD::SETCC, MVT::v2i64, Custom);
996 setOperationAction(ISD::SETCC, MVT::v16i8, Custom);
997 setOperationAction(ISD::SETCC, MVT::v8i16, Custom);
998 setOperationAction(ISD::SETCC, MVT::v4i32, Custom);
1000 setOperationAction(ISD::SCALAR_TO_VECTOR, MVT::v16i8, Custom);
1001 setOperationAction(ISD::SCALAR_TO_VECTOR, MVT::v8i16, Custom);
1002 setOperationAction(ISD::INSERT_VECTOR_ELT, MVT::v8i16, Custom);
1003 setOperationAction(ISD::INSERT_VECTOR_ELT, MVT::v4i32, Custom);
1004 setOperationAction(ISD::INSERT_VECTOR_ELT, MVT::v4f32, Custom);
1006 // Custom lower build_vector, vector_shuffle, and extract_vector_elt.
1007 for (int i = MVT::v16i8; i != MVT::v2i64; ++i) {
1008 MVT VT = (MVT::SimpleValueType)i;
1009 // Do not attempt to custom lower non-power-of-2 vectors
1010 if (!isPowerOf2_32(VT.getVectorNumElements()))
1012 // Do not attempt to custom lower non-128-bit vectors
1013 if (!VT.is128BitVector())
1015 setOperationAction(ISD::BUILD_VECTOR, VT, Custom);
1016 setOperationAction(ISD::VECTOR_SHUFFLE, VT, Custom);
1017 setOperationAction(ISD::EXTRACT_VECTOR_ELT, VT, Custom);
1020 // We support custom legalizing of sext and anyext loads for specific
1021 // memory vector types which we can load as a scalar (or sequence of
1022 // scalars) and extend in-register to a legal 128-bit vector type. For sext
1023 // loads these must work with a single scalar load.
1024 setLoadExtAction(ISD::SEXTLOAD, MVT::v4i8, Custom);
1025 setLoadExtAction(ISD::SEXTLOAD, MVT::v4i16, Custom);
1026 setLoadExtAction(ISD::SEXTLOAD, MVT::v8i8, Custom);
1027 setLoadExtAction(ISD::EXTLOAD, MVT::v2i8, Custom);
1028 setLoadExtAction(ISD::EXTLOAD, MVT::v2i16, Custom);
1029 setLoadExtAction(ISD::EXTLOAD, MVT::v2i32, Custom);
1030 setLoadExtAction(ISD::EXTLOAD, MVT::v4i8, Custom);
1031 setLoadExtAction(ISD::EXTLOAD, MVT::v4i16, Custom);
1032 setLoadExtAction(ISD::EXTLOAD, MVT::v8i8, Custom);
1034 setOperationAction(ISD::BUILD_VECTOR, MVT::v2f64, Custom);
1035 setOperationAction(ISD::BUILD_VECTOR, MVT::v2i64, Custom);
1036 setOperationAction(ISD::VECTOR_SHUFFLE, MVT::v2f64, Custom);
1037 setOperationAction(ISD::VECTOR_SHUFFLE, MVT::v2i64, Custom);
1038 setOperationAction(ISD::INSERT_VECTOR_ELT, MVT::v2f64, Custom);
1039 setOperationAction(ISD::EXTRACT_VECTOR_ELT, MVT::v2f64, Custom);
1041 if (Subtarget->is64Bit()) {
1042 setOperationAction(ISD::INSERT_VECTOR_ELT, MVT::v2i64, Custom);
1043 setOperationAction(ISD::EXTRACT_VECTOR_ELT, MVT::v2i64, Custom);
1046 // Promote v16i8, v8i16, v4i32 load, select, and, or, xor to v2i64.
1047 for (int i = MVT::v16i8; i != MVT::v2i64; ++i) {
1048 MVT VT = (MVT::SimpleValueType)i;
1050 // Do not attempt to promote non-128-bit vectors
1051 if (!VT.is128BitVector())
1054 setOperationAction(ISD::AND, VT, Promote);
1055 AddPromotedToType (ISD::AND, VT, MVT::v2i64);
1056 setOperationAction(ISD::OR, VT, Promote);
1057 AddPromotedToType (ISD::OR, VT, MVT::v2i64);
1058 setOperationAction(ISD::XOR, VT, Promote);
1059 AddPromotedToType (ISD::XOR, VT, MVT::v2i64);
1060 setOperationAction(ISD::LOAD, VT, Promote);
1061 AddPromotedToType (ISD::LOAD, VT, MVT::v2i64);
1062 setOperationAction(ISD::SELECT, VT, Promote);
1063 AddPromotedToType (ISD::SELECT, VT, MVT::v2i64);
1066 // Custom lower v2i64 and v2f64 selects.
1067 setOperationAction(ISD::LOAD, MVT::v2f64, Legal);
1068 setOperationAction(ISD::LOAD, MVT::v2i64, Legal);
1069 setOperationAction(ISD::SELECT, MVT::v2f64, Custom);
1070 setOperationAction(ISD::SELECT, MVT::v2i64, Custom);
1072 setOperationAction(ISD::FP_TO_SINT, MVT::v4i32, Legal);
1073 setOperationAction(ISD::SINT_TO_FP, MVT::v4i32, Legal);
1075 setOperationAction(ISD::UINT_TO_FP, MVT::v4i8, Custom);
1076 setOperationAction(ISD::UINT_TO_FP, MVT::v4i16, Custom);
1077 // As there is no 64-bit GPR available, we need build a special custom
1078 // sequence to convert from v2i32 to v2f32.
1079 if (!Subtarget->is64Bit())
1080 setOperationAction(ISD::UINT_TO_FP, MVT::v2f32, Custom);
1082 setOperationAction(ISD::FP_EXTEND, MVT::v2f32, Custom);
1083 setOperationAction(ISD::FP_ROUND, MVT::v2f32, Custom);
1085 setLoadExtAction(ISD::EXTLOAD, MVT::v2f32, Legal);
1087 setOperationAction(ISD::BITCAST, MVT::v2i32, Custom);
1088 setOperationAction(ISD::BITCAST, MVT::v4i16, Custom);
1089 setOperationAction(ISD::BITCAST, MVT::v8i8, Custom);
1092 if (!TM.Options.UseSoftFloat && Subtarget->hasSSE41()) {
1093 setOperationAction(ISD::FFLOOR, MVT::f32, Legal);
1094 setOperationAction(ISD::FCEIL, MVT::f32, Legal);
1095 setOperationAction(ISD::FTRUNC, MVT::f32, Legal);
1096 setOperationAction(ISD::FRINT, MVT::f32, Legal);
1097 setOperationAction(ISD::FNEARBYINT, MVT::f32, Legal);
1098 setOperationAction(ISD::FFLOOR, MVT::f64, Legal);
1099 setOperationAction(ISD::FCEIL, MVT::f64, Legal);
1100 setOperationAction(ISD::FTRUNC, MVT::f64, Legal);
1101 setOperationAction(ISD::FRINT, MVT::f64, Legal);
1102 setOperationAction(ISD::FNEARBYINT, MVT::f64, Legal);
1104 setOperationAction(ISD::FFLOOR, MVT::v4f32, Legal);
1105 setOperationAction(ISD::FCEIL, MVT::v4f32, Legal);
1106 setOperationAction(ISD::FTRUNC, MVT::v4f32, Legal);
1107 setOperationAction(ISD::FRINT, MVT::v4f32, Legal);
1108 setOperationAction(ISD::FNEARBYINT, MVT::v4f32, Legal);
1109 setOperationAction(ISD::FFLOOR, MVT::v2f64, Legal);
1110 setOperationAction(ISD::FCEIL, MVT::v2f64, Legal);
1111 setOperationAction(ISD::FTRUNC, MVT::v2f64, Legal);
1112 setOperationAction(ISD::FRINT, MVT::v2f64, Legal);
1113 setOperationAction(ISD::FNEARBYINT, MVT::v2f64, Legal);
1115 // FIXME: Do we need to handle scalar-to-vector here?
1116 setOperationAction(ISD::MUL, MVT::v4i32, Legal);
1118 setOperationAction(ISD::VSELECT, MVT::v2f64, Custom);
1119 setOperationAction(ISD::VSELECT, MVT::v2i64, Custom);
1120 setOperationAction(ISD::VSELECT, MVT::v4i32, Custom);
1121 setOperationAction(ISD::VSELECT, MVT::v4f32, Custom);
1122 setOperationAction(ISD::VSELECT, MVT::v8i16, Custom);
1123 // There is no BLENDI for byte vectors. We don't need to custom lower
1124 // some vselects for now.
1125 setOperationAction(ISD::VSELECT, MVT::v16i8, Legal);
1127 // SSE41 brings specific instructions for doing vector sign extend even in
1128 // cases where we don't have SRA.
1129 setLoadExtAction(ISD::SEXTLOAD, MVT::v2i8, Custom);
1130 setLoadExtAction(ISD::SEXTLOAD, MVT::v2i16, Custom);
1131 setLoadExtAction(ISD::SEXTLOAD, MVT::v2i32, Custom);
1133 // i8 and i16 vectors are custom because the source register and source
1134 // source memory operand types are not the same width. f32 vectors are
1135 // custom since the immediate controlling the insert encodes additional
1137 setOperationAction(ISD::INSERT_VECTOR_ELT, MVT::v16i8, Custom);
1138 setOperationAction(ISD::INSERT_VECTOR_ELT, MVT::v8i16, Custom);
1139 setOperationAction(ISD::INSERT_VECTOR_ELT, MVT::v4i32, Custom);
1140 setOperationAction(ISD::INSERT_VECTOR_ELT, MVT::v4f32, Custom);
1142 setOperationAction(ISD::EXTRACT_VECTOR_ELT, MVT::v16i8, Custom);
1143 setOperationAction(ISD::EXTRACT_VECTOR_ELT, MVT::v8i16, Custom);
1144 setOperationAction(ISD::EXTRACT_VECTOR_ELT, MVT::v4i32, Custom);
1145 setOperationAction(ISD::EXTRACT_VECTOR_ELT, MVT::v4f32, Custom);
1147 // FIXME: these should be Legal, but that's only for the case where
1148 // the index is constant. For now custom expand to deal with that.
1149 if (Subtarget->is64Bit()) {
1150 setOperationAction(ISD::INSERT_VECTOR_ELT, MVT::v2i64, Custom);
1151 setOperationAction(ISD::EXTRACT_VECTOR_ELT, MVT::v2i64, Custom);
1155 if (Subtarget->hasSSE2()) {
1156 setOperationAction(ISD::SRL, MVT::v8i16, Custom);
1157 setOperationAction(ISD::SRL, MVT::v16i8, Custom);
1159 setOperationAction(ISD::SHL, MVT::v8i16, Custom);
1160 setOperationAction(ISD::SHL, MVT::v16i8, Custom);
1162 setOperationAction(ISD::SRA, MVT::v8i16, Custom);
1163 setOperationAction(ISD::SRA, MVT::v16i8, Custom);
1165 // In the customized shift lowering, the legal cases in AVX2 will be
1167 setOperationAction(ISD::SRL, MVT::v2i64, Custom);
1168 setOperationAction(ISD::SRL, MVT::v4i32, Custom);
1170 setOperationAction(ISD::SHL, MVT::v2i64, Custom);
1171 setOperationAction(ISD::SHL, MVT::v4i32, Custom);
1173 setOperationAction(ISD::SRA, MVT::v4i32, Custom);
1176 if (!TM.Options.UseSoftFloat && Subtarget->hasFp256()) {
1177 addRegisterClass(MVT::v32i8, &X86::VR256RegClass);
1178 addRegisterClass(MVT::v16i16, &X86::VR256RegClass);
1179 addRegisterClass(MVT::v8i32, &X86::VR256RegClass);
1180 addRegisterClass(MVT::v8f32, &X86::VR256RegClass);
1181 addRegisterClass(MVT::v4i64, &X86::VR256RegClass);
1182 addRegisterClass(MVT::v4f64, &X86::VR256RegClass);
1184 setOperationAction(ISD::LOAD, MVT::v8f32, Legal);
1185 setOperationAction(ISD::LOAD, MVT::v4f64, Legal);
1186 setOperationAction(ISD::LOAD, MVT::v4i64, Legal);
1188 setOperationAction(ISD::FADD, MVT::v8f32, Legal);
1189 setOperationAction(ISD::FSUB, MVT::v8f32, Legal);
1190 setOperationAction(ISD::FMUL, MVT::v8f32, Legal);
1191 setOperationAction(ISD::FDIV, MVT::v8f32, Legal);
1192 setOperationAction(ISD::FSQRT, MVT::v8f32, Legal);
1193 setOperationAction(ISD::FFLOOR, MVT::v8f32, Legal);
1194 setOperationAction(ISD::FCEIL, MVT::v8f32, Legal);
1195 setOperationAction(ISD::FTRUNC, MVT::v8f32, Legal);
1196 setOperationAction(ISD::FRINT, MVT::v8f32, Legal);
1197 setOperationAction(ISD::FNEARBYINT, MVT::v8f32, Legal);
1198 setOperationAction(ISD::FNEG, MVT::v8f32, Custom);
1199 setOperationAction(ISD::FABS, MVT::v8f32, Custom);
1201 setOperationAction(ISD::FADD, MVT::v4f64, Legal);
1202 setOperationAction(ISD::FSUB, MVT::v4f64, Legal);
1203 setOperationAction(ISD::FMUL, MVT::v4f64, Legal);
1204 setOperationAction(ISD::FDIV, MVT::v4f64, Legal);
1205 setOperationAction(ISD::FSQRT, MVT::v4f64, Legal);
1206 setOperationAction(ISD::FFLOOR, MVT::v4f64, Legal);
1207 setOperationAction(ISD::FCEIL, MVT::v4f64, Legal);
1208 setOperationAction(ISD::FTRUNC, MVT::v4f64, Legal);
1209 setOperationAction(ISD::FRINT, MVT::v4f64, Legal);
1210 setOperationAction(ISD::FNEARBYINT, MVT::v4f64, Legal);
1211 setOperationAction(ISD::FNEG, MVT::v4f64, Custom);
1212 setOperationAction(ISD::FABS, MVT::v4f64, Custom);
1214 // (fp_to_int:v8i16 (v8f32 ..)) requires the result type to be promoted
1215 // even though v8i16 is a legal type.
1216 setOperationAction(ISD::FP_TO_SINT, MVT::v8i16, Promote);
1217 setOperationAction(ISD::FP_TO_UINT, MVT::v8i16, Promote);
1218 setOperationAction(ISD::FP_TO_SINT, MVT::v8i32, Legal);
1220 setOperationAction(ISD::SINT_TO_FP, MVT::v8i16, Promote);
1221 setOperationAction(ISD::SINT_TO_FP, MVT::v8i32, Legal);
1222 setOperationAction(ISD::FP_ROUND, MVT::v4f32, Legal);
1224 setOperationAction(ISD::UINT_TO_FP, MVT::v8i8, Custom);
1225 setOperationAction(ISD::UINT_TO_FP, MVT::v8i16, Custom);
1227 setLoadExtAction(ISD::EXTLOAD, MVT::v4f32, Legal);
1229 setOperationAction(ISD::SRL, MVT::v16i16, Custom);
1230 setOperationAction(ISD::SRL, MVT::v32i8, Custom);
1232 setOperationAction(ISD::SHL, MVT::v16i16, Custom);
1233 setOperationAction(ISD::SHL, MVT::v32i8, Custom);
1235 setOperationAction(ISD::SRA, MVT::v16i16, Custom);
1236 setOperationAction(ISD::SRA, MVT::v32i8, Custom);
1238 setOperationAction(ISD::SETCC, MVT::v32i8, Custom);
1239 setOperationAction(ISD::SETCC, MVT::v16i16, Custom);
1240 setOperationAction(ISD::SETCC, MVT::v8i32, Custom);
1241 setOperationAction(ISD::SETCC, MVT::v4i64, Custom);
1243 setOperationAction(ISD::SELECT, MVT::v4f64, Custom);
1244 setOperationAction(ISD::SELECT, MVT::v4i64, Custom);
1245 setOperationAction(ISD::SELECT, MVT::v8f32, Custom);
1247 setOperationAction(ISD::VSELECT, MVT::v4f64, Custom);
1248 setOperationAction(ISD::VSELECT, MVT::v4i64, Custom);
1249 setOperationAction(ISD::VSELECT, MVT::v8i32, Custom);
1250 setOperationAction(ISD::VSELECT, MVT::v8f32, Custom);
1252 setOperationAction(ISD::SIGN_EXTEND, MVT::v4i64, Custom);
1253 setOperationAction(ISD::SIGN_EXTEND, MVT::v8i32, Custom);
1254 setOperationAction(ISD::SIGN_EXTEND, MVT::v16i16, Custom);
1255 setOperationAction(ISD::ZERO_EXTEND, MVT::v4i64, Custom);
1256 setOperationAction(ISD::ZERO_EXTEND, MVT::v8i32, Custom);
1257 setOperationAction(ISD::ZERO_EXTEND, MVT::v16i16, Custom);
1258 setOperationAction(ISD::ANY_EXTEND, MVT::v4i64, Custom);
1259 setOperationAction(ISD::ANY_EXTEND, MVT::v8i32, Custom);
1260 setOperationAction(ISD::ANY_EXTEND, MVT::v16i16, Custom);
1261 setOperationAction(ISD::TRUNCATE, MVT::v16i8, Custom);
1262 setOperationAction(ISD::TRUNCATE, MVT::v8i16, Custom);
1263 setOperationAction(ISD::TRUNCATE, MVT::v4i32, Custom);
1265 if (Subtarget->hasFMA() || Subtarget->hasFMA4()) {
1266 setOperationAction(ISD::FMA, MVT::v8f32, Legal);
1267 setOperationAction(ISD::FMA, MVT::v4f64, Legal);
1268 setOperationAction(ISD::FMA, MVT::v4f32, Legal);
1269 setOperationAction(ISD::FMA, MVT::v2f64, Legal);
1270 setOperationAction(ISD::FMA, MVT::f32, Legal);
1271 setOperationAction(ISD::FMA, MVT::f64, Legal);
1274 if (Subtarget->hasInt256()) {
1275 setOperationAction(ISD::ADD, MVT::v4i64, Legal);
1276 setOperationAction(ISD::ADD, MVT::v8i32, Legal);
1277 setOperationAction(ISD::ADD, MVT::v16i16, Legal);
1278 setOperationAction(ISD::ADD, MVT::v32i8, Legal);
1280 setOperationAction(ISD::SUB, MVT::v4i64, Legal);
1281 setOperationAction(ISD::SUB, MVT::v8i32, Legal);
1282 setOperationAction(ISD::SUB, MVT::v16i16, Legal);
1283 setOperationAction(ISD::SUB, MVT::v32i8, Legal);
1285 setOperationAction(ISD::MUL, MVT::v4i64, Custom);
1286 setOperationAction(ISD::MUL, MVT::v8i32, Legal);
1287 setOperationAction(ISD::MUL, MVT::v16i16, Legal);
1288 // Don't lower v32i8 because there is no 128-bit byte mul
1290 setOperationAction(ISD::UMUL_LOHI, MVT::v8i32, Custom);
1291 setOperationAction(ISD::SMUL_LOHI, MVT::v8i32, Custom);
1292 setOperationAction(ISD::MULHU, MVT::v16i16, Legal);
1293 setOperationAction(ISD::MULHS, MVT::v16i16, Legal);
1295 setOperationAction(ISD::VSELECT, MVT::v16i16, Custom);
1296 setOperationAction(ISD::VSELECT, MVT::v32i8, Legal);
1298 // The custom lowering for UINT_TO_FP for v8i32 becomes interesting
1299 // when we have a 256bit-wide blend with immediate.
1300 setOperationAction(ISD::UINT_TO_FP, MVT::v8i32, Custom);
1302 setOperationAction(ISD::ADD, MVT::v4i64, Custom);
1303 setOperationAction(ISD::ADD, MVT::v8i32, Custom);
1304 setOperationAction(ISD::ADD, MVT::v16i16, Custom);
1305 setOperationAction(ISD::ADD, MVT::v32i8, Custom);
1307 setOperationAction(ISD::SUB, MVT::v4i64, Custom);
1308 setOperationAction(ISD::SUB, MVT::v8i32, Custom);
1309 setOperationAction(ISD::SUB, MVT::v16i16, Custom);
1310 setOperationAction(ISD::SUB, MVT::v32i8, Custom);
1312 setOperationAction(ISD::MUL, MVT::v4i64, Custom);
1313 setOperationAction(ISD::MUL, MVT::v8i32, Custom);
1314 setOperationAction(ISD::MUL, MVT::v16i16, Custom);
1315 // Don't lower v32i8 because there is no 128-bit byte mul
1318 // In the customized shift lowering, the legal cases in AVX2 will be
1320 setOperationAction(ISD::SRL, MVT::v4i64, Custom);
1321 setOperationAction(ISD::SRL, MVT::v8i32, Custom);
1323 setOperationAction(ISD::SHL, MVT::v4i64, Custom);
1324 setOperationAction(ISD::SHL, MVT::v8i32, Custom);
1326 setOperationAction(ISD::SRA, MVT::v8i32, Custom);
1328 // Custom lower several nodes for 256-bit types.
1329 for (int i = MVT::FIRST_VECTOR_VALUETYPE;
1330 i <= MVT::LAST_VECTOR_VALUETYPE; ++i) {
1331 MVT VT = (MVT::SimpleValueType)i;
1333 // Extract subvector is special because the value type
1334 // (result) is 128-bit but the source is 256-bit wide.
1335 if (VT.is128BitVector())
1336 setOperationAction(ISD::EXTRACT_SUBVECTOR, VT, Custom);
1338 // Do not attempt to custom lower other non-256-bit vectors
1339 if (!VT.is256BitVector())
1342 setOperationAction(ISD::BUILD_VECTOR, VT, Custom);
1343 setOperationAction(ISD::VECTOR_SHUFFLE, VT, Custom);
1344 setOperationAction(ISD::INSERT_VECTOR_ELT, VT, Custom);
1345 setOperationAction(ISD::EXTRACT_VECTOR_ELT, VT, Custom);
1346 setOperationAction(ISD::SCALAR_TO_VECTOR, VT, Custom);
1347 setOperationAction(ISD::INSERT_SUBVECTOR, VT, Custom);
1348 setOperationAction(ISD::CONCAT_VECTORS, VT, Custom);
1351 // Promote v32i8, v16i16, v8i32 select, and, or, xor to v4i64.
1352 for (int i = MVT::v32i8; i != MVT::v4i64; ++i) {
1353 MVT VT = (MVT::SimpleValueType)i;
1355 // Do not attempt to promote non-256-bit vectors
1356 if (!VT.is256BitVector())
1359 setOperationAction(ISD::AND, VT, Promote);
1360 AddPromotedToType (ISD::AND, VT, MVT::v4i64);
1361 setOperationAction(ISD::OR, VT, Promote);
1362 AddPromotedToType (ISD::OR, VT, MVT::v4i64);
1363 setOperationAction(ISD::XOR, VT, Promote);
1364 AddPromotedToType (ISD::XOR, VT, MVT::v4i64);
1365 setOperationAction(ISD::LOAD, VT, Promote);
1366 AddPromotedToType (ISD::LOAD, VT, MVT::v4i64);
1367 setOperationAction(ISD::SELECT, VT, Promote);
1368 AddPromotedToType (ISD::SELECT, VT, MVT::v4i64);
1372 if (!TM.Options.UseSoftFloat && Subtarget->hasAVX512()) {
1373 addRegisterClass(MVT::v16i32, &X86::VR512RegClass);
1374 addRegisterClass(MVT::v16f32, &X86::VR512RegClass);
1375 addRegisterClass(MVT::v8i64, &X86::VR512RegClass);
1376 addRegisterClass(MVT::v8f64, &X86::VR512RegClass);
1378 addRegisterClass(MVT::i1, &X86::VK1RegClass);
1379 addRegisterClass(MVT::v8i1, &X86::VK8RegClass);
1380 addRegisterClass(MVT::v16i1, &X86::VK16RegClass);
1382 setOperationAction(ISD::BR_CC, MVT::i1, Expand);
1383 setOperationAction(ISD::SETCC, MVT::i1, Custom);
1384 setOperationAction(ISD::XOR, MVT::i1, Legal);
1385 setOperationAction(ISD::OR, MVT::i1, Legal);
1386 setOperationAction(ISD::AND, MVT::i1, Legal);
1387 setLoadExtAction(ISD::EXTLOAD, MVT::v8f32, Legal);
1388 setOperationAction(ISD::LOAD, MVT::v16f32, Legal);
1389 setOperationAction(ISD::LOAD, MVT::v8f64, Legal);
1390 setOperationAction(ISD::LOAD, MVT::v8i64, Legal);
1391 setOperationAction(ISD::LOAD, MVT::v16i32, Legal);
1392 setOperationAction(ISD::LOAD, MVT::v16i1, Legal);
1394 setOperationAction(ISD::FADD, MVT::v16f32, Legal);
1395 setOperationAction(ISD::FSUB, MVT::v16f32, Legal);
1396 setOperationAction(ISD::FMUL, MVT::v16f32, Legal);
1397 setOperationAction(ISD::FDIV, MVT::v16f32, Legal);
1398 setOperationAction(ISD::FSQRT, MVT::v16f32, Legal);
1399 setOperationAction(ISD::FNEG, MVT::v16f32, Custom);
1401 setOperationAction(ISD::FADD, MVT::v8f64, Legal);
1402 setOperationAction(ISD::FSUB, MVT::v8f64, Legal);
1403 setOperationAction(ISD::FMUL, MVT::v8f64, Legal);
1404 setOperationAction(ISD::FDIV, MVT::v8f64, Legal);
1405 setOperationAction(ISD::FSQRT, MVT::v8f64, Legal);
1406 setOperationAction(ISD::FNEG, MVT::v8f64, Custom);
1407 setOperationAction(ISD::FMA, MVT::v8f64, Legal);
1408 setOperationAction(ISD::FMA, MVT::v16f32, Legal);
1410 setOperationAction(ISD::FP_TO_SINT, MVT::i32, Legal);
1411 setOperationAction(ISD::FP_TO_UINT, MVT::i32, Legal);
1412 setOperationAction(ISD::SINT_TO_FP, MVT::i32, Legal);
1413 setOperationAction(ISD::UINT_TO_FP, MVT::i32, Legal);
1414 if (Subtarget->is64Bit()) {
1415 setOperationAction(ISD::FP_TO_UINT, MVT::i64, Legal);
1416 setOperationAction(ISD::FP_TO_SINT, MVT::i64, Legal);
1417 setOperationAction(ISD::SINT_TO_FP, MVT::i64, Legal);
1418 setOperationAction(ISD::UINT_TO_FP, MVT::i64, Legal);
1420 setOperationAction(ISD::FP_TO_SINT, MVT::v16i32, Legal);
1421 setOperationAction(ISD::FP_TO_UINT, MVT::v16i32, Legal);
1422 setOperationAction(ISD::FP_TO_UINT, MVT::v8i32, Legal);
1423 setOperationAction(ISD::FP_TO_UINT, MVT::v4i32, Legal);
1424 setOperationAction(ISD::SINT_TO_FP, MVT::v16i32, Legal);
1425 setOperationAction(ISD::UINT_TO_FP, MVT::v16i32, Legal);
1426 setOperationAction(ISD::UINT_TO_FP, MVT::v8i32, Legal);
1427 setOperationAction(ISD::UINT_TO_FP, MVT::v4i32, Legal);
1428 setOperationAction(ISD::FP_ROUND, MVT::v8f32, Legal);
1429 setOperationAction(ISD::FP_EXTEND, MVT::v8f32, Legal);
1431 setOperationAction(ISD::TRUNCATE, MVT::i1, Custom);
1432 setOperationAction(ISD::TRUNCATE, MVT::v16i8, Custom);
1433 setOperationAction(ISD::TRUNCATE, MVT::v8i32, Custom);
1434 setOperationAction(ISD::TRUNCATE, MVT::v8i1, Custom);
1435 setOperationAction(ISD::TRUNCATE, MVT::v16i1, Custom);
1436 setOperationAction(ISD::TRUNCATE, MVT::v16i16, Custom);
1437 setOperationAction(ISD::ZERO_EXTEND, MVT::v16i32, Custom);
1438 setOperationAction(ISD::ZERO_EXTEND, MVT::v8i64, Custom);
1439 setOperationAction(ISD::SIGN_EXTEND, MVT::v16i32, Custom);
1440 setOperationAction(ISD::SIGN_EXTEND, MVT::v8i64, Custom);
1441 setOperationAction(ISD::SIGN_EXTEND, MVT::v16i8, Custom);
1442 setOperationAction(ISD::SIGN_EXTEND, MVT::v8i16, Custom);
1443 setOperationAction(ISD::SIGN_EXTEND, MVT::v16i16, Custom);
1445 setOperationAction(ISD::CONCAT_VECTORS, MVT::v8f64, Custom);
1446 setOperationAction(ISD::CONCAT_VECTORS, MVT::v8i64, Custom);
1447 setOperationAction(ISD::CONCAT_VECTORS, MVT::v16f32, Custom);
1448 setOperationAction(ISD::CONCAT_VECTORS, MVT::v16i32, Custom);
1449 setOperationAction(ISD::CONCAT_VECTORS, MVT::v8i1, Custom);
1450 setOperationAction(ISD::CONCAT_VECTORS, MVT::v16i1, Legal);
1452 setOperationAction(ISD::SETCC, MVT::v16i1, Custom);
1453 setOperationAction(ISD::SETCC, MVT::v8i1, Custom);
1455 setOperationAction(ISD::MUL, MVT::v8i64, Custom);
1457 setOperationAction(ISD::EXTRACT_VECTOR_ELT, MVT::v8i1, Custom);
1458 setOperationAction(ISD::EXTRACT_VECTOR_ELT, MVT::v16i1, Custom);
1459 setOperationAction(ISD::INSERT_VECTOR_ELT, MVT::v16i1, Custom);
1460 setOperationAction(ISD::INSERT_VECTOR_ELT, MVT::v8i1, Custom);
1461 setOperationAction(ISD::BUILD_VECTOR, MVT::v8i1, Custom);
1462 setOperationAction(ISD::BUILD_VECTOR, MVT::v16i1, Custom);
1463 setOperationAction(ISD::SELECT, MVT::v8f64, Custom);
1464 setOperationAction(ISD::SELECT, MVT::v8i64, Custom);
1465 setOperationAction(ISD::SELECT, MVT::v16f32, Custom);
1467 setOperationAction(ISD::ADD, MVT::v8i64, Legal);
1468 setOperationAction(ISD::ADD, MVT::v16i32, Legal);
1470 setOperationAction(ISD::SUB, MVT::v8i64, Legal);
1471 setOperationAction(ISD::SUB, MVT::v16i32, Legal);
1473 setOperationAction(ISD::MUL, MVT::v16i32, Legal);
1475 setOperationAction(ISD::SRL, MVT::v8i64, Custom);
1476 setOperationAction(ISD::SRL, MVT::v16i32, Custom);
1478 setOperationAction(ISD::SHL, MVT::v8i64, Custom);
1479 setOperationAction(ISD::SHL, MVT::v16i32, Custom);
1481 setOperationAction(ISD::SRA, MVT::v8i64, Custom);
1482 setOperationAction(ISD::SRA, MVT::v16i32, Custom);
1484 setOperationAction(ISD::AND, MVT::v8i64, Legal);
1485 setOperationAction(ISD::OR, MVT::v8i64, Legal);
1486 setOperationAction(ISD::XOR, MVT::v8i64, Legal);
1487 setOperationAction(ISD::AND, MVT::v16i32, Legal);
1488 setOperationAction(ISD::OR, MVT::v16i32, Legal);
1489 setOperationAction(ISD::XOR, MVT::v16i32, Legal);
1491 if (Subtarget->hasCDI()) {
1492 setOperationAction(ISD::CTLZ, MVT::v8i64, Legal);
1493 setOperationAction(ISD::CTLZ, MVT::v16i32, Legal);
1496 // Custom lower several nodes.
1497 for (int i = MVT::FIRST_VECTOR_VALUETYPE;
1498 i <= MVT::LAST_VECTOR_VALUETYPE; ++i) {
1499 MVT VT = (MVT::SimpleValueType)i;
1501 unsigned EltSize = VT.getVectorElementType().getSizeInBits();
1502 // Extract subvector is special because the value type
1503 // (result) is 256/128-bit but the source is 512-bit wide.
1504 if (VT.is128BitVector() || VT.is256BitVector())
1505 setOperationAction(ISD::EXTRACT_SUBVECTOR, VT, Custom);
1507 if (VT.getVectorElementType() == MVT::i1)
1508 setOperationAction(ISD::EXTRACT_SUBVECTOR, VT, Legal);
1510 // Do not attempt to custom lower other non-512-bit vectors
1511 if (!VT.is512BitVector())
1514 if ( EltSize >= 32) {
1515 setOperationAction(ISD::VECTOR_SHUFFLE, VT, Custom);
1516 setOperationAction(ISD::INSERT_VECTOR_ELT, VT, Custom);
1517 setOperationAction(ISD::BUILD_VECTOR, VT, Custom);
1518 setOperationAction(ISD::VSELECT, VT, Legal);
1519 setOperationAction(ISD::EXTRACT_VECTOR_ELT, VT, Custom);
1520 setOperationAction(ISD::SCALAR_TO_VECTOR, VT, Custom);
1521 setOperationAction(ISD::INSERT_SUBVECTOR, VT, Custom);
1524 for (int i = MVT::v32i8; i != MVT::v8i64; ++i) {
1525 MVT VT = (MVT::SimpleValueType)i;
1527 // Do not attempt to promote non-256-bit vectors
1528 if (!VT.is512BitVector())
1531 setOperationAction(ISD::SELECT, VT, Promote);
1532 AddPromotedToType (ISD::SELECT, VT, MVT::v8i64);
1536 if (!TM.Options.UseSoftFloat && Subtarget->hasBWI()) {
1537 addRegisterClass(MVT::v32i16, &X86::VR512RegClass);
1538 addRegisterClass(MVT::v64i8, &X86::VR512RegClass);
1540 addRegisterClass(MVT::v32i1, &X86::VK32RegClass);
1541 addRegisterClass(MVT::v64i1, &X86::VK64RegClass);
1543 setOperationAction(ISD::LOAD, MVT::v32i16, Legal);
1544 setOperationAction(ISD::LOAD, MVT::v64i8, Legal);
1545 setOperationAction(ISD::SETCC, MVT::v32i1, Custom);
1546 setOperationAction(ISD::SETCC, MVT::v64i1, Custom);
1548 for (int i = MVT::v32i8; i != MVT::v8i64; ++i) {
1549 const MVT VT = (MVT::SimpleValueType)i;
1551 const unsigned EltSize = VT.getVectorElementType().getSizeInBits();
1553 // Do not attempt to promote non-256-bit vectors
1554 if (!VT.is512BitVector())
1557 if ( EltSize < 32) {
1558 setOperationAction(ISD::BUILD_VECTOR, VT, Custom);
1559 setOperationAction(ISD::VSELECT, VT, Legal);
1564 if (!TM.Options.UseSoftFloat && Subtarget->hasVLX()) {
1565 addRegisterClass(MVT::v4i1, &X86::VK4RegClass);
1566 addRegisterClass(MVT::v2i1, &X86::VK2RegClass);
1568 setOperationAction(ISD::SETCC, MVT::v4i1, Custom);
1569 setOperationAction(ISD::SETCC, MVT::v2i1, Custom);
1570 setOperationAction(ISD::INSERT_SUBVECTOR, MVT::v8i1, Legal);
1573 // SIGN_EXTEND_INREGs are evaluated by the extend type. Handle the expansion
1574 // of this type with custom code.
1575 for (int VT = MVT::FIRST_VECTOR_VALUETYPE;
1576 VT != MVT::LAST_VECTOR_VALUETYPE; VT++) {
1577 setOperationAction(ISD::SIGN_EXTEND_INREG, (MVT::SimpleValueType)VT,
1581 // We want to custom lower some of our intrinsics.
1582 setOperationAction(ISD::INTRINSIC_WO_CHAIN, MVT::Other, Custom);
1583 setOperationAction(ISD::INTRINSIC_W_CHAIN, MVT::Other, Custom);
1584 setOperationAction(ISD::INTRINSIC_VOID, MVT::Other, Custom);
1585 if (!Subtarget->is64Bit())
1586 setOperationAction(ISD::INTRINSIC_W_CHAIN, MVT::i64, Custom);
1588 // Only custom-lower 64-bit SADDO and friends on 64-bit because we don't
1589 // handle type legalization for these operations here.
1591 // FIXME: We really should do custom legalization for addition and
1592 // subtraction on x86-32 once PR3203 is fixed. We really can't do much better
1593 // than generic legalization for 64-bit multiplication-with-overflow, though.
1594 for (unsigned i = 0, e = 3+Subtarget->is64Bit(); i != e; ++i) {
1595 // Add/Sub/Mul with overflow operations are custom lowered.
1597 setOperationAction(ISD::SADDO, VT, Custom);
1598 setOperationAction(ISD::UADDO, VT, Custom);
1599 setOperationAction(ISD::SSUBO, VT, Custom);
1600 setOperationAction(ISD::USUBO, VT, Custom);
1601 setOperationAction(ISD::SMULO, VT, Custom);
1602 setOperationAction(ISD::UMULO, VT, Custom);
1606 if (!Subtarget->is64Bit()) {
1607 // These libcalls are not available in 32-bit.
1608 setLibcallName(RTLIB::SHL_I128, nullptr);
1609 setLibcallName(RTLIB::SRL_I128, nullptr);
1610 setLibcallName(RTLIB::SRA_I128, nullptr);
1613 // Combine sin / cos into one node or libcall if possible.
1614 if (Subtarget->hasSinCos()) {
1615 setLibcallName(RTLIB::SINCOS_F32, "sincosf");
1616 setLibcallName(RTLIB::SINCOS_F64, "sincos");
1617 if (Subtarget->isTargetDarwin()) {
1618 // For MacOSX, we don't want to the normal expansion of a libcall to
1619 // sincos. We want to issue a libcall to __sincos_stret to avoid memory
1621 setOperationAction(ISD::FSINCOS, MVT::f64, Custom);
1622 setOperationAction(ISD::FSINCOS, MVT::f32, Custom);
1626 if (Subtarget->isTargetWin64()) {
1627 setOperationAction(ISD::SDIV, MVT::i128, Custom);
1628 setOperationAction(ISD::UDIV, MVT::i128, Custom);
1629 setOperationAction(ISD::SREM, MVT::i128, Custom);
1630 setOperationAction(ISD::UREM, MVT::i128, Custom);
1631 setOperationAction(ISD::SDIVREM, MVT::i128, Custom);
1632 setOperationAction(ISD::UDIVREM, MVT::i128, Custom);
1635 // We have target-specific dag combine patterns for the following nodes:
1636 setTargetDAGCombine(ISD::VECTOR_SHUFFLE);
1637 setTargetDAGCombine(ISD::EXTRACT_VECTOR_ELT);
1638 setTargetDAGCombine(ISD::VSELECT);
1639 setTargetDAGCombine(ISD::SELECT);
1640 setTargetDAGCombine(ISD::SHL);
1641 setTargetDAGCombine(ISD::SRA);
1642 setTargetDAGCombine(ISD::SRL);
1643 setTargetDAGCombine(ISD::OR);
1644 setTargetDAGCombine(ISD::AND);
1645 setTargetDAGCombine(ISD::ADD);
1646 setTargetDAGCombine(ISD::FADD);
1647 setTargetDAGCombine(ISD::FSUB);
1648 setTargetDAGCombine(ISD::FMA);
1649 setTargetDAGCombine(ISD::SUB);
1650 setTargetDAGCombine(ISD::LOAD);
1651 setTargetDAGCombine(ISD::STORE);
1652 setTargetDAGCombine(ISD::ZERO_EXTEND);
1653 setTargetDAGCombine(ISD::ANY_EXTEND);
1654 setTargetDAGCombine(ISD::SIGN_EXTEND);
1655 setTargetDAGCombine(ISD::SIGN_EXTEND_INREG);
1656 setTargetDAGCombine(ISD::TRUNCATE);
1657 setTargetDAGCombine(ISD::SINT_TO_FP);
1658 setTargetDAGCombine(ISD::SETCC);
1659 setTargetDAGCombine(ISD::INTRINSIC_WO_CHAIN);
1660 setTargetDAGCombine(ISD::BUILD_VECTOR);
1661 if (Subtarget->is64Bit())
1662 setTargetDAGCombine(ISD::MUL);
1663 setTargetDAGCombine(ISD::XOR);
1665 computeRegisterProperties();
1667 // On Darwin, -Os means optimize for size without hurting performance,
1668 // do not reduce the limit.
1669 MaxStoresPerMemset = 16; // For @llvm.memset -> sequence of stores
1670 MaxStoresPerMemsetOptSize = Subtarget->isTargetDarwin() ? 16 : 8;
1671 MaxStoresPerMemcpy = 8; // For @llvm.memcpy -> sequence of stores
1672 MaxStoresPerMemcpyOptSize = Subtarget->isTargetDarwin() ? 8 : 4;
1673 MaxStoresPerMemmove = 8; // For @llvm.memmove -> sequence of stores
1674 MaxStoresPerMemmoveOptSize = Subtarget->isTargetDarwin() ? 8 : 4;
1675 setPrefLoopAlignment(4); // 2^4 bytes.
1677 // Predictable cmov don't hurt on atom because it's in-order.
1678 PredictableSelectIsExpensive = !Subtarget->isAtom();
1680 setPrefFunctionAlignment(4); // 2^4 bytes.
1682 verifyIntrinsicTables();
1685 // This has so far only been implemented for 64-bit MachO.
1686 bool X86TargetLowering::useLoadStackGuardNode() const {
1687 return Subtarget->getTargetTriple().getObjectFormat() == Triple::MachO &&
1688 Subtarget->is64Bit();
1691 TargetLoweringBase::LegalizeTypeAction
1692 X86TargetLowering::getPreferredVectorAction(EVT VT) const {
1693 if (ExperimentalVectorWideningLegalization &&
1694 VT.getVectorNumElements() != 1 &&
1695 VT.getVectorElementType().getSimpleVT() != MVT::i1)
1696 return TypeWidenVector;
1698 return TargetLoweringBase::getPreferredVectorAction(VT);
1701 EVT X86TargetLowering::getSetCCResultType(LLVMContext &, EVT VT) const {
1703 return Subtarget->hasAVX512() ? MVT::i1: MVT::i8;
1705 const unsigned NumElts = VT.getVectorNumElements();
1706 const EVT EltVT = VT.getVectorElementType();
1707 if (VT.is512BitVector()) {
1708 if (Subtarget->hasAVX512())
1709 if (EltVT == MVT::i32 || EltVT == MVT::i64 ||
1710 EltVT == MVT::f32 || EltVT == MVT::f64)
1712 case 8: return MVT::v8i1;
1713 case 16: return MVT::v16i1;
1715 if (Subtarget->hasBWI())
1716 if (EltVT == MVT::i8 || EltVT == MVT::i16)
1718 case 32: return MVT::v32i1;
1719 case 64: return MVT::v64i1;
1723 if (VT.is256BitVector() || VT.is128BitVector()) {
1724 if (Subtarget->hasVLX())
1725 if (EltVT == MVT::i32 || EltVT == MVT::i64 ||
1726 EltVT == MVT::f32 || EltVT == MVT::f64)
1728 case 2: return MVT::v2i1;
1729 case 4: return MVT::v4i1;
1730 case 8: return MVT::v8i1;
1732 if (Subtarget->hasBWI() && Subtarget->hasVLX())
1733 if (EltVT == MVT::i8 || EltVT == MVT::i16)
1735 case 8: return MVT::v8i1;
1736 case 16: return MVT::v16i1;
1737 case 32: return MVT::v32i1;
1741 return VT.changeVectorElementTypeToInteger();
1744 /// getMaxByValAlign - Helper for getByValTypeAlignment to determine
1745 /// the desired ByVal argument alignment.
1746 static void getMaxByValAlign(Type *Ty, unsigned &MaxAlign) {
1749 if (VectorType *VTy = dyn_cast<VectorType>(Ty)) {
1750 if (VTy->getBitWidth() == 128)
1752 } else if (ArrayType *ATy = dyn_cast<ArrayType>(Ty)) {
1753 unsigned EltAlign = 0;
1754 getMaxByValAlign(ATy->getElementType(), EltAlign);
1755 if (EltAlign > MaxAlign)
1756 MaxAlign = EltAlign;
1757 } else if (StructType *STy = dyn_cast<StructType>(Ty)) {
1758 for (unsigned i = 0, e = STy->getNumElements(); i != e; ++i) {
1759 unsigned EltAlign = 0;
1760 getMaxByValAlign(STy->getElementType(i), EltAlign);
1761 if (EltAlign > MaxAlign)
1762 MaxAlign = EltAlign;
1769 /// getByValTypeAlignment - Return the desired alignment for ByVal aggregate
1770 /// function arguments in the caller parameter area. For X86, aggregates
1771 /// that contain SSE vectors are placed at 16-byte boundaries while the rest
1772 /// are at 4-byte boundaries.
1773 unsigned X86TargetLowering::getByValTypeAlignment(Type *Ty) const {
1774 if (Subtarget->is64Bit()) {
1775 // Max of 8 and alignment of type.
1776 unsigned TyAlign = TD->getABITypeAlignment(Ty);
1783 if (Subtarget->hasSSE1())
1784 getMaxByValAlign(Ty, Align);
1788 /// getOptimalMemOpType - Returns the target specific optimal type for load
1789 /// and store operations as a result of memset, memcpy, and memmove
1790 /// lowering. If DstAlign is zero that means it's safe to destination
1791 /// alignment can satisfy any constraint. Similarly if SrcAlign is zero it
1792 /// means there isn't a need to check it against alignment requirement,
1793 /// probably because the source does not need to be loaded. If 'IsMemset' is
1794 /// true, that means it's expanding a memset. If 'ZeroMemset' is true, that
1795 /// means it's a memset of zero. 'MemcpyStrSrc' indicates whether the memcpy
1796 /// source is constant so it does not need to be loaded.
1797 /// It returns EVT::Other if the type should be determined using generic
1798 /// target-independent logic.
1800 X86TargetLowering::getOptimalMemOpType(uint64_t Size,
1801 unsigned DstAlign, unsigned SrcAlign,
1802 bool IsMemset, bool ZeroMemset,
1804 MachineFunction &MF) const {
1805 const Function *F = MF.getFunction();
1806 if ((!IsMemset || ZeroMemset) &&
1807 !F->getAttributes().hasAttribute(AttributeSet::FunctionIndex,
1808 Attribute::NoImplicitFloat)) {
1810 (Subtarget->isUnalignedMemAccessFast() ||
1811 ((DstAlign == 0 || DstAlign >= 16) &&
1812 (SrcAlign == 0 || SrcAlign >= 16)))) {
1814 if (Subtarget->hasInt256())
1816 if (Subtarget->hasFp256())
1819 if (Subtarget->hasSSE2())
1821 if (Subtarget->hasSSE1())
1823 } else if (!MemcpyStrSrc && Size >= 8 &&
1824 !Subtarget->is64Bit() &&
1825 Subtarget->hasSSE2()) {
1826 // Do not use f64 to lower memcpy if source is string constant. It's
1827 // better to use i32 to avoid the loads.
1831 if (Subtarget->is64Bit() && Size >= 8)
1836 bool X86TargetLowering::isSafeMemOpType(MVT VT) const {
1838 return X86ScalarSSEf32;
1839 else if (VT == MVT::f64)
1840 return X86ScalarSSEf64;
1845 X86TargetLowering::allowsMisalignedMemoryAccesses(EVT VT,
1850 *Fast = Subtarget->isUnalignedMemAccessFast();
1854 /// getJumpTableEncoding - Return the entry encoding for a jump table in the
1855 /// current function. The returned value is a member of the
1856 /// MachineJumpTableInfo::JTEntryKind enum.
1857 unsigned X86TargetLowering::getJumpTableEncoding() const {
1858 // In GOT pic mode, each entry in the jump table is emitted as a @GOTOFF
1860 if (getTargetMachine().getRelocationModel() == Reloc::PIC_ &&
1861 Subtarget->isPICStyleGOT())
1862 return MachineJumpTableInfo::EK_Custom32;
1864 // Otherwise, use the normal jump table encoding heuristics.
1865 return TargetLowering::getJumpTableEncoding();
1869 X86TargetLowering::LowerCustomJumpTableEntry(const MachineJumpTableInfo *MJTI,
1870 const MachineBasicBlock *MBB,
1871 unsigned uid,MCContext &Ctx) const{
1872 assert(MBB->getParent()->getTarget().getRelocationModel() == Reloc::PIC_ &&
1873 Subtarget->isPICStyleGOT());
1874 // In 32-bit ELF systems, our jump table entries are formed with @GOTOFF
1876 return MCSymbolRefExpr::Create(MBB->getSymbol(),
1877 MCSymbolRefExpr::VK_GOTOFF, Ctx);
1880 /// getPICJumpTableRelocaBase - Returns relocation base for the given PIC
1882 SDValue X86TargetLowering::getPICJumpTableRelocBase(SDValue Table,
1883 SelectionDAG &DAG) const {
1884 if (!Subtarget->is64Bit())
1885 // This doesn't have SDLoc associated with it, but is not really the
1886 // same as a Register.
1887 return DAG.getNode(X86ISD::GlobalBaseReg, SDLoc(), getPointerTy());
1891 /// getPICJumpTableRelocBaseExpr - This returns the relocation base for the
1892 /// given PIC jumptable, the same as getPICJumpTableRelocBase, but as an
1894 const MCExpr *X86TargetLowering::
1895 getPICJumpTableRelocBaseExpr(const MachineFunction *MF, unsigned JTI,
1896 MCContext &Ctx) const {
1897 // X86-64 uses RIP relative addressing based on the jump table label.
1898 if (Subtarget->isPICStyleRIPRel())
1899 return TargetLowering::getPICJumpTableRelocBaseExpr(MF, JTI, Ctx);
1901 // Otherwise, the reference is relative to the PIC base.
1902 return MCSymbolRefExpr::Create(MF->getPICBaseSymbol(), Ctx);
1905 // FIXME: Why this routine is here? Move to RegInfo!
1906 std::pair<const TargetRegisterClass*, uint8_t>
1907 X86TargetLowering::findRepresentativeClass(MVT VT) const{
1908 const TargetRegisterClass *RRC = nullptr;
1910 switch (VT.SimpleTy) {
1912 return TargetLowering::findRepresentativeClass(VT);
1913 case MVT::i8: case MVT::i16: case MVT::i32: case MVT::i64:
1914 RRC = Subtarget->is64Bit() ? &X86::GR64RegClass : &X86::GR32RegClass;
1917 RRC = &X86::VR64RegClass;
1919 case MVT::f32: case MVT::f64:
1920 case MVT::v16i8: case MVT::v8i16: case MVT::v4i32: case MVT::v2i64:
1921 case MVT::v4f32: case MVT::v2f64:
1922 case MVT::v32i8: case MVT::v8i32: case MVT::v4i64: case MVT::v8f32:
1924 RRC = &X86::VR128RegClass;
1927 return std::make_pair(RRC, Cost);
1930 bool X86TargetLowering::getStackCookieLocation(unsigned &AddressSpace,
1931 unsigned &Offset) const {
1932 if (!Subtarget->isTargetLinux())
1935 if (Subtarget->is64Bit()) {
1936 // %fs:0x28, unless we're using a Kernel code model, in which case it's %gs:
1938 if (getTargetMachine().getCodeModel() == CodeModel::Kernel)
1950 bool X86TargetLowering::isNoopAddrSpaceCast(unsigned SrcAS,
1951 unsigned DestAS) const {
1952 assert(SrcAS != DestAS && "Expected different address spaces!");
1954 return SrcAS < 256 && DestAS < 256;
1957 //===----------------------------------------------------------------------===//
1958 // Return Value Calling Convention Implementation
1959 //===----------------------------------------------------------------------===//
1961 #include "X86GenCallingConv.inc"
1964 X86TargetLowering::CanLowerReturn(CallingConv::ID CallConv,
1965 MachineFunction &MF, bool isVarArg,
1966 const SmallVectorImpl<ISD::OutputArg> &Outs,
1967 LLVMContext &Context) const {
1968 SmallVector<CCValAssign, 16> RVLocs;
1969 CCState CCInfo(CallConv, isVarArg, MF, RVLocs, Context);
1970 return CCInfo.CheckReturn(Outs, RetCC_X86);
1973 const MCPhysReg *X86TargetLowering::getScratchRegisters(CallingConv::ID) const {
1974 static const MCPhysReg ScratchRegs[] = { X86::R11, 0 };
1979 X86TargetLowering::LowerReturn(SDValue Chain,
1980 CallingConv::ID CallConv, bool isVarArg,
1981 const SmallVectorImpl<ISD::OutputArg> &Outs,
1982 const SmallVectorImpl<SDValue> &OutVals,
1983 SDLoc dl, SelectionDAG &DAG) const {
1984 MachineFunction &MF = DAG.getMachineFunction();
1985 X86MachineFunctionInfo *FuncInfo = MF.getInfo<X86MachineFunctionInfo>();
1987 SmallVector<CCValAssign, 16> RVLocs;
1988 CCState CCInfo(CallConv, isVarArg, MF, RVLocs, *DAG.getContext());
1989 CCInfo.AnalyzeReturn(Outs, RetCC_X86);
1992 SmallVector<SDValue, 6> RetOps;
1993 RetOps.push_back(Chain); // Operand #0 = Chain (updated below)
1994 // Operand #1 = Bytes To Pop
1995 RetOps.push_back(DAG.getTargetConstant(FuncInfo->getBytesToPopOnReturn(),
1998 // Copy the result values into the output registers.
1999 for (unsigned i = 0; i != RVLocs.size(); ++i) {
2000 CCValAssign &VA = RVLocs[i];
2001 assert(VA.isRegLoc() && "Can only return in registers!");
2002 SDValue ValToCopy = OutVals[i];
2003 EVT ValVT = ValToCopy.getValueType();
2005 // Promote values to the appropriate types
2006 if (VA.getLocInfo() == CCValAssign::SExt)
2007 ValToCopy = DAG.getNode(ISD::SIGN_EXTEND, dl, VA.getLocVT(), ValToCopy);
2008 else if (VA.getLocInfo() == CCValAssign::ZExt)
2009 ValToCopy = DAG.getNode(ISD::ZERO_EXTEND, dl, VA.getLocVT(), ValToCopy);
2010 else if (VA.getLocInfo() == CCValAssign::AExt)
2011 ValToCopy = DAG.getNode(ISD::ANY_EXTEND, dl, VA.getLocVT(), ValToCopy);
2012 else if (VA.getLocInfo() == CCValAssign::BCvt)
2013 ValToCopy = DAG.getNode(ISD::BITCAST, dl, VA.getLocVT(), ValToCopy);
2015 assert(VA.getLocInfo() != CCValAssign::FPExt &&
2016 "Unexpected FP-extend for return value.");
2018 // If this is x86-64, and we disabled SSE, we can't return FP values,
2019 // or SSE or MMX vectors.
2020 if ((ValVT == MVT::f32 || ValVT == MVT::f64 ||
2021 VA.getLocReg() == X86::XMM0 || VA.getLocReg() == X86::XMM1) &&
2022 (Subtarget->is64Bit() && !Subtarget->hasSSE1())) {
2023 report_fatal_error("SSE register return with SSE disabled");
2025 // Likewise we can't return F64 values with SSE1 only. gcc does so, but
2026 // llvm-gcc has never done it right and no one has noticed, so this
2027 // should be OK for now.
2028 if (ValVT == MVT::f64 &&
2029 (Subtarget->is64Bit() && !Subtarget->hasSSE2()))
2030 report_fatal_error("SSE2 register return with SSE2 disabled");
2032 // Returns in ST0/ST1 are handled specially: these are pushed as operands to
2033 // the RET instruction and handled by the FP Stackifier.
2034 if (VA.getLocReg() == X86::FP0 ||
2035 VA.getLocReg() == X86::FP1) {
2036 // If this is a copy from an xmm register to ST(0), use an FPExtend to
2037 // change the value to the FP stack register class.
2038 if (isScalarFPTypeInSSEReg(VA.getValVT()))
2039 ValToCopy = DAG.getNode(ISD::FP_EXTEND, dl, MVT::f80, ValToCopy);
2040 RetOps.push_back(ValToCopy);
2041 // Don't emit a copytoreg.
2045 // 64-bit vector (MMX) values are returned in XMM0 / XMM1 except for v1i64
2046 // which is returned in RAX / RDX.
2047 if (Subtarget->is64Bit()) {
2048 if (ValVT == MVT::x86mmx) {
2049 if (VA.getLocReg() == X86::XMM0 || VA.getLocReg() == X86::XMM1) {
2050 ValToCopy = DAG.getNode(ISD::BITCAST, dl, MVT::i64, ValToCopy);
2051 ValToCopy = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, MVT::v2i64,
2053 // If we don't have SSE2 available, convert to v4f32 so the generated
2054 // register is legal.
2055 if (!Subtarget->hasSSE2())
2056 ValToCopy = DAG.getNode(ISD::BITCAST, dl, MVT::v4f32,ValToCopy);
2061 Chain = DAG.getCopyToReg(Chain, dl, VA.getLocReg(), ValToCopy, Flag);
2062 Flag = Chain.getValue(1);
2063 RetOps.push_back(DAG.getRegister(VA.getLocReg(), VA.getLocVT()));
2066 // The x86-64 ABIs require that for returning structs by value we copy
2067 // the sret argument into %rax/%eax (depending on ABI) for the return.
2068 // Win32 requires us to put the sret argument to %eax as well.
2069 // We saved the argument into a virtual register in the entry block,
2070 // so now we copy the value out and into %rax/%eax.
2071 if (DAG.getMachineFunction().getFunction()->hasStructRetAttr() &&
2072 (Subtarget->is64Bit() || Subtarget->isTargetKnownWindowsMSVC())) {
2073 MachineFunction &MF = DAG.getMachineFunction();
2074 X86MachineFunctionInfo *FuncInfo = MF.getInfo<X86MachineFunctionInfo>();
2075 unsigned Reg = FuncInfo->getSRetReturnReg();
2077 "SRetReturnReg should have been set in LowerFormalArguments().");
2078 SDValue Val = DAG.getCopyFromReg(Chain, dl, Reg, getPointerTy());
2081 = (Subtarget->is64Bit() && !Subtarget->isTarget64BitILP32()) ?
2082 X86::RAX : X86::EAX;
2083 Chain = DAG.getCopyToReg(Chain, dl, RetValReg, Val, Flag);
2084 Flag = Chain.getValue(1);
2086 // RAX/EAX now acts like a return value.
2087 RetOps.push_back(DAG.getRegister(RetValReg, getPointerTy()));
2090 RetOps[0] = Chain; // Update chain.
2092 // Add the flag if we have it.
2094 RetOps.push_back(Flag);
2096 return DAG.getNode(X86ISD::RET_FLAG, dl, MVT::Other, RetOps);
2099 bool X86TargetLowering::isUsedByReturnOnly(SDNode *N, SDValue &Chain) const {
2100 if (N->getNumValues() != 1)
2102 if (!N->hasNUsesOfValue(1, 0))
2105 SDValue TCChain = Chain;
2106 SDNode *Copy = *N->use_begin();
2107 if (Copy->getOpcode() == ISD::CopyToReg) {
2108 // If the copy has a glue operand, we conservatively assume it isn't safe to
2109 // perform a tail call.
2110 if (Copy->getOperand(Copy->getNumOperands()-1).getValueType() == MVT::Glue)
2112 TCChain = Copy->getOperand(0);
2113 } else if (Copy->getOpcode() != ISD::FP_EXTEND)
2116 bool HasRet = false;
2117 for (SDNode::use_iterator UI = Copy->use_begin(), UE = Copy->use_end();
2119 if (UI->getOpcode() != X86ISD::RET_FLAG)
2121 // If we are returning more than one value, we can definitely
2122 // not make a tail call see PR19530
2123 if (UI->getNumOperands() > 4)
2125 if (UI->getNumOperands() == 4 &&
2126 UI->getOperand(UI->getNumOperands()-1).getValueType() != MVT::Glue)
2139 X86TargetLowering::getTypeForExtArgOrReturn(LLVMContext &Context, EVT VT,
2140 ISD::NodeType ExtendKind) const {
2142 // TODO: Is this also valid on 32-bit?
2143 if (Subtarget->is64Bit() && VT == MVT::i1 && ExtendKind == ISD::ZERO_EXTEND)
2144 ReturnMVT = MVT::i8;
2146 ReturnMVT = MVT::i32;
2148 EVT MinVT = getRegisterType(Context, ReturnMVT);
2149 return VT.bitsLT(MinVT) ? MinVT : VT;
2152 /// LowerCallResult - Lower the result values of a call into the
2153 /// appropriate copies out of appropriate physical registers.
2156 X86TargetLowering::LowerCallResult(SDValue Chain, SDValue InFlag,
2157 CallingConv::ID CallConv, bool isVarArg,
2158 const SmallVectorImpl<ISD::InputArg> &Ins,
2159 SDLoc dl, SelectionDAG &DAG,
2160 SmallVectorImpl<SDValue> &InVals) const {
2162 // Assign locations to each value returned by this call.
2163 SmallVector<CCValAssign, 16> RVLocs;
2164 bool Is64Bit = Subtarget->is64Bit();
2165 CCState CCInfo(CallConv, isVarArg, DAG.getMachineFunction(), RVLocs,
2167 CCInfo.AnalyzeCallResult(Ins, RetCC_X86);
2169 // Copy all of the result registers out of their specified physreg.
2170 for (unsigned i = 0, e = RVLocs.size(); i != e; ++i) {
2171 CCValAssign &VA = RVLocs[i];
2172 EVT CopyVT = VA.getValVT();
2174 // If this is x86-64, and we disabled SSE, we can't return FP values
2175 if ((CopyVT == MVT::f32 || CopyVT == MVT::f64) &&
2176 ((Is64Bit || Ins[i].Flags.isInReg()) && !Subtarget->hasSSE1())) {
2177 report_fatal_error("SSE register return with SSE disabled");
2180 // If we prefer to use the value in xmm registers, copy it out as f80 and
2181 // use a truncate to move it from fp stack reg to xmm reg.
2182 if ((VA.getLocReg() == X86::FP0 || VA.getLocReg() == X86::FP1) &&
2183 isScalarFPTypeInSSEReg(VA.getValVT()))
2186 Chain = DAG.getCopyFromReg(Chain, dl, VA.getLocReg(),
2187 CopyVT, InFlag).getValue(1);
2188 SDValue Val = Chain.getValue(0);
2190 if (CopyVT != VA.getValVT())
2191 Val = DAG.getNode(ISD::FP_ROUND, dl, VA.getValVT(), Val,
2192 // This truncation won't change the value.
2193 DAG.getIntPtrConstant(1));
2195 InFlag = Chain.getValue(2);
2196 InVals.push_back(Val);
2202 //===----------------------------------------------------------------------===//
2203 // C & StdCall & Fast Calling Convention implementation
2204 //===----------------------------------------------------------------------===//
2205 // StdCall calling convention seems to be standard for many Windows' API
2206 // routines and around. It differs from C calling convention just a little:
2207 // callee should clean up the stack, not caller. Symbols should be also
2208 // decorated in some fancy way :) It doesn't support any vector arguments.
2209 // For info on fast calling convention see Fast Calling Convention (tail call)
2210 // implementation LowerX86_32FastCCCallTo.
2212 /// CallIsStructReturn - Determines whether a call uses struct return
2214 enum StructReturnType {
2219 static StructReturnType
2220 callIsStructReturn(const SmallVectorImpl<ISD::OutputArg> &Outs) {
2222 return NotStructReturn;
2224 const ISD::ArgFlagsTy &Flags = Outs[0].Flags;
2225 if (!Flags.isSRet())
2226 return NotStructReturn;
2227 if (Flags.isInReg())
2228 return RegStructReturn;
2229 return StackStructReturn;
2232 /// ArgsAreStructReturn - Determines whether a function uses struct
2233 /// return semantics.
2234 static StructReturnType
2235 argsAreStructReturn(const SmallVectorImpl<ISD::InputArg> &Ins) {
2237 return NotStructReturn;
2239 const ISD::ArgFlagsTy &Flags = Ins[0].Flags;
2240 if (!Flags.isSRet())
2241 return NotStructReturn;
2242 if (Flags.isInReg())
2243 return RegStructReturn;
2244 return StackStructReturn;
2247 /// CreateCopyOfByValArgument - Make a copy of an aggregate at address specified
2248 /// by "Src" to address "Dst" with size and alignment information specified by
2249 /// the specific parameter attribute. The copy will be passed as a byval
2250 /// function parameter.
2252 CreateCopyOfByValArgument(SDValue Src, SDValue Dst, SDValue Chain,
2253 ISD::ArgFlagsTy Flags, SelectionDAG &DAG,
2255 SDValue SizeNode = DAG.getConstant(Flags.getByValSize(), MVT::i32);
2257 return DAG.getMemcpy(Chain, dl, Dst, Src, SizeNode, Flags.getByValAlign(),
2258 /*isVolatile*/false, /*AlwaysInline=*/true,
2259 MachinePointerInfo(), MachinePointerInfo());
2262 /// IsTailCallConvention - Return true if the calling convention is one that
2263 /// supports tail call optimization.
2264 static bool IsTailCallConvention(CallingConv::ID CC) {
2265 return (CC == CallingConv::Fast || CC == CallingConv::GHC ||
2266 CC == CallingConv::HiPE);
2269 /// \brief Return true if the calling convention is a C calling convention.
2270 static bool IsCCallConvention(CallingConv::ID CC) {
2271 return (CC == CallingConv::C || CC == CallingConv::X86_64_Win64 ||
2272 CC == CallingConv::X86_64_SysV);
2275 bool X86TargetLowering::mayBeEmittedAsTailCall(CallInst *CI) const {
2276 if (!CI->isTailCall() || getTargetMachine().Options.DisableTailCalls)
2280 CallingConv::ID CalleeCC = CS.getCallingConv();
2281 if (!IsTailCallConvention(CalleeCC) && !IsCCallConvention(CalleeCC))
2287 /// FuncIsMadeTailCallSafe - Return true if the function is being made into
2288 /// a tailcall target by changing its ABI.
2289 static bool FuncIsMadeTailCallSafe(CallingConv::ID CC,
2290 bool GuaranteedTailCallOpt) {
2291 return GuaranteedTailCallOpt && IsTailCallConvention(CC);
2295 X86TargetLowering::LowerMemArgument(SDValue Chain,
2296 CallingConv::ID CallConv,
2297 const SmallVectorImpl<ISD::InputArg> &Ins,
2298 SDLoc dl, SelectionDAG &DAG,
2299 const CCValAssign &VA,
2300 MachineFrameInfo *MFI,
2302 // Create the nodes corresponding to a load from this parameter slot.
2303 ISD::ArgFlagsTy Flags = Ins[i].Flags;
2304 bool AlwaysUseMutable = FuncIsMadeTailCallSafe(
2305 CallConv, DAG.getTarget().Options.GuaranteedTailCallOpt);
2306 bool isImmutable = !AlwaysUseMutable && !Flags.isByVal();
2309 // If value is passed by pointer we have address passed instead of the value
2311 if (VA.getLocInfo() == CCValAssign::Indirect)
2312 ValVT = VA.getLocVT();
2314 ValVT = VA.getValVT();
2316 // FIXME: For now, all byval parameter objects are marked mutable. This can be
2317 // changed with more analysis.
2318 // In case of tail call optimization mark all arguments mutable. Since they
2319 // could be overwritten by lowering of arguments in case of a tail call.
2320 if (Flags.isByVal()) {
2321 unsigned Bytes = Flags.getByValSize();
2322 if (Bytes == 0) Bytes = 1; // Don't create zero-sized stack objects.
2323 int FI = MFI->CreateFixedObject(Bytes, VA.getLocMemOffset(), isImmutable);
2324 return DAG.getFrameIndex(FI, getPointerTy());
2326 int FI = MFI->CreateFixedObject(ValVT.getSizeInBits()/8,
2327 VA.getLocMemOffset(), isImmutable);
2328 SDValue FIN = DAG.getFrameIndex(FI, getPointerTy());
2329 return DAG.getLoad(ValVT, dl, Chain, FIN,
2330 MachinePointerInfo::getFixedStack(FI),
2331 false, false, false, 0);
2335 // FIXME: Get this from tablegen.
2336 static ArrayRef<MCPhysReg> get64BitArgumentGPRs(CallingConv::ID CallConv,
2337 const X86Subtarget *Subtarget) {
2338 assert(Subtarget->is64Bit());
2340 if (Subtarget->isCallingConvWin64(CallConv)) {
2341 static const MCPhysReg GPR64ArgRegsWin64[] = {
2342 X86::RCX, X86::RDX, X86::R8, X86::R9
2344 return makeArrayRef(std::begin(GPR64ArgRegsWin64), std::end(GPR64ArgRegsWin64));
2347 static const MCPhysReg GPR64ArgRegs64Bit[] = {
2348 X86::RDI, X86::RSI, X86::RDX, X86::RCX, X86::R8, X86::R9
2350 return makeArrayRef(std::begin(GPR64ArgRegs64Bit), std::end(GPR64ArgRegs64Bit));
2353 // FIXME: Get this from tablegen.
2354 static ArrayRef<MCPhysReg> get64BitArgumentXMMs(MachineFunction &MF,
2355 CallingConv::ID CallConv,
2356 const X86Subtarget *Subtarget) {
2357 assert(Subtarget->is64Bit());
2358 if (Subtarget->isCallingConvWin64(CallConv)) {
2359 // The XMM registers which might contain var arg parameters are shadowed
2360 // in their paired GPR. So we only need to save the GPR to their home
2362 // TODO: __vectorcall will change this.
2366 const Function *Fn = MF.getFunction();
2367 bool NoImplicitFloatOps = Fn->getAttributes().
2368 hasAttribute(AttributeSet::FunctionIndex, Attribute::NoImplicitFloat);
2369 assert(!(MF.getTarget().Options.UseSoftFloat && NoImplicitFloatOps) &&
2370 "SSE register cannot be used when SSE is disabled!");
2371 if (MF.getTarget().Options.UseSoftFloat || NoImplicitFloatOps ||
2372 !Subtarget->hasSSE1())
2373 // Kernel mode asks for SSE to be disabled, so there are no XMM argument
2377 static const MCPhysReg XMMArgRegs64Bit[] = {
2378 X86::XMM0, X86::XMM1, X86::XMM2, X86::XMM3,
2379 X86::XMM4, X86::XMM5, X86::XMM6, X86::XMM7
2381 return makeArrayRef(std::begin(XMMArgRegs64Bit), std::end(XMMArgRegs64Bit));
2385 X86TargetLowering::LowerFormalArguments(SDValue Chain,
2386 CallingConv::ID CallConv,
2388 const SmallVectorImpl<ISD::InputArg> &Ins,
2391 SmallVectorImpl<SDValue> &InVals)
2393 MachineFunction &MF = DAG.getMachineFunction();
2394 X86MachineFunctionInfo *FuncInfo = MF.getInfo<X86MachineFunctionInfo>();
2396 const Function* Fn = MF.getFunction();
2397 if (Fn->hasExternalLinkage() &&
2398 Subtarget->isTargetCygMing() &&
2399 Fn->getName() == "main")
2400 FuncInfo->setForceFramePointer(true);
2402 MachineFrameInfo *MFI = MF.getFrameInfo();
2403 bool Is64Bit = Subtarget->is64Bit();
2404 bool IsWin64 = Subtarget->isCallingConvWin64(CallConv);
2406 assert(!(isVarArg && IsTailCallConvention(CallConv)) &&
2407 "Var args not supported with calling convention fastcc, ghc or hipe");
2409 // Assign locations to all of the incoming arguments.
2410 SmallVector<CCValAssign, 16> ArgLocs;
2411 CCState CCInfo(CallConv, isVarArg, MF, ArgLocs, *DAG.getContext());
2413 // Allocate shadow area for Win64
2415 CCInfo.AllocateStack(32, 8);
2417 CCInfo.AnalyzeFormalArguments(Ins, CC_X86);
2419 unsigned LastVal = ~0U;
2421 for (unsigned i = 0, e = ArgLocs.size(); i != e; ++i) {
2422 CCValAssign &VA = ArgLocs[i];
2423 // TODO: If an arg is passed in two places (e.g. reg and stack), skip later
2425 assert(VA.getValNo() != LastVal &&
2426 "Don't support value assigned to multiple locs yet");
2428 LastVal = VA.getValNo();
2430 if (VA.isRegLoc()) {
2431 EVT RegVT = VA.getLocVT();
2432 const TargetRegisterClass *RC;
2433 if (RegVT == MVT::i32)
2434 RC = &X86::GR32RegClass;
2435 else if (Is64Bit && RegVT == MVT::i64)
2436 RC = &X86::GR64RegClass;
2437 else if (RegVT == MVT::f32)
2438 RC = &X86::FR32RegClass;
2439 else if (RegVT == MVT::f64)
2440 RC = &X86::FR64RegClass;
2441 else if (RegVT.is512BitVector())
2442 RC = &X86::VR512RegClass;
2443 else if (RegVT.is256BitVector())
2444 RC = &X86::VR256RegClass;
2445 else if (RegVT.is128BitVector())
2446 RC = &X86::VR128RegClass;
2447 else if (RegVT == MVT::x86mmx)
2448 RC = &X86::VR64RegClass;
2449 else if (RegVT == MVT::i1)
2450 RC = &X86::VK1RegClass;
2451 else if (RegVT == MVT::v8i1)
2452 RC = &X86::VK8RegClass;
2453 else if (RegVT == MVT::v16i1)
2454 RC = &X86::VK16RegClass;
2455 else if (RegVT == MVT::v32i1)
2456 RC = &X86::VK32RegClass;
2457 else if (RegVT == MVT::v64i1)
2458 RC = &X86::VK64RegClass;
2460 llvm_unreachable("Unknown argument type!");
2462 unsigned Reg = MF.addLiveIn(VA.getLocReg(), RC);
2463 ArgValue = DAG.getCopyFromReg(Chain, dl, Reg, RegVT);
2465 // If this is an 8 or 16-bit value, it is really passed promoted to 32
2466 // bits. Insert an assert[sz]ext to capture this, then truncate to the
2468 if (VA.getLocInfo() == CCValAssign::SExt)
2469 ArgValue = DAG.getNode(ISD::AssertSext, dl, RegVT, ArgValue,
2470 DAG.getValueType(VA.getValVT()));
2471 else if (VA.getLocInfo() == CCValAssign::ZExt)
2472 ArgValue = DAG.getNode(ISD::AssertZext, dl, RegVT, ArgValue,
2473 DAG.getValueType(VA.getValVT()));
2474 else if (VA.getLocInfo() == CCValAssign::BCvt)
2475 ArgValue = DAG.getNode(ISD::BITCAST, dl, VA.getValVT(), ArgValue);
2477 if (VA.isExtInLoc()) {
2478 // Handle MMX values passed in XMM regs.
2479 if (RegVT.isVector())
2480 ArgValue = DAG.getNode(X86ISD::MOVDQ2Q, dl, VA.getValVT(), ArgValue);
2482 ArgValue = DAG.getNode(ISD::TRUNCATE, dl, VA.getValVT(), ArgValue);
2485 assert(VA.isMemLoc());
2486 ArgValue = LowerMemArgument(Chain, CallConv, Ins, dl, DAG, VA, MFI, i);
2489 // If value is passed via pointer - do a load.
2490 if (VA.getLocInfo() == CCValAssign::Indirect)
2491 ArgValue = DAG.getLoad(VA.getValVT(), dl, Chain, ArgValue,
2492 MachinePointerInfo(), false, false, false, 0);
2494 InVals.push_back(ArgValue);
2497 if (Subtarget->is64Bit() || Subtarget->isTargetKnownWindowsMSVC()) {
2498 for (unsigned i = 0, e = ArgLocs.size(); i != e; ++i) {
2499 // The x86-64 ABIs require that for returning structs by value we copy
2500 // the sret argument into %rax/%eax (depending on ABI) for the return.
2501 // Win32 requires us to put the sret argument to %eax as well.
2502 // Save the argument into a virtual register so that we can access it
2503 // from the return points.
2504 if (Ins[i].Flags.isSRet()) {
2505 unsigned Reg = FuncInfo->getSRetReturnReg();
2507 MVT PtrTy = getPointerTy();
2508 Reg = MF.getRegInfo().createVirtualRegister(getRegClassFor(PtrTy));
2509 FuncInfo->setSRetReturnReg(Reg);
2511 SDValue Copy = DAG.getCopyToReg(DAG.getEntryNode(), dl, Reg, InVals[i]);
2512 Chain = DAG.getNode(ISD::TokenFactor, dl, MVT::Other, Copy, Chain);
2518 unsigned StackSize = CCInfo.getNextStackOffset();
2519 // Align stack specially for tail calls.
2520 if (FuncIsMadeTailCallSafe(CallConv,
2521 MF.getTarget().Options.GuaranteedTailCallOpt))
2522 StackSize = GetAlignedArgumentStackSize(StackSize, DAG);
2524 // If the function takes variable number of arguments, make a frame index for
2525 // the start of the first vararg value... for expansion of llvm.va_start. We
2526 // can skip this if there are no va_start calls.
2527 if (MFI->hasVAStart() &&
2528 (Is64Bit || (CallConv != CallingConv::X86_FastCall &&
2529 CallConv != CallingConv::X86_ThisCall))) {
2530 FuncInfo->setVarArgsFrameIndex(
2531 MFI->CreateFixedObject(1, StackSize, true));
2534 // 64-bit calling conventions support varargs and register parameters, so we
2535 // have to do extra work to spill them in the prologue or forward them to
2537 if (Is64Bit && isVarArg &&
2538 (MFI->hasVAStart() || MFI->hasMustTailInVarArgFunc())) {
2539 // Find the first unallocated argument registers.
2540 ArrayRef<MCPhysReg> ArgGPRs = get64BitArgumentGPRs(CallConv, Subtarget);
2541 ArrayRef<MCPhysReg> ArgXMMs = get64BitArgumentXMMs(MF, CallConv, Subtarget);
2542 unsigned NumIntRegs =
2543 CCInfo.getFirstUnallocated(ArgGPRs.data(), ArgGPRs.size());
2544 unsigned NumXMMRegs =
2545 CCInfo.getFirstUnallocated(ArgXMMs.data(), ArgXMMs.size());
2546 assert(!(NumXMMRegs && !Subtarget->hasSSE1()) &&
2547 "SSE register cannot be used when SSE is disabled!");
2549 // Gather all the live in physical registers.
2550 SmallVector<SDValue, 6> LiveGPRs;
2551 SmallVector<SDValue, 8> LiveXMMRegs;
2553 for (MCPhysReg Reg : ArgGPRs.slice(NumIntRegs)) {
2554 unsigned GPR = MF.addLiveIn(Reg, &X86::GR64RegClass);
2556 DAG.getCopyFromReg(Chain, dl, GPR, MVT::i64));
2558 if (!ArgXMMs.empty()) {
2559 unsigned AL = MF.addLiveIn(X86::AL, &X86::GR8RegClass);
2560 ALVal = DAG.getCopyFromReg(Chain, dl, AL, MVT::i8);
2561 for (MCPhysReg Reg : ArgXMMs.slice(NumXMMRegs)) {
2562 unsigned XMMReg = MF.addLiveIn(Reg, &X86::VR128RegClass);
2563 LiveXMMRegs.push_back(
2564 DAG.getCopyFromReg(Chain, dl, XMMReg, MVT::v4f32));
2568 // Store them to the va_list returned by va_start.
2569 if (MFI->hasVAStart()) {
2571 const TargetFrameLowering &TFI = *MF.getSubtarget().getFrameLowering();
2572 // Get to the caller-allocated home save location. Add 8 to account
2573 // for the return address.
2574 int HomeOffset = TFI.getOffsetOfLocalArea() + 8;
2575 FuncInfo->setRegSaveFrameIndex(
2576 MFI->CreateFixedObject(1, NumIntRegs * 8 + HomeOffset, false));
2577 // Fixup to set vararg frame on shadow area (4 x i64).
2579 FuncInfo->setVarArgsFrameIndex(FuncInfo->getRegSaveFrameIndex());
2581 // For X86-64, if there are vararg parameters that are passed via
2582 // registers, then we must store them to their spots on the stack so
2583 // they may be loaded by deferencing the result of va_next.
2584 FuncInfo->setVarArgsGPOffset(NumIntRegs * 8);
2585 FuncInfo->setVarArgsFPOffset(ArgGPRs.size() * 8 + NumXMMRegs * 16);
2586 FuncInfo->setRegSaveFrameIndex(MFI->CreateStackObject(
2587 ArgGPRs.size() * 8 + ArgXMMs.size() * 16, 16, false));
2590 // Store the integer parameter registers.
2591 SmallVector<SDValue, 8> MemOps;
2592 SDValue RSFIN = DAG.getFrameIndex(FuncInfo->getRegSaveFrameIndex(),
2594 unsigned Offset = FuncInfo->getVarArgsGPOffset();
2595 for (SDValue Val : LiveGPRs) {
2596 SDValue FIN = DAG.getNode(ISD::ADD, dl, getPointerTy(), RSFIN,
2597 DAG.getIntPtrConstant(Offset));
2599 DAG.getStore(Val.getValue(1), dl, Val, FIN,
2600 MachinePointerInfo::getFixedStack(
2601 FuncInfo->getRegSaveFrameIndex(), Offset),
2603 MemOps.push_back(Store);
2607 if (!ArgXMMs.empty() && NumXMMRegs != ArgXMMs.size()) {
2608 // Now store the XMM (fp + vector) parameter registers.
2609 SmallVector<SDValue, 12> SaveXMMOps;
2610 SaveXMMOps.push_back(Chain);
2611 SaveXMMOps.push_back(ALVal);
2612 SaveXMMOps.push_back(DAG.getIntPtrConstant(
2613 FuncInfo->getRegSaveFrameIndex()));
2614 SaveXMMOps.push_back(DAG.getIntPtrConstant(
2615 FuncInfo->getVarArgsFPOffset()));
2616 SaveXMMOps.insert(SaveXMMOps.end(), LiveXMMRegs.begin(),
2618 MemOps.push_back(DAG.getNode(X86ISD::VASTART_SAVE_XMM_REGS, dl,
2619 MVT::Other, SaveXMMOps));
2622 if (!MemOps.empty())
2623 Chain = DAG.getNode(ISD::TokenFactor, dl, MVT::Other, MemOps);
2625 // Add all GPRs, al, and XMMs to the list of forwards. We will add then
2626 // to the liveout set on a musttail call.
2627 assert(MFI->hasMustTailInVarArgFunc());
2628 auto &Forwards = FuncInfo->getForwardedMustTailRegParms();
2629 typedef X86MachineFunctionInfo::Forward Forward;
2631 for (unsigned I = 0, E = LiveGPRs.size(); I != E; ++I) {
2633 MF.getRegInfo().createVirtualRegister(&X86::GR64RegClass);
2634 Chain = DAG.getCopyToReg(Chain, dl, VReg, LiveGPRs[I]);
2635 Forwards.push_back(Forward(VReg, ArgGPRs[NumIntRegs + I], MVT::i64));
2638 if (!ArgXMMs.empty()) {
2640 MF.getRegInfo().createVirtualRegister(&X86::GR8RegClass);
2641 Chain = DAG.getCopyToReg(Chain, dl, ALVReg, ALVal);
2642 Forwards.push_back(Forward(ALVReg, X86::AL, MVT::i8));
2644 for (unsigned I = 0, E = LiveXMMRegs.size(); I != E; ++I) {
2646 MF.getRegInfo().createVirtualRegister(&X86::VR128RegClass);
2647 Chain = DAG.getCopyToReg(Chain, dl, VReg, LiveXMMRegs[I]);
2649 Forward(VReg, ArgXMMs[NumXMMRegs + I], MVT::v4f32));
2655 // Some CCs need callee pop.
2656 if (X86::isCalleePop(CallConv, Is64Bit, isVarArg,
2657 MF.getTarget().Options.GuaranteedTailCallOpt)) {
2658 FuncInfo->setBytesToPopOnReturn(StackSize); // Callee pops everything.
2660 FuncInfo->setBytesToPopOnReturn(0); // Callee pops nothing.
2661 // If this is an sret function, the return should pop the hidden pointer.
2662 if (!Is64Bit && !IsTailCallConvention(CallConv) &&
2663 !Subtarget->getTargetTriple().isOSMSVCRT() &&
2664 argsAreStructReturn(Ins) == StackStructReturn)
2665 FuncInfo->setBytesToPopOnReturn(4);
2669 // RegSaveFrameIndex is X86-64 only.
2670 FuncInfo->setRegSaveFrameIndex(0xAAAAAAA);
2671 if (CallConv == CallingConv::X86_FastCall ||
2672 CallConv == CallingConv::X86_ThisCall)
2673 // fastcc functions can't have varargs.
2674 FuncInfo->setVarArgsFrameIndex(0xAAAAAAA);
2677 FuncInfo->setArgumentStackSize(StackSize);
2683 X86TargetLowering::LowerMemOpCallTo(SDValue Chain,
2684 SDValue StackPtr, SDValue Arg,
2685 SDLoc dl, SelectionDAG &DAG,
2686 const CCValAssign &VA,
2687 ISD::ArgFlagsTy Flags) const {
2688 unsigned LocMemOffset = VA.getLocMemOffset();
2689 SDValue PtrOff = DAG.getIntPtrConstant(LocMemOffset);
2690 PtrOff = DAG.getNode(ISD::ADD, dl, getPointerTy(), StackPtr, PtrOff);
2691 if (Flags.isByVal())
2692 return CreateCopyOfByValArgument(Arg, PtrOff, Chain, Flags, DAG, dl);
2694 return DAG.getStore(Chain, dl, Arg, PtrOff,
2695 MachinePointerInfo::getStack(LocMemOffset),
2699 /// EmitTailCallLoadRetAddr - Emit a load of return address if tail call
2700 /// optimization is performed and it is required.
2702 X86TargetLowering::EmitTailCallLoadRetAddr(SelectionDAG &DAG,
2703 SDValue &OutRetAddr, SDValue Chain,
2704 bool IsTailCall, bool Is64Bit,
2705 int FPDiff, SDLoc dl) const {
2706 // Adjust the Return address stack slot.
2707 EVT VT = getPointerTy();
2708 OutRetAddr = getReturnAddressFrameIndex(DAG);
2710 // Load the "old" Return address.
2711 OutRetAddr = DAG.getLoad(VT, dl, Chain, OutRetAddr, MachinePointerInfo(),
2712 false, false, false, 0);
2713 return SDValue(OutRetAddr.getNode(), 1);
2716 /// EmitTailCallStoreRetAddr - Emit a store of the return address if tail call
2717 /// optimization is performed and it is required (FPDiff!=0).
2718 static SDValue EmitTailCallStoreRetAddr(SelectionDAG &DAG, MachineFunction &MF,
2719 SDValue Chain, SDValue RetAddrFrIdx,
2720 EVT PtrVT, unsigned SlotSize,
2721 int FPDiff, SDLoc dl) {
2722 // Store the return address to the appropriate stack slot.
2723 if (!FPDiff) return Chain;
2724 // Calculate the new stack slot for the return address.
2725 int NewReturnAddrFI =
2726 MF.getFrameInfo()->CreateFixedObject(SlotSize, (int64_t)FPDiff - SlotSize,
2728 SDValue NewRetAddrFrIdx = DAG.getFrameIndex(NewReturnAddrFI, PtrVT);
2729 Chain = DAG.getStore(Chain, dl, RetAddrFrIdx, NewRetAddrFrIdx,
2730 MachinePointerInfo::getFixedStack(NewReturnAddrFI),
2736 X86TargetLowering::LowerCall(TargetLowering::CallLoweringInfo &CLI,
2737 SmallVectorImpl<SDValue> &InVals) const {
2738 SelectionDAG &DAG = CLI.DAG;
2740 SmallVectorImpl<ISD::OutputArg> &Outs = CLI.Outs;
2741 SmallVectorImpl<SDValue> &OutVals = CLI.OutVals;
2742 SmallVectorImpl<ISD::InputArg> &Ins = CLI.Ins;
2743 SDValue Chain = CLI.Chain;
2744 SDValue Callee = CLI.Callee;
2745 CallingConv::ID CallConv = CLI.CallConv;
2746 bool &isTailCall = CLI.IsTailCall;
2747 bool isVarArg = CLI.IsVarArg;
2749 MachineFunction &MF = DAG.getMachineFunction();
2750 bool Is64Bit = Subtarget->is64Bit();
2751 bool IsWin64 = Subtarget->isCallingConvWin64(CallConv);
2752 StructReturnType SR = callIsStructReturn(Outs);
2753 bool IsSibcall = false;
2754 X86MachineFunctionInfo *X86Info = MF.getInfo<X86MachineFunctionInfo>();
2756 if (MF.getTarget().Options.DisableTailCalls)
2759 bool IsMustTail = CLI.CS && CLI.CS->isMustTailCall();
2761 // Force this to be a tail call. The verifier rules are enough to ensure
2762 // that we can lower this successfully without moving the return address
2765 } else if (isTailCall) {
2766 // Check if it's really possible to do a tail call.
2767 isTailCall = IsEligibleForTailCallOptimization(Callee, CallConv,
2768 isVarArg, SR != NotStructReturn,
2769 MF.getFunction()->hasStructRetAttr(), CLI.RetTy,
2770 Outs, OutVals, Ins, DAG);
2772 // Sibcalls are automatically detected tailcalls which do not require
2774 if (!MF.getTarget().Options.GuaranteedTailCallOpt && isTailCall)
2781 assert(!(isVarArg && IsTailCallConvention(CallConv)) &&
2782 "Var args not supported with calling convention fastcc, ghc or hipe");
2784 // Analyze operands of the call, assigning locations to each operand.
2785 SmallVector<CCValAssign, 16> ArgLocs;
2786 CCState CCInfo(CallConv, isVarArg, MF, ArgLocs, *DAG.getContext());
2788 // Allocate shadow area for Win64
2790 CCInfo.AllocateStack(32, 8);
2792 CCInfo.AnalyzeCallOperands(Outs, CC_X86);
2794 // Get a count of how many bytes are to be pushed on the stack.
2795 unsigned NumBytes = CCInfo.getNextStackOffset();
2797 // This is a sibcall. The memory operands are available in caller's
2798 // own caller's stack.
2800 else if (MF.getTarget().Options.GuaranteedTailCallOpt &&
2801 IsTailCallConvention(CallConv))
2802 NumBytes = GetAlignedArgumentStackSize(NumBytes, DAG);
2805 if (isTailCall && !IsSibcall && !IsMustTail) {
2806 // Lower arguments at fp - stackoffset + fpdiff.
2807 unsigned NumBytesCallerPushed = X86Info->getBytesToPopOnReturn();
2809 FPDiff = NumBytesCallerPushed - NumBytes;
2811 // Set the delta of movement of the returnaddr stackslot.
2812 // But only set if delta is greater than previous delta.
2813 if (FPDiff < X86Info->getTCReturnAddrDelta())
2814 X86Info->setTCReturnAddrDelta(FPDiff);
2817 unsigned NumBytesToPush = NumBytes;
2818 unsigned NumBytesToPop = NumBytes;
2820 // If we have an inalloca argument, all stack space has already been allocated
2821 // for us and be right at the top of the stack. We don't support multiple
2822 // arguments passed in memory when using inalloca.
2823 if (!Outs.empty() && Outs.back().Flags.isInAlloca()) {
2825 if (!ArgLocs.back().isMemLoc())
2826 report_fatal_error("cannot use inalloca attribute on a register "
2828 if (ArgLocs.back().getLocMemOffset() != 0)
2829 report_fatal_error("any parameter with the inalloca attribute must be "
2830 "the only memory argument");
2834 Chain = DAG.getCALLSEQ_START(
2835 Chain, DAG.getIntPtrConstant(NumBytesToPush, true), dl);
2837 SDValue RetAddrFrIdx;
2838 // Load return address for tail calls.
2839 if (isTailCall && FPDiff)
2840 Chain = EmitTailCallLoadRetAddr(DAG, RetAddrFrIdx, Chain, isTailCall,
2841 Is64Bit, FPDiff, dl);
2843 SmallVector<std::pair<unsigned, SDValue>, 8> RegsToPass;
2844 SmallVector<SDValue, 8> MemOpChains;
2847 // Walk the register/memloc assignments, inserting copies/loads. In the case
2848 // of tail call optimization arguments are handle later.
2849 const X86RegisterInfo *RegInfo = static_cast<const X86RegisterInfo *>(
2850 DAG.getSubtarget().getRegisterInfo());
2851 for (unsigned i = 0, e = ArgLocs.size(); i != e; ++i) {
2852 // Skip inalloca arguments, they have already been written.
2853 ISD::ArgFlagsTy Flags = Outs[i].Flags;
2854 if (Flags.isInAlloca())
2857 CCValAssign &VA = ArgLocs[i];
2858 EVT RegVT = VA.getLocVT();
2859 SDValue Arg = OutVals[i];
2860 bool isByVal = Flags.isByVal();
2862 // Promote the value if needed.
2863 switch (VA.getLocInfo()) {
2864 default: llvm_unreachable("Unknown loc info!");
2865 case CCValAssign::Full: break;
2866 case CCValAssign::SExt:
2867 Arg = DAG.getNode(ISD::SIGN_EXTEND, dl, RegVT, Arg);
2869 case CCValAssign::ZExt:
2870 Arg = DAG.getNode(ISD::ZERO_EXTEND, dl, RegVT, Arg);
2872 case CCValAssign::AExt:
2873 if (RegVT.is128BitVector()) {
2874 // Special case: passing MMX values in XMM registers.
2875 Arg = DAG.getNode(ISD::BITCAST, dl, MVT::i64, Arg);
2876 Arg = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, MVT::v2i64, Arg);
2877 Arg = getMOVL(DAG, dl, MVT::v2i64, DAG.getUNDEF(MVT::v2i64), Arg);
2879 Arg = DAG.getNode(ISD::ANY_EXTEND, dl, RegVT, Arg);
2881 case CCValAssign::BCvt:
2882 Arg = DAG.getNode(ISD::BITCAST, dl, RegVT, Arg);
2884 case CCValAssign::Indirect: {
2885 // Store the argument.
2886 SDValue SpillSlot = DAG.CreateStackTemporary(VA.getValVT());
2887 int FI = cast<FrameIndexSDNode>(SpillSlot)->getIndex();
2888 Chain = DAG.getStore(Chain, dl, Arg, SpillSlot,
2889 MachinePointerInfo::getFixedStack(FI),
2896 if (VA.isRegLoc()) {
2897 RegsToPass.push_back(std::make_pair(VA.getLocReg(), Arg));
2898 if (isVarArg && IsWin64) {
2899 // Win64 ABI requires argument XMM reg to be copied to the corresponding
2900 // shadow reg if callee is a varargs function.
2901 unsigned ShadowReg = 0;
2902 switch (VA.getLocReg()) {
2903 case X86::XMM0: ShadowReg = X86::RCX; break;
2904 case X86::XMM1: ShadowReg = X86::RDX; break;
2905 case X86::XMM2: ShadowReg = X86::R8; break;
2906 case X86::XMM3: ShadowReg = X86::R9; break;
2909 RegsToPass.push_back(std::make_pair(ShadowReg, Arg));
2911 } else if (!IsSibcall && (!isTailCall || isByVal)) {
2912 assert(VA.isMemLoc());
2913 if (!StackPtr.getNode())
2914 StackPtr = DAG.getCopyFromReg(Chain, dl, RegInfo->getStackRegister(),
2916 MemOpChains.push_back(LowerMemOpCallTo(Chain, StackPtr, Arg,
2917 dl, DAG, VA, Flags));
2921 if (!MemOpChains.empty())
2922 Chain = DAG.getNode(ISD::TokenFactor, dl, MVT::Other, MemOpChains);
2924 if (Subtarget->isPICStyleGOT()) {
2925 // ELF / PIC requires GOT in the EBX register before function calls via PLT
2928 RegsToPass.push_back(std::make_pair(unsigned(X86::EBX),
2929 DAG.getNode(X86ISD::GlobalBaseReg, SDLoc(), getPointerTy())));
2931 // If we are tail calling and generating PIC/GOT style code load the
2932 // address of the callee into ECX. The value in ecx is used as target of
2933 // the tail jump. This is done to circumvent the ebx/callee-saved problem
2934 // for tail calls on PIC/GOT architectures. Normally we would just put the
2935 // address of GOT into ebx and then call target@PLT. But for tail calls
2936 // ebx would be restored (since ebx is callee saved) before jumping to the
2939 // Note: The actual moving to ECX is done further down.
2940 GlobalAddressSDNode *G = dyn_cast<GlobalAddressSDNode>(Callee);
2941 if (G && !G->getGlobal()->hasHiddenVisibility() &&
2942 !G->getGlobal()->hasProtectedVisibility())
2943 Callee = LowerGlobalAddress(Callee, DAG);
2944 else if (isa<ExternalSymbolSDNode>(Callee))
2945 Callee = LowerExternalSymbol(Callee, DAG);
2949 if (Is64Bit && isVarArg && !IsWin64 && !IsMustTail) {
2950 // From AMD64 ABI document:
2951 // For calls that may call functions that use varargs or stdargs
2952 // (prototype-less calls or calls to functions containing ellipsis (...) in
2953 // the declaration) %al is used as hidden argument to specify the number
2954 // of SSE registers used. The contents of %al do not need to match exactly
2955 // the number of registers, but must be an ubound on the number of SSE
2956 // registers used and is in the range 0 - 8 inclusive.
2958 // Count the number of XMM registers allocated.
2959 static const MCPhysReg XMMArgRegs[] = {
2960 X86::XMM0, X86::XMM1, X86::XMM2, X86::XMM3,
2961 X86::XMM4, X86::XMM5, X86::XMM6, X86::XMM7
2963 unsigned NumXMMRegs = CCInfo.getFirstUnallocated(XMMArgRegs, 8);
2964 assert((Subtarget->hasSSE1() || !NumXMMRegs)
2965 && "SSE registers cannot be used when SSE is disabled");
2967 RegsToPass.push_back(std::make_pair(unsigned(X86::AL),
2968 DAG.getConstant(NumXMMRegs, MVT::i8)));
2971 if (Is64Bit && isVarArg && IsMustTail) {
2972 const auto &Forwards = X86Info->getForwardedMustTailRegParms();
2973 for (const auto &F : Forwards) {
2974 SDValue Val = DAG.getCopyFromReg(Chain, dl, F.VReg, F.VT);
2975 RegsToPass.push_back(std::make_pair(unsigned(F.PReg), Val));
2979 // For tail calls lower the arguments to the 'real' stack slots. Sibcalls
2980 // don't need this because the eligibility check rejects calls that require
2981 // shuffling arguments passed in memory.
2982 if (!IsSibcall && isTailCall) {
2983 // Force all the incoming stack arguments to be loaded from the stack
2984 // before any new outgoing arguments are stored to the stack, because the
2985 // outgoing stack slots may alias the incoming argument stack slots, and
2986 // the alias isn't otherwise explicit. This is slightly more conservative
2987 // than necessary, because it means that each store effectively depends
2988 // on every argument instead of just those arguments it would clobber.
2989 SDValue ArgChain = DAG.getStackArgumentTokenFactor(Chain);
2991 SmallVector<SDValue, 8> MemOpChains2;
2994 for (unsigned i = 0, e = ArgLocs.size(); i != e; ++i) {
2995 CCValAssign &VA = ArgLocs[i];
2998 assert(VA.isMemLoc());
2999 SDValue Arg = OutVals[i];
3000 ISD::ArgFlagsTy Flags = Outs[i].Flags;
3001 // Skip inalloca arguments. They don't require any work.
3002 if (Flags.isInAlloca())
3004 // Create frame index.
3005 int32_t Offset = VA.getLocMemOffset()+FPDiff;
3006 uint32_t OpSize = (VA.getLocVT().getSizeInBits()+7)/8;
3007 FI = MF.getFrameInfo()->CreateFixedObject(OpSize, Offset, true);
3008 FIN = DAG.getFrameIndex(FI, getPointerTy());
3010 if (Flags.isByVal()) {
3011 // Copy relative to framepointer.
3012 SDValue Source = DAG.getIntPtrConstant(VA.getLocMemOffset());
3013 if (!StackPtr.getNode())
3014 StackPtr = DAG.getCopyFromReg(Chain, dl,
3015 RegInfo->getStackRegister(),
3017 Source = DAG.getNode(ISD::ADD, dl, getPointerTy(), StackPtr, Source);
3019 MemOpChains2.push_back(CreateCopyOfByValArgument(Source, FIN,
3023 // Store relative to framepointer.
3024 MemOpChains2.push_back(
3025 DAG.getStore(ArgChain, dl, Arg, FIN,
3026 MachinePointerInfo::getFixedStack(FI),
3031 if (!MemOpChains2.empty())
3032 Chain = DAG.getNode(ISD::TokenFactor, dl, MVT::Other, MemOpChains2);
3034 // Store the return address to the appropriate stack slot.
3035 Chain = EmitTailCallStoreRetAddr(DAG, MF, Chain, RetAddrFrIdx,
3036 getPointerTy(), RegInfo->getSlotSize(),
3040 // Build a sequence of copy-to-reg nodes chained together with token chain
3041 // and flag operands which copy the outgoing args into registers.
3043 for (unsigned i = 0, e = RegsToPass.size(); i != e; ++i) {
3044 Chain = DAG.getCopyToReg(Chain, dl, RegsToPass[i].first,
3045 RegsToPass[i].second, InFlag);
3046 InFlag = Chain.getValue(1);
3049 if (DAG.getTarget().getCodeModel() == CodeModel::Large) {
3050 assert(Is64Bit && "Large code model is only legal in 64-bit mode.");
3051 // In the 64-bit large code model, we have to make all calls
3052 // through a register, since the call instruction's 32-bit
3053 // pc-relative offset may not be large enough to hold the whole
3055 } else if (GlobalAddressSDNode *G = dyn_cast<GlobalAddressSDNode>(Callee)) {
3056 // If the callee is a GlobalAddress node (quite common, every direct call
3057 // is) turn it into a TargetGlobalAddress node so that legalize doesn't hack
3060 // We should use extra load for direct calls to dllimported functions in
3062 const GlobalValue *GV = G->getGlobal();
3063 if (!GV->hasDLLImportStorageClass()) {
3064 unsigned char OpFlags = 0;
3065 bool ExtraLoad = false;
3066 unsigned WrapperKind = ISD::DELETED_NODE;
3068 // On ELF targets, in both X86-64 and X86-32 mode, direct calls to
3069 // external symbols most go through the PLT in PIC mode. If the symbol
3070 // has hidden or protected visibility, or if it is static or local, then
3071 // we don't need to use the PLT - we can directly call it.
3072 if (Subtarget->isTargetELF() &&
3073 DAG.getTarget().getRelocationModel() == Reloc::PIC_ &&
3074 GV->hasDefaultVisibility() && !GV->hasLocalLinkage()) {
3075 OpFlags = X86II::MO_PLT;
3076 } else if (Subtarget->isPICStyleStubAny() &&
3077 (GV->isDeclaration() || GV->isWeakForLinker()) &&
3078 (!Subtarget->getTargetTriple().isMacOSX() ||
3079 Subtarget->getTargetTriple().isMacOSXVersionLT(10, 5))) {
3080 // PC-relative references to external symbols should go through $stub,
3081 // unless we're building with the leopard linker or later, which
3082 // automatically synthesizes these stubs.
3083 OpFlags = X86II::MO_DARWIN_STUB;
3084 } else if (Subtarget->isPICStyleRIPRel() &&
3085 isa<Function>(GV) &&
3086 cast<Function>(GV)->getAttributes().
3087 hasAttribute(AttributeSet::FunctionIndex,
3088 Attribute::NonLazyBind)) {
3089 // If the function is marked as non-lazy, generate an indirect call
3090 // which loads from the GOT directly. This avoids runtime overhead
3091 // at the cost of eager binding (and one extra byte of encoding).
3092 OpFlags = X86II::MO_GOTPCREL;
3093 WrapperKind = X86ISD::WrapperRIP;
3097 Callee = DAG.getTargetGlobalAddress(GV, dl, getPointerTy(),
3098 G->getOffset(), OpFlags);
3100 // Add a wrapper if needed.
3101 if (WrapperKind != ISD::DELETED_NODE)
3102 Callee = DAG.getNode(X86ISD::WrapperRIP, dl, getPointerTy(), Callee);
3103 // Add extra indirection if needed.
3105 Callee = DAG.getLoad(getPointerTy(), dl, DAG.getEntryNode(), Callee,
3106 MachinePointerInfo::getGOT(),
3107 false, false, false, 0);
3109 } else if (ExternalSymbolSDNode *S = dyn_cast<ExternalSymbolSDNode>(Callee)) {
3110 unsigned char OpFlags = 0;
3112 // On ELF targets, in either X86-64 or X86-32 mode, direct calls to
3113 // external symbols should go through the PLT.
3114 if (Subtarget->isTargetELF() &&
3115 DAG.getTarget().getRelocationModel() == Reloc::PIC_) {
3116 OpFlags = X86II::MO_PLT;
3117 } else if (Subtarget->isPICStyleStubAny() &&
3118 (!Subtarget->getTargetTriple().isMacOSX() ||
3119 Subtarget->getTargetTriple().isMacOSXVersionLT(10, 5))) {
3120 // PC-relative references to external symbols should go through $stub,
3121 // unless we're building with the leopard linker or later, which
3122 // automatically synthesizes these stubs.
3123 OpFlags = X86II::MO_DARWIN_STUB;
3126 Callee = DAG.getTargetExternalSymbol(S->getSymbol(), getPointerTy(),
3128 } else if (Subtarget->isTarget64BitILP32() && Callee->getValueType(0) == MVT::i32) {
3129 // Zero-extend the 32-bit Callee address into a 64-bit according to x32 ABI
3130 Callee = DAG.getNode(ISD::ZERO_EXTEND, dl, MVT::i64, Callee);
3133 // Returns a chain & a flag for retval copy to use.
3134 SDVTList NodeTys = DAG.getVTList(MVT::Other, MVT::Glue);
3135 SmallVector<SDValue, 8> Ops;
3137 if (!IsSibcall && isTailCall) {
3138 Chain = DAG.getCALLSEQ_END(Chain,
3139 DAG.getIntPtrConstant(NumBytesToPop, true),
3140 DAG.getIntPtrConstant(0, true), InFlag, dl);
3141 InFlag = Chain.getValue(1);
3144 Ops.push_back(Chain);
3145 Ops.push_back(Callee);
3148 Ops.push_back(DAG.getConstant(FPDiff, MVT::i32));
3150 // Add argument registers to the end of the list so that they are known live
3152 for (unsigned i = 0, e = RegsToPass.size(); i != e; ++i)
3153 Ops.push_back(DAG.getRegister(RegsToPass[i].first,
3154 RegsToPass[i].second.getValueType()));
3156 // Add a register mask operand representing the call-preserved registers.
3157 const TargetRegisterInfo *TRI = DAG.getSubtarget().getRegisterInfo();
3158 const uint32_t *Mask = TRI->getCallPreservedMask(CallConv);
3159 assert(Mask && "Missing call preserved mask for calling convention");
3160 Ops.push_back(DAG.getRegisterMask(Mask));
3162 if (InFlag.getNode())
3163 Ops.push_back(InFlag);
3167 //// If this is the first return lowered for this function, add the regs
3168 //// to the liveout set for the function.
3169 // This isn't right, although it's probably harmless on x86; liveouts
3170 // should be computed from returns not tail calls. Consider a void
3171 // function making a tail call to a function returning int.
3172 return DAG.getNode(X86ISD::TC_RETURN, dl, NodeTys, Ops);
3175 Chain = DAG.getNode(X86ISD::CALL, dl, NodeTys, Ops);
3176 InFlag = Chain.getValue(1);
3178 // Create the CALLSEQ_END node.
3179 unsigned NumBytesForCalleeToPop;
3180 if (X86::isCalleePop(CallConv, Is64Bit, isVarArg,
3181 DAG.getTarget().Options.GuaranteedTailCallOpt))
3182 NumBytesForCalleeToPop = NumBytes; // Callee pops everything
3183 else if (!Is64Bit && !IsTailCallConvention(CallConv) &&
3184 !Subtarget->getTargetTriple().isOSMSVCRT() &&
3185 SR == StackStructReturn)
3186 // If this is a call to a struct-return function, the callee
3187 // pops the hidden struct pointer, so we have to push it back.
3188 // This is common for Darwin/X86, Linux & Mingw32 targets.
3189 // For MSVC Win32 targets, the caller pops the hidden struct pointer.
3190 NumBytesForCalleeToPop = 4;
3192 NumBytesForCalleeToPop = 0; // Callee pops nothing.
3194 // Returns a flag for retval copy to use.
3196 Chain = DAG.getCALLSEQ_END(Chain,
3197 DAG.getIntPtrConstant(NumBytesToPop, true),
3198 DAG.getIntPtrConstant(NumBytesForCalleeToPop,
3201 InFlag = Chain.getValue(1);
3204 // Handle result values, copying them out of physregs into vregs that we
3206 return LowerCallResult(Chain, InFlag, CallConv, isVarArg,
3207 Ins, dl, DAG, InVals);
3210 //===----------------------------------------------------------------------===//
3211 // Fast Calling Convention (tail call) implementation
3212 //===----------------------------------------------------------------------===//
3214 // Like std call, callee cleans arguments, convention except that ECX is
3215 // reserved for storing the tail called function address. Only 2 registers are
3216 // free for argument passing (inreg). Tail call optimization is performed
3218 // * tailcallopt is enabled
3219 // * caller/callee are fastcc
3220 // On X86_64 architecture with GOT-style position independent code only local
3221 // (within module) calls are supported at the moment.
3222 // To keep the stack aligned according to platform abi the function
3223 // GetAlignedArgumentStackSize ensures that argument delta is always multiples
3224 // of stack alignment. (Dynamic linkers need this - darwin's dyld for example)
3225 // If a tail called function callee has more arguments than the caller the
3226 // caller needs to make sure that there is room to move the RETADDR to. This is
3227 // achieved by reserving an area the size of the argument delta right after the
3228 // original RETADDR, but before the saved framepointer or the spilled registers
3229 // e.g. caller(arg1, arg2) calls callee(arg1, arg2,arg3,arg4)
3241 /// GetAlignedArgumentStackSize - Make the stack size align e.g 16n + 12 aligned
3242 /// for a 16 byte align requirement.
3244 X86TargetLowering::GetAlignedArgumentStackSize(unsigned StackSize,
3245 SelectionDAG& DAG) const {
3246 MachineFunction &MF = DAG.getMachineFunction();
3247 const TargetMachine &TM = MF.getTarget();
3248 const X86RegisterInfo *RegInfo = static_cast<const X86RegisterInfo *>(
3249 TM.getSubtargetImpl()->getRegisterInfo());
3250 const TargetFrameLowering &TFI = *TM.getSubtargetImpl()->getFrameLowering();
3251 unsigned StackAlignment = TFI.getStackAlignment();
3252 uint64_t AlignMask = StackAlignment - 1;
3253 int64_t Offset = StackSize;
3254 unsigned SlotSize = RegInfo->getSlotSize();
3255 if ( (Offset & AlignMask) <= (StackAlignment - SlotSize) ) {
3256 // Number smaller than 12 so just add the difference.
3257 Offset += ((StackAlignment - SlotSize) - (Offset & AlignMask));
3259 // Mask out lower bits, add stackalignment once plus the 12 bytes.
3260 Offset = ((~AlignMask) & Offset) + StackAlignment +
3261 (StackAlignment-SlotSize);
3266 /// MatchingStackOffset - Return true if the given stack call argument is
3267 /// already available in the same position (relatively) of the caller's
3268 /// incoming argument stack.
3270 bool MatchingStackOffset(SDValue Arg, unsigned Offset, ISD::ArgFlagsTy Flags,
3271 MachineFrameInfo *MFI, const MachineRegisterInfo *MRI,
3272 const X86InstrInfo *TII) {
3273 unsigned Bytes = Arg.getValueType().getSizeInBits() / 8;
3275 if (Arg.getOpcode() == ISD::CopyFromReg) {
3276 unsigned VR = cast<RegisterSDNode>(Arg.getOperand(1))->getReg();
3277 if (!TargetRegisterInfo::isVirtualRegister(VR))
3279 MachineInstr *Def = MRI->getVRegDef(VR);
3282 if (!Flags.isByVal()) {
3283 if (!TII->isLoadFromStackSlot(Def, FI))
3286 unsigned Opcode = Def->getOpcode();
3287 if ((Opcode == X86::LEA32r || Opcode == X86::LEA64r) &&
3288 Def->getOperand(1).isFI()) {
3289 FI = Def->getOperand(1).getIndex();
3290 Bytes = Flags.getByValSize();
3294 } else if (LoadSDNode *Ld = dyn_cast<LoadSDNode>(Arg)) {
3295 if (Flags.isByVal())
3296 // ByVal argument is passed in as a pointer but it's now being
3297 // dereferenced. e.g.
3298 // define @foo(%struct.X* %A) {
3299 // tail call @bar(%struct.X* byval %A)
3302 SDValue Ptr = Ld->getBasePtr();
3303 FrameIndexSDNode *FINode = dyn_cast<FrameIndexSDNode>(Ptr);
3306 FI = FINode->getIndex();
3307 } else if (Arg.getOpcode() == ISD::FrameIndex && Flags.isByVal()) {
3308 FrameIndexSDNode *FINode = cast<FrameIndexSDNode>(Arg);
3309 FI = FINode->getIndex();
3310 Bytes = Flags.getByValSize();
3314 assert(FI != INT_MAX);
3315 if (!MFI->isFixedObjectIndex(FI))
3317 return Offset == MFI->getObjectOffset(FI) && Bytes == MFI->getObjectSize(FI);
3320 /// IsEligibleForTailCallOptimization - Check whether the call is eligible
3321 /// for tail call optimization. Targets which want to do tail call
3322 /// optimization should implement this function.
3324 X86TargetLowering::IsEligibleForTailCallOptimization(SDValue Callee,
3325 CallingConv::ID CalleeCC,
3327 bool isCalleeStructRet,
3328 bool isCallerStructRet,
3330 const SmallVectorImpl<ISD::OutputArg> &Outs,
3331 const SmallVectorImpl<SDValue> &OutVals,
3332 const SmallVectorImpl<ISD::InputArg> &Ins,
3333 SelectionDAG &DAG) const {
3334 if (!IsTailCallConvention(CalleeCC) && !IsCCallConvention(CalleeCC))
3337 // If -tailcallopt is specified, make fastcc functions tail-callable.
3338 const MachineFunction &MF = DAG.getMachineFunction();
3339 const Function *CallerF = MF.getFunction();
3341 // If the function return type is x86_fp80 and the callee return type is not,
3342 // then the FP_EXTEND of the call result is not a nop. It's not safe to
3343 // perform a tailcall optimization here.
3344 if (CallerF->getReturnType()->isX86_FP80Ty() && !RetTy->isX86_FP80Ty())
3347 CallingConv::ID CallerCC = CallerF->getCallingConv();
3348 bool CCMatch = CallerCC == CalleeCC;
3349 bool IsCalleeWin64 = Subtarget->isCallingConvWin64(CalleeCC);
3350 bool IsCallerWin64 = Subtarget->isCallingConvWin64(CallerCC);
3352 if (DAG.getTarget().Options.GuaranteedTailCallOpt) {
3353 if (IsTailCallConvention(CalleeCC) && CCMatch)
3358 // Look for obvious safe cases to perform tail call optimization that do not
3359 // require ABI changes. This is what gcc calls sibcall.
3361 // Can't do sibcall if stack needs to be dynamically re-aligned. PEI needs to
3362 // emit a special epilogue.
3363 const X86RegisterInfo *RegInfo = static_cast<const X86RegisterInfo *>(
3364 DAG.getSubtarget().getRegisterInfo());
3365 if (RegInfo->needsStackRealignment(MF))
3368 // Also avoid sibcall optimization if either caller or callee uses struct
3369 // return semantics.
3370 if (isCalleeStructRet || isCallerStructRet)
3373 // An stdcall/thiscall caller is expected to clean up its arguments; the
3374 // callee isn't going to do that.
3375 // FIXME: this is more restrictive than needed. We could produce a tailcall
3376 // when the stack adjustment matches. For example, with a thiscall that takes
3377 // only one argument.
3378 if (!CCMatch && (CallerCC == CallingConv::X86_StdCall ||
3379 CallerCC == CallingConv::X86_ThisCall))
3382 // Do not sibcall optimize vararg calls unless all arguments are passed via
3384 if (isVarArg && !Outs.empty()) {
3386 // Optimizing for varargs on Win64 is unlikely to be safe without
3387 // additional testing.
3388 if (IsCalleeWin64 || IsCallerWin64)
3391 SmallVector<CCValAssign, 16> ArgLocs;
3392 CCState CCInfo(CalleeCC, isVarArg, DAG.getMachineFunction(), ArgLocs,
3395 CCInfo.AnalyzeCallOperands(Outs, CC_X86);
3396 for (unsigned i = 0, e = ArgLocs.size(); i != e; ++i)
3397 if (!ArgLocs[i].isRegLoc())
3401 // If the call result is in ST0 / ST1, it needs to be popped off the x87
3402 // stack. Therefore, if it's not used by the call it is not safe to optimize
3403 // this into a sibcall.
3404 bool Unused = false;
3405 for (unsigned i = 0, e = Ins.size(); i != e; ++i) {
3412 SmallVector<CCValAssign, 16> RVLocs;
3413 CCState CCInfo(CalleeCC, false, DAG.getMachineFunction(), RVLocs,
3415 CCInfo.AnalyzeCallResult(Ins, RetCC_X86);
3416 for (unsigned i = 0, e = RVLocs.size(); i != e; ++i) {
3417 CCValAssign &VA = RVLocs[i];
3418 if (VA.getLocReg() == X86::FP0 || VA.getLocReg() == X86::FP1)
3423 // If the calling conventions do not match, then we'd better make sure the
3424 // results are returned in the same way as what the caller expects.
3426 SmallVector<CCValAssign, 16> RVLocs1;
3427 CCState CCInfo1(CalleeCC, false, DAG.getMachineFunction(), RVLocs1,
3429 CCInfo1.AnalyzeCallResult(Ins, RetCC_X86);
3431 SmallVector<CCValAssign, 16> RVLocs2;
3432 CCState CCInfo2(CallerCC, false, DAG.getMachineFunction(), RVLocs2,
3434 CCInfo2.AnalyzeCallResult(Ins, RetCC_X86);
3436 if (RVLocs1.size() != RVLocs2.size())
3438 for (unsigned i = 0, e = RVLocs1.size(); i != e; ++i) {
3439 if (RVLocs1[i].isRegLoc() != RVLocs2[i].isRegLoc())
3441 if (RVLocs1[i].getLocInfo() != RVLocs2[i].getLocInfo())
3443 if (RVLocs1[i].isRegLoc()) {
3444 if (RVLocs1[i].getLocReg() != RVLocs2[i].getLocReg())
3447 if (RVLocs1[i].getLocMemOffset() != RVLocs2[i].getLocMemOffset())
3453 // If the callee takes no arguments then go on to check the results of the
3455 if (!Outs.empty()) {
3456 // Check if stack adjustment is needed. For now, do not do this if any
3457 // argument is passed on the stack.
3458 SmallVector<CCValAssign, 16> ArgLocs;
3459 CCState CCInfo(CalleeCC, isVarArg, DAG.getMachineFunction(), ArgLocs,
3462 // Allocate shadow area for Win64
3464 CCInfo.AllocateStack(32, 8);
3466 CCInfo.AnalyzeCallOperands(Outs, CC_X86);
3467 if (CCInfo.getNextStackOffset()) {
3468 MachineFunction &MF = DAG.getMachineFunction();
3469 if (MF.getInfo<X86MachineFunctionInfo>()->getBytesToPopOnReturn())
3472 // Check if the arguments are already laid out in the right way as
3473 // the caller's fixed stack objects.
3474 MachineFrameInfo *MFI = MF.getFrameInfo();
3475 const MachineRegisterInfo *MRI = &MF.getRegInfo();
3476 const X86InstrInfo *TII =
3477 static_cast<const X86InstrInfo *>(DAG.getSubtarget().getInstrInfo());
3478 for (unsigned i = 0, e = ArgLocs.size(); i != e; ++i) {
3479 CCValAssign &VA = ArgLocs[i];
3480 SDValue Arg = OutVals[i];
3481 ISD::ArgFlagsTy Flags = Outs[i].Flags;
3482 if (VA.getLocInfo() == CCValAssign::Indirect)
3484 if (!VA.isRegLoc()) {
3485 if (!MatchingStackOffset(Arg, VA.getLocMemOffset(), Flags,
3492 // If the tailcall address may be in a register, then make sure it's
3493 // possible to register allocate for it. In 32-bit, the call address can
3494 // only target EAX, EDX, or ECX since the tail call must be scheduled after
3495 // callee-saved registers are restored. These happen to be the same
3496 // registers used to pass 'inreg' arguments so watch out for those.
3497 if (!Subtarget->is64Bit() &&
3498 ((!isa<GlobalAddressSDNode>(Callee) &&
3499 !isa<ExternalSymbolSDNode>(Callee)) ||
3500 DAG.getTarget().getRelocationModel() == Reloc::PIC_)) {
3501 unsigned NumInRegs = 0;
3502 // In PIC we need an extra register to formulate the address computation
3504 unsigned MaxInRegs =
3505 (DAG.getTarget().getRelocationModel() == Reloc::PIC_) ? 2 : 3;
3507 for (unsigned i = 0, e = ArgLocs.size(); i != e; ++i) {
3508 CCValAssign &VA = ArgLocs[i];
3511 unsigned Reg = VA.getLocReg();
3514 case X86::EAX: case X86::EDX: case X86::ECX:
3515 if (++NumInRegs == MaxInRegs)
3527 X86TargetLowering::createFastISel(FunctionLoweringInfo &funcInfo,
3528 const TargetLibraryInfo *libInfo) const {
3529 return X86::createFastISel(funcInfo, libInfo);
3532 //===----------------------------------------------------------------------===//
3533 // Other Lowering Hooks
3534 //===----------------------------------------------------------------------===//
3536 static bool MayFoldLoad(SDValue Op) {
3537 return Op.hasOneUse() && ISD::isNormalLoad(Op.getNode());
3540 static bool MayFoldIntoStore(SDValue Op) {
3541 return Op.hasOneUse() && ISD::isNormalStore(*Op.getNode()->use_begin());
3544 static bool isTargetShuffle(unsigned Opcode) {
3546 default: return false;
3547 case X86ISD::BLENDI:
3548 case X86ISD::PSHUFB:
3549 case X86ISD::PSHUFD:
3550 case X86ISD::PSHUFHW:
3551 case X86ISD::PSHUFLW:
3553 case X86ISD::PALIGNR:
3554 case X86ISD::MOVLHPS:
3555 case X86ISD::MOVLHPD:
3556 case X86ISD::MOVHLPS:
3557 case X86ISD::MOVLPS:
3558 case X86ISD::MOVLPD:
3559 case X86ISD::MOVSHDUP:
3560 case X86ISD::MOVSLDUP:
3561 case X86ISD::MOVDDUP:
3564 case X86ISD::UNPCKL:
3565 case X86ISD::UNPCKH:
3566 case X86ISD::VPERMILPI:
3567 case X86ISD::VPERM2X128:
3568 case X86ISD::VPERMI:
3573 static SDValue getTargetShuffleNode(unsigned Opc, SDLoc dl, EVT VT,
3574 SDValue V1, SelectionDAG &DAG) {
3576 default: llvm_unreachable("Unknown x86 shuffle node");
3577 case X86ISD::MOVSHDUP:
3578 case X86ISD::MOVSLDUP:
3579 case X86ISD::MOVDDUP:
3580 return DAG.getNode(Opc, dl, VT, V1);
3584 static SDValue getTargetShuffleNode(unsigned Opc, SDLoc dl, EVT VT,
3585 SDValue V1, unsigned TargetMask,
3586 SelectionDAG &DAG) {
3588 default: llvm_unreachable("Unknown x86 shuffle node");
3589 case X86ISD::PSHUFD:
3590 case X86ISD::PSHUFHW:
3591 case X86ISD::PSHUFLW:
3592 case X86ISD::VPERMILPI:
3593 case X86ISD::VPERMI:
3594 return DAG.getNode(Opc, dl, VT, V1, DAG.getConstant(TargetMask, MVT::i8));
3598 static SDValue getTargetShuffleNode(unsigned Opc, SDLoc dl, EVT VT,
3599 SDValue V1, SDValue V2, unsigned TargetMask,
3600 SelectionDAG &DAG) {
3602 default: llvm_unreachable("Unknown x86 shuffle node");
3603 case X86ISD::PALIGNR:
3604 case X86ISD::VALIGN:
3606 case X86ISD::VPERM2X128:
3607 return DAG.getNode(Opc, dl, VT, V1, V2,
3608 DAG.getConstant(TargetMask, MVT::i8));
3612 static SDValue getTargetShuffleNode(unsigned Opc, SDLoc dl, EVT VT,
3613 SDValue V1, SDValue V2, SelectionDAG &DAG) {
3615 default: llvm_unreachable("Unknown x86 shuffle node");
3616 case X86ISD::MOVLHPS:
3617 case X86ISD::MOVLHPD:
3618 case X86ISD::MOVHLPS:
3619 case X86ISD::MOVLPS:
3620 case X86ISD::MOVLPD:
3623 case X86ISD::UNPCKL:
3624 case X86ISD::UNPCKH:
3625 return DAG.getNode(Opc, dl, VT, V1, V2);
3629 SDValue X86TargetLowering::getReturnAddressFrameIndex(SelectionDAG &DAG) const {
3630 MachineFunction &MF = DAG.getMachineFunction();
3631 const X86RegisterInfo *RegInfo = static_cast<const X86RegisterInfo *>(
3632 DAG.getSubtarget().getRegisterInfo());
3633 X86MachineFunctionInfo *FuncInfo = MF.getInfo<X86MachineFunctionInfo>();
3634 int ReturnAddrIndex = FuncInfo->getRAIndex();
3636 if (ReturnAddrIndex == 0) {
3637 // Set up a frame object for the return address.
3638 unsigned SlotSize = RegInfo->getSlotSize();
3639 ReturnAddrIndex = MF.getFrameInfo()->CreateFixedObject(SlotSize,
3642 FuncInfo->setRAIndex(ReturnAddrIndex);
3645 return DAG.getFrameIndex(ReturnAddrIndex, getPointerTy());
3648 bool X86::isOffsetSuitableForCodeModel(int64_t Offset, CodeModel::Model M,
3649 bool hasSymbolicDisplacement) {
3650 // Offset should fit into 32 bit immediate field.
3651 if (!isInt<32>(Offset))
3654 // If we don't have a symbolic displacement - we don't have any extra
3656 if (!hasSymbolicDisplacement)
3659 // FIXME: Some tweaks might be needed for medium code model.
3660 if (M != CodeModel::Small && M != CodeModel::Kernel)
3663 // For small code model we assume that latest object is 16MB before end of 31
3664 // bits boundary. We may also accept pretty large negative constants knowing
3665 // that all objects are in the positive half of address space.
3666 if (M == CodeModel::Small && Offset < 16*1024*1024)
3669 // For kernel code model we know that all object resist in the negative half
3670 // of 32bits address space. We may not accept negative offsets, since they may
3671 // be just off and we may accept pretty large positive ones.
3672 if (M == CodeModel::Kernel && Offset > 0)
3678 /// isCalleePop - Determines whether the callee is required to pop its
3679 /// own arguments. Callee pop is necessary to support tail calls.
3680 bool X86::isCalleePop(CallingConv::ID CallingConv,
3681 bool is64Bit, bool IsVarArg, bool TailCallOpt) {
3682 switch (CallingConv) {
3685 case CallingConv::X86_StdCall:
3686 case CallingConv::X86_FastCall:
3687 case CallingConv::X86_ThisCall:
3689 case CallingConv::Fast:
3690 case CallingConv::GHC:
3691 case CallingConv::HiPE:
3698 /// \brief Return true if the condition is an unsigned comparison operation.
3699 static bool isX86CCUnsigned(unsigned X86CC) {
3701 default: llvm_unreachable("Invalid integer condition!");
3702 case X86::COND_E: return true;
3703 case X86::COND_G: return false;
3704 case X86::COND_GE: return false;
3705 case X86::COND_L: return false;
3706 case X86::COND_LE: return false;
3707 case X86::COND_NE: return true;
3708 case X86::COND_B: return true;
3709 case X86::COND_A: return true;
3710 case X86::COND_BE: return true;
3711 case X86::COND_AE: return true;
3713 llvm_unreachable("covered switch fell through?!");
3716 /// TranslateX86CC - do a one to one translation of a ISD::CondCode to the X86
3717 /// specific condition code, returning the condition code and the LHS/RHS of the
3718 /// comparison to make.
3719 static unsigned TranslateX86CC(ISD::CondCode SetCCOpcode, bool isFP,
3720 SDValue &LHS, SDValue &RHS, SelectionDAG &DAG) {
3722 if (ConstantSDNode *RHSC = dyn_cast<ConstantSDNode>(RHS)) {
3723 if (SetCCOpcode == ISD::SETGT && RHSC->isAllOnesValue()) {
3724 // X > -1 -> X == 0, jump !sign.
3725 RHS = DAG.getConstant(0, RHS.getValueType());
3726 return X86::COND_NS;
3728 if (SetCCOpcode == ISD::SETLT && RHSC->isNullValue()) {
3729 // X < 0 -> X == 0, jump on sign.
3732 if (SetCCOpcode == ISD::SETLT && RHSC->getZExtValue() == 1) {
3734 RHS = DAG.getConstant(0, RHS.getValueType());
3735 return X86::COND_LE;
3739 switch (SetCCOpcode) {
3740 default: llvm_unreachable("Invalid integer condition!");
3741 case ISD::SETEQ: return X86::COND_E;
3742 case ISD::SETGT: return X86::COND_G;
3743 case ISD::SETGE: return X86::COND_GE;
3744 case ISD::SETLT: return X86::COND_L;
3745 case ISD::SETLE: return X86::COND_LE;
3746 case ISD::SETNE: return X86::COND_NE;
3747 case ISD::SETULT: return X86::COND_B;
3748 case ISD::SETUGT: return X86::COND_A;
3749 case ISD::SETULE: return X86::COND_BE;
3750 case ISD::SETUGE: return X86::COND_AE;
3754 // First determine if it is required or is profitable to flip the operands.
3756 // If LHS is a foldable load, but RHS is not, flip the condition.
3757 if (ISD::isNON_EXTLoad(LHS.getNode()) &&
3758 !ISD::isNON_EXTLoad(RHS.getNode())) {
3759 SetCCOpcode = getSetCCSwappedOperands(SetCCOpcode);
3760 std::swap(LHS, RHS);
3763 switch (SetCCOpcode) {
3769 std::swap(LHS, RHS);
3773 // On a floating point condition, the flags are set as follows:
3775 // 0 | 0 | 0 | X > Y
3776 // 0 | 0 | 1 | X < Y
3777 // 1 | 0 | 0 | X == Y
3778 // 1 | 1 | 1 | unordered
3779 switch (SetCCOpcode) {
3780 default: llvm_unreachable("Condcode should be pre-legalized away");
3782 case ISD::SETEQ: return X86::COND_E;
3783 case ISD::SETOLT: // flipped
3785 case ISD::SETGT: return X86::COND_A;
3786 case ISD::SETOLE: // flipped
3788 case ISD::SETGE: return X86::COND_AE;
3789 case ISD::SETUGT: // flipped
3791 case ISD::SETLT: return X86::COND_B;
3792 case ISD::SETUGE: // flipped
3794 case ISD::SETLE: return X86::COND_BE;
3796 case ISD::SETNE: return X86::COND_NE;
3797 case ISD::SETUO: return X86::COND_P;
3798 case ISD::SETO: return X86::COND_NP;
3800 case ISD::SETUNE: return X86::COND_INVALID;
3804 /// hasFPCMov - is there a floating point cmov for the specific X86 condition
3805 /// code. Current x86 isa includes the following FP cmov instructions:
3806 /// fcmovb, fcomvbe, fcomve, fcmovu, fcmovae, fcmova, fcmovne, fcmovnu.
3807 static bool hasFPCMov(unsigned X86CC) {
3823 /// isFPImmLegal - Returns true if the target can instruction select the
3824 /// specified FP immediate natively. If false, the legalizer will
3825 /// materialize the FP immediate as a load from a constant pool.
3826 bool X86TargetLowering::isFPImmLegal(const APFloat &Imm, EVT VT) const {
3827 for (unsigned i = 0, e = LegalFPImmediates.size(); i != e; ++i) {
3828 if (Imm.bitwiseIsEqual(LegalFPImmediates[i]))
3834 /// \brief Returns true if it is beneficial to convert a load of a constant
3835 /// to just the constant itself.
3836 bool X86TargetLowering::shouldConvertConstantLoadToIntImm(const APInt &Imm,
3838 assert(Ty->isIntegerTy());
3840 unsigned BitSize = Ty->getPrimitiveSizeInBits();
3841 if (BitSize == 0 || BitSize > 64)
3846 /// isUndefOrInRange - Return true if Val is undef or if its value falls within
3847 /// the specified range (L, H].
3848 static bool isUndefOrInRange(int Val, int Low, int Hi) {
3849 return (Val < 0) || (Val >= Low && Val < Hi);
3852 /// isUndefOrEqual - Val is either less than zero (undef) or equal to the
3853 /// specified value.
3854 static bool isUndefOrEqual(int Val, int CmpVal) {
3855 return (Val < 0 || Val == CmpVal);
3858 /// isSequentialOrUndefInRange - Return true if every element in Mask, beginning
3859 /// from position Pos and ending in Pos+Size, falls within the specified
3860 /// sequential range (L, L+Pos]. or is undef.
3861 static bool isSequentialOrUndefInRange(ArrayRef<int> Mask,
3862 unsigned Pos, unsigned Size, int Low) {
3863 for (unsigned i = Pos, e = Pos+Size; i != e; ++i, ++Low)
3864 if (!isUndefOrEqual(Mask[i], Low))
3869 /// isPSHUFDMask - Return true if the node specifies a shuffle of elements that
3870 /// is suitable for input to PSHUFD or PSHUFW. That is, it doesn't reference
3871 /// the second operand.
3872 static bool isPSHUFDMask(ArrayRef<int> Mask, MVT VT) {
3873 if (VT == MVT::v4f32 || VT == MVT::v4i32 )
3874 return (Mask[0] < 4 && Mask[1] < 4 && Mask[2] < 4 && Mask[3] < 4);
3875 if (VT == MVT::v2f64 || VT == MVT::v2i64)
3876 return (Mask[0] < 2 && Mask[1] < 2);
3880 /// isPSHUFHWMask - Return true if the node specifies a shuffle of elements that
3881 /// is suitable for input to PSHUFHW.
3882 static bool isPSHUFHWMask(ArrayRef<int> Mask, MVT VT, bool HasInt256) {
3883 if (VT != MVT::v8i16 && (!HasInt256 || VT != MVT::v16i16))
3886 // Lower quadword copied in order or undef.
3887 if (!isSequentialOrUndefInRange(Mask, 0, 4, 0))
3890 // Upper quadword shuffled.
3891 for (unsigned i = 4; i != 8; ++i)
3892 if (!isUndefOrInRange(Mask[i], 4, 8))
3895 if (VT == MVT::v16i16) {
3896 // Lower quadword copied in order or undef.
3897 if (!isSequentialOrUndefInRange(Mask, 8, 4, 8))
3900 // Upper quadword shuffled.
3901 for (unsigned i = 12; i != 16; ++i)
3902 if (!isUndefOrInRange(Mask[i], 12, 16))
3909 /// isPSHUFLWMask - Return true if the node specifies a shuffle of elements that
3910 /// is suitable for input to PSHUFLW.
3911 static bool isPSHUFLWMask(ArrayRef<int> Mask, MVT VT, bool HasInt256) {
3912 if (VT != MVT::v8i16 && (!HasInt256 || VT != MVT::v16i16))
3915 // Upper quadword copied in order.
3916 if (!isSequentialOrUndefInRange(Mask, 4, 4, 4))
3919 // Lower quadword shuffled.
3920 for (unsigned i = 0; i != 4; ++i)
3921 if (!isUndefOrInRange(Mask[i], 0, 4))
3924 if (VT == MVT::v16i16) {
3925 // Upper quadword copied in order.
3926 if (!isSequentialOrUndefInRange(Mask, 12, 4, 12))
3929 // Lower quadword shuffled.
3930 for (unsigned i = 8; i != 12; ++i)
3931 if (!isUndefOrInRange(Mask[i], 8, 12))
3938 /// \brief Return true if the mask specifies a shuffle of elements that is
3939 /// suitable for input to intralane (palignr) or interlane (valign) vector
3941 static bool isAlignrMask(ArrayRef<int> Mask, MVT VT, bool InterLane) {
3942 unsigned NumElts = VT.getVectorNumElements();
3943 unsigned NumLanes = InterLane ? 1: VT.getSizeInBits()/128;
3944 unsigned NumLaneElts = NumElts/NumLanes;
3946 // Do not handle 64-bit element shuffles with palignr.
3947 if (NumLaneElts == 2)
3950 for (unsigned l = 0; l != NumElts; l+=NumLaneElts) {
3952 for (i = 0; i != NumLaneElts; ++i) {
3957 // Lane is all undef, go to next lane
3958 if (i == NumLaneElts)
3961 int Start = Mask[i+l];
3963 // Make sure its in this lane in one of the sources
3964 if (!isUndefOrInRange(Start, l, l+NumLaneElts) &&
3965 !isUndefOrInRange(Start, l+NumElts, l+NumElts+NumLaneElts))
3968 // If not lane 0, then we must match lane 0
3969 if (l != 0 && Mask[i] >= 0 && !isUndefOrEqual(Start, Mask[i]+l))
3972 // Correct second source to be contiguous with first source
3973 if (Start >= (int)NumElts)
3974 Start -= NumElts - NumLaneElts;
3976 // Make sure we're shifting in the right direction.
3977 if (Start <= (int)(i+l))
3982 // Check the rest of the elements to see if they are consecutive.
3983 for (++i; i != NumLaneElts; ++i) {
3984 int Idx = Mask[i+l];
3986 // Make sure its in this lane
3987 if (!isUndefOrInRange(Idx, l, l+NumLaneElts) &&
3988 !isUndefOrInRange(Idx, l+NumElts, l+NumElts+NumLaneElts))
3991 // If not lane 0, then we must match lane 0
3992 if (l != 0 && Mask[i] >= 0 && !isUndefOrEqual(Idx, Mask[i]+l))
3995 if (Idx >= (int)NumElts)
3996 Idx -= NumElts - NumLaneElts;
3998 if (!isUndefOrEqual(Idx, Start+i))
4007 /// \brief Return true if the node specifies a shuffle of elements that is
4008 /// suitable for input to PALIGNR.
4009 static bool isPALIGNRMask(ArrayRef<int> Mask, MVT VT,
4010 const X86Subtarget *Subtarget) {
4011 if ((VT.is128BitVector() && !Subtarget->hasSSSE3()) ||
4012 (VT.is256BitVector() && !Subtarget->hasInt256()) ||
4013 VT.is512BitVector())
4014 // FIXME: Add AVX512BW.
4017 return isAlignrMask(Mask, VT, false);
4020 /// \brief Return true if the node specifies a shuffle of elements that is
4021 /// suitable for input to VALIGN.
4022 static bool isVALIGNMask(ArrayRef<int> Mask, MVT VT,
4023 const X86Subtarget *Subtarget) {
4024 // FIXME: Add AVX512VL.
4025 if (!VT.is512BitVector() || !Subtarget->hasAVX512())
4027 return isAlignrMask(Mask, VT, true);
4030 /// CommuteVectorShuffleMask - Change values in a shuffle permute mask assuming
4031 /// the two vector operands have swapped position.
4032 static void CommuteVectorShuffleMask(SmallVectorImpl<int> &Mask,
4033 unsigned NumElems) {
4034 for (unsigned i = 0; i != NumElems; ++i) {
4038 else if (idx < (int)NumElems)
4039 Mask[i] = idx + NumElems;
4041 Mask[i] = idx - NumElems;
4045 /// isSHUFPMask - Return true if the specified VECTOR_SHUFFLE operand
4046 /// specifies a shuffle of elements that is suitable for input to 128/256-bit
4047 /// SHUFPS and SHUFPD. If Commuted is true, then it checks for sources to be
4048 /// reverse of what x86 shuffles want.
4049 static bool isSHUFPMask(ArrayRef<int> Mask, MVT VT, bool Commuted = false) {
4051 unsigned NumElems = VT.getVectorNumElements();
4052 unsigned NumLanes = VT.getSizeInBits()/128;
4053 unsigned NumLaneElems = NumElems/NumLanes;
4055 if (NumLaneElems != 2 && NumLaneElems != 4)
4058 unsigned EltSize = VT.getVectorElementType().getSizeInBits();
4059 bool symetricMaskRequired =
4060 (VT.getSizeInBits() >= 256) && (EltSize == 32);
4062 // VSHUFPSY divides the resulting vector into 4 chunks.
4063 // The sources are also splitted into 4 chunks, and each destination
4064 // chunk must come from a different source chunk.
4066 // SRC1 => X7 X6 X5 X4 X3 X2 X1 X0
4067 // SRC2 => Y7 Y6 Y5 Y4 Y3 Y2 Y1 Y9
4069 // DST => Y7..Y4, Y7..Y4, X7..X4, X7..X4,
4070 // Y3..Y0, Y3..Y0, X3..X0, X3..X0
4072 // VSHUFPDY divides the resulting vector into 4 chunks.
4073 // The sources are also splitted into 4 chunks, and each destination
4074 // chunk must come from a different source chunk.
4076 // SRC1 => X3 X2 X1 X0
4077 // SRC2 => Y3 Y2 Y1 Y0
4079 // DST => Y3..Y2, X3..X2, Y1..Y0, X1..X0
4081 SmallVector<int, 4> MaskVal(NumLaneElems, -1);
4082 unsigned HalfLaneElems = NumLaneElems/2;
4083 for (unsigned l = 0; l != NumElems; l += NumLaneElems) {
4084 for (unsigned i = 0; i != NumLaneElems; ++i) {
4085 int Idx = Mask[i+l];
4086 unsigned RngStart = l + ((Commuted == (i<HalfLaneElems)) ? NumElems : 0);
4087 if (!isUndefOrInRange(Idx, RngStart, RngStart+NumLaneElems))
4089 // For VSHUFPSY, the mask of the second half must be the same as the
4090 // first but with the appropriate offsets. This works in the same way as
4091 // VPERMILPS works with masks.
4092 if (!symetricMaskRequired || Idx < 0)
4094 if (MaskVal[i] < 0) {
4095 MaskVal[i] = Idx - l;
4098 if ((signed)(Idx - l) != MaskVal[i])
4106 /// isMOVHLPSMask - Return true if the specified VECTOR_SHUFFLE operand
4107 /// specifies a shuffle of elements that is suitable for input to MOVHLPS.
4108 static bool isMOVHLPSMask(ArrayRef<int> Mask, MVT VT) {
4109 if (!VT.is128BitVector())
4112 unsigned NumElems = VT.getVectorNumElements();
4117 // Expect bit0 == 6, bit1 == 7, bit2 == 2, bit3 == 3
4118 return isUndefOrEqual(Mask[0], 6) &&
4119 isUndefOrEqual(Mask[1], 7) &&
4120 isUndefOrEqual(Mask[2], 2) &&
4121 isUndefOrEqual(Mask[3], 3);
4124 /// isMOVHLPS_v_undef_Mask - Special case of isMOVHLPSMask for canonical form
4125 /// of vector_shuffle v, v, <2, 3, 2, 3>, i.e. vector_shuffle v, undef,
4127 static bool isMOVHLPS_v_undef_Mask(ArrayRef<int> Mask, MVT VT) {
4128 if (!VT.is128BitVector())
4131 unsigned NumElems = VT.getVectorNumElements();
4136 return isUndefOrEqual(Mask[0], 2) &&
4137 isUndefOrEqual(Mask[1], 3) &&
4138 isUndefOrEqual(Mask[2], 2) &&
4139 isUndefOrEqual(Mask[3], 3);
4142 /// isMOVLPMask - Return true if the specified VECTOR_SHUFFLE operand
4143 /// specifies a shuffle of elements that is suitable for input to MOVLP{S|D}.
4144 static bool isMOVLPMask(ArrayRef<int> Mask, MVT VT) {
4145 if (!VT.is128BitVector())
4148 unsigned NumElems = VT.getVectorNumElements();
4150 if (NumElems != 2 && NumElems != 4)
4153 for (unsigned i = 0, e = NumElems/2; i != e; ++i)
4154 if (!isUndefOrEqual(Mask[i], i + NumElems))
4157 for (unsigned i = NumElems/2, e = NumElems; i != e; ++i)
4158 if (!isUndefOrEqual(Mask[i], i))
4164 /// isMOVLHPSMask - Return true if the specified VECTOR_SHUFFLE operand
4165 /// specifies a shuffle of elements that is suitable for input to MOVLHPS.
4166 static bool isMOVLHPSMask(ArrayRef<int> Mask, MVT VT) {
4167 if (!VT.is128BitVector())
4170 unsigned NumElems = VT.getVectorNumElements();
4172 if (NumElems != 2 && NumElems != 4)
4175 for (unsigned i = 0, e = NumElems/2; i != e; ++i)
4176 if (!isUndefOrEqual(Mask[i], i))
4179 for (unsigned i = 0, e = NumElems/2; i != e; ++i)
4180 if (!isUndefOrEqual(Mask[i + e], i + NumElems))
4186 /// isINSERTPSMask - Return true if the specified VECTOR_SHUFFLE operand
4187 /// specifies a shuffle of elements that is suitable for input to INSERTPS.
4188 /// i. e: If all but one element come from the same vector.
4189 static bool isINSERTPSMask(ArrayRef<int> Mask, MVT VT) {
4190 // TODO: Deal with AVX's VINSERTPS
4191 if (!VT.is128BitVector() || (VT != MVT::v4f32 && VT != MVT::v4i32))
4194 unsigned CorrectPosV1 = 0;
4195 unsigned CorrectPosV2 = 0;
4196 for (int i = 0, e = (int)VT.getVectorNumElements(); i != e; ++i) {
4197 if (Mask[i] == -1) {
4205 else if (Mask[i] == i + 4)
4209 if (CorrectPosV1 == 3 || CorrectPosV2 == 3)
4210 // We have 3 elements (undefs count as elements from any vector) from one
4211 // vector, and one from another.
4218 // Some special combinations that can be optimized.
4221 SDValue Compact8x32ShuffleNode(ShuffleVectorSDNode *SVOp,
4222 SelectionDAG &DAG) {
4223 MVT VT = SVOp->getSimpleValueType(0);
4226 if (VT != MVT::v8i32 && VT != MVT::v8f32)
4229 ArrayRef<int> Mask = SVOp->getMask();
4231 // These are the special masks that may be optimized.
4232 static const int MaskToOptimizeEven[] = {0, 8, 2, 10, 4, 12, 6, 14};
4233 static const int MaskToOptimizeOdd[] = {1, 9, 3, 11, 5, 13, 7, 15};
4234 bool MatchEvenMask = true;
4235 bool MatchOddMask = true;
4236 for (int i=0; i<8; ++i) {
4237 if (!isUndefOrEqual(Mask[i], MaskToOptimizeEven[i]))
4238 MatchEvenMask = false;
4239 if (!isUndefOrEqual(Mask[i], MaskToOptimizeOdd[i]))
4240 MatchOddMask = false;
4243 if (!MatchEvenMask && !MatchOddMask)
4246 SDValue UndefNode = DAG.getNode(ISD::UNDEF, dl, VT);
4248 SDValue Op0 = SVOp->getOperand(0);
4249 SDValue Op1 = SVOp->getOperand(1);
4251 if (MatchEvenMask) {
4252 // Shift the second operand right to 32 bits.
4253 static const int ShiftRightMask[] = {-1, 0, -1, 2, -1, 4, -1, 6 };
4254 Op1 = DAG.getVectorShuffle(VT, dl, Op1, UndefNode, ShiftRightMask);
4256 // Shift the first operand left to 32 bits.
4257 static const int ShiftLeftMask[] = {1, -1, 3, -1, 5, -1, 7, -1 };
4258 Op0 = DAG.getVectorShuffle(VT, dl, Op0, UndefNode, ShiftLeftMask);
4260 static const int BlendMask[] = {0, 9, 2, 11, 4, 13, 6, 15};
4261 return DAG.getVectorShuffle(VT, dl, Op0, Op1, BlendMask);
4264 /// isUNPCKLMask - Return true if the specified VECTOR_SHUFFLE operand
4265 /// specifies a shuffle of elements that is suitable for input to UNPCKL.
4266 static bool isUNPCKLMask(ArrayRef<int> Mask, MVT VT,
4267 bool HasInt256, bool V2IsSplat = false) {
4269 assert(VT.getSizeInBits() >= 128 &&
4270 "Unsupported vector type for unpckl");
4272 unsigned NumElts = VT.getVectorNumElements();
4273 if (VT.is256BitVector() && NumElts != 4 && NumElts != 8 &&
4274 (!HasInt256 || (NumElts != 16 && NumElts != 32)))
4277 assert((!VT.is512BitVector() || VT.getScalarType().getSizeInBits() >= 32) &&
4278 "Unsupported vector type for unpckh");
4280 // AVX defines UNPCK* to operate independently on 128-bit lanes.
4281 unsigned NumLanes = VT.getSizeInBits()/128;
4282 unsigned NumLaneElts = NumElts/NumLanes;
4284 for (unsigned l = 0; l != NumElts; l += NumLaneElts) {
4285 for (unsigned i = 0, j = l; i != NumLaneElts; i += 2, ++j) {
4286 int BitI = Mask[l+i];
4287 int BitI1 = Mask[l+i+1];
4288 if (!isUndefOrEqual(BitI, j))
4291 if (!isUndefOrEqual(BitI1, NumElts))
4294 if (!isUndefOrEqual(BitI1, j + NumElts))
4303 /// isUNPCKHMask - Return true if the specified VECTOR_SHUFFLE operand
4304 /// specifies a shuffle of elements that is suitable for input to UNPCKH.
4305 static bool isUNPCKHMask(ArrayRef<int> Mask, MVT VT,
4306 bool HasInt256, bool V2IsSplat = false) {
4307 assert(VT.getSizeInBits() >= 128 &&
4308 "Unsupported vector type for unpckh");
4310 unsigned NumElts = VT.getVectorNumElements();
4311 if (VT.is256BitVector() && NumElts != 4 && NumElts != 8 &&
4312 (!HasInt256 || (NumElts != 16 && NumElts != 32)))
4315 assert((!VT.is512BitVector() || VT.getScalarType().getSizeInBits() >= 32) &&
4316 "Unsupported vector type for unpckh");
4318 // AVX defines UNPCK* to operate independently on 128-bit lanes.
4319 unsigned NumLanes = VT.getSizeInBits()/128;
4320 unsigned NumLaneElts = NumElts/NumLanes;
4322 for (unsigned l = 0; l != NumElts; l += NumLaneElts) {
4323 for (unsigned i = 0, j = l+NumLaneElts/2; i != NumLaneElts; i += 2, ++j) {
4324 int BitI = Mask[l+i];
4325 int BitI1 = Mask[l+i+1];
4326 if (!isUndefOrEqual(BitI, j))
4329 if (isUndefOrEqual(BitI1, NumElts))
4332 if (!isUndefOrEqual(BitI1, j+NumElts))
4340 /// isUNPCKL_v_undef_Mask - Special case of isUNPCKLMask for canonical form
4341 /// of vector_shuffle v, v, <0, 4, 1, 5>, i.e. vector_shuffle v, undef,
4343 static bool isUNPCKL_v_undef_Mask(ArrayRef<int> Mask, MVT VT, bool HasInt256) {
4344 unsigned NumElts = VT.getVectorNumElements();
4345 bool Is256BitVec = VT.is256BitVector();
4347 if (VT.is512BitVector())
4349 assert((VT.is128BitVector() || VT.is256BitVector()) &&
4350 "Unsupported vector type for unpckh");
4352 if (Is256BitVec && NumElts != 4 && NumElts != 8 &&
4353 (!HasInt256 || (NumElts != 16 && NumElts != 32)))
4356 // For 256-bit i64/f64, use MOVDDUPY instead, so reject the matching pattern
4357 // FIXME: Need a better way to get rid of this, there's no latency difference
4358 // between UNPCKLPD and MOVDDUP, the later should always be checked first and
4359 // the former later. We should also remove the "_undef" special mask.
4360 if (NumElts == 4 && Is256BitVec)
4363 // Handle 128 and 256-bit vector lengths. AVX defines UNPCK* to operate
4364 // independently on 128-bit lanes.
4365 unsigned NumLanes = VT.getSizeInBits()/128;
4366 unsigned NumLaneElts = NumElts/NumLanes;
4368 for (unsigned l = 0; l != NumElts; l += NumLaneElts) {
4369 for (unsigned i = 0, j = l; i != NumLaneElts; i += 2, ++j) {
4370 int BitI = Mask[l+i];
4371 int BitI1 = Mask[l+i+1];
4373 if (!isUndefOrEqual(BitI, j))
4375 if (!isUndefOrEqual(BitI1, j))
4383 /// isUNPCKH_v_undef_Mask - Special case of isUNPCKHMask for canonical form
4384 /// of vector_shuffle v, v, <2, 6, 3, 7>, i.e. vector_shuffle v, undef,
4386 static bool isUNPCKH_v_undef_Mask(ArrayRef<int> Mask, MVT VT, bool HasInt256) {
4387 unsigned NumElts = VT.getVectorNumElements();
4389 if (VT.is512BitVector())
4392 assert((VT.is128BitVector() || VT.is256BitVector()) &&
4393 "Unsupported vector type for unpckh");
4395 if (VT.is256BitVector() && NumElts != 4 && NumElts != 8 &&
4396 (!HasInt256 || (NumElts != 16 && NumElts != 32)))
4399 // Handle 128 and 256-bit vector lengths. AVX defines UNPCK* to operate
4400 // independently on 128-bit lanes.
4401 unsigned NumLanes = VT.getSizeInBits()/128;
4402 unsigned NumLaneElts = NumElts/NumLanes;
4404 for (unsigned l = 0; l != NumElts; l += NumLaneElts) {
4405 for (unsigned i = 0, j = l+NumLaneElts/2; i != NumLaneElts; i += 2, ++j) {
4406 int BitI = Mask[l+i];
4407 int BitI1 = Mask[l+i+1];
4408 if (!isUndefOrEqual(BitI, j))
4410 if (!isUndefOrEqual(BitI1, j))
4417 // Match for INSERTI64x4 INSERTF64x4 instructions (src0[0], src1[0]) or
4418 // (src1[0], src0[1]), manipulation with 256-bit sub-vectors
4419 static bool isINSERT64x4Mask(ArrayRef<int> Mask, MVT VT, unsigned int *Imm) {
4420 if (!VT.is512BitVector())
4423 unsigned NumElts = VT.getVectorNumElements();
4424 unsigned HalfSize = NumElts/2;
4425 if (isSequentialOrUndefInRange(Mask, 0, HalfSize, 0)) {
4426 if (isSequentialOrUndefInRange(Mask, HalfSize, HalfSize, NumElts)) {
4431 if (isSequentialOrUndefInRange(Mask, 0, HalfSize, NumElts)) {
4432 if (isSequentialOrUndefInRange(Mask, HalfSize, HalfSize, HalfSize)) {
4440 /// isMOVLMask - Return true if the specified VECTOR_SHUFFLE operand
4441 /// specifies a shuffle of elements that is suitable for input to MOVSS,
4442 /// MOVSD, and MOVD, i.e. setting the lowest element.
4443 static bool isMOVLMask(ArrayRef<int> Mask, EVT VT) {
4444 if (VT.getVectorElementType().getSizeInBits() < 32)
4446 if (!VT.is128BitVector())
4449 unsigned NumElts = VT.getVectorNumElements();
4451 if (!isUndefOrEqual(Mask[0], NumElts))
4454 for (unsigned i = 1; i != NumElts; ++i)
4455 if (!isUndefOrEqual(Mask[i], i))
4461 /// isVPERM2X128Mask - Match 256-bit shuffles where the elements are considered
4462 /// as permutations between 128-bit chunks or halves. As an example: this
4464 /// vector_shuffle <4, 5, 6, 7, 12, 13, 14, 15>
4465 /// The first half comes from the second half of V1 and the second half from the
4466 /// the second half of V2.
4467 static bool isVPERM2X128Mask(ArrayRef<int> Mask, MVT VT, bool HasFp256) {
4468 if (!HasFp256 || !VT.is256BitVector())
4471 // The shuffle result is divided into half A and half B. In total the two
4472 // sources have 4 halves, namely: C, D, E, F. The final values of A and
4473 // B must come from C, D, E or F.
4474 unsigned HalfSize = VT.getVectorNumElements()/2;
4475 bool MatchA = false, MatchB = false;
4477 // Check if A comes from one of C, D, E, F.
4478 for (unsigned Half = 0; Half != 4; ++Half) {
4479 if (isSequentialOrUndefInRange(Mask, 0, HalfSize, Half*HalfSize)) {
4485 // Check if B comes from one of C, D, E, F.
4486 for (unsigned Half = 0; Half != 4; ++Half) {
4487 if (isSequentialOrUndefInRange(Mask, HalfSize, HalfSize, Half*HalfSize)) {
4493 return MatchA && MatchB;
4496 /// getShuffleVPERM2X128Immediate - Return the appropriate immediate to shuffle
4497 /// the specified VECTOR_MASK mask with VPERM2F128/VPERM2I128 instructions.
4498 static unsigned getShuffleVPERM2X128Immediate(ShuffleVectorSDNode *SVOp) {
4499 MVT VT = SVOp->getSimpleValueType(0);
4501 unsigned HalfSize = VT.getVectorNumElements()/2;
4503 unsigned FstHalf = 0, SndHalf = 0;
4504 for (unsigned i = 0; i < HalfSize; ++i) {
4505 if (SVOp->getMaskElt(i) > 0) {
4506 FstHalf = SVOp->getMaskElt(i)/HalfSize;
4510 for (unsigned i = HalfSize; i < HalfSize*2; ++i) {
4511 if (SVOp->getMaskElt(i) > 0) {
4512 SndHalf = SVOp->getMaskElt(i)/HalfSize;
4517 return (FstHalf | (SndHalf << 4));
4520 // Symetric in-lane mask. Each lane has 4 elements (for imm8)
4521 static bool isPermImmMask(ArrayRef<int> Mask, MVT VT, unsigned& Imm8) {
4522 unsigned EltSize = VT.getVectorElementType().getSizeInBits();
4526 unsigned NumElts = VT.getVectorNumElements();
4528 if (VT.is128BitVector() || (VT.is256BitVector() && EltSize == 64)) {
4529 for (unsigned i = 0; i != NumElts; ++i) {
4532 Imm8 |= Mask[i] << (i*2);
4537 unsigned LaneSize = 4;
4538 SmallVector<int, 4> MaskVal(LaneSize, -1);
4540 for (unsigned l = 0; l != NumElts; l += LaneSize) {
4541 for (unsigned i = 0; i != LaneSize; ++i) {
4542 if (!isUndefOrInRange(Mask[i+l], l, l+LaneSize))
4546 if (MaskVal[i] < 0) {
4547 MaskVal[i] = Mask[i+l] - l;
4548 Imm8 |= MaskVal[i] << (i*2);
4551 if (Mask[i+l] != (signed)(MaskVal[i]+l))
4558 /// isVPERMILPMask - Return true if the specified VECTOR_SHUFFLE operand
4559 /// specifies a shuffle of elements that is suitable for input to VPERMILPD*.
4560 /// Note that VPERMIL mask matching is different depending whether theunderlying
4561 /// type is 32 or 64. In the VPERMILPS the high half of the mask should point
4562 /// to the same elements of the low, but to the higher half of the source.
4563 /// In VPERMILPD the two lanes could be shuffled independently of each other
4564 /// with the same restriction that lanes can't be crossed. Also handles PSHUFDY.
4565 static bool isVPERMILPMask(ArrayRef<int> Mask, MVT VT) {
4566 unsigned EltSize = VT.getVectorElementType().getSizeInBits();
4567 if (VT.getSizeInBits() < 256 || EltSize < 32)
4569 bool symetricMaskRequired = (EltSize == 32);
4570 unsigned NumElts = VT.getVectorNumElements();
4572 unsigned NumLanes = VT.getSizeInBits()/128;
4573 unsigned LaneSize = NumElts/NumLanes;
4574 // 2 or 4 elements in one lane
4576 SmallVector<int, 4> ExpectedMaskVal(LaneSize, -1);
4577 for (unsigned l = 0; l != NumElts; l += LaneSize) {
4578 for (unsigned i = 0; i != LaneSize; ++i) {
4579 if (!isUndefOrInRange(Mask[i+l], l, l+LaneSize))
4581 if (symetricMaskRequired) {
4582 if (ExpectedMaskVal[i] < 0 && Mask[i+l] >= 0) {
4583 ExpectedMaskVal[i] = Mask[i+l] - l;
4586 if (!isUndefOrEqual(Mask[i+l], ExpectedMaskVal[i]+l))
4594 /// isCommutedMOVLMask - Returns true if the shuffle mask is except the reverse
4595 /// of what x86 movss want. X86 movs requires the lowest element to be lowest
4596 /// element of vector 2 and the other elements to come from vector 1 in order.
4597 static bool isCommutedMOVLMask(ArrayRef<int> Mask, MVT VT,
4598 bool V2IsSplat = false, bool V2IsUndef = false) {
4599 if (!VT.is128BitVector())
4602 unsigned NumOps = VT.getVectorNumElements();
4603 if (NumOps != 2 && NumOps != 4 && NumOps != 8 && NumOps != 16)
4606 if (!isUndefOrEqual(Mask[0], 0))
4609 for (unsigned i = 1; i != NumOps; ++i)
4610 if (!(isUndefOrEqual(Mask[i], i+NumOps) ||
4611 (V2IsUndef && isUndefOrInRange(Mask[i], NumOps, NumOps*2)) ||
4612 (V2IsSplat && isUndefOrEqual(Mask[i], NumOps))))
4618 /// isMOVSHDUPMask - Return true if the specified VECTOR_SHUFFLE operand
4619 /// specifies a shuffle of elements that is suitable for input to MOVSHDUP.
4620 /// Masks to match: <1, 1, 3, 3> or <1, 1, 3, 3, 5, 5, 7, 7>
4621 static bool isMOVSHDUPMask(ArrayRef<int> Mask, MVT VT,
4622 const X86Subtarget *Subtarget) {
4623 if (!Subtarget->hasSSE3())
4626 unsigned NumElems = VT.getVectorNumElements();
4628 if ((VT.is128BitVector() && NumElems != 4) ||
4629 (VT.is256BitVector() && NumElems != 8) ||
4630 (VT.is512BitVector() && NumElems != 16))
4633 // "i+1" is the value the indexed mask element must have
4634 for (unsigned i = 0; i != NumElems; i += 2)
4635 if (!isUndefOrEqual(Mask[i], i+1) ||
4636 !isUndefOrEqual(Mask[i+1], i+1))
4642 /// isMOVSLDUPMask - Return true if the specified VECTOR_SHUFFLE operand
4643 /// specifies a shuffle of elements that is suitable for input to MOVSLDUP.
4644 /// Masks to match: <0, 0, 2, 2> or <0, 0, 2, 2, 4, 4, 6, 6>
4645 static bool isMOVSLDUPMask(ArrayRef<int> Mask, MVT VT,
4646 const X86Subtarget *Subtarget) {
4647 if (!Subtarget->hasSSE3())
4650 unsigned NumElems = VT.getVectorNumElements();
4652 if ((VT.is128BitVector() && NumElems != 4) ||
4653 (VT.is256BitVector() && NumElems != 8) ||
4654 (VT.is512BitVector() && NumElems != 16))
4657 // "i" is the value the indexed mask element must have
4658 for (unsigned i = 0; i != NumElems; i += 2)
4659 if (!isUndefOrEqual(Mask[i], i) ||
4660 !isUndefOrEqual(Mask[i+1], i))
4666 /// isMOVDDUPYMask - Return true if the specified VECTOR_SHUFFLE operand
4667 /// specifies a shuffle of elements that is suitable for input to 256-bit
4668 /// version of MOVDDUP.
4669 static bool isMOVDDUPYMask(ArrayRef<int> Mask, MVT VT, bool HasFp256) {
4670 if (!HasFp256 || !VT.is256BitVector())
4673 unsigned NumElts = VT.getVectorNumElements();
4677 for (unsigned i = 0; i != NumElts/2; ++i)
4678 if (!isUndefOrEqual(Mask[i], 0))
4680 for (unsigned i = NumElts/2; i != NumElts; ++i)
4681 if (!isUndefOrEqual(Mask[i], NumElts/2))
4686 /// isMOVDDUPMask - Return true if the specified VECTOR_SHUFFLE operand
4687 /// specifies a shuffle of elements that is suitable for input to 128-bit
4688 /// version of MOVDDUP.
4689 static bool isMOVDDUPMask(ArrayRef<int> Mask, MVT VT) {
4690 if (!VT.is128BitVector())
4693 unsigned e = VT.getVectorNumElements() / 2;
4694 for (unsigned i = 0; i != e; ++i)
4695 if (!isUndefOrEqual(Mask[i], i))
4697 for (unsigned i = 0; i != e; ++i)
4698 if (!isUndefOrEqual(Mask[e+i], i))
4703 /// isVEXTRACTIndex - Return true if the specified
4704 /// EXTRACT_SUBVECTOR operand specifies a vector extract that is
4705 /// suitable for instruction that extract 128 or 256 bit vectors
4706 static bool isVEXTRACTIndex(SDNode *N, unsigned vecWidth) {
4707 assert((vecWidth == 128 || vecWidth == 256) && "Unexpected vector width");
4708 if (!isa<ConstantSDNode>(N->getOperand(1).getNode()))
4711 // The index should be aligned on a vecWidth-bit boundary.
4713 cast<ConstantSDNode>(N->getOperand(1).getNode())->getZExtValue();
4715 MVT VT = N->getSimpleValueType(0);
4716 unsigned ElSize = VT.getVectorElementType().getSizeInBits();
4717 bool Result = (Index * ElSize) % vecWidth == 0;
4722 /// isVINSERTIndex - Return true if the specified INSERT_SUBVECTOR
4723 /// operand specifies a subvector insert that is suitable for input to
4724 /// insertion of 128 or 256-bit subvectors
4725 static bool isVINSERTIndex(SDNode *N, unsigned vecWidth) {
4726 assert((vecWidth == 128 || vecWidth == 256) && "Unexpected vector width");
4727 if (!isa<ConstantSDNode>(N->getOperand(2).getNode()))
4729 // The index should be aligned on a vecWidth-bit boundary.
4731 cast<ConstantSDNode>(N->getOperand(2).getNode())->getZExtValue();
4733 MVT VT = N->getSimpleValueType(0);
4734 unsigned ElSize = VT.getVectorElementType().getSizeInBits();
4735 bool Result = (Index * ElSize) % vecWidth == 0;
4740 bool X86::isVINSERT128Index(SDNode *N) {
4741 return isVINSERTIndex(N, 128);
4744 bool X86::isVINSERT256Index(SDNode *N) {
4745 return isVINSERTIndex(N, 256);
4748 bool X86::isVEXTRACT128Index(SDNode *N) {
4749 return isVEXTRACTIndex(N, 128);
4752 bool X86::isVEXTRACT256Index(SDNode *N) {
4753 return isVEXTRACTIndex(N, 256);
4756 /// getShuffleSHUFImmediate - Return the appropriate immediate to shuffle
4757 /// the specified VECTOR_SHUFFLE mask with PSHUF* and SHUFP* instructions.
4758 /// Handles 128-bit and 256-bit.
4759 static unsigned getShuffleSHUFImmediate(ShuffleVectorSDNode *N) {
4760 MVT VT = N->getSimpleValueType(0);
4762 assert((VT.getSizeInBits() >= 128) &&
4763 "Unsupported vector type for PSHUF/SHUFP");
4765 // Handle 128 and 256-bit vector lengths. AVX defines PSHUF/SHUFP to operate
4766 // independently on 128-bit lanes.
4767 unsigned NumElts = VT.getVectorNumElements();
4768 unsigned NumLanes = VT.getSizeInBits()/128;
4769 unsigned NumLaneElts = NumElts/NumLanes;
4771 assert((NumLaneElts == 2 || NumLaneElts == 4 || NumLaneElts == 8) &&
4772 "Only supports 2, 4 or 8 elements per lane");
4774 unsigned Shift = (NumLaneElts >= 4) ? 1 : 0;
4776 for (unsigned i = 0; i != NumElts; ++i) {
4777 int Elt = N->getMaskElt(i);
4778 if (Elt < 0) continue;
4779 Elt &= NumLaneElts - 1;
4780 unsigned ShAmt = (i << Shift) % 8;
4781 Mask |= Elt << ShAmt;
4787 /// getShufflePSHUFHWImmediate - Return the appropriate immediate to shuffle
4788 /// the specified VECTOR_SHUFFLE mask with the PSHUFHW instruction.
4789 static unsigned getShufflePSHUFHWImmediate(ShuffleVectorSDNode *N) {
4790 MVT VT = N->getSimpleValueType(0);
4792 assert((VT == MVT::v8i16 || VT == MVT::v16i16) &&
4793 "Unsupported vector type for PSHUFHW");
4795 unsigned NumElts = VT.getVectorNumElements();
4798 for (unsigned l = 0; l != NumElts; l += 8) {
4799 // 8 nodes per lane, but we only care about the last 4.
4800 for (unsigned i = 0; i < 4; ++i) {
4801 int Elt = N->getMaskElt(l+i+4);
4802 if (Elt < 0) continue;
4803 Elt &= 0x3; // only 2-bits.
4804 Mask |= Elt << (i * 2);
4811 /// getShufflePSHUFLWImmediate - Return the appropriate immediate to shuffle
4812 /// the specified VECTOR_SHUFFLE mask with the PSHUFLW instruction.
4813 static unsigned getShufflePSHUFLWImmediate(ShuffleVectorSDNode *N) {
4814 MVT VT = N->getSimpleValueType(0);
4816 assert((VT == MVT::v8i16 || VT == MVT::v16i16) &&
4817 "Unsupported vector type for PSHUFHW");
4819 unsigned NumElts = VT.getVectorNumElements();
4822 for (unsigned l = 0; l != NumElts; l += 8) {
4823 // 8 nodes per lane, but we only care about the first 4.
4824 for (unsigned i = 0; i < 4; ++i) {
4825 int Elt = N->getMaskElt(l+i);
4826 if (Elt < 0) continue;
4827 Elt &= 0x3; // only 2-bits
4828 Mask |= Elt << (i * 2);
4835 /// \brief Return the appropriate immediate to shuffle the specified
4836 /// VECTOR_SHUFFLE mask with the PALIGNR (if InterLane is false) or with
4837 /// VALIGN (if Interlane is true) instructions.
4838 static unsigned getShuffleAlignrImmediate(ShuffleVectorSDNode *SVOp,
4840 MVT VT = SVOp->getSimpleValueType(0);
4841 unsigned EltSize = InterLane ? 1 :
4842 VT.getVectorElementType().getSizeInBits() >> 3;
4844 unsigned NumElts = VT.getVectorNumElements();
4845 unsigned NumLanes = VT.is512BitVector() ? 1 : VT.getSizeInBits()/128;
4846 unsigned NumLaneElts = NumElts/NumLanes;
4850 for (i = 0; i != NumElts; ++i) {
4851 Val = SVOp->getMaskElt(i);
4855 if (Val >= (int)NumElts)
4856 Val -= NumElts - NumLaneElts;
4858 assert(Val - i > 0 && "PALIGNR imm should be positive");
4859 return (Val - i) * EltSize;
4862 /// \brief Return the appropriate immediate to shuffle the specified
4863 /// VECTOR_SHUFFLE mask with the PALIGNR instruction.
4864 static unsigned getShufflePALIGNRImmediate(ShuffleVectorSDNode *SVOp) {
4865 return getShuffleAlignrImmediate(SVOp, false);
4868 /// \brief Return the appropriate immediate to shuffle the specified
4869 /// VECTOR_SHUFFLE mask with the VALIGN instruction.
4870 static unsigned getShuffleVALIGNImmediate(ShuffleVectorSDNode *SVOp) {
4871 return getShuffleAlignrImmediate(SVOp, true);
4875 static unsigned getExtractVEXTRACTImmediate(SDNode *N, unsigned vecWidth) {
4876 assert((vecWidth == 128 || vecWidth == 256) && "Unsupported vector width");
4877 if (!isa<ConstantSDNode>(N->getOperand(1).getNode()))
4878 llvm_unreachable("Illegal extract subvector for VEXTRACT");
4881 cast<ConstantSDNode>(N->getOperand(1).getNode())->getZExtValue();
4883 MVT VecVT = N->getOperand(0).getSimpleValueType();
4884 MVT ElVT = VecVT.getVectorElementType();
4886 unsigned NumElemsPerChunk = vecWidth / ElVT.getSizeInBits();
4887 return Index / NumElemsPerChunk;
4890 static unsigned getInsertVINSERTImmediate(SDNode *N, unsigned vecWidth) {
4891 assert((vecWidth == 128 || vecWidth == 256) && "Unsupported vector width");
4892 if (!isa<ConstantSDNode>(N->getOperand(2).getNode()))
4893 llvm_unreachable("Illegal insert subvector for VINSERT");
4896 cast<ConstantSDNode>(N->getOperand(2).getNode())->getZExtValue();
4898 MVT VecVT = N->getSimpleValueType(0);
4899 MVT ElVT = VecVT.getVectorElementType();
4901 unsigned NumElemsPerChunk = vecWidth / ElVT.getSizeInBits();
4902 return Index / NumElemsPerChunk;
4905 /// getExtractVEXTRACT128Immediate - Return the appropriate immediate
4906 /// to extract the specified EXTRACT_SUBVECTOR index with VEXTRACTF128
4907 /// and VINSERTI128 instructions.
4908 unsigned X86::getExtractVEXTRACT128Immediate(SDNode *N) {
4909 return getExtractVEXTRACTImmediate(N, 128);
4912 /// getExtractVEXTRACT256Immediate - Return the appropriate immediate
4913 /// to extract the specified EXTRACT_SUBVECTOR index with VEXTRACTF64x4
4914 /// and VINSERTI64x4 instructions.
4915 unsigned X86::getExtractVEXTRACT256Immediate(SDNode *N) {
4916 return getExtractVEXTRACTImmediate(N, 256);
4919 /// getInsertVINSERT128Immediate - Return the appropriate immediate
4920 /// to insert at the specified INSERT_SUBVECTOR index with VINSERTF128
4921 /// and VINSERTI128 instructions.
4922 unsigned X86::getInsertVINSERT128Immediate(SDNode *N) {
4923 return getInsertVINSERTImmediate(N, 128);
4926 /// getInsertVINSERT256Immediate - Return the appropriate immediate
4927 /// to insert at the specified INSERT_SUBVECTOR index with VINSERTF46x4
4928 /// and VINSERTI64x4 instructions.
4929 unsigned X86::getInsertVINSERT256Immediate(SDNode *N) {
4930 return getInsertVINSERTImmediate(N, 256);
4933 /// isZero - Returns true if Elt is a constant integer zero
4934 static bool isZero(SDValue V) {
4935 ConstantSDNode *C = dyn_cast<ConstantSDNode>(V);
4936 return C && C->isNullValue();
4939 /// isZeroNode - Returns true if Elt is a constant zero or a floating point
4941 bool X86::isZeroNode(SDValue Elt) {
4944 if (ConstantFPSDNode *CFP = dyn_cast<ConstantFPSDNode>(Elt))
4945 return CFP->getValueAPF().isPosZero();
4949 /// ShouldXformToMOVHLPS - Return true if the node should be transformed to
4950 /// match movhlps. The lower half elements should come from upper half of
4951 /// V1 (and in order), and the upper half elements should come from the upper
4952 /// half of V2 (and in order).
4953 static bool ShouldXformToMOVHLPS(ArrayRef<int> Mask, MVT VT) {
4954 if (!VT.is128BitVector())
4956 if (VT.getVectorNumElements() != 4)
4958 for (unsigned i = 0, e = 2; i != e; ++i)
4959 if (!isUndefOrEqual(Mask[i], i+2))
4961 for (unsigned i = 2; i != 4; ++i)
4962 if (!isUndefOrEqual(Mask[i], i+4))
4967 /// isScalarLoadToVector - Returns true if the node is a scalar load that
4968 /// is promoted to a vector. It also returns the LoadSDNode by reference if
4970 static bool isScalarLoadToVector(SDNode *N, LoadSDNode **LD = nullptr) {
4971 if (N->getOpcode() != ISD::SCALAR_TO_VECTOR)
4973 N = N->getOperand(0).getNode();
4974 if (!ISD::isNON_EXTLoad(N))
4977 *LD = cast<LoadSDNode>(N);
4981 // Test whether the given value is a vector value which will be legalized
4983 static bool WillBeConstantPoolLoad(SDNode *N) {
4984 if (N->getOpcode() != ISD::BUILD_VECTOR)
4987 // Check for any non-constant elements.
4988 for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i)
4989 switch (N->getOperand(i).getNode()->getOpcode()) {
4991 case ISD::ConstantFP:
4998 // Vectors of all-zeros and all-ones are materialized with special
4999 // instructions rather than being loaded.
5000 return !ISD::isBuildVectorAllZeros(N) &&
5001 !ISD::isBuildVectorAllOnes(N);
5004 /// ShouldXformToMOVLP{S|D} - Return true if the node should be transformed to
5005 /// match movlp{s|d}. The lower half elements should come from lower half of
5006 /// V1 (and in order), and the upper half elements should come from the upper
5007 /// half of V2 (and in order). And since V1 will become the source of the
5008 /// MOVLP, it must be either a vector load or a scalar load to vector.
5009 static bool ShouldXformToMOVLP(SDNode *V1, SDNode *V2,
5010 ArrayRef<int> Mask, MVT VT) {
5011 if (!VT.is128BitVector())
5014 if (!ISD::isNON_EXTLoad(V1) && !isScalarLoadToVector(V1))
5016 // Is V2 is a vector load, don't do this transformation. We will try to use
5017 // load folding shufps op.
5018 if (ISD::isNON_EXTLoad(V2) || WillBeConstantPoolLoad(V2))
5021 unsigned NumElems = VT.getVectorNumElements();
5023 if (NumElems != 2 && NumElems != 4)
5025 for (unsigned i = 0, e = NumElems/2; i != e; ++i)
5026 if (!isUndefOrEqual(Mask[i], i))
5028 for (unsigned i = NumElems/2, e = NumElems; i != e; ++i)
5029 if (!isUndefOrEqual(Mask[i], i+NumElems))
5034 /// isZeroShuffle - Returns true if N is a VECTOR_SHUFFLE that can be resolved
5035 /// to an zero vector.
5036 /// FIXME: move to dag combiner / method on ShuffleVectorSDNode
5037 static bool isZeroShuffle(ShuffleVectorSDNode *N) {
5038 SDValue V1 = N->getOperand(0);
5039 SDValue V2 = N->getOperand(1);
5040 unsigned NumElems = N->getValueType(0).getVectorNumElements();
5041 for (unsigned i = 0; i != NumElems; ++i) {
5042 int Idx = N->getMaskElt(i);
5043 if (Idx >= (int)NumElems) {
5044 unsigned Opc = V2.getOpcode();
5045 if (Opc == ISD::UNDEF || ISD::isBuildVectorAllZeros(V2.getNode()))
5047 if (Opc != ISD::BUILD_VECTOR ||
5048 !X86::isZeroNode(V2.getOperand(Idx-NumElems)))
5050 } else if (Idx >= 0) {
5051 unsigned Opc = V1.getOpcode();
5052 if (Opc == ISD::UNDEF || ISD::isBuildVectorAllZeros(V1.getNode()))
5054 if (Opc != ISD::BUILD_VECTOR ||
5055 !X86::isZeroNode(V1.getOperand(Idx)))
5062 /// getZeroVector - Returns a vector of specified type with all zero elements.
5064 static SDValue getZeroVector(EVT VT, const X86Subtarget *Subtarget,
5065 SelectionDAG &DAG, SDLoc dl) {
5066 assert(VT.isVector() && "Expected a vector type");
5068 // Always build SSE zero vectors as <4 x i32> bitcasted
5069 // to their dest type. This ensures they get CSE'd.
5071 if (VT.is128BitVector()) { // SSE
5072 if (Subtarget->hasSSE2()) { // SSE2
5073 SDValue Cst = DAG.getTargetConstant(0, MVT::i32);
5074 Vec = DAG.getNode(ISD::BUILD_VECTOR, dl, MVT::v4i32, Cst, Cst, Cst, Cst);
5076 SDValue Cst = DAG.getTargetConstantFP(+0.0, MVT::f32);
5077 Vec = DAG.getNode(ISD::BUILD_VECTOR, dl, MVT::v4f32, Cst, Cst, Cst, Cst);
5079 } else if (VT.is256BitVector()) { // AVX
5080 if (Subtarget->hasInt256()) { // AVX2
5081 SDValue Cst = DAG.getTargetConstant(0, MVT::i32);
5082 SDValue Ops[] = { Cst, Cst, Cst, Cst, Cst, Cst, Cst, Cst };
5083 Vec = DAG.getNode(ISD::BUILD_VECTOR, dl, MVT::v8i32, Ops);
5085 // 256-bit logic and arithmetic instructions in AVX are all
5086 // floating-point, no support for integer ops. Emit fp zeroed vectors.
5087 SDValue Cst = DAG.getTargetConstantFP(+0.0, MVT::f32);
5088 SDValue Ops[] = { Cst, Cst, Cst, Cst, Cst, Cst, Cst, Cst };
5089 Vec = DAG.getNode(ISD::BUILD_VECTOR, dl, MVT::v8f32, Ops);
5091 } else if (VT.is512BitVector()) { // AVX-512
5092 SDValue Cst = DAG.getTargetConstant(0, MVT::i32);
5093 SDValue Ops[] = { Cst, Cst, Cst, Cst, Cst, Cst, Cst, Cst,
5094 Cst, Cst, Cst, Cst, Cst, Cst, Cst, Cst };
5095 Vec = DAG.getNode(ISD::BUILD_VECTOR, dl, MVT::v16i32, Ops);
5096 } else if (VT.getScalarType() == MVT::i1) {
5097 assert(VT.getVectorNumElements() <= 16 && "Unexpected vector type");
5098 SDValue Cst = DAG.getTargetConstant(0, MVT::i1);
5099 SmallVector<SDValue, 16> Ops(VT.getVectorNumElements(), Cst);
5100 return DAG.getNode(ISD::BUILD_VECTOR, dl, VT, Ops);
5102 llvm_unreachable("Unexpected vector type");
5104 return DAG.getNode(ISD::BITCAST, dl, VT, Vec);
5107 /// getOnesVector - Returns a vector of specified type with all bits set.
5108 /// Always build ones vectors as <4 x i32> or <8 x i32>. For 256-bit types with
5109 /// no AVX2 supprt, use two <4 x i32> inserted in a <8 x i32> appropriately.
5110 /// Then bitcast to their original type, ensuring they get CSE'd.
5111 static SDValue getOnesVector(MVT VT, bool HasInt256, SelectionDAG &DAG,
5113 assert(VT.isVector() && "Expected a vector type");
5115 SDValue Cst = DAG.getTargetConstant(~0U, MVT::i32);
5117 if (VT.is256BitVector()) {
5118 if (HasInt256) { // AVX2
5119 SDValue Ops[] = { Cst, Cst, Cst, Cst, Cst, Cst, Cst, Cst };
5120 Vec = DAG.getNode(ISD::BUILD_VECTOR, dl, MVT::v8i32, Ops);
5122 Vec = DAG.getNode(ISD::BUILD_VECTOR, dl, MVT::v4i32, Cst, Cst, Cst, Cst);
5123 Vec = Concat128BitVectors(Vec, Vec, MVT::v8i32, 8, DAG, dl);
5125 } else if (VT.is128BitVector()) {
5126 Vec = DAG.getNode(ISD::BUILD_VECTOR, dl, MVT::v4i32, Cst, Cst, Cst, Cst);
5128 llvm_unreachable("Unexpected vector type");
5130 return DAG.getNode(ISD::BITCAST, dl, VT, Vec);
5133 /// NormalizeMask - V2 is a splat, modify the mask (if needed) so all elements
5134 /// that point to V2 points to its first element.
5135 static void NormalizeMask(SmallVectorImpl<int> &Mask, unsigned NumElems) {
5136 for (unsigned i = 0; i != NumElems; ++i) {
5137 if (Mask[i] > (int)NumElems) {
5143 /// getMOVLMask - Returns a vector_shuffle mask for an movs{s|d}, movd
5144 /// operation of specified width.
5145 static SDValue getMOVL(SelectionDAG &DAG, SDLoc dl, EVT VT, SDValue V1,
5147 unsigned NumElems = VT.getVectorNumElements();
5148 SmallVector<int, 8> Mask;
5149 Mask.push_back(NumElems);
5150 for (unsigned i = 1; i != NumElems; ++i)
5152 return DAG.getVectorShuffle(VT, dl, V1, V2, &Mask[0]);
5155 /// getUnpackl - Returns a vector_shuffle node for an unpackl operation.
5156 static SDValue getUnpackl(SelectionDAG &DAG, SDLoc dl, MVT VT, SDValue V1,
5158 unsigned NumElems = VT.getVectorNumElements();
5159 SmallVector<int, 8> Mask;
5160 for (unsigned i = 0, e = NumElems/2; i != e; ++i) {
5162 Mask.push_back(i + NumElems);
5164 return DAG.getVectorShuffle(VT, dl, V1, V2, &Mask[0]);
5167 /// getUnpackh - Returns a vector_shuffle node for an unpackh operation.
5168 static SDValue getUnpackh(SelectionDAG &DAG, SDLoc dl, MVT VT, SDValue V1,
5170 unsigned NumElems = VT.getVectorNumElements();
5171 SmallVector<int, 8> Mask;
5172 for (unsigned i = 0, Half = NumElems/2; i != Half; ++i) {
5173 Mask.push_back(i + Half);
5174 Mask.push_back(i + NumElems + Half);
5176 return DAG.getVectorShuffle(VT, dl, V1, V2, &Mask[0]);
5179 // PromoteSplati8i16 - All i16 and i8 vector types can't be used directly by
5180 // a generic shuffle instruction because the target has no such instructions.
5181 // Generate shuffles which repeat i16 and i8 several times until they can be
5182 // represented by v4f32 and then be manipulated by target suported shuffles.
5183 static SDValue PromoteSplati8i16(SDValue V, SelectionDAG &DAG, int &EltNo) {
5184 MVT VT = V.getSimpleValueType();
5185 int NumElems = VT.getVectorNumElements();
5188 while (NumElems > 4) {
5189 if (EltNo < NumElems/2) {
5190 V = getUnpackl(DAG, dl, VT, V, V);
5192 V = getUnpackh(DAG, dl, VT, V, V);
5193 EltNo -= NumElems/2;
5200 /// getLegalSplat - Generate a legal splat with supported x86 shuffles
5201 static SDValue getLegalSplat(SelectionDAG &DAG, SDValue V, int EltNo) {
5202 MVT VT = V.getSimpleValueType();
5205 if (VT.is128BitVector()) {
5206 V = DAG.getNode(ISD::BITCAST, dl, MVT::v4f32, V);
5207 int SplatMask[4] = { EltNo, EltNo, EltNo, EltNo };
5208 V = DAG.getVectorShuffle(MVT::v4f32, dl, V, DAG.getUNDEF(MVT::v4f32),
5210 } else if (VT.is256BitVector()) {
5211 // To use VPERMILPS to splat scalars, the second half of indicies must
5212 // refer to the higher part, which is a duplication of the lower one,
5213 // because VPERMILPS can only handle in-lane permutations.
5214 int SplatMask[8] = { EltNo, EltNo, EltNo, EltNo,
5215 EltNo+4, EltNo+4, EltNo+4, EltNo+4 };
5217 V = DAG.getNode(ISD::BITCAST, dl, MVT::v8f32, V);
5218 V = DAG.getVectorShuffle(MVT::v8f32, dl, V, DAG.getUNDEF(MVT::v8f32),
5221 llvm_unreachable("Vector size not supported");
5223 return DAG.getNode(ISD::BITCAST, dl, VT, V);
5226 /// PromoteSplat - Splat is promoted to target supported vector shuffles.
5227 static SDValue PromoteSplat(ShuffleVectorSDNode *SV, SelectionDAG &DAG) {
5228 MVT SrcVT = SV->getSimpleValueType(0);
5229 SDValue V1 = SV->getOperand(0);
5232 int EltNo = SV->getSplatIndex();
5233 int NumElems = SrcVT.getVectorNumElements();
5234 bool Is256BitVec = SrcVT.is256BitVector();
5236 assert(((SrcVT.is128BitVector() && NumElems > 4) || Is256BitVec) &&
5237 "Unknown how to promote splat for type");
5239 // Extract the 128-bit part containing the splat element and update
5240 // the splat element index when it refers to the higher register.
5242 V1 = Extract128BitVector(V1, EltNo, DAG, dl);
5243 if (EltNo >= NumElems/2)
5244 EltNo -= NumElems/2;
5247 // All i16 and i8 vector types can't be used directly by a generic shuffle
5248 // instruction because the target has no such instruction. Generate shuffles
5249 // which repeat i16 and i8 several times until they fit in i32, and then can
5250 // be manipulated by target suported shuffles.
5251 MVT EltVT = SrcVT.getVectorElementType();
5252 if (EltVT == MVT::i8 || EltVT == MVT::i16)
5253 V1 = PromoteSplati8i16(V1, DAG, EltNo);
5255 // Recreate the 256-bit vector and place the same 128-bit vector
5256 // into the low and high part. This is necessary because we want
5257 // to use VPERM* to shuffle the vectors
5259 V1 = DAG.getNode(ISD::CONCAT_VECTORS, dl, SrcVT, V1, V1);
5262 return getLegalSplat(DAG, V1, EltNo);
5265 /// getShuffleVectorZeroOrUndef - Return a vector_shuffle of the specified
5266 /// vector of zero or undef vector. This produces a shuffle where the low
5267 /// element of V2 is swizzled into the zero/undef vector, landing at element
5268 /// Idx. This produces a shuffle mask like 4,1,2,3 (idx=0) or 0,1,2,4 (idx=3).
5269 static SDValue getShuffleVectorZeroOrUndef(SDValue V2, unsigned Idx,
5271 const X86Subtarget *Subtarget,
5272 SelectionDAG &DAG) {
5273 MVT VT = V2.getSimpleValueType();
5275 ? getZeroVector(VT, Subtarget, DAG, SDLoc(V2)) : DAG.getUNDEF(VT);
5276 unsigned NumElems = VT.getVectorNumElements();
5277 SmallVector<int, 16> MaskVec;
5278 for (unsigned i = 0; i != NumElems; ++i)
5279 // If this is the insertion idx, put the low elt of V2 here.
5280 MaskVec.push_back(i == Idx ? NumElems : i);
5281 return DAG.getVectorShuffle(VT, SDLoc(V2), V1, V2, &MaskVec[0]);
5284 /// getTargetShuffleMask - Calculates the shuffle mask corresponding to the
5285 /// target specific opcode. Returns true if the Mask could be calculated. Sets
5286 /// IsUnary to true if only uses one source. Note that this will set IsUnary for
5287 /// shuffles which use a single input multiple times, and in those cases it will
5288 /// adjust the mask to only have indices within that single input.
5289 static bool getTargetShuffleMask(SDNode *N, MVT VT,
5290 SmallVectorImpl<int> &Mask, bool &IsUnary) {
5291 unsigned NumElems = VT.getVectorNumElements();
5295 bool IsFakeUnary = false;
5296 switch(N->getOpcode()) {
5297 case X86ISD::BLENDI:
5298 ImmN = N->getOperand(N->getNumOperands()-1);
5299 DecodeBLENDMask(VT, cast<ConstantSDNode>(ImmN)->getZExtValue(), Mask);
5302 ImmN = N->getOperand(N->getNumOperands()-1);
5303 DecodeSHUFPMask(VT, cast<ConstantSDNode>(ImmN)->getZExtValue(), Mask);
5304 IsUnary = IsFakeUnary = N->getOperand(0) == N->getOperand(1);
5306 case X86ISD::UNPCKH:
5307 DecodeUNPCKHMask(VT, Mask);
5308 IsUnary = IsFakeUnary = N->getOperand(0) == N->getOperand(1);
5310 case X86ISD::UNPCKL:
5311 DecodeUNPCKLMask(VT, Mask);
5312 IsUnary = IsFakeUnary = N->getOperand(0) == N->getOperand(1);
5314 case X86ISD::MOVHLPS:
5315 DecodeMOVHLPSMask(NumElems, Mask);
5316 IsUnary = IsFakeUnary = N->getOperand(0) == N->getOperand(1);
5318 case X86ISD::MOVLHPS:
5319 DecodeMOVLHPSMask(NumElems, Mask);
5320 IsUnary = IsFakeUnary = N->getOperand(0) == N->getOperand(1);
5322 case X86ISD::PALIGNR:
5323 ImmN = N->getOperand(N->getNumOperands()-1);
5324 DecodePALIGNRMask(VT, cast<ConstantSDNode>(ImmN)->getZExtValue(), Mask);
5326 case X86ISD::PSHUFD:
5327 case X86ISD::VPERMILPI:
5328 ImmN = N->getOperand(N->getNumOperands()-1);
5329 DecodePSHUFMask(VT, cast<ConstantSDNode>(ImmN)->getZExtValue(), Mask);
5332 case X86ISD::PSHUFHW:
5333 ImmN = N->getOperand(N->getNumOperands()-1);
5334 DecodePSHUFHWMask(VT, cast<ConstantSDNode>(ImmN)->getZExtValue(), Mask);
5337 case X86ISD::PSHUFLW:
5338 ImmN = N->getOperand(N->getNumOperands()-1);
5339 DecodePSHUFLWMask(VT, cast<ConstantSDNode>(ImmN)->getZExtValue(), Mask);
5342 case X86ISD::PSHUFB: {
5344 SDValue MaskNode = N->getOperand(1);
5345 while (MaskNode->getOpcode() == ISD::BITCAST)
5346 MaskNode = MaskNode->getOperand(0);
5348 if (MaskNode->getOpcode() == ISD::BUILD_VECTOR) {
5349 // If we have a build-vector, then things are easy.
5350 EVT VT = MaskNode.getValueType();
5351 assert(VT.isVector() &&
5352 "Can't produce a non-vector with a build_vector!");
5353 if (!VT.isInteger())
5356 int NumBytesPerElement = VT.getVectorElementType().getSizeInBits() / 8;
5358 SmallVector<uint64_t, 32> RawMask;
5359 for (int i = 0, e = MaskNode->getNumOperands(); i < e; ++i) {
5360 SDValue Op = MaskNode->getOperand(i);
5361 if (Op->getOpcode() == ISD::UNDEF) {
5362 RawMask.push_back((uint64_t)SM_SentinelUndef);
5365 auto *CN = dyn_cast<ConstantSDNode>(Op.getNode());
5368 APInt MaskElement = CN->getAPIntValue();
5370 // We now have to decode the element which could be any integer size and
5371 // extract each byte of it.
5372 for (int j = 0; j < NumBytesPerElement; ++j) {
5373 // Note that this is x86 and so always little endian: the low byte is
5374 // the first byte of the mask.
5375 RawMask.push_back(MaskElement.getLoBits(8).getZExtValue());
5376 MaskElement = MaskElement.lshr(8);
5379 DecodePSHUFBMask(RawMask, Mask);
5383 auto *MaskLoad = dyn_cast<LoadSDNode>(MaskNode);
5387 SDValue Ptr = MaskLoad->getBasePtr();
5388 if (Ptr->getOpcode() == X86ISD::Wrapper)
5389 Ptr = Ptr->getOperand(0);
5391 auto *MaskCP = dyn_cast<ConstantPoolSDNode>(Ptr);
5392 if (!MaskCP || MaskCP->isMachineConstantPoolEntry())
5395 if (auto *C = dyn_cast<Constant>(MaskCP->getConstVal())) {
5396 // FIXME: Support AVX-512 here.
5397 Type *Ty = C->getType();
5398 if (!Ty->isVectorTy() || (Ty->getVectorNumElements() != 16 &&
5399 Ty->getVectorNumElements() != 32))
5402 DecodePSHUFBMask(C, Mask);
5408 case X86ISD::VPERMI:
5409 ImmN = N->getOperand(N->getNumOperands()-1);
5410 DecodeVPERMMask(cast<ConstantSDNode>(ImmN)->getZExtValue(), Mask);
5414 case X86ISD::MOVSD: {
5415 // The index 0 always comes from the first element of the second source,
5416 // this is why MOVSS and MOVSD are used in the first place. The other
5417 // elements come from the other positions of the first source vector
5418 Mask.push_back(NumElems);
5419 for (unsigned i = 1; i != NumElems; ++i) {
5424 case X86ISD::VPERM2X128:
5425 ImmN = N->getOperand(N->getNumOperands()-1);
5426 DecodeVPERM2X128Mask(VT, cast<ConstantSDNode>(ImmN)->getZExtValue(), Mask);
5427 if (Mask.empty()) return false;
5429 case X86ISD::MOVSLDUP:
5430 DecodeMOVSLDUPMask(VT, Mask);
5432 case X86ISD::MOVSHDUP:
5433 DecodeMOVSHDUPMask(VT, Mask);
5435 case X86ISD::MOVDDUP:
5436 case X86ISD::MOVLHPD:
5437 case X86ISD::MOVLPD:
5438 case X86ISD::MOVLPS:
5439 // Not yet implemented
5441 default: llvm_unreachable("unknown target shuffle node");
5444 // If we have a fake unary shuffle, the shuffle mask is spread across two
5445 // inputs that are actually the same node. Re-map the mask to always point
5446 // into the first input.
5449 if (M >= (int)Mask.size())
5455 /// getShuffleScalarElt - Returns the scalar element that will make up the ith
5456 /// element of the result of the vector shuffle.
5457 static SDValue getShuffleScalarElt(SDNode *N, unsigned Index, SelectionDAG &DAG,
5460 return SDValue(); // Limit search depth.
5462 SDValue V = SDValue(N, 0);
5463 EVT VT = V.getValueType();
5464 unsigned Opcode = V.getOpcode();
5466 // Recurse into ISD::VECTOR_SHUFFLE node to find scalars.
5467 if (const ShuffleVectorSDNode *SV = dyn_cast<ShuffleVectorSDNode>(N)) {
5468 int Elt = SV->getMaskElt(Index);
5471 return DAG.getUNDEF(VT.getVectorElementType());
5473 unsigned NumElems = VT.getVectorNumElements();
5474 SDValue NewV = (Elt < (int)NumElems) ? SV->getOperand(0)
5475 : SV->getOperand(1);
5476 return getShuffleScalarElt(NewV.getNode(), Elt % NumElems, DAG, Depth+1);
5479 // Recurse into target specific vector shuffles to find scalars.
5480 if (isTargetShuffle(Opcode)) {
5481 MVT ShufVT = V.getSimpleValueType();
5482 unsigned NumElems = ShufVT.getVectorNumElements();
5483 SmallVector<int, 16> ShuffleMask;
5486 if (!getTargetShuffleMask(N, ShufVT, ShuffleMask, IsUnary))
5489 int Elt = ShuffleMask[Index];
5491 return DAG.getUNDEF(ShufVT.getVectorElementType());
5493 SDValue NewV = (Elt < (int)NumElems) ? N->getOperand(0)
5495 return getShuffleScalarElt(NewV.getNode(), Elt % NumElems, DAG,
5499 // Actual nodes that may contain scalar elements
5500 if (Opcode == ISD::BITCAST) {
5501 V = V.getOperand(0);
5502 EVT SrcVT = V.getValueType();
5503 unsigned NumElems = VT.getVectorNumElements();
5505 if (!SrcVT.isVector() || SrcVT.getVectorNumElements() != NumElems)
5509 if (V.getOpcode() == ISD::SCALAR_TO_VECTOR)
5510 return (Index == 0) ? V.getOperand(0)
5511 : DAG.getUNDEF(VT.getVectorElementType());
5513 if (V.getOpcode() == ISD::BUILD_VECTOR)
5514 return V.getOperand(Index);
5519 /// getNumOfConsecutiveZeros - Return the number of elements of a vector
5520 /// shuffle operation which come from a consecutively from a zero. The
5521 /// search can start in two different directions, from left or right.
5522 /// We count undefs as zeros until PreferredNum is reached.
5523 static unsigned getNumOfConsecutiveZeros(ShuffleVectorSDNode *SVOp,
5524 unsigned NumElems, bool ZerosFromLeft,
5526 unsigned PreferredNum = -1U) {
5527 unsigned NumZeros = 0;
5528 for (unsigned i = 0; i != NumElems; ++i) {
5529 unsigned Index = ZerosFromLeft ? i : NumElems - i - 1;
5530 SDValue Elt = getShuffleScalarElt(SVOp, Index, DAG, 0);
5534 if (X86::isZeroNode(Elt))
5536 else if (Elt.getOpcode() == ISD::UNDEF) // Undef as zero up to PreferredNum.
5537 NumZeros = std::min(NumZeros + 1, PreferredNum);
5545 /// isShuffleMaskConsecutive - Check if the shuffle mask indicies [MaskI, MaskE)
5546 /// correspond consecutively to elements from one of the vector operands,
5547 /// starting from its index OpIdx. Also tell OpNum which source vector operand.
5549 bool isShuffleMaskConsecutive(ShuffleVectorSDNode *SVOp,
5550 unsigned MaskI, unsigned MaskE, unsigned OpIdx,
5551 unsigned NumElems, unsigned &OpNum) {
5552 bool SeenV1 = false;
5553 bool SeenV2 = false;
5555 for (unsigned i = MaskI; i != MaskE; ++i, ++OpIdx) {
5556 int Idx = SVOp->getMaskElt(i);
5557 // Ignore undef indicies
5561 if (Idx < (int)NumElems)
5566 // Only accept consecutive elements from the same vector
5567 if ((Idx % NumElems != OpIdx) || (SeenV1 && SeenV2))
5571 OpNum = SeenV1 ? 0 : 1;
5575 /// isVectorShiftRight - Returns true if the shuffle can be implemented as a
5576 /// logical left shift of a vector.
5577 static bool isVectorShiftRight(ShuffleVectorSDNode *SVOp, SelectionDAG &DAG,
5578 bool &isLeft, SDValue &ShVal, unsigned &ShAmt) {
5580 SVOp->getSimpleValueType(0).getVectorNumElements();
5581 unsigned NumZeros = getNumOfConsecutiveZeros(
5582 SVOp, NumElems, false /* check zeros from right */, DAG,
5583 SVOp->getMaskElt(0));
5589 // Considering the elements in the mask that are not consecutive zeros,
5590 // check if they consecutively come from only one of the source vectors.
5592 // V1 = {X, A, B, C} 0
5594 // vector_shuffle V1, V2 <1, 2, 3, X>
5596 if (!isShuffleMaskConsecutive(SVOp,
5597 0, // Mask Start Index
5598 NumElems-NumZeros, // Mask End Index(exclusive)
5599 NumZeros, // Where to start looking in the src vector
5600 NumElems, // Number of elements in vector
5601 OpSrc)) // Which source operand ?
5606 ShVal = SVOp->getOperand(OpSrc);
5610 /// isVectorShiftLeft - Returns true if the shuffle can be implemented as a
5611 /// logical left shift of a vector.
5612 static bool isVectorShiftLeft(ShuffleVectorSDNode *SVOp, SelectionDAG &DAG,
5613 bool &isLeft, SDValue &ShVal, unsigned &ShAmt) {
5615 SVOp->getSimpleValueType(0).getVectorNumElements();
5616 unsigned NumZeros = getNumOfConsecutiveZeros(
5617 SVOp, NumElems, true /* check zeros from left */, DAG,
5618 NumElems - SVOp->getMaskElt(NumElems - 1) - 1);
5624 // Considering the elements in the mask that are not consecutive zeros,
5625 // check if they consecutively come from only one of the source vectors.
5627 // 0 { A, B, X, X } = V2
5629 // vector_shuffle V1, V2 <X, X, 4, 5>
5631 if (!isShuffleMaskConsecutive(SVOp,
5632 NumZeros, // Mask Start Index
5633 NumElems, // Mask End Index(exclusive)
5634 0, // Where to start looking in the src vector
5635 NumElems, // Number of elements in vector
5636 OpSrc)) // Which source operand ?
5641 ShVal = SVOp->getOperand(OpSrc);
5645 /// isVectorShift - Returns true if the shuffle can be implemented as a
5646 /// logical left or right shift of a vector.
5647 static bool isVectorShift(ShuffleVectorSDNode *SVOp, SelectionDAG &DAG,
5648 bool &isLeft, SDValue &ShVal, unsigned &ShAmt) {
5649 // Although the logic below support any bitwidth size, there are no
5650 // shift instructions which handle more than 128-bit vectors.
5651 if (!SVOp->getSimpleValueType(0).is128BitVector())
5654 if (isVectorShiftLeft(SVOp, DAG, isLeft, ShVal, ShAmt) ||
5655 isVectorShiftRight(SVOp, DAG, isLeft, ShVal, ShAmt))
5661 /// LowerBuildVectorv16i8 - Custom lower build_vector of v16i8.
5663 static SDValue LowerBuildVectorv16i8(SDValue Op, unsigned NonZeros,
5664 unsigned NumNonZero, unsigned NumZero,
5666 const X86Subtarget* Subtarget,
5667 const TargetLowering &TLI) {
5674 for (unsigned i = 0; i < 16; ++i) {
5675 bool ThisIsNonZero = (NonZeros & (1 << i)) != 0;
5676 if (ThisIsNonZero && First) {
5678 V = getZeroVector(MVT::v8i16, Subtarget, DAG, dl);
5680 V = DAG.getUNDEF(MVT::v8i16);
5685 SDValue ThisElt, LastElt;
5686 bool LastIsNonZero = (NonZeros & (1 << (i-1))) != 0;
5687 if (LastIsNonZero) {
5688 LastElt = DAG.getNode(ISD::ZERO_EXTEND, dl,
5689 MVT::i16, Op.getOperand(i-1));
5691 if (ThisIsNonZero) {
5692 ThisElt = DAG.getNode(ISD::ZERO_EXTEND, dl, MVT::i16, Op.getOperand(i));
5693 ThisElt = DAG.getNode(ISD::SHL, dl, MVT::i16,
5694 ThisElt, DAG.getConstant(8, MVT::i8));
5696 ThisElt = DAG.getNode(ISD::OR, dl, MVT::i16, ThisElt, LastElt);
5700 if (ThisElt.getNode())
5701 V = DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, MVT::v8i16, V, ThisElt,
5702 DAG.getIntPtrConstant(i/2));
5706 return DAG.getNode(ISD::BITCAST, dl, MVT::v16i8, V);
5709 /// LowerBuildVectorv8i16 - Custom lower build_vector of v8i16.
5711 static SDValue LowerBuildVectorv8i16(SDValue Op, unsigned NonZeros,
5712 unsigned NumNonZero, unsigned NumZero,
5714 const X86Subtarget* Subtarget,
5715 const TargetLowering &TLI) {
5722 for (unsigned i = 0; i < 8; ++i) {
5723 bool isNonZero = (NonZeros & (1 << i)) != 0;
5727 V = getZeroVector(MVT::v8i16, Subtarget, DAG, dl);
5729 V = DAG.getUNDEF(MVT::v8i16);
5732 V = DAG.getNode(ISD::INSERT_VECTOR_ELT, dl,
5733 MVT::v8i16, V, Op.getOperand(i),
5734 DAG.getIntPtrConstant(i));
5741 /// LowerBuildVectorv4x32 - Custom lower build_vector of v4i32 or v4f32.
5742 static SDValue LowerBuildVectorv4x32(SDValue Op, unsigned NumElems,
5743 unsigned NonZeros, unsigned NumNonZero,
5744 unsigned NumZero, SelectionDAG &DAG,
5745 const X86Subtarget *Subtarget,
5746 const TargetLowering &TLI) {
5747 // We know there's at least one non-zero element
5748 unsigned FirstNonZeroIdx = 0;
5749 SDValue FirstNonZero = Op->getOperand(FirstNonZeroIdx);
5750 while (FirstNonZero.getOpcode() == ISD::UNDEF ||
5751 X86::isZeroNode(FirstNonZero)) {
5753 FirstNonZero = Op->getOperand(FirstNonZeroIdx);
5756 if (FirstNonZero.getOpcode() != ISD::EXTRACT_VECTOR_ELT ||
5757 !isa<ConstantSDNode>(FirstNonZero.getOperand(1)))
5760 SDValue V = FirstNonZero.getOperand(0);
5761 MVT VVT = V.getSimpleValueType();
5762 if (!Subtarget->hasSSE41() || (VVT != MVT::v4f32 && VVT != MVT::v4i32))
5765 unsigned FirstNonZeroDst =
5766 cast<ConstantSDNode>(FirstNonZero.getOperand(1))->getZExtValue();
5767 unsigned CorrectIdx = FirstNonZeroDst == FirstNonZeroIdx;
5768 unsigned IncorrectIdx = CorrectIdx ? -1U : FirstNonZeroIdx;
5769 unsigned IncorrectDst = CorrectIdx ? -1U : FirstNonZeroDst;
5771 for (unsigned Idx = FirstNonZeroIdx + 1; Idx < NumElems; ++Idx) {
5772 SDValue Elem = Op.getOperand(Idx);
5773 if (Elem.getOpcode() == ISD::UNDEF || X86::isZeroNode(Elem))
5776 // TODO: What else can be here? Deal with it.
5777 if (Elem.getOpcode() != ISD::EXTRACT_VECTOR_ELT)
5780 // TODO: Some optimizations are still possible here
5781 // ex: Getting one element from a vector, and the rest from another.
5782 if (Elem.getOperand(0) != V)
5785 unsigned Dst = cast<ConstantSDNode>(Elem.getOperand(1))->getZExtValue();
5788 else if (IncorrectIdx == -1U) {
5792 // There was already one element with an incorrect index.
5793 // We can't optimize this case to an insertps.
5797 if (NumNonZero == CorrectIdx || NumNonZero == CorrectIdx + 1) {
5799 EVT VT = Op.getSimpleValueType();
5800 unsigned ElementMoveMask = 0;
5801 if (IncorrectIdx == -1U)
5802 ElementMoveMask = FirstNonZeroIdx << 6 | FirstNonZeroIdx << 4;
5804 ElementMoveMask = IncorrectDst << 6 | IncorrectIdx << 4;
5806 SDValue InsertpsMask =
5807 DAG.getIntPtrConstant(ElementMoveMask | (~NonZeros & 0xf));
5808 return DAG.getNode(X86ISD::INSERTPS, dl, VT, V, V, InsertpsMask);
5814 /// getVShift - Return a vector logical shift node.
5816 static SDValue getVShift(bool isLeft, EVT VT, SDValue SrcOp,
5817 unsigned NumBits, SelectionDAG &DAG,
5818 const TargetLowering &TLI, SDLoc dl) {
5819 assert(VT.is128BitVector() && "Unknown type for VShift");
5820 EVT ShVT = MVT::v2i64;
5821 unsigned Opc = isLeft ? X86ISD::VSHLDQ : X86ISD::VSRLDQ;
5822 SrcOp = DAG.getNode(ISD::BITCAST, dl, ShVT, SrcOp);
5823 return DAG.getNode(ISD::BITCAST, dl, VT,
5824 DAG.getNode(Opc, dl, ShVT, SrcOp,
5825 DAG.getConstant(NumBits,
5826 TLI.getScalarShiftAmountTy(SrcOp.getValueType()))));
5830 LowerAsSplatVectorLoad(SDValue SrcOp, MVT VT, SDLoc dl, SelectionDAG &DAG) {
5832 // Check if the scalar load can be widened into a vector load. And if
5833 // the address is "base + cst" see if the cst can be "absorbed" into
5834 // the shuffle mask.
5835 if (LoadSDNode *LD = dyn_cast<LoadSDNode>(SrcOp)) {
5836 SDValue Ptr = LD->getBasePtr();
5837 if (!ISD::isNormalLoad(LD) || LD->isVolatile())
5839 EVT PVT = LD->getValueType(0);
5840 if (PVT != MVT::i32 && PVT != MVT::f32)
5845 if (FrameIndexSDNode *FINode = dyn_cast<FrameIndexSDNode>(Ptr)) {
5846 FI = FINode->getIndex();
5848 } else if (DAG.isBaseWithConstantOffset(Ptr) &&
5849 isa<FrameIndexSDNode>(Ptr.getOperand(0))) {
5850 FI = cast<FrameIndexSDNode>(Ptr.getOperand(0))->getIndex();
5851 Offset = Ptr.getConstantOperandVal(1);
5852 Ptr = Ptr.getOperand(0);
5857 // FIXME: 256-bit vector instructions don't require a strict alignment,
5858 // improve this code to support it better.
5859 unsigned RequiredAlign = VT.getSizeInBits()/8;
5860 SDValue Chain = LD->getChain();
5861 // Make sure the stack object alignment is at least 16 or 32.
5862 MachineFrameInfo *MFI = DAG.getMachineFunction().getFrameInfo();
5863 if (DAG.InferPtrAlignment(Ptr) < RequiredAlign) {
5864 if (MFI->isFixedObjectIndex(FI)) {
5865 // Can't change the alignment. FIXME: It's possible to compute
5866 // the exact stack offset and reference FI + adjust offset instead.
5867 // If someone *really* cares about this. That's the way to implement it.
5870 MFI->setObjectAlignment(FI, RequiredAlign);
5874 // (Offset % 16 or 32) must be multiple of 4. Then address is then
5875 // Ptr + (Offset & ~15).
5878 if ((Offset % RequiredAlign) & 3)
5880 int64_t StartOffset = Offset & ~(RequiredAlign-1);
5882 Ptr = DAG.getNode(ISD::ADD, SDLoc(Ptr), Ptr.getValueType(),
5883 Ptr,DAG.getConstant(StartOffset, Ptr.getValueType()));
5885 int EltNo = (Offset - StartOffset) >> 2;
5886 unsigned NumElems = VT.getVectorNumElements();
5888 EVT NVT = EVT::getVectorVT(*DAG.getContext(), PVT, NumElems);
5889 SDValue V1 = DAG.getLoad(NVT, dl, Chain, Ptr,
5890 LD->getPointerInfo().getWithOffset(StartOffset),
5891 false, false, false, 0);
5893 SmallVector<int, 8> Mask;
5894 for (unsigned i = 0; i != NumElems; ++i)
5895 Mask.push_back(EltNo);
5897 return DAG.getVectorShuffle(NVT, dl, V1, DAG.getUNDEF(NVT), &Mask[0]);
5903 /// EltsFromConsecutiveLoads - Given the initializing elements 'Elts' of a
5904 /// vector of type 'VT', see if the elements can be replaced by a single large
5905 /// load which has the same value as a build_vector whose operands are 'elts'.
5907 /// Example: <load i32 *a, load i32 *a+4, undef, undef> -> zextload a
5909 /// FIXME: we'd also like to handle the case where the last elements are zero
5910 /// rather than undef via VZEXT_LOAD, but we do not detect that case today.
5911 /// There's even a handy isZeroNode for that purpose.
5912 static SDValue EltsFromConsecutiveLoads(EVT VT, SmallVectorImpl<SDValue> &Elts,
5913 SDLoc &DL, SelectionDAG &DAG,
5914 bool isAfterLegalize) {
5915 EVT EltVT = VT.getVectorElementType();
5916 unsigned NumElems = Elts.size();
5918 LoadSDNode *LDBase = nullptr;
5919 unsigned LastLoadedElt = -1U;
5921 // For each element in the initializer, see if we've found a load or an undef.
5922 // If we don't find an initial load element, or later load elements are
5923 // non-consecutive, bail out.
5924 for (unsigned i = 0; i < NumElems; ++i) {
5925 SDValue Elt = Elts[i];
5927 if (!Elt.getNode() ||
5928 (Elt.getOpcode() != ISD::UNDEF && !ISD::isNON_EXTLoad(Elt.getNode())))
5931 if (Elt.getNode()->getOpcode() == ISD::UNDEF)
5933 LDBase = cast<LoadSDNode>(Elt.getNode());
5937 if (Elt.getOpcode() == ISD::UNDEF)
5940 LoadSDNode *LD = cast<LoadSDNode>(Elt);
5941 if (!DAG.isConsecutiveLoad(LD, LDBase, EltVT.getSizeInBits()/8, i))
5946 // If we have found an entire vector of loads and undefs, then return a large
5947 // load of the entire vector width starting at the base pointer. If we found
5948 // consecutive loads for the low half, generate a vzext_load node.
5949 if (LastLoadedElt == NumElems - 1) {
5951 if (isAfterLegalize &&
5952 !DAG.getTargetLoweringInfo().isOperationLegal(ISD::LOAD, VT))
5955 SDValue NewLd = SDValue();
5957 if (DAG.InferPtrAlignment(LDBase->getBasePtr()) >= 16)
5958 NewLd = DAG.getLoad(VT, DL, LDBase->getChain(), LDBase->getBasePtr(),
5959 LDBase->getPointerInfo(),
5960 LDBase->isVolatile(), LDBase->isNonTemporal(),
5961 LDBase->isInvariant(), 0);
5962 NewLd = DAG.getLoad(VT, DL, LDBase->getChain(), LDBase->getBasePtr(),
5963 LDBase->getPointerInfo(),
5964 LDBase->isVolatile(), LDBase->isNonTemporal(),
5965 LDBase->isInvariant(), LDBase->getAlignment());
5967 if (LDBase->hasAnyUseOfValue(1)) {
5968 SDValue NewChain = DAG.getNode(ISD::TokenFactor, DL, MVT::Other,
5970 SDValue(NewLd.getNode(), 1));
5971 DAG.ReplaceAllUsesOfValueWith(SDValue(LDBase, 1), NewChain);
5972 DAG.UpdateNodeOperands(NewChain.getNode(), SDValue(LDBase, 1),
5973 SDValue(NewLd.getNode(), 1));
5978 if (NumElems == 4 && LastLoadedElt == 1 &&
5979 DAG.getTargetLoweringInfo().isTypeLegal(MVT::v2i64)) {
5980 SDVTList Tys = DAG.getVTList(MVT::v2i64, MVT::Other);
5981 SDValue Ops[] = { LDBase->getChain(), LDBase->getBasePtr() };
5983 DAG.getMemIntrinsicNode(X86ISD::VZEXT_LOAD, DL, Tys, Ops, MVT::i64,
5984 LDBase->getPointerInfo(),
5985 LDBase->getAlignment(),
5986 false/*isVolatile*/, true/*ReadMem*/,
5989 // Make sure the newly-created LOAD is in the same position as LDBase in
5990 // terms of dependency. We create a TokenFactor for LDBase and ResNode, and
5991 // update uses of LDBase's output chain to use the TokenFactor.
5992 if (LDBase->hasAnyUseOfValue(1)) {
5993 SDValue NewChain = DAG.getNode(ISD::TokenFactor, DL, MVT::Other,
5994 SDValue(LDBase, 1), SDValue(ResNode.getNode(), 1));
5995 DAG.ReplaceAllUsesOfValueWith(SDValue(LDBase, 1), NewChain);
5996 DAG.UpdateNodeOperands(NewChain.getNode(), SDValue(LDBase, 1),
5997 SDValue(ResNode.getNode(), 1));
6000 return DAG.getNode(ISD::BITCAST, DL, VT, ResNode);
6005 /// LowerVectorBroadcast - Attempt to use the vbroadcast instruction
6006 /// to generate a splat value for the following cases:
6007 /// 1. A splat BUILD_VECTOR which uses a single scalar load, or a constant.
6008 /// 2. A splat shuffle which uses a scalar_to_vector node which comes from
6009 /// a scalar load, or a constant.
6010 /// The VBROADCAST node is returned when a pattern is found,
6011 /// or SDValue() otherwise.
6012 static SDValue LowerVectorBroadcast(SDValue Op, const X86Subtarget* Subtarget,
6013 SelectionDAG &DAG) {
6014 // VBROADCAST requires AVX.
6015 // TODO: Splats could be generated for non-AVX CPUs using SSE
6016 // instructions, but there's less potential gain for only 128-bit vectors.
6017 if (!Subtarget->hasAVX())
6020 MVT VT = Op.getSimpleValueType();
6023 assert((VT.is128BitVector() || VT.is256BitVector() || VT.is512BitVector()) &&
6024 "Unsupported vector type for broadcast.");
6029 switch (Op.getOpcode()) {
6031 // Unknown pattern found.
6034 case ISD::BUILD_VECTOR: {
6035 auto *BVOp = cast<BuildVectorSDNode>(Op.getNode());
6036 BitVector UndefElements;
6037 SDValue Splat = BVOp->getSplatValue(&UndefElements);
6039 // We need a splat of a single value to use broadcast, and it doesn't
6040 // make any sense if the value is only in one element of the vector.
6041 if (!Splat || (VT.getVectorNumElements() - UndefElements.count()) <= 1)
6045 ConstSplatVal = (Ld.getOpcode() == ISD::Constant ||
6046 Ld.getOpcode() == ISD::ConstantFP);
6048 // Make sure that all of the users of a non-constant load are from the
6049 // BUILD_VECTOR node.
6050 if (!ConstSplatVal && !BVOp->isOnlyUserOf(Ld.getNode()))
6055 case ISD::VECTOR_SHUFFLE: {
6056 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
6058 // Shuffles must have a splat mask where the first element is
6060 if ((!SVOp->isSplat()) || SVOp->getMaskElt(0) != 0)
6063 SDValue Sc = Op.getOperand(0);
6064 if (Sc.getOpcode() != ISD::SCALAR_TO_VECTOR &&
6065 Sc.getOpcode() != ISD::BUILD_VECTOR) {
6067 if (!Subtarget->hasInt256())
6070 // Use the register form of the broadcast instruction available on AVX2.
6071 if (VT.getSizeInBits() >= 256)
6072 Sc = Extract128BitVector(Sc, 0, DAG, dl);
6073 return DAG.getNode(X86ISD::VBROADCAST, dl, VT, Sc);
6076 Ld = Sc.getOperand(0);
6077 ConstSplatVal = (Ld.getOpcode() == ISD::Constant ||
6078 Ld.getOpcode() == ISD::ConstantFP);
6080 // The scalar_to_vector node and the suspected
6081 // load node must have exactly one user.
6082 // Constants may have multiple users.
6084 // AVX-512 has register version of the broadcast
6085 bool hasRegVer = Subtarget->hasAVX512() && VT.is512BitVector() &&
6086 Ld.getValueType().getSizeInBits() >= 32;
6087 if (!ConstSplatVal && ((!Sc.hasOneUse() || !Ld.hasOneUse()) &&
6094 unsigned ScalarSize = Ld.getValueType().getSizeInBits();
6095 bool IsGE256 = (VT.getSizeInBits() >= 256);
6097 // When optimizing for size, generate up to 5 extra bytes for a broadcast
6098 // instruction to save 8 or more bytes of constant pool data.
6099 // TODO: If multiple splats are generated to load the same constant,
6100 // it may be detrimental to overall size. There needs to be a way to detect
6101 // that condition to know if this is truly a size win.
6102 const Function *F = DAG.getMachineFunction().getFunction();
6103 bool OptForSize = F->getAttributes().
6104 hasAttribute(AttributeSet::FunctionIndex, Attribute::OptimizeForSize);
6106 // Handle broadcasting a single constant scalar from the constant pool
6108 // On Sandybridge (no AVX2), it is still better to load a constant vector
6109 // from the constant pool and not to broadcast it from a scalar.
6110 // But override that restriction when optimizing for size.
6111 // TODO: Check if splatting is recommended for other AVX-capable CPUs.
6112 if (ConstSplatVal && (Subtarget->hasAVX2() || OptForSize)) {
6113 EVT CVT = Ld.getValueType();
6114 assert(!CVT.isVector() && "Must not broadcast a vector type");
6116 // Splat f32, i32, v4f64, v4i64 in all cases with AVX2.
6117 // For size optimization, also splat v2f64 and v2i64, and for size opt
6118 // with AVX2, also splat i8 and i16.
6119 // With pattern matching, the VBROADCAST node may become a VMOVDDUP.
6120 if (ScalarSize == 32 || (IsGE256 && ScalarSize == 64) ||
6121 (OptForSize && (ScalarSize == 64 || Subtarget->hasAVX2()))) {
6122 const Constant *C = nullptr;
6123 if (ConstantSDNode *CI = dyn_cast<ConstantSDNode>(Ld))
6124 C = CI->getConstantIntValue();
6125 else if (ConstantFPSDNode *CF = dyn_cast<ConstantFPSDNode>(Ld))
6126 C = CF->getConstantFPValue();
6128 assert(C && "Invalid constant type");
6130 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
6131 SDValue CP = DAG.getConstantPool(C, TLI.getPointerTy());
6132 unsigned Alignment = cast<ConstantPoolSDNode>(CP)->getAlignment();
6133 Ld = DAG.getLoad(CVT, dl, DAG.getEntryNode(), CP,
6134 MachinePointerInfo::getConstantPool(),
6135 false, false, false, Alignment);
6137 return DAG.getNode(X86ISD::VBROADCAST, dl, VT, Ld);
6141 bool IsLoad = ISD::isNormalLoad(Ld.getNode());
6143 // Handle AVX2 in-register broadcasts.
6144 if (!IsLoad && Subtarget->hasInt256() &&
6145 (ScalarSize == 32 || (IsGE256 && ScalarSize == 64)))
6146 return DAG.getNode(X86ISD::VBROADCAST, dl, VT, Ld);
6148 // The scalar source must be a normal load.
6152 if (ScalarSize == 32 || (IsGE256 && ScalarSize == 64))
6153 return DAG.getNode(X86ISD::VBROADCAST, dl, VT, Ld);
6155 // The integer check is needed for the 64-bit into 128-bit so it doesn't match
6156 // double since there is no vbroadcastsd xmm
6157 if (Subtarget->hasInt256() && Ld.getValueType().isInteger()) {
6158 if (ScalarSize == 8 || ScalarSize == 16 || ScalarSize == 64)
6159 return DAG.getNode(X86ISD::VBROADCAST, dl, VT, Ld);
6162 // Unsupported broadcast.
6166 /// \brief For an EXTRACT_VECTOR_ELT with a constant index return the real
6167 /// underlying vector and index.
6169 /// Modifies \p ExtractedFromVec to the real vector and returns the real
6171 static int getUnderlyingExtractedFromVec(SDValue &ExtractedFromVec,
6173 int Idx = cast<ConstantSDNode>(ExtIdx)->getZExtValue();
6174 if (!isa<ShuffleVectorSDNode>(ExtractedFromVec))
6177 // For 256-bit vectors, LowerEXTRACT_VECTOR_ELT_SSE4 may have already
6179 // (extract_vector_elt (v8f32 %vreg1), Constant<6>)
6181 // (extract_vector_elt (vector_shuffle<2,u,u,u>
6182 // (extract_subvector (v8f32 %vreg0), Constant<4>),
6185 // In this case the vector is the extract_subvector expression and the index
6186 // is 2, as specified by the shuffle.
6187 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(ExtractedFromVec);
6188 SDValue ShuffleVec = SVOp->getOperand(0);
6189 MVT ShuffleVecVT = ShuffleVec.getSimpleValueType();
6190 assert(ShuffleVecVT.getVectorElementType() ==
6191 ExtractedFromVec.getSimpleValueType().getVectorElementType());
6193 int ShuffleIdx = SVOp->getMaskElt(Idx);
6194 if (isUndefOrInRange(ShuffleIdx, 0, ShuffleVecVT.getVectorNumElements())) {
6195 ExtractedFromVec = ShuffleVec;
6201 static SDValue buildFromShuffleMostly(SDValue Op, SelectionDAG &DAG) {
6202 MVT VT = Op.getSimpleValueType();
6204 // Skip if insert_vec_elt is not supported.
6205 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
6206 if (!TLI.isOperationLegalOrCustom(ISD::INSERT_VECTOR_ELT, VT))
6210 unsigned NumElems = Op.getNumOperands();
6214 SmallVector<unsigned, 4> InsertIndices;
6215 SmallVector<int, 8> Mask(NumElems, -1);
6217 for (unsigned i = 0; i != NumElems; ++i) {
6218 unsigned Opc = Op.getOperand(i).getOpcode();
6220 if (Opc == ISD::UNDEF)
6223 if (Opc != ISD::EXTRACT_VECTOR_ELT) {
6224 // Quit if more than 1 elements need inserting.
6225 if (InsertIndices.size() > 1)
6228 InsertIndices.push_back(i);
6232 SDValue ExtractedFromVec = Op.getOperand(i).getOperand(0);
6233 SDValue ExtIdx = Op.getOperand(i).getOperand(1);
6234 // Quit if non-constant index.
6235 if (!isa<ConstantSDNode>(ExtIdx))
6237 int Idx = getUnderlyingExtractedFromVec(ExtractedFromVec, ExtIdx);
6239 // Quit if extracted from vector of different type.
6240 if (ExtractedFromVec.getValueType() != VT)
6243 if (!VecIn1.getNode())
6244 VecIn1 = ExtractedFromVec;
6245 else if (VecIn1 != ExtractedFromVec) {
6246 if (!VecIn2.getNode())
6247 VecIn2 = ExtractedFromVec;
6248 else if (VecIn2 != ExtractedFromVec)
6249 // Quit if more than 2 vectors to shuffle
6253 if (ExtractedFromVec == VecIn1)
6255 else if (ExtractedFromVec == VecIn2)
6256 Mask[i] = Idx + NumElems;
6259 if (!VecIn1.getNode())
6262 VecIn2 = VecIn2.getNode() ? VecIn2 : DAG.getUNDEF(VT);
6263 SDValue NV = DAG.getVectorShuffle(VT, DL, VecIn1, VecIn2, &Mask[0]);
6264 for (unsigned i = 0, e = InsertIndices.size(); i != e; ++i) {
6265 unsigned Idx = InsertIndices[i];
6266 NV = DAG.getNode(ISD::INSERT_VECTOR_ELT, DL, VT, NV, Op.getOperand(Idx),
6267 DAG.getIntPtrConstant(Idx));
6273 // Lower BUILD_VECTOR operation for v8i1 and v16i1 types.
6275 X86TargetLowering::LowerBUILD_VECTORvXi1(SDValue Op, SelectionDAG &DAG) const {
6277 MVT VT = Op.getSimpleValueType();
6278 assert((VT.getVectorElementType() == MVT::i1) && (VT.getSizeInBits() <= 16) &&
6279 "Unexpected type in LowerBUILD_VECTORvXi1!");
6282 if (ISD::isBuildVectorAllZeros(Op.getNode())) {
6283 SDValue Cst = DAG.getTargetConstant(0, MVT::i1);
6284 SmallVector<SDValue, 16> Ops(VT.getVectorNumElements(), Cst);
6285 return DAG.getNode(ISD::BUILD_VECTOR, dl, VT, Ops);
6288 if (ISD::isBuildVectorAllOnes(Op.getNode())) {
6289 SDValue Cst = DAG.getTargetConstant(1, MVT::i1);
6290 SmallVector<SDValue, 16> Ops(VT.getVectorNumElements(), Cst);
6291 return DAG.getNode(ISD::BUILD_VECTOR, dl, VT, Ops);
6294 bool AllContants = true;
6295 uint64_t Immediate = 0;
6296 int NonConstIdx = -1;
6297 bool IsSplat = true;
6298 unsigned NumNonConsts = 0;
6299 unsigned NumConsts = 0;
6300 for (unsigned idx = 0, e = Op.getNumOperands(); idx < e; ++idx) {
6301 SDValue In = Op.getOperand(idx);
6302 if (In.getOpcode() == ISD::UNDEF)
6304 if (!isa<ConstantSDNode>(In)) {
6305 AllContants = false;
6311 if (cast<ConstantSDNode>(In)->getZExtValue())
6312 Immediate |= (1ULL << idx);
6314 if (In != Op.getOperand(0))
6319 SDValue FullMask = DAG.getNode(ISD::BITCAST, dl, MVT::v16i1,
6320 DAG.getConstant(Immediate, MVT::i16));
6321 return DAG.getNode(ISD::EXTRACT_SUBVECTOR, dl, VT, FullMask,
6322 DAG.getIntPtrConstant(0));
6325 if (NumNonConsts == 1 && NonConstIdx != 0) {
6328 SDValue VecAsImm = DAG.getConstant(Immediate,
6329 MVT::getIntegerVT(VT.getSizeInBits()));
6330 DstVec = DAG.getNode(ISD::BITCAST, dl, VT, VecAsImm);
6333 DstVec = DAG.getUNDEF(VT);
6334 return DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, VT, DstVec,
6335 Op.getOperand(NonConstIdx),
6336 DAG.getIntPtrConstant(NonConstIdx));
6338 if (!IsSplat && (NonConstIdx != 0))
6339 llvm_unreachable("Unsupported BUILD_VECTOR operation");
6340 MVT SelectVT = (VT == MVT::v16i1)? MVT::i16 : MVT::i8;
6343 Select = DAG.getNode(ISD::SELECT, dl, SelectVT, Op.getOperand(0),
6344 DAG.getConstant(-1, SelectVT),
6345 DAG.getConstant(0, SelectVT));
6347 Select = DAG.getNode(ISD::SELECT, dl, SelectVT, Op.getOperand(0),
6348 DAG.getConstant((Immediate | 1), SelectVT),
6349 DAG.getConstant(Immediate, SelectVT));
6350 return DAG.getNode(ISD::BITCAST, dl, VT, Select);
6353 /// \brief Return true if \p N implements a horizontal binop and return the
6354 /// operands for the horizontal binop into V0 and V1.
6356 /// This is a helper function of PerformBUILD_VECTORCombine.
6357 /// This function checks that the build_vector \p N in input implements a
6358 /// horizontal operation. Parameter \p Opcode defines the kind of horizontal
6359 /// operation to match.
6360 /// For example, if \p Opcode is equal to ISD::ADD, then this function
6361 /// checks if \p N implements a horizontal arithmetic add; if instead \p Opcode
6362 /// is equal to ISD::SUB, then this function checks if this is a horizontal
6365 /// This function only analyzes elements of \p N whose indices are
6366 /// in range [BaseIdx, LastIdx).
6367 static bool isHorizontalBinOp(const BuildVectorSDNode *N, unsigned Opcode,
6369 unsigned BaseIdx, unsigned LastIdx,
6370 SDValue &V0, SDValue &V1) {
6371 EVT VT = N->getValueType(0);
6373 assert(BaseIdx * 2 <= LastIdx && "Invalid Indices in input!");
6374 assert(VT.isVector() && VT.getVectorNumElements() >= LastIdx &&
6375 "Invalid Vector in input!");
6377 bool IsCommutable = (Opcode == ISD::ADD || Opcode == ISD::FADD);
6378 bool CanFold = true;
6379 unsigned ExpectedVExtractIdx = BaseIdx;
6380 unsigned NumElts = LastIdx - BaseIdx;
6381 V0 = DAG.getUNDEF(VT);
6382 V1 = DAG.getUNDEF(VT);
6384 // Check if N implements a horizontal binop.
6385 for (unsigned i = 0, e = NumElts; i != e && CanFold; ++i) {
6386 SDValue Op = N->getOperand(i + BaseIdx);
6389 if (Op->getOpcode() == ISD::UNDEF) {
6390 // Update the expected vector extract index.
6391 if (i * 2 == NumElts)
6392 ExpectedVExtractIdx = BaseIdx;
6393 ExpectedVExtractIdx += 2;
6397 CanFold = Op->getOpcode() == Opcode && Op->hasOneUse();
6402 SDValue Op0 = Op.getOperand(0);
6403 SDValue Op1 = Op.getOperand(1);
6405 // Try to match the following pattern:
6406 // (BINOP (extract_vector_elt A, I), (extract_vector_elt A, I+1))
6407 CanFold = (Op0.getOpcode() == ISD::EXTRACT_VECTOR_ELT &&
6408 Op1.getOpcode() == ISD::EXTRACT_VECTOR_ELT &&
6409 Op0.getOperand(0) == Op1.getOperand(0) &&
6410 isa<ConstantSDNode>(Op0.getOperand(1)) &&
6411 isa<ConstantSDNode>(Op1.getOperand(1)));
6415 unsigned I0 = cast<ConstantSDNode>(Op0.getOperand(1))->getZExtValue();
6416 unsigned I1 = cast<ConstantSDNode>(Op1.getOperand(1))->getZExtValue();
6418 if (i * 2 < NumElts) {
6419 if (V0.getOpcode() == ISD::UNDEF)
6420 V0 = Op0.getOperand(0);
6422 if (V1.getOpcode() == ISD::UNDEF)
6423 V1 = Op0.getOperand(0);
6424 if (i * 2 == NumElts)
6425 ExpectedVExtractIdx = BaseIdx;
6428 SDValue Expected = (i * 2 < NumElts) ? V0 : V1;
6429 if (I0 == ExpectedVExtractIdx)
6430 CanFold = I1 == I0 + 1 && Op0.getOperand(0) == Expected;
6431 else if (IsCommutable && I1 == ExpectedVExtractIdx) {
6432 // Try to match the following dag sequence:
6433 // (BINOP (extract_vector_elt A, I+1), (extract_vector_elt A, I))
6434 CanFold = I0 == I1 + 1 && Op1.getOperand(0) == Expected;
6438 ExpectedVExtractIdx += 2;
6444 /// \brief Emit a sequence of two 128-bit horizontal add/sub followed by
6445 /// a concat_vector.
6447 /// This is a helper function of PerformBUILD_VECTORCombine.
6448 /// This function expects two 256-bit vectors called V0 and V1.
6449 /// At first, each vector is split into two separate 128-bit vectors.
6450 /// Then, the resulting 128-bit vectors are used to implement two
6451 /// horizontal binary operations.
6453 /// The kind of horizontal binary operation is defined by \p X86Opcode.
6455 /// \p Mode specifies how the 128-bit parts of V0 and V1 are passed in input to
6456 /// the two new horizontal binop.
6457 /// When Mode is set, the first horizontal binop dag node would take as input
6458 /// the lower 128-bit of V0 and the upper 128-bit of V0. The second
6459 /// horizontal binop dag node would take as input the lower 128-bit of V1
6460 /// and the upper 128-bit of V1.
6462 /// HADD V0_LO, V0_HI
6463 /// HADD V1_LO, V1_HI
6465 /// Otherwise, the first horizontal binop dag node takes as input the lower
6466 /// 128-bit of V0 and the lower 128-bit of V1, and the second horizontal binop
6467 /// dag node takes the the upper 128-bit of V0 and the upper 128-bit of V1.
6469 /// HADD V0_LO, V1_LO
6470 /// HADD V0_HI, V1_HI
6472 /// If \p isUndefLO is set, then the algorithm propagates UNDEF to the lower
6473 /// 128-bits of the result. If \p isUndefHI is set, then UNDEF is propagated to
6474 /// the upper 128-bits of the result.
6475 static SDValue ExpandHorizontalBinOp(const SDValue &V0, const SDValue &V1,
6476 SDLoc DL, SelectionDAG &DAG,
6477 unsigned X86Opcode, bool Mode,
6478 bool isUndefLO, bool isUndefHI) {
6479 EVT VT = V0.getValueType();
6480 assert(VT.is256BitVector() && VT == V1.getValueType() &&
6481 "Invalid nodes in input!");
6483 unsigned NumElts = VT.getVectorNumElements();
6484 SDValue V0_LO = Extract128BitVector(V0, 0, DAG, DL);
6485 SDValue V0_HI = Extract128BitVector(V0, NumElts/2, DAG, DL);
6486 SDValue V1_LO = Extract128BitVector(V1, 0, DAG, DL);
6487 SDValue V1_HI = Extract128BitVector(V1, NumElts/2, DAG, DL);
6488 EVT NewVT = V0_LO.getValueType();
6490 SDValue LO = DAG.getUNDEF(NewVT);
6491 SDValue HI = DAG.getUNDEF(NewVT);
6494 // Don't emit a horizontal binop if the result is expected to be UNDEF.
6495 if (!isUndefLO && V0->getOpcode() != ISD::UNDEF)
6496 LO = DAG.getNode(X86Opcode, DL, NewVT, V0_LO, V0_HI);
6497 if (!isUndefHI && V1->getOpcode() != ISD::UNDEF)
6498 HI = DAG.getNode(X86Opcode, DL, NewVT, V1_LO, V1_HI);
6500 // Don't emit a horizontal binop if the result is expected to be UNDEF.
6501 if (!isUndefLO && (V0_LO->getOpcode() != ISD::UNDEF ||
6502 V1_LO->getOpcode() != ISD::UNDEF))
6503 LO = DAG.getNode(X86Opcode, DL, NewVT, V0_LO, V1_LO);
6505 if (!isUndefHI && (V0_HI->getOpcode() != ISD::UNDEF ||
6506 V1_HI->getOpcode() != ISD::UNDEF))
6507 HI = DAG.getNode(X86Opcode, DL, NewVT, V0_HI, V1_HI);
6510 return DAG.getNode(ISD::CONCAT_VECTORS, DL, VT, LO, HI);
6513 /// \brief Try to fold a build_vector that performs an 'addsub' into the
6514 /// sequence of 'vadd + vsub + blendi'.
6515 static SDValue matchAddSub(const BuildVectorSDNode *BV, SelectionDAG &DAG,
6516 const X86Subtarget *Subtarget) {
6518 EVT VT = BV->getValueType(0);
6519 unsigned NumElts = VT.getVectorNumElements();
6520 SDValue InVec0 = DAG.getUNDEF(VT);
6521 SDValue InVec1 = DAG.getUNDEF(VT);
6523 assert((VT == MVT::v8f32 || VT == MVT::v4f64 || VT == MVT::v4f32 ||
6524 VT == MVT::v2f64) && "build_vector with an invalid type found!");
6526 // Odd-numbered elements in the input build vector are obtained from
6527 // adding two integer/float elements.
6528 // Even-numbered elements in the input build vector are obtained from
6529 // subtracting two integer/float elements.
6530 unsigned ExpectedOpcode = ISD::FSUB;
6531 unsigned NextExpectedOpcode = ISD::FADD;
6532 bool AddFound = false;
6533 bool SubFound = false;
6535 for (unsigned i = 0, e = NumElts; i != e; i++) {
6536 SDValue Op = BV->getOperand(i);
6538 // Skip 'undef' values.
6539 unsigned Opcode = Op.getOpcode();
6540 if (Opcode == ISD::UNDEF) {
6541 std::swap(ExpectedOpcode, NextExpectedOpcode);
6545 // Early exit if we found an unexpected opcode.
6546 if (Opcode != ExpectedOpcode)
6549 SDValue Op0 = Op.getOperand(0);
6550 SDValue Op1 = Op.getOperand(1);
6552 // Try to match the following pattern:
6553 // (BINOP (extract_vector_elt A, i), (extract_vector_elt B, i))
6554 // Early exit if we cannot match that sequence.
6555 if (Op0.getOpcode() != ISD::EXTRACT_VECTOR_ELT ||
6556 Op1.getOpcode() != ISD::EXTRACT_VECTOR_ELT ||
6557 !isa<ConstantSDNode>(Op0.getOperand(1)) ||
6558 !isa<ConstantSDNode>(Op1.getOperand(1)) ||
6559 Op0.getOperand(1) != Op1.getOperand(1))
6562 unsigned I0 = cast<ConstantSDNode>(Op0.getOperand(1))->getZExtValue();
6566 // We found a valid add/sub node. Update the information accordingly.
6572 // Update InVec0 and InVec1.
6573 if (InVec0.getOpcode() == ISD::UNDEF)
6574 InVec0 = Op0.getOperand(0);
6575 if (InVec1.getOpcode() == ISD::UNDEF)
6576 InVec1 = Op1.getOperand(0);
6578 // Make sure that operands in input to each add/sub node always
6579 // come from a same pair of vectors.
6580 if (InVec0 != Op0.getOperand(0)) {
6581 if (ExpectedOpcode == ISD::FSUB)
6584 // FADD is commutable. Try to commute the operands
6585 // and then test again.
6586 std::swap(Op0, Op1);
6587 if (InVec0 != Op0.getOperand(0))
6591 if (InVec1 != Op1.getOperand(0))
6594 // Update the pair of expected opcodes.
6595 std::swap(ExpectedOpcode, NextExpectedOpcode);
6598 // Don't try to fold this build_vector into an ADDSUB if the inputs are undef.
6599 if (AddFound && SubFound && InVec0.getOpcode() != ISD::UNDEF &&
6600 InVec1.getOpcode() != ISD::UNDEF)
6601 return DAG.getNode(X86ISD::ADDSUB, DL, VT, InVec0, InVec1);
6606 static SDValue PerformBUILD_VECTORCombine(SDNode *N, SelectionDAG &DAG,
6607 const X86Subtarget *Subtarget) {
6609 EVT VT = N->getValueType(0);
6610 unsigned NumElts = VT.getVectorNumElements();
6611 BuildVectorSDNode *BV = cast<BuildVectorSDNode>(N);
6612 SDValue InVec0, InVec1;
6614 // Try to match an ADDSUB.
6615 if ((Subtarget->hasSSE3() && (VT == MVT::v4f32 || VT == MVT::v2f64)) ||
6616 (Subtarget->hasAVX() && (VT == MVT::v8f32 || VT == MVT::v4f64))) {
6617 SDValue Value = matchAddSub(BV, DAG, Subtarget);
6618 if (Value.getNode())
6622 // Try to match horizontal ADD/SUB.
6623 unsigned NumUndefsLO = 0;
6624 unsigned NumUndefsHI = 0;
6625 unsigned Half = NumElts/2;
6627 // Count the number of UNDEF operands in the build_vector in input.
6628 for (unsigned i = 0, e = Half; i != e; ++i)
6629 if (BV->getOperand(i)->getOpcode() == ISD::UNDEF)
6632 for (unsigned i = Half, e = NumElts; i != e; ++i)
6633 if (BV->getOperand(i)->getOpcode() == ISD::UNDEF)
6636 // Early exit if this is either a build_vector of all UNDEFs or all the
6637 // operands but one are UNDEF.
6638 if (NumUndefsLO + NumUndefsHI + 1 >= NumElts)
6641 if ((VT == MVT::v4f32 || VT == MVT::v2f64) && Subtarget->hasSSE3()) {
6642 // Try to match an SSE3 float HADD/HSUB.
6643 if (isHorizontalBinOp(BV, ISD::FADD, DAG, 0, NumElts, InVec0, InVec1))
6644 return DAG.getNode(X86ISD::FHADD, DL, VT, InVec0, InVec1);
6646 if (isHorizontalBinOp(BV, ISD::FSUB, DAG, 0, NumElts, InVec0, InVec1))
6647 return DAG.getNode(X86ISD::FHSUB, DL, VT, InVec0, InVec1);
6648 } else if ((VT == MVT::v4i32 || VT == MVT::v8i16) && Subtarget->hasSSSE3()) {
6649 // Try to match an SSSE3 integer HADD/HSUB.
6650 if (isHorizontalBinOp(BV, ISD::ADD, DAG, 0, NumElts, InVec0, InVec1))
6651 return DAG.getNode(X86ISD::HADD, DL, VT, InVec0, InVec1);
6653 if (isHorizontalBinOp(BV, ISD::SUB, DAG, 0, NumElts, InVec0, InVec1))
6654 return DAG.getNode(X86ISD::HSUB, DL, VT, InVec0, InVec1);
6657 if (!Subtarget->hasAVX())
6660 if ((VT == MVT::v8f32 || VT == MVT::v4f64)) {
6661 // Try to match an AVX horizontal add/sub of packed single/double
6662 // precision floating point values from 256-bit vectors.
6663 SDValue InVec2, InVec3;
6664 if (isHorizontalBinOp(BV, ISD::FADD, DAG, 0, Half, InVec0, InVec1) &&
6665 isHorizontalBinOp(BV, ISD::FADD, DAG, Half, NumElts, InVec2, InVec3) &&
6666 ((InVec0.getOpcode() == ISD::UNDEF ||
6667 InVec2.getOpcode() == ISD::UNDEF) || InVec0 == InVec2) &&
6668 ((InVec1.getOpcode() == ISD::UNDEF ||
6669 InVec3.getOpcode() == ISD::UNDEF) || InVec1 == InVec3))
6670 return DAG.getNode(X86ISD::FHADD, DL, VT, InVec0, InVec1);
6672 if (isHorizontalBinOp(BV, ISD::FSUB, DAG, 0, Half, InVec0, InVec1) &&
6673 isHorizontalBinOp(BV, ISD::FSUB, DAG, Half, NumElts, InVec2, InVec3) &&
6674 ((InVec0.getOpcode() == ISD::UNDEF ||
6675 InVec2.getOpcode() == ISD::UNDEF) || InVec0 == InVec2) &&
6676 ((InVec1.getOpcode() == ISD::UNDEF ||
6677 InVec3.getOpcode() == ISD::UNDEF) || InVec1 == InVec3))
6678 return DAG.getNode(X86ISD::FHSUB, DL, VT, InVec0, InVec1);
6679 } else if (VT == MVT::v8i32 || VT == MVT::v16i16) {
6680 // Try to match an AVX2 horizontal add/sub of signed integers.
6681 SDValue InVec2, InVec3;
6683 bool CanFold = true;
6685 if (isHorizontalBinOp(BV, ISD::ADD, DAG, 0, Half, InVec0, InVec1) &&
6686 isHorizontalBinOp(BV, ISD::ADD, DAG, Half, NumElts, InVec2, InVec3) &&
6687 ((InVec0.getOpcode() == ISD::UNDEF ||
6688 InVec2.getOpcode() == ISD::UNDEF) || InVec0 == InVec2) &&
6689 ((InVec1.getOpcode() == ISD::UNDEF ||
6690 InVec3.getOpcode() == ISD::UNDEF) || InVec1 == InVec3))
6691 X86Opcode = X86ISD::HADD;
6692 else if (isHorizontalBinOp(BV, ISD::SUB, DAG, 0, Half, InVec0, InVec1) &&
6693 isHorizontalBinOp(BV, ISD::SUB, DAG, Half, NumElts, InVec2, InVec3) &&
6694 ((InVec0.getOpcode() == ISD::UNDEF ||
6695 InVec2.getOpcode() == ISD::UNDEF) || InVec0 == InVec2) &&
6696 ((InVec1.getOpcode() == ISD::UNDEF ||
6697 InVec3.getOpcode() == ISD::UNDEF) || InVec1 == InVec3))
6698 X86Opcode = X86ISD::HSUB;
6703 // Fold this build_vector into a single horizontal add/sub.
6704 // Do this only if the target has AVX2.
6705 if (Subtarget->hasAVX2())
6706 return DAG.getNode(X86Opcode, DL, VT, InVec0, InVec1);
6708 // Do not try to expand this build_vector into a pair of horizontal
6709 // add/sub if we can emit a pair of scalar add/sub.
6710 if (NumUndefsLO + 1 == Half || NumUndefsHI + 1 == Half)
6713 // Convert this build_vector into a pair of horizontal binop followed by
6715 bool isUndefLO = NumUndefsLO == Half;
6716 bool isUndefHI = NumUndefsHI == Half;
6717 return ExpandHorizontalBinOp(InVec0, InVec1, DL, DAG, X86Opcode, false,
6718 isUndefLO, isUndefHI);
6722 if ((VT == MVT::v8f32 || VT == MVT::v4f64 || VT == MVT::v8i32 ||
6723 VT == MVT::v16i16) && Subtarget->hasAVX()) {
6725 if (isHorizontalBinOp(BV, ISD::ADD, DAG, 0, NumElts, InVec0, InVec1))
6726 X86Opcode = X86ISD::HADD;
6727 else if (isHorizontalBinOp(BV, ISD::SUB, DAG, 0, NumElts, InVec0, InVec1))
6728 X86Opcode = X86ISD::HSUB;
6729 else if (isHorizontalBinOp(BV, ISD::FADD, DAG, 0, NumElts, InVec0, InVec1))
6730 X86Opcode = X86ISD::FHADD;
6731 else if (isHorizontalBinOp(BV, ISD::FSUB, DAG, 0, NumElts, InVec0, InVec1))
6732 X86Opcode = X86ISD::FHSUB;
6736 // Don't try to expand this build_vector into a pair of horizontal add/sub
6737 // if we can simply emit a pair of scalar add/sub.
6738 if (NumUndefsLO + 1 == Half || NumUndefsHI + 1 == Half)
6741 // Convert this build_vector into two horizontal add/sub followed by
6743 bool isUndefLO = NumUndefsLO == Half;
6744 bool isUndefHI = NumUndefsHI == Half;
6745 return ExpandHorizontalBinOp(InVec0, InVec1, DL, DAG, X86Opcode, true,
6746 isUndefLO, isUndefHI);
6753 X86TargetLowering::LowerBUILD_VECTOR(SDValue Op, SelectionDAG &DAG) const {
6756 MVT VT = Op.getSimpleValueType();
6757 MVT ExtVT = VT.getVectorElementType();
6758 unsigned NumElems = Op.getNumOperands();
6760 // Generate vectors for predicate vectors.
6761 if (VT.getScalarType() == MVT::i1 && Subtarget->hasAVX512())
6762 return LowerBUILD_VECTORvXi1(Op, DAG);
6764 // Vectors containing all zeros can be matched by pxor and xorps later
6765 if (ISD::isBuildVectorAllZeros(Op.getNode())) {
6766 // Canonicalize this to <4 x i32> to 1) ensure the zero vectors are CSE'd
6767 // and 2) ensure that i64 scalars are eliminated on x86-32 hosts.
6768 if (VT == MVT::v4i32 || VT == MVT::v8i32 || VT == MVT::v16i32)
6771 return getZeroVector(VT, Subtarget, DAG, dl);
6774 // Vectors containing all ones can be matched by pcmpeqd on 128-bit width
6775 // vectors or broken into v4i32 operations on 256-bit vectors. AVX2 can use
6776 // vpcmpeqd on 256-bit vectors.
6777 if (Subtarget->hasSSE2() && ISD::isBuildVectorAllOnes(Op.getNode())) {
6778 if (VT == MVT::v4i32 || (VT == MVT::v8i32 && Subtarget->hasInt256()))
6781 if (!VT.is512BitVector())
6782 return getOnesVector(VT, Subtarget->hasInt256(), DAG, dl);
6785 SDValue Broadcast = LowerVectorBroadcast(Op, Subtarget, DAG);
6786 if (Broadcast.getNode())
6789 unsigned EVTBits = ExtVT.getSizeInBits();
6791 unsigned NumZero = 0;
6792 unsigned NumNonZero = 0;
6793 unsigned NonZeros = 0;
6794 bool IsAllConstants = true;
6795 SmallSet<SDValue, 8> Values;
6796 for (unsigned i = 0; i < NumElems; ++i) {
6797 SDValue Elt = Op.getOperand(i);
6798 if (Elt.getOpcode() == ISD::UNDEF)
6801 if (Elt.getOpcode() != ISD::Constant &&
6802 Elt.getOpcode() != ISD::ConstantFP)
6803 IsAllConstants = false;
6804 if (X86::isZeroNode(Elt))
6807 NonZeros |= (1 << i);
6812 // All undef vector. Return an UNDEF. All zero vectors were handled above.
6813 if (NumNonZero == 0)
6814 return DAG.getUNDEF(VT);
6816 // Special case for single non-zero, non-undef, element.
6817 if (NumNonZero == 1) {
6818 unsigned Idx = countTrailingZeros(NonZeros);
6819 SDValue Item = Op.getOperand(Idx);
6821 // If this is an insertion of an i64 value on x86-32, and if the top bits of
6822 // the value are obviously zero, truncate the value to i32 and do the
6823 // insertion that way. Only do this if the value is non-constant or if the
6824 // value is a constant being inserted into element 0. It is cheaper to do
6825 // a constant pool load than it is to do a movd + shuffle.
6826 if (ExtVT == MVT::i64 && !Subtarget->is64Bit() &&
6827 (!IsAllConstants || Idx == 0)) {
6828 if (DAG.MaskedValueIsZero(Item, APInt::getBitsSet(64, 32, 64))) {
6830 assert(VT == MVT::v2i64 && "Expected an SSE value type!");
6831 EVT VecVT = MVT::v4i32;
6832 unsigned VecElts = 4;
6834 // Truncate the value (which may itself be a constant) to i32, and
6835 // convert it to a vector with movd (S2V+shuffle to zero extend).
6836 Item = DAG.getNode(ISD::TRUNCATE, dl, MVT::i32, Item);
6837 Item = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VecVT, Item);
6839 // If using the new shuffle lowering, just directly insert this.
6840 if (ExperimentalVectorShuffleLowering)
6842 ISD::BITCAST, dl, VT,
6843 getShuffleVectorZeroOrUndef(Item, Idx * 2, true, Subtarget, DAG));
6845 Item = getShuffleVectorZeroOrUndef(Item, 0, true, Subtarget, DAG);
6847 // Now we have our 32-bit value zero extended in the low element of
6848 // a vector. If Idx != 0, swizzle it into place.
6850 SmallVector<int, 4> Mask;
6851 Mask.push_back(Idx);
6852 for (unsigned i = 1; i != VecElts; ++i)
6854 Item = DAG.getVectorShuffle(VecVT, dl, Item, DAG.getUNDEF(VecVT),
6857 return DAG.getNode(ISD::BITCAST, dl, VT, Item);
6861 // If we have a constant or non-constant insertion into the low element of
6862 // a vector, we can do this with SCALAR_TO_VECTOR + shuffle of zero into
6863 // the rest of the elements. This will be matched as movd/movq/movss/movsd
6864 // depending on what the source datatype is.
6867 return DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VT, Item);
6869 if (ExtVT == MVT::i32 || ExtVT == MVT::f32 || ExtVT == MVT::f64 ||
6870 (ExtVT == MVT::i64 && Subtarget->is64Bit())) {
6871 if (VT.is256BitVector() || VT.is512BitVector()) {
6872 SDValue ZeroVec = getZeroVector(VT, Subtarget, DAG, dl);
6873 return DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, VT, ZeroVec,
6874 Item, DAG.getIntPtrConstant(0));
6876 assert(VT.is128BitVector() && "Expected an SSE value type!");
6877 Item = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VT, Item);
6878 // Turn it into a MOVL (i.e. movss, movsd, or movd) to a zero vector.
6879 return getShuffleVectorZeroOrUndef(Item, 0, true, Subtarget, DAG);
6882 if (ExtVT == MVT::i16 || ExtVT == MVT::i8) {
6883 Item = DAG.getNode(ISD::ZERO_EXTEND, dl, MVT::i32, Item);
6884 Item = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, MVT::v4i32, Item);
6885 if (VT.is256BitVector()) {
6886 SDValue ZeroVec = getZeroVector(MVT::v8i32, Subtarget, DAG, dl);
6887 Item = Insert128BitVector(ZeroVec, Item, 0, DAG, dl);
6889 assert(VT.is128BitVector() && "Expected an SSE value type!");
6890 Item = getShuffleVectorZeroOrUndef(Item, 0, true, Subtarget, DAG);
6892 return DAG.getNode(ISD::BITCAST, dl, VT, Item);
6896 // Is it a vector logical left shift?
6897 if (NumElems == 2 && Idx == 1 &&
6898 X86::isZeroNode(Op.getOperand(0)) &&
6899 !X86::isZeroNode(Op.getOperand(1))) {
6900 unsigned NumBits = VT.getSizeInBits();
6901 return getVShift(true, VT,
6902 DAG.getNode(ISD::SCALAR_TO_VECTOR, dl,
6903 VT, Op.getOperand(1)),
6904 NumBits/2, DAG, *this, dl);
6907 if (IsAllConstants) // Otherwise, it's better to do a constpool load.
6910 // Otherwise, if this is a vector with i32 or f32 elements, and the element
6911 // is a non-constant being inserted into an element other than the low one,
6912 // we can't use a constant pool load. Instead, use SCALAR_TO_VECTOR (aka
6913 // movd/movss) to move this into the low element, then shuffle it into
6915 if (EVTBits == 32) {
6916 Item = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VT, Item);
6918 // If using the new shuffle lowering, just directly insert this.
6919 if (ExperimentalVectorShuffleLowering)
6920 return getShuffleVectorZeroOrUndef(Item, Idx, NumZero > 0, Subtarget, DAG);
6922 // Turn it into a shuffle of zero and zero-extended scalar to vector.
6923 Item = getShuffleVectorZeroOrUndef(Item, 0, NumZero > 0, Subtarget, DAG);
6924 SmallVector<int, 8> MaskVec;
6925 for (unsigned i = 0; i != NumElems; ++i)
6926 MaskVec.push_back(i == Idx ? 0 : 1);
6927 return DAG.getVectorShuffle(VT, dl, Item, DAG.getUNDEF(VT), &MaskVec[0]);
6931 // Splat is obviously ok. Let legalizer expand it to a shuffle.
6932 if (Values.size() == 1) {
6933 if (EVTBits == 32) {
6934 // Instead of a shuffle like this:
6935 // shuffle (scalar_to_vector (load (ptr + 4))), undef, <0, 0, 0, 0>
6936 // Check if it's possible to issue this instead.
6937 // shuffle (vload ptr)), undef, <1, 1, 1, 1>
6938 unsigned Idx = countTrailingZeros(NonZeros);
6939 SDValue Item = Op.getOperand(Idx);
6940 if (Op.getNode()->isOnlyUserOf(Item.getNode()))
6941 return LowerAsSplatVectorLoad(Item, VT, dl, DAG);
6946 // A vector full of immediates; various special cases are already
6947 // handled, so this is best done with a single constant-pool load.
6951 // For AVX-length vectors, build the individual 128-bit pieces and use
6952 // shuffles to put them in place.
6953 if (VT.is256BitVector() || VT.is512BitVector()) {
6954 SmallVector<SDValue, 64> V;
6955 for (unsigned i = 0; i != NumElems; ++i)
6956 V.push_back(Op.getOperand(i));
6958 EVT HVT = EVT::getVectorVT(*DAG.getContext(), ExtVT, NumElems/2);
6960 // Build both the lower and upper subvector.
6961 SDValue Lower = DAG.getNode(ISD::BUILD_VECTOR, dl, HVT,
6962 makeArrayRef(&V[0], NumElems/2));
6963 SDValue Upper = DAG.getNode(ISD::BUILD_VECTOR, dl, HVT,
6964 makeArrayRef(&V[NumElems / 2], NumElems/2));
6966 // Recreate the wider vector with the lower and upper part.
6967 if (VT.is256BitVector())
6968 return Concat128BitVectors(Lower, Upper, VT, NumElems, DAG, dl);
6969 return Concat256BitVectors(Lower, Upper, VT, NumElems, DAG, dl);
6972 // Let legalizer expand 2-wide build_vectors.
6973 if (EVTBits == 64) {
6974 if (NumNonZero == 1) {
6975 // One half is zero or undef.
6976 unsigned Idx = countTrailingZeros(NonZeros);
6977 SDValue V2 = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VT,
6978 Op.getOperand(Idx));
6979 return getShuffleVectorZeroOrUndef(V2, Idx, true, Subtarget, DAG);
6984 // If element VT is < 32 bits, convert it to inserts into a zero vector.
6985 if (EVTBits == 8 && NumElems == 16) {
6986 SDValue V = LowerBuildVectorv16i8(Op, NonZeros,NumNonZero,NumZero, DAG,
6988 if (V.getNode()) return V;
6991 if (EVTBits == 16 && NumElems == 8) {
6992 SDValue V = LowerBuildVectorv8i16(Op, NonZeros,NumNonZero,NumZero, DAG,
6994 if (V.getNode()) return V;
6997 // If element VT is == 32 bits and has 4 elems, try to generate an INSERTPS
6998 if (EVTBits == 32 && NumElems == 4) {
6999 SDValue V = LowerBuildVectorv4x32(Op, NumElems, NonZeros, NumNonZero,
7000 NumZero, DAG, Subtarget, *this);
7005 // If element VT is == 32 bits, turn it into a number of shuffles.
7006 SmallVector<SDValue, 8> V(NumElems);
7007 if (NumElems == 4 && NumZero > 0) {
7008 for (unsigned i = 0; i < 4; ++i) {
7009 bool isZero = !(NonZeros & (1 << i));
7011 V[i] = getZeroVector(VT, Subtarget, DAG, dl);
7013 V[i] = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VT, Op.getOperand(i));
7016 for (unsigned i = 0; i < 2; ++i) {
7017 switch ((NonZeros & (0x3 << i*2)) >> (i*2)) {
7020 V[i] = V[i*2]; // Must be a zero vector.
7023 V[i] = getMOVL(DAG, dl, VT, V[i*2+1], V[i*2]);
7026 V[i] = getMOVL(DAG, dl, VT, V[i*2], V[i*2+1]);
7029 V[i] = getUnpackl(DAG, dl, VT, V[i*2], V[i*2+1]);
7034 bool Reverse1 = (NonZeros & 0x3) == 2;
7035 bool Reverse2 = ((NonZeros & (0x3 << 2)) >> 2) == 2;
7039 static_cast<int>(Reverse2 ? NumElems+1 : NumElems),
7040 static_cast<int>(Reverse2 ? NumElems : NumElems+1)
7042 return DAG.getVectorShuffle(VT, dl, V[0], V[1], &MaskVec[0]);
7045 if (Values.size() > 1 && VT.is128BitVector()) {
7046 // Check for a build vector of consecutive loads.
7047 for (unsigned i = 0; i < NumElems; ++i)
7048 V[i] = Op.getOperand(i);
7050 // Check for elements which are consecutive loads.
7051 SDValue LD = EltsFromConsecutiveLoads(VT, V, dl, DAG, false);
7055 // Check for a build vector from mostly shuffle plus few inserting.
7056 SDValue Sh = buildFromShuffleMostly(Op, DAG);
7060 // For SSE 4.1, use insertps to put the high elements into the low element.
7061 if (getSubtarget()->hasSSE41()) {
7063 if (Op.getOperand(0).getOpcode() != ISD::UNDEF)
7064 Result = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VT, Op.getOperand(0));
7066 Result = DAG.getUNDEF(VT);
7068 for (unsigned i = 1; i < NumElems; ++i) {
7069 if (Op.getOperand(i).getOpcode() == ISD::UNDEF) continue;
7070 Result = DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, VT, Result,
7071 Op.getOperand(i), DAG.getIntPtrConstant(i));
7076 // Otherwise, expand into a number of unpckl*, start by extending each of
7077 // our (non-undef) elements to the full vector width with the element in the
7078 // bottom slot of the vector (which generates no code for SSE).
7079 for (unsigned i = 0; i < NumElems; ++i) {
7080 if (Op.getOperand(i).getOpcode() != ISD::UNDEF)
7081 V[i] = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VT, Op.getOperand(i));
7083 V[i] = DAG.getUNDEF(VT);
7086 // Next, we iteratively mix elements, e.g. for v4f32:
7087 // Step 1: unpcklps 0, 2 ==> X: <?, ?, 2, 0>
7088 // : unpcklps 1, 3 ==> Y: <?, ?, 3, 1>
7089 // Step 2: unpcklps X, Y ==> <3, 2, 1, 0>
7090 unsigned EltStride = NumElems >> 1;
7091 while (EltStride != 0) {
7092 for (unsigned i = 0; i < EltStride; ++i) {
7093 // If V[i+EltStride] is undef and this is the first round of mixing,
7094 // then it is safe to just drop this shuffle: V[i] is already in the
7095 // right place, the one element (since it's the first round) being
7096 // inserted as undef can be dropped. This isn't safe for successive
7097 // rounds because they will permute elements within both vectors.
7098 if (V[i+EltStride].getOpcode() == ISD::UNDEF &&
7099 EltStride == NumElems/2)
7102 V[i] = getUnpackl(DAG, dl, VT, V[i], V[i + EltStride]);
7111 // LowerAVXCONCAT_VECTORS - 256-bit AVX can use the vinsertf128 instruction
7112 // to create 256-bit vectors from two other 128-bit ones.
7113 static SDValue LowerAVXCONCAT_VECTORS(SDValue Op, SelectionDAG &DAG) {
7115 MVT ResVT = Op.getSimpleValueType();
7117 assert((ResVT.is256BitVector() ||
7118 ResVT.is512BitVector()) && "Value type must be 256-/512-bit wide");
7120 SDValue V1 = Op.getOperand(0);
7121 SDValue V2 = Op.getOperand(1);
7122 unsigned NumElems = ResVT.getVectorNumElements();
7123 if(ResVT.is256BitVector())
7124 return Concat128BitVectors(V1, V2, ResVT, NumElems, DAG, dl);
7126 if (Op.getNumOperands() == 4) {
7127 MVT HalfVT = MVT::getVectorVT(ResVT.getScalarType(),
7128 ResVT.getVectorNumElements()/2);
7129 SDValue V3 = Op.getOperand(2);
7130 SDValue V4 = Op.getOperand(3);
7131 return Concat256BitVectors(Concat128BitVectors(V1, V2, HalfVT, NumElems/2, DAG, dl),
7132 Concat128BitVectors(V3, V4, HalfVT, NumElems/2, DAG, dl), ResVT, NumElems, DAG, dl);
7134 return Concat256BitVectors(V1, V2, ResVT, NumElems, DAG, dl);
7137 static SDValue LowerCONCAT_VECTORS(SDValue Op, SelectionDAG &DAG) {
7138 MVT LLVM_ATTRIBUTE_UNUSED VT = Op.getSimpleValueType();
7139 assert((VT.is256BitVector() && Op.getNumOperands() == 2) ||
7140 (VT.is512BitVector() && (Op.getNumOperands() == 2 ||
7141 Op.getNumOperands() == 4)));
7143 // AVX can use the vinsertf128 instruction to create 256-bit vectors
7144 // from two other 128-bit ones.
7146 // 512-bit vector may contain 2 256-bit vectors or 4 128-bit vectors
7147 return LowerAVXCONCAT_VECTORS(Op, DAG);
7151 //===----------------------------------------------------------------------===//
7152 // Vector shuffle lowering
7154 // This is an experimental code path for lowering vector shuffles on x86. It is
7155 // designed to handle arbitrary vector shuffles and blends, gracefully
7156 // degrading performance as necessary. It works hard to recognize idiomatic
7157 // shuffles and lower them to optimal instruction patterns without leaving
7158 // a framework that allows reasonably efficient handling of all vector shuffle
7160 //===----------------------------------------------------------------------===//
7162 /// \brief Tiny helper function to identify a no-op mask.
7164 /// This is a somewhat boring predicate function. It checks whether the mask
7165 /// array input, which is assumed to be a single-input shuffle mask of the kind
7166 /// used by the X86 shuffle instructions (not a fully general
7167 /// ShuffleVectorSDNode mask) requires any shuffles to occur. Both undef and an
7168 /// in-place shuffle are 'no-op's.
7169 static bool isNoopShuffleMask(ArrayRef<int> Mask) {
7170 for (int i = 0, Size = Mask.size(); i < Size; ++i)
7171 if (Mask[i] != -1 && Mask[i] != i)
7176 /// \brief Helper function to classify a mask as a single-input mask.
7178 /// This isn't a generic single-input test because in the vector shuffle
7179 /// lowering we canonicalize single inputs to be the first input operand. This
7180 /// means we can more quickly test for a single input by only checking whether
7181 /// an input from the second operand exists. We also assume that the size of
7182 /// mask corresponds to the size of the input vectors which isn't true in the
7183 /// fully general case.
7184 static bool isSingleInputShuffleMask(ArrayRef<int> Mask) {
7186 if (M >= (int)Mask.size())
7191 /// \brief Test whether there are elements crossing 128-bit lanes in this
7194 /// X86 divides up its shuffles into in-lane and cross-lane shuffle operations
7195 /// and we routinely test for these.
7196 static bool is128BitLaneCrossingShuffleMask(MVT VT, ArrayRef<int> Mask) {
7197 int LaneSize = 128 / VT.getScalarSizeInBits();
7198 int Size = Mask.size();
7199 for (int i = 0; i < Size; ++i)
7200 if (Mask[i] >= 0 && (Mask[i] % Size) / LaneSize != i / LaneSize)
7205 /// \brief Test whether a shuffle mask is equivalent within each 128-bit lane.
7207 /// This checks a shuffle mask to see if it is performing the same
7208 /// 128-bit lane-relative shuffle in each 128-bit lane. This trivially implies
7209 /// that it is also not lane-crossing. It may however involve a blend from the
7210 /// same lane of a second vector.
7212 /// The specific repeated shuffle mask is populated in \p RepeatedMask, as it is
7213 /// non-trivial to compute in the face of undef lanes. The representation is
7214 /// *not* suitable for use with existing 128-bit shuffles as it will contain
7215 /// entries from both V1 and V2 inputs to the wider mask.
7217 is128BitLaneRepeatedShuffleMask(MVT VT, ArrayRef<int> Mask,
7218 SmallVectorImpl<int> &RepeatedMask) {
7219 int LaneSize = 128 / VT.getScalarSizeInBits();
7220 RepeatedMask.resize(LaneSize, -1);
7221 int Size = Mask.size();
7222 for (int i = 0; i < Size; ++i) {
7225 if ((Mask[i] % Size) / LaneSize != i / LaneSize)
7226 // This entry crosses lanes, so there is no way to model this shuffle.
7229 // Ok, handle the in-lane shuffles by detecting if and when they repeat.
7230 if (RepeatedMask[i % LaneSize] == -1)
7231 // This is the first non-undef entry in this slot of a 128-bit lane.
7232 RepeatedMask[i % LaneSize] =
7233 Mask[i] < Size ? Mask[i] % LaneSize : Mask[i] % LaneSize + Size;
7234 else if (RepeatedMask[i % LaneSize] + (i / LaneSize) * LaneSize != Mask[i])
7235 // Found a mismatch with the repeated mask.
7241 // Hide this symbol with an anonymous namespace instead of 'static' so that MSVC
7242 // 2013 will allow us to use it as a non-type template parameter.
7245 /// \brief Implementation of the \c isShuffleEquivalent variadic functor.
7247 /// See its documentation for details.
7248 bool isShuffleEquivalentImpl(ArrayRef<int> Mask, ArrayRef<const int *> Args) {
7249 if (Mask.size() != Args.size())
7251 for (int i = 0, e = Mask.size(); i < e; ++i) {
7252 assert(*Args[i] >= 0 && "Arguments must be positive integers!");
7253 if (Mask[i] != -1 && Mask[i] != *Args[i])
7261 /// \brief Checks whether a shuffle mask is equivalent to an explicit list of
7264 /// This is a fast way to test a shuffle mask against a fixed pattern:
7266 /// if (isShuffleEquivalent(Mask, 3, 2, 1, 0)) { ... }
7268 /// It returns true if the mask is exactly as wide as the argument list, and
7269 /// each element of the mask is either -1 (signifying undef) or the value given
7270 /// in the argument.
7271 static const VariadicFunction1<
7272 bool, ArrayRef<int>, int, isShuffleEquivalentImpl> isShuffleEquivalent = {};
7274 /// \brief Get a 4-lane 8-bit shuffle immediate for a mask.
7276 /// This helper function produces an 8-bit shuffle immediate corresponding to
7277 /// the ubiquitous shuffle encoding scheme used in x86 instructions for
7278 /// shuffling 4 lanes. It can be used with most of the PSHUF instructions for
7281 /// NB: We rely heavily on "undef" masks preserving the input lane.
7282 static SDValue getV4X86ShuffleImm8ForMask(ArrayRef<int> Mask,
7283 SelectionDAG &DAG) {
7284 assert(Mask.size() == 4 && "Only 4-lane shuffle masks");
7285 assert(Mask[0] >= -1 && Mask[0] < 4 && "Out of bound mask element!");
7286 assert(Mask[1] >= -1 && Mask[1] < 4 && "Out of bound mask element!");
7287 assert(Mask[2] >= -1 && Mask[2] < 4 && "Out of bound mask element!");
7288 assert(Mask[3] >= -1 && Mask[3] < 4 && "Out of bound mask element!");
7291 Imm |= (Mask[0] == -1 ? 0 : Mask[0]) << 0;
7292 Imm |= (Mask[1] == -1 ? 1 : Mask[1]) << 2;
7293 Imm |= (Mask[2] == -1 ? 2 : Mask[2]) << 4;
7294 Imm |= (Mask[3] == -1 ? 3 : Mask[3]) << 6;
7295 return DAG.getConstant(Imm, MVT::i8);
7298 /// \brief Try to emit a blend instruction for a shuffle.
7300 /// This doesn't do any checks for the availability of instructions for blending
7301 /// these values. It relies on the availability of the X86ISD::BLENDI pattern to
7302 /// be matched in the backend with the type given. What it does check for is
7303 /// that the shuffle mask is in fact a blend.
7304 static SDValue lowerVectorShuffleAsBlend(SDLoc DL, MVT VT, SDValue V1,
7305 SDValue V2, ArrayRef<int> Mask,
7306 const X86Subtarget *Subtarget,
7307 SelectionDAG &DAG) {
7309 unsigned BlendMask = 0;
7310 for (int i = 0, Size = Mask.size(); i < Size; ++i) {
7311 if (Mask[i] >= Size) {
7312 if (Mask[i] != i + Size)
7313 return SDValue(); // Shuffled V2 input!
7314 BlendMask |= 1u << i;
7317 if (Mask[i] >= 0 && Mask[i] != i)
7318 return SDValue(); // Shuffled V1 input!
7320 switch (VT.SimpleTy) {
7325 return DAG.getNode(X86ISD::BLENDI, DL, VT, V1, V2,
7326 DAG.getConstant(BlendMask, MVT::i8));
7330 assert(Subtarget->hasAVX2() && "256-bit integer blends require AVX2!");
7334 // If we have AVX2 it is faster to use VPBLENDD when the shuffle fits into
7335 // that instruction.
7336 if (Subtarget->hasAVX2()) {
7337 // Scale the blend by the number of 32-bit dwords per element.
7338 int Scale = VT.getScalarSizeInBits() / 32;
7340 for (int i = 0, Size = Mask.size(); i < Size; ++i)
7341 if (Mask[i] >= Size)
7342 for (int j = 0; j < Scale; ++j)
7343 BlendMask |= 1u << (i * Scale + j);
7345 MVT BlendVT = VT.getSizeInBits() > 128 ? MVT::v8i32 : MVT::v4i32;
7346 V1 = DAG.getNode(ISD::BITCAST, DL, BlendVT, V1);
7347 V2 = DAG.getNode(ISD::BITCAST, DL, BlendVT, V2);
7348 return DAG.getNode(ISD::BITCAST, DL, VT,
7349 DAG.getNode(X86ISD::BLENDI, DL, BlendVT, V1, V2,
7350 DAG.getConstant(BlendMask, MVT::i8)));
7354 // For integer shuffles we need to expand the mask and cast the inputs to
7355 // v8i16s prior to blending.
7356 int Scale = 8 / VT.getVectorNumElements();
7358 for (int i = 0, Size = Mask.size(); i < Size; ++i)
7359 if (Mask[i] >= Size)
7360 for (int j = 0; j < Scale; ++j)
7361 BlendMask |= 1u << (i * Scale + j);
7363 V1 = DAG.getNode(ISD::BITCAST, DL, MVT::v8i16, V1);
7364 V2 = DAG.getNode(ISD::BITCAST, DL, MVT::v8i16, V2);
7365 return DAG.getNode(ISD::BITCAST, DL, VT,
7366 DAG.getNode(X86ISD::BLENDI, DL, MVT::v8i16, V1, V2,
7367 DAG.getConstant(BlendMask, MVT::i8)));
7371 assert(Subtarget->hasAVX2() && "256-bit integer blends require AVX2!");
7372 SmallVector<int, 8> RepeatedMask;
7373 if (is128BitLaneRepeatedShuffleMask(MVT::v16i16, Mask, RepeatedMask)) {
7374 // We can lower these with PBLENDW which is mirrored across 128-bit lanes.
7375 assert(RepeatedMask.size() == 8 && "Repeated mask size doesn't match!");
7377 for (int i = 0; i < 8; ++i)
7378 if (RepeatedMask[i] >= 16)
7379 BlendMask |= 1u << i;
7380 return DAG.getNode(X86ISD::BLENDI, DL, MVT::v16i16, V1, V2,
7381 DAG.getConstant(BlendMask, MVT::i8));
7386 assert(Subtarget->hasAVX2() && "256-bit integer blends require AVX2!");
7387 // Scale the blend by the number of bytes per element.
7388 int Scale = VT.getScalarSizeInBits() / 8;
7389 assert(Mask.size() * Scale == 32 && "Not a 256-bit vector!");
7391 // Compute the VSELECT mask. Note that VSELECT is really confusing in the
7392 // mix of LLVM's code generator and the x86 backend. We tell the code
7393 // generator that boolean values in the elements of an x86 vector register
7394 // are -1 for true and 0 for false. We then use the LLVM semantics of 'true'
7395 // mapping a select to operand #1, and 'false' mapping to operand #2. The
7396 // reality in x86 is that vector masks (pre-AVX-512) use only the high bit
7397 // of the element (the remaining are ignored) and 0 in that high bit would
7398 // mean operand #1 while 1 in the high bit would mean operand #2. So while
7399 // the LLVM model for boolean values in vector elements gets the relevant
7400 // bit set, it is set backwards and over constrained relative to x86's
7402 SDValue VSELECTMask[32];
7403 for (int i = 0, Size = Mask.size(); i < Size; ++i)
7404 for (int j = 0; j < Scale; ++j)
7405 VSELECTMask[Scale * i + j] =
7406 Mask[i] < 0 ? DAG.getUNDEF(MVT::i8)
7407 : DAG.getConstant(Mask[i] < Size ? -1 : 0, MVT::i8);
7409 V1 = DAG.getNode(ISD::BITCAST, DL, MVT::v32i8, V1);
7410 V2 = DAG.getNode(ISD::BITCAST, DL, MVT::v32i8, V2);
7412 ISD::BITCAST, DL, VT,
7413 DAG.getNode(ISD::VSELECT, DL, MVT::v32i8,
7414 DAG.getNode(ISD::BUILD_VECTOR, DL, MVT::v32i8, VSELECTMask),
7419 llvm_unreachable("Not a supported integer vector type!");
7423 /// \brief Generic routine to lower a shuffle and blend as a decomposed set of
7424 /// unblended shuffles followed by an unshuffled blend.
7426 /// This matches the extremely common pattern for handling combined
7427 /// shuffle+blend operations on newer X86 ISAs where we have very fast blend
7429 static SDValue lowerVectorShuffleAsDecomposedShuffleBlend(SDLoc DL, MVT VT,
7433 SelectionDAG &DAG) {
7434 // Shuffle the input elements into the desired positions in V1 and V2 and
7435 // blend them together.
7436 SmallVector<int, 32> V1Mask(Mask.size(), -1);
7437 SmallVector<int, 32> V2Mask(Mask.size(), -1);
7438 SmallVector<int, 32> BlendMask(Mask.size(), -1);
7439 for (int i = 0, Size = Mask.size(); i < Size; ++i)
7440 if (Mask[i] >= 0 && Mask[i] < Size) {
7441 V1Mask[i] = Mask[i];
7443 } else if (Mask[i] >= Size) {
7444 V2Mask[i] = Mask[i] - Size;
7445 BlendMask[i] = i + Size;
7448 V1 = DAG.getVectorShuffle(VT, DL, V1, DAG.getUNDEF(VT), V1Mask);
7449 V2 = DAG.getVectorShuffle(VT, DL, V2, DAG.getUNDEF(VT), V2Mask);
7450 return DAG.getVectorShuffle(VT, DL, V1, V2, BlendMask);
7453 /// \brief Try to lower a vector shuffle as a byte rotation.
7455 /// We have a generic PALIGNR instruction in x86 that will do an arbitrary
7456 /// byte-rotation of the concatenation of two vectors. This routine will
7457 /// try to generically lower a vector shuffle through such an instruction. It
7458 /// does not check for the availability of PALIGNR-based lowerings, only the
7459 /// applicability of this strategy to the given mask. This matches shuffle
7460 /// vectors that look like:
7462 /// v8i16 [11, 12, 13, 14, 15, 0, 1, 2]
7464 /// Essentially it concatenates V1 and V2, shifts right by some number of
7465 /// elements, and takes the low elements as the result. Note that while this is
7466 /// specified as a *right shift* because x86 is little-endian, it is a *left
7467 /// rotate* of the vector lanes.
7469 /// Note that this only handles 128-bit vector widths currently.
7470 static SDValue lowerVectorShuffleAsByteRotate(SDLoc DL, MVT VT, SDValue V1,
7473 SelectionDAG &DAG) {
7474 assert(!isNoopShuffleMask(Mask) && "We shouldn't lower no-op shuffles!");
7476 // We need to detect various ways of spelling a rotation:
7477 // [11, 12, 13, 14, 15, 0, 1, 2]
7478 // [-1, 12, 13, 14, -1, -1, 1, -1]
7479 // [-1, -1, -1, -1, -1, -1, 1, 2]
7480 // [ 3, 4, 5, 6, 7, 8, 9, 10]
7481 // [-1, 4, 5, 6, -1, -1, 9, -1]
7482 // [-1, 4, 5, 6, -1, -1, -1, -1]
7485 for (int i = 0, Size = Mask.size(); i < Size; ++i) {
7488 assert(Mask[i] >= 0 && "Only -1 is a valid negative mask element!");
7490 // Based on the mod-Size value of this mask element determine where
7491 // a rotated vector would have started.
7492 int StartIdx = i - (Mask[i] % Size);
7494 // The identity rotation isn't interesting, stop.
7497 // If we found the tail of a vector the rotation must be the missing
7498 // front. If we found the head of a vector, it must be how much of the head.
7499 int CandidateRotation = StartIdx < 0 ? -StartIdx : Size - StartIdx;
7502 Rotation = CandidateRotation;
7503 else if (Rotation != CandidateRotation)
7504 // The rotations don't match, so we can't match this mask.
7507 // Compute which value this mask is pointing at.
7508 SDValue MaskV = Mask[i] < Size ? V1 : V2;
7510 // Compute which of the two target values this index should be assigned to.
7511 // This reflects whether the high elements are remaining or the low elements
7513 SDValue &TargetV = StartIdx < 0 ? Hi : Lo;
7515 // Either set up this value if we've not encountered it before, or check
7516 // that it remains consistent.
7519 else if (TargetV != MaskV)
7520 // This may be a rotation, but it pulls from the inputs in some
7521 // unsupported interleaving.
7525 // Check that we successfully analyzed the mask, and normalize the results.
7526 assert(Rotation != 0 && "Failed to locate a viable rotation!");
7527 assert((Lo || Hi) && "Failed to find a rotated input vector!");
7533 // Cast the inputs to v16i8 to match PALIGNR.
7534 Lo = DAG.getNode(ISD::BITCAST, DL, MVT::v16i8, Lo);
7535 Hi = DAG.getNode(ISD::BITCAST, DL, MVT::v16i8, Hi);
7537 assert(VT.getSizeInBits() == 128 &&
7538 "Rotate-based lowering only supports 128-bit lowering!");
7539 assert(Mask.size() <= 16 &&
7540 "Can shuffle at most 16 bytes in a 128-bit vector!");
7541 // The actual rotate instruction rotates bytes, so we need to scale the
7542 // rotation based on how many bytes are in the vector.
7543 int Scale = 16 / Mask.size();
7545 return DAG.getNode(ISD::BITCAST, DL, VT,
7546 DAG.getNode(X86ISD::PALIGNR, DL, MVT::v16i8, Hi, Lo,
7547 DAG.getConstant(Rotation * Scale, MVT::i8)));
7550 /// \brief Compute whether each element of a shuffle is zeroable.
7552 /// A "zeroable" vector shuffle element is one which can be lowered to zero.
7553 /// Either it is an undef element in the shuffle mask, the element of the input
7554 /// referenced is undef, or the element of the input referenced is known to be
7555 /// zero. Many x86 shuffles can zero lanes cheaply and we often want to handle
7556 /// as many lanes with this technique as possible to simplify the remaining
7558 static SmallBitVector computeZeroableShuffleElements(ArrayRef<int> Mask,
7559 SDValue V1, SDValue V2) {
7560 SmallBitVector Zeroable(Mask.size(), false);
7562 bool V1IsZero = ISD::isBuildVectorAllZeros(V1.getNode());
7563 bool V2IsZero = ISD::isBuildVectorAllZeros(V2.getNode());
7565 for (int i = 0, Size = Mask.size(); i < Size; ++i) {
7567 // Handle the easy cases.
7568 if (M < 0 || (M >= 0 && M < Size && V1IsZero) || (M >= Size && V2IsZero)) {
7573 // If this is an index into a build_vector node, dig out the input value and
7575 SDValue V = M < Size ? V1 : V2;
7576 if (V.getOpcode() != ISD::BUILD_VECTOR)
7579 SDValue Input = V.getOperand(M % Size);
7580 // The UNDEF opcode check really should be dead code here, but not quite
7581 // worth asserting on (it isn't invalid, just unexpected).
7582 if (Input.getOpcode() == ISD::UNDEF || X86::isZeroNode(Input))
7589 /// \brief Lower a vector shuffle as a zero or any extension.
7591 /// Given a specific number of elements, element bit width, and extension
7592 /// stride, produce either a zero or any extension based on the available
7593 /// features of the subtarget.
7594 static SDValue lowerVectorShuffleAsSpecificZeroOrAnyExtend(
7595 SDLoc DL, MVT VT, int NumElements, int Scale, bool AnyExt, SDValue InputV,
7596 const X86Subtarget *Subtarget, SelectionDAG &DAG) {
7597 assert(Scale > 1 && "Need a scale to extend.");
7598 int EltBits = VT.getSizeInBits() / NumElements;
7599 assert((EltBits == 8 || EltBits == 16 || EltBits == 32) &&
7600 "Only 8, 16, and 32 bit elements can be extended.");
7601 assert(Scale * EltBits <= 64 && "Cannot zero extend past 64 bits.");
7603 // Found a valid zext mask! Try various lowering strategies based on the
7604 // input type and available ISA extensions.
7605 if (Subtarget->hasSSE41()) {
7606 MVT InputVT = MVT::getVectorVT(MVT::getIntegerVT(EltBits), NumElements);
7607 MVT ExtVT = MVT::getVectorVT(MVT::getIntegerVT(EltBits * Scale),
7608 NumElements / Scale);
7609 InputV = DAG.getNode(ISD::BITCAST, DL, InputVT, InputV);
7610 return DAG.getNode(ISD::BITCAST, DL, VT,
7611 DAG.getNode(X86ISD::VZEXT, DL, ExtVT, InputV));
7614 // For any extends we can cheat for larger element sizes and use shuffle
7615 // instructions that can fold with a load and/or copy.
7616 if (AnyExt && EltBits == 32) {
7617 int PSHUFDMask[4] = {0, -1, 1, -1};
7619 ISD::BITCAST, DL, VT,
7620 DAG.getNode(X86ISD::PSHUFD, DL, MVT::v4i32,
7621 DAG.getNode(ISD::BITCAST, DL, MVT::v4i32, InputV),
7622 getV4X86ShuffleImm8ForMask(PSHUFDMask, DAG)));
7624 if (AnyExt && EltBits == 16 && Scale > 2) {
7625 int PSHUFDMask[4] = {0, -1, 0, -1};
7626 InputV = DAG.getNode(X86ISD::PSHUFD, DL, MVT::v4i32,
7627 DAG.getNode(ISD::BITCAST, DL, MVT::v4i32, InputV),
7628 getV4X86ShuffleImm8ForMask(PSHUFDMask, DAG));
7629 int PSHUFHWMask[4] = {1, -1, -1, -1};
7631 ISD::BITCAST, DL, VT,
7632 DAG.getNode(X86ISD::PSHUFHW, DL, MVT::v8i16,
7633 DAG.getNode(ISD::BITCAST, DL, MVT::v8i16, InputV),
7634 getV4X86ShuffleImm8ForMask(PSHUFHWMask, DAG)));
7637 // If this would require more than 2 unpack instructions to expand, use
7638 // pshufb when available. We can only use more than 2 unpack instructions
7639 // when zero extending i8 elements which also makes it easier to use pshufb.
7640 if (Scale > 4 && EltBits == 8 && Subtarget->hasSSSE3()) {
7641 assert(NumElements == 16 && "Unexpected byte vector width!");
7642 SDValue PSHUFBMask[16];
7643 for (int i = 0; i < 16; ++i)
7645 DAG.getConstant((i % Scale == 0) ? i / Scale : 0x80, MVT::i8);
7646 InputV = DAG.getNode(ISD::BITCAST, DL, MVT::v16i8, InputV);
7647 return DAG.getNode(ISD::BITCAST, DL, VT,
7648 DAG.getNode(X86ISD::PSHUFB, DL, MVT::v16i8, InputV,
7649 DAG.getNode(ISD::BUILD_VECTOR, DL,
7650 MVT::v16i8, PSHUFBMask)));
7653 // Otherwise emit a sequence of unpacks.
7655 MVT InputVT = MVT::getVectorVT(MVT::getIntegerVT(EltBits), NumElements);
7656 SDValue Ext = AnyExt ? DAG.getUNDEF(InputVT)
7657 : getZeroVector(InputVT, Subtarget, DAG, DL);
7658 InputV = DAG.getNode(ISD::BITCAST, DL, InputVT, InputV);
7659 InputV = DAG.getNode(X86ISD::UNPCKL, DL, InputVT, InputV, Ext);
7663 } while (Scale > 1);
7664 return DAG.getNode(ISD::BITCAST, DL, VT, InputV);
7667 /// \brief Try to lower a vector shuffle as a zero extension on any micrarch.
7669 /// This routine will try to do everything in its power to cleverly lower
7670 /// a shuffle which happens to match the pattern of a zero extend. It doesn't
7671 /// check for the profitability of this lowering, it tries to aggressively
7672 /// match this pattern. It will use all of the micro-architectural details it
7673 /// can to emit an efficient lowering. It handles both blends with all-zero
7674 /// inputs to explicitly zero-extend and undef-lanes (sometimes undef due to
7675 /// masking out later).
7677 /// The reason we have dedicated lowering for zext-style shuffles is that they
7678 /// are both incredibly common and often quite performance sensitive.
7679 static SDValue lowerVectorShuffleAsZeroOrAnyExtend(
7680 SDLoc DL, MVT VT, SDValue V1, SDValue V2, ArrayRef<int> Mask,
7681 const X86Subtarget *Subtarget, SelectionDAG &DAG) {
7682 SmallBitVector Zeroable = computeZeroableShuffleElements(Mask, V1, V2);
7684 int Bits = VT.getSizeInBits();
7685 int NumElements = Mask.size();
7687 // Define a helper function to check a particular ext-scale and lower to it if
7689 auto Lower = [&](int Scale) -> SDValue {
7692 for (int i = 0; i < NumElements; ++i) {
7694 continue; // Valid anywhere but doesn't tell us anything.
7695 if (i % Scale != 0) {
7696 // Each of the extend elements needs to be zeroable.
7700 // We no lorger are in the anyext case.
7705 // Each of the base elements needs to be consecutive indices into the
7706 // same input vector.
7707 SDValue V = Mask[i] < NumElements ? V1 : V2;
7710 else if (InputV != V)
7711 return SDValue(); // Flip-flopping inputs.
7713 if (Mask[i] % NumElements != i / Scale)
7714 return SDValue(); // Non-consecutive strided elemenst.
7717 // If we fail to find an input, we have a zero-shuffle which should always
7718 // have already been handled.
7719 // FIXME: Maybe handle this here in case during blending we end up with one?
7723 return lowerVectorShuffleAsSpecificZeroOrAnyExtend(
7724 DL, VT, NumElements, Scale, AnyExt, InputV, Subtarget, DAG);
7727 // The widest scale possible for extending is to a 64-bit integer.
7728 assert(Bits % 64 == 0 &&
7729 "The number of bits in a vector must be divisible by 64 on x86!");
7730 int NumExtElements = Bits / 64;
7732 // Each iteration, try extending the elements half as much, but into twice as
7734 for (; NumExtElements < NumElements; NumExtElements *= 2) {
7735 assert(NumElements % NumExtElements == 0 &&
7736 "The input vector size must be divisble by the extended size.");
7737 if (SDValue V = Lower(NumElements / NumExtElements))
7741 // No viable ext lowering found.
7745 /// \brief Try to get a scalar value for a specific element of a vector.
7747 /// Looks through BUILD_VECTOR and SCALAR_TO_VECTOR nodes to find a scalar.
7748 static SDValue getScalarValueForVectorElement(SDValue V, int Idx,
7749 SelectionDAG &DAG) {
7750 MVT VT = V.getSimpleValueType();
7751 MVT EltVT = VT.getVectorElementType();
7752 while (V.getOpcode() == ISD::BITCAST)
7753 V = V.getOperand(0);
7754 // If the bitcasts shift the element size, we can't extract an equivalent
7756 MVT NewVT = V.getSimpleValueType();
7757 if (!NewVT.isVector() || NewVT.getScalarSizeInBits() != VT.getScalarSizeInBits())
7760 if (V.getOpcode() == ISD::BUILD_VECTOR ||
7761 (Idx == 0 && V.getOpcode() == ISD::SCALAR_TO_VECTOR))
7762 return DAG.getNode(ISD::BITCAST, SDLoc(V), EltVT, V.getOperand(Idx));
7767 /// \brief Helper to test for a load that can be folded with x86 shuffles.
7769 /// This is particularly important because the set of instructions varies
7770 /// significantly based on whether the operand is a load or not.
7771 static bool isShuffleFoldableLoad(SDValue V) {
7772 while (V.getOpcode() == ISD::BITCAST)
7773 V = V.getOperand(0);
7775 return ISD::isNON_EXTLoad(V.getNode());
7778 /// \brief Try to lower insertion of a single element into a zero vector.
7780 /// This is a common pattern that we have especially efficient patterns to lower
7781 /// across all subtarget feature sets.
7782 static SDValue lowerVectorShuffleAsElementInsertion(
7783 MVT VT, SDLoc DL, SDValue V1, SDValue V2, ArrayRef<int> Mask,
7784 const X86Subtarget *Subtarget, SelectionDAG &DAG) {
7785 SmallBitVector Zeroable = computeZeroableShuffleElements(Mask, V1, V2);
7787 MVT EltVT = VT.getVectorElementType();
7789 int V2Index = std::find_if(Mask.begin(), Mask.end(),
7790 [&Mask](int M) { return M >= (int)Mask.size(); }) -
7792 bool IsV1Zeroable = true;
7793 for (int i = 0, Size = Mask.size(); i < Size; ++i)
7794 if (i != V2Index && !Zeroable[i]) {
7795 IsV1Zeroable = false;
7799 // Check for a single input from a SCALAR_TO_VECTOR node.
7800 // FIXME: All of this should be canonicalized into INSERT_VECTOR_ELT and
7801 // all the smarts here sunk into that routine. However, the current
7802 // lowering of BUILD_VECTOR makes that nearly impossible until the old
7803 // vector shuffle lowering is dead.
7804 if (SDValue V2S = getScalarValueForVectorElement(
7805 V2, Mask[V2Index] - Mask.size(), DAG)) {
7806 // We need to zext the scalar if it is smaller than an i32.
7807 V2S = DAG.getNode(ISD::BITCAST, DL, EltVT, V2S);
7808 if (EltVT == MVT::i8 || EltVT == MVT::i16) {
7809 // Using zext to expand a narrow element won't work for non-zero
7814 // Zero-extend directly to i32.
7816 V2S = DAG.getNode(ISD::ZERO_EXTEND, DL, MVT::i32, V2S);
7818 V2 = DAG.getNode(ISD::SCALAR_TO_VECTOR, DL, ExtVT, V2S);
7819 } else if (Mask[V2Index] != (int)Mask.size() || EltVT == MVT::i8 ||
7820 EltVT == MVT::i16) {
7821 // Either not inserting from the low element of the input or the input
7822 // element size is too small to use VZEXT_MOVL to clear the high bits.
7826 if (!IsV1Zeroable) {
7827 // If V1 can't be treated as a zero vector we have fewer options to lower
7828 // this. We can't support integer vectors or non-zero targets cheaply, and
7829 // the V1 elements can't be permuted in any way.
7830 assert(VT == ExtVT && "Cannot change extended type when non-zeroable!");
7831 if (!VT.isFloatingPoint() || V2Index != 0)
7833 SmallVector<int, 8> V1Mask(Mask.begin(), Mask.end());
7834 V1Mask[V2Index] = -1;
7835 if (!isNoopShuffleMask(V1Mask))
7837 // This is essentially a special case blend operation, but if we have
7838 // general purpose blend operations, they are always faster. Bail and let
7839 // the rest of the lowering handle these as blends.
7840 if (Subtarget->hasSSE41())
7843 // Otherwise, use MOVSD or MOVSS.
7844 assert((EltVT == MVT::f32 || EltVT == MVT::f64) &&
7845 "Only two types of floating point element types to handle!");
7846 return DAG.getNode(EltVT == MVT::f32 ? X86ISD::MOVSS : X86ISD::MOVSD, DL,
7850 V2 = DAG.getNode(X86ISD::VZEXT_MOVL, DL, ExtVT, V2);
7852 V2 = DAG.getNode(ISD::BITCAST, DL, VT, V2);
7855 // If we have 4 or fewer lanes we can cheaply shuffle the element into
7856 // the desired position. Otherwise it is more efficient to do a vector
7857 // shift left. We know that we can do a vector shift left because all
7858 // the inputs are zero.
7859 if (VT.isFloatingPoint() || VT.getVectorNumElements() <= 4) {
7860 SmallVector<int, 4> V2Shuffle(Mask.size(), 1);
7861 V2Shuffle[V2Index] = 0;
7862 V2 = DAG.getVectorShuffle(VT, DL, V2, DAG.getUNDEF(VT), V2Shuffle);
7864 V2 = DAG.getNode(ISD::BITCAST, DL, MVT::v2i64, V2);
7866 X86ISD::VSHLDQ, DL, MVT::v2i64, V2,
7868 V2Index * EltVT.getSizeInBits(),
7869 DAG.getTargetLoweringInfo().getScalarShiftAmountTy(MVT::v2i64)));
7870 V2 = DAG.getNode(ISD::BITCAST, DL, VT, V2);
7876 /// \brief Try to lower broadcast of a single element.
7878 /// For convenience, this code also bundles all of the subtarget feature set
7879 /// filtering. While a little annoying to re-dispatch on type here, there isn't
7880 /// a convenient way to factor it out.
7881 static SDValue lowerVectorShuffleAsBroadcast(MVT VT, SDLoc DL, SDValue V,
7883 const X86Subtarget *Subtarget,
7884 SelectionDAG &DAG) {
7885 if (!Subtarget->hasAVX())
7887 if (VT.isInteger() && !Subtarget->hasAVX2())
7890 // Check that the mask is a broadcast.
7891 int BroadcastIdx = -1;
7893 if (M >= 0 && BroadcastIdx == -1)
7895 else if (M >= 0 && M != BroadcastIdx)
7898 assert(BroadcastIdx < (int)Mask.size() && "We only expect to be called with "
7899 "a sorted mask where the broadcast "
7902 // Go up the chain of (vector) values to try and find a scalar load that
7903 // we can combine with the broadcast.
7905 switch (V.getOpcode()) {
7906 case ISD::CONCAT_VECTORS: {
7907 int OperandSize = Mask.size() / V.getNumOperands();
7908 V = V.getOperand(BroadcastIdx / OperandSize);
7909 BroadcastIdx %= OperandSize;
7913 case ISD::INSERT_SUBVECTOR: {
7914 SDValue VOuter = V.getOperand(0), VInner = V.getOperand(1);
7915 auto ConstantIdx = dyn_cast<ConstantSDNode>(V.getOperand(2));
7919 int BeginIdx = (int)ConstantIdx->getZExtValue();
7921 BeginIdx + (int)VInner.getValueType().getVectorNumElements();
7922 if (BroadcastIdx >= BeginIdx && BroadcastIdx < EndIdx) {
7923 BroadcastIdx -= BeginIdx;
7934 // Check if this is a broadcast of a scalar. We special case lowering
7935 // for scalars so that we can more effectively fold with loads.
7936 if (V.getOpcode() == ISD::BUILD_VECTOR ||
7937 (V.getOpcode() == ISD::SCALAR_TO_VECTOR && BroadcastIdx == 0)) {
7938 V = V.getOperand(BroadcastIdx);
7940 // If the scalar isn't a load we can't broadcast from it in AVX1, only with
7942 if (!Subtarget->hasAVX2() && !isShuffleFoldableLoad(V))
7944 } else if (BroadcastIdx != 0 || !Subtarget->hasAVX2()) {
7945 // We can't broadcast from a vector register w/o AVX2, and we can only
7946 // broadcast from the zero-element of a vector register.
7950 return DAG.getNode(X86ISD::VBROADCAST, DL, VT, V);
7953 /// \brief Handle lowering of 2-lane 64-bit floating point shuffles.
7955 /// This is the basis function for the 2-lane 64-bit shuffles as we have full
7956 /// support for floating point shuffles but not integer shuffles. These
7957 /// instructions will incur a domain crossing penalty on some chips though so
7958 /// it is better to avoid lowering through this for integer vectors where
7960 static SDValue lowerV2F64VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
7961 const X86Subtarget *Subtarget,
7962 SelectionDAG &DAG) {
7964 assert(Op.getSimpleValueType() == MVT::v2f64 && "Bad shuffle type!");
7965 assert(V1.getSimpleValueType() == MVT::v2f64 && "Bad operand type!");
7966 assert(V2.getSimpleValueType() == MVT::v2f64 && "Bad operand type!");
7967 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
7968 ArrayRef<int> Mask = SVOp->getMask();
7969 assert(Mask.size() == 2 && "Unexpected mask size for v2 shuffle!");
7971 if (isSingleInputShuffleMask(Mask)) {
7972 // Straight shuffle of a single input vector. Simulate this by using the
7973 // single input as both of the "inputs" to this instruction..
7974 unsigned SHUFPDMask = (Mask[0] == 1) | ((Mask[1] == 1) << 1);
7976 if (Subtarget->hasAVX()) {
7977 // If we have AVX, we can use VPERMILPS which will allow folding a load
7978 // into the shuffle.
7979 return DAG.getNode(X86ISD::VPERMILPI, DL, MVT::v2f64, V1,
7980 DAG.getConstant(SHUFPDMask, MVT::i8));
7983 return DAG.getNode(X86ISD::SHUFP, SDLoc(Op), MVT::v2f64, V1, V1,
7984 DAG.getConstant(SHUFPDMask, MVT::i8));
7986 assert(Mask[0] >= 0 && Mask[0] < 2 && "Non-canonicalized blend!");
7987 assert(Mask[1] >= 2 && "Non-canonicalized blend!");
7989 // Use dedicated unpack instructions for masks that match their pattern.
7990 if (isShuffleEquivalent(Mask, 0, 2))
7991 return DAG.getNode(X86ISD::UNPCKL, DL, MVT::v2f64, V1, V2);
7992 if (isShuffleEquivalent(Mask, 1, 3))
7993 return DAG.getNode(X86ISD::UNPCKH, DL, MVT::v2f64, V1, V2);
7995 // If we have a single input, insert that into V1 if we can do so cheaply.
7996 if ((Mask[0] >= 2) + (Mask[1] >= 2) == 1) {
7997 if (SDValue Insertion = lowerVectorShuffleAsElementInsertion(
7998 MVT::v2f64, DL, V1, V2, Mask, Subtarget, DAG))
8000 // Try inverting the insertion since for v2 masks it is easy to do and we
8001 // can't reliably sort the mask one way or the other.
8002 int InverseMask[2] = {Mask[0] < 0 ? -1 : (Mask[0] ^ 2),
8003 Mask[1] < 0 ? -1 : (Mask[1] ^ 2)};
8004 if (SDValue Insertion = lowerVectorShuffleAsElementInsertion(
8005 MVT::v2f64, DL, V2, V1, InverseMask, Subtarget, DAG))
8009 // Try to use one of the special instruction patterns to handle two common
8010 // blend patterns if a zero-blend above didn't work.
8011 if (isShuffleEquivalent(Mask, 0, 3) || isShuffleEquivalent(Mask, 1, 3))
8012 if (SDValue V1S = getScalarValueForVectorElement(V1, Mask[0], DAG))
8013 // We can either use a special instruction to load over the low double or
8014 // to move just the low double.
8016 isShuffleFoldableLoad(V1S) ? X86ISD::MOVLPD : X86ISD::MOVSD,
8018 DAG.getNode(ISD::SCALAR_TO_VECTOR, DL, MVT::v2f64, V1S));
8020 if (Subtarget->hasSSE41())
8021 if (SDValue Blend = lowerVectorShuffleAsBlend(DL, MVT::v2f64, V1, V2, Mask,
8025 unsigned SHUFPDMask = (Mask[0] == 1) | (((Mask[1] - 2) == 1) << 1);
8026 return DAG.getNode(X86ISD::SHUFP, SDLoc(Op), MVT::v2f64, V1, V2,
8027 DAG.getConstant(SHUFPDMask, MVT::i8));
8030 /// \brief Handle lowering of 2-lane 64-bit integer shuffles.
8032 /// Tries to lower a 2-lane 64-bit shuffle using shuffle operations provided by
8033 /// the integer unit to minimize domain crossing penalties. However, for blends
8034 /// it falls back to the floating point shuffle operation with appropriate bit
8036 static SDValue lowerV2I64VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
8037 const X86Subtarget *Subtarget,
8038 SelectionDAG &DAG) {
8040 assert(Op.getSimpleValueType() == MVT::v2i64 && "Bad shuffle type!");
8041 assert(V1.getSimpleValueType() == MVT::v2i64 && "Bad operand type!");
8042 assert(V2.getSimpleValueType() == MVT::v2i64 && "Bad operand type!");
8043 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
8044 ArrayRef<int> Mask = SVOp->getMask();
8045 assert(Mask.size() == 2 && "Unexpected mask size for v2 shuffle!");
8047 if (isSingleInputShuffleMask(Mask)) {
8048 // Check for being able to broadcast a single element.
8049 if (SDValue Broadcast = lowerVectorShuffleAsBroadcast(MVT::v2i64, DL, V1,
8050 Mask, Subtarget, DAG))
8053 // Straight shuffle of a single input vector. For everything from SSE2
8054 // onward this has a single fast instruction with no scary immediates.
8055 // We have to map the mask as it is actually a v4i32 shuffle instruction.
8056 V1 = DAG.getNode(ISD::BITCAST, DL, MVT::v4i32, V1);
8057 int WidenedMask[4] = {
8058 std::max(Mask[0], 0) * 2, std::max(Mask[0], 0) * 2 + 1,
8059 std::max(Mask[1], 0) * 2, std::max(Mask[1], 0) * 2 + 1};
8061 ISD::BITCAST, DL, MVT::v2i64,
8062 DAG.getNode(X86ISD::PSHUFD, SDLoc(Op), MVT::v4i32, V1,
8063 getV4X86ShuffleImm8ForMask(WidenedMask, DAG)));
8066 // If we have a single input from V2 insert that into V1 if we can do so
8068 if ((Mask[0] >= 2) + (Mask[1] >= 2) == 1) {
8069 if (SDValue Insertion = lowerVectorShuffleAsElementInsertion(
8070 MVT::v2i64, DL, V1, V2, Mask, Subtarget, DAG))
8072 // Try inverting the insertion since for v2 masks it is easy to do and we
8073 // can't reliably sort the mask one way or the other.
8074 int InverseMask[2] = {Mask[0] < 0 ? -1 : (Mask[0] ^ 2),
8075 Mask[1] < 0 ? -1 : (Mask[1] ^ 2)};
8076 if (SDValue Insertion = lowerVectorShuffleAsElementInsertion(
8077 MVT::v2i64, DL, V2, V1, InverseMask, Subtarget, DAG))
8081 // Use dedicated unpack instructions for masks that match their pattern.
8082 if (isShuffleEquivalent(Mask, 0, 2))
8083 return DAG.getNode(X86ISD::UNPCKL, DL, MVT::v2i64, V1, V2);
8084 if (isShuffleEquivalent(Mask, 1, 3))
8085 return DAG.getNode(X86ISD::UNPCKH, DL, MVT::v2i64, V1, V2);
8087 if (Subtarget->hasSSE41())
8088 if (SDValue Blend = lowerVectorShuffleAsBlend(DL, MVT::v2i64, V1, V2, Mask,
8092 // Try to use rotation instructions if available.
8093 if (Subtarget->hasSSSE3())
8094 if (SDValue Rotate = lowerVectorShuffleAsByteRotate(
8095 DL, MVT::v2i64, V1, V2, Mask, DAG))
8098 // We implement this with SHUFPD which is pretty lame because it will likely
8099 // incur 2 cycles of stall for integer vectors on Nehalem and older chips.
8100 // However, all the alternatives are still more cycles and newer chips don't
8101 // have this problem. It would be really nice if x86 had better shuffles here.
8102 V1 = DAG.getNode(ISD::BITCAST, DL, MVT::v2f64, V1);
8103 V2 = DAG.getNode(ISD::BITCAST, DL, MVT::v2f64, V2);
8104 return DAG.getNode(ISD::BITCAST, DL, MVT::v2i64,
8105 DAG.getVectorShuffle(MVT::v2f64, DL, V1, V2, Mask));
8108 /// \brief Lower a vector shuffle using the SHUFPS instruction.
8110 /// This is a helper routine dedicated to lowering vector shuffles using SHUFPS.
8111 /// It makes no assumptions about whether this is the *best* lowering, it simply
8113 static SDValue lowerVectorShuffleWithSHUFPS(SDLoc DL, MVT VT,
8114 ArrayRef<int> Mask, SDValue V1,
8115 SDValue V2, SelectionDAG &DAG) {
8116 SDValue LowV = V1, HighV = V2;
8117 int NewMask[4] = {Mask[0], Mask[1], Mask[2], Mask[3]};
8120 std::count_if(Mask.begin(), Mask.end(), [](int M) { return M >= 4; });
8122 if (NumV2Elements == 1) {
8124 std::find_if(Mask.begin(), Mask.end(), [](int M) { return M >= 4; }) -
8127 // Compute the index adjacent to V2Index and in the same half by toggling
8129 int V2AdjIndex = V2Index ^ 1;
8131 if (Mask[V2AdjIndex] == -1) {
8132 // Handles all the cases where we have a single V2 element and an undef.
8133 // This will only ever happen in the high lanes because we commute the
8134 // vector otherwise.
8136 std::swap(LowV, HighV);
8137 NewMask[V2Index] -= 4;
8139 // Handle the case where the V2 element ends up adjacent to a V1 element.
8140 // To make this work, blend them together as the first step.
8141 int V1Index = V2AdjIndex;
8142 int BlendMask[4] = {Mask[V2Index] - 4, 0, Mask[V1Index], 0};
8143 V2 = DAG.getNode(X86ISD::SHUFP, DL, VT, V2, V1,
8144 getV4X86ShuffleImm8ForMask(BlendMask, DAG));
8146 // Now proceed to reconstruct the final blend as we have the necessary
8147 // high or low half formed.
8154 NewMask[V1Index] = 2; // We put the V1 element in V2[2].
8155 NewMask[V2Index] = 0; // We shifted the V2 element into V2[0].
8157 } else if (NumV2Elements == 2) {
8158 if (Mask[0] < 4 && Mask[1] < 4) {
8159 // Handle the easy case where we have V1 in the low lanes and V2 in the
8163 } else if (Mask[2] < 4 && Mask[3] < 4) {
8164 // We also handle the reversed case because this utility may get called
8165 // when we detect a SHUFPS pattern but can't easily commute the shuffle to
8166 // arrange things in the right direction.
8172 // We have a mixture of V1 and V2 in both low and high lanes. Rather than
8173 // trying to place elements directly, just blend them and set up the final
8174 // shuffle to place them.
8176 // The first two blend mask elements are for V1, the second two are for
8178 int BlendMask[4] = {Mask[0] < 4 ? Mask[0] : Mask[1],
8179 Mask[2] < 4 ? Mask[2] : Mask[3],
8180 (Mask[0] >= 4 ? Mask[0] : Mask[1]) - 4,
8181 (Mask[2] >= 4 ? Mask[2] : Mask[3]) - 4};
8182 V1 = DAG.getNode(X86ISD::SHUFP, DL, VT, V1, V2,
8183 getV4X86ShuffleImm8ForMask(BlendMask, DAG));
8185 // Now we do a normal shuffle of V1 by giving V1 as both operands to
8188 NewMask[0] = Mask[0] < 4 ? 0 : 2;
8189 NewMask[1] = Mask[0] < 4 ? 2 : 0;
8190 NewMask[2] = Mask[2] < 4 ? 1 : 3;
8191 NewMask[3] = Mask[2] < 4 ? 3 : 1;
8194 return DAG.getNode(X86ISD::SHUFP, DL, VT, LowV, HighV,
8195 getV4X86ShuffleImm8ForMask(NewMask, DAG));
8198 /// \brief Lower 4-lane 32-bit floating point shuffles.
8200 /// Uses instructions exclusively from the floating point unit to minimize
8201 /// domain crossing penalties, as these are sufficient to implement all v4f32
8203 static SDValue lowerV4F32VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
8204 const X86Subtarget *Subtarget,
8205 SelectionDAG &DAG) {
8207 assert(Op.getSimpleValueType() == MVT::v4f32 && "Bad shuffle type!");
8208 assert(V1.getSimpleValueType() == MVT::v4f32 && "Bad operand type!");
8209 assert(V2.getSimpleValueType() == MVT::v4f32 && "Bad operand type!");
8210 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
8211 ArrayRef<int> Mask = SVOp->getMask();
8212 assert(Mask.size() == 4 && "Unexpected mask size for v4 shuffle!");
8215 std::count_if(Mask.begin(), Mask.end(), [](int M) { return M >= 4; });
8217 if (NumV2Elements == 0) {
8218 // Check for being able to broadcast a single element.
8219 if (SDValue Broadcast = lowerVectorShuffleAsBroadcast(MVT::v4f32, DL, V1,
8220 Mask, Subtarget, DAG))
8223 if (Subtarget->hasAVX()) {
8224 // If we have AVX, we can use VPERMILPS which will allow folding a load
8225 // into the shuffle.
8226 return DAG.getNode(X86ISD::VPERMILPI, DL, MVT::v4f32, V1,
8227 getV4X86ShuffleImm8ForMask(Mask, DAG));
8230 // Otherwise, use a straight shuffle of a single input vector. We pass the
8231 // input vector to both operands to simulate this with a SHUFPS.
8232 return DAG.getNode(X86ISD::SHUFP, DL, MVT::v4f32, V1, V1,
8233 getV4X86ShuffleImm8ForMask(Mask, DAG));
8236 // Use dedicated unpack instructions for masks that match their pattern.
8237 if (isShuffleEquivalent(Mask, 0, 4, 1, 5))
8238 return DAG.getNode(X86ISD::UNPCKL, DL, MVT::v4f32, V1, V2);
8239 if (isShuffleEquivalent(Mask, 2, 6, 3, 7))
8240 return DAG.getNode(X86ISD::UNPCKH, DL, MVT::v4f32, V1, V2);
8242 // There are special ways we can lower some single-element blends. However, we
8243 // have custom ways we can lower more complex single-element blends below that
8244 // we defer to if both this and BLENDPS fail to match, so restrict this to
8245 // when the V2 input is targeting element 0 of the mask -- that is the fast
8247 if (NumV2Elements == 1 && Mask[0] >= 4)
8248 if (SDValue V = lowerVectorShuffleAsElementInsertion(MVT::v4f32, DL, V1, V2,
8249 Mask, Subtarget, DAG))
8252 if (Subtarget->hasSSE41())
8253 if (SDValue Blend = lowerVectorShuffleAsBlend(DL, MVT::v4f32, V1, V2, Mask,
8257 // Check for whether we can use INSERTPS to perform the blend. We only use
8258 // INSERTPS when the V1 elements are already in the correct locations
8259 // because otherwise we can just always use two SHUFPS instructions which
8260 // are much smaller to encode than a SHUFPS and an INSERTPS.
8261 if (NumV2Elements == 1 && Subtarget->hasSSE41()) {
8263 std::find_if(Mask.begin(), Mask.end(), [](int M) { return M >= 4; }) -
8266 // When using INSERTPS we can zero any lane of the destination. Collect
8267 // the zero inputs into a mask and drop them from the lanes of V1 which
8268 // actually need to be present as inputs to the INSERTPS.
8269 SmallBitVector Zeroable = computeZeroableShuffleElements(Mask, V1, V2);
8271 // Synthesize a shuffle mask for the non-zero and non-v2 inputs.
8272 bool InsertNeedsShuffle = false;
8274 for (int i = 0; i < 4; ++i)
8278 } else if (Mask[i] != i) {
8279 InsertNeedsShuffle = true;
8284 // We don't want to use INSERTPS or other insertion techniques if it will
8285 // require shuffling anyways.
8286 if (!InsertNeedsShuffle) {
8287 // If all of V1 is zeroable, replace it with undef.
8288 if ((ZMask | 1 << V2Index) == 0xF)
8289 V1 = DAG.getUNDEF(MVT::v4f32);
8291 unsigned InsertPSMask = (Mask[V2Index] - 4) << 6 | V2Index << 4 | ZMask;
8292 assert((InsertPSMask & ~0xFFu) == 0 && "Invalid mask!");
8294 // Insert the V2 element into the desired position.
8295 return DAG.getNode(X86ISD::INSERTPS, DL, MVT::v4f32, V1, V2,
8296 DAG.getConstant(InsertPSMask, MVT::i8));
8300 // Otherwise fall back to a SHUFPS lowering strategy.
8301 return lowerVectorShuffleWithSHUFPS(DL, MVT::v4f32, Mask, V1, V2, DAG);
8304 /// \brief Lower 4-lane i32 vector shuffles.
8306 /// We try to handle these with integer-domain shuffles where we can, but for
8307 /// blends we use the floating point domain blend instructions.
8308 static SDValue lowerV4I32VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
8309 const X86Subtarget *Subtarget,
8310 SelectionDAG &DAG) {
8312 assert(Op.getSimpleValueType() == MVT::v4i32 && "Bad shuffle type!");
8313 assert(V1.getSimpleValueType() == MVT::v4i32 && "Bad operand type!");
8314 assert(V2.getSimpleValueType() == MVT::v4i32 && "Bad operand type!");
8315 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
8316 ArrayRef<int> Mask = SVOp->getMask();
8317 assert(Mask.size() == 4 && "Unexpected mask size for v4 shuffle!");
8319 // Whenever we can lower this as a zext, that instruction is strictly faster
8320 // than any alternative. It also allows us to fold memory operands into the
8321 // shuffle in many cases.
8322 if (SDValue ZExt = lowerVectorShuffleAsZeroOrAnyExtend(DL, MVT::v4i32, V1, V2,
8323 Mask, Subtarget, DAG))
8327 std::count_if(Mask.begin(), Mask.end(), [](int M) { return M >= 4; });
8329 if (NumV2Elements == 0) {
8330 // Check for being able to broadcast a single element.
8331 if (SDValue Broadcast = lowerVectorShuffleAsBroadcast(MVT::v4i32, DL, V1,
8332 Mask, Subtarget, DAG))
8335 // Straight shuffle of a single input vector. For everything from SSE2
8336 // onward this has a single fast instruction with no scary immediates.
8337 // We coerce the shuffle pattern to be compatible with UNPCK instructions
8338 // but we aren't actually going to use the UNPCK instruction because doing
8339 // so prevents folding a load into this instruction or making a copy.
8340 const int UnpackLoMask[] = {0, 0, 1, 1};
8341 const int UnpackHiMask[] = {2, 2, 3, 3};
8342 if (isShuffleEquivalent(Mask, 0, 0, 1, 1))
8343 Mask = UnpackLoMask;
8344 else if (isShuffleEquivalent(Mask, 2, 2, 3, 3))
8345 Mask = UnpackHiMask;
8347 return DAG.getNode(X86ISD::PSHUFD, DL, MVT::v4i32, V1,
8348 getV4X86ShuffleImm8ForMask(Mask, DAG));
8351 // There are special ways we can lower some single-element blends.
8352 if (NumV2Elements == 1)
8353 if (SDValue V = lowerVectorShuffleAsElementInsertion(MVT::v4i32, DL, V1, V2,
8354 Mask, Subtarget, DAG))
8357 // Use dedicated unpack instructions for masks that match their pattern.
8358 if (isShuffleEquivalent(Mask, 0, 4, 1, 5))
8359 return DAG.getNode(X86ISD::UNPCKL, DL, MVT::v4i32, V1, V2);
8360 if (isShuffleEquivalent(Mask, 2, 6, 3, 7))
8361 return DAG.getNode(X86ISD::UNPCKH, DL, MVT::v4i32, V1, V2);
8363 if (Subtarget->hasSSE41())
8364 if (SDValue Blend = lowerVectorShuffleAsBlend(DL, MVT::v4i32, V1, V2, Mask,
8368 // Try to use rotation instructions if available.
8369 if (Subtarget->hasSSSE3())
8370 if (SDValue Rotate = lowerVectorShuffleAsByteRotate(
8371 DL, MVT::v4i32, V1, V2, Mask, DAG))
8374 // We implement this with SHUFPS because it can blend from two vectors.
8375 // Because we're going to eventually use SHUFPS, we use SHUFPS even to build
8376 // up the inputs, bypassing domain shift penalties that we would encur if we
8377 // directly used PSHUFD on Nehalem and older. For newer chips, this isn't
8379 return DAG.getNode(ISD::BITCAST, DL, MVT::v4i32,
8380 DAG.getVectorShuffle(
8382 DAG.getNode(ISD::BITCAST, DL, MVT::v4f32, V1),
8383 DAG.getNode(ISD::BITCAST, DL, MVT::v4f32, V2), Mask));
8386 /// \brief Lowering of single-input v8i16 shuffles is the cornerstone of SSE2
8387 /// shuffle lowering, and the most complex part.
8389 /// The lowering strategy is to try to form pairs of input lanes which are
8390 /// targeted at the same half of the final vector, and then use a dword shuffle
8391 /// to place them onto the right half, and finally unpack the paired lanes into
8392 /// their final position.
8394 /// The exact breakdown of how to form these dword pairs and align them on the
8395 /// correct sides is really tricky. See the comments within the function for
8396 /// more of the details.
8397 static SDValue lowerV8I16SingleInputVectorShuffle(
8398 SDLoc DL, SDValue V, MutableArrayRef<int> Mask,
8399 const X86Subtarget *Subtarget, SelectionDAG &DAG) {
8400 assert(V.getSimpleValueType() == MVT::v8i16 && "Bad input type!");
8401 MutableArrayRef<int> LoMask = Mask.slice(0, 4);
8402 MutableArrayRef<int> HiMask = Mask.slice(4, 4);
8404 SmallVector<int, 4> LoInputs;
8405 std::copy_if(LoMask.begin(), LoMask.end(), std::back_inserter(LoInputs),
8406 [](int M) { return M >= 0; });
8407 std::sort(LoInputs.begin(), LoInputs.end());
8408 LoInputs.erase(std::unique(LoInputs.begin(), LoInputs.end()), LoInputs.end());
8409 SmallVector<int, 4> HiInputs;
8410 std::copy_if(HiMask.begin(), HiMask.end(), std::back_inserter(HiInputs),
8411 [](int M) { return M >= 0; });
8412 std::sort(HiInputs.begin(), HiInputs.end());
8413 HiInputs.erase(std::unique(HiInputs.begin(), HiInputs.end()), HiInputs.end());
8415 std::lower_bound(LoInputs.begin(), LoInputs.end(), 4) - LoInputs.begin();
8416 int NumHToL = LoInputs.size() - NumLToL;
8418 std::lower_bound(HiInputs.begin(), HiInputs.end(), 4) - HiInputs.begin();
8419 int NumHToH = HiInputs.size() - NumLToH;
8420 MutableArrayRef<int> LToLInputs(LoInputs.data(), NumLToL);
8421 MutableArrayRef<int> LToHInputs(HiInputs.data(), NumLToH);
8422 MutableArrayRef<int> HToLInputs(LoInputs.data() + NumLToL, NumHToL);
8423 MutableArrayRef<int> HToHInputs(HiInputs.data() + NumLToH, NumHToH);
8425 // Check for being able to broadcast a single element.
8426 if (SDValue Broadcast = lowerVectorShuffleAsBroadcast(MVT::v8i16, DL, V,
8427 Mask, Subtarget, DAG))
8430 // Use dedicated unpack instructions for masks that match their pattern.
8431 if (isShuffleEquivalent(Mask, 0, 0, 1, 1, 2, 2, 3, 3))
8432 return DAG.getNode(X86ISD::UNPCKL, DL, MVT::v8i16, V, V);
8433 if (isShuffleEquivalent(Mask, 4, 4, 5, 5, 6, 6, 7, 7))
8434 return DAG.getNode(X86ISD::UNPCKH, DL, MVT::v8i16, V, V);
8436 // Try to use rotation instructions if available.
8437 if (Subtarget->hasSSSE3())
8438 if (SDValue Rotate = lowerVectorShuffleAsByteRotate(
8439 DL, MVT::v8i16, V, V, Mask, DAG))
8442 // Simplify the 1-into-3 and 3-into-1 cases with a single pshufd. For all
8443 // such inputs we can swap two of the dwords across the half mark and end up
8444 // with <=2 inputs to each half in each half. Once there, we can fall through
8445 // to the generic code below. For example:
8447 // Input: [a, b, c, d, e, f, g, h] -PSHUFD[0,2,1,3]-> [a, b, e, f, c, d, g, h]
8448 // Mask: [0, 1, 2, 7, 4, 5, 6, 3] -----------------> [0, 1, 4, 7, 2, 3, 6, 5]
8450 // However in some very rare cases we have a 1-into-3 or 3-into-1 on one half
8451 // and an existing 2-into-2 on the other half. In this case we may have to
8452 // pre-shuffle the 2-into-2 half to avoid turning it into a 3-into-1 or
8453 // 1-into-3 which could cause us to cycle endlessly fixing each side in turn.
8454 // Fortunately, we don't have to handle anything but a 2-into-2 pattern
8455 // because any other situation (including a 3-into-1 or 1-into-3 in the other
8456 // half than the one we target for fixing) will be fixed when we re-enter this
8457 // path. We will also combine away any sequence of PSHUFD instructions that
8458 // result into a single instruction. Here is an example of the tricky case:
8460 // Input: [a, b, c, d, e, f, g, h] -PSHUFD[0,2,1,3]-> [a, b, e, f, c, d, g, h]
8461 // Mask: [3, 7, 1, 0, 2, 7, 3, 5] -THIS-IS-BAD!!!!-> [5, 7, 1, 0, 4, 7, 5, 3]
8463 // This now has a 1-into-3 in the high half! Instead, we do two shuffles:
8465 // Input: [a, b, c, d, e, f, g, h] PSHUFHW[0,2,1,3]-> [a, b, c, d, e, g, f, h]
8466 // Mask: [3, 7, 1, 0, 2, 7, 3, 5] -----------------> [3, 7, 1, 0, 2, 7, 3, 6]
8468 // Input: [a, b, c, d, e, g, f, h] -PSHUFD[0,2,1,3]-> [a, b, e, g, c, d, f, h]
8469 // Mask: [3, 7, 1, 0, 2, 7, 3, 6] -----------------> [5, 7, 1, 0, 4, 7, 5, 6]
8471 // The result is fine to be handled by the generic logic.
8472 auto balanceSides = [&](ArrayRef<int> AToAInputs, ArrayRef<int> BToAInputs,
8473 ArrayRef<int> BToBInputs, ArrayRef<int> AToBInputs,
8474 int AOffset, int BOffset) {
8475 assert((AToAInputs.size() == 3 || AToAInputs.size() == 1) &&
8476 "Must call this with A having 3 or 1 inputs from the A half.");
8477 assert((BToAInputs.size() == 1 || BToAInputs.size() == 3) &&
8478 "Must call this with B having 1 or 3 inputs from the B half.");
8479 assert(AToAInputs.size() + BToAInputs.size() == 4 &&
8480 "Must call this with either 3:1 or 1:3 inputs (summing to 4).");
8482 // Compute the index of dword with only one word among the three inputs in
8483 // a half by taking the sum of the half with three inputs and subtracting
8484 // the sum of the actual three inputs. The difference is the remaining
8487 int &TripleDWord = AToAInputs.size() == 3 ? ADWord : BDWord;
8488 int &OneInputDWord = AToAInputs.size() == 3 ? BDWord : ADWord;
8489 int TripleInputOffset = AToAInputs.size() == 3 ? AOffset : BOffset;
8490 ArrayRef<int> TripleInputs = AToAInputs.size() == 3 ? AToAInputs : BToAInputs;
8491 int OneInput = AToAInputs.size() == 3 ? BToAInputs[0] : AToAInputs[0];
8492 int TripleInputSum = 0 + 1 + 2 + 3 + (4 * TripleInputOffset);
8493 int TripleNonInputIdx =
8494 TripleInputSum - std::accumulate(TripleInputs.begin(), TripleInputs.end(), 0);
8495 TripleDWord = TripleNonInputIdx / 2;
8497 // We use xor with one to compute the adjacent DWord to whichever one the
8499 OneInputDWord = (OneInput / 2) ^ 1;
8501 // Check for one tricky case: We're fixing a 3<-1 or a 1<-3 shuffle for AToA
8502 // and BToA inputs. If there is also such a problem with the BToB and AToB
8503 // inputs, we don't try to fix it necessarily -- we'll recurse and see it in
8504 // the next pass. However, if we have a 2<-2 in the BToB and AToB inputs, it
8505 // is essential that we don't *create* a 3<-1 as then we might oscillate.
8506 if (BToBInputs.size() == 2 && AToBInputs.size() == 2) {
8507 // Compute how many inputs will be flipped by swapping these DWords. We
8509 // to balance this to ensure we don't form a 3-1 shuffle in the other
8511 int NumFlippedAToBInputs =
8512 std::count(AToBInputs.begin(), AToBInputs.end(), 2 * ADWord) +
8513 std::count(AToBInputs.begin(), AToBInputs.end(), 2 * ADWord + 1);
8514 int NumFlippedBToBInputs =
8515 std::count(BToBInputs.begin(), BToBInputs.end(), 2 * BDWord) +
8516 std::count(BToBInputs.begin(), BToBInputs.end(), 2 * BDWord + 1);
8517 if ((NumFlippedAToBInputs == 1 &&
8518 (NumFlippedBToBInputs == 0 || NumFlippedBToBInputs == 2)) ||
8519 (NumFlippedBToBInputs == 1 &&
8520 (NumFlippedAToBInputs == 0 || NumFlippedAToBInputs == 2))) {
8521 // We choose whether to fix the A half or B half based on whether that
8522 // half has zero flipped inputs. At zero, we may not be able to fix it
8523 // with that half. We also bias towards fixing the B half because that
8524 // will more commonly be the high half, and we have to bias one way.
8525 auto FixFlippedInputs = [&V, &DL, &Mask, &DAG](int PinnedIdx, int DWord,
8526 ArrayRef<int> Inputs) {
8527 int FixIdx = PinnedIdx ^ 1; // The adjacent slot to the pinned slot.
8528 bool IsFixIdxInput = std::find(Inputs.begin(), Inputs.end(),
8529 PinnedIdx ^ 1) != Inputs.end();
8530 // Determine whether the free index is in the flipped dword or the
8531 // unflipped dword based on where the pinned index is. We use this bit
8532 // in an xor to conditionally select the adjacent dword.
8533 int FixFreeIdx = 2 * (DWord ^ (PinnedIdx / 2 == DWord));
8534 bool IsFixFreeIdxInput = std::find(Inputs.begin(), Inputs.end(),
8535 FixFreeIdx) != Inputs.end();
8536 if (IsFixIdxInput == IsFixFreeIdxInput)
8538 IsFixFreeIdxInput = std::find(Inputs.begin(), Inputs.end(),
8539 FixFreeIdx) != Inputs.end();
8540 assert(IsFixIdxInput != IsFixFreeIdxInput &&
8541 "We need to be changing the number of flipped inputs!");
8542 int PSHUFHalfMask[] = {0, 1, 2, 3};
8543 std::swap(PSHUFHalfMask[FixFreeIdx % 4], PSHUFHalfMask[FixIdx % 4]);
8544 V = DAG.getNode(FixIdx < 4 ? X86ISD::PSHUFLW : X86ISD::PSHUFHW, DL,
8546 getV4X86ShuffleImm8ForMask(PSHUFHalfMask, DAG));
8549 if (M != -1 && M == FixIdx)
8551 else if (M != -1 && M == FixFreeIdx)
8554 if (NumFlippedBToBInputs != 0) {
8556 BToAInputs.size() == 3 ? TripleNonInputIdx : OneInput;
8557 FixFlippedInputs(BPinnedIdx, BDWord, BToBInputs);
8559 assert(NumFlippedAToBInputs != 0 && "Impossible given predicates!");
8561 AToAInputs.size() == 3 ? TripleNonInputIdx : OneInput;
8562 FixFlippedInputs(APinnedIdx, ADWord, AToBInputs);
8567 int PSHUFDMask[] = {0, 1, 2, 3};
8568 PSHUFDMask[ADWord] = BDWord;
8569 PSHUFDMask[BDWord] = ADWord;
8570 V = DAG.getNode(ISD::BITCAST, DL, MVT::v8i16,
8571 DAG.getNode(X86ISD::PSHUFD, DL, MVT::v4i32,
8572 DAG.getNode(ISD::BITCAST, DL, MVT::v4i32, V),
8573 getV4X86ShuffleImm8ForMask(PSHUFDMask, DAG)));
8575 // Adjust the mask to match the new locations of A and B.
8577 if (M != -1 && M/2 == ADWord)
8578 M = 2 * BDWord + M % 2;
8579 else if (M != -1 && M/2 == BDWord)
8580 M = 2 * ADWord + M % 2;
8582 // Recurse back into this routine to re-compute state now that this isn't
8583 // a 3 and 1 problem.
8584 return DAG.getVectorShuffle(MVT::v8i16, DL, V, DAG.getUNDEF(MVT::v8i16),
8587 if ((NumLToL == 3 && NumHToL == 1) || (NumLToL == 1 && NumHToL == 3))
8588 return balanceSides(LToLInputs, HToLInputs, HToHInputs, LToHInputs, 0, 4);
8589 else if ((NumHToH == 3 && NumLToH == 1) || (NumHToH == 1 && NumLToH == 3))
8590 return balanceSides(HToHInputs, LToHInputs, LToLInputs, HToLInputs, 4, 0);
8592 // At this point there are at most two inputs to the low and high halves from
8593 // each half. That means the inputs can always be grouped into dwords and
8594 // those dwords can then be moved to the correct half with a dword shuffle.
8595 // We use at most one low and one high word shuffle to collect these paired
8596 // inputs into dwords, and finally a dword shuffle to place them.
8597 int PSHUFLMask[4] = {-1, -1, -1, -1};
8598 int PSHUFHMask[4] = {-1, -1, -1, -1};
8599 int PSHUFDMask[4] = {-1, -1, -1, -1};
8601 // First fix the masks for all the inputs that are staying in their
8602 // original halves. This will then dictate the targets of the cross-half
8604 auto fixInPlaceInputs =
8605 [&PSHUFDMask](ArrayRef<int> InPlaceInputs, ArrayRef<int> IncomingInputs,
8606 MutableArrayRef<int> SourceHalfMask,
8607 MutableArrayRef<int> HalfMask, int HalfOffset) {
8608 if (InPlaceInputs.empty())
8610 if (InPlaceInputs.size() == 1) {
8611 SourceHalfMask[InPlaceInputs[0] - HalfOffset] =
8612 InPlaceInputs[0] - HalfOffset;
8613 PSHUFDMask[InPlaceInputs[0] / 2] = InPlaceInputs[0] / 2;
8616 if (IncomingInputs.empty()) {
8617 // Just fix all of the in place inputs.
8618 for (int Input : InPlaceInputs) {
8619 SourceHalfMask[Input - HalfOffset] = Input - HalfOffset;
8620 PSHUFDMask[Input / 2] = Input / 2;
8625 assert(InPlaceInputs.size() == 2 && "Cannot handle 3 or 4 inputs!");
8626 SourceHalfMask[InPlaceInputs[0] - HalfOffset] =
8627 InPlaceInputs[0] - HalfOffset;
8628 // Put the second input next to the first so that they are packed into
8629 // a dword. We find the adjacent index by toggling the low bit.
8630 int AdjIndex = InPlaceInputs[0] ^ 1;
8631 SourceHalfMask[AdjIndex - HalfOffset] = InPlaceInputs[1] - HalfOffset;
8632 std::replace(HalfMask.begin(), HalfMask.end(), InPlaceInputs[1], AdjIndex);
8633 PSHUFDMask[AdjIndex / 2] = AdjIndex / 2;
8635 fixInPlaceInputs(LToLInputs, HToLInputs, PSHUFLMask, LoMask, 0);
8636 fixInPlaceInputs(HToHInputs, LToHInputs, PSHUFHMask, HiMask, 4);
8638 // Now gather the cross-half inputs and place them into a free dword of
8639 // their target half.
8640 // FIXME: This operation could almost certainly be simplified dramatically to
8641 // look more like the 3-1 fixing operation.
8642 auto moveInputsToRightHalf = [&PSHUFDMask](
8643 MutableArrayRef<int> IncomingInputs, ArrayRef<int> ExistingInputs,
8644 MutableArrayRef<int> SourceHalfMask, MutableArrayRef<int> HalfMask,
8645 MutableArrayRef<int> FinalSourceHalfMask, int SourceOffset,
8647 auto isWordClobbered = [](ArrayRef<int> SourceHalfMask, int Word) {
8648 return SourceHalfMask[Word] != -1 && SourceHalfMask[Word] != Word;
8650 auto isDWordClobbered = [&isWordClobbered](ArrayRef<int> SourceHalfMask,
8652 int LowWord = Word & ~1;
8653 int HighWord = Word | 1;
8654 return isWordClobbered(SourceHalfMask, LowWord) ||
8655 isWordClobbered(SourceHalfMask, HighWord);
8658 if (IncomingInputs.empty())
8661 if (ExistingInputs.empty()) {
8662 // Map any dwords with inputs from them into the right half.
8663 for (int Input : IncomingInputs) {
8664 // If the source half mask maps over the inputs, turn those into
8665 // swaps and use the swapped lane.
8666 if (isWordClobbered(SourceHalfMask, Input - SourceOffset)) {
8667 if (SourceHalfMask[SourceHalfMask[Input - SourceOffset]] == -1) {
8668 SourceHalfMask[SourceHalfMask[Input - SourceOffset]] =
8669 Input - SourceOffset;
8670 // We have to swap the uses in our half mask in one sweep.
8671 for (int &M : HalfMask)
8672 if (M == SourceHalfMask[Input - SourceOffset] + SourceOffset)
8674 else if (M == Input)
8675 M = SourceHalfMask[Input - SourceOffset] + SourceOffset;
8677 assert(SourceHalfMask[SourceHalfMask[Input - SourceOffset]] ==
8678 Input - SourceOffset &&
8679 "Previous placement doesn't match!");
8681 // Note that this correctly re-maps both when we do a swap and when
8682 // we observe the other side of the swap above. We rely on that to
8683 // avoid swapping the members of the input list directly.
8684 Input = SourceHalfMask[Input - SourceOffset] + SourceOffset;
8687 // Map the input's dword into the correct half.
8688 if (PSHUFDMask[(Input - SourceOffset + DestOffset) / 2] == -1)
8689 PSHUFDMask[(Input - SourceOffset + DestOffset) / 2] = Input / 2;
8691 assert(PSHUFDMask[(Input - SourceOffset + DestOffset) / 2] ==
8693 "Previous placement doesn't match!");
8696 // And just directly shift any other-half mask elements to be same-half
8697 // as we will have mirrored the dword containing the element into the
8698 // same position within that half.
8699 for (int &M : HalfMask)
8700 if (M >= SourceOffset && M < SourceOffset + 4) {
8701 M = M - SourceOffset + DestOffset;
8702 assert(M >= 0 && "This should never wrap below zero!");
8707 // Ensure we have the input in a viable dword of its current half. This
8708 // is particularly tricky because the original position may be clobbered
8709 // by inputs being moved and *staying* in that half.
8710 if (IncomingInputs.size() == 1) {
8711 if (isWordClobbered(SourceHalfMask, IncomingInputs[0] - SourceOffset)) {
8712 int InputFixed = std::find(std::begin(SourceHalfMask),
8713 std::end(SourceHalfMask), -1) -
8714 std::begin(SourceHalfMask) + SourceOffset;
8715 SourceHalfMask[InputFixed - SourceOffset] =
8716 IncomingInputs[0] - SourceOffset;
8717 std::replace(HalfMask.begin(), HalfMask.end(), IncomingInputs[0],
8719 IncomingInputs[0] = InputFixed;
8721 } else if (IncomingInputs.size() == 2) {
8722 if (IncomingInputs[0] / 2 != IncomingInputs[1] / 2 ||
8723 isDWordClobbered(SourceHalfMask, IncomingInputs[0] - SourceOffset)) {
8724 // We have two non-adjacent or clobbered inputs we need to extract from
8725 // the source half. To do this, we need to map them into some adjacent
8726 // dword slot in the source mask.
8727 int InputsFixed[2] = {IncomingInputs[0] - SourceOffset,
8728 IncomingInputs[1] - SourceOffset};
8730 // If there is a free slot in the source half mask adjacent to one of
8731 // the inputs, place the other input in it. We use (Index XOR 1) to
8732 // compute an adjacent index.
8733 if (!isWordClobbered(SourceHalfMask, InputsFixed[0]) &&
8734 SourceHalfMask[InputsFixed[0] ^ 1] == -1) {
8735 SourceHalfMask[InputsFixed[0]] = InputsFixed[0];
8736 SourceHalfMask[InputsFixed[0] ^ 1] = InputsFixed[1];
8737 InputsFixed[1] = InputsFixed[0] ^ 1;
8738 } else if (!isWordClobbered(SourceHalfMask, InputsFixed[1]) &&
8739 SourceHalfMask[InputsFixed[1] ^ 1] == -1) {
8740 SourceHalfMask[InputsFixed[1]] = InputsFixed[1];
8741 SourceHalfMask[InputsFixed[1] ^ 1] = InputsFixed[0];
8742 InputsFixed[0] = InputsFixed[1] ^ 1;
8743 } else if (SourceHalfMask[2 * ((InputsFixed[0] / 2) ^ 1)] == -1 &&
8744 SourceHalfMask[2 * ((InputsFixed[0] / 2) ^ 1) + 1] == -1) {
8745 // The two inputs are in the same DWord but it is clobbered and the
8746 // adjacent DWord isn't used at all. Move both inputs to the free
8748 SourceHalfMask[2 * ((InputsFixed[0] / 2) ^ 1)] = InputsFixed[0];
8749 SourceHalfMask[2 * ((InputsFixed[0] / 2) ^ 1) + 1] = InputsFixed[1];
8750 InputsFixed[0] = 2 * ((InputsFixed[0] / 2) ^ 1);
8751 InputsFixed[1] = 2 * ((InputsFixed[0] / 2) ^ 1) + 1;
8753 // The only way we hit this point is if there is no clobbering
8754 // (because there are no off-half inputs to this half) and there is no
8755 // free slot adjacent to one of the inputs. In this case, we have to
8756 // swap an input with a non-input.
8757 for (int i = 0; i < 4; ++i)
8758 assert((SourceHalfMask[i] == -1 || SourceHalfMask[i] == i) &&
8759 "We can't handle any clobbers here!");
8760 assert(InputsFixed[1] != (InputsFixed[0] ^ 1) &&
8761 "Cannot have adjacent inputs here!");
8763 SourceHalfMask[InputsFixed[0] ^ 1] = InputsFixed[1];
8764 SourceHalfMask[InputsFixed[1]] = InputsFixed[0] ^ 1;
8766 // We also have to update the final source mask in this case because
8767 // it may need to undo the above swap.
8768 for (int &M : FinalSourceHalfMask)
8769 if (M == (InputsFixed[0] ^ 1) + SourceOffset)
8770 M = InputsFixed[1] + SourceOffset;
8771 else if (M == InputsFixed[1] + SourceOffset)
8772 M = (InputsFixed[0] ^ 1) + SourceOffset;
8774 InputsFixed[1] = InputsFixed[0] ^ 1;
8777 // Point everything at the fixed inputs.
8778 for (int &M : HalfMask)
8779 if (M == IncomingInputs[0])
8780 M = InputsFixed[0] + SourceOffset;
8781 else if (M == IncomingInputs[1])
8782 M = InputsFixed[1] + SourceOffset;
8784 IncomingInputs[0] = InputsFixed[0] + SourceOffset;
8785 IncomingInputs[1] = InputsFixed[1] + SourceOffset;
8788 llvm_unreachable("Unhandled input size!");
8791 // Now hoist the DWord down to the right half.
8792 int FreeDWord = (PSHUFDMask[DestOffset / 2] == -1 ? 0 : 1) + DestOffset / 2;
8793 assert(PSHUFDMask[FreeDWord] == -1 && "DWord not free");
8794 PSHUFDMask[FreeDWord] = IncomingInputs[0] / 2;
8795 for (int &M : HalfMask)
8796 for (int Input : IncomingInputs)
8798 M = FreeDWord * 2 + Input % 2;
8800 moveInputsToRightHalf(HToLInputs, LToLInputs, PSHUFHMask, LoMask, HiMask,
8801 /*SourceOffset*/ 4, /*DestOffset*/ 0);
8802 moveInputsToRightHalf(LToHInputs, HToHInputs, PSHUFLMask, HiMask, LoMask,
8803 /*SourceOffset*/ 0, /*DestOffset*/ 4);
8805 // Now enact all the shuffles we've computed to move the inputs into their
8807 if (!isNoopShuffleMask(PSHUFLMask))
8808 V = DAG.getNode(X86ISD::PSHUFLW, DL, MVT::v8i16, V,
8809 getV4X86ShuffleImm8ForMask(PSHUFLMask, DAG));
8810 if (!isNoopShuffleMask(PSHUFHMask))
8811 V = DAG.getNode(X86ISD::PSHUFHW, DL, MVT::v8i16, V,
8812 getV4X86ShuffleImm8ForMask(PSHUFHMask, DAG));
8813 if (!isNoopShuffleMask(PSHUFDMask))
8814 V = DAG.getNode(ISD::BITCAST, DL, MVT::v8i16,
8815 DAG.getNode(X86ISD::PSHUFD, DL, MVT::v4i32,
8816 DAG.getNode(ISD::BITCAST, DL, MVT::v4i32, V),
8817 getV4X86ShuffleImm8ForMask(PSHUFDMask, DAG)));
8819 // At this point, each half should contain all its inputs, and we can then
8820 // just shuffle them into their final position.
8821 assert(std::count_if(LoMask.begin(), LoMask.end(),
8822 [](int M) { return M >= 4; }) == 0 &&
8823 "Failed to lift all the high half inputs to the low mask!");
8824 assert(std::count_if(HiMask.begin(), HiMask.end(),
8825 [](int M) { return M >= 0 && M < 4; }) == 0 &&
8826 "Failed to lift all the low half inputs to the high mask!");
8828 // Do a half shuffle for the low mask.
8829 if (!isNoopShuffleMask(LoMask))
8830 V = DAG.getNode(X86ISD::PSHUFLW, DL, MVT::v8i16, V,
8831 getV4X86ShuffleImm8ForMask(LoMask, DAG));
8833 // Do a half shuffle with the high mask after shifting its values down.
8834 for (int &M : HiMask)
8837 if (!isNoopShuffleMask(HiMask))
8838 V = DAG.getNode(X86ISD::PSHUFHW, DL, MVT::v8i16, V,
8839 getV4X86ShuffleImm8ForMask(HiMask, DAG));
8844 /// \brief Detect whether the mask pattern should be lowered through
8847 /// This essentially tests whether viewing the mask as an interleaving of two
8848 /// sub-sequences reduces the cross-input traffic of a blend operation. If so,
8849 /// lowering it through interleaving is a significantly better strategy.
8850 static bool shouldLowerAsInterleaving(ArrayRef<int> Mask) {
8851 int NumEvenInputs[2] = {0, 0};
8852 int NumOddInputs[2] = {0, 0};
8853 int NumLoInputs[2] = {0, 0};
8854 int NumHiInputs[2] = {0, 0};
8855 for (int i = 0, Size = Mask.size(); i < Size; ++i) {
8859 int InputIdx = Mask[i] >= Size;
8862 ++NumLoInputs[InputIdx];
8864 ++NumHiInputs[InputIdx];
8867 ++NumEvenInputs[InputIdx];
8869 ++NumOddInputs[InputIdx];
8872 // The minimum number of cross-input results for both the interleaved and
8873 // split cases. If interleaving results in fewer cross-input results, return
8875 int InterleavedCrosses = std::min(NumEvenInputs[1] + NumOddInputs[0],
8876 NumEvenInputs[0] + NumOddInputs[1]);
8877 int SplitCrosses = std::min(NumLoInputs[1] + NumHiInputs[0],
8878 NumLoInputs[0] + NumHiInputs[1]);
8879 return InterleavedCrosses < SplitCrosses;
8882 /// \brief Blend two v8i16 vectors using a naive unpack strategy.
8884 /// This strategy only works when the inputs from each vector fit into a single
8885 /// half of that vector, and generally there are not so many inputs as to leave
8886 /// the in-place shuffles required highly constrained (and thus expensive). It
8887 /// shifts all the inputs into a single side of both input vectors and then
8888 /// uses an unpack to interleave these inputs in a single vector. At that
8889 /// point, we will fall back on the generic single input shuffle lowering.
8890 static SDValue lowerV8I16BasicBlendVectorShuffle(SDLoc DL, SDValue V1,
8892 MutableArrayRef<int> Mask,
8893 const X86Subtarget *Subtarget,
8894 SelectionDAG &DAG) {
8895 assert(V1.getSimpleValueType() == MVT::v8i16 && "Bad input type!");
8896 assert(V2.getSimpleValueType() == MVT::v8i16 && "Bad input type!");
8897 SmallVector<int, 3> LoV1Inputs, HiV1Inputs, LoV2Inputs, HiV2Inputs;
8898 for (int i = 0; i < 8; ++i)
8899 if (Mask[i] >= 0 && Mask[i] < 4)
8900 LoV1Inputs.push_back(i);
8901 else if (Mask[i] >= 4 && Mask[i] < 8)
8902 HiV1Inputs.push_back(i);
8903 else if (Mask[i] >= 8 && Mask[i] < 12)
8904 LoV2Inputs.push_back(i);
8905 else if (Mask[i] >= 12)
8906 HiV2Inputs.push_back(i);
8908 int NumV1Inputs = LoV1Inputs.size() + HiV1Inputs.size();
8909 int NumV2Inputs = LoV2Inputs.size() + HiV2Inputs.size();
8912 assert(NumV1Inputs > 0 && NumV1Inputs <= 3 && "At most 3 inputs supported");
8913 assert(NumV2Inputs > 0 && NumV2Inputs <= 3 && "At most 3 inputs supported");
8914 assert(NumV1Inputs + NumV2Inputs <= 4 && "At most 4 combined inputs");
8916 bool MergeFromLo = LoV1Inputs.size() + LoV2Inputs.size() >=
8917 HiV1Inputs.size() + HiV2Inputs.size();
8919 auto moveInputsToHalf = [&](SDValue V, ArrayRef<int> LoInputs,
8920 ArrayRef<int> HiInputs, bool MoveToLo,
8922 ArrayRef<int> GoodInputs = MoveToLo ? LoInputs : HiInputs;
8923 ArrayRef<int> BadInputs = MoveToLo ? HiInputs : LoInputs;
8924 if (BadInputs.empty())
8927 int MoveMask[] = {-1, -1, -1, -1, -1, -1, -1, -1};
8928 int MoveOffset = MoveToLo ? 0 : 4;
8930 if (GoodInputs.empty()) {
8931 for (int BadInput : BadInputs) {
8932 MoveMask[Mask[BadInput] % 4 + MoveOffset] = Mask[BadInput] - MaskOffset;
8933 Mask[BadInput] = Mask[BadInput] % 4 + MoveOffset + MaskOffset;
8936 if (GoodInputs.size() == 2) {
8937 // If the low inputs are spread across two dwords, pack them into
8939 MoveMask[MoveOffset] = Mask[GoodInputs[0]] - MaskOffset;
8940 MoveMask[MoveOffset + 1] = Mask[GoodInputs[1]] - MaskOffset;
8941 Mask[GoodInputs[0]] = MoveOffset + MaskOffset;
8942 Mask[GoodInputs[1]] = MoveOffset + 1 + MaskOffset;
8944 // Otherwise pin the good inputs.
8945 for (int GoodInput : GoodInputs)
8946 MoveMask[Mask[GoodInput] - MaskOffset] = Mask[GoodInput] - MaskOffset;
8949 if (BadInputs.size() == 2) {
8950 // If we have two bad inputs then there may be either one or two good
8951 // inputs fixed in place. Find a fixed input, and then find the *other*
8952 // two adjacent indices by using modular arithmetic.
8954 std::find_if(std::begin(MoveMask) + MoveOffset, std::end(MoveMask),
8955 [](int M) { return M >= 0; }) -
8956 std::begin(MoveMask);
8958 ((((GoodMaskIdx - MoveOffset) & ~1) + 2) % 4) + MoveOffset;
8959 assert(MoveMask[MoveMaskIdx] == -1 && "Expected empty slot");
8960 assert(MoveMask[MoveMaskIdx + 1] == -1 && "Expected empty slot");
8961 MoveMask[MoveMaskIdx] = Mask[BadInputs[0]] - MaskOffset;
8962 MoveMask[MoveMaskIdx + 1] = Mask[BadInputs[1]] - MaskOffset;
8963 Mask[BadInputs[0]] = MoveMaskIdx + MaskOffset;
8964 Mask[BadInputs[1]] = MoveMaskIdx + 1 + MaskOffset;
8966 assert(BadInputs.size() == 1 && "All sizes handled");
8967 int MoveMaskIdx = std::find(std::begin(MoveMask) + MoveOffset,
8968 std::end(MoveMask), -1) -
8969 std::begin(MoveMask);
8970 MoveMask[MoveMaskIdx] = Mask[BadInputs[0]] - MaskOffset;
8971 Mask[BadInputs[0]] = MoveMaskIdx + MaskOffset;
8975 return DAG.getVectorShuffle(MVT::v8i16, DL, V, DAG.getUNDEF(MVT::v8i16),
8978 V1 = moveInputsToHalf(V1, LoV1Inputs, HiV1Inputs, MergeFromLo,
8980 V2 = moveInputsToHalf(V2, LoV2Inputs, HiV2Inputs, MergeFromLo,
8983 // FIXME: Select an interleaving of the merge of V1 and V2 that minimizes
8984 // cross-half traffic in the final shuffle.
8986 // Munge the mask to be a single-input mask after the unpack merges the
8990 M = 2 * (M % 4) + (M / 8);
8992 return DAG.getVectorShuffle(
8993 MVT::v8i16, DL, DAG.getNode(MergeFromLo ? X86ISD::UNPCKL : X86ISD::UNPCKH,
8994 DL, MVT::v8i16, V1, V2),
8995 DAG.getUNDEF(MVT::v8i16), Mask);
8998 /// \brief Generic lowering of 8-lane i16 shuffles.
9000 /// This handles both single-input shuffles and combined shuffle/blends with
9001 /// two inputs. The single input shuffles are immediately delegated to
9002 /// a dedicated lowering routine.
9004 /// The blends are lowered in one of three fundamental ways. If there are few
9005 /// enough inputs, it delegates to a basic UNPCK-based strategy. If the shuffle
9006 /// of the input is significantly cheaper when lowered as an interleaving of
9007 /// the two inputs, try to interleave them. Otherwise, blend the low and high
9008 /// halves of the inputs separately (making them have relatively few inputs)
9009 /// and then concatenate them.
9010 static SDValue lowerV8I16VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
9011 const X86Subtarget *Subtarget,
9012 SelectionDAG &DAG) {
9014 assert(Op.getSimpleValueType() == MVT::v8i16 && "Bad shuffle type!");
9015 assert(V1.getSimpleValueType() == MVT::v8i16 && "Bad operand type!");
9016 assert(V2.getSimpleValueType() == MVT::v8i16 && "Bad operand type!");
9017 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
9018 ArrayRef<int> OrigMask = SVOp->getMask();
9019 int MaskStorage[8] = {OrigMask[0], OrigMask[1], OrigMask[2], OrigMask[3],
9020 OrigMask[4], OrigMask[5], OrigMask[6], OrigMask[7]};
9021 MutableArrayRef<int> Mask(MaskStorage);
9023 assert(Mask.size() == 8 && "Unexpected mask size for v8 shuffle!");
9025 // Whenever we can lower this as a zext, that instruction is strictly faster
9026 // than any alternative.
9027 if (SDValue ZExt = lowerVectorShuffleAsZeroOrAnyExtend(
9028 DL, MVT::v8i16, V1, V2, OrigMask, Subtarget, DAG))
9031 auto isV1 = [](int M) { return M >= 0 && M < 8; };
9032 auto isV2 = [](int M) { return M >= 8; };
9034 int NumV1Inputs = std::count_if(Mask.begin(), Mask.end(), isV1);
9035 int NumV2Inputs = std::count_if(Mask.begin(), Mask.end(), isV2);
9037 if (NumV2Inputs == 0)
9038 return lowerV8I16SingleInputVectorShuffle(DL, V1, Mask, Subtarget, DAG);
9040 assert(NumV1Inputs > 0 && "All single-input shuffles should be canonicalized "
9041 "to be V1-input shuffles.");
9043 // There are special ways we can lower some single-element blends.
9044 if (NumV2Inputs == 1)
9045 if (SDValue V = lowerVectorShuffleAsElementInsertion(MVT::v8i16, DL, V1, V2,
9046 Mask, Subtarget, DAG))
9049 // Use dedicated unpack instructions for masks that match their pattern.
9050 if (isShuffleEquivalent(Mask, 0, 8, 1, 9, 2, 10, 3, 11))
9051 return DAG.getNode(X86ISD::UNPCKL, DL, MVT::v8i16, V1, V2);
9052 if (isShuffleEquivalent(Mask, 4, 12, 5, 13, 6, 14, 7, 15))
9053 return DAG.getNode(X86ISD::UNPCKH, DL, MVT::v8i16, V1, V2);
9055 if (Subtarget->hasSSE41())
9056 if (SDValue Blend = lowerVectorShuffleAsBlend(DL, MVT::v8i16, V1, V2, Mask,
9060 // Try to use rotation instructions if available.
9061 if (Subtarget->hasSSSE3())
9062 if (SDValue Rotate = lowerVectorShuffleAsByteRotate(
9063 DL, MVT::v8i16, V1, V2, Mask, DAG))
9066 if (NumV1Inputs + NumV2Inputs <= 4)
9067 return lowerV8I16BasicBlendVectorShuffle(DL, V1, V2, Mask, Subtarget, DAG);
9069 // Check whether an interleaving lowering is likely to be more efficient.
9070 // This isn't perfect but it is a strong heuristic that tends to work well on
9071 // the kinds of shuffles that show up in practice.
9073 // FIXME: Handle 1x, 2x, and 4x interleaving.
9074 if (shouldLowerAsInterleaving(Mask)) {
9075 // FIXME: Figure out whether we should pack these into the low or high
9078 int EMask[8], OMask[8];
9079 for (int i = 0; i < 4; ++i) {
9080 EMask[i] = Mask[2*i];
9081 OMask[i] = Mask[2*i + 1];
9086 SDValue Evens = DAG.getVectorShuffle(MVT::v8i16, DL, V1, V2, EMask);
9087 SDValue Odds = DAG.getVectorShuffle(MVT::v8i16, DL, V1, V2, OMask);
9089 return DAG.getNode(X86ISD::UNPCKL, DL, MVT::v8i16, Evens, Odds);
9092 int LoBlendMask[8] = {-1, -1, -1, -1, -1, -1, -1, -1};
9093 int HiBlendMask[8] = {-1, -1, -1, -1, -1, -1, -1, -1};
9095 for (int i = 0; i < 4; ++i) {
9096 LoBlendMask[i] = Mask[i];
9097 HiBlendMask[i] = Mask[i + 4];
9100 SDValue LoV = DAG.getVectorShuffle(MVT::v8i16, DL, V1, V2, LoBlendMask);
9101 SDValue HiV = DAG.getVectorShuffle(MVT::v8i16, DL, V1, V2, HiBlendMask);
9102 LoV = DAG.getNode(ISD::BITCAST, DL, MVT::v2i64, LoV);
9103 HiV = DAG.getNode(ISD::BITCAST, DL, MVT::v2i64, HiV);
9105 return DAG.getNode(ISD::BITCAST, DL, MVT::v8i16,
9106 DAG.getNode(X86ISD::UNPCKL, DL, MVT::v2i64, LoV, HiV));
9109 /// \brief Check whether a compaction lowering can be done by dropping even
9110 /// elements and compute how many times even elements must be dropped.
9112 /// This handles shuffles which take every Nth element where N is a power of
9113 /// two. Example shuffle masks:
9115 /// N = 1: 0, 2, 4, 6, 8, 10, 12, 14, 0, 2, 4, 6, 8, 10, 12, 14
9116 /// N = 1: 0, 2, 4, 6, 8, 10, 12, 14, 16, 18, 20, 22, 24, 26, 28, 30
9117 /// N = 2: 0, 4, 8, 12, 0, 4, 8, 12, 0, 4, 8, 12, 0, 4, 8, 12
9118 /// N = 2: 0, 4, 8, 12, 16, 20, 24, 28, 0, 4, 8, 12, 16, 20, 24, 28
9119 /// N = 3: 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8
9120 /// N = 3: 0, 8, 16, 24, 0, 8, 16, 24, 0, 8, 16, 24, 0, 8, 16, 24
9122 /// Any of these lanes can of course be undef.
9124 /// This routine only supports N <= 3.
9125 /// FIXME: Evaluate whether either AVX or AVX-512 have any opportunities here
9128 /// \returns N above, or the number of times even elements must be dropped if
9129 /// there is such a number. Otherwise returns zero.
9130 static int canLowerByDroppingEvenElements(ArrayRef<int> Mask) {
9131 // Figure out whether we're looping over two inputs or just one.
9132 bool IsSingleInput = isSingleInputShuffleMask(Mask);
9134 // The modulus for the shuffle vector entries is based on whether this is
9135 // a single input or not.
9136 int ShuffleModulus = Mask.size() * (IsSingleInput ? 1 : 2);
9137 assert(isPowerOf2_32((uint32_t)ShuffleModulus) &&
9138 "We should only be called with masks with a power-of-2 size!");
9140 uint64_t ModMask = (uint64_t)ShuffleModulus - 1;
9142 // We track whether the input is viable for all power-of-2 strides 2^1, 2^2,
9143 // and 2^3 simultaneously. This is because we may have ambiguity with
9144 // partially undef inputs.
9145 bool ViableForN[3] = {true, true, true};
9147 for (int i = 0, e = Mask.size(); i < e; ++i) {
9148 // Ignore undef lanes, we'll optimistically collapse them to the pattern we
9153 bool IsAnyViable = false;
9154 for (unsigned j = 0; j != array_lengthof(ViableForN); ++j)
9155 if (ViableForN[j]) {
9158 // The shuffle mask must be equal to (i * 2^N) % M.
9159 if ((uint64_t)Mask[i] == (((uint64_t)i << N) & ModMask))
9162 ViableForN[j] = false;
9164 // Early exit if we exhaust the possible powers of two.
9169 for (unsigned j = 0; j != array_lengthof(ViableForN); ++j)
9173 // Return 0 as there is no viable power of two.
9177 /// \brief Generic lowering of v16i8 shuffles.
9179 /// This is a hybrid strategy to lower v16i8 vectors. It first attempts to
9180 /// detect any complexity reducing interleaving. If that doesn't help, it uses
9181 /// UNPCK to spread the i8 elements across two i16-element vectors, and uses
9182 /// the existing lowering for v8i16 blends on each half, finally PACK-ing them
9184 static SDValue lowerV16I8VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
9185 const X86Subtarget *Subtarget,
9186 SelectionDAG &DAG) {
9188 assert(Op.getSimpleValueType() == MVT::v16i8 && "Bad shuffle type!");
9189 assert(V1.getSimpleValueType() == MVT::v16i8 && "Bad operand type!");
9190 assert(V2.getSimpleValueType() == MVT::v16i8 && "Bad operand type!");
9191 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
9192 ArrayRef<int> OrigMask = SVOp->getMask();
9193 assert(OrigMask.size() == 16 && "Unexpected mask size for v16 shuffle!");
9195 // Try to use rotation instructions if available.
9196 if (Subtarget->hasSSSE3())
9197 if (SDValue Rotate = lowerVectorShuffleAsByteRotate(
9198 DL, MVT::v16i8, V1, V2, OrigMask, DAG))
9201 // Try to use a zext lowering.
9202 if (SDValue ZExt = lowerVectorShuffleAsZeroOrAnyExtend(
9203 DL, MVT::v16i8, V1, V2, OrigMask, Subtarget, DAG))
9206 int MaskStorage[16] = {
9207 OrigMask[0], OrigMask[1], OrigMask[2], OrigMask[3],
9208 OrigMask[4], OrigMask[5], OrigMask[6], OrigMask[7],
9209 OrigMask[8], OrigMask[9], OrigMask[10], OrigMask[11],
9210 OrigMask[12], OrigMask[13], OrigMask[14], OrigMask[15]};
9211 MutableArrayRef<int> Mask(MaskStorage);
9212 MutableArrayRef<int> LoMask = Mask.slice(0, 8);
9213 MutableArrayRef<int> HiMask = Mask.slice(8, 8);
9216 std::count_if(Mask.begin(), Mask.end(), [](int M) { return M >= 16; });
9218 // For single-input shuffles, there are some nicer lowering tricks we can use.
9219 if (NumV2Elements == 0) {
9220 // Check for being able to broadcast a single element.
9221 if (SDValue Broadcast = lowerVectorShuffleAsBroadcast(MVT::v16i8, DL, V1,
9222 Mask, Subtarget, DAG))
9225 // Check whether we can widen this to an i16 shuffle by duplicating bytes.
9226 // Notably, this handles splat and partial-splat shuffles more efficiently.
9227 // However, it only makes sense if the pre-duplication shuffle simplifies
9228 // things significantly. Currently, this means we need to be able to
9229 // express the pre-duplication shuffle as an i16 shuffle.
9231 // FIXME: We should check for other patterns which can be widened into an
9232 // i16 shuffle as well.
9233 auto canWidenViaDuplication = [](ArrayRef<int> Mask) {
9234 for (int i = 0; i < 16; i += 2)
9235 if (Mask[i] != -1 && Mask[i + 1] != -1 && Mask[i] != Mask[i + 1])
9240 auto tryToWidenViaDuplication = [&]() -> SDValue {
9241 if (!canWidenViaDuplication(Mask))
9243 SmallVector<int, 4> LoInputs;
9244 std::copy_if(Mask.begin(), Mask.end(), std::back_inserter(LoInputs),
9245 [](int M) { return M >= 0 && M < 8; });
9246 std::sort(LoInputs.begin(), LoInputs.end());
9247 LoInputs.erase(std::unique(LoInputs.begin(), LoInputs.end()),
9249 SmallVector<int, 4> HiInputs;
9250 std::copy_if(Mask.begin(), Mask.end(), std::back_inserter(HiInputs),
9251 [](int M) { return M >= 8; });
9252 std::sort(HiInputs.begin(), HiInputs.end());
9253 HiInputs.erase(std::unique(HiInputs.begin(), HiInputs.end()),
9256 bool TargetLo = LoInputs.size() >= HiInputs.size();
9257 ArrayRef<int> InPlaceInputs = TargetLo ? LoInputs : HiInputs;
9258 ArrayRef<int> MovingInputs = TargetLo ? HiInputs : LoInputs;
9260 int PreDupI16Shuffle[] = {-1, -1, -1, -1, -1, -1, -1, -1};
9261 SmallDenseMap<int, int, 8> LaneMap;
9262 for (int I : InPlaceInputs) {
9263 PreDupI16Shuffle[I/2] = I/2;
9266 int j = TargetLo ? 0 : 4, je = j + 4;
9267 for (int i = 0, ie = MovingInputs.size(); i < ie; ++i) {
9268 // Check if j is already a shuffle of this input. This happens when
9269 // there are two adjacent bytes after we move the low one.
9270 if (PreDupI16Shuffle[j] != MovingInputs[i] / 2) {
9271 // If we haven't yet mapped the input, search for a slot into which
9273 while (j < je && PreDupI16Shuffle[j] != -1)
9277 // We can't place the inputs into a single half with a simple i16 shuffle, so bail.
9280 // Map this input with the i16 shuffle.
9281 PreDupI16Shuffle[j] = MovingInputs[i] / 2;
9284 // Update the lane map based on the mapping we ended up with.
9285 LaneMap[MovingInputs[i]] = 2 * j + MovingInputs[i] % 2;
9288 ISD::BITCAST, DL, MVT::v16i8,
9289 DAG.getVectorShuffle(MVT::v8i16, DL,
9290 DAG.getNode(ISD::BITCAST, DL, MVT::v8i16, V1),
9291 DAG.getUNDEF(MVT::v8i16), PreDupI16Shuffle));
9293 // Unpack the bytes to form the i16s that will be shuffled into place.
9294 V1 = DAG.getNode(TargetLo ? X86ISD::UNPCKL : X86ISD::UNPCKH, DL,
9295 MVT::v16i8, V1, V1);
9297 int PostDupI16Shuffle[8] = {-1, -1, -1, -1, -1, -1, -1, -1};
9298 for (int i = 0; i < 16; ++i)
9299 if (Mask[i] != -1) {
9300 int MappedMask = LaneMap[Mask[i]] - (TargetLo ? 0 : 8);
9301 assert(MappedMask < 8 && "Invalid v8 shuffle mask!");
9302 if (PostDupI16Shuffle[i / 2] == -1)
9303 PostDupI16Shuffle[i / 2] = MappedMask;
9305 assert(PostDupI16Shuffle[i / 2] == MappedMask &&
9306 "Conflicting entrties in the original shuffle!");
9309 ISD::BITCAST, DL, MVT::v16i8,
9310 DAG.getVectorShuffle(MVT::v8i16, DL,
9311 DAG.getNode(ISD::BITCAST, DL, MVT::v8i16, V1),
9312 DAG.getUNDEF(MVT::v8i16), PostDupI16Shuffle));
9314 if (SDValue V = tryToWidenViaDuplication())
9318 // Check whether an interleaving lowering is likely to be more efficient.
9319 // This isn't perfect but it is a strong heuristic that tends to work well on
9320 // the kinds of shuffles that show up in practice.
9322 // FIXME: We need to handle other interleaving widths (i16, i32, ...).
9323 if (shouldLowerAsInterleaving(Mask)) {
9324 int NumLoHalf = std::count_if(Mask.begin(), Mask.end(), [](int M) {
9325 return (M >= 0 && M < 8) || (M >= 16 && M < 24);
9327 int NumHiHalf = std::count_if(Mask.begin(), Mask.end(), [](int M) {
9328 return (M >= 8 && M < 16) || M >= 24;
9330 int EMask[16] = {-1, -1, -1, -1, -1, -1, -1, -1,
9331 -1, -1, -1, -1, -1, -1, -1, -1};
9332 int OMask[16] = {-1, -1, -1, -1, -1, -1, -1, -1,
9333 -1, -1, -1, -1, -1, -1, -1, -1};
9334 bool UnpackLo = NumLoHalf >= NumHiHalf;
9335 MutableArrayRef<int> TargetEMask(UnpackLo ? EMask : EMask + 8, 8);
9336 MutableArrayRef<int> TargetOMask(UnpackLo ? OMask : OMask + 8, 8);
9337 for (int i = 0; i < 8; ++i) {
9338 TargetEMask[i] = Mask[2 * i];
9339 TargetOMask[i] = Mask[2 * i + 1];
9342 SDValue Evens = DAG.getVectorShuffle(MVT::v16i8, DL, V1, V2, EMask);
9343 SDValue Odds = DAG.getVectorShuffle(MVT::v16i8, DL, V1, V2, OMask);
9345 return DAG.getNode(UnpackLo ? X86ISD::UNPCKL : X86ISD::UNPCKH, DL,
9346 MVT::v16i8, Evens, Odds);
9349 // Check for SSSE3 which lets us lower all v16i8 shuffles much more directly
9350 // with PSHUFB. It is important to do this before we attempt to generate any
9351 // blends but after all of the single-input lowerings. If the single input
9352 // lowerings can find an instruction sequence that is faster than a PSHUFB, we
9353 // want to preserve that and we can DAG combine any longer sequences into
9354 // a PSHUFB in the end. But once we start blending from multiple inputs,
9355 // the complexity of DAG combining bad patterns back into PSHUFB is too high,
9356 // and there are *very* few patterns that would actually be faster than the
9357 // PSHUFB approach because of its ability to zero lanes.
9359 // FIXME: The only exceptions to the above are blends which are exact
9360 // interleavings with direct instructions supporting them. We currently don't
9361 // handle those well here.
9362 if (Subtarget->hasSSSE3()) {
9365 for (int i = 0; i < 16; ++i)
9366 if (Mask[i] == -1) {
9367 V1Mask[i] = V2Mask[i] = DAG.getUNDEF(MVT::i8);
9369 V1Mask[i] = DAG.getConstant(Mask[i] < 16 ? Mask[i] : 0x80, MVT::i8);
9371 DAG.getConstant(Mask[i] < 16 ? 0x80 : Mask[i] - 16, MVT::i8);
9373 V1 = DAG.getNode(X86ISD::PSHUFB, DL, MVT::v16i8, V1,
9374 DAG.getNode(ISD::BUILD_VECTOR, DL, MVT::v16i8, V1Mask));
9375 if (isSingleInputShuffleMask(Mask))
9376 return V1; // Single inputs are easy.
9378 // Otherwise, blend the two.
9379 V2 = DAG.getNode(X86ISD::PSHUFB, DL, MVT::v16i8, V2,
9380 DAG.getNode(ISD::BUILD_VECTOR, DL, MVT::v16i8, V2Mask));
9381 return DAG.getNode(ISD::OR, DL, MVT::v16i8, V1, V2);
9384 // There are special ways we can lower some single-element blends.
9385 if (NumV2Elements == 1)
9386 if (SDValue V = lowerVectorShuffleAsElementInsertion(MVT::v16i8, DL, V1, V2,
9387 Mask, Subtarget, DAG))
9390 // Check whether a compaction lowering can be done. This handles shuffles
9391 // which take every Nth element for some even N. See the helper function for
9394 // We special case these as they can be particularly efficiently handled with
9395 // the PACKUSB instruction on x86 and they show up in common patterns of
9396 // rearranging bytes to truncate wide elements.
9397 if (int NumEvenDrops = canLowerByDroppingEvenElements(Mask)) {
9398 // NumEvenDrops is the power of two stride of the elements. Another way of
9399 // thinking about it is that we need to drop the even elements this many
9400 // times to get the original input.
9401 bool IsSingleInput = isSingleInputShuffleMask(Mask);
9403 // First we need to zero all the dropped bytes.
9404 assert(NumEvenDrops <= 3 &&
9405 "No support for dropping even elements more than 3 times.");
9406 // We use the mask type to pick which bytes are preserved based on how many
9407 // elements are dropped.
9408 MVT MaskVTs[] = { MVT::v8i16, MVT::v4i32, MVT::v2i64 };
9409 SDValue ByteClearMask =
9410 DAG.getNode(ISD::BITCAST, DL, MVT::v16i8,
9411 DAG.getConstant(0xFF, MaskVTs[NumEvenDrops - 1]));
9412 V1 = DAG.getNode(ISD::AND, DL, MVT::v16i8, V1, ByteClearMask);
9414 V2 = DAG.getNode(ISD::AND, DL, MVT::v16i8, V2, ByteClearMask);
9416 // Now pack things back together.
9417 V1 = DAG.getNode(ISD::BITCAST, DL, MVT::v8i16, V1);
9418 V2 = IsSingleInput ? V1 : DAG.getNode(ISD::BITCAST, DL, MVT::v8i16, V2);
9419 SDValue Result = DAG.getNode(X86ISD::PACKUS, DL, MVT::v16i8, V1, V2);
9420 for (int i = 1; i < NumEvenDrops; ++i) {
9421 Result = DAG.getNode(ISD::BITCAST, DL, MVT::v8i16, Result);
9422 Result = DAG.getNode(X86ISD::PACKUS, DL, MVT::v16i8, Result, Result);
9428 int V1LoBlendMask[8] = {-1, -1, -1, -1, -1, -1, -1, -1};
9429 int V1HiBlendMask[8] = {-1, -1, -1, -1, -1, -1, -1, -1};
9430 int V2LoBlendMask[8] = {-1, -1, -1, -1, -1, -1, -1, -1};
9431 int V2HiBlendMask[8] = {-1, -1, -1, -1, -1, -1, -1, -1};
9433 auto buildBlendMasks = [](MutableArrayRef<int> HalfMask,
9434 MutableArrayRef<int> V1HalfBlendMask,
9435 MutableArrayRef<int> V2HalfBlendMask) {
9436 for (int i = 0; i < 8; ++i)
9437 if (HalfMask[i] >= 0 && HalfMask[i] < 16) {
9438 V1HalfBlendMask[i] = HalfMask[i];
9440 } else if (HalfMask[i] >= 16) {
9441 V2HalfBlendMask[i] = HalfMask[i] - 16;
9442 HalfMask[i] = i + 8;
9445 buildBlendMasks(LoMask, V1LoBlendMask, V2LoBlendMask);
9446 buildBlendMasks(HiMask, V1HiBlendMask, V2HiBlendMask);
9448 SDValue Zero = getZeroVector(MVT::v8i16, Subtarget, DAG, DL);
9450 auto buildLoAndHiV8s = [&](SDValue V, MutableArrayRef<int> LoBlendMask,
9451 MutableArrayRef<int> HiBlendMask) {
9453 // Check if any of the odd lanes in the v16i8 are used. If not, we can mask
9454 // them out and avoid using UNPCK{L,H} to extract the elements of V as
9456 if (std::none_of(LoBlendMask.begin(), LoBlendMask.end(),
9457 [](int M) { return M >= 0 && M % 2 == 1; }) &&
9458 std::none_of(HiBlendMask.begin(), HiBlendMask.end(),
9459 [](int M) { return M >= 0 && M % 2 == 1; })) {
9460 // Use a mask to drop the high bytes.
9461 V1 = DAG.getNode(ISD::BITCAST, DL, MVT::v8i16, V);
9462 V1 = DAG.getNode(ISD::AND, DL, MVT::v8i16, V1,
9463 DAG.getConstant(0x00FF, MVT::v8i16));
9465 // This will be a single vector shuffle instead of a blend so nuke V2.
9466 V2 = DAG.getUNDEF(MVT::v8i16);
9468 // Squash the masks to point directly into V1.
9469 for (int &M : LoBlendMask)
9472 for (int &M : HiBlendMask)
9476 // Otherwise just unpack the low half of V into V1 and the high half into
9477 // V2 so that we can blend them as i16s.
9478 V1 = DAG.getNode(ISD::BITCAST, DL, MVT::v8i16,
9479 DAG.getNode(X86ISD::UNPCKL, DL, MVT::v16i8, V, Zero));
9480 V2 = DAG.getNode(ISD::BITCAST, DL, MVT::v8i16,
9481 DAG.getNode(X86ISD::UNPCKH, DL, MVT::v16i8, V, Zero));
9484 SDValue BlendedLo = DAG.getVectorShuffle(MVT::v8i16, DL, V1, V2, LoBlendMask);
9485 SDValue BlendedHi = DAG.getVectorShuffle(MVT::v8i16, DL, V1, V2, HiBlendMask);
9486 return std::make_pair(BlendedLo, BlendedHi);
9488 SDValue V1Lo, V1Hi, V2Lo, V2Hi;
9489 std::tie(V1Lo, V1Hi) = buildLoAndHiV8s(V1, V1LoBlendMask, V1HiBlendMask);
9490 std::tie(V2Lo, V2Hi) = buildLoAndHiV8s(V2, V2LoBlendMask, V2HiBlendMask);
9492 SDValue LoV = DAG.getVectorShuffle(MVT::v8i16, DL, V1Lo, V2Lo, LoMask);
9493 SDValue HiV = DAG.getVectorShuffle(MVT::v8i16, DL, V1Hi, V2Hi, HiMask);
9495 return DAG.getNode(X86ISD::PACKUS, DL, MVT::v16i8, LoV, HiV);
9498 /// \brief Dispatching routine to lower various 128-bit x86 vector shuffles.
9500 /// This routine breaks down the specific type of 128-bit shuffle and
9501 /// dispatches to the lowering routines accordingly.
9502 static SDValue lower128BitVectorShuffle(SDValue Op, SDValue V1, SDValue V2,
9503 MVT VT, const X86Subtarget *Subtarget,
9504 SelectionDAG &DAG) {
9505 switch (VT.SimpleTy) {
9507 return lowerV2I64VectorShuffle(Op, V1, V2, Subtarget, DAG);
9509 return lowerV2F64VectorShuffle(Op, V1, V2, Subtarget, DAG);
9511 return lowerV4I32VectorShuffle(Op, V1, V2, Subtarget, DAG);
9513 return lowerV4F32VectorShuffle(Op, V1, V2, Subtarget, DAG);
9515 return lowerV8I16VectorShuffle(Op, V1, V2, Subtarget, DAG);
9517 return lowerV16I8VectorShuffle(Op, V1, V2, Subtarget, DAG);
9520 llvm_unreachable("Unimplemented!");
9524 /// \brief Helper function to test whether a shuffle mask could be
9525 /// simplified by widening the elements being shuffled.
9527 /// Appends the mask for wider elements in WidenedMask if valid. Otherwise
9528 /// leaves it in an unspecified state.
9530 /// NOTE: This must handle normal vector shuffle masks and *target* vector
9531 /// shuffle masks. The latter have the special property of a '-2' representing
9532 /// a zero-ed lane of a vector.
9533 static bool canWidenShuffleElements(ArrayRef<int> Mask,
9534 SmallVectorImpl<int> &WidenedMask) {
9535 for (int i = 0, Size = Mask.size(); i < Size; i += 2) {
9536 // If both elements are undef, its trivial.
9537 if (Mask[i] == SM_SentinelUndef && Mask[i + 1] == SM_SentinelUndef) {
9538 WidenedMask.push_back(SM_SentinelUndef);
9542 // Check for an undef mask and a mask value properly aligned to fit with
9543 // a pair of values. If we find such a case, use the non-undef mask's value.
9544 if (Mask[i] == SM_SentinelUndef && Mask[i + 1] >= 0 && Mask[i + 1] % 2 == 1) {
9545 WidenedMask.push_back(Mask[i + 1] / 2);
9548 if (Mask[i + 1] == SM_SentinelUndef && Mask[i] >= 0 && Mask[i] % 2 == 0) {
9549 WidenedMask.push_back(Mask[i] / 2);
9553 // When zeroing, we need to spread the zeroing across both lanes to widen.
9554 if (Mask[i] == SM_SentinelZero || Mask[i + 1] == SM_SentinelZero) {
9555 if ((Mask[i] == SM_SentinelZero || Mask[i] == SM_SentinelUndef) &&
9556 (Mask[i + 1] == SM_SentinelZero || Mask[i + 1] == SM_SentinelUndef)) {
9557 WidenedMask.push_back(SM_SentinelZero);
9563 // Finally check if the two mask values are adjacent and aligned with
9565 if (Mask[i] != SM_SentinelUndef && Mask[i] % 2 == 0 && Mask[i] + 1 == Mask[i + 1]) {
9566 WidenedMask.push_back(Mask[i] / 2);
9570 // Otherwise we can't safely widen the elements used in this shuffle.
9573 assert(WidenedMask.size() == Mask.size() / 2 &&
9574 "Incorrect size of mask after widening the elements!");
9579 /// \brief Generic routine to split ector shuffle into half-sized shuffles.
9581 /// This routine just extracts two subvectors, shuffles them independently, and
9582 /// then concatenates them back together. This should work effectively with all
9583 /// AVX vector shuffle types.
9584 static SDValue splitAndLowerVectorShuffle(SDLoc DL, MVT VT, SDValue V1,
9585 SDValue V2, ArrayRef<int> Mask,
9586 SelectionDAG &DAG) {
9587 assert(VT.getSizeInBits() >= 256 &&
9588 "Only for 256-bit or wider vector shuffles!");
9589 assert(V1.getSimpleValueType() == VT && "Bad operand type!");
9590 assert(V2.getSimpleValueType() == VT && "Bad operand type!");
9592 ArrayRef<int> LoMask = Mask.slice(0, Mask.size() / 2);
9593 ArrayRef<int> HiMask = Mask.slice(Mask.size() / 2);
9595 int NumElements = VT.getVectorNumElements();
9596 int SplitNumElements = NumElements / 2;
9597 MVT ScalarVT = VT.getScalarType();
9598 MVT SplitVT = MVT::getVectorVT(ScalarVT, NumElements / 2);
9600 SDValue LoV1 = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, SplitVT, V1,
9601 DAG.getIntPtrConstant(0));
9602 SDValue HiV1 = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, SplitVT, V1,
9603 DAG.getIntPtrConstant(SplitNumElements));
9604 SDValue LoV2 = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, SplitVT, V2,
9605 DAG.getIntPtrConstant(0));
9606 SDValue HiV2 = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, SplitVT, V2,
9607 DAG.getIntPtrConstant(SplitNumElements));
9609 // Now create two 4-way blends of these half-width vectors.
9610 auto HalfBlend = [&](ArrayRef<int> HalfMask) {
9611 SmallVector<int, 32> V1BlendMask, V2BlendMask, BlendMask;
9612 for (int i = 0; i < SplitNumElements; ++i) {
9613 int M = HalfMask[i];
9614 if (M >= NumElements) {
9615 V2BlendMask.push_back(M - NumElements);
9616 V1BlendMask.push_back(-1);
9617 BlendMask.push_back(SplitNumElements + i);
9618 } else if (M >= 0) {
9619 V2BlendMask.push_back(-1);
9620 V1BlendMask.push_back(M);
9621 BlendMask.push_back(i);
9623 V2BlendMask.push_back(-1);
9624 V1BlendMask.push_back(-1);
9625 BlendMask.push_back(-1);
9629 DAG.getVectorShuffle(SplitVT, DL, LoV1, HiV1, V1BlendMask);
9631 DAG.getVectorShuffle(SplitVT, DL, LoV2, HiV2, V2BlendMask);
9632 return DAG.getVectorShuffle(SplitVT, DL, V1Blend, V2Blend, BlendMask);
9634 SDValue Lo = HalfBlend(LoMask);
9635 SDValue Hi = HalfBlend(HiMask);
9636 return DAG.getNode(ISD::CONCAT_VECTORS, DL, VT, Lo, Hi);
9639 /// \brief Lower a vector shuffle crossing multiple 128-bit lanes as
9640 /// a permutation and blend of those lanes.
9642 /// This essentially blends the out-of-lane inputs to each lane into the lane
9643 /// from a permuted copy of the vector. This lowering strategy results in four
9644 /// instructions in the worst case for a single-input cross lane shuffle which
9645 /// is lower than any other fully general cross-lane shuffle strategy I'm aware
9646 /// of. Special cases for each particular shuffle pattern should be handled
9647 /// prior to trying this lowering.
9648 static SDValue lowerVectorShuffleAsLanePermuteAndBlend(SDLoc DL, MVT VT,
9649 SDValue V1, SDValue V2,
9651 SelectionDAG &DAG) {
9652 // FIXME: This should probably be generalized for 512-bit vectors as well.
9653 assert(VT.getSizeInBits() == 256 && "Only for 256-bit vector shuffles!");
9654 int LaneSize = Mask.size() / 2;
9656 // If there are only inputs from one 128-bit lane, splitting will in fact be
9657 // less expensive. The flags track wether the given lane contains an element
9658 // that crosses to another lane.
9659 bool LaneCrossing[2] = {false, false};
9660 for (int i = 0, Size = Mask.size(); i < Size; ++i)
9661 if (Mask[i] >= 0 && (Mask[i] % Size) / LaneSize != i / LaneSize)
9662 LaneCrossing[(Mask[i] % Size) / LaneSize] = true;
9663 if (!LaneCrossing[0] || !LaneCrossing[1])
9664 return splitAndLowerVectorShuffle(DL, VT, V1, V2, Mask, DAG);
9666 if (isSingleInputShuffleMask(Mask)) {
9667 SmallVector<int, 32> FlippedBlendMask;
9668 for (int i = 0, Size = Mask.size(); i < Size; ++i)
9669 FlippedBlendMask.push_back(
9670 Mask[i] < 0 ? -1 : (((Mask[i] % Size) / LaneSize == i / LaneSize)
9672 : Mask[i] % LaneSize +
9673 (i / LaneSize) * LaneSize + Size));
9675 // Flip the vector, and blend the results which should now be in-lane. The
9676 // VPERM2X128 mask uses the low 2 bits for the low source and bits 4 and
9677 // 5 for the high source. The value 3 selects the high half of source 2 and
9678 // the value 2 selects the low half of source 2. We only use source 2 to
9679 // allow folding it into a memory operand.
9680 unsigned PERMMask = 3 | 2 << 4;
9681 SDValue Flipped = DAG.getNode(X86ISD::VPERM2X128, DL, VT, DAG.getUNDEF(VT),
9682 V1, DAG.getConstant(PERMMask, MVT::i8));
9683 return DAG.getVectorShuffle(VT, DL, V1, Flipped, FlippedBlendMask);
9686 // This now reduces to two single-input shuffles of V1 and V2 which at worst
9687 // will be handled by the above logic and a blend of the results, much like
9688 // other patterns in AVX.
9689 return lowerVectorShuffleAsDecomposedShuffleBlend(DL, VT, V1, V2, Mask, DAG);
9692 /// \brief Handle lowering 2-lane 128-bit shuffles.
9693 static SDValue lowerV2X128VectorShuffle(SDLoc DL, MVT VT, SDValue V1,
9694 SDValue V2, ArrayRef<int> Mask,
9695 const X86Subtarget *Subtarget,
9696 SelectionDAG &DAG) {
9697 // Blends are faster and handle all the non-lane-crossing cases.
9698 if (SDValue Blend = lowerVectorShuffleAsBlend(DL, VT, V1, V2, Mask,
9702 MVT SubVT = MVT::getVectorVT(VT.getVectorElementType(),
9703 VT.getVectorNumElements() / 2);
9704 // Check for patterns which can be matched with a single insert of a 128-bit
9706 if (isShuffleEquivalent(Mask, 0, 1, 0, 1) ||
9707 isShuffleEquivalent(Mask, 0, 1, 4, 5)) {
9708 SDValue LoV = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, SubVT, V1,
9709 DAG.getIntPtrConstant(0));
9710 SDValue HiV = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, SubVT,
9711 Mask[2] < 4 ? V1 : V2, DAG.getIntPtrConstant(0));
9712 return DAG.getNode(ISD::CONCAT_VECTORS, DL, VT, LoV, HiV);
9714 if (isShuffleEquivalent(Mask, 0, 1, 6, 7)) {
9715 SDValue LoV = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, SubVT, V1,
9716 DAG.getIntPtrConstant(0));
9717 SDValue HiV = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, SubVT, V2,
9718 DAG.getIntPtrConstant(2));
9719 return DAG.getNode(ISD::CONCAT_VECTORS, DL, VT, LoV, HiV);
9722 // Otherwise form a 128-bit permutation.
9723 // FIXME: Detect zero-vector inputs and use the VPERM2X128 to zero that half.
9724 unsigned PermMask = Mask[0] / 2 | (Mask[2] / 2) << 4;
9725 return DAG.getNode(X86ISD::VPERM2X128, DL, VT, V1, V2,
9726 DAG.getConstant(PermMask, MVT::i8));
9729 /// \brief Handle lowering of 4-lane 64-bit floating point shuffles.
9731 /// Also ends up handling lowering of 4-lane 64-bit integer shuffles when AVX2
9732 /// isn't available.
9733 static SDValue lowerV4F64VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
9734 const X86Subtarget *Subtarget,
9735 SelectionDAG &DAG) {
9737 assert(V1.getSimpleValueType() == MVT::v4f64 && "Bad operand type!");
9738 assert(V2.getSimpleValueType() == MVT::v4f64 && "Bad operand type!");
9739 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
9740 ArrayRef<int> Mask = SVOp->getMask();
9741 assert(Mask.size() == 4 && "Unexpected mask size for v4 shuffle!");
9743 SmallVector<int, 4> WidenedMask;
9744 if (canWidenShuffleElements(Mask, WidenedMask))
9745 return lowerV2X128VectorShuffle(DL, MVT::v4f64, V1, V2, Mask, Subtarget,
9748 if (isSingleInputShuffleMask(Mask)) {
9749 // Check for being able to broadcast a single element.
9750 if (SDValue Broadcast = lowerVectorShuffleAsBroadcast(MVT::v4f64, DL, V1,
9751 Mask, Subtarget, DAG))
9754 if (!is128BitLaneCrossingShuffleMask(MVT::v4f64, Mask)) {
9755 // Non-half-crossing single input shuffles can be lowerid with an
9756 // interleaved permutation.
9757 unsigned VPERMILPMask = (Mask[0] == 1) | ((Mask[1] == 1) << 1) |
9758 ((Mask[2] == 3) << 2) | ((Mask[3] == 3) << 3);
9759 return DAG.getNode(X86ISD::VPERMILPI, DL, MVT::v4f64, V1,
9760 DAG.getConstant(VPERMILPMask, MVT::i8));
9763 // With AVX2 we have direct support for this permutation.
9764 if (Subtarget->hasAVX2())
9765 return DAG.getNode(X86ISD::VPERMI, DL, MVT::v4f64, V1,
9766 getV4X86ShuffleImm8ForMask(Mask, DAG));
9768 // Otherwise, fall back.
9769 return lowerVectorShuffleAsLanePermuteAndBlend(DL, MVT::v4f64, V1, V2, Mask,
9773 // X86 has dedicated unpack instructions that can handle specific blend
9774 // operations: UNPCKH and UNPCKL.
9775 if (isShuffleEquivalent(Mask, 0, 4, 2, 6))
9776 return DAG.getNode(X86ISD::UNPCKL, DL, MVT::v4f64, V1, V2);
9777 if (isShuffleEquivalent(Mask, 1, 5, 3, 7))
9778 return DAG.getNode(X86ISD::UNPCKH, DL, MVT::v4f64, V1, V2);
9780 // If we have a single input to the zero element, insert that into V1 if we
9781 // can do so cheaply.
9783 std::count_if(Mask.begin(), Mask.end(), [](int M) { return M >= 4; });
9784 if (NumV2Elements == 1 && Mask[0] >= 4)
9785 if (SDValue Insertion = lowerVectorShuffleAsElementInsertion(
9786 MVT::v4f64, DL, V1, V2, Mask, Subtarget, DAG))
9789 if (SDValue Blend = lowerVectorShuffleAsBlend(DL, MVT::v4f64, V1, V2, Mask,
9793 // Check if the blend happens to exactly fit that of SHUFPD.
9794 if ((Mask[0] == -1 || Mask[0] < 2) &&
9795 (Mask[1] == -1 || (Mask[1] >= 4 && Mask[1] < 6)) &&
9796 (Mask[2] == -1 || (Mask[2] >= 2 && Mask[2] < 4)) &&
9797 (Mask[3] == -1 || Mask[3] >= 6)) {
9798 unsigned SHUFPDMask = (Mask[0] == 1) | ((Mask[1] == 5) << 1) |
9799 ((Mask[2] == 3) << 2) | ((Mask[3] == 7) << 3);
9800 return DAG.getNode(X86ISD::SHUFP, DL, MVT::v4f64, V1, V2,
9801 DAG.getConstant(SHUFPDMask, MVT::i8));
9803 if ((Mask[0] == -1 || (Mask[0] >= 4 && Mask[0] < 6)) &&
9804 (Mask[1] == -1 || Mask[1] < 2) &&
9805 (Mask[2] == -1 || Mask[2] >= 6) &&
9806 (Mask[3] == -1 || (Mask[3] >= 2 && Mask[3] < 4))) {
9807 unsigned SHUFPDMask = (Mask[0] == 5) | ((Mask[1] == 1) << 1) |
9808 ((Mask[2] == 7) << 2) | ((Mask[3] == 3) << 3);
9809 return DAG.getNode(X86ISD::SHUFP, DL, MVT::v4f64, V2, V1,
9810 DAG.getConstant(SHUFPDMask, MVT::i8));
9813 // Otherwise fall back on generic blend lowering.
9814 return lowerVectorShuffleAsDecomposedShuffleBlend(DL, MVT::v4f64, V1, V2,
9818 /// \brief Handle lowering of 4-lane 64-bit integer shuffles.
9820 /// This routine is only called when we have AVX2 and thus a reasonable
9821 /// instruction set for v4i64 shuffling..
9822 static SDValue lowerV4I64VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
9823 const X86Subtarget *Subtarget,
9824 SelectionDAG &DAG) {
9826 assert(V1.getSimpleValueType() == MVT::v4i64 && "Bad operand type!");
9827 assert(V2.getSimpleValueType() == MVT::v4i64 && "Bad operand type!");
9828 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
9829 ArrayRef<int> Mask = SVOp->getMask();
9830 assert(Mask.size() == 4 && "Unexpected mask size for v4 shuffle!");
9831 assert(Subtarget->hasAVX2() && "We can only lower v4i64 with AVX2!");
9833 SmallVector<int, 4> WidenedMask;
9834 if (canWidenShuffleElements(Mask, WidenedMask))
9835 return lowerV2X128VectorShuffle(DL, MVT::v4i64, V1, V2, Mask, Subtarget,
9838 if (SDValue Blend = lowerVectorShuffleAsBlend(DL, MVT::v4i64, V1, V2, Mask,
9842 // Check for being able to broadcast a single element.
9843 if (SDValue Broadcast = lowerVectorShuffleAsBroadcast(MVT::v4i64, DL, V1,
9844 Mask, Subtarget, DAG))
9847 // When the shuffle is mirrored between the 128-bit lanes of the unit, we can
9848 // use lower latency instructions that will operate on both 128-bit lanes.
9849 SmallVector<int, 2> RepeatedMask;
9850 if (is128BitLaneRepeatedShuffleMask(MVT::v4i64, Mask, RepeatedMask)) {
9851 if (isSingleInputShuffleMask(Mask)) {
9852 int PSHUFDMask[] = {-1, -1, -1, -1};
9853 for (int i = 0; i < 2; ++i)
9854 if (RepeatedMask[i] >= 0) {
9855 PSHUFDMask[2 * i] = 2 * RepeatedMask[i];
9856 PSHUFDMask[2 * i + 1] = 2 * RepeatedMask[i] + 1;
9859 ISD::BITCAST, DL, MVT::v4i64,
9860 DAG.getNode(X86ISD::PSHUFD, DL, MVT::v8i32,
9861 DAG.getNode(ISD::BITCAST, DL, MVT::v8i32, V1),
9862 getV4X86ShuffleImm8ForMask(PSHUFDMask, DAG)));
9865 // Use dedicated unpack instructions for masks that match their pattern.
9866 if (isShuffleEquivalent(Mask, 0, 4, 2, 6))
9867 return DAG.getNode(X86ISD::UNPCKL, DL, MVT::v4i64, V1, V2);
9868 if (isShuffleEquivalent(Mask, 1, 5, 3, 7))
9869 return DAG.getNode(X86ISD::UNPCKH, DL, MVT::v4i64, V1, V2);
9872 // AVX2 provides a direct instruction for permuting a single input across
9874 if (isSingleInputShuffleMask(Mask))
9875 return DAG.getNode(X86ISD::VPERMI, DL, MVT::v4i64, V1,
9876 getV4X86ShuffleImm8ForMask(Mask, DAG));
9878 // Otherwise fall back on generic blend lowering.
9879 return lowerVectorShuffleAsDecomposedShuffleBlend(DL, MVT::v4i64, V1, V2,
9883 /// \brief Handle lowering of 8-lane 32-bit floating point shuffles.
9885 /// Also ends up handling lowering of 8-lane 32-bit integer shuffles when AVX2
9886 /// isn't available.
9887 static SDValue lowerV8F32VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
9888 const X86Subtarget *Subtarget,
9889 SelectionDAG &DAG) {
9891 assert(V1.getSimpleValueType() == MVT::v8f32 && "Bad operand type!");
9892 assert(V2.getSimpleValueType() == MVT::v8f32 && "Bad operand type!");
9893 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
9894 ArrayRef<int> Mask = SVOp->getMask();
9895 assert(Mask.size() == 8 && "Unexpected mask size for v8 shuffle!");
9897 if (SDValue Blend = lowerVectorShuffleAsBlend(DL, MVT::v8f32, V1, V2, Mask,
9901 // Check for being able to broadcast a single element.
9902 if (SDValue Broadcast = lowerVectorShuffleAsBroadcast(MVT::v8f32, DL, V1,
9903 Mask, Subtarget, DAG))
9906 // If the shuffle mask is repeated in each 128-bit lane, we have many more
9907 // options to efficiently lower the shuffle.
9908 SmallVector<int, 4> RepeatedMask;
9909 if (is128BitLaneRepeatedShuffleMask(MVT::v8f32, Mask, RepeatedMask)) {
9910 assert(RepeatedMask.size() == 4 &&
9911 "Repeated masks must be half the mask width!");
9912 if (isSingleInputShuffleMask(Mask))
9913 return DAG.getNode(X86ISD::VPERMILPI, DL, MVT::v8f32, V1,
9914 getV4X86ShuffleImm8ForMask(RepeatedMask, DAG));
9916 // Use dedicated unpack instructions for masks that match their pattern.
9917 if (isShuffleEquivalent(Mask, 0, 8, 1, 9, 4, 12, 5, 13))
9918 return DAG.getNode(X86ISD::UNPCKL, DL, MVT::v8f32, V1, V2);
9919 if (isShuffleEquivalent(Mask, 2, 10, 3, 11, 6, 14, 7, 15))
9920 return DAG.getNode(X86ISD::UNPCKH, DL, MVT::v8f32, V1, V2);
9922 // Otherwise, fall back to a SHUFPS sequence. Here it is important that we
9923 // have already handled any direct blends. We also need to squash the
9924 // repeated mask into a simulated v4f32 mask.
9925 for (int i = 0; i < 4; ++i)
9926 if (RepeatedMask[i] >= 8)
9927 RepeatedMask[i] -= 4;
9928 return lowerVectorShuffleWithSHUFPS(DL, MVT::v8f32, RepeatedMask, V1, V2, DAG);
9931 // If we have a single input shuffle with different shuffle patterns in the
9932 // two 128-bit lanes use the variable mask to VPERMILPS.
9933 if (isSingleInputShuffleMask(Mask)) {
9934 SDValue VPermMask[8];
9935 for (int i = 0; i < 8; ++i)
9936 VPermMask[i] = Mask[i] < 0 ? DAG.getUNDEF(MVT::i32)
9937 : DAG.getConstant(Mask[i], MVT::i32);
9938 if (!is128BitLaneCrossingShuffleMask(MVT::v8f32, Mask))
9940 X86ISD::VPERMILPV, DL, MVT::v8f32, V1,
9941 DAG.getNode(ISD::BUILD_VECTOR, DL, MVT::v8i32, VPermMask));
9943 if (Subtarget->hasAVX2())
9944 return DAG.getNode(X86ISD::VPERMV, DL, MVT::v8f32,
9945 DAG.getNode(ISD::BITCAST, DL, MVT::v8f32,
9946 DAG.getNode(ISD::BUILD_VECTOR, DL,
9947 MVT::v8i32, VPermMask)),
9950 // Otherwise, fall back.
9951 return lowerVectorShuffleAsLanePermuteAndBlend(DL, MVT::v8f32, V1, V2, Mask,
9955 // Otherwise fall back on generic blend lowering.
9956 return lowerVectorShuffleAsDecomposedShuffleBlend(DL, MVT::v8f32, V1, V2,
9960 /// \brief Handle lowering of 8-lane 32-bit integer shuffles.
9962 /// This routine is only called when we have AVX2 and thus a reasonable
9963 /// instruction set for v8i32 shuffling..
9964 static SDValue lowerV8I32VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
9965 const X86Subtarget *Subtarget,
9966 SelectionDAG &DAG) {
9968 assert(V1.getSimpleValueType() == MVT::v8i32 && "Bad operand type!");
9969 assert(V2.getSimpleValueType() == MVT::v8i32 && "Bad operand type!");
9970 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
9971 ArrayRef<int> Mask = SVOp->getMask();
9972 assert(Mask.size() == 8 && "Unexpected mask size for v8 shuffle!");
9973 assert(Subtarget->hasAVX2() && "We can only lower v8i32 with AVX2!");
9975 if (SDValue Blend = lowerVectorShuffleAsBlend(DL, MVT::v8i32, V1, V2, Mask,
9979 // Check for being able to broadcast a single element.
9980 if (SDValue Broadcast = lowerVectorShuffleAsBroadcast(MVT::v8i32, DL, V1,
9981 Mask, Subtarget, DAG))
9984 // If the shuffle mask is repeated in each 128-bit lane we can use more
9985 // efficient instructions that mirror the shuffles across the two 128-bit
9987 SmallVector<int, 4> RepeatedMask;
9988 if (is128BitLaneRepeatedShuffleMask(MVT::v8i32, Mask, RepeatedMask)) {
9989 assert(RepeatedMask.size() == 4 && "Unexpected repeated mask size!");
9990 if (isSingleInputShuffleMask(Mask))
9991 return DAG.getNode(X86ISD::PSHUFD, DL, MVT::v8i32, V1,
9992 getV4X86ShuffleImm8ForMask(RepeatedMask, DAG));
9994 // Use dedicated unpack instructions for masks that match their pattern.
9995 if (isShuffleEquivalent(Mask, 0, 8, 1, 9, 4, 12, 5, 13))
9996 return DAG.getNode(X86ISD::UNPCKL, DL, MVT::v8i32, V1, V2);
9997 if (isShuffleEquivalent(Mask, 2, 10, 3, 11, 6, 14, 7, 15))
9998 return DAG.getNode(X86ISD::UNPCKH, DL, MVT::v8i32, V1, V2);
10001 // If the shuffle patterns aren't repeated but it is a single input, directly
10002 // generate a cross-lane VPERMD instruction.
10003 if (isSingleInputShuffleMask(Mask)) {
10004 SDValue VPermMask[8];
10005 for (int i = 0; i < 8; ++i)
10006 VPermMask[i] = Mask[i] < 0 ? DAG.getUNDEF(MVT::i32)
10007 : DAG.getConstant(Mask[i], MVT::i32);
10008 return DAG.getNode(
10009 X86ISD::VPERMV, DL, MVT::v8i32,
10010 DAG.getNode(ISD::BUILD_VECTOR, DL, MVT::v8i32, VPermMask), V1);
10013 // Otherwise fall back on generic blend lowering.
10014 return lowerVectorShuffleAsDecomposedShuffleBlend(DL, MVT::v8i32, V1, V2,
10018 /// \brief Handle lowering of 16-lane 16-bit integer shuffles.
10020 /// This routine is only called when we have AVX2 and thus a reasonable
10021 /// instruction set for v16i16 shuffling..
10022 static SDValue lowerV16I16VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
10023 const X86Subtarget *Subtarget,
10024 SelectionDAG &DAG) {
10026 assert(V1.getSimpleValueType() == MVT::v16i16 && "Bad operand type!");
10027 assert(V2.getSimpleValueType() == MVT::v16i16 && "Bad operand type!");
10028 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
10029 ArrayRef<int> Mask = SVOp->getMask();
10030 assert(Mask.size() == 16 && "Unexpected mask size for v16 shuffle!");
10031 assert(Subtarget->hasAVX2() && "We can only lower v16i16 with AVX2!");
10033 // Check for being able to broadcast a single element.
10034 if (SDValue Broadcast = lowerVectorShuffleAsBroadcast(MVT::v16i16, DL, V1,
10035 Mask, Subtarget, DAG))
10038 // There are no generalized cross-lane shuffle operations available on i16
10040 if (is128BitLaneCrossingShuffleMask(MVT::v16i16, Mask))
10041 return lowerVectorShuffleAsLanePermuteAndBlend(DL, MVT::v16i16, V1, V2,
10044 if (SDValue Blend = lowerVectorShuffleAsBlend(DL, MVT::v16i16, V1, V2, Mask,
10048 // Use dedicated unpack instructions for masks that match their pattern.
10049 if (isShuffleEquivalent(Mask,
10050 // First 128-bit lane:
10051 0, 16, 1, 17, 2, 18, 3, 19,
10052 // Second 128-bit lane:
10053 8, 24, 9, 25, 10, 26, 11, 27))
10054 return DAG.getNode(X86ISD::UNPCKL, DL, MVT::v16i16, V1, V2);
10055 if (isShuffleEquivalent(Mask,
10056 // First 128-bit lane:
10057 4, 20, 5, 21, 6, 22, 7, 23,
10058 // Second 128-bit lane:
10059 12, 28, 13, 29, 14, 30, 15, 31))
10060 return DAG.getNode(X86ISD::UNPCKH, DL, MVT::v16i16, V1, V2);
10062 if (isSingleInputShuffleMask(Mask)) {
10063 SDValue PSHUFBMask[32];
10064 for (int i = 0; i < 16; ++i) {
10065 if (Mask[i] == -1) {
10066 PSHUFBMask[2 * i] = PSHUFBMask[2 * i + 1] = DAG.getUNDEF(MVT::i8);
10070 int M = i < 8 ? Mask[i] : Mask[i] - 8;
10071 assert(M >= 0 && M < 8 && "Invalid single-input mask!");
10072 PSHUFBMask[2 * i] = DAG.getConstant(2 * M, MVT::i8);
10073 PSHUFBMask[2 * i + 1] = DAG.getConstant(2 * M + 1, MVT::i8);
10075 return DAG.getNode(
10076 ISD::BITCAST, DL, MVT::v16i16,
10078 X86ISD::PSHUFB, DL, MVT::v32i8,
10079 DAG.getNode(ISD::BITCAST, DL, MVT::v32i8, V1),
10080 DAG.getNode(ISD::BUILD_VECTOR, DL, MVT::v32i8, PSHUFBMask)));
10083 // Otherwise fall back on generic blend lowering.
10084 return lowerVectorShuffleAsDecomposedShuffleBlend(DL, MVT::v16i16, V1, V2,
10088 /// \brief Handle lowering of 32-lane 8-bit integer shuffles.
10090 /// This routine is only called when we have AVX2 and thus a reasonable
10091 /// instruction set for v32i8 shuffling..
10092 static SDValue lowerV32I8VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
10093 const X86Subtarget *Subtarget,
10094 SelectionDAG &DAG) {
10096 assert(V1.getSimpleValueType() == MVT::v32i8 && "Bad operand type!");
10097 assert(V2.getSimpleValueType() == MVT::v32i8 && "Bad operand type!");
10098 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
10099 ArrayRef<int> Mask = SVOp->getMask();
10100 assert(Mask.size() == 32 && "Unexpected mask size for v32 shuffle!");
10101 assert(Subtarget->hasAVX2() && "We can only lower v32i8 with AVX2!");
10103 // Check for being able to broadcast a single element.
10104 if (SDValue Broadcast = lowerVectorShuffleAsBroadcast(MVT::v32i8, DL, V1,
10105 Mask, Subtarget, DAG))
10108 // There are no generalized cross-lane shuffle operations available on i8
10110 if (is128BitLaneCrossingShuffleMask(MVT::v32i8, Mask))
10111 return lowerVectorShuffleAsLanePermuteAndBlend(DL, MVT::v32i8, V1, V2,
10114 if (SDValue Blend = lowerVectorShuffleAsBlend(DL, MVT::v32i8, V1, V2, Mask,
10118 // Use dedicated unpack instructions for masks that match their pattern.
10119 // Note that these are repeated 128-bit lane unpacks, not unpacks across all
10121 if (isShuffleEquivalent(
10123 // First 128-bit lane:
10124 0, 32, 1, 33, 2, 34, 3, 35, 4, 36, 5, 37, 6, 38, 7, 39,
10125 // Second 128-bit lane:
10126 16, 48, 17, 49, 18, 50, 19, 51, 20, 52, 21, 53, 22, 54, 23, 55))
10127 return DAG.getNode(X86ISD::UNPCKL, DL, MVT::v32i8, V1, V2);
10128 if (isShuffleEquivalent(
10130 // First 128-bit lane:
10131 8, 40, 9, 41, 10, 42, 11, 43, 12, 44, 13, 45, 14, 46, 15, 47,
10132 // Second 128-bit lane:
10133 24, 56, 25, 57, 26, 58, 27, 59, 28, 60, 29, 61, 30, 62, 31, 63))
10134 return DAG.getNode(X86ISD::UNPCKH, DL, MVT::v32i8, V1, V2);
10136 if (isSingleInputShuffleMask(Mask)) {
10137 SDValue PSHUFBMask[32];
10138 for (int i = 0; i < 32; ++i)
10141 ? DAG.getUNDEF(MVT::i8)
10142 : DAG.getConstant(Mask[i] < 16 ? Mask[i] : Mask[i] - 16, MVT::i8);
10144 return DAG.getNode(
10145 X86ISD::PSHUFB, DL, MVT::v32i8, V1,
10146 DAG.getNode(ISD::BUILD_VECTOR, DL, MVT::v32i8, PSHUFBMask));
10149 // Otherwise fall back on generic blend lowering.
10150 return lowerVectorShuffleAsDecomposedShuffleBlend(DL, MVT::v32i8, V1, V2,
10154 /// \brief High-level routine to lower various 256-bit x86 vector shuffles.
10156 /// This routine either breaks down the specific type of a 256-bit x86 vector
10157 /// shuffle or splits it into two 128-bit shuffles and fuses the results back
10158 /// together based on the available instructions.
10159 static SDValue lower256BitVectorShuffle(SDValue Op, SDValue V1, SDValue V2,
10160 MVT VT, const X86Subtarget *Subtarget,
10161 SelectionDAG &DAG) {
10163 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
10164 ArrayRef<int> Mask = SVOp->getMask();
10166 // There is a really nice hard cut-over between AVX1 and AVX2 that means we can
10167 // check for those subtargets here and avoid much of the subtarget querying in
10168 // the per-vector-type lowering routines. With AVX1 we have essentially *zero*
10169 // ability to manipulate a 256-bit vector with integer types. Since we'll use
10170 // floating point types there eventually, just immediately cast everything to
10171 // a float and operate entirely in that domain.
10172 if (VT.isInteger() && !Subtarget->hasAVX2()) {
10173 int ElementBits = VT.getScalarSizeInBits();
10174 if (ElementBits < 32)
10175 // No floating point type available, decompose into 128-bit vectors.
10176 return splitAndLowerVectorShuffle(DL, VT, V1, V2, Mask, DAG);
10178 MVT FpVT = MVT::getVectorVT(MVT::getFloatingPointVT(ElementBits),
10179 VT.getVectorNumElements());
10180 V1 = DAG.getNode(ISD::BITCAST, DL, FpVT, V1);
10181 V2 = DAG.getNode(ISD::BITCAST, DL, FpVT, V2);
10182 return DAG.getNode(ISD::BITCAST, DL, VT,
10183 DAG.getVectorShuffle(FpVT, DL, V1, V2, Mask));
10186 switch (VT.SimpleTy) {
10188 return lowerV4F64VectorShuffle(Op, V1, V2, Subtarget, DAG);
10190 return lowerV4I64VectorShuffle(Op, V1, V2, Subtarget, DAG);
10192 return lowerV8F32VectorShuffle(Op, V1, V2, Subtarget, DAG);
10194 return lowerV8I32VectorShuffle(Op, V1, V2, Subtarget, DAG);
10196 return lowerV16I16VectorShuffle(Op, V1, V2, Subtarget, DAG);
10198 return lowerV32I8VectorShuffle(Op, V1, V2, Subtarget, DAG);
10201 llvm_unreachable("Not a valid 256-bit x86 vector type!");
10205 /// \brief Handle lowering of 8-lane 64-bit floating point shuffles.
10206 static SDValue lowerV8F64VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
10207 const X86Subtarget *Subtarget,
10208 SelectionDAG &DAG) {
10210 assert(V1.getSimpleValueType() == MVT::v8f64 && "Bad operand type!");
10211 assert(V2.getSimpleValueType() == MVT::v8f64 && "Bad operand type!");
10212 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
10213 ArrayRef<int> Mask = SVOp->getMask();
10214 assert(Mask.size() == 8 && "Unexpected mask size for v8 shuffle!");
10216 // FIXME: Implement direct support for this type!
10217 return splitAndLowerVectorShuffle(DL, MVT::v8f64, V1, V2, Mask, DAG);
10220 /// \brief Handle lowering of 16-lane 32-bit floating point shuffles.
10221 static SDValue lowerV16F32VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
10222 const X86Subtarget *Subtarget,
10223 SelectionDAG &DAG) {
10225 assert(V1.getSimpleValueType() == MVT::v16f32 && "Bad operand type!");
10226 assert(V2.getSimpleValueType() == MVT::v16f32 && "Bad operand type!");
10227 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
10228 ArrayRef<int> Mask = SVOp->getMask();
10229 assert(Mask.size() == 16 && "Unexpected mask size for v16 shuffle!");
10231 // FIXME: Implement direct support for this type!
10232 return splitAndLowerVectorShuffle(DL, MVT::v16f32, V1, V2, Mask, DAG);
10235 /// \brief Handle lowering of 8-lane 64-bit integer shuffles.
10236 static SDValue lowerV8I64VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
10237 const X86Subtarget *Subtarget,
10238 SelectionDAG &DAG) {
10240 assert(V1.getSimpleValueType() == MVT::v8i64 && "Bad operand type!");
10241 assert(V2.getSimpleValueType() == MVT::v8i64 && "Bad operand type!");
10242 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
10243 ArrayRef<int> Mask = SVOp->getMask();
10244 assert(Mask.size() == 8 && "Unexpected mask size for v8 shuffle!");
10246 // FIXME: Implement direct support for this type!
10247 return splitAndLowerVectorShuffle(DL, MVT::v8i64, V1, V2, Mask, DAG);
10250 /// \brief Handle lowering of 16-lane 32-bit integer shuffles.
10251 static SDValue lowerV16I32VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
10252 const X86Subtarget *Subtarget,
10253 SelectionDAG &DAG) {
10255 assert(V1.getSimpleValueType() == MVT::v16i32 && "Bad operand type!");
10256 assert(V2.getSimpleValueType() == MVT::v16i32 && "Bad operand type!");
10257 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
10258 ArrayRef<int> Mask = SVOp->getMask();
10259 assert(Mask.size() == 16 && "Unexpected mask size for v16 shuffle!");
10261 // FIXME: Implement direct support for this type!
10262 return splitAndLowerVectorShuffle(DL, MVT::v16i32, V1, V2, Mask, DAG);
10265 /// \brief Handle lowering of 32-lane 16-bit integer shuffles.
10266 static SDValue lowerV32I16VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
10267 const X86Subtarget *Subtarget,
10268 SelectionDAG &DAG) {
10270 assert(V1.getSimpleValueType() == MVT::v32i16 && "Bad operand type!");
10271 assert(V2.getSimpleValueType() == MVT::v32i16 && "Bad operand type!");
10272 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
10273 ArrayRef<int> Mask = SVOp->getMask();
10274 assert(Mask.size() == 32 && "Unexpected mask size for v32 shuffle!");
10275 assert(Subtarget->hasBWI() && "We can only lower v32i16 with AVX-512-BWI!");
10277 // FIXME: Implement direct support for this type!
10278 return splitAndLowerVectorShuffle(DL, MVT::v32i16, V1, V2, Mask, DAG);
10281 /// \brief Handle lowering of 64-lane 8-bit integer shuffles.
10282 static SDValue lowerV64I8VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
10283 const X86Subtarget *Subtarget,
10284 SelectionDAG &DAG) {
10286 assert(V1.getSimpleValueType() == MVT::v64i8 && "Bad operand type!");
10287 assert(V2.getSimpleValueType() == MVT::v64i8 && "Bad operand type!");
10288 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
10289 ArrayRef<int> Mask = SVOp->getMask();
10290 assert(Mask.size() == 64 && "Unexpected mask size for v64 shuffle!");
10291 assert(Subtarget->hasBWI() && "We can only lower v64i8 with AVX-512-BWI!");
10293 // FIXME: Implement direct support for this type!
10294 return splitAndLowerVectorShuffle(DL, MVT::v64i8, V1, V2, Mask, DAG);
10297 /// \brief High-level routine to lower various 512-bit x86 vector shuffles.
10299 /// This routine either breaks down the specific type of a 512-bit x86 vector
10300 /// shuffle or splits it into two 256-bit shuffles and fuses the results back
10301 /// together based on the available instructions.
10302 static SDValue lower512BitVectorShuffle(SDValue Op, SDValue V1, SDValue V2,
10303 MVT VT, const X86Subtarget *Subtarget,
10304 SelectionDAG &DAG) {
10306 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
10307 ArrayRef<int> Mask = SVOp->getMask();
10308 assert(Subtarget->hasAVX512() &&
10309 "Cannot lower 512-bit vectors w/ basic ISA!");
10311 // Check for being able to broadcast a single element.
10312 if (SDValue Broadcast = lowerVectorShuffleAsBroadcast(VT.SimpleTy, DL, V1,
10313 Mask, Subtarget, DAG))
10316 // Dispatch to each element type for lowering. If we don't have supprot for
10317 // specific element type shuffles at 512 bits, immediately split them and
10318 // lower them. Each lowering routine of a given type is allowed to assume that
10319 // the requisite ISA extensions for that element type are available.
10320 switch (VT.SimpleTy) {
10322 return lowerV8F64VectorShuffle(Op, V1, V2, Subtarget, DAG);
10324 return lowerV16F32VectorShuffle(Op, V1, V2, Subtarget, DAG);
10326 return lowerV8I64VectorShuffle(Op, V1, V2, Subtarget, DAG);
10328 return lowerV16I32VectorShuffle(Op, V1, V2, Subtarget, DAG);
10330 if (Subtarget->hasBWI())
10331 return lowerV32I16VectorShuffle(Op, V1, V2, Subtarget, DAG);
10334 if (Subtarget->hasBWI())
10335 return lowerV64I8VectorShuffle(Op, V1, V2, Subtarget, DAG);
10339 llvm_unreachable("Not a valid 512-bit x86 vector type!");
10342 // Otherwise fall back on splitting.
10343 return splitAndLowerVectorShuffle(DL, VT, V1, V2, Mask, DAG);
10346 /// \brief Top-level lowering for x86 vector shuffles.
10348 /// This handles decomposition, canonicalization, and lowering of all x86
10349 /// vector shuffles. Most of the specific lowering strategies are encapsulated
10350 /// above in helper routines. The canonicalization attempts to widen shuffles
10351 /// to involve fewer lanes of wider elements, consolidate symmetric patterns
10352 /// s.t. only one of the two inputs needs to be tested, etc.
10353 static SDValue lowerVectorShuffle(SDValue Op, const X86Subtarget *Subtarget,
10354 SelectionDAG &DAG) {
10355 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
10356 ArrayRef<int> Mask = SVOp->getMask();
10357 SDValue V1 = Op.getOperand(0);
10358 SDValue V2 = Op.getOperand(1);
10359 MVT VT = Op.getSimpleValueType();
10360 int NumElements = VT.getVectorNumElements();
10363 assert(VT.getSizeInBits() != 64 && "Can't lower MMX shuffles");
10365 bool V1IsUndef = V1.getOpcode() == ISD::UNDEF;
10366 bool V2IsUndef = V2.getOpcode() == ISD::UNDEF;
10367 if (V1IsUndef && V2IsUndef)
10368 return DAG.getUNDEF(VT);
10370 // When we create a shuffle node we put the UNDEF node to second operand,
10371 // but in some cases the first operand may be transformed to UNDEF.
10372 // In this case we should just commute the node.
10374 return DAG.getCommutedVectorShuffle(*SVOp);
10376 // Check for non-undef masks pointing at an undef vector and make the masks
10377 // undef as well. This makes it easier to match the shuffle based solely on
10381 if (M >= NumElements) {
10382 SmallVector<int, 8> NewMask(Mask.begin(), Mask.end());
10383 for (int &M : NewMask)
10384 if (M >= NumElements)
10386 return DAG.getVectorShuffle(VT, dl, V1, V2, NewMask);
10389 // Try to collapse shuffles into using a vector type with fewer elements but
10390 // wider element types. We cap this to not form integers or floating point
10391 // elements wider than 64 bits, but it might be interesting to form i128
10392 // integers to handle flipping the low and high halves of AVX 256-bit vectors.
10393 SmallVector<int, 16> WidenedMask;
10394 if (VT.getScalarSizeInBits() < 64 &&
10395 canWidenShuffleElements(Mask, WidenedMask)) {
10396 MVT NewEltVT = VT.isFloatingPoint()
10397 ? MVT::getFloatingPointVT(VT.getScalarSizeInBits() * 2)
10398 : MVT::getIntegerVT(VT.getScalarSizeInBits() * 2);
10399 MVT NewVT = MVT::getVectorVT(NewEltVT, VT.getVectorNumElements() / 2);
10400 // Make sure that the new vector type is legal. For example, v2f64 isn't
10402 if (DAG.getTargetLoweringInfo().isTypeLegal(NewVT)) {
10403 V1 = DAG.getNode(ISD::BITCAST, dl, NewVT, V1);
10404 V2 = DAG.getNode(ISD::BITCAST, dl, NewVT, V2);
10405 return DAG.getNode(ISD::BITCAST, dl, VT,
10406 DAG.getVectorShuffle(NewVT, dl, V1, V2, WidenedMask));
10410 int NumV1Elements = 0, NumUndefElements = 0, NumV2Elements = 0;
10411 for (int M : SVOp->getMask())
10413 ++NumUndefElements;
10414 else if (M < NumElements)
10419 // Commute the shuffle as needed such that more elements come from V1 than
10420 // V2. This allows us to match the shuffle pattern strictly on how many
10421 // elements come from V1 without handling the symmetric cases.
10422 if (NumV2Elements > NumV1Elements)
10423 return DAG.getCommutedVectorShuffle(*SVOp);
10425 // When the number of V1 and V2 elements are the same, try to minimize the
10426 // number of uses of V2 in the low half of the vector. When that is tied,
10427 // ensure that the sum of indices for V1 is equal to or lower than the sum
10429 if (NumV1Elements == NumV2Elements) {
10430 int LowV1Elements = 0, LowV2Elements = 0;
10431 for (int M : SVOp->getMask().slice(0, NumElements / 2))
10432 if (M >= NumElements)
10436 if (LowV2Elements > LowV1Elements) {
10437 return DAG.getCommutedVectorShuffle(*SVOp);
10438 } else if (LowV2Elements == LowV1Elements) {
10439 int SumV1Indices = 0, SumV2Indices = 0;
10440 for (int i = 0, Size = SVOp->getMask().size(); i < Size; ++i)
10441 if (SVOp->getMask()[i] >= NumElements)
10443 else if (SVOp->getMask()[i] >= 0)
10445 if (SumV2Indices < SumV1Indices)
10446 return DAG.getCommutedVectorShuffle(*SVOp);
10450 // For each vector width, delegate to a specialized lowering routine.
10451 if (VT.getSizeInBits() == 128)
10452 return lower128BitVectorShuffle(Op, V1, V2, VT, Subtarget, DAG);
10454 if (VT.getSizeInBits() == 256)
10455 return lower256BitVectorShuffle(Op, V1, V2, VT, Subtarget, DAG);
10457 // Force AVX-512 vectors to be scalarized for now.
10458 // FIXME: Implement AVX-512 support!
10459 if (VT.getSizeInBits() == 512)
10460 return lower512BitVectorShuffle(Op, V1, V2, VT, Subtarget, DAG);
10462 llvm_unreachable("Unimplemented!");
10466 //===----------------------------------------------------------------------===//
10467 // Legacy vector shuffle lowering
10469 // This code is the legacy code handling vector shuffles until the above
10470 // replaces its functionality and performance.
10471 //===----------------------------------------------------------------------===//
10473 static bool isBlendMask(ArrayRef<int> MaskVals, MVT VT, bool hasSSE41,
10474 bool hasInt256, unsigned *MaskOut = nullptr) {
10475 MVT EltVT = VT.getVectorElementType();
10477 // There is no blend with immediate in AVX-512.
10478 if (VT.is512BitVector())
10481 if (!hasSSE41 || EltVT == MVT::i8)
10483 if (!hasInt256 && VT == MVT::v16i16)
10486 unsigned MaskValue = 0;
10487 unsigned NumElems = VT.getVectorNumElements();
10488 // There are 2 lanes if (NumElems > 8), and 1 lane otherwise.
10489 unsigned NumLanes = (NumElems - 1) / 8 + 1;
10490 unsigned NumElemsInLane = NumElems / NumLanes;
10492 // Blend for v16i16 should be symetric for the both lanes.
10493 for (unsigned i = 0; i < NumElemsInLane; ++i) {
10495 int SndLaneEltIdx = (NumLanes == 2) ? MaskVals[i + NumElemsInLane] : -1;
10496 int EltIdx = MaskVals[i];
10498 if ((EltIdx < 0 || EltIdx == (int)i) &&
10499 (SndLaneEltIdx < 0 || SndLaneEltIdx == (int)(i + NumElemsInLane)))
10502 if (((unsigned)EltIdx == (i + NumElems)) &&
10503 (SndLaneEltIdx < 0 ||
10504 (unsigned)SndLaneEltIdx == i + NumElems + NumElemsInLane))
10505 MaskValue |= (1 << i);
10511 *MaskOut = MaskValue;
10515 // Try to lower a shuffle node into a simple blend instruction.
10516 // This function assumes isBlendMask returns true for this
10517 // SuffleVectorSDNode
10518 static SDValue LowerVECTOR_SHUFFLEtoBlend(ShuffleVectorSDNode *SVOp,
10519 unsigned MaskValue,
10520 const X86Subtarget *Subtarget,
10521 SelectionDAG &DAG) {
10522 MVT VT = SVOp->getSimpleValueType(0);
10523 MVT EltVT = VT.getVectorElementType();
10524 assert(isBlendMask(SVOp->getMask(), VT, Subtarget->hasSSE41(),
10525 Subtarget->hasInt256() && "Trying to lower a "
10526 "VECTOR_SHUFFLE to a Blend but "
10527 "with the wrong mask"));
10528 SDValue V1 = SVOp->getOperand(0);
10529 SDValue V2 = SVOp->getOperand(1);
10531 unsigned NumElems = VT.getVectorNumElements();
10533 // Convert i32 vectors to floating point if it is not AVX2.
10534 // AVX2 introduced VPBLENDD instruction for 128 and 256-bit vectors.
10536 if (EltVT == MVT::i64 || (EltVT == MVT::i32 && !Subtarget->hasInt256())) {
10537 BlendVT = MVT::getVectorVT(MVT::getFloatingPointVT(EltVT.getSizeInBits()),
10539 V1 = DAG.getNode(ISD::BITCAST, dl, VT, V1);
10540 V2 = DAG.getNode(ISD::BITCAST, dl, VT, V2);
10543 SDValue Ret = DAG.getNode(X86ISD::BLENDI, dl, BlendVT, V1, V2,
10544 DAG.getConstant(MaskValue, MVT::i32));
10545 return DAG.getNode(ISD::BITCAST, dl, VT, Ret);
10548 /// In vector type \p VT, return true if the element at index \p InputIdx
10549 /// falls on a different 128-bit lane than \p OutputIdx.
10550 static bool ShuffleCrosses128bitLane(MVT VT, unsigned InputIdx,
10551 unsigned OutputIdx) {
10552 unsigned EltSize = VT.getVectorElementType().getSizeInBits();
10553 return InputIdx * EltSize / 128 != OutputIdx * EltSize / 128;
10556 /// Generate a PSHUFB if possible. Selects elements from \p V1 according to
10557 /// \p MaskVals. MaskVals[OutputIdx] = InputIdx specifies that we want to
10558 /// shuffle the element at InputIdx in V1 to OutputIdx in the result. If \p
10559 /// MaskVals refers to elements outside of \p V1 or is undef (-1), insert a
10561 static SDValue getPSHUFB(ArrayRef<int> MaskVals, SDValue V1, SDLoc &dl,
10562 SelectionDAG &DAG) {
10563 MVT VT = V1.getSimpleValueType();
10564 assert(VT.is128BitVector() || VT.is256BitVector());
10566 MVT EltVT = VT.getVectorElementType();
10567 unsigned EltSizeInBytes = EltVT.getSizeInBits() / 8;
10568 unsigned NumElts = VT.getVectorNumElements();
10570 SmallVector<SDValue, 32> PshufbMask;
10571 for (unsigned OutputIdx = 0; OutputIdx < NumElts; ++OutputIdx) {
10572 int InputIdx = MaskVals[OutputIdx];
10573 unsigned InputByteIdx;
10575 if (InputIdx < 0 || NumElts <= (unsigned)InputIdx)
10576 InputByteIdx = 0x80;
10578 // Cross lane is not allowed.
10579 if (ShuffleCrosses128bitLane(VT, InputIdx, OutputIdx))
10581 InputByteIdx = InputIdx * EltSizeInBytes;
10582 // Index is an byte offset within the 128-bit lane.
10583 InputByteIdx &= 0xf;
10586 for (unsigned j = 0; j < EltSizeInBytes; ++j) {
10587 PshufbMask.push_back(DAG.getConstant(InputByteIdx, MVT::i8));
10588 if (InputByteIdx != 0x80)
10593 MVT ShufVT = MVT::getVectorVT(MVT::i8, PshufbMask.size());
10595 V1 = DAG.getNode(ISD::BITCAST, dl, ShufVT, V1);
10596 return DAG.getNode(X86ISD::PSHUFB, dl, ShufVT, V1,
10597 DAG.getNode(ISD::BUILD_VECTOR, dl, ShufVT, PshufbMask));
10600 // v8i16 shuffles - Prefer shuffles in the following order:
10601 // 1. [all] pshuflw, pshufhw, optional move
10602 // 2. [ssse3] 1 x pshufb
10603 // 3. [ssse3] 2 x pshufb + 1 x por
10604 // 4. [all] mov + pshuflw + pshufhw + N x (pextrw + pinsrw)
10606 LowerVECTOR_SHUFFLEv8i16(SDValue Op, const X86Subtarget *Subtarget,
10607 SelectionDAG &DAG) {
10608 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
10609 SDValue V1 = SVOp->getOperand(0);
10610 SDValue V2 = SVOp->getOperand(1);
10612 SmallVector<int, 8> MaskVals;
10614 // Determine if more than 1 of the words in each of the low and high quadwords
10615 // of the result come from the same quadword of one of the two inputs. Undef
10616 // mask values count as coming from any quadword, for better codegen.
10618 // Lo/HiQuad[i] = j indicates how many words from the ith quad of the input
10619 // feeds this quad. For i, 0 and 1 refer to V1, 2 and 3 refer to V2.
10620 unsigned LoQuad[] = { 0, 0, 0, 0 };
10621 unsigned HiQuad[] = { 0, 0, 0, 0 };
10622 // Indices of quads used.
10623 std::bitset<4> InputQuads;
10624 for (unsigned i = 0; i < 8; ++i) {
10625 unsigned *Quad = i < 4 ? LoQuad : HiQuad;
10626 int EltIdx = SVOp->getMaskElt(i);
10627 MaskVals.push_back(EltIdx);
10635 ++Quad[EltIdx / 4];
10636 InputQuads.set(EltIdx / 4);
10639 int BestLoQuad = -1;
10640 unsigned MaxQuad = 1;
10641 for (unsigned i = 0; i < 4; ++i) {
10642 if (LoQuad[i] > MaxQuad) {
10644 MaxQuad = LoQuad[i];
10648 int BestHiQuad = -1;
10650 for (unsigned i = 0; i < 4; ++i) {
10651 if (HiQuad[i] > MaxQuad) {
10653 MaxQuad = HiQuad[i];
10657 // For SSSE3, If all 8 words of the result come from only 1 quadword of each
10658 // of the two input vectors, shuffle them into one input vector so only a
10659 // single pshufb instruction is necessary. If there are more than 2 input
10660 // quads, disable the next transformation since it does not help SSSE3.
10661 bool V1Used = InputQuads[0] || InputQuads[1];
10662 bool V2Used = InputQuads[2] || InputQuads[3];
10663 if (Subtarget->hasSSSE3()) {
10664 if (InputQuads.count() == 2 && V1Used && V2Used) {
10665 BestLoQuad = InputQuads[0] ? 0 : 1;
10666 BestHiQuad = InputQuads[2] ? 2 : 3;
10668 if (InputQuads.count() > 2) {
10674 // If BestLoQuad or BestHiQuad are set, shuffle the quads together and update
10675 // the shuffle mask. If a quad is scored as -1, that means that it contains
10676 // words from all 4 input quadwords.
10678 if (BestLoQuad >= 0 || BestHiQuad >= 0) {
10680 BestLoQuad < 0 ? 0 : BestLoQuad,
10681 BestHiQuad < 0 ? 1 : BestHiQuad
10683 NewV = DAG.getVectorShuffle(MVT::v2i64, dl,
10684 DAG.getNode(ISD::BITCAST, dl, MVT::v2i64, V1),
10685 DAG.getNode(ISD::BITCAST, dl, MVT::v2i64, V2), &MaskV[0]);
10686 NewV = DAG.getNode(ISD::BITCAST, dl, MVT::v8i16, NewV);
10688 // Rewrite the MaskVals and assign NewV to V1 if NewV now contains all the
10689 // source words for the shuffle, to aid later transformations.
10690 bool AllWordsInNewV = true;
10691 bool InOrder[2] = { true, true };
10692 for (unsigned i = 0; i != 8; ++i) {
10693 int idx = MaskVals[i];
10695 InOrder[i/4] = false;
10696 if (idx < 0 || (idx/4) == BestLoQuad || (idx/4) == BestHiQuad)
10698 AllWordsInNewV = false;
10702 bool pshuflw = AllWordsInNewV, pshufhw = AllWordsInNewV;
10703 if (AllWordsInNewV) {
10704 for (int i = 0; i != 8; ++i) {
10705 int idx = MaskVals[i];
10708 idx = MaskVals[i] = (idx / 4) == BestLoQuad ? (idx & 3) : (idx & 3) + 4;
10709 if ((idx != i) && idx < 4)
10711 if ((idx != i) && idx > 3)
10720 // If we've eliminated the use of V2, and the new mask is a pshuflw or
10721 // pshufhw, that's as cheap as it gets. Return the new shuffle.
10722 if ((pshufhw && InOrder[0]) || (pshuflw && InOrder[1])) {
10723 unsigned Opc = pshufhw ? X86ISD::PSHUFHW : X86ISD::PSHUFLW;
10724 unsigned TargetMask = 0;
10725 NewV = DAG.getVectorShuffle(MVT::v8i16, dl, NewV,
10726 DAG.getUNDEF(MVT::v8i16), &MaskVals[0]);
10727 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(NewV.getNode());
10728 TargetMask = pshufhw ? getShufflePSHUFHWImmediate(SVOp):
10729 getShufflePSHUFLWImmediate(SVOp);
10730 V1 = NewV.getOperand(0);
10731 return getTargetShuffleNode(Opc, dl, MVT::v8i16, V1, TargetMask, DAG);
10735 // Promote splats to a larger type which usually leads to more efficient code.
10736 // FIXME: Is this true if pshufb is available?
10737 if (SVOp->isSplat())
10738 return PromoteSplat(SVOp, DAG);
10740 // If we have SSSE3, and all words of the result are from 1 input vector,
10741 // case 2 is generated, otherwise case 3 is generated. If no SSSE3
10742 // is present, fall back to case 4.
10743 if (Subtarget->hasSSSE3()) {
10744 SmallVector<SDValue,16> pshufbMask;
10746 // If we have elements from both input vectors, set the high bit of the
10747 // shuffle mask element to zero out elements that come from V2 in the V1
10748 // mask, and elements that come from V1 in the V2 mask, so that the two
10749 // results can be OR'd together.
10750 bool TwoInputs = V1Used && V2Used;
10751 V1 = getPSHUFB(MaskVals, V1, dl, DAG);
10753 return DAG.getNode(ISD::BITCAST, dl, MVT::v8i16, V1);
10755 // Calculate the shuffle mask for the second input, shuffle it, and
10756 // OR it with the first shuffled input.
10757 CommuteVectorShuffleMask(MaskVals, 8);
10758 V2 = getPSHUFB(MaskVals, V2, dl, DAG);
10759 V1 = DAG.getNode(ISD::OR, dl, MVT::v16i8, V1, V2);
10760 return DAG.getNode(ISD::BITCAST, dl, MVT::v8i16, V1);
10763 // If BestLoQuad >= 0, generate a pshuflw to put the low elements in order,
10764 // and update MaskVals with new element order.
10765 std::bitset<8> InOrder;
10766 if (BestLoQuad >= 0) {
10767 int MaskV[] = { -1, -1, -1, -1, 4, 5, 6, 7 };
10768 for (int i = 0; i != 4; ++i) {
10769 int idx = MaskVals[i];
10772 } else if ((idx / 4) == BestLoQuad) {
10773 MaskV[i] = idx & 3;
10777 NewV = DAG.getVectorShuffle(MVT::v8i16, dl, NewV, DAG.getUNDEF(MVT::v8i16),
10780 if (NewV.getOpcode() == ISD::VECTOR_SHUFFLE && Subtarget->hasSSE2()) {
10781 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(NewV.getNode());
10782 NewV = getTargetShuffleNode(X86ISD::PSHUFLW, dl, MVT::v8i16,
10783 NewV.getOperand(0),
10784 getShufflePSHUFLWImmediate(SVOp), DAG);
10788 // If BestHi >= 0, generate a pshufhw to put the high elements in order,
10789 // and update MaskVals with the new element order.
10790 if (BestHiQuad >= 0) {
10791 int MaskV[] = { 0, 1, 2, 3, -1, -1, -1, -1 };
10792 for (unsigned i = 4; i != 8; ++i) {
10793 int idx = MaskVals[i];
10796 } else if ((idx / 4) == BestHiQuad) {
10797 MaskV[i] = (idx & 3) + 4;
10801 NewV = DAG.getVectorShuffle(MVT::v8i16, dl, NewV, DAG.getUNDEF(MVT::v8i16),
10804 if (NewV.getOpcode() == ISD::VECTOR_SHUFFLE && Subtarget->hasSSE2()) {
10805 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(NewV.getNode());
10806 NewV = getTargetShuffleNode(X86ISD::PSHUFHW, dl, MVT::v8i16,
10807 NewV.getOperand(0),
10808 getShufflePSHUFHWImmediate(SVOp), DAG);
10812 // In case BestHi & BestLo were both -1, which means each quadword has a word
10813 // from each of the four input quadwords, calculate the InOrder bitvector now
10814 // before falling through to the insert/extract cleanup.
10815 if (BestLoQuad == -1 && BestHiQuad == -1) {
10817 for (int i = 0; i != 8; ++i)
10818 if (MaskVals[i] < 0 || MaskVals[i] == i)
10822 // The other elements are put in the right place using pextrw and pinsrw.
10823 for (unsigned i = 0; i != 8; ++i) {
10826 int EltIdx = MaskVals[i];
10829 SDValue ExtOp = (EltIdx < 8) ?
10830 DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::i16, V1,
10831 DAG.getIntPtrConstant(EltIdx)) :
10832 DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::i16, V2,
10833 DAG.getIntPtrConstant(EltIdx - 8));
10834 NewV = DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, MVT::v8i16, NewV, ExtOp,
10835 DAG.getIntPtrConstant(i));
10840 /// \brief v16i16 shuffles
10842 /// FIXME: We only support generation of a single pshufb currently. We can
10843 /// generalize the other applicable cases from LowerVECTOR_SHUFFLEv8i16 as
10844 /// well (e.g 2 x pshufb + 1 x por).
10846 LowerVECTOR_SHUFFLEv16i16(SDValue Op, SelectionDAG &DAG) {
10847 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
10848 SDValue V1 = SVOp->getOperand(0);
10849 SDValue V2 = SVOp->getOperand(1);
10852 if (V2.getOpcode() != ISD::UNDEF)
10855 SmallVector<int, 16> MaskVals(SVOp->getMask().begin(), SVOp->getMask().end());
10856 return getPSHUFB(MaskVals, V1, dl, DAG);
10859 // v16i8 shuffles - Prefer shuffles in the following order:
10860 // 1. [ssse3] 1 x pshufb
10861 // 2. [ssse3] 2 x pshufb + 1 x por
10862 // 3. [all] v8i16 shuffle + N x pextrw + rotate + pinsrw
10863 static SDValue LowerVECTOR_SHUFFLEv16i8(ShuffleVectorSDNode *SVOp,
10864 const X86Subtarget* Subtarget,
10865 SelectionDAG &DAG) {
10866 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
10867 SDValue V1 = SVOp->getOperand(0);
10868 SDValue V2 = SVOp->getOperand(1);
10870 ArrayRef<int> MaskVals = SVOp->getMask();
10872 // Promote splats to a larger type which usually leads to more efficient code.
10873 // FIXME: Is this true if pshufb is available?
10874 if (SVOp->isSplat())
10875 return PromoteSplat(SVOp, DAG);
10877 // If we have SSSE3, case 1 is generated when all result bytes come from
10878 // one of the inputs. Otherwise, case 2 is generated. If no SSSE3 is
10879 // present, fall back to case 3.
10881 // If SSSE3, use 1 pshufb instruction per vector with elements in the result.
10882 if (Subtarget->hasSSSE3()) {
10883 SmallVector<SDValue,16> pshufbMask;
10885 // If all result elements are from one input vector, then only translate
10886 // undef mask values to 0x80 (zero out result) in the pshufb mask.
10888 // Otherwise, we have elements from both input vectors, and must zero out
10889 // elements that come from V2 in the first mask, and V1 in the second mask
10890 // so that we can OR them together.
10891 for (unsigned i = 0; i != 16; ++i) {
10892 int EltIdx = MaskVals[i];
10893 if (EltIdx < 0 || EltIdx >= 16)
10895 pshufbMask.push_back(DAG.getConstant(EltIdx, MVT::i8));
10897 V1 = DAG.getNode(X86ISD::PSHUFB, dl, MVT::v16i8, V1,
10898 DAG.getNode(ISD::BUILD_VECTOR, dl,
10899 MVT::v16i8, pshufbMask));
10901 // As PSHUFB will zero elements with negative indices, it's safe to ignore
10902 // the 2nd operand if it's undefined or zero.
10903 if (V2.getOpcode() == ISD::UNDEF ||
10904 ISD::isBuildVectorAllZeros(V2.getNode()))
10907 // Calculate the shuffle mask for the second input, shuffle it, and
10908 // OR it with the first shuffled input.
10909 pshufbMask.clear();
10910 for (unsigned i = 0; i != 16; ++i) {
10911 int EltIdx = MaskVals[i];
10912 EltIdx = (EltIdx < 16) ? 0x80 : EltIdx - 16;
10913 pshufbMask.push_back(DAG.getConstant(EltIdx, MVT::i8));
10915 V2 = DAG.getNode(X86ISD::PSHUFB, dl, MVT::v16i8, V2,
10916 DAG.getNode(ISD::BUILD_VECTOR, dl,
10917 MVT::v16i8, pshufbMask));
10918 return DAG.getNode(ISD::OR, dl, MVT::v16i8, V1, V2);
10921 // No SSSE3 - Calculate in place words and then fix all out of place words
10922 // With 0-16 extracts & inserts. Worst case is 16 bytes out of order from
10923 // the 16 different words that comprise the two doublequadword input vectors.
10924 V1 = DAG.getNode(ISD::BITCAST, dl, MVT::v8i16, V1);
10925 V2 = DAG.getNode(ISD::BITCAST, dl, MVT::v8i16, V2);
10927 for (int i = 0; i != 8; ++i) {
10928 int Elt0 = MaskVals[i*2];
10929 int Elt1 = MaskVals[i*2+1];
10931 // This word of the result is all undef, skip it.
10932 if (Elt0 < 0 && Elt1 < 0)
10935 // This word of the result is already in the correct place, skip it.
10936 if ((Elt0 == i*2) && (Elt1 == i*2+1))
10939 SDValue Elt0Src = Elt0 < 16 ? V1 : V2;
10940 SDValue Elt1Src = Elt1 < 16 ? V1 : V2;
10943 // If Elt0 and Elt1 are defined, are consecutive, and can be load
10944 // using a single extract together, load it and store it.
10945 if ((Elt0 >= 0) && ((Elt0 + 1) == Elt1) && ((Elt0 & 1) == 0)) {
10946 InsElt = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::i16, Elt1Src,
10947 DAG.getIntPtrConstant(Elt1 / 2));
10948 NewV = DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, MVT::v8i16, NewV, InsElt,
10949 DAG.getIntPtrConstant(i));
10953 // If Elt1 is defined, extract it from the appropriate source. If the
10954 // source byte is not also odd, shift the extracted word left 8 bits
10955 // otherwise clear the bottom 8 bits if we need to do an or.
10957 InsElt = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::i16, Elt1Src,
10958 DAG.getIntPtrConstant(Elt1 / 2));
10959 if ((Elt1 & 1) == 0)
10960 InsElt = DAG.getNode(ISD::SHL, dl, MVT::i16, InsElt,
10962 TLI.getShiftAmountTy(InsElt.getValueType())));
10963 else if (Elt0 >= 0)
10964 InsElt = DAG.getNode(ISD::AND, dl, MVT::i16, InsElt,
10965 DAG.getConstant(0xFF00, MVT::i16));
10967 // If Elt0 is defined, extract it from the appropriate source. If the
10968 // source byte is not also even, shift the extracted word right 8 bits. If
10969 // Elt1 was also defined, OR the extracted values together before
10970 // inserting them in the result.
10972 SDValue InsElt0 = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::i16,
10973 Elt0Src, DAG.getIntPtrConstant(Elt0 / 2));
10974 if ((Elt0 & 1) != 0)
10975 InsElt0 = DAG.getNode(ISD::SRL, dl, MVT::i16, InsElt0,
10977 TLI.getShiftAmountTy(InsElt0.getValueType())));
10978 else if (Elt1 >= 0)
10979 InsElt0 = DAG.getNode(ISD::AND, dl, MVT::i16, InsElt0,
10980 DAG.getConstant(0x00FF, MVT::i16));
10981 InsElt = Elt1 >= 0 ? DAG.getNode(ISD::OR, dl, MVT::i16, InsElt, InsElt0)
10984 NewV = DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, MVT::v8i16, NewV, InsElt,
10985 DAG.getIntPtrConstant(i));
10987 return DAG.getNode(ISD::BITCAST, dl, MVT::v16i8, NewV);
10990 // v32i8 shuffles - Translate to VPSHUFB if possible.
10992 SDValue LowerVECTOR_SHUFFLEv32i8(ShuffleVectorSDNode *SVOp,
10993 const X86Subtarget *Subtarget,
10994 SelectionDAG &DAG) {
10995 MVT VT = SVOp->getSimpleValueType(0);
10996 SDValue V1 = SVOp->getOperand(0);
10997 SDValue V2 = SVOp->getOperand(1);
10999 SmallVector<int, 32> MaskVals(SVOp->getMask().begin(), SVOp->getMask().end());
11001 bool V2IsUndef = V2.getOpcode() == ISD::UNDEF;
11002 bool V1IsAllZero = ISD::isBuildVectorAllZeros(V1.getNode());
11003 bool V2IsAllZero = ISD::isBuildVectorAllZeros(V2.getNode());
11005 // VPSHUFB may be generated if
11006 // (1) one of input vector is undefined or zeroinitializer.
11007 // The mask value 0x80 puts 0 in the corresponding slot of the vector.
11008 // And (2) the mask indexes don't cross the 128-bit lane.
11009 if (VT != MVT::v32i8 || !Subtarget->hasInt256() ||
11010 (!V2IsUndef && !V2IsAllZero && !V1IsAllZero))
11013 if (V1IsAllZero && !V2IsAllZero) {
11014 CommuteVectorShuffleMask(MaskVals, 32);
11017 return getPSHUFB(MaskVals, V1, dl, DAG);
11020 /// RewriteAsNarrowerShuffle - Try rewriting v8i16 and v16i8 shuffles as 4 wide
11021 /// ones, or rewriting v4i32 / v4f32 as 2 wide ones if possible. This can be
11022 /// done when every pair / quad of shuffle mask elements point to elements in
11023 /// the right sequence. e.g.
11024 /// vector_shuffle X, Y, <2, 3, | 10, 11, | 0, 1, | 14, 15>
11026 SDValue RewriteAsNarrowerShuffle(ShuffleVectorSDNode *SVOp,
11027 SelectionDAG &DAG) {
11028 MVT VT = SVOp->getSimpleValueType(0);
11030 unsigned NumElems = VT.getVectorNumElements();
11033 switch (VT.SimpleTy) {
11034 default: llvm_unreachable("Unexpected!");
11037 return SDValue(SVOp, 0);
11038 case MVT::v4f32: NewVT = MVT::v2f64; Scale = 2; break;
11039 case MVT::v4i32: NewVT = MVT::v2i64; Scale = 2; break;
11040 case MVT::v8i16: NewVT = MVT::v4i32; Scale = 2; break;
11041 case MVT::v16i8: NewVT = MVT::v4i32; Scale = 4; break;
11042 case MVT::v16i16: NewVT = MVT::v8i32; Scale = 2; break;
11043 case MVT::v32i8: NewVT = MVT::v8i32; Scale = 4; break;
11046 SmallVector<int, 8> MaskVec;
11047 for (unsigned i = 0; i != NumElems; i += Scale) {
11049 for (unsigned j = 0; j != Scale; ++j) {
11050 int EltIdx = SVOp->getMaskElt(i+j);
11054 StartIdx = (EltIdx / Scale);
11055 if (EltIdx != (int)(StartIdx*Scale + j))
11058 MaskVec.push_back(StartIdx);
11061 SDValue V1 = DAG.getNode(ISD::BITCAST, dl, NewVT, SVOp->getOperand(0));
11062 SDValue V2 = DAG.getNode(ISD::BITCAST, dl, NewVT, SVOp->getOperand(1));
11063 return DAG.getVectorShuffle(NewVT, dl, V1, V2, &MaskVec[0]);
11066 /// getVZextMovL - Return a zero-extending vector move low node.
11068 static SDValue getVZextMovL(MVT VT, MVT OpVT,
11069 SDValue SrcOp, SelectionDAG &DAG,
11070 const X86Subtarget *Subtarget, SDLoc dl) {
11071 if (VT == MVT::v2f64 || VT == MVT::v4f32) {
11072 LoadSDNode *LD = nullptr;
11073 if (!isScalarLoadToVector(SrcOp.getNode(), &LD))
11074 LD = dyn_cast<LoadSDNode>(SrcOp);
11076 // movssrr and movsdrr do not clear top bits. Try to use movd, movq
11078 MVT ExtVT = (OpVT == MVT::v2f64) ? MVT::i64 : MVT::i32;
11079 if ((ExtVT != MVT::i64 || Subtarget->is64Bit()) &&
11080 SrcOp.getOpcode() == ISD::SCALAR_TO_VECTOR &&
11081 SrcOp.getOperand(0).getOpcode() == ISD::BITCAST &&
11082 SrcOp.getOperand(0).getOperand(0).getValueType() == ExtVT) {
11084 OpVT = (OpVT == MVT::v2f64) ? MVT::v2i64 : MVT::v4i32;
11085 return DAG.getNode(ISD::BITCAST, dl, VT,
11086 DAG.getNode(X86ISD::VZEXT_MOVL, dl, OpVT,
11087 DAG.getNode(ISD::SCALAR_TO_VECTOR, dl,
11089 SrcOp.getOperand(0)
11095 return DAG.getNode(ISD::BITCAST, dl, VT,
11096 DAG.getNode(X86ISD::VZEXT_MOVL, dl, OpVT,
11097 DAG.getNode(ISD::BITCAST, dl,
11101 /// LowerVECTOR_SHUFFLE_256 - Handle all 256-bit wide vectors shuffles
11102 /// which could not be matched by any known target speficic shuffle
11104 LowerVECTOR_SHUFFLE_256(ShuffleVectorSDNode *SVOp, SelectionDAG &DAG) {
11106 SDValue NewOp = Compact8x32ShuffleNode(SVOp, DAG);
11107 if (NewOp.getNode())
11110 MVT VT = SVOp->getSimpleValueType(0);
11112 unsigned NumElems = VT.getVectorNumElements();
11113 unsigned NumLaneElems = NumElems / 2;
11116 MVT EltVT = VT.getVectorElementType();
11117 MVT NVT = MVT::getVectorVT(EltVT, NumLaneElems);
11120 SmallVector<int, 16> Mask;
11121 for (unsigned l = 0; l < 2; ++l) {
11122 // Build a shuffle mask for the output, discovering on the fly which
11123 // input vectors to use as shuffle operands (recorded in InputUsed).
11124 // If building a suitable shuffle vector proves too hard, then bail
11125 // out with UseBuildVector set.
11126 bool UseBuildVector = false;
11127 int InputUsed[2] = { -1, -1 }; // Not yet discovered.
11128 unsigned LaneStart = l * NumLaneElems;
11129 for (unsigned i = 0; i != NumLaneElems; ++i) {
11130 // The mask element. This indexes into the input.
11131 int Idx = SVOp->getMaskElt(i+LaneStart);
11133 // the mask element does not index into any input vector.
11134 Mask.push_back(-1);
11138 // The input vector this mask element indexes into.
11139 int Input = Idx / NumLaneElems;
11141 // Turn the index into an offset from the start of the input vector.
11142 Idx -= Input * NumLaneElems;
11144 // Find or create a shuffle vector operand to hold this input.
11146 for (OpNo = 0; OpNo < array_lengthof(InputUsed); ++OpNo) {
11147 if (InputUsed[OpNo] == Input)
11148 // This input vector is already an operand.
11150 if (InputUsed[OpNo] < 0) {
11151 // Create a new operand for this input vector.
11152 InputUsed[OpNo] = Input;
11157 if (OpNo >= array_lengthof(InputUsed)) {
11158 // More than two input vectors used! Give up on trying to create a
11159 // shuffle vector. Insert all elements into a BUILD_VECTOR instead.
11160 UseBuildVector = true;
11164 // Add the mask index for the new shuffle vector.
11165 Mask.push_back(Idx + OpNo * NumLaneElems);
11168 if (UseBuildVector) {
11169 SmallVector<SDValue, 16> SVOps;
11170 for (unsigned i = 0; i != NumLaneElems; ++i) {
11171 // The mask element. This indexes into the input.
11172 int Idx = SVOp->getMaskElt(i+LaneStart);
11174 SVOps.push_back(DAG.getUNDEF(EltVT));
11178 // The input vector this mask element indexes into.
11179 int Input = Idx / NumElems;
11181 // Turn the index into an offset from the start of the input vector.
11182 Idx -= Input * NumElems;
11184 // Extract the vector element by hand.
11185 SVOps.push_back(DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, EltVT,
11186 SVOp->getOperand(Input),
11187 DAG.getIntPtrConstant(Idx)));
11190 // Construct the output using a BUILD_VECTOR.
11191 Output[l] = DAG.getNode(ISD::BUILD_VECTOR, dl, NVT, SVOps);
11192 } else if (InputUsed[0] < 0) {
11193 // No input vectors were used! The result is undefined.
11194 Output[l] = DAG.getUNDEF(NVT);
11196 SDValue Op0 = Extract128BitVector(SVOp->getOperand(InputUsed[0] / 2),
11197 (InputUsed[0] % 2) * NumLaneElems,
11199 // If only one input was used, use an undefined vector for the other.
11200 SDValue Op1 = (InputUsed[1] < 0) ? DAG.getUNDEF(NVT) :
11201 Extract128BitVector(SVOp->getOperand(InputUsed[1] / 2),
11202 (InputUsed[1] % 2) * NumLaneElems, DAG, dl);
11203 // At least one input vector was used. Create a new shuffle vector.
11204 Output[l] = DAG.getVectorShuffle(NVT, dl, Op0, Op1, &Mask[0]);
11210 // Concatenate the result back
11211 return DAG.getNode(ISD::CONCAT_VECTORS, dl, VT, Output[0], Output[1]);
11214 /// LowerVECTOR_SHUFFLE_128v4 - Handle all 128-bit wide vectors with
11215 /// 4 elements, and match them with several different shuffle types.
11217 LowerVECTOR_SHUFFLE_128v4(ShuffleVectorSDNode *SVOp, SelectionDAG &DAG) {
11218 SDValue V1 = SVOp->getOperand(0);
11219 SDValue V2 = SVOp->getOperand(1);
11221 MVT VT = SVOp->getSimpleValueType(0);
11223 assert(VT.is128BitVector() && "Unsupported vector size");
11225 std::pair<int, int> Locs[4];
11226 int Mask1[] = { -1, -1, -1, -1 };
11227 SmallVector<int, 8> PermMask(SVOp->getMask().begin(), SVOp->getMask().end());
11229 unsigned NumHi = 0;
11230 unsigned NumLo = 0;
11231 for (unsigned i = 0; i != 4; ++i) {
11232 int Idx = PermMask[i];
11234 Locs[i] = std::make_pair(-1, -1);
11236 assert(Idx < 8 && "Invalid VECTOR_SHUFFLE index!");
11238 Locs[i] = std::make_pair(0, NumLo);
11239 Mask1[NumLo] = Idx;
11242 Locs[i] = std::make_pair(1, NumHi);
11244 Mask1[2+NumHi] = Idx;
11250 if (NumLo <= 2 && NumHi <= 2) {
11251 // If no more than two elements come from either vector. This can be
11252 // implemented with two shuffles. First shuffle gather the elements.
11253 // The second shuffle, which takes the first shuffle as both of its
11254 // vector operands, put the elements into the right order.
11255 V1 = DAG.getVectorShuffle(VT, dl, V1, V2, &Mask1[0]);
11257 int Mask2[] = { -1, -1, -1, -1 };
11259 for (unsigned i = 0; i != 4; ++i)
11260 if (Locs[i].first != -1) {
11261 unsigned Idx = (i < 2) ? 0 : 4;
11262 Idx += Locs[i].first * 2 + Locs[i].second;
11266 return DAG.getVectorShuffle(VT, dl, V1, V1, &Mask2[0]);
11269 if (NumLo == 3 || NumHi == 3) {
11270 // Otherwise, we must have three elements from one vector, call it X, and
11271 // one element from the other, call it Y. First, use a shufps to build an
11272 // intermediate vector with the one element from Y and the element from X
11273 // that will be in the same half in the final destination (the indexes don't
11274 // matter). Then, use a shufps to build the final vector, taking the half
11275 // containing the element from Y from the intermediate, and the other half
11278 // Normalize it so the 3 elements come from V1.
11279 CommuteVectorShuffleMask(PermMask, 4);
11283 // Find the element from V2.
11285 for (HiIndex = 0; HiIndex < 3; ++HiIndex) {
11286 int Val = PermMask[HiIndex];
11293 Mask1[0] = PermMask[HiIndex];
11295 Mask1[2] = PermMask[HiIndex^1];
11297 V2 = DAG.getVectorShuffle(VT, dl, V1, V2, &Mask1[0]);
11299 if (HiIndex >= 2) {
11300 Mask1[0] = PermMask[0];
11301 Mask1[1] = PermMask[1];
11302 Mask1[2] = HiIndex & 1 ? 6 : 4;
11303 Mask1[3] = HiIndex & 1 ? 4 : 6;
11304 return DAG.getVectorShuffle(VT, dl, V1, V2, &Mask1[0]);
11307 Mask1[0] = HiIndex & 1 ? 2 : 0;
11308 Mask1[1] = HiIndex & 1 ? 0 : 2;
11309 Mask1[2] = PermMask[2];
11310 Mask1[3] = PermMask[3];
11315 return DAG.getVectorShuffle(VT, dl, V2, V1, &Mask1[0]);
11318 // Break it into (shuffle shuffle_hi, shuffle_lo).
11319 int LoMask[] = { -1, -1, -1, -1 };
11320 int HiMask[] = { -1, -1, -1, -1 };
11322 int *MaskPtr = LoMask;
11323 unsigned MaskIdx = 0;
11324 unsigned LoIdx = 0;
11325 unsigned HiIdx = 2;
11326 for (unsigned i = 0; i != 4; ++i) {
11333 int Idx = PermMask[i];
11335 Locs[i] = std::make_pair(-1, -1);
11336 } else if (Idx < 4) {
11337 Locs[i] = std::make_pair(MaskIdx, LoIdx);
11338 MaskPtr[LoIdx] = Idx;
11341 Locs[i] = std::make_pair(MaskIdx, HiIdx);
11342 MaskPtr[HiIdx] = Idx;
11347 SDValue LoShuffle = DAG.getVectorShuffle(VT, dl, V1, V2, &LoMask[0]);
11348 SDValue HiShuffle = DAG.getVectorShuffle(VT, dl, V1, V2, &HiMask[0]);
11349 int MaskOps[] = { -1, -1, -1, -1 };
11350 for (unsigned i = 0; i != 4; ++i)
11351 if (Locs[i].first != -1)
11352 MaskOps[i] = Locs[i].first * 4 + Locs[i].second;
11353 return DAG.getVectorShuffle(VT, dl, LoShuffle, HiShuffle, &MaskOps[0]);
11356 static bool MayFoldVectorLoad(SDValue V) {
11357 while (V.hasOneUse() && V.getOpcode() == ISD::BITCAST)
11358 V = V.getOperand(0);
11360 if (V.hasOneUse() && V.getOpcode() == ISD::SCALAR_TO_VECTOR)
11361 V = V.getOperand(0);
11362 if (V.hasOneUse() && V.getOpcode() == ISD::BUILD_VECTOR &&
11363 V.getNumOperands() == 2 && V.getOperand(1).getOpcode() == ISD::UNDEF)
11364 // BUILD_VECTOR (load), undef
11365 V = V.getOperand(0);
11367 return MayFoldLoad(V);
11371 SDValue getMOVDDup(SDValue &Op, SDLoc &dl, SDValue V1, SelectionDAG &DAG) {
11372 MVT VT = Op.getSimpleValueType();
11374 // Canonizalize to v2f64.
11375 V1 = DAG.getNode(ISD::BITCAST, dl, MVT::v2f64, V1);
11376 return DAG.getNode(ISD::BITCAST, dl, VT,
11377 getTargetShuffleNode(X86ISD::MOVDDUP, dl, MVT::v2f64,
11382 SDValue getMOVLowToHigh(SDValue &Op, SDLoc &dl, SelectionDAG &DAG,
11384 SDValue V1 = Op.getOperand(0);
11385 SDValue V2 = Op.getOperand(1);
11386 MVT VT = Op.getSimpleValueType();
11388 assert(VT != MVT::v2i64 && "unsupported shuffle type");
11390 if (HasSSE2 && VT == MVT::v2f64)
11391 return getTargetShuffleNode(X86ISD::MOVLHPD, dl, VT, V1, V2, DAG);
11393 // v4f32 or v4i32: canonizalized to v4f32 (which is legal for SSE1)
11394 return DAG.getNode(ISD::BITCAST, dl, VT,
11395 getTargetShuffleNode(X86ISD::MOVLHPS, dl, MVT::v4f32,
11396 DAG.getNode(ISD::BITCAST, dl, MVT::v4f32, V1),
11397 DAG.getNode(ISD::BITCAST, dl, MVT::v4f32, V2), DAG));
11401 SDValue getMOVHighToLow(SDValue &Op, SDLoc &dl, SelectionDAG &DAG) {
11402 SDValue V1 = Op.getOperand(0);
11403 SDValue V2 = Op.getOperand(1);
11404 MVT VT = Op.getSimpleValueType();
11406 assert((VT == MVT::v4i32 || VT == MVT::v4f32) &&
11407 "unsupported shuffle type");
11409 if (V2.getOpcode() == ISD::UNDEF)
11413 return getTargetShuffleNode(X86ISD::MOVHLPS, dl, VT, V1, V2, DAG);
11417 SDValue getMOVLP(SDValue &Op, SDLoc &dl, SelectionDAG &DAG, bool HasSSE2) {
11418 SDValue V1 = Op.getOperand(0);
11419 SDValue V2 = Op.getOperand(1);
11420 MVT VT = Op.getSimpleValueType();
11421 unsigned NumElems = VT.getVectorNumElements();
11423 // Use MOVLPS and MOVLPD in case V1 or V2 are loads. During isel, the second
11424 // operand of these instructions is only memory, so check if there's a
11425 // potencial load folding here, otherwise use SHUFPS or MOVSD to match the
11427 bool CanFoldLoad = false;
11429 // Trivial case, when V2 comes from a load.
11430 if (MayFoldVectorLoad(V2))
11431 CanFoldLoad = true;
11433 // When V1 is a load, it can be folded later into a store in isel, example:
11434 // (store (v4f32 (X86Movlps (load addr:$src1), VR128:$src2)), addr:$src1)
11436 // (MOVLPSmr addr:$src1, VR128:$src2)
11437 // So, recognize this potential and also use MOVLPS or MOVLPD
11438 else if (MayFoldVectorLoad(V1) && MayFoldIntoStore(Op))
11439 CanFoldLoad = true;
11441 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
11443 if (HasSSE2 && NumElems == 2)
11444 return getTargetShuffleNode(X86ISD::MOVLPD, dl, VT, V1, V2, DAG);
11447 // If we don't care about the second element, proceed to use movss.
11448 if (SVOp->getMaskElt(1) != -1)
11449 return getTargetShuffleNode(X86ISD::MOVLPS, dl, VT, V1, V2, DAG);
11452 // movl and movlp will both match v2i64, but v2i64 is never matched by
11453 // movl earlier because we make it strict to avoid messing with the movlp load
11454 // folding logic (see the code above getMOVLP call). Match it here then,
11455 // this is horrible, but will stay like this until we move all shuffle
11456 // matching to x86 specific nodes. Note that for the 1st condition all
11457 // types are matched with movsd.
11459 // FIXME: isMOVLMask should be checked and matched before getMOVLP,
11460 // as to remove this logic from here, as much as possible
11461 if (NumElems == 2 || !isMOVLMask(SVOp->getMask(), VT))
11462 return getTargetShuffleNode(X86ISD::MOVSD, dl, VT, V1, V2, DAG);
11463 return getTargetShuffleNode(X86ISD::MOVSS, dl, VT, V1, V2, DAG);
11466 assert(VT != MVT::v4i32 && "unsupported shuffle type");
11468 // Invert the operand order and use SHUFPS to match it.
11469 return getTargetShuffleNode(X86ISD::SHUFP, dl, VT, V2, V1,
11470 getShuffleSHUFImmediate(SVOp), DAG);
11473 static SDValue NarrowVectorLoadToElement(LoadSDNode *Load, unsigned Index,
11474 SelectionDAG &DAG) {
11476 MVT VT = Load->getSimpleValueType(0);
11477 MVT EVT = VT.getVectorElementType();
11478 SDValue Addr = Load->getOperand(1);
11479 SDValue NewAddr = DAG.getNode(
11480 ISD::ADD, dl, Addr.getSimpleValueType(), Addr,
11481 DAG.getConstant(Index * EVT.getStoreSize(), Addr.getSimpleValueType()));
11484 DAG.getLoad(EVT, dl, Load->getChain(), NewAddr,
11485 DAG.getMachineFunction().getMachineMemOperand(
11486 Load->getMemOperand(), 0, EVT.getStoreSize()));
11490 // It is only safe to call this function if isINSERTPSMask is true for
11491 // this shufflevector mask.
11492 static SDValue getINSERTPS(ShuffleVectorSDNode *SVOp, SDLoc &dl,
11493 SelectionDAG &DAG) {
11494 // Generate an insertps instruction when inserting an f32 from memory onto a
11495 // v4f32 or when copying a member from one v4f32 to another.
11496 // We also use it for transferring i32 from one register to another,
11497 // since it simply copies the same bits.
11498 // If we're transferring an i32 from memory to a specific element in a
11499 // register, we output a generic DAG that will match the PINSRD
11501 MVT VT = SVOp->getSimpleValueType(0);
11502 MVT EVT = VT.getVectorElementType();
11503 SDValue V1 = SVOp->getOperand(0);
11504 SDValue V2 = SVOp->getOperand(1);
11505 auto Mask = SVOp->getMask();
11506 assert((VT == MVT::v4f32 || VT == MVT::v4i32) &&
11507 "unsupported vector type for insertps/pinsrd");
11509 auto FromV1Predicate = [](const int &i) { return i < 4 && i > -1; };
11510 auto FromV2Predicate = [](const int &i) { return i >= 4; };
11511 int FromV1 = std::count_if(Mask.begin(), Mask.end(), FromV1Predicate);
11515 unsigned DestIndex;
11519 DestIndex = std::find_if(Mask.begin(), Mask.end(), FromV1Predicate) -
11522 // If we have 1 element from each vector, we have to check if we're
11523 // changing V1's element's place. If so, we're done. Otherwise, we
11524 // should assume we're changing V2's element's place and behave
11526 int FromV2 = std::count_if(Mask.begin(), Mask.end(), FromV2Predicate);
11527 assert(DestIndex <= INT32_MAX && "truncated destination index");
11528 if (FromV1 == FromV2 &&
11529 static_cast<int>(DestIndex) == Mask[DestIndex] % 4) {
11533 std::find_if(Mask.begin(), Mask.end(), FromV2Predicate) - Mask.begin();
11536 assert(std::count_if(Mask.begin(), Mask.end(), FromV2Predicate) == 1 &&
11537 "More than one element from V1 and from V2, or no elements from one "
11538 "of the vectors. This case should not have returned true from "
11543 std::find_if(Mask.begin(), Mask.end(), FromV2Predicate) - Mask.begin();
11546 // Get an index into the source vector in the range [0,4) (the mask is
11547 // in the range [0,8) because it can address V1 and V2)
11548 unsigned SrcIndex = Mask[DestIndex] % 4;
11549 if (MayFoldLoad(From)) {
11550 // Trivial case, when From comes from a load and is only used by the
11551 // shuffle. Make it use insertps from the vector that we need from that
11554 NarrowVectorLoadToElement(cast<LoadSDNode>(From), SrcIndex, DAG);
11555 if (!NewLoad.getNode())
11558 if (EVT == MVT::f32) {
11559 // Create this as a scalar to vector to match the instruction pattern.
11560 SDValue LoadScalarToVector =
11561 DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VT, NewLoad);
11562 SDValue InsertpsMask = DAG.getIntPtrConstant(DestIndex << 4);
11563 return DAG.getNode(X86ISD::INSERTPS, dl, VT, To, LoadScalarToVector,
11565 } else { // EVT == MVT::i32
11566 // If we're getting an i32 from memory, use an INSERT_VECTOR_ELT
11567 // instruction, to match the PINSRD instruction, which loads an i32 to a
11568 // certain vector element.
11569 return DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, VT, To, NewLoad,
11570 DAG.getConstant(DestIndex, MVT::i32));
11574 // Vector-element-to-vector
11575 SDValue InsertpsMask = DAG.getIntPtrConstant(DestIndex << 4 | SrcIndex << 6);
11576 return DAG.getNode(X86ISD::INSERTPS, dl, VT, To, From, InsertpsMask);
11579 // Reduce a vector shuffle to zext.
11580 static SDValue LowerVectorIntExtend(SDValue Op, const X86Subtarget *Subtarget,
11581 SelectionDAG &DAG) {
11582 // PMOVZX is only available from SSE41.
11583 if (!Subtarget->hasSSE41())
11586 MVT VT = Op.getSimpleValueType();
11588 // Only AVX2 support 256-bit vector integer extending.
11589 if (!Subtarget->hasInt256() && VT.is256BitVector())
11592 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
11594 SDValue V1 = Op.getOperand(0);
11595 SDValue V2 = Op.getOperand(1);
11596 unsigned NumElems = VT.getVectorNumElements();
11598 // Extending is an unary operation and the element type of the source vector
11599 // won't be equal to or larger than i64.
11600 if (V2.getOpcode() != ISD::UNDEF || !VT.isInteger() ||
11601 VT.getVectorElementType() == MVT::i64)
11604 // Find the expansion ratio, e.g. expanding from i8 to i32 has a ratio of 4.
11605 unsigned Shift = 1; // Start from 2, i.e. 1 << 1.
11606 while ((1U << Shift) < NumElems) {
11607 if (SVOp->getMaskElt(1U << Shift) == 1)
11610 // The maximal ratio is 8, i.e. from i8 to i64.
11615 // Check the shuffle mask.
11616 unsigned Mask = (1U << Shift) - 1;
11617 for (unsigned i = 0; i != NumElems; ++i) {
11618 int EltIdx = SVOp->getMaskElt(i);
11619 if ((i & Mask) != 0 && EltIdx != -1)
11621 if ((i & Mask) == 0 && (unsigned)EltIdx != (i >> Shift))
11625 unsigned NBits = VT.getVectorElementType().getSizeInBits() << Shift;
11626 MVT NeVT = MVT::getIntegerVT(NBits);
11627 MVT NVT = MVT::getVectorVT(NeVT, NumElems >> Shift);
11629 if (!DAG.getTargetLoweringInfo().isTypeLegal(NVT))
11632 return DAG.getNode(ISD::BITCAST, DL, VT,
11633 DAG.getNode(X86ISD::VZEXT, DL, NVT, V1));
11636 static SDValue NormalizeVectorShuffle(SDValue Op, const X86Subtarget *Subtarget,
11637 SelectionDAG &DAG) {
11638 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
11639 MVT VT = Op.getSimpleValueType();
11641 SDValue V1 = Op.getOperand(0);
11642 SDValue V2 = Op.getOperand(1);
11644 if (isZeroShuffle(SVOp))
11645 return getZeroVector(VT, Subtarget, DAG, dl);
11647 // Handle splat operations
11648 if (SVOp->isSplat()) {
11649 // Use vbroadcast whenever the splat comes from a foldable load
11650 SDValue Broadcast = LowerVectorBroadcast(Op, Subtarget, DAG);
11651 if (Broadcast.getNode())
11655 // Check integer expanding shuffles.
11656 SDValue NewOp = LowerVectorIntExtend(Op, Subtarget, DAG);
11657 if (NewOp.getNode())
11660 // If the shuffle can be profitably rewritten as a narrower shuffle, then
11662 if (VT == MVT::v8i16 || VT == MVT::v16i8 || VT == MVT::v16i16 ||
11663 VT == MVT::v32i8) {
11664 SDValue NewOp = RewriteAsNarrowerShuffle(SVOp, DAG);
11665 if (NewOp.getNode())
11666 return DAG.getNode(ISD::BITCAST, dl, VT, NewOp);
11667 } else if (VT.is128BitVector() && Subtarget->hasSSE2()) {
11668 // FIXME: Figure out a cleaner way to do this.
11669 if (ISD::isBuildVectorAllZeros(V2.getNode())) {
11670 SDValue NewOp = RewriteAsNarrowerShuffle(SVOp, DAG);
11671 if (NewOp.getNode()) {
11672 MVT NewVT = NewOp.getSimpleValueType();
11673 if (isCommutedMOVLMask(cast<ShuffleVectorSDNode>(NewOp)->getMask(),
11674 NewVT, true, false))
11675 return getVZextMovL(VT, NewVT, NewOp.getOperand(0), DAG, Subtarget,
11678 } else if (ISD::isBuildVectorAllZeros(V1.getNode())) {
11679 SDValue NewOp = RewriteAsNarrowerShuffle(SVOp, DAG);
11680 if (NewOp.getNode()) {
11681 MVT NewVT = NewOp.getSimpleValueType();
11682 if (isMOVLMask(cast<ShuffleVectorSDNode>(NewOp)->getMask(), NewVT))
11683 return getVZextMovL(VT, NewVT, NewOp.getOperand(1), DAG, Subtarget,
11692 X86TargetLowering::LowerVECTOR_SHUFFLE(SDValue Op, SelectionDAG &DAG) const {
11693 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
11694 SDValue V1 = Op.getOperand(0);
11695 SDValue V2 = Op.getOperand(1);
11696 MVT VT = Op.getSimpleValueType();
11698 unsigned NumElems = VT.getVectorNumElements();
11699 bool V1IsUndef = V1.getOpcode() == ISD::UNDEF;
11700 bool V2IsUndef = V2.getOpcode() == ISD::UNDEF;
11701 bool V1IsSplat = false;
11702 bool V2IsSplat = false;
11703 bool HasSSE2 = Subtarget->hasSSE2();
11704 bool HasFp256 = Subtarget->hasFp256();
11705 bool HasInt256 = Subtarget->hasInt256();
11706 MachineFunction &MF = DAG.getMachineFunction();
11707 bool OptForSize = MF.getFunction()->getAttributes().
11708 hasAttribute(AttributeSet::FunctionIndex, Attribute::OptimizeForSize);
11710 // Check if we should use the experimental vector shuffle lowering. If so,
11711 // delegate completely to that code path.
11712 if (ExperimentalVectorShuffleLowering)
11713 return lowerVectorShuffle(Op, Subtarget, DAG);
11715 assert(VT.getSizeInBits() != 64 && "Can't lower MMX shuffles");
11717 if (V1IsUndef && V2IsUndef)
11718 return DAG.getUNDEF(VT);
11720 // When we create a shuffle node we put the UNDEF node to second operand,
11721 // but in some cases the first operand may be transformed to UNDEF.
11722 // In this case we should just commute the node.
11724 return DAG.getCommutedVectorShuffle(*SVOp);
11726 // Vector shuffle lowering takes 3 steps:
11728 // 1) Normalize the input vectors. Here splats, zeroed vectors, profitable
11729 // narrowing and commutation of operands should be handled.
11730 // 2) Matching of shuffles with known shuffle masks to x86 target specific
11732 // 3) Rewriting of unmatched masks into new generic shuffle operations,
11733 // so the shuffle can be broken into other shuffles and the legalizer can
11734 // try the lowering again.
11736 // The general idea is that no vector_shuffle operation should be left to
11737 // be matched during isel, all of them must be converted to a target specific
11740 // Normalize the input vectors. Here splats, zeroed vectors, profitable
11741 // narrowing and commutation of operands should be handled. The actual code
11742 // doesn't include all of those, work in progress...
11743 SDValue NewOp = NormalizeVectorShuffle(Op, Subtarget, DAG);
11744 if (NewOp.getNode())
11747 SmallVector<int, 8> M(SVOp->getMask().begin(), SVOp->getMask().end());
11749 // NOTE: isPSHUFDMask can also match both masks below (unpckl_undef and
11750 // unpckh_undef). Only use pshufd if speed is more important than size.
11751 if (OptForSize && isUNPCKL_v_undef_Mask(M, VT, HasInt256))
11752 return getTargetShuffleNode(X86ISD::UNPCKL, dl, VT, V1, V1, DAG);
11753 if (OptForSize && isUNPCKH_v_undef_Mask(M, VT, HasInt256))
11754 return getTargetShuffleNode(X86ISD::UNPCKH, dl, VT, V1, V1, DAG);
11756 if (isMOVDDUPMask(M, VT) && Subtarget->hasSSE3() &&
11757 V2IsUndef && MayFoldVectorLoad(V1))
11758 return getMOVDDup(Op, dl, V1, DAG);
11760 if (isMOVHLPS_v_undef_Mask(M, VT))
11761 return getMOVHighToLow(Op, dl, DAG);
11763 // Use to match splats
11764 if (HasSSE2 && isUNPCKHMask(M, VT, HasInt256) && V2IsUndef &&
11765 (VT == MVT::v2f64 || VT == MVT::v2i64))
11766 return getTargetShuffleNode(X86ISD::UNPCKH, dl, VT, V1, V1, DAG);
11768 if (isPSHUFDMask(M, VT)) {
11769 // The actual implementation will match the mask in the if above and then
11770 // during isel it can match several different instructions, not only pshufd
11771 // as its name says, sad but true, emulate the behavior for now...
11772 if (isMOVDDUPMask(M, VT) && ((VT == MVT::v4f32 || VT == MVT::v2i64)))
11773 return getTargetShuffleNode(X86ISD::MOVLHPS, dl, VT, V1, V1, DAG);
11775 unsigned TargetMask = getShuffleSHUFImmediate(SVOp);
11777 if (HasSSE2 && (VT == MVT::v4f32 || VT == MVT::v4i32))
11778 return getTargetShuffleNode(X86ISD::PSHUFD, dl, VT, V1, TargetMask, DAG);
11780 if (HasFp256 && (VT == MVT::v4f32 || VT == MVT::v2f64))
11781 return getTargetShuffleNode(X86ISD::VPERMILPI, dl, VT, V1, TargetMask,
11784 return getTargetShuffleNode(X86ISD::SHUFP, dl, VT, V1, V1,
11788 if (isPALIGNRMask(M, VT, Subtarget))
11789 return getTargetShuffleNode(X86ISD::PALIGNR, dl, VT, V1, V2,
11790 getShufflePALIGNRImmediate(SVOp),
11793 if (isVALIGNMask(M, VT, Subtarget))
11794 return getTargetShuffleNode(X86ISD::VALIGN, dl, VT, V1, V2,
11795 getShuffleVALIGNImmediate(SVOp),
11798 // Check if this can be converted into a logical shift.
11799 bool isLeft = false;
11800 unsigned ShAmt = 0;
11802 bool isShift = HasSSE2 && isVectorShift(SVOp, DAG, isLeft, ShVal, ShAmt);
11803 if (isShift && ShVal.hasOneUse()) {
11804 // If the shifted value has multiple uses, it may be cheaper to use
11805 // v_set0 + movlhps or movhlps, etc.
11806 MVT EltVT = VT.getVectorElementType();
11807 ShAmt *= EltVT.getSizeInBits();
11808 return getVShift(isLeft, VT, ShVal, ShAmt, DAG, *this, dl);
11811 if (isMOVLMask(M, VT)) {
11812 if (ISD::isBuildVectorAllZeros(V1.getNode()))
11813 return getVZextMovL(VT, VT, V2, DAG, Subtarget, dl);
11814 if (!isMOVLPMask(M, VT)) {
11815 if (HasSSE2 && (VT == MVT::v2i64 || VT == MVT::v2f64))
11816 return getTargetShuffleNode(X86ISD::MOVSD, dl, VT, V1, V2, DAG);
11818 if (VT == MVT::v4i32 || VT == MVT::v4f32)
11819 return getTargetShuffleNode(X86ISD::MOVSS, dl, VT, V1, V2, DAG);
11823 // FIXME: fold these into legal mask.
11824 if (isMOVLHPSMask(M, VT) && !isUNPCKLMask(M, VT, HasInt256))
11825 return getMOVLowToHigh(Op, dl, DAG, HasSSE2);
11827 if (isMOVHLPSMask(M, VT))
11828 return getMOVHighToLow(Op, dl, DAG);
11830 if (V2IsUndef && isMOVSHDUPMask(M, VT, Subtarget))
11831 return getTargetShuffleNode(X86ISD::MOVSHDUP, dl, VT, V1, DAG);
11833 if (V2IsUndef && isMOVSLDUPMask(M, VT, Subtarget))
11834 return getTargetShuffleNode(X86ISD::MOVSLDUP, dl, VT, V1, DAG);
11836 if (isMOVLPMask(M, VT))
11837 return getMOVLP(Op, dl, DAG, HasSSE2);
11839 if (ShouldXformToMOVHLPS(M, VT) ||
11840 ShouldXformToMOVLP(V1.getNode(), V2.getNode(), M, VT))
11841 return DAG.getCommutedVectorShuffle(*SVOp);
11844 // No better options. Use a vshldq / vsrldq.
11845 MVT EltVT = VT.getVectorElementType();
11846 ShAmt *= EltVT.getSizeInBits();
11847 return getVShift(isLeft, VT, ShVal, ShAmt, DAG, *this, dl);
11850 bool Commuted = false;
11851 // FIXME: This should also accept a bitcast of a splat? Be careful, not
11852 // 1,1,1,1 -> v8i16 though.
11853 BitVector UndefElements;
11854 if (auto *BVOp = dyn_cast<BuildVectorSDNode>(V1.getNode()))
11855 if (BVOp->getConstantSplatNode(&UndefElements) && UndefElements.none())
11857 if (auto *BVOp = dyn_cast<BuildVectorSDNode>(V2.getNode()))
11858 if (BVOp->getConstantSplatNode(&UndefElements) && UndefElements.none())
11861 // Canonicalize the splat or undef, if present, to be on the RHS.
11862 if (!V2IsUndef && V1IsSplat && !V2IsSplat) {
11863 CommuteVectorShuffleMask(M, NumElems);
11865 std::swap(V1IsSplat, V2IsSplat);
11869 if (isCommutedMOVLMask(M, VT, V2IsSplat, V2IsUndef)) {
11870 // Shuffling low element of v1 into undef, just return v1.
11873 // If V2 is a splat, the mask may be malformed such as <4,3,3,3>, which
11874 // the instruction selector will not match, so get a canonical MOVL with
11875 // swapped operands to undo the commute.
11876 return getMOVL(DAG, dl, VT, V2, V1);
11879 if (isUNPCKLMask(M, VT, HasInt256))
11880 return getTargetShuffleNode(X86ISD::UNPCKL, dl, VT, V1, V2, DAG);
11882 if (isUNPCKHMask(M, VT, HasInt256))
11883 return getTargetShuffleNode(X86ISD::UNPCKH, dl, VT, V1, V2, DAG);
11886 // Normalize mask so all entries that point to V2 points to its first
11887 // element then try to match unpck{h|l} again. If match, return a
11888 // new vector_shuffle with the corrected mask.p
11889 SmallVector<int, 8> NewMask(M.begin(), M.end());
11890 NormalizeMask(NewMask, NumElems);
11891 if (isUNPCKLMask(NewMask, VT, HasInt256, true))
11892 return getTargetShuffleNode(X86ISD::UNPCKL, dl, VT, V1, V2, DAG);
11893 if (isUNPCKHMask(NewMask, VT, HasInt256, true))
11894 return getTargetShuffleNode(X86ISD::UNPCKH, dl, VT, V1, V2, DAG);
11898 // Commute is back and try unpck* again.
11899 // FIXME: this seems wrong.
11900 CommuteVectorShuffleMask(M, NumElems);
11902 std::swap(V1IsSplat, V2IsSplat);
11904 if (isUNPCKLMask(M, VT, HasInt256))
11905 return getTargetShuffleNode(X86ISD::UNPCKL, dl, VT, V1, V2, DAG);
11907 if (isUNPCKHMask(M, VT, HasInt256))
11908 return getTargetShuffleNode(X86ISD::UNPCKH, dl, VT, V1, V2, DAG);
11911 // Normalize the node to match x86 shuffle ops if needed
11912 if (!V2IsUndef && (isSHUFPMask(M, VT, /* Commuted */ true)))
11913 return DAG.getCommutedVectorShuffle(*SVOp);
11915 // The checks below are all present in isShuffleMaskLegal, but they are
11916 // inlined here right now to enable us to directly emit target specific
11917 // nodes, and remove one by one until they don't return Op anymore.
11919 if (ShuffleVectorSDNode::isSplatMask(&M[0], VT) &&
11920 SVOp->getSplatIndex() == 0 && V2IsUndef) {
11921 if (VT == MVT::v2f64 || VT == MVT::v2i64)
11922 return getTargetShuffleNode(X86ISD::UNPCKL, dl, VT, V1, V1, DAG);
11925 if (isPSHUFHWMask(M, VT, HasInt256))
11926 return getTargetShuffleNode(X86ISD::PSHUFHW, dl, VT, V1,
11927 getShufflePSHUFHWImmediate(SVOp),
11930 if (isPSHUFLWMask(M, VT, HasInt256))
11931 return getTargetShuffleNode(X86ISD::PSHUFLW, dl, VT, V1,
11932 getShufflePSHUFLWImmediate(SVOp),
11935 unsigned MaskValue;
11936 if (isBlendMask(M, VT, Subtarget->hasSSE41(), Subtarget->hasInt256(),
11938 return LowerVECTOR_SHUFFLEtoBlend(SVOp, MaskValue, Subtarget, DAG);
11940 if (isSHUFPMask(M, VT))
11941 return getTargetShuffleNode(X86ISD::SHUFP, dl, VT, V1, V2,
11942 getShuffleSHUFImmediate(SVOp), DAG);
11944 if (isUNPCKL_v_undef_Mask(M, VT, HasInt256))
11945 return getTargetShuffleNode(X86ISD::UNPCKL, dl, VT, V1, V1, DAG);
11946 if (isUNPCKH_v_undef_Mask(M, VT, HasInt256))
11947 return getTargetShuffleNode(X86ISD::UNPCKH, dl, VT, V1, V1, DAG);
11949 //===--------------------------------------------------------------------===//
11950 // Generate target specific nodes for 128 or 256-bit shuffles only
11951 // supported in the AVX instruction set.
11954 // Handle VMOVDDUPY permutations
11955 if (V2IsUndef && isMOVDDUPYMask(M, VT, HasFp256))
11956 return getTargetShuffleNode(X86ISD::MOVDDUP, dl, VT, V1, DAG);
11958 // Handle VPERMILPS/D* permutations
11959 if (isVPERMILPMask(M, VT)) {
11960 if ((HasInt256 && VT == MVT::v8i32) || VT == MVT::v16i32)
11961 return getTargetShuffleNode(X86ISD::PSHUFD, dl, VT, V1,
11962 getShuffleSHUFImmediate(SVOp), DAG);
11963 return getTargetShuffleNode(X86ISD::VPERMILPI, dl, VT, V1,
11964 getShuffleSHUFImmediate(SVOp), DAG);
11968 if (VT.is512BitVector() && isINSERT64x4Mask(M, VT, &Idx))
11969 return Insert256BitVector(V1, Extract256BitVector(V2, 0, DAG, dl),
11970 Idx*(NumElems/2), DAG, dl);
11972 // Handle VPERM2F128/VPERM2I128 permutations
11973 if (isVPERM2X128Mask(M, VT, HasFp256))
11974 return getTargetShuffleNode(X86ISD::VPERM2X128, dl, VT, V1,
11975 V2, getShuffleVPERM2X128Immediate(SVOp), DAG);
11977 if (Subtarget->hasSSE41() && isINSERTPSMask(M, VT))
11978 return getINSERTPS(SVOp, dl, DAG);
11981 if (V2IsUndef && HasInt256 && isPermImmMask(M, VT, Imm8))
11982 return getTargetShuffleNode(X86ISD::VPERMI, dl, VT, V1, Imm8, DAG);
11984 if ((V2IsUndef && HasInt256 && VT.is256BitVector() && NumElems == 8) ||
11985 VT.is512BitVector()) {
11986 MVT MaskEltVT = MVT::getIntegerVT(VT.getVectorElementType().getSizeInBits());
11987 MVT MaskVectorVT = MVT::getVectorVT(MaskEltVT, NumElems);
11988 SmallVector<SDValue, 16> permclMask;
11989 for (unsigned i = 0; i != NumElems; ++i) {
11990 permclMask.push_back(DAG.getConstant((M[i]>=0) ? M[i] : 0, MaskEltVT));
11993 SDValue Mask = DAG.getNode(ISD::BUILD_VECTOR, dl, MaskVectorVT, permclMask);
11995 // Bitcast is for VPERMPS since mask is v8i32 but node takes v8f32
11996 return DAG.getNode(X86ISD::VPERMV, dl, VT,
11997 DAG.getNode(ISD::BITCAST, dl, VT, Mask), V1);
11998 return DAG.getNode(X86ISD::VPERMV3, dl, VT, V1,
11999 DAG.getNode(ISD::BITCAST, dl, VT, Mask), V2);
12002 //===--------------------------------------------------------------------===//
12003 // Since no target specific shuffle was selected for this generic one,
12004 // lower it into other known shuffles. FIXME: this isn't true yet, but
12005 // this is the plan.
12008 // Handle v8i16 specifically since SSE can do byte extraction and insertion.
12009 if (VT == MVT::v8i16) {
12010 SDValue NewOp = LowerVECTOR_SHUFFLEv8i16(Op, Subtarget, DAG);
12011 if (NewOp.getNode())
12015 if (VT == MVT::v16i16 && Subtarget->hasInt256()) {
12016 SDValue NewOp = LowerVECTOR_SHUFFLEv16i16(Op, DAG);
12017 if (NewOp.getNode())
12021 if (VT == MVT::v16i8) {
12022 SDValue NewOp = LowerVECTOR_SHUFFLEv16i8(SVOp, Subtarget, DAG);
12023 if (NewOp.getNode())
12027 if (VT == MVT::v32i8) {
12028 SDValue NewOp = LowerVECTOR_SHUFFLEv32i8(SVOp, Subtarget, DAG);
12029 if (NewOp.getNode())
12033 // Handle all 128-bit wide vectors with 4 elements, and match them with
12034 // several different shuffle types.
12035 if (NumElems == 4 && VT.is128BitVector())
12036 return LowerVECTOR_SHUFFLE_128v4(SVOp, DAG);
12038 // Handle general 256-bit shuffles
12039 if (VT.is256BitVector())
12040 return LowerVECTOR_SHUFFLE_256(SVOp, DAG);
12045 // This function assumes its argument is a BUILD_VECTOR of constants or
12046 // undef SDNodes. i.e: ISD::isBuildVectorOfConstantSDNodes(BuildVector) is
12048 static bool BUILD_VECTORtoBlendMask(BuildVectorSDNode *BuildVector,
12049 unsigned &MaskValue) {
12051 unsigned NumElems = BuildVector->getNumOperands();
12052 // There are 2 lanes if (NumElems > 8), and 1 lane otherwise.
12053 unsigned NumLanes = (NumElems - 1) / 8 + 1;
12054 unsigned NumElemsInLane = NumElems / NumLanes;
12056 // Blend for v16i16 should be symetric for the both lanes.
12057 for (unsigned i = 0; i < NumElemsInLane; ++i) {
12058 SDValue EltCond = BuildVector->getOperand(i);
12059 SDValue SndLaneEltCond =
12060 (NumLanes == 2) ? BuildVector->getOperand(i + NumElemsInLane) : EltCond;
12062 int Lane1Cond = -1, Lane2Cond = -1;
12063 if (isa<ConstantSDNode>(EltCond))
12064 Lane1Cond = !isZero(EltCond);
12065 if (isa<ConstantSDNode>(SndLaneEltCond))
12066 Lane2Cond = !isZero(SndLaneEltCond);
12068 if (Lane1Cond == Lane2Cond || Lane2Cond < 0)
12069 // Lane1Cond != 0, means we want the first argument.
12070 // Lane1Cond == 0, means we want the second argument.
12071 // The encoding of this argument is 0 for the first argument, 1
12072 // for the second. Therefore, invert the condition.
12073 MaskValue |= !Lane1Cond << i;
12074 else if (Lane1Cond < 0)
12075 MaskValue |= !Lane2Cond << i;
12082 /// \brief Try to lower a VSELECT instruction to an immediate-controlled blend
12084 static SDValue lowerVSELECTtoBLENDI(SDValue Op, const X86Subtarget *Subtarget,
12085 SelectionDAG &DAG) {
12086 SDValue Cond = Op.getOperand(0);
12087 SDValue LHS = Op.getOperand(1);
12088 SDValue RHS = Op.getOperand(2);
12090 MVT VT = Op.getSimpleValueType();
12091 MVT EltVT = VT.getVectorElementType();
12092 unsigned NumElems = VT.getVectorNumElements();
12094 // There is no blend with immediate in AVX-512.
12095 if (VT.is512BitVector())
12098 if (!Subtarget->hasSSE41() || EltVT == MVT::i8)
12100 if (!Subtarget->hasInt256() && VT == MVT::v16i16)
12103 if (!ISD::isBuildVectorOfConstantSDNodes(Cond.getNode()))
12106 // Check the mask for BLEND and build the value.
12107 unsigned MaskValue = 0;
12108 if (!BUILD_VECTORtoBlendMask(cast<BuildVectorSDNode>(Cond), MaskValue))
12111 // Convert i32 vectors to floating point if it is not AVX2.
12112 // AVX2 introduced VPBLENDD instruction for 128 and 256-bit vectors.
12114 if (EltVT == MVT::i64 || (EltVT == MVT::i32 && !Subtarget->hasInt256())) {
12115 BlendVT = MVT::getVectorVT(MVT::getFloatingPointVT(EltVT.getSizeInBits()),
12117 LHS = DAG.getNode(ISD::BITCAST, dl, VT, LHS);
12118 RHS = DAG.getNode(ISD::BITCAST, dl, VT, RHS);
12121 SDValue Ret = DAG.getNode(X86ISD::BLENDI, dl, BlendVT, LHS, RHS,
12122 DAG.getConstant(MaskValue, MVT::i32));
12123 return DAG.getNode(ISD::BITCAST, dl, VT, Ret);
12126 SDValue X86TargetLowering::LowerVSELECT(SDValue Op, SelectionDAG &DAG) const {
12127 // A vselect where all conditions and data are constants can be optimized into
12128 // a single vector load by SelectionDAGLegalize::ExpandBUILD_VECTOR().
12129 if (ISD::isBuildVectorOfConstantSDNodes(Op.getOperand(0).getNode()) &&
12130 ISD::isBuildVectorOfConstantSDNodes(Op.getOperand(1).getNode()) &&
12131 ISD::isBuildVectorOfConstantSDNodes(Op.getOperand(2).getNode()))
12134 SDValue BlendOp = lowerVSELECTtoBLENDI(Op, Subtarget, DAG);
12135 if (BlendOp.getNode())
12138 // Some types for vselect were previously set to Expand, not Legal or
12139 // Custom. Return an empty SDValue so we fall-through to Expand, after
12140 // the Custom lowering phase.
12141 MVT VT = Op.getSimpleValueType();
12142 switch (VT.SimpleTy) {
12147 if (Subtarget->hasBWI() && Subtarget->hasVLX())
12152 // We couldn't create a "Blend with immediate" node.
12153 // This node should still be legal, but we'll have to emit a blendv*
12158 static SDValue LowerEXTRACT_VECTOR_ELT_SSE4(SDValue Op, SelectionDAG &DAG) {
12159 MVT VT = Op.getSimpleValueType();
12162 if (!Op.getOperand(0).getSimpleValueType().is128BitVector())
12165 if (VT.getSizeInBits() == 8) {
12166 SDValue Extract = DAG.getNode(X86ISD::PEXTRB, dl, MVT::i32,
12167 Op.getOperand(0), Op.getOperand(1));
12168 SDValue Assert = DAG.getNode(ISD::AssertZext, dl, MVT::i32, Extract,
12169 DAG.getValueType(VT));
12170 return DAG.getNode(ISD::TRUNCATE, dl, VT, Assert);
12173 if (VT.getSizeInBits() == 16) {
12174 unsigned Idx = cast<ConstantSDNode>(Op.getOperand(1))->getZExtValue();
12175 // If Idx is 0, it's cheaper to do a move instead of a pextrw.
12177 return DAG.getNode(ISD::TRUNCATE, dl, MVT::i16,
12178 DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::i32,
12179 DAG.getNode(ISD::BITCAST, dl,
12182 Op.getOperand(1)));
12183 SDValue Extract = DAG.getNode(X86ISD::PEXTRW, dl, MVT::i32,
12184 Op.getOperand(0), Op.getOperand(1));
12185 SDValue Assert = DAG.getNode(ISD::AssertZext, dl, MVT::i32, Extract,
12186 DAG.getValueType(VT));
12187 return DAG.getNode(ISD::TRUNCATE, dl, VT, Assert);
12190 if (VT == MVT::f32) {
12191 // EXTRACTPS outputs to a GPR32 register which will require a movd to copy
12192 // the result back to FR32 register. It's only worth matching if the
12193 // result has a single use which is a store or a bitcast to i32. And in
12194 // the case of a store, it's not worth it if the index is a constant 0,
12195 // because a MOVSSmr can be used instead, which is smaller and faster.
12196 if (!Op.hasOneUse())
12198 SDNode *User = *Op.getNode()->use_begin();
12199 if ((User->getOpcode() != ISD::STORE ||
12200 (isa<ConstantSDNode>(Op.getOperand(1)) &&
12201 cast<ConstantSDNode>(Op.getOperand(1))->isNullValue())) &&
12202 (User->getOpcode() != ISD::BITCAST ||
12203 User->getValueType(0) != MVT::i32))
12205 SDValue Extract = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::i32,
12206 DAG.getNode(ISD::BITCAST, dl, MVT::v4i32,
12209 return DAG.getNode(ISD::BITCAST, dl, MVT::f32, Extract);
12212 if (VT == MVT::i32 || VT == MVT::i64) {
12213 // ExtractPS/pextrq works with constant index.
12214 if (isa<ConstantSDNode>(Op.getOperand(1)))
12220 /// Extract one bit from mask vector, like v16i1 or v8i1.
12221 /// AVX-512 feature.
12223 X86TargetLowering::ExtractBitFromMaskVector(SDValue Op, SelectionDAG &DAG) const {
12224 SDValue Vec = Op.getOperand(0);
12226 MVT VecVT = Vec.getSimpleValueType();
12227 SDValue Idx = Op.getOperand(1);
12228 MVT EltVT = Op.getSimpleValueType();
12230 assert((EltVT == MVT::i1) && "Unexpected operands in ExtractBitFromMaskVector");
12232 // variable index can't be handled in mask registers,
12233 // extend vector to VR512
12234 if (!isa<ConstantSDNode>(Idx)) {
12235 MVT ExtVT = (VecVT == MVT::v8i1 ? MVT::v8i64 : MVT::v16i32);
12236 SDValue Ext = DAG.getNode(ISD::ZERO_EXTEND, dl, ExtVT, Vec);
12237 SDValue Elt = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl,
12238 ExtVT.getVectorElementType(), Ext, Idx);
12239 return DAG.getNode(ISD::TRUNCATE, dl, EltVT, Elt);
12242 unsigned IdxVal = cast<ConstantSDNode>(Idx)->getZExtValue();
12243 const TargetRegisterClass* rc = getRegClassFor(VecVT);
12244 unsigned MaxSift = rc->getSize()*8 - 1;
12245 Vec = DAG.getNode(X86ISD::VSHLI, dl, VecVT, Vec,
12246 DAG.getConstant(MaxSift - IdxVal, MVT::i8));
12247 Vec = DAG.getNode(X86ISD::VSRLI, dl, VecVT, Vec,
12248 DAG.getConstant(MaxSift, MVT::i8));
12249 return DAG.getNode(X86ISD::VEXTRACT, dl, MVT::i1, Vec,
12250 DAG.getIntPtrConstant(0));
12254 X86TargetLowering::LowerEXTRACT_VECTOR_ELT(SDValue Op,
12255 SelectionDAG &DAG) const {
12257 SDValue Vec = Op.getOperand(0);
12258 MVT VecVT = Vec.getSimpleValueType();
12259 SDValue Idx = Op.getOperand(1);
12261 if (Op.getSimpleValueType() == MVT::i1)
12262 return ExtractBitFromMaskVector(Op, DAG);
12264 if (!isa<ConstantSDNode>(Idx)) {
12265 if (VecVT.is512BitVector() ||
12266 (VecVT.is256BitVector() && Subtarget->hasInt256() &&
12267 VecVT.getVectorElementType().getSizeInBits() == 32)) {
12270 MVT::getIntegerVT(VecVT.getVectorElementType().getSizeInBits());
12271 MVT MaskVT = MVT::getVectorVT(MaskEltVT, VecVT.getSizeInBits() /
12272 MaskEltVT.getSizeInBits());
12274 Idx = DAG.getZExtOrTrunc(Idx, dl, MaskEltVT);
12275 SDValue Mask = DAG.getNode(X86ISD::VINSERT, dl, MaskVT,
12276 getZeroVector(MaskVT, Subtarget, DAG, dl),
12277 Idx, DAG.getConstant(0, getPointerTy()));
12278 SDValue Perm = DAG.getNode(X86ISD::VPERMV, dl, VecVT, Mask, Vec);
12279 return DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, Op.getValueType(),
12280 Perm, DAG.getConstant(0, getPointerTy()));
12285 // If this is a 256-bit vector result, first extract the 128-bit vector and
12286 // then extract the element from the 128-bit vector.
12287 if (VecVT.is256BitVector() || VecVT.is512BitVector()) {
12289 unsigned IdxVal = cast<ConstantSDNode>(Idx)->getZExtValue();
12290 // Get the 128-bit vector.
12291 Vec = Extract128BitVector(Vec, IdxVal, DAG, dl);
12292 MVT EltVT = VecVT.getVectorElementType();
12294 unsigned ElemsPerChunk = 128 / EltVT.getSizeInBits();
12296 //if (IdxVal >= NumElems/2)
12297 // IdxVal -= NumElems/2;
12298 IdxVal -= (IdxVal/ElemsPerChunk)*ElemsPerChunk;
12299 return DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, Op.getValueType(), Vec,
12300 DAG.getConstant(IdxVal, MVT::i32));
12303 assert(VecVT.is128BitVector() && "Unexpected vector length");
12305 if (Subtarget->hasSSE41()) {
12306 SDValue Res = LowerEXTRACT_VECTOR_ELT_SSE4(Op, DAG);
12311 MVT VT = Op.getSimpleValueType();
12312 // TODO: handle v16i8.
12313 if (VT.getSizeInBits() == 16) {
12314 SDValue Vec = Op.getOperand(0);
12315 unsigned Idx = cast<ConstantSDNode>(Op.getOperand(1))->getZExtValue();
12317 return DAG.getNode(ISD::TRUNCATE, dl, MVT::i16,
12318 DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::i32,
12319 DAG.getNode(ISD::BITCAST, dl,
12321 Op.getOperand(1)));
12322 // Transform it so it match pextrw which produces a 32-bit result.
12323 MVT EltVT = MVT::i32;
12324 SDValue Extract = DAG.getNode(X86ISD::PEXTRW, dl, EltVT,
12325 Op.getOperand(0), Op.getOperand(1));
12326 SDValue Assert = DAG.getNode(ISD::AssertZext, dl, EltVT, Extract,
12327 DAG.getValueType(VT));
12328 return DAG.getNode(ISD::TRUNCATE, dl, VT, Assert);
12331 if (VT.getSizeInBits() == 32) {
12332 unsigned Idx = cast<ConstantSDNode>(Op.getOperand(1))->getZExtValue();
12336 // SHUFPS the element to the lowest double word, then movss.
12337 int Mask[4] = { static_cast<int>(Idx), -1, -1, -1 };
12338 MVT VVT = Op.getOperand(0).getSimpleValueType();
12339 SDValue Vec = DAG.getVectorShuffle(VVT, dl, Op.getOperand(0),
12340 DAG.getUNDEF(VVT), Mask);
12341 return DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, VT, Vec,
12342 DAG.getIntPtrConstant(0));
12345 if (VT.getSizeInBits() == 64) {
12346 // FIXME: .td only matches this for <2 x f64>, not <2 x i64> on 32b
12347 // FIXME: seems like this should be unnecessary if mov{h,l}pd were taught
12348 // to match extract_elt for f64.
12349 unsigned Idx = cast<ConstantSDNode>(Op.getOperand(1))->getZExtValue();
12353 // UNPCKHPD the element to the lowest double word, then movsd.
12354 // Note if the lower 64 bits of the result of the UNPCKHPD is then stored
12355 // to a f64mem, the whole operation is folded into a single MOVHPDmr.
12356 int Mask[2] = { 1, -1 };
12357 MVT VVT = Op.getOperand(0).getSimpleValueType();
12358 SDValue Vec = DAG.getVectorShuffle(VVT, dl, Op.getOperand(0),
12359 DAG.getUNDEF(VVT), Mask);
12360 return DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, VT, Vec,
12361 DAG.getIntPtrConstant(0));
12367 /// Insert one bit to mask vector, like v16i1 or v8i1.
12368 /// AVX-512 feature.
12370 X86TargetLowering::InsertBitToMaskVector(SDValue Op, SelectionDAG &DAG) const {
12372 SDValue Vec = Op.getOperand(0);
12373 SDValue Elt = Op.getOperand(1);
12374 SDValue Idx = Op.getOperand(2);
12375 MVT VecVT = Vec.getSimpleValueType();
12377 if (!isa<ConstantSDNode>(Idx)) {
12378 // Non constant index. Extend source and destination,
12379 // insert element and then truncate the result.
12380 MVT ExtVecVT = (VecVT == MVT::v8i1 ? MVT::v8i64 : MVT::v16i32);
12381 MVT ExtEltVT = (VecVT == MVT::v8i1 ? MVT::i64 : MVT::i32);
12382 SDValue ExtOp = DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, ExtVecVT,
12383 DAG.getNode(ISD::ZERO_EXTEND, dl, ExtVecVT, Vec),
12384 DAG.getNode(ISD::ZERO_EXTEND, dl, ExtEltVT, Elt), Idx);
12385 return DAG.getNode(ISD::TRUNCATE, dl, VecVT, ExtOp);
12388 unsigned IdxVal = cast<ConstantSDNode>(Idx)->getZExtValue();
12389 SDValue EltInVec = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VecVT, Elt);
12390 if (Vec.getOpcode() == ISD::UNDEF)
12391 return DAG.getNode(X86ISD::VSHLI, dl, VecVT, EltInVec,
12392 DAG.getConstant(IdxVal, MVT::i8));
12393 const TargetRegisterClass* rc = getRegClassFor(VecVT);
12394 unsigned MaxSift = rc->getSize()*8 - 1;
12395 EltInVec = DAG.getNode(X86ISD::VSHLI, dl, VecVT, EltInVec,
12396 DAG.getConstant(MaxSift, MVT::i8));
12397 EltInVec = DAG.getNode(X86ISD::VSRLI, dl, VecVT, EltInVec,
12398 DAG.getConstant(MaxSift - IdxVal, MVT::i8));
12399 return DAG.getNode(ISD::OR, dl, VecVT, Vec, EltInVec);
12402 SDValue X86TargetLowering::LowerINSERT_VECTOR_ELT(SDValue Op,
12403 SelectionDAG &DAG) const {
12404 MVT VT = Op.getSimpleValueType();
12405 MVT EltVT = VT.getVectorElementType();
12407 if (EltVT == MVT::i1)
12408 return InsertBitToMaskVector(Op, DAG);
12411 SDValue N0 = Op.getOperand(0);
12412 SDValue N1 = Op.getOperand(1);
12413 SDValue N2 = Op.getOperand(2);
12414 if (!isa<ConstantSDNode>(N2))
12416 auto *N2C = cast<ConstantSDNode>(N2);
12417 unsigned IdxVal = N2C->getZExtValue();
12419 // If the vector is wider than 128 bits, extract the 128-bit subvector, insert
12420 // into that, and then insert the subvector back into the result.
12421 if (VT.is256BitVector() || VT.is512BitVector()) {
12422 // Get the desired 128-bit vector half.
12423 SDValue V = Extract128BitVector(N0, IdxVal, DAG, dl);
12425 // Insert the element into the desired half.
12426 unsigned NumEltsIn128 = 128 / EltVT.getSizeInBits();
12427 unsigned IdxIn128 = IdxVal - (IdxVal / NumEltsIn128) * NumEltsIn128;
12429 V = DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, V.getValueType(), V, N1,
12430 DAG.getConstant(IdxIn128, MVT::i32));
12432 // Insert the changed part back to the 256-bit vector
12433 return Insert128BitVector(N0, V, IdxVal, DAG, dl);
12435 assert(VT.is128BitVector() && "Only 128-bit vector types should be left!");
12437 if (Subtarget->hasSSE41()) {
12438 if (EltVT.getSizeInBits() == 8 || EltVT.getSizeInBits() == 16) {
12440 if (VT == MVT::v8i16) {
12441 Opc = X86ISD::PINSRW;
12443 assert(VT == MVT::v16i8);
12444 Opc = X86ISD::PINSRB;
12447 // Transform it so it match pinsr{b,w} which expects a GR32 as its second
12449 if (N1.getValueType() != MVT::i32)
12450 N1 = DAG.getNode(ISD::ANY_EXTEND, dl, MVT::i32, N1);
12451 if (N2.getValueType() != MVT::i32)
12452 N2 = DAG.getIntPtrConstant(IdxVal);
12453 return DAG.getNode(Opc, dl, VT, N0, N1, N2);
12456 if (EltVT == MVT::f32) {
12457 // Bits [7:6] of the constant are the source select. This will always be
12458 // zero here. The DAG Combiner may combine an extract_elt index into
12460 // bits. For example (insert (extract, 3), 2) could be matched by
12462 // the '3' into bits [7:6] of X86ISD::INSERTPS.
12463 // Bits [5:4] of the constant are the destination select. This is the
12464 // value of the incoming immediate.
12465 // Bits [3:0] of the constant are the zero mask. The DAG Combiner may
12466 // combine either bitwise AND or insert of float 0.0 to set these bits.
12467 N2 = DAG.getIntPtrConstant(IdxVal << 4);
12468 // Create this as a scalar to vector..
12469 N1 = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, MVT::v4f32, N1);
12470 return DAG.getNode(X86ISD::INSERTPS, dl, VT, N0, N1, N2);
12473 if (EltVT == MVT::i32 || EltVT == MVT::i64) {
12474 // PINSR* works with constant index.
12479 if (EltVT == MVT::i8)
12482 if (EltVT.getSizeInBits() == 16) {
12483 // Transform it so it match pinsrw which expects a 16-bit value in a GR32
12484 // as its second argument.
12485 if (N1.getValueType() != MVT::i32)
12486 N1 = DAG.getNode(ISD::ANY_EXTEND, dl, MVT::i32, N1);
12487 if (N2.getValueType() != MVT::i32)
12488 N2 = DAG.getIntPtrConstant(IdxVal);
12489 return DAG.getNode(X86ISD::PINSRW, dl, VT, N0, N1, N2);
12494 static SDValue LowerSCALAR_TO_VECTOR(SDValue Op, SelectionDAG &DAG) {
12496 MVT OpVT = Op.getSimpleValueType();
12498 // If this is a 256-bit vector result, first insert into a 128-bit
12499 // vector and then insert into the 256-bit vector.
12500 if (!OpVT.is128BitVector()) {
12501 // Insert into a 128-bit vector.
12502 unsigned SizeFactor = OpVT.getSizeInBits()/128;
12503 MVT VT128 = MVT::getVectorVT(OpVT.getVectorElementType(),
12504 OpVT.getVectorNumElements() / SizeFactor);
12506 Op = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VT128, Op.getOperand(0));
12508 // Insert the 128-bit vector.
12509 return Insert128BitVector(DAG.getUNDEF(OpVT), Op, 0, DAG, dl);
12512 if (OpVT == MVT::v1i64 &&
12513 Op.getOperand(0).getValueType() == MVT::i64)
12514 return DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, MVT::v1i64, Op.getOperand(0));
12516 SDValue AnyExt = DAG.getNode(ISD::ANY_EXTEND, dl, MVT::i32, Op.getOperand(0));
12517 assert(OpVT.is128BitVector() && "Expected an SSE type!");
12518 return DAG.getNode(ISD::BITCAST, dl, OpVT,
12519 DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, MVT::v4i32,AnyExt));
12522 // Lower a node with an EXTRACT_SUBVECTOR opcode. This may result in
12523 // a simple subregister reference or explicit instructions to grab
12524 // upper bits of a vector.
12525 static SDValue LowerEXTRACT_SUBVECTOR(SDValue Op, const X86Subtarget *Subtarget,
12526 SelectionDAG &DAG) {
12528 SDValue In = Op.getOperand(0);
12529 SDValue Idx = Op.getOperand(1);
12530 unsigned IdxVal = cast<ConstantSDNode>(Idx)->getZExtValue();
12531 MVT ResVT = Op.getSimpleValueType();
12532 MVT InVT = In.getSimpleValueType();
12534 if (Subtarget->hasFp256()) {
12535 if (ResVT.is128BitVector() &&
12536 (InVT.is256BitVector() || InVT.is512BitVector()) &&
12537 isa<ConstantSDNode>(Idx)) {
12538 return Extract128BitVector(In, IdxVal, DAG, dl);
12540 if (ResVT.is256BitVector() && InVT.is512BitVector() &&
12541 isa<ConstantSDNode>(Idx)) {
12542 return Extract256BitVector(In, IdxVal, DAG, dl);
12548 // Lower a node with an INSERT_SUBVECTOR opcode. This may result in a
12549 // simple superregister reference or explicit instructions to insert
12550 // the upper bits of a vector.
12551 static SDValue LowerINSERT_SUBVECTOR(SDValue Op, const X86Subtarget *Subtarget,
12552 SelectionDAG &DAG) {
12553 if (Subtarget->hasFp256()) {
12554 SDLoc dl(Op.getNode());
12555 SDValue Vec = Op.getNode()->getOperand(0);
12556 SDValue SubVec = Op.getNode()->getOperand(1);
12557 SDValue Idx = Op.getNode()->getOperand(2);
12559 if ((Op.getNode()->getSimpleValueType(0).is256BitVector() ||
12560 Op.getNode()->getSimpleValueType(0).is512BitVector()) &&
12561 SubVec.getNode()->getSimpleValueType(0).is128BitVector() &&
12562 isa<ConstantSDNode>(Idx)) {
12563 unsigned IdxVal = cast<ConstantSDNode>(Idx)->getZExtValue();
12564 return Insert128BitVector(Vec, SubVec, IdxVal, DAG, dl);
12567 if (Op.getNode()->getSimpleValueType(0).is512BitVector() &&
12568 SubVec.getNode()->getSimpleValueType(0).is256BitVector() &&
12569 isa<ConstantSDNode>(Idx)) {
12570 unsigned IdxVal = cast<ConstantSDNode>(Idx)->getZExtValue();
12571 return Insert256BitVector(Vec, SubVec, IdxVal, DAG, dl);
12577 // ConstantPool, JumpTable, GlobalAddress, and ExternalSymbol are lowered as
12578 // their target countpart wrapped in the X86ISD::Wrapper node. Suppose N is
12579 // one of the above mentioned nodes. It has to be wrapped because otherwise
12580 // Select(N) returns N. So the raw TargetGlobalAddress nodes, etc. can only
12581 // be used to form addressing mode. These wrapped nodes will be selected
12584 X86TargetLowering::LowerConstantPool(SDValue Op, SelectionDAG &DAG) const {
12585 ConstantPoolSDNode *CP = cast<ConstantPoolSDNode>(Op);
12587 // In PIC mode (unless we're in RIPRel PIC mode) we add an offset to the
12588 // global base reg.
12589 unsigned char OpFlag = 0;
12590 unsigned WrapperKind = X86ISD::Wrapper;
12591 CodeModel::Model M = DAG.getTarget().getCodeModel();
12593 if (Subtarget->isPICStyleRIPRel() &&
12594 (M == CodeModel::Small || M == CodeModel::Kernel))
12595 WrapperKind = X86ISD::WrapperRIP;
12596 else if (Subtarget->isPICStyleGOT())
12597 OpFlag = X86II::MO_GOTOFF;
12598 else if (Subtarget->isPICStyleStubPIC())
12599 OpFlag = X86II::MO_PIC_BASE_OFFSET;
12601 SDValue Result = DAG.getTargetConstantPool(CP->getConstVal(), getPointerTy(),
12602 CP->getAlignment(),
12603 CP->getOffset(), OpFlag);
12605 Result = DAG.getNode(WrapperKind, DL, getPointerTy(), Result);
12606 // With PIC, the address is actually $g + Offset.
12608 Result = DAG.getNode(ISD::ADD, DL, getPointerTy(),
12609 DAG.getNode(X86ISD::GlobalBaseReg,
12610 SDLoc(), getPointerTy()),
12617 SDValue X86TargetLowering::LowerJumpTable(SDValue Op, SelectionDAG &DAG) const {
12618 JumpTableSDNode *JT = cast<JumpTableSDNode>(Op);
12620 // In PIC mode (unless we're in RIPRel PIC mode) we add an offset to the
12621 // global base reg.
12622 unsigned char OpFlag = 0;
12623 unsigned WrapperKind = X86ISD::Wrapper;
12624 CodeModel::Model M = DAG.getTarget().getCodeModel();
12626 if (Subtarget->isPICStyleRIPRel() &&
12627 (M == CodeModel::Small || M == CodeModel::Kernel))
12628 WrapperKind = X86ISD::WrapperRIP;
12629 else if (Subtarget->isPICStyleGOT())
12630 OpFlag = X86II::MO_GOTOFF;
12631 else if (Subtarget->isPICStyleStubPIC())
12632 OpFlag = X86II::MO_PIC_BASE_OFFSET;
12634 SDValue Result = DAG.getTargetJumpTable(JT->getIndex(), getPointerTy(),
12637 Result = DAG.getNode(WrapperKind, DL, getPointerTy(), Result);
12639 // With PIC, the address is actually $g + Offset.
12641 Result = DAG.getNode(ISD::ADD, DL, getPointerTy(),
12642 DAG.getNode(X86ISD::GlobalBaseReg,
12643 SDLoc(), getPointerTy()),
12650 X86TargetLowering::LowerExternalSymbol(SDValue Op, SelectionDAG &DAG) const {
12651 const char *Sym = cast<ExternalSymbolSDNode>(Op)->getSymbol();
12653 // In PIC mode (unless we're in RIPRel PIC mode) we add an offset to the
12654 // global base reg.
12655 unsigned char OpFlag = 0;
12656 unsigned WrapperKind = X86ISD::Wrapper;
12657 CodeModel::Model M = DAG.getTarget().getCodeModel();
12659 if (Subtarget->isPICStyleRIPRel() &&
12660 (M == CodeModel::Small || M == CodeModel::Kernel)) {
12661 if (Subtarget->isTargetDarwin() || Subtarget->isTargetELF())
12662 OpFlag = X86II::MO_GOTPCREL;
12663 WrapperKind = X86ISD::WrapperRIP;
12664 } else if (Subtarget->isPICStyleGOT()) {
12665 OpFlag = X86II::MO_GOT;
12666 } else if (Subtarget->isPICStyleStubPIC()) {
12667 OpFlag = X86II::MO_DARWIN_NONLAZY_PIC_BASE;
12668 } else if (Subtarget->isPICStyleStubNoDynamic()) {
12669 OpFlag = X86II::MO_DARWIN_NONLAZY;
12672 SDValue Result = DAG.getTargetExternalSymbol(Sym, getPointerTy(), OpFlag);
12675 Result = DAG.getNode(WrapperKind, DL, getPointerTy(), Result);
12677 // With PIC, the address is actually $g + Offset.
12678 if (DAG.getTarget().getRelocationModel() == Reloc::PIC_ &&
12679 !Subtarget->is64Bit()) {
12680 Result = DAG.getNode(ISD::ADD, DL, getPointerTy(),
12681 DAG.getNode(X86ISD::GlobalBaseReg,
12682 SDLoc(), getPointerTy()),
12686 // For symbols that require a load from a stub to get the address, emit the
12688 if (isGlobalStubReference(OpFlag))
12689 Result = DAG.getLoad(getPointerTy(), DL, DAG.getEntryNode(), Result,
12690 MachinePointerInfo::getGOT(), false, false, false, 0);
12696 X86TargetLowering::LowerBlockAddress(SDValue Op, SelectionDAG &DAG) const {
12697 // Create the TargetBlockAddressAddress node.
12698 unsigned char OpFlags =
12699 Subtarget->ClassifyBlockAddressReference();
12700 CodeModel::Model M = DAG.getTarget().getCodeModel();
12701 const BlockAddress *BA = cast<BlockAddressSDNode>(Op)->getBlockAddress();
12702 int64_t Offset = cast<BlockAddressSDNode>(Op)->getOffset();
12704 SDValue Result = DAG.getTargetBlockAddress(BA, getPointerTy(), Offset,
12707 if (Subtarget->isPICStyleRIPRel() &&
12708 (M == CodeModel::Small || M == CodeModel::Kernel))
12709 Result = DAG.getNode(X86ISD::WrapperRIP, dl, getPointerTy(), Result);
12711 Result = DAG.getNode(X86ISD::Wrapper, dl, getPointerTy(), Result);
12713 // With PIC, the address is actually $g + Offset.
12714 if (isGlobalRelativeToPICBase(OpFlags)) {
12715 Result = DAG.getNode(ISD::ADD, dl, getPointerTy(),
12716 DAG.getNode(X86ISD::GlobalBaseReg, dl, getPointerTy()),
12724 X86TargetLowering::LowerGlobalAddress(const GlobalValue *GV, SDLoc dl,
12725 int64_t Offset, SelectionDAG &DAG) const {
12726 // Create the TargetGlobalAddress node, folding in the constant
12727 // offset if it is legal.
12728 unsigned char OpFlags =
12729 Subtarget->ClassifyGlobalReference(GV, DAG.getTarget());
12730 CodeModel::Model M = DAG.getTarget().getCodeModel();
12732 if (OpFlags == X86II::MO_NO_FLAG &&
12733 X86::isOffsetSuitableForCodeModel(Offset, M)) {
12734 // A direct static reference to a global.
12735 Result = DAG.getTargetGlobalAddress(GV, dl, getPointerTy(), Offset);
12738 Result = DAG.getTargetGlobalAddress(GV, dl, getPointerTy(), 0, OpFlags);
12741 if (Subtarget->isPICStyleRIPRel() &&
12742 (M == CodeModel::Small || M == CodeModel::Kernel))
12743 Result = DAG.getNode(X86ISD::WrapperRIP, dl, getPointerTy(), Result);
12745 Result = DAG.getNode(X86ISD::Wrapper, dl, getPointerTy(), Result);
12747 // With PIC, the address is actually $g + Offset.
12748 if (isGlobalRelativeToPICBase(OpFlags)) {
12749 Result = DAG.getNode(ISD::ADD, dl, getPointerTy(),
12750 DAG.getNode(X86ISD::GlobalBaseReg, dl, getPointerTy()),
12754 // For globals that require a load from a stub to get the address, emit the
12756 if (isGlobalStubReference(OpFlags))
12757 Result = DAG.getLoad(getPointerTy(), dl, DAG.getEntryNode(), Result,
12758 MachinePointerInfo::getGOT(), false, false, false, 0);
12760 // If there was a non-zero offset that we didn't fold, create an explicit
12761 // addition for it.
12763 Result = DAG.getNode(ISD::ADD, dl, getPointerTy(), Result,
12764 DAG.getConstant(Offset, getPointerTy()));
12770 X86TargetLowering::LowerGlobalAddress(SDValue Op, SelectionDAG &DAG) const {
12771 const GlobalValue *GV = cast<GlobalAddressSDNode>(Op)->getGlobal();
12772 int64_t Offset = cast<GlobalAddressSDNode>(Op)->getOffset();
12773 return LowerGlobalAddress(GV, SDLoc(Op), Offset, DAG);
12777 GetTLSADDR(SelectionDAG &DAG, SDValue Chain, GlobalAddressSDNode *GA,
12778 SDValue *InFlag, const EVT PtrVT, unsigned ReturnReg,
12779 unsigned char OperandFlags, bool LocalDynamic = false) {
12780 MachineFrameInfo *MFI = DAG.getMachineFunction().getFrameInfo();
12781 SDVTList NodeTys = DAG.getVTList(MVT::Other, MVT::Glue);
12783 SDValue TGA = DAG.getTargetGlobalAddress(GA->getGlobal(), dl,
12784 GA->getValueType(0),
12788 X86ISD::NodeType CallType = LocalDynamic ? X86ISD::TLSBASEADDR
12792 SDValue Ops[] = { Chain, TGA, *InFlag };
12793 Chain = DAG.getNode(CallType, dl, NodeTys, Ops);
12795 SDValue Ops[] = { Chain, TGA };
12796 Chain = DAG.getNode(CallType, dl, NodeTys, Ops);
12799 // TLSADDR will be codegen'ed as call. Inform MFI that function has calls.
12800 MFI->setAdjustsStack(true);
12801 MFI->setHasCalls(true);
12803 SDValue Flag = Chain.getValue(1);
12804 return DAG.getCopyFromReg(Chain, dl, ReturnReg, PtrVT, Flag);
12807 // Lower ISD::GlobalTLSAddress using the "general dynamic" model, 32 bit
12809 LowerToTLSGeneralDynamicModel32(GlobalAddressSDNode *GA, SelectionDAG &DAG,
12812 SDLoc dl(GA); // ? function entry point might be better
12813 SDValue Chain = DAG.getCopyToReg(DAG.getEntryNode(), dl, X86::EBX,
12814 DAG.getNode(X86ISD::GlobalBaseReg,
12815 SDLoc(), PtrVT), InFlag);
12816 InFlag = Chain.getValue(1);
12818 return GetTLSADDR(DAG, Chain, GA, &InFlag, PtrVT, X86::EAX, X86II::MO_TLSGD);
12821 // Lower ISD::GlobalTLSAddress using the "general dynamic" model, 64 bit
12823 LowerToTLSGeneralDynamicModel64(GlobalAddressSDNode *GA, SelectionDAG &DAG,
12825 return GetTLSADDR(DAG, DAG.getEntryNode(), GA, nullptr, PtrVT,
12826 X86::RAX, X86II::MO_TLSGD);
12829 static SDValue LowerToTLSLocalDynamicModel(GlobalAddressSDNode *GA,
12835 // Get the start address of the TLS block for this module.
12836 X86MachineFunctionInfo* MFI = DAG.getMachineFunction()
12837 .getInfo<X86MachineFunctionInfo>();
12838 MFI->incNumLocalDynamicTLSAccesses();
12842 Base = GetTLSADDR(DAG, DAG.getEntryNode(), GA, nullptr, PtrVT, X86::RAX,
12843 X86II::MO_TLSLD, /*LocalDynamic=*/true);
12846 SDValue Chain = DAG.getCopyToReg(DAG.getEntryNode(), dl, X86::EBX,
12847 DAG.getNode(X86ISD::GlobalBaseReg, SDLoc(), PtrVT), InFlag);
12848 InFlag = Chain.getValue(1);
12849 Base = GetTLSADDR(DAG, Chain, GA, &InFlag, PtrVT, X86::EAX,
12850 X86II::MO_TLSLDM, /*LocalDynamic=*/true);
12853 // Note: the CleanupLocalDynamicTLSPass will remove redundant computations
12857 unsigned char OperandFlags = X86II::MO_DTPOFF;
12858 unsigned WrapperKind = X86ISD::Wrapper;
12859 SDValue TGA = DAG.getTargetGlobalAddress(GA->getGlobal(), dl,
12860 GA->getValueType(0),
12861 GA->getOffset(), OperandFlags);
12862 SDValue Offset = DAG.getNode(WrapperKind, dl, PtrVT, TGA);
12864 // Add x@dtpoff with the base.
12865 return DAG.getNode(ISD::ADD, dl, PtrVT, Offset, Base);
12868 // Lower ISD::GlobalTLSAddress using the "initial exec" or "local exec" model.
12869 static SDValue LowerToTLSExecModel(GlobalAddressSDNode *GA, SelectionDAG &DAG,
12870 const EVT PtrVT, TLSModel::Model model,
12871 bool is64Bit, bool isPIC) {
12874 // Get the Thread Pointer, which is %gs:0 (32-bit) or %fs:0 (64-bit).
12875 Value *Ptr = Constant::getNullValue(Type::getInt8PtrTy(*DAG.getContext(),
12876 is64Bit ? 257 : 256));
12878 SDValue ThreadPointer =
12879 DAG.getLoad(PtrVT, dl, DAG.getEntryNode(), DAG.getIntPtrConstant(0),
12880 MachinePointerInfo(Ptr), false, false, false, 0);
12882 unsigned char OperandFlags = 0;
12883 // Most TLS accesses are not RIP relative, even on x86-64. One exception is
12885 unsigned WrapperKind = X86ISD::Wrapper;
12886 if (model == TLSModel::LocalExec) {
12887 OperandFlags = is64Bit ? X86II::MO_TPOFF : X86II::MO_NTPOFF;
12888 } else if (model == TLSModel::InitialExec) {
12890 OperandFlags = X86II::MO_GOTTPOFF;
12891 WrapperKind = X86ISD::WrapperRIP;
12893 OperandFlags = isPIC ? X86II::MO_GOTNTPOFF : X86II::MO_INDNTPOFF;
12896 llvm_unreachable("Unexpected model");
12899 // emit "addl x@ntpoff,%eax" (local exec)
12900 // or "addl x@indntpoff,%eax" (initial exec)
12901 // or "addl x@gotntpoff(%ebx) ,%eax" (initial exec, 32-bit pic)
12903 DAG.getTargetGlobalAddress(GA->getGlobal(), dl, GA->getValueType(0),
12904 GA->getOffset(), OperandFlags);
12905 SDValue Offset = DAG.getNode(WrapperKind, dl, PtrVT, TGA);
12907 if (model == TLSModel::InitialExec) {
12908 if (isPIC && !is64Bit) {
12909 Offset = DAG.getNode(ISD::ADD, dl, PtrVT,
12910 DAG.getNode(X86ISD::GlobalBaseReg, SDLoc(), PtrVT),
12914 Offset = DAG.getLoad(PtrVT, dl, DAG.getEntryNode(), Offset,
12915 MachinePointerInfo::getGOT(), false, false, false, 0);
12918 // The address of the thread local variable is the add of the thread
12919 // pointer with the offset of the variable.
12920 return DAG.getNode(ISD::ADD, dl, PtrVT, ThreadPointer, Offset);
12924 X86TargetLowering::LowerGlobalTLSAddress(SDValue Op, SelectionDAG &DAG) const {
12926 GlobalAddressSDNode *GA = cast<GlobalAddressSDNode>(Op);
12927 const GlobalValue *GV = GA->getGlobal();
12929 if (Subtarget->isTargetELF()) {
12930 TLSModel::Model model = DAG.getTarget().getTLSModel(GV);
12933 case TLSModel::GeneralDynamic:
12934 if (Subtarget->is64Bit())
12935 return LowerToTLSGeneralDynamicModel64(GA, DAG, getPointerTy());
12936 return LowerToTLSGeneralDynamicModel32(GA, DAG, getPointerTy());
12937 case TLSModel::LocalDynamic:
12938 return LowerToTLSLocalDynamicModel(GA, DAG, getPointerTy(),
12939 Subtarget->is64Bit());
12940 case TLSModel::InitialExec:
12941 case TLSModel::LocalExec:
12942 return LowerToTLSExecModel(
12943 GA, DAG, getPointerTy(), model, Subtarget->is64Bit(),
12944 DAG.getTarget().getRelocationModel() == Reloc::PIC_);
12946 llvm_unreachable("Unknown TLS model.");
12949 if (Subtarget->isTargetDarwin()) {
12950 // Darwin only has one model of TLS. Lower to that.
12951 unsigned char OpFlag = 0;
12952 unsigned WrapperKind = Subtarget->isPICStyleRIPRel() ?
12953 X86ISD::WrapperRIP : X86ISD::Wrapper;
12955 // In PIC mode (unless we're in RIPRel PIC mode) we add an offset to the
12956 // global base reg.
12957 bool PIC32 = (DAG.getTarget().getRelocationModel() == Reloc::PIC_) &&
12958 !Subtarget->is64Bit();
12960 OpFlag = X86II::MO_TLVP_PIC_BASE;
12962 OpFlag = X86II::MO_TLVP;
12964 SDValue Result = DAG.getTargetGlobalAddress(GA->getGlobal(), DL,
12965 GA->getValueType(0),
12966 GA->getOffset(), OpFlag);
12967 SDValue Offset = DAG.getNode(WrapperKind, DL, getPointerTy(), Result);
12969 // With PIC32, the address is actually $g + Offset.
12971 Offset = DAG.getNode(ISD::ADD, DL, getPointerTy(),
12972 DAG.getNode(X86ISD::GlobalBaseReg,
12973 SDLoc(), getPointerTy()),
12976 // Lowering the machine isd will make sure everything is in the right
12978 SDValue Chain = DAG.getEntryNode();
12979 SDVTList NodeTys = DAG.getVTList(MVT::Other, MVT::Glue);
12980 SDValue Args[] = { Chain, Offset };
12981 Chain = DAG.getNode(X86ISD::TLSCALL, DL, NodeTys, Args);
12983 // TLSCALL will be codegen'ed as call. Inform MFI that function has calls.
12984 MachineFrameInfo *MFI = DAG.getMachineFunction().getFrameInfo();
12985 MFI->setAdjustsStack(true);
12987 // And our return value (tls address) is in the standard call return value
12989 unsigned Reg = Subtarget->is64Bit() ? X86::RAX : X86::EAX;
12990 return DAG.getCopyFromReg(Chain, DL, Reg, getPointerTy(),
12991 Chain.getValue(1));
12994 if (Subtarget->isTargetKnownWindowsMSVC() ||
12995 Subtarget->isTargetWindowsGNU()) {
12996 // Just use the implicit TLS architecture
12997 // Need to generate someting similar to:
12998 // mov rdx, qword [gs:abs 58H]; Load pointer to ThreadLocalStorage
13000 // mov ecx, dword [rel _tls_index]: Load index (from C runtime)
13001 // mov rcx, qword [rdx+rcx*8]
13002 // mov eax, .tls$:tlsvar
13003 // [rax+rcx] contains the address
13004 // Windows 64bit: gs:0x58
13005 // Windows 32bit: fs:__tls_array
13008 SDValue Chain = DAG.getEntryNode();
13010 // Get the Thread Pointer, which is %fs:__tls_array (32-bit) or
13011 // %gs:0x58 (64-bit). On MinGW, __tls_array is not available, so directly
13012 // use its literal value of 0x2C.
13013 Value *Ptr = Constant::getNullValue(Subtarget->is64Bit()
13014 ? Type::getInt8PtrTy(*DAG.getContext(),
13016 : Type::getInt32PtrTy(*DAG.getContext(),
13020 Subtarget->is64Bit()
13021 ? DAG.getIntPtrConstant(0x58)
13022 : (Subtarget->isTargetWindowsGNU()
13023 ? DAG.getIntPtrConstant(0x2C)
13024 : DAG.getExternalSymbol("_tls_array", getPointerTy()));
13026 SDValue ThreadPointer =
13027 DAG.getLoad(getPointerTy(), dl, Chain, TlsArray,
13028 MachinePointerInfo(Ptr), false, false, false, 0);
13030 // Load the _tls_index variable
13031 SDValue IDX = DAG.getExternalSymbol("_tls_index", getPointerTy());
13032 if (Subtarget->is64Bit())
13033 IDX = DAG.getExtLoad(ISD::ZEXTLOAD, dl, getPointerTy(), Chain,
13034 IDX, MachinePointerInfo(), MVT::i32,
13035 false, false, false, 0);
13037 IDX = DAG.getLoad(getPointerTy(), dl, Chain, IDX, MachinePointerInfo(),
13038 false, false, false, 0);
13040 SDValue Scale = DAG.getConstant(Log2_64_Ceil(TD->getPointerSize()),
13042 IDX = DAG.getNode(ISD::SHL, dl, getPointerTy(), IDX, Scale);
13044 SDValue res = DAG.getNode(ISD::ADD, dl, getPointerTy(), ThreadPointer, IDX);
13045 res = DAG.getLoad(getPointerTy(), dl, Chain, res, MachinePointerInfo(),
13046 false, false, false, 0);
13048 // Get the offset of start of .tls section
13049 SDValue TGA = DAG.getTargetGlobalAddress(GA->getGlobal(), dl,
13050 GA->getValueType(0),
13051 GA->getOffset(), X86II::MO_SECREL);
13052 SDValue Offset = DAG.getNode(X86ISD::Wrapper, dl, getPointerTy(), TGA);
13054 // The address of the thread local variable is the add of the thread
13055 // pointer with the offset of the variable.
13056 return DAG.getNode(ISD::ADD, dl, getPointerTy(), res, Offset);
13059 llvm_unreachable("TLS not implemented for this target.");
13062 /// LowerShiftParts - Lower SRA_PARTS and friends, which return two i32 values
13063 /// and take a 2 x i32 value to shift plus a shift amount.
13064 static SDValue LowerShiftParts(SDValue Op, SelectionDAG &DAG) {
13065 assert(Op.getNumOperands() == 3 && "Not a double-shift!");
13066 MVT VT = Op.getSimpleValueType();
13067 unsigned VTBits = VT.getSizeInBits();
13069 bool isSRA = Op.getOpcode() == ISD::SRA_PARTS;
13070 SDValue ShOpLo = Op.getOperand(0);
13071 SDValue ShOpHi = Op.getOperand(1);
13072 SDValue ShAmt = Op.getOperand(2);
13073 // X86ISD::SHLD and X86ISD::SHRD have defined overflow behavior but the
13074 // generic ISD nodes haven't. Insert an AND to be safe, it's optimized away
13076 SDValue SafeShAmt = DAG.getNode(ISD::AND, dl, MVT::i8, ShAmt,
13077 DAG.getConstant(VTBits - 1, MVT::i8));
13078 SDValue Tmp1 = isSRA ? DAG.getNode(ISD::SRA, dl, VT, ShOpHi,
13079 DAG.getConstant(VTBits - 1, MVT::i8))
13080 : DAG.getConstant(0, VT);
13082 SDValue Tmp2, Tmp3;
13083 if (Op.getOpcode() == ISD::SHL_PARTS) {
13084 Tmp2 = DAG.getNode(X86ISD::SHLD, dl, VT, ShOpHi, ShOpLo, ShAmt);
13085 Tmp3 = DAG.getNode(ISD::SHL, dl, VT, ShOpLo, SafeShAmt);
13087 Tmp2 = DAG.getNode(X86ISD::SHRD, dl, VT, ShOpLo, ShOpHi, ShAmt);
13088 Tmp3 = DAG.getNode(isSRA ? ISD::SRA : ISD::SRL, dl, VT, ShOpHi, SafeShAmt);
13091 // If the shift amount is larger or equal than the width of a part we can't
13092 // rely on the results of shld/shrd. Insert a test and select the appropriate
13093 // values for large shift amounts.
13094 SDValue AndNode = DAG.getNode(ISD::AND, dl, MVT::i8, ShAmt,
13095 DAG.getConstant(VTBits, MVT::i8));
13096 SDValue Cond = DAG.getNode(X86ISD::CMP, dl, MVT::i32,
13097 AndNode, DAG.getConstant(0, MVT::i8));
13100 SDValue CC = DAG.getConstant(X86::COND_NE, MVT::i8);
13101 SDValue Ops0[4] = { Tmp2, Tmp3, CC, Cond };
13102 SDValue Ops1[4] = { Tmp3, Tmp1, CC, Cond };
13104 if (Op.getOpcode() == ISD::SHL_PARTS) {
13105 Hi = DAG.getNode(X86ISD::CMOV, dl, VT, Ops0);
13106 Lo = DAG.getNode(X86ISD::CMOV, dl, VT, Ops1);
13108 Lo = DAG.getNode(X86ISD::CMOV, dl, VT, Ops0);
13109 Hi = DAG.getNode(X86ISD::CMOV, dl, VT, Ops1);
13112 SDValue Ops[2] = { Lo, Hi };
13113 return DAG.getMergeValues(Ops, dl);
13116 SDValue X86TargetLowering::LowerSINT_TO_FP(SDValue Op,
13117 SelectionDAG &DAG) const {
13118 MVT SrcVT = Op.getOperand(0).getSimpleValueType();
13120 if (SrcVT.isVector())
13123 assert(SrcVT <= MVT::i64 && SrcVT >= MVT::i16 &&
13124 "Unknown SINT_TO_FP to lower!");
13126 // These are really Legal; return the operand so the caller accepts it as
13128 if (SrcVT == MVT::i32 && isScalarFPTypeInSSEReg(Op.getValueType()))
13130 if (SrcVT == MVT::i64 && isScalarFPTypeInSSEReg(Op.getValueType()) &&
13131 Subtarget->is64Bit()) {
13136 unsigned Size = SrcVT.getSizeInBits()/8;
13137 MachineFunction &MF = DAG.getMachineFunction();
13138 int SSFI = MF.getFrameInfo()->CreateStackObject(Size, Size, false);
13139 SDValue StackSlot = DAG.getFrameIndex(SSFI, getPointerTy());
13140 SDValue Chain = DAG.getStore(DAG.getEntryNode(), dl, Op.getOperand(0),
13142 MachinePointerInfo::getFixedStack(SSFI),
13144 return BuildFILD(Op, SrcVT, Chain, StackSlot, DAG);
13147 SDValue X86TargetLowering::BuildFILD(SDValue Op, EVT SrcVT, SDValue Chain,
13149 SelectionDAG &DAG) const {
13153 bool useSSE = isScalarFPTypeInSSEReg(Op.getValueType());
13155 Tys = DAG.getVTList(MVT::f64, MVT::Other, MVT::Glue);
13157 Tys = DAG.getVTList(Op.getValueType(), MVT::Other);
13159 unsigned ByteSize = SrcVT.getSizeInBits()/8;
13161 FrameIndexSDNode *FI = dyn_cast<FrameIndexSDNode>(StackSlot);
13162 MachineMemOperand *MMO;
13164 int SSFI = FI->getIndex();
13166 DAG.getMachineFunction()
13167 .getMachineMemOperand(MachinePointerInfo::getFixedStack(SSFI),
13168 MachineMemOperand::MOLoad, ByteSize, ByteSize);
13170 MMO = cast<LoadSDNode>(StackSlot)->getMemOperand();
13171 StackSlot = StackSlot.getOperand(1);
13173 SDValue Ops[] = { Chain, StackSlot, DAG.getValueType(SrcVT) };
13174 SDValue Result = DAG.getMemIntrinsicNode(useSSE ? X86ISD::FILD_FLAG :
13176 Tys, Ops, SrcVT, MMO);
13179 Chain = Result.getValue(1);
13180 SDValue InFlag = Result.getValue(2);
13182 // FIXME: Currently the FST is flagged to the FILD_FLAG. This
13183 // shouldn't be necessary except that RFP cannot be live across
13184 // multiple blocks. When stackifier is fixed, they can be uncoupled.
13185 MachineFunction &MF = DAG.getMachineFunction();
13186 unsigned SSFISize = Op.getValueType().getSizeInBits()/8;
13187 int SSFI = MF.getFrameInfo()->CreateStackObject(SSFISize, SSFISize, false);
13188 SDValue StackSlot = DAG.getFrameIndex(SSFI, getPointerTy());
13189 Tys = DAG.getVTList(MVT::Other);
13191 Chain, Result, StackSlot, DAG.getValueType(Op.getValueType()), InFlag
13193 MachineMemOperand *MMO =
13194 DAG.getMachineFunction()
13195 .getMachineMemOperand(MachinePointerInfo::getFixedStack(SSFI),
13196 MachineMemOperand::MOStore, SSFISize, SSFISize);
13198 Chain = DAG.getMemIntrinsicNode(X86ISD::FST, DL, Tys,
13199 Ops, Op.getValueType(), MMO);
13200 Result = DAG.getLoad(Op.getValueType(), DL, Chain, StackSlot,
13201 MachinePointerInfo::getFixedStack(SSFI),
13202 false, false, false, 0);
13208 // LowerUINT_TO_FP_i64 - 64-bit unsigned integer to double expansion.
13209 SDValue X86TargetLowering::LowerUINT_TO_FP_i64(SDValue Op,
13210 SelectionDAG &DAG) const {
13211 // This algorithm is not obvious. Here it is what we're trying to output:
13214 punpckldq (c0), %xmm0 // c0: (uint4){ 0x43300000U, 0x45300000U, 0U, 0U }
13215 subpd (c1), %xmm0 // c1: (double2){ 0x1.0p52, 0x1.0p52 * 0x1.0p32 }
13217 haddpd %xmm0, %xmm0
13219 pshufd $0x4e, %xmm0, %xmm1
13225 LLVMContext *Context = DAG.getContext();
13227 // Build some magic constants.
13228 static const uint32_t CV0[] = { 0x43300000, 0x45300000, 0, 0 };
13229 Constant *C0 = ConstantDataVector::get(*Context, CV0);
13230 SDValue CPIdx0 = DAG.getConstantPool(C0, getPointerTy(), 16);
13232 SmallVector<Constant*,2> CV1;
13234 ConstantFP::get(*Context, APFloat(APFloat::IEEEdouble,
13235 APInt(64, 0x4330000000000000ULL))));
13237 ConstantFP::get(*Context, APFloat(APFloat::IEEEdouble,
13238 APInt(64, 0x4530000000000000ULL))));
13239 Constant *C1 = ConstantVector::get(CV1);
13240 SDValue CPIdx1 = DAG.getConstantPool(C1, getPointerTy(), 16);
13242 // Load the 64-bit value into an XMM register.
13243 SDValue XR1 = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, MVT::v2i64,
13245 SDValue CLod0 = DAG.getLoad(MVT::v4i32, dl, DAG.getEntryNode(), CPIdx0,
13246 MachinePointerInfo::getConstantPool(),
13247 false, false, false, 16);
13248 SDValue Unpck1 = getUnpackl(DAG, dl, MVT::v4i32,
13249 DAG.getNode(ISD::BITCAST, dl, MVT::v4i32, XR1),
13252 SDValue CLod1 = DAG.getLoad(MVT::v2f64, dl, CLod0.getValue(1), CPIdx1,
13253 MachinePointerInfo::getConstantPool(),
13254 false, false, false, 16);
13255 SDValue XR2F = DAG.getNode(ISD::BITCAST, dl, MVT::v2f64, Unpck1);
13256 SDValue Sub = DAG.getNode(ISD::FSUB, dl, MVT::v2f64, XR2F, CLod1);
13259 if (Subtarget->hasSSE3()) {
13260 // FIXME: The 'haddpd' instruction may be slower than 'movhlps + addsd'.
13261 Result = DAG.getNode(X86ISD::FHADD, dl, MVT::v2f64, Sub, Sub);
13263 SDValue S2F = DAG.getNode(ISD::BITCAST, dl, MVT::v4i32, Sub);
13264 SDValue Shuffle = getTargetShuffleNode(X86ISD::PSHUFD, dl, MVT::v4i32,
13266 Result = DAG.getNode(ISD::FADD, dl, MVT::v2f64,
13267 DAG.getNode(ISD::BITCAST, dl, MVT::v2f64, Shuffle),
13271 return DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::f64, Result,
13272 DAG.getIntPtrConstant(0));
13275 // LowerUINT_TO_FP_i32 - 32-bit unsigned integer to float expansion.
13276 SDValue X86TargetLowering::LowerUINT_TO_FP_i32(SDValue Op,
13277 SelectionDAG &DAG) const {
13279 // FP constant to bias correct the final result.
13280 SDValue Bias = DAG.getConstantFP(BitsToDouble(0x4330000000000000ULL),
13283 // Load the 32-bit value into an XMM register.
13284 SDValue Load = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, MVT::v4i32,
13287 // Zero out the upper parts of the register.
13288 Load = getShuffleVectorZeroOrUndef(Load, 0, true, Subtarget, DAG);
13290 Load = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::f64,
13291 DAG.getNode(ISD::BITCAST, dl, MVT::v2f64, Load),
13292 DAG.getIntPtrConstant(0));
13294 // Or the load with the bias.
13295 SDValue Or = DAG.getNode(ISD::OR, dl, MVT::v2i64,
13296 DAG.getNode(ISD::BITCAST, dl, MVT::v2i64,
13297 DAG.getNode(ISD::SCALAR_TO_VECTOR, dl,
13298 MVT::v2f64, Load)),
13299 DAG.getNode(ISD::BITCAST, dl, MVT::v2i64,
13300 DAG.getNode(ISD::SCALAR_TO_VECTOR, dl,
13301 MVT::v2f64, Bias)));
13302 Or = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::f64,
13303 DAG.getNode(ISD::BITCAST, dl, MVT::v2f64, Or),
13304 DAG.getIntPtrConstant(0));
13306 // Subtract the bias.
13307 SDValue Sub = DAG.getNode(ISD::FSUB, dl, MVT::f64, Or, Bias);
13309 // Handle final rounding.
13310 EVT DestVT = Op.getValueType();
13312 if (DestVT.bitsLT(MVT::f64))
13313 return DAG.getNode(ISD::FP_ROUND, dl, DestVT, Sub,
13314 DAG.getIntPtrConstant(0));
13315 if (DestVT.bitsGT(MVT::f64))
13316 return DAG.getNode(ISD::FP_EXTEND, dl, DestVT, Sub);
13318 // Handle final rounding.
13322 static SDValue lowerUINT_TO_FP_vXi32(SDValue Op, SelectionDAG &DAG,
13323 const X86Subtarget &Subtarget) {
13324 // The algorithm is the following:
13325 // #ifdef __SSE4_1__
13326 // uint4 lo = _mm_blend_epi16( v, (uint4) 0x4b000000, 0xaa);
13327 // uint4 hi = _mm_blend_epi16( _mm_srli_epi32(v,16),
13328 // (uint4) 0x53000000, 0xaa);
13330 // uint4 lo = (v & (uint4) 0xffff) | (uint4) 0x4b000000;
13331 // uint4 hi = (v >> 16) | (uint4) 0x53000000;
13333 // float4 fhi = (float4) hi - (0x1.0p39f + 0x1.0p23f);
13334 // return (float4) lo + fhi;
13337 SDValue V = Op->getOperand(0);
13338 EVT VecIntVT = V.getValueType();
13339 bool Is128 = VecIntVT == MVT::v4i32;
13340 EVT VecFloatVT = Is128 ? MVT::v4f32 : MVT::v8f32;
13341 unsigned NumElts = VecIntVT.getVectorNumElements();
13342 assert((VecIntVT == MVT::v4i32 || VecIntVT == MVT::v8i32) &&
13343 "Unsupported custom type");
13344 assert(NumElts <= 8 && "The size of the constant array must be fixed");
13346 // In the #idef/#else code, we have in common:
13347 // - The vector of constants:
13353 // Create the splat vector for 0x4b000000.
13354 SDValue CstLow = DAG.getConstant(0x4b000000, MVT::i32);
13355 SDValue CstLowArray[] = {CstLow, CstLow, CstLow, CstLow,
13356 CstLow, CstLow, CstLow, CstLow};
13357 SDValue VecCstLow = DAG.getNode(ISD::BUILD_VECTOR, DL, VecIntVT,
13358 makeArrayRef(&CstLowArray[0], NumElts));
13359 // Create the splat vector for 0x53000000.
13360 SDValue CstHigh = DAG.getConstant(0x53000000, MVT::i32);
13361 SDValue CstHighArray[] = {CstHigh, CstHigh, CstHigh, CstHigh,
13362 CstHigh, CstHigh, CstHigh, CstHigh};
13363 SDValue VecCstHigh = DAG.getNode(ISD::BUILD_VECTOR, DL, VecIntVT,
13364 makeArrayRef(&CstHighArray[0], NumElts));
13366 // Create the right shift.
13367 SDValue CstShift = DAG.getConstant(16, MVT::i32);
13368 SDValue CstShiftArray[] = {CstShift, CstShift, CstShift, CstShift,
13369 CstShift, CstShift, CstShift, CstShift};
13370 SDValue VecCstShift = DAG.getNode(ISD::BUILD_VECTOR, DL, VecIntVT,
13371 makeArrayRef(&CstShiftArray[0], NumElts));
13372 SDValue HighShift = DAG.getNode(ISD::SRL, DL, VecIntVT, V, VecCstShift);
13375 if (Subtarget.hasSSE41()) {
13376 EVT VecI16VT = Is128 ? MVT::v8i16 : MVT::v16i16;
13377 // uint4 lo = _mm_blend_epi16( v, (uint4) 0x4b000000, 0xaa);
13378 SDValue VecCstLowBitcast =
13379 DAG.getNode(ISD::BITCAST, DL, VecI16VT, VecCstLow);
13380 SDValue VecBitcast = DAG.getNode(ISD::BITCAST, DL, VecI16VT, V);
13381 // Low will be bitcasted right away, so do not bother bitcasting back to its
13383 Low = DAG.getNode(X86ISD::BLENDI, DL, VecI16VT, VecBitcast,
13384 VecCstLowBitcast, DAG.getConstant(0xaa, MVT::i32));
13385 // uint4 hi = _mm_blend_epi16( _mm_srli_epi32(v,16),
13386 // (uint4) 0x53000000, 0xaa);
13387 SDValue VecCstHighBitcast =
13388 DAG.getNode(ISD::BITCAST, DL, VecI16VT, VecCstHigh);
13389 SDValue VecShiftBitcast =
13390 DAG.getNode(ISD::BITCAST, DL, VecI16VT, HighShift);
13391 // High will be bitcasted right away, so do not bother bitcasting back to
13392 // its original type.
13393 High = DAG.getNode(X86ISD::BLENDI, DL, VecI16VT, VecShiftBitcast,
13394 VecCstHighBitcast, DAG.getConstant(0xaa, MVT::i32));
13396 SDValue CstMask = DAG.getConstant(0xffff, MVT::i32);
13397 SDValue VecCstMask = DAG.getNode(ISD::BUILD_VECTOR, DL, VecIntVT, CstMask,
13398 CstMask, CstMask, CstMask);
13399 // uint4 lo = (v & (uint4) 0xffff) | (uint4) 0x4b000000;
13400 SDValue LowAnd = DAG.getNode(ISD::AND, DL, VecIntVT, V, VecCstMask);
13401 Low = DAG.getNode(ISD::OR, DL, VecIntVT, LowAnd, VecCstLow);
13403 // uint4 hi = (v >> 16) | (uint4) 0x53000000;
13404 High = DAG.getNode(ISD::OR, DL, VecIntVT, HighShift, VecCstHigh);
13407 // Create the vector constant for -(0x1.0p39f + 0x1.0p23f).
13408 SDValue CstFAdd = DAG.getConstantFP(
13409 APFloat(APFloat::IEEEsingle, APInt(32, 0xD3000080)), MVT::f32);
13410 SDValue CstFAddArray[] = {CstFAdd, CstFAdd, CstFAdd, CstFAdd,
13411 CstFAdd, CstFAdd, CstFAdd, CstFAdd};
13412 SDValue VecCstFAdd = DAG.getNode(ISD::BUILD_VECTOR, DL, VecFloatVT,
13413 makeArrayRef(&CstFAddArray[0], NumElts));
13415 // float4 fhi = (float4) hi - (0x1.0p39f + 0x1.0p23f);
13416 SDValue HighBitcast = DAG.getNode(ISD::BITCAST, DL, VecFloatVT, High);
13418 DAG.getNode(ISD::FADD, DL, VecFloatVT, HighBitcast, VecCstFAdd);
13419 // return (float4) lo + fhi;
13420 SDValue LowBitcast = DAG.getNode(ISD::BITCAST, DL, VecFloatVT, Low);
13421 return DAG.getNode(ISD::FADD, DL, VecFloatVT, LowBitcast, FHigh);
13424 SDValue X86TargetLowering::lowerUINT_TO_FP_vec(SDValue Op,
13425 SelectionDAG &DAG) const {
13426 SDValue N0 = Op.getOperand(0);
13427 MVT SVT = N0.getSimpleValueType();
13430 switch (SVT.SimpleTy) {
13432 llvm_unreachable("Custom UINT_TO_FP is not supported!");
13437 MVT NVT = MVT::getVectorVT(MVT::i32, SVT.getVectorNumElements());
13438 return DAG.getNode(ISD::SINT_TO_FP, dl, Op.getValueType(),
13439 DAG.getNode(ISD::ZERO_EXTEND, dl, NVT, N0));
13443 return lowerUINT_TO_FP_vXi32(Op, DAG, *Subtarget);
13445 llvm_unreachable(nullptr);
13448 SDValue X86TargetLowering::LowerUINT_TO_FP(SDValue Op,
13449 SelectionDAG &DAG) const {
13450 SDValue N0 = Op.getOperand(0);
13453 if (Op.getValueType().isVector())
13454 return lowerUINT_TO_FP_vec(Op, DAG);
13456 // Since UINT_TO_FP is legal (it's marked custom), dag combiner won't
13457 // optimize it to a SINT_TO_FP when the sign bit is known zero. Perform
13458 // the optimization here.
13459 if (DAG.SignBitIsZero(N0))
13460 return DAG.getNode(ISD::SINT_TO_FP, dl, Op.getValueType(), N0);
13462 MVT SrcVT = N0.getSimpleValueType();
13463 MVT DstVT = Op.getSimpleValueType();
13464 if (SrcVT == MVT::i64 && DstVT == MVT::f64 && X86ScalarSSEf64)
13465 return LowerUINT_TO_FP_i64(Op, DAG);
13466 if (SrcVT == MVT::i32 && X86ScalarSSEf64)
13467 return LowerUINT_TO_FP_i32(Op, DAG);
13468 if (Subtarget->is64Bit() && SrcVT == MVT::i64 && DstVT == MVT::f32)
13471 // Make a 64-bit buffer, and use it to build an FILD.
13472 SDValue StackSlot = DAG.CreateStackTemporary(MVT::i64);
13473 if (SrcVT == MVT::i32) {
13474 SDValue WordOff = DAG.getConstant(4, getPointerTy());
13475 SDValue OffsetSlot = DAG.getNode(ISD::ADD, dl,
13476 getPointerTy(), StackSlot, WordOff);
13477 SDValue Store1 = DAG.getStore(DAG.getEntryNode(), dl, Op.getOperand(0),
13478 StackSlot, MachinePointerInfo(),
13480 SDValue Store2 = DAG.getStore(Store1, dl, DAG.getConstant(0, MVT::i32),
13481 OffsetSlot, MachinePointerInfo(),
13483 SDValue Fild = BuildFILD(Op, MVT::i64, Store2, StackSlot, DAG);
13487 assert(SrcVT == MVT::i64 && "Unexpected type in UINT_TO_FP");
13488 SDValue Store = DAG.getStore(DAG.getEntryNode(), dl, Op.getOperand(0),
13489 StackSlot, MachinePointerInfo(),
13491 // For i64 source, we need to add the appropriate power of 2 if the input
13492 // was negative. This is the same as the optimization in
13493 // DAGTypeLegalizer::ExpandIntOp_UNIT_TO_FP, and for it to be safe here,
13494 // we must be careful to do the computation in x87 extended precision, not
13495 // in SSE. (The generic code can't know it's OK to do this, or how to.)
13496 int SSFI = cast<FrameIndexSDNode>(StackSlot)->getIndex();
13497 MachineMemOperand *MMO =
13498 DAG.getMachineFunction()
13499 .getMachineMemOperand(MachinePointerInfo::getFixedStack(SSFI),
13500 MachineMemOperand::MOLoad, 8, 8);
13502 SDVTList Tys = DAG.getVTList(MVT::f80, MVT::Other);
13503 SDValue Ops[] = { Store, StackSlot, DAG.getValueType(MVT::i64) };
13504 SDValue Fild = DAG.getMemIntrinsicNode(X86ISD::FILD, dl, Tys, Ops,
13507 APInt FF(32, 0x5F800000ULL);
13509 // Check whether the sign bit is set.
13510 SDValue SignSet = DAG.getSetCC(dl,
13511 getSetCCResultType(*DAG.getContext(), MVT::i64),
13512 Op.getOperand(0), DAG.getConstant(0, MVT::i64),
13515 // Build a 64 bit pair (0, FF) in the constant pool, with FF in the lo bits.
13516 SDValue FudgePtr = DAG.getConstantPool(
13517 ConstantInt::get(*DAG.getContext(), FF.zext(64)),
13520 // Get a pointer to FF if the sign bit was set, or to 0 otherwise.
13521 SDValue Zero = DAG.getIntPtrConstant(0);
13522 SDValue Four = DAG.getIntPtrConstant(4);
13523 SDValue Offset = DAG.getNode(ISD::SELECT, dl, Zero.getValueType(), SignSet,
13525 FudgePtr = DAG.getNode(ISD::ADD, dl, getPointerTy(), FudgePtr, Offset);
13527 // Load the value out, extending it from f32 to f80.
13528 // FIXME: Avoid the extend by constructing the right constant pool?
13529 SDValue Fudge = DAG.getExtLoad(ISD::EXTLOAD, dl, MVT::f80, DAG.getEntryNode(),
13530 FudgePtr, MachinePointerInfo::getConstantPool(),
13531 MVT::f32, false, false, false, 4);
13532 // Extend everything to 80 bits to force it to be done on x87.
13533 SDValue Add = DAG.getNode(ISD::FADD, dl, MVT::f80, Fild, Fudge);
13534 return DAG.getNode(ISD::FP_ROUND, dl, DstVT, Add, DAG.getIntPtrConstant(0));
13537 std::pair<SDValue,SDValue>
13538 X86TargetLowering:: FP_TO_INTHelper(SDValue Op, SelectionDAG &DAG,
13539 bool IsSigned, bool IsReplace) const {
13542 EVT DstTy = Op.getValueType();
13544 if (!IsSigned && !isIntegerTypeFTOL(DstTy)) {
13545 assert(DstTy == MVT::i32 && "Unexpected FP_TO_UINT");
13549 assert(DstTy.getSimpleVT() <= MVT::i64 &&
13550 DstTy.getSimpleVT() >= MVT::i16 &&
13551 "Unknown FP_TO_INT to lower!");
13553 // These are really Legal.
13554 if (DstTy == MVT::i32 &&
13555 isScalarFPTypeInSSEReg(Op.getOperand(0).getValueType()))
13556 return std::make_pair(SDValue(), SDValue());
13557 if (Subtarget->is64Bit() &&
13558 DstTy == MVT::i64 &&
13559 isScalarFPTypeInSSEReg(Op.getOperand(0).getValueType()))
13560 return std::make_pair(SDValue(), SDValue());
13562 // We lower FP->int64 either into FISTP64 followed by a load from a temporary
13563 // stack slot, or into the FTOL runtime function.
13564 MachineFunction &MF = DAG.getMachineFunction();
13565 unsigned MemSize = DstTy.getSizeInBits()/8;
13566 int SSFI = MF.getFrameInfo()->CreateStackObject(MemSize, MemSize, false);
13567 SDValue StackSlot = DAG.getFrameIndex(SSFI, getPointerTy());
13570 if (!IsSigned && isIntegerTypeFTOL(DstTy))
13571 Opc = X86ISD::WIN_FTOL;
13573 switch (DstTy.getSimpleVT().SimpleTy) {
13574 default: llvm_unreachable("Invalid FP_TO_SINT to lower!");
13575 case MVT::i16: Opc = X86ISD::FP_TO_INT16_IN_MEM; break;
13576 case MVT::i32: Opc = X86ISD::FP_TO_INT32_IN_MEM; break;
13577 case MVT::i64: Opc = X86ISD::FP_TO_INT64_IN_MEM; break;
13580 SDValue Chain = DAG.getEntryNode();
13581 SDValue Value = Op.getOperand(0);
13582 EVT TheVT = Op.getOperand(0).getValueType();
13583 // FIXME This causes a redundant load/store if the SSE-class value is already
13584 // in memory, such as if it is on the callstack.
13585 if (isScalarFPTypeInSSEReg(TheVT)) {
13586 assert(DstTy == MVT::i64 && "Invalid FP_TO_SINT to lower!");
13587 Chain = DAG.getStore(Chain, DL, Value, StackSlot,
13588 MachinePointerInfo::getFixedStack(SSFI),
13590 SDVTList Tys = DAG.getVTList(Op.getOperand(0).getValueType(), MVT::Other);
13592 Chain, StackSlot, DAG.getValueType(TheVT)
13595 MachineMemOperand *MMO =
13596 MF.getMachineMemOperand(MachinePointerInfo::getFixedStack(SSFI),
13597 MachineMemOperand::MOLoad, MemSize, MemSize);
13598 Value = DAG.getMemIntrinsicNode(X86ISD::FLD, DL, Tys, Ops, DstTy, MMO);
13599 Chain = Value.getValue(1);
13600 SSFI = MF.getFrameInfo()->CreateStackObject(MemSize, MemSize, false);
13601 StackSlot = DAG.getFrameIndex(SSFI, getPointerTy());
13604 MachineMemOperand *MMO =
13605 MF.getMachineMemOperand(MachinePointerInfo::getFixedStack(SSFI),
13606 MachineMemOperand::MOStore, MemSize, MemSize);
13608 if (Opc != X86ISD::WIN_FTOL) {
13609 // Build the FP_TO_INT*_IN_MEM
13610 SDValue Ops[] = { Chain, Value, StackSlot };
13611 SDValue FIST = DAG.getMemIntrinsicNode(Opc, DL, DAG.getVTList(MVT::Other),
13613 return std::make_pair(FIST, StackSlot);
13615 SDValue ftol = DAG.getNode(X86ISD::WIN_FTOL, DL,
13616 DAG.getVTList(MVT::Other, MVT::Glue),
13618 SDValue eax = DAG.getCopyFromReg(ftol, DL, X86::EAX,
13619 MVT::i32, ftol.getValue(1));
13620 SDValue edx = DAG.getCopyFromReg(eax.getValue(1), DL, X86::EDX,
13621 MVT::i32, eax.getValue(2));
13622 SDValue Ops[] = { eax, edx };
13623 SDValue pair = IsReplace
13624 ? DAG.getNode(ISD::BUILD_PAIR, DL, MVT::i64, Ops)
13625 : DAG.getMergeValues(Ops, DL);
13626 return std::make_pair(pair, SDValue());
13630 static SDValue LowerAVXExtend(SDValue Op, SelectionDAG &DAG,
13631 const X86Subtarget *Subtarget) {
13632 MVT VT = Op->getSimpleValueType(0);
13633 SDValue In = Op->getOperand(0);
13634 MVT InVT = In.getSimpleValueType();
13637 // Optimize vectors in AVX mode:
13640 // Use vpunpcklwd for 4 lower elements v8i16 -> v4i32.
13641 // Use vpunpckhwd for 4 upper elements v8i16 -> v4i32.
13642 // Concat upper and lower parts.
13645 // Use vpunpckldq for 4 lower elements v4i32 -> v2i64.
13646 // Use vpunpckhdq for 4 upper elements v4i32 -> v2i64.
13647 // Concat upper and lower parts.
13650 if (((VT != MVT::v16i16) || (InVT != MVT::v16i8)) &&
13651 ((VT != MVT::v8i32) || (InVT != MVT::v8i16)) &&
13652 ((VT != MVT::v4i64) || (InVT != MVT::v4i32)))
13655 if (Subtarget->hasInt256())
13656 return DAG.getNode(X86ISD::VZEXT, dl, VT, In);
13658 SDValue ZeroVec = getZeroVector(InVT, Subtarget, DAG, dl);
13659 SDValue Undef = DAG.getUNDEF(InVT);
13660 bool NeedZero = Op.getOpcode() == ISD::ZERO_EXTEND;
13661 SDValue OpLo = getUnpackl(DAG, dl, InVT, In, NeedZero ? ZeroVec : Undef);
13662 SDValue OpHi = getUnpackh(DAG, dl, InVT, In, NeedZero ? ZeroVec : Undef);
13664 MVT HVT = MVT::getVectorVT(VT.getVectorElementType(),
13665 VT.getVectorNumElements()/2);
13667 OpLo = DAG.getNode(ISD::BITCAST, dl, HVT, OpLo);
13668 OpHi = DAG.getNode(ISD::BITCAST, dl, HVT, OpHi);
13670 return DAG.getNode(ISD::CONCAT_VECTORS, dl, VT, OpLo, OpHi);
13673 static SDValue LowerZERO_EXTEND_AVX512(SDValue Op,
13674 SelectionDAG &DAG) {
13675 MVT VT = Op->getSimpleValueType(0);
13676 SDValue In = Op->getOperand(0);
13677 MVT InVT = In.getSimpleValueType();
13679 unsigned int NumElts = VT.getVectorNumElements();
13680 if (NumElts != 8 && NumElts != 16)
13683 if (VT.is512BitVector() && InVT.getVectorElementType() != MVT::i1)
13684 return DAG.getNode(X86ISD::VZEXT, DL, VT, In);
13686 EVT ExtVT = (NumElts == 8)? MVT::v8i64 : MVT::v16i32;
13687 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
13688 // Now we have only mask extension
13689 assert(InVT.getVectorElementType() == MVT::i1);
13690 SDValue Cst = DAG.getTargetConstant(1, ExtVT.getScalarType());
13691 const Constant *C = (dyn_cast<ConstantSDNode>(Cst))->getConstantIntValue();
13692 SDValue CP = DAG.getConstantPool(C, TLI.getPointerTy());
13693 unsigned Alignment = cast<ConstantPoolSDNode>(CP)->getAlignment();
13694 SDValue Ld = DAG.getLoad(Cst.getValueType(), DL, DAG.getEntryNode(), CP,
13695 MachinePointerInfo::getConstantPool(),
13696 false, false, false, Alignment);
13698 SDValue Brcst = DAG.getNode(X86ISD::VBROADCASTM, DL, ExtVT, In, Ld);
13699 if (VT.is512BitVector())
13701 return DAG.getNode(X86ISD::VTRUNC, DL, VT, Brcst);
13704 static SDValue LowerANY_EXTEND(SDValue Op, const X86Subtarget *Subtarget,
13705 SelectionDAG &DAG) {
13706 if (Subtarget->hasFp256()) {
13707 SDValue Res = LowerAVXExtend(Op, DAG, Subtarget);
13715 static SDValue LowerZERO_EXTEND(SDValue Op, const X86Subtarget *Subtarget,
13716 SelectionDAG &DAG) {
13718 MVT VT = Op.getSimpleValueType();
13719 SDValue In = Op.getOperand(0);
13720 MVT SVT = In.getSimpleValueType();
13722 if (VT.is512BitVector() || SVT.getVectorElementType() == MVT::i1)
13723 return LowerZERO_EXTEND_AVX512(Op, DAG);
13725 if (Subtarget->hasFp256()) {
13726 SDValue Res = LowerAVXExtend(Op, DAG, Subtarget);
13731 assert(!VT.is256BitVector() || !SVT.is128BitVector() ||
13732 VT.getVectorNumElements() != SVT.getVectorNumElements());
13736 SDValue X86TargetLowering::LowerTRUNCATE(SDValue Op, SelectionDAG &DAG) const {
13738 MVT VT = Op.getSimpleValueType();
13739 SDValue In = Op.getOperand(0);
13740 MVT InVT = In.getSimpleValueType();
13742 if (VT == MVT::i1) {
13743 assert((InVT.isInteger() && (InVT.getSizeInBits() <= 64)) &&
13744 "Invalid scalar TRUNCATE operation");
13745 if (InVT.getSizeInBits() >= 32)
13747 In = DAG.getNode(ISD::ANY_EXTEND, DL, MVT::i32, In);
13748 return DAG.getNode(ISD::TRUNCATE, DL, VT, In);
13750 assert(VT.getVectorNumElements() == InVT.getVectorNumElements() &&
13751 "Invalid TRUNCATE operation");
13753 if (InVT.is512BitVector() || VT.getVectorElementType() == MVT::i1) {
13754 if (VT.getVectorElementType().getSizeInBits() >=8)
13755 return DAG.getNode(X86ISD::VTRUNC, DL, VT, In);
13757 assert(VT.getVectorElementType() == MVT::i1 && "Unexpected vector type");
13758 unsigned NumElts = InVT.getVectorNumElements();
13759 assert ((NumElts == 8 || NumElts == 16) && "Unexpected vector type");
13760 if (InVT.getSizeInBits() < 512) {
13761 MVT ExtVT = (NumElts == 16)? MVT::v16i32 : MVT::v8i64;
13762 In = DAG.getNode(ISD::SIGN_EXTEND, DL, ExtVT, In);
13766 SDValue Cst = DAG.getTargetConstant(1, InVT.getVectorElementType());
13767 const Constant *C = (dyn_cast<ConstantSDNode>(Cst))->getConstantIntValue();
13768 SDValue CP = DAG.getConstantPool(C, getPointerTy());
13769 unsigned Alignment = cast<ConstantPoolSDNode>(CP)->getAlignment();
13770 SDValue Ld = DAG.getLoad(Cst.getValueType(), DL, DAG.getEntryNode(), CP,
13771 MachinePointerInfo::getConstantPool(),
13772 false, false, false, Alignment);
13773 SDValue OneV = DAG.getNode(X86ISD::VBROADCAST, DL, InVT, Ld);
13774 SDValue And = DAG.getNode(ISD::AND, DL, InVT, OneV, In);
13775 return DAG.getNode(X86ISD::TESTM, DL, VT, And, And);
13778 if ((VT == MVT::v4i32) && (InVT == MVT::v4i64)) {
13779 // On AVX2, v4i64 -> v4i32 becomes VPERMD.
13780 if (Subtarget->hasInt256()) {
13781 static const int ShufMask[] = {0, 2, 4, 6, -1, -1, -1, -1};
13782 In = DAG.getNode(ISD::BITCAST, DL, MVT::v8i32, In);
13783 In = DAG.getVectorShuffle(MVT::v8i32, DL, In, DAG.getUNDEF(MVT::v8i32),
13785 return DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, VT, In,
13786 DAG.getIntPtrConstant(0));
13789 SDValue OpLo = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, MVT::v2i64, In,
13790 DAG.getIntPtrConstant(0));
13791 SDValue OpHi = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, MVT::v2i64, In,
13792 DAG.getIntPtrConstant(2));
13793 OpLo = DAG.getNode(ISD::BITCAST, DL, MVT::v4i32, OpLo);
13794 OpHi = DAG.getNode(ISD::BITCAST, DL, MVT::v4i32, OpHi);
13795 static const int ShufMask[] = {0, 2, 4, 6};
13796 return DAG.getVectorShuffle(VT, DL, OpLo, OpHi, ShufMask);
13799 if ((VT == MVT::v8i16) && (InVT == MVT::v8i32)) {
13800 // On AVX2, v8i32 -> v8i16 becomed PSHUFB.
13801 if (Subtarget->hasInt256()) {
13802 In = DAG.getNode(ISD::BITCAST, DL, MVT::v32i8, In);
13804 SmallVector<SDValue,32> pshufbMask;
13805 for (unsigned i = 0; i < 2; ++i) {
13806 pshufbMask.push_back(DAG.getConstant(0x0, MVT::i8));
13807 pshufbMask.push_back(DAG.getConstant(0x1, MVT::i8));
13808 pshufbMask.push_back(DAG.getConstant(0x4, MVT::i8));
13809 pshufbMask.push_back(DAG.getConstant(0x5, MVT::i8));
13810 pshufbMask.push_back(DAG.getConstant(0x8, MVT::i8));
13811 pshufbMask.push_back(DAG.getConstant(0x9, MVT::i8));
13812 pshufbMask.push_back(DAG.getConstant(0xc, MVT::i8));
13813 pshufbMask.push_back(DAG.getConstant(0xd, MVT::i8));
13814 for (unsigned j = 0; j < 8; ++j)
13815 pshufbMask.push_back(DAG.getConstant(0x80, MVT::i8));
13817 SDValue BV = DAG.getNode(ISD::BUILD_VECTOR, DL, MVT::v32i8, pshufbMask);
13818 In = DAG.getNode(X86ISD::PSHUFB, DL, MVT::v32i8, In, BV);
13819 In = DAG.getNode(ISD::BITCAST, DL, MVT::v4i64, In);
13821 static const int ShufMask[] = {0, 2, -1, -1};
13822 In = DAG.getVectorShuffle(MVT::v4i64, DL, In, DAG.getUNDEF(MVT::v4i64),
13824 In = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, MVT::v2i64, In,
13825 DAG.getIntPtrConstant(0));
13826 return DAG.getNode(ISD::BITCAST, DL, VT, In);
13829 SDValue OpLo = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, MVT::v4i32, In,
13830 DAG.getIntPtrConstant(0));
13832 SDValue OpHi = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, MVT::v4i32, In,
13833 DAG.getIntPtrConstant(4));
13835 OpLo = DAG.getNode(ISD::BITCAST, DL, MVT::v16i8, OpLo);
13836 OpHi = DAG.getNode(ISD::BITCAST, DL, MVT::v16i8, OpHi);
13838 // The PSHUFB mask:
13839 static const int ShufMask1[] = {0, 1, 4, 5, 8, 9, 12, 13,
13840 -1, -1, -1, -1, -1, -1, -1, -1};
13842 SDValue Undef = DAG.getUNDEF(MVT::v16i8);
13843 OpLo = DAG.getVectorShuffle(MVT::v16i8, DL, OpLo, Undef, ShufMask1);
13844 OpHi = DAG.getVectorShuffle(MVT::v16i8, DL, OpHi, Undef, ShufMask1);
13846 OpLo = DAG.getNode(ISD::BITCAST, DL, MVT::v4i32, OpLo);
13847 OpHi = DAG.getNode(ISD::BITCAST, DL, MVT::v4i32, OpHi);
13849 // The MOVLHPS Mask:
13850 static const int ShufMask2[] = {0, 1, 4, 5};
13851 SDValue res = DAG.getVectorShuffle(MVT::v4i32, DL, OpLo, OpHi, ShufMask2);
13852 return DAG.getNode(ISD::BITCAST, DL, MVT::v8i16, res);
13855 // Handle truncation of V256 to V128 using shuffles.
13856 if (!VT.is128BitVector() || !InVT.is256BitVector())
13859 assert(Subtarget->hasFp256() && "256-bit vector without AVX!");
13861 unsigned NumElems = VT.getVectorNumElements();
13862 MVT NVT = MVT::getVectorVT(VT.getVectorElementType(), NumElems * 2);
13864 SmallVector<int, 16> MaskVec(NumElems * 2, -1);
13865 // Prepare truncation shuffle mask
13866 for (unsigned i = 0; i != NumElems; ++i)
13867 MaskVec[i] = i * 2;
13868 SDValue V = DAG.getVectorShuffle(NVT, DL,
13869 DAG.getNode(ISD::BITCAST, DL, NVT, In),
13870 DAG.getUNDEF(NVT), &MaskVec[0]);
13871 return DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, VT, V,
13872 DAG.getIntPtrConstant(0));
13875 SDValue X86TargetLowering::LowerFP_TO_SINT(SDValue Op,
13876 SelectionDAG &DAG) const {
13877 assert(!Op.getSimpleValueType().isVector());
13879 std::pair<SDValue,SDValue> Vals = FP_TO_INTHelper(Op, DAG,
13880 /*IsSigned=*/ true, /*IsReplace=*/ false);
13881 SDValue FIST = Vals.first, StackSlot = Vals.second;
13882 // If FP_TO_INTHelper failed, the node is actually supposed to be Legal.
13883 if (!FIST.getNode()) return Op;
13885 if (StackSlot.getNode())
13886 // Load the result.
13887 return DAG.getLoad(Op.getValueType(), SDLoc(Op),
13888 FIST, StackSlot, MachinePointerInfo(),
13889 false, false, false, 0);
13891 // The node is the result.
13895 SDValue X86TargetLowering::LowerFP_TO_UINT(SDValue Op,
13896 SelectionDAG &DAG) const {
13897 std::pair<SDValue,SDValue> Vals = FP_TO_INTHelper(Op, DAG,
13898 /*IsSigned=*/ false, /*IsReplace=*/ false);
13899 SDValue FIST = Vals.first, StackSlot = Vals.second;
13900 assert(FIST.getNode() && "Unexpected failure");
13902 if (StackSlot.getNode())
13903 // Load the result.
13904 return DAG.getLoad(Op.getValueType(), SDLoc(Op),
13905 FIST, StackSlot, MachinePointerInfo(),
13906 false, false, false, 0);
13908 // The node is the result.
13912 static SDValue LowerFP_EXTEND(SDValue Op, SelectionDAG &DAG) {
13914 MVT VT = Op.getSimpleValueType();
13915 SDValue In = Op.getOperand(0);
13916 MVT SVT = In.getSimpleValueType();
13918 assert(SVT == MVT::v2f32 && "Only customize MVT::v2f32 type legalization!");
13920 return DAG.getNode(X86ISD::VFPEXT, DL, VT,
13921 DAG.getNode(ISD::CONCAT_VECTORS, DL, MVT::v4f32,
13922 In, DAG.getUNDEF(SVT)));
13925 /// The only differences between FABS and FNEG are the mask and the logic op.
13926 /// FNEG also has a folding opportunity for FNEG(FABS(x)).
13927 static SDValue LowerFABSorFNEG(SDValue Op, SelectionDAG &DAG) {
13928 assert((Op.getOpcode() == ISD::FABS || Op.getOpcode() == ISD::FNEG) &&
13929 "Wrong opcode for lowering FABS or FNEG.");
13931 bool IsFABS = (Op.getOpcode() == ISD::FABS);
13933 // If this is a FABS and it has an FNEG user, bail out to fold the combination
13934 // into an FNABS. We'll lower the FABS after that if it is still in use.
13936 for (SDNode *User : Op->uses())
13937 if (User->getOpcode() == ISD::FNEG)
13940 SDValue Op0 = Op.getOperand(0);
13941 bool IsFNABS = !IsFABS && (Op0.getOpcode() == ISD::FABS);
13944 MVT VT = Op.getSimpleValueType();
13945 // Assume scalar op for initialization; update for vector if needed.
13946 // Note that there are no scalar bitwise logical SSE/AVX instructions, so we
13947 // generate a 16-byte vector constant and logic op even for the scalar case.
13948 // Using a 16-byte mask allows folding the load of the mask with
13949 // the logic op, so it can save (~4 bytes) on code size.
13951 unsigned NumElts = VT == MVT::f64 ? 2 : 4;
13952 // FIXME: Use function attribute "OptimizeForSize" and/or CodeGenOpt::Level to
13953 // decide if we should generate a 16-byte constant mask when we only need 4 or
13954 // 8 bytes for the scalar case.
13955 if (VT.isVector()) {
13956 EltVT = VT.getVectorElementType();
13957 NumElts = VT.getVectorNumElements();
13960 unsigned EltBits = EltVT.getSizeInBits();
13961 LLVMContext *Context = DAG.getContext();
13962 // For FABS, mask is 0x7f...; for FNEG, mask is 0x80...
13964 IsFABS ? APInt::getSignedMaxValue(EltBits) : APInt::getSignBit(EltBits);
13965 Constant *C = ConstantInt::get(*Context, MaskElt);
13966 C = ConstantVector::getSplat(NumElts, C);
13967 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
13968 SDValue CPIdx = DAG.getConstantPool(C, TLI.getPointerTy());
13969 unsigned Alignment = cast<ConstantPoolSDNode>(CPIdx)->getAlignment();
13970 SDValue Mask = DAG.getLoad(VT, dl, DAG.getEntryNode(), CPIdx,
13971 MachinePointerInfo::getConstantPool(),
13972 false, false, false, Alignment);
13974 if (VT.isVector()) {
13975 // For a vector, cast operands to a vector type, perform the logic op,
13976 // and cast the result back to the original value type.
13977 MVT VecVT = MVT::getVectorVT(MVT::i64, VT.getSizeInBits() / 64);
13978 SDValue MaskCasted = DAG.getNode(ISD::BITCAST, dl, VecVT, Mask);
13979 SDValue Operand = IsFNABS ?
13980 DAG.getNode(ISD::BITCAST, dl, VecVT, Op0.getOperand(0)) :
13981 DAG.getNode(ISD::BITCAST, dl, VecVT, Op0);
13982 unsigned BitOp = IsFABS ? ISD::AND : IsFNABS ? ISD::OR : ISD::XOR;
13983 return DAG.getNode(ISD::BITCAST, dl, VT,
13984 DAG.getNode(BitOp, dl, VecVT, Operand, MaskCasted));
13987 // If not vector, then scalar.
13988 unsigned BitOp = IsFABS ? X86ISD::FAND : IsFNABS ? X86ISD::FOR : X86ISD::FXOR;
13989 SDValue Operand = IsFNABS ? Op0.getOperand(0) : Op0;
13990 return DAG.getNode(BitOp, dl, VT, Operand, Mask);
13993 static SDValue LowerFCOPYSIGN(SDValue Op, SelectionDAG &DAG) {
13994 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
13995 LLVMContext *Context = DAG.getContext();
13996 SDValue Op0 = Op.getOperand(0);
13997 SDValue Op1 = Op.getOperand(1);
13999 MVT VT = Op.getSimpleValueType();
14000 MVT SrcVT = Op1.getSimpleValueType();
14002 // If second operand is smaller, extend it first.
14003 if (SrcVT.bitsLT(VT)) {
14004 Op1 = DAG.getNode(ISD::FP_EXTEND, dl, VT, Op1);
14007 // And if it is bigger, shrink it first.
14008 if (SrcVT.bitsGT(VT)) {
14009 Op1 = DAG.getNode(ISD::FP_ROUND, dl, VT, Op1, DAG.getIntPtrConstant(1));
14013 // At this point the operands and the result should have the same
14014 // type, and that won't be f80 since that is not custom lowered.
14016 // First get the sign bit of second operand.
14017 SmallVector<Constant*,4> CV;
14018 if (SrcVT == MVT::f64) {
14019 const fltSemantics &Sem = APFloat::IEEEdouble;
14020 CV.push_back(ConstantFP::get(*Context, APFloat(Sem, APInt(64, 1ULL << 63))));
14021 CV.push_back(ConstantFP::get(*Context, APFloat(Sem, APInt(64, 0))));
14023 const fltSemantics &Sem = APFloat::IEEEsingle;
14024 CV.push_back(ConstantFP::get(*Context, APFloat(Sem, APInt(32, 1U << 31))));
14025 CV.push_back(ConstantFP::get(*Context, APFloat(Sem, APInt(32, 0))));
14026 CV.push_back(ConstantFP::get(*Context, APFloat(Sem, APInt(32, 0))));
14027 CV.push_back(ConstantFP::get(*Context, APFloat(Sem, APInt(32, 0))));
14029 Constant *C = ConstantVector::get(CV);
14030 SDValue CPIdx = DAG.getConstantPool(C, TLI.getPointerTy(), 16);
14031 SDValue Mask1 = DAG.getLoad(SrcVT, dl, DAG.getEntryNode(), CPIdx,
14032 MachinePointerInfo::getConstantPool(),
14033 false, false, false, 16);
14034 SDValue SignBit = DAG.getNode(X86ISD::FAND, dl, SrcVT, Op1, Mask1);
14036 // Shift sign bit right or left if the two operands have different types.
14037 if (SrcVT.bitsGT(VT)) {
14038 // Op0 is MVT::f32, Op1 is MVT::f64.
14039 SignBit = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, MVT::v2f64, SignBit);
14040 SignBit = DAG.getNode(X86ISD::FSRL, dl, MVT::v2f64, SignBit,
14041 DAG.getConstant(32, MVT::i32));
14042 SignBit = DAG.getNode(ISD::BITCAST, dl, MVT::v4f32, SignBit);
14043 SignBit = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::f32, SignBit,
14044 DAG.getIntPtrConstant(0));
14047 // Clear first operand sign bit.
14049 if (VT == MVT::f64) {
14050 const fltSemantics &Sem = APFloat::IEEEdouble;
14051 CV.push_back(ConstantFP::get(*Context, APFloat(Sem,
14052 APInt(64, ~(1ULL << 63)))));
14053 CV.push_back(ConstantFP::get(*Context, APFloat(Sem, APInt(64, 0))));
14055 const fltSemantics &Sem = APFloat::IEEEsingle;
14056 CV.push_back(ConstantFP::get(*Context, APFloat(Sem,
14057 APInt(32, ~(1U << 31)))));
14058 CV.push_back(ConstantFP::get(*Context, APFloat(Sem, APInt(32, 0))));
14059 CV.push_back(ConstantFP::get(*Context, APFloat(Sem, APInt(32, 0))));
14060 CV.push_back(ConstantFP::get(*Context, APFloat(Sem, APInt(32, 0))));
14062 C = ConstantVector::get(CV);
14063 CPIdx = DAG.getConstantPool(C, TLI.getPointerTy(), 16);
14064 SDValue Mask2 = DAG.getLoad(VT, dl, DAG.getEntryNode(), CPIdx,
14065 MachinePointerInfo::getConstantPool(),
14066 false, false, false, 16);
14067 SDValue Val = DAG.getNode(X86ISD::FAND, dl, VT, Op0, Mask2);
14069 // Or the value with the sign bit.
14070 return DAG.getNode(X86ISD::FOR, dl, VT, Val, SignBit);
14073 static SDValue LowerFGETSIGN(SDValue Op, SelectionDAG &DAG) {
14074 SDValue N0 = Op.getOperand(0);
14076 MVT VT = Op.getSimpleValueType();
14078 // Lower ISD::FGETSIGN to (AND (X86ISD::FGETSIGNx86 ...) 1).
14079 SDValue xFGETSIGN = DAG.getNode(X86ISD::FGETSIGNx86, dl, VT, N0,
14080 DAG.getConstant(1, VT));
14081 return DAG.getNode(ISD::AND, dl, VT, xFGETSIGN, DAG.getConstant(1, VT));
14084 // Check whether an OR'd tree is PTEST-able.
14085 static SDValue LowerVectorAllZeroTest(SDValue Op, const X86Subtarget *Subtarget,
14086 SelectionDAG &DAG) {
14087 assert(Op.getOpcode() == ISD::OR && "Only check OR'd tree.");
14089 if (!Subtarget->hasSSE41())
14092 if (!Op->hasOneUse())
14095 SDNode *N = Op.getNode();
14098 SmallVector<SDValue, 8> Opnds;
14099 DenseMap<SDValue, unsigned> VecInMap;
14100 SmallVector<SDValue, 8> VecIns;
14101 EVT VT = MVT::Other;
14103 // Recognize a special case where a vector is casted into wide integer to
14105 Opnds.push_back(N->getOperand(0));
14106 Opnds.push_back(N->getOperand(1));
14108 for (unsigned Slot = 0, e = Opnds.size(); Slot < e; ++Slot) {
14109 SmallVectorImpl<SDValue>::const_iterator I = Opnds.begin() + Slot;
14110 // BFS traverse all OR'd operands.
14111 if (I->getOpcode() == ISD::OR) {
14112 Opnds.push_back(I->getOperand(0));
14113 Opnds.push_back(I->getOperand(1));
14114 // Re-evaluate the number of nodes to be traversed.
14115 e += 2; // 2 more nodes (LHS and RHS) are pushed.
14119 // Quit if a non-EXTRACT_VECTOR_ELT
14120 if (I->getOpcode() != ISD::EXTRACT_VECTOR_ELT)
14123 // Quit if without a constant index.
14124 SDValue Idx = I->getOperand(1);
14125 if (!isa<ConstantSDNode>(Idx))
14128 SDValue ExtractedFromVec = I->getOperand(0);
14129 DenseMap<SDValue, unsigned>::iterator M = VecInMap.find(ExtractedFromVec);
14130 if (M == VecInMap.end()) {
14131 VT = ExtractedFromVec.getValueType();
14132 // Quit if not 128/256-bit vector.
14133 if (!VT.is128BitVector() && !VT.is256BitVector())
14135 // Quit if not the same type.
14136 if (VecInMap.begin() != VecInMap.end() &&
14137 VT != VecInMap.begin()->first.getValueType())
14139 M = VecInMap.insert(std::make_pair(ExtractedFromVec, 0)).first;
14140 VecIns.push_back(ExtractedFromVec);
14142 M->second |= 1U << cast<ConstantSDNode>(Idx)->getZExtValue();
14145 assert((VT.is128BitVector() || VT.is256BitVector()) &&
14146 "Not extracted from 128-/256-bit vector.");
14148 unsigned FullMask = (1U << VT.getVectorNumElements()) - 1U;
14150 for (DenseMap<SDValue, unsigned>::const_iterator
14151 I = VecInMap.begin(), E = VecInMap.end(); I != E; ++I) {
14152 // Quit if not all elements are used.
14153 if (I->second != FullMask)
14157 EVT TestVT = VT.is128BitVector() ? MVT::v2i64 : MVT::v4i64;
14159 // Cast all vectors into TestVT for PTEST.
14160 for (unsigned i = 0, e = VecIns.size(); i < e; ++i)
14161 VecIns[i] = DAG.getNode(ISD::BITCAST, DL, TestVT, VecIns[i]);
14163 // If more than one full vectors are evaluated, OR them first before PTEST.
14164 for (unsigned Slot = 0, e = VecIns.size(); e - Slot > 1; Slot += 2, e += 1) {
14165 // Each iteration will OR 2 nodes and append the result until there is only
14166 // 1 node left, i.e. the final OR'd value of all vectors.
14167 SDValue LHS = VecIns[Slot];
14168 SDValue RHS = VecIns[Slot + 1];
14169 VecIns.push_back(DAG.getNode(ISD::OR, DL, TestVT, LHS, RHS));
14172 return DAG.getNode(X86ISD::PTEST, DL, MVT::i32,
14173 VecIns.back(), VecIns.back());
14176 /// \brief return true if \c Op has a use that doesn't just read flags.
14177 static bool hasNonFlagsUse(SDValue Op) {
14178 for (SDNode::use_iterator UI = Op->use_begin(), UE = Op->use_end(); UI != UE;
14180 SDNode *User = *UI;
14181 unsigned UOpNo = UI.getOperandNo();
14182 if (User->getOpcode() == ISD::TRUNCATE && User->hasOneUse()) {
14183 // Look pass truncate.
14184 UOpNo = User->use_begin().getOperandNo();
14185 User = *User->use_begin();
14188 if (User->getOpcode() != ISD::BRCOND && User->getOpcode() != ISD::SETCC &&
14189 !(User->getOpcode() == ISD::SELECT && UOpNo == 0))
14195 /// Emit nodes that will be selected as "test Op0,Op0", or something
14197 SDValue X86TargetLowering::EmitTest(SDValue Op, unsigned X86CC, SDLoc dl,
14198 SelectionDAG &DAG) const {
14199 if (Op.getValueType() == MVT::i1)
14200 // KORTEST instruction should be selected
14201 return DAG.getNode(X86ISD::CMP, dl, MVT::i32, Op,
14202 DAG.getConstant(0, Op.getValueType()));
14204 // CF and OF aren't always set the way we want. Determine which
14205 // of these we need.
14206 bool NeedCF = false;
14207 bool NeedOF = false;
14210 case X86::COND_A: case X86::COND_AE:
14211 case X86::COND_B: case X86::COND_BE:
14214 case X86::COND_G: case X86::COND_GE:
14215 case X86::COND_L: case X86::COND_LE:
14216 case X86::COND_O: case X86::COND_NO: {
14217 // Check if we really need to set the
14218 // Overflow flag. If NoSignedWrap is present
14219 // that is not actually needed.
14220 switch (Op->getOpcode()) {
14225 const BinaryWithFlagsSDNode *BinNode =
14226 cast<BinaryWithFlagsSDNode>(Op.getNode());
14227 if (BinNode->hasNoSignedWrap())
14237 // See if we can use the EFLAGS value from the operand instead of
14238 // doing a separate TEST. TEST always sets OF and CF to 0, so unless
14239 // we prove that the arithmetic won't overflow, we can't use OF or CF.
14240 if (Op.getResNo() != 0 || NeedOF || NeedCF) {
14241 // Emit a CMP with 0, which is the TEST pattern.
14242 //if (Op.getValueType() == MVT::i1)
14243 // return DAG.getNode(X86ISD::CMP, dl, MVT::i1, Op,
14244 // DAG.getConstant(0, MVT::i1));
14245 return DAG.getNode(X86ISD::CMP, dl, MVT::i32, Op,
14246 DAG.getConstant(0, Op.getValueType()));
14248 unsigned Opcode = 0;
14249 unsigned NumOperands = 0;
14251 // Truncate operations may prevent the merge of the SETCC instruction
14252 // and the arithmetic instruction before it. Attempt to truncate the operands
14253 // of the arithmetic instruction and use a reduced bit-width instruction.
14254 bool NeedTruncation = false;
14255 SDValue ArithOp = Op;
14256 if (Op->getOpcode() == ISD::TRUNCATE && Op->hasOneUse()) {
14257 SDValue Arith = Op->getOperand(0);
14258 // Both the trunc and the arithmetic op need to have one user each.
14259 if (Arith->hasOneUse())
14260 switch (Arith.getOpcode()) {
14267 NeedTruncation = true;
14273 // NOTICE: In the code below we use ArithOp to hold the arithmetic operation
14274 // which may be the result of a CAST. We use the variable 'Op', which is the
14275 // non-casted variable when we check for possible users.
14276 switch (ArithOp.getOpcode()) {
14278 // Due to an isel shortcoming, be conservative if this add is likely to be
14279 // selected as part of a load-modify-store instruction. When the root node
14280 // in a match is a store, isel doesn't know how to remap non-chain non-flag
14281 // uses of other nodes in the match, such as the ADD in this case. This
14282 // leads to the ADD being left around and reselected, with the result being
14283 // two adds in the output. Alas, even if none our users are stores, that
14284 // doesn't prove we're O.K. Ergo, if we have any parents that aren't
14285 // CopyToReg or SETCC, eschew INC/DEC. A better fix seems to require
14286 // climbing the DAG back to the root, and it doesn't seem to be worth the
14288 for (SDNode::use_iterator UI = Op.getNode()->use_begin(),
14289 UE = Op.getNode()->use_end(); UI != UE; ++UI)
14290 if (UI->getOpcode() != ISD::CopyToReg &&
14291 UI->getOpcode() != ISD::SETCC &&
14292 UI->getOpcode() != ISD::STORE)
14295 if (ConstantSDNode *C =
14296 dyn_cast<ConstantSDNode>(ArithOp.getNode()->getOperand(1))) {
14297 // An add of one will be selected as an INC.
14298 if (C->getAPIntValue() == 1 && !Subtarget->slowIncDec()) {
14299 Opcode = X86ISD::INC;
14304 // An add of negative one (subtract of one) will be selected as a DEC.
14305 if (C->getAPIntValue().isAllOnesValue() && !Subtarget->slowIncDec()) {
14306 Opcode = X86ISD::DEC;
14312 // Otherwise use a regular EFLAGS-setting add.
14313 Opcode = X86ISD::ADD;
14318 // If we have a constant logical shift that's only used in a comparison
14319 // against zero turn it into an equivalent AND. This allows turning it into
14320 // a TEST instruction later.
14321 if ((X86CC == X86::COND_E || X86CC == X86::COND_NE) && Op->hasOneUse() &&
14322 isa<ConstantSDNode>(Op->getOperand(1)) && !hasNonFlagsUse(Op)) {
14323 EVT VT = Op.getValueType();
14324 unsigned BitWidth = VT.getSizeInBits();
14325 unsigned ShAmt = Op->getConstantOperandVal(1);
14326 if (ShAmt >= BitWidth) // Avoid undefined shifts.
14328 APInt Mask = ArithOp.getOpcode() == ISD::SRL
14329 ? APInt::getHighBitsSet(BitWidth, BitWidth - ShAmt)
14330 : APInt::getLowBitsSet(BitWidth, BitWidth - ShAmt);
14331 if (!Mask.isSignedIntN(32)) // Avoid large immediates.
14333 SDValue New = DAG.getNode(ISD::AND, dl, VT, Op->getOperand(0),
14334 DAG.getConstant(Mask, VT));
14335 DAG.ReplaceAllUsesWith(Op, New);
14341 // If the primary and result isn't used, don't bother using X86ISD::AND,
14342 // because a TEST instruction will be better.
14343 if (!hasNonFlagsUse(Op))
14349 // Due to the ISEL shortcoming noted above, be conservative if this op is
14350 // likely to be selected as part of a load-modify-store instruction.
14351 for (SDNode::use_iterator UI = Op.getNode()->use_begin(),
14352 UE = Op.getNode()->use_end(); UI != UE; ++UI)
14353 if (UI->getOpcode() == ISD::STORE)
14356 // Otherwise use a regular EFLAGS-setting instruction.
14357 switch (ArithOp.getOpcode()) {
14358 default: llvm_unreachable("unexpected operator!");
14359 case ISD::SUB: Opcode = X86ISD::SUB; break;
14360 case ISD::XOR: Opcode = X86ISD::XOR; break;
14361 case ISD::AND: Opcode = X86ISD::AND; break;
14363 if (!NeedTruncation && (X86CC == X86::COND_E || X86CC == X86::COND_NE)) {
14364 SDValue EFLAGS = LowerVectorAllZeroTest(Op, Subtarget, DAG);
14365 if (EFLAGS.getNode())
14368 Opcode = X86ISD::OR;
14382 return SDValue(Op.getNode(), 1);
14388 // If we found that truncation is beneficial, perform the truncation and
14390 if (NeedTruncation) {
14391 EVT VT = Op.getValueType();
14392 SDValue WideVal = Op->getOperand(0);
14393 EVT WideVT = WideVal.getValueType();
14394 unsigned ConvertedOp = 0;
14395 // Use a target machine opcode to prevent further DAGCombine
14396 // optimizations that may separate the arithmetic operations
14397 // from the setcc node.
14398 switch (WideVal.getOpcode()) {
14400 case ISD::ADD: ConvertedOp = X86ISD::ADD; break;
14401 case ISD::SUB: ConvertedOp = X86ISD::SUB; break;
14402 case ISD::AND: ConvertedOp = X86ISD::AND; break;
14403 case ISD::OR: ConvertedOp = X86ISD::OR; break;
14404 case ISD::XOR: ConvertedOp = X86ISD::XOR; break;
14408 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
14409 if (TLI.isOperationLegal(WideVal.getOpcode(), WideVT)) {
14410 SDValue V0 = DAG.getNode(ISD::TRUNCATE, dl, VT, WideVal.getOperand(0));
14411 SDValue V1 = DAG.getNode(ISD::TRUNCATE, dl, VT, WideVal.getOperand(1));
14412 Op = DAG.getNode(ConvertedOp, dl, VT, V0, V1);
14418 // Emit a CMP with 0, which is the TEST pattern.
14419 return DAG.getNode(X86ISD::CMP, dl, MVT::i32, Op,
14420 DAG.getConstant(0, Op.getValueType()));
14422 SDVTList VTs = DAG.getVTList(Op.getValueType(), MVT::i32);
14423 SmallVector<SDValue, 4> Ops;
14424 for (unsigned i = 0; i != NumOperands; ++i)
14425 Ops.push_back(Op.getOperand(i));
14427 SDValue New = DAG.getNode(Opcode, dl, VTs, Ops);
14428 DAG.ReplaceAllUsesWith(Op, New);
14429 return SDValue(New.getNode(), 1);
14432 /// Emit nodes that will be selected as "cmp Op0,Op1", or something
14434 SDValue X86TargetLowering::EmitCmp(SDValue Op0, SDValue Op1, unsigned X86CC,
14435 SDLoc dl, SelectionDAG &DAG) const {
14436 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op1)) {
14437 if (C->getAPIntValue() == 0)
14438 return EmitTest(Op0, X86CC, dl, DAG);
14440 if (Op0.getValueType() == MVT::i1)
14441 llvm_unreachable("Unexpected comparison operation for MVT::i1 operands");
14444 if ((Op0.getValueType() == MVT::i8 || Op0.getValueType() == MVT::i16 ||
14445 Op0.getValueType() == MVT::i32 || Op0.getValueType() == MVT::i64)) {
14446 // Do the comparison at i32 if it's smaller, besides the Atom case.
14447 // This avoids subregister aliasing issues. Keep the smaller reference
14448 // if we're optimizing for size, however, as that'll allow better folding
14449 // of memory operations.
14450 if (Op0.getValueType() != MVT::i32 && Op0.getValueType() != MVT::i64 &&
14451 !DAG.getMachineFunction().getFunction()->getAttributes().hasAttribute(
14452 AttributeSet::FunctionIndex, Attribute::MinSize) &&
14453 !Subtarget->isAtom()) {
14454 unsigned ExtendOp =
14455 isX86CCUnsigned(X86CC) ? ISD::ZERO_EXTEND : ISD::SIGN_EXTEND;
14456 Op0 = DAG.getNode(ExtendOp, dl, MVT::i32, Op0);
14457 Op1 = DAG.getNode(ExtendOp, dl, MVT::i32, Op1);
14459 // Use SUB instead of CMP to enable CSE between SUB and CMP.
14460 SDVTList VTs = DAG.getVTList(Op0.getValueType(), MVT::i32);
14461 SDValue Sub = DAG.getNode(X86ISD::SUB, dl, VTs,
14463 return SDValue(Sub.getNode(), 1);
14465 return DAG.getNode(X86ISD::CMP, dl, MVT::i32, Op0, Op1);
14468 /// Convert a comparison if required by the subtarget.
14469 SDValue X86TargetLowering::ConvertCmpIfNecessary(SDValue Cmp,
14470 SelectionDAG &DAG) const {
14471 // If the subtarget does not support the FUCOMI instruction, floating-point
14472 // comparisons have to be converted.
14473 if (Subtarget->hasCMov() ||
14474 Cmp.getOpcode() != X86ISD::CMP ||
14475 !Cmp.getOperand(0).getValueType().isFloatingPoint() ||
14476 !Cmp.getOperand(1).getValueType().isFloatingPoint())
14479 // The instruction selector will select an FUCOM instruction instead of
14480 // FUCOMI, which writes the comparison result to FPSW instead of EFLAGS. Hence
14481 // build an SDNode sequence that transfers the result from FPSW into EFLAGS:
14482 // (X86sahf (trunc (srl (X86fp_stsw (trunc (X86cmp ...)), 8))))
14484 SDValue TruncFPSW = DAG.getNode(ISD::TRUNCATE, dl, MVT::i16, Cmp);
14485 SDValue FNStSW = DAG.getNode(X86ISD::FNSTSW16r, dl, MVT::i16, TruncFPSW);
14486 SDValue Srl = DAG.getNode(ISD::SRL, dl, MVT::i16, FNStSW,
14487 DAG.getConstant(8, MVT::i8));
14488 SDValue TruncSrl = DAG.getNode(ISD::TRUNCATE, dl, MVT::i8, Srl);
14489 return DAG.getNode(X86ISD::SAHF, dl, MVT::i32, TruncSrl);
14492 /// The minimum architected relative accuracy is 2^-12. We need one
14493 /// Newton-Raphson step to have a good float result (24 bits of precision).
14494 SDValue X86TargetLowering::getRsqrtEstimate(SDValue Op,
14495 DAGCombinerInfo &DCI,
14496 unsigned &RefinementSteps,
14497 bool &UseOneConstNR) const {
14498 // FIXME: We should use instruction latency models to calculate the cost of
14499 // each potential sequence, but this is very hard to do reliably because
14500 // at least Intel's Core* chips have variable timing based on the number of
14501 // significant digits in the divisor and/or sqrt operand.
14502 if (!Subtarget->useSqrtEst())
14505 EVT VT = Op.getValueType();
14507 // SSE1 has rsqrtss and rsqrtps.
14508 // TODO: Add support for AVX512 (v16f32).
14509 // It is likely not profitable to do this for f64 because a double-precision
14510 // rsqrt estimate with refinement on x86 prior to FMA requires at least 16
14511 // instructions: convert to single, rsqrtss, convert back to double, refine
14512 // (3 steps = at least 13 insts). If an 'rsqrtsd' variant was added to the ISA
14513 // along with FMA, this could be a throughput win.
14514 if ((Subtarget->hasSSE1() && (VT == MVT::f32 || VT == MVT::v4f32)) ||
14515 (Subtarget->hasAVX() && VT == MVT::v8f32)) {
14516 RefinementSteps = 1;
14517 UseOneConstNR = false;
14518 return DCI.DAG.getNode(X86ISD::FRSQRT, SDLoc(Op), VT, Op);
14523 /// The minimum architected relative accuracy is 2^-12. We need one
14524 /// Newton-Raphson step to have a good float result (24 bits of precision).
14525 SDValue X86TargetLowering::getRecipEstimate(SDValue Op,
14526 DAGCombinerInfo &DCI,
14527 unsigned &RefinementSteps) const {
14528 // FIXME: We should use instruction latency models to calculate the cost of
14529 // each potential sequence, but this is very hard to do reliably because
14530 // at least Intel's Core* chips have variable timing based on the number of
14531 // significant digits in the divisor.
14532 if (!Subtarget->useReciprocalEst())
14535 EVT VT = Op.getValueType();
14537 // SSE1 has rcpss and rcpps. AVX adds a 256-bit variant for rcpps.
14538 // TODO: Add support for AVX512 (v16f32).
14539 // It is likely not profitable to do this for f64 because a double-precision
14540 // reciprocal estimate with refinement on x86 prior to FMA requires
14541 // 15 instructions: convert to single, rcpss, convert back to double, refine
14542 // (3 steps = 12 insts). If an 'rcpsd' variant was added to the ISA
14543 // along with FMA, this could be a throughput win.
14544 if ((Subtarget->hasSSE1() && (VT == MVT::f32 || VT == MVT::v4f32)) ||
14545 (Subtarget->hasAVX() && VT == MVT::v8f32)) {
14546 // TODO: Expose this as a user-configurable parameter to allow for
14547 // speed vs. accuracy flexibility.
14548 RefinementSteps = 1;
14549 return DCI.DAG.getNode(X86ISD::FRCP, SDLoc(Op), VT, Op);
14554 static bool isAllOnes(SDValue V) {
14555 ConstantSDNode *C = dyn_cast<ConstantSDNode>(V);
14556 return C && C->isAllOnesValue();
14559 /// LowerToBT - Result of 'and' is compared against zero. Turn it into a BT node
14560 /// if it's possible.
14561 SDValue X86TargetLowering::LowerToBT(SDValue And, ISD::CondCode CC,
14562 SDLoc dl, SelectionDAG &DAG) const {
14563 SDValue Op0 = And.getOperand(0);
14564 SDValue Op1 = And.getOperand(1);
14565 if (Op0.getOpcode() == ISD::TRUNCATE)
14566 Op0 = Op0.getOperand(0);
14567 if (Op1.getOpcode() == ISD::TRUNCATE)
14568 Op1 = Op1.getOperand(0);
14571 if (Op1.getOpcode() == ISD::SHL)
14572 std::swap(Op0, Op1);
14573 if (Op0.getOpcode() == ISD::SHL) {
14574 if (ConstantSDNode *And00C = dyn_cast<ConstantSDNode>(Op0.getOperand(0)))
14575 if (And00C->getZExtValue() == 1) {
14576 // If we looked past a truncate, check that it's only truncating away
14578 unsigned BitWidth = Op0.getValueSizeInBits();
14579 unsigned AndBitWidth = And.getValueSizeInBits();
14580 if (BitWidth > AndBitWidth) {
14582 DAG.computeKnownBits(Op0, Zeros, Ones);
14583 if (Zeros.countLeadingOnes() < BitWidth - AndBitWidth)
14587 RHS = Op0.getOperand(1);
14589 } else if (Op1.getOpcode() == ISD::Constant) {
14590 ConstantSDNode *AndRHS = cast<ConstantSDNode>(Op1);
14591 uint64_t AndRHSVal = AndRHS->getZExtValue();
14592 SDValue AndLHS = Op0;
14594 if (AndRHSVal == 1 && AndLHS.getOpcode() == ISD::SRL) {
14595 LHS = AndLHS.getOperand(0);
14596 RHS = AndLHS.getOperand(1);
14599 // Use BT if the immediate can't be encoded in a TEST instruction.
14600 if (!isUInt<32>(AndRHSVal) && isPowerOf2_64(AndRHSVal)) {
14602 RHS = DAG.getConstant(Log2_64_Ceil(AndRHSVal), LHS.getValueType());
14606 if (LHS.getNode()) {
14607 // If LHS is i8, promote it to i32 with any_extend. There is no i8 BT
14608 // instruction. Since the shift amount is in-range-or-undefined, we know
14609 // that doing a bittest on the i32 value is ok. We extend to i32 because
14610 // the encoding for the i16 version is larger than the i32 version.
14611 // Also promote i16 to i32 for performance / code size reason.
14612 if (LHS.getValueType() == MVT::i8 ||
14613 LHS.getValueType() == MVT::i16)
14614 LHS = DAG.getNode(ISD::ANY_EXTEND, dl, MVT::i32, LHS);
14616 // If the operand types disagree, extend the shift amount to match. Since
14617 // BT ignores high bits (like shifts) we can use anyextend.
14618 if (LHS.getValueType() != RHS.getValueType())
14619 RHS = DAG.getNode(ISD::ANY_EXTEND, dl, LHS.getValueType(), RHS);
14621 SDValue BT = DAG.getNode(X86ISD::BT, dl, MVT::i32, LHS, RHS);
14622 X86::CondCode Cond = CC == ISD::SETEQ ? X86::COND_AE : X86::COND_B;
14623 return DAG.getNode(X86ISD::SETCC, dl, MVT::i8,
14624 DAG.getConstant(Cond, MVT::i8), BT);
14630 /// \brief - Turns an ISD::CondCode into a value suitable for SSE floating point
14632 static int translateX86FSETCC(ISD::CondCode SetCCOpcode, SDValue &Op0,
14637 // SSE Condition code mapping:
14646 switch (SetCCOpcode) {
14647 default: llvm_unreachable("Unexpected SETCC condition");
14649 case ISD::SETEQ: SSECC = 0; break;
14651 case ISD::SETGT: Swap = true; // Fallthrough
14653 case ISD::SETOLT: SSECC = 1; break;
14655 case ISD::SETGE: Swap = true; // Fallthrough
14657 case ISD::SETOLE: SSECC = 2; break;
14658 case ISD::SETUO: SSECC = 3; break;
14660 case ISD::SETNE: SSECC = 4; break;
14661 case ISD::SETULE: Swap = true; // Fallthrough
14662 case ISD::SETUGE: SSECC = 5; break;
14663 case ISD::SETULT: Swap = true; // Fallthrough
14664 case ISD::SETUGT: SSECC = 6; break;
14665 case ISD::SETO: SSECC = 7; break;
14667 case ISD::SETONE: SSECC = 8; break;
14670 std::swap(Op0, Op1);
14675 // Lower256IntVSETCC - Break a VSETCC 256-bit integer VSETCC into two new 128
14676 // ones, and then concatenate the result back.
14677 static SDValue Lower256IntVSETCC(SDValue Op, SelectionDAG &DAG) {
14678 MVT VT = Op.getSimpleValueType();
14680 assert(VT.is256BitVector() && Op.getOpcode() == ISD::SETCC &&
14681 "Unsupported value type for operation");
14683 unsigned NumElems = VT.getVectorNumElements();
14685 SDValue CC = Op.getOperand(2);
14687 // Extract the LHS vectors
14688 SDValue LHS = Op.getOperand(0);
14689 SDValue LHS1 = Extract128BitVector(LHS, 0, DAG, dl);
14690 SDValue LHS2 = Extract128BitVector(LHS, NumElems/2, DAG, dl);
14692 // Extract the RHS vectors
14693 SDValue RHS = Op.getOperand(1);
14694 SDValue RHS1 = Extract128BitVector(RHS, 0, DAG, dl);
14695 SDValue RHS2 = Extract128BitVector(RHS, NumElems/2, DAG, dl);
14697 // Issue the operation on the smaller types and concatenate the result back
14698 MVT EltVT = VT.getVectorElementType();
14699 MVT NewVT = MVT::getVectorVT(EltVT, NumElems/2);
14700 return DAG.getNode(ISD::CONCAT_VECTORS, dl, VT,
14701 DAG.getNode(Op.getOpcode(), dl, NewVT, LHS1, RHS1, CC),
14702 DAG.getNode(Op.getOpcode(), dl, NewVT, LHS2, RHS2, CC));
14705 static SDValue LowerIntVSETCC_AVX512(SDValue Op, SelectionDAG &DAG,
14706 const X86Subtarget *Subtarget) {
14707 SDValue Op0 = Op.getOperand(0);
14708 SDValue Op1 = Op.getOperand(1);
14709 SDValue CC = Op.getOperand(2);
14710 MVT VT = Op.getSimpleValueType();
14713 assert(Op0.getValueType().getVectorElementType().getSizeInBits() >= 8 &&
14714 Op.getValueType().getScalarType() == MVT::i1 &&
14715 "Cannot set masked compare for this operation");
14717 ISD::CondCode SetCCOpcode = cast<CondCodeSDNode>(CC)->get();
14719 bool Unsigned = false;
14722 switch (SetCCOpcode) {
14723 default: llvm_unreachable("Unexpected SETCC condition");
14724 case ISD::SETNE: SSECC = 4; break;
14725 case ISD::SETEQ: Opc = X86ISD::PCMPEQM; break;
14726 case ISD::SETUGT: SSECC = 6; Unsigned = true; break;
14727 case ISD::SETLT: Swap = true; //fall-through
14728 case ISD::SETGT: Opc = X86ISD::PCMPGTM; break;
14729 case ISD::SETULT: SSECC = 1; Unsigned = true; break;
14730 case ISD::SETUGE: SSECC = 5; Unsigned = true; break; //NLT
14731 case ISD::SETGE: Swap = true; SSECC = 2; break; // LE + swap
14732 case ISD::SETULE: Unsigned = true; //fall-through
14733 case ISD::SETLE: SSECC = 2; break;
14737 std::swap(Op0, Op1);
14739 return DAG.getNode(Opc, dl, VT, Op0, Op1);
14740 Opc = Unsigned ? X86ISD::CMPMU: X86ISD::CMPM;
14741 return DAG.getNode(Opc, dl, VT, Op0, Op1,
14742 DAG.getConstant(SSECC, MVT::i8));
14745 /// \brief Try to turn a VSETULT into a VSETULE by modifying its second
14746 /// operand \p Op1. If non-trivial (for example because it's not constant)
14747 /// return an empty value.
14748 static SDValue ChangeVSETULTtoVSETULE(SDLoc dl, SDValue Op1, SelectionDAG &DAG)
14750 BuildVectorSDNode *BV = dyn_cast<BuildVectorSDNode>(Op1.getNode());
14754 MVT VT = Op1.getSimpleValueType();
14755 MVT EVT = VT.getVectorElementType();
14756 unsigned n = VT.getVectorNumElements();
14757 SmallVector<SDValue, 8> ULTOp1;
14759 for (unsigned i = 0; i < n; ++i) {
14760 ConstantSDNode *Elt = dyn_cast<ConstantSDNode>(BV->getOperand(i));
14761 if (!Elt || Elt->isOpaque() || Elt->getValueType(0) != EVT)
14764 // Avoid underflow.
14765 APInt Val = Elt->getAPIntValue();
14769 ULTOp1.push_back(DAG.getConstant(Val - 1, EVT));
14772 return DAG.getNode(ISD::BUILD_VECTOR, dl, VT, ULTOp1);
14775 static SDValue LowerVSETCC(SDValue Op, const X86Subtarget *Subtarget,
14776 SelectionDAG &DAG) {
14777 SDValue Op0 = Op.getOperand(0);
14778 SDValue Op1 = Op.getOperand(1);
14779 SDValue CC = Op.getOperand(2);
14780 MVT VT = Op.getSimpleValueType();
14781 ISD::CondCode SetCCOpcode = cast<CondCodeSDNode>(CC)->get();
14782 bool isFP = Op.getOperand(1).getSimpleValueType().isFloatingPoint();
14787 MVT EltVT = Op0.getSimpleValueType().getVectorElementType();
14788 assert(EltVT == MVT::f32 || EltVT == MVT::f64);
14791 unsigned SSECC = translateX86FSETCC(SetCCOpcode, Op0, Op1);
14792 unsigned Opc = X86ISD::CMPP;
14793 if (Subtarget->hasAVX512() && VT.getVectorElementType() == MVT::i1) {
14794 assert(VT.getVectorNumElements() <= 16);
14795 Opc = X86ISD::CMPM;
14797 // In the two special cases we can't handle, emit two comparisons.
14800 unsigned CombineOpc;
14801 if (SetCCOpcode == ISD::SETUEQ) {
14802 CC0 = 3; CC1 = 0; CombineOpc = ISD::OR;
14804 assert(SetCCOpcode == ISD::SETONE);
14805 CC0 = 7; CC1 = 4; CombineOpc = ISD::AND;
14808 SDValue Cmp0 = DAG.getNode(Opc, dl, VT, Op0, Op1,
14809 DAG.getConstant(CC0, MVT::i8));
14810 SDValue Cmp1 = DAG.getNode(Opc, dl, VT, Op0, Op1,
14811 DAG.getConstant(CC1, MVT::i8));
14812 return DAG.getNode(CombineOpc, dl, VT, Cmp0, Cmp1);
14814 // Handle all other FP comparisons here.
14815 return DAG.getNode(Opc, dl, VT, Op0, Op1,
14816 DAG.getConstant(SSECC, MVT::i8));
14819 // Break 256-bit integer vector compare into smaller ones.
14820 if (VT.is256BitVector() && !Subtarget->hasInt256())
14821 return Lower256IntVSETCC(Op, DAG);
14823 bool MaskResult = (VT.getVectorElementType() == MVT::i1);
14824 EVT OpVT = Op1.getValueType();
14825 if (Subtarget->hasAVX512()) {
14826 if (Op1.getValueType().is512BitVector() ||
14827 (Subtarget->hasBWI() && Subtarget->hasVLX()) ||
14828 (MaskResult && OpVT.getVectorElementType().getSizeInBits() >= 32))
14829 return LowerIntVSETCC_AVX512(Op, DAG, Subtarget);
14831 // In AVX-512 architecture setcc returns mask with i1 elements,
14832 // But there is no compare instruction for i8 and i16 elements in KNL.
14833 // We are not talking about 512-bit operands in this case, these
14834 // types are illegal.
14836 (OpVT.getVectorElementType().getSizeInBits() < 32 &&
14837 OpVT.getVectorElementType().getSizeInBits() >= 8))
14838 return DAG.getNode(ISD::TRUNCATE, dl, VT,
14839 DAG.getNode(ISD::SETCC, dl, OpVT, Op0, Op1, CC));
14842 // We are handling one of the integer comparisons here. Since SSE only has
14843 // GT and EQ comparisons for integer, swapping operands and multiple
14844 // operations may be required for some comparisons.
14846 bool Swap = false, Invert = false, FlipSigns = false, MinMax = false;
14847 bool Subus = false;
14849 switch (SetCCOpcode) {
14850 default: llvm_unreachable("Unexpected SETCC condition");
14851 case ISD::SETNE: Invert = true;
14852 case ISD::SETEQ: Opc = X86ISD::PCMPEQ; break;
14853 case ISD::SETLT: Swap = true;
14854 case ISD::SETGT: Opc = X86ISD::PCMPGT; break;
14855 case ISD::SETGE: Swap = true;
14856 case ISD::SETLE: Opc = X86ISD::PCMPGT;
14857 Invert = true; break;
14858 case ISD::SETULT: Swap = true;
14859 case ISD::SETUGT: Opc = X86ISD::PCMPGT;
14860 FlipSigns = true; break;
14861 case ISD::SETUGE: Swap = true;
14862 case ISD::SETULE: Opc = X86ISD::PCMPGT;
14863 FlipSigns = true; Invert = true; break;
14866 // Special case: Use min/max operations for SETULE/SETUGE
14867 MVT VET = VT.getVectorElementType();
14869 (Subtarget->hasSSE41() && (VET >= MVT::i8 && VET <= MVT::i32))
14870 || (Subtarget->hasSSE2() && (VET == MVT::i8));
14873 switch (SetCCOpcode) {
14875 case ISD::SETULE: Opc = X86ISD::UMIN; MinMax = true; break;
14876 case ISD::SETUGE: Opc = X86ISD::UMAX; MinMax = true; break;
14879 if (MinMax) { Swap = false; Invert = false; FlipSigns = false; }
14882 bool hasSubus = Subtarget->hasSSE2() && (VET == MVT::i8 || VET == MVT::i16);
14883 if (!MinMax && hasSubus) {
14884 // As another special case, use PSUBUS[BW] when it's profitable. E.g. for
14886 // t = psubus Op0, Op1
14887 // pcmpeq t, <0..0>
14888 switch (SetCCOpcode) {
14890 case ISD::SETULT: {
14891 // If the comparison is against a constant we can turn this into a
14892 // setule. With psubus, setule does not require a swap. This is
14893 // beneficial because the constant in the register is no longer
14894 // destructed as the destination so it can be hoisted out of a loop.
14895 // Only do this pre-AVX since vpcmp* is no longer destructive.
14896 if (Subtarget->hasAVX())
14898 SDValue ULEOp1 = ChangeVSETULTtoVSETULE(dl, Op1, DAG);
14899 if (ULEOp1.getNode()) {
14901 Subus = true; Invert = false; Swap = false;
14905 // Psubus is better than flip-sign because it requires no inversion.
14906 case ISD::SETUGE: Subus = true; Invert = false; Swap = true; break;
14907 case ISD::SETULE: Subus = true; Invert = false; Swap = false; break;
14911 Opc = X86ISD::SUBUS;
14917 std::swap(Op0, Op1);
14919 // Check that the operation in question is available (most are plain SSE2,
14920 // but PCMPGTQ and PCMPEQQ have different requirements).
14921 if (VT == MVT::v2i64) {
14922 if (Opc == X86ISD::PCMPGT && !Subtarget->hasSSE42()) {
14923 assert(Subtarget->hasSSE2() && "Don't know how to lower!");
14925 // First cast everything to the right type.
14926 Op0 = DAG.getNode(ISD::BITCAST, dl, MVT::v4i32, Op0);
14927 Op1 = DAG.getNode(ISD::BITCAST, dl, MVT::v4i32, Op1);
14929 // Since SSE has no unsigned integer comparisons, we need to flip the sign
14930 // bits of the inputs before performing those operations. The lower
14931 // compare is always unsigned.
14934 SB = DAG.getConstant(0x80000000U, MVT::v4i32);
14936 SDValue Sign = DAG.getConstant(0x80000000U, MVT::i32);
14937 SDValue Zero = DAG.getConstant(0x00000000U, MVT::i32);
14938 SB = DAG.getNode(ISD::BUILD_VECTOR, dl, MVT::v4i32,
14939 Sign, Zero, Sign, Zero);
14941 Op0 = DAG.getNode(ISD::XOR, dl, MVT::v4i32, Op0, SB);
14942 Op1 = DAG.getNode(ISD::XOR, dl, MVT::v4i32, Op1, SB);
14944 // Emulate PCMPGTQ with (hi1 > hi2) | ((hi1 == hi2) & (lo1 > lo2))
14945 SDValue GT = DAG.getNode(X86ISD::PCMPGT, dl, MVT::v4i32, Op0, Op1);
14946 SDValue EQ = DAG.getNode(X86ISD::PCMPEQ, dl, MVT::v4i32, Op0, Op1);
14948 // Create masks for only the low parts/high parts of the 64 bit integers.
14949 static const int MaskHi[] = { 1, 1, 3, 3 };
14950 static const int MaskLo[] = { 0, 0, 2, 2 };
14951 SDValue EQHi = DAG.getVectorShuffle(MVT::v4i32, dl, EQ, EQ, MaskHi);
14952 SDValue GTLo = DAG.getVectorShuffle(MVT::v4i32, dl, GT, GT, MaskLo);
14953 SDValue GTHi = DAG.getVectorShuffle(MVT::v4i32, dl, GT, GT, MaskHi);
14955 SDValue Result = DAG.getNode(ISD::AND, dl, MVT::v4i32, EQHi, GTLo);
14956 Result = DAG.getNode(ISD::OR, dl, MVT::v4i32, Result, GTHi);
14959 Result = DAG.getNOT(dl, Result, MVT::v4i32);
14961 return DAG.getNode(ISD::BITCAST, dl, VT, Result);
14964 if (Opc == X86ISD::PCMPEQ && !Subtarget->hasSSE41()) {
14965 // If pcmpeqq is missing but pcmpeqd is available synthesize pcmpeqq with
14966 // pcmpeqd + pshufd + pand.
14967 assert(Subtarget->hasSSE2() && !FlipSigns && "Don't know how to lower!");
14969 // First cast everything to the right type.
14970 Op0 = DAG.getNode(ISD::BITCAST, dl, MVT::v4i32, Op0);
14971 Op1 = DAG.getNode(ISD::BITCAST, dl, MVT::v4i32, Op1);
14974 SDValue Result = DAG.getNode(Opc, dl, MVT::v4i32, Op0, Op1);
14976 // Make sure the lower and upper halves are both all-ones.
14977 static const int Mask[] = { 1, 0, 3, 2 };
14978 SDValue Shuf = DAG.getVectorShuffle(MVT::v4i32, dl, Result, Result, Mask);
14979 Result = DAG.getNode(ISD::AND, dl, MVT::v4i32, Result, Shuf);
14982 Result = DAG.getNOT(dl, Result, MVT::v4i32);
14984 return DAG.getNode(ISD::BITCAST, dl, VT, Result);
14988 // Since SSE has no unsigned integer comparisons, we need to flip the sign
14989 // bits of the inputs before performing those operations.
14991 EVT EltVT = VT.getVectorElementType();
14992 SDValue SB = DAG.getConstant(APInt::getSignBit(EltVT.getSizeInBits()), VT);
14993 Op0 = DAG.getNode(ISD::XOR, dl, VT, Op0, SB);
14994 Op1 = DAG.getNode(ISD::XOR, dl, VT, Op1, SB);
14997 SDValue Result = DAG.getNode(Opc, dl, VT, Op0, Op1);
14999 // If the logical-not of the result is required, perform that now.
15001 Result = DAG.getNOT(dl, Result, VT);
15004 Result = DAG.getNode(X86ISD::PCMPEQ, dl, VT, Op0, Result);
15007 Result = DAG.getNode(X86ISD::PCMPEQ, dl, VT, Result,
15008 getZeroVector(VT, Subtarget, DAG, dl));
15013 SDValue X86TargetLowering::LowerSETCC(SDValue Op, SelectionDAG &DAG) const {
15015 MVT VT = Op.getSimpleValueType();
15017 if (VT.isVector()) return LowerVSETCC(Op, Subtarget, DAG);
15019 assert(((!Subtarget->hasAVX512() && VT == MVT::i8) || (VT == MVT::i1))
15020 && "SetCC type must be 8-bit or 1-bit integer");
15021 SDValue Op0 = Op.getOperand(0);
15022 SDValue Op1 = Op.getOperand(1);
15024 ISD::CondCode CC = cast<CondCodeSDNode>(Op.getOperand(2))->get();
15026 // Optimize to BT if possible.
15027 // Lower (X & (1 << N)) == 0 to BT(X, N).
15028 // Lower ((X >>u N) & 1) != 0 to BT(X, N).
15029 // Lower ((X >>s N) & 1) != 0 to BT(X, N).
15030 if (Op0.getOpcode() == ISD::AND && Op0.hasOneUse() &&
15031 Op1.getOpcode() == ISD::Constant &&
15032 cast<ConstantSDNode>(Op1)->isNullValue() &&
15033 (CC == ISD::SETEQ || CC == ISD::SETNE)) {
15034 SDValue NewSetCC = LowerToBT(Op0, CC, dl, DAG);
15035 if (NewSetCC.getNode())
15039 // Look for X == 0, X == 1, X != 0, or X != 1. We can simplify some forms of
15041 if (Op1.getOpcode() == ISD::Constant &&
15042 (cast<ConstantSDNode>(Op1)->getZExtValue() == 1 ||
15043 cast<ConstantSDNode>(Op1)->isNullValue()) &&
15044 (CC == ISD::SETEQ || CC == ISD::SETNE)) {
15046 // If the input is a setcc, then reuse the input setcc or use a new one with
15047 // the inverted condition.
15048 if (Op0.getOpcode() == X86ISD::SETCC) {
15049 X86::CondCode CCode = (X86::CondCode)Op0.getConstantOperandVal(0);
15050 bool Invert = (CC == ISD::SETNE) ^
15051 cast<ConstantSDNode>(Op1)->isNullValue();
15055 CCode = X86::GetOppositeBranchCondition(CCode);
15056 SDValue SetCC = DAG.getNode(X86ISD::SETCC, dl, MVT::i8,
15057 DAG.getConstant(CCode, MVT::i8),
15058 Op0.getOperand(1));
15060 return DAG.getNode(ISD::TRUNCATE, dl, MVT::i1, SetCC);
15064 if ((Op0.getValueType() == MVT::i1) && (Op1.getOpcode() == ISD::Constant) &&
15065 (cast<ConstantSDNode>(Op1)->getZExtValue() == 1) &&
15066 (CC == ISD::SETEQ || CC == ISD::SETNE)) {
15068 ISD::CondCode NewCC = ISD::getSetCCInverse(CC, true);
15069 return DAG.getSetCC(dl, VT, Op0, DAG.getConstant(0, MVT::i1), NewCC);
15072 bool isFP = Op1.getSimpleValueType().isFloatingPoint();
15073 unsigned X86CC = TranslateX86CC(CC, isFP, Op0, Op1, DAG);
15074 if (X86CC == X86::COND_INVALID)
15077 SDValue EFLAGS = EmitCmp(Op0, Op1, X86CC, dl, DAG);
15078 EFLAGS = ConvertCmpIfNecessary(EFLAGS, DAG);
15079 SDValue SetCC = DAG.getNode(X86ISD::SETCC, dl, MVT::i8,
15080 DAG.getConstant(X86CC, MVT::i8), EFLAGS);
15082 return DAG.getNode(ISD::TRUNCATE, dl, MVT::i1, SetCC);
15086 // isX86LogicalCmp - Return true if opcode is a X86 logical comparison.
15087 static bool isX86LogicalCmp(SDValue Op) {
15088 unsigned Opc = Op.getNode()->getOpcode();
15089 if (Opc == X86ISD::CMP || Opc == X86ISD::COMI || Opc == X86ISD::UCOMI ||
15090 Opc == X86ISD::SAHF)
15092 if (Op.getResNo() == 1 &&
15093 (Opc == X86ISD::ADD ||
15094 Opc == X86ISD::SUB ||
15095 Opc == X86ISD::ADC ||
15096 Opc == X86ISD::SBB ||
15097 Opc == X86ISD::SMUL ||
15098 Opc == X86ISD::UMUL ||
15099 Opc == X86ISD::INC ||
15100 Opc == X86ISD::DEC ||
15101 Opc == X86ISD::OR ||
15102 Opc == X86ISD::XOR ||
15103 Opc == X86ISD::AND))
15106 if (Op.getResNo() == 2 && Opc == X86ISD::UMUL)
15112 static bool isTruncWithZeroHighBitsInput(SDValue V, SelectionDAG &DAG) {
15113 if (V.getOpcode() != ISD::TRUNCATE)
15116 SDValue VOp0 = V.getOperand(0);
15117 unsigned InBits = VOp0.getValueSizeInBits();
15118 unsigned Bits = V.getValueSizeInBits();
15119 return DAG.MaskedValueIsZero(VOp0, APInt::getHighBitsSet(InBits,InBits-Bits));
15122 SDValue X86TargetLowering::LowerSELECT(SDValue Op, SelectionDAG &DAG) const {
15123 bool addTest = true;
15124 SDValue Cond = Op.getOperand(0);
15125 SDValue Op1 = Op.getOperand(1);
15126 SDValue Op2 = Op.getOperand(2);
15128 EVT VT = Op1.getValueType();
15131 // Lower fp selects into a CMP/AND/ANDN/OR sequence when the necessary SSE ops
15132 // are available. Otherwise fp cmovs get lowered into a less efficient branch
15133 // sequence later on.
15134 if (Cond.getOpcode() == ISD::SETCC &&
15135 ((Subtarget->hasSSE2() && (VT == MVT::f32 || VT == MVT::f64)) ||
15136 (Subtarget->hasSSE1() && VT == MVT::f32)) &&
15137 VT == Cond.getOperand(0).getValueType() && Cond->hasOneUse()) {
15138 SDValue CondOp0 = Cond.getOperand(0), CondOp1 = Cond.getOperand(1);
15139 int SSECC = translateX86FSETCC(
15140 cast<CondCodeSDNode>(Cond.getOperand(2))->get(), CondOp0, CondOp1);
15143 if (Subtarget->hasAVX512()) {
15144 SDValue Cmp = DAG.getNode(X86ISD::FSETCC, DL, MVT::i1, CondOp0, CondOp1,
15145 DAG.getConstant(SSECC, MVT::i8));
15146 return DAG.getNode(X86ISD::SELECT, DL, VT, Cmp, Op1, Op2);
15148 SDValue Cmp = DAG.getNode(X86ISD::FSETCC, DL, VT, CondOp0, CondOp1,
15149 DAG.getConstant(SSECC, MVT::i8));
15150 SDValue AndN = DAG.getNode(X86ISD::FANDN, DL, VT, Cmp, Op2);
15151 SDValue And = DAG.getNode(X86ISD::FAND, DL, VT, Cmp, Op1);
15152 return DAG.getNode(X86ISD::FOR, DL, VT, AndN, And);
15156 if (Cond.getOpcode() == ISD::SETCC) {
15157 SDValue NewCond = LowerSETCC(Cond, DAG);
15158 if (NewCond.getNode())
15162 // (select (x == 0), -1, y) -> (sign_bit (x - 1)) | y
15163 // (select (x == 0), y, -1) -> ~(sign_bit (x - 1)) | y
15164 // (select (x != 0), y, -1) -> (sign_bit (x - 1)) | y
15165 // (select (x != 0), -1, y) -> ~(sign_bit (x - 1)) | y
15166 if (Cond.getOpcode() == X86ISD::SETCC &&
15167 Cond.getOperand(1).getOpcode() == X86ISD::CMP &&
15168 isZero(Cond.getOperand(1).getOperand(1))) {
15169 SDValue Cmp = Cond.getOperand(1);
15171 unsigned CondCode =cast<ConstantSDNode>(Cond.getOperand(0))->getZExtValue();
15173 if ((isAllOnes(Op1) || isAllOnes(Op2)) &&
15174 (CondCode == X86::COND_E || CondCode == X86::COND_NE)) {
15175 SDValue Y = isAllOnes(Op2) ? Op1 : Op2;
15177 SDValue CmpOp0 = Cmp.getOperand(0);
15178 // Apply further optimizations for special cases
15179 // (select (x != 0), -1, 0) -> neg & sbb
15180 // (select (x == 0), 0, -1) -> neg & sbb
15181 if (ConstantSDNode *YC = dyn_cast<ConstantSDNode>(Y))
15182 if (YC->isNullValue() &&
15183 (isAllOnes(Op1) == (CondCode == X86::COND_NE))) {
15184 SDVTList VTs = DAG.getVTList(CmpOp0.getValueType(), MVT::i32);
15185 SDValue Neg = DAG.getNode(X86ISD::SUB, DL, VTs,
15186 DAG.getConstant(0, CmpOp0.getValueType()),
15188 SDValue Res = DAG.getNode(X86ISD::SETCC_CARRY, DL, Op.getValueType(),
15189 DAG.getConstant(X86::COND_B, MVT::i8),
15190 SDValue(Neg.getNode(), 1));
15194 Cmp = DAG.getNode(X86ISD::CMP, DL, MVT::i32,
15195 CmpOp0, DAG.getConstant(1, CmpOp0.getValueType()));
15196 Cmp = ConvertCmpIfNecessary(Cmp, DAG);
15198 SDValue Res = // Res = 0 or -1.
15199 DAG.getNode(X86ISD::SETCC_CARRY, DL, Op.getValueType(),
15200 DAG.getConstant(X86::COND_B, MVT::i8), Cmp);
15202 if (isAllOnes(Op1) != (CondCode == X86::COND_E))
15203 Res = DAG.getNOT(DL, Res, Res.getValueType());
15205 ConstantSDNode *N2C = dyn_cast<ConstantSDNode>(Op2);
15206 if (!N2C || !N2C->isNullValue())
15207 Res = DAG.getNode(ISD::OR, DL, Res.getValueType(), Res, Y);
15212 // Look past (and (setcc_carry (cmp ...)), 1).
15213 if (Cond.getOpcode() == ISD::AND &&
15214 Cond.getOperand(0).getOpcode() == X86ISD::SETCC_CARRY) {
15215 ConstantSDNode *C = dyn_cast<ConstantSDNode>(Cond.getOperand(1));
15216 if (C && C->getAPIntValue() == 1)
15217 Cond = Cond.getOperand(0);
15220 // If condition flag is set by a X86ISD::CMP, then use it as the condition
15221 // setting operand in place of the X86ISD::SETCC.
15222 unsigned CondOpcode = Cond.getOpcode();
15223 if (CondOpcode == X86ISD::SETCC ||
15224 CondOpcode == X86ISD::SETCC_CARRY) {
15225 CC = Cond.getOperand(0);
15227 SDValue Cmp = Cond.getOperand(1);
15228 unsigned Opc = Cmp.getOpcode();
15229 MVT VT = Op.getSimpleValueType();
15231 bool IllegalFPCMov = false;
15232 if (VT.isFloatingPoint() && !VT.isVector() &&
15233 !isScalarFPTypeInSSEReg(VT)) // FPStack?
15234 IllegalFPCMov = !hasFPCMov(cast<ConstantSDNode>(CC)->getSExtValue());
15236 if ((isX86LogicalCmp(Cmp) && !IllegalFPCMov) ||
15237 Opc == X86ISD::BT) { // FIXME
15241 } else if (CondOpcode == ISD::USUBO || CondOpcode == ISD::SSUBO ||
15242 CondOpcode == ISD::UADDO || CondOpcode == ISD::SADDO ||
15243 ((CondOpcode == ISD::UMULO || CondOpcode == ISD::SMULO) &&
15244 Cond.getOperand(0).getValueType() != MVT::i8)) {
15245 SDValue LHS = Cond.getOperand(0);
15246 SDValue RHS = Cond.getOperand(1);
15247 unsigned X86Opcode;
15250 switch (CondOpcode) {
15251 case ISD::UADDO: X86Opcode = X86ISD::ADD; X86Cond = X86::COND_B; break;
15252 case ISD::SADDO: X86Opcode = X86ISD::ADD; X86Cond = X86::COND_O; break;
15253 case ISD::USUBO: X86Opcode = X86ISD::SUB; X86Cond = X86::COND_B; break;
15254 case ISD::SSUBO: X86Opcode = X86ISD::SUB; X86Cond = X86::COND_O; break;
15255 case ISD::UMULO: X86Opcode = X86ISD::UMUL; X86Cond = X86::COND_O; break;
15256 case ISD::SMULO: X86Opcode = X86ISD::SMUL; X86Cond = X86::COND_O; break;
15257 default: llvm_unreachable("unexpected overflowing operator");
15259 if (CondOpcode == ISD::UMULO)
15260 VTs = DAG.getVTList(LHS.getValueType(), LHS.getValueType(),
15263 VTs = DAG.getVTList(LHS.getValueType(), MVT::i32);
15265 SDValue X86Op = DAG.getNode(X86Opcode, DL, VTs, LHS, RHS);
15267 if (CondOpcode == ISD::UMULO)
15268 Cond = X86Op.getValue(2);
15270 Cond = X86Op.getValue(1);
15272 CC = DAG.getConstant(X86Cond, MVT::i8);
15277 // Look pass the truncate if the high bits are known zero.
15278 if (isTruncWithZeroHighBitsInput(Cond, DAG))
15279 Cond = Cond.getOperand(0);
15281 // We know the result of AND is compared against zero. Try to match
15283 if (Cond.getOpcode() == ISD::AND && Cond.hasOneUse()) {
15284 SDValue NewSetCC = LowerToBT(Cond, ISD::SETNE, DL, DAG);
15285 if (NewSetCC.getNode()) {
15286 CC = NewSetCC.getOperand(0);
15287 Cond = NewSetCC.getOperand(1);
15294 CC = DAG.getConstant(X86::COND_NE, MVT::i8);
15295 Cond = EmitTest(Cond, X86::COND_NE, DL, DAG);
15298 // a < b ? -1 : 0 -> RES = ~setcc_carry
15299 // a < b ? 0 : -1 -> RES = setcc_carry
15300 // a >= b ? -1 : 0 -> RES = setcc_carry
15301 // a >= b ? 0 : -1 -> RES = ~setcc_carry
15302 if (Cond.getOpcode() == X86ISD::SUB) {
15303 Cond = ConvertCmpIfNecessary(Cond, DAG);
15304 unsigned CondCode = cast<ConstantSDNode>(CC)->getZExtValue();
15306 if ((CondCode == X86::COND_AE || CondCode == X86::COND_B) &&
15307 (isAllOnes(Op1) || isAllOnes(Op2)) && (isZero(Op1) || isZero(Op2))) {
15308 SDValue Res = DAG.getNode(X86ISD::SETCC_CARRY, DL, Op.getValueType(),
15309 DAG.getConstant(X86::COND_B, MVT::i8), Cond);
15310 if (isAllOnes(Op1) != (CondCode == X86::COND_B))
15311 return DAG.getNOT(DL, Res, Res.getValueType());
15316 // X86 doesn't have an i8 cmov. If both operands are the result of a truncate
15317 // widen the cmov and push the truncate through. This avoids introducing a new
15318 // branch during isel and doesn't add any extensions.
15319 if (Op.getValueType() == MVT::i8 &&
15320 Op1.getOpcode() == ISD::TRUNCATE && Op2.getOpcode() == ISD::TRUNCATE) {
15321 SDValue T1 = Op1.getOperand(0), T2 = Op2.getOperand(0);
15322 if (T1.getValueType() == T2.getValueType() &&
15323 // Blacklist CopyFromReg to avoid partial register stalls.
15324 T1.getOpcode() != ISD::CopyFromReg && T2.getOpcode()!=ISD::CopyFromReg){
15325 SDVTList VTs = DAG.getVTList(T1.getValueType(), MVT::Glue);
15326 SDValue Cmov = DAG.getNode(X86ISD::CMOV, DL, VTs, T2, T1, CC, Cond);
15327 return DAG.getNode(ISD::TRUNCATE, DL, Op.getValueType(), Cmov);
15331 // X86ISD::CMOV means set the result (which is operand 1) to the RHS if
15332 // condition is true.
15333 SDVTList VTs = DAG.getVTList(Op.getValueType(), MVT::Glue);
15334 SDValue Ops[] = { Op2, Op1, CC, Cond };
15335 return DAG.getNode(X86ISD::CMOV, DL, VTs, Ops);
15338 static SDValue LowerSIGN_EXTEND_AVX512(SDValue Op, const X86Subtarget *Subtarget,
15339 SelectionDAG &DAG) {
15340 MVT VT = Op->getSimpleValueType(0);
15341 SDValue In = Op->getOperand(0);
15342 MVT InVT = In.getSimpleValueType();
15343 MVT VTElt = VT.getVectorElementType();
15344 MVT InVTElt = InVT.getVectorElementType();
15348 if ((InVTElt == MVT::i1) &&
15349 (((Subtarget->hasBWI() && Subtarget->hasVLX() &&
15350 VT.getSizeInBits() <= 256 && VTElt.getSizeInBits() <= 16)) ||
15352 ((Subtarget->hasBWI() && VT.is512BitVector() &&
15353 VTElt.getSizeInBits() <= 16)) ||
15355 ((Subtarget->hasDQI() && Subtarget->hasVLX() &&
15356 VT.getSizeInBits() <= 256 && VTElt.getSizeInBits() >= 32)) ||
15358 ((Subtarget->hasDQI() && VT.is512BitVector() &&
15359 VTElt.getSizeInBits() >= 32))))
15360 return DAG.getNode(X86ISD::VSEXT, dl, VT, In);
15362 unsigned int NumElts = VT.getVectorNumElements();
15364 if (NumElts != 8 && NumElts != 16)
15367 if (VT.is512BitVector() && InVT.getVectorElementType() != MVT::i1)
15368 return DAG.getNode(X86ISD::VSEXT, dl, VT, In);
15370 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
15371 assert (InVT.getVectorElementType() == MVT::i1 && "Unexpected vector type");
15373 MVT ExtVT = (NumElts == 8) ? MVT::v8i64 : MVT::v16i32;
15374 Constant *C = ConstantInt::get(*DAG.getContext(),
15375 APInt::getAllOnesValue(ExtVT.getScalarType().getSizeInBits()));
15377 SDValue CP = DAG.getConstantPool(C, TLI.getPointerTy());
15378 unsigned Alignment = cast<ConstantPoolSDNode>(CP)->getAlignment();
15379 SDValue Ld = DAG.getLoad(ExtVT.getScalarType(), dl, DAG.getEntryNode(), CP,
15380 MachinePointerInfo::getConstantPool(),
15381 false, false, false, Alignment);
15382 SDValue Brcst = DAG.getNode(X86ISD::VBROADCASTM, dl, ExtVT, In, Ld);
15383 if (VT.is512BitVector())
15385 return DAG.getNode(X86ISD::VTRUNC, dl, VT, Brcst);
15388 static SDValue LowerSIGN_EXTEND(SDValue Op, const X86Subtarget *Subtarget,
15389 SelectionDAG &DAG) {
15390 MVT VT = Op->getSimpleValueType(0);
15391 SDValue In = Op->getOperand(0);
15392 MVT InVT = In.getSimpleValueType();
15395 if (VT.is512BitVector() || InVT.getVectorElementType() == MVT::i1)
15396 return LowerSIGN_EXTEND_AVX512(Op, Subtarget, DAG);
15398 if ((VT != MVT::v4i64 || InVT != MVT::v4i32) &&
15399 (VT != MVT::v8i32 || InVT != MVT::v8i16) &&
15400 (VT != MVT::v16i16 || InVT != MVT::v16i8))
15403 if (Subtarget->hasInt256())
15404 return DAG.getNode(X86ISD::VSEXT, dl, VT, In);
15406 // Optimize vectors in AVX mode
15407 // Sign extend v8i16 to v8i32 and
15410 // Divide input vector into two parts
15411 // for v4i32 the shuffle mask will be { 0, 1, -1, -1} {2, 3, -1, -1}
15412 // use vpmovsx instruction to extend v4i32 -> v2i64; v8i16 -> v4i32
15413 // concat the vectors to original VT
15415 unsigned NumElems = InVT.getVectorNumElements();
15416 SDValue Undef = DAG.getUNDEF(InVT);
15418 SmallVector<int,8> ShufMask1(NumElems, -1);
15419 for (unsigned i = 0; i != NumElems/2; ++i)
15422 SDValue OpLo = DAG.getVectorShuffle(InVT, dl, In, Undef, &ShufMask1[0]);
15424 SmallVector<int,8> ShufMask2(NumElems, -1);
15425 for (unsigned i = 0; i != NumElems/2; ++i)
15426 ShufMask2[i] = i + NumElems/2;
15428 SDValue OpHi = DAG.getVectorShuffle(InVT, dl, In, Undef, &ShufMask2[0]);
15430 MVT HalfVT = MVT::getVectorVT(VT.getScalarType(),
15431 VT.getVectorNumElements()/2);
15433 OpLo = DAG.getNode(X86ISD::VSEXT, dl, HalfVT, OpLo);
15434 OpHi = DAG.getNode(X86ISD::VSEXT, dl, HalfVT, OpHi);
15436 return DAG.getNode(ISD::CONCAT_VECTORS, dl, VT, OpLo, OpHi);
15439 // Lower vector extended loads using a shuffle. If SSSE3 is not available we
15440 // may emit an illegal shuffle but the expansion is still better than scalar
15441 // code. We generate X86ISD::VSEXT for SEXTLOADs if it's available, otherwise
15442 // we'll emit a shuffle and a arithmetic shift.
15443 // TODO: It is possible to support ZExt by zeroing the undef values during
15444 // the shuffle phase or after the shuffle.
15445 static SDValue LowerExtendedLoad(SDValue Op, const X86Subtarget *Subtarget,
15446 SelectionDAG &DAG) {
15447 MVT RegVT = Op.getSimpleValueType();
15448 assert(RegVT.isVector() && "We only custom lower vector sext loads.");
15449 assert(RegVT.isInteger() &&
15450 "We only custom lower integer vector sext loads.");
15452 // Nothing useful we can do without SSE2 shuffles.
15453 assert(Subtarget->hasSSE2() && "We only custom lower sext loads with SSE2.");
15455 LoadSDNode *Ld = cast<LoadSDNode>(Op.getNode());
15457 EVT MemVT = Ld->getMemoryVT();
15458 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
15459 unsigned RegSz = RegVT.getSizeInBits();
15461 ISD::LoadExtType Ext = Ld->getExtensionType();
15463 assert((Ext == ISD::EXTLOAD || Ext == ISD::SEXTLOAD)
15464 && "Only anyext and sext are currently implemented.");
15465 assert(MemVT != RegVT && "Cannot extend to the same type");
15466 assert(MemVT.isVector() && "Must load a vector from memory");
15468 unsigned NumElems = RegVT.getVectorNumElements();
15469 unsigned MemSz = MemVT.getSizeInBits();
15470 assert(RegSz > MemSz && "Register size must be greater than the mem size");
15472 if (Ext == ISD::SEXTLOAD && RegSz == 256 && !Subtarget->hasInt256()) {
15473 // The only way in which we have a legal 256-bit vector result but not the
15474 // integer 256-bit operations needed to directly lower a sextload is if we
15475 // have AVX1 but not AVX2. In that case, we can always emit a sextload to
15476 // a 128-bit vector and a normal sign_extend to 256-bits that should get
15477 // correctly legalized. We do this late to allow the canonical form of
15478 // sextload to persist throughout the rest of the DAG combiner -- it wants
15479 // to fold together any extensions it can, and so will fuse a sign_extend
15480 // of an sextload into a sextload targeting a wider value.
15482 if (MemSz == 128) {
15483 // Just switch this to a normal load.
15484 assert(TLI.isTypeLegal(MemVT) && "If the memory type is a 128-bit type, "
15485 "it must be a legal 128-bit vector "
15487 Load = DAG.getLoad(MemVT, dl, Ld->getChain(), Ld->getBasePtr(),
15488 Ld->getPointerInfo(), Ld->isVolatile(), Ld->isNonTemporal(),
15489 Ld->isInvariant(), Ld->getAlignment());
15491 assert(MemSz < 128 &&
15492 "Can't extend a type wider than 128 bits to a 256 bit vector!");
15493 // Do an sext load to a 128-bit vector type. We want to use the same
15494 // number of elements, but elements half as wide. This will end up being
15495 // recursively lowered by this routine, but will succeed as we definitely
15496 // have all the necessary features if we're using AVX1.
15498 EVT::getIntegerVT(*DAG.getContext(), RegVT.getScalarSizeInBits() / 2);
15499 EVT HalfVecVT = EVT::getVectorVT(*DAG.getContext(), HalfEltVT, NumElems);
15501 DAG.getExtLoad(Ext, dl, HalfVecVT, Ld->getChain(), Ld->getBasePtr(),
15502 Ld->getPointerInfo(), MemVT, Ld->isVolatile(),
15503 Ld->isNonTemporal(), Ld->isInvariant(),
15504 Ld->getAlignment());
15507 // Replace chain users with the new chain.
15508 assert(Load->getNumValues() == 2 && "Loads must carry a chain!");
15509 DAG.ReplaceAllUsesOfValueWith(SDValue(Ld, 1), Load.getValue(1));
15511 // Finally, do a normal sign-extend to the desired register.
15512 return DAG.getSExtOrTrunc(Load, dl, RegVT);
15515 // All sizes must be a power of two.
15516 assert(isPowerOf2_32(RegSz * MemSz * NumElems) &&
15517 "Non-power-of-two elements are not custom lowered!");
15519 // Attempt to load the original value using scalar loads.
15520 // Find the largest scalar type that divides the total loaded size.
15521 MVT SclrLoadTy = MVT::i8;
15522 for (unsigned tp = MVT::FIRST_INTEGER_VALUETYPE;
15523 tp < MVT::LAST_INTEGER_VALUETYPE; ++tp) {
15524 MVT Tp = (MVT::SimpleValueType)tp;
15525 if (TLI.isTypeLegal(Tp) && ((MemSz % Tp.getSizeInBits()) == 0)) {
15530 // On 32bit systems, we can't save 64bit integers. Try bitcasting to F64.
15531 if (TLI.isTypeLegal(MVT::f64) && SclrLoadTy.getSizeInBits() < 64 &&
15533 SclrLoadTy = MVT::f64;
15535 // Calculate the number of scalar loads that we need to perform
15536 // in order to load our vector from memory.
15537 unsigned NumLoads = MemSz / SclrLoadTy.getSizeInBits();
15539 assert((Ext != ISD::SEXTLOAD || NumLoads == 1) &&
15540 "Can only lower sext loads with a single scalar load!");
15542 unsigned loadRegZize = RegSz;
15543 if (Ext == ISD::SEXTLOAD && RegSz == 256)
15546 // Represent our vector as a sequence of elements which are the
15547 // largest scalar that we can load.
15548 EVT LoadUnitVecVT = EVT::getVectorVT(
15549 *DAG.getContext(), SclrLoadTy, loadRegZize / SclrLoadTy.getSizeInBits());
15551 // Represent the data using the same element type that is stored in
15552 // memory. In practice, we ''widen'' MemVT.
15554 EVT::getVectorVT(*DAG.getContext(), MemVT.getScalarType(),
15555 loadRegZize / MemVT.getScalarType().getSizeInBits());
15557 assert(WideVecVT.getSizeInBits() == LoadUnitVecVT.getSizeInBits() &&
15558 "Invalid vector type");
15560 // We can't shuffle using an illegal type.
15561 assert(TLI.isTypeLegal(WideVecVT) &&
15562 "We only lower types that form legal widened vector types");
15564 SmallVector<SDValue, 8> Chains;
15565 SDValue Ptr = Ld->getBasePtr();
15566 SDValue Increment =
15567 DAG.getConstant(SclrLoadTy.getSizeInBits() / 8, TLI.getPointerTy());
15568 SDValue Res = DAG.getUNDEF(LoadUnitVecVT);
15570 for (unsigned i = 0; i < NumLoads; ++i) {
15571 // Perform a single load.
15572 SDValue ScalarLoad =
15573 DAG.getLoad(SclrLoadTy, dl, Ld->getChain(), Ptr, Ld->getPointerInfo(),
15574 Ld->isVolatile(), Ld->isNonTemporal(), Ld->isInvariant(),
15575 Ld->getAlignment());
15576 Chains.push_back(ScalarLoad.getValue(1));
15577 // Create the first element type using SCALAR_TO_VECTOR in order to avoid
15578 // another round of DAGCombining.
15580 Res = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, LoadUnitVecVT, ScalarLoad);
15582 Res = DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, LoadUnitVecVT, Res,
15583 ScalarLoad, DAG.getIntPtrConstant(i));
15585 Ptr = DAG.getNode(ISD::ADD, dl, Ptr.getValueType(), Ptr, Increment);
15588 SDValue TF = DAG.getNode(ISD::TokenFactor, dl, MVT::Other, Chains);
15590 // Bitcast the loaded value to a vector of the original element type, in
15591 // the size of the target vector type.
15592 SDValue SlicedVec = DAG.getNode(ISD::BITCAST, dl, WideVecVT, Res);
15593 unsigned SizeRatio = RegSz / MemSz;
15595 if (Ext == ISD::SEXTLOAD) {
15596 // If we have SSE4.1, we can directly emit a VSEXT node.
15597 if (Subtarget->hasSSE41()) {
15598 SDValue Sext = DAG.getNode(X86ISD::VSEXT, dl, RegVT, SlicedVec);
15599 DAG.ReplaceAllUsesOfValueWith(SDValue(Ld, 1), TF);
15603 // Otherwise we'll shuffle the small elements in the high bits of the
15604 // larger type and perform an arithmetic shift. If the shift is not legal
15605 // it's better to scalarize.
15606 assert(TLI.isOperationLegalOrCustom(ISD::SRA, RegVT) &&
15607 "We can't implement a sext load without an arithmetic right shift!");
15609 // Redistribute the loaded elements into the different locations.
15610 SmallVector<int, 16> ShuffleVec(NumElems * SizeRatio, -1);
15611 for (unsigned i = 0; i != NumElems; ++i)
15612 ShuffleVec[i * SizeRatio + SizeRatio - 1] = i;
15614 SDValue Shuff = DAG.getVectorShuffle(
15615 WideVecVT, dl, SlicedVec, DAG.getUNDEF(WideVecVT), &ShuffleVec[0]);
15617 Shuff = DAG.getNode(ISD::BITCAST, dl, RegVT, Shuff);
15619 // Build the arithmetic shift.
15620 unsigned Amt = RegVT.getVectorElementType().getSizeInBits() -
15621 MemVT.getVectorElementType().getSizeInBits();
15623 DAG.getNode(ISD::SRA, dl, RegVT, Shuff, DAG.getConstant(Amt, RegVT));
15625 DAG.ReplaceAllUsesOfValueWith(SDValue(Ld, 1), TF);
15629 // Redistribute the loaded elements into the different locations.
15630 SmallVector<int, 16> ShuffleVec(NumElems * SizeRatio, -1);
15631 for (unsigned i = 0; i != NumElems; ++i)
15632 ShuffleVec[i * SizeRatio] = i;
15634 SDValue Shuff = DAG.getVectorShuffle(WideVecVT, dl, SlicedVec,
15635 DAG.getUNDEF(WideVecVT), &ShuffleVec[0]);
15637 // Bitcast to the requested type.
15638 Shuff = DAG.getNode(ISD::BITCAST, dl, RegVT, Shuff);
15639 DAG.ReplaceAllUsesOfValueWith(SDValue(Ld, 1), TF);
15643 // isAndOrOfSingleUseSetCCs - Return true if node is an ISD::AND or
15644 // ISD::OR of two X86ISD::SETCC nodes each of which has no other use apart
15645 // from the AND / OR.
15646 static bool isAndOrOfSetCCs(SDValue Op, unsigned &Opc) {
15647 Opc = Op.getOpcode();
15648 if (Opc != ISD::OR && Opc != ISD::AND)
15650 return (Op.getOperand(0).getOpcode() == X86ISD::SETCC &&
15651 Op.getOperand(0).hasOneUse() &&
15652 Op.getOperand(1).getOpcode() == X86ISD::SETCC &&
15653 Op.getOperand(1).hasOneUse());
15656 // isXor1OfSetCC - Return true if node is an ISD::XOR of a X86ISD::SETCC and
15657 // 1 and that the SETCC node has a single use.
15658 static bool isXor1OfSetCC(SDValue Op) {
15659 if (Op.getOpcode() != ISD::XOR)
15661 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(Op.getOperand(1));
15662 if (N1C && N1C->getAPIntValue() == 1) {
15663 return Op.getOperand(0).getOpcode() == X86ISD::SETCC &&
15664 Op.getOperand(0).hasOneUse();
15669 SDValue X86TargetLowering::LowerBRCOND(SDValue Op, SelectionDAG &DAG) const {
15670 bool addTest = true;
15671 SDValue Chain = Op.getOperand(0);
15672 SDValue Cond = Op.getOperand(1);
15673 SDValue Dest = Op.getOperand(2);
15676 bool Inverted = false;
15678 if (Cond.getOpcode() == ISD::SETCC) {
15679 // Check for setcc([su]{add,sub,mul}o == 0).
15680 if (cast<CondCodeSDNode>(Cond.getOperand(2))->get() == ISD::SETEQ &&
15681 isa<ConstantSDNode>(Cond.getOperand(1)) &&
15682 cast<ConstantSDNode>(Cond.getOperand(1))->isNullValue() &&
15683 Cond.getOperand(0).getResNo() == 1 &&
15684 (Cond.getOperand(0).getOpcode() == ISD::SADDO ||
15685 Cond.getOperand(0).getOpcode() == ISD::UADDO ||
15686 Cond.getOperand(0).getOpcode() == ISD::SSUBO ||
15687 Cond.getOperand(0).getOpcode() == ISD::USUBO ||
15688 Cond.getOperand(0).getOpcode() == ISD::SMULO ||
15689 Cond.getOperand(0).getOpcode() == ISD::UMULO)) {
15691 Cond = Cond.getOperand(0);
15693 SDValue NewCond = LowerSETCC(Cond, DAG);
15694 if (NewCond.getNode())
15699 // FIXME: LowerXALUO doesn't handle these!!
15700 else if (Cond.getOpcode() == X86ISD::ADD ||
15701 Cond.getOpcode() == X86ISD::SUB ||
15702 Cond.getOpcode() == X86ISD::SMUL ||
15703 Cond.getOpcode() == X86ISD::UMUL)
15704 Cond = LowerXALUO(Cond, DAG);
15707 // Look pass (and (setcc_carry (cmp ...)), 1).
15708 if (Cond.getOpcode() == ISD::AND &&
15709 Cond.getOperand(0).getOpcode() == X86ISD::SETCC_CARRY) {
15710 ConstantSDNode *C = dyn_cast<ConstantSDNode>(Cond.getOperand(1));
15711 if (C && C->getAPIntValue() == 1)
15712 Cond = Cond.getOperand(0);
15715 // If condition flag is set by a X86ISD::CMP, then use it as the condition
15716 // setting operand in place of the X86ISD::SETCC.
15717 unsigned CondOpcode = Cond.getOpcode();
15718 if (CondOpcode == X86ISD::SETCC ||
15719 CondOpcode == X86ISD::SETCC_CARRY) {
15720 CC = Cond.getOperand(0);
15722 SDValue Cmp = Cond.getOperand(1);
15723 unsigned Opc = Cmp.getOpcode();
15724 // FIXME: WHY THE SPECIAL CASING OF LogicalCmp??
15725 if (isX86LogicalCmp(Cmp) || Opc == X86ISD::BT) {
15729 switch (cast<ConstantSDNode>(CC)->getZExtValue()) {
15733 // These can only come from an arithmetic instruction with overflow,
15734 // e.g. SADDO, UADDO.
15735 Cond = Cond.getNode()->getOperand(1);
15741 CondOpcode = Cond.getOpcode();
15742 if (CondOpcode == ISD::UADDO || CondOpcode == ISD::SADDO ||
15743 CondOpcode == ISD::USUBO || CondOpcode == ISD::SSUBO ||
15744 ((CondOpcode == ISD::UMULO || CondOpcode == ISD::SMULO) &&
15745 Cond.getOperand(0).getValueType() != MVT::i8)) {
15746 SDValue LHS = Cond.getOperand(0);
15747 SDValue RHS = Cond.getOperand(1);
15748 unsigned X86Opcode;
15751 // Keep this in sync with LowerXALUO, otherwise we might create redundant
15752 // instructions that can't be removed afterwards (i.e. X86ISD::ADD and
15754 switch (CondOpcode) {
15755 case ISD::UADDO: X86Opcode = X86ISD::ADD; X86Cond = X86::COND_B; break;
15757 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(RHS))
15759 X86Opcode = X86ISD::INC; X86Cond = X86::COND_O;
15762 X86Opcode = X86ISD::ADD; X86Cond = X86::COND_O; break;
15763 case ISD::USUBO: X86Opcode = X86ISD::SUB; X86Cond = X86::COND_B; break;
15765 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(RHS))
15767 X86Opcode = X86ISD::DEC; X86Cond = X86::COND_O;
15770 X86Opcode = X86ISD::SUB; X86Cond = X86::COND_O; break;
15771 case ISD::UMULO: X86Opcode = X86ISD::UMUL; X86Cond = X86::COND_O; break;
15772 case ISD::SMULO: X86Opcode = X86ISD::SMUL; X86Cond = X86::COND_O; break;
15773 default: llvm_unreachable("unexpected overflowing operator");
15776 X86Cond = X86::GetOppositeBranchCondition((X86::CondCode)X86Cond);
15777 if (CondOpcode == ISD::UMULO)
15778 VTs = DAG.getVTList(LHS.getValueType(), LHS.getValueType(),
15781 VTs = DAG.getVTList(LHS.getValueType(), MVT::i32);
15783 SDValue X86Op = DAG.getNode(X86Opcode, dl, VTs, LHS, RHS);
15785 if (CondOpcode == ISD::UMULO)
15786 Cond = X86Op.getValue(2);
15788 Cond = X86Op.getValue(1);
15790 CC = DAG.getConstant(X86Cond, MVT::i8);
15794 if (Cond.hasOneUse() && isAndOrOfSetCCs(Cond, CondOpc)) {
15795 SDValue Cmp = Cond.getOperand(0).getOperand(1);
15796 if (CondOpc == ISD::OR) {
15797 // Also, recognize the pattern generated by an FCMP_UNE. We can emit
15798 // two branches instead of an explicit OR instruction with a
15800 if (Cmp == Cond.getOperand(1).getOperand(1) &&
15801 isX86LogicalCmp(Cmp)) {
15802 CC = Cond.getOperand(0).getOperand(0);
15803 Chain = DAG.getNode(X86ISD::BRCOND, dl, Op.getValueType(),
15804 Chain, Dest, CC, Cmp);
15805 CC = Cond.getOperand(1).getOperand(0);
15809 } else { // ISD::AND
15810 // Also, recognize the pattern generated by an FCMP_OEQ. We can emit
15811 // two branches instead of an explicit AND instruction with a
15812 // separate test. However, we only do this if this block doesn't
15813 // have a fall-through edge, because this requires an explicit
15814 // jmp when the condition is false.
15815 if (Cmp == Cond.getOperand(1).getOperand(1) &&
15816 isX86LogicalCmp(Cmp) &&
15817 Op.getNode()->hasOneUse()) {
15818 X86::CondCode CCode =
15819 (X86::CondCode)Cond.getOperand(0).getConstantOperandVal(0);
15820 CCode = X86::GetOppositeBranchCondition(CCode);
15821 CC = DAG.getConstant(CCode, MVT::i8);
15822 SDNode *User = *Op.getNode()->use_begin();
15823 // Look for an unconditional branch following this conditional branch.
15824 // We need this because we need to reverse the successors in order
15825 // to implement FCMP_OEQ.
15826 if (User->getOpcode() == ISD::BR) {
15827 SDValue FalseBB = User->getOperand(1);
15829 DAG.UpdateNodeOperands(User, User->getOperand(0), Dest);
15830 assert(NewBR == User);
15834 Chain = DAG.getNode(X86ISD::BRCOND, dl, Op.getValueType(),
15835 Chain, Dest, CC, Cmp);
15836 X86::CondCode CCode =
15837 (X86::CondCode)Cond.getOperand(1).getConstantOperandVal(0);
15838 CCode = X86::GetOppositeBranchCondition(CCode);
15839 CC = DAG.getConstant(CCode, MVT::i8);
15845 } else if (Cond.hasOneUse() && isXor1OfSetCC(Cond)) {
15846 // Recognize for xorb (setcc), 1 patterns. The xor inverts the condition.
15847 // It should be transformed during dag combiner except when the condition
15848 // is set by a arithmetics with overflow node.
15849 X86::CondCode CCode =
15850 (X86::CondCode)Cond.getOperand(0).getConstantOperandVal(0);
15851 CCode = X86::GetOppositeBranchCondition(CCode);
15852 CC = DAG.getConstant(CCode, MVT::i8);
15853 Cond = Cond.getOperand(0).getOperand(1);
15855 } else if (Cond.getOpcode() == ISD::SETCC &&
15856 cast<CondCodeSDNode>(Cond.getOperand(2))->get() == ISD::SETOEQ) {
15857 // For FCMP_OEQ, we can emit
15858 // two branches instead of an explicit AND instruction with a
15859 // separate test. However, we only do this if this block doesn't
15860 // have a fall-through edge, because this requires an explicit
15861 // jmp when the condition is false.
15862 if (Op.getNode()->hasOneUse()) {
15863 SDNode *User = *Op.getNode()->use_begin();
15864 // Look for an unconditional branch following this conditional branch.
15865 // We need this because we need to reverse the successors in order
15866 // to implement FCMP_OEQ.
15867 if (User->getOpcode() == ISD::BR) {
15868 SDValue FalseBB = User->getOperand(1);
15870 DAG.UpdateNodeOperands(User, User->getOperand(0), Dest);
15871 assert(NewBR == User);
15875 SDValue Cmp = DAG.getNode(X86ISD::CMP, dl, MVT::i32,
15876 Cond.getOperand(0), Cond.getOperand(1));
15877 Cmp = ConvertCmpIfNecessary(Cmp, DAG);
15878 CC = DAG.getConstant(X86::COND_NE, MVT::i8);
15879 Chain = DAG.getNode(X86ISD::BRCOND, dl, Op.getValueType(),
15880 Chain, Dest, CC, Cmp);
15881 CC = DAG.getConstant(X86::COND_P, MVT::i8);
15886 } else if (Cond.getOpcode() == ISD::SETCC &&
15887 cast<CondCodeSDNode>(Cond.getOperand(2))->get() == ISD::SETUNE) {
15888 // For FCMP_UNE, we can emit
15889 // two branches instead of an explicit AND instruction with a
15890 // separate test. However, we only do this if this block doesn't
15891 // have a fall-through edge, because this requires an explicit
15892 // jmp when the condition is false.
15893 if (Op.getNode()->hasOneUse()) {
15894 SDNode *User = *Op.getNode()->use_begin();
15895 // Look for an unconditional branch following this conditional branch.
15896 // We need this because we need to reverse the successors in order
15897 // to implement FCMP_UNE.
15898 if (User->getOpcode() == ISD::BR) {
15899 SDValue FalseBB = User->getOperand(1);
15901 DAG.UpdateNodeOperands(User, User->getOperand(0), Dest);
15902 assert(NewBR == User);
15905 SDValue Cmp = DAG.getNode(X86ISD::CMP, dl, MVT::i32,
15906 Cond.getOperand(0), Cond.getOperand(1));
15907 Cmp = ConvertCmpIfNecessary(Cmp, DAG);
15908 CC = DAG.getConstant(X86::COND_NE, MVT::i8);
15909 Chain = DAG.getNode(X86ISD::BRCOND, dl, Op.getValueType(),
15910 Chain, Dest, CC, Cmp);
15911 CC = DAG.getConstant(X86::COND_NP, MVT::i8);
15921 // Look pass the truncate if the high bits are known zero.
15922 if (isTruncWithZeroHighBitsInput(Cond, DAG))
15923 Cond = Cond.getOperand(0);
15925 // We know the result of AND is compared against zero. Try to match
15927 if (Cond.getOpcode() == ISD::AND && Cond.hasOneUse()) {
15928 SDValue NewSetCC = LowerToBT(Cond, ISD::SETNE, dl, DAG);
15929 if (NewSetCC.getNode()) {
15930 CC = NewSetCC.getOperand(0);
15931 Cond = NewSetCC.getOperand(1);
15938 X86::CondCode X86Cond = Inverted ? X86::COND_E : X86::COND_NE;
15939 CC = DAG.getConstant(X86Cond, MVT::i8);
15940 Cond = EmitTest(Cond, X86Cond, dl, DAG);
15942 Cond = ConvertCmpIfNecessary(Cond, DAG);
15943 return DAG.getNode(X86ISD::BRCOND, dl, Op.getValueType(),
15944 Chain, Dest, CC, Cond);
15947 // Lower dynamic stack allocation to _alloca call for Cygwin/Mingw targets.
15948 // Calls to _alloca are needed to probe the stack when allocating more than 4k
15949 // bytes in one go. Touching the stack at 4K increments is necessary to ensure
15950 // that the guard pages used by the OS virtual memory manager are allocated in
15951 // correct sequence.
15953 X86TargetLowering::LowerDYNAMIC_STACKALLOC(SDValue Op,
15954 SelectionDAG &DAG) const {
15955 MachineFunction &MF = DAG.getMachineFunction();
15956 bool SplitStack = MF.shouldSplitStack();
15957 bool Lower = (Subtarget->isOSWindows() && !Subtarget->isTargetMacho()) ||
15962 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
15963 SDNode* Node = Op.getNode();
15965 unsigned SPReg = TLI.getStackPointerRegisterToSaveRestore();
15966 assert(SPReg && "Target cannot require DYNAMIC_STACKALLOC expansion and"
15967 " not tell us which reg is the stack pointer!");
15968 EVT VT = Node->getValueType(0);
15969 SDValue Tmp1 = SDValue(Node, 0);
15970 SDValue Tmp2 = SDValue(Node, 1);
15971 SDValue Tmp3 = Node->getOperand(2);
15972 SDValue Chain = Tmp1.getOperand(0);
15974 // Chain the dynamic stack allocation so that it doesn't modify the stack
15975 // pointer when other instructions are using the stack.
15976 Chain = DAG.getCALLSEQ_START(Chain, DAG.getIntPtrConstant(0, true),
15979 SDValue Size = Tmp2.getOperand(1);
15980 SDValue SP = DAG.getCopyFromReg(Chain, dl, SPReg, VT);
15981 Chain = SP.getValue(1);
15982 unsigned Align = cast<ConstantSDNode>(Tmp3)->getZExtValue();
15983 const TargetFrameLowering &TFI = *DAG.getSubtarget().getFrameLowering();
15984 unsigned StackAlign = TFI.getStackAlignment();
15985 Tmp1 = DAG.getNode(ISD::SUB, dl, VT, SP, Size); // Value
15986 if (Align > StackAlign)
15987 Tmp1 = DAG.getNode(ISD::AND, dl, VT, Tmp1,
15988 DAG.getConstant(-(uint64_t)Align, VT));
15989 Chain = DAG.getCopyToReg(Chain, dl, SPReg, Tmp1); // Output chain
15991 Tmp2 = DAG.getCALLSEQ_END(Chain, DAG.getIntPtrConstant(0, true),
15992 DAG.getIntPtrConstant(0, true), SDValue(),
15995 SDValue Ops[2] = { Tmp1, Tmp2 };
15996 return DAG.getMergeValues(Ops, dl);
16000 SDValue Chain = Op.getOperand(0);
16001 SDValue Size = Op.getOperand(1);
16002 unsigned Align = cast<ConstantSDNode>(Op.getOperand(2))->getZExtValue();
16003 EVT VT = Op.getNode()->getValueType(0);
16005 bool Is64Bit = Subtarget->is64Bit();
16006 EVT SPTy = getPointerTy();
16009 MachineRegisterInfo &MRI = MF.getRegInfo();
16012 // The 64 bit implementation of segmented stacks needs to clobber both r10
16013 // r11. This makes it impossible to use it along with nested parameters.
16014 const Function *F = MF.getFunction();
16016 for (Function::const_arg_iterator I = F->arg_begin(), E = F->arg_end();
16018 if (I->hasNestAttr())
16019 report_fatal_error("Cannot use segmented stacks with functions that "
16020 "have nested arguments.");
16023 const TargetRegisterClass *AddrRegClass =
16024 getRegClassFor(getPointerTy());
16025 unsigned Vreg = MRI.createVirtualRegister(AddrRegClass);
16026 Chain = DAG.getCopyToReg(Chain, dl, Vreg, Size);
16027 SDValue Value = DAG.getNode(X86ISD::SEG_ALLOCA, dl, SPTy, Chain,
16028 DAG.getRegister(Vreg, SPTy));
16029 SDValue Ops1[2] = { Value, Chain };
16030 return DAG.getMergeValues(Ops1, dl);
16033 const unsigned Reg = (Subtarget->isTarget64BitLP64() ? X86::RAX : X86::EAX);
16035 Chain = DAG.getCopyToReg(Chain, dl, Reg, Size, Flag);
16036 Flag = Chain.getValue(1);
16037 SDVTList NodeTys = DAG.getVTList(MVT::Other, MVT::Glue);
16039 Chain = DAG.getNode(X86ISD::WIN_ALLOCA, dl, NodeTys, Chain, Flag);
16041 const X86RegisterInfo *RegInfo = static_cast<const X86RegisterInfo *>(
16042 DAG.getSubtarget().getRegisterInfo());
16043 unsigned SPReg = RegInfo->getStackRegister();
16044 SDValue SP = DAG.getCopyFromReg(Chain, dl, SPReg, SPTy);
16045 Chain = SP.getValue(1);
16048 SP = DAG.getNode(ISD::AND, dl, VT, SP.getValue(0),
16049 DAG.getConstant(-(uint64_t)Align, VT));
16050 Chain = DAG.getCopyToReg(Chain, dl, SPReg, SP);
16053 SDValue Ops1[2] = { SP, Chain };
16054 return DAG.getMergeValues(Ops1, dl);
16058 SDValue X86TargetLowering::LowerVASTART(SDValue Op, SelectionDAG &DAG) const {
16059 MachineFunction &MF = DAG.getMachineFunction();
16060 X86MachineFunctionInfo *FuncInfo = MF.getInfo<X86MachineFunctionInfo>();
16062 const Value *SV = cast<SrcValueSDNode>(Op.getOperand(2))->getValue();
16065 if (!Subtarget->is64Bit() || Subtarget->isTargetWin64()) {
16066 // vastart just stores the address of the VarArgsFrameIndex slot into the
16067 // memory location argument.
16068 SDValue FR = DAG.getFrameIndex(FuncInfo->getVarArgsFrameIndex(),
16070 return DAG.getStore(Op.getOperand(0), DL, FR, Op.getOperand(1),
16071 MachinePointerInfo(SV), false, false, 0);
16075 // gp_offset (0 - 6 * 8)
16076 // fp_offset (48 - 48 + 8 * 16)
16077 // overflow_arg_area (point to parameters coming in memory).
16079 SmallVector<SDValue, 8> MemOps;
16080 SDValue FIN = Op.getOperand(1);
16082 SDValue Store = DAG.getStore(Op.getOperand(0), DL,
16083 DAG.getConstant(FuncInfo->getVarArgsGPOffset(),
16085 FIN, MachinePointerInfo(SV), false, false, 0);
16086 MemOps.push_back(Store);
16089 FIN = DAG.getNode(ISD::ADD, DL, getPointerTy(),
16090 FIN, DAG.getIntPtrConstant(4));
16091 Store = DAG.getStore(Op.getOperand(0), DL,
16092 DAG.getConstant(FuncInfo->getVarArgsFPOffset(),
16094 FIN, MachinePointerInfo(SV, 4), false, false, 0);
16095 MemOps.push_back(Store);
16097 // Store ptr to overflow_arg_area
16098 FIN = DAG.getNode(ISD::ADD, DL, getPointerTy(),
16099 FIN, DAG.getIntPtrConstant(4));
16100 SDValue OVFIN = DAG.getFrameIndex(FuncInfo->getVarArgsFrameIndex(),
16102 Store = DAG.getStore(Op.getOperand(0), DL, OVFIN, FIN,
16103 MachinePointerInfo(SV, 8),
16105 MemOps.push_back(Store);
16107 // Store ptr to reg_save_area.
16108 FIN = DAG.getNode(ISD::ADD, DL, getPointerTy(),
16109 FIN, DAG.getIntPtrConstant(8));
16110 SDValue RSFIN = DAG.getFrameIndex(FuncInfo->getRegSaveFrameIndex(),
16112 Store = DAG.getStore(Op.getOperand(0), DL, RSFIN, FIN,
16113 MachinePointerInfo(SV, 16), false, false, 0);
16114 MemOps.push_back(Store);
16115 return DAG.getNode(ISD::TokenFactor, DL, MVT::Other, MemOps);
16118 SDValue X86TargetLowering::LowerVAARG(SDValue Op, SelectionDAG &DAG) const {
16119 assert(Subtarget->is64Bit() &&
16120 "LowerVAARG only handles 64-bit va_arg!");
16121 assert((Subtarget->isTargetLinux() ||
16122 Subtarget->isTargetDarwin()) &&
16123 "Unhandled target in LowerVAARG");
16124 assert(Op.getNode()->getNumOperands() == 4);
16125 SDValue Chain = Op.getOperand(0);
16126 SDValue SrcPtr = Op.getOperand(1);
16127 const Value *SV = cast<SrcValueSDNode>(Op.getOperand(2))->getValue();
16128 unsigned Align = Op.getConstantOperandVal(3);
16131 EVT ArgVT = Op.getNode()->getValueType(0);
16132 Type *ArgTy = ArgVT.getTypeForEVT(*DAG.getContext());
16133 uint32_t ArgSize = getDataLayout()->getTypeAllocSize(ArgTy);
16136 // Decide which area this value should be read from.
16137 // TODO: Implement the AMD64 ABI in its entirety. This simple
16138 // selection mechanism works only for the basic types.
16139 if (ArgVT == MVT::f80) {
16140 llvm_unreachable("va_arg for f80 not yet implemented");
16141 } else if (ArgVT.isFloatingPoint() && ArgSize <= 16 /*bytes*/) {
16142 ArgMode = 2; // Argument passed in XMM register. Use fp_offset.
16143 } else if (ArgVT.isInteger() && ArgSize <= 32 /*bytes*/) {
16144 ArgMode = 1; // Argument passed in GPR64 register(s). Use gp_offset.
16146 llvm_unreachable("Unhandled argument type in LowerVAARG");
16149 if (ArgMode == 2) {
16150 // Sanity Check: Make sure using fp_offset makes sense.
16151 assert(!DAG.getTarget().Options.UseSoftFloat &&
16152 !(DAG.getMachineFunction()
16153 .getFunction()->getAttributes()
16154 .hasAttribute(AttributeSet::FunctionIndex,
16155 Attribute::NoImplicitFloat)) &&
16156 Subtarget->hasSSE1());
16159 // Insert VAARG_64 node into the DAG
16160 // VAARG_64 returns two values: Variable Argument Address, Chain
16161 SmallVector<SDValue, 11> InstOps;
16162 InstOps.push_back(Chain);
16163 InstOps.push_back(SrcPtr);
16164 InstOps.push_back(DAG.getConstant(ArgSize, MVT::i32));
16165 InstOps.push_back(DAG.getConstant(ArgMode, MVT::i8));
16166 InstOps.push_back(DAG.getConstant(Align, MVT::i32));
16167 SDVTList VTs = DAG.getVTList(getPointerTy(), MVT::Other);
16168 SDValue VAARG = DAG.getMemIntrinsicNode(X86ISD::VAARG_64, dl,
16169 VTs, InstOps, MVT::i64,
16170 MachinePointerInfo(SV),
16172 /*Volatile=*/false,
16174 /*WriteMem=*/true);
16175 Chain = VAARG.getValue(1);
16177 // Load the next argument and return it
16178 return DAG.getLoad(ArgVT, dl,
16181 MachinePointerInfo(),
16182 false, false, false, 0);
16185 static SDValue LowerVACOPY(SDValue Op, const X86Subtarget *Subtarget,
16186 SelectionDAG &DAG) {
16187 // X86-64 va_list is a struct { i32, i32, i8*, i8* }.
16188 assert(Subtarget->is64Bit() && "This code only handles 64-bit va_copy!");
16189 SDValue Chain = Op.getOperand(0);
16190 SDValue DstPtr = Op.getOperand(1);
16191 SDValue SrcPtr = Op.getOperand(2);
16192 const Value *DstSV = cast<SrcValueSDNode>(Op.getOperand(3))->getValue();
16193 const Value *SrcSV = cast<SrcValueSDNode>(Op.getOperand(4))->getValue();
16196 return DAG.getMemcpy(Chain, DL, DstPtr, SrcPtr,
16197 DAG.getIntPtrConstant(24), 8, /*isVolatile*/false,
16199 MachinePointerInfo(DstSV), MachinePointerInfo(SrcSV));
16202 // getTargetVShiftByConstNode - Handle vector element shifts where the shift
16203 // amount is a constant. Takes immediate version of shift as input.
16204 static SDValue getTargetVShiftByConstNode(unsigned Opc, SDLoc dl, MVT VT,
16205 SDValue SrcOp, uint64_t ShiftAmt,
16206 SelectionDAG &DAG) {
16207 MVT ElementType = VT.getVectorElementType();
16209 // Fold this packed shift into its first operand if ShiftAmt is 0.
16213 // Check for ShiftAmt >= element width
16214 if (ShiftAmt >= ElementType.getSizeInBits()) {
16215 if (Opc == X86ISD::VSRAI)
16216 ShiftAmt = ElementType.getSizeInBits() - 1;
16218 return DAG.getConstant(0, VT);
16221 assert((Opc == X86ISD::VSHLI || Opc == X86ISD::VSRLI || Opc == X86ISD::VSRAI)
16222 && "Unknown target vector shift-by-constant node");
16224 // Fold this packed vector shift into a build vector if SrcOp is a
16225 // vector of Constants or UNDEFs, and SrcOp valuetype is the same as VT.
16226 if (VT == SrcOp.getSimpleValueType() &&
16227 ISD::isBuildVectorOfConstantSDNodes(SrcOp.getNode())) {
16228 SmallVector<SDValue, 8> Elts;
16229 unsigned NumElts = SrcOp->getNumOperands();
16230 ConstantSDNode *ND;
16233 default: llvm_unreachable(nullptr);
16234 case X86ISD::VSHLI:
16235 for (unsigned i=0; i!=NumElts; ++i) {
16236 SDValue CurrentOp = SrcOp->getOperand(i);
16237 if (CurrentOp->getOpcode() == ISD::UNDEF) {
16238 Elts.push_back(CurrentOp);
16241 ND = cast<ConstantSDNode>(CurrentOp);
16242 const APInt &C = ND->getAPIntValue();
16243 Elts.push_back(DAG.getConstant(C.shl(ShiftAmt), ElementType));
16246 case X86ISD::VSRLI:
16247 for (unsigned i=0; i!=NumElts; ++i) {
16248 SDValue CurrentOp = SrcOp->getOperand(i);
16249 if (CurrentOp->getOpcode() == ISD::UNDEF) {
16250 Elts.push_back(CurrentOp);
16253 ND = cast<ConstantSDNode>(CurrentOp);
16254 const APInt &C = ND->getAPIntValue();
16255 Elts.push_back(DAG.getConstant(C.lshr(ShiftAmt), ElementType));
16258 case X86ISD::VSRAI:
16259 for (unsigned i=0; i!=NumElts; ++i) {
16260 SDValue CurrentOp = SrcOp->getOperand(i);
16261 if (CurrentOp->getOpcode() == ISD::UNDEF) {
16262 Elts.push_back(CurrentOp);
16265 ND = cast<ConstantSDNode>(CurrentOp);
16266 const APInt &C = ND->getAPIntValue();
16267 Elts.push_back(DAG.getConstant(C.ashr(ShiftAmt), ElementType));
16272 return DAG.getNode(ISD::BUILD_VECTOR, dl, VT, Elts);
16275 return DAG.getNode(Opc, dl, VT, SrcOp, DAG.getConstant(ShiftAmt, MVT::i8));
16278 // getTargetVShiftNode - Handle vector element shifts where the shift amount
16279 // may or may not be a constant. Takes immediate version of shift as input.
16280 static SDValue getTargetVShiftNode(unsigned Opc, SDLoc dl, MVT VT,
16281 SDValue SrcOp, SDValue ShAmt,
16282 SelectionDAG &DAG) {
16283 assert(ShAmt.getValueType() == MVT::i32 && "ShAmt is not i32");
16285 // Catch shift-by-constant.
16286 if (ConstantSDNode *CShAmt = dyn_cast<ConstantSDNode>(ShAmt))
16287 return getTargetVShiftByConstNode(Opc, dl, VT, SrcOp,
16288 CShAmt->getZExtValue(), DAG);
16290 // Change opcode to non-immediate version
16292 default: llvm_unreachable("Unknown target vector shift node");
16293 case X86ISD::VSHLI: Opc = X86ISD::VSHL; break;
16294 case X86ISD::VSRLI: Opc = X86ISD::VSRL; break;
16295 case X86ISD::VSRAI: Opc = X86ISD::VSRA; break;
16298 // Need to build a vector containing shift amount
16299 // Shift amount is 32-bits, but SSE instructions read 64-bit, so fill with 0
16302 ShOps[1] = DAG.getConstant(0, MVT::i32);
16303 ShOps[2] = ShOps[3] = DAG.getUNDEF(MVT::i32);
16304 ShAmt = DAG.getNode(ISD::BUILD_VECTOR, dl, MVT::v4i32, ShOps);
16306 // The return type has to be a 128-bit type with the same element
16307 // type as the input type.
16308 MVT EltVT = VT.getVectorElementType();
16309 EVT ShVT = MVT::getVectorVT(EltVT, 128/EltVT.getSizeInBits());
16311 ShAmt = DAG.getNode(ISD::BITCAST, dl, ShVT, ShAmt);
16312 return DAG.getNode(Opc, dl, VT, SrcOp, ShAmt);
16315 /// \brief Return (and \p Op, \p Mask) for compare instructions or
16316 /// (vselect \p Mask, \p Op, \p PreservedSrc) for others along with the
16317 /// necessary casting for \p Mask when lowering masking intrinsics.
16318 static SDValue getVectorMaskingNode(SDValue Op, SDValue Mask,
16319 SDValue PreservedSrc,
16320 const X86Subtarget *Subtarget,
16321 SelectionDAG &DAG) {
16322 EVT VT = Op.getValueType();
16323 EVT MaskVT = EVT::getVectorVT(*DAG.getContext(),
16324 MVT::i1, VT.getVectorNumElements());
16325 EVT BitcastVT = EVT::getVectorVT(*DAG.getContext(), MVT::i1,
16326 Mask.getValueType().getSizeInBits());
16329 assert(MaskVT.isSimple() && "invalid mask type");
16331 if (isAllOnes(Mask))
16334 // In case when MaskVT equals v2i1 or v4i1, low 2 or 4 elements
16335 // are extracted by EXTRACT_SUBVECTOR.
16336 SDValue VMask = DAG.getNode(ISD::EXTRACT_SUBVECTOR, dl, MaskVT,
16337 DAG.getNode(ISD::BITCAST, dl, BitcastVT, Mask),
16338 DAG.getIntPtrConstant(0));
16340 switch (Op.getOpcode()) {
16342 case X86ISD::PCMPEQM:
16343 case X86ISD::PCMPGTM:
16345 case X86ISD::CMPMU:
16346 return DAG.getNode(ISD::AND, dl, VT, Op, VMask);
16348 if (PreservedSrc.getOpcode() == ISD::UNDEF)
16349 PreservedSrc = getZeroVector(VT, Subtarget, DAG, dl);
16350 return DAG.getNode(ISD::VSELECT, dl, VT, VMask, Op, PreservedSrc);
16353 static unsigned getOpcodeForFMAIntrinsic(unsigned IntNo) {
16355 default: llvm_unreachable("Impossible intrinsic"); // Can't reach here.
16356 case Intrinsic::x86_fma_vfmadd_ps:
16357 case Intrinsic::x86_fma_vfmadd_pd:
16358 case Intrinsic::x86_fma_vfmadd_ps_256:
16359 case Intrinsic::x86_fma_vfmadd_pd_256:
16360 case Intrinsic::x86_fma_mask_vfmadd_ps_512:
16361 case Intrinsic::x86_fma_mask_vfmadd_pd_512:
16362 return X86ISD::FMADD;
16363 case Intrinsic::x86_fma_vfmsub_ps:
16364 case Intrinsic::x86_fma_vfmsub_pd:
16365 case Intrinsic::x86_fma_vfmsub_ps_256:
16366 case Intrinsic::x86_fma_vfmsub_pd_256:
16367 case Intrinsic::x86_fma_mask_vfmsub_ps_512:
16368 case Intrinsic::x86_fma_mask_vfmsub_pd_512:
16369 return X86ISD::FMSUB;
16370 case Intrinsic::x86_fma_vfnmadd_ps:
16371 case Intrinsic::x86_fma_vfnmadd_pd:
16372 case Intrinsic::x86_fma_vfnmadd_ps_256:
16373 case Intrinsic::x86_fma_vfnmadd_pd_256:
16374 case Intrinsic::x86_fma_mask_vfnmadd_ps_512:
16375 case Intrinsic::x86_fma_mask_vfnmadd_pd_512:
16376 return X86ISD::FNMADD;
16377 case Intrinsic::x86_fma_vfnmsub_ps:
16378 case Intrinsic::x86_fma_vfnmsub_pd:
16379 case Intrinsic::x86_fma_vfnmsub_ps_256:
16380 case Intrinsic::x86_fma_vfnmsub_pd_256:
16381 case Intrinsic::x86_fma_mask_vfnmsub_ps_512:
16382 case Intrinsic::x86_fma_mask_vfnmsub_pd_512:
16383 return X86ISD::FNMSUB;
16384 case Intrinsic::x86_fma_vfmaddsub_ps:
16385 case Intrinsic::x86_fma_vfmaddsub_pd:
16386 case Intrinsic::x86_fma_vfmaddsub_ps_256:
16387 case Intrinsic::x86_fma_vfmaddsub_pd_256:
16388 case Intrinsic::x86_fma_mask_vfmaddsub_ps_512:
16389 case Intrinsic::x86_fma_mask_vfmaddsub_pd_512:
16390 return X86ISD::FMADDSUB;
16391 case Intrinsic::x86_fma_vfmsubadd_ps:
16392 case Intrinsic::x86_fma_vfmsubadd_pd:
16393 case Intrinsic::x86_fma_vfmsubadd_ps_256:
16394 case Intrinsic::x86_fma_vfmsubadd_pd_256:
16395 case Intrinsic::x86_fma_mask_vfmsubadd_ps_512:
16396 case Intrinsic::x86_fma_mask_vfmsubadd_pd_512:
16397 return X86ISD::FMSUBADD;
16401 static SDValue LowerINTRINSIC_WO_CHAIN(SDValue Op, const X86Subtarget *Subtarget,
16402 SelectionDAG &DAG) {
16404 unsigned IntNo = cast<ConstantSDNode>(Op.getOperand(0))->getZExtValue();
16405 EVT VT = Op.getValueType();
16406 const IntrinsicData* IntrData = getIntrinsicWithoutChain(IntNo);
16408 switch(IntrData->Type) {
16409 case INTR_TYPE_1OP:
16410 return DAG.getNode(IntrData->Opc0, dl, Op.getValueType(), Op.getOperand(1));
16411 case INTR_TYPE_2OP:
16412 return DAG.getNode(IntrData->Opc0, dl, Op.getValueType(), Op.getOperand(1),
16414 case INTR_TYPE_3OP:
16415 return DAG.getNode(IntrData->Opc0, dl, Op.getValueType(), Op.getOperand(1),
16416 Op.getOperand(2), Op.getOperand(3));
16417 case INTR_TYPE_1OP_MASK_RM: {
16418 SDValue Src = Op.getOperand(1);
16419 SDValue Src0 = Op.getOperand(2);
16420 SDValue Mask = Op.getOperand(3);
16421 SDValue RoundingMode = Op.getOperand(4);
16422 return getVectorMaskingNode(DAG.getNode(IntrData->Opc0, dl, VT, Src,
16424 Mask, Src0, Subtarget, DAG);
16428 case CMP_MASK_CC: {
16429 // Comparison intrinsics with masks.
16430 // Example of transformation:
16431 // (i8 (int_x86_avx512_mask_pcmpeq_q_128
16432 // (v2i64 %a), (v2i64 %b), (i8 %mask))) ->
16434 // (v8i1 (insert_subvector undef,
16435 // (v2i1 (and (PCMPEQM %a, %b),
16436 // (extract_subvector
16437 // (v8i1 (bitcast %mask)), 0))), 0))))
16438 EVT VT = Op.getOperand(1).getValueType();
16439 EVT MaskVT = EVT::getVectorVT(*DAG.getContext(), MVT::i1,
16440 VT.getVectorNumElements());
16441 SDValue Mask = Op.getOperand((IntrData->Type == CMP_MASK_CC) ? 4 : 3);
16442 EVT BitcastVT = EVT::getVectorVT(*DAG.getContext(), MVT::i1,
16443 Mask.getValueType().getSizeInBits());
16445 if (IntrData->Type == CMP_MASK_CC) {
16446 Cmp = DAG.getNode(IntrData->Opc0, dl, MaskVT, Op.getOperand(1),
16447 Op.getOperand(2), Op.getOperand(3));
16449 assert(IntrData->Type == CMP_MASK && "Unexpected intrinsic type!");
16450 Cmp = DAG.getNode(IntrData->Opc0, dl, MaskVT, Op.getOperand(1),
16453 SDValue CmpMask = getVectorMaskingNode(Cmp, Mask,
16454 DAG.getTargetConstant(0, MaskVT),
16456 SDValue Res = DAG.getNode(ISD::INSERT_SUBVECTOR, dl, BitcastVT,
16457 DAG.getUNDEF(BitcastVT), CmpMask,
16458 DAG.getIntPtrConstant(0));
16459 return DAG.getNode(ISD::BITCAST, dl, Op.getValueType(), Res);
16461 case COMI: { // Comparison intrinsics
16462 ISD::CondCode CC = (ISD::CondCode)IntrData->Opc1;
16463 SDValue LHS = Op.getOperand(1);
16464 SDValue RHS = Op.getOperand(2);
16465 unsigned X86CC = TranslateX86CC(CC, true, LHS, RHS, DAG);
16466 assert(X86CC != X86::COND_INVALID && "Unexpected illegal condition!");
16467 SDValue Cond = DAG.getNode(IntrData->Opc0, dl, MVT::i32, LHS, RHS);
16468 SDValue SetCC = DAG.getNode(X86ISD::SETCC, dl, MVT::i8,
16469 DAG.getConstant(X86CC, MVT::i8), Cond);
16470 return DAG.getNode(ISD::ZERO_EXTEND, dl, MVT::i32, SetCC);
16473 return getTargetVShiftNode(IntrData->Opc0, dl, Op.getSimpleValueType(),
16474 Op.getOperand(1), Op.getOperand(2), DAG);
16481 default: return SDValue(); // Don't custom lower most intrinsics.
16483 // Arithmetic intrinsics.
16484 case Intrinsic::x86_sse2_pmulu_dq:
16485 case Intrinsic::x86_avx2_pmulu_dq:
16486 return DAG.getNode(X86ISD::PMULUDQ, dl, Op.getValueType(),
16487 Op.getOperand(1), Op.getOperand(2));
16489 case Intrinsic::x86_sse41_pmuldq:
16490 case Intrinsic::x86_avx2_pmul_dq:
16491 return DAG.getNode(X86ISD::PMULDQ, dl, Op.getValueType(),
16492 Op.getOperand(1), Op.getOperand(2));
16494 case Intrinsic::x86_sse2_pmulhu_w:
16495 case Intrinsic::x86_avx2_pmulhu_w:
16496 return DAG.getNode(ISD::MULHU, dl, Op.getValueType(),
16497 Op.getOperand(1), Op.getOperand(2));
16499 case Intrinsic::x86_sse2_pmulh_w:
16500 case Intrinsic::x86_avx2_pmulh_w:
16501 return DAG.getNode(ISD::MULHS, dl, Op.getValueType(),
16502 Op.getOperand(1), Op.getOperand(2));
16504 // SSE/SSE2/AVX floating point max/min intrinsics.
16505 case Intrinsic::x86_sse_max_ps:
16506 case Intrinsic::x86_sse2_max_pd:
16507 case Intrinsic::x86_avx_max_ps_256:
16508 case Intrinsic::x86_avx_max_pd_256:
16509 case Intrinsic::x86_sse_min_ps:
16510 case Intrinsic::x86_sse2_min_pd:
16511 case Intrinsic::x86_avx_min_ps_256:
16512 case Intrinsic::x86_avx_min_pd_256: {
16515 default: llvm_unreachable("Impossible intrinsic"); // Can't reach here.
16516 case Intrinsic::x86_sse_max_ps:
16517 case Intrinsic::x86_sse2_max_pd:
16518 case Intrinsic::x86_avx_max_ps_256:
16519 case Intrinsic::x86_avx_max_pd_256:
16520 Opcode = X86ISD::FMAX;
16522 case Intrinsic::x86_sse_min_ps:
16523 case Intrinsic::x86_sse2_min_pd:
16524 case Intrinsic::x86_avx_min_ps_256:
16525 case Intrinsic::x86_avx_min_pd_256:
16526 Opcode = X86ISD::FMIN;
16529 return DAG.getNode(Opcode, dl, Op.getValueType(),
16530 Op.getOperand(1), Op.getOperand(2));
16533 // AVX2 variable shift intrinsics
16534 case Intrinsic::x86_avx2_psllv_d:
16535 case Intrinsic::x86_avx2_psllv_q:
16536 case Intrinsic::x86_avx2_psllv_d_256:
16537 case Intrinsic::x86_avx2_psllv_q_256:
16538 case Intrinsic::x86_avx2_psrlv_d:
16539 case Intrinsic::x86_avx2_psrlv_q:
16540 case Intrinsic::x86_avx2_psrlv_d_256:
16541 case Intrinsic::x86_avx2_psrlv_q_256:
16542 case Intrinsic::x86_avx2_psrav_d:
16543 case Intrinsic::x86_avx2_psrav_d_256: {
16546 default: llvm_unreachable("Impossible intrinsic"); // Can't reach here.
16547 case Intrinsic::x86_avx2_psllv_d:
16548 case Intrinsic::x86_avx2_psllv_q:
16549 case Intrinsic::x86_avx2_psllv_d_256:
16550 case Intrinsic::x86_avx2_psllv_q_256:
16553 case Intrinsic::x86_avx2_psrlv_d:
16554 case Intrinsic::x86_avx2_psrlv_q:
16555 case Intrinsic::x86_avx2_psrlv_d_256:
16556 case Intrinsic::x86_avx2_psrlv_q_256:
16559 case Intrinsic::x86_avx2_psrav_d:
16560 case Intrinsic::x86_avx2_psrav_d_256:
16564 return DAG.getNode(Opcode, dl, Op.getValueType(),
16565 Op.getOperand(1), Op.getOperand(2));
16568 case Intrinsic::x86_sse2_packssdw_128:
16569 case Intrinsic::x86_sse2_packsswb_128:
16570 case Intrinsic::x86_avx2_packssdw:
16571 case Intrinsic::x86_avx2_packsswb:
16572 return DAG.getNode(X86ISD::PACKSS, dl, Op.getValueType(),
16573 Op.getOperand(1), Op.getOperand(2));
16575 case Intrinsic::x86_sse2_packuswb_128:
16576 case Intrinsic::x86_sse41_packusdw:
16577 case Intrinsic::x86_avx2_packuswb:
16578 case Intrinsic::x86_avx2_packusdw:
16579 return DAG.getNode(X86ISD::PACKUS, dl, Op.getValueType(),
16580 Op.getOperand(1), Op.getOperand(2));
16582 case Intrinsic::x86_ssse3_pshuf_b_128:
16583 case Intrinsic::x86_avx2_pshuf_b:
16584 return DAG.getNode(X86ISD::PSHUFB, dl, Op.getValueType(),
16585 Op.getOperand(1), Op.getOperand(2));
16587 case Intrinsic::x86_sse2_pshuf_d:
16588 return DAG.getNode(X86ISD::PSHUFD, dl, Op.getValueType(),
16589 Op.getOperand(1), Op.getOperand(2));
16591 case Intrinsic::x86_sse2_pshufl_w:
16592 return DAG.getNode(X86ISD::PSHUFLW, dl, Op.getValueType(),
16593 Op.getOperand(1), Op.getOperand(2));
16595 case Intrinsic::x86_sse2_pshufh_w:
16596 return DAG.getNode(X86ISD::PSHUFHW, dl, Op.getValueType(),
16597 Op.getOperand(1), Op.getOperand(2));
16599 case Intrinsic::x86_ssse3_psign_b_128:
16600 case Intrinsic::x86_ssse3_psign_w_128:
16601 case Intrinsic::x86_ssse3_psign_d_128:
16602 case Intrinsic::x86_avx2_psign_b:
16603 case Intrinsic::x86_avx2_psign_w:
16604 case Intrinsic::x86_avx2_psign_d:
16605 return DAG.getNode(X86ISD::PSIGN, dl, Op.getValueType(),
16606 Op.getOperand(1), Op.getOperand(2));
16608 case Intrinsic::x86_avx2_permd:
16609 case Intrinsic::x86_avx2_permps:
16610 // Operands intentionally swapped. Mask is last operand to intrinsic,
16611 // but second operand for node/instruction.
16612 return DAG.getNode(X86ISD::VPERMV, dl, Op.getValueType(),
16613 Op.getOperand(2), Op.getOperand(1));
16615 case Intrinsic::x86_avx512_mask_valign_q_512:
16616 case Intrinsic::x86_avx512_mask_valign_d_512:
16617 // Vector source operands are swapped.
16618 return getVectorMaskingNode(DAG.getNode(X86ISD::VALIGN, dl,
16619 Op.getValueType(), Op.getOperand(2),
16622 Op.getOperand(5), Op.getOperand(4),
16625 // ptest and testp intrinsics. The intrinsic these come from are designed to
16626 // return an integer value, not just an instruction so lower it to the ptest
16627 // or testp pattern and a setcc for the result.
16628 case Intrinsic::x86_sse41_ptestz:
16629 case Intrinsic::x86_sse41_ptestc:
16630 case Intrinsic::x86_sse41_ptestnzc:
16631 case Intrinsic::x86_avx_ptestz_256:
16632 case Intrinsic::x86_avx_ptestc_256:
16633 case Intrinsic::x86_avx_ptestnzc_256:
16634 case Intrinsic::x86_avx_vtestz_ps:
16635 case Intrinsic::x86_avx_vtestc_ps:
16636 case Intrinsic::x86_avx_vtestnzc_ps:
16637 case Intrinsic::x86_avx_vtestz_pd:
16638 case Intrinsic::x86_avx_vtestc_pd:
16639 case Intrinsic::x86_avx_vtestnzc_pd:
16640 case Intrinsic::x86_avx_vtestz_ps_256:
16641 case Intrinsic::x86_avx_vtestc_ps_256:
16642 case Intrinsic::x86_avx_vtestnzc_ps_256:
16643 case Intrinsic::x86_avx_vtestz_pd_256:
16644 case Intrinsic::x86_avx_vtestc_pd_256:
16645 case Intrinsic::x86_avx_vtestnzc_pd_256: {
16646 bool IsTestPacked = false;
16649 default: llvm_unreachable("Bad fallthrough in Intrinsic lowering.");
16650 case Intrinsic::x86_avx_vtestz_ps:
16651 case Intrinsic::x86_avx_vtestz_pd:
16652 case Intrinsic::x86_avx_vtestz_ps_256:
16653 case Intrinsic::x86_avx_vtestz_pd_256:
16654 IsTestPacked = true; // Fallthrough
16655 case Intrinsic::x86_sse41_ptestz:
16656 case Intrinsic::x86_avx_ptestz_256:
16658 X86CC = X86::COND_E;
16660 case Intrinsic::x86_avx_vtestc_ps:
16661 case Intrinsic::x86_avx_vtestc_pd:
16662 case Intrinsic::x86_avx_vtestc_ps_256:
16663 case Intrinsic::x86_avx_vtestc_pd_256:
16664 IsTestPacked = true; // Fallthrough
16665 case Intrinsic::x86_sse41_ptestc:
16666 case Intrinsic::x86_avx_ptestc_256:
16668 X86CC = X86::COND_B;
16670 case Intrinsic::x86_avx_vtestnzc_ps:
16671 case Intrinsic::x86_avx_vtestnzc_pd:
16672 case Intrinsic::x86_avx_vtestnzc_ps_256:
16673 case Intrinsic::x86_avx_vtestnzc_pd_256:
16674 IsTestPacked = true; // Fallthrough
16675 case Intrinsic::x86_sse41_ptestnzc:
16676 case Intrinsic::x86_avx_ptestnzc_256:
16678 X86CC = X86::COND_A;
16682 SDValue LHS = Op.getOperand(1);
16683 SDValue RHS = Op.getOperand(2);
16684 unsigned TestOpc = IsTestPacked ? X86ISD::TESTP : X86ISD::PTEST;
16685 SDValue Test = DAG.getNode(TestOpc, dl, MVT::i32, LHS, RHS);
16686 SDValue CC = DAG.getConstant(X86CC, MVT::i8);
16687 SDValue SetCC = DAG.getNode(X86ISD::SETCC, dl, MVT::i8, CC, Test);
16688 return DAG.getNode(ISD::ZERO_EXTEND, dl, MVT::i32, SetCC);
16690 case Intrinsic::x86_avx512_kortestz_w:
16691 case Intrinsic::x86_avx512_kortestc_w: {
16692 unsigned X86CC = (IntNo == Intrinsic::x86_avx512_kortestz_w)? X86::COND_E: X86::COND_B;
16693 SDValue LHS = DAG.getNode(ISD::BITCAST, dl, MVT::v16i1, Op.getOperand(1));
16694 SDValue RHS = DAG.getNode(ISD::BITCAST, dl, MVT::v16i1, Op.getOperand(2));
16695 SDValue CC = DAG.getConstant(X86CC, MVT::i8);
16696 SDValue Test = DAG.getNode(X86ISD::KORTEST, dl, MVT::i32, LHS, RHS);
16697 SDValue SetCC = DAG.getNode(X86ISD::SETCC, dl, MVT::i1, CC, Test);
16698 return DAG.getNode(ISD::ZERO_EXTEND, dl, MVT::i32, SetCC);
16701 case Intrinsic::x86_sse42_pcmpistria128:
16702 case Intrinsic::x86_sse42_pcmpestria128:
16703 case Intrinsic::x86_sse42_pcmpistric128:
16704 case Intrinsic::x86_sse42_pcmpestric128:
16705 case Intrinsic::x86_sse42_pcmpistrio128:
16706 case Intrinsic::x86_sse42_pcmpestrio128:
16707 case Intrinsic::x86_sse42_pcmpistris128:
16708 case Intrinsic::x86_sse42_pcmpestris128:
16709 case Intrinsic::x86_sse42_pcmpistriz128:
16710 case Intrinsic::x86_sse42_pcmpestriz128: {
16714 default: llvm_unreachable("Impossible intrinsic"); // Can't reach here.
16715 case Intrinsic::x86_sse42_pcmpistria128:
16716 Opcode = X86ISD::PCMPISTRI;
16717 X86CC = X86::COND_A;
16719 case Intrinsic::x86_sse42_pcmpestria128:
16720 Opcode = X86ISD::PCMPESTRI;
16721 X86CC = X86::COND_A;
16723 case Intrinsic::x86_sse42_pcmpistric128:
16724 Opcode = X86ISD::PCMPISTRI;
16725 X86CC = X86::COND_B;
16727 case Intrinsic::x86_sse42_pcmpestric128:
16728 Opcode = X86ISD::PCMPESTRI;
16729 X86CC = X86::COND_B;
16731 case Intrinsic::x86_sse42_pcmpistrio128:
16732 Opcode = X86ISD::PCMPISTRI;
16733 X86CC = X86::COND_O;
16735 case Intrinsic::x86_sse42_pcmpestrio128:
16736 Opcode = X86ISD::PCMPESTRI;
16737 X86CC = X86::COND_O;
16739 case Intrinsic::x86_sse42_pcmpistris128:
16740 Opcode = X86ISD::PCMPISTRI;
16741 X86CC = X86::COND_S;
16743 case Intrinsic::x86_sse42_pcmpestris128:
16744 Opcode = X86ISD::PCMPESTRI;
16745 X86CC = X86::COND_S;
16747 case Intrinsic::x86_sse42_pcmpistriz128:
16748 Opcode = X86ISD::PCMPISTRI;
16749 X86CC = X86::COND_E;
16751 case Intrinsic::x86_sse42_pcmpestriz128:
16752 Opcode = X86ISD::PCMPESTRI;
16753 X86CC = X86::COND_E;
16756 SmallVector<SDValue, 5> NewOps(Op->op_begin()+1, Op->op_end());
16757 SDVTList VTs = DAG.getVTList(Op.getValueType(), MVT::i32);
16758 SDValue PCMP = DAG.getNode(Opcode, dl, VTs, NewOps);
16759 SDValue SetCC = DAG.getNode(X86ISD::SETCC, dl, MVT::i8,
16760 DAG.getConstant(X86CC, MVT::i8),
16761 SDValue(PCMP.getNode(), 1));
16762 return DAG.getNode(ISD::ZERO_EXTEND, dl, MVT::i32, SetCC);
16765 case Intrinsic::x86_sse42_pcmpistri128:
16766 case Intrinsic::x86_sse42_pcmpestri128: {
16768 if (IntNo == Intrinsic::x86_sse42_pcmpistri128)
16769 Opcode = X86ISD::PCMPISTRI;
16771 Opcode = X86ISD::PCMPESTRI;
16773 SmallVector<SDValue, 5> NewOps(Op->op_begin()+1, Op->op_end());
16774 SDVTList VTs = DAG.getVTList(Op.getValueType(), MVT::i32);
16775 return DAG.getNode(Opcode, dl, VTs, NewOps);
16778 case Intrinsic::x86_fma_mask_vfmadd_ps_512:
16779 case Intrinsic::x86_fma_mask_vfmadd_pd_512:
16780 case Intrinsic::x86_fma_mask_vfmsub_ps_512:
16781 case Intrinsic::x86_fma_mask_vfmsub_pd_512:
16782 case Intrinsic::x86_fma_mask_vfnmadd_ps_512:
16783 case Intrinsic::x86_fma_mask_vfnmadd_pd_512:
16784 case Intrinsic::x86_fma_mask_vfnmsub_ps_512:
16785 case Intrinsic::x86_fma_mask_vfnmsub_pd_512:
16786 case Intrinsic::x86_fma_mask_vfmaddsub_ps_512:
16787 case Intrinsic::x86_fma_mask_vfmaddsub_pd_512:
16788 case Intrinsic::x86_fma_mask_vfmsubadd_ps_512:
16789 case Intrinsic::x86_fma_mask_vfmsubadd_pd_512: {
16790 auto *SAE = cast<ConstantSDNode>(Op.getOperand(5));
16791 if (SAE->getZExtValue() == X86::STATIC_ROUNDING::CUR_DIRECTION)
16792 return getVectorMaskingNode(DAG.getNode(getOpcodeForFMAIntrinsic(IntNo),
16793 dl, Op.getValueType(),
16797 Op.getOperand(4), Op.getOperand(1),
16803 case Intrinsic::x86_fma_vfmadd_ps:
16804 case Intrinsic::x86_fma_vfmadd_pd:
16805 case Intrinsic::x86_fma_vfmsub_ps:
16806 case Intrinsic::x86_fma_vfmsub_pd:
16807 case Intrinsic::x86_fma_vfnmadd_ps:
16808 case Intrinsic::x86_fma_vfnmadd_pd:
16809 case Intrinsic::x86_fma_vfnmsub_ps:
16810 case Intrinsic::x86_fma_vfnmsub_pd:
16811 case Intrinsic::x86_fma_vfmaddsub_ps:
16812 case Intrinsic::x86_fma_vfmaddsub_pd:
16813 case Intrinsic::x86_fma_vfmsubadd_ps:
16814 case Intrinsic::x86_fma_vfmsubadd_pd:
16815 case Intrinsic::x86_fma_vfmadd_ps_256:
16816 case Intrinsic::x86_fma_vfmadd_pd_256:
16817 case Intrinsic::x86_fma_vfmsub_ps_256:
16818 case Intrinsic::x86_fma_vfmsub_pd_256:
16819 case Intrinsic::x86_fma_vfnmadd_ps_256:
16820 case Intrinsic::x86_fma_vfnmadd_pd_256:
16821 case Intrinsic::x86_fma_vfnmsub_ps_256:
16822 case Intrinsic::x86_fma_vfnmsub_pd_256:
16823 case Intrinsic::x86_fma_vfmaddsub_ps_256:
16824 case Intrinsic::x86_fma_vfmaddsub_pd_256:
16825 case Intrinsic::x86_fma_vfmsubadd_ps_256:
16826 case Intrinsic::x86_fma_vfmsubadd_pd_256:
16827 return DAG.getNode(getOpcodeForFMAIntrinsic(IntNo), dl, Op.getValueType(),
16828 Op.getOperand(1), Op.getOperand(2), Op.getOperand(3));
16832 static SDValue getGatherNode(unsigned Opc, SDValue Op, SelectionDAG &DAG,
16833 SDValue Src, SDValue Mask, SDValue Base,
16834 SDValue Index, SDValue ScaleOp, SDValue Chain,
16835 const X86Subtarget * Subtarget) {
16837 ConstantSDNode *C = dyn_cast<ConstantSDNode>(ScaleOp);
16838 assert(C && "Invalid scale type");
16839 SDValue Scale = DAG.getTargetConstant(C->getZExtValue(), MVT::i8);
16840 EVT MaskVT = MVT::getVectorVT(MVT::i1,
16841 Index.getSimpleValueType().getVectorNumElements());
16843 ConstantSDNode *MaskC = dyn_cast<ConstantSDNode>(Mask);
16845 MaskInReg = DAG.getTargetConstant(MaskC->getSExtValue(), MaskVT);
16847 MaskInReg = DAG.getNode(ISD::BITCAST, dl, MaskVT, Mask);
16848 SDVTList VTs = DAG.getVTList(Op.getValueType(), MaskVT, MVT::Other);
16849 SDValue Disp = DAG.getTargetConstant(0, MVT::i32);
16850 SDValue Segment = DAG.getRegister(0, MVT::i32);
16851 if (Src.getOpcode() == ISD::UNDEF)
16852 Src = getZeroVector(Op.getValueType(), Subtarget, DAG, dl);
16853 SDValue Ops[] = {Src, MaskInReg, Base, Scale, Index, Disp, Segment, Chain};
16854 SDNode *Res = DAG.getMachineNode(Opc, dl, VTs, Ops);
16855 SDValue RetOps[] = { SDValue(Res, 0), SDValue(Res, 2) };
16856 return DAG.getMergeValues(RetOps, dl);
16859 static SDValue getScatterNode(unsigned Opc, SDValue Op, SelectionDAG &DAG,
16860 SDValue Src, SDValue Mask, SDValue Base,
16861 SDValue Index, SDValue ScaleOp, SDValue Chain) {
16863 ConstantSDNode *C = dyn_cast<ConstantSDNode>(ScaleOp);
16864 assert(C && "Invalid scale type");
16865 SDValue Scale = DAG.getTargetConstant(C->getZExtValue(), MVT::i8);
16866 SDValue Disp = DAG.getTargetConstant(0, MVT::i32);
16867 SDValue Segment = DAG.getRegister(0, MVT::i32);
16868 EVT MaskVT = MVT::getVectorVT(MVT::i1,
16869 Index.getSimpleValueType().getVectorNumElements());
16871 ConstantSDNode *MaskC = dyn_cast<ConstantSDNode>(Mask);
16873 MaskInReg = DAG.getTargetConstant(MaskC->getSExtValue(), MaskVT);
16875 MaskInReg = DAG.getNode(ISD::BITCAST, dl, MaskVT, Mask);
16876 SDVTList VTs = DAG.getVTList(MaskVT, MVT::Other);
16877 SDValue Ops[] = {Base, Scale, Index, Disp, Segment, MaskInReg, Src, Chain};
16878 SDNode *Res = DAG.getMachineNode(Opc, dl, VTs, Ops);
16879 return SDValue(Res, 1);
16882 static SDValue getPrefetchNode(unsigned Opc, SDValue Op, SelectionDAG &DAG,
16883 SDValue Mask, SDValue Base, SDValue Index,
16884 SDValue ScaleOp, SDValue Chain) {
16886 ConstantSDNode *C = dyn_cast<ConstantSDNode>(ScaleOp);
16887 assert(C && "Invalid scale type");
16888 SDValue Scale = DAG.getTargetConstant(C->getZExtValue(), MVT::i8);
16889 SDValue Disp = DAG.getTargetConstant(0, MVT::i32);
16890 SDValue Segment = DAG.getRegister(0, MVT::i32);
16892 MVT::getVectorVT(MVT::i1, Index.getSimpleValueType().getVectorNumElements());
16894 ConstantSDNode *MaskC = dyn_cast<ConstantSDNode>(Mask);
16896 MaskInReg = DAG.getTargetConstant(MaskC->getSExtValue(), MaskVT);
16898 MaskInReg = DAG.getNode(ISD::BITCAST, dl, MaskVT, Mask);
16899 //SDVTList VTs = DAG.getVTList(MVT::Other);
16900 SDValue Ops[] = {MaskInReg, Base, Scale, Index, Disp, Segment, Chain};
16901 SDNode *Res = DAG.getMachineNode(Opc, dl, MVT::Other, Ops);
16902 return SDValue(Res, 0);
16905 // getReadPerformanceCounter - Handles the lowering of builtin intrinsics that
16906 // read performance monitor counters (x86_rdpmc).
16907 static void getReadPerformanceCounter(SDNode *N, SDLoc DL,
16908 SelectionDAG &DAG, const X86Subtarget *Subtarget,
16909 SmallVectorImpl<SDValue> &Results) {
16910 assert(N->getNumOperands() == 3 && "Unexpected number of operands!");
16911 SDVTList Tys = DAG.getVTList(MVT::Other, MVT::Glue);
16914 // The ECX register is used to select the index of the performance counter
16916 SDValue Chain = DAG.getCopyToReg(N->getOperand(0), DL, X86::ECX,
16918 SDValue rd = DAG.getNode(X86ISD::RDPMC_DAG, DL, Tys, Chain);
16920 // Reads the content of a 64-bit performance counter and returns it in the
16921 // registers EDX:EAX.
16922 if (Subtarget->is64Bit()) {
16923 LO = DAG.getCopyFromReg(rd, DL, X86::RAX, MVT::i64, rd.getValue(1));
16924 HI = DAG.getCopyFromReg(LO.getValue(1), DL, X86::RDX, MVT::i64,
16927 LO = DAG.getCopyFromReg(rd, DL, X86::EAX, MVT::i32, rd.getValue(1));
16928 HI = DAG.getCopyFromReg(LO.getValue(1), DL, X86::EDX, MVT::i32,
16931 Chain = HI.getValue(1);
16933 if (Subtarget->is64Bit()) {
16934 // The EAX register is loaded with the low-order 32 bits. The EDX register
16935 // is loaded with the supported high-order bits of the counter.
16936 SDValue Tmp = DAG.getNode(ISD::SHL, DL, MVT::i64, HI,
16937 DAG.getConstant(32, MVT::i8));
16938 Results.push_back(DAG.getNode(ISD::OR, DL, MVT::i64, LO, Tmp));
16939 Results.push_back(Chain);
16943 // Use a buildpair to merge the two 32-bit values into a 64-bit one.
16944 SDValue Ops[] = { LO, HI };
16945 SDValue Pair = DAG.getNode(ISD::BUILD_PAIR, DL, MVT::i64, Ops);
16946 Results.push_back(Pair);
16947 Results.push_back(Chain);
16950 // getReadTimeStampCounter - Handles the lowering of builtin intrinsics that
16951 // read the time stamp counter (x86_rdtsc and x86_rdtscp). This function is
16952 // also used to custom lower READCYCLECOUNTER nodes.
16953 static void getReadTimeStampCounter(SDNode *N, SDLoc DL, unsigned Opcode,
16954 SelectionDAG &DAG, const X86Subtarget *Subtarget,
16955 SmallVectorImpl<SDValue> &Results) {
16956 SDVTList Tys = DAG.getVTList(MVT::Other, MVT::Glue);
16957 SDValue rd = DAG.getNode(Opcode, DL, Tys, N->getOperand(0));
16960 // The processor's time-stamp counter (a 64-bit MSR) is stored into the
16961 // EDX:EAX registers. EDX is loaded with the high-order 32 bits of the MSR
16962 // and the EAX register is loaded with the low-order 32 bits.
16963 if (Subtarget->is64Bit()) {
16964 LO = DAG.getCopyFromReg(rd, DL, X86::RAX, MVT::i64, rd.getValue(1));
16965 HI = DAG.getCopyFromReg(LO.getValue(1), DL, X86::RDX, MVT::i64,
16968 LO = DAG.getCopyFromReg(rd, DL, X86::EAX, MVT::i32, rd.getValue(1));
16969 HI = DAG.getCopyFromReg(LO.getValue(1), DL, X86::EDX, MVT::i32,
16972 SDValue Chain = HI.getValue(1);
16974 if (Opcode == X86ISD::RDTSCP_DAG) {
16975 assert(N->getNumOperands() == 3 && "Unexpected number of operands!");
16977 // Instruction RDTSCP loads the IA32:TSC_AUX_MSR (address C000_0103H) into
16978 // the ECX register. Add 'ecx' explicitly to the chain.
16979 SDValue ecx = DAG.getCopyFromReg(Chain, DL, X86::ECX, MVT::i32,
16981 // Explicitly store the content of ECX at the location passed in input
16982 // to the 'rdtscp' intrinsic.
16983 Chain = DAG.getStore(ecx.getValue(1), DL, ecx, N->getOperand(2),
16984 MachinePointerInfo(), false, false, 0);
16987 if (Subtarget->is64Bit()) {
16988 // The EDX register is loaded with the high-order 32 bits of the MSR, and
16989 // the EAX register is loaded with the low-order 32 bits.
16990 SDValue Tmp = DAG.getNode(ISD::SHL, DL, MVT::i64, HI,
16991 DAG.getConstant(32, MVT::i8));
16992 Results.push_back(DAG.getNode(ISD::OR, DL, MVT::i64, LO, Tmp));
16993 Results.push_back(Chain);
16997 // Use a buildpair to merge the two 32-bit values into a 64-bit one.
16998 SDValue Ops[] = { LO, HI };
16999 SDValue Pair = DAG.getNode(ISD::BUILD_PAIR, DL, MVT::i64, Ops);
17000 Results.push_back(Pair);
17001 Results.push_back(Chain);
17004 static SDValue LowerREADCYCLECOUNTER(SDValue Op, const X86Subtarget *Subtarget,
17005 SelectionDAG &DAG) {
17006 SmallVector<SDValue, 2> Results;
17008 getReadTimeStampCounter(Op.getNode(), DL, X86ISD::RDTSC_DAG, DAG, Subtarget,
17010 return DAG.getMergeValues(Results, DL);
17014 static SDValue LowerINTRINSIC_W_CHAIN(SDValue Op, const X86Subtarget *Subtarget,
17015 SelectionDAG &DAG) {
17016 unsigned IntNo = cast<ConstantSDNode>(Op.getOperand(1))->getZExtValue();
17018 const IntrinsicData* IntrData = getIntrinsicWithChain(IntNo);
17023 switch(IntrData->Type) {
17025 llvm_unreachable("Unknown Intrinsic Type");
17029 // Emit the node with the right value type.
17030 SDVTList VTs = DAG.getVTList(Op->getValueType(0), MVT::Glue, MVT::Other);
17031 SDValue Result = DAG.getNode(IntrData->Opc0, dl, VTs, Op.getOperand(0));
17033 // If the value returned by RDRAND/RDSEED was valid (CF=1), return 1.
17034 // Otherwise return the value from Rand, which is always 0, casted to i32.
17035 SDValue Ops[] = { DAG.getZExtOrTrunc(Result, dl, Op->getValueType(1)),
17036 DAG.getConstant(1, Op->getValueType(1)),
17037 DAG.getConstant(X86::COND_B, MVT::i32),
17038 SDValue(Result.getNode(), 1) };
17039 SDValue isValid = DAG.getNode(X86ISD::CMOV, dl,
17040 DAG.getVTList(Op->getValueType(1), MVT::Glue),
17043 // Return { result, isValid, chain }.
17044 return DAG.getNode(ISD::MERGE_VALUES, dl, Op->getVTList(), Result, isValid,
17045 SDValue(Result.getNode(), 2));
17048 //gather(v1, mask, index, base, scale);
17049 SDValue Chain = Op.getOperand(0);
17050 SDValue Src = Op.getOperand(2);
17051 SDValue Base = Op.getOperand(3);
17052 SDValue Index = Op.getOperand(4);
17053 SDValue Mask = Op.getOperand(5);
17054 SDValue Scale = Op.getOperand(6);
17055 return getGatherNode(IntrData->Opc0, Op, DAG, Src, Mask, Base, Index, Scale, Chain,
17059 //scatter(base, mask, index, v1, scale);
17060 SDValue Chain = Op.getOperand(0);
17061 SDValue Base = Op.getOperand(2);
17062 SDValue Mask = Op.getOperand(3);
17063 SDValue Index = Op.getOperand(4);
17064 SDValue Src = Op.getOperand(5);
17065 SDValue Scale = Op.getOperand(6);
17066 return getScatterNode(IntrData->Opc0, Op, DAG, Src, Mask, Base, Index, Scale, Chain);
17069 SDValue Hint = Op.getOperand(6);
17071 if (dyn_cast<ConstantSDNode> (Hint) == nullptr ||
17072 (HintVal = dyn_cast<ConstantSDNode> (Hint)->getZExtValue()) > 1)
17073 llvm_unreachable("Wrong prefetch hint in intrinsic: should be 0 or 1");
17074 unsigned Opcode = (HintVal ? IntrData->Opc1 : IntrData->Opc0);
17075 SDValue Chain = Op.getOperand(0);
17076 SDValue Mask = Op.getOperand(2);
17077 SDValue Index = Op.getOperand(3);
17078 SDValue Base = Op.getOperand(4);
17079 SDValue Scale = Op.getOperand(5);
17080 return getPrefetchNode(Opcode, Op, DAG, Mask, Base, Index, Scale, Chain);
17082 // Read Time Stamp Counter (RDTSC) and Processor ID (RDTSCP).
17084 SmallVector<SDValue, 2> Results;
17085 getReadTimeStampCounter(Op.getNode(), dl, IntrData->Opc0, DAG, Subtarget, Results);
17086 return DAG.getMergeValues(Results, dl);
17088 // Read Performance Monitoring Counters.
17090 SmallVector<SDValue, 2> Results;
17091 getReadPerformanceCounter(Op.getNode(), dl, DAG, Subtarget, Results);
17092 return DAG.getMergeValues(Results, dl);
17094 // XTEST intrinsics.
17096 SDVTList VTs = DAG.getVTList(Op->getValueType(0), MVT::Other);
17097 SDValue InTrans = DAG.getNode(IntrData->Opc0, dl, VTs, Op.getOperand(0));
17098 SDValue SetCC = DAG.getNode(X86ISD::SETCC, dl, MVT::i8,
17099 DAG.getConstant(X86::COND_NE, MVT::i8),
17101 SDValue Ret = DAG.getNode(ISD::ZERO_EXTEND, dl, Op->getValueType(0), SetCC);
17102 return DAG.getNode(ISD::MERGE_VALUES, dl, Op->getVTList(),
17103 Ret, SDValue(InTrans.getNode(), 1));
17107 SmallVector<SDValue, 2> Results;
17108 SDVTList CFVTs = DAG.getVTList(Op->getValueType(0), MVT::Other);
17109 SDVTList VTs = DAG.getVTList(Op.getOperand(3)->getValueType(0), MVT::Other);
17110 SDValue GenCF = DAG.getNode(X86ISD::ADD, dl, CFVTs, Op.getOperand(2),
17111 DAG.getConstant(-1, MVT::i8));
17112 SDValue Res = DAG.getNode(IntrData->Opc0, dl, VTs, Op.getOperand(3),
17113 Op.getOperand(4), GenCF.getValue(1));
17114 SDValue Store = DAG.getStore(Op.getOperand(0), dl, Res.getValue(0),
17115 Op.getOperand(5), MachinePointerInfo(),
17117 SDValue SetCC = DAG.getNode(X86ISD::SETCC, dl, MVT::i8,
17118 DAG.getConstant(X86::COND_B, MVT::i8),
17120 Results.push_back(SetCC);
17121 Results.push_back(Store);
17122 return DAG.getMergeValues(Results, dl);
17127 SDValue X86TargetLowering::LowerRETURNADDR(SDValue Op,
17128 SelectionDAG &DAG) const {
17129 MachineFrameInfo *MFI = DAG.getMachineFunction().getFrameInfo();
17130 MFI->setReturnAddressIsTaken(true);
17132 if (verifyReturnAddressArgumentIsConstant(Op, DAG))
17135 unsigned Depth = cast<ConstantSDNode>(Op.getOperand(0))->getZExtValue();
17137 EVT PtrVT = getPointerTy();
17140 SDValue FrameAddr = LowerFRAMEADDR(Op, DAG);
17141 const X86RegisterInfo *RegInfo = static_cast<const X86RegisterInfo *>(
17142 DAG.getSubtarget().getRegisterInfo());
17143 SDValue Offset = DAG.getConstant(RegInfo->getSlotSize(), PtrVT);
17144 return DAG.getLoad(PtrVT, dl, DAG.getEntryNode(),
17145 DAG.getNode(ISD::ADD, dl, PtrVT,
17146 FrameAddr, Offset),
17147 MachinePointerInfo(), false, false, false, 0);
17150 // Just load the return address.
17151 SDValue RetAddrFI = getReturnAddressFrameIndex(DAG);
17152 return DAG.getLoad(PtrVT, dl, DAG.getEntryNode(),
17153 RetAddrFI, MachinePointerInfo(), false, false, false, 0);
17156 SDValue X86TargetLowering::LowerFRAMEADDR(SDValue Op, SelectionDAG &DAG) const {
17157 MachineFrameInfo *MFI = DAG.getMachineFunction().getFrameInfo();
17158 MFI->setFrameAddressIsTaken(true);
17160 EVT VT = Op.getValueType();
17161 SDLoc dl(Op); // FIXME probably not meaningful
17162 unsigned Depth = cast<ConstantSDNode>(Op.getOperand(0))->getZExtValue();
17163 const X86RegisterInfo *RegInfo = static_cast<const X86RegisterInfo *>(
17164 DAG.getSubtarget().getRegisterInfo());
17165 unsigned FrameReg = RegInfo->getFrameRegister(DAG.getMachineFunction());
17166 assert(((FrameReg == X86::RBP && VT == MVT::i64) ||
17167 (FrameReg == X86::EBP && VT == MVT::i32)) &&
17168 "Invalid Frame Register!");
17169 SDValue FrameAddr = DAG.getCopyFromReg(DAG.getEntryNode(), dl, FrameReg, VT);
17171 FrameAddr = DAG.getLoad(VT, dl, DAG.getEntryNode(), FrameAddr,
17172 MachinePointerInfo(),
17173 false, false, false, 0);
17177 // FIXME? Maybe this could be a TableGen attribute on some registers and
17178 // this table could be generated automatically from RegInfo.
17179 unsigned X86TargetLowering::getRegisterByName(const char* RegName,
17181 unsigned Reg = StringSwitch<unsigned>(RegName)
17182 .Case("esp", X86::ESP)
17183 .Case("rsp", X86::RSP)
17187 report_fatal_error("Invalid register name global variable");
17190 SDValue X86TargetLowering::LowerFRAME_TO_ARGS_OFFSET(SDValue Op,
17191 SelectionDAG &DAG) const {
17192 const X86RegisterInfo *RegInfo = static_cast<const X86RegisterInfo *>(
17193 DAG.getSubtarget().getRegisterInfo());
17194 return DAG.getIntPtrConstant(2 * RegInfo->getSlotSize());
17197 SDValue X86TargetLowering::LowerEH_RETURN(SDValue Op, SelectionDAG &DAG) const {
17198 SDValue Chain = Op.getOperand(0);
17199 SDValue Offset = Op.getOperand(1);
17200 SDValue Handler = Op.getOperand(2);
17203 EVT PtrVT = getPointerTy();
17204 const X86RegisterInfo *RegInfo = static_cast<const X86RegisterInfo *>(
17205 DAG.getSubtarget().getRegisterInfo());
17206 unsigned FrameReg = RegInfo->getFrameRegister(DAG.getMachineFunction());
17207 assert(((FrameReg == X86::RBP && PtrVT == MVT::i64) ||
17208 (FrameReg == X86::EBP && PtrVT == MVT::i32)) &&
17209 "Invalid Frame Register!");
17210 SDValue Frame = DAG.getCopyFromReg(DAG.getEntryNode(), dl, FrameReg, PtrVT);
17211 unsigned StoreAddrReg = (PtrVT == MVT::i64) ? X86::RCX : X86::ECX;
17213 SDValue StoreAddr = DAG.getNode(ISD::ADD, dl, PtrVT, Frame,
17214 DAG.getIntPtrConstant(RegInfo->getSlotSize()));
17215 StoreAddr = DAG.getNode(ISD::ADD, dl, PtrVT, StoreAddr, Offset);
17216 Chain = DAG.getStore(Chain, dl, Handler, StoreAddr, MachinePointerInfo(),
17218 Chain = DAG.getCopyToReg(Chain, dl, StoreAddrReg, StoreAddr);
17220 return DAG.getNode(X86ISD::EH_RETURN, dl, MVT::Other, Chain,
17221 DAG.getRegister(StoreAddrReg, PtrVT));
17224 SDValue X86TargetLowering::lowerEH_SJLJ_SETJMP(SDValue Op,
17225 SelectionDAG &DAG) const {
17227 return DAG.getNode(X86ISD::EH_SJLJ_SETJMP, DL,
17228 DAG.getVTList(MVT::i32, MVT::Other),
17229 Op.getOperand(0), Op.getOperand(1));
17232 SDValue X86TargetLowering::lowerEH_SJLJ_LONGJMP(SDValue Op,
17233 SelectionDAG &DAG) const {
17235 return DAG.getNode(X86ISD::EH_SJLJ_LONGJMP, DL, MVT::Other,
17236 Op.getOperand(0), Op.getOperand(1));
17239 static SDValue LowerADJUST_TRAMPOLINE(SDValue Op, SelectionDAG &DAG) {
17240 return Op.getOperand(0);
17243 SDValue X86TargetLowering::LowerINIT_TRAMPOLINE(SDValue Op,
17244 SelectionDAG &DAG) const {
17245 SDValue Root = Op.getOperand(0);
17246 SDValue Trmp = Op.getOperand(1); // trampoline
17247 SDValue FPtr = Op.getOperand(2); // nested function
17248 SDValue Nest = Op.getOperand(3); // 'nest' parameter value
17251 const Value *TrmpAddr = cast<SrcValueSDNode>(Op.getOperand(4))->getValue();
17252 const TargetRegisterInfo *TRI = DAG.getSubtarget().getRegisterInfo();
17254 if (Subtarget->is64Bit()) {
17255 SDValue OutChains[6];
17257 // Large code-model.
17258 const unsigned char JMP64r = 0xFF; // 64-bit jmp through register opcode.
17259 const unsigned char MOV64ri = 0xB8; // X86::MOV64ri opcode.
17261 const unsigned char N86R10 = TRI->getEncodingValue(X86::R10) & 0x7;
17262 const unsigned char N86R11 = TRI->getEncodingValue(X86::R11) & 0x7;
17264 const unsigned char REX_WB = 0x40 | 0x08 | 0x01; // REX prefix
17266 // Load the pointer to the nested function into R11.
17267 unsigned OpCode = ((MOV64ri | N86R11) << 8) | REX_WB; // movabsq r11
17268 SDValue Addr = Trmp;
17269 OutChains[0] = DAG.getStore(Root, dl, DAG.getConstant(OpCode, MVT::i16),
17270 Addr, MachinePointerInfo(TrmpAddr),
17273 Addr = DAG.getNode(ISD::ADD, dl, MVT::i64, Trmp,
17274 DAG.getConstant(2, MVT::i64));
17275 OutChains[1] = DAG.getStore(Root, dl, FPtr, Addr,
17276 MachinePointerInfo(TrmpAddr, 2),
17279 // Load the 'nest' parameter value into R10.
17280 // R10 is specified in X86CallingConv.td
17281 OpCode = ((MOV64ri | N86R10) << 8) | REX_WB; // movabsq r10
17282 Addr = DAG.getNode(ISD::ADD, dl, MVT::i64, Trmp,
17283 DAG.getConstant(10, MVT::i64));
17284 OutChains[2] = DAG.getStore(Root, dl, DAG.getConstant(OpCode, MVT::i16),
17285 Addr, MachinePointerInfo(TrmpAddr, 10),
17288 Addr = DAG.getNode(ISD::ADD, dl, MVT::i64, Trmp,
17289 DAG.getConstant(12, MVT::i64));
17290 OutChains[3] = DAG.getStore(Root, dl, Nest, Addr,
17291 MachinePointerInfo(TrmpAddr, 12),
17294 // Jump to the nested function.
17295 OpCode = (JMP64r << 8) | REX_WB; // jmpq *...
17296 Addr = DAG.getNode(ISD::ADD, dl, MVT::i64, Trmp,
17297 DAG.getConstant(20, MVT::i64));
17298 OutChains[4] = DAG.getStore(Root, dl, DAG.getConstant(OpCode, MVT::i16),
17299 Addr, MachinePointerInfo(TrmpAddr, 20),
17302 unsigned char ModRM = N86R11 | (4 << 3) | (3 << 6); // ...r11
17303 Addr = DAG.getNode(ISD::ADD, dl, MVT::i64, Trmp,
17304 DAG.getConstant(22, MVT::i64));
17305 OutChains[5] = DAG.getStore(Root, dl, DAG.getConstant(ModRM, MVT::i8), Addr,
17306 MachinePointerInfo(TrmpAddr, 22),
17309 return DAG.getNode(ISD::TokenFactor, dl, MVT::Other, OutChains);
17311 const Function *Func =
17312 cast<Function>(cast<SrcValueSDNode>(Op.getOperand(5))->getValue());
17313 CallingConv::ID CC = Func->getCallingConv();
17318 llvm_unreachable("Unsupported calling convention");
17319 case CallingConv::C:
17320 case CallingConv::X86_StdCall: {
17321 // Pass 'nest' parameter in ECX.
17322 // Must be kept in sync with X86CallingConv.td
17323 NestReg = X86::ECX;
17325 // Check that ECX wasn't needed by an 'inreg' parameter.
17326 FunctionType *FTy = Func->getFunctionType();
17327 const AttributeSet &Attrs = Func->getAttributes();
17329 if (!Attrs.isEmpty() && !Func->isVarArg()) {
17330 unsigned InRegCount = 0;
17333 for (FunctionType::param_iterator I = FTy->param_begin(),
17334 E = FTy->param_end(); I != E; ++I, ++Idx)
17335 if (Attrs.hasAttribute(Idx, Attribute::InReg))
17336 // FIXME: should only count parameters that are lowered to integers.
17337 InRegCount += (TD->getTypeSizeInBits(*I) + 31) / 32;
17339 if (InRegCount > 2) {
17340 report_fatal_error("Nest register in use - reduce number of inreg"
17346 case CallingConv::X86_FastCall:
17347 case CallingConv::X86_ThisCall:
17348 case CallingConv::Fast:
17349 // Pass 'nest' parameter in EAX.
17350 // Must be kept in sync with X86CallingConv.td
17351 NestReg = X86::EAX;
17355 SDValue OutChains[4];
17356 SDValue Addr, Disp;
17358 Addr = DAG.getNode(ISD::ADD, dl, MVT::i32, Trmp,
17359 DAG.getConstant(10, MVT::i32));
17360 Disp = DAG.getNode(ISD::SUB, dl, MVT::i32, FPtr, Addr);
17362 // This is storing the opcode for MOV32ri.
17363 const unsigned char MOV32ri = 0xB8; // X86::MOV32ri's opcode byte.
17364 const unsigned char N86Reg = TRI->getEncodingValue(NestReg) & 0x7;
17365 OutChains[0] = DAG.getStore(Root, dl,
17366 DAG.getConstant(MOV32ri|N86Reg, MVT::i8),
17367 Trmp, MachinePointerInfo(TrmpAddr),
17370 Addr = DAG.getNode(ISD::ADD, dl, MVT::i32, Trmp,
17371 DAG.getConstant(1, MVT::i32));
17372 OutChains[1] = DAG.getStore(Root, dl, Nest, Addr,
17373 MachinePointerInfo(TrmpAddr, 1),
17376 const unsigned char JMP = 0xE9; // jmp <32bit dst> opcode.
17377 Addr = DAG.getNode(ISD::ADD, dl, MVT::i32, Trmp,
17378 DAG.getConstant(5, MVT::i32));
17379 OutChains[2] = DAG.getStore(Root, dl, DAG.getConstant(JMP, MVT::i8), Addr,
17380 MachinePointerInfo(TrmpAddr, 5),
17383 Addr = DAG.getNode(ISD::ADD, dl, MVT::i32, Trmp,
17384 DAG.getConstant(6, MVT::i32));
17385 OutChains[3] = DAG.getStore(Root, dl, Disp, Addr,
17386 MachinePointerInfo(TrmpAddr, 6),
17389 return DAG.getNode(ISD::TokenFactor, dl, MVT::Other, OutChains);
17393 SDValue X86TargetLowering::LowerFLT_ROUNDS_(SDValue Op,
17394 SelectionDAG &DAG) const {
17396 The rounding mode is in bits 11:10 of FPSR, and has the following
17398 00 Round to nearest
17403 FLT_ROUNDS, on the other hand, expects the following:
17410 To perform the conversion, we do:
17411 (((((FPSR & 0x800) >> 11) | ((FPSR & 0x400) >> 9)) + 1) & 3)
17414 MachineFunction &MF = DAG.getMachineFunction();
17415 const TargetMachine &TM = MF.getTarget();
17416 const TargetFrameLowering &TFI = *TM.getSubtargetImpl()->getFrameLowering();
17417 unsigned StackAlignment = TFI.getStackAlignment();
17418 MVT VT = Op.getSimpleValueType();
17421 // Save FP Control Word to stack slot
17422 int SSFI = MF.getFrameInfo()->CreateStackObject(2, StackAlignment, false);
17423 SDValue StackSlot = DAG.getFrameIndex(SSFI, getPointerTy());
17425 MachineMemOperand *MMO =
17426 MF.getMachineMemOperand(MachinePointerInfo::getFixedStack(SSFI),
17427 MachineMemOperand::MOStore, 2, 2);
17429 SDValue Ops[] = { DAG.getEntryNode(), StackSlot };
17430 SDValue Chain = DAG.getMemIntrinsicNode(X86ISD::FNSTCW16m, DL,
17431 DAG.getVTList(MVT::Other),
17432 Ops, MVT::i16, MMO);
17434 // Load FP Control Word from stack slot
17435 SDValue CWD = DAG.getLoad(MVT::i16, DL, Chain, StackSlot,
17436 MachinePointerInfo(), false, false, false, 0);
17438 // Transform as necessary
17440 DAG.getNode(ISD::SRL, DL, MVT::i16,
17441 DAG.getNode(ISD::AND, DL, MVT::i16,
17442 CWD, DAG.getConstant(0x800, MVT::i16)),
17443 DAG.getConstant(11, MVT::i8));
17445 DAG.getNode(ISD::SRL, DL, MVT::i16,
17446 DAG.getNode(ISD::AND, DL, MVT::i16,
17447 CWD, DAG.getConstant(0x400, MVT::i16)),
17448 DAG.getConstant(9, MVT::i8));
17451 DAG.getNode(ISD::AND, DL, MVT::i16,
17452 DAG.getNode(ISD::ADD, DL, MVT::i16,
17453 DAG.getNode(ISD::OR, DL, MVT::i16, CWD1, CWD2),
17454 DAG.getConstant(1, MVT::i16)),
17455 DAG.getConstant(3, MVT::i16));
17457 return DAG.getNode((VT.getSizeInBits() < 16 ?
17458 ISD::TRUNCATE : ISD::ZERO_EXTEND), DL, VT, RetVal);
17461 static SDValue LowerCTLZ(SDValue Op, SelectionDAG &DAG) {
17462 MVT VT = Op.getSimpleValueType();
17464 unsigned NumBits = VT.getSizeInBits();
17467 Op = Op.getOperand(0);
17468 if (VT == MVT::i8) {
17469 // Zero extend to i32 since there is not an i8 bsr.
17471 Op = DAG.getNode(ISD::ZERO_EXTEND, dl, OpVT, Op);
17474 // Issue a bsr (scan bits in reverse) which also sets EFLAGS.
17475 SDVTList VTs = DAG.getVTList(OpVT, MVT::i32);
17476 Op = DAG.getNode(X86ISD::BSR, dl, VTs, Op);
17478 // If src is zero (i.e. bsr sets ZF), returns NumBits.
17481 DAG.getConstant(NumBits+NumBits-1, OpVT),
17482 DAG.getConstant(X86::COND_E, MVT::i8),
17485 Op = DAG.getNode(X86ISD::CMOV, dl, OpVT, Ops);
17487 // Finally xor with NumBits-1.
17488 Op = DAG.getNode(ISD::XOR, dl, OpVT, Op, DAG.getConstant(NumBits-1, OpVT));
17491 Op = DAG.getNode(ISD::TRUNCATE, dl, MVT::i8, Op);
17495 static SDValue LowerCTLZ_ZERO_UNDEF(SDValue Op, SelectionDAG &DAG) {
17496 MVT VT = Op.getSimpleValueType();
17498 unsigned NumBits = VT.getSizeInBits();
17501 Op = Op.getOperand(0);
17502 if (VT == MVT::i8) {
17503 // Zero extend to i32 since there is not an i8 bsr.
17505 Op = DAG.getNode(ISD::ZERO_EXTEND, dl, OpVT, Op);
17508 // Issue a bsr (scan bits in reverse).
17509 SDVTList VTs = DAG.getVTList(OpVT, MVT::i32);
17510 Op = DAG.getNode(X86ISD::BSR, dl, VTs, Op);
17512 // And xor with NumBits-1.
17513 Op = DAG.getNode(ISD::XOR, dl, OpVT, Op, DAG.getConstant(NumBits-1, OpVT));
17516 Op = DAG.getNode(ISD::TRUNCATE, dl, MVT::i8, Op);
17520 static SDValue LowerCTTZ(SDValue Op, SelectionDAG &DAG) {
17521 MVT VT = Op.getSimpleValueType();
17522 unsigned NumBits = VT.getSizeInBits();
17524 Op = Op.getOperand(0);
17526 // Issue a bsf (scan bits forward) which also sets EFLAGS.
17527 SDVTList VTs = DAG.getVTList(VT, MVT::i32);
17528 Op = DAG.getNode(X86ISD::BSF, dl, VTs, Op);
17530 // If src is zero (i.e. bsf sets ZF), returns NumBits.
17533 DAG.getConstant(NumBits, VT),
17534 DAG.getConstant(X86::COND_E, MVT::i8),
17537 return DAG.getNode(X86ISD::CMOV, dl, VT, Ops);
17540 // Lower256IntArith - Break a 256-bit integer operation into two new 128-bit
17541 // ones, and then concatenate the result back.
17542 static SDValue Lower256IntArith(SDValue Op, SelectionDAG &DAG) {
17543 MVT VT = Op.getSimpleValueType();
17545 assert(VT.is256BitVector() && VT.isInteger() &&
17546 "Unsupported value type for operation");
17548 unsigned NumElems = VT.getVectorNumElements();
17551 // Extract the LHS vectors
17552 SDValue LHS = Op.getOperand(0);
17553 SDValue LHS1 = Extract128BitVector(LHS, 0, DAG, dl);
17554 SDValue LHS2 = Extract128BitVector(LHS, NumElems/2, DAG, dl);
17556 // Extract the RHS vectors
17557 SDValue RHS = Op.getOperand(1);
17558 SDValue RHS1 = Extract128BitVector(RHS, 0, DAG, dl);
17559 SDValue RHS2 = Extract128BitVector(RHS, NumElems/2, DAG, dl);
17561 MVT EltVT = VT.getVectorElementType();
17562 MVT NewVT = MVT::getVectorVT(EltVT, NumElems/2);
17564 return DAG.getNode(ISD::CONCAT_VECTORS, dl, VT,
17565 DAG.getNode(Op.getOpcode(), dl, NewVT, LHS1, RHS1),
17566 DAG.getNode(Op.getOpcode(), dl, NewVT, LHS2, RHS2));
17569 static SDValue LowerADD(SDValue Op, SelectionDAG &DAG) {
17570 assert(Op.getSimpleValueType().is256BitVector() &&
17571 Op.getSimpleValueType().isInteger() &&
17572 "Only handle AVX 256-bit vector integer operation");
17573 return Lower256IntArith(Op, DAG);
17576 static SDValue LowerSUB(SDValue Op, SelectionDAG &DAG) {
17577 assert(Op.getSimpleValueType().is256BitVector() &&
17578 Op.getSimpleValueType().isInteger() &&
17579 "Only handle AVX 256-bit vector integer operation");
17580 return Lower256IntArith(Op, DAG);
17583 static SDValue LowerMUL(SDValue Op, const X86Subtarget *Subtarget,
17584 SelectionDAG &DAG) {
17586 MVT VT = Op.getSimpleValueType();
17588 // Decompose 256-bit ops into smaller 128-bit ops.
17589 if (VT.is256BitVector() && !Subtarget->hasInt256())
17590 return Lower256IntArith(Op, DAG);
17592 SDValue A = Op.getOperand(0);
17593 SDValue B = Op.getOperand(1);
17595 // Lower v4i32 mul as 2x shuffle, 2x pmuludq, 2x shuffle.
17596 if (VT == MVT::v4i32) {
17597 assert(Subtarget->hasSSE2() && !Subtarget->hasSSE41() &&
17598 "Should not custom lower when pmuldq is available!");
17600 // Extract the odd parts.
17601 static const int UnpackMask[] = { 1, -1, 3, -1 };
17602 SDValue Aodds = DAG.getVectorShuffle(VT, dl, A, A, UnpackMask);
17603 SDValue Bodds = DAG.getVectorShuffle(VT, dl, B, B, UnpackMask);
17605 // Multiply the even parts.
17606 SDValue Evens = DAG.getNode(X86ISD::PMULUDQ, dl, MVT::v2i64, A, B);
17607 // Now multiply odd parts.
17608 SDValue Odds = DAG.getNode(X86ISD::PMULUDQ, dl, MVT::v2i64, Aodds, Bodds);
17610 Evens = DAG.getNode(ISD::BITCAST, dl, VT, Evens);
17611 Odds = DAG.getNode(ISD::BITCAST, dl, VT, Odds);
17613 // Merge the two vectors back together with a shuffle. This expands into 2
17615 static const int ShufMask[] = { 0, 4, 2, 6 };
17616 return DAG.getVectorShuffle(VT, dl, Evens, Odds, ShufMask);
17619 assert((VT == MVT::v2i64 || VT == MVT::v4i64 || VT == MVT::v8i64) &&
17620 "Only know how to lower V2I64/V4I64/V8I64 multiply");
17622 // Ahi = psrlqi(a, 32);
17623 // Bhi = psrlqi(b, 32);
17625 // AloBlo = pmuludq(a, b);
17626 // AloBhi = pmuludq(a, Bhi);
17627 // AhiBlo = pmuludq(Ahi, b);
17629 // AloBhi = psllqi(AloBhi, 32);
17630 // AhiBlo = psllqi(AhiBlo, 32);
17631 // return AloBlo + AloBhi + AhiBlo;
17633 SDValue Ahi = getTargetVShiftByConstNode(X86ISD::VSRLI, dl, VT, A, 32, DAG);
17634 SDValue Bhi = getTargetVShiftByConstNode(X86ISD::VSRLI, dl, VT, B, 32, DAG);
17636 // Bit cast to 32-bit vectors for MULUDQ
17637 EVT MulVT = (VT == MVT::v2i64) ? MVT::v4i32 :
17638 (VT == MVT::v4i64) ? MVT::v8i32 : MVT::v16i32;
17639 A = DAG.getNode(ISD::BITCAST, dl, MulVT, A);
17640 B = DAG.getNode(ISD::BITCAST, dl, MulVT, B);
17641 Ahi = DAG.getNode(ISD::BITCAST, dl, MulVT, Ahi);
17642 Bhi = DAG.getNode(ISD::BITCAST, dl, MulVT, Bhi);
17644 SDValue AloBlo = DAG.getNode(X86ISD::PMULUDQ, dl, VT, A, B);
17645 SDValue AloBhi = DAG.getNode(X86ISD::PMULUDQ, dl, VT, A, Bhi);
17646 SDValue AhiBlo = DAG.getNode(X86ISD::PMULUDQ, dl, VT, Ahi, B);
17648 AloBhi = getTargetVShiftByConstNode(X86ISD::VSHLI, dl, VT, AloBhi, 32, DAG);
17649 AhiBlo = getTargetVShiftByConstNode(X86ISD::VSHLI, dl, VT, AhiBlo, 32, DAG);
17651 SDValue Res = DAG.getNode(ISD::ADD, dl, VT, AloBlo, AloBhi);
17652 return DAG.getNode(ISD::ADD, dl, VT, Res, AhiBlo);
17655 SDValue X86TargetLowering::LowerWin64_i128OP(SDValue Op, SelectionDAG &DAG) const {
17656 assert(Subtarget->isTargetWin64() && "Unexpected target");
17657 EVT VT = Op.getValueType();
17658 assert(VT.isInteger() && VT.getSizeInBits() == 128 &&
17659 "Unexpected return type for lowering");
17663 switch (Op->getOpcode()) {
17664 default: llvm_unreachable("Unexpected request for libcall!");
17665 case ISD::SDIV: isSigned = true; LC = RTLIB::SDIV_I128; break;
17666 case ISD::UDIV: isSigned = false; LC = RTLIB::UDIV_I128; break;
17667 case ISD::SREM: isSigned = true; LC = RTLIB::SREM_I128; break;
17668 case ISD::UREM: isSigned = false; LC = RTLIB::UREM_I128; break;
17669 case ISD::SDIVREM: isSigned = true; LC = RTLIB::SDIVREM_I128; break;
17670 case ISD::UDIVREM: isSigned = false; LC = RTLIB::UDIVREM_I128; break;
17674 SDValue InChain = DAG.getEntryNode();
17676 TargetLowering::ArgListTy Args;
17677 TargetLowering::ArgListEntry Entry;
17678 for (unsigned i = 0, e = Op->getNumOperands(); i != e; ++i) {
17679 EVT ArgVT = Op->getOperand(i).getValueType();
17680 assert(ArgVT.isInteger() && ArgVT.getSizeInBits() == 128 &&
17681 "Unexpected argument type for lowering");
17682 SDValue StackPtr = DAG.CreateStackTemporary(ArgVT, 16);
17683 Entry.Node = StackPtr;
17684 InChain = DAG.getStore(InChain, dl, Op->getOperand(i), StackPtr, MachinePointerInfo(),
17686 Type *ArgTy = ArgVT.getTypeForEVT(*DAG.getContext());
17687 Entry.Ty = PointerType::get(ArgTy,0);
17688 Entry.isSExt = false;
17689 Entry.isZExt = false;
17690 Args.push_back(Entry);
17693 SDValue Callee = DAG.getExternalSymbol(getLibcallName(LC),
17696 TargetLowering::CallLoweringInfo CLI(DAG);
17697 CLI.setDebugLoc(dl).setChain(InChain)
17698 .setCallee(getLibcallCallingConv(LC),
17699 static_cast<EVT>(MVT::v2i64).getTypeForEVT(*DAG.getContext()),
17700 Callee, std::move(Args), 0)
17701 .setInRegister().setSExtResult(isSigned).setZExtResult(!isSigned);
17703 std::pair<SDValue, SDValue> CallInfo = LowerCallTo(CLI);
17704 return DAG.getNode(ISD::BITCAST, dl, VT, CallInfo.first);
17707 static SDValue LowerMUL_LOHI(SDValue Op, const X86Subtarget *Subtarget,
17708 SelectionDAG &DAG) {
17709 SDValue Op0 = Op.getOperand(0), Op1 = Op.getOperand(1);
17710 EVT VT = Op0.getValueType();
17713 assert((VT == MVT::v4i32 && Subtarget->hasSSE2()) ||
17714 (VT == MVT::v8i32 && Subtarget->hasInt256()));
17716 // PMULxD operations multiply each even value (starting at 0) of LHS with
17717 // the related value of RHS and produce a widen result.
17718 // E.g., PMULUDQ <4 x i32> <a|b|c|d>, <4 x i32> <e|f|g|h>
17719 // => <2 x i64> <ae|cg>
17721 // In other word, to have all the results, we need to perform two PMULxD:
17722 // 1. one with the even values.
17723 // 2. one with the odd values.
17724 // To achieve #2, with need to place the odd values at an even position.
17726 // Place the odd value at an even position (basically, shift all values 1
17727 // step to the left):
17728 const int Mask[] = {1, -1, 3, -1, 5, -1, 7, -1};
17729 // <a|b|c|d> => <b|undef|d|undef>
17730 SDValue Odd0 = DAG.getVectorShuffle(VT, dl, Op0, Op0, Mask);
17731 // <e|f|g|h> => <f|undef|h|undef>
17732 SDValue Odd1 = DAG.getVectorShuffle(VT, dl, Op1, Op1, Mask);
17734 // Emit two multiplies, one for the lower 2 ints and one for the higher 2
17736 MVT MulVT = VT == MVT::v4i32 ? MVT::v2i64 : MVT::v4i64;
17737 bool IsSigned = Op->getOpcode() == ISD::SMUL_LOHI;
17739 (!IsSigned || !Subtarget->hasSSE41()) ? X86ISD::PMULUDQ : X86ISD::PMULDQ;
17740 // PMULUDQ <4 x i32> <a|b|c|d>, <4 x i32> <e|f|g|h>
17741 // => <2 x i64> <ae|cg>
17742 SDValue Mul1 = DAG.getNode(ISD::BITCAST, dl, VT,
17743 DAG.getNode(Opcode, dl, MulVT, Op0, Op1));
17744 // PMULUDQ <4 x i32> <b|undef|d|undef>, <4 x i32> <f|undef|h|undef>
17745 // => <2 x i64> <bf|dh>
17746 SDValue Mul2 = DAG.getNode(ISD::BITCAST, dl, VT,
17747 DAG.getNode(Opcode, dl, MulVT, Odd0, Odd1));
17749 // Shuffle it back into the right order.
17750 SDValue Highs, Lows;
17751 if (VT == MVT::v8i32) {
17752 const int HighMask[] = {1, 9, 3, 11, 5, 13, 7, 15};
17753 Highs = DAG.getVectorShuffle(VT, dl, Mul1, Mul2, HighMask);
17754 const int LowMask[] = {0, 8, 2, 10, 4, 12, 6, 14};
17755 Lows = DAG.getVectorShuffle(VT, dl, Mul1, Mul2, LowMask);
17757 const int HighMask[] = {1, 5, 3, 7};
17758 Highs = DAG.getVectorShuffle(VT, dl, Mul1, Mul2, HighMask);
17759 const int LowMask[] = {0, 4, 2, 6};
17760 Lows = DAG.getVectorShuffle(VT, dl, Mul1, Mul2, LowMask);
17763 // If we have a signed multiply but no PMULDQ fix up the high parts of a
17764 // unsigned multiply.
17765 if (IsSigned && !Subtarget->hasSSE41()) {
17767 DAG.getConstant(31, DAG.getTargetLoweringInfo().getShiftAmountTy(VT));
17768 SDValue T1 = DAG.getNode(ISD::AND, dl, VT,
17769 DAG.getNode(ISD::SRA, dl, VT, Op0, ShAmt), Op1);
17770 SDValue T2 = DAG.getNode(ISD::AND, dl, VT,
17771 DAG.getNode(ISD::SRA, dl, VT, Op1, ShAmt), Op0);
17773 SDValue Fixup = DAG.getNode(ISD::ADD, dl, VT, T1, T2);
17774 Highs = DAG.getNode(ISD::SUB, dl, VT, Highs, Fixup);
17777 // The first result of MUL_LOHI is actually the low value, followed by the
17779 SDValue Ops[] = {Lows, Highs};
17780 return DAG.getMergeValues(Ops, dl);
17783 static SDValue LowerScalarImmediateShift(SDValue Op, SelectionDAG &DAG,
17784 const X86Subtarget *Subtarget) {
17785 MVT VT = Op.getSimpleValueType();
17787 SDValue R = Op.getOperand(0);
17788 SDValue Amt = Op.getOperand(1);
17790 // Optimize shl/srl/sra with constant shift amount.
17791 if (auto *BVAmt = dyn_cast<BuildVectorSDNode>(Amt)) {
17792 if (auto *ShiftConst = BVAmt->getConstantSplatNode()) {
17793 uint64_t ShiftAmt = ShiftConst->getZExtValue();
17795 if (VT == MVT::v2i64 || VT == MVT::v4i32 || VT == MVT::v8i16 ||
17796 (Subtarget->hasInt256() &&
17797 (VT == MVT::v4i64 || VT == MVT::v8i32 || VT == MVT::v16i16)) ||
17798 (Subtarget->hasAVX512() &&
17799 (VT == MVT::v8i64 || VT == MVT::v16i32))) {
17800 if (Op.getOpcode() == ISD::SHL)
17801 return getTargetVShiftByConstNode(X86ISD::VSHLI, dl, VT, R, ShiftAmt,
17803 if (Op.getOpcode() == ISD::SRL)
17804 return getTargetVShiftByConstNode(X86ISD::VSRLI, dl, VT, R, ShiftAmt,
17806 if (Op.getOpcode() == ISD::SRA && VT != MVT::v2i64 && VT != MVT::v4i64)
17807 return getTargetVShiftByConstNode(X86ISD::VSRAI, dl, VT, R, ShiftAmt,
17811 if (VT == MVT::v16i8) {
17812 if (Op.getOpcode() == ISD::SHL) {
17813 // Make a large shift.
17814 SDValue SHL = getTargetVShiftByConstNode(X86ISD::VSHLI, dl,
17815 MVT::v8i16, R, ShiftAmt,
17817 SHL = DAG.getNode(ISD::BITCAST, dl, VT, SHL);
17818 // Zero out the rightmost bits.
17819 SmallVector<SDValue, 16> V(16,
17820 DAG.getConstant(uint8_t(-1U << ShiftAmt),
17822 return DAG.getNode(ISD::AND, dl, VT, SHL,
17823 DAG.getNode(ISD::BUILD_VECTOR, dl, VT, V));
17825 if (Op.getOpcode() == ISD::SRL) {
17826 // Make a large shift.
17827 SDValue SRL = getTargetVShiftByConstNode(X86ISD::VSRLI, dl,
17828 MVT::v8i16, R, ShiftAmt,
17830 SRL = DAG.getNode(ISD::BITCAST, dl, VT, SRL);
17831 // Zero out the leftmost bits.
17832 SmallVector<SDValue, 16> V(16,
17833 DAG.getConstant(uint8_t(-1U) >> ShiftAmt,
17835 return DAG.getNode(ISD::AND, dl, VT, SRL,
17836 DAG.getNode(ISD::BUILD_VECTOR, dl, VT, V));
17838 if (Op.getOpcode() == ISD::SRA) {
17839 if (ShiftAmt == 7) {
17840 // R s>> 7 === R s< 0
17841 SDValue Zeros = getZeroVector(VT, Subtarget, DAG, dl);
17842 return DAG.getNode(X86ISD::PCMPGT, dl, VT, Zeros, R);
17845 // R s>> a === ((R u>> a) ^ m) - m
17846 SDValue Res = DAG.getNode(ISD::SRL, dl, VT, R, Amt);
17847 SmallVector<SDValue, 16> V(16, DAG.getConstant(128 >> ShiftAmt,
17849 SDValue Mask = DAG.getNode(ISD::BUILD_VECTOR, dl, VT, V);
17850 Res = DAG.getNode(ISD::XOR, dl, VT, Res, Mask);
17851 Res = DAG.getNode(ISD::SUB, dl, VT, Res, Mask);
17854 llvm_unreachable("Unknown shift opcode.");
17857 if (Subtarget->hasInt256() && VT == MVT::v32i8) {
17858 if (Op.getOpcode() == ISD::SHL) {
17859 // Make a large shift.
17860 SDValue SHL = getTargetVShiftByConstNode(X86ISD::VSHLI, dl,
17861 MVT::v16i16, R, ShiftAmt,
17863 SHL = DAG.getNode(ISD::BITCAST, dl, VT, SHL);
17864 // Zero out the rightmost bits.
17865 SmallVector<SDValue, 32> V(32,
17866 DAG.getConstant(uint8_t(-1U << ShiftAmt),
17868 return DAG.getNode(ISD::AND, dl, VT, SHL,
17869 DAG.getNode(ISD::BUILD_VECTOR, dl, VT, V));
17871 if (Op.getOpcode() == ISD::SRL) {
17872 // Make a large shift.
17873 SDValue SRL = getTargetVShiftByConstNode(X86ISD::VSRLI, dl,
17874 MVT::v16i16, R, ShiftAmt,
17876 SRL = DAG.getNode(ISD::BITCAST, dl, VT, SRL);
17877 // Zero out the leftmost bits.
17878 SmallVector<SDValue, 32> V(32,
17879 DAG.getConstant(uint8_t(-1U) >> ShiftAmt,
17881 return DAG.getNode(ISD::AND, dl, VT, SRL,
17882 DAG.getNode(ISD::BUILD_VECTOR, dl, VT, V));
17884 if (Op.getOpcode() == ISD::SRA) {
17885 if (ShiftAmt == 7) {
17886 // R s>> 7 === R s< 0
17887 SDValue Zeros = getZeroVector(VT, Subtarget, DAG, dl);
17888 return DAG.getNode(X86ISD::PCMPGT, dl, VT, Zeros, R);
17891 // R s>> a === ((R u>> a) ^ m) - m
17892 SDValue Res = DAG.getNode(ISD::SRL, dl, VT, R, Amt);
17893 SmallVector<SDValue, 32> V(32, DAG.getConstant(128 >> ShiftAmt,
17895 SDValue Mask = DAG.getNode(ISD::BUILD_VECTOR, dl, VT, V);
17896 Res = DAG.getNode(ISD::XOR, dl, VT, Res, Mask);
17897 Res = DAG.getNode(ISD::SUB, dl, VT, Res, Mask);
17900 llvm_unreachable("Unknown shift opcode.");
17905 // Special case in 32-bit mode, where i64 is expanded into high and low parts.
17906 if (!Subtarget->is64Bit() &&
17907 (VT == MVT::v2i64 || (Subtarget->hasInt256() && VT == MVT::v4i64)) &&
17908 Amt.getOpcode() == ISD::BITCAST &&
17909 Amt.getOperand(0).getOpcode() == ISD::BUILD_VECTOR) {
17910 Amt = Amt.getOperand(0);
17911 unsigned Ratio = Amt.getSimpleValueType().getVectorNumElements() /
17912 VT.getVectorNumElements();
17913 unsigned RatioInLog2 = Log2_32_Ceil(Ratio);
17914 uint64_t ShiftAmt = 0;
17915 for (unsigned i = 0; i != Ratio; ++i) {
17916 ConstantSDNode *C = dyn_cast<ConstantSDNode>(Amt.getOperand(i));
17920 ShiftAmt |= C->getZExtValue() << (i * (1 << (6 - RatioInLog2)));
17922 // Check remaining shift amounts.
17923 for (unsigned i = Ratio; i != Amt.getNumOperands(); i += Ratio) {
17924 uint64_t ShAmt = 0;
17925 for (unsigned j = 0; j != Ratio; ++j) {
17926 ConstantSDNode *C =
17927 dyn_cast<ConstantSDNode>(Amt.getOperand(i + j));
17931 ShAmt |= C->getZExtValue() << (j * (1 << (6 - RatioInLog2)));
17933 if (ShAmt != ShiftAmt)
17936 switch (Op.getOpcode()) {
17938 llvm_unreachable("Unknown shift opcode!");
17940 return getTargetVShiftByConstNode(X86ISD::VSHLI, dl, VT, R, ShiftAmt,
17943 return getTargetVShiftByConstNode(X86ISD::VSRLI, dl, VT, R, ShiftAmt,
17946 return getTargetVShiftByConstNode(X86ISD::VSRAI, dl, VT, R, ShiftAmt,
17954 static SDValue LowerScalarVariableShift(SDValue Op, SelectionDAG &DAG,
17955 const X86Subtarget* Subtarget) {
17956 MVT VT = Op.getSimpleValueType();
17958 SDValue R = Op.getOperand(0);
17959 SDValue Amt = Op.getOperand(1);
17961 if ((VT == MVT::v2i64 && Op.getOpcode() != ISD::SRA) ||
17962 VT == MVT::v4i32 || VT == MVT::v8i16 ||
17963 (Subtarget->hasInt256() &&
17964 ((VT == MVT::v4i64 && Op.getOpcode() != ISD::SRA) ||
17965 VT == MVT::v8i32 || VT == MVT::v16i16)) ||
17966 (Subtarget->hasAVX512() && (VT == MVT::v8i64 || VT == MVT::v16i32))) {
17968 EVT EltVT = VT.getVectorElementType();
17970 if (Amt.getOpcode() == ISD::BUILD_VECTOR) {
17971 unsigned NumElts = VT.getVectorNumElements();
17973 for (i = 0; i != NumElts; ++i) {
17974 if (Amt.getOperand(i).getOpcode() == ISD::UNDEF)
17978 for (j = i; j != NumElts; ++j) {
17979 SDValue Arg = Amt.getOperand(j);
17980 if (Arg.getOpcode() == ISD::UNDEF) continue;
17981 if (Arg != Amt.getOperand(i))
17984 if (i != NumElts && j == NumElts)
17985 BaseShAmt = Amt.getOperand(i);
17987 if (Amt.getOpcode() == ISD::EXTRACT_SUBVECTOR)
17988 Amt = Amt.getOperand(0);
17989 if (Amt.getOpcode() == ISD::VECTOR_SHUFFLE &&
17990 cast<ShuffleVectorSDNode>(Amt)->isSplat()) {
17991 SDValue InVec = Amt.getOperand(0);
17992 if (InVec.getOpcode() == ISD::BUILD_VECTOR) {
17993 unsigned NumElts = InVec.getValueType().getVectorNumElements();
17995 for (; i != NumElts; ++i) {
17996 SDValue Arg = InVec.getOperand(i);
17997 if (Arg.getOpcode() == ISD::UNDEF) continue;
18001 } else if (InVec.getOpcode() == ISD::INSERT_VECTOR_ELT) {
18002 if (ConstantSDNode *C =
18003 dyn_cast<ConstantSDNode>(InVec.getOperand(2))) {
18004 unsigned SplatIdx =
18005 cast<ShuffleVectorSDNode>(Amt)->getSplatIndex();
18006 if (C->getZExtValue() == SplatIdx)
18007 BaseShAmt = InVec.getOperand(1);
18010 if (!BaseShAmt.getNode())
18011 BaseShAmt = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, EltVT, Amt,
18012 DAG.getIntPtrConstant(0));
18016 if (BaseShAmt.getNode()) {
18017 if (EltVT.bitsGT(MVT::i32))
18018 BaseShAmt = DAG.getNode(ISD::TRUNCATE, dl, MVT::i32, BaseShAmt);
18019 else if (EltVT.bitsLT(MVT::i32))
18020 BaseShAmt = DAG.getNode(ISD::ZERO_EXTEND, dl, MVT::i32, BaseShAmt);
18022 switch (Op.getOpcode()) {
18024 llvm_unreachable("Unknown shift opcode!");
18026 switch (VT.SimpleTy) {
18027 default: return SDValue();
18036 return getTargetVShiftNode(X86ISD::VSHLI, dl, VT, R, BaseShAmt, DAG);
18039 switch (VT.SimpleTy) {
18040 default: return SDValue();
18047 return getTargetVShiftNode(X86ISD::VSRAI, dl, VT, R, BaseShAmt, DAG);
18050 switch (VT.SimpleTy) {
18051 default: return SDValue();
18060 return getTargetVShiftNode(X86ISD::VSRLI, dl, VT, R, BaseShAmt, DAG);
18066 // Special case in 32-bit mode, where i64 is expanded into high and low parts.
18067 if (!Subtarget->is64Bit() &&
18068 (VT == MVT::v2i64 || (Subtarget->hasInt256() && VT == MVT::v4i64) ||
18069 (Subtarget->hasAVX512() && VT == MVT::v8i64)) &&
18070 Amt.getOpcode() == ISD::BITCAST &&
18071 Amt.getOperand(0).getOpcode() == ISD::BUILD_VECTOR) {
18072 Amt = Amt.getOperand(0);
18073 unsigned Ratio = Amt.getSimpleValueType().getVectorNumElements() /
18074 VT.getVectorNumElements();
18075 std::vector<SDValue> Vals(Ratio);
18076 for (unsigned i = 0; i != Ratio; ++i)
18077 Vals[i] = Amt.getOperand(i);
18078 for (unsigned i = Ratio; i != Amt.getNumOperands(); i += Ratio) {
18079 for (unsigned j = 0; j != Ratio; ++j)
18080 if (Vals[j] != Amt.getOperand(i + j))
18083 switch (Op.getOpcode()) {
18085 llvm_unreachable("Unknown shift opcode!");
18087 return DAG.getNode(X86ISD::VSHL, dl, VT, R, Op.getOperand(1));
18089 return DAG.getNode(X86ISD::VSRL, dl, VT, R, Op.getOperand(1));
18091 return DAG.getNode(X86ISD::VSRA, dl, VT, R, Op.getOperand(1));
18098 static SDValue LowerShift(SDValue Op, const X86Subtarget* Subtarget,
18099 SelectionDAG &DAG) {
18100 MVT VT = Op.getSimpleValueType();
18102 SDValue R = Op.getOperand(0);
18103 SDValue Amt = Op.getOperand(1);
18106 assert(VT.isVector() && "Custom lowering only for vector shifts!");
18107 assert(Subtarget->hasSSE2() && "Only custom lower when we have SSE2!");
18109 V = LowerScalarImmediateShift(Op, DAG, Subtarget);
18113 V = LowerScalarVariableShift(Op, DAG, Subtarget);
18117 if (Subtarget->hasAVX512() && (VT == MVT::v16i32 || VT == MVT::v8i64))
18119 // AVX2 has VPSLLV/VPSRAV/VPSRLV.
18120 if (Subtarget->hasInt256()) {
18121 if (Op.getOpcode() == ISD::SRL &&
18122 (VT == MVT::v2i64 || VT == MVT::v4i32 ||
18123 VT == MVT::v4i64 || VT == MVT::v8i32))
18125 if (Op.getOpcode() == ISD::SHL &&
18126 (VT == MVT::v2i64 || VT == MVT::v4i32 ||
18127 VT == MVT::v4i64 || VT == MVT::v8i32))
18129 if (Op.getOpcode() == ISD::SRA && (VT == MVT::v4i32 || VT == MVT::v8i32))
18133 // If possible, lower this packed shift into a vector multiply instead of
18134 // expanding it into a sequence of scalar shifts.
18135 // Do this only if the vector shift count is a constant build_vector.
18136 if (Op.getOpcode() == ISD::SHL &&
18137 (VT == MVT::v8i16 || VT == MVT::v4i32 ||
18138 (Subtarget->hasInt256() && VT == MVT::v16i16)) &&
18139 ISD::isBuildVectorOfConstantSDNodes(Amt.getNode())) {
18140 SmallVector<SDValue, 8> Elts;
18141 EVT SVT = VT.getScalarType();
18142 unsigned SVTBits = SVT.getSizeInBits();
18143 const APInt &One = APInt(SVTBits, 1);
18144 unsigned NumElems = VT.getVectorNumElements();
18146 for (unsigned i=0; i !=NumElems; ++i) {
18147 SDValue Op = Amt->getOperand(i);
18148 if (Op->getOpcode() == ISD::UNDEF) {
18149 Elts.push_back(Op);
18153 ConstantSDNode *ND = cast<ConstantSDNode>(Op);
18154 const APInt &C = APInt(SVTBits, ND->getAPIntValue().getZExtValue());
18155 uint64_t ShAmt = C.getZExtValue();
18156 if (ShAmt >= SVTBits) {
18157 Elts.push_back(DAG.getUNDEF(SVT));
18160 Elts.push_back(DAG.getConstant(One.shl(ShAmt), SVT));
18162 SDValue BV = DAG.getNode(ISD::BUILD_VECTOR, dl, VT, Elts);
18163 return DAG.getNode(ISD::MUL, dl, VT, R, BV);
18166 // Lower SHL with variable shift amount.
18167 if (VT == MVT::v4i32 && Op->getOpcode() == ISD::SHL) {
18168 Op = DAG.getNode(ISD::SHL, dl, VT, Amt, DAG.getConstant(23, VT));
18170 Op = DAG.getNode(ISD::ADD, dl, VT, Op, DAG.getConstant(0x3f800000U, VT));
18171 Op = DAG.getNode(ISD::BITCAST, dl, MVT::v4f32, Op);
18172 Op = DAG.getNode(ISD::FP_TO_SINT, dl, VT, Op);
18173 return DAG.getNode(ISD::MUL, dl, VT, Op, R);
18176 // If possible, lower this shift as a sequence of two shifts by
18177 // constant plus a MOVSS/MOVSD instead of scalarizing it.
18179 // (v4i32 (srl A, (build_vector < X, Y, Y, Y>)))
18181 // Could be rewritten as:
18182 // (v4i32 (MOVSS (srl A, <Y,Y,Y,Y>), (srl A, <X,X,X,X>)))
18184 // The advantage is that the two shifts from the example would be
18185 // lowered as X86ISD::VSRLI nodes. This would be cheaper than scalarizing
18186 // the vector shift into four scalar shifts plus four pairs of vector
18188 if ((VT == MVT::v8i16 || VT == MVT::v4i32) &&
18189 ISD::isBuildVectorOfConstantSDNodes(Amt.getNode())) {
18190 unsigned TargetOpcode = X86ISD::MOVSS;
18191 bool CanBeSimplified;
18192 // The splat value for the first packed shift (the 'X' from the example).
18193 SDValue Amt1 = Amt->getOperand(0);
18194 // The splat value for the second packed shift (the 'Y' from the example).
18195 SDValue Amt2 = (VT == MVT::v4i32) ? Amt->getOperand(1) :
18196 Amt->getOperand(2);
18198 // See if it is possible to replace this node with a sequence of
18199 // two shifts followed by a MOVSS/MOVSD
18200 if (VT == MVT::v4i32) {
18201 // Check if it is legal to use a MOVSS.
18202 CanBeSimplified = Amt2 == Amt->getOperand(2) &&
18203 Amt2 == Amt->getOperand(3);
18204 if (!CanBeSimplified) {
18205 // Otherwise, check if we can still simplify this node using a MOVSD.
18206 CanBeSimplified = Amt1 == Amt->getOperand(1) &&
18207 Amt->getOperand(2) == Amt->getOperand(3);
18208 TargetOpcode = X86ISD::MOVSD;
18209 Amt2 = Amt->getOperand(2);
18212 // Do similar checks for the case where the machine value type
18214 CanBeSimplified = Amt1 == Amt->getOperand(1);
18215 for (unsigned i=3; i != 8 && CanBeSimplified; ++i)
18216 CanBeSimplified = Amt2 == Amt->getOperand(i);
18218 if (!CanBeSimplified) {
18219 TargetOpcode = X86ISD::MOVSD;
18220 CanBeSimplified = true;
18221 Amt2 = Amt->getOperand(4);
18222 for (unsigned i=0; i != 4 && CanBeSimplified; ++i)
18223 CanBeSimplified = Amt1 == Amt->getOperand(i);
18224 for (unsigned j=4; j != 8 && CanBeSimplified; ++j)
18225 CanBeSimplified = Amt2 == Amt->getOperand(j);
18229 if (CanBeSimplified && isa<ConstantSDNode>(Amt1) &&
18230 isa<ConstantSDNode>(Amt2)) {
18231 // Replace this node with two shifts followed by a MOVSS/MOVSD.
18232 EVT CastVT = MVT::v4i32;
18234 DAG.getConstant(cast<ConstantSDNode>(Amt1)->getAPIntValue(), VT);
18235 SDValue Shift1 = DAG.getNode(Op->getOpcode(), dl, VT, R, Splat1);
18237 DAG.getConstant(cast<ConstantSDNode>(Amt2)->getAPIntValue(), VT);
18238 SDValue Shift2 = DAG.getNode(Op->getOpcode(), dl, VT, R, Splat2);
18239 if (TargetOpcode == X86ISD::MOVSD)
18240 CastVT = MVT::v2i64;
18241 SDValue BitCast1 = DAG.getNode(ISD::BITCAST, dl, CastVT, Shift1);
18242 SDValue BitCast2 = DAG.getNode(ISD::BITCAST, dl, CastVT, Shift2);
18243 SDValue Result = getTargetShuffleNode(TargetOpcode, dl, CastVT, BitCast2,
18245 return DAG.getNode(ISD::BITCAST, dl, VT, Result);
18249 if (VT == MVT::v16i8 && Op->getOpcode() == ISD::SHL) {
18250 assert(Subtarget->hasSSE2() && "Need SSE2 for pslli/pcmpeq.");
18253 Op = DAG.getNode(ISD::SHL, dl, VT, Amt, DAG.getConstant(5, VT));
18254 Op = DAG.getNode(ISD::BITCAST, dl, VT, Op);
18256 // Turn 'a' into a mask suitable for VSELECT
18257 SDValue VSelM = DAG.getConstant(0x80, VT);
18258 SDValue OpVSel = DAG.getNode(ISD::AND, dl, VT, VSelM, Op);
18259 OpVSel = DAG.getNode(X86ISD::PCMPEQ, dl, VT, OpVSel, VSelM);
18261 SDValue CM1 = DAG.getConstant(0x0f, VT);
18262 SDValue CM2 = DAG.getConstant(0x3f, VT);
18264 // r = VSELECT(r, psllw(r & (char16)15, 4), a);
18265 SDValue M = DAG.getNode(ISD::AND, dl, VT, R, CM1);
18266 M = getTargetVShiftByConstNode(X86ISD::VSHLI, dl, MVT::v8i16, M, 4, DAG);
18267 M = DAG.getNode(ISD::BITCAST, dl, VT, M);
18268 R = DAG.getNode(ISD::VSELECT, dl, VT, OpVSel, M, R);
18271 Op = DAG.getNode(ISD::ADD, dl, VT, Op, Op);
18272 OpVSel = DAG.getNode(ISD::AND, dl, VT, VSelM, Op);
18273 OpVSel = DAG.getNode(X86ISD::PCMPEQ, dl, VT, OpVSel, VSelM);
18275 // r = VSELECT(r, psllw(r & (char16)63, 2), a);
18276 M = DAG.getNode(ISD::AND, dl, VT, R, CM2);
18277 M = getTargetVShiftByConstNode(X86ISD::VSHLI, dl, MVT::v8i16, M, 2, DAG);
18278 M = DAG.getNode(ISD::BITCAST, dl, VT, M);
18279 R = DAG.getNode(ISD::VSELECT, dl, VT, OpVSel, M, R);
18282 Op = DAG.getNode(ISD::ADD, dl, VT, Op, Op);
18283 OpVSel = DAG.getNode(ISD::AND, dl, VT, VSelM, Op);
18284 OpVSel = DAG.getNode(X86ISD::PCMPEQ, dl, VT, OpVSel, VSelM);
18286 // return VSELECT(r, r+r, a);
18287 R = DAG.getNode(ISD::VSELECT, dl, VT, OpVSel,
18288 DAG.getNode(ISD::ADD, dl, VT, R, R), R);
18292 // It's worth extending once and using the v8i32 shifts for 16-bit types, but
18293 // the extra overheads to get from v16i8 to v8i32 make the existing SSE
18294 // solution better.
18295 if (Subtarget->hasInt256() && VT == MVT::v8i16) {
18296 MVT NewVT = VT == MVT::v8i16 ? MVT::v8i32 : MVT::v16i16;
18298 Op.getOpcode() == ISD::SRA ? ISD::SIGN_EXTEND : ISD::ZERO_EXTEND;
18299 R = DAG.getNode(ExtOpc, dl, NewVT, R);
18300 Amt = DAG.getNode(ISD::ANY_EXTEND, dl, NewVT, Amt);
18301 return DAG.getNode(ISD::TRUNCATE, dl, VT,
18302 DAG.getNode(Op.getOpcode(), dl, NewVT, R, Amt));
18305 // Decompose 256-bit shifts into smaller 128-bit shifts.
18306 if (VT.is256BitVector()) {
18307 unsigned NumElems = VT.getVectorNumElements();
18308 MVT EltVT = VT.getVectorElementType();
18309 EVT NewVT = MVT::getVectorVT(EltVT, NumElems/2);
18311 // Extract the two vectors
18312 SDValue V1 = Extract128BitVector(R, 0, DAG, dl);
18313 SDValue V2 = Extract128BitVector(R, NumElems/2, DAG, dl);
18315 // Recreate the shift amount vectors
18316 SDValue Amt1, Amt2;
18317 if (Amt.getOpcode() == ISD::BUILD_VECTOR) {
18318 // Constant shift amount
18319 SmallVector<SDValue, 4> Amt1Csts;
18320 SmallVector<SDValue, 4> Amt2Csts;
18321 for (unsigned i = 0; i != NumElems/2; ++i)
18322 Amt1Csts.push_back(Amt->getOperand(i));
18323 for (unsigned i = NumElems/2; i != NumElems; ++i)
18324 Amt2Csts.push_back(Amt->getOperand(i));
18326 Amt1 = DAG.getNode(ISD::BUILD_VECTOR, dl, NewVT, Amt1Csts);
18327 Amt2 = DAG.getNode(ISD::BUILD_VECTOR, dl, NewVT, Amt2Csts);
18329 // Variable shift amount
18330 Amt1 = Extract128BitVector(Amt, 0, DAG, dl);
18331 Amt2 = Extract128BitVector(Amt, NumElems/2, DAG, dl);
18334 // Issue new vector shifts for the smaller types
18335 V1 = DAG.getNode(Op.getOpcode(), dl, NewVT, V1, Amt1);
18336 V2 = DAG.getNode(Op.getOpcode(), dl, NewVT, V2, Amt2);
18338 // Concatenate the result back
18339 return DAG.getNode(ISD::CONCAT_VECTORS, dl, VT, V1, V2);
18345 static SDValue LowerXALUO(SDValue Op, SelectionDAG &DAG) {
18346 // Lower the "add/sub/mul with overflow" instruction into a regular ins plus
18347 // a "setcc" instruction that checks the overflow flag. The "brcond" lowering
18348 // looks for this combo and may remove the "setcc" instruction if the "setcc"
18349 // has only one use.
18350 SDNode *N = Op.getNode();
18351 SDValue LHS = N->getOperand(0);
18352 SDValue RHS = N->getOperand(1);
18353 unsigned BaseOp = 0;
18356 switch (Op.getOpcode()) {
18357 default: llvm_unreachable("Unknown ovf instruction!");
18359 // A subtract of one will be selected as a INC. Note that INC doesn't
18360 // set CF, so we can't do this for UADDO.
18361 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(RHS))
18363 BaseOp = X86ISD::INC;
18364 Cond = X86::COND_O;
18367 BaseOp = X86ISD::ADD;
18368 Cond = X86::COND_O;
18371 BaseOp = X86ISD::ADD;
18372 Cond = X86::COND_B;
18375 // A subtract of one will be selected as a DEC. Note that DEC doesn't
18376 // set CF, so we can't do this for USUBO.
18377 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(RHS))
18379 BaseOp = X86ISD::DEC;
18380 Cond = X86::COND_O;
18383 BaseOp = X86ISD::SUB;
18384 Cond = X86::COND_O;
18387 BaseOp = X86ISD::SUB;
18388 Cond = X86::COND_B;
18391 BaseOp = N->getValueType(0) == MVT::i8 ? X86ISD::SMUL8 : X86ISD::SMUL;
18392 Cond = X86::COND_O;
18394 case ISD::UMULO: { // i64, i8 = umulo lhs, rhs --> i64, i64, i32 umul lhs,rhs
18395 if (N->getValueType(0) == MVT::i8) {
18396 BaseOp = X86ISD::UMUL8;
18397 Cond = X86::COND_O;
18400 SDVTList VTs = DAG.getVTList(N->getValueType(0), N->getValueType(0),
18402 SDValue Sum = DAG.getNode(X86ISD::UMUL, DL, VTs, LHS, RHS);
18405 DAG.getNode(X86ISD::SETCC, DL, MVT::i8,
18406 DAG.getConstant(X86::COND_O, MVT::i32),
18407 SDValue(Sum.getNode(), 2));
18409 return DAG.getNode(ISD::MERGE_VALUES, DL, N->getVTList(), Sum, SetCC);
18413 // Also sets EFLAGS.
18414 SDVTList VTs = DAG.getVTList(N->getValueType(0), MVT::i32);
18415 SDValue Sum = DAG.getNode(BaseOp, DL, VTs, LHS, RHS);
18418 DAG.getNode(X86ISD::SETCC, DL, N->getValueType(1),
18419 DAG.getConstant(Cond, MVT::i32),
18420 SDValue(Sum.getNode(), 1));
18422 return DAG.getNode(ISD::MERGE_VALUES, DL, N->getVTList(), Sum, SetCC);
18425 // Sign extension of the low part of vector elements. This may be used either
18426 // when sign extend instructions are not available or if the vector element
18427 // sizes already match the sign-extended size. If the vector elements are in
18428 // their pre-extended size and sign extend instructions are available, that will
18429 // be handled by LowerSIGN_EXTEND.
18430 SDValue X86TargetLowering::LowerSIGN_EXTEND_INREG(SDValue Op,
18431 SelectionDAG &DAG) const {
18433 EVT ExtraVT = cast<VTSDNode>(Op.getOperand(1))->getVT();
18434 MVT VT = Op.getSimpleValueType();
18436 if (!Subtarget->hasSSE2() || !VT.isVector())
18439 unsigned BitsDiff = VT.getScalarType().getSizeInBits() -
18440 ExtraVT.getScalarType().getSizeInBits();
18442 switch (VT.SimpleTy) {
18443 default: return SDValue();
18446 if (!Subtarget->hasFp256())
18448 if (!Subtarget->hasInt256()) {
18449 // needs to be split
18450 unsigned NumElems = VT.getVectorNumElements();
18452 // Extract the LHS vectors
18453 SDValue LHS = Op.getOperand(0);
18454 SDValue LHS1 = Extract128BitVector(LHS, 0, DAG, dl);
18455 SDValue LHS2 = Extract128BitVector(LHS, NumElems/2, DAG, dl);
18457 MVT EltVT = VT.getVectorElementType();
18458 EVT NewVT = MVT::getVectorVT(EltVT, NumElems/2);
18460 EVT ExtraEltVT = ExtraVT.getVectorElementType();
18461 unsigned ExtraNumElems = ExtraVT.getVectorNumElements();
18462 ExtraVT = EVT::getVectorVT(*DAG.getContext(), ExtraEltVT,
18464 SDValue Extra = DAG.getValueType(ExtraVT);
18466 LHS1 = DAG.getNode(Op.getOpcode(), dl, NewVT, LHS1, Extra);
18467 LHS2 = DAG.getNode(Op.getOpcode(), dl, NewVT, LHS2, Extra);
18469 return DAG.getNode(ISD::CONCAT_VECTORS, dl, VT, LHS1, LHS2);
18474 SDValue Op0 = Op.getOperand(0);
18476 // This is a sign extension of some low part of vector elements without
18477 // changing the size of the vector elements themselves:
18478 // Shift-Left + Shift-Right-Algebraic.
18479 SDValue Shl = getTargetVShiftByConstNode(X86ISD::VSHLI, dl, VT, Op0,
18481 return getTargetVShiftByConstNode(X86ISD::VSRAI, dl, VT, Shl, BitsDiff,
18487 /// Returns true if the operand type is exactly twice the native width, and
18488 /// the corresponding cmpxchg8b or cmpxchg16b instruction is available.
18489 /// Used to know whether to use cmpxchg8/16b when expanding atomic operations
18490 /// (otherwise we leave them alone to become __sync_fetch_and_... calls).
18491 bool X86TargetLowering::needsCmpXchgNb(const Type *MemType) const {
18492 const X86Subtarget &Subtarget =
18493 getTargetMachine().getSubtarget<X86Subtarget>();
18494 unsigned OpWidth = MemType->getPrimitiveSizeInBits();
18497 return !Subtarget.is64Bit(); // FIXME this should be Subtarget.hasCmpxchg8b
18498 else if (OpWidth == 128)
18499 return Subtarget.hasCmpxchg16b();
18504 bool X86TargetLowering::shouldExpandAtomicStoreInIR(StoreInst *SI) const {
18505 return needsCmpXchgNb(SI->getValueOperand()->getType());
18508 // Note: this turns large loads into lock cmpxchg8b/16b.
18509 // FIXME: On 32 bits x86, fild/movq might be faster than lock cmpxchg8b.
18510 bool X86TargetLowering::shouldExpandAtomicLoadInIR(LoadInst *LI) const {
18511 auto PTy = cast<PointerType>(LI->getPointerOperand()->getType());
18512 return needsCmpXchgNb(PTy->getElementType());
18515 bool X86TargetLowering::shouldExpandAtomicRMWInIR(AtomicRMWInst *AI) const {
18516 const X86Subtarget &Subtarget =
18517 getTargetMachine().getSubtarget<X86Subtarget>();
18518 unsigned NativeWidth = Subtarget.is64Bit() ? 64 : 32;
18519 const Type *MemType = AI->getType();
18521 // If the operand is too big, we must see if cmpxchg8/16b is available
18522 // and default to library calls otherwise.
18523 if (MemType->getPrimitiveSizeInBits() > NativeWidth)
18524 return needsCmpXchgNb(MemType);
18526 AtomicRMWInst::BinOp Op = AI->getOperation();
18529 llvm_unreachable("Unknown atomic operation");
18530 case AtomicRMWInst::Xchg:
18531 case AtomicRMWInst::Add:
18532 case AtomicRMWInst::Sub:
18533 // It's better to use xadd, xsub or xchg for these in all cases.
18535 case AtomicRMWInst::Or:
18536 case AtomicRMWInst::And:
18537 case AtomicRMWInst::Xor:
18538 // If the atomicrmw's result isn't actually used, we can just add a "lock"
18539 // prefix to a normal instruction for these operations.
18540 return !AI->use_empty();
18541 case AtomicRMWInst::Nand:
18542 case AtomicRMWInst::Max:
18543 case AtomicRMWInst::Min:
18544 case AtomicRMWInst::UMax:
18545 case AtomicRMWInst::UMin:
18546 // These always require a non-trivial set of data operations on x86. We must
18547 // use a cmpxchg loop.
18552 static bool hasMFENCE(const X86Subtarget& Subtarget) {
18553 // Use mfence if we have SSE2 or we're on x86-64 (even if we asked for
18554 // no-sse2). There isn't any reason to disable it if the target processor
18556 return Subtarget.hasSSE2() || Subtarget.is64Bit();
18560 X86TargetLowering::lowerIdempotentRMWIntoFencedLoad(AtomicRMWInst *AI) const {
18561 const X86Subtarget &Subtarget =
18562 getTargetMachine().getSubtarget<X86Subtarget>();
18563 unsigned NativeWidth = Subtarget.is64Bit() ? 64 : 32;
18564 const Type *MemType = AI->getType();
18565 // Accesses larger than the native width are turned into cmpxchg/libcalls, so
18566 // there is no benefit in turning such RMWs into loads, and it is actually
18567 // harmful as it introduces a mfence.
18568 if (MemType->getPrimitiveSizeInBits() > NativeWidth)
18571 auto Builder = IRBuilder<>(AI);
18572 Module *M = Builder.GetInsertBlock()->getParent()->getParent();
18573 auto SynchScope = AI->getSynchScope();
18574 // We must restrict the ordering to avoid generating loads with Release or
18575 // ReleaseAcquire orderings.
18576 auto Order = AtomicCmpXchgInst::getStrongestFailureOrdering(AI->getOrdering());
18577 auto Ptr = AI->getPointerOperand();
18579 // Before the load we need a fence. Here is an example lifted from
18580 // http://www.hpl.hp.com/techreports/2012/HPL-2012-68.pdf showing why a fence
18583 // x.store(1, relaxed);
18584 // r1 = y.fetch_add(0, release);
18586 // y.fetch_add(42, acquire);
18587 // r2 = x.load(relaxed);
18588 // r1 = r2 = 0 is impossible, but becomes possible if the idempotent rmw is
18589 // lowered to just a load without a fence. A mfence flushes the store buffer,
18590 // making the optimization clearly correct.
18591 // FIXME: it is required if isAtLeastRelease(Order) but it is not clear
18592 // otherwise, we might be able to be more agressive on relaxed idempotent
18593 // rmw. In practice, they do not look useful, so we don't try to be
18594 // especially clever.
18595 if (SynchScope == SingleThread) {
18596 // FIXME: we could just insert an X86ISD::MEMBARRIER here, except we are at
18597 // the IR level, so we must wrap it in an intrinsic.
18599 } else if (hasMFENCE(Subtarget)) {
18600 Function *MFence = llvm::Intrinsic::getDeclaration(M,
18601 Intrinsic::x86_sse2_mfence);
18602 Builder.CreateCall(MFence);
18604 // FIXME: it might make sense to use a locked operation here but on a
18605 // different cache-line to prevent cache-line bouncing. In practice it
18606 // is probably a small win, and x86 processors without mfence are rare
18607 // enough that we do not bother.
18611 // Finally we can emit the atomic load.
18612 LoadInst *Loaded = Builder.CreateAlignedLoad(Ptr,
18613 AI->getType()->getPrimitiveSizeInBits());
18614 Loaded->setAtomic(Order, SynchScope);
18615 AI->replaceAllUsesWith(Loaded);
18616 AI->eraseFromParent();
18620 static SDValue LowerATOMIC_FENCE(SDValue Op, const X86Subtarget *Subtarget,
18621 SelectionDAG &DAG) {
18623 AtomicOrdering FenceOrdering = static_cast<AtomicOrdering>(
18624 cast<ConstantSDNode>(Op.getOperand(1))->getZExtValue());
18625 SynchronizationScope FenceScope = static_cast<SynchronizationScope>(
18626 cast<ConstantSDNode>(Op.getOperand(2))->getZExtValue());
18628 // The only fence that needs an instruction is a sequentially-consistent
18629 // cross-thread fence.
18630 if (FenceOrdering == SequentiallyConsistent && FenceScope == CrossThread) {
18631 if (hasMFENCE(*Subtarget))
18632 return DAG.getNode(X86ISD::MFENCE, dl, MVT::Other, Op.getOperand(0));
18634 SDValue Chain = Op.getOperand(0);
18635 SDValue Zero = DAG.getConstant(0, MVT::i32);
18637 DAG.getRegister(X86::ESP, MVT::i32), // Base
18638 DAG.getTargetConstant(1, MVT::i8), // Scale
18639 DAG.getRegister(0, MVT::i32), // Index
18640 DAG.getTargetConstant(0, MVT::i32), // Disp
18641 DAG.getRegister(0, MVT::i32), // Segment.
18645 SDNode *Res = DAG.getMachineNode(X86::OR32mrLocked, dl, MVT::Other, Ops);
18646 return SDValue(Res, 0);
18649 // MEMBARRIER is a compiler barrier; it codegens to a no-op.
18650 return DAG.getNode(X86ISD::MEMBARRIER, dl, MVT::Other, Op.getOperand(0));
18653 static SDValue LowerCMP_SWAP(SDValue Op, const X86Subtarget *Subtarget,
18654 SelectionDAG &DAG) {
18655 MVT T = Op.getSimpleValueType();
18659 switch(T.SimpleTy) {
18660 default: llvm_unreachable("Invalid value type!");
18661 case MVT::i8: Reg = X86::AL; size = 1; break;
18662 case MVT::i16: Reg = X86::AX; size = 2; break;
18663 case MVT::i32: Reg = X86::EAX; size = 4; break;
18665 assert(Subtarget->is64Bit() && "Node not type legal!");
18666 Reg = X86::RAX; size = 8;
18669 SDValue cpIn = DAG.getCopyToReg(Op.getOperand(0), DL, Reg,
18670 Op.getOperand(2), SDValue());
18671 SDValue Ops[] = { cpIn.getValue(0),
18674 DAG.getTargetConstant(size, MVT::i8),
18675 cpIn.getValue(1) };
18676 SDVTList Tys = DAG.getVTList(MVT::Other, MVT::Glue);
18677 MachineMemOperand *MMO = cast<AtomicSDNode>(Op)->getMemOperand();
18678 SDValue Result = DAG.getMemIntrinsicNode(X86ISD::LCMPXCHG_DAG, DL, Tys,
18682 DAG.getCopyFromReg(Result.getValue(0), DL, Reg, T, Result.getValue(1));
18683 SDValue EFLAGS = DAG.getCopyFromReg(cpOut.getValue(1), DL, X86::EFLAGS,
18684 MVT::i32, cpOut.getValue(2));
18685 SDValue Success = DAG.getNode(X86ISD::SETCC, DL, Op->getValueType(1),
18686 DAG.getConstant(X86::COND_E, MVT::i8), EFLAGS);
18688 DAG.ReplaceAllUsesOfValueWith(Op.getValue(0), cpOut);
18689 DAG.ReplaceAllUsesOfValueWith(Op.getValue(1), Success);
18690 DAG.ReplaceAllUsesOfValueWith(Op.getValue(2), EFLAGS.getValue(1));
18694 static SDValue LowerBITCAST(SDValue Op, const X86Subtarget *Subtarget,
18695 SelectionDAG &DAG) {
18696 MVT SrcVT = Op.getOperand(0).getSimpleValueType();
18697 MVT DstVT = Op.getSimpleValueType();
18699 if (SrcVT == MVT::v2i32 || SrcVT == MVT::v4i16 || SrcVT == MVT::v8i8) {
18700 assert(Subtarget->hasSSE2() && "Requires at least SSE2!");
18701 if (DstVT != MVT::f64)
18702 // This conversion needs to be expanded.
18705 SDValue InVec = Op->getOperand(0);
18707 unsigned NumElts = SrcVT.getVectorNumElements();
18708 EVT SVT = SrcVT.getVectorElementType();
18710 // Widen the vector in input in the case of MVT::v2i32.
18711 // Example: from MVT::v2i32 to MVT::v4i32.
18712 SmallVector<SDValue, 16> Elts;
18713 for (unsigned i = 0, e = NumElts; i != e; ++i)
18714 Elts.push_back(DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, SVT, InVec,
18715 DAG.getIntPtrConstant(i)));
18717 // Explicitly mark the extra elements as Undef.
18718 SDValue Undef = DAG.getUNDEF(SVT);
18719 for (unsigned i = NumElts, e = NumElts * 2; i != e; ++i)
18720 Elts.push_back(Undef);
18722 EVT NewVT = EVT::getVectorVT(*DAG.getContext(), SVT, NumElts * 2);
18723 SDValue BV = DAG.getNode(ISD::BUILD_VECTOR, dl, NewVT, Elts);
18724 SDValue ToV2F64 = DAG.getNode(ISD::BITCAST, dl, MVT::v2f64, BV);
18725 return DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::f64, ToV2F64,
18726 DAG.getIntPtrConstant(0));
18729 assert(Subtarget->is64Bit() && !Subtarget->hasSSE2() &&
18730 Subtarget->hasMMX() && "Unexpected custom BITCAST");
18731 assert((DstVT == MVT::i64 ||
18732 (DstVT.isVector() && DstVT.getSizeInBits()==64)) &&
18733 "Unexpected custom BITCAST");
18734 // i64 <=> MMX conversions are Legal.
18735 if (SrcVT==MVT::i64 && DstVT.isVector())
18737 if (DstVT==MVT::i64 && SrcVT.isVector())
18739 // MMX <=> MMX conversions are Legal.
18740 if (SrcVT.isVector() && DstVT.isVector())
18742 // All other conversions need to be expanded.
18746 static SDValue LowerLOAD_SUB(SDValue Op, SelectionDAG &DAG) {
18747 SDNode *Node = Op.getNode();
18749 EVT T = Node->getValueType(0);
18750 SDValue negOp = DAG.getNode(ISD::SUB, dl, T,
18751 DAG.getConstant(0, T), Node->getOperand(2));
18752 return DAG.getAtomic(ISD::ATOMIC_LOAD_ADD, dl,
18753 cast<AtomicSDNode>(Node)->getMemoryVT(),
18754 Node->getOperand(0),
18755 Node->getOperand(1), negOp,
18756 cast<AtomicSDNode>(Node)->getMemOperand(),
18757 cast<AtomicSDNode>(Node)->getOrdering(),
18758 cast<AtomicSDNode>(Node)->getSynchScope());
18761 static SDValue LowerATOMIC_STORE(SDValue Op, SelectionDAG &DAG) {
18762 SDNode *Node = Op.getNode();
18764 EVT VT = cast<AtomicSDNode>(Node)->getMemoryVT();
18766 // Convert seq_cst store -> xchg
18767 // Convert wide store -> swap (-> cmpxchg8b/cmpxchg16b)
18768 // FIXME: On 32-bit, store -> fist or movq would be more efficient
18769 // (The only way to get a 16-byte store is cmpxchg16b)
18770 // FIXME: 16-byte ATOMIC_SWAP isn't actually hooked up at the moment.
18771 if (cast<AtomicSDNode>(Node)->getOrdering() == SequentiallyConsistent ||
18772 !DAG.getTargetLoweringInfo().isTypeLegal(VT)) {
18773 SDValue Swap = DAG.getAtomic(ISD::ATOMIC_SWAP, dl,
18774 cast<AtomicSDNode>(Node)->getMemoryVT(),
18775 Node->getOperand(0),
18776 Node->getOperand(1), Node->getOperand(2),
18777 cast<AtomicSDNode>(Node)->getMemOperand(),
18778 cast<AtomicSDNode>(Node)->getOrdering(),
18779 cast<AtomicSDNode>(Node)->getSynchScope());
18780 return Swap.getValue(1);
18782 // Other atomic stores have a simple pattern.
18786 static SDValue LowerADDC_ADDE_SUBC_SUBE(SDValue Op, SelectionDAG &DAG) {
18787 EVT VT = Op.getNode()->getSimpleValueType(0);
18789 // Let legalize expand this if it isn't a legal type yet.
18790 if (!DAG.getTargetLoweringInfo().isTypeLegal(VT))
18793 SDVTList VTs = DAG.getVTList(VT, MVT::i32);
18796 bool ExtraOp = false;
18797 switch (Op.getOpcode()) {
18798 default: llvm_unreachable("Invalid code");
18799 case ISD::ADDC: Opc = X86ISD::ADD; break;
18800 case ISD::ADDE: Opc = X86ISD::ADC; ExtraOp = true; break;
18801 case ISD::SUBC: Opc = X86ISD::SUB; break;
18802 case ISD::SUBE: Opc = X86ISD::SBB; ExtraOp = true; break;
18806 return DAG.getNode(Opc, SDLoc(Op), VTs, Op.getOperand(0),
18808 return DAG.getNode(Opc, SDLoc(Op), VTs, Op.getOperand(0),
18809 Op.getOperand(1), Op.getOperand(2));
18812 static SDValue LowerFSINCOS(SDValue Op, const X86Subtarget *Subtarget,
18813 SelectionDAG &DAG) {
18814 assert(Subtarget->isTargetDarwin() && Subtarget->is64Bit());
18816 // For MacOSX, we want to call an alternative entry point: __sincos_stret,
18817 // which returns the values as { float, float } (in XMM0) or
18818 // { double, double } (which is returned in XMM0, XMM1).
18820 SDValue Arg = Op.getOperand(0);
18821 EVT ArgVT = Arg.getValueType();
18822 Type *ArgTy = ArgVT.getTypeForEVT(*DAG.getContext());
18824 TargetLowering::ArgListTy Args;
18825 TargetLowering::ArgListEntry Entry;
18829 Entry.isSExt = false;
18830 Entry.isZExt = false;
18831 Args.push_back(Entry);
18833 bool isF64 = ArgVT == MVT::f64;
18834 // Only optimize x86_64 for now. i386 is a bit messy. For f32,
18835 // the small struct {f32, f32} is returned in (eax, edx). For f64,
18836 // the results are returned via SRet in memory.
18837 const char *LibcallName = isF64 ? "__sincos_stret" : "__sincosf_stret";
18838 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
18839 SDValue Callee = DAG.getExternalSymbol(LibcallName, TLI.getPointerTy());
18841 Type *RetTy = isF64
18842 ? (Type*)StructType::get(ArgTy, ArgTy, NULL)
18843 : (Type*)VectorType::get(ArgTy, 4);
18845 TargetLowering::CallLoweringInfo CLI(DAG);
18846 CLI.setDebugLoc(dl).setChain(DAG.getEntryNode())
18847 .setCallee(CallingConv::C, RetTy, Callee, std::move(Args), 0);
18849 std::pair<SDValue, SDValue> CallResult = TLI.LowerCallTo(CLI);
18852 // Returned in xmm0 and xmm1.
18853 return CallResult.first;
18855 // Returned in bits 0:31 and 32:64 xmm0.
18856 SDValue SinVal = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, ArgVT,
18857 CallResult.first, DAG.getIntPtrConstant(0));
18858 SDValue CosVal = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, ArgVT,
18859 CallResult.first, DAG.getIntPtrConstant(1));
18860 SDVTList Tys = DAG.getVTList(ArgVT, ArgVT);
18861 return DAG.getNode(ISD::MERGE_VALUES, dl, Tys, SinVal, CosVal);
18864 /// LowerOperation - Provide custom lowering hooks for some operations.
18866 SDValue X86TargetLowering::LowerOperation(SDValue Op, SelectionDAG &DAG) const {
18867 switch (Op.getOpcode()) {
18868 default: llvm_unreachable("Should not custom lower this!");
18869 case ISD::SIGN_EXTEND_INREG: return LowerSIGN_EXTEND_INREG(Op,DAG);
18870 case ISD::ATOMIC_FENCE: return LowerATOMIC_FENCE(Op, Subtarget, DAG);
18871 case ISD::ATOMIC_CMP_SWAP_WITH_SUCCESS:
18872 return LowerCMP_SWAP(Op, Subtarget, DAG);
18873 case ISD::ATOMIC_LOAD_SUB: return LowerLOAD_SUB(Op,DAG);
18874 case ISD::ATOMIC_STORE: return LowerATOMIC_STORE(Op,DAG);
18875 case ISD::BUILD_VECTOR: return LowerBUILD_VECTOR(Op, DAG);
18876 case ISD::CONCAT_VECTORS: return LowerCONCAT_VECTORS(Op, DAG);
18877 case ISD::VECTOR_SHUFFLE: return LowerVECTOR_SHUFFLE(Op, DAG);
18878 case ISD::VSELECT: return LowerVSELECT(Op, DAG);
18879 case ISD::EXTRACT_VECTOR_ELT: return LowerEXTRACT_VECTOR_ELT(Op, DAG);
18880 case ISD::INSERT_VECTOR_ELT: return LowerINSERT_VECTOR_ELT(Op, DAG);
18881 case ISD::EXTRACT_SUBVECTOR: return LowerEXTRACT_SUBVECTOR(Op,Subtarget,DAG);
18882 case ISD::INSERT_SUBVECTOR: return LowerINSERT_SUBVECTOR(Op, Subtarget,DAG);
18883 case ISD::SCALAR_TO_VECTOR: return LowerSCALAR_TO_VECTOR(Op, DAG);
18884 case ISD::ConstantPool: return LowerConstantPool(Op, DAG);
18885 case ISD::GlobalAddress: return LowerGlobalAddress(Op, DAG);
18886 case ISD::GlobalTLSAddress: return LowerGlobalTLSAddress(Op, DAG);
18887 case ISD::ExternalSymbol: return LowerExternalSymbol(Op, DAG);
18888 case ISD::BlockAddress: return LowerBlockAddress(Op, DAG);
18889 case ISD::SHL_PARTS:
18890 case ISD::SRA_PARTS:
18891 case ISD::SRL_PARTS: return LowerShiftParts(Op, DAG);
18892 case ISD::SINT_TO_FP: return LowerSINT_TO_FP(Op, DAG);
18893 case ISD::UINT_TO_FP: return LowerUINT_TO_FP(Op, DAG);
18894 case ISD::TRUNCATE: return LowerTRUNCATE(Op, DAG);
18895 case ISD::ZERO_EXTEND: return LowerZERO_EXTEND(Op, Subtarget, DAG);
18896 case ISD::SIGN_EXTEND: return LowerSIGN_EXTEND(Op, Subtarget, DAG);
18897 case ISD::ANY_EXTEND: return LowerANY_EXTEND(Op, Subtarget, DAG);
18898 case ISD::FP_TO_SINT: return LowerFP_TO_SINT(Op, DAG);
18899 case ISD::FP_TO_UINT: return LowerFP_TO_UINT(Op, DAG);
18900 case ISD::FP_EXTEND: return LowerFP_EXTEND(Op, DAG);
18901 case ISD::LOAD: return LowerExtendedLoad(Op, Subtarget, DAG);
18903 case ISD::FNEG: return LowerFABSorFNEG(Op, DAG);
18904 case ISD::FCOPYSIGN: return LowerFCOPYSIGN(Op, DAG);
18905 case ISD::FGETSIGN: return LowerFGETSIGN(Op, DAG);
18906 case ISD::SETCC: return LowerSETCC(Op, DAG);
18907 case ISD::SELECT: return LowerSELECT(Op, DAG);
18908 case ISD::BRCOND: return LowerBRCOND(Op, DAG);
18909 case ISD::JumpTable: return LowerJumpTable(Op, DAG);
18910 case ISD::VASTART: return LowerVASTART(Op, DAG);
18911 case ISD::VAARG: return LowerVAARG(Op, DAG);
18912 case ISD::VACOPY: return LowerVACOPY(Op, Subtarget, DAG);
18913 case ISD::INTRINSIC_WO_CHAIN: return LowerINTRINSIC_WO_CHAIN(Op, Subtarget, DAG);
18914 case ISD::INTRINSIC_VOID:
18915 case ISD::INTRINSIC_W_CHAIN: return LowerINTRINSIC_W_CHAIN(Op, Subtarget, DAG);
18916 case ISD::RETURNADDR: return LowerRETURNADDR(Op, DAG);
18917 case ISD::FRAMEADDR: return LowerFRAMEADDR(Op, DAG);
18918 case ISD::FRAME_TO_ARGS_OFFSET:
18919 return LowerFRAME_TO_ARGS_OFFSET(Op, DAG);
18920 case ISD::DYNAMIC_STACKALLOC: return LowerDYNAMIC_STACKALLOC(Op, DAG);
18921 case ISD::EH_RETURN: return LowerEH_RETURN(Op, DAG);
18922 case ISD::EH_SJLJ_SETJMP: return lowerEH_SJLJ_SETJMP(Op, DAG);
18923 case ISD::EH_SJLJ_LONGJMP: return lowerEH_SJLJ_LONGJMP(Op, DAG);
18924 case ISD::INIT_TRAMPOLINE: return LowerINIT_TRAMPOLINE(Op, DAG);
18925 case ISD::ADJUST_TRAMPOLINE: return LowerADJUST_TRAMPOLINE(Op, DAG);
18926 case ISD::FLT_ROUNDS_: return LowerFLT_ROUNDS_(Op, DAG);
18927 case ISD::CTLZ: return LowerCTLZ(Op, DAG);
18928 case ISD::CTLZ_ZERO_UNDEF: return LowerCTLZ_ZERO_UNDEF(Op, DAG);
18929 case ISD::CTTZ: return LowerCTTZ(Op, DAG);
18930 case ISD::MUL: return LowerMUL(Op, Subtarget, DAG);
18931 case ISD::UMUL_LOHI:
18932 case ISD::SMUL_LOHI: return LowerMUL_LOHI(Op, Subtarget, DAG);
18935 case ISD::SHL: return LowerShift(Op, Subtarget, DAG);
18941 case ISD::UMULO: return LowerXALUO(Op, DAG);
18942 case ISD::READCYCLECOUNTER: return LowerREADCYCLECOUNTER(Op, Subtarget,DAG);
18943 case ISD::BITCAST: return LowerBITCAST(Op, Subtarget, DAG);
18947 case ISD::SUBE: return LowerADDC_ADDE_SUBC_SUBE(Op, DAG);
18948 case ISD::ADD: return LowerADD(Op, DAG);
18949 case ISD::SUB: return LowerSUB(Op, DAG);
18950 case ISD::FSINCOS: return LowerFSINCOS(Op, Subtarget, DAG);
18954 /// ReplaceNodeResults - Replace a node with an illegal result type
18955 /// with a new node built out of custom code.
18956 void X86TargetLowering::ReplaceNodeResults(SDNode *N,
18957 SmallVectorImpl<SDValue>&Results,
18958 SelectionDAG &DAG) const {
18960 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
18961 switch (N->getOpcode()) {
18963 llvm_unreachable("Do not know how to custom type legalize this operation!");
18964 case ISD::SIGN_EXTEND_INREG:
18969 // We don't want to expand or promote these.
18976 case ISD::UDIVREM: {
18977 SDValue V = LowerWin64_i128OP(SDValue(N,0), DAG);
18978 Results.push_back(V);
18981 case ISD::FP_TO_SINT:
18982 case ISD::FP_TO_UINT: {
18983 bool IsSigned = N->getOpcode() == ISD::FP_TO_SINT;
18985 if (!IsSigned && !isIntegerTypeFTOL(SDValue(N, 0).getValueType()))
18988 std::pair<SDValue,SDValue> Vals =
18989 FP_TO_INTHelper(SDValue(N, 0), DAG, IsSigned, /*IsReplace=*/ true);
18990 SDValue FIST = Vals.first, StackSlot = Vals.second;
18991 if (FIST.getNode()) {
18992 EVT VT = N->getValueType(0);
18993 // Return a load from the stack slot.
18994 if (StackSlot.getNode())
18995 Results.push_back(DAG.getLoad(VT, dl, FIST, StackSlot,
18996 MachinePointerInfo(),
18997 false, false, false, 0));
18999 Results.push_back(FIST);
19003 case ISD::UINT_TO_FP: {
19004 assert(Subtarget->hasSSE2() && "Requires at least SSE2!");
19005 if (N->getOperand(0).getValueType() != MVT::v2i32 ||
19006 N->getValueType(0) != MVT::v2f32)
19008 SDValue ZExtIn = DAG.getNode(ISD::ZERO_EXTEND, dl, MVT::v2i64,
19010 SDValue Bias = DAG.getConstantFP(BitsToDouble(0x4330000000000000ULL),
19012 SDValue VBias = DAG.getNode(ISD::BUILD_VECTOR, dl, MVT::v2f64, Bias, Bias);
19013 SDValue Or = DAG.getNode(ISD::OR, dl, MVT::v2i64, ZExtIn,
19014 DAG.getNode(ISD::BITCAST, dl, MVT::v2i64, VBias));
19015 Or = DAG.getNode(ISD::BITCAST, dl, MVT::v2f64, Or);
19016 SDValue Sub = DAG.getNode(ISD::FSUB, dl, MVT::v2f64, Or, VBias);
19017 Results.push_back(DAG.getNode(X86ISD::VFPROUND, dl, MVT::v4f32, Sub));
19020 case ISD::FP_ROUND: {
19021 if (!TLI.isTypeLegal(N->getOperand(0).getValueType()))
19023 SDValue V = DAG.getNode(X86ISD::VFPROUND, dl, MVT::v4f32, N->getOperand(0));
19024 Results.push_back(V);
19027 case ISD::INTRINSIC_W_CHAIN: {
19028 unsigned IntNo = cast<ConstantSDNode>(N->getOperand(1))->getZExtValue();
19030 default : llvm_unreachable("Do not know how to custom type "
19031 "legalize this intrinsic operation!");
19032 case Intrinsic::x86_rdtsc:
19033 return getReadTimeStampCounter(N, dl, X86ISD::RDTSC_DAG, DAG, Subtarget,
19035 case Intrinsic::x86_rdtscp:
19036 return getReadTimeStampCounter(N, dl, X86ISD::RDTSCP_DAG, DAG, Subtarget,
19038 case Intrinsic::x86_rdpmc:
19039 return getReadPerformanceCounter(N, dl, DAG, Subtarget, Results);
19042 case ISD::READCYCLECOUNTER: {
19043 return getReadTimeStampCounter(N, dl, X86ISD::RDTSC_DAG, DAG, Subtarget,
19046 case ISD::ATOMIC_CMP_SWAP_WITH_SUCCESS: {
19047 EVT T = N->getValueType(0);
19048 assert((T == MVT::i64 || T == MVT::i128) && "can only expand cmpxchg pair");
19049 bool Regs64bit = T == MVT::i128;
19050 EVT HalfT = Regs64bit ? MVT::i64 : MVT::i32;
19051 SDValue cpInL, cpInH;
19052 cpInL = DAG.getNode(ISD::EXTRACT_ELEMENT, dl, HalfT, N->getOperand(2),
19053 DAG.getConstant(0, HalfT));
19054 cpInH = DAG.getNode(ISD::EXTRACT_ELEMENT, dl, HalfT, N->getOperand(2),
19055 DAG.getConstant(1, HalfT));
19056 cpInL = DAG.getCopyToReg(N->getOperand(0), dl,
19057 Regs64bit ? X86::RAX : X86::EAX,
19059 cpInH = DAG.getCopyToReg(cpInL.getValue(0), dl,
19060 Regs64bit ? X86::RDX : X86::EDX,
19061 cpInH, cpInL.getValue(1));
19062 SDValue swapInL, swapInH;
19063 swapInL = DAG.getNode(ISD::EXTRACT_ELEMENT, dl, HalfT, N->getOperand(3),
19064 DAG.getConstant(0, HalfT));
19065 swapInH = DAG.getNode(ISD::EXTRACT_ELEMENT, dl, HalfT, N->getOperand(3),
19066 DAG.getConstant(1, HalfT));
19067 swapInL = DAG.getCopyToReg(cpInH.getValue(0), dl,
19068 Regs64bit ? X86::RBX : X86::EBX,
19069 swapInL, cpInH.getValue(1));
19070 swapInH = DAG.getCopyToReg(swapInL.getValue(0), dl,
19071 Regs64bit ? X86::RCX : X86::ECX,
19072 swapInH, swapInL.getValue(1));
19073 SDValue Ops[] = { swapInH.getValue(0),
19075 swapInH.getValue(1) };
19076 SDVTList Tys = DAG.getVTList(MVT::Other, MVT::Glue);
19077 MachineMemOperand *MMO = cast<AtomicSDNode>(N)->getMemOperand();
19078 unsigned Opcode = Regs64bit ? X86ISD::LCMPXCHG16_DAG :
19079 X86ISD::LCMPXCHG8_DAG;
19080 SDValue Result = DAG.getMemIntrinsicNode(Opcode, dl, Tys, Ops, T, MMO);
19081 SDValue cpOutL = DAG.getCopyFromReg(Result.getValue(0), dl,
19082 Regs64bit ? X86::RAX : X86::EAX,
19083 HalfT, Result.getValue(1));
19084 SDValue cpOutH = DAG.getCopyFromReg(cpOutL.getValue(1), dl,
19085 Regs64bit ? X86::RDX : X86::EDX,
19086 HalfT, cpOutL.getValue(2));
19087 SDValue OpsF[] = { cpOutL.getValue(0), cpOutH.getValue(0)};
19089 SDValue EFLAGS = DAG.getCopyFromReg(cpOutH.getValue(1), dl, X86::EFLAGS,
19090 MVT::i32, cpOutH.getValue(2));
19092 DAG.getNode(X86ISD::SETCC, dl, MVT::i8,
19093 DAG.getConstant(X86::COND_E, MVT::i8), EFLAGS);
19094 Success = DAG.getZExtOrTrunc(Success, dl, N->getValueType(1));
19096 Results.push_back(DAG.getNode(ISD::BUILD_PAIR, dl, T, OpsF));
19097 Results.push_back(Success);
19098 Results.push_back(EFLAGS.getValue(1));
19101 case ISD::ATOMIC_SWAP:
19102 case ISD::ATOMIC_LOAD_ADD:
19103 case ISD::ATOMIC_LOAD_SUB:
19104 case ISD::ATOMIC_LOAD_AND:
19105 case ISD::ATOMIC_LOAD_OR:
19106 case ISD::ATOMIC_LOAD_XOR:
19107 case ISD::ATOMIC_LOAD_NAND:
19108 case ISD::ATOMIC_LOAD_MIN:
19109 case ISD::ATOMIC_LOAD_MAX:
19110 case ISD::ATOMIC_LOAD_UMIN:
19111 case ISD::ATOMIC_LOAD_UMAX:
19112 case ISD::ATOMIC_LOAD: {
19113 // Delegate to generic TypeLegalization. Situations we can really handle
19114 // should have already been dealt with by AtomicExpandPass.cpp.
19117 case ISD::BITCAST: {
19118 assert(Subtarget->hasSSE2() && "Requires at least SSE2!");
19119 EVT DstVT = N->getValueType(0);
19120 EVT SrcVT = N->getOperand(0)->getValueType(0);
19122 if (SrcVT != MVT::f64 ||
19123 (DstVT != MVT::v2i32 && DstVT != MVT::v4i16 && DstVT != MVT::v8i8))
19126 unsigned NumElts = DstVT.getVectorNumElements();
19127 EVT SVT = DstVT.getVectorElementType();
19128 EVT WiderVT = EVT::getVectorVT(*DAG.getContext(), SVT, NumElts * 2);
19129 SDValue Expanded = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl,
19130 MVT::v2f64, N->getOperand(0));
19131 SDValue ToVecInt = DAG.getNode(ISD::BITCAST, dl, WiderVT, Expanded);
19133 if (ExperimentalVectorWideningLegalization) {
19134 // If we are legalizing vectors by widening, we already have the desired
19135 // legal vector type, just return it.
19136 Results.push_back(ToVecInt);
19140 SmallVector<SDValue, 8> Elts;
19141 for (unsigned i = 0, e = NumElts; i != e; ++i)
19142 Elts.push_back(DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, SVT,
19143 ToVecInt, DAG.getIntPtrConstant(i)));
19145 Results.push_back(DAG.getNode(ISD::BUILD_VECTOR, dl, DstVT, Elts));
19150 const char *X86TargetLowering::getTargetNodeName(unsigned Opcode) const {
19152 default: return nullptr;
19153 case X86ISD::BSF: return "X86ISD::BSF";
19154 case X86ISD::BSR: return "X86ISD::BSR";
19155 case X86ISD::SHLD: return "X86ISD::SHLD";
19156 case X86ISD::SHRD: return "X86ISD::SHRD";
19157 case X86ISD::FAND: return "X86ISD::FAND";
19158 case X86ISD::FANDN: return "X86ISD::FANDN";
19159 case X86ISD::FOR: return "X86ISD::FOR";
19160 case X86ISD::FXOR: return "X86ISD::FXOR";
19161 case X86ISD::FSRL: return "X86ISD::FSRL";
19162 case X86ISD::FILD: return "X86ISD::FILD";
19163 case X86ISD::FILD_FLAG: return "X86ISD::FILD_FLAG";
19164 case X86ISD::FP_TO_INT16_IN_MEM: return "X86ISD::FP_TO_INT16_IN_MEM";
19165 case X86ISD::FP_TO_INT32_IN_MEM: return "X86ISD::FP_TO_INT32_IN_MEM";
19166 case X86ISD::FP_TO_INT64_IN_MEM: return "X86ISD::FP_TO_INT64_IN_MEM";
19167 case X86ISD::FLD: return "X86ISD::FLD";
19168 case X86ISD::FST: return "X86ISD::FST";
19169 case X86ISD::CALL: return "X86ISD::CALL";
19170 case X86ISD::RDTSC_DAG: return "X86ISD::RDTSC_DAG";
19171 case X86ISD::RDTSCP_DAG: return "X86ISD::RDTSCP_DAG";
19172 case X86ISD::RDPMC_DAG: return "X86ISD::RDPMC_DAG";
19173 case X86ISD::BT: return "X86ISD::BT";
19174 case X86ISD::CMP: return "X86ISD::CMP";
19175 case X86ISD::COMI: return "X86ISD::COMI";
19176 case X86ISD::UCOMI: return "X86ISD::UCOMI";
19177 case X86ISD::CMPM: return "X86ISD::CMPM";
19178 case X86ISD::CMPMU: return "X86ISD::CMPMU";
19179 case X86ISD::SETCC: return "X86ISD::SETCC";
19180 case X86ISD::SETCC_CARRY: return "X86ISD::SETCC_CARRY";
19181 case X86ISD::FSETCC: return "X86ISD::FSETCC";
19182 case X86ISD::CMOV: return "X86ISD::CMOV";
19183 case X86ISD::BRCOND: return "X86ISD::BRCOND";
19184 case X86ISD::RET_FLAG: return "X86ISD::RET_FLAG";
19185 case X86ISD::REP_STOS: return "X86ISD::REP_STOS";
19186 case X86ISD::REP_MOVS: return "X86ISD::REP_MOVS";
19187 case X86ISD::GlobalBaseReg: return "X86ISD::GlobalBaseReg";
19188 case X86ISD::Wrapper: return "X86ISD::Wrapper";
19189 case X86ISD::WrapperRIP: return "X86ISD::WrapperRIP";
19190 case X86ISD::PEXTRB: return "X86ISD::PEXTRB";
19191 case X86ISD::PEXTRW: return "X86ISD::PEXTRW";
19192 case X86ISD::INSERTPS: return "X86ISD::INSERTPS";
19193 case X86ISD::PINSRB: return "X86ISD::PINSRB";
19194 case X86ISD::PINSRW: return "X86ISD::PINSRW";
19195 case X86ISD::PSHUFB: return "X86ISD::PSHUFB";
19196 case X86ISD::ANDNP: return "X86ISD::ANDNP";
19197 case X86ISD::PSIGN: return "X86ISD::PSIGN";
19198 case X86ISD::BLENDI: return "X86ISD::BLENDI";
19199 case X86ISD::SHRUNKBLEND: return "X86ISD::SHRUNKBLEND";
19200 case X86ISD::SUBUS: return "X86ISD::SUBUS";
19201 case X86ISD::HADD: return "X86ISD::HADD";
19202 case X86ISD::HSUB: return "X86ISD::HSUB";
19203 case X86ISD::FHADD: return "X86ISD::FHADD";
19204 case X86ISD::FHSUB: return "X86ISD::FHSUB";
19205 case X86ISD::UMAX: return "X86ISD::UMAX";
19206 case X86ISD::UMIN: return "X86ISD::UMIN";
19207 case X86ISD::SMAX: return "X86ISD::SMAX";
19208 case X86ISD::SMIN: return "X86ISD::SMIN";
19209 case X86ISD::FMAX: return "X86ISD::FMAX";
19210 case X86ISD::FMIN: return "X86ISD::FMIN";
19211 case X86ISD::FMAXC: return "X86ISD::FMAXC";
19212 case X86ISD::FMINC: return "X86ISD::FMINC";
19213 case X86ISD::FRSQRT: return "X86ISD::FRSQRT";
19214 case X86ISD::FRCP: return "X86ISD::FRCP";
19215 case X86ISD::TLSADDR: return "X86ISD::TLSADDR";
19216 case X86ISD::TLSBASEADDR: return "X86ISD::TLSBASEADDR";
19217 case X86ISD::TLSCALL: return "X86ISD::TLSCALL";
19218 case X86ISD::EH_SJLJ_SETJMP: return "X86ISD::EH_SJLJ_SETJMP";
19219 case X86ISD::EH_SJLJ_LONGJMP: return "X86ISD::EH_SJLJ_LONGJMP";
19220 case X86ISD::EH_RETURN: return "X86ISD::EH_RETURN";
19221 case X86ISD::TC_RETURN: return "X86ISD::TC_RETURN";
19222 case X86ISD::FNSTCW16m: return "X86ISD::FNSTCW16m";
19223 case X86ISD::FNSTSW16r: return "X86ISD::FNSTSW16r";
19224 case X86ISD::LCMPXCHG_DAG: return "X86ISD::LCMPXCHG_DAG";
19225 case X86ISD::LCMPXCHG8_DAG: return "X86ISD::LCMPXCHG8_DAG";
19226 case X86ISD::LCMPXCHG16_DAG: return "X86ISD::LCMPXCHG16_DAG";
19227 case X86ISD::VZEXT_MOVL: return "X86ISD::VZEXT_MOVL";
19228 case X86ISD::VZEXT_LOAD: return "X86ISD::VZEXT_LOAD";
19229 case X86ISD::VZEXT: return "X86ISD::VZEXT";
19230 case X86ISD::VSEXT: return "X86ISD::VSEXT";
19231 case X86ISD::VTRUNC: return "X86ISD::VTRUNC";
19232 case X86ISD::VTRUNCM: return "X86ISD::VTRUNCM";
19233 case X86ISD::VINSERT: return "X86ISD::VINSERT";
19234 case X86ISD::VFPEXT: return "X86ISD::VFPEXT";
19235 case X86ISD::VFPROUND: return "X86ISD::VFPROUND";
19236 case X86ISD::VSHLDQ: return "X86ISD::VSHLDQ";
19237 case X86ISD::VSRLDQ: return "X86ISD::VSRLDQ";
19238 case X86ISD::VSHL: return "X86ISD::VSHL";
19239 case X86ISD::VSRL: return "X86ISD::VSRL";
19240 case X86ISD::VSRA: return "X86ISD::VSRA";
19241 case X86ISD::VSHLI: return "X86ISD::VSHLI";
19242 case X86ISD::VSRLI: return "X86ISD::VSRLI";
19243 case X86ISD::VSRAI: return "X86ISD::VSRAI";
19244 case X86ISD::CMPP: return "X86ISD::CMPP";
19245 case X86ISD::PCMPEQ: return "X86ISD::PCMPEQ";
19246 case X86ISD::PCMPGT: return "X86ISD::PCMPGT";
19247 case X86ISD::PCMPEQM: return "X86ISD::PCMPEQM";
19248 case X86ISD::PCMPGTM: return "X86ISD::PCMPGTM";
19249 case X86ISD::ADD: return "X86ISD::ADD";
19250 case X86ISD::SUB: return "X86ISD::SUB";
19251 case X86ISD::ADC: return "X86ISD::ADC";
19252 case X86ISD::SBB: return "X86ISD::SBB";
19253 case X86ISD::SMUL: return "X86ISD::SMUL";
19254 case X86ISD::UMUL: return "X86ISD::UMUL";
19255 case X86ISD::SMUL8: return "X86ISD::SMUL8";
19256 case X86ISD::UMUL8: return "X86ISD::UMUL8";
19257 case X86ISD::SDIVREM8_SEXT_HREG: return "X86ISD::SDIVREM8_SEXT_HREG";
19258 case X86ISD::UDIVREM8_ZEXT_HREG: return "X86ISD::UDIVREM8_ZEXT_HREG";
19259 case X86ISD::INC: return "X86ISD::INC";
19260 case X86ISD::DEC: return "X86ISD::DEC";
19261 case X86ISD::OR: return "X86ISD::OR";
19262 case X86ISD::XOR: return "X86ISD::XOR";
19263 case X86ISD::AND: return "X86ISD::AND";
19264 case X86ISD::BEXTR: return "X86ISD::BEXTR";
19265 case X86ISD::MUL_IMM: return "X86ISD::MUL_IMM";
19266 case X86ISD::PTEST: return "X86ISD::PTEST";
19267 case X86ISD::TESTP: return "X86ISD::TESTP";
19268 case X86ISD::TESTM: return "X86ISD::TESTM";
19269 case X86ISD::TESTNM: return "X86ISD::TESTNM";
19270 case X86ISD::KORTEST: return "X86ISD::KORTEST";
19271 case X86ISD::PACKSS: return "X86ISD::PACKSS";
19272 case X86ISD::PACKUS: return "X86ISD::PACKUS";
19273 case X86ISD::PALIGNR: return "X86ISD::PALIGNR";
19274 case X86ISD::VALIGN: return "X86ISD::VALIGN";
19275 case X86ISD::PSHUFD: return "X86ISD::PSHUFD";
19276 case X86ISD::PSHUFHW: return "X86ISD::PSHUFHW";
19277 case X86ISD::PSHUFLW: return "X86ISD::PSHUFLW";
19278 case X86ISD::SHUFP: return "X86ISD::SHUFP";
19279 case X86ISD::MOVLHPS: return "X86ISD::MOVLHPS";
19280 case X86ISD::MOVLHPD: return "X86ISD::MOVLHPD";
19281 case X86ISD::MOVHLPS: return "X86ISD::MOVHLPS";
19282 case X86ISD::MOVLPS: return "X86ISD::MOVLPS";
19283 case X86ISD::MOVLPD: return "X86ISD::MOVLPD";
19284 case X86ISD::MOVDDUP: return "X86ISD::MOVDDUP";
19285 case X86ISD::MOVSHDUP: return "X86ISD::MOVSHDUP";
19286 case X86ISD::MOVSLDUP: return "X86ISD::MOVSLDUP";
19287 case X86ISD::MOVSD: return "X86ISD::MOVSD";
19288 case X86ISD::MOVSS: return "X86ISD::MOVSS";
19289 case X86ISD::UNPCKL: return "X86ISD::UNPCKL";
19290 case X86ISD::UNPCKH: return "X86ISD::UNPCKH";
19291 case X86ISD::VBROADCAST: return "X86ISD::VBROADCAST";
19292 case X86ISD::VBROADCASTM: return "X86ISD::VBROADCASTM";
19293 case X86ISD::VEXTRACT: return "X86ISD::VEXTRACT";
19294 case X86ISD::VPERMILPI: return "X86ISD::VPERMILPI";
19295 case X86ISD::VPERM2X128: return "X86ISD::VPERM2X128";
19296 case X86ISD::VPERMV: return "X86ISD::VPERMV";
19297 case X86ISD::VPERMV3: return "X86ISD::VPERMV3";
19298 case X86ISD::VPERMIV3: return "X86ISD::VPERMIV3";
19299 case X86ISD::VPERMI: return "X86ISD::VPERMI";
19300 case X86ISD::PMULUDQ: return "X86ISD::PMULUDQ";
19301 case X86ISD::PMULDQ: return "X86ISD::PMULDQ";
19302 case X86ISD::VASTART_SAVE_XMM_REGS: return "X86ISD::VASTART_SAVE_XMM_REGS";
19303 case X86ISD::VAARG_64: return "X86ISD::VAARG_64";
19304 case X86ISD::WIN_ALLOCA: return "X86ISD::WIN_ALLOCA";
19305 case X86ISD::MEMBARRIER: return "X86ISD::MEMBARRIER";
19306 case X86ISD::SEG_ALLOCA: return "X86ISD::SEG_ALLOCA";
19307 case X86ISD::WIN_FTOL: return "X86ISD::WIN_FTOL";
19308 case X86ISD::SAHF: return "X86ISD::SAHF";
19309 case X86ISD::RDRAND: return "X86ISD::RDRAND";
19310 case X86ISD::RDSEED: return "X86ISD::RDSEED";
19311 case X86ISD::FMADD: return "X86ISD::FMADD";
19312 case X86ISD::FMSUB: return "X86ISD::FMSUB";
19313 case X86ISD::FNMADD: return "X86ISD::FNMADD";
19314 case X86ISD::FNMSUB: return "X86ISD::FNMSUB";
19315 case X86ISD::FMADDSUB: return "X86ISD::FMADDSUB";
19316 case X86ISD::FMSUBADD: return "X86ISD::FMSUBADD";
19317 case X86ISD::PCMPESTRI: return "X86ISD::PCMPESTRI";
19318 case X86ISD::PCMPISTRI: return "X86ISD::PCMPISTRI";
19319 case X86ISD::XTEST: return "X86ISD::XTEST";
19323 // isLegalAddressingMode - Return true if the addressing mode represented
19324 // by AM is legal for this target, for a load/store of the specified type.
19325 bool X86TargetLowering::isLegalAddressingMode(const AddrMode &AM,
19327 // X86 supports extremely general addressing modes.
19328 CodeModel::Model M = getTargetMachine().getCodeModel();
19329 Reloc::Model R = getTargetMachine().getRelocationModel();
19331 // X86 allows a sign-extended 32-bit immediate field as a displacement.
19332 if (!X86::isOffsetSuitableForCodeModel(AM.BaseOffs, M, AM.BaseGV != nullptr))
19337 Subtarget->ClassifyGlobalReference(AM.BaseGV, getTargetMachine());
19339 // If a reference to this global requires an extra load, we can't fold it.
19340 if (isGlobalStubReference(GVFlags))
19343 // If BaseGV requires a register for the PIC base, we cannot also have a
19344 // BaseReg specified.
19345 if (AM.HasBaseReg && isGlobalRelativeToPICBase(GVFlags))
19348 // If lower 4G is not available, then we must use rip-relative addressing.
19349 if ((M != CodeModel::Small || R != Reloc::Static) &&
19350 Subtarget->is64Bit() && (AM.BaseOffs || AM.Scale > 1))
19354 switch (AM.Scale) {
19360 // These scales always work.
19365 // These scales are formed with basereg+scalereg. Only accept if there is
19370 default: // Other stuff never works.
19377 bool X86TargetLowering::isVectorShiftByScalarCheap(Type *Ty) const {
19378 unsigned Bits = Ty->getScalarSizeInBits();
19380 // 8-bit shifts are always expensive, but versions with a scalar amount aren't
19381 // particularly cheaper than those without.
19385 // On AVX2 there are new vpsllv[dq] instructions (and other shifts), that make
19386 // variable shifts just as cheap as scalar ones.
19387 if (Subtarget->hasInt256() && (Bits == 32 || Bits == 64))
19390 // Otherwise, it's significantly cheaper to shift by a scalar amount than by a
19391 // fully general vector.
19395 bool X86TargetLowering::isTruncateFree(Type *Ty1, Type *Ty2) const {
19396 if (!Ty1->isIntegerTy() || !Ty2->isIntegerTy())
19398 unsigned NumBits1 = Ty1->getPrimitiveSizeInBits();
19399 unsigned NumBits2 = Ty2->getPrimitiveSizeInBits();
19400 return NumBits1 > NumBits2;
19403 bool X86TargetLowering::allowTruncateForTailCall(Type *Ty1, Type *Ty2) const {
19404 if (!Ty1->isIntegerTy() || !Ty2->isIntegerTy())
19407 if (!isTypeLegal(EVT::getEVT(Ty1)))
19410 assert(Ty1->getPrimitiveSizeInBits() <= 64 && "i128 is probably not a noop");
19412 // Assuming the caller doesn't have a zeroext or signext return parameter,
19413 // truncation all the way down to i1 is valid.
19417 bool X86TargetLowering::isLegalICmpImmediate(int64_t Imm) const {
19418 return isInt<32>(Imm);
19421 bool X86TargetLowering::isLegalAddImmediate(int64_t Imm) const {
19422 // Can also use sub to handle negated immediates.
19423 return isInt<32>(Imm);
19426 bool X86TargetLowering::isTruncateFree(EVT VT1, EVT VT2) const {
19427 if (!VT1.isInteger() || !VT2.isInteger())
19429 unsigned NumBits1 = VT1.getSizeInBits();
19430 unsigned NumBits2 = VT2.getSizeInBits();
19431 return NumBits1 > NumBits2;
19434 bool X86TargetLowering::isZExtFree(Type *Ty1, Type *Ty2) const {
19435 // x86-64 implicitly zero-extends 32-bit results in 64-bit registers.
19436 return Ty1->isIntegerTy(32) && Ty2->isIntegerTy(64) && Subtarget->is64Bit();
19439 bool X86TargetLowering::isZExtFree(EVT VT1, EVT VT2) const {
19440 // x86-64 implicitly zero-extends 32-bit results in 64-bit registers.
19441 return VT1 == MVT::i32 && VT2 == MVT::i64 && Subtarget->is64Bit();
19444 bool X86TargetLowering::isZExtFree(SDValue Val, EVT VT2) const {
19445 EVT VT1 = Val.getValueType();
19446 if (isZExtFree(VT1, VT2))
19449 if (Val.getOpcode() != ISD::LOAD)
19452 if (!VT1.isSimple() || !VT1.isInteger() ||
19453 !VT2.isSimple() || !VT2.isInteger())
19456 switch (VT1.getSimpleVT().SimpleTy) {
19461 // X86 has 8, 16, and 32-bit zero-extending loads.
19469 X86TargetLowering::isFMAFasterThanFMulAndFAdd(EVT VT) const {
19470 if (!(Subtarget->hasFMA() || Subtarget->hasFMA4()))
19473 VT = VT.getScalarType();
19475 if (!VT.isSimple())
19478 switch (VT.getSimpleVT().SimpleTy) {
19489 bool X86TargetLowering::isNarrowingProfitable(EVT VT1, EVT VT2) const {
19490 // i16 instructions are longer (0x66 prefix) and potentially slower.
19491 return !(VT1 == MVT::i32 && VT2 == MVT::i16);
19494 /// isShuffleMaskLegal - Targets can use this to indicate that they only
19495 /// support *some* VECTOR_SHUFFLE operations, those with specific masks.
19496 /// By default, if a target supports the VECTOR_SHUFFLE node, all mask values
19497 /// are assumed to be legal.
19499 X86TargetLowering::isShuffleMaskLegal(const SmallVectorImpl<int> &M,
19501 if (!VT.isSimple())
19504 MVT SVT = VT.getSimpleVT();
19506 // Very little shuffling can be done for 64-bit vectors right now.
19507 if (VT.getSizeInBits() == 64)
19510 // If this is a single-input shuffle with no 128 bit lane crossings we can
19511 // lower it into pshufb.
19512 if ((SVT.is128BitVector() && Subtarget->hasSSSE3()) ||
19513 (SVT.is256BitVector() && Subtarget->hasInt256())) {
19514 bool isLegal = true;
19515 for (unsigned I = 0, E = M.size(); I != E; ++I) {
19516 if (M[I] >= (int)SVT.getVectorNumElements() ||
19517 ShuffleCrosses128bitLane(SVT, I, M[I])) {
19526 // FIXME: blends, shifts.
19527 return (SVT.getVectorNumElements() == 2 ||
19528 ShuffleVectorSDNode::isSplatMask(&M[0], VT) ||
19529 isMOVLMask(M, SVT) ||
19530 isMOVHLPSMask(M, SVT) ||
19531 isSHUFPMask(M, SVT) ||
19532 isPSHUFDMask(M, SVT) ||
19533 isPSHUFHWMask(M, SVT, Subtarget->hasInt256()) ||
19534 isPSHUFLWMask(M, SVT, Subtarget->hasInt256()) ||
19535 isPALIGNRMask(M, SVT, Subtarget) ||
19536 isUNPCKLMask(M, SVT, Subtarget->hasInt256()) ||
19537 isUNPCKHMask(M, SVT, Subtarget->hasInt256()) ||
19538 isUNPCKL_v_undef_Mask(M, SVT, Subtarget->hasInt256()) ||
19539 isUNPCKH_v_undef_Mask(M, SVT, Subtarget->hasInt256()) ||
19540 isBlendMask(M, SVT, Subtarget->hasSSE41(), Subtarget->hasInt256()) ||
19541 (Subtarget->hasSSE41() && isINSERTPSMask(M, SVT)));
19545 X86TargetLowering::isVectorClearMaskLegal(const SmallVectorImpl<int> &Mask,
19547 if (!VT.isSimple())
19550 MVT SVT = VT.getSimpleVT();
19551 unsigned NumElts = SVT.getVectorNumElements();
19552 // FIXME: This collection of masks seems suspect.
19555 if (NumElts == 4 && SVT.is128BitVector()) {
19556 return (isMOVLMask(Mask, SVT) ||
19557 isCommutedMOVLMask(Mask, SVT, true) ||
19558 isSHUFPMask(Mask, SVT) ||
19559 isSHUFPMask(Mask, SVT, /* Commuted */ true) ||
19560 isBlendMask(Mask, SVT, Subtarget->hasSSE41(),
19561 Subtarget->hasInt256()));
19566 //===----------------------------------------------------------------------===//
19567 // X86 Scheduler Hooks
19568 //===----------------------------------------------------------------------===//
19570 /// Utility function to emit xbegin specifying the start of an RTM region.
19571 static MachineBasicBlock *EmitXBegin(MachineInstr *MI, MachineBasicBlock *MBB,
19572 const TargetInstrInfo *TII) {
19573 DebugLoc DL = MI->getDebugLoc();
19575 const BasicBlock *BB = MBB->getBasicBlock();
19576 MachineFunction::iterator I = MBB;
19579 // For the v = xbegin(), we generate
19590 MachineBasicBlock *thisMBB = MBB;
19591 MachineFunction *MF = MBB->getParent();
19592 MachineBasicBlock *mainMBB = MF->CreateMachineBasicBlock(BB);
19593 MachineBasicBlock *sinkMBB = MF->CreateMachineBasicBlock(BB);
19594 MF->insert(I, mainMBB);
19595 MF->insert(I, sinkMBB);
19597 // Transfer the remainder of BB and its successor edges to sinkMBB.
19598 sinkMBB->splice(sinkMBB->begin(), MBB,
19599 std::next(MachineBasicBlock::iterator(MI)), MBB->end());
19600 sinkMBB->transferSuccessorsAndUpdatePHIs(MBB);
19604 // # fallthrough to mainMBB
19605 // # abortion to sinkMBB
19606 BuildMI(thisMBB, DL, TII->get(X86::XBEGIN_4)).addMBB(sinkMBB);
19607 thisMBB->addSuccessor(mainMBB);
19608 thisMBB->addSuccessor(sinkMBB);
19612 BuildMI(mainMBB, DL, TII->get(X86::MOV32ri), X86::EAX).addImm(-1);
19613 mainMBB->addSuccessor(sinkMBB);
19616 // EAX is live into the sinkMBB
19617 sinkMBB->addLiveIn(X86::EAX);
19618 BuildMI(*sinkMBB, sinkMBB->begin(), DL,
19619 TII->get(TargetOpcode::COPY), MI->getOperand(0).getReg())
19622 MI->eraseFromParent();
19626 // FIXME: When we get size specific XMM0 registers, i.e. XMM0_V16I8
19627 // or XMM0_V32I8 in AVX all of this code can be replaced with that
19628 // in the .td file.
19629 static MachineBasicBlock *EmitPCMPSTRM(MachineInstr *MI, MachineBasicBlock *BB,
19630 const TargetInstrInfo *TII) {
19632 switch (MI->getOpcode()) {
19633 default: llvm_unreachable("illegal opcode!");
19634 case X86::PCMPISTRM128REG: Opc = X86::PCMPISTRM128rr; break;
19635 case X86::VPCMPISTRM128REG: Opc = X86::VPCMPISTRM128rr; break;
19636 case X86::PCMPISTRM128MEM: Opc = X86::PCMPISTRM128rm; break;
19637 case X86::VPCMPISTRM128MEM: Opc = X86::VPCMPISTRM128rm; break;
19638 case X86::PCMPESTRM128REG: Opc = X86::PCMPESTRM128rr; break;
19639 case X86::VPCMPESTRM128REG: Opc = X86::VPCMPESTRM128rr; break;
19640 case X86::PCMPESTRM128MEM: Opc = X86::PCMPESTRM128rm; break;
19641 case X86::VPCMPESTRM128MEM: Opc = X86::VPCMPESTRM128rm; break;
19644 DebugLoc dl = MI->getDebugLoc();
19645 MachineInstrBuilder MIB = BuildMI(*BB, MI, dl, TII->get(Opc));
19647 unsigned NumArgs = MI->getNumOperands();
19648 for (unsigned i = 1; i < NumArgs; ++i) {
19649 MachineOperand &Op = MI->getOperand(i);
19650 if (!(Op.isReg() && Op.isImplicit()))
19651 MIB.addOperand(Op);
19653 if (MI->hasOneMemOperand())
19654 MIB->setMemRefs(MI->memoperands_begin(), MI->memoperands_end());
19656 BuildMI(*BB, MI, dl,
19657 TII->get(TargetOpcode::COPY), MI->getOperand(0).getReg())
19658 .addReg(X86::XMM0);
19660 MI->eraseFromParent();
19664 // FIXME: Custom handling because TableGen doesn't support multiple implicit
19665 // defs in an instruction pattern
19666 static MachineBasicBlock *EmitPCMPSTRI(MachineInstr *MI, MachineBasicBlock *BB,
19667 const TargetInstrInfo *TII) {
19669 switch (MI->getOpcode()) {
19670 default: llvm_unreachable("illegal opcode!");
19671 case X86::PCMPISTRIREG: Opc = X86::PCMPISTRIrr; break;
19672 case X86::VPCMPISTRIREG: Opc = X86::VPCMPISTRIrr; break;
19673 case X86::PCMPISTRIMEM: Opc = X86::PCMPISTRIrm; break;
19674 case X86::VPCMPISTRIMEM: Opc = X86::VPCMPISTRIrm; break;
19675 case X86::PCMPESTRIREG: Opc = X86::PCMPESTRIrr; break;
19676 case X86::VPCMPESTRIREG: Opc = X86::VPCMPESTRIrr; break;
19677 case X86::PCMPESTRIMEM: Opc = X86::PCMPESTRIrm; break;
19678 case X86::VPCMPESTRIMEM: Opc = X86::VPCMPESTRIrm; break;
19681 DebugLoc dl = MI->getDebugLoc();
19682 MachineInstrBuilder MIB = BuildMI(*BB, MI, dl, TII->get(Opc));
19684 unsigned NumArgs = MI->getNumOperands(); // remove the results
19685 for (unsigned i = 1; i < NumArgs; ++i) {
19686 MachineOperand &Op = MI->getOperand(i);
19687 if (!(Op.isReg() && Op.isImplicit()))
19688 MIB.addOperand(Op);
19690 if (MI->hasOneMemOperand())
19691 MIB->setMemRefs(MI->memoperands_begin(), MI->memoperands_end());
19693 BuildMI(*BB, MI, dl,
19694 TII->get(TargetOpcode::COPY), MI->getOperand(0).getReg())
19697 MI->eraseFromParent();
19701 static MachineBasicBlock * EmitMonitor(MachineInstr *MI, MachineBasicBlock *BB,
19702 const TargetInstrInfo *TII,
19703 const X86Subtarget* Subtarget) {
19704 DebugLoc dl = MI->getDebugLoc();
19706 // Address into RAX/EAX, other two args into ECX, EDX.
19707 unsigned MemOpc = Subtarget->is64Bit() ? X86::LEA64r : X86::LEA32r;
19708 unsigned MemReg = Subtarget->is64Bit() ? X86::RAX : X86::EAX;
19709 MachineInstrBuilder MIB = BuildMI(*BB, MI, dl, TII->get(MemOpc), MemReg);
19710 for (int i = 0; i < X86::AddrNumOperands; ++i)
19711 MIB.addOperand(MI->getOperand(i));
19713 unsigned ValOps = X86::AddrNumOperands;
19714 BuildMI(*BB, MI, dl, TII->get(TargetOpcode::COPY), X86::ECX)
19715 .addReg(MI->getOperand(ValOps).getReg());
19716 BuildMI(*BB, MI, dl, TII->get(TargetOpcode::COPY), X86::EDX)
19717 .addReg(MI->getOperand(ValOps+1).getReg());
19719 // The instruction doesn't actually take any operands though.
19720 BuildMI(*BB, MI, dl, TII->get(X86::MONITORrrr));
19722 MI->eraseFromParent(); // The pseudo is gone now.
19726 MachineBasicBlock *
19727 X86TargetLowering::EmitVAARG64WithCustomInserter(
19729 MachineBasicBlock *MBB) const {
19730 // Emit va_arg instruction on X86-64.
19732 // Operands to this pseudo-instruction:
19733 // 0 ) Output : destination address (reg)
19734 // 1-5) Input : va_list address (addr, i64mem)
19735 // 6 ) ArgSize : Size (in bytes) of vararg type
19736 // 7 ) ArgMode : 0=overflow only, 1=use gp_offset, 2=use fp_offset
19737 // 8 ) Align : Alignment of type
19738 // 9 ) EFLAGS (implicit-def)
19740 assert(MI->getNumOperands() == 10 && "VAARG_64 should have 10 operands!");
19741 assert(X86::AddrNumOperands == 5 && "VAARG_64 assumes 5 address operands");
19743 unsigned DestReg = MI->getOperand(0).getReg();
19744 MachineOperand &Base = MI->getOperand(1);
19745 MachineOperand &Scale = MI->getOperand(2);
19746 MachineOperand &Index = MI->getOperand(3);
19747 MachineOperand &Disp = MI->getOperand(4);
19748 MachineOperand &Segment = MI->getOperand(5);
19749 unsigned ArgSize = MI->getOperand(6).getImm();
19750 unsigned ArgMode = MI->getOperand(7).getImm();
19751 unsigned Align = MI->getOperand(8).getImm();
19753 // Memory Reference
19754 assert(MI->hasOneMemOperand() && "Expected VAARG_64 to have one memoperand");
19755 MachineInstr::mmo_iterator MMOBegin = MI->memoperands_begin();
19756 MachineInstr::mmo_iterator MMOEnd = MI->memoperands_end();
19758 // Machine Information
19759 const TargetInstrInfo *TII = MBB->getParent()->getSubtarget().getInstrInfo();
19760 MachineRegisterInfo &MRI = MBB->getParent()->getRegInfo();
19761 const TargetRegisterClass *AddrRegClass = getRegClassFor(MVT::i64);
19762 const TargetRegisterClass *OffsetRegClass = getRegClassFor(MVT::i32);
19763 DebugLoc DL = MI->getDebugLoc();
19765 // struct va_list {
19768 // i64 overflow_area (address)
19769 // i64 reg_save_area (address)
19771 // sizeof(va_list) = 24
19772 // alignment(va_list) = 8
19774 unsigned TotalNumIntRegs = 6;
19775 unsigned TotalNumXMMRegs = 8;
19776 bool UseGPOffset = (ArgMode == 1);
19777 bool UseFPOffset = (ArgMode == 2);
19778 unsigned MaxOffset = TotalNumIntRegs * 8 +
19779 (UseFPOffset ? TotalNumXMMRegs * 16 : 0);
19781 /* Align ArgSize to a multiple of 8 */
19782 unsigned ArgSizeA8 = (ArgSize + 7) & ~7;
19783 bool NeedsAlign = (Align > 8);
19785 MachineBasicBlock *thisMBB = MBB;
19786 MachineBasicBlock *overflowMBB;
19787 MachineBasicBlock *offsetMBB;
19788 MachineBasicBlock *endMBB;
19790 unsigned OffsetDestReg = 0; // Argument address computed by offsetMBB
19791 unsigned OverflowDestReg = 0; // Argument address computed by overflowMBB
19792 unsigned OffsetReg = 0;
19794 if (!UseGPOffset && !UseFPOffset) {
19795 // If we only pull from the overflow region, we don't create a branch.
19796 // We don't need to alter control flow.
19797 OffsetDestReg = 0; // unused
19798 OverflowDestReg = DestReg;
19800 offsetMBB = nullptr;
19801 overflowMBB = thisMBB;
19804 // First emit code to check if gp_offset (or fp_offset) is below the bound.
19805 // If so, pull the argument from reg_save_area. (branch to offsetMBB)
19806 // If not, pull from overflow_area. (branch to overflowMBB)
19811 // offsetMBB overflowMBB
19816 // Registers for the PHI in endMBB
19817 OffsetDestReg = MRI.createVirtualRegister(AddrRegClass);
19818 OverflowDestReg = MRI.createVirtualRegister(AddrRegClass);
19820 const BasicBlock *LLVM_BB = MBB->getBasicBlock();
19821 MachineFunction *MF = MBB->getParent();
19822 overflowMBB = MF->CreateMachineBasicBlock(LLVM_BB);
19823 offsetMBB = MF->CreateMachineBasicBlock(LLVM_BB);
19824 endMBB = MF->CreateMachineBasicBlock(LLVM_BB);
19826 MachineFunction::iterator MBBIter = MBB;
19829 // Insert the new basic blocks
19830 MF->insert(MBBIter, offsetMBB);
19831 MF->insert(MBBIter, overflowMBB);
19832 MF->insert(MBBIter, endMBB);
19834 // Transfer the remainder of MBB and its successor edges to endMBB.
19835 endMBB->splice(endMBB->begin(), thisMBB,
19836 std::next(MachineBasicBlock::iterator(MI)), thisMBB->end());
19837 endMBB->transferSuccessorsAndUpdatePHIs(thisMBB);
19839 // Make offsetMBB and overflowMBB successors of thisMBB
19840 thisMBB->addSuccessor(offsetMBB);
19841 thisMBB->addSuccessor(overflowMBB);
19843 // endMBB is a successor of both offsetMBB and overflowMBB
19844 offsetMBB->addSuccessor(endMBB);
19845 overflowMBB->addSuccessor(endMBB);
19847 // Load the offset value into a register
19848 OffsetReg = MRI.createVirtualRegister(OffsetRegClass);
19849 BuildMI(thisMBB, DL, TII->get(X86::MOV32rm), OffsetReg)
19853 .addDisp(Disp, UseFPOffset ? 4 : 0)
19854 .addOperand(Segment)
19855 .setMemRefs(MMOBegin, MMOEnd);
19857 // Check if there is enough room left to pull this argument.
19858 BuildMI(thisMBB, DL, TII->get(X86::CMP32ri))
19860 .addImm(MaxOffset + 8 - ArgSizeA8);
19862 // Branch to "overflowMBB" if offset >= max
19863 // Fall through to "offsetMBB" otherwise
19864 BuildMI(thisMBB, DL, TII->get(X86::GetCondBranchFromCond(X86::COND_AE)))
19865 .addMBB(overflowMBB);
19868 // In offsetMBB, emit code to use the reg_save_area.
19870 assert(OffsetReg != 0);
19872 // Read the reg_save_area address.
19873 unsigned RegSaveReg = MRI.createVirtualRegister(AddrRegClass);
19874 BuildMI(offsetMBB, DL, TII->get(X86::MOV64rm), RegSaveReg)
19879 .addOperand(Segment)
19880 .setMemRefs(MMOBegin, MMOEnd);
19882 // Zero-extend the offset
19883 unsigned OffsetReg64 = MRI.createVirtualRegister(AddrRegClass);
19884 BuildMI(offsetMBB, DL, TII->get(X86::SUBREG_TO_REG), OffsetReg64)
19887 .addImm(X86::sub_32bit);
19889 // Add the offset to the reg_save_area to get the final address.
19890 BuildMI(offsetMBB, DL, TII->get(X86::ADD64rr), OffsetDestReg)
19891 .addReg(OffsetReg64)
19892 .addReg(RegSaveReg);
19894 // Compute the offset for the next argument
19895 unsigned NextOffsetReg = MRI.createVirtualRegister(OffsetRegClass);
19896 BuildMI(offsetMBB, DL, TII->get(X86::ADD32ri), NextOffsetReg)
19898 .addImm(UseFPOffset ? 16 : 8);
19900 // Store it back into the va_list.
19901 BuildMI(offsetMBB, DL, TII->get(X86::MOV32mr))
19905 .addDisp(Disp, UseFPOffset ? 4 : 0)
19906 .addOperand(Segment)
19907 .addReg(NextOffsetReg)
19908 .setMemRefs(MMOBegin, MMOEnd);
19911 BuildMI(offsetMBB, DL, TII->get(X86::JMP_4))
19916 // Emit code to use overflow area
19919 // Load the overflow_area address into a register.
19920 unsigned OverflowAddrReg = MRI.createVirtualRegister(AddrRegClass);
19921 BuildMI(overflowMBB, DL, TII->get(X86::MOV64rm), OverflowAddrReg)
19926 .addOperand(Segment)
19927 .setMemRefs(MMOBegin, MMOEnd);
19929 // If we need to align it, do so. Otherwise, just copy the address
19930 // to OverflowDestReg.
19932 // Align the overflow address
19933 assert((Align & (Align-1)) == 0 && "Alignment must be a power of 2");
19934 unsigned TmpReg = MRI.createVirtualRegister(AddrRegClass);
19936 // aligned_addr = (addr + (align-1)) & ~(align-1)
19937 BuildMI(overflowMBB, DL, TII->get(X86::ADD64ri32), TmpReg)
19938 .addReg(OverflowAddrReg)
19941 BuildMI(overflowMBB, DL, TII->get(X86::AND64ri32), OverflowDestReg)
19943 .addImm(~(uint64_t)(Align-1));
19945 BuildMI(overflowMBB, DL, TII->get(TargetOpcode::COPY), OverflowDestReg)
19946 .addReg(OverflowAddrReg);
19949 // Compute the next overflow address after this argument.
19950 // (the overflow address should be kept 8-byte aligned)
19951 unsigned NextAddrReg = MRI.createVirtualRegister(AddrRegClass);
19952 BuildMI(overflowMBB, DL, TII->get(X86::ADD64ri32), NextAddrReg)
19953 .addReg(OverflowDestReg)
19954 .addImm(ArgSizeA8);
19956 // Store the new overflow address.
19957 BuildMI(overflowMBB, DL, TII->get(X86::MOV64mr))
19962 .addOperand(Segment)
19963 .addReg(NextAddrReg)
19964 .setMemRefs(MMOBegin, MMOEnd);
19966 // If we branched, emit the PHI to the front of endMBB.
19968 BuildMI(*endMBB, endMBB->begin(), DL,
19969 TII->get(X86::PHI), DestReg)
19970 .addReg(OffsetDestReg).addMBB(offsetMBB)
19971 .addReg(OverflowDestReg).addMBB(overflowMBB);
19974 // Erase the pseudo instruction
19975 MI->eraseFromParent();
19980 MachineBasicBlock *
19981 X86TargetLowering::EmitVAStartSaveXMMRegsWithCustomInserter(
19983 MachineBasicBlock *MBB) const {
19984 // Emit code to save XMM registers to the stack. The ABI says that the
19985 // number of registers to save is given in %al, so it's theoretically
19986 // possible to do an indirect jump trick to avoid saving all of them,
19987 // however this code takes a simpler approach and just executes all
19988 // of the stores if %al is non-zero. It's less code, and it's probably
19989 // easier on the hardware branch predictor, and stores aren't all that
19990 // expensive anyway.
19992 // Create the new basic blocks. One block contains all the XMM stores,
19993 // and one block is the final destination regardless of whether any
19994 // stores were performed.
19995 const BasicBlock *LLVM_BB = MBB->getBasicBlock();
19996 MachineFunction *F = MBB->getParent();
19997 MachineFunction::iterator MBBIter = MBB;
19999 MachineBasicBlock *XMMSaveMBB = F->CreateMachineBasicBlock(LLVM_BB);
20000 MachineBasicBlock *EndMBB = F->CreateMachineBasicBlock(LLVM_BB);
20001 F->insert(MBBIter, XMMSaveMBB);
20002 F->insert(MBBIter, EndMBB);
20004 // Transfer the remainder of MBB and its successor edges to EndMBB.
20005 EndMBB->splice(EndMBB->begin(), MBB,
20006 std::next(MachineBasicBlock::iterator(MI)), MBB->end());
20007 EndMBB->transferSuccessorsAndUpdatePHIs(MBB);
20009 // The original block will now fall through to the XMM save block.
20010 MBB->addSuccessor(XMMSaveMBB);
20011 // The XMMSaveMBB will fall through to the end block.
20012 XMMSaveMBB->addSuccessor(EndMBB);
20014 // Now add the instructions.
20015 const TargetInstrInfo *TII = MBB->getParent()->getSubtarget().getInstrInfo();
20016 DebugLoc DL = MI->getDebugLoc();
20018 unsigned CountReg = MI->getOperand(0).getReg();
20019 int64_t RegSaveFrameIndex = MI->getOperand(1).getImm();
20020 int64_t VarArgsFPOffset = MI->getOperand(2).getImm();
20022 if (!Subtarget->isTargetWin64()) {
20023 // If %al is 0, branch around the XMM save block.
20024 BuildMI(MBB, DL, TII->get(X86::TEST8rr)).addReg(CountReg).addReg(CountReg);
20025 BuildMI(MBB, DL, TII->get(X86::JE_4)).addMBB(EndMBB);
20026 MBB->addSuccessor(EndMBB);
20029 // Make sure the last operand is EFLAGS, which gets clobbered by the branch
20030 // that was just emitted, but clearly shouldn't be "saved".
20031 assert((MI->getNumOperands() <= 3 ||
20032 !MI->getOperand(MI->getNumOperands() - 1).isReg() ||
20033 MI->getOperand(MI->getNumOperands() - 1).getReg() == X86::EFLAGS)
20034 && "Expected last argument to be EFLAGS");
20035 unsigned MOVOpc = Subtarget->hasFp256() ? X86::VMOVAPSmr : X86::MOVAPSmr;
20036 // In the XMM save block, save all the XMM argument registers.
20037 for (int i = 3, e = MI->getNumOperands() - 1; i != e; ++i) {
20038 int64_t Offset = (i - 3) * 16 + VarArgsFPOffset;
20039 MachineMemOperand *MMO =
20040 F->getMachineMemOperand(
20041 MachinePointerInfo::getFixedStack(RegSaveFrameIndex, Offset),
20042 MachineMemOperand::MOStore,
20043 /*Size=*/16, /*Align=*/16);
20044 BuildMI(XMMSaveMBB, DL, TII->get(MOVOpc))
20045 .addFrameIndex(RegSaveFrameIndex)
20046 .addImm(/*Scale=*/1)
20047 .addReg(/*IndexReg=*/0)
20048 .addImm(/*Disp=*/Offset)
20049 .addReg(/*Segment=*/0)
20050 .addReg(MI->getOperand(i).getReg())
20051 .addMemOperand(MMO);
20054 MI->eraseFromParent(); // The pseudo instruction is gone now.
20059 // The EFLAGS operand of SelectItr might be missing a kill marker
20060 // because there were multiple uses of EFLAGS, and ISel didn't know
20061 // which to mark. Figure out whether SelectItr should have had a
20062 // kill marker, and set it if it should. Returns the correct kill
20064 static bool checkAndUpdateEFLAGSKill(MachineBasicBlock::iterator SelectItr,
20065 MachineBasicBlock* BB,
20066 const TargetRegisterInfo* TRI) {
20067 // Scan forward through BB for a use/def of EFLAGS.
20068 MachineBasicBlock::iterator miI(std::next(SelectItr));
20069 for (MachineBasicBlock::iterator miE = BB->end(); miI != miE; ++miI) {
20070 const MachineInstr& mi = *miI;
20071 if (mi.readsRegister(X86::EFLAGS))
20073 if (mi.definesRegister(X86::EFLAGS))
20074 break; // Should have kill-flag - update below.
20077 // If we hit the end of the block, check whether EFLAGS is live into a
20079 if (miI == BB->end()) {
20080 for (MachineBasicBlock::succ_iterator sItr = BB->succ_begin(),
20081 sEnd = BB->succ_end();
20082 sItr != sEnd; ++sItr) {
20083 MachineBasicBlock* succ = *sItr;
20084 if (succ->isLiveIn(X86::EFLAGS))
20089 // We found a def, or hit the end of the basic block and EFLAGS wasn't live
20090 // out. SelectMI should have a kill flag on EFLAGS.
20091 SelectItr->addRegisterKilled(X86::EFLAGS, TRI);
20095 MachineBasicBlock *
20096 X86TargetLowering::EmitLoweredSelect(MachineInstr *MI,
20097 MachineBasicBlock *BB) const {
20098 const TargetInstrInfo *TII = BB->getParent()->getSubtarget().getInstrInfo();
20099 DebugLoc DL = MI->getDebugLoc();
20101 // To "insert" a SELECT_CC instruction, we actually have to insert the
20102 // diamond control-flow pattern. The incoming instruction knows the
20103 // destination vreg to set, the condition code register to branch on, the
20104 // true/false values to select between, and a branch opcode to use.
20105 const BasicBlock *LLVM_BB = BB->getBasicBlock();
20106 MachineFunction::iterator It = BB;
20112 // cmpTY ccX, r1, r2
20114 // fallthrough --> copy0MBB
20115 MachineBasicBlock *thisMBB = BB;
20116 MachineFunction *F = BB->getParent();
20117 MachineBasicBlock *copy0MBB = F->CreateMachineBasicBlock(LLVM_BB);
20118 MachineBasicBlock *sinkMBB = F->CreateMachineBasicBlock(LLVM_BB);
20119 F->insert(It, copy0MBB);
20120 F->insert(It, sinkMBB);
20122 // If the EFLAGS register isn't dead in the terminator, then claim that it's
20123 // live into the sink and copy blocks.
20124 const TargetRegisterInfo *TRI =
20125 BB->getParent()->getSubtarget().getRegisterInfo();
20126 if (!MI->killsRegister(X86::EFLAGS) &&
20127 !checkAndUpdateEFLAGSKill(MI, BB, TRI)) {
20128 copy0MBB->addLiveIn(X86::EFLAGS);
20129 sinkMBB->addLiveIn(X86::EFLAGS);
20132 // Transfer the remainder of BB and its successor edges to sinkMBB.
20133 sinkMBB->splice(sinkMBB->begin(), BB,
20134 std::next(MachineBasicBlock::iterator(MI)), BB->end());
20135 sinkMBB->transferSuccessorsAndUpdatePHIs(BB);
20137 // Add the true and fallthrough blocks as its successors.
20138 BB->addSuccessor(copy0MBB);
20139 BB->addSuccessor(sinkMBB);
20141 // Create the conditional branch instruction.
20143 X86::GetCondBranchFromCond((X86::CondCode)MI->getOperand(3).getImm());
20144 BuildMI(BB, DL, TII->get(Opc)).addMBB(sinkMBB);
20147 // %FalseValue = ...
20148 // # fallthrough to sinkMBB
20149 copy0MBB->addSuccessor(sinkMBB);
20152 // %Result = phi [ %FalseValue, copy0MBB ], [ %TrueValue, thisMBB ]
20154 BuildMI(*sinkMBB, sinkMBB->begin(), DL,
20155 TII->get(X86::PHI), MI->getOperand(0).getReg())
20156 .addReg(MI->getOperand(1).getReg()).addMBB(copy0MBB)
20157 .addReg(MI->getOperand(2).getReg()).addMBB(thisMBB);
20159 MI->eraseFromParent(); // The pseudo instruction is gone now.
20163 MachineBasicBlock *
20164 X86TargetLowering::EmitLoweredSegAlloca(MachineInstr *MI,
20165 MachineBasicBlock *BB) const {
20166 MachineFunction *MF = BB->getParent();
20167 const TargetInstrInfo *TII = MF->getSubtarget().getInstrInfo();
20168 DebugLoc DL = MI->getDebugLoc();
20169 const BasicBlock *LLVM_BB = BB->getBasicBlock();
20171 assert(MF->shouldSplitStack());
20173 const bool Is64Bit = Subtarget->is64Bit();
20174 const bool IsLP64 = Subtarget->isTarget64BitLP64();
20176 const unsigned TlsReg = Is64Bit ? X86::FS : X86::GS;
20177 const unsigned TlsOffset = IsLP64 ? 0x70 : Is64Bit ? 0x40 : 0x30;
20180 // ... [Till the alloca]
20181 // If stacklet is not large enough, jump to mallocMBB
20184 // Allocate by subtracting from RSP
20185 // Jump to continueMBB
20188 // Allocate by call to runtime
20192 // [rest of original BB]
20195 MachineBasicBlock *mallocMBB = MF->CreateMachineBasicBlock(LLVM_BB);
20196 MachineBasicBlock *bumpMBB = MF->CreateMachineBasicBlock(LLVM_BB);
20197 MachineBasicBlock *continueMBB = MF->CreateMachineBasicBlock(LLVM_BB);
20199 MachineRegisterInfo &MRI = MF->getRegInfo();
20200 const TargetRegisterClass *AddrRegClass =
20201 getRegClassFor(getPointerTy());
20203 unsigned mallocPtrVReg = MRI.createVirtualRegister(AddrRegClass),
20204 bumpSPPtrVReg = MRI.createVirtualRegister(AddrRegClass),
20205 tmpSPVReg = MRI.createVirtualRegister(AddrRegClass),
20206 SPLimitVReg = MRI.createVirtualRegister(AddrRegClass),
20207 sizeVReg = MI->getOperand(1).getReg(),
20208 physSPReg = IsLP64 || Subtarget->isTargetNaCl64() ? X86::RSP : X86::ESP;
20210 MachineFunction::iterator MBBIter = BB;
20213 MF->insert(MBBIter, bumpMBB);
20214 MF->insert(MBBIter, mallocMBB);
20215 MF->insert(MBBIter, continueMBB);
20217 continueMBB->splice(continueMBB->begin(), BB,
20218 std::next(MachineBasicBlock::iterator(MI)), BB->end());
20219 continueMBB->transferSuccessorsAndUpdatePHIs(BB);
20221 // Add code to the main basic block to check if the stack limit has been hit,
20222 // and if so, jump to mallocMBB otherwise to bumpMBB.
20223 BuildMI(BB, DL, TII->get(TargetOpcode::COPY), tmpSPVReg).addReg(physSPReg);
20224 BuildMI(BB, DL, TII->get(IsLP64 ? X86::SUB64rr:X86::SUB32rr), SPLimitVReg)
20225 .addReg(tmpSPVReg).addReg(sizeVReg);
20226 BuildMI(BB, DL, TII->get(IsLP64 ? X86::CMP64mr:X86::CMP32mr))
20227 .addReg(0).addImm(1).addReg(0).addImm(TlsOffset).addReg(TlsReg)
20228 .addReg(SPLimitVReg);
20229 BuildMI(BB, DL, TII->get(X86::JG_4)).addMBB(mallocMBB);
20231 // bumpMBB simply decreases the stack pointer, since we know the current
20232 // stacklet has enough space.
20233 BuildMI(bumpMBB, DL, TII->get(TargetOpcode::COPY), physSPReg)
20234 .addReg(SPLimitVReg);
20235 BuildMI(bumpMBB, DL, TII->get(TargetOpcode::COPY), bumpSPPtrVReg)
20236 .addReg(SPLimitVReg);
20237 BuildMI(bumpMBB, DL, TII->get(X86::JMP_4)).addMBB(continueMBB);
20239 // Calls into a routine in libgcc to allocate more space from the heap.
20240 const uint32_t *RegMask = MF->getTarget()
20241 .getSubtargetImpl()
20242 ->getRegisterInfo()
20243 ->getCallPreservedMask(CallingConv::C);
20245 BuildMI(mallocMBB, DL, TII->get(X86::MOV64rr), X86::RDI)
20247 BuildMI(mallocMBB, DL, TII->get(X86::CALL64pcrel32))
20248 .addExternalSymbol("__morestack_allocate_stack_space")
20249 .addRegMask(RegMask)
20250 .addReg(X86::RDI, RegState::Implicit)
20251 .addReg(X86::RAX, RegState::ImplicitDefine);
20252 } else if (Is64Bit) {
20253 BuildMI(mallocMBB, DL, TII->get(X86::MOV32rr), X86::EDI)
20255 BuildMI(mallocMBB, DL, TII->get(X86::CALL64pcrel32))
20256 .addExternalSymbol("__morestack_allocate_stack_space")
20257 .addRegMask(RegMask)
20258 .addReg(X86::EDI, RegState::Implicit)
20259 .addReg(X86::EAX, RegState::ImplicitDefine);
20261 BuildMI(mallocMBB, DL, TII->get(X86::SUB32ri), physSPReg).addReg(physSPReg)
20263 BuildMI(mallocMBB, DL, TII->get(X86::PUSH32r)).addReg(sizeVReg);
20264 BuildMI(mallocMBB, DL, TII->get(X86::CALLpcrel32))
20265 .addExternalSymbol("__morestack_allocate_stack_space")
20266 .addRegMask(RegMask)
20267 .addReg(X86::EAX, RegState::ImplicitDefine);
20271 BuildMI(mallocMBB, DL, TII->get(X86::ADD32ri), physSPReg).addReg(physSPReg)
20274 BuildMI(mallocMBB, DL, TII->get(TargetOpcode::COPY), mallocPtrVReg)
20275 .addReg(IsLP64 ? X86::RAX : X86::EAX);
20276 BuildMI(mallocMBB, DL, TII->get(X86::JMP_4)).addMBB(continueMBB);
20278 // Set up the CFG correctly.
20279 BB->addSuccessor(bumpMBB);
20280 BB->addSuccessor(mallocMBB);
20281 mallocMBB->addSuccessor(continueMBB);
20282 bumpMBB->addSuccessor(continueMBB);
20284 // Take care of the PHI nodes.
20285 BuildMI(*continueMBB, continueMBB->begin(), DL, TII->get(X86::PHI),
20286 MI->getOperand(0).getReg())
20287 .addReg(mallocPtrVReg).addMBB(mallocMBB)
20288 .addReg(bumpSPPtrVReg).addMBB(bumpMBB);
20290 // Delete the original pseudo instruction.
20291 MI->eraseFromParent();
20294 return continueMBB;
20297 MachineBasicBlock *
20298 X86TargetLowering::EmitLoweredWinAlloca(MachineInstr *MI,
20299 MachineBasicBlock *BB) const {
20300 const TargetInstrInfo *TII = BB->getParent()->getSubtarget().getInstrInfo();
20301 DebugLoc DL = MI->getDebugLoc();
20303 assert(!Subtarget->isTargetMacho());
20305 // The lowering is pretty easy: we're just emitting the call to _alloca. The
20306 // non-trivial part is impdef of ESP.
20308 if (Subtarget->isTargetWin64()) {
20309 if (Subtarget->isTargetCygMing()) {
20310 // ___chkstk(Mingw64):
20311 // Clobbers R10, R11, RAX and EFLAGS.
20313 BuildMI(*BB, MI, DL, TII->get(X86::W64ALLOCA))
20314 .addExternalSymbol("___chkstk")
20315 .addReg(X86::RAX, RegState::Implicit)
20316 .addReg(X86::RSP, RegState::Implicit)
20317 .addReg(X86::RAX, RegState::Define | RegState::Implicit)
20318 .addReg(X86::RSP, RegState::Define | RegState::Implicit)
20319 .addReg(X86::EFLAGS, RegState::Define | RegState::Implicit);
20321 // __chkstk(MSVCRT): does not update stack pointer.
20322 // Clobbers R10, R11 and EFLAGS.
20323 BuildMI(*BB, MI, DL, TII->get(X86::W64ALLOCA))
20324 .addExternalSymbol("__chkstk")
20325 .addReg(X86::RAX, RegState::Implicit)
20326 .addReg(X86::EFLAGS, RegState::Define | RegState::Implicit);
20327 // RAX has the offset to be subtracted from RSP.
20328 BuildMI(*BB, MI, DL, TII->get(X86::SUB64rr), X86::RSP)
20333 const char *StackProbeSymbol =
20334 Subtarget->isTargetKnownWindowsMSVC() ? "_chkstk" : "_alloca";
20336 BuildMI(*BB, MI, DL, TII->get(X86::CALLpcrel32))
20337 .addExternalSymbol(StackProbeSymbol)
20338 .addReg(X86::EAX, RegState::Implicit)
20339 .addReg(X86::ESP, RegState::Implicit)
20340 .addReg(X86::EAX, RegState::Define | RegState::Implicit)
20341 .addReg(X86::ESP, RegState::Define | RegState::Implicit)
20342 .addReg(X86::EFLAGS, RegState::Define | RegState::Implicit);
20345 MI->eraseFromParent(); // The pseudo instruction is gone now.
20349 MachineBasicBlock *
20350 X86TargetLowering::EmitLoweredTLSCall(MachineInstr *MI,
20351 MachineBasicBlock *BB) const {
20352 // This is pretty easy. We're taking the value that we received from
20353 // our load from the relocation, sticking it in either RDI (x86-64)
20354 // or EAX and doing an indirect call. The return value will then
20355 // be in the normal return register.
20356 MachineFunction *F = BB->getParent();
20357 const X86InstrInfo *TII =
20358 static_cast<const X86InstrInfo *>(F->getSubtarget().getInstrInfo());
20359 DebugLoc DL = MI->getDebugLoc();
20361 assert(Subtarget->isTargetDarwin() && "Darwin only instr emitted?");
20362 assert(MI->getOperand(3).isGlobal() && "This should be a global");
20364 // Get a register mask for the lowered call.
20365 // FIXME: The 32-bit calls have non-standard calling conventions. Use a
20366 // proper register mask.
20367 const uint32_t *RegMask = F->getTarget()
20368 .getSubtargetImpl()
20369 ->getRegisterInfo()
20370 ->getCallPreservedMask(CallingConv::C);
20371 if (Subtarget->is64Bit()) {
20372 MachineInstrBuilder MIB = BuildMI(*BB, MI, DL,
20373 TII->get(X86::MOV64rm), X86::RDI)
20375 .addImm(0).addReg(0)
20376 .addGlobalAddress(MI->getOperand(3).getGlobal(), 0,
20377 MI->getOperand(3).getTargetFlags())
20379 MIB = BuildMI(*BB, MI, DL, TII->get(X86::CALL64m));
20380 addDirectMem(MIB, X86::RDI);
20381 MIB.addReg(X86::RAX, RegState::ImplicitDefine).addRegMask(RegMask);
20382 } else if (F->getTarget().getRelocationModel() != Reloc::PIC_) {
20383 MachineInstrBuilder MIB = BuildMI(*BB, MI, DL,
20384 TII->get(X86::MOV32rm), X86::EAX)
20386 .addImm(0).addReg(0)
20387 .addGlobalAddress(MI->getOperand(3).getGlobal(), 0,
20388 MI->getOperand(3).getTargetFlags())
20390 MIB = BuildMI(*BB, MI, DL, TII->get(X86::CALL32m));
20391 addDirectMem(MIB, X86::EAX);
20392 MIB.addReg(X86::EAX, RegState::ImplicitDefine).addRegMask(RegMask);
20394 MachineInstrBuilder MIB = BuildMI(*BB, MI, DL,
20395 TII->get(X86::MOV32rm), X86::EAX)
20396 .addReg(TII->getGlobalBaseReg(F))
20397 .addImm(0).addReg(0)
20398 .addGlobalAddress(MI->getOperand(3).getGlobal(), 0,
20399 MI->getOperand(3).getTargetFlags())
20401 MIB = BuildMI(*BB, MI, DL, TII->get(X86::CALL32m));
20402 addDirectMem(MIB, X86::EAX);
20403 MIB.addReg(X86::EAX, RegState::ImplicitDefine).addRegMask(RegMask);
20406 MI->eraseFromParent(); // The pseudo instruction is gone now.
20410 MachineBasicBlock *
20411 X86TargetLowering::emitEHSjLjSetJmp(MachineInstr *MI,
20412 MachineBasicBlock *MBB) const {
20413 DebugLoc DL = MI->getDebugLoc();
20414 MachineFunction *MF = MBB->getParent();
20415 const TargetInstrInfo *TII = MF->getSubtarget().getInstrInfo();
20416 MachineRegisterInfo &MRI = MF->getRegInfo();
20418 const BasicBlock *BB = MBB->getBasicBlock();
20419 MachineFunction::iterator I = MBB;
20422 // Memory Reference
20423 MachineInstr::mmo_iterator MMOBegin = MI->memoperands_begin();
20424 MachineInstr::mmo_iterator MMOEnd = MI->memoperands_end();
20427 unsigned MemOpndSlot = 0;
20429 unsigned CurOp = 0;
20431 DstReg = MI->getOperand(CurOp++).getReg();
20432 const TargetRegisterClass *RC = MRI.getRegClass(DstReg);
20433 assert(RC->hasType(MVT::i32) && "Invalid destination!");
20434 unsigned mainDstReg = MRI.createVirtualRegister(RC);
20435 unsigned restoreDstReg = MRI.createVirtualRegister(RC);
20437 MemOpndSlot = CurOp;
20439 MVT PVT = getPointerTy();
20440 assert((PVT == MVT::i64 || PVT == MVT::i32) &&
20441 "Invalid Pointer Size!");
20443 // For v = setjmp(buf), we generate
20446 // buf[LabelOffset] = restoreMBB
20447 // SjLjSetup restoreMBB
20453 // v = phi(main, restore)
20458 MachineBasicBlock *thisMBB = MBB;
20459 MachineBasicBlock *mainMBB = MF->CreateMachineBasicBlock(BB);
20460 MachineBasicBlock *sinkMBB = MF->CreateMachineBasicBlock(BB);
20461 MachineBasicBlock *restoreMBB = MF->CreateMachineBasicBlock(BB);
20462 MF->insert(I, mainMBB);
20463 MF->insert(I, sinkMBB);
20464 MF->push_back(restoreMBB);
20466 MachineInstrBuilder MIB;
20468 // Transfer the remainder of BB and its successor edges to sinkMBB.
20469 sinkMBB->splice(sinkMBB->begin(), MBB,
20470 std::next(MachineBasicBlock::iterator(MI)), MBB->end());
20471 sinkMBB->transferSuccessorsAndUpdatePHIs(MBB);
20474 unsigned PtrStoreOpc = 0;
20475 unsigned LabelReg = 0;
20476 const int64_t LabelOffset = 1 * PVT.getStoreSize();
20477 Reloc::Model RM = MF->getTarget().getRelocationModel();
20478 bool UseImmLabel = (MF->getTarget().getCodeModel() == CodeModel::Small) &&
20479 (RM == Reloc::Static || RM == Reloc::DynamicNoPIC);
20481 // Prepare IP either in reg or imm.
20482 if (!UseImmLabel) {
20483 PtrStoreOpc = (PVT == MVT::i64) ? X86::MOV64mr : X86::MOV32mr;
20484 const TargetRegisterClass *PtrRC = getRegClassFor(PVT);
20485 LabelReg = MRI.createVirtualRegister(PtrRC);
20486 if (Subtarget->is64Bit()) {
20487 MIB = BuildMI(*thisMBB, MI, DL, TII->get(X86::LEA64r), LabelReg)
20491 .addMBB(restoreMBB)
20494 const X86InstrInfo *XII = static_cast<const X86InstrInfo*>(TII);
20495 MIB = BuildMI(*thisMBB, MI, DL, TII->get(X86::LEA32r), LabelReg)
20496 .addReg(XII->getGlobalBaseReg(MF))
20499 .addMBB(restoreMBB, Subtarget->ClassifyBlockAddressReference())
20503 PtrStoreOpc = (PVT == MVT::i64) ? X86::MOV64mi32 : X86::MOV32mi;
20505 MIB = BuildMI(*thisMBB, MI, DL, TII->get(PtrStoreOpc));
20506 for (unsigned i = 0; i < X86::AddrNumOperands; ++i) {
20507 if (i == X86::AddrDisp)
20508 MIB.addDisp(MI->getOperand(MemOpndSlot + i), LabelOffset);
20510 MIB.addOperand(MI->getOperand(MemOpndSlot + i));
20513 MIB.addReg(LabelReg);
20515 MIB.addMBB(restoreMBB);
20516 MIB.setMemRefs(MMOBegin, MMOEnd);
20518 MIB = BuildMI(*thisMBB, MI, DL, TII->get(X86::EH_SjLj_Setup))
20519 .addMBB(restoreMBB);
20521 const X86RegisterInfo *RegInfo = static_cast<const X86RegisterInfo *>(
20522 MF->getSubtarget().getRegisterInfo());
20523 MIB.addRegMask(RegInfo->getNoPreservedMask());
20524 thisMBB->addSuccessor(mainMBB);
20525 thisMBB->addSuccessor(restoreMBB);
20529 BuildMI(mainMBB, DL, TII->get(X86::MOV32r0), mainDstReg);
20530 mainMBB->addSuccessor(sinkMBB);
20533 BuildMI(*sinkMBB, sinkMBB->begin(), DL,
20534 TII->get(X86::PHI), DstReg)
20535 .addReg(mainDstReg).addMBB(mainMBB)
20536 .addReg(restoreDstReg).addMBB(restoreMBB);
20539 BuildMI(restoreMBB, DL, TII->get(X86::MOV32ri), restoreDstReg).addImm(1);
20540 BuildMI(restoreMBB, DL, TII->get(X86::JMP_4)).addMBB(sinkMBB);
20541 restoreMBB->addSuccessor(sinkMBB);
20543 MI->eraseFromParent();
20547 MachineBasicBlock *
20548 X86TargetLowering::emitEHSjLjLongJmp(MachineInstr *MI,
20549 MachineBasicBlock *MBB) const {
20550 DebugLoc DL = MI->getDebugLoc();
20551 MachineFunction *MF = MBB->getParent();
20552 const TargetInstrInfo *TII = MF->getSubtarget().getInstrInfo();
20553 MachineRegisterInfo &MRI = MF->getRegInfo();
20555 // Memory Reference
20556 MachineInstr::mmo_iterator MMOBegin = MI->memoperands_begin();
20557 MachineInstr::mmo_iterator MMOEnd = MI->memoperands_end();
20559 MVT PVT = getPointerTy();
20560 assert((PVT == MVT::i64 || PVT == MVT::i32) &&
20561 "Invalid Pointer Size!");
20563 const TargetRegisterClass *RC =
20564 (PVT == MVT::i64) ? &X86::GR64RegClass : &X86::GR32RegClass;
20565 unsigned Tmp = MRI.createVirtualRegister(RC);
20566 // Since FP is only updated here but NOT referenced, it's treated as GPR.
20567 const X86RegisterInfo *RegInfo = static_cast<const X86RegisterInfo *>(
20568 MF->getSubtarget().getRegisterInfo());
20569 unsigned FP = (PVT == MVT::i64) ? X86::RBP : X86::EBP;
20570 unsigned SP = RegInfo->getStackRegister();
20572 MachineInstrBuilder MIB;
20574 const int64_t LabelOffset = 1 * PVT.getStoreSize();
20575 const int64_t SPOffset = 2 * PVT.getStoreSize();
20577 unsigned PtrLoadOpc = (PVT == MVT::i64) ? X86::MOV64rm : X86::MOV32rm;
20578 unsigned IJmpOpc = (PVT == MVT::i64) ? X86::JMP64r : X86::JMP32r;
20581 MIB = BuildMI(*MBB, MI, DL, TII->get(PtrLoadOpc), FP);
20582 for (unsigned i = 0; i < X86::AddrNumOperands; ++i)
20583 MIB.addOperand(MI->getOperand(i));
20584 MIB.setMemRefs(MMOBegin, MMOEnd);
20586 MIB = BuildMI(*MBB, MI, DL, TII->get(PtrLoadOpc), Tmp);
20587 for (unsigned i = 0; i < X86::AddrNumOperands; ++i) {
20588 if (i == X86::AddrDisp)
20589 MIB.addDisp(MI->getOperand(i), LabelOffset);
20591 MIB.addOperand(MI->getOperand(i));
20593 MIB.setMemRefs(MMOBegin, MMOEnd);
20595 MIB = BuildMI(*MBB, MI, DL, TII->get(PtrLoadOpc), SP);
20596 for (unsigned i = 0; i < X86::AddrNumOperands; ++i) {
20597 if (i == X86::AddrDisp)
20598 MIB.addDisp(MI->getOperand(i), SPOffset);
20600 MIB.addOperand(MI->getOperand(i));
20602 MIB.setMemRefs(MMOBegin, MMOEnd);
20604 BuildMI(*MBB, MI, DL, TII->get(IJmpOpc)).addReg(Tmp);
20606 MI->eraseFromParent();
20610 // Replace 213-type (isel default) FMA3 instructions with 231-type for
20611 // accumulator loops. Writing back to the accumulator allows the coalescer
20612 // to remove extra copies in the loop.
20613 MachineBasicBlock *
20614 X86TargetLowering::emitFMA3Instr(MachineInstr *MI,
20615 MachineBasicBlock *MBB) const {
20616 MachineOperand &AddendOp = MI->getOperand(3);
20618 // Bail out early if the addend isn't a register - we can't switch these.
20619 if (!AddendOp.isReg())
20622 MachineFunction &MF = *MBB->getParent();
20623 MachineRegisterInfo &MRI = MF.getRegInfo();
20625 // Check whether the addend is defined by a PHI:
20626 assert(MRI.hasOneDef(AddendOp.getReg()) && "Multiple defs in SSA?");
20627 MachineInstr &AddendDef = *MRI.def_instr_begin(AddendOp.getReg());
20628 if (!AddendDef.isPHI())
20631 // Look for the following pattern:
20633 // %addend = phi [%entry, 0], [%loop, %result]
20635 // %result<tied1> = FMA213 %m2<tied0>, %m1, %addend
20639 // %addend = phi [%entry, 0], [%loop, %result]
20641 // %result<tied1> = FMA231 %addend<tied0>, %m1, %m2
20643 for (unsigned i = 1, e = AddendDef.getNumOperands(); i < e; i += 2) {
20644 assert(AddendDef.getOperand(i).isReg());
20645 MachineOperand PHISrcOp = AddendDef.getOperand(i);
20646 MachineInstr &PHISrcInst = *MRI.def_instr_begin(PHISrcOp.getReg());
20647 if (&PHISrcInst == MI) {
20648 // Found a matching instruction.
20649 unsigned NewFMAOpc = 0;
20650 switch (MI->getOpcode()) {
20651 case X86::VFMADDPDr213r: NewFMAOpc = X86::VFMADDPDr231r; break;
20652 case X86::VFMADDPSr213r: NewFMAOpc = X86::VFMADDPSr231r; break;
20653 case X86::VFMADDSDr213r: NewFMAOpc = X86::VFMADDSDr231r; break;
20654 case X86::VFMADDSSr213r: NewFMAOpc = X86::VFMADDSSr231r; break;
20655 case X86::VFMSUBPDr213r: NewFMAOpc = X86::VFMSUBPDr231r; break;
20656 case X86::VFMSUBPSr213r: NewFMAOpc = X86::VFMSUBPSr231r; break;
20657 case X86::VFMSUBSDr213r: NewFMAOpc = X86::VFMSUBSDr231r; break;
20658 case X86::VFMSUBSSr213r: NewFMAOpc = X86::VFMSUBSSr231r; break;
20659 case X86::VFNMADDPDr213r: NewFMAOpc = X86::VFNMADDPDr231r; break;
20660 case X86::VFNMADDPSr213r: NewFMAOpc = X86::VFNMADDPSr231r; break;
20661 case X86::VFNMADDSDr213r: NewFMAOpc = X86::VFNMADDSDr231r; break;
20662 case X86::VFNMADDSSr213r: NewFMAOpc = X86::VFNMADDSSr231r; break;
20663 case X86::VFNMSUBPDr213r: NewFMAOpc = X86::VFNMSUBPDr231r; break;
20664 case X86::VFNMSUBPSr213r: NewFMAOpc = X86::VFNMSUBPSr231r; break;
20665 case X86::VFNMSUBSDr213r: NewFMAOpc = X86::VFNMSUBSDr231r; break;
20666 case X86::VFNMSUBSSr213r: NewFMAOpc = X86::VFNMSUBSSr231r; break;
20667 case X86::VFMADDSUBPDr213r: NewFMAOpc = X86::VFMADDSUBPDr231r; break;
20668 case X86::VFMADDSUBPSr213r: NewFMAOpc = X86::VFMADDSUBPSr231r; break;
20669 case X86::VFMSUBADDPDr213r: NewFMAOpc = X86::VFMSUBADDPDr231r; break;
20670 case X86::VFMSUBADDPSr213r: NewFMAOpc = X86::VFMSUBADDPSr231r; break;
20672 case X86::VFMADDPDr213rY: NewFMAOpc = X86::VFMADDPDr231rY; break;
20673 case X86::VFMADDPSr213rY: NewFMAOpc = X86::VFMADDPSr231rY; break;
20674 case X86::VFMSUBPDr213rY: NewFMAOpc = X86::VFMSUBPDr231rY; break;
20675 case X86::VFMSUBPSr213rY: NewFMAOpc = X86::VFMSUBPSr231rY; break;
20676 case X86::VFNMADDPDr213rY: NewFMAOpc = X86::VFNMADDPDr231rY; break;
20677 case X86::VFNMADDPSr213rY: NewFMAOpc = X86::VFNMADDPSr231rY; break;
20678 case X86::VFNMSUBPDr213rY: NewFMAOpc = X86::VFNMSUBPDr231rY; break;
20679 case X86::VFNMSUBPSr213rY: NewFMAOpc = X86::VFNMSUBPSr231rY; break;
20680 case X86::VFMADDSUBPDr213rY: NewFMAOpc = X86::VFMADDSUBPDr231rY; break;
20681 case X86::VFMADDSUBPSr213rY: NewFMAOpc = X86::VFMADDSUBPSr231rY; break;
20682 case X86::VFMSUBADDPDr213rY: NewFMAOpc = X86::VFMSUBADDPDr231rY; break;
20683 case X86::VFMSUBADDPSr213rY: NewFMAOpc = X86::VFMSUBADDPSr231rY; break;
20684 default: llvm_unreachable("Unrecognized FMA variant.");
20687 const TargetInstrInfo &TII = *MF.getSubtarget().getInstrInfo();
20688 MachineInstrBuilder MIB =
20689 BuildMI(MF, MI->getDebugLoc(), TII.get(NewFMAOpc))
20690 .addOperand(MI->getOperand(0))
20691 .addOperand(MI->getOperand(3))
20692 .addOperand(MI->getOperand(2))
20693 .addOperand(MI->getOperand(1));
20694 MBB->insert(MachineBasicBlock::iterator(MI), MIB);
20695 MI->eraseFromParent();
20702 MachineBasicBlock *
20703 X86TargetLowering::EmitInstrWithCustomInserter(MachineInstr *MI,
20704 MachineBasicBlock *BB) const {
20705 switch (MI->getOpcode()) {
20706 default: llvm_unreachable("Unexpected instr type to insert");
20707 case X86::TAILJMPd64:
20708 case X86::TAILJMPr64:
20709 case X86::TAILJMPm64:
20710 llvm_unreachable("TAILJMP64 would not be touched here.");
20711 case X86::TCRETURNdi64:
20712 case X86::TCRETURNri64:
20713 case X86::TCRETURNmi64:
20715 case X86::WIN_ALLOCA:
20716 return EmitLoweredWinAlloca(MI, BB);
20717 case X86::SEG_ALLOCA_32:
20718 case X86::SEG_ALLOCA_64:
20719 return EmitLoweredSegAlloca(MI, BB);
20720 case X86::TLSCall_32:
20721 case X86::TLSCall_64:
20722 return EmitLoweredTLSCall(MI, BB);
20723 case X86::CMOV_GR8:
20724 case X86::CMOV_FR32:
20725 case X86::CMOV_FR64:
20726 case X86::CMOV_V4F32:
20727 case X86::CMOV_V2F64:
20728 case X86::CMOV_V2I64:
20729 case X86::CMOV_V8F32:
20730 case X86::CMOV_V4F64:
20731 case X86::CMOV_V4I64:
20732 case X86::CMOV_V16F32:
20733 case X86::CMOV_V8F64:
20734 case X86::CMOV_V8I64:
20735 case X86::CMOV_GR16:
20736 case X86::CMOV_GR32:
20737 case X86::CMOV_RFP32:
20738 case X86::CMOV_RFP64:
20739 case X86::CMOV_RFP80:
20740 return EmitLoweredSelect(MI, BB);
20742 case X86::FP32_TO_INT16_IN_MEM:
20743 case X86::FP32_TO_INT32_IN_MEM:
20744 case X86::FP32_TO_INT64_IN_MEM:
20745 case X86::FP64_TO_INT16_IN_MEM:
20746 case X86::FP64_TO_INT32_IN_MEM:
20747 case X86::FP64_TO_INT64_IN_MEM:
20748 case X86::FP80_TO_INT16_IN_MEM:
20749 case X86::FP80_TO_INT32_IN_MEM:
20750 case X86::FP80_TO_INT64_IN_MEM: {
20751 MachineFunction *F = BB->getParent();
20752 const TargetInstrInfo *TII = F->getSubtarget().getInstrInfo();
20753 DebugLoc DL = MI->getDebugLoc();
20755 // Change the floating point control register to use "round towards zero"
20756 // mode when truncating to an integer value.
20757 int CWFrameIdx = F->getFrameInfo()->CreateStackObject(2, 2, false);
20758 addFrameReference(BuildMI(*BB, MI, DL,
20759 TII->get(X86::FNSTCW16m)), CWFrameIdx);
20761 // Load the old value of the high byte of the control word...
20763 F->getRegInfo().createVirtualRegister(&X86::GR16RegClass);
20764 addFrameReference(BuildMI(*BB, MI, DL, TII->get(X86::MOV16rm), OldCW),
20767 // Set the high part to be round to zero...
20768 addFrameReference(BuildMI(*BB, MI, DL, TII->get(X86::MOV16mi)), CWFrameIdx)
20771 // Reload the modified control word now...
20772 addFrameReference(BuildMI(*BB, MI, DL,
20773 TII->get(X86::FLDCW16m)), CWFrameIdx);
20775 // Restore the memory image of control word to original value
20776 addFrameReference(BuildMI(*BB, MI, DL, TII->get(X86::MOV16mr)), CWFrameIdx)
20779 // Get the X86 opcode to use.
20781 switch (MI->getOpcode()) {
20782 default: llvm_unreachable("illegal opcode!");
20783 case X86::FP32_TO_INT16_IN_MEM: Opc = X86::IST_Fp16m32; break;
20784 case X86::FP32_TO_INT32_IN_MEM: Opc = X86::IST_Fp32m32; break;
20785 case X86::FP32_TO_INT64_IN_MEM: Opc = X86::IST_Fp64m32; break;
20786 case X86::FP64_TO_INT16_IN_MEM: Opc = X86::IST_Fp16m64; break;
20787 case X86::FP64_TO_INT32_IN_MEM: Opc = X86::IST_Fp32m64; break;
20788 case X86::FP64_TO_INT64_IN_MEM: Opc = X86::IST_Fp64m64; break;
20789 case X86::FP80_TO_INT16_IN_MEM: Opc = X86::IST_Fp16m80; break;
20790 case X86::FP80_TO_INT32_IN_MEM: Opc = X86::IST_Fp32m80; break;
20791 case X86::FP80_TO_INT64_IN_MEM: Opc = X86::IST_Fp64m80; break;
20795 MachineOperand &Op = MI->getOperand(0);
20797 AM.BaseType = X86AddressMode::RegBase;
20798 AM.Base.Reg = Op.getReg();
20800 AM.BaseType = X86AddressMode::FrameIndexBase;
20801 AM.Base.FrameIndex = Op.getIndex();
20803 Op = MI->getOperand(1);
20805 AM.Scale = Op.getImm();
20806 Op = MI->getOperand(2);
20808 AM.IndexReg = Op.getImm();
20809 Op = MI->getOperand(3);
20810 if (Op.isGlobal()) {
20811 AM.GV = Op.getGlobal();
20813 AM.Disp = Op.getImm();
20815 addFullAddress(BuildMI(*BB, MI, DL, TII->get(Opc)), AM)
20816 .addReg(MI->getOperand(X86::AddrNumOperands).getReg());
20818 // Reload the original control word now.
20819 addFrameReference(BuildMI(*BB, MI, DL,
20820 TII->get(X86::FLDCW16m)), CWFrameIdx);
20822 MI->eraseFromParent(); // The pseudo instruction is gone now.
20825 // String/text processing lowering.
20826 case X86::PCMPISTRM128REG:
20827 case X86::VPCMPISTRM128REG:
20828 case X86::PCMPISTRM128MEM:
20829 case X86::VPCMPISTRM128MEM:
20830 case X86::PCMPESTRM128REG:
20831 case X86::VPCMPESTRM128REG:
20832 case X86::PCMPESTRM128MEM:
20833 case X86::VPCMPESTRM128MEM:
20834 assert(Subtarget->hasSSE42() &&
20835 "Target must have SSE4.2 or AVX features enabled");
20836 return EmitPCMPSTRM(MI, BB, BB->getParent()->getSubtarget().getInstrInfo());
20838 // String/text processing lowering.
20839 case X86::PCMPISTRIREG:
20840 case X86::VPCMPISTRIREG:
20841 case X86::PCMPISTRIMEM:
20842 case X86::VPCMPISTRIMEM:
20843 case X86::PCMPESTRIREG:
20844 case X86::VPCMPESTRIREG:
20845 case X86::PCMPESTRIMEM:
20846 case X86::VPCMPESTRIMEM:
20847 assert(Subtarget->hasSSE42() &&
20848 "Target must have SSE4.2 or AVX features enabled");
20849 return EmitPCMPSTRI(MI, BB, BB->getParent()->getSubtarget().getInstrInfo());
20851 // Thread synchronization.
20853 return EmitMonitor(MI, BB, BB->getParent()->getSubtarget().getInstrInfo(),
20858 return EmitXBegin(MI, BB, BB->getParent()->getSubtarget().getInstrInfo());
20860 case X86::VASTART_SAVE_XMM_REGS:
20861 return EmitVAStartSaveXMMRegsWithCustomInserter(MI, BB);
20863 case X86::VAARG_64:
20864 return EmitVAARG64WithCustomInserter(MI, BB);
20866 case X86::EH_SjLj_SetJmp32:
20867 case X86::EH_SjLj_SetJmp64:
20868 return emitEHSjLjSetJmp(MI, BB);
20870 case X86::EH_SjLj_LongJmp32:
20871 case X86::EH_SjLj_LongJmp64:
20872 return emitEHSjLjLongJmp(MI, BB);
20874 case TargetOpcode::STACKMAP:
20875 case TargetOpcode::PATCHPOINT:
20876 return emitPatchPoint(MI, BB);
20878 case X86::VFMADDPDr213r:
20879 case X86::VFMADDPSr213r:
20880 case X86::VFMADDSDr213r:
20881 case X86::VFMADDSSr213r:
20882 case X86::VFMSUBPDr213r:
20883 case X86::VFMSUBPSr213r:
20884 case X86::VFMSUBSDr213r:
20885 case X86::VFMSUBSSr213r:
20886 case X86::VFNMADDPDr213r:
20887 case X86::VFNMADDPSr213r:
20888 case X86::VFNMADDSDr213r:
20889 case X86::VFNMADDSSr213r:
20890 case X86::VFNMSUBPDr213r:
20891 case X86::VFNMSUBPSr213r:
20892 case X86::VFNMSUBSDr213r:
20893 case X86::VFNMSUBSSr213r:
20894 case X86::VFMADDSUBPDr213r:
20895 case X86::VFMADDSUBPSr213r:
20896 case X86::VFMSUBADDPDr213r:
20897 case X86::VFMSUBADDPSr213r:
20898 case X86::VFMADDPDr213rY:
20899 case X86::VFMADDPSr213rY:
20900 case X86::VFMSUBPDr213rY:
20901 case X86::VFMSUBPSr213rY:
20902 case X86::VFNMADDPDr213rY:
20903 case X86::VFNMADDPSr213rY:
20904 case X86::VFNMSUBPDr213rY:
20905 case X86::VFNMSUBPSr213rY:
20906 case X86::VFMADDSUBPDr213rY:
20907 case X86::VFMADDSUBPSr213rY:
20908 case X86::VFMSUBADDPDr213rY:
20909 case X86::VFMSUBADDPSr213rY:
20910 return emitFMA3Instr(MI, BB);
20914 //===----------------------------------------------------------------------===//
20915 // X86 Optimization Hooks
20916 //===----------------------------------------------------------------------===//
20918 void X86TargetLowering::computeKnownBitsForTargetNode(const SDValue Op,
20921 const SelectionDAG &DAG,
20922 unsigned Depth) const {
20923 unsigned BitWidth = KnownZero.getBitWidth();
20924 unsigned Opc = Op.getOpcode();
20925 assert((Opc >= ISD::BUILTIN_OP_END ||
20926 Opc == ISD::INTRINSIC_WO_CHAIN ||
20927 Opc == ISD::INTRINSIC_W_CHAIN ||
20928 Opc == ISD::INTRINSIC_VOID) &&
20929 "Should use MaskedValueIsZero if you don't know whether Op"
20930 " is a target node!");
20932 KnownZero = KnownOne = APInt(BitWidth, 0); // Don't know anything.
20946 // These nodes' second result is a boolean.
20947 if (Op.getResNo() == 0)
20950 case X86ISD::SETCC:
20951 KnownZero |= APInt::getHighBitsSet(BitWidth, BitWidth - 1);
20953 case ISD::INTRINSIC_WO_CHAIN: {
20954 unsigned IntId = cast<ConstantSDNode>(Op.getOperand(0))->getZExtValue();
20955 unsigned NumLoBits = 0;
20958 case Intrinsic::x86_sse_movmsk_ps:
20959 case Intrinsic::x86_avx_movmsk_ps_256:
20960 case Intrinsic::x86_sse2_movmsk_pd:
20961 case Intrinsic::x86_avx_movmsk_pd_256:
20962 case Intrinsic::x86_mmx_pmovmskb:
20963 case Intrinsic::x86_sse2_pmovmskb_128:
20964 case Intrinsic::x86_avx2_pmovmskb: {
20965 // High bits of movmskp{s|d}, pmovmskb are known zero.
20967 default: llvm_unreachable("Impossible intrinsic"); // Can't reach here.
20968 case Intrinsic::x86_sse_movmsk_ps: NumLoBits = 4; break;
20969 case Intrinsic::x86_avx_movmsk_ps_256: NumLoBits = 8; break;
20970 case Intrinsic::x86_sse2_movmsk_pd: NumLoBits = 2; break;
20971 case Intrinsic::x86_avx_movmsk_pd_256: NumLoBits = 4; break;
20972 case Intrinsic::x86_mmx_pmovmskb: NumLoBits = 8; break;
20973 case Intrinsic::x86_sse2_pmovmskb_128: NumLoBits = 16; break;
20974 case Intrinsic::x86_avx2_pmovmskb: NumLoBits = 32; break;
20976 KnownZero = APInt::getHighBitsSet(BitWidth, BitWidth - NumLoBits);
20985 unsigned X86TargetLowering::ComputeNumSignBitsForTargetNode(
20987 const SelectionDAG &,
20988 unsigned Depth) const {
20989 // SETCC_CARRY sets the dest to ~0 for true or 0 for false.
20990 if (Op.getOpcode() == X86ISD::SETCC_CARRY)
20991 return Op.getValueType().getScalarType().getSizeInBits();
20997 /// isGAPlusOffset - Returns true (and the GlobalValue and the offset) if the
20998 /// node is a GlobalAddress + offset.
20999 bool X86TargetLowering::isGAPlusOffset(SDNode *N,
21000 const GlobalValue* &GA,
21001 int64_t &Offset) const {
21002 if (N->getOpcode() == X86ISD::Wrapper) {
21003 if (isa<GlobalAddressSDNode>(N->getOperand(0))) {
21004 GA = cast<GlobalAddressSDNode>(N->getOperand(0))->getGlobal();
21005 Offset = cast<GlobalAddressSDNode>(N->getOperand(0))->getOffset();
21009 return TargetLowering::isGAPlusOffset(N, GA, Offset);
21012 /// isShuffleHigh128VectorInsertLow - Checks whether the shuffle node is the
21013 /// same as extracting the high 128-bit part of 256-bit vector and then
21014 /// inserting the result into the low part of a new 256-bit vector
21015 static bool isShuffleHigh128VectorInsertLow(ShuffleVectorSDNode *SVOp) {
21016 EVT VT = SVOp->getValueType(0);
21017 unsigned NumElems = VT.getVectorNumElements();
21019 // vector_shuffle <4, 5, 6, 7, u, u, u, u> or <2, 3, u, u>
21020 for (unsigned i = 0, j = NumElems/2; i != NumElems/2; ++i, ++j)
21021 if (!isUndefOrEqual(SVOp->getMaskElt(i), j) ||
21022 SVOp->getMaskElt(j) >= 0)
21028 /// isShuffleLow128VectorInsertHigh - Checks whether the shuffle node is the
21029 /// same as extracting the low 128-bit part of 256-bit vector and then
21030 /// inserting the result into the high part of a new 256-bit vector
21031 static bool isShuffleLow128VectorInsertHigh(ShuffleVectorSDNode *SVOp) {
21032 EVT VT = SVOp->getValueType(0);
21033 unsigned NumElems = VT.getVectorNumElements();
21035 // vector_shuffle <u, u, u, u, 0, 1, 2, 3> or <u, u, 0, 1>
21036 for (unsigned i = NumElems/2, j = 0; i != NumElems; ++i, ++j)
21037 if (!isUndefOrEqual(SVOp->getMaskElt(i), j) ||
21038 SVOp->getMaskElt(j) >= 0)
21044 /// PerformShuffleCombine256 - Performs shuffle combines for 256-bit vectors.
21045 static SDValue PerformShuffleCombine256(SDNode *N, SelectionDAG &DAG,
21046 TargetLowering::DAGCombinerInfo &DCI,
21047 const X86Subtarget* Subtarget) {
21049 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(N);
21050 SDValue V1 = SVOp->getOperand(0);
21051 SDValue V2 = SVOp->getOperand(1);
21052 EVT VT = SVOp->getValueType(0);
21053 unsigned NumElems = VT.getVectorNumElements();
21055 if (V1.getOpcode() == ISD::CONCAT_VECTORS &&
21056 V2.getOpcode() == ISD::CONCAT_VECTORS) {
21060 // V UNDEF BUILD_VECTOR UNDEF
21062 // CONCAT_VECTOR CONCAT_VECTOR
21065 // RESULT: V + zero extended
21067 if (V2.getOperand(0).getOpcode() != ISD::BUILD_VECTOR ||
21068 V2.getOperand(1).getOpcode() != ISD::UNDEF ||
21069 V1.getOperand(1).getOpcode() != ISD::UNDEF)
21072 if (!ISD::isBuildVectorAllZeros(V2.getOperand(0).getNode()))
21075 // To match the shuffle mask, the first half of the mask should
21076 // be exactly the first vector, and all the rest a splat with the
21077 // first element of the second one.
21078 for (unsigned i = 0; i != NumElems/2; ++i)
21079 if (!isUndefOrEqual(SVOp->getMaskElt(i), i) ||
21080 !isUndefOrEqual(SVOp->getMaskElt(i+NumElems/2), NumElems))
21083 // If V1 is coming from a vector load then just fold to a VZEXT_LOAD.
21084 if (LoadSDNode *Ld = dyn_cast<LoadSDNode>(V1.getOperand(0))) {
21085 if (Ld->hasNUsesOfValue(1, 0)) {
21086 SDVTList Tys = DAG.getVTList(MVT::v4i64, MVT::Other);
21087 SDValue Ops[] = { Ld->getChain(), Ld->getBasePtr() };
21089 DAG.getMemIntrinsicNode(X86ISD::VZEXT_LOAD, dl, Tys, Ops,
21091 Ld->getPointerInfo(),
21092 Ld->getAlignment(),
21093 false/*isVolatile*/, true/*ReadMem*/,
21094 false/*WriteMem*/);
21096 // Make sure the newly-created LOAD is in the same position as Ld in
21097 // terms of dependency. We create a TokenFactor for Ld and ResNode,
21098 // and update uses of Ld's output chain to use the TokenFactor.
21099 if (Ld->hasAnyUseOfValue(1)) {
21100 SDValue NewChain = DAG.getNode(ISD::TokenFactor, dl, MVT::Other,
21101 SDValue(Ld, 1), SDValue(ResNode.getNode(), 1));
21102 DAG.ReplaceAllUsesOfValueWith(SDValue(Ld, 1), NewChain);
21103 DAG.UpdateNodeOperands(NewChain.getNode(), SDValue(Ld, 1),
21104 SDValue(ResNode.getNode(), 1));
21107 return DAG.getNode(ISD::BITCAST, dl, VT, ResNode);
21111 // Emit a zeroed vector and insert the desired subvector on its
21113 SDValue Zeros = getZeroVector(VT, Subtarget, DAG, dl);
21114 SDValue InsV = Insert128BitVector(Zeros, V1.getOperand(0), 0, DAG, dl);
21115 return DCI.CombineTo(N, InsV);
21118 //===--------------------------------------------------------------------===//
21119 // Combine some shuffles into subvector extracts and inserts:
21122 // vector_shuffle <4, 5, 6, 7, u, u, u, u> or <2, 3, u, u>
21123 if (isShuffleHigh128VectorInsertLow(SVOp)) {
21124 SDValue V = Extract128BitVector(V1, NumElems/2, DAG, dl);
21125 SDValue InsV = Insert128BitVector(DAG.getUNDEF(VT), V, 0, DAG, dl);
21126 return DCI.CombineTo(N, InsV);
21129 // vector_shuffle <u, u, u, u, 0, 1, 2, 3> or <u, u, 0, 1>
21130 if (isShuffleLow128VectorInsertHigh(SVOp)) {
21131 SDValue V = Extract128BitVector(V1, 0, DAG, dl);
21132 SDValue InsV = Insert128BitVector(DAG.getUNDEF(VT), V, NumElems/2, DAG, dl);
21133 return DCI.CombineTo(N, InsV);
21139 /// \brief Combine an arbitrary chain of shuffles into a single instruction if
21142 /// This is the leaf of the recursive combinine below. When we have found some
21143 /// chain of single-use x86 shuffle instructions and accumulated the combined
21144 /// shuffle mask represented by them, this will try to pattern match that mask
21145 /// into either a single instruction if there is a special purpose instruction
21146 /// for this operation, or into a PSHUFB instruction which is a fully general
21147 /// instruction but should only be used to replace chains over a certain depth.
21148 static bool combineX86ShuffleChain(SDValue Op, SDValue Root, ArrayRef<int> Mask,
21149 int Depth, bool HasPSHUFB, SelectionDAG &DAG,
21150 TargetLowering::DAGCombinerInfo &DCI,
21151 const X86Subtarget *Subtarget) {
21152 assert(!Mask.empty() && "Cannot combine an empty shuffle mask!");
21154 // Find the operand that enters the chain. Note that multiple uses are OK
21155 // here, we're not going to remove the operand we find.
21156 SDValue Input = Op.getOperand(0);
21157 while (Input.getOpcode() == ISD::BITCAST)
21158 Input = Input.getOperand(0);
21160 MVT VT = Input.getSimpleValueType();
21161 MVT RootVT = Root.getSimpleValueType();
21164 // Just remove no-op shuffle masks.
21165 if (Mask.size() == 1) {
21166 DCI.CombineTo(Root.getNode(), DAG.getNode(ISD::BITCAST, DL, RootVT, Input),
21171 // Use the float domain if the operand type is a floating point type.
21172 bool FloatDomain = VT.isFloatingPoint();
21174 // For floating point shuffles, we don't have free copies in the shuffle
21175 // instructions or the ability to load as part of the instruction, so
21176 // canonicalize their shuffles to UNPCK or MOV variants.
21178 // Note that even with AVX we prefer the PSHUFD form of shuffle for integer
21179 // vectors because it can have a load folded into it that UNPCK cannot. This
21180 // doesn't preclude something switching to the shorter encoding post-RA.
21182 if (Mask.equals(0, 0) || Mask.equals(1, 1)) {
21183 bool Lo = Mask.equals(0, 0);
21186 // Check if we have SSE3 which will let us use MOVDDUP. That instruction
21187 // is no slower than UNPCKLPD but has the option to fold the input operand
21188 // into even an unaligned memory load.
21189 if (Lo && Subtarget->hasSSE3()) {
21190 Shuffle = X86ISD::MOVDDUP;
21191 ShuffleVT = MVT::v2f64;
21193 // We have MOVLHPS and MOVHLPS throughout SSE and they encode smaller
21194 // than the UNPCK variants.
21195 Shuffle = Lo ? X86ISD::MOVLHPS : X86ISD::MOVHLPS;
21196 ShuffleVT = MVT::v4f32;
21198 if (Depth == 1 && Root->getOpcode() == Shuffle)
21199 return false; // Nothing to do!
21200 Op = DAG.getNode(ISD::BITCAST, DL, ShuffleVT, Input);
21201 DCI.AddToWorklist(Op.getNode());
21202 if (Shuffle == X86ISD::MOVDDUP)
21203 Op = DAG.getNode(Shuffle, DL, ShuffleVT, Op);
21205 Op = DAG.getNode(Shuffle, DL, ShuffleVT, Op, Op);
21206 DCI.AddToWorklist(Op.getNode());
21207 DCI.CombineTo(Root.getNode(), DAG.getNode(ISD::BITCAST, DL, RootVT, Op),
21211 if (Subtarget->hasSSE3() &&
21212 (Mask.equals(0, 0, 2, 2) || Mask.equals(1, 1, 3, 3))) {
21213 bool Lo = Mask.equals(0, 0, 2, 2);
21214 unsigned Shuffle = Lo ? X86ISD::MOVSLDUP : X86ISD::MOVSHDUP;
21215 MVT ShuffleVT = MVT::v4f32;
21216 if (Depth == 1 && Root->getOpcode() == Shuffle)
21217 return false; // Nothing to do!
21218 Op = DAG.getNode(ISD::BITCAST, DL, ShuffleVT, Input);
21219 DCI.AddToWorklist(Op.getNode());
21220 Op = DAG.getNode(Shuffle, DL, ShuffleVT, Op);
21221 DCI.AddToWorklist(Op.getNode());
21222 DCI.CombineTo(Root.getNode(), DAG.getNode(ISD::BITCAST, DL, RootVT, Op),
21226 if (Mask.equals(0, 0, 1, 1) || Mask.equals(2, 2, 3, 3)) {
21227 bool Lo = Mask.equals(0, 0, 1, 1);
21228 unsigned Shuffle = Lo ? X86ISD::UNPCKL : X86ISD::UNPCKH;
21229 MVT ShuffleVT = MVT::v4f32;
21230 if (Depth == 1 && Root->getOpcode() == Shuffle)
21231 return false; // Nothing to do!
21232 Op = DAG.getNode(ISD::BITCAST, DL, ShuffleVT, Input);
21233 DCI.AddToWorklist(Op.getNode());
21234 Op = DAG.getNode(Shuffle, DL, ShuffleVT, Op, Op);
21235 DCI.AddToWorklist(Op.getNode());
21236 DCI.CombineTo(Root.getNode(), DAG.getNode(ISD::BITCAST, DL, RootVT, Op),
21242 // We always canonicalize the 8 x i16 and 16 x i8 shuffles into their UNPCK
21243 // variants as none of these have single-instruction variants that are
21244 // superior to the UNPCK formulation.
21245 if (!FloatDomain &&
21246 (Mask.equals(0, 0, 1, 1, 2, 2, 3, 3) ||
21247 Mask.equals(4, 4, 5, 5, 6, 6, 7, 7) ||
21248 Mask.equals(0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7) ||
21249 Mask.equals(8, 8, 9, 9, 10, 10, 11, 11, 12, 12, 13, 13, 14, 14, 15,
21251 bool Lo = Mask[0] == 0;
21252 unsigned Shuffle = Lo ? X86ISD::UNPCKL : X86ISD::UNPCKH;
21253 if (Depth == 1 && Root->getOpcode() == Shuffle)
21254 return false; // Nothing to do!
21256 switch (Mask.size()) {
21258 ShuffleVT = MVT::v8i16;
21261 ShuffleVT = MVT::v16i8;
21264 llvm_unreachable("Impossible mask size!");
21266 Op = DAG.getNode(ISD::BITCAST, DL, ShuffleVT, Input);
21267 DCI.AddToWorklist(Op.getNode());
21268 Op = DAG.getNode(Shuffle, DL, ShuffleVT, Op, Op);
21269 DCI.AddToWorklist(Op.getNode());
21270 DCI.CombineTo(Root.getNode(), DAG.getNode(ISD::BITCAST, DL, RootVT, Op),
21275 // Don't try to re-form single instruction chains under any circumstances now
21276 // that we've done encoding canonicalization for them.
21280 // If we have 3 or more shuffle instructions or a chain involving PSHUFB, we
21281 // can replace them with a single PSHUFB instruction profitably. Intel's
21282 // manuals suggest only using PSHUFB if doing so replacing 5 instructions, but
21283 // in practice PSHUFB tends to be *very* fast so we're more aggressive.
21284 if ((Depth >= 3 || HasPSHUFB) && Subtarget->hasSSSE3()) {
21285 SmallVector<SDValue, 16> PSHUFBMask;
21286 assert(Mask.size() <= 16 && "Can't shuffle elements smaller than bytes!");
21287 int Ratio = 16 / Mask.size();
21288 for (unsigned i = 0; i < 16; ++i) {
21289 if (Mask[i / Ratio] == SM_SentinelUndef) {
21290 PSHUFBMask.push_back(DAG.getUNDEF(MVT::i8));
21293 int M = Mask[i / Ratio] != SM_SentinelZero
21294 ? Ratio * Mask[i / Ratio] + i % Ratio
21296 PSHUFBMask.push_back(DAG.getConstant(M, MVT::i8));
21298 Op = DAG.getNode(ISD::BITCAST, DL, MVT::v16i8, Input);
21299 DCI.AddToWorklist(Op.getNode());
21300 SDValue PSHUFBMaskOp =
21301 DAG.getNode(ISD::BUILD_VECTOR, DL, MVT::v16i8, PSHUFBMask);
21302 DCI.AddToWorklist(PSHUFBMaskOp.getNode());
21303 Op = DAG.getNode(X86ISD::PSHUFB, DL, MVT::v16i8, Op, PSHUFBMaskOp);
21304 DCI.AddToWorklist(Op.getNode());
21305 DCI.CombineTo(Root.getNode(), DAG.getNode(ISD::BITCAST, DL, RootVT, Op),
21310 // Failed to find any combines.
21314 /// \brief Fully generic combining of x86 shuffle instructions.
21316 /// This should be the last combine run over the x86 shuffle instructions. Once
21317 /// they have been fully optimized, this will recursively consider all chains
21318 /// of single-use shuffle instructions, build a generic model of the cumulative
21319 /// shuffle operation, and check for simpler instructions which implement this
21320 /// operation. We use this primarily for two purposes:
21322 /// 1) Collapse generic shuffles to specialized single instructions when
21323 /// equivalent. In most cases, this is just an encoding size win, but
21324 /// sometimes we will collapse multiple generic shuffles into a single
21325 /// special-purpose shuffle.
21326 /// 2) Look for sequences of shuffle instructions with 3 or more total
21327 /// instructions, and replace them with the slightly more expensive SSSE3
21328 /// PSHUFB instruction if available. We do this as the last combining step
21329 /// to ensure we avoid using PSHUFB if we can implement the shuffle with
21330 /// a suitable short sequence of other instructions. The PHUFB will either
21331 /// use a register or have to read from memory and so is slightly (but only
21332 /// slightly) more expensive than the other shuffle instructions.
21334 /// Because this is inherently a quadratic operation (for each shuffle in
21335 /// a chain, we recurse up the chain), the depth is limited to 8 instructions.
21336 /// This should never be an issue in practice as the shuffle lowering doesn't
21337 /// produce sequences of more than 8 instructions.
21339 /// FIXME: We will currently miss some cases where the redundant shuffling
21340 /// would simplify under the threshold for PSHUFB formation because of
21341 /// combine-ordering. To fix this, we should do the redundant instruction
21342 /// combining in this recursive walk.
21343 static bool combineX86ShufflesRecursively(SDValue Op, SDValue Root,
21344 ArrayRef<int> RootMask,
21345 int Depth, bool HasPSHUFB,
21347 TargetLowering::DAGCombinerInfo &DCI,
21348 const X86Subtarget *Subtarget) {
21349 // Bound the depth of our recursive combine because this is ultimately
21350 // quadratic in nature.
21354 // Directly rip through bitcasts to find the underlying operand.
21355 while (Op.getOpcode() == ISD::BITCAST && Op.getOperand(0).hasOneUse())
21356 Op = Op.getOperand(0);
21358 MVT VT = Op.getSimpleValueType();
21359 if (!VT.isVector())
21360 return false; // Bail if we hit a non-vector.
21361 // FIXME: This routine should be taught about 256-bit shuffles, or a 256-bit
21362 // version should be added.
21363 if (VT.getSizeInBits() != 128)
21366 assert(Root.getSimpleValueType().isVector() &&
21367 "Shuffles operate on vector types!");
21368 assert(VT.getSizeInBits() == Root.getSimpleValueType().getSizeInBits() &&
21369 "Can only combine shuffles of the same vector register size.");
21371 if (!isTargetShuffle(Op.getOpcode()))
21373 SmallVector<int, 16> OpMask;
21375 bool HaveMask = getTargetShuffleMask(Op.getNode(), VT, OpMask, IsUnary);
21376 // We only can combine unary shuffles which we can decode the mask for.
21377 if (!HaveMask || !IsUnary)
21380 assert(VT.getVectorNumElements() == OpMask.size() &&
21381 "Different mask size from vector size!");
21382 assert(((RootMask.size() > OpMask.size() &&
21383 RootMask.size() % OpMask.size() == 0) ||
21384 (OpMask.size() > RootMask.size() &&
21385 OpMask.size() % RootMask.size() == 0) ||
21386 OpMask.size() == RootMask.size()) &&
21387 "The smaller number of elements must divide the larger.");
21388 int RootRatio = std::max<int>(1, OpMask.size() / RootMask.size());
21389 int OpRatio = std::max<int>(1, RootMask.size() / OpMask.size());
21390 assert(((RootRatio == 1 && OpRatio == 1) ||
21391 (RootRatio == 1) != (OpRatio == 1)) &&
21392 "Must not have a ratio for both incoming and op masks!");
21394 SmallVector<int, 16> Mask;
21395 Mask.reserve(std::max(OpMask.size(), RootMask.size()));
21397 // Merge this shuffle operation's mask into our accumulated mask. Note that
21398 // this shuffle's mask will be the first applied to the input, followed by the
21399 // root mask to get us all the way to the root value arrangement. The reason
21400 // for this order is that we are recursing up the operation chain.
21401 for (int i = 0, e = std::max(OpMask.size(), RootMask.size()); i < e; ++i) {
21402 int RootIdx = i / RootRatio;
21403 if (RootMask[RootIdx] < 0) {
21404 // This is a zero or undef lane, we're done.
21405 Mask.push_back(RootMask[RootIdx]);
21409 int RootMaskedIdx = RootMask[RootIdx] * RootRatio + i % RootRatio;
21410 int OpIdx = RootMaskedIdx / OpRatio;
21411 if (OpMask[OpIdx] < 0) {
21412 // The incoming lanes are zero or undef, it doesn't matter which ones we
21414 Mask.push_back(OpMask[OpIdx]);
21418 // Ok, we have non-zero lanes, map them through.
21419 Mask.push_back(OpMask[OpIdx] * OpRatio +
21420 RootMaskedIdx % OpRatio);
21423 // See if we can recurse into the operand to combine more things.
21424 switch (Op.getOpcode()) {
21425 case X86ISD::PSHUFB:
21427 case X86ISD::PSHUFD:
21428 case X86ISD::PSHUFHW:
21429 case X86ISD::PSHUFLW:
21430 if (Op.getOperand(0).hasOneUse() &&
21431 combineX86ShufflesRecursively(Op.getOperand(0), Root, Mask, Depth + 1,
21432 HasPSHUFB, DAG, DCI, Subtarget))
21436 case X86ISD::UNPCKL:
21437 case X86ISD::UNPCKH:
21438 assert(Op.getOperand(0) == Op.getOperand(1) && "We only combine unary shuffles!");
21439 // We can't check for single use, we have to check that this shuffle is the only user.
21440 if (Op->isOnlyUserOf(Op.getOperand(0).getNode()) &&
21441 combineX86ShufflesRecursively(Op.getOperand(0), Root, Mask, Depth + 1,
21442 HasPSHUFB, DAG, DCI, Subtarget))
21447 // Minor canonicalization of the accumulated shuffle mask to make it easier
21448 // to match below. All this does is detect masks with squential pairs of
21449 // elements, and shrink them to the half-width mask. It does this in a loop
21450 // so it will reduce the size of the mask to the minimal width mask which
21451 // performs an equivalent shuffle.
21452 SmallVector<int, 16> WidenedMask;
21453 while (Mask.size() > 1 && canWidenShuffleElements(Mask, WidenedMask)) {
21454 Mask = std::move(WidenedMask);
21455 WidenedMask.clear();
21458 return combineX86ShuffleChain(Op, Root, Mask, Depth, HasPSHUFB, DAG, DCI,
21462 /// \brief Get the PSHUF-style mask from PSHUF node.
21464 /// This is a very minor wrapper around getTargetShuffleMask to easy forming v4
21465 /// PSHUF-style masks that can be reused with such instructions.
21466 static SmallVector<int, 4> getPSHUFShuffleMask(SDValue N) {
21467 SmallVector<int, 4> Mask;
21469 bool HaveMask = getTargetShuffleMask(N.getNode(), N.getSimpleValueType(), Mask, IsUnary);
21473 switch (N.getOpcode()) {
21474 case X86ISD::PSHUFD:
21476 case X86ISD::PSHUFLW:
21479 case X86ISD::PSHUFHW:
21480 Mask.erase(Mask.begin(), Mask.begin() + 4);
21481 for (int &M : Mask)
21485 llvm_unreachable("No valid shuffle instruction found!");
21489 /// \brief Search for a combinable shuffle across a chain ending in pshufd.
21491 /// We walk up the chain and look for a combinable shuffle, skipping over
21492 /// shuffles that we could hoist this shuffle's transformation past without
21493 /// altering anything.
21495 combineRedundantDWordShuffle(SDValue N, MutableArrayRef<int> Mask,
21497 TargetLowering::DAGCombinerInfo &DCI) {
21498 assert(N.getOpcode() == X86ISD::PSHUFD &&
21499 "Called with something other than an x86 128-bit half shuffle!");
21502 // Walk up a single-use chain looking for a combinable shuffle. Keep a stack
21503 // of the shuffles in the chain so that we can form a fresh chain to replace
21505 SmallVector<SDValue, 8> Chain;
21506 SDValue V = N.getOperand(0);
21507 for (; V.hasOneUse(); V = V.getOperand(0)) {
21508 switch (V.getOpcode()) {
21510 return SDValue(); // Nothing combined!
21513 // Skip bitcasts as we always know the type for the target specific
21517 case X86ISD::PSHUFD:
21518 // Found another dword shuffle.
21521 case X86ISD::PSHUFLW:
21522 // Check that the low words (being shuffled) are the identity in the
21523 // dword shuffle, and the high words are self-contained.
21524 if (Mask[0] != 0 || Mask[1] != 1 ||
21525 !(Mask[2] >= 2 && Mask[2] < 4 && Mask[3] >= 2 && Mask[3] < 4))
21528 Chain.push_back(V);
21531 case X86ISD::PSHUFHW:
21532 // Check that the high words (being shuffled) are the identity in the
21533 // dword shuffle, and the low words are self-contained.
21534 if (Mask[2] != 2 || Mask[3] != 3 ||
21535 !(Mask[0] >= 0 && Mask[0] < 2 && Mask[1] >= 0 && Mask[1] < 2))
21538 Chain.push_back(V);
21541 case X86ISD::UNPCKL:
21542 case X86ISD::UNPCKH:
21543 // For either i8 -> i16 or i16 -> i32 unpacks, we can combine a dword
21544 // shuffle into a preceding word shuffle.
21545 if (V.getValueType() != MVT::v16i8 && V.getValueType() != MVT::v8i16)
21548 // Search for a half-shuffle which we can combine with.
21549 unsigned CombineOp =
21550 V.getOpcode() == X86ISD::UNPCKL ? X86ISD::PSHUFLW : X86ISD::PSHUFHW;
21551 if (V.getOperand(0) != V.getOperand(1) ||
21552 !V->isOnlyUserOf(V.getOperand(0).getNode()))
21554 Chain.push_back(V);
21555 V = V.getOperand(0);
21557 switch (V.getOpcode()) {
21559 return SDValue(); // Nothing to combine.
21561 case X86ISD::PSHUFLW:
21562 case X86ISD::PSHUFHW:
21563 if (V.getOpcode() == CombineOp)
21566 Chain.push_back(V);
21570 V = V.getOperand(0);
21574 } while (V.hasOneUse());
21577 // Break out of the loop if we break out of the switch.
21581 if (!V.hasOneUse())
21582 // We fell out of the loop without finding a viable combining instruction.
21585 // Merge this node's mask and our incoming mask.
21586 SmallVector<int, 4> VMask = getPSHUFShuffleMask(V);
21587 for (int &M : Mask)
21589 V = DAG.getNode(V.getOpcode(), DL, V.getValueType(), V.getOperand(0),
21590 getV4X86ShuffleImm8ForMask(Mask, DAG));
21592 // Rebuild the chain around this new shuffle.
21593 while (!Chain.empty()) {
21594 SDValue W = Chain.pop_back_val();
21596 if (V.getValueType() != W.getOperand(0).getValueType())
21597 V = DAG.getNode(ISD::BITCAST, DL, W.getOperand(0).getValueType(), V);
21599 switch (W.getOpcode()) {
21601 llvm_unreachable("Only PSHUF and UNPCK instructions get here!");
21603 case X86ISD::UNPCKL:
21604 case X86ISD::UNPCKH:
21605 V = DAG.getNode(W.getOpcode(), DL, W.getValueType(), V, V);
21608 case X86ISD::PSHUFD:
21609 case X86ISD::PSHUFLW:
21610 case X86ISD::PSHUFHW:
21611 V = DAG.getNode(W.getOpcode(), DL, W.getValueType(), V, W.getOperand(1));
21615 if (V.getValueType() != N.getValueType())
21616 V = DAG.getNode(ISD::BITCAST, DL, N.getValueType(), V);
21618 // Return the new chain to replace N.
21622 /// \brief Search for a combinable shuffle across a chain ending in pshuflw or pshufhw.
21624 /// We walk up the chain, skipping shuffles of the other half and looking
21625 /// through shuffles which switch halves trying to find a shuffle of the same
21626 /// pair of dwords.
21627 static bool combineRedundantHalfShuffle(SDValue N, MutableArrayRef<int> Mask,
21629 TargetLowering::DAGCombinerInfo &DCI) {
21631 (N.getOpcode() == X86ISD::PSHUFLW || N.getOpcode() == X86ISD::PSHUFHW) &&
21632 "Called with something other than an x86 128-bit half shuffle!");
21634 unsigned CombineOpcode = N.getOpcode();
21636 // Walk up a single-use chain looking for a combinable shuffle.
21637 SDValue V = N.getOperand(0);
21638 for (; V.hasOneUse(); V = V.getOperand(0)) {
21639 switch (V.getOpcode()) {
21641 return false; // Nothing combined!
21644 // Skip bitcasts as we always know the type for the target specific
21648 case X86ISD::PSHUFLW:
21649 case X86ISD::PSHUFHW:
21650 if (V.getOpcode() == CombineOpcode)
21653 // Other-half shuffles are no-ops.
21656 // Break out of the loop if we break out of the switch.
21660 if (!V.hasOneUse())
21661 // We fell out of the loop without finding a viable combining instruction.
21664 // Combine away the bottom node as its shuffle will be accumulated into
21665 // a preceding shuffle.
21666 DCI.CombineTo(N.getNode(), N.getOperand(0), /*AddTo*/ true);
21668 // Record the old value.
21671 // Merge this node's mask and our incoming mask (adjusted to account for all
21672 // the pshufd instructions encountered).
21673 SmallVector<int, 4> VMask = getPSHUFShuffleMask(V);
21674 for (int &M : Mask)
21676 V = DAG.getNode(V.getOpcode(), DL, MVT::v8i16, V.getOperand(0),
21677 getV4X86ShuffleImm8ForMask(Mask, DAG));
21679 // Check that the shuffles didn't cancel each other out. If not, we need to
21680 // combine to the new one.
21682 // Replace the combinable shuffle with the combined one, updating all users
21683 // so that we re-evaluate the chain here.
21684 DCI.CombineTo(Old.getNode(), V, /*AddTo*/ true);
21689 /// \brief Try to combine x86 target specific shuffles.
21690 static SDValue PerformTargetShuffleCombine(SDValue N, SelectionDAG &DAG,
21691 TargetLowering::DAGCombinerInfo &DCI,
21692 const X86Subtarget *Subtarget) {
21694 MVT VT = N.getSimpleValueType();
21695 SmallVector<int, 4> Mask;
21697 switch (N.getOpcode()) {
21698 case X86ISD::PSHUFD:
21699 case X86ISD::PSHUFLW:
21700 case X86ISD::PSHUFHW:
21701 Mask = getPSHUFShuffleMask(N);
21702 assert(Mask.size() == 4);
21708 // Nuke no-op shuffles that show up after combining.
21709 if (isNoopShuffleMask(Mask))
21710 return DCI.CombineTo(N.getNode(), N.getOperand(0), /*AddTo*/ true);
21712 // Look for simplifications involving one or two shuffle instructions.
21713 SDValue V = N.getOperand(0);
21714 switch (N.getOpcode()) {
21717 case X86ISD::PSHUFLW:
21718 case X86ISD::PSHUFHW:
21719 assert(VT == MVT::v8i16);
21722 if (combineRedundantHalfShuffle(N, Mask, DAG, DCI))
21723 return SDValue(); // We combined away this shuffle, so we're done.
21725 // See if this reduces to a PSHUFD which is no more expensive and can
21726 // combine with more operations. Note that it has to at least flip the
21727 // dwords as otherwise it would have been removed as a no-op.
21728 if (Mask[0] == 2 && Mask[1] == 3 && Mask[2] == 0 && Mask[3] == 1) {
21729 int DMask[] = {0, 1, 2, 3};
21730 int DOffset = N.getOpcode() == X86ISD::PSHUFLW ? 0 : 2;
21731 DMask[DOffset + 0] = DOffset + 1;
21732 DMask[DOffset + 1] = DOffset + 0;
21733 V = DAG.getNode(ISD::BITCAST, DL, MVT::v4i32, V);
21734 DCI.AddToWorklist(V.getNode());
21735 V = DAG.getNode(X86ISD::PSHUFD, DL, MVT::v4i32, V,
21736 getV4X86ShuffleImm8ForMask(DMask, DAG));
21737 DCI.AddToWorklist(V.getNode());
21738 return DAG.getNode(ISD::BITCAST, DL, MVT::v8i16, V);
21741 // Look for shuffle patterns which can be implemented as a single unpack.
21742 // FIXME: This doesn't handle the location of the PSHUFD generically, and
21743 // only works when we have a PSHUFD followed by two half-shuffles.
21744 if (Mask[0] == Mask[1] && Mask[2] == Mask[3] &&
21745 (V.getOpcode() == X86ISD::PSHUFLW ||
21746 V.getOpcode() == X86ISD::PSHUFHW) &&
21747 V.getOpcode() != N.getOpcode() &&
21749 SDValue D = V.getOperand(0);
21750 while (D.getOpcode() == ISD::BITCAST && D.hasOneUse())
21751 D = D.getOperand(0);
21752 if (D.getOpcode() == X86ISD::PSHUFD && D.hasOneUse()) {
21753 SmallVector<int, 4> VMask = getPSHUFShuffleMask(V);
21754 SmallVector<int, 4> DMask = getPSHUFShuffleMask(D);
21755 int NOffset = N.getOpcode() == X86ISD::PSHUFLW ? 0 : 4;
21756 int VOffset = V.getOpcode() == X86ISD::PSHUFLW ? 0 : 4;
21758 for (int i = 0; i < 4; ++i) {
21759 WordMask[i + NOffset] = Mask[i] + NOffset;
21760 WordMask[i + VOffset] = VMask[i] + VOffset;
21762 // Map the word mask through the DWord mask.
21764 for (int i = 0; i < 8; ++i)
21765 MappedMask[i] = 2 * DMask[WordMask[i] / 2] + WordMask[i] % 2;
21766 const int UnpackLoMask[] = {0, 0, 1, 1, 2, 2, 3, 3};
21767 const int UnpackHiMask[] = {4, 4, 5, 5, 6, 6, 7, 7};
21768 if (std::equal(std::begin(MappedMask), std::end(MappedMask),
21769 std::begin(UnpackLoMask)) ||
21770 std::equal(std::begin(MappedMask), std::end(MappedMask),
21771 std::begin(UnpackHiMask))) {
21772 // We can replace all three shuffles with an unpack.
21773 V = DAG.getNode(ISD::BITCAST, DL, MVT::v8i16, D.getOperand(0));
21774 DCI.AddToWorklist(V.getNode());
21775 return DAG.getNode(MappedMask[0] == 0 ? X86ISD::UNPCKL
21777 DL, MVT::v8i16, V, V);
21784 case X86ISD::PSHUFD:
21785 if (SDValue NewN = combineRedundantDWordShuffle(N, Mask, DAG, DCI))
21794 /// \brief Try to combine a shuffle into a target-specific add-sub node.
21796 /// We combine this directly on the abstract vector shuffle nodes so it is
21797 /// easier to generically match. We also insert dummy vector shuffle nodes for
21798 /// the operands which explicitly discard the lanes which are unused by this
21799 /// operation to try to flow through the rest of the combiner the fact that
21800 /// they're unused.
21801 static SDValue combineShuffleToAddSub(SDNode *N, SelectionDAG &DAG) {
21803 EVT VT = N->getValueType(0);
21805 // We only handle target-independent shuffles.
21806 // FIXME: It would be easy and harmless to use the target shuffle mask
21807 // extraction tool to support more.
21808 if (N->getOpcode() != ISD::VECTOR_SHUFFLE)
21811 auto *SVN = cast<ShuffleVectorSDNode>(N);
21812 ArrayRef<int> Mask = SVN->getMask();
21813 SDValue V1 = N->getOperand(0);
21814 SDValue V2 = N->getOperand(1);
21816 // We require the first shuffle operand to be the SUB node, and the second to
21817 // be the ADD node.
21818 // FIXME: We should support the commuted patterns.
21819 if (V1->getOpcode() != ISD::FSUB || V2->getOpcode() != ISD::FADD)
21822 // If there are other uses of these operations we can't fold them.
21823 if (!V1->hasOneUse() || !V2->hasOneUse())
21826 // Ensure that both operations have the same operands. Note that we can
21827 // commute the FADD operands.
21828 SDValue LHS = V1->getOperand(0), RHS = V1->getOperand(1);
21829 if ((V2->getOperand(0) != LHS || V2->getOperand(1) != RHS) &&
21830 (V2->getOperand(0) != RHS || V2->getOperand(1) != LHS))
21833 // We're looking for blends between FADD and FSUB nodes. We insist on these
21834 // nodes being lined up in a specific expected pattern.
21835 if (!(isShuffleEquivalent(Mask, 0, 3) ||
21836 isShuffleEquivalent(Mask, 0, 5, 2, 7) ||
21837 isShuffleEquivalent(Mask, 0, 9, 2, 11, 4, 13, 6, 15)))
21840 // Only specific types are legal at this point, assert so we notice if and
21841 // when these change.
21842 assert((VT == MVT::v4f32 || VT == MVT::v2f64 || VT == MVT::v8f32 ||
21843 VT == MVT::v4f64) &&
21844 "Unknown vector type encountered!");
21846 return DAG.getNode(X86ISD::ADDSUB, DL, VT, LHS, RHS);
21849 /// PerformShuffleCombine - Performs several different shuffle combines.
21850 static SDValue PerformShuffleCombine(SDNode *N, SelectionDAG &DAG,
21851 TargetLowering::DAGCombinerInfo &DCI,
21852 const X86Subtarget *Subtarget) {
21854 SDValue N0 = N->getOperand(0);
21855 SDValue N1 = N->getOperand(1);
21856 EVT VT = N->getValueType(0);
21858 // Don't create instructions with illegal types after legalize types has run.
21859 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
21860 if (!DCI.isBeforeLegalize() && !TLI.isTypeLegal(VT.getVectorElementType()))
21863 // If we have legalized the vector types, look for blends of FADD and FSUB
21864 // nodes that we can fuse into an ADDSUB node.
21865 if (TLI.isTypeLegal(VT) && Subtarget->hasSSE3())
21866 if (SDValue AddSub = combineShuffleToAddSub(N, DAG))
21869 // Combine 256-bit vector shuffles. This is only profitable when in AVX mode
21870 if (Subtarget->hasFp256() && VT.is256BitVector() &&
21871 N->getOpcode() == ISD::VECTOR_SHUFFLE)
21872 return PerformShuffleCombine256(N, DAG, DCI, Subtarget);
21874 // During Type Legalization, when promoting illegal vector types,
21875 // the backend might introduce new shuffle dag nodes and bitcasts.
21877 // This code performs the following transformation:
21878 // fold: (shuffle (bitcast (BINOP A, B)), Undef, <Mask>) ->
21879 // (shuffle (BINOP (bitcast A), (bitcast B)), Undef, <Mask>)
21881 // We do this only if both the bitcast and the BINOP dag nodes have
21882 // one use. Also, perform this transformation only if the new binary
21883 // operation is legal. This is to avoid introducing dag nodes that
21884 // potentially need to be further expanded (or custom lowered) into a
21885 // less optimal sequence of dag nodes.
21886 if (!DCI.isBeforeLegalize() && DCI.isBeforeLegalizeOps() &&
21887 N1.getOpcode() == ISD::UNDEF && N0.hasOneUse() &&
21888 N0.getOpcode() == ISD::BITCAST) {
21889 SDValue BC0 = N0.getOperand(0);
21890 EVT SVT = BC0.getValueType();
21891 unsigned Opcode = BC0.getOpcode();
21892 unsigned NumElts = VT.getVectorNumElements();
21894 if (BC0.hasOneUse() && SVT.isVector() &&
21895 SVT.getVectorNumElements() * 2 == NumElts &&
21896 TLI.isOperationLegal(Opcode, VT)) {
21897 bool CanFold = false;
21909 unsigned SVTNumElts = SVT.getVectorNumElements();
21910 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(N);
21911 for (unsigned i = 0, e = SVTNumElts; i != e && CanFold; ++i)
21912 CanFold = SVOp->getMaskElt(i) == (int)(i * 2);
21913 for (unsigned i = SVTNumElts, e = NumElts; i != e && CanFold; ++i)
21914 CanFold = SVOp->getMaskElt(i) < 0;
21917 SDValue BC00 = DAG.getNode(ISD::BITCAST, dl, VT, BC0.getOperand(0));
21918 SDValue BC01 = DAG.getNode(ISD::BITCAST, dl, VT, BC0.getOperand(1));
21919 SDValue NewBinOp = DAG.getNode(BC0.getOpcode(), dl, VT, BC00, BC01);
21920 return DAG.getVectorShuffle(VT, dl, NewBinOp, N1, &SVOp->getMask()[0]);
21925 // Only handle 128 wide vector from here on.
21926 if (!VT.is128BitVector())
21929 // Combine a vector_shuffle that is equal to build_vector load1, load2, load3,
21930 // load4, <0, 1, 2, 3> into a 128-bit load if the load addresses are
21931 // consecutive, non-overlapping, and in the right order.
21932 SmallVector<SDValue, 16> Elts;
21933 for (unsigned i = 0, e = VT.getVectorNumElements(); i != e; ++i)
21934 Elts.push_back(getShuffleScalarElt(N, i, DAG, 0));
21936 SDValue LD = EltsFromConsecutiveLoads(VT, Elts, dl, DAG, true);
21940 if (isTargetShuffle(N->getOpcode())) {
21942 PerformTargetShuffleCombine(SDValue(N, 0), DAG, DCI, Subtarget);
21943 if (Shuffle.getNode())
21946 // Try recursively combining arbitrary sequences of x86 shuffle
21947 // instructions into higher-order shuffles. We do this after combining
21948 // specific PSHUF instruction sequences into their minimal form so that we
21949 // can evaluate how many specialized shuffle instructions are involved in
21950 // a particular chain.
21951 SmallVector<int, 1> NonceMask; // Just a placeholder.
21952 NonceMask.push_back(0);
21953 if (combineX86ShufflesRecursively(SDValue(N, 0), SDValue(N, 0), NonceMask,
21954 /*Depth*/ 1, /*HasPSHUFB*/ false, DAG,
21956 return SDValue(); // This routine will use CombineTo to replace N.
21962 /// PerformTruncateCombine - Converts truncate operation to
21963 /// a sequence of vector shuffle operations.
21964 /// It is possible when we truncate 256-bit vector to 128-bit vector
21965 static SDValue PerformTruncateCombine(SDNode *N, SelectionDAG &DAG,
21966 TargetLowering::DAGCombinerInfo &DCI,
21967 const X86Subtarget *Subtarget) {
21971 /// XFormVExtractWithShuffleIntoLoad - Check if a vector extract from a target
21972 /// specific shuffle of a load can be folded into a single element load.
21973 /// Similar handling for VECTOR_SHUFFLE is performed by DAGCombiner, but
21974 /// shuffles have been custom lowered so we need to handle those here.
21975 static SDValue XFormVExtractWithShuffleIntoLoad(SDNode *N, SelectionDAG &DAG,
21976 TargetLowering::DAGCombinerInfo &DCI) {
21977 if (DCI.isBeforeLegalizeOps())
21980 SDValue InVec = N->getOperand(0);
21981 SDValue EltNo = N->getOperand(1);
21983 if (!isa<ConstantSDNode>(EltNo))
21986 EVT OriginalVT = InVec.getValueType();
21988 if (InVec.getOpcode() == ISD::BITCAST) {
21989 // Don't duplicate a load with other uses.
21990 if (!InVec.hasOneUse())
21992 EVT BCVT = InVec.getOperand(0).getValueType();
21993 if (BCVT.getVectorNumElements() != OriginalVT.getVectorNumElements())
21995 InVec = InVec.getOperand(0);
21998 EVT CurrentVT = InVec.getValueType();
22000 if (!isTargetShuffle(InVec.getOpcode()))
22003 // Don't duplicate a load with other uses.
22004 if (!InVec.hasOneUse())
22007 SmallVector<int, 16> ShuffleMask;
22009 if (!getTargetShuffleMask(InVec.getNode(), CurrentVT.getSimpleVT(),
22010 ShuffleMask, UnaryShuffle))
22013 // Select the input vector, guarding against out of range extract vector.
22014 unsigned NumElems = CurrentVT.getVectorNumElements();
22015 int Elt = cast<ConstantSDNode>(EltNo)->getZExtValue();
22016 int Idx = (Elt > (int)NumElems) ? -1 : ShuffleMask[Elt];
22017 SDValue LdNode = (Idx < (int)NumElems) ? InVec.getOperand(0)
22018 : InVec.getOperand(1);
22020 // If inputs to shuffle are the same for both ops, then allow 2 uses
22021 unsigned AllowedUses = InVec.getOperand(0) == InVec.getOperand(1) ? 2 : 1;
22023 if (LdNode.getOpcode() == ISD::BITCAST) {
22024 // Don't duplicate a load with other uses.
22025 if (!LdNode.getNode()->hasNUsesOfValue(AllowedUses, 0))
22028 AllowedUses = 1; // only allow 1 load use if we have a bitcast
22029 LdNode = LdNode.getOperand(0);
22032 if (!ISD::isNormalLoad(LdNode.getNode()))
22035 LoadSDNode *LN0 = cast<LoadSDNode>(LdNode);
22037 if (!LN0 ||!LN0->hasNUsesOfValue(AllowedUses, 0) || LN0->isVolatile())
22040 EVT EltVT = N->getValueType(0);
22041 // If there's a bitcast before the shuffle, check if the load type and
22042 // alignment is valid.
22043 unsigned Align = LN0->getAlignment();
22044 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
22045 unsigned NewAlign = TLI.getDataLayout()->getABITypeAlignment(
22046 EltVT.getTypeForEVT(*DAG.getContext()));
22048 if (NewAlign > Align || !TLI.isOperationLegalOrCustom(ISD::LOAD, EltVT))
22051 // All checks match so transform back to vector_shuffle so that DAG combiner
22052 // can finish the job
22055 // Create shuffle node taking into account the case that its a unary shuffle
22056 SDValue Shuffle = (UnaryShuffle) ? DAG.getUNDEF(CurrentVT)
22057 : InVec.getOperand(1);
22058 Shuffle = DAG.getVectorShuffle(CurrentVT, dl,
22059 InVec.getOperand(0), Shuffle,
22061 Shuffle = DAG.getNode(ISD::BITCAST, dl, OriginalVT, Shuffle);
22062 return DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, N->getValueType(0), Shuffle,
22066 /// PerformEXTRACT_VECTOR_ELTCombine - Detect vector gather/scatter index
22067 /// generation and convert it from being a bunch of shuffles and extracts
22068 /// to a simple store and scalar loads to extract the elements.
22069 static SDValue PerformEXTRACT_VECTOR_ELTCombine(SDNode *N, SelectionDAG &DAG,
22070 TargetLowering::DAGCombinerInfo &DCI) {
22071 SDValue NewOp = XFormVExtractWithShuffleIntoLoad(N, DAG, DCI);
22072 if (NewOp.getNode())
22075 SDValue InputVector = N->getOperand(0);
22077 // Detect whether we are trying to convert from mmx to i32 and the bitcast
22078 // from mmx to v2i32 has a single usage.
22079 if (InputVector.getNode()->getOpcode() == llvm::ISD::BITCAST &&
22080 InputVector.getNode()->getOperand(0).getValueType() == MVT::x86mmx &&
22081 InputVector.hasOneUse() && N->getValueType(0) == MVT::i32)
22082 return DAG.getNode(X86ISD::MMX_MOVD2W, SDLoc(InputVector),
22083 N->getValueType(0),
22084 InputVector.getNode()->getOperand(0));
22086 // Only operate on vectors of 4 elements, where the alternative shuffling
22087 // gets to be more expensive.
22088 if (InputVector.getValueType() != MVT::v4i32)
22091 // Check whether every use of InputVector is an EXTRACT_VECTOR_ELT with a
22092 // single use which is a sign-extend or zero-extend, and all elements are
22094 SmallVector<SDNode *, 4> Uses;
22095 unsigned ExtractedElements = 0;
22096 for (SDNode::use_iterator UI = InputVector.getNode()->use_begin(),
22097 UE = InputVector.getNode()->use_end(); UI != UE; ++UI) {
22098 if (UI.getUse().getResNo() != InputVector.getResNo())
22101 SDNode *Extract = *UI;
22102 if (Extract->getOpcode() != ISD::EXTRACT_VECTOR_ELT)
22105 if (Extract->getValueType(0) != MVT::i32)
22107 if (!Extract->hasOneUse())
22109 if (Extract->use_begin()->getOpcode() != ISD::SIGN_EXTEND &&
22110 Extract->use_begin()->getOpcode() != ISD::ZERO_EXTEND)
22112 if (!isa<ConstantSDNode>(Extract->getOperand(1)))
22115 // Record which element was extracted.
22116 ExtractedElements |=
22117 1 << cast<ConstantSDNode>(Extract->getOperand(1))->getZExtValue();
22119 Uses.push_back(Extract);
22122 // If not all the elements were used, this may not be worthwhile.
22123 if (ExtractedElements != 15)
22126 // Ok, we've now decided to do the transformation.
22127 SDLoc dl(InputVector);
22129 // Store the value to a temporary stack slot.
22130 SDValue StackPtr = DAG.CreateStackTemporary(InputVector.getValueType());
22131 SDValue Ch = DAG.getStore(DAG.getEntryNode(), dl, InputVector, StackPtr,
22132 MachinePointerInfo(), false, false, 0);
22134 // Replace each use (extract) with a load of the appropriate element.
22135 for (SmallVectorImpl<SDNode *>::iterator UI = Uses.begin(),
22136 UE = Uses.end(); UI != UE; ++UI) {
22137 SDNode *Extract = *UI;
22139 // cOMpute the element's address.
22140 SDValue Idx = Extract->getOperand(1);
22142 InputVector.getValueType().getVectorElementType().getSizeInBits()/8;
22143 uint64_t Offset = EltSize * cast<ConstantSDNode>(Idx)->getZExtValue();
22144 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
22145 SDValue OffsetVal = DAG.getConstant(Offset, TLI.getPointerTy());
22147 SDValue ScalarAddr = DAG.getNode(ISD::ADD, dl, TLI.getPointerTy(),
22148 StackPtr, OffsetVal);
22150 // Load the scalar.
22151 SDValue LoadScalar = DAG.getLoad(Extract->getValueType(0), dl, Ch,
22152 ScalarAddr, MachinePointerInfo(),
22153 false, false, false, 0);
22155 // Replace the exact with the load.
22156 DAG.ReplaceAllUsesOfValueWith(SDValue(Extract, 0), LoadScalar);
22159 // The replacement was made in place; don't return anything.
22163 /// \brief Matches a VSELECT onto min/max or return 0 if the node doesn't match.
22164 static std::pair<unsigned, bool>
22165 matchIntegerMINMAX(SDValue Cond, EVT VT, SDValue LHS, SDValue RHS,
22166 SelectionDAG &DAG, const X86Subtarget *Subtarget) {
22167 if (!VT.isVector())
22168 return std::make_pair(0, false);
22170 bool NeedSplit = false;
22171 switch (VT.getSimpleVT().SimpleTy) {
22172 default: return std::make_pair(0, false);
22176 if (!Subtarget->hasAVX2())
22178 if (!Subtarget->hasAVX())
22179 return std::make_pair(0, false);
22184 if (!Subtarget->hasSSE2())
22185 return std::make_pair(0, false);
22188 // SSE2 has only a small subset of the operations.
22189 bool hasUnsigned = Subtarget->hasSSE41() ||
22190 (Subtarget->hasSSE2() && VT == MVT::v16i8);
22191 bool hasSigned = Subtarget->hasSSE41() ||
22192 (Subtarget->hasSSE2() && VT == MVT::v8i16);
22194 ISD::CondCode CC = cast<CondCodeSDNode>(Cond.getOperand(2))->get();
22197 // Check for x CC y ? x : y.
22198 if (DAG.isEqualTo(LHS, Cond.getOperand(0)) &&
22199 DAG.isEqualTo(RHS, Cond.getOperand(1))) {
22204 Opc = hasUnsigned ? X86ISD::UMIN : 0; break;
22207 Opc = hasUnsigned ? X86ISD::UMAX : 0; break;
22210 Opc = hasSigned ? X86ISD::SMIN : 0; break;
22213 Opc = hasSigned ? X86ISD::SMAX : 0; break;
22215 // Check for x CC y ? y : x -- a min/max with reversed arms.
22216 } else if (DAG.isEqualTo(LHS, Cond.getOperand(1)) &&
22217 DAG.isEqualTo(RHS, Cond.getOperand(0))) {
22222 Opc = hasUnsigned ? X86ISD::UMAX : 0; break;
22225 Opc = hasUnsigned ? X86ISD::UMIN : 0; break;
22228 Opc = hasSigned ? X86ISD::SMAX : 0; break;
22231 Opc = hasSigned ? X86ISD::SMIN : 0; break;
22235 return std::make_pair(Opc, NeedSplit);
22239 TransformVSELECTtoBlendVECTOR_SHUFFLE(SDNode *N, SelectionDAG &DAG,
22240 const X86Subtarget *Subtarget) {
22242 SDValue Cond = N->getOperand(0);
22243 SDValue LHS = N->getOperand(1);
22244 SDValue RHS = N->getOperand(2);
22246 if (Cond.getOpcode() == ISD::SIGN_EXTEND) {
22247 SDValue CondSrc = Cond->getOperand(0);
22248 if (CondSrc->getOpcode() == ISD::SIGN_EXTEND_INREG)
22249 Cond = CondSrc->getOperand(0);
22252 MVT VT = N->getSimpleValueType(0);
22253 MVT EltVT = VT.getVectorElementType();
22254 unsigned NumElems = VT.getVectorNumElements();
22255 // There is no blend with immediate in AVX-512.
22256 if (VT.is512BitVector())
22259 if (!Subtarget->hasSSE41() || EltVT == MVT::i8)
22261 if (!Subtarget->hasInt256() && VT == MVT::v16i16)
22264 if (!ISD::isBuildVectorOfConstantSDNodes(Cond.getNode()))
22267 // A vselect where all conditions and data are constants can be optimized into
22268 // a single vector load by SelectionDAGLegalize::ExpandBUILD_VECTOR().
22269 if (ISD::isBuildVectorOfConstantSDNodes(LHS.getNode()) &&
22270 ISD::isBuildVectorOfConstantSDNodes(RHS.getNode()))
22273 unsigned MaskValue = 0;
22274 if (!BUILD_VECTORtoBlendMask(cast<BuildVectorSDNode>(Cond), MaskValue))
22277 SmallVector<int, 8> ShuffleMask(NumElems, -1);
22278 for (unsigned i = 0; i < NumElems; ++i) {
22279 // Be sure we emit undef where we can.
22280 if (Cond.getOperand(i)->getOpcode() == ISD::UNDEF)
22281 ShuffleMask[i] = -1;
22283 ShuffleMask[i] = i + NumElems * ((MaskValue >> i) & 1);
22286 return DAG.getVectorShuffle(VT, dl, LHS, RHS, &ShuffleMask[0]);
22289 /// PerformSELECTCombine - Do target-specific dag combines on SELECT and VSELECT
22291 static SDValue PerformSELECTCombine(SDNode *N, SelectionDAG &DAG,
22292 TargetLowering::DAGCombinerInfo &DCI,
22293 const X86Subtarget *Subtarget) {
22295 SDValue Cond = N->getOperand(0);
22296 // Get the LHS/RHS of the select.
22297 SDValue LHS = N->getOperand(1);
22298 SDValue RHS = N->getOperand(2);
22299 EVT VT = LHS.getValueType();
22300 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
22302 // If we have SSE[12] support, try to form min/max nodes. SSE min/max
22303 // instructions match the semantics of the common C idiom x<y?x:y but not
22304 // x<=y?x:y, because of how they handle negative zero (which can be
22305 // ignored in unsafe-math mode).
22306 if (Cond.getOpcode() == ISD::SETCC && VT.isFloatingPoint() &&
22307 VT != MVT::f80 && TLI.isTypeLegal(VT) &&
22308 (Subtarget->hasSSE2() ||
22309 (Subtarget->hasSSE1() && VT.getScalarType() == MVT::f32))) {
22310 ISD::CondCode CC = cast<CondCodeSDNode>(Cond.getOperand(2))->get();
22312 unsigned Opcode = 0;
22313 // Check for x CC y ? x : y.
22314 if (DAG.isEqualTo(LHS, Cond.getOperand(0)) &&
22315 DAG.isEqualTo(RHS, Cond.getOperand(1))) {
22319 // Converting this to a min would handle NaNs incorrectly, and swapping
22320 // the operands would cause it to handle comparisons between positive
22321 // and negative zero incorrectly.
22322 if (!DAG.isKnownNeverNaN(LHS) || !DAG.isKnownNeverNaN(RHS)) {
22323 if (!DAG.getTarget().Options.UnsafeFPMath &&
22324 !(DAG.isKnownNeverZero(LHS) || DAG.isKnownNeverZero(RHS)))
22326 std::swap(LHS, RHS);
22328 Opcode = X86ISD::FMIN;
22331 // Converting this to a min would handle comparisons between positive
22332 // and negative zero incorrectly.
22333 if (!DAG.getTarget().Options.UnsafeFPMath &&
22334 !DAG.isKnownNeverZero(LHS) && !DAG.isKnownNeverZero(RHS))
22336 Opcode = X86ISD::FMIN;
22339 // Converting this to a min would handle both negative zeros and NaNs
22340 // incorrectly, but we can swap the operands to fix both.
22341 std::swap(LHS, RHS);
22345 Opcode = X86ISD::FMIN;
22349 // Converting this to a max would handle comparisons between positive
22350 // and negative zero incorrectly.
22351 if (!DAG.getTarget().Options.UnsafeFPMath &&
22352 !DAG.isKnownNeverZero(LHS) && !DAG.isKnownNeverZero(RHS))
22354 Opcode = X86ISD::FMAX;
22357 // Converting this to a max would handle NaNs incorrectly, and swapping
22358 // the operands would cause it to handle comparisons between positive
22359 // and negative zero incorrectly.
22360 if (!DAG.isKnownNeverNaN(LHS) || !DAG.isKnownNeverNaN(RHS)) {
22361 if (!DAG.getTarget().Options.UnsafeFPMath &&
22362 !(DAG.isKnownNeverZero(LHS) || DAG.isKnownNeverZero(RHS)))
22364 std::swap(LHS, RHS);
22366 Opcode = X86ISD::FMAX;
22369 // Converting this to a max would handle both negative zeros and NaNs
22370 // incorrectly, but we can swap the operands to fix both.
22371 std::swap(LHS, RHS);
22375 Opcode = X86ISD::FMAX;
22378 // Check for x CC y ? y : x -- a min/max with reversed arms.
22379 } else if (DAG.isEqualTo(LHS, Cond.getOperand(1)) &&
22380 DAG.isEqualTo(RHS, Cond.getOperand(0))) {
22384 // Converting this to a min would handle comparisons between positive
22385 // and negative zero incorrectly, and swapping the operands would
22386 // cause it to handle NaNs incorrectly.
22387 if (!DAG.getTarget().Options.UnsafeFPMath &&
22388 !(DAG.isKnownNeverZero(LHS) || DAG.isKnownNeverZero(RHS))) {
22389 if (!DAG.isKnownNeverNaN(LHS) || !DAG.isKnownNeverNaN(RHS))
22391 std::swap(LHS, RHS);
22393 Opcode = X86ISD::FMIN;
22396 // Converting this to a min would handle NaNs incorrectly.
22397 if (!DAG.getTarget().Options.UnsafeFPMath &&
22398 (!DAG.isKnownNeverNaN(LHS) || !DAG.isKnownNeverNaN(RHS)))
22400 Opcode = X86ISD::FMIN;
22403 // Converting this to a min would handle both negative zeros and NaNs
22404 // incorrectly, but we can swap the operands to fix both.
22405 std::swap(LHS, RHS);
22409 Opcode = X86ISD::FMIN;
22413 // Converting this to a max would handle NaNs incorrectly.
22414 if (!DAG.isKnownNeverNaN(LHS) || !DAG.isKnownNeverNaN(RHS))
22416 Opcode = X86ISD::FMAX;
22419 // Converting this to a max would handle comparisons between positive
22420 // and negative zero incorrectly, and swapping the operands would
22421 // cause it to handle NaNs incorrectly.
22422 if (!DAG.getTarget().Options.UnsafeFPMath &&
22423 !DAG.isKnownNeverZero(LHS) && !DAG.isKnownNeverZero(RHS)) {
22424 if (!DAG.isKnownNeverNaN(LHS) || !DAG.isKnownNeverNaN(RHS))
22426 std::swap(LHS, RHS);
22428 Opcode = X86ISD::FMAX;
22431 // Converting this to a max would handle both negative zeros and NaNs
22432 // incorrectly, but we can swap the operands to fix both.
22433 std::swap(LHS, RHS);
22437 Opcode = X86ISD::FMAX;
22443 return DAG.getNode(Opcode, DL, N->getValueType(0), LHS, RHS);
22446 EVT CondVT = Cond.getValueType();
22447 if (Subtarget->hasAVX512() && VT.isVector() && CondVT.isVector() &&
22448 CondVT.getVectorElementType() == MVT::i1) {
22449 // v16i8 (select v16i1, v16i8, v16i8) does not have a proper
22450 // lowering on KNL. In this case we convert it to
22451 // v16i8 (select v16i8, v16i8, v16i8) and use AVX instruction.
22452 // The same situation for all 128 and 256-bit vectors of i8 and i16.
22453 // Since SKX these selects have a proper lowering.
22454 EVT OpVT = LHS.getValueType();
22455 if ((OpVT.is128BitVector() || OpVT.is256BitVector()) &&
22456 (OpVT.getVectorElementType() == MVT::i8 ||
22457 OpVT.getVectorElementType() == MVT::i16) &&
22458 !(Subtarget->hasBWI() && Subtarget->hasVLX())) {
22459 Cond = DAG.getNode(ISD::SIGN_EXTEND, DL, OpVT, Cond);
22460 DCI.AddToWorklist(Cond.getNode());
22461 return DAG.getNode(N->getOpcode(), DL, OpVT, Cond, LHS, RHS);
22464 // If this is a select between two integer constants, try to do some
22466 if (ConstantSDNode *TrueC = dyn_cast<ConstantSDNode>(LHS)) {
22467 if (ConstantSDNode *FalseC = dyn_cast<ConstantSDNode>(RHS))
22468 // Don't do this for crazy integer types.
22469 if (DAG.getTargetLoweringInfo().isTypeLegal(LHS.getValueType())) {
22470 // If this is efficiently invertible, canonicalize the LHSC/RHSC values
22471 // so that TrueC (the true value) is larger than FalseC.
22472 bool NeedsCondInvert = false;
22474 if (TrueC->getAPIntValue().ult(FalseC->getAPIntValue()) &&
22475 // Efficiently invertible.
22476 (Cond.getOpcode() == ISD::SETCC || // setcc -> invertible.
22477 (Cond.getOpcode() == ISD::XOR && // xor(X, C) -> invertible.
22478 isa<ConstantSDNode>(Cond.getOperand(1))))) {
22479 NeedsCondInvert = true;
22480 std::swap(TrueC, FalseC);
22483 // Optimize C ? 8 : 0 -> zext(C) << 3. Likewise for any pow2/0.
22484 if (FalseC->getAPIntValue() == 0 &&
22485 TrueC->getAPIntValue().isPowerOf2()) {
22486 if (NeedsCondInvert) // Invert the condition if needed.
22487 Cond = DAG.getNode(ISD::XOR, DL, Cond.getValueType(), Cond,
22488 DAG.getConstant(1, Cond.getValueType()));
22490 // Zero extend the condition if needed.
22491 Cond = DAG.getNode(ISD::ZERO_EXTEND, DL, LHS.getValueType(), Cond);
22493 unsigned ShAmt = TrueC->getAPIntValue().logBase2();
22494 return DAG.getNode(ISD::SHL, DL, LHS.getValueType(), Cond,
22495 DAG.getConstant(ShAmt, MVT::i8));
22498 // Optimize Cond ? cst+1 : cst -> zext(setcc(C)+cst.
22499 if (FalseC->getAPIntValue()+1 == TrueC->getAPIntValue()) {
22500 if (NeedsCondInvert) // Invert the condition if needed.
22501 Cond = DAG.getNode(ISD::XOR, DL, Cond.getValueType(), Cond,
22502 DAG.getConstant(1, Cond.getValueType()));
22504 // Zero extend the condition if needed.
22505 Cond = DAG.getNode(ISD::ZERO_EXTEND, DL,
22506 FalseC->getValueType(0), Cond);
22507 return DAG.getNode(ISD::ADD, DL, Cond.getValueType(), Cond,
22508 SDValue(FalseC, 0));
22511 // Optimize cases that will turn into an LEA instruction. This requires
22512 // an i32 or i64 and an efficient multiplier (1, 2, 3, 4, 5, 8, 9).
22513 if (N->getValueType(0) == MVT::i32 || N->getValueType(0) == MVT::i64) {
22514 uint64_t Diff = TrueC->getZExtValue()-FalseC->getZExtValue();
22515 if (N->getValueType(0) == MVT::i32) Diff = (unsigned)Diff;
22517 bool isFastMultiplier = false;
22519 switch ((unsigned char)Diff) {
22521 case 1: // result = add base, cond
22522 case 2: // result = lea base( , cond*2)
22523 case 3: // result = lea base(cond, cond*2)
22524 case 4: // result = lea base( , cond*4)
22525 case 5: // result = lea base(cond, cond*4)
22526 case 8: // result = lea base( , cond*8)
22527 case 9: // result = lea base(cond, cond*8)
22528 isFastMultiplier = true;
22533 if (isFastMultiplier) {
22534 APInt Diff = TrueC->getAPIntValue()-FalseC->getAPIntValue();
22535 if (NeedsCondInvert) // Invert the condition if needed.
22536 Cond = DAG.getNode(ISD::XOR, DL, Cond.getValueType(), Cond,
22537 DAG.getConstant(1, Cond.getValueType()));
22539 // Zero extend the condition if needed.
22540 Cond = DAG.getNode(ISD::ZERO_EXTEND, DL, FalseC->getValueType(0),
22542 // Scale the condition by the difference.
22544 Cond = DAG.getNode(ISD::MUL, DL, Cond.getValueType(), Cond,
22545 DAG.getConstant(Diff, Cond.getValueType()));
22547 // Add the base if non-zero.
22548 if (FalseC->getAPIntValue() != 0)
22549 Cond = DAG.getNode(ISD::ADD, DL, Cond.getValueType(), Cond,
22550 SDValue(FalseC, 0));
22557 // Canonicalize max and min:
22558 // (x > y) ? x : y -> (x >= y) ? x : y
22559 // (x < y) ? x : y -> (x <= y) ? x : y
22560 // This allows use of COND_S / COND_NS (see TranslateX86CC) which eliminates
22561 // the need for an extra compare
22562 // against zero. e.g.
22563 // (x - y) > 0 : (x - y) ? 0 -> (x - y) >= 0 : (x - y) ? 0
22565 // testl %edi, %edi
22567 // cmovgl %edi, %eax
22571 // cmovsl %eax, %edi
22572 if (N->getOpcode() == ISD::SELECT && Cond.getOpcode() == ISD::SETCC &&
22573 DAG.isEqualTo(LHS, Cond.getOperand(0)) &&
22574 DAG.isEqualTo(RHS, Cond.getOperand(1))) {
22575 ISD::CondCode CC = cast<CondCodeSDNode>(Cond.getOperand(2))->get();
22580 ISD::CondCode NewCC = (CC == ISD::SETLT) ? ISD::SETLE : ISD::SETGE;
22581 Cond = DAG.getSetCC(SDLoc(Cond), Cond.getValueType(),
22582 Cond.getOperand(0), Cond.getOperand(1), NewCC);
22583 return DAG.getNode(ISD::SELECT, DL, VT, Cond, LHS, RHS);
22588 // Early exit check
22589 if (!TLI.isTypeLegal(VT))
22592 // Match VSELECTs into subs with unsigned saturation.
22593 if (N->getOpcode() == ISD::VSELECT && Cond.getOpcode() == ISD::SETCC &&
22594 // psubus is available in SSE2 and AVX2 for i8 and i16 vectors.
22595 ((Subtarget->hasSSE2() && (VT == MVT::v16i8 || VT == MVT::v8i16)) ||
22596 (Subtarget->hasAVX2() && (VT == MVT::v32i8 || VT == MVT::v16i16)))) {
22597 ISD::CondCode CC = cast<CondCodeSDNode>(Cond.getOperand(2))->get();
22599 // Check if one of the arms of the VSELECT is a zero vector. If it's on the
22600 // left side invert the predicate to simplify logic below.
22602 if (ISD::isBuildVectorAllZeros(LHS.getNode())) {
22604 CC = ISD::getSetCCInverse(CC, true);
22605 } else if (ISD::isBuildVectorAllZeros(RHS.getNode())) {
22609 if (Other.getNode() && Other->getNumOperands() == 2 &&
22610 DAG.isEqualTo(Other->getOperand(0), Cond.getOperand(0))) {
22611 SDValue OpLHS = Other->getOperand(0), OpRHS = Other->getOperand(1);
22612 SDValue CondRHS = Cond->getOperand(1);
22614 // Look for a general sub with unsigned saturation first.
22615 // x >= y ? x-y : 0 --> subus x, y
22616 // x > y ? x-y : 0 --> subus x, y
22617 if ((CC == ISD::SETUGE || CC == ISD::SETUGT) &&
22618 Other->getOpcode() == ISD::SUB && DAG.isEqualTo(OpRHS, CondRHS))
22619 return DAG.getNode(X86ISD::SUBUS, DL, VT, OpLHS, OpRHS);
22621 if (auto *OpRHSBV = dyn_cast<BuildVectorSDNode>(OpRHS))
22622 if (auto *OpRHSConst = OpRHSBV->getConstantSplatNode()) {
22623 if (auto *CondRHSBV = dyn_cast<BuildVectorSDNode>(CondRHS))
22624 if (auto *CondRHSConst = CondRHSBV->getConstantSplatNode())
22625 // If the RHS is a constant we have to reverse the const
22626 // canonicalization.
22627 // x > C-1 ? x+-C : 0 --> subus x, C
22628 if (CC == ISD::SETUGT && Other->getOpcode() == ISD::ADD &&
22629 CondRHSConst->getAPIntValue() ==
22630 (-OpRHSConst->getAPIntValue() - 1))
22631 return DAG.getNode(
22632 X86ISD::SUBUS, DL, VT, OpLHS,
22633 DAG.getConstant(-OpRHSConst->getAPIntValue(), VT));
22635 // Another special case: If C was a sign bit, the sub has been
22636 // canonicalized into a xor.
22637 // FIXME: Would it be better to use computeKnownBits to determine
22638 // whether it's safe to decanonicalize the xor?
22639 // x s< 0 ? x^C : 0 --> subus x, C
22640 if (CC == ISD::SETLT && Other->getOpcode() == ISD::XOR &&
22641 ISD::isBuildVectorAllZeros(CondRHS.getNode()) &&
22642 OpRHSConst->getAPIntValue().isSignBit())
22643 // Note that we have to rebuild the RHS constant here to ensure we
22644 // don't rely on particular values of undef lanes.
22645 return DAG.getNode(
22646 X86ISD::SUBUS, DL, VT, OpLHS,
22647 DAG.getConstant(OpRHSConst->getAPIntValue(), VT));
22652 // Try to match a min/max vector operation.
22653 if (N->getOpcode() == ISD::VSELECT && Cond.getOpcode() == ISD::SETCC) {
22654 std::pair<unsigned, bool> ret = matchIntegerMINMAX(Cond, VT, LHS, RHS, DAG, Subtarget);
22655 unsigned Opc = ret.first;
22656 bool NeedSplit = ret.second;
22658 if (Opc && NeedSplit) {
22659 unsigned NumElems = VT.getVectorNumElements();
22660 // Extract the LHS vectors
22661 SDValue LHS1 = Extract128BitVector(LHS, 0, DAG, DL);
22662 SDValue LHS2 = Extract128BitVector(LHS, NumElems/2, DAG, DL);
22664 // Extract the RHS vectors
22665 SDValue RHS1 = Extract128BitVector(RHS, 0, DAG, DL);
22666 SDValue RHS2 = Extract128BitVector(RHS, NumElems/2, DAG, DL);
22668 // Create min/max for each subvector
22669 LHS = DAG.getNode(Opc, DL, LHS1.getValueType(), LHS1, RHS1);
22670 RHS = DAG.getNode(Opc, DL, LHS2.getValueType(), LHS2, RHS2);
22672 // Merge the result
22673 return DAG.getNode(ISD::CONCAT_VECTORS, DL, VT, LHS, RHS);
22675 return DAG.getNode(Opc, DL, VT, LHS, RHS);
22678 // Simplify vector selection if condition value type matches vselect
22680 if (N->getOpcode() == ISD::VSELECT && CondVT == VT) {
22681 assert(Cond.getValueType().isVector() &&
22682 "vector select expects a vector selector!");
22684 bool TValIsAllOnes = ISD::isBuildVectorAllOnes(LHS.getNode());
22685 bool FValIsAllZeros = ISD::isBuildVectorAllZeros(RHS.getNode());
22687 // Try invert the condition if true value is not all 1s and false value
22689 if (!TValIsAllOnes && !FValIsAllZeros &&
22690 // Check if the selector will be produced by CMPP*/PCMP*
22691 Cond.getOpcode() == ISD::SETCC &&
22692 // Check if SETCC has already been promoted
22693 TLI.getSetCCResultType(*DAG.getContext(), VT) == CondVT) {
22694 bool TValIsAllZeros = ISD::isBuildVectorAllZeros(LHS.getNode());
22695 bool FValIsAllOnes = ISD::isBuildVectorAllOnes(RHS.getNode());
22697 if (TValIsAllZeros || FValIsAllOnes) {
22698 SDValue CC = Cond.getOperand(2);
22699 ISD::CondCode NewCC =
22700 ISD::getSetCCInverse(cast<CondCodeSDNode>(CC)->get(),
22701 Cond.getOperand(0).getValueType().isInteger());
22702 Cond = DAG.getSetCC(DL, CondVT, Cond.getOperand(0), Cond.getOperand(1), NewCC);
22703 std::swap(LHS, RHS);
22704 TValIsAllOnes = FValIsAllOnes;
22705 FValIsAllZeros = TValIsAllZeros;
22709 if (TValIsAllOnes || FValIsAllZeros) {
22712 if (TValIsAllOnes && FValIsAllZeros)
22714 else if (TValIsAllOnes)
22715 Ret = DAG.getNode(ISD::OR, DL, CondVT, Cond,
22716 DAG.getNode(ISD::BITCAST, DL, CondVT, RHS));
22717 else if (FValIsAllZeros)
22718 Ret = DAG.getNode(ISD::AND, DL, CondVT, Cond,
22719 DAG.getNode(ISD::BITCAST, DL, CondVT, LHS));
22721 return DAG.getNode(ISD::BITCAST, DL, VT, Ret);
22725 // Try to fold this VSELECT into a MOVSS/MOVSD
22726 if (N->getOpcode() == ISD::VSELECT &&
22727 Cond.getOpcode() == ISD::BUILD_VECTOR && !DCI.isBeforeLegalize()) {
22728 if (VT == MVT::v4i32 || VT == MVT::v4f32 ||
22729 (Subtarget->hasSSE2() && (VT == MVT::v2i64 || VT == MVT::v2f64))) {
22730 bool CanFold = false;
22731 unsigned NumElems = Cond.getNumOperands();
22735 if (isZero(Cond.getOperand(0))) {
22738 // fold (vselect <0,-1,-1,-1>, A, B) -> (movss A, B)
22739 // fold (vselect <0,-1> -> (movsd A, B)
22740 for (unsigned i = 1, e = NumElems; i != e && CanFold; ++i)
22741 CanFold = isAllOnes(Cond.getOperand(i));
22742 } else if (isAllOnes(Cond.getOperand(0))) {
22746 // fold (vselect <-1,0,0,0>, A, B) -> (movss B, A)
22747 // fold (vselect <-1,0> -> (movsd B, A)
22748 for (unsigned i = 1, e = NumElems; i != e && CanFold; ++i)
22749 CanFold = isZero(Cond.getOperand(i));
22753 if (VT == MVT::v4i32 || VT == MVT::v4f32)
22754 return getTargetShuffleNode(X86ISD::MOVSS, DL, VT, A, B, DAG);
22755 return getTargetShuffleNode(X86ISD::MOVSD, DL, VT, A, B, DAG);
22758 if (Subtarget->hasSSE2() && (VT == MVT::v4i32 || VT == MVT::v4f32)) {
22759 // fold (v4i32: vselect <0,0,-1,-1>, A, B) ->
22760 // (v4i32 (bitcast (movsd (v2i64 (bitcast A)),
22761 // (v2i64 (bitcast B)))))
22763 // fold (v4f32: vselect <0,0,-1,-1>, A, B) ->
22764 // (v4f32 (bitcast (movsd (v2f64 (bitcast A)),
22765 // (v2f64 (bitcast B)))))
22767 // fold (v4i32: vselect <-1,-1,0,0>, A, B) ->
22768 // (v4i32 (bitcast (movsd (v2i64 (bitcast B)),
22769 // (v2i64 (bitcast A)))))
22771 // fold (v4f32: vselect <-1,-1,0,0>, A, B) ->
22772 // (v4f32 (bitcast (movsd (v2f64 (bitcast B)),
22773 // (v2f64 (bitcast A)))))
22775 CanFold = (isZero(Cond.getOperand(0)) &&
22776 isZero(Cond.getOperand(1)) &&
22777 isAllOnes(Cond.getOperand(2)) &&
22778 isAllOnes(Cond.getOperand(3)));
22780 if (!CanFold && isAllOnes(Cond.getOperand(0)) &&
22781 isAllOnes(Cond.getOperand(1)) &&
22782 isZero(Cond.getOperand(2)) &&
22783 isZero(Cond.getOperand(3))) {
22785 std::swap(LHS, RHS);
22789 EVT NVT = (VT == MVT::v4i32) ? MVT::v2i64 : MVT::v2f64;
22790 SDValue NewA = DAG.getNode(ISD::BITCAST, DL, NVT, LHS);
22791 SDValue NewB = DAG.getNode(ISD::BITCAST, DL, NVT, RHS);
22792 SDValue Select = getTargetShuffleNode(X86ISD::MOVSD, DL, NVT, NewA,
22794 return DAG.getNode(ISD::BITCAST, DL, VT, Select);
22800 // If we know that this node is legal then we know that it is going to be
22801 // matched by one of the SSE/AVX BLEND instructions. These instructions only
22802 // depend on the highest bit in each word. Try to use SimplifyDemandedBits
22803 // to simplify previous instructions.
22804 if (N->getOpcode() == ISD::VSELECT && DCI.isBeforeLegalizeOps() &&
22805 !DCI.isBeforeLegalize() &&
22806 // We explicitly check against v8i16 and v16i16 because, although
22807 // they're marked as Custom, they might only be legal when Cond is a
22808 // build_vector of constants. This will be taken care in a later
22810 (TLI.isOperationLegalOrCustom(ISD::VSELECT, VT) && VT != MVT::v16i16 &&
22811 VT != MVT::v8i16) &&
22812 // Don't optimize vector of constants. Those are handled by
22813 // the generic code and all the bits must be properly set for
22814 // the generic optimizer.
22815 !ISD::isBuildVectorOfConstantSDNodes(Cond.getNode())) {
22816 unsigned BitWidth = Cond.getValueType().getScalarType().getSizeInBits();
22818 // Don't optimize vector selects that map to mask-registers.
22822 assert(BitWidth >= 8 && BitWidth <= 64 && "Invalid mask size");
22823 APInt DemandedMask = APInt::getHighBitsSet(BitWidth, 1);
22825 APInt KnownZero, KnownOne;
22826 TargetLowering::TargetLoweringOpt TLO(DAG, DCI.isBeforeLegalize(),
22827 DCI.isBeforeLegalizeOps());
22828 if (TLO.ShrinkDemandedConstant(Cond, DemandedMask) ||
22829 TLI.SimplifyDemandedBits(Cond, DemandedMask, KnownZero, KnownOne,
22831 // If we changed the computation somewhere in the DAG, this change
22832 // will affect all users of Cond.
22833 // Make sure it is fine and update all the nodes so that we do not
22834 // use the generic VSELECT anymore. Otherwise, we may perform
22835 // wrong optimizations as we messed up with the actual expectation
22836 // for the vector boolean values.
22837 if (Cond != TLO.Old) {
22838 // Check all uses of that condition operand to check whether it will be
22839 // consumed by non-BLEND instructions, which may depend on all bits are
22841 for (SDNode::use_iterator I = Cond->use_begin(), E = Cond->use_end();
22843 if (I->getOpcode() != ISD::VSELECT)
22844 // TODO: Add other opcodes eventually lowered into BLEND.
22847 // Update all the users of the condition, before committing the change,
22848 // so that the VSELECT optimizations that expect the correct vector
22849 // boolean value will not be triggered.
22850 for (SDNode::use_iterator I = Cond->use_begin(), E = Cond->use_end();
22852 DAG.ReplaceAllUsesOfValueWith(
22854 DAG.getNode(X86ISD::SHRUNKBLEND, SDLoc(*I), I->getValueType(0),
22855 Cond, I->getOperand(1), I->getOperand(2)));
22856 DCI.CommitTargetLoweringOpt(TLO);
22859 // At this point, only Cond is changed. Change the condition
22860 // just for N to keep the opportunity to optimize all other
22861 // users their own way.
22862 DAG.ReplaceAllUsesOfValueWith(
22864 DAG.getNode(X86ISD::SHRUNKBLEND, SDLoc(N), N->getValueType(0),
22865 TLO.New, N->getOperand(1), N->getOperand(2)));
22870 // We should generate an X86ISD::BLENDI from a vselect if its argument
22871 // is a sign_extend_inreg of an any_extend of a BUILD_VECTOR of
22872 // constants. This specific pattern gets generated when we split a
22873 // selector for a 512 bit vector in a machine without AVX512 (but with
22874 // 256-bit vectors), during legalization:
22876 // (vselect (sign_extend (any_extend (BUILD_VECTOR)) i1) LHS RHS)
22878 // Iff we find this pattern and the build_vectors are built from
22879 // constants, we translate the vselect into a shuffle_vector that we
22880 // know will be matched by LowerVECTOR_SHUFFLEtoBlend.
22881 if ((N->getOpcode() == ISD::VSELECT ||
22882 N->getOpcode() == X86ISD::SHRUNKBLEND) &&
22883 !DCI.isBeforeLegalize()) {
22884 SDValue Shuffle = TransformVSELECTtoBlendVECTOR_SHUFFLE(N, DAG, Subtarget);
22885 if (Shuffle.getNode())
22892 // Check whether a boolean test is testing a boolean value generated by
22893 // X86ISD::SETCC. If so, return the operand of that SETCC and proper condition
22896 // Simplify the following patterns:
22897 // (Op (CMP (SETCC Cond EFLAGS) 1) EQ) or
22898 // (Op (CMP (SETCC Cond EFLAGS) 0) NEQ)
22899 // to (Op EFLAGS Cond)
22901 // (Op (CMP (SETCC Cond EFLAGS) 0) EQ) or
22902 // (Op (CMP (SETCC Cond EFLAGS) 1) NEQ)
22903 // to (Op EFLAGS !Cond)
22905 // where Op could be BRCOND or CMOV.
22907 static SDValue checkBoolTestSetCCCombine(SDValue Cmp, X86::CondCode &CC) {
22908 // Quit if not CMP and SUB with its value result used.
22909 if (Cmp.getOpcode() != X86ISD::CMP &&
22910 (Cmp.getOpcode() != X86ISD::SUB || Cmp.getNode()->hasAnyUseOfValue(0)))
22913 // Quit if not used as a boolean value.
22914 if (CC != X86::COND_E && CC != X86::COND_NE)
22917 // Check CMP operands. One of them should be 0 or 1 and the other should be
22918 // an SetCC or extended from it.
22919 SDValue Op1 = Cmp.getOperand(0);
22920 SDValue Op2 = Cmp.getOperand(1);
22923 const ConstantSDNode* C = nullptr;
22924 bool needOppositeCond = (CC == X86::COND_E);
22925 bool checkAgainstTrue = false; // Is it a comparison against 1?
22927 if ((C = dyn_cast<ConstantSDNode>(Op1)))
22929 else if ((C = dyn_cast<ConstantSDNode>(Op2)))
22931 else // Quit if all operands are not constants.
22934 if (C->getZExtValue() == 1) {
22935 needOppositeCond = !needOppositeCond;
22936 checkAgainstTrue = true;
22937 } else if (C->getZExtValue() != 0)
22938 // Quit if the constant is neither 0 or 1.
22941 bool truncatedToBoolWithAnd = false;
22942 // Skip (zext $x), (trunc $x), or (and $x, 1) node.
22943 while (SetCC.getOpcode() == ISD::ZERO_EXTEND ||
22944 SetCC.getOpcode() == ISD::TRUNCATE ||
22945 SetCC.getOpcode() == ISD::AND) {
22946 if (SetCC.getOpcode() == ISD::AND) {
22948 ConstantSDNode *CS;
22949 if ((CS = dyn_cast<ConstantSDNode>(SetCC.getOperand(0))) &&
22950 CS->getZExtValue() == 1)
22952 if ((CS = dyn_cast<ConstantSDNode>(SetCC.getOperand(1))) &&
22953 CS->getZExtValue() == 1)
22957 SetCC = SetCC.getOperand(OpIdx);
22958 truncatedToBoolWithAnd = true;
22960 SetCC = SetCC.getOperand(0);
22963 switch (SetCC.getOpcode()) {
22964 case X86ISD::SETCC_CARRY:
22965 // Since SETCC_CARRY gives output based on R = CF ? ~0 : 0, it's unsafe to
22966 // simplify it if the result of SETCC_CARRY is not canonicalized to 0 or 1,
22967 // i.e. it's a comparison against true but the result of SETCC_CARRY is not
22968 // truncated to i1 using 'and'.
22969 if (checkAgainstTrue && !truncatedToBoolWithAnd)
22971 assert(X86::CondCode(SetCC.getConstantOperandVal(0)) == X86::COND_B &&
22972 "Invalid use of SETCC_CARRY!");
22974 case X86ISD::SETCC:
22975 // Set the condition code or opposite one if necessary.
22976 CC = X86::CondCode(SetCC.getConstantOperandVal(0));
22977 if (needOppositeCond)
22978 CC = X86::GetOppositeBranchCondition(CC);
22979 return SetCC.getOperand(1);
22980 case X86ISD::CMOV: {
22981 // Check whether false/true value has canonical one, i.e. 0 or 1.
22982 ConstantSDNode *FVal = dyn_cast<ConstantSDNode>(SetCC.getOperand(0));
22983 ConstantSDNode *TVal = dyn_cast<ConstantSDNode>(SetCC.getOperand(1));
22984 // Quit if true value is not a constant.
22987 // Quit if false value is not a constant.
22989 SDValue Op = SetCC.getOperand(0);
22990 // Skip 'zext' or 'trunc' node.
22991 if (Op.getOpcode() == ISD::ZERO_EXTEND ||
22992 Op.getOpcode() == ISD::TRUNCATE)
22993 Op = Op.getOperand(0);
22994 // A special case for rdrand/rdseed, where 0 is set if false cond is
22996 if ((Op.getOpcode() != X86ISD::RDRAND &&
22997 Op.getOpcode() != X86ISD::RDSEED) || Op.getResNo() != 0)
23000 // Quit if false value is not the constant 0 or 1.
23001 bool FValIsFalse = true;
23002 if (FVal && FVal->getZExtValue() != 0) {
23003 if (FVal->getZExtValue() != 1)
23005 // If FVal is 1, opposite cond is needed.
23006 needOppositeCond = !needOppositeCond;
23007 FValIsFalse = false;
23009 // Quit if TVal is not the constant opposite of FVal.
23010 if (FValIsFalse && TVal->getZExtValue() != 1)
23012 if (!FValIsFalse && TVal->getZExtValue() != 0)
23014 CC = X86::CondCode(SetCC.getConstantOperandVal(2));
23015 if (needOppositeCond)
23016 CC = X86::GetOppositeBranchCondition(CC);
23017 return SetCC.getOperand(3);
23024 /// Optimize X86ISD::CMOV [LHS, RHS, CONDCODE (e.g. X86::COND_NE), CONDVAL]
23025 static SDValue PerformCMOVCombine(SDNode *N, SelectionDAG &DAG,
23026 TargetLowering::DAGCombinerInfo &DCI,
23027 const X86Subtarget *Subtarget) {
23030 // If the flag operand isn't dead, don't touch this CMOV.
23031 if (N->getNumValues() == 2 && !SDValue(N, 1).use_empty())
23034 SDValue FalseOp = N->getOperand(0);
23035 SDValue TrueOp = N->getOperand(1);
23036 X86::CondCode CC = (X86::CondCode)N->getConstantOperandVal(2);
23037 SDValue Cond = N->getOperand(3);
23039 if (CC == X86::COND_E || CC == X86::COND_NE) {
23040 switch (Cond.getOpcode()) {
23044 // If operand of BSR / BSF are proven never zero, then ZF cannot be set.
23045 if (DAG.isKnownNeverZero(Cond.getOperand(0)))
23046 return (CC == X86::COND_E) ? FalseOp : TrueOp;
23052 Flags = checkBoolTestSetCCCombine(Cond, CC);
23053 if (Flags.getNode() &&
23054 // Extra check as FCMOV only supports a subset of X86 cond.
23055 (FalseOp.getValueType() != MVT::f80 || hasFPCMov(CC))) {
23056 SDValue Ops[] = { FalseOp, TrueOp,
23057 DAG.getConstant(CC, MVT::i8), Flags };
23058 return DAG.getNode(X86ISD::CMOV, DL, N->getVTList(), Ops);
23061 // If this is a select between two integer constants, try to do some
23062 // optimizations. Note that the operands are ordered the opposite of SELECT
23064 if (ConstantSDNode *TrueC = dyn_cast<ConstantSDNode>(TrueOp)) {
23065 if (ConstantSDNode *FalseC = dyn_cast<ConstantSDNode>(FalseOp)) {
23066 // Canonicalize the TrueC/FalseC values so that TrueC (the true value) is
23067 // larger than FalseC (the false value).
23068 if (TrueC->getAPIntValue().ult(FalseC->getAPIntValue())) {
23069 CC = X86::GetOppositeBranchCondition(CC);
23070 std::swap(TrueC, FalseC);
23071 std::swap(TrueOp, FalseOp);
23074 // Optimize C ? 8 : 0 -> zext(setcc(C)) << 3. Likewise for any pow2/0.
23075 // This is efficient for any integer data type (including i8/i16) and
23077 if (FalseC->getAPIntValue() == 0 && TrueC->getAPIntValue().isPowerOf2()) {
23078 Cond = DAG.getNode(X86ISD::SETCC, DL, MVT::i8,
23079 DAG.getConstant(CC, MVT::i8), Cond);
23081 // Zero extend the condition if needed.
23082 Cond = DAG.getNode(ISD::ZERO_EXTEND, DL, TrueC->getValueType(0), Cond);
23084 unsigned ShAmt = TrueC->getAPIntValue().logBase2();
23085 Cond = DAG.getNode(ISD::SHL, DL, Cond.getValueType(), Cond,
23086 DAG.getConstant(ShAmt, MVT::i8));
23087 if (N->getNumValues() == 2) // Dead flag value?
23088 return DCI.CombineTo(N, Cond, SDValue());
23092 // Optimize Cond ? cst+1 : cst -> zext(setcc(C)+cst. This is efficient
23093 // for any integer data type, including i8/i16.
23094 if (FalseC->getAPIntValue()+1 == TrueC->getAPIntValue()) {
23095 Cond = DAG.getNode(X86ISD::SETCC, DL, MVT::i8,
23096 DAG.getConstant(CC, MVT::i8), Cond);
23098 // Zero extend the condition if needed.
23099 Cond = DAG.getNode(ISD::ZERO_EXTEND, DL,
23100 FalseC->getValueType(0), Cond);
23101 Cond = DAG.getNode(ISD::ADD, DL, Cond.getValueType(), Cond,
23102 SDValue(FalseC, 0));
23104 if (N->getNumValues() == 2) // Dead flag value?
23105 return DCI.CombineTo(N, Cond, SDValue());
23109 // Optimize cases that will turn into an LEA instruction. This requires
23110 // an i32 or i64 and an efficient multiplier (1, 2, 3, 4, 5, 8, 9).
23111 if (N->getValueType(0) == MVT::i32 || N->getValueType(0) == MVT::i64) {
23112 uint64_t Diff = TrueC->getZExtValue()-FalseC->getZExtValue();
23113 if (N->getValueType(0) == MVT::i32) Diff = (unsigned)Diff;
23115 bool isFastMultiplier = false;
23117 switch ((unsigned char)Diff) {
23119 case 1: // result = add base, cond
23120 case 2: // result = lea base( , cond*2)
23121 case 3: // result = lea base(cond, cond*2)
23122 case 4: // result = lea base( , cond*4)
23123 case 5: // result = lea base(cond, cond*4)
23124 case 8: // result = lea base( , cond*8)
23125 case 9: // result = lea base(cond, cond*8)
23126 isFastMultiplier = true;
23131 if (isFastMultiplier) {
23132 APInt Diff = TrueC->getAPIntValue()-FalseC->getAPIntValue();
23133 Cond = DAG.getNode(X86ISD::SETCC, DL, MVT::i8,
23134 DAG.getConstant(CC, MVT::i8), Cond);
23135 // Zero extend the condition if needed.
23136 Cond = DAG.getNode(ISD::ZERO_EXTEND, DL, FalseC->getValueType(0),
23138 // Scale the condition by the difference.
23140 Cond = DAG.getNode(ISD::MUL, DL, Cond.getValueType(), Cond,
23141 DAG.getConstant(Diff, Cond.getValueType()));
23143 // Add the base if non-zero.
23144 if (FalseC->getAPIntValue() != 0)
23145 Cond = DAG.getNode(ISD::ADD, DL, Cond.getValueType(), Cond,
23146 SDValue(FalseC, 0));
23147 if (N->getNumValues() == 2) // Dead flag value?
23148 return DCI.CombineTo(N, Cond, SDValue());
23155 // Handle these cases:
23156 // (select (x != c), e, c) -> select (x != c), e, x),
23157 // (select (x == c), c, e) -> select (x == c), x, e)
23158 // where the c is an integer constant, and the "select" is the combination
23159 // of CMOV and CMP.
23161 // The rationale for this change is that the conditional-move from a constant
23162 // needs two instructions, however, conditional-move from a register needs
23163 // only one instruction.
23165 // CAVEAT: By replacing a constant with a symbolic value, it may obscure
23166 // some instruction-combining opportunities. This opt needs to be
23167 // postponed as late as possible.
23169 if (!DCI.isBeforeLegalize() && !DCI.isBeforeLegalizeOps()) {
23170 // the DCI.xxxx conditions are provided to postpone the optimization as
23171 // late as possible.
23173 ConstantSDNode *CmpAgainst = nullptr;
23174 if ((Cond.getOpcode() == X86ISD::CMP || Cond.getOpcode() == X86ISD::SUB) &&
23175 (CmpAgainst = dyn_cast<ConstantSDNode>(Cond.getOperand(1))) &&
23176 !isa<ConstantSDNode>(Cond.getOperand(0))) {
23178 if (CC == X86::COND_NE &&
23179 CmpAgainst == dyn_cast<ConstantSDNode>(FalseOp)) {
23180 CC = X86::GetOppositeBranchCondition(CC);
23181 std::swap(TrueOp, FalseOp);
23184 if (CC == X86::COND_E &&
23185 CmpAgainst == dyn_cast<ConstantSDNode>(TrueOp)) {
23186 SDValue Ops[] = { FalseOp, Cond.getOperand(0),
23187 DAG.getConstant(CC, MVT::i8), Cond };
23188 return DAG.getNode(X86ISD::CMOV, DL, N->getVTList (), Ops);
23196 static SDValue PerformINTRINSIC_WO_CHAINCombine(SDNode *N, SelectionDAG &DAG,
23197 const X86Subtarget *Subtarget) {
23198 unsigned IntNo = cast<ConstantSDNode>(N->getOperand(0))->getZExtValue();
23200 default: return SDValue();
23201 // SSE/AVX/AVX2 blend intrinsics.
23202 case Intrinsic::x86_avx2_pblendvb:
23203 case Intrinsic::x86_avx2_pblendw:
23204 case Intrinsic::x86_avx2_pblendd_128:
23205 case Intrinsic::x86_avx2_pblendd_256:
23206 // Don't try to simplify this intrinsic if we don't have AVX2.
23207 if (!Subtarget->hasAVX2())
23210 case Intrinsic::x86_avx_blend_pd_256:
23211 case Intrinsic::x86_avx_blend_ps_256:
23212 case Intrinsic::x86_avx_blendv_pd_256:
23213 case Intrinsic::x86_avx_blendv_ps_256:
23214 // Don't try to simplify this intrinsic if we don't have AVX.
23215 if (!Subtarget->hasAVX())
23218 case Intrinsic::x86_sse41_pblendw:
23219 case Intrinsic::x86_sse41_blendpd:
23220 case Intrinsic::x86_sse41_blendps:
23221 case Intrinsic::x86_sse41_blendvps:
23222 case Intrinsic::x86_sse41_blendvpd:
23223 case Intrinsic::x86_sse41_pblendvb: {
23224 SDValue Op0 = N->getOperand(1);
23225 SDValue Op1 = N->getOperand(2);
23226 SDValue Mask = N->getOperand(3);
23228 // Don't try to simplify this intrinsic if we don't have SSE4.1.
23229 if (!Subtarget->hasSSE41())
23232 // fold (blend A, A, Mask) -> A
23235 // fold (blend A, B, allZeros) -> A
23236 if (ISD::isBuildVectorAllZeros(Mask.getNode()))
23238 // fold (blend A, B, allOnes) -> B
23239 if (ISD::isBuildVectorAllOnes(Mask.getNode()))
23242 // Simplify the case where the mask is a constant i32 value.
23243 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Mask)) {
23244 if (C->isNullValue())
23246 if (C->isAllOnesValue())
23253 // Packed SSE2/AVX2 arithmetic shift immediate intrinsics.
23254 case Intrinsic::x86_sse2_psrai_w:
23255 case Intrinsic::x86_sse2_psrai_d:
23256 case Intrinsic::x86_avx2_psrai_w:
23257 case Intrinsic::x86_avx2_psrai_d:
23258 case Intrinsic::x86_sse2_psra_w:
23259 case Intrinsic::x86_sse2_psra_d:
23260 case Intrinsic::x86_avx2_psra_w:
23261 case Intrinsic::x86_avx2_psra_d: {
23262 SDValue Op0 = N->getOperand(1);
23263 SDValue Op1 = N->getOperand(2);
23264 EVT VT = Op0.getValueType();
23265 assert(VT.isVector() && "Expected a vector type!");
23267 if (isa<BuildVectorSDNode>(Op1))
23268 Op1 = Op1.getOperand(0);
23270 if (!isa<ConstantSDNode>(Op1))
23273 EVT SVT = VT.getVectorElementType();
23274 unsigned SVTBits = SVT.getSizeInBits();
23276 ConstantSDNode *CND = cast<ConstantSDNode>(Op1);
23277 const APInt &C = APInt(SVTBits, CND->getAPIntValue().getZExtValue());
23278 uint64_t ShAmt = C.getZExtValue();
23280 // Don't try to convert this shift into a ISD::SRA if the shift
23281 // count is bigger than or equal to the element size.
23282 if (ShAmt >= SVTBits)
23285 // Trivial case: if the shift count is zero, then fold this
23286 // into the first operand.
23290 // Replace this packed shift intrinsic with a target independent
23292 SDValue Splat = DAG.getConstant(C, VT);
23293 return DAG.getNode(ISD::SRA, SDLoc(N), VT, Op0, Splat);
23298 /// PerformMulCombine - Optimize a single multiply with constant into two
23299 /// in order to implement it with two cheaper instructions, e.g.
23300 /// LEA + SHL, LEA + LEA.
23301 static SDValue PerformMulCombine(SDNode *N, SelectionDAG &DAG,
23302 TargetLowering::DAGCombinerInfo &DCI) {
23303 if (DCI.isBeforeLegalize() || DCI.isCalledByLegalizer())
23306 EVT VT = N->getValueType(0);
23307 if (VT != MVT::i64)
23310 ConstantSDNode *C = dyn_cast<ConstantSDNode>(N->getOperand(1));
23313 uint64_t MulAmt = C->getZExtValue();
23314 if (isPowerOf2_64(MulAmt) || MulAmt == 3 || MulAmt == 5 || MulAmt == 9)
23317 uint64_t MulAmt1 = 0;
23318 uint64_t MulAmt2 = 0;
23319 if ((MulAmt % 9) == 0) {
23321 MulAmt2 = MulAmt / 9;
23322 } else if ((MulAmt % 5) == 0) {
23324 MulAmt2 = MulAmt / 5;
23325 } else if ((MulAmt % 3) == 0) {
23327 MulAmt2 = MulAmt / 3;
23330 (isPowerOf2_64(MulAmt2) || MulAmt2 == 3 || MulAmt2 == 5 || MulAmt2 == 9)){
23333 if (isPowerOf2_64(MulAmt2) &&
23334 !(N->hasOneUse() && N->use_begin()->getOpcode() == ISD::ADD))
23335 // If second multiplifer is pow2, issue it first. We want the multiply by
23336 // 3, 5, or 9 to be folded into the addressing mode unless the lone use
23338 std::swap(MulAmt1, MulAmt2);
23341 if (isPowerOf2_64(MulAmt1))
23342 NewMul = DAG.getNode(ISD::SHL, DL, VT, N->getOperand(0),
23343 DAG.getConstant(Log2_64(MulAmt1), MVT::i8));
23345 NewMul = DAG.getNode(X86ISD::MUL_IMM, DL, VT, N->getOperand(0),
23346 DAG.getConstant(MulAmt1, VT));
23348 if (isPowerOf2_64(MulAmt2))
23349 NewMul = DAG.getNode(ISD::SHL, DL, VT, NewMul,
23350 DAG.getConstant(Log2_64(MulAmt2), MVT::i8));
23352 NewMul = DAG.getNode(X86ISD::MUL_IMM, DL, VT, NewMul,
23353 DAG.getConstant(MulAmt2, VT));
23355 // Do not add new nodes to DAG combiner worklist.
23356 DCI.CombineTo(N, NewMul, false);
23361 static SDValue PerformSHLCombine(SDNode *N, SelectionDAG &DAG) {
23362 SDValue N0 = N->getOperand(0);
23363 SDValue N1 = N->getOperand(1);
23364 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1);
23365 EVT VT = N0.getValueType();
23367 // fold (shl (and (setcc_c), c1), c2) -> (and setcc_c, (c1 << c2))
23368 // since the result of setcc_c is all zero's or all ones.
23369 if (VT.isInteger() && !VT.isVector() &&
23370 N1C && N0.getOpcode() == ISD::AND &&
23371 N0.getOperand(1).getOpcode() == ISD::Constant) {
23372 SDValue N00 = N0.getOperand(0);
23373 if (N00.getOpcode() == X86ISD::SETCC_CARRY ||
23374 ((N00.getOpcode() == ISD::ANY_EXTEND ||
23375 N00.getOpcode() == ISD::ZERO_EXTEND) &&
23376 N00.getOperand(0).getOpcode() == X86ISD::SETCC_CARRY)) {
23377 APInt Mask = cast<ConstantSDNode>(N0.getOperand(1))->getAPIntValue();
23378 APInt ShAmt = N1C->getAPIntValue();
23379 Mask = Mask.shl(ShAmt);
23381 return DAG.getNode(ISD::AND, SDLoc(N), VT,
23382 N00, DAG.getConstant(Mask, VT));
23386 // Hardware support for vector shifts is sparse which makes us scalarize the
23387 // vector operations in many cases. Also, on sandybridge ADD is faster than
23389 // (shl V, 1) -> add V,V
23390 if (auto *N1BV = dyn_cast<BuildVectorSDNode>(N1))
23391 if (auto *N1SplatC = N1BV->getConstantSplatNode()) {
23392 assert(N0.getValueType().isVector() && "Invalid vector shift type");
23393 // We shift all of the values by one. In many cases we do not have
23394 // hardware support for this operation. This is better expressed as an ADD
23396 if (N1SplatC->getZExtValue() == 1)
23397 return DAG.getNode(ISD::ADD, SDLoc(N), VT, N0, N0);
23403 /// \brief Returns a vector of 0s if the node in input is a vector logical
23404 /// shift by a constant amount which is known to be bigger than or equal
23405 /// to the vector element size in bits.
23406 static SDValue performShiftToAllZeros(SDNode *N, SelectionDAG &DAG,
23407 const X86Subtarget *Subtarget) {
23408 EVT VT = N->getValueType(0);
23410 if (VT != MVT::v2i64 && VT != MVT::v4i32 && VT != MVT::v8i16 &&
23411 (!Subtarget->hasInt256() ||
23412 (VT != MVT::v4i64 && VT != MVT::v8i32 && VT != MVT::v16i16)))
23415 SDValue Amt = N->getOperand(1);
23417 if (auto *AmtBV = dyn_cast<BuildVectorSDNode>(Amt))
23418 if (auto *AmtSplat = AmtBV->getConstantSplatNode()) {
23419 APInt ShiftAmt = AmtSplat->getAPIntValue();
23420 unsigned MaxAmount = VT.getVectorElementType().getSizeInBits();
23422 // SSE2/AVX2 logical shifts always return a vector of 0s
23423 // if the shift amount is bigger than or equal to
23424 // the element size. The constant shift amount will be
23425 // encoded as a 8-bit immediate.
23426 if (ShiftAmt.trunc(8).uge(MaxAmount))
23427 return getZeroVector(VT, Subtarget, DAG, DL);
23433 /// PerformShiftCombine - Combine shifts.
23434 static SDValue PerformShiftCombine(SDNode* N, SelectionDAG &DAG,
23435 TargetLowering::DAGCombinerInfo &DCI,
23436 const X86Subtarget *Subtarget) {
23437 if (N->getOpcode() == ISD::SHL) {
23438 SDValue V = PerformSHLCombine(N, DAG);
23439 if (V.getNode()) return V;
23442 if (N->getOpcode() != ISD::SRA) {
23443 // Try to fold this logical shift into a zero vector.
23444 SDValue V = performShiftToAllZeros(N, DAG, Subtarget);
23445 if (V.getNode()) return V;
23451 // CMPEQCombine - Recognize the distinctive (AND (setcc ...) (setcc ..))
23452 // where both setccs reference the same FP CMP, and rewrite for CMPEQSS
23453 // and friends. Likewise for OR -> CMPNEQSS.
23454 static SDValue CMPEQCombine(SDNode *N, SelectionDAG &DAG,
23455 TargetLowering::DAGCombinerInfo &DCI,
23456 const X86Subtarget *Subtarget) {
23459 // SSE1 supports CMP{eq|ne}SS, and SSE2 added CMP{eq|ne}SD, but
23460 // we're requiring SSE2 for both.
23461 if (Subtarget->hasSSE2() && isAndOrOfSetCCs(SDValue(N, 0U), opcode)) {
23462 SDValue N0 = N->getOperand(0);
23463 SDValue N1 = N->getOperand(1);
23464 SDValue CMP0 = N0->getOperand(1);
23465 SDValue CMP1 = N1->getOperand(1);
23468 // The SETCCs should both refer to the same CMP.
23469 if (CMP0.getOpcode() != X86ISD::CMP || CMP0 != CMP1)
23472 SDValue CMP00 = CMP0->getOperand(0);
23473 SDValue CMP01 = CMP0->getOperand(1);
23474 EVT VT = CMP00.getValueType();
23476 if (VT == MVT::f32 || VT == MVT::f64) {
23477 bool ExpectingFlags = false;
23478 // Check for any users that want flags:
23479 for (SDNode::use_iterator UI = N->use_begin(), UE = N->use_end();
23480 !ExpectingFlags && UI != UE; ++UI)
23481 switch (UI->getOpcode()) {
23486 ExpectingFlags = true;
23488 case ISD::CopyToReg:
23489 case ISD::SIGN_EXTEND:
23490 case ISD::ZERO_EXTEND:
23491 case ISD::ANY_EXTEND:
23495 if (!ExpectingFlags) {
23496 enum X86::CondCode cc0 = (enum X86::CondCode)N0.getConstantOperandVal(0);
23497 enum X86::CondCode cc1 = (enum X86::CondCode)N1.getConstantOperandVal(0);
23499 if (cc1 == X86::COND_E || cc1 == X86::COND_NE) {
23500 X86::CondCode tmp = cc0;
23505 if ((cc0 == X86::COND_E && cc1 == X86::COND_NP) ||
23506 (cc0 == X86::COND_NE && cc1 == X86::COND_P)) {
23507 // FIXME: need symbolic constants for these magic numbers.
23508 // See X86ATTInstPrinter.cpp:printSSECC().
23509 unsigned x86cc = (cc0 == X86::COND_E) ? 0 : 4;
23510 if (Subtarget->hasAVX512()) {
23511 SDValue FSetCC = DAG.getNode(X86ISD::FSETCC, DL, MVT::i1, CMP00,
23512 CMP01, DAG.getConstant(x86cc, MVT::i8));
23513 if (N->getValueType(0) != MVT::i1)
23514 return DAG.getNode(ISD::ZERO_EXTEND, DL, N->getValueType(0),
23518 SDValue OnesOrZeroesF = DAG.getNode(X86ISD::FSETCC, DL,
23519 CMP00.getValueType(), CMP00, CMP01,
23520 DAG.getConstant(x86cc, MVT::i8));
23522 bool is64BitFP = (CMP00.getValueType() == MVT::f64);
23523 MVT IntVT = is64BitFP ? MVT::i64 : MVT::i32;
23525 if (is64BitFP && !Subtarget->is64Bit()) {
23526 // On a 32-bit target, we cannot bitcast the 64-bit float to a
23527 // 64-bit integer, since that's not a legal type. Since
23528 // OnesOrZeroesF is all ones of all zeroes, we don't need all the
23529 // bits, but can do this little dance to extract the lowest 32 bits
23530 // and work with those going forward.
23531 SDValue Vector64 = DAG.getNode(ISD::SCALAR_TO_VECTOR, DL, MVT::v2f64,
23533 SDValue Vector32 = DAG.getNode(ISD::BITCAST, DL, MVT::v4f32,
23535 OnesOrZeroesF = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, DL, MVT::f32,
23536 Vector32, DAG.getIntPtrConstant(0));
23540 SDValue OnesOrZeroesI = DAG.getNode(ISD::BITCAST, DL, IntVT, OnesOrZeroesF);
23541 SDValue ANDed = DAG.getNode(ISD::AND, DL, IntVT, OnesOrZeroesI,
23542 DAG.getConstant(1, IntVT));
23543 SDValue OneBitOfTruth = DAG.getNode(ISD::TRUNCATE, DL, MVT::i8, ANDed);
23544 return OneBitOfTruth;
23552 /// CanFoldXORWithAllOnes - Test whether the XOR operand is a AllOnes vector
23553 /// so it can be folded inside ANDNP.
23554 static bool CanFoldXORWithAllOnes(const SDNode *N) {
23555 EVT VT = N->getValueType(0);
23557 // Match direct AllOnes for 128 and 256-bit vectors
23558 if (ISD::isBuildVectorAllOnes(N))
23561 // Look through a bit convert.
23562 if (N->getOpcode() == ISD::BITCAST)
23563 N = N->getOperand(0).getNode();
23565 // Sometimes the operand may come from a insert_subvector building a 256-bit
23567 if (VT.is256BitVector() &&
23568 N->getOpcode() == ISD::INSERT_SUBVECTOR) {
23569 SDValue V1 = N->getOperand(0);
23570 SDValue V2 = N->getOperand(1);
23572 if (V1.getOpcode() == ISD::INSERT_SUBVECTOR &&
23573 V1.getOperand(0).getOpcode() == ISD::UNDEF &&
23574 ISD::isBuildVectorAllOnes(V1.getOperand(1).getNode()) &&
23575 ISD::isBuildVectorAllOnes(V2.getNode()))
23582 // On AVX/AVX2 the type v8i1 is legalized to v8i16, which is an XMM sized
23583 // register. In most cases we actually compare or select YMM-sized registers
23584 // and mixing the two types creates horrible code. This method optimizes
23585 // some of the transition sequences.
23586 static SDValue WidenMaskArithmetic(SDNode *N, SelectionDAG &DAG,
23587 TargetLowering::DAGCombinerInfo &DCI,
23588 const X86Subtarget *Subtarget) {
23589 EVT VT = N->getValueType(0);
23590 if (!VT.is256BitVector())
23593 assert((N->getOpcode() == ISD::ANY_EXTEND ||
23594 N->getOpcode() == ISD::ZERO_EXTEND ||
23595 N->getOpcode() == ISD::SIGN_EXTEND) && "Invalid Node");
23597 SDValue Narrow = N->getOperand(0);
23598 EVT NarrowVT = Narrow->getValueType(0);
23599 if (!NarrowVT.is128BitVector())
23602 if (Narrow->getOpcode() != ISD::XOR &&
23603 Narrow->getOpcode() != ISD::AND &&
23604 Narrow->getOpcode() != ISD::OR)
23607 SDValue N0 = Narrow->getOperand(0);
23608 SDValue N1 = Narrow->getOperand(1);
23611 // The Left side has to be a trunc.
23612 if (N0.getOpcode() != ISD::TRUNCATE)
23615 // The type of the truncated inputs.
23616 EVT WideVT = N0->getOperand(0)->getValueType(0);
23620 // The right side has to be a 'trunc' or a constant vector.
23621 bool RHSTrunc = N1.getOpcode() == ISD::TRUNCATE;
23622 ConstantSDNode *RHSConstSplat = nullptr;
23623 if (auto *RHSBV = dyn_cast<BuildVectorSDNode>(N1))
23624 RHSConstSplat = RHSBV->getConstantSplatNode();
23625 if (!RHSTrunc && !RHSConstSplat)
23628 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
23630 if (!TLI.isOperationLegalOrPromote(Narrow->getOpcode(), WideVT))
23633 // Set N0 and N1 to hold the inputs to the new wide operation.
23634 N0 = N0->getOperand(0);
23635 if (RHSConstSplat) {
23636 N1 = DAG.getNode(ISD::ZERO_EXTEND, DL, WideVT.getScalarType(),
23637 SDValue(RHSConstSplat, 0));
23638 SmallVector<SDValue, 8> C(WideVT.getVectorNumElements(), N1);
23639 N1 = DAG.getNode(ISD::BUILD_VECTOR, DL, WideVT, C);
23640 } else if (RHSTrunc) {
23641 N1 = N1->getOperand(0);
23644 // Generate the wide operation.
23645 SDValue Op = DAG.getNode(Narrow->getOpcode(), DL, WideVT, N0, N1);
23646 unsigned Opcode = N->getOpcode();
23648 case ISD::ANY_EXTEND:
23650 case ISD::ZERO_EXTEND: {
23651 unsigned InBits = NarrowVT.getScalarType().getSizeInBits();
23652 APInt Mask = APInt::getAllOnesValue(InBits);
23653 Mask = Mask.zext(VT.getScalarType().getSizeInBits());
23654 return DAG.getNode(ISD::AND, DL, VT,
23655 Op, DAG.getConstant(Mask, VT));
23657 case ISD::SIGN_EXTEND:
23658 return DAG.getNode(ISD::SIGN_EXTEND_INREG, DL, VT,
23659 Op, DAG.getValueType(NarrowVT));
23661 llvm_unreachable("Unexpected opcode");
23665 static SDValue PerformAndCombine(SDNode *N, SelectionDAG &DAG,
23666 TargetLowering::DAGCombinerInfo &DCI,
23667 const X86Subtarget *Subtarget) {
23668 EVT VT = N->getValueType(0);
23669 if (DCI.isBeforeLegalizeOps())
23672 SDValue R = CMPEQCombine(N, DAG, DCI, Subtarget);
23676 // Create BEXTR instructions
23677 // BEXTR is ((X >> imm) & (2**size-1))
23678 if (VT == MVT::i32 || VT == MVT::i64) {
23679 SDValue N0 = N->getOperand(0);
23680 SDValue N1 = N->getOperand(1);
23683 // Check for BEXTR.
23684 if ((Subtarget->hasBMI() || Subtarget->hasTBM()) &&
23685 (N0.getOpcode() == ISD::SRA || N0.getOpcode() == ISD::SRL)) {
23686 ConstantSDNode *MaskNode = dyn_cast<ConstantSDNode>(N1);
23687 ConstantSDNode *ShiftNode = dyn_cast<ConstantSDNode>(N0.getOperand(1));
23688 if (MaskNode && ShiftNode) {
23689 uint64_t Mask = MaskNode->getZExtValue();
23690 uint64_t Shift = ShiftNode->getZExtValue();
23691 if (isMask_64(Mask)) {
23692 uint64_t MaskSize = CountPopulation_64(Mask);
23693 if (Shift + MaskSize <= VT.getSizeInBits())
23694 return DAG.getNode(X86ISD::BEXTR, DL, VT, N0.getOperand(0),
23695 DAG.getConstant(Shift | (MaskSize << 8), VT));
23703 // Want to form ANDNP nodes:
23704 // 1) In the hopes of then easily combining them with OR and AND nodes
23705 // to form PBLEND/PSIGN.
23706 // 2) To match ANDN packed intrinsics
23707 if (VT != MVT::v2i64 && VT != MVT::v4i64)
23710 SDValue N0 = N->getOperand(0);
23711 SDValue N1 = N->getOperand(1);
23714 // Check LHS for vnot
23715 if (N0.getOpcode() == ISD::XOR &&
23716 //ISD::isBuildVectorAllOnes(N0.getOperand(1).getNode()))
23717 CanFoldXORWithAllOnes(N0.getOperand(1).getNode()))
23718 return DAG.getNode(X86ISD::ANDNP, DL, VT, N0.getOperand(0), N1);
23720 // Check RHS for vnot
23721 if (N1.getOpcode() == ISD::XOR &&
23722 //ISD::isBuildVectorAllOnes(N1.getOperand(1).getNode()))
23723 CanFoldXORWithAllOnes(N1.getOperand(1).getNode()))
23724 return DAG.getNode(X86ISD::ANDNP, DL, VT, N1.getOperand(0), N0);
23729 static SDValue PerformOrCombine(SDNode *N, SelectionDAG &DAG,
23730 TargetLowering::DAGCombinerInfo &DCI,
23731 const X86Subtarget *Subtarget) {
23732 if (DCI.isBeforeLegalizeOps())
23735 SDValue R = CMPEQCombine(N, DAG, DCI, Subtarget);
23739 SDValue N0 = N->getOperand(0);
23740 SDValue N1 = N->getOperand(1);
23741 EVT VT = N->getValueType(0);
23743 // look for psign/blend
23744 if (VT == MVT::v2i64 || VT == MVT::v4i64) {
23745 if (!Subtarget->hasSSSE3() ||
23746 (VT == MVT::v4i64 && !Subtarget->hasInt256()))
23749 // Canonicalize pandn to RHS
23750 if (N0.getOpcode() == X86ISD::ANDNP)
23752 // or (and (m, y), (pandn m, x))
23753 if (N0.getOpcode() == ISD::AND && N1.getOpcode() == X86ISD::ANDNP) {
23754 SDValue Mask = N1.getOperand(0);
23755 SDValue X = N1.getOperand(1);
23757 if (N0.getOperand(0) == Mask)
23758 Y = N0.getOperand(1);
23759 if (N0.getOperand(1) == Mask)
23760 Y = N0.getOperand(0);
23762 // Check to see if the mask appeared in both the AND and ANDNP and
23766 // Validate that X, Y, and Mask are BIT_CONVERTS, and see through them.
23767 // Look through mask bitcast.
23768 if (Mask.getOpcode() == ISD::BITCAST)
23769 Mask = Mask.getOperand(0);
23770 if (X.getOpcode() == ISD::BITCAST)
23771 X = X.getOperand(0);
23772 if (Y.getOpcode() == ISD::BITCAST)
23773 Y = Y.getOperand(0);
23775 EVT MaskVT = Mask.getValueType();
23777 // Validate that the Mask operand is a vector sra node.
23778 // FIXME: what to do for bytes, since there is a psignb/pblendvb, but
23779 // there is no psrai.b
23780 unsigned EltBits = MaskVT.getVectorElementType().getSizeInBits();
23781 unsigned SraAmt = ~0;
23782 if (Mask.getOpcode() == ISD::SRA) {
23783 if (auto *AmtBV = dyn_cast<BuildVectorSDNode>(Mask.getOperand(1)))
23784 if (auto *AmtConst = AmtBV->getConstantSplatNode())
23785 SraAmt = AmtConst->getZExtValue();
23786 } else if (Mask.getOpcode() == X86ISD::VSRAI) {
23787 SDValue SraC = Mask.getOperand(1);
23788 SraAmt = cast<ConstantSDNode>(SraC)->getZExtValue();
23790 if ((SraAmt + 1) != EltBits)
23795 // Now we know we at least have a plendvb with the mask val. See if
23796 // we can form a psignb/w/d.
23797 // psign = x.type == y.type == mask.type && y = sub(0, x);
23798 if (Y.getOpcode() == ISD::SUB && Y.getOperand(1) == X &&
23799 ISD::isBuildVectorAllZeros(Y.getOperand(0).getNode()) &&
23800 X.getValueType() == MaskVT && Y.getValueType() == MaskVT) {
23801 assert((EltBits == 8 || EltBits == 16 || EltBits == 32) &&
23802 "Unsupported VT for PSIGN");
23803 Mask = DAG.getNode(X86ISD::PSIGN, DL, MaskVT, X, Mask.getOperand(0));
23804 return DAG.getNode(ISD::BITCAST, DL, VT, Mask);
23806 // PBLENDVB only available on SSE 4.1
23807 if (!Subtarget->hasSSE41())
23810 EVT BlendVT = (VT == MVT::v4i64) ? MVT::v32i8 : MVT::v16i8;
23812 X = DAG.getNode(ISD::BITCAST, DL, BlendVT, X);
23813 Y = DAG.getNode(ISD::BITCAST, DL, BlendVT, Y);
23814 Mask = DAG.getNode(ISD::BITCAST, DL, BlendVT, Mask);
23815 Mask = DAG.getNode(ISD::VSELECT, DL, BlendVT, Mask, Y, X);
23816 return DAG.getNode(ISD::BITCAST, DL, VT, Mask);
23820 if (VT != MVT::i16 && VT != MVT::i32 && VT != MVT::i64)
23823 // fold (or (x << c) | (y >> (64 - c))) ==> (shld64 x, y, c)
23824 MachineFunction &MF = DAG.getMachineFunction();
23825 bool OptForSize = MF.getFunction()->getAttributes().
23826 hasAttribute(AttributeSet::FunctionIndex, Attribute::OptimizeForSize);
23828 // SHLD/SHRD instructions have lower register pressure, but on some
23829 // platforms they have higher latency than the equivalent
23830 // series of shifts/or that would otherwise be generated.
23831 // Don't fold (or (x << c) | (y >> (64 - c))) if SHLD/SHRD instructions
23832 // have higher latencies and we are not optimizing for size.
23833 if (!OptForSize && Subtarget->isSHLDSlow())
23836 if (N0.getOpcode() == ISD::SRL && N1.getOpcode() == ISD::SHL)
23838 if (N0.getOpcode() != ISD::SHL || N1.getOpcode() != ISD::SRL)
23840 if (!N0.hasOneUse() || !N1.hasOneUse())
23843 SDValue ShAmt0 = N0.getOperand(1);
23844 if (ShAmt0.getValueType() != MVT::i8)
23846 SDValue ShAmt1 = N1.getOperand(1);
23847 if (ShAmt1.getValueType() != MVT::i8)
23849 if (ShAmt0.getOpcode() == ISD::TRUNCATE)
23850 ShAmt0 = ShAmt0.getOperand(0);
23851 if (ShAmt1.getOpcode() == ISD::TRUNCATE)
23852 ShAmt1 = ShAmt1.getOperand(0);
23855 unsigned Opc = X86ISD::SHLD;
23856 SDValue Op0 = N0.getOperand(0);
23857 SDValue Op1 = N1.getOperand(0);
23858 if (ShAmt0.getOpcode() == ISD::SUB) {
23859 Opc = X86ISD::SHRD;
23860 std::swap(Op0, Op1);
23861 std::swap(ShAmt0, ShAmt1);
23864 unsigned Bits = VT.getSizeInBits();
23865 if (ShAmt1.getOpcode() == ISD::SUB) {
23866 SDValue Sum = ShAmt1.getOperand(0);
23867 if (ConstantSDNode *SumC = dyn_cast<ConstantSDNode>(Sum)) {
23868 SDValue ShAmt1Op1 = ShAmt1.getOperand(1);
23869 if (ShAmt1Op1.getNode()->getOpcode() == ISD::TRUNCATE)
23870 ShAmt1Op1 = ShAmt1Op1.getOperand(0);
23871 if (SumC->getSExtValue() == Bits && ShAmt1Op1 == ShAmt0)
23872 return DAG.getNode(Opc, DL, VT,
23874 DAG.getNode(ISD::TRUNCATE, DL,
23877 } else if (ConstantSDNode *ShAmt1C = dyn_cast<ConstantSDNode>(ShAmt1)) {
23878 ConstantSDNode *ShAmt0C = dyn_cast<ConstantSDNode>(ShAmt0);
23880 ShAmt0C->getSExtValue() + ShAmt1C->getSExtValue() == Bits)
23881 return DAG.getNode(Opc, DL, VT,
23882 N0.getOperand(0), N1.getOperand(0),
23883 DAG.getNode(ISD::TRUNCATE, DL,
23890 // Generate NEG and CMOV for integer abs.
23891 static SDValue performIntegerAbsCombine(SDNode *N, SelectionDAG &DAG) {
23892 EVT VT = N->getValueType(0);
23894 // Since X86 does not have CMOV for 8-bit integer, we don't convert
23895 // 8-bit integer abs to NEG and CMOV.
23896 if (VT.isInteger() && VT.getSizeInBits() == 8)
23899 SDValue N0 = N->getOperand(0);
23900 SDValue N1 = N->getOperand(1);
23903 // Check pattern of XOR(ADD(X,Y), Y) where Y is SRA(X, size(X)-1)
23904 // and change it to SUB and CMOV.
23905 if (VT.isInteger() && N->getOpcode() == ISD::XOR &&
23906 N0.getOpcode() == ISD::ADD &&
23907 N0.getOperand(1) == N1 &&
23908 N1.getOpcode() == ISD::SRA &&
23909 N1.getOperand(0) == N0.getOperand(0))
23910 if (ConstantSDNode *Y1C = dyn_cast<ConstantSDNode>(N1.getOperand(1)))
23911 if (Y1C->getAPIntValue() == VT.getSizeInBits()-1) {
23912 // Generate SUB & CMOV.
23913 SDValue Neg = DAG.getNode(X86ISD::SUB, DL, DAG.getVTList(VT, MVT::i32),
23914 DAG.getConstant(0, VT), N0.getOperand(0));
23916 SDValue Ops[] = { N0.getOperand(0), Neg,
23917 DAG.getConstant(X86::COND_GE, MVT::i8),
23918 SDValue(Neg.getNode(), 1) };
23919 return DAG.getNode(X86ISD::CMOV, DL, DAG.getVTList(VT, MVT::Glue), Ops);
23924 // PerformXorCombine - Attempts to turn XOR nodes into BLSMSK nodes
23925 static SDValue PerformXorCombine(SDNode *N, SelectionDAG &DAG,
23926 TargetLowering::DAGCombinerInfo &DCI,
23927 const X86Subtarget *Subtarget) {
23928 if (DCI.isBeforeLegalizeOps())
23931 if (Subtarget->hasCMov()) {
23932 SDValue RV = performIntegerAbsCombine(N, DAG);
23940 /// PerformLOADCombine - Do target-specific dag combines on LOAD nodes.
23941 static SDValue PerformLOADCombine(SDNode *N, SelectionDAG &DAG,
23942 TargetLowering::DAGCombinerInfo &DCI,
23943 const X86Subtarget *Subtarget) {
23944 LoadSDNode *Ld = cast<LoadSDNode>(N);
23945 EVT RegVT = Ld->getValueType(0);
23946 EVT MemVT = Ld->getMemoryVT();
23948 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
23950 // On Sandybridge unaligned 256bit loads are inefficient.
23951 ISD::LoadExtType Ext = Ld->getExtensionType();
23952 unsigned Alignment = Ld->getAlignment();
23953 bool IsAligned = Alignment == 0 || Alignment >= MemVT.getSizeInBits()/8;
23954 if (RegVT.is256BitVector() && !Subtarget->hasInt256() &&
23955 !DCI.isBeforeLegalizeOps() && !IsAligned && Ext == ISD::NON_EXTLOAD) {
23956 unsigned NumElems = RegVT.getVectorNumElements();
23960 SDValue Ptr = Ld->getBasePtr();
23961 SDValue Increment = DAG.getConstant(16, TLI.getPointerTy());
23963 EVT HalfVT = EVT::getVectorVT(*DAG.getContext(), MemVT.getScalarType(),
23965 SDValue Load1 = DAG.getLoad(HalfVT, dl, Ld->getChain(), Ptr,
23966 Ld->getPointerInfo(), Ld->isVolatile(),
23967 Ld->isNonTemporal(), Ld->isInvariant(),
23969 Ptr = DAG.getNode(ISD::ADD, dl, Ptr.getValueType(), Ptr, Increment);
23970 SDValue Load2 = DAG.getLoad(HalfVT, dl, Ld->getChain(), Ptr,
23971 Ld->getPointerInfo(), Ld->isVolatile(),
23972 Ld->isNonTemporal(), Ld->isInvariant(),
23973 std::min(16U, Alignment));
23974 SDValue TF = DAG.getNode(ISD::TokenFactor, dl, MVT::Other,
23976 Load2.getValue(1));
23978 SDValue NewVec = DAG.getUNDEF(RegVT);
23979 NewVec = Insert128BitVector(NewVec, Load1, 0, DAG, dl);
23980 NewVec = Insert128BitVector(NewVec, Load2, NumElems/2, DAG, dl);
23981 return DCI.CombineTo(N, NewVec, TF, true);
23987 /// PerformSTORECombine - Do target-specific dag combines on STORE nodes.
23988 static SDValue PerformSTORECombine(SDNode *N, SelectionDAG &DAG,
23989 const X86Subtarget *Subtarget) {
23990 StoreSDNode *St = cast<StoreSDNode>(N);
23991 EVT VT = St->getValue().getValueType();
23992 EVT StVT = St->getMemoryVT();
23994 SDValue StoredVal = St->getOperand(1);
23995 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
23997 // If we are saving a concatenation of two XMM registers, perform two stores.
23998 // On Sandy Bridge, 256-bit memory operations are executed by two
23999 // 128-bit ports. However, on Haswell it is better to issue a single 256-bit
24000 // memory operation.
24001 unsigned Alignment = St->getAlignment();
24002 bool IsAligned = Alignment == 0 || Alignment >= VT.getSizeInBits()/8;
24003 if (VT.is256BitVector() && !Subtarget->hasInt256() &&
24004 StVT == VT && !IsAligned) {
24005 unsigned NumElems = VT.getVectorNumElements();
24009 SDValue Value0 = Extract128BitVector(StoredVal, 0, DAG, dl);
24010 SDValue Value1 = Extract128BitVector(StoredVal, NumElems/2, DAG, dl);
24012 SDValue Stride = DAG.getConstant(16, TLI.getPointerTy());
24013 SDValue Ptr0 = St->getBasePtr();
24014 SDValue Ptr1 = DAG.getNode(ISD::ADD, dl, Ptr0.getValueType(), Ptr0, Stride);
24016 SDValue Ch0 = DAG.getStore(St->getChain(), dl, Value0, Ptr0,
24017 St->getPointerInfo(), St->isVolatile(),
24018 St->isNonTemporal(), Alignment);
24019 SDValue Ch1 = DAG.getStore(St->getChain(), dl, Value1, Ptr1,
24020 St->getPointerInfo(), St->isVolatile(),
24021 St->isNonTemporal(),
24022 std::min(16U, Alignment));
24023 return DAG.getNode(ISD::TokenFactor, dl, MVT::Other, Ch0, Ch1);
24026 // Optimize trunc store (of multiple scalars) to shuffle and store.
24027 // First, pack all of the elements in one place. Next, store to memory
24028 // in fewer chunks.
24029 if (St->isTruncatingStore() && VT.isVector()) {
24030 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
24031 unsigned NumElems = VT.getVectorNumElements();
24032 assert(StVT != VT && "Cannot truncate to the same type");
24033 unsigned FromSz = VT.getVectorElementType().getSizeInBits();
24034 unsigned ToSz = StVT.getVectorElementType().getSizeInBits();
24036 // From, To sizes and ElemCount must be pow of two
24037 if (!isPowerOf2_32(NumElems * FromSz * ToSz)) return SDValue();
24038 // We are going to use the original vector elt for storing.
24039 // Accumulated smaller vector elements must be a multiple of the store size.
24040 if (0 != (NumElems * FromSz) % ToSz) return SDValue();
24042 unsigned SizeRatio = FromSz / ToSz;
24044 assert(SizeRatio * NumElems * ToSz == VT.getSizeInBits());
24046 // Create a type on which we perform the shuffle
24047 EVT WideVecVT = EVT::getVectorVT(*DAG.getContext(),
24048 StVT.getScalarType(), NumElems*SizeRatio);
24050 assert(WideVecVT.getSizeInBits() == VT.getSizeInBits());
24052 SDValue WideVec = DAG.getNode(ISD::BITCAST, dl, WideVecVT, St->getValue());
24053 SmallVector<int, 8> ShuffleVec(NumElems * SizeRatio, -1);
24054 for (unsigned i = 0; i != NumElems; ++i)
24055 ShuffleVec[i] = i * SizeRatio;
24057 // Can't shuffle using an illegal type.
24058 if (!TLI.isTypeLegal(WideVecVT))
24061 SDValue Shuff = DAG.getVectorShuffle(WideVecVT, dl, WideVec,
24062 DAG.getUNDEF(WideVecVT),
24064 // At this point all of the data is stored at the bottom of the
24065 // register. We now need to save it to mem.
24067 // Find the largest store unit
24068 MVT StoreType = MVT::i8;
24069 for (unsigned tp = MVT::FIRST_INTEGER_VALUETYPE;
24070 tp < MVT::LAST_INTEGER_VALUETYPE; ++tp) {
24071 MVT Tp = (MVT::SimpleValueType)tp;
24072 if (TLI.isTypeLegal(Tp) && Tp.getSizeInBits() <= NumElems * ToSz)
24076 // On 32bit systems, we can't save 64bit integers. Try bitcasting to F64.
24077 if (TLI.isTypeLegal(MVT::f64) && StoreType.getSizeInBits() < 64 &&
24078 (64 <= NumElems * ToSz))
24079 StoreType = MVT::f64;
24081 // Bitcast the original vector into a vector of store-size units
24082 EVT StoreVecVT = EVT::getVectorVT(*DAG.getContext(),
24083 StoreType, VT.getSizeInBits()/StoreType.getSizeInBits());
24084 assert(StoreVecVT.getSizeInBits() == VT.getSizeInBits());
24085 SDValue ShuffWide = DAG.getNode(ISD::BITCAST, dl, StoreVecVT, Shuff);
24086 SmallVector<SDValue, 8> Chains;
24087 SDValue Increment = DAG.getConstant(StoreType.getSizeInBits()/8,
24088 TLI.getPointerTy());
24089 SDValue Ptr = St->getBasePtr();
24091 // Perform one or more big stores into memory.
24092 for (unsigned i=0, e=(ToSz*NumElems)/StoreType.getSizeInBits(); i!=e; ++i) {
24093 SDValue SubVec = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl,
24094 StoreType, ShuffWide,
24095 DAG.getIntPtrConstant(i));
24096 SDValue Ch = DAG.getStore(St->getChain(), dl, SubVec, Ptr,
24097 St->getPointerInfo(), St->isVolatile(),
24098 St->isNonTemporal(), St->getAlignment());
24099 Ptr = DAG.getNode(ISD::ADD, dl, Ptr.getValueType(), Ptr, Increment);
24100 Chains.push_back(Ch);
24103 return DAG.getNode(ISD::TokenFactor, dl, MVT::Other, Chains);
24106 // Turn load->store of MMX types into GPR load/stores. This avoids clobbering
24107 // the FP state in cases where an emms may be missing.
24108 // A preferable solution to the general problem is to figure out the right
24109 // places to insert EMMS. This qualifies as a quick hack.
24111 // Similarly, turn load->store of i64 into double load/stores in 32-bit mode.
24112 if (VT.getSizeInBits() != 64)
24115 const Function *F = DAG.getMachineFunction().getFunction();
24116 bool NoImplicitFloatOps = F->getAttributes().
24117 hasAttribute(AttributeSet::FunctionIndex, Attribute::NoImplicitFloat);
24118 bool F64IsLegal = !DAG.getTarget().Options.UseSoftFloat && !NoImplicitFloatOps
24119 && Subtarget->hasSSE2();
24120 if ((VT.isVector() ||
24121 (VT == MVT::i64 && F64IsLegal && !Subtarget->is64Bit())) &&
24122 isa<LoadSDNode>(St->getValue()) &&
24123 !cast<LoadSDNode>(St->getValue())->isVolatile() &&
24124 St->getChain().hasOneUse() && !St->isVolatile()) {
24125 SDNode* LdVal = St->getValue().getNode();
24126 LoadSDNode *Ld = nullptr;
24127 int TokenFactorIndex = -1;
24128 SmallVector<SDValue, 8> Ops;
24129 SDNode* ChainVal = St->getChain().getNode();
24130 // Must be a store of a load. We currently handle two cases: the load
24131 // is a direct child, and it's under an intervening TokenFactor. It is
24132 // possible to dig deeper under nested TokenFactors.
24133 if (ChainVal == LdVal)
24134 Ld = cast<LoadSDNode>(St->getChain());
24135 else if (St->getValue().hasOneUse() &&
24136 ChainVal->getOpcode() == ISD::TokenFactor) {
24137 for (unsigned i = 0, e = ChainVal->getNumOperands(); i != e; ++i) {
24138 if (ChainVal->getOperand(i).getNode() == LdVal) {
24139 TokenFactorIndex = i;
24140 Ld = cast<LoadSDNode>(St->getValue());
24142 Ops.push_back(ChainVal->getOperand(i));
24146 if (!Ld || !ISD::isNormalLoad(Ld))
24149 // If this is not the MMX case, i.e. we are just turning i64 load/store
24150 // into f64 load/store, avoid the transformation if there are multiple
24151 // uses of the loaded value.
24152 if (!VT.isVector() && !Ld->hasNUsesOfValue(1, 0))
24157 // If we are a 64-bit capable x86, lower to a single movq load/store pair.
24158 // Otherwise, if it's legal to use f64 SSE instructions, use f64 load/store
24160 if (Subtarget->is64Bit() || F64IsLegal) {
24161 EVT LdVT = Subtarget->is64Bit() ? MVT::i64 : MVT::f64;
24162 SDValue NewLd = DAG.getLoad(LdVT, LdDL, Ld->getChain(), Ld->getBasePtr(),
24163 Ld->getPointerInfo(), Ld->isVolatile(),
24164 Ld->isNonTemporal(), Ld->isInvariant(),
24165 Ld->getAlignment());
24166 SDValue NewChain = NewLd.getValue(1);
24167 if (TokenFactorIndex != -1) {
24168 Ops.push_back(NewChain);
24169 NewChain = DAG.getNode(ISD::TokenFactor, LdDL, MVT::Other, Ops);
24171 return DAG.getStore(NewChain, StDL, NewLd, St->getBasePtr(),
24172 St->getPointerInfo(),
24173 St->isVolatile(), St->isNonTemporal(),
24174 St->getAlignment());
24177 // Otherwise, lower to two pairs of 32-bit loads / stores.
24178 SDValue LoAddr = Ld->getBasePtr();
24179 SDValue HiAddr = DAG.getNode(ISD::ADD, LdDL, MVT::i32, LoAddr,
24180 DAG.getConstant(4, MVT::i32));
24182 SDValue LoLd = DAG.getLoad(MVT::i32, LdDL, Ld->getChain(), LoAddr,
24183 Ld->getPointerInfo(),
24184 Ld->isVolatile(), Ld->isNonTemporal(),
24185 Ld->isInvariant(), Ld->getAlignment());
24186 SDValue HiLd = DAG.getLoad(MVT::i32, LdDL, Ld->getChain(), HiAddr,
24187 Ld->getPointerInfo().getWithOffset(4),
24188 Ld->isVolatile(), Ld->isNonTemporal(),
24190 MinAlign(Ld->getAlignment(), 4));
24192 SDValue NewChain = LoLd.getValue(1);
24193 if (TokenFactorIndex != -1) {
24194 Ops.push_back(LoLd);
24195 Ops.push_back(HiLd);
24196 NewChain = DAG.getNode(ISD::TokenFactor, LdDL, MVT::Other, Ops);
24199 LoAddr = St->getBasePtr();
24200 HiAddr = DAG.getNode(ISD::ADD, StDL, MVT::i32, LoAddr,
24201 DAG.getConstant(4, MVT::i32));
24203 SDValue LoSt = DAG.getStore(NewChain, StDL, LoLd, LoAddr,
24204 St->getPointerInfo(),
24205 St->isVolatile(), St->isNonTemporal(),
24206 St->getAlignment());
24207 SDValue HiSt = DAG.getStore(NewChain, StDL, HiLd, HiAddr,
24208 St->getPointerInfo().getWithOffset(4),
24210 St->isNonTemporal(),
24211 MinAlign(St->getAlignment(), 4));
24212 return DAG.getNode(ISD::TokenFactor, StDL, MVT::Other, LoSt, HiSt);
24217 /// isHorizontalBinOp - Return 'true' if this vector operation is "horizontal"
24218 /// and return the operands for the horizontal operation in LHS and RHS. A
24219 /// horizontal operation performs the binary operation on successive elements
24220 /// of its first operand, then on successive elements of its second operand,
24221 /// returning the resulting values in a vector. For example, if
24222 /// A = < float a0, float a1, float a2, float a3 >
24224 /// B = < float b0, float b1, float b2, float b3 >
24225 /// then the result of doing a horizontal operation on A and B is
24226 /// A horizontal-op B = < a0 op a1, a2 op a3, b0 op b1, b2 op b3 >.
24227 /// In short, LHS and RHS are inspected to see if LHS op RHS is of the form
24228 /// A horizontal-op B, for some already available A and B, and if so then LHS is
24229 /// set to A, RHS to B, and the routine returns 'true'.
24230 /// Note that the binary operation should have the property that if one of the
24231 /// operands is UNDEF then the result is UNDEF.
24232 static bool isHorizontalBinOp(SDValue &LHS, SDValue &RHS, bool IsCommutative) {
24233 // Look for the following pattern: if
24234 // A = < float a0, float a1, float a2, float a3 >
24235 // B = < float b0, float b1, float b2, float b3 >
24237 // LHS = VECTOR_SHUFFLE A, B, <0, 2, 4, 6>
24238 // RHS = VECTOR_SHUFFLE A, B, <1, 3, 5, 7>
24239 // then LHS op RHS = < a0 op a1, a2 op a3, b0 op b1, b2 op b3 >
24240 // which is A horizontal-op B.
24242 // At least one of the operands should be a vector shuffle.
24243 if (LHS.getOpcode() != ISD::VECTOR_SHUFFLE &&
24244 RHS.getOpcode() != ISD::VECTOR_SHUFFLE)
24247 MVT VT = LHS.getSimpleValueType();
24249 assert((VT.is128BitVector() || VT.is256BitVector()) &&
24250 "Unsupported vector type for horizontal add/sub");
24252 // Handle 128 and 256-bit vector lengths. AVX defines horizontal add/sub to
24253 // operate independently on 128-bit lanes.
24254 unsigned NumElts = VT.getVectorNumElements();
24255 unsigned NumLanes = VT.getSizeInBits()/128;
24256 unsigned NumLaneElts = NumElts / NumLanes;
24257 assert((NumLaneElts % 2 == 0) &&
24258 "Vector type should have an even number of elements in each lane");
24259 unsigned HalfLaneElts = NumLaneElts/2;
24261 // View LHS in the form
24262 // LHS = VECTOR_SHUFFLE A, B, LMask
24263 // If LHS is not a shuffle then pretend it is the shuffle
24264 // LHS = VECTOR_SHUFFLE LHS, undef, <0, 1, ..., N-1>
24265 // NOTE: in what follows a default initialized SDValue represents an UNDEF of
24268 SmallVector<int, 16> LMask(NumElts);
24269 if (LHS.getOpcode() == ISD::VECTOR_SHUFFLE) {
24270 if (LHS.getOperand(0).getOpcode() != ISD::UNDEF)
24271 A = LHS.getOperand(0);
24272 if (LHS.getOperand(1).getOpcode() != ISD::UNDEF)
24273 B = LHS.getOperand(1);
24274 ArrayRef<int> Mask = cast<ShuffleVectorSDNode>(LHS.getNode())->getMask();
24275 std::copy(Mask.begin(), Mask.end(), LMask.begin());
24277 if (LHS.getOpcode() != ISD::UNDEF)
24279 for (unsigned i = 0; i != NumElts; ++i)
24283 // Likewise, view RHS in the form
24284 // RHS = VECTOR_SHUFFLE C, D, RMask
24286 SmallVector<int, 16> RMask(NumElts);
24287 if (RHS.getOpcode() == ISD::VECTOR_SHUFFLE) {
24288 if (RHS.getOperand(0).getOpcode() != ISD::UNDEF)
24289 C = RHS.getOperand(0);
24290 if (RHS.getOperand(1).getOpcode() != ISD::UNDEF)
24291 D = RHS.getOperand(1);
24292 ArrayRef<int> Mask = cast<ShuffleVectorSDNode>(RHS.getNode())->getMask();
24293 std::copy(Mask.begin(), Mask.end(), RMask.begin());
24295 if (RHS.getOpcode() != ISD::UNDEF)
24297 for (unsigned i = 0; i != NumElts; ++i)
24301 // Check that the shuffles are both shuffling the same vectors.
24302 if (!(A == C && B == D) && !(A == D && B == C))
24305 // If everything is UNDEF then bail out: it would be better to fold to UNDEF.
24306 if (!A.getNode() && !B.getNode())
24309 // If A and B occur in reverse order in RHS, then "swap" them (which means
24310 // rewriting the mask).
24312 CommuteVectorShuffleMask(RMask, NumElts);
24314 // At this point LHS and RHS are equivalent to
24315 // LHS = VECTOR_SHUFFLE A, B, LMask
24316 // RHS = VECTOR_SHUFFLE A, B, RMask
24317 // Check that the masks correspond to performing a horizontal operation.
24318 for (unsigned l = 0; l != NumElts; l += NumLaneElts) {
24319 for (unsigned i = 0; i != NumLaneElts; ++i) {
24320 int LIdx = LMask[i+l], RIdx = RMask[i+l];
24322 // Ignore any UNDEF components.
24323 if (LIdx < 0 || RIdx < 0 ||
24324 (!A.getNode() && (LIdx < (int)NumElts || RIdx < (int)NumElts)) ||
24325 (!B.getNode() && (LIdx >= (int)NumElts || RIdx >= (int)NumElts)))
24328 // Check that successive elements are being operated on. If not, this is
24329 // not a horizontal operation.
24330 unsigned Src = (i/HalfLaneElts); // each lane is split between srcs
24331 int Index = 2*(i%HalfLaneElts) + NumElts*Src + l;
24332 if (!(LIdx == Index && RIdx == Index + 1) &&
24333 !(IsCommutative && LIdx == Index + 1 && RIdx == Index))
24338 LHS = A.getNode() ? A : B; // If A is 'UNDEF', use B for it.
24339 RHS = B.getNode() ? B : A; // If B is 'UNDEF', use A for it.
24343 /// PerformFADDCombine - Do target-specific dag combines on floating point adds.
24344 static SDValue PerformFADDCombine(SDNode *N, SelectionDAG &DAG,
24345 const X86Subtarget *Subtarget) {
24346 EVT VT = N->getValueType(0);
24347 SDValue LHS = N->getOperand(0);
24348 SDValue RHS = N->getOperand(1);
24350 // Try to synthesize horizontal adds from adds of shuffles.
24351 if (((Subtarget->hasSSE3() && (VT == MVT::v4f32 || VT == MVT::v2f64)) ||
24352 (Subtarget->hasFp256() && (VT == MVT::v8f32 || VT == MVT::v4f64))) &&
24353 isHorizontalBinOp(LHS, RHS, true))
24354 return DAG.getNode(X86ISD::FHADD, SDLoc(N), VT, LHS, RHS);
24358 /// PerformFSUBCombine - Do target-specific dag combines on floating point subs.
24359 static SDValue PerformFSUBCombine(SDNode *N, SelectionDAG &DAG,
24360 const X86Subtarget *Subtarget) {
24361 EVT VT = N->getValueType(0);
24362 SDValue LHS = N->getOperand(0);
24363 SDValue RHS = N->getOperand(1);
24365 // Try to synthesize horizontal subs from subs of shuffles.
24366 if (((Subtarget->hasSSE3() && (VT == MVT::v4f32 || VT == MVT::v2f64)) ||
24367 (Subtarget->hasFp256() && (VT == MVT::v8f32 || VT == MVT::v4f64))) &&
24368 isHorizontalBinOp(LHS, RHS, false))
24369 return DAG.getNode(X86ISD::FHSUB, SDLoc(N), VT, LHS, RHS);
24373 /// PerformFORCombine - Do target-specific dag combines on X86ISD::FOR and
24374 /// X86ISD::FXOR nodes.
24375 static SDValue PerformFORCombine(SDNode *N, SelectionDAG &DAG) {
24376 assert(N->getOpcode() == X86ISD::FOR || N->getOpcode() == X86ISD::FXOR);
24377 // F[X]OR(0.0, x) -> x
24378 // F[X]OR(x, 0.0) -> x
24379 if (ConstantFPSDNode *C = dyn_cast<ConstantFPSDNode>(N->getOperand(0)))
24380 if (C->getValueAPF().isPosZero())
24381 return N->getOperand(1);
24382 if (ConstantFPSDNode *C = dyn_cast<ConstantFPSDNode>(N->getOperand(1)))
24383 if (C->getValueAPF().isPosZero())
24384 return N->getOperand(0);
24388 /// PerformFMinFMaxCombine - Do target-specific dag combines on X86ISD::FMIN and
24389 /// X86ISD::FMAX nodes.
24390 static SDValue PerformFMinFMaxCombine(SDNode *N, SelectionDAG &DAG) {
24391 assert(N->getOpcode() == X86ISD::FMIN || N->getOpcode() == X86ISD::FMAX);
24393 // Only perform optimizations if UnsafeMath is used.
24394 if (!DAG.getTarget().Options.UnsafeFPMath)
24397 // If we run in unsafe-math mode, then convert the FMAX and FMIN nodes
24398 // into FMINC and FMAXC, which are Commutative operations.
24399 unsigned NewOp = 0;
24400 switch (N->getOpcode()) {
24401 default: llvm_unreachable("unknown opcode");
24402 case X86ISD::FMIN: NewOp = X86ISD::FMINC; break;
24403 case X86ISD::FMAX: NewOp = X86ISD::FMAXC; break;
24406 return DAG.getNode(NewOp, SDLoc(N), N->getValueType(0),
24407 N->getOperand(0), N->getOperand(1));
24410 /// PerformFANDCombine - Do target-specific dag combines on X86ISD::FAND nodes.
24411 static SDValue PerformFANDCombine(SDNode *N, SelectionDAG &DAG) {
24412 // FAND(0.0, x) -> 0.0
24413 // FAND(x, 0.0) -> 0.0
24414 if (ConstantFPSDNode *C = dyn_cast<ConstantFPSDNode>(N->getOperand(0)))
24415 if (C->getValueAPF().isPosZero())
24416 return N->getOperand(0);
24417 if (ConstantFPSDNode *C = dyn_cast<ConstantFPSDNode>(N->getOperand(1)))
24418 if (C->getValueAPF().isPosZero())
24419 return N->getOperand(1);
24423 /// PerformFANDNCombine - Do target-specific dag combines on X86ISD::FANDN nodes
24424 static SDValue PerformFANDNCombine(SDNode *N, SelectionDAG &DAG) {
24425 // FANDN(x, 0.0) -> 0.0
24426 // FANDN(0.0, x) -> x
24427 if (ConstantFPSDNode *C = dyn_cast<ConstantFPSDNode>(N->getOperand(0)))
24428 if (C->getValueAPF().isPosZero())
24429 return N->getOperand(1);
24430 if (ConstantFPSDNode *C = dyn_cast<ConstantFPSDNode>(N->getOperand(1)))
24431 if (C->getValueAPF().isPosZero())
24432 return N->getOperand(1);
24436 static SDValue PerformBTCombine(SDNode *N,
24438 TargetLowering::DAGCombinerInfo &DCI) {
24439 // BT ignores high bits in the bit index operand.
24440 SDValue Op1 = N->getOperand(1);
24441 if (Op1.hasOneUse()) {
24442 unsigned BitWidth = Op1.getValueSizeInBits();
24443 APInt DemandedMask = APInt::getLowBitsSet(BitWidth, Log2_32(BitWidth));
24444 APInt KnownZero, KnownOne;
24445 TargetLowering::TargetLoweringOpt TLO(DAG, !DCI.isBeforeLegalize(),
24446 !DCI.isBeforeLegalizeOps());
24447 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
24448 if (TLO.ShrinkDemandedConstant(Op1, DemandedMask) ||
24449 TLI.SimplifyDemandedBits(Op1, DemandedMask, KnownZero, KnownOne, TLO))
24450 DCI.CommitTargetLoweringOpt(TLO);
24455 static SDValue PerformVZEXT_MOVLCombine(SDNode *N, SelectionDAG &DAG) {
24456 SDValue Op = N->getOperand(0);
24457 if (Op.getOpcode() == ISD::BITCAST)
24458 Op = Op.getOperand(0);
24459 EVT VT = N->getValueType(0), OpVT = Op.getValueType();
24460 if (Op.getOpcode() == X86ISD::VZEXT_LOAD &&
24461 VT.getVectorElementType().getSizeInBits() ==
24462 OpVT.getVectorElementType().getSizeInBits()) {
24463 return DAG.getNode(ISD::BITCAST, SDLoc(N), VT, Op);
24468 static SDValue PerformSIGN_EXTEND_INREGCombine(SDNode *N, SelectionDAG &DAG,
24469 const X86Subtarget *Subtarget) {
24470 EVT VT = N->getValueType(0);
24471 if (!VT.isVector())
24474 SDValue N0 = N->getOperand(0);
24475 SDValue N1 = N->getOperand(1);
24476 EVT ExtraVT = cast<VTSDNode>(N1)->getVT();
24479 // The SIGN_EXTEND_INREG to v4i64 is expensive operation on the
24480 // both SSE and AVX2 since there is no sign-extended shift right
24481 // operation on a vector with 64-bit elements.
24482 //(sext_in_reg (v4i64 anyext (v4i32 x )), ExtraVT) ->
24483 // (v4i64 sext (v4i32 sext_in_reg (v4i32 x , ExtraVT)))
24484 if (VT == MVT::v4i64 && (N0.getOpcode() == ISD::ANY_EXTEND ||
24485 N0.getOpcode() == ISD::SIGN_EXTEND)) {
24486 SDValue N00 = N0.getOperand(0);
24488 // EXTLOAD has a better solution on AVX2,
24489 // it may be replaced with X86ISD::VSEXT node.
24490 if (N00.getOpcode() == ISD::LOAD && Subtarget->hasInt256())
24491 if (!ISD::isNormalLoad(N00.getNode()))
24494 if (N00.getValueType() == MVT::v4i32 && ExtraVT.getSizeInBits() < 128) {
24495 SDValue Tmp = DAG.getNode(ISD::SIGN_EXTEND_INREG, dl, MVT::v4i32,
24497 return DAG.getNode(ISD::SIGN_EXTEND, dl, MVT::v4i64, Tmp);
24503 static SDValue PerformSExtCombine(SDNode *N, SelectionDAG &DAG,
24504 TargetLowering::DAGCombinerInfo &DCI,
24505 const X86Subtarget *Subtarget) {
24506 SDValue N0 = N->getOperand(0);
24507 EVT VT = N->getValueType(0);
24509 // (i8,i32 sext (sdivrem (i8 x, i8 y)) ->
24510 // (i8,i32 (sdivrem_sext_hreg (i8 x, i8 y)
24511 // This exposes the sext to the sdivrem lowering, so that it directly extends
24512 // from AH (which we otherwise need to do contortions to access).
24513 if (N0.getOpcode() == ISD::SDIVREM && N0.getResNo() == 1 &&
24514 N0.getValueType() == MVT::i8 && VT == MVT::i32) {
24516 SDVTList NodeTys = DAG.getVTList(MVT::i8, VT);
24517 SDValue R = DAG.getNode(X86ISD::SDIVREM8_SEXT_HREG, dl, NodeTys,
24518 N0.getOperand(0), N0.getOperand(1));
24519 DAG.ReplaceAllUsesOfValueWith(N0.getValue(0), R.getValue(0));
24520 return R.getValue(1);
24523 if (!DCI.isBeforeLegalizeOps())
24526 if (!Subtarget->hasFp256())
24529 if (VT.isVector() && VT.getSizeInBits() == 256) {
24530 SDValue R = WidenMaskArithmetic(N, DAG, DCI, Subtarget);
24538 static SDValue PerformFMACombine(SDNode *N, SelectionDAG &DAG,
24539 const X86Subtarget* Subtarget) {
24541 EVT VT = N->getValueType(0);
24543 // Let legalize expand this if it isn't a legal type yet.
24544 if (!DAG.getTargetLoweringInfo().isTypeLegal(VT))
24547 EVT ScalarVT = VT.getScalarType();
24548 if ((ScalarVT != MVT::f32 && ScalarVT != MVT::f64) ||
24549 (!Subtarget->hasFMA() && !Subtarget->hasFMA4()))
24552 SDValue A = N->getOperand(0);
24553 SDValue B = N->getOperand(1);
24554 SDValue C = N->getOperand(2);
24556 bool NegA = (A.getOpcode() == ISD::FNEG);
24557 bool NegB = (B.getOpcode() == ISD::FNEG);
24558 bool NegC = (C.getOpcode() == ISD::FNEG);
24560 // Negative multiplication when NegA xor NegB
24561 bool NegMul = (NegA != NegB);
24563 A = A.getOperand(0);
24565 B = B.getOperand(0);
24567 C = C.getOperand(0);
24571 Opcode = (!NegC) ? X86ISD::FMADD : X86ISD::FMSUB;
24573 Opcode = (!NegC) ? X86ISD::FNMADD : X86ISD::FNMSUB;
24575 return DAG.getNode(Opcode, dl, VT, A, B, C);
24578 static SDValue PerformZExtCombine(SDNode *N, SelectionDAG &DAG,
24579 TargetLowering::DAGCombinerInfo &DCI,
24580 const X86Subtarget *Subtarget) {
24581 // (i32 zext (and (i8 x86isd::setcc_carry), 1)) ->
24582 // (and (i32 x86isd::setcc_carry), 1)
24583 // This eliminates the zext. This transformation is necessary because
24584 // ISD::SETCC is always legalized to i8.
24586 SDValue N0 = N->getOperand(0);
24587 EVT VT = N->getValueType(0);
24589 if (N0.getOpcode() == ISD::AND &&
24591 N0.getOperand(0).hasOneUse()) {
24592 SDValue N00 = N0.getOperand(0);
24593 if (N00.getOpcode() == X86ISD::SETCC_CARRY) {
24594 ConstantSDNode *C = dyn_cast<ConstantSDNode>(N0.getOperand(1));
24595 if (!C || C->getZExtValue() != 1)
24597 return DAG.getNode(ISD::AND, dl, VT,
24598 DAG.getNode(X86ISD::SETCC_CARRY, dl, VT,
24599 N00.getOperand(0), N00.getOperand(1)),
24600 DAG.getConstant(1, VT));
24604 if (N0.getOpcode() == ISD::TRUNCATE &&
24606 N0.getOperand(0).hasOneUse()) {
24607 SDValue N00 = N0.getOperand(0);
24608 if (N00.getOpcode() == X86ISD::SETCC_CARRY) {
24609 return DAG.getNode(ISD::AND, dl, VT,
24610 DAG.getNode(X86ISD::SETCC_CARRY, dl, VT,
24611 N00.getOperand(0), N00.getOperand(1)),
24612 DAG.getConstant(1, VT));
24615 if (VT.is256BitVector()) {
24616 SDValue R = WidenMaskArithmetic(N, DAG, DCI, Subtarget);
24621 // (i8,i32 zext (udivrem (i8 x, i8 y)) ->
24622 // (i8,i32 (udivrem_zext_hreg (i8 x, i8 y)
24623 // This exposes the zext to the udivrem lowering, so that it directly extends
24624 // from AH (which we otherwise need to do contortions to access).
24625 if (N0.getOpcode() == ISD::UDIVREM &&
24626 N0.getResNo() == 1 && N0.getValueType() == MVT::i8 &&
24627 (VT == MVT::i32 || VT == MVT::i64)) {
24628 SDVTList NodeTys = DAG.getVTList(MVT::i8, VT);
24629 SDValue R = DAG.getNode(X86ISD::UDIVREM8_ZEXT_HREG, dl, NodeTys,
24630 N0.getOperand(0), N0.getOperand(1));
24631 DAG.ReplaceAllUsesOfValueWith(N0.getValue(0), R.getValue(0));
24632 return R.getValue(1);
24638 // Optimize x == -y --> x+y == 0
24639 // x != -y --> x+y != 0
24640 static SDValue PerformISDSETCCCombine(SDNode *N, SelectionDAG &DAG,
24641 const X86Subtarget* Subtarget) {
24642 ISD::CondCode CC = cast<CondCodeSDNode>(N->getOperand(2))->get();
24643 SDValue LHS = N->getOperand(0);
24644 SDValue RHS = N->getOperand(1);
24645 EVT VT = N->getValueType(0);
24648 if ((CC == ISD::SETNE || CC == ISD::SETEQ) && LHS.getOpcode() == ISD::SUB)
24649 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(LHS.getOperand(0)))
24650 if (C->getAPIntValue() == 0 && LHS.hasOneUse()) {
24651 SDValue addV = DAG.getNode(ISD::ADD, SDLoc(N),
24652 LHS.getValueType(), RHS, LHS.getOperand(1));
24653 return DAG.getSetCC(SDLoc(N), N->getValueType(0),
24654 addV, DAG.getConstant(0, addV.getValueType()), CC);
24656 if ((CC == ISD::SETNE || CC == ISD::SETEQ) && RHS.getOpcode() == ISD::SUB)
24657 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(RHS.getOperand(0)))
24658 if (C->getAPIntValue() == 0 && RHS.hasOneUse()) {
24659 SDValue addV = DAG.getNode(ISD::ADD, SDLoc(N),
24660 RHS.getValueType(), LHS, RHS.getOperand(1));
24661 return DAG.getSetCC(SDLoc(N), N->getValueType(0),
24662 addV, DAG.getConstant(0, addV.getValueType()), CC);
24665 if (VT.getScalarType() == MVT::i1) {
24666 bool IsSEXT0 = (LHS.getOpcode() == ISD::SIGN_EXTEND) &&
24667 (LHS.getOperand(0).getValueType().getScalarType() == MVT::i1);
24668 bool IsVZero0 = ISD::isBuildVectorAllZeros(LHS.getNode());
24669 if (!IsSEXT0 && !IsVZero0)
24671 bool IsSEXT1 = (RHS.getOpcode() == ISD::SIGN_EXTEND) &&
24672 (RHS.getOperand(0).getValueType().getScalarType() == MVT::i1);
24673 bool IsVZero1 = ISD::isBuildVectorAllZeros(RHS.getNode());
24675 if (!IsSEXT1 && !IsVZero1)
24678 if (IsSEXT0 && IsVZero1) {
24679 assert(VT == LHS.getOperand(0).getValueType() && "Uexpected operand type");
24680 if (CC == ISD::SETEQ)
24681 return DAG.getNOT(DL, LHS.getOperand(0), VT);
24682 return LHS.getOperand(0);
24684 if (IsSEXT1 && IsVZero0) {
24685 assert(VT == RHS.getOperand(0).getValueType() && "Uexpected operand type");
24686 if (CC == ISD::SETEQ)
24687 return DAG.getNOT(DL, RHS.getOperand(0), VT);
24688 return RHS.getOperand(0);
24695 static SDValue PerformINSERTPSCombine(SDNode *N, SelectionDAG &DAG,
24696 const X86Subtarget *Subtarget) {
24698 MVT VT = N->getOperand(1)->getSimpleValueType(0);
24699 assert((VT == MVT::v4f32 || VT == MVT::v4i32) &&
24700 "X86insertps is only defined for v4x32");
24702 SDValue Ld = N->getOperand(1);
24703 if (MayFoldLoad(Ld)) {
24704 // Extract the countS bits from the immediate so we can get the proper
24705 // address when narrowing the vector load to a specific element.
24706 // When the second source op is a memory address, interps doesn't use
24707 // countS and just gets an f32 from that address.
24708 unsigned DestIndex =
24709 cast<ConstantSDNode>(N->getOperand(2))->getZExtValue() >> 6;
24710 Ld = NarrowVectorLoadToElement(cast<LoadSDNode>(Ld), DestIndex, DAG);
24714 // Create this as a scalar to vector to match the instruction pattern.
24715 SDValue LoadScalarToVector = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VT, Ld);
24716 // countS bits are ignored when loading from memory on insertps, which
24717 // means we don't need to explicitly set them to 0.
24718 return DAG.getNode(X86ISD::INSERTPS, dl, VT, N->getOperand(0),
24719 LoadScalarToVector, N->getOperand(2));
24722 // Helper function of PerformSETCCCombine. It is to materialize "setb reg"
24723 // as "sbb reg,reg", since it can be extended without zext and produces
24724 // an all-ones bit which is more useful than 0/1 in some cases.
24725 static SDValue MaterializeSETB(SDLoc DL, SDValue EFLAGS, SelectionDAG &DAG,
24728 return DAG.getNode(ISD::AND, DL, VT,
24729 DAG.getNode(X86ISD::SETCC_CARRY, DL, MVT::i8,
24730 DAG.getConstant(X86::COND_B, MVT::i8), EFLAGS),
24731 DAG.getConstant(1, VT));
24732 assert (VT == MVT::i1 && "Unexpected type for SECCC node");
24733 return DAG.getNode(ISD::TRUNCATE, DL, MVT::i1,
24734 DAG.getNode(X86ISD::SETCC_CARRY, DL, MVT::i8,
24735 DAG.getConstant(X86::COND_B, MVT::i8), EFLAGS));
24738 // Optimize RES = X86ISD::SETCC CONDCODE, EFLAG_INPUT
24739 static SDValue PerformSETCCCombine(SDNode *N, SelectionDAG &DAG,
24740 TargetLowering::DAGCombinerInfo &DCI,
24741 const X86Subtarget *Subtarget) {
24743 X86::CondCode CC = X86::CondCode(N->getConstantOperandVal(0));
24744 SDValue EFLAGS = N->getOperand(1);
24746 if (CC == X86::COND_A) {
24747 // Try to convert COND_A into COND_B in an attempt to facilitate
24748 // materializing "setb reg".
24750 // Do not flip "e > c", where "c" is a constant, because Cmp instruction
24751 // cannot take an immediate as its first operand.
24753 if (EFLAGS.getOpcode() == X86ISD::SUB && EFLAGS.hasOneUse() &&
24754 EFLAGS.getValueType().isInteger() &&
24755 !isa<ConstantSDNode>(EFLAGS.getOperand(1))) {
24756 SDValue NewSub = DAG.getNode(X86ISD::SUB, SDLoc(EFLAGS),
24757 EFLAGS.getNode()->getVTList(),
24758 EFLAGS.getOperand(1), EFLAGS.getOperand(0));
24759 SDValue NewEFLAGS = SDValue(NewSub.getNode(), EFLAGS.getResNo());
24760 return MaterializeSETB(DL, NewEFLAGS, DAG, N->getSimpleValueType(0));
24764 // Materialize "setb reg" as "sbb reg,reg", since it can be extended without
24765 // a zext and produces an all-ones bit which is more useful than 0/1 in some
24767 if (CC == X86::COND_B)
24768 return MaterializeSETB(DL, EFLAGS, DAG, N->getSimpleValueType(0));
24772 Flags = checkBoolTestSetCCCombine(EFLAGS, CC);
24773 if (Flags.getNode()) {
24774 SDValue Cond = DAG.getConstant(CC, MVT::i8);
24775 return DAG.getNode(X86ISD::SETCC, DL, N->getVTList(), Cond, Flags);
24781 // Optimize branch condition evaluation.
24783 static SDValue PerformBrCondCombine(SDNode *N, SelectionDAG &DAG,
24784 TargetLowering::DAGCombinerInfo &DCI,
24785 const X86Subtarget *Subtarget) {
24787 SDValue Chain = N->getOperand(0);
24788 SDValue Dest = N->getOperand(1);
24789 SDValue EFLAGS = N->getOperand(3);
24790 X86::CondCode CC = X86::CondCode(N->getConstantOperandVal(2));
24794 Flags = checkBoolTestSetCCCombine(EFLAGS, CC);
24795 if (Flags.getNode()) {
24796 SDValue Cond = DAG.getConstant(CC, MVT::i8);
24797 return DAG.getNode(X86ISD::BRCOND, DL, N->getVTList(), Chain, Dest, Cond,
24804 static SDValue performVectorCompareAndMaskUnaryOpCombine(SDNode *N,
24805 SelectionDAG &DAG) {
24806 // Take advantage of vector comparisons producing 0 or -1 in each lane to
24807 // optimize away operation when it's from a constant.
24809 // The general transformation is:
24810 // UNARYOP(AND(VECTOR_CMP(x,y), constant)) -->
24811 // AND(VECTOR_CMP(x,y), constant2)
24812 // constant2 = UNARYOP(constant)
24814 // Early exit if this isn't a vector operation, the operand of the
24815 // unary operation isn't a bitwise AND, or if the sizes of the operations
24816 // aren't the same.
24817 EVT VT = N->getValueType(0);
24818 if (!VT.isVector() || N->getOperand(0)->getOpcode() != ISD::AND ||
24819 N->getOperand(0)->getOperand(0)->getOpcode() != ISD::SETCC ||
24820 VT.getSizeInBits() != N->getOperand(0)->getValueType(0).getSizeInBits())
24823 // Now check that the other operand of the AND is a constant. We could
24824 // make the transformation for non-constant splats as well, but it's unclear
24825 // that would be a benefit as it would not eliminate any operations, just
24826 // perform one more step in scalar code before moving to the vector unit.
24827 if (BuildVectorSDNode *BV =
24828 dyn_cast<BuildVectorSDNode>(N->getOperand(0)->getOperand(1))) {
24829 // Bail out if the vector isn't a constant.
24830 if (!BV->isConstant())
24833 // Everything checks out. Build up the new and improved node.
24835 EVT IntVT = BV->getValueType(0);
24836 // Create a new constant of the appropriate type for the transformed
24838 SDValue SourceConst = DAG.getNode(N->getOpcode(), DL, VT, SDValue(BV, 0));
24839 // The AND node needs bitcasts to/from an integer vector type around it.
24840 SDValue MaskConst = DAG.getNode(ISD::BITCAST, DL, IntVT, SourceConst);
24841 SDValue NewAnd = DAG.getNode(ISD::AND, DL, IntVT,
24842 N->getOperand(0)->getOperand(0), MaskConst);
24843 SDValue Res = DAG.getNode(ISD::BITCAST, DL, VT, NewAnd);
24850 static SDValue PerformSINT_TO_FPCombine(SDNode *N, SelectionDAG &DAG,
24851 const X86TargetLowering *XTLI) {
24852 // First try to optimize away the conversion entirely when it's
24853 // conditionally from a constant. Vectors only.
24854 SDValue Res = performVectorCompareAndMaskUnaryOpCombine(N, DAG);
24855 if (Res != SDValue())
24858 // Now move on to more general possibilities.
24859 SDValue Op0 = N->getOperand(0);
24860 EVT InVT = Op0->getValueType(0);
24862 // SINT_TO_FP(v4i8) -> SINT_TO_FP(SEXT(v4i8 to v4i32))
24863 if (InVT == MVT::v8i8 || InVT == MVT::v4i8) {
24865 MVT DstVT = InVT == MVT::v4i8 ? MVT::v4i32 : MVT::v8i32;
24866 SDValue P = DAG.getNode(ISD::SIGN_EXTEND, dl, DstVT, Op0);
24867 return DAG.getNode(ISD::SINT_TO_FP, dl, N->getValueType(0), P);
24870 // Transform (SINT_TO_FP (i64 ...)) into an x87 operation if we have
24871 // a 32-bit target where SSE doesn't support i64->FP operations.
24872 if (Op0.getOpcode() == ISD::LOAD) {
24873 LoadSDNode *Ld = cast<LoadSDNode>(Op0.getNode());
24874 EVT VT = Ld->getValueType(0);
24875 if (!Ld->isVolatile() && !N->getValueType(0).isVector() &&
24876 ISD::isNON_EXTLoad(Op0.getNode()) && Op0.hasOneUse() &&
24877 !XTLI->getSubtarget()->is64Bit() &&
24879 SDValue FILDChain = XTLI->BuildFILD(SDValue(N, 0), Ld->getValueType(0),
24880 Ld->getChain(), Op0, DAG);
24881 DAG.ReplaceAllUsesOfValueWith(Op0.getValue(1), FILDChain.getValue(1));
24888 // Optimize RES, EFLAGS = X86ISD::ADC LHS, RHS, EFLAGS
24889 static SDValue PerformADCCombine(SDNode *N, SelectionDAG &DAG,
24890 X86TargetLowering::DAGCombinerInfo &DCI) {
24891 // If the LHS and RHS of the ADC node are zero, then it can't overflow and
24892 // the result is either zero or one (depending on the input carry bit).
24893 // Strength reduce this down to a "set on carry" aka SETCC_CARRY&1.
24894 if (X86::isZeroNode(N->getOperand(0)) &&
24895 X86::isZeroNode(N->getOperand(1)) &&
24896 // We don't have a good way to replace an EFLAGS use, so only do this when
24898 SDValue(N, 1).use_empty()) {
24900 EVT VT = N->getValueType(0);
24901 SDValue CarryOut = DAG.getConstant(0, N->getValueType(1));
24902 SDValue Res1 = DAG.getNode(ISD::AND, DL, VT,
24903 DAG.getNode(X86ISD::SETCC_CARRY, DL, VT,
24904 DAG.getConstant(X86::COND_B,MVT::i8),
24906 DAG.getConstant(1, VT));
24907 return DCI.CombineTo(N, Res1, CarryOut);
24913 // fold (add Y, (sete X, 0)) -> adc 0, Y
24914 // (add Y, (setne X, 0)) -> sbb -1, Y
24915 // (sub (sete X, 0), Y) -> sbb 0, Y
24916 // (sub (setne X, 0), Y) -> adc -1, Y
24917 static SDValue OptimizeConditionalInDecrement(SDNode *N, SelectionDAG &DAG) {
24920 // Look through ZExts.
24921 SDValue Ext = N->getOperand(N->getOpcode() == ISD::SUB ? 1 : 0);
24922 if (Ext.getOpcode() != ISD::ZERO_EXTEND || !Ext.hasOneUse())
24925 SDValue SetCC = Ext.getOperand(0);
24926 if (SetCC.getOpcode() != X86ISD::SETCC || !SetCC.hasOneUse())
24929 X86::CondCode CC = (X86::CondCode)SetCC.getConstantOperandVal(0);
24930 if (CC != X86::COND_E && CC != X86::COND_NE)
24933 SDValue Cmp = SetCC.getOperand(1);
24934 if (Cmp.getOpcode() != X86ISD::CMP || !Cmp.hasOneUse() ||
24935 !X86::isZeroNode(Cmp.getOperand(1)) ||
24936 !Cmp.getOperand(0).getValueType().isInteger())
24939 SDValue CmpOp0 = Cmp.getOperand(0);
24940 SDValue NewCmp = DAG.getNode(X86ISD::CMP, DL, MVT::i32, CmpOp0,
24941 DAG.getConstant(1, CmpOp0.getValueType()));
24943 SDValue OtherVal = N->getOperand(N->getOpcode() == ISD::SUB ? 0 : 1);
24944 if (CC == X86::COND_NE)
24945 return DAG.getNode(N->getOpcode() == ISD::SUB ? X86ISD::ADC : X86ISD::SBB,
24946 DL, OtherVal.getValueType(), OtherVal,
24947 DAG.getConstant(-1ULL, OtherVal.getValueType()), NewCmp);
24948 return DAG.getNode(N->getOpcode() == ISD::SUB ? X86ISD::SBB : X86ISD::ADC,
24949 DL, OtherVal.getValueType(), OtherVal,
24950 DAG.getConstant(0, OtherVal.getValueType()), NewCmp);
24953 /// PerformADDCombine - Do target-specific dag combines on integer adds.
24954 static SDValue PerformAddCombine(SDNode *N, SelectionDAG &DAG,
24955 const X86Subtarget *Subtarget) {
24956 EVT VT = N->getValueType(0);
24957 SDValue Op0 = N->getOperand(0);
24958 SDValue Op1 = N->getOperand(1);
24960 // Try to synthesize horizontal adds from adds of shuffles.
24961 if (((Subtarget->hasSSSE3() && (VT == MVT::v8i16 || VT == MVT::v4i32)) ||
24962 (Subtarget->hasInt256() && (VT == MVT::v16i16 || VT == MVT::v8i32))) &&
24963 isHorizontalBinOp(Op0, Op1, true))
24964 return DAG.getNode(X86ISD::HADD, SDLoc(N), VT, Op0, Op1);
24966 return OptimizeConditionalInDecrement(N, DAG);
24969 static SDValue PerformSubCombine(SDNode *N, SelectionDAG &DAG,
24970 const X86Subtarget *Subtarget) {
24971 SDValue Op0 = N->getOperand(0);
24972 SDValue Op1 = N->getOperand(1);
24974 // X86 can't encode an immediate LHS of a sub. See if we can push the
24975 // negation into a preceding instruction.
24976 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op0)) {
24977 // If the RHS of the sub is a XOR with one use and a constant, invert the
24978 // immediate. Then add one to the LHS of the sub so we can turn
24979 // X-Y -> X+~Y+1, saving one register.
24980 if (Op1->hasOneUse() && Op1.getOpcode() == ISD::XOR &&
24981 isa<ConstantSDNode>(Op1.getOperand(1))) {
24982 APInt XorC = cast<ConstantSDNode>(Op1.getOperand(1))->getAPIntValue();
24983 EVT VT = Op0.getValueType();
24984 SDValue NewXor = DAG.getNode(ISD::XOR, SDLoc(Op1), VT,
24986 DAG.getConstant(~XorC, VT));
24987 return DAG.getNode(ISD::ADD, SDLoc(N), VT, NewXor,
24988 DAG.getConstant(C->getAPIntValue()+1, VT));
24992 // Try to synthesize horizontal adds from adds of shuffles.
24993 EVT VT = N->getValueType(0);
24994 if (((Subtarget->hasSSSE3() && (VT == MVT::v8i16 || VT == MVT::v4i32)) ||
24995 (Subtarget->hasInt256() && (VT == MVT::v16i16 || VT == MVT::v8i32))) &&
24996 isHorizontalBinOp(Op0, Op1, true))
24997 return DAG.getNode(X86ISD::HSUB, SDLoc(N), VT, Op0, Op1);
24999 return OptimizeConditionalInDecrement(N, DAG);
25002 /// performVZEXTCombine - Performs build vector combines
25003 static SDValue performVZEXTCombine(SDNode *N, SelectionDAG &DAG,
25004 TargetLowering::DAGCombinerInfo &DCI,
25005 const X86Subtarget *Subtarget) {
25007 MVT VT = N->getSimpleValueType(0);
25008 SDValue Op = N->getOperand(0);
25009 MVT OpVT = Op.getSimpleValueType();
25010 MVT OpEltVT = OpVT.getVectorElementType();
25011 unsigned InputBits = OpEltVT.getSizeInBits() * VT.getVectorNumElements();
25013 // (vzext (bitcast (vzext (x)) -> (vzext x)
25015 while (V.getOpcode() == ISD::BITCAST)
25016 V = V.getOperand(0);
25018 if (V != Op && V.getOpcode() == X86ISD::VZEXT) {
25019 MVT InnerVT = V.getSimpleValueType();
25020 MVT InnerEltVT = InnerVT.getVectorElementType();
25022 // If the element sizes match exactly, we can just do one larger vzext. This
25023 // is always an exact type match as vzext operates on integer types.
25024 if (OpEltVT == InnerEltVT) {
25025 assert(OpVT == InnerVT && "Types must match for vzext!");
25026 return DAG.getNode(X86ISD::VZEXT, DL, VT, V.getOperand(0));
25029 // The only other way we can combine them is if only a single element of the
25030 // inner vzext is used in the input to the outer vzext.
25031 if (InnerEltVT.getSizeInBits() < InputBits)
25034 // In this case, the inner vzext is completely dead because we're going to
25035 // only look at bits inside of the low element. Just do the outer vzext on
25036 // a bitcast of the input to the inner.
25037 return DAG.getNode(X86ISD::VZEXT, DL, VT,
25038 DAG.getNode(ISD::BITCAST, DL, OpVT, V));
25041 // Check if we can bypass extracting and re-inserting an element of an input
25042 // vector. Essentialy:
25043 // (bitcast (sclr2vec (ext_vec_elt x))) -> (bitcast x)
25044 if (V.getOpcode() == ISD::SCALAR_TO_VECTOR &&
25045 V.getOperand(0).getOpcode() == ISD::EXTRACT_VECTOR_ELT &&
25046 V.getOperand(0).getSimpleValueType().getSizeInBits() == InputBits) {
25047 SDValue ExtractedV = V.getOperand(0);
25048 SDValue OrigV = ExtractedV.getOperand(0);
25049 if (auto *ExtractIdx = dyn_cast<ConstantSDNode>(ExtractedV.getOperand(1)))
25050 if (ExtractIdx->getZExtValue() == 0) {
25051 MVT OrigVT = OrigV.getSimpleValueType();
25052 // Extract a subvector if necessary...
25053 if (OrigVT.getSizeInBits() > OpVT.getSizeInBits()) {
25054 int Ratio = OrigVT.getSizeInBits() / OpVT.getSizeInBits();
25055 OrigVT = MVT::getVectorVT(OrigVT.getVectorElementType(),
25056 OrigVT.getVectorNumElements() / Ratio);
25057 OrigV = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, OrigVT, OrigV,
25058 DAG.getIntPtrConstant(0));
25060 Op = DAG.getNode(ISD::BITCAST, DL, OpVT, OrigV);
25061 return DAG.getNode(X86ISD::VZEXT, DL, VT, Op);
25068 SDValue X86TargetLowering::PerformDAGCombine(SDNode *N,
25069 DAGCombinerInfo &DCI) const {
25070 SelectionDAG &DAG = DCI.DAG;
25071 switch (N->getOpcode()) {
25073 case ISD::EXTRACT_VECTOR_ELT:
25074 return PerformEXTRACT_VECTOR_ELTCombine(N, DAG, DCI);
25077 case X86ISD::SHRUNKBLEND:
25078 return PerformSELECTCombine(N, DAG, DCI, Subtarget);
25079 case X86ISD::CMOV: return PerformCMOVCombine(N, DAG, DCI, Subtarget);
25080 case ISD::ADD: return PerformAddCombine(N, DAG, Subtarget);
25081 case ISD::SUB: return PerformSubCombine(N, DAG, Subtarget);
25082 case X86ISD::ADC: return PerformADCCombine(N, DAG, DCI);
25083 case ISD::MUL: return PerformMulCombine(N, DAG, DCI);
25086 case ISD::SRL: return PerformShiftCombine(N, DAG, DCI, Subtarget);
25087 case ISD::AND: return PerformAndCombine(N, DAG, DCI, Subtarget);
25088 case ISD::OR: return PerformOrCombine(N, DAG, DCI, Subtarget);
25089 case ISD::XOR: return PerformXorCombine(N, DAG, DCI, Subtarget);
25090 case ISD::LOAD: return PerformLOADCombine(N, DAG, DCI, Subtarget);
25091 case ISD::STORE: return PerformSTORECombine(N, DAG, Subtarget);
25092 case ISD::SINT_TO_FP: return PerformSINT_TO_FPCombine(N, DAG, this);
25093 case ISD::FADD: return PerformFADDCombine(N, DAG, Subtarget);
25094 case ISD::FSUB: return PerformFSUBCombine(N, DAG, Subtarget);
25096 case X86ISD::FOR: return PerformFORCombine(N, DAG);
25098 case X86ISD::FMAX: return PerformFMinFMaxCombine(N, DAG);
25099 case X86ISD::FAND: return PerformFANDCombine(N, DAG);
25100 case X86ISD::FANDN: return PerformFANDNCombine(N, DAG);
25101 case X86ISD::BT: return PerformBTCombine(N, DAG, DCI);
25102 case X86ISD::VZEXT_MOVL: return PerformVZEXT_MOVLCombine(N, DAG);
25103 case ISD::ANY_EXTEND:
25104 case ISD::ZERO_EXTEND: return PerformZExtCombine(N, DAG, DCI, Subtarget);
25105 case ISD::SIGN_EXTEND: return PerformSExtCombine(N, DAG, DCI, Subtarget);
25106 case ISD::SIGN_EXTEND_INREG:
25107 return PerformSIGN_EXTEND_INREGCombine(N, DAG, Subtarget);
25108 case ISD::TRUNCATE: return PerformTruncateCombine(N, DAG,DCI,Subtarget);
25109 case ISD::SETCC: return PerformISDSETCCCombine(N, DAG, Subtarget);
25110 case X86ISD::SETCC: return PerformSETCCCombine(N, DAG, DCI, Subtarget);
25111 case X86ISD::BRCOND: return PerformBrCondCombine(N, DAG, DCI, Subtarget);
25112 case X86ISD::VZEXT: return performVZEXTCombine(N, DAG, DCI, Subtarget);
25113 case X86ISD::SHUFP: // Handle all target specific shuffles
25114 case X86ISD::PALIGNR:
25115 case X86ISD::UNPCKH:
25116 case X86ISD::UNPCKL:
25117 case X86ISD::MOVHLPS:
25118 case X86ISD::MOVLHPS:
25119 case X86ISD::PSHUFB:
25120 case X86ISD::PSHUFD:
25121 case X86ISD::PSHUFHW:
25122 case X86ISD::PSHUFLW:
25123 case X86ISD::MOVSS:
25124 case X86ISD::MOVSD:
25125 case X86ISD::VPERMILPI:
25126 case X86ISD::VPERM2X128:
25127 case ISD::VECTOR_SHUFFLE: return PerformShuffleCombine(N, DAG, DCI,Subtarget);
25128 case ISD::FMA: return PerformFMACombine(N, DAG, Subtarget);
25129 case ISD::INTRINSIC_WO_CHAIN:
25130 return PerformINTRINSIC_WO_CHAINCombine(N, DAG, Subtarget);
25131 case X86ISD::INSERTPS:
25132 return PerformINSERTPSCombine(N, DAG, Subtarget);
25133 case ISD::BUILD_VECTOR: return PerformBUILD_VECTORCombine(N, DAG, Subtarget);
25139 /// isTypeDesirableForOp - Return true if the target has native support for
25140 /// the specified value type and it is 'desirable' to use the type for the
25141 /// given node type. e.g. On x86 i16 is legal, but undesirable since i16
25142 /// instruction encodings are longer and some i16 instructions are slow.
25143 bool X86TargetLowering::isTypeDesirableForOp(unsigned Opc, EVT VT) const {
25144 if (!isTypeLegal(VT))
25146 if (VT != MVT::i16)
25153 case ISD::SIGN_EXTEND:
25154 case ISD::ZERO_EXTEND:
25155 case ISD::ANY_EXTEND:
25168 /// IsDesirableToPromoteOp - This method query the target whether it is
25169 /// beneficial for dag combiner to promote the specified node. If true, it
25170 /// should return the desired promotion type by reference.
25171 bool X86TargetLowering::IsDesirableToPromoteOp(SDValue Op, EVT &PVT) const {
25172 EVT VT = Op.getValueType();
25173 if (VT != MVT::i16)
25176 bool Promote = false;
25177 bool Commute = false;
25178 switch (Op.getOpcode()) {
25181 LoadSDNode *LD = cast<LoadSDNode>(Op);
25182 // If the non-extending load has a single use and it's not live out, then it
25183 // might be folded.
25184 if (LD->getExtensionType() == ISD::NON_EXTLOAD /*&&
25185 Op.hasOneUse()*/) {
25186 for (SDNode::use_iterator UI = Op.getNode()->use_begin(),
25187 UE = Op.getNode()->use_end(); UI != UE; ++UI) {
25188 // The only case where we'd want to promote LOAD (rather then it being
25189 // promoted as an operand is when it's only use is liveout.
25190 if (UI->getOpcode() != ISD::CopyToReg)
25197 case ISD::SIGN_EXTEND:
25198 case ISD::ZERO_EXTEND:
25199 case ISD::ANY_EXTEND:
25204 SDValue N0 = Op.getOperand(0);
25205 // Look out for (store (shl (load), x)).
25206 if (MayFoldLoad(N0) && MayFoldIntoStore(Op))
25219 SDValue N0 = Op.getOperand(0);
25220 SDValue N1 = Op.getOperand(1);
25221 if (!Commute && MayFoldLoad(N1))
25223 // Avoid disabling potential load folding opportunities.
25224 if (MayFoldLoad(N0) && (!isa<ConstantSDNode>(N1) || MayFoldIntoStore(Op)))
25226 if (MayFoldLoad(N1) && (!isa<ConstantSDNode>(N0) || MayFoldIntoStore(Op)))
25236 //===----------------------------------------------------------------------===//
25237 // X86 Inline Assembly Support
25238 //===----------------------------------------------------------------------===//
25241 // Helper to match a string separated by whitespace.
25242 bool matchAsmImpl(StringRef s, ArrayRef<const StringRef *> args) {
25243 s = s.substr(s.find_first_not_of(" \t")); // Skip leading whitespace.
25245 for (unsigned i = 0, e = args.size(); i != e; ++i) {
25246 StringRef piece(*args[i]);
25247 if (!s.startswith(piece)) // Check if the piece matches.
25250 s = s.substr(piece.size());
25251 StringRef::size_type pos = s.find_first_not_of(" \t");
25252 if (pos == 0) // We matched a prefix.
25260 const VariadicFunction1<bool, StringRef, StringRef, matchAsmImpl> matchAsm={};
25263 static bool clobbersFlagRegisters(const SmallVector<StringRef, 4> &AsmPieces) {
25265 if (AsmPieces.size() == 3 || AsmPieces.size() == 4) {
25266 if (std::count(AsmPieces.begin(), AsmPieces.end(), "~{cc}") &&
25267 std::count(AsmPieces.begin(), AsmPieces.end(), "~{flags}") &&
25268 std::count(AsmPieces.begin(), AsmPieces.end(), "~{fpsr}")) {
25270 if (AsmPieces.size() == 3)
25272 else if (std::count(AsmPieces.begin(), AsmPieces.end(), "~{dirflag}"))
25279 bool X86TargetLowering::ExpandInlineAsm(CallInst *CI) const {
25280 InlineAsm *IA = cast<InlineAsm>(CI->getCalledValue());
25282 std::string AsmStr = IA->getAsmString();
25284 IntegerType *Ty = dyn_cast<IntegerType>(CI->getType());
25285 if (!Ty || Ty->getBitWidth() % 16 != 0)
25288 // TODO: should remove alternatives from the asmstring: "foo {a|b}" -> "foo a"
25289 SmallVector<StringRef, 4> AsmPieces;
25290 SplitString(AsmStr, AsmPieces, ";\n");
25292 switch (AsmPieces.size()) {
25293 default: return false;
25295 // FIXME: this should verify that we are targeting a 486 or better. If not,
25296 // we will turn this bswap into something that will be lowered to logical
25297 // ops instead of emitting the bswap asm. For now, we don't support 486 or
25298 // lower so don't worry about this.
25300 if (matchAsm(AsmPieces[0], "bswap", "$0") ||
25301 matchAsm(AsmPieces[0], "bswapl", "$0") ||
25302 matchAsm(AsmPieces[0], "bswapq", "$0") ||
25303 matchAsm(AsmPieces[0], "bswap", "${0:q}") ||
25304 matchAsm(AsmPieces[0], "bswapl", "${0:q}") ||
25305 matchAsm(AsmPieces[0], "bswapq", "${0:q}")) {
25306 // No need to check constraints, nothing other than the equivalent of
25307 // "=r,0" would be valid here.
25308 return IntrinsicLowering::LowerToByteSwap(CI);
25311 // rorw $$8, ${0:w} --> llvm.bswap.i16
25312 if (CI->getType()->isIntegerTy(16) &&
25313 IA->getConstraintString().compare(0, 5, "=r,0,") == 0 &&
25314 (matchAsm(AsmPieces[0], "rorw", "$$8,", "${0:w}") ||
25315 matchAsm(AsmPieces[0], "rolw", "$$8,", "${0:w}"))) {
25317 const std::string &ConstraintsStr = IA->getConstraintString();
25318 SplitString(StringRef(ConstraintsStr).substr(5), AsmPieces, ",");
25319 array_pod_sort(AsmPieces.begin(), AsmPieces.end());
25320 if (clobbersFlagRegisters(AsmPieces))
25321 return IntrinsicLowering::LowerToByteSwap(CI);
25325 if (CI->getType()->isIntegerTy(32) &&
25326 IA->getConstraintString().compare(0, 5, "=r,0,") == 0 &&
25327 matchAsm(AsmPieces[0], "rorw", "$$8,", "${0:w}") &&
25328 matchAsm(AsmPieces[1], "rorl", "$$16,", "$0") &&
25329 matchAsm(AsmPieces[2], "rorw", "$$8,", "${0:w}")) {
25331 const std::string &ConstraintsStr = IA->getConstraintString();
25332 SplitString(StringRef(ConstraintsStr).substr(5), AsmPieces, ",");
25333 array_pod_sort(AsmPieces.begin(), AsmPieces.end());
25334 if (clobbersFlagRegisters(AsmPieces))
25335 return IntrinsicLowering::LowerToByteSwap(CI);
25338 if (CI->getType()->isIntegerTy(64)) {
25339 InlineAsm::ConstraintInfoVector Constraints = IA->ParseConstraints();
25340 if (Constraints.size() >= 2 &&
25341 Constraints[0].Codes.size() == 1 && Constraints[0].Codes[0] == "A" &&
25342 Constraints[1].Codes.size() == 1 && Constraints[1].Codes[0] == "0") {
25343 // bswap %eax / bswap %edx / xchgl %eax, %edx -> llvm.bswap.i64
25344 if (matchAsm(AsmPieces[0], "bswap", "%eax") &&
25345 matchAsm(AsmPieces[1], "bswap", "%edx") &&
25346 matchAsm(AsmPieces[2], "xchgl", "%eax,", "%edx"))
25347 return IntrinsicLowering::LowerToByteSwap(CI);
25355 /// getConstraintType - Given a constraint letter, return the type of
25356 /// constraint it is for this target.
25357 X86TargetLowering::ConstraintType
25358 X86TargetLowering::getConstraintType(const std::string &Constraint) const {
25359 if (Constraint.size() == 1) {
25360 switch (Constraint[0]) {
25371 return C_RegisterClass;
25395 return TargetLowering::getConstraintType(Constraint);
25398 /// Examine constraint type and operand type and determine a weight value.
25399 /// This object must already have been set up with the operand type
25400 /// and the current alternative constraint selected.
25401 TargetLowering::ConstraintWeight
25402 X86TargetLowering::getSingleConstraintMatchWeight(
25403 AsmOperandInfo &info, const char *constraint) const {
25404 ConstraintWeight weight = CW_Invalid;
25405 Value *CallOperandVal = info.CallOperandVal;
25406 // If we don't have a value, we can't do a match,
25407 // but allow it at the lowest weight.
25408 if (!CallOperandVal)
25410 Type *type = CallOperandVal->getType();
25411 // Look at the constraint type.
25412 switch (*constraint) {
25414 weight = TargetLowering::getSingleConstraintMatchWeight(info, constraint);
25425 if (CallOperandVal->getType()->isIntegerTy())
25426 weight = CW_SpecificReg;
25431 if (type->isFloatingPointTy())
25432 weight = CW_SpecificReg;
25435 if (type->isX86_MMXTy() && Subtarget->hasMMX())
25436 weight = CW_SpecificReg;
25440 if (((type->getPrimitiveSizeInBits() == 128) && Subtarget->hasSSE1()) ||
25441 ((type->getPrimitiveSizeInBits() == 256) && Subtarget->hasFp256()))
25442 weight = CW_Register;
25445 if (ConstantInt *C = dyn_cast<ConstantInt>(info.CallOperandVal)) {
25446 if (C->getZExtValue() <= 31)
25447 weight = CW_Constant;
25451 if (ConstantInt *C = dyn_cast<ConstantInt>(CallOperandVal)) {
25452 if (C->getZExtValue() <= 63)
25453 weight = CW_Constant;
25457 if (ConstantInt *C = dyn_cast<ConstantInt>(CallOperandVal)) {
25458 if ((C->getSExtValue() >= -0x80) && (C->getSExtValue() <= 0x7f))
25459 weight = CW_Constant;
25463 if (ConstantInt *C = dyn_cast<ConstantInt>(CallOperandVal)) {
25464 if ((C->getZExtValue() == 0xff) || (C->getZExtValue() == 0xffff))
25465 weight = CW_Constant;
25469 if (ConstantInt *C = dyn_cast<ConstantInt>(CallOperandVal)) {
25470 if (C->getZExtValue() <= 3)
25471 weight = CW_Constant;
25475 if (ConstantInt *C = dyn_cast<ConstantInt>(CallOperandVal)) {
25476 if (C->getZExtValue() <= 0xff)
25477 weight = CW_Constant;
25482 if (dyn_cast<ConstantFP>(CallOperandVal)) {
25483 weight = CW_Constant;
25487 if (ConstantInt *C = dyn_cast<ConstantInt>(CallOperandVal)) {
25488 if ((C->getSExtValue() >= -0x80000000LL) &&
25489 (C->getSExtValue() <= 0x7fffffffLL))
25490 weight = CW_Constant;
25494 if (ConstantInt *C = dyn_cast<ConstantInt>(CallOperandVal)) {
25495 if (C->getZExtValue() <= 0xffffffff)
25496 weight = CW_Constant;
25503 /// LowerXConstraint - try to replace an X constraint, which matches anything,
25504 /// with another that has more specific requirements based on the type of the
25505 /// corresponding operand.
25506 const char *X86TargetLowering::
25507 LowerXConstraint(EVT ConstraintVT) const {
25508 // FP X constraints get lowered to SSE1/2 registers if available, otherwise
25509 // 'f' like normal targets.
25510 if (ConstraintVT.isFloatingPoint()) {
25511 if (Subtarget->hasSSE2())
25513 if (Subtarget->hasSSE1())
25517 return TargetLowering::LowerXConstraint(ConstraintVT);
25520 /// LowerAsmOperandForConstraint - Lower the specified operand into the Ops
25521 /// vector. If it is invalid, don't add anything to Ops.
25522 void X86TargetLowering::LowerAsmOperandForConstraint(SDValue Op,
25523 std::string &Constraint,
25524 std::vector<SDValue>&Ops,
25525 SelectionDAG &DAG) const {
25528 // Only support length 1 constraints for now.
25529 if (Constraint.length() > 1) return;
25531 char ConstraintLetter = Constraint[0];
25532 switch (ConstraintLetter) {
25535 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op)) {
25536 if (C->getZExtValue() <= 31) {
25537 Result = DAG.getTargetConstant(C->getZExtValue(), Op.getValueType());
25543 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op)) {
25544 if (C->getZExtValue() <= 63) {
25545 Result = DAG.getTargetConstant(C->getZExtValue(), Op.getValueType());
25551 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op)) {
25552 if (isInt<8>(C->getSExtValue())) {
25553 Result = DAG.getTargetConstant(C->getZExtValue(), Op.getValueType());
25559 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op)) {
25560 if (C->getZExtValue() <= 255) {
25561 Result = DAG.getTargetConstant(C->getZExtValue(), Op.getValueType());
25567 // 32-bit signed value
25568 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op)) {
25569 if (ConstantInt::isValueValidForType(Type::getInt32Ty(*DAG.getContext()),
25570 C->getSExtValue())) {
25571 // Widen to 64 bits here to get it sign extended.
25572 Result = DAG.getTargetConstant(C->getSExtValue(), MVT::i64);
25575 // FIXME gcc accepts some relocatable values here too, but only in certain
25576 // memory models; it's complicated.
25581 // 32-bit unsigned value
25582 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op)) {
25583 if (ConstantInt::isValueValidForType(Type::getInt32Ty(*DAG.getContext()),
25584 C->getZExtValue())) {
25585 Result = DAG.getTargetConstant(C->getZExtValue(), Op.getValueType());
25589 // FIXME gcc accepts some relocatable values here too, but only in certain
25590 // memory models; it's complicated.
25594 // Literal immediates are always ok.
25595 if (ConstantSDNode *CST = dyn_cast<ConstantSDNode>(Op)) {
25596 // Widen to 64 bits here to get it sign extended.
25597 Result = DAG.getTargetConstant(CST->getSExtValue(), MVT::i64);
25601 // In any sort of PIC mode addresses need to be computed at runtime by
25602 // adding in a register or some sort of table lookup. These can't
25603 // be used as immediates.
25604 if (Subtarget->isPICStyleGOT() || Subtarget->isPICStyleStubPIC())
25607 // If we are in non-pic codegen mode, we allow the address of a global (with
25608 // an optional displacement) to be used with 'i'.
25609 GlobalAddressSDNode *GA = nullptr;
25610 int64_t Offset = 0;
25612 // Match either (GA), (GA+C), (GA+C1+C2), etc.
25614 if ((GA = dyn_cast<GlobalAddressSDNode>(Op))) {
25615 Offset += GA->getOffset();
25617 } else if (Op.getOpcode() == ISD::ADD) {
25618 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op.getOperand(1))) {
25619 Offset += C->getZExtValue();
25620 Op = Op.getOperand(0);
25623 } else if (Op.getOpcode() == ISD::SUB) {
25624 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op.getOperand(1))) {
25625 Offset += -C->getZExtValue();
25626 Op = Op.getOperand(0);
25631 // Otherwise, this isn't something we can handle, reject it.
25635 const GlobalValue *GV = GA->getGlobal();
25636 // If we require an extra load to get this address, as in PIC mode, we
25637 // can't accept it.
25638 if (isGlobalStubReference(
25639 Subtarget->ClassifyGlobalReference(GV, DAG.getTarget())))
25642 Result = DAG.getTargetGlobalAddress(GV, SDLoc(Op),
25643 GA->getValueType(0), Offset);
25648 if (Result.getNode()) {
25649 Ops.push_back(Result);
25652 return TargetLowering::LowerAsmOperandForConstraint(Op, Constraint, Ops, DAG);
25655 std::pair<unsigned, const TargetRegisterClass*>
25656 X86TargetLowering::getRegForInlineAsmConstraint(const std::string &Constraint,
25658 // First, see if this is a constraint that directly corresponds to an LLVM
25660 if (Constraint.size() == 1) {
25661 // GCC Constraint Letters
25662 switch (Constraint[0]) {
25664 // TODO: Slight differences here in allocation order and leaving
25665 // RIP in the class. Do they matter any more here than they do
25666 // in the normal allocation?
25667 case 'q': // GENERAL_REGS in 64-bit mode, Q_REGS in 32-bit mode.
25668 if (Subtarget->is64Bit()) {
25669 if (VT == MVT::i32 || VT == MVT::f32)
25670 return std::make_pair(0U, &X86::GR32RegClass);
25671 if (VT == MVT::i16)
25672 return std::make_pair(0U, &X86::GR16RegClass);
25673 if (VT == MVT::i8 || VT == MVT::i1)
25674 return std::make_pair(0U, &X86::GR8RegClass);
25675 if (VT == MVT::i64 || VT == MVT::f64)
25676 return std::make_pair(0U, &X86::GR64RegClass);
25679 // 32-bit fallthrough
25680 case 'Q': // Q_REGS
25681 if (VT == MVT::i32 || VT == MVT::f32)
25682 return std::make_pair(0U, &X86::GR32_ABCDRegClass);
25683 if (VT == MVT::i16)
25684 return std::make_pair(0U, &X86::GR16_ABCDRegClass);
25685 if (VT == MVT::i8 || VT == MVT::i1)
25686 return std::make_pair(0U, &X86::GR8_ABCD_LRegClass);
25687 if (VT == MVT::i64)
25688 return std::make_pair(0U, &X86::GR64_ABCDRegClass);
25690 case 'r': // GENERAL_REGS
25691 case 'l': // INDEX_REGS
25692 if (VT == MVT::i8 || VT == MVT::i1)
25693 return std::make_pair(0U, &X86::GR8RegClass);
25694 if (VT == MVT::i16)
25695 return std::make_pair(0U, &X86::GR16RegClass);
25696 if (VT == MVT::i32 || VT == MVT::f32 || !Subtarget->is64Bit())
25697 return std::make_pair(0U, &X86::GR32RegClass);
25698 return std::make_pair(0U, &X86::GR64RegClass);
25699 case 'R': // LEGACY_REGS
25700 if (VT == MVT::i8 || VT == MVT::i1)
25701 return std::make_pair(0U, &X86::GR8_NOREXRegClass);
25702 if (VT == MVT::i16)
25703 return std::make_pair(0U, &X86::GR16_NOREXRegClass);
25704 if (VT == MVT::i32 || !Subtarget->is64Bit())
25705 return std::make_pair(0U, &X86::GR32_NOREXRegClass);
25706 return std::make_pair(0U, &X86::GR64_NOREXRegClass);
25707 case 'f': // FP Stack registers.
25708 // If SSE is enabled for this VT, use f80 to ensure the isel moves the
25709 // value to the correct fpstack register class.
25710 if (VT == MVT::f32 && !isScalarFPTypeInSSEReg(VT))
25711 return std::make_pair(0U, &X86::RFP32RegClass);
25712 if (VT == MVT::f64 && !isScalarFPTypeInSSEReg(VT))
25713 return std::make_pair(0U, &X86::RFP64RegClass);
25714 return std::make_pair(0U, &X86::RFP80RegClass);
25715 case 'y': // MMX_REGS if MMX allowed.
25716 if (!Subtarget->hasMMX()) break;
25717 return std::make_pair(0U, &X86::VR64RegClass);
25718 case 'Y': // SSE_REGS if SSE2 allowed
25719 if (!Subtarget->hasSSE2()) break;
25721 case 'x': // SSE_REGS if SSE1 allowed or AVX_REGS if AVX allowed
25722 if (!Subtarget->hasSSE1()) break;
25724 switch (VT.SimpleTy) {
25726 // Scalar SSE types.
25729 return std::make_pair(0U, &X86::FR32RegClass);
25732 return std::make_pair(0U, &X86::FR64RegClass);
25740 return std::make_pair(0U, &X86::VR128RegClass);
25748 return std::make_pair(0U, &X86::VR256RegClass);
25753 return std::make_pair(0U, &X86::VR512RegClass);
25759 // Use the default implementation in TargetLowering to convert the register
25760 // constraint into a member of a register class.
25761 std::pair<unsigned, const TargetRegisterClass*> Res;
25762 Res = TargetLowering::getRegForInlineAsmConstraint(Constraint, VT);
25764 // Not found as a standard register?
25766 // Map st(0) -> st(7) -> ST0
25767 if (Constraint.size() == 7 && Constraint[0] == '{' &&
25768 tolower(Constraint[1]) == 's' &&
25769 tolower(Constraint[2]) == 't' &&
25770 Constraint[3] == '(' &&
25771 (Constraint[4] >= '0' && Constraint[4] <= '7') &&
25772 Constraint[5] == ')' &&
25773 Constraint[6] == '}') {
25775 Res.first = X86::FP0+Constraint[4]-'0';
25776 Res.second = &X86::RFP80RegClass;
25780 // GCC allows "st(0)" to be called just plain "st".
25781 if (StringRef("{st}").equals_lower(Constraint)) {
25782 Res.first = X86::FP0;
25783 Res.second = &X86::RFP80RegClass;
25788 if (StringRef("{flags}").equals_lower(Constraint)) {
25789 Res.first = X86::EFLAGS;
25790 Res.second = &X86::CCRRegClass;
25794 // 'A' means EAX + EDX.
25795 if (Constraint == "A") {
25796 Res.first = X86::EAX;
25797 Res.second = &X86::GR32_ADRegClass;
25803 // Otherwise, check to see if this is a register class of the wrong value
25804 // type. For example, we want to map "{ax},i32" -> {eax}, we don't want it to
25805 // turn into {ax},{dx}.
25806 if (Res.second->hasType(VT))
25807 return Res; // Correct type already, nothing to do.
25809 // All of the single-register GCC register classes map their values onto
25810 // 16-bit register pieces "ax","dx","cx","bx","si","di","bp","sp". If we
25811 // really want an 8-bit or 32-bit register, map to the appropriate register
25812 // class and return the appropriate register.
25813 if (Res.second == &X86::GR16RegClass) {
25814 if (VT == MVT::i8 || VT == MVT::i1) {
25815 unsigned DestReg = 0;
25816 switch (Res.first) {
25818 case X86::AX: DestReg = X86::AL; break;
25819 case X86::DX: DestReg = X86::DL; break;
25820 case X86::CX: DestReg = X86::CL; break;
25821 case X86::BX: DestReg = X86::BL; break;
25824 Res.first = DestReg;
25825 Res.second = &X86::GR8RegClass;
25827 } else if (VT == MVT::i32 || VT == MVT::f32) {
25828 unsigned DestReg = 0;
25829 switch (Res.first) {
25831 case X86::AX: DestReg = X86::EAX; break;
25832 case X86::DX: DestReg = X86::EDX; break;
25833 case X86::CX: DestReg = X86::ECX; break;
25834 case X86::BX: DestReg = X86::EBX; break;
25835 case X86::SI: DestReg = X86::ESI; break;
25836 case X86::DI: DestReg = X86::EDI; break;
25837 case X86::BP: DestReg = X86::EBP; break;
25838 case X86::SP: DestReg = X86::ESP; break;
25841 Res.first = DestReg;
25842 Res.second = &X86::GR32RegClass;
25844 } else if (VT == MVT::i64 || VT == MVT::f64) {
25845 unsigned DestReg = 0;
25846 switch (Res.first) {
25848 case X86::AX: DestReg = X86::RAX; break;
25849 case X86::DX: DestReg = X86::RDX; break;
25850 case X86::CX: DestReg = X86::RCX; break;
25851 case X86::BX: DestReg = X86::RBX; break;
25852 case X86::SI: DestReg = X86::RSI; break;
25853 case X86::DI: DestReg = X86::RDI; break;
25854 case X86::BP: DestReg = X86::RBP; break;
25855 case X86::SP: DestReg = X86::RSP; break;
25858 Res.first = DestReg;
25859 Res.second = &X86::GR64RegClass;
25862 } else if (Res.second == &X86::FR32RegClass ||
25863 Res.second == &X86::FR64RegClass ||
25864 Res.second == &X86::VR128RegClass ||
25865 Res.second == &X86::VR256RegClass ||
25866 Res.second == &X86::FR32XRegClass ||
25867 Res.second == &X86::FR64XRegClass ||
25868 Res.second == &X86::VR128XRegClass ||
25869 Res.second == &X86::VR256XRegClass ||
25870 Res.second == &X86::VR512RegClass) {
25871 // Handle references to XMM physical registers that got mapped into the
25872 // wrong class. This can happen with constraints like {xmm0} where the
25873 // target independent register mapper will just pick the first match it can
25874 // find, ignoring the required type.
25876 if (VT == MVT::f32 || VT == MVT::i32)
25877 Res.second = &X86::FR32RegClass;
25878 else if (VT == MVT::f64 || VT == MVT::i64)
25879 Res.second = &X86::FR64RegClass;
25880 else if (X86::VR128RegClass.hasType(VT))
25881 Res.second = &X86::VR128RegClass;
25882 else if (X86::VR256RegClass.hasType(VT))
25883 Res.second = &X86::VR256RegClass;
25884 else if (X86::VR512RegClass.hasType(VT))
25885 Res.second = &X86::VR512RegClass;
25891 int X86TargetLowering::getScalingFactorCost(const AddrMode &AM,
25893 // Scaling factors are not free at all.
25894 // An indexed folded instruction, i.e., inst (reg1, reg2, scale),
25895 // will take 2 allocations in the out of order engine instead of 1
25896 // for plain addressing mode, i.e. inst (reg1).
25898 // vaddps (%rsi,%drx), %ymm0, %ymm1
25899 // Requires two allocations (one for the load, one for the computation)
25901 // vaddps (%rsi), %ymm0, %ymm1
25902 // Requires just 1 allocation, i.e., freeing allocations for other operations
25903 // and having less micro operations to execute.
25905 // For some X86 architectures, this is even worse because for instance for
25906 // stores, the complex addressing mode forces the instruction to use the
25907 // "load" ports instead of the dedicated "store" port.
25908 // E.g., on Haswell:
25909 // vmovaps %ymm1, (%r8, %rdi) can use port 2 or 3.
25910 // vmovaps %ymm1, (%r8) can use port 2, 3, or 7.
25911 if (isLegalAddressingMode(AM, Ty))
25912 // Scale represents reg2 * scale, thus account for 1
25913 // as soon as we use a second register.
25914 return AM.Scale != 0;
25918 bool X86TargetLowering::isTargetFTOL() const {
25919 return Subtarget->isTargetKnownWindowsMSVC() && !Subtarget->is64Bit();