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/SmallSet.h"
23 #include "llvm/ADT/Statistic.h"
24 #include "llvm/ADT/StringExtras.h"
25 #include "llvm/ADT/StringSwitch.h"
26 #include "llvm/ADT/VariadicFunction.h"
27 #include "llvm/CodeGen/IntrinsicLowering.h"
28 #include "llvm/CodeGen/MachineFrameInfo.h"
29 #include "llvm/CodeGen/MachineFunction.h"
30 #include "llvm/CodeGen/MachineInstrBuilder.h"
31 #include "llvm/CodeGen/MachineJumpTableInfo.h"
32 #include "llvm/CodeGen/MachineModuleInfo.h"
33 #include "llvm/CodeGen/MachineRegisterInfo.h"
34 #include "llvm/IR/CallSite.h"
35 #include "llvm/IR/CallingConv.h"
36 #include "llvm/IR/Constants.h"
37 #include "llvm/IR/DerivedTypes.h"
38 #include "llvm/IR/Function.h"
39 #include "llvm/IR/GlobalAlias.h"
40 #include "llvm/IR/GlobalVariable.h"
41 #include "llvm/IR/Instructions.h"
42 #include "llvm/IR/Intrinsics.h"
43 #include "llvm/MC/MCAsmInfo.h"
44 #include "llvm/MC/MCContext.h"
45 #include "llvm/MC/MCExpr.h"
46 #include "llvm/MC/MCSymbol.h"
47 #include "llvm/Support/CommandLine.h"
48 #include "llvm/Support/Debug.h"
49 #include "llvm/Support/ErrorHandling.h"
50 #include "llvm/Support/MathExtras.h"
51 #include "llvm/Target/TargetOptions.h"
52 #include "X86IntrinsicsInfo.h"
58 #define DEBUG_TYPE "x86-isel"
60 STATISTIC(NumTailCalls, "Number of tail calls");
62 static cl::opt<bool> ExperimentalVectorWideningLegalization(
63 "x86-experimental-vector-widening-legalization", cl::init(false),
64 cl::desc("Enable an experimental vector type legalization through widening "
65 "rather than promotion."),
68 static cl::opt<bool> ExperimentalVectorShuffleLowering(
69 "x86-experimental-vector-shuffle-lowering", cl::init(false),
70 cl::desc("Enable an experimental vector shuffle lowering code path."),
73 // Forward declarations.
74 static SDValue getMOVL(SelectionDAG &DAG, SDLoc dl, EVT VT, SDValue V1,
77 static SDValue ExtractSubVector(SDValue Vec, unsigned IdxVal,
78 SelectionDAG &DAG, SDLoc dl,
79 unsigned vectorWidth) {
80 assert((vectorWidth == 128 || vectorWidth == 256) &&
81 "Unsupported vector width");
82 EVT VT = Vec.getValueType();
83 EVT ElVT = VT.getVectorElementType();
84 unsigned Factor = VT.getSizeInBits()/vectorWidth;
85 EVT ResultVT = EVT::getVectorVT(*DAG.getContext(), ElVT,
86 VT.getVectorNumElements()/Factor);
88 // Extract from UNDEF is UNDEF.
89 if (Vec.getOpcode() == ISD::UNDEF)
90 return DAG.getUNDEF(ResultVT);
92 // Extract the relevant vectorWidth bits. Generate an EXTRACT_SUBVECTOR
93 unsigned ElemsPerChunk = vectorWidth / ElVT.getSizeInBits();
95 // This is the index of the first element of the vectorWidth-bit chunk
97 unsigned NormalizedIdxVal = (((IdxVal * ElVT.getSizeInBits()) / vectorWidth)
100 // If the input is a buildvector just emit a smaller one.
101 if (Vec.getOpcode() == ISD::BUILD_VECTOR)
102 return DAG.getNode(ISD::BUILD_VECTOR, dl, ResultVT,
103 makeArrayRef(Vec->op_begin()+NormalizedIdxVal,
106 SDValue VecIdx = DAG.getIntPtrConstant(NormalizedIdxVal);
107 SDValue Result = DAG.getNode(ISD::EXTRACT_SUBVECTOR, dl, ResultVT, Vec,
113 /// Generate a DAG to grab 128-bits from a vector > 128 bits. This
114 /// sets things up to match to an AVX VEXTRACTF128 / VEXTRACTI128
115 /// or AVX-512 VEXTRACTF32x4 / VEXTRACTI32x4
116 /// instructions or a simple subregister reference. Idx is an index in the
117 /// 128 bits we want. It need not be aligned to a 128-bit bounday. That makes
118 /// lowering EXTRACT_VECTOR_ELT operations easier.
119 static SDValue Extract128BitVector(SDValue Vec, unsigned IdxVal,
120 SelectionDAG &DAG, SDLoc dl) {
121 assert((Vec.getValueType().is256BitVector() ||
122 Vec.getValueType().is512BitVector()) && "Unexpected vector size!");
123 return ExtractSubVector(Vec, IdxVal, DAG, dl, 128);
126 /// Generate a DAG to grab 256-bits from a 512-bit vector.
127 static SDValue Extract256BitVector(SDValue Vec, unsigned IdxVal,
128 SelectionDAG &DAG, SDLoc dl) {
129 assert(Vec.getValueType().is512BitVector() && "Unexpected vector size!");
130 return ExtractSubVector(Vec, IdxVal, DAG, dl, 256);
133 static SDValue InsertSubVector(SDValue Result, SDValue Vec,
134 unsigned IdxVal, SelectionDAG &DAG,
135 SDLoc dl, unsigned vectorWidth) {
136 assert((vectorWidth == 128 || vectorWidth == 256) &&
137 "Unsupported vector width");
138 // Inserting UNDEF is Result
139 if (Vec.getOpcode() == ISD::UNDEF)
141 EVT VT = Vec.getValueType();
142 EVT ElVT = VT.getVectorElementType();
143 EVT ResultVT = Result.getValueType();
145 // Insert the relevant vectorWidth bits.
146 unsigned ElemsPerChunk = vectorWidth/ElVT.getSizeInBits();
148 // This is the index of the first element of the vectorWidth-bit chunk
150 unsigned NormalizedIdxVal = (((IdxVal * ElVT.getSizeInBits())/vectorWidth)
153 SDValue VecIdx = DAG.getIntPtrConstant(NormalizedIdxVal);
154 return DAG.getNode(ISD::INSERT_SUBVECTOR, dl, ResultVT, Result, Vec,
157 /// Generate a DAG to put 128-bits into a vector > 128 bits. This
158 /// sets things up to match to an AVX VINSERTF128/VINSERTI128 or
159 /// AVX-512 VINSERTF32x4/VINSERTI32x4 instructions or a
160 /// simple superregister reference. Idx is an index in the 128 bits
161 /// we want. It need not be aligned to a 128-bit bounday. That makes
162 /// lowering INSERT_VECTOR_ELT operations easier.
163 static SDValue Insert128BitVector(SDValue Result, SDValue Vec,
164 unsigned IdxVal, SelectionDAG &DAG,
166 assert(Vec.getValueType().is128BitVector() && "Unexpected vector size!");
167 return InsertSubVector(Result, Vec, IdxVal, DAG, dl, 128);
170 static SDValue Insert256BitVector(SDValue Result, SDValue Vec,
171 unsigned IdxVal, SelectionDAG &DAG,
173 assert(Vec.getValueType().is256BitVector() && "Unexpected vector size!");
174 return InsertSubVector(Result, Vec, IdxVal, DAG, dl, 256);
177 /// Concat two 128-bit vectors into a 256 bit vector using VINSERTF128
178 /// instructions. This is used because creating CONCAT_VECTOR nodes of
179 /// BUILD_VECTORS returns a larger BUILD_VECTOR while we're trying to lower
180 /// large BUILD_VECTORS.
181 static SDValue Concat128BitVectors(SDValue V1, SDValue V2, EVT VT,
182 unsigned NumElems, SelectionDAG &DAG,
184 SDValue V = Insert128BitVector(DAG.getUNDEF(VT), V1, 0, DAG, dl);
185 return Insert128BitVector(V, V2, NumElems/2, DAG, dl);
188 static SDValue Concat256BitVectors(SDValue V1, SDValue V2, EVT VT,
189 unsigned NumElems, SelectionDAG &DAG,
191 SDValue V = Insert256BitVector(DAG.getUNDEF(VT), V1, 0, DAG, dl);
192 return Insert256BitVector(V, V2, NumElems/2, DAG, dl);
195 static TargetLoweringObjectFile *createTLOF(const Triple &TT) {
196 if (TT.isOSBinFormatMachO()) {
197 if (TT.getArch() == Triple::x86_64)
198 return new X86_64MachoTargetObjectFile();
199 return new TargetLoweringObjectFileMachO();
203 return new X86LinuxTargetObjectFile();
204 if (TT.isOSBinFormatELF())
205 return new TargetLoweringObjectFileELF();
206 if (TT.isKnownWindowsMSVCEnvironment())
207 return new X86WindowsTargetObjectFile();
208 if (TT.isOSBinFormatCOFF())
209 return new TargetLoweringObjectFileCOFF();
210 llvm_unreachable("unknown subtarget type");
213 // FIXME: This should stop caching the target machine as soon as
214 // we can remove resetOperationActions et al.
215 X86TargetLowering::X86TargetLowering(X86TargetMachine &TM)
216 : TargetLowering(TM, createTLOF(Triple(TM.getTargetTriple()))) {
217 Subtarget = &TM.getSubtarget<X86Subtarget>();
218 X86ScalarSSEf64 = Subtarget->hasSSE2();
219 X86ScalarSSEf32 = Subtarget->hasSSE1();
220 TD = getDataLayout();
222 resetOperationActions();
225 void X86TargetLowering::resetOperationActions() {
226 const TargetMachine &TM = getTargetMachine();
227 static bool FirstTimeThrough = true;
229 // If none of the target options have changed, then we don't need to reset the
230 // operation actions.
231 if (!FirstTimeThrough && TO == TM.Options) return;
233 if (!FirstTimeThrough) {
234 // Reinitialize the actions.
236 FirstTimeThrough = false;
241 // Set up the TargetLowering object.
242 static const MVT IntVTs[] = { MVT::i8, MVT::i16, MVT::i32, MVT::i64 };
244 // X86 is weird, it always uses i8 for shift amounts and setcc results.
245 setBooleanContents(ZeroOrOneBooleanContent);
246 // X86-SSE is even stranger. It uses -1 or 0 for vector masks.
247 setBooleanVectorContents(ZeroOrNegativeOneBooleanContent);
249 // For 64-bit since we have so many registers use the ILP scheduler, for
250 // 32-bit code use the register pressure specific scheduling.
251 // For Atom, always use ILP scheduling.
252 if (Subtarget->isAtom())
253 setSchedulingPreference(Sched::ILP);
254 else if (Subtarget->is64Bit())
255 setSchedulingPreference(Sched::ILP);
257 setSchedulingPreference(Sched::RegPressure);
258 const X86RegisterInfo *RegInfo =
259 TM.getSubtarget<X86Subtarget>().getRegisterInfo();
260 setStackPointerRegisterToSaveRestore(RegInfo->getStackRegister());
262 // Bypass expensive divides on Atom when compiling with O2
263 if (Subtarget->hasSlowDivide() && TM.getOptLevel() >= CodeGenOpt::Default) {
264 addBypassSlowDiv(32, 8);
265 if (Subtarget->is64Bit())
266 addBypassSlowDiv(64, 16);
269 if (Subtarget->isTargetKnownWindowsMSVC()) {
270 // Setup Windows compiler runtime calls.
271 setLibcallName(RTLIB::SDIV_I64, "_alldiv");
272 setLibcallName(RTLIB::UDIV_I64, "_aulldiv");
273 setLibcallName(RTLIB::SREM_I64, "_allrem");
274 setLibcallName(RTLIB::UREM_I64, "_aullrem");
275 setLibcallName(RTLIB::MUL_I64, "_allmul");
276 setLibcallCallingConv(RTLIB::SDIV_I64, CallingConv::X86_StdCall);
277 setLibcallCallingConv(RTLIB::UDIV_I64, CallingConv::X86_StdCall);
278 setLibcallCallingConv(RTLIB::SREM_I64, CallingConv::X86_StdCall);
279 setLibcallCallingConv(RTLIB::UREM_I64, CallingConv::X86_StdCall);
280 setLibcallCallingConv(RTLIB::MUL_I64, CallingConv::X86_StdCall);
282 // The _ftol2 runtime function has an unusual calling conv, which
283 // is modeled by a special pseudo-instruction.
284 setLibcallName(RTLIB::FPTOUINT_F64_I64, nullptr);
285 setLibcallName(RTLIB::FPTOUINT_F32_I64, nullptr);
286 setLibcallName(RTLIB::FPTOUINT_F64_I32, nullptr);
287 setLibcallName(RTLIB::FPTOUINT_F32_I32, nullptr);
290 if (Subtarget->isTargetDarwin()) {
291 // Darwin should use _setjmp/_longjmp instead of setjmp/longjmp.
292 setUseUnderscoreSetJmp(false);
293 setUseUnderscoreLongJmp(false);
294 } else if (Subtarget->isTargetWindowsGNU()) {
295 // MS runtime is weird: it exports _setjmp, but longjmp!
296 setUseUnderscoreSetJmp(true);
297 setUseUnderscoreLongJmp(false);
299 setUseUnderscoreSetJmp(true);
300 setUseUnderscoreLongJmp(true);
303 // Set up the register classes.
304 addRegisterClass(MVT::i8, &X86::GR8RegClass);
305 addRegisterClass(MVT::i16, &X86::GR16RegClass);
306 addRegisterClass(MVT::i32, &X86::GR32RegClass);
307 if (Subtarget->is64Bit())
308 addRegisterClass(MVT::i64, &X86::GR64RegClass);
310 setLoadExtAction(ISD::SEXTLOAD, MVT::i1, Promote);
312 // We don't accept any truncstore of integer registers.
313 setTruncStoreAction(MVT::i64, MVT::i32, Expand);
314 setTruncStoreAction(MVT::i64, MVT::i16, Expand);
315 setTruncStoreAction(MVT::i64, MVT::i8 , Expand);
316 setTruncStoreAction(MVT::i32, MVT::i16, Expand);
317 setTruncStoreAction(MVT::i32, MVT::i8 , Expand);
318 setTruncStoreAction(MVT::i16, MVT::i8, Expand);
320 // SETOEQ and SETUNE require checking two conditions.
321 setCondCodeAction(ISD::SETOEQ, MVT::f32, Expand);
322 setCondCodeAction(ISD::SETOEQ, MVT::f64, Expand);
323 setCondCodeAction(ISD::SETOEQ, MVT::f80, Expand);
324 setCondCodeAction(ISD::SETUNE, MVT::f32, Expand);
325 setCondCodeAction(ISD::SETUNE, MVT::f64, Expand);
326 setCondCodeAction(ISD::SETUNE, MVT::f80, Expand);
328 // Promote all UINT_TO_FP to larger SINT_TO_FP's, as X86 doesn't have this
330 setOperationAction(ISD::UINT_TO_FP , MVT::i1 , Promote);
331 setOperationAction(ISD::UINT_TO_FP , MVT::i8 , Promote);
332 setOperationAction(ISD::UINT_TO_FP , MVT::i16 , Promote);
334 if (Subtarget->is64Bit()) {
335 setOperationAction(ISD::UINT_TO_FP , MVT::i32 , Promote);
336 setOperationAction(ISD::UINT_TO_FP , MVT::i64 , Custom);
337 } else if (!TM.Options.UseSoftFloat) {
338 // We have an algorithm for SSE2->double, and we turn this into a
339 // 64-bit FILD followed by conditional FADD for other targets.
340 setOperationAction(ISD::UINT_TO_FP , MVT::i64 , Custom);
341 // We have an algorithm for SSE2, and we turn this into a 64-bit
342 // FILD for other targets.
343 setOperationAction(ISD::UINT_TO_FP , MVT::i32 , Custom);
346 // Promote i1/i8 SINT_TO_FP to larger SINT_TO_FP's, as X86 doesn't have
348 setOperationAction(ISD::SINT_TO_FP , MVT::i1 , Promote);
349 setOperationAction(ISD::SINT_TO_FP , MVT::i8 , Promote);
351 if (!TM.Options.UseSoftFloat) {
352 // SSE has no i16 to fp conversion, only i32
353 if (X86ScalarSSEf32) {
354 setOperationAction(ISD::SINT_TO_FP , MVT::i16 , Promote);
355 // f32 and f64 cases are Legal, f80 case is not
356 setOperationAction(ISD::SINT_TO_FP , MVT::i32 , Custom);
358 setOperationAction(ISD::SINT_TO_FP , MVT::i16 , Custom);
359 setOperationAction(ISD::SINT_TO_FP , MVT::i32 , Custom);
362 setOperationAction(ISD::SINT_TO_FP , MVT::i16 , Promote);
363 setOperationAction(ISD::SINT_TO_FP , MVT::i32 , Promote);
366 // In 32-bit mode these are custom lowered. In 64-bit mode F32 and F64
367 // are Legal, f80 is custom lowered.
368 setOperationAction(ISD::FP_TO_SINT , MVT::i64 , Custom);
369 setOperationAction(ISD::SINT_TO_FP , MVT::i64 , Custom);
371 // Promote i1/i8 FP_TO_SINT to larger FP_TO_SINTS's, as X86 doesn't have
373 setOperationAction(ISD::FP_TO_SINT , MVT::i1 , Promote);
374 setOperationAction(ISD::FP_TO_SINT , MVT::i8 , Promote);
376 if (X86ScalarSSEf32) {
377 setOperationAction(ISD::FP_TO_SINT , MVT::i16 , Promote);
378 // f32 and f64 cases are Legal, f80 case is not
379 setOperationAction(ISD::FP_TO_SINT , MVT::i32 , Custom);
381 setOperationAction(ISD::FP_TO_SINT , MVT::i16 , Custom);
382 setOperationAction(ISD::FP_TO_SINT , MVT::i32 , Custom);
385 // Handle FP_TO_UINT by promoting the destination to a larger signed
387 setOperationAction(ISD::FP_TO_UINT , MVT::i1 , Promote);
388 setOperationAction(ISD::FP_TO_UINT , MVT::i8 , Promote);
389 setOperationAction(ISD::FP_TO_UINT , MVT::i16 , Promote);
391 if (Subtarget->is64Bit()) {
392 setOperationAction(ISD::FP_TO_UINT , MVT::i64 , Expand);
393 setOperationAction(ISD::FP_TO_UINT , MVT::i32 , Promote);
394 } else if (!TM.Options.UseSoftFloat) {
395 // Since AVX is a superset of SSE3, only check for SSE here.
396 if (Subtarget->hasSSE1() && !Subtarget->hasSSE3())
397 // Expand FP_TO_UINT into a select.
398 // FIXME: We would like to use a Custom expander here eventually to do
399 // the optimal thing for SSE vs. the default expansion in the legalizer.
400 setOperationAction(ISD::FP_TO_UINT , MVT::i32 , Expand);
402 // With SSE3 we can use fisttpll to convert to a signed i64; without
403 // SSE, we're stuck with a fistpll.
404 setOperationAction(ISD::FP_TO_UINT , MVT::i32 , Custom);
407 if (isTargetFTOL()) {
408 // Use the _ftol2 runtime function, which has a pseudo-instruction
409 // to handle its weird calling convention.
410 setOperationAction(ISD::FP_TO_UINT , MVT::i64 , Custom);
413 // TODO: when we have SSE, these could be more efficient, by using movd/movq.
414 if (!X86ScalarSSEf64) {
415 setOperationAction(ISD::BITCAST , MVT::f32 , Expand);
416 setOperationAction(ISD::BITCAST , MVT::i32 , Expand);
417 if (Subtarget->is64Bit()) {
418 setOperationAction(ISD::BITCAST , MVT::f64 , Expand);
419 // Without SSE, i64->f64 goes through memory.
420 setOperationAction(ISD::BITCAST , MVT::i64 , Expand);
424 // Scalar integer divide and remainder are lowered to use operations that
425 // produce two results, to match the available instructions. This exposes
426 // the two-result form to trivial CSE, which is able to combine x/y and x%y
427 // into a single instruction.
429 // Scalar integer multiply-high is also lowered to use two-result
430 // operations, to match the available instructions. However, plain multiply
431 // (low) operations are left as Legal, as there are single-result
432 // instructions for this in x86. Using the two-result multiply instructions
433 // when both high and low results are needed must be arranged by dagcombine.
434 for (unsigned i = 0; i != array_lengthof(IntVTs); ++i) {
436 setOperationAction(ISD::MULHS, VT, Expand);
437 setOperationAction(ISD::MULHU, VT, Expand);
438 setOperationAction(ISD::SDIV, VT, Expand);
439 setOperationAction(ISD::UDIV, VT, Expand);
440 setOperationAction(ISD::SREM, VT, Expand);
441 setOperationAction(ISD::UREM, VT, Expand);
443 // Add/Sub overflow ops with MVT::Glues are lowered to EFLAGS dependences.
444 setOperationAction(ISD::ADDC, VT, Custom);
445 setOperationAction(ISD::ADDE, VT, Custom);
446 setOperationAction(ISD::SUBC, VT, Custom);
447 setOperationAction(ISD::SUBE, VT, Custom);
450 setOperationAction(ISD::BR_JT , MVT::Other, Expand);
451 setOperationAction(ISD::BRCOND , MVT::Other, Custom);
452 setOperationAction(ISD::BR_CC , MVT::f32, Expand);
453 setOperationAction(ISD::BR_CC , MVT::f64, Expand);
454 setOperationAction(ISD::BR_CC , MVT::f80, Expand);
455 setOperationAction(ISD::BR_CC , MVT::i8, Expand);
456 setOperationAction(ISD::BR_CC , MVT::i16, Expand);
457 setOperationAction(ISD::BR_CC , MVT::i32, Expand);
458 setOperationAction(ISD::BR_CC , MVT::i64, Expand);
459 setOperationAction(ISD::SELECT_CC , MVT::f32, Expand);
460 setOperationAction(ISD::SELECT_CC , MVT::f64, Expand);
461 setOperationAction(ISD::SELECT_CC , MVT::f80, Expand);
462 setOperationAction(ISD::SELECT_CC , MVT::i8, Expand);
463 setOperationAction(ISD::SELECT_CC , MVT::i16, Expand);
464 setOperationAction(ISD::SELECT_CC , MVT::i32, Expand);
465 setOperationAction(ISD::SELECT_CC , MVT::i64, Expand);
466 if (Subtarget->is64Bit())
467 setOperationAction(ISD::SIGN_EXTEND_INREG, MVT::i32, Legal);
468 setOperationAction(ISD::SIGN_EXTEND_INREG, MVT::i16 , Legal);
469 setOperationAction(ISD::SIGN_EXTEND_INREG, MVT::i8 , Legal);
470 setOperationAction(ISD::SIGN_EXTEND_INREG, MVT::i1 , Expand);
471 setOperationAction(ISD::FP_ROUND_INREG , MVT::f32 , Expand);
472 setOperationAction(ISD::FREM , MVT::f32 , Expand);
473 setOperationAction(ISD::FREM , MVT::f64 , Expand);
474 setOperationAction(ISD::FREM , MVT::f80 , Expand);
475 setOperationAction(ISD::FLT_ROUNDS_ , MVT::i32 , Custom);
477 // Promote the i8 variants and force them on up to i32 which has a shorter
479 setOperationAction(ISD::CTTZ , MVT::i8 , Promote);
480 AddPromotedToType (ISD::CTTZ , MVT::i8 , MVT::i32);
481 setOperationAction(ISD::CTTZ_ZERO_UNDEF , MVT::i8 , Promote);
482 AddPromotedToType (ISD::CTTZ_ZERO_UNDEF , MVT::i8 , MVT::i32);
483 if (Subtarget->hasBMI()) {
484 setOperationAction(ISD::CTTZ_ZERO_UNDEF, MVT::i16 , Expand);
485 setOperationAction(ISD::CTTZ_ZERO_UNDEF, MVT::i32 , Expand);
486 if (Subtarget->is64Bit())
487 setOperationAction(ISD::CTTZ_ZERO_UNDEF, MVT::i64, Expand);
489 setOperationAction(ISD::CTTZ , MVT::i16 , Custom);
490 setOperationAction(ISD::CTTZ , MVT::i32 , Custom);
491 if (Subtarget->is64Bit())
492 setOperationAction(ISD::CTTZ , MVT::i64 , Custom);
495 if (Subtarget->hasLZCNT()) {
496 // When promoting the i8 variants, force them to i32 for a shorter
498 setOperationAction(ISD::CTLZ , MVT::i8 , Promote);
499 AddPromotedToType (ISD::CTLZ , MVT::i8 , MVT::i32);
500 setOperationAction(ISD::CTLZ_ZERO_UNDEF, MVT::i8 , Promote);
501 AddPromotedToType (ISD::CTLZ_ZERO_UNDEF, MVT::i8 , MVT::i32);
502 setOperationAction(ISD::CTLZ_ZERO_UNDEF, MVT::i16 , Expand);
503 setOperationAction(ISD::CTLZ_ZERO_UNDEF, MVT::i32 , Expand);
504 if (Subtarget->is64Bit())
505 setOperationAction(ISD::CTLZ_ZERO_UNDEF, MVT::i64, Expand);
507 setOperationAction(ISD::CTLZ , MVT::i8 , Custom);
508 setOperationAction(ISD::CTLZ , MVT::i16 , Custom);
509 setOperationAction(ISD::CTLZ , MVT::i32 , Custom);
510 setOperationAction(ISD::CTLZ_ZERO_UNDEF, MVT::i8 , Custom);
511 setOperationAction(ISD::CTLZ_ZERO_UNDEF, MVT::i16 , Custom);
512 setOperationAction(ISD::CTLZ_ZERO_UNDEF, MVT::i32 , Custom);
513 if (Subtarget->is64Bit()) {
514 setOperationAction(ISD::CTLZ , MVT::i64 , Custom);
515 setOperationAction(ISD::CTLZ_ZERO_UNDEF, MVT::i64, Custom);
519 // Special handling for half-precision floating point conversions.
520 // If we don't have F16C support, then lower half float conversions
521 // into library calls.
522 if (TM.Options.UseSoftFloat || !Subtarget->hasF16C()) {
523 setOperationAction(ISD::FP16_TO_FP, MVT::f32, Expand);
524 setOperationAction(ISD::FP_TO_FP16, MVT::f32, Expand);
527 // There's never any support for operations beyond MVT::f32.
528 setOperationAction(ISD::FP16_TO_FP, MVT::f64, Expand);
529 setOperationAction(ISD::FP16_TO_FP, MVT::f80, Expand);
530 setOperationAction(ISD::FP_TO_FP16, MVT::f64, Expand);
531 setOperationAction(ISD::FP_TO_FP16, MVT::f80, Expand);
533 setLoadExtAction(ISD::EXTLOAD, MVT::f16, Expand);
534 setTruncStoreAction(MVT::f32, MVT::f16, Expand);
535 setTruncStoreAction(MVT::f64, MVT::f16, Expand);
536 setTruncStoreAction(MVT::f80, MVT::f16, Expand);
538 if (Subtarget->hasPOPCNT()) {
539 setOperationAction(ISD::CTPOP , MVT::i8 , Promote);
541 setOperationAction(ISD::CTPOP , MVT::i8 , Expand);
542 setOperationAction(ISD::CTPOP , MVT::i16 , Expand);
543 setOperationAction(ISD::CTPOP , MVT::i32 , Expand);
544 if (Subtarget->is64Bit())
545 setOperationAction(ISD::CTPOP , MVT::i64 , Expand);
548 setOperationAction(ISD::READCYCLECOUNTER , MVT::i64 , Custom);
550 if (!Subtarget->hasMOVBE())
551 setOperationAction(ISD::BSWAP , MVT::i16 , Expand);
553 // These should be promoted to a larger select which is supported.
554 setOperationAction(ISD::SELECT , MVT::i1 , Promote);
555 // X86 wants to expand cmov itself.
556 setOperationAction(ISD::SELECT , MVT::i8 , Custom);
557 setOperationAction(ISD::SELECT , MVT::i16 , Custom);
558 setOperationAction(ISD::SELECT , MVT::i32 , Custom);
559 setOperationAction(ISD::SELECT , MVT::f32 , Custom);
560 setOperationAction(ISD::SELECT , MVT::f64 , Custom);
561 setOperationAction(ISD::SELECT , MVT::f80 , Custom);
562 setOperationAction(ISD::SETCC , MVT::i8 , Custom);
563 setOperationAction(ISD::SETCC , MVT::i16 , Custom);
564 setOperationAction(ISD::SETCC , MVT::i32 , Custom);
565 setOperationAction(ISD::SETCC , MVT::f32 , Custom);
566 setOperationAction(ISD::SETCC , MVT::f64 , Custom);
567 setOperationAction(ISD::SETCC , MVT::f80 , Custom);
568 if (Subtarget->is64Bit()) {
569 setOperationAction(ISD::SELECT , MVT::i64 , Custom);
570 setOperationAction(ISD::SETCC , MVT::i64 , Custom);
572 setOperationAction(ISD::EH_RETURN , MVT::Other, Custom);
573 // NOTE: EH_SJLJ_SETJMP/_LONGJMP supported here is NOT intended to support
574 // SjLj exception handling but a light-weight setjmp/longjmp replacement to
575 // support continuation, user-level threading, and etc.. As a result, no
576 // other SjLj exception interfaces are implemented and please don't build
577 // your own exception handling based on them.
578 // LLVM/Clang supports zero-cost DWARF exception handling.
579 setOperationAction(ISD::EH_SJLJ_SETJMP, MVT::i32, Custom);
580 setOperationAction(ISD::EH_SJLJ_LONGJMP, MVT::Other, Custom);
583 setOperationAction(ISD::ConstantPool , MVT::i32 , Custom);
584 setOperationAction(ISD::JumpTable , MVT::i32 , Custom);
585 setOperationAction(ISD::GlobalAddress , MVT::i32 , Custom);
586 setOperationAction(ISD::GlobalTLSAddress, MVT::i32 , Custom);
587 if (Subtarget->is64Bit())
588 setOperationAction(ISD::GlobalTLSAddress, MVT::i64, Custom);
589 setOperationAction(ISD::ExternalSymbol , MVT::i32 , Custom);
590 setOperationAction(ISD::BlockAddress , MVT::i32 , Custom);
591 if (Subtarget->is64Bit()) {
592 setOperationAction(ISD::ConstantPool , MVT::i64 , Custom);
593 setOperationAction(ISD::JumpTable , MVT::i64 , Custom);
594 setOperationAction(ISD::GlobalAddress , MVT::i64 , Custom);
595 setOperationAction(ISD::ExternalSymbol, MVT::i64 , Custom);
596 setOperationAction(ISD::BlockAddress , MVT::i64 , Custom);
598 // 64-bit addm sub, shl, sra, srl (iff 32-bit x86)
599 setOperationAction(ISD::SHL_PARTS , MVT::i32 , Custom);
600 setOperationAction(ISD::SRA_PARTS , MVT::i32 , Custom);
601 setOperationAction(ISD::SRL_PARTS , MVT::i32 , Custom);
602 if (Subtarget->is64Bit()) {
603 setOperationAction(ISD::SHL_PARTS , MVT::i64 , Custom);
604 setOperationAction(ISD::SRA_PARTS , MVT::i64 , Custom);
605 setOperationAction(ISD::SRL_PARTS , MVT::i64 , Custom);
608 if (Subtarget->hasSSE1())
609 setOperationAction(ISD::PREFETCH , MVT::Other, Legal);
611 setOperationAction(ISD::ATOMIC_FENCE , MVT::Other, Custom);
613 // Expand certain atomics
614 for (unsigned i = 0; i != array_lengthof(IntVTs); ++i) {
616 setOperationAction(ISD::ATOMIC_CMP_SWAP_WITH_SUCCESS, VT, Custom);
617 setOperationAction(ISD::ATOMIC_LOAD_SUB, VT, Custom);
618 setOperationAction(ISD::ATOMIC_STORE, VT, Custom);
621 if (Subtarget->hasCmpxchg16b()) {
622 setOperationAction(ISD::ATOMIC_CMP_SWAP_WITH_SUCCESS, MVT::i128, Custom);
625 // FIXME - use subtarget debug flags
626 if (!Subtarget->isTargetDarwin() && !Subtarget->isTargetELF() &&
627 !Subtarget->isTargetCygMing() && !Subtarget->isTargetWin64()) {
628 setOperationAction(ISD::EH_LABEL, MVT::Other, Expand);
631 if (Subtarget->is64Bit()) {
632 setExceptionPointerRegister(X86::RAX);
633 setExceptionSelectorRegister(X86::RDX);
635 setExceptionPointerRegister(X86::EAX);
636 setExceptionSelectorRegister(X86::EDX);
638 setOperationAction(ISD::FRAME_TO_ARGS_OFFSET, MVT::i32, Custom);
639 setOperationAction(ISD::FRAME_TO_ARGS_OFFSET, MVT::i64, Custom);
641 setOperationAction(ISD::INIT_TRAMPOLINE, MVT::Other, Custom);
642 setOperationAction(ISD::ADJUST_TRAMPOLINE, MVT::Other, Custom);
644 setOperationAction(ISD::TRAP, MVT::Other, Legal);
645 setOperationAction(ISD::DEBUGTRAP, MVT::Other, Legal);
647 // VASTART needs to be custom lowered to use the VarArgsFrameIndex
648 setOperationAction(ISD::VASTART , MVT::Other, Custom);
649 setOperationAction(ISD::VAEND , MVT::Other, Expand);
650 if (Subtarget->is64Bit() && !Subtarget->isTargetWin64()) {
651 // TargetInfo::X86_64ABIBuiltinVaList
652 setOperationAction(ISD::VAARG , MVT::Other, Custom);
653 setOperationAction(ISD::VACOPY , MVT::Other, Custom);
655 // TargetInfo::CharPtrBuiltinVaList
656 setOperationAction(ISD::VAARG , MVT::Other, Expand);
657 setOperationAction(ISD::VACOPY , MVT::Other, Expand);
660 setOperationAction(ISD::STACKSAVE, MVT::Other, Expand);
661 setOperationAction(ISD::STACKRESTORE, MVT::Other, Expand);
663 setOperationAction(ISD::DYNAMIC_STACKALLOC, getPointerTy(), Custom);
665 if (!TM.Options.UseSoftFloat && X86ScalarSSEf64) {
666 // f32 and f64 use SSE.
667 // Set up the FP register classes.
668 addRegisterClass(MVT::f32, &X86::FR32RegClass);
669 addRegisterClass(MVT::f64, &X86::FR64RegClass);
671 // Use ANDPD to simulate FABS.
672 setOperationAction(ISD::FABS , MVT::f64, Custom);
673 setOperationAction(ISD::FABS , MVT::f32, Custom);
675 // Use XORP to simulate FNEG.
676 setOperationAction(ISD::FNEG , MVT::f64, Custom);
677 setOperationAction(ISD::FNEG , MVT::f32, Custom);
679 // Use ANDPD and ORPD to simulate FCOPYSIGN.
680 setOperationAction(ISD::FCOPYSIGN, MVT::f64, Custom);
681 setOperationAction(ISD::FCOPYSIGN, MVT::f32, Custom);
683 // Lower this to FGETSIGNx86 plus an AND.
684 setOperationAction(ISD::FGETSIGN, MVT::i64, Custom);
685 setOperationAction(ISD::FGETSIGN, MVT::i32, Custom);
687 // We don't support sin/cos/fmod
688 setOperationAction(ISD::FSIN , MVT::f64, Expand);
689 setOperationAction(ISD::FCOS , MVT::f64, Expand);
690 setOperationAction(ISD::FSINCOS, MVT::f64, Expand);
691 setOperationAction(ISD::FSIN , MVT::f32, Expand);
692 setOperationAction(ISD::FCOS , MVT::f32, Expand);
693 setOperationAction(ISD::FSINCOS, MVT::f32, Expand);
695 // Expand FP immediates into loads from the stack, except for the special
697 addLegalFPImmediate(APFloat(+0.0)); // xorpd
698 addLegalFPImmediate(APFloat(+0.0f)); // xorps
699 } else if (!TM.Options.UseSoftFloat && X86ScalarSSEf32) {
700 // Use SSE for f32, x87 for f64.
701 // Set up the FP register classes.
702 addRegisterClass(MVT::f32, &X86::FR32RegClass);
703 addRegisterClass(MVT::f64, &X86::RFP64RegClass);
705 // Use ANDPS to simulate FABS.
706 setOperationAction(ISD::FABS , MVT::f32, Custom);
708 // Use XORP to simulate FNEG.
709 setOperationAction(ISD::FNEG , MVT::f32, Custom);
711 setOperationAction(ISD::UNDEF, MVT::f64, Expand);
713 // Use ANDPS and ORPS to simulate FCOPYSIGN.
714 setOperationAction(ISD::FCOPYSIGN, MVT::f64, Expand);
715 setOperationAction(ISD::FCOPYSIGN, MVT::f32, Custom);
717 // We don't support sin/cos/fmod
718 setOperationAction(ISD::FSIN , MVT::f32, Expand);
719 setOperationAction(ISD::FCOS , MVT::f32, Expand);
720 setOperationAction(ISD::FSINCOS, MVT::f32, Expand);
722 // Special cases we handle for FP constants.
723 addLegalFPImmediate(APFloat(+0.0f)); // xorps
724 addLegalFPImmediate(APFloat(+0.0)); // FLD0
725 addLegalFPImmediate(APFloat(+1.0)); // FLD1
726 addLegalFPImmediate(APFloat(-0.0)); // FLD0/FCHS
727 addLegalFPImmediate(APFloat(-1.0)); // FLD1/FCHS
729 if (!TM.Options.UnsafeFPMath) {
730 setOperationAction(ISD::FSIN , MVT::f64, Expand);
731 setOperationAction(ISD::FCOS , MVT::f64, Expand);
732 setOperationAction(ISD::FSINCOS, MVT::f64, Expand);
734 } else if (!TM.Options.UseSoftFloat) {
735 // f32 and f64 in x87.
736 // Set up the FP register classes.
737 addRegisterClass(MVT::f64, &X86::RFP64RegClass);
738 addRegisterClass(MVT::f32, &X86::RFP32RegClass);
740 setOperationAction(ISD::UNDEF, MVT::f64, Expand);
741 setOperationAction(ISD::UNDEF, MVT::f32, Expand);
742 setOperationAction(ISD::FCOPYSIGN, MVT::f64, Expand);
743 setOperationAction(ISD::FCOPYSIGN, MVT::f32, Expand);
745 if (!TM.Options.UnsafeFPMath) {
746 setOperationAction(ISD::FSIN , MVT::f64, Expand);
747 setOperationAction(ISD::FSIN , MVT::f32, Expand);
748 setOperationAction(ISD::FCOS , MVT::f64, Expand);
749 setOperationAction(ISD::FCOS , MVT::f32, Expand);
750 setOperationAction(ISD::FSINCOS, MVT::f64, Expand);
751 setOperationAction(ISD::FSINCOS, MVT::f32, Expand);
753 addLegalFPImmediate(APFloat(+0.0)); // FLD0
754 addLegalFPImmediate(APFloat(+1.0)); // FLD1
755 addLegalFPImmediate(APFloat(-0.0)); // FLD0/FCHS
756 addLegalFPImmediate(APFloat(-1.0)); // FLD1/FCHS
757 addLegalFPImmediate(APFloat(+0.0f)); // FLD0
758 addLegalFPImmediate(APFloat(+1.0f)); // FLD1
759 addLegalFPImmediate(APFloat(-0.0f)); // FLD0/FCHS
760 addLegalFPImmediate(APFloat(-1.0f)); // FLD1/FCHS
763 // We don't support FMA.
764 setOperationAction(ISD::FMA, MVT::f64, Expand);
765 setOperationAction(ISD::FMA, MVT::f32, Expand);
767 // Long double always uses X87.
768 if (!TM.Options.UseSoftFloat) {
769 addRegisterClass(MVT::f80, &X86::RFP80RegClass);
770 setOperationAction(ISD::UNDEF, MVT::f80, Expand);
771 setOperationAction(ISD::FCOPYSIGN, MVT::f80, Expand);
773 APFloat TmpFlt = APFloat::getZero(APFloat::x87DoubleExtended);
774 addLegalFPImmediate(TmpFlt); // FLD0
776 addLegalFPImmediate(TmpFlt); // FLD0/FCHS
779 APFloat TmpFlt2(+1.0);
780 TmpFlt2.convert(APFloat::x87DoubleExtended, APFloat::rmNearestTiesToEven,
782 addLegalFPImmediate(TmpFlt2); // FLD1
783 TmpFlt2.changeSign();
784 addLegalFPImmediate(TmpFlt2); // FLD1/FCHS
787 if (!TM.Options.UnsafeFPMath) {
788 setOperationAction(ISD::FSIN , MVT::f80, Expand);
789 setOperationAction(ISD::FCOS , MVT::f80, Expand);
790 setOperationAction(ISD::FSINCOS, MVT::f80, Expand);
793 setOperationAction(ISD::FFLOOR, MVT::f80, Expand);
794 setOperationAction(ISD::FCEIL, MVT::f80, Expand);
795 setOperationAction(ISD::FTRUNC, MVT::f80, Expand);
796 setOperationAction(ISD::FRINT, MVT::f80, Expand);
797 setOperationAction(ISD::FNEARBYINT, MVT::f80, Expand);
798 setOperationAction(ISD::FMA, MVT::f80, Expand);
801 // Always use a library call for pow.
802 setOperationAction(ISD::FPOW , MVT::f32 , Expand);
803 setOperationAction(ISD::FPOW , MVT::f64 , Expand);
804 setOperationAction(ISD::FPOW , MVT::f80 , Expand);
806 setOperationAction(ISD::FLOG, MVT::f80, Expand);
807 setOperationAction(ISD::FLOG2, MVT::f80, Expand);
808 setOperationAction(ISD::FLOG10, MVT::f80, Expand);
809 setOperationAction(ISD::FEXP, MVT::f80, Expand);
810 setOperationAction(ISD::FEXP2, MVT::f80, Expand);
812 // First set operation action for all vector types to either promote
813 // (for widening) or expand (for scalarization). Then we will selectively
814 // turn on ones that can be effectively codegen'd.
815 for (int i = MVT::FIRST_VECTOR_VALUETYPE;
816 i <= MVT::LAST_VECTOR_VALUETYPE; ++i) {
817 MVT VT = (MVT::SimpleValueType)i;
818 setOperationAction(ISD::ADD , VT, Expand);
819 setOperationAction(ISD::SUB , VT, Expand);
820 setOperationAction(ISD::FADD, VT, Expand);
821 setOperationAction(ISD::FNEG, VT, Expand);
822 setOperationAction(ISD::FSUB, VT, Expand);
823 setOperationAction(ISD::MUL , VT, Expand);
824 setOperationAction(ISD::FMUL, VT, Expand);
825 setOperationAction(ISD::SDIV, VT, Expand);
826 setOperationAction(ISD::UDIV, VT, Expand);
827 setOperationAction(ISD::FDIV, VT, Expand);
828 setOperationAction(ISD::SREM, VT, Expand);
829 setOperationAction(ISD::UREM, VT, Expand);
830 setOperationAction(ISD::LOAD, VT, Expand);
831 setOperationAction(ISD::VECTOR_SHUFFLE, VT, Expand);
832 setOperationAction(ISD::EXTRACT_VECTOR_ELT, VT,Expand);
833 setOperationAction(ISD::INSERT_VECTOR_ELT, VT, Expand);
834 setOperationAction(ISD::EXTRACT_SUBVECTOR, VT,Expand);
835 setOperationAction(ISD::INSERT_SUBVECTOR, VT,Expand);
836 setOperationAction(ISD::FABS, VT, Expand);
837 setOperationAction(ISD::FSIN, VT, Expand);
838 setOperationAction(ISD::FSINCOS, VT, Expand);
839 setOperationAction(ISD::FCOS, VT, Expand);
840 setOperationAction(ISD::FSINCOS, VT, Expand);
841 setOperationAction(ISD::FREM, VT, Expand);
842 setOperationAction(ISD::FMA, VT, Expand);
843 setOperationAction(ISD::FPOWI, VT, Expand);
844 setOperationAction(ISD::FSQRT, VT, Expand);
845 setOperationAction(ISD::FCOPYSIGN, VT, Expand);
846 setOperationAction(ISD::FFLOOR, VT, Expand);
847 setOperationAction(ISD::FCEIL, VT, Expand);
848 setOperationAction(ISD::FTRUNC, VT, Expand);
849 setOperationAction(ISD::FRINT, VT, Expand);
850 setOperationAction(ISD::FNEARBYINT, VT, Expand);
851 setOperationAction(ISD::SMUL_LOHI, VT, Expand);
852 setOperationAction(ISD::MULHS, VT, Expand);
853 setOperationAction(ISD::UMUL_LOHI, VT, Expand);
854 setOperationAction(ISD::MULHU, VT, Expand);
855 setOperationAction(ISD::SDIVREM, VT, Expand);
856 setOperationAction(ISD::UDIVREM, VT, Expand);
857 setOperationAction(ISD::FPOW, VT, Expand);
858 setOperationAction(ISD::CTPOP, VT, Expand);
859 setOperationAction(ISD::CTTZ, VT, Expand);
860 setOperationAction(ISD::CTTZ_ZERO_UNDEF, VT, Expand);
861 setOperationAction(ISD::CTLZ, VT, Expand);
862 setOperationAction(ISD::CTLZ_ZERO_UNDEF, VT, Expand);
863 setOperationAction(ISD::SHL, VT, Expand);
864 setOperationAction(ISD::SRA, VT, Expand);
865 setOperationAction(ISD::SRL, VT, Expand);
866 setOperationAction(ISD::ROTL, VT, Expand);
867 setOperationAction(ISD::ROTR, VT, Expand);
868 setOperationAction(ISD::BSWAP, VT, Expand);
869 setOperationAction(ISD::SETCC, VT, Expand);
870 setOperationAction(ISD::FLOG, VT, Expand);
871 setOperationAction(ISD::FLOG2, VT, Expand);
872 setOperationAction(ISD::FLOG10, VT, Expand);
873 setOperationAction(ISD::FEXP, VT, Expand);
874 setOperationAction(ISD::FEXP2, VT, Expand);
875 setOperationAction(ISD::FP_TO_UINT, VT, Expand);
876 setOperationAction(ISD::FP_TO_SINT, VT, Expand);
877 setOperationAction(ISD::UINT_TO_FP, VT, Expand);
878 setOperationAction(ISD::SINT_TO_FP, VT, Expand);
879 setOperationAction(ISD::SIGN_EXTEND_INREG, VT,Expand);
880 setOperationAction(ISD::TRUNCATE, VT, Expand);
881 setOperationAction(ISD::SIGN_EXTEND, VT, Expand);
882 setOperationAction(ISD::ZERO_EXTEND, VT, Expand);
883 setOperationAction(ISD::ANY_EXTEND, VT, Expand);
884 setOperationAction(ISD::VSELECT, VT, Expand);
885 setOperationAction(ISD::SELECT_CC, VT, Expand);
886 for (int InnerVT = MVT::FIRST_VECTOR_VALUETYPE;
887 InnerVT <= MVT::LAST_VECTOR_VALUETYPE; ++InnerVT)
888 setTruncStoreAction(VT,
889 (MVT::SimpleValueType)InnerVT, Expand);
890 setLoadExtAction(ISD::SEXTLOAD, VT, Expand);
891 setLoadExtAction(ISD::ZEXTLOAD, VT, Expand);
893 // N.b. ISD::EXTLOAD legality is basically ignored except for i1-like types,
894 // we have to deal with them whether we ask for Expansion or not. Setting
895 // Expand causes its own optimisation problems though, so leave them legal.
896 if (VT.getVectorElementType() == MVT::i1)
897 setLoadExtAction(ISD::EXTLOAD, VT, Expand);
900 // FIXME: In order to prevent SSE instructions being expanded to MMX ones
901 // with -msoft-float, disable use of MMX as well.
902 if (!TM.Options.UseSoftFloat && Subtarget->hasMMX()) {
903 addRegisterClass(MVT::x86mmx, &X86::VR64RegClass);
904 // No operations on x86mmx supported, everything uses intrinsics.
907 // MMX-sized vectors (other than x86mmx) are expected to be expanded
908 // into smaller operations.
909 setOperationAction(ISD::MULHS, MVT::v8i8, Expand);
910 setOperationAction(ISD::MULHS, MVT::v4i16, Expand);
911 setOperationAction(ISD::MULHS, MVT::v2i32, Expand);
912 setOperationAction(ISD::MULHS, MVT::v1i64, Expand);
913 setOperationAction(ISD::AND, MVT::v8i8, Expand);
914 setOperationAction(ISD::AND, MVT::v4i16, Expand);
915 setOperationAction(ISD::AND, MVT::v2i32, Expand);
916 setOperationAction(ISD::AND, MVT::v1i64, Expand);
917 setOperationAction(ISD::OR, MVT::v8i8, Expand);
918 setOperationAction(ISD::OR, MVT::v4i16, Expand);
919 setOperationAction(ISD::OR, MVT::v2i32, Expand);
920 setOperationAction(ISD::OR, MVT::v1i64, Expand);
921 setOperationAction(ISD::XOR, MVT::v8i8, Expand);
922 setOperationAction(ISD::XOR, MVT::v4i16, Expand);
923 setOperationAction(ISD::XOR, MVT::v2i32, Expand);
924 setOperationAction(ISD::XOR, MVT::v1i64, Expand);
925 setOperationAction(ISD::SCALAR_TO_VECTOR, MVT::v8i8, Expand);
926 setOperationAction(ISD::SCALAR_TO_VECTOR, MVT::v4i16, Expand);
927 setOperationAction(ISD::SCALAR_TO_VECTOR, MVT::v2i32, Expand);
928 setOperationAction(ISD::SCALAR_TO_VECTOR, MVT::v1i64, Expand);
929 setOperationAction(ISD::INSERT_VECTOR_ELT, MVT::v1i64, Expand);
930 setOperationAction(ISD::SELECT, MVT::v8i8, Expand);
931 setOperationAction(ISD::SELECT, MVT::v4i16, Expand);
932 setOperationAction(ISD::SELECT, MVT::v2i32, Expand);
933 setOperationAction(ISD::SELECT, MVT::v1i64, Expand);
934 setOperationAction(ISD::BITCAST, MVT::v8i8, Expand);
935 setOperationAction(ISD::BITCAST, MVT::v4i16, Expand);
936 setOperationAction(ISD::BITCAST, MVT::v2i32, Expand);
937 setOperationAction(ISD::BITCAST, MVT::v1i64, Expand);
939 if (!TM.Options.UseSoftFloat && Subtarget->hasSSE1()) {
940 addRegisterClass(MVT::v4f32, &X86::VR128RegClass);
942 setOperationAction(ISD::FADD, MVT::v4f32, Legal);
943 setOperationAction(ISD::FSUB, MVT::v4f32, Legal);
944 setOperationAction(ISD::FMUL, MVT::v4f32, Legal);
945 setOperationAction(ISD::FDIV, MVT::v4f32, Legal);
946 setOperationAction(ISD::FSQRT, MVT::v4f32, Legal);
947 setOperationAction(ISD::FNEG, MVT::v4f32, Custom);
948 setOperationAction(ISD::FABS, MVT::v4f32, Custom);
949 setOperationAction(ISD::LOAD, MVT::v4f32, Legal);
950 setOperationAction(ISD::BUILD_VECTOR, MVT::v4f32, Custom);
951 setOperationAction(ISD::VECTOR_SHUFFLE, MVT::v4f32, Custom);
952 setOperationAction(ISD::EXTRACT_VECTOR_ELT, MVT::v4f32, Custom);
953 setOperationAction(ISD::SELECT, MVT::v4f32, Custom);
956 if (!TM.Options.UseSoftFloat && Subtarget->hasSSE2()) {
957 addRegisterClass(MVT::v2f64, &X86::VR128RegClass);
959 // FIXME: Unfortunately, -soft-float and -no-implicit-float mean XMM
960 // registers cannot be used even for integer operations.
961 addRegisterClass(MVT::v16i8, &X86::VR128RegClass);
962 addRegisterClass(MVT::v8i16, &X86::VR128RegClass);
963 addRegisterClass(MVT::v4i32, &X86::VR128RegClass);
964 addRegisterClass(MVT::v2i64, &X86::VR128RegClass);
966 setOperationAction(ISD::ADD, MVT::v16i8, Legal);
967 setOperationAction(ISD::ADD, MVT::v8i16, Legal);
968 setOperationAction(ISD::ADD, MVT::v4i32, Legal);
969 setOperationAction(ISD::ADD, MVT::v2i64, Legal);
970 setOperationAction(ISD::MUL, MVT::v4i32, Custom);
971 setOperationAction(ISD::MUL, MVT::v2i64, Custom);
972 setOperationAction(ISD::UMUL_LOHI, MVT::v4i32, Custom);
973 setOperationAction(ISD::SMUL_LOHI, MVT::v4i32, Custom);
974 setOperationAction(ISD::MULHU, MVT::v8i16, Legal);
975 setOperationAction(ISD::MULHS, MVT::v8i16, Legal);
976 setOperationAction(ISD::SUB, MVT::v16i8, Legal);
977 setOperationAction(ISD::SUB, MVT::v8i16, Legal);
978 setOperationAction(ISD::SUB, MVT::v4i32, Legal);
979 setOperationAction(ISD::SUB, MVT::v2i64, Legal);
980 setOperationAction(ISD::MUL, MVT::v8i16, Legal);
981 setOperationAction(ISD::FADD, MVT::v2f64, Legal);
982 setOperationAction(ISD::FSUB, MVT::v2f64, Legal);
983 setOperationAction(ISD::FMUL, MVT::v2f64, Legal);
984 setOperationAction(ISD::FDIV, MVT::v2f64, Legal);
985 setOperationAction(ISD::FSQRT, MVT::v2f64, Legal);
986 setOperationAction(ISD::FNEG, MVT::v2f64, Custom);
987 setOperationAction(ISD::FABS, MVT::v2f64, Custom);
989 setOperationAction(ISD::SETCC, MVT::v2i64, Custom);
990 setOperationAction(ISD::SETCC, MVT::v16i8, Custom);
991 setOperationAction(ISD::SETCC, MVT::v8i16, Custom);
992 setOperationAction(ISD::SETCC, MVT::v4i32, Custom);
994 setOperationAction(ISD::SCALAR_TO_VECTOR, MVT::v16i8, Custom);
995 setOperationAction(ISD::SCALAR_TO_VECTOR, MVT::v8i16, Custom);
996 setOperationAction(ISD::INSERT_VECTOR_ELT, MVT::v8i16, Custom);
997 setOperationAction(ISD::INSERT_VECTOR_ELT, MVT::v4i32, Custom);
998 setOperationAction(ISD::INSERT_VECTOR_ELT, MVT::v4f32, Custom);
1000 // Custom lower build_vector, vector_shuffle, and extract_vector_elt.
1001 for (int i = MVT::v16i8; i != MVT::v2i64; ++i) {
1002 MVT VT = (MVT::SimpleValueType)i;
1003 // Do not attempt to custom lower non-power-of-2 vectors
1004 if (!isPowerOf2_32(VT.getVectorNumElements()))
1006 // Do not attempt to custom lower non-128-bit vectors
1007 if (!VT.is128BitVector())
1009 setOperationAction(ISD::BUILD_VECTOR, VT, Custom);
1010 setOperationAction(ISD::VECTOR_SHUFFLE, VT, Custom);
1011 setOperationAction(ISD::EXTRACT_VECTOR_ELT, VT, Custom);
1014 // We support custom legalizing of sext and anyext loads for specific
1015 // memory vector types which we can load as a scalar (or sequence of
1016 // scalars) and extend in-register to a legal 128-bit vector type. For sext
1017 // loads these must work with a single scalar load.
1018 setLoadExtAction(ISD::SEXTLOAD, MVT::v4i8, Custom);
1019 setLoadExtAction(ISD::SEXTLOAD, MVT::v4i16, Custom);
1020 setLoadExtAction(ISD::SEXTLOAD, MVT::v8i8, Custom);
1021 setLoadExtAction(ISD::EXTLOAD, MVT::v2i8, Custom);
1022 setLoadExtAction(ISD::EXTLOAD, MVT::v2i16, Custom);
1023 setLoadExtAction(ISD::EXTLOAD, MVT::v2i32, Custom);
1024 setLoadExtAction(ISD::EXTLOAD, MVT::v4i8, Custom);
1025 setLoadExtAction(ISD::EXTLOAD, MVT::v4i16, Custom);
1026 setLoadExtAction(ISD::EXTLOAD, MVT::v8i8, Custom);
1028 setOperationAction(ISD::BUILD_VECTOR, MVT::v2f64, Custom);
1029 setOperationAction(ISD::BUILD_VECTOR, MVT::v2i64, Custom);
1030 setOperationAction(ISD::VECTOR_SHUFFLE, MVT::v2f64, Custom);
1031 setOperationAction(ISD::VECTOR_SHUFFLE, MVT::v2i64, Custom);
1032 setOperationAction(ISD::INSERT_VECTOR_ELT, MVT::v2f64, Custom);
1033 setOperationAction(ISD::EXTRACT_VECTOR_ELT, MVT::v2f64, Custom);
1035 if (Subtarget->is64Bit()) {
1036 setOperationAction(ISD::INSERT_VECTOR_ELT, MVT::v2i64, Custom);
1037 setOperationAction(ISD::EXTRACT_VECTOR_ELT, MVT::v2i64, Custom);
1040 // Promote v16i8, v8i16, v4i32 load, select, and, or, xor to v2i64.
1041 for (int i = MVT::v16i8; i != MVT::v2i64; ++i) {
1042 MVT VT = (MVT::SimpleValueType)i;
1044 // Do not attempt to promote non-128-bit vectors
1045 if (!VT.is128BitVector())
1048 setOperationAction(ISD::AND, VT, Promote);
1049 AddPromotedToType (ISD::AND, VT, MVT::v2i64);
1050 setOperationAction(ISD::OR, VT, Promote);
1051 AddPromotedToType (ISD::OR, VT, MVT::v2i64);
1052 setOperationAction(ISD::XOR, VT, Promote);
1053 AddPromotedToType (ISD::XOR, VT, MVT::v2i64);
1054 setOperationAction(ISD::LOAD, VT, Promote);
1055 AddPromotedToType (ISD::LOAD, VT, MVT::v2i64);
1056 setOperationAction(ISD::SELECT, VT, Promote);
1057 AddPromotedToType (ISD::SELECT, VT, MVT::v2i64);
1060 setTruncStoreAction(MVT::f64, MVT::f32, Expand);
1062 // Custom lower v2i64 and v2f64 selects.
1063 setOperationAction(ISD::LOAD, MVT::v2f64, Legal);
1064 setOperationAction(ISD::LOAD, MVT::v2i64, Legal);
1065 setOperationAction(ISD::SELECT, MVT::v2f64, Custom);
1066 setOperationAction(ISD::SELECT, MVT::v2i64, Custom);
1068 setOperationAction(ISD::FP_TO_SINT, MVT::v4i32, Legal);
1069 setOperationAction(ISD::SINT_TO_FP, MVT::v4i32, Legal);
1071 setOperationAction(ISD::UINT_TO_FP, MVT::v4i8, Custom);
1072 setOperationAction(ISD::UINT_TO_FP, MVT::v4i16, Custom);
1073 // As there is no 64-bit GPR available, we need build a special custom
1074 // sequence to convert from v2i32 to v2f32.
1075 if (!Subtarget->is64Bit())
1076 setOperationAction(ISD::UINT_TO_FP, MVT::v2f32, Custom);
1078 setOperationAction(ISD::FP_EXTEND, MVT::v2f32, Custom);
1079 setOperationAction(ISD::FP_ROUND, MVT::v2f32, Custom);
1081 setLoadExtAction(ISD::EXTLOAD, MVT::v2f32, Legal);
1083 setOperationAction(ISD::BITCAST, MVT::v2i32, Custom);
1084 setOperationAction(ISD::BITCAST, MVT::v4i16, Custom);
1085 setOperationAction(ISD::BITCAST, MVT::v8i8, Custom);
1088 if (!TM.Options.UseSoftFloat && Subtarget->hasSSE41()) {
1089 setOperationAction(ISD::FFLOOR, MVT::f32, Legal);
1090 setOperationAction(ISD::FCEIL, MVT::f32, Legal);
1091 setOperationAction(ISD::FTRUNC, MVT::f32, Legal);
1092 setOperationAction(ISD::FRINT, MVT::f32, Legal);
1093 setOperationAction(ISD::FNEARBYINT, MVT::f32, Legal);
1094 setOperationAction(ISD::FFLOOR, MVT::f64, Legal);
1095 setOperationAction(ISD::FCEIL, MVT::f64, Legal);
1096 setOperationAction(ISD::FTRUNC, MVT::f64, Legal);
1097 setOperationAction(ISD::FRINT, MVT::f64, Legal);
1098 setOperationAction(ISD::FNEARBYINT, MVT::f64, Legal);
1100 setOperationAction(ISD::FFLOOR, MVT::v4f32, Legal);
1101 setOperationAction(ISD::FCEIL, MVT::v4f32, Legal);
1102 setOperationAction(ISD::FTRUNC, MVT::v4f32, Legal);
1103 setOperationAction(ISD::FRINT, MVT::v4f32, Legal);
1104 setOperationAction(ISD::FNEARBYINT, MVT::v4f32, Legal);
1105 setOperationAction(ISD::FFLOOR, MVT::v2f64, Legal);
1106 setOperationAction(ISD::FCEIL, MVT::v2f64, Legal);
1107 setOperationAction(ISD::FTRUNC, MVT::v2f64, Legal);
1108 setOperationAction(ISD::FRINT, MVT::v2f64, Legal);
1109 setOperationAction(ISD::FNEARBYINT, MVT::v2f64, Legal);
1111 // FIXME: Do we need to handle scalar-to-vector here?
1112 setOperationAction(ISD::MUL, MVT::v4i32, Legal);
1114 setOperationAction(ISD::VSELECT, MVT::v2f64, Custom);
1115 setOperationAction(ISD::VSELECT, MVT::v2i64, Custom);
1116 setOperationAction(ISD::VSELECT, MVT::v4i32, Custom);
1117 setOperationAction(ISD::VSELECT, MVT::v4f32, Custom);
1118 setOperationAction(ISD::VSELECT, MVT::v8i16, Custom);
1119 // There is no BLENDI for byte vectors. We don't need to custom lower
1120 // some vselects for now.
1121 setOperationAction(ISD::VSELECT, MVT::v16i8, Legal);
1123 // SSE41 brings specific instructions for doing vector sign extend even in
1124 // cases where we don't have SRA.
1125 setLoadExtAction(ISD::SEXTLOAD, MVT::v2i8, Custom);
1126 setLoadExtAction(ISD::SEXTLOAD, MVT::v2i16, Custom);
1127 setLoadExtAction(ISD::SEXTLOAD, MVT::v2i32, Custom);
1129 // i8 and i16 vectors are custom because the source register and source
1130 // source memory operand types are not the same width. f32 vectors are
1131 // custom since the immediate controlling the insert encodes additional
1133 setOperationAction(ISD::INSERT_VECTOR_ELT, MVT::v16i8, Custom);
1134 setOperationAction(ISD::INSERT_VECTOR_ELT, MVT::v8i16, Custom);
1135 setOperationAction(ISD::INSERT_VECTOR_ELT, MVT::v4i32, Custom);
1136 setOperationAction(ISD::INSERT_VECTOR_ELT, MVT::v4f32, Custom);
1138 setOperationAction(ISD::EXTRACT_VECTOR_ELT, MVT::v16i8, Custom);
1139 setOperationAction(ISD::EXTRACT_VECTOR_ELT, MVT::v8i16, Custom);
1140 setOperationAction(ISD::EXTRACT_VECTOR_ELT, MVT::v4i32, Custom);
1141 setOperationAction(ISD::EXTRACT_VECTOR_ELT, MVT::v4f32, Custom);
1143 // FIXME: these should be Legal, but that's only for the case where
1144 // the index is constant. For now custom expand to deal with that.
1145 if (Subtarget->is64Bit()) {
1146 setOperationAction(ISD::INSERT_VECTOR_ELT, MVT::v2i64, Custom);
1147 setOperationAction(ISD::EXTRACT_VECTOR_ELT, MVT::v2i64, Custom);
1151 if (Subtarget->hasSSE2()) {
1152 setOperationAction(ISD::SRL, MVT::v8i16, Custom);
1153 setOperationAction(ISD::SRL, MVT::v16i8, Custom);
1155 setOperationAction(ISD::SHL, MVT::v8i16, Custom);
1156 setOperationAction(ISD::SHL, MVT::v16i8, Custom);
1158 setOperationAction(ISD::SRA, MVT::v8i16, Custom);
1159 setOperationAction(ISD::SRA, MVT::v16i8, Custom);
1161 // In the customized shift lowering, the legal cases in AVX2 will be
1163 setOperationAction(ISD::SRL, MVT::v2i64, Custom);
1164 setOperationAction(ISD::SRL, MVT::v4i32, Custom);
1166 setOperationAction(ISD::SHL, MVT::v2i64, Custom);
1167 setOperationAction(ISD::SHL, MVT::v4i32, Custom);
1169 setOperationAction(ISD::SRA, MVT::v4i32, Custom);
1172 if (!TM.Options.UseSoftFloat && Subtarget->hasFp256()) {
1173 addRegisterClass(MVT::v32i8, &X86::VR256RegClass);
1174 addRegisterClass(MVT::v16i16, &X86::VR256RegClass);
1175 addRegisterClass(MVT::v8i32, &X86::VR256RegClass);
1176 addRegisterClass(MVT::v8f32, &X86::VR256RegClass);
1177 addRegisterClass(MVT::v4i64, &X86::VR256RegClass);
1178 addRegisterClass(MVT::v4f64, &X86::VR256RegClass);
1180 setOperationAction(ISD::LOAD, MVT::v8f32, Legal);
1181 setOperationAction(ISD::LOAD, MVT::v4f64, Legal);
1182 setOperationAction(ISD::LOAD, MVT::v4i64, Legal);
1184 setOperationAction(ISD::FADD, MVT::v8f32, Legal);
1185 setOperationAction(ISD::FSUB, MVT::v8f32, Legal);
1186 setOperationAction(ISD::FMUL, MVT::v8f32, Legal);
1187 setOperationAction(ISD::FDIV, MVT::v8f32, Legal);
1188 setOperationAction(ISD::FSQRT, MVT::v8f32, Legal);
1189 setOperationAction(ISD::FFLOOR, MVT::v8f32, Legal);
1190 setOperationAction(ISD::FCEIL, MVT::v8f32, Legal);
1191 setOperationAction(ISD::FTRUNC, MVT::v8f32, Legal);
1192 setOperationAction(ISD::FRINT, MVT::v8f32, Legal);
1193 setOperationAction(ISD::FNEARBYINT, MVT::v8f32, Legal);
1194 setOperationAction(ISD::FNEG, MVT::v8f32, Custom);
1195 setOperationAction(ISD::FABS, MVT::v8f32, Custom);
1197 setOperationAction(ISD::FADD, MVT::v4f64, Legal);
1198 setOperationAction(ISD::FSUB, MVT::v4f64, Legal);
1199 setOperationAction(ISD::FMUL, MVT::v4f64, Legal);
1200 setOperationAction(ISD::FDIV, MVT::v4f64, Legal);
1201 setOperationAction(ISD::FSQRT, MVT::v4f64, Legal);
1202 setOperationAction(ISD::FFLOOR, MVT::v4f64, Legal);
1203 setOperationAction(ISD::FCEIL, MVT::v4f64, Legal);
1204 setOperationAction(ISD::FTRUNC, MVT::v4f64, Legal);
1205 setOperationAction(ISD::FRINT, MVT::v4f64, Legal);
1206 setOperationAction(ISD::FNEARBYINT, MVT::v4f64, Legal);
1207 setOperationAction(ISD::FNEG, MVT::v4f64, Custom);
1208 setOperationAction(ISD::FABS, MVT::v4f64, Custom);
1210 // (fp_to_int:v8i16 (v8f32 ..)) requires the result type to be promoted
1211 // even though v8i16 is a legal type.
1212 setOperationAction(ISD::FP_TO_SINT, MVT::v8i16, Promote);
1213 setOperationAction(ISD::FP_TO_UINT, MVT::v8i16, Promote);
1214 setOperationAction(ISD::FP_TO_SINT, MVT::v8i32, Legal);
1216 setOperationAction(ISD::SINT_TO_FP, MVT::v8i16, Promote);
1217 setOperationAction(ISD::SINT_TO_FP, MVT::v8i32, Legal);
1218 setOperationAction(ISD::FP_ROUND, MVT::v4f32, Legal);
1220 setOperationAction(ISD::UINT_TO_FP, MVT::v8i8, Custom);
1221 setOperationAction(ISD::UINT_TO_FP, MVT::v8i16, Custom);
1223 setLoadExtAction(ISD::EXTLOAD, MVT::v4f32, Legal);
1225 setOperationAction(ISD::SRL, MVT::v16i16, Custom);
1226 setOperationAction(ISD::SRL, MVT::v32i8, Custom);
1228 setOperationAction(ISD::SHL, MVT::v16i16, Custom);
1229 setOperationAction(ISD::SHL, MVT::v32i8, Custom);
1231 setOperationAction(ISD::SRA, MVT::v16i16, Custom);
1232 setOperationAction(ISD::SRA, MVT::v32i8, Custom);
1234 setOperationAction(ISD::SETCC, MVT::v32i8, Custom);
1235 setOperationAction(ISD::SETCC, MVT::v16i16, Custom);
1236 setOperationAction(ISD::SETCC, MVT::v8i32, Custom);
1237 setOperationAction(ISD::SETCC, MVT::v4i64, Custom);
1239 setOperationAction(ISD::SELECT, MVT::v4f64, Custom);
1240 setOperationAction(ISD::SELECT, MVT::v4i64, Custom);
1241 setOperationAction(ISD::SELECT, MVT::v8f32, Custom);
1243 setOperationAction(ISD::VSELECT, MVT::v4f64, Custom);
1244 setOperationAction(ISD::VSELECT, MVT::v4i64, Custom);
1245 setOperationAction(ISD::VSELECT, MVT::v8i32, Custom);
1246 setOperationAction(ISD::VSELECT, MVT::v8f32, Custom);
1248 setOperationAction(ISD::SIGN_EXTEND, MVT::v4i64, Custom);
1249 setOperationAction(ISD::SIGN_EXTEND, MVT::v8i32, Custom);
1250 setOperationAction(ISD::SIGN_EXTEND, MVT::v16i16, Custom);
1251 setOperationAction(ISD::ZERO_EXTEND, MVT::v4i64, Custom);
1252 setOperationAction(ISD::ZERO_EXTEND, MVT::v8i32, Custom);
1253 setOperationAction(ISD::ZERO_EXTEND, MVT::v16i16, Custom);
1254 setOperationAction(ISD::ANY_EXTEND, MVT::v4i64, Custom);
1255 setOperationAction(ISD::ANY_EXTEND, MVT::v8i32, Custom);
1256 setOperationAction(ISD::ANY_EXTEND, MVT::v16i16, Custom);
1257 setOperationAction(ISD::TRUNCATE, MVT::v16i8, Custom);
1258 setOperationAction(ISD::TRUNCATE, MVT::v8i16, Custom);
1259 setOperationAction(ISD::TRUNCATE, MVT::v4i32, Custom);
1261 if (Subtarget->hasFMA() || Subtarget->hasFMA4()) {
1262 setOperationAction(ISD::FMA, MVT::v8f32, Legal);
1263 setOperationAction(ISD::FMA, MVT::v4f64, Legal);
1264 setOperationAction(ISD::FMA, MVT::v4f32, Legal);
1265 setOperationAction(ISD::FMA, MVT::v2f64, Legal);
1266 setOperationAction(ISD::FMA, MVT::f32, Legal);
1267 setOperationAction(ISD::FMA, MVT::f64, Legal);
1270 if (Subtarget->hasInt256()) {
1271 setOperationAction(ISD::ADD, MVT::v4i64, Legal);
1272 setOperationAction(ISD::ADD, MVT::v8i32, Legal);
1273 setOperationAction(ISD::ADD, MVT::v16i16, Legal);
1274 setOperationAction(ISD::ADD, MVT::v32i8, Legal);
1276 setOperationAction(ISD::SUB, MVT::v4i64, Legal);
1277 setOperationAction(ISD::SUB, MVT::v8i32, Legal);
1278 setOperationAction(ISD::SUB, MVT::v16i16, Legal);
1279 setOperationAction(ISD::SUB, MVT::v32i8, Legal);
1281 setOperationAction(ISD::MUL, MVT::v4i64, Custom);
1282 setOperationAction(ISD::MUL, MVT::v8i32, Legal);
1283 setOperationAction(ISD::MUL, MVT::v16i16, Legal);
1284 // Don't lower v32i8 because there is no 128-bit byte mul
1286 setOperationAction(ISD::UMUL_LOHI, MVT::v8i32, Custom);
1287 setOperationAction(ISD::SMUL_LOHI, MVT::v8i32, Custom);
1288 setOperationAction(ISD::MULHU, MVT::v16i16, Legal);
1289 setOperationAction(ISD::MULHS, MVT::v16i16, Legal);
1291 setOperationAction(ISD::VSELECT, MVT::v16i16, Custom);
1292 setOperationAction(ISD::VSELECT, MVT::v32i8, Legal);
1294 setOperationAction(ISD::ADD, MVT::v4i64, Custom);
1295 setOperationAction(ISD::ADD, MVT::v8i32, Custom);
1296 setOperationAction(ISD::ADD, MVT::v16i16, Custom);
1297 setOperationAction(ISD::ADD, MVT::v32i8, Custom);
1299 setOperationAction(ISD::SUB, MVT::v4i64, Custom);
1300 setOperationAction(ISD::SUB, MVT::v8i32, Custom);
1301 setOperationAction(ISD::SUB, MVT::v16i16, Custom);
1302 setOperationAction(ISD::SUB, MVT::v32i8, Custom);
1304 setOperationAction(ISD::MUL, MVT::v4i64, Custom);
1305 setOperationAction(ISD::MUL, MVT::v8i32, Custom);
1306 setOperationAction(ISD::MUL, MVT::v16i16, Custom);
1307 // Don't lower v32i8 because there is no 128-bit byte mul
1310 // In the customized shift lowering, the legal cases in AVX2 will be
1312 setOperationAction(ISD::SRL, MVT::v4i64, Custom);
1313 setOperationAction(ISD::SRL, MVT::v8i32, Custom);
1315 setOperationAction(ISD::SHL, MVT::v4i64, Custom);
1316 setOperationAction(ISD::SHL, MVT::v8i32, Custom);
1318 setOperationAction(ISD::SRA, MVT::v8i32, Custom);
1320 // Custom lower several nodes for 256-bit types.
1321 for (int i = MVT::FIRST_VECTOR_VALUETYPE;
1322 i <= MVT::LAST_VECTOR_VALUETYPE; ++i) {
1323 MVT VT = (MVT::SimpleValueType)i;
1325 // Extract subvector is special because the value type
1326 // (result) is 128-bit but the source is 256-bit wide.
1327 if (VT.is128BitVector())
1328 setOperationAction(ISD::EXTRACT_SUBVECTOR, VT, Custom);
1330 // Do not attempt to custom lower other non-256-bit vectors
1331 if (!VT.is256BitVector())
1334 setOperationAction(ISD::BUILD_VECTOR, VT, Custom);
1335 setOperationAction(ISD::VECTOR_SHUFFLE, VT, Custom);
1336 setOperationAction(ISD::INSERT_VECTOR_ELT, VT, Custom);
1337 setOperationAction(ISD::EXTRACT_VECTOR_ELT, VT, Custom);
1338 setOperationAction(ISD::SCALAR_TO_VECTOR, VT, Custom);
1339 setOperationAction(ISD::INSERT_SUBVECTOR, VT, Custom);
1340 setOperationAction(ISD::CONCAT_VECTORS, VT, Custom);
1343 // Promote v32i8, v16i16, v8i32 select, and, or, xor to v4i64.
1344 for (int i = MVT::v32i8; i != MVT::v4i64; ++i) {
1345 MVT VT = (MVT::SimpleValueType)i;
1347 // Do not attempt to promote non-256-bit vectors
1348 if (!VT.is256BitVector())
1351 setOperationAction(ISD::AND, VT, Promote);
1352 AddPromotedToType (ISD::AND, VT, MVT::v4i64);
1353 setOperationAction(ISD::OR, VT, Promote);
1354 AddPromotedToType (ISD::OR, VT, MVT::v4i64);
1355 setOperationAction(ISD::XOR, VT, Promote);
1356 AddPromotedToType (ISD::XOR, VT, MVT::v4i64);
1357 setOperationAction(ISD::LOAD, VT, Promote);
1358 AddPromotedToType (ISD::LOAD, VT, MVT::v4i64);
1359 setOperationAction(ISD::SELECT, VT, Promote);
1360 AddPromotedToType (ISD::SELECT, VT, MVT::v4i64);
1364 if (!TM.Options.UseSoftFloat && Subtarget->hasAVX512()) {
1365 addRegisterClass(MVT::v16i32, &X86::VR512RegClass);
1366 addRegisterClass(MVT::v16f32, &X86::VR512RegClass);
1367 addRegisterClass(MVT::v8i64, &X86::VR512RegClass);
1368 addRegisterClass(MVT::v8f64, &X86::VR512RegClass);
1370 addRegisterClass(MVT::i1, &X86::VK1RegClass);
1371 addRegisterClass(MVT::v8i1, &X86::VK8RegClass);
1372 addRegisterClass(MVT::v16i1, &X86::VK16RegClass);
1374 setOperationAction(ISD::BR_CC, MVT::i1, Expand);
1375 setOperationAction(ISD::SETCC, MVT::i1, Custom);
1376 setOperationAction(ISD::XOR, MVT::i1, Legal);
1377 setOperationAction(ISD::OR, MVT::i1, Legal);
1378 setOperationAction(ISD::AND, MVT::i1, Legal);
1379 setLoadExtAction(ISD::EXTLOAD, MVT::v8f32, Legal);
1380 setOperationAction(ISD::LOAD, MVT::v16f32, Legal);
1381 setOperationAction(ISD::LOAD, MVT::v8f64, Legal);
1382 setOperationAction(ISD::LOAD, MVT::v8i64, Legal);
1383 setOperationAction(ISD::LOAD, MVT::v16i32, Legal);
1384 setOperationAction(ISD::LOAD, MVT::v16i1, Legal);
1386 setOperationAction(ISD::FADD, MVT::v16f32, Legal);
1387 setOperationAction(ISD::FSUB, MVT::v16f32, Legal);
1388 setOperationAction(ISD::FMUL, MVT::v16f32, Legal);
1389 setOperationAction(ISD::FDIV, MVT::v16f32, Legal);
1390 setOperationAction(ISD::FSQRT, MVT::v16f32, Legal);
1391 setOperationAction(ISD::FNEG, MVT::v16f32, Custom);
1393 setOperationAction(ISD::FADD, MVT::v8f64, Legal);
1394 setOperationAction(ISD::FSUB, MVT::v8f64, Legal);
1395 setOperationAction(ISD::FMUL, MVT::v8f64, Legal);
1396 setOperationAction(ISD::FDIV, MVT::v8f64, Legal);
1397 setOperationAction(ISD::FSQRT, MVT::v8f64, Legal);
1398 setOperationAction(ISD::FNEG, MVT::v8f64, Custom);
1399 setOperationAction(ISD::FMA, MVT::v8f64, Legal);
1400 setOperationAction(ISD::FMA, MVT::v16f32, Legal);
1402 setOperationAction(ISD::FP_TO_SINT, MVT::i32, Legal);
1403 setOperationAction(ISD::FP_TO_UINT, MVT::i32, Legal);
1404 setOperationAction(ISD::SINT_TO_FP, MVT::i32, Legal);
1405 setOperationAction(ISD::UINT_TO_FP, MVT::i32, Legal);
1406 if (Subtarget->is64Bit()) {
1407 setOperationAction(ISD::FP_TO_UINT, MVT::i64, Legal);
1408 setOperationAction(ISD::FP_TO_SINT, MVT::i64, Legal);
1409 setOperationAction(ISD::SINT_TO_FP, MVT::i64, Legal);
1410 setOperationAction(ISD::UINT_TO_FP, MVT::i64, Legal);
1412 setOperationAction(ISD::FP_TO_SINT, MVT::v16i32, Legal);
1413 setOperationAction(ISD::FP_TO_UINT, MVT::v16i32, Legal);
1414 setOperationAction(ISD::FP_TO_UINT, MVT::v8i32, Legal);
1415 setOperationAction(ISD::FP_TO_UINT, MVT::v4i32, Legal);
1416 setOperationAction(ISD::SINT_TO_FP, MVT::v16i32, Legal);
1417 setOperationAction(ISD::UINT_TO_FP, MVT::v16i32, Legal);
1418 setOperationAction(ISD::UINT_TO_FP, MVT::v8i32, Legal);
1419 setOperationAction(ISD::UINT_TO_FP, MVT::v4i32, Legal);
1420 setOperationAction(ISD::FP_ROUND, MVT::v8f32, Legal);
1421 setOperationAction(ISD::FP_EXTEND, MVT::v8f32, Legal);
1423 setOperationAction(ISD::TRUNCATE, MVT::i1, Custom);
1424 setOperationAction(ISD::TRUNCATE, MVT::v16i8, Custom);
1425 setOperationAction(ISD::TRUNCATE, MVT::v8i32, Custom);
1426 setOperationAction(ISD::TRUNCATE, MVT::v8i1, Custom);
1427 setOperationAction(ISD::TRUNCATE, MVT::v16i1, Custom);
1428 setOperationAction(ISD::TRUNCATE, MVT::v16i16, Custom);
1429 setOperationAction(ISD::ZERO_EXTEND, MVT::v16i32, Custom);
1430 setOperationAction(ISD::ZERO_EXTEND, MVT::v8i64, Custom);
1431 setOperationAction(ISD::SIGN_EXTEND, MVT::v16i32, Custom);
1432 setOperationAction(ISD::SIGN_EXTEND, MVT::v8i64, Custom);
1433 setOperationAction(ISD::SIGN_EXTEND, MVT::v16i8, Custom);
1434 setOperationAction(ISD::SIGN_EXTEND, MVT::v8i16, Custom);
1435 setOperationAction(ISD::SIGN_EXTEND, MVT::v16i16, Custom);
1437 setOperationAction(ISD::CONCAT_VECTORS, MVT::v8f64, Custom);
1438 setOperationAction(ISD::CONCAT_VECTORS, MVT::v8i64, Custom);
1439 setOperationAction(ISD::CONCAT_VECTORS, MVT::v16f32, Custom);
1440 setOperationAction(ISD::CONCAT_VECTORS, MVT::v16i32, Custom);
1441 setOperationAction(ISD::CONCAT_VECTORS, MVT::v8i1, Custom);
1442 setOperationAction(ISD::CONCAT_VECTORS, MVT::v16i1, Legal);
1444 setOperationAction(ISD::SETCC, MVT::v16i1, Custom);
1445 setOperationAction(ISD::SETCC, MVT::v8i1, Custom);
1447 setOperationAction(ISD::MUL, MVT::v8i64, Custom);
1449 setOperationAction(ISD::EXTRACT_VECTOR_ELT, MVT::v8i1, Custom);
1450 setOperationAction(ISD::EXTRACT_VECTOR_ELT, MVT::v16i1, Custom);
1451 setOperationAction(ISD::INSERT_VECTOR_ELT, MVT::v16i1, Custom);
1452 setOperationAction(ISD::INSERT_VECTOR_ELT, MVT::v8i1, Custom);
1453 setOperationAction(ISD::BUILD_VECTOR, MVT::v8i1, Custom);
1454 setOperationAction(ISD::BUILD_VECTOR, MVT::v16i1, Custom);
1455 setOperationAction(ISD::SELECT, MVT::v8f64, Custom);
1456 setOperationAction(ISD::SELECT, MVT::v8i64, Custom);
1457 setOperationAction(ISD::SELECT, MVT::v16f32, Custom);
1459 setOperationAction(ISD::ADD, MVT::v8i64, Legal);
1460 setOperationAction(ISD::ADD, MVT::v16i32, Legal);
1462 setOperationAction(ISD::SUB, MVT::v8i64, Legal);
1463 setOperationAction(ISD::SUB, MVT::v16i32, Legal);
1465 setOperationAction(ISD::MUL, MVT::v16i32, Legal);
1467 setOperationAction(ISD::SRL, MVT::v8i64, Custom);
1468 setOperationAction(ISD::SRL, MVT::v16i32, Custom);
1470 setOperationAction(ISD::SHL, MVT::v8i64, Custom);
1471 setOperationAction(ISD::SHL, MVT::v16i32, Custom);
1473 setOperationAction(ISD::SRA, MVT::v8i64, Custom);
1474 setOperationAction(ISD::SRA, MVT::v16i32, Custom);
1476 setOperationAction(ISD::AND, MVT::v8i64, Legal);
1477 setOperationAction(ISD::OR, MVT::v8i64, Legal);
1478 setOperationAction(ISD::XOR, MVT::v8i64, Legal);
1479 setOperationAction(ISD::AND, MVT::v16i32, Legal);
1480 setOperationAction(ISD::OR, MVT::v16i32, Legal);
1481 setOperationAction(ISD::XOR, MVT::v16i32, Legal);
1483 if (Subtarget->hasCDI()) {
1484 setOperationAction(ISD::CTLZ, MVT::v8i64, Legal);
1485 setOperationAction(ISD::CTLZ, MVT::v16i32, Legal);
1488 // Custom lower several nodes.
1489 for (int i = MVT::FIRST_VECTOR_VALUETYPE;
1490 i <= MVT::LAST_VECTOR_VALUETYPE; ++i) {
1491 MVT VT = (MVT::SimpleValueType)i;
1493 unsigned EltSize = VT.getVectorElementType().getSizeInBits();
1494 // Extract subvector is special because the value type
1495 // (result) is 256/128-bit but the source is 512-bit wide.
1496 if (VT.is128BitVector() || VT.is256BitVector())
1497 setOperationAction(ISD::EXTRACT_SUBVECTOR, VT, Custom);
1499 if (VT.getVectorElementType() == MVT::i1)
1500 setOperationAction(ISD::EXTRACT_SUBVECTOR, VT, Legal);
1502 // Do not attempt to custom lower other non-512-bit vectors
1503 if (!VT.is512BitVector())
1506 if ( EltSize >= 32) {
1507 setOperationAction(ISD::VECTOR_SHUFFLE, VT, Custom);
1508 setOperationAction(ISD::INSERT_VECTOR_ELT, VT, Custom);
1509 setOperationAction(ISD::BUILD_VECTOR, VT, Custom);
1510 setOperationAction(ISD::VSELECT, VT, Legal);
1511 setOperationAction(ISD::EXTRACT_VECTOR_ELT, VT, Custom);
1512 setOperationAction(ISD::SCALAR_TO_VECTOR, VT, Custom);
1513 setOperationAction(ISD::INSERT_SUBVECTOR, VT, Custom);
1516 for (int i = MVT::v32i8; i != MVT::v8i64; ++i) {
1517 MVT VT = (MVT::SimpleValueType)i;
1519 // Do not attempt to promote non-256-bit vectors
1520 if (!VT.is512BitVector())
1523 setOperationAction(ISD::SELECT, VT, Promote);
1524 AddPromotedToType (ISD::SELECT, VT, MVT::v8i64);
1528 if (!TM.Options.UseSoftFloat && Subtarget->hasBWI()) {
1529 addRegisterClass(MVT::v32i16, &X86::VR512RegClass);
1530 addRegisterClass(MVT::v64i8, &X86::VR512RegClass);
1532 addRegisterClass(MVT::v32i1, &X86::VK32RegClass);
1533 addRegisterClass(MVT::v64i1, &X86::VK64RegClass);
1535 setOperationAction(ISD::LOAD, MVT::v32i16, Legal);
1536 setOperationAction(ISD::LOAD, MVT::v64i8, Legal);
1537 setOperationAction(ISD::SETCC, MVT::v32i1, Custom);
1538 setOperationAction(ISD::SETCC, MVT::v64i1, Custom);
1540 for (int i = MVT::v32i8; i != MVT::v8i64; ++i) {
1541 const MVT VT = (MVT::SimpleValueType)i;
1543 const unsigned EltSize = VT.getVectorElementType().getSizeInBits();
1545 // Do not attempt to promote non-256-bit vectors
1546 if (!VT.is512BitVector())
1549 if ( EltSize < 32) {
1550 setOperationAction(ISD::BUILD_VECTOR, VT, Custom);
1551 setOperationAction(ISD::VSELECT, VT, Legal);
1556 if (!TM.Options.UseSoftFloat && Subtarget->hasVLX()) {
1557 addRegisterClass(MVT::v4i1, &X86::VK4RegClass);
1558 addRegisterClass(MVT::v2i1, &X86::VK2RegClass);
1560 setOperationAction(ISD::SETCC, MVT::v4i1, Custom);
1561 setOperationAction(ISD::SETCC, MVT::v2i1, Custom);
1564 // SIGN_EXTEND_INREGs are evaluated by the extend type. Handle the expansion
1565 // of this type with custom code.
1566 for (int VT = MVT::FIRST_VECTOR_VALUETYPE;
1567 VT != MVT::LAST_VECTOR_VALUETYPE; VT++) {
1568 setOperationAction(ISD::SIGN_EXTEND_INREG, (MVT::SimpleValueType)VT,
1572 // We want to custom lower some of our intrinsics.
1573 setOperationAction(ISD::INTRINSIC_WO_CHAIN, MVT::Other, Custom);
1574 setOperationAction(ISD::INTRINSIC_W_CHAIN, MVT::Other, Custom);
1575 setOperationAction(ISD::INTRINSIC_VOID, MVT::Other, Custom);
1576 if (!Subtarget->is64Bit())
1577 setOperationAction(ISD::INTRINSIC_W_CHAIN, MVT::i64, Custom);
1579 // Only custom-lower 64-bit SADDO and friends on 64-bit because we don't
1580 // handle type legalization for these operations here.
1582 // FIXME: We really should do custom legalization for addition and
1583 // subtraction on x86-32 once PR3203 is fixed. We really can't do much better
1584 // than generic legalization for 64-bit multiplication-with-overflow, though.
1585 for (unsigned i = 0, e = 3+Subtarget->is64Bit(); i != e; ++i) {
1586 // Add/Sub/Mul with overflow operations are custom lowered.
1588 setOperationAction(ISD::SADDO, VT, Custom);
1589 setOperationAction(ISD::UADDO, VT, Custom);
1590 setOperationAction(ISD::SSUBO, VT, Custom);
1591 setOperationAction(ISD::USUBO, VT, Custom);
1592 setOperationAction(ISD::SMULO, VT, Custom);
1593 setOperationAction(ISD::UMULO, VT, Custom);
1596 // There are no 8-bit 3-address imul/mul instructions
1597 setOperationAction(ISD::SMULO, MVT::i8, Expand);
1598 setOperationAction(ISD::UMULO, MVT::i8, Expand);
1600 if (!Subtarget->is64Bit()) {
1601 // These libcalls are not available in 32-bit.
1602 setLibcallName(RTLIB::SHL_I128, nullptr);
1603 setLibcallName(RTLIB::SRL_I128, nullptr);
1604 setLibcallName(RTLIB::SRA_I128, nullptr);
1607 // Combine sin / cos into one node or libcall if possible.
1608 if (Subtarget->hasSinCos()) {
1609 setLibcallName(RTLIB::SINCOS_F32, "sincosf");
1610 setLibcallName(RTLIB::SINCOS_F64, "sincos");
1611 if (Subtarget->isTargetDarwin()) {
1612 // For MacOSX, we don't want to the normal expansion of a libcall to
1613 // sincos. We want to issue a libcall to __sincos_stret to avoid memory
1615 setOperationAction(ISD::FSINCOS, MVT::f64, Custom);
1616 setOperationAction(ISD::FSINCOS, MVT::f32, Custom);
1620 if (Subtarget->isTargetWin64()) {
1621 setOperationAction(ISD::SDIV, MVT::i128, Custom);
1622 setOperationAction(ISD::UDIV, MVT::i128, Custom);
1623 setOperationAction(ISD::SREM, MVT::i128, Custom);
1624 setOperationAction(ISD::UREM, MVT::i128, Custom);
1625 setOperationAction(ISD::SDIVREM, MVT::i128, Custom);
1626 setOperationAction(ISD::UDIVREM, MVT::i128, Custom);
1629 // We have target-specific dag combine patterns for the following nodes:
1630 setTargetDAGCombine(ISD::VECTOR_SHUFFLE);
1631 setTargetDAGCombine(ISD::EXTRACT_VECTOR_ELT);
1632 setTargetDAGCombine(ISD::VSELECT);
1633 setTargetDAGCombine(ISD::SELECT);
1634 setTargetDAGCombine(ISD::SHL);
1635 setTargetDAGCombine(ISD::SRA);
1636 setTargetDAGCombine(ISD::SRL);
1637 setTargetDAGCombine(ISD::OR);
1638 setTargetDAGCombine(ISD::AND);
1639 setTargetDAGCombine(ISD::ADD);
1640 setTargetDAGCombine(ISD::FADD);
1641 setTargetDAGCombine(ISD::FSUB);
1642 setTargetDAGCombine(ISD::FMA);
1643 setTargetDAGCombine(ISD::SUB);
1644 setTargetDAGCombine(ISD::LOAD);
1645 setTargetDAGCombine(ISD::STORE);
1646 setTargetDAGCombine(ISD::ZERO_EXTEND);
1647 setTargetDAGCombine(ISD::ANY_EXTEND);
1648 setTargetDAGCombine(ISD::SIGN_EXTEND);
1649 setTargetDAGCombine(ISD::SIGN_EXTEND_INREG);
1650 setTargetDAGCombine(ISD::TRUNCATE);
1651 setTargetDAGCombine(ISD::SINT_TO_FP);
1652 setTargetDAGCombine(ISD::SETCC);
1653 setTargetDAGCombine(ISD::INTRINSIC_WO_CHAIN);
1654 setTargetDAGCombine(ISD::BUILD_VECTOR);
1655 if (Subtarget->is64Bit())
1656 setTargetDAGCombine(ISD::MUL);
1657 setTargetDAGCombine(ISD::XOR);
1659 computeRegisterProperties();
1661 // On Darwin, -Os means optimize for size without hurting performance,
1662 // do not reduce the limit.
1663 MaxStoresPerMemset = 16; // For @llvm.memset -> sequence of stores
1664 MaxStoresPerMemsetOptSize = Subtarget->isTargetDarwin() ? 16 : 8;
1665 MaxStoresPerMemcpy = 8; // For @llvm.memcpy -> sequence of stores
1666 MaxStoresPerMemcpyOptSize = Subtarget->isTargetDarwin() ? 8 : 4;
1667 MaxStoresPerMemmove = 8; // For @llvm.memmove -> sequence of stores
1668 MaxStoresPerMemmoveOptSize = Subtarget->isTargetDarwin() ? 8 : 4;
1669 setPrefLoopAlignment(4); // 2^4 bytes.
1671 // Predictable cmov don't hurt on atom because it's in-order.
1672 PredictableSelectIsExpensive = !Subtarget->isAtom();
1674 setPrefFunctionAlignment(4); // 2^4 bytes.
1676 InitIntrinsicTables();
1679 // This has so far only been implemented for 64-bit MachO.
1680 bool X86TargetLowering::useLoadStackGuardNode() const {
1681 return Subtarget->getTargetTriple().getObjectFormat() == Triple::MachO &&
1682 Subtarget->is64Bit();
1685 TargetLoweringBase::LegalizeTypeAction
1686 X86TargetLowering::getPreferredVectorAction(EVT VT) const {
1687 if (ExperimentalVectorWideningLegalization &&
1688 VT.getVectorNumElements() != 1 &&
1689 VT.getVectorElementType().getSimpleVT() != MVT::i1)
1690 return TypeWidenVector;
1692 return TargetLoweringBase::getPreferredVectorAction(VT);
1695 EVT X86TargetLowering::getSetCCResultType(LLVMContext &, EVT VT) const {
1697 return Subtarget->hasAVX512() ? MVT::i1: MVT::i8;
1699 const unsigned NumElts = VT.getVectorNumElements();
1700 const EVT EltVT = VT.getVectorElementType();
1701 if (VT.is512BitVector()) {
1702 if (Subtarget->hasAVX512())
1703 if (EltVT == MVT::i32 || EltVT == MVT::i64 ||
1704 EltVT == MVT::f32 || EltVT == MVT::f64)
1706 case 8: return MVT::v8i1;
1707 case 16: return MVT::v16i1;
1709 if (Subtarget->hasBWI())
1710 if (EltVT == MVT::i8 || EltVT == MVT::i16)
1712 case 32: return MVT::v32i1;
1713 case 64: return MVT::v64i1;
1717 if (VT.is256BitVector() || VT.is128BitVector()) {
1718 if (Subtarget->hasVLX())
1719 if (EltVT == MVT::i32 || EltVT == MVT::i64 ||
1720 EltVT == MVT::f32 || EltVT == MVT::f64)
1722 case 2: return MVT::v2i1;
1723 case 4: return MVT::v4i1;
1724 case 8: return MVT::v8i1;
1726 if (Subtarget->hasBWI() && Subtarget->hasVLX())
1727 if (EltVT == MVT::i8 || EltVT == MVT::i16)
1729 case 8: return MVT::v8i1;
1730 case 16: return MVT::v16i1;
1731 case 32: return MVT::v32i1;
1735 return VT.changeVectorElementTypeToInteger();
1738 /// getMaxByValAlign - Helper for getByValTypeAlignment to determine
1739 /// the desired ByVal argument alignment.
1740 static void getMaxByValAlign(Type *Ty, unsigned &MaxAlign) {
1743 if (VectorType *VTy = dyn_cast<VectorType>(Ty)) {
1744 if (VTy->getBitWidth() == 128)
1746 } else if (ArrayType *ATy = dyn_cast<ArrayType>(Ty)) {
1747 unsigned EltAlign = 0;
1748 getMaxByValAlign(ATy->getElementType(), EltAlign);
1749 if (EltAlign > MaxAlign)
1750 MaxAlign = EltAlign;
1751 } else if (StructType *STy = dyn_cast<StructType>(Ty)) {
1752 for (unsigned i = 0, e = STy->getNumElements(); i != e; ++i) {
1753 unsigned EltAlign = 0;
1754 getMaxByValAlign(STy->getElementType(i), EltAlign);
1755 if (EltAlign > MaxAlign)
1756 MaxAlign = EltAlign;
1763 /// getByValTypeAlignment - Return the desired alignment for ByVal aggregate
1764 /// function arguments in the caller parameter area. For X86, aggregates
1765 /// that contain SSE vectors are placed at 16-byte boundaries while the rest
1766 /// are at 4-byte boundaries.
1767 unsigned X86TargetLowering::getByValTypeAlignment(Type *Ty) const {
1768 if (Subtarget->is64Bit()) {
1769 // Max of 8 and alignment of type.
1770 unsigned TyAlign = TD->getABITypeAlignment(Ty);
1777 if (Subtarget->hasSSE1())
1778 getMaxByValAlign(Ty, Align);
1782 /// getOptimalMemOpType - Returns the target specific optimal type for load
1783 /// and store operations as a result of memset, memcpy, and memmove
1784 /// lowering. If DstAlign is zero that means it's safe to destination
1785 /// alignment can satisfy any constraint. Similarly if SrcAlign is zero it
1786 /// means there isn't a need to check it against alignment requirement,
1787 /// probably because the source does not need to be loaded. If 'IsMemset' is
1788 /// true, that means it's expanding a memset. If 'ZeroMemset' is true, that
1789 /// means it's a memset of zero. 'MemcpyStrSrc' indicates whether the memcpy
1790 /// source is constant so it does not need to be loaded.
1791 /// It returns EVT::Other if the type should be determined using generic
1792 /// target-independent logic.
1794 X86TargetLowering::getOptimalMemOpType(uint64_t Size,
1795 unsigned DstAlign, unsigned SrcAlign,
1796 bool IsMemset, bool ZeroMemset,
1798 MachineFunction &MF) const {
1799 const Function *F = MF.getFunction();
1800 if ((!IsMemset || ZeroMemset) &&
1801 !F->getAttributes().hasAttribute(AttributeSet::FunctionIndex,
1802 Attribute::NoImplicitFloat)) {
1804 (Subtarget->isUnalignedMemAccessFast() ||
1805 ((DstAlign == 0 || DstAlign >= 16) &&
1806 (SrcAlign == 0 || SrcAlign >= 16)))) {
1808 if (Subtarget->hasInt256())
1810 if (Subtarget->hasFp256())
1813 if (Subtarget->hasSSE2())
1815 if (Subtarget->hasSSE1())
1817 } else if (!MemcpyStrSrc && Size >= 8 &&
1818 !Subtarget->is64Bit() &&
1819 Subtarget->hasSSE2()) {
1820 // Do not use f64 to lower memcpy if source is string constant. It's
1821 // better to use i32 to avoid the loads.
1825 if (Subtarget->is64Bit() && Size >= 8)
1830 bool X86TargetLowering::isSafeMemOpType(MVT VT) const {
1832 return X86ScalarSSEf32;
1833 else if (VT == MVT::f64)
1834 return X86ScalarSSEf64;
1839 X86TargetLowering::allowsMisalignedMemoryAccesses(EVT VT,
1844 *Fast = Subtarget->isUnalignedMemAccessFast();
1848 /// getJumpTableEncoding - Return the entry encoding for a jump table in the
1849 /// current function. The returned value is a member of the
1850 /// MachineJumpTableInfo::JTEntryKind enum.
1851 unsigned X86TargetLowering::getJumpTableEncoding() const {
1852 // In GOT pic mode, each entry in the jump table is emitted as a @GOTOFF
1854 if (getTargetMachine().getRelocationModel() == Reloc::PIC_ &&
1855 Subtarget->isPICStyleGOT())
1856 return MachineJumpTableInfo::EK_Custom32;
1858 // Otherwise, use the normal jump table encoding heuristics.
1859 return TargetLowering::getJumpTableEncoding();
1863 X86TargetLowering::LowerCustomJumpTableEntry(const MachineJumpTableInfo *MJTI,
1864 const MachineBasicBlock *MBB,
1865 unsigned uid,MCContext &Ctx) const{
1866 assert(MBB->getParent()->getTarget().getRelocationModel() == Reloc::PIC_ &&
1867 Subtarget->isPICStyleGOT());
1868 // In 32-bit ELF systems, our jump table entries are formed with @GOTOFF
1870 return MCSymbolRefExpr::Create(MBB->getSymbol(),
1871 MCSymbolRefExpr::VK_GOTOFF, Ctx);
1874 /// getPICJumpTableRelocaBase - Returns relocation base for the given PIC
1876 SDValue X86TargetLowering::getPICJumpTableRelocBase(SDValue Table,
1877 SelectionDAG &DAG) const {
1878 if (!Subtarget->is64Bit())
1879 // This doesn't have SDLoc associated with it, but is not really the
1880 // same as a Register.
1881 return DAG.getNode(X86ISD::GlobalBaseReg, SDLoc(), getPointerTy());
1885 /// getPICJumpTableRelocBaseExpr - This returns the relocation base for the
1886 /// given PIC jumptable, the same as getPICJumpTableRelocBase, but as an
1888 const MCExpr *X86TargetLowering::
1889 getPICJumpTableRelocBaseExpr(const MachineFunction *MF, unsigned JTI,
1890 MCContext &Ctx) const {
1891 // X86-64 uses RIP relative addressing based on the jump table label.
1892 if (Subtarget->isPICStyleRIPRel())
1893 return TargetLowering::getPICJumpTableRelocBaseExpr(MF, JTI, Ctx);
1895 // Otherwise, the reference is relative to the PIC base.
1896 return MCSymbolRefExpr::Create(MF->getPICBaseSymbol(), Ctx);
1899 // FIXME: Why this routine is here? Move to RegInfo!
1900 std::pair<const TargetRegisterClass*, uint8_t>
1901 X86TargetLowering::findRepresentativeClass(MVT VT) const{
1902 const TargetRegisterClass *RRC = nullptr;
1904 switch (VT.SimpleTy) {
1906 return TargetLowering::findRepresentativeClass(VT);
1907 case MVT::i8: case MVT::i16: case MVT::i32: case MVT::i64:
1908 RRC = Subtarget->is64Bit() ? &X86::GR64RegClass : &X86::GR32RegClass;
1911 RRC = &X86::VR64RegClass;
1913 case MVT::f32: case MVT::f64:
1914 case MVT::v16i8: case MVT::v8i16: case MVT::v4i32: case MVT::v2i64:
1915 case MVT::v4f32: case MVT::v2f64:
1916 case MVT::v32i8: case MVT::v8i32: case MVT::v4i64: case MVT::v8f32:
1918 RRC = &X86::VR128RegClass;
1921 return std::make_pair(RRC, Cost);
1924 bool X86TargetLowering::getStackCookieLocation(unsigned &AddressSpace,
1925 unsigned &Offset) const {
1926 if (!Subtarget->isTargetLinux())
1929 if (Subtarget->is64Bit()) {
1930 // %fs:0x28, unless we're using a Kernel code model, in which case it's %gs:
1932 if (getTargetMachine().getCodeModel() == CodeModel::Kernel)
1944 bool X86TargetLowering::isNoopAddrSpaceCast(unsigned SrcAS,
1945 unsigned DestAS) const {
1946 assert(SrcAS != DestAS && "Expected different address spaces!");
1948 return SrcAS < 256 && DestAS < 256;
1951 //===----------------------------------------------------------------------===//
1952 // Return Value Calling Convention Implementation
1953 //===----------------------------------------------------------------------===//
1955 #include "X86GenCallingConv.inc"
1958 X86TargetLowering::CanLowerReturn(CallingConv::ID CallConv,
1959 MachineFunction &MF, bool isVarArg,
1960 const SmallVectorImpl<ISD::OutputArg> &Outs,
1961 LLVMContext &Context) const {
1962 SmallVector<CCValAssign, 16> RVLocs;
1963 CCState CCInfo(CallConv, isVarArg, MF, RVLocs, Context);
1964 return CCInfo.CheckReturn(Outs, RetCC_X86);
1967 const MCPhysReg *X86TargetLowering::getScratchRegisters(CallingConv::ID) const {
1968 static const MCPhysReg ScratchRegs[] = { X86::R11, 0 };
1973 X86TargetLowering::LowerReturn(SDValue Chain,
1974 CallingConv::ID CallConv, bool isVarArg,
1975 const SmallVectorImpl<ISD::OutputArg> &Outs,
1976 const SmallVectorImpl<SDValue> &OutVals,
1977 SDLoc dl, SelectionDAG &DAG) const {
1978 MachineFunction &MF = DAG.getMachineFunction();
1979 X86MachineFunctionInfo *FuncInfo = MF.getInfo<X86MachineFunctionInfo>();
1981 SmallVector<CCValAssign, 16> RVLocs;
1982 CCState CCInfo(CallConv, isVarArg, MF, RVLocs, *DAG.getContext());
1983 CCInfo.AnalyzeReturn(Outs, RetCC_X86);
1986 SmallVector<SDValue, 6> RetOps;
1987 RetOps.push_back(Chain); // Operand #0 = Chain (updated below)
1988 // Operand #1 = Bytes To Pop
1989 RetOps.push_back(DAG.getTargetConstant(FuncInfo->getBytesToPopOnReturn(),
1992 // Copy the result values into the output registers.
1993 for (unsigned i = 0; i != RVLocs.size(); ++i) {
1994 CCValAssign &VA = RVLocs[i];
1995 assert(VA.isRegLoc() && "Can only return in registers!");
1996 SDValue ValToCopy = OutVals[i];
1997 EVT ValVT = ValToCopy.getValueType();
1999 // Promote values to the appropriate types
2000 if (VA.getLocInfo() == CCValAssign::SExt)
2001 ValToCopy = DAG.getNode(ISD::SIGN_EXTEND, dl, VA.getLocVT(), ValToCopy);
2002 else if (VA.getLocInfo() == CCValAssign::ZExt)
2003 ValToCopy = DAG.getNode(ISD::ZERO_EXTEND, dl, VA.getLocVT(), ValToCopy);
2004 else if (VA.getLocInfo() == CCValAssign::AExt)
2005 ValToCopy = DAG.getNode(ISD::ANY_EXTEND, dl, VA.getLocVT(), ValToCopy);
2006 else if (VA.getLocInfo() == CCValAssign::BCvt)
2007 ValToCopy = DAG.getNode(ISD::BITCAST, dl, VA.getLocVT(), ValToCopy);
2009 assert(VA.getLocInfo() != CCValAssign::FPExt &&
2010 "Unexpected FP-extend for return value.");
2012 // If this is x86-64, and we disabled SSE, we can't return FP values,
2013 // or SSE or MMX vectors.
2014 if ((ValVT == MVT::f32 || ValVT == MVT::f64 ||
2015 VA.getLocReg() == X86::XMM0 || VA.getLocReg() == X86::XMM1) &&
2016 (Subtarget->is64Bit() && !Subtarget->hasSSE1())) {
2017 report_fatal_error("SSE register return with SSE disabled");
2019 // Likewise we can't return F64 values with SSE1 only. gcc does so, but
2020 // llvm-gcc has never done it right and no one has noticed, so this
2021 // should be OK for now.
2022 if (ValVT == MVT::f64 &&
2023 (Subtarget->is64Bit() && !Subtarget->hasSSE2()))
2024 report_fatal_error("SSE2 register return with SSE2 disabled");
2026 // Returns in ST0/ST1 are handled specially: these are pushed as operands to
2027 // the RET instruction and handled by the FP Stackifier.
2028 if (VA.getLocReg() == X86::FP0 ||
2029 VA.getLocReg() == X86::FP1) {
2030 // If this is a copy from an xmm register to ST(0), use an FPExtend to
2031 // change the value to the FP stack register class.
2032 if (isScalarFPTypeInSSEReg(VA.getValVT()))
2033 ValToCopy = DAG.getNode(ISD::FP_EXTEND, dl, MVT::f80, ValToCopy);
2034 RetOps.push_back(ValToCopy);
2035 // Don't emit a copytoreg.
2039 // 64-bit vector (MMX) values are returned in XMM0 / XMM1 except for v1i64
2040 // which is returned in RAX / RDX.
2041 if (Subtarget->is64Bit()) {
2042 if (ValVT == MVT::x86mmx) {
2043 if (VA.getLocReg() == X86::XMM0 || VA.getLocReg() == X86::XMM1) {
2044 ValToCopy = DAG.getNode(ISD::BITCAST, dl, MVT::i64, ValToCopy);
2045 ValToCopy = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, MVT::v2i64,
2047 // If we don't have SSE2 available, convert to v4f32 so the generated
2048 // register is legal.
2049 if (!Subtarget->hasSSE2())
2050 ValToCopy = DAG.getNode(ISD::BITCAST, dl, MVT::v4f32,ValToCopy);
2055 Chain = DAG.getCopyToReg(Chain, dl, VA.getLocReg(), ValToCopy, Flag);
2056 Flag = Chain.getValue(1);
2057 RetOps.push_back(DAG.getRegister(VA.getLocReg(), VA.getLocVT()));
2060 // The x86-64 ABIs require that for returning structs by value we copy
2061 // the sret argument into %rax/%eax (depending on ABI) for the return.
2062 // Win32 requires us to put the sret argument to %eax as well.
2063 // We saved the argument into a virtual register in the entry block,
2064 // so now we copy the value out and into %rax/%eax.
2065 if (DAG.getMachineFunction().getFunction()->hasStructRetAttr() &&
2066 (Subtarget->is64Bit() || Subtarget->isTargetKnownWindowsMSVC())) {
2067 MachineFunction &MF = DAG.getMachineFunction();
2068 X86MachineFunctionInfo *FuncInfo = MF.getInfo<X86MachineFunctionInfo>();
2069 unsigned Reg = FuncInfo->getSRetReturnReg();
2071 "SRetReturnReg should have been set in LowerFormalArguments().");
2072 SDValue Val = DAG.getCopyFromReg(Chain, dl, Reg, getPointerTy());
2075 = (Subtarget->is64Bit() && !Subtarget->isTarget64BitILP32()) ?
2076 X86::RAX : X86::EAX;
2077 Chain = DAG.getCopyToReg(Chain, dl, RetValReg, Val, Flag);
2078 Flag = Chain.getValue(1);
2080 // RAX/EAX now acts like a return value.
2081 RetOps.push_back(DAG.getRegister(RetValReg, getPointerTy()));
2084 RetOps[0] = Chain; // Update chain.
2086 // Add the flag if we have it.
2088 RetOps.push_back(Flag);
2090 return DAG.getNode(X86ISD::RET_FLAG, dl, MVT::Other, RetOps);
2093 bool X86TargetLowering::isUsedByReturnOnly(SDNode *N, SDValue &Chain) const {
2094 if (N->getNumValues() != 1)
2096 if (!N->hasNUsesOfValue(1, 0))
2099 SDValue TCChain = Chain;
2100 SDNode *Copy = *N->use_begin();
2101 if (Copy->getOpcode() == ISD::CopyToReg) {
2102 // If the copy has a glue operand, we conservatively assume it isn't safe to
2103 // perform a tail call.
2104 if (Copy->getOperand(Copy->getNumOperands()-1).getValueType() == MVT::Glue)
2106 TCChain = Copy->getOperand(0);
2107 } else if (Copy->getOpcode() != ISD::FP_EXTEND)
2110 bool HasRet = false;
2111 for (SDNode::use_iterator UI = Copy->use_begin(), UE = Copy->use_end();
2113 if (UI->getOpcode() != X86ISD::RET_FLAG)
2115 // If we are returning more than one value, we can definitely
2116 // not make a tail call see PR19530
2117 if (UI->getNumOperands() > 4)
2119 if (UI->getNumOperands() == 4 &&
2120 UI->getOperand(UI->getNumOperands()-1).getValueType() != MVT::Glue)
2133 X86TargetLowering::getTypeForExtArgOrReturn(LLVMContext &Context, EVT VT,
2134 ISD::NodeType ExtendKind) const {
2136 // TODO: Is this also valid on 32-bit?
2137 if (Subtarget->is64Bit() && VT == MVT::i1 && ExtendKind == ISD::ZERO_EXTEND)
2138 ReturnMVT = MVT::i8;
2140 ReturnMVT = MVT::i32;
2142 EVT MinVT = getRegisterType(Context, ReturnMVT);
2143 return VT.bitsLT(MinVT) ? MinVT : VT;
2146 /// LowerCallResult - Lower the result values of a call into the
2147 /// appropriate copies out of appropriate physical registers.
2150 X86TargetLowering::LowerCallResult(SDValue Chain, SDValue InFlag,
2151 CallingConv::ID CallConv, bool isVarArg,
2152 const SmallVectorImpl<ISD::InputArg> &Ins,
2153 SDLoc dl, SelectionDAG &DAG,
2154 SmallVectorImpl<SDValue> &InVals) const {
2156 // Assign locations to each value returned by this call.
2157 SmallVector<CCValAssign, 16> RVLocs;
2158 bool Is64Bit = Subtarget->is64Bit();
2159 CCState CCInfo(CallConv, isVarArg, DAG.getMachineFunction(), RVLocs,
2161 CCInfo.AnalyzeCallResult(Ins, RetCC_X86);
2163 // Copy all of the result registers out of their specified physreg.
2164 for (unsigned i = 0, e = RVLocs.size(); i != e; ++i) {
2165 CCValAssign &VA = RVLocs[i];
2166 EVT CopyVT = VA.getValVT();
2168 // If this is x86-64, and we disabled SSE, we can't return FP values
2169 if ((CopyVT == MVT::f32 || CopyVT == MVT::f64) &&
2170 ((Is64Bit || Ins[i].Flags.isInReg()) && !Subtarget->hasSSE1())) {
2171 report_fatal_error("SSE register return with SSE disabled");
2174 // If we prefer to use the value in xmm registers, copy it out as f80 and
2175 // use a truncate to move it from fp stack reg to xmm reg.
2176 if ((VA.getLocReg() == X86::FP0 || VA.getLocReg() == X86::FP1) &&
2177 isScalarFPTypeInSSEReg(VA.getValVT()))
2180 Chain = DAG.getCopyFromReg(Chain, dl, VA.getLocReg(),
2181 CopyVT, InFlag).getValue(1);
2182 SDValue Val = Chain.getValue(0);
2184 if (CopyVT != VA.getValVT())
2185 Val = DAG.getNode(ISD::FP_ROUND, dl, VA.getValVT(), Val,
2186 // This truncation won't change the value.
2187 DAG.getIntPtrConstant(1));
2189 InFlag = Chain.getValue(2);
2190 InVals.push_back(Val);
2196 //===----------------------------------------------------------------------===//
2197 // C & StdCall & Fast Calling Convention implementation
2198 //===----------------------------------------------------------------------===//
2199 // StdCall calling convention seems to be standard for many Windows' API
2200 // routines and around. It differs from C calling convention just a little:
2201 // callee should clean up the stack, not caller. Symbols should be also
2202 // decorated in some fancy way :) It doesn't support any vector arguments.
2203 // For info on fast calling convention see Fast Calling Convention (tail call)
2204 // implementation LowerX86_32FastCCCallTo.
2206 /// CallIsStructReturn - Determines whether a call uses struct return
2208 enum StructReturnType {
2213 static StructReturnType
2214 callIsStructReturn(const SmallVectorImpl<ISD::OutputArg> &Outs) {
2216 return NotStructReturn;
2218 const ISD::ArgFlagsTy &Flags = Outs[0].Flags;
2219 if (!Flags.isSRet())
2220 return NotStructReturn;
2221 if (Flags.isInReg())
2222 return RegStructReturn;
2223 return StackStructReturn;
2226 /// ArgsAreStructReturn - Determines whether a function uses struct
2227 /// return semantics.
2228 static StructReturnType
2229 argsAreStructReturn(const SmallVectorImpl<ISD::InputArg> &Ins) {
2231 return NotStructReturn;
2233 const ISD::ArgFlagsTy &Flags = Ins[0].Flags;
2234 if (!Flags.isSRet())
2235 return NotStructReturn;
2236 if (Flags.isInReg())
2237 return RegStructReturn;
2238 return StackStructReturn;
2241 /// CreateCopyOfByValArgument - Make a copy of an aggregate at address specified
2242 /// by "Src" to address "Dst" with size and alignment information specified by
2243 /// the specific parameter attribute. The copy will be passed as a byval
2244 /// function parameter.
2246 CreateCopyOfByValArgument(SDValue Src, SDValue Dst, SDValue Chain,
2247 ISD::ArgFlagsTy Flags, SelectionDAG &DAG,
2249 SDValue SizeNode = DAG.getConstant(Flags.getByValSize(), MVT::i32);
2251 return DAG.getMemcpy(Chain, dl, Dst, Src, SizeNode, Flags.getByValAlign(),
2252 /*isVolatile*/false, /*AlwaysInline=*/true,
2253 MachinePointerInfo(), MachinePointerInfo());
2256 /// IsTailCallConvention - Return true if the calling convention is one that
2257 /// supports tail call optimization.
2258 static bool IsTailCallConvention(CallingConv::ID CC) {
2259 return (CC == CallingConv::Fast || CC == CallingConv::GHC ||
2260 CC == CallingConv::HiPE);
2263 /// \brief Return true if the calling convention is a C calling convention.
2264 static bool IsCCallConvention(CallingConv::ID CC) {
2265 return (CC == CallingConv::C || CC == CallingConv::X86_64_Win64 ||
2266 CC == CallingConv::X86_64_SysV);
2269 bool X86TargetLowering::mayBeEmittedAsTailCall(CallInst *CI) const {
2270 if (!CI->isTailCall() || getTargetMachine().Options.DisableTailCalls)
2274 CallingConv::ID CalleeCC = CS.getCallingConv();
2275 if (!IsTailCallConvention(CalleeCC) && !IsCCallConvention(CalleeCC))
2281 /// FuncIsMadeTailCallSafe - Return true if the function is being made into
2282 /// a tailcall target by changing its ABI.
2283 static bool FuncIsMadeTailCallSafe(CallingConv::ID CC,
2284 bool GuaranteedTailCallOpt) {
2285 return GuaranteedTailCallOpt && IsTailCallConvention(CC);
2289 X86TargetLowering::LowerMemArgument(SDValue Chain,
2290 CallingConv::ID CallConv,
2291 const SmallVectorImpl<ISD::InputArg> &Ins,
2292 SDLoc dl, SelectionDAG &DAG,
2293 const CCValAssign &VA,
2294 MachineFrameInfo *MFI,
2296 // Create the nodes corresponding to a load from this parameter slot.
2297 ISD::ArgFlagsTy Flags = Ins[i].Flags;
2298 bool AlwaysUseMutable = FuncIsMadeTailCallSafe(
2299 CallConv, DAG.getTarget().Options.GuaranteedTailCallOpt);
2300 bool isImmutable = !AlwaysUseMutable && !Flags.isByVal();
2303 // If value is passed by pointer we have address passed instead of the value
2305 if (VA.getLocInfo() == CCValAssign::Indirect)
2306 ValVT = VA.getLocVT();
2308 ValVT = VA.getValVT();
2310 // FIXME: For now, all byval parameter objects are marked mutable. This can be
2311 // changed with more analysis.
2312 // In case of tail call optimization mark all arguments mutable. Since they
2313 // could be overwritten by lowering of arguments in case of a tail call.
2314 if (Flags.isByVal()) {
2315 unsigned Bytes = Flags.getByValSize();
2316 if (Bytes == 0) Bytes = 1; // Don't create zero-sized stack objects.
2317 int FI = MFI->CreateFixedObject(Bytes, VA.getLocMemOffset(), isImmutable);
2318 return DAG.getFrameIndex(FI, getPointerTy());
2320 int FI = MFI->CreateFixedObject(ValVT.getSizeInBits()/8,
2321 VA.getLocMemOffset(), isImmutable);
2322 SDValue FIN = DAG.getFrameIndex(FI, getPointerTy());
2323 return DAG.getLoad(ValVT, dl, Chain, FIN,
2324 MachinePointerInfo::getFixedStack(FI),
2325 false, false, false, 0);
2329 // FIXME: Get this from tablegen.
2330 static ArrayRef<MCPhysReg> get64BitArgumentGPRs(CallingConv::ID CallConv,
2331 const X86Subtarget *Subtarget) {
2332 assert(Subtarget->is64Bit());
2334 if (Subtarget->isCallingConvWin64(CallConv)) {
2335 static const MCPhysReg GPR64ArgRegsWin64[] = {
2336 X86::RCX, X86::RDX, X86::R8, X86::R9
2338 return makeArrayRef(std::begin(GPR64ArgRegsWin64), std::end(GPR64ArgRegsWin64));
2341 static const MCPhysReg GPR64ArgRegs64Bit[] = {
2342 X86::RDI, X86::RSI, X86::RDX, X86::RCX, X86::R8, X86::R9
2344 return makeArrayRef(std::begin(GPR64ArgRegs64Bit), std::end(GPR64ArgRegs64Bit));
2347 // FIXME: Get this from tablegen.
2348 static ArrayRef<MCPhysReg> get64BitArgumentXMMs(MachineFunction &MF,
2349 CallingConv::ID CallConv,
2350 const X86Subtarget *Subtarget) {
2351 assert(Subtarget->is64Bit());
2352 if (Subtarget->isCallingConvWin64(CallConv)) {
2353 // The XMM registers which might contain var arg parameters are shadowed
2354 // in their paired GPR. So we only need to save the GPR to their home
2356 // TODO: __vectorcall will change this.
2360 const Function *Fn = MF.getFunction();
2361 bool NoImplicitFloatOps = Fn->getAttributes().
2362 hasAttribute(AttributeSet::FunctionIndex, Attribute::NoImplicitFloat);
2363 assert(!(MF.getTarget().Options.UseSoftFloat && NoImplicitFloatOps) &&
2364 "SSE register cannot be used when SSE is disabled!");
2365 if (MF.getTarget().Options.UseSoftFloat || NoImplicitFloatOps ||
2366 !Subtarget->hasSSE1())
2367 // Kernel mode asks for SSE to be disabled, so there are no XMM argument
2371 static const MCPhysReg XMMArgRegs64Bit[] = {
2372 X86::XMM0, X86::XMM1, X86::XMM2, X86::XMM3,
2373 X86::XMM4, X86::XMM5, X86::XMM6, X86::XMM7
2375 return makeArrayRef(std::begin(XMMArgRegs64Bit), std::end(XMMArgRegs64Bit));
2379 X86TargetLowering::LowerFormalArguments(SDValue Chain,
2380 CallingConv::ID CallConv,
2382 const SmallVectorImpl<ISD::InputArg> &Ins,
2385 SmallVectorImpl<SDValue> &InVals)
2387 MachineFunction &MF = DAG.getMachineFunction();
2388 X86MachineFunctionInfo *FuncInfo = MF.getInfo<X86MachineFunctionInfo>();
2390 const Function* Fn = MF.getFunction();
2391 if (Fn->hasExternalLinkage() &&
2392 Subtarget->isTargetCygMing() &&
2393 Fn->getName() == "main")
2394 FuncInfo->setForceFramePointer(true);
2396 MachineFrameInfo *MFI = MF.getFrameInfo();
2397 bool Is64Bit = Subtarget->is64Bit();
2398 bool IsWin64 = Subtarget->isCallingConvWin64(CallConv);
2400 assert(!(isVarArg && IsTailCallConvention(CallConv)) &&
2401 "Var args not supported with calling convention fastcc, ghc or hipe");
2403 // Assign locations to all of the incoming arguments.
2404 SmallVector<CCValAssign, 16> ArgLocs;
2405 CCState CCInfo(CallConv, isVarArg, MF, ArgLocs, *DAG.getContext());
2407 // Allocate shadow area for Win64
2409 CCInfo.AllocateStack(32, 8);
2411 CCInfo.AnalyzeFormalArguments(Ins, CC_X86);
2413 unsigned LastVal = ~0U;
2415 for (unsigned i = 0, e = ArgLocs.size(); i != e; ++i) {
2416 CCValAssign &VA = ArgLocs[i];
2417 // TODO: If an arg is passed in two places (e.g. reg and stack), skip later
2419 assert(VA.getValNo() != LastVal &&
2420 "Don't support value assigned to multiple locs yet");
2422 LastVal = VA.getValNo();
2424 if (VA.isRegLoc()) {
2425 EVT RegVT = VA.getLocVT();
2426 const TargetRegisterClass *RC;
2427 if (RegVT == MVT::i32)
2428 RC = &X86::GR32RegClass;
2429 else if (Is64Bit && RegVT == MVT::i64)
2430 RC = &X86::GR64RegClass;
2431 else if (RegVT == MVT::f32)
2432 RC = &X86::FR32RegClass;
2433 else if (RegVT == MVT::f64)
2434 RC = &X86::FR64RegClass;
2435 else if (RegVT.is512BitVector())
2436 RC = &X86::VR512RegClass;
2437 else if (RegVT.is256BitVector())
2438 RC = &X86::VR256RegClass;
2439 else if (RegVT.is128BitVector())
2440 RC = &X86::VR128RegClass;
2441 else if (RegVT == MVT::x86mmx)
2442 RC = &X86::VR64RegClass;
2443 else if (RegVT == MVT::i1)
2444 RC = &X86::VK1RegClass;
2445 else if (RegVT == MVT::v8i1)
2446 RC = &X86::VK8RegClass;
2447 else if (RegVT == MVT::v16i1)
2448 RC = &X86::VK16RegClass;
2449 else if (RegVT == MVT::v32i1)
2450 RC = &X86::VK32RegClass;
2451 else if (RegVT == MVT::v64i1)
2452 RC = &X86::VK64RegClass;
2454 llvm_unreachable("Unknown argument type!");
2456 unsigned Reg = MF.addLiveIn(VA.getLocReg(), RC);
2457 ArgValue = DAG.getCopyFromReg(Chain, dl, Reg, RegVT);
2459 // If this is an 8 or 16-bit value, it is really passed promoted to 32
2460 // bits. Insert an assert[sz]ext to capture this, then truncate to the
2462 if (VA.getLocInfo() == CCValAssign::SExt)
2463 ArgValue = DAG.getNode(ISD::AssertSext, dl, RegVT, ArgValue,
2464 DAG.getValueType(VA.getValVT()));
2465 else if (VA.getLocInfo() == CCValAssign::ZExt)
2466 ArgValue = DAG.getNode(ISD::AssertZext, dl, RegVT, ArgValue,
2467 DAG.getValueType(VA.getValVT()));
2468 else if (VA.getLocInfo() == CCValAssign::BCvt)
2469 ArgValue = DAG.getNode(ISD::BITCAST, dl, VA.getValVT(), ArgValue);
2471 if (VA.isExtInLoc()) {
2472 // Handle MMX values passed in XMM regs.
2473 if (RegVT.isVector())
2474 ArgValue = DAG.getNode(X86ISD::MOVDQ2Q, dl, VA.getValVT(), ArgValue);
2476 ArgValue = DAG.getNode(ISD::TRUNCATE, dl, VA.getValVT(), ArgValue);
2479 assert(VA.isMemLoc());
2480 ArgValue = LowerMemArgument(Chain, CallConv, Ins, dl, DAG, VA, MFI, i);
2483 // If value is passed via pointer - do a load.
2484 if (VA.getLocInfo() == CCValAssign::Indirect)
2485 ArgValue = DAG.getLoad(VA.getValVT(), dl, Chain, ArgValue,
2486 MachinePointerInfo(), false, false, false, 0);
2488 InVals.push_back(ArgValue);
2491 if (Subtarget->is64Bit() || Subtarget->isTargetKnownWindowsMSVC()) {
2492 for (unsigned i = 0, e = ArgLocs.size(); i != e; ++i) {
2493 // The x86-64 ABIs require that for returning structs by value we copy
2494 // the sret argument into %rax/%eax (depending on ABI) for the return.
2495 // Win32 requires us to put the sret argument to %eax as well.
2496 // Save the argument into a virtual register so that we can access it
2497 // from the return points.
2498 if (Ins[i].Flags.isSRet()) {
2499 unsigned Reg = FuncInfo->getSRetReturnReg();
2501 MVT PtrTy = getPointerTy();
2502 Reg = MF.getRegInfo().createVirtualRegister(getRegClassFor(PtrTy));
2503 FuncInfo->setSRetReturnReg(Reg);
2505 SDValue Copy = DAG.getCopyToReg(DAG.getEntryNode(), dl, Reg, InVals[i]);
2506 Chain = DAG.getNode(ISD::TokenFactor, dl, MVT::Other, Copy, Chain);
2512 unsigned StackSize = CCInfo.getNextStackOffset();
2513 // Align stack specially for tail calls.
2514 if (FuncIsMadeTailCallSafe(CallConv,
2515 MF.getTarget().Options.GuaranteedTailCallOpt))
2516 StackSize = GetAlignedArgumentStackSize(StackSize, DAG);
2518 // If the function takes variable number of arguments, make a frame index for
2519 // the start of the first vararg value... for expansion of llvm.va_start. We
2520 // can skip this if there are no va_start calls.
2521 if (MFI->hasVAStart() &&
2522 (Is64Bit || (CallConv != CallingConv::X86_FastCall &&
2523 CallConv != CallingConv::X86_ThisCall))) {
2524 FuncInfo->setVarArgsFrameIndex(
2525 MFI->CreateFixedObject(1, StackSize, true));
2528 // 64-bit calling conventions support varargs and register parameters, so we
2529 // have to do extra work to spill them in the prologue or forward them to
2531 if (Is64Bit && isVarArg &&
2532 (MFI->hasVAStart() || MFI->hasMustTailInVarArgFunc())) {
2533 // Find the first unallocated argument registers.
2534 ArrayRef<MCPhysReg> ArgGPRs = get64BitArgumentGPRs(CallConv, Subtarget);
2535 ArrayRef<MCPhysReg> ArgXMMs = get64BitArgumentXMMs(MF, CallConv, Subtarget);
2536 unsigned NumIntRegs =
2537 CCInfo.getFirstUnallocated(ArgGPRs.data(), ArgGPRs.size());
2538 unsigned NumXMMRegs =
2539 CCInfo.getFirstUnallocated(ArgXMMs.data(), ArgXMMs.size());
2540 assert(!(NumXMMRegs && !Subtarget->hasSSE1()) &&
2541 "SSE register cannot be used when SSE is disabled!");
2543 // Gather all the live in physical registers.
2544 SmallVector<SDValue, 6> LiveGPRs;
2545 SmallVector<SDValue, 8> LiveXMMRegs;
2547 for (MCPhysReg Reg : ArgGPRs.slice(NumIntRegs)) {
2548 unsigned GPR = MF.addLiveIn(Reg, &X86::GR64RegClass);
2550 DAG.getCopyFromReg(Chain, dl, GPR, MVT::i64));
2552 if (!ArgXMMs.empty()) {
2553 unsigned AL = MF.addLiveIn(X86::AL, &X86::GR8RegClass);
2554 ALVal = DAG.getCopyFromReg(Chain, dl, AL, MVT::i8);
2555 for (MCPhysReg Reg : ArgXMMs.slice(NumXMMRegs)) {
2556 unsigned XMMReg = MF.addLiveIn(Reg, &X86::VR128RegClass);
2557 LiveXMMRegs.push_back(
2558 DAG.getCopyFromReg(Chain, dl, XMMReg, MVT::v4f32));
2562 // Store them to the va_list returned by va_start.
2563 if (MFI->hasVAStart()) {
2565 const TargetFrameLowering &TFI = *MF.getSubtarget().getFrameLowering();
2566 // Get to the caller-allocated home save location. Add 8 to account
2567 // for the return address.
2568 int HomeOffset = TFI.getOffsetOfLocalArea() + 8;
2569 FuncInfo->setRegSaveFrameIndex(
2570 MFI->CreateFixedObject(1, NumIntRegs * 8 + HomeOffset, false));
2571 // Fixup to set vararg frame on shadow area (4 x i64).
2573 FuncInfo->setVarArgsFrameIndex(FuncInfo->getRegSaveFrameIndex());
2575 // For X86-64, if there are vararg parameters that are passed via
2576 // registers, then we must store them to their spots on the stack so
2577 // they may be loaded by deferencing the result of va_next.
2578 FuncInfo->setVarArgsGPOffset(NumIntRegs * 8);
2579 FuncInfo->setVarArgsFPOffset(ArgGPRs.size() * 8 + NumXMMRegs * 16);
2580 FuncInfo->setRegSaveFrameIndex(MFI->CreateStackObject(
2581 ArgGPRs.size() * 8 + ArgXMMs.size() * 16, 16, false));
2584 // Store the integer parameter registers.
2585 SmallVector<SDValue, 8> MemOps;
2586 SDValue RSFIN = DAG.getFrameIndex(FuncInfo->getRegSaveFrameIndex(),
2588 unsigned Offset = FuncInfo->getVarArgsGPOffset();
2589 for (SDValue Val : LiveGPRs) {
2590 SDValue FIN = DAG.getNode(ISD::ADD, dl, getPointerTy(), RSFIN,
2591 DAG.getIntPtrConstant(Offset));
2593 DAG.getStore(Val.getValue(1), dl, Val, FIN,
2594 MachinePointerInfo::getFixedStack(
2595 FuncInfo->getRegSaveFrameIndex(), Offset),
2597 MemOps.push_back(Store);
2601 if (!ArgXMMs.empty() && NumXMMRegs != ArgXMMs.size()) {
2602 // Now store the XMM (fp + vector) parameter registers.
2603 SmallVector<SDValue, 12> SaveXMMOps;
2604 SaveXMMOps.push_back(Chain);
2605 SaveXMMOps.push_back(ALVal);
2606 SaveXMMOps.push_back(DAG.getIntPtrConstant(
2607 FuncInfo->getRegSaveFrameIndex()));
2608 SaveXMMOps.push_back(DAG.getIntPtrConstant(
2609 FuncInfo->getVarArgsFPOffset()));
2610 SaveXMMOps.insert(SaveXMMOps.end(), LiveXMMRegs.begin(),
2612 MemOps.push_back(DAG.getNode(X86ISD::VASTART_SAVE_XMM_REGS, dl,
2613 MVT::Other, SaveXMMOps));
2616 if (!MemOps.empty())
2617 Chain = DAG.getNode(ISD::TokenFactor, dl, MVT::Other, MemOps);
2619 // Add all GPRs, al, and XMMs to the list of forwards. We will add then
2620 // to the liveout set on a musttail call.
2621 assert(MFI->hasMustTailInVarArgFunc());
2622 auto &Forwards = FuncInfo->getForwardedMustTailRegParms();
2623 typedef X86MachineFunctionInfo::Forward Forward;
2625 for (unsigned I = 0, E = LiveGPRs.size(); I != E; ++I) {
2627 MF.getRegInfo().createVirtualRegister(&X86::GR64RegClass);
2628 Chain = DAG.getCopyToReg(Chain, dl, VReg, LiveGPRs[I]);
2629 Forwards.push_back(Forward(VReg, ArgGPRs[NumIntRegs + I], MVT::i64));
2632 if (!ArgXMMs.empty()) {
2634 MF.getRegInfo().createVirtualRegister(&X86::GR8RegClass);
2635 Chain = DAG.getCopyToReg(Chain, dl, ALVReg, ALVal);
2636 Forwards.push_back(Forward(ALVReg, X86::AL, MVT::i8));
2638 for (unsigned I = 0, E = LiveXMMRegs.size(); I != E; ++I) {
2640 MF.getRegInfo().createVirtualRegister(&X86::VR128RegClass);
2641 Chain = DAG.getCopyToReg(Chain, dl, VReg, LiveXMMRegs[I]);
2643 Forward(VReg, ArgXMMs[NumXMMRegs + I], MVT::v4f32));
2649 // Some CCs need callee pop.
2650 if (X86::isCalleePop(CallConv, Is64Bit, isVarArg,
2651 MF.getTarget().Options.GuaranteedTailCallOpt)) {
2652 FuncInfo->setBytesToPopOnReturn(StackSize); // Callee pops everything.
2654 FuncInfo->setBytesToPopOnReturn(0); // Callee pops nothing.
2655 // If this is an sret function, the return should pop the hidden pointer.
2656 if (!Is64Bit && !IsTailCallConvention(CallConv) &&
2657 !Subtarget->getTargetTriple().isOSMSVCRT() &&
2658 argsAreStructReturn(Ins) == StackStructReturn)
2659 FuncInfo->setBytesToPopOnReturn(4);
2663 // RegSaveFrameIndex is X86-64 only.
2664 FuncInfo->setRegSaveFrameIndex(0xAAAAAAA);
2665 if (CallConv == CallingConv::X86_FastCall ||
2666 CallConv == CallingConv::X86_ThisCall)
2667 // fastcc functions can't have varargs.
2668 FuncInfo->setVarArgsFrameIndex(0xAAAAAAA);
2671 FuncInfo->setArgumentStackSize(StackSize);
2677 X86TargetLowering::LowerMemOpCallTo(SDValue Chain,
2678 SDValue StackPtr, SDValue Arg,
2679 SDLoc dl, SelectionDAG &DAG,
2680 const CCValAssign &VA,
2681 ISD::ArgFlagsTy Flags) const {
2682 unsigned LocMemOffset = VA.getLocMemOffset();
2683 SDValue PtrOff = DAG.getIntPtrConstant(LocMemOffset);
2684 PtrOff = DAG.getNode(ISD::ADD, dl, getPointerTy(), StackPtr, PtrOff);
2685 if (Flags.isByVal())
2686 return CreateCopyOfByValArgument(Arg, PtrOff, Chain, Flags, DAG, dl);
2688 return DAG.getStore(Chain, dl, Arg, PtrOff,
2689 MachinePointerInfo::getStack(LocMemOffset),
2693 /// EmitTailCallLoadRetAddr - Emit a load of return address if tail call
2694 /// optimization is performed and it is required.
2696 X86TargetLowering::EmitTailCallLoadRetAddr(SelectionDAG &DAG,
2697 SDValue &OutRetAddr, SDValue Chain,
2698 bool IsTailCall, bool Is64Bit,
2699 int FPDiff, SDLoc dl) const {
2700 // Adjust the Return address stack slot.
2701 EVT VT = getPointerTy();
2702 OutRetAddr = getReturnAddressFrameIndex(DAG);
2704 // Load the "old" Return address.
2705 OutRetAddr = DAG.getLoad(VT, dl, Chain, OutRetAddr, MachinePointerInfo(),
2706 false, false, false, 0);
2707 return SDValue(OutRetAddr.getNode(), 1);
2710 /// EmitTailCallStoreRetAddr - Emit a store of the return address if tail call
2711 /// optimization is performed and it is required (FPDiff!=0).
2712 static SDValue EmitTailCallStoreRetAddr(SelectionDAG &DAG, MachineFunction &MF,
2713 SDValue Chain, SDValue RetAddrFrIdx,
2714 EVT PtrVT, unsigned SlotSize,
2715 int FPDiff, SDLoc dl) {
2716 // Store the return address to the appropriate stack slot.
2717 if (!FPDiff) return Chain;
2718 // Calculate the new stack slot for the return address.
2719 int NewReturnAddrFI =
2720 MF.getFrameInfo()->CreateFixedObject(SlotSize, (int64_t)FPDiff - SlotSize,
2722 SDValue NewRetAddrFrIdx = DAG.getFrameIndex(NewReturnAddrFI, PtrVT);
2723 Chain = DAG.getStore(Chain, dl, RetAddrFrIdx, NewRetAddrFrIdx,
2724 MachinePointerInfo::getFixedStack(NewReturnAddrFI),
2730 X86TargetLowering::LowerCall(TargetLowering::CallLoweringInfo &CLI,
2731 SmallVectorImpl<SDValue> &InVals) const {
2732 SelectionDAG &DAG = CLI.DAG;
2734 SmallVectorImpl<ISD::OutputArg> &Outs = CLI.Outs;
2735 SmallVectorImpl<SDValue> &OutVals = CLI.OutVals;
2736 SmallVectorImpl<ISD::InputArg> &Ins = CLI.Ins;
2737 SDValue Chain = CLI.Chain;
2738 SDValue Callee = CLI.Callee;
2739 CallingConv::ID CallConv = CLI.CallConv;
2740 bool &isTailCall = CLI.IsTailCall;
2741 bool isVarArg = CLI.IsVarArg;
2743 MachineFunction &MF = DAG.getMachineFunction();
2744 bool Is64Bit = Subtarget->is64Bit();
2745 bool IsWin64 = Subtarget->isCallingConvWin64(CallConv);
2746 StructReturnType SR = callIsStructReturn(Outs);
2747 bool IsSibcall = false;
2748 X86MachineFunctionInfo *X86Info = MF.getInfo<X86MachineFunctionInfo>();
2750 if (MF.getTarget().Options.DisableTailCalls)
2753 bool IsMustTail = CLI.CS && CLI.CS->isMustTailCall();
2755 // Force this to be a tail call. The verifier rules are enough to ensure
2756 // that we can lower this successfully without moving the return address
2759 } else if (isTailCall) {
2760 // Check if it's really possible to do a tail call.
2761 isTailCall = IsEligibleForTailCallOptimization(Callee, CallConv,
2762 isVarArg, SR != NotStructReturn,
2763 MF.getFunction()->hasStructRetAttr(), CLI.RetTy,
2764 Outs, OutVals, Ins, DAG);
2766 // Sibcalls are automatically detected tailcalls which do not require
2768 if (!MF.getTarget().Options.GuaranteedTailCallOpt && isTailCall)
2775 assert(!(isVarArg && IsTailCallConvention(CallConv)) &&
2776 "Var args not supported with calling convention fastcc, ghc or hipe");
2778 // Analyze operands of the call, assigning locations to each operand.
2779 SmallVector<CCValAssign, 16> ArgLocs;
2780 CCState CCInfo(CallConv, isVarArg, MF, ArgLocs, *DAG.getContext());
2782 // Allocate shadow area for Win64
2784 CCInfo.AllocateStack(32, 8);
2786 CCInfo.AnalyzeCallOperands(Outs, CC_X86);
2788 // Get a count of how many bytes are to be pushed on the stack.
2789 unsigned NumBytes = CCInfo.getNextStackOffset();
2791 // This is a sibcall. The memory operands are available in caller's
2792 // own caller's stack.
2794 else if (MF.getTarget().Options.GuaranteedTailCallOpt &&
2795 IsTailCallConvention(CallConv))
2796 NumBytes = GetAlignedArgumentStackSize(NumBytes, DAG);
2799 if (isTailCall && !IsSibcall && !IsMustTail) {
2800 // Lower arguments at fp - stackoffset + fpdiff.
2801 unsigned NumBytesCallerPushed = X86Info->getBytesToPopOnReturn();
2803 FPDiff = NumBytesCallerPushed - NumBytes;
2805 // Set the delta of movement of the returnaddr stackslot.
2806 // But only set if delta is greater than previous delta.
2807 if (FPDiff < X86Info->getTCReturnAddrDelta())
2808 X86Info->setTCReturnAddrDelta(FPDiff);
2811 unsigned NumBytesToPush = NumBytes;
2812 unsigned NumBytesToPop = NumBytes;
2814 // If we have an inalloca argument, all stack space has already been allocated
2815 // for us and be right at the top of the stack. We don't support multiple
2816 // arguments passed in memory when using inalloca.
2817 if (!Outs.empty() && Outs.back().Flags.isInAlloca()) {
2819 if (!ArgLocs.back().isMemLoc())
2820 report_fatal_error("cannot use inalloca attribute on a register "
2822 if (ArgLocs.back().getLocMemOffset() != 0)
2823 report_fatal_error("any parameter with the inalloca attribute must be "
2824 "the only memory argument");
2828 Chain = DAG.getCALLSEQ_START(
2829 Chain, DAG.getIntPtrConstant(NumBytesToPush, true), dl);
2831 SDValue RetAddrFrIdx;
2832 // Load return address for tail calls.
2833 if (isTailCall && FPDiff)
2834 Chain = EmitTailCallLoadRetAddr(DAG, RetAddrFrIdx, Chain, isTailCall,
2835 Is64Bit, FPDiff, dl);
2837 SmallVector<std::pair<unsigned, SDValue>, 8> RegsToPass;
2838 SmallVector<SDValue, 8> MemOpChains;
2841 // Walk the register/memloc assignments, inserting copies/loads. In the case
2842 // of tail call optimization arguments are handle later.
2843 const X86RegisterInfo *RegInfo = static_cast<const X86RegisterInfo *>(
2844 DAG.getSubtarget().getRegisterInfo());
2845 for (unsigned i = 0, e = ArgLocs.size(); i != e; ++i) {
2846 // Skip inalloca arguments, they have already been written.
2847 ISD::ArgFlagsTy Flags = Outs[i].Flags;
2848 if (Flags.isInAlloca())
2851 CCValAssign &VA = ArgLocs[i];
2852 EVT RegVT = VA.getLocVT();
2853 SDValue Arg = OutVals[i];
2854 bool isByVal = Flags.isByVal();
2856 // Promote the value if needed.
2857 switch (VA.getLocInfo()) {
2858 default: llvm_unreachable("Unknown loc info!");
2859 case CCValAssign::Full: break;
2860 case CCValAssign::SExt:
2861 Arg = DAG.getNode(ISD::SIGN_EXTEND, dl, RegVT, Arg);
2863 case CCValAssign::ZExt:
2864 Arg = DAG.getNode(ISD::ZERO_EXTEND, dl, RegVT, Arg);
2866 case CCValAssign::AExt:
2867 if (RegVT.is128BitVector()) {
2868 // Special case: passing MMX values in XMM registers.
2869 Arg = DAG.getNode(ISD::BITCAST, dl, MVT::i64, Arg);
2870 Arg = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, MVT::v2i64, Arg);
2871 Arg = getMOVL(DAG, dl, MVT::v2i64, DAG.getUNDEF(MVT::v2i64), Arg);
2873 Arg = DAG.getNode(ISD::ANY_EXTEND, dl, RegVT, Arg);
2875 case CCValAssign::BCvt:
2876 Arg = DAG.getNode(ISD::BITCAST, dl, RegVT, Arg);
2878 case CCValAssign::Indirect: {
2879 // Store the argument.
2880 SDValue SpillSlot = DAG.CreateStackTemporary(VA.getValVT());
2881 int FI = cast<FrameIndexSDNode>(SpillSlot)->getIndex();
2882 Chain = DAG.getStore(Chain, dl, Arg, SpillSlot,
2883 MachinePointerInfo::getFixedStack(FI),
2890 if (VA.isRegLoc()) {
2891 RegsToPass.push_back(std::make_pair(VA.getLocReg(), Arg));
2892 if (isVarArg && IsWin64) {
2893 // Win64 ABI requires argument XMM reg to be copied to the corresponding
2894 // shadow reg if callee is a varargs function.
2895 unsigned ShadowReg = 0;
2896 switch (VA.getLocReg()) {
2897 case X86::XMM0: ShadowReg = X86::RCX; break;
2898 case X86::XMM1: ShadowReg = X86::RDX; break;
2899 case X86::XMM2: ShadowReg = X86::R8; break;
2900 case X86::XMM3: ShadowReg = X86::R9; break;
2903 RegsToPass.push_back(std::make_pair(ShadowReg, Arg));
2905 } else if (!IsSibcall && (!isTailCall || isByVal)) {
2906 assert(VA.isMemLoc());
2907 if (!StackPtr.getNode())
2908 StackPtr = DAG.getCopyFromReg(Chain, dl, RegInfo->getStackRegister(),
2910 MemOpChains.push_back(LowerMemOpCallTo(Chain, StackPtr, Arg,
2911 dl, DAG, VA, Flags));
2915 if (!MemOpChains.empty())
2916 Chain = DAG.getNode(ISD::TokenFactor, dl, MVT::Other, MemOpChains);
2918 if (Subtarget->isPICStyleGOT()) {
2919 // ELF / PIC requires GOT in the EBX register before function calls via PLT
2922 RegsToPass.push_back(std::make_pair(unsigned(X86::EBX),
2923 DAG.getNode(X86ISD::GlobalBaseReg, SDLoc(), getPointerTy())));
2925 // If we are tail calling and generating PIC/GOT style code load the
2926 // address of the callee into ECX. The value in ecx is used as target of
2927 // the tail jump. This is done to circumvent the ebx/callee-saved problem
2928 // for tail calls on PIC/GOT architectures. Normally we would just put the
2929 // address of GOT into ebx and then call target@PLT. But for tail calls
2930 // ebx would be restored (since ebx is callee saved) before jumping to the
2933 // Note: The actual moving to ECX is done further down.
2934 GlobalAddressSDNode *G = dyn_cast<GlobalAddressSDNode>(Callee);
2935 if (G && !G->getGlobal()->hasHiddenVisibility() &&
2936 !G->getGlobal()->hasProtectedVisibility())
2937 Callee = LowerGlobalAddress(Callee, DAG);
2938 else if (isa<ExternalSymbolSDNode>(Callee))
2939 Callee = LowerExternalSymbol(Callee, DAG);
2943 if (Is64Bit && isVarArg && !IsWin64 && !IsMustTail) {
2944 // From AMD64 ABI document:
2945 // For calls that may call functions that use varargs or stdargs
2946 // (prototype-less calls or calls to functions containing ellipsis (...) in
2947 // the declaration) %al is used as hidden argument to specify the number
2948 // of SSE registers used. The contents of %al do not need to match exactly
2949 // the number of registers, but must be an ubound on the number of SSE
2950 // registers used and is in the range 0 - 8 inclusive.
2952 // Count the number of XMM registers allocated.
2953 static const MCPhysReg XMMArgRegs[] = {
2954 X86::XMM0, X86::XMM1, X86::XMM2, X86::XMM3,
2955 X86::XMM4, X86::XMM5, X86::XMM6, X86::XMM7
2957 unsigned NumXMMRegs = CCInfo.getFirstUnallocated(XMMArgRegs, 8);
2958 assert((Subtarget->hasSSE1() || !NumXMMRegs)
2959 && "SSE registers cannot be used when SSE is disabled");
2961 RegsToPass.push_back(std::make_pair(unsigned(X86::AL),
2962 DAG.getConstant(NumXMMRegs, MVT::i8)));
2965 if (Is64Bit && isVarArg && IsMustTail) {
2966 const auto &Forwards = X86Info->getForwardedMustTailRegParms();
2967 for (const auto &F : Forwards) {
2968 SDValue Val = DAG.getCopyFromReg(Chain, dl, F.VReg, F.VT);
2969 RegsToPass.push_back(std::make_pair(unsigned(F.PReg), Val));
2973 // For tail calls lower the arguments to the 'real' stack slots. Sibcalls
2974 // don't need this because the eligibility check rejects calls that require
2975 // shuffling arguments passed in memory.
2976 if (!IsSibcall && isTailCall) {
2977 // Force all the incoming stack arguments to be loaded from the stack
2978 // before any new outgoing arguments are stored to the stack, because the
2979 // outgoing stack slots may alias the incoming argument stack slots, and
2980 // the alias isn't otherwise explicit. This is slightly more conservative
2981 // than necessary, because it means that each store effectively depends
2982 // on every argument instead of just those arguments it would clobber.
2983 SDValue ArgChain = DAG.getStackArgumentTokenFactor(Chain);
2985 SmallVector<SDValue, 8> MemOpChains2;
2988 for (unsigned i = 0, e = ArgLocs.size(); i != e; ++i) {
2989 CCValAssign &VA = ArgLocs[i];
2992 assert(VA.isMemLoc());
2993 SDValue Arg = OutVals[i];
2994 ISD::ArgFlagsTy Flags = Outs[i].Flags;
2995 // Skip inalloca arguments. They don't require any work.
2996 if (Flags.isInAlloca())
2998 // Create frame index.
2999 int32_t Offset = VA.getLocMemOffset()+FPDiff;
3000 uint32_t OpSize = (VA.getLocVT().getSizeInBits()+7)/8;
3001 FI = MF.getFrameInfo()->CreateFixedObject(OpSize, Offset, true);
3002 FIN = DAG.getFrameIndex(FI, getPointerTy());
3004 if (Flags.isByVal()) {
3005 // Copy relative to framepointer.
3006 SDValue Source = DAG.getIntPtrConstant(VA.getLocMemOffset());
3007 if (!StackPtr.getNode())
3008 StackPtr = DAG.getCopyFromReg(Chain, dl,
3009 RegInfo->getStackRegister(),
3011 Source = DAG.getNode(ISD::ADD, dl, getPointerTy(), StackPtr, Source);
3013 MemOpChains2.push_back(CreateCopyOfByValArgument(Source, FIN,
3017 // Store relative to framepointer.
3018 MemOpChains2.push_back(
3019 DAG.getStore(ArgChain, dl, Arg, FIN,
3020 MachinePointerInfo::getFixedStack(FI),
3025 if (!MemOpChains2.empty())
3026 Chain = DAG.getNode(ISD::TokenFactor, dl, MVT::Other, MemOpChains2);
3028 // Store the return address to the appropriate stack slot.
3029 Chain = EmitTailCallStoreRetAddr(DAG, MF, Chain, RetAddrFrIdx,
3030 getPointerTy(), RegInfo->getSlotSize(),
3034 // Build a sequence of copy-to-reg nodes chained together with token chain
3035 // and flag operands which copy the outgoing args into registers.
3037 for (unsigned i = 0, e = RegsToPass.size(); i != e; ++i) {
3038 Chain = DAG.getCopyToReg(Chain, dl, RegsToPass[i].first,
3039 RegsToPass[i].second, InFlag);
3040 InFlag = Chain.getValue(1);
3043 if (DAG.getTarget().getCodeModel() == CodeModel::Large) {
3044 assert(Is64Bit && "Large code model is only legal in 64-bit mode.");
3045 // In the 64-bit large code model, we have to make all calls
3046 // through a register, since the call instruction's 32-bit
3047 // pc-relative offset may not be large enough to hold the whole
3049 } else if (GlobalAddressSDNode *G = dyn_cast<GlobalAddressSDNode>(Callee)) {
3050 // If the callee is a GlobalAddress node (quite common, every direct call
3051 // is) turn it into a TargetGlobalAddress node so that legalize doesn't hack
3054 // We should use extra load for direct calls to dllimported functions in
3056 const GlobalValue *GV = G->getGlobal();
3057 if (!GV->hasDLLImportStorageClass()) {
3058 unsigned char OpFlags = 0;
3059 bool ExtraLoad = false;
3060 unsigned WrapperKind = ISD::DELETED_NODE;
3062 // On ELF targets, in both X86-64 and X86-32 mode, direct calls to
3063 // external symbols most go through the PLT in PIC mode. If the symbol
3064 // has hidden or protected visibility, or if it is static or local, then
3065 // we don't need to use the PLT - we can directly call it.
3066 if (Subtarget->isTargetELF() &&
3067 DAG.getTarget().getRelocationModel() == Reloc::PIC_ &&
3068 GV->hasDefaultVisibility() && !GV->hasLocalLinkage()) {
3069 OpFlags = X86II::MO_PLT;
3070 } else if (Subtarget->isPICStyleStubAny() &&
3071 (GV->isDeclaration() || GV->isWeakForLinker()) &&
3072 (!Subtarget->getTargetTriple().isMacOSX() ||
3073 Subtarget->getTargetTriple().isMacOSXVersionLT(10, 5))) {
3074 // PC-relative references to external symbols should go through $stub,
3075 // unless we're building with the leopard linker or later, which
3076 // automatically synthesizes these stubs.
3077 OpFlags = X86II::MO_DARWIN_STUB;
3078 } else if (Subtarget->isPICStyleRIPRel() &&
3079 isa<Function>(GV) &&
3080 cast<Function>(GV)->getAttributes().
3081 hasAttribute(AttributeSet::FunctionIndex,
3082 Attribute::NonLazyBind)) {
3083 // If the function is marked as non-lazy, generate an indirect call
3084 // which loads from the GOT directly. This avoids runtime overhead
3085 // at the cost of eager binding (and one extra byte of encoding).
3086 OpFlags = X86II::MO_GOTPCREL;
3087 WrapperKind = X86ISD::WrapperRIP;
3091 Callee = DAG.getTargetGlobalAddress(GV, dl, getPointerTy(),
3092 G->getOffset(), OpFlags);
3094 // Add a wrapper if needed.
3095 if (WrapperKind != ISD::DELETED_NODE)
3096 Callee = DAG.getNode(X86ISD::WrapperRIP, dl, getPointerTy(), Callee);
3097 // Add extra indirection if needed.
3099 Callee = DAG.getLoad(getPointerTy(), dl, DAG.getEntryNode(), Callee,
3100 MachinePointerInfo::getGOT(),
3101 false, false, false, 0);
3103 } else if (ExternalSymbolSDNode *S = dyn_cast<ExternalSymbolSDNode>(Callee)) {
3104 unsigned char OpFlags = 0;
3106 // On ELF targets, in either X86-64 or X86-32 mode, direct calls to
3107 // external symbols should go through the PLT.
3108 if (Subtarget->isTargetELF() &&
3109 DAG.getTarget().getRelocationModel() == Reloc::PIC_) {
3110 OpFlags = X86II::MO_PLT;
3111 } else if (Subtarget->isPICStyleStubAny() &&
3112 (!Subtarget->getTargetTriple().isMacOSX() ||
3113 Subtarget->getTargetTriple().isMacOSXVersionLT(10, 5))) {
3114 // PC-relative references to external symbols should go through $stub,
3115 // unless we're building with the leopard linker or later, which
3116 // automatically synthesizes these stubs.
3117 OpFlags = X86II::MO_DARWIN_STUB;
3120 Callee = DAG.getTargetExternalSymbol(S->getSymbol(), getPointerTy(),
3124 // Returns a chain & a flag for retval copy to use.
3125 SDVTList NodeTys = DAG.getVTList(MVT::Other, MVT::Glue);
3126 SmallVector<SDValue, 8> Ops;
3128 if (!IsSibcall && isTailCall) {
3129 Chain = DAG.getCALLSEQ_END(Chain,
3130 DAG.getIntPtrConstant(NumBytesToPop, true),
3131 DAG.getIntPtrConstant(0, true), InFlag, dl);
3132 InFlag = Chain.getValue(1);
3135 Ops.push_back(Chain);
3136 Ops.push_back(Callee);
3139 Ops.push_back(DAG.getConstant(FPDiff, MVT::i32));
3141 // Add argument registers to the end of the list so that they are known live
3143 for (unsigned i = 0, e = RegsToPass.size(); i != e; ++i)
3144 Ops.push_back(DAG.getRegister(RegsToPass[i].first,
3145 RegsToPass[i].second.getValueType()));
3147 // Add a register mask operand representing the call-preserved registers.
3148 const TargetRegisterInfo *TRI = DAG.getSubtarget().getRegisterInfo();
3149 const uint32_t *Mask = TRI->getCallPreservedMask(CallConv);
3150 assert(Mask && "Missing call preserved mask for calling convention");
3151 Ops.push_back(DAG.getRegisterMask(Mask));
3153 if (InFlag.getNode())
3154 Ops.push_back(InFlag);
3158 //// If this is the first return lowered for this function, add the regs
3159 //// to the liveout set for the function.
3160 // This isn't right, although it's probably harmless on x86; liveouts
3161 // should be computed from returns not tail calls. Consider a void
3162 // function making a tail call to a function returning int.
3163 return DAG.getNode(X86ISD::TC_RETURN, dl, NodeTys, Ops);
3166 Chain = DAG.getNode(X86ISD::CALL, dl, NodeTys, Ops);
3167 InFlag = Chain.getValue(1);
3169 // Create the CALLSEQ_END node.
3170 unsigned NumBytesForCalleeToPop;
3171 if (X86::isCalleePop(CallConv, Is64Bit, isVarArg,
3172 DAG.getTarget().Options.GuaranteedTailCallOpt))
3173 NumBytesForCalleeToPop = NumBytes; // Callee pops everything
3174 else if (!Is64Bit && !IsTailCallConvention(CallConv) &&
3175 !Subtarget->getTargetTriple().isOSMSVCRT() &&
3176 SR == StackStructReturn)
3177 // If this is a call to a struct-return function, the callee
3178 // pops the hidden struct pointer, so we have to push it back.
3179 // This is common for Darwin/X86, Linux & Mingw32 targets.
3180 // For MSVC Win32 targets, the caller pops the hidden struct pointer.
3181 NumBytesForCalleeToPop = 4;
3183 NumBytesForCalleeToPop = 0; // Callee pops nothing.
3185 // Returns a flag for retval copy to use.
3187 Chain = DAG.getCALLSEQ_END(Chain,
3188 DAG.getIntPtrConstant(NumBytesToPop, true),
3189 DAG.getIntPtrConstant(NumBytesForCalleeToPop,
3192 InFlag = Chain.getValue(1);
3195 // Handle result values, copying them out of physregs into vregs that we
3197 return LowerCallResult(Chain, InFlag, CallConv, isVarArg,
3198 Ins, dl, DAG, InVals);
3201 //===----------------------------------------------------------------------===//
3202 // Fast Calling Convention (tail call) implementation
3203 //===----------------------------------------------------------------------===//
3205 // Like std call, callee cleans arguments, convention except that ECX is
3206 // reserved for storing the tail called function address. Only 2 registers are
3207 // free for argument passing (inreg). Tail call optimization is performed
3209 // * tailcallopt is enabled
3210 // * caller/callee are fastcc
3211 // On X86_64 architecture with GOT-style position independent code only local
3212 // (within module) calls are supported at the moment.
3213 // To keep the stack aligned according to platform abi the function
3214 // GetAlignedArgumentStackSize ensures that argument delta is always multiples
3215 // of stack alignment. (Dynamic linkers need this - darwin's dyld for example)
3216 // If a tail called function callee has more arguments than the caller the
3217 // caller needs to make sure that there is room to move the RETADDR to. This is
3218 // achieved by reserving an area the size of the argument delta right after the
3219 // original RETADDR, but before the saved framepointer or the spilled registers
3220 // e.g. caller(arg1, arg2) calls callee(arg1, arg2,arg3,arg4)
3232 /// GetAlignedArgumentStackSize - Make the stack size align e.g 16n + 12 aligned
3233 /// for a 16 byte align requirement.
3235 X86TargetLowering::GetAlignedArgumentStackSize(unsigned StackSize,
3236 SelectionDAG& DAG) const {
3237 MachineFunction &MF = DAG.getMachineFunction();
3238 const TargetMachine &TM = MF.getTarget();
3239 const X86RegisterInfo *RegInfo = static_cast<const X86RegisterInfo *>(
3240 TM.getSubtargetImpl()->getRegisterInfo());
3241 const TargetFrameLowering &TFI = *TM.getSubtargetImpl()->getFrameLowering();
3242 unsigned StackAlignment = TFI.getStackAlignment();
3243 uint64_t AlignMask = StackAlignment - 1;
3244 int64_t Offset = StackSize;
3245 unsigned SlotSize = RegInfo->getSlotSize();
3246 if ( (Offset & AlignMask) <= (StackAlignment - SlotSize) ) {
3247 // Number smaller than 12 so just add the difference.
3248 Offset += ((StackAlignment - SlotSize) - (Offset & AlignMask));
3250 // Mask out lower bits, add stackalignment once plus the 12 bytes.
3251 Offset = ((~AlignMask) & Offset) + StackAlignment +
3252 (StackAlignment-SlotSize);
3257 /// MatchingStackOffset - Return true if the given stack call argument is
3258 /// already available in the same position (relatively) of the caller's
3259 /// incoming argument stack.
3261 bool MatchingStackOffset(SDValue Arg, unsigned Offset, ISD::ArgFlagsTy Flags,
3262 MachineFrameInfo *MFI, const MachineRegisterInfo *MRI,
3263 const X86InstrInfo *TII) {
3264 unsigned Bytes = Arg.getValueType().getSizeInBits() / 8;
3266 if (Arg.getOpcode() == ISD::CopyFromReg) {
3267 unsigned VR = cast<RegisterSDNode>(Arg.getOperand(1))->getReg();
3268 if (!TargetRegisterInfo::isVirtualRegister(VR))
3270 MachineInstr *Def = MRI->getVRegDef(VR);
3273 if (!Flags.isByVal()) {
3274 if (!TII->isLoadFromStackSlot(Def, FI))
3277 unsigned Opcode = Def->getOpcode();
3278 if ((Opcode == X86::LEA32r || Opcode == X86::LEA64r) &&
3279 Def->getOperand(1).isFI()) {
3280 FI = Def->getOperand(1).getIndex();
3281 Bytes = Flags.getByValSize();
3285 } else if (LoadSDNode *Ld = dyn_cast<LoadSDNode>(Arg)) {
3286 if (Flags.isByVal())
3287 // ByVal argument is passed in as a pointer but it's now being
3288 // dereferenced. e.g.
3289 // define @foo(%struct.X* %A) {
3290 // tail call @bar(%struct.X* byval %A)
3293 SDValue Ptr = Ld->getBasePtr();
3294 FrameIndexSDNode *FINode = dyn_cast<FrameIndexSDNode>(Ptr);
3297 FI = FINode->getIndex();
3298 } else if (Arg.getOpcode() == ISD::FrameIndex && Flags.isByVal()) {
3299 FrameIndexSDNode *FINode = cast<FrameIndexSDNode>(Arg);
3300 FI = FINode->getIndex();
3301 Bytes = Flags.getByValSize();
3305 assert(FI != INT_MAX);
3306 if (!MFI->isFixedObjectIndex(FI))
3308 return Offset == MFI->getObjectOffset(FI) && Bytes == MFI->getObjectSize(FI);
3311 /// IsEligibleForTailCallOptimization - Check whether the call is eligible
3312 /// for tail call optimization. Targets which want to do tail call
3313 /// optimization should implement this function.
3315 X86TargetLowering::IsEligibleForTailCallOptimization(SDValue Callee,
3316 CallingConv::ID CalleeCC,
3318 bool isCalleeStructRet,
3319 bool isCallerStructRet,
3321 const SmallVectorImpl<ISD::OutputArg> &Outs,
3322 const SmallVectorImpl<SDValue> &OutVals,
3323 const SmallVectorImpl<ISD::InputArg> &Ins,
3324 SelectionDAG &DAG) const {
3325 if (!IsTailCallConvention(CalleeCC) && !IsCCallConvention(CalleeCC))
3328 // If -tailcallopt is specified, make fastcc functions tail-callable.
3329 const MachineFunction &MF = DAG.getMachineFunction();
3330 const Function *CallerF = MF.getFunction();
3332 // If the function return type is x86_fp80 and the callee return type is not,
3333 // then the FP_EXTEND of the call result is not a nop. It's not safe to
3334 // perform a tailcall optimization here.
3335 if (CallerF->getReturnType()->isX86_FP80Ty() && !RetTy->isX86_FP80Ty())
3338 CallingConv::ID CallerCC = CallerF->getCallingConv();
3339 bool CCMatch = CallerCC == CalleeCC;
3340 bool IsCalleeWin64 = Subtarget->isCallingConvWin64(CalleeCC);
3341 bool IsCallerWin64 = Subtarget->isCallingConvWin64(CallerCC);
3343 if (DAG.getTarget().Options.GuaranteedTailCallOpt) {
3344 if (IsTailCallConvention(CalleeCC) && CCMatch)
3349 // Look for obvious safe cases to perform tail call optimization that do not
3350 // require ABI changes. This is what gcc calls sibcall.
3352 // Can't do sibcall if stack needs to be dynamically re-aligned. PEI needs to
3353 // emit a special epilogue.
3354 const X86RegisterInfo *RegInfo = static_cast<const X86RegisterInfo *>(
3355 DAG.getSubtarget().getRegisterInfo());
3356 if (RegInfo->needsStackRealignment(MF))
3359 // Also avoid sibcall optimization if either caller or callee uses struct
3360 // return semantics.
3361 if (isCalleeStructRet || isCallerStructRet)
3364 // An stdcall/thiscall caller is expected to clean up its arguments; the
3365 // callee isn't going to do that.
3366 // FIXME: this is more restrictive than needed. We could produce a tailcall
3367 // when the stack adjustment matches. For example, with a thiscall that takes
3368 // only one argument.
3369 if (!CCMatch && (CallerCC == CallingConv::X86_StdCall ||
3370 CallerCC == CallingConv::X86_ThisCall))
3373 // Do not sibcall optimize vararg calls unless all arguments are passed via
3375 if (isVarArg && !Outs.empty()) {
3377 // Optimizing for varargs on Win64 is unlikely to be safe without
3378 // additional testing.
3379 if (IsCalleeWin64 || IsCallerWin64)
3382 SmallVector<CCValAssign, 16> ArgLocs;
3383 CCState CCInfo(CalleeCC, isVarArg, DAG.getMachineFunction(), ArgLocs,
3386 CCInfo.AnalyzeCallOperands(Outs, CC_X86);
3387 for (unsigned i = 0, e = ArgLocs.size(); i != e; ++i)
3388 if (!ArgLocs[i].isRegLoc())
3392 // If the call result is in ST0 / ST1, it needs to be popped off the x87
3393 // stack. Therefore, if it's not used by the call it is not safe to optimize
3394 // this into a sibcall.
3395 bool Unused = false;
3396 for (unsigned i = 0, e = Ins.size(); i != e; ++i) {
3403 SmallVector<CCValAssign, 16> RVLocs;
3404 CCState CCInfo(CalleeCC, false, DAG.getMachineFunction(), RVLocs,
3406 CCInfo.AnalyzeCallResult(Ins, RetCC_X86);
3407 for (unsigned i = 0, e = RVLocs.size(); i != e; ++i) {
3408 CCValAssign &VA = RVLocs[i];
3409 if (VA.getLocReg() == X86::FP0 || VA.getLocReg() == X86::FP1)
3414 // If the calling conventions do not match, then we'd better make sure the
3415 // results are returned in the same way as what the caller expects.
3417 SmallVector<CCValAssign, 16> RVLocs1;
3418 CCState CCInfo1(CalleeCC, false, DAG.getMachineFunction(), RVLocs1,
3420 CCInfo1.AnalyzeCallResult(Ins, RetCC_X86);
3422 SmallVector<CCValAssign, 16> RVLocs2;
3423 CCState CCInfo2(CallerCC, false, DAG.getMachineFunction(), RVLocs2,
3425 CCInfo2.AnalyzeCallResult(Ins, RetCC_X86);
3427 if (RVLocs1.size() != RVLocs2.size())
3429 for (unsigned i = 0, e = RVLocs1.size(); i != e; ++i) {
3430 if (RVLocs1[i].isRegLoc() != RVLocs2[i].isRegLoc())
3432 if (RVLocs1[i].getLocInfo() != RVLocs2[i].getLocInfo())
3434 if (RVLocs1[i].isRegLoc()) {
3435 if (RVLocs1[i].getLocReg() != RVLocs2[i].getLocReg())
3438 if (RVLocs1[i].getLocMemOffset() != RVLocs2[i].getLocMemOffset())
3444 // If the callee takes no arguments then go on to check the results of the
3446 if (!Outs.empty()) {
3447 // Check if stack adjustment is needed. For now, do not do this if any
3448 // argument is passed on the stack.
3449 SmallVector<CCValAssign, 16> ArgLocs;
3450 CCState CCInfo(CalleeCC, isVarArg, DAG.getMachineFunction(), ArgLocs,
3453 // Allocate shadow area for Win64
3455 CCInfo.AllocateStack(32, 8);
3457 CCInfo.AnalyzeCallOperands(Outs, CC_X86);
3458 if (CCInfo.getNextStackOffset()) {
3459 MachineFunction &MF = DAG.getMachineFunction();
3460 if (MF.getInfo<X86MachineFunctionInfo>()->getBytesToPopOnReturn())
3463 // Check if the arguments are already laid out in the right way as
3464 // the caller's fixed stack objects.
3465 MachineFrameInfo *MFI = MF.getFrameInfo();
3466 const MachineRegisterInfo *MRI = &MF.getRegInfo();
3467 const X86InstrInfo *TII =
3468 static_cast<const X86InstrInfo *>(DAG.getSubtarget().getInstrInfo());
3469 for (unsigned i = 0, e = ArgLocs.size(); i != e; ++i) {
3470 CCValAssign &VA = ArgLocs[i];
3471 SDValue Arg = OutVals[i];
3472 ISD::ArgFlagsTy Flags = Outs[i].Flags;
3473 if (VA.getLocInfo() == CCValAssign::Indirect)
3475 if (!VA.isRegLoc()) {
3476 if (!MatchingStackOffset(Arg, VA.getLocMemOffset(), Flags,
3483 // If the tailcall address may be in a register, then make sure it's
3484 // possible to register allocate for it. In 32-bit, the call address can
3485 // only target EAX, EDX, or ECX since the tail call must be scheduled after
3486 // callee-saved registers are restored. These happen to be the same
3487 // registers used to pass 'inreg' arguments so watch out for those.
3488 if (!Subtarget->is64Bit() &&
3489 ((!isa<GlobalAddressSDNode>(Callee) &&
3490 !isa<ExternalSymbolSDNode>(Callee)) ||
3491 DAG.getTarget().getRelocationModel() == Reloc::PIC_)) {
3492 unsigned NumInRegs = 0;
3493 // In PIC we need an extra register to formulate the address computation
3495 unsigned MaxInRegs =
3496 (DAG.getTarget().getRelocationModel() == Reloc::PIC_) ? 2 : 3;
3498 for (unsigned i = 0, e = ArgLocs.size(); i != e; ++i) {
3499 CCValAssign &VA = ArgLocs[i];
3502 unsigned Reg = VA.getLocReg();
3505 case X86::EAX: case X86::EDX: case X86::ECX:
3506 if (++NumInRegs == MaxInRegs)
3518 X86TargetLowering::createFastISel(FunctionLoweringInfo &funcInfo,
3519 const TargetLibraryInfo *libInfo) const {
3520 return X86::createFastISel(funcInfo, libInfo);
3523 //===----------------------------------------------------------------------===//
3524 // Other Lowering Hooks
3525 //===----------------------------------------------------------------------===//
3527 static bool MayFoldLoad(SDValue Op) {
3528 return Op.hasOneUse() && ISD::isNormalLoad(Op.getNode());
3531 static bool MayFoldIntoStore(SDValue Op) {
3532 return Op.hasOneUse() && ISD::isNormalStore(*Op.getNode()->use_begin());
3535 static bool isTargetShuffle(unsigned Opcode) {
3537 default: return false;
3538 case X86ISD::PSHUFB:
3539 case X86ISD::PSHUFD:
3540 case X86ISD::PSHUFHW:
3541 case X86ISD::PSHUFLW:
3543 case X86ISD::PALIGNR:
3544 case X86ISD::MOVLHPS:
3545 case X86ISD::MOVLHPD:
3546 case X86ISD::MOVHLPS:
3547 case X86ISD::MOVLPS:
3548 case X86ISD::MOVLPD:
3549 case X86ISD::MOVSHDUP:
3550 case X86ISD::MOVSLDUP:
3551 case X86ISD::MOVDDUP:
3554 case X86ISD::UNPCKL:
3555 case X86ISD::UNPCKH:
3556 case X86ISD::VPERMILP:
3557 case X86ISD::VPERM2X128:
3558 case X86ISD::VPERMI:
3563 static SDValue getTargetShuffleNode(unsigned Opc, SDLoc dl, EVT VT,
3564 SDValue V1, SelectionDAG &DAG) {
3566 default: llvm_unreachable("Unknown x86 shuffle node");
3567 case X86ISD::MOVSHDUP:
3568 case X86ISD::MOVSLDUP:
3569 case X86ISD::MOVDDUP:
3570 return DAG.getNode(Opc, dl, VT, V1);
3574 static SDValue getTargetShuffleNode(unsigned Opc, SDLoc dl, EVT VT,
3575 SDValue V1, unsigned TargetMask,
3576 SelectionDAG &DAG) {
3578 default: llvm_unreachable("Unknown x86 shuffle node");
3579 case X86ISD::PSHUFD:
3580 case X86ISD::PSHUFHW:
3581 case X86ISD::PSHUFLW:
3582 case X86ISD::VPERMILP:
3583 case X86ISD::VPERMI:
3584 return DAG.getNode(Opc, dl, VT, V1, DAG.getConstant(TargetMask, MVT::i8));
3588 static SDValue getTargetShuffleNode(unsigned Opc, SDLoc dl, EVT VT,
3589 SDValue V1, SDValue V2, unsigned TargetMask,
3590 SelectionDAG &DAG) {
3592 default: llvm_unreachable("Unknown x86 shuffle node");
3593 case X86ISD::PALIGNR:
3594 case X86ISD::VALIGN:
3596 case X86ISD::VPERM2X128:
3597 return DAG.getNode(Opc, dl, VT, V1, V2,
3598 DAG.getConstant(TargetMask, MVT::i8));
3602 static SDValue getTargetShuffleNode(unsigned Opc, SDLoc dl, EVT VT,
3603 SDValue V1, SDValue V2, SelectionDAG &DAG) {
3605 default: llvm_unreachable("Unknown x86 shuffle node");
3606 case X86ISD::MOVLHPS:
3607 case X86ISD::MOVLHPD:
3608 case X86ISD::MOVHLPS:
3609 case X86ISD::MOVLPS:
3610 case X86ISD::MOVLPD:
3613 case X86ISD::UNPCKL:
3614 case X86ISD::UNPCKH:
3615 return DAG.getNode(Opc, dl, VT, V1, V2);
3619 SDValue X86TargetLowering::getReturnAddressFrameIndex(SelectionDAG &DAG) const {
3620 MachineFunction &MF = DAG.getMachineFunction();
3621 const X86RegisterInfo *RegInfo = static_cast<const X86RegisterInfo *>(
3622 DAG.getSubtarget().getRegisterInfo());
3623 X86MachineFunctionInfo *FuncInfo = MF.getInfo<X86MachineFunctionInfo>();
3624 int ReturnAddrIndex = FuncInfo->getRAIndex();
3626 if (ReturnAddrIndex == 0) {
3627 // Set up a frame object for the return address.
3628 unsigned SlotSize = RegInfo->getSlotSize();
3629 ReturnAddrIndex = MF.getFrameInfo()->CreateFixedObject(SlotSize,
3632 FuncInfo->setRAIndex(ReturnAddrIndex);
3635 return DAG.getFrameIndex(ReturnAddrIndex, getPointerTy());
3638 bool X86::isOffsetSuitableForCodeModel(int64_t Offset, CodeModel::Model M,
3639 bool hasSymbolicDisplacement) {
3640 // Offset should fit into 32 bit immediate field.
3641 if (!isInt<32>(Offset))
3644 // If we don't have a symbolic displacement - we don't have any extra
3646 if (!hasSymbolicDisplacement)
3649 // FIXME: Some tweaks might be needed for medium code model.
3650 if (M != CodeModel::Small && M != CodeModel::Kernel)
3653 // For small code model we assume that latest object is 16MB before end of 31
3654 // bits boundary. We may also accept pretty large negative constants knowing
3655 // that all objects are in the positive half of address space.
3656 if (M == CodeModel::Small && Offset < 16*1024*1024)
3659 // For kernel code model we know that all object resist in the negative half
3660 // of 32bits address space. We may not accept negative offsets, since they may
3661 // be just off and we may accept pretty large positive ones.
3662 if (M == CodeModel::Kernel && Offset > 0)
3668 /// isCalleePop - Determines whether the callee is required to pop its
3669 /// own arguments. Callee pop is necessary to support tail calls.
3670 bool X86::isCalleePop(CallingConv::ID CallingConv,
3671 bool is64Bit, bool IsVarArg, bool TailCallOpt) {
3672 switch (CallingConv) {
3675 case CallingConv::X86_StdCall:
3676 case CallingConv::X86_FastCall:
3677 case CallingConv::X86_ThisCall:
3679 case CallingConv::Fast:
3680 case CallingConv::GHC:
3681 case CallingConv::HiPE:
3688 /// \brief Return true if the condition is an unsigned comparison operation.
3689 static bool isX86CCUnsigned(unsigned X86CC) {
3691 default: llvm_unreachable("Invalid integer condition!");
3692 case X86::COND_E: return true;
3693 case X86::COND_G: return false;
3694 case X86::COND_GE: return false;
3695 case X86::COND_L: return false;
3696 case X86::COND_LE: return false;
3697 case X86::COND_NE: return true;
3698 case X86::COND_B: return true;
3699 case X86::COND_A: return true;
3700 case X86::COND_BE: return true;
3701 case X86::COND_AE: return true;
3703 llvm_unreachable("covered switch fell through?!");
3706 /// TranslateX86CC - do a one to one translation of a ISD::CondCode to the X86
3707 /// specific condition code, returning the condition code and the LHS/RHS of the
3708 /// comparison to make.
3709 static unsigned TranslateX86CC(ISD::CondCode SetCCOpcode, bool isFP,
3710 SDValue &LHS, SDValue &RHS, SelectionDAG &DAG) {
3712 if (ConstantSDNode *RHSC = dyn_cast<ConstantSDNode>(RHS)) {
3713 if (SetCCOpcode == ISD::SETGT && RHSC->isAllOnesValue()) {
3714 // X > -1 -> X == 0, jump !sign.
3715 RHS = DAG.getConstant(0, RHS.getValueType());
3716 return X86::COND_NS;
3718 if (SetCCOpcode == ISD::SETLT && RHSC->isNullValue()) {
3719 // X < 0 -> X == 0, jump on sign.
3722 if (SetCCOpcode == ISD::SETLT && RHSC->getZExtValue() == 1) {
3724 RHS = DAG.getConstant(0, RHS.getValueType());
3725 return X86::COND_LE;
3729 switch (SetCCOpcode) {
3730 default: llvm_unreachable("Invalid integer condition!");
3731 case ISD::SETEQ: return X86::COND_E;
3732 case ISD::SETGT: return X86::COND_G;
3733 case ISD::SETGE: return X86::COND_GE;
3734 case ISD::SETLT: return X86::COND_L;
3735 case ISD::SETLE: return X86::COND_LE;
3736 case ISD::SETNE: return X86::COND_NE;
3737 case ISD::SETULT: return X86::COND_B;
3738 case ISD::SETUGT: return X86::COND_A;
3739 case ISD::SETULE: return X86::COND_BE;
3740 case ISD::SETUGE: return X86::COND_AE;
3744 // First determine if it is required or is profitable to flip the operands.
3746 // If LHS is a foldable load, but RHS is not, flip the condition.
3747 if (ISD::isNON_EXTLoad(LHS.getNode()) &&
3748 !ISD::isNON_EXTLoad(RHS.getNode())) {
3749 SetCCOpcode = getSetCCSwappedOperands(SetCCOpcode);
3750 std::swap(LHS, RHS);
3753 switch (SetCCOpcode) {
3759 std::swap(LHS, RHS);
3763 // On a floating point condition, the flags are set as follows:
3765 // 0 | 0 | 0 | X > Y
3766 // 0 | 0 | 1 | X < Y
3767 // 1 | 0 | 0 | X == Y
3768 // 1 | 1 | 1 | unordered
3769 switch (SetCCOpcode) {
3770 default: llvm_unreachable("Condcode should be pre-legalized away");
3772 case ISD::SETEQ: return X86::COND_E;
3773 case ISD::SETOLT: // flipped
3775 case ISD::SETGT: return X86::COND_A;
3776 case ISD::SETOLE: // flipped
3778 case ISD::SETGE: return X86::COND_AE;
3779 case ISD::SETUGT: // flipped
3781 case ISD::SETLT: return X86::COND_B;
3782 case ISD::SETUGE: // flipped
3784 case ISD::SETLE: return X86::COND_BE;
3786 case ISD::SETNE: return X86::COND_NE;
3787 case ISD::SETUO: return X86::COND_P;
3788 case ISD::SETO: return X86::COND_NP;
3790 case ISD::SETUNE: return X86::COND_INVALID;
3794 /// hasFPCMov - is there a floating point cmov for the specific X86 condition
3795 /// code. Current x86 isa includes the following FP cmov instructions:
3796 /// fcmovb, fcomvbe, fcomve, fcmovu, fcmovae, fcmova, fcmovne, fcmovnu.
3797 static bool hasFPCMov(unsigned X86CC) {
3813 /// isFPImmLegal - Returns true if the target can instruction select the
3814 /// specified FP immediate natively. If false, the legalizer will
3815 /// materialize the FP immediate as a load from a constant pool.
3816 bool X86TargetLowering::isFPImmLegal(const APFloat &Imm, EVT VT) const {
3817 for (unsigned i = 0, e = LegalFPImmediates.size(); i != e; ++i) {
3818 if (Imm.bitwiseIsEqual(LegalFPImmediates[i]))
3824 /// \brief Returns true if it is beneficial to convert a load of a constant
3825 /// to just the constant itself.
3826 bool X86TargetLowering::shouldConvertConstantLoadToIntImm(const APInt &Imm,
3828 assert(Ty->isIntegerTy());
3830 unsigned BitSize = Ty->getPrimitiveSizeInBits();
3831 if (BitSize == 0 || BitSize > 64)
3836 /// isUndefOrInRange - Return true if Val is undef or if its value falls within
3837 /// the specified range (L, H].
3838 static bool isUndefOrInRange(int Val, int Low, int Hi) {
3839 return (Val < 0) || (Val >= Low && Val < Hi);
3842 /// isUndefOrEqual - Val is either less than zero (undef) or equal to the
3843 /// specified value.
3844 static bool isUndefOrEqual(int Val, int CmpVal) {
3845 return (Val < 0 || Val == CmpVal);
3848 /// isSequentialOrUndefInRange - Return true if every element in Mask, beginning
3849 /// from position Pos and ending in Pos+Size, falls within the specified
3850 /// sequential range (L, L+Pos]. or is undef.
3851 static bool isSequentialOrUndefInRange(ArrayRef<int> Mask,
3852 unsigned Pos, unsigned Size, int Low) {
3853 for (unsigned i = Pos, e = Pos+Size; i != e; ++i, ++Low)
3854 if (!isUndefOrEqual(Mask[i], Low))
3859 /// isPSHUFDMask - Return true if the node specifies a shuffle of elements that
3860 /// is suitable for input to PSHUFD or PSHUFW. That is, it doesn't reference
3861 /// the second operand.
3862 static bool isPSHUFDMask(ArrayRef<int> Mask, MVT VT) {
3863 if (VT == MVT::v4f32 || VT == MVT::v4i32 )
3864 return (Mask[0] < 4 && Mask[1] < 4 && Mask[2] < 4 && Mask[3] < 4);
3865 if (VT == MVT::v2f64 || VT == MVT::v2i64)
3866 return (Mask[0] < 2 && Mask[1] < 2);
3870 /// isPSHUFHWMask - Return true if the node specifies a shuffle of elements that
3871 /// is suitable for input to PSHUFHW.
3872 static bool isPSHUFHWMask(ArrayRef<int> Mask, MVT VT, bool HasInt256) {
3873 if (VT != MVT::v8i16 && (!HasInt256 || VT != MVT::v16i16))
3876 // Lower quadword copied in order or undef.
3877 if (!isSequentialOrUndefInRange(Mask, 0, 4, 0))
3880 // Upper quadword shuffled.
3881 for (unsigned i = 4; i != 8; ++i)
3882 if (!isUndefOrInRange(Mask[i], 4, 8))
3885 if (VT == MVT::v16i16) {
3886 // Lower quadword copied in order or undef.
3887 if (!isSequentialOrUndefInRange(Mask, 8, 4, 8))
3890 // Upper quadword shuffled.
3891 for (unsigned i = 12; i != 16; ++i)
3892 if (!isUndefOrInRange(Mask[i], 12, 16))
3899 /// isPSHUFLWMask - Return true if the node specifies a shuffle of elements that
3900 /// is suitable for input to PSHUFLW.
3901 static bool isPSHUFLWMask(ArrayRef<int> Mask, MVT VT, bool HasInt256) {
3902 if (VT != MVT::v8i16 && (!HasInt256 || VT != MVT::v16i16))
3905 // Upper quadword copied in order.
3906 if (!isSequentialOrUndefInRange(Mask, 4, 4, 4))
3909 // Lower quadword shuffled.
3910 for (unsigned i = 0; i != 4; ++i)
3911 if (!isUndefOrInRange(Mask[i], 0, 4))
3914 if (VT == MVT::v16i16) {
3915 // Upper quadword copied in order.
3916 if (!isSequentialOrUndefInRange(Mask, 12, 4, 12))
3919 // Lower quadword shuffled.
3920 for (unsigned i = 8; i != 12; ++i)
3921 if (!isUndefOrInRange(Mask[i], 8, 12))
3928 /// \brief Return true if the mask specifies a shuffle of elements that is
3929 /// suitable for input to intralane (palignr) or interlane (valign) vector
3931 static bool isAlignrMask(ArrayRef<int> Mask, MVT VT, bool InterLane) {
3932 unsigned NumElts = VT.getVectorNumElements();
3933 unsigned NumLanes = InterLane ? 1: VT.getSizeInBits()/128;
3934 unsigned NumLaneElts = NumElts/NumLanes;
3936 // Do not handle 64-bit element shuffles with palignr.
3937 if (NumLaneElts == 2)
3940 for (unsigned l = 0; l != NumElts; l+=NumLaneElts) {
3942 for (i = 0; i != NumLaneElts; ++i) {
3947 // Lane is all undef, go to next lane
3948 if (i == NumLaneElts)
3951 int Start = Mask[i+l];
3953 // Make sure its in this lane in one of the sources
3954 if (!isUndefOrInRange(Start, l, l+NumLaneElts) &&
3955 !isUndefOrInRange(Start, l+NumElts, l+NumElts+NumLaneElts))
3958 // If not lane 0, then we must match lane 0
3959 if (l != 0 && Mask[i] >= 0 && !isUndefOrEqual(Start, Mask[i]+l))
3962 // Correct second source to be contiguous with first source
3963 if (Start >= (int)NumElts)
3964 Start -= NumElts - NumLaneElts;
3966 // Make sure we're shifting in the right direction.
3967 if (Start <= (int)(i+l))
3972 // Check the rest of the elements to see if they are consecutive.
3973 for (++i; i != NumLaneElts; ++i) {
3974 int Idx = Mask[i+l];
3976 // Make sure its in this lane
3977 if (!isUndefOrInRange(Idx, l, l+NumLaneElts) &&
3978 !isUndefOrInRange(Idx, l+NumElts, l+NumElts+NumLaneElts))
3981 // If not lane 0, then we must match lane 0
3982 if (l != 0 && Mask[i] >= 0 && !isUndefOrEqual(Idx, Mask[i]+l))
3985 if (Idx >= (int)NumElts)
3986 Idx -= NumElts - NumLaneElts;
3988 if (!isUndefOrEqual(Idx, Start+i))
3997 /// \brief Return true if the node specifies a shuffle of elements that is
3998 /// suitable for input to PALIGNR.
3999 static bool isPALIGNRMask(ArrayRef<int> Mask, MVT VT,
4000 const X86Subtarget *Subtarget) {
4001 if ((VT.is128BitVector() && !Subtarget->hasSSSE3()) ||
4002 (VT.is256BitVector() && !Subtarget->hasInt256()) ||
4003 VT.is512BitVector())
4004 // FIXME: Add AVX512BW.
4007 return isAlignrMask(Mask, VT, false);
4010 /// \brief Return true if the node specifies a shuffle of elements that is
4011 /// suitable for input to VALIGN.
4012 static bool isVALIGNMask(ArrayRef<int> Mask, MVT VT,
4013 const X86Subtarget *Subtarget) {
4014 // FIXME: Add AVX512VL.
4015 if (!VT.is512BitVector() || !Subtarget->hasAVX512())
4017 return isAlignrMask(Mask, VT, true);
4020 /// CommuteVectorShuffleMask - Change values in a shuffle permute mask assuming
4021 /// the two vector operands have swapped position.
4022 static void CommuteVectorShuffleMask(SmallVectorImpl<int> &Mask,
4023 unsigned NumElems) {
4024 for (unsigned i = 0; i != NumElems; ++i) {
4028 else if (idx < (int)NumElems)
4029 Mask[i] = idx + NumElems;
4031 Mask[i] = idx - NumElems;
4035 /// isSHUFPMask - Return true if the specified VECTOR_SHUFFLE operand
4036 /// specifies a shuffle of elements that is suitable for input to 128/256-bit
4037 /// SHUFPS and SHUFPD. If Commuted is true, then it checks for sources to be
4038 /// reverse of what x86 shuffles want.
4039 static bool isSHUFPMask(ArrayRef<int> Mask, MVT VT, bool Commuted = false) {
4041 unsigned NumElems = VT.getVectorNumElements();
4042 unsigned NumLanes = VT.getSizeInBits()/128;
4043 unsigned NumLaneElems = NumElems/NumLanes;
4045 if (NumLaneElems != 2 && NumLaneElems != 4)
4048 unsigned EltSize = VT.getVectorElementType().getSizeInBits();
4049 bool symetricMaskRequired =
4050 (VT.getSizeInBits() >= 256) && (EltSize == 32);
4052 // VSHUFPSY divides the resulting vector into 4 chunks.
4053 // The sources are also splitted into 4 chunks, and each destination
4054 // chunk must come from a different source chunk.
4056 // SRC1 => X7 X6 X5 X4 X3 X2 X1 X0
4057 // SRC2 => Y7 Y6 Y5 Y4 Y3 Y2 Y1 Y9
4059 // DST => Y7..Y4, Y7..Y4, X7..X4, X7..X4,
4060 // Y3..Y0, Y3..Y0, X3..X0, X3..X0
4062 // VSHUFPDY 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 => X3 X2 X1 X0
4067 // SRC2 => Y3 Y2 Y1 Y0
4069 // DST => Y3..Y2, X3..X2, Y1..Y0, X1..X0
4071 SmallVector<int, 4> MaskVal(NumLaneElems, -1);
4072 unsigned HalfLaneElems = NumLaneElems/2;
4073 for (unsigned l = 0; l != NumElems; l += NumLaneElems) {
4074 for (unsigned i = 0; i != NumLaneElems; ++i) {
4075 int Idx = Mask[i+l];
4076 unsigned RngStart = l + ((Commuted == (i<HalfLaneElems)) ? NumElems : 0);
4077 if (!isUndefOrInRange(Idx, RngStart, RngStart+NumLaneElems))
4079 // For VSHUFPSY, the mask of the second half must be the same as the
4080 // first but with the appropriate offsets. This works in the same way as
4081 // VPERMILPS works with masks.
4082 if (!symetricMaskRequired || Idx < 0)
4084 if (MaskVal[i] < 0) {
4085 MaskVal[i] = Idx - l;
4088 if ((signed)(Idx - l) != MaskVal[i])
4096 /// isMOVHLPSMask - Return true if the specified VECTOR_SHUFFLE operand
4097 /// specifies a shuffle of elements that is suitable for input to MOVHLPS.
4098 static bool isMOVHLPSMask(ArrayRef<int> Mask, MVT VT) {
4099 if (!VT.is128BitVector())
4102 unsigned NumElems = VT.getVectorNumElements();
4107 // Expect bit0 == 6, bit1 == 7, bit2 == 2, bit3 == 3
4108 return isUndefOrEqual(Mask[0], 6) &&
4109 isUndefOrEqual(Mask[1], 7) &&
4110 isUndefOrEqual(Mask[2], 2) &&
4111 isUndefOrEqual(Mask[3], 3);
4114 /// isMOVHLPS_v_undef_Mask - Special case of isMOVHLPSMask for canonical form
4115 /// of vector_shuffle v, v, <2, 3, 2, 3>, i.e. vector_shuffle v, undef,
4117 static bool isMOVHLPS_v_undef_Mask(ArrayRef<int> Mask, MVT VT) {
4118 if (!VT.is128BitVector())
4121 unsigned NumElems = VT.getVectorNumElements();
4126 return isUndefOrEqual(Mask[0], 2) &&
4127 isUndefOrEqual(Mask[1], 3) &&
4128 isUndefOrEqual(Mask[2], 2) &&
4129 isUndefOrEqual(Mask[3], 3);
4132 /// isMOVLPMask - Return true if the specified VECTOR_SHUFFLE operand
4133 /// specifies a shuffle of elements that is suitable for input to MOVLP{S|D}.
4134 static bool isMOVLPMask(ArrayRef<int> Mask, MVT VT) {
4135 if (!VT.is128BitVector())
4138 unsigned NumElems = VT.getVectorNumElements();
4140 if (NumElems != 2 && NumElems != 4)
4143 for (unsigned i = 0, e = NumElems/2; i != e; ++i)
4144 if (!isUndefOrEqual(Mask[i], i + NumElems))
4147 for (unsigned i = NumElems/2, e = NumElems; i != e; ++i)
4148 if (!isUndefOrEqual(Mask[i], i))
4154 /// isMOVLHPSMask - Return true if the specified VECTOR_SHUFFLE operand
4155 /// specifies a shuffle of elements that is suitable for input to MOVLHPS.
4156 static bool isMOVLHPSMask(ArrayRef<int> Mask, MVT VT) {
4157 if (!VT.is128BitVector())
4160 unsigned NumElems = VT.getVectorNumElements();
4162 if (NumElems != 2 && NumElems != 4)
4165 for (unsigned i = 0, e = NumElems/2; i != e; ++i)
4166 if (!isUndefOrEqual(Mask[i], i))
4169 for (unsigned i = 0, e = NumElems/2; i != e; ++i)
4170 if (!isUndefOrEqual(Mask[i + e], i + NumElems))
4176 /// isINSERTPSMask - Return true if the specified VECTOR_SHUFFLE operand
4177 /// specifies a shuffle of elements that is suitable for input to INSERTPS.
4178 /// i. e: If all but one element come from the same vector.
4179 static bool isINSERTPSMask(ArrayRef<int> Mask, MVT VT) {
4180 // TODO: Deal with AVX's VINSERTPS
4181 if (!VT.is128BitVector() || (VT != MVT::v4f32 && VT != MVT::v4i32))
4184 unsigned CorrectPosV1 = 0;
4185 unsigned CorrectPosV2 = 0;
4186 for (int i = 0, e = (int)VT.getVectorNumElements(); i != e; ++i) {
4187 if (Mask[i] == -1) {
4195 else if (Mask[i] == i + 4)
4199 if (CorrectPosV1 == 3 || CorrectPosV2 == 3)
4200 // We have 3 elements (undefs count as elements from any vector) from one
4201 // vector, and one from another.
4208 // Some special combinations that can be optimized.
4211 SDValue Compact8x32ShuffleNode(ShuffleVectorSDNode *SVOp,
4212 SelectionDAG &DAG) {
4213 MVT VT = SVOp->getSimpleValueType(0);
4216 if (VT != MVT::v8i32 && VT != MVT::v8f32)
4219 ArrayRef<int> Mask = SVOp->getMask();
4221 // These are the special masks that may be optimized.
4222 static const int MaskToOptimizeEven[] = {0, 8, 2, 10, 4, 12, 6, 14};
4223 static const int MaskToOptimizeOdd[] = {1, 9, 3, 11, 5, 13, 7, 15};
4224 bool MatchEvenMask = true;
4225 bool MatchOddMask = true;
4226 for (int i=0; i<8; ++i) {
4227 if (!isUndefOrEqual(Mask[i], MaskToOptimizeEven[i]))
4228 MatchEvenMask = false;
4229 if (!isUndefOrEqual(Mask[i], MaskToOptimizeOdd[i]))
4230 MatchOddMask = false;
4233 if (!MatchEvenMask && !MatchOddMask)
4236 SDValue UndefNode = DAG.getNode(ISD::UNDEF, dl, VT);
4238 SDValue Op0 = SVOp->getOperand(0);
4239 SDValue Op1 = SVOp->getOperand(1);
4241 if (MatchEvenMask) {
4242 // Shift the second operand right to 32 bits.
4243 static const int ShiftRightMask[] = {-1, 0, -1, 2, -1, 4, -1, 6 };
4244 Op1 = DAG.getVectorShuffle(VT, dl, Op1, UndefNode, ShiftRightMask);
4246 // Shift the first operand left to 32 bits.
4247 static const int ShiftLeftMask[] = {1, -1, 3, -1, 5, -1, 7, -1 };
4248 Op0 = DAG.getVectorShuffle(VT, dl, Op0, UndefNode, ShiftLeftMask);
4250 static const int BlendMask[] = {0, 9, 2, 11, 4, 13, 6, 15};
4251 return DAG.getVectorShuffle(VT, dl, Op0, Op1, BlendMask);
4254 /// isUNPCKLMask - Return true if the specified VECTOR_SHUFFLE operand
4255 /// specifies a shuffle of elements that is suitable for input to UNPCKL.
4256 static bool isUNPCKLMask(ArrayRef<int> Mask, MVT VT,
4257 bool HasInt256, bool V2IsSplat = false) {
4259 assert(VT.getSizeInBits() >= 128 &&
4260 "Unsupported vector type for unpckl");
4262 // AVX defines UNPCK* to operate independently on 128-bit lanes.
4264 unsigned NumOf256BitLanes;
4265 unsigned NumElts = VT.getVectorNumElements();
4266 if (VT.is256BitVector()) {
4267 if (NumElts != 4 && NumElts != 8 &&
4268 (!HasInt256 || (NumElts != 16 && NumElts != 32)))
4271 NumOf256BitLanes = 1;
4272 } else if (VT.is512BitVector()) {
4273 assert(VT.getScalarType().getSizeInBits() >= 32 &&
4274 "Unsupported vector type for unpckh");
4276 NumOf256BitLanes = 2;
4279 NumOf256BitLanes = 1;
4282 unsigned NumEltsInStride = NumElts/NumOf256BitLanes;
4283 unsigned NumLaneElts = NumEltsInStride/NumLanes;
4285 for (unsigned l256 = 0; l256 < NumOf256BitLanes; l256 += 1) {
4286 for (unsigned l = 0; l != NumEltsInStride; l += NumLaneElts) {
4287 for (unsigned i = 0, j = l; i != NumLaneElts; i += 2, ++j) {
4288 int BitI = Mask[l256*NumEltsInStride+l+i];
4289 int BitI1 = Mask[l256*NumEltsInStride+l+i+1];
4290 if (!isUndefOrEqual(BitI, j+l256*NumElts))
4292 if (V2IsSplat && !isUndefOrEqual(BitI1, NumElts))
4294 if (!isUndefOrEqual(BitI1, j+l256*NumElts+NumEltsInStride))
4302 /// isUNPCKHMask - Return true if the specified VECTOR_SHUFFLE operand
4303 /// specifies a shuffle of elements that is suitable for input to UNPCKH.
4304 static bool isUNPCKHMask(ArrayRef<int> Mask, MVT VT,
4305 bool HasInt256, bool V2IsSplat = false) {
4306 assert(VT.getSizeInBits() >= 128 &&
4307 "Unsupported vector type for unpckh");
4309 // AVX defines UNPCK* to operate independently on 128-bit lanes.
4311 unsigned NumOf256BitLanes;
4312 unsigned NumElts = VT.getVectorNumElements();
4313 if (VT.is256BitVector()) {
4314 if (NumElts != 4 && NumElts != 8 &&
4315 (!HasInt256 || (NumElts != 16 && NumElts != 32)))
4318 NumOf256BitLanes = 1;
4319 } else if (VT.is512BitVector()) {
4320 assert(VT.getScalarType().getSizeInBits() >= 32 &&
4321 "Unsupported vector type for unpckh");
4323 NumOf256BitLanes = 2;
4326 NumOf256BitLanes = 1;
4329 unsigned NumEltsInStride = NumElts/NumOf256BitLanes;
4330 unsigned NumLaneElts = NumEltsInStride/NumLanes;
4332 for (unsigned l256 = 0; l256 < NumOf256BitLanes; l256 += 1) {
4333 for (unsigned l = 0; l != NumEltsInStride; l += NumLaneElts) {
4334 for (unsigned i = 0, j = l+NumLaneElts/2; i != NumLaneElts; i += 2, ++j) {
4335 int BitI = Mask[l256*NumEltsInStride+l+i];
4336 int BitI1 = Mask[l256*NumEltsInStride+l+i+1];
4337 if (!isUndefOrEqual(BitI, j+l256*NumElts))
4339 if (V2IsSplat && !isUndefOrEqual(BitI1, NumElts))
4341 if (!isUndefOrEqual(BitI1, j+l256*NumElts+NumEltsInStride))
4349 /// isUNPCKL_v_undef_Mask - Special case of isUNPCKLMask for canonical form
4350 /// of vector_shuffle v, v, <0, 4, 1, 5>, i.e. vector_shuffle v, undef,
4352 static bool isUNPCKL_v_undef_Mask(ArrayRef<int> Mask, MVT VT, bool HasInt256) {
4353 unsigned NumElts = VT.getVectorNumElements();
4354 bool Is256BitVec = VT.is256BitVector();
4356 if (VT.is512BitVector())
4358 assert((VT.is128BitVector() || VT.is256BitVector()) &&
4359 "Unsupported vector type for unpckh");
4361 if (Is256BitVec && NumElts != 4 && NumElts != 8 &&
4362 (!HasInt256 || (NumElts != 16 && NumElts != 32)))
4365 // For 256-bit i64/f64, use MOVDDUPY instead, so reject the matching pattern
4366 // FIXME: Need a better way to get rid of this, there's no latency difference
4367 // between UNPCKLPD and MOVDDUP, the later should always be checked first and
4368 // the former later. We should also remove the "_undef" special mask.
4369 if (NumElts == 4 && Is256BitVec)
4372 // Handle 128 and 256-bit vector lengths. AVX defines UNPCK* to operate
4373 // independently on 128-bit lanes.
4374 unsigned NumLanes = VT.getSizeInBits()/128;
4375 unsigned NumLaneElts = NumElts/NumLanes;
4377 for (unsigned l = 0; l != NumElts; l += NumLaneElts) {
4378 for (unsigned i = 0, j = l; i != NumLaneElts; i += 2, ++j) {
4379 int BitI = Mask[l+i];
4380 int BitI1 = Mask[l+i+1];
4382 if (!isUndefOrEqual(BitI, j))
4384 if (!isUndefOrEqual(BitI1, j))
4392 /// isUNPCKH_v_undef_Mask - Special case of isUNPCKHMask for canonical form
4393 /// of vector_shuffle v, v, <2, 6, 3, 7>, i.e. vector_shuffle v, undef,
4395 static bool isUNPCKH_v_undef_Mask(ArrayRef<int> Mask, MVT VT, bool HasInt256) {
4396 unsigned NumElts = VT.getVectorNumElements();
4398 if (VT.is512BitVector())
4401 assert((VT.is128BitVector() || VT.is256BitVector()) &&
4402 "Unsupported vector type for unpckh");
4404 if (VT.is256BitVector() && NumElts != 4 && NumElts != 8 &&
4405 (!HasInt256 || (NumElts != 16 && NumElts != 32)))
4408 // Handle 128 and 256-bit vector lengths. AVX defines UNPCK* to operate
4409 // independently on 128-bit lanes.
4410 unsigned NumLanes = VT.getSizeInBits()/128;
4411 unsigned NumLaneElts = NumElts/NumLanes;
4413 for (unsigned l = 0; l != NumElts; l += NumLaneElts) {
4414 for (unsigned i = 0, j = l+NumLaneElts/2; i != NumLaneElts; i += 2, ++j) {
4415 int BitI = Mask[l+i];
4416 int BitI1 = Mask[l+i+1];
4417 if (!isUndefOrEqual(BitI, j))
4419 if (!isUndefOrEqual(BitI1, j))
4426 // Match for INSERTI64x4 INSERTF64x4 instructions (src0[0], src1[0]) or
4427 // (src1[0], src0[1]), manipulation with 256-bit sub-vectors
4428 static bool isINSERT64x4Mask(ArrayRef<int> Mask, MVT VT, unsigned int *Imm) {
4429 if (!VT.is512BitVector())
4432 unsigned NumElts = VT.getVectorNumElements();
4433 unsigned HalfSize = NumElts/2;
4434 if (isSequentialOrUndefInRange(Mask, 0, HalfSize, 0)) {
4435 if (isSequentialOrUndefInRange(Mask, HalfSize, HalfSize, NumElts)) {
4440 if (isSequentialOrUndefInRange(Mask, 0, HalfSize, NumElts)) {
4441 if (isSequentialOrUndefInRange(Mask, HalfSize, HalfSize, HalfSize)) {
4449 /// isMOVLMask - Return true if the specified VECTOR_SHUFFLE operand
4450 /// specifies a shuffle of elements that is suitable for input to MOVSS,
4451 /// MOVSD, and MOVD, i.e. setting the lowest element.
4452 static bool isMOVLMask(ArrayRef<int> Mask, EVT VT) {
4453 if (VT.getVectorElementType().getSizeInBits() < 32)
4455 if (!VT.is128BitVector())
4458 unsigned NumElts = VT.getVectorNumElements();
4460 if (!isUndefOrEqual(Mask[0], NumElts))
4463 for (unsigned i = 1; i != NumElts; ++i)
4464 if (!isUndefOrEqual(Mask[i], i))
4470 /// isVPERM2X128Mask - Match 256-bit shuffles where the elements are considered
4471 /// as permutations between 128-bit chunks or halves. As an example: this
4473 /// vector_shuffle <4, 5, 6, 7, 12, 13, 14, 15>
4474 /// The first half comes from the second half of V1 and the second half from the
4475 /// the second half of V2.
4476 static bool isVPERM2X128Mask(ArrayRef<int> Mask, MVT VT, bool HasFp256) {
4477 if (!HasFp256 || !VT.is256BitVector())
4480 // The shuffle result is divided into half A and half B. In total the two
4481 // sources have 4 halves, namely: C, D, E, F. The final values of A and
4482 // B must come from C, D, E or F.
4483 unsigned HalfSize = VT.getVectorNumElements()/2;
4484 bool MatchA = false, MatchB = false;
4486 // Check if A comes from one of C, D, E, F.
4487 for (unsigned Half = 0; Half != 4; ++Half) {
4488 if (isSequentialOrUndefInRange(Mask, 0, HalfSize, Half*HalfSize)) {
4494 // Check if B comes from one of C, D, E, F.
4495 for (unsigned Half = 0; Half != 4; ++Half) {
4496 if (isSequentialOrUndefInRange(Mask, HalfSize, HalfSize, Half*HalfSize)) {
4502 return MatchA && MatchB;
4505 /// getShuffleVPERM2X128Immediate - Return the appropriate immediate to shuffle
4506 /// the specified VECTOR_MASK mask with VPERM2F128/VPERM2I128 instructions.
4507 static unsigned getShuffleVPERM2X128Immediate(ShuffleVectorSDNode *SVOp) {
4508 MVT VT = SVOp->getSimpleValueType(0);
4510 unsigned HalfSize = VT.getVectorNumElements()/2;
4512 unsigned FstHalf = 0, SndHalf = 0;
4513 for (unsigned i = 0; i < HalfSize; ++i) {
4514 if (SVOp->getMaskElt(i) > 0) {
4515 FstHalf = SVOp->getMaskElt(i)/HalfSize;
4519 for (unsigned i = HalfSize; i < HalfSize*2; ++i) {
4520 if (SVOp->getMaskElt(i) > 0) {
4521 SndHalf = SVOp->getMaskElt(i)/HalfSize;
4526 return (FstHalf | (SndHalf << 4));
4529 // Symetric in-lane mask. Each lane has 4 elements (for imm8)
4530 static bool isPermImmMask(ArrayRef<int> Mask, MVT VT, unsigned& Imm8) {
4531 unsigned EltSize = VT.getVectorElementType().getSizeInBits();
4535 unsigned NumElts = VT.getVectorNumElements();
4537 if (VT.is128BitVector() || (VT.is256BitVector() && EltSize == 64)) {
4538 for (unsigned i = 0; i != NumElts; ++i) {
4541 Imm8 |= Mask[i] << (i*2);
4546 unsigned LaneSize = 4;
4547 SmallVector<int, 4> MaskVal(LaneSize, -1);
4549 for (unsigned l = 0; l != NumElts; l += LaneSize) {
4550 for (unsigned i = 0; i != LaneSize; ++i) {
4551 if (!isUndefOrInRange(Mask[i+l], l, l+LaneSize))
4555 if (MaskVal[i] < 0) {
4556 MaskVal[i] = Mask[i+l] - l;
4557 Imm8 |= MaskVal[i] << (i*2);
4560 if (Mask[i+l] != (signed)(MaskVal[i]+l))
4567 /// isVPERMILPMask - Return true if the specified VECTOR_SHUFFLE operand
4568 /// specifies a shuffle of elements that is suitable for input to VPERMILPD*.
4569 /// Note that VPERMIL mask matching is different depending whether theunderlying
4570 /// type is 32 or 64. In the VPERMILPS the high half of the mask should point
4571 /// to the same elements of the low, but to the higher half of the source.
4572 /// In VPERMILPD the two lanes could be shuffled independently of each other
4573 /// with the same restriction that lanes can't be crossed. Also handles PSHUFDY.
4574 static bool isVPERMILPMask(ArrayRef<int> Mask, MVT VT) {
4575 unsigned EltSize = VT.getVectorElementType().getSizeInBits();
4576 if (VT.getSizeInBits() < 256 || EltSize < 32)
4578 bool symetricMaskRequired = (EltSize == 32);
4579 unsigned NumElts = VT.getVectorNumElements();
4581 unsigned NumLanes = VT.getSizeInBits()/128;
4582 unsigned LaneSize = NumElts/NumLanes;
4583 // 2 or 4 elements in one lane
4585 SmallVector<int, 4> ExpectedMaskVal(LaneSize, -1);
4586 for (unsigned l = 0; l != NumElts; l += LaneSize) {
4587 for (unsigned i = 0; i != LaneSize; ++i) {
4588 if (!isUndefOrInRange(Mask[i+l], l, l+LaneSize))
4590 if (symetricMaskRequired) {
4591 if (ExpectedMaskVal[i] < 0 && Mask[i+l] >= 0) {
4592 ExpectedMaskVal[i] = Mask[i+l] - l;
4595 if (!isUndefOrEqual(Mask[i+l], ExpectedMaskVal[i]+l))
4603 /// isCommutedMOVLMask - Returns true if the shuffle mask is except the reverse
4604 /// of what x86 movss want. X86 movs requires the lowest element to be lowest
4605 /// element of vector 2 and the other elements to come from vector 1 in order.
4606 static bool isCommutedMOVLMask(ArrayRef<int> Mask, MVT VT,
4607 bool V2IsSplat = false, bool V2IsUndef = false) {
4608 if (!VT.is128BitVector())
4611 unsigned NumOps = VT.getVectorNumElements();
4612 if (NumOps != 2 && NumOps != 4 && NumOps != 8 && NumOps != 16)
4615 if (!isUndefOrEqual(Mask[0], 0))
4618 for (unsigned i = 1; i != NumOps; ++i)
4619 if (!(isUndefOrEqual(Mask[i], i+NumOps) ||
4620 (V2IsUndef && isUndefOrInRange(Mask[i], NumOps, NumOps*2)) ||
4621 (V2IsSplat && isUndefOrEqual(Mask[i], NumOps))))
4627 /// isMOVSHDUPMask - Return true if the specified VECTOR_SHUFFLE operand
4628 /// specifies a shuffle of elements that is suitable for input to MOVSHDUP.
4629 /// Masks to match: <1, 1, 3, 3> or <1, 1, 3, 3, 5, 5, 7, 7>
4630 static bool isMOVSHDUPMask(ArrayRef<int> Mask, MVT VT,
4631 const X86Subtarget *Subtarget) {
4632 if (!Subtarget->hasSSE3())
4635 unsigned NumElems = VT.getVectorNumElements();
4637 if ((VT.is128BitVector() && NumElems != 4) ||
4638 (VT.is256BitVector() && NumElems != 8) ||
4639 (VT.is512BitVector() && NumElems != 16))
4642 // "i+1" is the value the indexed mask element must have
4643 for (unsigned i = 0; i != NumElems; i += 2)
4644 if (!isUndefOrEqual(Mask[i], i+1) ||
4645 !isUndefOrEqual(Mask[i+1], i+1))
4651 /// isMOVSLDUPMask - Return true if the specified VECTOR_SHUFFLE operand
4652 /// specifies a shuffle of elements that is suitable for input to MOVSLDUP.
4653 /// Masks to match: <0, 0, 2, 2> or <0, 0, 2, 2, 4, 4, 6, 6>
4654 static bool isMOVSLDUPMask(ArrayRef<int> Mask, MVT VT,
4655 const X86Subtarget *Subtarget) {
4656 if (!Subtarget->hasSSE3())
4659 unsigned NumElems = VT.getVectorNumElements();
4661 if ((VT.is128BitVector() && NumElems != 4) ||
4662 (VT.is256BitVector() && NumElems != 8) ||
4663 (VT.is512BitVector() && NumElems != 16))
4666 // "i" is the value the indexed mask element must have
4667 for (unsigned i = 0; i != NumElems; i += 2)
4668 if (!isUndefOrEqual(Mask[i], i) ||
4669 !isUndefOrEqual(Mask[i+1], i))
4675 /// isMOVDDUPYMask - Return true if the specified VECTOR_SHUFFLE operand
4676 /// specifies a shuffle of elements that is suitable for input to 256-bit
4677 /// version of MOVDDUP.
4678 static bool isMOVDDUPYMask(ArrayRef<int> Mask, MVT VT, bool HasFp256) {
4679 if (!HasFp256 || !VT.is256BitVector())
4682 unsigned NumElts = VT.getVectorNumElements();
4686 for (unsigned i = 0; i != NumElts/2; ++i)
4687 if (!isUndefOrEqual(Mask[i], 0))
4689 for (unsigned i = NumElts/2; i != NumElts; ++i)
4690 if (!isUndefOrEqual(Mask[i], NumElts/2))
4695 /// isMOVDDUPMask - Return true if the specified VECTOR_SHUFFLE operand
4696 /// specifies a shuffle of elements that is suitable for input to 128-bit
4697 /// version of MOVDDUP.
4698 static bool isMOVDDUPMask(ArrayRef<int> Mask, MVT VT) {
4699 if (!VT.is128BitVector())
4702 unsigned e = VT.getVectorNumElements() / 2;
4703 for (unsigned i = 0; i != e; ++i)
4704 if (!isUndefOrEqual(Mask[i], i))
4706 for (unsigned i = 0; i != e; ++i)
4707 if (!isUndefOrEqual(Mask[e+i], i))
4712 /// isVEXTRACTIndex - Return true if the specified
4713 /// EXTRACT_SUBVECTOR operand specifies a vector extract that is
4714 /// suitable for instruction that extract 128 or 256 bit vectors
4715 static bool isVEXTRACTIndex(SDNode *N, unsigned vecWidth) {
4716 assert((vecWidth == 128 || vecWidth == 256) && "Unexpected vector width");
4717 if (!isa<ConstantSDNode>(N->getOperand(1).getNode()))
4720 // The index should be aligned on a vecWidth-bit boundary.
4722 cast<ConstantSDNode>(N->getOperand(1).getNode())->getZExtValue();
4724 MVT VT = N->getSimpleValueType(0);
4725 unsigned ElSize = VT.getVectorElementType().getSizeInBits();
4726 bool Result = (Index * ElSize) % vecWidth == 0;
4731 /// isVINSERTIndex - Return true if the specified INSERT_SUBVECTOR
4732 /// operand specifies a subvector insert that is suitable for input to
4733 /// insertion of 128 or 256-bit subvectors
4734 static bool isVINSERTIndex(SDNode *N, unsigned vecWidth) {
4735 assert((vecWidth == 128 || vecWidth == 256) && "Unexpected vector width");
4736 if (!isa<ConstantSDNode>(N->getOperand(2).getNode()))
4738 // The index should be aligned on a vecWidth-bit boundary.
4740 cast<ConstantSDNode>(N->getOperand(2).getNode())->getZExtValue();
4742 MVT VT = N->getSimpleValueType(0);
4743 unsigned ElSize = VT.getVectorElementType().getSizeInBits();
4744 bool Result = (Index * ElSize) % vecWidth == 0;
4749 bool X86::isVINSERT128Index(SDNode *N) {
4750 return isVINSERTIndex(N, 128);
4753 bool X86::isVINSERT256Index(SDNode *N) {
4754 return isVINSERTIndex(N, 256);
4757 bool X86::isVEXTRACT128Index(SDNode *N) {
4758 return isVEXTRACTIndex(N, 128);
4761 bool X86::isVEXTRACT256Index(SDNode *N) {
4762 return isVEXTRACTIndex(N, 256);
4765 /// getShuffleSHUFImmediate - Return the appropriate immediate to shuffle
4766 /// the specified VECTOR_SHUFFLE mask with PSHUF* and SHUFP* instructions.
4767 /// Handles 128-bit and 256-bit.
4768 static unsigned getShuffleSHUFImmediate(ShuffleVectorSDNode *N) {
4769 MVT VT = N->getSimpleValueType(0);
4771 assert((VT.getSizeInBits() >= 128) &&
4772 "Unsupported vector type for PSHUF/SHUFP");
4774 // Handle 128 and 256-bit vector lengths. AVX defines PSHUF/SHUFP to operate
4775 // independently on 128-bit lanes.
4776 unsigned NumElts = VT.getVectorNumElements();
4777 unsigned NumLanes = VT.getSizeInBits()/128;
4778 unsigned NumLaneElts = NumElts/NumLanes;
4780 assert((NumLaneElts == 2 || NumLaneElts == 4 || NumLaneElts == 8) &&
4781 "Only supports 2, 4 or 8 elements per lane");
4783 unsigned Shift = (NumLaneElts >= 4) ? 1 : 0;
4785 for (unsigned i = 0; i != NumElts; ++i) {
4786 int Elt = N->getMaskElt(i);
4787 if (Elt < 0) continue;
4788 Elt &= NumLaneElts - 1;
4789 unsigned ShAmt = (i << Shift) % 8;
4790 Mask |= Elt << ShAmt;
4796 /// getShufflePSHUFHWImmediate - Return the appropriate immediate to shuffle
4797 /// the specified VECTOR_SHUFFLE mask with the PSHUFHW instruction.
4798 static unsigned getShufflePSHUFHWImmediate(ShuffleVectorSDNode *N) {
4799 MVT VT = N->getSimpleValueType(0);
4801 assert((VT == MVT::v8i16 || VT == MVT::v16i16) &&
4802 "Unsupported vector type for PSHUFHW");
4804 unsigned NumElts = VT.getVectorNumElements();
4807 for (unsigned l = 0; l != NumElts; l += 8) {
4808 // 8 nodes per lane, but we only care about the last 4.
4809 for (unsigned i = 0; i < 4; ++i) {
4810 int Elt = N->getMaskElt(l+i+4);
4811 if (Elt < 0) continue;
4812 Elt &= 0x3; // only 2-bits.
4813 Mask |= Elt << (i * 2);
4820 /// getShufflePSHUFLWImmediate - Return the appropriate immediate to shuffle
4821 /// the specified VECTOR_SHUFFLE mask with the PSHUFLW instruction.
4822 static unsigned getShufflePSHUFLWImmediate(ShuffleVectorSDNode *N) {
4823 MVT VT = N->getSimpleValueType(0);
4825 assert((VT == MVT::v8i16 || VT == MVT::v16i16) &&
4826 "Unsupported vector type for PSHUFHW");
4828 unsigned NumElts = VT.getVectorNumElements();
4831 for (unsigned l = 0; l != NumElts; l += 8) {
4832 // 8 nodes per lane, but we only care about the first 4.
4833 for (unsigned i = 0; i < 4; ++i) {
4834 int Elt = N->getMaskElt(l+i);
4835 if (Elt < 0) continue;
4836 Elt &= 0x3; // only 2-bits
4837 Mask |= Elt << (i * 2);
4844 /// \brief Return the appropriate immediate to shuffle the specified
4845 /// VECTOR_SHUFFLE mask with the PALIGNR (if InterLane is false) or with
4846 /// VALIGN (if Interlane is true) instructions.
4847 static unsigned getShuffleAlignrImmediate(ShuffleVectorSDNode *SVOp,
4849 MVT VT = SVOp->getSimpleValueType(0);
4850 unsigned EltSize = InterLane ? 1 :
4851 VT.getVectorElementType().getSizeInBits() >> 3;
4853 unsigned NumElts = VT.getVectorNumElements();
4854 unsigned NumLanes = VT.is512BitVector() ? 1 : VT.getSizeInBits()/128;
4855 unsigned NumLaneElts = NumElts/NumLanes;
4859 for (i = 0; i != NumElts; ++i) {
4860 Val = SVOp->getMaskElt(i);
4864 if (Val >= (int)NumElts)
4865 Val -= NumElts - NumLaneElts;
4867 assert(Val - i > 0 && "PALIGNR imm should be positive");
4868 return (Val - i) * EltSize;
4871 /// \brief Return the appropriate immediate to shuffle the specified
4872 /// VECTOR_SHUFFLE mask with the PALIGNR instruction.
4873 static unsigned getShufflePALIGNRImmediate(ShuffleVectorSDNode *SVOp) {
4874 return getShuffleAlignrImmediate(SVOp, false);
4877 /// \brief Return the appropriate immediate to shuffle the specified
4878 /// VECTOR_SHUFFLE mask with the VALIGN instruction.
4879 static unsigned getShuffleVALIGNImmediate(ShuffleVectorSDNode *SVOp) {
4880 return getShuffleAlignrImmediate(SVOp, true);
4884 static unsigned getExtractVEXTRACTImmediate(SDNode *N, unsigned vecWidth) {
4885 assert((vecWidth == 128 || vecWidth == 256) && "Unsupported vector width");
4886 if (!isa<ConstantSDNode>(N->getOperand(1).getNode()))
4887 llvm_unreachable("Illegal extract subvector for VEXTRACT");
4890 cast<ConstantSDNode>(N->getOperand(1).getNode())->getZExtValue();
4892 MVT VecVT = N->getOperand(0).getSimpleValueType();
4893 MVT ElVT = VecVT.getVectorElementType();
4895 unsigned NumElemsPerChunk = vecWidth / ElVT.getSizeInBits();
4896 return Index / NumElemsPerChunk;
4899 static unsigned getInsertVINSERTImmediate(SDNode *N, unsigned vecWidth) {
4900 assert((vecWidth == 128 || vecWidth == 256) && "Unsupported vector width");
4901 if (!isa<ConstantSDNode>(N->getOperand(2).getNode()))
4902 llvm_unreachable("Illegal insert subvector for VINSERT");
4905 cast<ConstantSDNode>(N->getOperand(2).getNode())->getZExtValue();
4907 MVT VecVT = N->getSimpleValueType(0);
4908 MVT ElVT = VecVT.getVectorElementType();
4910 unsigned NumElemsPerChunk = vecWidth / ElVT.getSizeInBits();
4911 return Index / NumElemsPerChunk;
4914 /// getExtractVEXTRACT128Immediate - Return the appropriate immediate
4915 /// to extract the specified EXTRACT_SUBVECTOR index with VEXTRACTF128
4916 /// and VINSERTI128 instructions.
4917 unsigned X86::getExtractVEXTRACT128Immediate(SDNode *N) {
4918 return getExtractVEXTRACTImmediate(N, 128);
4921 /// getExtractVEXTRACT256Immediate - Return the appropriate immediate
4922 /// to extract the specified EXTRACT_SUBVECTOR index with VEXTRACTF64x4
4923 /// and VINSERTI64x4 instructions.
4924 unsigned X86::getExtractVEXTRACT256Immediate(SDNode *N) {
4925 return getExtractVEXTRACTImmediate(N, 256);
4928 /// getInsertVINSERT128Immediate - Return the appropriate immediate
4929 /// to insert at the specified INSERT_SUBVECTOR index with VINSERTF128
4930 /// and VINSERTI128 instructions.
4931 unsigned X86::getInsertVINSERT128Immediate(SDNode *N) {
4932 return getInsertVINSERTImmediate(N, 128);
4935 /// getInsertVINSERT256Immediate - Return the appropriate immediate
4936 /// to insert at the specified INSERT_SUBVECTOR index with VINSERTF46x4
4937 /// and VINSERTI64x4 instructions.
4938 unsigned X86::getInsertVINSERT256Immediate(SDNode *N) {
4939 return getInsertVINSERTImmediate(N, 256);
4942 /// isZero - Returns true if Elt is a constant integer zero
4943 static bool isZero(SDValue V) {
4944 ConstantSDNode *C = dyn_cast<ConstantSDNode>(V);
4945 return C && C->isNullValue();
4948 /// isZeroNode - Returns true if Elt is a constant zero or a floating point
4950 bool X86::isZeroNode(SDValue Elt) {
4953 if (ConstantFPSDNode *CFP = dyn_cast<ConstantFPSDNode>(Elt))
4954 return CFP->getValueAPF().isPosZero();
4958 /// ShouldXformToMOVHLPS - Return true if the node should be transformed to
4959 /// match movhlps. The lower half elements should come from upper half of
4960 /// V1 (and in order), and the upper half elements should come from the upper
4961 /// half of V2 (and in order).
4962 static bool ShouldXformToMOVHLPS(ArrayRef<int> Mask, MVT VT) {
4963 if (!VT.is128BitVector())
4965 if (VT.getVectorNumElements() != 4)
4967 for (unsigned i = 0, e = 2; i != e; ++i)
4968 if (!isUndefOrEqual(Mask[i], i+2))
4970 for (unsigned i = 2; i != 4; ++i)
4971 if (!isUndefOrEqual(Mask[i], i+4))
4976 /// isScalarLoadToVector - Returns true if the node is a scalar load that
4977 /// is promoted to a vector. It also returns the LoadSDNode by reference if
4979 static bool isScalarLoadToVector(SDNode *N, LoadSDNode **LD = nullptr) {
4980 if (N->getOpcode() != ISD::SCALAR_TO_VECTOR)
4982 N = N->getOperand(0).getNode();
4983 if (!ISD::isNON_EXTLoad(N))
4986 *LD = cast<LoadSDNode>(N);
4990 // Test whether the given value is a vector value which will be legalized
4992 static bool WillBeConstantPoolLoad(SDNode *N) {
4993 if (N->getOpcode() != ISD::BUILD_VECTOR)
4996 // Check for any non-constant elements.
4997 for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i)
4998 switch (N->getOperand(i).getNode()->getOpcode()) {
5000 case ISD::ConstantFP:
5007 // Vectors of all-zeros and all-ones are materialized with special
5008 // instructions rather than being loaded.
5009 return !ISD::isBuildVectorAllZeros(N) &&
5010 !ISD::isBuildVectorAllOnes(N);
5013 /// ShouldXformToMOVLP{S|D} - Return true if the node should be transformed to
5014 /// match movlp{s|d}. The lower half elements should come from lower half of
5015 /// V1 (and in order), and the upper half elements should come from the upper
5016 /// half of V2 (and in order). And since V1 will become the source of the
5017 /// MOVLP, it must be either a vector load or a scalar load to vector.
5018 static bool ShouldXformToMOVLP(SDNode *V1, SDNode *V2,
5019 ArrayRef<int> Mask, MVT VT) {
5020 if (!VT.is128BitVector())
5023 if (!ISD::isNON_EXTLoad(V1) && !isScalarLoadToVector(V1))
5025 // Is V2 is a vector load, don't do this transformation. We will try to use
5026 // load folding shufps op.
5027 if (ISD::isNON_EXTLoad(V2) || WillBeConstantPoolLoad(V2))
5030 unsigned NumElems = VT.getVectorNumElements();
5032 if (NumElems != 2 && NumElems != 4)
5034 for (unsigned i = 0, e = NumElems/2; i != e; ++i)
5035 if (!isUndefOrEqual(Mask[i], i))
5037 for (unsigned i = NumElems/2, e = NumElems; i != e; ++i)
5038 if (!isUndefOrEqual(Mask[i], i+NumElems))
5043 /// isZeroShuffle - Returns true if N is a VECTOR_SHUFFLE that can be resolved
5044 /// to an zero vector.
5045 /// FIXME: move to dag combiner / method on ShuffleVectorSDNode
5046 static bool isZeroShuffle(ShuffleVectorSDNode *N) {
5047 SDValue V1 = N->getOperand(0);
5048 SDValue V2 = N->getOperand(1);
5049 unsigned NumElems = N->getValueType(0).getVectorNumElements();
5050 for (unsigned i = 0; i != NumElems; ++i) {
5051 int Idx = N->getMaskElt(i);
5052 if (Idx >= (int)NumElems) {
5053 unsigned Opc = V2.getOpcode();
5054 if (Opc == ISD::UNDEF || ISD::isBuildVectorAllZeros(V2.getNode()))
5056 if (Opc != ISD::BUILD_VECTOR ||
5057 !X86::isZeroNode(V2.getOperand(Idx-NumElems)))
5059 } else if (Idx >= 0) {
5060 unsigned Opc = V1.getOpcode();
5061 if (Opc == ISD::UNDEF || ISD::isBuildVectorAllZeros(V1.getNode()))
5063 if (Opc != ISD::BUILD_VECTOR ||
5064 !X86::isZeroNode(V1.getOperand(Idx)))
5071 /// getZeroVector - Returns a vector of specified type with all zero elements.
5073 static SDValue getZeroVector(EVT VT, const X86Subtarget *Subtarget,
5074 SelectionDAG &DAG, SDLoc dl) {
5075 assert(VT.isVector() && "Expected a vector type");
5077 // Always build SSE zero vectors as <4 x i32> bitcasted
5078 // to their dest type. This ensures they get CSE'd.
5080 if (VT.is128BitVector()) { // SSE
5081 if (Subtarget->hasSSE2()) { // SSE2
5082 SDValue Cst = DAG.getTargetConstant(0, MVT::i32);
5083 Vec = DAG.getNode(ISD::BUILD_VECTOR, dl, MVT::v4i32, Cst, Cst, Cst, Cst);
5085 SDValue Cst = DAG.getTargetConstantFP(+0.0, MVT::f32);
5086 Vec = DAG.getNode(ISD::BUILD_VECTOR, dl, MVT::v4f32, Cst, Cst, Cst, Cst);
5088 } else if (VT.is256BitVector()) { // AVX
5089 if (Subtarget->hasInt256()) { // AVX2
5090 SDValue Cst = DAG.getTargetConstant(0, MVT::i32);
5091 SDValue Ops[] = { Cst, Cst, Cst, Cst, Cst, Cst, Cst, Cst };
5092 Vec = DAG.getNode(ISD::BUILD_VECTOR, dl, MVT::v8i32, Ops);
5094 // 256-bit logic and arithmetic instructions in AVX are all
5095 // floating-point, no support for integer ops. Emit fp zeroed vectors.
5096 SDValue Cst = DAG.getTargetConstantFP(+0.0, MVT::f32);
5097 SDValue Ops[] = { Cst, Cst, Cst, Cst, Cst, Cst, Cst, Cst };
5098 Vec = DAG.getNode(ISD::BUILD_VECTOR, dl, MVT::v8f32, Ops);
5100 } else if (VT.is512BitVector()) { // AVX-512
5101 SDValue Cst = DAG.getTargetConstant(0, MVT::i32);
5102 SDValue Ops[] = { Cst, Cst, Cst, Cst, Cst, Cst, Cst, Cst,
5103 Cst, Cst, Cst, Cst, Cst, Cst, Cst, Cst };
5104 Vec = DAG.getNode(ISD::BUILD_VECTOR, dl, MVT::v16i32, Ops);
5105 } else if (VT.getScalarType() == MVT::i1) {
5106 assert(VT.getVectorNumElements() <= 16 && "Unexpected vector type");
5107 SDValue Cst = DAG.getTargetConstant(0, MVT::i1);
5108 SmallVector<SDValue, 16> Ops(VT.getVectorNumElements(), Cst);
5109 return DAG.getNode(ISD::BUILD_VECTOR, dl, VT, Ops);
5111 llvm_unreachable("Unexpected vector type");
5113 return DAG.getNode(ISD::BITCAST, dl, VT, Vec);
5116 /// getOnesVector - Returns a vector of specified type with all bits set.
5117 /// Always build ones vectors as <4 x i32> or <8 x i32>. For 256-bit types with
5118 /// no AVX2 supprt, use two <4 x i32> inserted in a <8 x i32> appropriately.
5119 /// Then bitcast to their original type, ensuring they get CSE'd.
5120 static SDValue getOnesVector(MVT VT, bool HasInt256, SelectionDAG &DAG,
5122 assert(VT.isVector() && "Expected a vector type");
5124 SDValue Cst = DAG.getTargetConstant(~0U, MVT::i32);
5126 if (VT.is256BitVector()) {
5127 if (HasInt256) { // AVX2
5128 SDValue Ops[] = { Cst, Cst, Cst, Cst, Cst, Cst, Cst, Cst };
5129 Vec = DAG.getNode(ISD::BUILD_VECTOR, dl, MVT::v8i32, Ops);
5131 Vec = DAG.getNode(ISD::BUILD_VECTOR, dl, MVT::v4i32, Cst, Cst, Cst, Cst);
5132 Vec = Concat128BitVectors(Vec, Vec, MVT::v8i32, 8, DAG, dl);
5134 } else if (VT.is128BitVector()) {
5135 Vec = DAG.getNode(ISD::BUILD_VECTOR, dl, MVT::v4i32, Cst, Cst, Cst, Cst);
5137 llvm_unreachable("Unexpected vector type");
5139 return DAG.getNode(ISD::BITCAST, dl, VT, Vec);
5142 /// NormalizeMask - V2 is a splat, modify the mask (if needed) so all elements
5143 /// that point to V2 points to its first element.
5144 static void NormalizeMask(SmallVectorImpl<int> &Mask, unsigned NumElems) {
5145 for (unsigned i = 0; i != NumElems; ++i) {
5146 if (Mask[i] > (int)NumElems) {
5152 /// getMOVLMask - Returns a vector_shuffle mask for an movs{s|d}, movd
5153 /// operation of specified width.
5154 static SDValue getMOVL(SelectionDAG &DAG, SDLoc dl, EVT VT, SDValue V1,
5156 unsigned NumElems = VT.getVectorNumElements();
5157 SmallVector<int, 8> Mask;
5158 Mask.push_back(NumElems);
5159 for (unsigned i = 1; i != NumElems; ++i)
5161 return DAG.getVectorShuffle(VT, dl, V1, V2, &Mask[0]);
5164 /// getUnpackl - Returns a vector_shuffle node for an unpackl operation.
5165 static SDValue getUnpackl(SelectionDAG &DAG, SDLoc dl, MVT VT, SDValue V1,
5167 unsigned NumElems = VT.getVectorNumElements();
5168 SmallVector<int, 8> Mask;
5169 for (unsigned i = 0, e = NumElems/2; i != e; ++i) {
5171 Mask.push_back(i + NumElems);
5173 return DAG.getVectorShuffle(VT, dl, V1, V2, &Mask[0]);
5176 /// getUnpackh - Returns a vector_shuffle node for an unpackh operation.
5177 static SDValue getUnpackh(SelectionDAG &DAG, SDLoc dl, MVT VT, SDValue V1,
5179 unsigned NumElems = VT.getVectorNumElements();
5180 SmallVector<int, 8> Mask;
5181 for (unsigned i = 0, Half = NumElems/2; i != Half; ++i) {
5182 Mask.push_back(i + Half);
5183 Mask.push_back(i + NumElems + Half);
5185 return DAG.getVectorShuffle(VT, dl, V1, V2, &Mask[0]);
5188 // PromoteSplati8i16 - All i16 and i8 vector types can't be used directly by
5189 // a generic shuffle instruction because the target has no such instructions.
5190 // Generate shuffles which repeat i16 and i8 several times until they can be
5191 // represented by v4f32 and then be manipulated by target suported shuffles.
5192 static SDValue PromoteSplati8i16(SDValue V, SelectionDAG &DAG, int &EltNo) {
5193 MVT VT = V.getSimpleValueType();
5194 int NumElems = VT.getVectorNumElements();
5197 while (NumElems > 4) {
5198 if (EltNo < NumElems/2) {
5199 V = getUnpackl(DAG, dl, VT, V, V);
5201 V = getUnpackh(DAG, dl, VT, V, V);
5202 EltNo -= NumElems/2;
5209 /// getLegalSplat - Generate a legal splat with supported x86 shuffles
5210 static SDValue getLegalSplat(SelectionDAG &DAG, SDValue V, int EltNo) {
5211 MVT VT = V.getSimpleValueType();
5214 if (VT.is128BitVector()) {
5215 V = DAG.getNode(ISD::BITCAST, dl, MVT::v4f32, V);
5216 int SplatMask[4] = { EltNo, EltNo, EltNo, EltNo };
5217 V = DAG.getVectorShuffle(MVT::v4f32, dl, V, DAG.getUNDEF(MVT::v4f32),
5219 } else if (VT.is256BitVector()) {
5220 // To use VPERMILPS to splat scalars, the second half of indicies must
5221 // refer to the higher part, which is a duplication of the lower one,
5222 // because VPERMILPS can only handle in-lane permutations.
5223 int SplatMask[8] = { EltNo, EltNo, EltNo, EltNo,
5224 EltNo+4, EltNo+4, EltNo+4, EltNo+4 };
5226 V = DAG.getNode(ISD::BITCAST, dl, MVT::v8f32, V);
5227 V = DAG.getVectorShuffle(MVT::v8f32, dl, V, DAG.getUNDEF(MVT::v8f32),
5230 llvm_unreachable("Vector size not supported");
5232 return DAG.getNode(ISD::BITCAST, dl, VT, V);
5235 /// PromoteSplat - Splat is promoted to target supported vector shuffles.
5236 static SDValue PromoteSplat(ShuffleVectorSDNode *SV, SelectionDAG &DAG) {
5237 MVT SrcVT = SV->getSimpleValueType(0);
5238 SDValue V1 = SV->getOperand(0);
5241 int EltNo = SV->getSplatIndex();
5242 int NumElems = SrcVT.getVectorNumElements();
5243 bool Is256BitVec = SrcVT.is256BitVector();
5245 assert(((SrcVT.is128BitVector() && NumElems > 4) || Is256BitVec) &&
5246 "Unknown how to promote splat for type");
5248 // Extract the 128-bit part containing the splat element and update
5249 // the splat element index when it refers to the higher register.
5251 V1 = Extract128BitVector(V1, EltNo, DAG, dl);
5252 if (EltNo >= NumElems/2)
5253 EltNo -= NumElems/2;
5256 // All i16 and i8 vector types can't be used directly by a generic shuffle
5257 // instruction because the target has no such instruction. Generate shuffles
5258 // which repeat i16 and i8 several times until they fit in i32, and then can
5259 // be manipulated by target suported shuffles.
5260 MVT EltVT = SrcVT.getVectorElementType();
5261 if (EltVT == MVT::i8 || EltVT == MVT::i16)
5262 V1 = PromoteSplati8i16(V1, DAG, EltNo);
5264 // Recreate the 256-bit vector and place the same 128-bit vector
5265 // into the low and high part. This is necessary because we want
5266 // to use VPERM* to shuffle the vectors
5268 V1 = DAG.getNode(ISD::CONCAT_VECTORS, dl, SrcVT, V1, V1);
5271 return getLegalSplat(DAG, V1, EltNo);
5274 /// getShuffleVectorZeroOrUndef - Return a vector_shuffle of the specified
5275 /// vector of zero or undef vector. This produces a shuffle where the low
5276 /// element of V2 is swizzled into the zero/undef vector, landing at element
5277 /// Idx. This produces a shuffle mask like 4,1,2,3 (idx=0) or 0,1,2,4 (idx=3).
5278 static SDValue getShuffleVectorZeroOrUndef(SDValue V2, unsigned Idx,
5280 const X86Subtarget *Subtarget,
5281 SelectionDAG &DAG) {
5282 MVT VT = V2.getSimpleValueType();
5284 ? getZeroVector(VT, Subtarget, DAG, SDLoc(V2)) : DAG.getUNDEF(VT);
5285 unsigned NumElems = VT.getVectorNumElements();
5286 SmallVector<int, 16> MaskVec;
5287 for (unsigned i = 0; i != NumElems; ++i)
5288 // If this is the insertion idx, put the low elt of V2 here.
5289 MaskVec.push_back(i == Idx ? NumElems : i);
5290 return DAG.getVectorShuffle(VT, SDLoc(V2), V1, V2, &MaskVec[0]);
5293 /// getTargetShuffleMask - Calculates the shuffle mask corresponding to the
5294 /// target specific opcode. Returns true if the Mask could be calculated. Sets
5295 /// IsUnary to true if only uses one source. Note that this will set IsUnary for
5296 /// shuffles which use a single input multiple times, and in those cases it will
5297 /// adjust the mask to only have indices within that single input.
5298 static bool getTargetShuffleMask(SDNode *N, MVT VT,
5299 SmallVectorImpl<int> &Mask, bool &IsUnary) {
5300 unsigned NumElems = VT.getVectorNumElements();
5304 bool IsFakeUnary = false;
5305 switch(N->getOpcode()) {
5307 ImmN = N->getOperand(N->getNumOperands()-1);
5308 DecodeSHUFPMask(VT, cast<ConstantSDNode>(ImmN)->getZExtValue(), Mask);
5309 IsUnary = IsFakeUnary = N->getOperand(0) == N->getOperand(1);
5311 case X86ISD::UNPCKH:
5312 DecodeUNPCKHMask(VT, Mask);
5313 IsUnary = IsFakeUnary = N->getOperand(0) == N->getOperand(1);
5315 case X86ISD::UNPCKL:
5316 DecodeUNPCKLMask(VT, Mask);
5317 IsUnary = IsFakeUnary = N->getOperand(0) == N->getOperand(1);
5319 case X86ISD::MOVHLPS:
5320 DecodeMOVHLPSMask(NumElems, Mask);
5321 IsUnary = IsFakeUnary = N->getOperand(0) == N->getOperand(1);
5323 case X86ISD::MOVLHPS:
5324 DecodeMOVLHPSMask(NumElems, Mask);
5325 IsUnary = IsFakeUnary = N->getOperand(0) == N->getOperand(1);
5327 case X86ISD::PALIGNR:
5328 ImmN = N->getOperand(N->getNumOperands()-1);
5329 DecodePALIGNRMask(VT, cast<ConstantSDNode>(ImmN)->getZExtValue(), Mask);
5331 case X86ISD::PSHUFD:
5332 case X86ISD::VPERMILP:
5333 ImmN = N->getOperand(N->getNumOperands()-1);
5334 DecodePSHUFMask(VT, cast<ConstantSDNode>(ImmN)->getZExtValue(), Mask);
5337 case X86ISD::PSHUFHW:
5338 ImmN = N->getOperand(N->getNumOperands()-1);
5339 DecodePSHUFHWMask(VT, cast<ConstantSDNode>(ImmN)->getZExtValue(), Mask);
5342 case X86ISD::PSHUFLW:
5343 ImmN = N->getOperand(N->getNumOperands()-1);
5344 DecodePSHUFLWMask(VT, cast<ConstantSDNode>(ImmN)->getZExtValue(), Mask);
5347 case X86ISD::PSHUFB: {
5349 SDValue MaskNode = N->getOperand(1);
5350 while (MaskNode->getOpcode() == ISD::BITCAST)
5351 MaskNode = MaskNode->getOperand(0);
5353 if (MaskNode->getOpcode() == ISD::BUILD_VECTOR) {
5354 // If we have a build-vector, then things are easy.
5355 EVT VT = MaskNode.getValueType();
5356 assert(VT.isVector() &&
5357 "Can't produce a non-vector with a build_vector!");
5358 if (!VT.isInteger())
5361 int NumBytesPerElement = VT.getVectorElementType().getSizeInBits() / 8;
5363 SmallVector<uint64_t, 32> RawMask;
5364 for (int i = 0, e = MaskNode->getNumOperands(); i < e; ++i) {
5365 auto *CN = dyn_cast<ConstantSDNode>(MaskNode->getOperand(i));
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<ConstantDataSequential>(MaskCP->getConstVal())) {
5396 // FIXME: Support AVX-512 here.
5397 if (!C->getType()->isVectorTy() ||
5398 (C->getNumElements() != 16 && C->getNumElements() != 32))
5401 assert(C->getType()->isVectorTy() && "Expected a vector constant.");
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::MOVDDUP:
5430 case X86ISD::MOVLHPD:
5431 case X86ISD::MOVLPD:
5432 case X86ISD::MOVLPS:
5433 case X86ISD::MOVSHDUP:
5434 case X86ISD::MOVSLDUP:
5435 // Not yet implemented
5437 default: llvm_unreachable("unknown target shuffle node");
5440 // If we have a fake unary shuffle, the shuffle mask is spread across two
5441 // inputs that are actually the same node. Re-map the mask to always point
5442 // into the first input.
5445 if (M >= (int)Mask.size())
5451 /// getShuffleScalarElt - Returns the scalar element that will make up the ith
5452 /// element of the result of the vector shuffle.
5453 static SDValue getShuffleScalarElt(SDNode *N, unsigned Index, SelectionDAG &DAG,
5456 return SDValue(); // Limit search depth.
5458 SDValue V = SDValue(N, 0);
5459 EVT VT = V.getValueType();
5460 unsigned Opcode = V.getOpcode();
5462 // Recurse into ISD::VECTOR_SHUFFLE node to find scalars.
5463 if (const ShuffleVectorSDNode *SV = dyn_cast<ShuffleVectorSDNode>(N)) {
5464 int Elt = SV->getMaskElt(Index);
5467 return DAG.getUNDEF(VT.getVectorElementType());
5469 unsigned NumElems = VT.getVectorNumElements();
5470 SDValue NewV = (Elt < (int)NumElems) ? SV->getOperand(0)
5471 : SV->getOperand(1);
5472 return getShuffleScalarElt(NewV.getNode(), Elt % NumElems, DAG, Depth+1);
5475 // Recurse into target specific vector shuffles to find scalars.
5476 if (isTargetShuffle(Opcode)) {
5477 MVT ShufVT = V.getSimpleValueType();
5478 unsigned NumElems = ShufVT.getVectorNumElements();
5479 SmallVector<int, 16> ShuffleMask;
5482 if (!getTargetShuffleMask(N, ShufVT, ShuffleMask, IsUnary))
5485 int Elt = ShuffleMask[Index];
5487 return DAG.getUNDEF(ShufVT.getVectorElementType());
5489 SDValue NewV = (Elt < (int)NumElems) ? N->getOperand(0)
5491 return getShuffleScalarElt(NewV.getNode(), Elt % NumElems, DAG,
5495 // Actual nodes that may contain scalar elements
5496 if (Opcode == ISD::BITCAST) {
5497 V = V.getOperand(0);
5498 EVT SrcVT = V.getValueType();
5499 unsigned NumElems = VT.getVectorNumElements();
5501 if (!SrcVT.isVector() || SrcVT.getVectorNumElements() != NumElems)
5505 if (V.getOpcode() == ISD::SCALAR_TO_VECTOR)
5506 return (Index == 0) ? V.getOperand(0)
5507 : DAG.getUNDEF(VT.getVectorElementType());
5509 if (V.getOpcode() == ISD::BUILD_VECTOR)
5510 return V.getOperand(Index);
5515 /// getNumOfConsecutiveZeros - Return the number of elements of a vector
5516 /// shuffle operation which come from a consecutively from a zero. The
5517 /// search can start in two different directions, from left or right.
5518 /// We count undefs as zeros until PreferredNum is reached.
5519 static unsigned getNumOfConsecutiveZeros(ShuffleVectorSDNode *SVOp,
5520 unsigned NumElems, bool ZerosFromLeft,
5522 unsigned PreferredNum = -1U) {
5523 unsigned NumZeros = 0;
5524 for (unsigned i = 0; i != NumElems; ++i) {
5525 unsigned Index = ZerosFromLeft ? i : NumElems - i - 1;
5526 SDValue Elt = getShuffleScalarElt(SVOp, Index, DAG, 0);
5530 if (X86::isZeroNode(Elt))
5532 else if (Elt.getOpcode() == ISD::UNDEF) // Undef as zero up to PreferredNum.
5533 NumZeros = std::min(NumZeros + 1, PreferredNum);
5541 /// isShuffleMaskConsecutive - Check if the shuffle mask indicies [MaskI, MaskE)
5542 /// correspond consecutively to elements from one of the vector operands,
5543 /// starting from its index OpIdx. Also tell OpNum which source vector operand.
5545 bool isShuffleMaskConsecutive(ShuffleVectorSDNode *SVOp,
5546 unsigned MaskI, unsigned MaskE, unsigned OpIdx,
5547 unsigned NumElems, unsigned &OpNum) {
5548 bool SeenV1 = false;
5549 bool SeenV2 = false;
5551 for (unsigned i = MaskI; i != MaskE; ++i, ++OpIdx) {
5552 int Idx = SVOp->getMaskElt(i);
5553 // Ignore undef indicies
5557 if (Idx < (int)NumElems)
5562 // Only accept consecutive elements from the same vector
5563 if ((Idx % NumElems != OpIdx) || (SeenV1 && SeenV2))
5567 OpNum = SeenV1 ? 0 : 1;
5571 /// isVectorShiftRight - Returns true if the shuffle can be implemented as a
5572 /// logical left shift of a vector.
5573 static bool isVectorShiftRight(ShuffleVectorSDNode *SVOp, SelectionDAG &DAG,
5574 bool &isLeft, SDValue &ShVal, unsigned &ShAmt) {
5576 SVOp->getSimpleValueType(0).getVectorNumElements();
5577 unsigned NumZeros = getNumOfConsecutiveZeros(
5578 SVOp, NumElems, false /* check zeros from right */, DAG,
5579 SVOp->getMaskElt(0));
5585 // Considering the elements in the mask that are not consecutive zeros,
5586 // check if they consecutively come from only one of the source vectors.
5588 // V1 = {X, A, B, C} 0
5590 // vector_shuffle V1, V2 <1, 2, 3, X>
5592 if (!isShuffleMaskConsecutive(SVOp,
5593 0, // Mask Start Index
5594 NumElems-NumZeros, // Mask End Index(exclusive)
5595 NumZeros, // Where to start looking in the src vector
5596 NumElems, // Number of elements in vector
5597 OpSrc)) // Which source operand ?
5602 ShVal = SVOp->getOperand(OpSrc);
5606 /// isVectorShiftLeft - Returns true if the shuffle can be implemented as a
5607 /// logical left shift of a vector.
5608 static bool isVectorShiftLeft(ShuffleVectorSDNode *SVOp, SelectionDAG &DAG,
5609 bool &isLeft, SDValue &ShVal, unsigned &ShAmt) {
5611 SVOp->getSimpleValueType(0).getVectorNumElements();
5612 unsigned NumZeros = getNumOfConsecutiveZeros(
5613 SVOp, NumElems, true /* check zeros from left */, DAG,
5614 NumElems - SVOp->getMaskElt(NumElems - 1) - 1);
5620 // Considering the elements in the mask that are not consecutive zeros,
5621 // check if they consecutively come from only one of the source vectors.
5623 // 0 { A, B, X, X } = V2
5625 // vector_shuffle V1, V2 <X, X, 4, 5>
5627 if (!isShuffleMaskConsecutive(SVOp,
5628 NumZeros, // Mask Start Index
5629 NumElems, // Mask End Index(exclusive)
5630 0, // Where to start looking in the src vector
5631 NumElems, // Number of elements in vector
5632 OpSrc)) // Which source operand ?
5637 ShVal = SVOp->getOperand(OpSrc);
5641 /// isVectorShift - Returns true if the shuffle can be implemented as a
5642 /// logical left or right shift of a vector.
5643 static bool isVectorShift(ShuffleVectorSDNode *SVOp, SelectionDAG &DAG,
5644 bool &isLeft, SDValue &ShVal, unsigned &ShAmt) {
5645 // Although the logic below support any bitwidth size, there are no
5646 // shift instructions which handle more than 128-bit vectors.
5647 if (!SVOp->getSimpleValueType(0).is128BitVector())
5650 if (isVectorShiftLeft(SVOp, DAG, isLeft, ShVal, ShAmt) ||
5651 isVectorShiftRight(SVOp, DAG, isLeft, ShVal, ShAmt))
5657 /// LowerBuildVectorv16i8 - Custom lower build_vector of v16i8.
5659 static SDValue LowerBuildVectorv16i8(SDValue Op, unsigned NonZeros,
5660 unsigned NumNonZero, unsigned NumZero,
5662 const X86Subtarget* Subtarget,
5663 const TargetLowering &TLI) {
5670 for (unsigned i = 0; i < 16; ++i) {
5671 bool ThisIsNonZero = (NonZeros & (1 << i)) != 0;
5672 if (ThisIsNonZero && First) {
5674 V = getZeroVector(MVT::v8i16, Subtarget, DAG, dl);
5676 V = DAG.getUNDEF(MVT::v8i16);
5681 SDValue ThisElt, LastElt;
5682 bool LastIsNonZero = (NonZeros & (1 << (i-1))) != 0;
5683 if (LastIsNonZero) {
5684 LastElt = DAG.getNode(ISD::ZERO_EXTEND, dl,
5685 MVT::i16, Op.getOperand(i-1));
5687 if (ThisIsNonZero) {
5688 ThisElt = DAG.getNode(ISD::ZERO_EXTEND, dl, MVT::i16, Op.getOperand(i));
5689 ThisElt = DAG.getNode(ISD::SHL, dl, MVT::i16,
5690 ThisElt, DAG.getConstant(8, MVT::i8));
5692 ThisElt = DAG.getNode(ISD::OR, dl, MVT::i16, ThisElt, LastElt);
5696 if (ThisElt.getNode())
5697 V = DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, MVT::v8i16, V, ThisElt,
5698 DAG.getIntPtrConstant(i/2));
5702 return DAG.getNode(ISD::BITCAST, dl, MVT::v16i8, V);
5705 /// LowerBuildVectorv8i16 - Custom lower build_vector of v8i16.
5707 static SDValue LowerBuildVectorv8i16(SDValue Op, unsigned NonZeros,
5708 unsigned NumNonZero, unsigned NumZero,
5710 const X86Subtarget* Subtarget,
5711 const TargetLowering &TLI) {
5718 for (unsigned i = 0; i < 8; ++i) {
5719 bool isNonZero = (NonZeros & (1 << i)) != 0;
5723 V = getZeroVector(MVT::v8i16, Subtarget, DAG, dl);
5725 V = DAG.getUNDEF(MVT::v8i16);
5728 V = DAG.getNode(ISD::INSERT_VECTOR_ELT, dl,
5729 MVT::v8i16, V, Op.getOperand(i),
5730 DAG.getIntPtrConstant(i));
5737 /// LowerBuildVectorv4x32 - Custom lower build_vector of v4i32 or v4f32.
5738 static SDValue LowerBuildVectorv4x32(SDValue Op, unsigned NumElems,
5739 unsigned NonZeros, unsigned NumNonZero,
5740 unsigned NumZero, SelectionDAG &DAG,
5741 const X86Subtarget *Subtarget,
5742 const TargetLowering &TLI) {
5743 // We know there's at least one non-zero element
5744 unsigned FirstNonZeroIdx = 0;
5745 SDValue FirstNonZero = Op->getOperand(FirstNonZeroIdx);
5746 while (FirstNonZero.getOpcode() == ISD::UNDEF ||
5747 X86::isZeroNode(FirstNonZero)) {
5749 FirstNonZero = Op->getOperand(FirstNonZeroIdx);
5752 if (FirstNonZero.getOpcode() != ISD::EXTRACT_VECTOR_ELT ||
5753 !isa<ConstantSDNode>(FirstNonZero.getOperand(1)))
5756 SDValue V = FirstNonZero.getOperand(0);
5757 MVT VVT = V.getSimpleValueType();
5758 if (!Subtarget->hasSSE41() || (VVT != MVT::v4f32 && VVT != MVT::v4i32))
5761 unsigned FirstNonZeroDst =
5762 cast<ConstantSDNode>(FirstNonZero.getOperand(1))->getZExtValue();
5763 unsigned CorrectIdx = FirstNonZeroDst == FirstNonZeroIdx;
5764 unsigned IncorrectIdx = CorrectIdx ? -1U : FirstNonZeroIdx;
5765 unsigned IncorrectDst = CorrectIdx ? -1U : FirstNonZeroDst;
5767 for (unsigned Idx = FirstNonZeroIdx + 1; Idx < NumElems; ++Idx) {
5768 SDValue Elem = Op.getOperand(Idx);
5769 if (Elem.getOpcode() == ISD::UNDEF || X86::isZeroNode(Elem))
5772 // TODO: What else can be here? Deal with it.
5773 if (Elem.getOpcode() != ISD::EXTRACT_VECTOR_ELT)
5776 // TODO: Some optimizations are still possible here
5777 // ex: Getting one element from a vector, and the rest from another.
5778 if (Elem.getOperand(0) != V)
5781 unsigned Dst = cast<ConstantSDNode>(Elem.getOperand(1))->getZExtValue();
5784 else if (IncorrectIdx == -1U) {
5788 // There was already one element with an incorrect index.
5789 // We can't optimize this case to an insertps.
5793 if (NumNonZero == CorrectIdx || NumNonZero == CorrectIdx + 1) {
5795 EVT VT = Op.getSimpleValueType();
5796 unsigned ElementMoveMask = 0;
5797 if (IncorrectIdx == -1U)
5798 ElementMoveMask = FirstNonZeroIdx << 6 | FirstNonZeroIdx << 4;
5800 ElementMoveMask = IncorrectDst << 6 | IncorrectIdx << 4;
5802 SDValue InsertpsMask =
5803 DAG.getIntPtrConstant(ElementMoveMask | (~NonZeros & 0xf));
5804 return DAG.getNode(X86ISD::INSERTPS, dl, VT, V, V, InsertpsMask);
5810 /// getVShift - Return a vector logical shift node.
5812 static SDValue getVShift(bool isLeft, EVT VT, SDValue SrcOp,
5813 unsigned NumBits, SelectionDAG &DAG,
5814 const TargetLowering &TLI, SDLoc dl) {
5815 assert(VT.is128BitVector() && "Unknown type for VShift");
5816 EVT ShVT = MVT::v2i64;
5817 unsigned Opc = isLeft ? X86ISD::VSHLDQ : X86ISD::VSRLDQ;
5818 SrcOp = DAG.getNode(ISD::BITCAST, dl, ShVT, SrcOp);
5819 return DAG.getNode(ISD::BITCAST, dl, VT,
5820 DAG.getNode(Opc, dl, ShVT, SrcOp,
5821 DAG.getConstant(NumBits,
5822 TLI.getScalarShiftAmountTy(SrcOp.getValueType()))));
5826 LowerAsSplatVectorLoad(SDValue SrcOp, MVT VT, SDLoc dl, SelectionDAG &DAG) {
5828 // Check if the scalar load can be widened into a vector load. And if
5829 // the address is "base + cst" see if the cst can be "absorbed" into
5830 // the shuffle mask.
5831 if (LoadSDNode *LD = dyn_cast<LoadSDNode>(SrcOp)) {
5832 SDValue Ptr = LD->getBasePtr();
5833 if (!ISD::isNormalLoad(LD) || LD->isVolatile())
5835 EVT PVT = LD->getValueType(0);
5836 if (PVT != MVT::i32 && PVT != MVT::f32)
5841 if (FrameIndexSDNode *FINode = dyn_cast<FrameIndexSDNode>(Ptr)) {
5842 FI = FINode->getIndex();
5844 } else if (DAG.isBaseWithConstantOffset(Ptr) &&
5845 isa<FrameIndexSDNode>(Ptr.getOperand(0))) {
5846 FI = cast<FrameIndexSDNode>(Ptr.getOperand(0))->getIndex();
5847 Offset = Ptr.getConstantOperandVal(1);
5848 Ptr = Ptr.getOperand(0);
5853 // FIXME: 256-bit vector instructions don't require a strict alignment,
5854 // improve this code to support it better.
5855 unsigned RequiredAlign = VT.getSizeInBits()/8;
5856 SDValue Chain = LD->getChain();
5857 // Make sure the stack object alignment is at least 16 or 32.
5858 MachineFrameInfo *MFI = DAG.getMachineFunction().getFrameInfo();
5859 if (DAG.InferPtrAlignment(Ptr) < RequiredAlign) {
5860 if (MFI->isFixedObjectIndex(FI)) {
5861 // Can't change the alignment. FIXME: It's possible to compute
5862 // the exact stack offset and reference FI + adjust offset instead.
5863 // If someone *really* cares about this. That's the way to implement it.
5866 MFI->setObjectAlignment(FI, RequiredAlign);
5870 // (Offset % 16 or 32) must be multiple of 4. Then address is then
5871 // Ptr + (Offset & ~15).
5874 if ((Offset % RequiredAlign) & 3)
5876 int64_t StartOffset = Offset & ~(RequiredAlign-1);
5878 Ptr = DAG.getNode(ISD::ADD, SDLoc(Ptr), Ptr.getValueType(),
5879 Ptr,DAG.getConstant(StartOffset, Ptr.getValueType()));
5881 int EltNo = (Offset - StartOffset) >> 2;
5882 unsigned NumElems = VT.getVectorNumElements();
5884 EVT NVT = EVT::getVectorVT(*DAG.getContext(), PVT, NumElems);
5885 SDValue V1 = DAG.getLoad(NVT, dl, Chain, Ptr,
5886 LD->getPointerInfo().getWithOffset(StartOffset),
5887 false, false, false, 0);
5889 SmallVector<int, 8> Mask;
5890 for (unsigned i = 0; i != NumElems; ++i)
5891 Mask.push_back(EltNo);
5893 return DAG.getVectorShuffle(NVT, dl, V1, DAG.getUNDEF(NVT), &Mask[0]);
5899 /// EltsFromConsecutiveLoads - Given the initializing elements 'Elts' of a
5900 /// vector of type 'VT', see if the elements can be replaced by a single large
5901 /// load which has the same value as a build_vector whose operands are 'elts'.
5903 /// Example: <load i32 *a, load i32 *a+4, undef, undef> -> zextload a
5905 /// FIXME: we'd also like to handle the case where the last elements are zero
5906 /// rather than undef via VZEXT_LOAD, but we do not detect that case today.
5907 /// There's even a handy isZeroNode for that purpose.
5908 static SDValue EltsFromConsecutiveLoads(EVT VT, SmallVectorImpl<SDValue> &Elts,
5909 SDLoc &DL, SelectionDAG &DAG,
5910 bool isAfterLegalize) {
5911 EVT EltVT = VT.getVectorElementType();
5912 unsigned NumElems = Elts.size();
5914 LoadSDNode *LDBase = nullptr;
5915 unsigned LastLoadedElt = -1U;
5917 // For each element in the initializer, see if we've found a load or an undef.
5918 // If we don't find an initial load element, or later load elements are
5919 // non-consecutive, bail out.
5920 for (unsigned i = 0; i < NumElems; ++i) {
5921 SDValue Elt = Elts[i];
5923 if (!Elt.getNode() ||
5924 (Elt.getOpcode() != ISD::UNDEF && !ISD::isNON_EXTLoad(Elt.getNode())))
5927 if (Elt.getNode()->getOpcode() == ISD::UNDEF)
5929 LDBase = cast<LoadSDNode>(Elt.getNode());
5933 if (Elt.getOpcode() == ISD::UNDEF)
5936 LoadSDNode *LD = cast<LoadSDNode>(Elt);
5937 if (!DAG.isConsecutiveLoad(LD, LDBase, EltVT.getSizeInBits()/8, i))
5942 // If we have found an entire vector of loads and undefs, then return a large
5943 // load of the entire vector width starting at the base pointer. If we found
5944 // consecutive loads for the low half, generate a vzext_load node.
5945 if (LastLoadedElt == NumElems - 1) {
5947 if (isAfterLegalize &&
5948 !DAG.getTargetLoweringInfo().isOperationLegal(ISD::LOAD, VT))
5951 SDValue NewLd = SDValue();
5953 if (DAG.InferPtrAlignment(LDBase->getBasePtr()) >= 16)
5954 NewLd = DAG.getLoad(VT, DL, LDBase->getChain(), LDBase->getBasePtr(),
5955 LDBase->getPointerInfo(),
5956 LDBase->isVolatile(), LDBase->isNonTemporal(),
5957 LDBase->isInvariant(), 0);
5958 NewLd = DAG.getLoad(VT, DL, LDBase->getChain(), LDBase->getBasePtr(),
5959 LDBase->getPointerInfo(),
5960 LDBase->isVolatile(), LDBase->isNonTemporal(),
5961 LDBase->isInvariant(), LDBase->getAlignment());
5963 if (LDBase->hasAnyUseOfValue(1)) {
5964 SDValue NewChain = DAG.getNode(ISD::TokenFactor, DL, MVT::Other,
5966 SDValue(NewLd.getNode(), 1));
5967 DAG.ReplaceAllUsesOfValueWith(SDValue(LDBase, 1), NewChain);
5968 DAG.UpdateNodeOperands(NewChain.getNode(), SDValue(LDBase, 1),
5969 SDValue(NewLd.getNode(), 1));
5974 if (NumElems == 4 && LastLoadedElt == 1 &&
5975 DAG.getTargetLoweringInfo().isTypeLegal(MVT::v2i64)) {
5976 SDVTList Tys = DAG.getVTList(MVT::v2i64, MVT::Other);
5977 SDValue Ops[] = { LDBase->getChain(), LDBase->getBasePtr() };
5979 DAG.getMemIntrinsicNode(X86ISD::VZEXT_LOAD, DL, Tys, Ops, MVT::i64,
5980 LDBase->getPointerInfo(),
5981 LDBase->getAlignment(),
5982 false/*isVolatile*/, true/*ReadMem*/,
5985 // Make sure the newly-created LOAD is in the same position as LDBase in
5986 // terms of dependency. We create a TokenFactor for LDBase and ResNode, and
5987 // update uses of LDBase's output chain to use the TokenFactor.
5988 if (LDBase->hasAnyUseOfValue(1)) {
5989 SDValue NewChain = DAG.getNode(ISD::TokenFactor, DL, MVT::Other,
5990 SDValue(LDBase, 1), SDValue(ResNode.getNode(), 1));
5991 DAG.ReplaceAllUsesOfValueWith(SDValue(LDBase, 1), NewChain);
5992 DAG.UpdateNodeOperands(NewChain.getNode(), SDValue(LDBase, 1),
5993 SDValue(ResNode.getNode(), 1));
5996 return DAG.getNode(ISD::BITCAST, DL, VT, ResNode);
6001 /// LowerVectorBroadcast - Attempt to use the vbroadcast instruction
6002 /// to generate a splat value for the following cases:
6003 /// 1. A splat BUILD_VECTOR which uses a single scalar load, or a constant.
6004 /// 2. A splat shuffle which uses a scalar_to_vector node which comes from
6005 /// a scalar load, or a constant.
6006 /// The VBROADCAST node is returned when a pattern is found,
6007 /// or SDValue() otherwise.
6008 static SDValue LowerVectorBroadcast(SDValue Op, const X86Subtarget* Subtarget,
6009 SelectionDAG &DAG) {
6010 if (!Subtarget->hasFp256())
6013 MVT VT = Op.getSimpleValueType();
6016 assert((VT.is128BitVector() || VT.is256BitVector() || VT.is512BitVector()) &&
6017 "Unsupported vector type for broadcast.");
6022 switch (Op.getOpcode()) {
6024 // Unknown pattern found.
6027 case ISD::BUILD_VECTOR: {
6028 auto *BVOp = cast<BuildVectorSDNode>(Op.getNode());
6029 BitVector UndefElements;
6030 SDValue Splat = BVOp->getSplatValue(&UndefElements);
6032 // We need a splat of a single value to use broadcast, and it doesn't
6033 // make any sense if the value is only in one element of the vector.
6034 if (!Splat || (VT.getVectorNumElements() - UndefElements.count()) <= 1)
6038 ConstSplatVal = (Ld.getOpcode() == ISD::Constant ||
6039 Ld.getOpcode() == ISD::ConstantFP);
6041 // Make sure that all of the users of a non-constant load are from the
6042 // BUILD_VECTOR node.
6043 if (!ConstSplatVal && !BVOp->isOnlyUserOf(Ld.getNode()))
6048 case ISD::VECTOR_SHUFFLE: {
6049 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
6051 // Shuffles must have a splat mask where the first element is
6053 if ((!SVOp->isSplat()) || SVOp->getMaskElt(0) != 0)
6056 SDValue Sc = Op.getOperand(0);
6057 if (Sc.getOpcode() != ISD::SCALAR_TO_VECTOR &&
6058 Sc.getOpcode() != ISD::BUILD_VECTOR) {
6060 if (!Subtarget->hasInt256())
6063 // Use the register form of the broadcast instruction available on AVX2.
6064 if (VT.getSizeInBits() >= 256)
6065 Sc = Extract128BitVector(Sc, 0, DAG, dl);
6066 return DAG.getNode(X86ISD::VBROADCAST, dl, VT, Sc);
6069 Ld = Sc.getOperand(0);
6070 ConstSplatVal = (Ld.getOpcode() == ISD::Constant ||
6071 Ld.getOpcode() == ISD::ConstantFP);
6073 // The scalar_to_vector node and the suspected
6074 // load node must have exactly one user.
6075 // Constants may have multiple users.
6077 // AVX-512 has register version of the broadcast
6078 bool hasRegVer = Subtarget->hasAVX512() && VT.is512BitVector() &&
6079 Ld.getValueType().getSizeInBits() >= 32;
6080 if (!ConstSplatVal && ((!Sc.hasOneUse() || !Ld.hasOneUse()) &&
6087 bool IsGE256 = (VT.getSizeInBits() >= 256);
6089 // Handle the broadcasting a single constant scalar from the constant pool
6090 // into a vector. On Sandybridge it is still better to load a constant vector
6091 // from the constant pool and not to broadcast it from a scalar.
6092 if (ConstSplatVal && Subtarget->hasInt256()) {
6093 EVT CVT = Ld.getValueType();
6094 assert(!CVT.isVector() && "Must not broadcast a vector type");
6095 unsigned ScalarSize = CVT.getSizeInBits();
6097 if (ScalarSize == 32 || (IsGE256 && ScalarSize == 64)) {
6098 const Constant *C = nullptr;
6099 if (ConstantSDNode *CI = dyn_cast<ConstantSDNode>(Ld))
6100 C = CI->getConstantIntValue();
6101 else if (ConstantFPSDNode *CF = dyn_cast<ConstantFPSDNode>(Ld))
6102 C = CF->getConstantFPValue();
6104 assert(C && "Invalid constant type");
6106 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
6107 SDValue CP = DAG.getConstantPool(C, TLI.getPointerTy());
6108 unsigned Alignment = cast<ConstantPoolSDNode>(CP)->getAlignment();
6109 Ld = DAG.getLoad(CVT, dl, DAG.getEntryNode(), CP,
6110 MachinePointerInfo::getConstantPool(),
6111 false, false, false, Alignment);
6113 return DAG.getNode(X86ISD::VBROADCAST, dl, VT, Ld);
6117 bool IsLoad = ISD::isNormalLoad(Ld.getNode());
6118 unsigned ScalarSize = Ld.getValueType().getSizeInBits();
6120 // Handle AVX2 in-register broadcasts.
6121 if (!IsLoad && Subtarget->hasInt256() &&
6122 (ScalarSize == 32 || (IsGE256 && ScalarSize == 64)))
6123 return DAG.getNode(X86ISD::VBROADCAST, dl, VT, Ld);
6125 // The scalar source must be a normal load.
6129 if (ScalarSize == 32 || (IsGE256 && ScalarSize == 64))
6130 return DAG.getNode(X86ISD::VBROADCAST, dl, VT, Ld);
6132 // The integer check is needed for the 64-bit into 128-bit so it doesn't match
6133 // double since there is no vbroadcastsd xmm
6134 if (Subtarget->hasInt256() && Ld.getValueType().isInteger()) {
6135 if (ScalarSize == 8 || ScalarSize == 16 || ScalarSize == 64)
6136 return DAG.getNode(X86ISD::VBROADCAST, dl, VT, Ld);
6139 // Unsupported broadcast.
6143 /// \brief For an EXTRACT_VECTOR_ELT with a constant index return the real
6144 /// underlying vector and index.
6146 /// Modifies \p ExtractedFromVec to the real vector and returns the real
6148 static int getUnderlyingExtractedFromVec(SDValue &ExtractedFromVec,
6150 int Idx = cast<ConstantSDNode>(ExtIdx)->getZExtValue();
6151 if (!isa<ShuffleVectorSDNode>(ExtractedFromVec))
6154 // For 256-bit vectors, LowerEXTRACT_VECTOR_ELT_SSE4 may have already
6156 // (extract_vector_elt (v8f32 %vreg1), Constant<6>)
6158 // (extract_vector_elt (vector_shuffle<2,u,u,u>
6159 // (extract_subvector (v8f32 %vreg0), Constant<4>),
6162 // In this case the vector is the extract_subvector expression and the index
6163 // is 2, as specified by the shuffle.
6164 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(ExtractedFromVec);
6165 SDValue ShuffleVec = SVOp->getOperand(0);
6166 MVT ShuffleVecVT = ShuffleVec.getSimpleValueType();
6167 assert(ShuffleVecVT.getVectorElementType() ==
6168 ExtractedFromVec.getSimpleValueType().getVectorElementType());
6170 int ShuffleIdx = SVOp->getMaskElt(Idx);
6171 if (isUndefOrInRange(ShuffleIdx, 0, ShuffleVecVT.getVectorNumElements())) {
6172 ExtractedFromVec = ShuffleVec;
6178 static SDValue buildFromShuffleMostly(SDValue Op, SelectionDAG &DAG) {
6179 MVT VT = Op.getSimpleValueType();
6181 // Skip if insert_vec_elt is not supported.
6182 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
6183 if (!TLI.isOperationLegalOrCustom(ISD::INSERT_VECTOR_ELT, VT))
6187 unsigned NumElems = Op.getNumOperands();
6191 SmallVector<unsigned, 4> InsertIndices;
6192 SmallVector<int, 8> Mask(NumElems, -1);
6194 for (unsigned i = 0; i != NumElems; ++i) {
6195 unsigned Opc = Op.getOperand(i).getOpcode();
6197 if (Opc == ISD::UNDEF)
6200 if (Opc != ISD::EXTRACT_VECTOR_ELT) {
6201 // Quit if more than 1 elements need inserting.
6202 if (InsertIndices.size() > 1)
6205 InsertIndices.push_back(i);
6209 SDValue ExtractedFromVec = Op.getOperand(i).getOperand(0);
6210 SDValue ExtIdx = Op.getOperand(i).getOperand(1);
6211 // Quit if non-constant index.
6212 if (!isa<ConstantSDNode>(ExtIdx))
6214 int Idx = getUnderlyingExtractedFromVec(ExtractedFromVec, ExtIdx);
6216 // Quit if extracted from vector of different type.
6217 if (ExtractedFromVec.getValueType() != VT)
6220 if (!VecIn1.getNode())
6221 VecIn1 = ExtractedFromVec;
6222 else if (VecIn1 != ExtractedFromVec) {
6223 if (!VecIn2.getNode())
6224 VecIn2 = ExtractedFromVec;
6225 else if (VecIn2 != ExtractedFromVec)
6226 // Quit if more than 2 vectors to shuffle
6230 if (ExtractedFromVec == VecIn1)
6232 else if (ExtractedFromVec == VecIn2)
6233 Mask[i] = Idx + NumElems;
6236 if (!VecIn1.getNode())
6239 VecIn2 = VecIn2.getNode() ? VecIn2 : DAG.getUNDEF(VT);
6240 SDValue NV = DAG.getVectorShuffle(VT, DL, VecIn1, VecIn2, &Mask[0]);
6241 for (unsigned i = 0, e = InsertIndices.size(); i != e; ++i) {
6242 unsigned Idx = InsertIndices[i];
6243 NV = DAG.getNode(ISD::INSERT_VECTOR_ELT, DL, VT, NV, Op.getOperand(Idx),
6244 DAG.getIntPtrConstant(Idx));
6250 // Lower BUILD_VECTOR operation for v8i1 and v16i1 types.
6252 X86TargetLowering::LowerBUILD_VECTORvXi1(SDValue Op, SelectionDAG &DAG) const {
6254 MVT VT = Op.getSimpleValueType();
6255 assert((VT.getVectorElementType() == MVT::i1) && (VT.getSizeInBits() <= 16) &&
6256 "Unexpected type in LowerBUILD_VECTORvXi1!");
6259 if (ISD::isBuildVectorAllZeros(Op.getNode())) {
6260 SDValue Cst = DAG.getTargetConstant(0, MVT::i1);
6261 SmallVector<SDValue, 16> Ops(VT.getVectorNumElements(), Cst);
6262 return DAG.getNode(ISD::BUILD_VECTOR, dl, VT, Ops);
6265 if (ISD::isBuildVectorAllOnes(Op.getNode())) {
6266 SDValue Cst = DAG.getTargetConstant(1, MVT::i1);
6267 SmallVector<SDValue, 16> Ops(VT.getVectorNumElements(), Cst);
6268 return DAG.getNode(ISD::BUILD_VECTOR, dl, VT, Ops);
6271 bool AllContants = true;
6272 uint64_t Immediate = 0;
6273 int NonConstIdx = -1;
6274 bool IsSplat = true;
6275 unsigned NumNonConsts = 0;
6276 unsigned NumConsts = 0;
6277 for (unsigned idx = 0, e = Op.getNumOperands(); idx < e; ++idx) {
6278 SDValue In = Op.getOperand(idx);
6279 if (In.getOpcode() == ISD::UNDEF)
6281 if (!isa<ConstantSDNode>(In)) {
6282 AllContants = false;
6288 if (cast<ConstantSDNode>(In)->getZExtValue())
6289 Immediate |= (1ULL << idx);
6291 if (In != Op.getOperand(0))
6296 SDValue FullMask = DAG.getNode(ISD::BITCAST, dl, MVT::v16i1,
6297 DAG.getConstant(Immediate, MVT::i16));
6298 return DAG.getNode(ISD::EXTRACT_SUBVECTOR, dl, VT, FullMask,
6299 DAG.getIntPtrConstant(0));
6302 if (NumNonConsts == 1 && NonConstIdx != 0) {
6305 SDValue VecAsImm = DAG.getConstant(Immediate,
6306 MVT::getIntegerVT(VT.getSizeInBits()));
6307 DstVec = DAG.getNode(ISD::BITCAST, dl, VT, VecAsImm);
6310 DstVec = DAG.getUNDEF(VT);
6311 return DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, VT, DstVec,
6312 Op.getOperand(NonConstIdx),
6313 DAG.getIntPtrConstant(NonConstIdx));
6315 if (!IsSplat && (NonConstIdx != 0))
6316 llvm_unreachable("Unsupported BUILD_VECTOR operation");
6317 MVT SelectVT = (VT == MVT::v16i1)? MVT::i16 : MVT::i8;
6320 Select = DAG.getNode(ISD::SELECT, dl, SelectVT, Op.getOperand(0),
6321 DAG.getConstant(-1, SelectVT),
6322 DAG.getConstant(0, SelectVT));
6324 Select = DAG.getNode(ISD::SELECT, dl, SelectVT, Op.getOperand(0),
6325 DAG.getConstant((Immediate | 1), SelectVT),
6326 DAG.getConstant(Immediate, SelectVT));
6327 return DAG.getNode(ISD::BITCAST, dl, VT, Select);
6330 /// \brief Return true if \p N implements a horizontal binop and return the
6331 /// operands for the horizontal binop into V0 and V1.
6333 /// This is a helper function of PerformBUILD_VECTORCombine.
6334 /// This function checks that the build_vector \p N in input implements a
6335 /// horizontal operation. Parameter \p Opcode defines the kind of horizontal
6336 /// operation to match.
6337 /// For example, if \p Opcode is equal to ISD::ADD, then this function
6338 /// checks if \p N implements a horizontal arithmetic add; if instead \p Opcode
6339 /// is equal to ISD::SUB, then this function checks if this is a horizontal
6342 /// This function only analyzes elements of \p N whose indices are
6343 /// in range [BaseIdx, LastIdx).
6344 static bool isHorizontalBinOp(const BuildVectorSDNode *N, unsigned Opcode,
6346 unsigned BaseIdx, unsigned LastIdx,
6347 SDValue &V0, SDValue &V1) {
6348 EVT VT = N->getValueType(0);
6350 assert(BaseIdx * 2 <= LastIdx && "Invalid Indices in input!");
6351 assert(VT.isVector() && VT.getVectorNumElements() >= LastIdx &&
6352 "Invalid Vector in input!");
6354 bool IsCommutable = (Opcode == ISD::ADD || Opcode == ISD::FADD);
6355 bool CanFold = true;
6356 unsigned ExpectedVExtractIdx = BaseIdx;
6357 unsigned NumElts = LastIdx - BaseIdx;
6358 V0 = DAG.getUNDEF(VT);
6359 V1 = DAG.getUNDEF(VT);
6361 // Check if N implements a horizontal binop.
6362 for (unsigned i = 0, e = NumElts; i != e && CanFold; ++i) {
6363 SDValue Op = N->getOperand(i + BaseIdx);
6366 if (Op->getOpcode() == ISD::UNDEF) {
6367 // Update the expected vector extract index.
6368 if (i * 2 == NumElts)
6369 ExpectedVExtractIdx = BaseIdx;
6370 ExpectedVExtractIdx += 2;
6374 CanFold = Op->getOpcode() == Opcode && Op->hasOneUse();
6379 SDValue Op0 = Op.getOperand(0);
6380 SDValue Op1 = Op.getOperand(1);
6382 // Try to match the following pattern:
6383 // (BINOP (extract_vector_elt A, I), (extract_vector_elt A, I+1))
6384 CanFold = (Op0.getOpcode() == ISD::EXTRACT_VECTOR_ELT &&
6385 Op1.getOpcode() == ISD::EXTRACT_VECTOR_ELT &&
6386 Op0.getOperand(0) == Op1.getOperand(0) &&
6387 isa<ConstantSDNode>(Op0.getOperand(1)) &&
6388 isa<ConstantSDNode>(Op1.getOperand(1)));
6392 unsigned I0 = cast<ConstantSDNode>(Op0.getOperand(1))->getZExtValue();
6393 unsigned I1 = cast<ConstantSDNode>(Op1.getOperand(1))->getZExtValue();
6395 if (i * 2 < NumElts) {
6396 if (V0.getOpcode() == ISD::UNDEF)
6397 V0 = Op0.getOperand(0);
6399 if (V1.getOpcode() == ISD::UNDEF)
6400 V1 = Op0.getOperand(0);
6401 if (i * 2 == NumElts)
6402 ExpectedVExtractIdx = BaseIdx;
6405 SDValue Expected = (i * 2 < NumElts) ? V0 : V1;
6406 if (I0 == ExpectedVExtractIdx)
6407 CanFold = I1 == I0 + 1 && Op0.getOperand(0) == Expected;
6408 else if (IsCommutable && I1 == ExpectedVExtractIdx) {
6409 // Try to match the following dag sequence:
6410 // (BINOP (extract_vector_elt A, I+1), (extract_vector_elt A, I))
6411 CanFold = I0 == I1 + 1 && Op1.getOperand(0) == Expected;
6415 ExpectedVExtractIdx += 2;
6421 /// \brief Emit a sequence of two 128-bit horizontal add/sub followed by
6422 /// a concat_vector.
6424 /// This is a helper function of PerformBUILD_VECTORCombine.
6425 /// This function expects two 256-bit vectors called V0 and V1.
6426 /// At first, each vector is split into two separate 128-bit vectors.
6427 /// Then, the resulting 128-bit vectors are used to implement two
6428 /// horizontal binary operations.
6430 /// The kind of horizontal binary operation is defined by \p X86Opcode.
6432 /// \p Mode specifies how the 128-bit parts of V0 and V1 are passed in input to
6433 /// the two new horizontal binop.
6434 /// When Mode is set, the first horizontal binop dag node would take as input
6435 /// the lower 128-bit of V0 and the upper 128-bit of V0. The second
6436 /// horizontal binop dag node would take as input the lower 128-bit of V1
6437 /// and the upper 128-bit of V1.
6439 /// HADD V0_LO, V0_HI
6440 /// HADD V1_LO, V1_HI
6442 /// Otherwise, the first horizontal binop dag node takes as input the lower
6443 /// 128-bit of V0 and the lower 128-bit of V1, and the second horizontal binop
6444 /// dag node takes the the upper 128-bit of V0 and the upper 128-bit of V1.
6446 /// HADD V0_LO, V1_LO
6447 /// HADD V0_HI, V1_HI
6449 /// If \p isUndefLO is set, then the algorithm propagates UNDEF to the lower
6450 /// 128-bits of the result. If \p isUndefHI is set, then UNDEF is propagated to
6451 /// the upper 128-bits of the result.
6452 static SDValue ExpandHorizontalBinOp(const SDValue &V0, const SDValue &V1,
6453 SDLoc DL, SelectionDAG &DAG,
6454 unsigned X86Opcode, bool Mode,
6455 bool isUndefLO, bool isUndefHI) {
6456 EVT VT = V0.getValueType();
6457 assert(VT.is256BitVector() && VT == V1.getValueType() &&
6458 "Invalid nodes in input!");
6460 unsigned NumElts = VT.getVectorNumElements();
6461 SDValue V0_LO = Extract128BitVector(V0, 0, DAG, DL);
6462 SDValue V0_HI = Extract128BitVector(V0, NumElts/2, DAG, DL);
6463 SDValue V1_LO = Extract128BitVector(V1, 0, DAG, DL);
6464 SDValue V1_HI = Extract128BitVector(V1, NumElts/2, DAG, DL);
6465 EVT NewVT = V0_LO.getValueType();
6467 SDValue LO = DAG.getUNDEF(NewVT);
6468 SDValue HI = DAG.getUNDEF(NewVT);
6471 // Don't emit a horizontal binop if the result is expected to be UNDEF.
6472 if (!isUndefLO && V0->getOpcode() != ISD::UNDEF)
6473 LO = DAG.getNode(X86Opcode, DL, NewVT, V0_LO, V0_HI);
6474 if (!isUndefHI && V1->getOpcode() != ISD::UNDEF)
6475 HI = DAG.getNode(X86Opcode, DL, NewVT, V1_LO, V1_HI);
6477 // Don't emit a horizontal binop if the result is expected to be UNDEF.
6478 if (!isUndefLO && (V0_LO->getOpcode() != ISD::UNDEF ||
6479 V1_LO->getOpcode() != ISD::UNDEF))
6480 LO = DAG.getNode(X86Opcode, DL, NewVT, V0_LO, V1_LO);
6482 if (!isUndefHI && (V0_HI->getOpcode() != ISD::UNDEF ||
6483 V1_HI->getOpcode() != ISD::UNDEF))
6484 HI = DAG.getNode(X86Opcode, DL, NewVT, V0_HI, V1_HI);
6487 return DAG.getNode(ISD::CONCAT_VECTORS, DL, VT, LO, HI);
6490 /// \brief Try to fold a build_vector that performs an 'addsub' into the
6491 /// sequence of 'vadd + vsub + blendi'.
6492 static SDValue matchAddSub(const BuildVectorSDNode *BV, SelectionDAG &DAG,
6493 const X86Subtarget *Subtarget) {
6495 EVT VT = BV->getValueType(0);
6496 unsigned NumElts = VT.getVectorNumElements();
6497 SDValue InVec0 = DAG.getUNDEF(VT);
6498 SDValue InVec1 = DAG.getUNDEF(VT);
6500 assert((VT == MVT::v8f32 || VT == MVT::v4f64 || VT == MVT::v4f32 ||
6501 VT == MVT::v2f64) && "build_vector with an invalid type found!");
6503 // Don't try to emit a VSELECT that cannot be lowered into a blend.
6504 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
6505 if (!TLI.isOperationLegalOrCustom(ISD::VSELECT, VT))
6508 // Odd-numbered elements in the input build vector are obtained from
6509 // adding two integer/float elements.
6510 // Even-numbered elements in the input build vector are obtained from
6511 // subtracting two integer/float elements.
6512 unsigned ExpectedOpcode = ISD::FSUB;
6513 unsigned NextExpectedOpcode = ISD::FADD;
6514 bool AddFound = false;
6515 bool SubFound = false;
6517 for (unsigned i = 0, e = NumElts; i != e; i++) {
6518 SDValue Op = BV->getOperand(i);
6520 // Skip 'undef' values.
6521 unsigned Opcode = Op.getOpcode();
6522 if (Opcode == ISD::UNDEF) {
6523 std::swap(ExpectedOpcode, NextExpectedOpcode);
6527 // Early exit if we found an unexpected opcode.
6528 if (Opcode != ExpectedOpcode)
6531 SDValue Op0 = Op.getOperand(0);
6532 SDValue Op1 = Op.getOperand(1);
6534 // Try to match the following pattern:
6535 // (BINOP (extract_vector_elt A, i), (extract_vector_elt B, i))
6536 // Early exit if we cannot match that sequence.
6537 if (Op0.getOpcode() != ISD::EXTRACT_VECTOR_ELT ||
6538 Op1.getOpcode() != ISD::EXTRACT_VECTOR_ELT ||
6539 !isa<ConstantSDNode>(Op0.getOperand(1)) ||
6540 !isa<ConstantSDNode>(Op1.getOperand(1)) ||
6541 Op0.getOperand(1) != Op1.getOperand(1))
6544 unsigned I0 = cast<ConstantSDNode>(Op0.getOperand(1))->getZExtValue();
6548 // We found a valid add/sub node. Update the information accordingly.
6554 // Update InVec0 and InVec1.
6555 if (InVec0.getOpcode() == ISD::UNDEF)
6556 InVec0 = Op0.getOperand(0);
6557 if (InVec1.getOpcode() == ISD::UNDEF)
6558 InVec1 = Op1.getOperand(0);
6560 // Make sure that operands in input to each add/sub node always
6561 // come from a same pair of vectors.
6562 if (InVec0 != Op0.getOperand(0)) {
6563 if (ExpectedOpcode == ISD::FSUB)
6566 // FADD is commutable. Try to commute the operands
6567 // and then test again.
6568 std::swap(Op0, Op1);
6569 if (InVec0 != Op0.getOperand(0))
6573 if (InVec1 != Op1.getOperand(0))
6576 // Update the pair of expected opcodes.
6577 std::swap(ExpectedOpcode, NextExpectedOpcode);
6580 // Don't try to fold this build_vector into a VSELECT if it has
6581 // too many UNDEF operands.
6582 if (AddFound && SubFound && InVec0.getOpcode() != ISD::UNDEF &&
6583 InVec1.getOpcode() != ISD::UNDEF) {
6584 // Emit a sequence of vector add and sub followed by a VSELECT.
6585 // The new VSELECT will be lowered into a BLENDI.
6586 // At ISel stage, we pattern-match the sequence 'add + sub + BLENDI'
6587 // and emit a single ADDSUB instruction.
6588 SDValue Sub = DAG.getNode(ExpectedOpcode, DL, VT, InVec0, InVec1);
6589 SDValue Add = DAG.getNode(NextExpectedOpcode, DL, VT, InVec0, InVec1);
6591 // Construct the VSELECT mask.
6592 EVT MaskVT = VT.changeVectorElementTypeToInteger();
6593 EVT SVT = MaskVT.getVectorElementType();
6594 unsigned SVTBits = SVT.getSizeInBits();
6595 SmallVector<SDValue, 8> Ops;
6597 for (unsigned i = 0, e = NumElts; i != e; ++i) {
6598 APInt Value = i & 1 ? APInt::getNullValue(SVTBits) :
6599 APInt::getAllOnesValue(SVTBits);
6600 SDValue Constant = DAG.getConstant(Value, SVT);
6601 Ops.push_back(Constant);
6604 SDValue Mask = DAG.getNode(ISD::BUILD_VECTOR, DL, MaskVT, Ops);
6605 return DAG.getSelect(DL, VT, Mask, Sub, Add);
6611 static SDValue PerformBUILD_VECTORCombine(SDNode *N, SelectionDAG &DAG,
6612 const X86Subtarget *Subtarget) {
6614 EVT VT = N->getValueType(0);
6615 unsigned NumElts = VT.getVectorNumElements();
6616 BuildVectorSDNode *BV = cast<BuildVectorSDNode>(N);
6617 SDValue InVec0, InVec1;
6619 // Try to match an ADDSUB.
6620 if ((Subtarget->hasSSE3() && (VT == MVT::v4f32 || VT == MVT::v2f64)) ||
6621 (Subtarget->hasAVX() && (VT == MVT::v8f32 || VT == MVT::v4f64))) {
6622 SDValue Value = matchAddSub(BV, DAG, Subtarget);
6623 if (Value.getNode())
6627 // Try to match horizontal ADD/SUB.
6628 unsigned NumUndefsLO = 0;
6629 unsigned NumUndefsHI = 0;
6630 unsigned Half = NumElts/2;
6632 // Count the number of UNDEF operands in the build_vector in input.
6633 for (unsigned i = 0, e = Half; i != e; ++i)
6634 if (BV->getOperand(i)->getOpcode() == ISD::UNDEF)
6637 for (unsigned i = Half, e = NumElts; i != e; ++i)
6638 if (BV->getOperand(i)->getOpcode() == ISD::UNDEF)
6641 // Early exit if this is either a build_vector of all UNDEFs or all the
6642 // operands but one are UNDEF.
6643 if (NumUndefsLO + NumUndefsHI + 1 >= NumElts)
6646 if ((VT == MVT::v4f32 || VT == MVT::v2f64) && Subtarget->hasSSE3()) {
6647 // Try to match an SSE3 float HADD/HSUB.
6648 if (isHorizontalBinOp(BV, ISD::FADD, DAG, 0, NumElts, InVec0, InVec1))
6649 return DAG.getNode(X86ISD::FHADD, DL, VT, InVec0, InVec1);
6651 if (isHorizontalBinOp(BV, ISD::FSUB, DAG, 0, NumElts, InVec0, InVec1))
6652 return DAG.getNode(X86ISD::FHSUB, DL, VT, InVec0, InVec1);
6653 } else if ((VT == MVT::v4i32 || VT == MVT::v8i16) && Subtarget->hasSSSE3()) {
6654 // Try to match an SSSE3 integer HADD/HSUB.
6655 if (isHorizontalBinOp(BV, ISD::ADD, DAG, 0, NumElts, InVec0, InVec1))
6656 return DAG.getNode(X86ISD::HADD, DL, VT, InVec0, InVec1);
6658 if (isHorizontalBinOp(BV, ISD::SUB, DAG, 0, NumElts, InVec0, InVec1))
6659 return DAG.getNode(X86ISD::HSUB, DL, VT, InVec0, InVec1);
6662 if (!Subtarget->hasAVX())
6665 if ((VT == MVT::v8f32 || VT == MVT::v4f64)) {
6666 // Try to match an AVX horizontal add/sub of packed single/double
6667 // precision floating point values from 256-bit vectors.
6668 SDValue InVec2, InVec3;
6669 if (isHorizontalBinOp(BV, ISD::FADD, DAG, 0, Half, InVec0, InVec1) &&
6670 isHorizontalBinOp(BV, ISD::FADD, DAG, Half, NumElts, InVec2, InVec3) &&
6671 ((InVec0.getOpcode() == ISD::UNDEF ||
6672 InVec2.getOpcode() == ISD::UNDEF) || InVec0 == InVec2) &&
6673 ((InVec1.getOpcode() == ISD::UNDEF ||
6674 InVec3.getOpcode() == ISD::UNDEF) || InVec1 == InVec3))
6675 return DAG.getNode(X86ISD::FHADD, DL, VT, InVec0, InVec1);
6677 if (isHorizontalBinOp(BV, ISD::FSUB, DAG, 0, Half, InVec0, InVec1) &&
6678 isHorizontalBinOp(BV, ISD::FSUB, DAG, Half, NumElts, InVec2, InVec3) &&
6679 ((InVec0.getOpcode() == ISD::UNDEF ||
6680 InVec2.getOpcode() == ISD::UNDEF) || InVec0 == InVec2) &&
6681 ((InVec1.getOpcode() == ISD::UNDEF ||
6682 InVec3.getOpcode() == ISD::UNDEF) || InVec1 == InVec3))
6683 return DAG.getNode(X86ISD::FHSUB, DL, VT, InVec0, InVec1);
6684 } else if (VT == MVT::v8i32 || VT == MVT::v16i16) {
6685 // Try to match an AVX2 horizontal add/sub of signed integers.
6686 SDValue InVec2, InVec3;
6688 bool CanFold = true;
6690 if (isHorizontalBinOp(BV, ISD::ADD, DAG, 0, Half, InVec0, InVec1) &&
6691 isHorizontalBinOp(BV, ISD::ADD, DAG, Half, NumElts, InVec2, InVec3) &&
6692 ((InVec0.getOpcode() == ISD::UNDEF ||
6693 InVec2.getOpcode() == ISD::UNDEF) || InVec0 == InVec2) &&
6694 ((InVec1.getOpcode() == ISD::UNDEF ||
6695 InVec3.getOpcode() == ISD::UNDEF) || InVec1 == InVec3))
6696 X86Opcode = X86ISD::HADD;
6697 else if (isHorizontalBinOp(BV, ISD::SUB, DAG, 0, Half, InVec0, InVec1) &&
6698 isHorizontalBinOp(BV, ISD::SUB, DAG, Half, NumElts, InVec2, InVec3) &&
6699 ((InVec0.getOpcode() == ISD::UNDEF ||
6700 InVec2.getOpcode() == ISD::UNDEF) || InVec0 == InVec2) &&
6701 ((InVec1.getOpcode() == ISD::UNDEF ||
6702 InVec3.getOpcode() == ISD::UNDEF) || InVec1 == InVec3))
6703 X86Opcode = X86ISD::HSUB;
6708 // Fold this build_vector into a single horizontal add/sub.
6709 // Do this only if the target has AVX2.
6710 if (Subtarget->hasAVX2())
6711 return DAG.getNode(X86Opcode, DL, VT, InVec0, InVec1);
6713 // Do not try to expand this build_vector into a pair of horizontal
6714 // add/sub if we can emit a pair of scalar add/sub.
6715 if (NumUndefsLO + 1 == Half || NumUndefsHI + 1 == Half)
6718 // Convert this build_vector into a pair of horizontal binop followed by
6720 bool isUndefLO = NumUndefsLO == Half;
6721 bool isUndefHI = NumUndefsHI == Half;
6722 return ExpandHorizontalBinOp(InVec0, InVec1, DL, DAG, X86Opcode, false,
6723 isUndefLO, isUndefHI);
6727 if ((VT == MVT::v8f32 || VT == MVT::v4f64 || VT == MVT::v8i32 ||
6728 VT == MVT::v16i16) && Subtarget->hasAVX()) {
6730 if (isHorizontalBinOp(BV, ISD::ADD, DAG, 0, NumElts, InVec0, InVec1))
6731 X86Opcode = X86ISD::HADD;
6732 else if (isHorizontalBinOp(BV, ISD::SUB, DAG, 0, NumElts, InVec0, InVec1))
6733 X86Opcode = X86ISD::HSUB;
6734 else if (isHorizontalBinOp(BV, ISD::FADD, DAG, 0, NumElts, InVec0, InVec1))
6735 X86Opcode = X86ISD::FHADD;
6736 else if (isHorizontalBinOp(BV, ISD::FSUB, DAG, 0, NumElts, InVec0, InVec1))
6737 X86Opcode = X86ISD::FHSUB;
6741 // Don't try to expand this build_vector into a pair of horizontal add/sub
6742 // if we can simply emit a pair of scalar add/sub.
6743 if (NumUndefsLO + 1 == Half || NumUndefsHI + 1 == Half)
6746 // Convert this build_vector into two horizontal add/sub followed by
6748 bool isUndefLO = NumUndefsLO == Half;
6749 bool isUndefHI = NumUndefsHI == Half;
6750 return ExpandHorizontalBinOp(InVec0, InVec1, DL, DAG, X86Opcode, true,
6751 isUndefLO, isUndefHI);
6758 X86TargetLowering::LowerBUILD_VECTOR(SDValue Op, SelectionDAG &DAG) const {
6761 MVT VT = Op.getSimpleValueType();
6762 MVT ExtVT = VT.getVectorElementType();
6763 unsigned NumElems = Op.getNumOperands();
6765 // Generate vectors for predicate vectors.
6766 if (VT.getScalarType() == MVT::i1 && Subtarget->hasAVX512())
6767 return LowerBUILD_VECTORvXi1(Op, DAG);
6769 // Vectors containing all zeros can be matched by pxor and xorps later
6770 if (ISD::isBuildVectorAllZeros(Op.getNode())) {
6771 // Canonicalize this to <4 x i32> to 1) ensure the zero vectors are CSE'd
6772 // and 2) ensure that i64 scalars are eliminated on x86-32 hosts.
6773 if (VT == MVT::v4i32 || VT == MVT::v8i32 || VT == MVT::v16i32)
6776 return getZeroVector(VT, Subtarget, DAG, dl);
6779 // Vectors containing all ones can be matched by pcmpeqd on 128-bit width
6780 // vectors or broken into v4i32 operations on 256-bit vectors. AVX2 can use
6781 // vpcmpeqd on 256-bit vectors.
6782 if (Subtarget->hasSSE2() && ISD::isBuildVectorAllOnes(Op.getNode())) {
6783 if (VT == MVT::v4i32 || (VT == MVT::v8i32 && Subtarget->hasInt256()))
6786 if (!VT.is512BitVector())
6787 return getOnesVector(VT, Subtarget->hasInt256(), DAG, dl);
6790 SDValue Broadcast = LowerVectorBroadcast(Op, Subtarget, DAG);
6791 if (Broadcast.getNode())
6794 unsigned EVTBits = ExtVT.getSizeInBits();
6796 unsigned NumZero = 0;
6797 unsigned NumNonZero = 0;
6798 unsigned NonZeros = 0;
6799 bool IsAllConstants = true;
6800 SmallSet<SDValue, 8> Values;
6801 for (unsigned i = 0; i < NumElems; ++i) {
6802 SDValue Elt = Op.getOperand(i);
6803 if (Elt.getOpcode() == ISD::UNDEF)
6806 if (Elt.getOpcode() != ISD::Constant &&
6807 Elt.getOpcode() != ISD::ConstantFP)
6808 IsAllConstants = false;
6809 if (X86::isZeroNode(Elt))
6812 NonZeros |= (1 << i);
6817 // All undef vector. Return an UNDEF. All zero vectors were handled above.
6818 if (NumNonZero == 0)
6819 return DAG.getUNDEF(VT);
6821 // Special case for single non-zero, non-undef, element.
6822 if (NumNonZero == 1) {
6823 unsigned Idx = countTrailingZeros(NonZeros);
6824 SDValue Item = Op.getOperand(Idx);
6826 // If this is an insertion of an i64 value on x86-32, and if the top bits of
6827 // the value are obviously zero, truncate the value to i32 and do the
6828 // insertion that way. Only do this if the value is non-constant or if the
6829 // value is a constant being inserted into element 0. It is cheaper to do
6830 // a constant pool load than it is to do a movd + shuffle.
6831 if (ExtVT == MVT::i64 && !Subtarget->is64Bit() &&
6832 (!IsAllConstants || Idx == 0)) {
6833 if (DAG.MaskedValueIsZero(Item, APInt::getBitsSet(64, 32, 64))) {
6835 assert(VT == MVT::v2i64 && "Expected an SSE value type!");
6836 EVT VecVT = MVT::v4i32;
6837 unsigned VecElts = 4;
6839 // Truncate the value (which may itself be a constant) to i32, and
6840 // convert it to a vector with movd (S2V+shuffle to zero extend).
6841 Item = DAG.getNode(ISD::TRUNCATE, dl, MVT::i32, Item);
6842 Item = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VecVT, Item);
6843 Item = getShuffleVectorZeroOrUndef(Item, 0, true, Subtarget, DAG);
6845 // Now we have our 32-bit value zero extended in the low element of
6846 // a vector. If Idx != 0, swizzle it into place.
6848 SmallVector<int, 4> Mask;
6849 Mask.push_back(Idx);
6850 for (unsigned i = 1; i != VecElts; ++i)
6852 Item = DAG.getVectorShuffle(VecVT, dl, Item, DAG.getUNDEF(VecVT),
6855 return DAG.getNode(ISD::BITCAST, dl, VT, Item);
6859 // If we have a constant or non-constant insertion into the low element of
6860 // a vector, we can do this with SCALAR_TO_VECTOR + shuffle of zero into
6861 // the rest of the elements. This will be matched as movd/movq/movss/movsd
6862 // depending on what the source datatype is.
6865 return DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VT, Item);
6867 if (ExtVT == MVT::i32 || ExtVT == MVT::f32 || ExtVT == MVT::f64 ||
6868 (ExtVT == MVT::i64 && Subtarget->is64Bit())) {
6869 if (VT.is256BitVector() || VT.is512BitVector()) {
6870 SDValue ZeroVec = getZeroVector(VT, Subtarget, DAG, dl);
6871 return DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, VT, ZeroVec,
6872 Item, DAG.getIntPtrConstant(0));
6874 assert(VT.is128BitVector() && "Expected an SSE value type!");
6875 Item = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VT, Item);
6876 // Turn it into a MOVL (i.e. movss, movsd, or movd) to a zero vector.
6877 return getShuffleVectorZeroOrUndef(Item, 0, true, Subtarget, DAG);
6880 if (ExtVT == MVT::i16 || ExtVT == MVT::i8) {
6881 Item = DAG.getNode(ISD::ZERO_EXTEND, dl, MVT::i32, Item);
6882 Item = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, MVT::v4i32, Item);
6883 if (VT.is256BitVector()) {
6884 SDValue ZeroVec = getZeroVector(MVT::v8i32, Subtarget, DAG, dl);
6885 Item = Insert128BitVector(ZeroVec, Item, 0, DAG, dl);
6887 assert(VT.is128BitVector() && "Expected an SSE value type!");
6888 Item = getShuffleVectorZeroOrUndef(Item, 0, true, Subtarget, DAG);
6890 return DAG.getNode(ISD::BITCAST, dl, VT, Item);
6894 // Is it a vector logical left shift?
6895 if (NumElems == 2 && Idx == 1 &&
6896 X86::isZeroNode(Op.getOperand(0)) &&
6897 !X86::isZeroNode(Op.getOperand(1))) {
6898 unsigned NumBits = VT.getSizeInBits();
6899 return getVShift(true, VT,
6900 DAG.getNode(ISD::SCALAR_TO_VECTOR, dl,
6901 VT, Op.getOperand(1)),
6902 NumBits/2, DAG, *this, dl);
6905 if (IsAllConstants) // Otherwise, it's better to do a constpool load.
6908 // Otherwise, if this is a vector with i32 or f32 elements, and the element
6909 // is a non-constant being inserted into an element other than the low one,
6910 // we can't use a constant pool load. Instead, use SCALAR_TO_VECTOR (aka
6911 // movd/movss) to move this into the low element, then shuffle it into
6913 if (EVTBits == 32) {
6914 Item = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VT, Item);
6916 // Turn it into a shuffle of zero and zero-extended scalar to vector.
6917 Item = getShuffleVectorZeroOrUndef(Item, 0, NumZero > 0, Subtarget, DAG);
6918 SmallVector<int, 8> MaskVec;
6919 for (unsigned i = 0; i != NumElems; ++i)
6920 MaskVec.push_back(i == Idx ? 0 : 1);
6921 return DAG.getVectorShuffle(VT, dl, Item, DAG.getUNDEF(VT), &MaskVec[0]);
6925 // Splat is obviously ok. Let legalizer expand it to a shuffle.
6926 if (Values.size() == 1) {
6927 if (EVTBits == 32) {
6928 // Instead of a shuffle like this:
6929 // shuffle (scalar_to_vector (load (ptr + 4))), undef, <0, 0, 0, 0>
6930 // Check if it's possible to issue this instead.
6931 // shuffle (vload ptr)), undef, <1, 1, 1, 1>
6932 unsigned Idx = countTrailingZeros(NonZeros);
6933 SDValue Item = Op.getOperand(Idx);
6934 if (Op.getNode()->isOnlyUserOf(Item.getNode()))
6935 return LowerAsSplatVectorLoad(Item, VT, dl, DAG);
6940 // A vector full of immediates; various special cases are already
6941 // handled, so this is best done with a single constant-pool load.
6945 // For AVX-length vectors, build the individual 128-bit pieces and use
6946 // shuffles to put them in place.
6947 if (VT.is256BitVector() || VT.is512BitVector()) {
6948 SmallVector<SDValue, 64> V;
6949 for (unsigned i = 0; i != NumElems; ++i)
6950 V.push_back(Op.getOperand(i));
6952 EVT HVT = EVT::getVectorVT(*DAG.getContext(), ExtVT, NumElems/2);
6954 // Build both the lower and upper subvector.
6955 SDValue Lower = DAG.getNode(ISD::BUILD_VECTOR, dl, HVT,
6956 makeArrayRef(&V[0], NumElems/2));
6957 SDValue Upper = DAG.getNode(ISD::BUILD_VECTOR, dl, HVT,
6958 makeArrayRef(&V[NumElems / 2], NumElems/2));
6960 // Recreate the wider vector with the lower and upper part.
6961 if (VT.is256BitVector())
6962 return Concat128BitVectors(Lower, Upper, VT, NumElems, DAG, dl);
6963 return Concat256BitVectors(Lower, Upper, VT, NumElems, DAG, dl);
6966 // Let legalizer expand 2-wide build_vectors.
6967 if (EVTBits == 64) {
6968 if (NumNonZero == 1) {
6969 // One half is zero or undef.
6970 unsigned Idx = countTrailingZeros(NonZeros);
6971 SDValue V2 = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VT,
6972 Op.getOperand(Idx));
6973 return getShuffleVectorZeroOrUndef(V2, Idx, true, Subtarget, DAG);
6978 // If element VT is < 32 bits, convert it to inserts into a zero vector.
6979 if (EVTBits == 8 && NumElems == 16) {
6980 SDValue V = LowerBuildVectorv16i8(Op, NonZeros,NumNonZero,NumZero, DAG,
6982 if (V.getNode()) return V;
6985 if (EVTBits == 16 && NumElems == 8) {
6986 SDValue V = LowerBuildVectorv8i16(Op, NonZeros,NumNonZero,NumZero, DAG,
6988 if (V.getNode()) return V;
6991 // If element VT is == 32 bits and has 4 elems, try to generate an INSERTPS
6992 if (EVTBits == 32 && NumElems == 4) {
6993 SDValue V = LowerBuildVectorv4x32(Op, NumElems, NonZeros, NumNonZero,
6994 NumZero, DAG, Subtarget, *this);
6999 // If element VT is == 32 bits, turn it into a number of shuffles.
7000 SmallVector<SDValue, 8> V(NumElems);
7001 if (NumElems == 4 && NumZero > 0) {
7002 for (unsigned i = 0; i < 4; ++i) {
7003 bool isZero = !(NonZeros & (1 << i));
7005 V[i] = getZeroVector(VT, Subtarget, DAG, dl);
7007 V[i] = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VT, Op.getOperand(i));
7010 for (unsigned i = 0; i < 2; ++i) {
7011 switch ((NonZeros & (0x3 << i*2)) >> (i*2)) {
7014 V[i] = V[i*2]; // Must be a zero vector.
7017 V[i] = getMOVL(DAG, dl, VT, V[i*2+1], V[i*2]);
7020 V[i] = getMOVL(DAG, dl, VT, V[i*2], V[i*2+1]);
7023 V[i] = getUnpackl(DAG, dl, VT, V[i*2], V[i*2+1]);
7028 bool Reverse1 = (NonZeros & 0x3) == 2;
7029 bool Reverse2 = ((NonZeros & (0x3 << 2)) >> 2) == 2;
7033 static_cast<int>(Reverse2 ? NumElems+1 : NumElems),
7034 static_cast<int>(Reverse2 ? NumElems : NumElems+1)
7036 return DAG.getVectorShuffle(VT, dl, V[0], V[1], &MaskVec[0]);
7039 if (Values.size() > 1 && VT.is128BitVector()) {
7040 // Check for a build vector of consecutive loads.
7041 for (unsigned i = 0; i < NumElems; ++i)
7042 V[i] = Op.getOperand(i);
7044 // Check for elements which are consecutive loads.
7045 SDValue LD = EltsFromConsecutiveLoads(VT, V, dl, DAG, false);
7049 // Check for a build vector from mostly shuffle plus few inserting.
7050 SDValue Sh = buildFromShuffleMostly(Op, DAG);
7054 // For SSE 4.1, use insertps to put the high elements into the low element.
7055 if (getSubtarget()->hasSSE41()) {
7057 if (Op.getOperand(0).getOpcode() != ISD::UNDEF)
7058 Result = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VT, Op.getOperand(0));
7060 Result = DAG.getUNDEF(VT);
7062 for (unsigned i = 1; i < NumElems; ++i) {
7063 if (Op.getOperand(i).getOpcode() == ISD::UNDEF) continue;
7064 Result = DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, VT, Result,
7065 Op.getOperand(i), DAG.getIntPtrConstant(i));
7070 // Otherwise, expand into a number of unpckl*, start by extending each of
7071 // our (non-undef) elements to the full vector width with the element in the
7072 // bottom slot of the vector (which generates no code for SSE).
7073 for (unsigned i = 0; i < NumElems; ++i) {
7074 if (Op.getOperand(i).getOpcode() != ISD::UNDEF)
7075 V[i] = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VT, Op.getOperand(i));
7077 V[i] = DAG.getUNDEF(VT);
7080 // Next, we iteratively mix elements, e.g. for v4f32:
7081 // Step 1: unpcklps 0, 2 ==> X: <?, ?, 2, 0>
7082 // : unpcklps 1, 3 ==> Y: <?, ?, 3, 1>
7083 // Step 2: unpcklps X, Y ==> <3, 2, 1, 0>
7084 unsigned EltStride = NumElems >> 1;
7085 while (EltStride != 0) {
7086 for (unsigned i = 0; i < EltStride; ++i) {
7087 // If V[i+EltStride] is undef and this is the first round of mixing,
7088 // then it is safe to just drop this shuffle: V[i] is already in the
7089 // right place, the one element (since it's the first round) being
7090 // inserted as undef can be dropped. This isn't safe for successive
7091 // rounds because they will permute elements within both vectors.
7092 if (V[i+EltStride].getOpcode() == ISD::UNDEF &&
7093 EltStride == NumElems/2)
7096 V[i] = getUnpackl(DAG, dl, VT, V[i], V[i + EltStride]);
7105 // LowerAVXCONCAT_VECTORS - 256-bit AVX can use the vinsertf128 instruction
7106 // to create 256-bit vectors from two other 128-bit ones.
7107 static SDValue LowerAVXCONCAT_VECTORS(SDValue Op, SelectionDAG &DAG) {
7109 MVT ResVT = Op.getSimpleValueType();
7111 assert((ResVT.is256BitVector() ||
7112 ResVT.is512BitVector()) && "Value type must be 256-/512-bit wide");
7114 SDValue V1 = Op.getOperand(0);
7115 SDValue V2 = Op.getOperand(1);
7116 unsigned NumElems = ResVT.getVectorNumElements();
7117 if(ResVT.is256BitVector())
7118 return Concat128BitVectors(V1, V2, ResVT, NumElems, DAG, dl);
7120 if (Op.getNumOperands() == 4) {
7121 MVT HalfVT = MVT::getVectorVT(ResVT.getScalarType(),
7122 ResVT.getVectorNumElements()/2);
7123 SDValue V3 = Op.getOperand(2);
7124 SDValue V4 = Op.getOperand(3);
7125 return Concat256BitVectors(Concat128BitVectors(V1, V2, HalfVT, NumElems/2, DAG, dl),
7126 Concat128BitVectors(V3, V4, HalfVT, NumElems/2, DAG, dl), ResVT, NumElems, DAG, dl);
7128 return Concat256BitVectors(V1, V2, ResVT, NumElems, DAG, dl);
7131 static SDValue LowerCONCAT_VECTORS(SDValue Op, SelectionDAG &DAG) {
7132 MVT LLVM_ATTRIBUTE_UNUSED VT = Op.getSimpleValueType();
7133 assert((VT.is256BitVector() && Op.getNumOperands() == 2) ||
7134 (VT.is512BitVector() && (Op.getNumOperands() == 2 ||
7135 Op.getNumOperands() == 4)));
7137 // AVX can use the vinsertf128 instruction to create 256-bit vectors
7138 // from two other 128-bit ones.
7140 // 512-bit vector may contain 2 256-bit vectors or 4 128-bit vectors
7141 return LowerAVXCONCAT_VECTORS(Op, DAG);
7145 //===----------------------------------------------------------------------===//
7146 // Vector shuffle lowering
7148 // This is an experimental code path for lowering vector shuffles on x86. It is
7149 // designed to handle arbitrary vector shuffles and blends, gracefully
7150 // degrading performance as necessary. It works hard to recognize idiomatic
7151 // shuffles and lower them to optimal instruction patterns without leaving
7152 // a framework that allows reasonably efficient handling of all vector shuffle
7154 //===----------------------------------------------------------------------===//
7156 /// \brief Tiny helper function to identify a no-op mask.
7158 /// This is a somewhat boring predicate function. It checks whether the mask
7159 /// array input, which is assumed to be a single-input shuffle mask of the kind
7160 /// used by the X86 shuffle instructions (not a fully general
7161 /// ShuffleVectorSDNode mask) requires any shuffles to occur. Both undef and an
7162 /// in-place shuffle are 'no-op's.
7163 static bool isNoopShuffleMask(ArrayRef<int> Mask) {
7164 for (int i = 0, Size = Mask.size(); i < Size; ++i)
7165 if (Mask[i] != -1 && Mask[i] != i)
7170 /// \brief Helper function to classify a mask as a single-input mask.
7172 /// This isn't a generic single-input test because in the vector shuffle
7173 /// lowering we canonicalize single inputs to be the first input operand. This
7174 /// means we can more quickly test for a single input by only checking whether
7175 /// an input from the second operand exists. We also assume that the size of
7176 /// mask corresponds to the size of the input vectors which isn't true in the
7177 /// fully general case.
7178 static bool isSingleInputShuffleMask(ArrayRef<int> Mask) {
7180 if (M >= (int)Mask.size())
7185 // Hide this symbol with an anonymous namespace instead of 'static' so that MSVC
7186 // 2013 will allow us to use it as a non-type template parameter.
7189 /// \brief Implementation of the \c isShuffleEquivalent variadic functor.
7191 /// See its documentation for details.
7192 bool isShuffleEquivalentImpl(ArrayRef<int> Mask, ArrayRef<const int *> Args) {
7193 if (Mask.size() != Args.size())
7195 for (int i = 0, e = Mask.size(); i < e; ++i) {
7196 assert(*Args[i] >= 0 && "Arguments must be positive integers!");
7197 assert(*Args[i] < (int)Args.size() * 2 &&
7198 "Argument outside the range of possible shuffle inputs!");
7199 if (Mask[i] != -1 && Mask[i] != *Args[i])
7207 /// \brief Checks whether a shuffle mask is equivalent to an explicit list of
7210 /// This is a fast way to test a shuffle mask against a fixed pattern:
7212 /// if (isShuffleEquivalent(Mask, 3, 2, 1, 0)) { ... }
7214 /// It returns true if the mask is exactly as wide as the argument list, and
7215 /// each element of the mask is either -1 (signifying undef) or the value given
7216 /// in the argument.
7217 static const VariadicFunction1<
7218 bool, ArrayRef<int>, int, isShuffleEquivalentImpl> isShuffleEquivalent = {};
7220 /// \brief Get a 4-lane 8-bit shuffle immediate for a mask.
7222 /// This helper function produces an 8-bit shuffle immediate corresponding to
7223 /// the ubiquitous shuffle encoding scheme used in x86 instructions for
7224 /// shuffling 4 lanes. It can be used with most of the PSHUF instructions for
7227 /// NB: We rely heavily on "undef" masks preserving the input lane.
7228 static SDValue getV4X86ShuffleImm8ForMask(ArrayRef<int> Mask,
7229 SelectionDAG &DAG) {
7230 assert(Mask.size() == 4 && "Only 4-lane shuffle masks");
7231 assert(Mask[0] >= -1 && Mask[0] < 4 && "Out of bound mask element!");
7232 assert(Mask[1] >= -1 && Mask[1] < 4 && "Out of bound mask element!");
7233 assert(Mask[2] >= -1 && Mask[2] < 4 && "Out of bound mask element!");
7234 assert(Mask[3] >= -1 && Mask[3] < 4 && "Out of bound mask element!");
7237 Imm |= (Mask[0] == -1 ? 0 : Mask[0]) << 0;
7238 Imm |= (Mask[1] == -1 ? 1 : Mask[1]) << 2;
7239 Imm |= (Mask[2] == -1 ? 2 : Mask[2]) << 4;
7240 Imm |= (Mask[3] == -1 ? 3 : Mask[3]) << 6;
7241 return DAG.getConstant(Imm, MVT::i8);
7244 /// \brief Handle lowering of 2-lane 64-bit floating point shuffles.
7246 /// This is the basis function for the 2-lane 64-bit shuffles as we have full
7247 /// support for floating point shuffles but not integer shuffles. These
7248 /// instructions will incur a domain crossing penalty on some chips though so
7249 /// it is better to avoid lowering through this for integer vectors where
7251 static SDValue lowerV2F64VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
7252 const X86Subtarget *Subtarget,
7253 SelectionDAG &DAG) {
7255 assert(Op.getSimpleValueType() == MVT::v2f64 && "Bad shuffle type!");
7256 assert(V1.getSimpleValueType() == MVT::v2f64 && "Bad operand type!");
7257 assert(V2.getSimpleValueType() == MVT::v2f64 && "Bad operand type!");
7258 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
7259 ArrayRef<int> Mask = SVOp->getMask();
7260 assert(Mask.size() == 2 && "Unexpected mask size for v2 shuffle!");
7262 if (isSingleInputShuffleMask(Mask)) {
7263 // Straight shuffle of a single input vector. Simulate this by using the
7264 // single input as both of the "inputs" to this instruction..
7265 unsigned SHUFPDMask = (Mask[0] == 1) | ((Mask[1] == 1) << 1);
7266 return DAG.getNode(X86ISD::SHUFP, SDLoc(Op), MVT::v2f64, V1, V1,
7267 DAG.getConstant(SHUFPDMask, MVT::i8));
7269 assert(Mask[0] >= 0 && Mask[0] < 2 && "Non-canonicalized blend!");
7270 assert(Mask[1] >= 2 && "Non-canonicalized blend!");
7272 // Use dedicated unpack instructions for masks that match their pattern.
7273 if (isShuffleEquivalent(Mask, 0, 2))
7274 return DAG.getNode(X86ISD::UNPCKL, DL, MVT::v2f64, V1, V2);
7275 if (isShuffleEquivalent(Mask, 1, 3))
7276 return DAG.getNode(X86ISD::UNPCKH, DL, MVT::v2f64, V1, V2);
7278 unsigned SHUFPDMask = (Mask[0] == 1) | (((Mask[1] - 2) == 1) << 1);
7279 return DAG.getNode(X86ISD::SHUFP, SDLoc(Op), MVT::v2f64, V1, V2,
7280 DAG.getConstant(SHUFPDMask, MVT::i8));
7283 /// \brief Handle lowering of 2-lane 64-bit integer shuffles.
7285 /// Tries to lower a 2-lane 64-bit shuffle using shuffle operations provided by
7286 /// the integer unit to minimize domain crossing penalties. However, for blends
7287 /// it falls back to the floating point shuffle operation with appropriate bit
7289 static SDValue lowerV2I64VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
7290 const X86Subtarget *Subtarget,
7291 SelectionDAG &DAG) {
7293 assert(Op.getSimpleValueType() == MVT::v2i64 && "Bad shuffle type!");
7294 assert(V1.getSimpleValueType() == MVT::v2i64 && "Bad operand type!");
7295 assert(V2.getSimpleValueType() == MVT::v2i64 && "Bad operand type!");
7296 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
7297 ArrayRef<int> Mask = SVOp->getMask();
7298 assert(Mask.size() == 2 && "Unexpected mask size for v2 shuffle!");
7300 if (isSingleInputShuffleMask(Mask)) {
7301 // Straight shuffle of a single input vector. For everything from SSE2
7302 // onward this has a single fast instruction with no scary immediates.
7303 // We have to map the mask as it is actually a v4i32 shuffle instruction.
7304 V1 = DAG.getNode(ISD::BITCAST, DL, MVT::v4i32, V1);
7305 int WidenedMask[4] = {
7306 std::max(Mask[0], 0) * 2, std::max(Mask[0], 0) * 2 + 1,
7307 std::max(Mask[1], 0) * 2, std::max(Mask[1], 0) * 2 + 1};
7309 ISD::BITCAST, DL, MVT::v2i64,
7310 DAG.getNode(X86ISD::PSHUFD, SDLoc(Op), MVT::v4i32, V1,
7311 getV4X86ShuffleImm8ForMask(WidenedMask, DAG)));
7314 // Use dedicated unpack instructions for masks that match their pattern.
7315 if (isShuffleEquivalent(Mask, 0, 2))
7316 return DAG.getNode(X86ISD::UNPCKL, DL, MVT::v2i64, V1, V2);
7317 if (isShuffleEquivalent(Mask, 1, 3))
7318 return DAG.getNode(X86ISD::UNPCKH, DL, MVT::v2i64, V1, V2);
7320 // We implement this with SHUFPD which is pretty lame because it will likely
7321 // incur 2 cycles of stall for integer vectors on Nehalem and older chips.
7322 // However, all the alternatives are still more cycles and newer chips don't
7323 // have this problem. It would be really nice if x86 had better shuffles here.
7324 V1 = DAG.getNode(ISD::BITCAST, DL, MVT::v2f64, V1);
7325 V2 = DAG.getNode(ISD::BITCAST, DL, MVT::v2f64, V2);
7326 return DAG.getNode(ISD::BITCAST, DL, MVT::v2i64,
7327 DAG.getVectorShuffle(MVT::v2f64, DL, V1, V2, Mask));
7330 /// \brief Lower 4-lane 32-bit floating point shuffles.
7332 /// Uses instructions exclusively from the floating point unit to minimize
7333 /// domain crossing penalties, as these are sufficient to implement all v4f32
7335 static SDValue lowerV4F32VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
7336 const X86Subtarget *Subtarget,
7337 SelectionDAG &DAG) {
7339 assert(Op.getSimpleValueType() == MVT::v4f32 && "Bad shuffle type!");
7340 assert(V1.getSimpleValueType() == MVT::v4f32 && "Bad operand type!");
7341 assert(V2.getSimpleValueType() == MVT::v4f32 && "Bad operand type!");
7342 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
7343 ArrayRef<int> Mask = SVOp->getMask();
7344 assert(Mask.size() == 4 && "Unexpected mask size for v4 shuffle!");
7346 SDValue LowV = V1, HighV = V2;
7347 int NewMask[4] = {Mask[0], Mask[1], Mask[2], Mask[3]};
7350 std::count_if(Mask.begin(), Mask.end(), [](int M) { return M >= 4; });
7352 if (NumV2Elements == 0)
7353 // Straight shuffle of a single input vector. We pass the input vector to
7354 // both operands to simulate this with a SHUFPS.
7355 return DAG.getNode(X86ISD::SHUFP, DL, MVT::v4f32, V1, V1,
7356 getV4X86ShuffleImm8ForMask(Mask, DAG));
7358 // Use dedicated unpack instructions for masks that match their pattern.
7359 if (isShuffleEquivalent(Mask, 0, 4, 1, 5))
7360 return DAG.getNode(X86ISD::UNPCKL, DL, MVT::v4f32, V1, V2);
7361 if (isShuffleEquivalent(Mask, 2, 6, 3, 7))
7362 return DAG.getNode(X86ISD::UNPCKH, DL, MVT::v4f32, V1, V2);
7364 if (NumV2Elements == 1) {
7366 std::find_if(Mask.begin(), Mask.end(), [](int M) { return M >= 4; }) -
7369 // Check for whether we can use INSERTPS to perform the blend. We only use
7370 // INSERTPS when the V1 elements are already in the correct locations
7371 // because otherwise we can just always use two SHUFPS instructions which
7372 // are much smaller to encode than a SHUFPS and an INSERTPS.
7373 if (Subtarget->hasSSE41()) {
7374 // When using INSERTPS we can zero any lane of the destination. Collect
7375 // the zero inputs into a mask and drop them from the lanes of V1 which
7376 // actually need to be present as inputs to the INSERTPS.
7378 if (ISD::isBuildVectorAllZeros(V1.getNode())) {
7379 ZMask = 0xF ^ (1 << V2Index);
7380 } else if (V1.getOpcode() == ISD::BUILD_VECTOR) {
7381 for (int i = 0; i < 4; ++i) {
7386 SDValue Input = V1.getOperand(M);
7387 if (Input.getOpcode() != ISD::UNDEF &&
7388 !X86::isZeroNode(Input)) {
7389 // A non-zero input!
7398 // Synthesize a shuffle mask for the non-zero and non-v2 inputs.
7399 int InsertShuffleMask[4] = {-1, -1, -1, -1};
7400 for (int i = 0; i < 4; ++i)
7401 if (i != V2Index && (ZMask & (1 << i)) == 0)
7402 InsertShuffleMask[i] = Mask[i];
7404 if (isNoopShuffleMask(InsertShuffleMask)) {
7405 // Replace V1 with undef if nothing from V1 survives the INSERTPS.
7406 if ((ZMask | 1 << V2Index) == 0xF)
7407 V1 = DAG.getUNDEF(MVT::v4f32);
7409 // Insert the V2 element into the desired position.
7410 SDValue InsertPSMask =
7411 DAG.getIntPtrConstant(Mask[V2Index] << 6 | V2Index << 4 | ZMask);
7412 return DAG.getNode(X86ISD::INSERTPS, DL, MVT::v4f32, V1, V2,
7417 // Compute the index adjacent to V2Index and in the same half by toggling
7419 int V2AdjIndex = V2Index ^ 1;
7421 if (Mask[V2AdjIndex] == -1) {
7422 // Handles all the cases where we have a single V2 element and an undef.
7423 // This will only ever happen in the high lanes because we commute the
7424 // vector otherwise.
7426 std::swap(LowV, HighV);
7427 NewMask[V2Index] -= 4;
7429 // Handle the case where the V2 element ends up adjacent to a V1 element.
7430 // To make this work, blend them together as the first step.
7431 int V1Index = V2AdjIndex;
7432 int BlendMask[4] = {Mask[V2Index] - 4, 0, Mask[V1Index], 0};
7433 V2 = DAG.getNode(X86ISD::SHUFP, DL, MVT::v4f32, V2, V1,
7434 getV4X86ShuffleImm8ForMask(BlendMask, DAG));
7436 // Now proceed to reconstruct the final blend as we have the necessary
7437 // high or low half formed.
7444 NewMask[V1Index] = 2; // We put the V1 element in V2[2].
7445 NewMask[V2Index] = 0; // We shifted the V2 element into V2[0].
7447 } else if (NumV2Elements == 2) {
7448 if (Mask[0] < 4 && Mask[1] < 4) {
7449 // Handle the easy case where we have V1 in the low lanes and V2 in the
7450 // high lanes. We never see this reversed because we sort the shuffle.
7454 // We have a mixture of V1 and V2 in both low and high lanes. Rather than
7455 // trying to place elements directly, just blend them and set up the final
7456 // shuffle to place them.
7458 // The first two blend mask elements are for V1, the second two are for
7460 int BlendMask[4] = {Mask[0] < 4 ? Mask[0] : Mask[1],
7461 Mask[2] < 4 ? Mask[2] : Mask[3],
7462 (Mask[0] >= 4 ? Mask[0] : Mask[1]) - 4,
7463 (Mask[2] >= 4 ? Mask[2] : Mask[3]) - 4};
7464 V1 = DAG.getNode(X86ISD::SHUFP, DL, MVT::v4f32, V1, V2,
7465 getV4X86ShuffleImm8ForMask(BlendMask, DAG));
7467 // Now we do a normal shuffle of V1 by giving V1 as both operands to
7470 NewMask[0] = Mask[0] < 4 ? 0 : 2;
7471 NewMask[1] = Mask[0] < 4 ? 2 : 0;
7472 NewMask[2] = Mask[2] < 4 ? 1 : 3;
7473 NewMask[3] = Mask[2] < 4 ? 3 : 1;
7476 return DAG.getNode(X86ISD::SHUFP, DL, MVT::v4f32, LowV, HighV,
7477 getV4X86ShuffleImm8ForMask(NewMask, DAG));
7480 /// \brief Lower 4-lane i32 vector shuffles.
7482 /// We try to handle these with integer-domain shuffles where we can, but for
7483 /// blends we use the floating point domain blend instructions.
7484 static SDValue lowerV4I32VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
7485 const X86Subtarget *Subtarget,
7486 SelectionDAG &DAG) {
7488 assert(Op.getSimpleValueType() == MVT::v4i32 && "Bad shuffle type!");
7489 assert(V1.getSimpleValueType() == MVT::v4i32 && "Bad operand type!");
7490 assert(V2.getSimpleValueType() == MVT::v4i32 && "Bad operand type!");
7491 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
7492 ArrayRef<int> Mask = SVOp->getMask();
7493 assert(Mask.size() == 4 && "Unexpected mask size for v4 shuffle!");
7495 if (isSingleInputShuffleMask(Mask))
7496 // Straight shuffle of a single input vector. For everything from SSE2
7497 // onward this has a single fast instruction with no scary immediates.
7498 return DAG.getNode(X86ISD::PSHUFD, DL, MVT::v4i32, V1,
7499 getV4X86ShuffleImm8ForMask(Mask, DAG));
7501 // Use dedicated unpack instructions for masks that match their pattern.
7502 if (isShuffleEquivalent(Mask, 0, 4, 1, 5))
7503 return DAG.getNode(X86ISD::UNPCKL, DL, MVT::v4i32, V1, V2);
7504 if (isShuffleEquivalent(Mask, 2, 6, 3, 7))
7505 return DAG.getNode(X86ISD::UNPCKH, DL, MVT::v4i32, V1, V2);
7507 // We implement this with SHUFPS because it can blend from two vectors.
7508 // Because we're going to eventually use SHUFPS, we use SHUFPS even to build
7509 // up the inputs, bypassing domain shift penalties that we would encur if we
7510 // directly used PSHUFD on Nehalem and older. For newer chips, this isn't
7512 return DAG.getNode(ISD::BITCAST, DL, MVT::v4i32,
7513 DAG.getVectorShuffle(
7515 DAG.getNode(ISD::BITCAST, DL, MVT::v4f32, V1),
7516 DAG.getNode(ISD::BITCAST, DL, MVT::v4f32, V2), Mask));
7519 /// \brief Lowering of single-input v8i16 shuffles is the cornerstone of SSE2
7520 /// shuffle lowering, and the most complex part.
7522 /// The lowering strategy is to try to form pairs of input lanes which are
7523 /// targeted at the same half of the final vector, and then use a dword shuffle
7524 /// to place them onto the right half, and finally unpack the paired lanes into
7525 /// their final position.
7527 /// The exact breakdown of how to form these dword pairs and align them on the
7528 /// correct sides is really tricky. See the comments within the function for
7529 /// more of the details.
7530 static SDValue lowerV8I16SingleInputVectorShuffle(
7531 SDLoc DL, SDValue V, MutableArrayRef<int> Mask,
7532 const X86Subtarget *Subtarget, SelectionDAG &DAG) {
7533 assert(V.getSimpleValueType() == MVT::v8i16 && "Bad input type!");
7534 MutableArrayRef<int> LoMask = Mask.slice(0, 4);
7535 MutableArrayRef<int> HiMask = Mask.slice(4, 4);
7537 SmallVector<int, 4> LoInputs;
7538 std::copy_if(LoMask.begin(), LoMask.end(), std::back_inserter(LoInputs),
7539 [](int M) { return M >= 0; });
7540 std::sort(LoInputs.begin(), LoInputs.end());
7541 LoInputs.erase(std::unique(LoInputs.begin(), LoInputs.end()), LoInputs.end());
7542 SmallVector<int, 4> HiInputs;
7543 std::copy_if(HiMask.begin(), HiMask.end(), std::back_inserter(HiInputs),
7544 [](int M) { return M >= 0; });
7545 std::sort(HiInputs.begin(), HiInputs.end());
7546 HiInputs.erase(std::unique(HiInputs.begin(), HiInputs.end()), HiInputs.end());
7548 std::lower_bound(LoInputs.begin(), LoInputs.end(), 4) - LoInputs.begin();
7549 int NumHToL = LoInputs.size() - NumLToL;
7551 std::lower_bound(HiInputs.begin(), HiInputs.end(), 4) - HiInputs.begin();
7552 int NumHToH = HiInputs.size() - NumLToH;
7553 MutableArrayRef<int> LToLInputs(LoInputs.data(), NumLToL);
7554 MutableArrayRef<int> LToHInputs(HiInputs.data(), NumLToH);
7555 MutableArrayRef<int> HToLInputs(LoInputs.data() + NumLToL, NumHToL);
7556 MutableArrayRef<int> HToHInputs(HiInputs.data() + NumLToH, NumHToH);
7558 // Simplify the 1-into-3 and 3-into-1 cases with a single pshufd. For all
7559 // such inputs we can swap two of the dwords across the half mark and end up
7560 // with <=2 inputs to each half in each half. Once there, we can fall through
7561 // to the generic code below. For example:
7563 // Input: [a, b, c, d, e, f, g, h] -PSHUFD[0,2,1,3]-> [a, b, e, f, c, d, g, h]
7564 // Mask: [0, 1, 2, 7, 4, 5, 6, 3] -----------------> [0, 1, 4, 7, 2, 3, 6, 5]
7566 // However in some very rare cases we have a 1-into-3 or 3-into-1 on one half
7567 // and an existing 2-into-2 on the other half. In this case we may have to
7568 // pre-shuffle the 2-into-2 half to avoid turning it into a 3-into-1 or
7569 // 1-into-3 which could cause us to cycle endlessly fixing each side in turn.
7570 // Fortunately, we don't have to handle anything but a 2-into-2 pattern
7571 // because any other situation (including a 3-into-1 or 1-into-3 in the other
7572 // half than the one we target for fixing) will be fixed when we re-enter this
7573 // path. We will also combine away any sequence of PSHUFD instructions that
7574 // result into a single instruction. Here is an example of the tricky case:
7576 // Input: [a, b, c, d, e, f, g, h] -PSHUFD[0,2,1,3]-> [a, b, e, f, c, d, g, h]
7577 // Mask: [3, 7, 1, 0, 2, 7, 3, 5] -THIS-IS-BAD!!!!-> [5, 7, 1, 0, 4, 7, 5, 3]
7579 // This now has a 1-into-3 in the high half! Instead, we do two shuffles:
7581 // Input: [a, b, c, d, e, f, g, h] PSHUFHW[0,2,1,3]-> [a, b, c, d, e, g, f, h]
7582 // Mask: [3, 7, 1, 0, 2, 7, 3, 5] -----------------> [3, 7, 1, 0, 2, 7, 3, 6]
7584 // Input: [a, b, c, d, e, g, f, h] -PSHUFD[0,2,1,3]-> [a, b, e, g, c, d, f, h]
7585 // Mask: [3, 7, 1, 0, 2, 7, 3, 6] -----------------> [5, 7, 1, 0, 4, 7, 5, 6]
7587 // The result is fine to be handled by the generic logic.
7588 auto balanceSides = [&](ArrayRef<int> AToAInputs, ArrayRef<int> BToAInputs,
7589 ArrayRef<int> BToBInputs, ArrayRef<int> AToBInputs,
7590 int AOffset, int BOffset) {
7591 assert((AToAInputs.size() == 3 || AToAInputs.size() == 1) &&
7592 "Must call this with A having 3 or 1 inputs from the A half.");
7593 assert((BToAInputs.size() == 1 || BToAInputs.size() == 3) &&
7594 "Must call this with B having 1 or 3 inputs from the B half.");
7595 assert(AToAInputs.size() + BToAInputs.size() == 4 &&
7596 "Must call this with either 3:1 or 1:3 inputs (summing to 4).");
7598 // Compute the index of dword with only one word among the three inputs in
7599 // a half by taking the sum of the half with three inputs and subtracting
7600 // the sum of the actual three inputs. The difference is the remaining
7603 int &TripleDWord = AToAInputs.size() == 3 ? ADWord : BDWord;
7604 int &OneInputDWord = AToAInputs.size() == 3 ? BDWord : ADWord;
7605 int TripleInputOffset = AToAInputs.size() == 3 ? AOffset : BOffset;
7606 ArrayRef<int> TripleInputs = AToAInputs.size() == 3 ? AToAInputs : BToAInputs;
7607 int OneInput = AToAInputs.size() == 3 ? BToAInputs[0] : AToAInputs[0];
7608 int TripleInputSum = 0 + 1 + 2 + 3 + (4 * TripleInputOffset);
7609 int TripleNonInputIdx =
7610 TripleInputSum - std::accumulate(TripleInputs.begin(), TripleInputs.end(), 0);
7611 TripleDWord = TripleNonInputIdx / 2;
7613 // We use xor with one to compute the adjacent DWord to whichever one the
7615 OneInputDWord = (OneInput / 2) ^ 1;
7617 // Check for one tricky case: We're fixing a 3<-1 or a 1<-3 shuffle for AToA
7618 // and BToA inputs. If there is also such a problem with the BToB and AToB
7619 // inputs, we don't try to fix it necessarily -- we'll recurse and see it in
7620 // the next pass. However, if we have a 2<-2 in the BToB and AToB inputs, it
7621 // is essential that we don't *create* a 3<-1 as then we might oscillate.
7622 if (BToBInputs.size() == 2 && AToBInputs.size() == 2) {
7623 // Compute how many inputs will be flipped by swapping these DWords. We
7625 // to balance this to ensure we don't form a 3-1 shuffle in the other
7627 int NumFlippedAToBInputs =
7628 std::count(AToBInputs.begin(), AToBInputs.end(), 2 * ADWord) +
7629 std::count(AToBInputs.begin(), AToBInputs.end(), 2 * ADWord + 1);
7630 int NumFlippedBToBInputs =
7631 std::count(BToBInputs.begin(), BToBInputs.end(), 2 * BDWord) +
7632 std::count(BToBInputs.begin(), BToBInputs.end(), 2 * BDWord + 1);
7633 if ((NumFlippedAToBInputs == 1 &&
7634 (NumFlippedBToBInputs == 0 || NumFlippedBToBInputs == 2)) ||
7635 (NumFlippedBToBInputs == 1 &&
7636 (NumFlippedAToBInputs == 0 || NumFlippedAToBInputs == 2))) {
7637 // We choose whether to fix the A half or B half based on whether that
7638 // half has zero flipped inputs. At zero, we may not be able to fix it
7639 // with that half. We also bias towards fixing the B half because that
7640 // will more commonly be the high half, and we have to bias one way.
7641 auto FixFlippedInputs = [&V, &DL, &Mask, &DAG](int PinnedIdx, int DWord,
7642 ArrayRef<int> Inputs) {
7643 int FixIdx = PinnedIdx ^ 1; // The adjacent slot to the pinned slot.
7644 bool IsFixIdxInput = std::find(Inputs.begin(), Inputs.end(),
7645 PinnedIdx ^ 1) != Inputs.end();
7646 // Determine whether the free index is in the flipped dword or the
7647 // unflipped dword based on where the pinned index is. We use this bit
7648 // in an xor to conditionally select the adjacent dword.
7649 int FixFreeIdx = 2 * (DWord ^ (PinnedIdx / 2 == DWord));
7650 bool IsFixFreeIdxInput = std::find(Inputs.begin(), Inputs.end(),
7651 FixFreeIdx) != Inputs.end();
7652 if (IsFixIdxInput == IsFixFreeIdxInput)
7654 IsFixFreeIdxInput = std::find(Inputs.begin(), Inputs.end(),
7655 FixFreeIdx) != Inputs.end();
7656 assert(IsFixIdxInput != IsFixFreeIdxInput &&
7657 "We need to be changing the number of flipped inputs!");
7658 int PSHUFHalfMask[] = {0, 1, 2, 3};
7659 std::swap(PSHUFHalfMask[FixFreeIdx % 4], PSHUFHalfMask[FixIdx % 4]);
7660 V = DAG.getNode(FixIdx < 4 ? X86ISD::PSHUFLW : X86ISD::PSHUFHW, DL,
7662 getV4X86ShuffleImm8ForMask(PSHUFHalfMask, DAG));
7665 if (M != -1 && M == FixIdx)
7667 else if (M != -1 && M == FixFreeIdx)
7670 if (NumFlippedBToBInputs != 0) {
7672 BToAInputs.size() == 3 ? TripleNonInputIdx : OneInput;
7673 FixFlippedInputs(BPinnedIdx, BDWord, BToBInputs);
7675 assert(NumFlippedAToBInputs != 0 && "Impossible given predicates!");
7677 AToAInputs.size() == 3 ? TripleNonInputIdx : OneInput;
7678 FixFlippedInputs(APinnedIdx, ADWord, AToBInputs);
7683 int PSHUFDMask[] = {0, 1, 2, 3};
7684 PSHUFDMask[ADWord] = BDWord;
7685 PSHUFDMask[BDWord] = ADWord;
7686 V = DAG.getNode(ISD::BITCAST, DL, MVT::v8i16,
7687 DAG.getNode(X86ISD::PSHUFD, DL, MVT::v4i32,
7688 DAG.getNode(ISD::BITCAST, DL, MVT::v4i32, V),
7689 getV4X86ShuffleImm8ForMask(PSHUFDMask, DAG)));
7691 // Adjust the mask to match the new locations of A and B.
7693 if (M != -1 && M/2 == ADWord)
7694 M = 2 * BDWord + M % 2;
7695 else if (M != -1 && M/2 == BDWord)
7696 M = 2 * ADWord + M % 2;
7698 // Recurse back into this routine to re-compute state now that this isn't
7699 // a 3 and 1 problem.
7700 return DAG.getVectorShuffle(MVT::v8i16, DL, V, DAG.getUNDEF(MVT::v8i16),
7703 if ((NumLToL == 3 && NumHToL == 1) || (NumLToL == 1 && NumHToL == 3))
7704 return balanceSides(LToLInputs, HToLInputs, HToHInputs, LToHInputs, 0, 4);
7705 else if ((NumHToH == 3 && NumLToH == 1) || (NumHToH == 1 && NumLToH == 3))
7706 return balanceSides(HToHInputs, LToHInputs, LToLInputs, HToLInputs, 4, 0);
7708 // At this point there are at most two inputs to the low and high halves from
7709 // each half. That means the inputs can always be grouped into dwords and
7710 // those dwords can then be moved to the correct half with a dword shuffle.
7711 // We use at most one low and one high word shuffle to collect these paired
7712 // inputs into dwords, and finally a dword shuffle to place them.
7713 int PSHUFLMask[4] = {-1, -1, -1, -1};
7714 int PSHUFHMask[4] = {-1, -1, -1, -1};
7715 int PSHUFDMask[4] = {-1, -1, -1, -1};
7717 // First fix the masks for all the inputs that are staying in their
7718 // original halves. This will then dictate the targets of the cross-half
7720 auto fixInPlaceInputs =
7721 [&PSHUFDMask](ArrayRef<int> InPlaceInputs, ArrayRef<int> IncomingInputs,
7722 MutableArrayRef<int> SourceHalfMask,
7723 MutableArrayRef<int> HalfMask, int HalfOffset) {
7724 if (InPlaceInputs.empty())
7726 if (InPlaceInputs.size() == 1) {
7727 SourceHalfMask[InPlaceInputs[0] - HalfOffset] =
7728 InPlaceInputs[0] - HalfOffset;
7729 PSHUFDMask[InPlaceInputs[0] / 2] = InPlaceInputs[0] / 2;
7732 if (IncomingInputs.empty()) {
7733 // Just fix all of the in place inputs.
7734 for (int Input : InPlaceInputs) {
7735 SourceHalfMask[Input - HalfOffset] = Input - HalfOffset;
7736 PSHUFDMask[Input / 2] = Input / 2;
7741 assert(InPlaceInputs.size() == 2 && "Cannot handle 3 or 4 inputs!");
7742 SourceHalfMask[InPlaceInputs[0] - HalfOffset] =
7743 InPlaceInputs[0] - HalfOffset;
7744 // Put the second input next to the first so that they are packed into
7745 // a dword. We find the adjacent index by toggling the low bit.
7746 int AdjIndex = InPlaceInputs[0] ^ 1;
7747 SourceHalfMask[AdjIndex - HalfOffset] = InPlaceInputs[1] - HalfOffset;
7748 std::replace(HalfMask.begin(), HalfMask.end(), InPlaceInputs[1], AdjIndex);
7749 PSHUFDMask[AdjIndex / 2] = AdjIndex / 2;
7751 fixInPlaceInputs(LToLInputs, HToLInputs, PSHUFLMask, LoMask, 0);
7752 fixInPlaceInputs(HToHInputs, LToHInputs, PSHUFHMask, HiMask, 4);
7754 // Now gather the cross-half inputs and place them into a free dword of
7755 // their target half.
7756 // FIXME: This operation could almost certainly be simplified dramatically to
7757 // look more like the 3-1 fixing operation.
7758 auto moveInputsToRightHalf = [&PSHUFDMask](
7759 MutableArrayRef<int> IncomingInputs, ArrayRef<int> ExistingInputs,
7760 MutableArrayRef<int> SourceHalfMask, MutableArrayRef<int> HalfMask,
7761 MutableArrayRef<int> FinalSourceHalfMask, int SourceOffset,
7763 auto isWordClobbered = [](ArrayRef<int> SourceHalfMask, int Word) {
7764 return SourceHalfMask[Word] != -1 && SourceHalfMask[Word] != Word;
7766 auto isDWordClobbered = [&isWordClobbered](ArrayRef<int> SourceHalfMask,
7768 int LowWord = Word & ~1;
7769 int HighWord = Word | 1;
7770 return isWordClobbered(SourceHalfMask, LowWord) ||
7771 isWordClobbered(SourceHalfMask, HighWord);
7774 if (IncomingInputs.empty())
7777 if (ExistingInputs.empty()) {
7778 // Map any dwords with inputs from them into the right half.
7779 for (int Input : IncomingInputs) {
7780 // If the source half mask maps over the inputs, turn those into
7781 // swaps and use the swapped lane.
7782 if (isWordClobbered(SourceHalfMask, Input - SourceOffset)) {
7783 if (SourceHalfMask[SourceHalfMask[Input - SourceOffset]] == -1) {
7784 SourceHalfMask[SourceHalfMask[Input - SourceOffset]] =
7785 Input - SourceOffset;
7786 // We have to swap the uses in our half mask in one sweep.
7787 for (int &M : HalfMask)
7788 if (M == SourceHalfMask[Input - SourceOffset] + SourceOffset)
7790 else if (M == Input)
7791 M = SourceHalfMask[Input - SourceOffset] + SourceOffset;
7793 assert(SourceHalfMask[SourceHalfMask[Input - SourceOffset]] ==
7794 Input - SourceOffset &&
7795 "Previous placement doesn't match!");
7797 // Note that this correctly re-maps both when we do a swap and when
7798 // we observe the other side of the swap above. We rely on that to
7799 // avoid swapping the members of the input list directly.
7800 Input = SourceHalfMask[Input - SourceOffset] + SourceOffset;
7803 // Map the input's dword into the correct half.
7804 if (PSHUFDMask[(Input - SourceOffset + DestOffset) / 2] == -1)
7805 PSHUFDMask[(Input - SourceOffset + DestOffset) / 2] = Input / 2;
7807 assert(PSHUFDMask[(Input - SourceOffset + DestOffset) / 2] ==
7809 "Previous placement doesn't match!");
7812 // And just directly shift any other-half mask elements to be same-half
7813 // as we will have mirrored the dword containing the element into the
7814 // same position within that half.
7815 for (int &M : HalfMask)
7816 if (M >= SourceOffset && M < SourceOffset + 4) {
7817 M = M - SourceOffset + DestOffset;
7818 assert(M >= 0 && "This should never wrap below zero!");
7823 // Ensure we have the input in a viable dword of its current half. This
7824 // is particularly tricky because the original position may be clobbered
7825 // by inputs being moved and *staying* in that half.
7826 if (IncomingInputs.size() == 1) {
7827 if (isWordClobbered(SourceHalfMask, IncomingInputs[0] - SourceOffset)) {
7828 int InputFixed = std::find(std::begin(SourceHalfMask),
7829 std::end(SourceHalfMask), -1) -
7830 std::begin(SourceHalfMask) + SourceOffset;
7831 SourceHalfMask[InputFixed - SourceOffset] =
7832 IncomingInputs[0] - SourceOffset;
7833 std::replace(HalfMask.begin(), HalfMask.end(), IncomingInputs[0],
7835 IncomingInputs[0] = InputFixed;
7837 } else if (IncomingInputs.size() == 2) {
7838 if (IncomingInputs[0] / 2 != IncomingInputs[1] / 2 ||
7839 isDWordClobbered(SourceHalfMask, IncomingInputs[0] - SourceOffset)) {
7840 // We have two non-adjacent or clobbered inputs we need to extract from
7841 // the source half. To do this, we need to map them into some adjacent
7842 // dword slot in the source mask.
7843 int InputsFixed[2] = {IncomingInputs[0] - SourceOffset,
7844 IncomingInputs[1] - SourceOffset};
7846 // If there is a free slot in the source half mask adjacent to one of
7847 // the inputs, place the other input in it. We use (Index XOR 1) to
7848 // compute an adjacent index.
7849 if (!isWordClobbered(SourceHalfMask, InputsFixed[0]) &&
7850 SourceHalfMask[InputsFixed[0] ^ 1] == -1) {
7851 SourceHalfMask[InputsFixed[0]] = InputsFixed[0];
7852 SourceHalfMask[InputsFixed[0] ^ 1] = InputsFixed[1];
7853 InputsFixed[1] = InputsFixed[0] ^ 1;
7854 } else if (!isWordClobbered(SourceHalfMask, InputsFixed[1]) &&
7855 SourceHalfMask[InputsFixed[1] ^ 1] == -1) {
7856 SourceHalfMask[InputsFixed[1]] = InputsFixed[1];
7857 SourceHalfMask[InputsFixed[1] ^ 1] = InputsFixed[0];
7858 InputsFixed[0] = InputsFixed[1] ^ 1;
7859 } else if (SourceHalfMask[2 * ((InputsFixed[0] / 2) ^ 1)] == -1 &&
7860 SourceHalfMask[2 * ((InputsFixed[0] / 2) ^ 1) + 1] == -1) {
7861 // The two inputs are in the same DWord but it is clobbered and the
7862 // adjacent DWord isn't used at all. Move both inputs to the free
7864 SourceHalfMask[2 * ((InputsFixed[0] / 2) ^ 1)] = InputsFixed[0];
7865 SourceHalfMask[2 * ((InputsFixed[0] / 2) ^ 1) + 1] = InputsFixed[1];
7866 InputsFixed[0] = 2 * ((InputsFixed[0] / 2) ^ 1);
7867 InputsFixed[1] = 2 * ((InputsFixed[0] / 2) ^ 1) + 1;
7869 // The only way we hit this point is if there is no clobbering
7870 // (because there are no off-half inputs to this half) and there is no
7871 // free slot adjacent to one of the inputs. In this case, we have to
7872 // swap an input with a non-input.
7873 for (int i = 0; i < 4; ++i)
7874 assert((SourceHalfMask[i] == -1 || SourceHalfMask[i] == i) &&
7875 "We can't handle any clobbers here!");
7876 assert(InputsFixed[1] != (InputsFixed[0] ^ 1) &&
7877 "Cannot have adjacent inputs here!");
7879 SourceHalfMask[InputsFixed[0] ^ 1] = InputsFixed[1];
7880 SourceHalfMask[InputsFixed[1]] = InputsFixed[0] ^ 1;
7882 // We also have to update the final source mask in this case because
7883 // it may need to undo the above swap.
7884 for (int &M : FinalSourceHalfMask)
7885 if (M == (InputsFixed[0] ^ 1) + SourceOffset)
7886 M = InputsFixed[1] + SourceOffset;
7887 else if (M == InputsFixed[1] + SourceOffset)
7888 M = (InputsFixed[0] ^ 1) + SourceOffset;
7890 InputsFixed[1] = InputsFixed[0] ^ 1;
7893 // Point everything at the fixed inputs.
7894 for (int &M : HalfMask)
7895 if (M == IncomingInputs[0])
7896 M = InputsFixed[0] + SourceOffset;
7897 else if (M == IncomingInputs[1])
7898 M = InputsFixed[1] + SourceOffset;
7900 IncomingInputs[0] = InputsFixed[0] + SourceOffset;
7901 IncomingInputs[1] = InputsFixed[1] + SourceOffset;
7904 llvm_unreachable("Unhandled input size!");
7907 // Now hoist the DWord down to the right half.
7908 int FreeDWord = (PSHUFDMask[DestOffset / 2] == -1 ? 0 : 1) + DestOffset / 2;
7909 assert(PSHUFDMask[FreeDWord] == -1 && "DWord not free");
7910 PSHUFDMask[FreeDWord] = IncomingInputs[0] / 2;
7911 for (int &M : HalfMask)
7912 for (int Input : IncomingInputs)
7914 M = FreeDWord * 2 + Input % 2;
7916 moveInputsToRightHalf(HToLInputs, LToLInputs, PSHUFHMask, LoMask, HiMask,
7917 /*SourceOffset*/ 4, /*DestOffset*/ 0);
7918 moveInputsToRightHalf(LToHInputs, HToHInputs, PSHUFLMask, HiMask, LoMask,
7919 /*SourceOffset*/ 0, /*DestOffset*/ 4);
7921 // Now enact all the shuffles we've computed to move the inputs into their
7923 if (!isNoopShuffleMask(PSHUFLMask))
7924 V = DAG.getNode(X86ISD::PSHUFLW, DL, MVT::v8i16, V,
7925 getV4X86ShuffleImm8ForMask(PSHUFLMask, DAG));
7926 if (!isNoopShuffleMask(PSHUFHMask))
7927 V = DAG.getNode(X86ISD::PSHUFHW, DL, MVT::v8i16, V,
7928 getV4X86ShuffleImm8ForMask(PSHUFHMask, DAG));
7929 if (!isNoopShuffleMask(PSHUFDMask))
7930 V = DAG.getNode(ISD::BITCAST, DL, MVT::v8i16,
7931 DAG.getNode(X86ISD::PSHUFD, DL, MVT::v4i32,
7932 DAG.getNode(ISD::BITCAST, DL, MVT::v4i32, V),
7933 getV4X86ShuffleImm8ForMask(PSHUFDMask, DAG)));
7935 // At this point, each half should contain all its inputs, and we can then
7936 // just shuffle them into their final position.
7937 assert(std::count_if(LoMask.begin(), LoMask.end(),
7938 [](int M) { return M >= 4; }) == 0 &&
7939 "Failed to lift all the high half inputs to the low mask!");
7940 assert(std::count_if(HiMask.begin(), HiMask.end(),
7941 [](int M) { return M >= 0 && M < 4; }) == 0 &&
7942 "Failed to lift all the low half inputs to the high mask!");
7944 // Do a half shuffle for the low mask.
7945 if (!isNoopShuffleMask(LoMask))
7946 V = DAG.getNode(X86ISD::PSHUFLW, DL, MVT::v8i16, V,
7947 getV4X86ShuffleImm8ForMask(LoMask, DAG));
7949 // Do a half shuffle with the high mask after shifting its values down.
7950 for (int &M : HiMask)
7953 if (!isNoopShuffleMask(HiMask))
7954 V = DAG.getNode(X86ISD::PSHUFHW, DL, MVT::v8i16, V,
7955 getV4X86ShuffleImm8ForMask(HiMask, DAG));
7960 /// \brief Detect whether the mask pattern should be lowered through
7963 /// This essentially tests whether viewing the mask as an interleaving of two
7964 /// sub-sequences reduces the cross-input traffic of a blend operation. If so,
7965 /// lowering it through interleaving is a significantly better strategy.
7966 static bool shouldLowerAsInterleaving(ArrayRef<int> Mask) {
7967 int NumEvenInputs[2] = {0, 0};
7968 int NumOddInputs[2] = {0, 0};
7969 int NumLoInputs[2] = {0, 0};
7970 int NumHiInputs[2] = {0, 0};
7971 for (int i = 0, Size = Mask.size(); i < Size; ++i) {
7975 int InputIdx = Mask[i] >= Size;
7978 ++NumLoInputs[InputIdx];
7980 ++NumHiInputs[InputIdx];
7983 ++NumEvenInputs[InputIdx];
7985 ++NumOddInputs[InputIdx];
7988 // The minimum number of cross-input results for both the interleaved and
7989 // split cases. If interleaving results in fewer cross-input results, return
7991 int InterleavedCrosses = std::min(NumEvenInputs[1] + NumOddInputs[0],
7992 NumEvenInputs[0] + NumOddInputs[1]);
7993 int SplitCrosses = std::min(NumLoInputs[1] + NumHiInputs[0],
7994 NumLoInputs[0] + NumHiInputs[1]);
7995 return InterleavedCrosses < SplitCrosses;
7998 /// \brief Blend two v8i16 vectors using a naive unpack strategy.
8000 /// This strategy only works when the inputs from each vector fit into a single
8001 /// half of that vector, and generally there are not so many inputs as to leave
8002 /// the in-place shuffles required highly constrained (and thus expensive). It
8003 /// shifts all the inputs into a single side of both input vectors and then
8004 /// uses an unpack to interleave these inputs in a single vector. At that
8005 /// point, we will fall back on the generic single input shuffle lowering.
8006 static SDValue lowerV8I16BasicBlendVectorShuffle(SDLoc DL, SDValue V1,
8008 MutableArrayRef<int> Mask,
8009 const X86Subtarget *Subtarget,
8010 SelectionDAG &DAG) {
8011 assert(V1.getSimpleValueType() == MVT::v8i16 && "Bad input type!");
8012 assert(V2.getSimpleValueType() == MVT::v8i16 && "Bad input type!");
8013 SmallVector<int, 3> LoV1Inputs, HiV1Inputs, LoV2Inputs, HiV2Inputs;
8014 for (int i = 0; i < 8; ++i)
8015 if (Mask[i] >= 0 && Mask[i] < 4)
8016 LoV1Inputs.push_back(i);
8017 else if (Mask[i] >= 4 && Mask[i] < 8)
8018 HiV1Inputs.push_back(i);
8019 else if (Mask[i] >= 8 && Mask[i] < 12)
8020 LoV2Inputs.push_back(i);
8021 else if (Mask[i] >= 12)
8022 HiV2Inputs.push_back(i);
8024 int NumV1Inputs = LoV1Inputs.size() + HiV1Inputs.size();
8025 int NumV2Inputs = LoV2Inputs.size() + HiV2Inputs.size();
8028 assert(NumV1Inputs > 0 && NumV1Inputs <= 3 && "At most 3 inputs supported");
8029 assert(NumV2Inputs > 0 && NumV2Inputs <= 3 && "At most 3 inputs supported");
8030 assert(NumV1Inputs + NumV2Inputs <= 4 && "At most 4 combined inputs");
8032 bool MergeFromLo = LoV1Inputs.size() + LoV2Inputs.size() >=
8033 HiV1Inputs.size() + HiV2Inputs.size();
8035 auto moveInputsToHalf = [&](SDValue V, ArrayRef<int> LoInputs,
8036 ArrayRef<int> HiInputs, bool MoveToLo,
8038 ArrayRef<int> GoodInputs = MoveToLo ? LoInputs : HiInputs;
8039 ArrayRef<int> BadInputs = MoveToLo ? HiInputs : LoInputs;
8040 if (BadInputs.empty())
8043 int MoveMask[] = {-1, -1, -1, -1, -1, -1, -1, -1};
8044 int MoveOffset = MoveToLo ? 0 : 4;
8046 if (GoodInputs.empty()) {
8047 for (int BadInput : BadInputs) {
8048 MoveMask[Mask[BadInput] % 4 + MoveOffset] = Mask[BadInput] - MaskOffset;
8049 Mask[BadInput] = Mask[BadInput] % 4 + MoveOffset + MaskOffset;
8052 if (GoodInputs.size() == 2) {
8053 // If the low inputs are spread across two dwords, pack them into
8055 MoveMask[MoveOffset] = Mask[GoodInputs[0]] - MaskOffset;
8056 MoveMask[MoveOffset + 1] = Mask[GoodInputs[1]] - MaskOffset;
8057 Mask[GoodInputs[0]] = MoveOffset + MaskOffset;
8058 Mask[GoodInputs[1]] = MoveOffset + 1 + MaskOffset;
8060 // Otherwise pin the good inputs.
8061 for (int GoodInput : GoodInputs)
8062 MoveMask[Mask[GoodInput] - MaskOffset] = Mask[GoodInput] - MaskOffset;
8065 if (BadInputs.size() == 2) {
8066 // If we have two bad inputs then there may be either one or two good
8067 // inputs fixed in place. Find a fixed input, and then find the *other*
8068 // two adjacent indices by using modular arithmetic.
8070 std::find_if(std::begin(MoveMask) + MoveOffset, std::end(MoveMask),
8071 [](int M) { return M >= 0; }) -
8072 std::begin(MoveMask);
8074 ((((GoodMaskIdx - MoveOffset) & ~1) + 2) % 4) + MoveOffset;
8075 assert(MoveMask[MoveMaskIdx] == -1 && "Expected empty slot");
8076 assert(MoveMask[MoveMaskIdx + 1] == -1 && "Expected empty slot");
8077 MoveMask[MoveMaskIdx] = Mask[BadInputs[0]] - MaskOffset;
8078 MoveMask[MoveMaskIdx + 1] = Mask[BadInputs[1]] - MaskOffset;
8079 Mask[BadInputs[0]] = MoveMaskIdx + MaskOffset;
8080 Mask[BadInputs[1]] = MoveMaskIdx + 1 + MaskOffset;
8082 assert(BadInputs.size() == 1 && "All sizes handled");
8083 int MoveMaskIdx = std::find(std::begin(MoveMask) + MoveOffset,
8084 std::end(MoveMask), -1) -
8085 std::begin(MoveMask);
8086 MoveMask[MoveMaskIdx] = Mask[BadInputs[0]] - MaskOffset;
8087 Mask[BadInputs[0]] = MoveMaskIdx + MaskOffset;
8091 return DAG.getVectorShuffle(MVT::v8i16, DL, V, DAG.getUNDEF(MVT::v8i16),
8094 V1 = moveInputsToHalf(V1, LoV1Inputs, HiV1Inputs, MergeFromLo,
8096 V2 = moveInputsToHalf(V2, LoV2Inputs, HiV2Inputs, MergeFromLo,
8099 // FIXME: Select an interleaving of the merge of V1 and V2 that minimizes
8100 // cross-half traffic in the final shuffle.
8102 // Munge the mask to be a single-input mask after the unpack merges the
8106 M = 2 * (M % 4) + (M / 8);
8108 return DAG.getVectorShuffle(
8109 MVT::v8i16, DL, DAG.getNode(MergeFromLo ? X86ISD::UNPCKL : X86ISD::UNPCKH,
8110 DL, MVT::v8i16, V1, V2),
8111 DAG.getUNDEF(MVT::v8i16), Mask);
8114 /// \brief Generic lowering of 8-lane i16 shuffles.
8116 /// This handles both single-input shuffles and combined shuffle/blends with
8117 /// two inputs. The single input shuffles are immediately delegated to
8118 /// a dedicated lowering routine.
8120 /// The blends are lowered in one of three fundamental ways. If there are few
8121 /// enough inputs, it delegates to a basic UNPCK-based strategy. If the shuffle
8122 /// of the input is significantly cheaper when lowered as an interleaving of
8123 /// the two inputs, try to interleave them. Otherwise, blend the low and high
8124 /// halves of the inputs separately (making them have relatively few inputs)
8125 /// and then concatenate them.
8126 static SDValue lowerV8I16VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
8127 const X86Subtarget *Subtarget,
8128 SelectionDAG &DAG) {
8130 assert(Op.getSimpleValueType() == MVT::v8i16 && "Bad shuffle type!");
8131 assert(V1.getSimpleValueType() == MVT::v8i16 && "Bad operand type!");
8132 assert(V2.getSimpleValueType() == MVT::v8i16 && "Bad operand type!");
8133 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
8134 ArrayRef<int> OrigMask = SVOp->getMask();
8135 int MaskStorage[8] = {OrigMask[0], OrigMask[1], OrigMask[2], OrigMask[3],
8136 OrigMask[4], OrigMask[5], OrigMask[6], OrigMask[7]};
8137 MutableArrayRef<int> Mask(MaskStorage);
8139 assert(Mask.size() == 8 && "Unexpected mask size for v8 shuffle!");
8141 auto isV1 = [](int M) { return M >= 0 && M < 8; };
8142 auto isV2 = [](int M) { return M >= 8; };
8144 int NumV1Inputs = std::count_if(Mask.begin(), Mask.end(), isV1);
8145 int NumV2Inputs = std::count_if(Mask.begin(), Mask.end(), isV2);
8147 if (NumV2Inputs == 0)
8148 return lowerV8I16SingleInputVectorShuffle(DL, V1, Mask, Subtarget, DAG);
8150 assert(NumV1Inputs > 0 && "All single-input shuffles should be canonicalized "
8151 "to be V1-input shuffles.");
8153 if (NumV1Inputs + NumV2Inputs <= 4)
8154 return lowerV8I16BasicBlendVectorShuffle(DL, V1, V2, Mask, Subtarget, DAG);
8156 // Check whether an interleaving lowering is likely to be more efficient.
8157 // This isn't perfect but it is a strong heuristic that tends to work well on
8158 // the kinds of shuffles that show up in practice.
8160 // FIXME: Handle 1x, 2x, and 4x interleaving.
8161 if (shouldLowerAsInterleaving(Mask)) {
8162 // FIXME: Figure out whether we should pack these into the low or high
8165 int EMask[8], OMask[8];
8166 for (int i = 0; i < 4; ++i) {
8167 EMask[i] = Mask[2*i];
8168 OMask[i] = Mask[2*i + 1];
8173 SDValue Evens = DAG.getVectorShuffle(MVT::v8i16, DL, V1, V2, EMask);
8174 SDValue Odds = DAG.getVectorShuffle(MVT::v8i16, DL, V1, V2, OMask);
8176 return DAG.getNode(X86ISD::UNPCKL, DL, MVT::v8i16, Evens, Odds);
8179 int LoBlendMask[8] = {-1, -1, -1, -1, -1, -1, -1, -1};
8180 int HiBlendMask[8] = {-1, -1, -1, -1, -1, -1, -1, -1};
8182 for (int i = 0; i < 4; ++i) {
8183 LoBlendMask[i] = Mask[i];
8184 HiBlendMask[i] = Mask[i + 4];
8187 SDValue LoV = DAG.getVectorShuffle(MVT::v8i16, DL, V1, V2, LoBlendMask);
8188 SDValue HiV = DAG.getVectorShuffle(MVT::v8i16, DL, V1, V2, HiBlendMask);
8189 LoV = DAG.getNode(ISD::BITCAST, DL, MVT::v2i64, LoV);
8190 HiV = DAG.getNode(ISD::BITCAST, DL, MVT::v2i64, HiV);
8192 return DAG.getNode(ISD::BITCAST, DL, MVT::v8i16,
8193 DAG.getNode(X86ISD::UNPCKL, DL, MVT::v2i64, LoV, HiV));
8196 /// \brief Check whether a compaction lowering can be done by dropping even
8197 /// elements and compute how many times even elements must be dropped.
8199 /// This handles shuffles which take every Nth element where N is a power of
8200 /// two. Example shuffle masks:
8202 /// N = 1: 0, 2, 4, 6, 8, 10, 12, 14, 0, 2, 4, 6, 8, 10, 12, 14
8203 /// N = 1: 0, 2, 4, 6, 8, 10, 12, 14, 16, 18, 20, 22, 24, 26, 28, 30
8204 /// N = 2: 0, 4, 8, 12, 0, 4, 8, 12, 0, 4, 8, 12, 0, 4, 8, 12
8205 /// N = 2: 0, 4, 8, 12, 16, 20, 24, 28, 0, 4, 8, 12, 16, 20, 24, 28
8206 /// N = 3: 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8
8207 /// N = 3: 0, 8, 16, 24, 0, 8, 16, 24, 0, 8, 16, 24, 0, 8, 16, 24
8209 /// Any of these lanes can of course be undef.
8211 /// This routine only supports N <= 3.
8212 /// FIXME: Evaluate whether either AVX or AVX-512 have any opportunities here
8215 /// \returns N above, or the number of times even elements must be dropped if
8216 /// there is such a number. Otherwise returns zero.
8217 static int canLowerByDroppingEvenElements(ArrayRef<int> Mask) {
8218 // Figure out whether we're looping over two inputs or just one.
8219 bool IsSingleInput = isSingleInputShuffleMask(Mask);
8221 // The modulus for the shuffle vector entries is based on whether this is
8222 // a single input or not.
8223 int ShuffleModulus = Mask.size() * (IsSingleInput ? 1 : 2);
8224 assert(isPowerOf2_32((uint32_t)ShuffleModulus) &&
8225 "We should only be called with masks with a power-of-2 size!");
8227 uint64_t ModMask = (uint64_t)ShuffleModulus - 1;
8229 // We track whether the input is viable for all power-of-2 strides 2^1, 2^2,
8230 // and 2^3 simultaneously. This is because we may have ambiguity with
8231 // partially undef inputs.
8232 bool ViableForN[3] = {true, true, true};
8234 for (int i = 0, e = Mask.size(); i < e; ++i) {
8235 // Ignore undef lanes, we'll optimistically collapse them to the pattern we
8240 bool IsAnyViable = false;
8241 for (unsigned j = 0; j != array_lengthof(ViableForN); ++j)
8242 if (ViableForN[j]) {
8245 // The shuffle mask must be equal to (i * 2^N) % M.
8246 if ((uint64_t)Mask[i] == (((uint64_t)i << N) & ModMask))
8249 ViableForN[j] = false;
8251 // Early exit if we exhaust the possible powers of two.
8256 for (unsigned j = 0; j != array_lengthof(ViableForN); ++j)
8260 // Return 0 as there is no viable power of two.
8264 /// \brief Generic lowering of v16i8 shuffles.
8266 /// This is a hybrid strategy to lower v16i8 vectors. It first attempts to
8267 /// detect any complexity reducing interleaving. If that doesn't help, it uses
8268 /// UNPCK to spread the i8 elements across two i16-element vectors, and uses
8269 /// the existing lowering for v8i16 blends on each half, finally PACK-ing them
8271 static SDValue lowerV16I8VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
8272 const X86Subtarget *Subtarget,
8273 SelectionDAG &DAG) {
8275 assert(Op.getSimpleValueType() == MVT::v16i8 && "Bad shuffle type!");
8276 assert(V1.getSimpleValueType() == MVT::v16i8 && "Bad operand type!");
8277 assert(V2.getSimpleValueType() == MVT::v16i8 && "Bad operand type!");
8278 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
8279 ArrayRef<int> OrigMask = SVOp->getMask();
8280 assert(OrigMask.size() == 16 && "Unexpected mask size for v16 shuffle!");
8281 int MaskStorage[16] = {
8282 OrigMask[0], OrigMask[1], OrigMask[2], OrigMask[3],
8283 OrigMask[4], OrigMask[5], OrigMask[6], OrigMask[7],
8284 OrigMask[8], OrigMask[9], OrigMask[10], OrigMask[11],
8285 OrigMask[12], OrigMask[13], OrigMask[14], OrigMask[15]};
8286 MutableArrayRef<int> Mask(MaskStorage);
8287 MutableArrayRef<int> LoMask = Mask.slice(0, 8);
8288 MutableArrayRef<int> HiMask = Mask.slice(8, 8);
8290 // For single-input shuffles, there are some nicer lowering tricks we can use.
8291 if (isSingleInputShuffleMask(Mask)) {
8292 // Check whether we can widen this to an i16 shuffle by duplicating bytes.
8293 // Notably, this handles splat and partial-splat shuffles more efficiently.
8294 // However, it only makes sense if the pre-duplication shuffle simplifies
8295 // things significantly. Currently, this means we need to be able to
8296 // express the pre-duplication shuffle as an i16 shuffle.
8298 // FIXME: We should check for other patterns which can be widened into an
8299 // i16 shuffle as well.
8300 auto canWidenViaDuplication = [](ArrayRef<int> Mask) {
8301 for (int i = 0; i < 16; i += 2) {
8302 if (Mask[i] != Mask[i + 1])
8307 auto tryToWidenViaDuplication = [&]() -> SDValue {
8308 if (!canWidenViaDuplication(Mask))
8310 SmallVector<int, 4> LoInputs;
8311 std::copy_if(Mask.begin(), Mask.end(), std::back_inserter(LoInputs),
8312 [](int M) { return M >= 0 && M < 8; });
8313 std::sort(LoInputs.begin(), LoInputs.end());
8314 LoInputs.erase(std::unique(LoInputs.begin(), LoInputs.end()),
8316 SmallVector<int, 4> HiInputs;
8317 std::copy_if(Mask.begin(), Mask.end(), std::back_inserter(HiInputs),
8318 [](int M) { return M >= 8; });
8319 std::sort(HiInputs.begin(), HiInputs.end());
8320 HiInputs.erase(std::unique(HiInputs.begin(), HiInputs.end()),
8323 bool TargetLo = LoInputs.size() >= HiInputs.size();
8324 ArrayRef<int> InPlaceInputs = TargetLo ? LoInputs : HiInputs;
8325 ArrayRef<int> MovingInputs = TargetLo ? HiInputs : LoInputs;
8327 int PreDupI16Shuffle[] = {-1, -1, -1, -1, -1, -1, -1, -1};
8328 SmallDenseMap<int, int, 8> LaneMap;
8329 for (int I : InPlaceInputs) {
8330 PreDupI16Shuffle[I/2] = I/2;
8333 int j = TargetLo ? 0 : 4, je = j + 4;
8334 for (int i = 0, ie = MovingInputs.size(); i < ie; ++i) {
8335 // Check if j is already a shuffle of this input. This happens when
8336 // there are two adjacent bytes after we move the low one.
8337 if (PreDupI16Shuffle[j] != MovingInputs[i] / 2) {
8338 // If we haven't yet mapped the input, search for a slot into which
8340 while (j < je && PreDupI16Shuffle[j] != -1)
8344 // We can't place the inputs into a single half with a simple i16 shuffle, so bail.
8347 // Map this input with the i16 shuffle.
8348 PreDupI16Shuffle[j] = MovingInputs[i] / 2;
8351 // Update the lane map based on the mapping we ended up with.
8352 LaneMap[MovingInputs[i]] = 2 * j + MovingInputs[i] % 2;
8355 ISD::BITCAST, DL, MVT::v16i8,
8356 DAG.getVectorShuffle(MVT::v8i16, DL,
8357 DAG.getNode(ISD::BITCAST, DL, MVT::v8i16, V1),
8358 DAG.getUNDEF(MVT::v8i16), PreDupI16Shuffle));
8360 // Unpack the bytes to form the i16s that will be shuffled into place.
8361 V1 = DAG.getNode(TargetLo ? X86ISD::UNPCKL : X86ISD::UNPCKH, DL,
8362 MVT::v16i8, V1, V1);
8364 int PostDupI16Shuffle[8] = {-1, -1, -1, -1, -1, -1, -1, -1};
8365 for (int i = 0; i < 16; i += 2) {
8367 PostDupI16Shuffle[i / 2] = LaneMap[Mask[i]] - (TargetLo ? 0 : 8);
8368 assert(PostDupI16Shuffle[i / 2] < 8 && "Invalid v8 shuffle mask!");
8371 ISD::BITCAST, DL, MVT::v16i8,
8372 DAG.getVectorShuffle(MVT::v8i16, DL,
8373 DAG.getNode(ISD::BITCAST, DL, MVT::v8i16, V1),
8374 DAG.getUNDEF(MVT::v8i16), PostDupI16Shuffle));
8376 if (SDValue V = tryToWidenViaDuplication())
8380 // Check whether an interleaving lowering is likely to be more efficient.
8381 // This isn't perfect but it is a strong heuristic that tends to work well on
8382 // the kinds of shuffles that show up in practice.
8384 // FIXME: We need to handle other interleaving widths (i16, i32, ...).
8385 if (shouldLowerAsInterleaving(Mask)) {
8386 // FIXME: Figure out whether we should pack these into the low or high
8389 int EMask[16], OMask[16];
8390 for (int i = 0; i < 8; ++i) {
8391 EMask[i] = Mask[2*i];
8392 OMask[i] = Mask[2*i + 1];
8397 SDValue Evens = DAG.getVectorShuffle(MVT::v16i8, DL, V1, V2, EMask);
8398 SDValue Odds = DAG.getVectorShuffle(MVT::v16i8, DL, V1, V2, OMask);
8400 return DAG.getNode(X86ISD::UNPCKL, DL, MVT::v16i8, Evens, Odds);
8403 // Check for SSSE3 which lets us lower all v16i8 shuffles much more directly
8404 // with PSHUFB. It is important to do this before we attempt to generate any
8405 // blends but after all of the single-input lowerings. If the single input
8406 // lowerings can find an instruction sequence that is faster than a PSHUFB, we
8407 // want to preserve that and we can DAG combine any longer sequences into
8408 // a PSHUFB in the end. But once we start blending from multiple inputs,
8409 // the complexity of DAG combining bad patterns back into PSHUFB is too high,
8410 // and there are *very* few patterns that would actually be faster than the
8411 // PSHUFB approach because of its ability to zero lanes.
8413 // FIXME: The only exceptions to the above are blends which are exact
8414 // interleavings with direct instructions supporting them. We currently don't
8415 // handle those well here.
8416 if (Subtarget->hasSSSE3()) {
8419 for (int i = 0; i < 16; ++i)
8420 if (Mask[i] == -1) {
8421 V1Mask[i] = V2Mask[i] = DAG.getConstant(0x80, MVT::i8);
8423 V1Mask[i] = DAG.getConstant(Mask[i] < 16 ? Mask[i] : 0x80, MVT::i8);
8425 DAG.getConstant(Mask[i] < 16 ? 0x80 : Mask[i] - 16, MVT::i8);
8427 V1 = DAG.getNode(X86ISD::PSHUFB, DL, MVT::v16i8, V1,
8428 DAG.getNode(ISD::BUILD_VECTOR, DL, MVT::v16i8, V1Mask));
8429 if (isSingleInputShuffleMask(Mask))
8430 return V1; // Single inputs are easy.
8432 // Otherwise, blend the two.
8433 V2 = DAG.getNode(X86ISD::PSHUFB, DL, MVT::v16i8, V2,
8434 DAG.getNode(ISD::BUILD_VECTOR, DL, MVT::v16i8, V2Mask));
8435 return DAG.getNode(ISD::OR, DL, MVT::v16i8, V1, V2);
8438 // Check whether a compaction lowering can be done. This handles shuffles
8439 // which take every Nth element for some even N. See the helper function for
8442 // We special case these as they can be particularly efficiently handled with
8443 // the PACKUSB instruction on x86 and they show up in common patterns of
8444 // rearranging bytes to truncate wide elements.
8445 if (int NumEvenDrops = canLowerByDroppingEvenElements(Mask)) {
8446 // NumEvenDrops is the power of two stride of the elements. Another way of
8447 // thinking about it is that we need to drop the even elements this many
8448 // times to get the original input.
8449 bool IsSingleInput = isSingleInputShuffleMask(Mask);
8451 // First we need to zero all the dropped bytes.
8452 assert(NumEvenDrops <= 3 &&
8453 "No support for dropping even elements more than 3 times.");
8454 // We use the mask type to pick which bytes are preserved based on how many
8455 // elements are dropped.
8456 MVT MaskVTs[] = { MVT::v8i16, MVT::v4i32, MVT::v2i64 };
8457 SDValue ByteClearMask =
8458 DAG.getNode(ISD::BITCAST, DL, MVT::v16i8,
8459 DAG.getConstant(0xFF, MaskVTs[NumEvenDrops - 1]));
8460 V1 = DAG.getNode(ISD::AND, DL, MVT::v16i8, V1, ByteClearMask);
8462 V2 = DAG.getNode(ISD::AND, DL, MVT::v16i8, V2, ByteClearMask);
8464 // Now pack things back together.
8465 V1 = DAG.getNode(ISD::BITCAST, DL, MVT::v8i16, V1);
8466 V2 = IsSingleInput ? V1 : DAG.getNode(ISD::BITCAST, DL, MVT::v8i16, V2);
8467 SDValue Result = DAG.getNode(X86ISD::PACKUS, DL, MVT::v16i8, V1, V2);
8468 for (int i = 1; i < NumEvenDrops; ++i) {
8469 Result = DAG.getNode(ISD::BITCAST, DL, MVT::v8i16, Result);
8470 Result = DAG.getNode(X86ISD::PACKUS, DL, MVT::v16i8, Result, Result);
8476 int V1LoBlendMask[8] = {-1, -1, -1, -1, -1, -1, -1, -1};
8477 int V1HiBlendMask[8] = {-1, -1, -1, -1, -1, -1, -1, -1};
8478 int V2LoBlendMask[8] = {-1, -1, -1, -1, -1, -1, -1, -1};
8479 int V2HiBlendMask[8] = {-1, -1, -1, -1, -1, -1, -1, -1};
8481 auto buildBlendMasks = [](MutableArrayRef<int> HalfMask,
8482 MutableArrayRef<int> V1HalfBlendMask,
8483 MutableArrayRef<int> V2HalfBlendMask) {
8484 for (int i = 0; i < 8; ++i)
8485 if (HalfMask[i] >= 0 && HalfMask[i] < 16) {
8486 V1HalfBlendMask[i] = HalfMask[i];
8488 } else if (HalfMask[i] >= 16) {
8489 V2HalfBlendMask[i] = HalfMask[i] - 16;
8490 HalfMask[i] = i + 8;
8493 buildBlendMasks(LoMask, V1LoBlendMask, V2LoBlendMask);
8494 buildBlendMasks(HiMask, V1HiBlendMask, V2HiBlendMask);
8496 SDValue Zero = getZeroVector(MVT::v8i16, Subtarget, DAG, DL);
8498 auto buildLoAndHiV8s = [&](SDValue V, MutableArrayRef<int> LoBlendMask,
8499 MutableArrayRef<int> HiBlendMask) {
8501 // Check if any of the odd lanes in the v16i8 are used. If not, we can mask
8502 // them out and avoid using UNPCK{L,H} to extract the elements of V as
8504 if (std::none_of(LoBlendMask.begin(), LoBlendMask.end(),
8505 [](int M) { return M >= 0 && M % 2 == 1; }) &&
8506 std::none_of(HiBlendMask.begin(), HiBlendMask.end(),
8507 [](int M) { return M >= 0 && M % 2 == 1; })) {
8508 // Use a mask to drop the high bytes.
8509 V1 = DAG.getNode(ISD::BITCAST, DL, MVT::v8i16, V);
8510 V1 = DAG.getNode(ISD::AND, DL, MVT::v8i16, V1,
8511 DAG.getConstant(0x00FF, MVT::v8i16));
8513 // This will be a single vector shuffle instead of a blend so nuke V2.
8514 V2 = DAG.getUNDEF(MVT::v8i16);
8516 // Squash the masks to point directly into V1.
8517 for (int &M : LoBlendMask)
8520 for (int &M : HiBlendMask)
8524 // Otherwise just unpack the low half of V into V1 and the high half into
8525 // V2 so that we can blend them as i16s.
8526 V1 = DAG.getNode(ISD::BITCAST, DL, MVT::v8i16,
8527 DAG.getNode(X86ISD::UNPCKL, DL, MVT::v16i8, V, Zero));
8528 V2 = DAG.getNode(ISD::BITCAST, DL, MVT::v8i16,
8529 DAG.getNode(X86ISD::UNPCKH, DL, MVT::v16i8, V, Zero));
8532 SDValue BlendedLo = DAG.getVectorShuffle(MVT::v8i16, DL, V1, V2, LoBlendMask);
8533 SDValue BlendedHi = DAG.getVectorShuffle(MVT::v8i16, DL, V1, V2, HiBlendMask);
8534 return std::make_pair(BlendedLo, BlendedHi);
8536 SDValue V1Lo, V1Hi, V2Lo, V2Hi;
8537 std::tie(V1Lo, V1Hi) = buildLoAndHiV8s(V1, V1LoBlendMask, V1HiBlendMask);
8538 std::tie(V2Lo, V2Hi) = buildLoAndHiV8s(V2, V2LoBlendMask, V2HiBlendMask);
8540 SDValue LoV = DAG.getVectorShuffle(MVT::v8i16, DL, V1Lo, V2Lo, LoMask);
8541 SDValue HiV = DAG.getVectorShuffle(MVT::v8i16, DL, V1Hi, V2Hi, HiMask);
8543 return DAG.getNode(X86ISD::PACKUS, DL, MVT::v16i8, LoV, HiV);
8546 /// \brief Dispatching routine to lower various 128-bit x86 vector shuffles.
8548 /// This routine breaks down the specific type of 128-bit shuffle and
8549 /// dispatches to the lowering routines accordingly.
8550 static SDValue lower128BitVectorShuffle(SDValue Op, SDValue V1, SDValue V2,
8551 MVT VT, const X86Subtarget *Subtarget,
8552 SelectionDAG &DAG) {
8553 switch (VT.SimpleTy) {
8555 return lowerV2I64VectorShuffle(Op, V1, V2, Subtarget, DAG);
8557 return lowerV2F64VectorShuffle(Op, V1, V2, Subtarget, DAG);
8559 return lowerV4I32VectorShuffle(Op, V1, V2, Subtarget, DAG);
8561 return lowerV4F32VectorShuffle(Op, V1, V2, Subtarget, DAG);
8563 return lowerV8I16VectorShuffle(Op, V1, V2, Subtarget, DAG);
8565 return lowerV16I8VectorShuffle(Op, V1, V2, Subtarget, DAG);
8568 llvm_unreachable("Unimplemented!");
8572 static bool isHalfCrossingShuffleMask(ArrayRef<int> Mask) {
8573 int Size = Mask.size();
8574 for (int M : Mask.slice(0, Size / 2))
8575 if (M >= 0 && (M % Size) >= Size / 2)
8577 for (int M : Mask.slice(Size / 2, Size / 2))
8578 if (M >= 0 && (M % Size) < Size / 2)
8583 /// \brief Generic routine to split a 256-bit vector shuffle into 128-bit
8586 /// There is a severely limited set of shuffles available in AVX1 for 256-bit
8587 /// vectors resulting in routinely needing to split the shuffle into two 128-bit
8588 /// shuffles. This can be done generically for any 256-bit vector shuffle and so
8589 /// we encode the logic here for specific shuffle lowering routines to bail to
8590 /// when they exhaust the features avaible to more directly handle the shuffle.
8591 static SDValue splitAndLower256BitVectorShuffle(SDValue Op, SDValue V1,
8593 const X86Subtarget *Subtarget,
8594 SelectionDAG &DAG) {
8596 MVT VT = Op.getSimpleValueType();
8597 assert(VT.getSizeInBits() == 256 && "Only for 256-bit vector shuffles!");
8598 assert(V1.getSimpleValueType() == VT && "Bad operand type!");
8599 assert(V2.getSimpleValueType() == VT && "Bad operand type!");
8600 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
8601 ArrayRef<int> Mask = SVOp->getMask();
8603 ArrayRef<int> LoMask = Mask.slice(0, Mask.size()/2);
8604 ArrayRef<int> HiMask = Mask.slice(Mask.size()/2);
8606 int NumElements = VT.getVectorNumElements();
8607 int SplitNumElements = NumElements / 2;
8608 MVT ScalarVT = VT.getScalarType();
8609 MVT SplitVT = MVT::getVectorVT(ScalarVT, NumElements / 2);
8611 SDValue LoV1 = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, SplitVT, V1,
8612 DAG.getIntPtrConstant(0));
8613 SDValue HiV1 = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, SplitVT, V1,
8614 DAG.getIntPtrConstant(SplitNumElements));
8615 SDValue LoV2 = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, SplitVT, V2,
8616 DAG.getIntPtrConstant(0));
8617 SDValue HiV2 = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, SplitVT, V2,
8618 DAG.getIntPtrConstant(SplitNumElements));
8620 // Now create two 4-way blends of these half-width vectors.
8621 auto HalfBlend = [&](ArrayRef<int> HalfMask) {
8622 SmallVector<int, 16> V1BlendMask, V2BlendMask, BlendMask;
8623 for (int i = 0; i < SplitNumElements; ++i) {
8624 int M = HalfMask[i];
8625 if (M >= NumElements) {
8626 V2BlendMask.push_back(M - NumElements);
8627 V1BlendMask.push_back(-1);
8628 BlendMask.push_back(SplitNumElements + i);
8629 } else if (M >= 0) {
8630 V2BlendMask.push_back(-1);
8631 V1BlendMask.push_back(M);
8632 BlendMask.push_back(i);
8634 V2BlendMask.push_back(-1);
8635 V1BlendMask.push_back(-1);
8636 BlendMask.push_back(-1);
8639 SDValue V1Blend = DAG.getVectorShuffle(SplitVT, DL, LoV1, HiV1, V1BlendMask);
8640 SDValue V2Blend = DAG.getVectorShuffle(SplitVT, DL, LoV2, HiV2, V2BlendMask);
8641 return DAG.getVectorShuffle(SplitVT, DL, V1Blend, V2Blend, BlendMask);
8643 SDValue Lo = HalfBlend(LoMask);
8644 SDValue Hi = HalfBlend(HiMask);
8645 return DAG.getNode(ISD::CONCAT_VECTORS, DL, VT, Lo, Hi);
8648 /// \brief Handle lowering of 4-lane 64-bit floating point shuffles.
8650 /// Also ends up handling lowering of 4-lane 64-bit integer shuffles when AVX2
8651 /// isn't available.
8652 static SDValue lowerV4F64VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
8653 const X86Subtarget *Subtarget,
8654 SelectionDAG &DAG) {
8656 assert(V1.getSimpleValueType() == MVT::v4f64 && "Bad operand type!");
8657 assert(V2.getSimpleValueType() == MVT::v4f64 && "Bad operand type!");
8658 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
8659 ArrayRef<int> Mask = SVOp->getMask();
8660 assert(Mask.size() == 4 && "Unexpected mask size for v4 shuffle!");
8662 // FIXME: If we have AVX2, we should delegate to generic code as crossing
8663 // shuffles aren't a problem and FP and int have the same patterns.
8665 // FIXME: We can handle these more cleverly than splitting for v4f64.
8666 if (isHalfCrossingShuffleMask(Mask))
8667 return splitAndLower256BitVectorShuffle(Op, V1, V2, Subtarget, DAG);
8669 if (isSingleInputShuffleMask(Mask)) {
8670 // Non-half-crossing single input shuffles can be lowerid with an
8671 // interleaved permutation.
8672 unsigned VPERMILPMask = (Mask[0] == 1) | ((Mask[1] == 1) << 1) |
8673 ((Mask[2] == 3) << 2) | ((Mask[3] == 3) << 3);
8674 return DAG.getNode(X86ISD::VPERMILP, DL, MVT::v4f64, V1,
8675 DAG.getConstant(VPERMILPMask, MVT::i8));
8678 // X86 has dedicated unpack instructions that can handle specific blend
8679 // operations: UNPCKH and UNPCKL.
8680 if (isShuffleEquivalent(Mask, 0, 4, 2, 6))
8681 return DAG.getNode(X86ISD::UNPCKL, DL, MVT::v4f64, V1, V2);
8682 if (isShuffleEquivalent(Mask, 1, 5, 3, 7))
8683 return DAG.getNode(X86ISD::UNPCKH, DL, MVT::v4f64, V1, V2);
8684 // FIXME: It would be nice to find a way to get canonicalization to commute
8686 if (isShuffleEquivalent(Mask, 4, 0, 6, 2))
8687 return DAG.getNode(X86ISD::UNPCKL, DL, MVT::v4f64, V2, V1);
8688 if (isShuffleEquivalent(Mask, 5, 1, 7, 3))
8689 return DAG.getNode(X86ISD::UNPCKH, DL, MVT::v4f64, V2, V1);
8691 // Check if the blend happens to exactly fit that of SHUFPD.
8692 if (Mask[0] < 4 && (Mask[1] == -1 || Mask[1] >= 4) &&
8693 Mask[2] < 4 && (Mask[3] == -1 || Mask[3] >= 4)) {
8694 unsigned SHUFPDMask = (Mask[0] == 1) | ((Mask[1] == 5) << 1) |
8695 ((Mask[2] == 3) << 2) | ((Mask[3] == 7) << 3);
8696 return DAG.getNode(X86ISD::SHUFP, DL, MVT::v4f64, V1, V2,
8697 DAG.getConstant(SHUFPDMask, MVT::i8));
8699 if ((Mask[0] == -1 || Mask[0] >= 4) && Mask[1] < 4 &&
8700 (Mask[2] == -1 || Mask[2] >= 4) && Mask[3] < 4) {
8701 unsigned SHUFPDMask = (Mask[0] == 5) | ((Mask[1] == 1) << 1) |
8702 ((Mask[2] == 7) << 2) | ((Mask[3] == 3) << 3);
8703 return DAG.getNode(X86ISD::SHUFP, DL, MVT::v4f64, V2, V1,
8704 DAG.getConstant(SHUFPDMask, MVT::i8));
8707 // Shuffle the input elements into the desired positions in V1 and V2 and
8708 // blend them together.
8709 int V1Mask[] = {-1, -1, -1, -1};
8710 int V2Mask[] = {-1, -1, -1, -1};
8711 for (int i = 0; i < 4; ++i)
8712 if (Mask[i] >= 0 && Mask[i] < 4)
8713 V1Mask[i] = Mask[i];
8714 else if (Mask[i] >= 4)
8715 V2Mask[i] = Mask[i] - 4;
8717 V1 = DAG.getVectorShuffle(MVT::v4f64, DL, V1, DAG.getUNDEF(MVT::v4f64), V1Mask);
8718 V2 = DAG.getVectorShuffle(MVT::v4f64, DL, V2, DAG.getUNDEF(MVT::v4f64), V2Mask);
8720 unsigned BlendMask = 0;
8721 for (int i = 0; i < 4; ++i)
8723 BlendMask |= 1 << i;
8725 return DAG.getNode(X86ISD::BLENDI, DL, MVT::v4f64, V1, V2,
8726 DAG.getConstant(BlendMask, MVT::i8));
8729 /// \brief Handle lowering of 4-lane 64-bit integer shuffles.
8731 /// Largely delegates to common code when we have AVX2 and to the floating-point
8732 /// code when we only have AVX.
8733 static SDValue lowerV4I64VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
8734 const X86Subtarget *Subtarget,
8735 SelectionDAG &DAG) {
8737 assert(Op.getSimpleValueType() == MVT::v4i64 && "Bad shuffle type!");
8738 assert(V1.getSimpleValueType() == MVT::v4i64 && "Bad operand type!");
8739 assert(V2.getSimpleValueType() == MVT::v4i64 && "Bad operand type!");
8740 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
8741 ArrayRef<int> Mask = SVOp->getMask();
8742 assert(Mask.size() == 4 && "Unexpected mask size for v4 shuffle!");
8744 // FIXME: If we have AVX2, we should delegate to generic code as crossing
8745 // shuffles aren't a problem and FP and int have the same patterns.
8747 if (isHalfCrossingShuffleMask(Mask))
8748 return splitAndLower256BitVectorShuffle(Op, V1, V2, Subtarget, DAG);
8750 // AVX1 doesn't provide any facilities for v4i64 shuffles, bitcast and
8751 // delegate to floating point code.
8752 V1 = DAG.getNode(ISD::BITCAST, DL, MVT::v4f64, V1);
8753 V2 = DAG.getNode(ISD::BITCAST, DL, MVT::v4f64, V2);
8754 return DAG.getNode(ISD::BITCAST, DL, MVT::v4i64,
8755 lowerV4F64VectorShuffle(Op, V1, V2, Subtarget, DAG));
8758 /// \brief High-level routine to lower various 256-bit x86 vector shuffles.
8760 /// This routine either breaks down the specific type of a 256-bit x86 vector
8761 /// shuffle or splits it into two 128-bit shuffles and fuses the results back
8762 /// together based on the available instructions.
8763 static SDValue lower256BitVectorShuffle(SDValue Op, SDValue V1, SDValue V2,
8764 MVT VT, const X86Subtarget *Subtarget,
8765 SelectionDAG &DAG) {
8766 switch (VT.SimpleTy) {
8768 return lowerV4F64VectorShuffle(Op, V1, V2, Subtarget, DAG);
8770 return lowerV4I64VectorShuffle(Op, V1, V2, Subtarget, DAG);
8775 // Fall back to the basic pattern of extracting the high half and forming
8777 // FIXME: Add targeted lowering for each type that can document rationale
8778 // for delegating to this when necessary.
8779 return splitAndLower256BitVectorShuffle(Op, V1, V2, Subtarget, DAG);
8782 llvm_unreachable("Not a valid 256-bit x86 vector type!");
8786 /// \brief Tiny helper function to test whether a shuffle mask could be
8787 /// simplified by widening the elements being shuffled.
8788 static bool canWidenShuffleElements(ArrayRef<int> Mask) {
8789 for (int i = 0, Size = Mask.size(); i < Size; i += 2)
8790 if (Mask[i] % 2 != 0 || Mask[i] + 1 != Mask[i+1])
8796 /// \brief Top-level lowering for x86 vector shuffles.
8798 /// This handles decomposition, canonicalization, and lowering of all x86
8799 /// vector shuffles. Most of the specific lowering strategies are encapsulated
8800 /// above in helper routines. The canonicalization attempts to widen shuffles
8801 /// to involve fewer lanes of wider elements, consolidate symmetric patterns
8802 /// s.t. only one of the two inputs needs to be tested, etc.
8803 static SDValue lowerVectorShuffle(SDValue Op, const X86Subtarget *Subtarget,
8804 SelectionDAG &DAG) {
8805 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
8806 ArrayRef<int> Mask = SVOp->getMask();
8807 SDValue V1 = Op.getOperand(0);
8808 SDValue V2 = Op.getOperand(1);
8809 MVT VT = Op.getSimpleValueType();
8810 int NumElements = VT.getVectorNumElements();
8813 assert(VT.getSizeInBits() != 64 && "Can't lower MMX shuffles");
8815 bool V1IsUndef = V1.getOpcode() == ISD::UNDEF;
8816 bool V2IsUndef = V2.getOpcode() == ISD::UNDEF;
8817 if (V1IsUndef && V2IsUndef)
8818 return DAG.getUNDEF(VT);
8820 // When we create a shuffle node we put the UNDEF node to second operand,
8821 // but in some cases the first operand may be transformed to UNDEF.
8822 // In this case we should just commute the node.
8824 return DAG.getCommutedVectorShuffle(*SVOp);
8826 // Check for non-undef masks pointing at an undef vector and make the masks
8827 // undef as well. This makes it easier to match the shuffle based solely on
8831 if (M >= NumElements) {
8832 SmallVector<int, 8> NewMask(Mask.begin(), Mask.end());
8833 for (int &M : NewMask)
8834 if (M >= NumElements)
8836 return DAG.getVectorShuffle(VT, dl, V1, V2, NewMask);
8839 // For integer vector shuffles, try to collapse them into a shuffle of fewer
8840 // lanes but wider integers. We cap this to not form integers larger than i64
8841 // but it might be interesting to form i128 integers to handle flipping the
8842 // low and high halves of AVX 256-bit vectors.
8843 if (VT.isInteger() && VT.getScalarSizeInBits() < 64 &&
8844 canWidenShuffleElements(Mask)) {
8845 SmallVector<int, 8> NewMask;
8846 for (int i = 0, Size = Mask.size(); i < Size; i += 2)
8847 NewMask.push_back(Mask[i] / 2);
8849 MVT::getVectorVT(MVT::getIntegerVT(VT.getScalarSizeInBits() * 2),
8850 VT.getVectorNumElements() / 2);
8851 V1 = DAG.getNode(ISD::BITCAST, dl, NewVT, V1);
8852 V2 = DAG.getNode(ISD::BITCAST, dl, NewVT, V2);
8853 return DAG.getNode(ISD::BITCAST, dl, VT,
8854 DAG.getVectorShuffle(NewVT, dl, V1, V2, NewMask));
8857 int NumV1Elements = 0, NumUndefElements = 0, NumV2Elements = 0;
8858 for (int M : SVOp->getMask())
8861 else if (M < NumElements)
8866 // Commute the shuffle as needed such that more elements come from V1 than
8867 // V2. This allows us to match the shuffle pattern strictly on how many
8868 // elements come from V1 without handling the symmetric cases.
8869 if (NumV2Elements > NumV1Elements)
8870 return DAG.getCommutedVectorShuffle(*SVOp);
8872 // When the number of V1 and V2 elements are the same, try to minimize the
8873 // number of uses of V2 in the low half of the vector.
8874 if (NumV1Elements == NumV2Elements) {
8875 int LowV1Elements = 0, LowV2Elements = 0;
8876 for (int M : SVOp->getMask().slice(0, NumElements / 2))
8877 if (M >= NumElements)
8881 if (LowV2Elements > LowV1Elements)
8882 return DAG.getCommutedVectorShuffle(*SVOp);
8885 // For each vector width, delegate to a specialized lowering routine.
8886 if (VT.getSizeInBits() == 128)
8887 return lower128BitVectorShuffle(Op, V1, V2, VT, Subtarget, DAG);
8889 if (VT.getSizeInBits() == 256)
8890 return lower256BitVectorShuffle(Op, V1, V2, VT, Subtarget, DAG);
8892 llvm_unreachable("Unimplemented!");
8896 //===----------------------------------------------------------------------===//
8897 // Legacy vector shuffle lowering
8899 // This code is the legacy code handling vector shuffles until the above
8900 // replaces its functionality and performance.
8901 //===----------------------------------------------------------------------===//
8903 static bool isBlendMask(ArrayRef<int> MaskVals, MVT VT, bool hasSSE41,
8904 bool hasInt256, unsigned *MaskOut = nullptr) {
8905 MVT EltVT = VT.getVectorElementType();
8907 // There is no blend with immediate in AVX-512.
8908 if (VT.is512BitVector())
8911 if (!hasSSE41 || EltVT == MVT::i8)
8913 if (!hasInt256 && VT == MVT::v16i16)
8916 unsigned MaskValue = 0;
8917 unsigned NumElems = VT.getVectorNumElements();
8918 // There are 2 lanes if (NumElems > 8), and 1 lane otherwise.
8919 unsigned NumLanes = (NumElems - 1) / 8 + 1;
8920 unsigned NumElemsInLane = NumElems / NumLanes;
8922 // Blend for v16i16 should be symetric for the both lanes.
8923 for (unsigned i = 0; i < NumElemsInLane; ++i) {
8925 int SndLaneEltIdx = (NumLanes == 2) ? MaskVals[i + NumElemsInLane] : -1;
8926 int EltIdx = MaskVals[i];
8928 if ((EltIdx < 0 || EltIdx == (int)i) &&
8929 (SndLaneEltIdx < 0 || SndLaneEltIdx == (int)(i + NumElemsInLane)))
8932 if (((unsigned)EltIdx == (i + NumElems)) &&
8933 (SndLaneEltIdx < 0 ||
8934 (unsigned)SndLaneEltIdx == i + NumElems + NumElemsInLane))
8935 MaskValue |= (1 << i);
8941 *MaskOut = MaskValue;
8945 // Try to lower a shuffle node into a simple blend instruction.
8946 // This function assumes isBlendMask returns true for this
8947 // SuffleVectorSDNode
8948 static SDValue LowerVECTOR_SHUFFLEtoBlend(ShuffleVectorSDNode *SVOp,
8950 const X86Subtarget *Subtarget,
8951 SelectionDAG &DAG) {
8952 MVT VT = SVOp->getSimpleValueType(0);
8953 MVT EltVT = VT.getVectorElementType();
8954 assert(isBlendMask(SVOp->getMask(), VT, Subtarget->hasSSE41(),
8955 Subtarget->hasInt256() && "Trying to lower a "
8956 "VECTOR_SHUFFLE to a Blend but "
8957 "with the wrong mask"));
8958 SDValue V1 = SVOp->getOperand(0);
8959 SDValue V2 = SVOp->getOperand(1);
8961 unsigned NumElems = VT.getVectorNumElements();
8963 // Convert i32 vectors to floating point if it is not AVX2.
8964 // AVX2 introduced VPBLENDD instruction for 128 and 256-bit vectors.
8966 if (EltVT == MVT::i64 || (EltVT == MVT::i32 && !Subtarget->hasInt256())) {
8967 BlendVT = MVT::getVectorVT(MVT::getFloatingPointVT(EltVT.getSizeInBits()),
8969 V1 = DAG.getNode(ISD::BITCAST, dl, VT, V1);
8970 V2 = DAG.getNode(ISD::BITCAST, dl, VT, V2);
8973 SDValue Ret = DAG.getNode(X86ISD::BLENDI, dl, BlendVT, V1, V2,
8974 DAG.getConstant(MaskValue, MVT::i32));
8975 return DAG.getNode(ISD::BITCAST, dl, VT, Ret);
8978 /// In vector type \p VT, return true if the element at index \p InputIdx
8979 /// falls on a different 128-bit lane than \p OutputIdx.
8980 static bool ShuffleCrosses128bitLane(MVT VT, unsigned InputIdx,
8981 unsigned OutputIdx) {
8982 unsigned EltSize = VT.getVectorElementType().getSizeInBits();
8983 return InputIdx * EltSize / 128 != OutputIdx * EltSize / 128;
8986 /// Generate a PSHUFB if possible. Selects elements from \p V1 according to
8987 /// \p MaskVals. MaskVals[OutputIdx] = InputIdx specifies that we want to
8988 /// shuffle the element at InputIdx in V1 to OutputIdx in the result. If \p
8989 /// MaskVals refers to elements outside of \p V1 or is undef (-1), insert a
8991 static SDValue getPSHUFB(ArrayRef<int> MaskVals, SDValue V1, SDLoc &dl,
8992 SelectionDAG &DAG) {
8993 MVT VT = V1.getSimpleValueType();
8994 assert(VT.is128BitVector() || VT.is256BitVector());
8996 MVT EltVT = VT.getVectorElementType();
8997 unsigned EltSizeInBytes = EltVT.getSizeInBits() / 8;
8998 unsigned NumElts = VT.getVectorNumElements();
9000 SmallVector<SDValue, 32> PshufbMask;
9001 for (unsigned OutputIdx = 0; OutputIdx < NumElts; ++OutputIdx) {
9002 int InputIdx = MaskVals[OutputIdx];
9003 unsigned InputByteIdx;
9005 if (InputIdx < 0 || NumElts <= (unsigned)InputIdx)
9006 InputByteIdx = 0x80;
9008 // Cross lane is not allowed.
9009 if (ShuffleCrosses128bitLane(VT, InputIdx, OutputIdx))
9011 InputByteIdx = InputIdx * EltSizeInBytes;
9012 // Index is an byte offset within the 128-bit lane.
9013 InputByteIdx &= 0xf;
9016 for (unsigned j = 0; j < EltSizeInBytes; ++j) {
9017 PshufbMask.push_back(DAG.getConstant(InputByteIdx, MVT::i8));
9018 if (InputByteIdx != 0x80)
9023 MVT ShufVT = MVT::getVectorVT(MVT::i8, PshufbMask.size());
9025 V1 = DAG.getNode(ISD::BITCAST, dl, ShufVT, V1);
9026 return DAG.getNode(X86ISD::PSHUFB, dl, ShufVT, V1,
9027 DAG.getNode(ISD::BUILD_VECTOR, dl, ShufVT, PshufbMask));
9030 // v8i16 shuffles - Prefer shuffles in the following order:
9031 // 1. [all] pshuflw, pshufhw, optional move
9032 // 2. [ssse3] 1 x pshufb
9033 // 3. [ssse3] 2 x pshufb + 1 x por
9034 // 4. [all] mov + pshuflw + pshufhw + N x (pextrw + pinsrw)
9036 LowerVECTOR_SHUFFLEv8i16(SDValue Op, const X86Subtarget *Subtarget,
9037 SelectionDAG &DAG) {
9038 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
9039 SDValue V1 = SVOp->getOperand(0);
9040 SDValue V2 = SVOp->getOperand(1);
9042 SmallVector<int, 8> MaskVals;
9044 // Determine if more than 1 of the words in each of the low and high quadwords
9045 // of the result come from the same quadword of one of the two inputs. Undef
9046 // mask values count as coming from any quadword, for better codegen.
9048 // Lo/HiQuad[i] = j indicates how many words from the ith quad of the input
9049 // feeds this quad. For i, 0 and 1 refer to V1, 2 and 3 refer to V2.
9050 unsigned LoQuad[] = { 0, 0, 0, 0 };
9051 unsigned HiQuad[] = { 0, 0, 0, 0 };
9052 // Indices of quads used.
9053 std::bitset<4> InputQuads;
9054 for (unsigned i = 0; i < 8; ++i) {
9055 unsigned *Quad = i < 4 ? LoQuad : HiQuad;
9056 int EltIdx = SVOp->getMaskElt(i);
9057 MaskVals.push_back(EltIdx);
9066 InputQuads.set(EltIdx / 4);
9069 int BestLoQuad = -1;
9070 unsigned MaxQuad = 1;
9071 for (unsigned i = 0; i < 4; ++i) {
9072 if (LoQuad[i] > MaxQuad) {
9074 MaxQuad = LoQuad[i];
9078 int BestHiQuad = -1;
9080 for (unsigned i = 0; i < 4; ++i) {
9081 if (HiQuad[i] > MaxQuad) {
9083 MaxQuad = HiQuad[i];
9087 // For SSSE3, If all 8 words of the result come from only 1 quadword of each
9088 // of the two input vectors, shuffle them into one input vector so only a
9089 // single pshufb instruction is necessary. If there are more than 2 input
9090 // quads, disable the next transformation since it does not help SSSE3.
9091 bool V1Used = InputQuads[0] || InputQuads[1];
9092 bool V2Used = InputQuads[2] || InputQuads[3];
9093 if (Subtarget->hasSSSE3()) {
9094 if (InputQuads.count() == 2 && V1Used && V2Used) {
9095 BestLoQuad = InputQuads[0] ? 0 : 1;
9096 BestHiQuad = InputQuads[2] ? 2 : 3;
9098 if (InputQuads.count() > 2) {
9104 // If BestLoQuad or BestHiQuad are set, shuffle the quads together and update
9105 // the shuffle mask. If a quad is scored as -1, that means that it contains
9106 // words from all 4 input quadwords.
9108 if (BestLoQuad >= 0 || BestHiQuad >= 0) {
9110 BestLoQuad < 0 ? 0 : BestLoQuad,
9111 BestHiQuad < 0 ? 1 : BestHiQuad
9113 NewV = DAG.getVectorShuffle(MVT::v2i64, dl,
9114 DAG.getNode(ISD::BITCAST, dl, MVT::v2i64, V1),
9115 DAG.getNode(ISD::BITCAST, dl, MVT::v2i64, V2), &MaskV[0]);
9116 NewV = DAG.getNode(ISD::BITCAST, dl, MVT::v8i16, NewV);
9118 // Rewrite the MaskVals and assign NewV to V1 if NewV now contains all the
9119 // source words for the shuffle, to aid later transformations.
9120 bool AllWordsInNewV = true;
9121 bool InOrder[2] = { true, true };
9122 for (unsigned i = 0; i != 8; ++i) {
9123 int idx = MaskVals[i];
9125 InOrder[i/4] = false;
9126 if (idx < 0 || (idx/4) == BestLoQuad || (idx/4) == BestHiQuad)
9128 AllWordsInNewV = false;
9132 bool pshuflw = AllWordsInNewV, pshufhw = AllWordsInNewV;
9133 if (AllWordsInNewV) {
9134 for (int i = 0; i != 8; ++i) {
9135 int idx = MaskVals[i];
9138 idx = MaskVals[i] = (idx / 4) == BestLoQuad ? (idx & 3) : (idx & 3) + 4;
9139 if ((idx != i) && idx < 4)
9141 if ((idx != i) && idx > 3)
9150 // If we've eliminated the use of V2, and the new mask is a pshuflw or
9151 // pshufhw, that's as cheap as it gets. Return the new shuffle.
9152 if ((pshufhw && InOrder[0]) || (pshuflw && InOrder[1])) {
9153 unsigned Opc = pshufhw ? X86ISD::PSHUFHW : X86ISD::PSHUFLW;
9154 unsigned TargetMask = 0;
9155 NewV = DAG.getVectorShuffle(MVT::v8i16, dl, NewV,
9156 DAG.getUNDEF(MVT::v8i16), &MaskVals[0]);
9157 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(NewV.getNode());
9158 TargetMask = pshufhw ? getShufflePSHUFHWImmediate(SVOp):
9159 getShufflePSHUFLWImmediate(SVOp);
9160 V1 = NewV.getOperand(0);
9161 return getTargetShuffleNode(Opc, dl, MVT::v8i16, V1, TargetMask, DAG);
9165 // Promote splats to a larger type which usually leads to more efficient code.
9166 // FIXME: Is this true if pshufb is available?
9167 if (SVOp->isSplat())
9168 return PromoteSplat(SVOp, DAG);
9170 // If we have SSSE3, and all words of the result are from 1 input vector,
9171 // case 2 is generated, otherwise case 3 is generated. If no SSSE3
9172 // is present, fall back to case 4.
9173 if (Subtarget->hasSSSE3()) {
9174 SmallVector<SDValue,16> pshufbMask;
9176 // If we have elements from both input vectors, set the high bit of the
9177 // shuffle mask element to zero out elements that come from V2 in the V1
9178 // mask, and elements that come from V1 in the V2 mask, so that the two
9179 // results can be OR'd together.
9180 bool TwoInputs = V1Used && V2Used;
9181 V1 = getPSHUFB(MaskVals, V1, dl, DAG);
9183 return DAG.getNode(ISD::BITCAST, dl, MVT::v8i16, V1);
9185 // Calculate the shuffle mask for the second input, shuffle it, and
9186 // OR it with the first shuffled input.
9187 CommuteVectorShuffleMask(MaskVals, 8);
9188 V2 = getPSHUFB(MaskVals, V2, dl, DAG);
9189 V1 = DAG.getNode(ISD::OR, dl, MVT::v16i8, V1, V2);
9190 return DAG.getNode(ISD::BITCAST, dl, MVT::v8i16, V1);
9193 // If BestLoQuad >= 0, generate a pshuflw to put the low elements in order,
9194 // and update MaskVals with new element order.
9195 std::bitset<8> InOrder;
9196 if (BestLoQuad >= 0) {
9197 int MaskV[] = { -1, -1, -1, -1, 4, 5, 6, 7 };
9198 for (int i = 0; i != 4; ++i) {
9199 int idx = MaskVals[i];
9202 } else if ((idx / 4) == BestLoQuad) {
9207 NewV = DAG.getVectorShuffle(MVT::v8i16, dl, NewV, DAG.getUNDEF(MVT::v8i16),
9210 if (NewV.getOpcode() == ISD::VECTOR_SHUFFLE && Subtarget->hasSSE2()) {
9211 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(NewV.getNode());
9212 NewV = getTargetShuffleNode(X86ISD::PSHUFLW, dl, MVT::v8i16,
9214 getShufflePSHUFLWImmediate(SVOp), DAG);
9218 // If BestHi >= 0, generate a pshufhw to put the high elements in order,
9219 // and update MaskVals with the new element order.
9220 if (BestHiQuad >= 0) {
9221 int MaskV[] = { 0, 1, 2, 3, -1, -1, -1, -1 };
9222 for (unsigned i = 4; i != 8; ++i) {
9223 int idx = MaskVals[i];
9226 } else if ((idx / 4) == BestHiQuad) {
9227 MaskV[i] = (idx & 3) + 4;
9231 NewV = DAG.getVectorShuffle(MVT::v8i16, dl, NewV, DAG.getUNDEF(MVT::v8i16),
9234 if (NewV.getOpcode() == ISD::VECTOR_SHUFFLE && Subtarget->hasSSE2()) {
9235 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(NewV.getNode());
9236 NewV = getTargetShuffleNode(X86ISD::PSHUFHW, dl, MVT::v8i16,
9238 getShufflePSHUFHWImmediate(SVOp), DAG);
9242 // In case BestHi & BestLo were both -1, which means each quadword has a word
9243 // from each of the four input quadwords, calculate the InOrder bitvector now
9244 // before falling through to the insert/extract cleanup.
9245 if (BestLoQuad == -1 && BestHiQuad == -1) {
9247 for (int i = 0; i != 8; ++i)
9248 if (MaskVals[i] < 0 || MaskVals[i] == i)
9252 // The other elements are put in the right place using pextrw and pinsrw.
9253 for (unsigned i = 0; i != 8; ++i) {
9256 int EltIdx = MaskVals[i];
9259 SDValue ExtOp = (EltIdx < 8) ?
9260 DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::i16, V1,
9261 DAG.getIntPtrConstant(EltIdx)) :
9262 DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::i16, V2,
9263 DAG.getIntPtrConstant(EltIdx - 8));
9264 NewV = DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, MVT::v8i16, NewV, ExtOp,
9265 DAG.getIntPtrConstant(i));
9270 /// \brief v16i16 shuffles
9272 /// FIXME: We only support generation of a single pshufb currently. We can
9273 /// generalize the other applicable cases from LowerVECTOR_SHUFFLEv8i16 as
9274 /// well (e.g 2 x pshufb + 1 x por).
9276 LowerVECTOR_SHUFFLEv16i16(SDValue Op, SelectionDAG &DAG) {
9277 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
9278 SDValue V1 = SVOp->getOperand(0);
9279 SDValue V2 = SVOp->getOperand(1);
9282 if (V2.getOpcode() != ISD::UNDEF)
9285 SmallVector<int, 16> MaskVals(SVOp->getMask().begin(), SVOp->getMask().end());
9286 return getPSHUFB(MaskVals, V1, dl, DAG);
9289 // v16i8 shuffles - Prefer shuffles in the following order:
9290 // 1. [ssse3] 1 x pshufb
9291 // 2. [ssse3] 2 x pshufb + 1 x por
9292 // 3. [all] v8i16 shuffle + N x pextrw + rotate + pinsrw
9293 static SDValue LowerVECTOR_SHUFFLEv16i8(ShuffleVectorSDNode *SVOp,
9294 const X86Subtarget* Subtarget,
9295 SelectionDAG &DAG) {
9296 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
9297 SDValue V1 = SVOp->getOperand(0);
9298 SDValue V2 = SVOp->getOperand(1);
9300 ArrayRef<int> MaskVals = SVOp->getMask();
9302 // Promote splats to a larger type which usually leads to more efficient code.
9303 // FIXME: Is this true if pshufb is available?
9304 if (SVOp->isSplat())
9305 return PromoteSplat(SVOp, DAG);
9307 // If we have SSSE3, case 1 is generated when all result bytes come from
9308 // one of the inputs. Otherwise, case 2 is generated. If no SSSE3 is
9309 // present, fall back to case 3.
9311 // If SSSE3, use 1 pshufb instruction per vector with elements in the result.
9312 if (Subtarget->hasSSSE3()) {
9313 SmallVector<SDValue,16> pshufbMask;
9315 // If all result elements are from one input vector, then only translate
9316 // undef mask values to 0x80 (zero out result) in the pshufb mask.
9318 // Otherwise, we have elements from both input vectors, and must zero out
9319 // elements that come from V2 in the first mask, and V1 in the second mask
9320 // so that we can OR them together.
9321 for (unsigned i = 0; i != 16; ++i) {
9322 int EltIdx = MaskVals[i];
9323 if (EltIdx < 0 || EltIdx >= 16)
9325 pshufbMask.push_back(DAG.getConstant(EltIdx, MVT::i8));
9327 V1 = DAG.getNode(X86ISD::PSHUFB, dl, MVT::v16i8, V1,
9328 DAG.getNode(ISD::BUILD_VECTOR, dl,
9329 MVT::v16i8, pshufbMask));
9331 // As PSHUFB will zero elements with negative indices, it's safe to ignore
9332 // the 2nd operand if it's undefined or zero.
9333 if (V2.getOpcode() == ISD::UNDEF ||
9334 ISD::isBuildVectorAllZeros(V2.getNode()))
9337 // Calculate the shuffle mask for the second input, shuffle it, and
9338 // OR it with the first shuffled input.
9340 for (unsigned i = 0; i != 16; ++i) {
9341 int EltIdx = MaskVals[i];
9342 EltIdx = (EltIdx < 16) ? 0x80 : EltIdx - 16;
9343 pshufbMask.push_back(DAG.getConstant(EltIdx, MVT::i8));
9345 V2 = DAG.getNode(X86ISD::PSHUFB, dl, MVT::v16i8, V2,
9346 DAG.getNode(ISD::BUILD_VECTOR, dl,
9347 MVT::v16i8, pshufbMask));
9348 return DAG.getNode(ISD::OR, dl, MVT::v16i8, V1, V2);
9351 // No SSSE3 - Calculate in place words and then fix all out of place words
9352 // With 0-16 extracts & inserts. Worst case is 16 bytes out of order from
9353 // the 16 different words that comprise the two doublequadword input vectors.
9354 V1 = DAG.getNode(ISD::BITCAST, dl, MVT::v8i16, V1);
9355 V2 = DAG.getNode(ISD::BITCAST, dl, MVT::v8i16, V2);
9357 for (int i = 0; i != 8; ++i) {
9358 int Elt0 = MaskVals[i*2];
9359 int Elt1 = MaskVals[i*2+1];
9361 // This word of the result is all undef, skip it.
9362 if (Elt0 < 0 && Elt1 < 0)
9365 // This word of the result is already in the correct place, skip it.
9366 if ((Elt0 == i*2) && (Elt1 == i*2+1))
9369 SDValue Elt0Src = Elt0 < 16 ? V1 : V2;
9370 SDValue Elt1Src = Elt1 < 16 ? V1 : V2;
9373 // If Elt0 and Elt1 are defined, are consecutive, and can be load
9374 // using a single extract together, load it and store it.
9375 if ((Elt0 >= 0) && ((Elt0 + 1) == Elt1) && ((Elt0 & 1) == 0)) {
9376 InsElt = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::i16, Elt1Src,
9377 DAG.getIntPtrConstant(Elt1 / 2));
9378 NewV = DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, MVT::v8i16, NewV, InsElt,
9379 DAG.getIntPtrConstant(i));
9383 // If Elt1 is defined, extract it from the appropriate source. If the
9384 // source byte is not also odd, shift the extracted word left 8 bits
9385 // otherwise clear the bottom 8 bits if we need to do an or.
9387 InsElt = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::i16, Elt1Src,
9388 DAG.getIntPtrConstant(Elt1 / 2));
9389 if ((Elt1 & 1) == 0)
9390 InsElt = DAG.getNode(ISD::SHL, dl, MVT::i16, InsElt,
9392 TLI.getShiftAmountTy(InsElt.getValueType())));
9394 InsElt = DAG.getNode(ISD::AND, dl, MVT::i16, InsElt,
9395 DAG.getConstant(0xFF00, MVT::i16));
9397 // If Elt0 is defined, extract it from the appropriate source. If the
9398 // source byte is not also even, shift the extracted word right 8 bits. If
9399 // Elt1 was also defined, OR the extracted values together before
9400 // inserting them in the result.
9402 SDValue InsElt0 = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::i16,
9403 Elt0Src, DAG.getIntPtrConstant(Elt0 / 2));
9404 if ((Elt0 & 1) != 0)
9405 InsElt0 = DAG.getNode(ISD::SRL, dl, MVT::i16, InsElt0,
9407 TLI.getShiftAmountTy(InsElt0.getValueType())));
9409 InsElt0 = DAG.getNode(ISD::AND, dl, MVT::i16, InsElt0,
9410 DAG.getConstant(0x00FF, MVT::i16));
9411 InsElt = Elt1 >= 0 ? DAG.getNode(ISD::OR, dl, MVT::i16, InsElt, InsElt0)
9414 NewV = DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, MVT::v8i16, NewV, InsElt,
9415 DAG.getIntPtrConstant(i));
9417 return DAG.getNode(ISD::BITCAST, dl, MVT::v16i8, NewV);
9420 // v32i8 shuffles - Translate to VPSHUFB if possible.
9422 SDValue LowerVECTOR_SHUFFLEv32i8(ShuffleVectorSDNode *SVOp,
9423 const X86Subtarget *Subtarget,
9424 SelectionDAG &DAG) {
9425 MVT VT = SVOp->getSimpleValueType(0);
9426 SDValue V1 = SVOp->getOperand(0);
9427 SDValue V2 = SVOp->getOperand(1);
9429 SmallVector<int, 32> MaskVals(SVOp->getMask().begin(), SVOp->getMask().end());
9431 bool V2IsUndef = V2.getOpcode() == ISD::UNDEF;
9432 bool V1IsAllZero = ISD::isBuildVectorAllZeros(V1.getNode());
9433 bool V2IsAllZero = ISD::isBuildVectorAllZeros(V2.getNode());
9435 // VPSHUFB may be generated if
9436 // (1) one of input vector is undefined or zeroinitializer.
9437 // The mask value 0x80 puts 0 in the corresponding slot of the vector.
9438 // And (2) the mask indexes don't cross the 128-bit lane.
9439 if (VT != MVT::v32i8 || !Subtarget->hasInt256() ||
9440 (!V2IsUndef && !V2IsAllZero && !V1IsAllZero))
9443 if (V1IsAllZero && !V2IsAllZero) {
9444 CommuteVectorShuffleMask(MaskVals, 32);
9447 return getPSHUFB(MaskVals, V1, dl, DAG);
9450 /// RewriteAsNarrowerShuffle - Try rewriting v8i16 and v16i8 shuffles as 4 wide
9451 /// ones, or rewriting v4i32 / v4f32 as 2 wide ones if possible. This can be
9452 /// done when every pair / quad of shuffle mask elements point to elements in
9453 /// the right sequence. e.g.
9454 /// vector_shuffle X, Y, <2, 3, | 10, 11, | 0, 1, | 14, 15>
9456 SDValue RewriteAsNarrowerShuffle(ShuffleVectorSDNode *SVOp,
9457 SelectionDAG &DAG) {
9458 MVT VT = SVOp->getSimpleValueType(0);
9460 unsigned NumElems = VT.getVectorNumElements();
9463 switch (VT.SimpleTy) {
9464 default: llvm_unreachable("Unexpected!");
9467 return SDValue(SVOp, 0);
9468 case MVT::v4f32: NewVT = MVT::v2f64; Scale = 2; break;
9469 case MVT::v4i32: NewVT = MVT::v2i64; Scale = 2; break;
9470 case MVT::v8i16: NewVT = MVT::v4i32; Scale = 2; break;
9471 case MVT::v16i8: NewVT = MVT::v4i32; Scale = 4; break;
9472 case MVT::v16i16: NewVT = MVT::v8i32; Scale = 2; break;
9473 case MVT::v32i8: NewVT = MVT::v8i32; Scale = 4; break;
9476 SmallVector<int, 8> MaskVec;
9477 for (unsigned i = 0; i != NumElems; i += Scale) {
9479 for (unsigned j = 0; j != Scale; ++j) {
9480 int EltIdx = SVOp->getMaskElt(i+j);
9484 StartIdx = (EltIdx / Scale);
9485 if (EltIdx != (int)(StartIdx*Scale + j))
9488 MaskVec.push_back(StartIdx);
9491 SDValue V1 = DAG.getNode(ISD::BITCAST, dl, NewVT, SVOp->getOperand(0));
9492 SDValue V2 = DAG.getNode(ISD::BITCAST, dl, NewVT, SVOp->getOperand(1));
9493 return DAG.getVectorShuffle(NewVT, dl, V1, V2, &MaskVec[0]);
9496 /// getVZextMovL - Return a zero-extending vector move low node.
9498 static SDValue getVZextMovL(MVT VT, MVT OpVT,
9499 SDValue SrcOp, SelectionDAG &DAG,
9500 const X86Subtarget *Subtarget, SDLoc dl) {
9501 if (VT == MVT::v2f64 || VT == MVT::v4f32) {
9502 LoadSDNode *LD = nullptr;
9503 if (!isScalarLoadToVector(SrcOp.getNode(), &LD))
9504 LD = dyn_cast<LoadSDNode>(SrcOp);
9506 // movssrr and movsdrr do not clear top bits. Try to use movd, movq
9508 MVT ExtVT = (OpVT == MVT::v2f64) ? MVT::i64 : MVT::i32;
9509 if ((ExtVT != MVT::i64 || Subtarget->is64Bit()) &&
9510 SrcOp.getOpcode() == ISD::SCALAR_TO_VECTOR &&
9511 SrcOp.getOperand(0).getOpcode() == ISD::BITCAST &&
9512 SrcOp.getOperand(0).getOperand(0).getValueType() == ExtVT) {
9514 OpVT = (OpVT == MVT::v2f64) ? MVT::v2i64 : MVT::v4i32;
9515 return DAG.getNode(ISD::BITCAST, dl, VT,
9516 DAG.getNode(X86ISD::VZEXT_MOVL, dl, OpVT,
9517 DAG.getNode(ISD::SCALAR_TO_VECTOR, dl,
9525 return DAG.getNode(ISD::BITCAST, dl, VT,
9526 DAG.getNode(X86ISD::VZEXT_MOVL, dl, OpVT,
9527 DAG.getNode(ISD::BITCAST, dl,
9531 /// LowerVECTOR_SHUFFLE_256 - Handle all 256-bit wide vectors shuffles
9532 /// which could not be matched by any known target speficic shuffle
9534 LowerVECTOR_SHUFFLE_256(ShuffleVectorSDNode *SVOp, SelectionDAG &DAG) {
9536 SDValue NewOp = Compact8x32ShuffleNode(SVOp, DAG);
9537 if (NewOp.getNode())
9540 MVT VT = SVOp->getSimpleValueType(0);
9542 unsigned NumElems = VT.getVectorNumElements();
9543 unsigned NumLaneElems = NumElems / 2;
9546 MVT EltVT = VT.getVectorElementType();
9547 MVT NVT = MVT::getVectorVT(EltVT, NumLaneElems);
9550 SmallVector<int, 16> Mask;
9551 for (unsigned l = 0; l < 2; ++l) {
9552 // Build a shuffle mask for the output, discovering on the fly which
9553 // input vectors to use as shuffle operands (recorded in InputUsed).
9554 // If building a suitable shuffle vector proves too hard, then bail
9555 // out with UseBuildVector set.
9556 bool UseBuildVector = false;
9557 int InputUsed[2] = { -1, -1 }; // Not yet discovered.
9558 unsigned LaneStart = l * NumLaneElems;
9559 for (unsigned i = 0; i != NumLaneElems; ++i) {
9560 // The mask element. This indexes into the input.
9561 int Idx = SVOp->getMaskElt(i+LaneStart);
9563 // the mask element does not index into any input vector.
9568 // The input vector this mask element indexes into.
9569 int Input = Idx / NumLaneElems;
9571 // Turn the index into an offset from the start of the input vector.
9572 Idx -= Input * NumLaneElems;
9574 // Find or create a shuffle vector operand to hold this input.
9576 for (OpNo = 0; OpNo < array_lengthof(InputUsed); ++OpNo) {
9577 if (InputUsed[OpNo] == Input)
9578 // This input vector is already an operand.
9580 if (InputUsed[OpNo] < 0) {
9581 // Create a new operand for this input vector.
9582 InputUsed[OpNo] = Input;
9587 if (OpNo >= array_lengthof(InputUsed)) {
9588 // More than two input vectors used! Give up on trying to create a
9589 // shuffle vector. Insert all elements into a BUILD_VECTOR instead.
9590 UseBuildVector = true;
9594 // Add the mask index for the new shuffle vector.
9595 Mask.push_back(Idx + OpNo * NumLaneElems);
9598 if (UseBuildVector) {
9599 SmallVector<SDValue, 16> SVOps;
9600 for (unsigned i = 0; i != NumLaneElems; ++i) {
9601 // The mask element. This indexes into the input.
9602 int Idx = SVOp->getMaskElt(i+LaneStart);
9604 SVOps.push_back(DAG.getUNDEF(EltVT));
9608 // The input vector this mask element indexes into.
9609 int Input = Idx / NumElems;
9611 // Turn the index into an offset from the start of the input vector.
9612 Idx -= Input * NumElems;
9614 // Extract the vector element by hand.
9615 SVOps.push_back(DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, EltVT,
9616 SVOp->getOperand(Input),
9617 DAG.getIntPtrConstant(Idx)));
9620 // Construct the output using a BUILD_VECTOR.
9621 Output[l] = DAG.getNode(ISD::BUILD_VECTOR, dl, NVT, SVOps);
9622 } else if (InputUsed[0] < 0) {
9623 // No input vectors were used! The result is undefined.
9624 Output[l] = DAG.getUNDEF(NVT);
9626 SDValue Op0 = Extract128BitVector(SVOp->getOperand(InputUsed[0] / 2),
9627 (InputUsed[0] % 2) * NumLaneElems,
9629 // If only one input was used, use an undefined vector for the other.
9630 SDValue Op1 = (InputUsed[1] < 0) ? DAG.getUNDEF(NVT) :
9631 Extract128BitVector(SVOp->getOperand(InputUsed[1] / 2),
9632 (InputUsed[1] % 2) * NumLaneElems, DAG, dl);
9633 // At least one input vector was used. Create a new shuffle vector.
9634 Output[l] = DAG.getVectorShuffle(NVT, dl, Op0, Op1, &Mask[0]);
9640 // Concatenate the result back
9641 return DAG.getNode(ISD::CONCAT_VECTORS, dl, VT, Output[0], Output[1]);
9644 /// LowerVECTOR_SHUFFLE_128v4 - Handle all 128-bit wide vectors with
9645 /// 4 elements, and match them with several different shuffle types.
9647 LowerVECTOR_SHUFFLE_128v4(ShuffleVectorSDNode *SVOp, SelectionDAG &DAG) {
9648 SDValue V1 = SVOp->getOperand(0);
9649 SDValue V2 = SVOp->getOperand(1);
9651 MVT VT = SVOp->getSimpleValueType(0);
9653 assert(VT.is128BitVector() && "Unsupported vector size");
9655 std::pair<int, int> Locs[4];
9656 int Mask1[] = { -1, -1, -1, -1 };
9657 SmallVector<int, 8> PermMask(SVOp->getMask().begin(), SVOp->getMask().end());
9661 for (unsigned i = 0; i != 4; ++i) {
9662 int Idx = PermMask[i];
9664 Locs[i] = std::make_pair(-1, -1);
9666 assert(Idx < 8 && "Invalid VECTOR_SHUFFLE index!");
9668 Locs[i] = std::make_pair(0, NumLo);
9672 Locs[i] = std::make_pair(1, NumHi);
9674 Mask1[2+NumHi] = Idx;
9680 if (NumLo <= 2 && NumHi <= 2) {
9681 // If no more than two elements come from either vector. This can be
9682 // implemented with two shuffles. First shuffle gather the elements.
9683 // The second shuffle, which takes the first shuffle as both of its
9684 // vector operands, put the elements into the right order.
9685 V1 = DAG.getVectorShuffle(VT, dl, V1, V2, &Mask1[0]);
9687 int Mask2[] = { -1, -1, -1, -1 };
9689 for (unsigned i = 0; i != 4; ++i)
9690 if (Locs[i].first != -1) {
9691 unsigned Idx = (i < 2) ? 0 : 4;
9692 Idx += Locs[i].first * 2 + Locs[i].second;
9696 return DAG.getVectorShuffle(VT, dl, V1, V1, &Mask2[0]);
9699 if (NumLo == 3 || NumHi == 3) {
9700 // Otherwise, we must have three elements from one vector, call it X, and
9701 // one element from the other, call it Y. First, use a shufps to build an
9702 // intermediate vector with the one element from Y and the element from X
9703 // that will be in the same half in the final destination (the indexes don't
9704 // matter). Then, use a shufps to build the final vector, taking the half
9705 // containing the element from Y from the intermediate, and the other half
9708 // Normalize it so the 3 elements come from V1.
9709 CommuteVectorShuffleMask(PermMask, 4);
9713 // Find the element from V2.
9715 for (HiIndex = 0; HiIndex < 3; ++HiIndex) {
9716 int Val = PermMask[HiIndex];
9723 Mask1[0] = PermMask[HiIndex];
9725 Mask1[2] = PermMask[HiIndex^1];
9727 V2 = DAG.getVectorShuffle(VT, dl, V1, V2, &Mask1[0]);
9730 Mask1[0] = PermMask[0];
9731 Mask1[1] = PermMask[1];
9732 Mask1[2] = HiIndex & 1 ? 6 : 4;
9733 Mask1[3] = HiIndex & 1 ? 4 : 6;
9734 return DAG.getVectorShuffle(VT, dl, V1, V2, &Mask1[0]);
9737 Mask1[0] = HiIndex & 1 ? 2 : 0;
9738 Mask1[1] = HiIndex & 1 ? 0 : 2;
9739 Mask1[2] = PermMask[2];
9740 Mask1[3] = PermMask[3];
9745 return DAG.getVectorShuffle(VT, dl, V2, V1, &Mask1[0]);
9748 // Break it into (shuffle shuffle_hi, shuffle_lo).
9749 int LoMask[] = { -1, -1, -1, -1 };
9750 int HiMask[] = { -1, -1, -1, -1 };
9752 int *MaskPtr = LoMask;
9753 unsigned MaskIdx = 0;
9756 for (unsigned i = 0; i != 4; ++i) {
9763 int Idx = PermMask[i];
9765 Locs[i] = std::make_pair(-1, -1);
9766 } else if (Idx < 4) {
9767 Locs[i] = std::make_pair(MaskIdx, LoIdx);
9768 MaskPtr[LoIdx] = Idx;
9771 Locs[i] = std::make_pair(MaskIdx, HiIdx);
9772 MaskPtr[HiIdx] = Idx;
9777 SDValue LoShuffle = DAG.getVectorShuffle(VT, dl, V1, V2, &LoMask[0]);
9778 SDValue HiShuffle = DAG.getVectorShuffle(VT, dl, V1, V2, &HiMask[0]);
9779 int MaskOps[] = { -1, -1, -1, -1 };
9780 for (unsigned i = 0; i != 4; ++i)
9781 if (Locs[i].first != -1)
9782 MaskOps[i] = Locs[i].first * 4 + Locs[i].second;
9783 return DAG.getVectorShuffle(VT, dl, LoShuffle, HiShuffle, &MaskOps[0]);
9786 static bool MayFoldVectorLoad(SDValue V) {
9787 while (V.hasOneUse() && V.getOpcode() == ISD::BITCAST)
9788 V = V.getOperand(0);
9790 if (V.hasOneUse() && V.getOpcode() == ISD::SCALAR_TO_VECTOR)
9791 V = V.getOperand(0);
9792 if (V.hasOneUse() && V.getOpcode() == ISD::BUILD_VECTOR &&
9793 V.getNumOperands() == 2 && V.getOperand(1).getOpcode() == ISD::UNDEF)
9794 // BUILD_VECTOR (load), undef
9795 V = V.getOperand(0);
9797 return MayFoldLoad(V);
9801 SDValue getMOVDDup(SDValue &Op, SDLoc &dl, SDValue V1, SelectionDAG &DAG) {
9802 MVT VT = Op.getSimpleValueType();
9804 // Canonizalize to v2f64.
9805 V1 = DAG.getNode(ISD::BITCAST, dl, MVT::v2f64, V1);
9806 return DAG.getNode(ISD::BITCAST, dl, VT,
9807 getTargetShuffleNode(X86ISD::MOVDDUP, dl, MVT::v2f64,
9812 SDValue getMOVLowToHigh(SDValue &Op, SDLoc &dl, SelectionDAG &DAG,
9814 SDValue V1 = Op.getOperand(0);
9815 SDValue V2 = Op.getOperand(1);
9816 MVT VT = Op.getSimpleValueType();
9818 assert(VT != MVT::v2i64 && "unsupported shuffle type");
9820 if (HasSSE2 && VT == MVT::v2f64)
9821 return getTargetShuffleNode(X86ISD::MOVLHPD, dl, VT, V1, V2, DAG);
9823 // v4f32 or v4i32: canonizalized to v4f32 (which is legal for SSE1)
9824 return DAG.getNode(ISD::BITCAST, dl, VT,
9825 getTargetShuffleNode(X86ISD::MOVLHPS, dl, MVT::v4f32,
9826 DAG.getNode(ISD::BITCAST, dl, MVT::v4f32, V1),
9827 DAG.getNode(ISD::BITCAST, dl, MVT::v4f32, V2), DAG));
9831 SDValue getMOVHighToLow(SDValue &Op, SDLoc &dl, SelectionDAG &DAG) {
9832 SDValue V1 = Op.getOperand(0);
9833 SDValue V2 = Op.getOperand(1);
9834 MVT VT = Op.getSimpleValueType();
9836 assert((VT == MVT::v4i32 || VT == MVT::v4f32) &&
9837 "unsupported shuffle type");
9839 if (V2.getOpcode() == ISD::UNDEF)
9843 return getTargetShuffleNode(X86ISD::MOVHLPS, dl, VT, V1, V2, DAG);
9847 SDValue getMOVLP(SDValue &Op, SDLoc &dl, SelectionDAG &DAG, bool HasSSE2) {
9848 SDValue V1 = Op.getOperand(0);
9849 SDValue V2 = Op.getOperand(1);
9850 MVT VT = Op.getSimpleValueType();
9851 unsigned NumElems = VT.getVectorNumElements();
9853 // Use MOVLPS and MOVLPD in case V1 or V2 are loads. During isel, the second
9854 // operand of these instructions is only memory, so check if there's a
9855 // potencial load folding here, otherwise use SHUFPS or MOVSD to match the
9857 bool CanFoldLoad = false;
9859 // Trivial case, when V2 comes from a load.
9860 if (MayFoldVectorLoad(V2))
9863 // When V1 is a load, it can be folded later into a store in isel, example:
9864 // (store (v4f32 (X86Movlps (load addr:$src1), VR128:$src2)), addr:$src1)
9866 // (MOVLPSmr addr:$src1, VR128:$src2)
9867 // So, recognize this potential and also use MOVLPS or MOVLPD
9868 else if (MayFoldVectorLoad(V1) && MayFoldIntoStore(Op))
9871 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
9873 if (HasSSE2 && NumElems == 2)
9874 return getTargetShuffleNode(X86ISD::MOVLPD, dl, VT, V1, V2, DAG);
9877 // If we don't care about the second element, proceed to use movss.
9878 if (SVOp->getMaskElt(1) != -1)
9879 return getTargetShuffleNode(X86ISD::MOVLPS, dl, VT, V1, V2, DAG);
9882 // movl and movlp will both match v2i64, but v2i64 is never matched by
9883 // movl earlier because we make it strict to avoid messing with the movlp load
9884 // folding logic (see the code above getMOVLP call). Match it here then,
9885 // this is horrible, but will stay like this until we move all shuffle
9886 // matching to x86 specific nodes. Note that for the 1st condition all
9887 // types are matched with movsd.
9889 // FIXME: isMOVLMask should be checked and matched before getMOVLP,
9890 // as to remove this logic from here, as much as possible
9891 if (NumElems == 2 || !isMOVLMask(SVOp->getMask(), VT))
9892 return getTargetShuffleNode(X86ISD::MOVSD, dl, VT, V1, V2, DAG);
9893 return getTargetShuffleNode(X86ISD::MOVSS, dl, VT, V1, V2, DAG);
9896 assert(VT != MVT::v4i32 && "unsupported shuffle type");
9898 // Invert the operand order and use SHUFPS to match it.
9899 return getTargetShuffleNode(X86ISD::SHUFP, dl, VT, V2, V1,
9900 getShuffleSHUFImmediate(SVOp), DAG);
9903 static SDValue NarrowVectorLoadToElement(LoadSDNode *Load, unsigned Index,
9904 SelectionDAG &DAG) {
9906 MVT VT = Load->getSimpleValueType(0);
9907 MVT EVT = VT.getVectorElementType();
9908 SDValue Addr = Load->getOperand(1);
9909 SDValue NewAddr = DAG.getNode(
9910 ISD::ADD, dl, Addr.getSimpleValueType(), Addr,
9911 DAG.getConstant(Index * EVT.getStoreSize(), Addr.getSimpleValueType()));
9914 DAG.getLoad(EVT, dl, Load->getChain(), NewAddr,
9915 DAG.getMachineFunction().getMachineMemOperand(
9916 Load->getMemOperand(), 0, EVT.getStoreSize()));
9920 // It is only safe to call this function if isINSERTPSMask is true for
9921 // this shufflevector mask.
9922 static SDValue getINSERTPS(ShuffleVectorSDNode *SVOp, SDLoc &dl,
9923 SelectionDAG &DAG) {
9924 // Generate an insertps instruction when inserting an f32 from memory onto a
9925 // v4f32 or when copying a member from one v4f32 to another.
9926 // We also use it for transferring i32 from one register to another,
9927 // since it simply copies the same bits.
9928 // If we're transferring an i32 from memory to a specific element in a
9929 // register, we output a generic DAG that will match the PINSRD
9931 MVT VT = SVOp->getSimpleValueType(0);
9932 MVT EVT = VT.getVectorElementType();
9933 SDValue V1 = SVOp->getOperand(0);
9934 SDValue V2 = SVOp->getOperand(1);
9935 auto Mask = SVOp->getMask();
9936 assert((VT == MVT::v4f32 || VT == MVT::v4i32) &&
9937 "unsupported vector type for insertps/pinsrd");
9939 auto FromV1Predicate = [](const int &i) { return i < 4 && i > -1; };
9940 auto FromV2Predicate = [](const int &i) { return i >= 4; };
9941 int FromV1 = std::count_if(Mask.begin(), Mask.end(), FromV1Predicate);
9949 DestIndex = std::find_if(Mask.begin(), Mask.end(), FromV1Predicate) -
9952 // If we have 1 element from each vector, we have to check if we're
9953 // changing V1's element's place. If so, we're done. Otherwise, we
9954 // should assume we're changing V2's element's place and behave
9956 int FromV2 = std::count_if(Mask.begin(), Mask.end(), FromV2Predicate);
9957 assert(DestIndex <= INT32_MAX && "truncated destination index");
9958 if (FromV1 == FromV2 &&
9959 static_cast<int>(DestIndex) == Mask[DestIndex] % 4) {
9963 std::find_if(Mask.begin(), Mask.end(), FromV2Predicate) - Mask.begin();
9966 assert(std::count_if(Mask.begin(), Mask.end(), FromV2Predicate) == 1 &&
9967 "More than one element from V1 and from V2, or no elements from one "
9968 "of the vectors. This case should not have returned true from "
9973 std::find_if(Mask.begin(), Mask.end(), FromV2Predicate) - Mask.begin();
9976 // Get an index into the source vector in the range [0,4) (the mask is
9977 // in the range [0,8) because it can address V1 and V2)
9978 unsigned SrcIndex = Mask[DestIndex] % 4;
9979 if (MayFoldLoad(From)) {
9980 // Trivial case, when From comes from a load and is only used by the
9981 // shuffle. Make it use insertps from the vector that we need from that
9984 NarrowVectorLoadToElement(cast<LoadSDNode>(From), SrcIndex, DAG);
9985 if (!NewLoad.getNode())
9988 if (EVT == MVT::f32) {
9989 // Create this as a scalar to vector to match the instruction pattern.
9990 SDValue LoadScalarToVector =
9991 DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VT, NewLoad);
9992 SDValue InsertpsMask = DAG.getIntPtrConstant(DestIndex << 4);
9993 return DAG.getNode(X86ISD::INSERTPS, dl, VT, To, LoadScalarToVector,
9995 } else { // EVT == MVT::i32
9996 // If we're getting an i32 from memory, use an INSERT_VECTOR_ELT
9997 // instruction, to match the PINSRD instruction, which loads an i32 to a
9998 // certain vector element.
9999 return DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, VT, To, NewLoad,
10000 DAG.getConstant(DestIndex, MVT::i32));
10004 // Vector-element-to-vector
10005 SDValue InsertpsMask = DAG.getIntPtrConstant(DestIndex << 4 | SrcIndex << 6);
10006 return DAG.getNode(X86ISD::INSERTPS, dl, VT, To, From, InsertpsMask);
10009 // Reduce a vector shuffle to zext.
10010 static SDValue LowerVectorIntExtend(SDValue Op, const X86Subtarget *Subtarget,
10011 SelectionDAG &DAG) {
10012 // PMOVZX is only available from SSE41.
10013 if (!Subtarget->hasSSE41())
10016 MVT VT = Op.getSimpleValueType();
10018 // Only AVX2 support 256-bit vector integer extending.
10019 if (!Subtarget->hasInt256() && VT.is256BitVector())
10022 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
10024 SDValue V1 = Op.getOperand(0);
10025 SDValue V2 = Op.getOperand(1);
10026 unsigned NumElems = VT.getVectorNumElements();
10028 // Extending is an unary operation and the element type of the source vector
10029 // won't be equal to or larger than i64.
10030 if (V2.getOpcode() != ISD::UNDEF || !VT.isInteger() ||
10031 VT.getVectorElementType() == MVT::i64)
10034 // Find the expansion ratio, e.g. expanding from i8 to i32 has a ratio of 4.
10035 unsigned Shift = 1; // Start from 2, i.e. 1 << 1.
10036 while ((1U << Shift) < NumElems) {
10037 if (SVOp->getMaskElt(1U << Shift) == 1)
10040 // The maximal ratio is 8, i.e. from i8 to i64.
10045 // Check the shuffle mask.
10046 unsigned Mask = (1U << Shift) - 1;
10047 for (unsigned i = 0; i != NumElems; ++i) {
10048 int EltIdx = SVOp->getMaskElt(i);
10049 if ((i & Mask) != 0 && EltIdx != -1)
10051 if ((i & Mask) == 0 && (unsigned)EltIdx != (i >> Shift))
10055 unsigned NBits = VT.getVectorElementType().getSizeInBits() << Shift;
10056 MVT NeVT = MVT::getIntegerVT(NBits);
10057 MVT NVT = MVT::getVectorVT(NeVT, NumElems >> Shift);
10059 if (!DAG.getTargetLoweringInfo().isTypeLegal(NVT))
10062 // Simplify the operand as it's prepared to be fed into shuffle.
10063 unsigned SignificantBits = NVT.getSizeInBits() >> Shift;
10064 if (V1.getOpcode() == ISD::BITCAST &&
10065 V1.getOperand(0).getOpcode() == ISD::SCALAR_TO_VECTOR &&
10066 V1.getOperand(0).getOperand(0).getOpcode() == ISD::EXTRACT_VECTOR_ELT &&
10067 V1.getOperand(0).getOperand(0)
10068 .getSimpleValueType().getSizeInBits() == SignificantBits) {
10069 // (bitcast (sclr2vec (ext_vec_elt x))) -> (bitcast x)
10070 SDValue V = V1.getOperand(0).getOperand(0).getOperand(0);
10071 ConstantSDNode *CIdx =
10072 dyn_cast<ConstantSDNode>(V1.getOperand(0).getOperand(0).getOperand(1));
10073 // If it's foldable, i.e. normal load with single use, we will let code
10074 // selection to fold it. Otherwise, we will short the conversion sequence.
10075 if (CIdx && CIdx->getZExtValue() == 0 &&
10076 (!ISD::isNormalLoad(V.getNode()) || !V.hasOneUse())) {
10077 MVT FullVT = V.getSimpleValueType();
10078 MVT V1VT = V1.getSimpleValueType();
10079 if (FullVT.getSizeInBits() > V1VT.getSizeInBits()) {
10080 // The "ext_vec_elt" node is wider than the result node.
10081 // In this case we should extract subvector from V.
10082 // (bitcast (sclr2vec (ext_vec_elt x))) -> (bitcast (extract_subvector x)).
10083 unsigned Ratio = FullVT.getSizeInBits() / V1VT.getSizeInBits();
10084 MVT SubVecVT = MVT::getVectorVT(FullVT.getVectorElementType(),
10085 FullVT.getVectorNumElements()/Ratio);
10086 V = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, SubVecVT, V,
10087 DAG.getIntPtrConstant(0));
10089 V1 = DAG.getNode(ISD::BITCAST, DL, V1VT, V);
10093 return DAG.getNode(ISD::BITCAST, DL, VT,
10094 DAG.getNode(X86ISD::VZEXT, DL, NVT, V1));
10097 static SDValue NormalizeVectorShuffle(SDValue Op, const X86Subtarget *Subtarget,
10098 SelectionDAG &DAG) {
10099 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
10100 MVT VT = Op.getSimpleValueType();
10102 SDValue V1 = Op.getOperand(0);
10103 SDValue V2 = Op.getOperand(1);
10105 if (isZeroShuffle(SVOp))
10106 return getZeroVector(VT, Subtarget, DAG, dl);
10108 // Handle splat operations
10109 if (SVOp->isSplat()) {
10110 // Use vbroadcast whenever the splat comes from a foldable load
10111 SDValue Broadcast = LowerVectorBroadcast(Op, Subtarget, DAG);
10112 if (Broadcast.getNode())
10116 // Check integer expanding shuffles.
10117 SDValue NewOp = LowerVectorIntExtend(Op, Subtarget, DAG);
10118 if (NewOp.getNode())
10121 // If the shuffle can be profitably rewritten as a narrower shuffle, then
10123 if (VT == MVT::v8i16 || VT == MVT::v16i8 || VT == MVT::v16i16 ||
10124 VT == MVT::v32i8) {
10125 SDValue NewOp = RewriteAsNarrowerShuffle(SVOp, DAG);
10126 if (NewOp.getNode())
10127 return DAG.getNode(ISD::BITCAST, dl, VT, NewOp);
10128 } else if (VT.is128BitVector() && Subtarget->hasSSE2()) {
10129 // FIXME: Figure out a cleaner way to do this.
10130 if (ISD::isBuildVectorAllZeros(V2.getNode())) {
10131 SDValue NewOp = RewriteAsNarrowerShuffle(SVOp, DAG);
10132 if (NewOp.getNode()) {
10133 MVT NewVT = NewOp.getSimpleValueType();
10134 if (isCommutedMOVLMask(cast<ShuffleVectorSDNode>(NewOp)->getMask(),
10135 NewVT, true, false))
10136 return getVZextMovL(VT, NewVT, NewOp.getOperand(0), DAG, Subtarget,
10139 } else if (ISD::isBuildVectorAllZeros(V1.getNode())) {
10140 SDValue NewOp = RewriteAsNarrowerShuffle(SVOp, DAG);
10141 if (NewOp.getNode()) {
10142 MVT NewVT = NewOp.getSimpleValueType();
10143 if (isMOVLMask(cast<ShuffleVectorSDNode>(NewOp)->getMask(), NewVT))
10144 return getVZextMovL(VT, NewVT, NewOp.getOperand(1), DAG, Subtarget,
10153 X86TargetLowering::LowerVECTOR_SHUFFLE(SDValue Op, SelectionDAG &DAG) const {
10154 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
10155 SDValue V1 = Op.getOperand(0);
10156 SDValue V2 = Op.getOperand(1);
10157 MVT VT = Op.getSimpleValueType();
10159 unsigned NumElems = VT.getVectorNumElements();
10160 bool V1IsUndef = V1.getOpcode() == ISD::UNDEF;
10161 bool V2IsUndef = V2.getOpcode() == ISD::UNDEF;
10162 bool V1IsSplat = false;
10163 bool V2IsSplat = false;
10164 bool HasSSE2 = Subtarget->hasSSE2();
10165 bool HasFp256 = Subtarget->hasFp256();
10166 bool HasInt256 = Subtarget->hasInt256();
10167 MachineFunction &MF = DAG.getMachineFunction();
10168 bool OptForSize = MF.getFunction()->getAttributes().
10169 hasAttribute(AttributeSet::FunctionIndex, Attribute::OptimizeForSize);
10171 // Check if we should use the experimental vector shuffle lowering. If so,
10172 // delegate completely to that code path.
10173 if (ExperimentalVectorShuffleLowering)
10174 return lowerVectorShuffle(Op, Subtarget, DAG);
10176 assert(VT.getSizeInBits() != 64 && "Can't lower MMX shuffles");
10178 if (V1IsUndef && V2IsUndef)
10179 return DAG.getUNDEF(VT);
10181 // When we create a shuffle node we put the UNDEF node to second operand,
10182 // but in some cases the first operand may be transformed to UNDEF.
10183 // In this case we should just commute the node.
10185 return DAG.getCommutedVectorShuffle(*SVOp);
10187 // Vector shuffle lowering takes 3 steps:
10189 // 1) Normalize the input vectors. Here splats, zeroed vectors, profitable
10190 // narrowing and commutation of operands should be handled.
10191 // 2) Matching of shuffles with known shuffle masks to x86 target specific
10193 // 3) Rewriting of unmatched masks into new generic shuffle operations,
10194 // so the shuffle can be broken into other shuffles and the legalizer can
10195 // try the lowering again.
10197 // The general idea is that no vector_shuffle operation should be left to
10198 // be matched during isel, all of them must be converted to a target specific
10201 // Normalize the input vectors. Here splats, zeroed vectors, profitable
10202 // narrowing and commutation of operands should be handled. The actual code
10203 // doesn't include all of those, work in progress...
10204 SDValue NewOp = NormalizeVectorShuffle(Op, Subtarget, DAG);
10205 if (NewOp.getNode())
10208 SmallVector<int, 8> M(SVOp->getMask().begin(), SVOp->getMask().end());
10210 // NOTE: isPSHUFDMask can also match both masks below (unpckl_undef and
10211 // unpckh_undef). Only use pshufd if speed is more important than size.
10212 if (OptForSize && isUNPCKL_v_undef_Mask(M, VT, HasInt256))
10213 return getTargetShuffleNode(X86ISD::UNPCKL, dl, VT, V1, V1, DAG);
10214 if (OptForSize && isUNPCKH_v_undef_Mask(M, VT, HasInt256))
10215 return getTargetShuffleNode(X86ISD::UNPCKH, dl, VT, V1, V1, DAG);
10217 if (isMOVDDUPMask(M, VT) && Subtarget->hasSSE3() &&
10218 V2IsUndef && MayFoldVectorLoad(V1))
10219 return getMOVDDup(Op, dl, V1, DAG);
10221 if (isMOVHLPS_v_undef_Mask(M, VT))
10222 return getMOVHighToLow(Op, dl, DAG);
10224 // Use to match splats
10225 if (HasSSE2 && isUNPCKHMask(M, VT, HasInt256) && V2IsUndef &&
10226 (VT == MVT::v2f64 || VT == MVT::v2i64))
10227 return getTargetShuffleNode(X86ISD::UNPCKH, dl, VT, V1, V1, DAG);
10229 if (isPSHUFDMask(M, VT)) {
10230 // The actual implementation will match the mask in the if above and then
10231 // during isel it can match several different instructions, not only pshufd
10232 // as its name says, sad but true, emulate the behavior for now...
10233 if (isMOVDDUPMask(M, VT) && ((VT == MVT::v4f32 || VT == MVT::v2i64)))
10234 return getTargetShuffleNode(X86ISD::MOVLHPS, dl, VT, V1, V1, DAG);
10236 unsigned TargetMask = getShuffleSHUFImmediate(SVOp);
10238 if (HasSSE2 && (VT == MVT::v4f32 || VT == MVT::v4i32))
10239 return getTargetShuffleNode(X86ISD::PSHUFD, dl, VT, V1, TargetMask, DAG);
10241 if (HasFp256 && (VT == MVT::v4f32 || VT == MVT::v2f64))
10242 return getTargetShuffleNode(X86ISD::VPERMILP, dl, VT, V1, TargetMask,
10245 return getTargetShuffleNode(X86ISD::SHUFP, dl, VT, V1, V1,
10249 if (isPALIGNRMask(M, VT, Subtarget))
10250 return getTargetShuffleNode(X86ISD::PALIGNR, dl, VT, V1, V2,
10251 getShufflePALIGNRImmediate(SVOp),
10254 if (isVALIGNMask(M, VT, Subtarget))
10255 return getTargetShuffleNode(X86ISD::VALIGN, dl, VT, V1, V2,
10256 getShuffleVALIGNImmediate(SVOp),
10259 // Check if this can be converted into a logical shift.
10260 bool isLeft = false;
10261 unsigned ShAmt = 0;
10263 bool isShift = HasSSE2 && isVectorShift(SVOp, DAG, isLeft, ShVal, ShAmt);
10264 if (isShift && ShVal.hasOneUse()) {
10265 // If the shifted value has multiple uses, it may be cheaper to use
10266 // v_set0 + movlhps or movhlps, etc.
10267 MVT EltVT = VT.getVectorElementType();
10268 ShAmt *= EltVT.getSizeInBits();
10269 return getVShift(isLeft, VT, ShVal, ShAmt, DAG, *this, dl);
10272 if (isMOVLMask(M, VT)) {
10273 if (ISD::isBuildVectorAllZeros(V1.getNode()))
10274 return getVZextMovL(VT, VT, V2, DAG, Subtarget, dl);
10275 if (!isMOVLPMask(M, VT)) {
10276 if (HasSSE2 && (VT == MVT::v2i64 || VT == MVT::v2f64))
10277 return getTargetShuffleNode(X86ISD::MOVSD, dl, VT, V1, V2, DAG);
10279 if (VT == MVT::v4i32 || VT == MVT::v4f32)
10280 return getTargetShuffleNode(X86ISD::MOVSS, dl, VT, V1, V2, DAG);
10284 // FIXME: fold these into legal mask.
10285 if (isMOVLHPSMask(M, VT) && !isUNPCKLMask(M, VT, HasInt256))
10286 return getMOVLowToHigh(Op, dl, DAG, HasSSE2);
10288 if (isMOVHLPSMask(M, VT))
10289 return getMOVHighToLow(Op, dl, DAG);
10291 if (V2IsUndef && isMOVSHDUPMask(M, VT, Subtarget))
10292 return getTargetShuffleNode(X86ISD::MOVSHDUP, dl, VT, V1, DAG);
10294 if (V2IsUndef && isMOVSLDUPMask(M, VT, Subtarget))
10295 return getTargetShuffleNode(X86ISD::MOVSLDUP, dl, VT, V1, DAG);
10297 if (isMOVLPMask(M, VT))
10298 return getMOVLP(Op, dl, DAG, HasSSE2);
10300 if (ShouldXformToMOVHLPS(M, VT) ||
10301 ShouldXformToMOVLP(V1.getNode(), V2.getNode(), M, VT))
10302 return DAG.getCommutedVectorShuffle(*SVOp);
10305 // No better options. Use a vshldq / vsrldq.
10306 MVT EltVT = VT.getVectorElementType();
10307 ShAmt *= EltVT.getSizeInBits();
10308 return getVShift(isLeft, VT, ShVal, ShAmt, DAG, *this, dl);
10311 bool Commuted = false;
10312 // FIXME: This should also accept a bitcast of a splat? Be careful, not
10313 // 1,1,1,1 -> v8i16 though.
10314 BitVector UndefElements;
10315 if (auto *BVOp = dyn_cast<BuildVectorSDNode>(V1.getNode()))
10316 if (BVOp->getConstantSplatNode(&UndefElements) && UndefElements.none())
10318 if (auto *BVOp = dyn_cast<BuildVectorSDNode>(V2.getNode()))
10319 if (BVOp->getConstantSplatNode(&UndefElements) && UndefElements.none())
10322 // Canonicalize the splat or undef, if present, to be on the RHS.
10323 if (!V2IsUndef && V1IsSplat && !V2IsSplat) {
10324 CommuteVectorShuffleMask(M, NumElems);
10326 std::swap(V1IsSplat, V2IsSplat);
10330 if (isCommutedMOVLMask(M, VT, V2IsSplat, V2IsUndef)) {
10331 // Shuffling low element of v1 into undef, just return v1.
10334 // If V2 is a splat, the mask may be malformed such as <4,3,3,3>, which
10335 // the instruction selector will not match, so get a canonical MOVL with
10336 // swapped operands to undo the commute.
10337 return getMOVL(DAG, dl, VT, V2, V1);
10340 if (isUNPCKLMask(M, VT, HasInt256))
10341 return getTargetShuffleNode(X86ISD::UNPCKL, dl, VT, V1, V2, DAG);
10343 if (isUNPCKHMask(M, VT, HasInt256))
10344 return getTargetShuffleNode(X86ISD::UNPCKH, dl, VT, V1, V2, DAG);
10347 // Normalize mask so all entries that point to V2 points to its first
10348 // element then try to match unpck{h|l} again. If match, return a
10349 // new vector_shuffle with the corrected mask.p
10350 SmallVector<int, 8> NewMask(M.begin(), M.end());
10351 NormalizeMask(NewMask, NumElems);
10352 if (isUNPCKLMask(NewMask, VT, HasInt256, true))
10353 return getTargetShuffleNode(X86ISD::UNPCKL, dl, VT, V1, V2, DAG);
10354 if (isUNPCKHMask(NewMask, VT, HasInt256, true))
10355 return getTargetShuffleNode(X86ISD::UNPCKH, dl, VT, V1, V2, DAG);
10359 // Commute is back and try unpck* again.
10360 // FIXME: this seems wrong.
10361 CommuteVectorShuffleMask(M, NumElems);
10363 std::swap(V1IsSplat, V2IsSplat);
10365 if (isUNPCKLMask(M, VT, HasInt256))
10366 return getTargetShuffleNode(X86ISD::UNPCKL, dl, VT, V1, V2, DAG);
10368 if (isUNPCKHMask(M, VT, HasInt256))
10369 return getTargetShuffleNode(X86ISD::UNPCKH, dl, VT, V1, V2, DAG);
10372 // Normalize the node to match x86 shuffle ops if needed
10373 if (!V2IsUndef && (isSHUFPMask(M, VT, /* Commuted */ true)))
10374 return DAG.getCommutedVectorShuffle(*SVOp);
10376 // The checks below are all present in isShuffleMaskLegal, but they are
10377 // inlined here right now to enable us to directly emit target specific
10378 // nodes, and remove one by one until they don't return Op anymore.
10380 if (ShuffleVectorSDNode::isSplatMask(&M[0], VT) &&
10381 SVOp->getSplatIndex() == 0 && V2IsUndef) {
10382 if (VT == MVT::v2f64 || VT == MVT::v2i64)
10383 return getTargetShuffleNode(X86ISD::UNPCKL, dl, VT, V1, V1, DAG);
10386 if (isPSHUFHWMask(M, VT, HasInt256))
10387 return getTargetShuffleNode(X86ISD::PSHUFHW, dl, VT, V1,
10388 getShufflePSHUFHWImmediate(SVOp),
10391 if (isPSHUFLWMask(M, VT, HasInt256))
10392 return getTargetShuffleNode(X86ISD::PSHUFLW, dl, VT, V1,
10393 getShufflePSHUFLWImmediate(SVOp),
10396 unsigned MaskValue;
10397 if (isBlendMask(M, VT, Subtarget->hasSSE41(), Subtarget->hasInt256(),
10399 return LowerVECTOR_SHUFFLEtoBlend(SVOp, MaskValue, Subtarget, DAG);
10401 if (isSHUFPMask(M, VT))
10402 return getTargetShuffleNode(X86ISD::SHUFP, dl, VT, V1, V2,
10403 getShuffleSHUFImmediate(SVOp), DAG);
10405 if (isUNPCKL_v_undef_Mask(M, VT, HasInt256))
10406 return getTargetShuffleNode(X86ISD::UNPCKL, dl, VT, V1, V1, DAG);
10407 if (isUNPCKH_v_undef_Mask(M, VT, HasInt256))
10408 return getTargetShuffleNode(X86ISD::UNPCKH, dl, VT, V1, V1, DAG);
10410 //===--------------------------------------------------------------------===//
10411 // Generate target specific nodes for 128 or 256-bit shuffles only
10412 // supported in the AVX instruction set.
10415 // Handle VMOVDDUPY permutations
10416 if (V2IsUndef && isMOVDDUPYMask(M, VT, HasFp256))
10417 return getTargetShuffleNode(X86ISD::MOVDDUP, dl, VT, V1, DAG);
10419 // Handle VPERMILPS/D* permutations
10420 if (isVPERMILPMask(M, VT)) {
10421 if ((HasInt256 && VT == MVT::v8i32) || VT == MVT::v16i32)
10422 return getTargetShuffleNode(X86ISD::PSHUFD, dl, VT, V1,
10423 getShuffleSHUFImmediate(SVOp), DAG);
10424 return getTargetShuffleNode(X86ISD::VPERMILP, dl, VT, V1,
10425 getShuffleSHUFImmediate(SVOp), DAG);
10429 if (VT.is512BitVector() && isINSERT64x4Mask(M, VT, &Idx))
10430 return Insert256BitVector(V1, Extract256BitVector(V2, 0, DAG, dl),
10431 Idx*(NumElems/2), DAG, dl);
10433 // Handle VPERM2F128/VPERM2I128 permutations
10434 if (isVPERM2X128Mask(M, VT, HasFp256))
10435 return getTargetShuffleNode(X86ISD::VPERM2X128, dl, VT, V1,
10436 V2, getShuffleVPERM2X128Immediate(SVOp), DAG);
10438 if (Subtarget->hasSSE41() && isINSERTPSMask(M, VT))
10439 return getINSERTPS(SVOp, dl, DAG);
10442 if (V2IsUndef && HasInt256 && isPermImmMask(M, VT, Imm8))
10443 return getTargetShuffleNode(X86ISD::VPERMI, dl, VT, V1, Imm8, DAG);
10445 if ((V2IsUndef && HasInt256 && VT.is256BitVector() && NumElems == 8) ||
10446 VT.is512BitVector()) {
10447 MVT MaskEltVT = MVT::getIntegerVT(VT.getVectorElementType().getSizeInBits());
10448 MVT MaskVectorVT = MVT::getVectorVT(MaskEltVT, NumElems);
10449 SmallVector<SDValue, 16> permclMask;
10450 for (unsigned i = 0; i != NumElems; ++i) {
10451 permclMask.push_back(DAG.getConstant((M[i]>=0) ? M[i] : 0, MaskEltVT));
10454 SDValue Mask = DAG.getNode(ISD::BUILD_VECTOR, dl, MaskVectorVT, permclMask);
10456 // Bitcast is for VPERMPS since mask is v8i32 but node takes v8f32
10457 return DAG.getNode(X86ISD::VPERMV, dl, VT,
10458 DAG.getNode(ISD::BITCAST, dl, VT, Mask), V1);
10459 return DAG.getNode(X86ISD::VPERMV3, dl, VT, V1,
10460 DAG.getNode(ISD::BITCAST, dl, VT, Mask), V2);
10463 //===--------------------------------------------------------------------===//
10464 // Since no target specific shuffle was selected for this generic one,
10465 // lower it into other known shuffles. FIXME: this isn't true yet, but
10466 // this is the plan.
10469 // Handle v8i16 specifically since SSE can do byte extraction and insertion.
10470 if (VT == MVT::v8i16) {
10471 SDValue NewOp = LowerVECTOR_SHUFFLEv8i16(Op, Subtarget, DAG);
10472 if (NewOp.getNode())
10476 if (VT == MVT::v16i16 && Subtarget->hasInt256()) {
10477 SDValue NewOp = LowerVECTOR_SHUFFLEv16i16(Op, DAG);
10478 if (NewOp.getNode())
10482 if (VT == MVT::v16i8) {
10483 SDValue NewOp = LowerVECTOR_SHUFFLEv16i8(SVOp, Subtarget, DAG);
10484 if (NewOp.getNode())
10488 if (VT == MVT::v32i8) {
10489 SDValue NewOp = LowerVECTOR_SHUFFLEv32i8(SVOp, Subtarget, DAG);
10490 if (NewOp.getNode())
10494 // Handle all 128-bit wide vectors with 4 elements, and match them with
10495 // several different shuffle types.
10496 if (NumElems == 4 && VT.is128BitVector())
10497 return LowerVECTOR_SHUFFLE_128v4(SVOp, DAG);
10499 // Handle general 256-bit shuffles
10500 if (VT.is256BitVector())
10501 return LowerVECTOR_SHUFFLE_256(SVOp, DAG);
10506 // This function assumes its argument is a BUILD_VECTOR of constants or
10507 // undef SDNodes. i.e: ISD::isBuildVectorOfConstantSDNodes(BuildVector) is
10509 static bool BUILD_VECTORtoBlendMask(BuildVectorSDNode *BuildVector,
10510 unsigned &MaskValue) {
10512 unsigned NumElems = BuildVector->getNumOperands();
10513 // There are 2 lanes if (NumElems > 8), and 1 lane otherwise.
10514 unsigned NumLanes = (NumElems - 1) / 8 + 1;
10515 unsigned NumElemsInLane = NumElems / NumLanes;
10517 // Blend for v16i16 should be symetric for the both lanes.
10518 for (unsigned i = 0; i < NumElemsInLane; ++i) {
10519 SDValue EltCond = BuildVector->getOperand(i);
10520 SDValue SndLaneEltCond =
10521 (NumLanes == 2) ? BuildVector->getOperand(i + NumElemsInLane) : EltCond;
10523 int Lane1Cond = -1, Lane2Cond = -1;
10524 if (isa<ConstantSDNode>(EltCond))
10525 Lane1Cond = !isZero(EltCond);
10526 if (isa<ConstantSDNode>(SndLaneEltCond))
10527 Lane2Cond = !isZero(SndLaneEltCond);
10529 if (Lane1Cond == Lane2Cond || Lane2Cond < 0)
10530 // Lane1Cond != 0, means we want the first argument.
10531 // Lane1Cond == 0, means we want the second argument.
10532 // The encoding of this argument is 0 for the first argument, 1
10533 // for the second. Therefore, invert the condition.
10534 MaskValue |= !Lane1Cond << i;
10535 else if (Lane1Cond < 0)
10536 MaskValue |= !Lane2Cond << i;
10543 // Try to lower a vselect node into a simple blend instruction.
10544 static SDValue LowerVSELECTtoBlend(SDValue Op, const X86Subtarget *Subtarget,
10545 SelectionDAG &DAG) {
10546 SDValue Cond = Op.getOperand(0);
10547 SDValue LHS = Op.getOperand(1);
10548 SDValue RHS = Op.getOperand(2);
10550 MVT VT = Op.getSimpleValueType();
10551 MVT EltVT = VT.getVectorElementType();
10552 unsigned NumElems = VT.getVectorNumElements();
10554 // There is no blend with immediate in AVX-512.
10555 if (VT.is512BitVector())
10558 if (!Subtarget->hasSSE41() || EltVT == MVT::i8)
10560 if (!Subtarget->hasInt256() && VT == MVT::v16i16)
10563 if (!ISD::isBuildVectorOfConstantSDNodes(Cond.getNode()))
10566 // Check the mask for BLEND and build the value.
10567 unsigned MaskValue = 0;
10568 if (!BUILD_VECTORtoBlendMask(cast<BuildVectorSDNode>(Cond), MaskValue))
10571 // Convert i32 vectors to floating point if it is not AVX2.
10572 // AVX2 introduced VPBLENDD instruction for 128 and 256-bit vectors.
10574 if (EltVT == MVT::i64 || (EltVT == MVT::i32 && !Subtarget->hasInt256())) {
10575 BlendVT = MVT::getVectorVT(MVT::getFloatingPointVT(EltVT.getSizeInBits()),
10577 LHS = DAG.getNode(ISD::BITCAST, dl, VT, LHS);
10578 RHS = DAG.getNode(ISD::BITCAST, dl, VT, RHS);
10581 SDValue Ret = DAG.getNode(X86ISD::BLENDI, dl, BlendVT, LHS, RHS,
10582 DAG.getConstant(MaskValue, MVT::i32));
10583 return DAG.getNode(ISD::BITCAST, dl, VT, Ret);
10586 SDValue X86TargetLowering::LowerVSELECT(SDValue Op, SelectionDAG &DAG) const {
10587 // A vselect where all conditions and data are constants can be optimized into
10588 // a single vector load by SelectionDAGLegalize::ExpandBUILD_VECTOR().
10589 if (ISD::isBuildVectorOfConstantSDNodes(Op.getOperand(0).getNode()) &&
10590 ISD::isBuildVectorOfConstantSDNodes(Op.getOperand(1).getNode()) &&
10591 ISD::isBuildVectorOfConstantSDNodes(Op.getOperand(2).getNode()))
10594 SDValue BlendOp = LowerVSELECTtoBlend(Op, Subtarget, DAG);
10595 if (BlendOp.getNode())
10598 // Some types for vselect were previously set to Expand, not Legal or
10599 // Custom. Return an empty SDValue so we fall-through to Expand, after
10600 // the Custom lowering phase.
10601 MVT VT = Op.getSimpleValueType();
10602 switch (VT.SimpleTy) {
10607 if (Subtarget->hasBWI() && Subtarget->hasVLX())
10612 // We couldn't create a "Blend with immediate" node.
10613 // This node should still be legal, but we'll have to emit a blendv*
10618 static SDValue LowerEXTRACT_VECTOR_ELT_SSE4(SDValue Op, SelectionDAG &DAG) {
10619 MVT VT = Op.getSimpleValueType();
10622 if (!Op.getOperand(0).getSimpleValueType().is128BitVector())
10625 if (VT.getSizeInBits() == 8) {
10626 SDValue Extract = DAG.getNode(X86ISD::PEXTRB, dl, MVT::i32,
10627 Op.getOperand(0), Op.getOperand(1));
10628 SDValue Assert = DAG.getNode(ISD::AssertZext, dl, MVT::i32, Extract,
10629 DAG.getValueType(VT));
10630 return DAG.getNode(ISD::TRUNCATE, dl, VT, Assert);
10633 if (VT.getSizeInBits() == 16) {
10634 unsigned Idx = cast<ConstantSDNode>(Op.getOperand(1))->getZExtValue();
10635 // If Idx is 0, it's cheaper to do a move instead of a pextrw.
10637 return DAG.getNode(ISD::TRUNCATE, dl, MVT::i16,
10638 DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::i32,
10639 DAG.getNode(ISD::BITCAST, dl,
10642 Op.getOperand(1)));
10643 SDValue Extract = DAG.getNode(X86ISD::PEXTRW, dl, MVT::i32,
10644 Op.getOperand(0), Op.getOperand(1));
10645 SDValue Assert = DAG.getNode(ISD::AssertZext, dl, MVT::i32, Extract,
10646 DAG.getValueType(VT));
10647 return DAG.getNode(ISD::TRUNCATE, dl, VT, Assert);
10650 if (VT == MVT::f32) {
10651 // EXTRACTPS outputs to a GPR32 register which will require a movd to copy
10652 // the result back to FR32 register. It's only worth matching if the
10653 // result has a single use which is a store or a bitcast to i32. And in
10654 // the case of a store, it's not worth it if the index is a constant 0,
10655 // because a MOVSSmr can be used instead, which is smaller and faster.
10656 if (!Op.hasOneUse())
10658 SDNode *User = *Op.getNode()->use_begin();
10659 if ((User->getOpcode() != ISD::STORE ||
10660 (isa<ConstantSDNode>(Op.getOperand(1)) &&
10661 cast<ConstantSDNode>(Op.getOperand(1))->isNullValue())) &&
10662 (User->getOpcode() != ISD::BITCAST ||
10663 User->getValueType(0) != MVT::i32))
10665 SDValue Extract = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::i32,
10666 DAG.getNode(ISD::BITCAST, dl, MVT::v4i32,
10669 return DAG.getNode(ISD::BITCAST, dl, MVT::f32, Extract);
10672 if (VT == MVT::i32 || VT == MVT::i64) {
10673 // ExtractPS/pextrq works with constant index.
10674 if (isa<ConstantSDNode>(Op.getOperand(1)))
10680 /// Extract one bit from mask vector, like v16i1 or v8i1.
10681 /// AVX-512 feature.
10683 X86TargetLowering::ExtractBitFromMaskVector(SDValue Op, SelectionDAG &DAG) const {
10684 SDValue Vec = Op.getOperand(0);
10686 MVT VecVT = Vec.getSimpleValueType();
10687 SDValue Idx = Op.getOperand(1);
10688 MVT EltVT = Op.getSimpleValueType();
10690 assert((EltVT == MVT::i1) && "Unexpected operands in ExtractBitFromMaskVector");
10692 // variable index can't be handled in mask registers,
10693 // extend vector to VR512
10694 if (!isa<ConstantSDNode>(Idx)) {
10695 MVT ExtVT = (VecVT == MVT::v8i1 ? MVT::v8i64 : MVT::v16i32);
10696 SDValue Ext = DAG.getNode(ISD::ZERO_EXTEND, dl, ExtVT, Vec);
10697 SDValue Elt = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl,
10698 ExtVT.getVectorElementType(), Ext, Idx);
10699 return DAG.getNode(ISD::TRUNCATE, dl, EltVT, Elt);
10702 unsigned IdxVal = cast<ConstantSDNode>(Idx)->getZExtValue();
10703 const TargetRegisterClass* rc = getRegClassFor(VecVT);
10704 unsigned MaxSift = rc->getSize()*8 - 1;
10705 Vec = DAG.getNode(X86ISD::VSHLI, dl, VecVT, Vec,
10706 DAG.getConstant(MaxSift - IdxVal, MVT::i8));
10707 Vec = DAG.getNode(X86ISD::VSRLI, dl, VecVT, Vec,
10708 DAG.getConstant(MaxSift, MVT::i8));
10709 return DAG.getNode(X86ISD::VEXTRACT, dl, MVT::i1, Vec,
10710 DAG.getIntPtrConstant(0));
10714 X86TargetLowering::LowerEXTRACT_VECTOR_ELT(SDValue Op,
10715 SelectionDAG &DAG) const {
10717 SDValue Vec = Op.getOperand(0);
10718 MVT VecVT = Vec.getSimpleValueType();
10719 SDValue Idx = Op.getOperand(1);
10721 if (Op.getSimpleValueType() == MVT::i1)
10722 return ExtractBitFromMaskVector(Op, DAG);
10724 if (!isa<ConstantSDNode>(Idx)) {
10725 if (VecVT.is512BitVector() ||
10726 (VecVT.is256BitVector() && Subtarget->hasInt256() &&
10727 VecVT.getVectorElementType().getSizeInBits() == 32)) {
10730 MVT::getIntegerVT(VecVT.getVectorElementType().getSizeInBits());
10731 MVT MaskVT = MVT::getVectorVT(MaskEltVT, VecVT.getSizeInBits() /
10732 MaskEltVT.getSizeInBits());
10734 Idx = DAG.getZExtOrTrunc(Idx, dl, MaskEltVT);
10735 SDValue Mask = DAG.getNode(X86ISD::VINSERT, dl, MaskVT,
10736 getZeroVector(MaskVT, Subtarget, DAG, dl),
10737 Idx, DAG.getConstant(0, getPointerTy()));
10738 SDValue Perm = DAG.getNode(X86ISD::VPERMV, dl, VecVT, Mask, Vec);
10739 return DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, Op.getValueType(),
10740 Perm, DAG.getConstant(0, getPointerTy()));
10745 // If this is a 256-bit vector result, first extract the 128-bit vector and
10746 // then extract the element from the 128-bit vector.
10747 if (VecVT.is256BitVector() || VecVT.is512BitVector()) {
10749 unsigned IdxVal = cast<ConstantSDNode>(Idx)->getZExtValue();
10750 // Get the 128-bit vector.
10751 Vec = Extract128BitVector(Vec, IdxVal, DAG, dl);
10752 MVT EltVT = VecVT.getVectorElementType();
10754 unsigned ElemsPerChunk = 128 / EltVT.getSizeInBits();
10756 //if (IdxVal >= NumElems/2)
10757 // IdxVal -= NumElems/2;
10758 IdxVal -= (IdxVal/ElemsPerChunk)*ElemsPerChunk;
10759 return DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, Op.getValueType(), Vec,
10760 DAG.getConstant(IdxVal, MVT::i32));
10763 assert(VecVT.is128BitVector() && "Unexpected vector length");
10765 if (Subtarget->hasSSE41()) {
10766 SDValue Res = LowerEXTRACT_VECTOR_ELT_SSE4(Op, DAG);
10771 MVT VT = Op.getSimpleValueType();
10772 // TODO: handle v16i8.
10773 if (VT.getSizeInBits() == 16) {
10774 SDValue Vec = Op.getOperand(0);
10775 unsigned Idx = cast<ConstantSDNode>(Op.getOperand(1))->getZExtValue();
10777 return DAG.getNode(ISD::TRUNCATE, dl, MVT::i16,
10778 DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::i32,
10779 DAG.getNode(ISD::BITCAST, dl,
10781 Op.getOperand(1)));
10782 // Transform it so it match pextrw which produces a 32-bit result.
10783 MVT EltVT = MVT::i32;
10784 SDValue Extract = DAG.getNode(X86ISD::PEXTRW, dl, EltVT,
10785 Op.getOperand(0), Op.getOperand(1));
10786 SDValue Assert = DAG.getNode(ISD::AssertZext, dl, EltVT, Extract,
10787 DAG.getValueType(VT));
10788 return DAG.getNode(ISD::TRUNCATE, dl, VT, Assert);
10791 if (VT.getSizeInBits() == 32) {
10792 unsigned Idx = cast<ConstantSDNode>(Op.getOperand(1))->getZExtValue();
10796 // SHUFPS the element to the lowest double word, then movss.
10797 int Mask[4] = { static_cast<int>(Idx), -1, -1, -1 };
10798 MVT VVT = Op.getOperand(0).getSimpleValueType();
10799 SDValue Vec = DAG.getVectorShuffle(VVT, dl, Op.getOperand(0),
10800 DAG.getUNDEF(VVT), Mask);
10801 return DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, VT, Vec,
10802 DAG.getIntPtrConstant(0));
10805 if (VT.getSizeInBits() == 64) {
10806 // FIXME: .td only matches this for <2 x f64>, not <2 x i64> on 32b
10807 // FIXME: seems like this should be unnecessary if mov{h,l}pd were taught
10808 // to match extract_elt for f64.
10809 unsigned Idx = cast<ConstantSDNode>(Op.getOperand(1))->getZExtValue();
10813 // UNPCKHPD the element to the lowest double word, then movsd.
10814 // Note if the lower 64 bits of the result of the UNPCKHPD is then stored
10815 // to a f64mem, the whole operation is folded into a single MOVHPDmr.
10816 int Mask[2] = { 1, -1 };
10817 MVT VVT = Op.getOperand(0).getSimpleValueType();
10818 SDValue Vec = DAG.getVectorShuffle(VVT, dl, Op.getOperand(0),
10819 DAG.getUNDEF(VVT), Mask);
10820 return DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, VT, Vec,
10821 DAG.getIntPtrConstant(0));
10827 /// Insert one bit to mask vector, like v16i1 or v8i1.
10828 /// AVX-512 feature.
10830 X86TargetLowering::InsertBitToMaskVector(SDValue Op, SelectionDAG &DAG) const {
10832 SDValue Vec = Op.getOperand(0);
10833 SDValue Elt = Op.getOperand(1);
10834 SDValue Idx = Op.getOperand(2);
10835 MVT VecVT = Vec.getSimpleValueType();
10837 if (!isa<ConstantSDNode>(Idx)) {
10838 // Non constant index. Extend source and destination,
10839 // insert element and then truncate the result.
10840 MVT ExtVecVT = (VecVT == MVT::v8i1 ? MVT::v8i64 : MVT::v16i32);
10841 MVT ExtEltVT = (VecVT == MVT::v8i1 ? MVT::i64 : MVT::i32);
10842 SDValue ExtOp = DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, ExtVecVT,
10843 DAG.getNode(ISD::ZERO_EXTEND, dl, ExtVecVT, Vec),
10844 DAG.getNode(ISD::ZERO_EXTEND, dl, ExtEltVT, Elt), Idx);
10845 return DAG.getNode(ISD::TRUNCATE, dl, VecVT, ExtOp);
10848 unsigned IdxVal = cast<ConstantSDNode>(Idx)->getZExtValue();
10849 SDValue EltInVec = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VecVT, Elt);
10850 if (Vec.getOpcode() == ISD::UNDEF)
10851 return DAG.getNode(X86ISD::VSHLI, dl, VecVT, EltInVec,
10852 DAG.getConstant(IdxVal, MVT::i8));
10853 const TargetRegisterClass* rc = getRegClassFor(VecVT);
10854 unsigned MaxSift = rc->getSize()*8 - 1;
10855 EltInVec = DAG.getNode(X86ISD::VSHLI, dl, VecVT, EltInVec,
10856 DAG.getConstant(MaxSift, MVT::i8));
10857 EltInVec = DAG.getNode(X86ISD::VSRLI, dl, VecVT, EltInVec,
10858 DAG.getConstant(MaxSift - IdxVal, MVT::i8));
10859 return DAG.getNode(ISD::OR, dl, VecVT, Vec, EltInVec);
10862 SDValue X86TargetLowering::LowerINSERT_VECTOR_ELT(SDValue Op,
10863 SelectionDAG &DAG) const {
10864 MVT VT = Op.getSimpleValueType();
10865 MVT EltVT = VT.getVectorElementType();
10867 if (EltVT == MVT::i1)
10868 return InsertBitToMaskVector(Op, DAG);
10871 SDValue N0 = Op.getOperand(0);
10872 SDValue N1 = Op.getOperand(1);
10873 SDValue N2 = Op.getOperand(2);
10874 if (!isa<ConstantSDNode>(N2))
10876 auto *N2C = cast<ConstantSDNode>(N2);
10877 unsigned IdxVal = N2C->getZExtValue();
10879 // If the vector is wider than 128 bits, extract the 128-bit subvector, insert
10880 // into that, and then insert the subvector back into the result.
10881 if (VT.is256BitVector() || VT.is512BitVector()) {
10882 // Get the desired 128-bit vector half.
10883 SDValue V = Extract128BitVector(N0, IdxVal, DAG, dl);
10885 // Insert the element into the desired half.
10886 unsigned NumEltsIn128 = 128 / EltVT.getSizeInBits();
10887 unsigned IdxIn128 = IdxVal - (IdxVal / NumEltsIn128) * NumEltsIn128;
10889 V = DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, V.getValueType(), V, N1,
10890 DAG.getConstant(IdxIn128, MVT::i32));
10892 // Insert the changed part back to the 256-bit vector
10893 return Insert128BitVector(N0, V, IdxVal, DAG, dl);
10895 assert(VT.is128BitVector() && "Only 128-bit vector types should be left!");
10897 if (Subtarget->hasSSE41()) {
10898 if (EltVT.getSizeInBits() == 8 || EltVT.getSizeInBits() == 16) {
10900 if (VT == MVT::v8i16) {
10901 Opc = X86ISD::PINSRW;
10903 assert(VT == MVT::v16i8);
10904 Opc = X86ISD::PINSRB;
10907 // Transform it so it match pinsr{b,w} which expects a GR32 as its second
10909 if (N1.getValueType() != MVT::i32)
10910 N1 = DAG.getNode(ISD::ANY_EXTEND, dl, MVT::i32, N1);
10911 if (N2.getValueType() != MVT::i32)
10912 N2 = DAG.getIntPtrConstant(IdxVal);
10913 return DAG.getNode(Opc, dl, VT, N0, N1, N2);
10916 if (EltVT == MVT::f32) {
10917 // Bits [7:6] of the constant are the source select. This will always be
10918 // zero here. The DAG Combiner may combine an extract_elt index into
10920 // bits. For example (insert (extract, 3), 2) could be matched by
10922 // the '3' into bits [7:6] of X86ISD::INSERTPS.
10923 // Bits [5:4] of the constant are the destination select. This is the
10924 // value of the incoming immediate.
10925 // Bits [3:0] of the constant are the zero mask. The DAG Combiner may
10926 // combine either bitwise AND or insert of float 0.0 to set these bits.
10927 N2 = DAG.getIntPtrConstant(IdxVal << 4);
10928 // Create this as a scalar to vector..
10929 N1 = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, MVT::v4f32, N1);
10930 return DAG.getNode(X86ISD::INSERTPS, dl, VT, N0, N1, N2);
10933 if (EltVT == MVT::i32 || EltVT == MVT::i64) {
10934 // PINSR* works with constant index.
10939 if (EltVT == MVT::i8)
10942 if (EltVT.getSizeInBits() == 16) {
10943 // Transform it so it match pinsrw which expects a 16-bit value in a GR32
10944 // as its second argument.
10945 if (N1.getValueType() != MVT::i32)
10946 N1 = DAG.getNode(ISD::ANY_EXTEND, dl, MVT::i32, N1);
10947 if (N2.getValueType() != MVT::i32)
10948 N2 = DAG.getIntPtrConstant(IdxVal);
10949 return DAG.getNode(X86ISD::PINSRW, dl, VT, N0, N1, N2);
10954 static SDValue LowerSCALAR_TO_VECTOR(SDValue Op, SelectionDAG &DAG) {
10956 MVT OpVT = Op.getSimpleValueType();
10958 // If this is a 256-bit vector result, first insert into a 128-bit
10959 // vector and then insert into the 256-bit vector.
10960 if (!OpVT.is128BitVector()) {
10961 // Insert into a 128-bit vector.
10962 unsigned SizeFactor = OpVT.getSizeInBits()/128;
10963 MVT VT128 = MVT::getVectorVT(OpVT.getVectorElementType(),
10964 OpVT.getVectorNumElements() / SizeFactor);
10966 Op = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VT128, Op.getOperand(0));
10968 // Insert the 128-bit vector.
10969 return Insert128BitVector(DAG.getUNDEF(OpVT), Op, 0, DAG, dl);
10972 if (OpVT == MVT::v1i64 &&
10973 Op.getOperand(0).getValueType() == MVT::i64)
10974 return DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, MVT::v1i64, Op.getOperand(0));
10976 SDValue AnyExt = DAG.getNode(ISD::ANY_EXTEND, dl, MVT::i32, Op.getOperand(0));
10977 assert(OpVT.is128BitVector() && "Expected an SSE type!");
10978 return DAG.getNode(ISD::BITCAST, dl, OpVT,
10979 DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, MVT::v4i32,AnyExt));
10982 // Lower a node with an EXTRACT_SUBVECTOR opcode. This may result in
10983 // a simple subregister reference or explicit instructions to grab
10984 // upper bits of a vector.
10985 static SDValue LowerEXTRACT_SUBVECTOR(SDValue Op, const X86Subtarget *Subtarget,
10986 SelectionDAG &DAG) {
10988 SDValue In = Op.getOperand(0);
10989 SDValue Idx = Op.getOperand(1);
10990 unsigned IdxVal = cast<ConstantSDNode>(Idx)->getZExtValue();
10991 MVT ResVT = Op.getSimpleValueType();
10992 MVT InVT = In.getSimpleValueType();
10994 if (Subtarget->hasFp256()) {
10995 if (ResVT.is128BitVector() &&
10996 (InVT.is256BitVector() || InVT.is512BitVector()) &&
10997 isa<ConstantSDNode>(Idx)) {
10998 return Extract128BitVector(In, IdxVal, DAG, dl);
11000 if (ResVT.is256BitVector() && InVT.is512BitVector() &&
11001 isa<ConstantSDNode>(Idx)) {
11002 return Extract256BitVector(In, IdxVal, DAG, dl);
11008 // Lower a node with an INSERT_SUBVECTOR opcode. This may result in a
11009 // simple superregister reference or explicit instructions to insert
11010 // the upper bits of a vector.
11011 static SDValue LowerINSERT_SUBVECTOR(SDValue Op, const X86Subtarget *Subtarget,
11012 SelectionDAG &DAG) {
11013 if (Subtarget->hasFp256()) {
11014 SDLoc dl(Op.getNode());
11015 SDValue Vec = Op.getNode()->getOperand(0);
11016 SDValue SubVec = Op.getNode()->getOperand(1);
11017 SDValue Idx = Op.getNode()->getOperand(2);
11019 if ((Op.getNode()->getSimpleValueType(0).is256BitVector() ||
11020 Op.getNode()->getSimpleValueType(0).is512BitVector()) &&
11021 SubVec.getNode()->getSimpleValueType(0).is128BitVector() &&
11022 isa<ConstantSDNode>(Idx)) {
11023 unsigned IdxVal = cast<ConstantSDNode>(Idx)->getZExtValue();
11024 return Insert128BitVector(Vec, SubVec, IdxVal, DAG, dl);
11027 if (Op.getNode()->getSimpleValueType(0).is512BitVector() &&
11028 SubVec.getNode()->getSimpleValueType(0).is256BitVector() &&
11029 isa<ConstantSDNode>(Idx)) {
11030 unsigned IdxVal = cast<ConstantSDNode>(Idx)->getZExtValue();
11031 return Insert256BitVector(Vec, SubVec, IdxVal, DAG, dl);
11037 // ConstantPool, JumpTable, GlobalAddress, and ExternalSymbol are lowered as
11038 // their target countpart wrapped in the X86ISD::Wrapper node. Suppose N is
11039 // one of the above mentioned nodes. It has to be wrapped because otherwise
11040 // Select(N) returns N. So the raw TargetGlobalAddress nodes, etc. can only
11041 // be used to form addressing mode. These wrapped nodes will be selected
11044 X86TargetLowering::LowerConstantPool(SDValue Op, SelectionDAG &DAG) const {
11045 ConstantPoolSDNode *CP = cast<ConstantPoolSDNode>(Op);
11047 // In PIC mode (unless we're in RIPRel PIC mode) we add an offset to the
11048 // global base reg.
11049 unsigned char OpFlag = 0;
11050 unsigned WrapperKind = X86ISD::Wrapper;
11051 CodeModel::Model M = DAG.getTarget().getCodeModel();
11053 if (Subtarget->isPICStyleRIPRel() &&
11054 (M == CodeModel::Small || M == CodeModel::Kernel))
11055 WrapperKind = X86ISD::WrapperRIP;
11056 else if (Subtarget->isPICStyleGOT())
11057 OpFlag = X86II::MO_GOTOFF;
11058 else if (Subtarget->isPICStyleStubPIC())
11059 OpFlag = X86II::MO_PIC_BASE_OFFSET;
11061 SDValue Result = DAG.getTargetConstantPool(CP->getConstVal(), getPointerTy(),
11062 CP->getAlignment(),
11063 CP->getOffset(), OpFlag);
11065 Result = DAG.getNode(WrapperKind, DL, getPointerTy(), Result);
11066 // With PIC, the address is actually $g + Offset.
11068 Result = DAG.getNode(ISD::ADD, DL, getPointerTy(),
11069 DAG.getNode(X86ISD::GlobalBaseReg,
11070 SDLoc(), getPointerTy()),
11077 SDValue X86TargetLowering::LowerJumpTable(SDValue Op, SelectionDAG &DAG) const {
11078 JumpTableSDNode *JT = cast<JumpTableSDNode>(Op);
11080 // In PIC mode (unless we're in RIPRel PIC mode) we add an offset to the
11081 // global base reg.
11082 unsigned char OpFlag = 0;
11083 unsigned WrapperKind = X86ISD::Wrapper;
11084 CodeModel::Model M = DAG.getTarget().getCodeModel();
11086 if (Subtarget->isPICStyleRIPRel() &&
11087 (M == CodeModel::Small || M == CodeModel::Kernel))
11088 WrapperKind = X86ISD::WrapperRIP;
11089 else if (Subtarget->isPICStyleGOT())
11090 OpFlag = X86II::MO_GOTOFF;
11091 else if (Subtarget->isPICStyleStubPIC())
11092 OpFlag = X86II::MO_PIC_BASE_OFFSET;
11094 SDValue Result = DAG.getTargetJumpTable(JT->getIndex(), getPointerTy(),
11097 Result = DAG.getNode(WrapperKind, DL, getPointerTy(), Result);
11099 // With PIC, the address is actually $g + Offset.
11101 Result = DAG.getNode(ISD::ADD, DL, getPointerTy(),
11102 DAG.getNode(X86ISD::GlobalBaseReg,
11103 SDLoc(), getPointerTy()),
11110 X86TargetLowering::LowerExternalSymbol(SDValue Op, SelectionDAG &DAG) const {
11111 const char *Sym = cast<ExternalSymbolSDNode>(Op)->getSymbol();
11113 // In PIC mode (unless we're in RIPRel PIC mode) we add an offset to the
11114 // global base reg.
11115 unsigned char OpFlag = 0;
11116 unsigned WrapperKind = X86ISD::Wrapper;
11117 CodeModel::Model M = DAG.getTarget().getCodeModel();
11119 if (Subtarget->isPICStyleRIPRel() &&
11120 (M == CodeModel::Small || M == CodeModel::Kernel)) {
11121 if (Subtarget->isTargetDarwin() || Subtarget->isTargetELF())
11122 OpFlag = X86II::MO_GOTPCREL;
11123 WrapperKind = X86ISD::WrapperRIP;
11124 } else if (Subtarget->isPICStyleGOT()) {
11125 OpFlag = X86II::MO_GOT;
11126 } else if (Subtarget->isPICStyleStubPIC()) {
11127 OpFlag = X86II::MO_DARWIN_NONLAZY_PIC_BASE;
11128 } else if (Subtarget->isPICStyleStubNoDynamic()) {
11129 OpFlag = X86II::MO_DARWIN_NONLAZY;
11132 SDValue Result = DAG.getTargetExternalSymbol(Sym, getPointerTy(), OpFlag);
11135 Result = DAG.getNode(WrapperKind, DL, getPointerTy(), Result);
11137 // With PIC, the address is actually $g + Offset.
11138 if (DAG.getTarget().getRelocationModel() == Reloc::PIC_ &&
11139 !Subtarget->is64Bit()) {
11140 Result = DAG.getNode(ISD::ADD, DL, getPointerTy(),
11141 DAG.getNode(X86ISD::GlobalBaseReg,
11142 SDLoc(), getPointerTy()),
11146 // For symbols that require a load from a stub to get the address, emit the
11148 if (isGlobalStubReference(OpFlag))
11149 Result = DAG.getLoad(getPointerTy(), DL, DAG.getEntryNode(), Result,
11150 MachinePointerInfo::getGOT(), false, false, false, 0);
11156 X86TargetLowering::LowerBlockAddress(SDValue Op, SelectionDAG &DAG) const {
11157 // Create the TargetBlockAddressAddress node.
11158 unsigned char OpFlags =
11159 Subtarget->ClassifyBlockAddressReference();
11160 CodeModel::Model M = DAG.getTarget().getCodeModel();
11161 const BlockAddress *BA = cast<BlockAddressSDNode>(Op)->getBlockAddress();
11162 int64_t Offset = cast<BlockAddressSDNode>(Op)->getOffset();
11164 SDValue Result = DAG.getTargetBlockAddress(BA, getPointerTy(), Offset,
11167 if (Subtarget->isPICStyleRIPRel() &&
11168 (M == CodeModel::Small || M == CodeModel::Kernel))
11169 Result = DAG.getNode(X86ISD::WrapperRIP, dl, getPointerTy(), Result);
11171 Result = DAG.getNode(X86ISD::Wrapper, dl, getPointerTy(), Result);
11173 // With PIC, the address is actually $g + Offset.
11174 if (isGlobalRelativeToPICBase(OpFlags)) {
11175 Result = DAG.getNode(ISD::ADD, dl, getPointerTy(),
11176 DAG.getNode(X86ISD::GlobalBaseReg, dl, getPointerTy()),
11184 X86TargetLowering::LowerGlobalAddress(const GlobalValue *GV, SDLoc dl,
11185 int64_t Offset, SelectionDAG &DAG) const {
11186 // Create the TargetGlobalAddress node, folding in the constant
11187 // offset if it is legal.
11188 unsigned char OpFlags =
11189 Subtarget->ClassifyGlobalReference(GV, DAG.getTarget());
11190 CodeModel::Model M = DAG.getTarget().getCodeModel();
11192 if (OpFlags == X86II::MO_NO_FLAG &&
11193 X86::isOffsetSuitableForCodeModel(Offset, M)) {
11194 // A direct static reference to a global.
11195 Result = DAG.getTargetGlobalAddress(GV, dl, getPointerTy(), Offset);
11198 Result = DAG.getTargetGlobalAddress(GV, dl, getPointerTy(), 0, OpFlags);
11201 if (Subtarget->isPICStyleRIPRel() &&
11202 (M == CodeModel::Small || M == CodeModel::Kernel))
11203 Result = DAG.getNode(X86ISD::WrapperRIP, dl, getPointerTy(), Result);
11205 Result = DAG.getNode(X86ISD::Wrapper, dl, getPointerTy(), Result);
11207 // With PIC, the address is actually $g + Offset.
11208 if (isGlobalRelativeToPICBase(OpFlags)) {
11209 Result = DAG.getNode(ISD::ADD, dl, getPointerTy(),
11210 DAG.getNode(X86ISD::GlobalBaseReg, dl, getPointerTy()),
11214 // For globals that require a load from a stub to get the address, emit the
11216 if (isGlobalStubReference(OpFlags))
11217 Result = DAG.getLoad(getPointerTy(), dl, DAG.getEntryNode(), Result,
11218 MachinePointerInfo::getGOT(), false, false, false, 0);
11220 // If there was a non-zero offset that we didn't fold, create an explicit
11221 // addition for it.
11223 Result = DAG.getNode(ISD::ADD, dl, getPointerTy(), Result,
11224 DAG.getConstant(Offset, getPointerTy()));
11230 X86TargetLowering::LowerGlobalAddress(SDValue Op, SelectionDAG &DAG) const {
11231 const GlobalValue *GV = cast<GlobalAddressSDNode>(Op)->getGlobal();
11232 int64_t Offset = cast<GlobalAddressSDNode>(Op)->getOffset();
11233 return LowerGlobalAddress(GV, SDLoc(Op), Offset, DAG);
11237 GetTLSADDR(SelectionDAG &DAG, SDValue Chain, GlobalAddressSDNode *GA,
11238 SDValue *InFlag, const EVT PtrVT, unsigned ReturnReg,
11239 unsigned char OperandFlags, bool LocalDynamic = false) {
11240 MachineFrameInfo *MFI = DAG.getMachineFunction().getFrameInfo();
11241 SDVTList NodeTys = DAG.getVTList(MVT::Other, MVT::Glue);
11243 SDValue TGA = DAG.getTargetGlobalAddress(GA->getGlobal(), dl,
11244 GA->getValueType(0),
11248 X86ISD::NodeType CallType = LocalDynamic ? X86ISD::TLSBASEADDR
11252 SDValue Ops[] = { Chain, TGA, *InFlag };
11253 Chain = DAG.getNode(CallType, dl, NodeTys, Ops);
11255 SDValue Ops[] = { Chain, TGA };
11256 Chain = DAG.getNode(CallType, dl, NodeTys, Ops);
11259 // TLSADDR will be codegen'ed as call. Inform MFI that function has calls.
11260 MFI->setAdjustsStack(true);
11262 SDValue Flag = Chain.getValue(1);
11263 return DAG.getCopyFromReg(Chain, dl, ReturnReg, PtrVT, Flag);
11266 // Lower ISD::GlobalTLSAddress using the "general dynamic" model, 32 bit
11268 LowerToTLSGeneralDynamicModel32(GlobalAddressSDNode *GA, SelectionDAG &DAG,
11271 SDLoc dl(GA); // ? function entry point might be better
11272 SDValue Chain = DAG.getCopyToReg(DAG.getEntryNode(), dl, X86::EBX,
11273 DAG.getNode(X86ISD::GlobalBaseReg,
11274 SDLoc(), PtrVT), InFlag);
11275 InFlag = Chain.getValue(1);
11277 return GetTLSADDR(DAG, Chain, GA, &InFlag, PtrVT, X86::EAX, X86II::MO_TLSGD);
11280 // Lower ISD::GlobalTLSAddress using the "general dynamic" model, 64 bit
11282 LowerToTLSGeneralDynamicModel64(GlobalAddressSDNode *GA, SelectionDAG &DAG,
11284 return GetTLSADDR(DAG, DAG.getEntryNode(), GA, nullptr, PtrVT,
11285 X86::RAX, X86II::MO_TLSGD);
11288 static SDValue LowerToTLSLocalDynamicModel(GlobalAddressSDNode *GA,
11294 // Get the start address of the TLS block for this module.
11295 X86MachineFunctionInfo* MFI = DAG.getMachineFunction()
11296 .getInfo<X86MachineFunctionInfo>();
11297 MFI->incNumLocalDynamicTLSAccesses();
11301 Base = GetTLSADDR(DAG, DAG.getEntryNode(), GA, nullptr, PtrVT, X86::RAX,
11302 X86II::MO_TLSLD, /*LocalDynamic=*/true);
11305 SDValue Chain = DAG.getCopyToReg(DAG.getEntryNode(), dl, X86::EBX,
11306 DAG.getNode(X86ISD::GlobalBaseReg, SDLoc(), PtrVT), InFlag);
11307 InFlag = Chain.getValue(1);
11308 Base = GetTLSADDR(DAG, Chain, GA, &InFlag, PtrVT, X86::EAX,
11309 X86II::MO_TLSLDM, /*LocalDynamic=*/true);
11312 // Note: the CleanupLocalDynamicTLSPass will remove redundant computations
11316 unsigned char OperandFlags = X86II::MO_DTPOFF;
11317 unsigned WrapperKind = X86ISD::Wrapper;
11318 SDValue TGA = DAG.getTargetGlobalAddress(GA->getGlobal(), dl,
11319 GA->getValueType(0),
11320 GA->getOffset(), OperandFlags);
11321 SDValue Offset = DAG.getNode(WrapperKind, dl, PtrVT, TGA);
11323 // Add x@dtpoff with the base.
11324 return DAG.getNode(ISD::ADD, dl, PtrVT, Offset, Base);
11327 // Lower ISD::GlobalTLSAddress using the "initial exec" or "local exec" model.
11328 static SDValue LowerToTLSExecModel(GlobalAddressSDNode *GA, SelectionDAG &DAG,
11329 const EVT PtrVT, TLSModel::Model model,
11330 bool is64Bit, bool isPIC) {
11333 // Get the Thread Pointer, which is %gs:0 (32-bit) or %fs:0 (64-bit).
11334 Value *Ptr = Constant::getNullValue(Type::getInt8PtrTy(*DAG.getContext(),
11335 is64Bit ? 257 : 256));
11337 SDValue ThreadPointer =
11338 DAG.getLoad(PtrVT, dl, DAG.getEntryNode(), DAG.getIntPtrConstant(0),
11339 MachinePointerInfo(Ptr), false, false, false, 0);
11341 unsigned char OperandFlags = 0;
11342 // Most TLS accesses are not RIP relative, even on x86-64. One exception is
11344 unsigned WrapperKind = X86ISD::Wrapper;
11345 if (model == TLSModel::LocalExec) {
11346 OperandFlags = is64Bit ? X86II::MO_TPOFF : X86II::MO_NTPOFF;
11347 } else if (model == TLSModel::InitialExec) {
11349 OperandFlags = X86II::MO_GOTTPOFF;
11350 WrapperKind = X86ISD::WrapperRIP;
11352 OperandFlags = isPIC ? X86II::MO_GOTNTPOFF : X86II::MO_INDNTPOFF;
11355 llvm_unreachable("Unexpected model");
11358 // emit "addl x@ntpoff,%eax" (local exec)
11359 // or "addl x@indntpoff,%eax" (initial exec)
11360 // or "addl x@gotntpoff(%ebx) ,%eax" (initial exec, 32-bit pic)
11362 DAG.getTargetGlobalAddress(GA->getGlobal(), dl, GA->getValueType(0),
11363 GA->getOffset(), OperandFlags);
11364 SDValue Offset = DAG.getNode(WrapperKind, dl, PtrVT, TGA);
11366 if (model == TLSModel::InitialExec) {
11367 if (isPIC && !is64Bit) {
11368 Offset = DAG.getNode(ISD::ADD, dl, PtrVT,
11369 DAG.getNode(X86ISD::GlobalBaseReg, SDLoc(), PtrVT),
11373 Offset = DAG.getLoad(PtrVT, dl, DAG.getEntryNode(), Offset,
11374 MachinePointerInfo::getGOT(), false, false, false, 0);
11377 // The address of the thread local variable is the add of the thread
11378 // pointer with the offset of the variable.
11379 return DAG.getNode(ISD::ADD, dl, PtrVT, ThreadPointer, Offset);
11383 X86TargetLowering::LowerGlobalTLSAddress(SDValue Op, SelectionDAG &DAG) const {
11385 GlobalAddressSDNode *GA = cast<GlobalAddressSDNode>(Op);
11386 const GlobalValue *GV = GA->getGlobal();
11388 if (Subtarget->isTargetELF()) {
11389 TLSModel::Model model = DAG.getTarget().getTLSModel(GV);
11392 case TLSModel::GeneralDynamic:
11393 if (Subtarget->is64Bit())
11394 return LowerToTLSGeneralDynamicModel64(GA, DAG, getPointerTy());
11395 return LowerToTLSGeneralDynamicModel32(GA, DAG, getPointerTy());
11396 case TLSModel::LocalDynamic:
11397 return LowerToTLSLocalDynamicModel(GA, DAG, getPointerTy(),
11398 Subtarget->is64Bit());
11399 case TLSModel::InitialExec:
11400 case TLSModel::LocalExec:
11401 return LowerToTLSExecModel(
11402 GA, DAG, getPointerTy(), model, Subtarget->is64Bit(),
11403 DAG.getTarget().getRelocationModel() == Reloc::PIC_);
11405 llvm_unreachable("Unknown TLS model.");
11408 if (Subtarget->isTargetDarwin()) {
11409 // Darwin only has one model of TLS. Lower to that.
11410 unsigned char OpFlag = 0;
11411 unsigned WrapperKind = Subtarget->isPICStyleRIPRel() ?
11412 X86ISD::WrapperRIP : X86ISD::Wrapper;
11414 // In PIC mode (unless we're in RIPRel PIC mode) we add an offset to the
11415 // global base reg.
11416 bool PIC32 = (DAG.getTarget().getRelocationModel() == Reloc::PIC_) &&
11417 !Subtarget->is64Bit();
11419 OpFlag = X86II::MO_TLVP_PIC_BASE;
11421 OpFlag = X86II::MO_TLVP;
11423 SDValue Result = DAG.getTargetGlobalAddress(GA->getGlobal(), DL,
11424 GA->getValueType(0),
11425 GA->getOffset(), OpFlag);
11426 SDValue Offset = DAG.getNode(WrapperKind, DL, getPointerTy(), Result);
11428 // With PIC32, the address is actually $g + Offset.
11430 Offset = DAG.getNode(ISD::ADD, DL, getPointerTy(),
11431 DAG.getNode(X86ISD::GlobalBaseReg,
11432 SDLoc(), getPointerTy()),
11435 // Lowering the machine isd will make sure everything is in the right
11437 SDValue Chain = DAG.getEntryNode();
11438 SDVTList NodeTys = DAG.getVTList(MVT::Other, MVT::Glue);
11439 SDValue Args[] = { Chain, Offset };
11440 Chain = DAG.getNode(X86ISD::TLSCALL, DL, NodeTys, Args);
11442 // TLSCALL will be codegen'ed as call. Inform MFI that function has calls.
11443 MachineFrameInfo *MFI = DAG.getMachineFunction().getFrameInfo();
11444 MFI->setAdjustsStack(true);
11446 // And our return value (tls address) is in the standard call return value
11448 unsigned Reg = Subtarget->is64Bit() ? X86::RAX : X86::EAX;
11449 return DAG.getCopyFromReg(Chain, DL, Reg, getPointerTy(),
11450 Chain.getValue(1));
11453 if (Subtarget->isTargetKnownWindowsMSVC() ||
11454 Subtarget->isTargetWindowsGNU()) {
11455 // Just use the implicit TLS architecture
11456 // Need to generate someting similar to:
11457 // mov rdx, qword [gs:abs 58H]; Load pointer to ThreadLocalStorage
11459 // mov ecx, dword [rel _tls_index]: Load index (from C runtime)
11460 // mov rcx, qword [rdx+rcx*8]
11461 // mov eax, .tls$:tlsvar
11462 // [rax+rcx] contains the address
11463 // Windows 64bit: gs:0x58
11464 // Windows 32bit: fs:__tls_array
11467 SDValue Chain = DAG.getEntryNode();
11469 // Get the Thread Pointer, which is %fs:__tls_array (32-bit) or
11470 // %gs:0x58 (64-bit). On MinGW, __tls_array is not available, so directly
11471 // use its literal value of 0x2C.
11472 Value *Ptr = Constant::getNullValue(Subtarget->is64Bit()
11473 ? Type::getInt8PtrTy(*DAG.getContext(),
11475 : Type::getInt32PtrTy(*DAG.getContext(),
11479 Subtarget->is64Bit()
11480 ? DAG.getIntPtrConstant(0x58)
11481 : (Subtarget->isTargetWindowsGNU()
11482 ? DAG.getIntPtrConstant(0x2C)
11483 : DAG.getExternalSymbol("_tls_array", getPointerTy()));
11485 SDValue ThreadPointer =
11486 DAG.getLoad(getPointerTy(), dl, Chain, TlsArray,
11487 MachinePointerInfo(Ptr), false, false, false, 0);
11489 // Load the _tls_index variable
11490 SDValue IDX = DAG.getExternalSymbol("_tls_index", getPointerTy());
11491 if (Subtarget->is64Bit())
11492 IDX = DAG.getExtLoad(ISD::ZEXTLOAD, dl, getPointerTy(), Chain,
11493 IDX, MachinePointerInfo(), MVT::i32,
11494 false, false, false, 0);
11496 IDX = DAG.getLoad(getPointerTy(), dl, Chain, IDX, MachinePointerInfo(),
11497 false, false, false, 0);
11499 SDValue Scale = DAG.getConstant(Log2_64_Ceil(TD->getPointerSize()),
11501 IDX = DAG.getNode(ISD::SHL, dl, getPointerTy(), IDX, Scale);
11503 SDValue res = DAG.getNode(ISD::ADD, dl, getPointerTy(), ThreadPointer, IDX);
11504 res = DAG.getLoad(getPointerTy(), dl, Chain, res, MachinePointerInfo(),
11505 false, false, false, 0);
11507 // Get the offset of start of .tls section
11508 SDValue TGA = DAG.getTargetGlobalAddress(GA->getGlobal(), dl,
11509 GA->getValueType(0),
11510 GA->getOffset(), X86II::MO_SECREL);
11511 SDValue Offset = DAG.getNode(X86ISD::Wrapper, dl, getPointerTy(), TGA);
11513 // The address of the thread local variable is the add of the thread
11514 // pointer with the offset of the variable.
11515 return DAG.getNode(ISD::ADD, dl, getPointerTy(), res, Offset);
11518 llvm_unreachable("TLS not implemented for this target.");
11521 /// LowerShiftParts - Lower SRA_PARTS and friends, which return two i32 values
11522 /// and take a 2 x i32 value to shift plus a shift amount.
11523 static SDValue LowerShiftParts(SDValue Op, SelectionDAG &DAG) {
11524 assert(Op.getNumOperands() == 3 && "Not a double-shift!");
11525 MVT VT = Op.getSimpleValueType();
11526 unsigned VTBits = VT.getSizeInBits();
11528 bool isSRA = Op.getOpcode() == ISD::SRA_PARTS;
11529 SDValue ShOpLo = Op.getOperand(0);
11530 SDValue ShOpHi = Op.getOperand(1);
11531 SDValue ShAmt = Op.getOperand(2);
11532 // X86ISD::SHLD and X86ISD::SHRD have defined overflow behavior but the
11533 // generic ISD nodes haven't. Insert an AND to be safe, it's optimized away
11535 SDValue SafeShAmt = DAG.getNode(ISD::AND, dl, MVT::i8, ShAmt,
11536 DAG.getConstant(VTBits - 1, MVT::i8));
11537 SDValue Tmp1 = isSRA ? DAG.getNode(ISD::SRA, dl, VT, ShOpHi,
11538 DAG.getConstant(VTBits - 1, MVT::i8))
11539 : DAG.getConstant(0, VT);
11541 SDValue Tmp2, Tmp3;
11542 if (Op.getOpcode() == ISD::SHL_PARTS) {
11543 Tmp2 = DAG.getNode(X86ISD::SHLD, dl, VT, ShOpHi, ShOpLo, ShAmt);
11544 Tmp3 = DAG.getNode(ISD::SHL, dl, VT, ShOpLo, SafeShAmt);
11546 Tmp2 = DAG.getNode(X86ISD::SHRD, dl, VT, ShOpLo, ShOpHi, ShAmt);
11547 Tmp3 = DAG.getNode(isSRA ? ISD::SRA : ISD::SRL, dl, VT, ShOpHi, SafeShAmt);
11550 // If the shift amount is larger or equal than the width of a part we can't
11551 // rely on the results of shld/shrd. Insert a test and select the appropriate
11552 // values for large shift amounts.
11553 SDValue AndNode = DAG.getNode(ISD::AND, dl, MVT::i8, ShAmt,
11554 DAG.getConstant(VTBits, MVT::i8));
11555 SDValue Cond = DAG.getNode(X86ISD::CMP, dl, MVT::i32,
11556 AndNode, DAG.getConstant(0, MVT::i8));
11559 SDValue CC = DAG.getConstant(X86::COND_NE, MVT::i8);
11560 SDValue Ops0[4] = { Tmp2, Tmp3, CC, Cond };
11561 SDValue Ops1[4] = { Tmp3, Tmp1, CC, Cond };
11563 if (Op.getOpcode() == ISD::SHL_PARTS) {
11564 Hi = DAG.getNode(X86ISD::CMOV, dl, VT, Ops0);
11565 Lo = DAG.getNode(X86ISD::CMOV, dl, VT, Ops1);
11567 Lo = DAG.getNode(X86ISD::CMOV, dl, VT, Ops0);
11568 Hi = DAG.getNode(X86ISD::CMOV, dl, VT, Ops1);
11571 SDValue Ops[2] = { Lo, Hi };
11572 return DAG.getMergeValues(Ops, dl);
11575 SDValue X86TargetLowering::LowerSINT_TO_FP(SDValue Op,
11576 SelectionDAG &DAG) const {
11577 MVT SrcVT = Op.getOperand(0).getSimpleValueType();
11579 if (SrcVT.isVector())
11582 assert(SrcVT <= MVT::i64 && SrcVT >= MVT::i16 &&
11583 "Unknown SINT_TO_FP to lower!");
11585 // These are really Legal; return the operand so the caller accepts it as
11587 if (SrcVT == MVT::i32 && isScalarFPTypeInSSEReg(Op.getValueType()))
11589 if (SrcVT == MVT::i64 && isScalarFPTypeInSSEReg(Op.getValueType()) &&
11590 Subtarget->is64Bit()) {
11595 unsigned Size = SrcVT.getSizeInBits()/8;
11596 MachineFunction &MF = DAG.getMachineFunction();
11597 int SSFI = MF.getFrameInfo()->CreateStackObject(Size, Size, false);
11598 SDValue StackSlot = DAG.getFrameIndex(SSFI, getPointerTy());
11599 SDValue Chain = DAG.getStore(DAG.getEntryNode(), dl, Op.getOperand(0),
11601 MachinePointerInfo::getFixedStack(SSFI),
11603 return BuildFILD(Op, SrcVT, Chain, StackSlot, DAG);
11606 SDValue X86TargetLowering::BuildFILD(SDValue Op, EVT SrcVT, SDValue Chain,
11608 SelectionDAG &DAG) const {
11612 bool useSSE = isScalarFPTypeInSSEReg(Op.getValueType());
11614 Tys = DAG.getVTList(MVT::f64, MVT::Other, MVT::Glue);
11616 Tys = DAG.getVTList(Op.getValueType(), MVT::Other);
11618 unsigned ByteSize = SrcVT.getSizeInBits()/8;
11620 FrameIndexSDNode *FI = dyn_cast<FrameIndexSDNode>(StackSlot);
11621 MachineMemOperand *MMO;
11623 int SSFI = FI->getIndex();
11625 DAG.getMachineFunction()
11626 .getMachineMemOperand(MachinePointerInfo::getFixedStack(SSFI),
11627 MachineMemOperand::MOLoad, ByteSize, ByteSize);
11629 MMO = cast<LoadSDNode>(StackSlot)->getMemOperand();
11630 StackSlot = StackSlot.getOperand(1);
11632 SDValue Ops[] = { Chain, StackSlot, DAG.getValueType(SrcVT) };
11633 SDValue Result = DAG.getMemIntrinsicNode(useSSE ? X86ISD::FILD_FLAG :
11635 Tys, Ops, SrcVT, MMO);
11638 Chain = Result.getValue(1);
11639 SDValue InFlag = Result.getValue(2);
11641 // FIXME: Currently the FST is flagged to the FILD_FLAG. This
11642 // shouldn't be necessary except that RFP cannot be live across
11643 // multiple blocks. When stackifier is fixed, they can be uncoupled.
11644 MachineFunction &MF = DAG.getMachineFunction();
11645 unsigned SSFISize = Op.getValueType().getSizeInBits()/8;
11646 int SSFI = MF.getFrameInfo()->CreateStackObject(SSFISize, SSFISize, false);
11647 SDValue StackSlot = DAG.getFrameIndex(SSFI, getPointerTy());
11648 Tys = DAG.getVTList(MVT::Other);
11650 Chain, Result, StackSlot, DAG.getValueType(Op.getValueType()), InFlag
11652 MachineMemOperand *MMO =
11653 DAG.getMachineFunction()
11654 .getMachineMemOperand(MachinePointerInfo::getFixedStack(SSFI),
11655 MachineMemOperand::MOStore, SSFISize, SSFISize);
11657 Chain = DAG.getMemIntrinsicNode(X86ISD::FST, DL, Tys,
11658 Ops, Op.getValueType(), MMO);
11659 Result = DAG.getLoad(Op.getValueType(), DL, Chain, StackSlot,
11660 MachinePointerInfo::getFixedStack(SSFI),
11661 false, false, false, 0);
11667 // LowerUINT_TO_FP_i64 - 64-bit unsigned integer to double expansion.
11668 SDValue X86TargetLowering::LowerUINT_TO_FP_i64(SDValue Op,
11669 SelectionDAG &DAG) const {
11670 // This algorithm is not obvious. Here it is what we're trying to output:
11673 punpckldq (c0), %xmm0 // c0: (uint4){ 0x43300000U, 0x45300000U, 0U, 0U }
11674 subpd (c1), %xmm0 // c1: (double2){ 0x1.0p52, 0x1.0p52 * 0x1.0p32 }
11676 haddpd %xmm0, %xmm0
11678 pshufd $0x4e, %xmm0, %xmm1
11684 LLVMContext *Context = DAG.getContext();
11686 // Build some magic constants.
11687 static const uint32_t CV0[] = { 0x43300000, 0x45300000, 0, 0 };
11688 Constant *C0 = ConstantDataVector::get(*Context, CV0);
11689 SDValue CPIdx0 = DAG.getConstantPool(C0, getPointerTy(), 16);
11691 SmallVector<Constant*,2> CV1;
11693 ConstantFP::get(*Context, APFloat(APFloat::IEEEdouble,
11694 APInt(64, 0x4330000000000000ULL))));
11696 ConstantFP::get(*Context, APFloat(APFloat::IEEEdouble,
11697 APInt(64, 0x4530000000000000ULL))));
11698 Constant *C1 = ConstantVector::get(CV1);
11699 SDValue CPIdx1 = DAG.getConstantPool(C1, getPointerTy(), 16);
11701 // Load the 64-bit value into an XMM register.
11702 SDValue XR1 = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, MVT::v2i64,
11704 SDValue CLod0 = DAG.getLoad(MVT::v4i32, dl, DAG.getEntryNode(), CPIdx0,
11705 MachinePointerInfo::getConstantPool(),
11706 false, false, false, 16);
11707 SDValue Unpck1 = getUnpackl(DAG, dl, MVT::v4i32,
11708 DAG.getNode(ISD::BITCAST, dl, MVT::v4i32, XR1),
11711 SDValue CLod1 = DAG.getLoad(MVT::v2f64, dl, CLod0.getValue(1), CPIdx1,
11712 MachinePointerInfo::getConstantPool(),
11713 false, false, false, 16);
11714 SDValue XR2F = DAG.getNode(ISD::BITCAST, dl, MVT::v2f64, Unpck1);
11715 SDValue Sub = DAG.getNode(ISD::FSUB, dl, MVT::v2f64, XR2F, CLod1);
11718 if (Subtarget->hasSSE3()) {
11719 // FIXME: The 'haddpd' instruction may be slower than 'movhlps + addsd'.
11720 Result = DAG.getNode(X86ISD::FHADD, dl, MVT::v2f64, Sub, Sub);
11722 SDValue S2F = DAG.getNode(ISD::BITCAST, dl, MVT::v4i32, Sub);
11723 SDValue Shuffle = getTargetShuffleNode(X86ISD::PSHUFD, dl, MVT::v4i32,
11725 Result = DAG.getNode(ISD::FADD, dl, MVT::v2f64,
11726 DAG.getNode(ISD::BITCAST, dl, MVT::v2f64, Shuffle),
11730 return DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::f64, Result,
11731 DAG.getIntPtrConstant(0));
11734 // LowerUINT_TO_FP_i32 - 32-bit unsigned integer to float expansion.
11735 SDValue X86TargetLowering::LowerUINT_TO_FP_i32(SDValue Op,
11736 SelectionDAG &DAG) const {
11738 // FP constant to bias correct the final result.
11739 SDValue Bias = DAG.getConstantFP(BitsToDouble(0x4330000000000000ULL),
11742 // Load the 32-bit value into an XMM register.
11743 SDValue Load = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, MVT::v4i32,
11746 // Zero out the upper parts of the register.
11747 Load = getShuffleVectorZeroOrUndef(Load, 0, true, Subtarget, DAG);
11749 Load = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::f64,
11750 DAG.getNode(ISD::BITCAST, dl, MVT::v2f64, Load),
11751 DAG.getIntPtrConstant(0));
11753 // Or the load with the bias.
11754 SDValue Or = DAG.getNode(ISD::OR, dl, MVT::v2i64,
11755 DAG.getNode(ISD::BITCAST, dl, MVT::v2i64,
11756 DAG.getNode(ISD::SCALAR_TO_VECTOR, dl,
11757 MVT::v2f64, Load)),
11758 DAG.getNode(ISD::BITCAST, dl, MVT::v2i64,
11759 DAG.getNode(ISD::SCALAR_TO_VECTOR, dl,
11760 MVT::v2f64, Bias)));
11761 Or = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::f64,
11762 DAG.getNode(ISD::BITCAST, dl, MVT::v2f64, Or),
11763 DAG.getIntPtrConstant(0));
11765 // Subtract the bias.
11766 SDValue Sub = DAG.getNode(ISD::FSUB, dl, MVT::f64, Or, Bias);
11768 // Handle final rounding.
11769 EVT DestVT = Op.getValueType();
11771 if (DestVT.bitsLT(MVT::f64))
11772 return DAG.getNode(ISD::FP_ROUND, dl, DestVT, Sub,
11773 DAG.getIntPtrConstant(0));
11774 if (DestVT.bitsGT(MVT::f64))
11775 return DAG.getNode(ISD::FP_EXTEND, dl, DestVT, Sub);
11777 // Handle final rounding.
11781 SDValue X86TargetLowering::lowerUINT_TO_FP_vec(SDValue Op,
11782 SelectionDAG &DAG) const {
11783 SDValue N0 = Op.getOperand(0);
11784 MVT SVT = N0.getSimpleValueType();
11787 assert((SVT == MVT::v4i8 || SVT == MVT::v4i16 ||
11788 SVT == MVT::v8i8 || SVT == MVT::v8i16) &&
11789 "Custom UINT_TO_FP is not supported!");
11791 MVT NVT = MVT::getVectorVT(MVT::i32, SVT.getVectorNumElements());
11792 return DAG.getNode(ISD::SINT_TO_FP, dl, Op.getValueType(),
11793 DAG.getNode(ISD::ZERO_EXTEND, dl, NVT, N0));
11796 SDValue X86TargetLowering::LowerUINT_TO_FP(SDValue Op,
11797 SelectionDAG &DAG) const {
11798 SDValue N0 = Op.getOperand(0);
11801 if (Op.getValueType().isVector())
11802 return lowerUINT_TO_FP_vec(Op, DAG);
11804 // Since UINT_TO_FP is legal (it's marked custom), dag combiner won't
11805 // optimize it to a SINT_TO_FP when the sign bit is known zero. Perform
11806 // the optimization here.
11807 if (DAG.SignBitIsZero(N0))
11808 return DAG.getNode(ISD::SINT_TO_FP, dl, Op.getValueType(), N0);
11810 MVT SrcVT = N0.getSimpleValueType();
11811 MVT DstVT = Op.getSimpleValueType();
11812 if (SrcVT == MVT::i64 && DstVT == MVT::f64 && X86ScalarSSEf64)
11813 return LowerUINT_TO_FP_i64(Op, DAG);
11814 if (SrcVT == MVT::i32 && X86ScalarSSEf64)
11815 return LowerUINT_TO_FP_i32(Op, DAG);
11816 if (Subtarget->is64Bit() && SrcVT == MVT::i64 && DstVT == MVT::f32)
11819 // Make a 64-bit buffer, and use it to build an FILD.
11820 SDValue StackSlot = DAG.CreateStackTemporary(MVT::i64);
11821 if (SrcVT == MVT::i32) {
11822 SDValue WordOff = DAG.getConstant(4, getPointerTy());
11823 SDValue OffsetSlot = DAG.getNode(ISD::ADD, dl,
11824 getPointerTy(), StackSlot, WordOff);
11825 SDValue Store1 = DAG.getStore(DAG.getEntryNode(), dl, Op.getOperand(0),
11826 StackSlot, MachinePointerInfo(),
11828 SDValue Store2 = DAG.getStore(Store1, dl, DAG.getConstant(0, MVT::i32),
11829 OffsetSlot, MachinePointerInfo(),
11831 SDValue Fild = BuildFILD(Op, MVT::i64, Store2, StackSlot, DAG);
11835 assert(SrcVT == MVT::i64 && "Unexpected type in UINT_TO_FP");
11836 SDValue Store = DAG.getStore(DAG.getEntryNode(), dl, Op.getOperand(0),
11837 StackSlot, MachinePointerInfo(),
11839 // For i64 source, we need to add the appropriate power of 2 if the input
11840 // was negative. This is the same as the optimization in
11841 // DAGTypeLegalizer::ExpandIntOp_UNIT_TO_FP, and for it to be safe here,
11842 // we must be careful to do the computation in x87 extended precision, not
11843 // in SSE. (The generic code can't know it's OK to do this, or how to.)
11844 int SSFI = cast<FrameIndexSDNode>(StackSlot)->getIndex();
11845 MachineMemOperand *MMO =
11846 DAG.getMachineFunction()
11847 .getMachineMemOperand(MachinePointerInfo::getFixedStack(SSFI),
11848 MachineMemOperand::MOLoad, 8, 8);
11850 SDVTList Tys = DAG.getVTList(MVT::f80, MVT::Other);
11851 SDValue Ops[] = { Store, StackSlot, DAG.getValueType(MVT::i64) };
11852 SDValue Fild = DAG.getMemIntrinsicNode(X86ISD::FILD, dl, Tys, Ops,
11855 APInt FF(32, 0x5F800000ULL);
11857 // Check whether the sign bit is set.
11858 SDValue SignSet = DAG.getSetCC(dl,
11859 getSetCCResultType(*DAG.getContext(), MVT::i64),
11860 Op.getOperand(0), DAG.getConstant(0, MVT::i64),
11863 // Build a 64 bit pair (0, FF) in the constant pool, with FF in the lo bits.
11864 SDValue FudgePtr = DAG.getConstantPool(
11865 ConstantInt::get(*DAG.getContext(), FF.zext(64)),
11868 // Get a pointer to FF if the sign bit was set, or to 0 otherwise.
11869 SDValue Zero = DAG.getIntPtrConstant(0);
11870 SDValue Four = DAG.getIntPtrConstant(4);
11871 SDValue Offset = DAG.getNode(ISD::SELECT, dl, Zero.getValueType(), SignSet,
11873 FudgePtr = DAG.getNode(ISD::ADD, dl, getPointerTy(), FudgePtr, Offset);
11875 // Load the value out, extending it from f32 to f80.
11876 // FIXME: Avoid the extend by constructing the right constant pool?
11877 SDValue Fudge = DAG.getExtLoad(ISD::EXTLOAD, dl, MVT::f80, DAG.getEntryNode(),
11878 FudgePtr, MachinePointerInfo::getConstantPool(),
11879 MVT::f32, false, false, false, 4);
11880 // Extend everything to 80 bits to force it to be done on x87.
11881 SDValue Add = DAG.getNode(ISD::FADD, dl, MVT::f80, Fild, Fudge);
11882 return DAG.getNode(ISD::FP_ROUND, dl, DstVT, Add, DAG.getIntPtrConstant(0));
11885 std::pair<SDValue,SDValue>
11886 X86TargetLowering:: FP_TO_INTHelper(SDValue Op, SelectionDAG &DAG,
11887 bool IsSigned, bool IsReplace) const {
11890 EVT DstTy = Op.getValueType();
11892 if (!IsSigned && !isIntegerTypeFTOL(DstTy)) {
11893 assert(DstTy == MVT::i32 && "Unexpected FP_TO_UINT");
11897 assert(DstTy.getSimpleVT() <= MVT::i64 &&
11898 DstTy.getSimpleVT() >= MVT::i16 &&
11899 "Unknown FP_TO_INT to lower!");
11901 // These are really Legal.
11902 if (DstTy == MVT::i32 &&
11903 isScalarFPTypeInSSEReg(Op.getOperand(0).getValueType()))
11904 return std::make_pair(SDValue(), SDValue());
11905 if (Subtarget->is64Bit() &&
11906 DstTy == MVT::i64 &&
11907 isScalarFPTypeInSSEReg(Op.getOperand(0).getValueType()))
11908 return std::make_pair(SDValue(), SDValue());
11910 // We lower FP->int64 either into FISTP64 followed by a load from a temporary
11911 // stack slot, or into the FTOL runtime function.
11912 MachineFunction &MF = DAG.getMachineFunction();
11913 unsigned MemSize = DstTy.getSizeInBits()/8;
11914 int SSFI = MF.getFrameInfo()->CreateStackObject(MemSize, MemSize, false);
11915 SDValue StackSlot = DAG.getFrameIndex(SSFI, getPointerTy());
11918 if (!IsSigned && isIntegerTypeFTOL(DstTy))
11919 Opc = X86ISD::WIN_FTOL;
11921 switch (DstTy.getSimpleVT().SimpleTy) {
11922 default: llvm_unreachable("Invalid FP_TO_SINT to lower!");
11923 case MVT::i16: Opc = X86ISD::FP_TO_INT16_IN_MEM; break;
11924 case MVT::i32: Opc = X86ISD::FP_TO_INT32_IN_MEM; break;
11925 case MVT::i64: Opc = X86ISD::FP_TO_INT64_IN_MEM; break;
11928 SDValue Chain = DAG.getEntryNode();
11929 SDValue Value = Op.getOperand(0);
11930 EVT TheVT = Op.getOperand(0).getValueType();
11931 // FIXME This causes a redundant load/store if the SSE-class value is already
11932 // in memory, such as if it is on the callstack.
11933 if (isScalarFPTypeInSSEReg(TheVT)) {
11934 assert(DstTy == MVT::i64 && "Invalid FP_TO_SINT to lower!");
11935 Chain = DAG.getStore(Chain, DL, Value, StackSlot,
11936 MachinePointerInfo::getFixedStack(SSFI),
11938 SDVTList Tys = DAG.getVTList(Op.getOperand(0).getValueType(), MVT::Other);
11940 Chain, StackSlot, DAG.getValueType(TheVT)
11943 MachineMemOperand *MMO =
11944 MF.getMachineMemOperand(MachinePointerInfo::getFixedStack(SSFI),
11945 MachineMemOperand::MOLoad, MemSize, MemSize);
11946 Value = DAG.getMemIntrinsicNode(X86ISD::FLD, DL, Tys, Ops, DstTy, MMO);
11947 Chain = Value.getValue(1);
11948 SSFI = MF.getFrameInfo()->CreateStackObject(MemSize, MemSize, false);
11949 StackSlot = DAG.getFrameIndex(SSFI, getPointerTy());
11952 MachineMemOperand *MMO =
11953 MF.getMachineMemOperand(MachinePointerInfo::getFixedStack(SSFI),
11954 MachineMemOperand::MOStore, MemSize, MemSize);
11956 if (Opc != X86ISD::WIN_FTOL) {
11957 // Build the FP_TO_INT*_IN_MEM
11958 SDValue Ops[] = { Chain, Value, StackSlot };
11959 SDValue FIST = DAG.getMemIntrinsicNode(Opc, DL, DAG.getVTList(MVT::Other),
11961 return std::make_pair(FIST, StackSlot);
11963 SDValue ftol = DAG.getNode(X86ISD::WIN_FTOL, DL,
11964 DAG.getVTList(MVT::Other, MVT::Glue),
11966 SDValue eax = DAG.getCopyFromReg(ftol, DL, X86::EAX,
11967 MVT::i32, ftol.getValue(1));
11968 SDValue edx = DAG.getCopyFromReg(eax.getValue(1), DL, X86::EDX,
11969 MVT::i32, eax.getValue(2));
11970 SDValue Ops[] = { eax, edx };
11971 SDValue pair = IsReplace
11972 ? DAG.getNode(ISD::BUILD_PAIR, DL, MVT::i64, Ops)
11973 : DAG.getMergeValues(Ops, DL);
11974 return std::make_pair(pair, SDValue());
11978 static SDValue LowerAVXExtend(SDValue Op, SelectionDAG &DAG,
11979 const X86Subtarget *Subtarget) {
11980 MVT VT = Op->getSimpleValueType(0);
11981 SDValue In = Op->getOperand(0);
11982 MVT InVT = In.getSimpleValueType();
11985 // Optimize vectors in AVX mode:
11988 // Use vpunpcklwd for 4 lower elements v8i16 -> v4i32.
11989 // Use vpunpckhwd for 4 upper elements v8i16 -> v4i32.
11990 // Concat upper and lower parts.
11993 // Use vpunpckldq for 4 lower elements v4i32 -> v2i64.
11994 // Use vpunpckhdq for 4 upper elements v4i32 -> v2i64.
11995 // Concat upper and lower parts.
11998 if (((VT != MVT::v16i16) || (InVT != MVT::v16i8)) &&
11999 ((VT != MVT::v8i32) || (InVT != MVT::v8i16)) &&
12000 ((VT != MVT::v4i64) || (InVT != MVT::v4i32)))
12003 if (Subtarget->hasInt256())
12004 return DAG.getNode(X86ISD::VZEXT, dl, VT, In);
12006 SDValue ZeroVec = getZeroVector(InVT, Subtarget, DAG, dl);
12007 SDValue Undef = DAG.getUNDEF(InVT);
12008 bool NeedZero = Op.getOpcode() == ISD::ZERO_EXTEND;
12009 SDValue OpLo = getUnpackl(DAG, dl, InVT, In, NeedZero ? ZeroVec : Undef);
12010 SDValue OpHi = getUnpackh(DAG, dl, InVT, In, NeedZero ? ZeroVec : Undef);
12012 MVT HVT = MVT::getVectorVT(VT.getVectorElementType(),
12013 VT.getVectorNumElements()/2);
12015 OpLo = DAG.getNode(ISD::BITCAST, dl, HVT, OpLo);
12016 OpHi = DAG.getNode(ISD::BITCAST, dl, HVT, OpHi);
12018 return DAG.getNode(ISD::CONCAT_VECTORS, dl, VT, OpLo, OpHi);
12021 static SDValue LowerZERO_EXTEND_AVX512(SDValue Op,
12022 SelectionDAG &DAG) {
12023 MVT VT = Op->getSimpleValueType(0);
12024 SDValue In = Op->getOperand(0);
12025 MVT InVT = In.getSimpleValueType();
12027 unsigned int NumElts = VT.getVectorNumElements();
12028 if (NumElts != 8 && NumElts != 16)
12031 if (VT.is512BitVector() && InVT.getVectorElementType() != MVT::i1)
12032 return DAG.getNode(X86ISD::VZEXT, DL, VT, In);
12034 EVT ExtVT = (NumElts == 8)? MVT::v8i64 : MVT::v16i32;
12035 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
12036 // Now we have only mask extension
12037 assert(InVT.getVectorElementType() == MVT::i1);
12038 SDValue Cst = DAG.getTargetConstant(1, ExtVT.getScalarType());
12039 const Constant *C = (dyn_cast<ConstantSDNode>(Cst))->getConstantIntValue();
12040 SDValue CP = DAG.getConstantPool(C, TLI.getPointerTy());
12041 unsigned Alignment = cast<ConstantPoolSDNode>(CP)->getAlignment();
12042 SDValue Ld = DAG.getLoad(Cst.getValueType(), DL, DAG.getEntryNode(), CP,
12043 MachinePointerInfo::getConstantPool(),
12044 false, false, false, Alignment);
12046 SDValue Brcst = DAG.getNode(X86ISD::VBROADCASTM, DL, ExtVT, In, Ld);
12047 if (VT.is512BitVector())
12049 return DAG.getNode(X86ISD::VTRUNC, DL, VT, Brcst);
12052 static SDValue LowerANY_EXTEND(SDValue Op, const X86Subtarget *Subtarget,
12053 SelectionDAG &DAG) {
12054 if (Subtarget->hasFp256()) {
12055 SDValue Res = LowerAVXExtend(Op, DAG, Subtarget);
12063 static SDValue LowerZERO_EXTEND(SDValue Op, const X86Subtarget *Subtarget,
12064 SelectionDAG &DAG) {
12066 MVT VT = Op.getSimpleValueType();
12067 SDValue In = Op.getOperand(0);
12068 MVT SVT = In.getSimpleValueType();
12070 if (VT.is512BitVector() || SVT.getVectorElementType() == MVT::i1)
12071 return LowerZERO_EXTEND_AVX512(Op, DAG);
12073 if (Subtarget->hasFp256()) {
12074 SDValue Res = LowerAVXExtend(Op, DAG, Subtarget);
12079 assert(!VT.is256BitVector() || !SVT.is128BitVector() ||
12080 VT.getVectorNumElements() != SVT.getVectorNumElements());
12084 SDValue X86TargetLowering::LowerTRUNCATE(SDValue Op, SelectionDAG &DAG) const {
12086 MVT VT = Op.getSimpleValueType();
12087 SDValue In = Op.getOperand(0);
12088 MVT InVT = In.getSimpleValueType();
12090 if (VT == MVT::i1) {
12091 assert((InVT.isInteger() && (InVT.getSizeInBits() <= 64)) &&
12092 "Invalid scalar TRUNCATE operation");
12093 if (InVT.getSizeInBits() >= 32)
12095 In = DAG.getNode(ISD::ANY_EXTEND, DL, MVT::i32, In);
12096 return DAG.getNode(ISD::TRUNCATE, DL, VT, In);
12098 assert(VT.getVectorNumElements() == InVT.getVectorNumElements() &&
12099 "Invalid TRUNCATE operation");
12101 if (InVT.is512BitVector() || VT.getVectorElementType() == MVT::i1) {
12102 if (VT.getVectorElementType().getSizeInBits() >=8)
12103 return DAG.getNode(X86ISD::VTRUNC, DL, VT, In);
12105 assert(VT.getVectorElementType() == MVT::i1 && "Unexpected vector type");
12106 unsigned NumElts = InVT.getVectorNumElements();
12107 assert ((NumElts == 8 || NumElts == 16) && "Unexpected vector type");
12108 if (InVT.getSizeInBits() < 512) {
12109 MVT ExtVT = (NumElts == 16)? MVT::v16i32 : MVT::v8i64;
12110 In = DAG.getNode(ISD::SIGN_EXTEND, DL, ExtVT, In);
12114 SDValue Cst = DAG.getTargetConstant(1, InVT.getVectorElementType());
12115 const Constant *C = (dyn_cast<ConstantSDNode>(Cst))->getConstantIntValue();
12116 SDValue CP = DAG.getConstantPool(C, getPointerTy());
12117 unsigned Alignment = cast<ConstantPoolSDNode>(CP)->getAlignment();
12118 SDValue Ld = DAG.getLoad(Cst.getValueType(), DL, DAG.getEntryNode(), CP,
12119 MachinePointerInfo::getConstantPool(),
12120 false, false, false, Alignment);
12121 SDValue OneV = DAG.getNode(X86ISD::VBROADCAST, DL, InVT, Ld);
12122 SDValue And = DAG.getNode(ISD::AND, DL, InVT, OneV, In);
12123 return DAG.getNode(X86ISD::TESTM, DL, VT, And, And);
12126 if ((VT == MVT::v4i32) && (InVT == MVT::v4i64)) {
12127 // On AVX2, v4i64 -> v4i32 becomes VPERMD.
12128 if (Subtarget->hasInt256()) {
12129 static const int ShufMask[] = {0, 2, 4, 6, -1, -1, -1, -1};
12130 In = DAG.getNode(ISD::BITCAST, DL, MVT::v8i32, In);
12131 In = DAG.getVectorShuffle(MVT::v8i32, DL, In, DAG.getUNDEF(MVT::v8i32),
12133 return DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, VT, In,
12134 DAG.getIntPtrConstant(0));
12137 SDValue OpLo = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, MVT::v2i64, In,
12138 DAG.getIntPtrConstant(0));
12139 SDValue OpHi = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, MVT::v2i64, In,
12140 DAG.getIntPtrConstant(2));
12141 OpLo = DAG.getNode(ISD::BITCAST, DL, MVT::v4i32, OpLo);
12142 OpHi = DAG.getNode(ISD::BITCAST, DL, MVT::v4i32, OpHi);
12143 static const int ShufMask[] = {0, 2, 4, 6};
12144 return DAG.getVectorShuffle(VT, DL, OpLo, OpHi, ShufMask);
12147 if ((VT == MVT::v8i16) && (InVT == MVT::v8i32)) {
12148 // On AVX2, v8i32 -> v8i16 becomed PSHUFB.
12149 if (Subtarget->hasInt256()) {
12150 In = DAG.getNode(ISD::BITCAST, DL, MVT::v32i8, In);
12152 SmallVector<SDValue,32> pshufbMask;
12153 for (unsigned i = 0; i < 2; ++i) {
12154 pshufbMask.push_back(DAG.getConstant(0x0, MVT::i8));
12155 pshufbMask.push_back(DAG.getConstant(0x1, MVT::i8));
12156 pshufbMask.push_back(DAG.getConstant(0x4, MVT::i8));
12157 pshufbMask.push_back(DAG.getConstant(0x5, MVT::i8));
12158 pshufbMask.push_back(DAG.getConstant(0x8, MVT::i8));
12159 pshufbMask.push_back(DAG.getConstant(0x9, MVT::i8));
12160 pshufbMask.push_back(DAG.getConstant(0xc, MVT::i8));
12161 pshufbMask.push_back(DAG.getConstant(0xd, MVT::i8));
12162 for (unsigned j = 0; j < 8; ++j)
12163 pshufbMask.push_back(DAG.getConstant(0x80, MVT::i8));
12165 SDValue BV = DAG.getNode(ISD::BUILD_VECTOR, DL, MVT::v32i8, pshufbMask);
12166 In = DAG.getNode(X86ISD::PSHUFB, DL, MVT::v32i8, In, BV);
12167 In = DAG.getNode(ISD::BITCAST, DL, MVT::v4i64, In);
12169 static const int ShufMask[] = {0, 2, -1, -1};
12170 In = DAG.getVectorShuffle(MVT::v4i64, DL, In, DAG.getUNDEF(MVT::v4i64),
12172 In = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, MVT::v2i64, In,
12173 DAG.getIntPtrConstant(0));
12174 return DAG.getNode(ISD::BITCAST, DL, VT, In);
12177 SDValue OpLo = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, MVT::v4i32, In,
12178 DAG.getIntPtrConstant(0));
12180 SDValue OpHi = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, MVT::v4i32, In,
12181 DAG.getIntPtrConstant(4));
12183 OpLo = DAG.getNode(ISD::BITCAST, DL, MVT::v16i8, OpLo);
12184 OpHi = DAG.getNode(ISD::BITCAST, DL, MVT::v16i8, OpHi);
12186 // The PSHUFB mask:
12187 static const int ShufMask1[] = {0, 1, 4, 5, 8, 9, 12, 13,
12188 -1, -1, -1, -1, -1, -1, -1, -1};
12190 SDValue Undef = DAG.getUNDEF(MVT::v16i8);
12191 OpLo = DAG.getVectorShuffle(MVT::v16i8, DL, OpLo, Undef, ShufMask1);
12192 OpHi = DAG.getVectorShuffle(MVT::v16i8, DL, OpHi, Undef, ShufMask1);
12194 OpLo = DAG.getNode(ISD::BITCAST, DL, MVT::v4i32, OpLo);
12195 OpHi = DAG.getNode(ISD::BITCAST, DL, MVT::v4i32, OpHi);
12197 // The MOVLHPS Mask:
12198 static const int ShufMask2[] = {0, 1, 4, 5};
12199 SDValue res = DAG.getVectorShuffle(MVT::v4i32, DL, OpLo, OpHi, ShufMask2);
12200 return DAG.getNode(ISD::BITCAST, DL, MVT::v8i16, res);
12203 // Handle truncation of V256 to V128 using shuffles.
12204 if (!VT.is128BitVector() || !InVT.is256BitVector())
12207 assert(Subtarget->hasFp256() && "256-bit vector without AVX!");
12209 unsigned NumElems = VT.getVectorNumElements();
12210 MVT NVT = MVT::getVectorVT(VT.getVectorElementType(), NumElems * 2);
12212 SmallVector<int, 16> MaskVec(NumElems * 2, -1);
12213 // Prepare truncation shuffle mask
12214 for (unsigned i = 0; i != NumElems; ++i)
12215 MaskVec[i] = i * 2;
12216 SDValue V = DAG.getVectorShuffle(NVT, DL,
12217 DAG.getNode(ISD::BITCAST, DL, NVT, In),
12218 DAG.getUNDEF(NVT), &MaskVec[0]);
12219 return DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, VT, V,
12220 DAG.getIntPtrConstant(0));
12223 SDValue X86TargetLowering::LowerFP_TO_SINT(SDValue Op,
12224 SelectionDAG &DAG) const {
12225 assert(!Op.getSimpleValueType().isVector());
12227 std::pair<SDValue,SDValue> Vals = FP_TO_INTHelper(Op, DAG,
12228 /*IsSigned=*/ true, /*IsReplace=*/ false);
12229 SDValue FIST = Vals.first, StackSlot = Vals.second;
12230 // If FP_TO_INTHelper failed, the node is actually supposed to be Legal.
12231 if (!FIST.getNode()) return Op;
12233 if (StackSlot.getNode())
12234 // Load the result.
12235 return DAG.getLoad(Op.getValueType(), SDLoc(Op),
12236 FIST, StackSlot, MachinePointerInfo(),
12237 false, false, false, 0);
12239 // The node is the result.
12243 SDValue X86TargetLowering::LowerFP_TO_UINT(SDValue Op,
12244 SelectionDAG &DAG) const {
12245 std::pair<SDValue,SDValue> Vals = FP_TO_INTHelper(Op, DAG,
12246 /*IsSigned=*/ false, /*IsReplace=*/ false);
12247 SDValue FIST = Vals.first, StackSlot = Vals.second;
12248 assert(FIST.getNode() && "Unexpected failure");
12250 if (StackSlot.getNode())
12251 // Load the result.
12252 return DAG.getLoad(Op.getValueType(), SDLoc(Op),
12253 FIST, StackSlot, MachinePointerInfo(),
12254 false, false, false, 0);
12256 // The node is the result.
12260 static SDValue LowerFP_EXTEND(SDValue Op, SelectionDAG &DAG) {
12262 MVT VT = Op.getSimpleValueType();
12263 SDValue In = Op.getOperand(0);
12264 MVT SVT = In.getSimpleValueType();
12266 assert(SVT == MVT::v2f32 && "Only customize MVT::v2f32 type legalization!");
12268 return DAG.getNode(X86ISD::VFPEXT, DL, VT,
12269 DAG.getNode(ISD::CONCAT_VECTORS, DL, MVT::v4f32,
12270 In, DAG.getUNDEF(SVT)));
12273 // The only differences between FABS and FNEG are the mask and the logic op.
12274 static SDValue LowerFABSorFNEG(SDValue Op, SelectionDAG &DAG) {
12275 assert((Op.getOpcode() == ISD::FABS || Op.getOpcode() == ISD::FNEG) &&
12276 "Wrong opcode for lowering FABS or FNEG.");
12278 bool IsFABS = (Op.getOpcode() == ISD::FABS);
12280 MVT VT = Op.getSimpleValueType();
12281 // Assume scalar op for initialization; update for vector if needed.
12282 // Note that there are no scalar bitwise logical SSE/AVX instructions, so we
12283 // generate a 16-byte vector constant and logic op even for the scalar case.
12284 // Using a 16-byte mask allows folding the load of the mask with
12285 // the logic op, so it can save (~4 bytes) on code size.
12287 unsigned NumElts = VT == MVT::f64 ? 2 : 4;
12288 // FIXME: Use function attribute "OptimizeForSize" and/or CodeGenOpt::Level to
12289 // decide if we should generate a 16-byte constant mask when we only need 4 or
12290 // 8 bytes for the scalar case.
12291 if (VT.isVector()) {
12292 EltVT = VT.getVectorElementType();
12293 NumElts = VT.getVectorNumElements();
12296 unsigned EltBits = EltVT.getSizeInBits();
12297 LLVMContext *Context = DAG.getContext();
12298 // For FABS, mask is 0x7f...; for FNEG, mask is 0x80...
12300 IsFABS ? APInt::getSignedMaxValue(EltBits) : APInt::getSignBit(EltBits);
12301 Constant *C = ConstantInt::get(*Context, MaskElt);
12302 C = ConstantVector::getSplat(NumElts, C);
12303 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
12304 SDValue CPIdx = DAG.getConstantPool(C, TLI.getPointerTy());
12305 unsigned Alignment = cast<ConstantPoolSDNode>(CPIdx)->getAlignment();
12306 SDValue Mask = DAG.getLoad(VT, dl, DAG.getEntryNode(), CPIdx,
12307 MachinePointerInfo::getConstantPool(),
12308 false, false, false, Alignment);
12310 if (VT.isVector()) {
12311 // For a vector, cast operands to a vector type, perform the logic op,
12312 // and cast the result back to the original value type.
12313 MVT VecVT = MVT::getVectorVT(MVT::i64, VT.getSizeInBits() / 64);
12314 SDValue Op0Casted = DAG.getNode(ISD::BITCAST, dl, VecVT, Op.getOperand(0));
12315 SDValue MaskCasted = DAG.getNode(ISD::BITCAST, dl, VecVT, Mask);
12316 unsigned LogicOp = IsFABS ? ISD::AND : ISD::XOR;
12317 return DAG.getNode(ISD::BITCAST, dl, VT,
12318 DAG.getNode(LogicOp, dl, VecVT, Op0Casted, MaskCasted));
12320 // If not vector, then scalar.
12321 unsigned LogicOp = IsFABS ? X86ISD::FAND : X86ISD::FXOR;
12322 return DAG.getNode(LogicOp, dl, VT, Op.getOperand(0), Mask);
12325 static SDValue LowerFCOPYSIGN(SDValue Op, SelectionDAG &DAG) {
12326 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
12327 LLVMContext *Context = DAG.getContext();
12328 SDValue Op0 = Op.getOperand(0);
12329 SDValue Op1 = Op.getOperand(1);
12331 MVT VT = Op.getSimpleValueType();
12332 MVT SrcVT = Op1.getSimpleValueType();
12334 // If second operand is smaller, extend it first.
12335 if (SrcVT.bitsLT(VT)) {
12336 Op1 = DAG.getNode(ISD::FP_EXTEND, dl, VT, Op1);
12339 // And if it is bigger, shrink it first.
12340 if (SrcVT.bitsGT(VT)) {
12341 Op1 = DAG.getNode(ISD::FP_ROUND, dl, VT, Op1, DAG.getIntPtrConstant(1));
12345 // At this point the operands and the result should have the same
12346 // type, and that won't be f80 since that is not custom lowered.
12348 // First get the sign bit of second operand.
12349 SmallVector<Constant*,4> CV;
12350 if (SrcVT == MVT::f64) {
12351 const fltSemantics &Sem = APFloat::IEEEdouble;
12352 CV.push_back(ConstantFP::get(*Context, APFloat(Sem, APInt(64, 1ULL << 63))));
12353 CV.push_back(ConstantFP::get(*Context, APFloat(Sem, APInt(64, 0))));
12355 const fltSemantics &Sem = APFloat::IEEEsingle;
12356 CV.push_back(ConstantFP::get(*Context, APFloat(Sem, APInt(32, 1U << 31))));
12357 CV.push_back(ConstantFP::get(*Context, APFloat(Sem, APInt(32, 0))));
12358 CV.push_back(ConstantFP::get(*Context, APFloat(Sem, APInt(32, 0))));
12359 CV.push_back(ConstantFP::get(*Context, APFloat(Sem, APInt(32, 0))));
12361 Constant *C = ConstantVector::get(CV);
12362 SDValue CPIdx = DAG.getConstantPool(C, TLI.getPointerTy(), 16);
12363 SDValue Mask1 = DAG.getLoad(SrcVT, dl, DAG.getEntryNode(), CPIdx,
12364 MachinePointerInfo::getConstantPool(),
12365 false, false, false, 16);
12366 SDValue SignBit = DAG.getNode(X86ISD::FAND, dl, SrcVT, Op1, Mask1);
12368 // Shift sign bit right or left if the two operands have different types.
12369 if (SrcVT.bitsGT(VT)) {
12370 // Op0 is MVT::f32, Op1 is MVT::f64.
12371 SignBit = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, MVT::v2f64, SignBit);
12372 SignBit = DAG.getNode(X86ISD::FSRL, dl, MVT::v2f64, SignBit,
12373 DAG.getConstant(32, MVT::i32));
12374 SignBit = DAG.getNode(ISD::BITCAST, dl, MVT::v4f32, SignBit);
12375 SignBit = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::f32, SignBit,
12376 DAG.getIntPtrConstant(0));
12379 // Clear first operand sign bit.
12381 if (VT == MVT::f64) {
12382 const fltSemantics &Sem = APFloat::IEEEdouble;
12383 CV.push_back(ConstantFP::get(*Context, APFloat(Sem,
12384 APInt(64, ~(1ULL << 63)))));
12385 CV.push_back(ConstantFP::get(*Context, APFloat(Sem, APInt(64, 0))));
12387 const fltSemantics &Sem = APFloat::IEEEsingle;
12388 CV.push_back(ConstantFP::get(*Context, APFloat(Sem,
12389 APInt(32, ~(1U << 31)))));
12390 CV.push_back(ConstantFP::get(*Context, APFloat(Sem, APInt(32, 0))));
12391 CV.push_back(ConstantFP::get(*Context, APFloat(Sem, APInt(32, 0))));
12392 CV.push_back(ConstantFP::get(*Context, APFloat(Sem, APInt(32, 0))));
12394 C = ConstantVector::get(CV);
12395 CPIdx = DAG.getConstantPool(C, TLI.getPointerTy(), 16);
12396 SDValue Mask2 = DAG.getLoad(VT, dl, DAG.getEntryNode(), CPIdx,
12397 MachinePointerInfo::getConstantPool(),
12398 false, false, false, 16);
12399 SDValue Val = DAG.getNode(X86ISD::FAND, dl, VT, Op0, Mask2);
12401 // Or the value with the sign bit.
12402 return DAG.getNode(X86ISD::FOR, dl, VT, Val, SignBit);
12405 static SDValue LowerFGETSIGN(SDValue Op, SelectionDAG &DAG) {
12406 SDValue N0 = Op.getOperand(0);
12408 MVT VT = Op.getSimpleValueType();
12410 // Lower ISD::FGETSIGN to (AND (X86ISD::FGETSIGNx86 ...) 1).
12411 SDValue xFGETSIGN = DAG.getNode(X86ISD::FGETSIGNx86, dl, VT, N0,
12412 DAG.getConstant(1, VT));
12413 return DAG.getNode(ISD::AND, dl, VT, xFGETSIGN, DAG.getConstant(1, VT));
12416 // LowerVectorAllZeroTest - Check whether an OR'd tree is PTEST-able.
12418 static SDValue LowerVectorAllZeroTest(SDValue Op, const X86Subtarget *Subtarget,
12419 SelectionDAG &DAG) {
12420 assert(Op.getOpcode() == ISD::OR && "Only check OR'd tree.");
12422 if (!Subtarget->hasSSE41())
12425 if (!Op->hasOneUse())
12428 SDNode *N = Op.getNode();
12431 SmallVector<SDValue, 8> Opnds;
12432 DenseMap<SDValue, unsigned> VecInMap;
12433 SmallVector<SDValue, 8> VecIns;
12434 EVT VT = MVT::Other;
12436 // Recognize a special case where a vector is casted into wide integer to
12438 Opnds.push_back(N->getOperand(0));
12439 Opnds.push_back(N->getOperand(1));
12441 for (unsigned Slot = 0, e = Opnds.size(); Slot < e; ++Slot) {
12442 SmallVectorImpl<SDValue>::const_iterator I = Opnds.begin() + Slot;
12443 // BFS traverse all OR'd operands.
12444 if (I->getOpcode() == ISD::OR) {
12445 Opnds.push_back(I->getOperand(0));
12446 Opnds.push_back(I->getOperand(1));
12447 // Re-evaluate the number of nodes to be traversed.
12448 e += 2; // 2 more nodes (LHS and RHS) are pushed.
12452 // Quit if a non-EXTRACT_VECTOR_ELT
12453 if (I->getOpcode() != ISD::EXTRACT_VECTOR_ELT)
12456 // Quit if without a constant index.
12457 SDValue Idx = I->getOperand(1);
12458 if (!isa<ConstantSDNode>(Idx))
12461 SDValue ExtractedFromVec = I->getOperand(0);
12462 DenseMap<SDValue, unsigned>::iterator M = VecInMap.find(ExtractedFromVec);
12463 if (M == VecInMap.end()) {
12464 VT = ExtractedFromVec.getValueType();
12465 // Quit if not 128/256-bit vector.
12466 if (!VT.is128BitVector() && !VT.is256BitVector())
12468 // Quit if not the same type.
12469 if (VecInMap.begin() != VecInMap.end() &&
12470 VT != VecInMap.begin()->first.getValueType())
12472 M = VecInMap.insert(std::make_pair(ExtractedFromVec, 0)).first;
12473 VecIns.push_back(ExtractedFromVec);
12475 M->second |= 1U << cast<ConstantSDNode>(Idx)->getZExtValue();
12478 assert((VT.is128BitVector() || VT.is256BitVector()) &&
12479 "Not extracted from 128-/256-bit vector.");
12481 unsigned FullMask = (1U << VT.getVectorNumElements()) - 1U;
12483 for (DenseMap<SDValue, unsigned>::const_iterator
12484 I = VecInMap.begin(), E = VecInMap.end(); I != E; ++I) {
12485 // Quit if not all elements are used.
12486 if (I->second != FullMask)
12490 EVT TestVT = VT.is128BitVector() ? MVT::v2i64 : MVT::v4i64;
12492 // Cast all vectors into TestVT for PTEST.
12493 for (unsigned i = 0, e = VecIns.size(); i < e; ++i)
12494 VecIns[i] = DAG.getNode(ISD::BITCAST, DL, TestVT, VecIns[i]);
12496 // If more than one full vectors are evaluated, OR them first before PTEST.
12497 for (unsigned Slot = 0, e = VecIns.size(); e - Slot > 1; Slot += 2, e += 1) {
12498 // Each iteration will OR 2 nodes and append the result until there is only
12499 // 1 node left, i.e. the final OR'd value of all vectors.
12500 SDValue LHS = VecIns[Slot];
12501 SDValue RHS = VecIns[Slot + 1];
12502 VecIns.push_back(DAG.getNode(ISD::OR, DL, TestVT, LHS, RHS));
12505 return DAG.getNode(X86ISD::PTEST, DL, MVT::i32,
12506 VecIns.back(), VecIns.back());
12509 /// \brief return true if \c Op has a use that doesn't just read flags.
12510 static bool hasNonFlagsUse(SDValue Op) {
12511 for (SDNode::use_iterator UI = Op->use_begin(), UE = Op->use_end(); UI != UE;
12513 SDNode *User = *UI;
12514 unsigned UOpNo = UI.getOperandNo();
12515 if (User->getOpcode() == ISD::TRUNCATE && User->hasOneUse()) {
12516 // Look pass truncate.
12517 UOpNo = User->use_begin().getOperandNo();
12518 User = *User->use_begin();
12521 if (User->getOpcode() != ISD::BRCOND && User->getOpcode() != ISD::SETCC &&
12522 !(User->getOpcode() == ISD::SELECT && UOpNo == 0))
12528 /// Emit nodes that will be selected as "test Op0,Op0", or something
12530 SDValue X86TargetLowering::EmitTest(SDValue Op, unsigned X86CC, SDLoc dl,
12531 SelectionDAG &DAG) const {
12532 if (Op.getValueType() == MVT::i1)
12533 // KORTEST instruction should be selected
12534 return DAG.getNode(X86ISD::CMP, dl, MVT::i32, Op,
12535 DAG.getConstant(0, Op.getValueType()));
12537 // CF and OF aren't always set the way we want. Determine which
12538 // of these we need.
12539 bool NeedCF = false;
12540 bool NeedOF = false;
12543 case X86::COND_A: case X86::COND_AE:
12544 case X86::COND_B: case X86::COND_BE:
12547 case X86::COND_G: case X86::COND_GE:
12548 case X86::COND_L: case X86::COND_LE:
12549 case X86::COND_O: case X86::COND_NO: {
12550 // Check if we really need to set the
12551 // Overflow flag. If NoSignedWrap is present
12552 // that is not actually needed.
12553 switch (Op->getOpcode()) {
12558 const BinaryWithFlagsSDNode *BinNode =
12559 cast<BinaryWithFlagsSDNode>(Op.getNode());
12560 if (BinNode->hasNoSignedWrap())
12570 // See if we can use the EFLAGS value from the operand instead of
12571 // doing a separate TEST. TEST always sets OF and CF to 0, so unless
12572 // we prove that the arithmetic won't overflow, we can't use OF or CF.
12573 if (Op.getResNo() != 0 || NeedOF || NeedCF) {
12574 // Emit a CMP with 0, which is the TEST pattern.
12575 //if (Op.getValueType() == MVT::i1)
12576 // return DAG.getNode(X86ISD::CMP, dl, MVT::i1, Op,
12577 // DAG.getConstant(0, MVT::i1));
12578 return DAG.getNode(X86ISD::CMP, dl, MVT::i32, Op,
12579 DAG.getConstant(0, Op.getValueType()));
12581 unsigned Opcode = 0;
12582 unsigned NumOperands = 0;
12584 // Truncate operations may prevent the merge of the SETCC instruction
12585 // and the arithmetic instruction before it. Attempt to truncate the operands
12586 // of the arithmetic instruction and use a reduced bit-width instruction.
12587 bool NeedTruncation = false;
12588 SDValue ArithOp = Op;
12589 if (Op->getOpcode() == ISD::TRUNCATE && Op->hasOneUse()) {
12590 SDValue Arith = Op->getOperand(0);
12591 // Both the trunc and the arithmetic op need to have one user each.
12592 if (Arith->hasOneUse())
12593 switch (Arith.getOpcode()) {
12600 NeedTruncation = true;
12606 // NOTICE: In the code below we use ArithOp to hold the arithmetic operation
12607 // which may be the result of a CAST. We use the variable 'Op', which is the
12608 // non-casted variable when we check for possible users.
12609 switch (ArithOp.getOpcode()) {
12611 // Due to an isel shortcoming, be conservative if this add is likely to be
12612 // selected as part of a load-modify-store instruction. When the root node
12613 // in a match is a store, isel doesn't know how to remap non-chain non-flag
12614 // uses of other nodes in the match, such as the ADD in this case. This
12615 // leads to the ADD being left around and reselected, with the result being
12616 // two adds in the output. Alas, even if none our users are stores, that
12617 // doesn't prove we're O.K. Ergo, if we have any parents that aren't
12618 // CopyToReg or SETCC, eschew INC/DEC. A better fix seems to require
12619 // climbing the DAG back to the root, and it doesn't seem to be worth the
12621 for (SDNode::use_iterator UI = Op.getNode()->use_begin(),
12622 UE = Op.getNode()->use_end(); UI != UE; ++UI)
12623 if (UI->getOpcode() != ISD::CopyToReg &&
12624 UI->getOpcode() != ISD::SETCC &&
12625 UI->getOpcode() != ISD::STORE)
12628 if (ConstantSDNode *C =
12629 dyn_cast<ConstantSDNode>(ArithOp.getNode()->getOperand(1))) {
12630 // An add of one will be selected as an INC.
12631 if (C->getAPIntValue() == 1 && !Subtarget->slowIncDec()) {
12632 Opcode = X86ISD::INC;
12637 // An add of negative one (subtract of one) will be selected as a DEC.
12638 if (C->getAPIntValue().isAllOnesValue() && !Subtarget->slowIncDec()) {
12639 Opcode = X86ISD::DEC;
12645 // Otherwise use a regular EFLAGS-setting add.
12646 Opcode = X86ISD::ADD;
12651 // If we have a constant logical shift that's only used in a comparison
12652 // against zero turn it into an equivalent AND. This allows turning it into
12653 // a TEST instruction later.
12654 if ((X86CC == X86::COND_E || X86CC == X86::COND_NE) && Op->hasOneUse() &&
12655 isa<ConstantSDNode>(Op->getOperand(1)) && !hasNonFlagsUse(Op)) {
12656 EVT VT = Op.getValueType();
12657 unsigned BitWidth = VT.getSizeInBits();
12658 unsigned ShAmt = Op->getConstantOperandVal(1);
12659 if (ShAmt >= BitWidth) // Avoid undefined shifts.
12661 APInt Mask = ArithOp.getOpcode() == ISD::SRL
12662 ? APInt::getHighBitsSet(BitWidth, BitWidth - ShAmt)
12663 : APInt::getLowBitsSet(BitWidth, BitWidth - ShAmt);
12664 if (!Mask.isSignedIntN(32)) // Avoid large immediates.
12666 SDValue New = DAG.getNode(ISD::AND, dl, VT, Op->getOperand(0),
12667 DAG.getConstant(Mask, VT));
12668 DAG.ReplaceAllUsesWith(Op, New);
12674 // If the primary and result isn't used, don't bother using X86ISD::AND,
12675 // because a TEST instruction will be better.
12676 if (!hasNonFlagsUse(Op))
12682 // Due to the ISEL shortcoming noted above, be conservative if this op is
12683 // likely to be selected as part of a load-modify-store instruction.
12684 for (SDNode::use_iterator UI = Op.getNode()->use_begin(),
12685 UE = Op.getNode()->use_end(); UI != UE; ++UI)
12686 if (UI->getOpcode() == ISD::STORE)
12689 // Otherwise use a regular EFLAGS-setting instruction.
12690 switch (ArithOp.getOpcode()) {
12691 default: llvm_unreachable("unexpected operator!");
12692 case ISD::SUB: Opcode = X86ISD::SUB; break;
12693 case ISD::XOR: Opcode = X86ISD::XOR; break;
12694 case ISD::AND: Opcode = X86ISD::AND; break;
12696 if (!NeedTruncation && (X86CC == X86::COND_E || X86CC == X86::COND_NE)) {
12697 SDValue EFLAGS = LowerVectorAllZeroTest(Op, Subtarget, DAG);
12698 if (EFLAGS.getNode())
12701 Opcode = X86ISD::OR;
12715 return SDValue(Op.getNode(), 1);
12721 // If we found that truncation is beneficial, perform the truncation and
12723 if (NeedTruncation) {
12724 EVT VT = Op.getValueType();
12725 SDValue WideVal = Op->getOperand(0);
12726 EVT WideVT = WideVal.getValueType();
12727 unsigned ConvertedOp = 0;
12728 // Use a target machine opcode to prevent further DAGCombine
12729 // optimizations that may separate the arithmetic operations
12730 // from the setcc node.
12731 switch (WideVal.getOpcode()) {
12733 case ISD::ADD: ConvertedOp = X86ISD::ADD; break;
12734 case ISD::SUB: ConvertedOp = X86ISD::SUB; break;
12735 case ISD::AND: ConvertedOp = X86ISD::AND; break;
12736 case ISD::OR: ConvertedOp = X86ISD::OR; break;
12737 case ISD::XOR: ConvertedOp = X86ISD::XOR; break;
12741 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
12742 if (TLI.isOperationLegal(WideVal.getOpcode(), WideVT)) {
12743 SDValue V0 = DAG.getNode(ISD::TRUNCATE, dl, VT, WideVal.getOperand(0));
12744 SDValue V1 = DAG.getNode(ISD::TRUNCATE, dl, VT, WideVal.getOperand(1));
12745 Op = DAG.getNode(ConvertedOp, dl, VT, V0, V1);
12751 // Emit a CMP with 0, which is the TEST pattern.
12752 return DAG.getNode(X86ISD::CMP, dl, MVT::i32, Op,
12753 DAG.getConstant(0, Op.getValueType()));
12755 SDVTList VTs = DAG.getVTList(Op.getValueType(), MVT::i32);
12756 SmallVector<SDValue, 4> Ops;
12757 for (unsigned i = 0; i != NumOperands; ++i)
12758 Ops.push_back(Op.getOperand(i));
12760 SDValue New = DAG.getNode(Opcode, dl, VTs, Ops);
12761 DAG.ReplaceAllUsesWith(Op, New);
12762 return SDValue(New.getNode(), 1);
12765 /// Emit nodes that will be selected as "cmp Op0,Op1", or something
12767 SDValue X86TargetLowering::EmitCmp(SDValue Op0, SDValue Op1, unsigned X86CC,
12768 SDLoc dl, SelectionDAG &DAG) const {
12769 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op1)) {
12770 if (C->getAPIntValue() == 0)
12771 return EmitTest(Op0, X86CC, dl, DAG);
12773 if (Op0.getValueType() == MVT::i1)
12774 llvm_unreachable("Unexpected comparison operation for MVT::i1 operands");
12777 if ((Op0.getValueType() == MVT::i8 || Op0.getValueType() == MVT::i16 ||
12778 Op0.getValueType() == MVT::i32 || Op0.getValueType() == MVT::i64)) {
12779 // Do the comparison at i32 if it's smaller, besides the Atom case.
12780 // This avoids subregister aliasing issues. Keep the smaller reference
12781 // if we're optimizing for size, however, as that'll allow better folding
12782 // of memory operations.
12783 if (Op0.getValueType() != MVT::i32 && Op0.getValueType() != MVT::i64 &&
12784 !DAG.getMachineFunction().getFunction()->getAttributes().hasAttribute(
12785 AttributeSet::FunctionIndex, Attribute::MinSize) &&
12786 !Subtarget->isAtom()) {
12787 unsigned ExtendOp =
12788 isX86CCUnsigned(X86CC) ? ISD::ZERO_EXTEND : ISD::SIGN_EXTEND;
12789 Op0 = DAG.getNode(ExtendOp, dl, MVT::i32, Op0);
12790 Op1 = DAG.getNode(ExtendOp, dl, MVT::i32, Op1);
12792 // Use SUB instead of CMP to enable CSE between SUB and CMP.
12793 SDVTList VTs = DAG.getVTList(Op0.getValueType(), MVT::i32);
12794 SDValue Sub = DAG.getNode(X86ISD::SUB, dl, VTs,
12796 return SDValue(Sub.getNode(), 1);
12798 return DAG.getNode(X86ISD::CMP, dl, MVT::i32, Op0, Op1);
12801 /// Convert a comparison if required by the subtarget.
12802 SDValue X86TargetLowering::ConvertCmpIfNecessary(SDValue Cmp,
12803 SelectionDAG &DAG) const {
12804 // If the subtarget does not support the FUCOMI instruction, floating-point
12805 // comparisons have to be converted.
12806 if (Subtarget->hasCMov() ||
12807 Cmp.getOpcode() != X86ISD::CMP ||
12808 !Cmp.getOperand(0).getValueType().isFloatingPoint() ||
12809 !Cmp.getOperand(1).getValueType().isFloatingPoint())
12812 // The instruction selector will select an FUCOM instruction instead of
12813 // FUCOMI, which writes the comparison result to FPSW instead of EFLAGS. Hence
12814 // build an SDNode sequence that transfers the result from FPSW into EFLAGS:
12815 // (X86sahf (trunc (srl (X86fp_stsw (trunc (X86cmp ...)), 8))))
12817 SDValue TruncFPSW = DAG.getNode(ISD::TRUNCATE, dl, MVT::i16, Cmp);
12818 SDValue FNStSW = DAG.getNode(X86ISD::FNSTSW16r, dl, MVT::i16, TruncFPSW);
12819 SDValue Srl = DAG.getNode(ISD::SRL, dl, MVT::i16, FNStSW,
12820 DAG.getConstant(8, MVT::i8));
12821 SDValue TruncSrl = DAG.getNode(ISD::TRUNCATE, dl, MVT::i8, Srl);
12822 return DAG.getNode(X86ISD::SAHF, dl, MVT::i32, TruncSrl);
12825 static bool isAllOnes(SDValue V) {
12826 ConstantSDNode *C = dyn_cast<ConstantSDNode>(V);
12827 return C && C->isAllOnesValue();
12830 /// LowerToBT - Result of 'and' is compared against zero. Turn it into a BT node
12831 /// if it's possible.
12832 SDValue X86TargetLowering::LowerToBT(SDValue And, ISD::CondCode CC,
12833 SDLoc dl, SelectionDAG &DAG) const {
12834 SDValue Op0 = And.getOperand(0);
12835 SDValue Op1 = And.getOperand(1);
12836 if (Op0.getOpcode() == ISD::TRUNCATE)
12837 Op0 = Op0.getOperand(0);
12838 if (Op1.getOpcode() == ISD::TRUNCATE)
12839 Op1 = Op1.getOperand(0);
12842 if (Op1.getOpcode() == ISD::SHL)
12843 std::swap(Op0, Op1);
12844 if (Op0.getOpcode() == ISD::SHL) {
12845 if (ConstantSDNode *And00C = dyn_cast<ConstantSDNode>(Op0.getOperand(0)))
12846 if (And00C->getZExtValue() == 1) {
12847 // If we looked past a truncate, check that it's only truncating away
12849 unsigned BitWidth = Op0.getValueSizeInBits();
12850 unsigned AndBitWidth = And.getValueSizeInBits();
12851 if (BitWidth > AndBitWidth) {
12853 DAG.computeKnownBits(Op0, Zeros, Ones);
12854 if (Zeros.countLeadingOnes() < BitWidth - AndBitWidth)
12858 RHS = Op0.getOperand(1);
12860 } else if (Op1.getOpcode() == ISD::Constant) {
12861 ConstantSDNode *AndRHS = cast<ConstantSDNode>(Op1);
12862 uint64_t AndRHSVal = AndRHS->getZExtValue();
12863 SDValue AndLHS = Op0;
12865 if (AndRHSVal == 1 && AndLHS.getOpcode() == ISD::SRL) {
12866 LHS = AndLHS.getOperand(0);
12867 RHS = AndLHS.getOperand(1);
12870 // Use BT if the immediate can't be encoded in a TEST instruction.
12871 if (!isUInt<32>(AndRHSVal) && isPowerOf2_64(AndRHSVal)) {
12873 RHS = DAG.getConstant(Log2_64_Ceil(AndRHSVal), LHS.getValueType());
12877 if (LHS.getNode()) {
12878 // If LHS is i8, promote it to i32 with any_extend. There is no i8 BT
12879 // instruction. Since the shift amount is in-range-or-undefined, we know
12880 // that doing a bittest on the i32 value is ok. We extend to i32 because
12881 // the encoding for the i16 version is larger than the i32 version.
12882 // Also promote i16 to i32 for performance / code size reason.
12883 if (LHS.getValueType() == MVT::i8 ||
12884 LHS.getValueType() == MVT::i16)
12885 LHS = DAG.getNode(ISD::ANY_EXTEND, dl, MVT::i32, LHS);
12887 // If the operand types disagree, extend the shift amount to match. Since
12888 // BT ignores high bits (like shifts) we can use anyextend.
12889 if (LHS.getValueType() != RHS.getValueType())
12890 RHS = DAG.getNode(ISD::ANY_EXTEND, dl, LHS.getValueType(), RHS);
12892 SDValue BT = DAG.getNode(X86ISD::BT, dl, MVT::i32, LHS, RHS);
12893 X86::CondCode Cond = CC == ISD::SETEQ ? X86::COND_AE : X86::COND_B;
12894 return DAG.getNode(X86ISD::SETCC, dl, MVT::i8,
12895 DAG.getConstant(Cond, MVT::i8), BT);
12901 /// \brief - Turns an ISD::CondCode into a value suitable for SSE floating point
12903 static int translateX86FSETCC(ISD::CondCode SetCCOpcode, SDValue &Op0,
12908 // SSE Condition code mapping:
12917 switch (SetCCOpcode) {
12918 default: llvm_unreachable("Unexpected SETCC condition");
12920 case ISD::SETEQ: SSECC = 0; break;
12922 case ISD::SETGT: Swap = true; // Fallthrough
12924 case ISD::SETOLT: SSECC = 1; break;
12926 case ISD::SETGE: Swap = true; // Fallthrough
12928 case ISD::SETOLE: SSECC = 2; break;
12929 case ISD::SETUO: SSECC = 3; break;
12931 case ISD::SETNE: SSECC = 4; break;
12932 case ISD::SETULE: Swap = true; // Fallthrough
12933 case ISD::SETUGE: SSECC = 5; break;
12934 case ISD::SETULT: Swap = true; // Fallthrough
12935 case ISD::SETUGT: SSECC = 6; break;
12936 case ISD::SETO: SSECC = 7; break;
12938 case ISD::SETONE: SSECC = 8; break;
12941 std::swap(Op0, Op1);
12946 // Lower256IntVSETCC - Break a VSETCC 256-bit integer VSETCC into two new 128
12947 // ones, and then concatenate the result back.
12948 static SDValue Lower256IntVSETCC(SDValue Op, SelectionDAG &DAG) {
12949 MVT VT = Op.getSimpleValueType();
12951 assert(VT.is256BitVector() && Op.getOpcode() == ISD::SETCC &&
12952 "Unsupported value type for operation");
12954 unsigned NumElems = VT.getVectorNumElements();
12956 SDValue CC = Op.getOperand(2);
12958 // Extract the LHS vectors
12959 SDValue LHS = Op.getOperand(0);
12960 SDValue LHS1 = Extract128BitVector(LHS, 0, DAG, dl);
12961 SDValue LHS2 = Extract128BitVector(LHS, NumElems/2, DAG, dl);
12963 // Extract the RHS vectors
12964 SDValue RHS = Op.getOperand(1);
12965 SDValue RHS1 = Extract128BitVector(RHS, 0, DAG, dl);
12966 SDValue RHS2 = Extract128BitVector(RHS, NumElems/2, DAG, dl);
12968 // Issue the operation on the smaller types and concatenate the result back
12969 MVT EltVT = VT.getVectorElementType();
12970 MVT NewVT = MVT::getVectorVT(EltVT, NumElems/2);
12971 return DAG.getNode(ISD::CONCAT_VECTORS, dl, VT,
12972 DAG.getNode(Op.getOpcode(), dl, NewVT, LHS1, RHS1, CC),
12973 DAG.getNode(Op.getOpcode(), dl, NewVT, LHS2, RHS2, CC));
12976 static SDValue LowerIntVSETCC_AVX512(SDValue Op, SelectionDAG &DAG,
12977 const X86Subtarget *Subtarget) {
12978 SDValue Op0 = Op.getOperand(0);
12979 SDValue Op1 = Op.getOperand(1);
12980 SDValue CC = Op.getOperand(2);
12981 MVT VT = Op.getSimpleValueType();
12984 assert(Op0.getValueType().getVectorElementType().getSizeInBits() >= 8 &&
12985 Op.getValueType().getScalarType() == MVT::i1 &&
12986 "Cannot set masked compare for this operation");
12988 ISD::CondCode SetCCOpcode = cast<CondCodeSDNode>(CC)->get();
12990 bool Unsigned = false;
12993 switch (SetCCOpcode) {
12994 default: llvm_unreachable("Unexpected SETCC condition");
12995 case ISD::SETNE: SSECC = 4; break;
12996 case ISD::SETEQ: Opc = X86ISD::PCMPEQM; break;
12997 case ISD::SETUGT: SSECC = 6; Unsigned = true; break;
12998 case ISD::SETLT: Swap = true; //fall-through
12999 case ISD::SETGT: Opc = X86ISD::PCMPGTM; break;
13000 case ISD::SETULT: SSECC = 1; Unsigned = true; break;
13001 case ISD::SETUGE: SSECC = 5; Unsigned = true; break; //NLT
13002 case ISD::SETGE: Swap = true; SSECC = 2; break; // LE + swap
13003 case ISD::SETULE: Unsigned = true; //fall-through
13004 case ISD::SETLE: SSECC = 2; break;
13008 std::swap(Op0, Op1);
13010 return DAG.getNode(Opc, dl, VT, Op0, Op1);
13011 Opc = Unsigned ? X86ISD::CMPMU: X86ISD::CMPM;
13012 return DAG.getNode(Opc, dl, VT, Op0, Op1,
13013 DAG.getConstant(SSECC, MVT::i8));
13016 /// \brief Try to turn a VSETULT into a VSETULE by modifying its second
13017 /// operand \p Op1. If non-trivial (for example because it's not constant)
13018 /// return an empty value.
13019 static SDValue ChangeVSETULTtoVSETULE(SDLoc dl, SDValue Op1, SelectionDAG &DAG)
13021 BuildVectorSDNode *BV = dyn_cast<BuildVectorSDNode>(Op1.getNode());
13025 MVT VT = Op1.getSimpleValueType();
13026 MVT EVT = VT.getVectorElementType();
13027 unsigned n = VT.getVectorNumElements();
13028 SmallVector<SDValue, 8> ULTOp1;
13030 for (unsigned i = 0; i < n; ++i) {
13031 ConstantSDNode *Elt = dyn_cast<ConstantSDNode>(BV->getOperand(i));
13032 if (!Elt || Elt->isOpaque() || Elt->getValueType(0) != EVT)
13035 // Avoid underflow.
13036 APInt Val = Elt->getAPIntValue();
13040 ULTOp1.push_back(DAG.getConstant(Val - 1, EVT));
13043 return DAG.getNode(ISD::BUILD_VECTOR, dl, VT, ULTOp1);
13046 static SDValue LowerVSETCC(SDValue Op, const X86Subtarget *Subtarget,
13047 SelectionDAG &DAG) {
13048 SDValue Op0 = Op.getOperand(0);
13049 SDValue Op1 = Op.getOperand(1);
13050 SDValue CC = Op.getOperand(2);
13051 MVT VT = Op.getSimpleValueType();
13052 ISD::CondCode SetCCOpcode = cast<CondCodeSDNode>(CC)->get();
13053 bool isFP = Op.getOperand(1).getSimpleValueType().isFloatingPoint();
13058 MVT EltVT = Op0.getSimpleValueType().getVectorElementType();
13059 assert(EltVT == MVT::f32 || EltVT == MVT::f64);
13062 unsigned SSECC = translateX86FSETCC(SetCCOpcode, Op0, Op1);
13063 unsigned Opc = X86ISD::CMPP;
13064 if (Subtarget->hasAVX512() && VT.getVectorElementType() == MVT::i1) {
13065 assert(VT.getVectorNumElements() <= 16);
13066 Opc = X86ISD::CMPM;
13068 // In the two special cases we can't handle, emit two comparisons.
13071 unsigned CombineOpc;
13072 if (SetCCOpcode == ISD::SETUEQ) {
13073 CC0 = 3; CC1 = 0; CombineOpc = ISD::OR;
13075 assert(SetCCOpcode == ISD::SETONE);
13076 CC0 = 7; CC1 = 4; CombineOpc = ISD::AND;
13079 SDValue Cmp0 = DAG.getNode(Opc, dl, VT, Op0, Op1,
13080 DAG.getConstant(CC0, MVT::i8));
13081 SDValue Cmp1 = DAG.getNode(Opc, dl, VT, Op0, Op1,
13082 DAG.getConstant(CC1, MVT::i8));
13083 return DAG.getNode(CombineOpc, dl, VT, Cmp0, Cmp1);
13085 // Handle all other FP comparisons here.
13086 return DAG.getNode(Opc, dl, VT, Op0, Op1,
13087 DAG.getConstant(SSECC, MVT::i8));
13090 // Break 256-bit integer vector compare into smaller ones.
13091 if (VT.is256BitVector() && !Subtarget->hasInt256())
13092 return Lower256IntVSETCC(Op, DAG);
13094 bool MaskResult = (VT.getVectorElementType() == MVT::i1);
13095 EVT OpVT = Op1.getValueType();
13096 if (Subtarget->hasAVX512()) {
13097 if (Op1.getValueType().is512BitVector() ||
13098 (Subtarget->hasBWI() && Subtarget->hasVLX()) ||
13099 (MaskResult && OpVT.getVectorElementType().getSizeInBits() >= 32))
13100 return LowerIntVSETCC_AVX512(Op, DAG, Subtarget);
13102 // In AVX-512 architecture setcc returns mask with i1 elements,
13103 // But there is no compare instruction for i8 and i16 elements in KNL.
13104 // We are not talking about 512-bit operands in this case, these
13105 // types are illegal.
13107 (OpVT.getVectorElementType().getSizeInBits() < 32 &&
13108 OpVT.getVectorElementType().getSizeInBits() >= 8))
13109 return DAG.getNode(ISD::TRUNCATE, dl, VT,
13110 DAG.getNode(ISD::SETCC, dl, OpVT, Op0, Op1, CC));
13113 // We are handling one of the integer comparisons here. Since SSE only has
13114 // GT and EQ comparisons for integer, swapping operands and multiple
13115 // operations may be required for some comparisons.
13117 bool Swap = false, Invert = false, FlipSigns = false, MinMax = false;
13118 bool Subus = false;
13120 switch (SetCCOpcode) {
13121 default: llvm_unreachable("Unexpected SETCC condition");
13122 case ISD::SETNE: Invert = true;
13123 case ISD::SETEQ: Opc = X86ISD::PCMPEQ; break;
13124 case ISD::SETLT: Swap = true;
13125 case ISD::SETGT: Opc = X86ISD::PCMPGT; break;
13126 case ISD::SETGE: Swap = true;
13127 case ISD::SETLE: Opc = X86ISD::PCMPGT;
13128 Invert = true; break;
13129 case ISD::SETULT: Swap = true;
13130 case ISD::SETUGT: Opc = X86ISD::PCMPGT;
13131 FlipSigns = true; break;
13132 case ISD::SETUGE: Swap = true;
13133 case ISD::SETULE: Opc = X86ISD::PCMPGT;
13134 FlipSigns = true; Invert = true; break;
13137 // Special case: Use min/max operations for SETULE/SETUGE
13138 MVT VET = VT.getVectorElementType();
13140 (Subtarget->hasSSE41() && (VET >= MVT::i8 && VET <= MVT::i32))
13141 || (Subtarget->hasSSE2() && (VET == MVT::i8));
13144 switch (SetCCOpcode) {
13146 case ISD::SETULE: Opc = X86ISD::UMIN; MinMax = true; break;
13147 case ISD::SETUGE: Opc = X86ISD::UMAX; MinMax = true; break;
13150 if (MinMax) { Swap = false; Invert = false; FlipSigns = false; }
13153 bool hasSubus = Subtarget->hasSSE2() && (VET == MVT::i8 || VET == MVT::i16);
13154 if (!MinMax && hasSubus) {
13155 // As another special case, use PSUBUS[BW] when it's profitable. E.g. for
13157 // t = psubus Op0, Op1
13158 // pcmpeq t, <0..0>
13159 switch (SetCCOpcode) {
13161 case ISD::SETULT: {
13162 // If the comparison is against a constant we can turn this into a
13163 // setule. With psubus, setule does not require a swap. This is
13164 // beneficial because the constant in the register is no longer
13165 // destructed as the destination so it can be hoisted out of a loop.
13166 // Only do this pre-AVX since vpcmp* is no longer destructive.
13167 if (Subtarget->hasAVX())
13169 SDValue ULEOp1 = ChangeVSETULTtoVSETULE(dl, Op1, DAG);
13170 if (ULEOp1.getNode()) {
13172 Subus = true; Invert = false; Swap = false;
13176 // Psubus is better than flip-sign because it requires no inversion.
13177 case ISD::SETUGE: Subus = true; Invert = false; Swap = true; break;
13178 case ISD::SETULE: Subus = true; Invert = false; Swap = false; break;
13182 Opc = X86ISD::SUBUS;
13188 std::swap(Op0, Op1);
13190 // Check that the operation in question is available (most are plain SSE2,
13191 // but PCMPGTQ and PCMPEQQ have different requirements).
13192 if (VT == MVT::v2i64) {
13193 if (Opc == X86ISD::PCMPGT && !Subtarget->hasSSE42()) {
13194 assert(Subtarget->hasSSE2() && "Don't know how to lower!");
13196 // First cast everything to the right type.
13197 Op0 = DAG.getNode(ISD::BITCAST, dl, MVT::v4i32, Op0);
13198 Op1 = DAG.getNode(ISD::BITCAST, dl, MVT::v4i32, Op1);
13200 // Since SSE has no unsigned integer comparisons, we need to flip the sign
13201 // bits of the inputs before performing those operations. The lower
13202 // compare is always unsigned.
13205 SB = DAG.getConstant(0x80000000U, MVT::v4i32);
13207 SDValue Sign = DAG.getConstant(0x80000000U, MVT::i32);
13208 SDValue Zero = DAG.getConstant(0x00000000U, MVT::i32);
13209 SB = DAG.getNode(ISD::BUILD_VECTOR, dl, MVT::v4i32,
13210 Sign, Zero, Sign, Zero);
13212 Op0 = DAG.getNode(ISD::XOR, dl, MVT::v4i32, Op0, SB);
13213 Op1 = DAG.getNode(ISD::XOR, dl, MVT::v4i32, Op1, SB);
13215 // Emulate PCMPGTQ with (hi1 > hi2) | ((hi1 == hi2) & (lo1 > lo2))
13216 SDValue GT = DAG.getNode(X86ISD::PCMPGT, dl, MVT::v4i32, Op0, Op1);
13217 SDValue EQ = DAG.getNode(X86ISD::PCMPEQ, dl, MVT::v4i32, Op0, Op1);
13219 // Create masks for only the low parts/high parts of the 64 bit integers.
13220 static const int MaskHi[] = { 1, 1, 3, 3 };
13221 static const int MaskLo[] = { 0, 0, 2, 2 };
13222 SDValue EQHi = DAG.getVectorShuffle(MVT::v4i32, dl, EQ, EQ, MaskHi);
13223 SDValue GTLo = DAG.getVectorShuffle(MVT::v4i32, dl, GT, GT, MaskLo);
13224 SDValue GTHi = DAG.getVectorShuffle(MVT::v4i32, dl, GT, GT, MaskHi);
13226 SDValue Result = DAG.getNode(ISD::AND, dl, MVT::v4i32, EQHi, GTLo);
13227 Result = DAG.getNode(ISD::OR, dl, MVT::v4i32, Result, GTHi);
13230 Result = DAG.getNOT(dl, Result, MVT::v4i32);
13232 return DAG.getNode(ISD::BITCAST, dl, VT, Result);
13235 if (Opc == X86ISD::PCMPEQ && !Subtarget->hasSSE41()) {
13236 // If pcmpeqq is missing but pcmpeqd is available synthesize pcmpeqq with
13237 // pcmpeqd + pshufd + pand.
13238 assert(Subtarget->hasSSE2() && !FlipSigns && "Don't know how to lower!");
13240 // First cast everything to the right type.
13241 Op0 = DAG.getNode(ISD::BITCAST, dl, MVT::v4i32, Op0);
13242 Op1 = DAG.getNode(ISD::BITCAST, dl, MVT::v4i32, Op1);
13245 SDValue Result = DAG.getNode(Opc, dl, MVT::v4i32, Op0, Op1);
13247 // Make sure the lower and upper halves are both all-ones.
13248 static const int Mask[] = { 1, 0, 3, 2 };
13249 SDValue Shuf = DAG.getVectorShuffle(MVT::v4i32, dl, Result, Result, Mask);
13250 Result = DAG.getNode(ISD::AND, dl, MVT::v4i32, Result, Shuf);
13253 Result = DAG.getNOT(dl, Result, MVT::v4i32);
13255 return DAG.getNode(ISD::BITCAST, dl, VT, Result);
13259 // Since SSE has no unsigned integer comparisons, we need to flip the sign
13260 // bits of the inputs before performing those operations.
13262 EVT EltVT = VT.getVectorElementType();
13263 SDValue SB = DAG.getConstant(APInt::getSignBit(EltVT.getSizeInBits()), VT);
13264 Op0 = DAG.getNode(ISD::XOR, dl, VT, Op0, SB);
13265 Op1 = DAG.getNode(ISD::XOR, dl, VT, Op1, SB);
13268 SDValue Result = DAG.getNode(Opc, dl, VT, Op0, Op1);
13270 // If the logical-not of the result is required, perform that now.
13272 Result = DAG.getNOT(dl, Result, VT);
13275 Result = DAG.getNode(X86ISD::PCMPEQ, dl, VT, Op0, Result);
13278 Result = DAG.getNode(X86ISD::PCMPEQ, dl, VT, Result,
13279 getZeroVector(VT, Subtarget, DAG, dl));
13284 SDValue X86TargetLowering::LowerSETCC(SDValue Op, SelectionDAG &DAG) const {
13286 MVT VT = Op.getSimpleValueType();
13288 if (VT.isVector()) return LowerVSETCC(Op, Subtarget, DAG);
13290 assert(((!Subtarget->hasAVX512() && VT == MVT::i8) || (VT == MVT::i1))
13291 && "SetCC type must be 8-bit or 1-bit integer");
13292 SDValue Op0 = Op.getOperand(0);
13293 SDValue Op1 = Op.getOperand(1);
13295 ISD::CondCode CC = cast<CondCodeSDNode>(Op.getOperand(2))->get();
13297 // Optimize to BT if possible.
13298 // Lower (X & (1 << N)) == 0 to BT(X, N).
13299 // Lower ((X >>u N) & 1) != 0 to BT(X, N).
13300 // Lower ((X >>s N) & 1) != 0 to BT(X, N).
13301 if (Op0.getOpcode() == ISD::AND && Op0.hasOneUse() &&
13302 Op1.getOpcode() == ISD::Constant &&
13303 cast<ConstantSDNode>(Op1)->isNullValue() &&
13304 (CC == ISD::SETEQ || CC == ISD::SETNE)) {
13305 SDValue NewSetCC = LowerToBT(Op0, CC, dl, DAG);
13306 if (NewSetCC.getNode())
13310 // Look for X == 0, X == 1, X != 0, or X != 1. We can simplify some forms of
13312 if (Op1.getOpcode() == ISD::Constant &&
13313 (cast<ConstantSDNode>(Op1)->getZExtValue() == 1 ||
13314 cast<ConstantSDNode>(Op1)->isNullValue()) &&
13315 (CC == ISD::SETEQ || CC == ISD::SETNE)) {
13317 // If the input is a setcc, then reuse the input setcc or use a new one with
13318 // the inverted condition.
13319 if (Op0.getOpcode() == X86ISD::SETCC) {
13320 X86::CondCode CCode = (X86::CondCode)Op0.getConstantOperandVal(0);
13321 bool Invert = (CC == ISD::SETNE) ^
13322 cast<ConstantSDNode>(Op1)->isNullValue();
13326 CCode = X86::GetOppositeBranchCondition(CCode);
13327 SDValue SetCC = DAG.getNode(X86ISD::SETCC, dl, MVT::i8,
13328 DAG.getConstant(CCode, MVT::i8),
13329 Op0.getOperand(1));
13331 return DAG.getNode(ISD::TRUNCATE, dl, MVT::i1, SetCC);
13335 if ((Op0.getValueType() == MVT::i1) && (Op1.getOpcode() == ISD::Constant) &&
13336 (cast<ConstantSDNode>(Op1)->getZExtValue() == 1) &&
13337 (CC == ISD::SETEQ || CC == ISD::SETNE)) {
13339 ISD::CondCode NewCC = ISD::getSetCCInverse(CC, true);
13340 return DAG.getSetCC(dl, VT, Op0, DAG.getConstant(0, MVT::i1), NewCC);
13343 bool isFP = Op1.getSimpleValueType().isFloatingPoint();
13344 unsigned X86CC = TranslateX86CC(CC, isFP, Op0, Op1, DAG);
13345 if (X86CC == X86::COND_INVALID)
13348 SDValue EFLAGS = EmitCmp(Op0, Op1, X86CC, dl, DAG);
13349 EFLAGS = ConvertCmpIfNecessary(EFLAGS, DAG);
13350 SDValue SetCC = DAG.getNode(X86ISD::SETCC, dl, MVT::i8,
13351 DAG.getConstant(X86CC, MVT::i8), EFLAGS);
13353 return DAG.getNode(ISD::TRUNCATE, dl, MVT::i1, SetCC);
13357 // isX86LogicalCmp - Return true if opcode is a X86 logical comparison.
13358 static bool isX86LogicalCmp(SDValue Op) {
13359 unsigned Opc = Op.getNode()->getOpcode();
13360 if (Opc == X86ISD::CMP || Opc == X86ISD::COMI || Opc == X86ISD::UCOMI ||
13361 Opc == X86ISD::SAHF)
13363 if (Op.getResNo() == 1 &&
13364 (Opc == X86ISD::ADD ||
13365 Opc == X86ISD::SUB ||
13366 Opc == X86ISD::ADC ||
13367 Opc == X86ISD::SBB ||
13368 Opc == X86ISD::SMUL ||
13369 Opc == X86ISD::UMUL ||
13370 Opc == X86ISD::INC ||
13371 Opc == X86ISD::DEC ||
13372 Opc == X86ISD::OR ||
13373 Opc == X86ISD::XOR ||
13374 Opc == X86ISD::AND))
13377 if (Op.getResNo() == 2 && Opc == X86ISD::UMUL)
13383 static bool isTruncWithZeroHighBitsInput(SDValue V, SelectionDAG &DAG) {
13384 if (V.getOpcode() != ISD::TRUNCATE)
13387 SDValue VOp0 = V.getOperand(0);
13388 unsigned InBits = VOp0.getValueSizeInBits();
13389 unsigned Bits = V.getValueSizeInBits();
13390 return DAG.MaskedValueIsZero(VOp0, APInt::getHighBitsSet(InBits,InBits-Bits));
13393 SDValue X86TargetLowering::LowerSELECT(SDValue Op, SelectionDAG &DAG) const {
13394 bool addTest = true;
13395 SDValue Cond = Op.getOperand(0);
13396 SDValue Op1 = Op.getOperand(1);
13397 SDValue Op2 = Op.getOperand(2);
13399 EVT VT = Op1.getValueType();
13402 // Lower fp selects into a CMP/AND/ANDN/OR sequence when the necessary SSE ops
13403 // are available. Otherwise fp cmovs get lowered into a less efficient branch
13404 // sequence later on.
13405 if (Cond.getOpcode() == ISD::SETCC &&
13406 ((Subtarget->hasSSE2() && (VT == MVT::f32 || VT == MVT::f64)) ||
13407 (Subtarget->hasSSE1() && VT == MVT::f32)) &&
13408 VT == Cond.getOperand(0).getValueType() && Cond->hasOneUse()) {
13409 SDValue CondOp0 = Cond.getOperand(0), CondOp1 = Cond.getOperand(1);
13410 int SSECC = translateX86FSETCC(
13411 cast<CondCodeSDNode>(Cond.getOperand(2))->get(), CondOp0, CondOp1);
13414 if (Subtarget->hasAVX512()) {
13415 SDValue Cmp = DAG.getNode(X86ISD::FSETCC, DL, MVT::i1, CondOp0, CondOp1,
13416 DAG.getConstant(SSECC, MVT::i8));
13417 return DAG.getNode(X86ISD::SELECT, DL, VT, Cmp, Op1, Op2);
13419 SDValue Cmp = DAG.getNode(X86ISD::FSETCC, DL, VT, CondOp0, CondOp1,
13420 DAG.getConstant(SSECC, MVT::i8));
13421 SDValue AndN = DAG.getNode(X86ISD::FANDN, DL, VT, Cmp, Op2);
13422 SDValue And = DAG.getNode(X86ISD::FAND, DL, VT, Cmp, Op1);
13423 return DAG.getNode(X86ISD::FOR, DL, VT, AndN, And);
13427 if (Cond.getOpcode() == ISD::SETCC) {
13428 SDValue NewCond = LowerSETCC(Cond, DAG);
13429 if (NewCond.getNode())
13433 // (select (x == 0), -1, y) -> (sign_bit (x - 1)) | y
13434 // (select (x == 0), y, -1) -> ~(sign_bit (x - 1)) | y
13435 // (select (x != 0), y, -1) -> (sign_bit (x - 1)) | y
13436 // (select (x != 0), -1, y) -> ~(sign_bit (x - 1)) | y
13437 if (Cond.getOpcode() == X86ISD::SETCC &&
13438 Cond.getOperand(1).getOpcode() == X86ISD::CMP &&
13439 isZero(Cond.getOperand(1).getOperand(1))) {
13440 SDValue Cmp = Cond.getOperand(1);
13442 unsigned CondCode =cast<ConstantSDNode>(Cond.getOperand(0))->getZExtValue();
13444 if ((isAllOnes(Op1) || isAllOnes(Op2)) &&
13445 (CondCode == X86::COND_E || CondCode == X86::COND_NE)) {
13446 SDValue Y = isAllOnes(Op2) ? Op1 : Op2;
13448 SDValue CmpOp0 = Cmp.getOperand(0);
13449 // Apply further optimizations for special cases
13450 // (select (x != 0), -1, 0) -> neg & sbb
13451 // (select (x == 0), 0, -1) -> neg & sbb
13452 if (ConstantSDNode *YC = dyn_cast<ConstantSDNode>(Y))
13453 if (YC->isNullValue() &&
13454 (isAllOnes(Op1) == (CondCode == X86::COND_NE))) {
13455 SDVTList VTs = DAG.getVTList(CmpOp0.getValueType(), MVT::i32);
13456 SDValue Neg = DAG.getNode(X86ISD::SUB, DL, VTs,
13457 DAG.getConstant(0, CmpOp0.getValueType()),
13459 SDValue Res = DAG.getNode(X86ISD::SETCC_CARRY, DL, Op.getValueType(),
13460 DAG.getConstant(X86::COND_B, MVT::i8),
13461 SDValue(Neg.getNode(), 1));
13465 Cmp = DAG.getNode(X86ISD::CMP, DL, MVT::i32,
13466 CmpOp0, DAG.getConstant(1, CmpOp0.getValueType()));
13467 Cmp = ConvertCmpIfNecessary(Cmp, DAG);
13469 SDValue Res = // Res = 0 or -1.
13470 DAG.getNode(X86ISD::SETCC_CARRY, DL, Op.getValueType(),
13471 DAG.getConstant(X86::COND_B, MVT::i8), Cmp);
13473 if (isAllOnes(Op1) != (CondCode == X86::COND_E))
13474 Res = DAG.getNOT(DL, Res, Res.getValueType());
13476 ConstantSDNode *N2C = dyn_cast<ConstantSDNode>(Op2);
13477 if (!N2C || !N2C->isNullValue())
13478 Res = DAG.getNode(ISD::OR, DL, Res.getValueType(), Res, Y);
13483 // Look past (and (setcc_carry (cmp ...)), 1).
13484 if (Cond.getOpcode() == ISD::AND &&
13485 Cond.getOperand(0).getOpcode() == X86ISD::SETCC_CARRY) {
13486 ConstantSDNode *C = dyn_cast<ConstantSDNode>(Cond.getOperand(1));
13487 if (C && C->getAPIntValue() == 1)
13488 Cond = Cond.getOperand(0);
13491 // If condition flag is set by a X86ISD::CMP, then use it as the condition
13492 // setting operand in place of the X86ISD::SETCC.
13493 unsigned CondOpcode = Cond.getOpcode();
13494 if (CondOpcode == X86ISD::SETCC ||
13495 CondOpcode == X86ISD::SETCC_CARRY) {
13496 CC = Cond.getOperand(0);
13498 SDValue Cmp = Cond.getOperand(1);
13499 unsigned Opc = Cmp.getOpcode();
13500 MVT VT = Op.getSimpleValueType();
13502 bool IllegalFPCMov = false;
13503 if (VT.isFloatingPoint() && !VT.isVector() &&
13504 !isScalarFPTypeInSSEReg(VT)) // FPStack?
13505 IllegalFPCMov = !hasFPCMov(cast<ConstantSDNode>(CC)->getSExtValue());
13507 if ((isX86LogicalCmp(Cmp) && !IllegalFPCMov) ||
13508 Opc == X86ISD::BT) { // FIXME
13512 } else if (CondOpcode == ISD::USUBO || CondOpcode == ISD::SSUBO ||
13513 CondOpcode == ISD::UADDO || CondOpcode == ISD::SADDO ||
13514 ((CondOpcode == ISD::UMULO || CondOpcode == ISD::SMULO) &&
13515 Cond.getOperand(0).getValueType() != MVT::i8)) {
13516 SDValue LHS = Cond.getOperand(0);
13517 SDValue RHS = Cond.getOperand(1);
13518 unsigned X86Opcode;
13521 switch (CondOpcode) {
13522 case ISD::UADDO: X86Opcode = X86ISD::ADD; X86Cond = X86::COND_B; break;
13523 case ISD::SADDO: X86Opcode = X86ISD::ADD; X86Cond = X86::COND_O; break;
13524 case ISD::USUBO: X86Opcode = X86ISD::SUB; X86Cond = X86::COND_B; break;
13525 case ISD::SSUBO: X86Opcode = X86ISD::SUB; X86Cond = X86::COND_O; break;
13526 case ISD::UMULO: X86Opcode = X86ISD::UMUL; X86Cond = X86::COND_O; break;
13527 case ISD::SMULO: X86Opcode = X86ISD::SMUL; X86Cond = X86::COND_O; break;
13528 default: llvm_unreachable("unexpected overflowing operator");
13530 if (CondOpcode == ISD::UMULO)
13531 VTs = DAG.getVTList(LHS.getValueType(), LHS.getValueType(),
13534 VTs = DAG.getVTList(LHS.getValueType(), MVT::i32);
13536 SDValue X86Op = DAG.getNode(X86Opcode, DL, VTs, LHS, RHS);
13538 if (CondOpcode == ISD::UMULO)
13539 Cond = X86Op.getValue(2);
13541 Cond = X86Op.getValue(1);
13543 CC = DAG.getConstant(X86Cond, MVT::i8);
13548 // Look pass the truncate if the high bits are known zero.
13549 if (isTruncWithZeroHighBitsInput(Cond, DAG))
13550 Cond = Cond.getOperand(0);
13552 // We know the result of AND is compared against zero. Try to match
13554 if (Cond.getOpcode() == ISD::AND && Cond.hasOneUse()) {
13555 SDValue NewSetCC = LowerToBT(Cond, ISD::SETNE, DL, DAG);
13556 if (NewSetCC.getNode()) {
13557 CC = NewSetCC.getOperand(0);
13558 Cond = NewSetCC.getOperand(1);
13565 CC = DAG.getConstant(X86::COND_NE, MVT::i8);
13566 Cond = EmitTest(Cond, X86::COND_NE, DL, DAG);
13569 // a < b ? -1 : 0 -> RES = ~setcc_carry
13570 // a < b ? 0 : -1 -> RES = setcc_carry
13571 // a >= b ? -1 : 0 -> RES = setcc_carry
13572 // a >= b ? 0 : -1 -> RES = ~setcc_carry
13573 if (Cond.getOpcode() == X86ISD::SUB) {
13574 Cond = ConvertCmpIfNecessary(Cond, DAG);
13575 unsigned CondCode = cast<ConstantSDNode>(CC)->getZExtValue();
13577 if ((CondCode == X86::COND_AE || CondCode == X86::COND_B) &&
13578 (isAllOnes(Op1) || isAllOnes(Op2)) && (isZero(Op1) || isZero(Op2))) {
13579 SDValue Res = DAG.getNode(X86ISD::SETCC_CARRY, DL, Op.getValueType(),
13580 DAG.getConstant(X86::COND_B, MVT::i8), Cond);
13581 if (isAllOnes(Op1) != (CondCode == X86::COND_B))
13582 return DAG.getNOT(DL, Res, Res.getValueType());
13587 // X86 doesn't have an i8 cmov. If both operands are the result of a truncate
13588 // widen the cmov and push the truncate through. This avoids introducing a new
13589 // branch during isel and doesn't add any extensions.
13590 if (Op.getValueType() == MVT::i8 &&
13591 Op1.getOpcode() == ISD::TRUNCATE && Op2.getOpcode() == ISD::TRUNCATE) {
13592 SDValue T1 = Op1.getOperand(0), T2 = Op2.getOperand(0);
13593 if (T1.getValueType() == T2.getValueType() &&
13594 // Blacklist CopyFromReg to avoid partial register stalls.
13595 T1.getOpcode() != ISD::CopyFromReg && T2.getOpcode()!=ISD::CopyFromReg){
13596 SDVTList VTs = DAG.getVTList(T1.getValueType(), MVT::Glue);
13597 SDValue Cmov = DAG.getNode(X86ISD::CMOV, DL, VTs, T2, T1, CC, Cond);
13598 return DAG.getNode(ISD::TRUNCATE, DL, Op.getValueType(), Cmov);
13602 // X86ISD::CMOV means set the result (which is operand 1) to the RHS if
13603 // condition is true.
13604 SDVTList VTs = DAG.getVTList(Op.getValueType(), MVT::Glue);
13605 SDValue Ops[] = { Op2, Op1, CC, Cond };
13606 return DAG.getNode(X86ISD::CMOV, DL, VTs, Ops);
13609 static SDValue LowerSIGN_EXTEND_AVX512(SDValue Op, SelectionDAG &DAG) {
13610 MVT VT = Op->getSimpleValueType(0);
13611 SDValue In = Op->getOperand(0);
13612 MVT InVT = In.getSimpleValueType();
13615 unsigned int NumElts = VT.getVectorNumElements();
13616 if (NumElts != 8 && NumElts != 16)
13619 if (VT.is512BitVector() && InVT.getVectorElementType() != MVT::i1)
13620 return DAG.getNode(X86ISD::VSEXT, dl, VT, In);
13622 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
13623 assert (InVT.getVectorElementType() == MVT::i1 && "Unexpected vector type");
13625 MVT ExtVT = (NumElts == 8) ? MVT::v8i64 : MVT::v16i32;
13626 Constant *C = ConstantInt::get(*DAG.getContext(),
13627 APInt::getAllOnesValue(ExtVT.getScalarType().getSizeInBits()));
13629 SDValue CP = DAG.getConstantPool(C, TLI.getPointerTy());
13630 unsigned Alignment = cast<ConstantPoolSDNode>(CP)->getAlignment();
13631 SDValue Ld = DAG.getLoad(ExtVT.getScalarType(), dl, DAG.getEntryNode(), CP,
13632 MachinePointerInfo::getConstantPool(),
13633 false, false, false, Alignment);
13634 SDValue Brcst = DAG.getNode(X86ISD::VBROADCASTM, dl, ExtVT, In, Ld);
13635 if (VT.is512BitVector())
13637 return DAG.getNode(X86ISD::VTRUNC, dl, VT, Brcst);
13640 static SDValue LowerSIGN_EXTEND(SDValue Op, const X86Subtarget *Subtarget,
13641 SelectionDAG &DAG) {
13642 MVT VT = Op->getSimpleValueType(0);
13643 SDValue In = Op->getOperand(0);
13644 MVT InVT = In.getSimpleValueType();
13647 if (VT.is512BitVector() || InVT.getVectorElementType() == MVT::i1)
13648 return LowerSIGN_EXTEND_AVX512(Op, DAG);
13650 if ((VT != MVT::v4i64 || InVT != MVT::v4i32) &&
13651 (VT != MVT::v8i32 || InVT != MVT::v8i16) &&
13652 (VT != MVT::v16i16 || InVT != MVT::v16i8))
13655 if (Subtarget->hasInt256())
13656 return DAG.getNode(X86ISD::VSEXT, dl, VT, In);
13658 // Optimize vectors in AVX mode
13659 // Sign extend v8i16 to v8i32 and
13662 // Divide input vector into two parts
13663 // for v4i32 the shuffle mask will be { 0, 1, -1, -1} {2, 3, -1, -1}
13664 // use vpmovsx instruction to extend v4i32 -> v2i64; v8i16 -> v4i32
13665 // concat the vectors to original VT
13667 unsigned NumElems = InVT.getVectorNumElements();
13668 SDValue Undef = DAG.getUNDEF(InVT);
13670 SmallVector<int,8> ShufMask1(NumElems, -1);
13671 for (unsigned i = 0; i != NumElems/2; ++i)
13674 SDValue OpLo = DAG.getVectorShuffle(InVT, dl, In, Undef, &ShufMask1[0]);
13676 SmallVector<int,8> ShufMask2(NumElems, -1);
13677 for (unsigned i = 0; i != NumElems/2; ++i)
13678 ShufMask2[i] = i + NumElems/2;
13680 SDValue OpHi = DAG.getVectorShuffle(InVT, dl, In, Undef, &ShufMask2[0]);
13682 MVT HalfVT = MVT::getVectorVT(VT.getScalarType(),
13683 VT.getVectorNumElements()/2);
13685 OpLo = DAG.getNode(X86ISD::VSEXT, dl, HalfVT, OpLo);
13686 OpHi = DAG.getNode(X86ISD::VSEXT, dl, HalfVT, OpHi);
13688 return DAG.getNode(ISD::CONCAT_VECTORS, dl, VT, OpLo, OpHi);
13691 // Lower vector extended loads using a shuffle. If SSSE3 is not available we
13692 // may emit an illegal shuffle but the expansion is still better than scalar
13693 // code. We generate X86ISD::VSEXT for SEXTLOADs if it's available, otherwise
13694 // we'll emit a shuffle and a arithmetic shift.
13695 // TODO: It is possible to support ZExt by zeroing the undef values during
13696 // the shuffle phase or after the shuffle.
13697 static SDValue LowerExtendedLoad(SDValue Op, const X86Subtarget *Subtarget,
13698 SelectionDAG &DAG) {
13699 MVT RegVT = Op.getSimpleValueType();
13700 assert(RegVT.isVector() && "We only custom lower vector sext loads.");
13701 assert(RegVT.isInteger() &&
13702 "We only custom lower integer vector sext loads.");
13704 // Nothing useful we can do without SSE2 shuffles.
13705 assert(Subtarget->hasSSE2() && "We only custom lower sext loads with SSE2.");
13707 LoadSDNode *Ld = cast<LoadSDNode>(Op.getNode());
13709 EVT MemVT = Ld->getMemoryVT();
13710 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
13711 unsigned RegSz = RegVT.getSizeInBits();
13713 ISD::LoadExtType Ext = Ld->getExtensionType();
13715 assert((Ext == ISD::EXTLOAD || Ext == ISD::SEXTLOAD)
13716 && "Only anyext and sext are currently implemented.");
13717 assert(MemVT != RegVT && "Cannot extend to the same type");
13718 assert(MemVT.isVector() && "Must load a vector from memory");
13720 unsigned NumElems = RegVT.getVectorNumElements();
13721 unsigned MemSz = MemVT.getSizeInBits();
13722 assert(RegSz > MemSz && "Register size must be greater than the mem size");
13724 if (Ext == ISD::SEXTLOAD && RegSz == 256 && !Subtarget->hasInt256()) {
13725 // The only way in which we have a legal 256-bit vector result but not the
13726 // integer 256-bit operations needed to directly lower a sextload is if we
13727 // have AVX1 but not AVX2. In that case, we can always emit a sextload to
13728 // a 128-bit vector and a normal sign_extend to 256-bits that should get
13729 // correctly legalized. We do this late to allow the canonical form of
13730 // sextload to persist throughout the rest of the DAG combiner -- it wants
13731 // to fold together any extensions it can, and so will fuse a sign_extend
13732 // of an sextload into a sextload targeting a wider value.
13734 if (MemSz == 128) {
13735 // Just switch this to a normal load.
13736 assert(TLI.isTypeLegal(MemVT) && "If the memory type is a 128-bit type, "
13737 "it must be a legal 128-bit vector "
13739 Load = DAG.getLoad(MemVT, dl, Ld->getChain(), Ld->getBasePtr(),
13740 Ld->getPointerInfo(), Ld->isVolatile(), Ld->isNonTemporal(),
13741 Ld->isInvariant(), Ld->getAlignment());
13743 assert(MemSz < 128 &&
13744 "Can't extend a type wider than 128 bits to a 256 bit vector!");
13745 // Do an sext load to a 128-bit vector type. We want to use the same
13746 // number of elements, but elements half as wide. This will end up being
13747 // recursively lowered by this routine, but will succeed as we definitely
13748 // have all the necessary features if we're using AVX1.
13750 EVT::getIntegerVT(*DAG.getContext(), RegVT.getScalarSizeInBits() / 2);
13751 EVT HalfVecVT = EVT::getVectorVT(*DAG.getContext(), HalfEltVT, NumElems);
13753 DAG.getExtLoad(Ext, dl, HalfVecVT, Ld->getChain(), Ld->getBasePtr(),
13754 Ld->getPointerInfo(), MemVT, Ld->isVolatile(),
13755 Ld->isNonTemporal(), Ld->isInvariant(),
13756 Ld->getAlignment());
13759 // Replace chain users with the new chain.
13760 assert(Load->getNumValues() == 2 && "Loads must carry a chain!");
13761 DAG.ReplaceAllUsesOfValueWith(SDValue(Ld, 1), Load.getValue(1));
13763 // Finally, do a normal sign-extend to the desired register.
13764 return DAG.getSExtOrTrunc(Load, dl, RegVT);
13767 // All sizes must be a power of two.
13768 assert(isPowerOf2_32(RegSz * MemSz * NumElems) &&
13769 "Non-power-of-two elements are not custom lowered!");
13771 // Attempt to load the original value using scalar loads.
13772 // Find the largest scalar type that divides the total loaded size.
13773 MVT SclrLoadTy = MVT::i8;
13774 for (unsigned tp = MVT::FIRST_INTEGER_VALUETYPE;
13775 tp < MVT::LAST_INTEGER_VALUETYPE; ++tp) {
13776 MVT Tp = (MVT::SimpleValueType)tp;
13777 if (TLI.isTypeLegal(Tp) && ((MemSz % Tp.getSizeInBits()) == 0)) {
13782 // On 32bit systems, we can't save 64bit integers. Try bitcasting to F64.
13783 if (TLI.isTypeLegal(MVT::f64) && SclrLoadTy.getSizeInBits() < 64 &&
13785 SclrLoadTy = MVT::f64;
13787 // Calculate the number of scalar loads that we need to perform
13788 // in order to load our vector from memory.
13789 unsigned NumLoads = MemSz / SclrLoadTy.getSizeInBits();
13791 assert((Ext != ISD::SEXTLOAD || NumLoads == 1) &&
13792 "Can only lower sext loads with a single scalar load!");
13794 unsigned loadRegZize = RegSz;
13795 if (Ext == ISD::SEXTLOAD && RegSz == 256)
13798 // Represent our vector as a sequence of elements which are the
13799 // largest scalar that we can load.
13800 EVT LoadUnitVecVT = EVT::getVectorVT(
13801 *DAG.getContext(), SclrLoadTy, loadRegZize / SclrLoadTy.getSizeInBits());
13803 // Represent the data using the same element type that is stored in
13804 // memory. In practice, we ''widen'' MemVT.
13806 EVT::getVectorVT(*DAG.getContext(), MemVT.getScalarType(),
13807 loadRegZize / MemVT.getScalarType().getSizeInBits());
13809 assert(WideVecVT.getSizeInBits() == LoadUnitVecVT.getSizeInBits() &&
13810 "Invalid vector type");
13812 // We can't shuffle using an illegal type.
13813 assert(TLI.isTypeLegal(WideVecVT) &&
13814 "We only lower types that form legal widened vector types");
13816 SmallVector<SDValue, 8> Chains;
13817 SDValue Ptr = Ld->getBasePtr();
13818 SDValue Increment =
13819 DAG.getConstant(SclrLoadTy.getSizeInBits() / 8, TLI.getPointerTy());
13820 SDValue Res = DAG.getUNDEF(LoadUnitVecVT);
13822 for (unsigned i = 0; i < NumLoads; ++i) {
13823 // Perform a single load.
13824 SDValue ScalarLoad =
13825 DAG.getLoad(SclrLoadTy, dl, Ld->getChain(), Ptr, Ld->getPointerInfo(),
13826 Ld->isVolatile(), Ld->isNonTemporal(), Ld->isInvariant(),
13827 Ld->getAlignment());
13828 Chains.push_back(ScalarLoad.getValue(1));
13829 // Create the first element type using SCALAR_TO_VECTOR in order to avoid
13830 // another round of DAGCombining.
13832 Res = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, LoadUnitVecVT, ScalarLoad);
13834 Res = DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, LoadUnitVecVT, Res,
13835 ScalarLoad, DAG.getIntPtrConstant(i));
13837 Ptr = DAG.getNode(ISD::ADD, dl, Ptr.getValueType(), Ptr, Increment);
13840 SDValue TF = DAG.getNode(ISD::TokenFactor, dl, MVT::Other, Chains);
13842 // Bitcast the loaded value to a vector of the original element type, in
13843 // the size of the target vector type.
13844 SDValue SlicedVec = DAG.getNode(ISD::BITCAST, dl, WideVecVT, Res);
13845 unsigned SizeRatio = RegSz / MemSz;
13847 if (Ext == ISD::SEXTLOAD) {
13848 // If we have SSE4.1, we can directly emit a VSEXT node.
13849 if (Subtarget->hasSSE41()) {
13850 SDValue Sext = DAG.getNode(X86ISD::VSEXT, dl, RegVT, SlicedVec);
13851 DAG.ReplaceAllUsesOfValueWith(SDValue(Ld, 1), TF);
13855 // Otherwise we'll shuffle the small elements in the high bits of the
13856 // larger type and perform an arithmetic shift. If the shift is not legal
13857 // it's better to scalarize.
13858 assert(TLI.isOperationLegalOrCustom(ISD::SRA, RegVT) &&
13859 "We can't implement a sext load without an arithmetic right shift!");
13861 // Redistribute the loaded elements into the different locations.
13862 SmallVector<int, 16> ShuffleVec(NumElems * SizeRatio, -1);
13863 for (unsigned i = 0; i != NumElems; ++i)
13864 ShuffleVec[i * SizeRatio + SizeRatio - 1] = i;
13866 SDValue Shuff = DAG.getVectorShuffle(
13867 WideVecVT, dl, SlicedVec, DAG.getUNDEF(WideVecVT), &ShuffleVec[0]);
13869 Shuff = DAG.getNode(ISD::BITCAST, dl, RegVT, Shuff);
13871 // Build the arithmetic shift.
13872 unsigned Amt = RegVT.getVectorElementType().getSizeInBits() -
13873 MemVT.getVectorElementType().getSizeInBits();
13875 DAG.getNode(ISD::SRA, dl, RegVT, Shuff, DAG.getConstant(Amt, RegVT));
13877 DAG.ReplaceAllUsesOfValueWith(SDValue(Ld, 1), TF);
13881 // Redistribute the loaded elements into the different locations.
13882 SmallVector<int, 16> ShuffleVec(NumElems * SizeRatio, -1);
13883 for (unsigned i = 0; i != NumElems; ++i)
13884 ShuffleVec[i * SizeRatio] = i;
13886 SDValue Shuff = DAG.getVectorShuffle(WideVecVT, dl, SlicedVec,
13887 DAG.getUNDEF(WideVecVT), &ShuffleVec[0]);
13889 // Bitcast to the requested type.
13890 Shuff = DAG.getNode(ISD::BITCAST, dl, RegVT, Shuff);
13891 DAG.ReplaceAllUsesOfValueWith(SDValue(Ld, 1), TF);
13895 // isAndOrOfSingleUseSetCCs - Return true if node is an ISD::AND or
13896 // ISD::OR of two X86ISD::SETCC nodes each of which has no other use apart
13897 // from the AND / OR.
13898 static bool isAndOrOfSetCCs(SDValue Op, unsigned &Opc) {
13899 Opc = Op.getOpcode();
13900 if (Opc != ISD::OR && Opc != ISD::AND)
13902 return (Op.getOperand(0).getOpcode() == X86ISD::SETCC &&
13903 Op.getOperand(0).hasOneUse() &&
13904 Op.getOperand(1).getOpcode() == X86ISD::SETCC &&
13905 Op.getOperand(1).hasOneUse());
13908 // isXor1OfSetCC - Return true if node is an ISD::XOR of a X86ISD::SETCC and
13909 // 1 and that the SETCC node has a single use.
13910 static bool isXor1OfSetCC(SDValue Op) {
13911 if (Op.getOpcode() != ISD::XOR)
13913 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(Op.getOperand(1));
13914 if (N1C && N1C->getAPIntValue() == 1) {
13915 return Op.getOperand(0).getOpcode() == X86ISD::SETCC &&
13916 Op.getOperand(0).hasOneUse();
13921 SDValue X86TargetLowering::LowerBRCOND(SDValue Op, SelectionDAG &DAG) const {
13922 bool addTest = true;
13923 SDValue Chain = Op.getOperand(0);
13924 SDValue Cond = Op.getOperand(1);
13925 SDValue Dest = Op.getOperand(2);
13928 bool Inverted = false;
13930 if (Cond.getOpcode() == ISD::SETCC) {
13931 // Check for setcc([su]{add,sub,mul}o == 0).
13932 if (cast<CondCodeSDNode>(Cond.getOperand(2))->get() == ISD::SETEQ &&
13933 isa<ConstantSDNode>(Cond.getOperand(1)) &&
13934 cast<ConstantSDNode>(Cond.getOperand(1))->isNullValue() &&
13935 Cond.getOperand(0).getResNo() == 1 &&
13936 (Cond.getOperand(0).getOpcode() == ISD::SADDO ||
13937 Cond.getOperand(0).getOpcode() == ISD::UADDO ||
13938 Cond.getOperand(0).getOpcode() == ISD::SSUBO ||
13939 Cond.getOperand(0).getOpcode() == ISD::USUBO ||
13940 Cond.getOperand(0).getOpcode() == ISD::SMULO ||
13941 Cond.getOperand(0).getOpcode() == ISD::UMULO)) {
13943 Cond = Cond.getOperand(0);
13945 SDValue NewCond = LowerSETCC(Cond, DAG);
13946 if (NewCond.getNode())
13951 // FIXME: LowerXALUO doesn't handle these!!
13952 else if (Cond.getOpcode() == X86ISD::ADD ||
13953 Cond.getOpcode() == X86ISD::SUB ||
13954 Cond.getOpcode() == X86ISD::SMUL ||
13955 Cond.getOpcode() == X86ISD::UMUL)
13956 Cond = LowerXALUO(Cond, DAG);
13959 // Look pass (and (setcc_carry (cmp ...)), 1).
13960 if (Cond.getOpcode() == ISD::AND &&
13961 Cond.getOperand(0).getOpcode() == X86ISD::SETCC_CARRY) {
13962 ConstantSDNode *C = dyn_cast<ConstantSDNode>(Cond.getOperand(1));
13963 if (C && C->getAPIntValue() == 1)
13964 Cond = Cond.getOperand(0);
13967 // If condition flag is set by a X86ISD::CMP, then use it as the condition
13968 // setting operand in place of the X86ISD::SETCC.
13969 unsigned CondOpcode = Cond.getOpcode();
13970 if (CondOpcode == X86ISD::SETCC ||
13971 CondOpcode == X86ISD::SETCC_CARRY) {
13972 CC = Cond.getOperand(0);
13974 SDValue Cmp = Cond.getOperand(1);
13975 unsigned Opc = Cmp.getOpcode();
13976 // FIXME: WHY THE SPECIAL CASING OF LogicalCmp??
13977 if (isX86LogicalCmp(Cmp) || Opc == X86ISD::BT) {
13981 switch (cast<ConstantSDNode>(CC)->getZExtValue()) {
13985 // These can only come from an arithmetic instruction with overflow,
13986 // e.g. SADDO, UADDO.
13987 Cond = Cond.getNode()->getOperand(1);
13993 CondOpcode = Cond.getOpcode();
13994 if (CondOpcode == ISD::UADDO || CondOpcode == ISD::SADDO ||
13995 CondOpcode == ISD::USUBO || CondOpcode == ISD::SSUBO ||
13996 ((CondOpcode == ISD::UMULO || CondOpcode == ISD::SMULO) &&
13997 Cond.getOperand(0).getValueType() != MVT::i8)) {
13998 SDValue LHS = Cond.getOperand(0);
13999 SDValue RHS = Cond.getOperand(1);
14000 unsigned X86Opcode;
14003 // Keep this in sync with LowerXALUO, otherwise we might create redundant
14004 // instructions that can't be removed afterwards (i.e. X86ISD::ADD and
14006 switch (CondOpcode) {
14007 case ISD::UADDO: X86Opcode = X86ISD::ADD; X86Cond = X86::COND_B; break;
14009 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(RHS))
14011 X86Opcode = X86ISD::INC; X86Cond = X86::COND_O;
14014 X86Opcode = X86ISD::ADD; X86Cond = X86::COND_O; break;
14015 case ISD::USUBO: X86Opcode = X86ISD::SUB; X86Cond = X86::COND_B; break;
14017 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(RHS))
14019 X86Opcode = X86ISD::DEC; X86Cond = X86::COND_O;
14022 X86Opcode = X86ISD::SUB; X86Cond = X86::COND_O; break;
14023 case ISD::UMULO: X86Opcode = X86ISD::UMUL; X86Cond = X86::COND_O; break;
14024 case ISD::SMULO: X86Opcode = X86ISD::SMUL; X86Cond = X86::COND_O; break;
14025 default: llvm_unreachable("unexpected overflowing operator");
14028 X86Cond = X86::GetOppositeBranchCondition((X86::CondCode)X86Cond);
14029 if (CondOpcode == ISD::UMULO)
14030 VTs = DAG.getVTList(LHS.getValueType(), LHS.getValueType(),
14033 VTs = DAG.getVTList(LHS.getValueType(), MVT::i32);
14035 SDValue X86Op = DAG.getNode(X86Opcode, dl, VTs, LHS, RHS);
14037 if (CondOpcode == ISD::UMULO)
14038 Cond = X86Op.getValue(2);
14040 Cond = X86Op.getValue(1);
14042 CC = DAG.getConstant(X86Cond, MVT::i8);
14046 if (Cond.hasOneUse() && isAndOrOfSetCCs(Cond, CondOpc)) {
14047 SDValue Cmp = Cond.getOperand(0).getOperand(1);
14048 if (CondOpc == ISD::OR) {
14049 // Also, recognize the pattern generated by an FCMP_UNE. We can emit
14050 // two branches instead of an explicit OR instruction with a
14052 if (Cmp == Cond.getOperand(1).getOperand(1) &&
14053 isX86LogicalCmp(Cmp)) {
14054 CC = Cond.getOperand(0).getOperand(0);
14055 Chain = DAG.getNode(X86ISD::BRCOND, dl, Op.getValueType(),
14056 Chain, Dest, CC, Cmp);
14057 CC = Cond.getOperand(1).getOperand(0);
14061 } else { // ISD::AND
14062 // Also, recognize the pattern generated by an FCMP_OEQ. We can emit
14063 // two branches instead of an explicit AND instruction with a
14064 // separate test. However, we only do this if this block doesn't
14065 // have a fall-through edge, because this requires an explicit
14066 // jmp when the condition is false.
14067 if (Cmp == Cond.getOperand(1).getOperand(1) &&
14068 isX86LogicalCmp(Cmp) &&
14069 Op.getNode()->hasOneUse()) {
14070 X86::CondCode CCode =
14071 (X86::CondCode)Cond.getOperand(0).getConstantOperandVal(0);
14072 CCode = X86::GetOppositeBranchCondition(CCode);
14073 CC = DAG.getConstant(CCode, MVT::i8);
14074 SDNode *User = *Op.getNode()->use_begin();
14075 // Look for an unconditional branch following this conditional branch.
14076 // We need this because we need to reverse the successors in order
14077 // to implement FCMP_OEQ.
14078 if (User->getOpcode() == ISD::BR) {
14079 SDValue FalseBB = User->getOperand(1);
14081 DAG.UpdateNodeOperands(User, User->getOperand(0), Dest);
14082 assert(NewBR == User);
14086 Chain = DAG.getNode(X86ISD::BRCOND, dl, Op.getValueType(),
14087 Chain, Dest, CC, Cmp);
14088 X86::CondCode CCode =
14089 (X86::CondCode)Cond.getOperand(1).getConstantOperandVal(0);
14090 CCode = X86::GetOppositeBranchCondition(CCode);
14091 CC = DAG.getConstant(CCode, MVT::i8);
14097 } else if (Cond.hasOneUse() && isXor1OfSetCC(Cond)) {
14098 // Recognize for xorb (setcc), 1 patterns. The xor inverts the condition.
14099 // It should be transformed during dag combiner except when the condition
14100 // is set by a arithmetics with overflow node.
14101 X86::CondCode CCode =
14102 (X86::CondCode)Cond.getOperand(0).getConstantOperandVal(0);
14103 CCode = X86::GetOppositeBranchCondition(CCode);
14104 CC = DAG.getConstant(CCode, MVT::i8);
14105 Cond = Cond.getOperand(0).getOperand(1);
14107 } else if (Cond.getOpcode() == ISD::SETCC &&
14108 cast<CondCodeSDNode>(Cond.getOperand(2))->get() == ISD::SETOEQ) {
14109 // For FCMP_OEQ, we can emit
14110 // two branches instead of an explicit AND instruction with a
14111 // separate test. However, we only do this if this block doesn't
14112 // have a fall-through edge, because this requires an explicit
14113 // jmp when the condition is false.
14114 if (Op.getNode()->hasOneUse()) {
14115 SDNode *User = *Op.getNode()->use_begin();
14116 // Look for an unconditional branch following this conditional branch.
14117 // We need this because we need to reverse the successors in order
14118 // to implement FCMP_OEQ.
14119 if (User->getOpcode() == ISD::BR) {
14120 SDValue FalseBB = User->getOperand(1);
14122 DAG.UpdateNodeOperands(User, User->getOperand(0), Dest);
14123 assert(NewBR == User);
14127 SDValue Cmp = DAG.getNode(X86ISD::CMP, dl, MVT::i32,
14128 Cond.getOperand(0), Cond.getOperand(1));
14129 Cmp = ConvertCmpIfNecessary(Cmp, DAG);
14130 CC = DAG.getConstant(X86::COND_NE, MVT::i8);
14131 Chain = DAG.getNode(X86ISD::BRCOND, dl, Op.getValueType(),
14132 Chain, Dest, CC, Cmp);
14133 CC = DAG.getConstant(X86::COND_P, MVT::i8);
14138 } else if (Cond.getOpcode() == ISD::SETCC &&
14139 cast<CondCodeSDNode>(Cond.getOperand(2))->get() == ISD::SETUNE) {
14140 // For FCMP_UNE, we can emit
14141 // two branches instead of an explicit AND instruction with a
14142 // separate test. However, we only do this if this block doesn't
14143 // have a fall-through edge, because this requires an explicit
14144 // jmp when the condition is false.
14145 if (Op.getNode()->hasOneUse()) {
14146 SDNode *User = *Op.getNode()->use_begin();
14147 // Look for an unconditional branch following this conditional branch.
14148 // We need this because we need to reverse the successors in order
14149 // to implement FCMP_UNE.
14150 if (User->getOpcode() == ISD::BR) {
14151 SDValue FalseBB = User->getOperand(1);
14153 DAG.UpdateNodeOperands(User, User->getOperand(0), Dest);
14154 assert(NewBR == User);
14157 SDValue Cmp = DAG.getNode(X86ISD::CMP, dl, MVT::i32,
14158 Cond.getOperand(0), Cond.getOperand(1));
14159 Cmp = ConvertCmpIfNecessary(Cmp, DAG);
14160 CC = DAG.getConstant(X86::COND_NE, MVT::i8);
14161 Chain = DAG.getNode(X86ISD::BRCOND, dl, Op.getValueType(),
14162 Chain, Dest, CC, Cmp);
14163 CC = DAG.getConstant(X86::COND_NP, MVT::i8);
14173 // Look pass the truncate if the high bits are known zero.
14174 if (isTruncWithZeroHighBitsInput(Cond, DAG))
14175 Cond = Cond.getOperand(0);
14177 // We know the result of AND is compared against zero. Try to match
14179 if (Cond.getOpcode() == ISD::AND && Cond.hasOneUse()) {
14180 SDValue NewSetCC = LowerToBT(Cond, ISD::SETNE, dl, DAG);
14181 if (NewSetCC.getNode()) {
14182 CC = NewSetCC.getOperand(0);
14183 Cond = NewSetCC.getOperand(1);
14190 X86::CondCode X86Cond = Inverted ? X86::COND_E : X86::COND_NE;
14191 CC = DAG.getConstant(X86Cond, MVT::i8);
14192 Cond = EmitTest(Cond, X86Cond, dl, DAG);
14194 Cond = ConvertCmpIfNecessary(Cond, DAG);
14195 return DAG.getNode(X86ISD::BRCOND, dl, Op.getValueType(),
14196 Chain, Dest, CC, Cond);
14199 // Lower dynamic stack allocation to _alloca call for Cygwin/Mingw targets.
14200 // Calls to _alloca are needed to probe the stack when allocating more than 4k
14201 // bytes in one go. Touching the stack at 4K increments is necessary to ensure
14202 // that the guard pages used by the OS virtual memory manager are allocated in
14203 // correct sequence.
14205 X86TargetLowering::LowerDYNAMIC_STACKALLOC(SDValue Op,
14206 SelectionDAG &DAG) const {
14207 MachineFunction &MF = DAG.getMachineFunction();
14208 bool SplitStack = MF.shouldSplitStack();
14209 bool Lower = (Subtarget->isOSWindows() && !Subtarget->isTargetMacho()) ||
14214 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
14215 SDNode* Node = Op.getNode();
14217 unsigned SPReg = TLI.getStackPointerRegisterToSaveRestore();
14218 assert(SPReg && "Target cannot require DYNAMIC_STACKALLOC expansion and"
14219 " not tell us which reg is the stack pointer!");
14220 EVT VT = Node->getValueType(0);
14221 SDValue Tmp1 = SDValue(Node, 0);
14222 SDValue Tmp2 = SDValue(Node, 1);
14223 SDValue Tmp3 = Node->getOperand(2);
14224 SDValue Chain = Tmp1.getOperand(0);
14226 // Chain the dynamic stack allocation so that it doesn't modify the stack
14227 // pointer when other instructions are using the stack.
14228 Chain = DAG.getCALLSEQ_START(Chain, DAG.getIntPtrConstant(0, true),
14231 SDValue Size = Tmp2.getOperand(1);
14232 SDValue SP = DAG.getCopyFromReg(Chain, dl, SPReg, VT);
14233 Chain = SP.getValue(1);
14234 unsigned Align = cast<ConstantSDNode>(Tmp3)->getZExtValue();
14235 const TargetFrameLowering &TFI = *DAG.getSubtarget().getFrameLowering();
14236 unsigned StackAlign = TFI.getStackAlignment();
14237 Tmp1 = DAG.getNode(ISD::SUB, dl, VT, SP, Size); // Value
14238 if (Align > StackAlign)
14239 Tmp1 = DAG.getNode(ISD::AND, dl, VT, Tmp1,
14240 DAG.getConstant(-(uint64_t)Align, VT));
14241 Chain = DAG.getCopyToReg(Chain, dl, SPReg, Tmp1); // Output chain
14243 Tmp2 = DAG.getCALLSEQ_END(Chain, DAG.getIntPtrConstant(0, true),
14244 DAG.getIntPtrConstant(0, true), SDValue(),
14247 SDValue Ops[2] = { Tmp1, Tmp2 };
14248 return DAG.getMergeValues(Ops, dl);
14252 SDValue Chain = Op.getOperand(0);
14253 SDValue Size = Op.getOperand(1);
14254 unsigned Align = cast<ConstantSDNode>(Op.getOperand(2))->getZExtValue();
14255 EVT VT = Op.getNode()->getValueType(0);
14257 bool Is64Bit = Subtarget->is64Bit();
14258 EVT SPTy = Is64Bit ? MVT::i64 : MVT::i32;
14261 MachineRegisterInfo &MRI = MF.getRegInfo();
14264 // The 64 bit implementation of segmented stacks needs to clobber both r10
14265 // r11. This makes it impossible to use it along with nested parameters.
14266 const Function *F = MF.getFunction();
14268 for (Function::const_arg_iterator I = F->arg_begin(), E = F->arg_end();
14270 if (I->hasNestAttr())
14271 report_fatal_error("Cannot use segmented stacks with functions that "
14272 "have nested arguments.");
14275 const TargetRegisterClass *AddrRegClass =
14276 getRegClassFor(Subtarget->is64Bit() ? MVT::i64:MVT::i32);
14277 unsigned Vreg = MRI.createVirtualRegister(AddrRegClass);
14278 Chain = DAG.getCopyToReg(Chain, dl, Vreg, Size);
14279 SDValue Value = DAG.getNode(X86ISD::SEG_ALLOCA, dl, SPTy, Chain,
14280 DAG.getRegister(Vreg, SPTy));
14281 SDValue Ops1[2] = { Value, Chain };
14282 return DAG.getMergeValues(Ops1, dl);
14285 unsigned Reg = (Subtarget->is64Bit() ? X86::RAX : X86::EAX);
14287 Chain = DAG.getCopyToReg(Chain, dl, Reg, Size, Flag);
14288 Flag = Chain.getValue(1);
14289 SDVTList NodeTys = DAG.getVTList(MVT::Other, MVT::Glue);
14291 Chain = DAG.getNode(X86ISD::WIN_ALLOCA, dl, NodeTys, Chain, Flag);
14293 const X86RegisterInfo *RegInfo = static_cast<const X86RegisterInfo *>(
14294 DAG.getSubtarget().getRegisterInfo());
14295 unsigned SPReg = RegInfo->getStackRegister();
14296 SDValue SP = DAG.getCopyFromReg(Chain, dl, SPReg, SPTy);
14297 Chain = SP.getValue(1);
14300 SP = DAG.getNode(ISD::AND, dl, VT, SP.getValue(0),
14301 DAG.getConstant(-(uint64_t)Align, VT));
14302 Chain = DAG.getCopyToReg(Chain, dl, SPReg, SP);
14305 SDValue Ops1[2] = { SP, Chain };
14306 return DAG.getMergeValues(Ops1, dl);
14310 SDValue X86TargetLowering::LowerVASTART(SDValue Op, SelectionDAG &DAG) const {
14311 MachineFunction &MF = DAG.getMachineFunction();
14312 X86MachineFunctionInfo *FuncInfo = MF.getInfo<X86MachineFunctionInfo>();
14314 const Value *SV = cast<SrcValueSDNode>(Op.getOperand(2))->getValue();
14317 if (!Subtarget->is64Bit() || Subtarget->isTargetWin64()) {
14318 // vastart just stores the address of the VarArgsFrameIndex slot into the
14319 // memory location argument.
14320 SDValue FR = DAG.getFrameIndex(FuncInfo->getVarArgsFrameIndex(),
14322 return DAG.getStore(Op.getOperand(0), DL, FR, Op.getOperand(1),
14323 MachinePointerInfo(SV), false, false, 0);
14327 // gp_offset (0 - 6 * 8)
14328 // fp_offset (48 - 48 + 8 * 16)
14329 // overflow_arg_area (point to parameters coming in memory).
14331 SmallVector<SDValue, 8> MemOps;
14332 SDValue FIN = Op.getOperand(1);
14334 SDValue Store = DAG.getStore(Op.getOperand(0), DL,
14335 DAG.getConstant(FuncInfo->getVarArgsGPOffset(),
14337 FIN, MachinePointerInfo(SV), false, false, 0);
14338 MemOps.push_back(Store);
14341 FIN = DAG.getNode(ISD::ADD, DL, getPointerTy(),
14342 FIN, DAG.getIntPtrConstant(4));
14343 Store = DAG.getStore(Op.getOperand(0), DL,
14344 DAG.getConstant(FuncInfo->getVarArgsFPOffset(),
14346 FIN, MachinePointerInfo(SV, 4), false, false, 0);
14347 MemOps.push_back(Store);
14349 // Store ptr to overflow_arg_area
14350 FIN = DAG.getNode(ISD::ADD, DL, getPointerTy(),
14351 FIN, DAG.getIntPtrConstant(4));
14352 SDValue OVFIN = DAG.getFrameIndex(FuncInfo->getVarArgsFrameIndex(),
14354 Store = DAG.getStore(Op.getOperand(0), DL, OVFIN, FIN,
14355 MachinePointerInfo(SV, 8),
14357 MemOps.push_back(Store);
14359 // Store ptr to reg_save_area.
14360 FIN = DAG.getNode(ISD::ADD, DL, getPointerTy(),
14361 FIN, DAG.getIntPtrConstant(8));
14362 SDValue RSFIN = DAG.getFrameIndex(FuncInfo->getRegSaveFrameIndex(),
14364 Store = DAG.getStore(Op.getOperand(0), DL, RSFIN, FIN,
14365 MachinePointerInfo(SV, 16), false, false, 0);
14366 MemOps.push_back(Store);
14367 return DAG.getNode(ISD::TokenFactor, DL, MVT::Other, MemOps);
14370 SDValue X86TargetLowering::LowerVAARG(SDValue Op, SelectionDAG &DAG) const {
14371 assert(Subtarget->is64Bit() &&
14372 "LowerVAARG only handles 64-bit va_arg!");
14373 assert((Subtarget->isTargetLinux() ||
14374 Subtarget->isTargetDarwin()) &&
14375 "Unhandled target in LowerVAARG");
14376 assert(Op.getNode()->getNumOperands() == 4);
14377 SDValue Chain = Op.getOperand(0);
14378 SDValue SrcPtr = Op.getOperand(1);
14379 const Value *SV = cast<SrcValueSDNode>(Op.getOperand(2))->getValue();
14380 unsigned Align = Op.getConstantOperandVal(3);
14383 EVT ArgVT = Op.getNode()->getValueType(0);
14384 Type *ArgTy = ArgVT.getTypeForEVT(*DAG.getContext());
14385 uint32_t ArgSize = getDataLayout()->getTypeAllocSize(ArgTy);
14388 // Decide which area this value should be read from.
14389 // TODO: Implement the AMD64 ABI in its entirety. This simple
14390 // selection mechanism works only for the basic types.
14391 if (ArgVT == MVT::f80) {
14392 llvm_unreachable("va_arg for f80 not yet implemented");
14393 } else if (ArgVT.isFloatingPoint() && ArgSize <= 16 /*bytes*/) {
14394 ArgMode = 2; // Argument passed in XMM register. Use fp_offset.
14395 } else if (ArgVT.isInteger() && ArgSize <= 32 /*bytes*/) {
14396 ArgMode = 1; // Argument passed in GPR64 register(s). Use gp_offset.
14398 llvm_unreachable("Unhandled argument type in LowerVAARG");
14401 if (ArgMode == 2) {
14402 // Sanity Check: Make sure using fp_offset makes sense.
14403 assert(!DAG.getTarget().Options.UseSoftFloat &&
14404 !(DAG.getMachineFunction()
14405 .getFunction()->getAttributes()
14406 .hasAttribute(AttributeSet::FunctionIndex,
14407 Attribute::NoImplicitFloat)) &&
14408 Subtarget->hasSSE1());
14411 // Insert VAARG_64 node into the DAG
14412 // VAARG_64 returns two values: Variable Argument Address, Chain
14413 SmallVector<SDValue, 11> InstOps;
14414 InstOps.push_back(Chain);
14415 InstOps.push_back(SrcPtr);
14416 InstOps.push_back(DAG.getConstant(ArgSize, MVT::i32));
14417 InstOps.push_back(DAG.getConstant(ArgMode, MVT::i8));
14418 InstOps.push_back(DAG.getConstant(Align, MVT::i32));
14419 SDVTList VTs = DAG.getVTList(getPointerTy(), MVT::Other);
14420 SDValue VAARG = DAG.getMemIntrinsicNode(X86ISD::VAARG_64, dl,
14421 VTs, InstOps, MVT::i64,
14422 MachinePointerInfo(SV),
14424 /*Volatile=*/false,
14426 /*WriteMem=*/true);
14427 Chain = VAARG.getValue(1);
14429 // Load the next argument and return it
14430 return DAG.getLoad(ArgVT, dl,
14433 MachinePointerInfo(),
14434 false, false, false, 0);
14437 static SDValue LowerVACOPY(SDValue Op, const X86Subtarget *Subtarget,
14438 SelectionDAG &DAG) {
14439 // X86-64 va_list is a struct { i32, i32, i8*, i8* }.
14440 assert(Subtarget->is64Bit() && "This code only handles 64-bit va_copy!");
14441 SDValue Chain = Op.getOperand(0);
14442 SDValue DstPtr = Op.getOperand(1);
14443 SDValue SrcPtr = Op.getOperand(2);
14444 const Value *DstSV = cast<SrcValueSDNode>(Op.getOperand(3))->getValue();
14445 const Value *SrcSV = cast<SrcValueSDNode>(Op.getOperand(4))->getValue();
14448 return DAG.getMemcpy(Chain, DL, DstPtr, SrcPtr,
14449 DAG.getIntPtrConstant(24), 8, /*isVolatile*/false,
14451 MachinePointerInfo(DstSV), MachinePointerInfo(SrcSV));
14454 // getTargetVShiftByConstNode - Handle vector element shifts where the shift
14455 // amount is a constant. Takes immediate version of shift as input.
14456 static SDValue getTargetVShiftByConstNode(unsigned Opc, SDLoc dl, MVT VT,
14457 SDValue SrcOp, uint64_t ShiftAmt,
14458 SelectionDAG &DAG) {
14459 MVT ElementType = VT.getVectorElementType();
14461 // Fold this packed shift into its first operand if ShiftAmt is 0.
14465 // Check for ShiftAmt >= element width
14466 if (ShiftAmt >= ElementType.getSizeInBits()) {
14467 if (Opc == X86ISD::VSRAI)
14468 ShiftAmt = ElementType.getSizeInBits() - 1;
14470 return DAG.getConstant(0, VT);
14473 assert((Opc == X86ISD::VSHLI || Opc == X86ISD::VSRLI || Opc == X86ISD::VSRAI)
14474 && "Unknown target vector shift-by-constant node");
14476 // Fold this packed vector shift into a build vector if SrcOp is a
14477 // vector of Constants or UNDEFs, and SrcOp valuetype is the same as VT.
14478 if (VT == SrcOp.getSimpleValueType() &&
14479 ISD::isBuildVectorOfConstantSDNodes(SrcOp.getNode())) {
14480 SmallVector<SDValue, 8> Elts;
14481 unsigned NumElts = SrcOp->getNumOperands();
14482 ConstantSDNode *ND;
14485 default: llvm_unreachable(nullptr);
14486 case X86ISD::VSHLI:
14487 for (unsigned i=0; i!=NumElts; ++i) {
14488 SDValue CurrentOp = SrcOp->getOperand(i);
14489 if (CurrentOp->getOpcode() == ISD::UNDEF) {
14490 Elts.push_back(CurrentOp);
14493 ND = cast<ConstantSDNode>(CurrentOp);
14494 const APInt &C = ND->getAPIntValue();
14495 Elts.push_back(DAG.getConstant(C.shl(ShiftAmt), ElementType));
14498 case X86ISD::VSRLI:
14499 for (unsigned i=0; i!=NumElts; ++i) {
14500 SDValue CurrentOp = SrcOp->getOperand(i);
14501 if (CurrentOp->getOpcode() == ISD::UNDEF) {
14502 Elts.push_back(CurrentOp);
14505 ND = cast<ConstantSDNode>(CurrentOp);
14506 const APInt &C = ND->getAPIntValue();
14507 Elts.push_back(DAG.getConstant(C.lshr(ShiftAmt), ElementType));
14510 case X86ISD::VSRAI:
14511 for (unsigned i=0; i!=NumElts; ++i) {
14512 SDValue CurrentOp = SrcOp->getOperand(i);
14513 if (CurrentOp->getOpcode() == ISD::UNDEF) {
14514 Elts.push_back(CurrentOp);
14517 ND = cast<ConstantSDNode>(CurrentOp);
14518 const APInt &C = ND->getAPIntValue();
14519 Elts.push_back(DAG.getConstant(C.ashr(ShiftAmt), ElementType));
14524 return DAG.getNode(ISD::BUILD_VECTOR, dl, VT, Elts);
14527 return DAG.getNode(Opc, dl, VT, SrcOp, DAG.getConstant(ShiftAmt, MVT::i8));
14530 // getTargetVShiftNode - Handle vector element shifts where the shift amount
14531 // may or may not be a constant. Takes immediate version of shift as input.
14532 static SDValue getTargetVShiftNode(unsigned Opc, SDLoc dl, MVT VT,
14533 SDValue SrcOp, SDValue ShAmt,
14534 SelectionDAG &DAG) {
14535 assert(ShAmt.getValueType() == MVT::i32 && "ShAmt is not i32");
14537 // Catch shift-by-constant.
14538 if (ConstantSDNode *CShAmt = dyn_cast<ConstantSDNode>(ShAmt))
14539 return getTargetVShiftByConstNode(Opc, dl, VT, SrcOp,
14540 CShAmt->getZExtValue(), DAG);
14542 // Change opcode to non-immediate version
14544 default: llvm_unreachable("Unknown target vector shift node");
14545 case X86ISD::VSHLI: Opc = X86ISD::VSHL; break;
14546 case X86ISD::VSRLI: Opc = X86ISD::VSRL; break;
14547 case X86ISD::VSRAI: Opc = X86ISD::VSRA; break;
14550 // Need to build a vector containing shift amount
14551 // Shift amount is 32-bits, but SSE instructions read 64-bit, so fill with 0
14554 ShOps[1] = DAG.getConstant(0, MVT::i32);
14555 ShOps[2] = ShOps[3] = DAG.getUNDEF(MVT::i32);
14556 ShAmt = DAG.getNode(ISD::BUILD_VECTOR, dl, MVT::v4i32, ShOps);
14558 // The return type has to be a 128-bit type with the same element
14559 // type as the input type.
14560 MVT EltVT = VT.getVectorElementType();
14561 EVT ShVT = MVT::getVectorVT(EltVT, 128/EltVT.getSizeInBits());
14563 ShAmt = DAG.getNode(ISD::BITCAST, dl, ShVT, ShAmt);
14564 return DAG.getNode(Opc, dl, VT, SrcOp, ShAmt);
14567 /// \brief Return (vselect \p Mask, \p Op, \p PreservedSrc) along with the
14568 /// necessary casting for \p Mask when lowering masking intrinsics.
14569 static SDValue getVectorMaskingNode(SDValue Op, SDValue Mask,
14570 SDValue PreservedSrc, SelectionDAG &DAG) {
14571 EVT VT = Op.getValueType();
14572 EVT MaskVT = EVT::getVectorVT(*DAG.getContext(),
14573 MVT::i1, VT.getVectorNumElements());
14576 assert(MaskVT.isSimple() && "invalid mask type");
14577 return DAG.getNode(ISD::VSELECT, dl, VT,
14578 DAG.getNode(ISD::BITCAST, dl, MaskVT, Mask),
14582 static unsigned getOpcodeForFMAIntrinsic(unsigned IntNo) {
14584 default: llvm_unreachable("Impossible intrinsic"); // Can't reach here.
14585 case Intrinsic::x86_fma_vfmadd_ps:
14586 case Intrinsic::x86_fma_vfmadd_pd:
14587 case Intrinsic::x86_fma_vfmadd_ps_256:
14588 case Intrinsic::x86_fma_vfmadd_pd_256:
14589 case Intrinsic::x86_fma_mask_vfmadd_ps_512:
14590 case Intrinsic::x86_fma_mask_vfmadd_pd_512:
14591 return X86ISD::FMADD;
14592 case Intrinsic::x86_fma_vfmsub_ps:
14593 case Intrinsic::x86_fma_vfmsub_pd:
14594 case Intrinsic::x86_fma_vfmsub_ps_256:
14595 case Intrinsic::x86_fma_vfmsub_pd_256:
14596 case Intrinsic::x86_fma_mask_vfmsub_ps_512:
14597 case Intrinsic::x86_fma_mask_vfmsub_pd_512:
14598 return X86ISD::FMSUB;
14599 case Intrinsic::x86_fma_vfnmadd_ps:
14600 case Intrinsic::x86_fma_vfnmadd_pd:
14601 case Intrinsic::x86_fma_vfnmadd_ps_256:
14602 case Intrinsic::x86_fma_vfnmadd_pd_256:
14603 case Intrinsic::x86_fma_mask_vfnmadd_ps_512:
14604 case Intrinsic::x86_fma_mask_vfnmadd_pd_512:
14605 return X86ISD::FNMADD;
14606 case Intrinsic::x86_fma_vfnmsub_ps:
14607 case Intrinsic::x86_fma_vfnmsub_pd:
14608 case Intrinsic::x86_fma_vfnmsub_ps_256:
14609 case Intrinsic::x86_fma_vfnmsub_pd_256:
14610 case Intrinsic::x86_fma_mask_vfnmsub_ps_512:
14611 case Intrinsic::x86_fma_mask_vfnmsub_pd_512:
14612 return X86ISD::FNMSUB;
14613 case Intrinsic::x86_fma_vfmaddsub_ps:
14614 case Intrinsic::x86_fma_vfmaddsub_pd:
14615 case Intrinsic::x86_fma_vfmaddsub_ps_256:
14616 case Intrinsic::x86_fma_vfmaddsub_pd_256:
14617 case Intrinsic::x86_fma_mask_vfmaddsub_ps_512:
14618 case Intrinsic::x86_fma_mask_vfmaddsub_pd_512:
14619 return X86ISD::FMADDSUB;
14620 case Intrinsic::x86_fma_vfmsubadd_ps:
14621 case Intrinsic::x86_fma_vfmsubadd_pd:
14622 case Intrinsic::x86_fma_vfmsubadd_ps_256:
14623 case Intrinsic::x86_fma_vfmsubadd_pd_256:
14624 case Intrinsic::x86_fma_mask_vfmsubadd_ps_512:
14625 case Intrinsic::x86_fma_mask_vfmsubadd_pd_512:
14626 return X86ISD::FMSUBADD;
14630 static SDValue LowerINTRINSIC_WO_CHAIN(SDValue Op, SelectionDAG &DAG) {
14632 unsigned IntNo = cast<ConstantSDNode>(Op.getOperand(0))->getZExtValue();
14634 const IntrinsicData* IntrData = GetIntrinsicWithoutChain(IntNo);
14636 switch(IntrData->Type) {
14637 case INTR_TYPE_1OP:
14638 return DAG.getNode(IntrData->Opc0, dl, Op.getValueType(), Op.getOperand(1));
14639 case INTR_TYPE_2OP:
14640 return DAG.getNode(IntrData->Opc0, dl, Op.getValueType(), Op.getOperand(1),
14642 case INTR_TYPE_3OP:
14643 return DAG.getNode(IntrData->Opc0, dl, Op.getValueType(), Op.getOperand(1),
14644 Op.getOperand(2), Op.getOperand(3));
14645 case COMI: { // Comparison intrinsics
14646 ISD::CondCode CC = (ISD::CondCode)IntrData->Opc1;
14647 SDValue LHS = Op.getOperand(1);
14648 SDValue RHS = Op.getOperand(2);
14649 unsigned X86CC = TranslateX86CC(CC, true, LHS, RHS, DAG);
14650 assert(X86CC != X86::COND_INVALID && "Unexpected illegal condition!");
14651 SDValue Cond = DAG.getNode(IntrData->Opc0, dl, MVT::i32, LHS, RHS);
14652 SDValue SetCC = DAG.getNode(X86ISD::SETCC, dl, MVT::i8,
14653 DAG.getConstant(X86CC, MVT::i8), Cond);
14654 return DAG.getNode(ISD::ZERO_EXTEND, dl, MVT::i32, SetCC);
14657 return getTargetVShiftNode(IntrData->Opc0, dl, Op.getSimpleValueType(),
14658 Op.getOperand(1), Op.getOperand(2), DAG);
14665 default: return SDValue(); // Don't custom lower most intrinsics.
14667 // Arithmetic intrinsics.
14668 case Intrinsic::x86_sse2_pmulu_dq:
14669 case Intrinsic::x86_avx2_pmulu_dq:
14670 return DAG.getNode(X86ISD::PMULUDQ, dl, Op.getValueType(),
14671 Op.getOperand(1), Op.getOperand(2));
14673 case Intrinsic::x86_sse41_pmuldq:
14674 case Intrinsic::x86_avx2_pmul_dq:
14675 return DAG.getNode(X86ISD::PMULDQ, dl, Op.getValueType(),
14676 Op.getOperand(1), Op.getOperand(2));
14678 case Intrinsic::x86_sse2_pmulhu_w:
14679 case Intrinsic::x86_avx2_pmulhu_w:
14680 return DAG.getNode(ISD::MULHU, dl, Op.getValueType(),
14681 Op.getOperand(1), Op.getOperand(2));
14683 case Intrinsic::x86_sse2_pmulh_w:
14684 case Intrinsic::x86_avx2_pmulh_w:
14685 return DAG.getNode(ISD::MULHS, dl, Op.getValueType(),
14686 Op.getOperand(1), Op.getOperand(2));
14688 // SSE/SSE2/AVX floating point max/min intrinsics.
14689 case Intrinsic::x86_sse_max_ps:
14690 case Intrinsic::x86_sse2_max_pd:
14691 case Intrinsic::x86_avx_max_ps_256:
14692 case Intrinsic::x86_avx_max_pd_256:
14693 case Intrinsic::x86_sse_min_ps:
14694 case Intrinsic::x86_sse2_min_pd:
14695 case Intrinsic::x86_avx_min_ps_256:
14696 case Intrinsic::x86_avx_min_pd_256: {
14699 default: llvm_unreachable("Impossible intrinsic"); // Can't reach here.
14700 case Intrinsic::x86_sse_max_ps:
14701 case Intrinsic::x86_sse2_max_pd:
14702 case Intrinsic::x86_avx_max_ps_256:
14703 case Intrinsic::x86_avx_max_pd_256:
14704 Opcode = X86ISD::FMAX;
14706 case Intrinsic::x86_sse_min_ps:
14707 case Intrinsic::x86_sse2_min_pd:
14708 case Intrinsic::x86_avx_min_ps_256:
14709 case Intrinsic::x86_avx_min_pd_256:
14710 Opcode = X86ISD::FMIN;
14713 return DAG.getNode(Opcode, dl, Op.getValueType(),
14714 Op.getOperand(1), Op.getOperand(2));
14717 // AVX2 variable shift intrinsics
14718 case Intrinsic::x86_avx2_psllv_d:
14719 case Intrinsic::x86_avx2_psllv_q:
14720 case Intrinsic::x86_avx2_psllv_d_256:
14721 case Intrinsic::x86_avx2_psllv_q_256:
14722 case Intrinsic::x86_avx2_psrlv_d:
14723 case Intrinsic::x86_avx2_psrlv_q:
14724 case Intrinsic::x86_avx2_psrlv_d_256:
14725 case Intrinsic::x86_avx2_psrlv_q_256:
14726 case Intrinsic::x86_avx2_psrav_d:
14727 case Intrinsic::x86_avx2_psrav_d_256: {
14730 default: llvm_unreachable("Impossible intrinsic"); // Can't reach here.
14731 case Intrinsic::x86_avx2_psllv_d:
14732 case Intrinsic::x86_avx2_psllv_q:
14733 case Intrinsic::x86_avx2_psllv_d_256:
14734 case Intrinsic::x86_avx2_psllv_q_256:
14737 case Intrinsic::x86_avx2_psrlv_d:
14738 case Intrinsic::x86_avx2_psrlv_q:
14739 case Intrinsic::x86_avx2_psrlv_d_256:
14740 case Intrinsic::x86_avx2_psrlv_q_256:
14743 case Intrinsic::x86_avx2_psrav_d:
14744 case Intrinsic::x86_avx2_psrav_d_256:
14748 return DAG.getNode(Opcode, dl, Op.getValueType(),
14749 Op.getOperand(1), Op.getOperand(2));
14752 case Intrinsic::x86_sse2_packssdw_128:
14753 case Intrinsic::x86_sse2_packsswb_128:
14754 case Intrinsic::x86_avx2_packssdw:
14755 case Intrinsic::x86_avx2_packsswb:
14756 return DAG.getNode(X86ISD::PACKSS, dl, Op.getValueType(),
14757 Op.getOperand(1), Op.getOperand(2));
14759 case Intrinsic::x86_sse2_packuswb_128:
14760 case Intrinsic::x86_sse41_packusdw:
14761 case Intrinsic::x86_avx2_packuswb:
14762 case Intrinsic::x86_avx2_packusdw:
14763 return DAG.getNode(X86ISD::PACKUS, dl, Op.getValueType(),
14764 Op.getOperand(1), Op.getOperand(2));
14766 case Intrinsic::x86_ssse3_pshuf_b_128:
14767 case Intrinsic::x86_avx2_pshuf_b:
14768 return DAG.getNode(X86ISD::PSHUFB, dl, Op.getValueType(),
14769 Op.getOperand(1), Op.getOperand(2));
14771 case Intrinsic::x86_sse2_pshuf_d:
14772 return DAG.getNode(X86ISD::PSHUFD, dl, Op.getValueType(),
14773 Op.getOperand(1), Op.getOperand(2));
14775 case Intrinsic::x86_sse2_pshufl_w:
14776 return DAG.getNode(X86ISD::PSHUFLW, dl, Op.getValueType(),
14777 Op.getOperand(1), Op.getOperand(2));
14779 case Intrinsic::x86_sse2_pshufh_w:
14780 return DAG.getNode(X86ISD::PSHUFHW, dl, Op.getValueType(),
14781 Op.getOperand(1), Op.getOperand(2));
14783 case Intrinsic::x86_ssse3_psign_b_128:
14784 case Intrinsic::x86_ssse3_psign_w_128:
14785 case Intrinsic::x86_ssse3_psign_d_128:
14786 case Intrinsic::x86_avx2_psign_b:
14787 case Intrinsic::x86_avx2_psign_w:
14788 case Intrinsic::x86_avx2_psign_d:
14789 return DAG.getNode(X86ISD::PSIGN, dl, Op.getValueType(),
14790 Op.getOperand(1), Op.getOperand(2));
14792 case Intrinsic::x86_avx2_permd:
14793 case Intrinsic::x86_avx2_permps:
14794 // Operands intentionally swapped. Mask is last operand to intrinsic,
14795 // but second operand for node/instruction.
14796 return DAG.getNode(X86ISD::VPERMV, dl, Op.getValueType(),
14797 Op.getOperand(2), Op.getOperand(1));
14799 case Intrinsic::x86_avx512_mask_valign_q_512:
14800 case Intrinsic::x86_avx512_mask_valign_d_512:
14801 // Vector source operands are swapped.
14802 return getVectorMaskingNode(DAG.getNode(X86ISD::VALIGN, dl,
14803 Op.getValueType(), Op.getOperand(2),
14806 Op.getOperand(5), Op.getOperand(4), DAG);
14808 // ptest and testp intrinsics. The intrinsic these come from are designed to
14809 // return an integer value, not just an instruction so lower it to the ptest
14810 // or testp pattern and a setcc for the result.
14811 case Intrinsic::x86_sse41_ptestz:
14812 case Intrinsic::x86_sse41_ptestc:
14813 case Intrinsic::x86_sse41_ptestnzc:
14814 case Intrinsic::x86_avx_ptestz_256:
14815 case Intrinsic::x86_avx_ptestc_256:
14816 case Intrinsic::x86_avx_ptestnzc_256:
14817 case Intrinsic::x86_avx_vtestz_ps:
14818 case Intrinsic::x86_avx_vtestc_ps:
14819 case Intrinsic::x86_avx_vtestnzc_ps:
14820 case Intrinsic::x86_avx_vtestz_pd:
14821 case Intrinsic::x86_avx_vtestc_pd:
14822 case Intrinsic::x86_avx_vtestnzc_pd:
14823 case Intrinsic::x86_avx_vtestz_ps_256:
14824 case Intrinsic::x86_avx_vtestc_ps_256:
14825 case Intrinsic::x86_avx_vtestnzc_ps_256:
14826 case Intrinsic::x86_avx_vtestz_pd_256:
14827 case Intrinsic::x86_avx_vtestc_pd_256:
14828 case Intrinsic::x86_avx_vtestnzc_pd_256: {
14829 bool IsTestPacked = false;
14832 default: llvm_unreachable("Bad fallthrough in Intrinsic lowering.");
14833 case Intrinsic::x86_avx_vtestz_ps:
14834 case Intrinsic::x86_avx_vtestz_pd:
14835 case Intrinsic::x86_avx_vtestz_ps_256:
14836 case Intrinsic::x86_avx_vtestz_pd_256:
14837 IsTestPacked = true; // Fallthrough
14838 case Intrinsic::x86_sse41_ptestz:
14839 case Intrinsic::x86_avx_ptestz_256:
14841 X86CC = X86::COND_E;
14843 case Intrinsic::x86_avx_vtestc_ps:
14844 case Intrinsic::x86_avx_vtestc_pd:
14845 case Intrinsic::x86_avx_vtestc_ps_256:
14846 case Intrinsic::x86_avx_vtestc_pd_256:
14847 IsTestPacked = true; // Fallthrough
14848 case Intrinsic::x86_sse41_ptestc:
14849 case Intrinsic::x86_avx_ptestc_256:
14851 X86CC = X86::COND_B;
14853 case Intrinsic::x86_avx_vtestnzc_ps:
14854 case Intrinsic::x86_avx_vtestnzc_pd:
14855 case Intrinsic::x86_avx_vtestnzc_ps_256:
14856 case Intrinsic::x86_avx_vtestnzc_pd_256:
14857 IsTestPacked = true; // Fallthrough
14858 case Intrinsic::x86_sse41_ptestnzc:
14859 case Intrinsic::x86_avx_ptestnzc_256:
14861 X86CC = X86::COND_A;
14865 SDValue LHS = Op.getOperand(1);
14866 SDValue RHS = Op.getOperand(2);
14867 unsigned TestOpc = IsTestPacked ? X86ISD::TESTP : X86ISD::PTEST;
14868 SDValue Test = DAG.getNode(TestOpc, dl, MVT::i32, LHS, RHS);
14869 SDValue CC = DAG.getConstant(X86CC, MVT::i8);
14870 SDValue SetCC = DAG.getNode(X86ISD::SETCC, dl, MVT::i8, CC, Test);
14871 return DAG.getNode(ISD::ZERO_EXTEND, dl, MVT::i32, SetCC);
14873 case Intrinsic::x86_avx512_kortestz_w:
14874 case Intrinsic::x86_avx512_kortestc_w: {
14875 unsigned X86CC = (IntNo == Intrinsic::x86_avx512_kortestz_w)? X86::COND_E: X86::COND_B;
14876 SDValue LHS = DAG.getNode(ISD::BITCAST, dl, MVT::v16i1, Op.getOperand(1));
14877 SDValue RHS = DAG.getNode(ISD::BITCAST, dl, MVT::v16i1, Op.getOperand(2));
14878 SDValue CC = DAG.getConstant(X86CC, MVT::i8);
14879 SDValue Test = DAG.getNode(X86ISD::KORTEST, dl, MVT::i32, LHS, RHS);
14880 SDValue SetCC = DAG.getNode(X86ISD::SETCC, dl, MVT::i1, CC, Test);
14881 return DAG.getNode(ISD::ZERO_EXTEND, dl, MVT::i32, SetCC);
14884 case Intrinsic::x86_sse42_pcmpistria128:
14885 case Intrinsic::x86_sse42_pcmpestria128:
14886 case Intrinsic::x86_sse42_pcmpistric128:
14887 case Intrinsic::x86_sse42_pcmpestric128:
14888 case Intrinsic::x86_sse42_pcmpistrio128:
14889 case Intrinsic::x86_sse42_pcmpestrio128:
14890 case Intrinsic::x86_sse42_pcmpistris128:
14891 case Intrinsic::x86_sse42_pcmpestris128:
14892 case Intrinsic::x86_sse42_pcmpistriz128:
14893 case Intrinsic::x86_sse42_pcmpestriz128: {
14897 default: llvm_unreachable("Impossible intrinsic"); // Can't reach here.
14898 case Intrinsic::x86_sse42_pcmpistria128:
14899 Opcode = X86ISD::PCMPISTRI;
14900 X86CC = X86::COND_A;
14902 case Intrinsic::x86_sse42_pcmpestria128:
14903 Opcode = X86ISD::PCMPESTRI;
14904 X86CC = X86::COND_A;
14906 case Intrinsic::x86_sse42_pcmpistric128:
14907 Opcode = X86ISD::PCMPISTRI;
14908 X86CC = X86::COND_B;
14910 case Intrinsic::x86_sse42_pcmpestric128:
14911 Opcode = X86ISD::PCMPESTRI;
14912 X86CC = X86::COND_B;
14914 case Intrinsic::x86_sse42_pcmpistrio128:
14915 Opcode = X86ISD::PCMPISTRI;
14916 X86CC = X86::COND_O;
14918 case Intrinsic::x86_sse42_pcmpestrio128:
14919 Opcode = X86ISD::PCMPESTRI;
14920 X86CC = X86::COND_O;
14922 case Intrinsic::x86_sse42_pcmpistris128:
14923 Opcode = X86ISD::PCMPISTRI;
14924 X86CC = X86::COND_S;
14926 case Intrinsic::x86_sse42_pcmpestris128:
14927 Opcode = X86ISD::PCMPESTRI;
14928 X86CC = X86::COND_S;
14930 case Intrinsic::x86_sse42_pcmpistriz128:
14931 Opcode = X86ISD::PCMPISTRI;
14932 X86CC = X86::COND_E;
14934 case Intrinsic::x86_sse42_pcmpestriz128:
14935 Opcode = X86ISD::PCMPESTRI;
14936 X86CC = X86::COND_E;
14939 SmallVector<SDValue, 5> NewOps(Op->op_begin()+1, Op->op_end());
14940 SDVTList VTs = DAG.getVTList(Op.getValueType(), MVT::i32);
14941 SDValue PCMP = DAG.getNode(Opcode, dl, VTs, NewOps);
14942 SDValue SetCC = DAG.getNode(X86ISD::SETCC, dl, MVT::i8,
14943 DAG.getConstant(X86CC, MVT::i8),
14944 SDValue(PCMP.getNode(), 1));
14945 return DAG.getNode(ISD::ZERO_EXTEND, dl, MVT::i32, SetCC);
14948 case Intrinsic::x86_sse42_pcmpistri128:
14949 case Intrinsic::x86_sse42_pcmpestri128: {
14951 if (IntNo == Intrinsic::x86_sse42_pcmpistri128)
14952 Opcode = X86ISD::PCMPISTRI;
14954 Opcode = X86ISD::PCMPESTRI;
14956 SmallVector<SDValue, 5> NewOps(Op->op_begin()+1, Op->op_end());
14957 SDVTList VTs = DAG.getVTList(Op.getValueType(), MVT::i32);
14958 return DAG.getNode(Opcode, dl, VTs, NewOps);
14961 case Intrinsic::x86_fma_mask_vfmadd_ps_512:
14962 case Intrinsic::x86_fma_mask_vfmadd_pd_512:
14963 case Intrinsic::x86_fma_mask_vfmsub_ps_512:
14964 case Intrinsic::x86_fma_mask_vfmsub_pd_512:
14965 case Intrinsic::x86_fma_mask_vfnmadd_ps_512:
14966 case Intrinsic::x86_fma_mask_vfnmadd_pd_512:
14967 case Intrinsic::x86_fma_mask_vfnmsub_ps_512:
14968 case Intrinsic::x86_fma_mask_vfnmsub_pd_512:
14969 case Intrinsic::x86_fma_mask_vfmaddsub_ps_512:
14970 case Intrinsic::x86_fma_mask_vfmaddsub_pd_512:
14971 case Intrinsic::x86_fma_mask_vfmsubadd_ps_512:
14972 case Intrinsic::x86_fma_mask_vfmsubadd_pd_512: {
14973 auto *SAE = cast<ConstantSDNode>(Op.getOperand(5));
14974 if (SAE->getZExtValue() == X86::STATIC_ROUNDING::CUR_DIRECTION)
14975 return getVectorMaskingNode(DAG.getNode(getOpcodeForFMAIntrinsic(IntNo),
14976 dl, Op.getValueType(),
14980 Op.getOperand(4), Op.getOperand(1), DAG);
14985 case Intrinsic::x86_fma_vfmadd_ps:
14986 case Intrinsic::x86_fma_vfmadd_pd:
14987 case Intrinsic::x86_fma_vfmsub_ps:
14988 case Intrinsic::x86_fma_vfmsub_pd:
14989 case Intrinsic::x86_fma_vfnmadd_ps:
14990 case Intrinsic::x86_fma_vfnmadd_pd:
14991 case Intrinsic::x86_fma_vfnmsub_ps:
14992 case Intrinsic::x86_fma_vfnmsub_pd:
14993 case Intrinsic::x86_fma_vfmaddsub_ps:
14994 case Intrinsic::x86_fma_vfmaddsub_pd:
14995 case Intrinsic::x86_fma_vfmsubadd_ps:
14996 case Intrinsic::x86_fma_vfmsubadd_pd:
14997 case Intrinsic::x86_fma_vfmadd_ps_256:
14998 case Intrinsic::x86_fma_vfmadd_pd_256:
14999 case Intrinsic::x86_fma_vfmsub_ps_256:
15000 case Intrinsic::x86_fma_vfmsub_pd_256:
15001 case Intrinsic::x86_fma_vfnmadd_ps_256:
15002 case Intrinsic::x86_fma_vfnmadd_pd_256:
15003 case Intrinsic::x86_fma_vfnmsub_ps_256:
15004 case Intrinsic::x86_fma_vfnmsub_pd_256:
15005 case Intrinsic::x86_fma_vfmaddsub_ps_256:
15006 case Intrinsic::x86_fma_vfmaddsub_pd_256:
15007 case Intrinsic::x86_fma_vfmsubadd_ps_256:
15008 case Intrinsic::x86_fma_vfmsubadd_pd_256:
15009 return DAG.getNode(getOpcodeForFMAIntrinsic(IntNo), dl, Op.getValueType(),
15010 Op.getOperand(1), Op.getOperand(2), Op.getOperand(3));
15014 static SDValue getGatherNode(unsigned Opc, SDValue Op, SelectionDAG &DAG,
15015 SDValue Src, SDValue Mask, SDValue Base,
15016 SDValue Index, SDValue ScaleOp, SDValue Chain,
15017 const X86Subtarget * Subtarget) {
15019 ConstantSDNode *C = dyn_cast<ConstantSDNode>(ScaleOp);
15020 assert(C && "Invalid scale type");
15021 SDValue Scale = DAG.getTargetConstant(C->getZExtValue(), MVT::i8);
15022 EVT MaskVT = MVT::getVectorVT(MVT::i1,
15023 Index.getSimpleValueType().getVectorNumElements());
15025 ConstantSDNode *MaskC = dyn_cast<ConstantSDNode>(Mask);
15027 MaskInReg = DAG.getTargetConstant(MaskC->getSExtValue(), MaskVT);
15029 MaskInReg = DAG.getNode(ISD::BITCAST, dl, MaskVT, Mask);
15030 SDVTList VTs = DAG.getVTList(Op.getValueType(), MaskVT, MVT::Other);
15031 SDValue Disp = DAG.getTargetConstant(0, MVT::i32);
15032 SDValue Segment = DAG.getRegister(0, MVT::i32);
15033 if (Src.getOpcode() == ISD::UNDEF)
15034 Src = getZeroVector(Op.getValueType(), Subtarget, DAG, dl);
15035 SDValue Ops[] = {Src, MaskInReg, Base, Scale, Index, Disp, Segment, Chain};
15036 SDNode *Res = DAG.getMachineNode(Opc, dl, VTs, Ops);
15037 SDValue RetOps[] = { SDValue(Res, 0), SDValue(Res, 2) };
15038 return DAG.getMergeValues(RetOps, dl);
15041 static SDValue getScatterNode(unsigned Opc, SDValue Op, SelectionDAG &DAG,
15042 SDValue Src, SDValue Mask, SDValue Base,
15043 SDValue Index, SDValue ScaleOp, SDValue Chain) {
15045 ConstantSDNode *C = dyn_cast<ConstantSDNode>(ScaleOp);
15046 assert(C && "Invalid scale type");
15047 SDValue Scale = DAG.getTargetConstant(C->getZExtValue(), MVT::i8);
15048 SDValue Disp = DAG.getTargetConstant(0, MVT::i32);
15049 SDValue Segment = DAG.getRegister(0, MVT::i32);
15050 EVT MaskVT = MVT::getVectorVT(MVT::i1,
15051 Index.getSimpleValueType().getVectorNumElements());
15053 ConstantSDNode *MaskC = dyn_cast<ConstantSDNode>(Mask);
15055 MaskInReg = DAG.getTargetConstant(MaskC->getSExtValue(), MaskVT);
15057 MaskInReg = DAG.getNode(ISD::BITCAST, dl, MaskVT, Mask);
15058 SDVTList VTs = DAG.getVTList(MaskVT, MVT::Other);
15059 SDValue Ops[] = {Base, Scale, Index, Disp, Segment, MaskInReg, Src, Chain};
15060 SDNode *Res = DAG.getMachineNode(Opc, dl, VTs, Ops);
15061 return SDValue(Res, 1);
15064 static SDValue getPrefetchNode(unsigned Opc, SDValue Op, SelectionDAG &DAG,
15065 SDValue Mask, SDValue Base, SDValue Index,
15066 SDValue ScaleOp, SDValue Chain) {
15068 ConstantSDNode *C = dyn_cast<ConstantSDNode>(ScaleOp);
15069 assert(C && "Invalid scale type");
15070 SDValue Scale = DAG.getTargetConstant(C->getZExtValue(), MVT::i8);
15071 SDValue Disp = DAG.getTargetConstant(0, MVT::i32);
15072 SDValue Segment = DAG.getRegister(0, MVT::i32);
15074 MVT::getVectorVT(MVT::i1, Index.getSimpleValueType().getVectorNumElements());
15076 ConstantSDNode *MaskC = dyn_cast<ConstantSDNode>(Mask);
15078 MaskInReg = DAG.getTargetConstant(MaskC->getSExtValue(), MaskVT);
15080 MaskInReg = DAG.getNode(ISD::BITCAST, dl, MaskVT, Mask);
15081 //SDVTList VTs = DAG.getVTList(MVT::Other);
15082 SDValue Ops[] = {MaskInReg, Base, Scale, Index, Disp, Segment, Chain};
15083 SDNode *Res = DAG.getMachineNode(Opc, dl, MVT::Other, Ops);
15084 return SDValue(Res, 0);
15087 // getReadPerformanceCounter - Handles the lowering of builtin intrinsics that
15088 // read performance monitor counters (x86_rdpmc).
15089 static void getReadPerformanceCounter(SDNode *N, SDLoc DL,
15090 SelectionDAG &DAG, const X86Subtarget *Subtarget,
15091 SmallVectorImpl<SDValue> &Results) {
15092 assert(N->getNumOperands() == 3 && "Unexpected number of operands!");
15093 SDVTList Tys = DAG.getVTList(MVT::Other, MVT::Glue);
15096 // The ECX register is used to select the index of the performance counter
15098 SDValue Chain = DAG.getCopyToReg(N->getOperand(0), DL, X86::ECX,
15100 SDValue rd = DAG.getNode(X86ISD::RDPMC_DAG, DL, Tys, Chain);
15102 // Reads the content of a 64-bit performance counter and returns it in the
15103 // registers EDX:EAX.
15104 if (Subtarget->is64Bit()) {
15105 LO = DAG.getCopyFromReg(rd, DL, X86::RAX, MVT::i64, rd.getValue(1));
15106 HI = DAG.getCopyFromReg(LO.getValue(1), DL, X86::RDX, MVT::i64,
15109 LO = DAG.getCopyFromReg(rd, DL, X86::EAX, MVT::i32, rd.getValue(1));
15110 HI = DAG.getCopyFromReg(LO.getValue(1), DL, X86::EDX, MVT::i32,
15113 Chain = HI.getValue(1);
15115 if (Subtarget->is64Bit()) {
15116 // The EAX register is loaded with the low-order 32 bits. The EDX register
15117 // is loaded with the supported high-order bits of the counter.
15118 SDValue Tmp = DAG.getNode(ISD::SHL, DL, MVT::i64, HI,
15119 DAG.getConstant(32, MVT::i8));
15120 Results.push_back(DAG.getNode(ISD::OR, DL, MVT::i64, LO, Tmp));
15121 Results.push_back(Chain);
15125 // Use a buildpair to merge the two 32-bit values into a 64-bit one.
15126 SDValue Ops[] = { LO, HI };
15127 SDValue Pair = DAG.getNode(ISD::BUILD_PAIR, DL, MVT::i64, Ops);
15128 Results.push_back(Pair);
15129 Results.push_back(Chain);
15132 // getReadTimeStampCounter - Handles the lowering of builtin intrinsics that
15133 // read the time stamp counter (x86_rdtsc and x86_rdtscp). This function is
15134 // also used to custom lower READCYCLECOUNTER nodes.
15135 static void getReadTimeStampCounter(SDNode *N, SDLoc DL, unsigned Opcode,
15136 SelectionDAG &DAG, const X86Subtarget *Subtarget,
15137 SmallVectorImpl<SDValue> &Results) {
15138 SDVTList Tys = DAG.getVTList(MVT::Other, MVT::Glue);
15139 SDValue rd = DAG.getNode(Opcode, DL, Tys, N->getOperand(0));
15142 // The processor's time-stamp counter (a 64-bit MSR) is stored into the
15143 // EDX:EAX registers. EDX is loaded with the high-order 32 bits of the MSR
15144 // and the EAX register is loaded with the low-order 32 bits.
15145 if (Subtarget->is64Bit()) {
15146 LO = DAG.getCopyFromReg(rd, DL, X86::RAX, MVT::i64, rd.getValue(1));
15147 HI = DAG.getCopyFromReg(LO.getValue(1), DL, X86::RDX, MVT::i64,
15150 LO = DAG.getCopyFromReg(rd, DL, X86::EAX, MVT::i32, rd.getValue(1));
15151 HI = DAG.getCopyFromReg(LO.getValue(1), DL, X86::EDX, MVT::i32,
15154 SDValue Chain = HI.getValue(1);
15156 if (Opcode == X86ISD::RDTSCP_DAG) {
15157 assert(N->getNumOperands() == 3 && "Unexpected number of operands!");
15159 // Instruction RDTSCP loads the IA32:TSC_AUX_MSR (address C000_0103H) into
15160 // the ECX register. Add 'ecx' explicitly to the chain.
15161 SDValue ecx = DAG.getCopyFromReg(Chain, DL, X86::ECX, MVT::i32,
15163 // Explicitly store the content of ECX at the location passed in input
15164 // to the 'rdtscp' intrinsic.
15165 Chain = DAG.getStore(ecx.getValue(1), DL, ecx, N->getOperand(2),
15166 MachinePointerInfo(), false, false, 0);
15169 if (Subtarget->is64Bit()) {
15170 // The EDX register is loaded with the high-order 32 bits of the MSR, and
15171 // the EAX register is loaded with the low-order 32 bits.
15172 SDValue Tmp = DAG.getNode(ISD::SHL, DL, MVT::i64, HI,
15173 DAG.getConstant(32, MVT::i8));
15174 Results.push_back(DAG.getNode(ISD::OR, DL, MVT::i64, LO, Tmp));
15175 Results.push_back(Chain);
15179 // Use a buildpair to merge the two 32-bit values into a 64-bit one.
15180 SDValue Ops[] = { LO, HI };
15181 SDValue Pair = DAG.getNode(ISD::BUILD_PAIR, DL, MVT::i64, Ops);
15182 Results.push_back(Pair);
15183 Results.push_back(Chain);
15186 static SDValue LowerREADCYCLECOUNTER(SDValue Op, const X86Subtarget *Subtarget,
15187 SelectionDAG &DAG) {
15188 SmallVector<SDValue, 2> Results;
15190 getReadTimeStampCounter(Op.getNode(), DL, X86ISD::RDTSC_DAG, DAG, Subtarget,
15192 return DAG.getMergeValues(Results, DL);
15196 static SDValue LowerINTRINSIC_W_CHAIN(SDValue Op, const X86Subtarget *Subtarget,
15197 SelectionDAG &DAG) {
15198 unsigned IntNo = cast<ConstantSDNode>(Op.getOperand(1))->getZExtValue();
15200 const IntrinsicData* IntrData = GetIntrinsicWithChain(IntNo);
15205 switch(IntrData->Type) {
15207 llvm_unreachable("Unknown Intrinsic Type");
15211 // Emit the node with the right value type.
15212 SDVTList VTs = DAG.getVTList(Op->getValueType(0), MVT::Glue, MVT::Other);
15213 SDValue Result = DAG.getNode(IntrData->Opc0, dl, VTs, Op.getOperand(0));
15215 // If the value returned by RDRAND/RDSEED was valid (CF=1), return 1.
15216 // Otherwise return the value from Rand, which is always 0, casted to i32.
15217 SDValue Ops[] = { DAG.getZExtOrTrunc(Result, dl, Op->getValueType(1)),
15218 DAG.getConstant(1, Op->getValueType(1)),
15219 DAG.getConstant(X86::COND_B, MVT::i32),
15220 SDValue(Result.getNode(), 1) };
15221 SDValue isValid = DAG.getNode(X86ISD::CMOV, dl,
15222 DAG.getVTList(Op->getValueType(1), MVT::Glue),
15225 // Return { result, isValid, chain }.
15226 return DAG.getNode(ISD::MERGE_VALUES, dl, Op->getVTList(), Result, isValid,
15227 SDValue(Result.getNode(), 2));
15230 //gather(v1, mask, index, base, scale);
15231 SDValue Chain = Op.getOperand(0);
15232 SDValue Src = Op.getOperand(2);
15233 SDValue Base = Op.getOperand(3);
15234 SDValue Index = Op.getOperand(4);
15235 SDValue Mask = Op.getOperand(5);
15236 SDValue Scale = Op.getOperand(6);
15237 return getGatherNode(IntrData->Opc0, Op, DAG, Src, Mask, Base, Index, Scale, Chain,
15241 //scatter(base, mask, index, v1, scale);
15242 SDValue Chain = Op.getOperand(0);
15243 SDValue Base = Op.getOperand(2);
15244 SDValue Mask = Op.getOperand(3);
15245 SDValue Index = Op.getOperand(4);
15246 SDValue Src = Op.getOperand(5);
15247 SDValue Scale = Op.getOperand(6);
15248 return getScatterNode(IntrData->Opc0, Op, DAG, Src, Mask, Base, Index, Scale, Chain);
15251 SDValue Hint = Op.getOperand(6);
15253 if (dyn_cast<ConstantSDNode> (Hint) == nullptr ||
15254 (HintVal = dyn_cast<ConstantSDNode> (Hint)->getZExtValue()) > 1)
15255 llvm_unreachable("Wrong prefetch hint in intrinsic: should be 0 or 1");
15256 unsigned Opcode = (HintVal ? IntrData->Opc1 : IntrData->Opc0);
15257 SDValue Chain = Op.getOperand(0);
15258 SDValue Mask = Op.getOperand(2);
15259 SDValue Index = Op.getOperand(3);
15260 SDValue Base = Op.getOperand(4);
15261 SDValue Scale = Op.getOperand(5);
15262 return getPrefetchNode(Opcode, Op, DAG, Mask, Base, Index, Scale, Chain);
15264 // Read Time Stamp Counter (RDTSC) and Processor ID (RDTSCP).
15266 SmallVector<SDValue, 2> Results;
15267 getReadTimeStampCounter(Op.getNode(), dl, IntrData->Opc0, DAG, Subtarget, Results);
15268 return DAG.getMergeValues(Results, dl);
15270 // Read Performance Monitoring Counters.
15272 SmallVector<SDValue, 2> Results;
15273 getReadPerformanceCounter(Op.getNode(), dl, DAG, Subtarget, Results);
15274 return DAG.getMergeValues(Results, dl);
15276 // XTEST intrinsics.
15278 SDVTList VTs = DAG.getVTList(Op->getValueType(0), MVT::Other);
15279 SDValue InTrans = DAG.getNode(IntrData->Opc0, dl, VTs, Op.getOperand(0));
15280 SDValue SetCC = DAG.getNode(X86ISD::SETCC, dl, MVT::i8,
15281 DAG.getConstant(X86::COND_NE, MVT::i8),
15283 SDValue Ret = DAG.getNode(ISD::ZERO_EXTEND, dl, Op->getValueType(0), SetCC);
15284 return DAG.getNode(ISD::MERGE_VALUES, dl, Op->getVTList(),
15285 Ret, SDValue(InTrans.getNode(), 1));
15289 SmallVector<SDValue, 2> Results;
15290 SDVTList CFVTs = DAG.getVTList(Op->getValueType(0), MVT::Other);
15291 SDVTList VTs = DAG.getVTList(Op.getOperand(3)->getValueType(0), MVT::Other);
15292 SDValue GenCF = DAG.getNode(X86ISD::ADD, dl, CFVTs, Op.getOperand(2),
15293 DAG.getConstant(-1, MVT::i8));
15294 SDValue Res = DAG.getNode(IntrData->Opc0, dl, VTs, Op.getOperand(3),
15295 Op.getOperand(4), GenCF.getValue(1));
15296 SDValue Store = DAG.getStore(Op.getOperand(0), dl, Res.getValue(0),
15297 Op.getOperand(5), MachinePointerInfo(),
15299 SDValue SetCC = DAG.getNode(X86ISD::SETCC, dl, MVT::i8,
15300 DAG.getConstant(X86::COND_B, MVT::i8),
15302 Results.push_back(SetCC);
15303 Results.push_back(Store);
15304 return DAG.getMergeValues(Results, dl);
15309 SDValue X86TargetLowering::LowerRETURNADDR(SDValue Op,
15310 SelectionDAG &DAG) const {
15311 MachineFrameInfo *MFI = DAG.getMachineFunction().getFrameInfo();
15312 MFI->setReturnAddressIsTaken(true);
15314 if (verifyReturnAddressArgumentIsConstant(Op, DAG))
15317 unsigned Depth = cast<ConstantSDNode>(Op.getOperand(0))->getZExtValue();
15319 EVT PtrVT = getPointerTy();
15322 SDValue FrameAddr = LowerFRAMEADDR(Op, DAG);
15323 const X86RegisterInfo *RegInfo = static_cast<const X86RegisterInfo *>(
15324 DAG.getSubtarget().getRegisterInfo());
15325 SDValue Offset = DAG.getConstant(RegInfo->getSlotSize(), PtrVT);
15326 return DAG.getLoad(PtrVT, dl, DAG.getEntryNode(),
15327 DAG.getNode(ISD::ADD, dl, PtrVT,
15328 FrameAddr, Offset),
15329 MachinePointerInfo(), false, false, false, 0);
15332 // Just load the return address.
15333 SDValue RetAddrFI = getReturnAddressFrameIndex(DAG);
15334 return DAG.getLoad(PtrVT, dl, DAG.getEntryNode(),
15335 RetAddrFI, MachinePointerInfo(), false, false, false, 0);
15338 SDValue X86TargetLowering::LowerFRAMEADDR(SDValue Op, SelectionDAG &DAG) const {
15339 MachineFrameInfo *MFI = DAG.getMachineFunction().getFrameInfo();
15340 MFI->setFrameAddressIsTaken(true);
15342 EVT VT = Op.getValueType();
15343 SDLoc dl(Op); // FIXME probably not meaningful
15344 unsigned Depth = cast<ConstantSDNode>(Op.getOperand(0))->getZExtValue();
15345 const X86RegisterInfo *RegInfo = static_cast<const X86RegisterInfo *>(
15346 DAG.getSubtarget().getRegisterInfo());
15347 unsigned FrameReg = RegInfo->getFrameRegister(DAG.getMachineFunction());
15348 assert(((FrameReg == X86::RBP && VT == MVT::i64) ||
15349 (FrameReg == X86::EBP && VT == MVT::i32)) &&
15350 "Invalid Frame Register!");
15351 SDValue FrameAddr = DAG.getCopyFromReg(DAG.getEntryNode(), dl, FrameReg, VT);
15353 FrameAddr = DAG.getLoad(VT, dl, DAG.getEntryNode(), FrameAddr,
15354 MachinePointerInfo(),
15355 false, false, false, 0);
15359 // FIXME? Maybe this could be a TableGen attribute on some registers and
15360 // this table could be generated automatically from RegInfo.
15361 unsigned X86TargetLowering::getRegisterByName(const char* RegName,
15363 unsigned Reg = StringSwitch<unsigned>(RegName)
15364 .Case("esp", X86::ESP)
15365 .Case("rsp", X86::RSP)
15369 report_fatal_error("Invalid register name global variable");
15372 SDValue X86TargetLowering::LowerFRAME_TO_ARGS_OFFSET(SDValue Op,
15373 SelectionDAG &DAG) const {
15374 const X86RegisterInfo *RegInfo = static_cast<const X86RegisterInfo *>(
15375 DAG.getSubtarget().getRegisterInfo());
15376 return DAG.getIntPtrConstant(2 * RegInfo->getSlotSize());
15379 SDValue X86TargetLowering::LowerEH_RETURN(SDValue Op, SelectionDAG &DAG) const {
15380 SDValue Chain = Op.getOperand(0);
15381 SDValue Offset = Op.getOperand(1);
15382 SDValue Handler = Op.getOperand(2);
15385 EVT PtrVT = getPointerTy();
15386 const X86RegisterInfo *RegInfo = static_cast<const X86RegisterInfo *>(
15387 DAG.getSubtarget().getRegisterInfo());
15388 unsigned FrameReg = RegInfo->getFrameRegister(DAG.getMachineFunction());
15389 assert(((FrameReg == X86::RBP && PtrVT == MVT::i64) ||
15390 (FrameReg == X86::EBP && PtrVT == MVT::i32)) &&
15391 "Invalid Frame Register!");
15392 SDValue Frame = DAG.getCopyFromReg(DAG.getEntryNode(), dl, FrameReg, PtrVT);
15393 unsigned StoreAddrReg = (PtrVT == MVT::i64) ? X86::RCX : X86::ECX;
15395 SDValue StoreAddr = DAG.getNode(ISD::ADD, dl, PtrVT, Frame,
15396 DAG.getIntPtrConstant(RegInfo->getSlotSize()));
15397 StoreAddr = DAG.getNode(ISD::ADD, dl, PtrVT, StoreAddr, Offset);
15398 Chain = DAG.getStore(Chain, dl, Handler, StoreAddr, MachinePointerInfo(),
15400 Chain = DAG.getCopyToReg(Chain, dl, StoreAddrReg, StoreAddr);
15402 return DAG.getNode(X86ISD::EH_RETURN, dl, MVT::Other, Chain,
15403 DAG.getRegister(StoreAddrReg, PtrVT));
15406 SDValue X86TargetLowering::lowerEH_SJLJ_SETJMP(SDValue Op,
15407 SelectionDAG &DAG) const {
15409 return DAG.getNode(X86ISD::EH_SJLJ_SETJMP, DL,
15410 DAG.getVTList(MVT::i32, MVT::Other),
15411 Op.getOperand(0), Op.getOperand(1));
15414 SDValue X86TargetLowering::lowerEH_SJLJ_LONGJMP(SDValue Op,
15415 SelectionDAG &DAG) const {
15417 return DAG.getNode(X86ISD::EH_SJLJ_LONGJMP, DL, MVT::Other,
15418 Op.getOperand(0), Op.getOperand(1));
15421 static SDValue LowerADJUST_TRAMPOLINE(SDValue Op, SelectionDAG &DAG) {
15422 return Op.getOperand(0);
15425 SDValue X86TargetLowering::LowerINIT_TRAMPOLINE(SDValue Op,
15426 SelectionDAG &DAG) const {
15427 SDValue Root = Op.getOperand(0);
15428 SDValue Trmp = Op.getOperand(1); // trampoline
15429 SDValue FPtr = Op.getOperand(2); // nested function
15430 SDValue Nest = Op.getOperand(3); // 'nest' parameter value
15433 const Value *TrmpAddr = cast<SrcValueSDNode>(Op.getOperand(4))->getValue();
15434 const TargetRegisterInfo *TRI = DAG.getSubtarget().getRegisterInfo();
15436 if (Subtarget->is64Bit()) {
15437 SDValue OutChains[6];
15439 // Large code-model.
15440 const unsigned char JMP64r = 0xFF; // 64-bit jmp through register opcode.
15441 const unsigned char MOV64ri = 0xB8; // X86::MOV64ri opcode.
15443 const unsigned char N86R10 = TRI->getEncodingValue(X86::R10) & 0x7;
15444 const unsigned char N86R11 = TRI->getEncodingValue(X86::R11) & 0x7;
15446 const unsigned char REX_WB = 0x40 | 0x08 | 0x01; // REX prefix
15448 // Load the pointer to the nested function into R11.
15449 unsigned OpCode = ((MOV64ri | N86R11) << 8) | REX_WB; // movabsq r11
15450 SDValue Addr = Trmp;
15451 OutChains[0] = DAG.getStore(Root, dl, DAG.getConstant(OpCode, MVT::i16),
15452 Addr, MachinePointerInfo(TrmpAddr),
15455 Addr = DAG.getNode(ISD::ADD, dl, MVT::i64, Trmp,
15456 DAG.getConstant(2, MVT::i64));
15457 OutChains[1] = DAG.getStore(Root, dl, FPtr, Addr,
15458 MachinePointerInfo(TrmpAddr, 2),
15461 // Load the 'nest' parameter value into R10.
15462 // R10 is specified in X86CallingConv.td
15463 OpCode = ((MOV64ri | N86R10) << 8) | REX_WB; // movabsq r10
15464 Addr = DAG.getNode(ISD::ADD, dl, MVT::i64, Trmp,
15465 DAG.getConstant(10, MVT::i64));
15466 OutChains[2] = DAG.getStore(Root, dl, DAG.getConstant(OpCode, MVT::i16),
15467 Addr, MachinePointerInfo(TrmpAddr, 10),
15470 Addr = DAG.getNode(ISD::ADD, dl, MVT::i64, Trmp,
15471 DAG.getConstant(12, MVT::i64));
15472 OutChains[3] = DAG.getStore(Root, dl, Nest, Addr,
15473 MachinePointerInfo(TrmpAddr, 12),
15476 // Jump to the nested function.
15477 OpCode = (JMP64r << 8) | REX_WB; // jmpq *...
15478 Addr = DAG.getNode(ISD::ADD, dl, MVT::i64, Trmp,
15479 DAG.getConstant(20, MVT::i64));
15480 OutChains[4] = DAG.getStore(Root, dl, DAG.getConstant(OpCode, MVT::i16),
15481 Addr, MachinePointerInfo(TrmpAddr, 20),
15484 unsigned char ModRM = N86R11 | (4 << 3) | (3 << 6); // ...r11
15485 Addr = DAG.getNode(ISD::ADD, dl, MVT::i64, Trmp,
15486 DAG.getConstant(22, MVT::i64));
15487 OutChains[5] = DAG.getStore(Root, dl, DAG.getConstant(ModRM, MVT::i8), Addr,
15488 MachinePointerInfo(TrmpAddr, 22),
15491 return DAG.getNode(ISD::TokenFactor, dl, MVT::Other, OutChains);
15493 const Function *Func =
15494 cast<Function>(cast<SrcValueSDNode>(Op.getOperand(5))->getValue());
15495 CallingConv::ID CC = Func->getCallingConv();
15500 llvm_unreachable("Unsupported calling convention");
15501 case CallingConv::C:
15502 case CallingConv::X86_StdCall: {
15503 // Pass 'nest' parameter in ECX.
15504 // Must be kept in sync with X86CallingConv.td
15505 NestReg = X86::ECX;
15507 // Check that ECX wasn't needed by an 'inreg' parameter.
15508 FunctionType *FTy = Func->getFunctionType();
15509 const AttributeSet &Attrs = Func->getAttributes();
15511 if (!Attrs.isEmpty() && !Func->isVarArg()) {
15512 unsigned InRegCount = 0;
15515 for (FunctionType::param_iterator I = FTy->param_begin(),
15516 E = FTy->param_end(); I != E; ++I, ++Idx)
15517 if (Attrs.hasAttribute(Idx, Attribute::InReg))
15518 // FIXME: should only count parameters that are lowered to integers.
15519 InRegCount += (TD->getTypeSizeInBits(*I) + 31) / 32;
15521 if (InRegCount > 2) {
15522 report_fatal_error("Nest register in use - reduce number of inreg"
15528 case CallingConv::X86_FastCall:
15529 case CallingConv::X86_ThisCall:
15530 case CallingConv::Fast:
15531 // Pass 'nest' parameter in EAX.
15532 // Must be kept in sync with X86CallingConv.td
15533 NestReg = X86::EAX;
15537 SDValue OutChains[4];
15538 SDValue Addr, Disp;
15540 Addr = DAG.getNode(ISD::ADD, dl, MVT::i32, Trmp,
15541 DAG.getConstant(10, MVT::i32));
15542 Disp = DAG.getNode(ISD::SUB, dl, MVT::i32, FPtr, Addr);
15544 // This is storing the opcode for MOV32ri.
15545 const unsigned char MOV32ri = 0xB8; // X86::MOV32ri's opcode byte.
15546 const unsigned char N86Reg = TRI->getEncodingValue(NestReg) & 0x7;
15547 OutChains[0] = DAG.getStore(Root, dl,
15548 DAG.getConstant(MOV32ri|N86Reg, MVT::i8),
15549 Trmp, MachinePointerInfo(TrmpAddr),
15552 Addr = DAG.getNode(ISD::ADD, dl, MVT::i32, Trmp,
15553 DAG.getConstant(1, MVT::i32));
15554 OutChains[1] = DAG.getStore(Root, dl, Nest, Addr,
15555 MachinePointerInfo(TrmpAddr, 1),
15558 const unsigned char JMP = 0xE9; // jmp <32bit dst> opcode.
15559 Addr = DAG.getNode(ISD::ADD, dl, MVT::i32, Trmp,
15560 DAG.getConstant(5, MVT::i32));
15561 OutChains[2] = DAG.getStore(Root, dl, DAG.getConstant(JMP, MVT::i8), Addr,
15562 MachinePointerInfo(TrmpAddr, 5),
15565 Addr = DAG.getNode(ISD::ADD, dl, MVT::i32, Trmp,
15566 DAG.getConstant(6, MVT::i32));
15567 OutChains[3] = DAG.getStore(Root, dl, Disp, Addr,
15568 MachinePointerInfo(TrmpAddr, 6),
15571 return DAG.getNode(ISD::TokenFactor, dl, MVT::Other, OutChains);
15575 SDValue X86TargetLowering::LowerFLT_ROUNDS_(SDValue Op,
15576 SelectionDAG &DAG) const {
15578 The rounding mode is in bits 11:10 of FPSR, and has the following
15580 00 Round to nearest
15585 FLT_ROUNDS, on the other hand, expects the following:
15592 To perform the conversion, we do:
15593 (((((FPSR & 0x800) >> 11) | ((FPSR & 0x400) >> 9)) + 1) & 3)
15596 MachineFunction &MF = DAG.getMachineFunction();
15597 const TargetMachine &TM = MF.getTarget();
15598 const TargetFrameLowering &TFI = *TM.getSubtargetImpl()->getFrameLowering();
15599 unsigned StackAlignment = TFI.getStackAlignment();
15600 MVT VT = Op.getSimpleValueType();
15603 // Save FP Control Word to stack slot
15604 int SSFI = MF.getFrameInfo()->CreateStackObject(2, StackAlignment, false);
15605 SDValue StackSlot = DAG.getFrameIndex(SSFI, getPointerTy());
15607 MachineMemOperand *MMO =
15608 MF.getMachineMemOperand(MachinePointerInfo::getFixedStack(SSFI),
15609 MachineMemOperand::MOStore, 2, 2);
15611 SDValue Ops[] = { DAG.getEntryNode(), StackSlot };
15612 SDValue Chain = DAG.getMemIntrinsicNode(X86ISD::FNSTCW16m, DL,
15613 DAG.getVTList(MVT::Other),
15614 Ops, MVT::i16, MMO);
15616 // Load FP Control Word from stack slot
15617 SDValue CWD = DAG.getLoad(MVT::i16, DL, Chain, StackSlot,
15618 MachinePointerInfo(), false, false, false, 0);
15620 // Transform as necessary
15622 DAG.getNode(ISD::SRL, DL, MVT::i16,
15623 DAG.getNode(ISD::AND, DL, MVT::i16,
15624 CWD, DAG.getConstant(0x800, MVT::i16)),
15625 DAG.getConstant(11, MVT::i8));
15627 DAG.getNode(ISD::SRL, DL, MVT::i16,
15628 DAG.getNode(ISD::AND, DL, MVT::i16,
15629 CWD, DAG.getConstant(0x400, MVT::i16)),
15630 DAG.getConstant(9, MVT::i8));
15633 DAG.getNode(ISD::AND, DL, MVT::i16,
15634 DAG.getNode(ISD::ADD, DL, MVT::i16,
15635 DAG.getNode(ISD::OR, DL, MVT::i16, CWD1, CWD2),
15636 DAG.getConstant(1, MVT::i16)),
15637 DAG.getConstant(3, MVT::i16));
15639 return DAG.getNode((VT.getSizeInBits() < 16 ?
15640 ISD::TRUNCATE : ISD::ZERO_EXTEND), DL, VT, RetVal);
15643 static SDValue LowerCTLZ(SDValue Op, SelectionDAG &DAG) {
15644 MVT VT = Op.getSimpleValueType();
15646 unsigned NumBits = VT.getSizeInBits();
15649 Op = Op.getOperand(0);
15650 if (VT == MVT::i8) {
15651 // Zero extend to i32 since there is not an i8 bsr.
15653 Op = DAG.getNode(ISD::ZERO_EXTEND, dl, OpVT, Op);
15656 // Issue a bsr (scan bits in reverse) which also sets EFLAGS.
15657 SDVTList VTs = DAG.getVTList(OpVT, MVT::i32);
15658 Op = DAG.getNode(X86ISD::BSR, dl, VTs, Op);
15660 // If src is zero (i.e. bsr sets ZF), returns NumBits.
15663 DAG.getConstant(NumBits+NumBits-1, OpVT),
15664 DAG.getConstant(X86::COND_E, MVT::i8),
15667 Op = DAG.getNode(X86ISD::CMOV, dl, OpVT, Ops);
15669 // Finally xor with NumBits-1.
15670 Op = DAG.getNode(ISD::XOR, dl, OpVT, Op, DAG.getConstant(NumBits-1, OpVT));
15673 Op = DAG.getNode(ISD::TRUNCATE, dl, MVT::i8, Op);
15677 static SDValue LowerCTLZ_ZERO_UNDEF(SDValue Op, SelectionDAG &DAG) {
15678 MVT VT = Op.getSimpleValueType();
15680 unsigned NumBits = VT.getSizeInBits();
15683 Op = Op.getOperand(0);
15684 if (VT == MVT::i8) {
15685 // Zero extend to i32 since there is not an i8 bsr.
15687 Op = DAG.getNode(ISD::ZERO_EXTEND, dl, OpVT, Op);
15690 // Issue a bsr (scan bits in reverse).
15691 SDVTList VTs = DAG.getVTList(OpVT, MVT::i32);
15692 Op = DAG.getNode(X86ISD::BSR, dl, VTs, Op);
15694 // And xor with NumBits-1.
15695 Op = DAG.getNode(ISD::XOR, dl, OpVT, Op, DAG.getConstant(NumBits-1, OpVT));
15698 Op = DAG.getNode(ISD::TRUNCATE, dl, MVT::i8, Op);
15702 static SDValue LowerCTTZ(SDValue Op, SelectionDAG &DAG) {
15703 MVT VT = Op.getSimpleValueType();
15704 unsigned NumBits = VT.getSizeInBits();
15706 Op = Op.getOperand(0);
15708 // Issue a bsf (scan bits forward) which also sets EFLAGS.
15709 SDVTList VTs = DAG.getVTList(VT, MVT::i32);
15710 Op = DAG.getNode(X86ISD::BSF, dl, VTs, Op);
15712 // If src is zero (i.e. bsf sets ZF), returns NumBits.
15715 DAG.getConstant(NumBits, VT),
15716 DAG.getConstant(X86::COND_E, MVT::i8),
15719 return DAG.getNode(X86ISD::CMOV, dl, VT, Ops);
15722 // Lower256IntArith - Break a 256-bit integer operation into two new 128-bit
15723 // ones, and then concatenate the result back.
15724 static SDValue Lower256IntArith(SDValue Op, SelectionDAG &DAG) {
15725 MVT VT = Op.getSimpleValueType();
15727 assert(VT.is256BitVector() && VT.isInteger() &&
15728 "Unsupported value type for operation");
15730 unsigned NumElems = VT.getVectorNumElements();
15733 // Extract the LHS vectors
15734 SDValue LHS = Op.getOperand(0);
15735 SDValue LHS1 = Extract128BitVector(LHS, 0, DAG, dl);
15736 SDValue LHS2 = Extract128BitVector(LHS, NumElems/2, DAG, dl);
15738 // Extract the RHS vectors
15739 SDValue RHS = Op.getOperand(1);
15740 SDValue RHS1 = Extract128BitVector(RHS, 0, DAG, dl);
15741 SDValue RHS2 = Extract128BitVector(RHS, NumElems/2, DAG, dl);
15743 MVT EltVT = VT.getVectorElementType();
15744 MVT NewVT = MVT::getVectorVT(EltVT, NumElems/2);
15746 return DAG.getNode(ISD::CONCAT_VECTORS, dl, VT,
15747 DAG.getNode(Op.getOpcode(), dl, NewVT, LHS1, RHS1),
15748 DAG.getNode(Op.getOpcode(), dl, NewVT, LHS2, RHS2));
15751 static SDValue LowerADD(SDValue Op, SelectionDAG &DAG) {
15752 assert(Op.getSimpleValueType().is256BitVector() &&
15753 Op.getSimpleValueType().isInteger() &&
15754 "Only handle AVX 256-bit vector integer operation");
15755 return Lower256IntArith(Op, DAG);
15758 static SDValue LowerSUB(SDValue Op, SelectionDAG &DAG) {
15759 assert(Op.getSimpleValueType().is256BitVector() &&
15760 Op.getSimpleValueType().isInteger() &&
15761 "Only handle AVX 256-bit vector integer operation");
15762 return Lower256IntArith(Op, DAG);
15765 static SDValue LowerMUL(SDValue Op, const X86Subtarget *Subtarget,
15766 SelectionDAG &DAG) {
15768 MVT VT = Op.getSimpleValueType();
15770 // Decompose 256-bit ops into smaller 128-bit ops.
15771 if (VT.is256BitVector() && !Subtarget->hasInt256())
15772 return Lower256IntArith(Op, DAG);
15774 SDValue A = Op.getOperand(0);
15775 SDValue B = Op.getOperand(1);
15777 // Lower v4i32 mul as 2x shuffle, 2x pmuludq, 2x shuffle.
15778 if (VT == MVT::v4i32) {
15779 assert(Subtarget->hasSSE2() && !Subtarget->hasSSE41() &&
15780 "Should not custom lower when pmuldq is available!");
15782 // Extract the odd parts.
15783 static const int UnpackMask[] = { 1, -1, 3, -1 };
15784 SDValue Aodds = DAG.getVectorShuffle(VT, dl, A, A, UnpackMask);
15785 SDValue Bodds = DAG.getVectorShuffle(VT, dl, B, B, UnpackMask);
15787 // Multiply the even parts.
15788 SDValue Evens = DAG.getNode(X86ISD::PMULUDQ, dl, MVT::v2i64, A, B);
15789 // Now multiply odd parts.
15790 SDValue Odds = DAG.getNode(X86ISD::PMULUDQ, dl, MVT::v2i64, Aodds, Bodds);
15792 Evens = DAG.getNode(ISD::BITCAST, dl, VT, Evens);
15793 Odds = DAG.getNode(ISD::BITCAST, dl, VT, Odds);
15795 // Merge the two vectors back together with a shuffle. This expands into 2
15797 static const int ShufMask[] = { 0, 4, 2, 6 };
15798 return DAG.getVectorShuffle(VT, dl, Evens, Odds, ShufMask);
15801 assert((VT == MVT::v2i64 || VT == MVT::v4i64 || VT == MVT::v8i64) &&
15802 "Only know how to lower V2I64/V4I64/V8I64 multiply");
15804 // Ahi = psrlqi(a, 32);
15805 // Bhi = psrlqi(b, 32);
15807 // AloBlo = pmuludq(a, b);
15808 // AloBhi = pmuludq(a, Bhi);
15809 // AhiBlo = pmuludq(Ahi, b);
15811 // AloBhi = psllqi(AloBhi, 32);
15812 // AhiBlo = psllqi(AhiBlo, 32);
15813 // return AloBlo + AloBhi + AhiBlo;
15815 SDValue Ahi = getTargetVShiftByConstNode(X86ISD::VSRLI, dl, VT, A, 32, DAG);
15816 SDValue Bhi = getTargetVShiftByConstNode(X86ISD::VSRLI, dl, VT, B, 32, DAG);
15818 // Bit cast to 32-bit vectors for MULUDQ
15819 EVT MulVT = (VT == MVT::v2i64) ? MVT::v4i32 :
15820 (VT == MVT::v4i64) ? MVT::v8i32 : MVT::v16i32;
15821 A = DAG.getNode(ISD::BITCAST, dl, MulVT, A);
15822 B = DAG.getNode(ISD::BITCAST, dl, MulVT, B);
15823 Ahi = DAG.getNode(ISD::BITCAST, dl, MulVT, Ahi);
15824 Bhi = DAG.getNode(ISD::BITCAST, dl, MulVT, Bhi);
15826 SDValue AloBlo = DAG.getNode(X86ISD::PMULUDQ, dl, VT, A, B);
15827 SDValue AloBhi = DAG.getNode(X86ISD::PMULUDQ, dl, VT, A, Bhi);
15828 SDValue AhiBlo = DAG.getNode(X86ISD::PMULUDQ, dl, VT, Ahi, B);
15830 AloBhi = getTargetVShiftByConstNode(X86ISD::VSHLI, dl, VT, AloBhi, 32, DAG);
15831 AhiBlo = getTargetVShiftByConstNode(X86ISD::VSHLI, dl, VT, AhiBlo, 32, DAG);
15833 SDValue Res = DAG.getNode(ISD::ADD, dl, VT, AloBlo, AloBhi);
15834 return DAG.getNode(ISD::ADD, dl, VT, Res, AhiBlo);
15837 SDValue X86TargetLowering::LowerWin64_i128OP(SDValue Op, SelectionDAG &DAG) const {
15838 assert(Subtarget->isTargetWin64() && "Unexpected target");
15839 EVT VT = Op.getValueType();
15840 assert(VT.isInteger() && VT.getSizeInBits() == 128 &&
15841 "Unexpected return type for lowering");
15845 switch (Op->getOpcode()) {
15846 default: llvm_unreachable("Unexpected request for libcall!");
15847 case ISD::SDIV: isSigned = true; LC = RTLIB::SDIV_I128; break;
15848 case ISD::UDIV: isSigned = false; LC = RTLIB::UDIV_I128; break;
15849 case ISD::SREM: isSigned = true; LC = RTLIB::SREM_I128; break;
15850 case ISD::UREM: isSigned = false; LC = RTLIB::UREM_I128; break;
15851 case ISD::SDIVREM: isSigned = true; LC = RTLIB::SDIVREM_I128; break;
15852 case ISD::UDIVREM: isSigned = false; LC = RTLIB::UDIVREM_I128; break;
15856 SDValue InChain = DAG.getEntryNode();
15858 TargetLowering::ArgListTy Args;
15859 TargetLowering::ArgListEntry Entry;
15860 for (unsigned i = 0, e = Op->getNumOperands(); i != e; ++i) {
15861 EVT ArgVT = Op->getOperand(i).getValueType();
15862 assert(ArgVT.isInteger() && ArgVT.getSizeInBits() == 128 &&
15863 "Unexpected argument type for lowering");
15864 SDValue StackPtr = DAG.CreateStackTemporary(ArgVT, 16);
15865 Entry.Node = StackPtr;
15866 InChain = DAG.getStore(InChain, dl, Op->getOperand(i), StackPtr, MachinePointerInfo(),
15868 Type *ArgTy = ArgVT.getTypeForEVT(*DAG.getContext());
15869 Entry.Ty = PointerType::get(ArgTy,0);
15870 Entry.isSExt = false;
15871 Entry.isZExt = false;
15872 Args.push_back(Entry);
15875 SDValue Callee = DAG.getExternalSymbol(getLibcallName(LC),
15878 TargetLowering::CallLoweringInfo CLI(DAG);
15879 CLI.setDebugLoc(dl).setChain(InChain)
15880 .setCallee(getLibcallCallingConv(LC),
15881 static_cast<EVT>(MVT::v2i64).getTypeForEVT(*DAG.getContext()),
15882 Callee, std::move(Args), 0)
15883 .setInRegister().setSExtResult(isSigned).setZExtResult(!isSigned);
15885 std::pair<SDValue, SDValue> CallInfo = LowerCallTo(CLI);
15886 return DAG.getNode(ISD::BITCAST, dl, VT, CallInfo.first);
15889 static SDValue LowerMUL_LOHI(SDValue Op, const X86Subtarget *Subtarget,
15890 SelectionDAG &DAG) {
15891 SDValue Op0 = Op.getOperand(0), Op1 = Op.getOperand(1);
15892 EVT VT = Op0.getValueType();
15895 assert((VT == MVT::v4i32 && Subtarget->hasSSE2()) ||
15896 (VT == MVT::v8i32 && Subtarget->hasInt256()));
15898 // PMULxD operations multiply each even value (starting at 0) of LHS with
15899 // the related value of RHS and produce a widen result.
15900 // E.g., PMULUDQ <4 x i32> <a|b|c|d>, <4 x i32> <e|f|g|h>
15901 // => <2 x i64> <ae|cg>
15903 // In other word, to have all the results, we need to perform two PMULxD:
15904 // 1. one with the even values.
15905 // 2. one with the odd values.
15906 // To achieve #2, with need to place the odd values at an even position.
15908 // Place the odd value at an even position (basically, shift all values 1
15909 // step to the left):
15910 const int Mask[] = {1, -1, 3, -1, 5, -1, 7, -1};
15911 // <a|b|c|d> => <b|undef|d|undef>
15912 SDValue Odd0 = DAG.getVectorShuffle(VT, dl, Op0, Op0, Mask);
15913 // <e|f|g|h> => <f|undef|h|undef>
15914 SDValue Odd1 = DAG.getVectorShuffle(VT, dl, Op1, Op1, Mask);
15916 // Emit two multiplies, one for the lower 2 ints and one for the higher 2
15918 MVT MulVT = VT == MVT::v4i32 ? MVT::v2i64 : MVT::v4i64;
15919 bool IsSigned = Op->getOpcode() == ISD::SMUL_LOHI;
15921 (!IsSigned || !Subtarget->hasSSE41()) ? X86ISD::PMULUDQ : X86ISD::PMULDQ;
15922 // PMULUDQ <4 x i32> <a|b|c|d>, <4 x i32> <e|f|g|h>
15923 // => <2 x i64> <ae|cg>
15924 SDValue Mul1 = DAG.getNode(ISD::BITCAST, dl, VT,
15925 DAG.getNode(Opcode, dl, MulVT, Op0, Op1));
15926 // PMULUDQ <4 x i32> <b|undef|d|undef>, <4 x i32> <f|undef|h|undef>
15927 // => <2 x i64> <bf|dh>
15928 SDValue Mul2 = DAG.getNode(ISD::BITCAST, dl, VT,
15929 DAG.getNode(Opcode, dl, MulVT, Odd0, Odd1));
15931 // Shuffle it back into the right order.
15932 SDValue Highs, Lows;
15933 if (VT == MVT::v8i32) {
15934 const int HighMask[] = {1, 9, 3, 11, 5, 13, 7, 15};
15935 Highs = DAG.getVectorShuffle(VT, dl, Mul1, Mul2, HighMask);
15936 const int LowMask[] = {0, 8, 2, 10, 4, 12, 6, 14};
15937 Lows = DAG.getVectorShuffle(VT, dl, Mul1, Mul2, LowMask);
15939 const int HighMask[] = {1, 5, 3, 7};
15940 Highs = DAG.getVectorShuffle(VT, dl, Mul1, Mul2, HighMask);
15941 const int LowMask[] = {0, 4, 2, 6};
15942 Lows = DAG.getVectorShuffle(VT, dl, Mul1, Mul2, LowMask);
15945 // If we have a signed multiply but no PMULDQ fix up the high parts of a
15946 // unsigned multiply.
15947 if (IsSigned && !Subtarget->hasSSE41()) {
15949 DAG.getConstant(31, DAG.getTargetLoweringInfo().getShiftAmountTy(VT));
15950 SDValue T1 = DAG.getNode(ISD::AND, dl, VT,
15951 DAG.getNode(ISD::SRA, dl, VT, Op0, ShAmt), Op1);
15952 SDValue T2 = DAG.getNode(ISD::AND, dl, VT,
15953 DAG.getNode(ISD::SRA, dl, VT, Op1, ShAmt), Op0);
15955 SDValue Fixup = DAG.getNode(ISD::ADD, dl, VT, T1, T2);
15956 Highs = DAG.getNode(ISD::SUB, dl, VT, Highs, Fixup);
15959 // The first result of MUL_LOHI is actually the low value, followed by the
15961 SDValue Ops[] = {Lows, Highs};
15962 return DAG.getMergeValues(Ops, dl);
15965 static SDValue LowerScalarImmediateShift(SDValue Op, SelectionDAG &DAG,
15966 const X86Subtarget *Subtarget) {
15967 MVT VT = Op.getSimpleValueType();
15969 SDValue R = Op.getOperand(0);
15970 SDValue Amt = Op.getOperand(1);
15972 // Optimize shl/srl/sra with constant shift amount.
15973 if (auto *BVAmt = dyn_cast<BuildVectorSDNode>(Amt)) {
15974 if (auto *ShiftConst = BVAmt->getConstantSplatNode()) {
15975 uint64_t ShiftAmt = ShiftConst->getZExtValue();
15977 if (VT == MVT::v2i64 || VT == MVT::v4i32 || VT == MVT::v8i16 ||
15978 (Subtarget->hasInt256() &&
15979 (VT == MVT::v4i64 || VT == MVT::v8i32 || VT == MVT::v16i16)) ||
15980 (Subtarget->hasAVX512() &&
15981 (VT == MVT::v8i64 || VT == MVT::v16i32))) {
15982 if (Op.getOpcode() == ISD::SHL)
15983 return getTargetVShiftByConstNode(X86ISD::VSHLI, dl, VT, R, ShiftAmt,
15985 if (Op.getOpcode() == ISD::SRL)
15986 return getTargetVShiftByConstNode(X86ISD::VSRLI, dl, VT, R, ShiftAmt,
15988 if (Op.getOpcode() == ISD::SRA && VT != MVT::v2i64 && VT != MVT::v4i64)
15989 return getTargetVShiftByConstNode(X86ISD::VSRAI, dl, VT, R, ShiftAmt,
15993 if (VT == MVT::v16i8) {
15994 if (Op.getOpcode() == ISD::SHL) {
15995 // Make a large shift.
15996 SDValue SHL = getTargetVShiftByConstNode(X86ISD::VSHLI, dl,
15997 MVT::v8i16, R, ShiftAmt,
15999 SHL = DAG.getNode(ISD::BITCAST, dl, VT, SHL);
16000 // Zero out the rightmost bits.
16001 SmallVector<SDValue, 16> V(16,
16002 DAG.getConstant(uint8_t(-1U << ShiftAmt),
16004 return DAG.getNode(ISD::AND, dl, VT, SHL,
16005 DAG.getNode(ISD::BUILD_VECTOR, dl, VT, V));
16007 if (Op.getOpcode() == ISD::SRL) {
16008 // Make a large shift.
16009 SDValue SRL = getTargetVShiftByConstNode(X86ISD::VSRLI, dl,
16010 MVT::v8i16, R, ShiftAmt,
16012 SRL = DAG.getNode(ISD::BITCAST, dl, VT, SRL);
16013 // Zero out the leftmost bits.
16014 SmallVector<SDValue, 16> V(16,
16015 DAG.getConstant(uint8_t(-1U) >> ShiftAmt,
16017 return DAG.getNode(ISD::AND, dl, VT, SRL,
16018 DAG.getNode(ISD::BUILD_VECTOR, dl, VT, V));
16020 if (Op.getOpcode() == ISD::SRA) {
16021 if (ShiftAmt == 7) {
16022 // R s>> 7 === R s< 0
16023 SDValue Zeros = getZeroVector(VT, Subtarget, DAG, dl);
16024 return DAG.getNode(X86ISD::PCMPGT, dl, VT, Zeros, R);
16027 // R s>> a === ((R u>> a) ^ m) - m
16028 SDValue Res = DAG.getNode(ISD::SRL, dl, VT, R, Amt);
16029 SmallVector<SDValue, 16> V(16, DAG.getConstant(128 >> ShiftAmt,
16031 SDValue Mask = DAG.getNode(ISD::BUILD_VECTOR, dl, VT, V);
16032 Res = DAG.getNode(ISD::XOR, dl, VT, Res, Mask);
16033 Res = DAG.getNode(ISD::SUB, dl, VT, Res, Mask);
16036 llvm_unreachable("Unknown shift opcode.");
16039 if (Subtarget->hasInt256() && VT == MVT::v32i8) {
16040 if (Op.getOpcode() == ISD::SHL) {
16041 // Make a large shift.
16042 SDValue SHL = getTargetVShiftByConstNode(X86ISD::VSHLI, dl,
16043 MVT::v16i16, R, ShiftAmt,
16045 SHL = DAG.getNode(ISD::BITCAST, dl, VT, SHL);
16046 // Zero out the rightmost bits.
16047 SmallVector<SDValue, 32> V(32,
16048 DAG.getConstant(uint8_t(-1U << ShiftAmt),
16050 return DAG.getNode(ISD::AND, dl, VT, SHL,
16051 DAG.getNode(ISD::BUILD_VECTOR, dl, VT, V));
16053 if (Op.getOpcode() == ISD::SRL) {
16054 // Make a large shift.
16055 SDValue SRL = getTargetVShiftByConstNode(X86ISD::VSRLI, dl,
16056 MVT::v16i16, R, ShiftAmt,
16058 SRL = DAG.getNode(ISD::BITCAST, dl, VT, SRL);
16059 // Zero out the leftmost bits.
16060 SmallVector<SDValue, 32> V(32,
16061 DAG.getConstant(uint8_t(-1U) >> ShiftAmt,
16063 return DAG.getNode(ISD::AND, dl, VT, SRL,
16064 DAG.getNode(ISD::BUILD_VECTOR, dl, VT, V));
16066 if (Op.getOpcode() == ISD::SRA) {
16067 if (ShiftAmt == 7) {
16068 // R s>> 7 === R s< 0
16069 SDValue Zeros = getZeroVector(VT, Subtarget, DAG, dl);
16070 return DAG.getNode(X86ISD::PCMPGT, dl, VT, Zeros, R);
16073 // R s>> a === ((R u>> a) ^ m) - m
16074 SDValue Res = DAG.getNode(ISD::SRL, dl, VT, R, Amt);
16075 SmallVector<SDValue, 32> V(32, DAG.getConstant(128 >> ShiftAmt,
16077 SDValue Mask = DAG.getNode(ISD::BUILD_VECTOR, dl, VT, V);
16078 Res = DAG.getNode(ISD::XOR, dl, VT, Res, Mask);
16079 Res = DAG.getNode(ISD::SUB, dl, VT, Res, Mask);
16082 llvm_unreachable("Unknown shift opcode.");
16087 // Special case in 32-bit mode, where i64 is expanded into high and low parts.
16088 if (!Subtarget->is64Bit() &&
16089 (VT == MVT::v2i64 || (Subtarget->hasInt256() && VT == MVT::v4i64)) &&
16090 Amt.getOpcode() == ISD::BITCAST &&
16091 Amt.getOperand(0).getOpcode() == ISD::BUILD_VECTOR) {
16092 Amt = Amt.getOperand(0);
16093 unsigned Ratio = Amt.getSimpleValueType().getVectorNumElements() /
16094 VT.getVectorNumElements();
16095 unsigned RatioInLog2 = Log2_32_Ceil(Ratio);
16096 uint64_t ShiftAmt = 0;
16097 for (unsigned i = 0; i != Ratio; ++i) {
16098 ConstantSDNode *C = dyn_cast<ConstantSDNode>(Amt.getOperand(i));
16102 ShiftAmt |= C->getZExtValue() << (i * (1 << (6 - RatioInLog2)));
16104 // Check remaining shift amounts.
16105 for (unsigned i = Ratio; i != Amt.getNumOperands(); i += Ratio) {
16106 uint64_t ShAmt = 0;
16107 for (unsigned j = 0; j != Ratio; ++j) {
16108 ConstantSDNode *C =
16109 dyn_cast<ConstantSDNode>(Amt.getOperand(i + j));
16113 ShAmt |= C->getZExtValue() << (j * (1 << (6 - RatioInLog2)));
16115 if (ShAmt != ShiftAmt)
16118 switch (Op.getOpcode()) {
16120 llvm_unreachable("Unknown shift opcode!");
16122 return getTargetVShiftByConstNode(X86ISD::VSHLI, dl, VT, R, ShiftAmt,
16125 return getTargetVShiftByConstNode(X86ISD::VSRLI, dl, VT, R, ShiftAmt,
16128 return getTargetVShiftByConstNode(X86ISD::VSRAI, dl, VT, R, ShiftAmt,
16136 static SDValue LowerScalarVariableShift(SDValue Op, SelectionDAG &DAG,
16137 const X86Subtarget* Subtarget) {
16138 MVT VT = Op.getSimpleValueType();
16140 SDValue R = Op.getOperand(0);
16141 SDValue Amt = Op.getOperand(1);
16143 if ((VT == MVT::v2i64 && Op.getOpcode() != ISD::SRA) ||
16144 VT == MVT::v4i32 || VT == MVT::v8i16 ||
16145 (Subtarget->hasInt256() &&
16146 ((VT == MVT::v4i64 && Op.getOpcode() != ISD::SRA) ||
16147 VT == MVT::v8i32 || VT == MVT::v16i16)) ||
16148 (Subtarget->hasAVX512() && (VT == MVT::v8i64 || VT == MVT::v16i32))) {
16150 EVT EltVT = VT.getVectorElementType();
16152 if (Amt.getOpcode() == ISD::BUILD_VECTOR) {
16153 unsigned NumElts = VT.getVectorNumElements();
16155 for (i = 0; i != NumElts; ++i) {
16156 if (Amt.getOperand(i).getOpcode() == ISD::UNDEF)
16160 for (j = i; j != NumElts; ++j) {
16161 SDValue Arg = Amt.getOperand(j);
16162 if (Arg.getOpcode() == ISD::UNDEF) continue;
16163 if (Arg != Amt.getOperand(i))
16166 if (i != NumElts && j == NumElts)
16167 BaseShAmt = Amt.getOperand(i);
16169 if (Amt.getOpcode() == ISD::EXTRACT_SUBVECTOR)
16170 Amt = Amt.getOperand(0);
16171 if (Amt.getOpcode() == ISD::VECTOR_SHUFFLE &&
16172 cast<ShuffleVectorSDNode>(Amt)->isSplat()) {
16173 SDValue InVec = Amt.getOperand(0);
16174 if (InVec.getOpcode() == ISD::BUILD_VECTOR) {
16175 unsigned NumElts = InVec.getValueType().getVectorNumElements();
16177 for (; i != NumElts; ++i) {
16178 SDValue Arg = InVec.getOperand(i);
16179 if (Arg.getOpcode() == ISD::UNDEF) continue;
16183 } else if (InVec.getOpcode() == ISD::INSERT_VECTOR_ELT) {
16184 if (ConstantSDNode *C =
16185 dyn_cast<ConstantSDNode>(InVec.getOperand(2))) {
16186 unsigned SplatIdx =
16187 cast<ShuffleVectorSDNode>(Amt)->getSplatIndex();
16188 if (C->getZExtValue() == SplatIdx)
16189 BaseShAmt = InVec.getOperand(1);
16192 if (!BaseShAmt.getNode())
16193 BaseShAmt = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, EltVT, Amt,
16194 DAG.getIntPtrConstant(0));
16198 if (BaseShAmt.getNode()) {
16199 if (EltVT.bitsGT(MVT::i32))
16200 BaseShAmt = DAG.getNode(ISD::TRUNCATE, dl, MVT::i32, BaseShAmt);
16201 else if (EltVT.bitsLT(MVT::i32))
16202 BaseShAmt = DAG.getNode(ISD::ZERO_EXTEND, dl, MVT::i32, BaseShAmt);
16204 switch (Op.getOpcode()) {
16206 llvm_unreachable("Unknown shift opcode!");
16208 switch (VT.SimpleTy) {
16209 default: return SDValue();
16218 return getTargetVShiftNode(X86ISD::VSHLI, dl, VT, R, BaseShAmt, DAG);
16221 switch (VT.SimpleTy) {
16222 default: return SDValue();
16229 return getTargetVShiftNode(X86ISD::VSRAI, dl, VT, R, BaseShAmt, DAG);
16232 switch (VT.SimpleTy) {
16233 default: return SDValue();
16242 return getTargetVShiftNode(X86ISD::VSRLI, dl, VT, R, BaseShAmt, DAG);
16248 // Special case in 32-bit mode, where i64 is expanded into high and low parts.
16249 if (!Subtarget->is64Bit() &&
16250 (VT == MVT::v2i64 || (Subtarget->hasInt256() && VT == MVT::v4i64) ||
16251 (Subtarget->hasAVX512() && VT == MVT::v8i64)) &&
16252 Amt.getOpcode() == ISD::BITCAST &&
16253 Amt.getOperand(0).getOpcode() == ISD::BUILD_VECTOR) {
16254 Amt = Amt.getOperand(0);
16255 unsigned Ratio = Amt.getSimpleValueType().getVectorNumElements() /
16256 VT.getVectorNumElements();
16257 std::vector<SDValue> Vals(Ratio);
16258 for (unsigned i = 0; i != Ratio; ++i)
16259 Vals[i] = Amt.getOperand(i);
16260 for (unsigned i = Ratio; i != Amt.getNumOperands(); i += Ratio) {
16261 for (unsigned j = 0; j != Ratio; ++j)
16262 if (Vals[j] != Amt.getOperand(i + j))
16265 switch (Op.getOpcode()) {
16267 llvm_unreachable("Unknown shift opcode!");
16269 return DAG.getNode(X86ISD::VSHL, dl, VT, R, Op.getOperand(1));
16271 return DAG.getNode(X86ISD::VSRL, dl, VT, R, Op.getOperand(1));
16273 return DAG.getNode(X86ISD::VSRA, dl, VT, R, Op.getOperand(1));
16280 static SDValue LowerShift(SDValue Op, const X86Subtarget* Subtarget,
16281 SelectionDAG &DAG) {
16282 MVT VT = Op.getSimpleValueType();
16284 SDValue R = Op.getOperand(0);
16285 SDValue Amt = Op.getOperand(1);
16288 assert(VT.isVector() && "Custom lowering only for vector shifts!");
16289 assert(Subtarget->hasSSE2() && "Only custom lower when we have SSE2!");
16291 V = LowerScalarImmediateShift(Op, DAG, Subtarget);
16295 V = LowerScalarVariableShift(Op, DAG, Subtarget);
16299 if (Subtarget->hasAVX512() && (VT == MVT::v16i32 || VT == MVT::v8i64))
16301 // AVX2 has VPSLLV/VPSRAV/VPSRLV.
16302 if (Subtarget->hasInt256()) {
16303 if (Op.getOpcode() == ISD::SRL &&
16304 (VT == MVT::v2i64 || VT == MVT::v4i32 ||
16305 VT == MVT::v4i64 || VT == MVT::v8i32))
16307 if (Op.getOpcode() == ISD::SHL &&
16308 (VT == MVT::v2i64 || VT == MVT::v4i32 ||
16309 VT == MVT::v4i64 || VT == MVT::v8i32))
16311 if (Op.getOpcode() == ISD::SRA && (VT == MVT::v4i32 || VT == MVT::v8i32))
16315 // If possible, lower this packed shift into a vector multiply instead of
16316 // expanding it into a sequence of scalar shifts.
16317 // Do this only if the vector shift count is a constant build_vector.
16318 if (Op.getOpcode() == ISD::SHL &&
16319 (VT == MVT::v8i16 || VT == MVT::v4i32 ||
16320 (Subtarget->hasInt256() && VT == MVT::v16i16)) &&
16321 ISD::isBuildVectorOfConstantSDNodes(Amt.getNode())) {
16322 SmallVector<SDValue, 8> Elts;
16323 EVT SVT = VT.getScalarType();
16324 unsigned SVTBits = SVT.getSizeInBits();
16325 const APInt &One = APInt(SVTBits, 1);
16326 unsigned NumElems = VT.getVectorNumElements();
16328 for (unsigned i=0; i !=NumElems; ++i) {
16329 SDValue Op = Amt->getOperand(i);
16330 if (Op->getOpcode() == ISD::UNDEF) {
16331 Elts.push_back(Op);
16335 ConstantSDNode *ND = cast<ConstantSDNode>(Op);
16336 const APInt &C = APInt(SVTBits, ND->getAPIntValue().getZExtValue());
16337 uint64_t ShAmt = C.getZExtValue();
16338 if (ShAmt >= SVTBits) {
16339 Elts.push_back(DAG.getUNDEF(SVT));
16342 Elts.push_back(DAG.getConstant(One.shl(ShAmt), SVT));
16344 SDValue BV = DAG.getNode(ISD::BUILD_VECTOR, dl, VT, Elts);
16345 return DAG.getNode(ISD::MUL, dl, VT, R, BV);
16348 // Lower SHL with variable shift amount.
16349 if (VT == MVT::v4i32 && Op->getOpcode() == ISD::SHL) {
16350 Op = DAG.getNode(ISD::SHL, dl, VT, Amt, DAG.getConstant(23, VT));
16352 Op = DAG.getNode(ISD::ADD, dl, VT, Op, DAG.getConstant(0x3f800000U, VT));
16353 Op = DAG.getNode(ISD::BITCAST, dl, MVT::v4f32, Op);
16354 Op = DAG.getNode(ISD::FP_TO_SINT, dl, VT, Op);
16355 return DAG.getNode(ISD::MUL, dl, VT, Op, R);
16358 // If possible, lower this shift as a sequence of two shifts by
16359 // constant plus a MOVSS/MOVSD instead of scalarizing it.
16361 // (v4i32 (srl A, (build_vector < X, Y, Y, Y>)))
16363 // Could be rewritten as:
16364 // (v4i32 (MOVSS (srl A, <Y,Y,Y,Y>), (srl A, <X,X,X,X>)))
16366 // The advantage is that the two shifts from the example would be
16367 // lowered as X86ISD::VSRLI nodes. This would be cheaper than scalarizing
16368 // the vector shift into four scalar shifts plus four pairs of vector
16370 if ((VT == MVT::v8i16 || VT == MVT::v4i32) &&
16371 ISD::isBuildVectorOfConstantSDNodes(Amt.getNode())) {
16372 unsigned TargetOpcode = X86ISD::MOVSS;
16373 bool CanBeSimplified;
16374 // The splat value for the first packed shift (the 'X' from the example).
16375 SDValue Amt1 = Amt->getOperand(0);
16376 // The splat value for the second packed shift (the 'Y' from the example).
16377 SDValue Amt2 = (VT == MVT::v4i32) ? Amt->getOperand(1) :
16378 Amt->getOperand(2);
16380 // See if it is possible to replace this node with a sequence of
16381 // two shifts followed by a MOVSS/MOVSD
16382 if (VT == MVT::v4i32) {
16383 // Check if it is legal to use a MOVSS.
16384 CanBeSimplified = Amt2 == Amt->getOperand(2) &&
16385 Amt2 == Amt->getOperand(3);
16386 if (!CanBeSimplified) {
16387 // Otherwise, check if we can still simplify this node using a MOVSD.
16388 CanBeSimplified = Amt1 == Amt->getOperand(1) &&
16389 Amt->getOperand(2) == Amt->getOperand(3);
16390 TargetOpcode = X86ISD::MOVSD;
16391 Amt2 = Amt->getOperand(2);
16394 // Do similar checks for the case where the machine value type
16396 CanBeSimplified = Amt1 == Amt->getOperand(1);
16397 for (unsigned i=3; i != 8 && CanBeSimplified; ++i)
16398 CanBeSimplified = Amt2 == Amt->getOperand(i);
16400 if (!CanBeSimplified) {
16401 TargetOpcode = X86ISD::MOVSD;
16402 CanBeSimplified = true;
16403 Amt2 = Amt->getOperand(4);
16404 for (unsigned i=0; i != 4 && CanBeSimplified; ++i)
16405 CanBeSimplified = Amt1 == Amt->getOperand(i);
16406 for (unsigned j=4; j != 8 && CanBeSimplified; ++j)
16407 CanBeSimplified = Amt2 == Amt->getOperand(j);
16411 if (CanBeSimplified && isa<ConstantSDNode>(Amt1) &&
16412 isa<ConstantSDNode>(Amt2)) {
16413 // Replace this node with two shifts followed by a MOVSS/MOVSD.
16414 EVT CastVT = MVT::v4i32;
16416 DAG.getConstant(cast<ConstantSDNode>(Amt1)->getAPIntValue(), VT);
16417 SDValue Shift1 = DAG.getNode(Op->getOpcode(), dl, VT, R, Splat1);
16419 DAG.getConstant(cast<ConstantSDNode>(Amt2)->getAPIntValue(), VT);
16420 SDValue Shift2 = DAG.getNode(Op->getOpcode(), dl, VT, R, Splat2);
16421 if (TargetOpcode == X86ISD::MOVSD)
16422 CastVT = MVT::v2i64;
16423 SDValue BitCast1 = DAG.getNode(ISD::BITCAST, dl, CastVT, Shift1);
16424 SDValue BitCast2 = DAG.getNode(ISD::BITCAST, dl, CastVT, Shift2);
16425 SDValue Result = getTargetShuffleNode(TargetOpcode, dl, CastVT, BitCast2,
16427 return DAG.getNode(ISD::BITCAST, dl, VT, Result);
16431 if (VT == MVT::v16i8 && Op->getOpcode() == ISD::SHL) {
16432 assert(Subtarget->hasSSE2() && "Need SSE2 for pslli/pcmpeq.");
16435 Op = DAG.getNode(ISD::SHL, dl, VT, Amt, DAG.getConstant(5, VT));
16436 Op = DAG.getNode(ISD::BITCAST, dl, VT, Op);
16438 // Turn 'a' into a mask suitable for VSELECT
16439 SDValue VSelM = DAG.getConstant(0x80, VT);
16440 SDValue OpVSel = DAG.getNode(ISD::AND, dl, VT, VSelM, Op);
16441 OpVSel = DAG.getNode(X86ISD::PCMPEQ, dl, VT, OpVSel, VSelM);
16443 SDValue CM1 = DAG.getConstant(0x0f, VT);
16444 SDValue CM2 = DAG.getConstant(0x3f, VT);
16446 // r = VSELECT(r, psllw(r & (char16)15, 4), a);
16447 SDValue M = DAG.getNode(ISD::AND, dl, VT, R, CM1);
16448 M = getTargetVShiftByConstNode(X86ISD::VSHLI, dl, MVT::v8i16, M, 4, DAG);
16449 M = DAG.getNode(ISD::BITCAST, dl, VT, M);
16450 R = DAG.getNode(ISD::VSELECT, dl, VT, OpVSel, M, R);
16453 Op = DAG.getNode(ISD::ADD, dl, VT, Op, Op);
16454 OpVSel = DAG.getNode(ISD::AND, dl, VT, VSelM, Op);
16455 OpVSel = DAG.getNode(X86ISD::PCMPEQ, dl, VT, OpVSel, VSelM);
16457 // r = VSELECT(r, psllw(r & (char16)63, 2), a);
16458 M = DAG.getNode(ISD::AND, dl, VT, R, CM2);
16459 M = getTargetVShiftByConstNode(X86ISD::VSHLI, dl, MVT::v8i16, M, 2, DAG);
16460 M = DAG.getNode(ISD::BITCAST, dl, VT, M);
16461 R = DAG.getNode(ISD::VSELECT, dl, VT, OpVSel, M, R);
16464 Op = DAG.getNode(ISD::ADD, dl, VT, Op, Op);
16465 OpVSel = DAG.getNode(ISD::AND, dl, VT, VSelM, Op);
16466 OpVSel = DAG.getNode(X86ISD::PCMPEQ, dl, VT, OpVSel, VSelM);
16468 // return VSELECT(r, r+r, a);
16469 R = DAG.getNode(ISD::VSELECT, dl, VT, OpVSel,
16470 DAG.getNode(ISD::ADD, dl, VT, R, R), R);
16474 // It's worth extending once and using the v8i32 shifts for 16-bit types, but
16475 // the extra overheads to get from v16i8 to v8i32 make the existing SSE
16476 // solution better.
16477 if (Subtarget->hasInt256() && VT == MVT::v8i16) {
16478 MVT NewVT = VT == MVT::v8i16 ? MVT::v8i32 : MVT::v16i16;
16480 Op.getOpcode() == ISD::SRA ? ISD::SIGN_EXTEND : ISD::ZERO_EXTEND;
16481 R = DAG.getNode(ExtOpc, dl, NewVT, R);
16482 Amt = DAG.getNode(ISD::ANY_EXTEND, dl, NewVT, Amt);
16483 return DAG.getNode(ISD::TRUNCATE, dl, VT,
16484 DAG.getNode(Op.getOpcode(), dl, NewVT, R, Amt));
16487 // Decompose 256-bit shifts into smaller 128-bit shifts.
16488 if (VT.is256BitVector()) {
16489 unsigned NumElems = VT.getVectorNumElements();
16490 MVT EltVT = VT.getVectorElementType();
16491 EVT NewVT = MVT::getVectorVT(EltVT, NumElems/2);
16493 // Extract the two vectors
16494 SDValue V1 = Extract128BitVector(R, 0, DAG, dl);
16495 SDValue V2 = Extract128BitVector(R, NumElems/2, DAG, dl);
16497 // Recreate the shift amount vectors
16498 SDValue Amt1, Amt2;
16499 if (Amt.getOpcode() == ISD::BUILD_VECTOR) {
16500 // Constant shift amount
16501 SmallVector<SDValue, 4> Amt1Csts;
16502 SmallVector<SDValue, 4> Amt2Csts;
16503 for (unsigned i = 0; i != NumElems/2; ++i)
16504 Amt1Csts.push_back(Amt->getOperand(i));
16505 for (unsigned i = NumElems/2; i != NumElems; ++i)
16506 Amt2Csts.push_back(Amt->getOperand(i));
16508 Amt1 = DAG.getNode(ISD::BUILD_VECTOR, dl, NewVT, Amt1Csts);
16509 Amt2 = DAG.getNode(ISD::BUILD_VECTOR, dl, NewVT, Amt2Csts);
16511 // Variable shift amount
16512 Amt1 = Extract128BitVector(Amt, 0, DAG, dl);
16513 Amt2 = Extract128BitVector(Amt, NumElems/2, DAG, dl);
16516 // Issue new vector shifts for the smaller types
16517 V1 = DAG.getNode(Op.getOpcode(), dl, NewVT, V1, Amt1);
16518 V2 = DAG.getNode(Op.getOpcode(), dl, NewVT, V2, Amt2);
16520 // Concatenate the result back
16521 return DAG.getNode(ISD::CONCAT_VECTORS, dl, VT, V1, V2);
16527 static SDValue LowerXALUO(SDValue Op, SelectionDAG &DAG) {
16528 // Lower the "add/sub/mul with overflow" instruction into a regular ins plus
16529 // a "setcc" instruction that checks the overflow flag. The "brcond" lowering
16530 // looks for this combo and may remove the "setcc" instruction if the "setcc"
16531 // has only one use.
16532 SDNode *N = Op.getNode();
16533 SDValue LHS = N->getOperand(0);
16534 SDValue RHS = N->getOperand(1);
16535 unsigned BaseOp = 0;
16538 switch (Op.getOpcode()) {
16539 default: llvm_unreachable("Unknown ovf instruction!");
16541 // A subtract of one will be selected as a INC. Note that INC doesn't
16542 // set CF, so we can't do this for UADDO.
16543 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(RHS))
16545 BaseOp = X86ISD::INC;
16546 Cond = X86::COND_O;
16549 BaseOp = X86ISD::ADD;
16550 Cond = X86::COND_O;
16553 BaseOp = X86ISD::ADD;
16554 Cond = X86::COND_B;
16557 // A subtract of one will be selected as a DEC. Note that DEC doesn't
16558 // set CF, so we can't do this for USUBO.
16559 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(RHS))
16561 BaseOp = X86ISD::DEC;
16562 Cond = X86::COND_O;
16565 BaseOp = X86ISD::SUB;
16566 Cond = X86::COND_O;
16569 BaseOp = X86ISD::SUB;
16570 Cond = X86::COND_B;
16573 BaseOp = X86ISD::SMUL;
16574 Cond = X86::COND_O;
16576 case ISD::UMULO: { // i64, i8 = umulo lhs, rhs --> i64, i64, i32 umul lhs,rhs
16577 SDVTList VTs = DAG.getVTList(N->getValueType(0), N->getValueType(0),
16579 SDValue Sum = DAG.getNode(X86ISD::UMUL, DL, VTs, LHS, RHS);
16582 DAG.getNode(X86ISD::SETCC, DL, MVT::i8,
16583 DAG.getConstant(X86::COND_O, MVT::i32),
16584 SDValue(Sum.getNode(), 2));
16586 return DAG.getNode(ISD::MERGE_VALUES, DL, N->getVTList(), Sum, SetCC);
16590 // Also sets EFLAGS.
16591 SDVTList VTs = DAG.getVTList(N->getValueType(0), MVT::i32);
16592 SDValue Sum = DAG.getNode(BaseOp, DL, VTs, LHS, RHS);
16595 DAG.getNode(X86ISD::SETCC, DL, N->getValueType(1),
16596 DAG.getConstant(Cond, MVT::i32),
16597 SDValue(Sum.getNode(), 1));
16599 return DAG.getNode(ISD::MERGE_VALUES, DL, N->getVTList(), Sum, SetCC);
16602 // Sign extension of the low part of vector elements. This may be used either
16603 // when sign extend instructions are not available or if the vector element
16604 // sizes already match the sign-extended size. If the vector elements are in
16605 // their pre-extended size and sign extend instructions are available, that will
16606 // be handled by LowerSIGN_EXTEND.
16607 SDValue X86TargetLowering::LowerSIGN_EXTEND_INREG(SDValue Op,
16608 SelectionDAG &DAG) const {
16610 EVT ExtraVT = cast<VTSDNode>(Op.getOperand(1))->getVT();
16611 MVT VT = Op.getSimpleValueType();
16613 if (!Subtarget->hasSSE2() || !VT.isVector())
16616 unsigned BitsDiff = VT.getScalarType().getSizeInBits() -
16617 ExtraVT.getScalarType().getSizeInBits();
16619 switch (VT.SimpleTy) {
16620 default: return SDValue();
16623 if (!Subtarget->hasFp256())
16625 if (!Subtarget->hasInt256()) {
16626 // needs to be split
16627 unsigned NumElems = VT.getVectorNumElements();
16629 // Extract the LHS vectors
16630 SDValue LHS = Op.getOperand(0);
16631 SDValue LHS1 = Extract128BitVector(LHS, 0, DAG, dl);
16632 SDValue LHS2 = Extract128BitVector(LHS, NumElems/2, DAG, dl);
16634 MVT EltVT = VT.getVectorElementType();
16635 EVT NewVT = MVT::getVectorVT(EltVT, NumElems/2);
16637 EVT ExtraEltVT = ExtraVT.getVectorElementType();
16638 unsigned ExtraNumElems = ExtraVT.getVectorNumElements();
16639 ExtraVT = EVT::getVectorVT(*DAG.getContext(), ExtraEltVT,
16641 SDValue Extra = DAG.getValueType(ExtraVT);
16643 LHS1 = DAG.getNode(Op.getOpcode(), dl, NewVT, LHS1, Extra);
16644 LHS2 = DAG.getNode(Op.getOpcode(), dl, NewVT, LHS2, Extra);
16646 return DAG.getNode(ISD::CONCAT_VECTORS, dl, VT, LHS1, LHS2);
16651 SDValue Op0 = Op.getOperand(0);
16653 // This is a sign extension of some low part of vector elements without
16654 // changing the size of the vector elements themselves:
16655 // Shift-Left + Shift-Right-Algebraic.
16656 SDValue Shl = getTargetVShiftByConstNode(X86ISD::VSHLI, dl, VT, Op0,
16658 return getTargetVShiftByConstNode(X86ISD::VSRAI, dl, VT, Shl, BitsDiff,
16664 static SDValue LowerATOMIC_FENCE(SDValue Op, const X86Subtarget *Subtarget,
16665 SelectionDAG &DAG) {
16667 AtomicOrdering FenceOrdering = static_cast<AtomicOrdering>(
16668 cast<ConstantSDNode>(Op.getOperand(1))->getZExtValue());
16669 SynchronizationScope FenceScope = static_cast<SynchronizationScope>(
16670 cast<ConstantSDNode>(Op.getOperand(2))->getZExtValue());
16672 // The only fence that needs an instruction is a sequentially-consistent
16673 // cross-thread fence.
16674 if (FenceOrdering == SequentiallyConsistent && FenceScope == CrossThread) {
16675 // Use mfence if we have SSE2 or we're on x86-64 (even if we asked for
16676 // no-sse2). There isn't any reason to disable it if the target processor
16678 if (Subtarget->hasSSE2() || Subtarget->is64Bit())
16679 return DAG.getNode(X86ISD::MFENCE, dl, MVT::Other, Op.getOperand(0));
16681 SDValue Chain = Op.getOperand(0);
16682 SDValue Zero = DAG.getConstant(0, MVT::i32);
16684 DAG.getRegister(X86::ESP, MVT::i32), // Base
16685 DAG.getTargetConstant(1, MVT::i8), // Scale
16686 DAG.getRegister(0, MVT::i32), // Index
16687 DAG.getTargetConstant(0, MVT::i32), // Disp
16688 DAG.getRegister(0, MVT::i32), // Segment.
16692 SDNode *Res = DAG.getMachineNode(X86::OR32mrLocked, dl, MVT::Other, Ops);
16693 return SDValue(Res, 0);
16696 // MEMBARRIER is a compiler barrier; it codegens to a no-op.
16697 return DAG.getNode(X86ISD::MEMBARRIER, dl, MVT::Other, Op.getOperand(0));
16700 static SDValue LowerCMP_SWAP(SDValue Op, const X86Subtarget *Subtarget,
16701 SelectionDAG &DAG) {
16702 MVT T = Op.getSimpleValueType();
16706 switch(T.SimpleTy) {
16707 default: llvm_unreachable("Invalid value type!");
16708 case MVT::i8: Reg = X86::AL; size = 1; break;
16709 case MVT::i16: Reg = X86::AX; size = 2; break;
16710 case MVT::i32: Reg = X86::EAX; size = 4; break;
16712 assert(Subtarget->is64Bit() && "Node not type legal!");
16713 Reg = X86::RAX; size = 8;
16716 SDValue cpIn = DAG.getCopyToReg(Op.getOperand(0), DL, Reg,
16717 Op.getOperand(2), SDValue());
16718 SDValue Ops[] = { cpIn.getValue(0),
16721 DAG.getTargetConstant(size, MVT::i8),
16722 cpIn.getValue(1) };
16723 SDVTList Tys = DAG.getVTList(MVT::Other, MVT::Glue);
16724 MachineMemOperand *MMO = cast<AtomicSDNode>(Op)->getMemOperand();
16725 SDValue Result = DAG.getMemIntrinsicNode(X86ISD::LCMPXCHG_DAG, DL, Tys,
16729 DAG.getCopyFromReg(Result.getValue(0), DL, Reg, T, Result.getValue(1));
16730 SDValue EFLAGS = DAG.getCopyFromReg(cpOut.getValue(1), DL, X86::EFLAGS,
16731 MVT::i32, cpOut.getValue(2));
16732 SDValue Success = DAG.getNode(X86ISD::SETCC, DL, Op->getValueType(1),
16733 DAG.getConstant(X86::COND_E, MVT::i8), EFLAGS);
16735 DAG.ReplaceAllUsesOfValueWith(Op.getValue(0), cpOut);
16736 DAG.ReplaceAllUsesOfValueWith(Op.getValue(1), Success);
16737 DAG.ReplaceAllUsesOfValueWith(Op.getValue(2), EFLAGS.getValue(1));
16741 static SDValue LowerBITCAST(SDValue Op, const X86Subtarget *Subtarget,
16742 SelectionDAG &DAG) {
16743 MVT SrcVT = Op.getOperand(0).getSimpleValueType();
16744 MVT DstVT = Op.getSimpleValueType();
16746 if (SrcVT == MVT::v2i32 || SrcVT == MVT::v4i16 || SrcVT == MVT::v8i8) {
16747 assert(Subtarget->hasSSE2() && "Requires at least SSE2!");
16748 if (DstVT != MVT::f64)
16749 // This conversion needs to be expanded.
16752 SDValue InVec = Op->getOperand(0);
16754 unsigned NumElts = SrcVT.getVectorNumElements();
16755 EVT SVT = SrcVT.getVectorElementType();
16757 // Widen the vector in input in the case of MVT::v2i32.
16758 // Example: from MVT::v2i32 to MVT::v4i32.
16759 SmallVector<SDValue, 16> Elts;
16760 for (unsigned i = 0, e = NumElts; i != e; ++i)
16761 Elts.push_back(DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, SVT, InVec,
16762 DAG.getIntPtrConstant(i)));
16764 // Explicitly mark the extra elements as Undef.
16765 SDValue Undef = DAG.getUNDEF(SVT);
16766 for (unsigned i = NumElts, e = NumElts * 2; i != e; ++i)
16767 Elts.push_back(Undef);
16769 EVT NewVT = EVT::getVectorVT(*DAG.getContext(), SVT, NumElts * 2);
16770 SDValue BV = DAG.getNode(ISD::BUILD_VECTOR, dl, NewVT, Elts);
16771 SDValue ToV2F64 = DAG.getNode(ISD::BITCAST, dl, MVT::v2f64, BV);
16772 return DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::f64, ToV2F64,
16773 DAG.getIntPtrConstant(0));
16776 assert(Subtarget->is64Bit() && !Subtarget->hasSSE2() &&
16777 Subtarget->hasMMX() && "Unexpected custom BITCAST");
16778 assert((DstVT == MVT::i64 ||
16779 (DstVT.isVector() && DstVT.getSizeInBits()==64)) &&
16780 "Unexpected custom BITCAST");
16781 // i64 <=> MMX conversions are Legal.
16782 if (SrcVT==MVT::i64 && DstVT.isVector())
16784 if (DstVT==MVT::i64 && SrcVT.isVector())
16786 // MMX <=> MMX conversions are Legal.
16787 if (SrcVT.isVector() && DstVT.isVector())
16789 // All other conversions need to be expanded.
16793 static SDValue LowerLOAD_SUB(SDValue Op, SelectionDAG &DAG) {
16794 SDNode *Node = Op.getNode();
16796 EVT T = Node->getValueType(0);
16797 SDValue negOp = DAG.getNode(ISD::SUB, dl, T,
16798 DAG.getConstant(0, T), Node->getOperand(2));
16799 return DAG.getAtomic(ISD::ATOMIC_LOAD_ADD, dl,
16800 cast<AtomicSDNode>(Node)->getMemoryVT(),
16801 Node->getOperand(0),
16802 Node->getOperand(1), negOp,
16803 cast<AtomicSDNode>(Node)->getMemOperand(),
16804 cast<AtomicSDNode>(Node)->getOrdering(),
16805 cast<AtomicSDNode>(Node)->getSynchScope());
16808 static SDValue LowerATOMIC_STORE(SDValue Op, SelectionDAG &DAG) {
16809 SDNode *Node = Op.getNode();
16811 EVT VT = cast<AtomicSDNode>(Node)->getMemoryVT();
16813 // Convert seq_cst store -> xchg
16814 // Convert wide store -> swap (-> cmpxchg8b/cmpxchg16b)
16815 // FIXME: On 32-bit, store -> fist or movq would be more efficient
16816 // (The only way to get a 16-byte store is cmpxchg16b)
16817 // FIXME: 16-byte ATOMIC_SWAP isn't actually hooked up at the moment.
16818 if (cast<AtomicSDNode>(Node)->getOrdering() == SequentiallyConsistent ||
16819 !DAG.getTargetLoweringInfo().isTypeLegal(VT)) {
16820 SDValue Swap = DAG.getAtomic(ISD::ATOMIC_SWAP, dl,
16821 cast<AtomicSDNode>(Node)->getMemoryVT(),
16822 Node->getOperand(0),
16823 Node->getOperand(1), Node->getOperand(2),
16824 cast<AtomicSDNode>(Node)->getMemOperand(),
16825 cast<AtomicSDNode>(Node)->getOrdering(),
16826 cast<AtomicSDNode>(Node)->getSynchScope());
16827 return Swap.getValue(1);
16829 // Other atomic stores have a simple pattern.
16833 static SDValue LowerADDC_ADDE_SUBC_SUBE(SDValue Op, SelectionDAG &DAG) {
16834 EVT VT = Op.getNode()->getSimpleValueType(0);
16836 // Let legalize expand this if it isn't a legal type yet.
16837 if (!DAG.getTargetLoweringInfo().isTypeLegal(VT))
16840 SDVTList VTs = DAG.getVTList(VT, MVT::i32);
16843 bool ExtraOp = false;
16844 switch (Op.getOpcode()) {
16845 default: llvm_unreachable("Invalid code");
16846 case ISD::ADDC: Opc = X86ISD::ADD; break;
16847 case ISD::ADDE: Opc = X86ISD::ADC; ExtraOp = true; break;
16848 case ISD::SUBC: Opc = X86ISD::SUB; break;
16849 case ISD::SUBE: Opc = X86ISD::SBB; ExtraOp = true; break;
16853 return DAG.getNode(Opc, SDLoc(Op), VTs, Op.getOperand(0),
16855 return DAG.getNode(Opc, SDLoc(Op), VTs, Op.getOperand(0),
16856 Op.getOperand(1), Op.getOperand(2));
16859 static SDValue LowerFSINCOS(SDValue Op, const X86Subtarget *Subtarget,
16860 SelectionDAG &DAG) {
16861 assert(Subtarget->isTargetDarwin() && Subtarget->is64Bit());
16863 // For MacOSX, we want to call an alternative entry point: __sincos_stret,
16864 // which returns the values as { float, float } (in XMM0) or
16865 // { double, double } (which is returned in XMM0, XMM1).
16867 SDValue Arg = Op.getOperand(0);
16868 EVT ArgVT = Arg.getValueType();
16869 Type *ArgTy = ArgVT.getTypeForEVT(*DAG.getContext());
16871 TargetLowering::ArgListTy Args;
16872 TargetLowering::ArgListEntry Entry;
16876 Entry.isSExt = false;
16877 Entry.isZExt = false;
16878 Args.push_back(Entry);
16880 bool isF64 = ArgVT == MVT::f64;
16881 // Only optimize x86_64 for now. i386 is a bit messy. For f32,
16882 // the small struct {f32, f32} is returned in (eax, edx). For f64,
16883 // the results are returned via SRet in memory.
16884 const char *LibcallName = isF64 ? "__sincos_stret" : "__sincosf_stret";
16885 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
16886 SDValue Callee = DAG.getExternalSymbol(LibcallName, TLI.getPointerTy());
16888 Type *RetTy = isF64
16889 ? (Type*)StructType::get(ArgTy, ArgTy, NULL)
16890 : (Type*)VectorType::get(ArgTy, 4);
16892 TargetLowering::CallLoweringInfo CLI(DAG);
16893 CLI.setDebugLoc(dl).setChain(DAG.getEntryNode())
16894 .setCallee(CallingConv::C, RetTy, Callee, std::move(Args), 0);
16896 std::pair<SDValue, SDValue> CallResult = TLI.LowerCallTo(CLI);
16899 // Returned in xmm0 and xmm1.
16900 return CallResult.first;
16902 // Returned in bits 0:31 and 32:64 xmm0.
16903 SDValue SinVal = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, ArgVT,
16904 CallResult.first, DAG.getIntPtrConstant(0));
16905 SDValue CosVal = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, ArgVT,
16906 CallResult.first, DAG.getIntPtrConstant(1));
16907 SDVTList Tys = DAG.getVTList(ArgVT, ArgVT);
16908 return DAG.getNode(ISD::MERGE_VALUES, dl, Tys, SinVal, CosVal);
16911 /// LowerOperation - Provide custom lowering hooks for some operations.
16913 SDValue X86TargetLowering::LowerOperation(SDValue Op, SelectionDAG &DAG) const {
16914 switch (Op.getOpcode()) {
16915 default: llvm_unreachable("Should not custom lower this!");
16916 case ISD::SIGN_EXTEND_INREG: return LowerSIGN_EXTEND_INREG(Op,DAG);
16917 case ISD::ATOMIC_FENCE: return LowerATOMIC_FENCE(Op, Subtarget, DAG);
16918 case ISD::ATOMIC_CMP_SWAP_WITH_SUCCESS:
16919 return LowerCMP_SWAP(Op, Subtarget, DAG);
16920 case ISD::ATOMIC_LOAD_SUB: return LowerLOAD_SUB(Op,DAG);
16921 case ISD::ATOMIC_STORE: return LowerATOMIC_STORE(Op,DAG);
16922 case ISD::BUILD_VECTOR: return LowerBUILD_VECTOR(Op, DAG);
16923 case ISD::CONCAT_VECTORS: return LowerCONCAT_VECTORS(Op, DAG);
16924 case ISD::VECTOR_SHUFFLE: return LowerVECTOR_SHUFFLE(Op, DAG);
16925 case ISD::VSELECT: return LowerVSELECT(Op, DAG);
16926 case ISD::EXTRACT_VECTOR_ELT: return LowerEXTRACT_VECTOR_ELT(Op, DAG);
16927 case ISD::INSERT_VECTOR_ELT: return LowerINSERT_VECTOR_ELT(Op, DAG);
16928 case ISD::EXTRACT_SUBVECTOR: return LowerEXTRACT_SUBVECTOR(Op,Subtarget,DAG);
16929 case ISD::INSERT_SUBVECTOR: return LowerINSERT_SUBVECTOR(Op, Subtarget,DAG);
16930 case ISD::SCALAR_TO_VECTOR: return LowerSCALAR_TO_VECTOR(Op, DAG);
16931 case ISD::ConstantPool: return LowerConstantPool(Op, DAG);
16932 case ISD::GlobalAddress: return LowerGlobalAddress(Op, DAG);
16933 case ISD::GlobalTLSAddress: return LowerGlobalTLSAddress(Op, DAG);
16934 case ISD::ExternalSymbol: return LowerExternalSymbol(Op, DAG);
16935 case ISD::BlockAddress: return LowerBlockAddress(Op, DAG);
16936 case ISD::SHL_PARTS:
16937 case ISD::SRA_PARTS:
16938 case ISD::SRL_PARTS: return LowerShiftParts(Op, DAG);
16939 case ISD::SINT_TO_FP: return LowerSINT_TO_FP(Op, DAG);
16940 case ISD::UINT_TO_FP: return LowerUINT_TO_FP(Op, DAG);
16941 case ISD::TRUNCATE: return LowerTRUNCATE(Op, DAG);
16942 case ISD::ZERO_EXTEND: return LowerZERO_EXTEND(Op, Subtarget, DAG);
16943 case ISD::SIGN_EXTEND: return LowerSIGN_EXTEND(Op, Subtarget, DAG);
16944 case ISD::ANY_EXTEND: return LowerANY_EXTEND(Op, Subtarget, DAG);
16945 case ISD::FP_TO_SINT: return LowerFP_TO_SINT(Op, DAG);
16946 case ISD::FP_TO_UINT: return LowerFP_TO_UINT(Op, DAG);
16947 case ISD::FP_EXTEND: return LowerFP_EXTEND(Op, DAG);
16948 case ISD::LOAD: return LowerExtendedLoad(Op, Subtarget, DAG);
16950 case ISD::FNEG: return LowerFABSorFNEG(Op, DAG);
16951 case ISD::FCOPYSIGN: return LowerFCOPYSIGN(Op, DAG);
16952 case ISD::FGETSIGN: return LowerFGETSIGN(Op, DAG);
16953 case ISD::SETCC: return LowerSETCC(Op, DAG);
16954 case ISD::SELECT: return LowerSELECT(Op, DAG);
16955 case ISD::BRCOND: return LowerBRCOND(Op, DAG);
16956 case ISD::JumpTable: return LowerJumpTable(Op, DAG);
16957 case ISD::VASTART: return LowerVASTART(Op, DAG);
16958 case ISD::VAARG: return LowerVAARG(Op, DAG);
16959 case ISD::VACOPY: return LowerVACOPY(Op, Subtarget, DAG);
16960 case ISD::INTRINSIC_WO_CHAIN: return LowerINTRINSIC_WO_CHAIN(Op, DAG);
16961 case ISD::INTRINSIC_VOID:
16962 case ISD::INTRINSIC_W_CHAIN: return LowerINTRINSIC_W_CHAIN(Op, Subtarget, DAG);
16963 case ISD::RETURNADDR: return LowerRETURNADDR(Op, DAG);
16964 case ISD::FRAMEADDR: return LowerFRAMEADDR(Op, DAG);
16965 case ISD::FRAME_TO_ARGS_OFFSET:
16966 return LowerFRAME_TO_ARGS_OFFSET(Op, DAG);
16967 case ISD::DYNAMIC_STACKALLOC: return LowerDYNAMIC_STACKALLOC(Op, DAG);
16968 case ISD::EH_RETURN: return LowerEH_RETURN(Op, DAG);
16969 case ISD::EH_SJLJ_SETJMP: return lowerEH_SJLJ_SETJMP(Op, DAG);
16970 case ISD::EH_SJLJ_LONGJMP: return lowerEH_SJLJ_LONGJMP(Op, DAG);
16971 case ISD::INIT_TRAMPOLINE: return LowerINIT_TRAMPOLINE(Op, DAG);
16972 case ISD::ADJUST_TRAMPOLINE: return LowerADJUST_TRAMPOLINE(Op, DAG);
16973 case ISD::FLT_ROUNDS_: return LowerFLT_ROUNDS_(Op, DAG);
16974 case ISD::CTLZ: return LowerCTLZ(Op, DAG);
16975 case ISD::CTLZ_ZERO_UNDEF: return LowerCTLZ_ZERO_UNDEF(Op, DAG);
16976 case ISD::CTTZ: return LowerCTTZ(Op, DAG);
16977 case ISD::MUL: return LowerMUL(Op, Subtarget, DAG);
16978 case ISD::UMUL_LOHI:
16979 case ISD::SMUL_LOHI: return LowerMUL_LOHI(Op, Subtarget, DAG);
16982 case ISD::SHL: return LowerShift(Op, Subtarget, DAG);
16988 case ISD::UMULO: return LowerXALUO(Op, DAG);
16989 case ISD::READCYCLECOUNTER: return LowerREADCYCLECOUNTER(Op, Subtarget,DAG);
16990 case ISD::BITCAST: return LowerBITCAST(Op, Subtarget, DAG);
16994 case ISD::SUBE: return LowerADDC_ADDE_SUBC_SUBE(Op, DAG);
16995 case ISD::ADD: return LowerADD(Op, DAG);
16996 case ISD::SUB: return LowerSUB(Op, DAG);
16997 case ISD::FSINCOS: return LowerFSINCOS(Op, Subtarget, DAG);
17001 static void ReplaceATOMIC_LOAD(SDNode *Node,
17002 SmallVectorImpl<SDValue> &Results,
17003 SelectionDAG &DAG) {
17005 EVT VT = cast<AtomicSDNode>(Node)->getMemoryVT();
17007 // Convert wide load -> cmpxchg8b/cmpxchg16b
17008 // FIXME: On 32-bit, load -> fild or movq would be more efficient
17009 // (The only way to get a 16-byte load is cmpxchg16b)
17010 // FIXME: 16-byte ATOMIC_CMP_SWAP isn't actually hooked up at the moment.
17011 SDValue Zero = DAG.getConstant(0, VT);
17012 SDVTList VTs = DAG.getVTList(VT, MVT::i1, MVT::Other);
17014 DAG.getAtomicCmpSwap(ISD::ATOMIC_CMP_SWAP_WITH_SUCCESS, dl, VT, VTs,
17015 Node->getOperand(0), Node->getOperand(1), Zero, Zero,
17016 cast<AtomicSDNode>(Node)->getMemOperand(),
17017 cast<AtomicSDNode>(Node)->getOrdering(),
17018 cast<AtomicSDNode>(Node)->getOrdering(),
17019 cast<AtomicSDNode>(Node)->getSynchScope());
17020 Results.push_back(Swap.getValue(0));
17021 Results.push_back(Swap.getValue(2));
17024 /// ReplaceNodeResults - Replace a node with an illegal result type
17025 /// with a new node built out of custom code.
17026 void X86TargetLowering::ReplaceNodeResults(SDNode *N,
17027 SmallVectorImpl<SDValue>&Results,
17028 SelectionDAG &DAG) const {
17030 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
17031 switch (N->getOpcode()) {
17033 llvm_unreachable("Do not know how to custom type legalize this operation!");
17034 case ISD::SIGN_EXTEND_INREG:
17039 // We don't want to expand or promote these.
17046 case ISD::UDIVREM: {
17047 SDValue V = LowerWin64_i128OP(SDValue(N,0), DAG);
17048 Results.push_back(V);
17051 case ISD::FP_TO_SINT:
17052 case ISD::FP_TO_UINT: {
17053 bool IsSigned = N->getOpcode() == ISD::FP_TO_SINT;
17055 if (!IsSigned && !isIntegerTypeFTOL(SDValue(N, 0).getValueType()))
17058 std::pair<SDValue,SDValue> Vals =
17059 FP_TO_INTHelper(SDValue(N, 0), DAG, IsSigned, /*IsReplace=*/ true);
17060 SDValue FIST = Vals.first, StackSlot = Vals.second;
17061 if (FIST.getNode()) {
17062 EVT VT = N->getValueType(0);
17063 // Return a load from the stack slot.
17064 if (StackSlot.getNode())
17065 Results.push_back(DAG.getLoad(VT, dl, FIST, StackSlot,
17066 MachinePointerInfo(),
17067 false, false, false, 0));
17069 Results.push_back(FIST);
17073 case ISD::UINT_TO_FP: {
17074 assert(Subtarget->hasSSE2() && "Requires at least SSE2!");
17075 if (N->getOperand(0).getValueType() != MVT::v2i32 ||
17076 N->getValueType(0) != MVT::v2f32)
17078 SDValue ZExtIn = DAG.getNode(ISD::ZERO_EXTEND, dl, MVT::v2i64,
17080 SDValue Bias = DAG.getConstantFP(BitsToDouble(0x4330000000000000ULL),
17082 SDValue VBias = DAG.getNode(ISD::BUILD_VECTOR, dl, MVT::v2f64, Bias, Bias);
17083 SDValue Or = DAG.getNode(ISD::OR, dl, MVT::v2i64, ZExtIn,
17084 DAG.getNode(ISD::BITCAST, dl, MVT::v2i64, VBias));
17085 Or = DAG.getNode(ISD::BITCAST, dl, MVT::v2f64, Or);
17086 SDValue Sub = DAG.getNode(ISD::FSUB, dl, MVT::v2f64, Or, VBias);
17087 Results.push_back(DAG.getNode(X86ISD::VFPROUND, dl, MVT::v4f32, Sub));
17090 case ISD::FP_ROUND: {
17091 if (!TLI.isTypeLegal(N->getOperand(0).getValueType()))
17093 SDValue V = DAG.getNode(X86ISD::VFPROUND, dl, MVT::v4f32, N->getOperand(0));
17094 Results.push_back(V);
17097 case ISD::INTRINSIC_W_CHAIN: {
17098 unsigned IntNo = cast<ConstantSDNode>(N->getOperand(1))->getZExtValue();
17100 default : llvm_unreachable("Do not know how to custom type "
17101 "legalize this intrinsic operation!");
17102 case Intrinsic::x86_rdtsc:
17103 return getReadTimeStampCounter(N, dl, X86ISD::RDTSC_DAG, DAG, Subtarget,
17105 case Intrinsic::x86_rdtscp:
17106 return getReadTimeStampCounter(N, dl, X86ISD::RDTSCP_DAG, DAG, Subtarget,
17108 case Intrinsic::x86_rdpmc:
17109 return getReadPerformanceCounter(N, dl, DAG, Subtarget, Results);
17112 case ISD::READCYCLECOUNTER: {
17113 return getReadTimeStampCounter(N, dl, X86ISD::RDTSC_DAG, DAG, Subtarget,
17116 case ISD::ATOMIC_CMP_SWAP_WITH_SUCCESS: {
17117 EVT T = N->getValueType(0);
17118 assert((T == MVT::i64 || T == MVT::i128) && "can only expand cmpxchg pair");
17119 bool Regs64bit = T == MVT::i128;
17120 EVT HalfT = Regs64bit ? MVT::i64 : MVT::i32;
17121 SDValue cpInL, cpInH;
17122 cpInL = DAG.getNode(ISD::EXTRACT_ELEMENT, dl, HalfT, N->getOperand(2),
17123 DAG.getConstant(0, HalfT));
17124 cpInH = DAG.getNode(ISD::EXTRACT_ELEMENT, dl, HalfT, N->getOperand(2),
17125 DAG.getConstant(1, HalfT));
17126 cpInL = DAG.getCopyToReg(N->getOperand(0), dl,
17127 Regs64bit ? X86::RAX : X86::EAX,
17129 cpInH = DAG.getCopyToReg(cpInL.getValue(0), dl,
17130 Regs64bit ? X86::RDX : X86::EDX,
17131 cpInH, cpInL.getValue(1));
17132 SDValue swapInL, swapInH;
17133 swapInL = DAG.getNode(ISD::EXTRACT_ELEMENT, dl, HalfT, N->getOperand(3),
17134 DAG.getConstant(0, HalfT));
17135 swapInH = DAG.getNode(ISD::EXTRACT_ELEMENT, dl, HalfT, N->getOperand(3),
17136 DAG.getConstant(1, HalfT));
17137 swapInL = DAG.getCopyToReg(cpInH.getValue(0), dl,
17138 Regs64bit ? X86::RBX : X86::EBX,
17139 swapInL, cpInH.getValue(1));
17140 swapInH = DAG.getCopyToReg(swapInL.getValue(0), dl,
17141 Regs64bit ? X86::RCX : X86::ECX,
17142 swapInH, swapInL.getValue(1));
17143 SDValue Ops[] = { swapInH.getValue(0),
17145 swapInH.getValue(1) };
17146 SDVTList Tys = DAG.getVTList(MVT::Other, MVT::Glue);
17147 MachineMemOperand *MMO = cast<AtomicSDNode>(N)->getMemOperand();
17148 unsigned Opcode = Regs64bit ? X86ISD::LCMPXCHG16_DAG :
17149 X86ISD::LCMPXCHG8_DAG;
17150 SDValue Result = DAG.getMemIntrinsicNode(Opcode, dl, Tys, Ops, T, MMO);
17151 SDValue cpOutL = DAG.getCopyFromReg(Result.getValue(0), dl,
17152 Regs64bit ? X86::RAX : X86::EAX,
17153 HalfT, Result.getValue(1));
17154 SDValue cpOutH = DAG.getCopyFromReg(cpOutL.getValue(1), dl,
17155 Regs64bit ? X86::RDX : X86::EDX,
17156 HalfT, cpOutL.getValue(2));
17157 SDValue OpsF[] = { cpOutL.getValue(0), cpOutH.getValue(0)};
17159 SDValue EFLAGS = DAG.getCopyFromReg(cpOutH.getValue(1), dl, X86::EFLAGS,
17160 MVT::i32, cpOutH.getValue(2));
17162 DAG.getNode(X86ISD::SETCC, dl, MVT::i8,
17163 DAG.getConstant(X86::COND_E, MVT::i8), EFLAGS);
17164 Success = DAG.getZExtOrTrunc(Success, dl, N->getValueType(1));
17166 Results.push_back(DAG.getNode(ISD::BUILD_PAIR, dl, T, OpsF));
17167 Results.push_back(Success);
17168 Results.push_back(EFLAGS.getValue(1));
17171 case ISD::ATOMIC_SWAP:
17172 case ISD::ATOMIC_LOAD_ADD:
17173 case ISD::ATOMIC_LOAD_SUB:
17174 case ISD::ATOMIC_LOAD_AND:
17175 case ISD::ATOMIC_LOAD_OR:
17176 case ISD::ATOMIC_LOAD_XOR:
17177 case ISD::ATOMIC_LOAD_NAND:
17178 case ISD::ATOMIC_LOAD_MIN:
17179 case ISD::ATOMIC_LOAD_MAX:
17180 case ISD::ATOMIC_LOAD_UMIN:
17181 case ISD::ATOMIC_LOAD_UMAX:
17182 // Delegate to generic TypeLegalization. Situations we can really handle
17183 // should have already been dealt with by X86AtomicExpandPass.cpp.
17185 case ISD::ATOMIC_LOAD: {
17186 ReplaceATOMIC_LOAD(N, Results, DAG);
17189 case ISD::BITCAST: {
17190 assert(Subtarget->hasSSE2() && "Requires at least SSE2!");
17191 EVT DstVT = N->getValueType(0);
17192 EVT SrcVT = N->getOperand(0)->getValueType(0);
17194 if (SrcVT != MVT::f64 ||
17195 (DstVT != MVT::v2i32 && DstVT != MVT::v4i16 && DstVT != MVT::v8i8))
17198 unsigned NumElts = DstVT.getVectorNumElements();
17199 EVT SVT = DstVT.getVectorElementType();
17200 EVT WiderVT = EVT::getVectorVT(*DAG.getContext(), SVT, NumElts * 2);
17201 SDValue Expanded = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl,
17202 MVT::v2f64, N->getOperand(0));
17203 SDValue ToVecInt = DAG.getNode(ISD::BITCAST, dl, WiderVT, Expanded);
17205 if (ExperimentalVectorWideningLegalization) {
17206 // If we are legalizing vectors by widening, we already have the desired
17207 // legal vector type, just return it.
17208 Results.push_back(ToVecInt);
17212 SmallVector<SDValue, 8> Elts;
17213 for (unsigned i = 0, e = NumElts; i != e; ++i)
17214 Elts.push_back(DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, SVT,
17215 ToVecInt, DAG.getIntPtrConstant(i)));
17217 Results.push_back(DAG.getNode(ISD::BUILD_VECTOR, dl, DstVT, Elts));
17222 const char *X86TargetLowering::getTargetNodeName(unsigned Opcode) const {
17224 default: return nullptr;
17225 case X86ISD::BSF: return "X86ISD::BSF";
17226 case X86ISD::BSR: return "X86ISD::BSR";
17227 case X86ISD::SHLD: return "X86ISD::SHLD";
17228 case X86ISD::SHRD: return "X86ISD::SHRD";
17229 case X86ISD::FAND: return "X86ISD::FAND";
17230 case X86ISD::FANDN: return "X86ISD::FANDN";
17231 case X86ISD::FOR: return "X86ISD::FOR";
17232 case X86ISD::FXOR: return "X86ISD::FXOR";
17233 case X86ISD::FSRL: return "X86ISD::FSRL";
17234 case X86ISD::FILD: return "X86ISD::FILD";
17235 case X86ISD::FILD_FLAG: return "X86ISD::FILD_FLAG";
17236 case X86ISD::FP_TO_INT16_IN_MEM: return "X86ISD::FP_TO_INT16_IN_MEM";
17237 case X86ISD::FP_TO_INT32_IN_MEM: return "X86ISD::FP_TO_INT32_IN_MEM";
17238 case X86ISD::FP_TO_INT64_IN_MEM: return "X86ISD::FP_TO_INT64_IN_MEM";
17239 case X86ISD::FLD: return "X86ISD::FLD";
17240 case X86ISD::FST: return "X86ISD::FST";
17241 case X86ISD::CALL: return "X86ISD::CALL";
17242 case X86ISD::RDTSC_DAG: return "X86ISD::RDTSC_DAG";
17243 case X86ISD::RDTSCP_DAG: return "X86ISD::RDTSCP_DAG";
17244 case X86ISD::RDPMC_DAG: return "X86ISD::RDPMC_DAG";
17245 case X86ISD::BT: return "X86ISD::BT";
17246 case X86ISD::CMP: return "X86ISD::CMP";
17247 case X86ISD::COMI: return "X86ISD::COMI";
17248 case X86ISD::UCOMI: return "X86ISD::UCOMI";
17249 case X86ISD::CMPM: return "X86ISD::CMPM";
17250 case X86ISD::CMPMU: return "X86ISD::CMPMU";
17251 case X86ISD::SETCC: return "X86ISD::SETCC";
17252 case X86ISD::SETCC_CARRY: return "X86ISD::SETCC_CARRY";
17253 case X86ISD::FSETCC: return "X86ISD::FSETCC";
17254 case X86ISD::CMOV: return "X86ISD::CMOV";
17255 case X86ISD::BRCOND: return "X86ISD::BRCOND";
17256 case X86ISD::RET_FLAG: return "X86ISD::RET_FLAG";
17257 case X86ISD::REP_STOS: return "X86ISD::REP_STOS";
17258 case X86ISD::REP_MOVS: return "X86ISD::REP_MOVS";
17259 case X86ISD::GlobalBaseReg: return "X86ISD::GlobalBaseReg";
17260 case X86ISD::Wrapper: return "X86ISD::Wrapper";
17261 case X86ISD::WrapperRIP: return "X86ISD::WrapperRIP";
17262 case X86ISD::PEXTRB: return "X86ISD::PEXTRB";
17263 case X86ISD::PEXTRW: return "X86ISD::PEXTRW";
17264 case X86ISD::INSERTPS: return "X86ISD::INSERTPS";
17265 case X86ISD::PINSRB: return "X86ISD::PINSRB";
17266 case X86ISD::PINSRW: return "X86ISD::PINSRW";
17267 case X86ISD::PSHUFB: return "X86ISD::PSHUFB";
17268 case X86ISD::ANDNP: return "X86ISD::ANDNP";
17269 case X86ISD::PSIGN: return "X86ISD::PSIGN";
17270 case X86ISD::BLENDV: return "X86ISD::BLENDV";
17271 case X86ISD::BLENDI: return "X86ISD::BLENDI";
17272 case X86ISD::SUBUS: return "X86ISD::SUBUS";
17273 case X86ISD::HADD: return "X86ISD::HADD";
17274 case X86ISD::HSUB: return "X86ISD::HSUB";
17275 case X86ISD::FHADD: return "X86ISD::FHADD";
17276 case X86ISD::FHSUB: return "X86ISD::FHSUB";
17277 case X86ISD::UMAX: return "X86ISD::UMAX";
17278 case X86ISD::UMIN: return "X86ISD::UMIN";
17279 case X86ISD::SMAX: return "X86ISD::SMAX";
17280 case X86ISD::SMIN: return "X86ISD::SMIN";
17281 case X86ISD::FMAX: return "X86ISD::FMAX";
17282 case X86ISD::FMIN: return "X86ISD::FMIN";
17283 case X86ISD::FMAXC: return "X86ISD::FMAXC";
17284 case X86ISD::FMINC: return "X86ISD::FMINC";
17285 case X86ISD::FRSQRT: return "X86ISD::FRSQRT";
17286 case X86ISD::FRCP: return "X86ISD::FRCP";
17287 case X86ISD::TLSADDR: return "X86ISD::TLSADDR";
17288 case X86ISD::TLSBASEADDR: return "X86ISD::TLSBASEADDR";
17289 case X86ISD::TLSCALL: return "X86ISD::TLSCALL";
17290 case X86ISD::EH_SJLJ_SETJMP: return "X86ISD::EH_SJLJ_SETJMP";
17291 case X86ISD::EH_SJLJ_LONGJMP: return "X86ISD::EH_SJLJ_LONGJMP";
17292 case X86ISD::EH_RETURN: return "X86ISD::EH_RETURN";
17293 case X86ISD::TC_RETURN: return "X86ISD::TC_RETURN";
17294 case X86ISD::FNSTCW16m: return "X86ISD::FNSTCW16m";
17295 case X86ISD::FNSTSW16r: return "X86ISD::FNSTSW16r";
17296 case X86ISD::LCMPXCHG_DAG: return "X86ISD::LCMPXCHG_DAG";
17297 case X86ISD::LCMPXCHG8_DAG: return "X86ISD::LCMPXCHG8_DAG";
17298 case X86ISD::LCMPXCHG16_DAG: return "X86ISD::LCMPXCHG16_DAG";
17299 case X86ISD::VZEXT_MOVL: return "X86ISD::VZEXT_MOVL";
17300 case X86ISD::VZEXT_LOAD: return "X86ISD::VZEXT_LOAD";
17301 case X86ISD::VZEXT: return "X86ISD::VZEXT";
17302 case X86ISD::VSEXT: return "X86ISD::VSEXT";
17303 case X86ISD::VTRUNC: return "X86ISD::VTRUNC";
17304 case X86ISD::VTRUNCM: return "X86ISD::VTRUNCM";
17305 case X86ISD::VINSERT: return "X86ISD::VINSERT";
17306 case X86ISD::VFPEXT: return "X86ISD::VFPEXT";
17307 case X86ISD::VFPROUND: return "X86ISD::VFPROUND";
17308 case X86ISD::VSHLDQ: return "X86ISD::VSHLDQ";
17309 case X86ISD::VSRLDQ: return "X86ISD::VSRLDQ";
17310 case X86ISD::VSHL: return "X86ISD::VSHL";
17311 case X86ISD::VSRL: return "X86ISD::VSRL";
17312 case X86ISD::VSRA: return "X86ISD::VSRA";
17313 case X86ISD::VSHLI: return "X86ISD::VSHLI";
17314 case X86ISD::VSRLI: return "X86ISD::VSRLI";
17315 case X86ISD::VSRAI: return "X86ISD::VSRAI";
17316 case X86ISD::CMPP: return "X86ISD::CMPP";
17317 case X86ISD::PCMPEQ: return "X86ISD::PCMPEQ";
17318 case X86ISD::PCMPGT: return "X86ISD::PCMPGT";
17319 case X86ISD::PCMPEQM: return "X86ISD::PCMPEQM";
17320 case X86ISD::PCMPGTM: return "X86ISD::PCMPGTM";
17321 case X86ISD::ADD: return "X86ISD::ADD";
17322 case X86ISD::SUB: return "X86ISD::SUB";
17323 case X86ISD::ADC: return "X86ISD::ADC";
17324 case X86ISD::SBB: return "X86ISD::SBB";
17325 case X86ISD::SMUL: return "X86ISD::SMUL";
17326 case X86ISD::UMUL: return "X86ISD::UMUL";
17327 case X86ISD::INC: return "X86ISD::INC";
17328 case X86ISD::DEC: return "X86ISD::DEC";
17329 case X86ISD::OR: return "X86ISD::OR";
17330 case X86ISD::XOR: return "X86ISD::XOR";
17331 case X86ISD::AND: return "X86ISD::AND";
17332 case X86ISD::BEXTR: return "X86ISD::BEXTR";
17333 case X86ISD::MUL_IMM: return "X86ISD::MUL_IMM";
17334 case X86ISD::PTEST: return "X86ISD::PTEST";
17335 case X86ISD::TESTP: return "X86ISD::TESTP";
17336 case X86ISD::TESTM: return "X86ISD::TESTM";
17337 case X86ISD::TESTNM: return "X86ISD::TESTNM";
17338 case X86ISD::KORTEST: return "X86ISD::KORTEST";
17339 case X86ISD::PACKSS: return "X86ISD::PACKSS";
17340 case X86ISD::PACKUS: return "X86ISD::PACKUS";
17341 case X86ISD::PALIGNR: return "X86ISD::PALIGNR";
17342 case X86ISD::VALIGN: return "X86ISD::VALIGN";
17343 case X86ISD::PSHUFD: return "X86ISD::PSHUFD";
17344 case X86ISD::PSHUFHW: return "X86ISD::PSHUFHW";
17345 case X86ISD::PSHUFLW: return "X86ISD::PSHUFLW";
17346 case X86ISD::SHUFP: return "X86ISD::SHUFP";
17347 case X86ISD::MOVLHPS: return "X86ISD::MOVLHPS";
17348 case X86ISD::MOVLHPD: return "X86ISD::MOVLHPD";
17349 case X86ISD::MOVHLPS: return "X86ISD::MOVHLPS";
17350 case X86ISD::MOVLPS: return "X86ISD::MOVLPS";
17351 case X86ISD::MOVLPD: return "X86ISD::MOVLPD";
17352 case X86ISD::MOVDDUP: return "X86ISD::MOVDDUP";
17353 case X86ISD::MOVSHDUP: return "X86ISD::MOVSHDUP";
17354 case X86ISD::MOVSLDUP: return "X86ISD::MOVSLDUP";
17355 case X86ISD::MOVSD: return "X86ISD::MOVSD";
17356 case X86ISD::MOVSS: return "X86ISD::MOVSS";
17357 case X86ISD::UNPCKL: return "X86ISD::UNPCKL";
17358 case X86ISD::UNPCKH: return "X86ISD::UNPCKH";
17359 case X86ISD::VBROADCAST: return "X86ISD::VBROADCAST";
17360 case X86ISD::VBROADCASTM: return "X86ISD::VBROADCASTM";
17361 case X86ISD::VEXTRACT: return "X86ISD::VEXTRACT";
17362 case X86ISD::VPERMILP: return "X86ISD::VPERMILP";
17363 case X86ISD::VPERM2X128: return "X86ISD::VPERM2X128";
17364 case X86ISD::VPERMV: return "X86ISD::VPERMV";
17365 case X86ISD::VPERMV3: return "X86ISD::VPERMV3";
17366 case X86ISD::VPERMIV3: return "X86ISD::VPERMIV3";
17367 case X86ISD::VPERMI: return "X86ISD::VPERMI";
17368 case X86ISD::PMULUDQ: return "X86ISD::PMULUDQ";
17369 case X86ISD::PMULDQ: return "X86ISD::PMULDQ";
17370 case X86ISD::VASTART_SAVE_XMM_REGS: return "X86ISD::VASTART_SAVE_XMM_REGS";
17371 case X86ISD::VAARG_64: return "X86ISD::VAARG_64";
17372 case X86ISD::WIN_ALLOCA: return "X86ISD::WIN_ALLOCA";
17373 case X86ISD::MEMBARRIER: return "X86ISD::MEMBARRIER";
17374 case X86ISD::SEG_ALLOCA: return "X86ISD::SEG_ALLOCA";
17375 case X86ISD::WIN_FTOL: return "X86ISD::WIN_FTOL";
17376 case X86ISD::SAHF: return "X86ISD::SAHF";
17377 case X86ISD::RDRAND: return "X86ISD::RDRAND";
17378 case X86ISD::RDSEED: return "X86ISD::RDSEED";
17379 case X86ISD::FMADD: return "X86ISD::FMADD";
17380 case X86ISD::FMSUB: return "X86ISD::FMSUB";
17381 case X86ISD::FNMADD: return "X86ISD::FNMADD";
17382 case X86ISD::FNMSUB: return "X86ISD::FNMSUB";
17383 case X86ISD::FMADDSUB: return "X86ISD::FMADDSUB";
17384 case X86ISD::FMSUBADD: return "X86ISD::FMSUBADD";
17385 case X86ISD::PCMPESTRI: return "X86ISD::PCMPESTRI";
17386 case X86ISD::PCMPISTRI: return "X86ISD::PCMPISTRI";
17387 case X86ISD::XTEST: return "X86ISD::XTEST";
17391 // isLegalAddressingMode - Return true if the addressing mode represented
17392 // by AM is legal for this target, for a load/store of the specified type.
17393 bool X86TargetLowering::isLegalAddressingMode(const AddrMode &AM,
17395 // X86 supports extremely general addressing modes.
17396 CodeModel::Model M = getTargetMachine().getCodeModel();
17397 Reloc::Model R = getTargetMachine().getRelocationModel();
17399 // X86 allows a sign-extended 32-bit immediate field as a displacement.
17400 if (!X86::isOffsetSuitableForCodeModel(AM.BaseOffs, M, AM.BaseGV != nullptr))
17405 Subtarget->ClassifyGlobalReference(AM.BaseGV, getTargetMachine());
17407 // If a reference to this global requires an extra load, we can't fold it.
17408 if (isGlobalStubReference(GVFlags))
17411 // If BaseGV requires a register for the PIC base, we cannot also have a
17412 // BaseReg specified.
17413 if (AM.HasBaseReg && isGlobalRelativeToPICBase(GVFlags))
17416 // If lower 4G is not available, then we must use rip-relative addressing.
17417 if ((M != CodeModel::Small || R != Reloc::Static) &&
17418 Subtarget->is64Bit() && (AM.BaseOffs || AM.Scale > 1))
17422 switch (AM.Scale) {
17428 // These scales always work.
17433 // These scales are formed with basereg+scalereg. Only accept if there is
17438 default: // Other stuff never works.
17445 bool X86TargetLowering::isVectorShiftByScalarCheap(Type *Ty) const {
17446 unsigned Bits = Ty->getScalarSizeInBits();
17448 // 8-bit shifts are always expensive, but versions with a scalar amount aren't
17449 // particularly cheaper than those without.
17453 // On AVX2 there are new vpsllv[dq] instructions (and other shifts), that make
17454 // variable shifts just as cheap as scalar ones.
17455 if (Subtarget->hasInt256() && (Bits == 32 || Bits == 64))
17458 // Otherwise, it's significantly cheaper to shift by a scalar amount than by a
17459 // fully general vector.
17463 bool X86TargetLowering::isTruncateFree(Type *Ty1, Type *Ty2) const {
17464 if (!Ty1->isIntegerTy() || !Ty2->isIntegerTy())
17466 unsigned NumBits1 = Ty1->getPrimitiveSizeInBits();
17467 unsigned NumBits2 = Ty2->getPrimitiveSizeInBits();
17468 return NumBits1 > NumBits2;
17471 bool X86TargetLowering::allowTruncateForTailCall(Type *Ty1, Type *Ty2) const {
17472 if (!Ty1->isIntegerTy() || !Ty2->isIntegerTy())
17475 if (!isTypeLegal(EVT::getEVT(Ty1)))
17478 assert(Ty1->getPrimitiveSizeInBits() <= 64 && "i128 is probably not a noop");
17480 // Assuming the caller doesn't have a zeroext or signext return parameter,
17481 // truncation all the way down to i1 is valid.
17485 bool X86TargetLowering::isLegalICmpImmediate(int64_t Imm) const {
17486 return isInt<32>(Imm);
17489 bool X86TargetLowering::isLegalAddImmediate(int64_t Imm) const {
17490 // Can also use sub to handle negated immediates.
17491 return isInt<32>(Imm);
17494 bool X86TargetLowering::isTruncateFree(EVT VT1, EVT VT2) const {
17495 if (!VT1.isInteger() || !VT2.isInteger())
17497 unsigned NumBits1 = VT1.getSizeInBits();
17498 unsigned NumBits2 = VT2.getSizeInBits();
17499 return NumBits1 > NumBits2;
17502 bool X86TargetLowering::isZExtFree(Type *Ty1, Type *Ty2) const {
17503 // x86-64 implicitly zero-extends 32-bit results in 64-bit registers.
17504 return Ty1->isIntegerTy(32) && Ty2->isIntegerTy(64) && Subtarget->is64Bit();
17507 bool X86TargetLowering::isZExtFree(EVT VT1, EVT VT2) const {
17508 // x86-64 implicitly zero-extends 32-bit results in 64-bit registers.
17509 return VT1 == MVT::i32 && VT2 == MVT::i64 && Subtarget->is64Bit();
17512 bool X86TargetLowering::isZExtFree(SDValue Val, EVT VT2) const {
17513 EVT VT1 = Val.getValueType();
17514 if (isZExtFree(VT1, VT2))
17517 if (Val.getOpcode() != ISD::LOAD)
17520 if (!VT1.isSimple() || !VT1.isInteger() ||
17521 !VT2.isSimple() || !VT2.isInteger())
17524 switch (VT1.getSimpleVT().SimpleTy) {
17529 // X86 has 8, 16, and 32-bit zero-extending loads.
17537 X86TargetLowering::isFMAFasterThanFMulAndFAdd(EVT VT) const {
17538 if (!(Subtarget->hasFMA() || Subtarget->hasFMA4()))
17541 VT = VT.getScalarType();
17543 if (!VT.isSimple())
17546 switch (VT.getSimpleVT().SimpleTy) {
17557 bool X86TargetLowering::isNarrowingProfitable(EVT VT1, EVT VT2) const {
17558 // i16 instructions are longer (0x66 prefix) and potentially slower.
17559 return !(VT1 == MVT::i32 && VT2 == MVT::i16);
17562 /// isShuffleMaskLegal - Targets can use this to indicate that they only
17563 /// support *some* VECTOR_SHUFFLE operations, those with specific masks.
17564 /// By default, if a target supports the VECTOR_SHUFFLE node, all mask values
17565 /// are assumed to be legal.
17567 X86TargetLowering::isShuffleMaskLegal(const SmallVectorImpl<int> &M,
17569 if (!VT.isSimple())
17572 MVT SVT = VT.getSimpleVT();
17574 // Very little shuffling can be done for 64-bit vectors right now.
17575 if (VT.getSizeInBits() == 64)
17578 // If this is a single-input shuffle with no 128 bit lane crossings we can
17579 // lower it into pshufb.
17580 if ((SVT.is128BitVector() && Subtarget->hasSSSE3()) ||
17581 (SVT.is256BitVector() && Subtarget->hasInt256())) {
17582 bool isLegal = true;
17583 for (unsigned I = 0, E = M.size(); I != E; ++I) {
17584 if (M[I] >= (int)SVT.getVectorNumElements() ||
17585 ShuffleCrosses128bitLane(SVT, I, M[I])) {
17594 // FIXME: blends, shifts.
17595 return (SVT.getVectorNumElements() == 2 ||
17596 ShuffleVectorSDNode::isSplatMask(&M[0], VT) ||
17597 isMOVLMask(M, SVT) ||
17598 isMOVHLPSMask(M, SVT) ||
17599 isSHUFPMask(M, SVT) ||
17600 isPSHUFDMask(M, SVT) ||
17601 isPSHUFHWMask(M, SVT, Subtarget->hasInt256()) ||
17602 isPSHUFLWMask(M, SVT, Subtarget->hasInt256()) ||
17603 isPALIGNRMask(M, SVT, Subtarget) ||
17604 isUNPCKLMask(M, SVT, Subtarget->hasInt256()) ||
17605 isUNPCKHMask(M, SVT, Subtarget->hasInt256()) ||
17606 isUNPCKL_v_undef_Mask(M, SVT, Subtarget->hasInt256()) ||
17607 isUNPCKH_v_undef_Mask(M, SVT, Subtarget->hasInt256()) ||
17608 isBlendMask(M, SVT, Subtarget->hasSSE41(), Subtarget->hasInt256()));
17612 X86TargetLowering::isVectorClearMaskLegal(const SmallVectorImpl<int> &Mask,
17614 if (!VT.isSimple())
17617 MVT SVT = VT.getSimpleVT();
17618 unsigned NumElts = SVT.getVectorNumElements();
17619 // FIXME: This collection of masks seems suspect.
17622 if (NumElts == 4 && SVT.is128BitVector()) {
17623 return (isMOVLMask(Mask, SVT) ||
17624 isCommutedMOVLMask(Mask, SVT, true) ||
17625 isSHUFPMask(Mask, SVT) ||
17626 isSHUFPMask(Mask, SVT, /* Commuted */ true));
17631 //===----------------------------------------------------------------------===//
17632 // X86 Scheduler Hooks
17633 //===----------------------------------------------------------------------===//
17635 /// Utility function to emit xbegin specifying the start of an RTM region.
17636 static MachineBasicBlock *EmitXBegin(MachineInstr *MI, MachineBasicBlock *MBB,
17637 const TargetInstrInfo *TII) {
17638 DebugLoc DL = MI->getDebugLoc();
17640 const BasicBlock *BB = MBB->getBasicBlock();
17641 MachineFunction::iterator I = MBB;
17644 // For the v = xbegin(), we generate
17655 MachineBasicBlock *thisMBB = MBB;
17656 MachineFunction *MF = MBB->getParent();
17657 MachineBasicBlock *mainMBB = MF->CreateMachineBasicBlock(BB);
17658 MachineBasicBlock *sinkMBB = MF->CreateMachineBasicBlock(BB);
17659 MF->insert(I, mainMBB);
17660 MF->insert(I, sinkMBB);
17662 // Transfer the remainder of BB and its successor edges to sinkMBB.
17663 sinkMBB->splice(sinkMBB->begin(), MBB,
17664 std::next(MachineBasicBlock::iterator(MI)), MBB->end());
17665 sinkMBB->transferSuccessorsAndUpdatePHIs(MBB);
17669 // # fallthrough to mainMBB
17670 // # abortion to sinkMBB
17671 BuildMI(thisMBB, DL, TII->get(X86::XBEGIN_4)).addMBB(sinkMBB);
17672 thisMBB->addSuccessor(mainMBB);
17673 thisMBB->addSuccessor(sinkMBB);
17677 BuildMI(mainMBB, DL, TII->get(X86::MOV32ri), X86::EAX).addImm(-1);
17678 mainMBB->addSuccessor(sinkMBB);
17681 // EAX is live into the sinkMBB
17682 sinkMBB->addLiveIn(X86::EAX);
17683 BuildMI(*sinkMBB, sinkMBB->begin(), DL,
17684 TII->get(TargetOpcode::COPY), MI->getOperand(0).getReg())
17687 MI->eraseFromParent();
17691 // FIXME: When we get size specific XMM0 registers, i.e. XMM0_V16I8
17692 // or XMM0_V32I8 in AVX all of this code can be replaced with that
17693 // in the .td file.
17694 static MachineBasicBlock *EmitPCMPSTRM(MachineInstr *MI, MachineBasicBlock *BB,
17695 const TargetInstrInfo *TII) {
17697 switch (MI->getOpcode()) {
17698 default: llvm_unreachable("illegal opcode!");
17699 case X86::PCMPISTRM128REG: Opc = X86::PCMPISTRM128rr; break;
17700 case X86::VPCMPISTRM128REG: Opc = X86::VPCMPISTRM128rr; break;
17701 case X86::PCMPISTRM128MEM: Opc = X86::PCMPISTRM128rm; break;
17702 case X86::VPCMPISTRM128MEM: Opc = X86::VPCMPISTRM128rm; break;
17703 case X86::PCMPESTRM128REG: Opc = X86::PCMPESTRM128rr; break;
17704 case X86::VPCMPESTRM128REG: Opc = X86::VPCMPESTRM128rr; break;
17705 case X86::PCMPESTRM128MEM: Opc = X86::PCMPESTRM128rm; break;
17706 case X86::VPCMPESTRM128MEM: Opc = X86::VPCMPESTRM128rm; break;
17709 DebugLoc dl = MI->getDebugLoc();
17710 MachineInstrBuilder MIB = BuildMI(*BB, MI, dl, TII->get(Opc));
17712 unsigned NumArgs = MI->getNumOperands();
17713 for (unsigned i = 1; i < NumArgs; ++i) {
17714 MachineOperand &Op = MI->getOperand(i);
17715 if (!(Op.isReg() && Op.isImplicit()))
17716 MIB.addOperand(Op);
17718 if (MI->hasOneMemOperand())
17719 MIB->setMemRefs(MI->memoperands_begin(), MI->memoperands_end());
17721 BuildMI(*BB, MI, dl,
17722 TII->get(TargetOpcode::COPY), MI->getOperand(0).getReg())
17723 .addReg(X86::XMM0);
17725 MI->eraseFromParent();
17729 // FIXME: Custom handling because TableGen doesn't support multiple implicit
17730 // defs in an instruction pattern
17731 static MachineBasicBlock *EmitPCMPSTRI(MachineInstr *MI, MachineBasicBlock *BB,
17732 const TargetInstrInfo *TII) {
17734 switch (MI->getOpcode()) {
17735 default: llvm_unreachable("illegal opcode!");
17736 case X86::PCMPISTRIREG: Opc = X86::PCMPISTRIrr; break;
17737 case X86::VPCMPISTRIREG: Opc = X86::VPCMPISTRIrr; break;
17738 case X86::PCMPISTRIMEM: Opc = X86::PCMPISTRIrm; break;
17739 case X86::VPCMPISTRIMEM: Opc = X86::VPCMPISTRIrm; break;
17740 case X86::PCMPESTRIREG: Opc = X86::PCMPESTRIrr; break;
17741 case X86::VPCMPESTRIREG: Opc = X86::VPCMPESTRIrr; break;
17742 case X86::PCMPESTRIMEM: Opc = X86::PCMPESTRIrm; break;
17743 case X86::VPCMPESTRIMEM: Opc = X86::VPCMPESTRIrm; break;
17746 DebugLoc dl = MI->getDebugLoc();
17747 MachineInstrBuilder MIB = BuildMI(*BB, MI, dl, TII->get(Opc));
17749 unsigned NumArgs = MI->getNumOperands(); // remove the results
17750 for (unsigned i = 1; i < NumArgs; ++i) {
17751 MachineOperand &Op = MI->getOperand(i);
17752 if (!(Op.isReg() && Op.isImplicit()))
17753 MIB.addOperand(Op);
17755 if (MI->hasOneMemOperand())
17756 MIB->setMemRefs(MI->memoperands_begin(), MI->memoperands_end());
17758 BuildMI(*BB, MI, dl,
17759 TII->get(TargetOpcode::COPY), MI->getOperand(0).getReg())
17762 MI->eraseFromParent();
17766 static MachineBasicBlock * EmitMonitor(MachineInstr *MI, MachineBasicBlock *BB,
17767 const TargetInstrInfo *TII,
17768 const X86Subtarget* Subtarget) {
17769 DebugLoc dl = MI->getDebugLoc();
17771 // Address into RAX/EAX, other two args into ECX, EDX.
17772 unsigned MemOpc = Subtarget->is64Bit() ? X86::LEA64r : X86::LEA32r;
17773 unsigned MemReg = Subtarget->is64Bit() ? X86::RAX : X86::EAX;
17774 MachineInstrBuilder MIB = BuildMI(*BB, MI, dl, TII->get(MemOpc), MemReg);
17775 for (int i = 0; i < X86::AddrNumOperands; ++i)
17776 MIB.addOperand(MI->getOperand(i));
17778 unsigned ValOps = X86::AddrNumOperands;
17779 BuildMI(*BB, MI, dl, TII->get(TargetOpcode::COPY), X86::ECX)
17780 .addReg(MI->getOperand(ValOps).getReg());
17781 BuildMI(*BB, MI, dl, TII->get(TargetOpcode::COPY), X86::EDX)
17782 .addReg(MI->getOperand(ValOps+1).getReg());
17784 // The instruction doesn't actually take any operands though.
17785 BuildMI(*BB, MI, dl, TII->get(X86::MONITORrrr));
17787 MI->eraseFromParent(); // The pseudo is gone now.
17791 MachineBasicBlock *
17792 X86TargetLowering::EmitVAARG64WithCustomInserter(
17794 MachineBasicBlock *MBB) const {
17795 // Emit va_arg instruction on X86-64.
17797 // Operands to this pseudo-instruction:
17798 // 0 ) Output : destination address (reg)
17799 // 1-5) Input : va_list address (addr, i64mem)
17800 // 6 ) ArgSize : Size (in bytes) of vararg type
17801 // 7 ) ArgMode : 0=overflow only, 1=use gp_offset, 2=use fp_offset
17802 // 8 ) Align : Alignment of type
17803 // 9 ) EFLAGS (implicit-def)
17805 assert(MI->getNumOperands() == 10 && "VAARG_64 should have 10 operands!");
17806 assert(X86::AddrNumOperands == 5 && "VAARG_64 assumes 5 address operands");
17808 unsigned DestReg = MI->getOperand(0).getReg();
17809 MachineOperand &Base = MI->getOperand(1);
17810 MachineOperand &Scale = MI->getOperand(2);
17811 MachineOperand &Index = MI->getOperand(3);
17812 MachineOperand &Disp = MI->getOperand(4);
17813 MachineOperand &Segment = MI->getOperand(5);
17814 unsigned ArgSize = MI->getOperand(6).getImm();
17815 unsigned ArgMode = MI->getOperand(7).getImm();
17816 unsigned Align = MI->getOperand(8).getImm();
17818 // Memory Reference
17819 assert(MI->hasOneMemOperand() && "Expected VAARG_64 to have one memoperand");
17820 MachineInstr::mmo_iterator MMOBegin = MI->memoperands_begin();
17821 MachineInstr::mmo_iterator MMOEnd = MI->memoperands_end();
17823 // Machine Information
17824 const TargetInstrInfo *TII = MBB->getParent()->getSubtarget().getInstrInfo();
17825 MachineRegisterInfo &MRI = MBB->getParent()->getRegInfo();
17826 const TargetRegisterClass *AddrRegClass = getRegClassFor(MVT::i64);
17827 const TargetRegisterClass *OffsetRegClass = getRegClassFor(MVT::i32);
17828 DebugLoc DL = MI->getDebugLoc();
17830 // struct va_list {
17833 // i64 overflow_area (address)
17834 // i64 reg_save_area (address)
17836 // sizeof(va_list) = 24
17837 // alignment(va_list) = 8
17839 unsigned TotalNumIntRegs = 6;
17840 unsigned TotalNumXMMRegs = 8;
17841 bool UseGPOffset = (ArgMode == 1);
17842 bool UseFPOffset = (ArgMode == 2);
17843 unsigned MaxOffset = TotalNumIntRegs * 8 +
17844 (UseFPOffset ? TotalNumXMMRegs * 16 : 0);
17846 /* Align ArgSize to a multiple of 8 */
17847 unsigned ArgSizeA8 = (ArgSize + 7) & ~7;
17848 bool NeedsAlign = (Align > 8);
17850 MachineBasicBlock *thisMBB = MBB;
17851 MachineBasicBlock *overflowMBB;
17852 MachineBasicBlock *offsetMBB;
17853 MachineBasicBlock *endMBB;
17855 unsigned OffsetDestReg = 0; // Argument address computed by offsetMBB
17856 unsigned OverflowDestReg = 0; // Argument address computed by overflowMBB
17857 unsigned OffsetReg = 0;
17859 if (!UseGPOffset && !UseFPOffset) {
17860 // If we only pull from the overflow region, we don't create a branch.
17861 // We don't need to alter control flow.
17862 OffsetDestReg = 0; // unused
17863 OverflowDestReg = DestReg;
17865 offsetMBB = nullptr;
17866 overflowMBB = thisMBB;
17869 // First emit code to check if gp_offset (or fp_offset) is below the bound.
17870 // If so, pull the argument from reg_save_area. (branch to offsetMBB)
17871 // If not, pull from overflow_area. (branch to overflowMBB)
17876 // offsetMBB overflowMBB
17881 // Registers for the PHI in endMBB
17882 OffsetDestReg = MRI.createVirtualRegister(AddrRegClass);
17883 OverflowDestReg = MRI.createVirtualRegister(AddrRegClass);
17885 const BasicBlock *LLVM_BB = MBB->getBasicBlock();
17886 MachineFunction *MF = MBB->getParent();
17887 overflowMBB = MF->CreateMachineBasicBlock(LLVM_BB);
17888 offsetMBB = MF->CreateMachineBasicBlock(LLVM_BB);
17889 endMBB = MF->CreateMachineBasicBlock(LLVM_BB);
17891 MachineFunction::iterator MBBIter = MBB;
17894 // Insert the new basic blocks
17895 MF->insert(MBBIter, offsetMBB);
17896 MF->insert(MBBIter, overflowMBB);
17897 MF->insert(MBBIter, endMBB);
17899 // Transfer the remainder of MBB and its successor edges to endMBB.
17900 endMBB->splice(endMBB->begin(), thisMBB,
17901 std::next(MachineBasicBlock::iterator(MI)), thisMBB->end());
17902 endMBB->transferSuccessorsAndUpdatePHIs(thisMBB);
17904 // Make offsetMBB and overflowMBB successors of thisMBB
17905 thisMBB->addSuccessor(offsetMBB);
17906 thisMBB->addSuccessor(overflowMBB);
17908 // endMBB is a successor of both offsetMBB and overflowMBB
17909 offsetMBB->addSuccessor(endMBB);
17910 overflowMBB->addSuccessor(endMBB);
17912 // Load the offset value into a register
17913 OffsetReg = MRI.createVirtualRegister(OffsetRegClass);
17914 BuildMI(thisMBB, DL, TII->get(X86::MOV32rm), OffsetReg)
17918 .addDisp(Disp, UseFPOffset ? 4 : 0)
17919 .addOperand(Segment)
17920 .setMemRefs(MMOBegin, MMOEnd);
17922 // Check if there is enough room left to pull this argument.
17923 BuildMI(thisMBB, DL, TII->get(X86::CMP32ri))
17925 .addImm(MaxOffset + 8 - ArgSizeA8);
17927 // Branch to "overflowMBB" if offset >= max
17928 // Fall through to "offsetMBB" otherwise
17929 BuildMI(thisMBB, DL, TII->get(X86::GetCondBranchFromCond(X86::COND_AE)))
17930 .addMBB(overflowMBB);
17933 // In offsetMBB, emit code to use the reg_save_area.
17935 assert(OffsetReg != 0);
17937 // Read the reg_save_area address.
17938 unsigned RegSaveReg = MRI.createVirtualRegister(AddrRegClass);
17939 BuildMI(offsetMBB, DL, TII->get(X86::MOV64rm), RegSaveReg)
17944 .addOperand(Segment)
17945 .setMemRefs(MMOBegin, MMOEnd);
17947 // Zero-extend the offset
17948 unsigned OffsetReg64 = MRI.createVirtualRegister(AddrRegClass);
17949 BuildMI(offsetMBB, DL, TII->get(X86::SUBREG_TO_REG), OffsetReg64)
17952 .addImm(X86::sub_32bit);
17954 // Add the offset to the reg_save_area to get the final address.
17955 BuildMI(offsetMBB, DL, TII->get(X86::ADD64rr), OffsetDestReg)
17956 .addReg(OffsetReg64)
17957 .addReg(RegSaveReg);
17959 // Compute the offset for the next argument
17960 unsigned NextOffsetReg = MRI.createVirtualRegister(OffsetRegClass);
17961 BuildMI(offsetMBB, DL, TII->get(X86::ADD32ri), NextOffsetReg)
17963 .addImm(UseFPOffset ? 16 : 8);
17965 // Store it back into the va_list.
17966 BuildMI(offsetMBB, DL, TII->get(X86::MOV32mr))
17970 .addDisp(Disp, UseFPOffset ? 4 : 0)
17971 .addOperand(Segment)
17972 .addReg(NextOffsetReg)
17973 .setMemRefs(MMOBegin, MMOEnd);
17976 BuildMI(offsetMBB, DL, TII->get(X86::JMP_4))
17981 // Emit code to use overflow area
17984 // Load the overflow_area address into a register.
17985 unsigned OverflowAddrReg = MRI.createVirtualRegister(AddrRegClass);
17986 BuildMI(overflowMBB, DL, TII->get(X86::MOV64rm), OverflowAddrReg)
17991 .addOperand(Segment)
17992 .setMemRefs(MMOBegin, MMOEnd);
17994 // If we need to align it, do so. Otherwise, just copy the address
17995 // to OverflowDestReg.
17997 // Align the overflow address
17998 assert((Align & (Align-1)) == 0 && "Alignment must be a power of 2");
17999 unsigned TmpReg = MRI.createVirtualRegister(AddrRegClass);
18001 // aligned_addr = (addr + (align-1)) & ~(align-1)
18002 BuildMI(overflowMBB, DL, TII->get(X86::ADD64ri32), TmpReg)
18003 .addReg(OverflowAddrReg)
18006 BuildMI(overflowMBB, DL, TII->get(X86::AND64ri32), OverflowDestReg)
18008 .addImm(~(uint64_t)(Align-1));
18010 BuildMI(overflowMBB, DL, TII->get(TargetOpcode::COPY), OverflowDestReg)
18011 .addReg(OverflowAddrReg);
18014 // Compute the next overflow address after this argument.
18015 // (the overflow address should be kept 8-byte aligned)
18016 unsigned NextAddrReg = MRI.createVirtualRegister(AddrRegClass);
18017 BuildMI(overflowMBB, DL, TII->get(X86::ADD64ri32), NextAddrReg)
18018 .addReg(OverflowDestReg)
18019 .addImm(ArgSizeA8);
18021 // Store the new overflow address.
18022 BuildMI(overflowMBB, DL, TII->get(X86::MOV64mr))
18027 .addOperand(Segment)
18028 .addReg(NextAddrReg)
18029 .setMemRefs(MMOBegin, MMOEnd);
18031 // If we branched, emit the PHI to the front of endMBB.
18033 BuildMI(*endMBB, endMBB->begin(), DL,
18034 TII->get(X86::PHI), DestReg)
18035 .addReg(OffsetDestReg).addMBB(offsetMBB)
18036 .addReg(OverflowDestReg).addMBB(overflowMBB);
18039 // Erase the pseudo instruction
18040 MI->eraseFromParent();
18045 MachineBasicBlock *
18046 X86TargetLowering::EmitVAStartSaveXMMRegsWithCustomInserter(
18048 MachineBasicBlock *MBB) const {
18049 // Emit code to save XMM registers to the stack. The ABI says that the
18050 // number of registers to save is given in %al, so it's theoretically
18051 // possible to do an indirect jump trick to avoid saving all of them,
18052 // however this code takes a simpler approach and just executes all
18053 // of the stores if %al is non-zero. It's less code, and it's probably
18054 // easier on the hardware branch predictor, and stores aren't all that
18055 // expensive anyway.
18057 // Create the new basic blocks. One block contains all the XMM stores,
18058 // and one block is the final destination regardless of whether any
18059 // stores were performed.
18060 const BasicBlock *LLVM_BB = MBB->getBasicBlock();
18061 MachineFunction *F = MBB->getParent();
18062 MachineFunction::iterator MBBIter = MBB;
18064 MachineBasicBlock *XMMSaveMBB = F->CreateMachineBasicBlock(LLVM_BB);
18065 MachineBasicBlock *EndMBB = F->CreateMachineBasicBlock(LLVM_BB);
18066 F->insert(MBBIter, XMMSaveMBB);
18067 F->insert(MBBIter, EndMBB);
18069 // Transfer the remainder of MBB and its successor edges to EndMBB.
18070 EndMBB->splice(EndMBB->begin(), MBB,
18071 std::next(MachineBasicBlock::iterator(MI)), MBB->end());
18072 EndMBB->transferSuccessorsAndUpdatePHIs(MBB);
18074 // The original block will now fall through to the XMM save block.
18075 MBB->addSuccessor(XMMSaveMBB);
18076 // The XMMSaveMBB will fall through to the end block.
18077 XMMSaveMBB->addSuccessor(EndMBB);
18079 // Now add the instructions.
18080 const TargetInstrInfo *TII = MBB->getParent()->getSubtarget().getInstrInfo();
18081 DebugLoc DL = MI->getDebugLoc();
18083 unsigned CountReg = MI->getOperand(0).getReg();
18084 int64_t RegSaveFrameIndex = MI->getOperand(1).getImm();
18085 int64_t VarArgsFPOffset = MI->getOperand(2).getImm();
18087 if (!Subtarget->isTargetWin64()) {
18088 // If %al is 0, branch around the XMM save block.
18089 BuildMI(MBB, DL, TII->get(X86::TEST8rr)).addReg(CountReg).addReg(CountReg);
18090 BuildMI(MBB, DL, TII->get(X86::JE_4)).addMBB(EndMBB);
18091 MBB->addSuccessor(EndMBB);
18094 // Make sure the last operand is EFLAGS, which gets clobbered by the branch
18095 // that was just emitted, but clearly shouldn't be "saved".
18096 assert((MI->getNumOperands() <= 3 ||
18097 !MI->getOperand(MI->getNumOperands() - 1).isReg() ||
18098 MI->getOperand(MI->getNumOperands() - 1).getReg() == X86::EFLAGS)
18099 && "Expected last argument to be EFLAGS");
18100 unsigned MOVOpc = Subtarget->hasFp256() ? X86::VMOVAPSmr : X86::MOVAPSmr;
18101 // In the XMM save block, save all the XMM argument registers.
18102 for (int i = 3, e = MI->getNumOperands() - 1; i != e; ++i) {
18103 int64_t Offset = (i - 3) * 16 + VarArgsFPOffset;
18104 MachineMemOperand *MMO =
18105 F->getMachineMemOperand(
18106 MachinePointerInfo::getFixedStack(RegSaveFrameIndex, Offset),
18107 MachineMemOperand::MOStore,
18108 /*Size=*/16, /*Align=*/16);
18109 BuildMI(XMMSaveMBB, DL, TII->get(MOVOpc))
18110 .addFrameIndex(RegSaveFrameIndex)
18111 .addImm(/*Scale=*/1)
18112 .addReg(/*IndexReg=*/0)
18113 .addImm(/*Disp=*/Offset)
18114 .addReg(/*Segment=*/0)
18115 .addReg(MI->getOperand(i).getReg())
18116 .addMemOperand(MMO);
18119 MI->eraseFromParent(); // The pseudo instruction is gone now.
18124 // The EFLAGS operand of SelectItr might be missing a kill marker
18125 // because there were multiple uses of EFLAGS, and ISel didn't know
18126 // which to mark. Figure out whether SelectItr should have had a
18127 // kill marker, and set it if it should. Returns the correct kill
18129 static bool checkAndUpdateEFLAGSKill(MachineBasicBlock::iterator SelectItr,
18130 MachineBasicBlock* BB,
18131 const TargetRegisterInfo* TRI) {
18132 // Scan forward through BB for a use/def of EFLAGS.
18133 MachineBasicBlock::iterator miI(std::next(SelectItr));
18134 for (MachineBasicBlock::iterator miE = BB->end(); miI != miE; ++miI) {
18135 const MachineInstr& mi = *miI;
18136 if (mi.readsRegister(X86::EFLAGS))
18138 if (mi.definesRegister(X86::EFLAGS))
18139 break; // Should have kill-flag - update below.
18142 // If we hit the end of the block, check whether EFLAGS is live into a
18144 if (miI == BB->end()) {
18145 for (MachineBasicBlock::succ_iterator sItr = BB->succ_begin(),
18146 sEnd = BB->succ_end();
18147 sItr != sEnd; ++sItr) {
18148 MachineBasicBlock* succ = *sItr;
18149 if (succ->isLiveIn(X86::EFLAGS))
18154 // We found a def, or hit the end of the basic block and EFLAGS wasn't live
18155 // out. SelectMI should have a kill flag on EFLAGS.
18156 SelectItr->addRegisterKilled(X86::EFLAGS, TRI);
18160 MachineBasicBlock *
18161 X86TargetLowering::EmitLoweredSelect(MachineInstr *MI,
18162 MachineBasicBlock *BB) const {
18163 const TargetInstrInfo *TII = BB->getParent()->getSubtarget().getInstrInfo();
18164 DebugLoc DL = MI->getDebugLoc();
18166 // To "insert" a SELECT_CC instruction, we actually have to insert the
18167 // diamond control-flow pattern. The incoming instruction knows the
18168 // destination vreg to set, the condition code register to branch on, the
18169 // true/false values to select between, and a branch opcode to use.
18170 const BasicBlock *LLVM_BB = BB->getBasicBlock();
18171 MachineFunction::iterator It = BB;
18177 // cmpTY ccX, r1, r2
18179 // fallthrough --> copy0MBB
18180 MachineBasicBlock *thisMBB = BB;
18181 MachineFunction *F = BB->getParent();
18182 MachineBasicBlock *copy0MBB = F->CreateMachineBasicBlock(LLVM_BB);
18183 MachineBasicBlock *sinkMBB = F->CreateMachineBasicBlock(LLVM_BB);
18184 F->insert(It, copy0MBB);
18185 F->insert(It, sinkMBB);
18187 // If the EFLAGS register isn't dead in the terminator, then claim that it's
18188 // live into the sink and copy blocks.
18189 const TargetRegisterInfo *TRI =
18190 BB->getParent()->getSubtarget().getRegisterInfo();
18191 if (!MI->killsRegister(X86::EFLAGS) &&
18192 !checkAndUpdateEFLAGSKill(MI, BB, TRI)) {
18193 copy0MBB->addLiveIn(X86::EFLAGS);
18194 sinkMBB->addLiveIn(X86::EFLAGS);
18197 // Transfer the remainder of BB and its successor edges to sinkMBB.
18198 sinkMBB->splice(sinkMBB->begin(), BB,
18199 std::next(MachineBasicBlock::iterator(MI)), BB->end());
18200 sinkMBB->transferSuccessorsAndUpdatePHIs(BB);
18202 // Add the true and fallthrough blocks as its successors.
18203 BB->addSuccessor(copy0MBB);
18204 BB->addSuccessor(sinkMBB);
18206 // Create the conditional branch instruction.
18208 X86::GetCondBranchFromCond((X86::CondCode)MI->getOperand(3).getImm());
18209 BuildMI(BB, DL, TII->get(Opc)).addMBB(sinkMBB);
18212 // %FalseValue = ...
18213 // # fallthrough to sinkMBB
18214 copy0MBB->addSuccessor(sinkMBB);
18217 // %Result = phi [ %FalseValue, copy0MBB ], [ %TrueValue, thisMBB ]
18219 BuildMI(*sinkMBB, sinkMBB->begin(), DL,
18220 TII->get(X86::PHI), MI->getOperand(0).getReg())
18221 .addReg(MI->getOperand(1).getReg()).addMBB(copy0MBB)
18222 .addReg(MI->getOperand(2).getReg()).addMBB(thisMBB);
18224 MI->eraseFromParent(); // The pseudo instruction is gone now.
18228 MachineBasicBlock *
18229 X86TargetLowering::EmitLoweredSegAlloca(MachineInstr *MI, MachineBasicBlock *BB,
18230 bool Is64Bit) const {
18231 MachineFunction *MF = BB->getParent();
18232 const TargetInstrInfo *TII = MF->getSubtarget().getInstrInfo();
18233 DebugLoc DL = MI->getDebugLoc();
18234 const BasicBlock *LLVM_BB = BB->getBasicBlock();
18236 assert(MF->shouldSplitStack());
18238 unsigned TlsReg = Is64Bit ? X86::FS : X86::GS;
18239 unsigned TlsOffset = Is64Bit ? 0x70 : 0x30;
18242 // ... [Till the alloca]
18243 // If stacklet is not large enough, jump to mallocMBB
18246 // Allocate by subtracting from RSP
18247 // Jump to continueMBB
18250 // Allocate by call to runtime
18254 // [rest of original BB]
18257 MachineBasicBlock *mallocMBB = MF->CreateMachineBasicBlock(LLVM_BB);
18258 MachineBasicBlock *bumpMBB = MF->CreateMachineBasicBlock(LLVM_BB);
18259 MachineBasicBlock *continueMBB = MF->CreateMachineBasicBlock(LLVM_BB);
18261 MachineRegisterInfo &MRI = MF->getRegInfo();
18262 const TargetRegisterClass *AddrRegClass =
18263 getRegClassFor(Is64Bit ? MVT::i64:MVT::i32);
18265 unsigned mallocPtrVReg = MRI.createVirtualRegister(AddrRegClass),
18266 bumpSPPtrVReg = MRI.createVirtualRegister(AddrRegClass),
18267 tmpSPVReg = MRI.createVirtualRegister(AddrRegClass),
18268 SPLimitVReg = MRI.createVirtualRegister(AddrRegClass),
18269 sizeVReg = MI->getOperand(1).getReg(),
18270 physSPReg = Is64Bit ? X86::RSP : X86::ESP;
18272 MachineFunction::iterator MBBIter = BB;
18275 MF->insert(MBBIter, bumpMBB);
18276 MF->insert(MBBIter, mallocMBB);
18277 MF->insert(MBBIter, continueMBB);
18279 continueMBB->splice(continueMBB->begin(), BB,
18280 std::next(MachineBasicBlock::iterator(MI)), BB->end());
18281 continueMBB->transferSuccessorsAndUpdatePHIs(BB);
18283 // Add code to the main basic block to check if the stack limit has been hit,
18284 // and if so, jump to mallocMBB otherwise to bumpMBB.
18285 BuildMI(BB, DL, TII->get(TargetOpcode::COPY), tmpSPVReg).addReg(physSPReg);
18286 BuildMI(BB, DL, TII->get(Is64Bit ? X86::SUB64rr:X86::SUB32rr), SPLimitVReg)
18287 .addReg(tmpSPVReg).addReg(sizeVReg);
18288 BuildMI(BB, DL, TII->get(Is64Bit ? X86::CMP64mr:X86::CMP32mr))
18289 .addReg(0).addImm(1).addReg(0).addImm(TlsOffset).addReg(TlsReg)
18290 .addReg(SPLimitVReg);
18291 BuildMI(BB, DL, TII->get(X86::JG_4)).addMBB(mallocMBB);
18293 // bumpMBB simply decreases the stack pointer, since we know the current
18294 // stacklet has enough space.
18295 BuildMI(bumpMBB, DL, TII->get(TargetOpcode::COPY), physSPReg)
18296 .addReg(SPLimitVReg);
18297 BuildMI(bumpMBB, DL, TII->get(TargetOpcode::COPY), bumpSPPtrVReg)
18298 .addReg(SPLimitVReg);
18299 BuildMI(bumpMBB, DL, TII->get(X86::JMP_4)).addMBB(continueMBB);
18301 // Calls into a routine in libgcc to allocate more space from the heap.
18302 const uint32_t *RegMask = MF->getTarget()
18303 .getSubtargetImpl()
18304 ->getRegisterInfo()
18305 ->getCallPreservedMask(CallingConv::C);
18307 BuildMI(mallocMBB, DL, TII->get(X86::MOV64rr), X86::RDI)
18309 BuildMI(mallocMBB, DL, TII->get(X86::CALL64pcrel32))
18310 .addExternalSymbol("__morestack_allocate_stack_space")
18311 .addRegMask(RegMask)
18312 .addReg(X86::RDI, RegState::Implicit)
18313 .addReg(X86::RAX, RegState::ImplicitDefine);
18315 BuildMI(mallocMBB, DL, TII->get(X86::SUB32ri), physSPReg).addReg(physSPReg)
18317 BuildMI(mallocMBB, DL, TII->get(X86::PUSH32r)).addReg(sizeVReg);
18318 BuildMI(mallocMBB, DL, TII->get(X86::CALLpcrel32))
18319 .addExternalSymbol("__morestack_allocate_stack_space")
18320 .addRegMask(RegMask)
18321 .addReg(X86::EAX, RegState::ImplicitDefine);
18325 BuildMI(mallocMBB, DL, TII->get(X86::ADD32ri), physSPReg).addReg(physSPReg)
18328 BuildMI(mallocMBB, DL, TII->get(TargetOpcode::COPY), mallocPtrVReg)
18329 .addReg(Is64Bit ? X86::RAX : X86::EAX);
18330 BuildMI(mallocMBB, DL, TII->get(X86::JMP_4)).addMBB(continueMBB);
18332 // Set up the CFG correctly.
18333 BB->addSuccessor(bumpMBB);
18334 BB->addSuccessor(mallocMBB);
18335 mallocMBB->addSuccessor(continueMBB);
18336 bumpMBB->addSuccessor(continueMBB);
18338 // Take care of the PHI nodes.
18339 BuildMI(*continueMBB, continueMBB->begin(), DL, TII->get(X86::PHI),
18340 MI->getOperand(0).getReg())
18341 .addReg(mallocPtrVReg).addMBB(mallocMBB)
18342 .addReg(bumpSPPtrVReg).addMBB(bumpMBB);
18344 // Delete the original pseudo instruction.
18345 MI->eraseFromParent();
18348 return continueMBB;
18351 MachineBasicBlock *
18352 X86TargetLowering::EmitLoweredWinAlloca(MachineInstr *MI,
18353 MachineBasicBlock *BB) const {
18354 const TargetInstrInfo *TII = BB->getParent()->getSubtarget().getInstrInfo();
18355 DebugLoc DL = MI->getDebugLoc();
18357 assert(!Subtarget->isTargetMacho());
18359 // The lowering is pretty easy: we're just emitting the call to _alloca. The
18360 // non-trivial part is impdef of ESP.
18362 if (Subtarget->isTargetWin64()) {
18363 if (Subtarget->isTargetCygMing()) {
18364 // ___chkstk(Mingw64):
18365 // Clobbers R10, R11, RAX and EFLAGS.
18367 BuildMI(*BB, MI, DL, TII->get(X86::W64ALLOCA))
18368 .addExternalSymbol("___chkstk")
18369 .addReg(X86::RAX, RegState::Implicit)
18370 .addReg(X86::RSP, RegState::Implicit)
18371 .addReg(X86::RAX, RegState::Define | RegState::Implicit)
18372 .addReg(X86::RSP, RegState::Define | RegState::Implicit)
18373 .addReg(X86::EFLAGS, RegState::Define | RegState::Implicit);
18375 // __chkstk(MSVCRT): does not update stack pointer.
18376 // Clobbers R10, R11 and EFLAGS.
18377 BuildMI(*BB, MI, DL, TII->get(X86::W64ALLOCA))
18378 .addExternalSymbol("__chkstk")
18379 .addReg(X86::RAX, RegState::Implicit)
18380 .addReg(X86::EFLAGS, RegState::Define | RegState::Implicit);
18381 // RAX has the offset to be subtracted from RSP.
18382 BuildMI(*BB, MI, DL, TII->get(X86::SUB64rr), X86::RSP)
18387 const char *StackProbeSymbol =
18388 Subtarget->isTargetKnownWindowsMSVC() ? "_chkstk" : "_alloca";
18390 BuildMI(*BB, MI, DL, TII->get(X86::CALLpcrel32))
18391 .addExternalSymbol(StackProbeSymbol)
18392 .addReg(X86::EAX, RegState::Implicit)
18393 .addReg(X86::ESP, RegState::Implicit)
18394 .addReg(X86::EAX, RegState::Define | RegState::Implicit)
18395 .addReg(X86::ESP, RegState::Define | RegState::Implicit)
18396 .addReg(X86::EFLAGS, RegState::Define | RegState::Implicit);
18399 MI->eraseFromParent(); // The pseudo instruction is gone now.
18403 MachineBasicBlock *
18404 X86TargetLowering::EmitLoweredTLSCall(MachineInstr *MI,
18405 MachineBasicBlock *BB) const {
18406 // This is pretty easy. We're taking the value that we received from
18407 // our load from the relocation, sticking it in either RDI (x86-64)
18408 // or EAX and doing an indirect call. The return value will then
18409 // be in the normal return register.
18410 MachineFunction *F = BB->getParent();
18411 const X86InstrInfo *TII =
18412 static_cast<const X86InstrInfo *>(F->getSubtarget().getInstrInfo());
18413 DebugLoc DL = MI->getDebugLoc();
18415 assert(Subtarget->isTargetDarwin() && "Darwin only instr emitted?");
18416 assert(MI->getOperand(3).isGlobal() && "This should be a global");
18418 // Get a register mask for the lowered call.
18419 // FIXME: The 32-bit calls have non-standard calling conventions. Use a
18420 // proper register mask.
18421 const uint32_t *RegMask = F->getTarget()
18422 .getSubtargetImpl()
18423 ->getRegisterInfo()
18424 ->getCallPreservedMask(CallingConv::C);
18425 if (Subtarget->is64Bit()) {
18426 MachineInstrBuilder MIB = BuildMI(*BB, MI, DL,
18427 TII->get(X86::MOV64rm), X86::RDI)
18429 .addImm(0).addReg(0)
18430 .addGlobalAddress(MI->getOperand(3).getGlobal(), 0,
18431 MI->getOperand(3).getTargetFlags())
18433 MIB = BuildMI(*BB, MI, DL, TII->get(X86::CALL64m));
18434 addDirectMem(MIB, X86::RDI);
18435 MIB.addReg(X86::RAX, RegState::ImplicitDefine).addRegMask(RegMask);
18436 } else if (F->getTarget().getRelocationModel() != Reloc::PIC_) {
18437 MachineInstrBuilder MIB = BuildMI(*BB, MI, DL,
18438 TII->get(X86::MOV32rm), X86::EAX)
18440 .addImm(0).addReg(0)
18441 .addGlobalAddress(MI->getOperand(3).getGlobal(), 0,
18442 MI->getOperand(3).getTargetFlags())
18444 MIB = BuildMI(*BB, MI, DL, TII->get(X86::CALL32m));
18445 addDirectMem(MIB, X86::EAX);
18446 MIB.addReg(X86::EAX, RegState::ImplicitDefine).addRegMask(RegMask);
18448 MachineInstrBuilder MIB = BuildMI(*BB, MI, DL,
18449 TII->get(X86::MOV32rm), X86::EAX)
18450 .addReg(TII->getGlobalBaseReg(F))
18451 .addImm(0).addReg(0)
18452 .addGlobalAddress(MI->getOperand(3).getGlobal(), 0,
18453 MI->getOperand(3).getTargetFlags())
18455 MIB = BuildMI(*BB, MI, DL, TII->get(X86::CALL32m));
18456 addDirectMem(MIB, X86::EAX);
18457 MIB.addReg(X86::EAX, RegState::ImplicitDefine).addRegMask(RegMask);
18460 MI->eraseFromParent(); // The pseudo instruction is gone now.
18464 MachineBasicBlock *
18465 X86TargetLowering::emitEHSjLjSetJmp(MachineInstr *MI,
18466 MachineBasicBlock *MBB) const {
18467 DebugLoc DL = MI->getDebugLoc();
18468 MachineFunction *MF = MBB->getParent();
18469 const TargetInstrInfo *TII = MF->getSubtarget().getInstrInfo();
18470 MachineRegisterInfo &MRI = MF->getRegInfo();
18472 const BasicBlock *BB = MBB->getBasicBlock();
18473 MachineFunction::iterator I = MBB;
18476 // Memory Reference
18477 MachineInstr::mmo_iterator MMOBegin = MI->memoperands_begin();
18478 MachineInstr::mmo_iterator MMOEnd = MI->memoperands_end();
18481 unsigned MemOpndSlot = 0;
18483 unsigned CurOp = 0;
18485 DstReg = MI->getOperand(CurOp++).getReg();
18486 const TargetRegisterClass *RC = MRI.getRegClass(DstReg);
18487 assert(RC->hasType(MVT::i32) && "Invalid destination!");
18488 unsigned mainDstReg = MRI.createVirtualRegister(RC);
18489 unsigned restoreDstReg = MRI.createVirtualRegister(RC);
18491 MemOpndSlot = CurOp;
18493 MVT PVT = getPointerTy();
18494 assert((PVT == MVT::i64 || PVT == MVT::i32) &&
18495 "Invalid Pointer Size!");
18497 // For v = setjmp(buf), we generate
18500 // buf[LabelOffset] = restoreMBB
18501 // SjLjSetup restoreMBB
18507 // v = phi(main, restore)
18512 MachineBasicBlock *thisMBB = MBB;
18513 MachineBasicBlock *mainMBB = MF->CreateMachineBasicBlock(BB);
18514 MachineBasicBlock *sinkMBB = MF->CreateMachineBasicBlock(BB);
18515 MachineBasicBlock *restoreMBB = MF->CreateMachineBasicBlock(BB);
18516 MF->insert(I, mainMBB);
18517 MF->insert(I, sinkMBB);
18518 MF->push_back(restoreMBB);
18520 MachineInstrBuilder MIB;
18522 // Transfer the remainder of BB and its successor edges to sinkMBB.
18523 sinkMBB->splice(sinkMBB->begin(), MBB,
18524 std::next(MachineBasicBlock::iterator(MI)), MBB->end());
18525 sinkMBB->transferSuccessorsAndUpdatePHIs(MBB);
18528 unsigned PtrStoreOpc = 0;
18529 unsigned LabelReg = 0;
18530 const int64_t LabelOffset = 1 * PVT.getStoreSize();
18531 Reloc::Model RM = MF->getTarget().getRelocationModel();
18532 bool UseImmLabel = (MF->getTarget().getCodeModel() == CodeModel::Small) &&
18533 (RM == Reloc::Static || RM == Reloc::DynamicNoPIC);
18535 // Prepare IP either in reg or imm.
18536 if (!UseImmLabel) {
18537 PtrStoreOpc = (PVT == MVT::i64) ? X86::MOV64mr : X86::MOV32mr;
18538 const TargetRegisterClass *PtrRC = getRegClassFor(PVT);
18539 LabelReg = MRI.createVirtualRegister(PtrRC);
18540 if (Subtarget->is64Bit()) {
18541 MIB = BuildMI(*thisMBB, MI, DL, TII->get(X86::LEA64r), LabelReg)
18545 .addMBB(restoreMBB)
18548 const X86InstrInfo *XII = static_cast<const X86InstrInfo*>(TII);
18549 MIB = BuildMI(*thisMBB, MI, DL, TII->get(X86::LEA32r), LabelReg)
18550 .addReg(XII->getGlobalBaseReg(MF))
18553 .addMBB(restoreMBB, Subtarget->ClassifyBlockAddressReference())
18557 PtrStoreOpc = (PVT == MVT::i64) ? X86::MOV64mi32 : X86::MOV32mi;
18559 MIB = BuildMI(*thisMBB, MI, DL, TII->get(PtrStoreOpc));
18560 for (unsigned i = 0; i < X86::AddrNumOperands; ++i) {
18561 if (i == X86::AddrDisp)
18562 MIB.addDisp(MI->getOperand(MemOpndSlot + i), LabelOffset);
18564 MIB.addOperand(MI->getOperand(MemOpndSlot + i));
18567 MIB.addReg(LabelReg);
18569 MIB.addMBB(restoreMBB);
18570 MIB.setMemRefs(MMOBegin, MMOEnd);
18572 MIB = BuildMI(*thisMBB, MI, DL, TII->get(X86::EH_SjLj_Setup))
18573 .addMBB(restoreMBB);
18575 const X86RegisterInfo *RegInfo = static_cast<const X86RegisterInfo *>(
18576 MF->getSubtarget().getRegisterInfo());
18577 MIB.addRegMask(RegInfo->getNoPreservedMask());
18578 thisMBB->addSuccessor(mainMBB);
18579 thisMBB->addSuccessor(restoreMBB);
18583 BuildMI(mainMBB, DL, TII->get(X86::MOV32r0), mainDstReg);
18584 mainMBB->addSuccessor(sinkMBB);
18587 BuildMI(*sinkMBB, sinkMBB->begin(), DL,
18588 TII->get(X86::PHI), DstReg)
18589 .addReg(mainDstReg).addMBB(mainMBB)
18590 .addReg(restoreDstReg).addMBB(restoreMBB);
18593 BuildMI(restoreMBB, DL, TII->get(X86::MOV32ri), restoreDstReg).addImm(1);
18594 BuildMI(restoreMBB, DL, TII->get(X86::JMP_4)).addMBB(sinkMBB);
18595 restoreMBB->addSuccessor(sinkMBB);
18597 MI->eraseFromParent();
18601 MachineBasicBlock *
18602 X86TargetLowering::emitEHSjLjLongJmp(MachineInstr *MI,
18603 MachineBasicBlock *MBB) const {
18604 DebugLoc DL = MI->getDebugLoc();
18605 MachineFunction *MF = MBB->getParent();
18606 const TargetInstrInfo *TII = MF->getSubtarget().getInstrInfo();
18607 MachineRegisterInfo &MRI = MF->getRegInfo();
18609 // Memory Reference
18610 MachineInstr::mmo_iterator MMOBegin = MI->memoperands_begin();
18611 MachineInstr::mmo_iterator MMOEnd = MI->memoperands_end();
18613 MVT PVT = getPointerTy();
18614 assert((PVT == MVT::i64 || PVT == MVT::i32) &&
18615 "Invalid Pointer Size!");
18617 const TargetRegisterClass *RC =
18618 (PVT == MVT::i64) ? &X86::GR64RegClass : &X86::GR32RegClass;
18619 unsigned Tmp = MRI.createVirtualRegister(RC);
18620 // Since FP is only updated here but NOT referenced, it's treated as GPR.
18621 const X86RegisterInfo *RegInfo = static_cast<const X86RegisterInfo *>(
18622 MF->getSubtarget().getRegisterInfo());
18623 unsigned FP = (PVT == MVT::i64) ? X86::RBP : X86::EBP;
18624 unsigned SP = RegInfo->getStackRegister();
18626 MachineInstrBuilder MIB;
18628 const int64_t LabelOffset = 1 * PVT.getStoreSize();
18629 const int64_t SPOffset = 2 * PVT.getStoreSize();
18631 unsigned PtrLoadOpc = (PVT == MVT::i64) ? X86::MOV64rm : X86::MOV32rm;
18632 unsigned IJmpOpc = (PVT == MVT::i64) ? X86::JMP64r : X86::JMP32r;
18635 MIB = BuildMI(*MBB, MI, DL, TII->get(PtrLoadOpc), FP);
18636 for (unsigned i = 0; i < X86::AddrNumOperands; ++i)
18637 MIB.addOperand(MI->getOperand(i));
18638 MIB.setMemRefs(MMOBegin, MMOEnd);
18640 MIB = BuildMI(*MBB, MI, DL, TII->get(PtrLoadOpc), Tmp);
18641 for (unsigned i = 0; i < X86::AddrNumOperands; ++i) {
18642 if (i == X86::AddrDisp)
18643 MIB.addDisp(MI->getOperand(i), LabelOffset);
18645 MIB.addOperand(MI->getOperand(i));
18647 MIB.setMemRefs(MMOBegin, MMOEnd);
18649 MIB = BuildMI(*MBB, MI, DL, TII->get(PtrLoadOpc), SP);
18650 for (unsigned i = 0; i < X86::AddrNumOperands; ++i) {
18651 if (i == X86::AddrDisp)
18652 MIB.addDisp(MI->getOperand(i), SPOffset);
18654 MIB.addOperand(MI->getOperand(i));
18656 MIB.setMemRefs(MMOBegin, MMOEnd);
18658 BuildMI(*MBB, MI, DL, TII->get(IJmpOpc)).addReg(Tmp);
18660 MI->eraseFromParent();
18664 // Replace 213-type (isel default) FMA3 instructions with 231-type for
18665 // accumulator loops. Writing back to the accumulator allows the coalescer
18666 // to remove extra copies in the loop.
18667 MachineBasicBlock *
18668 X86TargetLowering::emitFMA3Instr(MachineInstr *MI,
18669 MachineBasicBlock *MBB) const {
18670 MachineOperand &AddendOp = MI->getOperand(3);
18672 // Bail out early if the addend isn't a register - we can't switch these.
18673 if (!AddendOp.isReg())
18676 MachineFunction &MF = *MBB->getParent();
18677 MachineRegisterInfo &MRI = MF.getRegInfo();
18679 // Check whether the addend is defined by a PHI:
18680 assert(MRI.hasOneDef(AddendOp.getReg()) && "Multiple defs in SSA?");
18681 MachineInstr &AddendDef = *MRI.def_instr_begin(AddendOp.getReg());
18682 if (!AddendDef.isPHI())
18685 // Look for the following pattern:
18687 // %addend = phi [%entry, 0], [%loop, %result]
18689 // %result<tied1> = FMA213 %m2<tied0>, %m1, %addend
18693 // %addend = phi [%entry, 0], [%loop, %result]
18695 // %result<tied1> = FMA231 %addend<tied0>, %m1, %m2
18697 for (unsigned i = 1, e = AddendDef.getNumOperands(); i < e; i += 2) {
18698 assert(AddendDef.getOperand(i).isReg());
18699 MachineOperand PHISrcOp = AddendDef.getOperand(i);
18700 MachineInstr &PHISrcInst = *MRI.def_instr_begin(PHISrcOp.getReg());
18701 if (&PHISrcInst == MI) {
18702 // Found a matching instruction.
18703 unsigned NewFMAOpc = 0;
18704 switch (MI->getOpcode()) {
18705 case X86::VFMADDPDr213r: NewFMAOpc = X86::VFMADDPDr231r; break;
18706 case X86::VFMADDPSr213r: NewFMAOpc = X86::VFMADDPSr231r; break;
18707 case X86::VFMADDSDr213r: NewFMAOpc = X86::VFMADDSDr231r; break;
18708 case X86::VFMADDSSr213r: NewFMAOpc = X86::VFMADDSSr231r; break;
18709 case X86::VFMSUBPDr213r: NewFMAOpc = X86::VFMSUBPDr231r; break;
18710 case X86::VFMSUBPSr213r: NewFMAOpc = X86::VFMSUBPSr231r; break;
18711 case X86::VFMSUBSDr213r: NewFMAOpc = X86::VFMSUBSDr231r; break;
18712 case X86::VFMSUBSSr213r: NewFMAOpc = X86::VFMSUBSSr231r; break;
18713 case X86::VFNMADDPDr213r: NewFMAOpc = X86::VFNMADDPDr231r; break;
18714 case X86::VFNMADDPSr213r: NewFMAOpc = X86::VFNMADDPSr231r; break;
18715 case X86::VFNMADDSDr213r: NewFMAOpc = X86::VFNMADDSDr231r; break;
18716 case X86::VFNMADDSSr213r: NewFMAOpc = X86::VFNMADDSSr231r; break;
18717 case X86::VFNMSUBPDr213r: NewFMAOpc = X86::VFNMSUBPDr231r; break;
18718 case X86::VFNMSUBPSr213r: NewFMAOpc = X86::VFNMSUBPSr231r; break;
18719 case X86::VFNMSUBSDr213r: NewFMAOpc = X86::VFNMSUBSDr231r; break;
18720 case X86::VFNMSUBSSr213r: NewFMAOpc = X86::VFNMSUBSSr231r; break;
18721 case X86::VFMADDPDr213rY: NewFMAOpc = X86::VFMADDPDr231rY; break;
18722 case X86::VFMADDPSr213rY: NewFMAOpc = X86::VFMADDPSr231rY; break;
18723 case X86::VFMSUBPDr213rY: NewFMAOpc = X86::VFMSUBPDr231rY; break;
18724 case X86::VFMSUBPSr213rY: NewFMAOpc = X86::VFMSUBPSr231rY; break;
18725 case X86::VFNMADDPDr213rY: NewFMAOpc = X86::VFNMADDPDr231rY; break;
18726 case X86::VFNMADDPSr213rY: NewFMAOpc = X86::VFNMADDPSr231rY; break;
18727 case X86::VFNMSUBPDr213rY: NewFMAOpc = X86::VFNMSUBPDr231rY; break;
18728 case X86::VFNMSUBPSr213rY: NewFMAOpc = X86::VFNMSUBPSr231rY; break;
18729 default: llvm_unreachable("Unrecognized FMA variant.");
18732 const TargetInstrInfo &TII = *MF.getSubtarget().getInstrInfo();
18733 MachineInstrBuilder MIB =
18734 BuildMI(MF, MI->getDebugLoc(), TII.get(NewFMAOpc))
18735 .addOperand(MI->getOperand(0))
18736 .addOperand(MI->getOperand(3))
18737 .addOperand(MI->getOperand(2))
18738 .addOperand(MI->getOperand(1));
18739 MBB->insert(MachineBasicBlock::iterator(MI), MIB);
18740 MI->eraseFromParent();
18747 MachineBasicBlock *
18748 X86TargetLowering::EmitInstrWithCustomInserter(MachineInstr *MI,
18749 MachineBasicBlock *BB) const {
18750 switch (MI->getOpcode()) {
18751 default: llvm_unreachable("Unexpected instr type to insert");
18752 case X86::TAILJMPd64:
18753 case X86::TAILJMPr64:
18754 case X86::TAILJMPm64:
18755 llvm_unreachable("TAILJMP64 would not be touched here.");
18756 case X86::TCRETURNdi64:
18757 case X86::TCRETURNri64:
18758 case X86::TCRETURNmi64:
18760 case X86::WIN_ALLOCA:
18761 return EmitLoweredWinAlloca(MI, BB);
18762 case X86::SEG_ALLOCA_32:
18763 return EmitLoweredSegAlloca(MI, BB, false);
18764 case X86::SEG_ALLOCA_64:
18765 return EmitLoweredSegAlloca(MI, BB, true);
18766 case X86::TLSCall_32:
18767 case X86::TLSCall_64:
18768 return EmitLoweredTLSCall(MI, BB);
18769 case X86::CMOV_GR8:
18770 case X86::CMOV_FR32:
18771 case X86::CMOV_FR64:
18772 case X86::CMOV_V4F32:
18773 case X86::CMOV_V2F64:
18774 case X86::CMOV_V2I64:
18775 case X86::CMOV_V8F32:
18776 case X86::CMOV_V4F64:
18777 case X86::CMOV_V4I64:
18778 case X86::CMOV_V16F32:
18779 case X86::CMOV_V8F64:
18780 case X86::CMOV_V8I64:
18781 case X86::CMOV_GR16:
18782 case X86::CMOV_GR32:
18783 case X86::CMOV_RFP32:
18784 case X86::CMOV_RFP64:
18785 case X86::CMOV_RFP80:
18786 return EmitLoweredSelect(MI, BB);
18788 case X86::FP32_TO_INT16_IN_MEM:
18789 case X86::FP32_TO_INT32_IN_MEM:
18790 case X86::FP32_TO_INT64_IN_MEM:
18791 case X86::FP64_TO_INT16_IN_MEM:
18792 case X86::FP64_TO_INT32_IN_MEM:
18793 case X86::FP64_TO_INT64_IN_MEM:
18794 case X86::FP80_TO_INT16_IN_MEM:
18795 case X86::FP80_TO_INT32_IN_MEM:
18796 case X86::FP80_TO_INT64_IN_MEM: {
18797 MachineFunction *F = BB->getParent();
18798 const TargetInstrInfo *TII = F->getSubtarget().getInstrInfo();
18799 DebugLoc DL = MI->getDebugLoc();
18801 // Change the floating point control register to use "round towards zero"
18802 // mode when truncating to an integer value.
18803 int CWFrameIdx = F->getFrameInfo()->CreateStackObject(2, 2, false);
18804 addFrameReference(BuildMI(*BB, MI, DL,
18805 TII->get(X86::FNSTCW16m)), CWFrameIdx);
18807 // Load the old value of the high byte of the control word...
18809 F->getRegInfo().createVirtualRegister(&X86::GR16RegClass);
18810 addFrameReference(BuildMI(*BB, MI, DL, TII->get(X86::MOV16rm), OldCW),
18813 // Set the high part to be round to zero...
18814 addFrameReference(BuildMI(*BB, MI, DL, TII->get(X86::MOV16mi)), CWFrameIdx)
18817 // Reload the modified control word now...
18818 addFrameReference(BuildMI(*BB, MI, DL,
18819 TII->get(X86::FLDCW16m)), CWFrameIdx);
18821 // Restore the memory image of control word to original value
18822 addFrameReference(BuildMI(*BB, MI, DL, TII->get(X86::MOV16mr)), CWFrameIdx)
18825 // Get the X86 opcode to use.
18827 switch (MI->getOpcode()) {
18828 default: llvm_unreachable("illegal opcode!");
18829 case X86::FP32_TO_INT16_IN_MEM: Opc = X86::IST_Fp16m32; break;
18830 case X86::FP32_TO_INT32_IN_MEM: Opc = X86::IST_Fp32m32; break;
18831 case X86::FP32_TO_INT64_IN_MEM: Opc = X86::IST_Fp64m32; break;
18832 case X86::FP64_TO_INT16_IN_MEM: Opc = X86::IST_Fp16m64; break;
18833 case X86::FP64_TO_INT32_IN_MEM: Opc = X86::IST_Fp32m64; break;
18834 case X86::FP64_TO_INT64_IN_MEM: Opc = X86::IST_Fp64m64; break;
18835 case X86::FP80_TO_INT16_IN_MEM: Opc = X86::IST_Fp16m80; break;
18836 case X86::FP80_TO_INT32_IN_MEM: Opc = X86::IST_Fp32m80; break;
18837 case X86::FP80_TO_INT64_IN_MEM: Opc = X86::IST_Fp64m80; break;
18841 MachineOperand &Op = MI->getOperand(0);
18843 AM.BaseType = X86AddressMode::RegBase;
18844 AM.Base.Reg = Op.getReg();
18846 AM.BaseType = X86AddressMode::FrameIndexBase;
18847 AM.Base.FrameIndex = Op.getIndex();
18849 Op = MI->getOperand(1);
18851 AM.Scale = Op.getImm();
18852 Op = MI->getOperand(2);
18854 AM.IndexReg = Op.getImm();
18855 Op = MI->getOperand(3);
18856 if (Op.isGlobal()) {
18857 AM.GV = Op.getGlobal();
18859 AM.Disp = Op.getImm();
18861 addFullAddress(BuildMI(*BB, MI, DL, TII->get(Opc)), AM)
18862 .addReg(MI->getOperand(X86::AddrNumOperands).getReg());
18864 // Reload the original control word now.
18865 addFrameReference(BuildMI(*BB, MI, DL,
18866 TII->get(X86::FLDCW16m)), CWFrameIdx);
18868 MI->eraseFromParent(); // The pseudo instruction is gone now.
18871 // String/text processing lowering.
18872 case X86::PCMPISTRM128REG:
18873 case X86::VPCMPISTRM128REG:
18874 case X86::PCMPISTRM128MEM:
18875 case X86::VPCMPISTRM128MEM:
18876 case X86::PCMPESTRM128REG:
18877 case X86::VPCMPESTRM128REG:
18878 case X86::PCMPESTRM128MEM:
18879 case X86::VPCMPESTRM128MEM:
18880 assert(Subtarget->hasSSE42() &&
18881 "Target must have SSE4.2 or AVX features enabled");
18882 return EmitPCMPSTRM(MI, BB, BB->getParent()->getSubtarget().getInstrInfo());
18884 // String/text processing lowering.
18885 case X86::PCMPISTRIREG:
18886 case X86::VPCMPISTRIREG:
18887 case X86::PCMPISTRIMEM:
18888 case X86::VPCMPISTRIMEM:
18889 case X86::PCMPESTRIREG:
18890 case X86::VPCMPESTRIREG:
18891 case X86::PCMPESTRIMEM:
18892 case X86::VPCMPESTRIMEM:
18893 assert(Subtarget->hasSSE42() &&
18894 "Target must have SSE4.2 or AVX features enabled");
18895 return EmitPCMPSTRI(MI, BB, BB->getParent()->getSubtarget().getInstrInfo());
18897 // Thread synchronization.
18899 return EmitMonitor(MI, BB, BB->getParent()->getSubtarget().getInstrInfo(),
18904 return EmitXBegin(MI, BB, BB->getParent()->getSubtarget().getInstrInfo());
18906 case X86::VASTART_SAVE_XMM_REGS:
18907 return EmitVAStartSaveXMMRegsWithCustomInserter(MI, BB);
18909 case X86::VAARG_64:
18910 return EmitVAARG64WithCustomInserter(MI, BB);
18912 case X86::EH_SjLj_SetJmp32:
18913 case X86::EH_SjLj_SetJmp64:
18914 return emitEHSjLjSetJmp(MI, BB);
18916 case X86::EH_SjLj_LongJmp32:
18917 case X86::EH_SjLj_LongJmp64:
18918 return emitEHSjLjLongJmp(MI, BB);
18920 case TargetOpcode::STACKMAP:
18921 case TargetOpcode::PATCHPOINT:
18922 return emitPatchPoint(MI, BB);
18924 case X86::VFMADDPDr213r:
18925 case X86::VFMADDPSr213r:
18926 case X86::VFMADDSDr213r:
18927 case X86::VFMADDSSr213r:
18928 case X86::VFMSUBPDr213r:
18929 case X86::VFMSUBPSr213r:
18930 case X86::VFMSUBSDr213r:
18931 case X86::VFMSUBSSr213r:
18932 case X86::VFNMADDPDr213r:
18933 case X86::VFNMADDPSr213r:
18934 case X86::VFNMADDSDr213r:
18935 case X86::VFNMADDSSr213r:
18936 case X86::VFNMSUBPDr213r:
18937 case X86::VFNMSUBPSr213r:
18938 case X86::VFNMSUBSDr213r:
18939 case X86::VFNMSUBSSr213r:
18940 case X86::VFMADDPDr213rY:
18941 case X86::VFMADDPSr213rY:
18942 case X86::VFMSUBPDr213rY:
18943 case X86::VFMSUBPSr213rY:
18944 case X86::VFNMADDPDr213rY:
18945 case X86::VFNMADDPSr213rY:
18946 case X86::VFNMSUBPDr213rY:
18947 case X86::VFNMSUBPSr213rY:
18948 return emitFMA3Instr(MI, BB);
18952 //===----------------------------------------------------------------------===//
18953 // X86 Optimization Hooks
18954 //===----------------------------------------------------------------------===//
18956 void X86TargetLowering::computeKnownBitsForTargetNode(const SDValue Op,
18959 const SelectionDAG &DAG,
18960 unsigned Depth) const {
18961 unsigned BitWidth = KnownZero.getBitWidth();
18962 unsigned Opc = Op.getOpcode();
18963 assert((Opc >= ISD::BUILTIN_OP_END ||
18964 Opc == ISD::INTRINSIC_WO_CHAIN ||
18965 Opc == ISD::INTRINSIC_W_CHAIN ||
18966 Opc == ISD::INTRINSIC_VOID) &&
18967 "Should use MaskedValueIsZero if you don't know whether Op"
18968 " is a target node!");
18970 KnownZero = KnownOne = APInt(BitWidth, 0); // Don't know anything.
18984 // These nodes' second result is a boolean.
18985 if (Op.getResNo() == 0)
18988 case X86ISD::SETCC:
18989 KnownZero |= APInt::getHighBitsSet(BitWidth, BitWidth - 1);
18991 case ISD::INTRINSIC_WO_CHAIN: {
18992 unsigned IntId = cast<ConstantSDNode>(Op.getOperand(0))->getZExtValue();
18993 unsigned NumLoBits = 0;
18996 case Intrinsic::x86_sse_movmsk_ps:
18997 case Intrinsic::x86_avx_movmsk_ps_256:
18998 case Intrinsic::x86_sse2_movmsk_pd:
18999 case Intrinsic::x86_avx_movmsk_pd_256:
19000 case Intrinsic::x86_mmx_pmovmskb:
19001 case Intrinsic::x86_sse2_pmovmskb_128:
19002 case Intrinsic::x86_avx2_pmovmskb: {
19003 // High bits of movmskp{s|d}, pmovmskb are known zero.
19005 default: llvm_unreachable("Impossible intrinsic"); // Can't reach here.
19006 case Intrinsic::x86_sse_movmsk_ps: NumLoBits = 4; break;
19007 case Intrinsic::x86_avx_movmsk_ps_256: NumLoBits = 8; break;
19008 case Intrinsic::x86_sse2_movmsk_pd: NumLoBits = 2; break;
19009 case Intrinsic::x86_avx_movmsk_pd_256: NumLoBits = 4; break;
19010 case Intrinsic::x86_mmx_pmovmskb: NumLoBits = 8; break;
19011 case Intrinsic::x86_sse2_pmovmskb_128: NumLoBits = 16; break;
19012 case Intrinsic::x86_avx2_pmovmskb: NumLoBits = 32; break;
19014 KnownZero = APInt::getHighBitsSet(BitWidth, BitWidth - NumLoBits);
19023 unsigned X86TargetLowering::ComputeNumSignBitsForTargetNode(
19025 const SelectionDAG &,
19026 unsigned Depth) const {
19027 // SETCC_CARRY sets the dest to ~0 for true or 0 for false.
19028 if (Op.getOpcode() == X86ISD::SETCC_CARRY)
19029 return Op.getValueType().getScalarType().getSizeInBits();
19035 /// isGAPlusOffset - Returns true (and the GlobalValue and the offset) if the
19036 /// node is a GlobalAddress + offset.
19037 bool X86TargetLowering::isGAPlusOffset(SDNode *N,
19038 const GlobalValue* &GA,
19039 int64_t &Offset) const {
19040 if (N->getOpcode() == X86ISD::Wrapper) {
19041 if (isa<GlobalAddressSDNode>(N->getOperand(0))) {
19042 GA = cast<GlobalAddressSDNode>(N->getOperand(0))->getGlobal();
19043 Offset = cast<GlobalAddressSDNode>(N->getOperand(0))->getOffset();
19047 return TargetLowering::isGAPlusOffset(N, GA, Offset);
19050 /// isShuffleHigh128VectorInsertLow - Checks whether the shuffle node is the
19051 /// same as extracting the high 128-bit part of 256-bit vector and then
19052 /// inserting the result into the low part of a new 256-bit vector
19053 static bool isShuffleHigh128VectorInsertLow(ShuffleVectorSDNode *SVOp) {
19054 EVT VT = SVOp->getValueType(0);
19055 unsigned NumElems = VT.getVectorNumElements();
19057 // vector_shuffle <4, 5, 6, 7, u, u, u, u> or <2, 3, u, u>
19058 for (unsigned i = 0, j = NumElems/2; i != NumElems/2; ++i, ++j)
19059 if (!isUndefOrEqual(SVOp->getMaskElt(i), j) ||
19060 SVOp->getMaskElt(j) >= 0)
19066 /// isShuffleLow128VectorInsertHigh - Checks whether the shuffle node is the
19067 /// same as extracting the low 128-bit part of 256-bit vector and then
19068 /// inserting the result into the high part of a new 256-bit vector
19069 static bool isShuffleLow128VectorInsertHigh(ShuffleVectorSDNode *SVOp) {
19070 EVT VT = SVOp->getValueType(0);
19071 unsigned NumElems = VT.getVectorNumElements();
19073 // vector_shuffle <u, u, u, u, 0, 1, 2, 3> or <u, u, 0, 1>
19074 for (unsigned i = NumElems/2, j = 0; i != NumElems; ++i, ++j)
19075 if (!isUndefOrEqual(SVOp->getMaskElt(i), j) ||
19076 SVOp->getMaskElt(j) >= 0)
19082 /// PerformShuffleCombine256 - Performs shuffle combines for 256-bit vectors.
19083 static SDValue PerformShuffleCombine256(SDNode *N, SelectionDAG &DAG,
19084 TargetLowering::DAGCombinerInfo &DCI,
19085 const X86Subtarget* Subtarget) {
19087 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(N);
19088 SDValue V1 = SVOp->getOperand(0);
19089 SDValue V2 = SVOp->getOperand(1);
19090 EVT VT = SVOp->getValueType(0);
19091 unsigned NumElems = VT.getVectorNumElements();
19093 if (V1.getOpcode() == ISD::CONCAT_VECTORS &&
19094 V2.getOpcode() == ISD::CONCAT_VECTORS) {
19098 // V UNDEF BUILD_VECTOR UNDEF
19100 // CONCAT_VECTOR CONCAT_VECTOR
19103 // RESULT: V + zero extended
19105 if (V2.getOperand(0).getOpcode() != ISD::BUILD_VECTOR ||
19106 V2.getOperand(1).getOpcode() != ISD::UNDEF ||
19107 V1.getOperand(1).getOpcode() != ISD::UNDEF)
19110 if (!ISD::isBuildVectorAllZeros(V2.getOperand(0).getNode()))
19113 // To match the shuffle mask, the first half of the mask should
19114 // be exactly the first vector, and all the rest a splat with the
19115 // first element of the second one.
19116 for (unsigned i = 0; i != NumElems/2; ++i)
19117 if (!isUndefOrEqual(SVOp->getMaskElt(i), i) ||
19118 !isUndefOrEqual(SVOp->getMaskElt(i+NumElems/2), NumElems))
19121 // If V1 is coming from a vector load then just fold to a VZEXT_LOAD.
19122 if (LoadSDNode *Ld = dyn_cast<LoadSDNode>(V1.getOperand(0))) {
19123 if (Ld->hasNUsesOfValue(1, 0)) {
19124 SDVTList Tys = DAG.getVTList(MVT::v4i64, MVT::Other);
19125 SDValue Ops[] = { Ld->getChain(), Ld->getBasePtr() };
19127 DAG.getMemIntrinsicNode(X86ISD::VZEXT_LOAD, dl, Tys, Ops,
19129 Ld->getPointerInfo(),
19130 Ld->getAlignment(),
19131 false/*isVolatile*/, true/*ReadMem*/,
19132 false/*WriteMem*/);
19134 // Make sure the newly-created LOAD is in the same position as Ld in
19135 // terms of dependency. We create a TokenFactor for Ld and ResNode,
19136 // and update uses of Ld's output chain to use the TokenFactor.
19137 if (Ld->hasAnyUseOfValue(1)) {
19138 SDValue NewChain = DAG.getNode(ISD::TokenFactor, dl, MVT::Other,
19139 SDValue(Ld, 1), SDValue(ResNode.getNode(), 1));
19140 DAG.ReplaceAllUsesOfValueWith(SDValue(Ld, 1), NewChain);
19141 DAG.UpdateNodeOperands(NewChain.getNode(), SDValue(Ld, 1),
19142 SDValue(ResNode.getNode(), 1));
19145 return DAG.getNode(ISD::BITCAST, dl, VT, ResNode);
19149 // Emit a zeroed vector and insert the desired subvector on its
19151 SDValue Zeros = getZeroVector(VT, Subtarget, DAG, dl);
19152 SDValue InsV = Insert128BitVector(Zeros, V1.getOperand(0), 0, DAG, dl);
19153 return DCI.CombineTo(N, InsV);
19156 //===--------------------------------------------------------------------===//
19157 // Combine some shuffles into subvector extracts and inserts:
19160 // vector_shuffle <4, 5, 6, 7, u, u, u, u> or <2, 3, u, u>
19161 if (isShuffleHigh128VectorInsertLow(SVOp)) {
19162 SDValue V = Extract128BitVector(V1, NumElems/2, DAG, dl);
19163 SDValue InsV = Insert128BitVector(DAG.getUNDEF(VT), V, 0, DAG, dl);
19164 return DCI.CombineTo(N, InsV);
19167 // vector_shuffle <u, u, u, u, 0, 1, 2, 3> or <u, u, 0, 1>
19168 if (isShuffleLow128VectorInsertHigh(SVOp)) {
19169 SDValue V = Extract128BitVector(V1, 0, DAG, dl);
19170 SDValue InsV = Insert128BitVector(DAG.getUNDEF(VT), V, NumElems/2, DAG, dl);
19171 return DCI.CombineTo(N, InsV);
19177 /// \brief Combine an arbitrary chain of shuffles into a single instruction if
19180 /// This is the leaf of the recursive combinine below. When we have found some
19181 /// chain of single-use x86 shuffle instructions and accumulated the combined
19182 /// shuffle mask represented by them, this will try to pattern match that mask
19183 /// into either a single instruction if there is a special purpose instruction
19184 /// for this operation, or into a PSHUFB instruction which is a fully general
19185 /// instruction but should only be used to replace chains over a certain depth.
19186 static bool combineX86ShuffleChain(SDValue Op, SDValue Root, ArrayRef<int> Mask,
19187 int Depth, bool HasPSHUFB, SelectionDAG &DAG,
19188 TargetLowering::DAGCombinerInfo &DCI,
19189 const X86Subtarget *Subtarget) {
19190 assert(!Mask.empty() && "Cannot combine an empty shuffle mask!");
19192 // Find the operand that enters the chain. Note that multiple uses are OK
19193 // here, we're not going to remove the operand we find.
19194 SDValue Input = Op.getOperand(0);
19195 while (Input.getOpcode() == ISD::BITCAST)
19196 Input = Input.getOperand(0);
19198 MVT VT = Input.getSimpleValueType();
19199 MVT RootVT = Root.getSimpleValueType();
19202 // Just remove no-op shuffle masks.
19203 if (Mask.size() == 1) {
19204 DCI.CombineTo(Root.getNode(), DAG.getNode(ISD::BITCAST, DL, RootVT, Input),
19209 // Use the float domain if the operand type is a floating point type.
19210 bool FloatDomain = VT.isFloatingPoint();
19212 // If we don't have access to VEX encodings, the generic PSHUF instructions
19213 // are preferable to some of the specialized forms despite requiring one more
19214 // byte to encode because they can implicitly copy.
19216 // IF we *do* have VEX encodings, than we can use shorter, more specific
19217 // shuffle instructions freely as they can copy due to the extra register
19219 if (Subtarget->hasAVX()) {
19220 // We have both floating point and integer variants of shuffles that dup
19221 // either the low or high half of the vector.
19222 if (Mask.equals(0, 0) || Mask.equals(1, 1)) {
19223 bool Lo = Mask.equals(0, 0);
19224 unsigned Shuffle = FloatDomain ? (Lo ? X86ISD::MOVLHPS : X86ISD::MOVHLPS)
19225 : (Lo ? X86ISD::UNPCKL : X86ISD::UNPCKH);
19226 if (Depth == 1 && Root->getOpcode() == Shuffle)
19227 return false; // Nothing to do!
19228 MVT ShuffleVT = FloatDomain ? MVT::v4f32 : MVT::v2i64;
19229 Op = DAG.getNode(ISD::BITCAST, DL, ShuffleVT, Input);
19230 DCI.AddToWorklist(Op.getNode());
19231 Op = DAG.getNode(Shuffle, DL, ShuffleVT, Op, Op);
19232 DCI.AddToWorklist(Op.getNode());
19233 DCI.CombineTo(Root.getNode(), DAG.getNode(ISD::BITCAST, DL, RootVT, Op),
19238 // FIXME: We should match UNPCKLPS and UNPCKHPS here.
19240 // For the integer domain we have specialized instructions for duplicating
19241 // any element size from the low or high half.
19242 if (!FloatDomain &&
19243 (Mask.equals(0, 0, 1, 1) || Mask.equals(2, 2, 3, 3) ||
19244 Mask.equals(0, 0, 1, 1, 2, 2, 3, 3) ||
19245 Mask.equals(4, 4, 5, 5, 6, 6, 7, 7) ||
19246 Mask.equals(0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7) ||
19247 Mask.equals(8, 8, 9, 9, 10, 10, 11, 11, 12, 12, 13, 13, 14, 14, 15,
19249 bool Lo = Mask[0] == 0;
19250 unsigned Shuffle = Lo ? X86ISD::UNPCKL : X86ISD::UNPCKH;
19251 if (Depth == 1 && Root->getOpcode() == Shuffle)
19252 return false; // Nothing to do!
19254 switch (Mask.size()) {
19255 case 4: ShuffleVT = MVT::v4i32; break;
19256 case 8: ShuffleVT = MVT::v8i16; break;
19257 case 16: ShuffleVT = MVT::v16i8; break;
19259 Op = DAG.getNode(ISD::BITCAST, DL, ShuffleVT, Input);
19260 DCI.AddToWorklist(Op.getNode());
19261 Op = DAG.getNode(Shuffle, DL, ShuffleVT, Op, Op);
19262 DCI.AddToWorklist(Op.getNode());
19263 DCI.CombineTo(Root.getNode(), DAG.getNode(ISD::BITCAST, DL, RootVT, Op),
19269 // Don't try to re-form single instruction chains under any circumstances now
19270 // that we've done encoding canonicalization for them.
19274 // If we have 3 or more shuffle instructions or a chain involving PSHUFB, we
19275 // can replace them with a single PSHUFB instruction profitably. Intel's
19276 // manuals suggest only using PSHUFB if doing so replacing 5 instructions, but
19277 // in practice PSHUFB tends to be *very* fast so we're more aggressive.
19278 if ((Depth >= 3 || HasPSHUFB) && Subtarget->hasSSSE3()) {
19279 SmallVector<SDValue, 16> PSHUFBMask;
19280 assert(Mask.size() <= 16 && "Can't shuffle elements smaller than bytes!");
19281 int Ratio = 16 / Mask.size();
19282 for (unsigned i = 0; i < 16; ++i) {
19283 int M = Mask[i / Ratio] != SM_SentinelZero
19284 ? Ratio * Mask[i / Ratio] + i % Ratio
19286 PSHUFBMask.push_back(DAG.getConstant(M, MVT::i8));
19288 Op = DAG.getNode(ISD::BITCAST, DL, MVT::v16i8, Input);
19289 DCI.AddToWorklist(Op.getNode());
19290 SDValue PSHUFBMaskOp =
19291 DAG.getNode(ISD::BUILD_VECTOR, DL, MVT::v16i8, PSHUFBMask);
19292 DCI.AddToWorklist(PSHUFBMaskOp.getNode());
19293 Op = DAG.getNode(X86ISD::PSHUFB, DL, MVT::v16i8, Op, PSHUFBMaskOp);
19294 DCI.AddToWorklist(Op.getNode());
19295 DCI.CombineTo(Root.getNode(), DAG.getNode(ISD::BITCAST, DL, RootVT, Op),
19300 // Failed to find any combines.
19304 /// \brief Fully generic combining of x86 shuffle instructions.
19306 /// This should be the last combine run over the x86 shuffle instructions. Once
19307 /// they have been fully optimized, this will recursively consider all chains
19308 /// of single-use shuffle instructions, build a generic model of the cumulative
19309 /// shuffle operation, and check for simpler instructions which implement this
19310 /// operation. We use this primarily for two purposes:
19312 /// 1) Collapse generic shuffles to specialized single instructions when
19313 /// equivalent. In most cases, this is just an encoding size win, but
19314 /// sometimes we will collapse multiple generic shuffles into a single
19315 /// special-purpose shuffle.
19316 /// 2) Look for sequences of shuffle instructions with 3 or more total
19317 /// instructions, and replace them with the slightly more expensive SSSE3
19318 /// PSHUFB instruction if available. We do this as the last combining step
19319 /// to ensure we avoid using PSHUFB if we can implement the shuffle with
19320 /// a suitable short sequence of other instructions. The PHUFB will either
19321 /// use a register or have to read from memory and so is slightly (but only
19322 /// slightly) more expensive than the other shuffle instructions.
19324 /// Because this is inherently a quadratic operation (for each shuffle in
19325 /// a chain, we recurse up the chain), the depth is limited to 8 instructions.
19326 /// This should never be an issue in practice as the shuffle lowering doesn't
19327 /// produce sequences of more than 8 instructions.
19329 /// FIXME: We will currently miss some cases where the redundant shuffling
19330 /// would simplify under the threshold for PSHUFB formation because of
19331 /// combine-ordering. To fix this, we should do the redundant instruction
19332 /// combining in this recursive walk.
19333 static bool combineX86ShufflesRecursively(SDValue Op, SDValue Root,
19334 ArrayRef<int> RootMask,
19335 int Depth, bool HasPSHUFB,
19337 TargetLowering::DAGCombinerInfo &DCI,
19338 const X86Subtarget *Subtarget) {
19339 // Bound the depth of our recursive combine because this is ultimately
19340 // quadratic in nature.
19344 // Directly rip through bitcasts to find the underlying operand.
19345 while (Op.getOpcode() == ISD::BITCAST && Op.getOperand(0).hasOneUse())
19346 Op = Op.getOperand(0);
19348 MVT VT = Op.getSimpleValueType();
19349 if (!VT.isVector())
19350 return false; // Bail if we hit a non-vector.
19351 // FIXME: This routine should be taught about 256-bit shuffles, or a 256-bit
19352 // version should be added.
19353 if (VT.getSizeInBits() != 128)
19356 assert(Root.getSimpleValueType().isVector() &&
19357 "Shuffles operate on vector types!");
19358 assert(VT.getSizeInBits() == Root.getSimpleValueType().getSizeInBits() &&
19359 "Can only combine shuffles of the same vector register size.");
19361 if (!isTargetShuffle(Op.getOpcode()))
19363 SmallVector<int, 16> OpMask;
19365 bool HaveMask = getTargetShuffleMask(Op.getNode(), VT, OpMask, IsUnary);
19366 // We only can combine unary shuffles which we can decode the mask for.
19367 if (!HaveMask || !IsUnary)
19370 assert(VT.getVectorNumElements() == OpMask.size() &&
19371 "Different mask size from vector size!");
19372 assert(((RootMask.size() > OpMask.size() &&
19373 RootMask.size() % OpMask.size() == 0) ||
19374 (OpMask.size() > RootMask.size() &&
19375 OpMask.size() % RootMask.size() == 0) ||
19376 OpMask.size() == RootMask.size()) &&
19377 "The smaller number of elements must divide the larger.");
19378 int RootRatio = std::max<int>(1, OpMask.size() / RootMask.size());
19379 int OpRatio = std::max<int>(1, RootMask.size() / OpMask.size());
19380 assert(((RootRatio == 1 && OpRatio == 1) ||
19381 (RootRatio == 1) != (OpRatio == 1)) &&
19382 "Must not have a ratio for both incoming and op masks!");
19384 SmallVector<int, 16> Mask;
19385 Mask.reserve(std::max(OpMask.size(), RootMask.size()));
19387 // Merge this shuffle operation's mask into our accumulated mask. Note that
19388 // this shuffle's mask will be the first applied to the input, followed by the
19389 // root mask to get us all the way to the root value arrangement. The reason
19390 // for this order is that we are recursing up the operation chain.
19391 for (int i = 0, e = std::max(OpMask.size(), RootMask.size()); i < e; ++i) {
19392 int RootIdx = i / RootRatio;
19393 if (RootMask[RootIdx] == SM_SentinelZero) {
19394 // This is a zero-ed lane, we're done.
19395 Mask.push_back(SM_SentinelZero);
19399 int RootMaskedIdx = RootMask[RootIdx] * RootRatio + i % RootRatio;
19400 int OpIdx = RootMaskedIdx / OpRatio;
19401 if (OpMask[OpIdx] == SM_SentinelZero) {
19402 // The incoming lanes are zero, it doesn't matter which ones we are using.
19403 Mask.push_back(SM_SentinelZero);
19407 // Ok, we have non-zero lanes, map them through.
19408 Mask.push_back(OpMask[OpIdx] * OpRatio +
19409 RootMaskedIdx % OpRatio);
19412 // See if we can recurse into the operand to combine more things.
19413 switch (Op.getOpcode()) {
19414 case X86ISD::PSHUFB:
19416 case X86ISD::PSHUFD:
19417 case X86ISD::PSHUFHW:
19418 case X86ISD::PSHUFLW:
19419 if (Op.getOperand(0).hasOneUse() &&
19420 combineX86ShufflesRecursively(Op.getOperand(0), Root, Mask, Depth + 1,
19421 HasPSHUFB, DAG, DCI, Subtarget))
19425 case X86ISD::UNPCKL:
19426 case X86ISD::UNPCKH:
19427 assert(Op.getOperand(0) == Op.getOperand(1) && "We only combine unary shuffles!");
19428 // We can't check for single use, we have to check that this shuffle is the only user.
19429 if (Op->isOnlyUserOf(Op.getOperand(0).getNode()) &&
19430 combineX86ShufflesRecursively(Op.getOperand(0), Root, Mask, Depth + 1,
19431 HasPSHUFB, DAG, DCI, Subtarget))
19436 // Minor canonicalization of the accumulated shuffle mask to make it easier
19437 // to match below. All this does is detect masks with squential pairs of
19438 // elements, and shrink them to the half-width mask. It does this in a loop
19439 // so it will reduce the size of the mask to the minimal width mask which
19440 // performs an equivalent shuffle.
19441 while (Mask.size() > 1 && canWidenShuffleElements(Mask)) {
19442 for (int i = 0, e = Mask.size() / 2; i < e; ++i)
19443 Mask[i] = Mask[2 * i] / 2;
19444 Mask.resize(Mask.size() / 2);
19447 return combineX86ShuffleChain(Op, Root, Mask, Depth, HasPSHUFB, DAG, DCI,
19451 /// \brief Get the PSHUF-style mask from PSHUF node.
19453 /// This is a very minor wrapper around getTargetShuffleMask to easy forming v4
19454 /// PSHUF-style masks that can be reused with such instructions.
19455 static SmallVector<int, 4> getPSHUFShuffleMask(SDValue N) {
19456 SmallVector<int, 4> Mask;
19458 bool HaveMask = getTargetShuffleMask(N.getNode(), N.getSimpleValueType(), Mask, IsUnary);
19462 switch (N.getOpcode()) {
19463 case X86ISD::PSHUFD:
19465 case X86ISD::PSHUFLW:
19468 case X86ISD::PSHUFHW:
19469 Mask.erase(Mask.begin(), Mask.begin() + 4);
19470 for (int &M : Mask)
19474 llvm_unreachable("No valid shuffle instruction found!");
19478 /// \brief Search for a combinable shuffle across a chain ending in pshufd.
19480 /// We walk up the chain and look for a combinable shuffle, skipping over
19481 /// shuffles that we could hoist this shuffle's transformation past without
19482 /// altering anything.
19484 combineRedundantDWordShuffle(SDValue N, MutableArrayRef<int> Mask,
19486 TargetLowering::DAGCombinerInfo &DCI) {
19487 assert(N.getOpcode() == X86ISD::PSHUFD &&
19488 "Called with something other than an x86 128-bit half shuffle!");
19491 // Walk up a single-use chain looking for a combinable shuffle. Keep a stack
19492 // of the shuffles in the chain so that we can form a fresh chain to replace
19494 SmallVector<SDValue, 8> Chain;
19495 SDValue V = N.getOperand(0);
19496 for (; V.hasOneUse(); V = V.getOperand(0)) {
19497 switch (V.getOpcode()) {
19499 return SDValue(); // Nothing combined!
19502 // Skip bitcasts as we always know the type for the target specific
19506 case X86ISD::PSHUFD:
19507 // Found another dword shuffle.
19510 case X86ISD::PSHUFLW:
19511 // Check that the low words (being shuffled) are the identity in the
19512 // dword shuffle, and the high words are self-contained.
19513 if (Mask[0] != 0 || Mask[1] != 1 ||
19514 !(Mask[2] >= 2 && Mask[2] < 4 && Mask[3] >= 2 && Mask[3] < 4))
19517 Chain.push_back(V);
19520 case X86ISD::PSHUFHW:
19521 // Check that the high words (being shuffled) are the identity in the
19522 // dword shuffle, and the low words are self-contained.
19523 if (Mask[2] != 2 || Mask[3] != 3 ||
19524 !(Mask[0] >= 0 && Mask[0] < 2 && Mask[1] >= 0 && Mask[1] < 2))
19527 Chain.push_back(V);
19530 case X86ISD::UNPCKL:
19531 case X86ISD::UNPCKH:
19532 // For either i8 -> i16 or i16 -> i32 unpacks, we can combine a dword
19533 // shuffle into a preceding word shuffle.
19534 if (V.getValueType() != MVT::v16i8 && V.getValueType() != MVT::v8i16)
19537 // Search for a half-shuffle which we can combine with.
19538 unsigned CombineOp =
19539 V.getOpcode() == X86ISD::UNPCKL ? X86ISD::PSHUFLW : X86ISD::PSHUFHW;
19540 if (V.getOperand(0) != V.getOperand(1) ||
19541 !V->isOnlyUserOf(V.getOperand(0).getNode()))
19543 Chain.push_back(V);
19544 V = V.getOperand(0);
19546 switch (V.getOpcode()) {
19548 return SDValue(); // Nothing to combine.
19550 case X86ISD::PSHUFLW:
19551 case X86ISD::PSHUFHW:
19552 if (V.getOpcode() == CombineOp)
19555 Chain.push_back(V);
19559 V = V.getOperand(0);
19563 } while (V.hasOneUse());
19566 // Break out of the loop if we break out of the switch.
19570 if (!V.hasOneUse())
19571 // We fell out of the loop without finding a viable combining instruction.
19574 // Merge this node's mask and our incoming mask.
19575 SmallVector<int, 4> VMask = getPSHUFShuffleMask(V);
19576 for (int &M : Mask)
19578 V = DAG.getNode(V.getOpcode(), DL, V.getValueType(), V.getOperand(0),
19579 getV4X86ShuffleImm8ForMask(Mask, DAG));
19581 // Rebuild the chain around this new shuffle.
19582 while (!Chain.empty()) {
19583 SDValue W = Chain.pop_back_val();
19585 if (V.getValueType() != W.getOperand(0).getValueType())
19586 V = DAG.getNode(ISD::BITCAST, DL, W.getOperand(0).getValueType(), V);
19588 switch (W.getOpcode()) {
19590 llvm_unreachable("Only PSHUF and UNPCK instructions get here!");
19592 case X86ISD::UNPCKL:
19593 case X86ISD::UNPCKH:
19594 V = DAG.getNode(W.getOpcode(), DL, W.getValueType(), V, V);
19597 case X86ISD::PSHUFD:
19598 case X86ISD::PSHUFLW:
19599 case X86ISD::PSHUFHW:
19600 V = DAG.getNode(W.getOpcode(), DL, W.getValueType(), V, W.getOperand(1));
19604 if (V.getValueType() != N.getValueType())
19605 V = DAG.getNode(ISD::BITCAST, DL, N.getValueType(), V);
19607 // Return the new chain to replace N.
19611 /// \brief Search for a combinable shuffle across a chain ending in pshuflw or pshufhw.
19613 /// We walk up the chain, skipping shuffles of the other half and looking
19614 /// through shuffles which switch halves trying to find a shuffle of the same
19615 /// pair of dwords.
19616 static bool combineRedundantHalfShuffle(SDValue N, MutableArrayRef<int> Mask,
19618 TargetLowering::DAGCombinerInfo &DCI) {
19620 (N.getOpcode() == X86ISD::PSHUFLW || N.getOpcode() == X86ISD::PSHUFHW) &&
19621 "Called with something other than an x86 128-bit half shuffle!");
19623 unsigned CombineOpcode = N.getOpcode();
19625 // Walk up a single-use chain looking for a combinable shuffle.
19626 SDValue V = N.getOperand(0);
19627 for (; V.hasOneUse(); V = V.getOperand(0)) {
19628 switch (V.getOpcode()) {
19630 return false; // Nothing combined!
19633 // Skip bitcasts as we always know the type for the target specific
19637 case X86ISD::PSHUFLW:
19638 case X86ISD::PSHUFHW:
19639 if (V.getOpcode() == CombineOpcode)
19642 // Other-half shuffles are no-ops.
19645 // Break out of the loop if we break out of the switch.
19649 if (!V.hasOneUse())
19650 // We fell out of the loop without finding a viable combining instruction.
19653 // Combine away the bottom node as its shuffle will be accumulated into
19654 // a preceding shuffle.
19655 DCI.CombineTo(N.getNode(), N.getOperand(0), /*AddTo*/ true);
19657 // Record the old value.
19660 // Merge this node's mask and our incoming mask (adjusted to account for all
19661 // the pshufd instructions encountered).
19662 SmallVector<int, 4> VMask = getPSHUFShuffleMask(V);
19663 for (int &M : Mask)
19665 V = DAG.getNode(V.getOpcode(), DL, MVT::v8i16, V.getOperand(0),
19666 getV4X86ShuffleImm8ForMask(Mask, DAG));
19668 // Check that the shuffles didn't cancel each other out. If not, we need to
19669 // combine to the new one.
19671 // Replace the combinable shuffle with the combined one, updating all users
19672 // so that we re-evaluate the chain here.
19673 DCI.CombineTo(Old.getNode(), V, /*AddTo*/ true);
19678 /// \brief Try to combine x86 target specific shuffles.
19679 static SDValue PerformTargetShuffleCombine(SDValue N, SelectionDAG &DAG,
19680 TargetLowering::DAGCombinerInfo &DCI,
19681 const X86Subtarget *Subtarget) {
19683 MVT VT = N.getSimpleValueType();
19684 SmallVector<int, 4> Mask;
19686 switch (N.getOpcode()) {
19687 case X86ISD::PSHUFD:
19688 case X86ISD::PSHUFLW:
19689 case X86ISD::PSHUFHW:
19690 Mask = getPSHUFShuffleMask(N);
19691 assert(Mask.size() == 4);
19697 // Nuke no-op shuffles that show up after combining.
19698 if (isNoopShuffleMask(Mask))
19699 return DCI.CombineTo(N.getNode(), N.getOperand(0), /*AddTo*/ true);
19701 // Look for simplifications involving one or two shuffle instructions.
19702 SDValue V = N.getOperand(0);
19703 switch (N.getOpcode()) {
19706 case X86ISD::PSHUFLW:
19707 case X86ISD::PSHUFHW:
19708 assert(VT == MVT::v8i16);
19711 if (combineRedundantHalfShuffle(N, Mask, DAG, DCI))
19712 return SDValue(); // We combined away this shuffle, so we're done.
19714 // See if this reduces to a PSHUFD which is no more expensive and can
19715 // combine with more operations.
19716 if (canWidenShuffleElements(Mask)) {
19717 int DMask[] = {-1, -1, -1, -1};
19718 int DOffset = N.getOpcode() == X86ISD::PSHUFLW ? 0 : 2;
19719 DMask[DOffset + 0] = DOffset + Mask[0] / 2;
19720 DMask[DOffset + 1] = DOffset + Mask[2] / 2;
19721 V = DAG.getNode(ISD::BITCAST, DL, MVT::v4i32, V);
19722 DCI.AddToWorklist(V.getNode());
19723 V = DAG.getNode(X86ISD::PSHUFD, DL, MVT::v4i32, V,
19724 getV4X86ShuffleImm8ForMask(DMask, DAG));
19725 DCI.AddToWorklist(V.getNode());
19726 return DAG.getNode(ISD::BITCAST, DL, MVT::v8i16, V);
19729 // Look for shuffle patterns which can be implemented as a single unpack.
19730 // FIXME: This doesn't handle the location of the PSHUFD generically, and
19731 // only works when we have a PSHUFD followed by two half-shuffles.
19732 if (Mask[0] == Mask[1] && Mask[2] == Mask[3] &&
19733 (V.getOpcode() == X86ISD::PSHUFLW ||
19734 V.getOpcode() == X86ISD::PSHUFHW) &&
19735 V.getOpcode() != N.getOpcode() &&
19737 SDValue D = V.getOperand(0);
19738 while (D.getOpcode() == ISD::BITCAST && D.hasOneUse())
19739 D = D.getOperand(0);
19740 if (D.getOpcode() == X86ISD::PSHUFD && D.hasOneUse()) {
19741 SmallVector<int, 4> VMask = getPSHUFShuffleMask(V);
19742 SmallVector<int, 4> DMask = getPSHUFShuffleMask(D);
19743 int NOffset = N.getOpcode() == X86ISD::PSHUFLW ? 0 : 4;
19744 int VOffset = V.getOpcode() == X86ISD::PSHUFLW ? 0 : 4;
19746 for (int i = 0; i < 4; ++i) {
19747 WordMask[i + NOffset] = Mask[i] + NOffset;
19748 WordMask[i + VOffset] = VMask[i] + VOffset;
19750 // Map the word mask through the DWord mask.
19752 for (int i = 0; i < 8; ++i)
19753 MappedMask[i] = 2 * DMask[WordMask[i] / 2] + WordMask[i] % 2;
19754 const int UnpackLoMask[] = {0, 0, 1, 1, 2, 2, 3, 3};
19755 const int UnpackHiMask[] = {4, 4, 5, 5, 6, 6, 7, 7};
19756 if (std::equal(std::begin(MappedMask), std::end(MappedMask),
19757 std::begin(UnpackLoMask)) ||
19758 std::equal(std::begin(MappedMask), std::end(MappedMask),
19759 std::begin(UnpackHiMask))) {
19760 // We can replace all three shuffles with an unpack.
19761 V = DAG.getNode(ISD::BITCAST, DL, MVT::v8i16, D.getOperand(0));
19762 DCI.AddToWorklist(V.getNode());
19763 return DAG.getNode(MappedMask[0] == 0 ? X86ISD::UNPCKL
19765 DL, MVT::v8i16, V, V);
19772 case X86ISD::PSHUFD:
19773 if (SDValue NewN = combineRedundantDWordShuffle(N, Mask, DAG, DCI))
19782 /// PerformShuffleCombine - Performs several different shuffle combines.
19783 static SDValue PerformShuffleCombine(SDNode *N, SelectionDAG &DAG,
19784 TargetLowering::DAGCombinerInfo &DCI,
19785 const X86Subtarget *Subtarget) {
19787 SDValue N0 = N->getOperand(0);
19788 SDValue N1 = N->getOperand(1);
19789 EVT VT = N->getValueType(0);
19791 // Don't create instructions with illegal types after legalize types has run.
19792 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
19793 if (!DCI.isBeforeLegalize() && !TLI.isTypeLegal(VT.getVectorElementType()))
19796 // Combine 256-bit vector shuffles. This is only profitable when in AVX mode
19797 if (Subtarget->hasFp256() && VT.is256BitVector() &&
19798 N->getOpcode() == ISD::VECTOR_SHUFFLE)
19799 return PerformShuffleCombine256(N, DAG, DCI, Subtarget);
19801 // During Type Legalization, when promoting illegal vector types,
19802 // the backend might introduce new shuffle dag nodes and bitcasts.
19804 // This code performs the following transformation:
19805 // fold: (shuffle (bitcast (BINOP A, B)), Undef, <Mask>) ->
19806 // (shuffle (BINOP (bitcast A), (bitcast B)), Undef, <Mask>)
19808 // We do this only if both the bitcast and the BINOP dag nodes have
19809 // one use. Also, perform this transformation only if the new binary
19810 // operation is legal. This is to avoid introducing dag nodes that
19811 // potentially need to be further expanded (or custom lowered) into a
19812 // less optimal sequence of dag nodes.
19813 if (!DCI.isBeforeLegalize() && DCI.isBeforeLegalizeOps() &&
19814 N1.getOpcode() == ISD::UNDEF && N0.hasOneUse() &&
19815 N0.getOpcode() == ISD::BITCAST) {
19816 SDValue BC0 = N0.getOperand(0);
19817 EVT SVT = BC0.getValueType();
19818 unsigned Opcode = BC0.getOpcode();
19819 unsigned NumElts = VT.getVectorNumElements();
19821 if (BC0.hasOneUse() && SVT.isVector() &&
19822 SVT.getVectorNumElements() * 2 == NumElts &&
19823 TLI.isOperationLegal(Opcode, VT)) {
19824 bool CanFold = false;
19836 unsigned SVTNumElts = SVT.getVectorNumElements();
19837 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(N);
19838 for (unsigned i = 0, e = SVTNumElts; i != e && CanFold; ++i)
19839 CanFold = SVOp->getMaskElt(i) == (int)(i * 2);
19840 for (unsigned i = SVTNumElts, e = NumElts; i != e && CanFold; ++i)
19841 CanFold = SVOp->getMaskElt(i) < 0;
19844 SDValue BC00 = DAG.getNode(ISD::BITCAST, dl, VT, BC0.getOperand(0));
19845 SDValue BC01 = DAG.getNode(ISD::BITCAST, dl, VT, BC0.getOperand(1));
19846 SDValue NewBinOp = DAG.getNode(BC0.getOpcode(), dl, VT, BC00, BC01);
19847 return DAG.getVectorShuffle(VT, dl, NewBinOp, N1, &SVOp->getMask()[0]);
19852 // Only handle 128 wide vector from here on.
19853 if (!VT.is128BitVector())
19856 // Combine a vector_shuffle that is equal to build_vector load1, load2, load3,
19857 // load4, <0, 1, 2, 3> into a 128-bit load if the load addresses are
19858 // consecutive, non-overlapping, and in the right order.
19859 SmallVector<SDValue, 16> Elts;
19860 for (unsigned i = 0, e = VT.getVectorNumElements(); i != e; ++i)
19861 Elts.push_back(getShuffleScalarElt(N, i, DAG, 0));
19863 SDValue LD = EltsFromConsecutiveLoads(VT, Elts, dl, DAG, true);
19867 if (isTargetShuffle(N->getOpcode())) {
19869 PerformTargetShuffleCombine(SDValue(N, 0), DAG, DCI, Subtarget);
19870 if (Shuffle.getNode())
19873 // Try recursively combining arbitrary sequences of x86 shuffle
19874 // instructions into higher-order shuffles. We do this after combining
19875 // specific PSHUF instruction sequences into their minimal form so that we
19876 // can evaluate how many specialized shuffle instructions are involved in
19877 // a particular chain.
19878 SmallVector<int, 1> NonceMask; // Just a placeholder.
19879 NonceMask.push_back(0);
19880 if (combineX86ShufflesRecursively(SDValue(N, 0), SDValue(N, 0), NonceMask,
19881 /*Depth*/ 1, /*HasPSHUFB*/ false, DAG,
19883 return SDValue(); // This routine will use CombineTo to replace N.
19889 /// PerformTruncateCombine - Converts truncate operation to
19890 /// a sequence of vector shuffle operations.
19891 /// It is possible when we truncate 256-bit vector to 128-bit vector
19892 static SDValue PerformTruncateCombine(SDNode *N, SelectionDAG &DAG,
19893 TargetLowering::DAGCombinerInfo &DCI,
19894 const X86Subtarget *Subtarget) {
19898 /// XFormVExtractWithShuffleIntoLoad - Check if a vector extract from a target
19899 /// specific shuffle of a load can be folded into a single element load.
19900 /// Similar handling for VECTOR_SHUFFLE is performed by DAGCombiner, but
19901 /// shuffles have been customed lowered so we need to handle those here.
19902 static SDValue XFormVExtractWithShuffleIntoLoad(SDNode *N, SelectionDAG &DAG,
19903 TargetLowering::DAGCombinerInfo &DCI) {
19904 if (DCI.isBeforeLegalizeOps())
19907 SDValue InVec = N->getOperand(0);
19908 SDValue EltNo = N->getOperand(1);
19910 if (!isa<ConstantSDNode>(EltNo))
19913 EVT VT = InVec.getValueType();
19915 if (InVec.getOpcode() == ISD::BITCAST) {
19916 // Don't duplicate a load with other uses.
19917 if (!InVec.hasOneUse())
19919 EVT BCVT = InVec.getOperand(0).getValueType();
19920 if (BCVT.getVectorNumElements() != VT.getVectorNumElements())
19922 InVec = InVec.getOperand(0);
19925 if (!isTargetShuffle(InVec.getOpcode()))
19928 // Don't duplicate a load with other uses.
19929 if (!InVec.hasOneUse())
19932 SmallVector<int, 16> ShuffleMask;
19934 if (!getTargetShuffleMask(InVec.getNode(), VT.getSimpleVT(), ShuffleMask,
19938 // Select the input vector, guarding against out of range extract vector.
19939 unsigned NumElems = VT.getVectorNumElements();
19940 int Elt = cast<ConstantSDNode>(EltNo)->getZExtValue();
19941 int Idx = (Elt > (int)NumElems) ? -1 : ShuffleMask[Elt];
19942 SDValue LdNode = (Idx < (int)NumElems) ? InVec.getOperand(0)
19943 : InVec.getOperand(1);
19945 // If inputs to shuffle are the same for both ops, then allow 2 uses
19946 unsigned AllowedUses = InVec.getOperand(0) == InVec.getOperand(1) ? 2 : 1;
19948 if (LdNode.getOpcode() == ISD::BITCAST) {
19949 // Don't duplicate a load with other uses.
19950 if (!LdNode.getNode()->hasNUsesOfValue(AllowedUses, 0))
19953 AllowedUses = 1; // only allow 1 load use if we have a bitcast
19954 LdNode = LdNode.getOperand(0);
19957 if (!ISD::isNormalLoad(LdNode.getNode()))
19960 LoadSDNode *LN0 = cast<LoadSDNode>(LdNode);
19962 if (!LN0 ||!LN0->hasNUsesOfValue(AllowedUses, 0) || LN0->isVolatile())
19965 EVT EltVT = N->getValueType(0);
19966 // If there's a bitcast before the shuffle, check if the load type and
19967 // alignment is valid.
19968 unsigned Align = LN0->getAlignment();
19969 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
19970 unsigned NewAlign = TLI.getDataLayout()->getABITypeAlignment(
19971 EltVT.getTypeForEVT(*DAG.getContext()));
19973 if (NewAlign > Align || !TLI.isOperationLegalOrCustom(ISD::LOAD, EltVT))
19976 // All checks match so transform back to vector_shuffle so that DAG combiner
19977 // can finish the job
19980 // Create shuffle node taking into account the case that its a unary shuffle
19981 SDValue Shuffle = (UnaryShuffle) ? DAG.getUNDEF(VT) : InVec.getOperand(1);
19982 Shuffle = DAG.getVectorShuffle(InVec.getValueType(), dl,
19983 InVec.getOperand(0), Shuffle,
19985 Shuffle = DAG.getNode(ISD::BITCAST, dl, VT, Shuffle);
19986 return DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, N->getValueType(0), Shuffle,
19990 /// PerformEXTRACT_VECTOR_ELTCombine - Detect vector gather/scatter index
19991 /// generation and convert it from being a bunch of shuffles and extracts
19992 /// to a simple store and scalar loads to extract the elements.
19993 static SDValue PerformEXTRACT_VECTOR_ELTCombine(SDNode *N, SelectionDAG &DAG,
19994 TargetLowering::DAGCombinerInfo &DCI) {
19995 SDValue NewOp = XFormVExtractWithShuffleIntoLoad(N, DAG, DCI);
19996 if (NewOp.getNode())
19999 SDValue InputVector = N->getOperand(0);
20001 // Detect whether we are trying to convert from mmx to i32 and the bitcast
20002 // from mmx to v2i32 has a single usage.
20003 if (InputVector.getNode()->getOpcode() == llvm::ISD::BITCAST &&
20004 InputVector.getNode()->getOperand(0).getValueType() == MVT::x86mmx &&
20005 InputVector.hasOneUse() && N->getValueType(0) == MVT::i32)
20006 return DAG.getNode(X86ISD::MMX_MOVD2W, SDLoc(InputVector),
20007 N->getValueType(0),
20008 InputVector.getNode()->getOperand(0));
20010 // Only operate on vectors of 4 elements, where the alternative shuffling
20011 // gets to be more expensive.
20012 if (InputVector.getValueType() != MVT::v4i32)
20015 // Check whether every use of InputVector is an EXTRACT_VECTOR_ELT with a
20016 // single use which is a sign-extend or zero-extend, and all elements are
20018 SmallVector<SDNode *, 4> Uses;
20019 unsigned ExtractedElements = 0;
20020 for (SDNode::use_iterator UI = InputVector.getNode()->use_begin(),
20021 UE = InputVector.getNode()->use_end(); UI != UE; ++UI) {
20022 if (UI.getUse().getResNo() != InputVector.getResNo())
20025 SDNode *Extract = *UI;
20026 if (Extract->getOpcode() != ISD::EXTRACT_VECTOR_ELT)
20029 if (Extract->getValueType(0) != MVT::i32)
20031 if (!Extract->hasOneUse())
20033 if (Extract->use_begin()->getOpcode() != ISD::SIGN_EXTEND &&
20034 Extract->use_begin()->getOpcode() != ISD::ZERO_EXTEND)
20036 if (!isa<ConstantSDNode>(Extract->getOperand(1)))
20039 // Record which element was extracted.
20040 ExtractedElements |=
20041 1 << cast<ConstantSDNode>(Extract->getOperand(1))->getZExtValue();
20043 Uses.push_back(Extract);
20046 // If not all the elements were used, this may not be worthwhile.
20047 if (ExtractedElements != 15)
20050 // Ok, we've now decided to do the transformation.
20051 SDLoc dl(InputVector);
20053 // Store the value to a temporary stack slot.
20054 SDValue StackPtr = DAG.CreateStackTemporary(InputVector.getValueType());
20055 SDValue Ch = DAG.getStore(DAG.getEntryNode(), dl, InputVector, StackPtr,
20056 MachinePointerInfo(), false, false, 0);
20058 // Replace each use (extract) with a load of the appropriate element.
20059 for (SmallVectorImpl<SDNode *>::iterator UI = Uses.begin(),
20060 UE = Uses.end(); UI != UE; ++UI) {
20061 SDNode *Extract = *UI;
20063 // cOMpute the element's address.
20064 SDValue Idx = Extract->getOperand(1);
20066 InputVector.getValueType().getVectorElementType().getSizeInBits()/8;
20067 uint64_t Offset = EltSize * cast<ConstantSDNode>(Idx)->getZExtValue();
20068 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
20069 SDValue OffsetVal = DAG.getConstant(Offset, TLI.getPointerTy());
20071 SDValue ScalarAddr = DAG.getNode(ISD::ADD, dl, TLI.getPointerTy(),
20072 StackPtr, OffsetVal);
20074 // Load the scalar.
20075 SDValue LoadScalar = DAG.getLoad(Extract->getValueType(0), dl, Ch,
20076 ScalarAddr, MachinePointerInfo(),
20077 false, false, false, 0);
20079 // Replace the exact with the load.
20080 DAG.ReplaceAllUsesOfValueWith(SDValue(Extract, 0), LoadScalar);
20083 // The replacement was made in place; don't return anything.
20087 /// \brief Matches a VSELECT onto min/max or return 0 if the node doesn't match.
20088 static std::pair<unsigned, bool>
20089 matchIntegerMINMAX(SDValue Cond, EVT VT, SDValue LHS, SDValue RHS,
20090 SelectionDAG &DAG, const X86Subtarget *Subtarget) {
20091 if (!VT.isVector())
20092 return std::make_pair(0, false);
20094 bool NeedSplit = false;
20095 switch (VT.getSimpleVT().SimpleTy) {
20096 default: return std::make_pair(0, false);
20100 if (!Subtarget->hasAVX2())
20102 if (!Subtarget->hasAVX())
20103 return std::make_pair(0, false);
20108 if (!Subtarget->hasSSE2())
20109 return std::make_pair(0, false);
20112 // SSE2 has only a small subset of the operations.
20113 bool hasUnsigned = Subtarget->hasSSE41() ||
20114 (Subtarget->hasSSE2() && VT == MVT::v16i8);
20115 bool hasSigned = Subtarget->hasSSE41() ||
20116 (Subtarget->hasSSE2() && VT == MVT::v8i16);
20118 ISD::CondCode CC = cast<CondCodeSDNode>(Cond.getOperand(2))->get();
20121 // Check for x CC y ? x : y.
20122 if (DAG.isEqualTo(LHS, Cond.getOperand(0)) &&
20123 DAG.isEqualTo(RHS, Cond.getOperand(1))) {
20128 Opc = hasUnsigned ? X86ISD::UMIN : 0; break;
20131 Opc = hasUnsigned ? X86ISD::UMAX : 0; break;
20134 Opc = hasSigned ? X86ISD::SMIN : 0; break;
20137 Opc = hasSigned ? X86ISD::SMAX : 0; break;
20139 // Check for x CC y ? y : x -- a min/max with reversed arms.
20140 } else if (DAG.isEqualTo(LHS, Cond.getOperand(1)) &&
20141 DAG.isEqualTo(RHS, Cond.getOperand(0))) {
20146 Opc = hasUnsigned ? X86ISD::UMAX : 0; break;
20149 Opc = hasUnsigned ? X86ISD::UMIN : 0; break;
20152 Opc = hasSigned ? X86ISD::SMAX : 0; break;
20155 Opc = hasSigned ? X86ISD::SMIN : 0; break;
20159 return std::make_pair(Opc, NeedSplit);
20163 TransformVSELECTtoBlendVECTOR_SHUFFLE(SDNode *N, SelectionDAG &DAG,
20164 const X86Subtarget *Subtarget) {
20166 SDValue Cond = N->getOperand(0);
20167 SDValue LHS = N->getOperand(1);
20168 SDValue RHS = N->getOperand(2);
20170 if (Cond.getOpcode() == ISD::SIGN_EXTEND) {
20171 SDValue CondSrc = Cond->getOperand(0);
20172 if (CondSrc->getOpcode() == ISD::SIGN_EXTEND_INREG)
20173 Cond = CondSrc->getOperand(0);
20176 MVT VT = N->getSimpleValueType(0);
20177 MVT EltVT = VT.getVectorElementType();
20178 unsigned NumElems = VT.getVectorNumElements();
20179 // There is no blend with immediate in AVX-512.
20180 if (VT.is512BitVector())
20183 if (!Subtarget->hasSSE41() || EltVT == MVT::i8)
20185 if (!Subtarget->hasInt256() && VT == MVT::v16i16)
20188 if (!ISD::isBuildVectorOfConstantSDNodes(Cond.getNode()))
20191 // A vselect where all conditions and data are constants can be optimized into
20192 // a single vector load by SelectionDAGLegalize::ExpandBUILD_VECTOR().
20193 if (ISD::isBuildVectorOfConstantSDNodes(LHS.getNode()) &&
20194 ISD::isBuildVectorOfConstantSDNodes(RHS.getNode()))
20197 unsigned MaskValue = 0;
20198 if (!BUILD_VECTORtoBlendMask(cast<BuildVectorSDNode>(Cond), MaskValue))
20201 SmallVector<int, 8> ShuffleMask(NumElems, -1);
20202 for (unsigned i = 0; i < NumElems; ++i) {
20203 // Be sure we emit undef where we can.
20204 if (Cond.getOperand(i)->getOpcode() == ISD::UNDEF)
20205 ShuffleMask[i] = -1;
20207 ShuffleMask[i] = i + NumElems * ((MaskValue >> i) & 1);
20210 return DAG.getVectorShuffle(VT, dl, LHS, RHS, &ShuffleMask[0]);
20213 /// PerformSELECTCombine - Do target-specific dag combines on SELECT and VSELECT
20215 static SDValue PerformSELECTCombine(SDNode *N, SelectionDAG &DAG,
20216 TargetLowering::DAGCombinerInfo &DCI,
20217 const X86Subtarget *Subtarget) {
20219 SDValue Cond = N->getOperand(0);
20220 // Get the LHS/RHS of the select.
20221 SDValue LHS = N->getOperand(1);
20222 SDValue RHS = N->getOperand(2);
20223 EVT VT = LHS.getValueType();
20224 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
20226 // If we have SSE[12] support, try to form min/max nodes. SSE min/max
20227 // instructions match the semantics of the common C idiom x<y?x:y but not
20228 // x<=y?x:y, because of how they handle negative zero (which can be
20229 // ignored in unsafe-math mode).
20230 if (Cond.getOpcode() == ISD::SETCC && VT.isFloatingPoint() &&
20231 VT != MVT::f80 && TLI.isTypeLegal(VT) &&
20232 (Subtarget->hasSSE2() ||
20233 (Subtarget->hasSSE1() && VT.getScalarType() == MVT::f32))) {
20234 ISD::CondCode CC = cast<CondCodeSDNode>(Cond.getOperand(2))->get();
20236 unsigned Opcode = 0;
20237 // Check for x CC y ? x : y.
20238 if (DAG.isEqualTo(LHS, Cond.getOperand(0)) &&
20239 DAG.isEqualTo(RHS, Cond.getOperand(1))) {
20243 // Converting this to a min would handle NaNs incorrectly, and swapping
20244 // the operands would cause it to handle comparisons between positive
20245 // and negative zero incorrectly.
20246 if (!DAG.isKnownNeverNaN(LHS) || !DAG.isKnownNeverNaN(RHS)) {
20247 if (!DAG.getTarget().Options.UnsafeFPMath &&
20248 !(DAG.isKnownNeverZero(LHS) || DAG.isKnownNeverZero(RHS)))
20250 std::swap(LHS, RHS);
20252 Opcode = X86ISD::FMIN;
20255 // Converting this to a min would handle comparisons between positive
20256 // and negative zero incorrectly.
20257 if (!DAG.getTarget().Options.UnsafeFPMath &&
20258 !DAG.isKnownNeverZero(LHS) && !DAG.isKnownNeverZero(RHS))
20260 Opcode = X86ISD::FMIN;
20263 // Converting this to a min would handle both negative zeros and NaNs
20264 // incorrectly, but we can swap the operands to fix both.
20265 std::swap(LHS, RHS);
20269 Opcode = X86ISD::FMIN;
20273 // Converting this to a max would handle comparisons between positive
20274 // and negative zero incorrectly.
20275 if (!DAG.getTarget().Options.UnsafeFPMath &&
20276 !DAG.isKnownNeverZero(LHS) && !DAG.isKnownNeverZero(RHS))
20278 Opcode = X86ISD::FMAX;
20281 // Converting this to a max would handle NaNs incorrectly, and swapping
20282 // the operands would cause it to handle comparisons between positive
20283 // and negative zero incorrectly.
20284 if (!DAG.isKnownNeverNaN(LHS) || !DAG.isKnownNeverNaN(RHS)) {
20285 if (!DAG.getTarget().Options.UnsafeFPMath &&
20286 !(DAG.isKnownNeverZero(LHS) || DAG.isKnownNeverZero(RHS)))
20288 std::swap(LHS, RHS);
20290 Opcode = X86ISD::FMAX;
20293 // Converting this to a max would handle both negative zeros and NaNs
20294 // incorrectly, but we can swap the operands to fix both.
20295 std::swap(LHS, RHS);
20299 Opcode = X86ISD::FMAX;
20302 // Check for x CC y ? y : x -- a min/max with reversed arms.
20303 } else if (DAG.isEqualTo(LHS, Cond.getOperand(1)) &&
20304 DAG.isEqualTo(RHS, Cond.getOperand(0))) {
20308 // Converting this to a min would handle comparisons between positive
20309 // and negative zero incorrectly, and swapping the operands would
20310 // cause it to handle NaNs incorrectly.
20311 if (!DAG.getTarget().Options.UnsafeFPMath &&
20312 !(DAG.isKnownNeverZero(LHS) || DAG.isKnownNeverZero(RHS))) {
20313 if (!DAG.isKnownNeverNaN(LHS) || !DAG.isKnownNeverNaN(RHS))
20315 std::swap(LHS, RHS);
20317 Opcode = X86ISD::FMIN;
20320 // Converting this to a min would handle NaNs incorrectly.
20321 if (!DAG.getTarget().Options.UnsafeFPMath &&
20322 (!DAG.isKnownNeverNaN(LHS) || !DAG.isKnownNeverNaN(RHS)))
20324 Opcode = X86ISD::FMIN;
20327 // Converting this to a min would handle both negative zeros and NaNs
20328 // incorrectly, but we can swap the operands to fix both.
20329 std::swap(LHS, RHS);
20333 Opcode = X86ISD::FMIN;
20337 // Converting this to a max would handle NaNs incorrectly.
20338 if (!DAG.isKnownNeverNaN(LHS) || !DAG.isKnownNeverNaN(RHS))
20340 Opcode = X86ISD::FMAX;
20343 // Converting this to a max would handle comparisons between positive
20344 // and negative zero incorrectly, and swapping the operands would
20345 // cause it to handle NaNs incorrectly.
20346 if (!DAG.getTarget().Options.UnsafeFPMath &&
20347 !DAG.isKnownNeverZero(LHS) && !DAG.isKnownNeverZero(RHS)) {
20348 if (!DAG.isKnownNeverNaN(LHS) || !DAG.isKnownNeverNaN(RHS))
20350 std::swap(LHS, RHS);
20352 Opcode = X86ISD::FMAX;
20355 // Converting this to a max would handle both negative zeros and NaNs
20356 // incorrectly, but we can swap the operands to fix both.
20357 std::swap(LHS, RHS);
20361 Opcode = X86ISD::FMAX;
20367 return DAG.getNode(Opcode, DL, N->getValueType(0), LHS, RHS);
20370 EVT CondVT = Cond.getValueType();
20371 if (Subtarget->hasAVX512() && VT.isVector() && CondVT.isVector() &&
20372 CondVT.getVectorElementType() == MVT::i1) {
20373 // v16i8 (select v16i1, v16i8, v16i8) does not have a proper
20374 // lowering on KNL. In this case we convert it to
20375 // v16i8 (select v16i8, v16i8, v16i8) and use AVX instruction.
20376 // The same situation for all 128 and 256-bit vectors of i8 and i16.
20377 // Since SKX these selects have a proper lowering.
20378 EVT OpVT = LHS.getValueType();
20379 if ((OpVT.is128BitVector() || OpVT.is256BitVector()) &&
20380 (OpVT.getVectorElementType() == MVT::i8 ||
20381 OpVT.getVectorElementType() == MVT::i16) &&
20382 !(Subtarget->hasBWI() && Subtarget->hasVLX())) {
20383 Cond = DAG.getNode(ISD::SIGN_EXTEND, DL, OpVT, Cond);
20384 DCI.AddToWorklist(Cond.getNode());
20385 return DAG.getNode(N->getOpcode(), DL, OpVT, Cond, LHS, RHS);
20388 // If this is a select between two integer constants, try to do some
20390 if (ConstantSDNode *TrueC = dyn_cast<ConstantSDNode>(LHS)) {
20391 if (ConstantSDNode *FalseC = dyn_cast<ConstantSDNode>(RHS))
20392 // Don't do this for crazy integer types.
20393 if (DAG.getTargetLoweringInfo().isTypeLegal(LHS.getValueType())) {
20394 // If this is efficiently invertible, canonicalize the LHSC/RHSC values
20395 // so that TrueC (the true value) is larger than FalseC.
20396 bool NeedsCondInvert = false;
20398 if (TrueC->getAPIntValue().ult(FalseC->getAPIntValue()) &&
20399 // Efficiently invertible.
20400 (Cond.getOpcode() == ISD::SETCC || // setcc -> invertible.
20401 (Cond.getOpcode() == ISD::XOR && // xor(X, C) -> invertible.
20402 isa<ConstantSDNode>(Cond.getOperand(1))))) {
20403 NeedsCondInvert = true;
20404 std::swap(TrueC, FalseC);
20407 // Optimize C ? 8 : 0 -> zext(C) << 3. Likewise for any pow2/0.
20408 if (FalseC->getAPIntValue() == 0 &&
20409 TrueC->getAPIntValue().isPowerOf2()) {
20410 if (NeedsCondInvert) // Invert the condition if needed.
20411 Cond = DAG.getNode(ISD::XOR, DL, Cond.getValueType(), Cond,
20412 DAG.getConstant(1, Cond.getValueType()));
20414 // Zero extend the condition if needed.
20415 Cond = DAG.getNode(ISD::ZERO_EXTEND, DL, LHS.getValueType(), Cond);
20417 unsigned ShAmt = TrueC->getAPIntValue().logBase2();
20418 return DAG.getNode(ISD::SHL, DL, LHS.getValueType(), Cond,
20419 DAG.getConstant(ShAmt, MVT::i8));
20422 // Optimize Cond ? cst+1 : cst -> zext(setcc(C)+cst.
20423 if (FalseC->getAPIntValue()+1 == TrueC->getAPIntValue()) {
20424 if (NeedsCondInvert) // Invert the condition if needed.
20425 Cond = DAG.getNode(ISD::XOR, DL, Cond.getValueType(), Cond,
20426 DAG.getConstant(1, Cond.getValueType()));
20428 // Zero extend the condition if needed.
20429 Cond = DAG.getNode(ISD::ZERO_EXTEND, DL,
20430 FalseC->getValueType(0), Cond);
20431 return DAG.getNode(ISD::ADD, DL, Cond.getValueType(), Cond,
20432 SDValue(FalseC, 0));
20435 // Optimize cases that will turn into an LEA instruction. This requires
20436 // an i32 or i64 and an efficient multiplier (1, 2, 3, 4, 5, 8, 9).
20437 if (N->getValueType(0) == MVT::i32 || N->getValueType(0) == MVT::i64) {
20438 uint64_t Diff = TrueC->getZExtValue()-FalseC->getZExtValue();
20439 if (N->getValueType(0) == MVT::i32) Diff = (unsigned)Diff;
20441 bool isFastMultiplier = false;
20443 switch ((unsigned char)Diff) {
20445 case 1: // result = add base, cond
20446 case 2: // result = lea base( , cond*2)
20447 case 3: // result = lea base(cond, cond*2)
20448 case 4: // result = lea base( , cond*4)
20449 case 5: // result = lea base(cond, cond*4)
20450 case 8: // result = lea base( , cond*8)
20451 case 9: // result = lea base(cond, cond*8)
20452 isFastMultiplier = true;
20457 if (isFastMultiplier) {
20458 APInt Diff = TrueC->getAPIntValue()-FalseC->getAPIntValue();
20459 if (NeedsCondInvert) // Invert the condition if needed.
20460 Cond = DAG.getNode(ISD::XOR, DL, Cond.getValueType(), Cond,
20461 DAG.getConstant(1, Cond.getValueType()));
20463 // Zero extend the condition if needed.
20464 Cond = DAG.getNode(ISD::ZERO_EXTEND, DL, FalseC->getValueType(0),
20466 // Scale the condition by the difference.
20468 Cond = DAG.getNode(ISD::MUL, DL, Cond.getValueType(), Cond,
20469 DAG.getConstant(Diff, Cond.getValueType()));
20471 // Add the base if non-zero.
20472 if (FalseC->getAPIntValue() != 0)
20473 Cond = DAG.getNode(ISD::ADD, DL, Cond.getValueType(), Cond,
20474 SDValue(FalseC, 0));
20481 // Canonicalize max and min:
20482 // (x > y) ? x : y -> (x >= y) ? x : y
20483 // (x < y) ? x : y -> (x <= y) ? x : y
20484 // This allows use of COND_S / COND_NS (see TranslateX86CC) which eliminates
20485 // the need for an extra compare
20486 // against zero. e.g.
20487 // (x - y) > 0 : (x - y) ? 0 -> (x - y) >= 0 : (x - y) ? 0
20489 // testl %edi, %edi
20491 // cmovgl %edi, %eax
20495 // cmovsl %eax, %edi
20496 if (N->getOpcode() == ISD::SELECT && Cond.getOpcode() == ISD::SETCC &&
20497 DAG.isEqualTo(LHS, Cond.getOperand(0)) &&
20498 DAG.isEqualTo(RHS, Cond.getOperand(1))) {
20499 ISD::CondCode CC = cast<CondCodeSDNode>(Cond.getOperand(2))->get();
20504 ISD::CondCode NewCC = (CC == ISD::SETLT) ? ISD::SETLE : ISD::SETGE;
20505 Cond = DAG.getSetCC(SDLoc(Cond), Cond.getValueType(),
20506 Cond.getOperand(0), Cond.getOperand(1), NewCC);
20507 return DAG.getNode(ISD::SELECT, DL, VT, Cond, LHS, RHS);
20512 // Early exit check
20513 if (!TLI.isTypeLegal(VT))
20516 // Match VSELECTs into subs with unsigned saturation.
20517 if (N->getOpcode() == ISD::VSELECT && Cond.getOpcode() == ISD::SETCC &&
20518 // psubus is available in SSE2 and AVX2 for i8 and i16 vectors.
20519 ((Subtarget->hasSSE2() && (VT == MVT::v16i8 || VT == MVT::v8i16)) ||
20520 (Subtarget->hasAVX2() && (VT == MVT::v32i8 || VT == MVT::v16i16)))) {
20521 ISD::CondCode CC = cast<CondCodeSDNode>(Cond.getOperand(2))->get();
20523 // Check if one of the arms of the VSELECT is a zero vector. If it's on the
20524 // left side invert the predicate to simplify logic below.
20526 if (ISD::isBuildVectorAllZeros(LHS.getNode())) {
20528 CC = ISD::getSetCCInverse(CC, true);
20529 } else if (ISD::isBuildVectorAllZeros(RHS.getNode())) {
20533 if (Other.getNode() && Other->getNumOperands() == 2 &&
20534 DAG.isEqualTo(Other->getOperand(0), Cond.getOperand(0))) {
20535 SDValue OpLHS = Other->getOperand(0), OpRHS = Other->getOperand(1);
20536 SDValue CondRHS = Cond->getOperand(1);
20538 // Look for a general sub with unsigned saturation first.
20539 // x >= y ? x-y : 0 --> subus x, y
20540 // x > y ? x-y : 0 --> subus x, y
20541 if ((CC == ISD::SETUGE || CC == ISD::SETUGT) &&
20542 Other->getOpcode() == ISD::SUB && DAG.isEqualTo(OpRHS, CondRHS))
20543 return DAG.getNode(X86ISD::SUBUS, DL, VT, OpLHS, OpRHS);
20545 if (auto *OpRHSBV = dyn_cast<BuildVectorSDNode>(OpRHS))
20546 if (auto *OpRHSConst = OpRHSBV->getConstantSplatNode()) {
20547 if (auto *CondRHSBV = dyn_cast<BuildVectorSDNode>(CondRHS))
20548 if (auto *CondRHSConst = CondRHSBV->getConstantSplatNode())
20549 // If the RHS is a constant we have to reverse the const
20550 // canonicalization.
20551 // x > C-1 ? x+-C : 0 --> subus x, C
20552 if (CC == ISD::SETUGT && Other->getOpcode() == ISD::ADD &&
20553 CondRHSConst->getAPIntValue() ==
20554 (-OpRHSConst->getAPIntValue() - 1))
20555 return DAG.getNode(
20556 X86ISD::SUBUS, DL, VT, OpLHS,
20557 DAG.getConstant(-OpRHSConst->getAPIntValue(), VT));
20559 // Another special case: If C was a sign bit, the sub has been
20560 // canonicalized into a xor.
20561 // FIXME: Would it be better to use computeKnownBits to determine
20562 // whether it's safe to decanonicalize the xor?
20563 // x s< 0 ? x^C : 0 --> subus x, C
20564 if (CC == ISD::SETLT && Other->getOpcode() == ISD::XOR &&
20565 ISD::isBuildVectorAllZeros(CondRHS.getNode()) &&
20566 OpRHSConst->getAPIntValue().isSignBit())
20567 // Note that we have to rebuild the RHS constant here to ensure we
20568 // don't rely on particular values of undef lanes.
20569 return DAG.getNode(
20570 X86ISD::SUBUS, DL, VT, OpLHS,
20571 DAG.getConstant(OpRHSConst->getAPIntValue(), VT));
20576 // Try to match a min/max vector operation.
20577 if (N->getOpcode() == ISD::VSELECT && Cond.getOpcode() == ISD::SETCC) {
20578 std::pair<unsigned, bool> ret = matchIntegerMINMAX(Cond, VT, LHS, RHS, DAG, Subtarget);
20579 unsigned Opc = ret.first;
20580 bool NeedSplit = ret.second;
20582 if (Opc && NeedSplit) {
20583 unsigned NumElems = VT.getVectorNumElements();
20584 // Extract the LHS vectors
20585 SDValue LHS1 = Extract128BitVector(LHS, 0, DAG, DL);
20586 SDValue LHS2 = Extract128BitVector(LHS, NumElems/2, DAG, DL);
20588 // Extract the RHS vectors
20589 SDValue RHS1 = Extract128BitVector(RHS, 0, DAG, DL);
20590 SDValue RHS2 = Extract128BitVector(RHS, NumElems/2, DAG, DL);
20592 // Create min/max for each subvector
20593 LHS = DAG.getNode(Opc, DL, LHS1.getValueType(), LHS1, RHS1);
20594 RHS = DAG.getNode(Opc, DL, LHS2.getValueType(), LHS2, RHS2);
20596 // Merge the result
20597 return DAG.getNode(ISD::CONCAT_VECTORS, DL, VT, LHS, RHS);
20599 return DAG.getNode(Opc, DL, VT, LHS, RHS);
20602 // Simplify vector selection if the selector will be produced by CMPP*/PCMP*.
20603 if (N->getOpcode() == ISD::VSELECT && Cond.getOpcode() == ISD::SETCC &&
20604 // Check if SETCC has already been promoted
20605 TLI.getSetCCResultType(*DAG.getContext(), VT) == CondVT &&
20606 // Check that condition value type matches vselect operand type
20609 assert(Cond.getValueType().isVector() &&
20610 "vector select expects a vector selector!");
20612 bool TValIsAllOnes = ISD::isBuildVectorAllOnes(LHS.getNode());
20613 bool FValIsAllZeros = ISD::isBuildVectorAllZeros(RHS.getNode());
20615 if (!TValIsAllOnes && !FValIsAllZeros) {
20616 // Try invert the condition if true value is not all 1s and false value
20618 bool TValIsAllZeros = ISD::isBuildVectorAllZeros(LHS.getNode());
20619 bool FValIsAllOnes = ISD::isBuildVectorAllOnes(RHS.getNode());
20621 if (TValIsAllZeros || FValIsAllOnes) {
20622 SDValue CC = Cond.getOperand(2);
20623 ISD::CondCode NewCC =
20624 ISD::getSetCCInverse(cast<CondCodeSDNode>(CC)->get(),
20625 Cond.getOperand(0).getValueType().isInteger());
20626 Cond = DAG.getSetCC(DL, CondVT, Cond.getOperand(0), Cond.getOperand(1), NewCC);
20627 std::swap(LHS, RHS);
20628 TValIsAllOnes = FValIsAllOnes;
20629 FValIsAllZeros = TValIsAllZeros;
20633 if (TValIsAllOnes || FValIsAllZeros) {
20636 if (TValIsAllOnes && FValIsAllZeros)
20638 else if (TValIsAllOnes)
20639 Ret = DAG.getNode(ISD::OR, DL, CondVT, Cond,
20640 DAG.getNode(ISD::BITCAST, DL, CondVT, RHS));
20641 else if (FValIsAllZeros)
20642 Ret = DAG.getNode(ISD::AND, DL, CondVT, Cond,
20643 DAG.getNode(ISD::BITCAST, DL, CondVT, LHS));
20645 return DAG.getNode(ISD::BITCAST, DL, VT, Ret);
20649 // Try to fold this VSELECT into a MOVSS/MOVSD
20650 if (N->getOpcode() == ISD::VSELECT &&
20651 Cond.getOpcode() == ISD::BUILD_VECTOR && !DCI.isBeforeLegalize()) {
20652 if (VT == MVT::v4i32 || VT == MVT::v4f32 ||
20653 (Subtarget->hasSSE2() && (VT == MVT::v2i64 || VT == MVT::v2f64))) {
20654 bool CanFold = false;
20655 unsigned NumElems = Cond.getNumOperands();
20659 if (isZero(Cond.getOperand(0))) {
20662 // fold (vselect <0,-1,-1,-1>, A, B) -> (movss A, B)
20663 // fold (vselect <0,-1> -> (movsd A, B)
20664 for (unsigned i = 1, e = NumElems; i != e && CanFold; ++i)
20665 CanFold = isAllOnes(Cond.getOperand(i));
20666 } else if (isAllOnes(Cond.getOperand(0))) {
20670 // fold (vselect <-1,0,0,0>, A, B) -> (movss B, A)
20671 // fold (vselect <-1,0> -> (movsd B, A)
20672 for (unsigned i = 1, e = NumElems; i != e && CanFold; ++i)
20673 CanFold = isZero(Cond.getOperand(i));
20677 if (VT == MVT::v4i32 || VT == MVT::v4f32)
20678 return getTargetShuffleNode(X86ISD::MOVSS, DL, VT, A, B, DAG);
20679 return getTargetShuffleNode(X86ISD::MOVSD, DL, VT, A, B, DAG);
20682 if (Subtarget->hasSSE2() && (VT == MVT::v4i32 || VT == MVT::v4f32)) {
20683 // fold (v4i32: vselect <0,0,-1,-1>, A, B) ->
20684 // (v4i32 (bitcast (movsd (v2i64 (bitcast A)),
20685 // (v2i64 (bitcast B)))))
20687 // fold (v4f32: vselect <0,0,-1,-1>, A, B) ->
20688 // (v4f32 (bitcast (movsd (v2f64 (bitcast A)),
20689 // (v2f64 (bitcast B)))))
20691 // fold (v4i32: vselect <-1,-1,0,0>, A, B) ->
20692 // (v4i32 (bitcast (movsd (v2i64 (bitcast B)),
20693 // (v2i64 (bitcast A)))))
20695 // fold (v4f32: vselect <-1,-1,0,0>, A, B) ->
20696 // (v4f32 (bitcast (movsd (v2f64 (bitcast B)),
20697 // (v2f64 (bitcast A)))))
20699 CanFold = (isZero(Cond.getOperand(0)) &&
20700 isZero(Cond.getOperand(1)) &&
20701 isAllOnes(Cond.getOperand(2)) &&
20702 isAllOnes(Cond.getOperand(3)));
20704 if (!CanFold && isAllOnes(Cond.getOperand(0)) &&
20705 isAllOnes(Cond.getOperand(1)) &&
20706 isZero(Cond.getOperand(2)) &&
20707 isZero(Cond.getOperand(3))) {
20709 std::swap(LHS, RHS);
20713 EVT NVT = (VT == MVT::v4i32) ? MVT::v2i64 : MVT::v2f64;
20714 SDValue NewA = DAG.getNode(ISD::BITCAST, DL, NVT, LHS);
20715 SDValue NewB = DAG.getNode(ISD::BITCAST, DL, NVT, RHS);
20716 SDValue Select = getTargetShuffleNode(X86ISD::MOVSD, DL, NVT, NewA,
20718 return DAG.getNode(ISD::BITCAST, DL, VT, Select);
20724 // If we know that this node is legal then we know that it is going to be
20725 // matched by one of the SSE/AVX BLEND instructions. These instructions only
20726 // depend on the highest bit in each word. Try to use SimplifyDemandedBits
20727 // to simplify previous instructions.
20728 if (N->getOpcode() == ISD::VSELECT && DCI.isBeforeLegalizeOps() &&
20729 !DCI.isBeforeLegalize() &&
20730 // We explicitly check against v8i16 and v16i16 because, although
20731 // they're marked as Custom, they might only be legal when Cond is a
20732 // build_vector of constants. This will be taken care in a later
20734 (TLI.isOperationLegalOrCustom(ISD::VSELECT, VT) && VT != MVT::v16i16 &&
20735 VT != MVT::v8i16)) {
20736 unsigned BitWidth = Cond.getValueType().getScalarType().getSizeInBits();
20738 // Don't optimize vector selects that map to mask-registers.
20742 // Check all uses of that condition operand to check whether it will be
20743 // consumed by non-BLEND instructions, which may depend on all bits are set
20745 for (SDNode::use_iterator I = Cond->use_begin(),
20746 E = Cond->use_end(); I != E; ++I)
20747 if (I->getOpcode() != ISD::VSELECT)
20748 // TODO: Add other opcodes eventually lowered into BLEND.
20751 assert(BitWidth >= 8 && BitWidth <= 64 && "Invalid mask size");
20752 APInt DemandedMask = APInt::getHighBitsSet(BitWidth, 1);
20754 APInt KnownZero, KnownOne;
20755 TargetLowering::TargetLoweringOpt TLO(DAG, DCI.isBeforeLegalize(),
20756 DCI.isBeforeLegalizeOps());
20757 if (TLO.ShrinkDemandedConstant(Cond, DemandedMask) ||
20758 TLI.SimplifyDemandedBits(Cond, DemandedMask, KnownZero, KnownOne, TLO))
20759 DCI.CommitTargetLoweringOpt(TLO);
20762 // We should generate an X86ISD::BLENDI from a vselect if its argument
20763 // is a sign_extend_inreg of an any_extend of a BUILD_VECTOR of
20764 // constants. This specific pattern gets generated when we split a
20765 // selector for a 512 bit vector in a machine without AVX512 (but with
20766 // 256-bit vectors), during legalization:
20768 // (vselect (sign_extend (any_extend (BUILD_VECTOR)) i1) LHS RHS)
20770 // Iff we find this pattern and the build_vectors are built from
20771 // constants, we translate the vselect into a shuffle_vector that we
20772 // know will be matched by LowerVECTOR_SHUFFLEtoBlend.
20773 if (N->getOpcode() == ISD::VSELECT && !DCI.isBeforeLegalize()) {
20774 SDValue Shuffle = TransformVSELECTtoBlendVECTOR_SHUFFLE(N, DAG, Subtarget);
20775 if (Shuffle.getNode())
20782 // Check whether a boolean test is testing a boolean value generated by
20783 // X86ISD::SETCC. If so, return the operand of that SETCC and proper condition
20786 // Simplify the following patterns:
20787 // (Op (CMP (SETCC Cond EFLAGS) 1) EQ) or
20788 // (Op (CMP (SETCC Cond EFLAGS) 0) NEQ)
20789 // to (Op EFLAGS Cond)
20791 // (Op (CMP (SETCC Cond EFLAGS) 0) EQ) or
20792 // (Op (CMP (SETCC Cond EFLAGS) 1) NEQ)
20793 // to (Op EFLAGS !Cond)
20795 // where Op could be BRCOND or CMOV.
20797 static SDValue checkBoolTestSetCCCombine(SDValue Cmp, X86::CondCode &CC) {
20798 // Quit if not CMP and SUB with its value result used.
20799 if (Cmp.getOpcode() != X86ISD::CMP &&
20800 (Cmp.getOpcode() != X86ISD::SUB || Cmp.getNode()->hasAnyUseOfValue(0)))
20803 // Quit if not used as a boolean value.
20804 if (CC != X86::COND_E && CC != X86::COND_NE)
20807 // Check CMP operands. One of them should be 0 or 1 and the other should be
20808 // an SetCC or extended from it.
20809 SDValue Op1 = Cmp.getOperand(0);
20810 SDValue Op2 = Cmp.getOperand(1);
20813 const ConstantSDNode* C = nullptr;
20814 bool needOppositeCond = (CC == X86::COND_E);
20815 bool checkAgainstTrue = false; // Is it a comparison against 1?
20817 if ((C = dyn_cast<ConstantSDNode>(Op1)))
20819 else if ((C = dyn_cast<ConstantSDNode>(Op2)))
20821 else // Quit if all operands are not constants.
20824 if (C->getZExtValue() == 1) {
20825 needOppositeCond = !needOppositeCond;
20826 checkAgainstTrue = true;
20827 } else if (C->getZExtValue() != 0)
20828 // Quit if the constant is neither 0 or 1.
20831 bool truncatedToBoolWithAnd = false;
20832 // Skip (zext $x), (trunc $x), or (and $x, 1) node.
20833 while (SetCC.getOpcode() == ISD::ZERO_EXTEND ||
20834 SetCC.getOpcode() == ISD::TRUNCATE ||
20835 SetCC.getOpcode() == ISD::AND) {
20836 if (SetCC.getOpcode() == ISD::AND) {
20838 ConstantSDNode *CS;
20839 if ((CS = dyn_cast<ConstantSDNode>(SetCC.getOperand(0))) &&
20840 CS->getZExtValue() == 1)
20842 if ((CS = dyn_cast<ConstantSDNode>(SetCC.getOperand(1))) &&
20843 CS->getZExtValue() == 1)
20847 SetCC = SetCC.getOperand(OpIdx);
20848 truncatedToBoolWithAnd = true;
20850 SetCC = SetCC.getOperand(0);
20853 switch (SetCC.getOpcode()) {
20854 case X86ISD::SETCC_CARRY:
20855 // Since SETCC_CARRY gives output based on R = CF ? ~0 : 0, it's unsafe to
20856 // simplify it if the result of SETCC_CARRY is not canonicalized to 0 or 1,
20857 // i.e. it's a comparison against true but the result of SETCC_CARRY is not
20858 // truncated to i1 using 'and'.
20859 if (checkAgainstTrue && !truncatedToBoolWithAnd)
20861 assert(X86::CondCode(SetCC.getConstantOperandVal(0)) == X86::COND_B &&
20862 "Invalid use of SETCC_CARRY!");
20864 case X86ISD::SETCC:
20865 // Set the condition code or opposite one if necessary.
20866 CC = X86::CondCode(SetCC.getConstantOperandVal(0));
20867 if (needOppositeCond)
20868 CC = X86::GetOppositeBranchCondition(CC);
20869 return SetCC.getOperand(1);
20870 case X86ISD::CMOV: {
20871 // Check whether false/true value has canonical one, i.e. 0 or 1.
20872 ConstantSDNode *FVal = dyn_cast<ConstantSDNode>(SetCC.getOperand(0));
20873 ConstantSDNode *TVal = dyn_cast<ConstantSDNode>(SetCC.getOperand(1));
20874 // Quit if true value is not a constant.
20877 // Quit if false value is not a constant.
20879 SDValue Op = SetCC.getOperand(0);
20880 // Skip 'zext' or 'trunc' node.
20881 if (Op.getOpcode() == ISD::ZERO_EXTEND ||
20882 Op.getOpcode() == ISD::TRUNCATE)
20883 Op = Op.getOperand(0);
20884 // A special case for rdrand/rdseed, where 0 is set if false cond is
20886 if ((Op.getOpcode() != X86ISD::RDRAND &&
20887 Op.getOpcode() != X86ISD::RDSEED) || Op.getResNo() != 0)
20890 // Quit if false value is not the constant 0 or 1.
20891 bool FValIsFalse = true;
20892 if (FVal && FVal->getZExtValue() != 0) {
20893 if (FVal->getZExtValue() != 1)
20895 // If FVal is 1, opposite cond is needed.
20896 needOppositeCond = !needOppositeCond;
20897 FValIsFalse = false;
20899 // Quit if TVal is not the constant opposite of FVal.
20900 if (FValIsFalse && TVal->getZExtValue() != 1)
20902 if (!FValIsFalse && TVal->getZExtValue() != 0)
20904 CC = X86::CondCode(SetCC.getConstantOperandVal(2));
20905 if (needOppositeCond)
20906 CC = X86::GetOppositeBranchCondition(CC);
20907 return SetCC.getOperand(3);
20914 /// Optimize X86ISD::CMOV [LHS, RHS, CONDCODE (e.g. X86::COND_NE), CONDVAL]
20915 static SDValue PerformCMOVCombine(SDNode *N, SelectionDAG &DAG,
20916 TargetLowering::DAGCombinerInfo &DCI,
20917 const X86Subtarget *Subtarget) {
20920 // If the flag operand isn't dead, don't touch this CMOV.
20921 if (N->getNumValues() == 2 && !SDValue(N, 1).use_empty())
20924 SDValue FalseOp = N->getOperand(0);
20925 SDValue TrueOp = N->getOperand(1);
20926 X86::CondCode CC = (X86::CondCode)N->getConstantOperandVal(2);
20927 SDValue Cond = N->getOperand(3);
20929 if (CC == X86::COND_E || CC == X86::COND_NE) {
20930 switch (Cond.getOpcode()) {
20934 // If operand of BSR / BSF are proven never zero, then ZF cannot be set.
20935 if (DAG.isKnownNeverZero(Cond.getOperand(0)))
20936 return (CC == X86::COND_E) ? FalseOp : TrueOp;
20942 Flags = checkBoolTestSetCCCombine(Cond, CC);
20943 if (Flags.getNode() &&
20944 // Extra check as FCMOV only supports a subset of X86 cond.
20945 (FalseOp.getValueType() != MVT::f80 || hasFPCMov(CC))) {
20946 SDValue Ops[] = { FalseOp, TrueOp,
20947 DAG.getConstant(CC, MVT::i8), Flags };
20948 return DAG.getNode(X86ISD::CMOV, DL, N->getVTList(), Ops);
20951 // If this is a select between two integer constants, try to do some
20952 // optimizations. Note that the operands are ordered the opposite of SELECT
20954 if (ConstantSDNode *TrueC = dyn_cast<ConstantSDNode>(TrueOp)) {
20955 if (ConstantSDNode *FalseC = dyn_cast<ConstantSDNode>(FalseOp)) {
20956 // Canonicalize the TrueC/FalseC values so that TrueC (the true value) is
20957 // larger than FalseC (the false value).
20958 if (TrueC->getAPIntValue().ult(FalseC->getAPIntValue())) {
20959 CC = X86::GetOppositeBranchCondition(CC);
20960 std::swap(TrueC, FalseC);
20961 std::swap(TrueOp, FalseOp);
20964 // Optimize C ? 8 : 0 -> zext(setcc(C)) << 3. Likewise for any pow2/0.
20965 // This is efficient for any integer data type (including i8/i16) and
20967 if (FalseC->getAPIntValue() == 0 && TrueC->getAPIntValue().isPowerOf2()) {
20968 Cond = DAG.getNode(X86ISD::SETCC, DL, MVT::i8,
20969 DAG.getConstant(CC, MVT::i8), Cond);
20971 // Zero extend the condition if needed.
20972 Cond = DAG.getNode(ISD::ZERO_EXTEND, DL, TrueC->getValueType(0), Cond);
20974 unsigned ShAmt = TrueC->getAPIntValue().logBase2();
20975 Cond = DAG.getNode(ISD::SHL, DL, Cond.getValueType(), Cond,
20976 DAG.getConstant(ShAmt, MVT::i8));
20977 if (N->getNumValues() == 2) // Dead flag value?
20978 return DCI.CombineTo(N, Cond, SDValue());
20982 // Optimize Cond ? cst+1 : cst -> zext(setcc(C)+cst. This is efficient
20983 // for any integer data type, including i8/i16.
20984 if (FalseC->getAPIntValue()+1 == TrueC->getAPIntValue()) {
20985 Cond = DAG.getNode(X86ISD::SETCC, DL, MVT::i8,
20986 DAG.getConstant(CC, MVT::i8), Cond);
20988 // Zero extend the condition if needed.
20989 Cond = DAG.getNode(ISD::ZERO_EXTEND, DL,
20990 FalseC->getValueType(0), Cond);
20991 Cond = DAG.getNode(ISD::ADD, DL, Cond.getValueType(), Cond,
20992 SDValue(FalseC, 0));
20994 if (N->getNumValues() == 2) // Dead flag value?
20995 return DCI.CombineTo(N, Cond, SDValue());
20999 // Optimize cases that will turn into an LEA instruction. This requires
21000 // an i32 or i64 and an efficient multiplier (1, 2, 3, 4, 5, 8, 9).
21001 if (N->getValueType(0) == MVT::i32 || N->getValueType(0) == MVT::i64) {
21002 uint64_t Diff = TrueC->getZExtValue()-FalseC->getZExtValue();
21003 if (N->getValueType(0) == MVT::i32) Diff = (unsigned)Diff;
21005 bool isFastMultiplier = false;
21007 switch ((unsigned char)Diff) {
21009 case 1: // result = add base, cond
21010 case 2: // result = lea base( , cond*2)
21011 case 3: // result = lea base(cond, cond*2)
21012 case 4: // result = lea base( , cond*4)
21013 case 5: // result = lea base(cond, cond*4)
21014 case 8: // result = lea base( , cond*8)
21015 case 9: // result = lea base(cond, cond*8)
21016 isFastMultiplier = true;
21021 if (isFastMultiplier) {
21022 APInt Diff = TrueC->getAPIntValue()-FalseC->getAPIntValue();
21023 Cond = DAG.getNode(X86ISD::SETCC, DL, MVT::i8,
21024 DAG.getConstant(CC, MVT::i8), Cond);
21025 // Zero extend the condition if needed.
21026 Cond = DAG.getNode(ISD::ZERO_EXTEND, DL, FalseC->getValueType(0),
21028 // Scale the condition by the difference.
21030 Cond = DAG.getNode(ISD::MUL, DL, Cond.getValueType(), Cond,
21031 DAG.getConstant(Diff, Cond.getValueType()));
21033 // Add the base if non-zero.
21034 if (FalseC->getAPIntValue() != 0)
21035 Cond = DAG.getNode(ISD::ADD, DL, Cond.getValueType(), Cond,
21036 SDValue(FalseC, 0));
21037 if (N->getNumValues() == 2) // Dead flag value?
21038 return DCI.CombineTo(N, Cond, SDValue());
21045 // Handle these cases:
21046 // (select (x != c), e, c) -> select (x != c), e, x),
21047 // (select (x == c), c, e) -> select (x == c), x, e)
21048 // where the c is an integer constant, and the "select" is the combination
21049 // of CMOV and CMP.
21051 // The rationale for this change is that the conditional-move from a constant
21052 // needs two instructions, however, conditional-move from a register needs
21053 // only one instruction.
21055 // CAVEAT: By replacing a constant with a symbolic value, it may obscure
21056 // some instruction-combining opportunities. This opt needs to be
21057 // postponed as late as possible.
21059 if (!DCI.isBeforeLegalize() && !DCI.isBeforeLegalizeOps()) {
21060 // the DCI.xxxx conditions are provided to postpone the optimization as
21061 // late as possible.
21063 ConstantSDNode *CmpAgainst = nullptr;
21064 if ((Cond.getOpcode() == X86ISD::CMP || Cond.getOpcode() == X86ISD::SUB) &&
21065 (CmpAgainst = dyn_cast<ConstantSDNode>(Cond.getOperand(1))) &&
21066 !isa<ConstantSDNode>(Cond.getOperand(0))) {
21068 if (CC == X86::COND_NE &&
21069 CmpAgainst == dyn_cast<ConstantSDNode>(FalseOp)) {
21070 CC = X86::GetOppositeBranchCondition(CC);
21071 std::swap(TrueOp, FalseOp);
21074 if (CC == X86::COND_E &&
21075 CmpAgainst == dyn_cast<ConstantSDNode>(TrueOp)) {
21076 SDValue Ops[] = { FalseOp, Cond.getOperand(0),
21077 DAG.getConstant(CC, MVT::i8), Cond };
21078 return DAG.getNode(X86ISD::CMOV, DL, N->getVTList (), Ops);
21086 static SDValue PerformINTRINSIC_WO_CHAINCombine(SDNode *N, SelectionDAG &DAG,
21087 const X86Subtarget *Subtarget) {
21088 unsigned IntNo = cast<ConstantSDNode>(N->getOperand(0))->getZExtValue();
21090 default: return SDValue();
21091 // SSE/AVX/AVX2 blend intrinsics.
21092 case Intrinsic::x86_avx2_pblendvb:
21093 case Intrinsic::x86_avx2_pblendw:
21094 case Intrinsic::x86_avx2_pblendd_128:
21095 case Intrinsic::x86_avx2_pblendd_256:
21096 // Don't try to simplify this intrinsic if we don't have AVX2.
21097 if (!Subtarget->hasAVX2())
21100 case Intrinsic::x86_avx_blend_pd_256:
21101 case Intrinsic::x86_avx_blend_ps_256:
21102 case Intrinsic::x86_avx_blendv_pd_256:
21103 case Intrinsic::x86_avx_blendv_ps_256:
21104 // Don't try to simplify this intrinsic if we don't have AVX.
21105 if (!Subtarget->hasAVX())
21108 case Intrinsic::x86_sse41_pblendw:
21109 case Intrinsic::x86_sse41_blendpd:
21110 case Intrinsic::x86_sse41_blendps:
21111 case Intrinsic::x86_sse41_blendvps:
21112 case Intrinsic::x86_sse41_blendvpd:
21113 case Intrinsic::x86_sse41_pblendvb: {
21114 SDValue Op0 = N->getOperand(1);
21115 SDValue Op1 = N->getOperand(2);
21116 SDValue Mask = N->getOperand(3);
21118 // Don't try to simplify this intrinsic if we don't have SSE4.1.
21119 if (!Subtarget->hasSSE41())
21122 // fold (blend A, A, Mask) -> A
21125 // fold (blend A, B, allZeros) -> A
21126 if (ISD::isBuildVectorAllZeros(Mask.getNode()))
21128 // fold (blend A, B, allOnes) -> B
21129 if (ISD::isBuildVectorAllOnes(Mask.getNode()))
21132 // Simplify the case where the mask is a constant i32 value.
21133 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Mask)) {
21134 if (C->isNullValue())
21136 if (C->isAllOnesValue())
21143 // Packed SSE2/AVX2 arithmetic shift immediate intrinsics.
21144 case Intrinsic::x86_sse2_psrai_w:
21145 case Intrinsic::x86_sse2_psrai_d:
21146 case Intrinsic::x86_avx2_psrai_w:
21147 case Intrinsic::x86_avx2_psrai_d:
21148 case Intrinsic::x86_sse2_psra_w:
21149 case Intrinsic::x86_sse2_psra_d:
21150 case Intrinsic::x86_avx2_psra_w:
21151 case Intrinsic::x86_avx2_psra_d: {
21152 SDValue Op0 = N->getOperand(1);
21153 SDValue Op1 = N->getOperand(2);
21154 EVT VT = Op0.getValueType();
21155 assert(VT.isVector() && "Expected a vector type!");
21157 if (isa<BuildVectorSDNode>(Op1))
21158 Op1 = Op1.getOperand(0);
21160 if (!isa<ConstantSDNode>(Op1))
21163 EVT SVT = VT.getVectorElementType();
21164 unsigned SVTBits = SVT.getSizeInBits();
21166 ConstantSDNode *CND = cast<ConstantSDNode>(Op1);
21167 const APInt &C = APInt(SVTBits, CND->getAPIntValue().getZExtValue());
21168 uint64_t ShAmt = C.getZExtValue();
21170 // Don't try to convert this shift into a ISD::SRA if the shift
21171 // count is bigger than or equal to the element size.
21172 if (ShAmt >= SVTBits)
21175 // Trivial case: if the shift count is zero, then fold this
21176 // into the first operand.
21180 // Replace this packed shift intrinsic with a target independent
21182 SDValue Splat = DAG.getConstant(C, VT);
21183 return DAG.getNode(ISD::SRA, SDLoc(N), VT, Op0, Splat);
21188 /// PerformMulCombine - Optimize a single multiply with constant into two
21189 /// in order to implement it with two cheaper instructions, e.g.
21190 /// LEA + SHL, LEA + LEA.
21191 static SDValue PerformMulCombine(SDNode *N, SelectionDAG &DAG,
21192 TargetLowering::DAGCombinerInfo &DCI) {
21193 if (DCI.isBeforeLegalize() || DCI.isCalledByLegalizer())
21196 EVT VT = N->getValueType(0);
21197 if (VT != MVT::i64)
21200 ConstantSDNode *C = dyn_cast<ConstantSDNode>(N->getOperand(1));
21203 uint64_t MulAmt = C->getZExtValue();
21204 if (isPowerOf2_64(MulAmt) || MulAmt == 3 || MulAmt == 5 || MulAmt == 9)
21207 uint64_t MulAmt1 = 0;
21208 uint64_t MulAmt2 = 0;
21209 if ((MulAmt % 9) == 0) {
21211 MulAmt2 = MulAmt / 9;
21212 } else if ((MulAmt % 5) == 0) {
21214 MulAmt2 = MulAmt / 5;
21215 } else if ((MulAmt % 3) == 0) {
21217 MulAmt2 = MulAmt / 3;
21220 (isPowerOf2_64(MulAmt2) || MulAmt2 == 3 || MulAmt2 == 5 || MulAmt2 == 9)){
21223 if (isPowerOf2_64(MulAmt2) &&
21224 !(N->hasOneUse() && N->use_begin()->getOpcode() == ISD::ADD))
21225 // If second multiplifer is pow2, issue it first. We want the multiply by
21226 // 3, 5, or 9 to be folded into the addressing mode unless the lone use
21228 std::swap(MulAmt1, MulAmt2);
21231 if (isPowerOf2_64(MulAmt1))
21232 NewMul = DAG.getNode(ISD::SHL, DL, VT, N->getOperand(0),
21233 DAG.getConstant(Log2_64(MulAmt1), MVT::i8));
21235 NewMul = DAG.getNode(X86ISD::MUL_IMM, DL, VT, N->getOperand(0),
21236 DAG.getConstant(MulAmt1, VT));
21238 if (isPowerOf2_64(MulAmt2))
21239 NewMul = DAG.getNode(ISD::SHL, DL, VT, NewMul,
21240 DAG.getConstant(Log2_64(MulAmt2), MVT::i8));
21242 NewMul = DAG.getNode(X86ISD::MUL_IMM, DL, VT, NewMul,
21243 DAG.getConstant(MulAmt2, VT));
21245 // Do not add new nodes to DAG combiner worklist.
21246 DCI.CombineTo(N, NewMul, false);
21251 static SDValue PerformSHLCombine(SDNode *N, SelectionDAG &DAG) {
21252 SDValue N0 = N->getOperand(0);
21253 SDValue N1 = N->getOperand(1);
21254 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1);
21255 EVT VT = N0.getValueType();
21257 // fold (shl (and (setcc_c), c1), c2) -> (and setcc_c, (c1 << c2))
21258 // since the result of setcc_c is all zero's or all ones.
21259 if (VT.isInteger() && !VT.isVector() &&
21260 N1C && N0.getOpcode() == ISD::AND &&
21261 N0.getOperand(1).getOpcode() == ISD::Constant) {
21262 SDValue N00 = N0.getOperand(0);
21263 if (N00.getOpcode() == X86ISD::SETCC_CARRY ||
21264 ((N00.getOpcode() == ISD::ANY_EXTEND ||
21265 N00.getOpcode() == ISD::ZERO_EXTEND) &&
21266 N00.getOperand(0).getOpcode() == X86ISD::SETCC_CARRY)) {
21267 APInt Mask = cast<ConstantSDNode>(N0.getOperand(1))->getAPIntValue();
21268 APInt ShAmt = N1C->getAPIntValue();
21269 Mask = Mask.shl(ShAmt);
21271 return DAG.getNode(ISD::AND, SDLoc(N), VT,
21272 N00, DAG.getConstant(Mask, VT));
21276 // Hardware support for vector shifts is sparse which makes us scalarize the
21277 // vector operations in many cases. Also, on sandybridge ADD is faster than
21279 // (shl V, 1) -> add V,V
21280 if (auto *N1BV = dyn_cast<BuildVectorSDNode>(N1))
21281 if (auto *N1SplatC = N1BV->getConstantSplatNode()) {
21282 assert(N0.getValueType().isVector() && "Invalid vector shift type");
21283 // We shift all of the values by one. In many cases we do not have
21284 // hardware support for this operation. This is better expressed as an ADD
21286 if (N1SplatC->getZExtValue() == 1)
21287 return DAG.getNode(ISD::ADD, SDLoc(N), VT, N0, N0);
21293 /// \brief Returns a vector of 0s if the node in input is a vector logical
21294 /// shift by a constant amount which is known to be bigger than or equal
21295 /// to the vector element size in bits.
21296 static SDValue performShiftToAllZeros(SDNode *N, SelectionDAG &DAG,
21297 const X86Subtarget *Subtarget) {
21298 EVT VT = N->getValueType(0);
21300 if (VT != MVT::v2i64 && VT != MVT::v4i32 && VT != MVT::v8i16 &&
21301 (!Subtarget->hasInt256() ||
21302 (VT != MVT::v4i64 && VT != MVT::v8i32 && VT != MVT::v16i16)))
21305 SDValue Amt = N->getOperand(1);
21307 if (auto *AmtBV = dyn_cast<BuildVectorSDNode>(Amt))
21308 if (auto *AmtSplat = AmtBV->getConstantSplatNode()) {
21309 APInt ShiftAmt = AmtSplat->getAPIntValue();
21310 unsigned MaxAmount = VT.getVectorElementType().getSizeInBits();
21312 // SSE2/AVX2 logical shifts always return a vector of 0s
21313 // if the shift amount is bigger than or equal to
21314 // the element size. The constant shift amount will be
21315 // encoded as a 8-bit immediate.
21316 if (ShiftAmt.trunc(8).uge(MaxAmount))
21317 return getZeroVector(VT, Subtarget, DAG, DL);
21323 /// PerformShiftCombine - Combine shifts.
21324 static SDValue PerformShiftCombine(SDNode* N, SelectionDAG &DAG,
21325 TargetLowering::DAGCombinerInfo &DCI,
21326 const X86Subtarget *Subtarget) {
21327 if (N->getOpcode() == ISD::SHL) {
21328 SDValue V = PerformSHLCombine(N, DAG);
21329 if (V.getNode()) return V;
21332 if (N->getOpcode() != ISD::SRA) {
21333 // Try to fold this logical shift into a zero vector.
21334 SDValue V = performShiftToAllZeros(N, DAG, Subtarget);
21335 if (V.getNode()) return V;
21341 // CMPEQCombine - Recognize the distinctive (AND (setcc ...) (setcc ..))
21342 // where both setccs reference the same FP CMP, and rewrite for CMPEQSS
21343 // and friends. Likewise for OR -> CMPNEQSS.
21344 static SDValue CMPEQCombine(SDNode *N, SelectionDAG &DAG,
21345 TargetLowering::DAGCombinerInfo &DCI,
21346 const X86Subtarget *Subtarget) {
21349 // SSE1 supports CMP{eq|ne}SS, and SSE2 added CMP{eq|ne}SD, but
21350 // we're requiring SSE2 for both.
21351 if (Subtarget->hasSSE2() && isAndOrOfSetCCs(SDValue(N, 0U), opcode)) {
21352 SDValue N0 = N->getOperand(0);
21353 SDValue N1 = N->getOperand(1);
21354 SDValue CMP0 = N0->getOperand(1);
21355 SDValue CMP1 = N1->getOperand(1);
21358 // The SETCCs should both refer to the same CMP.
21359 if (CMP0.getOpcode() != X86ISD::CMP || CMP0 != CMP1)
21362 SDValue CMP00 = CMP0->getOperand(0);
21363 SDValue CMP01 = CMP0->getOperand(1);
21364 EVT VT = CMP00.getValueType();
21366 if (VT == MVT::f32 || VT == MVT::f64) {
21367 bool ExpectingFlags = false;
21368 // Check for any users that want flags:
21369 for (SDNode::use_iterator UI = N->use_begin(), UE = N->use_end();
21370 !ExpectingFlags && UI != UE; ++UI)
21371 switch (UI->getOpcode()) {
21376 ExpectingFlags = true;
21378 case ISD::CopyToReg:
21379 case ISD::SIGN_EXTEND:
21380 case ISD::ZERO_EXTEND:
21381 case ISD::ANY_EXTEND:
21385 if (!ExpectingFlags) {
21386 enum X86::CondCode cc0 = (enum X86::CondCode)N0.getConstantOperandVal(0);
21387 enum X86::CondCode cc1 = (enum X86::CondCode)N1.getConstantOperandVal(0);
21389 if (cc1 == X86::COND_E || cc1 == X86::COND_NE) {
21390 X86::CondCode tmp = cc0;
21395 if ((cc0 == X86::COND_E && cc1 == X86::COND_NP) ||
21396 (cc0 == X86::COND_NE && cc1 == X86::COND_P)) {
21397 // FIXME: need symbolic constants for these magic numbers.
21398 // See X86ATTInstPrinter.cpp:printSSECC().
21399 unsigned x86cc = (cc0 == X86::COND_E) ? 0 : 4;
21400 if (Subtarget->hasAVX512()) {
21401 SDValue FSetCC = DAG.getNode(X86ISD::FSETCC, DL, MVT::i1, CMP00,
21402 CMP01, DAG.getConstant(x86cc, MVT::i8));
21403 if (N->getValueType(0) != MVT::i1)
21404 return DAG.getNode(ISD::ZERO_EXTEND, DL, N->getValueType(0),
21408 SDValue OnesOrZeroesF = DAG.getNode(X86ISD::FSETCC, DL,
21409 CMP00.getValueType(), CMP00, CMP01,
21410 DAG.getConstant(x86cc, MVT::i8));
21412 bool is64BitFP = (CMP00.getValueType() == MVT::f64);
21413 MVT IntVT = is64BitFP ? MVT::i64 : MVT::i32;
21415 if (is64BitFP && !Subtarget->is64Bit()) {
21416 // On a 32-bit target, we cannot bitcast the 64-bit float to a
21417 // 64-bit integer, since that's not a legal type. Since
21418 // OnesOrZeroesF is all ones of all zeroes, we don't need all the
21419 // bits, but can do this little dance to extract the lowest 32 bits
21420 // and work with those going forward.
21421 SDValue Vector64 = DAG.getNode(ISD::SCALAR_TO_VECTOR, DL, MVT::v2f64,
21423 SDValue Vector32 = DAG.getNode(ISD::BITCAST, DL, MVT::v4f32,
21425 OnesOrZeroesF = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, DL, MVT::f32,
21426 Vector32, DAG.getIntPtrConstant(0));
21430 SDValue OnesOrZeroesI = DAG.getNode(ISD::BITCAST, DL, IntVT, OnesOrZeroesF);
21431 SDValue ANDed = DAG.getNode(ISD::AND, DL, IntVT, OnesOrZeroesI,
21432 DAG.getConstant(1, IntVT));
21433 SDValue OneBitOfTruth = DAG.getNode(ISD::TRUNCATE, DL, MVT::i8, ANDed);
21434 return OneBitOfTruth;
21442 /// CanFoldXORWithAllOnes - Test whether the XOR operand is a AllOnes vector
21443 /// so it can be folded inside ANDNP.
21444 static bool CanFoldXORWithAllOnes(const SDNode *N) {
21445 EVT VT = N->getValueType(0);
21447 // Match direct AllOnes for 128 and 256-bit vectors
21448 if (ISD::isBuildVectorAllOnes(N))
21451 // Look through a bit convert.
21452 if (N->getOpcode() == ISD::BITCAST)
21453 N = N->getOperand(0).getNode();
21455 // Sometimes the operand may come from a insert_subvector building a 256-bit
21457 if (VT.is256BitVector() &&
21458 N->getOpcode() == ISD::INSERT_SUBVECTOR) {
21459 SDValue V1 = N->getOperand(0);
21460 SDValue V2 = N->getOperand(1);
21462 if (V1.getOpcode() == ISD::INSERT_SUBVECTOR &&
21463 V1.getOperand(0).getOpcode() == ISD::UNDEF &&
21464 ISD::isBuildVectorAllOnes(V1.getOperand(1).getNode()) &&
21465 ISD::isBuildVectorAllOnes(V2.getNode()))
21472 // On AVX/AVX2 the type v8i1 is legalized to v8i16, which is an XMM sized
21473 // register. In most cases we actually compare or select YMM-sized registers
21474 // and mixing the two types creates horrible code. This method optimizes
21475 // some of the transition sequences.
21476 static SDValue WidenMaskArithmetic(SDNode *N, SelectionDAG &DAG,
21477 TargetLowering::DAGCombinerInfo &DCI,
21478 const X86Subtarget *Subtarget) {
21479 EVT VT = N->getValueType(0);
21480 if (!VT.is256BitVector())
21483 assert((N->getOpcode() == ISD::ANY_EXTEND ||
21484 N->getOpcode() == ISD::ZERO_EXTEND ||
21485 N->getOpcode() == ISD::SIGN_EXTEND) && "Invalid Node");
21487 SDValue Narrow = N->getOperand(0);
21488 EVT NarrowVT = Narrow->getValueType(0);
21489 if (!NarrowVT.is128BitVector())
21492 if (Narrow->getOpcode() != ISD::XOR &&
21493 Narrow->getOpcode() != ISD::AND &&
21494 Narrow->getOpcode() != ISD::OR)
21497 SDValue N0 = Narrow->getOperand(0);
21498 SDValue N1 = Narrow->getOperand(1);
21501 // The Left side has to be a trunc.
21502 if (N0.getOpcode() != ISD::TRUNCATE)
21505 // The type of the truncated inputs.
21506 EVT WideVT = N0->getOperand(0)->getValueType(0);
21510 // The right side has to be a 'trunc' or a constant vector.
21511 bool RHSTrunc = N1.getOpcode() == ISD::TRUNCATE;
21512 ConstantSDNode *RHSConstSplat = nullptr;
21513 if (auto *RHSBV = dyn_cast<BuildVectorSDNode>(N1))
21514 RHSConstSplat = RHSBV->getConstantSplatNode();
21515 if (!RHSTrunc && !RHSConstSplat)
21518 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
21520 if (!TLI.isOperationLegalOrPromote(Narrow->getOpcode(), WideVT))
21523 // Set N0 and N1 to hold the inputs to the new wide operation.
21524 N0 = N0->getOperand(0);
21525 if (RHSConstSplat) {
21526 N1 = DAG.getNode(ISD::ZERO_EXTEND, DL, WideVT.getScalarType(),
21527 SDValue(RHSConstSplat, 0));
21528 SmallVector<SDValue, 8> C(WideVT.getVectorNumElements(), N1);
21529 N1 = DAG.getNode(ISD::BUILD_VECTOR, DL, WideVT, C);
21530 } else if (RHSTrunc) {
21531 N1 = N1->getOperand(0);
21534 // Generate the wide operation.
21535 SDValue Op = DAG.getNode(Narrow->getOpcode(), DL, WideVT, N0, N1);
21536 unsigned Opcode = N->getOpcode();
21538 case ISD::ANY_EXTEND:
21540 case ISD::ZERO_EXTEND: {
21541 unsigned InBits = NarrowVT.getScalarType().getSizeInBits();
21542 APInt Mask = APInt::getAllOnesValue(InBits);
21543 Mask = Mask.zext(VT.getScalarType().getSizeInBits());
21544 return DAG.getNode(ISD::AND, DL, VT,
21545 Op, DAG.getConstant(Mask, VT));
21547 case ISD::SIGN_EXTEND:
21548 return DAG.getNode(ISD::SIGN_EXTEND_INREG, DL, VT,
21549 Op, DAG.getValueType(NarrowVT));
21551 llvm_unreachable("Unexpected opcode");
21555 static SDValue PerformAndCombine(SDNode *N, SelectionDAG &DAG,
21556 TargetLowering::DAGCombinerInfo &DCI,
21557 const X86Subtarget *Subtarget) {
21558 EVT VT = N->getValueType(0);
21559 if (DCI.isBeforeLegalizeOps())
21562 SDValue R = CMPEQCombine(N, DAG, DCI, Subtarget);
21566 // Create BEXTR instructions
21567 // BEXTR is ((X >> imm) & (2**size-1))
21568 if (VT == MVT::i32 || VT == MVT::i64) {
21569 SDValue N0 = N->getOperand(0);
21570 SDValue N1 = N->getOperand(1);
21573 // Check for BEXTR.
21574 if ((Subtarget->hasBMI() || Subtarget->hasTBM()) &&
21575 (N0.getOpcode() == ISD::SRA || N0.getOpcode() == ISD::SRL)) {
21576 ConstantSDNode *MaskNode = dyn_cast<ConstantSDNode>(N1);
21577 ConstantSDNode *ShiftNode = dyn_cast<ConstantSDNode>(N0.getOperand(1));
21578 if (MaskNode && ShiftNode) {
21579 uint64_t Mask = MaskNode->getZExtValue();
21580 uint64_t Shift = ShiftNode->getZExtValue();
21581 if (isMask_64(Mask)) {
21582 uint64_t MaskSize = CountPopulation_64(Mask);
21583 if (Shift + MaskSize <= VT.getSizeInBits())
21584 return DAG.getNode(X86ISD::BEXTR, DL, VT, N0.getOperand(0),
21585 DAG.getConstant(Shift | (MaskSize << 8), VT));
21593 // Want to form ANDNP nodes:
21594 // 1) In the hopes of then easily combining them with OR and AND nodes
21595 // to form PBLEND/PSIGN.
21596 // 2) To match ANDN packed intrinsics
21597 if (VT != MVT::v2i64 && VT != MVT::v4i64)
21600 SDValue N0 = N->getOperand(0);
21601 SDValue N1 = N->getOperand(1);
21604 // Check LHS for vnot
21605 if (N0.getOpcode() == ISD::XOR &&
21606 //ISD::isBuildVectorAllOnes(N0.getOperand(1).getNode()))
21607 CanFoldXORWithAllOnes(N0.getOperand(1).getNode()))
21608 return DAG.getNode(X86ISD::ANDNP, DL, VT, N0.getOperand(0), N1);
21610 // Check RHS for vnot
21611 if (N1.getOpcode() == ISD::XOR &&
21612 //ISD::isBuildVectorAllOnes(N1.getOperand(1).getNode()))
21613 CanFoldXORWithAllOnes(N1.getOperand(1).getNode()))
21614 return DAG.getNode(X86ISD::ANDNP, DL, VT, N1.getOperand(0), N0);
21619 static SDValue PerformOrCombine(SDNode *N, SelectionDAG &DAG,
21620 TargetLowering::DAGCombinerInfo &DCI,
21621 const X86Subtarget *Subtarget) {
21622 if (DCI.isBeforeLegalizeOps())
21625 SDValue R = CMPEQCombine(N, DAG, DCI, Subtarget);
21629 SDValue N0 = N->getOperand(0);
21630 SDValue N1 = N->getOperand(1);
21631 EVT VT = N->getValueType(0);
21633 // look for psign/blend
21634 if (VT == MVT::v2i64 || VT == MVT::v4i64) {
21635 if (!Subtarget->hasSSSE3() ||
21636 (VT == MVT::v4i64 && !Subtarget->hasInt256()))
21639 // Canonicalize pandn to RHS
21640 if (N0.getOpcode() == X86ISD::ANDNP)
21642 // or (and (m, y), (pandn m, x))
21643 if (N0.getOpcode() == ISD::AND && N1.getOpcode() == X86ISD::ANDNP) {
21644 SDValue Mask = N1.getOperand(0);
21645 SDValue X = N1.getOperand(1);
21647 if (N0.getOperand(0) == Mask)
21648 Y = N0.getOperand(1);
21649 if (N0.getOperand(1) == Mask)
21650 Y = N0.getOperand(0);
21652 // Check to see if the mask appeared in both the AND and ANDNP and
21656 // Validate that X, Y, and Mask are BIT_CONVERTS, and see through them.
21657 // Look through mask bitcast.
21658 if (Mask.getOpcode() == ISD::BITCAST)
21659 Mask = Mask.getOperand(0);
21660 if (X.getOpcode() == ISD::BITCAST)
21661 X = X.getOperand(0);
21662 if (Y.getOpcode() == ISD::BITCAST)
21663 Y = Y.getOperand(0);
21665 EVT MaskVT = Mask.getValueType();
21667 // Validate that the Mask operand is a vector sra node.
21668 // FIXME: what to do for bytes, since there is a psignb/pblendvb, but
21669 // there is no psrai.b
21670 unsigned EltBits = MaskVT.getVectorElementType().getSizeInBits();
21671 unsigned SraAmt = ~0;
21672 if (Mask.getOpcode() == ISD::SRA) {
21673 if (auto *AmtBV = dyn_cast<BuildVectorSDNode>(Mask.getOperand(1)))
21674 if (auto *AmtConst = AmtBV->getConstantSplatNode())
21675 SraAmt = AmtConst->getZExtValue();
21676 } else if (Mask.getOpcode() == X86ISD::VSRAI) {
21677 SDValue SraC = Mask.getOperand(1);
21678 SraAmt = cast<ConstantSDNode>(SraC)->getZExtValue();
21680 if ((SraAmt + 1) != EltBits)
21685 // Now we know we at least have a plendvb with the mask val. See if
21686 // we can form a psignb/w/d.
21687 // psign = x.type == y.type == mask.type && y = sub(0, x);
21688 if (Y.getOpcode() == ISD::SUB && Y.getOperand(1) == X &&
21689 ISD::isBuildVectorAllZeros(Y.getOperand(0).getNode()) &&
21690 X.getValueType() == MaskVT && Y.getValueType() == MaskVT) {
21691 assert((EltBits == 8 || EltBits == 16 || EltBits == 32) &&
21692 "Unsupported VT for PSIGN");
21693 Mask = DAG.getNode(X86ISD::PSIGN, DL, MaskVT, X, Mask.getOperand(0));
21694 return DAG.getNode(ISD::BITCAST, DL, VT, Mask);
21696 // PBLENDVB only available on SSE 4.1
21697 if (!Subtarget->hasSSE41())
21700 EVT BlendVT = (VT == MVT::v4i64) ? MVT::v32i8 : MVT::v16i8;
21702 X = DAG.getNode(ISD::BITCAST, DL, BlendVT, X);
21703 Y = DAG.getNode(ISD::BITCAST, DL, BlendVT, Y);
21704 Mask = DAG.getNode(ISD::BITCAST, DL, BlendVT, Mask);
21705 Mask = DAG.getNode(ISD::VSELECT, DL, BlendVT, Mask, Y, X);
21706 return DAG.getNode(ISD::BITCAST, DL, VT, Mask);
21710 if (VT != MVT::i16 && VT != MVT::i32 && VT != MVT::i64)
21713 // fold (or (x << c) | (y >> (64 - c))) ==> (shld64 x, y, c)
21714 MachineFunction &MF = DAG.getMachineFunction();
21715 bool OptForSize = MF.getFunction()->getAttributes().
21716 hasAttribute(AttributeSet::FunctionIndex, Attribute::OptimizeForSize);
21718 // SHLD/SHRD instructions have lower register pressure, but on some
21719 // platforms they have higher latency than the equivalent
21720 // series of shifts/or that would otherwise be generated.
21721 // Don't fold (or (x << c) | (y >> (64 - c))) if SHLD/SHRD instructions
21722 // have higher latencies and we are not optimizing for size.
21723 if (!OptForSize && Subtarget->isSHLDSlow())
21726 if (N0.getOpcode() == ISD::SRL && N1.getOpcode() == ISD::SHL)
21728 if (N0.getOpcode() != ISD::SHL || N1.getOpcode() != ISD::SRL)
21730 if (!N0.hasOneUse() || !N1.hasOneUse())
21733 SDValue ShAmt0 = N0.getOperand(1);
21734 if (ShAmt0.getValueType() != MVT::i8)
21736 SDValue ShAmt1 = N1.getOperand(1);
21737 if (ShAmt1.getValueType() != MVT::i8)
21739 if (ShAmt0.getOpcode() == ISD::TRUNCATE)
21740 ShAmt0 = ShAmt0.getOperand(0);
21741 if (ShAmt1.getOpcode() == ISD::TRUNCATE)
21742 ShAmt1 = ShAmt1.getOperand(0);
21745 unsigned Opc = X86ISD::SHLD;
21746 SDValue Op0 = N0.getOperand(0);
21747 SDValue Op1 = N1.getOperand(0);
21748 if (ShAmt0.getOpcode() == ISD::SUB) {
21749 Opc = X86ISD::SHRD;
21750 std::swap(Op0, Op1);
21751 std::swap(ShAmt0, ShAmt1);
21754 unsigned Bits = VT.getSizeInBits();
21755 if (ShAmt1.getOpcode() == ISD::SUB) {
21756 SDValue Sum = ShAmt1.getOperand(0);
21757 if (ConstantSDNode *SumC = dyn_cast<ConstantSDNode>(Sum)) {
21758 SDValue ShAmt1Op1 = ShAmt1.getOperand(1);
21759 if (ShAmt1Op1.getNode()->getOpcode() == ISD::TRUNCATE)
21760 ShAmt1Op1 = ShAmt1Op1.getOperand(0);
21761 if (SumC->getSExtValue() == Bits && ShAmt1Op1 == ShAmt0)
21762 return DAG.getNode(Opc, DL, VT,
21764 DAG.getNode(ISD::TRUNCATE, DL,
21767 } else if (ConstantSDNode *ShAmt1C = dyn_cast<ConstantSDNode>(ShAmt1)) {
21768 ConstantSDNode *ShAmt0C = dyn_cast<ConstantSDNode>(ShAmt0);
21770 ShAmt0C->getSExtValue() + ShAmt1C->getSExtValue() == Bits)
21771 return DAG.getNode(Opc, DL, VT,
21772 N0.getOperand(0), N1.getOperand(0),
21773 DAG.getNode(ISD::TRUNCATE, DL,
21780 // Generate NEG and CMOV for integer abs.
21781 static SDValue performIntegerAbsCombine(SDNode *N, SelectionDAG &DAG) {
21782 EVT VT = N->getValueType(0);
21784 // Since X86 does not have CMOV for 8-bit integer, we don't convert
21785 // 8-bit integer abs to NEG and CMOV.
21786 if (VT.isInteger() && VT.getSizeInBits() == 8)
21789 SDValue N0 = N->getOperand(0);
21790 SDValue N1 = N->getOperand(1);
21793 // Check pattern of XOR(ADD(X,Y), Y) where Y is SRA(X, size(X)-1)
21794 // and change it to SUB and CMOV.
21795 if (VT.isInteger() && N->getOpcode() == ISD::XOR &&
21796 N0.getOpcode() == ISD::ADD &&
21797 N0.getOperand(1) == N1 &&
21798 N1.getOpcode() == ISD::SRA &&
21799 N1.getOperand(0) == N0.getOperand(0))
21800 if (ConstantSDNode *Y1C = dyn_cast<ConstantSDNode>(N1.getOperand(1)))
21801 if (Y1C->getAPIntValue() == VT.getSizeInBits()-1) {
21802 // Generate SUB & CMOV.
21803 SDValue Neg = DAG.getNode(X86ISD::SUB, DL, DAG.getVTList(VT, MVT::i32),
21804 DAG.getConstant(0, VT), N0.getOperand(0));
21806 SDValue Ops[] = { N0.getOperand(0), Neg,
21807 DAG.getConstant(X86::COND_GE, MVT::i8),
21808 SDValue(Neg.getNode(), 1) };
21809 return DAG.getNode(X86ISD::CMOV, DL, DAG.getVTList(VT, MVT::Glue), Ops);
21814 // PerformXorCombine - Attempts to turn XOR nodes into BLSMSK nodes
21815 static SDValue PerformXorCombine(SDNode *N, SelectionDAG &DAG,
21816 TargetLowering::DAGCombinerInfo &DCI,
21817 const X86Subtarget *Subtarget) {
21818 if (DCI.isBeforeLegalizeOps())
21821 if (Subtarget->hasCMov()) {
21822 SDValue RV = performIntegerAbsCombine(N, DAG);
21830 /// PerformLOADCombine - Do target-specific dag combines on LOAD nodes.
21831 static SDValue PerformLOADCombine(SDNode *N, SelectionDAG &DAG,
21832 TargetLowering::DAGCombinerInfo &DCI,
21833 const X86Subtarget *Subtarget) {
21834 LoadSDNode *Ld = cast<LoadSDNode>(N);
21835 EVT RegVT = Ld->getValueType(0);
21836 EVT MemVT = Ld->getMemoryVT();
21838 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
21840 // On Sandybridge unaligned 256bit loads are inefficient.
21841 ISD::LoadExtType Ext = Ld->getExtensionType();
21842 unsigned Alignment = Ld->getAlignment();
21843 bool IsAligned = Alignment == 0 || Alignment >= MemVT.getSizeInBits()/8;
21844 if (RegVT.is256BitVector() && !Subtarget->hasInt256() &&
21845 !DCI.isBeforeLegalizeOps() && !IsAligned && Ext == ISD::NON_EXTLOAD) {
21846 unsigned NumElems = RegVT.getVectorNumElements();
21850 SDValue Ptr = Ld->getBasePtr();
21851 SDValue Increment = DAG.getConstant(16, TLI.getPointerTy());
21853 EVT HalfVT = EVT::getVectorVT(*DAG.getContext(), MemVT.getScalarType(),
21855 SDValue Load1 = DAG.getLoad(HalfVT, dl, Ld->getChain(), Ptr,
21856 Ld->getPointerInfo(), Ld->isVolatile(),
21857 Ld->isNonTemporal(), Ld->isInvariant(),
21859 Ptr = DAG.getNode(ISD::ADD, dl, Ptr.getValueType(), Ptr, Increment);
21860 SDValue Load2 = DAG.getLoad(HalfVT, dl, Ld->getChain(), Ptr,
21861 Ld->getPointerInfo(), Ld->isVolatile(),
21862 Ld->isNonTemporal(), Ld->isInvariant(),
21863 std::min(16U, Alignment));
21864 SDValue TF = DAG.getNode(ISD::TokenFactor, dl, MVT::Other,
21866 Load2.getValue(1));
21868 SDValue NewVec = DAG.getUNDEF(RegVT);
21869 NewVec = Insert128BitVector(NewVec, Load1, 0, DAG, dl);
21870 NewVec = Insert128BitVector(NewVec, Load2, NumElems/2, DAG, dl);
21871 return DCI.CombineTo(N, NewVec, TF, true);
21877 /// PerformSTORECombine - Do target-specific dag combines on STORE nodes.
21878 static SDValue PerformSTORECombine(SDNode *N, SelectionDAG &DAG,
21879 const X86Subtarget *Subtarget) {
21880 StoreSDNode *St = cast<StoreSDNode>(N);
21881 EVT VT = St->getValue().getValueType();
21882 EVT StVT = St->getMemoryVT();
21884 SDValue StoredVal = St->getOperand(1);
21885 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
21887 // If we are saving a concatenation of two XMM registers, perform two stores.
21888 // On Sandy Bridge, 256-bit memory operations are executed by two
21889 // 128-bit ports. However, on Haswell it is better to issue a single 256-bit
21890 // memory operation.
21891 unsigned Alignment = St->getAlignment();
21892 bool IsAligned = Alignment == 0 || Alignment >= VT.getSizeInBits()/8;
21893 if (VT.is256BitVector() && !Subtarget->hasInt256() &&
21894 StVT == VT && !IsAligned) {
21895 unsigned NumElems = VT.getVectorNumElements();
21899 SDValue Value0 = Extract128BitVector(StoredVal, 0, DAG, dl);
21900 SDValue Value1 = Extract128BitVector(StoredVal, NumElems/2, DAG, dl);
21902 SDValue Stride = DAG.getConstant(16, TLI.getPointerTy());
21903 SDValue Ptr0 = St->getBasePtr();
21904 SDValue Ptr1 = DAG.getNode(ISD::ADD, dl, Ptr0.getValueType(), Ptr0, Stride);
21906 SDValue Ch0 = DAG.getStore(St->getChain(), dl, Value0, Ptr0,
21907 St->getPointerInfo(), St->isVolatile(),
21908 St->isNonTemporal(), Alignment);
21909 SDValue Ch1 = DAG.getStore(St->getChain(), dl, Value1, Ptr1,
21910 St->getPointerInfo(), St->isVolatile(),
21911 St->isNonTemporal(),
21912 std::min(16U, Alignment));
21913 return DAG.getNode(ISD::TokenFactor, dl, MVT::Other, Ch0, Ch1);
21916 // Optimize trunc store (of multiple scalars) to shuffle and store.
21917 // First, pack all of the elements in one place. Next, store to memory
21918 // in fewer chunks.
21919 if (St->isTruncatingStore() && VT.isVector()) {
21920 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
21921 unsigned NumElems = VT.getVectorNumElements();
21922 assert(StVT != VT && "Cannot truncate to the same type");
21923 unsigned FromSz = VT.getVectorElementType().getSizeInBits();
21924 unsigned ToSz = StVT.getVectorElementType().getSizeInBits();
21926 // From, To sizes and ElemCount must be pow of two
21927 if (!isPowerOf2_32(NumElems * FromSz * ToSz)) return SDValue();
21928 // We are going to use the original vector elt for storing.
21929 // Accumulated smaller vector elements must be a multiple of the store size.
21930 if (0 != (NumElems * FromSz) % ToSz) return SDValue();
21932 unsigned SizeRatio = FromSz / ToSz;
21934 assert(SizeRatio * NumElems * ToSz == VT.getSizeInBits());
21936 // Create a type on which we perform the shuffle
21937 EVT WideVecVT = EVT::getVectorVT(*DAG.getContext(),
21938 StVT.getScalarType(), NumElems*SizeRatio);
21940 assert(WideVecVT.getSizeInBits() == VT.getSizeInBits());
21942 SDValue WideVec = DAG.getNode(ISD::BITCAST, dl, WideVecVT, St->getValue());
21943 SmallVector<int, 8> ShuffleVec(NumElems * SizeRatio, -1);
21944 for (unsigned i = 0; i != NumElems; ++i)
21945 ShuffleVec[i] = i * SizeRatio;
21947 // Can't shuffle using an illegal type.
21948 if (!TLI.isTypeLegal(WideVecVT))
21951 SDValue Shuff = DAG.getVectorShuffle(WideVecVT, dl, WideVec,
21952 DAG.getUNDEF(WideVecVT),
21954 // At this point all of the data is stored at the bottom of the
21955 // register. We now need to save it to mem.
21957 // Find the largest store unit
21958 MVT StoreType = MVT::i8;
21959 for (unsigned tp = MVT::FIRST_INTEGER_VALUETYPE;
21960 tp < MVT::LAST_INTEGER_VALUETYPE; ++tp) {
21961 MVT Tp = (MVT::SimpleValueType)tp;
21962 if (TLI.isTypeLegal(Tp) && Tp.getSizeInBits() <= NumElems * ToSz)
21966 // On 32bit systems, we can't save 64bit integers. Try bitcasting to F64.
21967 if (TLI.isTypeLegal(MVT::f64) && StoreType.getSizeInBits() < 64 &&
21968 (64 <= NumElems * ToSz))
21969 StoreType = MVT::f64;
21971 // Bitcast the original vector into a vector of store-size units
21972 EVT StoreVecVT = EVT::getVectorVT(*DAG.getContext(),
21973 StoreType, VT.getSizeInBits()/StoreType.getSizeInBits());
21974 assert(StoreVecVT.getSizeInBits() == VT.getSizeInBits());
21975 SDValue ShuffWide = DAG.getNode(ISD::BITCAST, dl, StoreVecVT, Shuff);
21976 SmallVector<SDValue, 8> Chains;
21977 SDValue Increment = DAG.getConstant(StoreType.getSizeInBits()/8,
21978 TLI.getPointerTy());
21979 SDValue Ptr = St->getBasePtr();
21981 // Perform one or more big stores into memory.
21982 for (unsigned i=0, e=(ToSz*NumElems)/StoreType.getSizeInBits(); i!=e; ++i) {
21983 SDValue SubVec = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl,
21984 StoreType, ShuffWide,
21985 DAG.getIntPtrConstant(i));
21986 SDValue Ch = DAG.getStore(St->getChain(), dl, SubVec, Ptr,
21987 St->getPointerInfo(), St->isVolatile(),
21988 St->isNonTemporal(), St->getAlignment());
21989 Ptr = DAG.getNode(ISD::ADD, dl, Ptr.getValueType(), Ptr, Increment);
21990 Chains.push_back(Ch);
21993 return DAG.getNode(ISD::TokenFactor, dl, MVT::Other, Chains);
21996 // Turn load->store of MMX types into GPR load/stores. This avoids clobbering
21997 // the FP state in cases where an emms may be missing.
21998 // A preferable solution to the general problem is to figure out the right
21999 // places to insert EMMS. This qualifies as a quick hack.
22001 // Similarly, turn load->store of i64 into double load/stores in 32-bit mode.
22002 if (VT.getSizeInBits() != 64)
22005 const Function *F = DAG.getMachineFunction().getFunction();
22006 bool NoImplicitFloatOps = F->getAttributes().
22007 hasAttribute(AttributeSet::FunctionIndex, Attribute::NoImplicitFloat);
22008 bool F64IsLegal = !DAG.getTarget().Options.UseSoftFloat && !NoImplicitFloatOps
22009 && Subtarget->hasSSE2();
22010 if ((VT.isVector() ||
22011 (VT == MVT::i64 && F64IsLegal && !Subtarget->is64Bit())) &&
22012 isa<LoadSDNode>(St->getValue()) &&
22013 !cast<LoadSDNode>(St->getValue())->isVolatile() &&
22014 St->getChain().hasOneUse() && !St->isVolatile()) {
22015 SDNode* LdVal = St->getValue().getNode();
22016 LoadSDNode *Ld = nullptr;
22017 int TokenFactorIndex = -1;
22018 SmallVector<SDValue, 8> Ops;
22019 SDNode* ChainVal = St->getChain().getNode();
22020 // Must be a store of a load. We currently handle two cases: the load
22021 // is a direct child, and it's under an intervening TokenFactor. It is
22022 // possible to dig deeper under nested TokenFactors.
22023 if (ChainVal == LdVal)
22024 Ld = cast<LoadSDNode>(St->getChain());
22025 else if (St->getValue().hasOneUse() &&
22026 ChainVal->getOpcode() == ISD::TokenFactor) {
22027 for (unsigned i = 0, e = ChainVal->getNumOperands(); i != e; ++i) {
22028 if (ChainVal->getOperand(i).getNode() == LdVal) {
22029 TokenFactorIndex = i;
22030 Ld = cast<LoadSDNode>(St->getValue());
22032 Ops.push_back(ChainVal->getOperand(i));
22036 if (!Ld || !ISD::isNormalLoad(Ld))
22039 // If this is not the MMX case, i.e. we are just turning i64 load/store
22040 // into f64 load/store, avoid the transformation if there are multiple
22041 // uses of the loaded value.
22042 if (!VT.isVector() && !Ld->hasNUsesOfValue(1, 0))
22047 // If we are a 64-bit capable x86, lower to a single movq load/store pair.
22048 // Otherwise, if it's legal to use f64 SSE instructions, use f64 load/store
22050 if (Subtarget->is64Bit() || F64IsLegal) {
22051 EVT LdVT = Subtarget->is64Bit() ? MVT::i64 : MVT::f64;
22052 SDValue NewLd = DAG.getLoad(LdVT, LdDL, Ld->getChain(), Ld->getBasePtr(),
22053 Ld->getPointerInfo(), Ld->isVolatile(),
22054 Ld->isNonTemporal(), Ld->isInvariant(),
22055 Ld->getAlignment());
22056 SDValue NewChain = NewLd.getValue(1);
22057 if (TokenFactorIndex != -1) {
22058 Ops.push_back(NewChain);
22059 NewChain = DAG.getNode(ISD::TokenFactor, LdDL, MVT::Other, Ops);
22061 return DAG.getStore(NewChain, StDL, NewLd, St->getBasePtr(),
22062 St->getPointerInfo(),
22063 St->isVolatile(), St->isNonTemporal(),
22064 St->getAlignment());
22067 // Otherwise, lower to two pairs of 32-bit loads / stores.
22068 SDValue LoAddr = Ld->getBasePtr();
22069 SDValue HiAddr = DAG.getNode(ISD::ADD, LdDL, MVT::i32, LoAddr,
22070 DAG.getConstant(4, MVT::i32));
22072 SDValue LoLd = DAG.getLoad(MVT::i32, LdDL, Ld->getChain(), LoAddr,
22073 Ld->getPointerInfo(),
22074 Ld->isVolatile(), Ld->isNonTemporal(),
22075 Ld->isInvariant(), Ld->getAlignment());
22076 SDValue HiLd = DAG.getLoad(MVT::i32, LdDL, Ld->getChain(), HiAddr,
22077 Ld->getPointerInfo().getWithOffset(4),
22078 Ld->isVolatile(), Ld->isNonTemporal(),
22080 MinAlign(Ld->getAlignment(), 4));
22082 SDValue NewChain = LoLd.getValue(1);
22083 if (TokenFactorIndex != -1) {
22084 Ops.push_back(LoLd);
22085 Ops.push_back(HiLd);
22086 NewChain = DAG.getNode(ISD::TokenFactor, LdDL, MVT::Other, Ops);
22089 LoAddr = St->getBasePtr();
22090 HiAddr = DAG.getNode(ISD::ADD, StDL, MVT::i32, LoAddr,
22091 DAG.getConstant(4, MVT::i32));
22093 SDValue LoSt = DAG.getStore(NewChain, StDL, LoLd, LoAddr,
22094 St->getPointerInfo(),
22095 St->isVolatile(), St->isNonTemporal(),
22096 St->getAlignment());
22097 SDValue HiSt = DAG.getStore(NewChain, StDL, HiLd, HiAddr,
22098 St->getPointerInfo().getWithOffset(4),
22100 St->isNonTemporal(),
22101 MinAlign(St->getAlignment(), 4));
22102 return DAG.getNode(ISD::TokenFactor, StDL, MVT::Other, LoSt, HiSt);
22107 /// isHorizontalBinOp - Return 'true' if this vector operation is "horizontal"
22108 /// and return the operands for the horizontal operation in LHS and RHS. A
22109 /// horizontal operation performs the binary operation on successive elements
22110 /// of its first operand, then on successive elements of its second operand,
22111 /// returning the resulting values in a vector. For example, if
22112 /// A = < float a0, float a1, float a2, float a3 >
22114 /// B = < float b0, float b1, float b2, float b3 >
22115 /// then the result of doing a horizontal operation on A and B is
22116 /// A horizontal-op B = < a0 op a1, a2 op a3, b0 op b1, b2 op b3 >.
22117 /// In short, LHS and RHS are inspected to see if LHS op RHS is of the form
22118 /// A horizontal-op B, for some already available A and B, and if so then LHS is
22119 /// set to A, RHS to B, and the routine returns 'true'.
22120 /// Note that the binary operation should have the property that if one of the
22121 /// operands is UNDEF then the result is UNDEF.
22122 static bool isHorizontalBinOp(SDValue &LHS, SDValue &RHS, bool IsCommutative) {
22123 // Look for the following pattern: if
22124 // A = < float a0, float a1, float a2, float a3 >
22125 // B = < float b0, float b1, float b2, float b3 >
22127 // LHS = VECTOR_SHUFFLE A, B, <0, 2, 4, 6>
22128 // RHS = VECTOR_SHUFFLE A, B, <1, 3, 5, 7>
22129 // then LHS op RHS = < a0 op a1, a2 op a3, b0 op b1, b2 op b3 >
22130 // which is A horizontal-op B.
22132 // At least one of the operands should be a vector shuffle.
22133 if (LHS.getOpcode() != ISD::VECTOR_SHUFFLE &&
22134 RHS.getOpcode() != ISD::VECTOR_SHUFFLE)
22137 MVT VT = LHS.getSimpleValueType();
22139 assert((VT.is128BitVector() || VT.is256BitVector()) &&
22140 "Unsupported vector type for horizontal add/sub");
22142 // Handle 128 and 256-bit vector lengths. AVX defines horizontal add/sub to
22143 // operate independently on 128-bit lanes.
22144 unsigned NumElts = VT.getVectorNumElements();
22145 unsigned NumLanes = VT.getSizeInBits()/128;
22146 unsigned NumLaneElts = NumElts / NumLanes;
22147 assert((NumLaneElts % 2 == 0) &&
22148 "Vector type should have an even number of elements in each lane");
22149 unsigned HalfLaneElts = NumLaneElts/2;
22151 // View LHS in the form
22152 // LHS = VECTOR_SHUFFLE A, B, LMask
22153 // If LHS is not a shuffle then pretend it is the shuffle
22154 // LHS = VECTOR_SHUFFLE LHS, undef, <0, 1, ..., N-1>
22155 // NOTE: in what follows a default initialized SDValue represents an UNDEF of
22158 SmallVector<int, 16> LMask(NumElts);
22159 if (LHS.getOpcode() == ISD::VECTOR_SHUFFLE) {
22160 if (LHS.getOperand(0).getOpcode() != ISD::UNDEF)
22161 A = LHS.getOperand(0);
22162 if (LHS.getOperand(1).getOpcode() != ISD::UNDEF)
22163 B = LHS.getOperand(1);
22164 ArrayRef<int> Mask = cast<ShuffleVectorSDNode>(LHS.getNode())->getMask();
22165 std::copy(Mask.begin(), Mask.end(), LMask.begin());
22167 if (LHS.getOpcode() != ISD::UNDEF)
22169 for (unsigned i = 0; i != NumElts; ++i)
22173 // Likewise, view RHS in the form
22174 // RHS = VECTOR_SHUFFLE C, D, RMask
22176 SmallVector<int, 16> RMask(NumElts);
22177 if (RHS.getOpcode() == ISD::VECTOR_SHUFFLE) {
22178 if (RHS.getOperand(0).getOpcode() != ISD::UNDEF)
22179 C = RHS.getOperand(0);
22180 if (RHS.getOperand(1).getOpcode() != ISD::UNDEF)
22181 D = RHS.getOperand(1);
22182 ArrayRef<int> Mask = cast<ShuffleVectorSDNode>(RHS.getNode())->getMask();
22183 std::copy(Mask.begin(), Mask.end(), RMask.begin());
22185 if (RHS.getOpcode() != ISD::UNDEF)
22187 for (unsigned i = 0; i != NumElts; ++i)
22191 // Check that the shuffles are both shuffling the same vectors.
22192 if (!(A == C && B == D) && !(A == D && B == C))
22195 // If everything is UNDEF then bail out: it would be better to fold to UNDEF.
22196 if (!A.getNode() && !B.getNode())
22199 // If A and B occur in reverse order in RHS, then "swap" them (which means
22200 // rewriting the mask).
22202 CommuteVectorShuffleMask(RMask, NumElts);
22204 // At this point LHS and RHS are equivalent to
22205 // LHS = VECTOR_SHUFFLE A, B, LMask
22206 // RHS = VECTOR_SHUFFLE A, B, RMask
22207 // Check that the masks correspond to performing a horizontal operation.
22208 for (unsigned l = 0; l != NumElts; l += NumLaneElts) {
22209 for (unsigned i = 0; i != NumLaneElts; ++i) {
22210 int LIdx = LMask[i+l], RIdx = RMask[i+l];
22212 // Ignore any UNDEF components.
22213 if (LIdx < 0 || RIdx < 0 ||
22214 (!A.getNode() && (LIdx < (int)NumElts || RIdx < (int)NumElts)) ||
22215 (!B.getNode() && (LIdx >= (int)NumElts || RIdx >= (int)NumElts)))
22218 // Check that successive elements are being operated on. If not, this is
22219 // not a horizontal operation.
22220 unsigned Src = (i/HalfLaneElts); // each lane is split between srcs
22221 int Index = 2*(i%HalfLaneElts) + NumElts*Src + l;
22222 if (!(LIdx == Index && RIdx == Index + 1) &&
22223 !(IsCommutative && LIdx == Index + 1 && RIdx == Index))
22228 LHS = A.getNode() ? A : B; // If A is 'UNDEF', use B for it.
22229 RHS = B.getNode() ? B : A; // If B is 'UNDEF', use A for it.
22233 /// PerformFADDCombine - Do target-specific dag combines on floating point adds.
22234 static SDValue PerformFADDCombine(SDNode *N, SelectionDAG &DAG,
22235 const X86Subtarget *Subtarget) {
22236 EVT VT = N->getValueType(0);
22237 SDValue LHS = N->getOperand(0);
22238 SDValue RHS = N->getOperand(1);
22240 // Try to synthesize horizontal adds from adds of shuffles.
22241 if (((Subtarget->hasSSE3() && (VT == MVT::v4f32 || VT == MVT::v2f64)) ||
22242 (Subtarget->hasFp256() && (VT == MVT::v8f32 || VT == MVT::v4f64))) &&
22243 isHorizontalBinOp(LHS, RHS, true))
22244 return DAG.getNode(X86ISD::FHADD, SDLoc(N), VT, LHS, RHS);
22248 /// PerformFSUBCombine - Do target-specific dag combines on floating point subs.
22249 static SDValue PerformFSUBCombine(SDNode *N, SelectionDAG &DAG,
22250 const X86Subtarget *Subtarget) {
22251 EVT VT = N->getValueType(0);
22252 SDValue LHS = N->getOperand(0);
22253 SDValue RHS = N->getOperand(1);
22255 // Try to synthesize horizontal subs from subs of shuffles.
22256 if (((Subtarget->hasSSE3() && (VT == MVT::v4f32 || VT == MVT::v2f64)) ||
22257 (Subtarget->hasFp256() && (VT == MVT::v8f32 || VT == MVT::v4f64))) &&
22258 isHorizontalBinOp(LHS, RHS, false))
22259 return DAG.getNode(X86ISD::FHSUB, SDLoc(N), VT, LHS, RHS);
22263 /// PerformFORCombine - Do target-specific dag combines on X86ISD::FOR and
22264 /// X86ISD::FXOR nodes.
22265 static SDValue PerformFORCombine(SDNode *N, SelectionDAG &DAG) {
22266 assert(N->getOpcode() == X86ISD::FOR || N->getOpcode() == X86ISD::FXOR);
22267 // F[X]OR(0.0, x) -> x
22268 // F[X]OR(x, 0.0) -> x
22269 if (ConstantFPSDNode *C = dyn_cast<ConstantFPSDNode>(N->getOperand(0)))
22270 if (C->getValueAPF().isPosZero())
22271 return N->getOperand(1);
22272 if (ConstantFPSDNode *C = dyn_cast<ConstantFPSDNode>(N->getOperand(1)))
22273 if (C->getValueAPF().isPosZero())
22274 return N->getOperand(0);
22278 /// PerformFMinFMaxCombine - Do target-specific dag combines on X86ISD::FMIN and
22279 /// X86ISD::FMAX nodes.
22280 static SDValue PerformFMinFMaxCombine(SDNode *N, SelectionDAG &DAG) {
22281 assert(N->getOpcode() == X86ISD::FMIN || N->getOpcode() == X86ISD::FMAX);
22283 // Only perform optimizations if UnsafeMath is used.
22284 if (!DAG.getTarget().Options.UnsafeFPMath)
22287 // If we run in unsafe-math mode, then convert the FMAX and FMIN nodes
22288 // into FMINC and FMAXC, which are Commutative operations.
22289 unsigned NewOp = 0;
22290 switch (N->getOpcode()) {
22291 default: llvm_unreachable("unknown opcode");
22292 case X86ISD::FMIN: NewOp = X86ISD::FMINC; break;
22293 case X86ISD::FMAX: NewOp = X86ISD::FMAXC; break;
22296 return DAG.getNode(NewOp, SDLoc(N), N->getValueType(0),
22297 N->getOperand(0), N->getOperand(1));
22300 /// PerformFANDCombine - Do target-specific dag combines on X86ISD::FAND nodes.
22301 static SDValue PerformFANDCombine(SDNode *N, SelectionDAG &DAG) {
22302 // FAND(0.0, x) -> 0.0
22303 // FAND(x, 0.0) -> 0.0
22304 if (ConstantFPSDNode *C = dyn_cast<ConstantFPSDNode>(N->getOperand(0)))
22305 if (C->getValueAPF().isPosZero())
22306 return N->getOperand(0);
22307 if (ConstantFPSDNode *C = dyn_cast<ConstantFPSDNode>(N->getOperand(1)))
22308 if (C->getValueAPF().isPosZero())
22309 return N->getOperand(1);
22313 /// PerformFANDNCombine - Do target-specific dag combines on X86ISD::FANDN nodes
22314 static SDValue PerformFANDNCombine(SDNode *N, SelectionDAG &DAG) {
22315 // FANDN(x, 0.0) -> 0.0
22316 // FANDN(0.0, x) -> x
22317 if (ConstantFPSDNode *C = dyn_cast<ConstantFPSDNode>(N->getOperand(0)))
22318 if (C->getValueAPF().isPosZero())
22319 return N->getOperand(1);
22320 if (ConstantFPSDNode *C = dyn_cast<ConstantFPSDNode>(N->getOperand(1)))
22321 if (C->getValueAPF().isPosZero())
22322 return N->getOperand(1);
22326 static SDValue PerformBTCombine(SDNode *N,
22328 TargetLowering::DAGCombinerInfo &DCI) {
22329 // BT ignores high bits in the bit index operand.
22330 SDValue Op1 = N->getOperand(1);
22331 if (Op1.hasOneUse()) {
22332 unsigned BitWidth = Op1.getValueSizeInBits();
22333 APInt DemandedMask = APInt::getLowBitsSet(BitWidth, Log2_32(BitWidth));
22334 APInt KnownZero, KnownOne;
22335 TargetLowering::TargetLoweringOpt TLO(DAG, !DCI.isBeforeLegalize(),
22336 !DCI.isBeforeLegalizeOps());
22337 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
22338 if (TLO.ShrinkDemandedConstant(Op1, DemandedMask) ||
22339 TLI.SimplifyDemandedBits(Op1, DemandedMask, KnownZero, KnownOne, TLO))
22340 DCI.CommitTargetLoweringOpt(TLO);
22345 static SDValue PerformVZEXT_MOVLCombine(SDNode *N, SelectionDAG &DAG) {
22346 SDValue Op = N->getOperand(0);
22347 if (Op.getOpcode() == ISD::BITCAST)
22348 Op = Op.getOperand(0);
22349 EVT VT = N->getValueType(0), OpVT = Op.getValueType();
22350 if (Op.getOpcode() == X86ISD::VZEXT_LOAD &&
22351 VT.getVectorElementType().getSizeInBits() ==
22352 OpVT.getVectorElementType().getSizeInBits()) {
22353 return DAG.getNode(ISD::BITCAST, SDLoc(N), VT, Op);
22358 static SDValue PerformSIGN_EXTEND_INREGCombine(SDNode *N, SelectionDAG &DAG,
22359 const X86Subtarget *Subtarget) {
22360 EVT VT = N->getValueType(0);
22361 if (!VT.isVector())
22364 SDValue N0 = N->getOperand(0);
22365 SDValue N1 = N->getOperand(1);
22366 EVT ExtraVT = cast<VTSDNode>(N1)->getVT();
22369 // The SIGN_EXTEND_INREG to v4i64 is expensive operation on the
22370 // both SSE and AVX2 since there is no sign-extended shift right
22371 // operation on a vector with 64-bit elements.
22372 //(sext_in_reg (v4i64 anyext (v4i32 x )), ExtraVT) ->
22373 // (v4i64 sext (v4i32 sext_in_reg (v4i32 x , ExtraVT)))
22374 if (VT == MVT::v4i64 && (N0.getOpcode() == ISD::ANY_EXTEND ||
22375 N0.getOpcode() == ISD::SIGN_EXTEND)) {
22376 SDValue N00 = N0.getOperand(0);
22378 // EXTLOAD has a better solution on AVX2,
22379 // it may be replaced with X86ISD::VSEXT node.
22380 if (N00.getOpcode() == ISD::LOAD && Subtarget->hasInt256())
22381 if (!ISD::isNormalLoad(N00.getNode()))
22384 if (N00.getValueType() == MVT::v4i32 && ExtraVT.getSizeInBits() < 128) {
22385 SDValue Tmp = DAG.getNode(ISD::SIGN_EXTEND_INREG, dl, MVT::v4i32,
22387 return DAG.getNode(ISD::SIGN_EXTEND, dl, MVT::v4i64, Tmp);
22393 static SDValue PerformSExtCombine(SDNode *N, SelectionDAG &DAG,
22394 TargetLowering::DAGCombinerInfo &DCI,
22395 const X86Subtarget *Subtarget) {
22396 if (!DCI.isBeforeLegalizeOps())
22399 if (!Subtarget->hasFp256())
22402 EVT VT = N->getValueType(0);
22403 if (VT.isVector() && VT.getSizeInBits() == 256) {
22404 SDValue R = WidenMaskArithmetic(N, DAG, DCI, Subtarget);
22412 static SDValue PerformFMACombine(SDNode *N, SelectionDAG &DAG,
22413 const X86Subtarget* Subtarget) {
22415 EVT VT = N->getValueType(0);
22417 // Let legalize expand this if it isn't a legal type yet.
22418 if (!DAG.getTargetLoweringInfo().isTypeLegal(VT))
22421 EVT ScalarVT = VT.getScalarType();
22422 if ((ScalarVT != MVT::f32 && ScalarVT != MVT::f64) ||
22423 (!Subtarget->hasFMA() && !Subtarget->hasFMA4()))
22426 SDValue A = N->getOperand(0);
22427 SDValue B = N->getOperand(1);
22428 SDValue C = N->getOperand(2);
22430 bool NegA = (A.getOpcode() == ISD::FNEG);
22431 bool NegB = (B.getOpcode() == ISD::FNEG);
22432 bool NegC = (C.getOpcode() == ISD::FNEG);
22434 // Negative multiplication when NegA xor NegB
22435 bool NegMul = (NegA != NegB);
22437 A = A.getOperand(0);
22439 B = B.getOperand(0);
22441 C = C.getOperand(0);
22445 Opcode = (!NegC) ? X86ISD::FMADD : X86ISD::FMSUB;
22447 Opcode = (!NegC) ? X86ISD::FNMADD : X86ISD::FNMSUB;
22449 return DAG.getNode(Opcode, dl, VT, A, B, C);
22452 static SDValue PerformZExtCombine(SDNode *N, SelectionDAG &DAG,
22453 TargetLowering::DAGCombinerInfo &DCI,
22454 const X86Subtarget *Subtarget) {
22455 // (i32 zext (and (i8 x86isd::setcc_carry), 1)) ->
22456 // (and (i32 x86isd::setcc_carry), 1)
22457 // This eliminates the zext. This transformation is necessary because
22458 // ISD::SETCC is always legalized to i8.
22460 SDValue N0 = N->getOperand(0);
22461 EVT VT = N->getValueType(0);
22463 if (N0.getOpcode() == ISD::AND &&
22465 N0.getOperand(0).hasOneUse()) {
22466 SDValue N00 = N0.getOperand(0);
22467 if (N00.getOpcode() == X86ISD::SETCC_CARRY) {
22468 ConstantSDNode *C = dyn_cast<ConstantSDNode>(N0.getOperand(1));
22469 if (!C || C->getZExtValue() != 1)
22471 return DAG.getNode(ISD::AND, dl, VT,
22472 DAG.getNode(X86ISD::SETCC_CARRY, dl, VT,
22473 N00.getOperand(0), N00.getOperand(1)),
22474 DAG.getConstant(1, VT));
22478 if (N0.getOpcode() == ISD::TRUNCATE &&
22480 N0.getOperand(0).hasOneUse()) {
22481 SDValue N00 = N0.getOperand(0);
22482 if (N00.getOpcode() == X86ISD::SETCC_CARRY) {
22483 return DAG.getNode(ISD::AND, dl, VT,
22484 DAG.getNode(X86ISD::SETCC_CARRY, dl, VT,
22485 N00.getOperand(0), N00.getOperand(1)),
22486 DAG.getConstant(1, VT));
22489 if (VT.is256BitVector()) {
22490 SDValue R = WidenMaskArithmetic(N, DAG, DCI, Subtarget);
22498 // Optimize x == -y --> x+y == 0
22499 // x != -y --> x+y != 0
22500 static SDValue PerformISDSETCCCombine(SDNode *N, SelectionDAG &DAG,
22501 const X86Subtarget* Subtarget) {
22502 ISD::CondCode CC = cast<CondCodeSDNode>(N->getOperand(2))->get();
22503 SDValue LHS = N->getOperand(0);
22504 SDValue RHS = N->getOperand(1);
22505 EVT VT = N->getValueType(0);
22508 if ((CC == ISD::SETNE || CC == ISD::SETEQ) && LHS.getOpcode() == ISD::SUB)
22509 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(LHS.getOperand(0)))
22510 if (C->getAPIntValue() == 0 && LHS.hasOneUse()) {
22511 SDValue addV = DAG.getNode(ISD::ADD, SDLoc(N),
22512 LHS.getValueType(), RHS, LHS.getOperand(1));
22513 return DAG.getSetCC(SDLoc(N), N->getValueType(0),
22514 addV, DAG.getConstant(0, addV.getValueType()), CC);
22516 if ((CC == ISD::SETNE || CC == ISD::SETEQ) && RHS.getOpcode() == ISD::SUB)
22517 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(RHS.getOperand(0)))
22518 if (C->getAPIntValue() == 0 && RHS.hasOneUse()) {
22519 SDValue addV = DAG.getNode(ISD::ADD, SDLoc(N),
22520 RHS.getValueType(), LHS, RHS.getOperand(1));
22521 return DAG.getSetCC(SDLoc(N), N->getValueType(0),
22522 addV, DAG.getConstant(0, addV.getValueType()), CC);
22525 if (VT.getScalarType() == MVT::i1) {
22526 bool IsSEXT0 = (LHS.getOpcode() == ISD::SIGN_EXTEND) &&
22527 (LHS.getOperand(0).getValueType().getScalarType() == MVT::i1);
22528 bool IsVZero0 = ISD::isBuildVectorAllZeros(LHS.getNode());
22529 if (!IsSEXT0 && !IsVZero0)
22531 bool IsSEXT1 = (RHS.getOpcode() == ISD::SIGN_EXTEND) &&
22532 (RHS.getOperand(0).getValueType().getScalarType() == MVT::i1);
22533 bool IsVZero1 = ISD::isBuildVectorAllZeros(RHS.getNode());
22535 if (!IsSEXT1 && !IsVZero1)
22538 if (IsSEXT0 && IsVZero1) {
22539 assert(VT == LHS.getOperand(0).getValueType() && "Uexpected operand type");
22540 if (CC == ISD::SETEQ)
22541 return DAG.getNOT(DL, LHS.getOperand(0), VT);
22542 return LHS.getOperand(0);
22544 if (IsSEXT1 && IsVZero0) {
22545 assert(VT == RHS.getOperand(0).getValueType() && "Uexpected operand type");
22546 if (CC == ISD::SETEQ)
22547 return DAG.getNOT(DL, RHS.getOperand(0), VT);
22548 return RHS.getOperand(0);
22555 static SDValue PerformINSERTPSCombine(SDNode *N, SelectionDAG &DAG,
22556 const X86Subtarget *Subtarget) {
22558 MVT VT = N->getOperand(1)->getSimpleValueType(0);
22559 assert((VT == MVT::v4f32 || VT == MVT::v4i32) &&
22560 "X86insertps is only defined for v4x32");
22562 SDValue Ld = N->getOperand(1);
22563 if (MayFoldLoad(Ld)) {
22564 // Extract the countS bits from the immediate so we can get the proper
22565 // address when narrowing the vector load to a specific element.
22566 // When the second source op is a memory address, interps doesn't use
22567 // countS and just gets an f32 from that address.
22568 unsigned DestIndex =
22569 cast<ConstantSDNode>(N->getOperand(2))->getZExtValue() >> 6;
22570 Ld = NarrowVectorLoadToElement(cast<LoadSDNode>(Ld), DestIndex, DAG);
22574 // Create this as a scalar to vector to match the instruction pattern.
22575 SDValue LoadScalarToVector = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VT, Ld);
22576 // countS bits are ignored when loading from memory on insertps, which
22577 // means we don't need to explicitly set them to 0.
22578 return DAG.getNode(X86ISD::INSERTPS, dl, VT, N->getOperand(0),
22579 LoadScalarToVector, N->getOperand(2));
22582 // Helper function of PerformSETCCCombine. It is to materialize "setb reg"
22583 // as "sbb reg,reg", since it can be extended without zext and produces
22584 // an all-ones bit which is more useful than 0/1 in some cases.
22585 static SDValue MaterializeSETB(SDLoc DL, SDValue EFLAGS, SelectionDAG &DAG,
22588 return DAG.getNode(ISD::AND, DL, VT,
22589 DAG.getNode(X86ISD::SETCC_CARRY, DL, MVT::i8,
22590 DAG.getConstant(X86::COND_B, MVT::i8), EFLAGS),
22591 DAG.getConstant(1, VT));
22592 assert (VT == MVT::i1 && "Unexpected type for SECCC node");
22593 return DAG.getNode(ISD::TRUNCATE, DL, MVT::i1,
22594 DAG.getNode(X86ISD::SETCC_CARRY, DL, MVT::i8,
22595 DAG.getConstant(X86::COND_B, MVT::i8), EFLAGS));
22598 // Optimize RES = X86ISD::SETCC CONDCODE, EFLAG_INPUT
22599 static SDValue PerformSETCCCombine(SDNode *N, SelectionDAG &DAG,
22600 TargetLowering::DAGCombinerInfo &DCI,
22601 const X86Subtarget *Subtarget) {
22603 X86::CondCode CC = X86::CondCode(N->getConstantOperandVal(0));
22604 SDValue EFLAGS = N->getOperand(1);
22606 if (CC == X86::COND_A) {
22607 // Try to convert COND_A into COND_B in an attempt to facilitate
22608 // materializing "setb reg".
22610 // Do not flip "e > c", where "c" is a constant, because Cmp instruction
22611 // cannot take an immediate as its first operand.
22613 if (EFLAGS.getOpcode() == X86ISD::SUB && EFLAGS.hasOneUse() &&
22614 EFLAGS.getValueType().isInteger() &&
22615 !isa<ConstantSDNode>(EFLAGS.getOperand(1))) {
22616 SDValue NewSub = DAG.getNode(X86ISD::SUB, SDLoc(EFLAGS),
22617 EFLAGS.getNode()->getVTList(),
22618 EFLAGS.getOperand(1), EFLAGS.getOperand(0));
22619 SDValue NewEFLAGS = SDValue(NewSub.getNode(), EFLAGS.getResNo());
22620 return MaterializeSETB(DL, NewEFLAGS, DAG, N->getSimpleValueType(0));
22624 // Materialize "setb reg" as "sbb reg,reg", since it can be extended without
22625 // a zext and produces an all-ones bit which is more useful than 0/1 in some
22627 if (CC == X86::COND_B)
22628 return MaterializeSETB(DL, EFLAGS, DAG, N->getSimpleValueType(0));
22632 Flags = checkBoolTestSetCCCombine(EFLAGS, CC);
22633 if (Flags.getNode()) {
22634 SDValue Cond = DAG.getConstant(CC, MVT::i8);
22635 return DAG.getNode(X86ISD::SETCC, DL, N->getVTList(), Cond, Flags);
22641 // Optimize branch condition evaluation.
22643 static SDValue PerformBrCondCombine(SDNode *N, SelectionDAG &DAG,
22644 TargetLowering::DAGCombinerInfo &DCI,
22645 const X86Subtarget *Subtarget) {
22647 SDValue Chain = N->getOperand(0);
22648 SDValue Dest = N->getOperand(1);
22649 SDValue EFLAGS = N->getOperand(3);
22650 X86::CondCode CC = X86::CondCode(N->getConstantOperandVal(2));
22654 Flags = checkBoolTestSetCCCombine(EFLAGS, CC);
22655 if (Flags.getNode()) {
22656 SDValue Cond = DAG.getConstant(CC, MVT::i8);
22657 return DAG.getNode(X86ISD::BRCOND, DL, N->getVTList(), Chain, Dest, Cond,
22664 static SDValue performVectorCompareAndMaskUnaryOpCombine(SDNode *N,
22665 SelectionDAG &DAG) {
22666 // Take advantage of vector comparisons producing 0 or -1 in each lane to
22667 // optimize away operation when it's from a constant.
22669 // The general transformation is:
22670 // UNARYOP(AND(VECTOR_CMP(x,y), constant)) -->
22671 // AND(VECTOR_CMP(x,y), constant2)
22672 // constant2 = UNARYOP(constant)
22674 // Early exit if this isn't a vector operation, the operand of the
22675 // unary operation isn't a bitwise AND, or if the sizes of the operations
22676 // aren't the same.
22677 EVT VT = N->getValueType(0);
22678 if (!VT.isVector() || N->getOperand(0)->getOpcode() != ISD::AND ||
22679 N->getOperand(0)->getOperand(0)->getOpcode() != ISD::SETCC ||
22680 VT.getSizeInBits() != N->getOperand(0)->getValueType(0).getSizeInBits())
22683 // Now check that the other operand of the AND is a constant. We could
22684 // make the transformation for non-constant splats as well, but it's unclear
22685 // that would be a benefit as it would not eliminate any operations, just
22686 // perform one more step in scalar code before moving to the vector unit.
22687 if (BuildVectorSDNode *BV =
22688 dyn_cast<BuildVectorSDNode>(N->getOperand(0)->getOperand(1))) {
22689 // Bail out if the vector isn't a constant.
22690 if (!BV->isConstant())
22693 // Everything checks out. Build up the new and improved node.
22695 EVT IntVT = BV->getValueType(0);
22696 // Create a new constant of the appropriate type for the transformed
22698 SDValue SourceConst = DAG.getNode(N->getOpcode(), DL, VT, SDValue(BV, 0));
22699 // The AND node needs bitcasts to/from an integer vector type around it.
22700 SDValue MaskConst = DAG.getNode(ISD::BITCAST, DL, IntVT, SourceConst);
22701 SDValue NewAnd = DAG.getNode(ISD::AND, DL, IntVT,
22702 N->getOperand(0)->getOperand(0), MaskConst);
22703 SDValue Res = DAG.getNode(ISD::BITCAST, DL, VT, NewAnd);
22710 static SDValue PerformSINT_TO_FPCombine(SDNode *N, SelectionDAG &DAG,
22711 const X86TargetLowering *XTLI) {
22712 // First try to optimize away the conversion entirely when it's
22713 // conditionally from a constant. Vectors only.
22714 SDValue Res = performVectorCompareAndMaskUnaryOpCombine(N, DAG);
22715 if (Res != SDValue())
22718 // Now move on to more general possibilities.
22719 SDValue Op0 = N->getOperand(0);
22720 EVT InVT = Op0->getValueType(0);
22722 // SINT_TO_FP(v4i8) -> SINT_TO_FP(SEXT(v4i8 to v4i32))
22723 if (InVT == MVT::v8i8 || InVT == MVT::v4i8) {
22725 MVT DstVT = InVT == MVT::v4i8 ? MVT::v4i32 : MVT::v8i32;
22726 SDValue P = DAG.getNode(ISD::SIGN_EXTEND, dl, DstVT, Op0);
22727 return DAG.getNode(ISD::SINT_TO_FP, dl, N->getValueType(0), P);
22730 // Transform (SINT_TO_FP (i64 ...)) into an x87 operation if we have
22731 // a 32-bit target where SSE doesn't support i64->FP operations.
22732 if (Op0.getOpcode() == ISD::LOAD) {
22733 LoadSDNode *Ld = cast<LoadSDNode>(Op0.getNode());
22734 EVT VT = Ld->getValueType(0);
22735 if (!Ld->isVolatile() && !N->getValueType(0).isVector() &&
22736 ISD::isNON_EXTLoad(Op0.getNode()) && Op0.hasOneUse() &&
22737 !XTLI->getSubtarget()->is64Bit() &&
22739 SDValue FILDChain = XTLI->BuildFILD(SDValue(N, 0), Ld->getValueType(0),
22740 Ld->getChain(), Op0, DAG);
22741 DAG.ReplaceAllUsesOfValueWith(Op0.getValue(1), FILDChain.getValue(1));
22748 // Optimize RES, EFLAGS = X86ISD::ADC LHS, RHS, EFLAGS
22749 static SDValue PerformADCCombine(SDNode *N, SelectionDAG &DAG,
22750 X86TargetLowering::DAGCombinerInfo &DCI) {
22751 // If the LHS and RHS of the ADC node are zero, then it can't overflow and
22752 // the result is either zero or one (depending on the input carry bit).
22753 // Strength reduce this down to a "set on carry" aka SETCC_CARRY&1.
22754 if (X86::isZeroNode(N->getOperand(0)) &&
22755 X86::isZeroNode(N->getOperand(1)) &&
22756 // We don't have a good way to replace an EFLAGS use, so only do this when
22758 SDValue(N, 1).use_empty()) {
22760 EVT VT = N->getValueType(0);
22761 SDValue CarryOut = DAG.getConstant(0, N->getValueType(1));
22762 SDValue Res1 = DAG.getNode(ISD::AND, DL, VT,
22763 DAG.getNode(X86ISD::SETCC_CARRY, DL, VT,
22764 DAG.getConstant(X86::COND_B,MVT::i8),
22766 DAG.getConstant(1, VT));
22767 return DCI.CombineTo(N, Res1, CarryOut);
22773 // fold (add Y, (sete X, 0)) -> adc 0, Y
22774 // (add Y, (setne X, 0)) -> sbb -1, Y
22775 // (sub (sete X, 0), Y) -> sbb 0, Y
22776 // (sub (setne X, 0), Y) -> adc -1, Y
22777 static SDValue OptimizeConditionalInDecrement(SDNode *N, SelectionDAG &DAG) {
22780 // Look through ZExts.
22781 SDValue Ext = N->getOperand(N->getOpcode() == ISD::SUB ? 1 : 0);
22782 if (Ext.getOpcode() != ISD::ZERO_EXTEND || !Ext.hasOneUse())
22785 SDValue SetCC = Ext.getOperand(0);
22786 if (SetCC.getOpcode() != X86ISD::SETCC || !SetCC.hasOneUse())
22789 X86::CondCode CC = (X86::CondCode)SetCC.getConstantOperandVal(0);
22790 if (CC != X86::COND_E && CC != X86::COND_NE)
22793 SDValue Cmp = SetCC.getOperand(1);
22794 if (Cmp.getOpcode() != X86ISD::CMP || !Cmp.hasOneUse() ||
22795 !X86::isZeroNode(Cmp.getOperand(1)) ||
22796 !Cmp.getOperand(0).getValueType().isInteger())
22799 SDValue CmpOp0 = Cmp.getOperand(0);
22800 SDValue NewCmp = DAG.getNode(X86ISD::CMP, DL, MVT::i32, CmpOp0,
22801 DAG.getConstant(1, CmpOp0.getValueType()));
22803 SDValue OtherVal = N->getOperand(N->getOpcode() == ISD::SUB ? 0 : 1);
22804 if (CC == X86::COND_NE)
22805 return DAG.getNode(N->getOpcode() == ISD::SUB ? X86ISD::ADC : X86ISD::SBB,
22806 DL, OtherVal.getValueType(), OtherVal,
22807 DAG.getConstant(-1ULL, OtherVal.getValueType()), NewCmp);
22808 return DAG.getNode(N->getOpcode() == ISD::SUB ? X86ISD::SBB : X86ISD::ADC,
22809 DL, OtherVal.getValueType(), OtherVal,
22810 DAG.getConstant(0, OtherVal.getValueType()), NewCmp);
22813 /// PerformADDCombine - Do target-specific dag combines on integer adds.
22814 static SDValue PerformAddCombine(SDNode *N, SelectionDAG &DAG,
22815 const X86Subtarget *Subtarget) {
22816 EVT VT = N->getValueType(0);
22817 SDValue Op0 = N->getOperand(0);
22818 SDValue Op1 = N->getOperand(1);
22820 // Try to synthesize horizontal adds from adds of shuffles.
22821 if (((Subtarget->hasSSSE3() && (VT == MVT::v8i16 || VT == MVT::v4i32)) ||
22822 (Subtarget->hasInt256() && (VT == MVT::v16i16 || VT == MVT::v8i32))) &&
22823 isHorizontalBinOp(Op0, Op1, true))
22824 return DAG.getNode(X86ISD::HADD, SDLoc(N), VT, Op0, Op1);
22826 return OptimizeConditionalInDecrement(N, DAG);
22829 static SDValue PerformSubCombine(SDNode *N, SelectionDAG &DAG,
22830 const X86Subtarget *Subtarget) {
22831 SDValue Op0 = N->getOperand(0);
22832 SDValue Op1 = N->getOperand(1);
22834 // X86 can't encode an immediate LHS of a sub. See if we can push the
22835 // negation into a preceding instruction.
22836 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op0)) {
22837 // If the RHS of the sub is a XOR with one use and a constant, invert the
22838 // immediate. Then add one to the LHS of the sub so we can turn
22839 // X-Y -> X+~Y+1, saving one register.
22840 if (Op1->hasOneUse() && Op1.getOpcode() == ISD::XOR &&
22841 isa<ConstantSDNode>(Op1.getOperand(1))) {
22842 APInt XorC = cast<ConstantSDNode>(Op1.getOperand(1))->getAPIntValue();
22843 EVT VT = Op0.getValueType();
22844 SDValue NewXor = DAG.getNode(ISD::XOR, SDLoc(Op1), VT,
22846 DAG.getConstant(~XorC, VT));
22847 return DAG.getNode(ISD::ADD, SDLoc(N), VT, NewXor,
22848 DAG.getConstant(C->getAPIntValue()+1, VT));
22852 // Try to synthesize horizontal adds from adds of shuffles.
22853 EVT VT = N->getValueType(0);
22854 if (((Subtarget->hasSSSE3() && (VT == MVT::v8i16 || VT == MVT::v4i32)) ||
22855 (Subtarget->hasInt256() && (VT == MVT::v16i16 || VT == MVT::v8i32))) &&
22856 isHorizontalBinOp(Op0, Op1, true))
22857 return DAG.getNode(X86ISD::HSUB, SDLoc(N), VT, Op0, Op1);
22859 return OptimizeConditionalInDecrement(N, DAG);
22862 /// performVZEXTCombine - Performs build vector combines
22863 static SDValue performVZEXTCombine(SDNode *N, SelectionDAG &DAG,
22864 TargetLowering::DAGCombinerInfo &DCI,
22865 const X86Subtarget *Subtarget) {
22866 // (vzext (bitcast (vzext (x)) -> (vzext x)
22867 SDValue In = N->getOperand(0);
22868 while (In.getOpcode() == ISD::BITCAST)
22869 In = In.getOperand(0);
22871 if (In.getOpcode() != X86ISD::VZEXT)
22874 return DAG.getNode(X86ISD::VZEXT, SDLoc(N), N->getValueType(0),
22878 SDValue X86TargetLowering::PerformDAGCombine(SDNode *N,
22879 DAGCombinerInfo &DCI) const {
22880 SelectionDAG &DAG = DCI.DAG;
22881 switch (N->getOpcode()) {
22883 case ISD::EXTRACT_VECTOR_ELT:
22884 return PerformEXTRACT_VECTOR_ELTCombine(N, DAG, DCI);
22886 case ISD::SELECT: return PerformSELECTCombine(N, DAG, DCI, Subtarget);
22887 case X86ISD::CMOV: return PerformCMOVCombine(N, DAG, DCI, Subtarget);
22888 case ISD::ADD: return PerformAddCombine(N, DAG, Subtarget);
22889 case ISD::SUB: return PerformSubCombine(N, DAG, Subtarget);
22890 case X86ISD::ADC: return PerformADCCombine(N, DAG, DCI);
22891 case ISD::MUL: return PerformMulCombine(N, DAG, DCI);
22894 case ISD::SRL: return PerformShiftCombine(N, DAG, DCI, Subtarget);
22895 case ISD::AND: return PerformAndCombine(N, DAG, DCI, Subtarget);
22896 case ISD::OR: return PerformOrCombine(N, DAG, DCI, Subtarget);
22897 case ISD::XOR: return PerformXorCombine(N, DAG, DCI, Subtarget);
22898 case ISD::LOAD: return PerformLOADCombine(N, DAG, DCI, Subtarget);
22899 case ISD::STORE: return PerformSTORECombine(N, DAG, Subtarget);
22900 case ISD::SINT_TO_FP: return PerformSINT_TO_FPCombine(N, DAG, this);
22901 case ISD::FADD: return PerformFADDCombine(N, DAG, Subtarget);
22902 case ISD::FSUB: return PerformFSUBCombine(N, DAG, Subtarget);
22904 case X86ISD::FOR: return PerformFORCombine(N, DAG);
22906 case X86ISD::FMAX: return PerformFMinFMaxCombine(N, DAG);
22907 case X86ISD::FAND: return PerformFANDCombine(N, DAG);
22908 case X86ISD::FANDN: return PerformFANDNCombine(N, DAG);
22909 case X86ISD::BT: return PerformBTCombine(N, DAG, DCI);
22910 case X86ISD::VZEXT_MOVL: return PerformVZEXT_MOVLCombine(N, DAG);
22911 case ISD::ANY_EXTEND:
22912 case ISD::ZERO_EXTEND: return PerformZExtCombine(N, DAG, DCI, Subtarget);
22913 case ISD::SIGN_EXTEND: return PerformSExtCombine(N, DAG, DCI, Subtarget);
22914 case ISD::SIGN_EXTEND_INREG:
22915 return PerformSIGN_EXTEND_INREGCombine(N, DAG, Subtarget);
22916 case ISD::TRUNCATE: return PerformTruncateCombine(N, DAG,DCI,Subtarget);
22917 case ISD::SETCC: return PerformISDSETCCCombine(N, DAG, Subtarget);
22918 case X86ISD::SETCC: return PerformSETCCCombine(N, DAG, DCI, Subtarget);
22919 case X86ISD::BRCOND: return PerformBrCondCombine(N, DAG, DCI, Subtarget);
22920 case X86ISD::VZEXT: return performVZEXTCombine(N, DAG, DCI, Subtarget);
22921 case X86ISD::SHUFP: // Handle all target specific shuffles
22922 case X86ISD::PALIGNR:
22923 case X86ISD::UNPCKH:
22924 case X86ISD::UNPCKL:
22925 case X86ISD::MOVHLPS:
22926 case X86ISD::MOVLHPS:
22927 case X86ISD::PSHUFB:
22928 case X86ISD::PSHUFD:
22929 case X86ISD::PSHUFHW:
22930 case X86ISD::PSHUFLW:
22931 case X86ISD::MOVSS:
22932 case X86ISD::MOVSD:
22933 case X86ISD::VPERMILP:
22934 case X86ISD::VPERM2X128:
22935 case ISD::VECTOR_SHUFFLE: return PerformShuffleCombine(N, DAG, DCI,Subtarget);
22936 case ISD::FMA: return PerformFMACombine(N, DAG, Subtarget);
22937 case ISD::INTRINSIC_WO_CHAIN:
22938 return PerformINTRINSIC_WO_CHAINCombine(N, DAG, Subtarget);
22939 case X86ISD::INSERTPS:
22940 return PerformINSERTPSCombine(N, DAG, Subtarget);
22941 case ISD::BUILD_VECTOR: return PerformBUILD_VECTORCombine(N, DAG, Subtarget);
22947 /// isTypeDesirableForOp - Return true if the target has native support for
22948 /// the specified value type and it is 'desirable' to use the type for the
22949 /// given node type. e.g. On x86 i16 is legal, but undesirable since i16
22950 /// instruction encodings are longer and some i16 instructions are slow.
22951 bool X86TargetLowering::isTypeDesirableForOp(unsigned Opc, EVT VT) const {
22952 if (!isTypeLegal(VT))
22954 if (VT != MVT::i16)
22961 case ISD::SIGN_EXTEND:
22962 case ISD::ZERO_EXTEND:
22963 case ISD::ANY_EXTEND:
22976 /// IsDesirableToPromoteOp - This method query the target whether it is
22977 /// beneficial for dag combiner to promote the specified node. If true, it
22978 /// should return the desired promotion type by reference.
22979 bool X86TargetLowering::IsDesirableToPromoteOp(SDValue Op, EVT &PVT) const {
22980 EVT VT = Op.getValueType();
22981 if (VT != MVT::i16)
22984 bool Promote = false;
22985 bool Commute = false;
22986 switch (Op.getOpcode()) {
22989 LoadSDNode *LD = cast<LoadSDNode>(Op);
22990 // If the non-extending load has a single use and it's not live out, then it
22991 // might be folded.
22992 if (LD->getExtensionType() == ISD::NON_EXTLOAD /*&&
22993 Op.hasOneUse()*/) {
22994 for (SDNode::use_iterator UI = Op.getNode()->use_begin(),
22995 UE = Op.getNode()->use_end(); UI != UE; ++UI) {
22996 // The only case where we'd want to promote LOAD (rather then it being
22997 // promoted as an operand is when it's only use is liveout.
22998 if (UI->getOpcode() != ISD::CopyToReg)
23005 case ISD::SIGN_EXTEND:
23006 case ISD::ZERO_EXTEND:
23007 case ISD::ANY_EXTEND:
23012 SDValue N0 = Op.getOperand(0);
23013 // Look out for (store (shl (load), x)).
23014 if (MayFoldLoad(N0) && MayFoldIntoStore(Op))
23027 SDValue N0 = Op.getOperand(0);
23028 SDValue N1 = Op.getOperand(1);
23029 if (!Commute && MayFoldLoad(N1))
23031 // Avoid disabling potential load folding opportunities.
23032 if (MayFoldLoad(N0) && (!isa<ConstantSDNode>(N1) || MayFoldIntoStore(Op)))
23034 if (MayFoldLoad(N1) && (!isa<ConstantSDNode>(N0) || MayFoldIntoStore(Op)))
23044 //===----------------------------------------------------------------------===//
23045 // X86 Inline Assembly Support
23046 //===----------------------------------------------------------------------===//
23049 // Helper to match a string separated by whitespace.
23050 bool matchAsmImpl(StringRef s, ArrayRef<const StringRef *> args) {
23051 s = s.substr(s.find_first_not_of(" \t")); // Skip leading whitespace.
23053 for (unsigned i = 0, e = args.size(); i != e; ++i) {
23054 StringRef piece(*args[i]);
23055 if (!s.startswith(piece)) // Check if the piece matches.
23058 s = s.substr(piece.size());
23059 StringRef::size_type pos = s.find_first_not_of(" \t");
23060 if (pos == 0) // We matched a prefix.
23068 const VariadicFunction1<bool, StringRef, StringRef, matchAsmImpl> matchAsm={};
23071 static bool clobbersFlagRegisters(const SmallVector<StringRef, 4> &AsmPieces) {
23073 if (AsmPieces.size() == 3 || AsmPieces.size() == 4) {
23074 if (std::count(AsmPieces.begin(), AsmPieces.end(), "~{cc}") &&
23075 std::count(AsmPieces.begin(), AsmPieces.end(), "~{flags}") &&
23076 std::count(AsmPieces.begin(), AsmPieces.end(), "~{fpsr}")) {
23078 if (AsmPieces.size() == 3)
23080 else if (std::count(AsmPieces.begin(), AsmPieces.end(), "~{dirflag}"))
23087 bool X86TargetLowering::ExpandInlineAsm(CallInst *CI) const {
23088 InlineAsm *IA = cast<InlineAsm>(CI->getCalledValue());
23090 std::string AsmStr = IA->getAsmString();
23092 IntegerType *Ty = dyn_cast<IntegerType>(CI->getType());
23093 if (!Ty || Ty->getBitWidth() % 16 != 0)
23096 // TODO: should remove alternatives from the asmstring: "foo {a|b}" -> "foo a"
23097 SmallVector<StringRef, 4> AsmPieces;
23098 SplitString(AsmStr, AsmPieces, ";\n");
23100 switch (AsmPieces.size()) {
23101 default: return false;
23103 // FIXME: this should verify that we are targeting a 486 or better. If not,
23104 // we will turn this bswap into something that will be lowered to logical
23105 // ops instead of emitting the bswap asm. For now, we don't support 486 or
23106 // lower so don't worry about this.
23108 if (matchAsm(AsmPieces[0], "bswap", "$0") ||
23109 matchAsm(AsmPieces[0], "bswapl", "$0") ||
23110 matchAsm(AsmPieces[0], "bswapq", "$0") ||
23111 matchAsm(AsmPieces[0], "bswap", "${0:q}") ||
23112 matchAsm(AsmPieces[0], "bswapl", "${0:q}") ||
23113 matchAsm(AsmPieces[0], "bswapq", "${0:q}")) {
23114 // No need to check constraints, nothing other than the equivalent of
23115 // "=r,0" would be valid here.
23116 return IntrinsicLowering::LowerToByteSwap(CI);
23119 // rorw $$8, ${0:w} --> llvm.bswap.i16
23120 if (CI->getType()->isIntegerTy(16) &&
23121 IA->getConstraintString().compare(0, 5, "=r,0,") == 0 &&
23122 (matchAsm(AsmPieces[0], "rorw", "$$8,", "${0:w}") ||
23123 matchAsm(AsmPieces[0], "rolw", "$$8,", "${0:w}"))) {
23125 const std::string &ConstraintsStr = IA->getConstraintString();
23126 SplitString(StringRef(ConstraintsStr).substr(5), AsmPieces, ",");
23127 array_pod_sort(AsmPieces.begin(), AsmPieces.end());
23128 if (clobbersFlagRegisters(AsmPieces))
23129 return IntrinsicLowering::LowerToByteSwap(CI);
23133 if (CI->getType()->isIntegerTy(32) &&
23134 IA->getConstraintString().compare(0, 5, "=r,0,") == 0 &&
23135 matchAsm(AsmPieces[0], "rorw", "$$8,", "${0:w}") &&
23136 matchAsm(AsmPieces[1], "rorl", "$$16,", "$0") &&
23137 matchAsm(AsmPieces[2], "rorw", "$$8,", "${0:w}")) {
23139 const std::string &ConstraintsStr = IA->getConstraintString();
23140 SplitString(StringRef(ConstraintsStr).substr(5), AsmPieces, ",");
23141 array_pod_sort(AsmPieces.begin(), AsmPieces.end());
23142 if (clobbersFlagRegisters(AsmPieces))
23143 return IntrinsicLowering::LowerToByteSwap(CI);
23146 if (CI->getType()->isIntegerTy(64)) {
23147 InlineAsm::ConstraintInfoVector Constraints = IA->ParseConstraints();
23148 if (Constraints.size() >= 2 &&
23149 Constraints[0].Codes.size() == 1 && Constraints[0].Codes[0] == "A" &&
23150 Constraints[1].Codes.size() == 1 && Constraints[1].Codes[0] == "0") {
23151 // bswap %eax / bswap %edx / xchgl %eax, %edx -> llvm.bswap.i64
23152 if (matchAsm(AsmPieces[0], "bswap", "%eax") &&
23153 matchAsm(AsmPieces[1], "bswap", "%edx") &&
23154 matchAsm(AsmPieces[2], "xchgl", "%eax,", "%edx"))
23155 return IntrinsicLowering::LowerToByteSwap(CI);
23163 /// getConstraintType - Given a constraint letter, return the type of
23164 /// constraint it is for this target.
23165 X86TargetLowering::ConstraintType
23166 X86TargetLowering::getConstraintType(const std::string &Constraint) const {
23167 if (Constraint.size() == 1) {
23168 switch (Constraint[0]) {
23179 return C_RegisterClass;
23203 return TargetLowering::getConstraintType(Constraint);
23206 /// Examine constraint type and operand type and determine a weight value.
23207 /// This object must already have been set up with the operand type
23208 /// and the current alternative constraint selected.
23209 TargetLowering::ConstraintWeight
23210 X86TargetLowering::getSingleConstraintMatchWeight(
23211 AsmOperandInfo &info, const char *constraint) const {
23212 ConstraintWeight weight = CW_Invalid;
23213 Value *CallOperandVal = info.CallOperandVal;
23214 // If we don't have a value, we can't do a match,
23215 // but allow it at the lowest weight.
23216 if (!CallOperandVal)
23218 Type *type = CallOperandVal->getType();
23219 // Look at the constraint type.
23220 switch (*constraint) {
23222 weight = TargetLowering::getSingleConstraintMatchWeight(info, constraint);
23233 if (CallOperandVal->getType()->isIntegerTy())
23234 weight = CW_SpecificReg;
23239 if (type->isFloatingPointTy())
23240 weight = CW_SpecificReg;
23243 if (type->isX86_MMXTy() && Subtarget->hasMMX())
23244 weight = CW_SpecificReg;
23248 if (((type->getPrimitiveSizeInBits() == 128) && Subtarget->hasSSE1()) ||
23249 ((type->getPrimitiveSizeInBits() == 256) && Subtarget->hasFp256()))
23250 weight = CW_Register;
23253 if (ConstantInt *C = dyn_cast<ConstantInt>(info.CallOperandVal)) {
23254 if (C->getZExtValue() <= 31)
23255 weight = CW_Constant;
23259 if (ConstantInt *C = dyn_cast<ConstantInt>(CallOperandVal)) {
23260 if (C->getZExtValue() <= 63)
23261 weight = CW_Constant;
23265 if (ConstantInt *C = dyn_cast<ConstantInt>(CallOperandVal)) {
23266 if ((C->getSExtValue() >= -0x80) && (C->getSExtValue() <= 0x7f))
23267 weight = CW_Constant;
23271 if (ConstantInt *C = dyn_cast<ConstantInt>(CallOperandVal)) {
23272 if ((C->getZExtValue() == 0xff) || (C->getZExtValue() == 0xffff))
23273 weight = CW_Constant;
23277 if (ConstantInt *C = dyn_cast<ConstantInt>(CallOperandVal)) {
23278 if (C->getZExtValue() <= 3)
23279 weight = CW_Constant;
23283 if (ConstantInt *C = dyn_cast<ConstantInt>(CallOperandVal)) {
23284 if (C->getZExtValue() <= 0xff)
23285 weight = CW_Constant;
23290 if (dyn_cast<ConstantFP>(CallOperandVal)) {
23291 weight = CW_Constant;
23295 if (ConstantInt *C = dyn_cast<ConstantInt>(CallOperandVal)) {
23296 if ((C->getSExtValue() >= -0x80000000LL) &&
23297 (C->getSExtValue() <= 0x7fffffffLL))
23298 weight = CW_Constant;
23302 if (ConstantInt *C = dyn_cast<ConstantInt>(CallOperandVal)) {
23303 if (C->getZExtValue() <= 0xffffffff)
23304 weight = CW_Constant;
23311 /// LowerXConstraint - try to replace an X constraint, which matches anything,
23312 /// with another that has more specific requirements based on the type of the
23313 /// corresponding operand.
23314 const char *X86TargetLowering::
23315 LowerXConstraint(EVT ConstraintVT) const {
23316 // FP X constraints get lowered to SSE1/2 registers if available, otherwise
23317 // 'f' like normal targets.
23318 if (ConstraintVT.isFloatingPoint()) {
23319 if (Subtarget->hasSSE2())
23321 if (Subtarget->hasSSE1())
23325 return TargetLowering::LowerXConstraint(ConstraintVT);
23328 /// LowerAsmOperandForConstraint - Lower the specified operand into the Ops
23329 /// vector. If it is invalid, don't add anything to Ops.
23330 void X86TargetLowering::LowerAsmOperandForConstraint(SDValue Op,
23331 std::string &Constraint,
23332 std::vector<SDValue>&Ops,
23333 SelectionDAG &DAG) const {
23336 // Only support length 1 constraints for now.
23337 if (Constraint.length() > 1) return;
23339 char ConstraintLetter = Constraint[0];
23340 switch (ConstraintLetter) {
23343 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op)) {
23344 if (C->getZExtValue() <= 31) {
23345 Result = DAG.getTargetConstant(C->getZExtValue(), Op.getValueType());
23351 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op)) {
23352 if (C->getZExtValue() <= 63) {
23353 Result = DAG.getTargetConstant(C->getZExtValue(), Op.getValueType());
23359 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op)) {
23360 if (isInt<8>(C->getSExtValue())) {
23361 Result = DAG.getTargetConstant(C->getZExtValue(), Op.getValueType());
23367 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op)) {
23368 if (C->getZExtValue() <= 255) {
23369 Result = DAG.getTargetConstant(C->getZExtValue(), Op.getValueType());
23375 // 32-bit signed value
23376 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op)) {
23377 if (ConstantInt::isValueValidForType(Type::getInt32Ty(*DAG.getContext()),
23378 C->getSExtValue())) {
23379 // Widen to 64 bits here to get it sign extended.
23380 Result = DAG.getTargetConstant(C->getSExtValue(), MVT::i64);
23383 // FIXME gcc accepts some relocatable values here too, but only in certain
23384 // memory models; it's complicated.
23389 // 32-bit unsigned value
23390 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op)) {
23391 if (ConstantInt::isValueValidForType(Type::getInt32Ty(*DAG.getContext()),
23392 C->getZExtValue())) {
23393 Result = DAG.getTargetConstant(C->getZExtValue(), Op.getValueType());
23397 // FIXME gcc accepts some relocatable values here too, but only in certain
23398 // memory models; it's complicated.
23402 // Literal immediates are always ok.
23403 if (ConstantSDNode *CST = dyn_cast<ConstantSDNode>(Op)) {
23404 // Widen to 64 bits here to get it sign extended.
23405 Result = DAG.getTargetConstant(CST->getSExtValue(), MVT::i64);
23409 // In any sort of PIC mode addresses need to be computed at runtime by
23410 // adding in a register or some sort of table lookup. These can't
23411 // be used as immediates.
23412 if (Subtarget->isPICStyleGOT() || Subtarget->isPICStyleStubPIC())
23415 // If we are in non-pic codegen mode, we allow the address of a global (with
23416 // an optional displacement) to be used with 'i'.
23417 GlobalAddressSDNode *GA = nullptr;
23418 int64_t Offset = 0;
23420 // Match either (GA), (GA+C), (GA+C1+C2), etc.
23422 if ((GA = dyn_cast<GlobalAddressSDNode>(Op))) {
23423 Offset += GA->getOffset();
23425 } else if (Op.getOpcode() == ISD::ADD) {
23426 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op.getOperand(1))) {
23427 Offset += C->getZExtValue();
23428 Op = Op.getOperand(0);
23431 } else if (Op.getOpcode() == ISD::SUB) {
23432 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op.getOperand(1))) {
23433 Offset += -C->getZExtValue();
23434 Op = Op.getOperand(0);
23439 // Otherwise, this isn't something we can handle, reject it.
23443 const GlobalValue *GV = GA->getGlobal();
23444 // If we require an extra load to get this address, as in PIC mode, we
23445 // can't accept it.
23446 if (isGlobalStubReference(
23447 Subtarget->ClassifyGlobalReference(GV, DAG.getTarget())))
23450 Result = DAG.getTargetGlobalAddress(GV, SDLoc(Op),
23451 GA->getValueType(0), Offset);
23456 if (Result.getNode()) {
23457 Ops.push_back(Result);
23460 return TargetLowering::LowerAsmOperandForConstraint(Op, Constraint, Ops, DAG);
23463 std::pair<unsigned, const TargetRegisterClass*>
23464 X86TargetLowering::getRegForInlineAsmConstraint(const std::string &Constraint,
23466 // First, see if this is a constraint that directly corresponds to an LLVM
23468 if (Constraint.size() == 1) {
23469 // GCC Constraint Letters
23470 switch (Constraint[0]) {
23472 // TODO: Slight differences here in allocation order and leaving
23473 // RIP in the class. Do they matter any more here than they do
23474 // in the normal allocation?
23475 case 'q': // GENERAL_REGS in 64-bit mode, Q_REGS in 32-bit mode.
23476 if (Subtarget->is64Bit()) {
23477 if (VT == MVT::i32 || VT == MVT::f32)
23478 return std::make_pair(0U, &X86::GR32RegClass);
23479 if (VT == MVT::i16)
23480 return std::make_pair(0U, &X86::GR16RegClass);
23481 if (VT == MVT::i8 || VT == MVT::i1)
23482 return std::make_pair(0U, &X86::GR8RegClass);
23483 if (VT == MVT::i64 || VT == MVT::f64)
23484 return std::make_pair(0U, &X86::GR64RegClass);
23487 // 32-bit fallthrough
23488 case 'Q': // Q_REGS
23489 if (VT == MVT::i32 || VT == MVT::f32)
23490 return std::make_pair(0U, &X86::GR32_ABCDRegClass);
23491 if (VT == MVT::i16)
23492 return std::make_pair(0U, &X86::GR16_ABCDRegClass);
23493 if (VT == MVT::i8 || VT == MVT::i1)
23494 return std::make_pair(0U, &X86::GR8_ABCD_LRegClass);
23495 if (VT == MVT::i64)
23496 return std::make_pair(0U, &X86::GR64_ABCDRegClass);
23498 case 'r': // GENERAL_REGS
23499 case 'l': // INDEX_REGS
23500 if (VT == MVT::i8 || VT == MVT::i1)
23501 return std::make_pair(0U, &X86::GR8RegClass);
23502 if (VT == MVT::i16)
23503 return std::make_pair(0U, &X86::GR16RegClass);
23504 if (VT == MVT::i32 || VT == MVT::f32 || !Subtarget->is64Bit())
23505 return std::make_pair(0U, &X86::GR32RegClass);
23506 return std::make_pair(0U, &X86::GR64RegClass);
23507 case 'R': // LEGACY_REGS
23508 if (VT == MVT::i8 || VT == MVT::i1)
23509 return std::make_pair(0U, &X86::GR8_NOREXRegClass);
23510 if (VT == MVT::i16)
23511 return std::make_pair(0U, &X86::GR16_NOREXRegClass);
23512 if (VT == MVT::i32 || !Subtarget->is64Bit())
23513 return std::make_pair(0U, &X86::GR32_NOREXRegClass);
23514 return std::make_pair(0U, &X86::GR64_NOREXRegClass);
23515 case 'f': // FP Stack registers.
23516 // If SSE is enabled for this VT, use f80 to ensure the isel moves the
23517 // value to the correct fpstack register class.
23518 if (VT == MVT::f32 && !isScalarFPTypeInSSEReg(VT))
23519 return std::make_pair(0U, &X86::RFP32RegClass);
23520 if (VT == MVT::f64 && !isScalarFPTypeInSSEReg(VT))
23521 return std::make_pair(0U, &X86::RFP64RegClass);
23522 return std::make_pair(0U, &X86::RFP80RegClass);
23523 case 'y': // MMX_REGS if MMX allowed.
23524 if (!Subtarget->hasMMX()) break;
23525 return std::make_pair(0U, &X86::VR64RegClass);
23526 case 'Y': // SSE_REGS if SSE2 allowed
23527 if (!Subtarget->hasSSE2()) break;
23529 case 'x': // SSE_REGS if SSE1 allowed or AVX_REGS if AVX allowed
23530 if (!Subtarget->hasSSE1()) break;
23532 switch (VT.SimpleTy) {
23534 // Scalar SSE types.
23537 return std::make_pair(0U, &X86::FR32RegClass);
23540 return std::make_pair(0U, &X86::FR64RegClass);
23548 return std::make_pair(0U, &X86::VR128RegClass);
23556 return std::make_pair(0U, &X86::VR256RegClass);
23561 return std::make_pair(0U, &X86::VR512RegClass);
23567 // Use the default implementation in TargetLowering to convert the register
23568 // constraint into a member of a register class.
23569 std::pair<unsigned, const TargetRegisterClass*> Res;
23570 Res = TargetLowering::getRegForInlineAsmConstraint(Constraint, VT);
23572 // Not found as a standard register?
23574 // Map st(0) -> st(7) -> ST0
23575 if (Constraint.size() == 7 && Constraint[0] == '{' &&
23576 tolower(Constraint[1]) == 's' &&
23577 tolower(Constraint[2]) == 't' &&
23578 Constraint[3] == '(' &&
23579 (Constraint[4] >= '0' && Constraint[4] <= '7') &&
23580 Constraint[5] == ')' &&
23581 Constraint[6] == '}') {
23583 Res.first = X86::FP0+Constraint[4]-'0';
23584 Res.second = &X86::RFP80RegClass;
23588 // GCC allows "st(0)" to be called just plain "st".
23589 if (StringRef("{st}").equals_lower(Constraint)) {
23590 Res.first = X86::FP0;
23591 Res.second = &X86::RFP80RegClass;
23596 if (StringRef("{flags}").equals_lower(Constraint)) {
23597 Res.first = X86::EFLAGS;
23598 Res.second = &X86::CCRRegClass;
23602 // 'A' means EAX + EDX.
23603 if (Constraint == "A") {
23604 Res.first = X86::EAX;
23605 Res.second = &X86::GR32_ADRegClass;
23611 // Otherwise, check to see if this is a register class of the wrong value
23612 // type. For example, we want to map "{ax},i32" -> {eax}, we don't want it to
23613 // turn into {ax},{dx}.
23614 if (Res.second->hasType(VT))
23615 return Res; // Correct type already, nothing to do.
23617 // All of the single-register GCC register classes map their values onto
23618 // 16-bit register pieces "ax","dx","cx","bx","si","di","bp","sp". If we
23619 // really want an 8-bit or 32-bit register, map to the appropriate register
23620 // class and return the appropriate register.
23621 if (Res.second == &X86::GR16RegClass) {
23622 if (VT == MVT::i8 || VT == MVT::i1) {
23623 unsigned DestReg = 0;
23624 switch (Res.first) {
23626 case X86::AX: DestReg = X86::AL; break;
23627 case X86::DX: DestReg = X86::DL; break;
23628 case X86::CX: DestReg = X86::CL; break;
23629 case X86::BX: DestReg = X86::BL; break;
23632 Res.first = DestReg;
23633 Res.second = &X86::GR8RegClass;
23635 } else if (VT == MVT::i32 || VT == MVT::f32) {
23636 unsigned DestReg = 0;
23637 switch (Res.first) {
23639 case X86::AX: DestReg = X86::EAX; break;
23640 case X86::DX: DestReg = X86::EDX; break;
23641 case X86::CX: DestReg = X86::ECX; break;
23642 case X86::BX: DestReg = X86::EBX; break;
23643 case X86::SI: DestReg = X86::ESI; break;
23644 case X86::DI: DestReg = X86::EDI; break;
23645 case X86::BP: DestReg = X86::EBP; break;
23646 case X86::SP: DestReg = X86::ESP; break;
23649 Res.first = DestReg;
23650 Res.second = &X86::GR32RegClass;
23652 } else if (VT == MVT::i64 || VT == MVT::f64) {
23653 unsigned DestReg = 0;
23654 switch (Res.first) {
23656 case X86::AX: DestReg = X86::RAX; break;
23657 case X86::DX: DestReg = X86::RDX; break;
23658 case X86::CX: DestReg = X86::RCX; break;
23659 case X86::BX: DestReg = X86::RBX; break;
23660 case X86::SI: DestReg = X86::RSI; break;
23661 case X86::DI: DestReg = X86::RDI; break;
23662 case X86::BP: DestReg = X86::RBP; break;
23663 case X86::SP: DestReg = X86::RSP; break;
23666 Res.first = DestReg;
23667 Res.second = &X86::GR64RegClass;
23670 } else if (Res.second == &X86::FR32RegClass ||
23671 Res.second == &X86::FR64RegClass ||
23672 Res.second == &X86::VR128RegClass ||
23673 Res.second == &X86::VR256RegClass ||
23674 Res.second == &X86::FR32XRegClass ||
23675 Res.second == &X86::FR64XRegClass ||
23676 Res.second == &X86::VR128XRegClass ||
23677 Res.second == &X86::VR256XRegClass ||
23678 Res.second == &X86::VR512RegClass) {
23679 // Handle references to XMM physical registers that got mapped into the
23680 // wrong class. This can happen with constraints like {xmm0} where the
23681 // target independent register mapper will just pick the first match it can
23682 // find, ignoring the required type.
23684 if (VT == MVT::f32 || VT == MVT::i32)
23685 Res.second = &X86::FR32RegClass;
23686 else if (VT == MVT::f64 || VT == MVT::i64)
23687 Res.second = &X86::FR64RegClass;
23688 else if (X86::VR128RegClass.hasType(VT))
23689 Res.second = &X86::VR128RegClass;
23690 else if (X86::VR256RegClass.hasType(VT))
23691 Res.second = &X86::VR256RegClass;
23692 else if (X86::VR512RegClass.hasType(VT))
23693 Res.second = &X86::VR512RegClass;
23699 int X86TargetLowering::getScalingFactorCost(const AddrMode &AM,
23701 // Scaling factors are not free at all.
23702 // An indexed folded instruction, i.e., inst (reg1, reg2, scale),
23703 // will take 2 allocations in the out of order engine instead of 1
23704 // for plain addressing mode, i.e. inst (reg1).
23706 // vaddps (%rsi,%drx), %ymm0, %ymm1
23707 // Requires two allocations (one for the load, one for the computation)
23709 // vaddps (%rsi), %ymm0, %ymm1
23710 // Requires just 1 allocation, i.e., freeing allocations for other operations
23711 // and having less micro operations to execute.
23713 // For some X86 architectures, this is even worse because for instance for
23714 // stores, the complex addressing mode forces the instruction to use the
23715 // "load" ports instead of the dedicated "store" port.
23716 // E.g., on Haswell:
23717 // vmovaps %ymm1, (%r8, %rdi) can use port 2 or 3.
23718 // vmovaps %ymm1, (%r8) can use port 2, 3, or 7.
23719 if (isLegalAddressingMode(AM, Ty))
23720 // Scale represents reg2 * scale, thus account for 1
23721 // as soon as we use a second register.
23722 return AM.Scale != 0;
23726 bool X86TargetLowering::isTargetFTOL() const {
23727 return Subtarget->isTargetKnownWindowsMSVC() && !Subtarget->is64Bit();