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 "X86FrameLowering.h"
19 #include "X86InstrBuilder.h"
20 #include "X86MachineFunctionInfo.h"
21 #include "X86TargetMachine.h"
22 #include "X86TargetObjectFile.h"
23 #include "llvm/ADT/SmallBitVector.h"
24 #include "llvm/ADT/SmallSet.h"
25 #include "llvm/ADT/Statistic.h"
26 #include "llvm/ADT/StringExtras.h"
27 #include "llvm/ADT/StringSwitch.h"
28 #include "llvm/Analysis/LibCallSemantics.h"
29 #include "llvm/CodeGen/IntrinsicLowering.h"
30 #include "llvm/CodeGen/MachineFrameInfo.h"
31 #include "llvm/CodeGen/MachineFunction.h"
32 #include "llvm/CodeGen/MachineInstrBuilder.h"
33 #include "llvm/CodeGen/MachineJumpTableInfo.h"
34 #include "llvm/CodeGen/MachineModuleInfo.h"
35 #include "llvm/CodeGen/MachineRegisterInfo.h"
36 #include "llvm/CodeGen/WinEHFuncInfo.h"
37 #include "llvm/IR/CallSite.h"
38 #include "llvm/IR/CallingConv.h"
39 #include "llvm/IR/Constants.h"
40 #include "llvm/IR/DerivedTypes.h"
41 #include "llvm/IR/Function.h"
42 #include "llvm/IR/GlobalAlias.h"
43 #include "llvm/IR/GlobalVariable.h"
44 #include "llvm/IR/Instructions.h"
45 #include "llvm/IR/Intrinsics.h"
46 #include "llvm/MC/MCAsmInfo.h"
47 #include "llvm/MC/MCContext.h"
48 #include "llvm/MC/MCExpr.h"
49 #include "llvm/MC/MCSymbol.h"
50 #include "llvm/Support/CommandLine.h"
51 #include "llvm/Support/Debug.h"
52 #include "llvm/Support/ErrorHandling.h"
53 #include "llvm/Support/MathExtras.h"
54 #include "llvm/Target/TargetOptions.h"
55 #include "X86IntrinsicsInfo.h"
61 #define DEBUG_TYPE "x86-isel"
63 STATISTIC(NumTailCalls, "Number of tail calls");
65 static cl::opt<bool> ExperimentalVectorWideningLegalization(
66 "x86-experimental-vector-widening-legalization", cl::init(false),
67 cl::desc("Enable an experimental vector type legalization through widening "
68 "rather than promotion."),
71 X86TargetLowering::X86TargetLowering(const X86TargetMachine &TM,
72 const X86Subtarget &STI)
73 : TargetLowering(TM), Subtarget(&STI) {
74 X86ScalarSSEf64 = Subtarget->hasSSE2();
75 X86ScalarSSEf32 = Subtarget->hasSSE1();
76 MVT PtrVT = MVT::getIntegerVT(8 * TM.getPointerSize());
78 // Set up the TargetLowering object.
80 // X86 is weird. It always uses i8 for shift amounts and setcc results.
81 setBooleanContents(ZeroOrOneBooleanContent);
82 // X86-SSE is even stranger. It uses -1 or 0 for vector masks.
83 setBooleanVectorContents(ZeroOrNegativeOneBooleanContent);
85 // For 64-bit, since we have so many registers, use the ILP scheduler.
86 // For 32-bit, use the register pressure specific scheduling.
87 // For Atom, always use ILP scheduling.
88 if (Subtarget->isAtom())
89 setSchedulingPreference(Sched::ILP);
90 else if (Subtarget->is64Bit())
91 setSchedulingPreference(Sched::ILP);
93 setSchedulingPreference(Sched::RegPressure);
94 const X86RegisterInfo *RegInfo = Subtarget->getRegisterInfo();
95 setStackPointerRegisterToSaveRestore(RegInfo->getStackRegister());
97 // Bypass expensive divides on Atom when compiling with O2.
98 if (TM.getOptLevel() >= CodeGenOpt::Default) {
99 if (Subtarget->hasSlowDivide32())
100 addBypassSlowDiv(32, 8);
101 if (Subtarget->hasSlowDivide64() && Subtarget->is64Bit())
102 addBypassSlowDiv(64, 16);
105 if (Subtarget->isTargetKnownWindowsMSVC()) {
106 // Setup Windows compiler runtime calls.
107 setLibcallName(RTLIB::SDIV_I64, "_alldiv");
108 setLibcallName(RTLIB::UDIV_I64, "_aulldiv");
109 setLibcallName(RTLIB::SREM_I64, "_allrem");
110 setLibcallName(RTLIB::UREM_I64, "_aullrem");
111 setLibcallName(RTLIB::MUL_I64, "_allmul");
112 setLibcallCallingConv(RTLIB::SDIV_I64, CallingConv::X86_StdCall);
113 setLibcallCallingConv(RTLIB::UDIV_I64, CallingConv::X86_StdCall);
114 setLibcallCallingConv(RTLIB::SREM_I64, CallingConv::X86_StdCall);
115 setLibcallCallingConv(RTLIB::UREM_I64, CallingConv::X86_StdCall);
116 setLibcallCallingConv(RTLIB::MUL_I64, CallingConv::X86_StdCall);
119 if (Subtarget->isTargetDarwin()) {
120 // Darwin should use _setjmp/_longjmp instead of setjmp/longjmp.
121 setUseUnderscoreSetJmp(false);
122 setUseUnderscoreLongJmp(false);
123 } else if (Subtarget->isTargetWindowsGNU()) {
124 // MS runtime is weird: it exports _setjmp, but longjmp!
125 setUseUnderscoreSetJmp(true);
126 setUseUnderscoreLongJmp(false);
128 setUseUnderscoreSetJmp(true);
129 setUseUnderscoreLongJmp(true);
132 // Set up the register classes.
133 addRegisterClass(MVT::i8, &X86::GR8RegClass);
134 addRegisterClass(MVT::i16, &X86::GR16RegClass);
135 addRegisterClass(MVT::i32, &X86::GR32RegClass);
136 if (Subtarget->is64Bit())
137 addRegisterClass(MVT::i64, &X86::GR64RegClass);
139 for (MVT VT : MVT::integer_valuetypes())
140 setLoadExtAction(ISD::SEXTLOAD, VT, MVT::i1, Promote);
142 // We don't accept any truncstore of integer registers.
143 setTruncStoreAction(MVT::i64, MVT::i32, Expand);
144 setTruncStoreAction(MVT::i64, MVT::i16, Expand);
145 setTruncStoreAction(MVT::i64, MVT::i8 , Expand);
146 setTruncStoreAction(MVT::i32, MVT::i16, Expand);
147 setTruncStoreAction(MVT::i32, MVT::i8 , Expand);
148 setTruncStoreAction(MVT::i16, MVT::i8, Expand);
150 setTruncStoreAction(MVT::f64, MVT::f32, Expand);
152 // SETOEQ and SETUNE require checking two conditions.
153 setCondCodeAction(ISD::SETOEQ, MVT::f32, Expand);
154 setCondCodeAction(ISD::SETOEQ, MVT::f64, Expand);
155 setCondCodeAction(ISD::SETOEQ, MVT::f80, Expand);
156 setCondCodeAction(ISD::SETUNE, MVT::f32, Expand);
157 setCondCodeAction(ISD::SETUNE, MVT::f64, Expand);
158 setCondCodeAction(ISD::SETUNE, MVT::f80, Expand);
160 // Promote all UINT_TO_FP to larger SINT_TO_FP's, as X86 doesn't have this
162 setOperationAction(ISD::UINT_TO_FP , MVT::i1 , Promote);
163 setOperationAction(ISD::UINT_TO_FP , MVT::i8 , Promote);
164 setOperationAction(ISD::UINT_TO_FP , MVT::i16 , Promote);
166 if (Subtarget->is64Bit()) {
167 if (!Subtarget->useSoftFloat() && Subtarget->hasAVX512())
168 // f32/f64 are legal, f80 is custom.
169 setOperationAction(ISD::UINT_TO_FP , MVT::i32 , Custom);
171 setOperationAction(ISD::UINT_TO_FP , MVT::i32 , Promote);
172 setOperationAction(ISD::UINT_TO_FP , MVT::i64 , Custom);
173 } else if (!Subtarget->useSoftFloat()) {
174 // We have an algorithm for SSE2->double, and we turn this into a
175 // 64-bit FILD followed by conditional FADD for other targets.
176 setOperationAction(ISD::UINT_TO_FP , MVT::i64 , Custom);
177 // We have an algorithm for SSE2, and we turn this into a 64-bit
178 // FILD or VCVTUSI2SS/SD for other targets.
179 setOperationAction(ISD::UINT_TO_FP , MVT::i32 , Custom);
182 // Promote i1/i8 SINT_TO_FP to larger SINT_TO_FP's, as X86 doesn't have
184 setOperationAction(ISD::SINT_TO_FP , MVT::i1 , Promote);
185 setOperationAction(ISD::SINT_TO_FP , MVT::i8 , Promote);
187 if (!Subtarget->useSoftFloat()) {
188 // SSE has no i16 to fp conversion, only i32
189 if (X86ScalarSSEf32) {
190 setOperationAction(ISD::SINT_TO_FP , MVT::i16 , Promote);
191 // f32 and f64 cases are Legal, f80 case is not
192 setOperationAction(ISD::SINT_TO_FP , MVT::i32 , Custom);
194 setOperationAction(ISD::SINT_TO_FP , MVT::i16 , Custom);
195 setOperationAction(ISD::SINT_TO_FP , MVT::i32 , Custom);
198 setOperationAction(ISD::SINT_TO_FP , MVT::i16 , Promote);
199 setOperationAction(ISD::SINT_TO_FP , MVT::i32 , Promote);
202 // Promote i1/i8 FP_TO_SINT to larger FP_TO_SINTS's, as X86 doesn't have
204 setOperationAction(ISD::FP_TO_SINT , MVT::i1 , Promote);
205 setOperationAction(ISD::FP_TO_SINT , MVT::i8 , Promote);
207 if (!Subtarget->useSoftFloat()) {
208 // In 32-bit mode these are custom lowered. In 64-bit mode F32 and F64
209 // are Legal, f80 is custom lowered.
210 setOperationAction(ISD::FP_TO_SINT , MVT::i64 , Custom);
211 setOperationAction(ISD::SINT_TO_FP , MVT::i64 , Custom);
213 if (X86ScalarSSEf32) {
214 setOperationAction(ISD::FP_TO_SINT , MVT::i16 , Promote);
215 // f32 and f64 cases are Legal, f80 case is not
216 setOperationAction(ISD::FP_TO_SINT , MVT::i32 , Custom);
218 setOperationAction(ISD::FP_TO_SINT , MVT::i16 , Custom);
219 setOperationAction(ISD::FP_TO_SINT , MVT::i32 , Custom);
222 setOperationAction(ISD::FP_TO_SINT , MVT::i16 , Promote);
223 setOperationAction(ISD::FP_TO_SINT , MVT::i32 , Expand);
224 setOperationAction(ISD::FP_TO_SINT , MVT::i64 , Expand);
227 // Handle FP_TO_UINT by promoting the destination to a larger signed
229 setOperationAction(ISD::FP_TO_UINT , MVT::i1 , Promote);
230 setOperationAction(ISD::FP_TO_UINT , MVT::i8 , Promote);
231 setOperationAction(ISD::FP_TO_UINT , MVT::i16 , Promote);
233 if (Subtarget->is64Bit()) {
234 if (!Subtarget->useSoftFloat() && Subtarget->hasAVX512()) {
235 // FP_TO_UINT-i32/i64 is legal for f32/f64, but custom for f80.
236 setOperationAction(ISD::FP_TO_UINT , MVT::i32 , Custom);
237 setOperationAction(ISD::FP_TO_UINT , MVT::i64 , Custom);
239 setOperationAction(ISD::FP_TO_UINT , MVT::i32 , Promote);
240 setOperationAction(ISD::FP_TO_UINT , MVT::i64 , Expand);
242 } else if (!Subtarget->useSoftFloat()) {
243 // Since AVX is a superset of SSE3, only check for SSE here.
244 if (Subtarget->hasSSE1() && !Subtarget->hasSSE3())
245 // Expand FP_TO_UINT into a select.
246 // FIXME: We would like to use a Custom expander here eventually to do
247 // the optimal thing for SSE vs. the default expansion in the legalizer.
248 setOperationAction(ISD::FP_TO_UINT , MVT::i32 , Expand);
250 // With AVX512 we can use vcvts[ds]2usi for f32/f64->i32, f80 is custom.
251 // With SSE3 we can use fisttpll to convert to a signed i64; without
252 // SSE, we're stuck with a fistpll.
253 setOperationAction(ISD::FP_TO_UINT , MVT::i32 , Custom);
255 setOperationAction(ISD::FP_TO_UINT , MVT::i64 , Custom);
258 // TODO: when we have SSE, these could be more efficient, by using movd/movq.
259 if (!X86ScalarSSEf64) {
260 setOperationAction(ISD::BITCAST , MVT::f32 , Expand);
261 setOperationAction(ISD::BITCAST , MVT::i32 , Expand);
262 if (Subtarget->is64Bit()) {
263 setOperationAction(ISD::BITCAST , MVT::f64 , Expand);
264 // Without SSE, i64->f64 goes through memory.
265 setOperationAction(ISD::BITCAST , MVT::i64 , Expand);
269 // Scalar integer divide and remainder are lowered to use operations that
270 // produce two results, to match the available instructions. This exposes
271 // the two-result form to trivial CSE, which is able to combine x/y and x%y
272 // into a single instruction.
274 // Scalar integer multiply-high is also lowered to use two-result
275 // operations, to match the available instructions. However, plain multiply
276 // (low) operations are left as Legal, as there are single-result
277 // instructions for this in x86. Using the two-result multiply instructions
278 // when both high and low results are needed must be arranged by dagcombine.
279 for (auto VT : { MVT::i8, MVT::i16, MVT::i32, MVT::i64 }) {
280 setOperationAction(ISD::MULHS, VT, Expand);
281 setOperationAction(ISD::MULHU, VT, Expand);
282 setOperationAction(ISD::SDIV, VT, Expand);
283 setOperationAction(ISD::UDIV, VT, Expand);
284 setOperationAction(ISD::SREM, VT, Expand);
285 setOperationAction(ISD::UREM, VT, Expand);
287 // Add/Sub overflow ops with MVT::Glues are lowered to EFLAGS dependences.
288 setOperationAction(ISD::ADDC, VT, Custom);
289 setOperationAction(ISD::ADDE, VT, Custom);
290 setOperationAction(ISD::SUBC, VT, Custom);
291 setOperationAction(ISD::SUBE, VT, Custom);
294 setOperationAction(ISD::BR_JT , MVT::Other, Expand);
295 setOperationAction(ISD::BRCOND , MVT::Other, Custom);
296 setOperationAction(ISD::BR_CC , MVT::f32, Expand);
297 setOperationAction(ISD::BR_CC , MVT::f64, Expand);
298 setOperationAction(ISD::BR_CC , MVT::f80, Expand);
299 setOperationAction(ISD::BR_CC , MVT::i8, Expand);
300 setOperationAction(ISD::BR_CC , MVT::i16, Expand);
301 setOperationAction(ISD::BR_CC , MVT::i32, Expand);
302 setOperationAction(ISD::BR_CC , MVT::i64, Expand);
303 setOperationAction(ISD::SELECT_CC , MVT::f32, Expand);
304 setOperationAction(ISD::SELECT_CC , MVT::f64, Expand);
305 setOperationAction(ISD::SELECT_CC , MVT::f80, Expand);
306 setOperationAction(ISD::SELECT_CC , MVT::i8, Expand);
307 setOperationAction(ISD::SELECT_CC , MVT::i16, Expand);
308 setOperationAction(ISD::SELECT_CC , MVT::i32, Expand);
309 setOperationAction(ISD::SELECT_CC , MVT::i64, Expand);
310 if (Subtarget->is64Bit())
311 setOperationAction(ISD::SIGN_EXTEND_INREG, MVT::i32, Legal);
312 setOperationAction(ISD::SIGN_EXTEND_INREG, MVT::i16 , Legal);
313 setOperationAction(ISD::SIGN_EXTEND_INREG, MVT::i8 , Legal);
314 setOperationAction(ISD::SIGN_EXTEND_INREG, MVT::i1 , Expand);
315 setOperationAction(ISD::FP_ROUND_INREG , MVT::f32 , Expand);
317 if (Subtarget->is32Bit() && Subtarget->isTargetKnownWindowsMSVC()) {
318 // On 32 bit MSVC, `fmodf(f32)` is not defined - only `fmod(f64)`
319 // is. We should promote the value to 64-bits to solve this.
320 // This is what the CRT headers do - `fmodf` is an inline header
321 // function casting to f64 and calling `fmod`.
322 setOperationAction(ISD::FREM , MVT::f32 , Promote);
324 setOperationAction(ISD::FREM , MVT::f32 , Expand);
327 setOperationAction(ISD::FREM , MVT::f64 , Expand);
328 setOperationAction(ISD::FREM , MVT::f80 , Expand);
329 setOperationAction(ISD::FLT_ROUNDS_ , MVT::i32 , Custom);
331 // Promote the i8 variants and force them on up to i32 which has a shorter
333 setOperationAction(ISD::CTTZ , MVT::i8 , Promote);
334 AddPromotedToType (ISD::CTTZ , MVT::i8 , MVT::i32);
335 setOperationAction(ISD::CTTZ_ZERO_UNDEF , MVT::i8 , Promote);
336 AddPromotedToType (ISD::CTTZ_ZERO_UNDEF , MVT::i8 , MVT::i32);
337 if (Subtarget->hasBMI()) {
338 setOperationAction(ISD::CTTZ_ZERO_UNDEF, MVT::i16 , Expand);
339 setOperationAction(ISD::CTTZ_ZERO_UNDEF, MVT::i32 , Expand);
340 if (Subtarget->is64Bit())
341 setOperationAction(ISD::CTTZ_ZERO_UNDEF, MVT::i64, Expand);
343 setOperationAction(ISD::CTTZ , MVT::i16 , Custom);
344 setOperationAction(ISD::CTTZ , MVT::i32 , Custom);
345 if (Subtarget->is64Bit())
346 setOperationAction(ISD::CTTZ , MVT::i64 , Custom);
349 if (Subtarget->hasLZCNT()) {
350 // When promoting the i8 variants, force them to i32 for a shorter
352 setOperationAction(ISD::CTLZ , MVT::i8 , Promote);
353 AddPromotedToType (ISD::CTLZ , MVT::i8 , MVT::i32);
354 setOperationAction(ISD::CTLZ_ZERO_UNDEF, MVT::i8 , Promote);
355 AddPromotedToType (ISD::CTLZ_ZERO_UNDEF, MVT::i8 , MVT::i32);
356 setOperationAction(ISD::CTLZ_ZERO_UNDEF, MVT::i16 , Expand);
357 setOperationAction(ISD::CTLZ_ZERO_UNDEF, MVT::i32 , Expand);
358 if (Subtarget->is64Bit())
359 setOperationAction(ISD::CTLZ_ZERO_UNDEF, MVT::i64, Expand);
361 setOperationAction(ISD::CTLZ , MVT::i8 , Custom);
362 setOperationAction(ISD::CTLZ , MVT::i16 , Custom);
363 setOperationAction(ISD::CTLZ , MVT::i32 , Custom);
364 setOperationAction(ISD::CTLZ_ZERO_UNDEF, MVT::i8 , Custom);
365 setOperationAction(ISD::CTLZ_ZERO_UNDEF, MVT::i16 , Custom);
366 setOperationAction(ISD::CTLZ_ZERO_UNDEF, MVT::i32 , Custom);
367 if (Subtarget->is64Bit()) {
368 setOperationAction(ISD::CTLZ , MVT::i64 , Custom);
369 setOperationAction(ISD::CTLZ_ZERO_UNDEF, MVT::i64, Custom);
373 // Special handling for half-precision floating point conversions.
374 // If we don't have F16C support, then lower half float conversions
375 // into library calls.
376 if (Subtarget->useSoftFloat() || !Subtarget->hasF16C()) {
377 setOperationAction(ISD::FP16_TO_FP, MVT::f32, Expand);
378 setOperationAction(ISD::FP_TO_FP16, MVT::f32, Expand);
381 // There's never any support for operations beyond MVT::f32.
382 setOperationAction(ISD::FP16_TO_FP, MVT::f64, Expand);
383 setOperationAction(ISD::FP16_TO_FP, MVT::f80, Expand);
384 setOperationAction(ISD::FP_TO_FP16, MVT::f64, Expand);
385 setOperationAction(ISD::FP_TO_FP16, MVT::f80, Expand);
387 setLoadExtAction(ISD::EXTLOAD, MVT::f32, MVT::f16, Expand);
388 setLoadExtAction(ISD::EXTLOAD, MVT::f64, MVT::f16, Expand);
389 setLoadExtAction(ISD::EXTLOAD, MVT::f80, MVT::f16, Expand);
390 setTruncStoreAction(MVT::f32, MVT::f16, Expand);
391 setTruncStoreAction(MVT::f64, MVT::f16, Expand);
392 setTruncStoreAction(MVT::f80, MVT::f16, Expand);
394 if (Subtarget->hasPOPCNT()) {
395 setOperationAction(ISD::CTPOP , MVT::i8 , Promote);
397 setOperationAction(ISD::CTPOP , MVT::i8 , Expand);
398 setOperationAction(ISD::CTPOP , MVT::i16 , Expand);
399 setOperationAction(ISD::CTPOP , MVT::i32 , Expand);
400 if (Subtarget->is64Bit())
401 setOperationAction(ISD::CTPOP , MVT::i64 , Expand);
404 setOperationAction(ISD::READCYCLECOUNTER , MVT::i64 , Custom);
406 if (!Subtarget->hasMOVBE())
407 setOperationAction(ISD::BSWAP , MVT::i16 , Expand);
409 // These should be promoted to a larger select which is supported.
410 setOperationAction(ISD::SELECT , MVT::i1 , Promote);
411 // X86 wants to expand cmov itself.
412 setOperationAction(ISD::SELECT , MVT::i8 , Custom);
413 setOperationAction(ISD::SELECT , MVT::i16 , Custom);
414 setOperationAction(ISD::SELECT , MVT::i32 , Custom);
415 setOperationAction(ISD::SELECT , MVT::f32 , Custom);
416 setOperationAction(ISD::SELECT , MVT::f64 , Custom);
417 setOperationAction(ISD::SELECT , MVT::f80 , Custom);
418 setOperationAction(ISD::SETCC , MVT::i8 , Custom);
419 setOperationAction(ISD::SETCC , MVT::i16 , Custom);
420 setOperationAction(ISD::SETCC , MVT::i32 , Custom);
421 setOperationAction(ISD::SETCC , MVT::f32 , Custom);
422 setOperationAction(ISD::SETCC , MVT::f64 , Custom);
423 setOperationAction(ISD::SETCC , MVT::f80 , Custom);
424 if (Subtarget->is64Bit()) {
425 setOperationAction(ISD::SELECT , MVT::i64 , Custom);
426 setOperationAction(ISD::SETCC , MVT::i64 , Custom);
428 setOperationAction(ISD::EH_RETURN , MVT::Other, Custom);
429 // NOTE: EH_SJLJ_SETJMP/_LONGJMP supported here is NOT intended to support
430 // SjLj exception handling but a light-weight setjmp/longjmp replacement to
431 // support continuation, user-level threading, and etc.. As a result, no
432 // other SjLj exception interfaces are implemented and please don't build
433 // your own exception handling based on them.
434 // LLVM/Clang supports zero-cost DWARF exception handling.
435 setOperationAction(ISD::EH_SJLJ_SETJMP, MVT::i32, Custom);
436 setOperationAction(ISD::EH_SJLJ_LONGJMP, MVT::Other, Custom);
439 setOperationAction(ISD::ConstantPool , MVT::i32 , Custom);
440 setOperationAction(ISD::JumpTable , MVT::i32 , Custom);
441 setOperationAction(ISD::GlobalAddress , MVT::i32 , Custom);
442 setOperationAction(ISD::GlobalTLSAddress, MVT::i32 , Custom);
443 if (Subtarget->is64Bit())
444 setOperationAction(ISD::GlobalTLSAddress, MVT::i64, Custom);
445 setOperationAction(ISD::ExternalSymbol , MVT::i32 , Custom);
446 setOperationAction(ISD::BlockAddress , MVT::i32 , Custom);
447 if (Subtarget->is64Bit()) {
448 setOperationAction(ISD::ConstantPool , MVT::i64 , Custom);
449 setOperationAction(ISD::JumpTable , MVT::i64 , Custom);
450 setOperationAction(ISD::GlobalAddress , MVT::i64 , Custom);
451 setOperationAction(ISD::ExternalSymbol, MVT::i64 , Custom);
452 setOperationAction(ISD::BlockAddress , MVT::i64 , Custom);
454 // 64-bit addm sub, shl, sra, srl (iff 32-bit x86)
455 setOperationAction(ISD::SHL_PARTS , MVT::i32 , Custom);
456 setOperationAction(ISD::SRA_PARTS , MVT::i32 , Custom);
457 setOperationAction(ISD::SRL_PARTS , MVT::i32 , Custom);
458 if (Subtarget->is64Bit()) {
459 setOperationAction(ISD::SHL_PARTS , MVT::i64 , Custom);
460 setOperationAction(ISD::SRA_PARTS , MVT::i64 , Custom);
461 setOperationAction(ISD::SRL_PARTS , MVT::i64 , Custom);
464 if (Subtarget->hasSSE1())
465 setOperationAction(ISD::PREFETCH , MVT::Other, Legal);
467 setOperationAction(ISD::ATOMIC_FENCE , MVT::Other, Custom);
469 // Expand certain atomics
470 for (auto VT : { MVT::i8, MVT::i16, MVT::i32, MVT::i64 }) {
471 setOperationAction(ISD::ATOMIC_CMP_SWAP_WITH_SUCCESS, VT, Custom);
472 setOperationAction(ISD::ATOMIC_LOAD_SUB, VT, Custom);
473 setOperationAction(ISD::ATOMIC_STORE, VT, Custom);
476 if (Subtarget->hasCmpxchg16b()) {
477 setOperationAction(ISD::ATOMIC_CMP_SWAP_WITH_SUCCESS, MVT::i128, Custom);
480 // FIXME - use subtarget debug flags
481 if (!Subtarget->isTargetDarwin() && !Subtarget->isTargetELF() &&
482 !Subtarget->isTargetCygMing() && !Subtarget->isTargetWin64()) {
483 setOperationAction(ISD::EH_LABEL, MVT::Other, Expand);
486 setOperationAction(ISD::FRAME_TO_ARGS_OFFSET, MVT::i32, Custom);
487 setOperationAction(ISD::FRAME_TO_ARGS_OFFSET, MVT::i64, Custom);
489 setOperationAction(ISD::INIT_TRAMPOLINE, MVT::Other, Custom);
490 setOperationAction(ISD::ADJUST_TRAMPOLINE, MVT::Other, Custom);
492 setOperationAction(ISD::TRAP, MVT::Other, Legal);
493 setOperationAction(ISD::DEBUGTRAP, MVT::Other, Legal);
495 // VASTART needs to be custom lowered to use the VarArgsFrameIndex
496 setOperationAction(ISD::VASTART , MVT::Other, Custom);
497 setOperationAction(ISD::VAEND , MVT::Other, Expand);
498 if (Subtarget->is64Bit()) {
499 setOperationAction(ISD::VAARG , MVT::Other, Custom);
500 setOperationAction(ISD::VACOPY , MVT::Other, Custom);
502 // TargetInfo::CharPtrBuiltinVaList
503 setOperationAction(ISD::VAARG , MVT::Other, Expand);
504 setOperationAction(ISD::VACOPY , MVT::Other, Expand);
507 setOperationAction(ISD::STACKSAVE, MVT::Other, Expand);
508 setOperationAction(ISD::STACKRESTORE, MVT::Other, Expand);
510 setOperationAction(ISD::DYNAMIC_STACKALLOC, PtrVT, Custom);
512 // GC_TRANSITION_START and GC_TRANSITION_END need custom lowering.
513 setOperationAction(ISD::GC_TRANSITION_START, MVT::Other, Custom);
514 setOperationAction(ISD::GC_TRANSITION_END, MVT::Other, Custom);
516 if (!Subtarget->useSoftFloat() && X86ScalarSSEf64) {
517 // f32 and f64 use SSE.
518 // Set up the FP register classes.
519 addRegisterClass(MVT::f32, &X86::FR32RegClass);
520 addRegisterClass(MVT::f64, &X86::FR64RegClass);
522 // Use ANDPD to simulate FABS.
523 setOperationAction(ISD::FABS , MVT::f64, Custom);
524 setOperationAction(ISD::FABS , MVT::f32, Custom);
526 // Use XORP to simulate FNEG.
527 setOperationAction(ISD::FNEG , MVT::f64, Custom);
528 setOperationAction(ISD::FNEG , MVT::f32, Custom);
530 // Use ANDPD and ORPD to simulate FCOPYSIGN.
531 setOperationAction(ISD::FCOPYSIGN, MVT::f64, Custom);
532 setOperationAction(ISD::FCOPYSIGN, MVT::f32, Custom);
534 // Lower this to FGETSIGNx86 plus an AND.
535 setOperationAction(ISD::FGETSIGN, MVT::i64, Custom);
536 setOperationAction(ISD::FGETSIGN, MVT::i32, Custom);
538 // We don't support sin/cos/fmod
539 setOperationAction(ISD::FSIN , MVT::f64, Expand);
540 setOperationAction(ISD::FCOS , MVT::f64, Expand);
541 setOperationAction(ISD::FSINCOS, MVT::f64, Expand);
542 setOperationAction(ISD::FSIN , MVT::f32, Expand);
543 setOperationAction(ISD::FCOS , MVT::f32, Expand);
544 setOperationAction(ISD::FSINCOS, MVT::f32, Expand);
546 // Expand FP immediates into loads from the stack, except for the special
548 addLegalFPImmediate(APFloat(+0.0)); // xorpd
549 addLegalFPImmediate(APFloat(+0.0f)); // xorps
550 } else if (!Subtarget->useSoftFloat() && X86ScalarSSEf32) {
551 // Use SSE for f32, x87 for f64.
552 // Set up the FP register classes.
553 addRegisterClass(MVT::f32, &X86::FR32RegClass);
554 addRegisterClass(MVT::f64, &X86::RFP64RegClass);
556 // Use ANDPS to simulate FABS.
557 setOperationAction(ISD::FABS , MVT::f32, Custom);
559 // Use XORP to simulate FNEG.
560 setOperationAction(ISD::FNEG , MVT::f32, Custom);
562 setOperationAction(ISD::UNDEF, MVT::f64, Expand);
564 // Use ANDPS and ORPS to simulate FCOPYSIGN.
565 setOperationAction(ISD::FCOPYSIGN, MVT::f64, Expand);
566 setOperationAction(ISD::FCOPYSIGN, MVT::f32, Custom);
568 // We don't support sin/cos/fmod
569 setOperationAction(ISD::FSIN , MVT::f32, Expand);
570 setOperationAction(ISD::FCOS , MVT::f32, Expand);
571 setOperationAction(ISD::FSINCOS, MVT::f32, Expand);
573 // Special cases we handle for FP constants.
574 addLegalFPImmediate(APFloat(+0.0f)); // xorps
575 addLegalFPImmediate(APFloat(+0.0)); // FLD0
576 addLegalFPImmediate(APFloat(+1.0)); // FLD1
577 addLegalFPImmediate(APFloat(-0.0)); // FLD0/FCHS
578 addLegalFPImmediate(APFloat(-1.0)); // FLD1/FCHS
580 if (!TM.Options.UnsafeFPMath) {
581 setOperationAction(ISD::FSIN , MVT::f64, Expand);
582 setOperationAction(ISD::FCOS , MVT::f64, Expand);
583 setOperationAction(ISD::FSINCOS, MVT::f64, Expand);
585 } else if (!Subtarget->useSoftFloat()) {
586 // f32 and f64 in x87.
587 // Set up the FP register classes.
588 addRegisterClass(MVT::f64, &X86::RFP64RegClass);
589 addRegisterClass(MVT::f32, &X86::RFP32RegClass);
591 setOperationAction(ISD::UNDEF, MVT::f64, Expand);
592 setOperationAction(ISD::UNDEF, MVT::f32, Expand);
593 setOperationAction(ISD::FCOPYSIGN, MVT::f64, Expand);
594 setOperationAction(ISD::FCOPYSIGN, MVT::f32, Expand);
596 if (!TM.Options.UnsafeFPMath) {
597 setOperationAction(ISD::FSIN , MVT::f64, Expand);
598 setOperationAction(ISD::FSIN , MVT::f32, Expand);
599 setOperationAction(ISD::FCOS , MVT::f64, Expand);
600 setOperationAction(ISD::FCOS , MVT::f32, Expand);
601 setOperationAction(ISD::FSINCOS, MVT::f64, Expand);
602 setOperationAction(ISD::FSINCOS, MVT::f32, Expand);
604 addLegalFPImmediate(APFloat(+0.0)); // FLD0
605 addLegalFPImmediate(APFloat(+1.0)); // FLD1
606 addLegalFPImmediate(APFloat(-0.0)); // FLD0/FCHS
607 addLegalFPImmediate(APFloat(-1.0)); // FLD1/FCHS
608 addLegalFPImmediate(APFloat(+0.0f)); // FLD0
609 addLegalFPImmediate(APFloat(+1.0f)); // FLD1
610 addLegalFPImmediate(APFloat(-0.0f)); // FLD0/FCHS
611 addLegalFPImmediate(APFloat(-1.0f)); // FLD1/FCHS
614 // We don't support FMA.
615 setOperationAction(ISD::FMA, MVT::f64, Expand);
616 setOperationAction(ISD::FMA, MVT::f32, Expand);
618 // Long double always uses X87.
619 if (!Subtarget->useSoftFloat()) {
620 addRegisterClass(MVT::f80, &X86::RFP80RegClass);
621 setOperationAction(ISD::UNDEF, MVT::f80, Expand);
622 setOperationAction(ISD::FCOPYSIGN, MVT::f80, Expand);
624 APFloat TmpFlt = APFloat::getZero(APFloat::x87DoubleExtended);
625 addLegalFPImmediate(TmpFlt); // FLD0
627 addLegalFPImmediate(TmpFlt); // FLD0/FCHS
630 APFloat TmpFlt2(+1.0);
631 TmpFlt2.convert(APFloat::x87DoubleExtended, APFloat::rmNearestTiesToEven,
633 addLegalFPImmediate(TmpFlt2); // FLD1
634 TmpFlt2.changeSign();
635 addLegalFPImmediate(TmpFlt2); // FLD1/FCHS
638 if (!TM.Options.UnsafeFPMath) {
639 setOperationAction(ISD::FSIN , MVT::f80, Expand);
640 setOperationAction(ISD::FCOS , MVT::f80, Expand);
641 setOperationAction(ISD::FSINCOS, MVT::f80, Expand);
644 setOperationAction(ISD::FFLOOR, MVT::f80, Expand);
645 setOperationAction(ISD::FCEIL, MVT::f80, Expand);
646 setOperationAction(ISD::FTRUNC, MVT::f80, Expand);
647 setOperationAction(ISD::FRINT, MVT::f80, Expand);
648 setOperationAction(ISD::FNEARBYINT, MVT::f80, Expand);
649 setOperationAction(ISD::FMA, MVT::f80, Expand);
652 // Always use a library call for pow.
653 setOperationAction(ISD::FPOW , MVT::f32 , Expand);
654 setOperationAction(ISD::FPOW , MVT::f64 , Expand);
655 setOperationAction(ISD::FPOW , MVT::f80 , Expand);
657 setOperationAction(ISD::FLOG, MVT::f80, Expand);
658 setOperationAction(ISD::FLOG2, MVT::f80, Expand);
659 setOperationAction(ISD::FLOG10, MVT::f80, Expand);
660 setOperationAction(ISD::FEXP, MVT::f80, Expand);
661 setOperationAction(ISD::FEXP2, MVT::f80, Expand);
662 setOperationAction(ISD::FMINNUM, MVT::f80, Expand);
663 setOperationAction(ISD::FMAXNUM, MVT::f80, Expand);
665 // First set operation action for all vector types to either promote
666 // (for widening) or expand (for scalarization). Then we will selectively
667 // turn on ones that can be effectively codegen'd.
668 for (MVT VT : MVT::vector_valuetypes()) {
669 setOperationAction(ISD::ADD , VT, Expand);
670 setOperationAction(ISD::SUB , VT, Expand);
671 setOperationAction(ISD::FADD, VT, Expand);
672 setOperationAction(ISD::FNEG, VT, Expand);
673 setOperationAction(ISD::FSUB, VT, Expand);
674 setOperationAction(ISD::MUL , VT, Expand);
675 setOperationAction(ISD::FMUL, VT, Expand);
676 setOperationAction(ISD::SDIV, VT, Expand);
677 setOperationAction(ISD::UDIV, VT, Expand);
678 setOperationAction(ISD::FDIV, VT, Expand);
679 setOperationAction(ISD::SREM, VT, Expand);
680 setOperationAction(ISD::UREM, VT, Expand);
681 setOperationAction(ISD::LOAD, VT, Expand);
682 setOperationAction(ISD::VECTOR_SHUFFLE, VT, Expand);
683 setOperationAction(ISD::EXTRACT_VECTOR_ELT, VT,Expand);
684 setOperationAction(ISD::INSERT_VECTOR_ELT, VT, Expand);
685 setOperationAction(ISD::EXTRACT_SUBVECTOR, VT,Expand);
686 setOperationAction(ISD::INSERT_SUBVECTOR, VT,Expand);
687 setOperationAction(ISD::FABS, VT, Expand);
688 setOperationAction(ISD::FSIN, VT, Expand);
689 setOperationAction(ISD::FSINCOS, VT, Expand);
690 setOperationAction(ISD::FCOS, VT, Expand);
691 setOperationAction(ISD::FSINCOS, VT, Expand);
692 setOperationAction(ISD::FREM, VT, Expand);
693 setOperationAction(ISD::FMA, VT, Expand);
694 setOperationAction(ISD::FPOWI, VT, Expand);
695 setOperationAction(ISD::FSQRT, VT, Expand);
696 setOperationAction(ISD::FCOPYSIGN, VT, Expand);
697 setOperationAction(ISD::FFLOOR, VT, Expand);
698 setOperationAction(ISD::FCEIL, VT, Expand);
699 setOperationAction(ISD::FTRUNC, VT, Expand);
700 setOperationAction(ISD::FRINT, VT, Expand);
701 setOperationAction(ISD::FNEARBYINT, VT, Expand);
702 setOperationAction(ISD::SMUL_LOHI, VT, Expand);
703 setOperationAction(ISD::MULHS, VT, Expand);
704 setOperationAction(ISD::UMUL_LOHI, VT, Expand);
705 setOperationAction(ISD::MULHU, VT, Expand);
706 setOperationAction(ISD::SDIVREM, VT, Expand);
707 setOperationAction(ISD::UDIVREM, VT, Expand);
708 setOperationAction(ISD::FPOW, VT, Expand);
709 setOperationAction(ISD::CTPOP, VT, Expand);
710 setOperationAction(ISD::CTTZ, VT, Expand);
711 setOperationAction(ISD::CTTZ_ZERO_UNDEF, VT, Expand);
712 setOperationAction(ISD::CTLZ, VT, Expand);
713 setOperationAction(ISD::CTLZ_ZERO_UNDEF, VT, Expand);
714 setOperationAction(ISD::SHL, VT, Expand);
715 setOperationAction(ISD::SRA, VT, Expand);
716 setOperationAction(ISD::SRL, VT, Expand);
717 setOperationAction(ISD::ROTL, VT, Expand);
718 setOperationAction(ISD::ROTR, VT, Expand);
719 setOperationAction(ISD::BSWAP, VT, Expand);
720 setOperationAction(ISD::SETCC, VT, Expand);
721 setOperationAction(ISD::FLOG, VT, Expand);
722 setOperationAction(ISD::FLOG2, VT, Expand);
723 setOperationAction(ISD::FLOG10, VT, Expand);
724 setOperationAction(ISD::FEXP, VT, Expand);
725 setOperationAction(ISD::FEXP2, VT, Expand);
726 setOperationAction(ISD::FP_TO_UINT, VT, Expand);
727 setOperationAction(ISD::FP_TO_SINT, VT, Expand);
728 setOperationAction(ISD::UINT_TO_FP, VT, Expand);
729 setOperationAction(ISD::SINT_TO_FP, VT, Expand);
730 setOperationAction(ISD::SIGN_EXTEND_INREG, VT,Expand);
731 setOperationAction(ISD::TRUNCATE, VT, Expand);
732 setOperationAction(ISD::SIGN_EXTEND, VT, Expand);
733 setOperationAction(ISD::ZERO_EXTEND, VT, Expand);
734 setOperationAction(ISD::ANY_EXTEND, VT, Expand);
735 setOperationAction(ISD::VSELECT, VT, Expand);
736 setOperationAction(ISD::SELECT_CC, VT, Expand);
737 for (MVT InnerVT : MVT::vector_valuetypes()) {
738 setTruncStoreAction(InnerVT, VT, Expand);
740 setLoadExtAction(ISD::SEXTLOAD, InnerVT, VT, Expand);
741 setLoadExtAction(ISD::ZEXTLOAD, InnerVT, VT, Expand);
743 // N.b. ISD::EXTLOAD legality is basically ignored except for i1-like
744 // types, we have to deal with them whether we ask for Expansion or not.
745 // Setting Expand causes its own optimisation problems though, so leave
747 if (VT.getVectorElementType() == MVT::i1)
748 setLoadExtAction(ISD::EXTLOAD, InnerVT, VT, Expand);
750 // EXTLOAD for MVT::f16 vectors is not legal because f16 vectors are
751 // split/scalarized right now.
752 if (VT.getVectorElementType() == MVT::f16)
753 setLoadExtAction(ISD::EXTLOAD, InnerVT, VT, Expand);
757 // FIXME: In order to prevent SSE instructions being expanded to MMX ones
758 // with -msoft-float, disable use of MMX as well.
759 if (!Subtarget->useSoftFloat() && Subtarget->hasMMX()) {
760 addRegisterClass(MVT::x86mmx, &X86::VR64RegClass);
761 // No operations on x86mmx supported, everything uses intrinsics.
764 // MMX-sized vectors (other than x86mmx) are expected to be expanded
765 // into smaller operations.
766 for (MVT MMXTy : {MVT::v8i8, MVT::v4i16, MVT::v2i32, MVT::v1i64}) {
767 setOperationAction(ISD::MULHS, MMXTy, Expand);
768 setOperationAction(ISD::AND, MMXTy, Expand);
769 setOperationAction(ISD::OR, MMXTy, Expand);
770 setOperationAction(ISD::XOR, MMXTy, Expand);
771 setOperationAction(ISD::SCALAR_TO_VECTOR, MMXTy, Expand);
772 setOperationAction(ISD::SELECT, MMXTy, Expand);
773 setOperationAction(ISD::BITCAST, MMXTy, Expand);
775 setOperationAction(ISD::INSERT_VECTOR_ELT, MVT::v1i64, Expand);
777 if (!Subtarget->useSoftFloat() && Subtarget->hasSSE1()) {
778 addRegisterClass(MVT::v4f32, &X86::VR128RegClass);
780 setOperationAction(ISD::FADD, MVT::v4f32, Legal);
781 setOperationAction(ISD::FSUB, MVT::v4f32, Legal);
782 setOperationAction(ISD::FMUL, MVT::v4f32, Legal);
783 setOperationAction(ISD::FDIV, MVT::v4f32, Legal);
784 setOperationAction(ISD::FSQRT, MVT::v4f32, Legal);
785 setOperationAction(ISD::FNEG, MVT::v4f32, Custom);
786 setOperationAction(ISD::FABS, MVT::v4f32, Custom);
787 setOperationAction(ISD::LOAD, MVT::v4f32, Legal);
788 setOperationAction(ISD::BUILD_VECTOR, MVT::v4f32, Custom);
789 setOperationAction(ISD::VECTOR_SHUFFLE, MVT::v4f32, Custom);
790 setOperationAction(ISD::VSELECT, MVT::v4f32, Custom);
791 setOperationAction(ISD::EXTRACT_VECTOR_ELT, MVT::v4f32, Custom);
792 setOperationAction(ISD::SELECT, MVT::v4f32, Custom);
793 setOperationAction(ISD::UINT_TO_FP, MVT::v4i32, Custom);
796 if (!Subtarget->useSoftFloat() && Subtarget->hasSSE2()) {
797 addRegisterClass(MVT::v2f64, &X86::VR128RegClass);
799 // FIXME: Unfortunately, -soft-float and -no-implicit-float mean XMM
800 // registers cannot be used even for integer operations.
801 addRegisterClass(MVT::v16i8, &X86::VR128RegClass);
802 addRegisterClass(MVT::v8i16, &X86::VR128RegClass);
803 addRegisterClass(MVT::v4i32, &X86::VR128RegClass);
804 addRegisterClass(MVT::v2i64, &X86::VR128RegClass);
806 setOperationAction(ISD::ADD, MVT::v16i8, Legal);
807 setOperationAction(ISD::ADD, MVT::v8i16, Legal);
808 setOperationAction(ISD::ADD, MVT::v4i32, Legal);
809 setOperationAction(ISD::ADD, MVT::v2i64, Legal);
810 setOperationAction(ISD::MUL, MVT::v16i8, Custom);
811 setOperationAction(ISD::MUL, MVT::v4i32, Custom);
812 setOperationAction(ISD::MUL, MVT::v2i64, Custom);
813 setOperationAction(ISD::UMUL_LOHI, MVT::v4i32, Custom);
814 setOperationAction(ISD::SMUL_LOHI, MVT::v4i32, Custom);
815 setOperationAction(ISD::MULHU, MVT::v8i16, Legal);
816 setOperationAction(ISD::MULHS, MVT::v8i16, Legal);
817 setOperationAction(ISD::SUB, MVT::v16i8, Legal);
818 setOperationAction(ISD::SUB, MVT::v8i16, Legal);
819 setOperationAction(ISD::SUB, MVT::v4i32, Legal);
820 setOperationAction(ISD::SUB, MVT::v2i64, Legal);
821 setOperationAction(ISD::MUL, MVT::v8i16, Legal);
822 setOperationAction(ISD::FADD, MVT::v2f64, Legal);
823 setOperationAction(ISD::FSUB, MVT::v2f64, Legal);
824 setOperationAction(ISD::FMUL, MVT::v2f64, Legal);
825 setOperationAction(ISD::FDIV, MVT::v2f64, Legal);
826 setOperationAction(ISD::FSQRT, MVT::v2f64, Legal);
827 setOperationAction(ISD::FNEG, MVT::v2f64, Custom);
828 setOperationAction(ISD::FABS, MVT::v2f64, Custom);
830 setOperationAction(ISD::SMAX, MVT::v8i16, Legal);
831 setOperationAction(ISD::UMAX, MVT::v16i8, Legal);
832 setOperationAction(ISD::SMIN, MVT::v8i16, Legal);
833 setOperationAction(ISD::UMIN, MVT::v16i8, Legal);
835 setOperationAction(ISD::SETCC, MVT::v2i64, Custom);
836 setOperationAction(ISD::SETCC, MVT::v16i8, Custom);
837 setOperationAction(ISD::SETCC, MVT::v8i16, Custom);
838 setOperationAction(ISD::SETCC, MVT::v4i32, Custom);
840 setOperationAction(ISD::SCALAR_TO_VECTOR, MVT::v16i8, Custom);
841 setOperationAction(ISD::SCALAR_TO_VECTOR, MVT::v8i16, Custom);
842 setOperationAction(ISD::INSERT_VECTOR_ELT, MVT::v8i16, Custom);
843 setOperationAction(ISD::INSERT_VECTOR_ELT, MVT::v4i32, Custom);
844 setOperationAction(ISD::INSERT_VECTOR_ELT, MVT::v4f32, Custom);
846 setOperationAction(ISD::CTPOP, MVT::v16i8, Custom);
847 setOperationAction(ISD::CTPOP, MVT::v8i16, Custom);
848 setOperationAction(ISD::CTPOP, MVT::v4i32, Custom);
849 setOperationAction(ISD::CTPOP, MVT::v2i64, Custom);
851 setOperationAction(ISD::CTTZ, MVT::v16i8, Custom);
852 setOperationAction(ISD::CTTZ, MVT::v8i16, Custom);
853 setOperationAction(ISD::CTTZ, MVT::v4i32, Custom);
854 // ISD::CTTZ v2i64 - scalarization is faster.
855 setOperationAction(ISD::CTTZ_ZERO_UNDEF, MVT::v16i8, Custom);
856 setOperationAction(ISD::CTTZ_ZERO_UNDEF, MVT::v8i16, Custom);
857 setOperationAction(ISD::CTTZ_ZERO_UNDEF, MVT::v4i32, Custom);
858 // ISD::CTTZ_ZERO_UNDEF v2i64 - scalarization is faster.
860 // Custom lower build_vector, vector_shuffle, and extract_vector_elt.
861 for (auto VT : { MVT::v16i8, MVT::v8i16, MVT::v4i32 }) {
862 setOperationAction(ISD::BUILD_VECTOR, VT, Custom);
863 setOperationAction(ISD::VECTOR_SHUFFLE, VT, Custom);
864 setOperationAction(ISD::VSELECT, VT, Custom);
865 setOperationAction(ISD::EXTRACT_VECTOR_ELT, VT, Custom);
868 // We support custom legalizing of sext and anyext loads for specific
869 // memory vector types which we can load as a scalar (or sequence of
870 // scalars) and extend in-register to a legal 128-bit vector type. For sext
871 // loads these must work with a single scalar load.
872 for (MVT VT : MVT::integer_vector_valuetypes()) {
873 setLoadExtAction(ISD::SEXTLOAD, VT, MVT::v4i8, Custom);
874 setLoadExtAction(ISD::SEXTLOAD, VT, MVT::v4i16, Custom);
875 setLoadExtAction(ISD::SEXTLOAD, VT, MVT::v8i8, Custom);
876 setLoadExtAction(ISD::EXTLOAD, VT, MVT::v2i8, Custom);
877 setLoadExtAction(ISD::EXTLOAD, VT, MVT::v2i16, Custom);
878 setLoadExtAction(ISD::EXTLOAD, VT, MVT::v2i32, Custom);
879 setLoadExtAction(ISD::EXTLOAD, VT, MVT::v4i8, Custom);
880 setLoadExtAction(ISD::EXTLOAD, VT, MVT::v4i16, Custom);
881 setLoadExtAction(ISD::EXTLOAD, VT, MVT::v8i8, Custom);
884 setOperationAction(ISD::BUILD_VECTOR, MVT::v2f64, Custom);
885 setOperationAction(ISD::BUILD_VECTOR, MVT::v2i64, Custom);
886 setOperationAction(ISD::VECTOR_SHUFFLE, MVT::v2f64, Custom);
887 setOperationAction(ISD::VECTOR_SHUFFLE, MVT::v2i64, Custom);
888 setOperationAction(ISD::VSELECT, MVT::v2f64, Custom);
889 setOperationAction(ISD::VSELECT, MVT::v2i64, Custom);
890 setOperationAction(ISD::INSERT_VECTOR_ELT, MVT::v2f64, Custom);
891 setOperationAction(ISD::EXTRACT_VECTOR_ELT, MVT::v2f64, Custom);
893 if (Subtarget->is64Bit()) {
894 setOperationAction(ISD::INSERT_VECTOR_ELT, MVT::v2i64, Custom);
895 setOperationAction(ISD::EXTRACT_VECTOR_ELT, MVT::v2i64, Custom);
898 // Promote v16i8, v8i16, v4i32 load, select, and, or, xor to v2i64.
899 for (auto VT : { MVT::v16i8, MVT::v8i16, MVT::v4i32 }) {
900 setOperationAction(ISD::AND, VT, Promote);
901 AddPromotedToType (ISD::AND, VT, MVT::v2i64);
902 setOperationAction(ISD::OR, VT, Promote);
903 AddPromotedToType (ISD::OR, VT, MVT::v2i64);
904 setOperationAction(ISD::XOR, VT, Promote);
905 AddPromotedToType (ISD::XOR, VT, MVT::v2i64);
906 setOperationAction(ISD::LOAD, VT, Promote);
907 AddPromotedToType (ISD::LOAD, VT, MVT::v2i64);
908 setOperationAction(ISD::SELECT, VT, Promote);
909 AddPromotedToType (ISD::SELECT, VT, MVT::v2i64);
912 // Custom lower v2i64 and v2f64 selects.
913 setOperationAction(ISD::LOAD, MVT::v2f64, Legal);
914 setOperationAction(ISD::LOAD, MVT::v2i64, Legal);
915 setOperationAction(ISD::SELECT, MVT::v2f64, Custom);
916 setOperationAction(ISD::SELECT, MVT::v2i64, Custom);
918 setOperationAction(ISD::FP_TO_SINT, MVT::v4i32, Legal);
919 setOperationAction(ISD::SINT_TO_FP, MVT::v4i32, Legal);
921 setOperationAction(ISD::SINT_TO_FP, MVT::v2i32, Custom);
923 setOperationAction(ISD::UINT_TO_FP, MVT::v4i8, Custom);
924 setOperationAction(ISD::UINT_TO_FP, MVT::v4i16, Custom);
925 // As there is no 64-bit GPR available, we need build a special custom
926 // sequence to convert from v2i32 to v2f32.
927 if (!Subtarget->is64Bit())
928 setOperationAction(ISD::UINT_TO_FP, MVT::v2f32, Custom);
930 setOperationAction(ISD::FP_EXTEND, MVT::v2f32, Custom);
931 setOperationAction(ISD::FP_ROUND, MVT::v2f32, Custom);
933 for (MVT VT : MVT::fp_vector_valuetypes())
934 setLoadExtAction(ISD::EXTLOAD, VT, MVT::v2f32, Legal);
936 setOperationAction(ISD::BITCAST, MVT::v2i32, Custom);
937 setOperationAction(ISD::BITCAST, MVT::v4i16, Custom);
938 setOperationAction(ISD::BITCAST, MVT::v8i8, Custom);
941 if (!Subtarget->useSoftFloat() && Subtarget->hasSSE41()) {
942 for (MVT RoundedTy : {MVT::f32, MVT::f64, MVT::v4f32, MVT::v2f64}) {
943 setOperationAction(ISD::FFLOOR, RoundedTy, Legal);
944 setOperationAction(ISD::FCEIL, RoundedTy, Legal);
945 setOperationAction(ISD::FTRUNC, RoundedTy, Legal);
946 setOperationAction(ISD::FRINT, RoundedTy, Legal);
947 setOperationAction(ISD::FNEARBYINT, RoundedTy, Legal);
950 setOperationAction(ISD::SMAX, MVT::v16i8, Legal);
951 setOperationAction(ISD::SMAX, MVT::v4i32, Legal);
952 setOperationAction(ISD::UMAX, MVT::v8i16, Legal);
953 setOperationAction(ISD::UMAX, MVT::v4i32, Legal);
954 setOperationAction(ISD::SMIN, MVT::v16i8, Legal);
955 setOperationAction(ISD::SMIN, MVT::v4i32, Legal);
956 setOperationAction(ISD::UMIN, MVT::v8i16, Legal);
957 setOperationAction(ISD::UMIN, MVT::v4i32, Legal);
959 // FIXME: Do we need to handle scalar-to-vector here?
960 setOperationAction(ISD::MUL, MVT::v4i32, Legal);
962 // We directly match byte blends in the backend as they match the VSELECT
964 setOperationAction(ISD::VSELECT, MVT::v16i8, Legal);
966 // SSE41 brings specific instructions for doing vector sign extend even in
967 // cases where we don't have SRA.
968 for (MVT VT : MVT::integer_vector_valuetypes()) {
969 setLoadExtAction(ISD::SEXTLOAD, VT, MVT::v2i8, Custom);
970 setLoadExtAction(ISD::SEXTLOAD, VT, MVT::v2i16, Custom);
971 setLoadExtAction(ISD::SEXTLOAD, VT, MVT::v2i32, Custom);
974 // SSE41 also has vector sign/zero extending loads, PMOV[SZ]X
975 setLoadExtAction(ISD::SEXTLOAD, MVT::v8i16, MVT::v8i8, Legal);
976 setLoadExtAction(ISD::SEXTLOAD, MVT::v4i32, MVT::v4i8, Legal);
977 setLoadExtAction(ISD::SEXTLOAD, MVT::v2i64, MVT::v2i8, Legal);
978 setLoadExtAction(ISD::SEXTLOAD, MVT::v4i32, MVT::v4i16, Legal);
979 setLoadExtAction(ISD::SEXTLOAD, MVT::v2i64, MVT::v2i16, Legal);
980 setLoadExtAction(ISD::SEXTLOAD, MVT::v2i64, MVT::v2i32, Legal);
982 setLoadExtAction(ISD::ZEXTLOAD, MVT::v8i16, MVT::v8i8, Legal);
983 setLoadExtAction(ISD::ZEXTLOAD, MVT::v4i32, MVT::v4i8, Legal);
984 setLoadExtAction(ISD::ZEXTLOAD, MVT::v2i64, MVT::v2i8, Legal);
985 setLoadExtAction(ISD::ZEXTLOAD, MVT::v4i32, MVT::v4i16, Legal);
986 setLoadExtAction(ISD::ZEXTLOAD, MVT::v2i64, MVT::v2i16, Legal);
987 setLoadExtAction(ISD::ZEXTLOAD, MVT::v2i64, MVT::v2i32, Legal);
989 // i8 and i16 vectors are custom because the source register and source
990 // source memory operand types are not the same width. f32 vectors are
991 // custom since the immediate controlling the insert encodes additional
993 setOperationAction(ISD::INSERT_VECTOR_ELT, MVT::v16i8, Custom);
994 setOperationAction(ISD::INSERT_VECTOR_ELT, MVT::v8i16, Custom);
995 setOperationAction(ISD::INSERT_VECTOR_ELT, MVT::v4i32, Custom);
996 setOperationAction(ISD::INSERT_VECTOR_ELT, MVT::v4f32, Custom);
998 setOperationAction(ISD::EXTRACT_VECTOR_ELT, MVT::v16i8, Custom);
999 setOperationAction(ISD::EXTRACT_VECTOR_ELT, MVT::v8i16, Custom);
1000 setOperationAction(ISD::EXTRACT_VECTOR_ELT, MVT::v4i32, Custom);
1001 setOperationAction(ISD::EXTRACT_VECTOR_ELT, MVT::v4f32, Custom);
1003 // FIXME: these should be Legal, but that's only for the case where
1004 // the index is constant. For now custom expand to deal with that.
1005 if (Subtarget->is64Bit()) {
1006 setOperationAction(ISD::INSERT_VECTOR_ELT, MVT::v2i64, Custom);
1007 setOperationAction(ISD::EXTRACT_VECTOR_ELT, MVT::v2i64, Custom);
1011 if (Subtarget->hasSSE2()) {
1012 setOperationAction(ISD::SIGN_EXTEND_VECTOR_INREG, MVT::v2i64, Custom);
1013 setOperationAction(ISD::SIGN_EXTEND_VECTOR_INREG, MVT::v4i32, Custom);
1014 setOperationAction(ISD::SIGN_EXTEND_VECTOR_INREG, MVT::v8i16, Custom);
1016 setOperationAction(ISD::SRL, MVT::v8i16, Custom);
1017 setOperationAction(ISD::SRL, MVT::v16i8, Custom);
1019 setOperationAction(ISD::SHL, MVT::v8i16, Custom);
1020 setOperationAction(ISD::SHL, MVT::v16i8, Custom);
1022 setOperationAction(ISD::SRA, MVT::v8i16, Custom);
1023 setOperationAction(ISD::SRA, MVT::v16i8, Custom);
1025 // In the customized shift lowering, the legal cases in AVX2 will be
1027 setOperationAction(ISD::SRL, MVT::v2i64, Custom);
1028 setOperationAction(ISD::SRL, MVT::v4i32, Custom);
1030 setOperationAction(ISD::SHL, MVT::v2i64, Custom);
1031 setOperationAction(ISD::SHL, MVT::v4i32, Custom);
1033 setOperationAction(ISD::SRA, MVT::v2i64, Custom);
1034 setOperationAction(ISD::SRA, MVT::v4i32, Custom);
1037 if (Subtarget->hasXOP()) {
1038 setOperationAction(ISD::ROTL, MVT::v16i8, Custom);
1039 setOperationAction(ISD::ROTL, MVT::v8i16, Custom);
1040 setOperationAction(ISD::ROTL, MVT::v4i32, Custom);
1041 setOperationAction(ISD::ROTL, MVT::v2i64, Custom);
1042 setOperationAction(ISD::ROTL, MVT::v32i8, Custom);
1043 setOperationAction(ISD::ROTL, MVT::v16i16, Custom);
1044 setOperationAction(ISD::ROTL, MVT::v8i32, Custom);
1045 setOperationAction(ISD::ROTL, MVT::v4i64, Custom);
1048 if (!Subtarget->useSoftFloat() && Subtarget->hasFp256()) {
1049 addRegisterClass(MVT::v32i8, &X86::VR256RegClass);
1050 addRegisterClass(MVT::v16i16, &X86::VR256RegClass);
1051 addRegisterClass(MVT::v8i32, &X86::VR256RegClass);
1052 addRegisterClass(MVT::v8f32, &X86::VR256RegClass);
1053 addRegisterClass(MVT::v4i64, &X86::VR256RegClass);
1054 addRegisterClass(MVT::v4f64, &X86::VR256RegClass);
1056 setOperationAction(ISD::LOAD, MVT::v8f32, Legal);
1057 setOperationAction(ISD::LOAD, MVT::v4f64, Legal);
1058 setOperationAction(ISD::LOAD, MVT::v4i64, Legal);
1060 setOperationAction(ISD::FADD, MVT::v8f32, Legal);
1061 setOperationAction(ISD::FSUB, MVT::v8f32, Legal);
1062 setOperationAction(ISD::FMUL, MVT::v8f32, Legal);
1063 setOperationAction(ISD::FDIV, MVT::v8f32, Legal);
1064 setOperationAction(ISD::FSQRT, MVT::v8f32, Legal);
1065 setOperationAction(ISD::FFLOOR, MVT::v8f32, Legal);
1066 setOperationAction(ISD::FCEIL, MVT::v8f32, Legal);
1067 setOperationAction(ISD::FTRUNC, MVT::v8f32, Legal);
1068 setOperationAction(ISD::FRINT, MVT::v8f32, Legal);
1069 setOperationAction(ISD::FNEARBYINT, MVT::v8f32, Legal);
1070 setOperationAction(ISD::FNEG, MVT::v8f32, Custom);
1071 setOperationAction(ISD::FABS, MVT::v8f32, Custom);
1073 setOperationAction(ISD::FADD, MVT::v4f64, Legal);
1074 setOperationAction(ISD::FSUB, MVT::v4f64, Legal);
1075 setOperationAction(ISD::FMUL, MVT::v4f64, Legal);
1076 setOperationAction(ISD::FDIV, MVT::v4f64, Legal);
1077 setOperationAction(ISD::FSQRT, MVT::v4f64, Legal);
1078 setOperationAction(ISD::FFLOOR, MVT::v4f64, Legal);
1079 setOperationAction(ISD::FCEIL, MVT::v4f64, Legal);
1080 setOperationAction(ISD::FTRUNC, MVT::v4f64, Legal);
1081 setOperationAction(ISD::FRINT, MVT::v4f64, Legal);
1082 setOperationAction(ISD::FNEARBYINT, MVT::v4f64, Legal);
1083 setOperationAction(ISD::FNEG, MVT::v4f64, Custom);
1084 setOperationAction(ISD::FABS, MVT::v4f64, Custom);
1086 // (fp_to_int:v8i16 (v8f32 ..)) requires the result type to be promoted
1087 // even though v8i16 is a legal type.
1088 setOperationAction(ISD::FP_TO_SINT, MVT::v8i16, Promote);
1089 setOperationAction(ISD::FP_TO_UINT, MVT::v8i16, Promote);
1090 setOperationAction(ISD::FP_TO_SINT, MVT::v8i32, Legal);
1092 setOperationAction(ISD::SINT_TO_FP, MVT::v8i16, Promote);
1093 setOperationAction(ISD::SINT_TO_FP, MVT::v8i32, Legal);
1094 setOperationAction(ISD::FP_ROUND, MVT::v4f32, Legal);
1096 setOperationAction(ISD::UINT_TO_FP, MVT::v8i8, Custom);
1097 setOperationAction(ISD::UINT_TO_FP, MVT::v8i16, Custom);
1099 for (MVT VT : MVT::fp_vector_valuetypes())
1100 setLoadExtAction(ISD::EXTLOAD, VT, MVT::v4f32, Legal);
1102 setOperationAction(ISD::SRL, MVT::v16i16, Custom);
1103 setOperationAction(ISD::SRL, MVT::v32i8, Custom);
1105 setOperationAction(ISD::SHL, MVT::v16i16, Custom);
1106 setOperationAction(ISD::SHL, MVT::v32i8, Custom);
1108 setOperationAction(ISD::SRA, MVT::v16i16, Custom);
1109 setOperationAction(ISD::SRA, MVT::v32i8, Custom);
1111 setOperationAction(ISD::SETCC, MVT::v32i8, Custom);
1112 setOperationAction(ISD::SETCC, MVT::v16i16, Custom);
1113 setOperationAction(ISD::SETCC, MVT::v8i32, Custom);
1114 setOperationAction(ISD::SETCC, MVT::v4i64, Custom);
1116 setOperationAction(ISD::SELECT, MVT::v4f64, Custom);
1117 setOperationAction(ISD::SELECT, MVT::v4i64, Custom);
1118 setOperationAction(ISD::SELECT, MVT::v8f32, Custom);
1120 setOperationAction(ISD::SIGN_EXTEND, MVT::v4i64, Custom);
1121 setOperationAction(ISD::SIGN_EXTEND, MVT::v8i32, Custom);
1122 setOperationAction(ISD::SIGN_EXTEND, MVT::v16i16, Custom);
1123 setOperationAction(ISD::ZERO_EXTEND, MVT::v4i64, Custom);
1124 setOperationAction(ISD::ZERO_EXTEND, MVT::v8i32, Custom);
1125 setOperationAction(ISD::ZERO_EXTEND, MVT::v16i16, Custom);
1126 setOperationAction(ISD::ANY_EXTEND, MVT::v4i64, Custom);
1127 setOperationAction(ISD::ANY_EXTEND, MVT::v8i32, Custom);
1128 setOperationAction(ISD::ANY_EXTEND, MVT::v16i16, Custom);
1129 setOperationAction(ISD::TRUNCATE, MVT::v16i8, Custom);
1130 setOperationAction(ISD::TRUNCATE, MVT::v8i16, Custom);
1131 setOperationAction(ISD::TRUNCATE, MVT::v4i32, Custom);
1133 setOperationAction(ISD::CTPOP, MVT::v32i8, Custom);
1134 setOperationAction(ISD::CTPOP, MVT::v16i16, Custom);
1135 setOperationAction(ISD::CTPOP, MVT::v8i32, Custom);
1136 setOperationAction(ISD::CTPOP, MVT::v4i64, Custom);
1138 setOperationAction(ISD::CTTZ, MVT::v32i8, Custom);
1139 setOperationAction(ISD::CTTZ, MVT::v16i16, Custom);
1140 setOperationAction(ISD::CTTZ, MVT::v8i32, Custom);
1141 setOperationAction(ISD::CTTZ, MVT::v4i64, Custom);
1142 setOperationAction(ISD::CTTZ_ZERO_UNDEF, MVT::v32i8, Custom);
1143 setOperationAction(ISD::CTTZ_ZERO_UNDEF, MVT::v16i16, Custom);
1144 setOperationAction(ISD::CTTZ_ZERO_UNDEF, MVT::v8i32, Custom);
1145 setOperationAction(ISD::CTTZ_ZERO_UNDEF, MVT::v4i64, Custom);
1147 if (Subtarget->hasFMA() || Subtarget->hasFMA4() || Subtarget->hasAVX512()) {
1148 setOperationAction(ISD::FMA, MVT::v8f32, Legal);
1149 setOperationAction(ISD::FMA, MVT::v4f64, Legal);
1150 setOperationAction(ISD::FMA, MVT::v4f32, Legal);
1151 setOperationAction(ISD::FMA, MVT::v2f64, Legal);
1152 setOperationAction(ISD::FMA, MVT::f32, Legal);
1153 setOperationAction(ISD::FMA, MVT::f64, Legal);
1156 if (Subtarget->hasInt256()) {
1157 setOperationAction(ISD::ADD, MVT::v4i64, Legal);
1158 setOperationAction(ISD::ADD, MVT::v8i32, Legal);
1159 setOperationAction(ISD::ADD, MVT::v16i16, Legal);
1160 setOperationAction(ISD::ADD, MVT::v32i8, Legal);
1162 setOperationAction(ISD::SUB, MVT::v4i64, Legal);
1163 setOperationAction(ISD::SUB, MVT::v8i32, Legal);
1164 setOperationAction(ISD::SUB, MVT::v16i16, Legal);
1165 setOperationAction(ISD::SUB, MVT::v32i8, Legal);
1167 setOperationAction(ISD::MUL, MVT::v4i64, Custom);
1168 setOperationAction(ISD::MUL, MVT::v8i32, Legal);
1169 setOperationAction(ISD::MUL, MVT::v16i16, Legal);
1170 setOperationAction(ISD::MUL, MVT::v32i8, Custom);
1172 setOperationAction(ISD::UMUL_LOHI, MVT::v8i32, Custom);
1173 setOperationAction(ISD::SMUL_LOHI, MVT::v8i32, Custom);
1174 setOperationAction(ISD::MULHU, MVT::v16i16, Legal);
1175 setOperationAction(ISD::MULHS, MVT::v16i16, Legal);
1177 setOperationAction(ISD::SMAX, MVT::v32i8, Legal);
1178 setOperationAction(ISD::SMAX, MVT::v16i16, Legal);
1179 setOperationAction(ISD::SMAX, MVT::v8i32, Legal);
1180 setOperationAction(ISD::UMAX, MVT::v32i8, Legal);
1181 setOperationAction(ISD::UMAX, MVT::v16i16, Legal);
1182 setOperationAction(ISD::UMAX, MVT::v8i32, Legal);
1183 setOperationAction(ISD::SMIN, MVT::v32i8, Legal);
1184 setOperationAction(ISD::SMIN, MVT::v16i16, Legal);
1185 setOperationAction(ISD::SMIN, MVT::v8i32, Legal);
1186 setOperationAction(ISD::UMIN, MVT::v32i8, Legal);
1187 setOperationAction(ISD::UMIN, MVT::v16i16, Legal);
1188 setOperationAction(ISD::UMIN, MVT::v8i32, Legal);
1190 // The custom lowering for UINT_TO_FP for v8i32 becomes interesting
1191 // when we have a 256bit-wide blend with immediate.
1192 setOperationAction(ISD::UINT_TO_FP, MVT::v8i32, Custom);
1194 // AVX2 also has wider vector sign/zero extending loads, VPMOV[SZ]X
1195 setLoadExtAction(ISD::SEXTLOAD, MVT::v16i16, MVT::v16i8, Legal);
1196 setLoadExtAction(ISD::SEXTLOAD, MVT::v8i32, MVT::v8i8, Legal);
1197 setLoadExtAction(ISD::SEXTLOAD, MVT::v4i64, MVT::v4i8, Legal);
1198 setLoadExtAction(ISD::SEXTLOAD, MVT::v8i32, MVT::v8i16, Legal);
1199 setLoadExtAction(ISD::SEXTLOAD, MVT::v4i64, MVT::v4i16, Legal);
1200 setLoadExtAction(ISD::SEXTLOAD, MVT::v4i64, MVT::v4i32, Legal);
1202 setLoadExtAction(ISD::ZEXTLOAD, MVT::v16i16, MVT::v16i8, Legal);
1203 setLoadExtAction(ISD::ZEXTLOAD, MVT::v8i32, MVT::v8i8, Legal);
1204 setLoadExtAction(ISD::ZEXTLOAD, MVT::v4i64, MVT::v4i8, Legal);
1205 setLoadExtAction(ISD::ZEXTLOAD, MVT::v8i32, MVT::v8i16, Legal);
1206 setLoadExtAction(ISD::ZEXTLOAD, MVT::v4i64, MVT::v4i16, Legal);
1207 setLoadExtAction(ISD::ZEXTLOAD, MVT::v4i64, MVT::v4i32, Legal);
1209 setOperationAction(ISD::ADD, MVT::v4i64, Custom);
1210 setOperationAction(ISD::ADD, MVT::v8i32, Custom);
1211 setOperationAction(ISD::ADD, MVT::v16i16, Custom);
1212 setOperationAction(ISD::ADD, MVT::v32i8, Custom);
1214 setOperationAction(ISD::SUB, MVT::v4i64, Custom);
1215 setOperationAction(ISD::SUB, MVT::v8i32, Custom);
1216 setOperationAction(ISD::SUB, MVT::v16i16, Custom);
1217 setOperationAction(ISD::SUB, MVT::v32i8, Custom);
1219 setOperationAction(ISD::MUL, MVT::v4i64, Custom);
1220 setOperationAction(ISD::MUL, MVT::v8i32, Custom);
1221 setOperationAction(ISD::MUL, MVT::v16i16, Custom);
1222 setOperationAction(ISD::MUL, MVT::v32i8, Custom);
1224 setOperationAction(ISD::SMAX, MVT::v32i8, Custom);
1225 setOperationAction(ISD::SMAX, MVT::v16i16, Custom);
1226 setOperationAction(ISD::SMAX, MVT::v8i32, Custom);
1227 setOperationAction(ISD::UMAX, MVT::v32i8, Custom);
1228 setOperationAction(ISD::UMAX, MVT::v16i16, Custom);
1229 setOperationAction(ISD::UMAX, MVT::v8i32, Custom);
1230 setOperationAction(ISD::SMIN, MVT::v32i8, Custom);
1231 setOperationAction(ISD::SMIN, MVT::v16i16, Custom);
1232 setOperationAction(ISD::SMIN, MVT::v8i32, Custom);
1233 setOperationAction(ISD::UMIN, MVT::v32i8, Custom);
1234 setOperationAction(ISD::UMIN, MVT::v16i16, Custom);
1235 setOperationAction(ISD::UMIN, MVT::v8i32, Custom);
1238 // In the customized shift lowering, the legal cases in AVX2 will be
1240 setOperationAction(ISD::SRL, MVT::v4i64, Custom);
1241 setOperationAction(ISD::SRL, MVT::v8i32, Custom);
1243 setOperationAction(ISD::SHL, MVT::v4i64, Custom);
1244 setOperationAction(ISD::SHL, MVT::v8i32, Custom);
1246 setOperationAction(ISD::SRA, MVT::v4i64, Custom);
1247 setOperationAction(ISD::SRA, MVT::v8i32, Custom);
1249 // Custom lower several nodes for 256-bit types.
1250 for (MVT VT : MVT::vector_valuetypes()) {
1251 if (VT.getScalarSizeInBits() >= 32) {
1252 setOperationAction(ISD::MLOAD, VT, Legal);
1253 setOperationAction(ISD::MSTORE, VT, Legal);
1255 // Extract subvector is special because the value type
1256 // (result) is 128-bit but the source is 256-bit wide.
1257 if (VT.is128BitVector()) {
1258 setOperationAction(ISD::EXTRACT_SUBVECTOR, VT, Custom);
1260 // Do not attempt to custom lower other non-256-bit vectors
1261 if (!VT.is256BitVector())
1264 setOperationAction(ISD::BUILD_VECTOR, VT, Custom);
1265 setOperationAction(ISD::VECTOR_SHUFFLE, VT, Custom);
1266 setOperationAction(ISD::VSELECT, VT, Custom);
1267 setOperationAction(ISD::INSERT_VECTOR_ELT, VT, Custom);
1268 setOperationAction(ISD::EXTRACT_VECTOR_ELT, VT, Custom);
1269 setOperationAction(ISD::SCALAR_TO_VECTOR, VT, Custom);
1270 setOperationAction(ISD::INSERT_SUBVECTOR, VT, Custom);
1271 setOperationAction(ISD::CONCAT_VECTORS, VT, Custom);
1274 if (Subtarget->hasInt256())
1275 setOperationAction(ISD::VSELECT, MVT::v32i8, Legal);
1277 // Promote v32i8, v16i16, v8i32 select, and, or, xor to v4i64.
1278 for (auto VT : { MVT::v32i8, MVT::v16i16, MVT::v8i32 }) {
1279 setOperationAction(ISD::AND, VT, Promote);
1280 AddPromotedToType (ISD::AND, VT, MVT::v4i64);
1281 setOperationAction(ISD::OR, VT, Promote);
1282 AddPromotedToType (ISD::OR, VT, MVT::v4i64);
1283 setOperationAction(ISD::XOR, VT, Promote);
1284 AddPromotedToType (ISD::XOR, VT, MVT::v4i64);
1285 setOperationAction(ISD::LOAD, VT, Promote);
1286 AddPromotedToType (ISD::LOAD, VT, MVT::v4i64);
1287 setOperationAction(ISD::SELECT, VT, Promote);
1288 AddPromotedToType (ISD::SELECT, VT, MVT::v4i64);
1292 if (!Subtarget->useSoftFloat() && Subtarget->hasAVX512()) {
1293 addRegisterClass(MVT::v16i32, &X86::VR512RegClass);
1294 addRegisterClass(MVT::v16f32, &X86::VR512RegClass);
1295 addRegisterClass(MVT::v8i64, &X86::VR512RegClass);
1296 addRegisterClass(MVT::v8f64, &X86::VR512RegClass);
1298 addRegisterClass(MVT::i1, &X86::VK1RegClass);
1299 addRegisterClass(MVT::v8i1, &X86::VK8RegClass);
1300 addRegisterClass(MVT::v16i1, &X86::VK16RegClass);
1302 for (MVT VT : MVT::fp_vector_valuetypes())
1303 setLoadExtAction(ISD::EXTLOAD, VT, MVT::v8f32, Legal);
1305 setLoadExtAction(ISD::ZEXTLOAD, MVT::v16i32, MVT::v16i8, Legal);
1306 setLoadExtAction(ISD::SEXTLOAD, MVT::v16i32, MVT::v16i8, Legal);
1307 setLoadExtAction(ISD::ZEXTLOAD, MVT::v16i32, MVT::v16i16, Legal);
1308 setLoadExtAction(ISD::SEXTLOAD, MVT::v16i32, MVT::v16i16, Legal);
1309 setLoadExtAction(ISD::ZEXTLOAD, MVT::v32i16, MVT::v32i8, Legal);
1310 setLoadExtAction(ISD::SEXTLOAD, MVT::v32i16, MVT::v32i8, Legal);
1311 setLoadExtAction(ISD::ZEXTLOAD, MVT::v8i64, MVT::v8i8, Legal);
1312 setLoadExtAction(ISD::SEXTLOAD, MVT::v8i64, MVT::v8i8, Legal);
1313 setLoadExtAction(ISD::ZEXTLOAD, MVT::v8i64, MVT::v8i16, Legal);
1314 setLoadExtAction(ISD::SEXTLOAD, MVT::v8i64, MVT::v8i16, Legal);
1315 setLoadExtAction(ISD::ZEXTLOAD, MVT::v8i64, MVT::v8i32, Legal);
1316 setLoadExtAction(ISD::SEXTLOAD, MVT::v8i64, MVT::v8i32, Legal);
1318 setOperationAction(ISD::BR_CC, MVT::i1, Expand);
1319 setOperationAction(ISD::SETCC, MVT::i1, Custom);
1320 setOperationAction(ISD::SELECT_CC, MVT::i1, Expand);
1321 setOperationAction(ISD::XOR, MVT::i1, Legal);
1322 setOperationAction(ISD::OR, MVT::i1, Legal);
1323 setOperationAction(ISD::AND, MVT::i1, Legal);
1324 setOperationAction(ISD::SUB, MVT::i1, Custom);
1325 setOperationAction(ISD::ADD, MVT::i1, Custom);
1326 setOperationAction(ISD::MUL, MVT::i1, Custom);
1327 setOperationAction(ISD::LOAD, MVT::v16f32, Legal);
1328 setOperationAction(ISD::LOAD, MVT::v8f64, Legal);
1329 setOperationAction(ISD::LOAD, MVT::v8i64, Legal);
1330 setOperationAction(ISD::LOAD, MVT::v16i32, Legal);
1331 setOperationAction(ISD::LOAD, MVT::v16i1, Legal);
1333 setOperationAction(ISD::FADD, MVT::v16f32, Legal);
1334 setOperationAction(ISD::FSUB, MVT::v16f32, Legal);
1335 setOperationAction(ISD::FMUL, MVT::v16f32, Legal);
1336 setOperationAction(ISD::FDIV, MVT::v16f32, Legal);
1337 setOperationAction(ISD::FSQRT, MVT::v16f32, Legal);
1338 setOperationAction(ISD::FNEG, MVT::v16f32, Custom);
1340 setOperationAction(ISD::FADD, MVT::v8f64, Legal);
1341 setOperationAction(ISD::FSUB, MVT::v8f64, Legal);
1342 setOperationAction(ISD::FMUL, MVT::v8f64, Legal);
1343 setOperationAction(ISD::FDIV, MVT::v8f64, Legal);
1344 setOperationAction(ISD::FSQRT, MVT::v8f64, Legal);
1345 setOperationAction(ISD::FNEG, MVT::v8f64, Custom);
1346 setOperationAction(ISD::FMA, MVT::v8f64, Legal);
1347 setOperationAction(ISD::FMA, MVT::v16f32, Legal);
1349 setOperationAction(ISD::FP_TO_SINT, MVT::v16i32, Legal);
1350 setOperationAction(ISD::FP_TO_UINT, MVT::v16i32, Legal);
1351 setOperationAction(ISD::FP_TO_UINT, MVT::v8i32, Legal);
1352 setOperationAction(ISD::FP_TO_UINT, MVT::v4i32, Legal);
1353 setOperationAction(ISD::SINT_TO_FP, MVT::v16i32, Legal);
1354 setOperationAction(ISD::SINT_TO_FP, MVT::v8i1, Custom);
1355 setOperationAction(ISD::SINT_TO_FP, MVT::v16i1, Custom);
1356 setOperationAction(ISD::SINT_TO_FP, MVT::v16i8, Promote);
1357 setOperationAction(ISD::SINT_TO_FP, MVT::v16i16, Promote);
1358 setOperationAction(ISD::UINT_TO_FP, MVT::v16i32, Legal);
1359 setOperationAction(ISD::UINT_TO_FP, MVT::v8i32, Legal);
1360 setOperationAction(ISD::UINT_TO_FP, MVT::v4i32, Legal);
1361 setOperationAction(ISD::UINT_TO_FP, MVT::v16i8, Custom);
1362 setOperationAction(ISD::UINT_TO_FP, MVT::v16i16, Custom);
1363 setOperationAction(ISD::FP_ROUND, MVT::v8f32, Legal);
1364 setOperationAction(ISD::FP_EXTEND, MVT::v8f32, Legal);
1366 setTruncStoreAction(MVT::v8i64, MVT::v8i8, Legal);
1367 setTruncStoreAction(MVT::v8i64, MVT::v8i16, Legal);
1368 setTruncStoreAction(MVT::v8i64, MVT::v8i32, Legal);
1369 setTruncStoreAction(MVT::v16i32, MVT::v16i8, Legal);
1370 setTruncStoreAction(MVT::v16i32, MVT::v16i16, Legal);
1371 if (Subtarget->hasVLX()){
1372 setTruncStoreAction(MVT::v4i64, MVT::v4i8, Legal);
1373 setTruncStoreAction(MVT::v4i64, MVT::v4i16, Legal);
1374 setTruncStoreAction(MVT::v4i64, MVT::v4i32, Legal);
1375 setTruncStoreAction(MVT::v8i32, MVT::v8i8, Legal);
1376 setTruncStoreAction(MVT::v8i32, MVT::v8i16, Legal);
1378 setTruncStoreAction(MVT::v2i64, MVT::v2i8, Legal);
1379 setTruncStoreAction(MVT::v2i64, MVT::v2i16, Legal);
1380 setTruncStoreAction(MVT::v2i64, MVT::v2i32, Legal);
1381 setTruncStoreAction(MVT::v4i32, MVT::v4i8, Legal);
1382 setTruncStoreAction(MVT::v4i32, MVT::v4i16, Legal);
1384 setOperationAction(ISD::TRUNCATE, MVT::i1, Custom);
1385 setOperationAction(ISD::TRUNCATE, MVT::v16i8, Custom);
1386 setOperationAction(ISD::TRUNCATE, MVT::v8i32, Custom);
1387 setOperationAction(ISD::VECTOR_SHUFFLE, MVT::v8i1, Custom);
1388 setOperationAction(ISD::VECTOR_SHUFFLE, MVT::v16i1, Custom);
1389 if (Subtarget->hasDQI()) {
1390 setOperationAction(ISD::TRUNCATE, MVT::v2i1, Custom);
1391 setOperationAction(ISD::TRUNCATE, MVT::v4i1, Custom);
1393 setOperationAction(ISD::SINT_TO_FP, MVT::v8i64, Legal);
1394 setOperationAction(ISD::UINT_TO_FP, MVT::v8i64, Legal);
1395 setOperationAction(ISD::FP_TO_SINT, MVT::v8i64, Legal);
1396 setOperationAction(ISD::FP_TO_UINT, MVT::v8i64, Legal);
1397 if (Subtarget->hasVLX()) {
1398 setOperationAction(ISD::SINT_TO_FP, MVT::v4i64, Legal);
1399 setOperationAction(ISD::SINT_TO_FP, MVT::v2i64, Legal);
1400 setOperationAction(ISD::UINT_TO_FP, MVT::v4i64, Legal);
1401 setOperationAction(ISD::UINT_TO_FP, MVT::v2i64, Legal);
1402 setOperationAction(ISD::FP_TO_SINT, MVT::v4i64, Legal);
1403 setOperationAction(ISD::FP_TO_SINT, MVT::v2i64, Legal);
1404 setOperationAction(ISD::FP_TO_UINT, MVT::v4i64, Legal);
1405 setOperationAction(ISD::FP_TO_UINT, MVT::v2i64, Legal);
1408 if (Subtarget->hasVLX()) {
1409 setOperationAction(ISD::SINT_TO_FP, MVT::v8i32, Legal);
1410 setOperationAction(ISD::UINT_TO_FP, MVT::v8i32, Legal);
1411 setOperationAction(ISD::FP_TO_SINT, MVT::v8i32, Legal);
1412 setOperationAction(ISD::FP_TO_UINT, MVT::v8i32, Legal);
1413 setOperationAction(ISD::SINT_TO_FP, MVT::v4i32, Legal);
1414 setOperationAction(ISD::UINT_TO_FP, MVT::v4i32, Legal);
1415 setOperationAction(ISD::FP_TO_SINT, MVT::v4i32, Legal);
1416 setOperationAction(ISD::FP_TO_UINT, MVT::v4i32, Legal);
1418 setOperationAction(ISD::TRUNCATE, MVT::v8i1, Custom);
1419 setOperationAction(ISD::TRUNCATE, MVT::v16i1, Custom);
1420 setOperationAction(ISD::TRUNCATE, MVT::v16i16, Custom);
1421 setOperationAction(ISD::ZERO_EXTEND, MVT::v16i32, Custom);
1422 setOperationAction(ISD::ZERO_EXTEND, MVT::v8i64, Custom);
1423 setOperationAction(ISD::ANY_EXTEND, MVT::v16i32, Custom);
1424 setOperationAction(ISD::ANY_EXTEND, MVT::v8i64, Custom);
1425 setOperationAction(ISD::SIGN_EXTEND, MVT::v16i32, Custom);
1426 setOperationAction(ISD::SIGN_EXTEND, MVT::v8i64, Custom);
1427 setOperationAction(ISD::SIGN_EXTEND, MVT::v16i8, Custom);
1428 setOperationAction(ISD::SIGN_EXTEND, MVT::v8i16, Custom);
1429 setOperationAction(ISD::SIGN_EXTEND, MVT::v16i16, Custom);
1430 if (Subtarget->hasDQI()) {
1431 setOperationAction(ISD::SIGN_EXTEND, MVT::v4i32, Custom);
1432 setOperationAction(ISD::SIGN_EXTEND, MVT::v2i64, Custom);
1434 setOperationAction(ISD::FFLOOR, MVT::v16f32, Legal);
1435 setOperationAction(ISD::FFLOOR, MVT::v8f64, Legal);
1436 setOperationAction(ISD::FCEIL, MVT::v16f32, Legal);
1437 setOperationAction(ISD::FCEIL, MVT::v8f64, Legal);
1438 setOperationAction(ISD::FTRUNC, MVT::v16f32, Legal);
1439 setOperationAction(ISD::FTRUNC, MVT::v8f64, Legal);
1440 setOperationAction(ISD::FRINT, MVT::v16f32, Legal);
1441 setOperationAction(ISD::FRINT, MVT::v8f64, Legal);
1442 setOperationAction(ISD::FNEARBYINT, MVT::v16f32, Legal);
1443 setOperationAction(ISD::FNEARBYINT, MVT::v8f64, Legal);
1445 setOperationAction(ISD::CONCAT_VECTORS, MVT::v8f64, Custom);
1446 setOperationAction(ISD::CONCAT_VECTORS, MVT::v8i64, Custom);
1447 setOperationAction(ISD::CONCAT_VECTORS, MVT::v16f32, Custom);
1448 setOperationAction(ISD::CONCAT_VECTORS, MVT::v16i32, Custom);
1449 setOperationAction(ISD::CONCAT_VECTORS, MVT::v16i1, Legal);
1451 setOperationAction(ISD::SETCC, MVT::v16i1, Custom);
1452 setOperationAction(ISD::SETCC, MVT::v8i1, Custom);
1454 setOperationAction(ISD::MUL, MVT::v8i64, Custom);
1456 setOperationAction(ISD::EXTRACT_VECTOR_ELT, MVT::v8i1, Custom);
1457 setOperationAction(ISD::EXTRACT_VECTOR_ELT, MVT::v16i1, Custom);
1458 setOperationAction(ISD::INSERT_VECTOR_ELT, MVT::v16i1, Custom);
1459 setOperationAction(ISD::INSERT_VECTOR_ELT, MVT::v8i1, Custom);
1460 setOperationAction(ISD::BUILD_VECTOR, MVT::v8i1, Custom);
1461 setOperationAction(ISD::BUILD_VECTOR, MVT::v16i1, Custom);
1462 setOperationAction(ISD::SELECT, MVT::v8f64, Custom);
1463 setOperationAction(ISD::SELECT, MVT::v8i64, Custom);
1464 setOperationAction(ISD::SELECT, MVT::v16f32, Custom);
1465 setOperationAction(ISD::SELECT, MVT::v16i1, Custom);
1466 setOperationAction(ISD::SELECT, MVT::v8i1, Custom);
1468 setOperationAction(ISD::SMAX, MVT::v16i32, Legal);
1469 setOperationAction(ISD::SMAX, MVT::v8i64, Legal);
1470 setOperationAction(ISD::UMAX, MVT::v16i32, Legal);
1471 setOperationAction(ISD::UMAX, MVT::v8i64, Legal);
1472 setOperationAction(ISD::SMIN, MVT::v16i32, Legal);
1473 setOperationAction(ISD::SMIN, MVT::v8i64, Legal);
1474 setOperationAction(ISD::UMIN, MVT::v16i32, Legal);
1475 setOperationAction(ISD::UMIN, MVT::v8i64, Legal);
1477 setOperationAction(ISD::ADD, MVT::v8i64, Legal);
1478 setOperationAction(ISD::ADD, MVT::v16i32, Legal);
1480 setOperationAction(ISD::SUB, MVT::v8i64, Legal);
1481 setOperationAction(ISD::SUB, MVT::v16i32, Legal);
1483 setOperationAction(ISD::MUL, MVT::v16i32, Legal);
1485 setOperationAction(ISD::SRL, MVT::v8i64, Custom);
1486 setOperationAction(ISD::SRL, MVT::v16i32, Custom);
1488 setOperationAction(ISD::SHL, MVT::v8i64, Custom);
1489 setOperationAction(ISD::SHL, MVT::v16i32, Custom);
1491 setOperationAction(ISD::SRA, MVT::v8i64, Custom);
1492 setOperationAction(ISD::SRA, MVT::v16i32, Custom);
1494 setOperationAction(ISD::AND, MVT::v8i64, Legal);
1495 setOperationAction(ISD::OR, MVT::v8i64, Legal);
1496 setOperationAction(ISD::XOR, MVT::v8i64, Legal);
1497 setOperationAction(ISD::AND, MVT::v16i32, Legal);
1498 setOperationAction(ISD::OR, MVT::v16i32, Legal);
1499 setOperationAction(ISD::XOR, MVT::v16i32, Legal);
1501 if (Subtarget->hasCDI()) {
1502 setOperationAction(ISD::CTLZ, MVT::v8i64, Legal);
1503 setOperationAction(ISD::CTLZ, MVT::v16i32, Legal);
1504 setOperationAction(ISD::CTLZ_ZERO_UNDEF, MVT::v8i64, Legal);
1505 setOperationAction(ISD::CTLZ_ZERO_UNDEF, MVT::v16i32, Legal);
1507 setOperationAction(ISD::CTLZ, MVT::v8i16, Custom);
1508 setOperationAction(ISD::CTLZ, MVT::v16i8, Custom);
1509 setOperationAction(ISD::CTLZ, MVT::v16i16, Custom);
1510 setOperationAction(ISD::CTLZ, MVT::v32i8, Custom);
1511 setOperationAction(ISD::CTLZ_ZERO_UNDEF, MVT::v8i16, Custom);
1512 setOperationAction(ISD::CTLZ_ZERO_UNDEF, MVT::v16i8, Custom);
1513 setOperationAction(ISD::CTLZ_ZERO_UNDEF, MVT::v16i16, Custom);
1514 setOperationAction(ISD::CTLZ_ZERO_UNDEF, MVT::v32i8, Custom);
1516 setOperationAction(ISD::CTTZ_ZERO_UNDEF, MVT::v8i64, Custom);
1517 setOperationAction(ISD::CTTZ_ZERO_UNDEF, MVT::v16i32, Custom);
1519 if (Subtarget->hasVLX()) {
1520 setOperationAction(ISD::CTLZ, MVT::v4i64, Legal);
1521 setOperationAction(ISD::CTLZ, MVT::v8i32, Legal);
1522 setOperationAction(ISD::CTLZ, MVT::v2i64, Legal);
1523 setOperationAction(ISD::CTLZ, MVT::v4i32, Legal);
1524 setOperationAction(ISD::CTLZ_ZERO_UNDEF, MVT::v4i64, Legal);
1525 setOperationAction(ISD::CTLZ_ZERO_UNDEF, MVT::v8i32, Legal);
1526 setOperationAction(ISD::CTLZ_ZERO_UNDEF, MVT::v2i64, Legal);
1527 setOperationAction(ISD::CTLZ_ZERO_UNDEF, MVT::v4i32, Legal);
1529 setOperationAction(ISD::CTTZ_ZERO_UNDEF, MVT::v4i64, Custom);
1530 setOperationAction(ISD::CTTZ_ZERO_UNDEF, MVT::v8i32, Custom);
1531 setOperationAction(ISD::CTTZ_ZERO_UNDEF, MVT::v2i64, Custom);
1532 setOperationAction(ISD::CTTZ_ZERO_UNDEF, MVT::v4i32, Custom);
1534 setOperationAction(ISD::CTLZ, MVT::v4i64, Custom);
1535 setOperationAction(ISD::CTLZ, MVT::v8i32, Custom);
1536 setOperationAction(ISD::CTLZ, MVT::v2i64, Custom);
1537 setOperationAction(ISD::CTLZ, MVT::v4i32, Custom);
1538 setOperationAction(ISD::CTLZ_ZERO_UNDEF, MVT::v4i64, Custom);
1539 setOperationAction(ISD::CTLZ_ZERO_UNDEF, MVT::v8i32, Custom);
1540 setOperationAction(ISD::CTLZ_ZERO_UNDEF, MVT::v2i64, Custom);
1541 setOperationAction(ISD::CTLZ_ZERO_UNDEF, MVT::v4i32, Custom);
1543 } // Subtarget->hasCDI()
1545 if (Subtarget->hasDQI()) {
1546 setOperationAction(ISD::MUL, MVT::v2i64, Legal);
1547 setOperationAction(ISD::MUL, MVT::v4i64, Legal);
1548 setOperationAction(ISD::MUL, MVT::v8i64, Legal);
1550 // Custom lower several nodes.
1551 for (MVT VT : MVT::vector_valuetypes()) {
1552 unsigned EltSize = VT.getVectorElementType().getSizeInBits();
1554 setOperationAction(ISD::AND, VT, Legal);
1555 setOperationAction(ISD::OR, VT, Legal);
1556 setOperationAction(ISD::XOR, VT, Legal);
1558 if (EltSize >= 32 && VT.getSizeInBits() <= 512) {
1559 setOperationAction(ISD::MGATHER, VT, Custom);
1560 setOperationAction(ISD::MSCATTER, VT, Custom);
1562 // Extract subvector is special because the value type
1563 // (result) is 256/128-bit but the source is 512-bit wide.
1564 if (VT.is128BitVector() || VT.is256BitVector()) {
1565 setOperationAction(ISD::EXTRACT_SUBVECTOR, VT, Custom);
1567 if (VT.getVectorElementType() == MVT::i1)
1568 setOperationAction(ISD::EXTRACT_SUBVECTOR, VT, Legal);
1570 // Do not attempt to custom lower other non-512-bit vectors
1571 if (!VT.is512BitVector())
1574 if (EltSize >= 32) {
1575 setOperationAction(ISD::VECTOR_SHUFFLE, VT, Custom);
1576 setOperationAction(ISD::INSERT_VECTOR_ELT, VT, Custom);
1577 setOperationAction(ISD::BUILD_VECTOR, VT, Custom);
1578 setOperationAction(ISD::VSELECT, VT, Legal);
1579 setOperationAction(ISD::EXTRACT_VECTOR_ELT, VT, Custom);
1580 setOperationAction(ISD::SCALAR_TO_VECTOR, VT, Custom);
1581 setOperationAction(ISD::INSERT_SUBVECTOR, VT, Custom);
1582 setOperationAction(ISD::MLOAD, VT, Legal);
1583 setOperationAction(ISD::MSTORE, VT, Legal);
1586 for (auto VT : { MVT::v64i8, MVT::v32i16, MVT::v16i32 }) {
1587 setOperationAction(ISD::SELECT, VT, Promote);
1588 AddPromotedToType (ISD::SELECT, VT, MVT::v8i64);
1592 if (!Subtarget->useSoftFloat() && Subtarget->hasBWI()) {
1593 addRegisterClass(MVT::v32i16, &X86::VR512RegClass);
1594 addRegisterClass(MVT::v64i8, &X86::VR512RegClass);
1596 addRegisterClass(MVT::v32i1, &X86::VK32RegClass);
1597 addRegisterClass(MVT::v64i1, &X86::VK64RegClass);
1599 setOperationAction(ISD::LOAD, MVT::v32i16, Legal);
1600 setOperationAction(ISD::LOAD, MVT::v64i8, Legal);
1601 setOperationAction(ISD::SETCC, MVT::v32i1, Custom);
1602 setOperationAction(ISD::SETCC, MVT::v64i1, Custom);
1603 setOperationAction(ISD::ADD, MVT::v32i16, Legal);
1604 setOperationAction(ISD::ADD, MVT::v64i8, Legal);
1605 setOperationAction(ISD::SUB, MVT::v32i16, Legal);
1606 setOperationAction(ISD::SUB, MVT::v64i8, Legal);
1607 setOperationAction(ISD::MUL, MVT::v32i16, Legal);
1608 setOperationAction(ISD::MULHS, MVT::v32i16, Legal);
1609 setOperationAction(ISD::MULHU, MVT::v32i16, Legal);
1610 setOperationAction(ISD::CONCAT_VECTORS, MVT::v32i1, Legal);
1611 setOperationAction(ISD::CONCAT_VECTORS, MVT::v64i1, Legal);
1612 setOperationAction(ISD::CONCAT_VECTORS, MVT::v32i16, Custom);
1613 setOperationAction(ISD::CONCAT_VECTORS, MVT::v64i8, Custom);
1614 setOperationAction(ISD::INSERT_SUBVECTOR, MVT::v32i1, Custom);
1615 setOperationAction(ISD::INSERT_SUBVECTOR, MVT::v64i1, Custom);
1616 setOperationAction(ISD::INSERT_SUBVECTOR, MVT::v32i16, Custom);
1617 setOperationAction(ISD::INSERT_SUBVECTOR, MVT::v64i8, Custom);
1618 setOperationAction(ISD::EXTRACT_VECTOR_ELT, MVT::v32i16, Custom);
1619 setOperationAction(ISD::EXTRACT_VECTOR_ELT, MVT::v64i8, Custom);
1620 setOperationAction(ISD::SELECT, MVT::v32i1, Custom);
1621 setOperationAction(ISD::SELECT, MVT::v64i1, Custom);
1622 setOperationAction(ISD::SIGN_EXTEND, MVT::v32i8, Custom);
1623 setOperationAction(ISD::ZERO_EXTEND, MVT::v32i8, Custom);
1624 setOperationAction(ISD::SIGN_EXTEND, MVT::v32i16, Custom);
1625 setOperationAction(ISD::ZERO_EXTEND, MVT::v32i16, Custom);
1626 setOperationAction(ISD::VECTOR_SHUFFLE, MVT::v32i16, Custom);
1627 setOperationAction(ISD::VECTOR_SHUFFLE, MVT::v64i8, Custom);
1628 setOperationAction(ISD::SIGN_EXTEND, MVT::v64i8, Custom);
1629 setOperationAction(ISD::ZERO_EXTEND, MVT::v64i8, Custom);
1630 setOperationAction(ISD::INSERT_VECTOR_ELT, MVT::v32i1, Custom);
1631 setOperationAction(ISD::INSERT_VECTOR_ELT, MVT::v64i1, Custom);
1632 setOperationAction(ISD::INSERT_VECTOR_ELT, MVT::v32i16, Custom);
1633 setOperationAction(ISD::INSERT_VECTOR_ELT, MVT::v64i8, Custom);
1634 setOperationAction(ISD::VSELECT, MVT::v32i16, Legal);
1635 setOperationAction(ISD::VSELECT, MVT::v64i8, Legal);
1636 setOperationAction(ISD::TRUNCATE, MVT::v32i1, Custom);
1637 setOperationAction(ISD::TRUNCATE, MVT::v64i1, Custom);
1638 setOperationAction(ISD::TRUNCATE, MVT::v32i8, Custom);
1639 setOperationAction(ISD::VECTOR_SHUFFLE, MVT::v32i1, Custom);
1640 setOperationAction(ISD::VECTOR_SHUFFLE, MVT::v64i1, Custom);
1642 setOperationAction(ISD::SMAX, MVT::v64i8, Legal);
1643 setOperationAction(ISD::SMAX, MVT::v32i16, Legal);
1644 setOperationAction(ISD::UMAX, MVT::v64i8, Legal);
1645 setOperationAction(ISD::UMAX, MVT::v32i16, Legal);
1646 setOperationAction(ISD::SMIN, MVT::v64i8, Legal);
1647 setOperationAction(ISD::SMIN, MVT::v32i16, Legal);
1648 setOperationAction(ISD::UMIN, MVT::v64i8, Legal);
1649 setOperationAction(ISD::UMIN, MVT::v32i16, Legal);
1651 setTruncStoreAction(MVT::v32i16, MVT::v32i8, Legal);
1652 setTruncStoreAction(MVT::v16i16, MVT::v16i8, Legal);
1653 if (Subtarget->hasVLX())
1654 setTruncStoreAction(MVT::v8i16, MVT::v8i8, Legal);
1656 if (Subtarget->hasCDI()) {
1657 setOperationAction(ISD::CTLZ, MVT::v32i16, Custom);
1658 setOperationAction(ISD::CTLZ, MVT::v64i8, Custom);
1659 setOperationAction(ISD::CTLZ_ZERO_UNDEF, MVT::v32i16, Custom);
1660 setOperationAction(ISD::CTLZ_ZERO_UNDEF, MVT::v64i8, Custom);
1663 for (auto VT : { MVT::v64i8, MVT::v32i16 }) {
1664 setOperationAction(ISD::BUILD_VECTOR, VT, Custom);
1665 setOperationAction(ISD::VSELECT, VT, Legal);
1669 if (!Subtarget->useSoftFloat() && Subtarget->hasVLX()) {
1670 addRegisterClass(MVT::v4i1, &X86::VK4RegClass);
1671 addRegisterClass(MVT::v2i1, &X86::VK2RegClass);
1673 setOperationAction(ISD::SETCC, MVT::v4i1, Custom);
1674 setOperationAction(ISD::SETCC, MVT::v2i1, Custom);
1675 setOperationAction(ISD::CONCAT_VECTORS, MVT::v4i1, Custom);
1676 setOperationAction(ISD::CONCAT_VECTORS, MVT::v8i1, Custom);
1677 setOperationAction(ISD::INSERT_SUBVECTOR, MVT::v8i1, Custom);
1678 setOperationAction(ISD::INSERT_SUBVECTOR, MVT::v4i1, Custom);
1679 setOperationAction(ISD::SELECT, MVT::v4i1, Custom);
1680 setOperationAction(ISD::SELECT, MVT::v2i1, Custom);
1681 setOperationAction(ISD::BUILD_VECTOR, MVT::v4i1, Custom);
1682 setOperationAction(ISD::BUILD_VECTOR, MVT::v2i1, Custom);
1683 setOperationAction(ISD::VECTOR_SHUFFLE, MVT::v2i1, Custom);
1684 setOperationAction(ISD::VECTOR_SHUFFLE, MVT::v4i1, Custom);
1686 setOperationAction(ISD::AND, MVT::v8i32, Legal);
1687 setOperationAction(ISD::OR, MVT::v8i32, Legal);
1688 setOperationAction(ISD::XOR, MVT::v8i32, Legal);
1689 setOperationAction(ISD::AND, MVT::v4i32, Legal);
1690 setOperationAction(ISD::OR, MVT::v4i32, Legal);
1691 setOperationAction(ISD::XOR, MVT::v4i32, Legal);
1692 setOperationAction(ISD::SRA, MVT::v2i64, Custom);
1693 setOperationAction(ISD::SRA, MVT::v4i64, Custom);
1695 setOperationAction(ISD::SMAX, MVT::v2i64, Legal);
1696 setOperationAction(ISD::SMAX, MVT::v4i64, Legal);
1697 setOperationAction(ISD::UMAX, MVT::v2i64, Legal);
1698 setOperationAction(ISD::UMAX, MVT::v4i64, Legal);
1699 setOperationAction(ISD::SMIN, MVT::v2i64, Legal);
1700 setOperationAction(ISD::SMIN, MVT::v4i64, Legal);
1701 setOperationAction(ISD::UMIN, MVT::v2i64, Legal);
1702 setOperationAction(ISD::UMIN, MVT::v4i64, Legal);
1705 // We want to custom lower some of our intrinsics.
1706 setOperationAction(ISD::INTRINSIC_WO_CHAIN, MVT::Other, Custom);
1707 setOperationAction(ISD::INTRINSIC_W_CHAIN, MVT::Other, Custom);
1708 setOperationAction(ISD::INTRINSIC_VOID, MVT::Other, Custom);
1709 if (!Subtarget->is64Bit())
1710 setOperationAction(ISD::INTRINSIC_W_CHAIN, MVT::i64, Custom);
1712 // Only custom-lower 64-bit SADDO and friends on 64-bit because we don't
1713 // handle type legalization for these operations here.
1715 // FIXME: We really should do custom legalization for addition and
1716 // subtraction on x86-32 once PR3203 is fixed. We really can't do much better
1717 // than generic legalization for 64-bit multiplication-with-overflow, though.
1718 for (auto VT : { MVT::i8, MVT::i16, MVT::i32, MVT::i64 }) {
1719 if (VT == MVT::i64 && !Subtarget->is64Bit())
1721 // Add/Sub/Mul with overflow operations are custom lowered.
1722 setOperationAction(ISD::SADDO, VT, Custom);
1723 setOperationAction(ISD::UADDO, VT, Custom);
1724 setOperationAction(ISD::SSUBO, VT, Custom);
1725 setOperationAction(ISD::USUBO, VT, Custom);
1726 setOperationAction(ISD::SMULO, VT, Custom);
1727 setOperationAction(ISD::UMULO, VT, Custom);
1730 if (!Subtarget->is64Bit()) {
1731 // These libcalls are not available in 32-bit.
1732 setLibcallName(RTLIB::SHL_I128, nullptr);
1733 setLibcallName(RTLIB::SRL_I128, nullptr);
1734 setLibcallName(RTLIB::SRA_I128, nullptr);
1737 // Combine sin / cos into one node or libcall if possible.
1738 if (Subtarget->hasSinCos()) {
1739 setLibcallName(RTLIB::SINCOS_F32, "sincosf");
1740 setLibcallName(RTLIB::SINCOS_F64, "sincos");
1741 if (Subtarget->isTargetDarwin()) {
1742 // For MacOSX, we don't want the normal expansion of a libcall to sincos.
1743 // We want to issue a libcall to __sincos_stret to avoid memory traffic.
1744 setOperationAction(ISD::FSINCOS, MVT::f64, Custom);
1745 setOperationAction(ISD::FSINCOS, MVT::f32, Custom);
1749 if (Subtarget->isTargetWin64()) {
1750 setOperationAction(ISD::SDIV, MVT::i128, Custom);
1751 setOperationAction(ISD::UDIV, MVT::i128, Custom);
1752 setOperationAction(ISD::SREM, MVT::i128, Custom);
1753 setOperationAction(ISD::UREM, MVT::i128, Custom);
1754 setOperationAction(ISD::SDIVREM, MVT::i128, Custom);
1755 setOperationAction(ISD::UDIVREM, MVT::i128, Custom);
1758 // We have target-specific dag combine patterns for the following nodes:
1759 setTargetDAGCombine(ISD::VECTOR_SHUFFLE);
1760 setTargetDAGCombine(ISD::EXTRACT_VECTOR_ELT);
1761 setTargetDAGCombine(ISD::BITCAST);
1762 setTargetDAGCombine(ISD::VSELECT);
1763 setTargetDAGCombine(ISD::SELECT);
1764 setTargetDAGCombine(ISD::SHL);
1765 setTargetDAGCombine(ISD::SRA);
1766 setTargetDAGCombine(ISD::SRL);
1767 setTargetDAGCombine(ISD::OR);
1768 setTargetDAGCombine(ISD::AND);
1769 setTargetDAGCombine(ISD::ADD);
1770 setTargetDAGCombine(ISD::FADD);
1771 setTargetDAGCombine(ISD::FSUB);
1772 setTargetDAGCombine(ISD::FMA);
1773 setTargetDAGCombine(ISD::SUB);
1774 setTargetDAGCombine(ISD::LOAD);
1775 setTargetDAGCombine(ISD::MLOAD);
1776 setTargetDAGCombine(ISD::STORE);
1777 setTargetDAGCombine(ISD::MSTORE);
1778 setTargetDAGCombine(ISD::ZERO_EXTEND);
1779 setTargetDAGCombine(ISD::ANY_EXTEND);
1780 setTargetDAGCombine(ISD::SIGN_EXTEND);
1781 setTargetDAGCombine(ISD::SIGN_EXTEND_INREG);
1782 setTargetDAGCombine(ISD::SINT_TO_FP);
1783 setTargetDAGCombine(ISD::UINT_TO_FP);
1784 setTargetDAGCombine(ISD::SETCC);
1785 setTargetDAGCombine(ISD::BUILD_VECTOR);
1786 setTargetDAGCombine(ISD::MUL);
1787 setTargetDAGCombine(ISD::XOR);
1789 computeRegisterProperties(Subtarget->getRegisterInfo());
1791 MaxStoresPerMemset = 16; // For @llvm.memset -> sequence of stores
1792 MaxStoresPerMemsetOptSize = 8;
1793 MaxStoresPerMemcpy = 8; // For @llvm.memcpy -> sequence of stores
1794 MaxStoresPerMemcpyOptSize = 4;
1795 MaxStoresPerMemmove = 8; // For @llvm.memmove -> sequence of stores
1796 MaxStoresPerMemmoveOptSize = 4;
1797 setPrefLoopAlignment(4); // 2^4 bytes.
1799 // A predictable cmov does not hurt on an in-order CPU.
1800 // FIXME: Use a CPU attribute to trigger this, not a CPU model.
1801 PredictableSelectIsExpensive = !Subtarget->isAtom();
1802 EnableExtLdPromotion = true;
1803 setPrefFunctionAlignment(4); // 2^4 bytes.
1805 verifyIntrinsicTables();
1808 // This has so far only been implemented for 64-bit MachO.
1809 bool X86TargetLowering::useLoadStackGuardNode() const {
1810 return Subtarget->isTargetMachO() && Subtarget->is64Bit();
1813 TargetLoweringBase::LegalizeTypeAction
1814 X86TargetLowering::getPreferredVectorAction(EVT VT) const {
1815 if (ExperimentalVectorWideningLegalization &&
1816 VT.getVectorNumElements() != 1 &&
1817 VT.getVectorElementType().getSimpleVT() != MVT::i1)
1818 return TypeWidenVector;
1820 return TargetLoweringBase::getPreferredVectorAction(VT);
1823 EVT X86TargetLowering::getSetCCResultType(const DataLayout &DL, LLVMContext &,
1826 return Subtarget->hasAVX512() ? MVT::i1: MVT::i8;
1828 if (VT.isSimple()) {
1829 MVT VVT = VT.getSimpleVT();
1830 const unsigned NumElts = VVT.getVectorNumElements();
1831 const MVT EltVT = VVT.getVectorElementType();
1832 if (VVT.is512BitVector()) {
1833 if (Subtarget->hasAVX512())
1834 if (EltVT == MVT::i32 || EltVT == MVT::i64 ||
1835 EltVT == MVT::f32 || EltVT == MVT::f64)
1837 case 8: return MVT::v8i1;
1838 case 16: return MVT::v16i1;
1840 if (Subtarget->hasBWI())
1841 if (EltVT == MVT::i8 || EltVT == MVT::i16)
1843 case 32: return MVT::v32i1;
1844 case 64: return MVT::v64i1;
1848 if (VVT.is256BitVector() || VVT.is128BitVector()) {
1849 if (Subtarget->hasVLX())
1850 if (EltVT == MVT::i32 || EltVT == MVT::i64 ||
1851 EltVT == MVT::f32 || EltVT == MVT::f64)
1853 case 2: return MVT::v2i1;
1854 case 4: return MVT::v4i1;
1855 case 8: return MVT::v8i1;
1857 if (Subtarget->hasBWI() && Subtarget->hasVLX())
1858 if (EltVT == MVT::i8 || EltVT == MVT::i16)
1860 case 8: return MVT::v8i1;
1861 case 16: return MVT::v16i1;
1862 case 32: return MVT::v32i1;
1867 return VT.changeVectorElementTypeToInteger();
1870 /// Helper for getByValTypeAlignment to determine
1871 /// the desired ByVal argument alignment.
1872 static void getMaxByValAlign(Type *Ty, unsigned &MaxAlign) {
1875 if (VectorType *VTy = dyn_cast<VectorType>(Ty)) {
1876 if (VTy->getBitWidth() == 128)
1878 } else if (ArrayType *ATy = dyn_cast<ArrayType>(Ty)) {
1879 unsigned EltAlign = 0;
1880 getMaxByValAlign(ATy->getElementType(), EltAlign);
1881 if (EltAlign > MaxAlign)
1882 MaxAlign = EltAlign;
1883 } else if (StructType *STy = dyn_cast<StructType>(Ty)) {
1884 for (auto *EltTy : STy->elements()) {
1885 unsigned EltAlign = 0;
1886 getMaxByValAlign(EltTy, EltAlign);
1887 if (EltAlign > MaxAlign)
1888 MaxAlign = EltAlign;
1895 /// Return the desired alignment for ByVal aggregate
1896 /// function arguments in the caller parameter area. For X86, aggregates
1897 /// that contain SSE vectors are placed at 16-byte boundaries while the rest
1898 /// are at 4-byte boundaries.
1899 unsigned X86TargetLowering::getByValTypeAlignment(Type *Ty,
1900 const DataLayout &DL) const {
1901 if (Subtarget->is64Bit()) {
1902 // Max of 8 and alignment of type.
1903 unsigned TyAlign = DL.getABITypeAlignment(Ty);
1910 if (Subtarget->hasSSE1())
1911 getMaxByValAlign(Ty, Align);
1915 /// Returns the target specific optimal type for load
1916 /// and store operations as a result of memset, memcpy, and memmove
1917 /// lowering. If DstAlign is zero that means it's safe to destination
1918 /// alignment can satisfy any constraint. Similarly if SrcAlign is zero it
1919 /// means there isn't a need to check it against alignment requirement,
1920 /// probably because the source does not need to be loaded. If 'IsMemset' is
1921 /// true, that means it's expanding a memset. If 'ZeroMemset' is true, that
1922 /// means it's a memset of zero. 'MemcpyStrSrc' indicates whether the memcpy
1923 /// source is constant so it does not need to be loaded.
1924 /// It returns EVT::Other if the type should be determined using generic
1925 /// target-independent logic.
1927 X86TargetLowering::getOptimalMemOpType(uint64_t Size,
1928 unsigned DstAlign, unsigned SrcAlign,
1929 bool IsMemset, bool ZeroMemset,
1931 MachineFunction &MF) const {
1932 const Function *F = MF.getFunction();
1933 if ((!IsMemset || ZeroMemset) &&
1934 !F->hasFnAttribute(Attribute::NoImplicitFloat)) {
1936 (!Subtarget->isUnalignedMem16Slow() ||
1937 ((DstAlign == 0 || DstAlign >= 16) &&
1938 (SrcAlign == 0 || SrcAlign >= 16)))) {
1940 // FIXME: Check if unaligned 32-byte accesses are slow.
1941 if (Subtarget->hasInt256())
1943 if (Subtarget->hasFp256())
1946 if (Subtarget->hasSSE2())
1948 if (Subtarget->hasSSE1())
1950 } else if (!MemcpyStrSrc && Size >= 8 &&
1951 !Subtarget->is64Bit() &&
1952 Subtarget->hasSSE2()) {
1953 // Do not use f64 to lower memcpy if source is string constant. It's
1954 // better to use i32 to avoid the loads.
1958 // This is a compromise. If we reach here, unaligned accesses may be slow on
1959 // this target. However, creating smaller, aligned accesses could be even
1960 // slower and would certainly be a lot more code.
1961 if (Subtarget->is64Bit() && Size >= 8)
1966 bool X86TargetLowering::isSafeMemOpType(MVT VT) const {
1968 return X86ScalarSSEf32;
1969 else if (VT == MVT::f64)
1970 return X86ScalarSSEf64;
1975 X86TargetLowering::allowsMisalignedMemoryAccesses(EVT VT,
1980 switch (VT.getSizeInBits()) {
1982 // 8-byte and under are always assumed to be fast.
1986 *Fast = !Subtarget->isUnalignedMem16Slow();
1989 *Fast = !Subtarget->isUnalignedMem32Slow();
1991 // TODO: What about AVX-512 (512-bit) accesses?
1994 // Misaligned accesses of any size are always allowed.
1998 /// Return the entry encoding for a jump table in the
1999 /// current function. The returned value is a member of the
2000 /// MachineJumpTableInfo::JTEntryKind enum.
2001 unsigned X86TargetLowering::getJumpTableEncoding() const {
2002 // In GOT pic mode, each entry in the jump table is emitted as a @GOTOFF
2004 if (getTargetMachine().getRelocationModel() == Reloc::PIC_ &&
2005 Subtarget->isPICStyleGOT())
2006 return MachineJumpTableInfo::EK_Custom32;
2008 // Otherwise, use the normal jump table encoding heuristics.
2009 return TargetLowering::getJumpTableEncoding();
2012 bool X86TargetLowering::useSoftFloat() const {
2013 return Subtarget->useSoftFloat();
2017 X86TargetLowering::LowerCustomJumpTableEntry(const MachineJumpTableInfo *MJTI,
2018 const MachineBasicBlock *MBB,
2019 unsigned uid,MCContext &Ctx) const{
2020 assert(MBB->getParent()->getTarget().getRelocationModel() == Reloc::PIC_ &&
2021 Subtarget->isPICStyleGOT());
2022 // In 32-bit ELF systems, our jump table entries are formed with @GOTOFF
2024 return MCSymbolRefExpr::create(MBB->getSymbol(),
2025 MCSymbolRefExpr::VK_GOTOFF, Ctx);
2028 /// Returns relocation base for the given PIC jumptable.
2029 SDValue X86TargetLowering::getPICJumpTableRelocBase(SDValue Table,
2030 SelectionDAG &DAG) const {
2031 if (!Subtarget->is64Bit())
2032 // This doesn't have SDLoc associated with it, but is not really the
2033 // same as a Register.
2034 return DAG.getNode(X86ISD::GlobalBaseReg, SDLoc(),
2035 getPointerTy(DAG.getDataLayout()));
2039 /// This returns the relocation base for the given PIC jumptable,
2040 /// the same as getPICJumpTableRelocBase, but as an MCExpr.
2041 const MCExpr *X86TargetLowering::
2042 getPICJumpTableRelocBaseExpr(const MachineFunction *MF, unsigned JTI,
2043 MCContext &Ctx) const {
2044 // X86-64 uses RIP relative addressing based on the jump table label.
2045 if (Subtarget->isPICStyleRIPRel())
2046 return TargetLowering::getPICJumpTableRelocBaseExpr(MF, JTI, Ctx);
2048 // Otherwise, the reference is relative to the PIC base.
2049 return MCSymbolRefExpr::create(MF->getPICBaseSymbol(), Ctx);
2052 std::pair<const TargetRegisterClass *, uint8_t>
2053 X86TargetLowering::findRepresentativeClass(const TargetRegisterInfo *TRI,
2055 const TargetRegisterClass *RRC = nullptr;
2057 switch (VT.SimpleTy) {
2059 return TargetLowering::findRepresentativeClass(TRI, VT);
2060 case MVT::i8: case MVT::i16: case MVT::i32: case MVT::i64:
2061 RRC = Subtarget->is64Bit() ? &X86::GR64RegClass : &X86::GR32RegClass;
2064 RRC = &X86::VR64RegClass;
2066 case MVT::f32: case MVT::f64:
2067 case MVT::v16i8: case MVT::v8i16: case MVT::v4i32: case MVT::v2i64:
2068 case MVT::v4f32: case MVT::v2f64:
2069 case MVT::v32i8: case MVT::v8i32: case MVT::v4i64: case MVT::v8f32:
2071 RRC = &X86::VR128RegClass;
2074 return std::make_pair(RRC, Cost);
2077 bool X86TargetLowering::getStackCookieLocation(unsigned &AddressSpace,
2078 unsigned &Offset) const {
2079 if (!Subtarget->isTargetLinux())
2082 if (Subtarget->is64Bit()) {
2083 // %fs:0x28, unless we're using a Kernel code model, in which case it's %gs:
2085 if (getTargetMachine().getCodeModel() == CodeModel::Kernel)
2097 Value *X86TargetLowering::getSafeStackPointerLocation(IRBuilder<> &IRB) const {
2098 if (!Subtarget->isTargetAndroid())
2099 return TargetLowering::getSafeStackPointerLocation(IRB);
2101 // Android provides a fixed TLS slot for the SafeStack pointer. See the
2102 // definition of TLS_SLOT_SAFESTACK in
2103 // https://android.googlesource.com/platform/bionic/+/master/libc/private/bionic_tls.h
2104 unsigned AddressSpace, Offset;
2105 if (Subtarget->is64Bit()) {
2106 // %fs:0x48, unless we're using a Kernel code model, in which case it's %gs:
2108 if (getTargetMachine().getCodeModel() == CodeModel::Kernel)
2118 return ConstantExpr::getIntToPtr(
2119 ConstantInt::get(Type::getInt32Ty(IRB.getContext()), Offset),
2120 Type::getInt8PtrTy(IRB.getContext())->getPointerTo(AddressSpace));
2123 bool X86TargetLowering::isNoopAddrSpaceCast(unsigned SrcAS,
2124 unsigned DestAS) const {
2125 assert(SrcAS != DestAS && "Expected different address spaces!");
2127 return SrcAS < 256 && DestAS < 256;
2130 //===----------------------------------------------------------------------===//
2131 // Return Value Calling Convention Implementation
2132 //===----------------------------------------------------------------------===//
2134 #include "X86GenCallingConv.inc"
2136 bool X86TargetLowering::CanLowerReturn(
2137 CallingConv::ID CallConv, MachineFunction &MF, bool isVarArg,
2138 const SmallVectorImpl<ISD::OutputArg> &Outs, LLVMContext &Context) const {
2139 SmallVector<CCValAssign, 16> RVLocs;
2140 CCState CCInfo(CallConv, isVarArg, MF, RVLocs, Context);
2141 return CCInfo.CheckReturn(Outs, RetCC_X86);
2144 const MCPhysReg *X86TargetLowering::getScratchRegisters(CallingConv::ID) const {
2145 static const MCPhysReg ScratchRegs[] = { X86::R11, 0 };
2150 X86TargetLowering::LowerReturn(SDValue Chain,
2151 CallingConv::ID CallConv, bool isVarArg,
2152 const SmallVectorImpl<ISD::OutputArg> &Outs,
2153 const SmallVectorImpl<SDValue> &OutVals,
2154 SDLoc dl, SelectionDAG &DAG) const {
2155 MachineFunction &MF = DAG.getMachineFunction();
2156 X86MachineFunctionInfo *FuncInfo = MF.getInfo<X86MachineFunctionInfo>();
2158 SmallVector<CCValAssign, 16> RVLocs;
2159 CCState CCInfo(CallConv, isVarArg, MF, RVLocs, *DAG.getContext());
2160 CCInfo.AnalyzeReturn(Outs, RetCC_X86);
2163 SmallVector<SDValue, 6> RetOps;
2164 RetOps.push_back(Chain); // Operand #0 = Chain (updated below)
2165 // Operand #1 = Bytes To Pop
2166 RetOps.push_back(DAG.getTargetConstant(FuncInfo->getBytesToPopOnReturn(), dl,
2169 // Copy the result values into the output registers.
2170 for (unsigned i = 0; i != RVLocs.size(); ++i) {
2171 CCValAssign &VA = RVLocs[i];
2172 assert(VA.isRegLoc() && "Can only return in registers!");
2173 SDValue ValToCopy = OutVals[i];
2174 EVT ValVT = ValToCopy.getValueType();
2176 // Promote values to the appropriate types.
2177 if (VA.getLocInfo() == CCValAssign::SExt)
2178 ValToCopy = DAG.getNode(ISD::SIGN_EXTEND, dl, VA.getLocVT(), ValToCopy);
2179 else if (VA.getLocInfo() == CCValAssign::ZExt)
2180 ValToCopy = DAG.getNode(ISD::ZERO_EXTEND, dl, VA.getLocVT(), ValToCopy);
2181 else if (VA.getLocInfo() == CCValAssign::AExt) {
2182 if (ValVT.isVector() && ValVT.getVectorElementType() == MVT::i1)
2183 ValToCopy = DAG.getNode(ISD::SIGN_EXTEND, dl, VA.getLocVT(), ValToCopy);
2185 ValToCopy = DAG.getNode(ISD::ANY_EXTEND, dl, VA.getLocVT(), ValToCopy);
2187 else if (VA.getLocInfo() == CCValAssign::BCvt)
2188 ValToCopy = DAG.getBitcast(VA.getLocVT(), ValToCopy);
2190 assert(VA.getLocInfo() != CCValAssign::FPExt &&
2191 "Unexpected FP-extend for return value.");
2193 // If this is x86-64, and we disabled SSE, we can't return FP values,
2194 // or SSE or MMX vectors.
2195 if ((ValVT == MVT::f32 || ValVT == MVT::f64 ||
2196 VA.getLocReg() == X86::XMM0 || VA.getLocReg() == X86::XMM1) &&
2197 (Subtarget->is64Bit() && !Subtarget->hasSSE1())) {
2198 report_fatal_error("SSE register return with SSE disabled");
2200 // Likewise we can't return F64 values with SSE1 only. gcc does so, but
2201 // llvm-gcc has never done it right and no one has noticed, so this
2202 // should be OK for now.
2203 if (ValVT == MVT::f64 &&
2204 (Subtarget->is64Bit() && !Subtarget->hasSSE2()))
2205 report_fatal_error("SSE2 register return with SSE2 disabled");
2207 // Returns in ST0/ST1 are handled specially: these are pushed as operands to
2208 // the RET instruction and handled by the FP Stackifier.
2209 if (VA.getLocReg() == X86::FP0 ||
2210 VA.getLocReg() == X86::FP1) {
2211 // If this is a copy from an xmm register to ST(0), use an FPExtend to
2212 // change the value to the FP stack register class.
2213 if (isScalarFPTypeInSSEReg(VA.getValVT()))
2214 ValToCopy = DAG.getNode(ISD::FP_EXTEND, dl, MVT::f80, ValToCopy);
2215 RetOps.push_back(ValToCopy);
2216 // Don't emit a copytoreg.
2220 // 64-bit vector (MMX) values are returned in XMM0 / XMM1 except for v1i64
2221 // which is returned in RAX / RDX.
2222 if (Subtarget->is64Bit()) {
2223 if (ValVT == MVT::x86mmx) {
2224 if (VA.getLocReg() == X86::XMM0 || VA.getLocReg() == X86::XMM1) {
2225 ValToCopy = DAG.getBitcast(MVT::i64, ValToCopy);
2226 ValToCopy = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, MVT::v2i64,
2228 // If we don't have SSE2 available, convert to v4f32 so the generated
2229 // register is legal.
2230 if (!Subtarget->hasSSE2())
2231 ValToCopy = DAG.getBitcast(MVT::v4f32, ValToCopy);
2236 Chain = DAG.getCopyToReg(Chain, dl, VA.getLocReg(), ValToCopy, Flag);
2237 Flag = Chain.getValue(1);
2238 RetOps.push_back(DAG.getRegister(VA.getLocReg(), VA.getLocVT()));
2241 // All x86 ABIs require that for returning structs by value we copy
2242 // the sret argument into %rax/%eax (depending on ABI) for the return.
2243 // We saved the argument into a virtual register in the entry block,
2244 // so now we copy the value out and into %rax/%eax.
2246 // Checking Function.hasStructRetAttr() here is insufficient because the IR
2247 // may not have an explicit sret argument. If FuncInfo.CanLowerReturn is
2248 // false, then an sret argument may be implicitly inserted in the SelDAG. In
2249 // either case FuncInfo->setSRetReturnReg() will have been called.
2250 if (unsigned SRetReg = FuncInfo->getSRetReturnReg()) {
2251 SDValue Val = DAG.getCopyFromReg(Chain, dl, SRetReg,
2252 getPointerTy(MF.getDataLayout()));
2255 = (Subtarget->is64Bit() && !Subtarget->isTarget64BitILP32()) ?
2256 X86::RAX : X86::EAX;
2257 Chain = DAG.getCopyToReg(Chain, dl, RetValReg, Val, Flag);
2258 Flag = Chain.getValue(1);
2260 // RAX/EAX now acts like a return value.
2262 DAG.getRegister(RetValReg, getPointerTy(DAG.getDataLayout())));
2265 RetOps[0] = Chain; // Update chain.
2267 // Add the flag if we have it.
2269 RetOps.push_back(Flag);
2271 return DAG.getNode(X86ISD::RET_FLAG, dl, MVT::Other, RetOps);
2274 bool X86TargetLowering::isUsedByReturnOnly(SDNode *N, SDValue &Chain) const {
2275 if (N->getNumValues() != 1)
2277 if (!N->hasNUsesOfValue(1, 0))
2280 SDValue TCChain = Chain;
2281 SDNode *Copy = *N->use_begin();
2282 if (Copy->getOpcode() == ISD::CopyToReg) {
2283 // If the copy has a glue operand, we conservatively assume it isn't safe to
2284 // perform a tail call.
2285 if (Copy->getOperand(Copy->getNumOperands()-1).getValueType() == MVT::Glue)
2287 TCChain = Copy->getOperand(0);
2288 } else if (Copy->getOpcode() != ISD::FP_EXTEND)
2291 bool HasRet = false;
2292 for (SDNode::use_iterator UI = Copy->use_begin(), UE = Copy->use_end();
2294 if (UI->getOpcode() != X86ISD::RET_FLAG)
2296 // If we are returning more than one value, we can definitely
2297 // not make a tail call see PR19530
2298 if (UI->getNumOperands() > 4)
2300 if (UI->getNumOperands() == 4 &&
2301 UI->getOperand(UI->getNumOperands()-1).getValueType() != MVT::Glue)
2314 X86TargetLowering::getTypeForExtArgOrReturn(LLVMContext &Context, EVT VT,
2315 ISD::NodeType ExtendKind) const {
2317 // TODO: Is this also valid on 32-bit?
2318 if (Subtarget->is64Bit() && VT == MVT::i1 && ExtendKind == ISD::ZERO_EXTEND)
2319 ReturnMVT = MVT::i8;
2321 ReturnMVT = MVT::i32;
2323 EVT MinVT = getRegisterType(Context, ReturnMVT);
2324 return VT.bitsLT(MinVT) ? MinVT : VT;
2327 /// Lower the result values of a call into the
2328 /// appropriate copies out of appropriate physical registers.
2331 X86TargetLowering::LowerCallResult(SDValue Chain, SDValue InFlag,
2332 CallingConv::ID CallConv, bool isVarArg,
2333 const SmallVectorImpl<ISD::InputArg> &Ins,
2334 SDLoc dl, SelectionDAG &DAG,
2335 SmallVectorImpl<SDValue> &InVals) const {
2337 // Assign locations to each value returned by this call.
2338 SmallVector<CCValAssign, 16> RVLocs;
2339 bool Is64Bit = Subtarget->is64Bit();
2340 CCState CCInfo(CallConv, isVarArg, DAG.getMachineFunction(), RVLocs,
2342 CCInfo.AnalyzeCallResult(Ins, RetCC_X86);
2344 // Copy all of the result registers out of their specified physreg.
2345 for (unsigned i = 0, e = RVLocs.size(); i != e; ++i) {
2346 CCValAssign &VA = RVLocs[i];
2347 EVT CopyVT = VA.getLocVT();
2349 // If this is x86-64, and we disabled SSE, we can't return FP values
2350 if ((CopyVT == MVT::f32 || CopyVT == MVT::f64) &&
2351 ((Is64Bit || Ins[i].Flags.isInReg()) && !Subtarget->hasSSE1())) {
2352 report_fatal_error("SSE register return with SSE disabled");
2355 // If we prefer to use the value in xmm registers, copy it out as f80 and
2356 // use a truncate to move it from fp stack reg to xmm reg.
2357 bool RoundAfterCopy = false;
2358 if ((VA.getLocReg() == X86::FP0 || VA.getLocReg() == X86::FP1) &&
2359 isScalarFPTypeInSSEReg(VA.getValVT())) {
2361 RoundAfterCopy = (CopyVT != VA.getLocVT());
2364 Chain = DAG.getCopyFromReg(Chain, dl, VA.getLocReg(),
2365 CopyVT, InFlag).getValue(1);
2366 SDValue Val = Chain.getValue(0);
2369 Val = DAG.getNode(ISD::FP_ROUND, dl, VA.getValVT(), Val,
2370 // This truncation won't change the value.
2371 DAG.getIntPtrConstant(1, dl));
2373 if (VA.isExtInLoc() && VA.getValVT().getScalarType() == MVT::i1)
2374 Val = DAG.getNode(ISD::TRUNCATE, dl, VA.getValVT(), Val);
2376 InFlag = Chain.getValue(2);
2377 InVals.push_back(Val);
2383 //===----------------------------------------------------------------------===//
2384 // C & StdCall & Fast Calling Convention implementation
2385 //===----------------------------------------------------------------------===//
2386 // StdCall calling convention seems to be standard for many Windows' API
2387 // routines and around. It differs from C calling convention just a little:
2388 // callee should clean up the stack, not caller. Symbols should be also
2389 // decorated in some fancy way :) It doesn't support any vector arguments.
2390 // For info on fast calling convention see Fast Calling Convention (tail call)
2391 // implementation LowerX86_32FastCCCallTo.
2393 /// CallIsStructReturn - Determines whether a call uses struct return
2395 enum StructReturnType {
2400 static StructReturnType
2401 callIsStructReturn(const SmallVectorImpl<ISD::OutputArg> &Outs) {
2403 return NotStructReturn;
2405 const ISD::ArgFlagsTy &Flags = Outs[0].Flags;
2406 if (!Flags.isSRet())
2407 return NotStructReturn;
2408 if (Flags.isInReg())
2409 return RegStructReturn;
2410 return StackStructReturn;
2413 /// Determines whether a function uses struct return semantics.
2414 static StructReturnType
2415 argsAreStructReturn(const SmallVectorImpl<ISD::InputArg> &Ins) {
2417 return NotStructReturn;
2419 const ISD::ArgFlagsTy &Flags = Ins[0].Flags;
2420 if (!Flags.isSRet())
2421 return NotStructReturn;
2422 if (Flags.isInReg())
2423 return RegStructReturn;
2424 return StackStructReturn;
2427 /// Make a copy of an aggregate at address specified by "Src" to address
2428 /// "Dst" with size and alignment information specified by the specific
2429 /// parameter attribute. The copy will be passed as a byval function parameter.
2431 CreateCopyOfByValArgument(SDValue Src, SDValue Dst, SDValue Chain,
2432 ISD::ArgFlagsTy Flags, SelectionDAG &DAG,
2434 SDValue SizeNode = DAG.getConstant(Flags.getByValSize(), dl, MVT::i32);
2436 return DAG.getMemcpy(Chain, dl, Dst, Src, SizeNode, Flags.getByValAlign(),
2437 /*isVolatile*/false, /*AlwaysInline=*/true,
2438 /*isTailCall*/false,
2439 MachinePointerInfo(), MachinePointerInfo());
2442 /// Return true if the calling convention is one that we can guarantee TCO for.
2443 static bool canGuaranteeTCO(CallingConv::ID CC) {
2444 return (CC == CallingConv::Fast || CC == CallingConv::GHC ||
2445 CC == CallingConv::HiPE || CC == CallingConv::HHVM);
2448 /// Return true if we might ever do TCO for calls with this calling convention.
2449 static bool mayTailCallThisCC(CallingConv::ID CC) {
2451 // C calling conventions:
2452 case CallingConv::C:
2453 case CallingConv::X86_64_Win64:
2454 case CallingConv::X86_64_SysV:
2455 // Callee pop conventions:
2456 case CallingConv::X86_ThisCall:
2457 case CallingConv::X86_StdCall:
2458 case CallingConv::X86_VectorCall:
2459 case CallingConv::X86_FastCall:
2462 return canGuaranteeTCO(CC);
2466 /// Return true if the function is being made into a tailcall target by
2467 /// changing its ABI.
2468 static bool shouldGuaranteeTCO(CallingConv::ID CC, bool GuaranteedTailCallOpt) {
2469 return GuaranteedTailCallOpt && canGuaranteeTCO(CC);
2472 bool X86TargetLowering::mayBeEmittedAsTailCall(CallInst *CI) const {
2474 CI->getParent()->getParent()->getFnAttribute("disable-tail-calls");
2475 if (!CI->isTailCall() || Attr.getValueAsString() == "true")
2479 CallingConv::ID CalleeCC = CS.getCallingConv();
2480 if (!mayTailCallThisCC(CalleeCC))
2487 X86TargetLowering::LowerMemArgument(SDValue Chain,
2488 CallingConv::ID CallConv,
2489 const SmallVectorImpl<ISD::InputArg> &Ins,
2490 SDLoc dl, SelectionDAG &DAG,
2491 const CCValAssign &VA,
2492 MachineFrameInfo *MFI,
2494 // Create the nodes corresponding to a load from this parameter slot.
2495 ISD::ArgFlagsTy Flags = Ins[i].Flags;
2496 bool AlwaysUseMutable = shouldGuaranteeTCO(
2497 CallConv, DAG.getTarget().Options.GuaranteedTailCallOpt);
2498 bool isImmutable = !AlwaysUseMutable && !Flags.isByVal();
2501 // If value is passed by pointer we have address passed instead of the value
2503 bool ExtendedInMem = VA.isExtInLoc() &&
2504 VA.getValVT().getScalarType() == MVT::i1;
2506 if (VA.getLocInfo() == CCValAssign::Indirect || ExtendedInMem)
2507 ValVT = VA.getLocVT();
2509 ValVT = VA.getValVT();
2511 // FIXME: For now, all byval parameter objects are marked mutable. This can be
2512 // changed with more analysis.
2513 // In case of tail call optimization mark all arguments mutable. Since they
2514 // could be overwritten by lowering of arguments in case of a tail call.
2515 if (Flags.isByVal()) {
2516 unsigned Bytes = Flags.getByValSize();
2517 if (Bytes == 0) Bytes = 1; // Don't create zero-sized stack objects.
2518 int FI = MFI->CreateFixedObject(Bytes, VA.getLocMemOffset(), isImmutable);
2519 return DAG.getFrameIndex(FI, getPointerTy(DAG.getDataLayout()));
2521 int FI = MFI->CreateFixedObject(ValVT.getSizeInBits()/8,
2522 VA.getLocMemOffset(), isImmutable);
2523 SDValue FIN = DAG.getFrameIndex(FI, getPointerTy(DAG.getDataLayout()));
2524 SDValue Val = DAG.getLoad(
2525 ValVT, dl, Chain, FIN,
2526 MachinePointerInfo::getFixedStack(DAG.getMachineFunction(), FI), false,
2528 return ExtendedInMem ?
2529 DAG.getNode(ISD::TRUNCATE, dl, VA.getValVT(), Val) : Val;
2533 // FIXME: Get this from tablegen.
2534 static ArrayRef<MCPhysReg> get64BitArgumentGPRs(CallingConv::ID CallConv,
2535 const X86Subtarget *Subtarget) {
2536 assert(Subtarget->is64Bit());
2538 if (Subtarget->isCallingConvWin64(CallConv)) {
2539 static const MCPhysReg GPR64ArgRegsWin64[] = {
2540 X86::RCX, X86::RDX, X86::R8, X86::R9
2542 return makeArrayRef(std::begin(GPR64ArgRegsWin64), std::end(GPR64ArgRegsWin64));
2545 static const MCPhysReg GPR64ArgRegs64Bit[] = {
2546 X86::RDI, X86::RSI, X86::RDX, X86::RCX, X86::R8, X86::R9
2548 return makeArrayRef(std::begin(GPR64ArgRegs64Bit), std::end(GPR64ArgRegs64Bit));
2551 // FIXME: Get this from tablegen.
2552 static ArrayRef<MCPhysReg> get64BitArgumentXMMs(MachineFunction &MF,
2553 CallingConv::ID CallConv,
2554 const X86Subtarget *Subtarget) {
2555 assert(Subtarget->is64Bit());
2556 if (Subtarget->isCallingConvWin64(CallConv)) {
2557 // The XMM registers which might contain var arg parameters are shadowed
2558 // in their paired GPR. So we only need to save the GPR to their home
2560 // TODO: __vectorcall will change this.
2564 const Function *Fn = MF.getFunction();
2565 bool NoImplicitFloatOps = Fn->hasFnAttribute(Attribute::NoImplicitFloat);
2566 bool isSoftFloat = Subtarget->useSoftFloat();
2567 assert(!(isSoftFloat && NoImplicitFloatOps) &&
2568 "SSE register cannot be used when SSE is disabled!");
2569 if (isSoftFloat || NoImplicitFloatOps || !Subtarget->hasSSE1())
2570 // Kernel mode asks for SSE to be disabled, so there are no XMM argument
2574 static const MCPhysReg XMMArgRegs64Bit[] = {
2575 X86::XMM0, X86::XMM1, X86::XMM2, X86::XMM3,
2576 X86::XMM4, X86::XMM5, X86::XMM6, X86::XMM7
2578 return makeArrayRef(std::begin(XMMArgRegs64Bit), std::end(XMMArgRegs64Bit));
2581 SDValue X86TargetLowering::LowerFormalArguments(
2582 SDValue Chain, CallingConv::ID CallConv, bool isVarArg,
2583 const SmallVectorImpl<ISD::InputArg> &Ins, SDLoc dl, SelectionDAG &DAG,
2584 SmallVectorImpl<SDValue> &InVals) const {
2585 MachineFunction &MF = DAG.getMachineFunction();
2586 X86MachineFunctionInfo *FuncInfo = MF.getInfo<X86MachineFunctionInfo>();
2587 const TargetFrameLowering &TFI = *Subtarget->getFrameLowering();
2589 const Function* Fn = MF.getFunction();
2590 if (Fn->hasExternalLinkage() &&
2591 Subtarget->isTargetCygMing() &&
2592 Fn->getName() == "main")
2593 FuncInfo->setForceFramePointer(true);
2595 MachineFrameInfo *MFI = MF.getFrameInfo();
2596 bool Is64Bit = Subtarget->is64Bit();
2597 bool IsWin64 = Subtarget->isCallingConvWin64(CallConv);
2599 assert(!(isVarArg && canGuaranteeTCO(CallConv)) &&
2600 "Var args not supported with calling convention fastcc, ghc or hipe");
2602 // Assign locations to all of the incoming arguments.
2603 SmallVector<CCValAssign, 16> ArgLocs;
2604 CCState CCInfo(CallConv, isVarArg, MF, ArgLocs, *DAG.getContext());
2606 // Allocate shadow area for Win64
2608 CCInfo.AllocateStack(32, 8);
2610 CCInfo.AnalyzeFormalArguments(Ins, CC_X86);
2612 unsigned LastVal = ~0U;
2614 for (unsigned i = 0, e = ArgLocs.size(); i != e; ++i) {
2615 CCValAssign &VA = ArgLocs[i];
2616 // TODO: If an arg is passed in two places (e.g. reg and stack), skip later
2618 assert(VA.getValNo() != LastVal &&
2619 "Don't support value assigned to multiple locs yet");
2621 LastVal = VA.getValNo();
2623 if (VA.isRegLoc()) {
2624 EVT RegVT = VA.getLocVT();
2625 const TargetRegisterClass *RC;
2626 if (RegVT == MVT::i32)
2627 RC = &X86::GR32RegClass;
2628 else if (Is64Bit && RegVT == MVT::i64)
2629 RC = &X86::GR64RegClass;
2630 else if (RegVT == MVT::f32)
2631 RC = &X86::FR32RegClass;
2632 else if (RegVT == MVT::f64)
2633 RC = &X86::FR64RegClass;
2634 else if (RegVT.is512BitVector())
2635 RC = &X86::VR512RegClass;
2636 else if (RegVT.is256BitVector())
2637 RC = &X86::VR256RegClass;
2638 else if (RegVT.is128BitVector())
2639 RC = &X86::VR128RegClass;
2640 else if (RegVT == MVT::x86mmx)
2641 RC = &X86::VR64RegClass;
2642 else if (RegVT == MVT::i1)
2643 RC = &X86::VK1RegClass;
2644 else if (RegVT == MVT::v8i1)
2645 RC = &X86::VK8RegClass;
2646 else if (RegVT == MVT::v16i1)
2647 RC = &X86::VK16RegClass;
2648 else if (RegVT == MVT::v32i1)
2649 RC = &X86::VK32RegClass;
2650 else if (RegVT == MVT::v64i1)
2651 RC = &X86::VK64RegClass;
2653 llvm_unreachable("Unknown argument type!");
2655 unsigned Reg = MF.addLiveIn(VA.getLocReg(), RC);
2656 ArgValue = DAG.getCopyFromReg(Chain, dl, Reg, RegVT);
2658 // If this is an 8 or 16-bit value, it is really passed promoted to 32
2659 // bits. Insert an assert[sz]ext to capture this, then truncate to the
2661 if (VA.getLocInfo() == CCValAssign::SExt)
2662 ArgValue = DAG.getNode(ISD::AssertSext, dl, RegVT, ArgValue,
2663 DAG.getValueType(VA.getValVT()));
2664 else if (VA.getLocInfo() == CCValAssign::ZExt)
2665 ArgValue = DAG.getNode(ISD::AssertZext, dl, RegVT, ArgValue,
2666 DAG.getValueType(VA.getValVT()));
2667 else if (VA.getLocInfo() == CCValAssign::BCvt)
2668 ArgValue = DAG.getBitcast(VA.getValVT(), ArgValue);
2670 if (VA.isExtInLoc()) {
2671 // Handle MMX values passed in XMM regs.
2672 if (RegVT.isVector() && VA.getValVT().getScalarType() != MVT::i1)
2673 ArgValue = DAG.getNode(X86ISD::MOVDQ2Q, dl, VA.getValVT(), ArgValue);
2675 ArgValue = DAG.getNode(ISD::TRUNCATE, dl, VA.getValVT(), ArgValue);
2678 assert(VA.isMemLoc());
2679 ArgValue = LowerMemArgument(Chain, CallConv, Ins, dl, DAG, VA, MFI, i);
2682 // If value is passed via pointer - do a load.
2683 if (VA.getLocInfo() == CCValAssign::Indirect)
2684 ArgValue = DAG.getLoad(VA.getValVT(), dl, Chain, ArgValue,
2685 MachinePointerInfo(), false, false, false, 0);
2687 InVals.push_back(ArgValue);
2690 for (unsigned i = 0, e = ArgLocs.size(); i != e; ++i) {
2691 // All x86 ABIs require that for returning structs by value we copy the
2692 // sret argument into %rax/%eax (depending on ABI) for the return. Save
2693 // the argument into a virtual register so that we can access it from the
2695 if (Ins[i].Flags.isSRet()) {
2696 unsigned Reg = FuncInfo->getSRetReturnReg();
2698 MVT PtrTy = getPointerTy(DAG.getDataLayout());
2699 Reg = MF.getRegInfo().createVirtualRegister(getRegClassFor(PtrTy));
2700 FuncInfo->setSRetReturnReg(Reg);
2702 SDValue Copy = DAG.getCopyToReg(DAG.getEntryNode(), dl, Reg, InVals[i]);
2703 Chain = DAG.getNode(ISD::TokenFactor, dl, MVT::Other, Copy, Chain);
2708 unsigned StackSize = CCInfo.getNextStackOffset();
2709 // Align stack specially for tail calls.
2710 if (shouldGuaranteeTCO(CallConv,
2711 MF.getTarget().Options.GuaranteedTailCallOpt))
2712 StackSize = GetAlignedArgumentStackSize(StackSize, DAG);
2714 // If the function takes variable number of arguments, make a frame index for
2715 // the start of the first vararg value... for expansion of llvm.va_start. We
2716 // can skip this if there are no va_start calls.
2717 if (MFI->hasVAStart() &&
2718 (Is64Bit || (CallConv != CallingConv::X86_FastCall &&
2719 CallConv != CallingConv::X86_ThisCall))) {
2720 FuncInfo->setVarArgsFrameIndex(
2721 MFI->CreateFixedObject(1, StackSize, true));
2724 MachineModuleInfo &MMI = MF.getMMI();
2726 // Figure out if XMM registers are in use.
2727 assert(!(Subtarget->useSoftFloat() &&
2728 Fn->hasFnAttribute(Attribute::NoImplicitFloat)) &&
2729 "SSE register cannot be used when SSE is disabled!");
2731 // 64-bit calling conventions support varargs and register parameters, so we
2732 // have to do extra work to spill them in the prologue.
2733 if (Is64Bit && isVarArg && MFI->hasVAStart()) {
2734 // Find the first unallocated argument registers.
2735 ArrayRef<MCPhysReg> ArgGPRs = get64BitArgumentGPRs(CallConv, Subtarget);
2736 ArrayRef<MCPhysReg> ArgXMMs = get64BitArgumentXMMs(MF, CallConv, Subtarget);
2737 unsigned NumIntRegs = CCInfo.getFirstUnallocated(ArgGPRs);
2738 unsigned NumXMMRegs = CCInfo.getFirstUnallocated(ArgXMMs);
2739 assert(!(NumXMMRegs && !Subtarget->hasSSE1()) &&
2740 "SSE register cannot be used when SSE is disabled!");
2742 // Gather all the live in physical registers.
2743 SmallVector<SDValue, 6> LiveGPRs;
2744 SmallVector<SDValue, 8> LiveXMMRegs;
2746 for (MCPhysReg Reg : ArgGPRs.slice(NumIntRegs)) {
2747 unsigned GPR = MF.addLiveIn(Reg, &X86::GR64RegClass);
2749 DAG.getCopyFromReg(Chain, dl, GPR, MVT::i64));
2751 if (!ArgXMMs.empty()) {
2752 unsigned AL = MF.addLiveIn(X86::AL, &X86::GR8RegClass);
2753 ALVal = DAG.getCopyFromReg(Chain, dl, AL, MVT::i8);
2754 for (MCPhysReg Reg : ArgXMMs.slice(NumXMMRegs)) {
2755 unsigned XMMReg = MF.addLiveIn(Reg, &X86::VR128RegClass);
2756 LiveXMMRegs.push_back(
2757 DAG.getCopyFromReg(Chain, dl, XMMReg, MVT::v4f32));
2762 // Get to the caller-allocated home save location. Add 8 to account
2763 // for the return address.
2764 int HomeOffset = TFI.getOffsetOfLocalArea() + 8;
2765 FuncInfo->setRegSaveFrameIndex(
2766 MFI->CreateFixedObject(1, NumIntRegs * 8 + HomeOffset, false));
2767 // Fixup to set vararg frame on shadow area (4 x i64).
2769 FuncInfo->setVarArgsFrameIndex(FuncInfo->getRegSaveFrameIndex());
2771 // For X86-64, if there are vararg parameters that are passed via
2772 // registers, then we must store them to their spots on the stack so
2773 // they may be loaded by deferencing the result of va_next.
2774 FuncInfo->setVarArgsGPOffset(NumIntRegs * 8);
2775 FuncInfo->setVarArgsFPOffset(ArgGPRs.size() * 8 + NumXMMRegs * 16);
2776 FuncInfo->setRegSaveFrameIndex(MFI->CreateStackObject(
2777 ArgGPRs.size() * 8 + ArgXMMs.size() * 16, 16, false));
2780 // Store the integer parameter registers.
2781 SmallVector<SDValue, 8> MemOps;
2782 SDValue RSFIN = DAG.getFrameIndex(FuncInfo->getRegSaveFrameIndex(),
2783 getPointerTy(DAG.getDataLayout()));
2784 unsigned Offset = FuncInfo->getVarArgsGPOffset();
2785 for (SDValue Val : LiveGPRs) {
2786 SDValue FIN = DAG.getNode(ISD::ADD, dl, getPointerTy(DAG.getDataLayout()),
2787 RSFIN, DAG.getIntPtrConstant(Offset, dl));
2789 DAG.getStore(Val.getValue(1), dl, Val, FIN,
2790 MachinePointerInfo::getFixedStack(
2791 DAG.getMachineFunction(),
2792 FuncInfo->getRegSaveFrameIndex(), Offset),
2794 MemOps.push_back(Store);
2798 if (!ArgXMMs.empty() && NumXMMRegs != ArgXMMs.size()) {
2799 // Now store the XMM (fp + vector) parameter registers.
2800 SmallVector<SDValue, 12> SaveXMMOps;
2801 SaveXMMOps.push_back(Chain);
2802 SaveXMMOps.push_back(ALVal);
2803 SaveXMMOps.push_back(DAG.getIntPtrConstant(
2804 FuncInfo->getRegSaveFrameIndex(), dl));
2805 SaveXMMOps.push_back(DAG.getIntPtrConstant(
2806 FuncInfo->getVarArgsFPOffset(), dl));
2807 SaveXMMOps.insert(SaveXMMOps.end(), LiveXMMRegs.begin(),
2809 MemOps.push_back(DAG.getNode(X86ISD::VASTART_SAVE_XMM_REGS, dl,
2810 MVT::Other, SaveXMMOps));
2813 if (!MemOps.empty())
2814 Chain = DAG.getNode(ISD::TokenFactor, dl, MVT::Other, MemOps);
2817 if (isVarArg && MFI->hasMustTailInVarArgFunc()) {
2818 // Find the largest legal vector type.
2819 MVT VecVT = MVT::Other;
2820 // FIXME: Only some x86_32 calling conventions support AVX512.
2821 if (Subtarget->hasAVX512() &&
2822 (Is64Bit || (CallConv == CallingConv::X86_VectorCall ||
2823 CallConv == CallingConv::Intel_OCL_BI)))
2824 VecVT = MVT::v16f32;
2825 else if (Subtarget->hasAVX())
2827 else if (Subtarget->hasSSE2())
2830 // We forward some GPRs and some vector types.
2831 SmallVector<MVT, 2> RegParmTypes;
2832 MVT IntVT = Is64Bit ? MVT::i64 : MVT::i32;
2833 RegParmTypes.push_back(IntVT);
2834 if (VecVT != MVT::Other)
2835 RegParmTypes.push_back(VecVT);
2837 // Compute the set of forwarded registers. The rest are scratch.
2838 SmallVectorImpl<ForwardedRegister> &Forwards =
2839 FuncInfo->getForwardedMustTailRegParms();
2840 CCInfo.analyzeMustTailForwardedRegisters(Forwards, RegParmTypes, CC_X86);
2842 // Conservatively forward AL on x86_64, since it might be used for varargs.
2843 if (Is64Bit && !CCInfo.isAllocated(X86::AL)) {
2844 unsigned ALVReg = MF.addLiveIn(X86::AL, &X86::GR8RegClass);
2845 Forwards.push_back(ForwardedRegister(ALVReg, X86::AL, MVT::i8));
2848 // Copy all forwards from physical to virtual registers.
2849 for (ForwardedRegister &F : Forwards) {
2850 // FIXME: Can we use a less constrained schedule?
2851 SDValue RegVal = DAG.getCopyFromReg(Chain, dl, F.VReg, F.VT);
2852 F.VReg = MF.getRegInfo().createVirtualRegister(getRegClassFor(F.VT));
2853 Chain = DAG.getCopyToReg(Chain, dl, F.VReg, RegVal);
2857 // Some CCs need callee pop.
2858 if (X86::isCalleePop(CallConv, Is64Bit, isVarArg,
2859 MF.getTarget().Options.GuaranteedTailCallOpt)) {
2860 FuncInfo->setBytesToPopOnReturn(StackSize); // Callee pops everything.
2862 FuncInfo->setBytesToPopOnReturn(0); // Callee pops nothing.
2863 // If this is an sret function, the return should pop the hidden pointer.
2864 if (!Is64Bit && !canGuaranteeTCO(CallConv) &&
2865 !Subtarget->getTargetTriple().isOSMSVCRT() &&
2866 argsAreStructReturn(Ins) == StackStructReturn)
2867 FuncInfo->setBytesToPopOnReturn(4);
2871 // RegSaveFrameIndex is X86-64 only.
2872 FuncInfo->setRegSaveFrameIndex(0xAAAAAAA);
2873 if (CallConv == CallingConv::X86_FastCall ||
2874 CallConv == CallingConv::X86_ThisCall)
2875 // fastcc functions can't have varargs.
2876 FuncInfo->setVarArgsFrameIndex(0xAAAAAAA);
2879 FuncInfo->setArgumentStackSize(StackSize);
2881 if (MMI.hasWinEHFuncInfo(Fn)) {
2882 EHPersonality Personality = classifyEHPersonality(Fn->getPersonalityFn());
2883 if (Personality == EHPersonality::CoreCLR) {
2885 // TODO: Add a mechanism to frame lowering that will allow us to indicate
2886 // that we'd prefer this slot be allocated towards the bottom of the frame
2887 // (i.e. near the stack pointer after allocating the frame). Every
2888 // funclet needs a copy of this slot in its (mostly empty) frame, and the
2889 // offset from the bottom of this and each funclet's frame must be the
2890 // same, so the size of funclets' (mostly empty) frames is dictated by
2891 // how far this slot is from the bottom (since they allocate just enough
2892 // space to accomodate holding this slot at the correct offset).
2893 int PSPSymFI = MFI->CreateStackObject(8, 8, /*isSS=*/false);
2894 MMI.getWinEHFuncInfo(MF.getFunction()).PSPSymFrameIdx = PSPSymFI;
2902 X86TargetLowering::LowerMemOpCallTo(SDValue Chain,
2903 SDValue StackPtr, SDValue Arg,
2904 SDLoc dl, SelectionDAG &DAG,
2905 const CCValAssign &VA,
2906 ISD::ArgFlagsTy Flags) const {
2907 unsigned LocMemOffset = VA.getLocMemOffset();
2908 SDValue PtrOff = DAG.getIntPtrConstant(LocMemOffset, dl);
2909 PtrOff = DAG.getNode(ISD::ADD, dl, getPointerTy(DAG.getDataLayout()),
2911 if (Flags.isByVal())
2912 return CreateCopyOfByValArgument(Arg, PtrOff, Chain, Flags, DAG, dl);
2914 return DAG.getStore(
2915 Chain, dl, Arg, PtrOff,
2916 MachinePointerInfo::getStack(DAG.getMachineFunction(), LocMemOffset),
2920 /// Emit a load of return address if tail call
2921 /// optimization is performed and it is required.
2923 X86TargetLowering::EmitTailCallLoadRetAddr(SelectionDAG &DAG,
2924 SDValue &OutRetAddr, SDValue Chain,
2925 bool IsTailCall, bool Is64Bit,
2926 int FPDiff, SDLoc dl) const {
2927 // Adjust the Return address stack slot.
2928 EVT VT = getPointerTy(DAG.getDataLayout());
2929 OutRetAddr = getReturnAddressFrameIndex(DAG);
2931 // Load the "old" Return address.
2932 OutRetAddr = DAG.getLoad(VT, dl, Chain, OutRetAddr, MachinePointerInfo(),
2933 false, false, false, 0);
2934 return SDValue(OutRetAddr.getNode(), 1);
2937 /// Emit a store of the return address if tail call
2938 /// optimization is performed and it is required (FPDiff!=0).
2939 static SDValue EmitTailCallStoreRetAddr(SelectionDAG &DAG, MachineFunction &MF,
2940 SDValue Chain, SDValue RetAddrFrIdx,
2941 EVT PtrVT, unsigned SlotSize,
2942 int FPDiff, SDLoc dl) {
2943 // Store the return address to the appropriate stack slot.
2944 if (!FPDiff) return Chain;
2945 // Calculate the new stack slot for the return address.
2946 int NewReturnAddrFI =
2947 MF.getFrameInfo()->CreateFixedObject(SlotSize, (int64_t)FPDiff - SlotSize,
2949 SDValue NewRetAddrFrIdx = DAG.getFrameIndex(NewReturnAddrFI, PtrVT);
2950 Chain = DAG.getStore(Chain, dl, RetAddrFrIdx, NewRetAddrFrIdx,
2951 MachinePointerInfo::getFixedStack(
2952 DAG.getMachineFunction(), NewReturnAddrFI),
2957 /// Returns a vector_shuffle mask for an movs{s|d}, movd
2958 /// operation of specified width.
2959 static SDValue getMOVL(SelectionDAG &DAG, SDLoc dl, MVT VT, SDValue V1,
2961 unsigned NumElems = VT.getVectorNumElements();
2962 SmallVector<int, 8> Mask;
2963 Mask.push_back(NumElems);
2964 for (unsigned i = 1; i != NumElems; ++i)
2966 return DAG.getVectorShuffle(VT, dl, V1, V2, &Mask[0]);
2970 X86TargetLowering::LowerCall(TargetLowering::CallLoweringInfo &CLI,
2971 SmallVectorImpl<SDValue> &InVals) const {
2972 SelectionDAG &DAG = CLI.DAG;
2974 SmallVectorImpl<ISD::OutputArg> &Outs = CLI.Outs;
2975 SmallVectorImpl<SDValue> &OutVals = CLI.OutVals;
2976 SmallVectorImpl<ISD::InputArg> &Ins = CLI.Ins;
2977 SDValue Chain = CLI.Chain;
2978 SDValue Callee = CLI.Callee;
2979 CallingConv::ID CallConv = CLI.CallConv;
2980 bool &isTailCall = CLI.IsTailCall;
2981 bool isVarArg = CLI.IsVarArg;
2983 MachineFunction &MF = DAG.getMachineFunction();
2984 bool Is64Bit = Subtarget->is64Bit();
2985 bool IsWin64 = Subtarget->isCallingConvWin64(CallConv);
2986 StructReturnType SR = callIsStructReturn(Outs);
2987 bool IsSibcall = false;
2988 X86MachineFunctionInfo *X86Info = MF.getInfo<X86MachineFunctionInfo>();
2989 auto Attr = MF.getFunction()->getFnAttribute("disable-tail-calls");
2991 if (Attr.getValueAsString() == "true")
2994 if (Subtarget->isPICStyleGOT() &&
2995 !MF.getTarget().Options.GuaranteedTailCallOpt) {
2996 // If we are using a GOT, disable tail calls to external symbols with
2997 // default visibility. Tail calling such a symbol requires using a GOT
2998 // relocation, which forces early binding of the symbol. This breaks code
2999 // that require lazy function symbol resolution. Using musttail or
3000 // GuaranteedTailCallOpt will override this.
3001 GlobalAddressSDNode *G = dyn_cast<GlobalAddressSDNode>(Callee);
3002 if (!G || (!G->getGlobal()->hasLocalLinkage() &&
3003 G->getGlobal()->hasDefaultVisibility()))
3007 bool IsMustTail = CLI.CS && CLI.CS->isMustTailCall();
3009 // Force this to be a tail call. The verifier rules are enough to ensure
3010 // that we can lower this successfully without moving the return address
3013 } else if (isTailCall) {
3014 // Check if it's really possible to do a tail call.
3015 isTailCall = IsEligibleForTailCallOptimization(Callee, CallConv,
3016 isVarArg, SR != NotStructReturn,
3017 MF.getFunction()->hasStructRetAttr(), CLI.RetTy,
3018 Outs, OutVals, Ins, DAG);
3020 // Sibcalls are automatically detected tailcalls which do not require
3022 if (!MF.getTarget().Options.GuaranteedTailCallOpt && isTailCall)
3029 assert(!(isVarArg && canGuaranteeTCO(CallConv)) &&
3030 "Var args not supported with calling convention fastcc, ghc or hipe");
3032 // Analyze operands of the call, assigning locations to each operand.
3033 SmallVector<CCValAssign, 16> ArgLocs;
3034 CCState CCInfo(CallConv, isVarArg, MF, ArgLocs, *DAG.getContext());
3036 // Allocate shadow area for Win64
3038 CCInfo.AllocateStack(32, 8);
3040 CCInfo.AnalyzeCallOperands(Outs, CC_X86);
3042 // Get a count of how many bytes are to be pushed on the stack.
3043 unsigned NumBytes = CCInfo.getAlignedCallFrameSize();
3045 // This is a sibcall. The memory operands are available in caller's
3046 // own caller's stack.
3048 else if (MF.getTarget().Options.GuaranteedTailCallOpt &&
3049 canGuaranteeTCO(CallConv))
3050 NumBytes = GetAlignedArgumentStackSize(NumBytes, DAG);
3053 if (isTailCall && !IsSibcall && !IsMustTail) {
3054 // Lower arguments at fp - stackoffset + fpdiff.
3055 unsigned NumBytesCallerPushed = X86Info->getBytesToPopOnReturn();
3057 FPDiff = NumBytesCallerPushed - NumBytes;
3059 // Set the delta of movement of the returnaddr stackslot.
3060 // But only set if delta is greater than previous delta.
3061 if (FPDiff < X86Info->getTCReturnAddrDelta())
3062 X86Info->setTCReturnAddrDelta(FPDiff);
3065 unsigned NumBytesToPush = NumBytes;
3066 unsigned NumBytesToPop = NumBytes;
3068 // If we have an inalloca argument, all stack space has already been allocated
3069 // for us and be right at the top of the stack. We don't support multiple
3070 // arguments passed in memory when using inalloca.
3071 if (!Outs.empty() && Outs.back().Flags.isInAlloca()) {
3073 if (!ArgLocs.back().isMemLoc())
3074 report_fatal_error("cannot use inalloca attribute on a register "
3076 if (ArgLocs.back().getLocMemOffset() != 0)
3077 report_fatal_error("any parameter with the inalloca attribute must be "
3078 "the only memory argument");
3082 Chain = DAG.getCALLSEQ_START(
3083 Chain, DAG.getIntPtrConstant(NumBytesToPush, dl, true), dl);
3085 SDValue RetAddrFrIdx;
3086 // Load return address for tail calls.
3087 if (isTailCall && FPDiff)
3088 Chain = EmitTailCallLoadRetAddr(DAG, RetAddrFrIdx, Chain, isTailCall,
3089 Is64Bit, FPDiff, dl);
3091 SmallVector<std::pair<unsigned, SDValue>, 8> RegsToPass;
3092 SmallVector<SDValue, 8> MemOpChains;
3095 // Walk the register/memloc assignments, inserting copies/loads. In the case
3096 // of tail call optimization arguments are handle later.
3097 const X86RegisterInfo *RegInfo = Subtarget->getRegisterInfo();
3098 for (unsigned i = 0, e = ArgLocs.size(); i != e; ++i) {
3099 // Skip inalloca arguments, they have already been written.
3100 ISD::ArgFlagsTy Flags = Outs[i].Flags;
3101 if (Flags.isInAlloca())
3104 CCValAssign &VA = ArgLocs[i];
3105 EVT RegVT = VA.getLocVT();
3106 SDValue Arg = OutVals[i];
3107 bool isByVal = Flags.isByVal();
3109 // Promote the value if needed.
3110 switch (VA.getLocInfo()) {
3111 default: llvm_unreachable("Unknown loc info!");
3112 case CCValAssign::Full: break;
3113 case CCValAssign::SExt:
3114 Arg = DAG.getNode(ISD::SIGN_EXTEND, dl, RegVT, Arg);
3116 case CCValAssign::ZExt:
3117 Arg = DAG.getNode(ISD::ZERO_EXTEND, dl, RegVT, Arg);
3119 case CCValAssign::AExt:
3120 if (Arg.getValueType().isVector() &&
3121 Arg.getValueType().getVectorElementType() == MVT::i1)
3122 Arg = DAG.getNode(ISD::SIGN_EXTEND, dl, RegVT, Arg);
3123 else if (RegVT.is128BitVector()) {
3124 // Special case: passing MMX values in XMM registers.
3125 Arg = DAG.getBitcast(MVT::i64, Arg);
3126 Arg = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, MVT::v2i64, Arg);
3127 Arg = getMOVL(DAG, dl, MVT::v2i64, DAG.getUNDEF(MVT::v2i64), Arg);
3129 Arg = DAG.getNode(ISD::ANY_EXTEND, dl, RegVT, Arg);
3131 case CCValAssign::BCvt:
3132 Arg = DAG.getBitcast(RegVT, Arg);
3134 case CCValAssign::Indirect: {
3135 // Store the argument.
3136 SDValue SpillSlot = DAG.CreateStackTemporary(VA.getValVT());
3137 int FI = cast<FrameIndexSDNode>(SpillSlot)->getIndex();
3138 Chain = DAG.getStore(
3139 Chain, dl, Arg, SpillSlot,
3140 MachinePointerInfo::getFixedStack(DAG.getMachineFunction(), FI),
3147 if (VA.isRegLoc()) {
3148 RegsToPass.push_back(std::make_pair(VA.getLocReg(), Arg));
3149 if (isVarArg && IsWin64) {
3150 // Win64 ABI requires argument XMM reg to be copied to the corresponding
3151 // shadow reg if callee is a varargs function.
3152 unsigned ShadowReg = 0;
3153 switch (VA.getLocReg()) {
3154 case X86::XMM0: ShadowReg = X86::RCX; break;
3155 case X86::XMM1: ShadowReg = X86::RDX; break;
3156 case X86::XMM2: ShadowReg = X86::R8; break;
3157 case X86::XMM3: ShadowReg = X86::R9; break;
3160 RegsToPass.push_back(std::make_pair(ShadowReg, Arg));
3162 } else if (!IsSibcall && (!isTailCall || isByVal)) {
3163 assert(VA.isMemLoc());
3164 if (!StackPtr.getNode())
3165 StackPtr = DAG.getCopyFromReg(Chain, dl, RegInfo->getStackRegister(),
3166 getPointerTy(DAG.getDataLayout()));
3167 MemOpChains.push_back(LowerMemOpCallTo(Chain, StackPtr, Arg,
3168 dl, DAG, VA, Flags));
3172 if (!MemOpChains.empty())
3173 Chain = DAG.getNode(ISD::TokenFactor, dl, MVT::Other, MemOpChains);
3175 if (Subtarget->isPICStyleGOT()) {
3176 // ELF / PIC requires GOT in the EBX register before function calls via PLT
3179 RegsToPass.push_back(std::make_pair(
3180 unsigned(X86::EBX), DAG.getNode(X86ISD::GlobalBaseReg, SDLoc(),
3181 getPointerTy(DAG.getDataLayout()))));
3183 // If we are tail calling and generating PIC/GOT style code load the
3184 // address of the callee into ECX. The value in ecx is used as target of
3185 // the tail jump. This is done to circumvent the ebx/callee-saved problem
3186 // for tail calls on PIC/GOT architectures. Normally we would just put the
3187 // address of GOT into ebx and then call target@PLT. But for tail calls
3188 // ebx would be restored (since ebx is callee saved) before jumping to the
3191 // Note: The actual moving to ECX is done further down.
3192 GlobalAddressSDNode *G = dyn_cast<GlobalAddressSDNode>(Callee);
3193 if (G && !G->getGlobal()->hasLocalLinkage() &&
3194 G->getGlobal()->hasDefaultVisibility())
3195 Callee = LowerGlobalAddress(Callee, DAG);
3196 else if (isa<ExternalSymbolSDNode>(Callee))
3197 Callee = LowerExternalSymbol(Callee, DAG);
3201 if (Is64Bit && isVarArg && !IsWin64 && !IsMustTail) {
3202 // From AMD64 ABI document:
3203 // For calls that may call functions that use varargs or stdargs
3204 // (prototype-less calls or calls to functions containing ellipsis (...) in
3205 // the declaration) %al is used as hidden argument to specify the number
3206 // of SSE registers used. The contents of %al do not need to match exactly
3207 // the number of registers, but must be an ubound on the number of SSE
3208 // registers used and is in the range 0 - 8 inclusive.
3210 // Count the number of XMM registers allocated.
3211 static const MCPhysReg XMMArgRegs[] = {
3212 X86::XMM0, X86::XMM1, X86::XMM2, X86::XMM3,
3213 X86::XMM4, X86::XMM5, X86::XMM6, X86::XMM7
3215 unsigned NumXMMRegs = CCInfo.getFirstUnallocated(XMMArgRegs);
3216 assert((Subtarget->hasSSE1() || !NumXMMRegs)
3217 && "SSE registers cannot be used when SSE is disabled");
3219 RegsToPass.push_back(std::make_pair(unsigned(X86::AL),
3220 DAG.getConstant(NumXMMRegs, dl,
3224 if (isVarArg && IsMustTail) {
3225 const auto &Forwards = X86Info->getForwardedMustTailRegParms();
3226 for (const auto &F : Forwards) {
3227 SDValue Val = DAG.getCopyFromReg(Chain, dl, F.VReg, F.VT);
3228 RegsToPass.push_back(std::make_pair(unsigned(F.PReg), Val));
3232 // For tail calls lower the arguments to the 'real' stack slots. Sibcalls
3233 // don't need this because the eligibility check rejects calls that require
3234 // shuffling arguments passed in memory.
3235 if (!IsSibcall && isTailCall) {
3236 // Force all the incoming stack arguments to be loaded from the stack
3237 // before any new outgoing arguments are stored to the stack, because the
3238 // outgoing stack slots may alias the incoming argument stack slots, and
3239 // the alias isn't otherwise explicit. This is slightly more conservative
3240 // than necessary, because it means that each store effectively depends
3241 // on every argument instead of just those arguments it would clobber.
3242 SDValue ArgChain = DAG.getStackArgumentTokenFactor(Chain);
3244 SmallVector<SDValue, 8> MemOpChains2;
3247 for (unsigned i = 0, e = ArgLocs.size(); i != e; ++i) {
3248 CCValAssign &VA = ArgLocs[i];
3251 assert(VA.isMemLoc());
3252 SDValue Arg = OutVals[i];
3253 ISD::ArgFlagsTy Flags = Outs[i].Flags;
3254 // Skip inalloca arguments. They don't require any work.
3255 if (Flags.isInAlloca())
3257 // Create frame index.
3258 int32_t Offset = VA.getLocMemOffset()+FPDiff;
3259 uint32_t OpSize = (VA.getLocVT().getSizeInBits()+7)/8;
3260 FI = MF.getFrameInfo()->CreateFixedObject(OpSize, Offset, true);
3261 FIN = DAG.getFrameIndex(FI, getPointerTy(DAG.getDataLayout()));
3263 if (Flags.isByVal()) {
3264 // Copy relative to framepointer.
3265 SDValue Source = DAG.getIntPtrConstant(VA.getLocMemOffset(), dl);
3266 if (!StackPtr.getNode())
3267 StackPtr = DAG.getCopyFromReg(Chain, dl, RegInfo->getStackRegister(),
3268 getPointerTy(DAG.getDataLayout()));
3269 Source = DAG.getNode(ISD::ADD, dl, getPointerTy(DAG.getDataLayout()),
3272 MemOpChains2.push_back(CreateCopyOfByValArgument(Source, FIN,
3276 // Store relative to framepointer.
3277 MemOpChains2.push_back(DAG.getStore(
3278 ArgChain, dl, Arg, FIN,
3279 MachinePointerInfo::getFixedStack(DAG.getMachineFunction(), FI),
3284 if (!MemOpChains2.empty())
3285 Chain = DAG.getNode(ISD::TokenFactor, dl, MVT::Other, MemOpChains2);
3287 // Store the return address to the appropriate stack slot.
3288 Chain = EmitTailCallStoreRetAddr(DAG, MF, Chain, RetAddrFrIdx,
3289 getPointerTy(DAG.getDataLayout()),
3290 RegInfo->getSlotSize(), FPDiff, dl);
3293 // Build a sequence of copy-to-reg nodes chained together with token chain
3294 // and flag operands which copy the outgoing args into registers.
3296 for (unsigned i = 0, e = RegsToPass.size(); i != e; ++i) {
3297 Chain = DAG.getCopyToReg(Chain, dl, RegsToPass[i].first,
3298 RegsToPass[i].second, InFlag);
3299 InFlag = Chain.getValue(1);
3302 if (DAG.getTarget().getCodeModel() == CodeModel::Large) {
3303 assert(Is64Bit && "Large code model is only legal in 64-bit mode.");
3304 // In the 64-bit large code model, we have to make all calls
3305 // through a register, since the call instruction's 32-bit
3306 // pc-relative offset may not be large enough to hold the whole
3308 } else if (Callee->getOpcode() == ISD::GlobalAddress) {
3309 // If the callee is a GlobalAddress node (quite common, every direct call
3310 // is) turn it into a TargetGlobalAddress node so that legalize doesn't hack
3312 GlobalAddressSDNode* G = cast<GlobalAddressSDNode>(Callee);
3314 // We should use extra load for direct calls to dllimported functions in
3316 const GlobalValue *GV = G->getGlobal();
3317 if (!GV->hasDLLImportStorageClass()) {
3318 unsigned char OpFlags = 0;
3319 bool ExtraLoad = false;
3320 unsigned WrapperKind = ISD::DELETED_NODE;
3322 // On ELF targets, in both X86-64 and X86-32 mode, direct calls to
3323 // external symbols most go through the PLT in PIC mode. If the symbol
3324 // has hidden or protected visibility, or if it is static or local, then
3325 // we don't need to use the PLT - we can directly call it.
3326 if (Subtarget->isTargetELF() &&
3327 DAG.getTarget().getRelocationModel() == Reloc::PIC_ &&
3328 GV->hasDefaultVisibility() && !GV->hasLocalLinkage()) {
3329 OpFlags = X86II::MO_PLT;
3330 } else if (Subtarget->isPICStyleStubAny() &&
3331 !GV->isStrongDefinitionForLinker() &&
3332 (!Subtarget->getTargetTriple().isMacOSX() ||
3333 Subtarget->getTargetTriple().isMacOSXVersionLT(10, 5))) {
3334 // PC-relative references to external symbols should go through $stub,
3335 // unless we're building with the leopard linker or later, which
3336 // automatically synthesizes these stubs.
3337 OpFlags = X86II::MO_DARWIN_STUB;
3338 } else if (Subtarget->isPICStyleRIPRel() && isa<Function>(GV) &&
3339 cast<Function>(GV)->hasFnAttribute(Attribute::NonLazyBind)) {
3340 // If the function is marked as non-lazy, generate an indirect call
3341 // which loads from the GOT directly. This avoids runtime overhead
3342 // at the cost of eager binding (and one extra byte of encoding).
3343 OpFlags = X86II::MO_GOTPCREL;
3344 WrapperKind = X86ISD::WrapperRIP;
3348 Callee = DAG.getTargetGlobalAddress(
3349 GV, dl, getPointerTy(DAG.getDataLayout()), G->getOffset(), OpFlags);
3351 // Add a wrapper if needed.
3352 if (WrapperKind != ISD::DELETED_NODE)
3353 Callee = DAG.getNode(X86ISD::WrapperRIP, dl,
3354 getPointerTy(DAG.getDataLayout()), Callee);
3355 // Add extra indirection if needed.
3357 Callee = DAG.getLoad(
3358 getPointerTy(DAG.getDataLayout()), dl, DAG.getEntryNode(), Callee,
3359 MachinePointerInfo::getGOT(DAG.getMachineFunction()), false, false,
3362 } else if (ExternalSymbolSDNode *S = dyn_cast<ExternalSymbolSDNode>(Callee)) {
3363 unsigned char OpFlags = 0;
3365 // On ELF targets, in either X86-64 or X86-32 mode, direct calls to
3366 // external symbols should go through the PLT.
3367 if (Subtarget->isTargetELF() &&
3368 DAG.getTarget().getRelocationModel() == Reloc::PIC_) {
3369 OpFlags = X86II::MO_PLT;
3370 } else if (Subtarget->isPICStyleStubAny() &&
3371 (!Subtarget->getTargetTriple().isMacOSX() ||
3372 Subtarget->getTargetTriple().isMacOSXVersionLT(10, 5))) {
3373 // PC-relative references to external symbols should go through $stub,
3374 // unless we're building with the leopard linker or later, which
3375 // automatically synthesizes these stubs.
3376 OpFlags = X86II::MO_DARWIN_STUB;
3379 Callee = DAG.getTargetExternalSymbol(
3380 S->getSymbol(), getPointerTy(DAG.getDataLayout()), OpFlags);
3381 } else if (Subtarget->isTarget64BitILP32() &&
3382 Callee->getValueType(0) == MVT::i32) {
3383 // Zero-extend the 32-bit Callee address into a 64-bit according to x32 ABI
3384 Callee = DAG.getNode(ISD::ZERO_EXTEND, dl, MVT::i64, Callee);
3387 // Returns a chain & a flag for retval copy to use.
3388 SDVTList NodeTys = DAG.getVTList(MVT::Other, MVT::Glue);
3389 SmallVector<SDValue, 8> Ops;
3391 if (!IsSibcall && isTailCall) {
3392 Chain = DAG.getCALLSEQ_END(Chain,
3393 DAG.getIntPtrConstant(NumBytesToPop, dl, true),
3394 DAG.getIntPtrConstant(0, dl, true), InFlag, dl);
3395 InFlag = Chain.getValue(1);
3398 Ops.push_back(Chain);
3399 Ops.push_back(Callee);
3402 Ops.push_back(DAG.getConstant(FPDiff, dl, MVT::i32));
3404 // Add argument registers to the end of the list so that they are known live
3406 for (unsigned i = 0, e = RegsToPass.size(); i != e; ++i)
3407 Ops.push_back(DAG.getRegister(RegsToPass[i].first,
3408 RegsToPass[i].second.getValueType()));
3410 // Add a register mask operand representing the call-preserved registers.
3411 const uint32_t *Mask = RegInfo->getCallPreservedMask(MF, CallConv);
3412 assert(Mask && "Missing call preserved mask for calling convention");
3414 // If this is an invoke in a 32-bit function using a funclet-based
3415 // personality, assume the function clobbers all registers. If an exception
3416 // is thrown, the runtime will not restore CSRs.
3417 // FIXME: Model this more precisely so that we can register allocate across
3418 // the normal edge and spill and fill across the exceptional edge.
3419 if (!Is64Bit && CLI.CS && CLI.CS->isInvoke()) {
3420 const Function *CallerFn = MF.getFunction();
3421 EHPersonality Pers =
3422 CallerFn->hasPersonalityFn()
3423 ? classifyEHPersonality(CallerFn->getPersonalityFn())
3424 : EHPersonality::Unknown;
3425 if (isFuncletEHPersonality(Pers))
3426 Mask = RegInfo->getNoPreservedMask();
3429 Ops.push_back(DAG.getRegisterMask(Mask));
3431 if (InFlag.getNode())
3432 Ops.push_back(InFlag);
3436 //// If this is the first return lowered for this function, add the regs
3437 //// to the liveout set for the function.
3438 // This isn't right, although it's probably harmless on x86; liveouts
3439 // should be computed from returns not tail calls. Consider a void
3440 // function making a tail call to a function returning int.
3441 MF.getFrameInfo()->setHasTailCall();
3442 return DAG.getNode(X86ISD::TC_RETURN, dl, NodeTys, Ops);
3445 Chain = DAG.getNode(X86ISD::CALL, dl, NodeTys, Ops);
3446 InFlag = Chain.getValue(1);
3448 // Create the CALLSEQ_END node.
3449 unsigned NumBytesForCalleeToPop;
3450 if (X86::isCalleePop(CallConv, Is64Bit, isVarArg,
3451 DAG.getTarget().Options.GuaranteedTailCallOpt))
3452 NumBytesForCalleeToPop = NumBytes; // Callee pops everything
3453 else if (!Is64Bit && !canGuaranteeTCO(CallConv) &&
3454 !Subtarget->getTargetTriple().isOSMSVCRT() &&
3455 SR == StackStructReturn)
3456 // If this is a call to a struct-return function, the callee
3457 // pops the hidden struct pointer, so we have to push it back.
3458 // This is common for Darwin/X86, Linux & Mingw32 targets.
3459 // For MSVC Win32 targets, the caller pops the hidden struct pointer.
3460 NumBytesForCalleeToPop = 4;
3462 NumBytesForCalleeToPop = 0; // Callee pops nothing.
3464 // Returns a flag for retval copy to use.
3466 Chain = DAG.getCALLSEQ_END(Chain,
3467 DAG.getIntPtrConstant(NumBytesToPop, dl, true),
3468 DAG.getIntPtrConstant(NumBytesForCalleeToPop, dl,
3471 InFlag = Chain.getValue(1);
3474 // Handle result values, copying them out of physregs into vregs that we
3476 return LowerCallResult(Chain, InFlag, CallConv, isVarArg,
3477 Ins, dl, DAG, InVals);
3480 //===----------------------------------------------------------------------===//
3481 // Fast Calling Convention (tail call) implementation
3482 //===----------------------------------------------------------------------===//
3484 // Like std call, callee cleans arguments, convention except that ECX is
3485 // reserved for storing the tail called function address. Only 2 registers are
3486 // free for argument passing (inreg). Tail call optimization is performed
3488 // * tailcallopt is enabled
3489 // * caller/callee are fastcc
3490 // On X86_64 architecture with GOT-style position independent code only local
3491 // (within module) calls are supported at the moment.
3492 // To keep the stack aligned according to platform abi the function
3493 // GetAlignedArgumentStackSize ensures that argument delta is always multiples
3494 // of stack alignment. (Dynamic linkers need this - darwin's dyld for example)
3495 // If a tail called function callee has more arguments than the caller the
3496 // caller needs to make sure that there is room to move the RETADDR to. This is
3497 // achieved by reserving an area the size of the argument delta right after the
3498 // original RETADDR, but before the saved framepointer or the spilled registers
3499 // e.g. caller(arg1, arg2) calls callee(arg1, arg2,arg3,arg4)
3511 /// Make the stack size align e.g 16n + 12 aligned for a 16-byte align
3514 X86TargetLowering::GetAlignedArgumentStackSize(unsigned StackSize,
3515 SelectionDAG& DAG) const {
3516 const X86RegisterInfo *RegInfo = Subtarget->getRegisterInfo();
3517 const TargetFrameLowering &TFI = *Subtarget->getFrameLowering();
3518 unsigned StackAlignment = TFI.getStackAlignment();
3519 uint64_t AlignMask = StackAlignment - 1;
3520 int64_t Offset = StackSize;
3521 unsigned SlotSize = RegInfo->getSlotSize();
3522 if ( (Offset & AlignMask) <= (StackAlignment - SlotSize) ) {
3523 // Number smaller than 12 so just add the difference.
3524 Offset += ((StackAlignment - SlotSize) - (Offset & AlignMask));
3526 // Mask out lower bits, add stackalignment once plus the 12 bytes.
3527 Offset = ((~AlignMask) & Offset) + StackAlignment +
3528 (StackAlignment-SlotSize);
3533 /// Return true if the given stack call argument is already available in the
3534 /// same position (relatively) of the caller's incoming argument stack.
3536 bool MatchingStackOffset(SDValue Arg, unsigned Offset, ISD::ArgFlagsTy Flags,
3537 MachineFrameInfo *MFI, const MachineRegisterInfo *MRI,
3538 const X86InstrInfo *TII) {
3539 unsigned Bytes = Arg.getValueType().getSizeInBits() / 8;
3541 if (Arg.getOpcode() == ISD::CopyFromReg) {
3542 unsigned VR = cast<RegisterSDNode>(Arg.getOperand(1))->getReg();
3543 if (!TargetRegisterInfo::isVirtualRegister(VR))
3545 MachineInstr *Def = MRI->getVRegDef(VR);
3548 if (!Flags.isByVal()) {
3549 if (!TII->isLoadFromStackSlot(Def, FI))
3552 unsigned Opcode = Def->getOpcode();
3553 if ((Opcode == X86::LEA32r || Opcode == X86::LEA64r ||
3554 Opcode == X86::LEA64_32r) &&
3555 Def->getOperand(1).isFI()) {
3556 FI = Def->getOperand(1).getIndex();
3557 Bytes = Flags.getByValSize();
3561 } else if (LoadSDNode *Ld = dyn_cast<LoadSDNode>(Arg)) {
3562 if (Flags.isByVal())
3563 // ByVal argument is passed in as a pointer but it's now being
3564 // dereferenced. e.g.
3565 // define @foo(%struct.X* %A) {
3566 // tail call @bar(%struct.X* byval %A)
3569 SDValue Ptr = Ld->getBasePtr();
3570 FrameIndexSDNode *FINode = dyn_cast<FrameIndexSDNode>(Ptr);
3573 FI = FINode->getIndex();
3574 } else if (Arg.getOpcode() == ISD::FrameIndex && Flags.isByVal()) {
3575 FrameIndexSDNode *FINode = cast<FrameIndexSDNode>(Arg);
3576 FI = FINode->getIndex();
3577 Bytes = Flags.getByValSize();
3581 assert(FI != INT_MAX);
3582 if (!MFI->isFixedObjectIndex(FI))
3584 return Offset == MFI->getObjectOffset(FI) && Bytes == MFI->getObjectSize(FI);
3587 /// Check whether the call is eligible for tail call optimization. Targets
3588 /// that want to do tail call optimization should implement this function.
3589 bool X86TargetLowering::IsEligibleForTailCallOptimization(
3590 SDValue Callee, CallingConv::ID CalleeCC, bool isVarArg,
3591 bool isCalleeStructRet, bool isCallerStructRet, Type *RetTy,
3592 const SmallVectorImpl<ISD::OutputArg> &Outs,
3593 const SmallVectorImpl<SDValue> &OutVals,
3594 const SmallVectorImpl<ISD::InputArg> &Ins, SelectionDAG &DAG) const {
3595 if (!mayTailCallThisCC(CalleeCC))
3598 // If -tailcallopt is specified, make fastcc functions tail-callable.
3599 MachineFunction &MF = DAG.getMachineFunction();
3600 const Function *CallerF = MF.getFunction();
3602 // If the function return type is x86_fp80 and the callee return type is not,
3603 // then the FP_EXTEND of the call result is not a nop. It's not safe to
3604 // perform a tailcall optimization here.
3605 if (CallerF->getReturnType()->isX86_FP80Ty() && !RetTy->isX86_FP80Ty())
3608 CallingConv::ID CallerCC = CallerF->getCallingConv();
3609 bool CCMatch = CallerCC == CalleeCC;
3610 bool IsCalleeWin64 = Subtarget->isCallingConvWin64(CalleeCC);
3611 bool IsCallerWin64 = Subtarget->isCallingConvWin64(CallerCC);
3613 // Win64 functions have extra shadow space for argument homing. Don't do the
3614 // sibcall if the caller and callee have mismatched expectations for this
3616 if (IsCalleeWin64 != IsCallerWin64)
3619 if (DAG.getTarget().Options.GuaranteedTailCallOpt) {
3620 if (canGuaranteeTCO(CalleeCC) && CCMatch)
3625 // Look for obvious safe cases to perform tail call optimization that do not
3626 // require ABI changes. This is what gcc calls sibcall.
3628 // Can't do sibcall if stack needs to be dynamically re-aligned. PEI needs to
3629 // emit a special epilogue.
3630 const X86RegisterInfo *RegInfo = Subtarget->getRegisterInfo();
3631 if (RegInfo->needsStackRealignment(MF))
3634 // Also avoid sibcall optimization if either caller or callee uses struct
3635 // return semantics.
3636 if (isCalleeStructRet || isCallerStructRet)
3639 // Do not sibcall optimize vararg calls unless all arguments are passed via
3641 if (isVarArg && !Outs.empty()) {
3642 // Optimizing for varargs on Win64 is unlikely to be safe without
3643 // additional testing.
3644 if (IsCalleeWin64 || IsCallerWin64)
3647 SmallVector<CCValAssign, 16> ArgLocs;
3648 CCState CCInfo(CalleeCC, isVarArg, DAG.getMachineFunction(), ArgLocs,
3651 CCInfo.AnalyzeCallOperands(Outs, CC_X86);
3652 for (unsigned i = 0, e = ArgLocs.size(); i != e; ++i)
3653 if (!ArgLocs[i].isRegLoc())
3657 // If the call result is in ST0 / ST1, it needs to be popped off the x87
3658 // stack. Therefore, if it's not used by the call it is not safe to optimize
3659 // this into a sibcall.
3660 bool Unused = false;
3661 for (unsigned i = 0, e = Ins.size(); i != e; ++i) {
3668 SmallVector<CCValAssign, 16> RVLocs;
3669 CCState CCInfo(CalleeCC, false, DAG.getMachineFunction(), RVLocs,
3671 CCInfo.AnalyzeCallResult(Ins, RetCC_X86);
3672 for (unsigned i = 0, e = RVLocs.size(); i != e; ++i) {
3673 CCValAssign &VA = RVLocs[i];
3674 if (VA.getLocReg() == X86::FP0 || VA.getLocReg() == X86::FP1)
3679 // If the calling conventions do not match, then we'd better make sure the
3680 // results are returned in the same way as what the caller expects.
3682 SmallVector<CCValAssign, 16> RVLocs1;
3683 CCState CCInfo1(CalleeCC, false, DAG.getMachineFunction(), RVLocs1,
3685 CCInfo1.AnalyzeCallResult(Ins, RetCC_X86);
3687 SmallVector<CCValAssign, 16> RVLocs2;
3688 CCState CCInfo2(CallerCC, false, DAG.getMachineFunction(), RVLocs2,
3690 CCInfo2.AnalyzeCallResult(Ins, RetCC_X86);
3692 if (RVLocs1.size() != RVLocs2.size())
3694 for (unsigned i = 0, e = RVLocs1.size(); i != e; ++i) {
3695 if (RVLocs1[i].isRegLoc() != RVLocs2[i].isRegLoc())
3697 if (RVLocs1[i].getLocInfo() != RVLocs2[i].getLocInfo())
3699 if (RVLocs1[i].isRegLoc()) {
3700 if (RVLocs1[i].getLocReg() != RVLocs2[i].getLocReg())
3703 if (RVLocs1[i].getLocMemOffset() != RVLocs2[i].getLocMemOffset())
3709 unsigned StackArgsSize = 0;
3711 // If the callee takes no arguments then go on to check the results of the
3713 if (!Outs.empty()) {
3714 // Check if stack adjustment is needed. For now, do not do this if any
3715 // argument is passed on the stack.
3716 SmallVector<CCValAssign, 16> ArgLocs;
3717 CCState CCInfo(CalleeCC, isVarArg, DAG.getMachineFunction(), ArgLocs,
3720 // Allocate shadow area for Win64
3722 CCInfo.AllocateStack(32, 8);
3724 CCInfo.AnalyzeCallOperands(Outs, CC_X86);
3725 StackArgsSize = CCInfo.getNextStackOffset();
3727 if (CCInfo.getNextStackOffset()) {
3728 // Check if the arguments are already laid out in the right way as
3729 // the caller's fixed stack objects.
3730 MachineFrameInfo *MFI = MF.getFrameInfo();
3731 const MachineRegisterInfo *MRI = &MF.getRegInfo();
3732 const X86InstrInfo *TII = Subtarget->getInstrInfo();
3733 for (unsigned i = 0, e = ArgLocs.size(); i != e; ++i) {
3734 CCValAssign &VA = ArgLocs[i];
3735 SDValue Arg = OutVals[i];
3736 ISD::ArgFlagsTy Flags = Outs[i].Flags;
3737 if (VA.getLocInfo() == CCValAssign::Indirect)
3739 if (!VA.isRegLoc()) {
3740 if (!MatchingStackOffset(Arg, VA.getLocMemOffset(), Flags,
3747 // If the tailcall address may be in a register, then make sure it's
3748 // possible to register allocate for it. In 32-bit, the call address can
3749 // only target EAX, EDX, or ECX since the tail call must be scheduled after
3750 // callee-saved registers are restored. These happen to be the same
3751 // registers used to pass 'inreg' arguments so watch out for those.
3752 if (!Subtarget->is64Bit() &&
3753 ((!isa<GlobalAddressSDNode>(Callee) &&
3754 !isa<ExternalSymbolSDNode>(Callee)) ||
3755 DAG.getTarget().getRelocationModel() == Reloc::PIC_)) {
3756 unsigned NumInRegs = 0;
3757 // In PIC we need an extra register to formulate the address computation
3759 unsigned MaxInRegs =
3760 (DAG.getTarget().getRelocationModel() == Reloc::PIC_) ? 2 : 3;
3762 for (unsigned i = 0, e = ArgLocs.size(); i != e; ++i) {
3763 CCValAssign &VA = ArgLocs[i];
3766 unsigned Reg = VA.getLocReg();
3769 case X86::EAX: case X86::EDX: case X86::ECX:
3770 if (++NumInRegs == MaxInRegs)
3778 bool CalleeWillPop =
3779 X86::isCalleePop(CalleeCC, Subtarget->is64Bit(), isVarArg,
3780 MF.getTarget().Options.GuaranteedTailCallOpt);
3782 if (unsigned BytesToPop =
3783 MF.getInfo<X86MachineFunctionInfo>()->getBytesToPopOnReturn()) {
3784 // If we have bytes to pop, the callee must pop them.
3785 bool CalleePopMatches = CalleeWillPop && BytesToPop == StackArgsSize;
3786 if (!CalleePopMatches)
3788 } else if (CalleeWillPop && StackArgsSize > 0) {
3789 // If we don't have bytes to pop, make sure the callee doesn't pop any.
3797 X86TargetLowering::createFastISel(FunctionLoweringInfo &funcInfo,
3798 const TargetLibraryInfo *libInfo) const {
3799 return X86::createFastISel(funcInfo, libInfo);
3802 //===----------------------------------------------------------------------===//
3803 // Other Lowering Hooks
3804 //===----------------------------------------------------------------------===//
3806 static bool MayFoldLoad(SDValue Op) {
3807 return Op.hasOneUse() && ISD::isNormalLoad(Op.getNode());
3810 static bool MayFoldIntoStore(SDValue Op) {
3811 return Op.hasOneUse() && ISD::isNormalStore(*Op.getNode()->use_begin());
3814 static bool isTargetShuffle(unsigned Opcode) {
3816 default: return false;
3817 case X86ISD::BLENDI:
3818 case X86ISD::PSHUFB:
3819 case X86ISD::PSHUFD:
3820 case X86ISD::PSHUFHW:
3821 case X86ISD::PSHUFLW:
3823 case X86ISD::PALIGNR:
3824 case X86ISD::MOVLHPS:
3825 case X86ISD::MOVLHPD:
3826 case X86ISD::MOVHLPS:
3827 case X86ISD::MOVLPS:
3828 case X86ISD::MOVLPD:
3829 case X86ISD::MOVSHDUP:
3830 case X86ISD::MOVSLDUP:
3831 case X86ISD::MOVDDUP:
3834 case X86ISD::UNPCKL:
3835 case X86ISD::UNPCKH:
3836 case X86ISD::VPERMILPI:
3837 case X86ISD::VPERM2X128:
3838 case X86ISD::VPERMI:
3839 case X86ISD::VPERMV:
3840 case X86ISD::VPERMV3:
3845 static SDValue getTargetShuffleNode(unsigned Opc, SDLoc dl, MVT VT,
3846 SDValue V1, unsigned TargetMask,
3847 SelectionDAG &DAG) {
3849 default: llvm_unreachable("Unknown x86 shuffle node");
3850 case X86ISD::PSHUFD:
3851 case X86ISD::PSHUFHW:
3852 case X86ISD::PSHUFLW:
3853 case X86ISD::VPERMILPI:
3854 case X86ISD::VPERMI:
3855 return DAG.getNode(Opc, dl, VT, V1,
3856 DAG.getConstant(TargetMask, dl, MVT::i8));
3860 static SDValue getTargetShuffleNode(unsigned Opc, SDLoc dl, MVT VT,
3861 SDValue V1, SDValue V2, SelectionDAG &DAG) {
3863 default: llvm_unreachable("Unknown x86 shuffle node");
3864 case X86ISD::MOVLHPS:
3865 case X86ISD::MOVLHPD:
3866 case X86ISD::MOVHLPS:
3867 case X86ISD::MOVLPS:
3868 case X86ISD::MOVLPD:
3871 case X86ISD::UNPCKL:
3872 case X86ISD::UNPCKH:
3873 return DAG.getNode(Opc, dl, VT, V1, V2);
3877 SDValue X86TargetLowering::getReturnAddressFrameIndex(SelectionDAG &DAG) const {
3878 MachineFunction &MF = DAG.getMachineFunction();
3879 const X86RegisterInfo *RegInfo = Subtarget->getRegisterInfo();
3880 X86MachineFunctionInfo *FuncInfo = MF.getInfo<X86MachineFunctionInfo>();
3881 int ReturnAddrIndex = FuncInfo->getRAIndex();
3883 if (ReturnAddrIndex == 0) {
3884 // Set up a frame object for the return address.
3885 unsigned SlotSize = RegInfo->getSlotSize();
3886 ReturnAddrIndex = MF.getFrameInfo()->CreateFixedObject(SlotSize,
3889 FuncInfo->setRAIndex(ReturnAddrIndex);
3892 return DAG.getFrameIndex(ReturnAddrIndex, getPointerTy(DAG.getDataLayout()));
3895 bool X86::isOffsetSuitableForCodeModel(int64_t Offset, CodeModel::Model M,
3896 bool hasSymbolicDisplacement) {
3897 // Offset should fit into 32 bit immediate field.
3898 if (!isInt<32>(Offset))
3901 // If we don't have a symbolic displacement - we don't have any extra
3903 if (!hasSymbolicDisplacement)
3906 // FIXME: Some tweaks might be needed for medium code model.
3907 if (M != CodeModel::Small && M != CodeModel::Kernel)
3910 // For small code model we assume that latest object is 16MB before end of 31
3911 // bits boundary. We may also accept pretty large negative constants knowing
3912 // that all objects are in the positive half of address space.
3913 if (M == CodeModel::Small && Offset < 16*1024*1024)
3916 // For kernel code model we know that all object resist in the negative half
3917 // of 32bits address space. We may not accept negative offsets, since they may
3918 // be just off and we may accept pretty large positive ones.
3919 if (M == CodeModel::Kernel && Offset >= 0)
3925 /// Determines whether the callee is required to pop its own arguments.
3926 /// Callee pop is necessary to support tail calls.
3927 bool X86::isCalleePop(CallingConv::ID CallingConv,
3928 bool is64Bit, bool IsVarArg, bool GuaranteeTCO) {
3929 // If GuaranteeTCO is true, we force some calls to be callee pop so that we
3930 // can guarantee TCO.
3931 if (!IsVarArg && shouldGuaranteeTCO(CallingConv, GuaranteeTCO))
3934 switch (CallingConv) {
3937 case CallingConv::X86_StdCall:
3938 case CallingConv::X86_FastCall:
3939 case CallingConv::X86_ThisCall:
3940 case CallingConv::X86_VectorCall:
3945 /// \brief Return true if the condition is an unsigned comparison operation.
3946 static bool isX86CCUnsigned(unsigned X86CC) {
3948 default: llvm_unreachable("Invalid integer condition!");
3949 case X86::COND_E: return true;
3950 case X86::COND_G: return false;
3951 case X86::COND_GE: return false;
3952 case X86::COND_L: return false;
3953 case X86::COND_LE: return false;
3954 case X86::COND_NE: return true;
3955 case X86::COND_B: return true;
3956 case X86::COND_A: return true;
3957 case X86::COND_BE: return true;
3958 case X86::COND_AE: return true;
3962 /// Do a one-to-one translation of a ISD::CondCode to the X86-specific
3963 /// condition code, returning the condition code and the LHS/RHS of the
3964 /// comparison to make.
3965 static unsigned TranslateX86CC(ISD::CondCode SetCCOpcode, SDLoc DL, bool isFP,
3966 SDValue &LHS, SDValue &RHS, SelectionDAG &DAG) {
3968 if (ConstantSDNode *RHSC = dyn_cast<ConstantSDNode>(RHS)) {
3969 if (SetCCOpcode == ISD::SETGT && RHSC->isAllOnesValue()) {
3970 // X > -1 -> X == 0, jump !sign.
3971 RHS = DAG.getConstant(0, DL, RHS.getValueType());
3972 return X86::COND_NS;
3974 if (SetCCOpcode == ISD::SETLT && RHSC->isNullValue()) {
3975 // X < 0 -> X == 0, jump on sign.
3978 if (SetCCOpcode == ISD::SETLT && RHSC->getZExtValue() == 1) {
3980 RHS = DAG.getConstant(0, DL, RHS.getValueType());
3981 return X86::COND_LE;
3985 switch (SetCCOpcode) {
3986 default: llvm_unreachable("Invalid integer condition!");
3987 case ISD::SETEQ: return X86::COND_E;
3988 case ISD::SETGT: return X86::COND_G;
3989 case ISD::SETGE: return X86::COND_GE;
3990 case ISD::SETLT: return X86::COND_L;
3991 case ISD::SETLE: return X86::COND_LE;
3992 case ISD::SETNE: return X86::COND_NE;
3993 case ISD::SETULT: return X86::COND_B;
3994 case ISD::SETUGT: return X86::COND_A;
3995 case ISD::SETULE: return X86::COND_BE;
3996 case ISD::SETUGE: return X86::COND_AE;
4000 // First determine if it is required or is profitable to flip the operands.
4002 // If LHS is a foldable load, but RHS is not, flip the condition.
4003 if (ISD::isNON_EXTLoad(LHS.getNode()) &&
4004 !ISD::isNON_EXTLoad(RHS.getNode())) {
4005 SetCCOpcode = getSetCCSwappedOperands(SetCCOpcode);
4006 std::swap(LHS, RHS);
4009 switch (SetCCOpcode) {
4015 std::swap(LHS, RHS);
4019 // On a floating point condition, the flags are set as follows:
4021 // 0 | 0 | 0 | X > Y
4022 // 0 | 0 | 1 | X < Y
4023 // 1 | 0 | 0 | X == Y
4024 // 1 | 1 | 1 | unordered
4025 switch (SetCCOpcode) {
4026 default: llvm_unreachable("Condcode should be pre-legalized away");
4028 case ISD::SETEQ: return X86::COND_E;
4029 case ISD::SETOLT: // flipped
4031 case ISD::SETGT: return X86::COND_A;
4032 case ISD::SETOLE: // flipped
4034 case ISD::SETGE: return X86::COND_AE;
4035 case ISD::SETUGT: // flipped
4037 case ISD::SETLT: return X86::COND_B;
4038 case ISD::SETUGE: // flipped
4040 case ISD::SETLE: return X86::COND_BE;
4042 case ISD::SETNE: return X86::COND_NE;
4043 case ISD::SETUO: return X86::COND_P;
4044 case ISD::SETO: return X86::COND_NP;
4046 case ISD::SETUNE: return X86::COND_INVALID;
4050 /// Is there a floating point cmov for the specific X86 condition code?
4051 /// Current x86 isa includes the following FP cmov instructions:
4052 /// fcmovb, fcomvbe, fcomve, fcmovu, fcmovae, fcmova, fcmovne, fcmovnu.
4053 static bool hasFPCMov(unsigned X86CC) {
4069 /// Returns true if the target can instruction select the
4070 /// specified FP immediate natively. If false, the legalizer will
4071 /// materialize the FP immediate as a load from a constant pool.
4072 bool X86TargetLowering::isFPImmLegal(const APFloat &Imm, EVT VT) const {
4073 for (unsigned i = 0, e = LegalFPImmediates.size(); i != e; ++i) {
4074 if (Imm.bitwiseIsEqual(LegalFPImmediates[i]))
4080 bool X86TargetLowering::shouldReduceLoadWidth(SDNode *Load,
4081 ISD::LoadExtType ExtTy,
4083 // "ELF Handling for Thread-Local Storage" specifies that R_X86_64_GOTTPOFF
4084 // relocation target a movq or addq instruction: don't let the load shrink.
4085 SDValue BasePtr = cast<LoadSDNode>(Load)->getBasePtr();
4086 if (BasePtr.getOpcode() == X86ISD::WrapperRIP)
4087 if (const auto *GA = dyn_cast<GlobalAddressSDNode>(BasePtr.getOperand(0)))
4088 return GA->getTargetFlags() != X86II::MO_GOTTPOFF;
4092 /// \brief Returns true if it is beneficial to convert a load of a constant
4093 /// to just the constant itself.
4094 bool X86TargetLowering::shouldConvertConstantLoadToIntImm(const APInt &Imm,
4096 assert(Ty->isIntegerTy());
4098 unsigned BitSize = Ty->getPrimitiveSizeInBits();
4099 if (BitSize == 0 || BitSize > 64)
4104 bool X86TargetLowering::isExtractSubvectorCheap(EVT ResVT,
4105 unsigned Index) const {
4106 if (!isOperationLegalOrCustom(ISD::EXTRACT_SUBVECTOR, ResVT))
4109 return (Index == 0 || Index == ResVT.getVectorNumElements());
4112 bool X86TargetLowering::isCheapToSpeculateCttz() const {
4113 // Speculate cttz only if we can directly use TZCNT.
4114 return Subtarget->hasBMI();
4117 bool X86TargetLowering::isCheapToSpeculateCtlz() const {
4118 // Speculate ctlz only if we can directly use LZCNT.
4119 return Subtarget->hasLZCNT();
4122 /// Return true if every element in Mask, beginning
4123 /// from position Pos and ending in Pos+Size is undef.
4124 static bool isUndefInRange(ArrayRef<int> Mask, unsigned Pos, unsigned Size) {
4125 for (unsigned i = Pos, e = Pos + Size; i != e; ++i)
4131 /// Return true if Val is undef or if its value falls within the
4132 /// specified range (L, H].
4133 static bool isUndefOrInRange(int Val, int Low, int Hi) {
4134 return (Val < 0) || (Val >= Low && Val < Hi);
4137 /// Val is either less than zero (undef) or equal to the specified value.
4138 static bool isUndefOrEqual(int Val, int CmpVal) {
4139 return (Val < 0 || Val == CmpVal);
4142 /// Return true if every element in Mask, beginning
4143 /// from position Pos and ending in Pos+Size, falls within the specified
4144 /// sequential range (Low, Low+Size]. or is undef.
4145 static bool isSequentialOrUndefInRange(ArrayRef<int> Mask,
4146 unsigned Pos, unsigned Size, int Low) {
4147 for (unsigned i = Pos, e = Pos+Size; i != e; ++i, ++Low)
4148 if (!isUndefOrEqual(Mask[i], Low))
4153 /// Return true if the specified EXTRACT_SUBVECTOR operand specifies a vector
4154 /// extract that is suitable for instruction that extract 128 or 256 bit vectors
4155 static bool isVEXTRACTIndex(SDNode *N, unsigned vecWidth) {
4156 assert((vecWidth == 128 || vecWidth == 256) && "Unexpected vector width");
4157 if (!isa<ConstantSDNode>(N->getOperand(1).getNode()))
4160 // The index should be aligned on a vecWidth-bit boundary.
4162 cast<ConstantSDNode>(N->getOperand(1).getNode())->getZExtValue();
4164 MVT VT = N->getSimpleValueType(0);
4165 unsigned ElSize = VT.getVectorElementType().getSizeInBits();
4166 bool Result = (Index * ElSize) % vecWidth == 0;
4171 /// Return true if the specified INSERT_SUBVECTOR
4172 /// operand specifies a subvector insert that is suitable for input to
4173 /// insertion of 128 or 256-bit subvectors
4174 static bool isVINSERTIndex(SDNode *N, unsigned vecWidth) {
4175 assert((vecWidth == 128 || vecWidth == 256) && "Unexpected vector width");
4176 if (!isa<ConstantSDNode>(N->getOperand(2).getNode()))
4178 // The index should be aligned on a vecWidth-bit boundary.
4180 cast<ConstantSDNode>(N->getOperand(2).getNode())->getZExtValue();
4182 MVT VT = N->getSimpleValueType(0);
4183 unsigned ElSize = VT.getVectorElementType().getSizeInBits();
4184 bool Result = (Index * ElSize) % vecWidth == 0;
4189 bool X86::isVINSERT128Index(SDNode *N) {
4190 return isVINSERTIndex(N, 128);
4193 bool X86::isVINSERT256Index(SDNode *N) {
4194 return isVINSERTIndex(N, 256);
4197 bool X86::isVEXTRACT128Index(SDNode *N) {
4198 return isVEXTRACTIndex(N, 128);
4201 bool X86::isVEXTRACT256Index(SDNode *N) {
4202 return isVEXTRACTIndex(N, 256);
4205 static unsigned getExtractVEXTRACTImmediate(SDNode *N, unsigned vecWidth) {
4206 assert((vecWidth == 128 || vecWidth == 256) && "Unsupported vector width");
4207 assert(isa<ConstantSDNode>(N->getOperand(1).getNode()) &&
4208 "Illegal extract subvector for VEXTRACT");
4211 cast<ConstantSDNode>(N->getOperand(1).getNode())->getZExtValue();
4213 MVT VecVT = N->getOperand(0).getSimpleValueType();
4214 MVT ElVT = VecVT.getVectorElementType();
4216 unsigned NumElemsPerChunk = vecWidth / ElVT.getSizeInBits();
4217 return Index / NumElemsPerChunk;
4220 static unsigned getInsertVINSERTImmediate(SDNode *N, unsigned vecWidth) {
4221 assert((vecWidth == 128 || vecWidth == 256) && "Unsupported vector width");
4222 assert(isa<ConstantSDNode>(N->getOperand(2).getNode()) &&
4223 "Illegal insert subvector for VINSERT");
4226 cast<ConstantSDNode>(N->getOperand(2).getNode())->getZExtValue();
4228 MVT VecVT = N->getSimpleValueType(0);
4229 MVT ElVT = VecVT.getVectorElementType();
4231 unsigned NumElemsPerChunk = vecWidth / ElVT.getSizeInBits();
4232 return Index / NumElemsPerChunk;
4235 /// Return the appropriate immediate to extract the specified
4236 /// EXTRACT_SUBVECTOR index with VEXTRACTF128 and VINSERTI128 instructions.
4237 unsigned X86::getExtractVEXTRACT128Immediate(SDNode *N) {
4238 return getExtractVEXTRACTImmediate(N, 128);
4241 /// Return the appropriate immediate to extract the specified
4242 /// EXTRACT_SUBVECTOR index with VEXTRACTF64x4 and VINSERTI64x4 instructions.
4243 unsigned X86::getExtractVEXTRACT256Immediate(SDNode *N) {
4244 return getExtractVEXTRACTImmediate(N, 256);
4247 /// Return the appropriate immediate to insert at the specified
4248 /// INSERT_SUBVECTOR index with VINSERTF128 and VINSERTI128 instructions.
4249 unsigned X86::getInsertVINSERT128Immediate(SDNode *N) {
4250 return getInsertVINSERTImmediate(N, 128);
4253 /// Return the appropriate immediate to insert at the specified
4254 /// INSERT_SUBVECTOR index with VINSERTF46x4 and VINSERTI64x4 instructions.
4255 unsigned X86::getInsertVINSERT256Immediate(SDNode *N) {
4256 return getInsertVINSERTImmediate(N, 256);
4259 /// Returns true if V is a constant integer zero.
4260 static bool isZero(SDValue V) {
4261 ConstantSDNode *C = dyn_cast<ConstantSDNode>(V);
4262 return C && C->isNullValue();
4265 /// Returns true if Elt is a constant zero or a floating point constant +0.0.
4266 bool X86::isZeroNode(SDValue Elt) {
4269 if (ConstantFPSDNode *CFP = dyn_cast<ConstantFPSDNode>(Elt))
4270 return CFP->getValueAPF().isPosZero();
4274 // Build a vector of constants
4275 // Use an UNDEF node if MaskElt == -1.
4276 // Spilt 64-bit constants in the 32-bit mode.
4277 static SDValue getConstVector(ArrayRef<int> Values, MVT VT,
4279 SDLoc dl, bool IsMask = false) {
4281 SmallVector<SDValue, 32> Ops;
4284 MVT ConstVecVT = VT;
4285 unsigned NumElts = VT.getVectorNumElements();
4286 bool In64BitMode = DAG.getTargetLoweringInfo().isTypeLegal(MVT::i64);
4287 if (!In64BitMode && VT.getVectorElementType() == MVT::i64) {
4288 ConstVecVT = MVT::getVectorVT(MVT::i32, NumElts * 2);
4292 MVT EltVT = ConstVecVT.getVectorElementType();
4293 for (unsigned i = 0; i < NumElts; ++i) {
4294 bool IsUndef = Values[i] < 0 && IsMask;
4295 SDValue OpNode = IsUndef ? DAG.getUNDEF(EltVT) :
4296 DAG.getConstant(Values[i], dl, EltVT);
4297 Ops.push_back(OpNode);
4299 Ops.push_back(IsUndef ? DAG.getUNDEF(EltVT) :
4300 DAG.getConstant(0, dl, EltVT));
4302 SDValue ConstsNode = DAG.getNode(ISD::BUILD_VECTOR, dl, ConstVecVT, Ops);
4304 ConstsNode = DAG.getBitcast(VT, ConstsNode);
4308 /// Returns a vector of specified type with all zero elements.
4309 static SDValue getZeroVector(EVT VT, const X86Subtarget *Subtarget,
4310 SelectionDAG &DAG, SDLoc dl) {
4311 assert(VT.isVector() && "Expected a vector type");
4313 // Always build SSE zero vectors as <4 x i32> bitcasted
4314 // to their dest type. This ensures they get CSE'd.
4316 if (VT.is128BitVector()) { // SSE
4317 if (Subtarget->hasSSE2()) { // SSE2
4318 SDValue Cst = DAG.getConstant(0, dl, MVT::i32);
4319 Vec = DAG.getNode(ISD::BUILD_VECTOR, dl, MVT::v4i32, Cst, Cst, Cst, Cst);
4321 SDValue Cst = DAG.getConstantFP(+0.0, dl, MVT::f32);
4322 Vec = DAG.getNode(ISD::BUILD_VECTOR, dl, MVT::v4f32, Cst, Cst, Cst, Cst);
4324 } else if (VT.is256BitVector()) { // AVX
4325 if (Subtarget->hasInt256()) { // AVX2
4326 SDValue Cst = DAG.getConstant(0, dl, MVT::i32);
4327 SDValue Ops[] = { Cst, Cst, Cst, Cst, Cst, Cst, Cst, Cst };
4328 Vec = DAG.getNode(ISD::BUILD_VECTOR, dl, MVT::v8i32, Ops);
4330 // 256-bit logic and arithmetic instructions in AVX are all
4331 // floating-point, no support for integer ops. Emit fp zeroed vectors.
4332 SDValue Cst = DAG.getConstantFP(+0.0, dl, MVT::f32);
4333 SDValue Ops[] = { Cst, Cst, Cst, Cst, Cst, Cst, Cst, Cst };
4334 Vec = DAG.getNode(ISD::BUILD_VECTOR, dl, MVT::v8f32, Ops);
4336 } else if (VT.is512BitVector()) { // AVX-512
4337 SDValue Cst = DAG.getConstant(0, dl, MVT::i32);
4338 SDValue Ops[] = { Cst, Cst, Cst, Cst, Cst, Cst, Cst, Cst,
4339 Cst, Cst, Cst, Cst, Cst, Cst, Cst, Cst };
4340 Vec = DAG.getNode(ISD::BUILD_VECTOR, dl, MVT::v16i32, Ops);
4341 } else if (VT.getVectorElementType() == MVT::i1) {
4343 assert((Subtarget->hasBWI() || VT.getVectorNumElements() <= 16)
4344 && "Unexpected vector type");
4345 assert((Subtarget->hasVLX() || VT.getVectorNumElements() >= 8)
4346 && "Unexpected vector type");
4347 SDValue Cst = DAG.getConstant(0, dl, MVT::i1);
4348 SmallVector<SDValue, 64> Ops(VT.getVectorNumElements(), Cst);
4349 return DAG.getNode(ISD::BUILD_VECTOR, dl, VT, Ops);
4351 llvm_unreachable("Unexpected vector type");
4353 return DAG.getBitcast(VT, Vec);
4356 static SDValue ExtractSubVector(SDValue Vec, unsigned IdxVal,
4357 SelectionDAG &DAG, SDLoc dl,
4358 unsigned vectorWidth) {
4359 assert((vectorWidth == 128 || vectorWidth == 256) &&
4360 "Unsupported vector width");
4361 EVT VT = Vec.getValueType();
4362 EVT ElVT = VT.getVectorElementType();
4363 unsigned Factor = VT.getSizeInBits()/vectorWidth;
4364 EVT ResultVT = EVT::getVectorVT(*DAG.getContext(), ElVT,
4365 VT.getVectorNumElements()/Factor);
4367 // Extract from UNDEF is UNDEF.
4368 if (Vec.getOpcode() == ISD::UNDEF)
4369 return DAG.getUNDEF(ResultVT);
4371 // Extract the relevant vectorWidth bits. Generate an EXTRACT_SUBVECTOR
4372 unsigned ElemsPerChunk = vectorWidth / ElVT.getSizeInBits();
4373 assert(isPowerOf2_32(ElemsPerChunk) && "Elements per chunk not power of 2");
4375 // This is the index of the first element of the vectorWidth-bit chunk
4376 // we want. Since ElemsPerChunk is a power of 2 just need to clear bits.
4377 IdxVal &= ~(ElemsPerChunk - 1);
4379 // If the input is a buildvector just emit a smaller one.
4380 if (Vec.getOpcode() == ISD::BUILD_VECTOR)
4381 return DAG.getNode(ISD::BUILD_VECTOR, dl, ResultVT,
4382 makeArrayRef(Vec->op_begin() + IdxVal, ElemsPerChunk));
4384 SDValue VecIdx = DAG.getIntPtrConstant(IdxVal, dl);
4385 return DAG.getNode(ISD::EXTRACT_SUBVECTOR, dl, ResultVT, Vec, VecIdx);
4388 /// Generate a DAG to grab 128-bits from a vector > 128 bits. This
4389 /// sets things up to match to an AVX VEXTRACTF128 / VEXTRACTI128
4390 /// or AVX-512 VEXTRACTF32x4 / VEXTRACTI32x4
4391 /// instructions or a simple subregister reference. Idx is an index in the
4392 /// 128 bits we want. It need not be aligned to a 128-bit boundary. That makes
4393 /// lowering EXTRACT_VECTOR_ELT operations easier.
4394 static SDValue Extract128BitVector(SDValue Vec, unsigned IdxVal,
4395 SelectionDAG &DAG, SDLoc dl) {
4396 assert((Vec.getValueType().is256BitVector() ||
4397 Vec.getValueType().is512BitVector()) && "Unexpected vector size!");
4398 return ExtractSubVector(Vec, IdxVal, DAG, dl, 128);
4401 /// Generate a DAG to grab 256-bits from a 512-bit vector.
4402 static SDValue Extract256BitVector(SDValue Vec, unsigned IdxVal,
4403 SelectionDAG &DAG, SDLoc dl) {
4404 assert(Vec.getValueType().is512BitVector() && "Unexpected vector size!");
4405 return ExtractSubVector(Vec, IdxVal, DAG, dl, 256);
4408 static SDValue InsertSubVector(SDValue Result, SDValue Vec,
4409 unsigned IdxVal, SelectionDAG &DAG,
4410 SDLoc dl, unsigned vectorWidth) {
4411 assert((vectorWidth == 128 || vectorWidth == 256) &&
4412 "Unsupported vector width");
4413 // Inserting UNDEF is Result
4414 if (Vec.getOpcode() == ISD::UNDEF)
4416 EVT VT = Vec.getValueType();
4417 EVT ElVT = VT.getVectorElementType();
4418 EVT ResultVT = Result.getValueType();
4420 // Insert the relevant vectorWidth bits.
4421 unsigned ElemsPerChunk = vectorWidth/ElVT.getSizeInBits();
4422 assert(isPowerOf2_32(ElemsPerChunk) && "Elements per chunk not power of 2");
4424 // This is the index of the first element of the vectorWidth-bit chunk
4425 // we want. Since ElemsPerChunk is a power of 2 just need to clear bits.
4426 IdxVal &= ~(ElemsPerChunk - 1);
4428 SDValue VecIdx = DAG.getIntPtrConstant(IdxVal, dl);
4429 return DAG.getNode(ISD::INSERT_SUBVECTOR, dl, ResultVT, Result, Vec, VecIdx);
4432 /// Generate a DAG to put 128-bits into a vector > 128 bits. This
4433 /// sets things up to match to an AVX VINSERTF128/VINSERTI128 or
4434 /// AVX-512 VINSERTF32x4/VINSERTI32x4 instructions or a
4435 /// simple superregister reference. Idx is an index in the 128 bits
4436 /// we want. It need not be aligned to a 128-bit boundary. That makes
4437 /// lowering INSERT_VECTOR_ELT operations easier.
4438 static SDValue Insert128BitVector(SDValue Result, SDValue Vec, unsigned IdxVal,
4439 SelectionDAG &DAG, SDLoc dl) {
4440 assert(Vec.getValueType().is128BitVector() && "Unexpected vector size!");
4442 // For insertion into the zero index (low half) of a 256-bit vector, it is
4443 // more efficient to generate a blend with immediate instead of an insert*128.
4444 // We are still creating an INSERT_SUBVECTOR below with an undef node to
4445 // extend the subvector to the size of the result vector. Make sure that
4446 // we are not recursing on that node by checking for undef here.
4447 if (IdxVal == 0 && Result.getValueType().is256BitVector() &&
4448 Result.getOpcode() != ISD::UNDEF) {
4449 EVT ResultVT = Result.getValueType();
4450 SDValue ZeroIndex = DAG.getIntPtrConstant(0, dl);
4451 SDValue Undef = DAG.getUNDEF(ResultVT);
4452 SDValue Vec256 = DAG.getNode(ISD::INSERT_SUBVECTOR, dl, ResultVT, Undef,
4455 // The blend instruction, and therefore its mask, depend on the data type.
4456 MVT ScalarType = ResultVT.getVectorElementType().getSimpleVT();
4457 if (ScalarType.isFloatingPoint()) {
4458 // Choose either vblendps (float) or vblendpd (double).
4459 unsigned ScalarSize = ScalarType.getSizeInBits();
4460 assert((ScalarSize == 64 || ScalarSize == 32) && "Unknown float type");
4461 unsigned MaskVal = (ScalarSize == 64) ? 0x03 : 0x0f;
4462 SDValue Mask = DAG.getConstant(MaskVal, dl, MVT::i8);
4463 return DAG.getNode(X86ISD::BLENDI, dl, ResultVT, Result, Vec256, Mask);
4466 const X86Subtarget &Subtarget =
4467 static_cast<const X86Subtarget &>(DAG.getSubtarget());
4469 // AVX2 is needed for 256-bit integer blend support.
4470 // Integers must be cast to 32-bit because there is only vpblendd;
4471 // vpblendw can't be used for this because it has a handicapped mask.
4473 // If we don't have AVX2, then cast to float. Using a wrong domain blend
4474 // is still more efficient than using the wrong domain vinsertf128 that
4475 // will be created by InsertSubVector().
4476 MVT CastVT = Subtarget.hasAVX2() ? MVT::v8i32 : MVT::v8f32;
4478 SDValue Mask = DAG.getConstant(0x0f, dl, MVT::i8);
4479 Vec256 = DAG.getBitcast(CastVT, Vec256);
4480 Vec256 = DAG.getNode(X86ISD::BLENDI, dl, CastVT, Result, Vec256, Mask);
4481 return DAG.getBitcast(ResultVT, Vec256);
4484 return InsertSubVector(Result, Vec, IdxVal, DAG, dl, 128);
4487 static SDValue Insert256BitVector(SDValue Result, SDValue Vec, unsigned IdxVal,
4488 SelectionDAG &DAG, SDLoc dl) {
4489 assert(Vec.getValueType().is256BitVector() && "Unexpected vector size!");
4490 return InsertSubVector(Result, Vec, IdxVal, DAG, dl, 256);
4493 /// Concat two 128-bit vectors into a 256 bit vector using VINSERTF128
4494 /// instructions. This is used because creating CONCAT_VECTOR nodes of
4495 /// BUILD_VECTORS returns a larger BUILD_VECTOR while we're trying to lower
4496 /// large BUILD_VECTORS.
4497 static SDValue Concat128BitVectors(SDValue V1, SDValue V2, EVT VT,
4498 unsigned NumElems, SelectionDAG &DAG,
4500 SDValue V = Insert128BitVector(DAG.getUNDEF(VT), V1, 0, DAG, dl);
4501 return Insert128BitVector(V, V2, NumElems/2, DAG, dl);
4504 static SDValue Concat256BitVectors(SDValue V1, SDValue V2, EVT VT,
4505 unsigned NumElems, SelectionDAG &DAG,
4507 SDValue V = Insert256BitVector(DAG.getUNDEF(VT), V1, 0, DAG, dl);
4508 return Insert256BitVector(V, V2, NumElems/2, DAG, dl);
4511 /// Returns a vector of specified type with all bits set.
4512 /// Always build ones vectors as <4 x i32> or <8 x i32>. For 256-bit types with
4513 /// no AVX2 supprt, use two <4 x i32> inserted in a <8 x i32> appropriately.
4514 /// Then bitcast to their original type, ensuring they get CSE'd.
4515 static SDValue getOnesVector(EVT VT, const X86Subtarget *Subtarget,
4516 SelectionDAG &DAG, SDLoc dl) {
4517 assert(VT.isVector() && "Expected a vector type");
4519 SDValue Cst = DAG.getConstant(~0U, dl, MVT::i32);
4521 if (VT.is512BitVector()) {
4522 SDValue Ops[] = { Cst, Cst, Cst, Cst, Cst, Cst, Cst, Cst,
4523 Cst, Cst, Cst, Cst, Cst, Cst, Cst, Cst };
4524 Vec = DAG.getNode(ISD::BUILD_VECTOR, dl, MVT::v16i32, Ops);
4525 } else if (VT.is256BitVector()) {
4526 if (Subtarget->hasInt256()) { // AVX2
4527 SDValue Ops[] = { Cst, Cst, Cst, Cst, Cst, Cst, Cst, Cst };
4528 Vec = DAG.getNode(ISD::BUILD_VECTOR, dl, MVT::v8i32, Ops);
4530 Vec = DAG.getNode(ISD::BUILD_VECTOR, dl, MVT::v4i32, Cst, Cst, Cst, Cst);
4531 Vec = Concat128BitVectors(Vec, Vec, MVT::v8i32, 8, DAG, dl);
4533 } else if (VT.is128BitVector()) {
4534 Vec = DAG.getNode(ISD::BUILD_VECTOR, dl, MVT::v4i32, Cst, Cst, Cst, Cst);
4536 llvm_unreachable("Unexpected vector type");
4538 return DAG.getBitcast(VT, Vec);
4541 /// Returns a vector_shuffle node for an unpackl operation.
4542 static SDValue getUnpackl(SelectionDAG &DAG, SDLoc dl, MVT VT, SDValue V1,
4544 unsigned NumElems = VT.getVectorNumElements();
4545 SmallVector<int, 8> Mask;
4546 for (unsigned i = 0, e = NumElems/2; i != e; ++i) {
4548 Mask.push_back(i + NumElems);
4550 return DAG.getVectorShuffle(VT, dl, V1, V2, &Mask[0]);
4553 /// Returns a vector_shuffle node for an unpackh operation.
4554 static SDValue getUnpackh(SelectionDAG &DAG, SDLoc dl, MVT VT, SDValue V1,
4556 unsigned NumElems = VT.getVectorNumElements();
4557 SmallVector<int, 8> Mask;
4558 for (unsigned i = 0, Half = NumElems/2; i != Half; ++i) {
4559 Mask.push_back(i + Half);
4560 Mask.push_back(i + NumElems + Half);
4562 return DAG.getVectorShuffle(VT, dl, V1, V2, &Mask[0]);
4565 /// Return a vector_shuffle of the specified vector of zero or undef vector.
4566 /// This produces a shuffle where the low element of V2 is swizzled into the
4567 /// zero/undef vector, landing at element Idx.
4568 /// This produces a shuffle mask like 4,1,2,3 (idx=0) or 0,1,2,4 (idx=3).
4569 static SDValue getShuffleVectorZeroOrUndef(SDValue V2, unsigned Idx,
4571 const X86Subtarget *Subtarget,
4572 SelectionDAG &DAG) {
4573 MVT VT = V2.getSimpleValueType();
4575 ? getZeroVector(VT, Subtarget, DAG, SDLoc(V2)) : DAG.getUNDEF(VT);
4576 unsigned NumElems = VT.getVectorNumElements();
4577 SmallVector<int, 16> MaskVec;
4578 for (unsigned i = 0; i != NumElems; ++i)
4579 // If this is the insertion idx, put the low elt of V2 here.
4580 MaskVec.push_back(i == Idx ? NumElems : i);
4581 return DAG.getVectorShuffle(VT, SDLoc(V2), V1, V2, &MaskVec[0]);
4584 /// Calculates the shuffle mask corresponding to the target-specific opcode.
4585 /// Returns true if the Mask could be calculated. Sets IsUnary to true if only
4586 /// uses one source. Note that this will set IsUnary for shuffles which use a
4587 /// single input multiple times, and in those cases it will
4588 /// adjust the mask to only have indices within that single input.
4589 /// FIXME: Add support for Decode*Mask functions that return SM_SentinelZero.
4590 static bool getTargetShuffleMask(SDNode *N, MVT VT,
4591 SmallVectorImpl<int> &Mask, bool &IsUnary) {
4592 unsigned NumElems = VT.getVectorNumElements();
4596 bool IsFakeUnary = false;
4597 switch(N->getOpcode()) {
4598 case X86ISD::BLENDI:
4599 ImmN = N->getOperand(N->getNumOperands()-1);
4600 DecodeBLENDMask(VT, cast<ConstantSDNode>(ImmN)->getZExtValue(), Mask);
4603 ImmN = N->getOperand(N->getNumOperands()-1);
4604 DecodeSHUFPMask(VT, cast<ConstantSDNode>(ImmN)->getZExtValue(), Mask);
4605 IsUnary = IsFakeUnary = N->getOperand(0) == N->getOperand(1);
4607 case X86ISD::UNPCKH:
4608 DecodeUNPCKHMask(VT, Mask);
4609 IsUnary = IsFakeUnary = N->getOperand(0) == N->getOperand(1);
4611 case X86ISD::UNPCKL:
4612 DecodeUNPCKLMask(VT, Mask);
4613 IsUnary = IsFakeUnary = N->getOperand(0) == N->getOperand(1);
4615 case X86ISD::MOVHLPS:
4616 DecodeMOVHLPSMask(NumElems, Mask);
4617 IsUnary = IsFakeUnary = N->getOperand(0) == N->getOperand(1);
4619 case X86ISD::MOVLHPS:
4620 DecodeMOVLHPSMask(NumElems, Mask);
4621 IsUnary = IsFakeUnary = N->getOperand(0) == N->getOperand(1);
4623 case X86ISD::PALIGNR:
4624 ImmN = N->getOperand(N->getNumOperands()-1);
4625 DecodePALIGNRMask(VT, cast<ConstantSDNode>(ImmN)->getZExtValue(), Mask);
4627 case X86ISD::PSHUFD:
4628 case X86ISD::VPERMILPI:
4629 ImmN = N->getOperand(N->getNumOperands()-1);
4630 DecodePSHUFMask(VT, cast<ConstantSDNode>(ImmN)->getZExtValue(), Mask);
4633 case X86ISD::PSHUFHW:
4634 ImmN = N->getOperand(N->getNumOperands()-1);
4635 DecodePSHUFHWMask(VT, cast<ConstantSDNode>(ImmN)->getZExtValue(), Mask);
4638 case X86ISD::PSHUFLW:
4639 ImmN = N->getOperand(N->getNumOperands()-1);
4640 DecodePSHUFLWMask(VT, cast<ConstantSDNode>(ImmN)->getZExtValue(), Mask);
4643 case X86ISD::PSHUFB: {
4645 SDValue MaskNode = N->getOperand(1);
4646 while (MaskNode->getOpcode() == ISD::BITCAST)
4647 MaskNode = MaskNode->getOperand(0);
4649 if (MaskNode->getOpcode() == ISD::BUILD_VECTOR) {
4650 // If we have a build-vector, then things are easy.
4651 MVT VT = MaskNode.getSimpleValueType();
4652 assert(VT.isVector() &&
4653 "Can't produce a non-vector with a build_vector!");
4654 if (!VT.isInteger())
4657 int NumBytesPerElement = VT.getVectorElementType().getSizeInBits() / 8;
4659 SmallVector<uint64_t, 32> RawMask;
4660 for (int i = 0, e = MaskNode->getNumOperands(); i < e; ++i) {
4661 SDValue Op = MaskNode->getOperand(i);
4662 if (Op->getOpcode() == ISD::UNDEF) {
4663 RawMask.push_back((uint64_t)SM_SentinelUndef);
4666 auto *CN = dyn_cast<ConstantSDNode>(Op.getNode());
4669 APInt MaskElement = CN->getAPIntValue();
4671 // We now have to decode the element which could be any integer size and
4672 // extract each byte of it.
4673 for (int j = 0; j < NumBytesPerElement; ++j) {
4674 // Note that this is x86 and so always little endian: the low byte is
4675 // the first byte of the mask.
4676 RawMask.push_back(MaskElement.getLoBits(8).getZExtValue());
4677 MaskElement = MaskElement.lshr(8);
4680 DecodePSHUFBMask(RawMask, Mask);
4684 auto *MaskLoad = dyn_cast<LoadSDNode>(MaskNode);
4688 SDValue Ptr = MaskLoad->getBasePtr();
4689 if (Ptr->getOpcode() == X86ISD::Wrapper ||
4690 Ptr->getOpcode() == X86ISD::WrapperRIP)
4691 Ptr = Ptr->getOperand(0);
4693 auto *MaskCP = dyn_cast<ConstantPoolSDNode>(Ptr);
4694 if (!MaskCP || MaskCP->isMachineConstantPoolEntry())
4697 if (auto *C = dyn_cast<Constant>(MaskCP->getConstVal())) {
4698 DecodePSHUFBMask(C, Mask);
4706 case X86ISD::VPERMI:
4707 ImmN = N->getOperand(N->getNumOperands()-1);
4708 DecodeVPERMMask(cast<ConstantSDNode>(ImmN)->getZExtValue(), Mask);
4713 DecodeScalarMoveMask(VT, /* IsLoad */ false, Mask);
4715 case X86ISD::VPERM2X128:
4716 ImmN = N->getOperand(N->getNumOperands()-1);
4717 DecodeVPERM2X128Mask(VT, cast<ConstantSDNode>(ImmN)->getZExtValue(), Mask);
4718 if (Mask.empty()) return false;
4719 // Mask only contains negative index if an element is zero.
4720 if (std::any_of(Mask.begin(), Mask.end(),
4721 [](int M){ return M == SM_SentinelZero; }))
4724 case X86ISD::MOVSLDUP:
4725 DecodeMOVSLDUPMask(VT, Mask);
4728 case X86ISD::MOVSHDUP:
4729 DecodeMOVSHDUPMask(VT, Mask);
4732 case X86ISD::MOVDDUP:
4733 DecodeMOVDDUPMask(VT, Mask);
4736 case X86ISD::MOVLHPD:
4737 case X86ISD::MOVLPD:
4738 case X86ISD::MOVLPS:
4739 // Not yet implemented
4741 case X86ISD::VPERMV: {
4743 SDValue MaskNode = N->getOperand(0);
4744 while (MaskNode->getOpcode() == ISD::BITCAST)
4745 MaskNode = MaskNode->getOperand(0);
4747 unsigned MaskLoBits = Log2_64(VT.getVectorNumElements());
4748 SmallVector<uint64_t, 32> RawMask;
4749 if (MaskNode->getOpcode() == ISD::BUILD_VECTOR) {
4750 // If we have a build-vector, then things are easy.
4751 assert(MaskNode.getSimpleValueType().isInteger() &&
4752 MaskNode.getSimpleValueType().getVectorNumElements() ==
4753 VT.getVectorNumElements());
4755 for (unsigned i = 0; i < MaskNode->getNumOperands(); ++i) {
4756 SDValue Op = MaskNode->getOperand(i);
4757 if (Op->getOpcode() == ISD::UNDEF)
4758 RawMask.push_back((uint64_t)SM_SentinelUndef);
4759 else if (isa<ConstantSDNode>(Op)) {
4760 APInt MaskElement = cast<ConstantSDNode>(Op)->getAPIntValue();
4761 RawMask.push_back(MaskElement.getLoBits(MaskLoBits).getZExtValue());
4765 DecodeVPERMVMask(RawMask, Mask);
4768 if (MaskNode->getOpcode() == X86ISD::VBROADCAST) {
4769 unsigned NumEltsInMask = MaskNode->getNumOperands();
4770 MaskNode = MaskNode->getOperand(0);
4771 auto *CN = dyn_cast<ConstantSDNode>(MaskNode);
4773 APInt MaskEltValue = CN->getAPIntValue();
4774 for (unsigned i = 0; i < NumEltsInMask; ++i)
4775 RawMask.push_back(MaskEltValue.getLoBits(MaskLoBits).getZExtValue());
4776 DecodeVPERMVMask(RawMask, Mask);
4779 // It may be a scalar load
4782 auto *MaskLoad = dyn_cast<LoadSDNode>(MaskNode);
4786 SDValue Ptr = MaskLoad->getBasePtr();
4787 if (Ptr->getOpcode() == X86ISD::Wrapper ||
4788 Ptr->getOpcode() == X86ISD::WrapperRIP)
4789 Ptr = Ptr->getOperand(0);
4791 auto *MaskCP = dyn_cast<ConstantPoolSDNode>(Ptr);
4792 if (!MaskCP || MaskCP->isMachineConstantPoolEntry())
4795 auto *C = dyn_cast<Constant>(MaskCP->getConstVal());
4797 DecodeVPERMVMask(C, VT, Mask);
4804 case X86ISD::VPERMV3: {
4806 SDValue MaskNode = N->getOperand(1);
4807 while (MaskNode->getOpcode() == ISD::BITCAST)
4808 MaskNode = MaskNode->getOperand(1);
4810 if (MaskNode->getOpcode() == ISD::BUILD_VECTOR) {
4811 // If we have a build-vector, then things are easy.
4812 assert(MaskNode.getSimpleValueType().isInteger() &&
4813 MaskNode.getSimpleValueType().getVectorNumElements() ==
4814 VT.getVectorNumElements());
4816 SmallVector<uint64_t, 32> RawMask;
4817 unsigned MaskLoBits = Log2_64(VT.getVectorNumElements()*2);
4819 for (unsigned i = 0; i < MaskNode->getNumOperands(); ++i) {
4820 SDValue Op = MaskNode->getOperand(i);
4821 if (Op->getOpcode() == ISD::UNDEF)
4822 RawMask.push_back((uint64_t)SM_SentinelUndef);
4824 auto *CN = dyn_cast<ConstantSDNode>(Op.getNode());
4827 APInt MaskElement = CN->getAPIntValue();
4828 RawMask.push_back(MaskElement.getLoBits(MaskLoBits).getZExtValue());
4831 DecodeVPERMV3Mask(RawMask, Mask);
4835 auto *MaskLoad = dyn_cast<LoadSDNode>(MaskNode);
4839 SDValue Ptr = MaskLoad->getBasePtr();
4840 if (Ptr->getOpcode() == X86ISD::Wrapper ||
4841 Ptr->getOpcode() == X86ISD::WrapperRIP)
4842 Ptr = Ptr->getOperand(0);
4844 auto *MaskCP = dyn_cast<ConstantPoolSDNode>(Ptr);
4845 if (!MaskCP || MaskCP->isMachineConstantPoolEntry())
4848 auto *C = dyn_cast<Constant>(MaskCP->getConstVal());
4850 DecodeVPERMV3Mask(C, VT, Mask);
4857 default: llvm_unreachable("unknown target shuffle node");
4860 // If we have a fake unary shuffle, the shuffle mask is spread across two
4861 // inputs that are actually the same node. Re-map the mask to always point
4862 // into the first input.
4865 if (M >= (int)Mask.size())
4871 /// Returns the scalar element that will make up the ith
4872 /// element of the result of the vector shuffle.
4873 static SDValue getShuffleScalarElt(SDNode *N, unsigned Index, SelectionDAG &DAG,
4876 return SDValue(); // Limit search depth.
4878 SDValue V = SDValue(N, 0);
4879 EVT VT = V.getValueType();
4880 unsigned Opcode = V.getOpcode();
4882 // Recurse into ISD::VECTOR_SHUFFLE node to find scalars.
4883 if (const ShuffleVectorSDNode *SV = dyn_cast<ShuffleVectorSDNode>(N)) {
4884 int Elt = SV->getMaskElt(Index);
4887 return DAG.getUNDEF(VT.getVectorElementType());
4889 unsigned NumElems = VT.getVectorNumElements();
4890 SDValue NewV = (Elt < (int)NumElems) ? SV->getOperand(0)
4891 : SV->getOperand(1);
4892 return getShuffleScalarElt(NewV.getNode(), Elt % NumElems, DAG, Depth+1);
4895 // Recurse into target specific vector shuffles to find scalars.
4896 if (isTargetShuffle(Opcode)) {
4897 MVT ShufVT = V.getSimpleValueType();
4898 unsigned NumElems = ShufVT.getVectorNumElements();
4899 SmallVector<int, 16> ShuffleMask;
4902 if (!getTargetShuffleMask(N, ShufVT, ShuffleMask, IsUnary))
4905 int Elt = ShuffleMask[Index];
4907 return DAG.getUNDEF(ShufVT.getVectorElementType());
4909 SDValue NewV = (Elt < (int)NumElems) ? N->getOperand(0)
4911 return getShuffleScalarElt(NewV.getNode(), Elt % NumElems, DAG,
4915 // Actual nodes that may contain scalar elements
4916 if (Opcode == ISD::BITCAST) {
4917 V = V.getOperand(0);
4918 EVT SrcVT = V.getValueType();
4919 unsigned NumElems = VT.getVectorNumElements();
4921 if (!SrcVT.isVector() || SrcVT.getVectorNumElements() != NumElems)
4925 if (V.getOpcode() == ISD::SCALAR_TO_VECTOR)
4926 return (Index == 0) ? V.getOperand(0)
4927 : DAG.getUNDEF(VT.getVectorElementType());
4929 if (V.getOpcode() == ISD::BUILD_VECTOR)
4930 return V.getOperand(Index);
4935 /// Custom lower build_vector of v16i8.
4936 static SDValue LowerBuildVectorv16i8(SDValue Op, unsigned NonZeros,
4937 unsigned NumNonZero, unsigned NumZero,
4939 const X86Subtarget* Subtarget,
4940 const TargetLowering &TLI) {
4948 // SSE4.1 - use PINSRB to insert each byte directly.
4949 if (Subtarget->hasSSE41()) {
4950 for (unsigned i = 0; i < 16; ++i) {
4951 bool isNonZero = (NonZeros & (1 << i)) != 0;
4955 V = getZeroVector(MVT::v16i8, Subtarget, DAG, dl);
4957 V = DAG.getUNDEF(MVT::v16i8);
4960 V = DAG.getNode(ISD::INSERT_VECTOR_ELT, dl,
4961 MVT::v16i8, V, Op.getOperand(i),
4962 DAG.getIntPtrConstant(i, dl));
4969 // Pre-SSE4.1 - merge byte pairs and insert with PINSRW.
4970 for (unsigned i = 0; i < 16; ++i) {
4971 bool ThisIsNonZero = (NonZeros & (1 << i)) != 0;
4972 if (ThisIsNonZero && First) {
4974 V = getZeroVector(MVT::v8i16, Subtarget, DAG, dl);
4976 V = DAG.getUNDEF(MVT::v8i16);
4981 SDValue ThisElt, LastElt;
4982 bool LastIsNonZero = (NonZeros & (1 << (i-1))) != 0;
4983 if (LastIsNonZero) {
4984 LastElt = DAG.getNode(ISD::ZERO_EXTEND, dl,
4985 MVT::i16, Op.getOperand(i-1));
4987 if (ThisIsNonZero) {
4988 ThisElt = DAG.getNode(ISD::ZERO_EXTEND, dl, MVT::i16, Op.getOperand(i));
4989 ThisElt = DAG.getNode(ISD::SHL, dl, MVT::i16,
4990 ThisElt, DAG.getConstant(8, dl, MVT::i8));
4992 ThisElt = DAG.getNode(ISD::OR, dl, MVT::i16, ThisElt, LastElt);
4996 if (ThisElt.getNode())
4997 V = DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, MVT::v8i16, V, ThisElt,
4998 DAG.getIntPtrConstant(i/2, dl));
5002 return DAG.getBitcast(MVT::v16i8, V);
5005 /// Custom lower build_vector of v8i16.
5006 static SDValue LowerBuildVectorv8i16(SDValue Op, unsigned NonZeros,
5007 unsigned NumNonZero, unsigned NumZero,
5009 const X86Subtarget* Subtarget,
5010 const TargetLowering &TLI) {
5017 for (unsigned i = 0; i < 8; ++i) {
5018 bool isNonZero = (NonZeros & (1 << i)) != 0;
5022 V = getZeroVector(MVT::v8i16, Subtarget, DAG, dl);
5024 V = DAG.getUNDEF(MVT::v8i16);
5027 V = DAG.getNode(ISD::INSERT_VECTOR_ELT, dl,
5028 MVT::v8i16, V, Op.getOperand(i),
5029 DAG.getIntPtrConstant(i, dl));
5036 /// Custom lower build_vector of v4i32 or v4f32.
5037 static SDValue LowerBuildVectorv4x32(SDValue Op, SelectionDAG &DAG,
5038 const X86Subtarget *Subtarget,
5039 const TargetLowering &TLI) {
5040 // Find all zeroable elements.
5041 std::bitset<4> Zeroable;
5042 for (int i=0; i < 4; ++i) {
5043 SDValue Elt = Op->getOperand(i);
5044 Zeroable[i] = (Elt.getOpcode() == ISD::UNDEF || X86::isZeroNode(Elt));
5046 assert(Zeroable.size() - Zeroable.count() > 1 &&
5047 "We expect at least two non-zero elements!");
5049 // We only know how to deal with build_vector nodes where elements are either
5050 // zeroable or extract_vector_elt with constant index.
5051 SDValue FirstNonZero;
5052 unsigned FirstNonZeroIdx;
5053 for (unsigned i=0; i < 4; ++i) {
5056 SDValue Elt = Op->getOperand(i);
5057 if (Elt.getOpcode() != ISD::EXTRACT_VECTOR_ELT ||
5058 !isa<ConstantSDNode>(Elt.getOperand(1)))
5060 // Make sure that this node is extracting from a 128-bit vector.
5061 MVT VT = Elt.getOperand(0).getSimpleValueType();
5062 if (!VT.is128BitVector())
5064 if (!FirstNonZero.getNode()) {
5066 FirstNonZeroIdx = i;
5070 assert(FirstNonZero.getNode() && "Unexpected build vector of all zeros!");
5071 SDValue V1 = FirstNonZero.getOperand(0);
5072 MVT VT = V1.getSimpleValueType();
5074 // See if this build_vector can be lowered as a blend with zero.
5076 unsigned EltMaskIdx, EltIdx;
5078 for (EltIdx = 0; EltIdx < 4; ++EltIdx) {
5079 if (Zeroable[EltIdx]) {
5080 // The zero vector will be on the right hand side.
5081 Mask[EltIdx] = EltIdx+4;
5085 Elt = Op->getOperand(EltIdx);
5086 // By construction, Elt is a EXTRACT_VECTOR_ELT with constant index.
5087 EltMaskIdx = cast<ConstantSDNode>(Elt.getOperand(1))->getZExtValue();
5088 if (Elt.getOperand(0) != V1 || EltMaskIdx != EltIdx)
5090 Mask[EltIdx] = EltIdx;
5094 // Let the shuffle legalizer deal with blend operations.
5095 SDValue VZero = getZeroVector(VT, Subtarget, DAG, SDLoc(Op));
5096 if (V1.getSimpleValueType() != VT)
5097 V1 = DAG.getNode(ISD::BITCAST, SDLoc(V1), VT, V1);
5098 return DAG.getVectorShuffle(VT, SDLoc(V1), V1, VZero, &Mask[0]);
5101 // See if we can lower this build_vector to a INSERTPS.
5102 if (!Subtarget->hasSSE41())
5105 SDValue V2 = Elt.getOperand(0);
5106 if (Elt == FirstNonZero && EltIdx == FirstNonZeroIdx)
5109 bool CanFold = true;
5110 for (unsigned i = EltIdx + 1; i < 4 && CanFold; ++i) {
5114 SDValue Current = Op->getOperand(i);
5115 SDValue SrcVector = Current->getOperand(0);
5118 CanFold = SrcVector == V1 &&
5119 cast<ConstantSDNode>(Current.getOperand(1))->getZExtValue() == i;
5125 assert(V1.getNode() && "Expected at least two non-zero elements!");
5126 if (V1.getSimpleValueType() != MVT::v4f32)
5127 V1 = DAG.getNode(ISD::BITCAST, SDLoc(V1), MVT::v4f32, V1);
5128 if (V2.getSimpleValueType() != MVT::v4f32)
5129 V2 = DAG.getNode(ISD::BITCAST, SDLoc(V2), MVT::v4f32, V2);
5131 // Ok, we can emit an INSERTPS instruction.
5132 unsigned ZMask = Zeroable.to_ulong();
5134 unsigned InsertPSMask = EltMaskIdx << 6 | EltIdx << 4 | ZMask;
5135 assert((InsertPSMask & ~0xFFu) == 0 && "Invalid mask!");
5137 SDValue Result = DAG.getNode(X86ISD::INSERTPS, DL, MVT::v4f32, V1, V2,
5138 DAG.getIntPtrConstant(InsertPSMask, DL));
5139 return DAG.getBitcast(VT, Result);
5142 /// Return a vector logical shift node.
5143 static SDValue getVShift(bool isLeft, EVT VT, SDValue SrcOp,
5144 unsigned NumBits, SelectionDAG &DAG,
5145 const TargetLowering &TLI, SDLoc dl) {
5146 assert(VT.is128BitVector() && "Unknown type for VShift");
5147 MVT ShVT = MVT::v2i64;
5148 unsigned Opc = isLeft ? X86ISD::VSHLDQ : X86ISD::VSRLDQ;
5149 SrcOp = DAG.getBitcast(ShVT, SrcOp);
5150 MVT ScalarShiftTy = TLI.getScalarShiftAmountTy(DAG.getDataLayout(), VT);
5151 assert(NumBits % 8 == 0 && "Only support byte sized shifts");
5152 SDValue ShiftVal = DAG.getConstant(NumBits/8, dl, ScalarShiftTy);
5153 return DAG.getBitcast(VT, DAG.getNode(Opc, dl, ShVT, SrcOp, ShiftVal));
5157 LowerAsSplatVectorLoad(SDValue SrcOp, MVT VT, SDLoc dl, SelectionDAG &DAG) {
5159 // Check if the scalar load can be widened into a vector load. And if
5160 // the address is "base + cst" see if the cst can be "absorbed" into
5161 // the shuffle mask.
5162 if (LoadSDNode *LD = dyn_cast<LoadSDNode>(SrcOp)) {
5163 SDValue Ptr = LD->getBasePtr();
5164 if (!ISD::isNormalLoad(LD) || LD->isVolatile())
5166 EVT PVT = LD->getValueType(0);
5167 if (PVT != MVT::i32 && PVT != MVT::f32)
5172 if (FrameIndexSDNode *FINode = dyn_cast<FrameIndexSDNode>(Ptr)) {
5173 FI = FINode->getIndex();
5175 } else if (DAG.isBaseWithConstantOffset(Ptr) &&
5176 isa<FrameIndexSDNode>(Ptr.getOperand(0))) {
5177 FI = cast<FrameIndexSDNode>(Ptr.getOperand(0))->getIndex();
5178 Offset = Ptr.getConstantOperandVal(1);
5179 Ptr = Ptr.getOperand(0);
5184 // FIXME: 256-bit vector instructions don't require a strict alignment,
5185 // improve this code to support it better.
5186 unsigned RequiredAlign = VT.getSizeInBits()/8;
5187 SDValue Chain = LD->getChain();
5188 // Make sure the stack object alignment is at least 16 or 32.
5189 MachineFrameInfo *MFI = DAG.getMachineFunction().getFrameInfo();
5190 if (DAG.InferPtrAlignment(Ptr) < RequiredAlign) {
5191 if (MFI->isFixedObjectIndex(FI)) {
5192 // Can't change the alignment. FIXME: It's possible to compute
5193 // the exact stack offset and reference FI + adjust offset instead.
5194 // If someone *really* cares about this. That's the way to implement it.
5197 MFI->setObjectAlignment(FI, RequiredAlign);
5201 // (Offset % 16 or 32) must be multiple of 4. Then address is then
5202 // Ptr + (Offset & ~15).
5205 if ((Offset % RequiredAlign) & 3)
5207 int64_t StartOffset = Offset & ~int64_t(RequiredAlign - 1);
5210 Ptr = DAG.getNode(ISD::ADD, DL, Ptr.getValueType(), Ptr,
5211 DAG.getConstant(StartOffset, DL, Ptr.getValueType()));
5214 int EltNo = (Offset - StartOffset) >> 2;
5215 unsigned NumElems = VT.getVectorNumElements();
5217 EVT NVT = EVT::getVectorVT(*DAG.getContext(), PVT, NumElems);
5218 SDValue V1 = DAG.getLoad(NVT, dl, Chain, Ptr,
5219 LD->getPointerInfo().getWithOffset(StartOffset),
5220 false, false, false, 0);
5222 SmallVector<int, 8> Mask(NumElems, EltNo);
5224 return DAG.getVectorShuffle(NVT, dl, V1, DAG.getUNDEF(NVT), &Mask[0]);
5230 /// Given the initializing elements 'Elts' of a vector of type 'VT', see if the
5231 /// elements can be replaced by a single large load which has the same value as
5232 /// a build_vector or insert_subvector whose loaded operands are 'Elts'.
5234 /// Example: <load i32 *a, load i32 *a+4, undef, undef> -> zextload a
5236 /// FIXME: we'd also like to handle the case where the last elements are zero
5237 /// rather than undef via VZEXT_LOAD, but we do not detect that case today.
5238 /// There's even a handy isZeroNode for that purpose.
5239 static SDValue EltsFromConsecutiveLoads(EVT VT, ArrayRef<SDValue> Elts,
5240 SDLoc &DL, SelectionDAG &DAG,
5241 bool isAfterLegalize) {
5242 unsigned NumElems = Elts.size();
5244 LoadSDNode *LDBase = nullptr;
5245 unsigned LastLoadedElt = -1U;
5247 // For each element in the initializer, see if we've found a load or an undef.
5248 // If we don't find an initial load element, or later load elements are
5249 // non-consecutive, bail out.
5250 for (unsigned i = 0; i < NumElems; ++i) {
5251 SDValue Elt = Elts[i];
5252 // Look through a bitcast.
5253 if (Elt.getNode() && Elt.getOpcode() == ISD::BITCAST)
5254 Elt = Elt.getOperand(0);
5255 if (!Elt.getNode() ||
5256 (Elt.getOpcode() != ISD::UNDEF && !ISD::isNON_EXTLoad(Elt.getNode())))
5259 if (Elt.getNode()->getOpcode() == ISD::UNDEF)
5261 LDBase = cast<LoadSDNode>(Elt.getNode());
5265 if (Elt.getOpcode() == ISD::UNDEF)
5268 LoadSDNode *LD = cast<LoadSDNode>(Elt);
5269 EVT LdVT = Elt.getValueType();
5270 // Each loaded element must be the correct fractional portion of the
5271 // requested vector load.
5272 if (LdVT.getSizeInBits() != VT.getSizeInBits() / NumElems)
5274 if (!DAG.isConsecutiveLoad(LD, LDBase, LdVT.getSizeInBits() / 8, i))
5279 // If we have found an entire vector of loads and undefs, then return a large
5280 // load of the entire vector width starting at the base pointer. If we found
5281 // consecutive loads for the low half, generate a vzext_load node.
5282 if (LastLoadedElt == NumElems - 1) {
5283 assert(LDBase && "Did not find base load for merging consecutive loads");
5284 EVT EltVT = LDBase->getValueType(0);
5285 // Ensure that the input vector size for the merged loads matches the
5286 // cumulative size of the input elements.
5287 if (VT.getSizeInBits() != EltVT.getSizeInBits() * NumElems)
5290 if (isAfterLegalize &&
5291 !DAG.getTargetLoweringInfo().isOperationLegal(ISD::LOAD, VT))
5294 SDValue NewLd = SDValue();
5296 NewLd = DAG.getLoad(VT, DL, LDBase->getChain(), LDBase->getBasePtr(),
5297 LDBase->getPointerInfo(), LDBase->isVolatile(),
5298 LDBase->isNonTemporal(), LDBase->isInvariant(),
5299 LDBase->getAlignment());
5301 if (LDBase->hasAnyUseOfValue(1)) {
5302 SDValue NewChain = DAG.getNode(ISD::TokenFactor, DL, MVT::Other,
5304 SDValue(NewLd.getNode(), 1));
5305 DAG.ReplaceAllUsesOfValueWith(SDValue(LDBase, 1), NewChain);
5306 DAG.UpdateNodeOperands(NewChain.getNode(), SDValue(LDBase, 1),
5307 SDValue(NewLd.getNode(), 1));
5313 //TODO: The code below fires only for for loading the low v2i32 / v2f32
5314 //of a v4i32 / v4f32. It's probably worth generalizing.
5315 EVT EltVT = VT.getVectorElementType();
5316 if (NumElems == 4 && LastLoadedElt == 1 && (EltVT.getSizeInBits() == 32) &&
5317 DAG.getTargetLoweringInfo().isTypeLegal(MVT::v2i64)) {
5318 SDVTList Tys = DAG.getVTList(MVT::v2i64, MVT::Other);
5319 SDValue Ops[] = { LDBase->getChain(), LDBase->getBasePtr() };
5321 DAG.getMemIntrinsicNode(X86ISD::VZEXT_LOAD, DL, Tys, Ops, MVT::i64,
5322 LDBase->getPointerInfo(),
5323 LDBase->getAlignment(),
5324 false/*isVolatile*/, true/*ReadMem*/,
5327 // Make sure the newly-created LOAD is in the same position as LDBase in
5328 // terms of dependency. We create a TokenFactor for LDBase and ResNode, and
5329 // update uses of LDBase's output chain to use the TokenFactor.
5330 if (LDBase->hasAnyUseOfValue(1)) {
5331 SDValue NewChain = DAG.getNode(ISD::TokenFactor, DL, MVT::Other,
5332 SDValue(LDBase, 1), SDValue(ResNode.getNode(), 1));
5333 DAG.ReplaceAllUsesOfValueWith(SDValue(LDBase, 1), NewChain);
5334 DAG.UpdateNodeOperands(NewChain.getNode(), SDValue(LDBase, 1),
5335 SDValue(ResNode.getNode(), 1));
5338 return DAG.getBitcast(VT, ResNode);
5343 /// LowerVectorBroadcast - Attempt to use the vbroadcast instruction
5344 /// to generate a splat value for the following cases:
5345 /// 1. A splat BUILD_VECTOR which uses a single scalar load, or a constant.
5346 /// 2. A splat shuffle which uses a scalar_to_vector node which comes from
5347 /// a scalar load, or a constant.
5348 /// The VBROADCAST node is returned when a pattern is found,
5349 /// or SDValue() otherwise.
5350 static SDValue LowerVectorBroadcast(SDValue Op, const X86Subtarget* Subtarget,
5351 SelectionDAG &DAG) {
5352 // VBROADCAST requires AVX.
5353 // TODO: Splats could be generated for non-AVX CPUs using SSE
5354 // instructions, but there's less potential gain for only 128-bit vectors.
5355 if (!Subtarget->hasAVX())
5358 MVT VT = Op.getSimpleValueType();
5361 assert((VT.is128BitVector() || VT.is256BitVector() || VT.is512BitVector()) &&
5362 "Unsupported vector type for broadcast.");
5367 switch (Op.getOpcode()) {
5369 // Unknown pattern found.
5372 case ISD::BUILD_VECTOR: {
5373 auto *BVOp = cast<BuildVectorSDNode>(Op.getNode());
5374 BitVector UndefElements;
5375 SDValue Splat = BVOp->getSplatValue(&UndefElements);
5377 // We need a splat of a single value to use broadcast, and it doesn't
5378 // make any sense if the value is only in one element of the vector.
5379 if (!Splat || (VT.getVectorNumElements() - UndefElements.count()) <= 1)
5383 ConstSplatVal = (Ld.getOpcode() == ISD::Constant ||
5384 Ld.getOpcode() == ISD::ConstantFP);
5386 // Make sure that all of the users of a non-constant load are from the
5387 // BUILD_VECTOR node.
5388 if (!ConstSplatVal && !BVOp->isOnlyUserOf(Ld.getNode()))
5393 case ISD::VECTOR_SHUFFLE: {
5394 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
5396 // Shuffles must have a splat mask where the first element is
5398 if ((!SVOp->isSplat()) || SVOp->getMaskElt(0) != 0)
5401 SDValue Sc = Op.getOperand(0);
5402 if (Sc.getOpcode() != ISD::SCALAR_TO_VECTOR &&
5403 Sc.getOpcode() != ISD::BUILD_VECTOR) {
5405 if (!Subtarget->hasInt256())
5408 // Use the register form of the broadcast instruction available on AVX2.
5409 if (VT.getSizeInBits() >= 256)
5410 Sc = Extract128BitVector(Sc, 0, DAG, dl);
5411 return DAG.getNode(X86ISD::VBROADCAST, dl, VT, Sc);
5414 Ld = Sc.getOperand(0);
5415 ConstSplatVal = (Ld.getOpcode() == ISD::Constant ||
5416 Ld.getOpcode() == ISD::ConstantFP);
5418 // The scalar_to_vector node and the suspected
5419 // load node must have exactly one user.
5420 // Constants may have multiple users.
5422 // AVX-512 has register version of the broadcast
5423 bool hasRegVer = Subtarget->hasAVX512() && VT.is512BitVector() &&
5424 Ld.getValueType().getSizeInBits() >= 32;
5425 if (!ConstSplatVal && ((!Sc.hasOneUse() || !Ld.hasOneUse()) &&
5432 unsigned ScalarSize = Ld.getValueType().getSizeInBits();
5433 bool IsGE256 = (VT.getSizeInBits() >= 256);
5435 // When optimizing for size, generate up to 5 extra bytes for a broadcast
5436 // instruction to save 8 or more bytes of constant pool data.
5437 // TODO: If multiple splats are generated to load the same constant,
5438 // it may be detrimental to overall size. There needs to be a way to detect
5439 // that condition to know if this is truly a size win.
5440 bool OptForSize = DAG.getMachineFunction().getFunction()->optForSize();
5442 // Handle broadcasting a single constant scalar from the constant pool
5444 // On Sandybridge (no AVX2), it is still better to load a constant vector
5445 // from the constant pool and not to broadcast it from a scalar.
5446 // But override that restriction when optimizing for size.
5447 // TODO: Check if splatting is recommended for other AVX-capable CPUs.
5448 if (ConstSplatVal && (Subtarget->hasAVX2() || OptForSize)) {
5449 EVT CVT = Ld.getValueType();
5450 assert(!CVT.isVector() && "Must not broadcast a vector type");
5452 // Splat f32, i32, v4f64, v4i64 in all cases with AVX2.
5453 // For size optimization, also splat v2f64 and v2i64, and for size opt
5454 // with AVX2, also splat i8 and i16.
5455 // With pattern matching, the VBROADCAST node may become a VMOVDDUP.
5456 if (ScalarSize == 32 || (IsGE256 && ScalarSize == 64) ||
5457 (OptForSize && (ScalarSize == 64 || Subtarget->hasAVX2()))) {
5458 const Constant *C = nullptr;
5459 if (ConstantSDNode *CI = dyn_cast<ConstantSDNode>(Ld))
5460 C = CI->getConstantIntValue();
5461 else if (ConstantFPSDNode *CF = dyn_cast<ConstantFPSDNode>(Ld))
5462 C = CF->getConstantFPValue();
5464 assert(C && "Invalid constant type");
5466 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
5468 DAG.getConstantPool(C, TLI.getPointerTy(DAG.getDataLayout()));
5469 unsigned Alignment = cast<ConstantPoolSDNode>(CP)->getAlignment();
5471 CVT, dl, DAG.getEntryNode(), CP,
5472 MachinePointerInfo::getConstantPool(DAG.getMachineFunction()), false,
5473 false, false, Alignment);
5475 return DAG.getNode(X86ISD::VBROADCAST, dl, VT, Ld);
5479 bool IsLoad = ISD::isNormalLoad(Ld.getNode());
5481 // Handle AVX2 in-register broadcasts.
5482 if (!IsLoad && Subtarget->hasInt256() &&
5483 (ScalarSize == 32 || (IsGE256 && ScalarSize == 64)))
5484 return DAG.getNode(X86ISD::VBROADCAST, dl, VT, Ld);
5486 // The scalar source must be a normal load.
5490 if (ScalarSize == 32 || (IsGE256 && ScalarSize == 64) ||
5491 (Subtarget->hasVLX() && ScalarSize == 64))
5492 return DAG.getNode(X86ISD::VBROADCAST, dl, VT, Ld);
5494 // The integer check is needed for the 64-bit into 128-bit so it doesn't match
5495 // double since there is no vbroadcastsd xmm
5496 if (Subtarget->hasInt256() && Ld.getValueType().isInteger()) {
5497 if (ScalarSize == 8 || ScalarSize == 16 || ScalarSize == 64)
5498 return DAG.getNode(X86ISD::VBROADCAST, dl, VT, Ld);
5501 // Unsupported broadcast.
5505 /// \brief For an EXTRACT_VECTOR_ELT with a constant index return the real
5506 /// underlying vector and index.
5508 /// Modifies \p ExtractedFromVec to the real vector and returns the real
5510 static int getUnderlyingExtractedFromVec(SDValue &ExtractedFromVec,
5512 int Idx = cast<ConstantSDNode>(ExtIdx)->getZExtValue();
5513 if (!isa<ShuffleVectorSDNode>(ExtractedFromVec))
5516 // For 256-bit vectors, LowerEXTRACT_VECTOR_ELT_SSE4 may have already
5518 // (extract_vector_elt (v8f32 %vreg1), Constant<6>)
5520 // (extract_vector_elt (vector_shuffle<2,u,u,u>
5521 // (extract_subvector (v8f32 %vreg0), Constant<4>),
5524 // In this case the vector is the extract_subvector expression and the index
5525 // is 2, as specified by the shuffle.
5526 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(ExtractedFromVec);
5527 SDValue ShuffleVec = SVOp->getOperand(0);
5528 MVT ShuffleVecVT = ShuffleVec.getSimpleValueType();
5529 assert(ShuffleVecVT.getVectorElementType() ==
5530 ExtractedFromVec.getSimpleValueType().getVectorElementType());
5532 int ShuffleIdx = SVOp->getMaskElt(Idx);
5533 if (isUndefOrInRange(ShuffleIdx, 0, ShuffleVecVT.getVectorNumElements())) {
5534 ExtractedFromVec = ShuffleVec;
5540 static SDValue buildFromShuffleMostly(SDValue Op, SelectionDAG &DAG) {
5541 MVT VT = Op.getSimpleValueType();
5543 // Skip if insert_vec_elt is not supported.
5544 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
5545 if (!TLI.isOperationLegalOrCustom(ISD::INSERT_VECTOR_ELT, VT))
5549 unsigned NumElems = Op.getNumOperands();
5553 SmallVector<unsigned, 4> InsertIndices;
5554 SmallVector<int, 8> Mask(NumElems, -1);
5556 for (unsigned i = 0; i != NumElems; ++i) {
5557 unsigned Opc = Op.getOperand(i).getOpcode();
5559 if (Opc == ISD::UNDEF)
5562 if (Opc != ISD::EXTRACT_VECTOR_ELT) {
5563 // Quit if more than 1 elements need inserting.
5564 if (InsertIndices.size() > 1)
5567 InsertIndices.push_back(i);
5571 SDValue ExtractedFromVec = Op.getOperand(i).getOperand(0);
5572 SDValue ExtIdx = Op.getOperand(i).getOperand(1);
5573 // Quit if non-constant index.
5574 if (!isa<ConstantSDNode>(ExtIdx))
5576 int Idx = getUnderlyingExtractedFromVec(ExtractedFromVec, ExtIdx);
5578 // Quit if extracted from vector of different type.
5579 if (ExtractedFromVec.getValueType() != VT)
5582 if (!VecIn1.getNode())
5583 VecIn1 = ExtractedFromVec;
5584 else if (VecIn1 != ExtractedFromVec) {
5585 if (!VecIn2.getNode())
5586 VecIn2 = ExtractedFromVec;
5587 else if (VecIn2 != ExtractedFromVec)
5588 // Quit if more than 2 vectors to shuffle
5592 if (ExtractedFromVec == VecIn1)
5594 else if (ExtractedFromVec == VecIn2)
5595 Mask[i] = Idx + NumElems;
5598 if (!VecIn1.getNode())
5601 VecIn2 = VecIn2.getNode() ? VecIn2 : DAG.getUNDEF(VT);
5602 SDValue NV = DAG.getVectorShuffle(VT, DL, VecIn1, VecIn2, &Mask[0]);
5603 for (unsigned i = 0, e = InsertIndices.size(); i != e; ++i) {
5604 unsigned Idx = InsertIndices[i];
5605 NV = DAG.getNode(ISD::INSERT_VECTOR_ELT, DL, VT, NV, Op.getOperand(Idx),
5606 DAG.getIntPtrConstant(Idx, DL));
5612 static SDValue ConvertI1VectorToInteger(SDValue Op, SelectionDAG &DAG) {
5613 assert(ISD::isBuildVectorOfConstantSDNodes(Op.getNode()) &&
5614 Op.getScalarValueSizeInBits() == 1 &&
5615 "Can not convert non-constant vector");
5616 uint64_t Immediate = 0;
5617 for (unsigned idx = 0, e = Op.getNumOperands(); idx < e; ++idx) {
5618 SDValue In = Op.getOperand(idx);
5619 if (In.getOpcode() != ISD::UNDEF)
5620 Immediate |= cast<ConstantSDNode>(In)->getZExtValue() << idx;
5624 MVT::getIntegerVT(std::max((int)Op.getValueType().getSizeInBits(), 8));
5625 return DAG.getConstant(Immediate, dl, VT);
5627 // Lower BUILD_VECTOR operation for v8i1 and v16i1 types.
5629 X86TargetLowering::LowerBUILD_VECTORvXi1(SDValue Op, SelectionDAG &DAG) const {
5631 MVT VT = Op.getSimpleValueType();
5632 assert((VT.getVectorElementType() == MVT::i1) &&
5633 "Unexpected type in LowerBUILD_VECTORvXi1!");
5636 if (ISD::isBuildVectorAllZeros(Op.getNode())) {
5637 SDValue Cst = DAG.getTargetConstant(0, dl, MVT::i1);
5638 SmallVector<SDValue, 16> Ops(VT.getVectorNumElements(), Cst);
5639 return DAG.getNode(ISD::BUILD_VECTOR, dl, VT, Ops);
5642 if (ISD::isBuildVectorAllOnes(Op.getNode())) {
5643 SDValue Cst = DAG.getTargetConstant(1, dl, MVT::i1);
5644 SmallVector<SDValue, 16> Ops(VT.getVectorNumElements(), Cst);
5645 return DAG.getNode(ISD::BUILD_VECTOR, dl, VT, Ops);
5648 if (ISD::isBuildVectorOfConstantSDNodes(Op.getNode())) {
5649 SDValue Imm = ConvertI1VectorToInteger(Op, DAG);
5650 if (Imm.getValueSizeInBits() == VT.getSizeInBits())
5651 return DAG.getBitcast(VT, Imm);
5652 SDValue ExtVec = DAG.getBitcast(MVT::v8i1, Imm);
5653 return DAG.getNode(ISD::EXTRACT_SUBVECTOR, dl, VT, ExtVec,
5654 DAG.getIntPtrConstant(0, dl));
5657 // Vector has one or more non-const elements
5658 uint64_t Immediate = 0;
5659 SmallVector<unsigned, 16> NonConstIdx;
5660 bool IsSplat = true;
5661 bool HasConstElts = false;
5663 for (unsigned idx = 0, e = Op.getNumOperands(); idx < e; ++idx) {
5664 SDValue In = Op.getOperand(idx);
5665 if (In.getOpcode() == ISD::UNDEF)
5667 if (!isa<ConstantSDNode>(In))
5668 NonConstIdx.push_back(idx);
5670 Immediate |= cast<ConstantSDNode>(In)->getZExtValue() << idx;
5671 HasConstElts = true;
5675 else if (In != Op.getOperand(SplatIdx))
5679 // for splat use " (select i1 splat_elt, all-ones, all-zeroes)"
5681 return DAG.getNode(ISD::SELECT, dl, VT, Op.getOperand(SplatIdx),
5682 DAG.getConstant(1, dl, VT),
5683 DAG.getConstant(0, dl, VT));
5685 // insert elements one by one
5689 MVT ImmVT = MVT::getIntegerVT(std::max((int)VT.getSizeInBits(), 8));
5690 Imm = DAG.getConstant(Immediate, dl, ImmVT);
5692 else if (HasConstElts)
5693 Imm = DAG.getConstant(0, dl, VT);
5695 Imm = DAG.getUNDEF(VT);
5696 if (Imm.getValueSizeInBits() == VT.getSizeInBits())
5697 DstVec = DAG.getBitcast(VT, Imm);
5699 SDValue ExtVec = DAG.getBitcast(MVT::v8i1, Imm);
5700 DstVec = DAG.getNode(ISD::EXTRACT_SUBVECTOR, dl, VT, ExtVec,
5701 DAG.getIntPtrConstant(0, dl));
5704 for (unsigned i = 0; i < NonConstIdx.size(); ++i) {
5705 unsigned InsertIdx = NonConstIdx[i];
5706 DstVec = DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, VT, DstVec,
5707 Op.getOperand(InsertIdx),
5708 DAG.getIntPtrConstant(InsertIdx, dl));
5713 /// \brief Return true if \p N implements a horizontal binop and return the
5714 /// operands for the horizontal binop into V0 and V1.
5716 /// This is a helper function of LowerToHorizontalOp().
5717 /// This function checks that the build_vector \p N in input implements a
5718 /// horizontal operation. Parameter \p Opcode defines the kind of horizontal
5719 /// operation to match.
5720 /// For example, if \p Opcode is equal to ISD::ADD, then this function
5721 /// checks if \p N implements a horizontal arithmetic add; if instead \p Opcode
5722 /// is equal to ISD::SUB, then this function checks if this is a horizontal
5725 /// This function only analyzes elements of \p N whose indices are
5726 /// in range [BaseIdx, LastIdx).
5727 static bool isHorizontalBinOp(const BuildVectorSDNode *N, unsigned Opcode,
5729 unsigned BaseIdx, unsigned LastIdx,
5730 SDValue &V0, SDValue &V1) {
5731 EVT VT = N->getValueType(0);
5733 assert(BaseIdx * 2 <= LastIdx && "Invalid Indices in input!");
5734 assert(VT.isVector() && VT.getVectorNumElements() >= LastIdx &&
5735 "Invalid Vector in input!");
5737 bool IsCommutable = (Opcode == ISD::ADD || Opcode == ISD::FADD);
5738 bool CanFold = true;
5739 unsigned ExpectedVExtractIdx = BaseIdx;
5740 unsigned NumElts = LastIdx - BaseIdx;
5741 V0 = DAG.getUNDEF(VT);
5742 V1 = DAG.getUNDEF(VT);
5744 // Check if N implements a horizontal binop.
5745 for (unsigned i = 0, e = NumElts; i != e && CanFold; ++i) {
5746 SDValue Op = N->getOperand(i + BaseIdx);
5749 if (Op->getOpcode() == ISD::UNDEF) {
5750 // Update the expected vector extract index.
5751 if (i * 2 == NumElts)
5752 ExpectedVExtractIdx = BaseIdx;
5753 ExpectedVExtractIdx += 2;
5757 CanFold = Op->getOpcode() == Opcode && Op->hasOneUse();
5762 SDValue Op0 = Op.getOperand(0);
5763 SDValue Op1 = Op.getOperand(1);
5765 // Try to match the following pattern:
5766 // (BINOP (extract_vector_elt A, I), (extract_vector_elt A, I+1))
5767 CanFold = (Op0.getOpcode() == ISD::EXTRACT_VECTOR_ELT &&
5768 Op1.getOpcode() == ISD::EXTRACT_VECTOR_ELT &&
5769 Op0.getOperand(0) == Op1.getOperand(0) &&
5770 isa<ConstantSDNode>(Op0.getOperand(1)) &&
5771 isa<ConstantSDNode>(Op1.getOperand(1)));
5775 unsigned I0 = cast<ConstantSDNode>(Op0.getOperand(1))->getZExtValue();
5776 unsigned I1 = cast<ConstantSDNode>(Op1.getOperand(1))->getZExtValue();
5778 if (i * 2 < NumElts) {
5779 if (V0.getOpcode() == ISD::UNDEF) {
5780 V0 = Op0.getOperand(0);
5781 if (V0.getValueType() != VT)
5785 if (V1.getOpcode() == ISD::UNDEF) {
5786 V1 = Op0.getOperand(0);
5787 if (V1.getValueType() != VT)
5790 if (i * 2 == NumElts)
5791 ExpectedVExtractIdx = BaseIdx;
5794 SDValue Expected = (i * 2 < NumElts) ? V0 : V1;
5795 if (I0 == ExpectedVExtractIdx)
5796 CanFold = I1 == I0 + 1 && Op0.getOperand(0) == Expected;
5797 else if (IsCommutable && I1 == ExpectedVExtractIdx) {
5798 // Try to match the following dag sequence:
5799 // (BINOP (extract_vector_elt A, I+1), (extract_vector_elt A, I))
5800 CanFold = I0 == I1 + 1 && Op1.getOperand(0) == Expected;
5804 ExpectedVExtractIdx += 2;
5810 /// \brief Emit a sequence of two 128-bit horizontal add/sub followed by
5811 /// a concat_vector.
5813 /// This is a helper function of LowerToHorizontalOp().
5814 /// This function expects two 256-bit vectors called V0 and V1.
5815 /// At first, each vector is split into two separate 128-bit vectors.
5816 /// Then, the resulting 128-bit vectors are used to implement two
5817 /// horizontal binary operations.
5819 /// The kind of horizontal binary operation is defined by \p X86Opcode.
5821 /// \p Mode specifies how the 128-bit parts of V0 and V1 are passed in input to
5822 /// the two new horizontal binop.
5823 /// When Mode is set, the first horizontal binop dag node would take as input
5824 /// the lower 128-bit of V0 and the upper 128-bit of V0. The second
5825 /// horizontal binop dag node would take as input the lower 128-bit of V1
5826 /// and the upper 128-bit of V1.
5828 /// HADD V0_LO, V0_HI
5829 /// HADD V1_LO, V1_HI
5831 /// Otherwise, the first horizontal binop dag node takes as input the lower
5832 /// 128-bit of V0 and the lower 128-bit of V1, and the second horizontal binop
5833 /// dag node takes the upper 128-bit of V0 and the upper 128-bit of V1.
5835 /// HADD V0_LO, V1_LO
5836 /// HADD V0_HI, V1_HI
5838 /// If \p isUndefLO is set, then the algorithm propagates UNDEF to the lower
5839 /// 128-bits of the result. If \p isUndefHI is set, then UNDEF is propagated to
5840 /// the upper 128-bits of the result.
5841 static SDValue ExpandHorizontalBinOp(const SDValue &V0, const SDValue &V1,
5842 SDLoc DL, SelectionDAG &DAG,
5843 unsigned X86Opcode, bool Mode,
5844 bool isUndefLO, bool isUndefHI) {
5845 EVT VT = V0.getValueType();
5846 assert(VT.is256BitVector() && VT == V1.getValueType() &&
5847 "Invalid nodes in input!");
5849 unsigned NumElts = VT.getVectorNumElements();
5850 SDValue V0_LO = Extract128BitVector(V0, 0, DAG, DL);
5851 SDValue V0_HI = Extract128BitVector(V0, NumElts/2, DAG, DL);
5852 SDValue V1_LO = Extract128BitVector(V1, 0, DAG, DL);
5853 SDValue V1_HI = Extract128BitVector(V1, NumElts/2, DAG, DL);
5854 EVT NewVT = V0_LO.getValueType();
5856 SDValue LO = DAG.getUNDEF(NewVT);
5857 SDValue HI = DAG.getUNDEF(NewVT);
5860 // Don't emit a horizontal binop if the result is expected to be UNDEF.
5861 if (!isUndefLO && V0->getOpcode() != ISD::UNDEF)
5862 LO = DAG.getNode(X86Opcode, DL, NewVT, V0_LO, V0_HI);
5863 if (!isUndefHI && V1->getOpcode() != ISD::UNDEF)
5864 HI = DAG.getNode(X86Opcode, DL, NewVT, V1_LO, V1_HI);
5866 // Don't emit a horizontal binop if the result is expected to be UNDEF.
5867 if (!isUndefLO && (V0_LO->getOpcode() != ISD::UNDEF ||
5868 V1_LO->getOpcode() != ISD::UNDEF))
5869 LO = DAG.getNode(X86Opcode, DL, NewVT, V0_LO, V1_LO);
5871 if (!isUndefHI && (V0_HI->getOpcode() != ISD::UNDEF ||
5872 V1_HI->getOpcode() != ISD::UNDEF))
5873 HI = DAG.getNode(X86Opcode, DL, NewVT, V0_HI, V1_HI);
5876 return DAG.getNode(ISD::CONCAT_VECTORS, DL, VT, LO, HI);
5879 /// Try to fold a build_vector that performs an 'addsub' to an X86ISD::ADDSUB
5881 static SDValue LowerToAddSub(const BuildVectorSDNode *BV,
5882 const X86Subtarget *Subtarget, SelectionDAG &DAG) {
5883 MVT VT = BV->getSimpleValueType(0);
5884 if ((!Subtarget->hasSSE3() || (VT != MVT::v4f32 && VT != MVT::v2f64)) &&
5885 (!Subtarget->hasAVX() || (VT != MVT::v8f32 && VT != MVT::v4f64)))
5889 unsigned NumElts = VT.getVectorNumElements();
5890 SDValue InVec0 = DAG.getUNDEF(VT);
5891 SDValue InVec1 = DAG.getUNDEF(VT);
5893 assert((VT == MVT::v8f32 || VT == MVT::v4f64 || VT == MVT::v4f32 ||
5894 VT == MVT::v2f64) && "build_vector with an invalid type found!");
5896 // Odd-numbered elements in the input build vector are obtained from
5897 // adding two integer/float elements.
5898 // Even-numbered elements in the input build vector are obtained from
5899 // subtracting two integer/float elements.
5900 unsigned ExpectedOpcode = ISD::FSUB;
5901 unsigned NextExpectedOpcode = ISD::FADD;
5902 bool AddFound = false;
5903 bool SubFound = false;
5905 for (unsigned i = 0, e = NumElts; i != e; ++i) {
5906 SDValue Op = BV->getOperand(i);
5908 // Skip 'undef' values.
5909 unsigned Opcode = Op.getOpcode();
5910 if (Opcode == ISD::UNDEF) {
5911 std::swap(ExpectedOpcode, NextExpectedOpcode);
5915 // Early exit if we found an unexpected opcode.
5916 if (Opcode != ExpectedOpcode)
5919 SDValue Op0 = Op.getOperand(0);
5920 SDValue Op1 = Op.getOperand(1);
5922 // Try to match the following pattern:
5923 // (BINOP (extract_vector_elt A, i), (extract_vector_elt B, i))
5924 // Early exit if we cannot match that sequence.
5925 if (Op0.getOpcode() != ISD::EXTRACT_VECTOR_ELT ||
5926 Op1.getOpcode() != ISD::EXTRACT_VECTOR_ELT ||
5927 !isa<ConstantSDNode>(Op0.getOperand(1)) ||
5928 !isa<ConstantSDNode>(Op1.getOperand(1)) ||
5929 Op0.getOperand(1) != Op1.getOperand(1))
5932 unsigned I0 = cast<ConstantSDNode>(Op0.getOperand(1))->getZExtValue();
5936 // We found a valid add/sub node. Update the information accordingly.
5942 // Update InVec0 and InVec1.
5943 if (InVec0.getOpcode() == ISD::UNDEF) {
5944 InVec0 = Op0.getOperand(0);
5945 if (InVec0.getSimpleValueType() != VT)
5948 if (InVec1.getOpcode() == ISD::UNDEF) {
5949 InVec1 = Op1.getOperand(0);
5950 if (InVec1.getSimpleValueType() != VT)
5954 // Make sure that operands in input to each add/sub node always
5955 // come from a same pair of vectors.
5956 if (InVec0 != Op0.getOperand(0)) {
5957 if (ExpectedOpcode == ISD::FSUB)
5960 // FADD is commutable. Try to commute the operands
5961 // and then test again.
5962 std::swap(Op0, Op1);
5963 if (InVec0 != Op0.getOperand(0))
5967 if (InVec1 != Op1.getOperand(0))
5970 // Update the pair of expected opcodes.
5971 std::swap(ExpectedOpcode, NextExpectedOpcode);
5974 // Don't try to fold this build_vector into an ADDSUB if the inputs are undef.
5975 if (AddFound && SubFound && InVec0.getOpcode() != ISD::UNDEF &&
5976 InVec1.getOpcode() != ISD::UNDEF)
5977 return DAG.getNode(X86ISD::ADDSUB, DL, VT, InVec0, InVec1);
5982 /// Lower BUILD_VECTOR to a horizontal add/sub operation if possible.
5983 static SDValue LowerToHorizontalOp(const BuildVectorSDNode *BV,
5984 const X86Subtarget *Subtarget,
5985 SelectionDAG &DAG) {
5986 MVT VT = BV->getSimpleValueType(0);
5987 unsigned NumElts = VT.getVectorNumElements();
5988 unsigned NumUndefsLO = 0;
5989 unsigned NumUndefsHI = 0;
5990 unsigned Half = NumElts/2;
5992 // Count the number of UNDEF operands in the build_vector in input.
5993 for (unsigned i = 0, e = Half; i != e; ++i)
5994 if (BV->getOperand(i)->getOpcode() == ISD::UNDEF)
5997 for (unsigned i = Half, e = NumElts; i != e; ++i)
5998 if (BV->getOperand(i)->getOpcode() == ISD::UNDEF)
6001 // Early exit if this is either a build_vector of all UNDEFs or all the
6002 // operands but one are UNDEF.
6003 if (NumUndefsLO + NumUndefsHI + 1 >= NumElts)
6007 SDValue InVec0, InVec1;
6008 if ((VT == MVT::v4f32 || VT == MVT::v2f64) && Subtarget->hasSSE3()) {
6009 // Try to match an SSE3 float HADD/HSUB.
6010 if (isHorizontalBinOp(BV, ISD::FADD, DAG, 0, NumElts, InVec0, InVec1))
6011 return DAG.getNode(X86ISD::FHADD, DL, VT, InVec0, InVec1);
6013 if (isHorizontalBinOp(BV, ISD::FSUB, DAG, 0, NumElts, InVec0, InVec1))
6014 return DAG.getNode(X86ISD::FHSUB, DL, VT, InVec0, InVec1);
6015 } else if ((VT == MVT::v4i32 || VT == MVT::v8i16) && Subtarget->hasSSSE3()) {
6016 // Try to match an SSSE3 integer HADD/HSUB.
6017 if (isHorizontalBinOp(BV, ISD::ADD, DAG, 0, NumElts, InVec0, InVec1))
6018 return DAG.getNode(X86ISD::HADD, DL, VT, InVec0, InVec1);
6020 if (isHorizontalBinOp(BV, ISD::SUB, DAG, 0, NumElts, InVec0, InVec1))
6021 return DAG.getNode(X86ISD::HSUB, DL, VT, InVec0, InVec1);
6024 if (!Subtarget->hasAVX())
6027 if ((VT == MVT::v8f32 || VT == MVT::v4f64)) {
6028 // Try to match an AVX horizontal add/sub of packed single/double
6029 // precision floating point values from 256-bit vectors.
6030 SDValue InVec2, InVec3;
6031 if (isHorizontalBinOp(BV, ISD::FADD, DAG, 0, Half, InVec0, InVec1) &&
6032 isHorizontalBinOp(BV, ISD::FADD, DAG, Half, NumElts, InVec2, InVec3) &&
6033 ((InVec0.getOpcode() == ISD::UNDEF ||
6034 InVec2.getOpcode() == ISD::UNDEF) || InVec0 == InVec2) &&
6035 ((InVec1.getOpcode() == ISD::UNDEF ||
6036 InVec3.getOpcode() == ISD::UNDEF) || InVec1 == InVec3))
6037 return DAG.getNode(X86ISD::FHADD, DL, VT, InVec0, InVec1);
6039 if (isHorizontalBinOp(BV, ISD::FSUB, DAG, 0, Half, InVec0, InVec1) &&
6040 isHorizontalBinOp(BV, ISD::FSUB, DAG, Half, NumElts, InVec2, InVec3) &&
6041 ((InVec0.getOpcode() == ISD::UNDEF ||
6042 InVec2.getOpcode() == ISD::UNDEF) || InVec0 == InVec2) &&
6043 ((InVec1.getOpcode() == ISD::UNDEF ||
6044 InVec3.getOpcode() == ISD::UNDEF) || InVec1 == InVec3))
6045 return DAG.getNode(X86ISD::FHSUB, DL, VT, InVec0, InVec1);
6046 } else if (VT == MVT::v8i32 || VT == MVT::v16i16) {
6047 // Try to match an AVX2 horizontal add/sub of signed integers.
6048 SDValue InVec2, InVec3;
6050 bool CanFold = true;
6052 if (isHorizontalBinOp(BV, ISD::ADD, DAG, 0, Half, InVec0, InVec1) &&
6053 isHorizontalBinOp(BV, ISD::ADD, DAG, Half, NumElts, InVec2, InVec3) &&
6054 ((InVec0.getOpcode() == ISD::UNDEF ||
6055 InVec2.getOpcode() == ISD::UNDEF) || InVec0 == InVec2) &&
6056 ((InVec1.getOpcode() == ISD::UNDEF ||
6057 InVec3.getOpcode() == ISD::UNDEF) || InVec1 == InVec3))
6058 X86Opcode = X86ISD::HADD;
6059 else if (isHorizontalBinOp(BV, ISD::SUB, DAG, 0, Half, InVec0, InVec1) &&
6060 isHorizontalBinOp(BV, ISD::SUB, DAG, Half, NumElts, InVec2, InVec3) &&
6061 ((InVec0.getOpcode() == ISD::UNDEF ||
6062 InVec2.getOpcode() == ISD::UNDEF) || InVec0 == InVec2) &&
6063 ((InVec1.getOpcode() == ISD::UNDEF ||
6064 InVec3.getOpcode() == ISD::UNDEF) || InVec1 == InVec3))
6065 X86Opcode = X86ISD::HSUB;
6070 // Fold this build_vector into a single horizontal add/sub.
6071 // Do this only if the target has AVX2.
6072 if (Subtarget->hasAVX2())
6073 return DAG.getNode(X86Opcode, DL, VT, InVec0, InVec1);
6075 // Do not try to expand this build_vector into a pair of horizontal
6076 // add/sub if we can emit a pair of scalar add/sub.
6077 if (NumUndefsLO + 1 == Half || NumUndefsHI + 1 == Half)
6080 // Convert this build_vector into a pair of horizontal binop followed by
6082 bool isUndefLO = NumUndefsLO == Half;
6083 bool isUndefHI = NumUndefsHI == Half;
6084 return ExpandHorizontalBinOp(InVec0, InVec1, DL, DAG, X86Opcode, false,
6085 isUndefLO, isUndefHI);
6089 if ((VT == MVT::v8f32 || VT == MVT::v4f64 || VT == MVT::v8i32 ||
6090 VT == MVT::v16i16) && Subtarget->hasAVX()) {
6092 if (isHorizontalBinOp(BV, ISD::ADD, DAG, 0, NumElts, InVec0, InVec1))
6093 X86Opcode = X86ISD::HADD;
6094 else if (isHorizontalBinOp(BV, ISD::SUB, DAG, 0, NumElts, InVec0, InVec1))
6095 X86Opcode = X86ISD::HSUB;
6096 else if (isHorizontalBinOp(BV, ISD::FADD, DAG, 0, NumElts, InVec0, InVec1))
6097 X86Opcode = X86ISD::FHADD;
6098 else if (isHorizontalBinOp(BV, ISD::FSUB, DAG, 0, NumElts, InVec0, InVec1))
6099 X86Opcode = X86ISD::FHSUB;
6103 // Don't try to expand this build_vector into a pair of horizontal add/sub
6104 // if we can simply emit a pair of scalar add/sub.
6105 if (NumUndefsLO + 1 == Half || NumUndefsHI + 1 == Half)
6108 // Convert this build_vector into two horizontal add/sub followed by
6110 bool isUndefLO = NumUndefsLO == Half;
6111 bool isUndefHI = NumUndefsHI == Half;
6112 return ExpandHorizontalBinOp(InVec0, InVec1, DL, DAG, X86Opcode, true,
6113 isUndefLO, isUndefHI);
6120 X86TargetLowering::LowerBUILD_VECTOR(SDValue Op, SelectionDAG &DAG) const {
6123 MVT VT = Op.getSimpleValueType();
6124 MVT ExtVT = VT.getVectorElementType();
6125 unsigned NumElems = Op.getNumOperands();
6127 // Generate vectors for predicate vectors.
6128 if (VT.getVectorElementType() == MVT::i1 && Subtarget->hasAVX512())
6129 return LowerBUILD_VECTORvXi1(Op, DAG);
6131 // Vectors containing all zeros can be matched by pxor and xorps later
6132 if (ISD::isBuildVectorAllZeros(Op.getNode())) {
6133 // Canonicalize this to <4 x i32> to 1) ensure the zero vectors are CSE'd
6134 // and 2) ensure that i64 scalars are eliminated on x86-32 hosts.
6135 if (VT == MVT::v4i32 || VT == MVT::v8i32 || VT == MVT::v16i32)
6138 return getZeroVector(VT, Subtarget, DAG, dl);
6141 // Vectors containing all ones can be matched by pcmpeqd on 128-bit width
6142 // vectors or broken into v4i32 operations on 256-bit vectors. AVX2 can use
6143 // vpcmpeqd on 256-bit vectors.
6144 if (Subtarget->hasSSE2() && ISD::isBuildVectorAllOnes(Op.getNode())) {
6145 if (VT == MVT::v4i32 || (VT == MVT::v8i32 && Subtarget->hasInt256()))
6148 if (!VT.is512BitVector())
6149 return getOnesVector(VT, Subtarget, DAG, dl);
6152 BuildVectorSDNode *BV = cast<BuildVectorSDNode>(Op.getNode());
6153 if (SDValue AddSub = LowerToAddSub(BV, Subtarget, DAG))
6155 if (SDValue HorizontalOp = LowerToHorizontalOp(BV, Subtarget, DAG))
6156 return HorizontalOp;
6157 if (SDValue Broadcast = LowerVectorBroadcast(Op, Subtarget, DAG))
6160 unsigned EVTBits = ExtVT.getSizeInBits();
6162 unsigned NumZero = 0;
6163 unsigned NumNonZero = 0;
6164 unsigned NonZeros = 0;
6165 bool IsAllConstants = true;
6166 SmallSet<SDValue, 8> Values;
6167 for (unsigned i = 0; i < NumElems; ++i) {
6168 SDValue Elt = Op.getOperand(i);
6169 if (Elt.getOpcode() == ISD::UNDEF)
6172 if (Elt.getOpcode() != ISD::Constant &&
6173 Elt.getOpcode() != ISD::ConstantFP)
6174 IsAllConstants = false;
6175 if (X86::isZeroNode(Elt))
6178 NonZeros |= (1 << i);
6183 // All undef vector. Return an UNDEF. All zero vectors were handled above.
6184 if (NumNonZero == 0)
6185 return DAG.getUNDEF(VT);
6187 // Special case for single non-zero, non-undef, element.
6188 if (NumNonZero == 1) {
6189 unsigned Idx = countTrailingZeros(NonZeros);
6190 SDValue Item = Op.getOperand(Idx);
6192 // If this is an insertion of an i64 value on x86-32, and if the top bits of
6193 // the value are obviously zero, truncate the value to i32 and do the
6194 // insertion that way. Only do this if the value is non-constant or if the
6195 // value is a constant being inserted into element 0. It is cheaper to do
6196 // a constant pool load than it is to do a movd + shuffle.
6197 if (ExtVT == MVT::i64 && !Subtarget->is64Bit() &&
6198 (!IsAllConstants || Idx == 0)) {
6199 if (DAG.MaskedValueIsZero(Item, APInt::getBitsSet(64, 32, 64))) {
6201 assert(VT == MVT::v2i64 && "Expected an SSE value type!");
6202 MVT VecVT = MVT::v4i32;
6204 // Truncate the value (which may itself be a constant) to i32, and
6205 // convert it to a vector with movd (S2V+shuffle to zero extend).
6206 Item = DAG.getNode(ISD::TRUNCATE, dl, MVT::i32, Item);
6207 Item = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VecVT, Item);
6208 return DAG.getBitcast(VT, getShuffleVectorZeroOrUndef(
6209 Item, Idx * 2, true, Subtarget, DAG));
6213 // If we have a constant or non-constant insertion into the low element of
6214 // a vector, we can do this with SCALAR_TO_VECTOR + shuffle of zero into
6215 // the rest of the elements. This will be matched as movd/movq/movss/movsd
6216 // depending on what the source datatype is.
6219 return DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VT, Item);
6221 if (ExtVT == MVT::i32 || ExtVT == MVT::f32 || ExtVT == MVT::f64 ||
6222 (ExtVT == MVT::i64 && Subtarget->is64Bit())) {
6223 if (VT.is512BitVector()) {
6224 SDValue ZeroVec = getZeroVector(VT, Subtarget, DAG, dl);
6225 return DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, VT, ZeroVec,
6226 Item, DAG.getIntPtrConstant(0, dl));
6228 assert((VT.is128BitVector() || VT.is256BitVector()) &&
6229 "Expected an SSE value type!");
6230 Item = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VT, Item);
6231 // Turn it into a MOVL (i.e. movss, movsd, or movd) to a zero vector.
6232 return getShuffleVectorZeroOrUndef(Item, 0, true, Subtarget, DAG);
6235 // We can't directly insert an i8 or i16 into a vector, so zero extend
6237 if (ExtVT == MVT::i16 || ExtVT == MVT::i8) {
6238 Item = DAG.getNode(ISD::ZERO_EXTEND, dl, MVT::i32, Item);
6239 if (VT.is256BitVector()) {
6240 if (Subtarget->hasAVX()) {
6241 Item = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, MVT::v8i32, Item);
6242 Item = getShuffleVectorZeroOrUndef(Item, 0, true, Subtarget, DAG);
6244 // Without AVX, we need to extend to a 128-bit vector and then
6245 // insert into the 256-bit vector.
6246 Item = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, MVT::v4i32, Item);
6247 SDValue ZeroVec = getZeroVector(MVT::v8i32, Subtarget, DAG, dl);
6248 Item = Insert128BitVector(ZeroVec, Item, 0, DAG, dl);
6251 assert(VT.is128BitVector() && "Expected an SSE value type!");
6252 Item = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, MVT::v4i32, Item);
6253 Item = getShuffleVectorZeroOrUndef(Item, 0, true, Subtarget, DAG);
6255 return DAG.getBitcast(VT, Item);
6259 // Is it a vector logical left shift?
6260 if (NumElems == 2 && Idx == 1 &&
6261 X86::isZeroNode(Op.getOperand(0)) &&
6262 !X86::isZeroNode(Op.getOperand(1))) {
6263 unsigned NumBits = VT.getSizeInBits();
6264 return getVShift(true, VT,
6265 DAG.getNode(ISD::SCALAR_TO_VECTOR, dl,
6266 VT, Op.getOperand(1)),
6267 NumBits/2, DAG, *this, dl);
6270 if (IsAllConstants) // Otherwise, it's better to do a constpool load.
6273 // Otherwise, if this is a vector with i32 or f32 elements, and the element
6274 // is a non-constant being inserted into an element other than the low one,
6275 // we can't use a constant pool load. Instead, use SCALAR_TO_VECTOR (aka
6276 // movd/movss) to move this into the low element, then shuffle it into
6278 if (EVTBits == 32) {
6279 Item = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VT, Item);
6280 return getShuffleVectorZeroOrUndef(Item, Idx, NumZero > 0, Subtarget, DAG);
6284 // Splat is obviously ok. Let legalizer expand it to a shuffle.
6285 if (Values.size() == 1) {
6286 if (EVTBits == 32) {
6287 // Instead of a shuffle like this:
6288 // shuffle (scalar_to_vector (load (ptr + 4))), undef, <0, 0, 0, 0>
6289 // Check if it's possible to issue this instead.
6290 // shuffle (vload ptr)), undef, <1, 1, 1, 1>
6291 unsigned Idx = countTrailingZeros(NonZeros);
6292 SDValue Item = Op.getOperand(Idx);
6293 if (Op.getNode()->isOnlyUserOf(Item.getNode()))
6294 return LowerAsSplatVectorLoad(Item, VT, dl, DAG);
6299 // A vector full of immediates; various special cases are already
6300 // handled, so this is best done with a single constant-pool load.
6304 // For AVX-length vectors, see if we can use a vector load to get all of the
6305 // elements, otherwise build the individual 128-bit pieces and use
6306 // shuffles to put them in place.
6307 if (VT.is256BitVector() || VT.is512BitVector()) {
6308 SmallVector<SDValue, 64> V(Op->op_begin(), Op->op_begin() + NumElems);
6310 // Check for a build vector of consecutive loads.
6311 if (SDValue LD = EltsFromConsecutiveLoads(VT, V, dl, DAG, false))
6314 EVT HVT = EVT::getVectorVT(*DAG.getContext(), ExtVT, NumElems/2);
6316 // Build both the lower and upper subvector.
6317 SDValue Lower = DAG.getNode(ISD::BUILD_VECTOR, dl, HVT,
6318 makeArrayRef(&V[0], NumElems/2));
6319 SDValue Upper = DAG.getNode(ISD::BUILD_VECTOR, dl, HVT,
6320 makeArrayRef(&V[NumElems / 2], NumElems/2));
6322 // Recreate the wider vector with the lower and upper part.
6323 if (VT.is256BitVector())
6324 return Concat128BitVectors(Lower, Upper, VT, NumElems, DAG, dl);
6325 return Concat256BitVectors(Lower, Upper, VT, NumElems, DAG, dl);
6328 // Let legalizer expand 2-wide build_vectors.
6329 if (EVTBits == 64) {
6330 if (NumNonZero == 1) {
6331 // One half is zero or undef.
6332 unsigned Idx = countTrailingZeros(NonZeros);
6333 SDValue V2 = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VT,
6334 Op.getOperand(Idx));
6335 return getShuffleVectorZeroOrUndef(V2, Idx, true, Subtarget, DAG);
6340 // If element VT is < 32 bits, convert it to inserts into a zero vector.
6341 if (EVTBits == 8 && NumElems == 16)
6342 if (SDValue V = LowerBuildVectorv16i8(Op, NonZeros,NumNonZero,NumZero, DAG,
6346 if (EVTBits == 16 && NumElems == 8)
6347 if (SDValue V = LowerBuildVectorv8i16(Op, NonZeros,NumNonZero,NumZero, DAG,
6351 // If element VT is == 32 bits and has 4 elems, try to generate an INSERTPS
6352 if (EVTBits == 32 && NumElems == 4)
6353 if (SDValue V = LowerBuildVectorv4x32(Op, DAG, Subtarget, *this))
6356 // If element VT is == 32 bits, turn it into a number of shuffles.
6357 SmallVector<SDValue, 8> V(NumElems);
6358 if (NumElems == 4 && NumZero > 0) {
6359 for (unsigned i = 0; i < 4; ++i) {
6360 bool isZero = !(NonZeros & (1 << i));
6362 V[i] = getZeroVector(VT, Subtarget, DAG, dl);
6364 V[i] = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VT, Op.getOperand(i));
6367 for (unsigned i = 0; i < 2; ++i) {
6368 switch ((NonZeros & (0x3 << i*2)) >> (i*2)) {
6371 V[i] = V[i*2]; // Must be a zero vector.
6374 V[i] = getMOVL(DAG, dl, VT, V[i*2+1], V[i*2]);
6377 V[i] = getMOVL(DAG, dl, VT, V[i*2], V[i*2+1]);
6380 V[i] = getUnpackl(DAG, dl, VT, V[i*2], V[i*2+1]);
6385 bool Reverse1 = (NonZeros & 0x3) == 2;
6386 bool Reverse2 = ((NonZeros & (0x3 << 2)) >> 2) == 2;
6390 static_cast<int>(Reverse2 ? NumElems+1 : NumElems),
6391 static_cast<int>(Reverse2 ? NumElems : NumElems+1)
6393 return DAG.getVectorShuffle(VT, dl, V[0], V[1], &MaskVec[0]);
6396 if (Values.size() > 1 && VT.is128BitVector()) {
6397 // Check for a build vector of consecutive loads.
6398 for (unsigned i = 0; i < NumElems; ++i)
6399 V[i] = Op.getOperand(i);
6401 // Check for elements which are consecutive loads.
6402 if (SDValue LD = EltsFromConsecutiveLoads(VT, V, dl, DAG, false))
6405 // Check for a build vector from mostly shuffle plus few inserting.
6406 if (SDValue Sh = buildFromShuffleMostly(Op, DAG))
6409 // For SSE 4.1, use insertps to put the high elements into the low element.
6410 if (Subtarget->hasSSE41()) {
6412 if (Op.getOperand(0).getOpcode() != ISD::UNDEF)
6413 Result = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VT, Op.getOperand(0));
6415 Result = DAG.getUNDEF(VT);
6417 for (unsigned i = 1; i < NumElems; ++i) {
6418 if (Op.getOperand(i).getOpcode() == ISD::UNDEF) continue;
6419 Result = DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, VT, Result,
6420 Op.getOperand(i), DAG.getIntPtrConstant(i, dl));
6425 // Otherwise, expand into a number of unpckl*, start by extending each of
6426 // our (non-undef) elements to the full vector width with the element in the
6427 // bottom slot of the vector (which generates no code for SSE).
6428 for (unsigned i = 0; i < NumElems; ++i) {
6429 if (Op.getOperand(i).getOpcode() != ISD::UNDEF)
6430 V[i] = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VT, Op.getOperand(i));
6432 V[i] = DAG.getUNDEF(VT);
6435 // Next, we iteratively mix elements, e.g. for v4f32:
6436 // Step 1: unpcklps 0, 2 ==> X: <?, ?, 2, 0>
6437 // : unpcklps 1, 3 ==> Y: <?, ?, 3, 1>
6438 // Step 2: unpcklps X, Y ==> <3, 2, 1, 0>
6439 unsigned EltStride = NumElems >> 1;
6440 while (EltStride != 0) {
6441 for (unsigned i = 0; i < EltStride; ++i) {
6442 // If V[i+EltStride] is undef and this is the first round of mixing,
6443 // then it is safe to just drop this shuffle: V[i] is already in the
6444 // right place, the one element (since it's the first round) being
6445 // inserted as undef can be dropped. This isn't safe for successive
6446 // rounds because they will permute elements within both vectors.
6447 if (V[i+EltStride].getOpcode() == ISD::UNDEF &&
6448 EltStride == NumElems/2)
6451 V[i] = getUnpackl(DAG, dl, VT, V[i], V[i + EltStride]);
6460 // 256-bit AVX can use the vinsertf128 instruction
6461 // to create 256-bit vectors from two other 128-bit ones.
6462 static SDValue LowerAVXCONCAT_VECTORS(SDValue Op, SelectionDAG &DAG) {
6464 MVT ResVT = Op.getSimpleValueType();
6466 assert((ResVT.is256BitVector() ||
6467 ResVT.is512BitVector()) && "Value type must be 256-/512-bit wide");
6469 SDValue V1 = Op.getOperand(0);
6470 SDValue V2 = Op.getOperand(1);
6471 unsigned NumElems = ResVT.getVectorNumElements();
6472 if (ResVT.is256BitVector())
6473 return Concat128BitVectors(V1, V2, ResVT, NumElems, DAG, dl);
6475 if (Op.getNumOperands() == 4) {
6476 MVT HalfVT = MVT::getVectorVT(ResVT.getVectorElementType(),
6477 ResVT.getVectorNumElements()/2);
6478 SDValue V3 = Op.getOperand(2);
6479 SDValue V4 = Op.getOperand(3);
6480 return Concat256BitVectors(Concat128BitVectors(V1, V2, HalfVT, NumElems/2, DAG, dl),
6481 Concat128BitVectors(V3, V4, HalfVT, NumElems/2, DAG, dl), ResVT, NumElems, DAG, dl);
6483 return Concat256BitVectors(V1, V2, ResVT, NumElems, DAG, dl);
6486 static SDValue LowerCONCAT_VECTORSvXi1(SDValue Op,
6487 const X86Subtarget *Subtarget,
6488 SelectionDAG & DAG) {
6490 MVT ResVT = Op.getSimpleValueType();
6491 unsigned NumOfOperands = Op.getNumOperands();
6493 assert(isPowerOf2_32(NumOfOperands) &&
6494 "Unexpected number of operands in CONCAT_VECTORS");
6496 if (NumOfOperands > 2) {
6497 MVT HalfVT = MVT::getVectorVT(ResVT.getVectorElementType(),
6498 ResVT.getVectorNumElements()/2);
6499 SmallVector<SDValue, 2> Ops;
6500 for (unsigned i = 0; i < NumOfOperands/2; i++)
6501 Ops.push_back(Op.getOperand(i));
6502 SDValue Lo = DAG.getNode(ISD::CONCAT_VECTORS, dl, HalfVT, Ops);
6504 for (unsigned i = NumOfOperands/2; i < NumOfOperands; i++)
6505 Ops.push_back(Op.getOperand(i));
6506 SDValue Hi = DAG.getNode(ISD::CONCAT_VECTORS, dl, HalfVT, Ops);
6507 return DAG.getNode(ISD::CONCAT_VECTORS, dl, ResVT, Lo, Hi);
6510 SDValue V1 = Op.getOperand(0);
6511 SDValue V2 = Op.getOperand(1);
6512 bool IsZeroV1 = ISD::isBuildVectorAllZeros(V1.getNode());
6513 bool IsZeroV2 = ISD::isBuildVectorAllZeros(V2.getNode());
6515 if (IsZeroV1 && IsZeroV2)
6516 return getZeroVector(ResVT, Subtarget, DAG, dl);
6518 SDValue ZeroIdx = DAG.getIntPtrConstant(0, dl);
6519 SDValue Undef = DAG.getUNDEF(ResVT);
6520 unsigned NumElems = ResVT.getVectorNumElements();
6521 SDValue ShiftBits = DAG.getConstant(NumElems/2, dl, MVT::i8);
6523 V2 = DAG.getNode(ISD::INSERT_SUBVECTOR, dl, ResVT, Undef, V2, ZeroIdx);
6524 V2 = DAG.getNode(X86ISD::VSHLI, dl, ResVT, V2, ShiftBits);
6528 V1 = DAG.getNode(ISD::INSERT_SUBVECTOR, dl, ResVT, Undef, V1, ZeroIdx);
6529 // Zero the upper bits of V1
6530 V1 = DAG.getNode(X86ISD::VSHLI, dl, ResVT, V1, ShiftBits);
6531 V1 = DAG.getNode(X86ISD::VSRLI, dl, ResVT, V1, ShiftBits);
6534 return DAG.getNode(ISD::OR, dl, ResVT, V1, V2);
6537 static SDValue LowerCONCAT_VECTORS(SDValue Op,
6538 const X86Subtarget *Subtarget,
6539 SelectionDAG &DAG) {
6540 MVT VT = Op.getSimpleValueType();
6541 if (VT.getVectorElementType() == MVT::i1)
6542 return LowerCONCAT_VECTORSvXi1(Op, Subtarget, DAG);
6544 assert((VT.is256BitVector() && Op.getNumOperands() == 2) ||
6545 (VT.is512BitVector() && (Op.getNumOperands() == 2 ||
6546 Op.getNumOperands() == 4)));
6548 // AVX can use the vinsertf128 instruction to create 256-bit vectors
6549 // from two other 128-bit ones.
6551 // 512-bit vector may contain 2 256-bit vectors or 4 128-bit vectors
6552 return LowerAVXCONCAT_VECTORS(Op, DAG);
6555 //===----------------------------------------------------------------------===//
6556 // Vector shuffle lowering
6558 // This is an experimental code path for lowering vector shuffles on x86. It is
6559 // designed to handle arbitrary vector shuffles and blends, gracefully
6560 // degrading performance as necessary. It works hard to recognize idiomatic
6561 // shuffles and lower them to optimal instruction patterns without leaving
6562 // a framework that allows reasonably efficient handling of all vector shuffle
6564 //===----------------------------------------------------------------------===//
6566 /// \brief Tiny helper function to identify a no-op mask.
6568 /// This is a somewhat boring predicate function. It checks whether the mask
6569 /// array input, which is assumed to be a single-input shuffle mask of the kind
6570 /// used by the X86 shuffle instructions (not a fully general
6571 /// ShuffleVectorSDNode mask) requires any shuffles to occur. Both undef and an
6572 /// in-place shuffle are 'no-op's.
6573 static bool isNoopShuffleMask(ArrayRef<int> Mask) {
6574 for (int i = 0, Size = Mask.size(); i < Size; ++i)
6575 if (Mask[i] != -1 && Mask[i] != i)
6580 /// \brief Helper function to classify a mask as a single-input mask.
6582 /// This isn't a generic single-input test because in the vector shuffle
6583 /// lowering we canonicalize single inputs to be the first input operand. This
6584 /// means we can more quickly test for a single input by only checking whether
6585 /// an input from the second operand exists. We also assume that the size of
6586 /// mask corresponds to the size of the input vectors which isn't true in the
6587 /// fully general case.
6588 static bool isSingleInputShuffleMask(ArrayRef<int> Mask) {
6590 if (M >= (int)Mask.size())
6595 /// \brief Test whether there are elements crossing 128-bit lanes in this
6598 /// X86 divides up its shuffles into in-lane and cross-lane shuffle operations
6599 /// and we routinely test for these.
6600 static bool is128BitLaneCrossingShuffleMask(MVT VT, ArrayRef<int> Mask) {
6601 int LaneSize = 128 / VT.getScalarSizeInBits();
6602 int Size = Mask.size();
6603 for (int i = 0; i < Size; ++i)
6604 if (Mask[i] >= 0 && (Mask[i] % Size) / LaneSize != i / LaneSize)
6609 /// \brief Test whether a shuffle mask is equivalent within each 128-bit lane.
6611 /// This checks a shuffle mask to see if it is performing the same
6612 /// 128-bit lane-relative shuffle in each 128-bit lane. This trivially implies
6613 /// that it is also not lane-crossing. It may however involve a blend from the
6614 /// same lane of a second vector.
6616 /// The specific repeated shuffle mask is populated in \p RepeatedMask, as it is
6617 /// non-trivial to compute in the face of undef lanes. The representation is
6618 /// *not* suitable for use with existing 128-bit shuffles as it will contain
6619 /// entries from both V1 and V2 inputs to the wider mask.
6621 is128BitLaneRepeatedShuffleMask(MVT VT, ArrayRef<int> Mask,
6622 SmallVectorImpl<int> &RepeatedMask) {
6623 int LaneSize = 128 / VT.getScalarSizeInBits();
6624 RepeatedMask.resize(LaneSize, -1);
6625 int Size = Mask.size();
6626 for (int i = 0; i < Size; ++i) {
6629 if ((Mask[i] % Size) / LaneSize != i / LaneSize)
6630 // This entry crosses lanes, so there is no way to model this shuffle.
6633 // Ok, handle the in-lane shuffles by detecting if and when they repeat.
6634 if (RepeatedMask[i % LaneSize] == -1)
6635 // This is the first non-undef entry in this slot of a 128-bit lane.
6636 RepeatedMask[i % LaneSize] =
6637 Mask[i] < Size ? Mask[i] % LaneSize : Mask[i] % LaneSize + Size;
6638 else if (RepeatedMask[i % LaneSize] + (i / LaneSize) * LaneSize != Mask[i])
6639 // Found a mismatch with the repeated mask.
6645 /// \brief Checks whether a shuffle mask is equivalent to an explicit list of
6648 /// This is a fast way to test a shuffle mask against a fixed pattern:
6650 /// if (isShuffleEquivalent(Mask, 3, 2, {1, 0})) { ... }
6652 /// It returns true if the mask is exactly as wide as the argument list, and
6653 /// each element of the mask is either -1 (signifying undef) or the value given
6654 /// in the argument.
6655 static bool isShuffleEquivalent(SDValue V1, SDValue V2, ArrayRef<int> Mask,
6656 ArrayRef<int> ExpectedMask) {
6657 if (Mask.size() != ExpectedMask.size())
6660 int Size = Mask.size();
6662 // If the values are build vectors, we can look through them to find
6663 // equivalent inputs that make the shuffles equivalent.
6664 auto *BV1 = dyn_cast<BuildVectorSDNode>(V1);
6665 auto *BV2 = dyn_cast<BuildVectorSDNode>(V2);
6667 for (int i = 0; i < Size; ++i)
6668 if (Mask[i] != -1 && Mask[i] != ExpectedMask[i]) {
6669 auto *MaskBV = Mask[i] < Size ? BV1 : BV2;
6670 auto *ExpectedBV = ExpectedMask[i] < Size ? BV1 : BV2;
6671 if (!MaskBV || !ExpectedBV ||
6672 MaskBV->getOperand(Mask[i] % Size) !=
6673 ExpectedBV->getOperand(ExpectedMask[i] % Size))
6680 /// \brief Get a 4-lane 8-bit shuffle immediate for a mask.
6682 /// This helper function produces an 8-bit shuffle immediate corresponding to
6683 /// the ubiquitous shuffle encoding scheme used in x86 instructions for
6684 /// shuffling 4 lanes. It can be used with most of the PSHUF instructions for
6687 /// NB: We rely heavily on "undef" masks preserving the input lane.
6688 static SDValue getV4X86ShuffleImm8ForMask(ArrayRef<int> Mask, SDLoc DL,
6689 SelectionDAG &DAG) {
6690 assert(Mask.size() == 4 && "Only 4-lane shuffle masks");
6691 assert(Mask[0] >= -1 && Mask[0] < 4 && "Out of bound mask element!");
6692 assert(Mask[1] >= -1 && Mask[1] < 4 && "Out of bound mask element!");
6693 assert(Mask[2] >= -1 && Mask[2] < 4 && "Out of bound mask element!");
6694 assert(Mask[3] >= -1 && Mask[3] < 4 && "Out of bound mask element!");
6697 Imm |= (Mask[0] == -1 ? 0 : Mask[0]) << 0;
6698 Imm |= (Mask[1] == -1 ? 1 : Mask[1]) << 2;
6699 Imm |= (Mask[2] == -1 ? 2 : Mask[2]) << 4;
6700 Imm |= (Mask[3] == -1 ? 3 : Mask[3]) << 6;
6701 return DAG.getConstant(Imm, DL, MVT::i8);
6704 /// \brief Compute whether each element of a shuffle is zeroable.
6706 /// A "zeroable" vector shuffle element is one which can be lowered to zero.
6707 /// Either it is an undef element in the shuffle mask, the element of the input
6708 /// referenced is undef, or the element of the input referenced is known to be
6709 /// zero. Many x86 shuffles can zero lanes cheaply and we often want to handle
6710 /// as many lanes with this technique as possible to simplify the remaining
6712 static SmallBitVector computeZeroableShuffleElements(ArrayRef<int> Mask,
6713 SDValue V1, SDValue V2) {
6714 SmallBitVector Zeroable(Mask.size(), false);
6716 while (V1.getOpcode() == ISD::BITCAST)
6717 V1 = V1->getOperand(0);
6718 while (V2.getOpcode() == ISD::BITCAST)
6719 V2 = V2->getOperand(0);
6721 bool V1IsZero = ISD::isBuildVectorAllZeros(V1.getNode());
6722 bool V2IsZero = ISD::isBuildVectorAllZeros(V2.getNode());
6724 for (int i = 0, Size = Mask.size(); i < Size; ++i) {
6726 // Handle the easy cases.
6727 if (M < 0 || (M >= 0 && M < Size && V1IsZero) || (M >= Size && V2IsZero)) {
6732 // If this is an index into a build_vector node (which has the same number
6733 // of elements), dig out the input value and use it.
6734 SDValue V = M < Size ? V1 : V2;
6735 if (V.getOpcode() != ISD::BUILD_VECTOR || Size != (int)V.getNumOperands())
6738 SDValue Input = V.getOperand(M % Size);
6739 // The UNDEF opcode check really should be dead code here, but not quite
6740 // worth asserting on (it isn't invalid, just unexpected).
6741 if (Input.getOpcode() == ISD::UNDEF || X86::isZeroNode(Input))
6748 // X86 has dedicated unpack instructions that can handle specific blend
6749 // operations: UNPCKH and UNPCKL.
6750 static SDValue lowerVectorShuffleWithUNPCK(SDLoc DL, MVT VT, ArrayRef<int> Mask,
6751 SDValue V1, SDValue V2,
6752 SelectionDAG &DAG) {
6753 int NumElts = VT.getVectorNumElements();
6754 int NumEltsInLane = 128 / VT.getScalarSizeInBits();
6755 SmallVector<int, 8> Unpckl;
6756 SmallVector<int, 8> Unpckh;
6758 for (int i = 0; i < NumElts; ++i) {
6759 unsigned LaneStart = (i / NumEltsInLane) * NumEltsInLane;
6760 int LoPos = (i % NumEltsInLane) / 2 + LaneStart + NumElts * (i % 2);
6761 int HiPos = LoPos + NumEltsInLane / 2;
6762 Unpckl.push_back(LoPos);
6763 Unpckh.push_back(HiPos);
6766 if (isShuffleEquivalent(V1, V2, Mask, Unpckl))
6767 return DAG.getNode(X86ISD::UNPCKL, DL, VT, V1, V2);
6768 if (isShuffleEquivalent(V1, V2, Mask, Unpckh))
6769 return DAG.getNode(X86ISD::UNPCKH, DL, VT, V1, V2);
6771 // Commute and try again.
6772 ShuffleVectorSDNode::commuteMask(Unpckl);
6773 if (isShuffleEquivalent(V1, V2, Mask, Unpckl))
6774 return DAG.getNode(X86ISD::UNPCKL, DL, VT, V2, V1);
6776 ShuffleVectorSDNode::commuteMask(Unpckh);
6777 if (isShuffleEquivalent(V1, V2, Mask, Unpckh))
6778 return DAG.getNode(X86ISD::UNPCKH, DL, VT, V2, V1);
6783 /// \brief Try to emit a bitmask instruction for a shuffle.
6785 /// This handles cases where we can model a blend exactly as a bitmask due to
6786 /// one of the inputs being zeroable.
6787 static SDValue lowerVectorShuffleAsBitMask(SDLoc DL, MVT VT, SDValue V1,
6788 SDValue V2, ArrayRef<int> Mask,
6789 SelectionDAG &DAG) {
6790 MVT EltVT = VT.getVectorElementType();
6791 int NumEltBits = EltVT.getSizeInBits();
6792 MVT IntEltVT = MVT::getIntegerVT(NumEltBits);
6793 SDValue Zero = DAG.getConstant(0, DL, IntEltVT);
6794 SDValue AllOnes = DAG.getConstant(APInt::getAllOnesValue(NumEltBits), DL,
6796 if (EltVT.isFloatingPoint()) {
6797 Zero = DAG.getBitcast(EltVT, Zero);
6798 AllOnes = DAG.getBitcast(EltVT, AllOnes);
6800 SmallVector<SDValue, 16> VMaskOps(Mask.size(), Zero);
6801 SmallBitVector Zeroable = computeZeroableShuffleElements(Mask, V1, V2);
6803 for (int i = 0, Size = Mask.size(); i < Size; ++i) {
6806 if (Mask[i] % Size != i)
6807 return SDValue(); // Not a blend.
6809 V = Mask[i] < Size ? V1 : V2;
6810 else if (V != (Mask[i] < Size ? V1 : V2))
6811 return SDValue(); // Can only let one input through the mask.
6813 VMaskOps[i] = AllOnes;
6816 return SDValue(); // No non-zeroable elements!
6818 SDValue VMask = DAG.getNode(ISD::BUILD_VECTOR, DL, VT, VMaskOps);
6819 V = DAG.getNode(VT.isFloatingPoint()
6820 ? (unsigned) X86ISD::FAND : (unsigned) ISD::AND,
6825 /// \brief Try to emit a blend instruction for a shuffle using bit math.
6827 /// This is used as a fallback approach when first class blend instructions are
6828 /// unavailable. Currently it is only suitable for integer vectors, but could
6829 /// be generalized for floating point vectors if desirable.
6830 static SDValue lowerVectorShuffleAsBitBlend(SDLoc DL, MVT VT, SDValue V1,
6831 SDValue V2, ArrayRef<int> Mask,
6832 SelectionDAG &DAG) {
6833 assert(VT.isInteger() && "Only supports integer vector types!");
6834 MVT EltVT = VT.getVectorElementType();
6835 int NumEltBits = EltVT.getSizeInBits();
6836 SDValue Zero = DAG.getConstant(0, DL, EltVT);
6837 SDValue AllOnes = DAG.getConstant(APInt::getAllOnesValue(NumEltBits), DL,
6839 SmallVector<SDValue, 16> MaskOps;
6840 for (int i = 0, Size = Mask.size(); i < Size; ++i) {
6841 if (Mask[i] != -1 && Mask[i] != i && Mask[i] != i + Size)
6842 return SDValue(); // Shuffled input!
6843 MaskOps.push_back(Mask[i] < Size ? AllOnes : Zero);
6846 SDValue V1Mask = DAG.getNode(ISD::BUILD_VECTOR, DL, VT, MaskOps);
6847 V1 = DAG.getNode(ISD::AND, DL, VT, V1, V1Mask);
6848 // We have to cast V2 around.
6849 MVT MaskVT = MVT::getVectorVT(MVT::i64, VT.getSizeInBits() / 64);
6850 V2 = DAG.getBitcast(VT, DAG.getNode(X86ISD::ANDNP, DL, MaskVT,
6851 DAG.getBitcast(MaskVT, V1Mask),
6852 DAG.getBitcast(MaskVT, V2)));
6853 return DAG.getNode(ISD::OR, DL, VT, V1, V2);
6856 /// \brief Try to emit a blend instruction for a shuffle.
6858 /// This doesn't do any checks for the availability of instructions for blending
6859 /// these values. It relies on the availability of the X86ISD::BLENDI pattern to
6860 /// be matched in the backend with the type given. What it does check for is
6861 /// that the shuffle mask is a blend, or convertible into a blend with zero.
6862 static SDValue lowerVectorShuffleAsBlend(SDLoc DL, MVT VT, SDValue V1,
6863 SDValue V2, ArrayRef<int> Original,
6864 const X86Subtarget *Subtarget,
6865 SelectionDAG &DAG) {
6866 bool V1IsZero = ISD::isBuildVectorAllZeros(V1.getNode());
6867 bool V2IsZero = ISD::isBuildVectorAllZeros(V2.getNode());
6868 SmallVector<int, 8> Mask(Original.begin(), Original.end());
6869 SmallBitVector Zeroable = computeZeroableShuffleElements(Mask, V1, V2);
6870 bool ForceV1Zero = false, ForceV2Zero = false;
6872 // Attempt to generate the binary blend mask. If an input is zero then
6873 // we can use any lane.
6874 // TODO: generalize the zero matching to any scalar like isShuffleEquivalent.
6875 unsigned BlendMask = 0;
6876 for (int i = 0, Size = Mask.size(); i < Size; ++i) {
6882 if (M == i + Size) {
6883 BlendMask |= 1u << i;
6894 BlendMask |= 1u << i;
6899 return SDValue(); // Shuffled input!
6902 // Create a REAL zero vector - ISD::isBuildVectorAllZeros allows UNDEFs.
6904 V1 = getZeroVector(VT, Subtarget, DAG, DL);
6906 V2 = getZeroVector(VT, Subtarget, DAG, DL);
6908 auto ScaleBlendMask = [](unsigned BlendMask, int Size, int Scale) {
6909 unsigned ScaledMask = 0;
6910 for (int i = 0; i != Size; ++i)
6911 if (BlendMask & (1u << i))
6912 for (int j = 0; j != Scale; ++j)
6913 ScaledMask |= 1u << (i * Scale + j);
6917 switch (VT.SimpleTy) {
6922 return DAG.getNode(X86ISD::BLENDI, DL, VT, V1, V2,
6923 DAG.getConstant(BlendMask, DL, MVT::i8));
6927 assert(Subtarget->hasAVX2() && "256-bit integer blends require AVX2!");
6931 // If we have AVX2 it is faster to use VPBLENDD when the shuffle fits into
6932 // that instruction.
6933 if (Subtarget->hasAVX2()) {
6934 // Scale the blend by the number of 32-bit dwords per element.
6935 int Scale = VT.getScalarSizeInBits() / 32;
6936 BlendMask = ScaleBlendMask(BlendMask, Mask.size(), Scale);
6937 MVT BlendVT = VT.getSizeInBits() > 128 ? MVT::v8i32 : MVT::v4i32;
6938 V1 = DAG.getBitcast(BlendVT, V1);
6939 V2 = DAG.getBitcast(BlendVT, V2);
6940 return DAG.getBitcast(
6941 VT, DAG.getNode(X86ISD::BLENDI, DL, BlendVT, V1, V2,
6942 DAG.getConstant(BlendMask, DL, MVT::i8)));
6946 // For integer shuffles we need to expand the mask and cast the inputs to
6947 // v8i16s prior to blending.
6948 int Scale = 8 / VT.getVectorNumElements();
6949 BlendMask = ScaleBlendMask(BlendMask, Mask.size(), Scale);
6950 V1 = DAG.getBitcast(MVT::v8i16, V1);
6951 V2 = DAG.getBitcast(MVT::v8i16, V2);
6952 return DAG.getBitcast(VT,
6953 DAG.getNode(X86ISD::BLENDI, DL, MVT::v8i16, V1, V2,
6954 DAG.getConstant(BlendMask, DL, MVT::i8)));
6958 assert(Subtarget->hasAVX2() && "256-bit integer blends require AVX2!");
6959 SmallVector<int, 8> RepeatedMask;
6960 if (is128BitLaneRepeatedShuffleMask(MVT::v16i16, Mask, RepeatedMask)) {
6961 // We can lower these with PBLENDW which is mirrored across 128-bit lanes.
6962 assert(RepeatedMask.size() == 8 && "Repeated mask size doesn't match!");
6964 for (int i = 0; i < 8; ++i)
6965 if (RepeatedMask[i] >= 16)
6966 BlendMask |= 1u << i;
6967 return DAG.getNode(X86ISD::BLENDI, DL, MVT::v16i16, V1, V2,
6968 DAG.getConstant(BlendMask, DL, MVT::i8));
6974 assert((VT.is128BitVector() || Subtarget->hasAVX2()) &&
6975 "256-bit byte-blends require AVX2 support!");
6977 // Attempt to lower to a bitmask if we can. VPAND is faster than VPBLENDVB.
6978 if (SDValue Masked = lowerVectorShuffleAsBitMask(DL, VT, V1, V2, Mask, DAG))
6981 // Scale the blend by the number of bytes per element.
6982 int Scale = VT.getScalarSizeInBits() / 8;
6984 // This form of blend is always done on bytes. Compute the byte vector
6986 MVT BlendVT = MVT::getVectorVT(MVT::i8, VT.getSizeInBits() / 8);
6988 // Compute the VSELECT mask. Note that VSELECT is really confusing in the
6989 // mix of LLVM's code generator and the x86 backend. We tell the code
6990 // generator that boolean values in the elements of an x86 vector register
6991 // are -1 for true and 0 for false. We then use the LLVM semantics of 'true'
6992 // mapping a select to operand #1, and 'false' mapping to operand #2. The
6993 // reality in x86 is that vector masks (pre-AVX-512) use only the high bit
6994 // of the element (the remaining are ignored) and 0 in that high bit would
6995 // mean operand #1 while 1 in the high bit would mean operand #2. So while
6996 // the LLVM model for boolean values in vector elements gets the relevant
6997 // bit set, it is set backwards and over constrained relative to x86's
6999 SmallVector<SDValue, 32> VSELECTMask;
7000 for (int i = 0, Size = Mask.size(); i < Size; ++i)
7001 for (int j = 0; j < Scale; ++j)
7002 VSELECTMask.push_back(
7003 Mask[i] < 0 ? DAG.getUNDEF(MVT::i8)
7004 : DAG.getConstant(Mask[i] < Size ? -1 : 0, DL,
7007 V1 = DAG.getBitcast(BlendVT, V1);
7008 V2 = DAG.getBitcast(BlendVT, V2);
7009 return DAG.getBitcast(VT, DAG.getNode(ISD::VSELECT, DL, BlendVT,
7010 DAG.getNode(ISD::BUILD_VECTOR, DL,
7011 BlendVT, VSELECTMask),
7016 llvm_unreachable("Not a supported integer vector type!");
7020 /// \brief Try to lower as a blend of elements from two inputs followed by
7021 /// a single-input permutation.
7023 /// This matches the pattern where we can blend elements from two inputs and
7024 /// then reduce the shuffle to a single-input permutation.
7025 static SDValue lowerVectorShuffleAsBlendAndPermute(SDLoc DL, MVT VT, SDValue V1,
7028 SelectionDAG &DAG) {
7029 // We build up the blend mask while checking whether a blend is a viable way
7030 // to reduce the shuffle.
7031 SmallVector<int, 32> BlendMask(Mask.size(), -1);
7032 SmallVector<int, 32> PermuteMask(Mask.size(), -1);
7034 for (int i = 0, Size = Mask.size(); i < Size; ++i) {
7038 assert(Mask[i] < Size * 2 && "Shuffle input is out of bounds.");
7040 if (BlendMask[Mask[i] % Size] == -1)
7041 BlendMask[Mask[i] % Size] = Mask[i];
7042 else if (BlendMask[Mask[i] % Size] != Mask[i])
7043 return SDValue(); // Can't blend in the needed input!
7045 PermuteMask[i] = Mask[i] % Size;
7048 SDValue V = DAG.getVectorShuffle(VT, DL, V1, V2, BlendMask);
7049 return DAG.getVectorShuffle(VT, DL, V, DAG.getUNDEF(VT), PermuteMask);
7052 /// \brief Generic routine to decompose a shuffle and blend into indepndent
7053 /// blends and permutes.
7055 /// This matches the extremely common pattern for handling combined
7056 /// shuffle+blend operations on newer X86 ISAs where we have very fast blend
7057 /// operations. It will try to pick the best arrangement of shuffles and
7059 static SDValue lowerVectorShuffleAsDecomposedShuffleBlend(SDLoc DL, MVT VT,
7063 SelectionDAG &DAG) {
7064 // Shuffle the input elements into the desired positions in V1 and V2 and
7065 // blend them together.
7066 SmallVector<int, 32> V1Mask(Mask.size(), -1);
7067 SmallVector<int, 32> V2Mask(Mask.size(), -1);
7068 SmallVector<int, 32> BlendMask(Mask.size(), -1);
7069 for (int i = 0, Size = Mask.size(); i < Size; ++i)
7070 if (Mask[i] >= 0 && Mask[i] < Size) {
7071 V1Mask[i] = Mask[i];
7073 } else if (Mask[i] >= Size) {
7074 V2Mask[i] = Mask[i] - Size;
7075 BlendMask[i] = i + Size;
7078 // Try to lower with the simpler initial blend strategy unless one of the
7079 // input shuffles would be a no-op. We prefer to shuffle inputs as the
7080 // shuffle may be able to fold with a load or other benefit. However, when
7081 // we'll have to do 2x as many shuffles in order to achieve this, blending
7082 // first is a better strategy.
7083 if (!isNoopShuffleMask(V1Mask) && !isNoopShuffleMask(V2Mask))
7084 if (SDValue BlendPerm =
7085 lowerVectorShuffleAsBlendAndPermute(DL, VT, V1, V2, Mask, DAG))
7088 V1 = DAG.getVectorShuffle(VT, DL, V1, DAG.getUNDEF(VT), V1Mask);
7089 V2 = DAG.getVectorShuffle(VT, DL, V2, DAG.getUNDEF(VT), V2Mask);
7090 return DAG.getVectorShuffle(VT, DL, V1, V2, BlendMask);
7093 /// \brief Try to lower a vector shuffle as a byte rotation.
7095 /// SSSE3 has a generic PALIGNR instruction in x86 that will do an arbitrary
7096 /// byte-rotation of the concatenation of two vectors; pre-SSSE3 can use
7097 /// a PSRLDQ/PSLLDQ/POR pattern to get a similar effect. This routine will
7098 /// try to generically lower a vector shuffle through such an pattern. It
7099 /// does not check for the profitability of lowering either as PALIGNR or
7100 /// PSRLDQ/PSLLDQ/POR, only whether the mask is valid to lower in that form.
7101 /// This matches shuffle vectors that look like:
7103 /// v8i16 [11, 12, 13, 14, 15, 0, 1, 2]
7105 /// Essentially it concatenates V1 and V2, shifts right by some number of
7106 /// elements, and takes the low elements as the result. Note that while this is
7107 /// specified as a *right shift* because x86 is little-endian, it is a *left
7108 /// rotate* of the vector lanes.
7109 static SDValue lowerVectorShuffleAsByteRotate(SDLoc DL, MVT VT, SDValue V1,
7112 const X86Subtarget *Subtarget,
7113 SelectionDAG &DAG) {
7114 assert(!isNoopShuffleMask(Mask) && "We shouldn't lower no-op shuffles!");
7116 int NumElts = Mask.size();
7117 int NumLanes = VT.getSizeInBits() / 128;
7118 int NumLaneElts = NumElts / NumLanes;
7120 // We need to detect various ways of spelling a rotation:
7121 // [11, 12, 13, 14, 15, 0, 1, 2]
7122 // [-1, 12, 13, 14, -1, -1, 1, -1]
7123 // [-1, -1, -1, -1, -1, -1, 1, 2]
7124 // [ 3, 4, 5, 6, 7, 8, 9, 10]
7125 // [-1, 4, 5, 6, -1, -1, 9, -1]
7126 // [-1, 4, 5, 6, -1, -1, -1, -1]
7129 for (int l = 0; l < NumElts; l += NumLaneElts) {
7130 for (int i = 0; i < NumLaneElts; ++i) {
7131 if (Mask[l + i] == -1)
7133 assert(Mask[l + i] >= 0 && "Only -1 is a valid negative mask element!");
7135 // Get the mod-Size index and lane correct it.
7136 int LaneIdx = (Mask[l + i] % NumElts) - l;
7137 // Make sure it was in this lane.
7138 if (LaneIdx < 0 || LaneIdx >= NumLaneElts)
7141 // Determine where a rotated vector would have started.
7142 int StartIdx = i - LaneIdx;
7144 // The identity rotation isn't interesting, stop.
7147 // If we found the tail of a vector the rotation must be the missing
7148 // front. If we found the head of a vector, it must be how much of the
7150 int CandidateRotation = StartIdx < 0 ? -StartIdx : NumLaneElts - StartIdx;
7153 Rotation = CandidateRotation;
7154 else if (Rotation != CandidateRotation)
7155 // The rotations don't match, so we can't match this mask.
7158 // Compute which value this mask is pointing at.
7159 SDValue MaskV = Mask[l + i] < NumElts ? V1 : V2;
7161 // Compute which of the two target values this index should be assigned
7162 // to. This reflects whether the high elements are remaining or the low
7163 // elements are remaining.
7164 SDValue &TargetV = StartIdx < 0 ? Hi : Lo;
7166 // Either set up this value if we've not encountered it before, or check
7167 // that it remains consistent.
7170 else if (TargetV != MaskV)
7171 // This may be a rotation, but it pulls from the inputs in some
7172 // unsupported interleaving.
7177 // Check that we successfully analyzed the mask, and normalize the results.
7178 assert(Rotation != 0 && "Failed to locate a viable rotation!");
7179 assert((Lo || Hi) && "Failed to find a rotated input vector!");
7185 // The actual rotate instruction rotates bytes, so we need to scale the
7186 // rotation based on how many bytes are in the vector lane.
7187 int Scale = 16 / NumLaneElts;
7189 // SSSE3 targets can use the palignr instruction.
7190 if (Subtarget->hasSSSE3()) {
7191 // Cast the inputs to i8 vector of correct length to match PALIGNR.
7192 MVT AlignVT = MVT::getVectorVT(MVT::i8, 16 * NumLanes);
7193 Lo = DAG.getBitcast(AlignVT, Lo);
7194 Hi = DAG.getBitcast(AlignVT, Hi);
7196 return DAG.getBitcast(
7197 VT, DAG.getNode(X86ISD::PALIGNR, DL, AlignVT, Lo, Hi,
7198 DAG.getConstant(Rotation * Scale, DL, MVT::i8)));
7201 assert(VT.is128BitVector() &&
7202 "Rotate-based lowering only supports 128-bit lowering!");
7203 assert(Mask.size() <= 16 &&
7204 "Can shuffle at most 16 bytes in a 128-bit vector!");
7206 // Default SSE2 implementation
7207 int LoByteShift = 16 - Rotation * Scale;
7208 int HiByteShift = Rotation * Scale;
7210 // Cast the inputs to v2i64 to match PSLLDQ/PSRLDQ.
7211 Lo = DAG.getBitcast(MVT::v2i64, Lo);
7212 Hi = DAG.getBitcast(MVT::v2i64, Hi);
7214 SDValue LoShift = DAG.getNode(X86ISD::VSHLDQ, DL, MVT::v2i64, Lo,
7215 DAG.getConstant(LoByteShift, DL, MVT::i8));
7216 SDValue HiShift = DAG.getNode(X86ISD::VSRLDQ, DL, MVT::v2i64, Hi,
7217 DAG.getConstant(HiByteShift, DL, MVT::i8));
7218 return DAG.getBitcast(VT,
7219 DAG.getNode(ISD::OR, DL, MVT::v2i64, LoShift, HiShift));
7222 /// \brief Try to lower a vector shuffle as a bit shift (shifts in zeros).
7224 /// Attempts to match a shuffle mask against the PSLL(W/D/Q/DQ) and
7225 /// PSRL(W/D/Q/DQ) SSE2 and AVX2 logical bit-shift instructions. The function
7226 /// matches elements from one of the input vectors shuffled to the left or
7227 /// right with zeroable elements 'shifted in'. It handles both the strictly
7228 /// bit-wise element shifts and the byte shift across an entire 128-bit double
7231 /// PSHL : (little-endian) left bit shift.
7232 /// [ zz, 0, zz, 2 ]
7233 /// [ -1, 4, zz, -1 ]
7234 /// PSRL : (little-endian) right bit shift.
7236 /// [ -1, -1, 7, zz]
7237 /// PSLLDQ : (little-endian) left byte shift
7238 /// [ zz, 0, 1, 2, 3, 4, 5, 6]
7239 /// [ zz, zz, -1, -1, 2, 3, 4, -1]
7240 /// [ zz, zz, zz, zz, zz, zz, -1, 1]
7241 /// PSRLDQ : (little-endian) right byte shift
7242 /// [ 5, 6, 7, zz, zz, zz, zz, zz]
7243 /// [ -1, 5, 6, 7, zz, zz, zz, zz]
7244 /// [ 1, 2, -1, -1, -1, -1, zz, zz]
7245 static SDValue lowerVectorShuffleAsShift(SDLoc DL, MVT VT, SDValue V1,
7246 SDValue V2, ArrayRef<int> Mask,
7247 SelectionDAG &DAG) {
7248 SmallBitVector Zeroable = computeZeroableShuffleElements(Mask, V1, V2);
7250 int Size = Mask.size();
7251 assert(Size == (int)VT.getVectorNumElements() && "Unexpected mask size");
7253 auto CheckZeros = [&](int Shift, int Scale, bool Left) {
7254 for (int i = 0; i < Size; i += Scale)
7255 for (int j = 0; j < Shift; ++j)
7256 if (!Zeroable[i + j + (Left ? 0 : (Scale - Shift))])
7262 auto MatchShift = [&](int Shift, int Scale, bool Left, SDValue V) {
7263 for (int i = 0; i != Size; i += Scale) {
7264 unsigned Pos = Left ? i + Shift : i;
7265 unsigned Low = Left ? i : i + Shift;
7266 unsigned Len = Scale - Shift;
7267 if (!isSequentialOrUndefInRange(Mask, Pos, Len,
7268 Low + (V == V1 ? 0 : Size)))
7272 int ShiftEltBits = VT.getScalarSizeInBits() * Scale;
7273 bool ByteShift = ShiftEltBits > 64;
7274 unsigned OpCode = Left ? (ByteShift ? X86ISD::VSHLDQ : X86ISD::VSHLI)
7275 : (ByteShift ? X86ISD::VSRLDQ : X86ISD::VSRLI);
7276 int ShiftAmt = Shift * VT.getScalarSizeInBits() / (ByteShift ? 8 : 1);
7278 // Normalize the scale for byte shifts to still produce an i64 element
7280 Scale = ByteShift ? Scale / 2 : Scale;
7282 // We need to round trip through the appropriate type for the shift.
7283 MVT ShiftSVT = MVT::getIntegerVT(VT.getScalarSizeInBits() * Scale);
7284 MVT ShiftVT = MVT::getVectorVT(ShiftSVT, Size / Scale);
7285 assert(DAG.getTargetLoweringInfo().isTypeLegal(ShiftVT) &&
7286 "Illegal integer vector type");
7287 V = DAG.getBitcast(ShiftVT, V);
7289 V = DAG.getNode(OpCode, DL, ShiftVT, V,
7290 DAG.getConstant(ShiftAmt, DL, MVT::i8));
7291 return DAG.getBitcast(VT, V);
7294 // SSE/AVX supports logical shifts up to 64-bit integers - so we can just
7295 // keep doubling the size of the integer elements up to that. We can
7296 // then shift the elements of the integer vector by whole multiples of
7297 // their width within the elements of the larger integer vector. Test each
7298 // multiple to see if we can find a match with the moved element indices
7299 // and that the shifted in elements are all zeroable.
7300 for (int Scale = 2; Scale * VT.getScalarSizeInBits() <= 128; Scale *= 2)
7301 for (int Shift = 1; Shift != Scale; ++Shift)
7302 for (bool Left : {true, false})
7303 if (CheckZeros(Shift, Scale, Left))
7304 for (SDValue V : {V1, V2})
7305 if (SDValue Match = MatchShift(Shift, Scale, Left, V))
7312 /// \brief Try to lower a vector shuffle using SSE4a EXTRQ/INSERTQ.
7313 static SDValue lowerVectorShuffleWithSSE4A(SDLoc DL, MVT VT, SDValue V1,
7314 SDValue V2, ArrayRef<int> Mask,
7315 SelectionDAG &DAG) {
7316 SmallBitVector Zeroable = computeZeroableShuffleElements(Mask, V1, V2);
7317 assert(!Zeroable.all() && "Fully zeroable shuffle mask");
7319 int Size = Mask.size();
7320 int HalfSize = Size / 2;
7321 assert(Size == (int)VT.getVectorNumElements() && "Unexpected mask size");
7323 // Upper half must be undefined.
7324 if (!isUndefInRange(Mask, HalfSize, HalfSize))
7327 // EXTRQ: Extract Len elements from lower half of source, starting at Idx.
7328 // Remainder of lower half result is zero and upper half is all undef.
7329 auto LowerAsEXTRQ = [&]() {
7330 // Determine the extraction length from the part of the
7331 // lower half that isn't zeroable.
7333 for (; Len > 0; --Len)
7334 if (!Zeroable[Len - 1])
7336 assert(Len > 0 && "Zeroable shuffle mask");
7338 // Attempt to match first Len sequential elements from the lower half.
7341 for (int i = 0; i != Len; ++i) {
7345 SDValue &V = (M < Size ? V1 : V2);
7348 // All mask elements must be in the lower half.
7352 if (Idx < 0 || (Src == V && Idx == (M - i))) {
7363 assert((Idx + Len) <= HalfSize && "Illegal extraction mask");
7364 int BitLen = (Len * VT.getScalarSizeInBits()) & 0x3f;
7365 int BitIdx = (Idx * VT.getScalarSizeInBits()) & 0x3f;
7366 return DAG.getNode(X86ISD::EXTRQI, DL, VT, Src,
7367 DAG.getConstant(BitLen, DL, MVT::i8),
7368 DAG.getConstant(BitIdx, DL, MVT::i8));
7371 if (SDValue ExtrQ = LowerAsEXTRQ())
7374 // INSERTQ: Extract lowest Len elements from lower half of second source and
7375 // insert over first source, starting at Idx.
7376 // { A[0], .., A[Idx-1], B[0], .., B[Len-1], A[Idx+Len], .., UNDEF, ... }
7377 auto LowerAsInsertQ = [&]() {
7378 for (int Idx = 0; Idx != HalfSize; ++Idx) {
7381 // Attempt to match first source from mask before insertion point.
7382 if (isUndefInRange(Mask, 0, Idx)) {
7384 } else if (isSequentialOrUndefInRange(Mask, 0, Idx, 0)) {
7386 } else if (isSequentialOrUndefInRange(Mask, 0, Idx, Size)) {
7392 // Extend the extraction length looking to match both the insertion of
7393 // the second source and the remaining elements of the first.
7394 for (int Hi = Idx + 1; Hi <= HalfSize; ++Hi) {
7399 if (isSequentialOrUndefInRange(Mask, Idx, Len, 0)) {
7401 } else if (isSequentialOrUndefInRange(Mask, Idx, Len, Size)) {
7407 // Match the remaining elements of the lower half.
7408 if (isUndefInRange(Mask, Hi, HalfSize - Hi)) {
7410 } else if ((!Base || (Base == V1)) &&
7411 isSequentialOrUndefInRange(Mask, Hi, HalfSize - Hi, Hi)) {
7413 } else if ((!Base || (Base == V2)) &&
7414 isSequentialOrUndefInRange(Mask, Hi, HalfSize - Hi,
7421 // We may not have a base (first source) - this can safely be undefined.
7423 Base = DAG.getUNDEF(VT);
7425 int BitLen = (Len * VT.getScalarSizeInBits()) & 0x3f;
7426 int BitIdx = (Idx * VT.getScalarSizeInBits()) & 0x3f;
7427 return DAG.getNode(X86ISD::INSERTQI, DL, VT, Base, Insert,
7428 DAG.getConstant(BitLen, DL, MVT::i8),
7429 DAG.getConstant(BitIdx, DL, MVT::i8));
7436 if (SDValue InsertQ = LowerAsInsertQ())
7442 /// \brief Lower a vector shuffle as a zero or any extension.
7444 /// Given a specific number of elements, element bit width, and extension
7445 /// stride, produce either a zero or any extension based on the available
7446 /// features of the subtarget. The extended elements are consecutive and
7447 /// begin and can start from an offseted element index in the input; to
7448 /// avoid excess shuffling the offset must either being in the bottom lane
7449 /// or at the start of a higher lane. All extended elements must be from
7451 static SDValue lowerVectorShuffleAsSpecificZeroOrAnyExtend(
7452 SDLoc DL, MVT VT, int Scale, int Offset, bool AnyExt, SDValue InputV,
7453 ArrayRef<int> Mask, const X86Subtarget *Subtarget, SelectionDAG &DAG) {
7454 assert(Scale > 1 && "Need a scale to extend.");
7455 int EltBits = VT.getScalarSizeInBits();
7456 int NumElements = VT.getVectorNumElements();
7457 int NumEltsPerLane = 128 / EltBits;
7458 int OffsetLane = Offset / NumEltsPerLane;
7459 assert((EltBits == 8 || EltBits == 16 || EltBits == 32) &&
7460 "Only 8, 16, and 32 bit elements can be extended.");
7461 assert(Scale * EltBits <= 64 && "Cannot zero extend past 64 bits.");
7462 assert(0 <= Offset && "Extension offset must be positive.");
7463 assert((Offset < NumEltsPerLane || Offset % NumEltsPerLane == 0) &&
7464 "Extension offset must be in the first lane or start an upper lane.");
7466 // Check that an index is in same lane as the base offset.
7467 auto SafeOffset = [&](int Idx) {
7468 return OffsetLane == (Idx / NumEltsPerLane);
7471 // Shift along an input so that the offset base moves to the first element.
7472 auto ShuffleOffset = [&](SDValue V) {
7476 SmallVector<int, 8> ShMask((unsigned)NumElements, -1);
7477 for (int i = 0; i * Scale < NumElements; ++i) {
7478 int SrcIdx = i + Offset;
7479 ShMask[i] = SafeOffset(SrcIdx) ? SrcIdx : -1;
7481 return DAG.getVectorShuffle(VT, DL, V, DAG.getUNDEF(VT), ShMask);
7484 // Found a valid zext mask! Try various lowering strategies based on the
7485 // input type and available ISA extensions.
7486 if (Subtarget->hasSSE41()) {
7487 // Not worth offseting 128-bit vectors if scale == 2, a pattern using
7488 // PUNPCK will catch this in a later shuffle match.
7489 if (Offset && Scale == 2 && VT.is128BitVector())
7491 MVT ExtVT = MVT::getVectorVT(MVT::getIntegerVT(EltBits * Scale),
7492 NumElements / Scale);
7493 InputV = DAG.getNode(X86ISD::VZEXT, DL, ExtVT, ShuffleOffset(InputV));
7494 return DAG.getBitcast(VT, InputV);
7497 assert(VT.is128BitVector() && "Only 128-bit vectors can be extended.");
7499 // For any extends we can cheat for larger element sizes and use shuffle
7500 // instructions that can fold with a load and/or copy.
7501 if (AnyExt && EltBits == 32) {
7502 int PSHUFDMask[4] = {Offset, -1, SafeOffset(Offset + 1) ? Offset + 1 : -1,
7504 return DAG.getBitcast(
7505 VT, DAG.getNode(X86ISD::PSHUFD, DL, MVT::v4i32,
7506 DAG.getBitcast(MVT::v4i32, InputV),
7507 getV4X86ShuffleImm8ForMask(PSHUFDMask, DL, DAG)));
7509 if (AnyExt && EltBits == 16 && Scale > 2) {
7510 int PSHUFDMask[4] = {Offset / 2, -1,
7511 SafeOffset(Offset + 1) ? (Offset + 1) / 2 : -1, -1};
7512 InputV = DAG.getNode(X86ISD::PSHUFD, DL, MVT::v4i32,
7513 DAG.getBitcast(MVT::v4i32, InputV),
7514 getV4X86ShuffleImm8ForMask(PSHUFDMask, DL, DAG));
7515 int PSHUFWMask[4] = {1, -1, -1, -1};
7516 unsigned OddEvenOp = (Offset & 1 ? X86ISD::PSHUFLW : X86ISD::PSHUFHW);
7517 return DAG.getBitcast(
7518 VT, DAG.getNode(OddEvenOp, DL, MVT::v8i16,
7519 DAG.getBitcast(MVT::v8i16, InputV),
7520 getV4X86ShuffleImm8ForMask(PSHUFWMask, DL, DAG)));
7523 // The SSE4A EXTRQ instruction can efficiently extend the first 2 lanes
7525 if ((Scale * EltBits) == 64 && EltBits < 32 && Subtarget->hasSSE4A()) {
7526 assert(NumElements == (int)Mask.size() && "Unexpected shuffle mask size!");
7527 assert(VT.is128BitVector() && "Unexpected vector width!");
7529 int LoIdx = Offset * EltBits;
7530 SDValue Lo = DAG.getNode(ISD::BITCAST, DL, MVT::v2i64,
7531 DAG.getNode(X86ISD::EXTRQI, DL, VT, InputV,
7532 DAG.getConstant(EltBits, DL, MVT::i8),
7533 DAG.getConstant(LoIdx, DL, MVT::i8)));
7535 if (isUndefInRange(Mask, NumElements / 2, NumElements / 2) ||
7536 !SafeOffset(Offset + 1))
7537 return DAG.getNode(ISD::BITCAST, DL, VT, Lo);
7539 int HiIdx = (Offset + 1) * EltBits;
7540 SDValue Hi = DAG.getNode(ISD::BITCAST, DL, MVT::v2i64,
7541 DAG.getNode(X86ISD::EXTRQI, DL, VT, InputV,
7542 DAG.getConstant(EltBits, DL, MVT::i8),
7543 DAG.getConstant(HiIdx, DL, MVT::i8)));
7544 return DAG.getNode(ISD::BITCAST, DL, VT,
7545 DAG.getNode(X86ISD::UNPCKL, DL, MVT::v2i64, Lo, Hi));
7548 // If this would require more than 2 unpack instructions to expand, use
7549 // pshufb when available. We can only use more than 2 unpack instructions
7550 // when zero extending i8 elements which also makes it easier to use pshufb.
7551 if (Scale > 4 && EltBits == 8 && Subtarget->hasSSSE3()) {
7552 assert(NumElements == 16 && "Unexpected byte vector width!");
7553 SDValue PSHUFBMask[16];
7554 for (int i = 0; i < 16; ++i) {
7555 int Idx = Offset + (i / Scale);
7556 PSHUFBMask[i] = DAG.getConstant(
7557 (i % Scale == 0 && SafeOffset(Idx)) ? Idx : 0x80, DL, MVT::i8);
7559 InputV = DAG.getBitcast(MVT::v16i8, InputV);
7560 return DAG.getBitcast(VT,
7561 DAG.getNode(X86ISD::PSHUFB, DL, MVT::v16i8, InputV,
7562 DAG.getNode(ISD::BUILD_VECTOR, DL,
7563 MVT::v16i8, PSHUFBMask)));
7566 // If we are extending from an offset, ensure we start on a boundary that
7567 // we can unpack from.
7568 int AlignToUnpack = Offset % (NumElements / Scale);
7569 if (AlignToUnpack) {
7570 SmallVector<int, 8> ShMask((unsigned)NumElements, -1);
7571 for (int i = AlignToUnpack; i < NumElements; ++i)
7572 ShMask[i - AlignToUnpack] = i;
7573 InputV = DAG.getVectorShuffle(VT, DL, InputV, DAG.getUNDEF(VT), ShMask);
7574 Offset -= AlignToUnpack;
7577 // Otherwise emit a sequence of unpacks.
7579 unsigned UnpackLoHi = X86ISD::UNPCKL;
7580 if (Offset >= (NumElements / 2)) {
7581 UnpackLoHi = X86ISD::UNPCKH;
7582 Offset -= (NumElements / 2);
7585 MVT InputVT = MVT::getVectorVT(MVT::getIntegerVT(EltBits), NumElements);
7586 SDValue Ext = AnyExt ? DAG.getUNDEF(InputVT)
7587 : getZeroVector(InputVT, Subtarget, DAG, DL);
7588 InputV = DAG.getBitcast(InputVT, InputV);
7589 InputV = DAG.getNode(UnpackLoHi, DL, InputVT, InputV, Ext);
7593 } while (Scale > 1);
7594 return DAG.getBitcast(VT, InputV);
7597 /// \brief Try to lower a vector shuffle as a zero extension on any microarch.
7599 /// This routine will try to do everything in its power to cleverly lower
7600 /// a shuffle which happens to match the pattern of a zero extend. It doesn't
7601 /// check for the profitability of this lowering, it tries to aggressively
7602 /// match this pattern. It will use all of the micro-architectural details it
7603 /// can to emit an efficient lowering. It handles both blends with all-zero
7604 /// inputs to explicitly zero-extend and undef-lanes (sometimes undef due to
7605 /// masking out later).
7607 /// The reason we have dedicated lowering for zext-style shuffles is that they
7608 /// are both incredibly common and often quite performance sensitive.
7609 static SDValue lowerVectorShuffleAsZeroOrAnyExtend(
7610 SDLoc DL, MVT VT, SDValue V1, SDValue V2, ArrayRef<int> Mask,
7611 const X86Subtarget *Subtarget, SelectionDAG &DAG) {
7612 SmallBitVector Zeroable = computeZeroableShuffleElements(Mask, V1, V2);
7614 int Bits = VT.getSizeInBits();
7615 int NumLanes = Bits / 128;
7616 int NumElements = VT.getVectorNumElements();
7617 int NumEltsPerLane = NumElements / NumLanes;
7618 assert(VT.getScalarSizeInBits() <= 32 &&
7619 "Exceeds 32-bit integer zero extension limit");
7620 assert((int)Mask.size() == NumElements && "Unexpected shuffle mask size");
7622 // Define a helper function to check a particular ext-scale and lower to it if
7624 auto Lower = [&](int Scale) -> SDValue {
7629 for (int i = 0; i < NumElements; ++i) {
7632 continue; // Valid anywhere but doesn't tell us anything.
7633 if (i % Scale != 0) {
7634 // Each of the extended elements need to be zeroable.
7638 // We no longer are in the anyext case.
7643 // Each of the base elements needs to be consecutive indices into the
7644 // same input vector.
7645 SDValue V = M < NumElements ? V1 : V2;
7646 M = M % NumElements;
7649 Offset = M - (i / Scale);
7650 } else if (InputV != V)
7651 return SDValue(); // Flip-flopping inputs.
7653 // Offset must start in the lowest 128-bit lane or at the start of an
7655 // FIXME: Is it ever worth allowing a negative base offset?
7656 if (!((0 <= Offset && Offset < NumEltsPerLane) ||
7657 (Offset % NumEltsPerLane) == 0))
7660 // If we are offsetting, all referenced entries must come from the same
7662 if (Offset && (Offset / NumEltsPerLane) != (M / NumEltsPerLane))
7665 if ((M % NumElements) != (Offset + (i / Scale)))
7666 return SDValue(); // Non-consecutive strided elements.
7670 // If we fail to find an input, we have a zero-shuffle which should always
7671 // have already been handled.
7672 // FIXME: Maybe handle this here in case during blending we end up with one?
7676 // If we are offsetting, don't extend if we only match a single input, we
7677 // can always do better by using a basic PSHUF or PUNPCK.
7678 if (Offset != 0 && Matches < 2)
7681 return lowerVectorShuffleAsSpecificZeroOrAnyExtend(
7682 DL, VT, Scale, Offset, AnyExt, InputV, Mask, Subtarget, DAG);
7685 // The widest scale possible for extending is to a 64-bit integer.
7686 assert(Bits % 64 == 0 &&
7687 "The number of bits in a vector must be divisible by 64 on x86!");
7688 int NumExtElements = Bits / 64;
7690 // Each iteration, try extending the elements half as much, but into twice as
7692 for (; NumExtElements < NumElements; NumExtElements *= 2) {
7693 assert(NumElements % NumExtElements == 0 &&
7694 "The input vector size must be divisible by the extended size.");
7695 if (SDValue V = Lower(NumElements / NumExtElements))
7699 // General extends failed, but 128-bit vectors may be able to use MOVQ.
7703 // Returns one of the source operands if the shuffle can be reduced to a
7704 // MOVQ, copying the lower 64-bits and zero-extending to the upper 64-bits.
7705 auto CanZExtLowHalf = [&]() {
7706 for (int i = NumElements / 2; i != NumElements; ++i)
7709 if (isSequentialOrUndefInRange(Mask, 0, NumElements / 2, 0))
7711 if (isSequentialOrUndefInRange(Mask, 0, NumElements / 2, NumElements))
7716 if (SDValue V = CanZExtLowHalf()) {
7717 V = DAG.getBitcast(MVT::v2i64, V);
7718 V = DAG.getNode(X86ISD::VZEXT_MOVL, DL, MVT::v2i64, V);
7719 return DAG.getBitcast(VT, V);
7722 // No viable ext lowering found.
7726 /// \brief Try to get a scalar value for a specific element of a vector.
7728 /// Looks through BUILD_VECTOR and SCALAR_TO_VECTOR nodes to find a scalar.
7729 static SDValue getScalarValueForVectorElement(SDValue V, int Idx,
7730 SelectionDAG &DAG) {
7731 MVT VT = V.getSimpleValueType();
7732 MVT EltVT = VT.getVectorElementType();
7733 while (V.getOpcode() == ISD::BITCAST)
7734 V = V.getOperand(0);
7735 // If the bitcasts shift the element size, we can't extract an equivalent
7737 MVT NewVT = V.getSimpleValueType();
7738 if (!NewVT.isVector() || NewVT.getScalarSizeInBits() != VT.getScalarSizeInBits())
7741 if (V.getOpcode() == ISD::BUILD_VECTOR ||
7742 (Idx == 0 && V.getOpcode() == ISD::SCALAR_TO_VECTOR)) {
7743 // Ensure the scalar operand is the same size as the destination.
7744 // FIXME: Add support for scalar truncation where possible.
7745 SDValue S = V.getOperand(Idx);
7746 if (EltVT.getSizeInBits() == S.getSimpleValueType().getSizeInBits())
7747 return DAG.getNode(ISD::BITCAST, SDLoc(V), EltVT, S);
7753 /// \brief Helper to test for a load that can be folded with x86 shuffles.
7755 /// This is particularly important because the set of instructions varies
7756 /// significantly based on whether the operand is a load or not.
7757 static bool isShuffleFoldableLoad(SDValue V) {
7758 while (V.getOpcode() == ISD::BITCAST)
7759 V = V.getOperand(0);
7761 return ISD::isNON_EXTLoad(V.getNode());
7764 /// \brief Try to lower insertion of a single element into a zero vector.
7766 /// This is a common pattern that we have especially efficient patterns to lower
7767 /// across all subtarget feature sets.
7768 static SDValue lowerVectorShuffleAsElementInsertion(
7769 SDLoc DL, MVT VT, SDValue V1, SDValue V2, ArrayRef<int> Mask,
7770 const X86Subtarget *Subtarget, SelectionDAG &DAG) {
7771 SmallBitVector Zeroable = computeZeroableShuffleElements(Mask, V1, V2);
7773 MVT EltVT = VT.getVectorElementType();
7775 int V2Index = std::find_if(Mask.begin(), Mask.end(),
7776 [&Mask](int M) { return M >= (int)Mask.size(); }) -
7778 bool IsV1Zeroable = true;
7779 for (int i = 0, Size = Mask.size(); i < Size; ++i)
7780 if (i != V2Index && !Zeroable[i]) {
7781 IsV1Zeroable = false;
7785 // Check for a single input from a SCALAR_TO_VECTOR node.
7786 // FIXME: All of this should be canonicalized into INSERT_VECTOR_ELT and
7787 // all the smarts here sunk into that routine. However, the current
7788 // lowering of BUILD_VECTOR makes that nearly impossible until the old
7789 // vector shuffle lowering is dead.
7790 SDValue V2S = getScalarValueForVectorElement(V2, Mask[V2Index] - Mask.size(),
7792 if (V2S && DAG.getTargetLoweringInfo().isTypeLegal(V2S.getValueType())) {
7793 // We need to zext the scalar if it is smaller than an i32.
7794 V2S = DAG.getBitcast(EltVT, V2S);
7795 if (EltVT == MVT::i8 || EltVT == MVT::i16) {
7796 // Using zext to expand a narrow element won't work for non-zero
7801 // Zero-extend directly to i32.
7803 V2S = DAG.getNode(ISD::ZERO_EXTEND, DL, MVT::i32, V2S);
7805 V2 = DAG.getNode(ISD::SCALAR_TO_VECTOR, DL, ExtVT, V2S);
7806 } else if (Mask[V2Index] != (int)Mask.size() || EltVT == MVT::i8 ||
7807 EltVT == MVT::i16) {
7808 // Either not inserting from the low element of the input or the input
7809 // element size is too small to use VZEXT_MOVL to clear the high bits.
7813 if (!IsV1Zeroable) {
7814 // If V1 can't be treated as a zero vector we have fewer options to lower
7815 // this. We can't support integer vectors or non-zero targets cheaply, and
7816 // the V1 elements can't be permuted in any way.
7817 assert(VT == ExtVT && "Cannot change extended type when non-zeroable!");
7818 if (!VT.isFloatingPoint() || V2Index != 0)
7820 SmallVector<int, 8> V1Mask(Mask.begin(), Mask.end());
7821 V1Mask[V2Index] = -1;
7822 if (!isNoopShuffleMask(V1Mask))
7824 // This is essentially a special case blend operation, but if we have
7825 // general purpose blend operations, they are always faster. Bail and let
7826 // the rest of the lowering handle these as blends.
7827 if (Subtarget->hasSSE41())
7830 // Otherwise, use MOVSD or MOVSS.
7831 assert((EltVT == MVT::f32 || EltVT == MVT::f64) &&
7832 "Only two types of floating point element types to handle!");
7833 return DAG.getNode(EltVT == MVT::f32 ? X86ISD::MOVSS : X86ISD::MOVSD, DL,
7837 // This lowering only works for the low element with floating point vectors.
7838 if (VT.isFloatingPoint() && V2Index != 0)
7841 V2 = DAG.getNode(X86ISD::VZEXT_MOVL, DL, ExtVT, V2);
7843 V2 = DAG.getBitcast(VT, V2);
7846 // If we have 4 or fewer lanes we can cheaply shuffle the element into
7847 // the desired position. Otherwise it is more efficient to do a vector
7848 // shift left. We know that we can do a vector shift left because all
7849 // the inputs are zero.
7850 if (VT.isFloatingPoint() || VT.getVectorNumElements() <= 4) {
7851 SmallVector<int, 4> V2Shuffle(Mask.size(), 1);
7852 V2Shuffle[V2Index] = 0;
7853 V2 = DAG.getVectorShuffle(VT, DL, V2, DAG.getUNDEF(VT), V2Shuffle);
7855 V2 = DAG.getBitcast(MVT::v2i64, V2);
7857 X86ISD::VSHLDQ, DL, MVT::v2i64, V2,
7858 DAG.getConstant(V2Index * EltVT.getSizeInBits() / 8, DL,
7859 DAG.getTargetLoweringInfo().getScalarShiftAmountTy(
7860 DAG.getDataLayout(), VT)));
7861 V2 = DAG.getBitcast(VT, V2);
7867 /// \brief Try to lower broadcast of a single - truncated - integer element,
7868 /// coming from a scalar_to_vector/build_vector node \p V0 with larger elements.
7870 /// This assumes we have AVX2.
7871 static SDValue lowerVectorShuffleAsTruncBroadcast(SDLoc DL, MVT VT, SDValue V0,
7873 const X86Subtarget *Subtarget,
7874 SelectionDAG &DAG) {
7875 assert(Subtarget->hasAVX2() &&
7876 "We can only lower integer broadcasts with AVX2!");
7878 EVT EltVT = VT.getVectorElementType();
7879 EVT V0VT = V0.getValueType();
7881 assert(VT.isInteger() && "Unexpected non-integer trunc broadcast!");
7882 assert(V0VT.isVector() && "Unexpected non-vector vector-sized value!");
7884 EVT V0EltVT = V0VT.getVectorElementType();
7885 if (!V0EltVT.isInteger())
7888 const unsigned EltSize = EltVT.getSizeInBits();
7889 const unsigned V0EltSize = V0EltVT.getSizeInBits();
7891 // This is only a truncation if the original element type is larger.
7892 if (V0EltSize <= EltSize)
7895 assert(((V0EltSize % EltSize) == 0) &&
7896 "Scalar type sizes must all be powers of 2 on x86!");
7898 const unsigned V0Opc = V0.getOpcode();
7899 const unsigned Scale = V0EltSize / EltSize;
7900 const unsigned V0BroadcastIdx = BroadcastIdx / Scale;
7902 if ((V0Opc != ISD::SCALAR_TO_VECTOR || V0BroadcastIdx != 0) &&
7903 V0Opc != ISD::BUILD_VECTOR)
7906 SDValue Scalar = V0.getOperand(V0BroadcastIdx);
7908 // If we're extracting non-least-significant bits, shift so we can truncate.
7909 // Hopefully, we can fold away the trunc/srl/load into the broadcast.
7910 // Even if we can't (and !isShuffleFoldableLoad(Scalar)), prefer
7911 // vpbroadcast+vmovd+shr to vpshufb(m)+vmovd.
7912 if (const int OffsetIdx = BroadcastIdx % Scale)
7913 Scalar = DAG.getNode(ISD::SRL, DL, Scalar.getValueType(), Scalar,
7914 DAG.getConstant(OffsetIdx * EltSize, DL, Scalar.getValueType()));
7916 return DAG.getNode(X86ISD::VBROADCAST, DL, VT,
7917 DAG.getNode(ISD::TRUNCATE, DL, EltVT, Scalar));
7920 /// \brief Try to lower broadcast of a single element.
7922 /// For convenience, this code also bundles all of the subtarget feature set
7923 /// filtering. While a little annoying to re-dispatch on type here, there isn't
7924 /// a convenient way to factor it out.
7925 static SDValue lowerVectorShuffleAsBroadcast(SDLoc DL, MVT VT, SDValue V,
7927 const X86Subtarget *Subtarget,
7928 SelectionDAG &DAG) {
7929 if (!Subtarget->hasAVX())
7931 if (VT.isInteger() && !Subtarget->hasAVX2())
7934 // Check that the mask is a broadcast.
7935 int BroadcastIdx = -1;
7937 if (M >= 0 && BroadcastIdx == -1)
7939 else if (M >= 0 && M != BroadcastIdx)
7942 assert(BroadcastIdx < (int)Mask.size() && "We only expect to be called with "
7943 "a sorted mask where the broadcast "
7946 // Go up the chain of (vector) values to find a scalar load that we can
7947 // combine with the broadcast.
7949 switch (V.getOpcode()) {
7950 case ISD::CONCAT_VECTORS: {
7951 int OperandSize = Mask.size() / V.getNumOperands();
7952 V = V.getOperand(BroadcastIdx / OperandSize);
7953 BroadcastIdx %= OperandSize;
7957 case ISD::INSERT_SUBVECTOR: {
7958 SDValue VOuter = V.getOperand(0), VInner = V.getOperand(1);
7959 auto ConstantIdx = dyn_cast<ConstantSDNode>(V.getOperand(2));
7963 int BeginIdx = (int)ConstantIdx->getZExtValue();
7965 BeginIdx + (int)VInner.getSimpleValueType().getVectorNumElements();
7966 if (BroadcastIdx >= BeginIdx && BroadcastIdx < EndIdx) {
7967 BroadcastIdx -= BeginIdx;
7978 // Check if this is a broadcast of a scalar. We special case lowering
7979 // for scalars so that we can more effectively fold with loads.
7980 // First, look through bitcast: if the original value has a larger element
7981 // type than the shuffle, the broadcast element is in essence truncated.
7982 // Make that explicit to ease folding.
7983 if (V.getOpcode() == ISD::BITCAST && VT.isInteger())
7984 if (SDValue TruncBroadcast = lowerVectorShuffleAsTruncBroadcast(
7985 DL, VT, V.getOperand(0), BroadcastIdx, Subtarget, DAG))
7986 return TruncBroadcast;
7988 // Also check the simpler case, where we can directly reuse the scalar.
7989 if (V.getOpcode() == ISD::BUILD_VECTOR ||
7990 (V.getOpcode() == ISD::SCALAR_TO_VECTOR && BroadcastIdx == 0)) {
7991 V = V.getOperand(BroadcastIdx);
7993 // If the scalar isn't a load, we can't broadcast from it in AVX1.
7994 // Only AVX2 has register broadcasts.
7995 if (!Subtarget->hasAVX2() && !isShuffleFoldableLoad(V))
7997 } else if (BroadcastIdx != 0 || !Subtarget->hasAVX2()) {
7998 // We can't broadcast from a vector register without AVX2, and we can only
7999 // broadcast from the zero-element of a vector register.
8003 return DAG.getNode(X86ISD::VBROADCAST, DL, VT, V);
8006 // Check for whether we can use INSERTPS to perform the shuffle. We only use
8007 // INSERTPS when the V1 elements are already in the correct locations
8008 // because otherwise we can just always use two SHUFPS instructions which
8009 // are much smaller to encode than a SHUFPS and an INSERTPS. We can also
8010 // perform INSERTPS if a single V1 element is out of place and all V2
8011 // elements are zeroable.
8012 static SDValue lowerVectorShuffleAsInsertPS(SDValue Op, SDValue V1, SDValue V2,
8014 SelectionDAG &DAG) {
8015 assert(Op.getSimpleValueType() == MVT::v4f32 && "Bad shuffle type!");
8016 assert(V1.getSimpleValueType() == MVT::v4f32 && "Bad operand type!");
8017 assert(V2.getSimpleValueType() == MVT::v4f32 && "Bad operand type!");
8018 assert(Mask.size() == 4 && "Unexpected mask size for v4 shuffle!");
8020 SmallBitVector Zeroable = computeZeroableShuffleElements(Mask, V1, V2);
8023 int V1DstIndex = -1;
8024 int V2DstIndex = -1;
8025 bool V1UsedInPlace = false;
8027 for (int i = 0; i < 4; ++i) {
8028 // Synthesize a zero mask from the zeroable elements (includes undefs).
8034 // Flag if we use any V1 inputs in place.
8036 V1UsedInPlace = true;
8040 // We can only insert a single non-zeroable element.
8041 if (V1DstIndex != -1 || V2DstIndex != -1)
8045 // V1 input out of place for insertion.
8048 // V2 input for insertion.
8053 // Don't bother if we have no (non-zeroable) element for insertion.
8054 if (V1DstIndex == -1 && V2DstIndex == -1)
8057 // Determine element insertion src/dst indices. The src index is from the
8058 // start of the inserted vector, not the start of the concatenated vector.
8059 unsigned V2SrcIndex = 0;
8060 if (V1DstIndex != -1) {
8061 // If we have a V1 input out of place, we use V1 as the V2 element insertion
8062 // and don't use the original V2 at all.
8063 V2SrcIndex = Mask[V1DstIndex];
8064 V2DstIndex = V1DstIndex;
8067 V2SrcIndex = Mask[V2DstIndex] - 4;
8070 // If no V1 inputs are used in place, then the result is created only from
8071 // the zero mask and the V2 insertion - so remove V1 dependency.
8073 V1 = DAG.getUNDEF(MVT::v4f32);
8075 unsigned InsertPSMask = V2SrcIndex << 6 | V2DstIndex << 4 | ZMask;
8076 assert((InsertPSMask & ~0xFFu) == 0 && "Invalid mask!");
8078 // Insert the V2 element into the desired position.
8080 return DAG.getNode(X86ISD::INSERTPS, DL, MVT::v4f32, V1, V2,
8081 DAG.getConstant(InsertPSMask, DL, MVT::i8));
8084 /// \brief Try to lower a shuffle as a permute of the inputs followed by an
8085 /// UNPCK instruction.
8087 /// This specifically targets cases where we end up with alternating between
8088 /// the two inputs, and so can permute them into something that feeds a single
8089 /// UNPCK instruction. Note that this routine only targets integer vectors
8090 /// because for floating point vectors we have a generalized SHUFPS lowering
8091 /// strategy that handles everything that doesn't *exactly* match an unpack,
8092 /// making this clever lowering unnecessary.
8093 static SDValue lowerVectorShuffleAsPermuteAndUnpack(SDLoc DL, MVT VT,
8094 SDValue V1, SDValue V2,
8096 SelectionDAG &DAG) {
8097 assert(!VT.isFloatingPoint() &&
8098 "This routine only supports integer vectors.");
8099 assert(!isSingleInputShuffleMask(Mask) &&
8100 "This routine should only be used when blending two inputs.");
8101 assert(Mask.size() >= 2 && "Single element masks are invalid.");
8103 int Size = Mask.size();
8105 int NumLoInputs = std::count_if(Mask.begin(), Mask.end(), [Size](int M) {
8106 return M >= 0 && M % Size < Size / 2;
8108 int NumHiInputs = std::count_if(
8109 Mask.begin(), Mask.end(), [Size](int M) { return M % Size >= Size / 2; });
8111 bool UnpackLo = NumLoInputs >= NumHiInputs;
8113 auto TryUnpack = [&](MVT UnpackVT, int Scale) {
8114 SmallVector<int, 32> V1Mask(Mask.size(), -1);
8115 SmallVector<int, 32> V2Mask(Mask.size(), -1);
8117 for (int i = 0; i < Size; ++i) {
8121 // Each element of the unpack contains Scale elements from this mask.
8122 int UnpackIdx = i / Scale;
8124 // We only handle the case where V1 feeds the first slots of the unpack.
8125 // We rely on canonicalization to ensure this is the case.
8126 if ((UnpackIdx % 2 == 0) != (Mask[i] < Size))
8129 // Setup the mask for this input. The indexing is tricky as we have to
8130 // handle the unpack stride.
8131 SmallVectorImpl<int> &VMask = (UnpackIdx % 2 == 0) ? V1Mask : V2Mask;
8132 VMask[(UnpackIdx / 2) * Scale + i % Scale + (UnpackLo ? 0 : Size / 2)] =
8136 // If we will have to shuffle both inputs to use the unpack, check whether
8137 // we can just unpack first and shuffle the result. If so, skip this unpack.
8138 if ((NumLoInputs == 0 || NumHiInputs == 0) && !isNoopShuffleMask(V1Mask) &&
8139 !isNoopShuffleMask(V2Mask))
8142 // Shuffle the inputs into place.
8143 V1 = DAG.getVectorShuffle(VT, DL, V1, DAG.getUNDEF(VT), V1Mask);
8144 V2 = DAG.getVectorShuffle(VT, DL, V2, DAG.getUNDEF(VT), V2Mask);
8146 // Cast the inputs to the type we will use to unpack them.
8147 V1 = DAG.getBitcast(UnpackVT, V1);
8148 V2 = DAG.getBitcast(UnpackVT, V2);
8150 // Unpack the inputs and cast the result back to the desired type.
8151 return DAG.getBitcast(
8152 VT, DAG.getNode(UnpackLo ? X86ISD::UNPCKL : X86ISD::UNPCKH, DL,
8156 // We try each unpack from the largest to the smallest to try and find one
8157 // that fits this mask.
8158 int OrigNumElements = VT.getVectorNumElements();
8159 int OrigScalarSize = VT.getScalarSizeInBits();
8160 for (int ScalarSize = 64; ScalarSize >= OrigScalarSize; ScalarSize /= 2) {
8161 int Scale = ScalarSize / OrigScalarSize;
8162 int NumElements = OrigNumElements / Scale;
8163 MVT UnpackVT = MVT::getVectorVT(MVT::getIntegerVT(ScalarSize), NumElements);
8164 if (SDValue Unpack = TryUnpack(UnpackVT, Scale))
8168 // If none of the unpack-rooted lowerings worked (or were profitable) try an
8170 if (NumLoInputs == 0 || NumHiInputs == 0) {
8171 assert((NumLoInputs > 0 || NumHiInputs > 0) &&
8172 "We have to have *some* inputs!");
8173 int HalfOffset = NumLoInputs == 0 ? Size / 2 : 0;
8175 // FIXME: We could consider the total complexity of the permute of each
8176 // possible unpacking. Or at the least we should consider how many
8177 // half-crossings are created.
8178 // FIXME: We could consider commuting the unpacks.
8180 SmallVector<int, 32> PermMask;
8181 PermMask.assign(Size, -1);
8182 for (int i = 0; i < Size; ++i) {
8186 assert(Mask[i] % Size >= HalfOffset && "Found input from wrong half!");
8189 2 * ((Mask[i] % Size) - HalfOffset) + (Mask[i] < Size ? 0 : 1);
8191 return DAG.getVectorShuffle(
8192 VT, DL, DAG.getNode(NumLoInputs == 0 ? X86ISD::UNPCKH : X86ISD::UNPCKL,
8194 DAG.getUNDEF(VT), PermMask);
8200 /// \brief Handle lowering of 2-lane 64-bit floating point shuffles.
8202 /// This is the basis function for the 2-lane 64-bit shuffles as we have full
8203 /// support for floating point shuffles but not integer shuffles. These
8204 /// instructions will incur a domain crossing penalty on some chips though so
8205 /// it is better to avoid lowering through this for integer vectors where
8207 static SDValue lowerV2F64VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
8208 const X86Subtarget *Subtarget,
8209 SelectionDAG &DAG) {
8211 assert(Op.getSimpleValueType() == MVT::v2f64 && "Bad shuffle type!");
8212 assert(V1.getSimpleValueType() == MVT::v2f64 && "Bad operand type!");
8213 assert(V2.getSimpleValueType() == MVT::v2f64 && "Bad operand type!");
8214 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
8215 ArrayRef<int> Mask = SVOp->getMask();
8216 assert(Mask.size() == 2 && "Unexpected mask size for v2 shuffle!");
8218 if (isSingleInputShuffleMask(Mask)) {
8219 // Use low duplicate instructions for masks that match their pattern.
8220 if (Subtarget->hasSSE3())
8221 if (isShuffleEquivalent(V1, V2, Mask, {0, 0}))
8222 return DAG.getNode(X86ISD::MOVDDUP, DL, MVT::v2f64, V1);
8224 // Straight shuffle of a single input vector. Simulate this by using the
8225 // single input as both of the "inputs" to this instruction..
8226 unsigned SHUFPDMask = (Mask[0] == 1) | ((Mask[1] == 1) << 1);
8228 if (Subtarget->hasAVX()) {
8229 // If we have AVX, we can use VPERMILPS which will allow folding a load
8230 // into the shuffle.
8231 return DAG.getNode(X86ISD::VPERMILPI, DL, MVT::v2f64, V1,
8232 DAG.getConstant(SHUFPDMask, DL, MVT::i8));
8235 return DAG.getNode(X86ISD::SHUFP, DL, MVT::v2f64, V1, V1,
8236 DAG.getConstant(SHUFPDMask, DL, MVT::i8));
8238 assert(Mask[0] >= 0 && Mask[0] < 2 && "Non-canonicalized blend!");
8239 assert(Mask[1] >= 2 && "Non-canonicalized blend!");
8241 // If we have a single input, insert that into V1 if we can do so cheaply.
8242 if ((Mask[0] >= 2) + (Mask[1] >= 2) == 1) {
8243 if (SDValue Insertion = lowerVectorShuffleAsElementInsertion(
8244 DL, MVT::v2f64, V1, V2, Mask, Subtarget, DAG))
8246 // Try inverting the insertion since for v2 masks it is easy to do and we
8247 // can't reliably sort the mask one way or the other.
8248 int InverseMask[2] = {Mask[0] < 0 ? -1 : (Mask[0] ^ 2),
8249 Mask[1] < 0 ? -1 : (Mask[1] ^ 2)};
8250 if (SDValue Insertion = lowerVectorShuffleAsElementInsertion(
8251 DL, MVT::v2f64, V2, V1, InverseMask, Subtarget, DAG))
8255 // Try to use one of the special instruction patterns to handle two common
8256 // blend patterns if a zero-blend above didn't work.
8257 if (isShuffleEquivalent(V1, V2, Mask, {0, 3}) ||
8258 isShuffleEquivalent(V1, V2, Mask, {1, 3}))
8259 if (SDValue V1S = getScalarValueForVectorElement(V1, Mask[0], DAG))
8260 // We can either use a special instruction to load over the low double or
8261 // to move just the low double.
8263 isShuffleFoldableLoad(V1S) ? X86ISD::MOVLPD : X86ISD::MOVSD,
8265 DAG.getNode(ISD::SCALAR_TO_VECTOR, DL, MVT::v2f64, V1S));
8267 if (Subtarget->hasSSE41())
8268 if (SDValue Blend = lowerVectorShuffleAsBlend(DL, MVT::v2f64, V1, V2, Mask,
8272 // Use dedicated unpack instructions for masks that match their pattern.
8274 lowerVectorShuffleWithUNPCK(DL, MVT::v2f64, Mask, V1, V2, DAG))
8277 unsigned SHUFPDMask = (Mask[0] == 1) | (((Mask[1] - 2) == 1) << 1);
8278 return DAG.getNode(X86ISD::SHUFP, DL, MVT::v2f64, V1, V2,
8279 DAG.getConstant(SHUFPDMask, DL, MVT::i8));
8282 /// \brief Handle lowering of 2-lane 64-bit integer shuffles.
8284 /// Tries to lower a 2-lane 64-bit shuffle using shuffle operations provided by
8285 /// the integer unit to minimize domain crossing penalties. However, for blends
8286 /// it falls back to the floating point shuffle operation with appropriate bit
8288 static SDValue lowerV2I64VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
8289 const X86Subtarget *Subtarget,
8290 SelectionDAG &DAG) {
8292 assert(Op.getSimpleValueType() == MVT::v2i64 && "Bad shuffle type!");
8293 assert(V1.getSimpleValueType() == MVT::v2i64 && "Bad operand type!");
8294 assert(V2.getSimpleValueType() == MVT::v2i64 && "Bad operand type!");
8295 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
8296 ArrayRef<int> Mask = SVOp->getMask();
8297 assert(Mask.size() == 2 && "Unexpected mask size for v2 shuffle!");
8299 if (isSingleInputShuffleMask(Mask)) {
8300 // Check for being able to broadcast a single element.
8301 if (SDValue Broadcast = lowerVectorShuffleAsBroadcast(DL, MVT::v2i64, V1,
8302 Mask, Subtarget, DAG))
8305 // Straight shuffle of a single input vector. For everything from SSE2
8306 // onward this has a single fast instruction with no scary immediates.
8307 // We have to map the mask as it is actually a v4i32 shuffle instruction.
8308 V1 = DAG.getBitcast(MVT::v4i32, V1);
8309 int WidenedMask[4] = {
8310 std::max(Mask[0], 0) * 2, std::max(Mask[0], 0) * 2 + 1,
8311 std::max(Mask[1], 0) * 2, std::max(Mask[1], 0) * 2 + 1};
8312 return DAG.getBitcast(
8314 DAG.getNode(X86ISD::PSHUFD, DL, MVT::v4i32, V1,
8315 getV4X86ShuffleImm8ForMask(WidenedMask, DL, DAG)));
8317 assert(Mask[0] != -1 && "No undef lanes in multi-input v2 shuffles!");
8318 assert(Mask[1] != -1 && "No undef lanes in multi-input v2 shuffles!");
8319 assert(Mask[0] < 2 && "We sort V1 to be the first input.");
8320 assert(Mask[1] >= 2 && "We sort V2 to be the second input.");
8322 // If we have a blend of two PACKUS operations an the blend aligns with the
8323 // low and half halves, we can just merge the PACKUS operations. This is
8324 // particularly important as it lets us merge shuffles that this routine itself
8326 auto GetPackNode = [](SDValue V) {
8327 while (V.getOpcode() == ISD::BITCAST)
8328 V = V.getOperand(0);
8330 return V.getOpcode() == X86ISD::PACKUS ? V : SDValue();
8332 if (SDValue V1Pack = GetPackNode(V1))
8333 if (SDValue V2Pack = GetPackNode(V2))
8334 return DAG.getBitcast(MVT::v2i64,
8335 DAG.getNode(X86ISD::PACKUS, DL, MVT::v16i8,
8336 Mask[0] == 0 ? V1Pack.getOperand(0)
8337 : V1Pack.getOperand(1),
8338 Mask[1] == 2 ? V2Pack.getOperand(0)
8339 : V2Pack.getOperand(1)));
8341 // Try to use shift instructions.
8343 lowerVectorShuffleAsShift(DL, MVT::v2i64, V1, V2, Mask, DAG))
8346 // When loading a scalar and then shuffling it into a vector we can often do
8347 // the insertion cheaply.
8348 if (SDValue Insertion = lowerVectorShuffleAsElementInsertion(
8349 DL, MVT::v2i64, V1, V2, Mask, Subtarget, DAG))
8351 // Try inverting the insertion since for v2 masks it is easy to do and we
8352 // can't reliably sort the mask one way or the other.
8353 int InverseMask[2] = {Mask[0] ^ 2, Mask[1] ^ 2};
8354 if (SDValue Insertion = lowerVectorShuffleAsElementInsertion(
8355 DL, MVT::v2i64, V2, V1, InverseMask, Subtarget, DAG))
8358 // We have different paths for blend lowering, but they all must use the
8359 // *exact* same predicate.
8360 bool IsBlendSupported = Subtarget->hasSSE41();
8361 if (IsBlendSupported)
8362 if (SDValue Blend = lowerVectorShuffleAsBlend(DL, MVT::v2i64, V1, V2, Mask,
8366 // Use dedicated unpack instructions for masks that match their pattern.
8368 lowerVectorShuffleWithUNPCK(DL, MVT::v2i64, Mask, V1, V2, DAG))
8371 // Try to use byte rotation instructions.
8372 // Its more profitable for pre-SSSE3 to use shuffles/unpacks.
8373 if (Subtarget->hasSSSE3())
8374 if (SDValue Rotate = lowerVectorShuffleAsByteRotate(
8375 DL, MVT::v2i64, V1, V2, Mask, Subtarget, DAG))
8378 // If we have direct support for blends, we should lower by decomposing into
8379 // a permute. That will be faster than the domain cross.
8380 if (IsBlendSupported)
8381 return lowerVectorShuffleAsDecomposedShuffleBlend(DL, MVT::v2i64, V1, V2,
8384 // We implement this with SHUFPD which is pretty lame because it will likely
8385 // incur 2 cycles of stall for integer vectors on Nehalem and older chips.
8386 // However, all the alternatives are still more cycles and newer chips don't
8387 // have this problem. It would be really nice if x86 had better shuffles here.
8388 V1 = DAG.getBitcast(MVT::v2f64, V1);
8389 V2 = DAG.getBitcast(MVT::v2f64, V2);
8390 return DAG.getBitcast(MVT::v2i64,
8391 DAG.getVectorShuffle(MVT::v2f64, DL, V1, V2, Mask));
8394 /// \brief Test whether this can be lowered with a single SHUFPS instruction.
8396 /// This is used to disable more specialized lowerings when the shufps lowering
8397 /// will happen to be efficient.
8398 static bool isSingleSHUFPSMask(ArrayRef<int> Mask) {
8399 // This routine only handles 128-bit shufps.
8400 assert(Mask.size() == 4 && "Unsupported mask size!");
8402 // To lower with a single SHUFPS we need to have the low half and high half
8403 // each requiring a single input.
8404 if (Mask[0] != -1 && Mask[1] != -1 && (Mask[0] < 4) != (Mask[1] < 4))
8406 if (Mask[2] != -1 && Mask[3] != -1 && (Mask[2] < 4) != (Mask[3] < 4))
8412 /// \brief Lower a vector shuffle using the SHUFPS instruction.
8414 /// This is a helper routine dedicated to lowering vector shuffles using SHUFPS.
8415 /// It makes no assumptions about whether this is the *best* lowering, it simply
8417 static SDValue lowerVectorShuffleWithSHUFPS(SDLoc DL, MVT VT,
8418 ArrayRef<int> Mask, SDValue V1,
8419 SDValue V2, SelectionDAG &DAG) {
8420 SDValue LowV = V1, HighV = V2;
8421 int NewMask[4] = {Mask[0], Mask[1], Mask[2], Mask[3]};
8424 std::count_if(Mask.begin(), Mask.end(), [](int M) { return M >= 4; });
8426 if (NumV2Elements == 1) {
8428 std::find_if(Mask.begin(), Mask.end(), [](int M) { return M >= 4; }) -
8431 // Compute the index adjacent to V2Index and in the same half by toggling
8433 int V2AdjIndex = V2Index ^ 1;
8435 if (Mask[V2AdjIndex] == -1) {
8436 // Handles all the cases where we have a single V2 element and an undef.
8437 // This will only ever happen in the high lanes because we commute the
8438 // vector otherwise.
8440 std::swap(LowV, HighV);
8441 NewMask[V2Index] -= 4;
8443 // Handle the case where the V2 element ends up adjacent to a V1 element.
8444 // To make this work, blend them together as the first step.
8445 int V1Index = V2AdjIndex;
8446 int BlendMask[4] = {Mask[V2Index] - 4, 0, Mask[V1Index], 0};
8447 V2 = DAG.getNode(X86ISD::SHUFP, DL, VT, V2, V1,
8448 getV4X86ShuffleImm8ForMask(BlendMask, DL, DAG));
8450 // Now proceed to reconstruct the final blend as we have the necessary
8451 // high or low half formed.
8458 NewMask[V1Index] = 2; // We put the V1 element in V2[2].
8459 NewMask[V2Index] = 0; // We shifted the V2 element into V2[0].
8461 } else if (NumV2Elements == 2) {
8462 if (Mask[0] < 4 && Mask[1] < 4) {
8463 // Handle the easy case where we have V1 in the low lanes and V2 in the
8467 } else if (Mask[2] < 4 && Mask[3] < 4) {
8468 // We also handle the reversed case because this utility may get called
8469 // when we detect a SHUFPS pattern but can't easily commute the shuffle to
8470 // arrange things in the right direction.
8476 // We have a mixture of V1 and V2 in both low and high lanes. Rather than
8477 // trying to place elements directly, just blend them and set up the final
8478 // shuffle to place them.
8480 // The first two blend mask elements are for V1, the second two are for
8482 int BlendMask[4] = {Mask[0] < 4 ? Mask[0] : Mask[1],
8483 Mask[2] < 4 ? Mask[2] : Mask[3],
8484 (Mask[0] >= 4 ? Mask[0] : Mask[1]) - 4,
8485 (Mask[2] >= 4 ? Mask[2] : Mask[3]) - 4};
8486 V1 = DAG.getNode(X86ISD::SHUFP, DL, VT, V1, V2,
8487 getV4X86ShuffleImm8ForMask(BlendMask, DL, DAG));
8489 // Now we do a normal shuffle of V1 by giving V1 as both operands to
8492 NewMask[0] = Mask[0] < 4 ? 0 : 2;
8493 NewMask[1] = Mask[0] < 4 ? 2 : 0;
8494 NewMask[2] = Mask[2] < 4 ? 1 : 3;
8495 NewMask[3] = Mask[2] < 4 ? 3 : 1;
8498 return DAG.getNode(X86ISD::SHUFP, DL, VT, LowV, HighV,
8499 getV4X86ShuffleImm8ForMask(NewMask, DL, DAG));
8502 /// \brief Lower 4-lane 32-bit floating point shuffles.
8504 /// Uses instructions exclusively from the floating point unit to minimize
8505 /// domain crossing penalties, as these are sufficient to implement all v4f32
8507 static SDValue lowerV4F32VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
8508 const X86Subtarget *Subtarget,
8509 SelectionDAG &DAG) {
8511 assert(Op.getSimpleValueType() == MVT::v4f32 && "Bad shuffle type!");
8512 assert(V1.getSimpleValueType() == MVT::v4f32 && "Bad operand type!");
8513 assert(V2.getSimpleValueType() == MVT::v4f32 && "Bad operand type!");
8514 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
8515 ArrayRef<int> Mask = SVOp->getMask();
8516 assert(Mask.size() == 4 && "Unexpected mask size for v4 shuffle!");
8519 std::count_if(Mask.begin(), Mask.end(), [](int M) { return M >= 4; });
8521 if (NumV2Elements == 0) {
8522 // Check for being able to broadcast a single element.
8523 if (SDValue Broadcast = lowerVectorShuffleAsBroadcast(DL, MVT::v4f32, V1,
8524 Mask, Subtarget, DAG))
8527 // Use even/odd duplicate instructions for masks that match their pattern.
8528 if (Subtarget->hasSSE3()) {
8529 if (isShuffleEquivalent(V1, V2, Mask, {0, 0, 2, 2}))
8530 return DAG.getNode(X86ISD::MOVSLDUP, DL, MVT::v4f32, V1);
8531 if (isShuffleEquivalent(V1, V2, Mask, {1, 1, 3, 3}))
8532 return DAG.getNode(X86ISD::MOVSHDUP, DL, MVT::v4f32, V1);
8535 if (Subtarget->hasAVX()) {
8536 // If we have AVX, we can use VPERMILPS which will allow folding a load
8537 // into the shuffle.
8538 return DAG.getNode(X86ISD::VPERMILPI, DL, MVT::v4f32, V1,
8539 getV4X86ShuffleImm8ForMask(Mask, DL, DAG));
8542 // Otherwise, use a straight shuffle of a single input vector. We pass the
8543 // input vector to both operands to simulate this with a SHUFPS.
8544 return DAG.getNode(X86ISD::SHUFP, DL, MVT::v4f32, V1, V1,
8545 getV4X86ShuffleImm8ForMask(Mask, DL, DAG));
8548 // There are special ways we can lower some single-element blends. However, we
8549 // have custom ways we can lower more complex single-element blends below that
8550 // we defer to if both this and BLENDPS fail to match, so restrict this to
8551 // when the V2 input is targeting element 0 of the mask -- that is the fast
8553 if (NumV2Elements == 1 && Mask[0] >= 4)
8554 if (SDValue V = lowerVectorShuffleAsElementInsertion(DL, MVT::v4f32, V1, V2,
8555 Mask, Subtarget, DAG))
8558 if (Subtarget->hasSSE41()) {
8559 if (SDValue Blend = lowerVectorShuffleAsBlend(DL, MVT::v4f32, V1, V2, Mask,
8563 // Use INSERTPS if we can complete the shuffle efficiently.
8564 if (SDValue V = lowerVectorShuffleAsInsertPS(Op, V1, V2, Mask, DAG))
8567 if (!isSingleSHUFPSMask(Mask))
8568 if (SDValue BlendPerm = lowerVectorShuffleAsBlendAndPermute(
8569 DL, MVT::v4f32, V1, V2, Mask, DAG))
8573 // Use dedicated unpack instructions for masks that match their pattern.
8575 lowerVectorShuffleWithUNPCK(DL, MVT::v4f32, Mask, V1, V2, DAG))
8578 // Otherwise fall back to a SHUFPS lowering strategy.
8579 return lowerVectorShuffleWithSHUFPS(DL, MVT::v4f32, Mask, V1, V2, DAG);
8582 /// \brief Lower 4-lane i32 vector shuffles.
8584 /// We try to handle these with integer-domain shuffles where we can, but for
8585 /// blends we use the floating point domain blend instructions.
8586 static SDValue lowerV4I32VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
8587 const X86Subtarget *Subtarget,
8588 SelectionDAG &DAG) {
8590 assert(Op.getSimpleValueType() == MVT::v4i32 && "Bad shuffle type!");
8591 assert(V1.getSimpleValueType() == MVT::v4i32 && "Bad operand type!");
8592 assert(V2.getSimpleValueType() == MVT::v4i32 && "Bad operand type!");
8593 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
8594 ArrayRef<int> Mask = SVOp->getMask();
8595 assert(Mask.size() == 4 && "Unexpected mask size for v4 shuffle!");
8597 // Whenever we can lower this as a zext, that instruction is strictly faster
8598 // than any alternative. It also allows us to fold memory operands into the
8599 // shuffle in many cases.
8600 if (SDValue ZExt = lowerVectorShuffleAsZeroOrAnyExtend(DL, MVT::v4i32, V1, V2,
8601 Mask, Subtarget, DAG))
8605 std::count_if(Mask.begin(), Mask.end(), [](int M) { return M >= 4; });
8607 if (NumV2Elements == 0) {
8608 // Check for being able to broadcast a single element.
8609 if (SDValue Broadcast = lowerVectorShuffleAsBroadcast(DL, MVT::v4i32, V1,
8610 Mask, Subtarget, DAG))
8613 // Straight shuffle of a single input vector. For everything from SSE2
8614 // onward this has a single fast instruction with no scary immediates.
8615 // We coerce the shuffle pattern to be compatible with UNPCK instructions
8616 // but we aren't actually going to use the UNPCK instruction because doing
8617 // so prevents folding a load into this instruction or making a copy.
8618 const int UnpackLoMask[] = {0, 0, 1, 1};
8619 const int UnpackHiMask[] = {2, 2, 3, 3};
8620 if (isShuffleEquivalent(V1, V2, Mask, {0, 0, 1, 1}))
8621 Mask = UnpackLoMask;
8622 else if (isShuffleEquivalent(V1, V2, Mask, {2, 2, 3, 3}))
8623 Mask = UnpackHiMask;
8625 return DAG.getNode(X86ISD::PSHUFD, DL, MVT::v4i32, V1,
8626 getV4X86ShuffleImm8ForMask(Mask, DL, DAG));
8629 // Try to use shift instructions.
8631 lowerVectorShuffleAsShift(DL, MVT::v4i32, V1, V2, Mask, DAG))
8634 // There are special ways we can lower some single-element blends.
8635 if (NumV2Elements == 1)
8636 if (SDValue V = lowerVectorShuffleAsElementInsertion(DL, MVT::v4i32, V1, V2,
8637 Mask, Subtarget, DAG))
8640 // We have different paths for blend lowering, but they all must use the
8641 // *exact* same predicate.
8642 bool IsBlendSupported = Subtarget->hasSSE41();
8643 if (IsBlendSupported)
8644 if (SDValue Blend = lowerVectorShuffleAsBlend(DL, MVT::v4i32, V1, V2, Mask,
8648 if (SDValue Masked =
8649 lowerVectorShuffleAsBitMask(DL, MVT::v4i32, V1, V2, Mask, DAG))
8652 // Use dedicated unpack instructions for masks that match their pattern.
8654 lowerVectorShuffleWithUNPCK(DL, MVT::v4i32, Mask, V1, V2, DAG))
8657 // Try to use byte rotation instructions.
8658 // Its more profitable for pre-SSSE3 to use shuffles/unpacks.
8659 if (Subtarget->hasSSSE3())
8660 if (SDValue Rotate = lowerVectorShuffleAsByteRotate(
8661 DL, MVT::v4i32, V1, V2, Mask, Subtarget, DAG))
8664 // If we have direct support for blends, we should lower by decomposing into
8665 // a permute. That will be faster than the domain cross.
8666 if (IsBlendSupported)
8667 return lowerVectorShuffleAsDecomposedShuffleBlend(DL, MVT::v4i32, V1, V2,
8670 // Try to lower by permuting the inputs into an unpack instruction.
8671 if (SDValue Unpack = lowerVectorShuffleAsPermuteAndUnpack(DL, MVT::v4i32, V1,
8675 // We implement this with SHUFPS because it can blend from two vectors.
8676 // Because we're going to eventually use SHUFPS, we use SHUFPS even to build
8677 // up the inputs, bypassing domain shift penalties that we would encur if we
8678 // directly used PSHUFD on Nehalem and older. For newer chips, this isn't
8680 return DAG.getBitcast(
8682 DAG.getVectorShuffle(MVT::v4f32, DL, DAG.getBitcast(MVT::v4f32, V1),
8683 DAG.getBitcast(MVT::v4f32, V2), Mask));
8686 /// \brief Lowering of single-input v8i16 shuffles is the cornerstone of SSE2
8687 /// shuffle lowering, and the most complex part.
8689 /// The lowering strategy is to try to form pairs of input lanes which are
8690 /// targeted at the same half of the final vector, and then use a dword shuffle
8691 /// to place them onto the right half, and finally unpack the paired lanes into
8692 /// their final position.
8694 /// The exact breakdown of how to form these dword pairs and align them on the
8695 /// correct sides is really tricky. See the comments within the function for
8696 /// more of the details.
8698 /// This code also handles repeated 128-bit lanes of v8i16 shuffles, but each
8699 /// lane must shuffle the *exact* same way. In fact, you must pass a v8 Mask to
8700 /// this routine for it to work correctly. To shuffle a 256-bit or 512-bit i16
8701 /// vector, form the analogous 128-bit 8-element Mask.
8702 static SDValue lowerV8I16GeneralSingleInputVectorShuffle(
8703 SDLoc DL, MVT VT, SDValue V, MutableArrayRef<int> Mask,
8704 const X86Subtarget *Subtarget, SelectionDAG &DAG) {
8705 assert(VT.getVectorElementType() == MVT::i16 && "Bad input type!");
8706 MVT PSHUFDVT = MVT::getVectorVT(MVT::i32, VT.getVectorNumElements() / 2);
8708 assert(Mask.size() == 8 && "Shuffle mask length doen't match!");
8709 MutableArrayRef<int> LoMask = Mask.slice(0, 4);
8710 MutableArrayRef<int> HiMask = Mask.slice(4, 4);
8712 SmallVector<int, 4> LoInputs;
8713 std::copy_if(LoMask.begin(), LoMask.end(), std::back_inserter(LoInputs),
8714 [](int M) { return M >= 0; });
8715 std::sort(LoInputs.begin(), LoInputs.end());
8716 LoInputs.erase(std::unique(LoInputs.begin(), LoInputs.end()), LoInputs.end());
8717 SmallVector<int, 4> HiInputs;
8718 std::copy_if(HiMask.begin(), HiMask.end(), std::back_inserter(HiInputs),
8719 [](int M) { return M >= 0; });
8720 std::sort(HiInputs.begin(), HiInputs.end());
8721 HiInputs.erase(std::unique(HiInputs.begin(), HiInputs.end()), HiInputs.end());
8723 std::lower_bound(LoInputs.begin(), LoInputs.end(), 4) - LoInputs.begin();
8724 int NumHToL = LoInputs.size() - NumLToL;
8726 std::lower_bound(HiInputs.begin(), HiInputs.end(), 4) - HiInputs.begin();
8727 int NumHToH = HiInputs.size() - NumLToH;
8728 MutableArrayRef<int> LToLInputs(LoInputs.data(), NumLToL);
8729 MutableArrayRef<int> LToHInputs(HiInputs.data(), NumLToH);
8730 MutableArrayRef<int> HToLInputs(LoInputs.data() + NumLToL, NumHToL);
8731 MutableArrayRef<int> HToHInputs(HiInputs.data() + NumLToH, NumHToH);
8733 // Simplify the 1-into-3 and 3-into-1 cases with a single pshufd. For all
8734 // such inputs we can swap two of the dwords across the half mark and end up
8735 // with <=2 inputs to each half in each half. Once there, we can fall through
8736 // to the generic code below. For example:
8738 // Input: [a, b, c, d, e, f, g, h] -PSHUFD[0,2,1,3]-> [a, b, e, f, c, d, g, h]
8739 // Mask: [0, 1, 2, 7, 4, 5, 6, 3] -----------------> [0, 1, 4, 7, 2, 3, 6, 5]
8741 // However in some very rare cases we have a 1-into-3 or 3-into-1 on one half
8742 // and an existing 2-into-2 on the other half. In this case we may have to
8743 // pre-shuffle the 2-into-2 half to avoid turning it into a 3-into-1 or
8744 // 1-into-3 which could cause us to cycle endlessly fixing each side in turn.
8745 // Fortunately, we don't have to handle anything but a 2-into-2 pattern
8746 // because any other situation (including a 3-into-1 or 1-into-3 in the other
8747 // half than the one we target for fixing) will be fixed when we re-enter this
8748 // path. We will also combine away any sequence of PSHUFD instructions that
8749 // result into a single instruction. Here is an example of the tricky case:
8751 // Input: [a, b, c, d, e, f, g, h] -PSHUFD[0,2,1,3]-> [a, b, e, f, c, d, g, h]
8752 // Mask: [3, 7, 1, 0, 2, 7, 3, 5] -THIS-IS-BAD!!!!-> [5, 7, 1, 0, 4, 7, 5, 3]
8754 // This now has a 1-into-3 in the high half! Instead, we do two shuffles:
8756 // Input: [a, b, c, d, e, f, g, h] PSHUFHW[0,2,1,3]-> [a, b, c, d, e, g, f, h]
8757 // Mask: [3, 7, 1, 0, 2, 7, 3, 5] -----------------> [3, 7, 1, 0, 2, 7, 3, 6]
8759 // Input: [a, b, c, d, e, g, f, h] -PSHUFD[0,2,1,3]-> [a, b, e, g, c, d, f, h]
8760 // Mask: [3, 7, 1, 0, 2, 7, 3, 6] -----------------> [5, 7, 1, 0, 4, 7, 5, 6]
8762 // The result is fine to be handled by the generic logic.
8763 auto balanceSides = [&](ArrayRef<int> AToAInputs, ArrayRef<int> BToAInputs,
8764 ArrayRef<int> BToBInputs, ArrayRef<int> AToBInputs,
8765 int AOffset, int BOffset) {
8766 assert((AToAInputs.size() == 3 || AToAInputs.size() == 1) &&
8767 "Must call this with A having 3 or 1 inputs from the A half.");
8768 assert((BToAInputs.size() == 1 || BToAInputs.size() == 3) &&
8769 "Must call this with B having 1 or 3 inputs from the B half.");
8770 assert(AToAInputs.size() + BToAInputs.size() == 4 &&
8771 "Must call this with either 3:1 or 1:3 inputs (summing to 4).");
8773 bool ThreeAInputs = AToAInputs.size() == 3;
8775 // Compute the index of dword with only one word among the three inputs in
8776 // a half by taking the sum of the half with three inputs and subtracting
8777 // the sum of the actual three inputs. The difference is the remaining
8780 int &TripleDWord = ThreeAInputs ? ADWord : BDWord;
8781 int &OneInputDWord = ThreeAInputs ? BDWord : ADWord;
8782 int TripleInputOffset = ThreeAInputs ? AOffset : BOffset;
8783 ArrayRef<int> TripleInputs = ThreeAInputs ? AToAInputs : BToAInputs;
8784 int OneInput = ThreeAInputs ? BToAInputs[0] : AToAInputs[0];
8785 int TripleInputSum = 0 + 1 + 2 + 3 + (4 * TripleInputOffset);
8786 int TripleNonInputIdx =
8787 TripleInputSum - std::accumulate(TripleInputs.begin(), TripleInputs.end(), 0);
8788 TripleDWord = TripleNonInputIdx / 2;
8790 // We use xor with one to compute the adjacent DWord to whichever one the
8792 OneInputDWord = (OneInput / 2) ^ 1;
8794 // Check for one tricky case: We're fixing a 3<-1 or a 1<-3 shuffle for AToA
8795 // and BToA inputs. If there is also such a problem with the BToB and AToB
8796 // inputs, we don't try to fix it necessarily -- we'll recurse and see it in
8797 // the next pass. However, if we have a 2<-2 in the BToB and AToB inputs, it
8798 // is essential that we don't *create* a 3<-1 as then we might oscillate.
8799 if (BToBInputs.size() == 2 && AToBInputs.size() == 2) {
8800 // Compute how many inputs will be flipped by swapping these DWords. We
8802 // to balance this to ensure we don't form a 3-1 shuffle in the other
8804 int NumFlippedAToBInputs =
8805 std::count(AToBInputs.begin(), AToBInputs.end(), 2 * ADWord) +
8806 std::count(AToBInputs.begin(), AToBInputs.end(), 2 * ADWord + 1);
8807 int NumFlippedBToBInputs =
8808 std::count(BToBInputs.begin(), BToBInputs.end(), 2 * BDWord) +
8809 std::count(BToBInputs.begin(), BToBInputs.end(), 2 * BDWord + 1);
8810 if ((NumFlippedAToBInputs == 1 &&
8811 (NumFlippedBToBInputs == 0 || NumFlippedBToBInputs == 2)) ||
8812 (NumFlippedBToBInputs == 1 &&
8813 (NumFlippedAToBInputs == 0 || NumFlippedAToBInputs == 2))) {
8814 // We choose whether to fix the A half or B half based on whether that
8815 // half has zero flipped inputs. At zero, we may not be able to fix it
8816 // with that half. We also bias towards fixing the B half because that
8817 // will more commonly be the high half, and we have to bias one way.
8818 auto FixFlippedInputs = [&V, &DL, &Mask, &DAG](int PinnedIdx, int DWord,
8819 ArrayRef<int> Inputs) {
8820 int FixIdx = PinnedIdx ^ 1; // The adjacent slot to the pinned slot.
8821 bool IsFixIdxInput = std::find(Inputs.begin(), Inputs.end(),
8822 PinnedIdx ^ 1) != Inputs.end();
8823 // Determine whether the free index is in the flipped dword or the
8824 // unflipped dword based on where the pinned index is. We use this bit
8825 // in an xor to conditionally select the adjacent dword.
8826 int FixFreeIdx = 2 * (DWord ^ (PinnedIdx / 2 == DWord));
8827 bool IsFixFreeIdxInput = std::find(Inputs.begin(), Inputs.end(),
8828 FixFreeIdx) != Inputs.end();
8829 if (IsFixIdxInput == IsFixFreeIdxInput)
8831 IsFixFreeIdxInput = std::find(Inputs.begin(), Inputs.end(),
8832 FixFreeIdx) != Inputs.end();
8833 assert(IsFixIdxInput != IsFixFreeIdxInput &&
8834 "We need to be changing the number of flipped inputs!");
8835 int PSHUFHalfMask[] = {0, 1, 2, 3};
8836 std::swap(PSHUFHalfMask[FixFreeIdx % 4], PSHUFHalfMask[FixIdx % 4]);
8837 V = DAG.getNode(FixIdx < 4 ? X86ISD::PSHUFLW : X86ISD::PSHUFHW, DL,
8839 getV4X86ShuffleImm8ForMask(PSHUFHalfMask, DL, DAG));
8842 if (M != -1 && M == FixIdx)
8844 else if (M != -1 && M == FixFreeIdx)
8847 if (NumFlippedBToBInputs != 0) {
8849 BToAInputs.size() == 3 ? TripleNonInputIdx : OneInput;
8850 FixFlippedInputs(BPinnedIdx, BDWord, BToBInputs);
8852 assert(NumFlippedAToBInputs != 0 && "Impossible given predicates!");
8853 int APinnedIdx = ThreeAInputs ? TripleNonInputIdx : OneInput;
8854 FixFlippedInputs(APinnedIdx, ADWord, AToBInputs);
8859 int PSHUFDMask[] = {0, 1, 2, 3};
8860 PSHUFDMask[ADWord] = BDWord;
8861 PSHUFDMask[BDWord] = ADWord;
8864 DAG.getNode(X86ISD::PSHUFD, DL, PSHUFDVT, DAG.getBitcast(PSHUFDVT, V),
8865 getV4X86ShuffleImm8ForMask(PSHUFDMask, DL, DAG)));
8867 // Adjust the mask to match the new locations of A and B.
8869 if (M != -1 && M/2 == ADWord)
8870 M = 2 * BDWord + M % 2;
8871 else if (M != -1 && M/2 == BDWord)
8872 M = 2 * ADWord + M % 2;
8874 // Recurse back into this routine to re-compute state now that this isn't
8875 // a 3 and 1 problem.
8876 return lowerV8I16GeneralSingleInputVectorShuffle(DL, VT, V, Mask, Subtarget,
8879 if ((NumLToL == 3 && NumHToL == 1) || (NumLToL == 1 && NumHToL == 3))
8880 return balanceSides(LToLInputs, HToLInputs, HToHInputs, LToHInputs, 0, 4);
8881 else if ((NumHToH == 3 && NumLToH == 1) || (NumHToH == 1 && NumLToH == 3))
8882 return balanceSides(HToHInputs, LToHInputs, LToLInputs, HToLInputs, 4, 0);
8884 // At this point there are at most two inputs to the low and high halves from
8885 // each half. That means the inputs can always be grouped into dwords and
8886 // those dwords can then be moved to the correct half with a dword shuffle.
8887 // We use at most one low and one high word shuffle to collect these paired
8888 // inputs into dwords, and finally a dword shuffle to place them.
8889 int PSHUFLMask[4] = {-1, -1, -1, -1};
8890 int PSHUFHMask[4] = {-1, -1, -1, -1};
8891 int PSHUFDMask[4] = {-1, -1, -1, -1};
8893 // First fix the masks for all the inputs that are staying in their
8894 // original halves. This will then dictate the targets of the cross-half
8896 auto fixInPlaceInputs =
8897 [&PSHUFDMask](ArrayRef<int> InPlaceInputs, ArrayRef<int> IncomingInputs,
8898 MutableArrayRef<int> SourceHalfMask,
8899 MutableArrayRef<int> HalfMask, int HalfOffset) {
8900 if (InPlaceInputs.empty())
8902 if (InPlaceInputs.size() == 1) {
8903 SourceHalfMask[InPlaceInputs[0] - HalfOffset] =
8904 InPlaceInputs[0] - HalfOffset;
8905 PSHUFDMask[InPlaceInputs[0] / 2] = InPlaceInputs[0] / 2;
8908 if (IncomingInputs.empty()) {
8909 // Just fix all of the in place inputs.
8910 for (int Input : InPlaceInputs) {
8911 SourceHalfMask[Input - HalfOffset] = Input - HalfOffset;
8912 PSHUFDMask[Input / 2] = Input / 2;
8917 assert(InPlaceInputs.size() == 2 && "Cannot handle 3 or 4 inputs!");
8918 SourceHalfMask[InPlaceInputs[0] - HalfOffset] =
8919 InPlaceInputs[0] - HalfOffset;
8920 // Put the second input next to the first so that they are packed into
8921 // a dword. We find the adjacent index by toggling the low bit.
8922 int AdjIndex = InPlaceInputs[0] ^ 1;
8923 SourceHalfMask[AdjIndex - HalfOffset] = InPlaceInputs[1] - HalfOffset;
8924 std::replace(HalfMask.begin(), HalfMask.end(), InPlaceInputs[1], AdjIndex);
8925 PSHUFDMask[AdjIndex / 2] = AdjIndex / 2;
8927 fixInPlaceInputs(LToLInputs, HToLInputs, PSHUFLMask, LoMask, 0);
8928 fixInPlaceInputs(HToHInputs, LToHInputs, PSHUFHMask, HiMask, 4);
8930 // Now gather the cross-half inputs and place them into a free dword of
8931 // their target half.
8932 // FIXME: This operation could almost certainly be simplified dramatically to
8933 // look more like the 3-1 fixing operation.
8934 auto moveInputsToRightHalf = [&PSHUFDMask](
8935 MutableArrayRef<int> IncomingInputs, ArrayRef<int> ExistingInputs,
8936 MutableArrayRef<int> SourceHalfMask, MutableArrayRef<int> HalfMask,
8937 MutableArrayRef<int> FinalSourceHalfMask, int SourceOffset,
8939 auto isWordClobbered = [](ArrayRef<int> SourceHalfMask, int Word) {
8940 return SourceHalfMask[Word] != -1 && SourceHalfMask[Word] != Word;
8942 auto isDWordClobbered = [&isWordClobbered](ArrayRef<int> SourceHalfMask,
8944 int LowWord = Word & ~1;
8945 int HighWord = Word | 1;
8946 return isWordClobbered(SourceHalfMask, LowWord) ||
8947 isWordClobbered(SourceHalfMask, HighWord);
8950 if (IncomingInputs.empty())
8953 if (ExistingInputs.empty()) {
8954 // Map any dwords with inputs from them into the right half.
8955 for (int Input : IncomingInputs) {
8956 // If the source half mask maps over the inputs, turn those into
8957 // swaps and use the swapped lane.
8958 if (isWordClobbered(SourceHalfMask, Input - SourceOffset)) {
8959 if (SourceHalfMask[SourceHalfMask[Input - SourceOffset]] == -1) {
8960 SourceHalfMask[SourceHalfMask[Input - SourceOffset]] =
8961 Input - SourceOffset;
8962 // We have to swap the uses in our half mask in one sweep.
8963 for (int &M : HalfMask)
8964 if (M == SourceHalfMask[Input - SourceOffset] + SourceOffset)
8966 else if (M == Input)
8967 M = SourceHalfMask[Input - SourceOffset] + SourceOffset;
8969 assert(SourceHalfMask[SourceHalfMask[Input - SourceOffset]] ==
8970 Input - SourceOffset &&
8971 "Previous placement doesn't match!");
8973 // Note that this correctly re-maps both when we do a swap and when
8974 // we observe the other side of the swap above. We rely on that to
8975 // avoid swapping the members of the input list directly.
8976 Input = SourceHalfMask[Input - SourceOffset] + SourceOffset;
8979 // Map the input's dword into the correct half.
8980 if (PSHUFDMask[(Input - SourceOffset + DestOffset) / 2] == -1)
8981 PSHUFDMask[(Input - SourceOffset + DestOffset) / 2] = Input / 2;
8983 assert(PSHUFDMask[(Input - SourceOffset + DestOffset) / 2] ==
8985 "Previous placement doesn't match!");
8988 // And just directly shift any other-half mask elements to be same-half
8989 // as we will have mirrored the dword containing the element into the
8990 // same position within that half.
8991 for (int &M : HalfMask)
8992 if (M >= SourceOffset && M < SourceOffset + 4) {
8993 M = M - SourceOffset + DestOffset;
8994 assert(M >= 0 && "This should never wrap below zero!");
8999 // Ensure we have the input in a viable dword of its current half. This
9000 // is particularly tricky because the original position may be clobbered
9001 // by inputs being moved and *staying* in that half.
9002 if (IncomingInputs.size() == 1) {
9003 if (isWordClobbered(SourceHalfMask, IncomingInputs[0] - SourceOffset)) {
9004 int InputFixed = std::find(std::begin(SourceHalfMask),
9005 std::end(SourceHalfMask), -1) -
9006 std::begin(SourceHalfMask) + SourceOffset;
9007 SourceHalfMask[InputFixed - SourceOffset] =
9008 IncomingInputs[0] - SourceOffset;
9009 std::replace(HalfMask.begin(), HalfMask.end(), IncomingInputs[0],
9011 IncomingInputs[0] = InputFixed;
9013 } else if (IncomingInputs.size() == 2) {
9014 if (IncomingInputs[0] / 2 != IncomingInputs[1] / 2 ||
9015 isDWordClobbered(SourceHalfMask, IncomingInputs[0] - SourceOffset)) {
9016 // We have two non-adjacent or clobbered inputs we need to extract from
9017 // the source half. To do this, we need to map them into some adjacent
9018 // dword slot in the source mask.
9019 int InputsFixed[2] = {IncomingInputs[0] - SourceOffset,
9020 IncomingInputs[1] - SourceOffset};
9022 // If there is a free slot in the source half mask adjacent to one of
9023 // the inputs, place the other input in it. We use (Index XOR 1) to
9024 // compute an adjacent index.
9025 if (!isWordClobbered(SourceHalfMask, InputsFixed[0]) &&
9026 SourceHalfMask[InputsFixed[0] ^ 1] == -1) {
9027 SourceHalfMask[InputsFixed[0]] = InputsFixed[0];
9028 SourceHalfMask[InputsFixed[0] ^ 1] = InputsFixed[1];
9029 InputsFixed[1] = InputsFixed[0] ^ 1;
9030 } else if (!isWordClobbered(SourceHalfMask, InputsFixed[1]) &&
9031 SourceHalfMask[InputsFixed[1] ^ 1] == -1) {
9032 SourceHalfMask[InputsFixed[1]] = InputsFixed[1];
9033 SourceHalfMask[InputsFixed[1] ^ 1] = InputsFixed[0];
9034 InputsFixed[0] = InputsFixed[1] ^ 1;
9035 } else if (SourceHalfMask[2 * ((InputsFixed[0] / 2) ^ 1)] == -1 &&
9036 SourceHalfMask[2 * ((InputsFixed[0] / 2) ^ 1) + 1] == -1) {
9037 // The two inputs are in the same DWord but it is clobbered and the
9038 // adjacent DWord isn't used at all. Move both inputs to the free
9040 SourceHalfMask[2 * ((InputsFixed[0] / 2) ^ 1)] = InputsFixed[0];
9041 SourceHalfMask[2 * ((InputsFixed[0] / 2) ^ 1) + 1] = InputsFixed[1];
9042 InputsFixed[0] = 2 * ((InputsFixed[0] / 2) ^ 1);
9043 InputsFixed[1] = 2 * ((InputsFixed[0] / 2) ^ 1) + 1;
9045 // The only way we hit this point is if there is no clobbering
9046 // (because there are no off-half inputs to this half) and there is no
9047 // free slot adjacent to one of the inputs. In this case, we have to
9048 // swap an input with a non-input.
9049 for (int i = 0; i < 4; ++i)
9050 assert((SourceHalfMask[i] == -1 || SourceHalfMask[i] == i) &&
9051 "We can't handle any clobbers here!");
9052 assert(InputsFixed[1] != (InputsFixed[0] ^ 1) &&
9053 "Cannot have adjacent inputs here!");
9055 SourceHalfMask[InputsFixed[0] ^ 1] = InputsFixed[1];
9056 SourceHalfMask[InputsFixed[1]] = InputsFixed[0] ^ 1;
9058 // We also have to update the final source mask in this case because
9059 // it may need to undo the above swap.
9060 for (int &M : FinalSourceHalfMask)
9061 if (M == (InputsFixed[0] ^ 1) + SourceOffset)
9062 M = InputsFixed[1] + SourceOffset;
9063 else if (M == InputsFixed[1] + SourceOffset)
9064 M = (InputsFixed[0] ^ 1) + SourceOffset;
9066 InputsFixed[1] = InputsFixed[0] ^ 1;
9069 // Point everything at the fixed inputs.
9070 for (int &M : HalfMask)
9071 if (M == IncomingInputs[0])
9072 M = InputsFixed[0] + SourceOffset;
9073 else if (M == IncomingInputs[1])
9074 M = InputsFixed[1] + SourceOffset;
9076 IncomingInputs[0] = InputsFixed[0] + SourceOffset;
9077 IncomingInputs[1] = InputsFixed[1] + SourceOffset;
9080 llvm_unreachable("Unhandled input size!");
9083 // Now hoist the DWord down to the right half.
9084 int FreeDWord = (PSHUFDMask[DestOffset / 2] == -1 ? 0 : 1) + DestOffset / 2;
9085 assert(PSHUFDMask[FreeDWord] == -1 && "DWord not free");
9086 PSHUFDMask[FreeDWord] = IncomingInputs[0] / 2;
9087 for (int &M : HalfMask)
9088 for (int Input : IncomingInputs)
9090 M = FreeDWord * 2 + Input % 2;
9092 moveInputsToRightHalf(HToLInputs, LToLInputs, PSHUFHMask, LoMask, HiMask,
9093 /*SourceOffset*/ 4, /*DestOffset*/ 0);
9094 moveInputsToRightHalf(LToHInputs, HToHInputs, PSHUFLMask, HiMask, LoMask,
9095 /*SourceOffset*/ 0, /*DestOffset*/ 4);
9097 // Now enact all the shuffles we've computed to move the inputs into their
9099 if (!isNoopShuffleMask(PSHUFLMask))
9100 V = DAG.getNode(X86ISD::PSHUFLW, DL, VT, V,
9101 getV4X86ShuffleImm8ForMask(PSHUFLMask, DL, DAG));
9102 if (!isNoopShuffleMask(PSHUFHMask))
9103 V = DAG.getNode(X86ISD::PSHUFHW, DL, VT, V,
9104 getV4X86ShuffleImm8ForMask(PSHUFHMask, DL, DAG));
9105 if (!isNoopShuffleMask(PSHUFDMask))
9108 DAG.getNode(X86ISD::PSHUFD, DL, PSHUFDVT, DAG.getBitcast(PSHUFDVT, V),
9109 getV4X86ShuffleImm8ForMask(PSHUFDMask, DL, DAG)));
9111 // At this point, each half should contain all its inputs, and we can then
9112 // just shuffle them into their final position.
9113 assert(std::count_if(LoMask.begin(), LoMask.end(),
9114 [](int M) { return M >= 4; }) == 0 &&
9115 "Failed to lift all the high half inputs to the low mask!");
9116 assert(std::count_if(HiMask.begin(), HiMask.end(),
9117 [](int M) { return M >= 0 && M < 4; }) == 0 &&
9118 "Failed to lift all the low half inputs to the high mask!");
9120 // Do a half shuffle for the low mask.
9121 if (!isNoopShuffleMask(LoMask))
9122 V = DAG.getNode(X86ISD::PSHUFLW, DL, VT, V,
9123 getV4X86ShuffleImm8ForMask(LoMask, DL, DAG));
9125 // Do a half shuffle with the high mask after shifting its values down.
9126 for (int &M : HiMask)
9129 if (!isNoopShuffleMask(HiMask))
9130 V = DAG.getNode(X86ISD::PSHUFHW, DL, VT, V,
9131 getV4X86ShuffleImm8ForMask(HiMask, DL, DAG));
9136 /// \brief Helper to form a PSHUFB-based shuffle+blend.
9137 static SDValue lowerVectorShuffleAsPSHUFB(SDLoc DL, MVT VT, SDValue V1,
9138 SDValue V2, ArrayRef<int> Mask,
9139 SelectionDAG &DAG, bool &V1InUse,
9141 SmallBitVector Zeroable = computeZeroableShuffleElements(Mask, V1, V2);
9147 int Size = Mask.size();
9148 int Scale = 16 / Size;
9149 for (int i = 0; i < 16; ++i) {
9150 if (Mask[i / Scale] == -1) {
9151 V1Mask[i] = V2Mask[i] = DAG.getUNDEF(MVT::i8);
9153 const int ZeroMask = 0x80;
9154 int V1Idx = Mask[i / Scale] < Size ? Mask[i / Scale] * Scale + i % Scale
9156 int V2Idx = Mask[i / Scale] < Size
9158 : (Mask[i / Scale] - Size) * Scale + i % Scale;
9159 if (Zeroable[i / Scale])
9160 V1Idx = V2Idx = ZeroMask;
9161 V1Mask[i] = DAG.getConstant(V1Idx, DL, MVT::i8);
9162 V2Mask[i] = DAG.getConstant(V2Idx, DL, MVT::i8);
9163 V1InUse |= (ZeroMask != V1Idx);
9164 V2InUse |= (ZeroMask != V2Idx);
9169 V1 = DAG.getNode(X86ISD::PSHUFB, DL, MVT::v16i8,
9170 DAG.getBitcast(MVT::v16i8, V1),
9171 DAG.getNode(ISD::BUILD_VECTOR, DL, MVT::v16i8, V1Mask));
9173 V2 = DAG.getNode(X86ISD::PSHUFB, DL, MVT::v16i8,
9174 DAG.getBitcast(MVT::v16i8, V2),
9175 DAG.getNode(ISD::BUILD_VECTOR, DL, MVT::v16i8, V2Mask));
9177 // If we need shuffled inputs from both, blend the two.
9179 if (V1InUse && V2InUse)
9180 V = DAG.getNode(ISD::OR, DL, MVT::v16i8, V1, V2);
9182 V = V1InUse ? V1 : V2;
9184 // Cast the result back to the correct type.
9185 return DAG.getBitcast(VT, V);
9188 /// \brief Generic lowering of 8-lane i16 shuffles.
9190 /// This handles both single-input shuffles and combined shuffle/blends with
9191 /// two inputs. The single input shuffles are immediately delegated to
9192 /// a dedicated lowering routine.
9194 /// The blends are lowered in one of three fundamental ways. If there are few
9195 /// enough inputs, it delegates to a basic UNPCK-based strategy. If the shuffle
9196 /// of the input is significantly cheaper when lowered as an interleaving of
9197 /// the two inputs, try to interleave them. Otherwise, blend the low and high
9198 /// halves of the inputs separately (making them have relatively few inputs)
9199 /// and then concatenate them.
9200 static SDValue lowerV8I16VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
9201 const X86Subtarget *Subtarget,
9202 SelectionDAG &DAG) {
9204 assert(Op.getSimpleValueType() == MVT::v8i16 && "Bad shuffle type!");
9205 assert(V1.getSimpleValueType() == MVT::v8i16 && "Bad operand type!");
9206 assert(V2.getSimpleValueType() == MVT::v8i16 && "Bad operand type!");
9207 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
9208 ArrayRef<int> OrigMask = SVOp->getMask();
9209 int MaskStorage[8] = {OrigMask[0], OrigMask[1], OrigMask[2], OrigMask[3],
9210 OrigMask[4], OrigMask[5], OrigMask[6], OrigMask[7]};
9211 MutableArrayRef<int> Mask(MaskStorage);
9213 assert(Mask.size() == 8 && "Unexpected mask size for v8 shuffle!");
9215 // Whenever we can lower this as a zext, that instruction is strictly faster
9216 // than any alternative.
9217 if (SDValue ZExt = lowerVectorShuffleAsZeroOrAnyExtend(
9218 DL, MVT::v8i16, V1, V2, OrigMask, Subtarget, DAG))
9221 auto isV1 = [](int M) { return M >= 0 && M < 8; };
9223 auto isV2 = [](int M) { return M >= 8; };
9225 int NumV2Inputs = std::count_if(Mask.begin(), Mask.end(), isV2);
9227 if (NumV2Inputs == 0) {
9228 // Check for being able to broadcast a single element.
9229 if (SDValue Broadcast = lowerVectorShuffleAsBroadcast(DL, MVT::v8i16, V1,
9230 Mask, Subtarget, DAG))
9233 // Try to use shift instructions.
9235 lowerVectorShuffleAsShift(DL, MVT::v8i16, V1, V1, Mask, DAG))
9238 // Use dedicated unpack instructions for masks that match their pattern.
9240 lowerVectorShuffleWithUNPCK(DL, MVT::v8i16, Mask, V1, V2, DAG))
9243 // Try to use byte rotation instructions.
9244 if (SDValue Rotate = lowerVectorShuffleAsByteRotate(DL, MVT::v8i16, V1, V1,
9245 Mask, Subtarget, DAG))
9248 return lowerV8I16GeneralSingleInputVectorShuffle(DL, MVT::v8i16, V1, Mask,
9252 assert(std::any_of(Mask.begin(), Mask.end(), isV1) &&
9253 "All single-input shuffles should be canonicalized to be V1-input "
9256 // Try to use shift instructions.
9258 lowerVectorShuffleAsShift(DL, MVT::v8i16, V1, V2, Mask, DAG))
9261 // See if we can use SSE4A Extraction / Insertion.
9262 if (Subtarget->hasSSE4A())
9263 if (SDValue V = lowerVectorShuffleWithSSE4A(DL, MVT::v8i16, V1, V2, Mask, DAG))
9266 // There are special ways we can lower some single-element blends.
9267 if (NumV2Inputs == 1)
9268 if (SDValue V = lowerVectorShuffleAsElementInsertion(DL, MVT::v8i16, V1, V2,
9269 Mask, Subtarget, DAG))
9272 // We have different paths for blend lowering, but they all must use the
9273 // *exact* same predicate.
9274 bool IsBlendSupported = Subtarget->hasSSE41();
9275 if (IsBlendSupported)
9276 if (SDValue Blend = lowerVectorShuffleAsBlend(DL, MVT::v8i16, V1, V2, Mask,
9280 if (SDValue Masked =
9281 lowerVectorShuffleAsBitMask(DL, MVT::v8i16, V1, V2, Mask, DAG))
9284 // Use dedicated unpack instructions for masks that match their pattern.
9286 lowerVectorShuffleWithUNPCK(DL, MVT::v8i16, Mask, V1, V2, DAG))
9289 // Try to use byte rotation instructions.
9290 if (SDValue Rotate = lowerVectorShuffleAsByteRotate(
9291 DL, MVT::v8i16, V1, V2, Mask, Subtarget, DAG))
9294 if (SDValue BitBlend =
9295 lowerVectorShuffleAsBitBlend(DL, MVT::v8i16, V1, V2, Mask, DAG))
9298 if (SDValue Unpack = lowerVectorShuffleAsPermuteAndUnpack(DL, MVT::v8i16, V1,
9302 // If we can't directly blend but can use PSHUFB, that will be better as it
9303 // can both shuffle and set up the inefficient blend.
9304 if (!IsBlendSupported && Subtarget->hasSSSE3()) {
9305 bool V1InUse, V2InUse;
9306 return lowerVectorShuffleAsPSHUFB(DL, MVT::v8i16, V1, V2, Mask, DAG,
9310 // We can always bit-blend if we have to so the fallback strategy is to
9311 // decompose into single-input permutes and blends.
9312 return lowerVectorShuffleAsDecomposedShuffleBlend(DL, MVT::v8i16, V1, V2,
9316 /// \brief Check whether a compaction lowering can be done by dropping even
9317 /// elements and compute how many times even elements must be dropped.
9319 /// This handles shuffles which take every Nth element where N is a power of
9320 /// two. Example shuffle masks:
9322 /// N = 1: 0, 2, 4, 6, 8, 10, 12, 14, 0, 2, 4, 6, 8, 10, 12, 14
9323 /// N = 1: 0, 2, 4, 6, 8, 10, 12, 14, 16, 18, 20, 22, 24, 26, 28, 30
9324 /// N = 2: 0, 4, 8, 12, 0, 4, 8, 12, 0, 4, 8, 12, 0, 4, 8, 12
9325 /// N = 2: 0, 4, 8, 12, 16, 20, 24, 28, 0, 4, 8, 12, 16, 20, 24, 28
9326 /// N = 3: 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8
9327 /// N = 3: 0, 8, 16, 24, 0, 8, 16, 24, 0, 8, 16, 24, 0, 8, 16, 24
9329 /// Any of these lanes can of course be undef.
9331 /// This routine only supports N <= 3.
9332 /// FIXME: Evaluate whether either AVX or AVX-512 have any opportunities here
9335 /// \returns N above, or the number of times even elements must be dropped if
9336 /// there is such a number. Otherwise returns zero.
9337 static int canLowerByDroppingEvenElements(ArrayRef<int> Mask) {
9338 // Figure out whether we're looping over two inputs or just one.
9339 bool IsSingleInput = isSingleInputShuffleMask(Mask);
9341 // The modulus for the shuffle vector entries is based on whether this is
9342 // a single input or not.
9343 int ShuffleModulus = Mask.size() * (IsSingleInput ? 1 : 2);
9344 assert(isPowerOf2_32((uint32_t)ShuffleModulus) &&
9345 "We should only be called with masks with a power-of-2 size!");
9347 uint64_t ModMask = (uint64_t)ShuffleModulus - 1;
9349 // We track whether the input is viable for all power-of-2 strides 2^1, 2^2,
9350 // and 2^3 simultaneously. This is because we may have ambiguity with
9351 // partially undef inputs.
9352 bool ViableForN[3] = {true, true, true};
9354 for (int i = 0, e = Mask.size(); i < e; ++i) {
9355 // Ignore undef lanes, we'll optimistically collapse them to the pattern we
9360 bool IsAnyViable = false;
9361 for (unsigned j = 0; j != array_lengthof(ViableForN); ++j)
9362 if (ViableForN[j]) {
9365 // The shuffle mask must be equal to (i * 2^N) % M.
9366 if ((uint64_t)Mask[i] == (((uint64_t)i << N) & ModMask))
9369 ViableForN[j] = false;
9371 // Early exit if we exhaust the possible powers of two.
9376 for (unsigned j = 0; j != array_lengthof(ViableForN); ++j)
9380 // Return 0 as there is no viable power of two.
9384 /// \brief Generic lowering of v16i8 shuffles.
9386 /// This is a hybrid strategy to lower v16i8 vectors. It first attempts to
9387 /// detect any complexity reducing interleaving. If that doesn't help, it uses
9388 /// UNPCK to spread the i8 elements across two i16-element vectors, and uses
9389 /// the existing lowering for v8i16 blends on each half, finally PACK-ing them
9391 static SDValue lowerV16I8VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
9392 const X86Subtarget *Subtarget,
9393 SelectionDAG &DAG) {
9395 assert(Op.getSimpleValueType() == MVT::v16i8 && "Bad shuffle type!");
9396 assert(V1.getSimpleValueType() == MVT::v16i8 && "Bad operand type!");
9397 assert(V2.getSimpleValueType() == MVT::v16i8 && "Bad operand type!");
9398 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
9399 ArrayRef<int> Mask = SVOp->getMask();
9400 assert(Mask.size() == 16 && "Unexpected mask size for v16 shuffle!");
9402 // Try to use shift instructions.
9404 lowerVectorShuffleAsShift(DL, MVT::v16i8, V1, V2, Mask, DAG))
9407 // Try to use byte rotation instructions.
9408 if (SDValue Rotate = lowerVectorShuffleAsByteRotate(
9409 DL, MVT::v16i8, V1, V2, Mask, Subtarget, DAG))
9412 // Try to use a zext lowering.
9413 if (SDValue ZExt = lowerVectorShuffleAsZeroOrAnyExtend(
9414 DL, MVT::v16i8, V1, V2, Mask, Subtarget, DAG))
9417 // See if we can use SSE4A Extraction / Insertion.
9418 if (Subtarget->hasSSE4A())
9419 if (SDValue V = lowerVectorShuffleWithSSE4A(DL, MVT::v16i8, V1, V2, Mask, DAG))
9423 std::count_if(Mask.begin(), Mask.end(), [](int M) { return M >= 16; });
9425 // For single-input shuffles, there are some nicer lowering tricks we can use.
9426 if (NumV2Elements == 0) {
9427 // Check for being able to broadcast a single element.
9428 if (SDValue Broadcast = lowerVectorShuffleAsBroadcast(DL, MVT::v16i8, V1,
9429 Mask, Subtarget, DAG))
9432 // Check whether we can widen this to an i16 shuffle by duplicating bytes.
9433 // Notably, this handles splat and partial-splat shuffles more efficiently.
9434 // However, it only makes sense if the pre-duplication shuffle simplifies
9435 // things significantly. Currently, this means we need to be able to
9436 // express the pre-duplication shuffle as an i16 shuffle.
9438 // FIXME: We should check for other patterns which can be widened into an
9439 // i16 shuffle as well.
9440 auto canWidenViaDuplication = [](ArrayRef<int> Mask) {
9441 for (int i = 0; i < 16; i += 2)
9442 if (Mask[i] != -1 && Mask[i + 1] != -1 && Mask[i] != Mask[i + 1])
9447 auto tryToWidenViaDuplication = [&]() -> SDValue {
9448 if (!canWidenViaDuplication(Mask))
9450 SmallVector<int, 4> LoInputs;
9451 std::copy_if(Mask.begin(), Mask.end(), std::back_inserter(LoInputs),
9452 [](int M) { return M >= 0 && M < 8; });
9453 std::sort(LoInputs.begin(), LoInputs.end());
9454 LoInputs.erase(std::unique(LoInputs.begin(), LoInputs.end()),
9456 SmallVector<int, 4> HiInputs;
9457 std::copy_if(Mask.begin(), Mask.end(), std::back_inserter(HiInputs),
9458 [](int M) { return M >= 8; });
9459 std::sort(HiInputs.begin(), HiInputs.end());
9460 HiInputs.erase(std::unique(HiInputs.begin(), HiInputs.end()),
9463 bool TargetLo = LoInputs.size() >= HiInputs.size();
9464 ArrayRef<int> InPlaceInputs = TargetLo ? LoInputs : HiInputs;
9465 ArrayRef<int> MovingInputs = TargetLo ? HiInputs : LoInputs;
9467 int PreDupI16Shuffle[] = {-1, -1, -1, -1, -1, -1, -1, -1};
9468 SmallDenseMap<int, int, 8> LaneMap;
9469 for (int I : InPlaceInputs) {
9470 PreDupI16Shuffle[I/2] = I/2;
9473 int j = TargetLo ? 0 : 4, je = j + 4;
9474 for (int i = 0, ie = MovingInputs.size(); i < ie; ++i) {
9475 // Check if j is already a shuffle of this input. This happens when
9476 // there are two adjacent bytes after we move the low one.
9477 if (PreDupI16Shuffle[j] != MovingInputs[i] / 2) {
9478 // If we haven't yet mapped the input, search for a slot into which
9480 while (j < je && PreDupI16Shuffle[j] != -1)
9484 // We can't place the inputs into a single half with a simple i16 shuffle, so bail.
9487 // Map this input with the i16 shuffle.
9488 PreDupI16Shuffle[j] = MovingInputs[i] / 2;
9491 // Update the lane map based on the mapping we ended up with.
9492 LaneMap[MovingInputs[i]] = 2 * j + MovingInputs[i] % 2;
9494 V1 = DAG.getBitcast(
9496 DAG.getVectorShuffle(MVT::v8i16, DL, DAG.getBitcast(MVT::v8i16, V1),
9497 DAG.getUNDEF(MVT::v8i16), PreDupI16Shuffle));
9499 // Unpack the bytes to form the i16s that will be shuffled into place.
9500 V1 = DAG.getNode(TargetLo ? X86ISD::UNPCKL : X86ISD::UNPCKH, DL,
9501 MVT::v16i8, V1, V1);
9503 int PostDupI16Shuffle[8] = {-1, -1, -1, -1, -1, -1, -1, -1};
9504 for (int i = 0; i < 16; ++i)
9505 if (Mask[i] != -1) {
9506 int MappedMask = LaneMap[Mask[i]] - (TargetLo ? 0 : 8);
9507 assert(MappedMask < 8 && "Invalid v8 shuffle mask!");
9508 if (PostDupI16Shuffle[i / 2] == -1)
9509 PostDupI16Shuffle[i / 2] = MappedMask;
9511 assert(PostDupI16Shuffle[i / 2] == MappedMask &&
9512 "Conflicting entrties in the original shuffle!");
9514 return DAG.getBitcast(
9516 DAG.getVectorShuffle(MVT::v8i16, DL, DAG.getBitcast(MVT::v8i16, V1),
9517 DAG.getUNDEF(MVT::v8i16), PostDupI16Shuffle));
9519 if (SDValue V = tryToWidenViaDuplication())
9523 if (SDValue Masked =
9524 lowerVectorShuffleAsBitMask(DL, MVT::v16i8, V1, V2, Mask, DAG))
9527 // Use dedicated unpack instructions for masks that match their pattern.
9529 lowerVectorShuffleWithUNPCK(DL, MVT::v16i8, Mask, V1, V2, DAG))
9532 // Check for SSSE3 which lets us lower all v16i8 shuffles much more directly
9533 // with PSHUFB. It is important to do this before we attempt to generate any
9534 // blends but after all of the single-input lowerings. If the single input
9535 // lowerings can find an instruction sequence that is faster than a PSHUFB, we
9536 // want to preserve that and we can DAG combine any longer sequences into
9537 // a PSHUFB in the end. But once we start blending from multiple inputs,
9538 // the complexity of DAG combining bad patterns back into PSHUFB is too high,
9539 // and there are *very* few patterns that would actually be faster than the
9540 // PSHUFB approach because of its ability to zero lanes.
9542 // FIXME: The only exceptions to the above are blends which are exact
9543 // interleavings with direct instructions supporting them. We currently don't
9544 // handle those well here.
9545 if (Subtarget->hasSSSE3()) {
9546 bool V1InUse = false;
9547 bool V2InUse = false;
9549 SDValue PSHUFB = lowerVectorShuffleAsPSHUFB(DL, MVT::v16i8, V1, V2, Mask,
9550 DAG, V1InUse, V2InUse);
9552 // If both V1 and V2 are in use and we can use a direct blend or an unpack,
9553 // do so. This avoids using them to handle blends-with-zero which is
9554 // important as a single pshufb is significantly faster for that.
9555 if (V1InUse && V2InUse) {
9556 if (Subtarget->hasSSE41())
9557 if (SDValue Blend = lowerVectorShuffleAsBlend(DL, MVT::v16i8, V1, V2,
9558 Mask, Subtarget, DAG))
9561 // We can use an unpack to do the blending rather than an or in some
9562 // cases. Even though the or may be (very minorly) more efficient, we
9563 // preference this lowering because there are common cases where part of
9564 // the complexity of the shuffles goes away when we do the final blend as
9566 // FIXME: It might be worth trying to detect if the unpack-feeding
9567 // shuffles will both be pshufb, in which case we shouldn't bother with
9569 if (SDValue Unpack = lowerVectorShuffleAsPermuteAndUnpack(
9570 DL, MVT::v16i8, V1, V2, Mask, DAG))
9577 // There are special ways we can lower some single-element blends.
9578 if (NumV2Elements == 1)
9579 if (SDValue V = lowerVectorShuffleAsElementInsertion(DL, MVT::v16i8, V1, V2,
9580 Mask, Subtarget, DAG))
9583 if (SDValue BitBlend =
9584 lowerVectorShuffleAsBitBlend(DL, MVT::v16i8, V1, V2, Mask, DAG))
9587 // Check whether a compaction lowering can be done. This handles shuffles
9588 // which take every Nth element for some even N. See the helper function for
9591 // We special case these as they can be particularly efficiently handled with
9592 // the PACKUSB instruction on x86 and they show up in common patterns of
9593 // rearranging bytes to truncate wide elements.
9594 if (int NumEvenDrops = canLowerByDroppingEvenElements(Mask)) {
9595 // NumEvenDrops is the power of two stride of the elements. Another way of
9596 // thinking about it is that we need to drop the even elements this many
9597 // times to get the original input.
9598 bool IsSingleInput = isSingleInputShuffleMask(Mask);
9600 // First we need to zero all the dropped bytes.
9601 assert(NumEvenDrops <= 3 &&
9602 "No support for dropping even elements more than 3 times.");
9603 // We use the mask type to pick which bytes are preserved based on how many
9604 // elements are dropped.
9605 MVT MaskVTs[] = { MVT::v8i16, MVT::v4i32, MVT::v2i64 };
9606 SDValue ByteClearMask = DAG.getBitcast(
9607 MVT::v16i8, DAG.getConstant(0xFF, DL, MaskVTs[NumEvenDrops - 1]));
9608 V1 = DAG.getNode(ISD::AND, DL, MVT::v16i8, V1, ByteClearMask);
9610 V2 = DAG.getNode(ISD::AND, DL, MVT::v16i8, V2, ByteClearMask);
9612 // Now pack things back together.
9613 V1 = DAG.getBitcast(MVT::v8i16, V1);
9614 V2 = IsSingleInput ? V1 : DAG.getBitcast(MVT::v8i16, V2);
9615 SDValue Result = DAG.getNode(X86ISD::PACKUS, DL, MVT::v16i8, V1, V2);
9616 for (int i = 1; i < NumEvenDrops; ++i) {
9617 Result = DAG.getBitcast(MVT::v8i16, Result);
9618 Result = DAG.getNode(X86ISD::PACKUS, DL, MVT::v16i8, Result, Result);
9624 // Handle multi-input cases by blending single-input shuffles.
9625 if (NumV2Elements > 0)
9626 return lowerVectorShuffleAsDecomposedShuffleBlend(DL, MVT::v16i8, V1, V2,
9629 // The fallback path for single-input shuffles widens this into two v8i16
9630 // vectors with unpacks, shuffles those, and then pulls them back together
9634 int LoBlendMask[8] = {-1, -1, -1, -1, -1, -1, -1, -1};
9635 int HiBlendMask[8] = {-1, -1, -1, -1, -1, -1, -1, -1};
9636 for (int i = 0; i < 16; ++i)
9638 (i < 8 ? LoBlendMask[i] : HiBlendMask[i % 8]) = Mask[i];
9640 SDValue Zero = getZeroVector(MVT::v8i16, Subtarget, DAG, DL);
9642 SDValue VLoHalf, VHiHalf;
9643 // Check if any of the odd lanes in the v16i8 are used. If not, we can mask
9644 // them out and avoid using UNPCK{L,H} to extract the elements of V as
9646 if (std::none_of(std::begin(LoBlendMask), std::end(LoBlendMask),
9647 [](int M) { return M >= 0 && M % 2 == 1; }) &&
9648 std::none_of(std::begin(HiBlendMask), std::end(HiBlendMask),
9649 [](int M) { return M >= 0 && M % 2 == 1; })) {
9650 // Use a mask to drop the high bytes.
9651 VLoHalf = DAG.getBitcast(MVT::v8i16, V);
9652 VLoHalf = DAG.getNode(ISD::AND, DL, MVT::v8i16, VLoHalf,
9653 DAG.getConstant(0x00FF, DL, MVT::v8i16));
9655 // This will be a single vector shuffle instead of a blend so nuke VHiHalf.
9656 VHiHalf = DAG.getUNDEF(MVT::v8i16);
9658 // Squash the masks to point directly into VLoHalf.
9659 for (int &M : LoBlendMask)
9662 for (int &M : HiBlendMask)
9666 // Otherwise just unpack the low half of V into VLoHalf and the high half into
9667 // VHiHalf so that we can blend them as i16s.
9668 VLoHalf = DAG.getBitcast(
9669 MVT::v8i16, DAG.getNode(X86ISD::UNPCKL, DL, MVT::v16i8, V, Zero));
9670 VHiHalf = DAG.getBitcast(
9671 MVT::v8i16, DAG.getNode(X86ISD::UNPCKH, DL, MVT::v16i8, V, Zero));
9674 SDValue LoV = DAG.getVectorShuffle(MVT::v8i16, DL, VLoHalf, VHiHalf, LoBlendMask);
9675 SDValue HiV = DAG.getVectorShuffle(MVT::v8i16, DL, VLoHalf, VHiHalf, HiBlendMask);
9677 return DAG.getNode(X86ISD::PACKUS, DL, MVT::v16i8, LoV, HiV);
9680 /// \brief Dispatching routine to lower various 128-bit x86 vector shuffles.
9682 /// This routine breaks down the specific type of 128-bit shuffle and
9683 /// dispatches to the lowering routines accordingly.
9684 static SDValue lower128BitVectorShuffle(SDValue Op, SDValue V1, SDValue V2,
9685 MVT VT, const X86Subtarget *Subtarget,
9686 SelectionDAG &DAG) {
9687 switch (VT.SimpleTy) {
9689 return lowerV2I64VectorShuffle(Op, V1, V2, Subtarget, DAG);
9691 return lowerV2F64VectorShuffle(Op, V1, V2, Subtarget, DAG);
9693 return lowerV4I32VectorShuffle(Op, V1, V2, Subtarget, DAG);
9695 return lowerV4F32VectorShuffle(Op, V1, V2, Subtarget, DAG);
9697 return lowerV8I16VectorShuffle(Op, V1, V2, Subtarget, DAG);
9699 return lowerV16I8VectorShuffle(Op, V1, V2, Subtarget, DAG);
9702 llvm_unreachable("Unimplemented!");
9706 /// \brief Helper function to test whether a shuffle mask could be
9707 /// simplified by widening the elements being shuffled.
9709 /// Appends the mask for wider elements in WidenedMask if valid. Otherwise
9710 /// leaves it in an unspecified state.
9712 /// NOTE: This must handle normal vector shuffle masks and *target* vector
9713 /// shuffle masks. The latter have the special property of a '-2' representing
9714 /// a zero-ed lane of a vector.
9715 static bool canWidenShuffleElements(ArrayRef<int> Mask,
9716 SmallVectorImpl<int> &WidenedMask) {
9717 for (int i = 0, Size = Mask.size(); i < Size; i += 2) {
9718 // If both elements are undef, its trivial.
9719 if (Mask[i] == SM_SentinelUndef && Mask[i + 1] == SM_SentinelUndef) {
9720 WidenedMask.push_back(SM_SentinelUndef);
9724 // Check for an undef mask and a mask value properly aligned to fit with
9725 // a pair of values. If we find such a case, use the non-undef mask's value.
9726 if (Mask[i] == SM_SentinelUndef && Mask[i + 1] >= 0 && Mask[i + 1] % 2 == 1) {
9727 WidenedMask.push_back(Mask[i + 1] / 2);
9730 if (Mask[i + 1] == SM_SentinelUndef && Mask[i] >= 0 && Mask[i] % 2 == 0) {
9731 WidenedMask.push_back(Mask[i] / 2);
9735 // When zeroing, we need to spread the zeroing across both lanes to widen.
9736 if (Mask[i] == SM_SentinelZero || Mask[i + 1] == SM_SentinelZero) {
9737 if ((Mask[i] == SM_SentinelZero || Mask[i] == SM_SentinelUndef) &&
9738 (Mask[i + 1] == SM_SentinelZero || Mask[i + 1] == SM_SentinelUndef)) {
9739 WidenedMask.push_back(SM_SentinelZero);
9745 // Finally check if the two mask values are adjacent and aligned with
9747 if (Mask[i] != SM_SentinelUndef && Mask[i] % 2 == 0 && Mask[i] + 1 == Mask[i + 1]) {
9748 WidenedMask.push_back(Mask[i] / 2);
9752 // Otherwise we can't safely widen the elements used in this shuffle.
9755 assert(WidenedMask.size() == Mask.size() / 2 &&
9756 "Incorrect size of mask after widening the elements!");
9761 /// \brief Generic routine to split vector shuffle into half-sized shuffles.
9763 /// This routine just extracts two subvectors, shuffles them independently, and
9764 /// then concatenates them back together. This should work effectively with all
9765 /// AVX vector shuffle types.
9766 static SDValue splitAndLowerVectorShuffle(SDLoc DL, MVT VT, SDValue V1,
9767 SDValue V2, ArrayRef<int> Mask,
9768 SelectionDAG &DAG) {
9769 assert(VT.getSizeInBits() >= 256 &&
9770 "Only for 256-bit or wider vector shuffles!");
9771 assert(V1.getSimpleValueType() == VT && "Bad operand type!");
9772 assert(V2.getSimpleValueType() == VT && "Bad operand type!");
9774 ArrayRef<int> LoMask = Mask.slice(0, Mask.size() / 2);
9775 ArrayRef<int> HiMask = Mask.slice(Mask.size() / 2);
9777 int NumElements = VT.getVectorNumElements();
9778 int SplitNumElements = NumElements / 2;
9779 MVT ScalarVT = VT.getVectorElementType();
9780 MVT SplitVT = MVT::getVectorVT(ScalarVT, NumElements / 2);
9782 // Rather than splitting build-vectors, just build two narrower build
9783 // vectors. This helps shuffling with splats and zeros.
9784 auto SplitVector = [&](SDValue V) {
9785 while (V.getOpcode() == ISD::BITCAST)
9786 V = V->getOperand(0);
9788 MVT OrigVT = V.getSimpleValueType();
9789 int OrigNumElements = OrigVT.getVectorNumElements();
9790 int OrigSplitNumElements = OrigNumElements / 2;
9791 MVT OrigScalarVT = OrigVT.getVectorElementType();
9792 MVT OrigSplitVT = MVT::getVectorVT(OrigScalarVT, OrigNumElements / 2);
9796 auto *BV = dyn_cast<BuildVectorSDNode>(V);
9798 LoV = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, OrigSplitVT, V,
9799 DAG.getIntPtrConstant(0, DL));
9800 HiV = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, OrigSplitVT, V,
9801 DAG.getIntPtrConstant(OrigSplitNumElements, DL));
9804 SmallVector<SDValue, 16> LoOps, HiOps;
9805 for (int i = 0; i < OrigSplitNumElements; ++i) {
9806 LoOps.push_back(BV->getOperand(i));
9807 HiOps.push_back(BV->getOperand(i + OrigSplitNumElements));
9809 LoV = DAG.getNode(ISD::BUILD_VECTOR, DL, OrigSplitVT, LoOps);
9810 HiV = DAG.getNode(ISD::BUILD_VECTOR, DL, OrigSplitVT, HiOps);
9812 return std::make_pair(DAG.getBitcast(SplitVT, LoV),
9813 DAG.getBitcast(SplitVT, HiV));
9816 SDValue LoV1, HiV1, LoV2, HiV2;
9817 std::tie(LoV1, HiV1) = SplitVector(V1);
9818 std::tie(LoV2, HiV2) = SplitVector(V2);
9820 // Now create two 4-way blends of these half-width vectors.
9821 auto HalfBlend = [&](ArrayRef<int> HalfMask) {
9822 bool UseLoV1 = false, UseHiV1 = false, UseLoV2 = false, UseHiV2 = false;
9823 SmallVector<int, 32> V1BlendMask, V2BlendMask, BlendMask;
9824 for (int i = 0; i < SplitNumElements; ++i) {
9825 int M = HalfMask[i];
9826 if (M >= NumElements) {
9827 if (M >= NumElements + SplitNumElements)
9831 V2BlendMask.push_back(M - NumElements);
9832 V1BlendMask.push_back(-1);
9833 BlendMask.push_back(SplitNumElements + i);
9834 } else if (M >= 0) {
9835 if (M >= SplitNumElements)
9839 V2BlendMask.push_back(-1);
9840 V1BlendMask.push_back(M);
9841 BlendMask.push_back(i);
9843 V2BlendMask.push_back(-1);
9844 V1BlendMask.push_back(-1);
9845 BlendMask.push_back(-1);
9849 // Because the lowering happens after all combining takes place, we need to
9850 // manually combine these blend masks as much as possible so that we create
9851 // a minimal number of high-level vector shuffle nodes.
9853 // First try just blending the halves of V1 or V2.
9854 if (!UseLoV1 && !UseHiV1 && !UseLoV2 && !UseHiV2)
9855 return DAG.getUNDEF(SplitVT);
9856 if (!UseLoV2 && !UseHiV2)
9857 return DAG.getVectorShuffle(SplitVT, DL, LoV1, HiV1, V1BlendMask);
9858 if (!UseLoV1 && !UseHiV1)
9859 return DAG.getVectorShuffle(SplitVT, DL, LoV2, HiV2, V2BlendMask);
9861 SDValue V1Blend, V2Blend;
9862 if (UseLoV1 && UseHiV1) {
9864 DAG.getVectorShuffle(SplitVT, DL, LoV1, HiV1, V1BlendMask);
9866 // We only use half of V1 so map the usage down into the final blend mask.
9867 V1Blend = UseLoV1 ? LoV1 : HiV1;
9868 for (int i = 0; i < SplitNumElements; ++i)
9869 if (BlendMask[i] >= 0 && BlendMask[i] < SplitNumElements)
9870 BlendMask[i] = V1BlendMask[i] - (UseLoV1 ? 0 : SplitNumElements);
9872 if (UseLoV2 && UseHiV2) {
9874 DAG.getVectorShuffle(SplitVT, DL, LoV2, HiV2, V2BlendMask);
9876 // We only use half of V2 so map the usage down into the final blend mask.
9877 V2Blend = UseLoV2 ? LoV2 : HiV2;
9878 for (int i = 0; i < SplitNumElements; ++i)
9879 if (BlendMask[i] >= SplitNumElements)
9880 BlendMask[i] = V2BlendMask[i] + (UseLoV2 ? SplitNumElements : 0);
9882 return DAG.getVectorShuffle(SplitVT, DL, V1Blend, V2Blend, BlendMask);
9884 SDValue Lo = HalfBlend(LoMask);
9885 SDValue Hi = HalfBlend(HiMask);
9886 return DAG.getNode(ISD::CONCAT_VECTORS, DL, VT, Lo, Hi);
9889 /// \brief Either split a vector in halves or decompose the shuffles and the
9892 /// This is provided as a good fallback for many lowerings of non-single-input
9893 /// shuffles with more than one 128-bit lane. In those cases, we want to select
9894 /// between splitting the shuffle into 128-bit components and stitching those
9895 /// back together vs. extracting the single-input shuffles and blending those
9897 static SDValue lowerVectorShuffleAsSplitOrBlend(SDLoc DL, MVT VT, SDValue V1,
9898 SDValue V2, ArrayRef<int> Mask,
9899 SelectionDAG &DAG) {
9900 assert(!isSingleInputShuffleMask(Mask) && "This routine must not be used to "
9901 "lower single-input shuffles as it "
9902 "could then recurse on itself.");
9903 int Size = Mask.size();
9905 // If this can be modeled as a broadcast of two elements followed by a blend,
9906 // prefer that lowering. This is especially important because broadcasts can
9907 // often fold with memory operands.
9908 auto DoBothBroadcast = [&] {
9909 int V1BroadcastIdx = -1, V2BroadcastIdx = -1;
9912 if (V2BroadcastIdx == -1)
9913 V2BroadcastIdx = M - Size;
9914 else if (M - Size != V2BroadcastIdx)
9916 } else if (M >= 0) {
9917 if (V1BroadcastIdx == -1)
9919 else if (M != V1BroadcastIdx)
9924 if (DoBothBroadcast())
9925 return lowerVectorShuffleAsDecomposedShuffleBlend(DL, VT, V1, V2, Mask,
9928 // If the inputs all stem from a single 128-bit lane of each input, then we
9929 // split them rather than blending because the split will decompose to
9930 // unusually few instructions.
9931 int LaneCount = VT.getSizeInBits() / 128;
9932 int LaneSize = Size / LaneCount;
9933 SmallBitVector LaneInputs[2];
9934 LaneInputs[0].resize(LaneCount, false);
9935 LaneInputs[1].resize(LaneCount, false);
9936 for (int i = 0; i < Size; ++i)
9938 LaneInputs[Mask[i] / Size][(Mask[i] % Size) / LaneSize] = true;
9939 if (LaneInputs[0].count() <= 1 && LaneInputs[1].count() <= 1)
9940 return splitAndLowerVectorShuffle(DL, VT, V1, V2, Mask, DAG);
9942 // Otherwise, just fall back to decomposed shuffles and a blend. This requires
9943 // that the decomposed single-input shuffles don't end up here.
9944 return lowerVectorShuffleAsDecomposedShuffleBlend(DL, VT, V1, V2, Mask, DAG);
9947 /// \brief Lower a vector shuffle crossing multiple 128-bit lanes as
9948 /// a permutation and blend of those lanes.
9950 /// This essentially blends the out-of-lane inputs to each lane into the lane
9951 /// from a permuted copy of the vector. This lowering strategy results in four
9952 /// instructions in the worst case for a single-input cross lane shuffle which
9953 /// is lower than any other fully general cross-lane shuffle strategy I'm aware
9954 /// of. Special cases for each particular shuffle pattern should be handled
9955 /// prior to trying this lowering.
9956 static SDValue lowerVectorShuffleAsLanePermuteAndBlend(SDLoc DL, MVT VT,
9957 SDValue V1, SDValue V2,
9959 SelectionDAG &DAG) {
9960 // FIXME: This should probably be generalized for 512-bit vectors as well.
9961 assert(VT.is256BitVector() && "Only for 256-bit vector shuffles!");
9962 int LaneSize = Mask.size() / 2;
9964 // If there are only inputs from one 128-bit lane, splitting will in fact be
9965 // less expensive. The flags track whether the given lane contains an element
9966 // that crosses to another lane.
9967 bool LaneCrossing[2] = {false, false};
9968 for (int i = 0, Size = Mask.size(); i < Size; ++i)
9969 if (Mask[i] >= 0 && (Mask[i] % Size) / LaneSize != i / LaneSize)
9970 LaneCrossing[(Mask[i] % Size) / LaneSize] = true;
9971 if (!LaneCrossing[0] || !LaneCrossing[1])
9972 return splitAndLowerVectorShuffle(DL, VT, V1, V2, Mask, DAG);
9974 if (isSingleInputShuffleMask(Mask)) {
9975 SmallVector<int, 32> FlippedBlendMask;
9976 for (int i = 0, Size = Mask.size(); i < Size; ++i)
9977 FlippedBlendMask.push_back(
9978 Mask[i] < 0 ? -1 : (((Mask[i] % Size) / LaneSize == i / LaneSize)
9980 : Mask[i] % LaneSize +
9981 (i / LaneSize) * LaneSize + Size));
9983 // Flip the vector, and blend the results which should now be in-lane. The
9984 // VPERM2X128 mask uses the low 2 bits for the low source and bits 4 and
9985 // 5 for the high source. The value 3 selects the high half of source 2 and
9986 // the value 2 selects the low half of source 2. We only use source 2 to
9987 // allow folding it into a memory operand.
9988 unsigned PERMMask = 3 | 2 << 4;
9989 SDValue Flipped = DAG.getNode(X86ISD::VPERM2X128, DL, VT, DAG.getUNDEF(VT),
9990 V1, DAG.getConstant(PERMMask, DL, MVT::i8));
9991 return DAG.getVectorShuffle(VT, DL, V1, Flipped, FlippedBlendMask);
9994 // This now reduces to two single-input shuffles of V1 and V2 which at worst
9995 // will be handled by the above logic and a blend of the results, much like
9996 // other patterns in AVX.
9997 return lowerVectorShuffleAsDecomposedShuffleBlend(DL, VT, V1, V2, Mask, DAG);
10000 /// \brief Handle lowering 2-lane 128-bit shuffles.
10001 static SDValue lowerV2X128VectorShuffle(SDLoc DL, MVT VT, SDValue V1,
10002 SDValue V2, ArrayRef<int> Mask,
10003 const X86Subtarget *Subtarget,
10004 SelectionDAG &DAG) {
10005 // TODO: If minimizing size and one of the inputs is a zero vector and the
10006 // the zero vector has only one use, we could use a VPERM2X128 to save the
10007 // instruction bytes needed to explicitly generate the zero vector.
10009 // Blends are faster and handle all the non-lane-crossing cases.
10010 if (SDValue Blend = lowerVectorShuffleAsBlend(DL, VT, V1, V2, Mask,
10014 bool IsV1Zero = ISD::isBuildVectorAllZeros(V1.getNode());
10015 bool IsV2Zero = ISD::isBuildVectorAllZeros(V2.getNode());
10017 // If either input operand is a zero vector, use VPERM2X128 because its mask
10018 // allows us to replace the zero input with an implicit zero.
10019 if (!IsV1Zero && !IsV2Zero) {
10020 // Check for patterns which can be matched with a single insert of a 128-bit
10022 bool OnlyUsesV1 = isShuffleEquivalent(V1, V2, Mask, {0, 1, 0, 1});
10023 if (OnlyUsesV1 || isShuffleEquivalent(V1, V2, Mask, {0, 1, 4, 5})) {
10024 MVT SubVT = MVT::getVectorVT(VT.getVectorElementType(),
10025 VT.getVectorNumElements() / 2);
10026 SDValue LoV = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, SubVT, V1,
10027 DAG.getIntPtrConstant(0, DL));
10028 SDValue HiV = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, SubVT,
10029 OnlyUsesV1 ? V1 : V2,
10030 DAG.getIntPtrConstant(0, DL));
10031 return DAG.getNode(ISD::CONCAT_VECTORS, DL, VT, LoV, HiV);
10035 // Otherwise form a 128-bit permutation. After accounting for undefs,
10036 // convert the 64-bit shuffle mask selection values into 128-bit
10037 // selection bits by dividing the indexes by 2 and shifting into positions
10038 // defined by a vperm2*128 instruction's immediate control byte.
10040 // The immediate permute control byte looks like this:
10041 // [1:0] - select 128 bits from sources for low half of destination
10043 // [3] - zero low half of destination
10044 // [5:4] - select 128 bits from sources for high half of destination
10046 // [7] - zero high half of destination
10048 int MaskLO = Mask[0];
10049 if (MaskLO == SM_SentinelUndef)
10050 MaskLO = Mask[1] == SM_SentinelUndef ? 0 : Mask[1];
10052 int MaskHI = Mask[2];
10053 if (MaskHI == SM_SentinelUndef)
10054 MaskHI = Mask[3] == SM_SentinelUndef ? 0 : Mask[3];
10056 unsigned PermMask = MaskLO / 2 | (MaskHI / 2) << 4;
10058 // If either input is a zero vector, replace it with an undef input.
10059 // Shuffle mask values < 4 are selecting elements of V1.
10060 // Shuffle mask values >= 4 are selecting elements of V2.
10061 // Adjust each half of the permute mask by clearing the half that was
10062 // selecting the zero vector and setting the zero mask bit.
10064 V1 = DAG.getUNDEF(VT);
10066 PermMask = (PermMask & 0xf0) | 0x08;
10068 PermMask = (PermMask & 0x0f) | 0x80;
10071 V2 = DAG.getUNDEF(VT);
10073 PermMask = (PermMask & 0xf0) | 0x08;
10075 PermMask = (PermMask & 0x0f) | 0x80;
10078 return DAG.getNode(X86ISD::VPERM2X128, DL, VT, V1, V2,
10079 DAG.getConstant(PermMask, DL, MVT::i8));
10082 /// \brief Lower a vector shuffle by first fixing the 128-bit lanes and then
10083 /// shuffling each lane.
10085 /// This will only succeed when the result of fixing the 128-bit lanes results
10086 /// in a single-input non-lane-crossing shuffle with a repeating shuffle mask in
10087 /// each 128-bit lanes. This handles many cases where we can quickly blend away
10088 /// the lane crosses early and then use simpler shuffles within each lane.
10090 /// FIXME: It might be worthwhile at some point to support this without
10091 /// requiring the 128-bit lane-relative shuffles to be repeating, but currently
10092 /// in x86 only floating point has interesting non-repeating shuffles, and even
10093 /// those are still *marginally* more expensive.
10094 static SDValue lowerVectorShuffleByMerging128BitLanes(
10095 SDLoc DL, MVT VT, SDValue V1, SDValue V2, ArrayRef<int> Mask,
10096 const X86Subtarget *Subtarget, SelectionDAG &DAG) {
10097 assert(!isSingleInputShuffleMask(Mask) &&
10098 "This is only useful with multiple inputs.");
10100 int Size = Mask.size();
10101 int LaneSize = 128 / VT.getScalarSizeInBits();
10102 int NumLanes = Size / LaneSize;
10103 assert(NumLanes > 1 && "Only handles 256-bit and wider shuffles.");
10105 // See if we can build a hypothetical 128-bit lane-fixing shuffle mask. Also
10106 // check whether the in-128-bit lane shuffles share a repeating pattern.
10107 SmallVector<int, 4> Lanes;
10108 Lanes.resize(NumLanes, -1);
10109 SmallVector<int, 4> InLaneMask;
10110 InLaneMask.resize(LaneSize, -1);
10111 for (int i = 0; i < Size; ++i) {
10115 int j = i / LaneSize;
10117 if (Lanes[j] < 0) {
10118 // First entry we've seen for this lane.
10119 Lanes[j] = Mask[i] / LaneSize;
10120 } else if (Lanes[j] != Mask[i] / LaneSize) {
10121 // This doesn't match the lane selected previously!
10125 // Check that within each lane we have a consistent shuffle mask.
10126 int k = i % LaneSize;
10127 if (InLaneMask[k] < 0) {
10128 InLaneMask[k] = Mask[i] % LaneSize;
10129 } else if (InLaneMask[k] != Mask[i] % LaneSize) {
10130 // This doesn't fit a repeating in-lane mask.
10135 // First shuffle the lanes into place.
10136 MVT LaneVT = MVT::getVectorVT(VT.isFloatingPoint() ? MVT::f64 : MVT::i64,
10137 VT.getSizeInBits() / 64);
10138 SmallVector<int, 8> LaneMask;
10139 LaneMask.resize(NumLanes * 2, -1);
10140 for (int i = 0; i < NumLanes; ++i)
10141 if (Lanes[i] >= 0) {
10142 LaneMask[2 * i + 0] = 2*Lanes[i] + 0;
10143 LaneMask[2 * i + 1] = 2*Lanes[i] + 1;
10146 V1 = DAG.getBitcast(LaneVT, V1);
10147 V2 = DAG.getBitcast(LaneVT, V2);
10148 SDValue LaneShuffle = DAG.getVectorShuffle(LaneVT, DL, V1, V2, LaneMask);
10150 // Cast it back to the type we actually want.
10151 LaneShuffle = DAG.getBitcast(VT, LaneShuffle);
10153 // Now do a simple shuffle that isn't lane crossing.
10154 SmallVector<int, 8> NewMask;
10155 NewMask.resize(Size, -1);
10156 for (int i = 0; i < Size; ++i)
10158 NewMask[i] = (i / LaneSize) * LaneSize + Mask[i] % LaneSize;
10159 assert(!is128BitLaneCrossingShuffleMask(VT, NewMask) &&
10160 "Must not introduce lane crosses at this point!");
10162 return DAG.getVectorShuffle(VT, DL, LaneShuffle, DAG.getUNDEF(VT), NewMask);
10165 /// \brief Test whether the specified input (0 or 1) is in-place blended by the
10168 /// This returns true if the elements from a particular input are already in the
10169 /// slot required by the given mask and require no permutation.
10170 static bool isShuffleMaskInputInPlace(int Input, ArrayRef<int> Mask) {
10171 assert((Input == 0 || Input == 1) && "Only two inputs to shuffles.");
10172 int Size = Mask.size();
10173 for (int i = 0; i < Size; ++i)
10174 if (Mask[i] >= 0 && Mask[i] / Size == Input && Mask[i] % Size != i)
10180 static SDValue lowerVectorShuffleWithSHUFPD(SDLoc DL, MVT VT,
10181 ArrayRef<int> Mask, SDValue V1,
10182 SDValue V2, SelectionDAG &DAG) {
10184 // Mask for V8F64: 0/1, 8/9, 2/3, 10/11, 4/5, ..
10185 // Mask for V4F64; 0/1, 4/5, 2/3, 6/7..
10186 assert(VT.getScalarSizeInBits() == 64 && "Unexpected data type for VSHUFPD");
10187 int NumElts = VT.getVectorNumElements();
10188 bool ShufpdMask = true;
10189 bool CommutableMask = true;
10190 unsigned Immediate = 0;
10191 for (int i = 0; i < NumElts; ++i) {
10194 int Val = (i & 6) + NumElts * (i & 1);
10195 int CommutVal = (i & 0xe) + NumElts * ((i & 1)^1);
10196 if (Mask[i] < Val || Mask[i] > Val + 1)
10197 ShufpdMask = false;
10198 if (Mask[i] < CommutVal || Mask[i] > CommutVal + 1)
10199 CommutableMask = false;
10200 Immediate |= (Mask[i] % 2) << i;
10203 return DAG.getNode(X86ISD::SHUFP, DL, VT, V1, V2,
10204 DAG.getConstant(Immediate, DL, MVT::i8));
10205 if (CommutableMask)
10206 return DAG.getNode(X86ISD::SHUFP, DL, VT, V2, V1,
10207 DAG.getConstant(Immediate, DL, MVT::i8));
10211 /// \brief Handle lowering of 4-lane 64-bit floating point shuffles.
10213 /// Also ends up handling lowering of 4-lane 64-bit integer shuffles when AVX2
10214 /// isn't available.
10215 static SDValue lowerV4F64VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
10216 const X86Subtarget *Subtarget,
10217 SelectionDAG &DAG) {
10219 assert(V1.getSimpleValueType() == MVT::v4f64 && "Bad operand type!");
10220 assert(V2.getSimpleValueType() == MVT::v4f64 && "Bad operand type!");
10221 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
10222 ArrayRef<int> Mask = SVOp->getMask();
10223 assert(Mask.size() == 4 && "Unexpected mask size for v4 shuffle!");
10225 SmallVector<int, 4> WidenedMask;
10226 if (canWidenShuffleElements(Mask, WidenedMask))
10227 return lowerV2X128VectorShuffle(DL, MVT::v4f64, V1, V2, Mask, Subtarget,
10230 if (isSingleInputShuffleMask(Mask)) {
10231 // Check for being able to broadcast a single element.
10232 if (SDValue Broadcast = lowerVectorShuffleAsBroadcast(DL, MVT::v4f64, V1,
10233 Mask, Subtarget, DAG))
10236 // Use low duplicate instructions for masks that match their pattern.
10237 if (isShuffleEquivalent(V1, V2, Mask, {0, 0, 2, 2}))
10238 return DAG.getNode(X86ISD::MOVDDUP, DL, MVT::v4f64, V1);
10240 if (!is128BitLaneCrossingShuffleMask(MVT::v4f64, Mask)) {
10241 // Non-half-crossing single input shuffles can be lowerid with an
10242 // interleaved permutation.
10243 unsigned VPERMILPMask = (Mask[0] == 1) | ((Mask[1] == 1) << 1) |
10244 ((Mask[2] == 3) << 2) | ((Mask[3] == 3) << 3);
10245 return DAG.getNode(X86ISD::VPERMILPI, DL, MVT::v4f64, V1,
10246 DAG.getConstant(VPERMILPMask, DL, MVT::i8));
10249 // With AVX2 we have direct support for this permutation.
10250 if (Subtarget->hasAVX2())
10251 return DAG.getNode(X86ISD::VPERMI, DL, MVT::v4f64, V1,
10252 getV4X86ShuffleImm8ForMask(Mask, DL, DAG));
10254 // Otherwise, fall back.
10255 return lowerVectorShuffleAsLanePermuteAndBlend(DL, MVT::v4f64, V1, V2, Mask,
10259 // Use dedicated unpack instructions for masks that match their pattern.
10261 lowerVectorShuffleWithUNPCK(DL, MVT::v4f64, Mask, V1, V2, DAG))
10264 if (SDValue Blend = lowerVectorShuffleAsBlend(DL, MVT::v4f64, V1, V2, Mask,
10268 // Check if the blend happens to exactly fit that of SHUFPD.
10270 lowerVectorShuffleWithSHUFPD(DL, MVT::v4f64, Mask, V1, V2, DAG))
10273 // Try to simplify this by merging 128-bit lanes to enable a lane-based
10274 // shuffle. However, if we have AVX2 and either inputs are already in place,
10275 // we will be able to shuffle even across lanes the other input in a single
10276 // instruction so skip this pattern.
10277 if (!(Subtarget->hasAVX2() && (isShuffleMaskInputInPlace(0, Mask) ||
10278 isShuffleMaskInputInPlace(1, Mask))))
10279 if (SDValue Result = lowerVectorShuffleByMerging128BitLanes(
10280 DL, MVT::v4f64, V1, V2, Mask, Subtarget, DAG))
10283 // If we have AVX2 then we always want to lower with a blend because an v4 we
10284 // can fully permute the elements.
10285 if (Subtarget->hasAVX2())
10286 return lowerVectorShuffleAsDecomposedShuffleBlend(DL, MVT::v4f64, V1, V2,
10289 // Otherwise fall back on generic lowering.
10290 return lowerVectorShuffleAsSplitOrBlend(DL, MVT::v4f64, V1, V2, Mask, DAG);
10293 /// \brief Handle lowering of 4-lane 64-bit integer shuffles.
10295 /// This routine is only called when we have AVX2 and thus a reasonable
10296 /// instruction set for v4i64 shuffling..
10297 static SDValue lowerV4I64VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
10298 const X86Subtarget *Subtarget,
10299 SelectionDAG &DAG) {
10301 assert(V1.getSimpleValueType() == MVT::v4i64 && "Bad operand type!");
10302 assert(V2.getSimpleValueType() == MVT::v4i64 && "Bad operand type!");
10303 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
10304 ArrayRef<int> Mask = SVOp->getMask();
10305 assert(Mask.size() == 4 && "Unexpected mask size for v4 shuffle!");
10306 assert(Subtarget->hasAVX2() && "We can only lower v4i64 with AVX2!");
10308 SmallVector<int, 4> WidenedMask;
10309 if (canWidenShuffleElements(Mask, WidenedMask))
10310 return lowerV2X128VectorShuffle(DL, MVT::v4i64, V1, V2, Mask, Subtarget,
10313 if (SDValue Blend = lowerVectorShuffleAsBlend(DL, MVT::v4i64, V1, V2, Mask,
10317 // Check for being able to broadcast a single element.
10318 if (SDValue Broadcast = lowerVectorShuffleAsBroadcast(DL, MVT::v4i64, V1,
10319 Mask, Subtarget, DAG))
10322 // When the shuffle is mirrored between the 128-bit lanes of the unit, we can
10323 // use lower latency instructions that will operate on both 128-bit lanes.
10324 SmallVector<int, 2> RepeatedMask;
10325 if (is128BitLaneRepeatedShuffleMask(MVT::v4i64, Mask, RepeatedMask)) {
10326 if (isSingleInputShuffleMask(Mask)) {
10327 int PSHUFDMask[] = {-1, -1, -1, -1};
10328 for (int i = 0; i < 2; ++i)
10329 if (RepeatedMask[i] >= 0) {
10330 PSHUFDMask[2 * i] = 2 * RepeatedMask[i];
10331 PSHUFDMask[2 * i + 1] = 2 * RepeatedMask[i] + 1;
10333 return DAG.getBitcast(
10335 DAG.getNode(X86ISD::PSHUFD, DL, MVT::v8i32,
10336 DAG.getBitcast(MVT::v8i32, V1),
10337 getV4X86ShuffleImm8ForMask(PSHUFDMask, DL, DAG)));
10341 // AVX2 provides a direct instruction for permuting a single input across
10343 if (isSingleInputShuffleMask(Mask))
10344 return DAG.getNode(X86ISD::VPERMI, DL, MVT::v4i64, V1,
10345 getV4X86ShuffleImm8ForMask(Mask, DL, DAG));
10347 // Try to use shift instructions.
10348 if (SDValue Shift =
10349 lowerVectorShuffleAsShift(DL, MVT::v4i64, V1, V2, Mask, DAG))
10352 // Use dedicated unpack instructions for masks that match their pattern.
10354 lowerVectorShuffleWithUNPCK(DL, MVT::v4i64, Mask, V1, V2, DAG))
10357 // Try to simplify this by merging 128-bit lanes to enable a lane-based
10358 // shuffle. However, if we have AVX2 and either inputs are already in place,
10359 // we will be able to shuffle even across lanes the other input in a single
10360 // instruction so skip this pattern.
10361 if (!(Subtarget->hasAVX2() && (isShuffleMaskInputInPlace(0, Mask) ||
10362 isShuffleMaskInputInPlace(1, Mask))))
10363 if (SDValue Result = lowerVectorShuffleByMerging128BitLanes(
10364 DL, MVT::v4i64, V1, V2, Mask, Subtarget, DAG))
10367 // Otherwise fall back on generic blend lowering.
10368 return lowerVectorShuffleAsDecomposedShuffleBlend(DL, MVT::v4i64, V1, V2,
10372 /// \brief Handle lowering of 8-lane 32-bit floating point shuffles.
10374 /// Also ends up handling lowering of 8-lane 32-bit integer shuffles when AVX2
10375 /// isn't available.
10376 static SDValue lowerV8F32VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
10377 const X86Subtarget *Subtarget,
10378 SelectionDAG &DAG) {
10380 assert(V1.getSimpleValueType() == MVT::v8f32 && "Bad operand type!");
10381 assert(V2.getSimpleValueType() == MVT::v8f32 && "Bad operand type!");
10382 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
10383 ArrayRef<int> Mask = SVOp->getMask();
10384 assert(Mask.size() == 8 && "Unexpected mask size for v8 shuffle!");
10386 if (SDValue Blend = lowerVectorShuffleAsBlend(DL, MVT::v8f32, V1, V2, Mask,
10390 // Check for being able to broadcast a single element.
10391 if (SDValue Broadcast = lowerVectorShuffleAsBroadcast(DL, MVT::v8f32, V1,
10392 Mask, Subtarget, DAG))
10395 // If the shuffle mask is repeated in each 128-bit lane, we have many more
10396 // options to efficiently lower the shuffle.
10397 SmallVector<int, 4> RepeatedMask;
10398 if (is128BitLaneRepeatedShuffleMask(MVT::v8f32, Mask, RepeatedMask)) {
10399 assert(RepeatedMask.size() == 4 &&
10400 "Repeated masks must be half the mask width!");
10402 // Use even/odd duplicate instructions for masks that match their pattern.
10403 if (isShuffleEquivalent(V1, V2, Mask, {0, 0, 2, 2, 4, 4, 6, 6}))
10404 return DAG.getNode(X86ISD::MOVSLDUP, DL, MVT::v8f32, V1);
10405 if (isShuffleEquivalent(V1, V2, Mask, {1, 1, 3, 3, 5, 5, 7, 7}))
10406 return DAG.getNode(X86ISD::MOVSHDUP, DL, MVT::v8f32, V1);
10408 if (isSingleInputShuffleMask(Mask))
10409 return DAG.getNode(X86ISD::VPERMILPI, DL, MVT::v8f32, V1,
10410 getV4X86ShuffleImm8ForMask(RepeatedMask, DL, DAG));
10412 // Use dedicated unpack instructions for masks that match their pattern.
10414 lowerVectorShuffleWithUNPCK(DL, MVT::v8f32, Mask, V1, V2, DAG))
10417 // Otherwise, fall back to a SHUFPS sequence. Here it is important that we
10418 // have already handled any direct blends. We also need to squash the
10419 // repeated mask into a simulated v4f32 mask.
10420 for (int i = 0; i < 4; ++i)
10421 if (RepeatedMask[i] >= 8)
10422 RepeatedMask[i] -= 4;
10423 return lowerVectorShuffleWithSHUFPS(DL, MVT::v8f32, RepeatedMask, V1, V2, DAG);
10426 // If we have a single input shuffle with different shuffle patterns in the
10427 // two 128-bit lanes use the variable mask to VPERMILPS.
10428 if (isSingleInputShuffleMask(Mask)) {
10429 SDValue VPermMask[8];
10430 for (int i = 0; i < 8; ++i)
10431 VPermMask[i] = Mask[i] < 0 ? DAG.getUNDEF(MVT::i32)
10432 : DAG.getConstant(Mask[i], DL, MVT::i32);
10433 if (!is128BitLaneCrossingShuffleMask(MVT::v8f32, Mask))
10434 return DAG.getNode(
10435 X86ISD::VPERMILPV, DL, MVT::v8f32, V1,
10436 DAG.getNode(ISD::BUILD_VECTOR, DL, MVT::v8i32, VPermMask));
10438 if (Subtarget->hasAVX2())
10439 return DAG.getNode(
10440 X86ISD::VPERMV, DL, MVT::v8f32,
10441 DAG.getBitcast(MVT::v8f32, DAG.getNode(ISD::BUILD_VECTOR, DL,
10442 MVT::v8i32, VPermMask)),
10445 // Otherwise, fall back.
10446 return lowerVectorShuffleAsLanePermuteAndBlend(DL, MVT::v8f32, V1, V2, Mask,
10450 // Try to simplify this by merging 128-bit lanes to enable a lane-based
10452 if (SDValue Result = lowerVectorShuffleByMerging128BitLanes(
10453 DL, MVT::v8f32, V1, V2, Mask, Subtarget, DAG))
10456 // If we have AVX2 then we always want to lower with a blend because at v8 we
10457 // can fully permute the elements.
10458 if (Subtarget->hasAVX2())
10459 return lowerVectorShuffleAsDecomposedShuffleBlend(DL, MVT::v8f32, V1, V2,
10462 // Otherwise fall back on generic lowering.
10463 return lowerVectorShuffleAsSplitOrBlend(DL, MVT::v8f32, V1, V2, Mask, DAG);
10466 /// \brief Handle lowering of 8-lane 32-bit integer shuffles.
10468 /// This routine is only called when we have AVX2 and thus a reasonable
10469 /// instruction set for v8i32 shuffling..
10470 static SDValue lowerV8I32VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
10471 const X86Subtarget *Subtarget,
10472 SelectionDAG &DAG) {
10474 assert(V1.getSimpleValueType() == MVT::v8i32 && "Bad operand type!");
10475 assert(V2.getSimpleValueType() == MVT::v8i32 && "Bad operand type!");
10476 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
10477 ArrayRef<int> Mask = SVOp->getMask();
10478 assert(Mask.size() == 8 && "Unexpected mask size for v8 shuffle!");
10479 assert(Subtarget->hasAVX2() && "We can only lower v8i32 with AVX2!");
10481 // Whenever we can lower this as a zext, that instruction is strictly faster
10482 // than any alternative. It also allows us to fold memory operands into the
10483 // shuffle in many cases.
10484 if (SDValue ZExt = lowerVectorShuffleAsZeroOrAnyExtend(DL, MVT::v8i32, V1, V2,
10485 Mask, Subtarget, DAG))
10488 if (SDValue Blend = lowerVectorShuffleAsBlend(DL, MVT::v8i32, V1, V2, Mask,
10492 // Check for being able to broadcast a single element.
10493 if (SDValue Broadcast = lowerVectorShuffleAsBroadcast(DL, MVT::v8i32, V1,
10494 Mask, Subtarget, DAG))
10497 // If the shuffle mask is repeated in each 128-bit lane we can use more
10498 // efficient instructions that mirror the shuffles across the two 128-bit
10500 SmallVector<int, 4> RepeatedMask;
10501 if (is128BitLaneRepeatedShuffleMask(MVT::v8i32, Mask, RepeatedMask)) {
10502 assert(RepeatedMask.size() == 4 && "Unexpected repeated mask size!");
10503 if (isSingleInputShuffleMask(Mask))
10504 return DAG.getNode(X86ISD::PSHUFD, DL, MVT::v8i32, V1,
10505 getV4X86ShuffleImm8ForMask(RepeatedMask, DL, DAG));
10507 // Use dedicated unpack instructions for masks that match their pattern.
10509 lowerVectorShuffleWithUNPCK(DL, MVT::v8i32, Mask, V1, V2, DAG))
10513 // Try to use shift instructions.
10514 if (SDValue Shift =
10515 lowerVectorShuffleAsShift(DL, MVT::v8i32, V1, V2, Mask, DAG))
10518 if (SDValue Rotate = lowerVectorShuffleAsByteRotate(
10519 DL, MVT::v8i32, V1, V2, Mask, Subtarget, DAG))
10522 // If the shuffle patterns aren't repeated but it is a single input, directly
10523 // generate a cross-lane VPERMD instruction.
10524 if (isSingleInputShuffleMask(Mask)) {
10525 SDValue VPermMask[8];
10526 for (int i = 0; i < 8; ++i)
10527 VPermMask[i] = Mask[i] < 0 ? DAG.getUNDEF(MVT::i32)
10528 : DAG.getConstant(Mask[i], DL, MVT::i32);
10529 return DAG.getNode(
10530 X86ISD::VPERMV, DL, MVT::v8i32,
10531 DAG.getNode(ISD::BUILD_VECTOR, DL, MVT::v8i32, VPermMask), V1);
10534 // Try to simplify this by merging 128-bit lanes to enable a lane-based
10536 if (SDValue Result = lowerVectorShuffleByMerging128BitLanes(
10537 DL, MVT::v8i32, V1, V2, Mask, Subtarget, DAG))
10540 // Otherwise fall back on generic blend lowering.
10541 return lowerVectorShuffleAsDecomposedShuffleBlend(DL, MVT::v8i32, V1, V2,
10545 /// \brief Handle lowering of 16-lane 16-bit integer shuffles.
10547 /// This routine is only called when we have AVX2 and thus a reasonable
10548 /// instruction set for v16i16 shuffling..
10549 static SDValue lowerV16I16VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
10550 const X86Subtarget *Subtarget,
10551 SelectionDAG &DAG) {
10553 assert(V1.getSimpleValueType() == MVT::v16i16 && "Bad operand type!");
10554 assert(V2.getSimpleValueType() == MVT::v16i16 && "Bad operand type!");
10555 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
10556 ArrayRef<int> Mask = SVOp->getMask();
10557 assert(Mask.size() == 16 && "Unexpected mask size for v16 shuffle!");
10558 assert(Subtarget->hasAVX2() && "We can only lower v16i16 with AVX2!");
10560 // Whenever we can lower this as a zext, that instruction is strictly faster
10561 // than any alternative. It also allows us to fold memory operands into the
10562 // shuffle in many cases.
10563 if (SDValue ZExt = lowerVectorShuffleAsZeroOrAnyExtend(DL, MVT::v16i16, V1, V2,
10564 Mask, Subtarget, DAG))
10567 // Check for being able to broadcast a single element.
10568 if (SDValue Broadcast = lowerVectorShuffleAsBroadcast(DL, MVT::v16i16, V1,
10569 Mask, Subtarget, DAG))
10572 if (SDValue Blend = lowerVectorShuffleAsBlend(DL, MVT::v16i16, V1, V2, Mask,
10576 // Use dedicated unpack instructions for masks that match their pattern.
10578 lowerVectorShuffleWithUNPCK(DL, MVT::v16i16, Mask, V1, V2, DAG))
10581 // Try to use shift instructions.
10582 if (SDValue Shift =
10583 lowerVectorShuffleAsShift(DL, MVT::v16i16, V1, V2, Mask, DAG))
10586 // Try to use byte rotation instructions.
10587 if (SDValue Rotate = lowerVectorShuffleAsByteRotate(
10588 DL, MVT::v16i16, V1, V2, Mask, Subtarget, DAG))
10591 if (isSingleInputShuffleMask(Mask)) {
10592 // There are no generalized cross-lane shuffle operations available on i16
10594 if (is128BitLaneCrossingShuffleMask(MVT::v16i16, Mask))
10595 return lowerVectorShuffleAsLanePermuteAndBlend(DL, MVT::v16i16, V1, V2,
10598 SmallVector<int, 8> RepeatedMask;
10599 if (is128BitLaneRepeatedShuffleMask(MVT::v16i16, Mask, RepeatedMask)) {
10600 // As this is a single-input shuffle, the repeated mask should be
10601 // a strictly valid v8i16 mask that we can pass through to the v8i16
10602 // lowering to handle even the v16 case.
10603 return lowerV8I16GeneralSingleInputVectorShuffle(
10604 DL, MVT::v16i16, V1, RepeatedMask, Subtarget, DAG);
10607 SDValue PSHUFBMask[32];
10608 for (int i = 0; i < 16; ++i) {
10609 if (Mask[i] == -1) {
10610 PSHUFBMask[2 * i] = PSHUFBMask[2 * i + 1] = DAG.getUNDEF(MVT::i8);
10614 int M = i < 8 ? Mask[i] : Mask[i] - 8;
10615 assert(M >= 0 && M < 8 && "Invalid single-input mask!");
10616 PSHUFBMask[2 * i] = DAG.getConstant(2 * M, DL, MVT::i8);
10617 PSHUFBMask[2 * i + 1] = DAG.getConstant(2 * M + 1, DL, MVT::i8);
10619 return DAG.getBitcast(MVT::v16i16,
10620 DAG.getNode(X86ISD::PSHUFB, DL, MVT::v32i8,
10621 DAG.getBitcast(MVT::v32i8, V1),
10622 DAG.getNode(ISD::BUILD_VECTOR, DL,
10623 MVT::v32i8, PSHUFBMask)));
10626 // Try to simplify this by merging 128-bit lanes to enable a lane-based
10628 if (SDValue Result = lowerVectorShuffleByMerging128BitLanes(
10629 DL, MVT::v16i16, V1, V2, Mask, Subtarget, DAG))
10632 // Otherwise fall back on generic lowering.
10633 return lowerVectorShuffleAsSplitOrBlend(DL, MVT::v16i16, V1, V2, Mask, DAG);
10636 /// \brief Handle lowering of 32-lane 8-bit integer shuffles.
10638 /// This routine is only called when we have AVX2 and thus a reasonable
10639 /// instruction set for v32i8 shuffling..
10640 static SDValue lowerV32I8VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
10641 const X86Subtarget *Subtarget,
10642 SelectionDAG &DAG) {
10644 assert(V1.getSimpleValueType() == MVT::v32i8 && "Bad operand type!");
10645 assert(V2.getSimpleValueType() == MVT::v32i8 && "Bad operand type!");
10646 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
10647 ArrayRef<int> Mask = SVOp->getMask();
10648 assert(Mask.size() == 32 && "Unexpected mask size for v32 shuffle!");
10649 assert(Subtarget->hasAVX2() && "We can only lower v32i8 with AVX2!");
10651 // Whenever we can lower this as a zext, that instruction is strictly faster
10652 // than any alternative. It also allows us to fold memory operands into the
10653 // shuffle in many cases.
10654 if (SDValue ZExt = lowerVectorShuffleAsZeroOrAnyExtend(DL, MVT::v32i8, V1, V2,
10655 Mask, Subtarget, DAG))
10658 // Check for being able to broadcast a single element.
10659 if (SDValue Broadcast = lowerVectorShuffleAsBroadcast(DL, MVT::v32i8, V1,
10660 Mask, Subtarget, DAG))
10663 if (SDValue Blend = lowerVectorShuffleAsBlend(DL, MVT::v32i8, V1, V2, Mask,
10667 // Use dedicated unpack instructions for masks that match their pattern.
10669 lowerVectorShuffleWithUNPCK(DL, MVT::v32i8, Mask, V1, V2, DAG))
10672 // Try to use shift instructions.
10673 if (SDValue Shift =
10674 lowerVectorShuffleAsShift(DL, MVT::v32i8, V1, V2, Mask, DAG))
10677 // Try to use byte rotation instructions.
10678 if (SDValue Rotate = lowerVectorShuffleAsByteRotate(
10679 DL, MVT::v32i8, V1, V2, Mask, Subtarget, DAG))
10682 if (isSingleInputShuffleMask(Mask)) {
10683 // There are no generalized cross-lane shuffle operations available on i8
10685 if (is128BitLaneCrossingShuffleMask(MVT::v32i8, Mask))
10686 return lowerVectorShuffleAsLanePermuteAndBlend(DL, MVT::v32i8, V1, V2,
10689 SDValue PSHUFBMask[32];
10690 for (int i = 0; i < 32; ++i)
10693 ? DAG.getUNDEF(MVT::i8)
10694 : DAG.getConstant(Mask[i] < 16 ? Mask[i] : Mask[i] - 16, DL,
10697 return DAG.getNode(
10698 X86ISD::PSHUFB, DL, MVT::v32i8, V1,
10699 DAG.getNode(ISD::BUILD_VECTOR, DL, MVT::v32i8, PSHUFBMask));
10702 // Try to simplify this by merging 128-bit lanes to enable a lane-based
10704 if (SDValue Result = lowerVectorShuffleByMerging128BitLanes(
10705 DL, MVT::v32i8, V1, V2, Mask, Subtarget, DAG))
10708 // Otherwise fall back on generic lowering.
10709 return lowerVectorShuffleAsSplitOrBlend(DL, MVT::v32i8, V1, V2, Mask, DAG);
10712 /// \brief High-level routine to lower various 256-bit x86 vector shuffles.
10714 /// This routine either breaks down the specific type of a 256-bit x86 vector
10715 /// shuffle or splits it into two 128-bit shuffles and fuses the results back
10716 /// together based on the available instructions.
10717 static SDValue lower256BitVectorShuffle(SDValue Op, SDValue V1, SDValue V2,
10718 MVT VT, const X86Subtarget *Subtarget,
10719 SelectionDAG &DAG) {
10721 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
10722 ArrayRef<int> Mask = SVOp->getMask();
10724 // If we have a single input to the zero element, insert that into V1 if we
10725 // can do so cheaply.
10726 int NumElts = VT.getVectorNumElements();
10727 int NumV2Elements = std::count_if(Mask.begin(), Mask.end(), [NumElts](int M) {
10728 return M >= NumElts;
10731 if (NumV2Elements == 1 && Mask[0] >= NumElts)
10732 if (SDValue Insertion = lowerVectorShuffleAsElementInsertion(
10733 DL, VT, V1, V2, Mask, Subtarget, DAG))
10736 // There is a really nice hard cut-over between AVX1 and AVX2 that means we
10737 // can check for those subtargets here and avoid much of the subtarget
10738 // querying in the per-vector-type lowering routines. With AVX1 we have
10739 // essentially *zero* ability to manipulate a 256-bit vector with integer
10740 // types. Since we'll use floating point types there eventually, just
10741 // immediately cast everything to a float and operate entirely in that domain.
10742 if (VT.isInteger() && !Subtarget->hasAVX2()) {
10743 int ElementBits = VT.getScalarSizeInBits();
10744 if (ElementBits < 32)
10745 // No floating point type available, decompose into 128-bit vectors.
10746 return splitAndLowerVectorShuffle(DL, VT, V1, V2, Mask, DAG);
10748 MVT FpVT = MVT::getVectorVT(MVT::getFloatingPointVT(ElementBits),
10749 VT.getVectorNumElements());
10750 V1 = DAG.getBitcast(FpVT, V1);
10751 V2 = DAG.getBitcast(FpVT, V2);
10752 return DAG.getBitcast(VT, DAG.getVectorShuffle(FpVT, DL, V1, V2, Mask));
10755 switch (VT.SimpleTy) {
10757 return lowerV4F64VectorShuffle(Op, V1, V2, Subtarget, DAG);
10759 return lowerV4I64VectorShuffle(Op, V1, V2, Subtarget, DAG);
10761 return lowerV8F32VectorShuffle(Op, V1, V2, Subtarget, DAG);
10763 return lowerV8I32VectorShuffle(Op, V1, V2, Subtarget, DAG);
10765 return lowerV16I16VectorShuffle(Op, V1, V2, Subtarget, DAG);
10767 return lowerV32I8VectorShuffle(Op, V1, V2, Subtarget, DAG);
10770 llvm_unreachable("Not a valid 256-bit x86 vector type!");
10774 /// \brief Try to lower a vector shuffle as a 128-bit shuffles.
10775 static SDValue lowerV4X128VectorShuffle(SDLoc DL, MVT VT,
10776 ArrayRef<int> Mask,
10777 SDValue V1, SDValue V2,
10778 SelectionDAG &DAG) {
10779 assert(VT.getScalarSizeInBits() == 64 &&
10780 "Unexpected element type size for 128bit shuffle.");
10782 // To handle 256 bit vector requires VLX and most probably
10783 // function lowerV2X128VectorShuffle() is better solution.
10784 assert(VT.is512BitVector() && "Unexpected vector size for 128bit shuffle.");
10786 SmallVector<int, 4> WidenedMask;
10787 if (!canWidenShuffleElements(Mask, WidenedMask))
10790 // Form a 128-bit permutation.
10791 // Convert the 64-bit shuffle mask selection values into 128-bit selection
10792 // bits defined by a vshuf64x2 instruction's immediate control byte.
10793 unsigned PermMask = 0, Imm = 0;
10794 unsigned ControlBitsNum = WidenedMask.size() / 2;
10796 for (int i = 0, Size = WidenedMask.size(); i < Size; ++i) {
10797 if (WidenedMask[i] == SM_SentinelZero)
10800 // Use first element in place of undef mask.
10801 Imm = (WidenedMask[i] == SM_SentinelUndef) ? 0 : WidenedMask[i];
10802 PermMask |= (Imm % WidenedMask.size()) << (i * ControlBitsNum);
10805 return DAG.getNode(X86ISD::SHUF128, DL, VT, V1, V2,
10806 DAG.getConstant(PermMask, DL, MVT::i8));
10809 static SDValue lowerVectorShuffleWithPERMV(SDLoc DL, MVT VT,
10810 ArrayRef<int> Mask, SDValue V1,
10811 SDValue V2, SelectionDAG &DAG) {
10813 assert(VT.getScalarSizeInBits() >= 16 && "Unexpected data type for PERMV");
10815 MVT MaskEltVT = MVT::getIntegerVT(VT.getScalarSizeInBits());
10816 MVT MaskVecVT = MVT::getVectorVT(MaskEltVT, VT.getVectorNumElements());
10818 SDValue MaskNode = getConstVector(Mask, MaskVecVT, DAG, DL, true);
10819 if (isSingleInputShuffleMask(Mask))
10820 return DAG.getNode(X86ISD::VPERMV, DL, VT, MaskNode, V1);
10822 return DAG.getNode(X86ISD::VPERMV3, DL, VT, V1, MaskNode, V2);
10825 /// \brief Handle lowering of 8-lane 64-bit floating point shuffles.
10826 static SDValue lowerV8F64VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
10827 const X86Subtarget *Subtarget,
10828 SelectionDAG &DAG) {
10830 assert(V1.getSimpleValueType() == MVT::v8f64 && "Bad operand type!");
10831 assert(V2.getSimpleValueType() == MVT::v8f64 && "Bad operand type!");
10832 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
10833 ArrayRef<int> Mask = SVOp->getMask();
10834 assert(Mask.size() == 8 && "Unexpected mask size for v8 shuffle!");
10836 if (SDValue Shuf128 =
10837 lowerV4X128VectorShuffle(DL, MVT::v8f64, Mask, V1, V2, DAG))
10840 if (SDValue Unpck =
10841 lowerVectorShuffleWithUNPCK(DL, MVT::v8f64, Mask, V1, V2, DAG))
10844 return lowerVectorShuffleWithPERMV(DL, MVT::v8f64, Mask, V1, V2, DAG);
10847 /// \brief Handle lowering of 16-lane 32-bit floating point shuffles.
10848 static SDValue lowerV16F32VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
10849 const X86Subtarget *Subtarget,
10850 SelectionDAG &DAG) {
10852 assert(V1.getSimpleValueType() == MVT::v16f32 && "Bad operand type!");
10853 assert(V2.getSimpleValueType() == MVT::v16f32 && "Bad operand type!");
10854 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
10855 ArrayRef<int> Mask = SVOp->getMask();
10856 assert(Mask.size() == 16 && "Unexpected mask size for v16 shuffle!");
10858 if (SDValue Unpck =
10859 lowerVectorShuffleWithUNPCK(DL, MVT::v16f32, Mask, V1, V2, DAG))
10862 return lowerVectorShuffleWithPERMV(DL, MVT::v16f32, Mask, V1, V2, DAG);
10865 /// \brief Handle lowering of 8-lane 64-bit integer shuffles.
10866 static SDValue lowerV8I64VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
10867 const X86Subtarget *Subtarget,
10868 SelectionDAG &DAG) {
10870 assert(V1.getSimpleValueType() == MVT::v8i64 && "Bad operand type!");
10871 assert(V2.getSimpleValueType() == MVT::v8i64 && "Bad operand type!");
10872 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
10873 ArrayRef<int> Mask = SVOp->getMask();
10874 assert(Mask.size() == 8 && "Unexpected mask size for v8 shuffle!");
10876 if (SDValue Shuf128 =
10877 lowerV4X128VectorShuffle(DL, MVT::v8i64, Mask, V1, V2, DAG))
10880 if (SDValue Unpck =
10881 lowerVectorShuffleWithUNPCK(DL, MVT::v8i64, Mask, V1, V2, DAG))
10884 return lowerVectorShuffleWithPERMV(DL, MVT::v8i64, Mask, V1, V2, DAG);
10887 /// \brief Handle lowering of 16-lane 32-bit integer shuffles.
10888 static SDValue lowerV16I32VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
10889 const X86Subtarget *Subtarget,
10890 SelectionDAG &DAG) {
10892 assert(V1.getSimpleValueType() == MVT::v16i32 && "Bad operand type!");
10893 assert(V2.getSimpleValueType() == MVT::v16i32 && "Bad operand type!");
10894 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
10895 ArrayRef<int> Mask = SVOp->getMask();
10896 assert(Mask.size() == 16 && "Unexpected mask size for v16 shuffle!");
10898 if (SDValue Unpck =
10899 lowerVectorShuffleWithUNPCK(DL, MVT::v16i32, Mask, V1, V2, DAG))
10902 return lowerVectorShuffleWithPERMV(DL, MVT::v16i32, Mask, V1, V2, DAG);
10905 /// \brief Handle lowering of 32-lane 16-bit integer shuffles.
10906 static SDValue lowerV32I16VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
10907 const X86Subtarget *Subtarget,
10908 SelectionDAG &DAG) {
10910 assert(V1.getSimpleValueType() == MVT::v32i16 && "Bad operand type!");
10911 assert(V2.getSimpleValueType() == MVT::v32i16 && "Bad operand type!");
10912 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
10913 ArrayRef<int> Mask = SVOp->getMask();
10914 assert(Mask.size() == 32 && "Unexpected mask size for v32 shuffle!");
10915 assert(Subtarget->hasBWI() && "We can only lower v32i16 with AVX-512-BWI!");
10917 return lowerVectorShuffleWithPERMV(DL, MVT::v32i16, Mask, V1, V2, DAG);
10920 /// \brief Handle lowering of 64-lane 8-bit integer shuffles.
10921 static SDValue lowerV64I8VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
10922 const X86Subtarget *Subtarget,
10923 SelectionDAG &DAG) {
10925 assert(V1.getSimpleValueType() == MVT::v64i8 && "Bad operand type!");
10926 assert(V2.getSimpleValueType() == MVT::v64i8 && "Bad operand type!");
10927 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
10928 ArrayRef<int> Mask = SVOp->getMask();
10929 assert(Mask.size() == 64 && "Unexpected mask size for v64 shuffle!");
10930 assert(Subtarget->hasBWI() && "We can only lower v64i8 with AVX-512-BWI!");
10932 // FIXME: Implement direct support for this type!
10933 return splitAndLowerVectorShuffle(DL, MVT::v64i8, V1, V2, Mask, DAG);
10936 /// \brief High-level routine to lower various 512-bit x86 vector shuffles.
10938 /// This routine either breaks down the specific type of a 512-bit x86 vector
10939 /// shuffle or splits it into two 256-bit shuffles and fuses the results back
10940 /// together based on the available instructions.
10941 static SDValue lower512BitVectorShuffle(SDValue Op, SDValue V1, SDValue V2,
10942 MVT VT, const X86Subtarget *Subtarget,
10943 SelectionDAG &DAG) {
10945 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
10946 ArrayRef<int> Mask = SVOp->getMask();
10947 assert(Subtarget->hasAVX512() &&
10948 "Cannot lower 512-bit vectors w/ basic ISA!");
10950 // Check for being able to broadcast a single element.
10951 if (SDValue Broadcast =
10952 lowerVectorShuffleAsBroadcast(DL, VT, V1, Mask, Subtarget, DAG))
10955 // Dispatch to each element type for lowering. If we don't have supprot for
10956 // specific element type shuffles at 512 bits, immediately split them and
10957 // lower them. Each lowering routine of a given type is allowed to assume that
10958 // the requisite ISA extensions for that element type are available.
10959 switch (VT.SimpleTy) {
10961 return lowerV8F64VectorShuffle(Op, V1, V2, Subtarget, DAG);
10963 return lowerV16F32VectorShuffle(Op, V1, V2, Subtarget, DAG);
10965 return lowerV8I64VectorShuffle(Op, V1, V2, Subtarget, DAG);
10967 return lowerV16I32VectorShuffle(Op, V1, V2, Subtarget, DAG);
10969 if (Subtarget->hasBWI())
10970 return lowerV32I16VectorShuffle(Op, V1, V2, Subtarget, DAG);
10973 if (Subtarget->hasBWI())
10974 return lowerV64I8VectorShuffle(Op, V1, V2, Subtarget, DAG);
10978 llvm_unreachable("Not a valid 512-bit x86 vector type!");
10981 // Otherwise fall back on splitting.
10982 return splitAndLowerVectorShuffle(DL, VT, V1, V2, Mask, DAG);
10985 // Lower vXi1 vector shuffles.
10986 // There is no a dedicated instruction on AVX-512 that shuffles the masks.
10987 // The only way to shuffle bits is to sign-extend the mask vector to SIMD
10988 // vector, shuffle and then truncate it back.
10989 static SDValue lower1BitVectorShuffle(SDValue Op, SDValue V1, SDValue V2,
10990 MVT VT, const X86Subtarget *Subtarget,
10991 SelectionDAG &DAG) {
10993 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
10994 ArrayRef<int> Mask = SVOp->getMask();
10995 assert(Subtarget->hasAVX512() &&
10996 "Cannot lower 512-bit vectors w/o basic ISA!");
10998 switch (VT.SimpleTy) {
11000 llvm_unreachable("Expected a vector of i1 elements");
11002 ExtVT = MVT::v2i64;
11005 ExtVT = MVT::v4i32;
11008 ExtVT = MVT::v8i64; // Take 512-bit type, more shuffles on KNL
11011 ExtVT = MVT::v16i32;
11014 ExtVT = MVT::v32i16;
11017 ExtVT = MVT::v64i8;
11021 if (ISD::isBuildVectorAllZeros(V1.getNode()))
11022 V1 = getZeroVector(ExtVT, Subtarget, DAG, DL);
11023 else if (ISD::isBuildVectorAllOnes(V1.getNode()))
11024 V1 = getOnesVector(ExtVT, Subtarget, DAG, DL);
11026 V1 = DAG.getNode(ISD::SIGN_EXTEND, DL, ExtVT, V1);
11029 V2 = DAG.getUNDEF(ExtVT);
11030 else if (ISD::isBuildVectorAllZeros(V2.getNode()))
11031 V2 = getZeroVector(ExtVT, Subtarget, DAG, DL);
11032 else if (ISD::isBuildVectorAllOnes(V2.getNode()))
11033 V2 = getOnesVector(ExtVT, Subtarget, DAG, DL);
11035 V2 = DAG.getNode(ISD::SIGN_EXTEND, DL, ExtVT, V2);
11036 return DAG.getNode(ISD::TRUNCATE, DL, VT,
11037 DAG.getVectorShuffle(ExtVT, DL, V1, V2, Mask));
11039 /// \brief Top-level lowering for x86 vector shuffles.
11041 /// This handles decomposition, canonicalization, and lowering of all x86
11042 /// vector shuffles. Most of the specific lowering strategies are encapsulated
11043 /// above in helper routines. The canonicalization attempts to widen shuffles
11044 /// to involve fewer lanes of wider elements, consolidate symmetric patterns
11045 /// s.t. only one of the two inputs needs to be tested, etc.
11046 static SDValue lowerVectorShuffle(SDValue Op, const X86Subtarget *Subtarget,
11047 SelectionDAG &DAG) {
11048 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
11049 ArrayRef<int> Mask = SVOp->getMask();
11050 SDValue V1 = Op.getOperand(0);
11051 SDValue V2 = Op.getOperand(1);
11052 MVT VT = Op.getSimpleValueType();
11053 int NumElements = VT.getVectorNumElements();
11055 bool Is1BitVector = (VT.getVectorElementType() == MVT::i1);
11057 assert((VT.getSizeInBits() != 64 || Is1BitVector) &&
11058 "Can't lower MMX shuffles");
11060 bool V1IsUndef = V1.getOpcode() == ISD::UNDEF;
11061 bool V2IsUndef = V2.getOpcode() == ISD::UNDEF;
11062 if (V1IsUndef && V2IsUndef)
11063 return DAG.getUNDEF(VT);
11065 // When we create a shuffle node we put the UNDEF node to second operand,
11066 // but in some cases the first operand may be transformed to UNDEF.
11067 // In this case we should just commute the node.
11069 return DAG.getCommutedVectorShuffle(*SVOp);
11071 // Check for non-undef masks pointing at an undef vector and make the masks
11072 // undef as well. This makes it easier to match the shuffle based solely on
11076 if (M >= NumElements) {
11077 SmallVector<int, 8> NewMask(Mask.begin(), Mask.end());
11078 for (int &M : NewMask)
11079 if (M >= NumElements)
11081 return DAG.getVectorShuffle(VT, dl, V1, V2, NewMask);
11084 // We actually see shuffles that are entirely re-arrangements of a set of
11085 // zero inputs. This mostly happens while decomposing complex shuffles into
11086 // simple ones. Directly lower these as a buildvector of zeros.
11087 SmallBitVector Zeroable = computeZeroableShuffleElements(Mask, V1, V2);
11088 if (Zeroable.all())
11089 return getZeroVector(VT, Subtarget, DAG, dl);
11091 // Try to collapse shuffles into using a vector type with fewer elements but
11092 // wider element types. We cap this to not form integers or floating point
11093 // elements wider than 64 bits, but it might be interesting to form i128
11094 // integers to handle flipping the low and high halves of AVX 256-bit vectors.
11095 SmallVector<int, 16> WidenedMask;
11096 if (VT.getScalarSizeInBits() < 64 && !Is1BitVector &&
11097 canWidenShuffleElements(Mask, WidenedMask)) {
11098 MVT NewEltVT = VT.isFloatingPoint()
11099 ? MVT::getFloatingPointVT(VT.getScalarSizeInBits() * 2)
11100 : MVT::getIntegerVT(VT.getScalarSizeInBits() * 2);
11101 MVT NewVT = MVT::getVectorVT(NewEltVT, VT.getVectorNumElements() / 2);
11102 // Make sure that the new vector type is legal. For example, v2f64 isn't
11104 if (DAG.getTargetLoweringInfo().isTypeLegal(NewVT)) {
11105 V1 = DAG.getBitcast(NewVT, V1);
11106 V2 = DAG.getBitcast(NewVT, V2);
11107 return DAG.getBitcast(
11108 VT, DAG.getVectorShuffle(NewVT, dl, V1, V2, WidenedMask));
11112 int NumV1Elements = 0, NumUndefElements = 0, NumV2Elements = 0;
11113 for (int M : SVOp->getMask())
11115 ++NumUndefElements;
11116 else if (M < NumElements)
11121 // Commute the shuffle as needed such that more elements come from V1 than
11122 // V2. This allows us to match the shuffle pattern strictly on how many
11123 // elements come from V1 without handling the symmetric cases.
11124 if (NumV2Elements > NumV1Elements)
11125 return DAG.getCommutedVectorShuffle(*SVOp);
11127 // When the number of V1 and V2 elements are the same, try to minimize the
11128 // number of uses of V2 in the low half of the vector. When that is tied,
11129 // ensure that the sum of indices for V1 is equal to or lower than the sum
11130 // indices for V2. When those are equal, try to ensure that the number of odd
11131 // indices for V1 is lower than the number of odd indices for V2.
11132 if (NumV1Elements == NumV2Elements) {
11133 int LowV1Elements = 0, LowV2Elements = 0;
11134 for (int M : SVOp->getMask().slice(0, NumElements / 2))
11135 if (M >= NumElements)
11139 if (LowV2Elements > LowV1Elements) {
11140 return DAG.getCommutedVectorShuffle(*SVOp);
11141 } else if (LowV2Elements == LowV1Elements) {
11142 int SumV1Indices = 0, SumV2Indices = 0;
11143 for (int i = 0, Size = SVOp->getMask().size(); i < Size; ++i)
11144 if (SVOp->getMask()[i] >= NumElements)
11146 else if (SVOp->getMask()[i] >= 0)
11148 if (SumV2Indices < SumV1Indices) {
11149 return DAG.getCommutedVectorShuffle(*SVOp);
11150 } else if (SumV2Indices == SumV1Indices) {
11151 int NumV1OddIndices = 0, NumV2OddIndices = 0;
11152 for (int i = 0, Size = SVOp->getMask().size(); i < Size; ++i)
11153 if (SVOp->getMask()[i] >= NumElements)
11154 NumV2OddIndices += i % 2;
11155 else if (SVOp->getMask()[i] >= 0)
11156 NumV1OddIndices += i % 2;
11157 if (NumV2OddIndices < NumV1OddIndices)
11158 return DAG.getCommutedVectorShuffle(*SVOp);
11163 // For each vector width, delegate to a specialized lowering routine.
11164 if (VT.is128BitVector())
11165 return lower128BitVectorShuffle(Op, V1, V2, VT, Subtarget, DAG);
11167 if (VT.is256BitVector())
11168 return lower256BitVectorShuffle(Op, V1, V2, VT, Subtarget, DAG);
11170 if (VT.is512BitVector())
11171 return lower512BitVectorShuffle(Op, V1, V2, VT, Subtarget, DAG);
11174 return lower1BitVectorShuffle(Op, V1, V2, VT, Subtarget, DAG);
11175 llvm_unreachable("Unimplemented!");
11178 // This function assumes its argument is a BUILD_VECTOR of constants or
11179 // undef SDNodes. i.e: ISD::isBuildVectorOfConstantSDNodes(BuildVector) is
11181 static bool BUILD_VECTORtoBlendMask(BuildVectorSDNode *BuildVector,
11182 unsigned &MaskValue) {
11184 unsigned NumElems = BuildVector->getNumOperands();
11186 // There are 2 lanes if (NumElems > 8), and 1 lane otherwise.
11187 // We don't handle the >2 lanes case right now.
11188 unsigned NumLanes = (NumElems - 1) / 8 + 1;
11192 unsigned NumElemsInLane = NumElems / NumLanes;
11194 // Blend for v16i16 should be symmetric for the both lanes.
11195 for (unsigned i = 0; i < NumElemsInLane; ++i) {
11196 SDValue EltCond = BuildVector->getOperand(i);
11197 SDValue SndLaneEltCond =
11198 (NumLanes == 2) ? BuildVector->getOperand(i + NumElemsInLane) : EltCond;
11200 int Lane1Cond = -1, Lane2Cond = -1;
11201 if (isa<ConstantSDNode>(EltCond))
11202 Lane1Cond = !isZero(EltCond);
11203 if (isa<ConstantSDNode>(SndLaneEltCond))
11204 Lane2Cond = !isZero(SndLaneEltCond);
11206 unsigned LaneMask = 0;
11207 if (Lane1Cond == Lane2Cond || Lane2Cond < 0)
11208 // Lane1Cond != 0, means we want the first argument.
11209 // Lane1Cond == 0, means we want the second argument.
11210 // The encoding of this argument is 0 for the first argument, 1
11211 // for the second. Therefore, invert the condition.
11212 LaneMask = !Lane1Cond << i;
11213 else if (Lane1Cond < 0)
11214 LaneMask = !Lane2Cond << i;
11218 MaskValue |= LaneMask;
11220 MaskValue |= LaneMask << NumElemsInLane;
11225 /// \brief Try to lower a VSELECT instruction to a vector shuffle.
11226 static SDValue lowerVSELECTtoVectorShuffle(SDValue Op,
11227 const X86Subtarget *Subtarget,
11228 SelectionDAG &DAG) {
11229 SDValue Cond = Op.getOperand(0);
11230 SDValue LHS = Op.getOperand(1);
11231 SDValue RHS = Op.getOperand(2);
11233 MVT VT = Op.getSimpleValueType();
11235 if (!ISD::isBuildVectorOfConstantSDNodes(Cond.getNode()))
11237 auto *CondBV = cast<BuildVectorSDNode>(Cond);
11239 // Only non-legal VSELECTs reach this lowering, convert those into generic
11240 // shuffles and re-use the shuffle lowering path for blends.
11241 SmallVector<int, 32> Mask;
11242 for (int i = 0, Size = VT.getVectorNumElements(); i < Size; ++i) {
11243 SDValue CondElt = CondBV->getOperand(i);
11245 isa<ConstantSDNode>(CondElt) ? i + (isZero(CondElt) ? Size : 0) : -1);
11247 return DAG.getVectorShuffle(VT, dl, LHS, RHS, Mask);
11250 SDValue X86TargetLowering::LowerVSELECT(SDValue Op, SelectionDAG &DAG) const {
11251 // A vselect where all conditions and data are constants can be optimized into
11252 // a single vector load by SelectionDAGLegalize::ExpandBUILD_VECTOR().
11253 if (ISD::isBuildVectorOfConstantSDNodes(Op.getOperand(0).getNode()) &&
11254 ISD::isBuildVectorOfConstantSDNodes(Op.getOperand(1).getNode()) &&
11255 ISD::isBuildVectorOfConstantSDNodes(Op.getOperand(2).getNode()))
11258 // Try to lower this to a blend-style vector shuffle. This can handle all
11259 // constant condition cases.
11260 if (SDValue BlendOp = lowerVSELECTtoVectorShuffle(Op, Subtarget, DAG))
11263 // Variable blends are only legal from SSE4.1 onward.
11264 if (!Subtarget->hasSSE41())
11267 // Only some types will be legal on some subtargets. If we can emit a legal
11268 // VSELECT-matching blend, return Op, and but if we need to expand, return
11270 switch (Op.getSimpleValueType().SimpleTy) {
11272 // Most of the vector types have blends past SSE4.1.
11276 // The byte blends for AVX vectors were introduced only in AVX2.
11277 if (Subtarget->hasAVX2())
11284 // AVX-512 BWI and VLX features support VSELECT with i16 elements.
11285 if (Subtarget->hasBWI() && Subtarget->hasVLX())
11288 // FIXME: We should custom lower this by fixing the condition and using i8
11294 static SDValue LowerEXTRACT_VECTOR_ELT_SSE4(SDValue Op, SelectionDAG &DAG) {
11295 MVT VT = Op.getSimpleValueType();
11298 if (!Op.getOperand(0).getSimpleValueType().is128BitVector())
11301 if (VT.getSizeInBits() == 8) {
11302 SDValue Extract = DAG.getNode(X86ISD::PEXTRB, dl, MVT::i32,
11303 Op.getOperand(0), Op.getOperand(1));
11304 SDValue Assert = DAG.getNode(ISD::AssertZext, dl, MVT::i32, Extract,
11305 DAG.getValueType(VT));
11306 return DAG.getNode(ISD::TRUNCATE, dl, VT, Assert);
11309 if (VT.getSizeInBits() == 16) {
11310 unsigned Idx = cast<ConstantSDNode>(Op.getOperand(1))->getZExtValue();
11311 // If Idx is 0, it's cheaper to do a move instead of a pextrw.
11313 return DAG.getNode(
11314 ISD::TRUNCATE, dl, MVT::i16,
11315 DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::i32,
11316 DAG.getBitcast(MVT::v4i32, Op.getOperand(0)),
11317 Op.getOperand(1)));
11318 SDValue Extract = DAG.getNode(X86ISD::PEXTRW, dl, MVT::i32,
11319 Op.getOperand(0), Op.getOperand(1));
11320 SDValue Assert = DAG.getNode(ISD::AssertZext, dl, MVT::i32, Extract,
11321 DAG.getValueType(VT));
11322 return DAG.getNode(ISD::TRUNCATE, dl, VT, Assert);
11325 if (VT == MVT::f32) {
11326 // EXTRACTPS outputs to a GPR32 register which will require a movd to copy
11327 // the result back to FR32 register. It's only worth matching if the
11328 // result has a single use which is a store or a bitcast to i32. And in
11329 // the case of a store, it's not worth it if the index is a constant 0,
11330 // because a MOVSSmr can be used instead, which is smaller and faster.
11331 if (!Op.hasOneUse())
11333 SDNode *User = *Op.getNode()->use_begin();
11334 if ((User->getOpcode() != ISD::STORE ||
11335 (isa<ConstantSDNode>(Op.getOperand(1)) &&
11336 cast<ConstantSDNode>(Op.getOperand(1))->isNullValue())) &&
11337 (User->getOpcode() != ISD::BITCAST ||
11338 User->getValueType(0) != MVT::i32))
11340 SDValue Extract = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::i32,
11341 DAG.getBitcast(MVT::v4i32, Op.getOperand(0)),
11343 return DAG.getBitcast(MVT::f32, Extract);
11346 if (VT == MVT::i32 || VT == MVT::i64) {
11347 // ExtractPS/pextrq works with constant index.
11348 if (isa<ConstantSDNode>(Op.getOperand(1)))
11354 /// Extract one bit from mask vector, like v16i1 or v8i1.
11355 /// AVX-512 feature.
11357 X86TargetLowering::ExtractBitFromMaskVector(SDValue Op, SelectionDAG &DAG) const {
11358 SDValue Vec = Op.getOperand(0);
11360 MVT VecVT = Vec.getSimpleValueType();
11361 SDValue Idx = Op.getOperand(1);
11362 MVT EltVT = Op.getSimpleValueType();
11364 assert((EltVT == MVT::i1) && "Unexpected operands in ExtractBitFromMaskVector");
11365 assert((VecVT.getVectorNumElements() <= 16 || Subtarget->hasBWI()) &&
11366 "Unexpected vector type in ExtractBitFromMaskVector");
11368 // variable index can't be handled in mask registers,
11369 // extend vector to VR512
11370 if (!isa<ConstantSDNode>(Idx)) {
11371 MVT ExtVT = (VecVT == MVT::v8i1 ? MVT::v8i64 : MVT::v16i32);
11372 SDValue Ext = DAG.getNode(ISD::ZERO_EXTEND, dl, ExtVT, Vec);
11373 SDValue Elt = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl,
11374 ExtVT.getVectorElementType(), Ext, Idx);
11375 return DAG.getNode(ISD::TRUNCATE, dl, EltVT, Elt);
11378 unsigned IdxVal = cast<ConstantSDNode>(Idx)->getZExtValue();
11379 const TargetRegisterClass* rc = getRegClassFor(VecVT);
11380 if (!Subtarget->hasDQI() && (VecVT.getVectorNumElements() <= 8))
11381 rc = getRegClassFor(MVT::v16i1);
11382 unsigned MaxSift = rc->getSize()*8 - 1;
11383 Vec = DAG.getNode(X86ISD::VSHLI, dl, VecVT, Vec,
11384 DAG.getConstant(MaxSift - IdxVal, dl, MVT::i8));
11385 Vec = DAG.getNode(X86ISD::VSRLI, dl, VecVT, Vec,
11386 DAG.getConstant(MaxSift, dl, MVT::i8));
11387 return DAG.getNode(X86ISD::VEXTRACT, dl, MVT::i1, Vec,
11388 DAG.getIntPtrConstant(0, dl));
11392 X86TargetLowering::LowerEXTRACT_VECTOR_ELT(SDValue Op,
11393 SelectionDAG &DAG) const {
11395 SDValue Vec = Op.getOperand(0);
11396 MVT VecVT = Vec.getSimpleValueType();
11397 SDValue Idx = Op.getOperand(1);
11399 if (Op.getSimpleValueType() == MVT::i1)
11400 return ExtractBitFromMaskVector(Op, DAG);
11402 if (!isa<ConstantSDNode>(Idx)) {
11403 if (VecVT.is512BitVector() ||
11404 (VecVT.is256BitVector() && Subtarget->hasInt256() &&
11405 VecVT.getVectorElementType().getSizeInBits() == 32)) {
11408 MVT::getIntegerVT(VecVT.getVectorElementType().getSizeInBits());
11409 MVT MaskVT = MVT::getVectorVT(MaskEltVT, VecVT.getSizeInBits() /
11410 MaskEltVT.getSizeInBits());
11412 Idx = DAG.getZExtOrTrunc(Idx, dl, MaskEltVT);
11413 auto PtrVT = getPointerTy(DAG.getDataLayout());
11414 SDValue Mask = DAG.getNode(X86ISD::VINSERT, dl, MaskVT,
11415 getZeroVector(MaskVT, Subtarget, DAG, dl), Idx,
11416 DAG.getConstant(0, dl, PtrVT));
11417 SDValue Perm = DAG.getNode(X86ISD::VPERMV, dl, VecVT, Mask, Vec);
11418 return DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, Op.getValueType(), Perm,
11419 DAG.getConstant(0, dl, PtrVT));
11424 // If this is a 256-bit vector result, first extract the 128-bit vector and
11425 // then extract the element from the 128-bit vector.
11426 if (VecVT.is256BitVector() || VecVT.is512BitVector()) {
11428 unsigned IdxVal = cast<ConstantSDNode>(Idx)->getZExtValue();
11429 // Get the 128-bit vector.
11430 Vec = Extract128BitVector(Vec, IdxVal, DAG, dl);
11431 MVT EltVT = VecVT.getVectorElementType();
11433 unsigned ElemsPerChunk = 128 / EltVT.getSizeInBits();
11434 assert(isPowerOf2_32(ElemsPerChunk) && "Elements per chunk not power of 2");
11436 // Find IdxVal modulo ElemsPerChunk. Since ElemsPerChunk is a power of 2
11437 // this can be done with a mask.
11438 IdxVal &= ElemsPerChunk - 1;
11439 return DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, Op.getValueType(), Vec,
11440 DAG.getConstant(IdxVal, dl, MVT::i32));
11443 assert(VecVT.is128BitVector() && "Unexpected vector length");
11445 if (Subtarget->hasSSE41())
11446 if (SDValue Res = LowerEXTRACT_VECTOR_ELT_SSE4(Op, DAG))
11449 MVT VT = Op.getSimpleValueType();
11450 // TODO: handle v16i8.
11451 if (VT.getSizeInBits() == 16) {
11452 SDValue Vec = Op.getOperand(0);
11453 unsigned Idx = cast<ConstantSDNode>(Op.getOperand(1))->getZExtValue();
11455 return DAG.getNode(ISD::TRUNCATE, dl, MVT::i16,
11456 DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::i32,
11457 DAG.getBitcast(MVT::v4i32, Vec),
11458 Op.getOperand(1)));
11459 // Transform it so it match pextrw which produces a 32-bit result.
11460 MVT EltVT = MVT::i32;
11461 SDValue Extract = DAG.getNode(X86ISD::PEXTRW, dl, EltVT,
11462 Op.getOperand(0), Op.getOperand(1));
11463 SDValue Assert = DAG.getNode(ISD::AssertZext, dl, EltVT, Extract,
11464 DAG.getValueType(VT));
11465 return DAG.getNode(ISD::TRUNCATE, dl, VT, Assert);
11468 if (VT.getSizeInBits() == 32) {
11469 unsigned Idx = cast<ConstantSDNode>(Op.getOperand(1))->getZExtValue();
11473 // SHUFPS the element to the lowest double word, then movss.
11474 int Mask[4] = { static_cast<int>(Idx), -1, -1, -1 };
11475 MVT VVT = Op.getOperand(0).getSimpleValueType();
11476 SDValue Vec = DAG.getVectorShuffle(VVT, dl, Op.getOperand(0),
11477 DAG.getUNDEF(VVT), Mask);
11478 return DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, VT, Vec,
11479 DAG.getIntPtrConstant(0, dl));
11482 if (VT.getSizeInBits() == 64) {
11483 // FIXME: .td only matches this for <2 x f64>, not <2 x i64> on 32b
11484 // FIXME: seems like this should be unnecessary if mov{h,l}pd were taught
11485 // to match extract_elt for f64.
11486 unsigned Idx = cast<ConstantSDNode>(Op.getOperand(1))->getZExtValue();
11490 // UNPCKHPD the element to the lowest double word, then movsd.
11491 // Note if the lower 64 bits of the result of the UNPCKHPD is then stored
11492 // to a f64mem, the whole operation is folded into a single MOVHPDmr.
11493 int Mask[2] = { 1, -1 };
11494 MVT VVT = Op.getOperand(0).getSimpleValueType();
11495 SDValue Vec = DAG.getVectorShuffle(VVT, dl, Op.getOperand(0),
11496 DAG.getUNDEF(VVT), Mask);
11497 return DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, VT, Vec,
11498 DAG.getIntPtrConstant(0, dl));
11504 /// Insert one bit to mask vector, like v16i1 or v8i1.
11505 /// AVX-512 feature.
11507 X86TargetLowering::InsertBitToMaskVector(SDValue Op, SelectionDAG &DAG) const {
11509 SDValue Vec = Op.getOperand(0);
11510 SDValue Elt = Op.getOperand(1);
11511 SDValue Idx = Op.getOperand(2);
11512 MVT VecVT = Vec.getSimpleValueType();
11514 if (!isa<ConstantSDNode>(Idx)) {
11515 // Non constant index. Extend source and destination,
11516 // insert element and then truncate the result.
11517 MVT ExtVecVT = (VecVT == MVT::v8i1 ? MVT::v8i64 : MVT::v16i32);
11518 MVT ExtEltVT = (VecVT == MVT::v8i1 ? MVT::i64 : MVT::i32);
11519 SDValue ExtOp = DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, ExtVecVT,
11520 DAG.getNode(ISD::ZERO_EXTEND, dl, ExtVecVT, Vec),
11521 DAG.getNode(ISD::ZERO_EXTEND, dl, ExtEltVT, Elt), Idx);
11522 return DAG.getNode(ISD::TRUNCATE, dl, VecVT, ExtOp);
11525 unsigned IdxVal = cast<ConstantSDNode>(Idx)->getZExtValue();
11526 SDValue EltInVec = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VecVT, Elt);
11528 EltInVec = DAG.getNode(X86ISD::VSHLI, dl, VecVT, EltInVec,
11529 DAG.getConstant(IdxVal, dl, MVT::i8));
11530 if (Vec.getOpcode() == ISD::UNDEF)
11532 return DAG.getNode(ISD::OR, dl, VecVT, Vec, EltInVec);
11535 SDValue X86TargetLowering::LowerINSERT_VECTOR_ELT(SDValue Op,
11536 SelectionDAG &DAG) const {
11537 MVT VT = Op.getSimpleValueType();
11538 MVT EltVT = VT.getVectorElementType();
11540 if (EltVT == MVT::i1)
11541 return InsertBitToMaskVector(Op, DAG);
11544 SDValue N0 = Op.getOperand(0);
11545 SDValue N1 = Op.getOperand(1);
11546 SDValue N2 = Op.getOperand(2);
11547 if (!isa<ConstantSDNode>(N2))
11549 auto *N2C = cast<ConstantSDNode>(N2);
11550 unsigned IdxVal = N2C->getZExtValue();
11552 // If the vector is wider than 128 bits, extract the 128-bit subvector, insert
11553 // into that, and then insert the subvector back into the result.
11554 if (VT.is256BitVector() || VT.is512BitVector()) {
11555 // With a 256-bit vector, we can insert into the zero element efficiently
11556 // using a blend if we have AVX or AVX2 and the right data type.
11557 if (VT.is256BitVector() && IdxVal == 0) {
11558 // TODO: It is worthwhile to cast integer to floating point and back
11559 // and incur a domain crossing penalty if that's what we'll end up
11560 // doing anyway after extracting to a 128-bit vector.
11561 if ((Subtarget->hasAVX() && (EltVT == MVT::f64 || EltVT == MVT::f32)) ||
11562 (Subtarget->hasAVX2() && EltVT == MVT::i32)) {
11563 SDValue N1Vec = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VT, N1);
11564 N2 = DAG.getIntPtrConstant(1, dl);
11565 return DAG.getNode(X86ISD::BLENDI, dl, VT, N0, N1Vec, N2);
11569 // Get the desired 128-bit vector chunk.
11570 SDValue V = Extract128BitVector(N0, IdxVal, DAG, dl);
11572 // Insert the element into the desired chunk.
11573 unsigned NumEltsIn128 = 128 / EltVT.getSizeInBits();
11574 assert(isPowerOf2_32(NumEltsIn128));
11575 // Since NumEltsIn128 is a power of 2 we can use mask instead of modulo.
11576 unsigned IdxIn128 = IdxVal & (NumEltsIn128 - 1);
11578 V = DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, V.getValueType(), V, N1,
11579 DAG.getConstant(IdxIn128, dl, MVT::i32));
11581 // Insert the changed part back into the bigger vector
11582 return Insert128BitVector(N0, V, IdxVal, DAG, dl);
11584 assert(VT.is128BitVector() && "Only 128-bit vector types should be left!");
11586 if (Subtarget->hasSSE41()) {
11587 if (EltVT.getSizeInBits() == 8 || EltVT.getSizeInBits() == 16) {
11589 if (VT == MVT::v8i16) {
11590 Opc = X86ISD::PINSRW;
11592 assert(VT == MVT::v16i8);
11593 Opc = X86ISD::PINSRB;
11596 // Transform it so it match pinsr{b,w} which expects a GR32 as its second
11598 if (N1.getValueType() != MVT::i32)
11599 N1 = DAG.getNode(ISD::ANY_EXTEND, dl, MVT::i32, N1);
11600 if (N2.getValueType() != MVT::i32)
11601 N2 = DAG.getIntPtrConstant(IdxVal, dl);
11602 return DAG.getNode(Opc, dl, VT, N0, N1, N2);
11605 if (EltVT == MVT::f32) {
11606 // Bits [7:6] of the constant are the source select. This will always be
11607 // zero here. The DAG Combiner may combine an extract_elt index into
11608 // these bits. For example (insert (extract, 3), 2) could be matched by
11609 // putting the '3' into bits [7:6] of X86ISD::INSERTPS.
11610 // Bits [5:4] of the constant are the destination select. This is the
11611 // value of the incoming immediate.
11612 // Bits [3:0] of the constant are the zero mask. The DAG Combiner may
11613 // combine either bitwise AND or insert of float 0.0 to set these bits.
11615 bool MinSize = DAG.getMachineFunction().getFunction()->optForMinSize();
11616 if (IdxVal == 0 && (!MinSize || !MayFoldLoad(N1))) {
11617 // If this is an insertion of 32-bits into the low 32-bits of
11618 // a vector, we prefer to generate a blend with immediate rather
11619 // than an insertps. Blends are simpler operations in hardware and so
11620 // will always have equal or better performance than insertps.
11621 // But if optimizing for size and there's a load folding opportunity,
11622 // generate insertps because blendps does not have a 32-bit memory
11624 N2 = DAG.getIntPtrConstant(1, dl);
11625 N1 = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, MVT::v4f32, N1);
11626 return DAG.getNode(X86ISD::BLENDI, dl, VT, N0, N1, N2);
11628 N2 = DAG.getIntPtrConstant(IdxVal << 4, dl);
11629 // Create this as a scalar to vector..
11630 N1 = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, MVT::v4f32, N1);
11631 return DAG.getNode(X86ISD::INSERTPS, dl, VT, N0, N1, N2);
11634 if (EltVT == MVT::i32 || EltVT == MVT::i64) {
11635 // PINSR* works with constant index.
11640 if (EltVT == MVT::i8)
11643 if (EltVT.getSizeInBits() == 16) {
11644 // Transform it so it match pinsrw which expects a 16-bit value in a GR32
11645 // as its second argument.
11646 if (N1.getValueType() != MVT::i32)
11647 N1 = DAG.getNode(ISD::ANY_EXTEND, dl, MVT::i32, N1);
11648 if (N2.getValueType() != MVT::i32)
11649 N2 = DAG.getIntPtrConstant(IdxVal, dl);
11650 return DAG.getNode(X86ISD::PINSRW, dl, VT, N0, N1, N2);
11655 static SDValue LowerSCALAR_TO_VECTOR(SDValue Op, SelectionDAG &DAG) {
11657 MVT OpVT = Op.getSimpleValueType();
11659 // If this is a 256-bit vector result, first insert into a 128-bit
11660 // vector and then insert into the 256-bit vector.
11661 if (!OpVT.is128BitVector()) {
11662 // Insert into a 128-bit vector.
11663 unsigned SizeFactor = OpVT.getSizeInBits()/128;
11664 MVT VT128 = MVT::getVectorVT(OpVT.getVectorElementType(),
11665 OpVT.getVectorNumElements() / SizeFactor);
11667 Op = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VT128, Op.getOperand(0));
11669 // Insert the 128-bit vector.
11670 return Insert128BitVector(DAG.getUNDEF(OpVT), Op, 0, DAG, dl);
11673 if (OpVT == MVT::v1i64 &&
11674 Op.getOperand(0).getValueType() == MVT::i64)
11675 return DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, MVT::v1i64, Op.getOperand(0));
11677 SDValue AnyExt = DAG.getNode(ISD::ANY_EXTEND, dl, MVT::i32, Op.getOperand(0));
11678 assert(OpVT.is128BitVector() && "Expected an SSE type!");
11679 return DAG.getBitcast(
11680 OpVT, DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, MVT::v4i32, AnyExt));
11683 // Lower a node with an EXTRACT_SUBVECTOR opcode. This may result in
11684 // a simple subregister reference or explicit instructions to grab
11685 // upper bits of a vector.
11686 static SDValue LowerEXTRACT_SUBVECTOR(SDValue Op, const X86Subtarget *Subtarget,
11687 SelectionDAG &DAG) {
11689 SDValue In = Op.getOperand(0);
11690 SDValue Idx = Op.getOperand(1);
11691 unsigned IdxVal = cast<ConstantSDNode>(Idx)->getZExtValue();
11692 MVT ResVT = Op.getSimpleValueType();
11693 MVT InVT = In.getSimpleValueType();
11695 if (Subtarget->hasFp256()) {
11696 if (ResVT.is128BitVector() &&
11697 (InVT.is256BitVector() || InVT.is512BitVector()) &&
11698 isa<ConstantSDNode>(Idx)) {
11699 return Extract128BitVector(In, IdxVal, DAG, dl);
11701 if (ResVT.is256BitVector() && InVT.is512BitVector() &&
11702 isa<ConstantSDNode>(Idx)) {
11703 return Extract256BitVector(In, IdxVal, DAG, dl);
11709 // Lower a node with an INSERT_SUBVECTOR opcode. This may result in a
11710 // simple superregister reference or explicit instructions to insert
11711 // the upper bits of a vector.
11712 static SDValue LowerINSERT_SUBVECTOR(SDValue Op, const X86Subtarget *Subtarget,
11713 SelectionDAG &DAG) {
11714 if (!Subtarget->hasAVX())
11718 SDValue Vec = Op.getOperand(0);
11719 SDValue SubVec = Op.getOperand(1);
11720 SDValue Idx = Op.getOperand(2);
11722 if (!isa<ConstantSDNode>(Idx))
11725 unsigned IdxVal = cast<ConstantSDNode>(Idx)->getZExtValue();
11726 MVT OpVT = Op.getSimpleValueType();
11727 MVT SubVecVT = SubVec.getSimpleValueType();
11729 // Fold two 16-byte subvector loads into one 32-byte load:
11730 // (insert_subvector (insert_subvector undef, (load addr), 0),
11731 // (load addr + 16), Elts/2)
11733 if ((IdxVal == OpVT.getVectorNumElements() / 2) &&
11734 Vec.getOpcode() == ISD::INSERT_SUBVECTOR &&
11735 OpVT.is256BitVector() && SubVecVT.is128BitVector()) {
11736 auto *Idx2 = dyn_cast<ConstantSDNode>(Vec.getOperand(2));
11737 if (Idx2 && Idx2->getZExtValue() == 0) {
11738 SDValue SubVec2 = Vec.getOperand(1);
11739 // If needed, look through a bitcast to get to the load.
11740 if (SubVec2.getNode() && SubVec2.getOpcode() == ISD::BITCAST)
11741 SubVec2 = SubVec2.getOperand(0);
11743 if (auto *FirstLd = dyn_cast<LoadSDNode>(SubVec2)) {
11745 unsigned Alignment = FirstLd->getAlignment();
11746 unsigned AS = FirstLd->getAddressSpace();
11747 const X86TargetLowering *TLI = Subtarget->getTargetLowering();
11748 if (TLI->allowsMemoryAccess(*DAG.getContext(), DAG.getDataLayout(),
11749 OpVT, AS, Alignment, &Fast) && Fast) {
11750 SDValue Ops[] = { SubVec2, SubVec };
11751 if (SDValue Ld = EltsFromConsecutiveLoads(OpVT, Ops, dl, DAG, false))
11758 if ((OpVT.is256BitVector() || OpVT.is512BitVector()) &&
11759 SubVecVT.is128BitVector())
11760 return Insert128BitVector(Vec, SubVec, IdxVal, DAG, dl);
11762 if (OpVT.is512BitVector() && SubVecVT.is256BitVector())
11763 return Insert256BitVector(Vec, SubVec, IdxVal, DAG, dl);
11765 if (OpVT.getVectorElementType() == MVT::i1) {
11766 if (IdxVal == 0 && Vec.getOpcode() == ISD::UNDEF) // the operation is legal
11768 SDValue ZeroIdx = DAG.getIntPtrConstant(0, dl);
11769 SDValue Undef = DAG.getUNDEF(OpVT);
11770 unsigned NumElems = OpVT.getVectorNumElements();
11771 SDValue ShiftBits = DAG.getConstant(NumElems/2, dl, MVT::i8);
11773 if (IdxVal == OpVT.getVectorNumElements() / 2) {
11774 // Zero upper bits of the Vec
11775 Vec = DAG.getNode(X86ISD::VSHLI, dl, OpVT, Vec, ShiftBits);
11776 Vec = DAG.getNode(X86ISD::VSRLI, dl, OpVT, Vec, ShiftBits);
11778 SDValue Vec2 = DAG.getNode(ISD::INSERT_SUBVECTOR, dl, OpVT, Undef,
11780 Vec2 = DAG.getNode(X86ISD::VSHLI, dl, OpVT, Vec2, ShiftBits);
11781 return DAG.getNode(ISD::OR, dl, OpVT, Vec, Vec2);
11784 SDValue Vec2 = DAG.getNode(ISD::INSERT_SUBVECTOR, dl, OpVT, Undef,
11786 // Zero upper bits of the Vec2
11787 Vec2 = DAG.getNode(X86ISD::VSHLI, dl, OpVT, Vec2, ShiftBits);
11788 Vec2 = DAG.getNode(X86ISD::VSRLI, dl, OpVT, Vec2, ShiftBits);
11789 // Zero lower bits of the Vec
11790 Vec = DAG.getNode(X86ISD::VSRLI, dl, OpVT, Vec, ShiftBits);
11791 Vec = DAG.getNode(X86ISD::VSHLI, dl, OpVT, Vec, ShiftBits);
11792 // Merge them together
11793 return DAG.getNode(ISD::OR, dl, OpVT, Vec, Vec2);
11799 // ConstantPool, JumpTable, GlobalAddress, and ExternalSymbol are lowered as
11800 // their target countpart wrapped in the X86ISD::Wrapper node. Suppose N is
11801 // one of the above mentioned nodes. It has to be wrapped because otherwise
11802 // Select(N) returns N. So the raw TargetGlobalAddress nodes, etc. can only
11803 // be used to form addressing mode. These wrapped nodes will be selected
11806 X86TargetLowering::LowerConstantPool(SDValue Op, SelectionDAG &DAG) const {
11807 ConstantPoolSDNode *CP = cast<ConstantPoolSDNode>(Op);
11809 // In PIC mode (unless we're in RIPRel PIC mode) we add an offset to the
11810 // global base reg.
11811 unsigned char OpFlag = 0;
11812 unsigned WrapperKind = X86ISD::Wrapper;
11813 CodeModel::Model M = DAG.getTarget().getCodeModel();
11815 if (Subtarget->isPICStyleRIPRel() &&
11816 (M == CodeModel::Small || M == CodeModel::Kernel))
11817 WrapperKind = X86ISD::WrapperRIP;
11818 else if (Subtarget->isPICStyleGOT())
11819 OpFlag = X86II::MO_GOTOFF;
11820 else if (Subtarget->isPICStyleStubPIC())
11821 OpFlag = X86II::MO_PIC_BASE_OFFSET;
11823 auto PtrVT = getPointerTy(DAG.getDataLayout());
11824 SDValue Result = DAG.getTargetConstantPool(
11825 CP->getConstVal(), PtrVT, CP->getAlignment(), CP->getOffset(), OpFlag);
11827 Result = DAG.getNode(WrapperKind, DL, PtrVT, Result);
11828 // With PIC, the address is actually $g + Offset.
11831 DAG.getNode(ISD::ADD, DL, PtrVT,
11832 DAG.getNode(X86ISD::GlobalBaseReg, SDLoc(), PtrVT), Result);
11838 SDValue X86TargetLowering::LowerJumpTable(SDValue Op, SelectionDAG &DAG) const {
11839 JumpTableSDNode *JT = cast<JumpTableSDNode>(Op);
11841 // In PIC mode (unless we're in RIPRel PIC mode) we add an offset to the
11842 // global base reg.
11843 unsigned char OpFlag = 0;
11844 unsigned WrapperKind = X86ISD::Wrapper;
11845 CodeModel::Model M = DAG.getTarget().getCodeModel();
11847 if (Subtarget->isPICStyleRIPRel() &&
11848 (M == CodeModel::Small || M == CodeModel::Kernel))
11849 WrapperKind = X86ISD::WrapperRIP;
11850 else if (Subtarget->isPICStyleGOT())
11851 OpFlag = X86II::MO_GOTOFF;
11852 else if (Subtarget->isPICStyleStubPIC())
11853 OpFlag = X86II::MO_PIC_BASE_OFFSET;
11855 auto PtrVT = getPointerTy(DAG.getDataLayout());
11856 SDValue Result = DAG.getTargetJumpTable(JT->getIndex(), PtrVT, OpFlag);
11858 Result = DAG.getNode(WrapperKind, DL, PtrVT, Result);
11860 // With PIC, the address is actually $g + Offset.
11863 DAG.getNode(ISD::ADD, DL, PtrVT,
11864 DAG.getNode(X86ISD::GlobalBaseReg, SDLoc(), PtrVT), Result);
11870 X86TargetLowering::LowerExternalSymbol(SDValue Op, SelectionDAG &DAG) const {
11871 const char *Sym = cast<ExternalSymbolSDNode>(Op)->getSymbol();
11873 // In PIC mode (unless we're in RIPRel PIC mode) we add an offset to the
11874 // global base reg.
11875 unsigned char OpFlag = 0;
11876 unsigned WrapperKind = X86ISD::Wrapper;
11877 CodeModel::Model M = DAG.getTarget().getCodeModel();
11879 if (Subtarget->isPICStyleRIPRel() &&
11880 (M == CodeModel::Small || M == CodeModel::Kernel)) {
11881 if (Subtarget->isTargetDarwin() || Subtarget->isTargetELF())
11882 OpFlag = X86II::MO_GOTPCREL;
11883 WrapperKind = X86ISD::WrapperRIP;
11884 } else if (Subtarget->isPICStyleGOT()) {
11885 OpFlag = X86II::MO_GOT;
11886 } else if (Subtarget->isPICStyleStubPIC()) {
11887 OpFlag = X86II::MO_DARWIN_NONLAZY_PIC_BASE;
11888 } else if (Subtarget->isPICStyleStubNoDynamic()) {
11889 OpFlag = X86II::MO_DARWIN_NONLAZY;
11892 auto PtrVT = getPointerTy(DAG.getDataLayout());
11893 SDValue Result = DAG.getTargetExternalSymbol(Sym, PtrVT, OpFlag);
11896 Result = DAG.getNode(WrapperKind, DL, PtrVT, Result);
11898 // With PIC, the address is actually $g + Offset.
11899 if (DAG.getTarget().getRelocationModel() == Reloc::PIC_ &&
11900 !Subtarget->is64Bit()) {
11902 DAG.getNode(ISD::ADD, DL, PtrVT,
11903 DAG.getNode(X86ISD::GlobalBaseReg, SDLoc(), PtrVT), Result);
11906 // For symbols that require a load from a stub to get the address, emit the
11908 if (isGlobalStubReference(OpFlag))
11909 Result = DAG.getLoad(PtrVT, DL, DAG.getEntryNode(), Result,
11910 MachinePointerInfo::getGOT(DAG.getMachineFunction()),
11911 false, false, false, 0);
11917 X86TargetLowering::LowerBlockAddress(SDValue Op, SelectionDAG &DAG) const {
11918 // Create the TargetBlockAddressAddress node.
11919 unsigned char OpFlags =
11920 Subtarget->ClassifyBlockAddressReference();
11921 CodeModel::Model M = DAG.getTarget().getCodeModel();
11922 const BlockAddress *BA = cast<BlockAddressSDNode>(Op)->getBlockAddress();
11923 int64_t Offset = cast<BlockAddressSDNode>(Op)->getOffset();
11925 auto PtrVT = getPointerTy(DAG.getDataLayout());
11926 SDValue Result = DAG.getTargetBlockAddress(BA, PtrVT, Offset, OpFlags);
11928 if (Subtarget->isPICStyleRIPRel() &&
11929 (M == CodeModel::Small || M == CodeModel::Kernel))
11930 Result = DAG.getNode(X86ISD::WrapperRIP, dl, PtrVT, Result);
11932 Result = DAG.getNode(X86ISD::Wrapper, dl, PtrVT, Result);
11934 // With PIC, the address is actually $g + Offset.
11935 if (isGlobalRelativeToPICBase(OpFlags)) {
11936 Result = DAG.getNode(ISD::ADD, dl, PtrVT,
11937 DAG.getNode(X86ISD::GlobalBaseReg, dl, PtrVT), Result);
11944 X86TargetLowering::LowerGlobalAddress(const GlobalValue *GV, SDLoc dl,
11945 int64_t Offset, SelectionDAG &DAG) const {
11946 // Create the TargetGlobalAddress node, folding in the constant
11947 // offset if it is legal.
11948 unsigned char OpFlags =
11949 Subtarget->ClassifyGlobalReference(GV, DAG.getTarget());
11950 CodeModel::Model M = DAG.getTarget().getCodeModel();
11951 auto PtrVT = getPointerTy(DAG.getDataLayout());
11953 if (OpFlags == X86II::MO_NO_FLAG &&
11954 X86::isOffsetSuitableForCodeModel(Offset, M)) {
11955 // A direct static reference to a global.
11956 Result = DAG.getTargetGlobalAddress(GV, dl, PtrVT, Offset);
11959 Result = DAG.getTargetGlobalAddress(GV, dl, PtrVT, 0, OpFlags);
11962 if (Subtarget->isPICStyleRIPRel() &&
11963 (M == CodeModel::Small || M == CodeModel::Kernel))
11964 Result = DAG.getNode(X86ISD::WrapperRIP, dl, PtrVT, Result);
11966 Result = DAG.getNode(X86ISD::Wrapper, dl, PtrVT, Result);
11968 // With PIC, the address is actually $g + Offset.
11969 if (isGlobalRelativeToPICBase(OpFlags)) {
11970 Result = DAG.getNode(ISD::ADD, dl, PtrVT,
11971 DAG.getNode(X86ISD::GlobalBaseReg, dl, PtrVT), Result);
11974 // For globals that require a load from a stub to get the address, emit the
11976 if (isGlobalStubReference(OpFlags))
11977 Result = DAG.getLoad(PtrVT, dl, DAG.getEntryNode(), Result,
11978 MachinePointerInfo::getGOT(DAG.getMachineFunction()),
11979 false, false, false, 0);
11981 // If there was a non-zero offset that we didn't fold, create an explicit
11982 // addition for it.
11984 Result = DAG.getNode(ISD::ADD, dl, PtrVT, Result,
11985 DAG.getConstant(Offset, dl, PtrVT));
11991 X86TargetLowering::LowerGlobalAddress(SDValue Op, SelectionDAG &DAG) const {
11992 const GlobalValue *GV = cast<GlobalAddressSDNode>(Op)->getGlobal();
11993 int64_t Offset = cast<GlobalAddressSDNode>(Op)->getOffset();
11994 return LowerGlobalAddress(GV, SDLoc(Op), Offset, DAG);
11998 GetTLSADDR(SelectionDAG &DAG, SDValue Chain, GlobalAddressSDNode *GA,
11999 SDValue *InFlag, const EVT PtrVT, unsigned ReturnReg,
12000 unsigned char OperandFlags, bool LocalDynamic = false) {
12001 MachineFrameInfo *MFI = DAG.getMachineFunction().getFrameInfo();
12002 SDVTList NodeTys = DAG.getVTList(MVT::Other, MVT::Glue);
12004 SDValue TGA = DAG.getTargetGlobalAddress(GA->getGlobal(), dl,
12005 GA->getValueType(0),
12009 X86ISD::NodeType CallType = LocalDynamic ? X86ISD::TLSBASEADDR
12013 SDValue Ops[] = { Chain, TGA, *InFlag };
12014 Chain = DAG.getNode(CallType, dl, NodeTys, Ops);
12016 SDValue Ops[] = { Chain, TGA };
12017 Chain = DAG.getNode(CallType, dl, NodeTys, Ops);
12020 // TLSADDR will be codegen'ed as call. Inform MFI that function has calls.
12021 MFI->setAdjustsStack(true);
12022 MFI->setHasCalls(true);
12024 SDValue Flag = Chain.getValue(1);
12025 return DAG.getCopyFromReg(Chain, dl, ReturnReg, PtrVT, Flag);
12028 // Lower ISD::GlobalTLSAddress using the "general dynamic" model, 32 bit
12030 LowerToTLSGeneralDynamicModel32(GlobalAddressSDNode *GA, SelectionDAG &DAG,
12033 SDLoc dl(GA); // ? function entry point might be better
12034 SDValue Chain = DAG.getCopyToReg(DAG.getEntryNode(), dl, X86::EBX,
12035 DAG.getNode(X86ISD::GlobalBaseReg,
12036 SDLoc(), PtrVT), InFlag);
12037 InFlag = Chain.getValue(1);
12039 return GetTLSADDR(DAG, Chain, GA, &InFlag, PtrVT, X86::EAX, X86II::MO_TLSGD);
12042 // Lower ISD::GlobalTLSAddress using the "general dynamic" model, 64 bit
12044 LowerToTLSGeneralDynamicModel64(GlobalAddressSDNode *GA, SelectionDAG &DAG,
12046 return GetTLSADDR(DAG, DAG.getEntryNode(), GA, nullptr, PtrVT,
12047 X86::RAX, X86II::MO_TLSGD);
12050 static SDValue LowerToTLSLocalDynamicModel(GlobalAddressSDNode *GA,
12056 // Get the start address of the TLS block for this module.
12057 X86MachineFunctionInfo* MFI = DAG.getMachineFunction()
12058 .getInfo<X86MachineFunctionInfo>();
12059 MFI->incNumLocalDynamicTLSAccesses();
12063 Base = GetTLSADDR(DAG, DAG.getEntryNode(), GA, nullptr, PtrVT, X86::RAX,
12064 X86II::MO_TLSLD, /*LocalDynamic=*/true);
12067 SDValue Chain = DAG.getCopyToReg(DAG.getEntryNode(), dl, X86::EBX,
12068 DAG.getNode(X86ISD::GlobalBaseReg, SDLoc(), PtrVT), InFlag);
12069 InFlag = Chain.getValue(1);
12070 Base = GetTLSADDR(DAG, Chain, GA, &InFlag, PtrVT, X86::EAX,
12071 X86II::MO_TLSLDM, /*LocalDynamic=*/true);
12074 // Note: the CleanupLocalDynamicTLSPass will remove redundant computations
12078 unsigned char OperandFlags = X86II::MO_DTPOFF;
12079 unsigned WrapperKind = X86ISD::Wrapper;
12080 SDValue TGA = DAG.getTargetGlobalAddress(GA->getGlobal(), dl,
12081 GA->getValueType(0),
12082 GA->getOffset(), OperandFlags);
12083 SDValue Offset = DAG.getNode(WrapperKind, dl, PtrVT, TGA);
12085 // Add x@dtpoff with the base.
12086 return DAG.getNode(ISD::ADD, dl, PtrVT, Offset, Base);
12089 // Lower ISD::GlobalTLSAddress using the "initial exec" or "local exec" model.
12090 static SDValue LowerToTLSExecModel(GlobalAddressSDNode *GA, SelectionDAG &DAG,
12091 const EVT PtrVT, TLSModel::Model model,
12092 bool is64Bit, bool isPIC) {
12095 // Get the Thread Pointer, which is %gs:0 (32-bit) or %fs:0 (64-bit).
12096 Value *Ptr = Constant::getNullValue(Type::getInt8PtrTy(*DAG.getContext(),
12097 is64Bit ? 257 : 256));
12099 SDValue ThreadPointer =
12100 DAG.getLoad(PtrVT, dl, DAG.getEntryNode(), DAG.getIntPtrConstant(0, dl),
12101 MachinePointerInfo(Ptr), false, false, false, 0);
12103 unsigned char OperandFlags = 0;
12104 // Most TLS accesses are not RIP relative, even on x86-64. One exception is
12106 unsigned WrapperKind = X86ISD::Wrapper;
12107 if (model == TLSModel::LocalExec) {
12108 OperandFlags = is64Bit ? X86II::MO_TPOFF : X86II::MO_NTPOFF;
12109 } else if (model == TLSModel::InitialExec) {
12111 OperandFlags = X86II::MO_GOTTPOFF;
12112 WrapperKind = X86ISD::WrapperRIP;
12114 OperandFlags = isPIC ? X86II::MO_GOTNTPOFF : X86II::MO_INDNTPOFF;
12117 llvm_unreachable("Unexpected model");
12120 // emit "addl x@ntpoff,%eax" (local exec)
12121 // or "addl x@indntpoff,%eax" (initial exec)
12122 // or "addl x@gotntpoff(%ebx) ,%eax" (initial exec, 32-bit pic)
12124 DAG.getTargetGlobalAddress(GA->getGlobal(), dl, GA->getValueType(0),
12125 GA->getOffset(), OperandFlags);
12126 SDValue Offset = DAG.getNode(WrapperKind, dl, PtrVT, TGA);
12128 if (model == TLSModel::InitialExec) {
12129 if (isPIC && !is64Bit) {
12130 Offset = DAG.getNode(ISD::ADD, dl, PtrVT,
12131 DAG.getNode(X86ISD::GlobalBaseReg, SDLoc(), PtrVT),
12135 Offset = DAG.getLoad(PtrVT, dl, DAG.getEntryNode(), Offset,
12136 MachinePointerInfo::getGOT(DAG.getMachineFunction()),
12137 false, false, false, 0);
12140 // The address of the thread local variable is the add of the thread
12141 // pointer with the offset of the variable.
12142 return DAG.getNode(ISD::ADD, dl, PtrVT, ThreadPointer, Offset);
12146 X86TargetLowering::LowerGlobalTLSAddress(SDValue Op, SelectionDAG &DAG) const {
12148 GlobalAddressSDNode *GA = cast<GlobalAddressSDNode>(Op);
12149 const GlobalValue *GV = GA->getGlobal();
12150 auto PtrVT = getPointerTy(DAG.getDataLayout());
12152 if (Subtarget->isTargetELF()) {
12153 if (DAG.getTarget().Options.EmulatedTLS)
12154 return LowerToTLSEmulatedModel(GA, DAG);
12155 TLSModel::Model model = DAG.getTarget().getTLSModel(GV);
12157 case TLSModel::GeneralDynamic:
12158 if (Subtarget->is64Bit())
12159 return LowerToTLSGeneralDynamicModel64(GA, DAG, PtrVT);
12160 return LowerToTLSGeneralDynamicModel32(GA, DAG, PtrVT);
12161 case TLSModel::LocalDynamic:
12162 return LowerToTLSLocalDynamicModel(GA, DAG, PtrVT,
12163 Subtarget->is64Bit());
12164 case TLSModel::InitialExec:
12165 case TLSModel::LocalExec:
12166 return LowerToTLSExecModel(GA, DAG, PtrVT, model, Subtarget->is64Bit(),
12167 DAG.getTarget().getRelocationModel() ==
12170 llvm_unreachable("Unknown TLS model.");
12173 if (Subtarget->isTargetDarwin()) {
12174 // Darwin only has one model of TLS. Lower to that.
12175 unsigned char OpFlag = 0;
12176 unsigned WrapperKind = Subtarget->isPICStyleRIPRel() ?
12177 X86ISD::WrapperRIP : X86ISD::Wrapper;
12179 // In PIC mode (unless we're in RIPRel PIC mode) we add an offset to the
12180 // global base reg.
12181 bool PIC32 = (DAG.getTarget().getRelocationModel() == Reloc::PIC_) &&
12182 !Subtarget->is64Bit();
12184 OpFlag = X86II::MO_TLVP_PIC_BASE;
12186 OpFlag = X86II::MO_TLVP;
12188 SDValue Result = DAG.getTargetGlobalAddress(GA->getGlobal(), DL,
12189 GA->getValueType(0),
12190 GA->getOffset(), OpFlag);
12191 SDValue Offset = DAG.getNode(WrapperKind, DL, PtrVT, Result);
12193 // With PIC32, the address is actually $g + Offset.
12195 Offset = DAG.getNode(ISD::ADD, DL, PtrVT,
12196 DAG.getNode(X86ISD::GlobalBaseReg, SDLoc(), PtrVT),
12199 // Lowering the machine isd will make sure everything is in the right
12201 SDValue Chain = DAG.getEntryNode();
12202 SDVTList NodeTys = DAG.getVTList(MVT::Other, MVT::Glue);
12203 SDValue Args[] = { Chain, Offset };
12204 Chain = DAG.getNode(X86ISD::TLSCALL, DL, NodeTys, Args);
12206 // TLSCALL will be codegen'ed as call. Inform MFI that function has calls.
12207 MachineFrameInfo *MFI = DAG.getMachineFunction().getFrameInfo();
12208 MFI->setAdjustsStack(true);
12210 // And our return value (tls address) is in the standard call return value
12212 unsigned Reg = Subtarget->is64Bit() ? X86::RAX : X86::EAX;
12213 return DAG.getCopyFromReg(Chain, DL, Reg, PtrVT, Chain.getValue(1));
12216 if (Subtarget->isTargetKnownWindowsMSVC() ||
12217 Subtarget->isTargetWindowsGNU()) {
12218 // Just use the implicit TLS architecture
12219 // Need to generate someting similar to:
12220 // mov rdx, qword [gs:abs 58H]; Load pointer to ThreadLocalStorage
12222 // mov ecx, dword [rel _tls_index]: Load index (from C runtime)
12223 // mov rcx, qword [rdx+rcx*8]
12224 // mov eax, .tls$:tlsvar
12225 // [rax+rcx] contains the address
12226 // Windows 64bit: gs:0x58
12227 // Windows 32bit: fs:__tls_array
12230 SDValue Chain = DAG.getEntryNode();
12232 // Get the Thread Pointer, which is %fs:__tls_array (32-bit) or
12233 // %gs:0x58 (64-bit). On MinGW, __tls_array is not available, so directly
12234 // use its literal value of 0x2C.
12235 Value *Ptr = Constant::getNullValue(Subtarget->is64Bit()
12236 ? Type::getInt8PtrTy(*DAG.getContext(),
12238 : Type::getInt32PtrTy(*DAG.getContext(),
12241 SDValue TlsArray = Subtarget->is64Bit()
12242 ? DAG.getIntPtrConstant(0x58, dl)
12243 : (Subtarget->isTargetWindowsGNU()
12244 ? DAG.getIntPtrConstant(0x2C, dl)
12245 : DAG.getExternalSymbol("_tls_array", PtrVT));
12247 SDValue ThreadPointer =
12248 DAG.getLoad(PtrVT, dl, Chain, TlsArray, MachinePointerInfo(Ptr), false,
12252 if (GV->getThreadLocalMode() == GlobalVariable::LocalExecTLSModel) {
12253 res = ThreadPointer;
12255 // Load the _tls_index variable
12256 SDValue IDX = DAG.getExternalSymbol("_tls_index", PtrVT);
12257 if (Subtarget->is64Bit())
12258 IDX = DAG.getExtLoad(ISD::ZEXTLOAD, dl, PtrVT, Chain, IDX,
12259 MachinePointerInfo(), MVT::i32, false, false,
12262 IDX = DAG.getLoad(PtrVT, dl, Chain, IDX, MachinePointerInfo(), false,
12265 auto &DL = DAG.getDataLayout();
12267 DAG.getConstant(Log2_64_Ceil(DL.getPointerSize()), dl, PtrVT);
12268 IDX = DAG.getNode(ISD::SHL, dl, PtrVT, IDX, Scale);
12270 res = DAG.getNode(ISD::ADD, dl, PtrVT, ThreadPointer, IDX);
12273 res = DAG.getLoad(PtrVT, dl, Chain, res, MachinePointerInfo(), false, false,
12276 // Get the offset of start of .tls section
12277 SDValue TGA = DAG.getTargetGlobalAddress(GA->getGlobal(), dl,
12278 GA->getValueType(0),
12279 GA->getOffset(), X86II::MO_SECREL);
12280 SDValue Offset = DAG.getNode(X86ISD::Wrapper, dl, PtrVT, TGA);
12282 // The address of the thread local variable is the add of the thread
12283 // pointer with the offset of the variable.
12284 return DAG.getNode(ISD::ADD, dl, PtrVT, res, Offset);
12287 llvm_unreachable("TLS not implemented for this target.");
12290 /// LowerShiftParts - Lower SRA_PARTS and friends, which return two i32 values
12291 /// and take a 2 x i32 value to shift plus a shift amount.
12292 static SDValue LowerShiftParts(SDValue Op, SelectionDAG &DAG) {
12293 assert(Op.getNumOperands() == 3 && "Not a double-shift!");
12294 MVT VT = Op.getSimpleValueType();
12295 unsigned VTBits = VT.getSizeInBits();
12297 bool isSRA = Op.getOpcode() == ISD::SRA_PARTS;
12298 SDValue ShOpLo = Op.getOperand(0);
12299 SDValue ShOpHi = Op.getOperand(1);
12300 SDValue ShAmt = Op.getOperand(2);
12301 // X86ISD::SHLD and X86ISD::SHRD have defined overflow behavior but the
12302 // generic ISD nodes haven't. Insert an AND to be safe, it's optimized away
12304 SDValue SafeShAmt = DAG.getNode(ISD::AND, dl, MVT::i8, ShAmt,
12305 DAG.getConstant(VTBits - 1, dl, MVT::i8));
12306 SDValue Tmp1 = isSRA ? DAG.getNode(ISD::SRA, dl, VT, ShOpHi,
12307 DAG.getConstant(VTBits - 1, dl, MVT::i8))
12308 : DAG.getConstant(0, dl, VT);
12310 SDValue Tmp2, Tmp3;
12311 if (Op.getOpcode() == ISD::SHL_PARTS) {
12312 Tmp2 = DAG.getNode(X86ISD::SHLD, dl, VT, ShOpHi, ShOpLo, ShAmt);
12313 Tmp3 = DAG.getNode(ISD::SHL, dl, VT, ShOpLo, SafeShAmt);
12315 Tmp2 = DAG.getNode(X86ISD::SHRD, dl, VT, ShOpLo, ShOpHi, ShAmt);
12316 Tmp3 = DAG.getNode(isSRA ? ISD::SRA : ISD::SRL, dl, VT, ShOpHi, SafeShAmt);
12319 // If the shift amount is larger or equal than the width of a part we can't
12320 // rely on the results of shld/shrd. Insert a test and select the appropriate
12321 // values for large shift amounts.
12322 SDValue AndNode = DAG.getNode(ISD::AND, dl, MVT::i8, ShAmt,
12323 DAG.getConstant(VTBits, dl, MVT::i8));
12324 SDValue Cond = DAG.getNode(X86ISD::CMP, dl, MVT::i32,
12325 AndNode, DAG.getConstant(0, dl, MVT::i8));
12328 SDValue CC = DAG.getConstant(X86::COND_NE, dl, MVT::i8);
12329 SDValue Ops0[4] = { Tmp2, Tmp3, CC, Cond };
12330 SDValue Ops1[4] = { Tmp3, Tmp1, CC, Cond };
12332 if (Op.getOpcode() == ISD::SHL_PARTS) {
12333 Hi = DAG.getNode(X86ISD::CMOV, dl, VT, Ops0);
12334 Lo = DAG.getNode(X86ISD::CMOV, dl, VT, Ops1);
12336 Lo = DAG.getNode(X86ISD::CMOV, dl, VT, Ops0);
12337 Hi = DAG.getNode(X86ISD::CMOV, dl, VT, Ops1);
12340 SDValue Ops[2] = { Lo, Hi };
12341 return DAG.getMergeValues(Ops, dl);
12344 SDValue X86TargetLowering::LowerSINT_TO_FP(SDValue Op,
12345 SelectionDAG &DAG) const {
12346 SDValue Src = Op.getOperand(0);
12347 MVT SrcVT = Src.getSimpleValueType();
12348 MVT VT = Op.getSimpleValueType();
12351 if (SrcVT.isVector()) {
12352 if (SrcVT == MVT::v2i32 && VT == MVT::v2f64) {
12353 return DAG.getNode(X86ISD::CVTDQ2PD, dl, VT,
12354 DAG.getNode(ISD::CONCAT_VECTORS, dl, MVT::v4i32, Src,
12355 DAG.getUNDEF(SrcVT)));
12357 if (SrcVT.getVectorElementType() == MVT::i1) {
12358 MVT IntegerVT = MVT::getVectorVT(MVT::i32, SrcVT.getVectorNumElements());
12359 return DAG.getNode(ISD::SINT_TO_FP, dl, Op.getValueType(),
12360 DAG.getNode(ISD::SIGN_EXTEND, dl, IntegerVT, Src));
12365 assert(SrcVT <= MVT::i64 && SrcVT >= MVT::i16 &&
12366 "Unknown SINT_TO_FP to lower!");
12368 // These are really Legal; return the operand so the caller accepts it as
12370 if (SrcVT == MVT::i32 && isScalarFPTypeInSSEReg(Op.getValueType()))
12372 if (SrcVT == MVT::i64 && isScalarFPTypeInSSEReg(Op.getValueType()) &&
12373 Subtarget->is64Bit()) {
12377 unsigned Size = SrcVT.getSizeInBits()/8;
12378 MachineFunction &MF = DAG.getMachineFunction();
12379 auto PtrVT = getPointerTy(MF.getDataLayout());
12380 int SSFI = MF.getFrameInfo()->CreateStackObject(Size, Size, false);
12381 SDValue StackSlot = DAG.getFrameIndex(SSFI, PtrVT);
12382 SDValue Chain = DAG.getStore(
12383 DAG.getEntryNode(), dl, Op.getOperand(0), StackSlot,
12384 MachinePointerInfo::getFixedStack(DAG.getMachineFunction(), SSFI), false,
12386 return BuildFILD(Op, SrcVT, Chain, StackSlot, DAG);
12389 SDValue X86TargetLowering::BuildFILD(SDValue Op, EVT SrcVT, SDValue Chain,
12391 SelectionDAG &DAG) const {
12395 bool useSSE = isScalarFPTypeInSSEReg(Op.getValueType());
12397 Tys = DAG.getVTList(MVT::f64, MVT::Other, MVT::Glue);
12399 Tys = DAG.getVTList(Op.getValueType(), MVT::Other);
12401 unsigned ByteSize = SrcVT.getSizeInBits()/8;
12403 FrameIndexSDNode *FI = dyn_cast<FrameIndexSDNode>(StackSlot);
12404 MachineMemOperand *MMO;
12406 int SSFI = FI->getIndex();
12407 MMO = DAG.getMachineFunction().getMachineMemOperand(
12408 MachinePointerInfo::getFixedStack(DAG.getMachineFunction(), SSFI),
12409 MachineMemOperand::MOLoad, ByteSize, ByteSize);
12411 MMO = cast<LoadSDNode>(StackSlot)->getMemOperand();
12412 StackSlot = StackSlot.getOperand(1);
12414 SDValue Ops[] = { Chain, StackSlot, DAG.getValueType(SrcVT) };
12415 SDValue Result = DAG.getMemIntrinsicNode(useSSE ? X86ISD::FILD_FLAG :
12417 Tys, Ops, SrcVT, MMO);
12420 Chain = Result.getValue(1);
12421 SDValue InFlag = Result.getValue(2);
12423 // FIXME: Currently the FST is flagged to the FILD_FLAG. This
12424 // shouldn't be necessary except that RFP cannot be live across
12425 // multiple blocks. When stackifier is fixed, they can be uncoupled.
12426 MachineFunction &MF = DAG.getMachineFunction();
12427 unsigned SSFISize = Op.getValueType().getSizeInBits()/8;
12428 int SSFI = MF.getFrameInfo()->CreateStackObject(SSFISize, SSFISize, false);
12429 auto PtrVT = getPointerTy(MF.getDataLayout());
12430 SDValue StackSlot = DAG.getFrameIndex(SSFI, PtrVT);
12431 Tys = DAG.getVTList(MVT::Other);
12433 Chain, Result, StackSlot, DAG.getValueType(Op.getValueType()), InFlag
12435 MachineMemOperand *MMO = DAG.getMachineFunction().getMachineMemOperand(
12436 MachinePointerInfo::getFixedStack(DAG.getMachineFunction(), SSFI),
12437 MachineMemOperand::MOStore, SSFISize, SSFISize);
12439 Chain = DAG.getMemIntrinsicNode(X86ISD::FST, DL, Tys,
12440 Ops, Op.getValueType(), MMO);
12441 Result = DAG.getLoad(
12442 Op.getValueType(), DL, Chain, StackSlot,
12443 MachinePointerInfo::getFixedStack(DAG.getMachineFunction(), SSFI),
12444 false, false, false, 0);
12450 // LowerUINT_TO_FP_i64 - 64-bit unsigned integer to double expansion.
12451 SDValue X86TargetLowering::LowerUINT_TO_FP_i64(SDValue Op,
12452 SelectionDAG &DAG) const {
12453 // This algorithm is not obvious. Here it is what we're trying to output:
12456 punpckldq (c0), %xmm0 // c0: (uint4){ 0x43300000U, 0x45300000U, 0U, 0U }
12457 subpd (c1), %xmm0 // c1: (double2){ 0x1.0p52, 0x1.0p52 * 0x1.0p32 }
12459 haddpd %xmm0, %xmm0
12461 pshufd $0x4e, %xmm0, %xmm1
12467 LLVMContext *Context = DAG.getContext();
12469 // Build some magic constants.
12470 static const uint32_t CV0[] = { 0x43300000, 0x45300000, 0, 0 };
12471 Constant *C0 = ConstantDataVector::get(*Context, CV0);
12472 auto PtrVT = getPointerTy(DAG.getDataLayout());
12473 SDValue CPIdx0 = DAG.getConstantPool(C0, PtrVT, 16);
12475 SmallVector<Constant*,2> CV1;
12477 ConstantFP::get(*Context, APFloat(APFloat::IEEEdouble,
12478 APInt(64, 0x4330000000000000ULL))));
12480 ConstantFP::get(*Context, APFloat(APFloat::IEEEdouble,
12481 APInt(64, 0x4530000000000000ULL))));
12482 Constant *C1 = ConstantVector::get(CV1);
12483 SDValue CPIdx1 = DAG.getConstantPool(C1, PtrVT, 16);
12485 // Load the 64-bit value into an XMM register.
12486 SDValue XR1 = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, MVT::v2i64,
12489 DAG.getLoad(MVT::v4i32, dl, DAG.getEntryNode(), CPIdx0,
12490 MachinePointerInfo::getConstantPool(DAG.getMachineFunction()),
12491 false, false, false, 16);
12493 getUnpackl(DAG, dl, MVT::v4i32, DAG.getBitcast(MVT::v4i32, XR1), CLod0);
12496 DAG.getLoad(MVT::v2f64, dl, CLod0.getValue(1), CPIdx1,
12497 MachinePointerInfo::getConstantPool(DAG.getMachineFunction()),
12498 false, false, false, 16);
12499 SDValue XR2F = DAG.getBitcast(MVT::v2f64, Unpck1);
12500 // TODO: Are there any fast-math-flags to propagate here?
12501 SDValue Sub = DAG.getNode(ISD::FSUB, dl, MVT::v2f64, XR2F, CLod1);
12504 if (Subtarget->hasSSE3()) {
12505 // FIXME: The 'haddpd' instruction may be slower than 'movhlps + addsd'.
12506 Result = DAG.getNode(X86ISD::FHADD, dl, MVT::v2f64, Sub, Sub);
12508 SDValue S2F = DAG.getBitcast(MVT::v4i32, Sub);
12509 SDValue Shuffle = getTargetShuffleNode(X86ISD::PSHUFD, dl, MVT::v4i32,
12511 Result = DAG.getNode(ISD::FADD, dl, MVT::v2f64,
12512 DAG.getBitcast(MVT::v2f64, Shuffle), Sub);
12515 return DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::f64, Result,
12516 DAG.getIntPtrConstant(0, dl));
12519 // LowerUINT_TO_FP_i32 - 32-bit unsigned integer to float expansion.
12520 SDValue X86TargetLowering::LowerUINT_TO_FP_i32(SDValue Op,
12521 SelectionDAG &DAG) const {
12523 // FP constant to bias correct the final result.
12524 SDValue Bias = DAG.getConstantFP(BitsToDouble(0x4330000000000000ULL), dl,
12527 // Load the 32-bit value into an XMM register.
12528 SDValue Load = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, MVT::v4i32,
12531 // Zero out the upper parts of the register.
12532 Load = getShuffleVectorZeroOrUndef(Load, 0, true, Subtarget, DAG);
12534 Load = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::f64,
12535 DAG.getBitcast(MVT::v2f64, Load),
12536 DAG.getIntPtrConstant(0, dl));
12538 // Or the load with the bias.
12539 SDValue Or = DAG.getNode(
12540 ISD::OR, dl, MVT::v2i64,
12541 DAG.getBitcast(MVT::v2i64,
12542 DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, MVT::v2f64, Load)),
12543 DAG.getBitcast(MVT::v2i64,
12544 DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, MVT::v2f64, Bias)));
12546 DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::f64,
12547 DAG.getBitcast(MVT::v2f64, Or), DAG.getIntPtrConstant(0, dl));
12549 // Subtract the bias.
12550 // TODO: Are there any fast-math-flags to propagate here?
12551 SDValue Sub = DAG.getNode(ISD::FSUB, dl, MVT::f64, Or, Bias);
12553 // Handle final rounding.
12554 MVT DestVT = Op.getSimpleValueType();
12556 if (DestVT.bitsLT(MVT::f64))
12557 return DAG.getNode(ISD::FP_ROUND, dl, DestVT, Sub,
12558 DAG.getIntPtrConstant(0, dl));
12559 if (DestVT.bitsGT(MVT::f64))
12560 return DAG.getNode(ISD::FP_EXTEND, dl, DestVT, Sub);
12562 // Handle final rounding.
12566 static SDValue lowerUINT_TO_FP_vXi32(SDValue Op, SelectionDAG &DAG,
12567 const X86Subtarget &Subtarget) {
12568 // The algorithm is the following:
12569 // #ifdef __SSE4_1__
12570 // uint4 lo = _mm_blend_epi16( v, (uint4) 0x4b000000, 0xaa);
12571 // uint4 hi = _mm_blend_epi16( _mm_srli_epi32(v,16),
12572 // (uint4) 0x53000000, 0xaa);
12574 // uint4 lo = (v & (uint4) 0xffff) | (uint4) 0x4b000000;
12575 // uint4 hi = (v >> 16) | (uint4) 0x53000000;
12577 // float4 fhi = (float4) hi - (0x1.0p39f + 0x1.0p23f);
12578 // return (float4) lo + fhi;
12580 // We shouldn't use it when unsafe-fp-math is enabled though: we might later
12581 // reassociate the two FADDs, and if we do that, the algorithm fails
12582 // spectacularly (PR24512).
12583 // FIXME: If we ever have some kind of Machine FMF, this should be marked
12584 // as non-fast and always be enabled. Why isn't SDAG FMF enough? Because
12585 // there's also the MachineCombiner reassociations happening on Machine IR.
12586 if (DAG.getTarget().Options.UnsafeFPMath)
12590 SDValue V = Op->getOperand(0);
12591 MVT VecIntVT = V.getSimpleValueType();
12592 bool Is128 = VecIntVT == MVT::v4i32;
12593 MVT VecFloatVT = Is128 ? MVT::v4f32 : MVT::v8f32;
12594 // If we convert to something else than the supported type, e.g., to v4f64,
12596 if (VecFloatVT != Op->getSimpleValueType(0))
12599 unsigned NumElts = VecIntVT.getVectorNumElements();
12600 assert((VecIntVT == MVT::v4i32 || VecIntVT == MVT::v8i32) &&
12601 "Unsupported custom type");
12602 assert(NumElts <= 8 && "The size of the constant array must be fixed");
12604 // In the #idef/#else code, we have in common:
12605 // - The vector of constants:
12611 // Create the splat vector for 0x4b000000.
12612 SDValue CstLow = DAG.getConstant(0x4b000000, DL, MVT::i32);
12613 SDValue CstLowArray[] = {CstLow, CstLow, CstLow, CstLow,
12614 CstLow, CstLow, CstLow, CstLow};
12615 SDValue VecCstLow = DAG.getNode(ISD::BUILD_VECTOR, DL, VecIntVT,
12616 makeArrayRef(&CstLowArray[0], NumElts));
12617 // Create the splat vector for 0x53000000.
12618 SDValue CstHigh = DAG.getConstant(0x53000000, DL, MVT::i32);
12619 SDValue CstHighArray[] = {CstHigh, CstHigh, CstHigh, CstHigh,
12620 CstHigh, CstHigh, CstHigh, CstHigh};
12621 SDValue VecCstHigh = DAG.getNode(ISD::BUILD_VECTOR, DL, VecIntVT,
12622 makeArrayRef(&CstHighArray[0], NumElts));
12624 // Create the right shift.
12625 SDValue CstShift = DAG.getConstant(16, DL, MVT::i32);
12626 SDValue CstShiftArray[] = {CstShift, CstShift, CstShift, CstShift,
12627 CstShift, CstShift, CstShift, CstShift};
12628 SDValue VecCstShift = DAG.getNode(ISD::BUILD_VECTOR, DL, VecIntVT,
12629 makeArrayRef(&CstShiftArray[0], NumElts));
12630 SDValue HighShift = DAG.getNode(ISD::SRL, DL, VecIntVT, V, VecCstShift);
12633 if (Subtarget.hasSSE41()) {
12634 MVT VecI16VT = Is128 ? MVT::v8i16 : MVT::v16i16;
12635 // uint4 lo = _mm_blend_epi16( v, (uint4) 0x4b000000, 0xaa);
12636 SDValue VecCstLowBitcast = DAG.getBitcast(VecI16VT, VecCstLow);
12637 SDValue VecBitcast = DAG.getBitcast(VecI16VT, V);
12638 // Low will be bitcasted right away, so do not bother bitcasting back to its
12640 Low = DAG.getNode(X86ISD::BLENDI, DL, VecI16VT, VecBitcast,
12641 VecCstLowBitcast, DAG.getConstant(0xaa, DL, MVT::i32));
12642 // uint4 hi = _mm_blend_epi16( _mm_srli_epi32(v,16),
12643 // (uint4) 0x53000000, 0xaa);
12644 SDValue VecCstHighBitcast = DAG.getBitcast(VecI16VT, VecCstHigh);
12645 SDValue VecShiftBitcast = DAG.getBitcast(VecI16VT, HighShift);
12646 // High will be bitcasted right away, so do not bother bitcasting back to
12647 // its original type.
12648 High = DAG.getNode(X86ISD::BLENDI, DL, VecI16VT, VecShiftBitcast,
12649 VecCstHighBitcast, DAG.getConstant(0xaa, DL, MVT::i32));
12651 SDValue CstMask = DAG.getConstant(0xffff, DL, MVT::i32);
12652 SDValue VecCstMask = DAG.getNode(ISD::BUILD_VECTOR, DL, VecIntVT, CstMask,
12653 CstMask, CstMask, CstMask);
12654 // uint4 lo = (v & (uint4) 0xffff) | (uint4) 0x4b000000;
12655 SDValue LowAnd = DAG.getNode(ISD::AND, DL, VecIntVT, V, VecCstMask);
12656 Low = DAG.getNode(ISD::OR, DL, VecIntVT, LowAnd, VecCstLow);
12658 // uint4 hi = (v >> 16) | (uint4) 0x53000000;
12659 High = DAG.getNode(ISD::OR, DL, VecIntVT, HighShift, VecCstHigh);
12662 // Create the vector constant for -(0x1.0p39f + 0x1.0p23f).
12663 SDValue CstFAdd = DAG.getConstantFP(
12664 APFloat(APFloat::IEEEsingle, APInt(32, 0xD3000080)), DL, MVT::f32);
12665 SDValue CstFAddArray[] = {CstFAdd, CstFAdd, CstFAdd, CstFAdd,
12666 CstFAdd, CstFAdd, CstFAdd, CstFAdd};
12667 SDValue VecCstFAdd = DAG.getNode(ISD::BUILD_VECTOR, DL, VecFloatVT,
12668 makeArrayRef(&CstFAddArray[0], NumElts));
12670 // float4 fhi = (float4) hi - (0x1.0p39f + 0x1.0p23f);
12671 SDValue HighBitcast = DAG.getBitcast(VecFloatVT, High);
12672 // TODO: Are there any fast-math-flags to propagate here?
12674 DAG.getNode(ISD::FADD, DL, VecFloatVT, HighBitcast, VecCstFAdd);
12675 // return (float4) lo + fhi;
12676 SDValue LowBitcast = DAG.getBitcast(VecFloatVT, Low);
12677 return DAG.getNode(ISD::FADD, DL, VecFloatVT, LowBitcast, FHigh);
12680 SDValue X86TargetLowering::lowerUINT_TO_FP_vec(SDValue Op,
12681 SelectionDAG &DAG) const {
12682 SDValue N0 = Op.getOperand(0);
12683 MVT SVT = N0.getSimpleValueType();
12686 switch (SVT.SimpleTy) {
12688 llvm_unreachable("Custom UINT_TO_FP is not supported!");
12693 MVT NVT = MVT::getVectorVT(MVT::i32, SVT.getVectorNumElements());
12694 return DAG.getNode(ISD::SINT_TO_FP, dl, Op.getValueType(),
12695 DAG.getNode(ISD::ZERO_EXTEND, dl, NVT, N0));
12699 return lowerUINT_TO_FP_vXi32(Op, DAG, *Subtarget);
12702 assert(Subtarget->hasAVX512());
12703 return DAG.getNode(ISD::UINT_TO_FP, dl, Op.getValueType(),
12704 DAG.getNode(ISD::ZERO_EXTEND, dl, MVT::v16i32, N0));
12708 SDValue X86TargetLowering::LowerUINT_TO_FP(SDValue Op,
12709 SelectionDAG &DAG) const {
12710 SDValue N0 = Op.getOperand(0);
12712 auto PtrVT = getPointerTy(DAG.getDataLayout());
12714 if (Op.getSimpleValueType().isVector())
12715 return lowerUINT_TO_FP_vec(Op, DAG);
12717 // Since UINT_TO_FP is legal (it's marked custom), dag combiner won't
12718 // optimize it to a SINT_TO_FP when the sign bit is known zero. Perform
12719 // the optimization here.
12720 if (DAG.SignBitIsZero(N0))
12721 return DAG.getNode(ISD::SINT_TO_FP, dl, Op.getValueType(), N0);
12723 MVT SrcVT = N0.getSimpleValueType();
12724 MVT DstVT = Op.getSimpleValueType();
12726 if (Subtarget->hasAVX512() && isScalarFPTypeInSSEReg(DstVT) &&
12727 (SrcVT == MVT::i32 || (SrcVT == MVT::i64 && Subtarget->is64Bit()))) {
12728 // Conversions from unsigned i32 to f32/f64 are legal,
12729 // using VCVTUSI2SS/SD. Same for i64 in 64-bit mode.
12733 if (SrcVT == MVT::i64 && DstVT == MVT::f64 && X86ScalarSSEf64)
12734 return LowerUINT_TO_FP_i64(Op, DAG);
12735 if (SrcVT == MVT::i32 && X86ScalarSSEf64)
12736 return LowerUINT_TO_FP_i32(Op, DAG);
12737 if (Subtarget->is64Bit() && SrcVT == MVT::i64 && DstVT == MVT::f32)
12740 // Make a 64-bit buffer, and use it to build an FILD.
12741 SDValue StackSlot = DAG.CreateStackTemporary(MVT::i64);
12742 if (SrcVT == MVT::i32) {
12743 SDValue WordOff = DAG.getConstant(4, dl, PtrVT);
12744 SDValue OffsetSlot = DAG.getNode(ISD::ADD, dl, PtrVT, StackSlot, WordOff);
12745 SDValue Store1 = DAG.getStore(DAG.getEntryNode(), dl, Op.getOperand(0),
12746 StackSlot, MachinePointerInfo(),
12748 SDValue Store2 = DAG.getStore(Store1, dl, DAG.getConstant(0, dl, MVT::i32),
12749 OffsetSlot, MachinePointerInfo(),
12751 SDValue Fild = BuildFILD(Op, MVT::i64, Store2, StackSlot, DAG);
12755 assert(SrcVT == MVT::i64 && "Unexpected type in UINT_TO_FP");
12756 SDValue Store = DAG.getStore(DAG.getEntryNode(), dl, Op.getOperand(0),
12757 StackSlot, MachinePointerInfo(),
12759 // For i64 source, we need to add the appropriate power of 2 if the input
12760 // was negative. This is the same as the optimization in
12761 // DAGTypeLegalizer::ExpandIntOp_UNIT_TO_FP, and for it to be safe here,
12762 // we must be careful to do the computation in x87 extended precision, not
12763 // in SSE. (The generic code can't know it's OK to do this, or how to.)
12764 int SSFI = cast<FrameIndexSDNode>(StackSlot)->getIndex();
12765 MachineMemOperand *MMO = DAG.getMachineFunction().getMachineMemOperand(
12766 MachinePointerInfo::getFixedStack(DAG.getMachineFunction(), SSFI),
12767 MachineMemOperand::MOLoad, 8, 8);
12769 SDVTList Tys = DAG.getVTList(MVT::f80, MVT::Other);
12770 SDValue Ops[] = { Store, StackSlot, DAG.getValueType(MVT::i64) };
12771 SDValue Fild = DAG.getMemIntrinsicNode(X86ISD::FILD, dl, Tys, Ops,
12774 APInt FF(32, 0x5F800000ULL);
12776 // Check whether the sign bit is set.
12777 SDValue SignSet = DAG.getSetCC(
12778 dl, getSetCCResultType(DAG.getDataLayout(), *DAG.getContext(), MVT::i64),
12779 Op.getOperand(0), DAG.getConstant(0, dl, MVT::i64), ISD::SETLT);
12781 // Build a 64 bit pair (0, FF) in the constant pool, with FF in the lo bits.
12782 SDValue FudgePtr = DAG.getConstantPool(
12783 ConstantInt::get(*DAG.getContext(), FF.zext(64)), PtrVT);
12785 // Get a pointer to FF if the sign bit was set, or to 0 otherwise.
12786 SDValue Zero = DAG.getIntPtrConstant(0, dl);
12787 SDValue Four = DAG.getIntPtrConstant(4, dl);
12788 SDValue Offset = DAG.getNode(ISD::SELECT, dl, Zero.getValueType(), SignSet,
12790 FudgePtr = DAG.getNode(ISD::ADD, dl, PtrVT, FudgePtr, Offset);
12792 // Load the value out, extending it from f32 to f80.
12793 // FIXME: Avoid the extend by constructing the right constant pool?
12794 SDValue Fudge = DAG.getExtLoad(
12795 ISD::EXTLOAD, dl, MVT::f80, DAG.getEntryNode(), FudgePtr,
12796 MachinePointerInfo::getConstantPool(DAG.getMachineFunction()), MVT::f32,
12797 false, false, false, 4);
12798 // Extend everything to 80 bits to force it to be done on x87.
12799 // TODO: Are there any fast-math-flags to propagate here?
12800 SDValue Add = DAG.getNode(ISD::FADD, dl, MVT::f80, Fild, Fudge);
12801 return DAG.getNode(ISD::FP_ROUND, dl, DstVT, Add,
12802 DAG.getIntPtrConstant(0, dl));
12805 // If the given FP_TO_SINT (IsSigned) or FP_TO_UINT (!IsSigned) operation
12806 // is legal, or has an fp128 or f16 source (which needs to be promoted to f32),
12807 // just return an <SDValue(), SDValue()> pair.
12808 // Otherwise it is assumed to be a conversion from one of f32, f64 or f80
12809 // to i16, i32 or i64, and we lower it to a legal sequence.
12810 // If lowered to the final integer result we return a <result, SDValue()> pair.
12811 // Otherwise we lower it to a sequence ending with a FIST, return a
12812 // <FIST, StackSlot> pair, and the caller is responsible for loading
12813 // the final integer result from StackSlot.
12814 std::pair<SDValue,SDValue>
12815 X86TargetLowering::FP_TO_INTHelper(SDValue Op, SelectionDAG &DAG,
12816 bool IsSigned, bool IsReplace) const {
12819 EVT DstTy = Op.getValueType();
12820 EVT TheVT = Op.getOperand(0).getValueType();
12821 auto PtrVT = getPointerTy(DAG.getDataLayout());
12823 if (TheVT != MVT::f32 && TheVT != MVT::f64 && TheVT != MVT::f80) {
12824 // f16 must be promoted before using the lowering in this routine.
12825 // fp128 does not use this lowering.
12826 return std::make_pair(SDValue(), SDValue());
12829 // If using FIST to compute an unsigned i64, we'll need some fixup
12830 // to handle values above the maximum signed i64. A FIST is always
12831 // used for the 32-bit subtarget, but also for f80 on a 64-bit target.
12832 bool UnsignedFixup = !IsSigned &&
12833 DstTy == MVT::i64 &&
12834 (!Subtarget->is64Bit() ||
12835 !isScalarFPTypeInSSEReg(TheVT));
12837 if (!IsSigned && DstTy != MVT::i64 && !Subtarget->hasAVX512()) {
12838 // Replace the fp-to-uint32 operation with an fp-to-sint64 FIST.
12839 // The low 32 bits of the fist result will have the correct uint32 result.
12840 assert(DstTy == MVT::i32 && "Unexpected FP_TO_UINT");
12844 assert(DstTy.getSimpleVT() <= MVT::i64 &&
12845 DstTy.getSimpleVT() >= MVT::i16 &&
12846 "Unknown FP_TO_INT to lower!");
12848 // These are really Legal.
12849 if (DstTy == MVT::i32 &&
12850 isScalarFPTypeInSSEReg(Op.getOperand(0).getValueType()))
12851 return std::make_pair(SDValue(), SDValue());
12852 if (Subtarget->is64Bit() &&
12853 DstTy == MVT::i64 &&
12854 isScalarFPTypeInSSEReg(Op.getOperand(0).getValueType()))
12855 return std::make_pair(SDValue(), SDValue());
12857 // We lower FP->int64 into FISTP64 followed by a load from a temporary
12859 MachineFunction &MF = DAG.getMachineFunction();
12860 unsigned MemSize = DstTy.getSizeInBits()/8;
12861 int SSFI = MF.getFrameInfo()->CreateStackObject(MemSize, MemSize, false);
12862 SDValue StackSlot = DAG.getFrameIndex(SSFI, PtrVT);
12865 switch (DstTy.getSimpleVT().SimpleTy) {
12866 default: llvm_unreachable("Invalid FP_TO_SINT to lower!");
12867 case MVT::i16: Opc = X86ISD::FP_TO_INT16_IN_MEM; break;
12868 case MVT::i32: Opc = X86ISD::FP_TO_INT32_IN_MEM; break;
12869 case MVT::i64: Opc = X86ISD::FP_TO_INT64_IN_MEM; break;
12872 SDValue Chain = DAG.getEntryNode();
12873 SDValue Value = Op.getOperand(0);
12874 SDValue Adjust; // 0x0 or 0x80000000, for result sign bit adjustment.
12876 if (UnsignedFixup) {
12878 // Conversion to unsigned i64 is implemented with a select,
12879 // depending on whether the source value fits in the range
12880 // of a signed i64. Let Thresh be the FP equivalent of
12881 // 0x8000000000000000ULL.
12883 // Adjust i32 = (Value < Thresh) ? 0 : 0x80000000;
12884 // FistSrc = (Value < Thresh) ? Value : (Value - Thresh);
12885 // Fist-to-mem64 FistSrc
12886 // Add 0 or 0x800...0ULL to the 64-bit result, which is equivalent
12887 // to XOR'ing the high 32 bits with Adjust.
12889 // Being a power of 2, Thresh is exactly representable in all FP formats.
12890 // For X87 we'd like to use the smallest FP type for this constant, but
12891 // for DAG type consistency we have to match the FP operand type.
12893 APFloat Thresh(APFloat::IEEEsingle, APInt(32, 0x5f000000));
12894 LLVM_ATTRIBUTE_UNUSED APFloat::opStatus Status = APFloat::opOK;
12895 bool LosesInfo = false;
12896 if (TheVT == MVT::f64)
12897 // The rounding mode is irrelevant as the conversion should be exact.
12898 Status = Thresh.convert(APFloat::IEEEdouble, APFloat::rmNearestTiesToEven,
12900 else if (TheVT == MVT::f80)
12901 Status = Thresh.convert(APFloat::x87DoubleExtended,
12902 APFloat::rmNearestTiesToEven, &LosesInfo);
12904 assert(Status == APFloat::opOK && !LosesInfo &&
12905 "FP conversion should have been exact");
12907 SDValue ThreshVal = DAG.getConstantFP(Thresh, DL, TheVT);
12909 SDValue Cmp = DAG.getSetCC(DL,
12910 getSetCCResultType(DAG.getDataLayout(),
12911 *DAG.getContext(), TheVT),
12912 Value, ThreshVal, ISD::SETLT);
12913 Adjust = DAG.getSelect(DL, MVT::i32, Cmp,
12914 DAG.getConstant(0, DL, MVT::i32),
12915 DAG.getConstant(0x80000000, DL, MVT::i32));
12916 SDValue Sub = DAG.getNode(ISD::FSUB, DL, TheVT, Value, ThreshVal);
12917 Cmp = DAG.getSetCC(DL, getSetCCResultType(DAG.getDataLayout(),
12918 *DAG.getContext(), TheVT),
12919 Value, ThreshVal, ISD::SETLT);
12920 Value = DAG.getSelect(DL, TheVT, Cmp, Value, Sub);
12923 // FIXME This causes a redundant load/store if the SSE-class value is already
12924 // in memory, such as if it is on the callstack.
12925 if (isScalarFPTypeInSSEReg(TheVT)) {
12926 assert(DstTy == MVT::i64 && "Invalid FP_TO_SINT to lower!");
12927 Chain = DAG.getStore(Chain, DL, Value, StackSlot,
12928 MachinePointerInfo::getFixedStack(MF, SSFI), false,
12930 SDVTList Tys = DAG.getVTList(Op.getOperand(0).getValueType(), MVT::Other);
12932 Chain, StackSlot, DAG.getValueType(TheVT)
12935 MachineMemOperand *MMO =
12936 MF.getMachineMemOperand(MachinePointerInfo::getFixedStack(MF, SSFI),
12937 MachineMemOperand::MOLoad, MemSize, MemSize);
12938 Value = DAG.getMemIntrinsicNode(X86ISD::FLD, DL, Tys, Ops, DstTy, MMO);
12939 Chain = Value.getValue(1);
12940 SSFI = MF.getFrameInfo()->CreateStackObject(MemSize, MemSize, false);
12941 StackSlot = DAG.getFrameIndex(SSFI, PtrVT);
12944 MachineMemOperand *MMO =
12945 MF.getMachineMemOperand(MachinePointerInfo::getFixedStack(MF, SSFI),
12946 MachineMemOperand::MOStore, MemSize, MemSize);
12948 if (UnsignedFixup) {
12950 // Insert the FIST, load its result as two i32's,
12951 // and XOR the high i32 with Adjust.
12953 SDValue FistOps[] = { Chain, Value, StackSlot };
12954 SDValue FIST = DAG.getMemIntrinsicNode(Opc, DL, DAG.getVTList(MVT::Other),
12955 FistOps, DstTy, MMO);
12957 SDValue Low32 = DAG.getLoad(MVT::i32, DL, FIST, StackSlot,
12958 MachinePointerInfo(),
12959 false, false, false, 0);
12960 SDValue HighAddr = DAG.getNode(ISD::ADD, DL, PtrVT, StackSlot,
12961 DAG.getConstant(4, DL, PtrVT));
12963 SDValue High32 = DAG.getLoad(MVT::i32, DL, FIST, HighAddr,
12964 MachinePointerInfo(),
12965 false, false, false, 0);
12966 High32 = DAG.getNode(ISD::XOR, DL, MVT::i32, High32, Adjust);
12968 if (Subtarget->is64Bit()) {
12969 // Join High32 and Low32 into a 64-bit result.
12970 // (High32 << 32) | Low32
12971 Low32 = DAG.getNode(ISD::ZERO_EXTEND, DL, MVT::i64, Low32);
12972 High32 = DAG.getNode(ISD::ANY_EXTEND, DL, MVT::i64, High32);
12973 High32 = DAG.getNode(ISD::SHL, DL, MVT::i64, High32,
12974 DAG.getConstant(32, DL, MVT::i8));
12975 SDValue Result = DAG.getNode(ISD::OR, DL, MVT::i64, High32, Low32);
12976 return std::make_pair(Result, SDValue());
12979 SDValue ResultOps[] = { Low32, High32 };
12981 SDValue pair = IsReplace
12982 ? DAG.getNode(ISD::BUILD_PAIR, DL, MVT::i64, ResultOps)
12983 : DAG.getMergeValues(ResultOps, DL);
12984 return std::make_pair(pair, SDValue());
12986 // Build the FP_TO_INT*_IN_MEM
12987 SDValue Ops[] = { Chain, Value, StackSlot };
12988 SDValue FIST = DAG.getMemIntrinsicNode(Opc, DL, DAG.getVTList(MVT::Other),
12990 return std::make_pair(FIST, StackSlot);
12994 static SDValue LowerAVXExtend(SDValue Op, SelectionDAG &DAG,
12995 const X86Subtarget *Subtarget) {
12996 MVT VT = Op->getSimpleValueType(0);
12997 SDValue In = Op->getOperand(0);
12998 MVT InVT = In.getSimpleValueType();
13001 if (VT.is512BitVector() || InVT.getVectorElementType() == MVT::i1)
13002 return DAG.getNode(ISD::ZERO_EXTEND, dl, VT, In);
13004 // Optimize vectors in AVX mode:
13007 // Use vpunpcklwd for 4 lower elements v8i16 -> v4i32.
13008 // Use vpunpckhwd for 4 upper elements v8i16 -> v4i32.
13009 // Concat upper and lower parts.
13012 // Use vpunpckldq for 4 lower elements v4i32 -> v2i64.
13013 // Use vpunpckhdq for 4 upper elements v4i32 -> v2i64.
13014 // Concat upper and lower parts.
13017 if (((VT != MVT::v16i16) || (InVT != MVT::v16i8)) &&
13018 ((VT != MVT::v8i32) || (InVT != MVT::v8i16)) &&
13019 ((VT != MVT::v4i64) || (InVT != MVT::v4i32)))
13022 if (Subtarget->hasInt256())
13023 return DAG.getNode(X86ISD::VZEXT, dl, VT, In);
13025 SDValue ZeroVec = getZeroVector(InVT, Subtarget, DAG, dl);
13026 SDValue Undef = DAG.getUNDEF(InVT);
13027 bool NeedZero = Op.getOpcode() == ISD::ZERO_EXTEND;
13028 SDValue OpLo = getUnpackl(DAG, dl, InVT, In, NeedZero ? ZeroVec : Undef);
13029 SDValue OpHi = getUnpackh(DAG, dl, InVT, In, NeedZero ? ZeroVec : Undef);
13031 MVT HVT = MVT::getVectorVT(VT.getVectorElementType(),
13032 VT.getVectorNumElements()/2);
13034 OpLo = DAG.getBitcast(HVT, OpLo);
13035 OpHi = DAG.getBitcast(HVT, OpHi);
13037 return DAG.getNode(ISD::CONCAT_VECTORS, dl, VT, OpLo, OpHi);
13040 static SDValue LowerZERO_EXTEND_AVX512(SDValue Op,
13041 const X86Subtarget *Subtarget, SelectionDAG &DAG) {
13042 MVT VT = Op->getSimpleValueType(0);
13043 SDValue In = Op->getOperand(0);
13044 MVT InVT = In.getSimpleValueType();
13046 unsigned int NumElts = VT.getVectorNumElements();
13047 if (NumElts != 8 && NumElts != 16 && !Subtarget->hasBWI())
13050 if (VT.is512BitVector() && InVT.getVectorElementType() != MVT::i1)
13051 return DAG.getNode(X86ISD::VZEXT, DL, VT, In);
13053 assert(InVT.getVectorElementType() == MVT::i1);
13054 MVT ExtVT = NumElts == 8 ? MVT::v8i64 : MVT::v16i32;
13056 DAG.getConstant(APInt(ExtVT.getScalarSizeInBits(), 1), DL, ExtVT);
13058 DAG.getConstant(APInt::getNullValue(ExtVT.getScalarSizeInBits()), DL, ExtVT);
13060 SDValue V = DAG.getNode(ISD::VSELECT, DL, ExtVT, In, One, Zero);
13061 if (VT.is512BitVector())
13063 return DAG.getNode(X86ISD::VTRUNC, DL, VT, V);
13066 static SDValue LowerANY_EXTEND(SDValue Op, const X86Subtarget *Subtarget,
13067 SelectionDAG &DAG) {
13068 if (Subtarget->hasFp256())
13069 if (SDValue Res = LowerAVXExtend(Op, DAG, Subtarget))
13075 static SDValue LowerZERO_EXTEND(SDValue Op, const X86Subtarget *Subtarget,
13076 SelectionDAG &DAG) {
13078 MVT VT = Op.getSimpleValueType();
13079 SDValue In = Op.getOperand(0);
13080 MVT SVT = In.getSimpleValueType();
13082 if (VT.is512BitVector() || SVT.getVectorElementType() == MVT::i1)
13083 return LowerZERO_EXTEND_AVX512(Op, Subtarget, DAG);
13085 if (Subtarget->hasFp256())
13086 if (SDValue Res = LowerAVXExtend(Op, DAG, Subtarget))
13089 assert(!VT.is256BitVector() || !SVT.is128BitVector() ||
13090 VT.getVectorNumElements() != SVT.getVectorNumElements());
13094 SDValue X86TargetLowering::LowerTRUNCATE(SDValue Op, SelectionDAG &DAG) const {
13096 MVT VT = Op.getSimpleValueType();
13097 SDValue In = Op.getOperand(0);
13098 MVT InVT = In.getSimpleValueType();
13100 if (VT == MVT::i1) {
13101 assert((InVT.isInteger() && (InVT.getSizeInBits() <= 64)) &&
13102 "Invalid scalar TRUNCATE operation");
13103 if (InVT.getSizeInBits() >= 32)
13105 In = DAG.getNode(ISD::ANY_EXTEND, DL, MVT::i32, In);
13106 return DAG.getNode(ISD::TRUNCATE, DL, VT, In);
13108 assert(VT.getVectorNumElements() == InVT.getVectorNumElements() &&
13109 "Invalid TRUNCATE operation");
13111 // move vector to mask - truncate solution for SKX
13112 if (VT.getVectorElementType() == MVT::i1) {
13113 if (InVT.is512BitVector() && InVT.getScalarSizeInBits() <= 16 &&
13114 Subtarget->hasBWI())
13115 return Op; // legal, will go to VPMOVB2M, VPMOVW2M
13116 if ((InVT.is256BitVector() || InVT.is128BitVector())
13117 && InVT.getScalarSizeInBits() <= 16 &&
13118 Subtarget->hasBWI() && Subtarget->hasVLX())
13119 return Op; // legal, will go to VPMOVB2M, VPMOVW2M
13120 if (InVT.is512BitVector() && InVT.getScalarSizeInBits() >= 32 &&
13121 Subtarget->hasDQI())
13122 return Op; // legal, will go to VPMOVD2M, VPMOVQ2M
13123 if ((InVT.is256BitVector() || InVT.is128BitVector())
13124 && InVT.getScalarSizeInBits() >= 32 &&
13125 Subtarget->hasDQI() && Subtarget->hasVLX())
13126 return Op; // legal, will go to VPMOVB2M, VPMOVQ2M
13129 if (VT.getVectorElementType() == MVT::i1) {
13130 assert(VT.getVectorElementType() == MVT::i1 && "Unexpected vector type");
13131 unsigned NumElts = InVT.getVectorNumElements();
13132 assert ((NumElts == 8 || NumElts == 16) && "Unexpected vector type");
13133 if (InVT.getSizeInBits() < 512) {
13134 MVT ExtVT = (NumElts == 16)? MVT::v16i32 : MVT::v8i64;
13135 In = DAG.getNode(ISD::SIGN_EXTEND, DL, ExtVT, In);
13140 DAG.getConstant(APInt::getSignBit(InVT.getScalarSizeInBits()), DL, InVT);
13141 SDValue And = DAG.getNode(ISD::AND, DL, InVT, OneV, In);
13142 return DAG.getNode(X86ISD::TESTM, DL, VT, And, And);
13145 // vpmovqb/w/d, vpmovdb/w, vpmovwb
13146 if (Subtarget->hasAVX512()) {
13147 // word to byte only under BWI
13148 if (InVT == MVT::v16i16 && !Subtarget->hasBWI()) // v16i16 -> v16i8
13149 return DAG.getNode(X86ISD::VTRUNC, DL, VT,
13150 DAG.getNode(X86ISD::VSEXT, DL, MVT::v16i32, In));
13151 return DAG.getNode(X86ISD::VTRUNC, DL, VT, In);
13153 if ((VT == MVT::v4i32) && (InVT == MVT::v4i64)) {
13154 // On AVX2, v4i64 -> v4i32 becomes VPERMD.
13155 if (Subtarget->hasInt256()) {
13156 static const int ShufMask[] = {0, 2, 4, 6, -1, -1, -1, -1};
13157 In = DAG.getBitcast(MVT::v8i32, In);
13158 In = DAG.getVectorShuffle(MVT::v8i32, DL, In, DAG.getUNDEF(MVT::v8i32),
13160 return DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, VT, In,
13161 DAG.getIntPtrConstant(0, DL));
13164 SDValue OpLo = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, MVT::v2i64, In,
13165 DAG.getIntPtrConstant(0, DL));
13166 SDValue OpHi = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, MVT::v2i64, In,
13167 DAG.getIntPtrConstant(2, DL));
13168 OpLo = DAG.getBitcast(MVT::v4i32, OpLo);
13169 OpHi = DAG.getBitcast(MVT::v4i32, OpHi);
13170 static const int ShufMask[] = {0, 2, 4, 6};
13171 return DAG.getVectorShuffle(VT, DL, OpLo, OpHi, ShufMask);
13174 if ((VT == MVT::v8i16) && (InVT == MVT::v8i32)) {
13175 // On AVX2, v8i32 -> v8i16 becomed PSHUFB.
13176 if (Subtarget->hasInt256()) {
13177 In = DAG.getBitcast(MVT::v32i8, In);
13179 SmallVector<SDValue,32> pshufbMask;
13180 for (unsigned i = 0; i < 2; ++i) {
13181 pshufbMask.push_back(DAG.getConstant(0x0, DL, MVT::i8));
13182 pshufbMask.push_back(DAG.getConstant(0x1, DL, MVT::i8));
13183 pshufbMask.push_back(DAG.getConstant(0x4, DL, MVT::i8));
13184 pshufbMask.push_back(DAG.getConstant(0x5, DL, MVT::i8));
13185 pshufbMask.push_back(DAG.getConstant(0x8, DL, MVT::i8));
13186 pshufbMask.push_back(DAG.getConstant(0x9, DL, MVT::i8));
13187 pshufbMask.push_back(DAG.getConstant(0xc, DL, MVT::i8));
13188 pshufbMask.push_back(DAG.getConstant(0xd, DL, MVT::i8));
13189 for (unsigned j = 0; j < 8; ++j)
13190 pshufbMask.push_back(DAG.getConstant(0x80, DL, MVT::i8));
13192 SDValue BV = DAG.getNode(ISD::BUILD_VECTOR, DL, MVT::v32i8, pshufbMask);
13193 In = DAG.getNode(X86ISD::PSHUFB, DL, MVT::v32i8, In, BV);
13194 In = DAG.getBitcast(MVT::v4i64, In);
13196 static const int ShufMask[] = {0, 2, -1, -1};
13197 In = DAG.getVectorShuffle(MVT::v4i64, DL, In, DAG.getUNDEF(MVT::v4i64),
13199 In = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, MVT::v2i64, In,
13200 DAG.getIntPtrConstant(0, DL));
13201 return DAG.getBitcast(VT, In);
13204 SDValue OpLo = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, MVT::v4i32, In,
13205 DAG.getIntPtrConstant(0, DL));
13207 SDValue OpHi = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, MVT::v4i32, In,
13208 DAG.getIntPtrConstant(4, DL));
13210 OpLo = DAG.getBitcast(MVT::v16i8, OpLo);
13211 OpHi = DAG.getBitcast(MVT::v16i8, OpHi);
13213 // The PSHUFB mask:
13214 static const int ShufMask1[] = {0, 1, 4, 5, 8, 9, 12, 13,
13215 -1, -1, -1, -1, -1, -1, -1, -1};
13217 SDValue Undef = DAG.getUNDEF(MVT::v16i8);
13218 OpLo = DAG.getVectorShuffle(MVT::v16i8, DL, OpLo, Undef, ShufMask1);
13219 OpHi = DAG.getVectorShuffle(MVT::v16i8, DL, OpHi, Undef, ShufMask1);
13221 OpLo = DAG.getBitcast(MVT::v4i32, OpLo);
13222 OpHi = DAG.getBitcast(MVT::v4i32, OpHi);
13224 // The MOVLHPS Mask:
13225 static const int ShufMask2[] = {0, 1, 4, 5};
13226 SDValue res = DAG.getVectorShuffle(MVT::v4i32, DL, OpLo, OpHi, ShufMask2);
13227 return DAG.getBitcast(MVT::v8i16, res);
13230 // Handle truncation of V256 to V128 using shuffles.
13231 if (!VT.is128BitVector() || !InVT.is256BitVector())
13234 assert(Subtarget->hasFp256() && "256-bit vector without AVX!");
13236 unsigned NumElems = VT.getVectorNumElements();
13237 MVT NVT = MVT::getVectorVT(VT.getVectorElementType(), NumElems * 2);
13239 SmallVector<int, 16> MaskVec(NumElems * 2, -1);
13240 // Prepare truncation shuffle mask
13241 for (unsigned i = 0; i != NumElems; ++i)
13242 MaskVec[i] = i * 2;
13243 SDValue V = DAG.getVectorShuffle(NVT, DL, DAG.getBitcast(NVT, In),
13244 DAG.getUNDEF(NVT), &MaskVec[0]);
13245 return DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, VT, V,
13246 DAG.getIntPtrConstant(0, DL));
13249 SDValue X86TargetLowering::LowerFP_TO_SINT(SDValue Op,
13250 SelectionDAG &DAG) const {
13251 assert(!Op.getSimpleValueType().isVector());
13253 std::pair<SDValue,SDValue> Vals = FP_TO_INTHelper(Op, DAG,
13254 /*IsSigned=*/ true, /*IsReplace=*/ false);
13255 SDValue FIST = Vals.first, StackSlot = Vals.second;
13256 // If FP_TO_INTHelper failed, the node is actually supposed to be Legal.
13257 if (!FIST.getNode())
13260 if (StackSlot.getNode())
13261 // Load the result.
13262 return DAG.getLoad(Op.getValueType(), SDLoc(Op),
13263 FIST, StackSlot, MachinePointerInfo(),
13264 false, false, false, 0);
13266 // The node is the result.
13270 SDValue X86TargetLowering::LowerFP_TO_UINT(SDValue Op,
13271 SelectionDAG &DAG) const {
13272 std::pair<SDValue,SDValue> Vals = FP_TO_INTHelper(Op, DAG,
13273 /*IsSigned=*/ false, /*IsReplace=*/ false);
13274 SDValue FIST = Vals.first, StackSlot = Vals.second;
13275 // If FP_TO_INTHelper failed, the node is actually supposed to be Legal.
13276 if (!FIST.getNode())
13279 if (StackSlot.getNode())
13280 // Load the result.
13281 return DAG.getLoad(Op.getValueType(), SDLoc(Op),
13282 FIST, StackSlot, MachinePointerInfo(),
13283 false, false, false, 0);
13285 // The node is the result.
13289 static SDValue LowerFP_EXTEND(SDValue Op, SelectionDAG &DAG) {
13291 MVT VT = Op.getSimpleValueType();
13292 SDValue In = Op.getOperand(0);
13293 MVT SVT = In.getSimpleValueType();
13295 assert(SVT == MVT::v2f32 && "Only customize MVT::v2f32 type legalization!");
13297 return DAG.getNode(X86ISD::VFPEXT, DL, VT,
13298 DAG.getNode(ISD::CONCAT_VECTORS, DL, MVT::v4f32,
13299 In, DAG.getUNDEF(SVT)));
13302 /// The only differences between FABS and FNEG are the mask and the logic op.
13303 /// FNEG also has a folding opportunity for FNEG(FABS(x)).
13304 static SDValue LowerFABSorFNEG(SDValue Op, SelectionDAG &DAG) {
13305 assert((Op.getOpcode() == ISD::FABS || Op.getOpcode() == ISD::FNEG) &&
13306 "Wrong opcode for lowering FABS or FNEG.");
13308 bool IsFABS = (Op.getOpcode() == ISD::FABS);
13310 // If this is a FABS and it has an FNEG user, bail out to fold the combination
13311 // into an FNABS. We'll lower the FABS after that if it is still in use.
13313 for (SDNode *User : Op->uses())
13314 if (User->getOpcode() == ISD::FNEG)
13318 MVT VT = Op.getSimpleValueType();
13320 // FIXME: Use function attribute "OptimizeForSize" and/or CodeGenOpt::Level to
13321 // decide if we should generate a 16-byte constant mask when we only need 4 or
13322 // 8 bytes for the scalar case.
13328 if (VT.isVector()) {
13330 EltVT = VT.getVectorElementType();
13331 NumElts = VT.getVectorNumElements();
13333 // There are no scalar bitwise logical SSE/AVX instructions, so we
13334 // generate a 16-byte vector constant and logic op even for the scalar case.
13335 // Using a 16-byte mask allows folding the load of the mask with
13336 // the logic op, so it can save (~4 bytes) on code size.
13337 LogicVT = (VT == MVT::f64) ? MVT::v2f64 : MVT::v4f32;
13339 NumElts = (VT == MVT::f64) ? 2 : 4;
13342 unsigned EltBits = EltVT.getSizeInBits();
13343 LLVMContext *Context = DAG.getContext();
13344 // For FABS, mask is 0x7f...; for FNEG, mask is 0x80...
13346 IsFABS ? APInt::getSignedMaxValue(EltBits) : APInt::getSignBit(EltBits);
13347 Constant *C = ConstantInt::get(*Context, MaskElt);
13348 C = ConstantVector::getSplat(NumElts, C);
13349 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
13350 SDValue CPIdx = DAG.getConstantPool(C, TLI.getPointerTy(DAG.getDataLayout()));
13351 unsigned Alignment = cast<ConstantPoolSDNode>(CPIdx)->getAlignment();
13353 DAG.getLoad(LogicVT, dl, DAG.getEntryNode(), CPIdx,
13354 MachinePointerInfo::getConstantPool(DAG.getMachineFunction()),
13355 false, false, false, Alignment);
13357 SDValue Op0 = Op.getOperand(0);
13358 bool IsFNABS = !IsFABS && (Op0.getOpcode() == ISD::FABS);
13360 IsFABS ? X86ISD::FAND : IsFNABS ? X86ISD::FOR : X86ISD::FXOR;
13361 SDValue Operand = IsFNABS ? Op0.getOperand(0) : Op0;
13364 return DAG.getNode(LogicOp, dl, LogicVT, Operand, Mask);
13366 // For the scalar case extend to a 128-bit vector, perform the logic op,
13367 // and extract the scalar result back out.
13368 Operand = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, LogicVT, Operand);
13369 SDValue LogicNode = DAG.getNode(LogicOp, dl, LogicVT, Operand, Mask);
13370 return DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, VT, LogicNode,
13371 DAG.getIntPtrConstant(0, dl));
13374 static SDValue LowerFCOPYSIGN(SDValue Op, SelectionDAG &DAG) {
13375 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
13376 LLVMContext *Context = DAG.getContext();
13377 SDValue Op0 = Op.getOperand(0);
13378 SDValue Op1 = Op.getOperand(1);
13380 MVT VT = Op.getSimpleValueType();
13381 MVT SrcVT = Op1.getSimpleValueType();
13383 // If second operand is smaller, extend it first.
13384 if (SrcVT.bitsLT(VT)) {
13385 Op1 = DAG.getNode(ISD::FP_EXTEND, dl, VT, Op1);
13388 // And if it is bigger, shrink it first.
13389 if (SrcVT.bitsGT(VT)) {
13390 Op1 = DAG.getNode(ISD::FP_ROUND, dl, VT, Op1, DAG.getIntPtrConstant(1, dl));
13394 // At this point the operands and the result should have the same
13395 // type, and that won't be f80 since that is not custom lowered.
13397 const fltSemantics &Sem =
13398 VT == MVT::f64 ? APFloat::IEEEdouble : APFloat::IEEEsingle;
13399 const unsigned SizeInBits = VT.getSizeInBits();
13401 SmallVector<Constant *, 4> CV(
13402 VT == MVT::f64 ? 2 : 4,
13403 ConstantFP::get(*Context, APFloat(Sem, APInt(SizeInBits, 0))));
13405 // First, clear all bits but the sign bit from the second operand (sign).
13406 CV[0] = ConstantFP::get(*Context,
13407 APFloat(Sem, APInt::getHighBitsSet(SizeInBits, 1)));
13408 Constant *C = ConstantVector::get(CV);
13409 auto PtrVT = TLI.getPointerTy(DAG.getDataLayout());
13410 SDValue CPIdx = DAG.getConstantPool(C, PtrVT, 16);
13412 // Perform all logic operations as 16-byte vectors because there are no
13413 // scalar FP logic instructions in SSE. This allows load folding of the
13414 // constants into the logic instructions.
13415 MVT LogicVT = (VT == MVT::f64) ? MVT::v2f64 : MVT::v4f32;
13417 DAG.getLoad(LogicVT, dl, DAG.getEntryNode(), CPIdx,
13418 MachinePointerInfo::getConstantPool(DAG.getMachineFunction()),
13419 false, false, false, 16);
13420 Op1 = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, LogicVT, Op1);
13421 SDValue SignBit = DAG.getNode(X86ISD::FAND, dl, LogicVT, Op1, Mask1);
13423 // Next, clear the sign bit from the first operand (magnitude).
13424 // If it's a constant, we can clear it here.
13425 if (ConstantFPSDNode *Op0CN = dyn_cast<ConstantFPSDNode>(Op0)) {
13426 APFloat APF = Op0CN->getValueAPF();
13427 // If the magnitude is a positive zero, the sign bit alone is enough.
13428 if (APF.isPosZero())
13429 return DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, SrcVT, SignBit,
13430 DAG.getIntPtrConstant(0, dl));
13432 CV[0] = ConstantFP::get(*Context, APF);
13434 CV[0] = ConstantFP::get(
13436 APFloat(Sem, APInt::getLowBitsSet(SizeInBits, SizeInBits - 1)));
13438 C = ConstantVector::get(CV);
13439 CPIdx = DAG.getConstantPool(C, PtrVT, 16);
13441 DAG.getLoad(LogicVT, dl, DAG.getEntryNode(), CPIdx,
13442 MachinePointerInfo::getConstantPool(DAG.getMachineFunction()),
13443 false, false, false, 16);
13444 // If the magnitude operand wasn't a constant, we need to AND out the sign.
13445 if (!isa<ConstantFPSDNode>(Op0)) {
13446 Op0 = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, LogicVT, Op0);
13447 Val = DAG.getNode(X86ISD::FAND, dl, LogicVT, Op0, Val);
13449 // OR the magnitude value with the sign bit.
13450 Val = DAG.getNode(X86ISD::FOR, dl, LogicVT, Val, SignBit);
13451 return DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, SrcVT, Val,
13452 DAG.getIntPtrConstant(0, dl));
13455 static SDValue LowerFGETSIGN(SDValue Op, SelectionDAG &DAG) {
13456 SDValue N0 = Op.getOperand(0);
13458 MVT VT = Op.getSimpleValueType();
13460 // Lower ISD::FGETSIGN to (AND (X86ISD::FGETSIGNx86 ...) 1).
13461 SDValue xFGETSIGN = DAG.getNode(X86ISD::FGETSIGNx86, dl, VT, N0,
13462 DAG.getConstant(1, dl, VT));
13463 return DAG.getNode(ISD::AND, dl, VT, xFGETSIGN, DAG.getConstant(1, dl, VT));
13466 // Check whether an OR'd tree is PTEST-able.
13467 static SDValue LowerVectorAllZeroTest(SDValue Op, const X86Subtarget *Subtarget,
13468 SelectionDAG &DAG) {
13469 assert(Op.getOpcode() == ISD::OR && "Only check OR'd tree.");
13471 if (!Subtarget->hasSSE41())
13474 if (!Op->hasOneUse())
13477 SDNode *N = Op.getNode();
13480 SmallVector<SDValue, 8> Opnds;
13481 DenseMap<SDValue, unsigned> VecInMap;
13482 SmallVector<SDValue, 8> VecIns;
13483 EVT VT = MVT::Other;
13485 // Recognize a special case where a vector is casted into wide integer to
13487 Opnds.push_back(N->getOperand(0));
13488 Opnds.push_back(N->getOperand(1));
13490 for (unsigned Slot = 0, e = Opnds.size(); Slot < e; ++Slot) {
13491 SmallVectorImpl<SDValue>::const_iterator I = Opnds.begin() + Slot;
13492 // BFS traverse all OR'd operands.
13493 if (I->getOpcode() == ISD::OR) {
13494 Opnds.push_back(I->getOperand(0));
13495 Opnds.push_back(I->getOperand(1));
13496 // Re-evaluate the number of nodes to be traversed.
13497 e += 2; // 2 more nodes (LHS and RHS) are pushed.
13501 // Quit if a non-EXTRACT_VECTOR_ELT
13502 if (I->getOpcode() != ISD::EXTRACT_VECTOR_ELT)
13505 // Quit if without a constant index.
13506 SDValue Idx = I->getOperand(1);
13507 if (!isa<ConstantSDNode>(Idx))
13510 SDValue ExtractedFromVec = I->getOperand(0);
13511 DenseMap<SDValue, unsigned>::iterator M = VecInMap.find(ExtractedFromVec);
13512 if (M == VecInMap.end()) {
13513 VT = ExtractedFromVec.getValueType();
13514 // Quit if not 128/256-bit vector.
13515 if (!VT.is128BitVector() && !VT.is256BitVector())
13517 // Quit if not the same type.
13518 if (VecInMap.begin() != VecInMap.end() &&
13519 VT != VecInMap.begin()->first.getValueType())
13521 M = VecInMap.insert(std::make_pair(ExtractedFromVec, 0)).first;
13522 VecIns.push_back(ExtractedFromVec);
13524 M->second |= 1U << cast<ConstantSDNode>(Idx)->getZExtValue();
13527 assert((VT.is128BitVector() || VT.is256BitVector()) &&
13528 "Not extracted from 128-/256-bit vector.");
13530 unsigned FullMask = (1U << VT.getVectorNumElements()) - 1U;
13532 for (DenseMap<SDValue, unsigned>::const_iterator
13533 I = VecInMap.begin(), E = VecInMap.end(); I != E; ++I) {
13534 // Quit if not all elements are used.
13535 if (I->second != FullMask)
13539 MVT TestVT = VT.is128BitVector() ? MVT::v2i64 : MVT::v4i64;
13541 // Cast all vectors into TestVT for PTEST.
13542 for (unsigned i = 0, e = VecIns.size(); i < e; ++i)
13543 VecIns[i] = DAG.getBitcast(TestVT, VecIns[i]);
13545 // If more than one full vectors are evaluated, OR them first before PTEST.
13546 for (unsigned Slot = 0, e = VecIns.size(); e - Slot > 1; Slot += 2, e += 1) {
13547 // Each iteration will OR 2 nodes and append the result until there is only
13548 // 1 node left, i.e. the final OR'd value of all vectors.
13549 SDValue LHS = VecIns[Slot];
13550 SDValue RHS = VecIns[Slot + 1];
13551 VecIns.push_back(DAG.getNode(ISD::OR, DL, TestVT, LHS, RHS));
13554 return DAG.getNode(X86ISD::PTEST, DL, MVT::i32,
13555 VecIns.back(), VecIns.back());
13558 /// \brief return true if \c Op has a use that doesn't just read flags.
13559 static bool hasNonFlagsUse(SDValue Op) {
13560 for (SDNode::use_iterator UI = Op->use_begin(), UE = Op->use_end(); UI != UE;
13562 SDNode *User = *UI;
13563 unsigned UOpNo = UI.getOperandNo();
13564 if (User->getOpcode() == ISD::TRUNCATE && User->hasOneUse()) {
13565 // Look pass truncate.
13566 UOpNo = User->use_begin().getOperandNo();
13567 User = *User->use_begin();
13570 if (User->getOpcode() != ISD::BRCOND && User->getOpcode() != ISD::SETCC &&
13571 !(User->getOpcode() == ISD::SELECT && UOpNo == 0))
13577 /// Emit nodes that will be selected as "test Op0,Op0", or something
13579 SDValue X86TargetLowering::EmitTest(SDValue Op, unsigned X86CC, SDLoc dl,
13580 SelectionDAG &DAG) const {
13581 if (Op.getValueType() == MVT::i1) {
13582 SDValue ExtOp = DAG.getNode(ISD::ZERO_EXTEND, dl, MVT::i8, Op);
13583 return DAG.getNode(X86ISD::CMP, dl, MVT::i32, ExtOp,
13584 DAG.getConstant(0, dl, MVT::i8));
13586 // CF and OF aren't always set the way we want. Determine which
13587 // of these we need.
13588 bool NeedCF = false;
13589 bool NeedOF = false;
13592 case X86::COND_A: case X86::COND_AE:
13593 case X86::COND_B: case X86::COND_BE:
13596 case X86::COND_G: case X86::COND_GE:
13597 case X86::COND_L: case X86::COND_LE:
13598 case X86::COND_O: case X86::COND_NO: {
13599 // Check if we really need to set the
13600 // Overflow flag. If NoSignedWrap is present
13601 // that is not actually needed.
13602 switch (Op->getOpcode()) {
13607 const auto *BinNode = cast<BinaryWithFlagsSDNode>(Op.getNode());
13608 if (BinNode->Flags.hasNoSignedWrap())
13618 // See if we can use the EFLAGS value from the operand instead of
13619 // doing a separate TEST. TEST always sets OF and CF to 0, so unless
13620 // we prove that the arithmetic won't overflow, we can't use OF or CF.
13621 if (Op.getResNo() != 0 || NeedOF || NeedCF) {
13622 // Emit a CMP with 0, which is the TEST pattern.
13623 //if (Op.getValueType() == MVT::i1)
13624 // return DAG.getNode(X86ISD::CMP, dl, MVT::i1, Op,
13625 // DAG.getConstant(0, MVT::i1));
13626 return DAG.getNode(X86ISD::CMP, dl, MVT::i32, Op,
13627 DAG.getConstant(0, dl, Op.getValueType()));
13629 unsigned Opcode = 0;
13630 unsigned NumOperands = 0;
13632 // Truncate operations may prevent the merge of the SETCC instruction
13633 // and the arithmetic instruction before it. Attempt to truncate the operands
13634 // of the arithmetic instruction and use a reduced bit-width instruction.
13635 bool NeedTruncation = false;
13636 SDValue ArithOp = Op;
13637 if (Op->getOpcode() == ISD::TRUNCATE && Op->hasOneUse()) {
13638 SDValue Arith = Op->getOperand(0);
13639 // Both the trunc and the arithmetic op need to have one user each.
13640 if (Arith->hasOneUse())
13641 switch (Arith.getOpcode()) {
13648 NeedTruncation = true;
13654 // NOTICE: In the code below we use ArithOp to hold the arithmetic operation
13655 // which may be the result of a CAST. We use the variable 'Op', which is the
13656 // non-casted variable when we check for possible users.
13657 switch (ArithOp.getOpcode()) {
13659 // Due to an isel shortcoming, be conservative if this add is likely to be
13660 // selected as part of a load-modify-store instruction. When the root node
13661 // in a match is a store, isel doesn't know how to remap non-chain non-flag
13662 // uses of other nodes in the match, such as the ADD in this case. This
13663 // leads to the ADD being left around and reselected, with the result being
13664 // two adds in the output. Alas, even if none our users are stores, that
13665 // doesn't prove we're O.K. Ergo, if we have any parents that aren't
13666 // CopyToReg or SETCC, eschew INC/DEC. A better fix seems to require
13667 // climbing the DAG back to the root, and it doesn't seem to be worth the
13669 for (SDNode::use_iterator UI = Op.getNode()->use_begin(),
13670 UE = Op.getNode()->use_end(); UI != UE; ++UI)
13671 if (UI->getOpcode() != ISD::CopyToReg &&
13672 UI->getOpcode() != ISD::SETCC &&
13673 UI->getOpcode() != ISD::STORE)
13676 if (ConstantSDNode *C =
13677 dyn_cast<ConstantSDNode>(ArithOp.getNode()->getOperand(1))) {
13678 // An add of one will be selected as an INC.
13679 if (C->getAPIntValue() == 1 && !Subtarget->slowIncDec()) {
13680 Opcode = X86ISD::INC;
13685 // An add of negative one (subtract of one) will be selected as a DEC.
13686 if (C->getAPIntValue().isAllOnesValue() && !Subtarget->slowIncDec()) {
13687 Opcode = X86ISD::DEC;
13693 // Otherwise use a regular EFLAGS-setting add.
13694 Opcode = X86ISD::ADD;
13699 // If we have a constant logical shift that's only used in a comparison
13700 // against zero turn it into an equivalent AND. This allows turning it into
13701 // a TEST instruction later.
13702 if ((X86CC == X86::COND_E || X86CC == X86::COND_NE) && Op->hasOneUse() &&
13703 isa<ConstantSDNode>(Op->getOperand(1)) && !hasNonFlagsUse(Op)) {
13704 EVT VT = Op.getValueType();
13705 unsigned BitWidth = VT.getSizeInBits();
13706 unsigned ShAmt = Op->getConstantOperandVal(1);
13707 if (ShAmt >= BitWidth) // Avoid undefined shifts.
13709 APInt Mask = ArithOp.getOpcode() == ISD::SRL
13710 ? APInt::getHighBitsSet(BitWidth, BitWidth - ShAmt)
13711 : APInt::getLowBitsSet(BitWidth, BitWidth - ShAmt);
13712 if (!Mask.isSignedIntN(32)) // Avoid large immediates.
13714 SDValue New = DAG.getNode(ISD::AND, dl, VT, Op->getOperand(0),
13715 DAG.getConstant(Mask, dl, VT));
13716 DAG.ReplaceAllUsesWith(Op, New);
13722 // If the primary and result isn't used, don't bother using X86ISD::AND,
13723 // because a TEST instruction will be better.
13724 if (!hasNonFlagsUse(Op))
13730 // Due to the ISEL shortcoming noted above, be conservative if this op is
13731 // likely to be selected as part of a load-modify-store instruction.
13732 for (SDNode::use_iterator UI = Op.getNode()->use_begin(),
13733 UE = Op.getNode()->use_end(); UI != UE; ++UI)
13734 if (UI->getOpcode() == ISD::STORE)
13737 // Otherwise use a regular EFLAGS-setting instruction.
13738 switch (ArithOp.getOpcode()) {
13739 default: llvm_unreachable("unexpected operator!");
13740 case ISD::SUB: Opcode = X86ISD::SUB; break;
13741 case ISD::XOR: Opcode = X86ISD::XOR; break;
13742 case ISD::AND: Opcode = X86ISD::AND; break;
13744 if (!NeedTruncation && (X86CC == X86::COND_E || X86CC == X86::COND_NE)) {
13745 SDValue EFLAGS = LowerVectorAllZeroTest(Op, Subtarget, DAG);
13746 if (EFLAGS.getNode())
13749 Opcode = X86ISD::OR;
13763 return SDValue(Op.getNode(), 1);
13769 // If we found that truncation is beneficial, perform the truncation and
13771 if (NeedTruncation) {
13772 EVT VT = Op.getValueType();
13773 SDValue WideVal = Op->getOperand(0);
13774 EVT WideVT = WideVal.getValueType();
13775 unsigned ConvertedOp = 0;
13776 // Use a target machine opcode to prevent further DAGCombine
13777 // optimizations that may separate the arithmetic operations
13778 // from the setcc node.
13779 switch (WideVal.getOpcode()) {
13781 case ISD::ADD: ConvertedOp = X86ISD::ADD; break;
13782 case ISD::SUB: ConvertedOp = X86ISD::SUB; break;
13783 case ISD::AND: ConvertedOp = X86ISD::AND; break;
13784 case ISD::OR: ConvertedOp = X86ISD::OR; break;
13785 case ISD::XOR: ConvertedOp = X86ISD::XOR; break;
13789 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
13790 if (TLI.isOperationLegal(WideVal.getOpcode(), WideVT)) {
13791 SDValue V0 = DAG.getNode(ISD::TRUNCATE, dl, VT, WideVal.getOperand(0));
13792 SDValue V1 = DAG.getNode(ISD::TRUNCATE, dl, VT, WideVal.getOperand(1));
13793 Op = DAG.getNode(ConvertedOp, dl, VT, V0, V1);
13799 // Emit a CMP with 0, which is the TEST pattern.
13800 return DAG.getNode(X86ISD::CMP, dl, MVT::i32, Op,
13801 DAG.getConstant(0, dl, Op.getValueType()));
13803 SDVTList VTs = DAG.getVTList(Op.getValueType(), MVT::i32);
13804 SmallVector<SDValue, 4> Ops(Op->op_begin(), Op->op_begin() + NumOperands);
13806 SDValue New = DAG.getNode(Opcode, dl, VTs, Ops);
13807 DAG.ReplaceAllUsesWith(Op, New);
13808 return SDValue(New.getNode(), 1);
13811 /// Emit nodes that will be selected as "cmp Op0,Op1", or something
13813 SDValue X86TargetLowering::EmitCmp(SDValue Op0, SDValue Op1, unsigned X86CC,
13814 SDLoc dl, SelectionDAG &DAG) const {
13815 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op1)) {
13816 if (C->getAPIntValue() == 0)
13817 return EmitTest(Op0, X86CC, dl, DAG);
13819 assert(Op0.getValueType() != MVT::i1 &&
13820 "Unexpected comparison operation for MVT::i1 operands");
13823 if ((Op0.getValueType() == MVT::i8 || Op0.getValueType() == MVT::i16 ||
13824 Op0.getValueType() == MVT::i32 || Op0.getValueType() == MVT::i64)) {
13825 // Do the comparison at i32 if it's smaller, besides the Atom case.
13826 // This avoids subregister aliasing issues. Keep the smaller reference
13827 // if we're optimizing for size, however, as that'll allow better folding
13828 // of memory operations.
13829 if (Op0.getValueType() != MVT::i32 && Op0.getValueType() != MVT::i64 &&
13830 !DAG.getMachineFunction().getFunction()->optForMinSize() &&
13831 !Subtarget->isAtom()) {
13832 unsigned ExtendOp =
13833 isX86CCUnsigned(X86CC) ? ISD::ZERO_EXTEND : ISD::SIGN_EXTEND;
13834 Op0 = DAG.getNode(ExtendOp, dl, MVT::i32, Op0);
13835 Op1 = DAG.getNode(ExtendOp, dl, MVT::i32, Op1);
13837 // Use SUB instead of CMP to enable CSE between SUB and CMP.
13838 SDVTList VTs = DAG.getVTList(Op0.getValueType(), MVT::i32);
13839 SDValue Sub = DAG.getNode(X86ISD::SUB, dl, VTs,
13841 return SDValue(Sub.getNode(), 1);
13843 return DAG.getNode(X86ISD::CMP, dl, MVT::i32, Op0, Op1);
13846 /// Convert a comparison if required by the subtarget.
13847 SDValue X86TargetLowering::ConvertCmpIfNecessary(SDValue Cmp,
13848 SelectionDAG &DAG) const {
13849 // If the subtarget does not support the FUCOMI instruction, floating-point
13850 // comparisons have to be converted.
13851 if (Subtarget->hasCMov() ||
13852 Cmp.getOpcode() != X86ISD::CMP ||
13853 !Cmp.getOperand(0).getValueType().isFloatingPoint() ||
13854 !Cmp.getOperand(1).getValueType().isFloatingPoint())
13857 // The instruction selector will select an FUCOM instruction instead of
13858 // FUCOMI, which writes the comparison result to FPSW instead of EFLAGS. Hence
13859 // build an SDNode sequence that transfers the result from FPSW into EFLAGS:
13860 // (X86sahf (trunc (srl (X86fp_stsw (trunc (X86cmp ...)), 8))))
13862 SDValue TruncFPSW = DAG.getNode(ISD::TRUNCATE, dl, MVT::i16, Cmp);
13863 SDValue FNStSW = DAG.getNode(X86ISD::FNSTSW16r, dl, MVT::i16, TruncFPSW);
13864 SDValue Srl = DAG.getNode(ISD::SRL, dl, MVT::i16, FNStSW,
13865 DAG.getConstant(8, dl, MVT::i8));
13866 SDValue TruncSrl = DAG.getNode(ISD::TRUNCATE, dl, MVT::i8, Srl);
13867 return DAG.getNode(X86ISD::SAHF, dl, MVT::i32, TruncSrl);
13870 /// The minimum architected relative accuracy is 2^-12. We need one
13871 /// Newton-Raphson step to have a good float result (24 bits of precision).
13872 SDValue X86TargetLowering::getRsqrtEstimate(SDValue Op,
13873 DAGCombinerInfo &DCI,
13874 unsigned &RefinementSteps,
13875 bool &UseOneConstNR) const {
13876 EVT VT = Op.getValueType();
13877 const char *RecipOp;
13879 // SSE1 has rsqrtss and rsqrtps. AVX adds a 256-bit variant for rsqrtps.
13880 // TODO: Add support for AVX512 (v16f32).
13881 // It is likely not profitable to do this for f64 because a double-precision
13882 // rsqrt estimate with refinement on x86 prior to FMA requires at least 16
13883 // instructions: convert to single, rsqrtss, convert back to double, refine
13884 // (3 steps = at least 13 insts). If an 'rsqrtsd' variant was added to the ISA
13885 // along with FMA, this could be a throughput win.
13886 if (VT == MVT::f32 && Subtarget->hasSSE1())
13888 else if ((VT == MVT::v4f32 && Subtarget->hasSSE1()) ||
13889 (VT == MVT::v8f32 && Subtarget->hasAVX()))
13890 RecipOp = "vec-sqrtf";
13894 TargetRecip Recips = DCI.DAG.getTarget().Options.Reciprocals;
13895 if (!Recips.isEnabled(RecipOp))
13898 RefinementSteps = Recips.getRefinementSteps(RecipOp);
13899 UseOneConstNR = false;
13900 return DCI.DAG.getNode(X86ISD::FRSQRT, SDLoc(Op), VT, Op);
13903 /// The minimum architected relative accuracy is 2^-12. We need one
13904 /// Newton-Raphson step to have a good float result (24 bits of precision).
13905 SDValue X86TargetLowering::getRecipEstimate(SDValue Op,
13906 DAGCombinerInfo &DCI,
13907 unsigned &RefinementSteps) const {
13908 EVT VT = Op.getValueType();
13909 const char *RecipOp;
13911 // SSE1 has rcpss and rcpps. AVX adds a 256-bit variant for rcpps.
13912 // TODO: Add support for AVX512 (v16f32).
13913 // It is likely not profitable to do this for f64 because a double-precision
13914 // reciprocal estimate with refinement on x86 prior to FMA requires
13915 // 15 instructions: convert to single, rcpss, convert back to double, refine
13916 // (3 steps = 12 insts). If an 'rcpsd' variant was added to the ISA
13917 // along with FMA, this could be a throughput win.
13918 if (VT == MVT::f32 && Subtarget->hasSSE1())
13920 else if ((VT == MVT::v4f32 && Subtarget->hasSSE1()) ||
13921 (VT == MVT::v8f32 && Subtarget->hasAVX()))
13922 RecipOp = "vec-divf";
13926 TargetRecip Recips = DCI.DAG.getTarget().Options.Reciprocals;
13927 if (!Recips.isEnabled(RecipOp))
13930 RefinementSteps = Recips.getRefinementSteps(RecipOp);
13931 return DCI.DAG.getNode(X86ISD::FRCP, SDLoc(Op), VT, Op);
13934 /// If we have at least two divisions that use the same divisor, convert to
13935 /// multplication by a reciprocal. This may need to be adjusted for a given
13936 /// CPU if a division's cost is not at least twice the cost of a multiplication.
13937 /// This is because we still need one division to calculate the reciprocal and
13938 /// then we need two multiplies by that reciprocal as replacements for the
13939 /// original divisions.
13940 unsigned X86TargetLowering::combineRepeatedFPDivisors() const {
13944 static bool isAllOnes(SDValue V) {
13945 ConstantSDNode *C = dyn_cast<ConstantSDNode>(V);
13946 return C && C->isAllOnesValue();
13949 /// LowerToBT - Result of 'and' is compared against zero. Turn it into a BT node
13950 /// if it's possible.
13951 SDValue X86TargetLowering::LowerToBT(SDValue And, ISD::CondCode CC,
13952 SDLoc dl, SelectionDAG &DAG) const {
13953 SDValue Op0 = And.getOperand(0);
13954 SDValue Op1 = And.getOperand(1);
13955 if (Op0.getOpcode() == ISD::TRUNCATE)
13956 Op0 = Op0.getOperand(0);
13957 if (Op1.getOpcode() == ISD::TRUNCATE)
13958 Op1 = Op1.getOperand(0);
13961 if (Op1.getOpcode() == ISD::SHL)
13962 std::swap(Op0, Op1);
13963 if (Op0.getOpcode() == ISD::SHL) {
13964 if (ConstantSDNode *And00C = dyn_cast<ConstantSDNode>(Op0.getOperand(0)))
13965 if (And00C->getZExtValue() == 1) {
13966 // If we looked past a truncate, check that it's only truncating away
13968 unsigned BitWidth = Op0.getValueSizeInBits();
13969 unsigned AndBitWidth = And.getValueSizeInBits();
13970 if (BitWidth > AndBitWidth) {
13972 DAG.computeKnownBits(Op0, Zeros, Ones);
13973 if (Zeros.countLeadingOnes() < BitWidth - AndBitWidth)
13977 RHS = Op0.getOperand(1);
13979 } else if (Op1.getOpcode() == ISD::Constant) {
13980 ConstantSDNode *AndRHS = cast<ConstantSDNode>(Op1);
13981 uint64_t AndRHSVal = AndRHS->getZExtValue();
13982 SDValue AndLHS = Op0;
13984 if (AndRHSVal == 1 && AndLHS.getOpcode() == ISD::SRL) {
13985 LHS = AndLHS.getOperand(0);
13986 RHS = AndLHS.getOperand(1);
13989 // Use BT if the immediate can't be encoded in a TEST instruction.
13990 if (!isUInt<32>(AndRHSVal) && isPowerOf2_64(AndRHSVal)) {
13992 RHS = DAG.getConstant(Log2_64_Ceil(AndRHSVal), dl, LHS.getValueType());
13996 if (LHS.getNode()) {
13997 // If LHS is i8, promote it to i32 with any_extend. There is no i8 BT
13998 // instruction. Since the shift amount is in-range-or-undefined, we know
13999 // that doing a bittest on the i32 value is ok. We extend to i32 because
14000 // the encoding for the i16 version is larger than the i32 version.
14001 // Also promote i16 to i32 for performance / code size reason.
14002 if (LHS.getValueType() == MVT::i8 ||
14003 LHS.getValueType() == MVT::i16)
14004 LHS = DAG.getNode(ISD::ANY_EXTEND, dl, MVT::i32, LHS);
14006 // If the operand types disagree, extend the shift amount to match. Since
14007 // BT ignores high bits (like shifts) we can use anyextend.
14008 if (LHS.getValueType() != RHS.getValueType())
14009 RHS = DAG.getNode(ISD::ANY_EXTEND, dl, LHS.getValueType(), RHS);
14011 SDValue BT = DAG.getNode(X86ISD::BT, dl, MVT::i32, LHS, RHS);
14012 X86::CondCode Cond = CC == ISD::SETEQ ? X86::COND_AE : X86::COND_B;
14013 return DAG.getNode(X86ISD::SETCC, dl, MVT::i8,
14014 DAG.getConstant(Cond, dl, MVT::i8), BT);
14020 /// \brief - Turns an ISD::CondCode into a value suitable for SSE floating point
14022 static int translateX86FSETCC(ISD::CondCode SetCCOpcode, SDValue &Op0,
14027 // SSE Condition code mapping:
14036 switch (SetCCOpcode) {
14037 default: llvm_unreachable("Unexpected SETCC condition");
14039 case ISD::SETEQ: SSECC = 0; break;
14041 case ISD::SETGT: Swap = true; // Fallthrough
14043 case ISD::SETOLT: SSECC = 1; break;
14045 case ISD::SETGE: Swap = true; // Fallthrough
14047 case ISD::SETOLE: SSECC = 2; break;
14048 case ISD::SETUO: SSECC = 3; break;
14050 case ISD::SETNE: SSECC = 4; break;
14051 case ISD::SETULE: Swap = true; // Fallthrough
14052 case ISD::SETUGE: SSECC = 5; break;
14053 case ISD::SETULT: Swap = true; // Fallthrough
14054 case ISD::SETUGT: SSECC = 6; break;
14055 case ISD::SETO: SSECC = 7; break;
14057 case ISD::SETONE: SSECC = 8; break;
14060 std::swap(Op0, Op1);
14065 // Lower256IntVSETCC - Break a VSETCC 256-bit integer VSETCC into two new 128
14066 // ones, and then concatenate the result back.
14067 static SDValue Lower256IntVSETCC(SDValue Op, SelectionDAG &DAG) {
14068 MVT VT = Op.getSimpleValueType();
14070 assert(VT.is256BitVector() && Op.getOpcode() == ISD::SETCC &&
14071 "Unsupported value type for operation");
14073 unsigned NumElems = VT.getVectorNumElements();
14075 SDValue CC = Op.getOperand(2);
14077 // Extract the LHS vectors
14078 SDValue LHS = Op.getOperand(0);
14079 SDValue LHS1 = Extract128BitVector(LHS, 0, DAG, dl);
14080 SDValue LHS2 = Extract128BitVector(LHS, NumElems/2, DAG, dl);
14082 // Extract the RHS vectors
14083 SDValue RHS = Op.getOperand(1);
14084 SDValue RHS1 = Extract128BitVector(RHS, 0, DAG, dl);
14085 SDValue RHS2 = Extract128BitVector(RHS, NumElems/2, DAG, dl);
14087 // Issue the operation on the smaller types and concatenate the result back
14088 MVT EltVT = VT.getVectorElementType();
14089 MVT NewVT = MVT::getVectorVT(EltVT, NumElems/2);
14090 return DAG.getNode(ISD::CONCAT_VECTORS, dl, VT,
14091 DAG.getNode(Op.getOpcode(), dl, NewVT, LHS1, RHS1, CC),
14092 DAG.getNode(Op.getOpcode(), dl, NewVT, LHS2, RHS2, CC));
14095 static SDValue LowerBoolVSETCC_AVX512(SDValue Op, SelectionDAG &DAG) {
14096 SDValue Op0 = Op.getOperand(0);
14097 SDValue Op1 = Op.getOperand(1);
14098 SDValue CC = Op.getOperand(2);
14099 MVT VT = Op.getSimpleValueType();
14102 assert(Op0.getSimpleValueType().getVectorElementType() == MVT::i1 &&
14103 "Unexpected type for boolean compare operation");
14104 ISD::CondCode SetCCOpcode = cast<CondCodeSDNode>(CC)->get();
14105 SDValue NotOp0 = DAG.getNode(ISD::XOR, dl, VT, Op0,
14106 DAG.getConstant(-1, dl, VT));
14107 SDValue NotOp1 = DAG.getNode(ISD::XOR, dl, VT, Op1,
14108 DAG.getConstant(-1, dl, VT));
14109 switch (SetCCOpcode) {
14110 default: llvm_unreachable("Unexpected SETCC condition");
14112 // (x == y) -> ~(x ^ y)
14113 return DAG.getNode(ISD::XOR, dl, VT,
14114 DAG.getNode(ISD::XOR, dl, VT, Op0, Op1),
14115 DAG.getConstant(-1, dl, VT));
14117 // (x != y) -> (x ^ y)
14118 return DAG.getNode(ISD::XOR, dl, VT, Op0, Op1);
14121 // (x > y) -> (x & ~y)
14122 return DAG.getNode(ISD::AND, dl, VT, Op0, NotOp1);
14125 // (x < y) -> (~x & y)
14126 return DAG.getNode(ISD::AND, dl, VT, NotOp0, Op1);
14129 // (x <= y) -> (~x | y)
14130 return DAG.getNode(ISD::OR, dl, VT, NotOp0, Op1);
14133 // (x >=y) -> (x | ~y)
14134 return DAG.getNode(ISD::OR, dl, VT, Op0, NotOp1);
14138 static SDValue LowerIntVSETCC_AVX512(SDValue Op, SelectionDAG &DAG,
14139 const X86Subtarget *Subtarget) {
14140 SDValue Op0 = Op.getOperand(0);
14141 SDValue Op1 = Op.getOperand(1);
14142 SDValue CC = Op.getOperand(2);
14143 MVT VT = Op.getSimpleValueType();
14146 assert(Op0.getSimpleValueType().getVectorElementType().getSizeInBits() >= 8 &&
14147 Op.getSimpleValueType().getVectorElementType() == MVT::i1 &&
14148 "Cannot set masked compare for this operation");
14150 ISD::CondCode SetCCOpcode = cast<CondCodeSDNode>(CC)->get();
14152 bool Unsigned = false;
14155 switch (SetCCOpcode) {
14156 default: llvm_unreachable("Unexpected SETCC condition");
14157 case ISD::SETNE: SSECC = 4; break;
14158 case ISD::SETEQ: Opc = X86ISD::PCMPEQM; break;
14159 case ISD::SETUGT: SSECC = 6; Unsigned = true; break;
14160 case ISD::SETLT: Swap = true; //fall-through
14161 case ISD::SETGT: Opc = X86ISD::PCMPGTM; break;
14162 case ISD::SETULT: SSECC = 1; Unsigned = true; break;
14163 case ISD::SETUGE: SSECC = 5; Unsigned = true; break; //NLT
14164 case ISD::SETGE: Swap = true; SSECC = 2; break; // LE + swap
14165 case ISD::SETULE: Unsigned = true; //fall-through
14166 case ISD::SETLE: SSECC = 2; break;
14170 std::swap(Op0, Op1);
14172 return DAG.getNode(Opc, dl, VT, Op0, Op1);
14173 Opc = Unsigned ? X86ISD::CMPMU: X86ISD::CMPM;
14174 return DAG.getNode(Opc, dl, VT, Op0, Op1,
14175 DAG.getConstant(SSECC, dl, MVT::i8));
14178 /// \brief Try to turn a VSETULT into a VSETULE by modifying its second
14179 /// operand \p Op1. If non-trivial (for example because it's not constant)
14180 /// return an empty value.
14181 static SDValue ChangeVSETULTtoVSETULE(SDLoc dl, SDValue Op1, SelectionDAG &DAG)
14183 BuildVectorSDNode *BV = dyn_cast<BuildVectorSDNode>(Op1.getNode());
14187 MVT VT = Op1.getSimpleValueType();
14188 MVT EVT = VT.getVectorElementType();
14189 unsigned n = VT.getVectorNumElements();
14190 SmallVector<SDValue, 8> ULTOp1;
14192 for (unsigned i = 0; i < n; ++i) {
14193 ConstantSDNode *Elt = dyn_cast<ConstantSDNode>(BV->getOperand(i));
14194 if (!Elt || Elt->isOpaque() || Elt->getSimpleValueType(0) != EVT)
14197 // Avoid underflow.
14198 APInt Val = Elt->getAPIntValue();
14202 ULTOp1.push_back(DAG.getConstant(Val - 1, dl, EVT));
14205 return DAG.getNode(ISD::BUILD_VECTOR, dl, VT, ULTOp1);
14208 static SDValue LowerVSETCC(SDValue Op, const X86Subtarget *Subtarget,
14209 SelectionDAG &DAG) {
14210 SDValue Op0 = Op.getOperand(0);
14211 SDValue Op1 = Op.getOperand(1);
14212 SDValue CC = Op.getOperand(2);
14213 MVT VT = Op.getSimpleValueType();
14214 ISD::CondCode SetCCOpcode = cast<CondCodeSDNode>(CC)->get();
14215 bool isFP = Op.getOperand(1).getSimpleValueType().isFloatingPoint();
14220 MVT EltVT = Op0.getSimpleValueType().getVectorElementType();
14221 assert(EltVT == MVT::f32 || EltVT == MVT::f64);
14224 unsigned SSECC = translateX86FSETCC(SetCCOpcode, Op0, Op1);
14225 unsigned Opc = X86ISD::CMPP;
14226 if (Subtarget->hasAVX512() && VT.getVectorElementType() == MVT::i1) {
14227 assert(VT.getVectorNumElements() <= 16);
14228 Opc = X86ISD::CMPM;
14230 // In the two special cases we can't handle, emit two comparisons.
14233 unsigned CombineOpc;
14234 if (SetCCOpcode == ISD::SETUEQ) {
14235 CC0 = 3; CC1 = 0; CombineOpc = ISD::OR;
14237 assert(SetCCOpcode == ISD::SETONE);
14238 CC0 = 7; CC1 = 4; CombineOpc = ISD::AND;
14241 SDValue Cmp0 = DAG.getNode(Opc, dl, VT, Op0, Op1,
14242 DAG.getConstant(CC0, dl, MVT::i8));
14243 SDValue Cmp1 = DAG.getNode(Opc, dl, VT, Op0, Op1,
14244 DAG.getConstant(CC1, dl, MVT::i8));
14245 return DAG.getNode(CombineOpc, dl, VT, Cmp0, Cmp1);
14247 // Handle all other FP comparisons here.
14248 return DAG.getNode(Opc, dl, VT, Op0, Op1,
14249 DAG.getConstant(SSECC, dl, MVT::i8));
14252 MVT VTOp0 = Op0.getSimpleValueType();
14253 assert(VTOp0 == Op1.getSimpleValueType() &&
14254 "Expected operands with same type!");
14255 assert(VT.getVectorNumElements() == VTOp0.getVectorNumElements() &&
14256 "Invalid number of packed elements for source and destination!");
14258 if (VT.is128BitVector() && VTOp0.is256BitVector()) {
14259 // On non-AVX512 targets, a vector of MVT::i1 is promoted by the type
14260 // legalizer to a wider vector type. In the case of 'vsetcc' nodes, the
14261 // legalizer firstly checks if the first operand in input to the setcc has
14262 // a legal type. If so, then it promotes the return type to that same type.
14263 // Otherwise, the return type is promoted to the 'next legal type' which,
14264 // for a vector of MVT::i1 is always a 128-bit integer vector type.
14266 // We reach this code only if the following two conditions are met:
14267 // 1. Both return type and operand type have been promoted to wider types
14268 // by the type legalizer.
14269 // 2. The original operand type has been promoted to a 256-bit vector.
14271 // Note that condition 2. only applies for AVX targets.
14272 SDValue NewOp = DAG.getSetCC(dl, VTOp0, Op0, Op1, SetCCOpcode);
14273 return DAG.getZExtOrTrunc(NewOp, dl, VT);
14276 // The non-AVX512 code below works under the assumption that source and
14277 // destination types are the same.
14278 assert((Subtarget->hasAVX512() || (VT == VTOp0)) &&
14279 "Value types for source and destination must be the same!");
14281 // Break 256-bit integer vector compare into smaller ones.
14282 if (VT.is256BitVector() && !Subtarget->hasInt256())
14283 return Lower256IntVSETCC(Op, DAG);
14285 MVT OpVT = Op1.getSimpleValueType();
14286 if (OpVT.getVectorElementType() == MVT::i1)
14287 return LowerBoolVSETCC_AVX512(Op, DAG);
14289 bool MaskResult = (VT.getVectorElementType() == MVT::i1);
14290 if (Subtarget->hasAVX512()) {
14291 if (Op1.getSimpleValueType().is512BitVector() ||
14292 (Subtarget->hasBWI() && Subtarget->hasVLX()) ||
14293 (MaskResult && OpVT.getVectorElementType().getSizeInBits() >= 32))
14294 return LowerIntVSETCC_AVX512(Op, DAG, Subtarget);
14296 // In AVX-512 architecture setcc returns mask with i1 elements,
14297 // But there is no compare instruction for i8 and i16 elements in KNL.
14298 // We are not talking about 512-bit operands in this case, these
14299 // types are illegal.
14301 (OpVT.getVectorElementType().getSizeInBits() < 32 &&
14302 OpVT.getVectorElementType().getSizeInBits() >= 8))
14303 return DAG.getNode(ISD::TRUNCATE, dl, VT,
14304 DAG.getNode(ISD::SETCC, dl, OpVT, Op0, Op1, CC));
14307 // Lower using XOP integer comparisons.
14308 if ((VT == MVT::v16i8 || VT == MVT::v8i16 ||
14309 VT == MVT::v4i32 || VT == MVT::v2i64) && Subtarget->hasXOP()) {
14310 // Translate compare code to XOP PCOM compare mode.
14311 unsigned CmpMode = 0;
14312 switch (SetCCOpcode) {
14313 default: llvm_unreachable("Unexpected SETCC condition");
14315 case ISD::SETLT: CmpMode = 0x00; break;
14317 case ISD::SETLE: CmpMode = 0x01; break;
14319 case ISD::SETGT: CmpMode = 0x02; break;
14321 case ISD::SETGE: CmpMode = 0x03; break;
14322 case ISD::SETEQ: CmpMode = 0x04; break;
14323 case ISD::SETNE: CmpMode = 0x05; break;
14326 // Are we comparing unsigned or signed integers?
14327 unsigned Opc = ISD::isUnsignedIntSetCC(SetCCOpcode)
14328 ? X86ISD::VPCOMU : X86ISD::VPCOM;
14330 return DAG.getNode(Opc, dl, VT, Op0, Op1,
14331 DAG.getConstant(CmpMode, dl, MVT::i8));
14334 // We are handling one of the integer comparisons here. Since SSE only has
14335 // GT and EQ comparisons for integer, swapping operands and multiple
14336 // operations may be required for some comparisons.
14338 bool Swap = false, Invert = false, FlipSigns = false, MinMax = false;
14339 bool Subus = false;
14341 switch (SetCCOpcode) {
14342 default: llvm_unreachable("Unexpected SETCC condition");
14343 case ISD::SETNE: Invert = true;
14344 case ISD::SETEQ: Opc = X86ISD::PCMPEQ; break;
14345 case ISD::SETLT: Swap = true;
14346 case ISD::SETGT: Opc = X86ISD::PCMPGT; break;
14347 case ISD::SETGE: Swap = true;
14348 case ISD::SETLE: Opc = X86ISD::PCMPGT;
14349 Invert = true; break;
14350 case ISD::SETULT: Swap = true;
14351 case ISD::SETUGT: Opc = X86ISD::PCMPGT;
14352 FlipSigns = true; break;
14353 case ISD::SETUGE: Swap = true;
14354 case ISD::SETULE: Opc = X86ISD::PCMPGT;
14355 FlipSigns = true; Invert = true; break;
14358 // Special case: Use min/max operations for SETULE/SETUGE
14359 MVT VET = VT.getVectorElementType();
14361 (Subtarget->hasSSE41() && (VET >= MVT::i8 && VET <= MVT::i32))
14362 || (Subtarget->hasSSE2() && (VET == MVT::i8));
14365 switch (SetCCOpcode) {
14367 case ISD::SETULE: Opc = ISD::UMIN; MinMax = true; break;
14368 case ISD::SETUGE: Opc = ISD::UMAX; MinMax = true; break;
14371 if (MinMax) { Swap = false; Invert = false; FlipSigns = false; }
14374 bool hasSubus = Subtarget->hasSSE2() && (VET == MVT::i8 || VET == MVT::i16);
14375 if (!MinMax && hasSubus) {
14376 // As another special case, use PSUBUS[BW] when it's profitable. E.g. for
14378 // t = psubus Op0, Op1
14379 // pcmpeq t, <0..0>
14380 switch (SetCCOpcode) {
14382 case ISD::SETULT: {
14383 // If the comparison is against a constant we can turn this into a
14384 // setule. With psubus, setule does not require a swap. This is
14385 // beneficial because the constant in the register is no longer
14386 // destructed as the destination so it can be hoisted out of a loop.
14387 // Only do this pre-AVX since vpcmp* is no longer destructive.
14388 if (Subtarget->hasAVX())
14390 SDValue ULEOp1 = ChangeVSETULTtoVSETULE(dl, Op1, DAG);
14391 if (ULEOp1.getNode()) {
14393 Subus = true; Invert = false; Swap = false;
14397 // Psubus is better than flip-sign because it requires no inversion.
14398 case ISD::SETUGE: Subus = true; Invert = false; Swap = true; break;
14399 case ISD::SETULE: Subus = true; Invert = false; Swap = false; break;
14403 Opc = X86ISD::SUBUS;
14409 std::swap(Op0, Op1);
14411 // Check that the operation in question is available (most are plain SSE2,
14412 // but PCMPGTQ and PCMPEQQ have different requirements).
14413 if (VT == MVT::v2i64) {
14414 if (Opc == X86ISD::PCMPGT && !Subtarget->hasSSE42()) {
14415 assert(Subtarget->hasSSE2() && "Don't know how to lower!");
14417 // First cast everything to the right type.
14418 Op0 = DAG.getBitcast(MVT::v4i32, Op0);
14419 Op1 = DAG.getBitcast(MVT::v4i32, Op1);
14421 // Since SSE has no unsigned integer comparisons, we need to flip the sign
14422 // bits of the inputs before performing those operations. The lower
14423 // compare is always unsigned.
14426 SB = DAG.getConstant(0x80000000U, dl, MVT::v4i32);
14428 SDValue Sign = DAG.getConstant(0x80000000U, dl, MVT::i32);
14429 SDValue Zero = DAG.getConstant(0x00000000U, dl, MVT::i32);
14430 SB = DAG.getNode(ISD::BUILD_VECTOR, dl, MVT::v4i32,
14431 Sign, Zero, Sign, Zero);
14433 Op0 = DAG.getNode(ISD::XOR, dl, MVT::v4i32, Op0, SB);
14434 Op1 = DAG.getNode(ISD::XOR, dl, MVT::v4i32, Op1, SB);
14436 // Emulate PCMPGTQ with (hi1 > hi2) | ((hi1 == hi2) & (lo1 > lo2))
14437 SDValue GT = DAG.getNode(X86ISD::PCMPGT, dl, MVT::v4i32, Op0, Op1);
14438 SDValue EQ = DAG.getNode(X86ISD::PCMPEQ, dl, MVT::v4i32, Op0, Op1);
14440 // Create masks for only the low parts/high parts of the 64 bit integers.
14441 static const int MaskHi[] = { 1, 1, 3, 3 };
14442 static const int MaskLo[] = { 0, 0, 2, 2 };
14443 SDValue EQHi = DAG.getVectorShuffle(MVT::v4i32, dl, EQ, EQ, MaskHi);
14444 SDValue GTLo = DAG.getVectorShuffle(MVT::v4i32, dl, GT, GT, MaskLo);
14445 SDValue GTHi = DAG.getVectorShuffle(MVT::v4i32, dl, GT, GT, MaskHi);
14447 SDValue Result = DAG.getNode(ISD::AND, dl, MVT::v4i32, EQHi, GTLo);
14448 Result = DAG.getNode(ISD::OR, dl, MVT::v4i32, Result, GTHi);
14451 Result = DAG.getNOT(dl, Result, MVT::v4i32);
14453 return DAG.getBitcast(VT, Result);
14456 if (Opc == X86ISD::PCMPEQ && !Subtarget->hasSSE41()) {
14457 // If pcmpeqq is missing but pcmpeqd is available synthesize pcmpeqq with
14458 // pcmpeqd + pshufd + pand.
14459 assert(Subtarget->hasSSE2() && !FlipSigns && "Don't know how to lower!");
14461 // First cast everything to the right type.
14462 Op0 = DAG.getBitcast(MVT::v4i32, Op0);
14463 Op1 = DAG.getBitcast(MVT::v4i32, Op1);
14466 SDValue Result = DAG.getNode(Opc, dl, MVT::v4i32, Op0, Op1);
14468 // Make sure the lower and upper halves are both all-ones.
14469 static const int Mask[] = { 1, 0, 3, 2 };
14470 SDValue Shuf = DAG.getVectorShuffle(MVT::v4i32, dl, Result, Result, Mask);
14471 Result = DAG.getNode(ISD::AND, dl, MVT::v4i32, Result, Shuf);
14474 Result = DAG.getNOT(dl, Result, MVT::v4i32);
14476 return DAG.getBitcast(VT, Result);
14480 // Since SSE has no unsigned integer comparisons, we need to flip the sign
14481 // bits of the inputs before performing those operations.
14483 MVT EltVT = VT.getVectorElementType();
14484 SDValue SB = DAG.getConstant(APInt::getSignBit(EltVT.getSizeInBits()), dl,
14486 Op0 = DAG.getNode(ISD::XOR, dl, VT, Op0, SB);
14487 Op1 = DAG.getNode(ISD::XOR, dl, VT, Op1, SB);
14490 SDValue Result = DAG.getNode(Opc, dl, VT, Op0, Op1);
14492 // If the logical-not of the result is required, perform that now.
14494 Result = DAG.getNOT(dl, Result, VT);
14497 Result = DAG.getNode(X86ISD::PCMPEQ, dl, VT, Op0, Result);
14500 Result = DAG.getNode(X86ISD::PCMPEQ, dl, VT, Result,
14501 getZeroVector(VT, Subtarget, DAG, dl));
14506 SDValue X86TargetLowering::LowerSETCC(SDValue Op, SelectionDAG &DAG) const {
14508 MVT VT = Op.getSimpleValueType();
14510 if (VT.isVector()) return LowerVSETCC(Op, Subtarget, DAG);
14512 assert(((!Subtarget->hasAVX512() && VT == MVT::i8) || (VT == MVT::i1))
14513 && "SetCC type must be 8-bit or 1-bit integer");
14514 SDValue Op0 = Op.getOperand(0);
14515 SDValue Op1 = Op.getOperand(1);
14517 ISD::CondCode CC = cast<CondCodeSDNode>(Op.getOperand(2))->get();
14519 // Optimize to BT if possible.
14520 // Lower (X & (1 << N)) == 0 to BT(X, N).
14521 // Lower ((X >>u N) & 1) != 0 to BT(X, N).
14522 // Lower ((X >>s N) & 1) != 0 to BT(X, N).
14523 if (Op0.getOpcode() == ISD::AND && Op0.hasOneUse() &&
14524 Op1.getOpcode() == ISD::Constant &&
14525 cast<ConstantSDNode>(Op1)->isNullValue() &&
14526 (CC == ISD::SETEQ || CC == ISD::SETNE)) {
14527 SDValue NewSetCC = LowerToBT(Op0, CC, dl, DAG);
14528 if (NewSetCC.getNode()) {
14530 return DAG.getNode(ISD::TRUNCATE, dl, MVT::i1, NewSetCC);
14535 // Look for X == 0, X == 1, X != 0, or X != 1. We can simplify some forms of
14537 if (Op1.getOpcode() == ISD::Constant &&
14538 (cast<ConstantSDNode>(Op1)->getZExtValue() == 1 ||
14539 cast<ConstantSDNode>(Op1)->isNullValue()) &&
14540 (CC == ISD::SETEQ || CC == ISD::SETNE)) {
14542 // If the input is a setcc, then reuse the input setcc or use a new one with
14543 // the inverted condition.
14544 if (Op0.getOpcode() == X86ISD::SETCC) {
14545 X86::CondCode CCode = (X86::CondCode)Op0.getConstantOperandVal(0);
14546 bool Invert = (CC == ISD::SETNE) ^
14547 cast<ConstantSDNode>(Op1)->isNullValue();
14551 CCode = X86::GetOppositeBranchCondition(CCode);
14552 SDValue SetCC = DAG.getNode(X86ISD::SETCC, dl, MVT::i8,
14553 DAG.getConstant(CCode, dl, MVT::i8),
14554 Op0.getOperand(1));
14556 return DAG.getNode(ISD::TRUNCATE, dl, MVT::i1, SetCC);
14560 if ((Op0.getValueType() == MVT::i1) && (Op1.getOpcode() == ISD::Constant) &&
14561 (cast<ConstantSDNode>(Op1)->getZExtValue() == 1) &&
14562 (CC == ISD::SETEQ || CC == ISD::SETNE)) {
14564 ISD::CondCode NewCC = ISD::getSetCCInverse(CC, true);
14565 return DAG.getSetCC(dl, VT, Op0, DAG.getConstant(0, dl, MVT::i1), NewCC);
14568 bool isFP = Op1.getSimpleValueType().isFloatingPoint();
14569 unsigned X86CC = TranslateX86CC(CC, dl, isFP, Op0, Op1, DAG);
14570 if (X86CC == X86::COND_INVALID)
14573 SDValue EFLAGS = EmitCmp(Op0, Op1, X86CC, dl, DAG);
14574 EFLAGS = ConvertCmpIfNecessary(EFLAGS, DAG);
14575 SDValue SetCC = DAG.getNode(X86ISD::SETCC, dl, MVT::i8,
14576 DAG.getConstant(X86CC, dl, MVT::i8), EFLAGS);
14578 return DAG.getNode(ISD::TRUNCATE, dl, MVT::i1, SetCC);
14582 // isX86LogicalCmp - Return true if opcode is a X86 logical comparison.
14583 static bool isX86LogicalCmp(SDValue Op) {
14584 unsigned Opc = Op.getNode()->getOpcode();
14585 if (Opc == X86ISD::CMP || Opc == X86ISD::COMI || Opc == X86ISD::UCOMI ||
14586 Opc == X86ISD::SAHF)
14588 if (Op.getResNo() == 1 &&
14589 (Opc == X86ISD::ADD ||
14590 Opc == X86ISD::SUB ||
14591 Opc == X86ISD::ADC ||
14592 Opc == X86ISD::SBB ||
14593 Opc == X86ISD::SMUL ||
14594 Opc == X86ISD::UMUL ||
14595 Opc == X86ISD::INC ||
14596 Opc == X86ISD::DEC ||
14597 Opc == X86ISD::OR ||
14598 Opc == X86ISD::XOR ||
14599 Opc == X86ISD::AND))
14602 if (Op.getResNo() == 2 && Opc == X86ISD::UMUL)
14608 static bool isTruncWithZeroHighBitsInput(SDValue V, SelectionDAG &DAG) {
14609 if (V.getOpcode() != ISD::TRUNCATE)
14612 SDValue VOp0 = V.getOperand(0);
14613 unsigned InBits = VOp0.getValueSizeInBits();
14614 unsigned Bits = V.getValueSizeInBits();
14615 return DAG.MaskedValueIsZero(VOp0, APInt::getHighBitsSet(InBits,InBits-Bits));
14618 SDValue X86TargetLowering::LowerSELECT(SDValue Op, SelectionDAG &DAG) const {
14619 bool addTest = true;
14620 SDValue Cond = Op.getOperand(0);
14621 SDValue Op1 = Op.getOperand(1);
14622 SDValue Op2 = Op.getOperand(2);
14624 MVT VT = Op1.getSimpleValueType();
14627 // Lower FP selects into a CMP/AND/ANDN/OR sequence when the necessary SSE ops
14628 // are available or VBLENDV if AVX is available.
14629 // Otherwise FP cmovs get lowered into a less efficient branch sequence later.
14630 if (Cond.getOpcode() == ISD::SETCC &&
14631 ((Subtarget->hasSSE2() && (VT == MVT::f32 || VT == MVT::f64)) ||
14632 (Subtarget->hasSSE1() && VT == MVT::f32)) &&
14633 VT == Cond.getOperand(0).getSimpleValueType() && Cond->hasOneUse()) {
14634 SDValue CondOp0 = Cond.getOperand(0), CondOp1 = Cond.getOperand(1);
14635 int SSECC = translateX86FSETCC(
14636 cast<CondCodeSDNode>(Cond.getOperand(2))->get(), CondOp0, CondOp1);
14639 if (Subtarget->hasAVX512()) {
14640 SDValue Cmp = DAG.getNode(X86ISD::FSETCC, DL, MVT::i1, CondOp0, CondOp1,
14641 DAG.getConstant(SSECC, DL, MVT::i8));
14642 return DAG.getNode(X86ISD::SELECT, DL, VT, Cmp, Op1, Op2);
14645 SDValue Cmp = DAG.getNode(X86ISD::FSETCC, DL, VT, CondOp0, CondOp1,
14646 DAG.getConstant(SSECC, DL, MVT::i8));
14648 // If we have AVX, we can use a variable vector select (VBLENDV) instead
14649 // of 3 logic instructions for size savings and potentially speed.
14650 // Unfortunately, there is no scalar form of VBLENDV.
14652 // If either operand is a constant, don't try this. We can expect to
14653 // optimize away at least one of the logic instructions later in that
14654 // case, so that sequence would be faster than a variable blend.
14656 // BLENDV was introduced with SSE 4.1, but the 2 register form implicitly
14657 // uses XMM0 as the selection register. That may need just as many
14658 // instructions as the AND/ANDN/OR sequence due to register moves, so
14661 if (Subtarget->hasAVX() &&
14662 !isa<ConstantFPSDNode>(Op1) && !isa<ConstantFPSDNode>(Op2)) {
14664 // Convert to vectors, do a VSELECT, and convert back to scalar.
14665 // All of the conversions should be optimized away.
14667 MVT VecVT = VT == MVT::f32 ? MVT::v4f32 : MVT::v2f64;
14668 SDValue VOp1 = DAG.getNode(ISD::SCALAR_TO_VECTOR, DL, VecVT, Op1);
14669 SDValue VOp2 = DAG.getNode(ISD::SCALAR_TO_VECTOR, DL, VecVT, Op2);
14670 SDValue VCmp = DAG.getNode(ISD::SCALAR_TO_VECTOR, DL, VecVT, Cmp);
14672 MVT VCmpVT = VT == MVT::f32 ? MVT::v4i32 : MVT::v2i64;
14673 VCmp = DAG.getBitcast(VCmpVT, VCmp);
14675 SDValue VSel = DAG.getNode(ISD::VSELECT, DL, VecVT, VCmp, VOp1, VOp2);
14677 return DAG.getNode(ISD::EXTRACT_VECTOR_ELT, DL, VT,
14678 VSel, DAG.getIntPtrConstant(0, DL));
14680 SDValue AndN = DAG.getNode(X86ISD::FANDN, DL, VT, Cmp, Op2);
14681 SDValue And = DAG.getNode(X86ISD::FAND, DL, VT, Cmp, Op1);
14682 return DAG.getNode(X86ISD::FOR, DL, VT, AndN, And);
14686 if (VT.isVector() && VT.getVectorElementType() == MVT::i1) {
14688 if (ISD::isBuildVectorOfConstantSDNodes(Op1.getNode()))
14689 Op1Scalar = ConvertI1VectorToInteger(Op1, DAG);
14690 else if (Op1.getOpcode() == ISD::BITCAST && Op1.getOperand(0))
14691 Op1Scalar = Op1.getOperand(0);
14693 if (ISD::isBuildVectorOfConstantSDNodes(Op2.getNode()))
14694 Op2Scalar = ConvertI1VectorToInteger(Op2, DAG);
14695 else if (Op2.getOpcode() == ISD::BITCAST && Op2.getOperand(0))
14696 Op2Scalar = Op2.getOperand(0);
14697 if (Op1Scalar.getNode() && Op2Scalar.getNode()) {
14698 SDValue newSelect = DAG.getNode(ISD::SELECT, DL,
14699 Op1Scalar.getValueType(),
14700 Cond, Op1Scalar, Op2Scalar);
14701 if (newSelect.getValueSizeInBits() == VT.getSizeInBits())
14702 return DAG.getBitcast(VT, newSelect);
14703 SDValue ExtVec = DAG.getBitcast(MVT::v8i1, newSelect);
14704 return DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, VT, ExtVec,
14705 DAG.getIntPtrConstant(0, DL));
14709 if (VT == MVT::v4i1 || VT == MVT::v2i1) {
14710 SDValue zeroConst = DAG.getIntPtrConstant(0, DL);
14711 Op1 = DAG.getNode(ISD::INSERT_SUBVECTOR, DL, MVT::v8i1,
14712 DAG.getUNDEF(MVT::v8i1), Op1, zeroConst);
14713 Op2 = DAG.getNode(ISD::INSERT_SUBVECTOR, DL, MVT::v8i1,
14714 DAG.getUNDEF(MVT::v8i1), Op2, zeroConst);
14715 SDValue newSelect = DAG.getNode(ISD::SELECT, DL, MVT::v8i1,
14717 return DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, VT, newSelect, zeroConst);
14720 if (Cond.getOpcode() == ISD::SETCC) {
14721 SDValue NewCond = LowerSETCC(Cond, DAG);
14722 if (NewCond.getNode())
14726 // (select (x == 0), -1, y) -> (sign_bit (x - 1)) | y
14727 // (select (x == 0), y, -1) -> ~(sign_bit (x - 1)) | y
14728 // (select (x != 0), y, -1) -> (sign_bit (x - 1)) | y
14729 // (select (x != 0), -1, y) -> ~(sign_bit (x - 1)) | y
14730 if (Cond.getOpcode() == X86ISD::SETCC &&
14731 Cond.getOperand(1).getOpcode() == X86ISD::CMP &&
14732 isZero(Cond.getOperand(1).getOperand(1))) {
14733 SDValue Cmp = Cond.getOperand(1);
14735 unsigned CondCode =cast<ConstantSDNode>(Cond.getOperand(0))->getZExtValue();
14737 if ((isAllOnes(Op1) || isAllOnes(Op2)) &&
14738 (CondCode == X86::COND_E || CondCode == X86::COND_NE)) {
14739 SDValue Y = isAllOnes(Op2) ? Op1 : Op2;
14741 SDValue CmpOp0 = Cmp.getOperand(0);
14742 // Apply further optimizations for special cases
14743 // (select (x != 0), -1, 0) -> neg & sbb
14744 // (select (x == 0), 0, -1) -> neg & sbb
14745 if (ConstantSDNode *YC = dyn_cast<ConstantSDNode>(Y))
14746 if (YC->isNullValue() &&
14747 (isAllOnes(Op1) == (CondCode == X86::COND_NE))) {
14748 SDVTList VTs = DAG.getVTList(CmpOp0.getValueType(), MVT::i32);
14749 SDValue Neg = DAG.getNode(X86ISD::SUB, DL, VTs,
14750 DAG.getConstant(0, DL,
14751 CmpOp0.getValueType()),
14753 SDValue Res = DAG.getNode(X86ISD::SETCC_CARRY, DL, Op.getValueType(),
14754 DAG.getConstant(X86::COND_B, DL, MVT::i8),
14755 SDValue(Neg.getNode(), 1));
14759 Cmp = DAG.getNode(X86ISD::CMP, DL, MVT::i32,
14760 CmpOp0, DAG.getConstant(1, DL, CmpOp0.getValueType()));
14761 Cmp = ConvertCmpIfNecessary(Cmp, DAG);
14763 SDValue Res = // Res = 0 or -1.
14764 DAG.getNode(X86ISD::SETCC_CARRY, DL, Op.getValueType(),
14765 DAG.getConstant(X86::COND_B, DL, MVT::i8), Cmp);
14767 if (isAllOnes(Op1) != (CondCode == X86::COND_E))
14768 Res = DAG.getNOT(DL, Res, Res.getValueType());
14770 ConstantSDNode *N2C = dyn_cast<ConstantSDNode>(Op2);
14771 if (!N2C || !N2C->isNullValue())
14772 Res = DAG.getNode(ISD::OR, DL, Res.getValueType(), Res, Y);
14777 // Look past (and (setcc_carry (cmp ...)), 1).
14778 if (Cond.getOpcode() == ISD::AND &&
14779 Cond.getOperand(0).getOpcode() == X86ISD::SETCC_CARRY) {
14780 ConstantSDNode *C = dyn_cast<ConstantSDNode>(Cond.getOperand(1));
14781 if (C && C->getAPIntValue() == 1)
14782 Cond = Cond.getOperand(0);
14785 // If condition flag is set by a X86ISD::CMP, then use it as the condition
14786 // setting operand in place of the X86ISD::SETCC.
14787 unsigned CondOpcode = Cond.getOpcode();
14788 if (CondOpcode == X86ISD::SETCC ||
14789 CondOpcode == X86ISD::SETCC_CARRY) {
14790 CC = Cond.getOperand(0);
14792 SDValue Cmp = Cond.getOperand(1);
14793 unsigned Opc = Cmp.getOpcode();
14794 MVT VT = Op.getSimpleValueType();
14796 bool IllegalFPCMov = false;
14797 if (VT.isFloatingPoint() && !VT.isVector() &&
14798 !isScalarFPTypeInSSEReg(VT)) // FPStack?
14799 IllegalFPCMov = !hasFPCMov(cast<ConstantSDNode>(CC)->getSExtValue());
14801 if ((isX86LogicalCmp(Cmp) && !IllegalFPCMov) ||
14802 Opc == X86ISD::BT) { // FIXME
14806 } else if (CondOpcode == ISD::USUBO || CondOpcode == ISD::SSUBO ||
14807 CondOpcode == ISD::UADDO || CondOpcode == ISD::SADDO ||
14808 ((CondOpcode == ISD::UMULO || CondOpcode == ISD::SMULO) &&
14809 Cond.getOperand(0).getValueType() != MVT::i8)) {
14810 SDValue LHS = Cond.getOperand(0);
14811 SDValue RHS = Cond.getOperand(1);
14812 unsigned X86Opcode;
14815 switch (CondOpcode) {
14816 case ISD::UADDO: X86Opcode = X86ISD::ADD; X86Cond = X86::COND_B; break;
14817 case ISD::SADDO: X86Opcode = X86ISD::ADD; X86Cond = X86::COND_O; break;
14818 case ISD::USUBO: X86Opcode = X86ISD::SUB; X86Cond = X86::COND_B; break;
14819 case ISD::SSUBO: X86Opcode = X86ISD::SUB; X86Cond = X86::COND_O; break;
14820 case ISD::UMULO: X86Opcode = X86ISD::UMUL; X86Cond = X86::COND_O; break;
14821 case ISD::SMULO: X86Opcode = X86ISD::SMUL; X86Cond = X86::COND_O; break;
14822 default: llvm_unreachable("unexpected overflowing operator");
14824 if (CondOpcode == ISD::UMULO)
14825 VTs = DAG.getVTList(LHS.getValueType(), LHS.getValueType(),
14828 VTs = DAG.getVTList(LHS.getValueType(), MVT::i32);
14830 SDValue X86Op = DAG.getNode(X86Opcode, DL, VTs, LHS, RHS);
14832 if (CondOpcode == ISD::UMULO)
14833 Cond = X86Op.getValue(2);
14835 Cond = X86Op.getValue(1);
14837 CC = DAG.getConstant(X86Cond, DL, MVT::i8);
14842 // Look past the truncate if the high bits are known zero.
14843 if (isTruncWithZeroHighBitsInput(Cond, DAG))
14844 Cond = Cond.getOperand(0);
14846 // We know the result of AND is compared against zero. Try to match
14848 if (Cond.getOpcode() == ISD::AND && Cond.hasOneUse()) {
14849 SDValue NewSetCC = LowerToBT(Cond, ISD::SETNE, DL, DAG);
14850 if (NewSetCC.getNode()) {
14851 CC = NewSetCC.getOperand(0);
14852 Cond = NewSetCC.getOperand(1);
14859 CC = DAG.getConstant(X86::COND_NE, DL, MVT::i8);
14860 Cond = EmitTest(Cond, X86::COND_NE, DL, DAG);
14863 // a < b ? -1 : 0 -> RES = ~setcc_carry
14864 // a < b ? 0 : -1 -> RES = setcc_carry
14865 // a >= b ? -1 : 0 -> RES = setcc_carry
14866 // a >= b ? 0 : -1 -> RES = ~setcc_carry
14867 if (Cond.getOpcode() == X86ISD::SUB) {
14868 Cond = ConvertCmpIfNecessary(Cond, DAG);
14869 unsigned CondCode = cast<ConstantSDNode>(CC)->getZExtValue();
14871 if ((CondCode == X86::COND_AE || CondCode == X86::COND_B) &&
14872 (isAllOnes(Op1) || isAllOnes(Op2)) && (isZero(Op1) || isZero(Op2))) {
14873 SDValue Res = DAG.getNode(X86ISD::SETCC_CARRY, DL, Op.getValueType(),
14874 DAG.getConstant(X86::COND_B, DL, MVT::i8),
14876 if (isAllOnes(Op1) != (CondCode == X86::COND_B))
14877 return DAG.getNOT(DL, Res, Res.getValueType());
14882 // X86 doesn't have an i8 cmov. If both operands are the result of a truncate
14883 // widen the cmov and push the truncate through. This avoids introducing a new
14884 // branch during isel and doesn't add any extensions.
14885 if (Op.getValueType() == MVT::i8 &&
14886 Op1.getOpcode() == ISD::TRUNCATE && Op2.getOpcode() == ISD::TRUNCATE) {
14887 SDValue T1 = Op1.getOperand(0), T2 = Op2.getOperand(0);
14888 if (T1.getValueType() == T2.getValueType() &&
14889 // Blacklist CopyFromReg to avoid partial register stalls.
14890 T1.getOpcode() != ISD::CopyFromReg && T2.getOpcode()!=ISD::CopyFromReg){
14891 SDVTList VTs = DAG.getVTList(T1.getValueType(), MVT::Glue);
14892 SDValue Cmov = DAG.getNode(X86ISD::CMOV, DL, VTs, T2, T1, CC, Cond);
14893 return DAG.getNode(ISD::TRUNCATE, DL, Op.getValueType(), Cmov);
14897 // X86ISD::CMOV means set the result (which is operand 1) to the RHS if
14898 // condition is true.
14899 SDVTList VTs = DAG.getVTList(Op.getValueType(), MVT::Glue);
14900 SDValue Ops[] = { Op2, Op1, CC, Cond };
14901 return DAG.getNode(X86ISD::CMOV, DL, VTs, Ops);
14904 static SDValue LowerSIGN_EXTEND_AVX512(SDValue Op,
14905 const X86Subtarget *Subtarget,
14906 SelectionDAG &DAG) {
14907 MVT VT = Op->getSimpleValueType(0);
14908 SDValue In = Op->getOperand(0);
14909 MVT InVT = In.getSimpleValueType();
14910 MVT VTElt = VT.getVectorElementType();
14911 MVT InVTElt = InVT.getVectorElementType();
14915 if ((InVTElt == MVT::i1) &&
14916 (((Subtarget->hasBWI() && Subtarget->hasVLX() &&
14917 VT.getSizeInBits() <= 256 && VTElt.getSizeInBits() <= 16)) ||
14919 ((Subtarget->hasBWI() && VT.is512BitVector() &&
14920 VTElt.getSizeInBits() <= 16)) ||
14922 ((Subtarget->hasDQI() && Subtarget->hasVLX() &&
14923 VT.getSizeInBits() <= 256 && VTElt.getSizeInBits() >= 32)) ||
14925 ((Subtarget->hasDQI() && VT.is512BitVector() &&
14926 VTElt.getSizeInBits() >= 32))))
14927 return DAG.getNode(X86ISD::VSEXT, dl, VT, In);
14929 unsigned int NumElts = VT.getVectorNumElements();
14931 if (NumElts != 8 && NumElts != 16 && !Subtarget->hasBWI())
14934 if (VT.is512BitVector() && InVT.getVectorElementType() != MVT::i1) {
14935 if (In.getOpcode() == X86ISD::VSEXT || In.getOpcode() == X86ISD::VZEXT)
14936 return DAG.getNode(In.getOpcode(), dl, VT, In.getOperand(0));
14937 return DAG.getNode(X86ISD::VSEXT, dl, VT, In);
14940 assert (InVT.getVectorElementType() == MVT::i1 && "Unexpected vector type");
14941 MVT ExtVT = NumElts == 8 ? MVT::v8i64 : MVT::v16i32;
14943 DAG.getConstant(APInt::getAllOnesValue(ExtVT.getScalarSizeInBits()), dl,
14946 DAG.getConstant(APInt::getNullValue(ExtVT.getScalarSizeInBits()), dl, ExtVT);
14948 SDValue V = DAG.getNode(ISD::VSELECT, dl, ExtVT, In, NegOne, Zero);
14949 if (VT.is512BitVector())
14951 return DAG.getNode(X86ISD::VTRUNC, dl, VT, V);
14954 static SDValue LowerSIGN_EXTEND_VECTOR_INREG(SDValue Op,
14955 const X86Subtarget *Subtarget,
14956 SelectionDAG &DAG) {
14957 SDValue In = Op->getOperand(0);
14958 MVT VT = Op->getSimpleValueType(0);
14959 MVT InVT = In.getSimpleValueType();
14960 assert(VT.getSizeInBits() == InVT.getSizeInBits());
14962 MVT InSVT = InVT.getVectorElementType();
14963 assert(VT.getVectorElementType().getSizeInBits() > InSVT.getSizeInBits());
14965 if (VT != MVT::v2i64 && VT != MVT::v4i32 && VT != MVT::v8i16)
14967 if (InSVT != MVT::i32 && InSVT != MVT::i16 && InSVT != MVT::i8)
14972 // SSE41 targets can use the pmovsx* instructions directly.
14973 if (Subtarget->hasSSE41())
14974 return DAG.getNode(X86ISD::VSEXT, dl, VT, In);
14976 // pre-SSE41 targets unpack lower lanes and then sign-extend using SRAI.
14980 // As SRAI is only available on i16/i32 types, we expand only up to i32
14981 // and handle i64 separately.
14982 while (CurrVT != VT && CurrVT.getVectorElementType() != MVT::i32) {
14983 Curr = DAG.getNode(X86ISD::UNPCKL, dl, CurrVT, DAG.getUNDEF(CurrVT), Curr);
14984 MVT CurrSVT = MVT::getIntegerVT(CurrVT.getScalarSizeInBits() * 2);
14985 CurrVT = MVT::getVectorVT(CurrSVT, CurrVT.getVectorNumElements() / 2);
14986 Curr = DAG.getBitcast(CurrVT, Curr);
14989 SDValue SignExt = Curr;
14990 if (CurrVT != InVT) {
14991 unsigned SignExtShift =
14992 CurrVT.getVectorElementType().getSizeInBits() - InSVT.getSizeInBits();
14993 SignExt = DAG.getNode(X86ISD::VSRAI, dl, CurrVT, Curr,
14994 DAG.getConstant(SignExtShift, dl, MVT::i8));
15000 if (VT == MVT::v2i64 && CurrVT == MVT::v4i32) {
15001 SDValue Sign = DAG.getNode(X86ISD::VSRAI, dl, CurrVT, Curr,
15002 DAG.getConstant(31, dl, MVT::i8));
15003 SDValue Ext = DAG.getVectorShuffle(CurrVT, dl, SignExt, Sign, {0, 4, 1, 5});
15004 return DAG.getBitcast(VT, Ext);
15010 static SDValue LowerSIGN_EXTEND(SDValue Op, const X86Subtarget *Subtarget,
15011 SelectionDAG &DAG) {
15012 MVT VT = Op->getSimpleValueType(0);
15013 SDValue In = Op->getOperand(0);
15014 MVT InVT = In.getSimpleValueType();
15017 if (VT.is512BitVector() || InVT.getVectorElementType() == MVT::i1)
15018 return LowerSIGN_EXTEND_AVX512(Op, Subtarget, DAG);
15020 if ((VT != MVT::v4i64 || InVT != MVT::v4i32) &&
15021 (VT != MVT::v8i32 || InVT != MVT::v8i16) &&
15022 (VT != MVT::v16i16 || InVT != MVT::v16i8))
15025 if (Subtarget->hasInt256())
15026 return DAG.getNode(X86ISD::VSEXT, dl, VT, In);
15028 // Optimize vectors in AVX mode
15029 // Sign extend v8i16 to v8i32 and
15032 // Divide input vector into two parts
15033 // for v4i32 the shuffle mask will be { 0, 1, -1, -1} {2, 3, -1, -1}
15034 // use vpmovsx instruction to extend v4i32 -> v2i64; v8i16 -> v4i32
15035 // concat the vectors to original VT
15037 unsigned NumElems = InVT.getVectorNumElements();
15038 SDValue Undef = DAG.getUNDEF(InVT);
15040 SmallVector<int,8> ShufMask1(NumElems, -1);
15041 for (unsigned i = 0; i != NumElems/2; ++i)
15044 SDValue OpLo = DAG.getVectorShuffle(InVT, dl, In, Undef, &ShufMask1[0]);
15046 SmallVector<int,8> ShufMask2(NumElems, -1);
15047 for (unsigned i = 0; i != NumElems/2; ++i)
15048 ShufMask2[i] = i + NumElems/2;
15050 SDValue OpHi = DAG.getVectorShuffle(InVT, dl, In, Undef, &ShufMask2[0]);
15052 MVT HalfVT = MVT::getVectorVT(VT.getVectorElementType(),
15053 VT.getVectorNumElements()/2);
15055 OpLo = DAG.getNode(X86ISD::VSEXT, dl, HalfVT, OpLo);
15056 OpHi = DAG.getNode(X86ISD::VSEXT, dl, HalfVT, OpHi);
15058 return DAG.getNode(ISD::CONCAT_VECTORS, dl, VT, OpLo, OpHi);
15061 // Lower vector extended loads using a shuffle. If SSSE3 is not available we
15062 // may emit an illegal shuffle but the expansion is still better than scalar
15063 // code. We generate X86ISD::VSEXT for SEXTLOADs if it's available, otherwise
15064 // we'll emit a shuffle and a arithmetic shift.
15065 // FIXME: Is the expansion actually better than scalar code? It doesn't seem so.
15066 // TODO: It is possible to support ZExt by zeroing the undef values during
15067 // the shuffle phase or after the shuffle.
15068 static SDValue LowerExtendedLoad(SDValue Op, const X86Subtarget *Subtarget,
15069 SelectionDAG &DAG) {
15070 MVT RegVT = Op.getSimpleValueType();
15071 assert(RegVT.isVector() && "We only custom lower vector sext loads.");
15072 assert(RegVT.isInteger() &&
15073 "We only custom lower integer vector sext loads.");
15075 // Nothing useful we can do without SSE2 shuffles.
15076 assert(Subtarget->hasSSE2() && "We only custom lower sext loads with SSE2.");
15078 LoadSDNode *Ld = cast<LoadSDNode>(Op.getNode());
15080 EVT MemVT = Ld->getMemoryVT();
15081 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
15082 unsigned RegSz = RegVT.getSizeInBits();
15084 ISD::LoadExtType Ext = Ld->getExtensionType();
15086 assert((Ext == ISD::EXTLOAD || Ext == ISD::SEXTLOAD)
15087 && "Only anyext and sext are currently implemented.");
15088 assert(MemVT != RegVT && "Cannot extend to the same type");
15089 assert(MemVT.isVector() && "Must load a vector from memory");
15091 unsigned NumElems = RegVT.getVectorNumElements();
15092 unsigned MemSz = MemVT.getSizeInBits();
15093 assert(RegSz > MemSz && "Register size must be greater than the mem size");
15095 if (Ext == ISD::SEXTLOAD && RegSz == 256 && !Subtarget->hasInt256()) {
15096 // The only way in which we have a legal 256-bit vector result but not the
15097 // integer 256-bit operations needed to directly lower a sextload is if we
15098 // have AVX1 but not AVX2. In that case, we can always emit a sextload to
15099 // a 128-bit vector and a normal sign_extend to 256-bits that should get
15100 // correctly legalized. We do this late to allow the canonical form of
15101 // sextload to persist throughout the rest of the DAG combiner -- it wants
15102 // to fold together any extensions it can, and so will fuse a sign_extend
15103 // of an sextload into a sextload targeting a wider value.
15105 if (MemSz == 128) {
15106 // Just switch this to a normal load.
15107 assert(TLI.isTypeLegal(MemVT) && "If the memory type is a 128-bit type, "
15108 "it must be a legal 128-bit vector "
15110 Load = DAG.getLoad(MemVT, dl, Ld->getChain(), Ld->getBasePtr(),
15111 Ld->getPointerInfo(), Ld->isVolatile(), Ld->isNonTemporal(),
15112 Ld->isInvariant(), Ld->getAlignment());
15114 assert(MemSz < 128 &&
15115 "Can't extend a type wider than 128 bits to a 256 bit vector!");
15116 // Do an sext load to a 128-bit vector type. We want to use the same
15117 // number of elements, but elements half as wide. This will end up being
15118 // recursively lowered by this routine, but will succeed as we definitely
15119 // have all the necessary features if we're using AVX1.
15121 EVT::getIntegerVT(*DAG.getContext(), RegVT.getScalarSizeInBits() / 2);
15122 EVT HalfVecVT = EVT::getVectorVT(*DAG.getContext(), HalfEltVT, NumElems);
15124 DAG.getExtLoad(Ext, dl, HalfVecVT, Ld->getChain(), Ld->getBasePtr(),
15125 Ld->getPointerInfo(), MemVT, Ld->isVolatile(),
15126 Ld->isNonTemporal(), Ld->isInvariant(),
15127 Ld->getAlignment());
15130 // Replace chain users with the new chain.
15131 assert(Load->getNumValues() == 2 && "Loads must carry a chain!");
15132 DAG.ReplaceAllUsesOfValueWith(SDValue(Ld, 1), Load.getValue(1));
15134 // Finally, do a normal sign-extend to the desired register.
15135 return DAG.getSExtOrTrunc(Load, dl, RegVT);
15138 // All sizes must be a power of two.
15139 assert(isPowerOf2_32(RegSz * MemSz * NumElems) &&
15140 "Non-power-of-two elements are not custom lowered!");
15142 // Attempt to load the original value using scalar loads.
15143 // Find the largest scalar type that divides the total loaded size.
15144 MVT SclrLoadTy = MVT::i8;
15145 for (MVT Tp : MVT::integer_valuetypes()) {
15146 if (TLI.isTypeLegal(Tp) && ((MemSz % Tp.getSizeInBits()) == 0)) {
15151 // On 32bit systems, we can't save 64bit integers. Try bitcasting to F64.
15152 if (TLI.isTypeLegal(MVT::f64) && SclrLoadTy.getSizeInBits() < 64 &&
15154 SclrLoadTy = MVT::f64;
15156 // Calculate the number of scalar loads that we need to perform
15157 // in order to load our vector from memory.
15158 unsigned NumLoads = MemSz / SclrLoadTy.getSizeInBits();
15160 assert((Ext != ISD::SEXTLOAD || NumLoads == 1) &&
15161 "Can only lower sext loads with a single scalar load!");
15163 unsigned loadRegZize = RegSz;
15164 if (Ext == ISD::SEXTLOAD && RegSz >= 256)
15167 // Represent our vector as a sequence of elements which are the
15168 // largest scalar that we can load.
15169 EVT LoadUnitVecVT = EVT::getVectorVT(
15170 *DAG.getContext(), SclrLoadTy, loadRegZize / SclrLoadTy.getSizeInBits());
15172 // Represent the data using the same element type that is stored in
15173 // memory. In practice, we ''widen'' MemVT.
15175 EVT::getVectorVT(*DAG.getContext(), MemVT.getScalarType(),
15176 loadRegZize / MemVT.getScalarSizeInBits());
15178 assert(WideVecVT.getSizeInBits() == LoadUnitVecVT.getSizeInBits() &&
15179 "Invalid vector type");
15181 // We can't shuffle using an illegal type.
15182 assert(TLI.isTypeLegal(WideVecVT) &&
15183 "We only lower types that form legal widened vector types");
15185 SmallVector<SDValue, 8> Chains;
15186 SDValue Ptr = Ld->getBasePtr();
15187 SDValue Increment = DAG.getConstant(SclrLoadTy.getSizeInBits() / 8, dl,
15188 TLI.getPointerTy(DAG.getDataLayout()));
15189 SDValue Res = DAG.getUNDEF(LoadUnitVecVT);
15191 for (unsigned i = 0; i < NumLoads; ++i) {
15192 // Perform a single load.
15193 SDValue ScalarLoad =
15194 DAG.getLoad(SclrLoadTy, dl, Ld->getChain(), Ptr, Ld->getPointerInfo(),
15195 Ld->isVolatile(), Ld->isNonTemporal(), Ld->isInvariant(),
15196 Ld->getAlignment());
15197 Chains.push_back(ScalarLoad.getValue(1));
15198 // Create the first element type using SCALAR_TO_VECTOR in order to avoid
15199 // another round of DAGCombining.
15201 Res = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, LoadUnitVecVT, ScalarLoad);
15203 Res = DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, LoadUnitVecVT, Res,
15204 ScalarLoad, DAG.getIntPtrConstant(i, dl));
15206 Ptr = DAG.getNode(ISD::ADD, dl, Ptr.getValueType(), Ptr, Increment);
15209 SDValue TF = DAG.getNode(ISD::TokenFactor, dl, MVT::Other, Chains);
15211 // Bitcast the loaded value to a vector of the original element type, in
15212 // the size of the target vector type.
15213 SDValue SlicedVec = DAG.getBitcast(WideVecVT, Res);
15214 unsigned SizeRatio = RegSz / MemSz;
15216 if (Ext == ISD::SEXTLOAD) {
15217 // If we have SSE4.1, we can directly emit a VSEXT node.
15218 if (Subtarget->hasSSE41()) {
15219 SDValue Sext = DAG.getNode(X86ISD::VSEXT, dl, RegVT, SlicedVec);
15220 DAG.ReplaceAllUsesOfValueWith(SDValue(Ld, 1), TF);
15224 // Otherwise we'll use SIGN_EXTEND_VECTOR_INREG to sign extend the lowest
15226 assert(TLI.isOperationLegalOrCustom(ISD::SIGN_EXTEND_VECTOR_INREG, RegVT) &&
15227 "We can't implement a sext load without SIGN_EXTEND_VECTOR_INREG!");
15229 SDValue Shuff = DAG.getSignExtendVectorInReg(SlicedVec, dl, RegVT);
15230 DAG.ReplaceAllUsesOfValueWith(SDValue(Ld, 1), TF);
15234 // Redistribute the loaded elements into the different locations.
15235 SmallVector<int, 16> ShuffleVec(NumElems * SizeRatio, -1);
15236 for (unsigned i = 0; i != NumElems; ++i)
15237 ShuffleVec[i * SizeRatio] = i;
15239 SDValue Shuff = DAG.getVectorShuffle(WideVecVT, dl, SlicedVec,
15240 DAG.getUNDEF(WideVecVT), &ShuffleVec[0]);
15242 // Bitcast to the requested type.
15243 Shuff = DAG.getBitcast(RegVT, Shuff);
15244 DAG.ReplaceAllUsesOfValueWith(SDValue(Ld, 1), TF);
15248 // isAndOrOfSingleUseSetCCs - Return true if node is an ISD::AND or
15249 // ISD::OR of two X86ISD::SETCC nodes each of which has no other use apart
15250 // from the AND / OR.
15251 static bool isAndOrOfSetCCs(SDValue Op, unsigned &Opc) {
15252 Opc = Op.getOpcode();
15253 if (Opc != ISD::OR && Opc != ISD::AND)
15255 return (Op.getOperand(0).getOpcode() == X86ISD::SETCC &&
15256 Op.getOperand(0).hasOneUse() &&
15257 Op.getOperand(1).getOpcode() == X86ISD::SETCC &&
15258 Op.getOperand(1).hasOneUse());
15261 // isXor1OfSetCC - Return true if node is an ISD::XOR of a X86ISD::SETCC and
15262 // 1 and that the SETCC node has a single use.
15263 static bool isXor1OfSetCC(SDValue Op) {
15264 if (Op.getOpcode() != ISD::XOR)
15266 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(Op.getOperand(1));
15267 if (N1C && N1C->getAPIntValue() == 1) {
15268 return Op.getOperand(0).getOpcode() == X86ISD::SETCC &&
15269 Op.getOperand(0).hasOneUse();
15274 SDValue X86TargetLowering::LowerBRCOND(SDValue Op, SelectionDAG &DAG) const {
15275 bool addTest = true;
15276 SDValue Chain = Op.getOperand(0);
15277 SDValue Cond = Op.getOperand(1);
15278 SDValue Dest = Op.getOperand(2);
15281 bool Inverted = false;
15283 if (Cond.getOpcode() == ISD::SETCC) {
15284 // Check for setcc([su]{add,sub,mul}o == 0).
15285 if (cast<CondCodeSDNode>(Cond.getOperand(2))->get() == ISD::SETEQ &&
15286 isa<ConstantSDNode>(Cond.getOperand(1)) &&
15287 cast<ConstantSDNode>(Cond.getOperand(1))->isNullValue() &&
15288 Cond.getOperand(0).getResNo() == 1 &&
15289 (Cond.getOperand(0).getOpcode() == ISD::SADDO ||
15290 Cond.getOperand(0).getOpcode() == ISD::UADDO ||
15291 Cond.getOperand(0).getOpcode() == ISD::SSUBO ||
15292 Cond.getOperand(0).getOpcode() == ISD::USUBO ||
15293 Cond.getOperand(0).getOpcode() == ISD::SMULO ||
15294 Cond.getOperand(0).getOpcode() == ISD::UMULO)) {
15296 Cond = Cond.getOperand(0);
15298 SDValue NewCond = LowerSETCC(Cond, DAG);
15299 if (NewCond.getNode())
15304 // FIXME: LowerXALUO doesn't handle these!!
15305 else if (Cond.getOpcode() == X86ISD::ADD ||
15306 Cond.getOpcode() == X86ISD::SUB ||
15307 Cond.getOpcode() == X86ISD::SMUL ||
15308 Cond.getOpcode() == X86ISD::UMUL)
15309 Cond = LowerXALUO(Cond, DAG);
15312 // Look pass (and (setcc_carry (cmp ...)), 1).
15313 if (Cond.getOpcode() == ISD::AND &&
15314 Cond.getOperand(0).getOpcode() == X86ISD::SETCC_CARRY) {
15315 ConstantSDNode *C = dyn_cast<ConstantSDNode>(Cond.getOperand(1));
15316 if (C && C->getAPIntValue() == 1)
15317 Cond = Cond.getOperand(0);
15320 // If condition flag is set by a X86ISD::CMP, then use it as the condition
15321 // setting operand in place of the X86ISD::SETCC.
15322 unsigned CondOpcode = Cond.getOpcode();
15323 if (CondOpcode == X86ISD::SETCC ||
15324 CondOpcode == X86ISD::SETCC_CARRY) {
15325 CC = Cond.getOperand(0);
15327 SDValue Cmp = Cond.getOperand(1);
15328 unsigned Opc = Cmp.getOpcode();
15329 // FIXME: WHY THE SPECIAL CASING OF LogicalCmp??
15330 if (isX86LogicalCmp(Cmp) || Opc == X86ISD::BT) {
15334 switch (cast<ConstantSDNode>(CC)->getZExtValue()) {
15338 // These can only come from an arithmetic instruction with overflow,
15339 // e.g. SADDO, UADDO.
15340 Cond = Cond.getNode()->getOperand(1);
15346 CondOpcode = Cond.getOpcode();
15347 if (CondOpcode == ISD::UADDO || CondOpcode == ISD::SADDO ||
15348 CondOpcode == ISD::USUBO || CondOpcode == ISD::SSUBO ||
15349 ((CondOpcode == ISD::UMULO || CondOpcode == ISD::SMULO) &&
15350 Cond.getOperand(0).getValueType() != MVT::i8)) {
15351 SDValue LHS = Cond.getOperand(0);
15352 SDValue RHS = Cond.getOperand(1);
15353 unsigned X86Opcode;
15356 // Keep this in sync with LowerXALUO, otherwise we might create redundant
15357 // instructions that can't be removed afterwards (i.e. X86ISD::ADD and
15359 switch (CondOpcode) {
15360 case ISD::UADDO: X86Opcode = X86ISD::ADD; X86Cond = X86::COND_B; break;
15362 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(RHS))
15364 X86Opcode = X86ISD::INC; X86Cond = X86::COND_O;
15367 X86Opcode = X86ISD::ADD; X86Cond = X86::COND_O; break;
15368 case ISD::USUBO: X86Opcode = X86ISD::SUB; X86Cond = X86::COND_B; break;
15370 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(RHS))
15372 X86Opcode = X86ISD::DEC; X86Cond = X86::COND_O;
15375 X86Opcode = X86ISD::SUB; X86Cond = X86::COND_O; break;
15376 case ISD::UMULO: X86Opcode = X86ISD::UMUL; X86Cond = X86::COND_O; break;
15377 case ISD::SMULO: X86Opcode = X86ISD::SMUL; X86Cond = X86::COND_O; break;
15378 default: llvm_unreachable("unexpected overflowing operator");
15381 X86Cond = X86::GetOppositeBranchCondition((X86::CondCode)X86Cond);
15382 if (CondOpcode == ISD::UMULO)
15383 VTs = DAG.getVTList(LHS.getValueType(), LHS.getValueType(),
15386 VTs = DAG.getVTList(LHS.getValueType(), MVT::i32);
15388 SDValue X86Op = DAG.getNode(X86Opcode, dl, VTs, LHS, RHS);
15390 if (CondOpcode == ISD::UMULO)
15391 Cond = X86Op.getValue(2);
15393 Cond = X86Op.getValue(1);
15395 CC = DAG.getConstant(X86Cond, dl, MVT::i8);
15399 if (Cond.hasOneUse() && isAndOrOfSetCCs(Cond, CondOpc)) {
15400 SDValue Cmp = Cond.getOperand(0).getOperand(1);
15401 if (CondOpc == ISD::OR) {
15402 // Also, recognize the pattern generated by an FCMP_UNE. We can emit
15403 // two branches instead of an explicit OR instruction with a
15405 if (Cmp == Cond.getOperand(1).getOperand(1) &&
15406 isX86LogicalCmp(Cmp)) {
15407 CC = Cond.getOperand(0).getOperand(0);
15408 Chain = DAG.getNode(X86ISD::BRCOND, dl, Op.getValueType(),
15409 Chain, Dest, CC, Cmp);
15410 CC = Cond.getOperand(1).getOperand(0);
15414 } else { // ISD::AND
15415 // Also, recognize the pattern generated by an FCMP_OEQ. We can emit
15416 // two branches instead of an explicit AND instruction with a
15417 // separate test. However, we only do this if this block doesn't
15418 // have a fall-through edge, because this requires an explicit
15419 // jmp when the condition is false.
15420 if (Cmp == Cond.getOperand(1).getOperand(1) &&
15421 isX86LogicalCmp(Cmp) &&
15422 Op.getNode()->hasOneUse()) {
15423 X86::CondCode CCode =
15424 (X86::CondCode)Cond.getOperand(0).getConstantOperandVal(0);
15425 CCode = X86::GetOppositeBranchCondition(CCode);
15426 CC = DAG.getConstant(CCode, dl, MVT::i8);
15427 SDNode *User = *Op.getNode()->use_begin();
15428 // Look for an unconditional branch following this conditional branch.
15429 // We need this because we need to reverse the successors in order
15430 // to implement FCMP_OEQ.
15431 if (User->getOpcode() == ISD::BR) {
15432 SDValue FalseBB = User->getOperand(1);
15434 DAG.UpdateNodeOperands(User, User->getOperand(0), Dest);
15435 assert(NewBR == User);
15439 Chain = DAG.getNode(X86ISD::BRCOND, dl, Op.getValueType(),
15440 Chain, Dest, CC, Cmp);
15441 X86::CondCode CCode =
15442 (X86::CondCode)Cond.getOperand(1).getConstantOperandVal(0);
15443 CCode = X86::GetOppositeBranchCondition(CCode);
15444 CC = DAG.getConstant(CCode, dl, MVT::i8);
15450 } else if (Cond.hasOneUse() && isXor1OfSetCC(Cond)) {
15451 // Recognize for xorb (setcc), 1 patterns. The xor inverts the condition.
15452 // It should be transformed during dag combiner except when the condition
15453 // is set by a arithmetics with overflow node.
15454 X86::CondCode CCode =
15455 (X86::CondCode)Cond.getOperand(0).getConstantOperandVal(0);
15456 CCode = X86::GetOppositeBranchCondition(CCode);
15457 CC = DAG.getConstant(CCode, dl, MVT::i8);
15458 Cond = Cond.getOperand(0).getOperand(1);
15460 } else if (Cond.getOpcode() == ISD::SETCC &&
15461 cast<CondCodeSDNode>(Cond.getOperand(2))->get() == ISD::SETOEQ) {
15462 // For FCMP_OEQ, we can emit
15463 // two branches instead of an explicit AND instruction with a
15464 // separate test. However, we only do this if this block doesn't
15465 // have a fall-through edge, because this requires an explicit
15466 // jmp when the condition is false.
15467 if (Op.getNode()->hasOneUse()) {
15468 SDNode *User = *Op.getNode()->use_begin();
15469 // Look for an unconditional branch following this conditional branch.
15470 // We need this because we need to reverse the successors in order
15471 // to implement FCMP_OEQ.
15472 if (User->getOpcode() == ISD::BR) {
15473 SDValue FalseBB = User->getOperand(1);
15475 DAG.UpdateNodeOperands(User, User->getOperand(0), Dest);
15476 assert(NewBR == User);
15480 SDValue Cmp = DAG.getNode(X86ISD::CMP, dl, MVT::i32,
15481 Cond.getOperand(0), Cond.getOperand(1));
15482 Cmp = ConvertCmpIfNecessary(Cmp, DAG);
15483 CC = DAG.getConstant(X86::COND_NE, dl, MVT::i8);
15484 Chain = DAG.getNode(X86ISD::BRCOND, dl, Op.getValueType(),
15485 Chain, Dest, CC, Cmp);
15486 CC = DAG.getConstant(X86::COND_P, dl, MVT::i8);
15491 } else if (Cond.getOpcode() == ISD::SETCC &&
15492 cast<CondCodeSDNode>(Cond.getOperand(2))->get() == ISD::SETUNE) {
15493 // For FCMP_UNE, we can emit
15494 // two branches instead of an explicit AND instruction with a
15495 // separate test. However, we only do this if this block doesn't
15496 // have a fall-through edge, because this requires an explicit
15497 // jmp when the condition is false.
15498 if (Op.getNode()->hasOneUse()) {
15499 SDNode *User = *Op.getNode()->use_begin();
15500 // Look for an unconditional branch following this conditional branch.
15501 // We need this because we need to reverse the successors in order
15502 // to implement FCMP_UNE.
15503 if (User->getOpcode() == ISD::BR) {
15504 SDValue FalseBB = User->getOperand(1);
15506 DAG.UpdateNodeOperands(User, User->getOperand(0), Dest);
15507 assert(NewBR == User);
15510 SDValue Cmp = DAG.getNode(X86ISD::CMP, dl, MVT::i32,
15511 Cond.getOperand(0), Cond.getOperand(1));
15512 Cmp = ConvertCmpIfNecessary(Cmp, DAG);
15513 CC = DAG.getConstant(X86::COND_NE, dl, MVT::i8);
15514 Chain = DAG.getNode(X86ISD::BRCOND, dl, Op.getValueType(),
15515 Chain, Dest, CC, Cmp);
15516 CC = DAG.getConstant(X86::COND_NP, dl, MVT::i8);
15526 // Look pass the truncate if the high bits are known zero.
15527 if (isTruncWithZeroHighBitsInput(Cond, DAG))
15528 Cond = Cond.getOperand(0);
15530 // We know the result of AND is compared against zero. Try to match
15532 if (Cond.getOpcode() == ISD::AND && Cond.hasOneUse()) {
15533 SDValue NewSetCC = LowerToBT(Cond, ISD::SETNE, dl, DAG);
15534 if (NewSetCC.getNode()) {
15535 CC = NewSetCC.getOperand(0);
15536 Cond = NewSetCC.getOperand(1);
15543 X86::CondCode X86Cond = Inverted ? X86::COND_E : X86::COND_NE;
15544 CC = DAG.getConstant(X86Cond, dl, MVT::i8);
15545 Cond = EmitTest(Cond, X86Cond, dl, DAG);
15547 Cond = ConvertCmpIfNecessary(Cond, DAG);
15548 return DAG.getNode(X86ISD::BRCOND, dl, Op.getValueType(),
15549 Chain, Dest, CC, Cond);
15552 // Lower dynamic stack allocation to _alloca call for Cygwin/Mingw targets.
15553 // Calls to _alloca are needed to probe the stack when allocating more than 4k
15554 // bytes in one go. Touching the stack at 4K increments is necessary to ensure
15555 // that the guard pages used by the OS virtual memory manager are allocated in
15556 // correct sequence.
15558 X86TargetLowering::LowerDYNAMIC_STACKALLOC(SDValue Op,
15559 SelectionDAG &DAG) const {
15560 MachineFunction &MF = DAG.getMachineFunction();
15561 bool SplitStack = MF.shouldSplitStack();
15562 bool Lower = (Subtarget->isOSWindows() && !Subtarget->isTargetMachO()) ||
15567 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
15568 SDNode* Node = Op.getNode();
15570 unsigned SPReg = TLI.getStackPointerRegisterToSaveRestore();
15571 assert(SPReg && "Target cannot require DYNAMIC_STACKALLOC expansion and"
15572 " not tell us which reg is the stack pointer!");
15573 EVT VT = Node->getValueType(0);
15574 SDValue Tmp1 = SDValue(Node, 0);
15575 SDValue Tmp2 = SDValue(Node, 1);
15576 SDValue Tmp3 = Node->getOperand(2);
15577 SDValue Chain = Tmp1.getOperand(0);
15579 // Chain the dynamic stack allocation so that it doesn't modify the stack
15580 // pointer when other instructions are using the stack.
15581 Chain = DAG.getCALLSEQ_START(Chain, DAG.getIntPtrConstant(0, dl, true),
15584 SDValue Size = Tmp2.getOperand(1);
15585 SDValue SP = DAG.getCopyFromReg(Chain, dl, SPReg, VT);
15586 Chain = SP.getValue(1);
15587 unsigned Align = cast<ConstantSDNode>(Tmp3)->getZExtValue();
15588 const TargetFrameLowering &TFI = *Subtarget->getFrameLowering();
15589 unsigned StackAlign = TFI.getStackAlignment();
15590 Tmp1 = DAG.getNode(ISD::SUB, dl, VT, SP, Size); // Value
15591 if (Align > StackAlign)
15592 Tmp1 = DAG.getNode(ISD::AND, dl, VT, Tmp1,
15593 DAG.getConstant(-(uint64_t)Align, dl, VT));
15594 Chain = DAG.getCopyToReg(Chain, dl, SPReg, Tmp1); // Output chain
15596 Tmp2 = DAG.getCALLSEQ_END(Chain, DAG.getIntPtrConstant(0, dl, true),
15597 DAG.getIntPtrConstant(0, dl, true), SDValue(),
15600 SDValue Ops[2] = { Tmp1, Tmp2 };
15601 return DAG.getMergeValues(Ops, dl);
15605 SDValue Chain = Op.getOperand(0);
15606 SDValue Size = Op.getOperand(1);
15607 unsigned Align = cast<ConstantSDNode>(Op.getOperand(2))->getZExtValue();
15608 EVT VT = Op.getNode()->getValueType(0);
15610 bool Is64Bit = Subtarget->is64Bit();
15611 MVT SPTy = getPointerTy(DAG.getDataLayout());
15614 MachineRegisterInfo &MRI = MF.getRegInfo();
15617 // The 64 bit implementation of segmented stacks needs to clobber both r10
15618 // r11. This makes it impossible to use it along with nested parameters.
15619 const Function *F = MF.getFunction();
15621 for (Function::const_arg_iterator I = F->arg_begin(), E = F->arg_end();
15623 if (I->hasNestAttr())
15624 report_fatal_error("Cannot use segmented stacks with functions that "
15625 "have nested arguments.");
15628 const TargetRegisterClass *AddrRegClass = getRegClassFor(SPTy);
15629 unsigned Vreg = MRI.createVirtualRegister(AddrRegClass);
15630 Chain = DAG.getCopyToReg(Chain, dl, Vreg, Size);
15631 SDValue Value = DAG.getNode(X86ISD::SEG_ALLOCA, dl, SPTy, Chain,
15632 DAG.getRegister(Vreg, SPTy));
15633 SDValue Ops1[2] = { Value, Chain };
15634 return DAG.getMergeValues(Ops1, dl);
15637 const unsigned Reg = (Subtarget->isTarget64BitLP64() ? X86::RAX : X86::EAX);
15639 Chain = DAG.getCopyToReg(Chain, dl, Reg, Size, Flag);
15640 Flag = Chain.getValue(1);
15641 SDVTList NodeTys = DAG.getVTList(MVT::Other, MVT::Glue);
15643 Chain = DAG.getNode(X86ISD::WIN_ALLOCA, dl, NodeTys, Chain, Flag);
15645 const X86RegisterInfo *RegInfo = Subtarget->getRegisterInfo();
15646 unsigned SPReg = RegInfo->getStackRegister();
15647 SDValue SP = DAG.getCopyFromReg(Chain, dl, SPReg, SPTy);
15648 Chain = SP.getValue(1);
15651 SP = DAG.getNode(ISD::AND, dl, VT, SP.getValue(0),
15652 DAG.getConstant(-(uint64_t)Align, dl, VT));
15653 Chain = DAG.getCopyToReg(Chain, dl, SPReg, SP);
15656 SDValue Ops1[2] = { SP, Chain };
15657 return DAG.getMergeValues(Ops1, dl);
15661 SDValue X86TargetLowering::LowerVASTART(SDValue Op, SelectionDAG &DAG) const {
15662 MachineFunction &MF = DAG.getMachineFunction();
15663 auto PtrVT = getPointerTy(MF.getDataLayout());
15664 X86MachineFunctionInfo *FuncInfo = MF.getInfo<X86MachineFunctionInfo>();
15666 const Value *SV = cast<SrcValueSDNode>(Op.getOperand(2))->getValue();
15669 if (!Subtarget->is64Bit() ||
15670 Subtarget->isCallingConvWin64(MF.getFunction()->getCallingConv())) {
15671 // vastart just stores the address of the VarArgsFrameIndex slot into the
15672 // memory location argument.
15673 SDValue FR = DAG.getFrameIndex(FuncInfo->getVarArgsFrameIndex(), PtrVT);
15674 return DAG.getStore(Op.getOperand(0), DL, FR, Op.getOperand(1),
15675 MachinePointerInfo(SV), false, false, 0);
15679 // gp_offset (0 - 6 * 8)
15680 // fp_offset (48 - 48 + 8 * 16)
15681 // overflow_arg_area (point to parameters coming in memory).
15683 SmallVector<SDValue, 8> MemOps;
15684 SDValue FIN = Op.getOperand(1);
15686 SDValue Store = DAG.getStore(Op.getOperand(0), DL,
15687 DAG.getConstant(FuncInfo->getVarArgsGPOffset(),
15689 FIN, MachinePointerInfo(SV), false, false, 0);
15690 MemOps.push_back(Store);
15693 FIN = DAG.getNode(ISD::ADD, DL, PtrVT, FIN, DAG.getIntPtrConstant(4, DL));
15694 Store = DAG.getStore(Op.getOperand(0), DL,
15695 DAG.getConstant(FuncInfo->getVarArgsFPOffset(), DL,
15697 FIN, MachinePointerInfo(SV, 4), false, false, 0);
15698 MemOps.push_back(Store);
15700 // Store ptr to overflow_arg_area
15701 FIN = DAG.getNode(ISD::ADD, DL, PtrVT, FIN, DAG.getIntPtrConstant(4, DL));
15702 SDValue OVFIN = DAG.getFrameIndex(FuncInfo->getVarArgsFrameIndex(), PtrVT);
15703 Store = DAG.getStore(Op.getOperand(0), DL, OVFIN, FIN,
15704 MachinePointerInfo(SV, 8),
15706 MemOps.push_back(Store);
15708 // Store ptr to reg_save_area.
15709 FIN = DAG.getNode(ISD::ADD, DL, PtrVT, FIN, DAG.getIntPtrConstant(
15710 Subtarget->isTarget64BitLP64() ? 8 : 4, DL));
15711 SDValue RSFIN = DAG.getFrameIndex(FuncInfo->getRegSaveFrameIndex(), PtrVT);
15712 Store = DAG.getStore(Op.getOperand(0), DL, RSFIN, FIN, MachinePointerInfo(
15713 SV, Subtarget->isTarget64BitLP64() ? 16 : 12), false, false, 0);
15714 MemOps.push_back(Store);
15715 return DAG.getNode(ISD::TokenFactor, DL, MVT::Other, MemOps);
15718 SDValue X86TargetLowering::LowerVAARG(SDValue Op, SelectionDAG &DAG) const {
15719 assert(Subtarget->is64Bit() &&
15720 "LowerVAARG only handles 64-bit va_arg!");
15721 assert(Op.getNode()->getNumOperands() == 4);
15723 MachineFunction &MF = DAG.getMachineFunction();
15724 if (Subtarget->isCallingConvWin64(MF.getFunction()->getCallingConv()))
15725 // The Win64 ABI uses char* instead of a structure.
15726 return DAG.expandVAArg(Op.getNode());
15728 SDValue Chain = Op.getOperand(0);
15729 SDValue SrcPtr = Op.getOperand(1);
15730 const Value *SV = cast<SrcValueSDNode>(Op.getOperand(2))->getValue();
15731 unsigned Align = Op.getConstantOperandVal(3);
15734 EVT ArgVT = Op.getNode()->getValueType(0);
15735 Type *ArgTy = ArgVT.getTypeForEVT(*DAG.getContext());
15736 uint32_t ArgSize = DAG.getDataLayout().getTypeAllocSize(ArgTy);
15739 // Decide which area this value should be read from.
15740 // TODO: Implement the AMD64 ABI in its entirety. This simple
15741 // selection mechanism works only for the basic types.
15742 if (ArgVT == MVT::f80) {
15743 llvm_unreachable("va_arg for f80 not yet implemented");
15744 } else if (ArgVT.isFloatingPoint() && ArgSize <= 16 /*bytes*/) {
15745 ArgMode = 2; // Argument passed in XMM register. Use fp_offset.
15746 } else if (ArgVT.isInteger() && ArgSize <= 32 /*bytes*/) {
15747 ArgMode = 1; // Argument passed in GPR64 register(s). Use gp_offset.
15749 llvm_unreachable("Unhandled argument type in LowerVAARG");
15752 if (ArgMode == 2) {
15753 // Sanity Check: Make sure using fp_offset makes sense.
15754 assert(!Subtarget->useSoftFloat() &&
15755 !(MF.getFunction()->hasFnAttribute(Attribute::NoImplicitFloat)) &&
15756 Subtarget->hasSSE1());
15759 // Insert VAARG_64 node into the DAG
15760 // VAARG_64 returns two values: Variable Argument Address, Chain
15761 SDValue InstOps[] = {Chain, SrcPtr, DAG.getConstant(ArgSize, dl, MVT::i32),
15762 DAG.getConstant(ArgMode, dl, MVT::i8),
15763 DAG.getConstant(Align, dl, MVT::i32)};
15764 SDVTList VTs = DAG.getVTList(getPointerTy(DAG.getDataLayout()), MVT::Other);
15765 SDValue VAARG = DAG.getMemIntrinsicNode(X86ISD::VAARG_64, dl,
15766 VTs, InstOps, MVT::i64,
15767 MachinePointerInfo(SV),
15769 /*Volatile=*/false,
15771 /*WriteMem=*/true);
15772 Chain = VAARG.getValue(1);
15774 // Load the next argument and return it
15775 return DAG.getLoad(ArgVT, dl,
15778 MachinePointerInfo(),
15779 false, false, false, 0);
15782 static SDValue LowerVACOPY(SDValue Op, const X86Subtarget *Subtarget,
15783 SelectionDAG &DAG) {
15784 // X86-64 va_list is a struct { i32, i32, i8*, i8* }, except on Windows,
15785 // where a va_list is still an i8*.
15786 assert(Subtarget->is64Bit() && "This code only handles 64-bit va_copy!");
15787 if (Subtarget->isCallingConvWin64(
15788 DAG.getMachineFunction().getFunction()->getCallingConv()))
15789 // Probably a Win64 va_copy.
15790 return DAG.expandVACopy(Op.getNode());
15792 SDValue Chain = Op.getOperand(0);
15793 SDValue DstPtr = Op.getOperand(1);
15794 SDValue SrcPtr = Op.getOperand(2);
15795 const Value *DstSV = cast<SrcValueSDNode>(Op.getOperand(3))->getValue();
15796 const Value *SrcSV = cast<SrcValueSDNode>(Op.getOperand(4))->getValue();
15799 return DAG.getMemcpy(Chain, DL, DstPtr, SrcPtr,
15800 DAG.getIntPtrConstant(24, DL), 8, /*isVolatile*/false,
15802 MachinePointerInfo(DstSV), MachinePointerInfo(SrcSV));
15805 // getTargetVShiftByConstNode - Handle vector element shifts where the shift
15806 // amount is a constant. Takes immediate version of shift as input.
15807 static SDValue getTargetVShiftByConstNode(unsigned Opc, SDLoc dl, MVT VT,
15808 SDValue SrcOp, uint64_t ShiftAmt,
15809 SelectionDAG &DAG) {
15810 MVT ElementType = VT.getVectorElementType();
15812 // Fold this packed shift into its first operand if ShiftAmt is 0.
15816 // Check for ShiftAmt >= element width
15817 if (ShiftAmt >= ElementType.getSizeInBits()) {
15818 if (Opc == X86ISD::VSRAI)
15819 ShiftAmt = ElementType.getSizeInBits() - 1;
15821 return DAG.getConstant(0, dl, VT);
15824 assert((Opc == X86ISD::VSHLI || Opc == X86ISD::VSRLI || Opc == X86ISD::VSRAI)
15825 && "Unknown target vector shift-by-constant node");
15827 // Fold this packed vector shift into a build vector if SrcOp is a
15828 // vector of Constants or UNDEFs, and SrcOp valuetype is the same as VT.
15829 if (VT == SrcOp.getSimpleValueType() &&
15830 ISD::isBuildVectorOfConstantSDNodes(SrcOp.getNode())) {
15831 SmallVector<SDValue, 8> Elts;
15832 unsigned NumElts = SrcOp->getNumOperands();
15833 ConstantSDNode *ND;
15836 default: llvm_unreachable(nullptr);
15837 case X86ISD::VSHLI:
15838 for (unsigned i=0; i!=NumElts; ++i) {
15839 SDValue CurrentOp = SrcOp->getOperand(i);
15840 if (CurrentOp->getOpcode() == ISD::UNDEF) {
15841 Elts.push_back(CurrentOp);
15844 ND = cast<ConstantSDNode>(CurrentOp);
15845 const APInt &C = ND->getAPIntValue();
15846 Elts.push_back(DAG.getConstant(C.shl(ShiftAmt), dl, ElementType));
15849 case X86ISD::VSRLI:
15850 for (unsigned i=0; i!=NumElts; ++i) {
15851 SDValue CurrentOp = SrcOp->getOperand(i);
15852 if (CurrentOp->getOpcode() == ISD::UNDEF) {
15853 Elts.push_back(CurrentOp);
15856 ND = cast<ConstantSDNode>(CurrentOp);
15857 const APInt &C = ND->getAPIntValue();
15858 Elts.push_back(DAG.getConstant(C.lshr(ShiftAmt), dl, ElementType));
15861 case X86ISD::VSRAI:
15862 for (unsigned i=0; i!=NumElts; ++i) {
15863 SDValue CurrentOp = SrcOp->getOperand(i);
15864 if (CurrentOp->getOpcode() == ISD::UNDEF) {
15865 Elts.push_back(CurrentOp);
15868 ND = cast<ConstantSDNode>(CurrentOp);
15869 const APInt &C = ND->getAPIntValue();
15870 Elts.push_back(DAG.getConstant(C.ashr(ShiftAmt), dl, ElementType));
15875 return DAG.getNode(ISD::BUILD_VECTOR, dl, VT, Elts);
15878 return DAG.getNode(Opc, dl, VT, SrcOp,
15879 DAG.getConstant(ShiftAmt, dl, MVT::i8));
15882 // getTargetVShiftNode - Handle vector element shifts where the shift amount
15883 // may or may not be a constant. Takes immediate version of shift as input.
15884 static SDValue getTargetVShiftNode(unsigned Opc, SDLoc dl, MVT VT,
15885 SDValue SrcOp, SDValue ShAmt,
15886 SelectionDAG &DAG) {
15887 MVT SVT = ShAmt.getSimpleValueType();
15888 assert((SVT == MVT::i32 || SVT == MVT::i64) && "Unexpected value type!");
15890 // Catch shift-by-constant.
15891 if (ConstantSDNode *CShAmt = dyn_cast<ConstantSDNode>(ShAmt))
15892 return getTargetVShiftByConstNode(Opc, dl, VT, SrcOp,
15893 CShAmt->getZExtValue(), DAG);
15895 // Change opcode to non-immediate version
15897 default: llvm_unreachable("Unknown target vector shift node");
15898 case X86ISD::VSHLI: Opc = X86ISD::VSHL; break;
15899 case X86ISD::VSRLI: Opc = X86ISD::VSRL; break;
15900 case X86ISD::VSRAI: Opc = X86ISD::VSRA; break;
15903 const X86Subtarget &Subtarget =
15904 static_cast<const X86Subtarget &>(DAG.getSubtarget());
15905 if (Subtarget.hasSSE41() && ShAmt.getOpcode() == ISD::ZERO_EXTEND &&
15906 ShAmt.getOperand(0).getSimpleValueType() == MVT::i16) {
15907 // Let the shuffle legalizer expand this shift amount node.
15908 SDValue Op0 = ShAmt.getOperand(0);
15909 Op0 = DAG.getNode(ISD::SCALAR_TO_VECTOR, SDLoc(Op0), MVT::v8i16, Op0);
15910 ShAmt = getShuffleVectorZeroOrUndef(Op0, 0, true, &Subtarget, DAG);
15912 // Need to build a vector containing shift amount.
15913 // SSE/AVX packed shifts only use the lower 64-bit of the shift count.
15914 SmallVector<SDValue, 4> ShOps;
15915 ShOps.push_back(ShAmt);
15916 if (SVT == MVT::i32) {
15917 ShOps.push_back(DAG.getConstant(0, dl, SVT));
15918 ShOps.push_back(DAG.getUNDEF(SVT));
15920 ShOps.push_back(DAG.getUNDEF(SVT));
15922 MVT BVT = SVT == MVT::i32 ? MVT::v4i32 : MVT::v2i64;
15923 ShAmt = DAG.getNode(ISD::BUILD_VECTOR, dl, BVT, ShOps);
15926 // The return type has to be a 128-bit type with the same element
15927 // type as the input type.
15928 MVT EltVT = VT.getVectorElementType();
15929 MVT ShVT = MVT::getVectorVT(EltVT, 128/EltVT.getSizeInBits());
15931 ShAmt = DAG.getBitcast(ShVT, ShAmt);
15932 return DAG.getNode(Opc, dl, VT, SrcOp, ShAmt);
15935 /// \brief Return (and \p Op, \p Mask) for compare instructions or
15936 /// (vselect \p Mask, \p Op, \p PreservedSrc) for others along with the
15937 /// necessary casting or extending for \p Mask when lowering masking intrinsics
15938 static SDValue getVectorMaskingNode(SDValue Op, SDValue Mask,
15939 SDValue PreservedSrc,
15940 const X86Subtarget *Subtarget,
15941 SelectionDAG &DAG) {
15942 MVT VT = Op.getSimpleValueType();
15943 MVT MaskVT = MVT::getVectorVT(MVT::i1, VT.getVectorNumElements());
15945 unsigned OpcodeSelect = ISD::VSELECT;
15948 if (isAllOnes(Mask))
15951 if (MaskVT.bitsGT(Mask.getSimpleValueType())) {
15952 MVT newMaskVT = MVT::getIntegerVT(MaskVT.getSizeInBits());
15953 VMask = DAG.getBitcast(MaskVT,
15954 DAG.getNode(ISD::ANY_EXTEND, dl, newMaskVT, Mask));
15956 MVT BitcastVT = MVT::getVectorVT(MVT::i1,
15957 Mask.getSimpleValueType().getSizeInBits());
15958 // In case when MaskVT equals v2i1 or v4i1, low 2 or 4 elements
15959 // are extracted by EXTRACT_SUBVECTOR.
15960 VMask = DAG.getNode(ISD::EXTRACT_SUBVECTOR, dl, MaskVT,
15961 DAG.getBitcast(BitcastVT, Mask),
15962 DAG.getIntPtrConstant(0, dl));
15965 switch (Op.getOpcode()) {
15967 case X86ISD::PCMPEQM:
15968 case X86ISD::PCMPGTM:
15970 case X86ISD::CMPMU:
15971 return DAG.getNode(ISD::AND, dl, VT, Op, VMask);
15972 case X86ISD::VFPCLASS:
15973 return DAG.getNode(ISD::OR, dl, VT, Op, VMask);
15974 case X86ISD::VTRUNC:
15975 case X86ISD::VTRUNCS:
15976 case X86ISD::VTRUNCUS:
15977 // We can't use ISD::VSELECT here because it is not always "Legal"
15978 // for the destination type. For example vpmovqb require only AVX512
15979 // and vselect that can operate on byte element type require BWI
15980 OpcodeSelect = X86ISD::SELECT;
15983 if (PreservedSrc.getOpcode() == ISD::UNDEF)
15984 PreservedSrc = getZeroVector(VT, Subtarget, DAG, dl);
15985 return DAG.getNode(OpcodeSelect, dl, VT, VMask, Op, PreservedSrc);
15988 /// \brief Creates an SDNode for a predicated scalar operation.
15989 /// \returns (X86vselect \p Mask, \p Op, \p PreservedSrc).
15990 /// The mask is coming as MVT::i8 and it should be truncated
15991 /// to MVT::i1 while lowering masking intrinsics.
15992 /// The main difference between ScalarMaskingNode and VectorMaskingNode is using
15993 /// "X86select" instead of "vselect". We just can't create the "vselect" node
15994 /// for a scalar instruction.
15995 static SDValue getScalarMaskingNode(SDValue Op, SDValue Mask,
15996 SDValue PreservedSrc,
15997 const X86Subtarget *Subtarget,
15998 SelectionDAG &DAG) {
15999 if (isAllOnes(Mask))
16002 MVT VT = Op.getSimpleValueType();
16004 // The mask should be of type MVT::i1
16005 SDValue IMask = DAG.getNode(ISD::TRUNCATE, dl, MVT::i1, Mask);
16007 if (Op.getOpcode() == X86ISD::FSETCC)
16008 return DAG.getNode(ISD::AND, dl, VT, Op, IMask);
16009 if (Op.getOpcode() == X86ISD::VFPCLASS)
16010 return DAG.getNode(ISD::OR, dl, VT, Op, IMask);
16012 if (PreservedSrc.getOpcode() == ISD::UNDEF)
16013 PreservedSrc = getZeroVector(VT, Subtarget, DAG, dl);
16014 return DAG.getNode(X86ISD::SELECT, dl, VT, IMask, Op, PreservedSrc);
16017 static int getSEHRegistrationNodeSize(const Function *Fn) {
16018 if (!Fn->hasPersonalityFn())
16019 report_fatal_error(
16020 "querying registration node size for function without personality");
16021 // The RegNodeSize is 6 32-bit words for SEH and 4 for C++ EH. See
16022 // WinEHStatePass for the full struct definition.
16023 switch (classifyEHPersonality(Fn->getPersonalityFn())) {
16024 case EHPersonality::MSVC_X86SEH: return 24;
16025 case EHPersonality::MSVC_CXX: return 16;
16028 report_fatal_error("can only recover FP for MSVC EH personality functions");
16031 /// When the 32-bit MSVC runtime transfers control to us, either to an outlined
16032 /// function or when returning to a parent frame after catching an exception, we
16033 /// recover the parent frame pointer by doing arithmetic on the incoming EBP.
16034 /// Here's the math:
16035 /// RegNodeBase = EntryEBP - RegNodeSize
16036 /// ParentFP = RegNodeBase - RegNodeFrameOffset
16037 /// Subtracting RegNodeSize takes us to the offset of the registration node, and
16038 /// subtracting the offset (negative on x86) takes us back to the parent FP.
16039 static SDValue recoverFramePointer(SelectionDAG &DAG, const Function *Fn,
16040 SDValue EntryEBP) {
16041 MachineFunction &MF = DAG.getMachineFunction();
16044 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
16045 MVT PtrVT = TLI.getPointerTy(DAG.getDataLayout());
16047 // It's possible that the parent function no longer has a personality function
16048 // if the exceptional code was optimized away, in which case we just return
16049 // the incoming EBP.
16050 if (!Fn->hasPersonalityFn())
16053 int RegNodeSize = getSEHRegistrationNodeSize(Fn);
16055 // Get an MCSymbol that will ultimately resolve to the frame offset of the EH
16057 MCSymbol *OffsetSym =
16058 MF.getMMI().getContext().getOrCreateParentFrameOffsetSymbol(
16059 GlobalValue::getRealLinkageName(Fn->getName()));
16060 SDValue OffsetSymVal = DAG.getMCSymbol(OffsetSym, PtrVT);
16061 SDValue RegNodeFrameOffset =
16062 DAG.getNode(ISD::LOCAL_RECOVER, dl, PtrVT, OffsetSymVal);
16064 // RegNodeBase = EntryEBP - RegNodeSize
16065 // ParentFP = RegNodeBase - RegNodeFrameOffset
16066 SDValue RegNodeBase = DAG.getNode(ISD::SUB, dl, PtrVT, EntryEBP,
16067 DAG.getConstant(RegNodeSize, dl, PtrVT));
16068 return DAG.getNode(ISD::SUB, dl, PtrVT, RegNodeBase, RegNodeFrameOffset);
16071 static SDValue LowerINTRINSIC_WO_CHAIN(SDValue Op, const X86Subtarget *Subtarget,
16072 SelectionDAG &DAG) {
16074 unsigned IntNo = cast<ConstantSDNode>(Op.getOperand(0))->getZExtValue();
16075 MVT VT = Op.getSimpleValueType();
16076 const IntrinsicData* IntrData = getIntrinsicWithoutChain(IntNo);
16078 switch(IntrData->Type) {
16079 case INTR_TYPE_1OP:
16080 return DAG.getNode(IntrData->Opc0, dl, Op.getValueType(), Op.getOperand(1));
16081 case INTR_TYPE_2OP:
16082 return DAG.getNode(IntrData->Opc0, dl, Op.getValueType(), Op.getOperand(1),
16084 case INTR_TYPE_2OP_IMM8:
16085 return DAG.getNode(IntrData->Opc0, dl, Op.getValueType(), Op.getOperand(1),
16086 DAG.getNode(ISD::TRUNCATE, dl, MVT::i8, Op.getOperand(2)));
16087 case INTR_TYPE_3OP:
16088 return DAG.getNode(IntrData->Opc0, dl, Op.getValueType(), Op.getOperand(1),
16089 Op.getOperand(2), Op.getOperand(3));
16090 case INTR_TYPE_4OP:
16091 return DAG.getNode(IntrData->Opc0, dl, Op.getValueType(), Op.getOperand(1),
16092 Op.getOperand(2), Op.getOperand(3), Op.getOperand(4));
16093 case INTR_TYPE_1OP_MASK_RM: {
16094 SDValue Src = Op.getOperand(1);
16095 SDValue PassThru = Op.getOperand(2);
16096 SDValue Mask = Op.getOperand(3);
16097 SDValue RoundingMode;
16098 // We allways add rounding mode to the Node.
16099 // If the rounding mode is not specified, we add the
16100 // "current direction" mode.
16101 if (Op.getNumOperands() == 4)
16103 DAG.getConstant(X86::STATIC_ROUNDING::CUR_DIRECTION, dl, MVT::i32);
16105 RoundingMode = Op.getOperand(4);
16106 unsigned IntrWithRoundingModeOpcode = IntrData->Opc1;
16107 if (IntrWithRoundingModeOpcode != 0)
16108 if (cast<ConstantSDNode>(RoundingMode)->getZExtValue() !=
16109 X86::STATIC_ROUNDING::CUR_DIRECTION)
16110 return getVectorMaskingNode(DAG.getNode(IntrWithRoundingModeOpcode,
16111 dl, Op.getValueType(), Src, RoundingMode),
16112 Mask, PassThru, Subtarget, DAG);
16113 return getVectorMaskingNode(DAG.getNode(IntrData->Opc0, dl, VT, Src,
16115 Mask, PassThru, Subtarget, DAG);
16117 case INTR_TYPE_1OP_MASK: {
16118 SDValue Src = Op.getOperand(1);
16119 SDValue PassThru = Op.getOperand(2);
16120 SDValue Mask = Op.getOperand(3);
16121 // We add rounding mode to the Node when
16122 // - RM Opcode is specified and
16123 // - RM is not "current direction".
16124 unsigned IntrWithRoundingModeOpcode = IntrData->Opc1;
16125 if (IntrWithRoundingModeOpcode != 0) {
16126 SDValue Rnd = Op.getOperand(4);
16127 unsigned Round = cast<ConstantSDNode>(Rnd)->getZExtValue();
16128 if (Round != X86::STATIC_ROUNDING::CUR_DIRECTION) {
16129 return getVectorMaskingNode(DAG.getNode(IntrWithRoundingModeOpcode,
16130 dl, Op.getValueType(),
16132 Mask, PassThru, Subtarget, DAG);
16135 return getVectorMaskingNode(DAG.getNode(IntrData->Opc0, dl, VT, Src),
16136 Mask, PassThru, Subtarget, DAG);
16138 case INTR_TYPE_SCALAR_MASK: {
16139 SDValue Src1 = Op.getOperand(1);
16140 SDValue Src2 = Op.getOperand(2);
16141 SDValue passThru = Op.getOperand(3);
16142 SDValue Mask = Op.getOperand(4);
16143 return getScalarMaskingNode(DAG.getNode(IntrData->Opc0, dl, VT, Src1, Src2),
16144 Mask, passThru, Subtarget, DAG);
16146 case INTR_TYPE_SCALAR_MASK_RM: {
16147 SDValue Src1 = Op.getOperand(1);
16148 SDValue Src2 = Op.getOperand(2);
16149 SDValue Src0 = Op.getOperand(3);
16150 SDValue Mask = Op.getOperand(4);
16151 // There are 2 kinds of intrinsics in this group:
16152 // (1) With suppress-all-exceptions (sae) or rounding mode- 6 operands
16153 // (2) With rounding mode and sae - 7 operands.
16154 if (Op.getNumOperands() == 6) {
16155 SDValue Sae = Op.getOperand(5);
16156 unsigned Opc = IntrData->Opc1 ? IntrData->Opc1 : IntrData->Opc0;
16157 return getScalarMaskingNode(DAG.getNode(Opc, dl, VT, Src1, Src2,
16159 Mask, Src0, Subtarget, DAG);
16161 assert(Op.getNumOperands() == 7 && "Unexpected intrinsic form");
16162 SDValue RoundingMode = Op.getOperand(5);
16163 SDValue Sae = Op.getOperand(6);
16164 return getScalarMaskingNode(DAG.getNode(IntrData->Opc0, dl, VT, Src1, Src2,
16165 RoundingMode, Sae),
16166 Mask, Src0, Subtarget, DAG);
16168 case INTR_TYPE_2OP_MASK:
16169 case INTR_TYPE_2OP_IMM8_MASK: {
16170 SDValue Src1 = Op.getOperand(1);
16171 SDValue Src2 = Op.getOperand(2);
16172 SDValue PassThru = Op.getOperand(3);
16173 SDValue Mask = Op.getOperand(4);
16175 if (IntrData->Type == INTR_TYPE_2OP_IMM8_MASK)
16176 Src2 = DAG.getNode(ISD::TRUNCATE, dl, MVT::i8, Src2);
16178 // We specify 2 possible opcodes for intrinsics with rounding modes.
16179 // First, we check if the intrinsic may have non-default rounding mode,
16180 // (IntrData->Opc1 != 0), then we check the rounding mode operand.
16181 unsigned IntrWithRoundingModeOpcode = IntrData->Opc1;
16182 if (IntrWithRoundingModeOpcode != 0) {
16183 SDValue Rnd = Op.getOperand(5);
16184 unsigned Round = cast<ConstantSDNode>(Rnd)->getZExtValue();
16185 if (Round != X86::STATIC_ROUNDING::CUR_DIRECTION) {
16186 return getVectorMaskingNode(DAG.getNode(IntrWithRoundingModeOpcode,
16187 dl, Op.getValueType(),
16189 Mask, PassThru, Subtarget, DAG);
16192 // TODO: Intrinsics should have fast-math-flags to propagate.
16193 return getVectorMaskingNode(DAG.getNode(IntrData->Opc0, dl, VT,Src1,Src2),
16194 Mask, PassThru, Subtarget, DAG);
16196 case INTR_TYPE_2OP_MASK_RM: {
16197 SDValue Src1 = Op.getOperand(1);
16198 SDValue Src2 = Op.getOperand(2);
16199 SDValue PassThru = Op.getOperand(3);
16200 SDValue Mask = Op.getOperand(4);
16201 // We specify 2 possible modes for intrinsics, with/without rounding
16203 // First, we check if the intrinsic have rounding mode (6 operands),
16204 // if not, we set rounding mode to "current".
16206 if (Op.getNumOperands() == 6)
16207 Rnd = Op.getOperand(5);
16209 Rnd = DAG.getConstant(X86::STATIC_ROUNDING::CUR_DIRECTION, dl, MVT::i32);
16210 return getVectorMaskingNode(DAG.getNode(IntrData->Opc0, dl, VT,
16212 Mask, PassThru, Subtarget, DAG);
16214 case INTR_TYPE_3OP_SCALAR_MASK_RM: {
16215 SDValue Src1 = Op.getOperand(1);
16216 SDValue Src2 = Op.getOperand(2);
16217 SDValue Src3 = Op.getOperand(3);
16218 SDValue PassThru = Op.getOperand(4);
16219 SDValue Mask = Op.getOperand(5);
16220 SDValue Sae = Op.getOperand(6);
16222 return getScalarMaskingNode(DAG.getNode(IntrData->Opc0, dl, VT, Src1,
16224 Mask, PassThru, Subtarget, DAG);
16226 case INTR_TYPE_3OP_MASK_RM: {
16227 SDValue Src1 = Op.getOperand(1);
16228 SDValue Src2 = Op.getOperand(2);
16229 SDValue Imm = Op.getOperand(3);
16230 SDValue PassThru = Op.getOperand(4);
16231 SDValue Mask = Op.getOperand(5);
16232 // We specify 2 possible modes for intrinsics, with/without rounding
16234 // First, we check if the intrinsic have rounding mode (7 operands),
16235 // if not, we set rounding mode to "current".
16237 if (Op.getNumOperands() == 7)
16238 Rnd = Op.getOperand(6);
16240 Rnd = DAG.getConstant(X86::STATIC_ROUNDING::CUR_DIRECTION, dl, MVT::i32);
16241 return getVectorMaskingNode(DAG.getNode(IntrData->Opc0, dl, VT,
16242 Src1, Src2, Imm, Rnd),
16243 Mask, PassThru, Subtarget, DAG);
16245 case INTR_TYPE_3OP_IMM8_MASK:
16246 case INTR_TYPE_3OP_MASK:
16247 case INSERT_SUBVEC: {
16248 SDValue Src1 = Op.getOperand(1);
16249 SDValue Src2 = Op.getOperand(2);
16250 SDValue Src3 = Op.getOperand(3);
16251 SDValue PassThru = Op.getOperand(4);
16252 SDValue Mask = Op.getOperand(5);
16254 if (IntrData->Type == INTR_TYPE_3OP_IMM8_MASK)
16255 Src3 = DAG.getNode(ISD::TRUNCATE, dl, MVT::i8, Src3);
16256 else if (IntrData->Type == INSERT_SUBVEC) {
16257 // imm should be adapted to ISD::INSERT_SUBVECTOR behavior
16258 assert(isa<ConstantSDNode>(Src3) && "Expected a ConstantSDNode here!");
16259 unsigned Imm = cast<ConstantSDNode>(Src3)->getZExtValue();
16260 Imm *= Src2.getSimpleValueType().getVectorNumElements();
16261 Src3 = DAG.getTargetConstant(Imm, dl, MVT::i32);
16264 // We specify 2 possible opcodes for intrinsics with rounding modes.
16265 // First, we check if the intrinsic may have non-default rounding mode,
16266 // (IntrData->Opc1 != 0), then we check the rounding mode operand.
16267 unsigned IntrWithRoundingModeOpcode = IntrData->Opc1;
16268 if (IntrWithRoundingModeOpcode != 0) {
16269 SDValue Rnd = Op.getOperand(6);
16270 unsigned Round = cast<ConstantSDNode>(Rnd)->getZExtValue();
16271 if (Round != X86::STATIC_ROUNDING::CUR_DIRECTION) {
16272 return getVectorMaskingNode(DAG.getNode(IntrWithRoundingModeOpcode,
16273 dl, Op.getValueType(),
16274 Src1, Src2, Src3, Rnd),
16275 Mask, PassThru, Subtarget, DAG);
16278 return getVectorMaskingNode(DAG.getNode(IntrData->Opc0, dl, VT,
16280 Mask, PassThru, Subtarget, DAG);
16282 case VPERM_3OP_MASKZ:
16283 case VPERM_3OP_MASK:
16286 case FMA_OP_MASK: {
16287 SDValue Src1 = Op.getOperand(1);
16288 SDValue Src2 = Op.getOperand(2);
16289 SDValue Src3 = Op.getOperand(3);
16290 SDValue Mask = Op.getOperand(4);
16291 MVT VT = Op.getSimpleValueType();
16292 SDValue PassThru = SDValue();
16294 // set PassThru element
16295 if (IntrData->Type == VPERM_3OP_MASKZ || IntrData->Type == FMA_OP_MASKZ)
16296 PassThru = getZeroVector(VT, Subtarget, DAG, dl);
16297 else if (IntrData->Type == FMA_OP_MASK3)
16302 // We specify 2 possible opcodes for intrinsics with rounding modes.
16303 // First, we check if the intrinsic may have non-default rounding mode,
16304 // (IntrData->Opc1 != 0), then we check the rounding mode operand.
16305 unsigned IntrWithRoundingModeOpcode = IntrData->Opc1;
16306 if (IntrWithRoundingModeOpcode != 0) {
16307 SDValue Rnd = Op.getOperand(5);
16308 if (cast<ConstantSDNode>(Rnd)->getZExtValue() !=
16309 X86::STATIC_ROUNDING::CUR_DIRECTION)
16310 return getVectorMaskingNode(DAG.getNode(IntrWithRoundingModeOpcode,
16311 dl, Op.getValueType(),
16312 Src1, Src2, Src3, Rnd),
16313 Mask, PassThru, Subtarget, DAG);
16315 return getVectorMaskingNode(DAG.getNode(IntrData->Opc0,
16316 dl, Op.getValueType(),
16318 Mask, PassThru, Subtarget, DAG);
16320 case TERLOG_OP_MASK:
16321 case TERLOG_OP_MASKZ: {
16322 SDValue Src1 = Op.getOperand(1);
16323 SDValue Src2 = Op.getOperand(2);
16324 SDValue Src3 = Op.getOperand(3);
16325 SDValue Src4 = DAG.getNode(ISD::TRUNCATE, dl, MVT::i8, Op.getOperand(4));
16326 SDValue Mask = Op.getOperand(5);
16327 MVT VT = Op.getSimpleValueType();
16328 SDValue PassThru = Src1;
16329 // Set PassThru element.
16330 if (IntrData->Type == TERLOG_OP_MASKZ)
16331 PassThru = getZeroVector(VT, Subtarget, DAG, dl);
16333 return getVectorMaskingNode(DAG.getNode(IntrData->Opc0, dl, VT,
16334 Src1, Src2, Src3, Src4),
16335 Mask, PassThru, Subtarget, DAG);
16338 // FPclass intrinsics with mask
16339 SDValue Src1 = Op.getOperand(1);
16340 MVT VT = Src1.getSimpleValueType();
16341 MVT MaskVT = MVT::getVectorVT(MVT::i1, VT.getVectorNumElements());
16342 SDValue Imm = Op.getOperand(2);
16343 SDValue Mask = Op.getOperand(3);
16344 MVT BitcastVT = MVT::getVectorVT(MVT::i1,
16345 Mask.getSimpleValueType().getSizeInBits());
16346 SDValue FPclass = DAG.getNode(IntrData->Opc0, dl, MaskVT, Src1, Imm);
16347 SDValue FPclassMask = getVectorMaskingNode(FPclass, Mask,
16348 DAG.getTargetConstant(0, dl, MaskVT),
16350 SDValue Res = DAG.getNode(ISD::INSERT_SUBVECTOR, dl, BitcastVT,
16351 DAG.getUNDEF(BitcastVT), FPclassMask,
16352 DAG.getIntPtrConstant(0, dl));
16353 return DAG.getBitcast(Op.getValueType(), Res);
16356 SDValue Src1 = Op.getOperand(1);
16357 SDValue Imm = Op.getOperand(2);
16358 SDValue Mask = Op.getOperand(3);
16359 SDValue FPclass = DAG.getNode(IntrData->Opc0, dl, MVT::i1, Src1, Imm);
16360 SDValue FPclassMask = getScalarMaskingNode(FPclass, Mask,
16361 DAG.getTargetConstant(0, dl, MVT::i1), Subtarget, DAG);
16362 return DAG.getNode(ISD::SIGN_EXTEND, dl, MVT::i8, FPclassMask);
16365 case CMP_MASK_CC: {
16366 // Comparison intrinsics with masks.
16367 // Example of transformation:
16368 // (i8 (int_x86_avx512_mask_pcmpeq_q_128
16369 // (v2i64 %a), (v2i64 %b), (i8 %mask))) ->
16371 // (v8i1 (insert_subvector undef,
16372 // (v2i1 (and (PCMPEQM %a, %b),
16373 // (extract_subvector
16374 // (v8i1 (bitcast %mask)), 0))), 0))))
16375 MVT VT = Op.getOperand(1).getSimpleValueType();
16376 MVT MaskVT = MVT::getVectorVT(MVT::i1, VT.getVectorNumElements());
16377 SDValue Mask = Op.getOperand((IntrData->Type == CMP_MASK_CC) ? 4 : 3);
16378 MVT BitcastVT = MVT::getVectorVT(MVT::i1,
16379 Mask.getSimpleValueType().getSizeInBits());
16381 if (IntrData->Type == CMP_MASK_CC) {
16382 SDValue CC = Op.getOperand(3);
16383 CC = DAG.getNode(ISD::TRUNCATE, dl, MVT::i8, CC);
16384 // We specify 2 possible opcodes for intrinsics with rounding modes.
16385 // First, we check if the intrinsic may have non-default rounding mode,
16386 // (IntrData->Opc1 != 0), then we check the rounding mode operand.
16387 if (IntrData->Opc1 != 0) {
16388 SDValue Rnd = Op.getOperand(5);
16389 if (cast<ConstantSDNode>(Rnd)->getZExtValue() !=
16390 X86::STATIC_ROUNDING::CUR_DIRECTION)
16391 Cmp = DAG.getNode(IntrData->Opc1, dl, MaskVT, Op.getOperand(1),
16392 Op.getOperand(2), CC, Rnd);
16394 //default rounding mode
16396 Cmp = DAG.getNode(IntrData->Opc0, dl, MaskVT, Op.getOperand(1),
16397 Op.getOperand(2), CC);
16400 assert(IntrData->Type == CMP_MASK && "Unexpected intrinsic type!");
16401 Cmp = DAG.getNode(IntrData->Opc0, dl, MaskVT, Op.getOperand(1),
16404 SDValue CmpMask = getVectorMaskingNode(Cmp, Mask,
16405 DAG.getTargetConstant(0, dl,
16408 SDValue Res = DAG.getNode(ISD::INSERT_SUBVECTOR, dl, BitcastVT,
16409 DAG.getUNDEF(BitcastVT), CmpMask,
16410 DAG.getIntPtrConstant(0, dl));
16411 return DAG.getBitcast(Op.getValueType(), Res);
16413 case CMP_MASK_SCALAR_CC: {
16414 SDValue Src1 = Op.getOperand(1);
16415 SDValue Src2 = Op.getOperand(2);
16416 SDValue CC = DAG.getNode(ISD::TRUNCATE, dl, MVT::i8, Op.getOperand(3));
16417 SDValue Mask = Op.getOperand(4);
16420 if (IntrData->Opc1 != 0) {
16421 SDValue Rnd = Op.getOperand(5);
16422 if (cast<ConstantSDNode>(Rnd)->getZExtValue() !=
16423 X86::STATIC_ROUNDING::CUR_DIRECTION)
16424 Cmp = DAG.getNode(IntrData->Opc1, dl, MVT::i1, Src1, Src2, CC, Rnd);
16426 //default rounding mode
16428 Cmp = DAG.getNode(IntrData->Opc0, dl, MVT::i1, Src1, Src2, CC);
16430 SDValue CmpMask = getScalarMaskingNode(Cmp, Mask,
16431 DAG.getTargetConstant(0, dl,
16435 return DAG.getNode(ISD::SIGN_EXTEND_INREG, dl, MVT::i8,
16436 DAG.getNode(ISD::ANY_EXTEND, dl, MVT::i8, CmpMask),
16437 DAG.getValueType(MVT::i1));
16439 case COMI: { // Comparison intrinsics
16440 ISD::CondCode CC = (ISD::CondCode)IntrData->Opc1;
16441 SDValue LHS = Op.getOperand(1);
16442 SDValue RHS = Op.getOperand(2);
16443 unsigned X86CC = TranslateX86CC(CC, dl, true, LHS, RHS, DAG);
16444 assert(X86CC != X86::COND_INVALID && "Unexpected illegal condition!");
16445 SDValue Cond = DAG.getNode(IntrData->Opc0, dl, MVT::i32, LHS, RHS);
16446 SDValue SetCC = DAG.getNode(X86ISD::SETCC, dl, MVT::i8,
16447 DAG.getConstant(X86CC, dl, MVT::i8), Cond);
16448 return DAG.getNode(ISD::ZERO_EXTEND, dl, MVT::i32, SetCC);
16451 return getTargetVShiftNode(IntrData->Opc0, dl, Op.getSimpleValueType(),
16452 Op.getOperand(1), Op.getOperand(2), DAG);
16454 return getVectorMaskingNode(getTargetVShiftNode(IntrData->Opc0, dl,
16455 Op.getSimpleValueType(),
16457 Op.getOperand(2), DAG),
16458 Op.getOperand(4), Op.getOperand(3), Subtarget,
16460 case COMPRESS_EXPAND_IN_REG: {
16461 SDValue Mask = Op.getOperand(3);
16462 SDValue DataToCompress = Op.getOperand(1);
16463 SDValue PassThru = Op.getOperand(2);
16464 if (isAllOnes(Mask)) // return data as is
16465 return Op.getOperand(1);
16467 return getVectorMaskingNode(DAG.getNode(IntrData->Opc0, dl, VT,
16469 Mask, PassThru, Subtarget, DAG);
16472 SDValue Mask = Op.getOperand(3);
16473 MVT VT = Op.getSimpleValueType();
16474 MVT MaskVT = MVT::getVectorVT(MVT::i1, VT.getVectorNumElements());
16475 MVT BitcastVT = MVT::getVectorVT(MVT::i1,
16476 Mask.getSimpleValueType().getSizeInBits());
16478 SDValue VMask = DAG.getNode(ISD::EXTRACT_SUBVECTOR, dl, MaskVT,
16479 DAG.getBitcast(BitcastVT, Mask),
16480 DAG.getIntPtrConstant(0, dl));
16481 return DAG.getNode(IntrData->Opc0, dl, VT, VMask, Op.getOperand(1),
16490 default: return SDValue(); // Don't custom lower most intrinsics.
16492 case Intrinsic::x86_avx2_permd:
16493 case Intrinsic::x86_avx2_permps:
16494 // Operands intentionally swapped. Mask is last operand to intrinsic,
16495 // but second operand for node/instruction.
16496 return DAG.getNode(X86ISD::VPERMV, dl, Op.getValueType(),
16497 Op.getOperand(2), Op.getOperand(1));
16499 // ptest and testp intrinsics. The intrinsic these come from are designed to
16500 // return an integer value, not just an instruction so lower it to the ptest
16501 // or testp pattern and a setcc for the result.
16502 case Intrinsic::x86_sse41_ptestz:
16503 case Intrinsic::x86_sse41_ptestc:
16504 case Intrinsic::x86_sse41_ptestnzc:
16505 case Intrinsic::x86_avx_ptestz_256:
16506 case Intrinsic::x86_avx_ptestc_256:
16507 case Intrinsic::x86_avx_ptestnzc_256:
16508 case Intrinsic::x86_avx_vtestz_ps:
16509 case Intrinsic::x86_avx_vtestc_ps:
16510 case Intrinsic::x86_avx_vtestnzc_ps:
16511 case Intrinsic::x86_avx_vtestz_pd:
16512 case Intrinsic::x86_avx_vtestc_pd:
16513 case Intrinsic::x86_avx_vtestnzc_pd:
16514 case Intrinsic::x86_avx_vtestz_ps_256:
16515 case Intrinsic::x86_avx_vtestc_ps_256:
16516 case Intrinsic::x86_avx_vtestnzc_ps_256:
16517 case Intrinsic::x86_avx_vtestz_pd_256:
16518 case Intrinsic::x86_avx_vtestc_pd_256:
16519 case Intrinsic::x86_avx_vtestnzc_pd_256: {
16520 bool IsTestPacked = false;
16523 default: llvm_unreachable("Bad fallthrough in Intrinsic lowering.");
16524 case Intrinsic::x86_avx_vtestz_ps:
16525 case Intrinsic::x86_avx_vtestz_pd:
16526 case Intrinsic::x86_avx_vtestz_ps_256:
16527 case Intrinsic::x86_avx_vtestz_pd_256:
16528 IsTestPacked = true; // Fallthrough
16529 case Intrinsic::x86_sse41_ptestz:
16530 case Intrinsic::x86_avx_ptestz_256:
16532 X86CC = X86::COND_E;
16534 case Intrinsic::x86_avx_vtestc_ps:
16535 case Intrinsic::x86_avx_vtestc_pd:
16536 case Intrinsic::x86_avx_vtestc_ps_256:
16537 case Intrinsic::x86_avx_vtestc_pd_256:
16538 IsTestPacked = true; // Fallthrough
16539 case Intrinsic::x86_sse41_ptestc:
16540 case Intrinsic::x86_avx_ptestc_256:
16542 X86CC = X86::COND_B;
16544 case Intrinsic::x86_avx_vtestnzc_ps:
16545 case Intrinsic::x86_avx_vtestnzc_pd:
16546 case Intrinsic::x86_avx_vtestnzc_ps_256:
16547 case Intrinsic::x86_avx_vtestnzc_pd_256:
16548 IsTestPacked = true; // Fallthrough
16549 case Intrinsic::x86_sse41_ptestnzc:
16550 case Intrinsic::x86_avx_ptestnzc_256:
16552 X86CC = X86::COND_A;
16556 SDValue LHS = Op.getOperand(1);
16557 SDValue RHS = Op.getOperand(2);
16558 unsigned TestOpc = IsTestPacked ? X86ISD::TESTP : X86ISD::PTEST;
16559 SDValue Test = DAG.getNode(TestOpc, dl, MVT::i32, LHS, RHS);
16560 SDValue CC = DAG.getConstant(X86CC, dl, MVT::i8);
16561 SDValue SetCC = DAG.getNode(X86ISD::SETCC, dl, MVT::i8, CC, Test);
16562 return DAG.getNode(ISD::ZERO_EXTEND, dl, MVT::i32, SetCC);
16564 case Intrinsic::x86_avx512_kortestz_w:
16565 case Intrinsic::x86_avx512_kortestc_w: {
16566 unsigned X86CC = (IntNo == Intrinsic::x86_avx512_kortestz_w)? X86::COND_E: X86::COND_B;
16567 SDValue LHS = DAG.getBitcast(MVT::v16i1, Op.getOperand(1));
16568 SDValue RHS = DAG.getBitcast(MVT::v16i1, Op.getOperand(2));
16569 SDValue CC = DAG.getConstant(X86CC, dl, MVT::i8);
16570 SDValue Test = DAG.getNode(X86ISD::KORTEST, dl, MVT::i32, LHS, RHS);
16571 SDValue SetCC = DAG.getNode(X86ISD::SETCC, dl, MVT::i1, CC, Test);
16572 return DAG.getNode(ISD::ZERO_EXTEND, dl, MVT::i32, SetCC);
16575 case Intrinsic::x86_sse42_pcmpistria128:
16576 case Intrinsic::x86_sse42_pcmpestria128:
16577 case Intrinsic::x86_sse42_pcmpistric128:
16578 case Intrinsic::x86_sse42_pcmpestric128:
16579 case Intrinsic::x86_sse42_pcmpistrio128:
16580 case Intrinsic::x86_sse42_pcmpestrio128:
16581 case Intrinsic::x86_sse42_pcmpistris128:
16582 case Intrinsic::x86_sse42_pcmpestris128:
16583 case Intrinsic::x86_sse42_pcmpistriz128:
16584 case Intrinsic::x86_sse42_pcmpestriz128: {
16588 default: llvm_unreachable("Impossible intrinsic"); // Can't reach here.
16589 case Intrinsic::x86_sse42_pcmpistria128:
16590 Opcode = X86ISD::PCMPISTRI;
16591 X86CC = X86::COND_A;
16593 case Intrinsic::x86_sse42_pcmpestria128:
16594 Opcode = X86ISD::PCMPESTRI;
16595 X86CC = X86::COND_A;
16597 case Intrinsic::x86_sse42_pcmpistric128:
16598 Opcode = X86ISD::PCMPISTRI;
16599 X86CC = X86::COND_B;
16601 case Intrinsic::x86_sse42_pcmpestric128:
16602 Opcode = X86ISD::PCMPESTRI;
16603 X86CC = X86::COND_B;
16605 case Intrinsic::x86_sse42_pcmpistrio128:
16606 Opcode = X86ISD::PCMPISTRI;
16607 X86CC = X86::COND_O;
16609 case Intrinsic::x86_sse42_pcmpestrio128:
16610 Opcode = X86ISD::PCMPESTRI;
16611 X86CC = X86::COND_O;
16613 case Intrinsic::x86_sse42_pcmpistris128:
16614 Opcode = X86ISD::PCMPISTRI;
16615 X86CC = X86::COND_S;
16617 case Intrinsic::x86_sse42_pcmpestris128:
16618 Opcode = X86ISD::PCMPESTRI;
16619 X86CC = X86::COND_S;
16621 case Intrinsic::x86_sse42_pcmpistriz128:
16622 Opcode = X86ISD::PCMPISTRI;
16623 X86CC = X86::COND_E;
16625 case Intrinsic::x86_sse42_pcmpestriz128:
16626 Opcode = X86ISD::PCMPESTRI;
16627 X86CC = X86::COND_E;
16630 SmallVector<SDValue, 5> NewOps(Op->op_begin()+1, Op->op_end());
16631 SDVTList VTs = DAG.getVTList(Op.getValueType(), MVT::i32);
16632 SDValue PCMP = DAG.getNode(Opcode, dl, VTs, NewOps);
16633 SDValue SetCC = DAG.getNode(X86ISD::SETCC, dl, MVT::i8,
16634 DAG.getConstant(X86CC, dl, MVT::i8),
16635 SDValue(PCMP.getNode(), 1));
16636 return DAG.getNode(ISD::ZERO_EXTEND, dl, MVT::i32, SetCC);
16639 case Intrinsic::x86_sse42_pcmpistri128:
16640 case Intrinsic::x86_sse42_pcmpestri128: {
16642 if (IntNo == Intrinsic::x86_sse42_pcmpistri128)
16643 Opcode = X86ISD::PCMPISTRI;
16645 Opcode = X86ISD::PCMPESTRI;
16647 SmallVector<SDValue, 5> NewOps(Op->op_begin()+1, Op->op_end());
16648 SDVTList VTs = DAG.getVTList(Op.getValueType(), MVT::i32);
16649 return DAG.getNode(Opcode, dl, VTs, NewOps);
16652 case Intrinsic::x86_seh_lsda: {
16653 // Compute the symbol for the LSDA. We know it'll get emitted later.
16654 MachineFunction &MF = DAG.getMachineFunction();
16655 SDValue Op1 = Op.getOperand(1);
16656 auto *Fn = cast<Function>(cast<GlobalAddressSDNode>(Op1)->getGlobal());
16657 MCSymbol *LSDASym = MF.getMMI().getContext().getOrCreateLSDASymbol(
16658 GlobalValue::getRealLinkageName(Fn->getName()));
16660 // Generate a simple absolute symbol reference. This intrinsic is only
16661 // supported on 32-bit Windows, which isn't PIC.
16662 SDValue Result = DAG.getMCSymbol(LSDASym, VT);
16663 return DAG.getNode(X86ISD::Wrapper, dl, VT, Result);
16666 case Intrinsic::x86_seh_recoverfp: {
16667 SDValue FnOp = Op.getOperand(1);
16668 SDValue IncomingFPOp = Op.getOperand(2);
16669 GlobalAddressSDNode *GSD = dyn_cast<GlobalAddressSDNode>(FnOp);
16670 auto *Fn = dyn_cast_or_null<Function>(GSD ? GSD->getGlobal() : nullptr);
16672 report_fatal_error(
16673 "llvm.x86.seh.recoverfp must take a function as the first argument");
16674 return recoverFramePointer(DAG, Fn, IncomingFPOp);
16677 case Intrinsic::localaddress: {
16678 // Returns one of the stack, base, or frame pointer registers, depending on
16679 // which is used to reference local variables.
16680 MachineFunction &MF = DAG.getMachineFunction();
16681 const X86RegisterInfo *RegInfo = Subtarget->getRegisterInfo();
16683 if (RegInfo->hasBasePointer(MF))
16684 Reg = RegInfo->getBaseRegister();
16685 else // This function handles the SP or FP case.
16686 Reg = RegInfo->getPtrSizedFrameRegister(MF);
16687 return DAG.getCopyFromReg(DAG.getEntryNode(), dl, Reg, VT);
16692 static SDValue getGatherNode(unsigned Opc, SDValue Op, SelectionDAG &DAG,
16693 SDValue Src, SDValue Mask, SDValue Base,
16694 SDValue Index, SDValue ScaleOp, SDValue Chain,
16695 const X86Subtarget * Subtarget) {
16697 auto *C = cast<ConstantSDNode>(ScaleOp);
16698 SDValue Scale = DAG.getTargetConstant(C->getZExtValue(), dl, MVT::i8);
16699 MVT MaskVT = MVT::getVectorVT(MVT::i1,
16700 Index.getSimpleValueType().getVectorNumElements());
16702 ConstantSDNode *MaskC = dyn_cast<ConstantSDNode>(Mask);
16704 MaskInReg = DAG.getTargetConstant(MaskC->getSExtValue(), dl, MaskVT);
16706 MVT BitcastVT = MVT::getVectorVT(MVT::i1,
16707 Mask.getSimpleValueType().getSizeInBits());
16709 // In case when MaskVT equals v2i1 or v4i1, low 2 or 4 elements
16710 // are extracted by EXTRACT_SUBVECTOR.
16711 MaskInReg = DAG.getNode(ISD::EXTRACT_SUBVECTOR, dl, MaskVT,
16712 DAG.getBitcast(BitcastVT, Mask),
16713 DAG.getIntPtrConstant(0, dl));
16715 SDVTList VTs = DAG.getVTList(Op.getValueType(), MaskVT, MVT::Other);
16716 SDValue Disp = DAG.getTargetConstant(0, dl, MVT::i32);
16717 SDValue Segment = DAG.getRegister(0, MVT::i32);
16718 if (Src.getOpcode() == ISD::UNDEF)
16719 Src = getZeroVector(Op.getValueType(), Subtarget, DAG, dl);
16720 SDValue Ops[] = {Src, MaskInReg, Base, Scale, Index, Disp, Segment, Chain};
16721 SDNode *Res = DAG.getMachineNode(Opc, dl, VTs, Ops);
16722 SDValue RetOps[] = { SDValue(Res, 0), SDValue(Res, 2) };
16723 return DAG.getMergeValues(RetOps, dl);
16726 static SDValue getScatterNode(unsigned Opc, SDValue Op, SelectionDAG &DAG,
16727 SDValue Src, SDValue Mask, SDValue Base,
16728 SDValue Index, SDValue ScaleOp, SDValue Chain) {
16730 auto *C = cast<ConstantSDNode>(ScaleOp);
16731 SDValue Scale = DAG.getTargetConstant(C->getZExtValue(), dl, MVT::i8);
16732 SDValue Disp = DAG.getTargetConstant(0, dl, MVT::i32);
16733 SDValue Segment = DAG.getRegister(0, MVT::i32);
16734 MVT MaskVT = MVT::getVectorVT(MVT::i1,
16735 Index.getSimpleValueType().getVectorNumElements());
16737 ConstantSDNode *MaskC = dyn_cast<ConstantSDNode>(Mask);
16739 MaskInReg = DAG.getTargetConstant(MaskC->getSExtValue(), dl, MaskVT);
16741 MVT BitcastVT = MVT::getVectorVT(MVT::i1,
16742 Mask.getSimpleValueType().getSizeInBits());
16744 // In case when MaskVT equals v2i1 or v4i1, low 2 or 4 elements
16745 // are extracted by EXTRACT_SUBVECTOR.
16746 MaskInReg = DAG.getNode(ISD::EXTRACT_SUBVECTOR, dl, MaskVT,
16747 DAG.getBitcast(BitcastVT, Mask),
16748 DAG.getIntPtrConstant(0, dl));
16750 SDVTList VTs = DAG.getVTList(MaskVT, MVT::Other);
16751 SDValue Ops[] = {Base, Scale, Index, Disp, Segment, MaskInReg, Src, Chain};
16752 SDNode *Res = DAG.getMachineNode(Opc, dl, VTs, Ops);
16753 return SDValue(Res, 1);
16756 static SDValue getPrefetchNode(unsigned Opc, SDValue Op, SelectionDAG &DAG,
16757 SDValue Mask, SDValue Base, SDValue Index,
16758 SDValue ScaleOp, SDValue Chain) {
16760 auto *C = cast<ConstantSDNode>(ScaleOp);
16761 SDValue Scale = DAG.getTargetConstant(C->getZExtValue(), dl, MVT::i8);
16762 SDValue Disp = DAG.getTargetConstant(0, dl, MVT::i32);
16763 SDValue Segment = DAG.getRegister(0, MVT::i32);
16765 MVT::getVectorVT(MVT::i1, Index.getSimpleValueType().getVectorNumElements());
16767 ConstantSDNode *MaskC = dyn_cast<ConstantSDNode>(Mask);
16769 MaskInReg = DAG.getTargetConstant(MaskC->getSExtValue(), dl, MaskVT);
16771 MaskInReg = DAG.getBitcast(MaskVT, Mask);
16772 //SDVTList VTs = DAG.getVTList(MVT::Other);
16773 SDValue Ops[] = {MaskInReg, Base, Scale, Index, Disp, Segment, Chain};
16774 SDNode *Res = DAG.getMachineNode(Opc, dl, MVT::Other, Ops);
16775 return SDValue(Res, 0);
16778 // getReadPerformanceCounter - Handles the lowering of builtin intrinsics that
16779 // read performance monitor counters (x86_rdpmc).
16780 static void getReadPerformanceCounter(SDNode *N, SDLoc DL,
16781 SelectionDAG &DAG, const X86Subtarget *Subtarget,
16782 SmallVectorImpl<SDValue> &Results) {
16783 assert(N->getNumOperands() == 3 && "Unexpected number of operands!");
16784 SDVTList Tys = DAG.getVTList(MVT::Other, MVT::Glue);
16787 // The ECX register is used to select the index of the performance counter
16789 SDValue Chain = DAG.getCopyToReg(N->getOperand(0), DL, X86::ECX,
16791 SDValue rd = DAG.getNode(X86ISD::RDPMC_DAG, DL, Tys, Chain);
16793 // Reads the content of a 64-bit performance counter and returns it in the
16794 // registers EDX:EAX.
16795 if (Subtarget->is64Bit()) {
16796 LO = DAG.getCopyFromReg(rd, DL, X86::RAX, MVT::i64, rd.getValue(1));
16797 HI = DAG.getCopyFromReg(LO.getValue(1), DL, X86::RDX, MVT::i64,
16800 LO = DAG.getCopyFromReg(rd, DL, X86::EAX, MVT::i32, rd.getValue(1));
16801 HI = DAG.getCopyFromReg(LO.getValue(1), DL, X86::EDX, MVT::i32,
16804 Chain = HI.getValue(1);
16806 if (Subtarget->is64Bit()) {
16807 // The EAX register is loaded with the low-order 32 bits. The EDX register
16808 // is loaded with the supported high-order bits of the counter.
16809 SDValue Tmp = DAG.getNode(ISD::SHL, DL, MVT::i64, HI,
16810 DAG.getConstant(32, DL, MVT::i8));
16811 Results.push_back(DAG.getNode(ISD::OR, DL, MVT::i64, LO, Tmp));
16812 Results.push_back(Chain);
16816 // Use a buildpair to merge the two 32-bit values into a 64-bit one.
16817 SDValue Ops[] = { LO, HI };
16818 SDValue Pair = DAG.getNode(ISD::BUILD_PAIR, DL, MVT::i64, Ops);
16819 Results.push_back(Pair);
16820 Results.push_back(Chain);
16823 // getReadTimeStampCounter - Handles the lowering of builtin intrinsics that
16824 // read the time stamp counter (x86_rdtsc and x86_rdtscp). This function is
16825 // also used to custom lower READCYCLECOUNTER nodes.
16826 static void getReadTimeStampCounter(SDNode *N, SDLoc DL, unsigned Opcode,
16827 SelectionDAG &DAG, const X86Subtarget *Subtarget,
16828 SmallVectorImpl<SDValue> &Results) {
16829 SDVTList Tys = DAG.getVTList(MVT::Other, MVT::Glue);
16830 SDValue rd = DAG.getNode(Opcode, DL, Tys, N->getOperand(0));
16833 // The processor's time-stamp counter (a 64-bit MSR) is stored into the
16834 // EDX:EAX registers. EDX is loaded with the high-order 32 bits of the MSR
16835 // and the EAX register is loaded with the low-order 32 bits.
16836 if (Subtarget->is64Bit()) {
16837 LO = DAG.getCopyFromReg(rd, DL, X86::RAX, MVT::i64, rd.getValue(1));
16838 HI = DAG.getCopyFromReg(LO.getValue(1), DL, X86::RDX, MVT::i64,
16841 LO = DAG.getCopyFromReg(rd, DL, X86::EAX, MVT::i32, rd.getValue(1));
16842 HI = DAG.getCopyFromReg(LO.getValue(1), DL, X86::EDX, MVT::i32,
16845 SDValue Chain = HI.getValue(1);
16847 if (Opcode == X86ISD::RDTSCP_DAG) {
16848 assert(N->getNumOperands() == 3 && "Unexpected number of operands!");
16850 // Instruction RDTSCP loads the IA32:TSC_AUX_MSR (address C000_0103H) into
16851 // the ECX register. Add 'ecx' explicitly to the chain.
16852 SDValue ecx = DAG.getCopyFromReg(Chain, DL, X86::ECX, MVT::i32,
16854 // Explicitly store the content of ECX at the location passed in input
16855 // to the 'rdtscp' intrinsic.
16856 Chain = DAG.getStore(ecx.getValue(1), DL, ecx, N->getOperand(2),
16857 MachinePointerInfo(), false, false, 0);
16860 if (Subtarget->is64Bit()) {
16861 // The EDX register is loaded with the high-order 32 bits of the MSR, and
16862 // the EAX register is loaded with the low-order 32 bits.
16863 SDValue Tmp = DAG.getNode(ISD::SHL, DL, MVT::i64, HI,
16864 DAG.getConstant(32, DL, MVT::i8));
16865 Results.push_back(DAG.getNode(ISD::OR, DL, MVT::i64, LO, Tmp));
16866 Results.push_back(Chain);
16870 // Use a buildpair to merge the two 32-bit values into a 64-bit one.
16871 SDValue Ops[] = { LO, HI };
16872 SDValue Pair = DAG.getNode(ISD::BUILD_PAIR, DL, MVT::i64, Ops);
16873 Results.push_back(Pair);
16874 Results.push_back(Chain);
16877 static SDValue LowerREADCYCLECOUNTER(SDValue Op, const X86Subtarget *Subtarget,
16878 SelectionDAG &DAG) {
16879 SmallVector<SDValue, 2> Results;
16881 getReadTimeStampCounter(Op.getNode(), DL, X86ISD::RDTSC_DAG, DAG, Subtarget,
16883 return DAG.getMergeValues(Results, DL);
16886 static SDValue LowerSEHRESTOREFRAME(SDValue Op, const X86Subtarget *Subtarget,
16887 SelectionDAG &DAG) {
16888 MachineFunction &MF = DAG.getMachineFunction();
16889 const Function *Fn = MF.getFunction();
16891 SDValue Chain = Op.getOperand(0);
16893 assert(Subtarget->getFrameLowering()->hasFP(MF) &&
16894 "using llvm.x86.seh.restoreframe requires a frame pointer");
16896 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
16897 MVT VT = TLI.getPointerTy(DAG.getDataLayout());
16899 const X86RegisterInfo *RegInfo = Subtarget->getRegisterInfo();
16900 unsigned FrameReg =
16901 RegInfo->getPtrSizedFrameRegister(DAG.getMachineFunction());
16902 unsigned SPReg = RegInfo->getStackRegister();
16903 unsigned SlotSize = RegInfo->getSlotSize();
16905 // Get incoming EBP.
16906 SDValue IncomingEBP =
16907 DAG.getCopyFromReg(Chain, dl, FrameReg, VT);
16909 // SP is saved in the first field of every registration node, so load
16910 // [EBP-RegNodeSize] into SP.
16911 int RegNodeSize = getSEHRegistrationNodeSize(Fn);
16912 SDValue SPAddr = DAG.getNode(ISD::ADD, dl, VT, IncomingEBP,
16913 DAG.getConstant(-RegNodeSize, dl, VT));
16915 DAG.getLoad(VT, dl, Chain, SPAddr, MachinePointerInfo(), false, false,
16916 false, VT.getScalarSizeInBits() / 8);
16917 Chain = DAG.getCopyToReg(Chain, dl, SPReg, NewSP);
16919 if (!RegInfo->needsStackRealignment(MF)) {
16920 // Adjust EBP to point back to the original frame position.
16921 SDValue NewFP = recoverFramePointer(DAG, Fn, IncomingEBP);
16922 Chain = DAG.getCopyToReg(Chain, dl, FrameReg, NewFP);
16924 assert(RegInfo->hasBasePointer(MF) &&
16925 "functions with Win32 EH must use frame or base pointer register");
16927 // Reload the base pointer (ESI) with the adjusted incoming EBP.
16928 SDValue NewBP = recoverFramePointer(DAG, Fn, IncomingEBP);
16929 Chain = DAG.getCopyToReg(Chain, dl, RegInfo->getBaseRegister(), NewBP);
16931 // Reload the spilled EBP value, now that the stack and base pointers are
16933 X86MachineFunctionInfo *X86FI = MF.getInfo<X86MachineFunctionInfo>();
16934 X86FI->setHasSEHFramePtrSave(true);
16935 int FI = MF.getFrameInfo()->CreateSpillStackObject(SlotSize, SlotSize);
16936 X86FI->setSEHFramePtrSaveIndex(FI);
16937 SDValue NewFP = DAG.getLoad(VT, dl, Chain, DAG.getFrameIndex(FI, VT),
16938 MachinePointerInfo(), false, false, false,
16939 VT.getScalarSizeInBits() / 8);
16940 Chain = DAG.getCopyToReg(NewFP, dl, FrameReg, NewFP);
16946 /// \brief Lower intrinsics for TRUNCATE_TO_MEM case
16947 /// return truncate Store/MaskedStore Node
16948 static SDValue LowerINTRINSIC_TRUNCATE_TO_MEM(const SDValue & Op,
16952 SDValue Mask = Op.getOperand(4);
16953 SDValue DataToTruncate = Op.getOperand(3);
16954 SDValue Addr = Op.getOperand(2);
16955 SDValue Chain = Op.getOperand(0);
16957 MVT VT = DataToTruncate.getSimpleValueType();
16958 MVT SVT = MVT::getVectorVT(ElementType, VT.getVectorNumElements());
16960 if (isAllOnes(Mask)) // return just a truncate store
16961 return DAG.getTruncStore(Chain, dl, DataToTruncate, Addr,
16962 MachinePointerInfo(), SVT, false, false,
16963 SVT.getScalarSizeInBits()/8);
16965 MVT MaskVT = MVT::getVectorVT(MVT::i1, VT.getVectorNumElements());
16966 MVT BitcastVT = MVT::getVectorVT(MVT::i1,
16967 Mask.getSimpleValueType().getSizeInBits());
16968 // In case when MaskVT equals v2i1 or v4i1, low 2 or 4 elements
16969 // are extracted by EXTRACT_SUBVECTOR.
16970 SDValue VMask = DAG.getNode(ISD::EXTRACT_SUBVECTOR, dl, MaskVT,
16971 DAG.getBitcast(BitcastVT, Mask),
16972 DAG.getIntPtrConstant(0, dl));
16974 MachineMemOperand *MMO = DAG.getMachineFunction().
16975 getMachineMemOperand(MachinePointerInfo(),
16976 MachineMemOperand::MOStore, SVT.getStoreSize(),
16977 SVT.getScalarSizeInBits()/8);
16979 return DAG.getMaskedStore(Chain, dl, DataToTruncate, Addr,
16980 VMask, SVT, MMO, true);
16983 static SDValue LowerINTRINSIC_W_CHAIN(SDValue Op, const X86Subtarget *Subtarget,
16984 SelectionDAG &DAG) {
16985 unsigned IntNo = cast<ConstantSDNode>(Op.getOperand(1))->getZExtValue();
16987 const IntrinsicData* IntrData = getIntrinsicWithChain(IntNo);
16989 if (IntNo == llvm::Intrinsic::x86_seh_restoreframe)
16990 return LowerSEHRESTOREFRAME(Op, Subtarget, DAG);
16995 switch(IntrData->Type) {
16996 default: llvm_unreachable("Unknown Intrinsic Type");
16999 // Emit the node with the right value type.
17000 SDVTList VTs = DAG.getVTList(Op->getValueType(0), MVT::Glue, MVT::Other);
17001 SDValue Result = DAG.getNode(IntrData->Opc0, dl, VTs, Op.getOperand(0));
17003 // If the value returned by RDRAND/RDSEED was valid (CF=1), return 1.
17004 // Otherwise return the value from Rand, which is always 0, casted to i32.
17005 SDValue Ops[] = { DAG.getZExtOrTrunc(Result, dl, Op->getValueType(1)),
17006 DAG.getConstant(1, dl, Op->getValueType(1)),
17007 DAG.getConstant(X86::COND_B, dl, MVT::i32),
17008 SDValue(Result.getNode(), 1) };
17009 SDValue isValid = DAG.getNode(X86ISD::CMOV, dl,
17010 DAG.getVTList(Op->getValueType(1), MVT::Glue),
17013 // Return { result, isValid, chain }.
17014 return DAG.getNode(ISD::MERGE_VALUES, dl, Op->getVTList(), Result, isValid,
17015 SDValue(Result.getNode(), 2));
17018 //gather(v1, mask, index, base, scale);
17019 SDValue Chain = Op.getOperand(0);
17020 SDValue Src = Op.getOperand(2);
17021 SDValue Base = Op.getOperand(3);
17022 SDValue Index = Op.getOperand(4);
17023 SDValue Mask = Op.getOperand(5);
17024 SDValue Scale = Op.getOperand(6);
17025 return getGatherNode(IntrData->Opc0, Op, DAG, Src, Mask, Base, Index, Scale,
17029 //scatter(base, mask, index, v1, scale);
17030 SDValue Chain = Op.getOperand(0);
17031 SDValue Base = Op.getOperand(2);
17032 SDValue Mask = Op.getOperand(3);
17033 SDValue Index = Op.getOperand(4);
17034 SDValue Src = Op.getOperand(5);
17035 SDValue Scale = Op.getOperand(6);
17036 return getScatterNode(IntrData->Opc0, Op, DAG, Src, Mask, Base, Index,
17040 SDValue Hint = Op.getOperand(6);
17041 unsigned HintVal = cast<ConstantSDNode>(Hint)->getZExtValue();
17042 assert(HintVal < 2 && "Wrong prefetch hint in intrinsic: should be 0 or 1");
17043 unsigned Opcode = (HintVal ? IntrData->Opc1 : IntrData->Opc0);
17044 SDValue Chain = Op.getOperand(0);
17045 SDValue Mask = Op.getOperand(2);
17046 SDValue Index = Op.getOperand(3);
17047 SDValue Base = Op.getOperand(4);
17048 SDValue Scale = Op.getOperand(5);
17049 return getPrefetchNode(Opcode, Op, DAG, Mask, Base, Index, Scale, Chain);
17051 // Read Time Stamp Counter (RDTSC) and Processor ID (RDTSCP).
17053 SmallVector<SDValue, 2> Results;
17054 getReadTimeStampCounter(Op.getNode(), dl, IntrData->Opc0, DAG, Subtarget,
17056 return DAG.getMergeValues(Results, dl);
17058 // Read Performance Monitoring Counters.
17060 SmallVector<SDValue, 2> Results;
17061 getReadPerformanceCounter(Op.getNode(), dl, DAG, Subtarget, Results);
17062 return DAG.getMergeValues(Results, dl);
17064 // XTEST intrinsics.
17066 SDVTList VTs = DAG.getVTList(Op->getValueType(0), MVT::Other);
17067 SDValue InTrans = DAG.getNode(IntrData->Opc0, dl, VTs, Op.getOperand(0));
17068 SDValue SetCC = DAG.getNode(X86ISD::SETCC, dl, MVT::i8,
17069 DAG.getConstant(X86::COND_NE, dl, MVT::i8),
17071 SDValue Ret = DAG.getNode(ISD::ZERO_EXTEND, dl, Op->getValueType(0), SetCC);
17072 return DAG.getNode(ISD::MERGE_VALUES, dl, Op->getVTList(),
17073 Ret, SDValue(InTrans.getNode(), 1));
17077 SmallVector<SDValue, 2> Results;
17078 SDVTList CFVTs = DAG.getVTList(Op->getValueType(0), MVT::Other);
17079 SDVTList VTs = DAG.getVTList(Op.getOperand(3)->getValueType(0), MVT::Other);
17080 SDValue GenCF = DAG.getNode(X86ISD::ADD, dl, CFVTs, Op.getOperand(2),
17081 DAG.getConstant(-1, dl, MVT::i8));
17082 SDValue Res = DAG.getNode(IntrData->Opc0, dl, VTs, Op.getOperand(3),
17083 Op.getOperand(4), GenCF.getValue(1));
17084 SDValue Store = DAG.getStore(Op.getOperand(0), dl, Res.getValue(0),
17085 Op.getOperand(5), MachinePointerInfo(),
17087 SDValue SetCC = DAG.getNode(X86ISD::SETCC, dl, MVT::i8,
17088 DAG.getConstant(X86::COND_B, dl, MVT::i8),
17090 Results.push_back(SetCC);
17091 Results.push_back(Store);
17092 return DAG.getMergeValues(Results, dl);
17094 case COMPRESS_TO_MEM: {
17096 SDValue Mask = Op.getOperand(4);
17097 SDValue DataToCompress = Op.getOperand(3);
17098 SDValue Addr = Op.getOperand(2);
17099 SDValue Chain = Op.getOperand(0);
17101 MVT VT = DataToCompress.getSimpleValueType();
17102 if (isAllOnes(Mask)) // return just a store
17103 return DAG.getStore(Chain, dl, DataToCompress, Addr,
17104 MachinePointerInfo(), false, false,
17105 VT.getScalarSizeInBits()/8);
17107 SDValue Compressed =
17108 getVectorMaskingNode(DAG.getNode(IntrData->Opc0, dl, VT, DataToCompress),
17109 Mask, DAG.getUNDEF(VT), Subtarget, DAG);
17110 return DAG.getStore(Chain, dl, Compressed, Addr,
17111 MachinePointerInfo(), false, false,
17112 VT.getScalarSizeInBits()/8);
17114 case TRUNCATE_TO_MEM_VI8:
17115 return LowerINTRINSIC_TRUNCATE_TO_MEM(Op, DAG, MVT::i8);
17116 case TRUNCATE_TO_MEM_VI16:
17117 return LowerINTRINSIC_TRUNCATE_TO_MEM(Op, DAG, MVT::i16);
17118 case TRUNCATE_TO_MEM_VI32:
17119 return LowerINTRINSIC_TRUNCATE_TO_MEM(Op, DAG, MVT::i32);
17120 case EXPAND_FROM_MEM: {
17122 SDValue Mask = Op.getOperand(4);
17123 SDValue PassThru = Op.getOperand(3);
17124 SDValue Addr = Op.getOperand(2);
17125 SDValue Chain = Op.getOperand(0);
17126 MVT VT = Op.getSimpleValueType();
17128 if (isAllOnes(Mask)) // return just a load
17129 return DAG.getLoad(VT, dl, Chain, Addr, MachinePointerInfo(), false, false,
17130 false, VT.getScalarSizeInBits()/8);
17132 SDValue DataToExpand = DAG.getLoad(VT, dl, Chain, Addr, MachinePointerInfo(),
17133 false, false, false,
17134 VT.getScalarSizeInBits()/8);
17136 SDValue Results[] = {
17137 getVectorMaskingNode(DAG.getNode(IntrData->Opc0, dl, VT, DataToExpand),
17138 Mask, PassThru, Subtarget, DAG), Chain};
17139 return DAG.getMergeValues(Results, dl);
17144 SDValue X86TargetLowering::LowerRETURNADDR(SDValue Op,
17145 SelectionDAG &DAG) const {
17146 MachineFrameInfo *MFI = DAG.getMachineFunction().getFrameInfo();
17147 MFI->setReturnAddressIsTaken(true);
17149 if (verifyReturnAddressArgumentIsConstant(Op, DAG))
17152 unsigned Depth = cast<ConstantSDNode>(Op.getOperand(0))->getZExtValue();
17154 EVT PtrVT = getPointerTy(DAG.getDataLayout());
17157 SDValue FrameAddr = LowerFRAMEADDR(Op, DAG);
17158 const X86RegisterInfo *RegInfo = Subtarget->getRegisterInfo();
17159 SDValue Offset = DAG.getConstant(RegInfo->getSlotSize(), dl, PtrVT);
17160 return DAG.getLoad(PtrVT, dl, DAG.getEntryNode(),
17161 DAG.getNode(ISD::ADD, dl, PtrVT,
17162 FrameAddr, Offset),
17163 MachinePointerInfo(), false, false, false, 0);
17166 // Just load the return address.
17167 SDValue RetAddrFI = getReturnAddressFrameIndex(DAG);
17168 return DAG.getLoad(PtrVT, dl, DAG.getEntryNode(),
17169 RetAddrFI, MachinePointerInfo(), false, false, false, 0);
17172 SDValue X86TargetLowering::LowerFRAMEADDR(SDValue Op, SelectionDAG &DAG) const {
17173 MachineFunction &MF = DAG.getMachineFunction();
17174 MachineFrameInfo *MFI = MF.getFrameInfo();
17175 X86MachineFunctionInfo *FuncInfo = MF.getInfo<X86MachineFunctionInfo>();
17176 const X86RegisterInfo *RegInfo = Subtarget->getRegisterInfo();
17177 EVT VT = Op.getValueType();
17179 MFI->setFrameAddressIsTaken(true);
17181 if (MF.getTarget().getMCAsmInfo()->usesWindowsCFI()) {
17182 // Depth > 0 makes no sense on targets which use Windows unwind codes. It
17183 // is not possible to crawl up the stack without looking at the unwind codes
17185 int FrameAddrIndex = FuncInfo->getFAIndex();
17186 if (!FrameAddrIndex) {
17187 // Set up a frame object for the return address.
17188 unsigned SlotSize = RegInfo->getSlotSize();
17189 FrameAddrIndex = MF.getFrameInfo()->CreateFixedObject(
17190 SlotSize, /*Offset=*/0, /*IsImmutable=*/false);
17191 FuncInfo->setFAIndex(FrameAddrIndex);
17193 return DAG.getFrameIndex(FrameAddrIndex, VT);
17196 unsigned FrameReg =
17197 RegInfo->getPtrSizedFrameRegister(DAG.getMachineFunction());
17198 SDLoc dl(Op); // FIXME probably not meaningful
17199 unsigned Depth = cast<ConstantSDNode>(Op.getOperand(0))->getZExtValue();
17200 assert(((FrameReg == X86::RBP && VT == MVT::i64) ||
17201 (FrameReg == X86::EBP && VT == MVT::i32)) &&
17202 "Invalid Frame Register!");
17203 SDValue FrameAddr = DAG.getCopyFromReg(DAG.getEntryNode(), dl, FrameReg, VT);
17205 FrameAddr = DAG.getLoad(VT, dl, DAG.getEntryNode(), FrameAddr,
17206 MachinePointerInfo(),
17207 false, false, false, 0);
17211 // FIXME? Maybe this could be a TableGen attribute on some registers and
17212 // this table could be generated automatically from RegInfo.
17213 unsigned X86TargetLowering::getRegisterByName(const char* RegName, EVT VT,
17214 SelectionDAG &DAG) const {
17215 const TargetFrameLowering &TFI = *Subtarget->getFrameLowering();
17216 const MachineFunction &MF = DAG.getMachineFunction();
17218 unsigned Reg = StringSwitch<unsigned>(RegName)
17219 .Case("esp", X86::ESP)
17220 .Case("rsp", X86::RSP)
17221 .Case("ebp", X86::EBP)
17222 .Case("rbp", X86::RBP)
17225 if (Reg == X86::EBP || Reg == X86::RBP) {
17226 if (!TFI.hasFP(MF))
17227 report_fatal_error("register " + StringRef(RegName) +
17228 " is allocatable: function has no frame pointer");
17231 const X86RegisterInfo *RegInfo = Subtarget->getRegisterInfo();
17232 unsigned FrameReg =
17233 RegInfo->getPtrSizedFrameRegister(DAG.getMachineFunction());
17234 assert((FrameReg == X86::EBP || FrameReg == X86::RBP) &&
17235 "Invalid Frame Register!");
17243 report_fatal_error("Invalid register name global variable");
17246 SDValue X86TargetLowering::LowerFRAME_TO_ARGS_OFFSET(SDValue Op,
17247 SelectionDAG &DAG) const {
17248 const X86RegisterInfo *RegInfo = Subtarget->getRegisterInfo();
17249 return DAG.getIntPtrConstant(2 * RegInfo->getSlotSize(), SDLoc(Op));
17252 unsigned X86TargetLowering::getExceptionPointerRegister(
17253 const Constant *PersonalityFn) const {
17254 if (classifyEHPersonality(PersonalityFn) == EHPersonality::CoreCLR)
17255 return Subtarget->isTarget64BitLP64() ? X86::RDX : X86::EDX;
17257 return Subtarget->isTarget64BitLP64() ? X86::RAX : X86::EAX;
17260 unsigned X86TargetLowering::getExceptionSelectorRegister(
17261 const Constant *PersonalityFn) const {
17262 // Funclet personalities don't use selectors (the runtime does the selection).
17263 assert(!isFuncletEHPersonality(classifyEHPersonality(PersonalityFn)));
17264 return Subtarget->isTarget64BitLP64() ? X86::RDX : X86::EDX;
17267 SDValue X86TargetLowering::LowerEH_RETURN(SDValue Op, SelectionDAG &DAG) const {
17268 SDValue Chain = Op.getOperand(0);
17269 SDValue Offset = Op.getOperand(1);
17270 SDValue Handler = Op.getOperand(2);
17273 EVT PtrVT = getPointerTy(DAG.getDataLayout());
17274 const X86RegisterInfo *RegInfo = Subtarget->getRegisterInfo();
17275 unsigned FrameReg = RegInfo->getFrameRegister(DAG.getMachineFunction());
17276 assert(((FrameReg == X86::RBP && PtrVT == MVT::i64) ||
17277 (FrameReg == X86::EBP && PtrVT == MVT::i32)) &&
17278 "Invalid Frame Register!");
17279 SDValue Frame = DAG.getCopyFromReg(DAG.getEntryNode(), dl, FrameReg, PtrVT);
17280 unsigned StoreAddrReg = (PtrVT == MVT::i64) ? X86::RCX : X86::ECX;
17282 SDValue StoreAddr = DAG.getNode(ISD::ADD, dl, PtrVT, Frame,
17283 DAG.getIntPtrConstant(RegInfo->getSlotSize(),
17285 StoreAddr = DAG.getNode(ISD::ADD, dl, PtrVT, StoreAddr, Offset);
17286 Chain = DAG.getStore(Chain, dl, Handler, StoreAddr, MachinePointerInfo(),
17288 Chain = DAG.getCopyToReg(Chain, dl, StoreAddrReg, StoreAddr);
17290 return DAG.getNode(X86ISD::EH_RETURN, dl, MVT::Other, Chain,
17291 DAG.getRegister(StoreAddrReg, PtrVT));
17294 SDValue X86TargetLowering::lowerEH_SJLJ_SETJMP(SDValue Op,
17295 SelectionDAG &DAG) const {
17297 return DAG.getNode(X86ISD::EH_SJLJ_SETJMP, DL,
17298 DAG.getVTList(MVT::i32, MVT::Other),
17299 Op.getOperand(0), Op.getOperand(1));
17302 SDValue X86TargetLowering::lowerEH_SJLJ_LONGJMP(SDValue Op,
17303 SelectionDAG &DAG) const {
17305 return DAG.getNode(X86ISD::EH_SJLJ_LONGJMP, DL, MVT::Other,
17306 Op.getOperand(0), Op.getOperand(1));
17309 static SDValue LowerADJUST_TRAMPOLINE(SDValue Op, SelectionDAG &DAG) {
17310 return Op.getOperand(0);
17313 SDValue X86TargetLowering::LowerINIT_TRAMPOLINE(SDValue Op,
17314 SelectionDAG &DAG) const {
17315 SDValue Root = Op.getOperand(0);
17316 SDValue Trmp = Op.getOperand(1); // trampoline
17317 SDValue FPtr = Op.getOperand(2); // nested function
17318 SDValue Nest = Op.getOperand(3); // 'nest' parameter value
17321 const Value *TrmpAddr = cast<SrcValueSDNode>(Op.getOperand(4))->getValue();
17322 const TargetRegisterInfo *TRI = Subtarget->getRegisterInfo();
17324 if (Subtarget->is64Bit()) {
17325 SDValue OutChains[6];
17327 // Large code-model.
17328 const unsigned char JMP64r = 0xFF; // 64-bit jmp through register opcode.
17329 const unsigned char MOV64ri = 0xB8; // X86::MOV64ri opcode.
17331 const unsigned char N86R10 = TRI->getEncodingValue(X86::R10) & 0x7;
17332 const unsigned char N86R11 = TRI->getEncodingValue(X86::R11) & 0x7;
17334 const unsigned char REX_WB = 0x40 | 0x08 | 0x01; // REX prefix
17336 // Load the pointer to the nested function into R11.
17337 unsigned OpCode = ((MOV64ri | N86R11) << 8) | REX_WB; // movabsq r11
17338 SDValue Addr = Trmp;
17339 OutChains[0] = DAG.getStore(Root, dl, DAG.getConstant(OpCode, dl, MVT::i16),
17340 Addr, MachinePointerInfo(TrmpAddr),
17343 Addr = DAG.getNode(ISD::ADD, dl, MVT::i64, Trmp,
17344 DAG.getConstant(2, dl, MVT::i64));
17345 OutChains[1] = DAG.getStore(Root, dl, FPtr, Addr,
17346 MachinePointerInfo(TrmpAddr, 2),
17349 // Load the 'nest' parameter value into R10.
17350 // R10 is specified in X86CallingConv.td
17351 OpCode = ((MOV64ri | N86R10) << 8) | REX_WB; // movabsq r10
17352 Addr = DAG.getNode(ISD::ADD, dl, MVT::i64, Trmp,
17353 DAG.getConstant(10, dl, MVT::i64));
17354 OutChains[2] = DAG.getStore(Root, dl, DAG.getConstant(OpCode, dl, MVT::i16),
17355 Addr, MachinePointerInfo(TrmpAddr, 10),
17358 Addr = DAG.getNode(ISD::ADD, dl, MVT::i64, Trmp,
17359 DAG.getConstant(12, dl, MVT::i64));
17360 OutChains[3] = DAG.getStore(Root, dl, Nest, Addr,
17361 MachinePointerInfo(TrmpAddr, 12),
17364 // Jump to the nested function.
17365 OpCode = (JMP64r << 8) | REX_WB; // jmpq *...
17366 Addr = DAG.getNode(ISD::ADD, dl, MVT::i64, Trmp,
17367 DAG.getConstant(20, dl, MVT::i64));
17368 OutChains[4] = DAG.getStore(Root, dl, DAG.getConstant(OpCode, dl, MVT::i16),
17369 Addr, MachinePointerInfo(TrmpAddr, 20),
17372 unsigned char ModRM = N86R11 | (4 << 3) | (3 << 6); // ...r11
17373 Addr = DAG.getNode(ISD::ADD, dl, MVT::i64, Trmp,
17374 DAG.getConstant(22, dl, MVT::i64));
17375 OutChains[5] = DAG.getStore(Root, dl, DAG.getConstant(ModRM, dl, MVT::i8),
17376 Addr, MachinePointerInfo(TrmpAddr, 22),
17379 return DAG.getNode(ISD::TokenFactor, dl, MVT::Other, OutChains);
17381 const Function *Func =
17382 cast<Function>(cast<SrcValueSDNode>(Op.getOperand(5))->getValue());
17383 CallingConv::ID CC = Func->getCallingConv();
17388 llvm_unreachable("Unsupported calling convention");
17389 case CallingConv::C:
17390 case CallingConv::X86_StdCall: {
17391 // Pass 'nest' parameter in ECX.
17392 // Must be kept in sync with X86CallingConv.td
17393 NestReg = X86::ECX;
17395 // Check that ECX wasn't needed by an 'inreg' parameter.
17396 FunctionType *FTy = Func->getFunctionType();
17397 const AttributeSet &Attrs = Func->getAttributes();
17399 if (!Attrs.isEmpty() && !Func->isVarArg()) {
17400 unsigned InRegCount = 0;
17403 for (FunctionType::param_iterator I = FTy->param_begin(),
17404 E = FTy->param_end(); I != E; ++I, ++Idx)
17405 if (Attrs.hasAttribute(Idx, Attribute::InReg)) {
17406 auto &DL = DAG.getDataLayout();
17407 // FIXME: should only count parameters that are lowered to integers.
17408 InRegCount += (DL.getTypeSizeInBits(*I) + 31) / 32;
17411 if (InRegCount > 2) {
17412 report_fatal_error("Nest register in use - reduce number of inreg"
17418 case CallingConv::X86_FastCall:
17419 case CallingConv::X86_ThisCall:
17420 case CallingConv::Fast:
17421 // Pass 'nest' parameter in EAX.
17422 // Must be kept in sync with X86CallingConv.td
17423 NestReg = X86::EAX;
17427 SDValue OutChains[4];
17428 SDValue Addr, Disp;
17430 Addr = DAG.getNode(ISD::ADD, dl, MVT::i32, Trmp,
17431 DAG.getConstant(10, dl, MVT::i32));
17432 Disp = DAG.getNode(ISD::SUB, dl, MVT::i32, FPtr, Addr);
17434 // This is storing the opcode for MOV32ri.
17435 const unsigned char MOV32ri = 0xB8; // X86::MOV32ri's opcode byte.
17436 const unsigned char N86Reg = TRI->getEncodingValue(NestReg) & 0x7;
17437 OutChains[0] = DAG.getStore(Root, dl,
17438 DAG.getConstant(MOV32ri|N86Reg, dl, MVT::i8),
17439 Trmp, MachinePointerInfo(TrmpAddr),
17442 Addr = DAG.getNode(ISD::ADD, dl, MVT::i32, Trmp,
17443 DAG.getConstant(1, dl, MVT::i32));
17444 OutChains[1] = DAG.getStore(Root, dl, Nest, Addr,
17445 MachinePointerInfo(TrmpAddr, 1),
17448 const unsigned char JMP = 0xE9; // jmp <32bit dst> opcode.
17449 Addr = DAG.getNode(ISD::ADD, dl, MVT::i32, Trmp,
17450 DAG.getConstant(5, dl, MVT::i32));
17451 OutChains[2] = DAG.getStore(Root, dl, DAG.getConstant(JMP, dl, MVT::i8),
17452 Addr, MachinePointerInfo(TrmpAddr, 5),
17455 Addr = DAG.getNode(ISD::ADD, dl, MVT::i32, Trmp,
17456 DAG.getConstant(6, dl, MVT::i32));
17457 OutChains[3] = DAG.getStore(Root, dl, Disp, Addr,
17458 MachinePointerInfo(TrmpAddr, 6),
17461 return DAG.getNode(ISD::TokenFactor, dl, MVT::Other, OutChains);
17465 SDValue X86TargetLowering::LowerFLT_ROUNDS_(SDValue Op,
17466 SelectionDAG &DAG) const {
17468 The rounding mode is in bits 11:10 of FPSR, and has the following
17470 00 Round to nearest
17475 FLT_ROUNDS, on the other hand, expects the following:
17482 To perform the conversion, we do:
17483 (((((FPSR & 0x800) >> 11) | ((FPSR & 0x400) >> 9)) + 1) & 3)
17486 MachineFunction &MF = DAG.getMachineFunction();
17487 const TargetFrameLowering &TFI = *Subtarget->getFrameLowering();
17488 unsigned StackAlignment = TFI.getStackAlignment();
17489 MVT VT = Op.getSimpleValueType();
17492 // Save FP Control Word to stack slot
17493 int SSFI = MF.getFrameInfo()->CreateStackObject(2, StackAlignment, false);
17494 SDValue StackSlot =
17495 DAG.getFrameIndex(SSFI, getPointerTy(DAG.getDataLayout()));
17497 MachineMemOperand *MMO =
17498 MF.getMachineMemOperand(MachinePointerInfo::getFixedStack(MF, SSFI),
17499 MachineMemOperand::MOStore, 2, 2);
17501 SDValue Ops[] = { DAG.getEntryNode(), StackSlot };
17502 SDValue Chain = DAG.getMemIntrinsicNode(X86ISD::FNSTCW16m, DL,
17503 DAG.getVTList(MVT::Other),
17504 Ops, MVT::i16, MMO);
17506 // Load FP Control Word from stack slot
17507 SDValue CWD = DAG.getLoad(MVT::i16, DL, Chain, StackSlot,
17508 MachinePointerInfo(), false, false, false, 0);
17510 // Transform as necessary
17512 DAG.getNode(ISD::SRL, DL, MVT::i16,
17513 DAG.getNode(ISD::AND, DL, MVT::i16,
17514 CWD, DAG.getConstant(0x800, DL, MVT::i16)),
17515 DAG.getConstant(11, DL, MVT::i8));
17517 DAG.getNode(ISD::SRL, DL, MVT::i16,
17518 DAG.getNode(ISD::AND, DL, MVT::i16,
17519 CWD, DAG.getConstant(0x400, DL, MVT::i16)),
17520 DAG.getConstant(9, DL, MVT::i8));
17523 DAG.getNode(ISD::AND, DL, MVT::i16,
17524 DAG.getNode(ISD::ADD, DL, MVT::i16,
17525 DAG.getNode(ISD::OR, DL, MVT::i16, CWD1, CWD2),
17526 DAG.getConstant(1, DL, MVT::i16)),
17527 DAG.getConstant(3, DL, MVT::i16));
17529 return DAG.getNode((VT.getSizeInBits() < 16 ?
17530 ISD::TRUNCATE : ISD::ZERO_EXTEND), DL, VT, RetVal);
17533 /// \brief Lower a vector CTLZ using native supported vector CTLZ instruction.
17535 // 1. i32/i64 128/256-bit vector (native support require VLX) are expended
17536 // to 512-bit vector.
17537 // 2. i8/i16 vector implemented using dword LZCNT vector instruction
17538 // ( sub(trunc(lzcnt(zext32(x)))) ). In case zext32(x) is illegal,
17539 // split the vector, perform operation on it's Lo a Hi part and
17540 // concatenate the results.
17541 static SDValue LowerVectorCTLZ_AVX512(SDValue Op, SelectionDAG &DAG) {
17543 MVT VT = Op.getSimpleValueType();
17544 MVT EltVT = VT.getVectorElementType();
17545 unsigned NumElems = VT.getVectorNumElements();
17547 if (EltVT == MVT::i64 || EltVT == MVT::i32) {
17548 // Extend to 512 bit vector.
17549 assert((VT.is256BitVector() || VT.is128BitVector()) &&
17550 "Unsupported value type for operation");
17552 MVT NewVT = MVT::getVectorVT(EltVT, 512 / VT.getScalarSizeInBits());
17553 SDValue Vec512 = DAG.getNode(ISD::INSERT_SUBVECTOR, dl, NewVT,
17554 DAG.getUNDEF(NewVT),
17556 DAG.getIntPtrConstant(0, dl));
17557 SDValue CtlzNode = DAG.getNode(ISD::CTLZ, dl, NewVT, Vec512);
17559 return DAG.getNode(ISD::EXTRACT_SUBVECTOR, dl, VT, CtlzNode,
17560 DAG.getIntPtrConstant(0, dl));
17563 assert((EltVT == MVT::i8 || EltVT == MVT::i16) &&
17564 "Unsupported element type");
17566 if (16 < NumElems) {
17567 // Split vector, it's Lo and Hi parts will be handled in next iteration.
17569 std::tie(Lo, Hi) = DAG.SplitVector(Op.getOperand(0), dl);
17570 MVT OutVT = MVT::getVectorVT(EltVT, NumElems/2);
17572 Lo = DAG.getNode(Op.getOpcode(), dl, OutVT, Lo);
17573 Hi = DAG.getNode(Op.getOpcode(), dl, OutVT, Hi);
17575 return DAG.getNode(ISD::CONCAT_VECTORS, dl, VT, Lo, Hi);
17578 MVT NewVT = MVT::getVectorVT(MVT::i32, NumElems);
17580 assert((NewVT.is256BitVector() || NewVT.is512BitVector()) &&
17581 "Unsupported value type for operation");
17583 // Use native supported vector instruction vplzcntd.
17584 Op = DAG.getNode(ISD::ZERO_EXTEND, dl, NewVT, Op.getOperand(0));
17585 SDValue CtlzNode = DAG.getNode(ISD::CTLZ, dl, NewVT, Op);
17586 SDValue TruncNode = DAG.getNode(ISD::TRUNCATE, dl, VT, CtlzNode);
17587 SDValue Delta = DAG.getConstant(32 - EltVT.getSizeInBits(), dl, VT);
17589 return DAG.getNode(ISD::SUB, dl, VT, TruncNode, Delta);
17592 static SDValue LowerCTLZ(SDValue Op, const X86Subtarget *Subtarget,
17593 SelectionDAG &DAG) {
17594 MVT VT = Op.getSimpleValueType();
17596 unsigned NumBits = VT.getSizeInBits();
17599 if (VT.isVector() && Subtarget->hasAVX512())
17600 return LowerVectorCTLZ_AVX512(Op, DAG);
17602 Op = Op.getOperand(0);
17603 if (VT == MVT::i8) {
17604 // Zero extend to i32 since there is not an i8 bsr.
17606 Op = DAG.getNode(ISD::ZERO_EXTEND, dl, OpVT, Op);
17609 // Issue a bsr (scan bits in reverse) which also sets EFLAGS.
17610 SDVTList VTs = DAG.getVTList(OpVT, MVT::i32);
17611 Op = DAG.getNode(X86ISD::BSR, dl, VTs, Op);
17613 // If src is zero (i.e. bsr sets ZF), returns NumBits.
17616 DAG.getConstant(NumBits + NumBits - 1, dl, OpVT),
17617 DAG.getConstant(X86::COND_E, dl, MVT::i8),
17620 Op = DAG.getNode(X86ISD::CMOV, dl, OpVT, Ops);
17622 // Finally xor with NumBits-1.
17623 Op = DAG.getNode(ISD::XOR, dl, OpVT, Op,
17624 DAG.getConstant(NumBits - 1, dl, OpVT));
17627 Op = DAG.getNode(ISD::TRUNCATE, dl, MVT::i8, Op);
17631 static SDValue LowerCTLZ_ZERO_UNDEF(SDValue Op, const X86Subtarget *Subtarget,
17632 SelectionDAG &DAG) {
17633 MVT VT = Op.getSimpleValueType();
17635 unsigned NumBits = VT.getSizeInBits();
17638 if (VT.isVector() && Subtarget->hasAVX512())
17639 return LowerVectorCTLZ_AVX512(Op, DAG);
17641 Op = Op.getOperand(0);
17642 if (VT == MVT::i8) {
17643 // Zero extend to i32 since there is not an i8 bsr.
17645 Op = DAG.getNode(ISD::ZERO_EXTEND, dl, OpVT, Op);
17648 // Issue a bsr (scan bits in reverse).
17649 SDVTList VTs = DAG.getVTList(OpVT, MVT::i32);
17650 Op = DAG.getNode(X86ISD::BSR, dl, VTs, Op);
17652 // And xor with NumBits-1.
17653 Op = DAG.getNode(ISD::XOR, dl, OpVT, Op,
17654 DAG.getConstant(NumBits - 1, dl, OpVT));
17657 Op = DAG.getNode(ISD::TRUNCATE, dl, MVT::i8, Op);
17661 static SDValue LowerCTTZ(SDValue Op, SelectionDAG &DAG) {
17662 MVT VT = Op.getSimpleValueType();
17663 unsigned NumBits = VT.getScalarSizeInBits();
17666 if (VT.isVector()) {
17667 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
17669 SDValue N0 = Op.getOperand(0);
17670 SDValue Zero = DAG.getConstant(0, dl, VT);
17672 // lsb(x) = (x & -x)
17673 SDValue LSB = DAG.getNode(ISD::AND, dl, VT, N0,
17674 DAG.getNode(ISD::SUB, dl, VT, Zero, N0));
17676 // cttz_undef(x) = (width - 1) - ctlz(lsb)
17677 if (Op.getOpcode() == ISD::CTTZ_ZERO_UNDEF &&
17678 TLI.isOperationLegal(ISD::CTLZ, VT)) {
17679 SDValue WidthMinusOne = DAG.getConstant(NumBits - 1, dl, VT);
17680 return DAG.getNode(ISD::SUB, dl, VT, WidthMinusOne,
17681 DAG.getNode(ISD::CTLZ, dl, VT, LSB));
17684 // cttz(x) = ctpop(lsb - 1)
17685 SDValue One = DAG.getConstant(1, dl, VT);
17686 return DAG.getNode(ISD::CTPOP, dl, VT,
17687 DAG.getNode(ISD::SUB, dl, VT, LSB, One));
17690 assert(Op.getOpcode() == ISD::CTTZ &&
17691 "Only scalar CTTZ requires custom lowering");
17693 // Issue a bsf (scan bits forward) which also sets EFLAGS.
17694 SDVTList VTs = DAG.getVTList(VT, MVT::i32);
17695 Op = DAG.getNode(X86ISD::BSF, dl, VTs, Op.getOperand(0));
17697 // If src is zero (i.e. bsf sets ZF), returns NumBits.
17700 DAG.getConstant(NumBits, dl, VT),
17701 DAG.getConstant(X86::COND_E, dl, MVT::i8),
17704 return DAG.getNode(X86ISD::CMOV, dl, VT, Ops);
17707 // Lower256IntArith - Break a 256-bit integer operation into two new 128-bit
17708 // ones, and then concatenate the result back.
17709 static SDValue Lower256IntArith(SDValue Op, SelectionDAG &DAG) {
17710 MVT VT = Op.getSimpleValueType();
17712 assert(VT.is256BitVector() && VT.isInteger() &&
17713 "Unsupported value type for operation");
17715 unsigned NumElems = VT.getVectorNumElements();
17718 // Extract the LHS vectors
17719 SDValue LHS = Op.getOperand(0);
17720 SDValue LHS1 = Extract128BitVector(LHS, 0, DAG, dl);
17721 SDValue LHS2 = Extract128BitVector(LHS, NumElems/2, DAG, dl);
17723 // Extract the RHS vectors
17724 SDValue RHS = Op.getOperand(1);
17725 SDValue RHS1 = Extract128BitVector(RHS, 0, DAG, dl);
17726 SDValue RHS2 = Extract128BitVector(RHS, NumElems/2, DAG, dl);
17728 MVT EltVT = VT.getVectorElementType();
17729 MVT NewVT = MVT::getVectorVT(EltVT, NumElems/2);
17731 return DAG.getNode(ISD::CONCAT_VECTORS, dl, VT,
17732 DAG.getNode(Op.getOpcode(), dl, NewVT, LHS1, RHS1),
17733 DAG.getNode(Op.getOpcode(), dl, NewVT, LHS2, RHS2));
17736 static SDValue LowerADD(SDValue Op, SelectionDAG &DAG) {
17737 if (Op.getValueType() == MVT::i1)
17738 return DAG.getNode(ISD::XOR, SDLoc(Op), Op.getValueType(),
17739 Op.getOperand(0), Op.getOperand(1));
17740 assert(Op.getSimpleValueType().is256BitVector() &&
17741 Op.getSimpleValueType().isInteger() &&
17742 "Only handle AVX 256-bit vector integer operation");
17743 return Lower256IntArith(Op, DAG);
17746 static SDValue LowerSUB(SDValue Op, SelectionDAG &DAG) {
17747 if (Op.getValueType() == MVT::i1)
17748 return DAG.getNode(ISD::XOR, SDLoc(Op), Op.getValueType(),
17749 Op.getOperand(0), Op.getOperand(1));
17750 assert(Op.getSimpleValueType().is256BitVector() &&
17751 Op.getSimpleValueType().isInteger() &&
17752 "Only handle AVX 256-bit vector integer operation");
17753 return Lower256IntArith(Op, DAG);
17756 static SDValue LowerMINMAX(SDValue Op, SelectionDAG &DAG) {
17757 assert(Op.getSimpleValueType().is256BitVector() &&
17758 Op.getSimpleValueType().isInteger() &&
17759 "Only handle AVX 256-bit vector integer operation");
17760 return Lower256IntArith(Op, DAG);
17763 static SDValue LowerMUL(SDValue Op, const X86Subtarget *Subtarget,
17764 SelectionDAG &DAG) {
17766 MVT VT = Op.getSimpleValueType();
17769 return DAG.getNode(ISD::AND, dl, VT, Op.getOperand(0), Op.getOperand(1));
17771 // Decompose 256-bit ops into smaller 128-bit ops.
17772 if (VT.is256BitVector() && !Subtarget->hasInt256())
17773 return Lower256IntArith(Op, DAG);
17775 SDValue A = Op.getOperand(0);
17776 SDValue B = Op.getOperand(1);
17778 // Lower v16i8/v32i8 mul as promotion to v8i16/v16i16 vector
17779 // pairs, multiply and truncate.
17780 if (VT == MVT::v16i8 || VT == MVT::v32i8) {
17781 if (Subtarget->hasInt256()) {
17782 if (VT == MVT::v32i8) {
17783 MVT SubVT = MVT::getVectorVT(MVT::i8, VT.getVectorNumElements() / 2);
17784 SDValue Lo = DAG.getIntPtrConstant(0, dl);
17785 SDValue Hi = DAG.getIntPtrConstant(VT.getVectorNumElements() / 2, dl);
17786 SDValue ALo = DAG.getNode(ISD::EXTRACT_SUBVECTOR, dl, SubVT, A, Lo);
17787 SDValue BLo = DAG.getNode(ISD::EXTRACT_SUBVECTOR, dl, SubVT, B, Lo);
17788 SDValue AHi = DAG.getNode(ISD::EXTRACT_SUBVECTOR, dl, SubVT, A, Hi);
17789 SDValue BHi = DAG.getNode(ISD::EXTRACT_SUBVECTOR, dl, SubVT, B, Hi);
17790 return DAG.getNode(ISD::CONCAT_VECTORS, dl, VT,
17791 DAG.getNode(ISD::MUL, dl, SubVT, ALo, BLo),
17792 DAG.getNode(ISD::MUL, dl, SubVT, AHi, BHi));
17795 MVT ExVT = MVT::getVectorVT(MVT::i16, VT.getVectorNumElements());
17796 return DAG.getNode(
17797 ISD::TRUNCATE, dl, VT,
17798 DAG.getNode(ISD::MUL, dl, ExVT,
17799 DAG.getNode(ISD::SIGN_EXTEND, dl, ExVT, A),
17800 DAG.getNode(ISD::SIGN_EXTEND, dl, ExVT, B)));
17803 assert(VT == MVT::v16i8 &&
17804 "Pre-AVX2 support only supports v16i8 multiplication");
17805 MVT ExVT = MVT::v8i16;
17807 // Extract the lo parts and sign extend to i16
17809 if (Subtarget->hasSSE41()) {
17810 ALo = DAG.getNode(X86ISD::VSEXT, dl, ExVT, A);
17811 BLo = DAG.getNode(X86ISD::VSEXT, dl, ExVT, B);
17813 const int ShufMask[] = {-1, 0, -1, 1, -1, 2, -1, 3,
17814 -1, 4, -1, 5, -1, 6, -1, 7};
17815 ALo = DAG.getVectorShuffle(VT, dl, A, A, ShufMask);
17816 BLo = DAG.getVectorShuffle(VT, dl, B, B, ShufMask);
17817 ALo = DAG.getBitcast(ExVT, ALo);
17818 BLo = DAG.getBitcast(ExVT, BLo);
17819 ALo = DAG.getNode(ISD::SRA, dl, ExVT, ALo, DAG.getConstant(8, dl, ExVT));
17820 BLo = DAG.getNode(ISD::SRA, dl, ExVT, BLo, DAG.getConstant(8, dl, ExVT));
17823 // Extract the hi parts and sign extend to i16
17825 if (Subtarget->hasSSE41()) {
17826 const int ShufMask[] = {8, 9, 10, 11, 12, 13, 14, 15,
17827 -1, -1, -1, -1, -1, -1, -1, -1};
17828 AHi = DAG.getVectorShuffle(VT, dl, A, A, ShufMask);
17829 BHi = DAG.getVectorShuffle(VT, dl, B, B, ShufMask);
17830 AHi = DAG.getNode(X86ISD::VSEXT, dl, ExVT, AHi);
17831 BHi = DAG.getNode(X86ISD::VSEXT, dl, ExVT, BHi);
17833 const int ShufMask[] = {-1, 8, -1, 9, -1, 10, -1, 11,
17834 -1, 12, -1, 13, -1, 14, -1, 15};
17835 AHi = DAG.getVectorShuffle(VT, dl, A, A, ShufMask);
17836 BHi = DAG.getVectorShuffle(VT, dl, B, B, ShufMask);
17837 AHi = DAG.getBitcast(ExVT, AHi);
17838 BHi = DAG.getBitcast(ExVT, BHi);
17839 AHi = DAG.getNode(ISD::SRA, dl, ExVT, AHi, DAG.getConstant(8, dl, ExVT));
17840 BHi = DAG.getNode(ISD::SRA, dl, ExVT, BHi, DAG.getConstant(8, dl, ExVT));
17843 // Multiply, mask the lower 8bits of the lo/hi results and pack
17844 SDValue RLo = DAG.getNode(ISD::MUL, dl, ExVT, ALo, BLo);
17845 SDValue RHi = DAG.getNode(ISD::MUL, dl, ExVT, AHi, BHi);
17846 RLo = DAG.getNode(ISD::AND, dl, ExVT, RLo, DAG.getConstant(255, dl, ExVT));
17847 RHi = DAG.getNode(ISD::AND, dl, ExVT, RHi, DAG.getConstant(255, dl, ExVT));
17848 return DAG.getNode(X86ISD::PACKUS, dl, VT, RLo, RHi);
17851 // Lower v4i32 mul as 2x shuffle, 2x pmuludq, 2x shuffle.
17852 if (VT == MVT::v4i32) {
17853 assert(Subtarget->hasSSE2() && !Subtarget->hasSSE41() &&
17854 "Should not custom lower when pmuldq is available!");
17856 // Extract the odd parts.
17857 static const int UnpackMask[] = { 1, -1, 3, -1 };
17858 SDValue Aodds = DAG.getVectorShuffle(VT, dl, A, A, UnpackMask);
17859 SDValue Bodds = DAG.getVectorShuffle(VT, dl, B, B, UnpackMask);
17861 // Multiply the even parts.
17862 SDValue Evens = DAG.getNode(X86ISD::PMULUDQ, dl, MVT::v2i64, A, B);
17863 // Now multiply odd parts.
17864 SDValue Odds = DAG.getNode(X86ISD::PMULUDQ, dl, MVT::v2i64, Aodds, Bodds);
17866 Evens = DAG.getBitcast(VT, Evens);
17867 Odds = DAG.getBitcast(VT, Odds);
17869 // Merge the two vectors back together with a shuffle. This expands into 2
17871 static const int ShufMask[] = { 0, 4, 2, 6 };
17872 return DAG.getVectorShuffle(VT, dl, Evens, Odds, ShufMask);
17875 assert((VT == MVT::v2i64 || VT == MVT::v4i64 || VT == MVT::v8i64) &&
17876 "Only know how to lower V2I64/V4I64/V8I64 multiply");
17878 // Ahi = psrlqi(a, 32);
17879 // Bhi = psrlqi(b, 32);
17881 // AloBlo = pmuludq(a, b);
17882 // AloBhi = pmuludq(a, Bhi);
17883 // AhiBlo = pmuludq(Ahi, b);
17885 // AloBhi = psllqi(AloBhi, 32);
17886 // AhiBlo = psllqi(AhiBlo, 32);
17887 // return AloBlo + AloBhi + AhiBlo;
17889 SDValue Ahi = getTargetVShiftByConstNode(X86ISD::VSRLI, dl, VT, A, 32, DAG);
17890 SDValue Bhi = getTargetVShiftByConstNode(X86ISD::VSRLI, dl, VT, B, 32, DAG);
17892 SDValue AhiBlo = Ahi;
17893 SDValue AloBhi = Bhi;
17894 // Bit cast to 32-bit vectors for MULUDQ
17895 MVT MulVT = (VT == MVT::v2i64) ? MVT::v4i32 :
17896 (VT == MVT::v4i64) ? MVT::v8i32 : MVT::v16i32;
17897 A = DAG.getBitcast(MulVT, A);
17898 B = DAG.getBitcast(MulVT, B);
17899 Ahi = DAG.getBitcast(MulVT, Ahi);
17900 Bhi = DAG.getBitcast(MulVT, Bhi);
17902 SDValue AloBlo = DAG.getNode(X86ISD::PMULUDQ, dl, VT, A, B);
17903 // After shifting right const values the result may be all-zero.
17904 if (!ISD::isBuildVectorAllZeros(Ahi.getNode())) {
17905 AhiBlo = DAG.getNode(X86ISD::PMULUDQ, dl, VT, Ahi, B);
17906 AhiBlo = getTargetVShiftByConstNode(X86ISD::VSHLI, dl, VT, AhiBlo, 32, DAG);
17908 if (!ISD::isBuildVectorAllZeros(Bhi.getNode())) {
17909 AloBhi = DAG.getNode(X86ISD::PMULUDQ, dl, VT, A, Bhi);
17910 AloBhi = getTargetVShiftByConstNode(X86ISD::VSHLI, dl, VT, AloBhi, 32, DAG);
17913 SDValue Res = DAG.getNode(ISD::ADD, dl, VT, AloBlo, AloBhi);
17914 return DAG.getNode(ISD::ADD, dl, VT, Res, AhiBlo);
17917 SDValue X86TargetLowering::LowerWin64_i128OP(SDValue Op, SelectionDAG &DAG) const {
17918 assert(Subtarget->isTargetWin64() && "Unexpected target");
17919 EVT VT = Op.getValueType();
17920 assert(VT.isInteger() && VT.getSizeInBits() == 128 &&
17921 "Unexpected return type for lowering");
17925 switch (Op->getOpcode()) {
17926 default: llvm_unreachable("Unexpected request for libcall!");
17927 case ISD::SDIV: isSigned = true; LC = RTLIB::SDIV_I128; break;
17928 case ISD::UDIV: isSigned = false; LC = RTLIB::UDIV_I128; break;
17929 case ISD::SREM: isSigned = true; LC = RTLIB::SREM_I128; break;
17930 case ISD::UREM: isSigned = false; LC = RTLIB::UREM_I128; break;
17931 case ISD::SDIVREM: isSigned = true; LC = RTLIB::SDIVREM_I128; break;
17932 case ISD::UDIVREM: isSigned = false; LC = RTLIB::UDIVREM_I128; break;
17936 SDValue InChain = DAG.getEntryNode();
17938 TargetLowering::ArgListTy Args;
17939 TargetLowering::ArgListEntry Entry;
17940 for (unsigned i = 0, e = Op->getNumOperands(); i != e; ++i) {
17941 EVT ArgVT = Op->getOperand(i).getValueType();
17942 assert(ArgVT.isInteger() && ArgVT.getSizeInBits() == 128 &&
17943 "Unexpected argument type for lowering");
17944 SDValue StackPtr = DAG.CreateStackTemporary(ArgVT, 16);
17945 Entry.Node = StackPtr;
17946 InChain = DAG.getStore(InChain, dl, Op->getOperand(i), StackPtr, MachinePointerInfo(),
17948 Type *ArgTy = ArgVT.getTypeForEVT(*DAG.getContext());
17949 Entry.Ty = PointerType::get(ArgTy,0);
17950 Entry.isSExt = false;
17951 Entry.isZExt = false;
17952 Args.push_back(Entry);
17955 SDValue Callee = DAG.getExternalSymbol(getLibcallName(LC),
17956 getPointerTy(DAG.getDataLayout()));
17958 TargetLowering::CallLoweringInfo CLI(DAG);
17959 CLI.setDebugLoc(dl).setChain(InChain)
17960 .setCallee(getLibcallCallingConv(LC),
17961 static_cast<EVT>(MVT::v2i64).getTypeForEVT(*DAG.getContext()),
17962 Callee, std::move(Args), 0)
17963 .setInRegister().setSExtResult(isSigned).setZExtResult(!isSigned);
17965 std::pair<SDValue, SDValue> CallInfo = LowerCallTo(CLI);
17966 return DAG.getBitcast(VT, CallInfo.first);
17969 static SDValue LowerMUL_LOHI(SDValue Op, const X86Subtarget *Subtarget,
17970 SelectionDAG &DAG) {
17971 SDValue Op0 = Op.getOperand(0), Op1 = Op.getOperand(1);
17972 MVT VT = Op0.getSimpleValueType();
17975 assert((VT == MVT::v4i32 && Subtarget->hasSSE2()) ||
17976 (VT == MVT::v8i32 && Subtarget->hasInt256()));
17978 // PMULxD operations multiply each even value (starting at 0) of LHS with
17979 // the related value of RHS and produce a widen result.
17980 // E.g., PMULUDQ <4 x i32> <a|b|c|d>, <4 x i32> <e|f|g|h>
17981 // => <2 x i64> <ae|cg>
17983 // In other word, to have all the results, we need to perform two PMULxD:
17984 // 1. one with the even values.
17985 // 2. one with the odd values.
17986 // To achieve #2, with need to place the odd values at an even position.
17988 // Place the odd value at an even position (basically, shift all values 1
17989 // step to the left):
17990 const int Mask[] = {1, -1, 3, -1, 5, -1, 7, -1};
17991 // <a|b|c|d> => <b|undef|d|undef>
17992 SDValue Odd0 = DAG.getVectorShuffle(VT, dl, Op0, Op0, Mask);
17993 // <e|f|g|h> => <f|undef|h|undef>
17994 SDValue Odd1 = DAG.getVectorShuffle(VT, dl, Op1, Op1, Mask);
17996 // Emit two multiplies, one for the lower 2 ints and one for the higher 2
17998 MVT MulVT = VT == MVT::v4i32 ? MVT::v2i64 : MVT::v4i64;
17999 bool IsSigned = Op->getOpcode() == ISD::SMUL_LOHI;
18001 (!IsSigned || !Subtarget->hasSSE41()) ? X86ISD::PMULUDQ : X86ISD::PMULDQ;
18002 // PMULUDQ <4 x i32> <a|b|c|d>, <4 x i32> <e|f|g|h>
18003 // => <2 x i64> <ae|cg>
18004 SDValue Mul1 = DAG.getBitcast(VT, DAG.getNode(Opcode, dl, MulVT, Op0, Op1));
18005 // PMULUDQ <4 x i32> <b|undef|d|undef>, <4 x i32> <f|undef|h|undef>
18006 // => <2 x i64> <bf|dh>
18007 SDValue Mul2 = DAG.getBitcast(VT, DAG.getNode(Opcode, dl, MulVT, Odd0, Odd1));
18009 // Shuffle it back into the right order.
18010 SDValue Highs, Lows;
18011 if (VT == MVT::v8i32) {
18012 const int HighMask[] = {1, 9, 3, 11, 5, 13, 7, 15};
18013 Highs = DAG.getVectorShuffle(VT, dl, Mul1, Mul2, HighMask);
18014 const int LowMask[] = {0, 8, 2, 10, 4, 12, 6, 14};
18015 Lows = DAG.getVectorShuffle(VT, dl, Mul1, Mul2, LowMask);
18017 const int HighMask[] = {1, 5, 3, 7};
18018 Highs = DAG.getVectorShuffle(VT, dl, Mul1, Mul2, HighMask);
18019 const int LowMask[] = {0, 4, 2, 6};
18020 Lows = DAG.getVectorShuffle(VT, dl, Mul1, Mul2, LowMask);
18023 // If we have a signed multiply but no PMULDQ fix up the high parts of a
18024 // unsigned multiply.
18025 if (IsSigned && !Subtarget->hasSSE41()) {
18026 SDValue ShAmt = DAG.getConstant(
18028 DAG.getTargetLoweringInfo().getShiftAmountTy(VT, DAG.getDataLayout()));
18029 SDValue T1 = DAG.getNode(ISD::AND, dl, VT,
18030 DAG.getNode(ISD::SRA, dl, VT, Op0, ShAmt), Op1);
18031 SDValue T2 = DAG.getNode(ISD::AND, dl, VT,
18032 DAG.getNode(ISD::SRA, dl, VT, Op1, ShAmt), Op0);
18034 SDValue Fixup = DAG.getNode(ISD::ADD, dl, VT, T1, T2);
18035 Highs = DAG.getNode(ISD::SUB, dl, VT, Highs, Fixup);
18038 // The first result of MUL_LOHI is actually the low value, followed by the
18040 SDValue Ops[] = {Lows, Highs};
18041 return DAG.getMergeValues(Ops, dl);
18044 // Return true if the required (according to Opcode) shift-imm form is natively
18045 // supported by the Subtarget
18046 static bool SupportedVectorShiftWithImm(MVT VT, const X86Subtarget *Subtarget,
18048 if (VT.getScalarSizeInBits() < 16)
18051 if (VT.is512BitVector() &&
18052 (VT.getScalarSizeInBits() > 16 || Subtarget->hasBWI()))
18055 bool LShift = VT.is128BitVector() ||
18056 (VT.is256BitVector() && Subtarget->hasInt256());
18058 bool AShift = LShift && (Subtarget->hasVLX() ||
18059 (VT != MVT::v2i64 && VT != MVT::v4i64));
18060 return (Opcode == ISD::SRA) ? AShift : LShift;
18063 // The shift amount is a variable, but it is the same for all vector lanes.
18064 // These instructions are defined together with shift-immediate.
18066 bool SupportedVectorShiftWithBaseAmnt(MVT VT, const X86Subtarget *Subtarget,
18068 return SupportedVectorShiftWithImm(VT, Subtarget, Opcode);
18071 // Return true if the required (according to Opcode) variable-shift form is
18072 // natively supported by the Subtarget
18073 static bool SupportedVectorVarShift(MVT VT, const X86Subtarget *Subtarget,
18076 if (!Subtarget->hasInt256() || VT.getScalarSizeInBits() < 16)
18079 // vXi16 supported only on AVX-512, BWI
18080 if (VT.getScalarSizeInBits() == 16 && !Subtarget->hasBWI())
18083 if (VT.is512BitVector() || Subtarget->hasVLX())
18086 bool LShift = VT.is128BitVector() || VT.is256BitVector();
18087 bool AShift = LShift && VT != MVT::v2i64 && VT != MVT::v4i64;
18088 return (Opcode == ISD::SRA) ? AShift : LShift;
18091 static SDValue LowerScalarImmediateShift(SDValue Op, SelectionDAG &DAG,
18092 const X86Subtarget *Subtarget) {
18093 MVT VT = Op.getSimpleValueType();
18095 SDValue R = Op.getOperand(0);
18096 SDValue Amt = Op.getOperand(1);
18098 unsigned X86Opc = (Op.getOpcode() == ISD::SHL) ? X86ISD::VSHLI :
18099 (Op.getOpcode() == ISD::SRL) ? X86ISD::VSRLI : X86ISD::VSRAI;
18101 auto ArithmeticShiftRight64 = [&](uint64_t ShiftAmt) {
18102 assert((VT == MVT::v2i64 || VT == MVT::v4i64) && "Unexpected SRA type");
18103 MVT ExVT = MVT::getVectorVT(MVT::i32, VT.getVectorNumElements() * 2);
18104 SDValue Ex = DAG.getBitcast(ExVT, R);
18106 if (ShiftAmt >= 32) {
18107 // Splat sign to upper i32 dst, and SRA upper i32 src to lower i32.
18109 getTargetVShiftByConstNode(X86ISD::VSRAI, dl, ExVT, Ex, 31, DAG);
18110 SDValue Lower = getTargetVShiftByConstNode(X86ISD::VSRAI, dl, ExVT, Ex,
18111 ShiftAmt - 32, DAG);
18112 if (VT == MVT::v2i64)
18113 Ex = DAG.getVectorShuffle(ExVT, dl, Upper, Lower, {5, 1, 7, 3});
18114 if (VT == MVT::v4i64)
18115 Ex = DAG.getVectorShuffle(ExVT, dl, Upper, Lower,
18116 {9, 1, 11, 3, 13, 5, 15, 7});
18118 // SRA upper i32, SHL whole i64 and select lower i32.
18119 SDValue Upper = getTargetVShiftByConstNode(X86ISD::VSRAI, dl, ExVT, Ex,
18122 getTargetVShiftByConstNode(X86ISD::VSRLI, dl, VT, R, ShiftAmt, DAG);
18123 Lower = DAG.getBitcast(ExVT, Lower);
18124 if (VT == MVT::v2i64)
18125 Ex = DAG.getVectorShuffle(ExVT, dl, Upper, Lower, {4, 1, 6, 3});
18126 if (VT == MVT::v4i64)
18127 Ex = DAG.getVectorShuffle(ExVT, dl, Upper, Lower,
18128 {8, 1, 10, 3, 12, 5, 14, 7});
18130 return DAG.getBitcast(VT, Ex);
18133 // Optimize shl/srl/sra with constant shift amount.
18134 if (auto *BVAmt = dyn_cast<BuildVectorSDNode>(Amt)) {
18135 if (auto *ShiftConst = BVAmt->getConstantSplatNode()) {
18136 uint64_t ShiftAmt = ShiftConst->getZExtValue();
18138 if (SupportedVectorShiftWithImm(VT, Subtarget, Op.getOpcode()))
18139 return getTargetVShiftByConstNode(X86Opc, dl, VT, R, ShiftAmt, DAG);
18141 // i64 SRA needs to be performed as partial shifts.
18142 if ((VT == MVT::v2i64 || (Subtarget->hasInt256() && VT == MVT::v4i64)) &&
18143 Op.getOpcode() == ISD::SRA && !Subtarget->hasXOP())
18144 return ArithmeticShiftRight64(ShiftAmt);
18146 if (VT == MVT::v16i8 || (Subtarget->hasInt256() && VT == MVT::v32i8)) {
18147 unsigned NumElts = VT.getVectorNumElements();
18148 MVT ShiftVT = MVT::getVectorVT(MVT::i16, NumElts / 2);
18150 // Simple i8 add case
18151 if (Op.getOpcode() == ISD::SHL && ShiftAmt == 1)
18152 return DAG.getNode(ISD::ADD, dl, VT, R, R);
18154 // ashr(R, 7) === cmp_slt(R, 0)
18155 if (Op.getOpcode() == ISD::SRA && ShiftAmt == 7) {
18156 SDValue Zeros = getZeroVector(VT, Subtarget, DAG, dl);
18157 return DAG.getNode(X86ISD::PCMPGT, dl, VT, Zeros, R);
18160 // XOP can shift v16i8 directly instead of as shift v8i16 + mask.
18161 if (VT == MVT::v16i8 && Subtarget->hasXOP())
18164 if (Op.getOpcode() == ISD::SHL) {
18165 // Make a large shift.
18166 SDValue SHL = getTargetVShiftByConstNode(X86ISD::VSHLI, dl, ShiftVT,
18168 SHL = DAG.getBitcast(VT, SHL);
18169 // Zero out the rightmost bits.
18170 SmallVector<SDValue, 32> V(
18171 NumElts, DAG.getConstant(uint8_t(-1U << ShiftAmt), dl, MVT::i8));
18172 return DAG.getNode(ISD::AND, dl, VT, SHL,
18173 DAG.getNode(ISD::BUILD_VECTOR, dl, VT, V));
18175 if (Op.getOpcode() == ISD::SRL) {
18176 // Make a large shift.
18177 SDValue SRL = getTargetVShiftByConstNode(X86ISD::VSRLI, dl, ShiftVT,
18179 SRL = DAG.getBitcast(VT, SRL);
18180 // Zero out the leftmost bits.
18181 SmallVector<SDValue, 32> V(
18182 NumElts, DAG.getConstant(uint8_t(-1U) >> ShiftAmt, dl, MVT::i8));
18183 return DAG.getNode(ISD::AND, dl, VT, SRL,
18184 DAG.getNode(ISD::BUILD_VECTOR, dl, VT, V));
18186 if (Op.getOpcode() == ISD::SRA) {
18187 // ashr(R, Amt) === sub(xor(lshr(R, Amt), Mask), Mask)
18188 SDValue Res = DAG.getNode(ISD::SRL, dl, VT, R, Amt);
18189 SmallVector<SDValue, 32> V(NumElts,
18190 DAG.getConstant(128 >> ShiftAmt, dl,
18192 SDValue Mask = DAG.getNode(ISD::BUILD_VECTOR, dl, VT, V);
18193 Res = DAG.getNode(ISD::XOR, dl, VT, Res, Mask);
18194 Res = DAG.getNode(ISD::SUB, dl, VT, Res, Mask);
18197 llvm_unreachable("Unknown shift opcode.");
18202 // Special case in 32-bit mode, where i64 is expanded into high and low parts.
18203 if (!Subtarget->is64Bit() && !Subtarget->hasXOP() &&
18204 (VT == MVT::v2i64 || (Subtarget->hasInt256() && VT == MVT::v4i64))) {
18206 // Peek through any splat that was introduced for i64 shift vectorization.
18207 int SplatIndex = -1;
18208 if (ShuffleVectorSDNode *SVN = dyn_cast<ShuffleVectorSDNode>(Amt.getNode()))
18209 if (SVN->isSplat()) {
18210 SplatIndex = SVN->getSplatIndex();
18211 Amt = Amt.getOperand(0);
18212 assert(SplatIndex < (int)VT.getVectorNumElements() &&
18213 "Splat shuffle referencing second operand");
18216 if (Amt.getOpcode() != ISD::BITCAST ||
18217 Amt.getOperand(0).getOpcode() != ISD::BUILD_VECTOR)
18220 Amt = Amt.getOperand(0);
18221 unsigned Ratio = Amt.getSimpleValueType().getVectorNumElements() /
18222 VT.getVectorNumElements();
18223 unsigned RatioInLog2 = Log2_32_Ceil(Ratio);
18224 uint64_t ShiftAmt = 0;
18225 unsigned BaseOp = (SplatIndex < 0 ? 0 : SplatIndex * Ratio);
18226 for (unsigned i = 0; i != Ratio; ++i) {
18227 ConstantSDNode *C = dyn_cast<ConstantSDNode>(Amt.getOperand(i + BaseOp));
18231 ShiftAmt |= C->getZExtValue() << (i * (1 << (6 - RatioInLog2)));
18234 // Check remaining shift amounts (if not a splat).
18235 if (SplatIndex < 0) {
18236 for (unsigned i = Ratio; i != Amt.getNumOperands(); i += Ratio) {
18237 uint64_t ShAmt = 0;
18238 for (unsigned j = 0; j != Ratio; ++j) {
18239 ConstantSDNode *C = dyn_cast<ConstantSDNode>(Amt.getOperand(i + j));
18243 ShAmt |= C->getZExtValue() << (j * (1 << (6 - RatioInLog2)));
18245 if (ShAmt != ShiftAmt)
18250 if (SupportedVectorShiftWithImm(VT, Subtarget, Op.getOpcode()))
18251 return getTargetVShiftByConstNode(X86Opc, dl, VT, R, ShiftAmt, DAG);
18253 if (Op.getOpcode() == ISD::SRA)
18254 return ArithmeticShiftRight64(ShiftAmt);
18260 static SDValue LowerScalarVariableShift(SDValue Op, SelectionDAG &DAG,
18261 const X86Subtarget* Subtarget) {
18262 MVT VT = Op.getSimpleValueType();
18264 SDValue R = Op.getOperand(0);
18265 SDValue Amt = Op.getOperand(1);
18267 unsigned X86OpcI = (Op.getOpcode() == ISD::SHL) ? X86ISD::VSHLI :
18268 (Op.getOpcode() == ISD::SRL) ? X86ISD::VSRLI : X86ISD::VSRAI;
18270 unsigned X86OpcV = (Op.getOpcode() == ISD::SHL) ? X86ISD::VSHL :
18271 (Op.getOpcode() == ISD::SRL) ? X86ISD::VSRL : X86ISD::VSRA;
18273 if (SupportedVectorShiftWithBaseAmnt(VT, Subtarget, Op.getOpcode())) {
18275 MVT EltVT = VT.getVectorElementType();
18277 if (BuildVectorSDNode *BV = dyn_cast<BuildVectorSDNode>(Amt)) {
18278 // Check if this build_vector node is doing a splat.
18279 // If so, then set BaseShAmt equal to the splat value.
18280 BaseShAmt = BV->getSplatValue();
18281 if (BaseShAmt && BaseShAmt.getOpcode() == ISD::UNDEF)
18282 BaseShAmt = SDValue();
18284 if (Amt.getOpcode() == ISD::EXTRACT_SUBVECTOR)
18285 Amt = Amt.getOperand(0);
18287 ShuffleVectorSDNode *SVN = dyn_cast<ShuffleVectorSDNode>(Amt);
18288 if (SVN && SVN->isSplat()) {
18289 unsigned SplatIdx = (unsigned)SVN->getSplatIndex();
18290 SDValue InVec = Amt.getOperand(0);
18291 if (InVec.getOpcode() == ISD::BUILD_VECTOR) {
18292 assert((SplatIdx < InVec.getSimpleValueType().getVectorNumElements()) &&
18293 "Unexpected shuffle index found!");
18294 BaseShAmt = InVec.getOperand(SplatIdx);
18295 } else if (InVec.getOpcode() == ISD::INSERT_VECTOR_ELT) {
18296 if (ConstantSDNode *C =
18297 dyn_cast<ConstantSDNode>(InVec.getOperand(2))) {
18298 if (C->getZExtValue() == SplatIdx)
18299 BaseShAmt = InVec.getOperand(1);
18304 // Avoid introducing an extract element from a shuffle.
18305 BaseShAmt = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, EltVT, InVec,
18306 DAG.getIntPtrConstant(SplatIdx, dl));
18310 if (BaseShAmt.getNode()) {
18311 assert(EltVT.bitsLE(MVT::i64) && "Unexpected element type!");
18312 if (EltVT != MVT::i64 && EltVT.bitsGT(MVT::i32))
18313 BaseShAmt = DAG.getNode(ISD::ZERO_EXTEND, dl, MVT::i64, BaseShAmt);
18314 else if (EltVT.bitsLT(MVT::i32))
18315 BaseShAmt = DAG.getNode(ISD::ZERO_EXTEND, dl, MVT::i32, BaseShAmt);
18317 return getTargetVShiftNode(X86OpcI, dl, VT, R, BaseShAmt, DAG);
18321 // Special case in 32-bit mode, where i64 is expanded into high and low parts.
18322 if (!Subtarget->is64Bit() && VT == MVT::v2i64 &&
18323 Amt.getOpcode() == ISD::BITCAST &&
18324 Amt.getOperand(0).getOpcode() == ISD::BUILD_VECTOR) {
18325 Amt = Amt.getOperand(0);
18326 unsigned Ratio = Amt.getSimpleValueType().getVectorNumElements() /
18327 VT.getVectorNumElements();
18328 std::vector<SDValue> Vals(Ratio);
18329 for (unsigned i = 0; i != Ratio; ++i)
18330 Vals[i] = Amt.getOperand(i);
18331 for (unsigned i = Ratio; i != Amt.getNumOperands(); i += Ratio) {
18332 for (unsigned j = 0; j != Ratio; ++j)
18333 if (Vals[j] != Amt.getOperand(i + j))
18337 if (SupportedVectorShiftWithBaseAmnt(VT, Subtarget, Op.getOpcode()))
18338 return DAG.getNode(X86OpcV, dl, VT, R, Op.getOperand(1));
18343 static SDValue LowerShift(SDValue Op, const X86Subtarget* Subtarget,
18344 SelectionDAG &DAG) {
18345 MVT VT = Op.getSimpleValueType();
18347 SDValue R = Op.getOperand(0);
18348 SDValue Amt = Op.getOperand(1);
18350 assert(VT.isVector() && "Custom lowering only for vector shifts!");
18351 assert(Subtarget->hasSSE2() && "Only custom lower when we have SSE2!");
18353 if (SDValue V = LowerScalarImmediateShift(Op, DAG, Subtarget))
18356 if (SDValue V = LowerScalarVariableShift(Op, DAG, Subtarget))
18359 if (SupportedVectorVarShift(VT, Subtarget, Op.getOpcode()))
18362 // XOP has 128-bit variable logical/arithmetic shifts.
18363 // +ve/-ve Amt = shift left/right.
18364 if (Subtarget->hasXOP() &&
18365 (VT == MVT::v2i64 || VT == MVT::v4i32 ||
18366 VT == MVT::v8i16 || VT == MVT::v16i8)) {
18367 if (Op.getOpcode() == ISD::SRL || Op.getOpcode() == ISD::SRA) {
18368 SDValue Zero = getZeroVector(VT, Subtarget, DAG, dl);
18369 Amt = DAG.getNode(ISD::SUB, dl, VT, Zero, Amt);
18371 if (Op.getOpcode() == ISD::SHL || Op.getOpcode() == ISD::SRL)
18372 return DAG.getNode(X86ISD::VPSHL, dl, VT, R, Amt);
18373 if (Op.getOpcode() == ISD::SRA)
18374 return DAG.getNode(X86ISD::VPSHA, dl, VT, R, Amt);
18377 // 2i64 vector logical shifts can efficiently avoid scalarization - do the
18378 // shifts per-lane and then shuffle the partial results back together.
18379 if (VT == MVT::v2i64 && Op.getOpcode() != ISD::SRA) {
18380 // Splat the shift amounts so the scalar shifts above will catch it.
18381 SDValue Amt0 = DAG.getVectorShuffle(VT, dl, Amt, Amt, {0, 0});
18382 SDValue Amt1 = DAG.getVectorShuffle(VT, dl, Amt, Amt, {1, 1});
18383 SDValue R0 = DAG.getNode(Op->getOpcode(), dl, VT, R, Amt0);
18384 SDValue R1 = DAG.getNode(Op->getOpcode(), dl, VT, R, Amt1);
18385 return DAG.getVectorShuffle(VT, dl, R0, R1, {0, 3});
18388 // i64 vector arithmetic shift can be emulated with the transform:
18389 // M = lshr(SIGN_BIT, Amt)
18390 // ashr(R, Amt) === sub(xor(lshr(R, Amt), M), M)
18391 if ((VT == MVT::v2i64 || (VT == MVT::v4i64 && Subtarget->hasInt256())) &&
18392 Op.getOpcode() == ISD::SRA) {
18393 SDValue S = DAG.getConstant(APInt::getSignBit(64), dl, VT);
18394 SDValue M = DAG.getNode(ISD::SRL, dl, VT, S, Amt);
18395 R = DAG.getNode(ISD::SRL, dl, VT, R, Amt);
18396 R = DAG.getNode(ISD::XOR, dl, VT, R, M);
18397 R = DAG.getNode(ISD::SUB, dl, VT, R, M);
18401 // If possible, lower this packed shift into a vector multiply instead of
18402 // expanding it into a sequence of scalar shifts.
18403 // Do this only if the vector shift count is a constant build_vector.
18404 if (Op.getOpcode() == ISD::SHL &&
18405 (VT == MVT::v8i16 || VT == MVT::v4i32 ||
18406 (Subtarget->hasInt256() && VT == MVT::v16i16)) &&
18407 ISD::isBuildVectorOfConstantSDNodes(Amt.getNode())) {
18408 SmallVector<SDValue, 8> Elts;
18409 MVT SVT = VT.getVectorElementType();
18410 unsigned SVTBits = SVT.getSizeInBits();
18411 APInt One(SVTBits, 1);
18412 unsigned NumElems = VT.getVectorNumElements();
18414 for (unsigned i=0; i !=NumElems; ++i) {
18415 SDValue Op = Amt->getOperand(i);
18416 if (Op->getOpcode() == ISD::UNDEF) {
18417 Elts.push_back(Op);
18421 ConstantSDNode *ND = cast<ConstantSDNode>(Op);
18422 APInt C(SVTBits, ND->getAPIntValue().getZExtValue());
18423 uint64_t ShAmt = C.getZExtValue();
18424 if (ShAmt >= SVTBits) {
18425 Elts.push_back(DAG.getUNDEF(SVT));
18428 Elts.push_back(DAG.getConstant(One.shl(ShAmt), dl, SVT));
18430 SDValue BV = DAG.getNode(ISD::BUILD_VECTOR, dl, VT, Elts);
18431 return DAG.getNode(ISD::MUL, dl, VT, R, BV);
18434 // Lower SHL with variable shift amount.
18435 if (VT == MVT::v4i32 && Op->getOpcode() == ISD::SHL) {
18436 Op = DAG.getNode(ISD::SHL, dl, VT, Amt, DAG.getConstant(23, dl, VT));
18438 Op = DAG.getNode(ISD::ADD, dl, VT, Op,
18439 DAG.getConstant(0x3f800000U, dl, VT));
18440 Op = DAG.getBitcast(MVT::v4f32, Op);
18441 Op = DAG.getNode(ISD::FP_TO_SINT, dl, VT, Op);
18442 return DAG.getNode(ISD::MUL, dl, VT, Op, R);
18445 // If possible, lower this shift as a sequence of two shifts by
18446 // constant plus a MOVSS/MOVSD instead of scalarizing it.
18448 // (v4i32 (srl A, (build_vector < X, Y, Y, Y>)))
18450 // Could be rewritten as:
18451 // (v4i32 (MOVSS (srl A, <Y,Y,Y,Y>), (srl A, <X,X,X,X>)))
18453 // The advantage is that the two shifts from the example would be
18454 // lowered as X86ISD::VSRLI nodes. This would be cheaper than scalarizing
18455 // the vector shift into four scalar shifts plus four pairs of vector
18457 if ((VT == MVT::v8i16 || VT == MVT::v4i32) &&
18458 ISD::isBuildVectorOfConstantSDNodes(Amt.getNode())) {
18459 unsigned TargetOpcode = X86ISD::MOVSS;
18460 bool CanBeSimplified;
18461 // The splat value for the first packed shift (the 'X' from the example).
18462 SDValue Amt1 = Amt->getOperand(0);
18463 // The splat value for the second packed shift (the 'Y' from the example).
18464 SDValue Amt2 = (VT == MVT::v4i32) ? Amt->getOperand(1) :
18465 Amt->getOperand(2);
18467 // See if it is possible to replace this node with a sequence of
18468 // two shifts followed by a MOVSS/MOVSD
18469 if (VT == MVT::v4i32) {
18470 // Check if it is legal to use a MOVSS.
18471 CanBeSimplified = Amt2 == Amt->getOperand(2) &&
18472 Amt2 == Amt->getOperand(3);
18473 if (!CanBeSimplified) {
18474 // Otherwise, check if we can still simplify this node using a MOVSD.
18475 CanBeSimplified = Amt1 == Amt->getOperand(1) &&
18476 Amt->getOperand(2) == Amt->getOperand(3);
18477 TargetOpcode = X86ISD::MOVSD;
18478 Amt2 = Amt->getOperand(2);
18481 // Do similar checks for the case where the machine value type
18483 CanBeSimplified = Amt1 == Amt->getOperand(1);
18484 for (unsigned i=3; i != 8 && CanBeSimplified; ++i)
18485 CanBeSimplified = Amt2 == Amt->getOperand(i);
18487 if (!CanBeSimplified) {
18488 TargetOpcode = X86ISD::MOVSD;
18489 CanBeSimplified = true;
18490 Amt2 = Amt->getOperand(4);
18491 for (unsigned i=0; i != 4 && CanBeSimplified; ++i)
18492 CanBeSimplified = Amt1 == Amt->getOperand(i);
18493 for (unsigned j=4; j != 8 && CanBeSimplified; ++j)
18494 CanBeSimplified = Amt2 == Amt->getOperand(j);
18498 if (CanBeSimplified && isa<ConstantSDNode>(Amt1) &&
18499 isa<ConstantSDNode>(Amt2)) {
18500 // Replace this node with two shifts followed by a MOVSS/MOVSD.
18501 MVT CastVT = MVT::v4i32;
18503 DAG.getConstant(cast<ConstantSDNode>(Amt1)->getAPIntValue(), dl, VT);
18504 SDValue Shift1 = DAG.getNode(Op->getOpcode(), dl, VT, R, Splat1);
18506 DAG.getConstant(cast<ConstantSDNode>(Amt2)->getAPIntValue(), dl, VT);
18507 SDValue Shift2 = DAG.getNode(Op->getOpcode(), dl, VT, R, Splat2);
18508 if (TargetOpcode == X86ISD::MOVSD)
18509 CastVT = MVT::v2i64;
18510 SDValue BitCast1 = DAG.getBitcast(CastVT, Shift1);
18511 SDValue BitCast2 = DAG.getBitcast(CastVT, Shift2);
18512 SDValue Result = getTargetShuffleNode(TargetOpcode, dl, CastVT, BitCast2,
18514 return DAG.getBitcast(VT, Result);
18518 // v4i32 Non Uniform Shifts.
18519 // If the shift amount is constant we can shift each lane using the SSE2
18520 // immediate shifts, else we need to zero-extend each lane to the lower i64
18521 // and shift using the SSE2 variable shifts.
18522 // The separate results can then be blended together.
18523 if (VT == MVT::v4i32) {
18524 unsigned Opc = Op.getOpcode();
18525 SDValue Amt0, Amt1, Amt2, Amt3;
18526 if (ISD::isBuildVectorOfConstantSDNodes(Amt.getNode())) {
18527 Amt0 = DAG.getVectorShuffle(VT, dl, Amt, DAG.getUNDEF(VT), {0, 0, 0, 0});
18528 Amt1 = DAG.getVectorShuffle(VT, dl, Amt, DAG.getUNDEF(VT), {1, 1, 1, 1});
18529 Amt2 = DAG.getVectorShuffle(VT, dl, Amt, DAG.getUNDEF(VT), {2, 2, 2, 2});
18530 Amt3 = DAG.getVectorShuffle(VT, dl, Amt, DAG.getUNDEF(VT), {3, 3, 3, 3});
18532 // ISD::SHL is handled above but we include it here for completeness.
18535 llvm_unreachable("Unknown target vector shift node");
18537 Opc = X86ISD::VSHL;
18540 Opc = X86ISD::VSRL;
18543 Opc = X86ISD::VSRA;
18546 // The SSE2 shifts use the lower i64 as the same shift amount for
18547 // all lanes and the upper i64 is ignored. These shuffle masks
18548 // optimally zero-extend each lanes on SSE2/SSE41/AVX targets.
18549 SDValue Z = getZeroVector(VT, Subtarget, DAG, dl);
18550 Amt0 = DAG.getVectorShuffle(VT, dl, Amt, Z, {0, 4, -1, -1});
18551 Amt1 = DAG.getVectorShuffle(VT, dl, Amt, Z, {1, 5, -1, -1});
18552 Amt2 = DAG.getVectorShuffle(VT, dl, Amt, Z, {2, 6, -1, -1});
18553 Amt3 = DAG.getVectorShuffle(VT, dl, Amt, Z, {3, 7, -1, -1});
18556 SDValue R0 = DAG.getNode(Opc, dl, VT, R, Amt0);
18557 SDValue R1 = DAG.getNode(Opc, dl, VT, R, Amt1);
18558 SDValue R2 = DAG.getNode(Opc, dl, VT, R, Amt2);
18559 SDValue R3 = DAG.getNode(Opc, dl, VT, R, Amt3);
18560 SDValue R02 = DAG.getVectorShuffle(VT, dl, R0, R2, {0, -1, 6, -1});
18561 SDValue R13 = DAG.getVectorShuffle(VT, dl, R1, R3, {-1, 1, -1, 7});
18562 return DAG.getVectorShuffle(VT, dl, R02, R13, {0, 5, 2, 7});
18565 if (VT == MVT::v16i8 ||
18566 (VT == MVT::v32i8 && Subtarget->hasInt256() && !Subtarget->hasXOP())) {
18567 MVT ExtVT = MVT::getVectorVT(MVT::i16, VT.getVectorNumElements() / 2);
18568 unsigned ShiftOpcode = Op->getOpcode();
18570 auto SignBitSelect = [&](MVT SelVT, SDValue Sel, SDValue V0, SDValue V1) {
18571 // On SSE41 targets we make use of the fact that VSELECT lowers
18572 // to PBLENDVB which selects bytes based just on the sign bit.
18573 if (Subtarget->hasSSE41()) {
18574 V0 = DAG.getBitcast(VT, V0);
18575 V1 = DAG.getBitcast(VT, V1);
18576 Sel = DAG.getBitcast(VT, Sel);
18577 return DAG.getBitcast(SelVT,
18578 DAG.getNode(ISD::VSELECT, dl, VT, Sel, V0, V1));
18580 // On pre-SSE41 targets we test for the sign bit by comparing to
18581 // zero - a negative value will set all bits of the lanes to true
18582 // and VSELECT uses that in its OR(AND(V0,C),AND(V1,~C)) lowering.
18583 SDValue Z = getZeroVector(SelVT, Subtarget, DAG, dl);
18584 SDValue C = DAG.getNode(X86ISD::PCMPGT, dl, SelVT, Z, Sel);
18585 return DAG.getNode(ISD::VSELECT, dl, SelVT, C, V0, V1);
18588 // Turn 'a' into a mask suitable for VSELECT: a = a << 5;
18589 // We can safely do this using i16 shifts as we're only interested in
18590 // the 3 lower bits of each byte.
18591 Amt = DAG.getBitcast(ExtVT, Amt);
18592 Amt = DAG.getNode(ISD::SHL, dl, ExtVT, Amt, DAG.getConstant(5, dl, ExtVT));
18593 Amt = DAG.getBitcast(VT, Amt);
18595 if (Op->getOpcode() == ISD::SHL || Op->getOpcode() == ISD::SRL) {
18596 // r = VSELECT(r, shift(r, 4), a);
18598 DAG.getNode(ShiftOpcode, dl, VT, R, DAG.getConstant(4, dl, VT));
18599 R = SignBitSelect(VT, Amt, M, R);
18602 Amt = DAG.getNode(ISD::ADD, dl, VT, Amt, Amt);
18604 // r = VSELECT(r, shift(r, 2), a);
18605 M = DAG.getNode(ShiftOpcode, dl, VT, R, DAG.getConstant(2, dl, VT));
18606 R = SignBitSelect(VT, Amt, M, R);
18609 Amt = DAG.getNode(ISD::ADD, dl, VT, Amt, Amt);
18611 // return VSELECT(r, shift(r, 1), a);
18612 M = DAG.getNode(ShiftOpcode, dl, VT, R, DAG.getConstant(1, dl, VT));
18613 R = SignBitSelect(VT, Amt, M, R);
18617 if (Op->getOpcode() == ISD::SRA) {
18618 // For SRA we need to unpack each byte to the higher byte of a i16 vector
18619 // so we can correctly sign extend. We don't care what happens to the
18621 SDValue ALo = DAG.getNode(X86ISD::UNPCKL, dl, VT, DAG.getUNDEF(VT), Amt);
18622 SDValue AHi = DAG.getNode(X86ISD::UNPCKH, dl, VT, DAG.getUNDEF(VT), Amt);
18623 SDValue RLo = DAG.getNode(X86ISD::UNPCKL, dl, VT, DAG.getUNDEF(VT), R);
18624 SDValue RHi = DAG.getNode(X86ISD::UNPCKH, dl, VT, DAG.getUNDEF(VT), R);
18625 ALo = DAG.getBitcast(ExtVT, ALo);
18626 AHi = DAG.getBitcast(ExtVT, AHi);
18627 RLo = DAG.getBitcast(ExtVT, RLo);
18628 RHi = DAG.getBitcast(ExtVT, RHi);
18630 // r = VSELECT(r, shift(r, 4), a);
18631 SDValue MLo = DAG.getNode(ShiftOpcode, dl, ExtVT, RLo,
18632 DAG.getConstant(4, dl, ExtVT));
18633 SDValue MHi = DAG.getNode(ShiftOpcode, dl, ExtVT, RHi,
18634 DAG.getConstant(4, dl, ExtVT));
18635 RLo = SignBitSelect(ExtVT, ALo, MLo, RLo);
18636 RHi = SignBitSelect(ExtVT, AHi, MHi, RHi);
18639 ALo = DAG.getNode(ISD::ADD, dl, ExtVT, ALo, ALo);
18640 AHi = DAG.getNode(ISD::ADD, dl, ExtVT, AHi, AHi);
18642 // r = VSELECT(r, shift(r, 2), a);
18643 MLo = DAG.getNode(ShiftOpcode, dl, ExtVT, RLo,
18644 DAG.getConstant(2, dl, ExtVT));
18645 MHi = DAG.getNode(ShiftOpcode, dl, ExtVT, RHi,
18646 DAG.getConstant(2, dl, ExtVT));
18647 RLo = SignBitSelect(ExtVT, ALo, MLo, RLo);
18648 RHi = SignBitSelect(ExtVT, AHi, MHi, RHi);
18651 ALo = DAG.getNode(ISD::ADD, dl, ExtVT, ALo, ALo);
18652 AHi = DAG.getNode(ISD::ADD, dl, ExtVT, AHi, AHi);
18654 // r = VSELECT(r, shift(r, 1), a);
18655 MLo = DAG.getNode(ShiftOpcode, dl, ExtVT, RLo,
18656 DAG.getConstant(1, dl, ExtVT));
18657 MHi = DAG.getNode(ShiftOpcode, dl, ExtVT, RHi,
18658 DAG.getConstant(1, dl, ExtVT));
18659 RLo = SignBitSelect(ExtVT, ALo, MLo, RLo);
18660 RHi = SignBitSelect(ExtVT, AHi, MHi, RHi);
18662 // Logical shift the result back to the lower byte, leaving a zero upper
18664 // meaning that we can safely pack with PACKUSWB.
18666 DAG.getNode(ISD::SRL, dl, ExtVT, RLo, DAG.getConstant(8, dl, ExtVT));
18668 DAG.getNode(ISD::SRL, dl, ExtVT, RHi, DAG.getConstant(8, dl, ExtVT));
18669 return DAG.getNode(X86ISD::PACKUS, dl, VT, RLo, RHi);
18673 // It's worth extending once and using the v8i32 shifts for 16-bit types, but
18674 // the extra overheads to get from v16i8 to v8i32 make the existing SSE
18675 // solution better.
18676 if (Subtarget->hasInt256() && VT == MVT::v8i16) {
18677 MVT ExtVT = MVT::v8i32;
18679 Op.getOpcode() == ISD::SRA ? ISD::SIGN_EXTEND : ISD::ZERO_EXTEND;
18680 R = DAG.getNode(ExtOpc, dl, ExtVT, R);
18681 Amt = DAG.getNode(ISD::ANY_EXTEND, dl, ExtVT, Amt);
18682 return DAG.getNode(ISD::TRUNCATE, dl, VT,
18683 DAG.getNode(Op.getOpcode(), dl, ExtVT, R, Amt));
18686 if (Subtarget->hasInt256() && !Subtarget->hasXOP() && VT == MVT::v16i16) {
18687 MVT ExtVT = MVT::v8i32;
18688 SDValue Z = getZeroVector(VT, Subtarget, DAG, dl);
18689 SDValue ALo = DAG.getNode(X86ISD::UNPCKL, dl, VT, Amt, Z);
18690 SDValue AHi = DAG.getNode(X86ISD::UNPCKH, dl, VT, Amt, Z);
18691 SDValue RLo = DAG.getNode(X86ISD::UNPCKL, dl, VT, R, R);
18692 SDValue RHi = DAG.getNode(X86ISD::UNPCKH, dl, VT, R, R);
18693 ALo = DAG.getBitcast(ExtVT, ALo);
18694 AHi = DAG.getBitcast(ExtVT, AHi);
18695 RLo = DAG.getBitcast(ExtVT, RLo);
18696 RHi = DAG.getBitcast(ExtVT, RHi);
18697 SDValue Lo = DAG.getNode(Op.getOpcode(), dl, ExtVT, RLo, ALo);
18698 SDValue Hi = DAG.getNode(Op.getOpcode(), dl, ExtVT, RHi, AHi);
18699 Lo = DAG.getNode(ISD::SRL, dl, ExtVT, Lo, DAG.getConstant(16, dl, ExtVT));
18700 Hi = DAG.getNode(ISD::SRL, dl, ExtVT, Hi, DAG.getConstant(16, dl, ExtVT));
18701 return DAG.getNode(X86ISD::PACKUS, dl, VT, Lo, Hi);
18704 if (VT == MVT::v8i16) {
18705 unsigned ShiftOpcode = Op->getOpcode();
18707 auto SignBitSelect = [&](SDValue Sel, SDValue V0, SDValue V1) {
18708 // On SSE41 targets we make use of the fact that VSELECT lowers
18709 // to PBLENDVB which selects bytes based just on the sign bit.
18710 if (Subtarget->hasSSE41()) {
18711 MVT ExtVT = MVT::getVectorVT(MVT::i8, VT.getVectorNumElements() * 2);
18712 V0 = DAG.getBitcast(ExtVT, V0);
18713 V1 = DAG.getBitcast(ExtVT, V1);
18714 Sel = DAG.getBitcast(ExtVT, Sel);
18715 return DAG.getBitcast(
18716 VT, DAG.getNode(ISD::VSELECT, dl, ExtVT, Sel, V0, V1));
18718 // On pre-SSE41 targets we splat the sign bit - a negative value will
18719 // set all bits of the lanes to true and VSELECT uses that in
18720 // its OR(AND(V0,C),AND(V1,~C)) lowering.
18722 DAG.getNode(ISD::SRA, dl, VT, Sel, DAG.getConstant(15, dl, VT));
18723 return DAG.getNode(ISD::VSELECT, dl, VT, C, V0, V1);
18726 // Turn 'a' into a mask suitable for VSELECT: a = a << 12;
18727 if (Subtarget->hasSSE41()) {
18728 // On SSE41 targets we need to replicate the shift mask in both
18729 // bytes for PBLENDVB.
18732 DAG.getNode(ISD::SHL, dl, VT, Amt, DAG.getConstant(4, dl, VT)),
18733 DAG.getNode(ISD::SHL, dl, VT, Amt, DAG.getConstant(12, dl, VT)));
18735 Amt = DAG.getNode(ISD::SHL, dl, VT, Amt, DAG.getConstant(12, dl, VT));
18738 // r = VSELECT(r, shift(r, 8), a);
18739 SDValue M = DAG.getNode(ShiftOpcode, dl, VT, R, DAG.getConstant(8, dl, VT));
18740 R = SignBitSelect(Amt, M, R);
18743 Amt = DAG.getNode(ISD::ADD, dl, VT, Amt, Amt);
18745 // r = VSELECT(r, shift(r, 4), a);
18746 M = DAG.getNode(ShiftOpcode, dl, VT, R, DAG.getConstant(4, dl, VT));
18747 R = SignBitSelect(Amt, M, R);
18750 Amt = DAG.getNode(ISD::ADD, dl, VT, Amt, Amt);
18752 // r = VSELECT(r, shift(r, 2), a);
18753 M = DAG.getNode(ShiftOpcode, dl, VT, R, DAG.getConstant(2, dl, VT));
18754 R = SignBitSelect(Amt, M, R);
18757 Amt = DAG.getNode(ISD::ADD, dl, VT, Amt, Amt);
18759 // return VSELECT(r, shift(r, 1), a);
18760 M = DAG.getNode(ShiftOpcode, dl, VT, R, DAG.getConstant(1, dl, VT));
18761 R = SignBitSelect(Amt, M, R);
18765 // Decompose 256-bit shifts into smaller 128-bit shifts.
18766 if (VT.is256BitVector()) {
18767 unsigned NumElems = VT.getVectorNumElements();
18768 MVT EltVT = VT.getVectorElementType();
18769 MVT NewVT = MVT::getVectorVT(EltVT, NumElems/2);
18771 // Extract the two vectors
18772 SDValue V1 = Extract128BitVector(R, 0, DAG, dl);
18773 SDValue V2 = Extract128BitVector(R, NumElems/2, DAG, dl);
18775 // Recreate the shift amount vectors
18776 SDValue Amt1, Amt2;
18777 if (Amt.getOpcode() == ISD::BUILD_VECTOR) {
18778 // Constant shift amount
18779 SmallVector<SDValue, 8> Ops(Amt->op_begin(), Amt->op_begin() + NumElems);
18780 ArrayRef<SDValue> Amt1Csts = makeArrayRef(Ops).slice(0, NumElems / 2);
18781 ArrayRef<SDValue> Amt2Csts = makeArrayRef(Ops).slice(NumElems / 2);
18783 Amt1 = DAG.getNode(ISD::BUILD_VECTOR, dl, NewVT, Amt1Csts);
18784 Amt2 = DAG.getNode(ISD::BUILD_VECTOR, dl, NewVT, Amt2Csts);
18786 // Variable shift amount
18787 Amt1 = Extract128BitVector(Amt, 0, DAG, dl);
18788 Amt2 = Extract128BitVector(Amt, NumElems/2, DAG, dl);
18791 // Issue new vector shifts for the smaller types
18792 V1 = DAG.getNode(Op.getOpcode(), dl, NewVT, V1, Amt1);
18793 V2 = DAG.getNode(Op.getOpcode(), dl, NewVT, V2, Amt2);
18795 // Concatenate the result back
18796 return DAG.getNode(ISD::CONCAT_VECTORS, dl, VT, V1, V2);
18802 static SDValue LowerRotate(SDValue Op, const X86Subtarget *Subtarget,
18803 SelectionDAG &DAG) {
18804 MVT VT = Op.getSimpleValueType();
18806 SDValue R = Op.getOperand(0);
18807 SDValue Amt = Op.getOperand(1);
18809 assert(VT.isVector() && "Custom lowering only for vector rotates!");
18810 assert(Subtarget->hasXOP() && "XOP support required for vector rotates!");
18811 assert((Op.getOpcode() == ISD::ROTL) && "Only ROTL supported");
18813 // XOP has 128-bit vector variable + immediate rotates.
18814 // +ve/-ve Amt = rotate left/right.
18816 // Split 256-bit integers.
18817 if (VT.is256BitVector())
18818 return Lower256IntArith(Op, DAG);
18820 assert(VT.is128BitVector() && "Only rotate 128-bit vectors!");
18822 // Attempt to rotate by immediate.
18823 if (auto *BVAmt = dyn_cast<BuildVectorSDNode>(Amt)) {
18824 if (auto *RotateConst = BVAmt->getConstantSplatNode()) {
18825 uint64_t RotateAmt = RotateConst->getAPIntValue().getZExtValue();
18826 assert(RotateAmt < VT.getScalarSizeInBits() && "Rotation out of range");
18827 return DAG.getNode(X86ISD::VPROTI, DL, VT, R,
18828 DAG.getConstant(RotateAmt, DL, MVT::i8));
18832 // Use general rotate by variable (per-element).
18833 return DAG.getNode(X86ISD::VPROT, DL, VT, R, Amt);
18836 static SDValue LowerXALUO(SDValue Op, SelectionDAG &DAG) {
18837 // Lower the "add/sub/mul with overflow" instruction into a regular ins plus
18838 // a "setcc" instruction that checks the overflow flag. The "brcond" lowering
18839 // looks for this combo and may remove the "setcc" instruction if the "setcc"
18840 // has only one use.
18841 SDNode *N = Op.getNode();
18842 SDValue LHS = N->getOperand(0);
18843 SDValue RHS = N->getOperand(1);
18844 unsigned BaseOp = 0;
18847 switch (Op.getOpcode()) {
18848 default: llvm_unreachable("Unknown ovf instruction!");
18850 // A subtract of one will be selected as a INC. Note that INC doesn't
18851 // set CF, so we can't do this for UADDO.
18852 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(RHS))
18854 BaseOp = X86ISD::INC;
18855 Cond = X86::COND_O;
18858 BaseOp = X86ISD::ADD;
18859 Cond = X86::COND_O;
18862 BaseOp = X86ISD::ADD;
18863 Cond = X86::COND_B;
18866 // A subtract of one will be selected as a DEC. Note that DEC doesn't
18867 // set CF, so we can't do this for USUBO.
18868 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(RHS))
18870 BaseOp = X86ISD::DEC;
18871 Cond = X86::COND_O;
18874 BaseOp = X86ISD::SUB;
18875 Cond = X86::COND_O;
18878 BaseOp = X86ISD::SUB;
18879 Cond = X86::COND_B;
18882 BaseOp = N->getValueType(0) == MVT::i8 ? X86ISD::SMUL8 : X86ISD::SMUL;
18883 Cond = X86::COND_O;
18885 case ISD::UMULO: { // i64, i8 = umulo lhs, rhs --> i64, i64, i32 umul lhs,rhs
18886 if (N->getValueType(0) == MVT::i8) {
18887 BaseOp = X86ISD::UMUL8;
18888 Cond = X86::COND_O;
18891 SDVTList VTs = DAG.getVTList(N->getValueType(0), N->getValueType(0),
18893 SDValue Sum = DAG.getNode(X86ISD::UMUL, DL, VTs, LHS, RHS);
18896 DAG.getNode(X86ISD::SETCC, DL, MVT::i8,
18897 DAG.getConstant(X86::COND_O, DL, MVT::i32),
18898 SDValue(Sum.getNode(), 2));
18900 return DAG.getNode(ISD::MERGE_VALUES, DL, N->getVTList(), Sum, SetCC);
18904 // Also sets EFLAGS.
18905 SDVTList VTs = DAG.getVTList(N->getValueType(0), MVT::i32);
18906 SDValue Sum = DAG.getNode(BaseOp, DL, VTs, LHS, RHS);
18909 DAG.getNode(X86ISD::SETCC, DL, N->getValueType(1),
18910 DAG.getConstant(Cond, DL, MVT::i32),
18911 SDValue(Sum.getNode(), 1));
18913 return DAG.getNode(ISD::MERGE_VALUES, DL, N->getVTList(), Sum, SetCC);
18916 /// Returns true if the operand type is exactly twice the native width, and
18917 /// the corresponding cmpxchg8b or cmpxchg16b instruction is available.
18918 /// Used to know whether to use cmpxchg8/16b when expanding atomic operations
18919 /// (otherwise we leave them alone to become __sync_fetch_and_... calls).
18920 bool X86TargetLowering::needsCmpXchgNb(Type *MemType) const {
18921 unsigned OpWidth = MemType->getPrimitiveSizeInBits();
18924 return !Subtarget->is64Bit(); // FIXME this should be Subtarget.hasCmpxchg8b
18925 else if (OpWidth == 128)
18926 return Subtarget->hasCmpxchg16b();
18931 bool X86TargetLowering::shouldExpandAtomicStoreInIR(StoreInst *SI) const {
18932 return needsCmpXchgNb(SI->getValueOperand()->getType());
18935 // Note: this turns large loads into lock cmpxchg8b/16b.
18936 // FIXME: On 32 bits x86, fild/movq might be faster than lock cmpxchg8b.
18937 TargetLowering::AtomicExpansionKind
18938 X86TargetLowering::shouldExpandAtomicLoadInIR(LoadInst *LI) const {
18939 auto PTy = cast<PointerType>(LI->getPointerOperand()->getType());
18940 return needsCmpXchgNb(PTy->getElementType()) ? AtomicExpansionKind::CmpXChg
18941 : AtomicExpansionKind::None;
18944 TargetLowering::AtomicExpansionKind
18945 X86TargetLowering::shouldExpandAtomicRMWInIR(AtomicRMWInst *AI) const {
18946 unsigned NativeWidth = Subtarget->is64Bit() ? 64 : 32;
18947 Type *MemType = AI->getType();
18949 // If the operand is too big, we must see if cmpxchg8/16b is available
18950 // and default to library calls otherwise.
18951 if (MemType->getPrimitiveSizeInBits() > NativeWidth) {
18952 return needsCmpXchgNb(MemType) ? AtomicExpansionKind::CmpXChg
18953 : AtomicExpansionKind::None;
18956 AtomicRMWInst::BinOp Op = AI->getOperation();
18959 llvm_unreachable("Unknown atomic operation");
18960 case AtomicRMWInst::Xchg:
18961 case AtomicRMWInst::Add:
18962 case AtomicRMWInst::Sub:
18963 // It's better to use xadd, xsub or xchg for these in all cases.
18964 return AtomicExpansionKind::None;
18965 case AtomicRMWInst::Or:
18966 case AtomicRMWInst::And:
18967 case AtomicRMWInst::Xor:
18968 // If the atomicrmw's result isn't actually used, we can just add a "lock"
18969 // prefix to a normal instruction for these operations.
18970 return !AI->use_empty() ? AtomicExpansionKind::CmpXChg
18971 : AtomicExpansionKind::None;
18972 case AtomicRMWInst::Nand:
18973 case AtomicRMWInst::Max:
18974 case AtomicRMWInst::Min:
18975 case AtomicRMWInst::UMax:
18976 case AtomicRMWInst::UMin:
18977 // These always require a non-trivial set of data operations on x86. We must
18978 // use a cmpxchg loop.
18979 return AtomicExpansionKind::CmpXChg;
18983 static bool hasMFENCE(const X86Subtarget& Subtarget) {
18984 // Use mfence if we have SSE2 or we're on x86-64 (even if we asked for
18985 // no-sse2). There isn't any reason to disable it if the target processor
18987 return Subtarget.hasSSE2() || Subtarget.is64Bit();
18991 X86TargetLowering::lowerIdempotentRMWIntoFencedLoad(AtomicRMWInst *AI) const {
18992 unsigned NativeWidth = Subtarget->is64Bit() ? 64 : 32;
18993 Type *MemType = AI->getType();
18994 // Accesses larger than the native width are turned into cmpxchg/libcalls, so
18995 // there is no benefit in turning such RMWs into loads, and it is actually
18996 // harmful as it introduces a mfence.
18997 if (MemType->getPrimitiveSizeInBits() > NativeWidth)
19000 auto Builder = IRBuilder<>(AI);
19001 Module *M = Builder.GetInsertBlock()->getParent()->getParent();
19002 auto SynchScope = AI->getSynchScope();
19003 // We must restrict the ordering to avoid generating loads with Release or
19004 // ReleaseAcquire orderings.
19005 auto Order = AtomicCmpXchgInst::getStrongestFailureOrdering(AI->getOrdering());
19006 auto Ptr = AI->getPointerOperand();
19008 // Before the load we need a fence. Here is an example lifted from
19009 // http://www.hpl.hp.com/techreports/2012/HPL-2012-68.pdf showing why a fence
19012 // x.store(1, relaxed);
19013 // r1 = y.fetch_add(0, release);
19015 // y.fetch_add(42, acquire);
19016 // r2 = x.load(relaxed);
19017 // r1 = r2 = 0 is impossible, but becomes possible if the idempotent rmw is
19018 // lowered to just a load without a fence. A mfence flushes the store buffer,
19019 // making the optimization clearly correct.
19020 // FIXME: it is required if isAtLeastRelease(Order) but it is not clear
19021 // otherwise, we might be able to be more aggressive on relaxed idempotent
19022 // rmw. In practice, they do not look useful, so we don't try to be
19023 // especially clever.
19024 if (SynchScope == SingleThread)
19025 // FIXME: we could just insert an X86ISD::MEMBARRIER here, except we are at
19026 // the IR level, so we must wrap it in an intrinsic.
19029 if (!hasMFENCE(*Subtarget))
19030 // FIXME: it might make sense to use a locked operation here but on a
19031 // different cache-line to prevent cache-line bouncing. In practice it
19032 // is probably a small win, and x86 processors without mfence are rare
19033 // enough that we do not bother.
19037 llvm::Intrinsic::getDeclaration(M, Intrinsic::x86_sse2_mfence);
19038 Builder.CreateCall(MFence, {});
19040 // Finally we can emit the atomic load.
19041 LoadInst *Loaded = Builder.CreateAlignedLoad(Ptr,
19042 AI->getType()->getPrimitiveSizeInBits());
19043 Loaded->setAtomic(Order, SynchScope);
19044 AI->replaceAllUsesWith(Loaded);
19045 AI->eraseFromParent();
19049 static SDValue LowerATOMIC_FENCE(SDValue Op, const X86Subtarget *Subtarget,
19050 SelectionDAG &DAG) {
19052 AtomicOrdering FenceOrdering = static_cast<AtomicOrdering>(
19053 cast<ConstantSDNode>(Op.getOperand(1))->getZExtValue());
19054 SynchronizationScope FenceScope = static_cast<SynchronizationScope>(
19055 cast<ConstantSDNode>(Op.getOperand(2))->getZExtValue());
19057 // The only fence that needs an instruction is a sequentially-consistent
19058 // cross-thread fence.
19059 if (FenceOrdering == SequentiallyConsistent && FenceScope == CrossThread) {
19060 if (hasMFENCE(*Subtarget))
19061 return DAG.getNode(X86ISD::MFENCE, dl, MVT::Other, Op.getOperand(0));
19063 SDValue Chain = Op.getOperand(0);
19064 SDValue Zero = DAG.getConstant(0, dl, MVT::i32);
19066 DAG.getRegister(X86::ESP, MVT::i32), // Base
19067 DAG.getTargetConstant(1, dl, MVT::i8), // Scale
19068 DAG.getRegister(0, MVT::i32), // Index
19069 DAG.getTargetConstant(0, dl, MVT::i32), // Disp
19070 DAG.getRegister(0, MVT::i32), // Segment.
19074 SDNode *Res = DAG.getMachineNode(X86::OR32mrLocked, dl, MVT::Other, Ops);
19075 return SDValue(Res, 0);
19078 // MEMBARRIER is a compiler barrier; it codegens to a no-op.
19079 return DAG.getNode(X86ISD::MEMBARRIER, dl, MVT::Other, Op.getOperand(0));
19082 static SDValue LowerCMP_SWAP(SDValue Op, const X86Subtarget *Subtarget,
19083 SelectionDAG &DAG) {
19084 MVT T = Op.getSimpleValueType();
19088 switch(T.SimpleTy) {
19089 default: llvm_unreachable("Invalid value type!");
19090 case MVT::i8: Reg = X86::AL; size = 1; break;
19091 case MVT::i16: Reg = X86::AX; size = 2; break;
19092 case MVT::i32: Reg = X86::EAX; size = 4; break;
19094 assert(Subtarget->is64Bit() && "Node not type legal!");
19095 Reg = X86::RAX; size = 8;
19098 SDValue cpIn = DAG.getCopyToReg(Op.getOperand(0), DL, Reg,
19099 Op.getOperand(2), SDValue());
19100 SDValue Ops[] = { cpIn.getValue(0),
19103 DAG.getTargetConstant(size, DL, MVT::i8),
19104 cpIn.getValue(1) };
19105 SDVTList Tys = DAG.getVTList(MVT::Other, MVT::Glue);
19106 MachineMemOperand *MMO = cast<AtomicSDNode>(Op)->getMemOperand();
19107 SDValue Result = DAG.getMemIntrinsicNode(X86ISD::LCMPXCHG_DAG, DL, Tys,
19111 DAG.getCopyFromReg(Result.getValue(0), DL, Reg, T, Result.getValue(1));
19112 SDValue EFLAGS = DAG.getCopyFromReg(cpOut.getValue(1), DL, X86::EFLAGS,
19113 MVT::i32, cpOut.getValue(2));
19114 SDValue Success = DAG.getNode(X86ISD::SETCC, DL, Op->getValueType(1),
19115 DAG.getConstant(X86::COND_E, DL, MVT::i8),
19118 DAG.ReplaceAllUsesOfValueWith(Op.getValue(0), cpOut);
19119 DAG.ReplaceAllUsesOfValueWith(Op.getValue(1), Success);
19120 DAG.ReplaceAllUsesOfValueWith(Op.getValue(2), EFLAGS.getValue(1));
19124 static SDValue LowerBITCAST(SDValue Op, const X86Subtarget *Subtarget,
19125 SelectionDAG &DAG) {
19126 MVT SrcVT = Op.getOperand(0).getSimpleValueType();
19127 MVT DstVT = Op.getSimpleValueType();
19129 if (SrcVT == MVT::v2i32 || SrcVT == MVT::v4i16 || SrcVT == MVT::v8i8) {
19130 assert(Subtarget->hasSSE2() && "Requires at least SSE2!");
19131 if (DstVT != MVT::f64)
19132 // This conversion needs to be expanded.
19135 SDValue InVec = Op->getOperand(0);
19137 unsigned NumElts = SrcVT.getVectorNumElements();
19138 MVT SVT = SrcVT.getVectorElementType();
19140 // Widen the vector in input in the case of MVT::v2i32.
19141 // Example: from MVT::v2i32 to MVT::v4i32.
19142 SmallVector<SDValue, 16> Elts;
19143 for (unsigned i = 0, e = NumElts; i != e; ++i)
19144 Elts.push_back(DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, SVT, InVec,
19145 DAG.getIntPtrConstant(i, dl)));
19147 // Explicitly mark the extra elements as Undef.
19148 Elts.append(NumElts, DAG.getUNDEF(SVT));
19150 EVT NewVT = EVT::getVectorVT(*DAG.getContext(), SVT, NumElts * 2);
19151 SDValue BV = DAG.getNode(ISD::BUILD_VECTOR, dl, NewVT, Elts);
19152 SDValue ToV2F64 = DAG.getBitcast(MVT::v2f64, BV);
19153 return DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::f64, ToV2F64,
19154 DAG.getIntPtrConstant(0, dl));
19157 assert(Subtarget->is64Bit() && !Subtarget->hasSSE2() &&
19158 Subtarget->hasMMX() && "Unexpected custom BITCAST");
19159 assert((DstVT == MVT::i64 ||
19160 (DstVT.isVector() && DstVT.getSizeInBits()==64)) &&
19161 "Unexpected custom BITCAST");
19162 // i64 <=> MMX conversions are Legal.
19163 if (SrcVT==MVT::i64 && DstVT.isVector())
19165 if (DstVT==MVT::i64 && SrcVT.isVector())
19167 // MMX <=> MMX conversions are Legal.
19168 if (SrcVT.isVector() && DstVT.isVector())
19170 // All other conversions need to be expanded.
19174 /// Compute the horizontal sum of bytes in V for the elements of VT.
19176 /// Requires V to be a byte vector and VT to be an integer vector type with
19177 /// wider elements than V's type. The width of the elements of VT determines
19178 /// how many bytes of V are summed horizontally to produce each element of the
19180 static SDValue LowerHorizontalByteSum(SDValue V, MVT VT,
19181 const X86Subtarget *Subtarget,
19182 SelectionDAG &DAG) {
19184 MVT ByteVecVT = V.getSimpleValueType();
19185 MVT EltVT = VT.getVectorElementType();
19186 int NumElts = VT.getVectorNumElements();
19187 assert(ByteVecVT.getVectorElementType() == MVT::i8 &&
19188 "Expected value to have byte element type.");
19189 assert(EltVT != MVT::i8 &&
19190 "Horizontal byte sum only makes sense for wider elements!");
19191 unsigned VecSize = VT.getSizeInBits();
19192 assert(ByteVecVT.getSizeInBits() == VecSize && "Cannot change vector size!");
19194 // PSADBW instruction horizontally add all bytes and leave the result in i64
19195 // chunks, thus directly computes the pop count for v2i64 and v4i64.
19196 if (EltVT == MVT::i64) {
19197 SDValue Zeros = getZeroVector(ByteVecVT, Subtarget, DAG, DL);
19198 V = DAG.getNode(X86ISD::PSADBW, DL, ByteVecVT, V, Zeros);
19199 return DAG.getBitcast(VT, V);
19202 if (EltVT == MVT::i32) {
19203 // We unpack the low half and high half into i32s interleaved with zeros so
19204 // that we can use PSADBW to horizontally sum them. The most useful part of
19205 // this is that it lines up the results of two PSADBW instructions to be
19206 // two v2i64 vectors which concatenated are the 4 population counts. We can
19207 // then use PACKUSWB to shrink and concatenate them into a v4i32 again.
19208 SDValue Zeros = getZeroVector(VT, Subtarget, DAG, DL);
19209 SDValue Low = DAG.getNode(X86ISD::UNPCKL, DL, VT, V, Zeros);
19210 SDValue High = DAG.getNode(X86ISD::UNPCKH, DL, VT, V, Zeros);
19212 // Do the horizontal sums into two v2i64s.
19213 Zeros = getZeroVector(ByteVecVT, Subtarget, DAG, DL);
19214 Low = DAG.getNode(X86ISD::PSADBW, DL, ByteVecVT,
19215 DAG.getBitcast(ByteVecVT, Low), Zeros);
19216 High = DAG.getNode(X86ISD::PSADBW, DL, ByteVecVT,
19217 DAG.getBitcast(ByteVecVT, High), Zeros);
19219 // Merge them together.
19220 MVT ShortVecVT = MVT::getVectorVT(MVT::i16, VecSize / 16);
19221 V = DAG.getNode(X86ISD::PACKUS, DL, ByteVecVT,
19222 DAG.getBitcast(ShortVecVT, Low),
19223 DAG.getBitcast(ShortVecVT, High));
19225 return DAG.getBitcast(VT, V);
19228 // The only element type left is i16.
19229 assert(EltVT == MVT::i16 && "Unknown how to handle type");
19231 // To obtain pop count for each i16 element starting from the pop count for
19232 // i8 elements, shift the i16s left by 8, sum as i8s, and then shift as i16s
19233 // right by 8. It is important to shift as i16s as i8 vector shift isn't
19234 // directly supported.
19235 SmallVector<SDValue, 16> Shifters(NumElts, DAG.getConstant(8, DL, EltVT));
19236 SDValue Shifter = DAG.getNode(ISD::BUILD_VECTOR, DL, VT, Shifters);
19237 SDValue Shl = DAG.getNode(ISD::SHL, DL, VT, DAG.getBitcast(VT, V), Shifter);
19238 V = DAG.getNode(ISD::ADD, DL, ByteVecVT, DAG.getBitcast(ByteVecVT, Shl),
19239 DAG.getBitcast(ByteVecVT, V));
19240 return DAG.getNode(ISD::SRL, DL, VT, DAG.getBitcast(VT, V), Shifter);
19243 static SDValue LowerVectorCTPOPInRegLUT(SDValue Op, SDLoc DL,
19244 const X86Subtarget *Subtarget,
19245 SelectionDAG &DAG) {
19246 MVT VT = Op.getSimpleValueType();
19247 MVT EltVT = VT.getVectorElementType();
19248 unsigned VecSize = VT.getSizeInBits();
19250 // Implement a lookup table in register by using an algorithm based on:
19251 // http://wm.ite.pl/articles/sse-popcount.html
19253 // The general idea is that every lower byte nibble in the input vector is an
19254 // index into a in-register pre-computed pop count table. We then split up the
19255 // input vector in two new ones: (1) a vector with only the shifted-right
19256 // higher nibbles for each byte and (2) a vector with the lower nibbles (and
19257 // masked out higher ones) for each byte. PSHUB is used separately with both
19258 // to index the in-register table. Next, both are added and the result is a
19259 // i8 vector where each element contains the pop count for input byte.
19261 // To obtain the pop count for elements != i8, we follow up with the same
19262 // approach and use additional tricks as described below.
19264 const int LUT[16] = {/* 0 */ 0, /* 1 */ 1, /* 2 */ 1, /* 3 */ 2,
19265 /* 4 */ 1, /* 5 */ 2, /* 6 */ 2, /* 7 */ 3,
19266 /* 8 */ 1, /* 9 */ 2, /* a */ 2, /* b */ 3,
19267 /* c */ 2, /* d */ 3, /* e */ 3, /* f */ 4};
19269 int NumByteElts = VecSize / 8;
19270 MVT ByteVecVT = MVT::getVectorVT(MVT::i8, NumByteElts);
19271 SDValue In = DAG.getBitcast(ByteVecVT, Op);
19272 SmallVector<SDValue, 16> LUTVec;
19273 for (int i = 0; i < NumByteElts; ++i)
19274 LUTVec.push_back(DAG.getConstant(LUT[i % 16], DL, MVT::i8));
19275 SDValue InRegLUT = DAG.getNode(ISD::BUILD_VECTOR, DL, ByteVecVT, LUTVec);
19276 SmallVector<SDValue, 16> Mask0F(NumByteElts,
19277 DAG.getConstant(0x0F, DL, MVT::i8));
19278 SDValue M0F = DAG.getNode(ISD::BUILD_VECTOR, DL, ByteVecVT, Mask0F);
19281 SmallVector<SDValue, 16> Four(NumByteElts, DAG.getConstant(4, DL, MVT::i8));
19282 SDValue FourV = DAG.getNode(ISD::BUILD_VECTOR, DL, ByteVecVT, Four);
19283 SDValue HighNibbles = DAG.getNode(ISD::SRL, DL, ByteVecVT, In, FourV);
19286 SDValue LowNibbles = DAG.getNode(ISD::AND, DL, ByteVecVT, In, M0F);
19288 // The input vector is used as the shuffle mask that index elements into the
19289 // LUT. After counting low and high nibbles, add the vector to obtain the
19290 // final pop count per i8 element.
19291 SDValue HighPopCnt =
19292 DAG.getNode(X86ISD::PSHUFB, DL, ByteVecVT, InRegLUT, HighNibbles);
19293 SDValue LowPopCnt =
19294 DAG.getNode(X86ISD::PSHUFB, DL, ByteVecVT, InRegLUT, LowNibbles);
19295 SDValue PopCnt = DAG.getNode(ISD::ADD, DL, ByteVecVT, HighPopCnt, LowPopCnt);
19297 if (EltVT == MVT::i8)
19300 return LowerHorizontalByteSum(PopCnt, VT, Subtarget, DAG);
19303 static SDValue LowerVectorCTPOPBitmath(SDValue Op, SDLoc DL,
19304 const X86Subtarget *Subtarget,
19305 SelectionDAG &DAG) {
19306 MVT VT = Op.getSimpleValueType();
19307 assert(VT.is128BitVector() &&
19308 "Only 128-bit vector bitmath lowering supported.");
19310 int VecSize = VT.getSizeInBits();
19311 MVT EltVT = VT.getVectorElementType();
19312 int Len = EltVT.getSizeInBits();
19314 // This is the vectorized version of the "best" algorithm from
19315 // http://graphics.stanford.edu/~seander/bithacks.html#CountBitsSetParallel
19316 // with a minor tweak to use a series of adds + shifts instead of vector
19317 // multiplications. Implemented for all integer vector types. We only use
19318 // this when we don't have SSSE3 which allows a LUT-based lowering that is
19319 // much faster, even faster than using native popcnt instructions.
19321 auto GetShift = [&](unsigned OpCode, SDValue V, int Shifter) {
19322 MVT VT = V.getSimpleValueType();
19323 SmallVector<SDValue, 32> Shifters(
19324 VT.getVectorNumElements(),
19325 DAG.getConstant(Shifter, DL, VT.getVectorElementType()));
19326 return DAG.getNode(OpCode, DL, VT, V,
19327 DAG.getNode(ISD::BUILD_VECTOR, DL, VT, Shifters));
19329 auto GetMask = [&](SDValue V, APInt Mask) {
19330 MVT VT = V.getSimpleValueType();
19331 SmallVector<SDValue, 32> Masks(
19332 VT.getVectorNumElements(),
19333 DAG.getConstant(Mask, DL, VT.getVectorElementType()));
19334 return DAG.getNode(ISD::AND, DL, VT, V,
19335 DAG.getNode(ISD::BUILD_VECTOR, DL, VT, Masks));
19338 // We don't want to incur the implicit masks required to SRL vNi8 vectors on
19339 // x86, so set the SRL type to have elements at least i16 wide. This is
19340 // correct because all of our SRLs are followed immediately by a mask anyways
19341 // that handles any bits that sneak into the high bits of the byte elements.
19342 MVT SrlVT = Len > 8 ? VT : MVT::getVectorVT(MVT::i16, VecSize / 16);
19346 // v = v - ((v >> 1) & 0x55555555...)
19348 DAG.getBitcast(VT, GetShift(ISD::SRL, DAG.getBitcast(SrlVT, V), 1));
19349 SDValue And = GetMask(Srl, APInt::getSplat(Len, APInt(8, 0x55)));
19350 V = DAG.getNode(ISD::SUB, DL, VT, V, And);
19352 // v = (v & 0x33333333...) + ((v >> 2) & 0x33333333...)
19353 SDValue AndLHS = GetMask(V, APInt::getSplat(Len, APInt(8, 0x33)));
19354 Srl = DAG.getBitcast(VT, GetShift(ISD::SRL, DAG.getBitcast(SrlVT, V), 2));
19355 SDValue AndRHS = GetMask(Srl, APInt::getSplat(Len, APInt(8, 0x33)));
19356 V = DAG.getNode(ISD::ADD, DL, VT, AndLHS, AndRHS);
19358 // v = (v + (v >> 4)) & 0x0F0F0F0F...
19359 Srl = DAG.getBitcast(VT, GetShift(ISD::SRL, DAG.getBitcast(SrlVT, V), 4));
19360 SDValue Add = DAG.getNode(ISD::ADD, DL, VT, V, Srl);
19361 V = GetMask(Add, APInt::getSplat(Len, APInt(8, 0x0F)));
19363 // At this point, V contains the byte-wise population count, and we are
19364 // merely doing a horizontal sum if necessary to get the wider element
19366 if (EltVT == MVT::i8)
19369 return LowerHorizontalByteSum(
19370 DAG.getBitcast(MVT::getVectorVT(MVT::i8, VecSize / 8), V), VT, Subtarget,
19374 static SDValue LowerVectorCTPOP(SDValue Op, const X86Subtarget *Subtarget,
19375 SelectionDAG &DAG) {
19376 MVT VT = Op.getSimpleValueType();
19377 // FIXME: Need to add AVX-512 support here!
19378 assert((VT.is256BitVector() || VT.is128BitVector()) &&
19379 "Unknown CTPOP type to handle");
19380 SDLoc DL(Op.getNode());
19381 SDValue Op0 = Op.getOperand(0);
19383 if (!Subtarget->hasSSSE3()) {
19384 // We can't use the fast LUT approach, so fall back on vectorized bitmath.
19385 assert(VT.is128BitVector() && "Only 128-bit vectors supported in SSE!");
19386 return LowerVectorCTPOPBitmath(Op0, DL, Subtarget, DAG);
19389 if (VT.is256BitVector() && !Subtarget->hasInt256()) {
19390 unsigned NumElems = VT.getVectorNumElements();
19392 // Extract each 128-bit vector, compute pop count and concat the result.
19393 SDValue LHS = Extract128BitVector(Op0, 0, DAG, DL);
19394 SDValue RHS = Extract128BitVector(Op0, NumElems/2, DAG, DL);
19396 return DAG.getNode(ISD::CONCAT_VECTORS, DL, VT,
19397 LowerVectorCTPOPInRegLUT(LHS, DL, Subtarget, DAG),
19398 LowerVectorCTPOPInRegLUT(RHS, DL, Subtarget, DAG));
19401 return LowerVectorCTPOPInRegLUT(Op0, DL, Subtarget, DAG);
19404 static SDValue LowerCTPOP(SDValue Op, const X86Subtarget *Subtarget,
19405 SelectionDAG &DAG) {
19406 assert(Op.getSimpleValueType().isVector() &&
19407 "We only do custom lowering for vector population count.");
19408 return LowerVectorCTPOP(Op, Subtarget, DAG);
19411 static SDValue LowerLOAD_SUB(SDValue Op, SelectionDAG &DAG) {
19412 SDNode *Node = Op.getNode();
19414 EVT T = Node->getValueType(0);
19415 SDValue negOp = DAG.getNode(ISD::SUB, dl, T,
19416 DAG.getConstant(0, dl, T), Node->getOperand(2));
19417 return DAG.getAtomic(ISD::ATOMIC_LOAD_ADD, dl,
19418 cast<AtomicSDNode>(Node)->getMemoryVT(),
19419 Node->getOperand(0),
19420 Node->getOperand(1), negOp,
19421 cast<AtomicSDNode>(Node)->getMemOperand(),
19422 cast<AtomicSDNode>(Node)->getOrdering(),
19423 cast<AtomicSDNode>(Node)->getSynchScope());
19426 static SDValue LowerATOMIC_STORE(SDValue Op, SelectionDAG &DAG) {
19427 SDNode *Node = Op.getNode();
19429 EVT VT = cast<AtomicSDNode>(Node)->getMemoryVT();
19431 // Convert seq_cst store -> xchg
19432 // Convert wide store -> swap (-> cmpxchg8b/cmpxchg16b)
19433 // FIXME: On 32-bit, store -> fist or movq would be more efficient
19434 // (The only way to get a 16-byte store is cmpxchg16b)
19435 // FIXME: 16-byte ATOMIC_SWAP isn't actually hooked up at the moment.
19436 if (cast<AtomicSDNode>(Node)->getOrdering() == SequentiallyConsistent ||
19437 !DAG.getTargetLoweringInfo().isTypeLegal(VT)) {
19438 SDValue Swap = DAG.getAtomic(ISD::ATOMIC_SWAP, dl,
19439 cast<AtomicSDNode>(Node)->getMemoryVT(),
19440 Node->getOperand(0),
19441 Node->getOperand(1), Node->getOperand(2),
19442 cast<AtomicSDNode>(Node)->getMemOperand(),
19443 cast<AtomicSDNode>(Node)->getOrdering(),
19444 cast<AtomicSDNode>(Node)->getSynchScope());
19445 return Swap.getValue(1);
19447 // Other atomic stores have a simple pattern.
19451 static SDValue LowerADDC_ADDE_SUBC_SUBE(SDValue Op, SelectionDAG &DAG) {
19452 MVT VT = Op.getNode()->getSimpleValueType(0);
19454 // Let legalize expand this if it isn't a legal type yet.
19455 if (!DAG.getTargetLoweringInfo().isTypeLegal(VT))
19458 SDVTList VTs = DAG.getVTList(VT, MVT::i32);
19461 bool ExtraOp = false;
19462 switch (Op.getOpcode()) {
19463 default: llvm_unreachable("Invalid code");
19464 case ISD::ADDC: Opc = X86ISD::ADD; break;
19465 case ISD::ADDE: Opc = X86ISD::ADC; ExtraOp = true; break;
19466 case ISD::SUBC: Opc = X86ISD::SUB; break;
19467 case ISD::SUBE: Opc = X86ISD::SBB; ExtraOp = true; break;
19471 return DAG.getNode(Opc, SDLoc(Op), VTs, Op.getOperand(0),
19473 return DAG.getNode(Opc, SDLoc(Op), VTs, Op.getOperand(0),
19474 Op.getOperand(1), Op.getOperand(2));
19477 static SDValue LowerFSINCOS(SDValue Op, const X86Subtarget *Subtarget,
19478 SelectionDAG &DAG) {
19479 assert(Subtarget->isTargetDarwin() && Subtarget->is64Bit());
19481 // For MacOSX, we want to call an alternative entry point: __sincos_stret,
19482 // which returns the values as { float, float } (in XMM0) or
19483 // { double, double } (which is returned in XMM0, XMM1).
19485 SDValue Arg = Op.getOperand(0);
19486 EVT ArgVT = Arg.getValueType();
19487 Type *ArgTy = ArgVT.getTypeForEVT(*DAG.getContext());
19489 TargetLowering::ArgListTy Args;
19490 TargetLowering::ArgListEntry Entry;
19494 Entry.isSExt = false;
19495 Entry.isZExt = false;
19496 Args.push_back(Entry);
19498 bool isF64 = ArgVT == MVT::f64;
19499 // Only optimize x86_64 for now. i386 is a bit messy. For f32,
19500 // the small struct {f32, f32} is returned in (eax, edx). For f64,
19501 // the results are returned via SRet in memory.
19502 const char *LibcallName = isF64 ? "__sincos_stret" : "__sincosf_stret";
19503 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
19505 DAG.getExternalSymbol(LibcallName, TLI.getPointerTy(DAG.getDataLayout()));
19507 Type *RetTy = isF64
19508 ? (Type*)StructType::get(ArgTy, ArgTy, nullptr)
19509 : (Type*)VectorType::get(ArgTy, 4);
19511 TargetLowering::CallLoweringInfo CLI(DAG);
19512 CLI.setDebugLoc(dl).setChain(DAG.getEntryNode())
19513 .setCallee(CallingConv::C, RetTy, Callee, std::move(Args), 0);
19515 std::pair<SDValue, SDValue> CallResult = TLI.LowerCallTo(CLI);
19518 // Returned in xmm0 and xmm1.
19519 return CallResult.first;
19521 // Returned in bits 0:31 and 32:64 xmm0.
19522 SDValue SinVal = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, ArgVT,
19523 CallResult.first, DAG.getIntPtrConstant(0, dl));
19524 SDValue CosVal = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, ArgVT,
19525 CallResult.first, DAG.getIntPtrConstant(1, dl));
19526 SDVTList Tys = DAG.getVTList(ArgVT, ArgVT);
19527 return DAG.getNode(ISD::MERGE_VALUES, dl, Tys, SinVal, CosVal);
19530 static SDValue LowerMSCATTER(SDValue Op, const X86Subtarget *Subtarget,
19531 SelectionDAG &DAG) {
19532 assert(Subtarget->hasAVX512() &&
19533 "MGATHER/MSCATTER are supported on AVX-512 arch only");
19535 MaskedScatterSDNode *N = cast<MaskedScatterSDNode>(Op.getNode());
19536 MVT VT = N->getValue().getSimpleValueType();
19537 assert(VT.getScalarSizeInBits() >= 32 && "Unsupported scatter op");
19540 // X86 scatter kills mask register, so its type should be added to
19541 // the list of return values
19542 if (N->getNumValues() == 1) {
19543 SDValue Index = N->getIndex();
19544 if (!Subtarget->hasVLX() && !VT.is512BitVector() &&
19545 !Index.getSimpleValueType().is512BitVector())
19546 Index = DAG.getNode(ISD::SIGN_EXTEND, dl, MVT::v8i64, Index);
19548 SDVTList VTs = DAG.getVTList(N->getMask().getValueType(), MVT::Other);
19549 SDValue Ops[] = { N->getOperand(0), N->getOperand(1), N->getOperand(2),
19550 N->getOperand(3), Index };
19552 SDValue NewScatter = DAG.getMaskedScatter(VTs, VT, dl, Ops, N->getMemOperand());
19553 DAG.ReplaceAllUsesWith(Op, SDValue(NewScatter.getNode(), 1));
19554 return SDValue(NewScatter.getNode(), 0);
19559 static SDValue LowerMGATHER(SDValue Op, const X86Subtarget *Subtarget,
19560 SelectionDAG &DAG) {
19561 assert(Subtarget->hasAVX512() &&
19562 "MGATHER/MSCATTER are supported on AVX-512 arch only");
19564 MaskedGatherSDNode *N = cast<MaskedGatherSDNode>(Op.getNode());
19565 MVT VT = Op.getSimpleValueType();
19566 assert(VT.getScalarSizeInBits() >= 32 && "Unsupported gather op");
19569 SDValue Index = N->getIndex();
19570 if (!Subtarget->hasVLX() && !VT.is512BitVector() &&
19571 !Index.getSimpleValueType().is512BitVector()) {
19572 Index = DAG.getNode(ISD::SIGN_EXTEND, dl, MVT::v8i64, Index);
19573 SDValue Ops[] = { N->getOperand(0), N->getOperand(1), N->getOperand(2),
19574 N->getOperand(3), Index };
19575 DAG.UpdateNodeOperands(N, Ops);
19580 SDValue X86TargetLowering::LowerGC_TRANSITION_START(SDValue Op,
19581 SelectionDAG &DAG) const {
19582 // TODO: Eventually, the lowering of these nodes should be informed by or
19583 // deferred to the GC strategy for the function in which they appear. For
19584 // now, however, they must be lowered to something. Since they are logically
19585 // no-ops in the case of a null GC strategy (or a GC strategy which does not
19586 // require special handling for these nodes), lower them as literal NOOPs for
19588 SmallVector<SDValue, 2> Ops;
19590 Ops.push_back(Op.getOperand(0));
19591 if (Op->getGluedNode())
19592 Ops.push_back(Op->getOperand(Op->getNumOperands() - 1));
19595 SDVTList VTs = DAG.getVTList(MVT::Other, MVT::Glue);
19596 SDValue NOOP(DAG.getMachineNode(X86::NOOP, SDLoc(Op), VTs, Ops), 0);
19601 SDValue X86TargetLowering::LowerGC_TRANSITION_END(SDValue Op,
19602 SelectionDAG &DAG) const {
19603 // TODO: Eventually, the lowering of these nodes should be informed by or
19604 // deferred to the GC strategy for the function in which they appear. For
19605 // now, however, they must be lowered to something. Since they are logically
19606 // no-ops in the case of a null GC strategy (or a GC strategy which does not
19607 // require special handling for these nodes), lower them as literal NOOPs for
19609 SmallVector<SDValue, 2> Ops;
19611 Ops.push_back(Op.getOperand(0));
19612 if (Op->getGluedNode())
19613 Ops.push_back(Op->getOperand(Op->getNumOperands() - 1));
19616 SDVTList VTs = DAG.getVTList(MVT::Other, MVT::Glue);
19617 SDValue NOOP(DAG.getMachineNode(X86::NOOP, SDLoc(Op), VTs, Ops), 0);
19622 /// LowerOperation - Provide custom lowering hooks for some operations.
19624 SDValue X86TargetLowering::LowerOperation(SDValue Op, SelectionDAG &DAG) const {
19625 switch (Op.getOpcode()) {
19626 default: llvm_unreachable("Should not custom lower this!");
19627 case ISD::ATOMIC_FENCE: return LowerATOMIC_FENCE(Op, Subtarget, DAG);
19628 case ISD::ATOMIC_CMP_SWAP_WITH_SUCCESS:
19629 return LowerCMP_SWAP(Op, Subtarget, DAG);
19630 case ISD::CTPOP: return LowerCTPOP(Op, Subtarget, DAG);
19631 case ISD::ATOMIC_LOAD_SUB: return LowerLOAD_SUB(Op,DAG);
19632 case ISD::ATOMIC_STORE: return LowerATOMIC_STORE(Op,DAG);
19633 case ISD::BUILD_VECTOR: return LowerBUILD_VECTOR(Op, DAG);
19634 case ISD::CONCAT_VECTORS: return LowerCONCAT_VECTORS(Op, Subtarget, DAG);
19635 case ISD::VECTOR_SHUFFLE: return lowerVectorShuffle(Op, Subtarget, DAG);
19636 case ISD::VSELECT: return LowerVSELECT(Op, DAG);
19637 case ISD::EXTRACT_VECTOR_ELT: return LowerEXTRACT_VECTOR_ELT(Op, DAG);
19638 case ISD::INSERT_VECTOR_ELT: return LowerINSERT_VECTOR_ELT(Op, DAG);
19639 case ISD::EXTRACT_SUBVECTOR: return LowerEXTRACT_SUBVECTOR(Op,Subtarget,DAG);
19640 case ISD::INSERT_SUBVECTOR: return LowerINSERT_SUBVECTOR(Op, Subtarget,DAG);
19641 case ISD::SCALAR_TO_VECTOR: return LowerSCALAR_TO_VECTOR(Op, DAG);
19642 case ISD::ConstantPool: return LowerConstantPool(Op, DAG);
19643 case ISD::GlobalAddress: return LowerGlobalAddress(Op, DAG);
19644 case ISD::GlobalTLSAddress: return LowerGlobalTLSAddress(Op, DAG);
19645 case ISD::ExternalSymbol: return LowerExternalSymbol(Op, DAG);
19646 case ISD::BlockAddress: return LowerBlockAddress(Op, DAG);
19647 case ISD::SHL_PARTS:
19648 case ISD::SRA_PARTS:
19649 case ISD::SRL_PARTS: return LowerShiftParts(Op, DAG);
19650 case ISD::SINT_TO_FP: return LowerSINT_TO_FP(Op, DAG);
19651 case ISD::UINT_TO_FP: return LowerUINT_TO_FP(Op, DAG);
19652 case ISD::TRUNCATE: return LowerTRUNCATE(Op, DAG);
19653 case ISD::ZERO_EXTEND: return LowerZERO_EXTEND(Op, Subtarget, DAG);
19654 case ISD::SIGN_EXTEND: return LowerSIGN_EXTEND(Op, Subtarget, DAG);
19655 case ISD::ANY_EXTEND: return LowerANY_EXTEND(Op, Subtarget, DAG);
19656 case ISD::SIGN_EXTEND_VECTOR_INREG:
19657 return LowerSIGN_EXTEND_VECTOR_INREG(Op, Subtarget, DAG);
19658 case ISD::FP_TO_SINT: return LowerFP_TO_SINT(Op, DAG);
19659 case ISD::FP_TO_UINT: return LowerFP_TO_UINT(Op, DAG);
19660 case ISD::FP_EXTEND: return LowerFP_EXTEND(Op, DAG);
19661 case ISD::LOAD: return LowerExtendedLoad(Op, Subtarget, DAG);
19663 case ISD::FNEG: return LowerFABSorFNEG(Op, DAG);
19664 case ISD::FCOPYSIGN: return LowerFCOPYSIGN(Op, DAG);
19665 case ISD::FGETSIGN: return LowerFGETSIGN(Op, DAG);
19666 case ISD::SETCC: return LowerSETCC(Op, DAG);
19667 case ISD::SELECT: return LowerSELECT(Op, DAG);
19668 case ISD::BRCOND: return LowerBRCOND(Op, DAG);
19669 case ISD::JumpTable: return LowerJumpTable(Op, DAG);
19670 case ISD::VASTART: return LowerVASTART(Op, DAG);
19671 case ISD::VAARG: return LowerVAARG(Op, DAG);
19672 case ISD::VACOPY: return LowerVACOPY(Op, Subtarget, DAG);
19673 case ISD::INTRINSIC_WO_CHAIN: return LowerINTRINSIC_WO_CHAIN(Op, Subtarget, DAG);
19674 case ISD::INTRINSIC_VOID:
19675 case ISD::INTRINSIC_W_CHAIN: return LowerINTRINSIC_W_CHAIN(Op, Subtarget, DAG);
19676 case ISD::RETURNADDR: return LowerRETURNADDR(Op, DAG);
19677 case ISD::FRAMEADDR: return LowerFRAMEADDR(Op, DAG);
19678 case ISD::FRAME_TO_ARGS_OFFSET:
19679 return LowerFRAME_TO_ARGS_OFFSET(Op, DAG);
19680 case ISD::DYNAMIC_STACKALLOC: return LowerDYNAMIC_STACKALLOC(Op, DAG);
19681 case ISD::EH_RETURN: return LowerEH_RETURN(Op, DAG);
19682 case ISD::EH_SJLJ_SETJMP: return lowerEH_SJLJ_SETJMP(Op, DAG);
19683 case ISD::EH_SJLJ_LONGJMP: return lowerEH_SJLJ_LONGJMP(Op, DAG);
19684 case ISD::INIT_TRAMPOLINE: return LowerINIT_TRAMPOLINE(Op, DAG);
19685 case ISD::ADJUST_TRAMPOLINE: return LowerADJUST_TRAMPOLINE(Op, DAG);
19686 case ISD::FLT_ROUNDS_: return LowerFLT_ROUNDS_(Op, DAG);
19687 case ISD::CTLZ: return LowerCTLZ(Op, Subtarget, DAG);
19688 case ISD::CTLZ_ZERO_UNDEF: return LowerCTLZ_ZERO_UNDEF(Op, Subtarget, DAG);
19690 case ISD::CTTZ_ZERO_UNDEF: return LowerCTTZ(Op, DAG);
19691 case ISD::MUL: return LowerMUL(Op, Subtarget, DAG);
19692 case ISD::UMUL_LOHI:
19693 case ISD::SMUL_LOHI: return LowerMUL_LOHI(Op, Subtarget, DAG);
19694 case ISD::ROTL: return LowerRotate(Op, Subtarget, DAG);
19697 case ISD::SHL: return LowerShift(Op, Subtarget, DAG);
19703 case ISD::UMULO: return LowerXALUO(Op, DAG);
19704 case ISD::READCYCLECOUNTER: return LowerREADCYCLECOUNTER(Op, Subtarget,DAG);
19705 case ISD::BITCAST: return LowerBITCAST(Op, Subtarget, DAG);
19709 case ISD::SUBE: return LowerADDC_ADDE_SUBC_SUBE(Op, DAG);
19710 case ISD::ADD: return LowerADD(Op, DAG);
19711 case ISD::SUB: return LowerSUB(Op, DAG);
19715 case ISD::UMIN: return LowerMINMAX(Op, DAG);
19716 case ISD::FSINCOS: return LowerFSINCOS(Op, Subtarget, DAG);
19717 case ISD::MGATHER: return LowerMGATHER(Op, Subtarget, DAG);
19718 case ISD::MSCATTER: return LowerMSCATTER(Op, Subtarget, DAG);
19719 case ISD::GC_TRANSITION_START:
19720 return LowerGC_TRANSITION_START(Op, DAG);
19721 case ISD::GC_TRANSITION_END: return LowerGC_TRANSITION_END(Op, DAG);
19725 /// ReplaceNodeResults - Replace a node with an illegal result type
19726 /// with a new node built out of custom code.
19727 void X86TargetLowering::ReplaceNodeResults(SDNode *N,
19728 SmallVectorImpl<SDValue>&Results,
19729 SelectionDAG &DAG) const {
19731 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
19732 switch (N->getOpcode()) {
19734 llvm_unreachable("Do not know how to custom type legalize this operation!");
19735 // We might have generated v2f32 FMIN/FMAX operations. Widen them to v4f32.
19736 case X86ISD::FMINC:
19738 case X86ISD::FMAXC:
19739 case X86ISD::FMAX: {
19740 EVT VT = N->getValueType(0);
19741 assert(VT == MVT::v2f32 && "Unexpected type (!= v2f32) on FMIN/FMAX.");
19742 SDValue UNDEF = DAG.getUNDEF(VT);
19743 SDValue LHS = DAG.getNode(ISD::CONCAT_VECTORS, dl, MVT::v4f32,
19744 N->getOperand(0), UNDEF);
19745 SDValue RHS = DAG.getNode(ISD::CONCAT_VECTORS, dl, MVT::v4f32,
19746 N->getOperand(1), UNDEF);
19747 Results.push_back(DAG.getNode(N->getOpcode(), dl, MVT::v4f32, LHS, RHS));
19750 case ISD::SIGN_EXTEND_INREG:
19755 // We don't want to expand or promote these.
19762 case ISD::UDIVREM: {
19763 SDValue V = LowerWin64_i128OP(SDValue(N,0), DAG);
19764 Results.push_back(V);
19767 case ISD::FP_TO_SINT:
19768 case ISD::FP_TO_UINT: {
19769 bool IsSigned = N->getOpcode() == ISD::FP_TO_SINT;
19771 std::pair<SDValue,SDValue> Vals =
19772 FP_TO_INTHelper(SDValue(N, 0), DAG, IsSigned, /*IsReplace=*/ true);
19773 SDValue FIST = Vals.first, StackSlot = Vals.second;
19774 if (FIST.getNode()) {
19775 EVT VT = N->getValueType(0);
19776 // Return a load from the stack slot.
19777 if (StackSlot.getNode())
19778 Results.push_back(DAG.getLoad(VT, dl, FIST, StackSlot,
19779 MachinePointerInfo(),
19780 false, false, false, 0));
19782 Results.push_back(FIST);
19786 case ISD::UINT_TO_FP: {
19787 assert(Subtarget->hasSSE2() && "Requires at least SSE2!");
19788 if (N->getOperand(0).getValueType() != MVT::v2i32 ||
19789 N->getValueType(0) != MVT::v2f32)
19791 SDValue ZExtIn = DAG.getNode(ISD::ZERO_EXTEND, dl, MVT::v2i64,
19793 SDValue Bias = DAG.getConstantFP(BitsToDouble(0x4330000000000000ULL), dl,
19795 SDValue VBias = DAG.getNode(ISD::BUILD_VECTOR, dl, MVT::v2f64, Bias, Bias);
19796 SDValue Or = DAG.getNode(ISD::OR, dl, MVT::v2i64, ZExtIn,
19797 DAG.getBitcast(MVT::v2i64, VBias));
19798 Or = DAG.getBitcast(MVT::v2f64, Or);
19799 // TODO: Are there any fast-math-flags to propagate here?
19800 SDValue Sub = DAG.getNode(ISD::FSUB, dl, MVT::v2f64, Or, VBias);
19801 Results.push_back(DAG.getNode(X86ISD::VFPROUND, dl, MVT::v4f32, Sub));
19804 case ISD::FP_ROUND: {
19805 if (!TLI.isTypeLegal(N->getOperand(0).getValueType()))
19807 SDValue V = DAG.getNode(X86ISD::VFPROUND, dl, MVT::v4f32, N->getOperand(0));
19808 Results.push_back(V);
19811 case ISD::FP_EXTEND: {
19812 // Right now, only MVT::v2f32 has OperationAction for FP_EXTEND.
19813 // No other ValueType for FP_EXTEND should reach this point.
19814 assert(N->getValueType(0) == MVT::v2f32 &&
19815 "Do not know how to legalize this Node");
19818 case ISD::INTRINSIC_W_CHAIN: {
19819 unsigned IntNo = cast<ConstantSDNode>(N->getOperand(1))->getZExtValue();
19821 default : llvm_unreachable("Do not know how to custom type "
19822 "legalize this intrinsic operation!");
19823 case Intrinsic::x86_rdtsc:
19824 return getReadTimeStampCounter(N, dl, X86ISD::RDTSC_DAG, DAG, Subtarget,
19826 case Intrinsic::x86_rdtscp:
19827 return getReadTimeStampCounter(N, dl, X86ISD::RDTSCP_DAG, DAG, Subtarget,
19829 case Intrinsic::x86_rdpmc:
19830 return getReadPerformanceCounter(N, dl, DAG, Subtarget, Results);
19833 case ISD::READCYCLECOUNTER: {
19834 return getReadTimeStampCounter(N, dl, X86ISD::RDTSC_DAG, DAG, Subtarget,
19837 case ISD::ATOMIC_CMP_SWAP_WITH_SUCCESS: {
19838 EVT T = N->getValueType(0);
19839 assert((T == MVT::i64 || T == MVT::i128) && "can only expand cmpxchg pair");
19840 bool Regs64bit = T == MVT::i128;
19841 MVT HalfT = Regs64bit ? MVT::i64 : MVT::i32;
19842 SDValue cpInL, cpInH;
19843 cpInL = DAG.getNode(ISD::EXTRACT_ELEMENT, dl, HalfT, N->getOperand(2),
19844 DAG.getConstant(0, dl, HalfT));
19845 cpInH = DAG.getNode(ISD::EXTRACT_ELEMENT, dl, HalfT, N->getOperand(2),
19846 DAG.getConstant(1, dl, HalfT));
19847 cpInL = DAG.getCopyToReg(N->getOperand(0), dl,
19848 Regs64bit ? X86::RAX : X86::EAX,
19850 cpInH = DAG.getCopyToReg(cpInL.getValue(0), dl,
19851 Regs64bit ? X86::RDX : X86::EDX,
19852 cpInH, cpInL.getValue(1));
19853 SDValue swapInL, swapInH;
19854 swapInL = DAG.getNode(ISD::EXTRACT_ELEMENT, dl, HalfT, N->getOperand(3),
19855 DAG.getConstant(0, dl, HalfT));
19856 swapInH = DAG.getNode(ISD::EXTRACT_ELEMENT, dl, HalfT, N->getOperand(3),
19857 DAG.getConstant(1, dl, HalfT));
19858 swapInL = DAG.getCopyToReg(cpInH.getValue(0), dl,
19859 Regs64bit ? X86::RBX : X86::EBX,
19860 swapInL, cpInH.getValue(1));
19861 swapInH = DAG.getCopyToReg(swapInL.getValue(0), dl,
19862 Regs64bit ? X86::RCX : X86::ECX,
19863 swapInH, swapInL.getValue(1));
19864 SDValue Ops[] = { swapInH.getValue(0),
19866 swapInH.getValue(1) };
19867 SDVTList Tys = DAG.getVTList(MVT::Other, MVT::Glue);
19868 MachineMemOperand *MMO = cast<AtomicSDNode>(N)->getMemOperand();
19869 unsigned Opcode = Regs64bit ? X86ISD::LCMPXCHG16_DAG :
19870 X86ISD::LCMPXCHG8_DAG;
19871 SDValue Result = DAG.getMemIntrinsicNode(Opcode, dl, Tys, Ops, T, MMO);
19872 SDValue cpOutL = DAG.getCopyFromReg(Result.getValue(0), dl,
19873 Regs64bit ? X86::RAX : X86::EAX,
19874 HalfT, Result.getValue(1));
19875 SDValue cpOutH = DAG.getCopyFromReg(cpOutL.getValue(1), dl,
19876 Regs64bit ? X86::RDX : X86::EDX,
19877 HalfT, cpOutL.getValue(2));
19878 SDValue OpsF[] = { cpOutL.getValue(0), cpOutH.getValue(0)};
19880 SDValue EFLAGS = DAG.getCopyFromReg(cpOutH.getValue(1), dl, X86::EFLAGS,
19881 MVT::i32, cpOutH.getValue(2));
19883 DAG.getNode(X86ISD::SETCC, dl, MVT::i8,
19884 DAG.getConstant(X86::COND_E, dl, MVT::i8), EFLAGS);
19885 Success = DAG.getZExtOrTrunc(Success, dl, N->getValueType(1));
19887 Results.push_back(DAG.getNode(ISD::BUILD_PAIR, dl, T, OpsF));
19888 Results.push_back(Success);
19889 Results.push_back(EFLAGS.getValue(1));
19892 case ISD::ATOMIC_SWAP:
19893 case ISD::ATOMIC_LOAD_ADD:
19894 case ISD::ATOMIC_LOAD_SUB:
19895 case ISD::ATOMIC_LOAD_AND:
19896 case ISD::ATOMIC_LOAD_OR:
19897 case ISD::ATOMIC_LOAD_XOR:
19898 case ISD::ATOMIC_LOAD_NAND:
19899 case ISD::ATOMIC_LOAD_MIN:
19900 case ISD::ATOMIC_LOAD_MAX:
19901 case ISD::ATOMIC_LOAD_UMIN:
19902 case ISD::ATOMIC_LOAD_UMAX:
19903 case ISD::ATOMIC_LOAD: {
19904 // Delegate to generic TypeLegalization. Situations we can really handle
19905 // should have already been dealt with by AtomicExpandPass.cpp.
19908 case ISD::BITCAST: {
19909 assert(Subtarget->hasSSE2() && "Requires at least SSE2!");
19910 EVT DstVT = N->getValueType(0);
19911 EVT SrcVT = N->getOperand(0)->getValueType(0);
19913 if (SrcVT != MVT::f64 ||
19914 (DstVT != MVT::v2i32 && DstVT != MVT::v4i16 && DstVT != MVT::v8i8))
19917 unsigned NumElts = DstVT.getVectorNumElements();
19918 EVT SVT = DstVT.getVectorElementType();
19919 EVT WiderVT = EVT::getVectorVT(*DAG.getContext(), SVT, NumElts * 2);
19920 SDValue Expanded = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl,
19921 MVT::v2f64, N->getOperand(0));
19922 SDValue ToVecInt = DAG.getBitcast(WiderVT, Expanded);
19924 if (ExperimentalVectorWideningLegalization) {
19925 // If we are legalizing vectors by widening, we already have the desired
19926 // legal vector type, just return it.
19927 Results.push_back(ToVecInt);
19931 SmallVector<SDValue, 8> Elts;
19932 for (unsigned i = 0, e = NumElts; i != e; ++i)
19933 Elts.push_back(DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, SVT,
19934 ToVecInt, DAG.getIntPtrConstant(i, dl)));
19936 Results.push_back(DAG.getNode(ISD::BUILD_VECTOR, dl, DstVT, Elts));
19941 const char *X86TargetLowering::getTargetNodeName(unsigned Opcode) const {
19942 switch ((X86ISD::NodeType)Opcode) {
19943 case X86ISD::FIRST_NUMBER: break;
19944 case X86ISD::BSF: return "X86ISD::BSF";
19945 case X86ISD::BSR: return "X86ISD::BSR";
19946 case X86ISD::SHLD: return "X86ISD::SHLD";
19947 case X86ISD::SHRD: return "X86ISD::SHRD";
19948 case X86ISD::FAND: return "X86ISD::FAND";
19949 case X86ISD::FANDN: return "X86ISD::FANDN";
19950 case X86ISD::FOR: return "X86ISD::FOR";
19951 case X86ISD::FXOR: return "X86ISD::FXOR";
19952 case X86ISD::FILD: return "X86ISD::FILD";
19953 case X86ISD::FILD_FLAG: return "X86ISD::FILD_FLAG";
19954 case X86ISD::FP_TO_INT16_IN_MEM: return "X86ISD::FP_TO_INT16_IN_MEM";
19955 case X86ISD::FP_TO_INT32_IN_MEM: return "X86ISD::FP_TO_INT32_IN_MEM";
19956 case X86ISD::FP_TO_INT64_IN_MEM: return "X86ISD::FP_TO_INT64_IN_MEM";
19957 case X86ISD::FLD: return "X86ISD::FLD";
19958 case X86ISD::FST: return "X86ISD::FST";
19959 case X86ISD::CALL: return "X86ISD::CALL";
19960 case X86ISD::RDTSC_DAG: return "X86ISD::RDTSC_DAG";
19961 case X86ISD::RDTSCP_DAG: return "X86ISD::RDTSCP_DAG";
19962 case X86ISD::RDPMC_DAG: return "X86ISD::RDPMC_DAG";
19963 case X86ISD::BT: return "X86ISD::BT";
19964 case X86ISD::CMP: return "X86ISD::CMP";
19965 case X86ISD::COMI: return "X86ISD::COMI";
19966 case X86ISD::UCOMI: return "X86ISD::UCOMI";
19967 case X86ISD::CMPM: return "X86ISD::CMPM";
19968 case X86ISD::CMPMU: return "X86ISD::CMPMU";
19969 case X86ISD::CMPM_RND: return "X86ISD::CMPM_RND";
19970 case X86ISD::SETCC: return "X86ISD::SETCC";
19971 case X86ISD::SETCC_CARRY: return "X86ISD::SETCC_CARRY";
19972 case X86ISD::FSETCC: return "X86ISD::FSETCC";
19973 case X86ISD::FGETSIGNx86: return "X86ISD::FGETSIGNx86";
19974 case X86ISD::CMOV: return "X86ISD::CMOV";
19975 case X86ISD::BRCOND: return "X86ISD::BRCOND";
19976 case X86ISD::RET_FLAG: return "X86ISD::RET_FLAG";
19977 case X86ISD::REP_STOS: return "X86ISD::REP_STOS";
19978 case X86ISD::REP_MOVS: return "X86ISD::REP_MOVS";
19979 case X86ISD::GlobalBaseReg: return "X86ISD::GlobalBaseReg";
19980 case X86ISD::Wrapper: return "X86ISD::Wrapper";
19981 case X86ISD::WrapperRIP: return "X86ISD::WrapperRIP";
19982 case X86ISD::MOVDQ2Q: return "X86ISD::MOVDQ2Q";
19983 case X86ISD::MMX_MOVD2W: return "X86ISD::MMX_MOVD2W";
19984 case X86ISD::MMX_MOVW2D: return "X86ISD::MMX_MOVW2D";
19985 case X86ISD::PEXTRB: return "X86ISD::PEXTRB";
19986 case X86ISD::PEXTRW: return "X86ISD::PEXTRW";
19987 case X86ISD::INSERTPS: return "X86ISD::INSERTPS";
19988 case X86ISD::PINSRB: return "X86ISD::PINSRB";
19989 case X86ISD::PINSRW: return "X86ISD::PINSRW";
19990 case X86ISD::MMX_PINSRW: return "X86ISD::MMX_PINSRW";
19991 case X86ISD::PSHUFB: return "X86ISD::PSHUFB";
19992 case X86ISD::ANDNP: return "X86ISD::ANDNP";
19993 case X86ISD::PSIGN: return "X86ISD::PSIGN";
19994 case X86ISD::BLENDI: return "X86ISD::BLENDI";
19995 case X86ISD::SHRUNKBLEND: return "X86ISD::SHRUNKBLEND";
19996 case X86ISD::ADDUS: return "X86ISD::ADDUS";
19997 case X86ISD::SUBUS: return "X86ISD::SUBUS";
19998 case X86ISD::HADD: return "X86ISD::HADD";
19999 case X86ISD::HSUB: return "X86ISD::HSUB";
20000 case X86ISD::FHADD: return "X86ISD::FHADD";
20001 case X86ISD::FHSUB: return "X86ISD::FHSUB";
20002 case X86ISD::ABS: return "X86ISD::ABS";
20003 case X86ISD::CONFLICT: return "X86ISD::CONFLICT";
20004 case X86ISD::FMAX: return "X86ISD::FMAX";
20005 case X86ISD::FMAX_RND: return "X86ISD::FMAX_RND";
20006 case X86ISD::FMIN: return "X86ISD::FMIN";
20007 case X86ISD::FMIN_RND: return "X86ISD::FMIN_RND";
20008 case X86ISD::FMAXC: return "X86ISD::FMAXC";
20009 case X86ISD::FMINC: return "X86ISD::FMINC";
20010 case X86ISD::FRSQRT: return "X86ISD::FRSQRT";
20011 case X86ISD::FRCP: return "X86ISD::FRCP";
20012 case X86ISD::EXTRQI: return "X86ISD::EXTRQI";
20013 case X86ISD::INSERTQI: return "X86ISD::INSERTQI";
20014 case X86ISD::TLSADDR: return "X86ISD::TLSADDR";
20015 case X86ISD::TLSBASEADDR: return "X86ISD::TLSBASEADDR";
20016 case X86ISD::TLSCALL: return "X86ISD::TLSCALL";
20017 case X86ISD::EH_SJLJ_SETJMP: return "X86ISD::EH_SJLJ_SETJMP";
20018 case X86ISD::EH_SJLJ_LONGJMP: return "X86ISD::EH_SJLJ_LONGJMP";
20019 case X86ISD::EH_RETURN: return "X86ISD::EH_RETURN";
20020 case X86ISD::TC_RETURN: return "X86ISD::TC_RETURN";
20021 case X86ISD::FNSTCW16m: return "X86ISD::FNSTCW16m";
20022 case X86ISD::FNSTSW16r: return "X86ISD::FNSTSW16r";
20023 case X86ISD::LCMPXCHG_DAG: return "X86ISD::LCMPXCHG_DAG";
20024 case X86ISD::LCMPXCHG8_DAG: return "X86ISD::LCMPXCHG8_DAG";
20025 case X86ISD::LCMPXCHG16_DAG: return "X86ISD::LCMPXCHG16_DAG";
20026 case X86ISD::VZEXT_MOVL: return "X86ISD::VZEXT_MOVL";
20027 case X86ISD::VZEXT_LOAD: return "X86ISD::VZEXT_LOAD";
20028 case X86ISD::VZEXT: return "X86ISD::VZEXT";
20029 case X86ISD::VSEXT: return "X86ISD::VSEXT";
20030 case X86ISD::VTRUNC: return "X86ISD::VTRUNC";
20031 case X86ISD::VTRUNCS: return "X86ISD::VTRUNCS";
20032 case X86ISD::VTRUNCUS: return "X86ISD::VTRUNCUS";
20033 case X86ISD::VINSERT: return "X86ISD::VINSERT";
20034 case X86ISD::VFPEXT: return "X86ISD::VFPEXT";
20035 case X86ISD::VFPROUND: return "X86ISD::VFPROUND";
20036 case X86ISD::CVTDQ2PD: return "X86ISD::CVTDQ2PD";
20037 case X86ISD::CVTUDQ2PD: return "X86ISD::CVTUDQ2PD";
20038 case X86ISD::VSHLDQ: return "X86ISD::VSHLDQ";
20039 case X86ISD::VSRLDQ: return "X86ISD::VSRLDQ";
20040 case X86ISD::VSHL: return "X86ISD::VSHL";
20041 case X86ISD::VSRL: return "X86ISD::VSRL";
20042 case X86ISD::VSRA: return "X86ISD::VSRA";
20043 case X86ISD::VSHLI: return "X86ISD::VSHLI";
20044 case X86ISD::VSRLI: return "X86ISD::VSRLI";
20045 case X86ISD::VSRAI: return "X86ISD::VSRAI";
20046 case X86ISD::CMPP: return "X86ISD::CMPP";
20047 case X86ISD::PCMPEQ: return "X86ISD::PCMPEQ";
20048 case X86ISD::PCMPGT: return "X86ISD::PCMPGT";
20049 case X86ISD::PCMPEQM: return "X86ISD::PCMPEQM";
20050 case X86ISD::PCMPGTM: return "X86ISD::PCMPGTM";
20051 case X86ISD::ADD: return "X86ISD::ADD";
20052 case X86ISD::SUB: return "X86ISD::SUB";
20053 case X86ISD::ADC: return "X86ISD::ADC";
20054 case X86ISD::SBB: return "X86ISD::SBB";
20055 case X86ISD::SMUL: return "X86ISD::SMUL";
20056 case X86ISD::UMUL: return "X86ISD::UMUL";
20057 case X86ISD::SMUL8: return "X86ISD::SMUL8";
20058 case X86ISD::UMUL8: return "X86ISD::UMUL8";
20059 case X86ISD::SDIVREM8_SEXT_HREG: return "X86ISD::SDIVREM8_SEXT_HREG";
20060 case X86ISD::UDIVREM8_ZEXT_HREG: return "X86ISD::UDIVREM8_ZEXT_HREG";
20061 case X86ISD::INC: return "X86ISD::INC";
20062 case X86ISD::DEC: return "X86ISD::DEC";
20063 case X86ISD::OR: return "X86ISD::OR";
20064 case X86ISD::XOR: return "X86ISD::XOR";
20065 case X86ISD::AND: return "X86ISD::AND";
20066 case X86ISD::BEXTR: return "X86ISD::BEXTR";
20067 case X86ISD::MUL_IMM: return "X86ISD::MUL_IMM";
20068 case X86ISD::PTEST: return "X86ISD::PTEST";
20069 case X86ISD::TESTP: return "X86ISD::TESTP";
20070 case X86ISD::TESTM: return "X86ISD::TESTM";
20071 case X86ISD::TESTNM: return "X86ISD::TESTNM";
20072 case X86ISD::KORTEST: return "X86ISD::KORTEST";
20073 case X86ISD::KTEST: return "X86ISD::KTEST";
20074 case X86ISD::PACKSS: return "X86ISD::PACKSS";
20075 case X86ISD::PACKUS: return "X86ISD::PACKUS";
20076 case X86ISD::PALIGNR: return "X86ISD::PALIGNR";
20077 case X86ISD::VALIGN: return "X86ISD::VALIGN";
20078 case X86ISD::PSHUFD: return "X86ISD::PSHUFD";
20079 case X86ISD::PSHUFHW: return "X86ISD::PSHUFHW";
20080 case X86ISD::PSHUFLW: return "X86ISD::PSHUFLW";
20081 case X86ISD::SHUFP: return "X86ISD::SHUFP";
20082 case X86ISD::SHUF128: return "X86ISD::SHUF128";
20083 case X86ISD::MOVLHPS: return "X86ISD::MOVLHPS";
20084 case X86ISD::MOVLHPD: return "X86ISD::MOVLHPD";
20085 case X86ISD::MOVHLPS: return "X86ISD::MOVHLPS";
20086 case X86ISD::MOVLPS: return "X86ISD::MOVLPS";
20087 case X86ISD::MOVLPD: return "X86ISD::MOVLPD";
20088 case X86ISD::MOVDDUP: return "X86ISD::MOVDDUP";
20089 case X86ISD::MOVSHDUP: return "X86ISD::MOVSHDUP";
20090 case X86ISD::MOVSLDUP: return "X86ISD::MOVSLDUP";
20091 case X86ISD::MOVSD: return "X86ISD::MOVSD";
20092 case X86ISD::MOVSS: return "X86ISD::MOVSS";
20093 case X86ISD::UNPCKL: return "X86ISD::UNPCKL";
20094 case X86ISD::UNPCKH: return "X86ISD::UNPCKH";
20095 case X86ISD::VBROADCAST: return "X86ISD::VBROADCAST";
20096 case X86ISD::SUBV_BROADCAST: return "X86ISD::SUBV_BROADCAST";
20097 case X86ISD::VEXTRACT: return "X86ISD::VEXTRACT";
20098 case X86ISD::VPERMILPV: return "X86ISD::VPERMILPV";
20099 case X86ISD::VPERMILPI: return "X86ISD::VPERMILPI";
20100 case X86ISD::VPERM2X128: return "X86ISD::VPERM2X128";
20101 case X86ISD::VPERMV: return "X86ISD::VPERMV";
20102 case X86ISD::VPERMV3: return "X86ISD::VPERMV3";
20103 case X86ISD::VPERMIV3: return "X86ISD::VPERMIV3";
20104 case X86ISD::VPERMI: return "X86ISD::VPERMI";
20105 case X86ISD::VPTERNLOG: return "X86ISD::VPTERNLOG";
20106 case X86ISD::VFIXUPIMM: return "X86ISD::VFIXUPIMM";
20107 case X86ISD::VRANGE: return "X86ISD::VRANGE";
20108 case X86ISD::PMULUDQ: return "X86ISD::PMULUDQ";
20109 case X86ISD::PMULDQ: return "X86ISD::PMULDQ";
20110 case X86ISD::PSADBW: return "X86ISD::PSADBW";
20111 case X86ISD::DBPSADBW: return "X86ISD::DBPSADBW";
20112 case X86ISD::VASTART_SAVE_XMM_REGS: return "X86ISD::VASTART_SAVE_XMM_REGS";
20113 case X86ISD::VAARG_64: return "X86ISD::VAARG_64";
20114 case X86ISD::WIN_ALLOCA: return "X86ISD::WIN_ALLOCA";
20115 case X86ISD::MEMBARRIER: return "X86ISD::MEMBARRIER";
20116 case X86ISD::MFENCE: return "X86ISD::MFENCE";
20117 case X86ISD::SFENCE: return "X86ISD::SFENCE";
20118 case X86ISD::LFENCE: return "X86ISD::LFENCE";
20119 case X86ISD::SEG_ALLOCA: return "X86ISD::SEG_ALLOCA";
20120 case X86ISD::SAHF: return "X86ISD::SAHF";
20121 case X86ISD::RDRAND: return "X86ISD::RDRAND";
20122 case X86ISD::RDSEED: return "X86ISD::RDSEED";
20123 case X86ISD::VPMADDUBSW: return "X86ISD::VPMADDUBSW";
20124 case X86ISD::VPMADDWD: return "X86ISD::VPMADDWD";
20125 case X86ISD::VPROT: return "X86ISD::VPROT";
20126 case X86ISD::VPROTI: return "X86ISD::VPROTI";
20127 case X86ISD::VPSHA: return "X86ISD::VPSHA";
20128 case X86ISD::VPSHL: return "X86ISD::VPSHL";
20129 case X86ISD::VPCOM: return "X86ISD::VPCOM";
20130 case X86ISD::VPCOMU: return "X86ISD::VPCOMU";
20131 case X86ISD::FMADD: return "X86ISD::FMADD";
20132 case X86ISD::FMSUB: return "X86ISD::FMSUB";
20133 case X86ISD::FNMADD: return "X86ISD::FNMADD";
20134 case X86ISD::FNMSUB: return "X86ISD::FNMSUB";
20135 case X86ISD::FMADDSUB: return "X86ISD::FMADDSUB";
20136 case X86ISD::FMSUBADD: return "X86ISD::FMSUBADD";
20137 case X86ISD::FMADD_RND: return "X86ISD::FMADD_RND";
20138 case X86ISD::FNMADD_RND: return "X86ISD::FNMADD_RND";
20139 case X86ISD::FMSUB_RND: return "X86ISD::FMSUB_RND";
20140 case X86ISD::FNMSUB_RND: return "X86ISD::FNMSUB_RND";
20141 case X86ISD::FMADDSUB_RND: return "X86ISD::FMADDSUB_RND";
20142 case X86ISD::FMSUBADD_RND: return "X86ISD::FMSUBADD_RND";
20143 case X86ISD::VRNDSCALE: return "X86ISD::VRNDSCALE";
20144 case X86ISD::VREDUCE: return "X86ISD::VREDUCE";
20145 case X86ISD::VGETMANT: return "X86ISD::VGETMANT";
20146 case X86ISD::PCMPESTRI: return "X86ISD::PCMPESTRI";
20147 case X86ISD::PCMPISTRI: return "X86ISD::PCMPISTRI";
20148 case X86ISD::XTEST: return "X86ISD::XTEST";
20149 case X86ISD::COMPRESS: return "X86ISD::COMPRESS";
20150 case X86ISD::EXPAND: return "X86ISD::EXPAND";
20151 case X86ISD::SELECT: return "X86ISD::SELECT";
20152 case X86ISD::ADDSUB: return "X86ISD::ADDSUB";
20153 case X86ISD::RCP28: return "X86ISD::RCP28";
20154 case X86ISD::EXP2: return "X86ISD::EXP2";
20155 case X86ISD::RSQRT28: return "X86ISD::RSQRT28";
20156 case X86ISD::FADD_RND: return "X86ISD::FADD_RND";
20157 case X86ISD::FSUB_RND: return "X86ISD::FSUB_RND";
20158 case X86ISD::FMUL_RND: return "X86ISD::FMUL_RND";
20159 case X86ISD::FDIV_RND: return "X86ISD::FDIV_RND";
20160 case X86ISD::FSQRT_RND: return "X86ISD::FSQRT_RND";
20161 case X86ISD::FGETEXP_RND: return "X86ISD::FGETEXP_RND";
20162 case X86ISD::SCALEF: return "X86ISD::SCALEF";
20163 case X86ISD::ADDS: return "X86ISD::ADDS";
20164 case X86ISD::SUBS: return "X86ISD::SUBS";
20165 case X86ISD::AVG: return "X86ISD::AVG";
20166 case X86ISD::MULHRS: return "X86ISD::MULHRS";
20167 case X86ISD::SINT_TO_FP_RND: return "X86ISD::SINT_TO_FP_RND";
20168 case X86ISD::UINT_TO_FP_RND: return "X86ISD::UINT_TO_FP_RND";
20169 case X86ISD::FP_TO_SINT_RND: return "X86ISD::FP_TO_SINT_RND";
20170 case X86ISD::FP_TO_UINT_RND: return "X86ISD::FP_TO_UINT_RND";
20171 case X86ISD::VFPCLASS: return "X86ISD::VFPCLASS";
20176 // isLegalAddressingMode - Return true if the addressing mode represented
20177 // by AM is legal for this target, for a load/store of the specified type.
20178 bool X86TargetLowering::isLegalAddressingMode(const DataLayout &DL,
20179 const AddrMode &AM, Type *Ty,
20180 unsigned AS) const {
20181 // X86 supports extremely general addressing modes.
20182 CodeModel::Model M = getTargetMachine().getCodeModel();
20183 Reloc::Model R = getTargetMachine().getRelocationModel();
20185 // X86 allows a sign-extended 32-bit immediate field as a displacement.
20186 if (!X86::isOffsetSuitableForCodeModel(AM.BaseOffs, M, AM.BaseGV != nullptr))
20191 Subtarget->ClassifyGlobalReference(AM.BaseGV, getTargetMachine());
20193 // If a reference to this global requires an extra load, we can't fold it.
20194 if (isGlobalStubReference(GVFlags))
20197 // If BaseGV requires a register for the PIC base, we cannot also have a
20198 // BaseReg specified.
20199 if (AM.HasBaseReg && isGlobalRelativeToPICBase(GVFlags))
20202 // If lower 4G is not available, then we must use rip-relative addressing.
20203 if ((M != CodeModel::Small || R != Reloc::Static) &&
20204 Subtarget->is64Bit() && (AM.BaseOffs || AM.Scale > 1))
20208 switch (AM.Scale) {
20214 // These scales always work.
20219 // These scales are formed with basereg+scalereg. Only accept if there is
20224 default: // Other stuff never works.
20231 bool X86TargetLowering::isVectorShiftByScalarCheap(Type *Ty) const {
20232 unsigned Bits = Ty->getScalarSizeInBits();
20234 // 8-bit shifts are always expensive, but versions with a scalar amount aren't
20235 // particularly cheaper than those without.
20239 // On AVX2 there are new vpsllv[dq] instructions (and other shifts), that make
20240 // variable shifts just as cheap as scalar ones.
20241 if (Subtarget->hasInt256() && (Bits == 32 || Bits == 64))
20244 // Otherwise, it's significantly cheaper to shift by a scalar amount than by a
20245 // fully general vector.
20249 bool X86TargetLowering::isTruncateFree(Type *Ty1, Type *Ty2) const {
20250 if (!Ty1->isIntegerTy() || !Ty2->isIntegerTy())
20252 unsigned NumBits1 = Ty1->getPrimitiveSizeInBits();
20253 unsigned NumBits2 = Ty2->getPrimitiveSizeInBits();
20254 return NumBits1 > NumBits2;
20257 bool X86TargetLowering::allowTruncateForTailCall(Type *Ty1, Type *Ty2) const {
20258 if (!Ty1->isIntegerTy() || !Ty2->isIntegerTy())
20261 if (!isTypeLegal(EVT::getEVT(Ty1)))
20264 assert(Ty1->getPrimitiveSizeInBits() <= 64 && "i128 is probably not a noop");
20266 // Assuming the caller doesn't have a zeroext or signext return parameter,
20267 // truncation all the way down to i1 is valid.
20271 bool X86TargetLowering::isLegalICmpImmediate(int64_t Imm) const {
20272 return isInt<32>(Imm);
20275 bool X86TargetLowering::isLegalAddImmediate(int64_t Imm) const {
20276 // Can also use sub to handle negated immediates.
20277 return isInt<32>(Imm);
20280 bool X86TargetLowering::isTruncateFree(EVT VT1, EVT VT2) const {
20281 if (!VT1.isInteger() || !VT2.isInteger())
20283 unsigned NumBits1 = VT1.getSizeInBits();
20284 unsigned NumBits2 = VT2.getSizeInBits();
20285 return NumBits1 > NumBits2;
20288 bool X86TargetLowering::isZExtFree(Type *Ty1, Type *Ty2) const {
20289 // x86-64 implicitly zero-extends 32-bit results in 64-bit registers.
20290 return Ty1->isIntegerTy(32) && Ty2->isIntegerTy(64) && Subtarget->is64Bit();
20293 bool X86TargetLowering::isZExtFree(EVT VT1, EVT VT2) const {
20294 // x86-64 implicitly zero-extends 32-bit results in 64-bit registers.
20295 return VT1 == MVT::i32 && VT2 == MVT::i64 && Subtarget->is64Bit();
20298 bool X86TargetLowering::isZExtFree(SDValue Val, EVT VT2) const {
20299 EVT VT1 = Val.getValueType();
20300 if (isZExtFree(VT1, VT2))
20303 if (Val.getOpcode() != ISD::LOAD)
20306 if (!VT1.isSimple() || !VT1.isInteger() ||
20307 !VT2.isSimple() || !VT2.isInteger())
20310 switch (VT1.getSimpleVT().SimpleTy) {
20315 // X86 has 8, 16, and 32-bit zero-extending loads.
20322 bool X86TargetLowering::isVectorLoadExtDesirable(SDValue) const { return true; }
20325 X86TargetLowering::isFMAFasterThanFMulAndFAdd(EVT VT) const {
20326 if (!(Subtarget->hasFMA() || Subtarget->hasFMA4() || Subtarget->hasAVX512()))
20329 VT = VT.getScalarType();
20331 if (!VT.isSimple())
20334 switch (VT.getSimpleVT().SimpleTy) {
20345 bool X86TargetLowering::isNarrowingProfitable(EVT VT1, EVT VT2) const {
20346 // i16 instructions are longer (0x66 prefix) and potentially slower.
20347 return !(VT1 == MVT::i32 && VT2 == MVT::i16);
20350 /// isShuffleMaskLegal - Targets can use this to indicate that they only
20351 /// support *some* VECTOR_SHUFFLE operations, those with specific masks.
20352 /// By default, if a target supports the VECTOR_SHUFFLE node, all mask values
20353 /// are assumed to be legal.
20355 X86TargetLowering::isShuffleMaskLegal(const SmallVectorImpl<int> &M,
20357 if (!VT.isSimple())
20360 // Not for i1 vectors
20361 if (VT.getSimpleVT().getScalarType() == MVT::i1)
20364 // Very little shuffling can be done for 64-bit vectors right now.
20365 if (VT.getSimpleVT().getSizeInBits() == 64)
20368 // We only care that the types being shuffled are legal. The lowering can
20369 // handle any possible shuffle mask that results.
20370 return isTypeLegal(VT.getSimpleVT());
20374 X86TargetLowering::isVectorClearMaskLegal(const SmallVectorImpl<int> &Mask,
20376 // Just delegate to the generic legality, clear masks aren't special.
20377 return isShuffleMaskLegal(Mask, VT);
20380 //===----------------------------------------------------------------------===//
20381 // X86 Scheduler Hooks
20382 //===----------------------------------------------------------------------===//
20384 /// Utility function to emit xbegin specifying the start of an RTM region.
20385 static MachineBasicBlock *EmitXBegin(MachineInstr *MI, MachineBasicBlock *MBB,
20386 const TargetInstrInfo *TII) {
20387 DebugLoc DL = MI->getDebugLoc();
20389 const BasicBlock *BB = MBB->getBasicBlock();
20390 MachineFunction::iterator I = ++MBB->getIterator();
20392 // For the v = xbegin(), we generate
20403 MachineBasicBlock *thisMBB = MBB;
20404 MachineFunction *MF = MBB->getParent();
20405 MachineBasicBlock *mainMBB = MF->CreateMachineBasicBlock(BB);
20406 MachineBasicBlock *sinkMBB = MF->CreateMachineBasicBlock(BB);
20407 MF->insert(I, mainMBB);
20408 MF->insert(I, sinkMBB);
20410 // Transfer the remainder of BB and its successor edges to sinkMBB.
20411 sinkMBB->splice(sinkMBB->begin(), MBB,
20412 std::next(MachineBasicBlock::iterator(MI)), MBB->end());
20413 sinkMBB->transferSuccessorsAndUpdatePHIs(MBB);
20417 // # fallthrough to mainMBB
20418 // # abortion to sinkMBB
20419 BuildMI(thisMBB, DL, TII->get(X86::XBEGIN_4)).addMBB(sinkMBB);
20420 thisMBB->addSuccessor(mainMBB);
20421 thisMBB->addSuccessor(sinkMBB);
20425 BuildMI(mainMBB, DL, TII->get(X86::MOV32ri), X86::EAX).addImm(-1);
20426 mainMBB->addSuccessor(sinkMBB);
20429 // EAX is live into the sinkMBB
20430 sinkMBB->addLiveIn(X86::EAX);
20431 BuildMI(*sinkMBB, sinkMBB->begin(), DL,
20432 TII->get(TargetOpcode::COPY), MI->getOperand(0).getReg())
20435 MI->eraseFromParent();
20439 // FIXME: When we get size specific XMM0 registers, i.e. XMM0_V16I8
20440 // or XMM0_V32I8 in AVX all of this code can be replaced with that
20441 // in the .td file.
20442 static MachineBasicBlock *EmitPCMPSTRM(MachineInstr *MI, MachineBasicBlock *BB,
20443 const TargetInstrInfo *TII) {
20445 switch (MI->getOpcode()) {
20446 default: llvm_unreachable("illegal opcode!");
20447 case X86::PCMPISTRM128REG: Opc = X86::PCMPISTRM128rr; break;
20448 case X86::VPCMPISTRM128REG: Opc = X86::VPCMPISTRM128rr; break;
20449 case X86::PCMPISTRM128MEM: Opc = X86::PCMPISTRM128rm; break;
20450 case X86::VPCMPISTRM128MEM: Opc = X86::VPCMPISTRM128rm; break;
20451 case X86::PCMPESTRM128REG: Opc = X86::PCMPESTRM128rr; break;
20452 case X86::VPCMPESTRM128REG: Opc = X86::VPCMPESTRM128rr; break;
20453 case X86::PCMPESTRM128MEM: Opc = X86::PCMPESTRM128rm; break;
20454 case X86::VPCMPESTRM128MEM: Opc = X86::VPCMPESTRM128rm; break;
20457 DebugLoc dl = MI->getDebugLoc();
20458 MachineInstrBuilder MIB = BuildMI(*BB, MI, dl, TII->get(Opc));
20460 unsigned NumArgs = MI->getNumOperands();
20461 for (unsigned i = 1; i < NumArgs; ++i) {
20462 MachineOperand &Op = MI->getOperand(i);
20463 if (!(Op.isReg() && Op.isImplicit()))
20464 MIB.addOperand(Op);
20466 if (MI->hasOneMemOperand())
20467 MIB->setMemRefs(MI->memoperands_begin(), MI->memoperands_end());
20469 BuildMI(*BB, MI, dl,
20470 TII->get(TargetOpcode::COPY), MI->getOperand(0).getReg())
20471 .addReg(X86::XMM0);
20473 MI->eraseFromParent();
20477 // FIXME: Custom handling because TableGen doesn't support multiple implicit
20478 // defs in an instruction pattern
20479 static MachineBasicBlock *EmitPCMPSTRI(MachineInstr *MI, MachineBasicBlock *BB,
20480 const TargetInstrInfo *TII) {
20482 switch (MI->getOpcode()) {
20483 default: llvm_unreachable("illegal opcode!");
20484 case X86::PCMPISTRIREG: Opc = X86::PCMPISTRIrr; break;
20485 case X86::VPCMPISTRIREG: Opc = X86::VPCMPISTRIrr; break;
20486 case X86::PCMPISTRIMEM: Opc = X86::PCMPISTRIrm; break;
20487 case X86::VPCMPISTRIMEM: Opc = X86::VPCMPISTRIrm; break;
20488 case X86::PCMPESTRIREG: Opc = X86::PCMPESTRIrr; break;
20489 case X86::VPCMPESTRIREG: Opc = X86::VPCMPESTRIrr; break;
20490 case X86::PCMPESTRIMEM: Opc = X86::PCMPESTRIrm; break;
20491 case X86::VPCMPESTRIMEM: Opc = X86::VPCMPESTRIrm; break;
20494 DebugLoc dl = MI->getDebugLoc();
20495 MachineInstrBuilder MIB = BuildMI(*BB, MI, dl, TII->get(Opc));
20497 unsigned NumArgs = MI->getNumOperands(); // remove the results
20498 for (unsigned i = 1; i < NumArgs; ++i) {
20499 MachineOperand &Op = MI->getOperand(i);
20500 if (!(Op.isReg() && Op.isImplicit()))
20501 MIB.addOperand(Op);
20503 if (MI->hasOneMemOperand())
20504 MIB->setMemRefs(MI->memoperands_begin(), MI->memoperands_end());
20506 BuildMI(*BB, MI, dl,
20507 TII->get(TargetOpcode::COPY), MI->getOperand(0).getReg())
20510 MI->eraseFromParent();
20514 static MachineBasicBlock *EmitMonitor(MachineInstr *MI, MachineBasicBlock *BB,
20515 const X86Subtarget *Subtarget) {
20516 DebugLoc dl = MI->getDebugLoc();
20517 const TargetInstrInfo *TII = Subtarget->getInstrInfo();
20518 // Address into RAX/EAX, other two args into ECX, EDX.
20519 unsigned MemOpc = Subtarget->is64Bit() ? X86::LEA64r : X86::LEA32r;
20520 unsigned MemReg = Subtarget->is64Bit() ? X86::RAX : X86::EAX;
20521 MachineInstrBuilder MIB = BuildMI(*BB, MI, dl, TII->get(MemOpc), MemReg);
20522 for (int i = 0; i < X86::AddrNumOperands; ++i)
20523 MIB.addOperand(MI->getOperand(i));
20525 unsigned ValOps = X86::AddrNumOperands;
20526 BuildMI(*BB, MI, dl, TII->get(TargetOpcode::COPY), X86::ECX)
20527 .addReg(MI->getOperand(ValOps).getReg());
20528 BuildMI(*BB, MI, dl, TII->get(TargetOpcode::COPY), X86::EDX)
20529 .addReg(MI->getOperand(ValOps+1).getReg());
20531 // The instruction doesn't actually take any operands though.
20532 BuildMI(*BB, MI, dl, TII->get(X86::MONITORrrr));
20534 MI->eraseFromParent(); // The pseudo is gone now.
20538 MachineBasicBlock *
20539 X86TargetLowering::EmitVAARG64WithCustomInserter(MachineInstr *MI,
20540 MachineBasicBlock *MBB) const {
20541 // Emit va_arg instruction on X86-64.
20543 // Operands to this pseudo-instruction:
20544 // 0 ) Output : destination address (reg)
20545 // 1-5) Input : va_list address (addr, i64mem)
20546 // 6 ) ArgSize : Size (in bytes) of vararg type
20547 // 7 ) ArgMode : 0=overflow only, 1=use gp_offset, 2=use fp_offset
20548 // 8 ) Align : Alignment of type
20549 // 9 ) EFLAGS (implicit-def)
20551 assert(MI->getNumOperands() == 10 && "VAARG_64 should have 10 operands!");
20552 static_assert(X86::AddrNumOperands == 5,
20553 "VAARG_64 assumes 5 address operands");
20555 unsigned DestReg = MI->getOperand(0).getReg();
20556 MachineOperand &Base = MI->getOperand(1);
20557 MachineOperand &Scale = MI->getOperand(2);
20558 MachineOperand &Index = MI->getOperand(3);
20559 MachineOperand &Disp = MI->getOperand(4);
20560 MachineOperand &Segment = MI->getOperand(5);
20561 unsigned ArgSize = MI->getOperand(6).getImm();
20562 unsigned ArgMode = MI->getOperand(7).getImm();
20563 unsigned Align = MI->getOperand(8).getImm();
20565 // Memory Reference
20566 assert(MI->hasOneMemOperand() && "Expected VAARG_64 to have one memoperand");
20567 MachineInstr::mmo_iterator MMOBegin = MI->memoperands_begin();
20568 MachineInstr::mmo_iterator MMOEnd = MI->memoperands_end();
20570 // Machine Information
20571 const TargetInstrInfo *TII = Subtarget->getInstrInfo();
20572 MachineRegisterInfo &MRI = MBB->getParent()->getRegInfo();
20573 const TargetRegisterClass *AddrRegClass = getRegClassFor(MVT::i64);
20574 const TargetRegisterClass *OffsetRegClass = getRegClassFor(MVT::i32);
20575 DebugLoc DL = MI->getDebugLoc();
20577 // struct va_list {
20580 // i64 overflow_area (address)
20581 // i64 reg_save_area (address)
20583 // sizeof(va_list) = 24
20584 // alignment(va_list) = 8
20586 unsigned TotalNumIntRegs = 6;
20587 unsigned TotalNumXMMRegs = 8;
20588 bool UseGPOffset = (ArgMode == 1);
20589 bool UseFPOffset = (ArgMode == 2);
20590 unsigned MaxOffset = TotalNumIntRegs * 8 +
20591 (UseFPOffset ? TotalNumXMMRegs * 16 : 0);
20593 /* Align ArgSize to a multiple of 8 */
20594 unsigned ArgSizeA8 = (ArgSize + 7) & ~7;
20595 bool NeedsAlign = (Align > 8);
20597 MachineBasicBlock *thisMBB = MBB;
20598 MachineBasicBlock *overflowMBB;
20599 MachineBasicBlock *offsetMBB;
20600 MachineBasicBlock *endMBB;
20602 unsigned OffsetDestReg = 0; // Argument address computed by offsetMBB
20603 unsigned OverflowDestReg = 0; // Argument address computed by overflowMBB
20604 unsigned OffsetReg = 0;
20606 if (!UseGPOffset && !UseFPOffset) {
20607 // If we only pull from the overflow region, we don't create a branch.
20608 // We don't need to alter control flow.
20609 OffsetDestReg = 0; // unused
20610 OverflowDestReg = DestReg;
20612 offsetMBB = nullptr;
20613 overflowMBB = thisMBB;
20616 // First emit code to check if gp_offset (or fp_offset) is below the bound.
20617 // If so, pull the argument from reg_save_area. (branch to offsetMBB)
20618 // If not, pull from overflow_area. (branch to overflowMBB)
20623 // offsetMBB overflowMBB
20628 // Registers for the PHI in endMBB
20629 OffsetDestReg = MRI.createVirtualRegister(AddrRegClass);
20630 OverflowDestReg = MRI.createVirtualRegister(AddrRegClass);
20632 const BasicBlock *LLVM_BB = MBB->getBasicBlock();
20633 MachineFunction *MF = MBB->getParent();
20634 overflowMBB = MF->CreateMachineBasicBlock(LLVM_BB);
20635 offsetMBB = MF->CreateMachineBasicBlock(LLVM_BB);
20636 endMBB = MF->CreateMachineBasicBlock(LLVM_BB);
20638 MachineFunction::iterator MBBIter = ++MBB->getIterator();
20640 // Insert the new basic blocks
20641 MF->insert(MBBIter, offsetMBB);
20642 MF->insert(MBBIter, overflowMBB);
20643 MF->insert(MBBIter, endMBB);
20645 // Transfer the remainder of MBB and its successor edges to endMBB.
20646 endMBB->splice(endMBB->begin(), thisMBB,
20647 std::next(MachineBasicBlock::iterator(MI)), thisMBB->end());
20648 endMBB->transferSuccessorsAndUpdatePHIs(thisMBB);
20650 // Make offsetMBB and overflowMBB successors of thisMBB
20651 thisMBB->addSuccessor(offsetMBB);
20652 thisMBB->addSuccessor(overflowMBB);
20654 // endMBB is a successor of both offsetMBB and overflowMBB
20655 offsetMBB->addSuccessor(endMBB);
20656 overflowMBB->addSuccessor(endMBB);
20658 // Load the offset value into a register
20659 OffsetReg = MRI.createVirtualRegister(OffsetRegClass);
20660 BuildMI(thisMBB, DL, TII->get(X86::MOV32rm), OffsetReg)
20664 .addDisp(Disp, UseFPOffset ? 4 : 0)
20665 .addOperand(Segment)
20666 .setMemRefs(MMOBegin, MMOEnd);
20668 // Check if there is enough room left to pull this argument.
20669 BuildMI(thisMBB, DL, TII->get(X86::CMP32ri))
20671 .addImm(MaxOffset + 8 - ArgSizeA8);
20673 // Branch to "overflowMBB" if offset >= max
20674 // Fall through to "offsetMBB" otherwise
20675 BuildMI(thisMBB, DL, TII->get(X86::GetCondBranchFromCond(X86::COND_AE)))
20676 .addMBB(overflowMBB);
20679 // In offsetMBB, emit code to use the reg_save_area.
20681 assert(OffsetReg != 0);
20683 // Read the reg_save_area address.
20684 unsigned RegSaveReg = MRI.createVirtualRegister(AddrRegClass);
20685 BuildMI(offsetMBB, DL, TII->get(X86::MOV64rm), RegSaveReg)
20690 .addOperand(Segment)
20691 .setMemRefs(MMOBegin, MMOEnd);
20693 // Zero-extend the offset
20694 unsigned OffsetReg64 = MRI.createVirtualRegister(AddrRegClass);
20695 BuildMI(offsetMBB, DL, TII->get(X86::SUBREG_TO_REG), OffsetReg64)
20698 .addImm(X86::sub_32bit);
20700 // Add the offset to the reg_save_area to get the final address.
20701 BuildMI(offsetMBB, DL, TII->get(X86::ADD64rr), OffsetDestReg)
20702 .addReg(OffsetReg64)
20703 .addReg(RegSaveReg);
20705 // Compute the offset for the next argument
20706 unsigned NextOffsetReg = MRI.createVirtualRegister(OffsetRegClass);
20707 BuildMI(offsetMBB, DL, TII->get(X86::ADD32ri), NextOffsetReg)
20709 .addImm(UseFPOffset ? 16 : 8);
20711 // Store it back into the va_list.
20712 BuildMI(offsetMBB, DL, TII->get(X86::MOV32mr))
20716 .addDisp(Disp, UseFPOffset ? 4 : 0)
20717 .addOperand(Segment)
20718 .addReg(NextOffsetReg)
20719 .setMemRefs(MMOBegin, MMOEnd);
20722 BuildMI(offsetMBB, DL, TII->get(X86::JMP_1))
20727 // Emit code to use overflow area
20730 // Load the overflow_area address into a register.
20731 unsigned OverflowAddrReg = MRI.createVirtualRegister(AddrRegClass);
20732 BuildMI(overflowMBB, DL, TII->get(X86::MOV64rm), OverflowAddrReg)
20737 .addOperand(Segment)
20738 .setMemRefs(MMOBegin, MMOEnd);
20740 // If we need to align it, do so. Otherwise, just copy the address
20741 // to OverflowDestReg.
20743 // Align the overflow address
20744 assert((Align & (Align-1)) == 0 && "Alignment must be a power of 2");
20745 unsigned TmpReg = MRI.createVirtualRegister(AddrRegClass);
20747 // aligned_addr = (addr + (align-1)) & ~(align-1)
20748 BuildMI(overflowMBB, DL, TII->get(X86::ADD64ri32), TmpReg)
20749 .addReg(OverflowAddrReg)
20752 BuildMI(overflowMBB, DL, TII->get(X86::AND64ri32), OverflowDestReg)
20754 .addImm(~(uint64_t)(Align-1));
20756 BuildMI(overflowMBB, DL, TII->get(TargetOpcode::COPY), OverflowDestReg)
20757 .addReg(OverflowAddrReg);
20760 // Compute the next overflow address after this argument.
20761 // (the overflow address should be kept 8-byte aligned)
20762 unsigned NextAddrReg = MRI.createVirtualRegister(AddrRegClass);
20763 BuildMI(overflowMBB, DL, TII->get(X86::ADD64ri32), NextAddrReg)
20764 .addReg(OverflowDestReg)
20765 .addImm(ArgSizeA8);
20767 // Store the new overflow address.
20768 BuildMI(overflowMBB, DL, TII->get(X86::MOV64mr))
20773 .addOperand(Segment)
20774 .addReg(NextAddrReg)
20775 .setMemRefs(MMOBegin, MMOEnd);
20777 // If we branched, emit the PHI to the front of endMBB.
20779 BuildMI(*endMBB, endMBB->begin(), DL,
20780 TII->get(X86::PHI), DestReg)
20781 .addReg(OffsetDestReg).addMBB(offsetMBB)
20782 .addReg(OverflowDestReg).addMBB(overflowMBB);
20785 // Erase the pseudo instruction
20786 MI->eraseFromParent();
20791 MachineBasicBlock *
20792 X86TargetLowering::EmitVAStartSaveXMMRegsWithCustomInserter(
20794 MachineBasicBlock *MBB) const {
20795 // Emit code to save XMM registers to the stack. The ABI says that the
20796 // number of registers to save is given in %al, so it's theoretically
20797 // possible to do an indirect jump trick to avoid saving all of them,
20798 // however this code takes a simpler approach and just executes all
20799 // of the stores if %al is non-zero. It's less code, and it's probably
20800 // easier on the hardware branch predictor, and stores aren't all that
20801 // expensive anyway.
20803 // Create the new basic blocks. One block contains all the XMM stores,
20804 // and one block is the final destination regardless of whether any
20805 // stores were performed.
20806 const BasicBlock *LLVM_BB = MBB->getBasicBlock();
20807 MachineFunction *F = MBB->getParent();
20808 MachineFunction::iterator MBBIter = ++MBB->getIterator();
20809 MachineBasicBlock *XMMSaveMBB = F->CreateMachineBasicBlock(LLVM_BB);
20810 MachineBasicBlock *EndMBB = F->CreateMachineBasicBlock(LLVM_BB);
20811 F->insert(MBBIter, XMMSaveMBB);
20812 F->insert(MBBIter, EndMBB);
20814 // Transfer the remainder of MBB and its successor edges to EndMBB.
20815 EndMBB->splice(EndMBB->begin(), MBB,
20816 std::next(MachineBasicBlock::iterator(MI)), MBB->end());
20817 EndMBB->transferSuccessorsAndUpdatePHIs(MBB);
20819 // The original block will now fall through to the XMM save block.
20820 MBB->addSuccessor(XMMSaveMBB);
20821 // The XMMSaveMBB will fall through to the end block.
20822 XMMSaveMBB->addSuccessor(EndMBB);
20824 // Now add the instructions.
20825 const TargetInstrInfo *TII = Subtarget->getInstrInfo();
20826 DebugLoc DL = MI->getDebugLoc();
20828 unsigned CountReg = MI->getOperand(0).getReg();
20829 int64_t RegSaveFrameIndex = MI->getOperand(1).getImm();
20830 int64_t VarArgsFPOffset = MI->getOperand(2).getImm();
20832 if (!Subtarget->isCallingConvWin64(F->getFunction()->getCallingConv())) {
20833 // If %al is 0, branch around the XMM save block.
20834 BuildMI(MBB, DL, TII->get(X86::TEST8rr)).addReg(CountReg).addReg(CountReg);
20835 BuildMI(MBB, DL, TII->get(X86::JE_1)).addMBB(EndMBB);
20836 MBB->addSuccessor(EndMBB);
20839 // Make sure the last operand is EFLAGS, which gets clobbered by the branch
20840 // that was just emitted, but clearly shouldn't be "saved".
20841 assert((MI->getNumOperands() <= 3 ||
20842 !MI->getOperand(MI->getNumOperands() - 1).isReg() ||
20843 MI->getOperand(MI->getNumOperands() - 1).getReg() == X86::EFLAGS)
20844 && "Expected last argument to be EFLAGS");
20845 unsigned MOVOpc = Subtarget->hasFp256() ? X86::VMOVAPSmr : X86::MOVAPSmr;
20846 // In the XMM save block, save all the XMM argument registers.
20847 for (int i = 3, e = MI->getNumOperands() - 1; i != e; ++i) {
20848 int64_t Offset = (i - 3) * 16 + VarArgsFPOffset;
20849 MachineMemOperand *MMO = F->getMachineMemOperand(
20850 MachinePointerInfo::getFixedStack(*F, RegSaveFrameIndex, Offset),
20851 MachineMemOperand::MOStore,
20852 /*Size=*/16, /*Align=*/16);
20853 BuildMI(XMMSaveMBB, DL, TII->get(MOVOpc))
20854 .addFrameIndex(RegSaveFrameIndex)
20855 .addImm(/*Scale=*/1)
20856 .addReg(/*IndexReg=*/0)
20857 .addImm(/*Disp=*/Offset)
20858 .addReg(/*Segment=*/0)
20859 .addReg(MI->getOperand(i).getReg())
20860 .addMemOperand(MMO);
20863 MI->eraseFromParent(); // The pseudo instruction is gone now.
20868 // The EFLAGS operand of SelectItr might be missing a kill marker
20869 // because there were multiple uses of EFLAGS, and ISel didn't know
20870 // which to mark. Figure out whether SelectItr should have had a
20871 // kill marker, and set it if it should. Returns the correct kill
20873 static bool checkAndUpdateEFLAGSKill(MachineBasicBlock::iterator SelectItr,
20874 MachineBasicBlock* BB,
20875 const TargetRegisterInfo* TRI) {
20876 // Scan forward through BB for a use/def of EFLAGS.
20877 MachineBasicBlock::iterator miI(std::next(SelectItr));
20878 for (MachineBasicBlock::iterator miE = BB->end(); miI != miE; ++miI) {
20879 const MachineInstr& mi = *miI;
20880 if (mi.readsRegister(X86::EFLAGS))
20882 if (mi.definesRegister(X86::EFLAGS))
20883 break; // Should have kill-flag - update below.
20886 // If we hit the end of the block, check whether EFLAGS is live into a
20888 if (miI == BB->end()) {
20889 for (MachineBasicBlock::succ_iterator sItr = BB->succ_begin(),
20890 sEnd = BB->succ_end();
20891 sItr != sEnd; ++sItr) {
20892 MachineBasicBlock* succ = *sItr;
20893 if (succ->isLiveIn(X86::EFLAGS))
20898 // We found a def, or hit the end of the basic block and EFLAGS wasn't live
20899 // out. SelectMI should have a kill flag on EFLAGS.
20900 SelectItr->addRegisterKilled(X86::EFLAGS, TRI);
20904 // Return true if it is OK for this CMOV pseudo-opcode to be cascaded
20905 // together with other CMOV pseudo-opcodes into a single basic-block with
20906 // conditional jump around it.
20907 static bool isCMOVPseudo(MachineInstr *MI) {
20908 switch (MI->getOpcode()) {
20909 case X86::CMOV_FR32:
20910 case X86::CMOV_FR64:
20911 case X86::CMOV_GR8:
20912 case X86::CMOV_GR16:
20913 case X86::CMOV_GR32:
20914 case X86::CMOV_RFP32:
20915 case X86::CMOV_RFP64:
20916 case X86::CMOV_RFP80:
20917 case X86::CMOV_V2F64:
20918 case X86::CMOV_V2I64:
20919 case X86::CMOV_V4F32:
20920 case X86::CMOV_V4F64:
20921 case X86::CMOV_V4I64:
20922 case X86::CMOV_V16F32:
20923 case X86::CMOV_V8F32:
20924 case X86::CMOV_V8F64:
20925 case X86::CMOV_V8I64:
20926 case X86::CMOV_V8I1:
20927 case X86::CMOV_V16I1:
20928 case X86::CMOV_V32I1:
20929 case X86::CMOV_V64I1:
20937 MachineBasicBlock *
20938 X86TargetLowering::EmitLoweredSelect(MachineInstr *MI,
20939 MachineBasicBlock *BB) const {
20940 const TargetInstrInfo *TII = Subtarget->getInstrInfo();
20941 DebugLoc DL = MI->getDebugLoc();
20943 // To "insert" a SELECT_CC instruction, we actually have to insert the
20944 // diamond control-flow pattern. The incoming instruction knows the
20945 // destination vreg to set, the condition code register to branch on, the
20946 // true/false values to select between, and a branch opcode to use.
20947 const BasicBlock *LLVM_BB = BB->getBasicBlock();
20948 MachineFunction::iterator It = ++BB->getIterator();
20953 // cmpTY ccX, r1, r2
20955 // fallthrough --> copy0MBB
20956 MachineBasicBlock *thisMBB = BB;
20957 MachineFunction *F = BB->getParent();
20959 // This code lowers all pseudo-CMOV instructions. Generally it lowers these
20960 // as described above, by inserting a BB, and then making a PHI at the join
20961 // point to select the true and false operands of the CMOV in the PHI.
20963 // The code also handles two different cases of multiple CMOV opcodes
20967 // In this case, there are multiple CMOVs in a row, all which are based on
20968 // the same condition setting (or the exact opposite condition setting).
20969 // In this case we can lower all the CMOVs using a single inserted BB, and
20970 // then make a number of PHIs at the join point to model the CMOVs. The only
20971 // trickiness here, is that in a case like:
20973 // t2 = CMOV cond1 t1, f1
20974 // t3 = CMOV cond1 t2, f2
20976 // when rewriting this into PHIs, we have to perform some renaming on the
20977 // temps since you cannot have a PHI operand refer to a PHI result earlier
20978 // in the same block. The "simple" but wrong lowering would be:
20980 // t2 = PHI t1(BB1), f1(BB2)
20981 // t3 = PHI t2(BB1), f2(BB2)
20983 // but clearly t2 is not defined in BB1, so that is incorrect. The proper
20984 // renaming is to note that on the path through BB1, t2 is really just a
20985 // copy of t1, and do that renaming, properly generating:
20987 // t2 = PHI t1(BB1), f1(BB2)
20988 // t3 = PHI t1(BB1), f2(BB2)
20990 // Case 2, we lower cascaded CMOVs such as
20992 // (CMOV (CMOV F, T, cc1), T, cc2)
20994 // to two successives branches. For that, we look for another CMOV as the
20995 // following instruction.
20997 // Without this, we would add a PHI between the two jumps, which ends up
20998 // creating a few copies all around. For instance, for
21000 // (sitofp (zext (fcmp une)))
21002 // we would generate:
21004 // ucomiss %xmm1, %xmm0
21005 // movss <1.0f>, %xmm0
21006 // movaps %xmm0, %xmm1
21008 // xorps %xmm1, %xmm1
21011 // movaps %xmm1, %xmm0
21015 // because this custom-inserter would have generated:
21027 // A: X = ...; Y = ...
21029 // C: Z = PHI [X, A], [Y, B]
21031 // E: PHI [X, C], [Z, D]
21033 // If we lower both CMOVs in a single step, we can instead generate:
21045 // A: X = ...; Y = ...
21047 // E: PHI [X, A], [X, C], [Y, D]
21049 // Which, in our sitofp/fcmp example, gives us something like:
21051 // ucomiss %xmm1, %xmm0
21052 // movss <1.0f>, %xmm0
21055 // xorps %xmm0, %xmm0
21059 MachineInstr *CascadedCMOV = nullptr;
21060 MachineInstr *LastCMOV = MI;
21061 X86::CondCode CC = X86::CondCode(MI->getOperand(3).getImm());
21062 X86::CondCode OppCC = X86::GetOppositeBranchCondition(CC);
21063 MachineBasicBlock::iterator NextMIIt =
21064 std::next(MachineBasicBlock::iterator(MI));
21066 // Check for case 1, where there are multiple CMOVs with the same condition
21067 // first. Of the two cases of multiple CMOV lowerings, case 1 reduces the
21068 // number of jumps the most.
21070 if (isCMOVPseudo(MI)) {
21071 // See if we have a string of CMOVS with the same condition.
21072 while (NextMIIt != BB->end() &&
21073 isCMOVPseudo(NextMIIt) &&
21074 (NextMIIt->getOperand(3).getImm() == CC ||
21075 NextMIIt->getOperand(3).getImm() == OppCC)) {
21076 LastCMOV = &*NextMIIt;
21081 // This checks for case 2, but only do this if we didn't already find
21082 // case 1, as indicated by LastCMOV == MI.
21083 if (LastCMOV == MI &&
21084 NextMIIt != BB->end() && NextMIIt->getOpcode() == MI->getOpcode() &&
21085 NextMIIt->getOperand(2).getReg() == MI->getOperand(2).getReg() &&
21086 NextMIIt->getOperand(1).getReg() == MI->getOperand(0).getReg()) {
21087 CascadedCMOV = &*NextMIIt;
21090 MachineBasicBlock *jcc1MBB = nullptr;
21092 // If we have a cascaded CMOV, we lower it to two successive branches to
21093 // the same block. EFLAGS is used by both, so mark it as live in the second.
21094 if (CascadedCMOV) {
21095 jcc1MBB = F->CreateMachineBasicBlock(LLVM_BB);
21096 F->insert(It, jcc1MBB);
21097 jcc1MBB->addLiveIn(X86::EFLAGS);
21100 MachineBasicBlock *copy0MBB = F->CreateMachineBasicBlock(LLVM_BB);
21101 MachineBasicBlock *sinkMBB = F->CreateMachineBasicBlock(LLVM_BB);
21102 F->insert(It, copy0MBB);
21103 F->insert(It, sinkMBB);
21105 // If the EFLAGS register isn't dead in the terminator, then claim that it's
21106 // live into the sink and copy blocks.
21107 const TargetRegisterInfo *TRI = Subtarget->getRegisterInfo();
21109 MachineInstr *LastEFLAGSUser = CascadedCMOV ? CascadedCMOV : LastCMOV;
21110 if (!LastEFLAGSUser->killsRegister(X86::EFLAGS) &&
21111 !checkAndUpdateEFLAGSKill(LastEFLAGSUser, BB, TRI)) {
21112 copy0MBB->addLiveIn(X86::EFLAGS);
21113 sinkMBB->addLiveIn(X86::EFLAGS);
21116 // Transfer the remainder of BB and its successor edges to sinkMBB.
21117 sinkMBB->splice(sinkMBB->begin(), BB,
21118 std::next(MachineBasicBlock::iterator(LastCMOV)), BB->end());
21119 sinkMBB->transferSuccessorsAndUpdatePHIs(BB);
21121 // Add the true and fallthrough blocks as its successors.
21122 if (CascadedCMOV) {
21123 // The fallthrough block may be jcc1MBB, if we have a cascaded CMOV.
21124 BB->addSuccessor(jcc1MBB);
21126 // In that case, jcc1MBB will itself fallthrough the copy0MBB, and
21127 // jump to the sinkMBB.
21128 jcc1MBB->addSuccessor(copy0MBB);
21129 jcc1MBB->addSuccessor(sinkMBB);
21131 BB->addSuccessor(copy0MBB);
21134 // The true block target of the first (or only) branch is always sinkMBB.
21135 BB->addSuccessor(sinkMBB);
21137 // Create the conditional branch instruction.
21138 unsigned Opc = X86::GetCondBranchFromCond(CC);
21139 BuildMI(BB, DL, TII->get(Opc)).addMBB(sinkMBB);
21141 if (CascadedCMOV) {
21142 unsigned Opc2 = X86::GetCondBranchFromCond(
21143 (X86::CondCode)CascadedCMOV->getOperand(3).getImm());
21144 BuildMI(jcc1MBB, DL, TII->get(Opc2)).addMBB(sinkMBB);
21148 // %FalseValue = ...
21149 // # fallthrough to sinkMBB
21150 copy0MBB->addSuccessor(sinkMBB);
21153 // %Result = phi [ %FalseValue, copy0MBB ], [ %TrueValue, thisMBB ]
21155 MachineBasicBlock::iterator MIItBegin = MachineBasicBlock::iterator(MI);
21156 MachineBasicBlock::iterator MIItEnd =
21157 std::next(MachineBasicBlock::iterator(LastCMOV));
21158 MachineBasicBlock::iterator SinkInsertionPoint = sinkMBB->begin();
21159 DenseMap<unsigned, std::pair<unsigned, unsigned>> RegRewriteTable;
21160 MachineInstrBuilder MIB;
21162 // As we are creating the PHIs, we have to be careful if there is more than
21163 // one. Later CMOVs may reference the results of earlier CMOVs, but later
21164 // PHIs have to reference the individual true/false inputs from earlier PHIs.
21165 // That also means that PHI construction must work forward from earlier to
21166 // later, and that the code must maintain a mapping from earlier PHI's
21167 // destination registers, and the registers that went into the PHI.
21169 for (MachineBasicBlock::iterator MIIt = MIItBegin; MIIt != MIItEnd; ++MIIt) {
21170 unsigned DestReg = MIIt->getOperand(0).getReg();
21171 unsigned Op1Reg = MIIt->getOperand(1).getReg();
21172 unsigned Op2Reg = MIIt->getOperand(2).getReg();
21174 // If this CMOV we are generating is the opposite condition from
21175 // the jump we generated, then we have to swap the operands for the
21176 // PHI that is going to be generated.
21177 if (MIIt->getOperand(3).getImm() == OppCC)
21178 std::swap(Op1Reg, Op2Reg);
21180 if (RegRewriteTable.find(Op1Reg) != RegRewriteTable.end())
21181 Op1Reg = RegRewriteTable[Op1Reg].first;
21183 if (RegRewriteTable.find(Op2Reg) != RegRewriteTable.end())
21184 Op2Reg = RegRewriteTable[Op2Reg].second;
21186 MIB = BuildMI(*sinkMBB, SinkInsertionPoint, DL,
21187 TII->get(X86::PHI), DestReg)
21188 .addReg(Op1Reg).addMBB(copy0MBB)
21189 .addReg(Op2Reg).addMBB(thisMBB);
21191 // Add this PHI to the rewrite table.
21192 RegRewriteTable[DestReg] = std::make_pair(Op1Reg, Op2Reg);
21195 // If we have a cascaded CMOV, the second Jcc provides the same incoming
21196 // value as the first Jcc (the True operand of the SELECT_CC/CMOV nodes).
21197 if (CascadedCMOV) {
21198 MIB.addReg(MI->getOperand(2).getReg()).addMBB(jcc1MBB);
21199 // Copy the PHI result to the register defined by the second CMOV.
21200 BuildMI(*sinkMBB, std::next(MachineBasicBlock::iterator(MIB.getInstr())),
21201 DL, TII->get(TargetOpcode::COPY),
21202 CascadedCMOV->getOperand(0).getReg())
21203 .addReg(MI->getOperand(0).getReg());
21204 CascadedCMOV->eraseFromParent();
21207 // Now remove the CMOV(s).
21208 for (MachineBasicBlock::iterator MIIt = MIItBegin; MIIt != MIItEnd; )
21209 (MIIt++)->eraseFromParent();
21214 MachineBasicBlock *
21215 X86TargetLowering::EmitLoweredAtomicFP(MachineInstr *MI,
21216 MachineBasicBlock *BB) const {
21217 // Combine the following atomic floating-point modification pattern:
21218 // a.store(reg OP a.load(acquire), release)
21219 // Transform them into:
21220 // OPss (%gpr), %xmm
21221 // movss %xmm, (%gpr)
21222 // Or sd equivalent for 64-bit operations.
21224 switch (MI->getOpcode()) {
21225 default: llvm_unreachable("unexpected instr type for EmitLoweredAtomicFP");
21226 case X86::RELEASE_FADD32mr: MOp = X86::MOVSSmr; FOp = X86::ADDSSrm; break;
21227 case X86::RELEASE_FADD64mr: MOp = X86::MOVSDmr; FOp = X86::ADDSDrm; break;
21229 const X86InstrInfo *TII = Subtarget->getInstrInfo();
21230 DebugLoc DL = MI->getDebugLoc();
21231 MachineRegisterInfo &MRI = BB->getParent()->getRegInfo();
21232 MachineOperand MSrc = MI->getOperand(0);
21233 unsigned VSrc = MI->getOperand(5).getReg();
21234 const MachineOperand &Disp = MI->getOperand(3);
21235 MachineOperand ZeroDisp = MachineOperand::CreateImm(0);
21236 bool hasDisp = Disp.isGlobal() || Disp.isImm();
21237 if (hasDisp && MSrc.isReg())
21238 MSrc.setIsKill(false);
21239 MachineInstrBuilder MIM = BuildMI(*BB, MI, DL, TII->get(MOp))
21240 .addOperand(/*Base=*/MSrc)
21241 .addImm(/*Scale=*/1)
21242 .addReg(/*Index=*/0)
21243 .addDisp(hasDisp ? Disp : ZeroDisp, /*off=*/0)
21245 MachineInstr *MIO = BuildMI(*BB, (MachineInstr *)MIM, DL, TII->get(FOp),
21246 MRI.createVirtualRegister(MRI.getRegClass(VSrc)))
21248 .addOperand(/*Base=*/MSrc)
21249 .addImm(/*Scale=*/1)
21250 .addReg(/*Index=*/0)
21251 .addDisp(hasDisp ? Disp : ZeroDisp, /*off=*/0)
21252 .addReg(/*Segment=*/0);
21253 MIM.addReg(MIO->getOperand(0).getReg(), RegState::Kill);
21254 MI->eraseFromParent(); // The pseudo instruction is gone now.
21258 MachineBasicBlock *
21259 X86TargetLowering::EmitLoweredSegAlloca(MachineInstr *MI,
21260 MachineBasicBlock *BB) const {
21261 MachineFunction *MF = BB->getParent();
21262 const TargetInstrInfo *TII = Subtarget->getInstrInfo();
21263 DebugLoc DL = MI->getDebugLoc();
21264 const BasicBlock *LLVM_BB = BB->getBasicBlock();
21266 assert(MF->shouldSplitStack());
21268 const bool Is64Bit = Subtarget->is64Bit();
21269 const bool IsLP64 = Subtarget->isTarget64BitLP64();
21271 const unsigned TlsReg = Is64Bit ? X86::FS : X86::GS;
21272 const unsigned TlsOffset = IsLP64 ? 0x70 : Is64Bit ? 0x40 : 0x30;
21275 // ... [Till the alloca]
21276 // If stacklet is not large enough, jump to mallocMBB
21279 // Allocate by subtracting from RSP
21280 // Jump to continueMBB
21283 // Allocate by call to runtime
21287 // [rest of original BB]
21290 MachineBasicBlock *mallocMBB = MF->CreateMachineBasicBlock(LLVM_BB);
21291 MachineBasicBlock *bumpMBB = MF->CreateMachineBasicBlock(LLVM_BB);
21292 MachineBasicBlock *continueMBB = MF->CreateMachineBasicBlock(LLVM_BB);
21294 MachineRegisterInfo &MRI = MF->getRegInfo();
21295 const TargetRegisterClass *AddrRegClass =
21296 getRegClassFor(getPointerTy(MF->getDataLayout()));
21298 unsigned mallocPtrVReg = MRI.createVirtualRegister(AddrRegClass),
21299 bumpSPPtrVReg = MRI.createVirtualRegister(AddrRegClass),
21300 tmpSPVReg = MRI.createVirtualRegister(AddrRegClass),
21301 SPLimitVReg = MRI.createVirtualRegister(AddrRegClass),
21302 sizeVReg = MI->getOperand(1).getReg(),
21303 physSPReg = IsLP64 || Subtarget->isTargetNaCl64() ? X86::RSP : X86::ESP;
21305 MachineFunction::iterator MBBIter = ++BB->getIterator();
21307 MF->insert(MBBIter, bumpMBB);
21308 MF->insert(MBBIter, mallocMBB);
21309 MF->insert(MBBIter, continueMBB);
21311 continueMBB->splice(continueMBB->begin(), BB,
21312 std::next(MachineBasicBlock::iterator(MI)), BB->end());
21313 continueMBB->transferSuccessorsAndUpdatePHIs(BB);
21315 // Add code to the main basic block to check if the stack limit has been hit,
21316 // and if so, jump to mallocMBB otherwise to bumpMBB.
21317 BuildMI(BB, DL, TII->get(TargetOpcode::COPY), tmpSPVReg).addReg(physSPReg);
21318 BuildMI(BB, DL, TII->get(IsLP64 ? X86::SUB64rr:X86::SUB32rr), SPLimitVReg)
21319 .addReg(tmpSPVReg).addReg(sizeVReg);
21320 BuildMI(BB, DL, TII->get(IsLP64 ? X86::CMP64mr:X86::CMP32mr))
21321 .addReg(0).addImm(1).addReg(0).addImm(TlsOffset).addReg(TlsReg)
21322 .addReg(SPLimitVReg);
21323 BuildMI(BB, DL, TII->get(X86::JG_1)).addMBB(mallocMBB);
21325 // bumpMBB simply decreases the stack pointer, since we know the current
21326 // stacklet has enough space.
21327 BuildMI(bumpMBB, DL, TII->get(TargetOpcode::COPY), physSPReg)
21328 .addReg(SPLimitVReg);
21329 BuildMI(bumpMBB, DL, TII->get(TargetOpcode::COPY), bumpSPPtrVReg)
21330 .addReg(SPLimitVReg);
21331 BuildMI(bumpMBB, DL, TII->get(X86::JMP_1)).addMBB(continueMBB);
21333 // Calls into a routine in libgcc to allocate more space from the heap.
21334 const uint32_t *RegMask =
21335 Subtarget->getRegisterInfo()->getCallPreservedMask(*MF, CallingConv::C);
21337 BuildMI(mallocMBB, DL, TII->get(X86::MOV64rr), X86::RDI)
21339 BuildMI(mallocMBB, DL, TII->get(X86::CALL64pcrel32))
21340 .addExternalSymbol("__morestack_allocate_stack_space")
21341 .addRegMask(RegMask)
21342 .addReg(X86::RDI, RegState::Implicit)
21343 .addReg(X86::RAX, RegState::ImplicitDefine);
21344 } else if (Is64Bit) {
21345 BuildMI(mallocMBB, DL, TII->get(X86::MOV32rr), X86::EDI)
21347 BuildMI(mallocMBB, DL, TII->get(X86::CALL64pcrel32))
21348 .addExternalSymbol("__morestack_allocate_stack_space")
21349 .addRegMask(RegMask)
21350 .addReg(X86::EDI, RegState::Implicit)
21351 .addReg(X86::EAX, RegState::ImplicitDefine);
21353 BuildMI(mallocMBB, DL, TII->get(X86::SUB32ri), physSPReg).addReg(physSPReg)
21355 BuildMI(mallocMBB, DL, TII->get(X86::PUSH32r)).addReg(sizeVReg);
21356 BuildMI(mallocMBB, DL, TII->get(X86::CALLpcrel32))
21357 .addExternalSymbol("__morestack_allocate_stack_space")
21358 .addRegMask(RegMask)
21359 .addReg(X86::EAX, RegState::ImplicitDefine);
21363 BuildMI(mallocMBB, DL, TII->get(X86::ADD32ri), physSPReg).addReg(physSPReg)
21366 BuildMI(mallocMBB, DL, TII->get(TargetOpcode::COPY), mallocPtrVReg)
21367 .addReg(IsLP64 ? X86::RAX : X86::EAX);
21368 BuildMI(mallocMBB, DL, TII->get(X86::JMP_1)).addMBB(continueMBB);
21370 // Set up the CFG correctly.
21371 BB->addSuccessor(bumpMBB);
21372 BB->addSuccessor(mallocMBB);
21373 mallocMBB->addSuccessor(continueMBB);
21374 bumpMBB->addSuccessor(continueMBB);
21376 // Take care of the PHI nodes.
21377 BuildMI(*continueMBB, continueMBB->begin(), DL, TII->get(X86::PHI),
21378 MI->getOperand(0).getReg())
21379 .addReg(mallocPtrVReg).addMBB(mallocMBB)
21380 .addReg(bumpSPPtrVReg).addMBB(bumpMBB);
21382 // Delete the original pseudo instruction.
21383 MI->eraseFromParent();
21386 return continueMBB;
21389 MachineBasicBlock *
21390 X86TargetLowering::EmitLoweredWinAlloca(MachineInstr *MI,
21391 MachineBasicBlock *BB) const {
21392 assert(!Subtarget->isTargetMachO());
21393 DebugLoc DL = MI->getDebugLoc();
21394 MachineInstr *ResumeMI = Subtarget->getFrameLowering()->emitStackProbe(
21395 *BB->getParent(), *BB, MI, DL, false);
21396 MachineBasicBlock *ResumeBB = ResumeMI->getParent();
21397 MI->eraseFromParent(); // The pseudo instruction is gone now.
21401 MachineBasicBlock *
21402 X86TargetLowering::EmitLoweredCatchRet(MachineInstr *MI,
21403 MachineBasicBlock *BB) const {
21404 MachineFunction *MF = BB->getParent();
21405 const TargetInstrInfo &TII = *Subtarget->getInstrInfo();
21406 MachineBasicBlock *TargetMBB = MI->getOperand(0).getMBB();
21407 DebugLoc DL = MI->getDebugLoc();
21409 assert(!isAsynchronousEHPersonality(
21410 classifyEHPersonality(MF->getFunction()->getPersonalityFn())) &&
21411 "SEH does not use catchret!");
21413 // Only 32-bit EH needs to worry about manually restoring stack pointers.
21414 if (!Subtarget->is32Bit())
21417 // C++ EH creates a new target block to hold the restore code, and wires up
21418 // the new block to the return destination with a normal JMP_4.
21419 MachineBasicBlock *RestoreMBB =
21420 MF->CreateMachineBasicBlock(BB->getBasicBlock());
21421 assert(BB->succ_size() == 1);
21422 MF->insert(std::next(BB->getIterator()), RestoreMBB);
21423 RestoreMBB->transferSuccessorsAndUpdatePHIs(BB);
21424 BB->addSuccessor(RestoreMBB);
21425 MI->getOperand(0).setMBB(RestoreMBB);
21427 auto RestoreMBBI = RestoreMBB->begin();
21428 BuildMI(*RestoreMBB, RestoreMBBI, DL, TII.get(X86::EH_RESTORE));
21429 BuildMI(*RestoreMBB, RestoreMBBI, DL, TII.get(X86::JMP_4)).addMBB(TargetMBB);
21433 MachineBasicBlock *
21434 X86TargetLowering::EmitLoweredCatchPad(MachineInstr *MI,
21435 MachineBasicBlock *BB) const {
21436 MachineFunction *MF = BB->getParent();
21437 const Constant *PerFn = MF->getFunction()->getPersonalityFn();
21438 bool IsSEH = isAsynchronousEHPersonality(classifyEHPersonality(PerFn));
21439 // Only 32-bit SEH requires special handling for catchpad.
21440 if (IsSEH && Subtarget->is32Bit()) {
21441 const TargetInstrInfo &TII = *Subtarget->getInstrInfo();
21442 DebugLoc DL = MI->getDebugLoc();
21443 BuildMI(*BB, MI, DL, TII.get(X86::EH_RESTORE));
21445 MI->eraseFromParent();
21449 MachineBasicBlock *
21450 X86TargetLowering::EmitLoweredTLSCall(MachineInstr *MI,
21451 MachineBasicBlock *BB) const {
21452 // This is pretty easy. We're taking the value that we received from
21453 // our load from the relocation, sticking it in either RDI (x86-64)
21454 // or EAX and doing an indirect call. The return value will then
21455 // be in the normal return register.
21456 MachineFunction *F = BB->getParent();
21457 const X86InstrInfo *TII = Subtarget->getInstrInfo();
21458 DebugLoc DL = MI->getDebugLoc();
21460 assert(Subtarget->isTargetDarwin() && "Darwin only instr emitted?");
21461 assert(MI->getOperand(3).isGlobal() && "This should be a global");
21463 // Get a register mask for the lowered call.
21464 // FIXME: The 32-bit calls have non-standard calling conventions. Use a
21465 // proper register mask.
21466 const uint32_t *RegMask =
21467 Subtarget->is64Bit() ?
21468 Subtarget->getRegisterInfo()->getDarwinTLSCallPreservedMask() :
21469 Subtarget->getRegisterInfo()->getCallPreservedMask(*F, CallingConv::C);
21470 if (Subtarget->is64Bit()) {
21471 MachineInstrBuilder MIB = BuildMI(*BB, MI, DL,
21472 TII->get(X86::MOV64rm), X86::RDI)
21474 .addImm(0).addReg(0)
21475 .addGlobalAddress(MI->getOperand(3).getGlobal(), 0,
21476 MI->getOperand(3).getTargetFlags())
21478 MIB = BuildMI(*BB, MI, DL, TII->get(X86::CALL64m));
21479 addDirectMem(MIB, X86::RDI);
21480 MIB.addReg(X86::RAX, RegState::ImplicitDefine).addRegMask(RegMask);
21481 } else if (F->getTarget().getRelocationModel() != Reloc::PIC_) {
21482 MachineInstrBuilder MIB = BuildMI(*BB, MI, DL,
21483 TII->get(X86::MOV32rm), X86::EAX)
21485 .addImm(0).addReg(0)
21486 .addGlobalAddress(MI->getOperand(3).getGlobal(), 0,
21487 MI->getOperand(3).getTargetFlags())
21489 MIB = BuildMI(*BB, MI, DL, TII->get(X86::CALL32m));
21490 addDirectMem(MIB, X86::EAX);
21491 MIB.addReg(X86::EAX, RegState::ImplicitDefine).addRegMask(RegMask);
21493 MachineInstrBuilder MIB = BuildMI(*BB, MI, DL,
21494 TII->get(X86::MOV32rm), X86::EAX)
21495 .addReg(TII->getGlobalBaseReg(F))
21496 .addImm(0).addReg(0)
21497 .addGlobalAddress(MI->getOperand(3).getGlobal(), 0,
21498 MI->getOperand(3).getTargetFlags())
21500 MIB = BuildMI(*BB, MI, DL, TII->get(X86::CALL32m));
21501 addDirectMem(MIB, X86::EAX);
21502 MIB.addReg(X86::EAX, RegState::ImplicitDefine).addRegMask(RegMask);
21505 MI->eraseFromParent(); // The pseudo instruction is gone now.
21509 MachineBasicBlock *
21510 X86TargetLowering::emitEHSjLjSetJmp(MachineInstr *MI,
21511 MachineBasicBlock *MBB) const {
21512 DebugLoc DL = MI->getDebugLoc();
21513 MachineFunction *MF = MBB->getParent();
21514 const TargetInstrInfo *TII = Subtarget->getInstrInfo();
21515 MachineRegisterInfo &MRI = MF->getRegInfo();
21517 const BasicBlock *BB = MBB->getBasicBlock();
21518 MachineFunction::iterator I = ++MBB->getIterator();
21520 // Memory Reference
21521 MachineInstr::mmo_iterator MMOBegin = MI->memoperands_begin();
21522 MachineInstr::mmo_iterator MMOEnd = MI->memoperands_end();
21525 unsigned MemOpndSlot = 0;
21527 unsigned CurOp = 0;
21529 DstReg = MI->getOperand(CurOp++).getReg();
21530 const TargetRegisterClass *RC = MRI.getRegClass(DstReg);
21531 assert(RC->hasType(MVT::i32) && "Invalid destination!");
21532 unsigned mainDstReg = MRI.createVirtualRegister(RC);
21533 unsigned restoreDstReg = MRI.createVirtualRegister(RC);
21535 MemOpndSlot = CurOp;
21537 MVT PVT = getPointerTy(MF->getDataLayout());
21538 assert((PVT == MVT::i64 || PVT == MVT::i32) &&
21539 "Invalid Pointer Size!");
21541 // For v = setjmp(buf), we generate
21544 // buf[LabelOffset] = restoreMBB <-- takes address of restoreMBB
21545 // SjLjSetup restoreMBB
21551 // v = phi(main, restore)
21554 // if base pointer being used, load it from frame
21557 MachineBasicBlock *thisMBB = MBB;
21558 MachineBasicBlock *mainMBB = MF->CreateMachineBasicBlock(BB);
21559 MachineBasicBlock *sinkMBB = MF->CreateMachineBasicBlock(BB);
21560 MachineBasicBlock *restoreMBB = MF->CreateMachineBasicBlock(BB);
21561 MF->insert(I, mainMBB);
21562 MF->insert(I, sinkMBB);
21563 MF->push_back(restoreMBB);
21564 restoreMBB->setHasAddressTaken();
21566 MachineInstrBuilder MIB;
21568 // Transfer the remainder of BB and its successor edges to sinkMBB.
21569 sinkMBB->splice(sinkMBB->begin(), MBB,
21570 std::next(MachineBasicBlock::iterator(MI)), MBB->end());
21571 sinkMBB->transferSuccessorsAndUpdatePHIs(MBB);
21574 unsigned PtrStoreOpc = 0;
21575 unsigned LabelReg = 0;
21576 const int64_t LabelOffset = 1 * PVT.getStoreSize();
21577 Reloc::Model RM = MF->getTarget().getRelocationModel();
21578 bool UseImmLabel = (MF->getTarget().getCodeModel() == CodeModel::Small) &&
21579 (RM == Reloc::Static || RM == Reloc::DynamicNoPIC);
21581 // Prepare IP either in reg or imm.
21582 if (!UseImmLabel) {
21583 PtrStoreOpc = (PVT == MVT::i64) ? X86::MOV64mr : X86::MOV32mr;
21584 const TargetRegisterClass *PtrRC = getRegClassFor(PVT);
21585 LabelReg = MRI.createVirtualRegister(PtrRC);
21586 if (Subtarget->is64Bit()) {
21587 MIB = BuildMI(*thisMBB, MI, DL, TII->get(X86::LEA64r), LabelReg)
21591 .addMBB(restoreMBB)
21594 const X86InstrInfo *XII = static_cast<const X86InstrInfo*>(TII);
21595 MIB = BuildMI(*thisMBB, MI, DL, TII->get(X86::LEA32r), LabelReg)
21596 .addReg(XII->getGlobalBaseReg(MF))
21599 .addMBB(restoreMBB, Subtarget->ClassifyBlockAddressReference())
21603 PtrStoreOpc = (PVT == MVT::i64) ? X86::MOV64mi32 : X86::MOV32mi;
21605 MIB = BuildMI(*thisMBB, MI, DL, TII->get(PtrStoreOpc));
21606 for (unsigned i = 0; i < X86::AddrNumOperands; ++i) {
21607 if (i == X86::AddrDisp)
21608 MIB.addDisp(MI->getOperand(MemOpndSlot + i), LabelOffset);
21610 MIB.addOperand(MI->getOperand(MemOpndSlot + i));
21613 MIB.addReg(LabelReg);
21615 MIB.addMBB(restoreMBB);
21616 MIB.setMemRefs(MMOBegin, MMOEnd);
21618 MIB = BuildMI(*thisMBB, MI, DL, TII->get(X86::EH_SjLj_Setup))
21619 .addMBB(restoreMBB);
21621 const X86RegisterInfo *RegInfo = Subtarget->getRegisterInfo();
21622 MIB.addRegMask(RegInfo->getNoPreservedMask());
21623 thisMBB->addSuccessor(mainMBB);
21624 thisMBB->addSuccessor(restoreMBB);
21628 BuildMI(mainMBB, DL, TII->get(X86::MOV32r0), mainDstReg);
21629 mainMBB->addSuccessor(sinkMBB);
21632 BuildMI(*sinkMBB, sinkMBB->begin(), DL,
21633 TII->get(X86::PHI), DstReg)
21634 .addReg(mainDstReg).addMBB(mainMBB)
21635 .addReg(restoreDstReg).addMBB(restoreMBB);
21638 if (RegInfo->hasBasePointer(*MF)) {
21639 const bool Uses64BitFramePtr =
21640 Subtarget->isTarget64BitLP64() || Subtarget->isTargetNaCl64();
21641 X86MachineFunctionInfo *X86FI = MF->getInfo<X86MachineFunctionInfo>();
21642 X86FI->setRestoreBasePointer(MF);
21643 unsigned FramePtr = RegInfo->getFrameRegister(*MF);
21644 unsigned BasePtr = RegInfo->getBaseRegister();
21645 unsigned Opm = Uses64BitFramePtr ? X86::MOV64rm : X86::MOV32rm;
21646 addRegOffset(BuildMI(restoreMBB, DL, TII->get(Opm), BasePtr),
21647 FramePtr, true, X86FI->getRestoreBasePointerOffset())
21648 .setMIFlag(MachineInstr::FrameSetup);
21650 BuildMI(restoreMBB, DL, TII->get(X86::MOV32ri), restoreDstReg).addImm(1);
21651 BuildMI(restoreMBB, DL, TII->get(X86::JMP_1)).addMBB(sinkMBB);
21652 restoreMBB->addSuccessor(sinkMBB);
21654 MI->eraseFromParent();
21658 MachineBasicBlock *
21659 X86TargetLowering::emitEHSjLjLongJmp(MachineInstr *MI,
21660 MachineBasicBlock *MBB) const {
21661 DebugLoc DL = MI->getDebugLoc();
21662 MachineFunction *MF = MBB->getParent();
21663 const TargetInstrInfo *TII = Subtarget->getInstrInfo();
21664 MachineRegisterInfo &MRI = MF->getRegInfo();
21666 // Memory Reference
21667 MachineInstr::mmo_iterator MMOBegin = MI->memoperands_begin();
21668 MachineInstr::mmo_iterator MMOEnd = MI->memoperands_end();
21670 MVT PVT = getPointerTy(MF->getDataLayout());
21671 assert((PVT == MVT::i64 || PVT == MVT::i32) &&
21672 "Invalid Pointer Size!");
21674 const TargetRegisterClass *RC =
21675 (PVT == MVT::i64) ? &X86::GR64RegClass : &X86::GR32RegClass;
21676 unsigned Tmp = MRI.createVirtualRegister(RC);
21677 // Since FP is only updated here but NOT referenced, it's treated as GPR.
21678 const X86RegisterInfo *RegInfo = Subtarget->getRegisterInfo();
21679 unsigned FP = (PVT == MVT::i64) ? X86::RBP : X86::EBP;
21680 unsigned SP = RegInfo->getStackRegister();
21682 MachineInstrBuilder MIB;
21684 const int64_t LabelOffset = 1 * PVT.getStoreSize();
21685 const int64_t SPOffset = 2 * PVT.getStoreSize();
21687 unsigned PtrLoadOpc = (PVT == MVT::i64) ? X86::MOV64rm : X86::MOV32rm;
21688 unsigned IJmpOpc = (PVT == MVT::i64) ? X86::JMP64r : X86::JMP32r;
21691 MIB = BuildMI(*MBB, MI, DL, TII->get(PtrLoadOpc), FP);
21692 for (unsigned i = 0; i < X86::AddrNumOperands; ++i)
21693 MIB.addOperand(MI->getOperand(i));
21694 MIB.setMemRefs(MMOBegin, MMOEnd);
21696 MIB = BuildMI(*MBB, MI, DL, TII->get(PtrLoadOpc), Tmp);
21697 for (unsigned i = 0; i < X86::AddrNumOperands; ++i) {
21698 if (i == X86::AddrDisp)
21699 MIB.addDisp(MI->getOperand(i), LabelOffset);
21701 MIB.addOperand(MI->getOperand(i));
21703 MIB.setMemRefs(MMOBegin, MMOEnd);
21705 MIB = BuildMI(*MBB, MI, DL, TII->get(PtrLoadOpc), SP);
21706 for (unsigned i = 0; i < X86::AddrNumOperands; ++i) {
21707 if (i == X86::AddrDisp)
21708 MIB.addDisp(MI->getOperand(i), SPOffset);
21710 MIB.addOperand(MI->getOperand(i));
21712 MIB.setMemRefs(MMOBegin, MMOEnd);
21714 BuildMI(*MBB, MI, DL, TII->get(IJmpOpc)).addReg(Tmp);
21716 MI->eraseFromParent();
21720 // Replace 213-type (isel default) FMA3 instructions with 231-type for
21721 // accumulator loops. Writing back to the accumulator allows the coalescer
21722 // to remove extra copies in the loop.
21723 // FIXME: Do this on AVX512. We don't support 231 variants yet (PR23937).
21724 MachineBasicBlock *
21725 X86TargetLowering::emitFMA3Instr(MachineInstr *MI,
21726 MachineBasicBlock *MBB) const {
21727 MachineOperand &AddendOp = MI->getOperand(3);
21729 // Bail out early if the addend isn't a register - we can't switch these.
21730 if (!AddendOp.isReg())
21733 MachineFunction &MF = *MBB->getParent();
21734 MachineRegisterInfo &MRI = MF.getRegInfo();
21736 // Check whether the addend is defined by a PHI:
21737 assert(MRI.hasOneDef(AddendOp.getReg()) && "Multiple defs in SSA?");
21738 MachineInstr &AddendDef = *MRI.def_instr_begin(AddendOp.getReg());
21739 if (!AddendDef.isPHI())
21742 // Look for the following pattern:
21744 // %addend = phi [%entry, 0], [%loop, %result]
21746 // %result<tied1> = FMA213 %m2<tied0>, %m1, %addend
21750 // %addend = phi [%entry, 0], [%loop, %result]
21752 // %result<tied1> = FMA231 %addend<tied0>, %m1, %m2
21754 for (unsigned i = 1, e = AddendDef.getNumOperands(); i < e; i += 2) {
21755 assert(AddendDef.getOperand(i).isReg());
21756 MachineOperand PHISrcOp = AddendDef.getOperand(i);
21757 MachineInstr &PHISrcInst = *MRI.def_instr_begin(PHISrcOp.getReg());
21758 if (&PHISrcInst == MI) {
21759 // Found a matching instruction.
21760 unsigned NewFMAOpc = 0;
21761 switch (MI->getOpcode()) {
21762 case X86::VFMADDPDr213r: NewFMAOpc = X86::VFMADDPDr231r; break;
21763 case X86::VFMADDPSr213r: NewFMAOpc = X86::VFMADDPSr231r; break;
21764 case X86::VFMADDSDr213r: NewFMAOpc = X86::VFMADDSDr231r; break;
21765 case X86::VFMADDSSr213r: NewFMAOpc = X86::VFMADDSSr231r; break;
21766 case X86::VFMSUBPDr213r: NewFMAOpc = X86::VFMSUBPDr231r; break;
21767 case X86::VFMSUBPSr213r: NewFMAOpc = X86::VFMSUBPSr231r; break;
21768 case X86::VFMSUBSDr213r: NewFMAOpc = X86::VFMSUBSDr231r; break;
21769 case X86::VFMSUBSSr213r: NewFMAOpc = X86::VFMSUBSSr231r; break;
21770 case X86::VFNMADDPDr213r: NewFMAOpc = X86::VFNMADDPDr231r; break;
21771 case X86::VFNMADDPSr213r: NewFMAOpc = X86::VFNMADDPSr231r; break;
21772 case X86::VFNMADDSDr213r: NewFMAOpc = X86::VFNMADDSDr231r; break;
21773 case X86::VFNMADDSSr213r: NewFMAOpc = X86::VFNMADDSSr231r; break;
21774 case X86::VFNMSUBPDr213r: NewFMAOpc = X86::VFNMSUBPDr231r; break;
21775 case X86::VFNMSUBPSr213r: NewFMAOpc = X86::VFNMSUBPSr231r; break;
21776 case X86::VFNMSUBSDr213r: NewFMAOpc = X86::VFNMSUBSDr231r; break;
21777 case X86::VFNMSUBSSr213r: NewFMAOpc = X86::VFNMSUBSSr231r; break;
21778 case X86::VFMADDSUBPDr213r: NewFMAOpc = X86::VFMADDSUBPDr231r; break;
21779 case X86::VFMADDSUBPSr213r: NewFMAOpc = X86::VFMADDSUBPSr231r; break;
21780 case X86::VFMSUBADDPDr213r: NewFMAOpc = X86::VFMSUBADDPDr231r; break;
21781 case X86::VFMSUBADDPSr213r: NewFMAOpc = X86::VFMSUBADDPSr231r; break;
21783 case X86::VFMADDPDr213rY: NewFMAOpc = X86::VFMADDPDr231rY; break;
21784 case X86::VFMADDPSr213rY: NewFMAOpc = X86::VFMADDPSr231rY; break;
21785 case X86::VFMSUBPDr213rY: NewFMAOpc = X86::VFMSUBPDr231rY; break;
21786 case X86::VFMSUBPSr213rY: NewFMAOpc = X86::VFMSUBPSr231rY; break;
21787 case X86::VFNMADDPDr213rY: NewFMAOpc = X86::VFNMADDPDr231rY; break;
21788 case X86::VFNMADDPSr213rY: NewFMAOpc = X86::VFNMADDPSr231rY; break;
21789 case X86::VFNMSUBPDr213rY: NewFMAOpc = X86::VFNMSUBPDr231rY; break;
21790 case X86::VFNMSUBPSr213rY: NewFMAOpc = X86::VFNMSUBPSr231rY; break;
21791 case X86::VFMADDSUBPDr213rY: NewFMAOpc = X86::VFMADDSUBPDr231rY; break;
21792 case X86::VFMADDSUBPSr213rY: NewFMAOpc = X86::VFMADDSUBPSr231rY; break;
21793 case X86::VFMSUBADDPDr213rY: NewFMAOpc = X86::VFMSUBADDPDr231rY; break;
21794 case X86::VFMSUBADDPSr213rY: NewFMAOpc = X86::VFMSUBADDPSr231rY; break;
21795 default: llvm_unreachable("Unrecognized FMA variant.");
21798 const TargetInstrInfo &TII = *Subtarget->getInstrInfo();
21799 MachineInstrBuilder MIB =
21800 BuildMI(MF, MI->getDebugLoc(), TII.get(NewFMAOpc))
21801 .addOperand(MI->getOperand(0))
21802 .addOperand(MI->getOperand(3))
21803 .addOperand(MI->getOperand(2))
21804 .addOperand(MI->getOperand(1));
21805 MBB->insert(MachineBasicBlock::iterator(MI), MIB);
21806 MI->eraseFromParent();
21813 MachineBasicBlock *
21814 X86TargetLowering::EmitInstrWithCustomInserter(MachineInstr *MI,
21815 MachineBasicBlock *BB) const {
21816 switch (MI->getOpcode()) {
21817 default: llvm_unreachable("Unexpected instr type to insert");
21818 case X86::TAILJMPd64:
21819 case X86::TAILJMPr64:
21820 case X86::TAILJMPm64:
21821 case X86::TAILJMPd64_REX:
21822 case X86::TAILJMPr64_REX:
21823 case X86::TAILJMPm64_REX:
21824 llvm_unreachable("TAILJMP64 would not be touched here.");
21825 case X86::TCRETURNdi64:
21826 case X86::TCRETURNri64:
21827 case X86::TCRETURNmi64:
21829 case X86::WIN_ALLOCA:
21830 return EmitLoweredWinAlloca(MI, BB);
21831 case X86::CATCHRET:
21832 return EmitLoweredCatchRet(MI, BB);
21833 case X86::CATCHPAD:
21834 return EmitLoweredCatchPad(MI, BB);
21835 case X86::SEG_ALLOCA_32:
21836 case X86::SEG_ALLOCA_64:
21837 return EmitLoweredSegAlloca(MI, BB);
21838 case X86::TLSCall_32:
21839 case X86::TLSCall_64:
21840 return EmitLoweredTLSCall(MI, BB);
21841 case X86::CMOV_FR32:
21842 case X86::CMOV_FR64:
21843 case X86::CMOV_GR8:
21844 case X86::CMOV_GR16:
21845 case X86::CMOV_GR32:
21846 case X86::CMOV_RFP32:
21847 case X86::CMOV_RFP64:
21848 case X86::CMOV_RFP80:
21849 case X86::CMOV_V2F64:
21850 case X86::CMOV_V2I64:
21851 case X86::CMOV_V4F32:
21852 case X86::CMOV_V4F64:
21853 case X86::CMOV_V4I64:
21854 case X86::CMOV_V16F32:
21855 case X86::CMOV_V8F32:
21856 case X86::CMOV_V8F64:
21857 case X86::CMOV_V8I64:
21858 case X86::CMOV_V8I1:
21859 case X86::CMOV_V16I1:
21860 case X86::CMOV_V32I1:
21861 case X86::CMOV_V64I1:
21862 return EmitLoweredSelect(MI, BB);
21864 case X86::RELEASE_FADD32mr:
21865 case X86::RELEASE_FADD64mr:
21866 return EmitLoweredAtomicFP(MI, BB);
21868 case X86::FP32_TO_INT16_IN_MEM:
21869 case X86::FP32_TO_INT32_IN_MEM:
21870 case X86::FP32_TO_INT64_IN_MEM:
21871 case X86::FP64_TO_INT16_IN_MEM:
21872 case X86::FP64_TO_INT32_IN_MEM:
21873 case X86::FP64_TO_INT64_IN_MEM:
21874 case X86::FP80_TO_INT16_IN_MEM:
21875 case X86::FP80_TO_INT32_IN_MEM:
21876 case X86::FP80_TO_INT64_IN_MEM: {
21877 MachineFunction *F = BB->getParent();
21878 const TargetInstrInfo *TII = Subtarget->getInstrInfo();
21879 DebugLoc DL = MI->getDebugLoc();
21881 // Change the floating point control register to use "round towards zero"
21882 // mode when truncating to an integer value.
21883 int CWFrameIdx = F->getFrameInfo()->CreateStackObject(2, 2, false);
21884 addFrameReference(BuildMI(*BB, MI, DL,
21885 TII->get(X86::FNSTCW16m)), CWFrameIdx);
21887 // Load the old value of the high byte of the control word...
21889 F->getRegInfo().createVirtualRegister(&X86::GR16RegClass);
21890 addFrameReference(BuildMI(*BB, MI, DL, TII->get(X86::MOV16rm), OldCW),
21893 // Set the high part to be round to zero...
21894 addFrameReference(BuildMI(*BB, MI, DL, TII->get(X86::MOV16mi)), CWFrameIdx)
21897 // Reload the modified control word now...
21898 addFrameReference(BuildMI(*BB, MI, DL,
21899 TII->get(X86::FLDCW16m)), CWFrameIdx);
21901 // Restore the memory image of control word to original value
21902 addFrameReference(BuildMI(*BB, MI, DL, TII->get(X86::MOV16mr)), CWFrameIdx)
21905 // Get the X86 opcode to use.
21907 switch (MI->getOpcode()) {
21908 default: llvm_unreachable("illegal opcode!");
21909 case X86::FP32_TO_INT16_IN_MEM: Opc = X86::IST_Fp16m32; break;
21910 case X86::FP32_TO_INT32_IN_MEM: Opc = X86::IST_Fp32m32; break;
21911 case X86::FP32_TO_INT64_IN_MEM: Opc = X86::IST_Fp64m32; break;
21912 case X86::FP64_TO_INT16_IN_MEM: Opc = X86::IST_Fp16m64; break;
21913 case X86::FP64_TO_INT32_IN_MEM: Opc = X86::IST_Fp32m64; break;
21914 case X86::FP64_TO_INT64_IN_MEM: Opc = X86::IST_Fp64m64; break;
21915 case X86::FP80_TO_INT16_IN_MEM: Opc = X86::IST_Fp16m80; break;
21916 case X86::FP80_TO_INT32_IN_MEM: Opc = X86::IST_Fp32m80; break;
21917 case X86::FP80_TO_INT64_IN_MEM: Opc = X86::IST_Fp64m80; break;
21921 MachineOperand &Op = MI->getOperand(0);
21923 AM.BaseType = X86AddressMode::RegBase;
21924 AM.Base.Reg = Op.getReg();
21926 AM.BaseType = X86AddressMode::FrameIndexBase;
21927 AM.Base.FrameIndex = Op.getIndex();
21929 Op = MI->getOperand(1);
21931 AM.Scale = Op.getImm();
21932 Op = MI->getOperand(2);
21934 AM.IndexReg = Op.getImm();
21935 Op = MI->getOperand(3);
21936 if (Op.isGlobal()) {
21937 AM.GV = Op.getGlobal();
21939 AM.Disp = Op.getImm();
21941 addFullAddress(BuildMI(*BB, MI, DL, TII->get(Opc)), AM)
21942 .addReg(MI->getOperand(X86::AddrNumOperands).getReg());
21944 // Reload the original control word now.
21945 addFrameReference(BuildMI(*BB, MI, DL,
21946 TII->get(X86::FLDCW16m)), CWFrameIdx);
21948 MI->eraseFromParent(); // The pseudo instruction is gone now.
21951 // String/text processing lowering.
21952 case X86::PCMPISTRM128REG:
21953 case X86::VPCMPISTRM128REG:
21954 case X86::PCMPISTRM128MEM:
21955 case X86::VPCMPISTRM128MEM:
21956 case X86::PCMPESTRM128REG:
21957 case X86::VPCMPESTRM128REG:
21958 case X86::PCMPESTRM128MEM:
21959 case X86::VPCMPESTRM128MEM:
21960 assert(Subtarget->hasSSE42() &&
21961 "Target must have SSE4.2 or AVX features enabled");
21962 return EmitPCMPSTRM(MI, BB, Subtarget->getInstrInfo());
21964 // String/text processing lowering.
21965 case X86::PCMPISTRIREG:
21966 case X86::VPCMPISTRIREG:
21967 case X86::PCMPISTRIMEM:
21968 case X86::VPCMPISTRIMEM:
21969 case X86::PCMPESTRIREG:
21970 case X86::VPCMPESTRIREG:
21971 case X86::PCMPESTRIMEM:
21972 case X86::VPCMPESTRIMEM:
21973 assert(Subtarget->hasSSE42() &&
21974 "Target must have SSE4.2 or AVX features enabled");
21975 return EmitPCMPSTRI(MI, BB, Subtarget->getInstrInfo());
21977 // Thread synchronization.
21979 return EmitMonitor(MI, BB, Subtarget);
21983 return EmitXBegin(MI, BB, Subtarget->getInstrInfo());
21985 case X86::VASTART_SAVE_XMM_REGS:
21986 return EmitVAStartSaveXMMRegsWithCustomInserter(MI, BB);
21988 case X86::VAARG_64:
21989 return EmitVAARG64WithCustomInserter(MI, BB);
21991 case X86::EH_SjLj_SetJmp32:
21992 case X86::EH_SjLj_SetJmp64:
21993 return emitEHSjLjSetJmp(MI, BB);
21995 case X86::EH_SjLj_LongJmp32:
21996 case X86::EH_SjLj_LongJmp64:
21997 return emitEHSjLjLongJmp(MI, BB);
21999 case TargetOpcode::STATEPOINT:
22000 // As an implementation detail, STATEPOINT shares the STACKMAP format at
22001 // this point in the process. We diverge later.
22002 return emitPatchPoint(MI, BB);
22004 case TargetOpcode::STACKMAP:
22005 case TargetOpcode::PATCHPOINT:
22006 return emitPatchPoint(MI, BB);
22008 case X86::VFMADDPDr213r:
22009 case X86::VFMADDPSr213r:
22010 case X86::VFMADDSDr213r:
22011 case X86::VFMADDSSr213r:
22012 case X86::VFMSUBPDr213r:
22013 case X86::VFMSUBPSr213r:
22014 case X86::VFMSUBSDr213r:
22015 case X86::VFMSUBSSr213r:
22016 case X86::VFNMADDPDr213r:
22017 case X86::VFNMADDPSr213r:
22018 case X86::VFNMADDSDr213r:
22019 case X86::VFNMADDSSr213r:
22020 case X86::VFNMSUBPDr213r:
22021 case X86::VFNMSUBPSr213r:
22022 case X86::VFNMSUBSDr213r:
22023 case X86::VFNMSUBSSr213r:
22024 case X86::VFMADDSUBPDr213r:
22025 case X86::VFMADDSUBPSr213r:
22026 case X86::VFMSUBADDPDr213r:
22027 case X86::VFMSUBADDPSr213r:
22028 case X86::VFMADDPDr213rY:
22029 case X86::VFMADDPSr213rY:
22030 case X86::VFMSUBPDr213rY:
22031 case X86::VFMSUBPSr213rY:
22032 case X86::VFNMADDPDr213rY:
22033 case X86::VFNMADDPSr213rY:
22034 case X86::VFNMSUBPDr213rY:
22035 case X86::VFNMSUBPSr213rY:
22036 case X86::VFMADDSUBPDr213rY:
22037 case X86::VFMADDSUBPSr213rY:
22038 case X86::VFMSUBADDPDr213rY:
22039 case X86::VFMSUBADDPSr213rY:
22040 return emitFMA3Instr(MI, BB);
22044 //===----------------------------------------------------------------------===//
22045 // X86 Optimization Hooks
22046 //===----------------------------------------------------------------------===//
22048 void X86TargetLowering::computeKnownBitsForTargetNode(const SDValue Op,
22051 const SelectionDAG &DAG,
22052 unsigned Depth) const {
22053 unsigned BitWidth = KnownZero.getBitWidth();
22054 unsigned Opc = Op.getOpcode();
22055 assert((Opc >= ISD::BUILTIN_OP_END ||
22056 Opc == ISD::INTRINSIC_WO_CHAIN ||
22057 Opc == ISD::INTRINSIC_W_CHAIN ||
22058 Opc == ISD::INTRINSIC_VOID) &&
22059 "Should use MaskedValueIsZero if you don't know whether Op"
22060 " is a target node!");
22062 KnownZero = KnownOne = APInt(BitWidth, 0); // Don't know anything.
22076 // These nodes' second result is a boolean.
22077 if (Op.getResNo() == 0)
22080 case X86ISD::SETCC:
22081 KnownZero |= APInt::getHighBitsSet(BitWidth, BitWidth - 1);
22083 case ISD::INTRINSIC_WO_CHAIN: {
22084 unsigned IntId = cast<ConstantSDNode>(Op.getOperand(0))->getZExtValue();
22085 unsigned NumLoBits = 0;
22088 case Intrinsic::x86_sse_movmsk_ps:
22089 case Intrinsic::x86_avx_movmsk_ps_256:
22090 case Intrinsic::x86_sse2_movmsk_pd:
22091 case Intrinsic::x86_avx_movmsk_pd_256:
22092 case Intrinsic::x86_mmx_pmovmskb:
22093 case Intrinsic::x86_sse2_pmovmskb_128:
22094 case Intrinsic::x86_avx2_pmovmskb: {
22095 // High bits of movmskp{s|d}, pmovmskb are known zero.
22097 default: llvm_unreachable("Impossible intrinsic"); // Can't reach here.
22098 case Intrinsic::x86_sse_movmsk_ps: NumLoBits = 4; break;
22099 case Intrinsic::x86_avx_movmsk_ps_256: NumLoBits = 8; break;
22100 case Intrinsic::x86_sse2_movmsk_pd: NumLoBits = 2; break;
22101 case Intrinsic::x86_avx_movmsk_pd_256: NumLoBits = 4; break;
22102 case Intrinsic::x86_mmx_pmovmskb: NumLoBits = 8; break;
22103 case Intrinsic::x86_sse2_pmovmskb_128: NumLoBits = 16; break;
22104 case Intrinsic::x86_avx2_pmovmskb: NumLoBits = 32; break;
22106 KnownZero = APInt::getHighBitsSet(BitWidth, BitWidth - NumLoBits);
22115 unsigned X86TargetLowering::ComputeNumSignBitsForTargetNode(
22117 const SelectionDAG &,
22118 unsigned Depth) const {
22119 // SETCC_CARRY sets the dest to ~0 for true or 0 for false.
22120 if (Op.getOpcode() == X86ISD::SETCC_CARRY)
22121 return Op.getValueType().getScalarSizeInBits();
22127 /// isGAPlusOffset - Returns true (and the GlobalValue and the offset) if the
22128 /// node is a GlobalAddress + offset.
22129 bool X86TargetLowering::isGAPlusOffset(SDNode *N,
22130 const GlobalValue* &GA,
22131 int64_t &Offset) const {
22132 if (N->getOpcode() == X86ISD::Wrapper) {
22133 if (isa<GlobalAddressSDNode>(N->getOperand(0))) {
22134 GA = cast<GlobalAddressSDNode>(N->getOperand(0))->getGlobal();
22135 Offset = cast<GlobalAddressSDNode>(N->getOperand(0))->getOffset();
22139 return TargetLowering::isGAPlusOffset(N, GA, Offset);
22142 /// isShuffleHigh128VectorInsertLow - Checks whether the shuffle node is the
22143 /// same as extracting the high 128-bit part of 256-bit vector and then
22144 /// inserting the result into the low part of a new 256-bit vector
22145 static bool isShuffleHigh128VectorInsertLow(ShuffleVectorSDNode *SVOp) {
22146 EVT VT = SVOp->getValueType(0);
22147 unsigned NumElems = VT.getVectorNumElements();
22149 // vector_shuffle <4, 5, 6, 7, u, u, u, u> or <2, 3, u, u>
22150 for (unsigned i = 0, j = NumElems/2; i != NumElems/2; ++i, ++j)
22151 if (!isUndefOrEqual(SVOp->getMaskElt(i), j) ||
22152 SVOp->getMaskElt(j) >= 0)
22158 /// isShuffleLow128VectorInsertHigh - Checks whether the shuffle node is the
22159 /// same as extracting the low 128-bit part of 256-bit vector and then
22160 /// inserting the result into the high part of a new 256-bit vector
22161 static bool isShuffleLow128VectorInsertHigh(ShuffleVectorSDNode *SVOp) {
22162 EVT VT = SVOp->getValueType(0);
22163 unsigned NumElems = VT.getVectorNumElements();
22165 // vector_shuffle <u, u, u, u, 0, 1, 2, 3> or <u, u, 0, 1>
22166 for (unsigned i = NumElems/2, j = 0; i != NumElems; ++i, ++j)
22167 if (!isUndefOrEqual(SVOp->getMaskElt(i), j) ||
22168 SVOp->getMaskElt(j) >= 0)
22174 /// PerformShuffleCombine256 - Performs shuffle combines for 256-bit vectors.
22175 static SDValue PerformShuffleCombine256(SDNode *N, SelectionDAG &DAG,
22176 TargetLowering::DAGCombinerInfo &DCI,
22177 const X86Subtarget* Subtarget) {
22179 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(N);
22180 SDValue V1 = SVOp->getOperand(0);
22181 SDValue V2 = SVOp->getOperand(1);
22182 EVT VT = SVOp->getValueType(0);
22183 unsigned NumElems = VT.getVectorNumElements();
22185 if (V1.getOpcode() == ISD::CONCAT_VECTORS &&
22186 V2.getOpcode() == ISD::CONCAT_VECTORS) {
22190 // V UNDEF BUILD_VECTOR UNDEF
22192 // CONCAT_VECTOR CONCAT_VECTOR
22195 // RESULT: V + zero extended
22197 if (V2.getOperand(0).getOpcode() != ISD::BUILD_VECTOR ||
22198 V2.getOperand(1).getOpcode() != ISD::UNDEF ||
22199 V1.getOperand(1).getOpcode() != ISD::UNDEF)
22202 if (!ISD::isBuildVectorAllZeros(V2.getOperand(0).getNode()))
22205 // To match the shuffle mask, the first half of the mask should
22206 // be exactly the first vector, and all the rest a splat with the
22207 // first element of the second one.
22208 for (unsigned i = 0; i != NumElems/2; ++i)
22209 if (!isUndefOrEqual(SVOp->getMaskElt(i), i) ||
22210 !isUndefOrEqual(SVOp->getMaskElt(i+NumElems/2), NumElems))
22213 // If V1 is coming from a vector load then just fold to a VZEXT_LOAD.
22214 if (LoadSDNode *Ld = dyn_cast<LoadSDNode>(V1.getOperand(0))) {
22215 if (Ld->hasNUsesOfValue(1, 0)) {
22216 SDVTList Tys = DAG.getVTList(MVT::v4i64, MVT::Other);
22217 SDValue Ops[] = { Ld->getChain(), Ld->getBasePtr() };
22219 DAG.getMemIntrinsicNode(X86ISD::VZEXT_LOAD, dl, Tys, Ops,
22221 Ld->getPointerInfo(),
22222 Ld->getAlignment(),
22223 false/*isVolatile*/, true/*ReadMem*/,
22224 false/*WriteMem*/);
22226 // Make sure the newly-created LOAD is in the same position as Ld in
22227 // terms of dependency. We create a TokenFactor for Ld and ResNode,
22228 // and update uses of Ld's output chain to use the TokenFactor.
22229 if (Ld->hasAnyUseOfValue(1)) {
22230 SDValue NewChain = DAG.getNode(ISD::TokenFactor, dl, MVT::Other,
22231 SDValue(Ld, 1), SDValue(ResNode.getNode(), 1));
22232 DAG.ReplaceAllUsesOfValueWith(SDValue(Ld, 1), NewChain);
22233 DAG.UpdateNodeOperands(NewChain.getNode(), SDValue(Ld, 1),
22234 SDValue(ResNode.getNode(), 1));
22237 return DAG.getBitcast(VT, ResNode);
22241 // Emit a zeroed vector and insert the desired subvector on its
22243 SDValue Zeros = getZeroVector(VT, Subtarget, DAG, dl);
22244 SDValue InsV = Insert128BitVector(Zeros, V1.getOperand(0), 0, DAG, dl);
22245 return DCI.CombineTo(N, InsV);
22248 //===--------------------------------------------------------------------===//
22249 // Combine some shuffles into subvector extracts and inserts:
22252 // vector_shuffle <4, 5, 6, 7, u, u, u, u> or <2, 3, u, u>
22253 if (isShuffleHigh128VectorInsertLow(SVOp)) {
22254 SDValue V = Extract128BitVector(V1, NumElems/2, DAG, dl);
22255 SDValue InsV = Insert128BitVector(DAG.getUNDEF(VT), V, 0, DAG, dl);
22256 return DCI.CombineTo(N, InsV);
22259 // vector_shuffle <u, u, u, u, 0, 1, 2, 3> or <u, u, 0, 1>
22260 if (isShuffleLow128VectorInsertHigh(SVOp)) {
22261 SDValue V = Extract128BitVector(V1, 0, DAG, dl);
22262 SDValue InsV = Insert128BitVector(DAG.getUNDEF(VT), V, NumElems/2, DAG, dl);
22263 return DCI.CombineTo(N, InsV);
22269 /// \brief Combine an arbitrary chain of shuffles into a single instruction if
22272 /// This is the leaf of the recursive combinine below. When we have found some
22273 /// chain of single-use x86 shuffle instructions and accumulated the combined
22274 /// shuffle mask represented by them, this will try to pattern match that mask
22275 /// into either a single instruction if there is a special purpose instruction
22276 /// for this operation, or into a PSHUFB instruction which is a fully general
22277 /// instruction but should only be used to replace chains over a certain depth.
22278 static bool combineX86ShuffleChain(SDValue Op, SDValue Root, ArrayRef<int> Mask,
22279 int Depth, bool HasPSHUFB, SelectionDAG &DAG,
22280 TargetLowering::DAGCombinerInfo &DCI,
22281 const X86Subtarget *Subtarget) {
22282 assert(!Mask.empty() && "Cannot combine an empty shuffle mask!");
22284 // Find the operand that enters the chain. Note that multiple uses are OK
22285 // here, we're not going to remove the operand we find.
22286 SDValue Input = Op.getOperand(0);
22287 while (Input.getOpcode() == ISD::BITCAST)
22288 Input = Input.getOperand(0);
22290 MVT VT = Input.getSimpleValueType();
22291 MVT RootVT = Root.getSimpleValueType();
22294 if (Mask.size() == 1) {
22295 int Index = Mask[0];
22296 assert((Index >= 0 || Index == SM_SentinelUndef ||
22297 Index == SM_SentinelZero) &&
22298 "Invalid shuffle index found!");
22300 // We may end up with an accumulated mask of size 1 as a result of
22301 // widening of shuffle operands (see function canWidenShuffleElements).
22302 // If the only shuffle index is equal to SM_SentinelZero then propagate
22303 // a zero vector. Otherwise, the combine shuffle mask is a no-op shuffle
22304 // mask, and therefore the entire chain of shuffles can be folded away.
22305 if (Index == SM_SentinelZero)
22306 DCI.CombineTo(Root.getNode(), getZeroVector(RootVT, Subtarget, DAG, DL));
22308 DCI.CombineTo(Root.getNode(), DAG.getBitcast(RootVT, Input),
22313 // Use the float domain if the operand type is a floating point type.
22314 bool FloatDomain = VT.isFloatingPoint();
22316 // For floating point shuffles, we don't have free copies in the shuffle
22317 // instructions or the ability to load as part of the instruction, so
22318 // canonicalize their shuffles to UNPCK or MOV variants.
22320 // Note that even with AVX we prefer the PSHUFD form of shuffle for integer
22321 // vectors because it can have a load folded into it that UNPCK cannot. This
22322 // doesn't preclude something switching to the shorter encoding post-RA.
22324 // FIXME: Should teach these routines about AVX vector widths.
22325 if (FloatDomain && VT.is128BitVector()) {
22326 if (Mask.equals({0, 0}) || Mask.equals({1, 1})) {
22327 bool Lo = Mask.equals({0, 0});
22330 // Check if we have SSE3 which will let us use MOVDDUP. That instruction
22331 // is no slower than UNPCKLPD but has the option to fold the input operand
22332 // into even an unaligned memory load.
22333 if (Lo && Subtarget->hasSSE3()) {
22334 Shuffle = X86ISD::MOVDDUP;
22335 ShuffleVT = MVT::v2f64;
22337 // We have MOVLHPS and MOVHLPS throughout SSE and they encode smaller
22338 // than the UNPCK variants.
22339 Shuffle = Lo ? X86ISD::MOVLHPS : X86ISD::MOVHLPS;
22340 ShuffleVT = MVT::v4f32;
22342 if (Depth == 1 && Root->getOpcode() == Shuffle)
22343 return false; // Nothing to do!
22344 Op = DAG.getBitcast(ShuffleVT, Input);
22345 DCI.AddToWorklist(Op.getNode());
22346 if (Shuffle == X86ISD::MOVDDUP)
22347 Op = DAG.getNode(Shuffle, DL, ShuffleVT, Op);
22349 Op = DAG.getNode(Shuffle, DL, ShuffleVT, Op, Op);
22350 DCI.AddToWorklist(Op.getNode());
22351 DCI.CombineTo(Root.getNode(), DAG.getBitcast(RootVT, Op),
22355 if (Subtarget->hasSSE3() &&
22356 (Mask.equals({0, 0, 2, 2}) || Mask.equals({1, 1, 3, 3}))) {
22357 bool Lo = Mask.equals({0, 0, 2, 2});
22358 unsigned Shuffle = Lo ? X86ISD::MOVSLDUP : X86ISD::MOVSHDUP;
22359 MVT ShuffleVT = MVT::v4f32;
22360 if (Depth == 1 && Root->getOpcode() == Shuffle)
22361 return false; // Nothing to do!
22362 Op = DAG.getBitcast(ShuffleVT, Input);
22363 DCI.AddToWorklist(Op.getNode());
22364 Op = DAG.getNode(Shuffle, DL, ShuffleVT, Op);
22365 DCI.AddToWorklist(Op.getNode());
22366 DCI.CombineTo(Root.getNode(), DAG.getBitcast(RootVT, Op),
22370 if (Mask.equals({0, 0, 1, 1}) || Mask.equals({2, 2, 3, 3})) {
22371 bool Lo = Mask.equals({0, 0, 1, 1});
22372 unsigned Shuffle = Lo ? X86ISD::UNPCKL : X86ISD::UNPCKH;
22373 MVT ShuffleVT = MVT::v4f32;
22374 if (Depth == 1 && Root->getOpcode() == Shuffle)
22375 return false; // Nothing to do!
22376 Op = DAG.getBitcast(ShuffleVT, Input);
22377 DCI.AddToWorklist(Op.getNode());
22378 Op = DAG.getNode(Shuffle, DL, ShuffleVT, Op, Op);
22379 DCI.AddToWorklist(Op.getNode());
22380 DCI.CombineTo(Root.getNode(), DAG.getBitcast(RootVT, Op),
22386 // We always canonicalize the 8 x i16 and 16 x i8 shuffles into their UNPCK
22387 // variants as none of these have single-instruction variants that are
22388 // superior to the UNPCK formulation.
22389 if (!FloatDomain && VT.is128BitVector() &&
22390 (Mask.equals({0, 0, 1, 1, 2, 2, 3, 3}) ||
22391 Mask.equals({4, 4, 5, 5, 6, 6, 7, 7}) ||
22392 Mask.equals({0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7}) ||
22394 {8, 8, 9, 9, 10, 10, 11, 11, 12, 12, 13, 13, 14, 14, 15, 15}))) {
22395 bool Lo = Mask[0] == 0;
22396 unsigned Shuffle = Lo ? X86ISD::UNPCKL : X86ISD::UNPCKH;
22397 if (Depth == 1 && Root->getOpcode() == Shuffle)
22398 return false; // Nothing to do!
22400 switch (Mask.size()) {
22402 ShuffleVT = MVT::v8i16;
22405 ShuffleVT = MVT::v16i8;
22408 llvm_unreachable("Impossible mask size!");
22410 Op = DAG.getBitcast(ShuffleVT, Input);
22411 DCI.AddToWorklist(Op.getNode());
22412 Op = DAG.getNode(Shuffle, DL, ShuffleVT, Op, Op);
22413 DCI.AddToWorklist(Op.getNode());
22414 DCI.CombineTo(Root.getNode(), DAG.getBitcast(RootVT, Op),
22419 // Don't try to re-form single instruction chains under any circumstances now
22420 // that we've done encoding canonicalization for them.
22424 // If we have 3 or more shuffle instructions or a chain involving PSHUFB, we
22425 // can replace them with a single PSHUFB instruction profitably. Intel's
22426 // manuals suggest only using PSHUFB if doing so replacing 5 instructions, but
22427 // in practice PSHUFB tends to be *very* fast so we're more aggressive.
22428 if ((Depth >= 3 || HasPSHUFB) && Subtarget->hasSSSE3()) {
22429 SmallVector<SDValue, 16> PSHUFBMask;
22430 int NumBytes = VT.getSizeInBits() / 8;
22431 int Ratio = NumBytes / Mask.size();
22432 for (int i = 0; i < NumBytes; ++i) {
22433 if (Mask[i / Ratio] == SM_SentinelUndef) {
22434 PSHUFBMask.push_back(DAG.getUNDEF(MVT::i8));
22437 int M = Mask[i / Ratio] != SM_SentinelZero
22438 ? Ratio * Mask[i / Ratio] + i % Ratio
22440 PSHUFBMask.push_back(DAG.getConstant(M, DL, MVT::i8));
22442 MVT ByteVT = MVT::getVectorVT(MVT::i8, NumBytes);
22443 Op = DAG.getBitcast(ByteVT, Input);
22444 DCI.AddToWorklist(Op.getNode());
22445 SDValue PSHUFBMaskOp =
22446 DAG.getNode(ISD::BUILD_VECTOR, DL, ByteVT, PSHUFBMask);
22447 DCI.AddToWorklist(PSHUFBMaskOp.getNode());
22448 Op = DAG.getNode(X86ISD::PSHUFB, DL, ByteVT, Op, PSHUFBMaskOp);
22449 DCI.AddToWorklist(Op.getNode());
22450 DCI.CombineTo(Root.getNode(), DAG.getBitcast(RootVT, Op),
22455 // Failed to find any combines.
22459 /// \brief Fully generic combining of x86 shuffle instructions.
22461 /// This should be the last combine run over the x86 shuffle instructions. Once
22462 /// they have been fully optimized, this will recursively consider all chains
22463 /// of single-use shuffle instructions, build a generic model of the cumulative
22464 /// shuffle operation, and check for simpler instructions which implement this
22465 /// operation. We use this primarily for two purposes:
22467 /// 1) Collapse generic shuffles to specialized single instructions when
22468 /// equivalent. In most cases, this is just an encoding size win, but
22469 /// sometimes we will collapse multiple generic shuffles into a single
22470 /// special-purpose shuffle.
22471 /// 2) Look for sequences of shuffle instructions with 3 or more total
22472 /// instructions, and replace them with the slightly more expensive SSSE3
22473 /// PSHUFB instruction if available. We do this as the last combining step
22474 /// to ensure we avoid using PSHUFB if we can implement the shuffle with
22475 /// a suitable short sequence of other instructions. The PHUFB will either
22476 /// use a register or have to read from memory and so is slightly (but only
22477 /// slightly) more expensive than the other shuffle instructions.
22479 /// Because this is inherently a quadratic operation (for each shuffle in
22480 /// a chain, we recurse up the chain), the depth is limited to 8 instructions.
22481 /// This should never be an issue in practice as the shuffle lowering doesn't
22482 /// produce sequences of more than 8 instructions.
22484 /// FIXME: We will currently miss some cases where the redundant shuffling
22485 /// would simplify under the threshold for PSHUFB formation because of
22486 /// combine-ordering. To fix this, we should do the redundant instruction
22487 /// combining in this recursive walk.
22488 static bool combineX86ShufflesRecursively(SDValue Op, SDValue Root,
22489 ArrayRef<int> RootMask,
22490 int Depth, bool HasPSHUFB,
22492 TargetLowering::DAGCombinerInfo &DCI,
22493 const X86Subtarget *Subtarget) {
22494 // Bound the depth of our recursive combine because this is ultimately
22495 // quadratic in nature.
22499 // Directly rip through bitcasts to find the underlying operand.
22500 while (Op.getOpcode() == ISD::BITCAST && Op.getOperand(0).hasOneUse())
22501 Op = Op.getOperand(0);
22503 MVT VT = Op.getSimpleValueType();
22504 if (!VT.isVector())
22505 return false; // Bail if we hit a non-vector.
22507 assert(Root.getSimpleValueType().isVector() &&
22508 "Shuffles operate on vector types!");
22509 assert(VT.getSizeInBits() == Root.getSimpleValueType().getSizeInBits() &&
22510 "Can only combine shuffles of the same vector register size.");
22512 if (!isTargetShuffle(Op.getOpcode()))
22514 SmallVector<int, 16> OpMask;
22516 bool HaveMask = getTargetShuffleMask(Op.getNode(), VT, OpMask, IsUnary);
22517 // We only can combine unary shuffles which we can decode the mask for.
22518 if (!HaveMask || !IsUnary)
22521 assert(VT.getVectorNumElements() == OpMask.size() &&
22522 "Different mask size from vector size!");
22523 assert(((RootMask.size() > OpMask.size() &&
22524 RootMask.size() % OpMask.size() == 0) ||
22525 (OpMask.size() > RootMask.size() &&
22526 OpMask.size() % RootMask.size() == 0) ||
22527 OpMask.size() == RootMask.size()) &&
22528 "The smaller number of elements must divide the larger.");
22529 int RootRatio = std::max<int>(1, OpMask.size() / RootMask.size());
22530 int OpRatio = std::max<int>(1, RootMask.size() / OpMask.size());
22531 assert(((RootRatio == 1 && OpRatio == 1) ||
22532 (RootRatio == 1) != (OpRatio == 1)) &&
22533 "Must not have a ratio for both incoming and op masks!");
22535 SmallVector<int, 16> Mask;
22536 Mask.reserve(std::max(OpMask.size(), RootMask.size()));
22538 // Merge this shuffle operation's mask into our accumulated mask. Note that
22539 // this shuffle's mask will be the first applied to the input, followed by the
22540 // root mask to get us all the way to the root value arrangement. The reason
22541 // for this order is that we are recursing up the operation chain.
22542 for (int i = 0, e = std::max(OpMask.size(), RootMask.size()); i < e; ++i) {
22543 int RootIdx = i / RootRatio;
22544 if (RootMask[RootIdx] < 0) {
22545 // This is a zero or undef lane, we're done.
22546 Mask.push_back(RootMask[RootIdx]);
22550 int RootMaskedIdx = RootMask[RootIdx] * RootRatio + i % RootRatio;
22551 int OpIdx = RootMaskedIdx / OpRatio;
22552 if (OpMask[OpIdx] < 0) {
22553 // The incoming lanes are zero or undef, it doesn't matter which ones we
22555 Mask.push_back(OpMask[OpIdx]);
22559 // Ok, we have non-zero lanes, map them through.
22560 Mask.push_back(OpMask[OpIdx] * OpRatio +
22561 RootMaskedIdx % OpRatio);
22564 // See if we can recurse into the operand to combine more things.
22565 switch (Op.getOpcode()) {
22566 case X86ISD::PSHUFB:
22568 case X86ISD::PSHUFD:
22569 case X86ISD::PSHUFHW:
22570 case X86ISD::PSHUFLW:
22571 if (Op.getOperand(0).hasOneUse() &&
22572 combineX86ShufflesRecursively(Op.getOperand(0), Root, Mask, Depth + 1,
22573 HasPSHUFB, DAG, DCI, Subtarget))
22577 case X86ISD::UNPCKL:
22578 case X86ISD::UNPCKH:
22579 assert(Op.getOperand(0) == Op.getOperand(1) &&
22580 "We only combine unary shuffles!");
22581 // We can't check for single use, we have to check that this shuffle is the
22583 if (Op->isOnlyUserOf(Op.getOperand(0).getNode()) &&
22584 combineX86ShufflesRecursively(Op.getOperand(0), Root, Mask, Depth + 1,
22585 HasPSHUFB, DAG, DCI, Subtarget))
22590 // Minor canonicalization of the accumulated shuffle mask to make it easier
22591 // to match below. All this does is detect masks with squential pairs of
22592 // elements, and shrink them to the half-width mask. It does this in a loop
22593 // so it will reduce the size of the mask to the minimal width mask which
22594 // performs an equivalent shuffle.
22595 SmallVector<int, 16> WidenedMask;
22596 while (Mask.size() > 1 && canWidenShuffleElements(Mask, WidenedMask)) {
22597 Mask = std::move(WidenedMask);
22598 WidenedMask.clear();
22601 return combineX86ShuffleChain(Op, Root, Mask, Depth, HasPSHUFB, DAG, DCI,
22605 /// \brief Get the PSHUF-style mask from PSHUF node.
22607 /// This is a very minor wrapper around getTargetShuffleMask to easy forming v4
22608 /// PSHUF-style masks that can be reused with such instructions.
22609 static SmallVector<int, 4> getPSHUFShuffleMask(SDValue N) {
22610 MVT VT = N.getSimpleValueType();
22611 SmallVector<int, 4> Mask;
22613 bool HaveMask = getTargetShuffleMask(N.getNode(), VT, Mask, IsUnary);
22617 // If we have more than 128-bits, only the low 128-bits of shuffle mask
22618 // matter. Check that the upper masks are repeats and remove them.
22619 if (VT.getSizeInBits() > 128) {
22620 int LaneElts = 128 / VT.getScalarSizeInBits();
22622 for (int i = 1, NumLanes = VT.getSizeInBits() / 128; i < NumLanes; ++i)
22623 for (int j = 0; j < LaneElts; ++j)
22624 assert(Mask[j] == Mask[i * LaneElts + j] - (LaneElts * i) &&
22625 "Mask doesn't repeat in high 128-bit lanes!");
22627 Mask.resize(LaneElts);
22630 switch (N.getOpcode()) {
22631 case X86ISD::PSHUFD:
22633 case X86ISD::PSHUFLW:
22636 case X86ISD::PSHUFHW:
22637 Mask.erase(Mask.begin(), Mask.begin() + 4);
22638 for (int &M : Mask)
22642 llvm_unreachable("No valid shuffle instruction found!");
22646 /// \brief Search for a combinable shuffle across a chain ending in pshufd.
22648 /// We walk up the chain and look for a combinable shuffle, skipping over
22649 /// shuffles that we could hoist this shuffle's transformation past without
22650 /// altering anything.
22652 combineRedundantDWordShuffle(SDValue N, MutableArrayRef<int> Mask,
22654 TargetLowering::DAGCombinerInfo &DCI) {
22655 assert(N.getOpcode() == X86ISD::PSHUFD &&
22656 "Called with something other than an x86 128-bit half shuffle!");
22659 // Walk up a single-use chain looking for a combinable shuffle. Keep a stack
22660 // of the shuffles in the chain so that we can form a fresh chain to replace
22662 SmallVector<SDValue, 8> Chain;
22663 SDValue V = N.getOperand(0);
22664 for (; V.hasOneUse(); V = V.getOperand(0)) {
22665 switch (V.getOpcode()) {
22667 return SDValue(); // Nothing combined!
22670 // Skip bitcasts as we always know the type for the target specific
22674 case X86ISD::PSHUFD:
22675 // Found another dword shuffle.
22678 case X86ISD::PSHUFLW:
22679 // Check that the low words (being shuffled) are the identity in the
22680 // dword shuffle, and the high words are self-contained.
22681 if (Mask[0] != 0 || Mask[1] != 1 ||
22682 !(Mask[2] >= 2 && Mask[2] < 4 && Mask[3] >= 2 && Mask[3] < 4))
22685 Chain.push_back(V);
22688 case X86ISD::PSHUFHW:
22689 // Check that the high words (being shuffled) are the identity in the
22690 // dword shuffle, and the low words are self-contained.
22691 if (Mask[2] != 2 || Mask[3] != 3 ||
22692 !(Mask[0] >= 0 && Mask[0] < 2 && Mask[1] >= 0 && Mask[1] < 2))
22695 Chain.push_back(V);
22698 case X86ISD::UNPCKL:
22699 case X86ISD::UNPCKH:
22700 // For either i8 -> i16 or i16 -> i32 unpacks, we can combine a dword
22701 // shuffle into a preceding word shuffle.
22702 if (V.getSimpleValueType().getVectorElementType() != MVT::i8 &&
22703 V.getSimpleValueType().getVectorElementType() != MVT::i16)
22706 // Search for a half-shuffle which we can combine with.
22707 unsigned CombineOp =
22708 V.getOpcode() == X86ISD::UNPCKL ? X86ISD::PSHUFLW : X86ISD::PSHUFHW;
22709 if (V.getOperand(0) != V.getOperand(1) ||
22710 !V->isOnlyUserOf(V.getOperand(0).getNode()))
22712 Chain.push_back(V);
22713 V = V.getOperand(0);
22715 switch (V.getOpcode()) {
22717 return SDValue(); // Nothing to combine.
22719 case X86ISD::PSHUFLW:
22720 case X86ISD::PSHUFHW:
22721 if (V.getOpcode() == CombineOp)
22724 Chain.push_back(V);
22728 V = V.getOperand(0);
22732 } while (V.hasOneUse());
22735 // Break out of the loop if we break out of the switch.
22739 if (!V.hasOneUse())
22740 // We fell out of the loop without finding a viable combining instruction.
22743 // Merge this node's mask and our incoming mask.
22744 SmallVector<int, 4> VMask = getPSHUFShuffleMask(V);
22745 for (int &M : Mask)
22747 V = DAG.getNode(V.getOpcode(), DL, V.getValueType(), V.getOperand(0),
22748 getV4X86ShuffleImm8ForMask(Mask, DL, DAG));
22750 // Rebuild the chain around this new shuffle.
22751 while (!Chain.empty()) {
22752 SDValue W = Chain.pop_back_val();
22754 if (V.getValueType() != W.getOperand(0).getValueType())
22755 V = DAG.getBitcast(W.getOperand(0).getValueType(), V);
22757 switch (W.getOpcode()) {
22759 llvm_unreachable("Only PSHUF and UNPCK instructions get here!");
22761 case X86ISD::UNPCKL:
22762 case X86ISD::UNPCKH:
22763 V = DAG.getNode(W.getOpcode(), DL, W.getValueType(), V, V);
22766 case X86ISD::PSHUFD:
22767 case X86ISD::PSHUFLW:
22768 case X86ISD::PSHUFHW:
22769 V = DAG.getNode(W.getOpcode(), DL, W.getValueType(), V, W.getOperand(1));
22773 if (V.getValueType() != N.getValueType())
22774 V = DAG.getBitcast(N.getValueType(), V);
22776 // Return the new chain to replace N.
22780 /// \brief Search for a combinable shuffle across a chain ending in pshuflw or
22783 /// We walk up the chain, skipping shuffles of the other half and looking
22784 /// through shuffles which switch halves trying to find a shuffle of the same
22785 /// pair of dwords.
22786 static bool combineRedundantHalfShuffle(SDValue N, MutableArrayRef<int> Mask,
22788 TargetLowering::DAGCombinerInfo &DCI) {
22790 (N.getOpcode() == X86ISD::PSHUFLW || N.getOpcode() == X86ISD::PSHUFHW) &&
22791 "Called with something other than an x86 128-bit half shuffle!");
22793 unsigned CombineOpcode = N.getOpcode();
22795 // Walk up a single-use chain looking for a combinable shuffle.
22796 SDValue V = N.getOperand(0);
22797 for (; V.hasOneUse(); V = V.getOperand(0)) {
22798 switch (V.getOpcode()) {
22800 return false; // Nothing combined!
22803 // Skip bitcasts as we always know the type for the target specific
22807 case X86ISD::PSHUFLW:
22808 case X86ISD::PSHUFHW:
22809 if (V.getOpcode() == CombineOpcode)
22812 // Other-half shuffles are no-ops.
22815 // Break out of the loop if we break out of the switch.
22819 if (!V.hasOneUse())
22820 // We fell out of the loop without finding a viable combining instruction.
22823 // Combine away the bottom node as its shuffle will be accumulated into
22824 // a preceding shuffle.
22825 DCI.CombineTo(N.getNode(), N.getOperand(0), /*AddTo*/ true);
22827 // Record the old value.
22830 // Merge this node's mask and our incoming mask (adjusted to account for all
22831 // the pshufd instructions encountered).
22832 SmallVector<int, 4> VMask = getPSHUFShuffleMask(V);
22833 for (int &M : Mask)
22835 V = DAG.getNode(V.getOpcode(), DL, MVT::v8i16, V.getOperand(0),
22836 getV4X86ShuffleImm8ForMask(Mask, DL, DAG));
22838 // Check that the shuffles didn't cancel each other out. If not, we need to
22839 // combine to the new one.
22841 // Replace the combinable shuffle with the combined one, updating all users
22842 // so that we re-evaluate the chain here.
22843 DCI.CombineTo(Old.getNode(), V, /*AddTo*/ true);
22848 /// \brief Try to combine x86 target specific shuffles.
22849 static SDValue PerformTargetShuffleCombine(SDValue N, SelectionDAG &DAG,
22850 TargetLowering::DAGCombinerInfo &DCI,
22851 const X86Subtarget *Subtarget) {
22853 MVT VT = N.getSimpleValueType();
22854 SmallVector<int, 4> Mask;
22856 switch (N.getOpcode()) {
22857 case X86ISD::PSHUFD:
22858 case X86ISD::PSHUFLW:
22859 case X86ISD::PSHUFHW:
22860 Mask = getPSHUFShuffleMask(N);
22861 assert(Mask.size() == 4);
22863 case X86ISD::UNPCKL: {
22864 // Combine X86ISD::UNPCKL and ISD::VECTOR_SHUFFLE into X86ISD::UNPCKH, in
22865 // which X86ISD::UNPCKL has a ISD::UNDEF operand, and ISD::VECTOR_SHUFFLE
22866 // moves upper half elements into the lower half part. For example:
22868 // t2: v16i8 = vector_shuffle<8,9,10,11,12,13,14,15,u,u,u,u,u,u,u,u> t1,
22870 // t3: v16i8 = X86ISD::UNPCKL undef:v16i8, t2
22872 // will be combined to:
22874 // t3: v16i8 = X86ISD::UNPCKH undef:v16i8, t1
22876 // This is only for 128-bit vectors. From SSE4.1 onward this combine may not
22877 // happen due to advanced instructions.
22878 if (!VT.is128BitVector())
22881 auto Op0 = N.getOperand(0);
22882 auto Op1 = N.getOperand(1);
22883 if (Op0.getOpcode() == ISD::UNDEF &&
22884 Op1.getNode()->getOpcode() == ISD::VECTOR_SHUFFLE) {
22885 ArrayRef<int> Mask = cast<ShuffleVectorSDNode>(Op1.getNode())->getMask();
22887 unsigned NumElts = VT.getVectorNumElements();
22888 SmallVector<int, 8> ExpectedMask(NumElts, -1);
22889 std::iota(ExpectedMask.begin(), ExpectedMask.begin() + NumElts / 2,
22892 auto ShufOp = Op1.getOperand(0);
22893 if (isShuffleEquivalent(Op1, ShufOp, Mask, ExpectedMask))
22894 return DAG.getNode(X86ISD::UNPCKH, DL, VT, N.getOperand(0), ShufOp);
22902 // Nuke no-op shuffles that show up after combining.
22903 if (isNoopShuffleMask(Mask))
22904 return DCI.CombineTo(N.getNode(), N.getOperand(0), /*AddTo*/ true);
22906 // Look for simplifications involving one or two shuffle instructions.
22907 SDValue V = N.getOperand(0);
22908 switch (N.getOpcode()) {
22911 case X86ISD::PSHUFLW:
22912 case X86ISD::PSHUFHW:
22913 assert(VT.getVectorElementType() == MVT::i16 && "Bad word shuffle type!");
22915 if (combineRedundantHalfShuffle(N, Mask, DAG, DCI))
22916 return SDValue(); // We combined away this shuffle, so we're done.
22918 // See if this reduces to a PSHUFD which is no more expensive and can
22919 // combine with more operations. Note that it has to at least flip the
22920 // dwords as otherwise it would have been removed as a no-op.
22921 if (makeArrayRef(Mask).equals({2, 3, 0, 1})) {
22922 int DMask[] = {0, 1, 2, 3};
22923 int DOffset = N.getOpcode() == X86ISD::PSHUFLW ? 0 : 2;
22924 DMask[DOffset + 0] = DOffset + 1;
22925 DMask[DOffset + 1] = DOffset + 0;
22926 MVT DVT = MVT::getVectorVT(MVT::i32, VT.getVectorNumElements() / 2);
22927 V = DAG.getBitcast(DVT, V);
22928 DCI.AddToWorklist(V.getNode());
22929 V = DAG.getNode(X86ISD::PSHUFD, DL, DVT, V,
22930 getV4X86ShuffleImm8ForMask(DMask, DL, DAG));
22931 DCI.AddToWorklist(V.getNode());
22932 return DAG.getBitcast(VT, V);
22935 // Look for shuffle patterns which can be implemented as a single unpack.
22936 // FIXME: This doesn't handle the location of the PSHUFD generically, and
22937 // only works when we have a PSHUFD followed by two half-shuffles.
22938 if (Mask[0] == Mask[1] && Mask[2] == Mask[3] &&
22939 (V.getOpcode() == X86ISD::PSHUFLW ||
22940 V.getOpcode() == X86ISD::PSHUFHW) &&
22941 V.getOpcode() != N.getOpcode() &&
22943 SDValue D = V.getOperand(0);
22944 while (D.getOpcode() == ISD::BITCAST && D.hasOneUse())
22945 D = D.getOperand(0);
22946 if (D.getOpcode() == X86ISD::PSHUFD && D.hasOneUse()) {
22947 SmallVector<int, 4> VMask = getPSHUFShuffleMask(V);
22948 SmallVector<int, 4> DMask = getPSHUFShuffleMask(D);
22949 int NOffset = N.getOpcode() == X86ISD::PSHUFLW ? 0 : 4;
22950 int VOffset = V.getOpcode() == X86ISD::PSHUFLW ? 0 : 4;
22952 for (int i = 0; i < 4; ++i) {
22953 WordMask[i + NOffset] = Mask[i] + NOffset;
22954 WordMask[i + VOffset] = VMask[i] + VOffset;
22956 // Map the word mask through the DWord mask.
22958 for (int i = 0; i < 8; ++i)
22959 MappedMask[i] = 2 * DMask[WordMask[i] / 2] + WordMask[i] % 2;
22960 if (makeArrayRef(MappedMask).equals({0, 0, 1, 1, 2, 2, 3, 3}) ||
22961 makeArrayRef(MappedMask).equals({4, 4, 5, 5, 6, 6, 7, 7})) {
22962 // We can replace all three shuffles with an unpack.
22963 V = DAG.getBitcast(VT, D.getOperand(0));
22964 DCI.AddToWorklist(V.getNode());
22965 return DAG.getNode(MappedMask[0] == 0 ? X86ISD::UNPCKL
22974 case X86ISD::PSHUFD:
22975 if (SDValue NewN = combineRedundantDWordShuffle(N, Mask, DAG, DCI))
22984 /// \brief Try to combine a shuffle into a target-specific add-sub node.
22986 /// We combine this directly on the abstract vector shuffle nodes so it is
22987 /// easier to generically match. We also insert dummy vector shuffle nodes for
22988 /// the operands which explicitly discard the lanes which are unused by this
22989 /// operation to try to flow through the rest of the combiner the fact that
22990 /// they're unused.
22991 static SDValue combineShuffleToAddSub(SDNode *N, SelectionDAG &DAG) {
22993 EVT VT = N->getValueType(0);
22995 // We only handle target-independent shuffles.
22996 // FIXME: It would be easy and harmless to use the target shuffle mask
22997 // extraction tool to support more.
22998 if (N->getOpcode() != ISD::VECTOR_SHUFFLE)
23001 auto *SVN = cast<ShuffleVectorSDNode>(N);
23002 ArrayRef<int> Mask = SVN->getMask();
23003 SDValue V1 = N->getOperand(0);
23004 SDValue V2 = N->getOperand(1);
23006 // We require the first shuffle operand to be the SUB node, and the second to
23007 // be the ADD node.
23008 // FIXME: We should support the commuted patterns.
23009 if (V1->getOpcode() != ISD::FSUB || V2->getOpcode() != ISD::FADD)
23012 // If there are other uses of these operations we can't fold them.
23013 if (!V1->hasOneUse() || !V2->hasOneUse())
23016 // Ensure that both operations have the same operands. Note that we can
23017 // commute the FADD operands.
23018 SDValue LHS = V1->getOperand(0), RHS = V1->getOperand(1);
23019 if ((V2->getOperand(0) != LHS || V2->getOperand(1) != RHS) &&
23020 (V2->getOperand(0) != RHS || V2->getOperand(1) != LHS))
23023 // We're looking for blends between FADD and FSUB nodes. We insist on these
23024 // nodes being lined up in a specific expected pattern.
23025 if (!(isShuffleEquivalent(V1, V2, Mask, {0, 3}) ||
23026 isShuffleEquivalent(V1, V2, Mask, {0, 5, 2, 7}) ||
23027 isShuffleEquivalent(V1, V2, Mask, {0, 9, 2, 11, 4, 13, 6, 15})))
23030 // Only specific types are legal at this point, assert so we notice if and
23031 // when these change.
23032 assert((VT == MVT::v4f32 || VT == MVT::v2f64 || VT == MVT::v8f32 ||
23033 VT == MVT::v4f64) &&
23034 "Unknown vector type encountered!");
23036 return DAG.getNode(X86ISD::ADDSUB, DL, VT, LHS, RHS);
23039 /// PerformShuffleCombine - Performs several different shuffle combines.
23040 static SDValue PerformShuffleCombine(SDNode *N, SelectionDAG &DAG,
23041 TargetLowering::DAGCombinerInfo &DCI,
23042 const X86Subtarget *Subtarget) {
23044 SDValue N0 = N->getOperand(0);
23045 SDValue N1 = N->getOperand(1);
23046 EVT VT = N->getValueType(0);
23048 // Don't create instructions with illegal types after legalize types has run.
23049 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
23050 if (!DCI.isBeforeLegalize() && !TLI.isTypeLegal(VT.getVectorElementType()))
23053 // If we have legalized the vector types, look for blends of FADD and FSUB
23054 // nodes that we can fuse into an ADDSUB node.
23055 if (TLI.isTypeLegal(VT) && Subtarget->hasSSE3())
23056 if (SDValue AddSub = combineShuffleToAddSub(N, DAG))
23059 // Combine 256-bit vector shuffles. This is only profitable when in AVX mode
23060 if (Subtarget->hasFp256() && VT.is256BitVector() &&
23061 N->getOpcode() == ISD::VECTOR_SHUFFLE)
23062 return PerformShuffleCombine256(N, DAG, DCI, Subtarget);
23064 // During Type Legalization, when promoting illegal vector types,
23065 // the backend might introduce new shuffle dag nodes and bitcasts.
23067 // This code performs the following transformation:
23068 // fold: (shuffle (bitcast (BINOP A, B)), Undef, <Mask>) ->
23069 // (shuffle (BINOP (bitcast A), (bitcast B)), Undef, <Mask>)
23071 // We do this only if both the bitcast and the BINOP dag nodes have
23072 // one use. Also, perform this transformation only if the new binary
23073 // operation is legal. This is to avoid introducing dag nodes that
23074 // potentially need to be further expanded (or custom lowered) into a
23075 // less optimal sequence of dag nodes.
23076 if (!DCI.isBeforeLegalize() && DCI.isBeforeLegalizeOps() &&
23077 N1.getOpcode() == ISD::UNDEF && N0.hasOneUse() &&
23078 N0.getOpcode() == ISD::BITCAST) {
23079 SDValue BC0 = N0.getOperand(0);
23080 EVT SVT = BC0.getValueType();
23081 unsigned Opcode = BC0.getOpcode();
23082 unsigned NumElts = VT.getVectorNumElements();
23084 if (BC0.hasOneUse() && SVT.isVector() &&
23085 SVT.getVectorNumElements() * 2 == NumElts &&
23086 TLI.isOperationLegal(Opcode, VT)) {
23087 bool CanFold = false;
23099 unsigned SVTNumElts = SVT.getVectorNumElements();
23100 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(N);
23101 for (unsigned i = 0, e = SVTNumElts; i != e && CanFold; ++i)
23102 CanFold = SVOp->getMaskElt(i) == (int)(i * 2);
23103 for (unsigned i = SVTNumElts, e = NumElts; i != e && CanFold; ++i)
23104 CanFold = SVOp->getMaskElt(i) < 0;
23107 SDValue BC00 = DAG.getBitcast(VT, BC0.getOperand(0));
23108 SDValue BC01 = DAG.getBitcast(VT, BC0.getOperand(1));
23109 SDValue NewBinOp = DAG.getNode(BC0.getOpcode(), dl, VT, BC00, BC01);
23110 return DAG.getVectorShuffle(VT, dl, NewBinOp, N1, &SVOp->getMask()[0]);
23115 // Combine a vector_shuffle that is equal to build_vector load1, load2, load3,
23116 // load4, <0, 1, 2, 3> into a 128-bit load if the load addresses are
23117 // consecutive, non-overlapping, and in the right order.
23118 SmallVector<SDValue, 16> Elts;
23119 for (unsigned i = 0, e = VT.getVectorNumElements(); i != e; ++i)
23120 Elts.push_back(getShuffleScalarElt(N, i, DAG, 0));
23122 if (SDValue LD = EltsFromConsecutiveLoads(VT, Elts, dl, DAG, true))
23125 if (isTargetShuffle(N->getOpcode())) {
23127 PerformTargetShuffleCombine(SDValue(N, 0), DAG, DCI, Subtarget);
23128 if (Shuffle.getNode())
23131 // Try recursively combining arbitrary sequences of x86 shuffle
23132 // instructions into higher-order shuffles. We do this after combining
23133 // specific PSHUF instruction sequences into their minimal form so that we
23134 // can evaluate how many specialized shuffle instructions are involved in
23135 // a particular chain.
23136 SmallVector<int, 1> NonceMask; // Just a placeholder.
23137 NonceMask.push_back(0);
23138 if (combineX86ShufflesRecursively(SDValue(N, 0), SDValue(N, 0), NonceMask,
23139 /*Depth*/ 1, /*HasPSHUFB*/ false, DAG,
23141 return SDValue(); // This routine will use CombineTo to replace N.
23147 /// XFormVExtractWithShuffleIntoLoad - Check if a vector extract from a target
23148 /// specific shuffle of a load can be folded into a single element load.
23149 /// Similar handling for VECTOR_SHUFFLE is performed by DAGCombiner, but
23150 /// shuffles have been custom lowered so we need to handle those here.
23151 static SDValue XFormVExtractWithShuffleIntoLoad(SDNode *N, SelectionDAG &DAG,
23152 TargetLowering::DAGCombinerInfo &DCI) {
23153 if (DCI.isBeforeLegalizeOps())
23156 SDValue InVec = N->getOperand(0);
23157 SDValue EltNo = N->getOperand(1);
23159 if (!isa<ConstantSDNode>(EltNo))
23162 EVT OriginalVT = InVec.getValueType();
23164 if (InVec.getOpcode() == ISD::BITCAST) {
23165 // Don't duplicate a load with other uses.
23166 if (!InVec.hasOneUse())
23168 EVT BCVT = InVec.getOperand(0).getValueType();
23169 if (!BCVT.isVector() ||
23170 BCVT.getVectorNumElements() != OriginalVT.getVectorNumElements())
23172 InVec = InVec.getOperand(0);
23175 EVT CurrentVT = InVec.getValueType();
23177 if (!isTargetShuffle(InVec.getOpcode()))
23180 // Don't duplicate a load with other uses.
23181 if (!InVec.hasOneUse())
23184 SmallVector<int, 16> ShuffleMask;
23186 if (!getTargetShuffleMask(InVec.getNode(), CurrentVT.getSimpleVT(),
23187 ShuffleMask, UnaryShuffle))
23190 // Select the input vector, guarding against out of range extract vector.
23191 unsigned NumElems = CurrentVT.getVectorNumElements();
23192 int Elt = cast<ConstantSDNode>(EltNo)->getZExtValue();
23193 int Idx = (Elt > (int)NumElems) ? -1 : ShuffleMask[Elt];
23194 SDValue LdNode = (Idx < (int)NumElems) ? InVec.getOperand(0)
23195 : InVec.getOperand(1);
23197 // If inputs to shuffle are the same for both ops, then allow 2 uses
23198 unsigned AllowedUses = InVec.getNumOperands() > 1 &&
23199 InVec.getOperand(0) == InVec.getOperand(1) ? 2 : 1;
23201 if (LdNode.getOpcode() == ISD::BITCAST) {
23202 // Don't duplicate a load with other uses.
23203 if (!LdNode.getNode()->hasNUsesOfValue(AllowedUses, 0))
23206 AllowedUses = 1; // only allow 1 load use if we have a bitcast
23207 LdNode = LdNode.getOperand(0);
23210 if (!ISD::isNormalLoad(LdNode.getNode()))
23213 LoadSDNode *LN0 = cast<LoadSDNode>(LdNode);
23215 if (!LN0 ||!LN0->hasNUsesOfValue(AllowedUses, 0) || LN0->isVolatile())
23218 EVT EltVT = N->getValueType(0);
23219 // If there's a bitcast before the shuffle, check if the load type and
23220 // alignment is valid.
23221 unsigned Align = LN0->getAlignment();
23222 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
23223 unsigned NewAlign = DAG.getDataLayout().getABITypeAlignment(
23224 EltVT.getTypeForEVT(*DAG.getContext()));
23226 if (NewAlign > Align || !TLI.isOperationLegalOrCustom(ISD::LOAD, EltVT))
23229 // All checks match so transform back to vector_shuffle so that DAG combiner
23230 // can finish the job
23233 // Create shuffle node taking into account the case that its a unary shuffle
23234 SDValue Shuffle = (UnaryShuffle) ? DAG.getUNDEF(CurrentVT)
23235 : InVec.getOperand(1);
23236 Shuffle = DAG.getVectorShuffle(CurrentVT, dl,
23237 InVec.getOperand(0), Shuffle,
23239 Shuffle = DAG.getBitcast(OriginalVT, Shuffle);
23240 return DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, N->getValueType(0), Shuffle,
23244 static SDValue PerformBITCASTCombine(SDNode *N, SelectionDAG &DAG,
23245 const X86Subtarget *Subtarget) {
23246 SDValue N0 = N->getOperand(0);
23247 EVT VT = N->getValueType(0);
23249 // Detect bitcasts between i32 to x86mmx low word. Since MMX types are
23250 // special and don't usually play with other vector types, it's better to
23251 // handle them early to be sure we emit efficient code by avoiding
23252 // store-load conversions.
23253 if (VT == MVT::x86mmx && N0.getOpcode() == ISD::BUILD_VECTOR &&
23254 N0.getValueType() == MVT::v2i32 &&
23255 isa<ConstantSDNode>(N0.getOperand(1))) {
23256 SDValue N00 = N0->getOperand(0);
23257 if (N0.getConstantOperandVal(1) == 0 && N00.getValueType() == MVT::i32)
23258 return DAG.getNode(X86ISD::MMX_MOVW2D, SDLoc(N00), VT, N00);
23261 // Convert a bitcasted integer logic operation that has one bitcasted
23262 // floating-point operand and one constant operand into a floating-point
23263 // logic operation. This may create a load of the constant, but that is
23264 // cheaper than materializing the constant in an integer register and
23265 // transferring it to an SSE register or transferring the SSE operand to
23266 // integer register and back.
23268 switch (N0.getOpcode()) {
23269 case ISD::AND: FPOpcode = X86ISD::FAND; break;
23270 case ISD::OR: FPOpcode = X86ISD::FOR; break;
23271 case ISD::XOR: FPOpcode = X86ISD::FXOR; break;
23272 default: return SDValue();
23274 if (((Subtarget->hasSSE1() && VT == MVT::f32) ||
23275 (Subtarget->hasSSE2() && VT == MVT::f64)) &&
23276 isa<ConstantSDNode>(N0.getOperand(1)) &&
23277 N0.getOperand(0).getOpcode() == ISD::BITCAST &&
23278 N0.getOperand(0).getOperand(0).getValueType() == VT) {
23279 SDValue N000 = N0.getOperand(0).getOperand(0);
23280 SDValue FPConst = DAG.getBitcast(VT, N0.getOperand(1));
23281 return DAG.getNode(FPOpcode, SDLoc(N0), VT, N000, FPConst);
23287 /// PerformEXTRACT_VECTOR_ELTCombine - Detect vector gather/scatter index
23288 /// generation and convert it from being a bunch of shuffles and extracts
23289 /// into a somewhat faster sequence. For i686, the best sequence is apparently
23290 /// storing the value and loading scalars back, while for x64 we should
23291 /// use 64-bit extracts and shifts.
23292 static SDValue PerformEXTRACT_VECTOR_ELTCombine(SDNode *N, SelectionDAG &DAG,
23293 TargetLowering::DAGCombinerInfo &DCI) {
23294 if (SDValue NewOp = XFormVExtractWithShuffleIntoLoad(N, DAG, DCI))
23297 SDValue InputVector = N->getOperand(0);
23298 SDLoc dl(InputVector);
23299 // Detect mmx to i32 conversion through a v2i32 elt extract.
23300 if (InputVector.getOpcode() == ISD::BITCAST && InputVector.hasOneUse() &&
23301 N->getValueType(0) == MVT::i32 &&
23302 InputVector.getValueType() == MVT::v2i32) {
23304 // The bitcast source is a direct mmx result.
23305 SDValue MMXSrc = InputVector.getNode()->getOperand(0);
23306 if (MMXSrc.getValueType() == MVT::x86mmx)
23307 return DAG.getNode(X86ISD::MMX_MOVD2W, SDLoc(InputVector),
23308 N->getValueType(0),
23309 InputVector.getNode()->getOperand(0));
23311 // The mmx is indirect: (i64 extract_elt (v1i64 bitcast (x86mmx ...))).
23312 if (MMXSrc.getOpcode() == ISD::EXTRACT_VECTOR_ELT && MMXSrc.hasOneUse() &&
23313 MMXSrc.getValueType() == MVT::i64) {
23314 SDValue MMXSrcOp = MMXSrc.getOperand(0);
23315 if (MMXSrcOp.hasOneUse() && MMXSrcOp.getOpcode() == ISD::BITCAST &&
23316 MMXSrcOp.getValueType() == MVT::v1i64 &&
23317 MMXSrcOp.getOperand(0).getValueType() == MVT::x86mmx)
23318 return DAG.getNode(X86ISD::MMX_MOVD2W, SDLoc(InputVector),
23319 N->getValueType(0), MMXSrcOp.getOperand(0));
23323 EVT VT = N->getValueType(0);
23325 if (VT == MVT::i1 && isa<ConstantSDNode>(N->getOperand(1)) &&
23326 InputVector.getOpcode() == ISD::BITCAST &&
23327 isa<ConstantSDNode>(InputVector.getOperand(0))) {
23328 uint64_t ExtractedElt =
23329 cast<ConstantSDNode>(N->getOperand(1))->getZExtValue();
23330 uint64_t InputValue =
23331 cast<ConstantSDNode>(InputVector.getOperand(0))->getZExtValue();
23332 uint64_t Res = (InputValue >> ExtractedElt) & 1;
23333 return DAG.getConstant(Res, dl, MVT::i1);
23335 // Only operate on vectors of 4 elements, where the alternative shuffling
23336 // gets to be more expensive.
23337 if (InputVector.getValueType() != MVT::v4i32)
23340 // Check whether every use of InputVector is an EXTRACT_VECTOR_ELT with a
23341 // single use which is a sign-extend or zero-extend, and all elements are
23343 SmallVector<SDNode *, 4> Uses;
23344 unsigned ExtractedElements = 0;
23345 for (SDNode::use_iterator UI = InputVector.getNode()->use_begin(),
23346 UE = InputVector.getNode()->use_end(); UI != UE; ++UI) {
23347 if (UI.getUse().getResNo() != InputVector.getResNo())
23350 SDNode *Extract = *UI;
23351 if (Extract->getOpcode() != ISD::EXTRACT_VECTOR_ELT)
23354 if (Extract->getValueType(0) != MVT::i32)
23356 if (!Extract->hasOneUse())
23358 if (Extract->use_begin()->getOpcode() != ISD::SIGN_EXTEND &&
23359 Extract->use_begin()->getOpcode() != ISD::ZERO_EXTEND)
23361 if (!isa<ConstantSDNode>(Extract->getOperand(1)))
23364 // Record which element was extracted.
23365 ExtractedElements |=
23366 1 << cast<ConstantSDNode>(Extract->getOperand(1))->getZExtValue();
23368 Uses.push_back(Extract);
23371 // If not all the elements were used, this may not be worthwhile.
23372 if (ExtractedElements != 15)
23375 // Ok, we've now decided to do the transformation.
23376 // If 64-bit shifts are legal, use the extract-shift sequence,
23377 // otherwise bounce the vector off the cache.
23378 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
23381 if (TLI.isOperationLegal(ISD::SRA, MVT::i64)) {
23382 SDValue Cst = DAG.getBitcast(MVT::v2i64, InputVector);
23383 auto &DL = DAG.getDataLayout();
23384 EVT VecIdxTy = DAG.getTargetLoweringInfo().getVectorIdxTy(DL);
23385 SDValue BottomHalf = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::i64, Cst,
23386 DAG.getConstant(0, dl, VecIdxTy));
23387 SDValue TopHalf = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::i64, Cst,
23388 DAG.getConstant(1, dl, VecIdxTy));
23390 SDValue ShAmt = DAG.getConstant(
23391 32, dl, DAG.getTargetLoweringInfo().getShiftAmountTy(MVT::i64, DL));
23392 Vals[0] = DAG.getNode(ISD::TRUNCATE, dl, MVT::i32, BottomHalf);
23393 Vals[1] = DAG.getNode(ISD::TRUNCATE, dl, MVT::i32,
23394 DAG.getNode(ISD::SRA, dl, MVT::i64, BottomHalf, ShAmt));
23395 Vals[2] = DAG.getNode(ISD::TRUNCATE, dl, MVT::i32, TopHalf);
23396 Vals[3] = DAG.getNode(ISD::TRUNCATE, dl, MVT::i32,
23397 DAG.getNode(ISD::SRA, dl, MVT::i64, TopHalf, ShAmt));
23399 // Store the value to a temporary stack slot.
23400 SDValue StackPtr = DAG.CreateStackTemporary(InputVector.getValueType());
23401 SDValue Ch = DAG.getStore(DAG.getEntryNode(), dl, InputVector, StackPtr,
23402 MachinePointerInfo(), false, false, 0);
23404 EVT ElementType = InputVector.getValueType().getVectorElementType();
23405 unsigned EltSize = ElementType.getSizeInBits() / 8;
23407 // Replace each use (extract) with a load of the appropriate element.
23408 for (unsigned i = 0; i < 4; ++i) {
23409 uint64_t Offset = EltSize * i;
23410 auto PtrVT = TLI.getPointerTy(DAG.getDataLayout());
23411 SDValue OffsetVal = DAG.getConstant(Offset, dl, PtrVT);
23413 SDValue ScalarAddr =
23414 DAG.getNode(ISD::ADD, dl, PtrVT, StackPtr, OffsetVal);
23416 // Load the scalar.
23417 Vals[i] = DAG.getLoad(ElementType, dl, Ch,
23418 ScalarAddr, MachinePointerInfo(),
23419 false, false, false, 0);
23424 // Replace the extracts
23425 for (SmallVectorImpl<SDNode *>::iterator UI = Uses.begin(),
23426 UE = Uses.end(); UI != UE; ++UI) {
23427 SDNode *Extract = *UI;
23429 SDValue Idx = Extract->getOperand(1);
23430 uint64_t IdxVal = cast<ConstantSDNode>(Idx)->getZExtValue();
23431 DAG.ReplaceAllUsesOfValueWith(SDValue(Extract, 0), Vals[IdxVal]);
23434 // The replacement was made in place; don't return anything.
23439 transformVSELECTtoBlendVECTOR_SHUFFLE(SDNode *N, SelectionDAG &DAG,
23440 const X86Subtarget *Subtarget) {
23442 SDValue Cond = N->getOperand(0);
23443 SDValue LHS = N->getOperand(1);
23444 SDValue RHS = N->getOperand(2);
23446 if (Cond.getOpcode() == ISD::SIGN_EXTEND) {
23447 SDValue CondSrc = Cond->getOperand(0);
23448 if (CondSrc->getOpcode() == ISD::SIGN_EXTEND_INREG)
23449 Cond = CondSrc->getOperand(0);
23452 if (!ISD::isBuildVectorOfConstantSDNodes(Cond.getNode()))
23455 // A vselect where all conditions and data are constants can be optimized into
23456 // a single vector load by SelectionDAGLegalize::ExpandBUILD_VECTOR().
23457 if (ISD::isBuildVectorOfConstantSDNodes(LHS.getNode()) &&
23458 ISD::isBuildVectorOfConstantSDNodes(RHS.getNode()))
23461 unsigned MaskValue = 0;
23462 if (!BUILD_VECTORtoBlendMask(cast<BuildVectorSDNode>(Cond), MaskValue))
23465 MVT VT = N->getSimpleValueType(0);
23466 unsigned NumElems = VT.getVectorNumElements();
23467 SmallVector<int, 8> ShuffleMask(NumElems, -1);
23468 for (unsigned i = 0; i < NumElems; ++i) {
23469 // Be sure we emit undef where we can.
23470 if (Cond.getOperand(i)->getOpcode() == ISD::UNDEF)
23471 ShuffleMask[i] = -1;
23473 ShuffleMask[i] = i + NumElems * ((MaskValue >> i) & 1);
23476 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
23477 if (!TLI.isShuffleMaskLegal(ShuffleMask, VT))
23479 return DAG.getVectorShuffle(VT, dl, LHS, RHS, &ShuffleMask[0]);
23482 /// PerformSELECTCombine - Do target-specific dag combines on SELECT and VSELECT
23484 static SDValue PerformSELECTCombine(SDNode *N, SelectionDAG &DAG,
23485 TargetLowering::DAGCombinerInfo &DCI,
23486 const X86Subtarget *Subtarget) {
23488 SDValue Cond = N->getOperand(0);
23489 // Get the LHS/RHS of the select.
23490 SDValue LHS = N->getOperand(1);
23491 SDValue RHS = N->getOperand(2);
23492 EVT VT = LHS.getValueType();
23493 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
23495 // If we have SSE[12] support, try to form min/max nodes. SSE min/max
23496 // instructions match the semantics of the common C idiom x<y?x:y but not
23497 // x<=y?x:y, because of how they handle negative zero (which can be
23498 // ignored in unsafe-math mode).
23499 // We also try to create v2f32 min/max nodes, which we later widen to v4f32.
23500 if (Cond.getOpcode() == ISD::SETCC && VT.isFloatingPoint() &&
23501 VT != MVT::f80 && (TLI.isTypeLegal(VT) || VT == MVT::v2f32) &&
23502 (Subtarget->hasSSE2() ||
23503 (Subtarget->hasSSE1() && VT.getScalarType() == MVT::f32))) {
23504 ISD::CondCode CC = cast<CondCodeSDNode>(Cond.getOperand(2))->get();
23506 unsigned Opcode = 0;
23507 // Check for x CC y ? x : y.
23508 if (DAG.isEqualTo(LHS, Cond.getOperand(0)) &&
23509 DAG.isEqualTo(RHS, Cond.getOperand(1))) {
23513 // Converting this to a min would handle NaNs incorrectly, and swapping
23514 // the operands would cause it to handle comparisons between positive
23515 // and negative zero incorrectly.
23516 if (!DAG.isKnownNeverNaN(LHS) || !DAG.isKnownNeverNaN(RHS)) {
23517 if (!DAG.getTarget().Options.UnsafeFPMath &&
23518 !(DAG.isKnownNeverZero(LHS) || DAG.isKnownNeverZero(RHS)))
23520 std::swap(LHS, RHS);
23522 Opcode = X86ISD::FMIN;
23525 // Converting this to a min would handle comparisons between positive
23526 // and negative zero incorrectly.
23527 if (!DAG.getTarget().Options.UnsafeFPMath &&
23528 !DAG.isKnownNeverZero(LHS) && !DAG.isKnownNeverZero(RHS))
23530 Opcode = X86ISD::FMIN;
23533 // Converting this to a min would handle both negative zeros and NaNs
23534 // incorrectly, but we can swap the operands to fix both.
23535 std::swap(LHS, RHS);
23539 Opcode = X86ISD::FMIN;
23543 // Converting this to a max would handle comparisons between positive
23544 // and negative zero incorrectly.
23545 if (!DAG.getTarget().Options.UnsafeFPMath &&
23546 !DAG.isKnownNeverZero(LHS) && !DAG.isKnownNeverZero(RHS))
23548 Opcode = X86ISD::FMAX;
23551 // Converting this to a max would handle NaNs incorrectly, and swapping
23552 // the operands would cause it to handle comparisons between positive
23553 // and negative zero incorrectly.
23554 if (!DAG.isKnownNeverNaN(LHS) || !DAG.isKnownNeverNaN(RHS)) {
23555 if (!DAG.getTarget().Options.UnsafeFPMath &&
23556 !(DAG.isKnownNeverZero(LHS) || DAG.isKnownNeverZero(RHS)))
23558 std::swap(LHS, RHS);
23560 Opcode = X86ISD::FMAX;
23563 // Converting this to a max would handle both negative zeros and NaNs
23564 // incorrectly, but we can swap the operands to fix both.
23565 std::swap(LHS, RHS);
23569 Opcode = X86ISD::FMAX;
23572 // Check for x CC y ? y : x -- a min/max with reversed arms.
23573 } else if (DAG.isEqualTo(LHS, Cond.getOperand(1)) &&
23574 DAG.isEqualTo(RHS, Cond.getOperand(0))) {
23578 // Converting this to a min would handle comparisons between positive
23579 // and negative zero incorrectly, and swapping the operands would
23580 // cause it to handle NaNs incorrectly.
23581 if (!DAG.getTarget().Options.UnsafeFPMath &&
23582 !(DAG.isKnownNeverZero(LHS) || DAG.isKnownNeverZero(RHS))) {
23583 if (!DAG.isKnownNeverNaN(LHS) || !DAG.isKnownNeverNaN(RHS))
23585 std::swap(LHS, RHS);
23587 Opcode = X86ISD::FMIN;
23590 // Converting this to a min would handle NaNs incorrectly.
23591 if (!DAG.getTarget().Options.UnsafeFPMath &&
23592 (!DAG.isKnownNeverNaN(LHS) || !DAG.isKnownNeverNaN(RHS)))
23594 Opcode = X86ISD::FMIN;
23597 // Converting this to a min would handle both negative zeros and NaNs
23598 // incorrectly, but we can swap the operands to fix both.
23599 std::swap(LHS, RHS);
23603 Opcode = X86ISD::FMIN;
23607 // Converting this to a max would handle NaNs incorrectly.
23608 if (!DAG.isKnownNeverNaN(LHS) || !DAG.isKnownNeverNaN(RHS))
23610 Opcode = X86ISD::FMAX;
23613 // Converting this to a max would handle comparisons between positive
23614 // and negative zero incorrectly, and swapping the operands would
23615 // cause it to handle NaNs incorrectly.
23616 if (!DAG.getTarget().Options.UnsafeFPMath &&
23617 !DAG.isKnownNeverZero(LHS) && !DAG.isKnownNeverZero(RHS)) {
23618 if (!DAG.isKnownNeverNaN(LHS) || !DAG.isKnownNeverNaN(RHS))
23620 std::swap(LHS, RHS);
23622 Opcode = X86ISD::FMAX;
23625 // Converting this to a max would handle both negative zeros and NaNs
23626 // incorrectly, but we can swap the operands to fix both.
23627 std::swap(LHS, RHS);
23631 Opcode = X86ISD::FMAX;
23637 return DAG.getNode(Opcode, DL, N->getValueType(0), LHS, RHS);
23640 EVT CondVT = Cond.getValueType();
23641 if (Subtarget->hasAVX512() && VT.isVector() && CondVT.isVector() &&
23642 CondVT.getVectorElementType() == MVT::i1) {
23643 // v16i8 (select v16i1, v16i8, v16i8) does not have a proper
23644 // lowering on KNL. In this case we convert it to
23645 // v16i8 (select v16i8, v16i8, v16i8) and use AVX instruction.
23646 // The same situation for all 128 and 256-bit vectors of i8 and i16.
23647 // Since SKX these selects have a proper lowering.
23648 EVT OpVT = LHS.getValueType();
23649 if ((OpVT.is128BitVector() || OpVT.is256BitVector()) &&
23650 (OpVT.getVectorElementType() == MVT::i8 ||
23651 OpVT.getVectorElementType() == MVT::i16) &&
23652 !(Subtarget->hasBWI() && Subtarget->hasVLX())) {
23653 Cond = DAG.getNode(ISD::SIGN_EXTEND, DL, OpVT, Cond);
23654 DCI.AddToWorklist(Cond.getNode());
23655 return DAG.getNode(N->getOpcode(), DL, OpVT, Cond, LHS, RHS);
23658 // If this is a select between two integer constants, try to do some
23660 if (ConstantSDNode *TrueC = dyn_cast<ConstantSDNode>(LHS)) {
23661 if (ConstantSDNode *FalseC = dyn_cast<ConstantSDNode>(RHS))
23662 // Don't do this for crazy integer types.
23663 if (DAG.getTargetLoweringInfo().isTypeLegal(LHS.getValueType())) {
23664 // If this is efficiently invertible, canonicalize the LHSC/RHSC values
23665 // so that TrueC (the true value) is larger than FalseC.
23666 bool NeedsCondInvert = false;
23668 if (TrueC->getAPIntValue().ult(FalseC->getAPIntValue()) &&
23669 // Efficiently invertible.
23670 (Cond.getOpcode() == ISD::SETCC || // setcc -> invertible.
23671 (Cond.getOpcode() == ISD::XOR && // xor(X, C) -> invertible.
23672 isa<ConstantSDNode>(Cond.getOperand(1))))) {
23673 NeedsCondInvert = true;
23674 std::swap(TrueC, FalseC);
23677 // Optimize C ? 8 : 0 -> zext(C) << 3. Likewise for any pow2/0.
23678 if (FalseC->getAPIntValue() == 0 &&
23679 TrueC->getAPIntValue().isPowerOf2()) {
23680 if (NeedsCondInvert) // Invert the condition if needed.
23681 Cond = DAG.getNode(ISD::XOR, DL, Cond.getValueType(), Cond,
23682 DAG.getConstant(1, DL, Cond.getValueType()));
23684 // Zero extend the condition if needed.
23685 Cond = DAG.getNode(ISD::ZERO_EXTEND, DL, LHS.getValueType(), Cond);
23687 unsigned ShAmt = TrueC->getAPIntValue().logBase2();
23688 return DAG.getNode(ISD::SHL, DL, LHS.getValueType(), Cond,
23689 DAG.getConstant(ShAmt, DL, MVT::i8));
23692 // Optimize Cond ? cst+1 : cst -> zext(setcc(C)+cst.
23693 if (FalseC->getAPIntValue()+1 == TrueC->getAPIntValue()) {
23694 if (NeedsCondInvert) // Invert the condition if needed.
23695 Cond = DAG.getNode(ISD::XOR, DL, Cond.getValueType(), Cond,
23696 DAG.getConstant(1, DL, Cond.getValueType()));
23698 // Zero extend the condition if needed.
23699 Cond = DAG.getNode(ISD::ZERO_EXTEND, DL,
23700 FalseC->getValueType(0), Cond);
23701 return DAG.getNode(ISD::ADD, DL, Cond.getValueType(), Cond,
23702 SDValue(FalseC, 0));
23705 // Optimize cases that will turn into an LEA instruction. This requires
23706 // an i32 or i64 and an efficient multiplier (1, 2, 3, 4, 5, 8, 9).
23707 if (N->getValueType(0) == MVT::i32 || N->getValueType(0) == MVT::i64) {
23708 uint64_t Diff = TrueC->getZExtValue()-FalseC->getZExtValue();
23709 if (N->getValueType(0) == MVT::i32) Diff = (unsigned)Diff;
23711 bool isFastMultiplier = false;
23713 switch ((unsigned char)Diff) {
23715 case 1: // result = add base, cond
23716 case 2: // result = lea base( , cond*2)
23717 case 3: // result = lea base(cond, cond*2)
23718 case 4: // result = lea base( , cond*4)
23719 case 5: // result = lea base(cond, cond*4)
23720 case 8: // result = lea base( , cond*8)
23721 case 9: // result = lea base(cond, cond*8)
23722 isFastMultiplier = true;
23727 if (isFastMultiplier) {
23728 APInt Diff = TrueC->getAPIntValue()-FalseC->getAPIntValue();
23729 if (NeedsCondInvert) // Invert the condition if needed.
23730 Cond = DAG.getNode(ISD::XOR, DL, Cond.getValueType(), Cond,
23731 DAG.getConstant(1, DL, Cond.getValueType()));
23733 // Zero extend the condition if needed.
23734 Cond = DAG.getNode(ISD::ZERO_EXTEND, DL, FalseC->getValueType(0),
23736 // Scale the condition by the difference.
23738 Cond = DAG.getNode(ISD::MUL, DL, Cond.getValueType(), Cond,
23739 DAG.getConstant(Diff, DL,
23740 Cond.getValueType()));
23742 // Add the base if non-zero.
23743 if (FalseC->getAPIntValue() != 0)
23744 Cond = DAG.getNode(ISD::ADD, DL, Cond.getValueType(), Cond,
23745 SDValue(FalseC, 0));
23752 // Canonicalize max and min:
23753 // (x > y) ? x : y -> (x >= y) ? x : y
23754 // (x < y) ? x : y -> (x <= y) ? x : y
23755 // This allows use of COND_S / COND_NS (see TranslateX86CC) which eliminates
23756 // the need for an extra compare
23757 // against zero. e.g.
23758 // (x - y) > 0 : (x - y) ? 0 -> (x - y) >= 0 : (x - y) ? 0
23760 // testl %edi, %edi
23762 // cmovgl %edi, %eax
23766 // cmovsl %eax, %edi
23767 if (N->getOpcode() == ISD::SELECT && Cond.getOpcode() == ISD::SETCC &&
23768 DAG.isEqualTo(LHS, Cond.getOperand(0)) &&
23769 DAG.isEqualTo(RHS, Cond.getOperand(1))) {
23770 ISD::CondCode CC = cast<CondCodeSDNode>(Cond.getOperand(2))->get();
23775 ISD::CondCode NewCC = (CC == ISD::SETLT) ? ISD::SETLE : ISD::SETGE;
23776 Cond = DAG.getSetCC(SDLoc(Cond), Cond.getValueType(),
23777 Cond.getOperand(0), Cond.getOperand(1), NewCC);
23778 return DAG.getNode(ISD::SELECT, DL, VT, Cond, LHS, RHS);
23783 // Early exit check
23784 if (!TLI.isTypeLegal(VT))
23787 // Match VSELECTs into subs with unsigned saturation.
23788 if (N->getOpcode() == ISD::VSELECT && Cond.getOpcode() == ISD::SETCC &&
23789 // psubus is available in SSE2 and AVX2 for i8 and i16 vectors.
23790 ((Subtarget->hasSSE2() && (VT == MVT::v16i8 || VT == MVT::v8i16)) ||
23791 (Subtarget->hasAVX2() && (VT == MVT::v32i8 || VT == MVT::v16i16)))) {
23792 ISD::CondCode CC = cast<CondCodeSDNode>(Cond.getOperand(2))->get();
23794 // Check if one of the arms of the VSELECT is a zero vector. If it's on the
23795 // left side invert the predicate to simplify logic below.
23797 if (ISD::isBuildVectorAllZeros(LHS.getNode())) {
23799 CC = ISD::getSetCCInverse(CC, true);
23800 } else if (ISD::isBuildVectorAllZeros(RHS.getNode())) {
23804 if (Other.getNode() && Other->getNumOperands() == 2 &&
23805 DAG.isEqualTo(Other->getOperand(0), Cond.getOperand(0))) {
23806 SDValue OpLHS = Other->getOperand(0), OpRHS = Other->getOperand(1);
23807 SDValue CondRHS = Cond->getOperand(1);
23809 // Look for a general sub with unsigned saturation first.
23810 // x >= y ? x-y : 0 --> subus x, y
23811 // x > y ? x-y : 0 --> subus x, y
23812 if ((CC == ISD::SETUGE || CC == ISD::SETUGT) &&
23813 Other->getOpcode() == ISD::SUB && DAG.isEqualTo(OpRHS, CondRHS))
23814 return DAG.getNode(X86ISD::SUBUS, DL, VT, OpLHS, OpRHS);
23816 if (auto *OpRHSBV = dyn_cast<BuildVectorSDNode>(OpRHS))
23817 if (auto *OpRHSConst = OpRHSBV->getConstantSplatNode()) {
23818 if (auto *CondRHSBV = dyn_cast<BuildVectorSDNode>(CondRHS))
23819 if (auto *CondRHSConst = CondRHSBV->getConstantSplatNode())
23820 // If the RHS is a constant we have to reverse the const
23821 // canonicalization.
23822 // x > C-1 ? x+-C : 0 --> subus x, C
23823 if (CC == ISD::SETUGT && Other->getOpcode() == ISD::ADD &&
23824 CondRHSConst->getAPIntValue() ==
23825 (-OpRHSConst->getAPIntValue() - 1))
23826 return DAG.getNode(
23827 X86ISD::SUBUS, DL, VT, OpLHS,
23828 DAG.getConstant(-OpRHSConst->getAPIntValue(), DL, VT));
23830 // Another special case: If C was a sign bit, the sub has been
23831 // canonicalized into a xor.
23832 // FIXME: Would it be better to use computeKnownBits to determine
23833 // whether it's safe to decanonicalize the xor?
23834 // x s< 0 ? x^C : 0 --> subus x, C
23835 if (CC == ISD::SETLT && Other->getOpcode() == ISD::XOR &&
23836 ISD::isBuildVectorAllZeros(CondRHS.getNode()) &&
23837 OpRHSConst->getAPIntValue().isSignBit())
23838 // Note that we have to rebuild the RHS constant here to ensure we
23839 // don't rely on particular values of undef lanes.
23840 return DAG.getNode(
23841 X86ISD::SUBUS, DL, VT, OpLHS,
23842 DAG.getConstant(OpRHSConst->getAPIntValue(), DL, VT));
23847 // Simplify vector selection if condition value type matches vselect
23849 if (N->getOpcode() == ISD::VSELECT && CondVT == VT) {
23850 assert(Cond.getValueType().isVector() &&
23851 "vector select expects a vector selector!");
23853 bool TValIsAllOnes = ISD::isBuildVectorAllOnes(LHS.getNode());
23854 bool FValIsAllZeros = ISD::isBuildVectorAllZeros(RHS.getNode());
23856 // Try invert the condition if true value is not all 1s and false value
23858 if (!TValIsAllOnes && !FValIsAllZeros &&
23859 // Check if the selector will be produced by CMPP*/PCMP*
23860 Cond.getOpcode() == ISD::SETCC &&
23861 // Check if SETCC has already been promoted
23862 TLI.getSetCCResultType(DAG.getDataLayout(), *DAG.getContext(), VT) ==
23864 bool TValIsAllZeros = ISD::isBuildVectorAllZeros(LHS.getNode());
23865 bool FValIsAllOnes = ISD::isBuildVectorAllOnes(RHS.getNode());
23867 if (TValIsAllZeros || FValIsAllOnes) {
23868 SDValue CC = Cond.getOperand(2);
23869 ISD::CondCode NewCC =
23870 ISD::getSetCCInverse(cast<CondCodeSDNode>(CC)->get(),
23871 Cond.getOperand(0).getValueType().isInteger());
23872 Cond = DAG.getSetCC(DL, CondVT, Cond.getOperand(0), Cond.getOperand(1), NewCC);
23873 std::swap(LHS, RHS);
23874 TValIsAllOnes = FValIsAllOnes;
23875 FValIsAllZeros = TValIsAllZeros;
23879 if (TValIsAllOnes || FValIsAllZeros) {
23882 if (TValIsAllOnes && FValIsAllZeros)
23884 else if (TValIsAllOnes)
23886 DAG.getNode(ISD::OR, DL, CondVT, Cond, DAG.getBitcast(CondVT, RHS));
23887 else if (FValIsAllZeros)
23888 Ret = DAG.getNode(ISD::AND, DL, CondVT, Cond,
23889 DAG.getBitcast(CondVT, LHS));
23891 return DAG.getBitcast(VT, Ret);
23895 // We should generate an X86ISD::BLENDI from a vselect if its argument
23896 // is a sign_extend_inreg of an any_extend of a BUILD_VECTOR of
23897 // constants. This specific pattern gets generated when we split a
23898 // selector for a 512 bit vector in a machine without AVX512 (but with
23899 // 256-bit vectors), during legalization:
23901 // (vselect (sign_extend (any_extend (BUILD_VECTOR)) i1) LHS RHS)
23903 // Iff we find this pattern and the build_vectors are built from
23904 // constants, we translate the vselect into a shuffle_vector that we
23905 // know will be matched by LowerVECTOR_SHUFFLEtoBlend.
23906 if ((N->getOpcode() == ISD::VSELECT ||
23907 N->getOpcode() == X86ISD::SHRUNKBLEND) &&
23908 !DCI.isBeforeLegalize() && !VT.is512BitVector()) {
23909 SDValue Shuffle = transformVSELECTtoBlendVECTOR_SHUFFLE(N, DAG, Subtarget);
23910 if (Shuffle.getNode())
23914 // If this is a *dynamic* select (non-constant condition) and we can match
23915 // this node with one of the variable blend instructions, restructure the
23916 // condition so that the blends can use the high bit of each element and use
23917 // SimplifyDemandedBits to simplify the condition operand.
23918 if (N->getOpcode() == ISD::VSELECT && DCI.isBeforeLegalizeOps() &&
23919 !DCI.isBeforeLegalize() &&
23920 !ISD::isBuildVectorOfConstantSDNodes(Cond.getNode())) {
23921 unsigned BitWidth = Cond.getValueType().getScalarSizeInBits();
23923 // Don't optimize vector selects that map to mask-registers.
23927 // We can only handle the cases where VSELECT is directly legal on the
23928 // subtarget. We custom lower VSELECT nodes with constant conditions and
23929 // this makes it hard to see whether a dynamic VSELECT will correctly
23930 // lower, so we both check the operation's status and explicitly handle the
23931 // cases where a *dynamic* blend will fail even though a constant-condition
23932 // blend could be custom lowered.
23933 // FIXME: We should find a better way to handle this class of problems.
23934 // Potentially, we should combine constant-condition vselect nodes
23935 // pre-legalization into shuffles and not mark as many types as custom
23937 if (!TLI.isOperationLegalOrCustom(ISD::VSELECT, VT))
23939 // FIXME: We don't support i16-element blends currently. We could and
23940 // should support them by making *all* the bits in the condition be set
23941 // rather than just the high bit and using an i8-element blend.
23942 if (VT.getVectorElementType() == MVT::i16)
23944 // Dynamic blending was only available from SSE4.1 onward.
23945 if (VT.is128BitVector() && !Subtarget->hasSSE41())
23947 // Byte blends are only available in AVX2
23948 if (VT == MVT::v32i8 && !Subtarget->hasAVX2())
23951 assert(BitWidth >= 8 && BitWidth <= 64 && "Invalid mask size");
23952 APInt DemandedMask = APInt::getHighBitsSet(BitWidth, 1);
23954 APInt KnownZero, KnownOne;
23955 TargetLowering::TargetLoweringOpt TLO(DAG, DCI.isBeforeLegalize(),
23956 DCI.isBeforeLegalizeOps());
23957 if (TLO.ShrinkDemandedConstant(Cond, DemandedMask) ||
23958 TLI.SimplifyDemandedBits(Cond, DemandedMask, KnownZero, KnownOne,
23960 // If we changed the computation somewhere in the DAG, this change
23961 // will affect all users of Cond.
23962 // Make sure it is fine and update all the nodes so that we do not
23963 // use the generic VSELECT anymore. Otherwise, we may perform
23964 // wrong optimizations as we messed up with the actual expectation
23965 // for the vector boolean values.
23966 if (Cond != TLO.Old) {
23967 // Check all uses of that condition operand to check whether it will be
23968 // consumed by non-BLEND instructions, which may depend on all bits are
23970 for (SDNode::use_iterator I = Cond->use_begin(), E = Cond->use_end();
23972 if (I->getOpcode() != ISD::VSELECT)
23973 // TODO: Add other opcodes eventually lowered into BLEND.
23976 // Update all the users of the condition, before committing the change,
23977 // so that the VSELECT optimizations that expect the correct vector
23978 // boolean value will not be triggered.
23979 for (SDNode::use_iterator I = Cond->use_begin(), E = Cond->use_end();
23981 DAG.ReplaceAllUsesOfValueWith(
23983 DAG.getNode(X86ISD::SHRUNKBLEND, SDLoc(*I), I->getValueType(0),
23984 Cond, I->getOperand(1), I->getOperand(2)));
23985 DCI.CommitTargetLoweringOpt(TLO);
23988 // At this point, only Cond is changed. Change the condition
23989 // just for N to keep the opportunity to optimize all other
23990 // users their own way.
23991 DAG.ReplaceAllUsesOfValueWith(
23993 DAG.getNode(X86ISD::SHRUNKBLEND, SDLoc(N), N->getValueType(0),
23994 TLO.New, N->getOperand(1), N->getOperand(2)));
24002 // Check whether a boolean test is testing a boolean value generated by
24003 // X86ISD::SETCC. If so, return the operand of that SETCC and proper condition
24006 // Simplify the following patterns:
24007 // (Op (CMP (SETCC Cond EFLAGS) 1) EQ) or
24008 // (Op (CMP (SETCC Cond EFLAGS) 0) NEQ)
24009 // to (Op EFLAGS Cond)
24011 // (Op (CMP (SETCC Cond EFLAGS) 0) EQ) or
24012 // (Op (CMP (SETCC Cond EFLAGS) 1) NEQ)
24013 // to (Op EFLAGS !Cond)
24015 // where Op could be BRCOND or CMOV.
24017 static SDValue checkBoolTestSetCCCombine(SDValue Cmp, X86::CondCode &CC) {
24018 // Quit if not CMP and SUB with its value result used.
24019 if (Cmp.getOpcode() != X86ISD::CMP &&
24020 (Cmp.getOpcode() != X86ISD::SUB || Cmp.getNode()->hasAnyUseOfValue(0)))
24023 // Quit if not used as a boolean value.
24024 if (CC != X86::COND_E && CC != X86::COND_NE)
24027 // Check CMP operands. One of them should be 0 or 1 and the other should be
24028 // an SetCC or extended from it.
24029 SDValue Op1 = Cmp.getOperand(0);
24030 SDValue Op2 = Cmp.getOperand(1);
24033 const ConstantSDNode* C = nullptr;
24034 bool needOppositeCond = (CC == X86::COND_E);
24035 bool checkAgainstTrue = false; // Is it a comparison against 1?
24037 if ((C = dyn_cast<ConstantSDNode>(Op1)))
24039 else if ((C = dyn_cast<ConstantSDNode>(Op2)))
24041 else // Quit if all operands are not constants.
24044 if (C->getZExtValue() == 1) {
24045 needOppositeCond = !needOppositeCond;
24046 checkAgainstTrue = true;
24047 } else if (C->getZExtValue() != 0)
24048 // Quit if the constant is neither 0 or 1.
24051 bool truncatedToBoolWithAnd = false;
24052 // Skip (zext $x), (trunc $x), or (and $x, 1) node.
24053 while (SetCC.getOpcode() == ISD::ZERO_EXTEND ||
24054 SetCC.getOpcode() == ISD::TRUNCATE ||
24055 SetCC.getOpcode() == ISD::AND) {
24056 if (SetCC.getOpcode() == ISD::AND) {
24058 ConstantSDNode *CS;
24059 if ((CS = dyn_cast<ConstantSDNode>(SetCC.getOperand(0))) &&
24060 CS->getZExtValue() == 1)
24062 if ((CS = dyn_cast<ConstantSDNode>(SetCC.getOperand(1))) &&
24063 CS->getZExtValue() == 1)
24067 SetCC = SetCC.getOperand(OpIdx);
24068 truncatedToBoolWithAnd = true;
24070 SetCC = SetCC.getOperand(0);
24073 switch (SetCC.getOpcode()) {
24074 case X86ISD::SETCC_CARRY:
24075 // Since SETCC_CARRY gives output based on R = CF ? ~0 : 0, it's unsafe to
24076 // simplify it if the result of SETCC_CARRY is not canonicalized to 0 or 1,
24077 // i.e. it's a comparison against true but the result of SETCC_CARRY is not
24078 // truncated to i1 using 'and'.
24079 if (checkAgainstTrue && !truncatedToBoolWithAnd)
24081 assert(X86::CondCode(SetCC.getConstantOperandVal(0)) == X86::COND_B &&
24082 "Invalid use of SETCC_CARRY!");
24084 case X86ISD::SETCC:
24085 // Set the condition code or opposite one if necessary.
24086 CC = X86::CondCode(SetCC.getConstantOperandVal(0));
24087 if (needOppositeCond)
24088 CC = X86::GetOppositeBranchCondition(CC);
24089 return SetCC.getOperand(1);
24090 case X86ISD::CMOV: {
24091 // Check whether false/true value has canonical one, i.e. 0 or 1.
24092 ConstantSDNode *FVal = dyn_cast<ConstantSDNode>(SetCC.getOperand(0));
24093 ConstantSDNode *TVal = dyn_cast<ConstantSDNode>(SetCC.getOperand(1));
24094 // Quit if true value is not a constant.
24097 // Quit if false value is not a constant.
24099 SDValue Op = SetCC.getOperand(0);
24100 // Skip 'zext' or 'trunc' node.
24101 if (Op.getOpcode() == ISD::ZERO_EXTEND ||
24102 Op.getOpcode() == ISD::TRUNCATE)
24103 Op = Op.getOperand(0);
24104 // A special case for rdrand/rdseed, where 0 is set if false cond is
24106 if ((Op.getOpcode() != X86ISD::RDRAND &&
24107 Op.getOpcode() != X86ISD::RDSEED) || Op.getResNo() != 0)
24110 // Quit if false value is not the constant 0 or 1.
24111 bool FValIsFalse = true;
24112 if (FVal && FVal->getZExtValue() != 0) {
24113 if (FVal->getZExtValue() != 1)
24115 // If FVal is 1, opposite cond is needed.
24116 needOppositeCond = !needOppositeCond;
24117 FValIsFalse = false;
24119 // Quit if TVal is not the constant opposite of FVal.
24120 if (FValIsFalse && TVal->getZExtValue() != 1)
24122 if (!FValIsFalse && TVal->getZExtValue() != 0)
24124 CC = X86::CondCode(SetCC.getConstantOperandVal(2));
24125 if (needOppositeCond)
24126 CC = X86::GetOppositeBranchCondition(CC);
24127 return SetCC.getOperand(3);
24134 /// Check whether Cond is an AND/OR of SETCCs off of the same EFLAGS.
24136 /// (X86or (X86setcc) (X86setcc))
24137 /// (X86cmp (and (X86setcc) (X86setcc)), 0)
24138 static bool checkBoolTestAndOrSetCCCombine(SDValue Cond, X86::CondCode &CC0,
24139 X86::CondCode &CC1, SDValue &Flags,
24141 if (Cond->getOpcode() == X86ISD::CMP) {
24142 ConstantSDNode *CondOp1C = dyn_cast<ConstantSDNode>(Cond->getOperand(1));
24143 if (!CondOp1C || !CondOp1C->isNullValue())
24146 Cond = Cond->getOperand(0);
24151 SDValue SetCC0, SetCC1;
24152 switch (Cond->getOpcode()) {
24153 default: return false;
24160 SetCC0 = Cond->getOperand(0);
24161 SetCC1 = Cond->getOperand(1);
24165 // Make sure we have SETCC nodes, using the same flags value.
24166 if (SetCC0.getOpcode() != X86ISD::SETCC ||
24167 SetCC1.getOpcode() != X86ISD::SETCC ||
24168 SetCC0->getOperand(1) != SetCC1->getOperand(1))
24171 CC0 = (X86::CondCode)SetCC0->getConstantOperandVal(0);
24172 CC1 = (X86::CondCode)SetCC1->getConstantOperandVal(0);
24173 Flags = SetCC0->getOperand(1);
24177 /// Optimize X86ISD::CMOV [LHS, RHS, CONDCODE (e.g. X86::COND_NE), CONDVAL]
24178 static SDValue PerformCMOVCombine(SDNode *N, SelectionDAG &DAG,
24179 TargetLowering::DAGCombinerInfo &DCI,
24180 const X86Subtarget *Subtarget) {
24183 // If the flag operand isn't dead, don't touch this CMOV.
24184 if (N->getNumValues() == 2 && !SDValue(N, 1).use_empty())
24187 SDValue FalseOp = N->getOperand(0);
24188 SDValue TrueOp = N->getOperand(1);
24189 X86::CondCode CC = (X86::CondCode)N->getConstantOperandVal(2);
24190 SDValue Cond = N->getOperand(3);
24192 if (CC == X86::COND_E || CC == X86::COND_NE) {
24193 switch (Cond.getOpcode()) {
24197 // If operand of BSR / BSF are proven never zero, then ZF cannot be set.
24198 if (DAG.isKnownNeverZero(Cond.getOperand(0)))
24199 return (CC == X86::COND_E) ? FalseOp : TrueOp;
24205 Flags = checkBoolTestSetCCCombine(Cond, CC);
24206 if (Flags.getNode() &&
24207 // Extra check as FCMOV only supports a subset of X86 cond.
24208 (FalseOp.getValueType() != MVT::f80 || hasFPCMov(CC))) {
24209 SDValue Ops[] = { FalseOp, TrueOp,
24210 DAG.getConstant(CC, DL, MVT::i8), Flags };
24211 return DAG.getNode(X86ISD::CMOV, DL, N->getVTList(), Ops);
24214 // If this is a select between two integer constants, try to do some
24215 // optimizations. Note that the operands are ordered the opposite of SELECT
24217 if (ConstantSDNode *TrueC = dyn_cast<ConstantSDNode>(TrueOp)) {
24218 if (ConstantSDNode *FalseC = dyn_cast<ConstantSDNode>(FalseOp)) {
24219 // Canonicalize the TrueC/FalseC values so that TrueC (the true value) is
24220 // larger than FalseC (the false value).
24221 if (TrueC->getAPIntValue().ult(FalseC->getAPIntValue())) {
24222 CC = X86::GetOppositeBranchCondition(CC);
24223 std::swap(TrueC, FalseC);
24224 std::swap(TrueOp, FalseOp);
24227 // Optimize C ? 8 : 0 -> zext(setcc(C)) << 3. Likewise for any pow2/0.
24228 // This is efficient for any integer data type (including i8/i16) and
24230 if (FalseC->getAPIntValue() == 0 && TrueC->getAPIntValue().isPowerOf2()) {
24231 Cond = DAG.getNode(X86ISD::SETCC, DL, MVT::i8,
24232 DAG.getConstant(CC, DL, MVT::i8), Cond);
24234 // Zero extend the condition if needed.
24235 Cond = DAG.getNode(ISD::ZERO_EXTEND, DL, TrueC->getValueType(0), Cond);
24237 unsigned ShAmt = TrueC->getAPIntValue().logBase2();
24238 Cond = DAG.getNode(ISD::SHL, DL, Cond.getValueType(), Cond,
24239 DAG.getConstant(ShAmt, DL, MVT::i8));
24240 if (N->getNumValues() == 2) // Dead flag value?
24241 return DCI.CombineTo(N, Cond, SDValue());
24245 // Optimize Cond ? cst+1 : cst -> zext(setcc(C)+cst. This is efficient
24246 // for any integer data type, including i8/i16.
24247 if (FalseC->getAPIntValue()+1 == TrueC->getAPIntValue()) {
24248 Cond = DAG.getNode(X86ISD::SETCC, DL, MVT::i8,
24249 DAG.getConstant(CC, DL, MVT::i8), Cond);
24251 // Zero extend the condition if needed.
24252 Cond = DAG.getNode(ISD::ZERO_EXTEND, DL,
24253 FalseC->getValueType(0), Cond);
24254 Cond = DAG.getNode(ISD::ADD, DL, Cond.getValueType(), Cond,
24255 SDValue(FalseC, 0));
24257 if (N->getNumValues() == 2) // Dead flag value?
24258 return DCI.CombineTo(N, Cond, SDValue());
24262 // Optimize cases that will turn into an LEA instruction. This requires
24263 // an i32 or i64 and an efficient multiplier (1, 2, 3, 4, 5, 8, 9).
24264 if (N->getValueType(0) == MVT::i32 || N->getValueType(0) == MVT::i64) {
24265 uint64_t Diff = TrueC->getZExtValue()-FalseC->getZExtValue();
24266 if (N->getValueType(0) == MVT::i32) Diff = (unsigned)Diff;
24268 bool isFastMultiplier = false;
24270 switch ((unsigned char)Diff) {
24272 case 1: // result = add base, cond
24273 case 2: // result = lea base( , cond*2)
24274 case 3: // result = lea base(cond, cond*2)
24275 case 4: // result = lea base( , cond*4)
24276 case 5: // result = lea base(cond, cond*4)
24277 case 8: // result = lea base( , cond*8)
24278 case 9: // result = lea base(cond, cond*8)
24279 isFastMultiplier = true;
24284 if (isFastMultiplier) {
24285 APInt Diff = TrueC->getAPIntValue()-FalseC->getAPIntValue();
24286 Cond = DAG.getNode(X86ISD::SETCC, DL, MVT::i8,
24287 DAG.getConstant(CC, DL, MVT::i8), Cond);
24288 // Zero extend the condition if needed.
24289 Cond = DAG.getNode(ISD::ZERO_EXTEND, DL, FalseC->getValueType(0),
24291 // Scale the condition by the difference.
24293 Cond = DAG.getNode(ISD::MUL, DL, Cond.getValueType(), Cond,
24294 DAG.getConstant(Diff, DL, Cond.getValueType()));
24296 // Add the base if non-zero.
24297 if (FalseC->getAPIntValue() != 0)
24298 Cond = DAG.getNode(ISD::ADD, DL, Cond.getValueType(), Cond,
24299 SDValue(FalseC, 0));
24300 if (N->getNumValues() == 2) // Dead flag value?
24301 return DCI.CombineTo(N, Cond, SDValue());
24308 // Handle these cases:
24309 // (select (x != c), e, c) -> select (x != c), e, x),
24310 // (select (x == c), c, e) -> select (x == c), x, e)
24311 // where the c is an integer constant, and the "select" is the combination
24312 // of CMOV and CMP.
24314 // The rationale for this change is that the conditional-move from a constant
24315 // needs two instructions, however, conditional-move from a register needs
24316 // only one instruction.
24318 // CAVEAT: By replacing a constant with a symbolic value, it may obscure
24319 // some instruction-combining opportunities. This opt needs to be
24320 // postponed as late as possible.
24322 if (!DCI.isBeforeLegalize() && !DCI.isBeforeLegalizeOps()) {
24323 // the DCI.xxxx conditions are provided to postpone the optimization as
24324 // late as possible.
24326 ConstantSDNode *CmpAgainst = nullptr;
24327 if ((Cond.getOpcode() == X86ISD::CMP || Cond.getOpcode() == X86ISD::SUB) &&
24328 (CmpAgainst = dyn_cast<ConstantSDNode>(Cond.getOperand(1))) &&
24329 !isa<ConstantSDNode>(Cond.getOperand(0))) {
24331 if (CC == X86::COND_NE &&
24332 CmpAgainst == dyn_cast<ConstantSDNode>(FalseOp)) {
24333 CC = X86::GetOppositeBranchCondition(CC);
24334 std::swap(TrueOp, FalseOp);
24337 if (CC == X86::COND_E &&
24338 CmpAgainst == dyn_cast<ConstantSDNode>(TrueOp)) {
24339 SDValue Ops[] = { FalseOp, Cond.getOperand(0),
24340 DAG.getConstant(CC, DL, MVT::i8), Cond };
24341 return DAG.getNode(X86ISD::CMOV, DL, N->getVTList (), Ops);
24346 // Fold and/or of setcc's to double CMOV:
24347 // (CMOV F, T, ((cc1 | cc2) != 0)) -> (CMOV (CMOV F, T, cc1), T, cc2)
24348 // (CMOV F, T, ((cc1 & cc2) != 0)) -> (CMOV (CMOV T, F, !cc1), F, !cc2)
24350 // This combine lets us generate:
24351 // cmovcc1 (jcc1 if we don't have CMOV)
24357 // cmovne (jne if we don't have CMOV)
24358 // When we can't use the CMOV instruction, it might increase branch
24360 // When we can use CMOV, or when there is no mispredict, this improves
24361 // throughput and reduces register pressure.
24363 if (CC == X86::COND_NE) {
24365 X86::CondCode CC0, CC1;
24367 if (checkBoolTestAndOrSetCCCombine(Cond, CC0, CC1, Flags, isAndSetCC)) {
24369 std::swap(FalseOp, TrueOp);
24370 CC0 = X86::GetOppositeBranchCondition(CC0);
24371 CC1 = X86::GetOppositeBranchCondition(CC1);
24374 SDValue LOps[] = {FalseOp, TrueOp, DAG.getConstant(CC0, DL, MVT::i8),
24376 SDValue LCMOV = DAG.getNode(X86ISD::CMOV, DL, N->getVTList(), LOps);
24377 SDValue Ops[] = {LCMOV, TrueOp, DAG.getConstant(CC1, DL, MVT::i8), Flags};
24378 SDValue CMOV = DAG.getNode(X86ISD::CMOV, DL, N->getVTList(), Ops);
24379 DAG.ReplaceAllUsesOfValueWith(SDValue(N, 1), SDValue(CMOV.getNode(), 1));
24387 /// PerformMulCombine - Optimize a single multiply with constant into two
24388 /// in order to implement it with two cheaper instructions, e.g.
24389 /// LEA + SHL, LEA + LEA.
24390 static SDValue PerformMulCombine(SDNode *N, SelectionDAG &DAG,
24391 TargetLowering::DAGCombinerInfo &DCI) {
24392 // An imul is usually smaller than the alternative sequence.
24393 if (DAG.getMachineFunction().getFunction()->optForMinSize())
24396 if (DCI.isBeforeLegalize() || DCI.isCalledByLegalizer())
24399 EVT VT = N->getValueType(0);
24400 if (VT != MVT::i64 && VT != MVT::i32)
24403 ConstantSDNode *C = dyn_cast<ConstantSDNode>(N->getOperand(1));
24406 uint64_t MulAmt = C->getZExtValue();
24407 if (isPowerOf2_64(MulAmt) || MulAmt == 3 || MulAmt == 5 || MulAmt == 9)
24410 uint64_t MulAmt1 = 0;
24411 uint64_t MulAmt2 = 0;
24412 if ((MulAmt % 9) == 0) {
24414 MulAmt2 = MulAmt / 9;
24415 } else if ((MulAmt % 5) == 0) {
24417 MulAmt2 = MulAmt / 5;
24418 } else if ((MulAmt % 3) == 0) {
24420 MulAmt2 = MulAmt / 3;
24423 (isPowerOf2_64(MulAmt2) || MulAmt2 == 3 || MulAmt2 == 5 || MulAmt2 == 9)){
24426 if (isPowerOf2_64(MulAmt2) &&
24427 !(N->hasOneUse() && N->use_begin()->getOpcode() == ISD::ADD))
24428 // If second multiplifer is pow2, issue it first. We want the multiply by
24429 // 3, 5, or 9 to be folded into the addressing mode unless the lone use
24431 std::swap(MulAmt1, MulAmt2);
24434 if (isPowerOf2_64(MulAmt1))
24435 NewMul = DAG.getNode(ISD::SHL, DL, VT, N->getOperand(0),
24436 DAG.getConstant(Log2_64(MulAmt1), DL, MVT::i8));
24438 NewMul = DAG.getNode(X86ISD::MUL_IMM, DL, VT, N->getOperand(0),
24439 DAG.getConstant(MulAmt1, DL, VT));
24441 if (isPowerOf2_64(MulAmt2))
24442 NewMul = DAG.getNode(ISD::SHL, DL, VT, NewMul,
24443 DAG.getConstant(Log2_64(MulAmt2), DL, MVT::i8));
24445 NewMul = DAG.getNode(X86ISD::MUL_IMM, DL, VT, NewMul,
24446 DAG.getConstant(MulAmt2, DL, VT));
24448 // Do not add new nodes to DAG combiner worklist.
24449 DCI.CombineTo(N, NewMul, false);
24454 static SDValue PerformSHLCombine(SDNode *N, SelectionDAG &DAG) {
24455 SDValue N0 = N->getOperand(0);
24456 SDValue N1 = N->getOperand(1);
24457 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1);
24458 EVT VT = N0.getValueType();
24460 // fold (shl (and (setcc_c), c1), c2) -> (and setcc_c, (c1 << c2))
24461 // since the result of setcc_c is all zero's or all ones.
24462 if (VT.isInteger() && !VT.isVector() &&
24463 N1C && N0.getOpcode() == ISD::AND &&
24464 N0.getOperand(1).getOpcode() == ISD::Constant) {
24465 SDValue N00 = N0.getOperand(0);
24466 APInt Mask = cast<ConstantSDNode>(N0.getOperand(1))->getAPIntValue();
24467 APInt ShAmt = N1C->getAPIntValue();
24468 Mask = Mask.shl(ShAmt);
24469 bool MaskOK = false;
24470 // We can handle cases concerning bit-widening nodes containing setcc_c if
24471 // we carefully interrogate the mask to make sure we are semantics
24473 // The transform is not safe if the result of C1 << C2 exceeds the bitwidth
24474 // of the underlying setcc_c operation if the setcc_c was zero extended.
24475 // Consider the following example:
24476 // zext(setcc_c) -> i32 0x0000FFFF
24477 // c1 -> i32 0x0000FFFF
24478 // c2 -> i32 0x00000001
24479 // (shl (and (setcc_c), c1), c2) -> i32 0x0001FFFE
24480 // (and setcc_c, (c1 << c2)) -> i32 0x0000FFFE
24481 if (N00.getOpcode() == X86ISD::SETCC_CARRY) {
24483 } else if (N00.getOpcode() == ISD::SIGN_EXTEND &&
24484 N00.getOperand(0).getOpcode() == X86ISD::SETCC_CARRY) {
24486 } else if ((N00.getOpcode() == ISD::ZERO_EXTEND ||
24487 N00.getOpcode() == ISD::ANY_EXTEND) &&
24488 N00.getOperand(0).getOpcode() == X86ISD::SETCC_CARRY) {
24489 MaskOK = Mask.isIntN(N00.getOperand(0).getValueSizeInBits());
24491 if (MaskOK && Mask != 0) {
24493 return DAG.getNode(ISD::AND, DL, VT, N00, DAG.getConstant(Mask, DL, VT));
24497 // Hardware support for vector shifts is sparse which makes us scalarize the
24498 // vector operations in many cases. Also, on sandybridge ADD is faster than
24500 // (shl V, 1) -> add V,V
24501 if (auto *N1BV = dyn_cast<BuildVectorSDNode>(N1))
24502 if (auto *N1SplatC = N1BV->getConstantSplatNode()) {
24503 assert(N0.getValueType().isVector() && "Invalid vector shift type");
24504 // We shift all of the values by one. In many cases we do not have
24505 // hardware support for this operation. This is better expressed as an ADD
24507 if (N1SplatC->getAPIntValue() == 1)
24508 return DAG.getNode(ISD::ADD, SDLoc(N), VT, N0, N0);
24514 /// \brief Returns a vector of 0s if the node in input is a vector logical
24515 /// shift by a constant amount which is known to be bigger than or equal
24516 /// to the vector element size in bits.
24517 static SDValue performShiftToAllZeros(SDNode *N, SelectionDAG &DAG,
24518 const X86Subtarget *Subtarget) {
24519 EVT VT = N->getValueType(0);
24521 if (VT != MVT::v2i64 && VT != MVT::v4i32 && VT != MVT::v8i16 &&
24522 (!Subtarget->hasInt256() ||
24523 (VT != MVT::v4i64 && VT != MVT::v8i32 && VT != MVT::v16i16)))
24526 SDValue Amt = N->getOperand(1);
24528 if (auto *AmtBV = dyn_cast<BuildVectorSDNode>(Amt))
24529 if (auto *AmtSplat = AmtBV->getConstantSplatNode()) {
24530 APInt ShiftAmt = AmtSplat->getAPIntValue();
24531 unsigned MaxAmount =
24532 VT.getSimpleVT().getVectorElementType().getSizeInBits();
24534 // SSE2/AVX2 logical shifts always return a vector of 0s
24535 // if the shift amount is bigger than or equal to
24536 // the element size. The constant shift amount will be
24537 // encoded as a 8-bit immediate.
24538 if (ShiftAmt.trunc(8).uge(MaxAmount))
24539 return getZeroVector(VT, Subtarget, DAG, DL);
24545 /// PerformShiftCombine - Combine shifts.
24546 static SDValue PerformShiftCombine(SDNode* N, SelectionDAG &DAG,
24547 TargetLowering::DAGCombinerInfo &DCI,
24548 const X86Subtarget *Subtarget) {
24549 if (N->getOpcode() == ISD::SHL)
24550 if (SDValue V = PerformSHLCombine(N, DAG))
24553 // Try to fold this logical shift into a zero vector.
24554 if (N->getOpcode() != ISD::SRA)
24555 if (SDValue V = performShiftToAllZeros(N, DAG, Subtarget))
24561 // CMPEQCombine - Recognize the distinctive (AND (setcc ...) (setcc ..))
24562 // where both setccs reference the same FP CMP, and rewrite for CMPEQSS
24563 // and friends. Likewise for OR -> CMPNEQSS.
24564 static SDValue CMPEQCombine(SDNode *N, SelectionDAG &DAG,
24565 TargetLowering::DAGCombinerInfo &DCI,
24566 const X86Subtarget *Subtarget) {
24569 // SSE1 supports CMP{eq|ne}SS, and SSE2 added CMP{eq|ne}SD, but
24570 // we're requiring SSE2 for both.
24571 if (Subtarget->hasSSE2() && isAndOrOfSetCCs(SDValue(N, 0U), opcode)) {
24572 SDValue N0 = N->getOperand(0);
24573 SDValue N1 = N->getOperand(1);
24574 SDValue CMP0 = N0->getOperand(1);
24575 SDValue CMP1 = N1->getOperand(1);
24578 // The SETCCs should both refer to the same CMP.
24579 if (CMP0.getOpcode() != X86ISD::CMP || CMP0 != CMP1)
24582 SDValue CMP00 = CMP0->getOperand(0);
24583 SDValue CMP01 = CMP0->getOperand(1);
24584 EVT VT = CMP00.getValueType();
24586 if (VT == MVT::f32 || VT == MVT::f64) {
24587 bool ExpectingFlags = false;
24588 // Check for any users that want flags:
24589 for (SDNode::use_iterator UI = N->use_begin(), UE = N->use_end();
24590 !ExpectingFlags && UI != UE; ++UI)
24591 switch (UI->getOpcode()) {
24596 ExpectingFlags = true;
24598 case ISD::CopyToReg:
24599 case ISD::SIGN_EXTEND:
24600 case ISD::ZERO_EXTEND:
24601 case ISD::ANY_EXTEND:
24605 if (!ExpectingFlags) {
24606 enum X86::CondCode cc0 = (enum X86::CondCode)N0.getConstantOperandVal(0);
24607 enum X86::CondCode cc1 = (enum X86::CondCode)N1.getConstantOperandVal(0);
24609 if (cc1 == X86::COND_E || cc1 == X86::COND_NE) {
24610 X86::CondCode tmp = cc0;
24615 if ((cc0 == X86::COND_E && cc1 == X86::COND_NP) ||
24616 (cc0 == X86::COND_NE && cc1 == X86::COND_P)) {
24617 // FIXME: need symbolic constants for these magic numbers.
24618 // See X86ATTInstPrinter.cpp:printSSECC().
24619 unsigned x86cc = (cc0 == X86::COND_E) ? 0 : 4;
24620 if (Subtarget->hasAVX512()) {
24621 SDValue FSetCC = DAG.getNode(X86ISD::FSETCC, DL, MVT::i1, CMP00,
24623 DAG.getConstant(x86cc, DL, MVT::i8));
24624 if (N->getValueType(0) != MVT::i1)
24625 return DAG.getNode(ISD::ZERO_EXTEND, DL, N->getValueType(0),
24629 SDValue OnesOrZeroesF = DAG.getNode(X86ISD::FSETCC, DL,
24630 CMP00.getValueType(), CMP00, CMP01,
24631 DAG.getConstant(x86cc, DL,
24634 bool is64BitFP = (CMP00.getValueType() == MVT::f64);
24635 MVT IntVT = is64BitFP ? MVT::i64 : MVT::i32;
24637 if (is64BitFP && !Subtarget->is64Bit()) {
24638 // On a 32-bit target, we cannot bitcast the 64-bit float to a
24639 // 64-bit integer, since that's not a legal type. Since
24640 // OnesOrZeroesF is all ones of all zeroes, we don't need all the
24641 // bits, but can do this little dance to extract the lowest 32 bits
24642 // and work with those going forward.
24643 SDValue Vector64 = DAG.getNode(ISD::SCALAR_TO_VECTOR, DL, MVT::v2f64,
24645 SDValue Vector32 = DAG.getBitcast(MVT::v4f32, Vector64);
24646 OnesOrZeroesF = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, DL, MVT::f32,
24647 Vector32, DAG.getIntPtrConstant(0, DL));
24651 SDValue OnesOrZeroesI = DAG.getBitcast(IntVT, OnesOrZeroesF);
24652 SDValue ANDed = DAG.getNode(ISD::AND, DL, IntVT, OnesOrZeroesI,
24653 DAG.getConstant(1, DL, IntVT));
24654 SDValue OneBitOfTruth = DAG.getNode(ISD::TRUNCATE, DL, MVT::i8,
24656 return OneBitOfTruth;
24664 /// CanFoldXORWithAllOnes - Test whether the XOR operand is a AllOnes vector
24665 /// so it can be folded inside ANDNP.
24666 static bool CanFoldXORWithAllOnes(const SDNode *N) {
24667 EVT VT = N->getValueType(0);
24669 // Match direct AllOnes for 128 and 256-bit vectors
24670 if (ISD::isBuildVectorAllOnes(N))
24673 // Look through a bit convert.
24674 if (N->getOpcode() == ISD::BITCAST)
24675 N = N->getOperand(0).getNode();
24677 // Sometimes the operand may come from a insert_subvector building a 256-bit
24679 if (VT.is256BitVector() &&
24680 N->getOpcode() == ISD::INSERT_SUBVECTOR) {
24681 SDValue V1 = N->getOperand(0);
24682 SDValue V2 = N->getOperand(1);
24684 if (V1.getOpcode() == ISD::INSERT_SUBVECTOR &&
24685 V1.getOperand(0).getOpcode() == ISD::UNDEF &&
24686 ISD::isBuildVectorAllOnes(V1.getOperand(1).getNode()) &&
24687 ISD::isBuildVectorAllOnes(V2.getNode()))
24694 // On AVX/AVX2 the type v8i1 is legalized to v8i16, which is an XMM sized
24695 // register. In most cases we actually compare or select YMM-sized registers
24696 // and mixing the two types creates horrible code. This method optimizes
24697 // some of the transition sequences.
24698 static SDValue WidenMaskArithmetic(SDNode *N, SelectionDAG &DAG,
24699 TargetLowering::DAGCombinerInfo &DCI,
24700 const X86Subtarget *Subtarget) {
24701 EVT VT = N->getValueType(0);
24702 if (!VT.is256BitVector())
24705 assert((N->getOpcode() == ISD::ANY_EXTEND ||
24706 N->getOpcode() == ISD::ZERO_EXTEND ||
24707 N->getOpcode() == ISD::SIGN_EXTEND) && "Invalid Node");
24709 SDValue Narrow = N->getOperand(0);
24710 EVT NarrowVT = Narrow->getValueType(0);
24711 if (!NarrowVT.is128BitVector())
24714 if (Narrow->getOpcode() != ISD::XOR &&
24715 Narrow->getOpcode() != ISD::AND &&
24716 Narrow->getOpcode() != ISD::OR)
24719 SDValue N0 = Narrow->getOperand(0);
24720 SDValue N1 = Narrow->getOperand(1);
24723 // The Left side has to be a trunc.
24724 if (N0.getOpcode() != ISD::TRUNCATE)
24727 // The type of the truncated inputs.
24728 EVT WideVT = N0->getOperand(0)->getValueType(0);
24732 // The right side has to be a 'trunc' or a constant vector.
24733 bool RHSTrunc = N1.getOpcode() == ISD::TRUNCATE;
24734 ConstantSDNode *RHSConstSplat = nullptr;
24735 if (auto *RHSBV = dyn_cast<BuildVectorSDNode>(N1))
24736 RHSConstSplat = RHSBV->getConstantSplatNode();
24737 if (!RHSTrunc && !RHSConstSplat)
24740 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
24742 if (!TLI.isOperationLegalOrPromote(Narrow->getOpcode(), WideVT))
24745 // Set N0 and N1 to hold the inputs to the new wide operation.
24746 N0 = N0->getOperand(0);
24747 if (RHSConstSplat) {
24748 N1 = DAG.getNode(ISD::ZERO_EXTEND, DL, WideVT.getVectorElementType(),
24749 SDValue(RHSConstSplat, 0));
24750 SmallVector<SDValue, 8> C(WideVT.getVectorNumElements(), N1);
24751 N1 = DAG.getNode(ISD::BUILD_VECTOR, DL, WideVT, C);
24752 } else if (RHSTrunc) {
24753 N1 = N1->getOperand(0);
24756 // Generate the wide operation.
24757 SDValue Op = DAG.getNode(Narrow->getOpcode(), DL, WideVT, N0, N1);
24758 unsigned Opcode = N->getOpcode();
24760 case ISD::ANY_EXTEND:
24762 case ISD::ZERO_EXTEND: {
24763 unsigned InBits = NarrowVT.getScalarSizeInBits();
24764 APInt Mask = APInt::getAllOnesValue(InBits);
24765 Mask = Mask.zext(VT.getScalarSizeInBits());
24766 return DAG.getNode(ISD::AND, DL, VT,
24767 Op, DAG.getConstant(Mask, DL, VT));
24769 case ISD::SIGN_EXTEND:
24770 return DAG.getNode(ISD::SIGN_EXTEND_INREG, DL, VT,
24771 Op, DAG.getValueType(NarrowVT));
24773 llvm_unreachable("Unexpected opcode");
24777 static SDValue VectorZextCombine(SDNode *N, SelectionDAG &DAG,
24778 TargetLowering::DAGCombinerInfo &DCI,
24779 const X86Subtarget *Subtarget) {
24780 SDValue N0 = N->getOperand(0);
24781 SDValue N1 = N->getOperand(1);
24784 // A vector zext_in_reg may be represented as a shuffle,
24785 // feeding into a bitcast (this represents anyext) feeding into
24786 // an and with a mask.
24787 // We'd like to try to combine that into a shuffle with zero
24788 // plus a bitcast, removing the and.
24789 if (N0.getOpcode() != ISD::BITCAST ||
24790 N0.getOperand(0).getOpcode() != ISD::VECTOR_SHUFFLE)
24793 // The other side of the AND should be a splat of 2^C, where C
24794 // is the number of bits in the source type.
24795 if (N1.getOpcode() == ISD::BITCAST)
24796 N1 = N1.getOperand(0);
24797 if (N1.getOpcode() != ISD::BUILD_VECTOR)
24799 BuildVectorSDNode *Vector = cast<BuildVectorSDNode>(N1);
24801 ShuffleVectorSDNode *Shuffle = cast<ShuffleVectorSDNode>(N0.getOperand(0));
24802 EVT SrcType = Shuffle->getValueType(0);
24804 // We expect a single-source shuffle
24805 if (Shuffle->getOperand(1)->getOpcode() != ISD::UNDEF)
24808 unsigned SrcSize = SrcType.getScalarSizeInBits();
24810 APInt SplatValue, SplatUndef;
24811 unsigned SplatBitSize;
24813 if (!Vector->isConstantSplat(SplatValue, SplatUndef,
24814 SplatBitSize, HasAnyUndefs))
24817 unsigned ResSize = N1.getValueType().getScalarSizeInBits();
24818 // Make sure the splat matches the mask we expect
24819 if (SplatBitSize > ResSize ||
24820 (SplatValue + 1).exactLogBase2() != (int)SrcSize)
24823 // Make sure the input and output size make sense
24824 if (SrcSize >= ResSize || ResSize % SrcSize)
24827 // We expect a shuffle of the form <0, u, u, u, 1, u, u, u...>
24828 // The number of u's between each two values depends on the ratio between
24829 // the source and dest type.
24830 unsigned ZextRatio = ResSize / SrcSize;
24831 bool IsZext = true;
24832 for (unsigned i = 0; i < SrcType.getVectorNumElements(); ++i) {
24833 if (i % ZextRatio) {
24834 if (Shuffle->getMaskElt(i) > 0) {
24840 if (Shuffle->getMaskElt(i) != (int)(i / ZextRatio)) {
24841 // Expected element number
24851 // Ok, perform the transformation - replace the shuffle with
24852 // a shuffle of the form <0, k, k, k, 1, k, k, k> with zero
24853 // (instead of undef) where the k elements come from the zero vector.
24854 SmallVector<int, 8> Mask;
24855 unsigned NumElems = SrcType.getVectorNumElements();
24856 for (unsigned i = 0; i < NumElems; ++i)
24858 Mask.push_back(NumElems);
24860 Mask.push_back(i / ZextRatio);
24862 SDValue NewShuffle = DAG.getVectorShuffle(Shuffle->getValueType(0), DL,
24863 Shuffle->getOperand(0), DAG.getConstant(0, DL, SrcType), Mask);
24864 return DAG.getBitcast(N0.getValueType(), NewShuffle);
24867 /// If both input operands of a logic op are being cast from floating point
24868 /// types, try to convert this into a floating point logic node to avoid
24869 /// unnecessary moves from SSE to integer registers.
24870 static SDValue convertIntLogicToFPLogic(SDNode *N, SelectionDAG &DAG,
24871 const X86Subtarget *Subtarget) {
24872 unsigned FPOpcode = ISD::DELETED_NODE;
24873 if (N->getOpcode() == ISD::AND)
24874 FPOpcode = X86ISD::FAND;
24875 else if (N->getOpcode() == ISD::OR)
24876 FPOpcode = X86ISD::FOR;
24877 else if (N->getOpcode() == ISD::XOR)
24878 FPOpcode = X86ISD::FXOR;
24880 assert(FPOpcode != ISD::DELETED_NODE &&
24881 "Unexpected input node for FP logic conversion");
24883 EVT VT = N->getValueType(0);
24884 SDValue N0 = N->getOperand(0);
24885 SDValue N1 = N->getOperand(1);
24887 if (N0.getOpcode() == ISD::BITCAST && N1.getOpcode() == ISD::BITCAST &&
24888 ((Subtarget->hasSSE1() && VT == MVT::i32) ||
24889 (Subtarget->hasSSE2() && VT == MVT::i64))) {
24890 SDValue N00 = N0.getOperand(0);
24891 SDValue N10 = N1.getOperand(0);
24892 EVT N00Type = N00.getValueType();
24893 EVT N10Type = N10.getValueType();
24894 if (N00Type.isFloatingPoint() && N10Type.isFloatingPoint()) {
24895 SDValue FPLogic = DAG.getNode(FPOpcode, DL, N00Type, N00, N10);
24896 return DAG.getBitcast(VT, FPLogic);
24902 static SDValue PerformAndCombine(SDNode *N, SelectionDAG &DAG,
24903 TargetLowering::DAGCombinerInfo &DCI,
24904 const X86Subtarget *Subtarget) {
24905 if (DCI.isBeforeLegalizeOps())
24908 if (SDValue Zext = VectorZextCombine(N, DAG, DCI, Subtarget))
24911 if (SDValue R = CMPEQCombine(N, DAG, DCI, Subtarget))
24914 if (SDValue FPLogic = convertIntLogicToFPLogic(N, DAG, Subtarget))
24917 EVT VT = N->getValueType(0);
24918 SDValue N0 = N->getOperand(0);
24919 SDValue N1 = N->getOperand(1);
24922 // Create BEXTR instructions
24923 // BEXTR is ((X >> imm) & (2**size-1))
24924 if (VT == MVT::i32 || VT == MVT::i64) {
24925 // Check for BEXTR.
24926 if ((Subtarget->hasBMI() || Subtarget->hasTBM()) &&
24927 (N0.getOpcode() == ISD::SRA || N0.getOpcode() == ISD::SRL)) {
24928 ConstantSDNode *MaskNode = dyn_cast<ConstantSDNode>(N1);
24929 ConstantSDNode *ShiftNode = dyn_cast<ConstantSDNode>(N0.getOperand(1));
24930 if (MaskNode && ShiftNode) {
24931 uint64_t Mask = MaskNode->getZExtValue();
24932 uint64_t Shift = ShiftNode->getZExtValue();
24933 if (isMask_64(Mask)) {
24934 uint64_t MaskSize = countPopulation(Mask);
24935 if (Shift + MaskSize <= VT.getSizeInBits())
24936 return DAG.getNode(X86ISD::BEXTR, DL, VT, N0.getOperand(0),
24937 DAG.getConstant(Shift | (MaskSize << 8), DL,
24946 // Want to form ANDNP nodes:
24947 // 1) In the hopes of then easily combining them with OR and AND nodes
24948 // to form PBLEND/PSIGN.
24949 // 2) To match ANDN packed intrinsics
24950 if (VT != MVT::v2i64 && VT != MVT::v4i64)
24953 // Check LHS for vnot
24954 if (N0.getOpcode() == ISD::XOR &&
24955 //ISD::isBuildVectorAllOnes(N0.getOperand(1).getNode()))
24956 CanFoldXORWithAllOnes(N0.getOperand(1).getNode()))
24957 return DAG.getNode(X86ISD::ANDNP, DL, VT, N0.getOperand(0), N1);
24959 // Check RHS for vnot
24960 if (N1.getOpcode() == ISD::XOR &&
24961 //ISD::isBuildVectorAllOnes(N1.getOperand(1).getNode()))
24962 CanFoldXORWithAllOnes(N1.getOperand(1).getNode()))
24963 return DAG.getNode(X86ISD::ANDNP, DL, VT, N1.getOperand(0), N0);
24968 static SDValue PerformOrCombine(SDNode *N, SelectionDAG &DAG,
24969 TargetLowering::DAGCombinerInfo &DCI,
24970 const X86Subtarget *Subtarget) {
24971 if (DCI.isBeforeLegalizeOps())
24974 if (SDValue R = CMPEQCombine(N, DAG, DCI, Subtarget))
24977 if (SDValue FPLogic = convertIntLogicToFPLogic(N, DAG, Subtarget))
24980 SDValue N0 = N->getOperand(0);
24981 SDValue N1 = N->getOperand(1);
24982 EVT VT = N->getValueType(0);
24984 // look for psign/blend
24985 if (VT == MVT::v2i64 || VT == MVT::v4i64) {
24986 if (!Subtarget->hasSSSE3() ||
24987 (VT == MVT::v4i64 && !Subtarget->hasInt256()))
24990 // Canonicalize pandn to RHS
24991 if (N0.getOpcode() == X86ISD::ANDNP)
24993 // or (and (m, y), (pandn m, x))
24994 if (N0.getOpcode() == ISD::AND && N1.getOpcode() == X86ISD::ANDNP) {
24995 SDValue Mask = N1.getOperand(0);
24996 SDValue X = N1.getOperand(1);
24998 if (N0.getOperand(0) == Mask)
24999 Y = N0.getOperand(1);
25000 if (N0.getOperand(1) == Mask)
25001 Y = N0.getOperand(0);
25003 // Check to see if the mask appeared in both the AND and ANDNP and
25007 // Validate that X, Y, and Mask are BIT_CONVERTS, and see through them.
25008 // Look through mask bitcast.
25009 if (Mask.getOpcode() == ISD::BITCAST)
25010 Mask = Mask.getOperand(0);
25011 if (X.getOpcode() == ISD::BITCAST)
25012 X = X.getOperand(0);
25013 if (Y.getOpcode() == ISD::BITCAST)
25014 Y = Y.getOperand(0);
25016 EVT MaskVT = Mask.getValueType();
25018 // Validate that the Mask operand is a vector sra node.
25019 // FIXME: what to do for bytes, since there is a psignb/pblendvb, but
25020 // there is no psrai.b
25021 unsigned EltBits = MaskVT.getVectorElementType().getSizeInBits();
25022 unsigned SraAmt = ~0;
25023 if (Mask.getOpcode() == ISD::SRA) {
25024 if (auto *AmtBV = dyn_cast<BuildVectorSDNode>(Mask.getOperand(1)))
25025 if (auto *AmtConst = AmtBV->getConstantSplatNode())
25026 SraAmt = AmtConst->getZExtValue();
25027 } else if (Mask.getOpcode() == X86ISD::VSRAI) {
25028 SDValue SraC = Mask.getOperand(1);
25029 SraAmt = cast<ConstantSDNode>(SraC)->getZExtValue();
25031 if ((SraAmt + 1) != EltBits)
25036 // Now we know we at least have a plendvb with the mask val. See if
25037 // we can form a psignb/w/d.
25038 // psign = x.type == y.type == mask.type && y = sub(0, x);
25039 if (Y.getOpcode() == ISD::SUB && Y.getOperand(1) == X &&
25040 ISD::isBuildVectorAllZeros(Y.getOperand(0).getNode()) &&
25041 X.getValueType() == MaskVT && Y.getValueType() == MaskVT) {
25042 assert((EltBits == 8 || EltBits == 16 || EltBits == 32) &&
25043 "Unsupported VT for PSIGN");
25044 Mask = DAG.getNode(X86ISD::PSIGN, DL, MaskVT, X, Mask.getOperand(0));
25045 return DAG.getBitcast(VT, Mask);
25047 // PBLENDVB only available on SSE 4.1
25048 if (!Subtarget->hasSSE41())
25051 MVT BlendVT = (VT == MVT::v4i64) ? MVT::v32i8 : MVT::v16i8;
25053 X = DAG.getBitcast(BlendVT, X);
25054 Y = DAG.getBitcast(BlendVT, Y);
25055 Mask = DAG.getBitcast(BlendVT, Mask);
25056 Mask = DAG.getNode(ISD::VSELECT, DL, BlendVT, Mask, Y, X);
25057 return DAG.getBitcast(VT, Mask);
25061 if (VT != MVT::i16 && VT != MVT::i32 && VT != MVT::i64)
25064 // fold (or (x << c) | (y >> (64 - c))) ==> (shld64 x, y, c)
25065 bool OptForSize = DAG.getMachineFunction().getFunction()->optForSize();
25067 // SHLD/SHRD instructions have lower register pressure, but on some
25068 // platforms they have higher latency than the equivalent
25069 // series of shifts/or that would otherwise be generated.
25070 // Don't fold (or (x << c) | (y >> (64 - c))) if SHLD/SHRD instructions
25071 // have higher latencies and we are not optimizing for size.
25072 if (!OptForSize && Subtarget->isSHLDSlow())
25075 if (N0.getOpcode() == ISD::SRL && N1.getOpcode() == ISD::SHL)
25077 if (N0.getOpcode() != ISD::SHL || N1.getOpcode() != ISD::SRL)
25079 if (!N0.hasOneUse() || !N1.hasOneUse())
25082 SDValue ShAmt0 = N0.getOperand(1);
25083 if (ShAmt0.getValueType() != MVT::i8)
25085 SDValue ShAmt1 = N1.getOperand(1);
25086 if (ShAmt1.getValueType() != MVT::i8)
25088 if (ShAmt0.getOpcode() == ISD::TRUNCATE)
25089 ShAmt0 = ShAmt0.getOperand(0);
25090 if (ShAmt1.getOpcode() == ISD::TRUNCATE)
25091 ShAmt1 = ShAmt1.getOperand(0);
25094 unsigned Opc = X86ISD::SHLD;
25095 SDValue Op0 = N0.getOperand(0);
25096 SDValue Op1 = N1.getOperand(0);
25097 if (ShAmt0.getOpcode() == ISD::SUB) {
25098 Opc = X86ISD::SHRD;
25099 std::swap(Op0, Op1);
25100 std::swap(ShAmt0, ShAmt1);
25103 unsigned Bits = VT.getSizeInBits();
25104 if (ShAmt1.getOpcode() == ISD::SUB) {
25105 SDValue Sum = ShAmt1.getOperand(0);
25106 if (ConstantSDNode *SumC = dyn_cast<ConstantSDNode>(Sum)) {
25107 SDValue ShAmt1Op1 = ShAmt1.getOperand(1);
25108 if (ShAmt1Op1.getNode()->getOpcode() == ISD::TRUNCATE)
25109 ShAmt1Op1 = ShAmt1Op1.getOperand(0);
25110 if (SumC->getSExtValue() == Bits && ShAmt1Op1 == ShAmt0)
25111 return DAG.getNode(Opc, DL, VT,
25113 DAG.getNode(ISD::TRUNCATE, DL,
25116 } else if (ConstantSDNode *ShAmt1C = dyn_cast<ConstantSDNode>(ShAmt1)) {
25117 ConstantSDNode *ShAmt0C = dyn_cast<ConstantSDNode>(ShAmt0);
25119 ShAmt0C->getSExtValue() + ShAmt1C->getSExtValue() == Bits)
25120 return DAG.getNode(Opc, DL, VT,
25121 N0.getOperand(0), N1.getOperand(0),
25122 DAG.getNode(ISD::TRUNCATE, DL,
25129 // Generate NEG and CMOV for integer abs.
25130 static SDValue performIntegerAbsCombine(SDNode *N, SelectionDAG &DAG) {
25131 EVT VT = N->getValueType(0);
25133 // Since X86 does not have CMOV for 8-bit integer, we don't convert
25134 // 8-bit integer abs to NEG and CMOV.
25135 if (VT.isInteger() && VT.getSizeInBits() == 8)
25138 SDValue N0 = N->getOperand(0);
25139 SDValue N1 = N->getOperand(1);
25142 // Check pattern of XOR(ADD(X,Y), Y) where Y is SRA(X, size(X)-1)
25143 // and change it to SUB and CMOV.
25144 if (VT.isInteger() && N->getOpcode() == ISD::XOR &&
25145 N0.getOpcode() == ISD::ADD &&
25146 N0.getOperand(1) == N1 &&
25147 N1.getOpcode() == ISD::SRA &&
25148 N1.getOperand(0) == N0.getOperand(0))
25149 if (ConstantSDNode *Y1C = dyn_cast<ConstantSDNode>(N1.getOperand(1)))
25150 if (Y1C->getAPIntValue() == VT.getSizeInBits()-1) {
25151 // Generate SUB & CMOV.
25152 SDValue Neg = DAG.getNode(X86ISD::SUB, DL, DAG.getVTList(VT, MVT::i32),
25153 DAG.getConstant(0, DL, VT), N0.getOperand(0));
25155 SDValue Ops[] = { N0.getOperand(0), Neg,
25156 DAG.getConstant(X86::COND_GE, DL, MVT::i8),
25157 SDValue(Neg.getNode(), 1) };
25158 return DAG.getNode(X86ISD::CMOV, DL, DAG.getVTList(VT, MVT::Glue), Ops);
25163 // Try to turn tests against the signbit in the form of:
25164 // XOR(TRUNCATE(SRL(X, size(X)-1)), 1)
25167 static SDValue foldXorTruncShiftIntoCmp(SDNode *N, SelectionDAG &DAG) {
25168 // This is only worth doing if the output type is i8.
25169 if (N->getValueType(0) != MVT::i8)
25172 SDValue N0 = N->getOperand(0);
25173 SDValue N1 = N->getOperand(1);
25175 // We should be performing an xor against a truncated shift.
25176 if (N0.getOpcode() != ISD::TRUNCATE || !N0.hasOneUse())
25179 // Make sure we are performing an xor against one.
25180 if (!isa<ConstantSDNode>(N1) || !cast<ConstantSDNode>(N1)->isOne())
25183 // SetCC on x86 zero extends so only act on this if it's a logical shift.
25184 SDValue Shift = N0.getOperand(0);
25185 if (Shift.getOpcode() != ISD::SRL || !Shift.hasOneUse())
25188 // Make sure we are truncating from one of i16, i32 or i64.
25189 EVT ShiftTy = Shift.getValueType();
25190 if (ShiftTy != MVT::i16 && ShiftTy != MVT::i32 && ShiftTy != MVT::i64)
25193 // Make sure the shift amount extracts the sign bit.
25194 if (!isa<ConstantSDNode>(Shift.getOperand(1)) ||
25195 Shift.getConstantOperandVal(1) != ShiftTy.getSizeInBits() - 1)
25198 // Create a greater-than comparison against -1.
25199 // N.B. Using SETGE against 0 works but we want a canonical looking
25200 // comparison, using SETGT matches up with what TranslateX86CC.
25202 SDValue ShiftOp = Shift.getOperand(0);
25203 EVT ShiftOpTy = ShiftOp.getValueType();
25204 SDValue Cond = DAG.getSetCC(DL, MVT::i8, ShiftOp,
25205 DAG.getConstant(-1, DL, ShiftOpTy), ISD::SETGT);
25209 static SDValue PerformXorCombine(SDNode *N, SelectionDAG &DAG,
25210 TargetLowering::DAGCombinerInfo &DCI,
25211 const X86Subtarget *Subtarget) {
25212 if (DCI.isBeforeLegalizeOps())
25215 if (SDValue RV = foldXorTruncShiftIntoCmp(N, DAG))
25218 if (Subtarget->hasCMov())
25219 if (SDValue RV = performIntegerAbsCombine(N, DAG))
25222 if (SDValue FPLogic = convertIntLogicToFPLogic(N, DAG, Subtarget))
25228 /// PerformLOADCombine - Do target-specific dag combines on LOAD nodes.
25229 static SDValue PerformLOADCombine(SDNode *N, SelectionDAG &DAG,
25230 TargetLowering::DAGCombinerInfo &DCI,
25231 const X86Subtarget *Subtarget) {
25232 LoadSDNode *Ld = cast<LoadSDNode>(N);
25233 EVT RegVT = Ld->getValueType(0);
25234 EVT MemVT = Ld->getMemoryVT();
25236 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
25238 // For chips with slow 32-byte unaligned loads, break the 32-byte operation
25239 // into two 16-byte operations.
25240 ISD::LoadExtType Ext = Ld->getExtensionType();
25242 unsigned AddressSpace = Ld->getAddressSpace();
25243 unsigned Alignment = Ld->getAlignment();
25244 if (RegVT.is256BitVector() && !DCI.isBeforeLegalizeOps() &&
25245 Ext == ISD::NON_EXTLOAD &&
25246 TLI.allowsMemoryAccess(*DAG.getContext(), DAG.getDataLayout(), RegVT,
25247 AddressSpace, Alignment, &Fast) && !Fast) {
25248 unsigned NumElems = RegVT.getVectorNumElements();
25252 SDValue Ptr = Ld->getBasePtr();
25253 SDValue Increment =
25254 DAG.getConstant(16, dl, TLI.getPointerTy(DAG.getDataLayout()));
25256 EVT HalfVT = EVT::getVectorVT(*DAG.getContext(), MemVT.getScalarType(),
25258 SDValue Load1 = DAG.getLoad(HalfVT, dl, Ld->getChain(), Ptr,
25259 Ld->getPointerInfo(), Ld->isVolatile(),
25260 Ld->isNonTemporal(), Ld->isInvariant(),
25262 Ptr = DAG.getNode(ISD::ADD, dl, Ptr.getValueType(), Ptr, Increment);
25263 SDValue Load2 = DAG.getLoad(HalfVT, dl, Ld->getChain(), Ptr,
25264 Ld->getPointerInfo(), Ld->isVolatile(),
25265 Ld->isNonTemporal(), Ld->isInvariant(),
25266 std::min(16U, Alignment));
25267 SDValue TF = DAG.getNode(ISD::TokenFactor, dl, MVT::Other,
25269 Load2.getValue(1));
25271 SDValue NewVec = DAG.getUNDEF(RegVT);
25272 NewVec = Insert128BitVector(NewVec, Load1, 0, DAG, dl);
25273 NewVec = Insert128BitVector(NewVec, Load2, NumElems/2, DAG, dl);
25274 return DCI.CombineTo(N, NewVec, TF, true);
25280 /// PerformMLOADCombine - Resolve extending loads
25281 static SDValue PerformMLOADCombine(SDNode *N, SelectionDAG &DAG,
25282 TargetLowering::DAGCombinerInfo &DCI,
25283 const X86Subtarget *Subtarget) {
25284 MaskedLoadSDNode *Mld = cast<MaskedLoadSDNode>(N);
25285 if (Mld->getExtensionType() != ISD::SEXTLOAD)
25288 EVT VT = Mld->getValueType(0);
25289 unsigned NumElems = VT.getVectorNumElements();
25290 EVT LdVT = Mld->getMemoryVT();
25293 assert(LdVT != VT && "Cannot extend to the same type");
25294 unsigned ToSz = VT.getVectorElementType().getSizeInBits();
25295 unsigned FromSz = LdVT.getVectorElementType().getSizeInBits();
25296 // From, To sizes and ElemCount must be pow of two
25297 assert (isPowerOf2_32(NumElems * FromSz * ToSz) &&
25298 "Unexpected size for extending masked load");
25300 unsigned SizeRatio = ToSz / FromSz;
25301 assert(SizeRatio * NumElems * FromSz == VT.getSizeInBits());
25303 // Create a type on which we perform the shuffle
25304 EVT WideVecVT = EVT::getVectorVT(*DAG.getContext(),
25305 LdVT.getScalarType(), NumElems*SizeRatio);
25306 assert(WideVecVT.getSizeInBits() == VT.getSizeInBits());
25308 // Convert Src0 value
25309 SDValue WideSrc0 = DAG.getBitcast(WideVecVT, Mld->getSrc0());
25310 if (Mld->getSrc0().getOpcode() != ISD::UNDEF) {
25311 SmallVector<int, 16> ShuffleVec(NumElems * SizeRatio, -1);
25312 for (unsigned i = 0; i != NumElems; ++i)
25313 ShuffleVec[i] = i * SizeRatio;
25315 // Can't shuffle using an illegal type.
25316 assert(DAG.getTargetLoweringInfo().isTypeLegal(WideVecVT) &&
25317 "WideVecVT should be legal");
25318 WideSrc0 = DAG.getVectorShuffle(WideVecVT, dl, WideSrc0,
25319 DAG.getUNDEF(WideVecVT), &ShuffleVec[0]);
25321 // Prepare the new mask
25323 SDValue Mask = Mld->getMask();
25324 if (Mask.getValueType() == VT) {
25325 // Mask and original value have the same type
25326 NewMask = DAG.getBitcast(WideVecVT, Mask);
25327 SmallVector<int, 16> ShuffleVec(NumElems * SizeRatio, -1);
25328 for (unsigned i = 0; i != NumElems; ++i)
25329 ShuffleVec[i] = i * SizeRatio;
25330 for (unsigned i = NumElems; i != NumElems*SizeRatio; ++i)
25331 ShuffleVec[i] = NumElems*SizeRatio;
25332 NewMask = DAG.getVectorShuffle(WideVecVT, dl, NewMask,
25333 DAG.getConstant(0, dl, WideVecVT),
25337 assert(Mask.getValueType().getVectorElementType() == MVT::i1);
25338 unsigned WidenNumElts = NumElems*SizeRatio;
25339 unsigned MaskNumElts = VT.getVectorNumElements();
25340 EVT NewMaskVT = EVT::getVectorVT(*DAG.getContext(), MVT::i1,
25343 unsigned NumConcat = WidenNumElts / MaskNumElts;
25344 SmallVector<SDValue, 16> Ops(NumConcat);
25345 SDValue ZeroVal = DAG.getConstant(0, dl, Mask.getValueType());
25347 for (unsigned i = 1; i != NumConcat; ++i)
25350 NewMask = DAG.getNode(ISD::CONCAT_VECTORS, dl, NewMaskVT, Ops);
25353 SDValue WideLd = DAG.getMaskedLoad(WideVecVT, dl, Mld->getChain(),
25354 Mld->getBasePtr(), NewMask, WideSrc0,
25355 Mld->getMemoryVT(), Mld->getMemOperand(),
25357 SDValue NewVec = DAG.getNode(X86ISD::VSEXT, dl, VT, WideLd);
25358 return DCI.CombineTo(N, NewVec, WideLd.getValue(1), true);
25360 /// PerformMSTORECombine - Resolve truncating stores
25361 static SDValue PerformMSTORECombine(SDNode *N, SelectionDAG &DAG,
25362 const X86Subtarget *Subtarget) {
25363 MaskedStoreSDNode *Mst = cast<MaskedStoreSDNode>(N);
25364 if (!Mst->isTruncatingStore())
25367 EVT VT = Mst->getValue().getValueType();
25368 unsigned NumElems = VT.getVectorNumElements();
25369 EVT StVT = Mst->getMemoryVT();
25372 assert(StVT != VT && "Cannot truncate to the same type");
25373 unsigned FromSz = VT.getVectorElementType().getSizeInBits();
25374 unsigned ToSz = StVT.getVectorElementType().getSizeInBits();
25376 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
25378 // The truncating store is legal in some cases. For example
25379 // vpmovqb, vpmovqw, vpmovqd, vpmovdb, vpmovdw
25380 // are designated for truncate store.
25381 // In this case we don't need any further transformations.
25382 if (TLI.isTruncStoreLegal(VT, StVT))
25385 // From, To sizes and ElemCount must be pow of two
25386 assert (isPowerOf2_32(NumElems * FromSz * ToSz) &&
25387 "Unexpected size for truncating masked store");
25388 // We are going to use the original vector elt for storing.
25389 // Accumulated smaller vector elements must be a multiple of the store size.
25390 assert (((NumElems * FromSz) % ToSz) == 0 &&
25391 "Unexpected ratio for truncating masked store");
25393 unsigned SizeRatio = FromSz / ToSz;
25394 assert(SizeRatio * NumElems * ToSz == VT.getSizeInBits());
25396 // Create a type on which we perform the shuffle
25397 EVT WideVecVT = EVT::getVectorVT(*DAG.getContext(),
25398 StVT.getScalarType(), NumElems*SizeRatio);
25400 assert(WideVecVT.getSizeInBits() == VT.getSizeInBits());
25402 SDValue WideVec = DAG.getBitcast(WideVecVT, Mst->getValue());
25403 SmallVector<int, 16> ShuffleVec(NumElems * SizeRatio, -1);
25404 for (unsigned i = 0; i != NumElems; ++i)
25405 ShuffleVec[i] = i * SizeRatio;
25407 // Can't shuffle using an illegal type.
25408 assert(DAG.getTargetLoweringInfo().isTypeLegal(WideVecVT) &&
25409 "WideVecVT should be legal");
25411 SDValue TruncatedVal = DAG.getVectorShuffle(WideVecVT, dl, WideVec,
25412 DAG.getUNDEF(WideVecVT),
25416 SDValue Mask = Mst->getMask();
25417 if (Mask.getValueType() == VT) {
25418 // Mask and original value have the same type
25419 NewMask = DAG.getBitcast(WideVecVT, Mask);
25420 for (unsigned i = 0; i != NumElems; ++i)
25421 ShuffleVec[i] = i * SizeRatio;
25422 for (unsigned i = NumElems; i != NumElems*SizeRatio; ++i)
25423 ShuffleVec[i] = NumElems*SizeRatio;
25424 NewMask = DAG.getVectorShuffle(WideVecVT, dl, NewMask,
25425 DAG.getConstant(0, dl, WideVecVT),
25429 assert(Mask.getValueType().getVectorElementType() == MVT::i1);
25430 unsigned WidenNumElts = NumElems*SizeRatio;
25431 unsigned MaskNumElts = VT.getVectorNumElements();
25432 EVT NewMaskVT = EVT::getVectorVT(*DAG.getContext(), MVT::i1,
25435 unsigned NumConcat = WidenNumElts / MaskNumElts;
25436 SmallVector<SDValue, 16> Ops(NumConcat);
25437 SDValue ZeroVal = DAG.getConstant(0, dl, Mask.getValueType());
25439 for (unsigned i = 1; i != NumConcat; ++i)
25442 NewMask = DAG.getNode(ISD::CONCAT_VECTORS, dl, NewMaskVT, Ops);
25445 return DAG.getMaskedStore(Mst->getChain(), dl, TruncatedVal, Mst->getBasePtr(),
25446 NewMask, StVT, Mst->getMemOperand(), false);
25448 /// PerformSTORECombine - Do target-specific dag combines on STORE nodes.
25449 static SDValue PerformSTORECombine(SDNode *N, SelectionDAG &DAG,
25450 const X86Subtarget *Subtarget) {
25451 StoreSDNode *St = cast<StoreSDNode>(N);
25452 EVT VT = St->getValue().getValueType();
25453 EVT StVT = St->getMemoryVT();
25455 SDValue StoredVal = St->getOperand(1);
25456 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
25458 // If we are saving a concatenation of two XMM registers and 32-byte stores
25459 // are slow, such as on Sandy Bridge, perform two 16-byte stores.
25461 unsigned AddressSpace = St->getAddressSpace();
25462 unsigned Alignment = St->getAlignment();
25463 if (VT.is256BitVector() && StVT == VT &&
25464 TLI.allowsMemoryAccess(*DAG.getContext(), DAG.getDataLayout(), VT,
25465 AddressSpace, Alignment, &Fast) && !Fast) {
25466 unsigned NumElems = VT.getVectorNumElements();
25470 SDValue Value0 = Extract128BitVector(StoredVal, 0, DAG, dl);
25471 SDValue Value1 = Extract128BitVector(StoredVal, NumElems/2, DAG, dl);
25474 DAG.getConstant(16, dl, TLI.getPointerTy(DAG.getDataLayout()));
25475 SDValue Ptr0 = St->getBasePtr();
25476 SDValue Ptr1 = DAG.getNode(ISD::ADD, dl, Ptr0.getValueType(), Ptr0, Stride);
25478 SDValue Ch0 = DAG.getStore(St->getChain(), dl, Value0, Ptr0,
25479 St->getPointerInfo(), St->isVolatile(),
25480 St->isNonTemporal(), Alignment);
25481 SDValue Ch1 = DAG.getStore(St->getChain(), dl, Value1, Ptr1,
25482 St->getPointerInfo(), St->isVolatile(),
25483 St->isNonTemporal(),
25484 std::min(16U, Alignment));
25485 return DAG.getNode(ISD::TokenFactor, dl, MVT::Other, Ch0, Ch1);
25488 // Optimize trunc store (of multiple scalars) to shuffle and store.
25489 // First, pack all of the elements in one place. Next, store to memory
25490 // in fewer chunks.
25491 if (St->isTruncatingStore() && VT.isVector()) {
25492 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
25493 unsigned NumElems = VT.getVectorNumElements();
25494 assert(StVT != VT && "Cannot truncate to the same type");
25495 unsigned FromSz = VT.getVectorElementType().getSizeInBits();
25496 unsigned ToSz = StVT.getVectorElementType().getSizeInBits();
25498 // The truncating store is legal in some cases. For example
25499 // vpmovqb, vpmovqw, vpmovqd, vpmovdb, vpmovdw
25500 // are designated for truncate store.
25501 // In this case we don't need any further transformations.
25502 if (TLI.isTruncStoreLegal(VT, StVT))
25505 // From, To sizes and ElemCount must be pow of two
25506 if (!isPowerOf2_32(NumElems * FromSz * ToSz)) return SDValue();
25507 // We are going to use the original vector elt for storing.
25508 // Accumulated smaller vector elements must be a multiple of the store size.
25509 if (0 != (NumElems * FromSz) % ToSz) return SDValue();
25511 unsigned SizeRatio = FromSz / ToSz;
25513 assert(SizeRatio * NumElems * ToSz == VT.getSizeInBits());
25515 // Create a type on which we perform the shuffle
25516 EVT WideVecVT = EVT::getVectorVT(*DAG.getContext(),
25517 StVT.getScalarType(), NumElems*SizeRatio);
25519 assert(WideVecVT.getSizeInBits() == VT.getSizeInBits());
25521 SDValue WideVec = DAG.getBitcast(WideVecVT, St->getValue());
25522 SmallVector<int, 8> ShuffleVec(NumElems * SizeRatio, -1);
25523 for (unsigned i = 0; i != NumElems; ++i)
25524 ShuffleVec[i] = i * SizeRatio;
25526 // Can't shuffle using an illegal type.
25527 if (!TLI.isTypeLegal(WideVecVT))
25530 SDValue Shuff = DAG.getVectorShuffle(WideVecVT, dl, WideVec,
25531 DAG.getUNDEF(WideVecVT),
25533 // At this point all of the data is stored at the bottom of the
25534 // register. We now need to save it to mem.
25536 // Find the largest store unit
25537 MVT StoreType = MVT::i8;
25538 for (MVT Tp : MVT::integer_valuetypes()) {
25539 if (TLI.isTypeLegal(Tp) && Tp.getSizeInBits() <= NumElems * ToSz)
25543 // On 32bit systems, we can't save 64bit integers. Try bitcasting to F64.
25544 if (TLI.isTypeLegal(MVT::f64) && StoreType.getSizeInBits() < 64 &&
25545 (64 <= NumElems * ToSz))
25546 StoreType = MVT::f64;
25548 // Bitcast the original vector into a vector of store-size units
25549 EVT StoreVecVT = EVT::getVectorVT(*DAG.getContext(),
25550 StoreType, VT.getSizeInBits()/StoreType.getSizeInBits());
25551 assert(StoreVecVT.getSizeInBits() == VT.getSizeInBits());
25552 SDValue ShuffWide = DAG.getBitcast(StoreVecVT, Shuff);
25553 SmallVector<SDValue, 8> Chains;
25554 SDValue Increment = DAG.getConstant(StoreType.getSizeInBits() / 8, dl,
25555 TLI.getPointerTy(DAG.getDataLayout()));
25556 SDValue Ptr = St->getBasePtr();
25558 // Perform one or more big stores into memory.
25559 for (unsigned i=0, e=(ToSz*NumElems)/StoreType.getSizeInBits(); i!=e; ++i) {
25560 SDValue SubVec = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl,
25561 StoreType, ShuffWide,
25562 DAG.getIntPtrConstant(i, dl));
25563 SDValue Ch = DAG.getStore(St->getChain(), dl, SubVec, Ptr,
25564 St->getPointerInfo(), St->isVolatile(),
25565 St->isNonTemporal(), St->getAlignment());
25566 Ptr = DAG.getNode(ISD::ADD, dl, Ptr.getValueType(), Ptr, Increment);
25567 Chains.push_back(Ch);
25570 return DAG.getNode(ISD::TokenFactor, dl, MVT::Other, Chains);
25573 // Turn load->store of MMX types into GPR load/stores. This avoids clobbering
25574 // the FP state in cases where an emms may be missing.
25575 // A preferable solution to the general problem is to figure out the right
25576 // places to insert EMMS. This qualifies as a quick hack.
25578 // Similarly, turn load->store of i64 into double load/stores in 32-bit mode.
25579 if (VT.getSizeInBits() != 64)
25582 const Function *F = DAG.getMachineFunction().getFunction();
25583 bool NoImplicitFloatOps = F->hasFnAttribute(Attribute::NoImplicitFloat);
25585 !Subtarget->useSoftFloat() && !NoImplicitFloatOps && Subtarget->hasSSE2();
25586 if ((VT.isVector() ||
25587 (VT == MVT::i64 && F64IsLegal && !Subtarget->is64Bit())) &&
25588 isa<LoadSDNode>(St->getValue()) &&
25589 !cast<LoadSDNode>(St->getValue())->isVolatile() &&
25590 St->getChain().hasOneUse() && !St->isVolatile()) {
25591 SDNode* LdVal = St->getValue().getNode();
25592 LoadSDNode *Ld = nullptr;
25593 int TokenFactorIndex = -1;
25594 SmallVector<SDValue, 8> Ops;
25595 SDNode* ChainVal = St->getChain().getNode();
25596 // Must be a store of a load. We currently handle two cases: the load
25597 // is a direct child, and it's under an intervening TokenFactor. It is
25598 // possible to dig deeper under nested TokenFactors.
25599 if (ChainVal == LdVal)
25600 Ld = cast<LoadSDNode>(St->getChain());
25601 else if (St->getValue().hasOneUse() &&
25602 ChainVal->getOpcode() == ISD::TokenFactor) {
25603 for (unsigned i = 0, e = ChainVal->getNumOperands(); i != e; ++i) {
25604 if (ChainVal->getOperand(i).getNode() == LdVal) {
25605 TokenFactorIndex = i;
25606 Ld = cast<LoadSDNode>(St->getValue());
25608 Ops.push_back(ChainVal->getOperand(i));
25612 if (!Ld || !ISD::isNormalLoad(Ld))
25615 // If this is not the MMX case, i.e. we are just turning i64 load/store
25616 // into f64 load/store, avoid the transformation if there are multiple
25617 // uses of the loaded value.
25618 if (!VT.isVector() && !Ld->hasNUsesOfValue(1, 0))
25623 // If we are a 64-bit capable x86, lower to a single movq load/store pair.
25624 // Otherwise, if it's legal to use f64 SSE instructions, use f64 load/store
25626 if (Subtarget->is64Bit() || F64IsLegal) {
25627 MVT LdVT = Subtarget->is64Bit() ? MVT::i64 : MVT::f64;
25628 SDValue NewLd = DAG.getLoad(LdVT, LdDL, Ld->getChain(), Ld->getBasePtr(),
25629 Ld->getPointerInfo(), Ld->isVolatile(),
25630 Ld->isNonTemporal(), Ld->isInvariant(),
25631 Ld->getAlignment());
25632 SDValue NewChain = NewLd.getValue(1);
25633 if (TokenFactorIndex != -1) {
25634 Ops.push_back(NewChain);
25635 NewChain = DAG.getNode(ISD::TokenFactor, LdDL, MVT::Other, Ops);
25637 return DAG.getStore(NewChain, StDL, NewLd, St->getBasePtr(),
25638 St->getPointerInfo(),
25639 St->isVolatile(), St->isNonTemporal(),
25640 St->getAlignment());
25643 // Otherwise, lower to two pairs of 32-bit loads / stores.
25644 SDValue LoAddr = Ld->getBasePtr();
25645 SDValue HiAddr = DAG.getNode(ISD::ADD, LdDL, MVT::i32, LoAddr,
25646 DAG.getConstant(4, LdDL, MVT::i32));
25648 SDValue LoLd = DAG.getLoad(MVT::i32, LdDL, Ld->getChain(), LoAddr,
25649 Ld->getPointerInfo(),
25650 Ld->isVolatile(), Ld->isNonTemporal(),
25651 Ld->isInvariant(), Ld->getAlignment());
25652 SDValue HiLd = DAG.getLoad(MVT::i32, LdDL, Ld->getChain(), HiAddr,
25653 Ld->getPointerInfo().getWithOffset(4),
25654 Ld->isVolatile(), Ld->isNonTemporal(),
25656 MinAlign(Ld->getAlignment(), 4));
25658 SDValue NewChain = LoLd.getValue(1);
25659 if (TokenFactorIndex != -1) {
25660 Ops.push_back(LoLd);
25661 Ops.push_back(HiLd);
25662 NewChain = DAG.getNode(ISD::TokenFactor, LdDL, MVT::Other, Ops);
25665 LoAddr = St->getBasePtr();
25666 HiAddr = DAG.getNode(ISD::ADD, StDL, MVT::i32, LoAddr,
25667 DAG.getConstant(4, StDL, MVT::i32));
25669 SDValue LoSt = DAG.getStore(NewChain, StDL, LoLd, LoAddr,
25670 St->getPointerInfo(),
25671 St->isVolatile(), St->isNonTemporal(),
25672 St->getAlignment());
25673 SDValue HiSt = DAG.getStore(NewChain, StDL, HiLd, HiAddr,
25674 St->getPointerInfo().getWithOffset(4),
25676 St->isNonTemporal(),
25677 MinAlign(St->getAlignment(), 4));
25678 return DAG.getNode(ISD::TokenFactor, StDL, MVT::Other, LoSt, HiSt);
25681 // This is similar to the above case, but here we handle a scalar 64-bit
25682 // integer store that is extracted from a vector on a 32-bit target.
25683 // If we have SSE2, then we can treat it like a floating-point double
25684 // to get past legalization. The execution dependencies fixup pass will
25685 // choose the optimal machine instruction for the store if this really is
25686 // an integer or v2f32 rather than an f64.
25687 if (VT == MVT::i64 && F64IsLegal && !Subtarget->is64Bit() &&
25688 St->getOperand(1).getOpcode() == ISD::EXTRACT_VECTOR_ELT) {
25689 SDValue OldExtract = St->getOperand(1);
25690 SDValue ExtOp0 = OldExtract.getOperand(0);
25691 unsigned VecSize = ExtOp0.getValueSizeInBits();
25692 EVT VecVT = EVT::getVectorVT(*DAG.getContext(), MVT::f64, VecSize / 64);
25693 SDValue BitCast = DAG.getBitcast(VecVT, ExtOp0);
25694 SDValue NewExtract = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::f64,
25695 BitCast, OldExtract.getOperand(1));
25696 return DAG.getStore(St->getChain(), dl, NewExtract, St->getBasePtr(),
25697 St->getPointerInfo(), St->isVolatile(),
25698 St->isNonTemporal(), St->getAlignment());
25704 /// Return 'true' if this vector operation is "horizontal"
25705 /// and return the operands for the horizontal operation in LHS and RHS. A
25706 /// horizontal operation performs the binary operation on successive elements
25707 /// of its first operand, then on successive elements of its second operand,
25708 /// returning the resulting values in a vector. For example, if
25709 /// A = < float a0, float a1, float a2, float a3 >
25711 /// B = < float b0, float b1, float b2, float b3 >
25712 /// then the result of doing a horizontal operation on A and B is
25713 /// A horizontal-op B = < a0 op a1, a2 op a3, b0 op b1, b2 op b3 >.
25714 /// In short, LHS and RHS are inspected to see if LHS op RHS is of the form
25715 /// A horizontal-op B, for some already available A and B, and if so then LHS is
25716 /// set to A, RHS to B, and the routine returns 'true'.
25717 /// Note that the binary operation should have the property that if one of the
25718 /// operands is UNDEF then the result is UNDEF.
25719 static bool isHorizontalBinOp(SDValue &LHS, SDValue &RHS, bool IsCommutative) {
25720 // Look for the following pattern: if
25721 // A = < float a0, float a1, float a2, float a3 >
25722 // B = < float b0, float b1, float b2, float b3 >
25724 // LHS = VECTOR_SHUFFLE A, B, <0, 2, 4, 6>
25725 // RHS = VECTOR_SHUFFLE A, B, <1, 3, 5, 7>
25726 // then LHS op RHS = < a0 op a1, a2 op a3, b0 op b1, b2 op b3 >
25727 // which is A horizontal-op B.
25729 // At least one of the operands should be a vector shuffle.
25730 if (LHS.getOpcode() != ISD::VECTOR_SHUFFLE &&
25731 RHS.getOpcode() != ISD::VECTOR_SHUFFLE)
25734 MVT VT = LHS.getSimpleValueType();
25736 assert((VT.is128BitVector() || VT.is256BitVector()) &&
25737 "Unsupported vector type for horizontal add/sub");
25739 // Handle 128 and 256-bit vector lengths. AVX defines horizontal add/sub to
25740 // operate independently on 128-bit lanes.
25741 unsigned NumElts = VT.getVectorNumElements();
25742 unsigned NumLanes = VT.getSizeInBits()/128;
25743 unsigned NumLaneElts = NumElts / NumLanes;
25744 assert((NumLaneElts % 2 == 0) &&
25745 "Vector type should have an even number of elements in each lane");
25746 unsigned HalfLaneElts = NumLaneElts/2;
25748 // View LHS in the form
25749 // LHS = VECTOR_SHUFFLE A, B, LMask
25750 // If LHS is not a shuffle then pretend it is the shuffle
25751 // LHS = VECTOR_SHUFFLE LHS, undef, <0, 1, ..., N-1>
25752 // NOTE: in what follows a default initialized SDValue represents an UNDEF of
25755 SmallVector<int, 16> LMask(NumElts);
25756 if (LHS.getOpcode() == ISD::VECTOR_SHUFFLE) {
25757 if (LHS.getOperand(0).getOpcode() != ISD::UNDEF)
25758 A = LHS.getOperand(0);
25759 if (LHS.getOperand(1).getOpcode() != ISD::UNDEF)
25760 B = LHS.getOperand(1);
25761 ArrayRef<int> Mask = cast<ShuffleVectorSDNode>(LHS.getNode())->getMask();
25762 std::copy(Mask.begin(), Mask.end(), LMask.begin());
25764 if (LHS.getOpcode() != ISD::UNDEF)
25766 for (unsigned i = 0; i != NumElts; ++i)
25770 // Likewise, view RHS in the form
25771 // RHS = VECTOR_SHUFFLE C, D, RMask
25773 SmallVector<int, 16> RMask(NumElts);
25774 if (RHS.getOpcode() == ISD::VECTOR_SHUFFLE) {
25775 if (RHS.getOperand(0).getOpcode() != ISD::UNDEF)
25776 C = RHS.getOperand(0);
25777 if (RHS.getOperand(1).getOpcode() != ISD::UNDEF)
25778 D = RHS.getOperand(1);
25779 ArrayRef<int> Mask = cast<ShuffleVectorSDNode>(RHS.getNode())->getMask();
25780 std::copy(Mask.begin(), Mask.end(), RMask.begin());
25782 if (RHS.getOpcode() != ISD::UNDEF)
25784 for (unsigned i = 0; i != NumElts; ++i)
25788 // Check that the shuffles are both shuffling the same vectors.
25789 if (!(A == C && B == D) && !(A == D && B == C))
25792 // If everything is UNDEF then bail out: it would be better to fold to UNDEF.
25793 if (!A.getNode() && !B.getNode())
25796 // If A and B occur in reverse order in RHS, then "swap" them (which means
25797 // rewriting the mask).
25799 ShuffleVectorSDNode::commuteMask(RMask);
25801 // At this point LHS and RHS are equivalent to
25802 // LHS = VECTOR_SHUFFLE A, B, LMask
25803 // RHS = VECTOR_SHUFFLE A, B, RMask
25804 // Check that the masks correspond to performing a horizontal operation.
25805 for (unsigned l = 0; l != NumElts; l += NumLaneElts) {
25806 for (unsigned i = 0; i != NumLaneElts; ++i) {
25807 int LIdx = LMask[i+l], RIdx = RMask[i+l];
25809 // Ignore any UNDEF components.
25810 if (LIdx < 0 || RIdx < 0 ||
25811 (!A.getNode() && (LIdx < (int)NumElts || RIdx < (int)NumElts)) ||
25812 (!B.getNode() && (LIdx >= (int)NumElts || RIdx >= (int)NumElts)))
25815 // Check that successive elements are being operated on. If not, this is
25816 // not a horizontal operation.
25817 unsigned Src = (i/HalfLaneElts); // each lane is split between srcs
25818 int Index = 2*(i%HalfLaneElts) + NumElts*Src + l;
25819 if (!(LIdx == Index && RIdx == Index + 1) &&
25820 !(IsCommutative && LIdx == Index + 1 && RIdx == Index))
25825 LHS = A.getNode() ? A : B; // If A is 'UNDEF', use B for it.
25826 RHS = B.getNode() ? B : A; // If B is 'UNDEF', use A for it.
25830 /// Do target-specific dag combines on floating point adds.
25831 static SDValue PerformFADDCombine(SDNode *N, SelectionDAG &DAG,
25832 const X86Subtarget *Subtarget) {
25833 EVT VT = N->getValueType(0);
25834 SDValue LHS = N->getOperand(0);
25835 SDValue RHS = N->getOperand(1);
25837 // Try to synthesize horizontal adds from adds of shuffles.
25838 if (((Subtarget->hasSSE3() && (VT == MVT::v4f32 || VT == MVT::v2f64)) ||
25839 (Subtarget->hasFp256() && (VT == MVT::v8f32 || VT == MVT::v4f64))) &&
25840 isHorizontalBinOp(LHS, RHS, true))
25841 return DAG.getNode(X86ISD::FHADD, SDLoc(N), VT, LHS, RHS);
25845 /// Do target-specific dag combines on floating point subs.
25846 static SDValue PerformFSUBCombine(SDNode *N, SelectionDAG &DAG,
25847 const X86Subtarget *Subtarget) {
25848 EVT VT = N->getValueType(0);
25849 SDValue LHS = N->getOperand(0);
25850 SDValue RHS = N->getOperand(1);
25852 // Try to synthesize horizontal subs from subs of shuffles.
25853 if (((Subtarget->hasSSE3() && (VT == MVT::v4f32 || VT == MVT::v2f64)) ||
25854 (Subtarget->hasFp256() && (VT == MVT::v8f32 || VT == MVT::v4f64))) &&
25855 isHorizontalBinOp(LHS, RHS, false))
25856 return DAG.getNode(X86ISD::FHSUB, SDLoc(N), VT, LHS, RHS);
25860 /// Do target-specific dag combines on X86ISD::FOR and X86ISD::FXOR nodes.
25861 static SDValue PerformFORCombine(SDNode *N, SelectionDAG &DAG,
25862 const X86Subtarget *Subtarget) {
25863 assert(N->getOpcode() == X86ISD::FOR || N->getOpcode() == X86ISD::FXOR);
25865 // F[X]OR(0.0, x) -> x
25866 if (ConstantFPSDNode *C = dyn_cast<ConstantFPSDNode>(N->getOperand(0)))
25867 if (C->getValueAPF().isPosZero())
25868 return N->getOperand(1);
25870 // F[X]OR(x, 0.0) -> x
25871 if (ConstantFPSDNode *C = dyn_cast<ConstantFPSDNode>(N->getOperand(1)))
25872 if (C->getValueAPF().isPosZero())
25873 return N->getOperand(0);
25875 EVT VT = N->getValueType(0);
25876 if (VT.is512BitVector() && !Subtarget->hasDQI()) {
25878 MVT IntScalar = MVT::getIntegerVT(VT.getScalarSizeInBits());
25879 MVT IntVT = MVT::getVectorVT(IntScalar, VT.getVectorNumElements());
25881 SDValue Op0 = DAG.getNode(ISD::BITCAST, dl, IntVT, N->getOperand(0));
25882 SDValue Op1 = DAG.getNode(ISD::BITCAST, dl, IntVT, N->getOperand(1));
25883 unsigned IntOpcode = (N->getOpcode() == X86ISD::FOR) ? ISD::OR : ISD::XOR;
25884 SDValue IntOp = DAG.getNode(IntOpcode, dl, IntVT, Op0, Op1);
25885 return DAG.getNode(ISD::BITCAST, dl, VT, IntOp);
25890 /// Do target-specific dag combines on X86ISD::FMIN and X86ISD::FMAX nodes.
25891 static SDValue PerformFMinFMaxCombine(SDNode *N, SelectionDAG &DAG) {
25892 assert(N->getOpcode() == X86ISD::FMIN || N->getOpcode() == X86ISD::FMAX);
25894 // Only perform optimizations if UnsafeMath is used.
25895 if (!DAG.getTarget().Options.UnsafeFPMath)
25898 // If we run in unsafe-math mode, then convert the FMAX and FMIN nodes
25899 // into FMINC and FMAXC, which are Commutative operations.
25900 unsigned NewOp = 0;
25901 switch (N->getOpcode()) {
25902 default: llvm_unreachable("unknown opcode");
25903 case X86ISD::FMIN: NewOp = X86ISD::FMINC; break;
25904 case X86ISD::FMAX: NewOp = X86ISD::FMAXC; break;
25907 return DAG.getNode(NewOp, SDLoc(N), N->getValueType(0),
25908 N->getOperand(0), N->getOperand(1));
25911 /// Do target-specific dag combines on X86ISD::FAND nodes.
25912 static SDValue PerformFANDCombine(SDNode *N, SelectionDAG &DAG) {
25913 // FAND(0.0, x) -> 0.0
25914 if (ConstantFPSDNode *C = dyn_cast<ConstantFPSDNode>(N->getOperand(0)))
25915 if (C->getValueAPF().isPosZero())
25916 return N->getOperand(0);
25918 // FAND(x, 0.0) -> 0.0
25919 if (ConstantFPSDNode *C = dyn_cast<ConstantFPSDNode>(N->getOperand(1)))
25920 if (C->getValueAPF().isPosZero())
25921 return N->getOperand(1);
25926 /// Do target-specific dag combines on X86ISD::FANDN nodes
25927 static SDValue PerformFANDNCombine(SDNode *N, SelectionDAG &DAG) {
25928 // FANDN(0.0, x) -> x
25929 if (ConstantFPSDNode *C = dyn_cast<ConstantFPSDNode>(N->getOperand(0)))
25930 if (C->getValueAPF().isPosZero())
25931 return N->getOperand(1);
25933 // FANDN(x, 0.0) -> 0.0
25934 if (ConstantFPSDNode *C = dyn_cast<ConstantFPSDNode>(N->getOperand(1)))
25935 if (C->getValueAPF().isPosZero())
25936 return N->getOperand(1);
25941 static SDValue PerformBTCombine(SDNode *N,
25943 TargetLowering::DAGCombinerInfo &DCI) {
25944 // BT ignores high bits in the bit index operand.
25945 SDValue Op1 = N->getOperand(1);
25946 if (Op1.hasOneUse()) {
25947 unsigned BitWidth = Op1.getValueSizeInBits();
25948 APInt DemandedMask = APInt::getLowBitsSet(BitWidth, Log2_32(BitWidth));
25949 APInt KnownZero, KnownOne;
25950 TargetLowering::TargetLoweringOpt TLO(DAG, !DCI.isBeforeLegalize(),
25951 !DCI.isBeforeLegalizeOps());
25952 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
25953 if (TLO.ShrinkDemandedConstant(Op1, DemandedMask) ||
25954 TLI.SimplifyDemandedBits(Op1, DemandedMask, KnownZero, KnownOne, TLO))
25955 DCI.CommitTargetLoweringOpt(TLO);
25960 static SDValue PerformVZEXT_MOVLCombine(SDNode *N, SelectionDAG &DAG) {
25961 SDValue Op = N->getOperand(0);
25962 if (Op.getOpcode() == ISD::BITCAST)
25963 Op = Op.getOperand(0);
25964 EVT VT = N->getValueType(0), OpVT = Op.getValueType();
25965 if (Op.getOpcode() == X86ISD::VZEXT_LOAD &&
25966 VT.getVectorElementType().getSizeInBits() ==
25967 OpVT.getVectorElementType().getSizeInBits()) {
25968 return DAG.getNode(ISD::BITCAST, SDLoc(N), VT, Op);
25973 static SDValue PerformSIGN_EXTEND_INREGCombine(SDNode *N, SelectionDAG &DAG,
25974 const X86Subtarget *Subtarget) {
25975 EVT VT = N->getValueType(0);
25976 if (!VT.isVector())
25979 SDValue N0 = N->getOperand(0);
25980 SDValue N1 = N->getOperand(1);
25981 EVT ExtraVT = cast<VTSDNode>(N1)->getVT();
25984 // The SIGN_EXTEND_INREG to v4i64 is expensive operation on the
25985 // both SSE and AVX2 since there is no sign-extended shift right
25986 // operation on a vector with 64-bit elements.
25987 //(sext_in_reg (v4i64 anyext (v4i32 x )), ExtraVT) ->
25988 // (v4i64 sext (v4i32 sext_in_reg (v4i32 x , ExtraVT)))
25989 if (VT == MVT::v4i64 && (N0.getOpcode() == ISD::ANY_EXTEND ||
25990 N0.getOpcode() == ISD::SIGN_EXTEND)) {
25991 SDValue N00 = N0.getOperand(0);
25993 // EXTLOAD has a better solution on AVX2,
25994 // it may be replaced with X86ISD::VSEXT node.
25995 if (N00.getOpcode() == ISD::LOAD && Subtarget->hasInt256())
25996 if (!ISD::isNormalLoad(N00.getNode()))
25999 if (N00.getValueType() == MVT::v4i32 && ExtraVT.getSizeInBits() < 128) {
26000 SDValue Tmp = DAG.getNode(ISD::SIGN_EXTEND_INREG, dl, MVT::v4i32,
26002 return DAG.getNode(ISD::SIGN_EXTEND, dl, MVT::v4i64, Tmp);
26008 /// sext(add_nsw(x, C)) --> add(sext(x), C_sext)
26009 /// Promoting a sign extension ahead of an 'add nsw' exposes opportunities
26010 /// to combine math ops, use an LEA, or use a complex addressing mode. This can
26011 /// eliminate extend, add, and shift instructions.
26012 static SDValue promoteSextBeforeAddNSW(SDNode *Sext, SelectionDAG &DAG,
26013 const X86Subtarget *Subtarget) {
26014 // TODO: This should be valid for other integer types.
26015 EVT VT = Sext->getValueType(0);
26016 if (VT != MVT::i64)
26019 // We need an 'add nsw' feeding into the 'sext'.
26020 SDValue Add = Sext->getOperand(0);
26021 if (Add.getOpcode() != ISD::ADD || !Add->getFlags()->hasNoSignedWrap())
26024 // Having a constant operand to the 'add' ensures that we are not increasing
26025 // the instruction count because the constant is extended for free below.
26026 // A constant operand can also become the displacement field of an LEA.
26027 auto *AddOp1 = dyn_cast<ConstantSDNode>(Add.getOperand(1));
26031 // Don't make the 'add' bigger if there's no hope of combining it with some
26032 // other 'add' or 'shl' instruction.
26033 // TODO: It may be profitable to generate simpler LEA instructions in place
26034 // of single 'add' instructions, but the cost model for selecting an LEA
26035 // currently has a high threshold.
26036 bool HasLEAPotential = false;
26037 for (auto *User : Sext->uses()) {
26038 if (User->getOpcode() == ISD::ADD || User->getOpcode() == ISD::SHL) {
26039 HasLEAPotential = true;
26043 if (!HasLEAPotential)
26046 // Everything looks good, so pull the 'sext' ahead of the 'add'.
26047 int64_t AddConstant = AddOp1->getSExtValue();
26048 SDValue AddOp0 = Add.getOperand(0);
26049 SDValue NewSext = DAG.getNode(ISD::SIGN_EXTEND, SDLoc(Sext), VT, AddOp0);
26050 SDValue NewConstant = DAG.getConstant(AddConstant, SDLoc(Add), VT);
26052 // The wider add is guaranteed to not wrap because both operands are
26055 Flags.setNoSignedWrap(true);
26056 return DAG.getNode(ISD::ADD, SDLoc(Add), VT, NewSext, NewConstant, &Flags);
26059 static SDValue PerformSExtCombine(SDNode *N, SelectionDAG &DAG,
26060 TargetLowering::DAGCombinerInfo &DCI,
26061 const X86Subtarget *Subtarget) {
26062 SDValue N0 = N->getOperand(0);
26063 EVT VT = N->getValueType(0);
26064 EVT SVT = VT.getScalarType();
26065 EVT InVT = N0.getValueType();
26066 EVT InSVT = InVT.getScalarType();
26069 // (i8,i32 sext (sdivrem (i8 x, i8 y)) ->
26070 // (i8,i32 (sdivrem_sext_hreg (i8 x, i8 y)
26071 // This exposes the sext to the sdivrem lowering, so that it directly extends
26072 // from AH (which we otherwise need to do contortions to access).
26073 if (N0.getOpcode() == ISD::SDIVREM && N0.getResNo() == 1 &&
26074 InVT == MVT::i8 && VT == MVT::i32) {
26075 SDVTList NodeTys = DAG.getVTList(MVT::i8, VT);
26076 SDValue R = DAG.getNode(X86ISD::SDIVREM8_SEXT_HREG, DL, NodeTys,
26077 N0.getOperand(0), N0.getOperand(1));
26078 DAG.ReplaceAllUsesOfValueWith(N0.getValue(0), R.getValue(0));
26079 return R.getValue(1);
26082 if (!DCI.isBeforeLegalizeOps()) {
26083 if (InVT == MVT::i1) {
26084 SDValue Zero = DAG.getConstant(0, DL, VT);
26086 DAG.getConstant(APInt::getAllOnesValue(VT.getSizeInBits()), DL, VT);
26087 return DAG.getNode(ISD::SELECT, DL, VT, N0, AllOnes, Zero);
26092 if (VT.isVector() && Subtarget->hasSSE2()) {
26093 auto ExtendVecSize = [&DAG](SDLoc DL, SDValue N, unsigned Size) {
26094 EVT InVT = N.getValueType();
26095 EVT OutVT = EVT::getVectorVT(*DAG.getContext(), InVT.getScalarType(),
26096 Size / InVT.getScalarSizeInBits());
26097 SmallVector<SDValue, 8> Opnds(Size / InVT.getSizeInBits(),
26098 DAG.getUNDEF(InVT));
26100 return DAG.getNode(ISD::CONCAT_VECTORS, DL, OutVT, Opnds);
26103 // If target-size is less than 128-bits, extend to a type that would extend
26104 // to 128 bits, extend that and extract the original target vector.
26105 if (VT.getSizeInBits() < 128 && !(128 % VT.getSizeInBits()) &&
26106 (SVT == MVT::i64 || SVT == MVT::i32 || SVT == MVT::i16) &&
26107 (InSVT == MVT::i32 || InSVT == MVT::i16 || InSVT == MVT::i8)) {
26108 unsigned Scale = 128 / VT.getSizeInBits();
26110 EVT::getVectorVT(*DAG.getContext(), SVT, 128 / SVT.getSizeInBits());
26111 SDValue Ex = ExtendVecSize(DL, N0, Scale * InVT.getSizeInBits());
26112 SDValue SExt = DAG.getNode(ISD::SIGN_EXTEND, DL, ExVT, Ex);
26113 return DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, VT, SExt,
26114 DAG.getIntPtrConstant(0, DL));
26117 // If target-size is 128-bits, then convert to ISD::SIGN_EXTEND_VECTOR_INREG
26118 // which ensures lowering to X86ISD::VSEXT (pmovsx*).
26119 if (VT.getSizeInBits() == 128 &&
26120 (SVT == MVT::i64 || SVT == MVT::i32 || SVT == MVT::i16) &&
26121 (InSVT == MVT::i32 || InSVT == MVT::i16 || InSVT == MVT::i8)) {
26122 SDValue ExOp = ExtendVecSize(DL, N0, 128);
26123 return DAG.getSignExtendVectorInReg(ExOp, DL, VT);
26126 // On pre-AVX2 targets, split into 128-bit nodes of
26127 // ISD::SIGN_EXTEND_VECTOR_INREG.
26128 if (!Subtarget->hasInt256() && !(VT.getSizeInBits() % 128) &&
26129 (SVT == MVT::i64 || SVT == MVT::i32 || SVT == MVT::i16) &&
26130 (InSVT == MVT::i32 || InSVT == MVT::i16 || InSVT == MVT::i8)) {
26131 unsigned NumVecs = VT.getSizeInBits() / 128;
26132 unsigned NumSubElts = 128 / SVT.getSizeInBits();
26133 EVT SubVT = EVT::getVectorVT(*DAG.getContext(), SVT, NumSubElts);
26134 EVT InSubVT = EVT::getVectorVT(*DAG.getContext(), InSVT, NumSubElts);
26136 SmallVector<SDValue, 8> Opnds;
26137 for (unsigned i = 0, Offset = 0; i != NumVecs;
26138 ++i, Offset += NumSubElts) {
26139 SDValue SrcVec = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, InSubVT, N0,
26140 DAG.getIntPtrConstant(Offset, DL));
26141 SrcVec = ExtendVecSize(DL, SrcVec, 128);
26142 SrcVec = DAG.getSignExtendVectorInReg(SrcVec, DL, SubVT);
26143 Opnds.push_back(SrcVec);
26145 return DAG.getNode(ISD::CONCAT_VECTORS, DL, VT, Opnds);
26149 if (Subtarget->hasAVX() && VT.is256BitVector())
26150 if (SDValue R = WidenMaskArithmetic(N, DAG, DCI, Subtarget))
26153 if (SDValue NewAdd = promoteSextBeforeAddNSW(N, DAG, Subtarget))
26159 static SDValue PerformFMACombine(SDNode *N, SelectionDAG &DAG,
26160 const X86Subtarget* Subtarget) {
26162 EVT VT = N->getValueType(0);
26164 // Let legalize expand this if it isn't a legal type yet.
26165 if (!DAG.getTargetLoweringInfo().isTypeLegal(VT))
26168 EVT ScalarVT = VT.getScalarType();
26169 if ((ScalarVT != MVT::f32 && ScalarVT != MVT::f64) ||
26170 (!Subtarget->hasFMA() && !Subtarget->hasFMA4() &&
26171 !Subtarget->hasAVX512()))
26174 SDValue A = N->getOperand(0);
26175 SDValue B = N->getOperand(1);
26176 SDValue C = N->getOperand(2);
26178 bool NegA = (A.getOpcode() == ISD::FNEG);
26179 bool NegB = (B.getOpcode() == ISD::FNEG);
26180 bool NegC = (C.getOpcode() == ISD::FNEG);
26182 // Negative multiplication when NegA xor NegB
26183 bool NegMul = (NegA != NegB);
26185 A = A.getOperand(0);
26187 B = B.getOperand(0);
26189 C = C.getOperand(0);
26193 Opcode = (!NegC) ? X86ISD::FMADD : X86ISD::FMSUB;
26195 Opcode = (!NegC) ? X86ISD::FNMADD : X86ISD::FNMSUB;
26197 return DAG.getNode(Opcode, dl, VT, A, B, C);
26200 static SDValue PerformZExtCombine(SDNode *N, SelectionDAG &DAG,
26201 TargetLowering::DAGCombinerInfo &DCI,
26202 const X86Subtarget *Subtarget) {
26203 // (i32 zext (and (i8 x86isd::setcc_carry), 1)) ->
26204 // (and (i32 x86isd::setcc_carry), 1)
26205 // This eliminates the zext. This transformation is necessary because
26206 // ISD::SETCC is always legalized to i8.
26208 SDValue N0 = N->getOperand(0);
26209 EVT VT = N->getValueType(0);
26211 if (N0.getOpcode() == ISD::AND &&
26213 N0.getOperand(0).hasOneUse()) {
26214 SDValue N00 = N0.getOperand(0);
26215 if (N00.getOpcode() == X86ISD::SETCC_CARRY) {
26216 ConstantSDNode *C = dyn_cast<ConstantSDNode>(N0.getOperand(1));
26217 if (!C || C->getZExtValue() != 1)
26219 return DAG.getNode(ISD::AND, dl, VT,
26220 DAG.getNode(X86ISD::SETCC_CARRY, dl, VT,
26221 N00.getOperand(0), N00.getOperand(1)),
26222 DAG.getConstant(1, dl, VT));
26226 if (N0.getOpcode() == ISD::TRUNCATE &&
26228 N0.getOperand(0).hasOneUse()) {
26229 SDValue N00 = N0.getOperand(0);
26230 if (N00.getOpcode() == X86ISD::SETCC_CARRY) {
26231 return DAG.getNode(ISD::AND, dl, VT,
26232 DAG.getNode(X86ISD::SETCC_CARRY, dl, VT,
26233 N00.getOperand(0), N00.getOperand(1)),
26234 DAG.getConstant(1, dl, VT));
26238 if (VT.is256BitVector())
26239 if (SDValue R = WidenMaskArithmetic(N, DAG, DCI, Subtarget))
26242 // (i8,i32 zext (udivrem (i8 x, i8 y)) ->
26243 // (i8,i32 (udivrem_zext_hreg (i8 x, i8 y)
26244 // This exposes the zext to the udivrem lowering, so that it directly extends
26245 // from AH (which we otherwise need to do contortions to access).
26246 if (N0.getOpcode() == ISD::UDIVREM &&
26247 N0.getResNo() == 1 && N0.getValueType() == MVT::i8 &&
26248 (VT == MVT::i32 || VT == MVT::i64)) {
26249 SDVTList NodeTys = DAG.getVTList(MVT::i8, VT);
26250 SDValue R = DAG.getNode(X86ISD::UDIVREM8_ZEXT_HREG, dl, NodeTys,
26251 N0.getOperand(0), N0.getOperand(1));
26252 DAG.ReplaceAllUsesOfValueWith(N0.getValue(0), R.getValue(0));
26253 return R.getValue(1);
26259 // Optimize x == -y --> x+y == 0
26260 // x != -y --> x+y != 0
26261 static SDValue PerformISDSETCCCombine(SDNode *N, SelectionDAG &DAG,
26262 const X86Subtarget* Subtarget) {
26263 ISD::CondCode CC = cast<CondCodeSDNode>(N->getOperand(2))->get();
26264 SDValue LHS = N->getOperand(0);
26265 SDValue RHS = N->getOperand(1);
26266 EVT VT = N->getValueType(0);
26269 if ((CC == ISD::SETNE || CC == ISD::SETEQ) && LHS.getOpcode() == ISD::SUB)
26270 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(LHS.getOperand(0)))
26271 if (C->getAPIntValue() == 0 && LHS.hasOneUse()) {
26272 SDValue addV = DAG.getNode(ISD::ADD, DL, LHS.getValueType(), RHS,
26273 LHS.getOperand(1));
26274 return DAG.getSetCC(DL, N->getValueType(0), addV,
26275 DAG.getConstant(0, DL, addV.getValueType()), CC);
26277 if ((CC == ISD::SETNE || CC == ISD::SETEQ) && RHS.getOpcode() == ISD::SUB)
26278 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(RHS.getOperand(0)))
26279 if (C->getAPIntValue() == 0 && RHS.hasOneUse()) {
26280 SDValue addV = DAG.getNode(ISD::ADD, DL, RHS.getValueType(), LHS,
26281 RHS.getOperand(1));
26282 return DAG.getSetCC(DL, N->getValueType(0), addV,
26283 DAG.getConstant(0, DL, addV.getValueType()), CC);
26286 if (VT.getScalarType() == MVT::i1 &&
26287 (CC == ISD::SETNE || CC == ISD::SETEQ || ISD::isSignedIntSetCC(CC))) {
26289 (LHS.getOpcode() == ISD::SIGN_EXTEND) &&
26290 (LHS.getOperand(0).getValueType().getScalarType() == MVT::i1);
26291 bool IsVZero1 = ISD::isBuildVectorAllZeros(RHS.getNode());
26293 if (!IsSEXT0 || !IsVZero1) {
26294 // Swap the operands and update the condition code.
26295 std::swap(LHS, RHS);
26296 CC = ISD::getSetCCSwappedOperands(CC);
26298 IsSEXT0 = (LHS.getOpcode() == ISD::SIGN_EXTEND) &&
26299 (LHS.getOperand(0).getValueType().getScalarType() == MVT::i1);
26300 IsVZero1 = ISD::isBuildVectorAllZeros(RHS.getNode());
26303 if (IsSEXT0 && IsVZero1) {
26304 assert(VT == LHS.getOperand(0).getValueType() &&
26305 "Uexpected operand type");
26306 if (CC == ISD::SETGT)
26307 return DAG.getConstant(0, DL, VT);
26308 if (CC == ISD::SETLE)
26309 return DAG.getConstant(1, DL, VT);
26310 if (CC == ISD::SETEQ || CC == ISD::SETGE)
26311 return DAG.getNOT(DL, LHS.getOperand(0), VT);
26313 assert((CC == ISD::SETNE || CC == ISD::SETLT) &&
26314 "Unexpected condition code!");
26315 return LHS.getOperand(0);
26322 static SDValue PerformBLENDICombine(SDNode *N, SelectionDAG &DAG) {
26323 SDValue V0 = N->getOperand(0);
26324 SDValue V1 = N->getOperand(1);
26326 EVT VT = N->getValueType(0);
26328 // Canonicalize a v2f64 blend with a mask of 2 by swapping the vector
26329 // operands and changing the mask to 1. This saves us a bunch of
26330 // pattern-matching possibilities related to scalar math ops in SSE/AVX.
26331 // x86InstrInfo knows how to commute this back after instruction selection
26332 // if it would help register allocation.
26334 // TODO: If optimizing for size or a processor that doesn't suffer from
26335 // partial register update stalls, this should be transformed into a MOVSD
26336 // instruction because a MOVSD is 1-2 bytes smaller than a BLENDPD.
26338 if (VT == MVT::v2f64)
26339 if (auto *Mask = dyn_cast<ConstantSDNode>(N->getOperand(2)))
26340 if (Mask->getZExtValue() == 2 && !isShuffleFoldableLoad(V0)) {
26341 SDValue NewMask = DAG.getConstant(1, DL, MVT::i8);
26342 return DAG.getNode(X86ISD::BLENDI, DL, VT, V1, V0, NewMask);
26348 // Helper function of PerformSETCCCombine. It is to materialize "setb reg"
26349 // as "sbb reg,reg", since it can be extended without zext and produces
26350 // an all-ones bit which is more useful than 0/1 in some cases.
26351 static SDValue MaterializeSETB(SDLoc DL, SDValue EFLAGS, SelectionDAG &DAG,
26354 return DAG.getNode(ISD::AND, DL, VT,
26355 DAG.getNode(X86ISD::SETCC_CARRY, DL, MVT::i8,
26356 DAG.getConstant(X86::COND_B, DL, MVT::i8),
26358 DAG.getConstant(1, DL, VT));
26359 assert (VT == MVT::i1 && "Unexpected type for SECCC node");
26360 return DAG.getNode(ISD::TRUNCATE, DL, MVT::i1,
26361 DAG.getNode(X86ISD::SETCC_CARRY, DL, MVT::i8,
26362 DAG.getConstant(X86::COND_B, DL, MVT::i8),
26366 // Optimize RES = X86ISD::SETCC CONDCODE, EFLAG_INPUT
26367 static SDValue PerformSETCCCombine(SDNode *N, SelectionDAG &DAG,
26368 TargetLowering::DAGCombinerInfo &DCI,
26369 const X86Subtarget *Subtarget) {
26371 X86::CondCode CC = X86::CondCode(N->getConstantOperandVal(0));
26372 SDValue EFLAGS = N->getOperand(1);
26374 if (CC == X86::COND_A) {
26375 // Try to convert COND_A into COND_B in an attempt to facilitate
26376 // materializing "setb reg".
26378 // Do not flip "e > c", where "c" is a constant, because Cmp instruction
26379 // cannot take an immediate as its first operand.
26381 if (EFLAGS.getOpcode() == X86ISD::SUB && EFLAGS.hasOneUse() &&
26382 EFLAGS.getValueType().isInteger() &&
26383 !isa<ConstantSDNode>(EFLAGS.getOperand(1))) {
26384 SDValue NewSub = DAG.getNode(X86ISD::SUB, SDLoc(EFLAGS),
26385 EFLAGS.getNode()->getVTList(),
26386 EFLAGS.getOperand(1), EFLAGS.getOperand(0));
26387 SDValue NewEFLAGS = SDValue(NewSub.getNode(), EFLAGS.getResNo());
26388 return MaterializeSETB(DL, NewEFLAGS, DAG, N->getSimpleValueType(0));
26392 // Materialize "setb reg" as "sbb reg,reg", since it can be extended without
26393 // a zext and produces an all-ones bit which is more useful than 0/1 in some
26395 if (CC == X86::COND_B)
26396 return MaterializeSETB(DL, EFLAGS, DAG, N->getSimpleValueType(0));
26398 if (SDValue Flags = checkBoolTestSetCCCombine(EFLAGS, CC)) {
26399 SDValue Cond = DAG.getConstant(CC, DL, MVT::i8);
26400 return DAG.getNode(X86ISD::SETCC, DL, N->getVTList(), Cond, Flags);
26406 // Optimize branch condition evaluation.
26408 static SDValue PerformBrCondCombine(SDNode *N, SelectionDAG &DAG,
26409 TargetLowering::DAGCombinerInfo &DCI,
26410 const X86Subtarget *Subtarget) {
26412 SDValue Chain = N->getOperand(0);
26413 SDValue Dest = N->getOperand(1);
26414 SDValue EFLAGS = N->getOperand(3);
26415 X86::CondCode CC = X86::CondCode(N->getConstantOperandVal(2));
26417 if (SDValue Flags = checkBoolTestSetCCCombine(EFLAGS, CC)) {
26418 SDValue Cond = DAG.getConstant(CC, DL, MVT::i8);
26419 return DAG.getNode(X86ISD::BRCOND, DL, N->getVTList(), Chain, Dest, Cond,
26426 static SDValue performVectorCompareAndMaskUnaryOpCombine(SDNode *N,
26427 SelectionDAG &DAG) {
26428 // Take advantage of vector comparisons producing 0 or -1 in each lane to
26429 // optimize away operation when it's from a constant.
26431 // The general transformation is:
26432 // UNARYOP(AND(VECTOR_CMP(x,y), constant)) -->
26433 // AND(VECTOR_CMP(x,y), constant2)
26434 // constant2 = UNARYOP(constant)
26436 // Early exit if this isn't a vector operation, the operand of the
26437 // unary operation isn't a bitwise AND, or if the sizes of the operations
26438 // aren't the same.
26439 EVT VT = N->getValueType(0);
26440 if (!VT.isVector() || N->getOperand(0)->getOpcode() != ISD::AND ||
26441 N->getOperand(0)->getOperand(0)->getOpcode() != ISD::SETCC ||
26442 VT.getSizeInBits() != N->getOperand(0)->getValueType(0).getSizeInBits())
26445 // Now check that the other operand of the AND is a constant. We could
26446 // make the transformation for non-constant splats as well, but it's unclear
26447 // that would be a benefit as it would not eliminate any operations, just
26448 // perform one more step in scalar code before moving to the vector unit.
26449 if (BuildVectorSDNode *BV =
26450 dyn_cast<BuildVectorSDNode>(N->getOperand(0)->getOperand(1))) {
26451 // Bail out if the vector isn't a constant.
26452 if (!BV->isConstant())
26455 // Everything checks out. Build up the new and improved node.
26457 EVT IntVT = BV->getValueType(0);
26458 // Create a new constant of the appropriate type for the transformed
26460 SDValue SourceConst = DAG.getNode(N->getOpcode(), DL, VT, SDValue(BV, 0));
26461 // The AND node needs bitcasts to/from an integer vector type around it.
26462 SDValue MaskConst = DAG.getBitcast(IntVT, SourceConst);
26463 SDValue NewAnd = DAG.getNode(ISD::AND, DL, IntVT,
26464 N->getOperand(0)->getOperand(0), MaskConst);
26465 SDValue Res = DAG.getBitcast(VT, NewAnd);
26472 static SDValue PerformUINT_TO_FPCombine(SDNode *N, SelectionDAG &DAG,
26473 const X86Subtarget *Subtarget) {
26474 SDValue Op0 = N->getOperand(0);
26475 EVT VT = N->getValueType(0);
26476 EVT InVT = Op0.getValueType();
26477 EVT InSVT = InVT.getScalarType();
26478 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
26480 // UINT_TO_FP(vXi8) -> SINT_TO_FP(ZEXT(vXi8 to vXi32))
26481 // UINT_TO_FP(vXi16) -> SINT_TO_FP(ZEXT(vXi16 to vXi32))
26482 if (InVT.isVector() && (InSVT == MVT::i8 || InSVT == MVT::i16)) {
26484 EVT DstVT = EVT::getVectorVT(*DAG.getContext(), MVT::i32,
26485 InVT.getVectorNumElements());
26486 SDValue P = DAG.getNode(ISD::ZERO_EXTEND, dl, DstVT, Op0);
26488 if (TLI.isOperationLegal(ISD::UINT_TO_FP, DstVT))
26489 return DAG.getNode(ISD::UINT_TO_FP, dl, VT, P);
26491 return DAG.getNode(ISD::SINT_TO_FP, dl, VT, P);
26497 static SDValue PerformSINT_TO_FPCombine(SDNode *N, SelectionDAG &DAG,
26498 const X86Subtarget *Subtarget) {
26499 // First try to optimize away the conversion entirely when it's
26500 // conditionally from a constant. Vectors only.
26501 if (SDValue Res = performVectorCompareAndMaskUnaryOpCombine(N, DAG))
26504 // Now move on to more general possibilities.
26505 SDValue Op0 = N->getOperand(0);
26506 EVT VT = N->getValueType(0);
26507 EVT InVT = Op0.getValueType();
26508 EVT InSVT = InVT.getScalarType();
26510 // SINT_TO_FP(vXi8) -> SINT_TO_FP(SEXT(vXi8 to vXi32))
26511 // SINT_TO_FP(vXi16) -> SINT_TO_FP(SEXT(vXi16 to vXi32))
26512 if (InVT.isVector() && (InSVT == MVT::i8 || InSVT == MVT::i16)) {
26514 EVT DstVT = EVT::getVectorVT(*DAG.getContext(), MVT::i32,
26515 InVT.getVectorNumElements());
26516 SDValue P = DAG.getNode(ISD::SIGN_EXTEND, dl, DstVT, Op0);
26517 return DAG.getNode(ISD::SINT_TO_FP, dl, VT, P);
26520 // Transform (SINT_TO_FP (i64 ...)) into an x87 operation if we have
26521 // a 32-bit target where SSE doesn't support i64->FP operations.
26522 if (!Subtarget->useSoftFloat() && Op0.getOpcode() == ISD::LOAD) {
26523 LoadSDNode *Ld = cast<LoadSDNode>(Op0.getNode());
26524 EVT LdVT = Ld->getValueType(0);
26526 // This transformation is not supported if the result type is f16
26527 if (VT == MVT::f16)
26530 if (!Ld->isVolatile() && !VT.isVector() &&
26531 ISD::isNON_EXTLoad(Op0.getNode()) && Op0.hasOneUse() &&
26532 !Subtarget->is64Bit() && LdVT == MVT::i64) {
26533 SDValue FILDChain = Subtarget->getTargetLowering()->BuildFILD(
26534 SDValue(N, 0), LdVT, Ld->getChain(), Op0, DAG);
26535 DAG.ReplaceAllUsesOfValueWith(Op0.getValue(1), FILDChain.getValue(1));
26542 // Optimize RES, EFLAGS = X86ISD::ADC LHS, RHS, EFLAGS
26543 static SDValue PerformADCCombine(SDNode *N, SelectionDAG &DAG,
26544 X86TargetLowering::DAGCombinerInfo &DCI) {
26545 // If the LHS and RHS of the ADC node are zero, then it can't overflow and
26546 // the result is either zero or one (depending on the input carry bit).
26547 // Strength reduce this down to a "set on carry" aka SETCC_CARRY&1.
26548 if (X86::isZeroNode(N->getOperand(0)) &&
26549 X86::isZeroNode(N->getOperand(1)) &&
26550 // We don't have a good way to replace an EFLAGS use, so only do this when
26552 SDValue(N, 1).use_empty()) {
26554 EVT VT = N->getValueType(0);
26555 SDValue CarryOut = DAG.getConstant(0, DL, N->getValueType(1));
26556 SDValue Res1 = DAG.getNode(ISD::AND, DL, VT,
26557 DAG.getNode(X86ISD::SETCC_CARRY, DL, VT,
26558 DAG.getConstant(X86::COND_B, DL,
26561 DAG.getConstant(1, DL, VT));
26562 return DCI.CombineTo(N, Res1, CarryOut);
26568 // fold (add Y, (sete X, 0)) -> adc 0, Y
26569 // (add Y, (setne X, 0)) -> sbb -1, Y
26570 // (sub (sete X, 0), Y) -> sbb 0, Y
26571 // (sub (setne X, 0), Y) -> adc -1, Y
26572 static SDValue OptimizeConditionalInDecrement(SDNode *N, SelectionDAG &DAG) {
26575 // Look through ZExts.
26576 SDValue Ext = N->getOperand(N->getOpcode() == ISD::SUB ? 1 : 0);
26577 if (Ext.getOpcode() != ISD::ZERO_EXTEND || !Ext.hasOneUse())
26580 SDValue SetCC = Ext.getOperand(0);
26581 if (SetCC.getOpcode() != X86ISD::SETCC || !SetCC.hasOneUse())
26584 X86::CondCode CC = (X86::CondCode)SetCC.getConstantOperandVal(0);
26585 if (CC != X86::COND_E && CC != X86::COND_NE)
26588 SDValue Cmp = SetCC.getOperand(1);
26589 if (Cmp.getOpcode() != X86ISD::CMP || !Cmp.hasOneUse() ||
26590 !X86::isZeroNode(Cmp.getOperand(1)) ||
26591 !Cmp.getOperand(0).getValueType().isInteger())
26594 SDValue CmpOp0 = Cmp.getOperand(0);
26595 SDValue NewCmp = DAG.getNode(X86ISD::CMP, DL, MVT::i32, CmpOp0,
26596 DAG.getConstant(1, DL, CmpOp0.getValueType()));
26598 SDValue OtherVal = N->getOperand(N->getOpcode() == ISD::SUB ? 0 : 1);
26599 if (CC == X86::COND_NE)
26600 return DAG.getNode(N->getOpcode() == ISD::SUB ? X86ISD::ADC : X86ISD::SBB,
26601 DL, OtherVal.getValueType(), OtherVal,
26602 DAG.getConstant(-1ULL, DL, OtherVal.getValueType()),
26604 return DAG.getNode(N->getOpcode() == ISD::SUB ? X86ISD::SBB : X86ISD::ADC,
26605 DL, OtherVal.getValueType(), OtherVal,
26606 DAG.getConstant(0, DL, OtherVal.getValueType()), NewCmp);
26609 /// PerformADDCombine - Do target-specific dag combines on integer adds.
26610 static SDValue PerformAddCombine(SDNode *N, SelectionDAG &DAG,
26611 const X86Subtarget *Subtarget) {
26612 EVT VT = N->getValueType(0);
26613 SDValue Op0 = N->getOperand(0);
26614 SDValue Op1 = N->getOperand(1);
26616 // Try to synthesize horizontal adds from adds of shuffles.
26617 if (((Subtarget->hasSSSE3() && (VT == MVT::v8i16 || VT == MVT::v4i32)) ||
26618 (Subtarget->hasInt256() && (VT == MVT::v16i16 || VT == MVT::v8i32))) &&
26619 isHorizontalBinOp(Op0, Op1, true))
26620 return DAG.getNode(X86ISD::HADD, SDLoc(N), VT, Op0, Op1);
26622 return OptimizeConditionalInDecrement(N, DAG);
26625 static SDValue PerformSubCombine(SDNode *N, SelectionDAG &DAG,
26626 const X86Subtarget *Subtarget) {
26627 SDValue Op0 = N->getOperand(0);
26628 SDValue Op1 = N->getOperand(1);
26630 // X86 can't encode an immediate LHS of a sub. See if we can push the
26631 // negation into a preceding instruction.
26632 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op0)) {
26633 // If the RHS of the sub is a XOR with one use and a constant, invert the
26634 // immediate. Then add one to the LHS of the sub so we can turn
26635 // X-Y -> X+~Y+1, saving one register.
26636 if (Op1->hasOneUse() && Op1.getOpcode() == ISD::XOR &&
26637 isa<ConstantSDNode>(Op1.getOperand(1))) {
26638 APInt XorC = cast<ConstantSDNode>(Op1.getOperand(1))->getAPIntValue();
26639 EVT VT = Op0.getValueType();
26640 SDValue NewXor = DAG.getNode(ISD::XOR, SDLoc(Op1), VT,
26642 DAG.getConstant(~XorC, SDLoc(Op1), VT));
26643 return DAG.getNode(ISD::ADD, SDLoc(N), VT, NewXor,
26644 DAG.getConstant(C->getAPIntValue() + 1, SDLoc(N), VT));
26648 // Try to synthesize horizontal adds from adds of shuffles.
26649 EVT VT = N->getValueType(0);
26650 if (((Subtarget->hasSSSE3() && (VT == MVT::v8i16 || VT == MVT::v4i32)) ||
26651 (Subtarget->hasInt256() && (VT == MVT::v16i16 || VT == MVT::v8i32))) &&
26652 isHorizontalBinOp(Op0, Op1, true))
26653 return DAG.getNode(X86ISD::HSUB, SDLoc(N), VT, Op0, Op1);
26655 return OptimizeConditionalInDecrement(N, DAG);
26658 /// performVZEXTCombine - Performs build vector combines
26659 static SDValue performVZEXTCombine(SDNode *N, SelectionDAG &DAG,
26660 TargetLowering::DAGCombinerInfo &DCI,
26661 const X86Subtarget *Subtarget) {
26663 MVT VT = N->getSimpleValueType(0);
26664 SDValue Op = N->getOperand(0);
26665 MVT OpVT = Op.getSimpleValueType();
26666 MVT OpEltVT = OpVT.getVectorElementType();
26667 unsigned InputBits = OpEltVT.getSizeInBits() * VT.getVectorNumElements();
26669 // (vzext (bitcast (vzext (x)) -> (vzext x)
26671 while (V.getOpcode() == ISD::BITCAST)
26672 V = V.getOperand(0);
26674 if (V != Op && V.getOpcode() == X86ISD::VZEXT) {
26675 MVT InnerVT = V.getSimpleValueType();
26676 MVT InnerEltVT = InnerVT.getVectorElementType();
26678 // If the element sizes match exactly, we can just do one larger vzext. This
26679 // is always an exact type match as vzext operates on integer types.
26680 if (OpEltVT == InnerEltVT) {
26681 assert(OpVT == InnerVT && "Types must match for vzext!");
26682 return DAG.getNode(X86ISD::VZEXT, DL, VT, V.getOperand(0));
26685 // The only other way we can combine them is if only a single element of the
26686 // inner vzext is used in the input to the outer vzext.
26687 if (InnerEltVT.getSizeInBits() < InputBits)
26690 // In this case, the inner vzext is completely dead because we're going to
26691 // only look at bits inside of the low element. Just do the outer vzext on
26692 // a bitcast of the input to the inner.
26693 return DAG.getNode(X86ISD::VZEXT, DL, VT, DAG.getBitcast(OpVT, V));
26696 // Check if we can bypass extracting and re-inserting an element of an input
26697 // vector. Essentially:
26698 // (bitcast (sclr2vec (ext_vec_elt x))) -> (bitcast x)
26699 if (V.getOpcode() == ISD::SCALAR_TO_VECTOR &&
26700 V.getOperand(0).getOpcode() == ISD::EXTRACT_VECTOR_ELT &&
26701 V.getOperand(0).getSimpleValueType().getSizeInBits() == InputBits) {
26702 SDValue ExtractedV = V.getOperand(0);
26703 SDValue OrigV = ExtractedV.getOperand(0);
26704 if (auto *ExtractIdx = dyn_cast<ConstantSDNode>(ExtractedV.getOperand(1)))
26705 if (ExtractIdx->getZExtValue() == 0) {
26706 MVT OrigVT = OrigV.getSimpleValueType();
26707 // Extract a subvector if necessary...
26708 if (OrigVT.getSizeInBits() > OpVT.getSizeInBits()) {
26709 int Ratio = OrigVT.getSizeInBits() / OpVT.getSizeInBits();
26710 OrigVT = MVT::getVectorVT(OrigVT.getVectorElementType(),
26711 OrigVT.getVectorNumElements() / Ratio);
26712 OrigV = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, OrigVT, OrigV,
26713 DAG.getIntPtrConstant(0, DL));
26715 Op = DAG.getBitcast(OpVT, OrigV);
26716 return DAG.getNode(X86ISD::VZEXT, DL, VT, Op);
26723 SDValue X86TargetLowering::PerformDAGCombine(SDNode *N,
26724 DAGCombinerInfo &DCI) const {
26725 SelectionDAG &DAG = DCI.DAG;
26726 switch (N->getOpcode()) {
26728 case ISD::EXTRACT_VECTOR_ELT:
26729 return PerformEXTRACT_VECTOR_ELTCombine(N, DAG, DCI);
26732 case X86ISD::SHRUNKBLEND:
26733 return PerformSELECTCombine(N, DAG, DCI, Subtarget);
26734 case ISD::BITCAST: return PerformBITCASTCombine(N, DAG, Subtarget);
26735 case X86ISD::CMOV: return PerformCMOVCombine(N, DAG, DCI, Subtarget);
26736 case ISD::ADD: return PerformAddCombine(N, DAG, Subtarget);
26737 case ISD::SUB: return PerformSubCombine(N, DAG, Subtarget);
26738 case X86ISD::ADC: return PerformADCCombine(N, DAG, DCI);
26739 case ISD::MUL: return PerformMulCombine(N, DAG, DCI);
26742 case ISD::SRL: return PerformShiftCombine(N, DAG, DCI, Subtarget);
26743 case ISD::AND: return PerformAndCombine(N, DAG, DCI, Subtarget);
26744 case ISD::OR: return PerformOrCombine(N, DAG, DCI, Subtarget);
26745 case ISD::XOR: return PerformXorCombine(N, DAG, DCI, Subtarget);
26746 case ISD::LOAD: return PerformLOADCombine(N, DAG, DCI, Subtarget);
26747 case ISD::MLOAD: return PerformMLOADCombine(N, DAG, DCI, Subtarget);
26748 case ISD::STORE: return PerformSTORECombine(N, DAG, Subtarget);
26749 case ISD::MSTORE: return PerformMSTORECombine(N, DAG, Subtarget);
26750 case ISD::SINT_TO_FP: return PerformSINT_TO_FPCombine(N, DAG, Subtarget);
26751 case ISD::UINT_TO_FP: return PerformUINT_TO_FPCombine(N, DAG, Subtarget);
26752 case ISD::FADD: return PerformFADDCombine(N, DAG, Subtarget);
26753 case ISD::FSUB: return PerformFSUBCombine(N, DAG, Subtarget);
26755 case X86ISD::FOR: return PerformFORCombine(N, DAG, Subtarget);
26757 case X86ISD::FMAX: return PerformFMinFMaxCombine(N, DAG);
26758 case X86ISD::FAND: return PerformFANDCombine(N, DAG);
26759 case X86ISD::FANDN: return PerformFANDNCombine(N, DAG);
26760 case X86ISD::BT: return PerformBTCombine(N, DAG, DCI);
26761 case X86ISD::VZEXT_MOVL: return PerformVZEXT_MOVLCombine(N, DAG);
26762 case ISD::ANY_EXTEND:
26763 case ISD::ZERO_EXTEND: return PerformZExtCombine(N, DAG, DCI, Subtarget);
26764 case ISD::SIGN_EXTEND: return PerformSExtCombine(N, DAG, DCI, Subtarget);
26765 case ISD::SIGN_EXTEND_INREG:
26766 return PerformSIGN_EXTEND_INREGCombine(N, DAG, Subtarget);
26767 case ISD::SETCC: return PerformISDSETCCCombine(N, DAG, Subtarget);
26768 case X86ISD::SETCC: return PerformSETCCCombine(N, DAG, DCI, Subtarget);
26769 case X86ISD::BRCOND: return PerformBrCondCombine(N, DAG, DCI, Subtarget);
26770 case X86ISD::VZEXT: return performVZEXTCombine(N, DAG, DCI, Subtarget);
26771 case X86ISD::SHUFP: // Handle all target specific shuffles
26772 case X86ISD::PALIGNR:
26773 case X86ISD::UNPCKH:
26774 case X86ISD::UNPCKL:
26775 case X86ISD::MOVHLPS:
26776 case X86ISD::MOVLHPS:
26777 case X86ISD::PSHUFB:
26778 case X86ISD::PSHUFD:
26779 case X86ISD::PSHUFHW:
26780 case X86ISD::PSHUFLW:
26781 case X86ISD::MOVSS:
26782 case X86ISD::MOVSD:
26783 case X86ISD::VPERMILPI:
26784 case X86ISD::VPERM2X128:
26785 case ISD::VECTOR_SHUFFLE: return PerformShuffleCombine(N, DAG, DCI,Subtarget);
26786 case ISD::FMA: return PerformFMACombine(N, DAG, Subtarget);
26787 case X86ISD::BLENDI: return PerformBLENDICombine(N, DAG);
26793 /// isTypeDesirableForOp - Return true if the target has native support for
26794 /// the specified value type and it is 'desirable' to use the type for the
26795 /// given node type. e.g. On x86 i16 is legal, but undesirable since i16
26796 /// instruction encodings are longer and some i16 instructions are slow.
26797 bool X86TargetLowering::isTypeDesirableForOp(unsigned Opc, EVT VT) const {
26798 if (!isTypeLegal(VT))
26800 if (VT != MVT::i16)
26807 case ISD::SIGN_EXTEND:
26808 case ISD::ZERO_EXTEND:
26809 case ISD::ANY_EXTEND:
26822 /// IsDesirableToPromoteOp - This method query the target whether it is
26823 /// beneficial for dag combiner to promote the specified node. If true, it
26824 /// should return the desired promotion type by reference.
26825 bool X86TargetLowering::IsDesirableToPromoteOp(SDValue Op, EVT &PVT) const {
26826 EVT VT = Op.getValueType();
26827 if (VT != MVT::i16)
26830 bool Promote = false;
26831 bool Commute = false;
26832 switch (Op.getOpcode()) {
26835 LoadSDNode *LD = cast<LoadSDNode>(Op);
26836 // If the non-extending load has a single use and it's not live out, then it
26837 // might be folded.
26838 if (LD->getExtensionType() == ISD::NON_EXTLOAD /*&&
26839 Op.hasOneUse()*/) {
26840 for (SDNode::use_iterator UI = Op.getNode()->use_begin(),
26841 UE = Op.getNode()->use_end(); UI != UE; ++UI) {
26842 // The only case where we'd want to promote LOAD (rather then it being
26843 // promoted as an operand is when it's only use is liveout.
26844 if (UI->getOpcode() != ISD::CopyToReg)
26851 case ISD::SIGN_EXTEND:
26852 case ISD::ZERO_EXTEND:
26853 case ISD::ANY_EXTEND:
26858 SDValue N0 = Op.getOperand(0);
26859 // Look out for (store (shl (load), x)).
26860 if (MayFoldLoad(N0) && MayFoldIntoStore(Op))
26873 SDValue N0 = Op.getOperand(0);
26874 SDValue N1 = Op.getOperand(1);
26875 if (!Commute && MayFoldLoad(N1))
26877 // Avoid disabling potential load folding opportunities.
26878 if (MayFoldLoad(N0) && (!isa<ConstantSDNode>(N1) || MayFoldIntoStore(Op)))
26880 if (MayFoldLoad(N1) && (!isa<ConstantSDNode>(N0) || MayFoldIntoStore(Op)))
26890 //===----------------------------------------------------------------------===//
26891 // X86 Inline Assembly Support
26892 //===----------------------------------------------------------------------===//
26894 // Helper to match a string separated by whitespace.
26895 static bool matchAsm(StringRef S, ArrayRef<const char *> Pieces) {
26896 S = S.substr(S.find_first_not_of(" \t")); // Skip leading whitespace.
26898 for (StringRef Piece : Pieces) {
26899 if (!S.startswith(Piece)) // Check if the piece matches.
26902 S = S.substr(Piece.size());
26903 StringRef::size_type Pos = S.find_first_not_of(" \t");
26904 if (Pos == 0) // We matched a prefix.
26913 static bool clobbersFlagRegisters(const SmallVector<StringRef, 4> &AsmPieces) {
26915 if (AsmPieces.size() == 3 || AsmPieces.size() == 4) {
26916 if (std::count(AsmPieces.begin(), AsmPieces.end(), "~{cc}") &&
26917 std::count(AsmPieces.begin(), AsmPieces.end(), "~{flags}") &&
26918 std::count(AsmPieces.begin(), AsmPieces.end(), "~{fpsr}")) {
26920 if (AsmPieces.size() == 3)
26922 else if (std::count(AsmPieces.begin(), AsmPieces.end(), "~{dirflag}"))
26929 bool X86TargetLowering::ExpandInlineAsm(CallInst *CI) const {
26930 InlineAsm *IA = cast<InlineAsm>(CI->getCalledValue());
26932 std::string AsmStr = IA->getAsmString();
26934 IntegerType *Ty = dyn_cast<IntegerType>(CI->getType());
26935 if (!Ty || Ty->getBitWidth() % 16 != 0)
26938 // TODO: should remove alternatives from the asmstring: "foo {a|b}" -> "foo a"
26939 SmallVector<StringRef, 4> AsmPieces;
26940 SplitString(AsmStr, AsmPieces, ";\n");
26942 switch (AsmPieces.size()) {
26943 default: return false;
26945 // FIXME: this should verify that we are targeting a 486 or better. If not,
26946 // we will turn this bswap into something that will be lowered to logical
26947 // ops instead of emitting the bswap asm. For now, we don't support 486 or
26948 // lower so don't worry about this.
26950 if (matchAsm(AsmPieces[0], {"bswap", "$0"}) ||
26951 matchAsm(AsmPieces[0], {"bswapl", "$0"}) ||
26952 matchAsm(AsmPieces[0], {"bswapq", "$0"}) ||
26953 matchAsm(AsmPieces[0], {"bswap", "${0:q}"}) ||
26954 matchAsm(AsmPieces[0], {"bswapl", "${0:q}"}) ||
26955 matchAsm(AsmPieces[0], {"bswapq", "${0:q}"})) {
26956 // No need to check constraints, nothing other than the equivalent of
26957 // "=r,0" would be valid here.
26958 return IntrinsicLowering::LowerToByteSwap(CI);
26961 // rorw $$8, ${0:w} --> llvm.bswap.i16
26962 if (CI->getType()->isIntegerTy(16) &&
26963 IA->getConstraintString().compare(0, 5, "=r,0,") == 0 &&
26964 (matchAsm(AsmPieces[0], {"rorw", "$$8,", "${0:w}"}) ||
26965 matchAsm(AsmPieces[0], {"rolw", "$$8,", "${0:w}"}))) {
26967 StringRef ConstraintsStr = IA->getConstraintString();
26968 SplitString(StringRef(ConstraintsStr).substr(5), AsmPieces, ",");
26969 array_pod_sort(AsmPieces.begin(), AsmPieces.end());
26970 if (clobbersFlagRegisters(AsmPieces))
26971 return IntrinsicLowering::LowerToByteSwap(CI);
26975 if (CI->getType()->isIntegerTy(32) &&
26976 IA->getConstraintString().compare(0, 5, "=r,0,") == 0 &&
26977 matchAsm(AsmPieces[0], {"rorw", "$$8,", "${0:w}"}) &&
26978 matchAsm(AsmPieces[1], {"rorl", "$$16,", "$0"}) &&
26979 matchAsm(AsmPieces[2], {"rorw", "$$8,", "${0:w}"})) {
26981 StringRef ConstraintsStr = IA->getConstraintString();
26982 SplitString(StringRef(ConstraintsStr).substr(5), AsmPieces, ",");
26983 array_pod_sort(AsmPieces.begin(), AsmPieces.end());
26984 if (clobbersFlagRegisters(AsmPieces))
26985 return IntrinsicLowering::LowerToByteSwap(CI);
26988 if (CI->getType()->isIntegerTy(64)) {
26989 InlineAsm::ConstraintInfoVector Constraints = IA->ParseConstraints();
26990 if (Constraints.size() >= 2 &&
26991 Constraints[0].Codes.size() == 1 && Constraints[0].Codes[0] == "A" &&
26992 Constraints[1].Codes.size() == 1 && Constraints[1].Codes[0] == "0") {
26993 // bswap %eax / bswap %edx / xchgl %eax, %edx -> llvm.bswap.i64
26994 if (matchAsm(AsmPieces[0], {"bswap", "%eax"}) &&
26995 matchAsm(AsmPieces[1], {"bswap", "%edx"}) &&
26996 matchAsm(AsmPieces[2], {"xchgl", "%eax,", "%edx"}))
26997 return IntrinsicLowering::LowerToByteSwap(CI);
27005 /// getConstraintType - Given a constraint letter, return the type of
27006 /// constraint it is for this target.
27007 X86TargetLowering::ConstraintType
27008 X86TargetLowering::getConstraintType(StringRef Constraint) const {
27009 if (Constraint.size() == 1) {
27010 switch (Constraint[0]) {
27021 return C_RegisterClass;
27045 return TargetLowering::getConstraintType(Constraint);
27048 /// Examine constraint type and operand type and determine a weight value.
27049 /// This object must already have been set up with the operand type
27050 /// and the current alternative constraint selected.
27051 TargetLowering::ConstraintWeight
27052 X86TargetLowering::getSingleConstraintMatchWeight(
27053 AsmOperandInfo &info, const char *constraint) const {
27054 ConstraintWeight weight = CW_Invalid;
27055 Value *CallOperandVal = info.CallOperandVal;
27056 // If we don't have a value, we can't do a match,
27057 // but allow it at the lowest weight.
27058 if (!CallOperandVal)
27060 Type *type = CallOperandVal->getType();
27061 // Look at the constraint type.
27062 switch (*constraint) {
27064 weight = TargetLowering::getSingleConstraintMatchWeight(info, constraint);
27075 if (CallOperandVal->getType()->isIntegerTy())
27076 weight = CW_SpecificReg;
27081 if (type->isFloatingPointTy())
27082 weight = CW_SpecificReg;
27085 if (type->isX86_MMXTy() && Subtarget->hasMMX())
27086 weight = CW_SpecificReg;
27090 if (((type->getPrimitiveSizeInBits() == 128) && Subtarget->hasSSE1()) ||
27091 ((type->getPrimitiveSizeInBits() == 256) && Subtarget->hasFp256()))
27092 weight = CW_Register;
27095 if (ConstantInt *C = dyn_cast<ConstantInt>(info.CallOperandVal)) {
27096 if (C->getZExtValue() <= 31)
27097 weight = CW_Constant;
27101 if (ConstantInt *C = dyn_cast<ConstantInt>(CallOperandVal)) {
27102 if (C->getZExtValue() <= 63)
27103 weight = CW_Constant;
27107 if (ConstantInt *C = dyn_cast<ConstantInt>(CallOperandVal)) {
27108 if ((C->getSExtValue() >= -0x80) && (C->getSExtValue() <= 0x7f))
27109 weight = CW_Constant;
27113 if (ConstantInt *C = dyn_cast<ConstantInt>(CallOperandVal)) {
27114 if ((C->getZExtValue() == 0xff) || (C->getZExtValue() == 0xffff))
27115 weight = CW_Constant;
27119 if (ConstantInt *C = dyn_cast<ConstantInt>(CallOperandVal)) {
27120 if (C->getZExtValue() <= 3)
27121 weight = CW_Constant;
27125 if (ConstantInt *C = dyn_cast<ConstantInt>(CallOperandVal)) {
27126 if (C->getZExtValue() <= 0xff)
27127 weight = CW_Constant;
27132 if (isa<ConstantFP>(CallOperandVal)) {
27133 weight = CW_Constant;
27137 if (ConstantInt *C = dyn_cast<ConstantInt>(CallOperandVal)) {
27138 if ((C->getSExtValue() >= -0x80000000LL) &&
27139 (C->getSExtValue() <= 0x7fffffffLL))
27140 weight = CW_Constant;
27144 if (ConstantInt *C = dyn_cast<ConstantInt>(CallOperandVal)) {
27145 if (C->getZExtValue() <= 0xffffffff)
27146 weight = CW_Constant;
27153 /// LowerXConstraint - try to replace an X constraint, which matches anything,
27154 /// with another that has more specific requirements based on the type of the
27155 /// corresponding operand.
27156 const char *X86TargetLowering::
27157 LowerXConstraint(EVT ConstraintVT) const {
27158 // FP X constraints get lowered to SSE1/2 registers if available, otherwise
27159 // 'f' like normal targets.
27160 if (ConstraintVT.isFloatingPoint()) {
27161 if (Subtarget->hasSSE2())
27163 if (Subtarget->hasSSE1())
27167 return TargetLowering::LowerXConstraint(ConstraintVT);
27170 /// LowerAsmOperandForConstraint - Lower the specified operand into the Ops
27171 /// vector. If it is invalid, don't add anything to Ops.
27172 void X86TargetLowering::LowerAsmOperandForConstraint(SDValue Op,
27173 std::string &Constraint,
27174 std::vector<SDValue>&Ops,
27175 SelectionDAG &DAG) const {
27178 // Only support length 1 constraints for now.
27179 if (Constraint.length() > 1) return;
27181 char ConstraintLetter = Constraint[0];
27182 switch (ConstraintLetter) {
27185 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op)) {
27186 if (C->getZExtValue() <= 31) {
27187 Result = DAG.getTargetConstant(C->getZExtValue(), SDLoc(Op),
27188 Op.getValueType());
27194 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op)) {
27195 if (C->getZExtValue() <= 63) {
27196 Result = DAG.getTargetConstant(C->getZExtValue(), SDLoc(Op),
27197 Op.getValueType());
27203 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op)) {
27204 if (isInt<8>(C->getSExtValue())) {
27205 Result = DAG.getTargetConstant(C->getZExtValue(), SDLoc(Op),
27206 Op.getValueType());
27212 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op)) {
27213 if (C->getZExtValue() == 0xff || C->getZExtValue() == 0xffff ||
27214 (Subtarget->is64Bit() && C->getZExtValue() == 0xffffffff)) {
27215 Result = DAG.getTargetConstant(C->getSExtValue(), SDLoc(Op),
27216 Op.getValueType());
27222 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op)) {
27223 if (C->getZExtValue() <= 3) {
27224 Result = DAG.getTargetConstant(C->getZExtValue(), SDLoc(Op),
27225 Op.getValueType());
27231 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op)) {
27232 if (C->getZExtValue() <= 255) {
27233 Result = DAG.getTargetConstant(C->getZExtValue(), SDLoc(Op),
27234 Op.getValueType());
27240 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op)) {
27241 if (C->getZExtValue() <= 127) {
27242 Result = DAG.getTargetConstant(C->getZExtValue(), SDLoc(Op),
27243 Op.getValueType());
27249 // 32-bit signed value
27250 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op)) {
27251 if (ConstantInt::isValueValidForType(Type::getInt32Ty(*DAG.getContext()),
27252 C->getSExtValue())) {
27253 // Widen to 64 bits here to get it sign extended.
27254 Result = DAG.getTargetConstant(C->getSExtValue(), SDLoc(Op), MVT::i64);
27257 // FIXME gcc accepts some relocatable values here too, but only in certain
27258 // memory models; it's complicated.
27263 // 32-bit unsigned value
27264 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op)) {
27265 if (ConstantInt::isValueValidForType(Type::getInt32Ty(*DAG.getContext()),
27266 C->getZExtValue())) {
27267 Result = DAG.getTargetConstant(C->getZExtValue(), SDLoc(Op),
27268 Op.getValueType());
27272 // FIXME gcc accepts some relocatable values here too, but only in certain
27273 // memory models; it's complicated.
27277 // Literal immediates are always ok.
27278 if (ConstantSDNode *CST = dyn_cast<ConstantSDNode>(Op)) {
27279 // Widen to 64 bits here to get it sign extended.
27280 Result = DAG.getTargetConstant(CST->getSExtValue(), SDLoc(Op), MVT::i64);
27284 // In any sort of PIC mode addresses need to be computed at runtime by
27285 // adding in a register or some sort of table lookup. These can't
27286 // be used as immediates.
27287 if (Subtarget->isPICStyleGOT() || Subtarget->isPICStyleStubPIC())
27290 // If we are in non-pic codegen mode, we allow the address of a global (with
27291 // an optional displacement) to be used with 'i'.
27292 GlobalAddressSDNode *GA = nullptr;
27293 int64_t Offset = 0;
27295 // Match either (GA), (GA+C), (GA+C1+C2), etc.
27297 if ((GA = dyn_cast<GlobalAddressSDNode>(Op))) {
27298 Offset += GA->getOffset();
27300 } else if (Op.getOpcode() == ISD::ADD) {
27301 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op.getOperand(1))) {
27302 Offset += C->getZExtValue();
27303 Op = Op.getOperand(0);
27306 } else if (Op.getOpcode() == ISD::SUB) {
27307 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op.getOperand(1))) {
27308 Offset += -C->getZExtValue();
27309 Op = Op.getOperand(0);
27314 // Otherwise, this isn't something we can handle, reject it.
27318 const GlobalValue *GV = GA->getGlobal();
27319 // If we require an extra load to get this address, as in PIC mode, we
27320 // can't accept it.
27321 if (isGlobalStubReference(
27322 Subtarget->ClassifyGlobalReference(GV, DAG.getTarget())))
27325 Result = DAG.getTargetGlobalAddress(GV, SDLoc(Op),
27326 GA->getValueType(0), Offset);
27331 if (Result.getNode()) {
27332 Ops.push_back(Result);
27335 return TargetLowering::LowerAsmOperandForConstraint(Op, Constraint, Ops, DAG);
27338 std::pair<unsigned, const TargetRegisterClass *>
27339 X86TargetLowering::getRegForInlineAsmConstraint(const TargetRegisterInfo *TRI,
27340 StringRef Constraint,
27342 // First, see if this is a constraint that directly corresponds to an LLVM
27344 if (Constraint.size() == 1) {
27345 // GCC Constraint Letters
27346 switch (Constraint[0]) {
27348 // TODO: Slight differences here in allocation order and leaving
27349 // RIP in the class. Do they matter any more here than they do
27350 // in the normal allocation?
27351 case 'q': // GENERAL_REGS in 64-bit mode, Q_REGS in 32-bit mode.
27352 if (Subtarget->is64Bit()) {
27353 if (VT == MVT::i32 || VT == MVT::f32)
27354 return std::make_pair(0U, &X86::GR32RegClass);
27355 if (VT == MVT::i16)
27356 return std::make_pair(0U, &X86::GR16RegClass);
27357 if (VT == MVT::i8 || VT == MVT::i1)
27358 return std::make_pair(0U, &X86::GR8RegClass);
27359 if (VT == MVT::i64 || VT == MVT::f64)
27360 return std::make_pair(0U, &X86::GR64RegClass);
27363 // 32-bit fallthrough
27364 case 'Q': // Q_REGS
27365 if (VT == MVT::i32 || VT == MVT::f32)
27366 return std::make_pair(0U, &X86::GR32_ABCDRegClass);
27367 if (VT == MVT::i16)
27368 return std::make_pair(0U, &X86::GR16_ABCDRegClass);
27369 if (VT == MVT::i8 || VT == MVT::i1)
27370 return std::make_pair(0U, &X86::GR8_ABCD_LRegClass);
27371 if (VT == MVT::i64)
27372 return std::make_pair(0U, &X86::GR64_ABCDRegClass);
27374 case 'r': // GENERAL_REGS
27375 case 'l': // INDEX_REGS
27376 if (VT == MVT::i8 || VT == MVT::i1)
27377 return std::make_pair(0U, &X86::GR8RegClass);
27378 if (VT == MVT::i16)
27379 return std::make_pair(0U, &X86::GR16RegClass);
27380 if (VT == MVT::i32 || VT == MVT::f32 || !Subtarget->is64Bit())
27381 return std::make_pair(0U, &X86::GR32RegClass);
27382 return std::make_pair(0U, &X86::GR64RegClass);
27383 case 'R': // LEGACY_REGS
27384 if (VT == MVT::i8 || VT == MVT::i1)
27385 return std::make_pair(0U, &X86::GR8_NOREXRegClass);
27386 if (VT == MVT::i16)
27387 return std::make_pair(0U, &X86::GR16_NOREXRegClass);
27388 if (VT == MVT::i32 || !Subtarget->is64Bit())
27389 return std::make_pair(0U, &X86::GR32_NOREXRegClass);
27390 return std::make_pair(0U, &X86::GR64_NOREXRegClass);
27391 case 'f': // FP Stack registers.
27392 // If SSE is enabled for this VT, use f80 to ensure the isel moves the
27393 // value to the correct fpstack register class.
27394 if (VT == MVT::f32 && !isScalarFPTypeInSSEReg(VT))
27395 return std::make_pair(0U, &X86::RFP32RegClass);
27396 if (VT == MVT::f64 && !isScalarFPTypeInSSEReg(VT))
27397 return std::make_pair(0U, &X86::RFP64RegClass);
27398 return std::make_pair(0U, &X86::RFP80RegClass);
27399 case 'y': // MMX_REGS if MMX allowed.
27400 if (!Subtarget->hasMMX()) break;
27401 return std::make_pair(0U, &X86::VR64RegClass);
27402 case 'Y': // SSE_REGS if SSE2 allowed
27403 if (!Subtarget->hasSSE2()) break;
27405 case 'x': // SSE_REGS if SSE1 allowed or AVX_REGS if AVX allowed
27406 if (!Subtarget->hasSSE1()) break;
27408 switch (VT.SimpleTy) {
27410 // Scalar SSE types.
27413 return std::make_pair(0U, &X86::FR32RegClass);
27416 return std::make_pair(0U, &X86::FR64RegClass);
27424 return std::make_pair(0U, &X86::VR128RegClass);
27432 return std::make_pair(0U, &X86::VR256RegClass);
27437 return std::make_pair(0U, &X86::VR512RegClass);
27443 // Use the default implementation in TargetLowering to convert the register
27444 // constraint into a member of a register class.
27445 std::pair<unsigned, const TargetRegisterClass*> Res;
27446 Res = TargetLowering::getRegForInlineAsmConstraint(TRI, Constraint, VT);
27448 // Not found as a standard register?
27450 // Map st(0) -> st(7) -> ST0
27451 if (Constraint.size() == 7 && Constraint[0] == '{' &&
27452 tolower(Constraint[1]) == 's' &&
27453 tolower(Constraint[2]) == 't' &&
27454 Constraint[3] == '(' &&
27455 (Constraint[4] >= '0' && Constraint[4] <= '7') &&
27456 Constraint[5] == ')' &&
27457 Constraint[6] == '}') {
27459 Res.first = X86::FP0+Constraint[4]-'0';
27460 Res.second = &X86::RFP80RegClass;
27464 // GCC allows "st(0)" to be called just plain "st".
27465 if (StringRef("{st}").equals_lower(Constraint)) {
27466 Res.first = X86::FP0;
27467 Res.second = &X86::RFP80RegClass;
27472 if (StringRef("{flags}").equals_lower(Constraint)) {
27473 Res.first = X86::EFLAGS;
27474 Res.second = &X86::CCRRegClass;
27478 // 'A' means EAX + EDX.
27479 if (Constraint == "A") {
27480 Res.first = X86::EAX;
27481 Res.second = &X86::GR32_ADRegClass;
27487 // Otherwise, check to see if this is a register class of the wrong value
27488 // type. For example, we want to map "{ax},i32" -> {eax}, we don't want it to
27489 // turn into {ax},{dx}.
27490 // MVT::Other is used to specify clobber names.
27491 if (Res.second->hasType(VT) || VT == MVT::Other)
27492 return Res; // Correct type already, nothing to do.
27494 // Get a matching integer of the correct size. i.e. "ax" with MVT::32 should
27495 // return "eax". This should even work for things like getting 64bit integer
27496 // registers when given an f64 type.
27497 const TargetRegisterClass *Class = Res.second;
27498 if (Class == &X86::GR8RegClass || Class == &X86::GR16RegClass ||
27499 Class == &X86::GR32RegClass || Class == &X86::GR64RegClass) {
27500 unsigned Size = VT.getSizeInBits();
27501 MVT::SimpleValueType SimpleTy = Size == 1 || Size == 8 ? MVT::i8
27502 : Size == 16 ? MVT::i16
27503 : Size == 32 ? MVT::i32
27504 : Size == 64 ? MVT::i64
27506 unsigned DestReg = getX86SubSuperRegisterOrZero(Res.first, SimpleTy);
27508 Res.first = DestReg;
27509 Res.second = SimpleTy == MVT::i8 ? &X86::GR8RegClass
27510 : SimpleTy == MVT::i16 ? &X86::GR16RegClass
27511 : SimpleTy == MVT::i32 ? &X86::GR32RegClass
27512 : &X86::GR64RegClass;
27513 assert(Res.second->contains(Res.first) && "Register in register class");
27515 // No register found/type mismatch.
27517 Res.second = nullptr;
27519 } else if (Class == &X86::FR32RegClass || Class == &X86::FR64RegClass ||
27520 Class == &X86::VR128RegClass || Class == &X86::VR256RegClass ||
27521 Class == &X86::FR32XRegClass || Class == &X86::FR64XRegClass ||
27522 Class == &X86::VR128XRegClass || Class == &X86::VR256XRegClass ||
27523 Class == &X86::VR512RegClass) {
27524 // Handle references to XMM physical registers that got mapped into the
27525 // wrong class. This can happen with constraints like {xmm0} where the
27526 // target independent register mapper will just pick the first match it can
27527 // find, ignoring the required type.
27529 if (VT == MVT::f32 || VT == MVT::i32)
27530 Res.second = &X86::FR32RegClass;
27531 else if (VT == MVT::f64 || VT == MVT::i64)
27532 Res.second = &X86::FR64RegClass;
27533 else if (X86::VR128RegClass.hasType(VT))
27534 Res.second = &X86::VR128RegClass;
27535 else if (X86::VR256RegClass.hasType(VT))
27536 Res.second = &X86::VR256RegClass;
27537 else if (X86::VR512RegClass.hasType(VT))
27538 Res.second = &X86::VR512RegClass;
27540 // Type mismatch and not a clobber: Return an error;
27542 Res.second = nullptr;
27549 int X86TargetLowering::getScalingFactorCost(const DataLayout &DL,
27550 const AddrMode &AM, Type *Ty,
27551 unsigned AS) const {
27552 // Scaling factors are not free at all.
27553 // An indexed folded instruction, i.e., inst (reg1, reg2, scale),
27554 // will take 2 allocations in the out of order engine instead of 1
27555 // for plain addressing mode, i.e. inst (reg1).
27557 // vaddps (%rsi,%drx), %ymm0, %ymm1
27558 // Requires two allocations (one for the load, one for the computation)
27560 // vaddps (%rsi), %ymm0, %ymm1
27561 // Requires just 1 allocation, i.e., freeing allocations for other operations
27562 // and having less micro operations to execute.
27564 // For some X86 architectures, this is even worse because for instance for
27565 // stores, the complex addressing mode forces the instruction to use the
27566 // "load" ports instead of the dedicated "store" port.
27567 // E.g., on Haswell:
27568 // vmovaps %ymm1, (%r8, %rdi) can use port 2 or 3.
27569 // vmovaps %ymm1, (%r8) can use port 2, 3, or 7.
27570 if (isLegalAddressingMode(DL, AM, Ty, AS))
27571 // Scale represents reg2 * scale, thus account for 1
27572 // as soon as we use a second register.
27573 return AM.Scale != 0;
27577 bool X86TargetLowering::isIntDivCheap(EVT VT, AttributeSet Attr) const {
27578 // Integer division on x86 is expensive. However, when aggressively optimizing
27579 // for code size, we prefer to use a div instruction, as it is usually smaller
27580 // than the alternative sequence.
27581 // The exception to this is vector division. Since x86 doesn't have vector
27582 // integer division, leaving the division as-is is a loss even in terms of
27583 // size, because it will have to be scalarized, while the alternative code
27584 // sequence can be performed in vector form.
27585 bool OptSize = Attr.hasAttribute(AttributeSet::FunctionIndex,
27586 Attribute::MinSize);
27587 return OptSize && !VT.isVector();
27590 void X86TargetLowering::markInRegArguments(SelectionDAG &DAG,
27591 TargetLowering::ArgListTy& Args) const {
27592 // The MCU psABI requires some arguments to be passed in-register.
27593 // For regular calls, the inreg arguments are marked by the front-end.
27594 // However, for compiler generated library calls, we have to patch this
27596 if (!Subtarget->isTargetMCU() || !Args.size())
27599 unsigned FreeRegs = 3;
27600 for (auto &Arg : Args) {
27601 // For library functions, we do not expect any fancy types.
27602 unsigned Size = DAG.getDataLayout().getTypeSizeInBits(Arg.Ty);
27603 unsigned SizeInRegs = (Size + 31) / 32;
27604 if (SizeInRegs > 2 || SizeInRegs > FreeRegs)
27607 Arg.isInReg = true;
27608 FreeRegs -= SizeInRegs;