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/EHPersonalities.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::f128, Expand);
300 setOperationAction(ISD::BR_CC , MVT::i8, Expand);
301 setOperationAction(ISD::BR_CC , MVT::i16, Expand);
302 setOperationAction(ISD::BR_CC , MVT::i32, Expand);
303 setOperationAction(ISD::BR_CC , MVT::i64, Expand);
304 setOperationAction(ISD::SELECT_CC , MVT::f32, Expand);
305 setOperationAction(ISD::SELECT_CC , MVT::f64, Expand);
306 setOperationAction(ISD::SELECT_CC , MVT::f80, Expand);
307 setOperationAction(ISD::SELECT_CC , MVT::f128, Expand);
308 setOperationAction(ISD::SELECT_CC , MVT::i8, Expand);
309 setOperationAction(ISD::SELECT_CC , MVT::i16, Expand);
310 setOperationAction(ISD::SELECT_CC , MVT::i32, Expand);
311 setOperationAction(ISD::SELECT_CC , MVT::i64, Expand);
312 if (Subtarget->is64Bit())
313 setOperationAction(ISD::SIGN_EXTEND_INREG, MVT::i32, Legal);
314 setOperationAction(ISD::SIGN_EXTEND_INREG, MVT::i16 , Legal);
315 setOperationAction(ISD::SIGN_EXTEND_INREG, MVT::i8 , Legal);
316 setOperationAction(ISD::SIGN_EXTEND_INREG, MVT::i1 , Expand);
317 setOperationAction(ISD::FP_ROUND_INREG , MVT::f32 , Expand);
319 if (Subtarget->is32Bit() && Subtarget->isTargetKnownWindowsMSVC()) {
320 // On 32 bit MSVC, `fmodf(f32)` is not defined - only `fmod(f64)`
321 // is. We should promote the value to 64-bits to solve this.
322 // This is what the CRT headers do - `fmodf` is an inline header
323 // function casting to f64 and calling `fmod`.
324 setOperationAction(ISD::FREM , MVT::f32 , Promote);
326 setOperationAction(ISD::FREM , MVT::f32 , Expand);
329 setOperationAction(ISD::FREM , MVT::f64 , Expand);
330 setOperationAction(ISD::FREM , MVT::f80 , Expand);
331 setOperationAction(ISD::FLT_ROUNDS_ , MVT::i32 , Custom);
333 // Promote the i8 variants and force them on up to i32 which has a shorter
335 setOperationAction(ISD::CTTZ , MVT::i8 , Promote);
336 AddPromotedToType (ISD::CTTZ , MVT::i8 , MVT::i32);
337 setOperationAction(ISD::CTTZ_ZERO_UNDEF , MVT::i8 , Promote);
338 AddPromotedToType (ISD::CTTZ_ZERO_UNDEF , MVT::i8 , MVT::i32);
339 if (Subtarget->hasBMI()) {
340 setOperationAction(ISD::CTTZ_ZERO_UNDEF, MVT::i16 , Expand);
341 setOperationAction(ISD::CTTZ_ZERO_UNDEF, MVT::i32 , Expand);
342 if (Subtarget->is64Bit())
343 setOperationAction(ISD::CTTZ_ZERO_UNDEF, MVT::i64, Expand);
345 setOperationAction(ISD::CTTZ , MVT::i16 , Custom);
346 setOperationAction(ISD::CTTZ , MVT::i32 , Custom);
347 if (Subtarget->is64Bit())
348 setOperationAction(ISD::CTTZ , MVT::i64 , Custom);
351 if (Subtarget->hasLZCNT()) {
352 // When promoting the i8 variants, force them to i32 for a shorter
354 setOperationAction(ISD::CTLZ , MVT::i8 , Promote);
355 AddPromotedToType (ISD::CTLZ , MVT::i8 , MVT::i32);
356 setOperationAction(ISD::CTLZ_ZERO_UNDEF, MVT::i8 , Promote);
357 AddPromotedToType (ISD::CTLZ_ZERO_UNDEF, MVT::i8 , MVT::i32);
358 setOperationAction(ISD::CTLZ_ZERO_UNDEF, MVT::i16 , Expand);
359 setOperationAction(ISD::CTLZ_ZERO_UNDEF, MVT::i32 , Expand);
360 if (Subtarget->is64Bit())
361 setOperationAction(ISD::CTLZ_ZERO_UNDEF, MVT::i64, Expand);
363 setOperationAction(ISD::CTLZ , MVT::i8 , Custom);
364 setOperationAction(ISD::CTLZ , MVT::i16 , Custom);
365 setOperationAction(ISD::CTLZ , MVT::i32 , Custom);
366 setOperationAction(ISD::CTLZ_ZERO_UNDEF, MVT::i8 , Custom);
367 setOperationAction(ISD::CTLZ_ZERO_UNDEF, MVT::i16 , Custom);
368 setOperationAction(ISD::CTLZ_ZERO_UNDEF, MVT::i32 , Custom);
369 if (Subtarget->is64Bit()) {
370 setOperationAction(ISD::CTLZ , MVT::i64 , Custom);
371 setOperationAction(ISD::CTLZ_ZERO_UNDEF, MVT::i64, Custom);
375 // Special handling for half-precision floating point conversions.
376 // If we don't have F16C support, then lower half float conversions
377 // into library calls.
378 if (Subtarget->useSoftFloat() || !Subtarget->hasF16C()) {
379 setOperationAction(ISD::FP16_TO_FP, MVT::f32, Expand);
380 setOperationAction(ISD::FP_TO_FP16, MVT::f32, Expand);
383 // There's never any support for operations beyond MVT::f32.
384 setOperationAction(ISD::FP16_TO_FP, MVT::f64, Expand);
385 setOperationAction(ISD::FP16_TO_FP, MVT::f80, Expand);
386 setOperationAction(ISD::FP_TO_FP16, MVT::f64, Expand);
387 setOperationAction(ISD::FP_TO_FP16, MVT::f80, Expand);
389 setLoadExtAction(ISD::EXTLOAD, MVT::f32, MVT::f16, Expand);
390 setLoadExtAction(ISD::EXTLOAD, MVT::f64, MVT::f16, Expand);
391 setLoadExtAction(ISD::EXTLOAD, MVT::f80, MVT::f16, Expand);
392 setTruncStoreAction(MVT::f32, MVT::f16, Expand);
393 setTruncStoreAction(MVT::f64, MVT::f16, Expand);
394 setTruncStoreAction(MVT::f80, MVT::f16, Expand);
396 if (Subtarget->hasPOPCNT()) {
397 setOperationAction(ISD::CTPOP , MVT::i8 , Promote);
399 setOperationAction(ISD::CTPOP , MVT::i8 , Expand);
400 setOperationAction(ISD::CTPOP , MVT::i16 , Expand);
401 setOperationAction(ISD::CTPOP , MVT::i32 , Expand);
402 if (Subtarget->is64Bit())
403 setOperationAction(ISD::CTPOP , MVT::i64 , Expand);
406 setOperationAction(ISD::READCYCLECOUNTER , MVT::i64 , Custom);
408 if (!Subtarget->hasMOVBE())
409 setOperationAction(ISD::BSWAP , MVT::i16 , Expand);
411 // These should be promoted to a larger select which is supported.
412 setOperationAction(ISD::SELECT , MVT::i1 , Promote);
413 // X86 wants to expand cmov itself.
414 setOperationAction(ISD::SELECT , MVT::i8 , Custom);
415 setOperationAction(ISD::SELECT , MVT::i16 , Custom);
416 setOperationAction(ISD::SELECT , MVT::i32 , Custom);
417 setOperationAction(ISD::SELECT , MVT::f32 , Custom);
418 setOperationAction(ISD::SELECT , MVT::f64 , Custom);
419 setOperationAction(ISD::SELECT , MVT::f80 , Custom);
420 setOperationAction(ISD::SELECT , MVT::f128 , Custom);
421 setOperationAction(ISD::SETCC , MVT::i8 , Custom);
422 setOperationAction(ISD::SETCC , MVT::i16 , Custom);
423 setOperationAction(ISD::SETCC , MVT::i32 , Custom);
424 setOperationAction(ISD::SETCC , MVT::f32 , Custom);
425 setOperationAction(ISD::SETCC , MVT::f64 , Custom);
426 setOperationAction(ISD::SETCC , MVT::f80 , Custom);
427 setOperationAction(ISD::SETCC , MVT::f128 , Custom);
428 setOperationAction(ISD::SETCCE , MVT::i8 , Custom);
429 setOperationAction(ISD::SETCCE , MVT::i16 , Custom);
430 setOperationAction(ISD::SETCCE , MVT::i32 , Custom);
431 if (Subtarget->is64Bit()) {
432 setOperationAction(ISD::SELECT , MVT::i64 , Custom);
433 setOperationAction(ISD::SETCC , MVT::i64 , Custom);
434 setOperationAction(ISD::SETCCE , MVT::i64 , Custom);
436 setOperationAction(ISD::EH_RETURN , MVT::Other, Custom);
437 // NOTE: EH_SJLJ_SETJMP/_LONGJMP supported here is NOT intended to support
438 // SjLj exception handling but a light-weight setjmp/longjmp replacement to
439 // support continuation, user-level threading, and etc.. As a result, no
440 // other SjLj exception interfaces are implemented and please don't build
441 // your own exception handling based on them.
442 // LLVM/Clang supports zero-cost DWARF exception handling.
443 setOperationAction(ISD::EH_SJLJ_SETJMP, MVT::i32, Custom);
444 setOperationAction(ISD::EH_SJLJ_LONGJMP, MVT::Other, Custom);
447 setOperationAction(ISD::ConstantPool , MVT::i32 , Custom);
448 setOperationAction(ISD::JumpTable , MVT::i32 , Custom);
449 setOperationAction(ISD::GlobalAddress , MVT::i32 , Custom);
450 setOperationAction(ISD::GlobalTLSAddress, MVT::i32 , Custom);
451 if (Subtarget->is64Bit())
452 setOperationAction(ISD::GlobalTLSAddress, MVT::i64, Custom);
453 setOperationAction(ISD::ExternalSymbol , MVT::i32 , Custom);
454 setOperationAction(ISD::BlockAddress , MVT::i32 , Custom);
455 if (Subtarget->is64Bit()) {
456 setOperationAction(ISD::ConstantPool , MVT::i64 , Custom);
457 setOperationAction(ISD::JumpTable , MVT::i64 , Custom);
458 setOperationAction(ISD::GlobalAddress , MVT::i64 , Custom);
459 setOperationAction(ISD::ExternalSymbol, MVT::i64 , Custom);
460 setOperationAction(ISD::BlockAddress , MVT::i64 , Custom);
462 // 64-bit addm sub, shl, sra, srl (iff 32-bit x86)
463 setOperationAction(ISD::SHL_PARTS , MVT::i32 , Custom);
464 setOperationAction(ISD::SRA_PARTS , MVT::i32 , Custom);
465 setOperationAction(ISD::SRL_PARTS , MVT::i32 , Custom);
466 if (Subtarget->is64Bit()) {
467 setOperationAction(ISD::SHL_PARTS , MVT::i64 , Custom);
468 setOperationAction(ISD::SRA_PARTS , MVT::i64 , Custom);
469 setOperationAction(ISD::SRL_PARTS , MVT::i64 , Custom);
472 if (Subtarget->hasSSE1())
473 setOperationAction(ISD::PREFETCH , MVT::Other, Legal);
475 setOperationAction(ISD::ATOMIC_FENCE , MVT::Other, Custom);
477 // Expand certain atomics
478 for (auto VT : { MVT::i8, MVT::i16, MVT::i32, MVT::i64 }) {
479 setOperationAction(ISD::ATOMIC_CMP_SWAP_WITH_SUCCESS, VT, Custom);
480 setOperationAction(ISD::ATOMIC_LOAD_SUB, VT, Custom);
481 setOperationAction(ISD::ATOMIC_STORE, VT, Custom);
484 if (Subtarget->hasCmpxchg16b()) {
485 setOperationAction(ISD::ATOMIC_CMP_SWAP_WITH_SUCCESS, MVT::i128, Custom);
488 // FIXME - use subtarget debug flags
489 if (!Subtarget->isTargetDarwin() && !Subtarget->isTargetELF() &&
490 !Subtarget->isTargetCygMing() && !Subtarget->isTargetWin64()) {
491 setOperationAction(ISD::EH_LABEL, MVT::Other, Expand);
494 setOperationAction(ISD::FRAME_TO_ARGS_OFFSET, MVT::i32, Custom);
495 setOperationAction(ISD::FRAME_TO_ARGS_OFFSET, MVT::i64, Custom);
497 setOperationAction(ISD::INIT_TRAMPOLINE, MVT::Other, Custom);
498 setOperationAction(ISD::ADJUST_TRAMPOLINE, MVT::Other, Custom);
500 setOperationAction(ISD::TRAP, MVT::Other, Legal);
501 setOperationAction(ISD::DEBUGTRAP, MVT::Other, Legal);
503 // VASTART needs to be custom lowered to use the VarArgsFrameIndex
504 setOperationAction(ISD::VASTART , MVT::Other, Custom);
505 setOperationAction(ISD::VAEND , MVT::Other, Expand);
506 if (Subtarget->is64Bit()) {
507 setOperationAction(ISD::VAARG , MVT::Other, Custom);
508 setOperationAction(ISD::VACOPY , MVT::Other, Custom);
510 // TargetInfo::CharPtrBuiltinVaList
511 setOperationAction(ISD::VAARG , MVT::Other, Expand);
512 setOperationAction(ISD::VACOPY , MVT::Other, Expand);
515 setOperationAction(ISD::STACKSAVE, MVT::Other, Expand);
516 setOperationAction(ISD::STACKRESTORE, MVT::Other, Expand);
518 setOperationAction(ISD::DYNAMIC_STACKALLOC, PtrVT, Custom);
520 // GC_TRANSITION_START and GC_TRANSITION_END need custom lowering.
521 setOperationAction(ISD::GC_TRANSITION_START, MVT::Other, Custom);
522 setOperationAction(ISD::GC_TRANSITION_END, MVT::Other, Custom);
524 if (!Subtarget->useSoftFloat() && X86ScalarSSEf64) {
525 // f32 and f64 use SSE.
526 // Set up the FP register classes.
527 addRegisterClass(MVT::f32, &X86::FR32RegClass);
528 addRegisterClass(MVT::f64, &X86::FR64RegClass);
530 // Use ANDPD to simulate FABS.
531 setOperationAction(ISD::FABS , MVT::f64, Custom);
532 setOperationAction(ISD::FABS , MVT::f32, Custom);
534 // Use XORP to simulate FNEG.
535 setOperationAction(ISD::FNEG , MVT::f64, Custom);
536 setOperationAction(ISD::FNEG , MVT::f32, Custom);
538 // Use ANDPD and ORPD to simulate FCOPYSIGN.
539 setOperationAction(ISD::FCOPYSIGN, MVT::f64, Custom);
540 setOperationAction(ISD::FCOPYSIGN, MVT::f32, Custom);
542 // Lower this to FGETSIGNx86 plus an AND.
543 setOperationAction(ISD::FGETSIGN, MVT::i64, Custom);
544 setOperationAction(ISD::FGETSIGN, MVT::i32, Custom);
546 // We don't support sin/cos/fmod
547 setOperationAction(ISD::FSIN , MVT::f64, Expand);
548 setOperationAction(ISD::FCOS , MVT::f64, Expand);
549 setOperationAction(ISD::FSINCOS, MVT::f64, Expand);
550 setOperationAction(ISD::FSIN , MVT::f32, Expand);
551 setOperationAction(ISD::FCOS , MVT::f32, Expand);
552 setOperationAction(ISD::FSINCOS, MVT::f32, Expand);
554 // Expand FP immediates into loads from the stack, except for the special
556 addLegalFPImmediate(APFloat(+0.0)); // xorpd
557 addLegalFPImmediate(APFloat(+0.0f)); // xorps
558 } else if (!Subtarget->useSoftFloat() && X86ScalarSSEf32) {
559 // Use SSE for f32, x87 for f64.
560 // Set up the FP register classes.
561 addRegisterClass(MVT::f32, &X86::FR32RegClass);
562 addRegisterClass(MVT::f64, &X86::RFP64RegClass);
564 // Use ANDPS to simulate FABS.
565 setOperationAction(ISD::FABS , MVT::f32, Custom);
567 // Use XORP to simulate FNEG.
568 setOperationAction(ISD::FNEG , MVT::f32, Custom);
570 setOperationAction(ISD::UNDEF, MVT::f64, Expand);
572 // Use ANDPS and ORPS to simulate FCOPYSIGN.
573 setOperationAction(ISD::FCOPYSIGN, MVT::f64, Expand);
574 setOperationAction(ISD::FCOPYSIGN, MVT::f32, Custom);
576 // We don't support sin/cos/fmod
577 setOperationAction(ISD::FSIN , MVT::f32, Expand);
578 setOperationAction(ISD::FCOS , MVT::f32, Expand);
579 setOperationAction(ISD::FSINCOS, MVT::f32, Expand);
581 // Special cases we handle for FP constants.
582 addLegalFPImmediate(APFloat(+0.0f)); // xorps
583 addLegalFPImmediate(APFloat(+0.0)); // FLD0
584 addLegalFPImmediate(APFloat(+1.0)); // FLD1
585 addLegalFPImmediate(APFloat(-0.0)); // FLD0/FCHS
586 addLegalFPImmediate(APFloat(-1.0)); // FLD1/FCHS
588 if (!TM.Options.UnsafeFPMath) {
589 setOperationAction(ISD::FSIN , MVT::f64, Expand);
590 setOperationAction(ISD::FCOS , MVT::f64, Expand);
591 setOperationAction(ISD::FSINCOS, MVT::f64, Expand);
593 } else if (!Subtarget->useSoftFloat()) {
594 // f32 and f64 in x87.
595 // Set up the FP register classes.
596 addRegisterClass(MVT::f64, &X86::RFP64RegClass);
597 addRegisterClass(MVT::f32, &X86::RFP32RegClass);
599 setOperationAction(ISD::UNDEF, MVT::f64, Expand);
600 setOperationAction(ISD::UNDEF, MVT::f32, Expand);
601 setOperationAction(ISD::FCOPYSIGN, MVT::f64, Expand);
602 setOperationAction(ISD::FCOPYSIGN, MVT::f32, Expand);
604 if (!TM.Options.UnsafeFPMath) {
605 setOperationAction(ISD::FSIN , MVT::f64, Expand);
606 setOperationAction(ISD::FSIN , MVT::f32, Expand);
607 setOperationAction(ISD::FCOS , MVT::f64, Expand);
608 setOperationAction(ISD::FCOS , MVT::f32, Expand);
609 setOperationAction(ISD::FSINCOS, MVT::f64, Expand);
610 setOperationAction(ISD::FSINCOS, MVT::f32, Expand);
612 addLegalFPImmediate(APFloat(+0.0)); // FLD0
613 addLegalFPImmediate(APFloat(+1.0)); // FLD1
614 addLegalFPImmediate(APFloat(-0.0)); // FLD0/FCHS
615 addLegalFPImmediate(APFloat(-1.0)); // FLD1/FCHS
616 addLegalFPImmediate(APFloat(+0.0f)); // FLD0
617 addLegalFPImmediate(APFloat(+1.0f)); // FLD1
618 addLegalFPImmediate(APFloat(-0.0f)); // FLD0/FCHS
619 addLegalFPImmediate(APFloat(-1.0f)); // FLD1/FCHS
622 // We don't support FMA.
623 setOperationAction(ISD::FMA, MVT::f64, Expand);
624 setOperationAction(ISD::FMA, MVT::f32, Expand);
626 // Long double always uses X87, except f128 in MMX.
627 if (!Subtarget->useSoftFloat()) {
628 if (Subtarget->is64Bit() && Subtarget->hasMMX()) {
629 addRegisterClass(MVT::f128, &X86::FR128RegClass);
630 ValueTypeActions.setTypeAction(MVT::f128, TypeSoftenFloat);
631 setOperationAction(ISD::FABS , MVT::f128, Custom);
632 setOperationAction(ISD::FNEG , MVT::f128, Custom);
633 setOperationAction(ISD::FCOPYSIGN, MVT::f128, Custom);
636 addRegisterClass(MVT::f80, &X86::RFP80RegClass);
637 setOperationAction(ISD::UNDEF, MVT::f80, Expand);
638 setOperationAction(ISD::FCOPYSIGN, MVT::f80, Expand);
640 APFloat TmpFlt = APFloat::getZero(APFloat::x87DoubleExtended);
641 addLegalFPImmediate(TmpFlt); // FLD0
643 addLegalFPImmediate(TmpFlt); // FLD0/FCHS
646 APFloat TmpFlt2(+1.0);
647 TmpFlt2.convert(APFloat::x87DoubleExtended, APFloat::rmNearestTiesToEven,
649 addLegalFPImmediate(TmpFlt2); // FLD1
650 TmpFlt2.changeSign();
651 addLegalFPImmediate(TmpFlt2); // FLD1/FCHS
654 if (!TM.Options.UnsafeFPMath) {
655 setOperationAction(ISD::FSIN , MVT::f80, Expand);
656 setOperationAction(ISD::FCOS , MVT::f80, Expand);
657 setOperationAction(ISD::FSINCOS, MVT::f80, Expand);
660 setOperationAction(ISD::FFLOOR, MVT::f80, Expand);
661 setOperationAction(ISD::FCEIL, MVT::f80, Expand);
662 setOperationAction(ISD::FTRUNC, MVT::f80, Expand);
663 setOperationAction(ISD::FRINT, MVT::f80, Expand);
664 setOperationAction(ISD::FNEARBYINT, MVT::f80, Expand);
665 setOperationAction(ISD::FMA, MVT::f80, Expand);
668 // Always use a library call for pow.
669 setOperationAction(ISD::FPOW , MVT::f32 , Expand);
670 setOperationAction(ISD::FPOW , MVT::f64 , Expand);
671 setOperationAction(ISD::FPOW , MVT::f80 , Expand);
673 setOperationAction(ISD::FLOG, MVT::f80, Expand);
674 setOperationAction(ISD::FLOG2, MVT::f80, Expand);
675 setOperationAction(ISD::FLOG10, MVT::f80, Expand);
676 setOperationAction(ISD::FEXP, MVT::f80, Expand);
677 setOperationAction(ISD::FEXP2, MVT::f80, Expand);
678 setOperationAction(ISD::FMINNUM, MVT::f80, Expand);
679 setOperationAction(ISD::FMAXNUM, MVT::f80, Expand);
681 // First set operation action for all vector types to either promote
682 // (for widening) or expand (for scalarization). Then we will selectively
683 // turn on ones that can be effectively codegen'd.
684 for (MVT VT : MVT::vector_valuetypes()) {
685 setOperationAction(ISD::ADD , VT, Expand);
686 setOperationAction(ISD::SUB , VT, Expand);
687 setOperationAction(ISD::FADD, VT, Expand);
688 setOperationAction(ISD::FNEG, VT, Expand);
689 setOperationAction(ISD::FSUB, VT, Expand);
690 setOperationAction(ISD::MUL , VT, Expand);
691 setOperationAction(ISD::FMUL, VT, Expand);
692 setOperationAction(ISD::SDIV, VT, Expand);
693 setOperationAction(ISD::UDIV, VT, Expand);
694 setOperationAction(ISD::FDIV, VT, Expand);
695 setOperationAction(ISD::SREM, VT, Expand);
696 setOperationAction(ISD::UREM, VT, Expand);
697 setOperationAction(ISD::LOAD, VT, Expand);
698 setOperationAction(ISD::VECTOR_SHUFFLE, VT, Expand);
699 setOperationAction(ISD::EXTRACT_VECTOR_ELT, VT,Expand);
700 setOperationAction(ISD::INSERT_VECTOR_ELT, VT, Expand);
701 setOperationAction(ISD::EXTRACT_SUBVECTOR, VT,Expand);
702 setOperationAction(ISD::INSERT_SUBVECTOR, VT,Expand);
703 setOperationAction(ISD::FABS, VT, Expand);
704 setOperationAction(ISD::FSIN, VT, Expand);
705 setOperationAction(ISD::FSINCOS, VT, Expand);
706 setOperationAction(ISD::FCOS, VT, Expand);
707 setOperationAction(ISD::FSINCOS, VT, Expand);
708 setOperationAction(ISD::FREM, VT, Expand);
709 setOperationAction(ISD::FMA, VT, Expand);
710 setOperationAction(ISD::FPOWI, VT, Expand);
711 setOperationAction(ISD::FSQRT, VT, Expand);
712 setOperationAction(ISD::FCOPYSIGN, VT, Expand);
713 setOperationAction(ISD::FFLOOR, VT, Expand);
714 setOperationAction(ISD::FCEIL, VT, Expand);
715 setOperationAction(ISD::FTRUNC, VT, Expand);
716 setOperationAction(ISD::FRINT, VT, Expand);
717 setOperationAction(ISD::FNEARBYINT, VT, Expand);
718 setOperationAction(ISD::SMUL_LOHI, VT, Expand);
719 setOperationAction(ISD::MULHS, VT, Expand);
720 setOperationAction(ISD::UMUL_LOHI, VT, Expand);
721 setOperationAction(ISD::MULHU, VT, Expand);
722 setOperationAction(ISD::SDIVREM, VT, Expand);
723 setOperationAction(ISD::UDIVREM, VT, Expand);
724 setOperationAction(ISD::FPOW, VT, Expand);
725 setOperationAction(ISD::CTPOP, VT, Expand);
726 setOperationAction(ISD::CTTZ, VT, Expand);
727 setOperationAction(ISD::CTTZ_ZERO_UNDEF, VT, Expand);
728 setOperationAction(ISD::CTLZ, VT, Expand);
729 setOperationAction(ISD::CTLZ_ZERO_UNDEF, VT, Expand);
730 setOperationAction(ISD::SHL, VT, Expand);
731 setOperationAction(ISD::SRA, VT, Expand);
732 setOperationAction(ISD::SRL, VT, Expand);
733 setOperationAction(ISD::ROTL, VT, Expand);
734 setOperationAction(ISD::ROTR, VT, Expand);
735 setOperationAction(ISD::BSWAP, VT, Expand);
736 setOperationAction(ISD::SETCC, VT, Expand);
737 setOperationAction(ISD::FLOG, VT, Expand);
738 setOperationAction(ISD::FLOG2, VT, Expand);
739 setOperationAction(ISD::FLOG10, VT, Expand);
740 setOperationAction(ISD::FEXP, VT, Expand);
741 setOperationAction(ISD::FEXP2, VT, Expand);
742 setOperationAction(ISD::FP_TO_UINT, VT, Expand);
743 setOperationAction(ISD::FP_TO_SINT, VT, Expand);
744 setOperationAction(ISD::UINT_TO_FP, VT, Expand);
745 setOperationAction(ISD::SINT_TO_FP, VT, Expand);
746 setOperationAction(ISD::SIGN_EXTEND_INREG, VT,Expand);
747 setOperationAction(ISD::TRUNCATE, VT, Expand);
748 setOperationAction(ISD::SIGN_EXTEND, VT, Expand);
749 setOperationAction(ISD::ZERO_EXTEND, VT, Expand);
750 setOperationAction(ISD::ANY_EXTEND, VT, Expand);
751 setOperationAction(ISD::VSELECT, VT, Expand);
752 setOperationAction(ISD::SELECT_CC, VT, Expand);
753 for (MVT InnerVT : MVT::vector_valuetypes()) {
754 setTruncStoreAction(InnerVT, VT, Expand);
756 setLoadExtAction(ISD::SEXTLOAD, InnerVT, VT, Expand);
757 setLoadExtAction(ISD::ZEXTLOAD, InnerVT, VT, Expand);
759 // N.b. ISD::EXTLOAD legality is basically ignored except for i1-like
760 // types, we have to deal with them whether we ask for Expansion or not.
761 // Setting Expand causes its own optimisation problems though, so leave
763 if (VT.getVectorElementType() == MVT::i1)
764 setLoadExtAction(ISD::EXTLOAD, InnerVT, VT, Expand);
766 // EXTLOAD for MVT::f16 vectors is not legal because f16 vectors are
767 // split/scalarized right now.
768 if (VT.getVectorElementType() == MVT::f16)
769 setLoadExtAction(ISD::EXTLOAD, InnerVT, VT, Expand);
773 // FIXME: In order to prevent SSE instructions being expanded to MMX ones
774 // with -msoft-float, disable use of MMX as well.
775 if (!Subtarget->useSoftFloat() && Subtarget->hasMMX()) {
776 addRegisterClass(MVT::x86mmx, &X86::VR64RegClass);
777 // No operations on x86mmx supported, everything uses intrinsics.
780 // MMX-sized vectors (other than x86mmx) are expected to be expanded
781 // into smaller operations.
782 for (MVT MMXTy : {MVT::v8i8, MVT::v4i16, MVT::v2i32, MVT::v1i64}) {
783 setOperationAction(ISD::MULHS, MMXTy, Expand);
784 setOperationAction(ISD::AND, MMXTy, Expand);
785 setOperationAction(ISD::OR, MMXTy, Expand);
786 setOperationAction(ISD::XOR, MMXTy, Expand);
787 setOperationAction(ISD::SCALAR_TO_VECTOR, MMXTy, Expand);
788 setOperationAction(ISD::SELECT, MMXTy, Expand);
789 setOperationAction(ISD::BITCAST, MMXTy, Expand);
791 setOperationAction(ISD::INSERT_VECTOR_ELT, MVT::v1i64, Expand);
793 if (!Subtarget->useSoftFloat() && Subtarget->hasSSE1()) {
794 addRegisterClass(MVT::v4f32, &X86::VR128RegClass);
796 setOperationAction(ISD::FADD, MVT::v4f32, Legal);
797 setOperationAction(ISD::FSUB, MVT::v4f32, Legal);
798 setOperationAction(ISD::FMUL, MVT::v4f32, Legal);
799 setOperationAction(ISD::FDIV, MVT::v4f32, Legal);
800 setOperationAction(ISD::FSQRT, MVT::v4f32, Legal);
801 setOperationAction(ISD::FNEG, MVT::v4f32, Custom);
802 setOperationAction(ISD::FABS, MVT::v4f32, Custom);
803 setOperationAction(ISD::LOAD, MVT::v4f32, Legal);
804 setOperationAction(ISD::BUILD_VECTOR, MVT::v4f32, Custom);
805 setOperationAction(ISD::VECTOR_SHUFFLE, MVT::v4f32, Custom);
806 setOperationAction(ISD::VSELECT, MVT::v4f32, Custom);
807 setOperationAction(ISD::EXTRACT_VECTOR_ELT, MVT::v4f32, Custom);
808 setOperationAction(ISD::SELECT, MVT::v4f32, Custom);
809 setOperationAction(ISD::UINT_TO_FP, MVT::v4i32, Custom);
812 if (!Subtarget->useSoftFloat() && Subtarget->hasSSE2()) {
813 addRegisterClass(MVT::v2f64, &X86::VR128RegClass);
815 // FIXME: Unfortunately, -soft-float and -no-implicit-float mean XMM
816 // registers cannot be used even for integer operations.
817 addRegisterClass(MVT::v16i8, &X86::VR128RegClass);
818 addRegisterClass(MVT::v8i16, &X86::VR128RegClass);
819 addRegisterClass(MVT::v4i32, &X86::VR128RegClass);
820 addRegisterClass(MVT::v2i64, &X86::VR128RegClass);
822 setOperationAction(ISD::ADD, MVT::v16i8, Legal);
823 setOperationAction(ISD::ADD, MVT::v8i16, Legal);
824 setOperationAction(ISD::ADD, MVT::v4i32, Legal);
825 setOperationAction(ISD::ADD, MVT::v2i64, Legal);
826 setOperationAction(ISD::MUL, MVT::v16i8, Custom);
827 setOperationAction(ISD::MUL, MVT::v4i32, Custom);
828 setOperationAction(ISD::MUL, MVT::v2i64, Custom);
829 setOperationAction(ISD::UMUL_LOHI, MVT::v4i32, Custom);
830 setOperationAction(ISD::SMUL_LOHI, MVT::v4i32, Custom);
831 setOperationAction(ISD::MULHU, MVT::v8i16, Legal);
832 setOperationAction(ISD::MULHS, MVT::v8i16, Legal);
833 setOperationAction(ISD::SUB, MVT::v16i8, Legal);
834 setOperationAction(ISD::SUB, MVT::v8i16, Legal);
835 setOperationAction(ISD::SUB, MVT::v4i32, Legal);
836 setOperationAction(ISD::SUB, MVT::v2i64, Legal);
837 setOperationAction(ISD::MUL, MVT::v8i16, Legal);
838 setOperationAction(ISD::FADD, MVT::v2f64, Legal);
839 setOperationAction(ISD::FSUB, MVT::v2f64, Legal);
840 setOperationAction(ISD::FMUL, MVT::v2f64, Legal);
841 setOperationAction(ISD::FDIV, MVT::v2f64, Legal);
842 setOperationAction(ISD::FSQRT, MVT::v2f64, Legal);
843 setOperationAction(ISD::FNEG, MVT::v2f64, Custom);
844 setOperationAction(ISD::FABS, MVT::v2f64, Custom);
846 setOperationAction(ISD::SMAX, MVT::v8i16, Legal);
847 setOperationAction(ISD::UMAX, MVT::v16i8, Legal);
848 setOperationAction(ISD::SMIN, MVT::v8i16, Legal);
849 setOperationAction(ISD::UMIN, MVT::v16i8, Legal);
851 setOperationAction(ISD::SETCC, MVT::v2i64, Custom);
852 setOperationAction(ISD::SETCC, MVT::v16i8, Custom);
853 setOperationAction(ISD::SETCC, MVT::v8i16, Custom);
854 setOperationAction(ISD::SETCC, MVT::v4i32, Custom);
856 setOperationAction(ISD::SCALAR_TO_VECTOR, MVT::v16i8, Custom);
857 setOperationAction(ISD::SCALAR_TO_VECTOR, MVT::v8i16, Custom);
858 setOperationAction(ISD::INSERT_VECTOR_ELT, MVT::v8i16, Custom);
859 setOperationAction(ISD::INSERT_VECTOR_ELT, MVT::v4i32, Custom);
860 setOperationAction(ISD::INSERT_VECTOR_ELT, MVT::v4f32, Custom);
862 setOperationAction(ISD::CTPOP, MVT::v16i8, Custom);
863 setOperationAction(ISD::CTPOP, MVT::v8i16, Custom);
864 setOperationAction(ISD::CTPOP, MVT::v4i32, Custom);
865 setOperationAction(ISD::CTPOP, MVT::v2i64, Custom);
867 setOperationAction(ISD::CTTZ, MVT::v16i8, Custom);
868 setOperationAction(ISD::CTTZ, MVT::v8i16, Custom);
869 setOperationAction(ISD::CTTZ, MVT::v4i32, Custom);
870 // ISD::CTTZ v2i64 - scalarization is faster.
871 setOperationAction(ISD::CTTZ_ZERO_UNDEF, MVT::v16i8, Custom);
872 setOperationAction(ISD::CTTZ_ZERO_UNDEF, MVT::v8i16, Custom);
873 setOperationAction(ISD::CTTZ_ZERO_UNDEF, MVT::v4i32, Custom);
874 // ISD::CTTZ_ZERO_UNDEF v2i64 - scalarization is faster.
876 // Custom lower build_vector, vector_shuffle, and extract_vector_elt.
877 for (auto VT : { MVT::v16i8, MVT::v8i16, MVT::v4i32 }) {
878 setOperationAction(ISD::BUILD_VECTOR, VT, Custom);
879 setOperationAction(ISD::VECTOR_SHUFFLE, VT, Custom);
880 setOperationAction(ISD::VSELECT, VT, Custom);
881 setOperationAction(ISD::EXTRACT_VECTOR_ELT, VT, Custom);
884 // We support custom legalizing of sext and anyext loads for specific
885 // memory vector types which we can load as a scalar (or sequence of
886 // scalars) and extend in-register to a legal 128-bit vector type. For sext
887 // loads these must work with a single scalar load.
888 for (MVT VT : MVT::integer_vector_valuetypes()) {
889 setLoadExtAction(ISD::SEXTLOAD, VT, MVT::v4i8, Custom);
890 setLoadExtAction(ISD::SEXTLOAD, VT, MVT::v4i16, Custom);
891 setLoadExtAction(ISD::SEXTLOAD, VT, MVT::v8i8, Custom);
892 setLoadExtAction(ISD::EXTLOAD, VT, MVT::v2i8, Custom);
893 setLoadExtAction(ISD::EXTLOAD, VT, MVT::v2i16, Custom);
894 setLoadExtAction(ISD::EXTLOAD, VT, MVT::v2i32, Custom);
895 setLoadExtAction(ISD::EXTLOAD, VT, MVT::v4i8, Custom);
896 setLoadExtAction(ISD::EXTLOAD, VT, MVT::v4i16, Custom);
897 setLoadExtAction(ISD::EXTLOAD, VT, MVT::v8i8, Custom);
900 setOperationAction(ISD::BUILD_VECTOR, MVT::v2f64, Custom);
901 setOperationAction(ISD::BUILD_VECTOR, MVT::v2i64, Custom);
902 setOperationAction(ISD::VECTOR_SHUFFLE, MVT::v2f64, Custom);
903 setOperationAction(ISD::VECTOR_SHUFFLE, MVT::v2i64, Custom);
904 setOperationAction(ISD::VSELECT, MVT::v2f64, Custom);
905 setOperationAction(ISD::VSELECT, MVT::v2i64, Custom);
906 setOperationAction(ISD::INSERT_VECTOR_ELT, MVT::v2f64, Custom);
907 setOperationAction(ISD::EXTRACT_VECTOR_ELT, MVT::v2f64, Custom);
909 if (Subtarget->is64Bit()) {
910 setOperationAction(ISD::INSERT_VECTOR_ELT, MVT::v2i64, Custom);
911 setOperationAction(ISD::EXTRACT_VECTOR_ELT, MVT::v2i64, Custom);
914 // Promote v16i8, v8i16, v4i32 load, select, and, or, xor to v2i64.
915 for (auto VT : { MVT::v16i8, MVT::v8i16, MVT::v4i32 }) {
916 setOperationAction(ISD::AND, VT, Promote);
917 AddPromotedToType (ISD::AND, VT, MVT::v2i64);
918 setOperationAction(ISD::OR, VT, Promote);
919 AddPromotedToType (ISD::OR, VT, MVT::v2i64);
920 setOperationAction(ISD::XOR, VT, Promote);
921 AddPromotedToType (ISD::XOR, VT, MVT::v2i64);
922 setOperationAction(ISD::LOAD, VT, Promote);
923 AddPromotedToType (ISD::LOAD, VT, MVT::v2i64);
924 setOperationAction(ISD::SELECT, VT, Promote);
925 AddPromotedToType (ISD::SELECT, VT, MVT::v2i64);
928 // Custom lower v2i64 and v2f64 selects.
929 setOperationAction(ISD::LOAD, MVT::v2f64, Legal);
930 setOperationAction(ISD::LOAD, MVT::v2i64, Legal);
931 setOperationAction(ISD::SELECT, MVT::v2f64, Custom);
932 setOperationAction(ISD::SELECT, MVT::v2i64, Custom);
934 setOperationAction(ISD::FP_TO_SINT, MVT::v4i32, Legal);
935 setOperationAction(ISD::SINT_TO_FP, MVT::v4i32, Legal);
937 setOperationAction(ISD::SINT_TO_FP, MVT::v2i32, Custom);
939 setOperationAction(ISD::UINT_TO_FP, MVT::v4i8, Custom);
940 setOperationAction(ISD::UINT_TO_FP, MVT::v4i16, Custom);
941 // As there is no 64-bit GPR available, we need build a special custom
942 // sequence to convert from v2i32 to v2f32.
943 if (!Subtarget->is64Bit())
944 setOperationAction(ISD::UINT_TO_FP, MVT::v2f32, Custom);
946 setOperationAction(ISD::FP_EXTEND, MVT::v2f32, Custom);
947 setOperationAction(ISD::FP_ROUND, MVT::v2f32, Custom);
949 for (MVT VT : MVT::fp_vector_valuetypes())
950 setLoadExtAction(ISD::EXTLOAD, VT, MVT::v2f32, Legal);
952 setOperationAction(ISD::BITCAST, MVT::v2i32, Custom);
953 setOperationAction(ISD::BITCAST, MVT::v4i16, Custom);
954 setOperationAction(ISD::BITCAST, MVT::v8i8, Custom);
957 if (!Subtarget->useSoftFloat() && Subtarget->hasSSE41()) {
958 for (MVT RoundedTy : {MVT::f32, MVT::f64, MVT::v4f32, MVT::v2f64}) {
959 setOperationAction(ISD::FFLOOR, RoundedTy, Legal);
960 setOperationAction(ISD::FCEIL, RoundedTy, Legal);
961 setOperationAction(ISD::FTRUNC, RoundedTy, Legal);
962 setOperationAction(ISD::FRINT, RoundedTy, Legal);
963 setOperationAction(ISD::FNEARBYINT, RoundedTy, Legal);
966 setOperationAction(ISD::SMAX, MVT::v16i8, Legal);
967 setOperationAction(ISD::SMAX, MVT::v4i32, Legal);
968 setOperationAction(ISD::UMAX, MVT::v8i16, Legal);
969 setOperationAction(ISD::UMAX, MVT::v4i32, Legal);
970 setOperationAction(ISD::SMIN, MVT::v16i8, Legal);
971 setOperationAction(ISD::SMIN, MVT::v4i32, Legal);
972 setOperationAction(ISD::UMIN, MVT::v8i16, Legal);
973 setOperationAction(ISD::UMIN, MVT::v4i32, Legal);
975 // FIXME: Do we need to handle scalar-to-vector here?
976 setOperationAction(ISD::MUL, MVT::v4i32, Legal);
978 // We directly match byte blends in the backend as they match the VSELECT
980 setOperationAction(ISD::VSELECT, MVT::v16i8, Legal);
982 // SSE41 brings specific instructions for doing vector sign extend even in
983 // cases where we don't have SRA.
984 for (MVT VT : MVT::integer_vector_valuetypes()) {
985 setLoadExtAction(ISD::SEXTLOAD, VT, MVT::v2i8, Custom);
986 setLoadExtAction(ISD::SEXTLOAD, VT, MVT::v2i16, Custom);
987 setLoadExtAction(ISD::SEXTLOAD, VT, MVT::v2i32, Custom);
990 // SSE41 also has vector sign/zero extending loads, PMOV[SZ]X
991 setLoadExtAction(ISD::SEXTLOAD, MVT::v8i16, MVT::v8i8, Legal);
992 setLoadExtAction(ISD::SEXTLOAD, MVT::v4i32, MVT::v4i8, Legal);
993 setLoadExtAction(ISD::SEXTLOAD, MVT::v2i64, MVT::v2i8, Legal);
994 setLoadExtAction(ISD::SEXTLOAD, MVT::v4i32, MVT::v4i16, Legal);
995 setLoadExtAction(ISD::SEXTLOAD, MVT::v2i64, MVT::v2i16, Legal);
996 setLoadExtAction(ISD::SEXTLOAD, MVT::v2i64, MVT::v2i32, Legal);
998 setLoadExtAction(ISD::ZEXTLOAD, MVT::v8i16, MVT::v8i8, Legal);
999 setLoadExtAction(ISD::ZEXTLOAD, MVT::v4i32, MVT::v4i8, Legal);
1000 setLoadExtAction(ISD::ZEXTLOAD, MVT::v2i64, MVT::v2i8, Legal);
1001 setLoadExtAction(ISD::ZEXTLOAD, MVT::v4i32, MVT::v4i16, Legal);
1002 setLoadExtAction(ISD::ZEXTLOAD, MVT::v2i64, MVT::v2i16, Legal);
1003 setLoadExtAction(ISD::ZEXTLOAD, MVT::v2i64, MVT::v2i32, Legal);
1005 // i8 and i16 vectors are custom because the source register and source
1006 // source memory operand types are not the same width. f32 vectors are
1007 // custom since the immediate controlling the insert encodes additional
1009 setOperationAction(ISD::INSERT_VECTOR_ELT, MVT::v16i8, Custom);
1010 setOperationAction(ISD::INSERT_VECTOR_ELT, MVT::v8i16, Custom);
1011 setOperationAction(ISD::INSERT_VECTOR_ELT, MVT::v4i32, Custom);
1012 setOperationAction(ISD::INSERT_VECTOR_ELT, MVT::v4f32, Custom);
1014 setOperationAction(ISD::EXTRACT_VECTOR_ELT, MVT::v16i8, Custom);
1015 setOperationAction(ISD::EXTRACT_VECTOR_ELT, MVT::v8i16, Custom);
1016 setOperationAction(ISD::EXTRACT_VECTOR_ELT, MVT::v4i32, Custom);
1017 setOperationAction(ISD::EXTRACT_VECTOR_ELT, MVT::v4f32, Custom);
1019 // FIXME: these should be Legal, but that's only for the case where
1020 // the index is constant. For now custom expand to deal with that.
1021 if (Subtarget->is64Bit()) {
1022 setOperationAction(ISD::INSERT_VECTOR_ELT, MVT::v2i64, Custom);
1023 setOperationAction(ISD::EXTRACT_VECTOR_ELT, MVT::v2i64, Custom);
1027 if (Subtarget->hasSSE2()) {
1028 setOperationAction(ISD::SIGN_EXTEND_VECTOR_INREG, MVT::v2i64, Custom);
1029 setOperationAction(ISD::SIGN_EXTEND_VECTOR_INREG, MVT::v4i32, Custom);
1030 setOperationAction(ISD::SIGN_EXTEND_VECTOR_INREG, MVT::v8i16, Custom);
1032 setOperationAction(ISD::SRL, MVT::v8i16, Custom);
1033 setOperationAction(ISD::SRL, MVT::v16i8, Custom);
1035 setOperationAction(ISD::SHL, MVT::v8i16, Custom);
1036 setOperationAction(ISD::SHL, MVT::v16i8, Custom);
1038 setOperationAction(ISD::SRA, MVT::v8i16, Custom);
1039 setOperationAction(ISD::SRA, MVT::v16i8, Custom);
1041 // In the customized shift lowering, the legal cases in AVX2 will be
1043 setOperationAction(ISD::SRL, MVT::v2i64, Custom);
1044 setOperationAction(ISD::SRL, MVT::v4i32, Custom);
1046 setOperationAction(ISD::SHL, MVT::v2i64, Custom);
1047 setOperationAction(ISD::SHL, MVT::v4i32, Custom);
1049 setOperationAction(ISD::SRA, MVT::v2i64, Custom);
1050 setOperationAction(ISD::SRA, MVT::v4i32, Custom);
1053 if (Subtarget->hasXOP()) {
1054 setOperationAction(ISD::ROTL, MVT::v16i8, Custom);
1055 setOperationAction(ISD::ROTL, MVT::v8i16, Custom);
1056 setOperationAction(ISD::ROTL, MVT::v4i32, Custom);
1057 setOperationAction(ISD::ROTL, MVT::v2i64, Custom);
1058 setOperationAction(ISD::ROTL, MVT::v32i8, Custom);
1059 setOperationAction(ISD::ROTL, MVT::v16i16, Custom);
1060 setOperationAction(ISD::ROTL, MVT::v8i32, Custom);
1061 setOperationAction(ISD::ROTL, MVT::v4i64, Custom);
1064 if (!Subtarget->useSoftFloat() && Subtarget->hasFp256()) {
1065 addRegisterClass(MVT::v32i8, &X86::VR256RegClass);
1066 addRegisterClass(MVT::v16i16, &X86::VR256RegClass);
1067 addRegisterClass(MVT::v8i32, &X86::VR256RegClass);
1068 addRegisterClass(MVT::v8f32, &X86::VR256RegClass);
1069 addRegisterClass(MVT::v4i64, &X86::VR256RegClass);
1070 addRegisterClass(MVT::v4f64, &X86::VR256RegClass);
1072 setOperationAction(ISD::LOAD, MVT::v8f32, Legal);
1073 setOperationAction(ISD::LOAD, MVT::v4f64, Legal);
1074 setOperationAction(ISD::LOAD, MVT::v4i64, Legal);
1076 setOperationAction(ISD::FADD, MVT::v8f32, Legal);
1077 setOperationAction(ISD::FSUB, MVT::v8f32, Legal);
1078 setOperationAction(ISD::FMUL, MVT::v8f32, Legal);
1079 setOperationAction(ISD::FDIV, MVT::v8f32, Legal);
1080 setOperationAction(ISD::FSQRT, MVT::v8f32, Legal);
1081 setOperationAction(ISD::FFLOOR, MVT::v8f32, Legal);
1082 setOperationAction(ISD::FCEIL, MVT::v8f32, Legal);
1083 setOperationAction(ISD::FTRUNC, MVT::v8f32, Legal);
1084 setOperationAction(ISD::FRINT, MVT::v8f32, Legal);
1085 setOperationAction(ISD::FNEARBYINT, MVT::v8f32, Legal);
1086 setOperationAction(ISD::FNEG, MVT::v8f32, Custom);
1087 setOperationAction(ISD::FABS, MVT::v8f32, Custom);
1089 setOperationAction(ISD::FADD, MVT::v4f64, Legal);
1090 setOperationAction(ISD::FSUB, MVT::v4f64, Legal);
1091 setOperationAction(ISD::FMUL, MVT::v4f64, Legal);
1092 setOperationAction(ISD::FDIV, MVT::v4f64, Legal);
1093 setOperationAction(ISD::FSQRT, MVT::v4f64, Legal);
1094 setOperationAction(ISD::FFLOOR, MVT::v4f64, Legal);
1095 setOperationAction(ISD::FCEIL, MVT::v4f64, Legal);
1096 setOperationAction(ISD::FTRUNC, MVT::v4f64, Legal);
1097 setOperationAction(ISD::FRINT, MVT::v4f64, Legal);
1098 setOperationAction(ISD::FNEARBYINT, MVT::v4f64, Legal);
1099 setOperationAction(ISD::FNEG, MVT::v4f64, Custom);
1100 setOperationAction(ISD::FABS, MVT::v4f64, Custom);
1102 // (fp_to_int:v8i16 (v8f32 ..)) requires the result type to be promoted
1103 // even though v8i16 is a legal type.
1104 setOperationAction(ISD::FP_TO_SINT, MVT::v8i16, Promote);
1105 setOperationAction(ISD::FP_TO_UINT, MVT::v8i16, Promote);
1106 setOperationAction(ISD::FP_TO_SINT, MVT::v8i32, Legal);
1108 setOperationAction(ISD::SINT_TO_FP, MVT::v8i16, Promote);
1109 setOperationAction(ISD::SINT_TO_FP, MVT::v8i32, Legal);
1110 setOperationAction(ISD::FP_ROUND, MVT::v4f32, Legal);
1112 setOperationAction(ISD::UINT_TO_FP, MVT::v8i8, Custom);
1113 setOperationAction(ISD::UINT_TO_FP, MVT::v8i16, Custom);
1115 for (MVT VT : MVT::fp_vector_valuetypes())
1116 setLoadExtAction(ISD::EXTLOAD, VT, MVT::v4f32, Legal);
1118 setOperationAction(ISD::SRL, MVT::v16i16, Custom);
1119 setOperationAction(ISD::SRL, MVT::v32i8, Custom);
1121 setOperationAction(ISD::SHL, MVT::v16i16, Custom);
1122 setOperationAction(ISD::SHL, MVT::v32i8, Custom);
1124 setOperationAction(ISD::SRA, MVT::v16i16, Custom);
1125 setOperationAction(ISD::SRA, MVT::v32i8, Custom);
1127 setOperationAction(ISD::SETCC, MVT::v32i8, Custom);
1128 setOperationAction(ISD::SETCC, MVT::v16i16, Custom);
1129 setOperationAction(ISD::SETCC, MVT::v8i32, Custom);
1130 setOperationAction(ISD::SETCC, MVT::v4i64, Custom);
1132 setOperationAction(ISD::SELECT, MVT::v4f64, Custom);
1133 setOperationAction(ISD::SELECT, MVT::v4i64, Custom);
1134 setOperationAction(ISD::SELECT, MVT::v8f32, Custom);
1136 setOperationAction(ISD::SIGN_EXTEND, MVT::v4i64, Custom);
1137 setOperationAction(ISD::SIGN_EXTEND, MVT::v8i32, Custom);
1138 setOperationAction(ISD::SIGN_EXTEND, MVT::v16i16, Custom);
1139 setOperationAction(ISD::ZERO_EXTEND, MVT::v4i64, Custom);
1140 setOperationAction(ISD::ZERO_EXTEND, MVT::v8i32, Custom);
1141 setOperationAction(ISD::ZERO_EXTEND, MVT::v16i16, Custom);
1142 setOperationAction(ISD::ANY_EXTEND, MVT::v4i64, Custom);
1143 setOperationAction(ISD::ANY_EXTEND, MVT::v8i32, Custom);
1144 setOperationAction(ISD::ANY_EXTEND, MVT::v16i16, Custom);
1145 setOperationAction(ISD::TRUNCATE, MVT::v16i8, Custom);
1146 setOperationAction(ISD::TRUNCATE, MVT::v8i16, Custom);
1147 setOperationAction(ISD::TRUNCATE, MVT::v4i32, Custom);
1149 setOperationAction(ISD::CTPOP, MVT::v32i8, Custom);
1150 setOperationAction(ISD::CTPOP, MVT::v16i16, Custom);
1151 setOperationAction(ISD::CTPOP, MVT::v8i32, Custom);
1152 setOperationAction(ISD::CTPOP, MVT::v4i64, Custom);
1154 setOperationAction(ISD::CTTZ, MVT::v32i8, Custom);
1155 setOperationAction(ISD::CTTZ, MVT::v16i16, Custom);
1156 setOperationAction(ISD::CTTZ, MVT::v8i32, Custom);
1157 setOperationAction(ISD::CTTZ, MVT::v4i64, Custom);
1158 setOperationAction(ISD::CTTZ_ZERO_UNDEF, MVT::v32i8, Custom);
1159 setOperationAction(ISD::CTTZ_ZERO_UNDEF, MVT::v16i16, Custom);
1160 setOperationAction(ISD::CTTZ_ZERO_UNDEF, MVT::v8i32, Custom);
1161 setOperationAction(ISD::CTTZ_ZERO_UNDEF, MVT::v4i64, Custom);
1163 if (Subtarget->hasAnyFMA()) {
1164 setOperationAction(ISD::FMA, MVT::v8f32, Legal);
1165 setOperationAction(ISD::FMA, MVT::v4f64, Legal);
1166 setOperationAction(ISD::FMA, MVT::v4f32, Legal);
1167 setOperationAction(ISD::FMA, MVT::v2f64, Legal);
1168 setOperationAction(ISD::FMA, MVT::f32, Legal);
1169 setOperationAction(ISD::FMA, MVT::f64, Legal);
1172 if (Subtarget->hasInt256()) {
1173 setOperationAction(ISD::ADD, MVT::v4i64, Legal);
1174 setOperationAction(ISD::ADD, MVT::v8i32, Legal);
1175 setOperationAction(ISD::ADD, MVT::v16i16, Legal);
1176 setOperationAction(ISD::ADD, MVT::v32i8, Legal);
1178 setOperationAction(ISD::SUB, MVT::v4i64, Legal);
1179 setOperationAction(ISD::SUB, MVT::v8i32, Legal);
1180 setOperationAction(ISD::SUB, MVT::v16i16, Legal);
1181 setOperationAction(ISD::SUB, MVT::v32i8, Legal);
1183 setOperationAction(ISD::MUL, MVT::v4i64, Custom);
1184 setOperationAction(ISD::MUL, MVT::v8i32, Legal);
1185 setOperationAction(ISD::MUL, MVT::v16i16, Legal);
1186 setOperationAction(ISD::MUL, MVT::v32i8, Custom);
1188 setOperationAction(ISD::UMUL_LOHI, MVT::v8i32, Custom);
1189 setOperationAction(ISD::SMUL_LOHI, MVT::v8i32, Custom);
1190 setOperationAction(ISD::MULHU, MVT::v16i16, Legal);
1191 setOperationAction(ISD::MULHS, MVT::v16i16, Legal);
1193 setOperationAction(ISD::SMAX, MVT::v32i8, Legal);
1194 setOperationAction(ISD::SMAX, MVT::v16i16, Legal);
1195 setOperationAction(ISD::SMAX, MVT::v8i32, Legal);
1196 setOperationAction(ISD::UMAX, MVT::v32i8, Legal);
1197 setOperationAction(ISD::UMAX, MVT::v16i16, Legal);
1198 setOperationAction(ISD::UMAX, MVT::v8i32, Legal);
1199 setOperationAction(ISD::SMIN, MVT::v32i8, Legal);
1200 setOperationAction(ISD::SMIN, MVT::v16i16, Legal);
1201 setOperationAction(ISD::SMIN, MVT::v8i32, Legal);
1202 setOperationAction(ISD::UMIN, MVT::v32i8, Legal);
1203 setOperationAction(ISD::UMIN, MVT::v16i16, Legal);
1204 setOperationAction(ISD::UMIN, MVT::v8i32, Legal);
1206 // The custom lowering for UINT_TO_FP for v8i32 becomes interesting
1207 // when we have a 256bit-wide blend with immediate.
1208 setOperationAction(ISD::UINT_TO_FP, MVT::v8i32, Custom);
1210 // AVX2 also has wider vector sign/zero extending loads, VPMOV[SZ]X
1211 setLoadExtAction(ISD::SEXTLOAD, MVT::v16i16, MVT::v16i8, Legal);
1212 setLoadExtAction(ISD::SEXTLOAD, MVT::v8i32, MVT::v8i8, Legal);
1213 setLoadExtAction(ISD::SEXTLOAD, MVT::v4i64, MVT::v4i8, Legal);
1214 setLoadExtAction(ISD::SEXTLOAD, MVT::v8i32, MVT::v8i16, Legal);
1215 setLoadExtAction(ISD::SEXTLOAD, MVT::v4i64, MVT::v4i16, Legal);
1216 setLoadExtAction(ISD::SEXTLOAD, MVT::v4i64, MVT::v4i32, Legal);
1218 setLoadExtAction(ISD::ZEXTLOAD, MVT::v16i16, MVT::v16i8, Legal);
1219 setLoadExtAction(ISD::ZEXTLOAD, MVT::v8i32, MVT::v8i8, Legal);
1220 setLoadExtAction(ISD::ZEXTLOAD, MVT::v4i64, MVT::v4i8, Legal);
1221 setLoadExtAction(ISD::ZEXTLOAD, MVT::v8i32, MVT::v8i16, Legal);
1222 setLoadExtAction(ISD::ZEXTLOAD, MVT::v4i64, MVT::v4i16, Legal);
1223 setLoadExtAction(ISD::ZEXTLOAD, MVT::v4i64, MVT::v4i32, Legal);
1225 setOperationAction(ISD::ADD, MVT::v4i64, Custom);
1226 setOperationAction(ISD::ADD, MVT::v8i32, Custom);
1227 setOperationAction(ISD::ADD, MVT::v16i16, Custom);
1228 setOperationAction(ISD::ADD, MVT::v32i8, Custom);
1230 setOperationAction(ISD::SUB, MVT::v4i64, Custom);
1231 setOperationAction(ISD::SUB, MVT::v8i32, Custom);
1232 setOperationAction(ISD::SUB, MVT::v16i16, Custom);
1233 setOperationAction(ISD::SUB, MVT::v32i8, Custom);
1235 setOperationAction(ISD::MUL, MVT::v4i64, Custom);
1236 setOperationAction(ISD::MUL, MVT::v8i32, Custom);
1237 setOperationAction(ISD::MUL, MVT::v16i16, Custom);
1238 setOperationAction(ISD::MUL, MVT::v32i8, Custom);
1240 setOperationAction(ISD::SMAX, MVT::v32i8, Custom);
1241 setOperationAction(ISD::SMAX, MVT::v16i16, Custom);
1242 setOperationAction(ISD::SMAX, MVT::v8i32, Custom);
1243 setOperationAction(ISD::UMAX, MVT::v32i8, Custom);
1244 setOperationAction(ISD::UMAX, MVT::v16i16, Custom);
1245 setOperationAction(ISD::UMAX, MVT::v8i32, Custom);
1246 setOperationAction(ISD::SMIN, MVT::v32i8, Custom);
1247 setOperationAction(ISD::SMIN, MVT::v16i16, Custom);
1248 setOperationAction(ISD::SMIN, MVT::v8i32, Custom);
1249 setOperationAction(ISD::UMIN, MVT::v32i8, Custom);
1250 setOperationAction(ISD::UMIN, MVT::v16i16, Custom);
1251 setOperationAction(ISD::UMIN, MVT::v8i32, Custom);
1254 // In the customized shift lowering, the legal cases in AVX2 will be
1256 setOperationAction(ISD::SRL, MVT::v4i64, Custom);
1257 setOperationAction(ISD::SRL, MVT::v8i32, Custom);
1259 setOperationAction(ISD::SHL, MVT::v4i64, Custom);
1260 setOperationAction(ISD::SHL, MVT::v8i32, Custom);
1262 setOperationAction(ISD::SRA, MVT::v4i64, Custom);
1263 setOperationAction(ISD::SRA, MVT::v8i32, Custom);
1265 // Custom lower several nodes for 256-bit types.
1266 for (MVT VT : MVT::vector_valuetypes()) {
1267 if (VT.getScalarSizeInBits() >= 32) {
1268 setOperationAction(ISD::MLOAD, VT, Legal);
1269 setOperationAction(ISD::MSTORE, VT, Legal);
1271 // Extract subvector is special because the value type
1272 // (result) is 128-bit but the source is 256-bit wide.
1273 if (VT.is128BitVector()) {
1274 setOperationAction(ISD::EXTRACT_SUBVECTOR, VT, Custom);
1276 // Do not attempt to custom lower other non-256-bit vectors
1277 if (!VT.is256BitVector())
1280 setOperationAction(ISD::BUILD_VECTOR, VT, Custom);
1281 setOperationAction(ISD::VECTOR_SHUFFLE, VT, Custom);
1282 setOperationAction(ISD::VSELECT, VT, Custom);
1283 setOperationAction(ISD::INSERT_VECTOR_ELT, VT, Custom);
1284 setOperationAction(ISD::EXTRACT_VECTOR_ELT, VT, Custom);
1285 setOperationAction(ISD::SCALAR_TO_VECTOR, VT, Custom);
1286 setOperationAction(ISD::INSERT_SUBVECTOR, VT, Custom);
1287 setOperationAction(ISD::CONCAT_VECTORS, VT, Custom);
1290 if (Subtarget->hasInt256())
1291 setOperationAction(ISD::VSELECT, MVT::v32i8, Legal);
1293 // Promote v32i8, v16i16, v8i32 select, and, or, xor to v4i64.
1294 for (auto VT : { MVT::v32i8, MVT::v16i16, MVT::v8i32 }) {
1295 setOperationAction(ISD::AND, VT, Promote);
1296 AddPromotedToType (ISD::AND, VT, MVT::v4i64);
1297 setOperationAction(ISD::OR, VT, Promote);
1298 AddPromotedToType (ISD::OR, VT, MVT::v4i64);
1299 setOperationAction(ISD::XOR, VT, Promote);
1300 AddPromotedToType (ISD::XOR, VT, MVT::v4i64);
1301 setOperationAction(ISD::LOAD, VT, Promote);
1302 AddPromotedToType (ISD::LOAD, VT, MVT::v4i64);
1303 setOperationAction(ISD::SELECT, VT, Promote);
1304 AddPromotedToType (ISD::SELECT, VT, MVT::v4i64);
1308 if (!Subtarget->useSoftFloat() && Subtarget->hasAVX512()) {
1309 addRegisterClass(MVT::v16i32, &X86::VR512RegClass);
1310 addRegisterClass(MVT::v16f32, &X86::VR512RegClass);
1311 addRegisterClass(MVT::v8i64, &X86::VR512RegClass);
1312 addRegisterClass(MVT::v8f64, &X86::VR512RegClass);
1314 addRegisterClass(MVT::i1, &X86::VK1RegClass);
1315 addRegisterClass(MVT::v8i1, &X86::VK8RegClass);
1316 addRegisterClass(MVT::v16i1, &X86::VK16RegClass);
1318 for (MVT VT : MVT::fp_vector_valuetypes())
1319 setLoadExtAction(ISD::EXTLOAD, VT, MVT::v8f32, Legal);
1321 setLoadExtAction(ISD::ZEXTLOAD, MVT::v16i32, MVT::v16i8, Legal);
1322 setLoadExtAction(ISD::SEXTLOAD, MVT::v16i32, MVT::v16i8, Legal);
1323 setLoadExtAction(ISD::ZEXTLOAD, MVT::v16i32, MVT::v16i16, Legal);
1324 setLoadExtAction(ISD::SEXTLOAD, MVT::v16i32, MVT::v16i16, Legal);
1325 setLoadExtAction(ISD::ZEXTLOAD, MVT::v32i16, MVT::v32i8, Legal);
1326 setLoadExtAction(ISD::SEXTLOAD, MVT::v32i16, MVT::v32i8, Legal);
1327 setLoadExtAction(ISD::ZEXTLOAD, MVT::v8i64, MVT::v8i8, Legal);
1328 setLoadExtAction(ISD::SEXTLOAD, MVT::v8i64, MVT::v8i8, Legal);
1329 setLoadExtAction(ISD::ZEXTLOAD, MVT::v8i64, MVT::v8i16, Legal);
1330 setLoadExtAction(ISD::SEXTLOAD, MVT::v8i64, MVT::v8i16, Legal);
1331 setLoadExtAction(ISD::ZEXTLOAD, MVT::v8i64, MVT::v8i32, Legal);
1332 setLoadExtAction(ISD::SEXTLOAD, MVT::v8i64, MVT::v8i32, Legal);
1334 setOperationAction(ISD::BR_CC, MVT::i1, Expand);
1335 setOperationAction(ISD::SETCC, MVT::i1, Custom);
1336 setOperationAction(ISD::SELECT_CC, MVT::i1, Expand);
1337 setOperationAction(ISD::XOR, MVT::i1, Legal);
1338 setOperationAction(ISD::OR, MVT::i1, Legal);
1339 setOperationAction(ISD::AND, MVT::i1, Legal);
1340 setOperationAction(ISD::SUB, MVT::i1, Custom);
1341 setOperationAction(ISD::ADD, MVT::i1, Custom);
1342 setOperationAction(ISD::MUL, MVT::i1, Custom);
1343 setOperationAction(ISD::LOAD, MVT::v16f32, Legal);
1344 setOperationAction(ISD::LOAD, MVT::v8f64, Legal);
1345 setOperationAction(ISD::LOAD, MVT::v8i64, Legal);
1346 setOperationAction(ISD::LOAD, MVT::v16i32, Legal);
1347 setOperationAction(ISD::LOAD, MVT::v16i1, Legal);
1349 setOperationAction(ISD::FADD, MVT::v16f32, Legal);
1350 setOperationAction(ISD::FSUB, MVT::v16f32, Legal);
1351 setOperationAction(ISD::FMUL, MVT::v16f32, Legal);
1352 setOperationAction(ISD::FDIV, MVT::v16f32, Legal);
1353 setOperationAction(ISD::FSQRT, MVT::v16f32, Legal);
1354 setOperationAction(ISD::FNEG, MVT::v16f32, Custom);
1355 setOperationAction(ISD::FABS, MVT::v16f32, Custom);
1357 setOperationAction(ISD::FADD, MVT::v8f64, Legal);
1358 setOperationAction(ISD::FSUB, MVT::v8f64, Legal);
1359 setOperationAction(ISD::FMUL, MVT::v8f64, Legal);
1360 setOperationAction(ISD::FDIV, MVT::v8f64, Legal);
1361 setOperationAction(ISD::FSQRT, MVT::v8f64, Legal);
1362 setOperationAction(ISD::FNEG, MVT::v8f64, Custom);
1363 setOperationAction(ISD::FABS, MVT::v8f64, Custom);
1364 setOperationAction(ISD::FMA, MVT::v8f64, Legal);
1365 setOperationAction(ISD::FMA, MVT::v16f32, Legal);
1367 setOperationAction(ISD::FP_TO_SINT, MVT::v16i32, Legal);
1368 setOperationAction(ISD::FP_TO_UINT, MVT::v16i32, Legal);
1369 setOperationAction(ISD::FP_TO_UINT, MVT::v8i32, Legal);
1370 setOperationAction(ISD::FP_TO_UINT, MVT::v4i32, Legal);
1371 setOperationAction(ISD::SINT_TO_FP, MVT::v16i32, Legal);
1372 setOperationAction(ISD::SINT_TO_FP, MVT::v8i1, Custom);
1373 setOperationAction(ISD::SINT_TO_FP, MVT::v16i1, Custom);
1374 setOperationAction(ISD::SINT_TO_FP, MVT::v16i8, Promote);
1375 setOperationAction(ISD::SINT_TO_FP, MVT::v16i16, Promote);
1376 setOperationAction(ISD::UINT_TO_FP, MVT::v16i32, Legal);
1377 setOperationAction(ISD::UINT_TO_FP, MVT::v8i32, Legal);
1378 setOperationAction(ISD::UINT_TO_FP, MVT::v4i32, Legal);
1379 setOperationAction(ISD::UINT_TO_FP, MVT::v16i8, Custom);
1380 setOperationAction(ISD::UINT_TO_FP, MVT::v16i16, Custom);
1381 setOperationAction(ISD::FP_ROUND, MVT::v8f32, Legal);
1382 setOperationAction(ISD::FP_EXTEND, MVT::v8f32, Legal);
1384 setTruncStoreAction(MVT::v8i64, MVT::v8i8, Legal);
1385 setTruncStoreAction(MVT::v8i64, MVT::v8i16, Legal);
1386 setTruncStoreAction(MVT::v8i64, MVT::v8i32, Legal);
1387 setTruncStoreAction(MVT::v16i32, MVT::v16i8, Legal);
1388 setTruncStoreAction(MVT::v16i32, MVT::v16i16, Legal);
1389 if (Subtarget->hasVLX()){
1390 setTruncStoreAction(MVT::v4i64, MVT::v4i8, Legal);
1391 setTruncStoreAction(MVT::v4i64, MVT::v4i16, Legal);
1392 setTruncStoreAction(MVT::v4i64, MVT::v4i32, Legal);
1393 setTruncStoreAction(MVT::v8i32, MVT::v8i8, Legal);
1394 setTruncStoreAction(MVT::v8i32, MVT::v8i16, Legal);
1396 setTruncStoreAction(MVT::v2i64, MVT::v2i8, Legal);
1397 setTruncStoreAction(MVT::v2i64, MVT::v2i16, Legal);
1398 setTruncStoreAction(MVT::v2i64, MVT::v2i32, Legal);
1399 setTruncStoreAction(MVT::v4i32, MVT::v4i8, Legal);
1400 setTruncStoreAction(MVT::v4i32, MVT::v4i16, Legal);
1402 setOperationAction(ISD::MLOAD, MVT::v8i32, Custom);
1403 setOperationAction(ISD::MLOAD, MVT::v8f32, Custom);
1404 setOperationAction(ISD::MSTORE, MVT::v8i32, Custom);
1405 setOperationAction(ISD::MSTORE, MVT::v8f32, Custom);
1407 setOperationAction(ISD::TRUNCATE, MVT::i1, Custom);
1408 setOperationAction(ISD::TRUNCATE, MVT::v16i8, Custom);
1409 setOperationAction(ISD::TRUNCATE, MVT::v8i32, Custom);
1410 setOperationAction(ISD::VECTOR_SHUFFLE, MVT::v8i1, Custom);
1411 setOperationAction(ISD::VECTOR_SHUFFLE, MVT::v16i1, Custom);
1412 if (Subtarget->hasDQI()) {
1413 setOperationAction(ISD::TRUNCATE, MVT::v2i1, Custom);
1414 setOperationAction(ISD::TRUNCATE, MVT::v4i1, Custom);
1416 setOperationAction(ISD::SINT_TO_FP, MVT::v8i64, Legal);
1417 setOperationAction(ISD::UINT_TO_FP, MVT::v8i64, Legal);
1418 setOperationAction(ISD::FP_TO_SINT, MVT::v8i64, Legal);
1419 setOperationAction(ISD::FP_TO_UINT, MVT::v8i64, Legal);
1420 if (Subtarget->hasVLX()) {
1421 setOperationAction(ISD::SINT_TO_FP, MVT::v4i64, Legal);
1422 setOperationAction(ISD::SINT_TO_FP, MVT::v2i64, Legal);
1423 setOperationAction(ISD::UINT_TO_FP, MVT::v4i64, Legal);
1424 setOperationAction(ISD::UINT_TO_FP, MVT::v2i64, Legal);
1425 setOperationAction(ISD::FP_TO_SINT, MVT::v4i64, Legal);
1426 setOperationAction(ISD::FP_TO_SINT, MVT::v2i64, Legal);
1427 setOperationAction(ISD::FP_TO_UINT, MVT::v4i64, Legal);
1428 setOperationAction(ISD::FP_TO_UINT, MVT::v2i64, Legal);
1431 if (Subtarget->hasVLX()) {
1432 setOperationAction(ISD::SINT_TO_FP, MVT::v8i32, Legal);
1433 setOperationAction(ISD::UINT_TO_FP, MVT::v8i32, Legal);
1434 setOperationAction(ISD::FP_TO_SINT, MVT::v8i32, Legal);
1435 setOperationAction(ISD::FP_TO_UINT, MVT::v8i32, Legal);
1436 setOperationAction(ISD::SINT_TO_FP, MVT::v4i32, Legal);
1437 setOperationAction(ISD::UINT_TO_FP, MVT::v4i32, Legal);
1438 setOperationAction(ISD::FP_TO_SINT, MVT::v4i32, Legal);
1439 setOperationAction(ISD::FP_TO_UINT, MVT::v4i32, Legal);
1441 setOperationAction(ISD::TRUNCATE, MVT::v8i1, Custom);
1442 setOperationAction(ISD::TRUNCATE, MVT::v16i1, Custom);
1443 setOperationAction(ISD::TRUNCATE, MVT::v16i16, Custom);
1444 setOperationAction(ISD::ZERO_EXTEND, MVT::v16i32, Custom);
1445 setOperationAction(ISD::ZERO_EXTEND, MVT::v8i64, Custom);
1446 setOperationAction(ISD::ANY_EXTEND, MVT::v16i32, Custom);
1447 setOperationAction(ISD::ANY_EXTEND, MVT::v8i64, Custom);
1448 setOperationAction(ISD::SIGN_EXTEND, MVT::v16i32, Custom);
1449 setOperationAction(ISD::SIGN_EXTEND, MVT::v8i64, Custom);
1450 setOperationAction(ISD::SIGN_EXTEND, MVT::v16i8, Custom);
1451 setOperationAction(ISD::SIGN_EXTEND, MVT::v8i16, Custom);
1452 setOperationAction(ISD::SIGN_EXTEND, MVT::v16i16, Custom);
1453 if (Subtarget->hasDQI()) {
1454 setOperationAction(ISD::SIGN_EXTEND, MVT::v4i32, Custom);
1455 setOperationAction(ISD::SIGN_EXTEND, MVT::v2i64, Custom);
1457 setOperationAction(ISD::FFLOOR, MVT::v16f32, Legal);
1458 setOperationAction(ISD::FFLOOR, MVT::v8f64, Legal);
1459 setOperationAction(ISD::FCEIL, MVT::v16f32, Legal);
1460 setOperationAction(ISD::FCEIL, MVT::v8f64, Legal);
1461 setOperationAction(ISD::FTRUNC, MVT::v16f32, Legal);
1462 setOperationAction(ISD::FTRUNC, MVT::v8f64, Legal);
1463 setOperationAction(ISD::FRINT, MVT::v16f32, Legal);
1464 setOperationAction(ISD::FRINT, MVT::v8f64, Legal);
1465 setOperationAction(ISD::FNEARBYINT, MVT::v16f32, Legal);
1466 setOperationAction(ISD::FNEARBYINT, MVT::v8f64, Legal);
1468 setOperationAction(ISD::CONCAT_VECTORS, MVT::v8f64, Custom);
1469 setOperationAction(ISD::CONCAT_VECTORS, MVT::v8i64, Custom);
1470 setOperationAction(ISD::CONCAT_VECTORS, MVT::v16f32, Custom);
1471 setOperationAction(ISD::CONCAT_VECTORS, MVT::v16i32, Custom);
1472 setOperationAction(ISD::CONCAT_VECTORS, MVT::v16i1, Custom);
1474 setOperationAction(ISD::SETCC, MVT::v16i1, Custom);
1475 setOperationAction(ISD::SETCC, MVT::v8i1, Custom);
1477 setOperationAction(ISD::MUL, MVT::v8i64, Custom);
1479 setOperationAction(ISD::EXTRACT_VECTOR_ELT, MVT::v8i1, Custom);
1480 setOperationAction(ISD::EXTRACT_VECTOR_ELT, MVT::v16i1, Custom);
1481 setOperationAction(ISD::INSERT_SUBVECTOR, MVT::v16i1, Custom);
1482 setOperationAction(ISD::INSERT_VECTOR_ELT, MVT::v16i1, Custom);
1483 setOperationAction(ISD::INSERT_VECTOR_ELT, MVT::v8i1, Custom);
1484 setOperationAction(ISD::BUILD_VECTOR, MVT::v8i1, Custom);
1485 setOperationAction(ISD::BUILD_VECTOR, MVT::v16i1, Custom);
1486 setOperationAction(ISD::SELECT, MVT::v8f64, Custom);
1487 setOperationAction(ISD::SELECT, MVT::v8i64, Custom);
1488 setOperationAction(ISD::SELECT, MVT::v16f32, Custom);
1489 setOperationAction(ISD::SELECT, MVT::v16i1, Custom);
1490 setOperationAction(ISD::SELECT, MVT::v8i1, Custom);
1492 setOperationAction(ISD::SMAX, MVT::v16i32, Legal);
1493 setOperationAction(ISD::SMAX, MVT::v8i64, Legal);
1494 setOperationAction(ISD::UMAX, MVT::v16i32, Legal);
1495 setOperationAction(ISD::UMAX, MVT::v8i64, Legal);
1496 setOperationAction(ISD::SMIN, MVT::v16i32, Legal);
1497 setOperationAction(ISD::SMIN, MVT::v8i64, Legal);
1498 setOperationAction(ISD::UMIN, MVT::v16i32, Legal);
1499 setOperationAction(ISD::UMIN, MVT::v8i64, Legal);
1501 setOperationAction(ISD::ADD, MVT::v8i64, Legal);
1502 setOperationAction(ISD::ADD, MVT::v16i32, Legal);
1504 setOperationAction(ISD::SUB, MVT::v8i64, Legal);
1505 setOperationAction(ISD::SUB, MVT::v16i32, Legal);
1507 setOperationAction(ISD::MUL, MVT::v16i32, Legal);
1509 setOperationAction(ISD::SRL, MVT::v8i64, Custom);
1510 setOperationAction(ISD::SRL, MVT::v16i32, Custom);
1512 setOperationAction(ISD::SHL, MVT::v8i64, Custom);
1513 setOperationAction(ISD::SHL, MVT::v16i32, Custom);
1515 setOperationAction(ISD::SRA, MVT::v8i64, Custom);
1516 setOperationAction(ISD::SRA, MVT::v16i32, Custom);
1518 setOperationAction(ISD::AND, MVT::v8i64, Legal);
1519 setOperationAction(ISD::OR, MVT::v8i64, Legal);
1520 setOperationAction(ISD::XOR, MVT::v8i64, Legal);
1521 setOperationAction(ISD::AND, MVT::v16i32, Legal);
1522 setOperationAction(ISD::OR, MVT::v16i32, Legal);
1523 setOperationAction(ISD::XOR, MVT::v16i32, Legal);
1525 if (Subtarget->hasCDI()) {
1526 setOperationAction(ISD::CTLZ, MVT::v8i64, Legal);
1527 setOperationAction(ISD::CTLZ, MVT::v16i32, Legal);
1528 setOperationAction(ISD::CTLZ_ZERO_UNDEF, MVT::v8i64, Legal);
1529 setOperationAction(ISD::CTLZ_ZERO_UNDEF, MVT::v16i32, Legal);
1531 setOperationAction(ISD::CTLZ, MVT::v8i16, Custom);
1532 setOperationAction(ISD::CTLZ, MVT::v16i8, Custom);
1533 setOperationAction(ISD::CTLZ, MVT::v16i16, Custom);
1534 setOperationAction(ISD::CTLZ, MVT::v32i8, Custom);
1535 setOperationAction(ISD::CTLZ_ZERO_UNDEF, MVT::v8i16, Custom);
1536 setOperationAction(ISD::CTLZ_ZERO_UNDEF, MVT::v16i8, Custom);
1537 setOperationAction(ISD::CTLZ_ZERO_UNDEF, MVT::v16i16, Custom);
1538 setOperationAction(ISD::CTLZ_ZERO_UNDEF, MVT::v32i8, Custom);
1540 setOperationAction(ISD::CTTZ_ZERO_UNDEF, MVT::v8i64, Custom);
1541 setOperationAction(ISD::CTTZ_ZERO_UNDEF, MVT::v16i32, Custom);
1543 if (Subtarget->hasVLX()) {
1544 setOperationAction(ISD::CTLZ, MVT::v4i64, Legal);
1545 setOperationAction(ISD::CTLZ, MVT::v8i32, Legal);
1546 setOperationAction(ISD::CTLZ, MVT::v2i64, Legal);
1547 setOperationAction(ISD::CTLZ, MVT::v4i32, Legal);
1548 setOperationAction(ISD::CTLZ_ZERO_UNDEF, MVT::v4i64, Legal);
1549 setOperationAction(ISD::CTLZ_ZERO_UNDEF, MVT::v8i32, Legal);
1550 setOperationAction(ISD::CTLZ_ZERO_UNDEF, MVT::v2i64, Legal);
1551 setOperationAction(ISD::CTLZ_ZERO_UNDEF, MVT::v4i32, Legal);
1553 setOperationAction(ISD::CTTZ_ZERO_UNDEF, MVT::v4i64, Custom);
1554 setOperationAction(ISD::CTTZ_ZERO_UNDEF, MVT::v8i32, Custom);
1555 setOperationAction(ISD::CTTZ_ZERO_UNDEF, MVT::v2i64, Custom);
1556 setOperationAction(ISD::CTTZ_ZERO_UNDEF, MVT::v4i32, Custom);
1558 setOperationAction(ISD::CTLZ, MVT::v4i64, Custom);
1559 setOperationAction(ISD::CTLZ, MVT::v8i32, Custom);
1560 setOperationAction(ISD::CTLZ, MVT::v2i64, Custom);
1561 setOperationAction(ISD::CTLZ, MVT::v4i32, Custom);
1562 setOperationAction(ISD::CTLZ_ZERO_UNDEF, MVT::v4i64, Custom);
1563 setOperationAction(ISD::CTLZ_ZERO_UNDEF, MVT::v8i32, Custom);
1564 setOperationAction(ISD::CTLZ_ZERO_UNDEF, MVT::v2i64, Custom);
1565 setOperationAction(ISD::CTLZ_ZERO_UNDEF, MVT::v4i32, Custom);
1567 } // Subtarget->hasCDI()
1569 if (Subtarget->hasDQI()) {
1570 setOperationAction(ISD::MUL, MVT::v2i64, Legal);
1571 setOperationAction(ISD::MUL, MVT::v4i64, Legal);
1572 setOperationAction(ISD::MUL, MVT::v8i64, Legal);
1574 // Custom lower several nodes.
1575 for (MVT VT : MVT::vector_valuetypes()) {
1576 unsigned EltSize = VT.getVectorElementType().getSizeInBits();
1578 setOperationAction(ISD::AND, VT, Legal);
1579 setOperationAction(ISD::OR, VT, Legal);
1580 setOperationAction(ISD::XOR, VT, Legal);
1582 if ((VT.is128BitVector() || VT.is256BitVector()) && EltSize >= 32) {
1583 setOperationAction(ISD::MGATHER, VT, Custom);
1584 setOperationAction(ISD::MSCATTER, VT, Custom);
1586 // Extract subvector is special because the value type
1587 // (result) is 256/128-bit but the source is 512-bit wide.
1588 if (VT.is128BitVector() || VT.is256BitVector()) {
1589 setOperationAction(ISD::EXTRACT_SUBVECTOR, VT, Custom);
1591 if (VT.getVectorElementType() == MVT::i1)
1592 setOperationAction(ISD::EXTRACT_SUBVECTOR, VT, Legal);
1594 // Do not attempt to custom lower other non-512-bit vectors
1595 if (!VT.is512BitVector())
1598 if (EltSize >= 32) {
1599 setOperationAction(ISD::VECTOR_SHUFFLE, VT, Custom);
1600 setOperationAction(ISD::INSERT_VECTOR_ELT, VT, Custom);
1601 setOperationAction(ISD::BUILD_VECTOR, VT, Custom);
1602 setOperationAction(ISD::VSELECT, VT, Legal);
1603 setOperationAction(ISD::EXTRACT_VECTOR_ELT, VT, Custom);
1604 setOperationAction(ISD::SCALAR_TO_VECTOR, VT, Custom);
1605 setOperationAction(ISD::INSERT_SUBVECTOR, VT, Custom);
1606 setOperationAction(ISD::MLOAD, VT, Legal);
1607 setOperationAction(ISD::MSTORE, VT, Legal);
1608 setOperationAction(ISD::MGATHER, VT, Legal);
1609 setOperationAction(ISD::MSCATTER, VT, Custom);
1612 for (auto VT : { MVT::v64i8, MVT::v32i16, MVT::v16i32 }) {
1613 setOperationAction(ISD::SELECT, VT, Promote);
1614 AddPromotedToType (ISD::SELECT, VT, MVT::v8i64);
1618 if (!Subtarget->useSoftFloat() && Subtarget->hasBWI()) {
1619 addRegisterClass(MVT::v32i16, &X86::VR512RegClass);
1620 addRegisterClass(MVT::v64i8, &X86::VR512RegClass);
1622 addRegisterClass(MVT::v32i1, &X86::VK32RegClass);
1623 addRegisterClass(MVT::v64i1, &X86::VK64RegClass);
1625 setOperationAction(ISD::LOAD, MVT::v32i16, Legal);
1626 setOperationAction(ISD::LOAD, MVT::v64i8, Legal);
1627 setOperationAction(ISD::SETCC, MVT::v32i1, Custom);
1628 setOperationAction(ISD::SETCC, MVT::v64i1, Custom);
1629 setOperationAction(ISD::ADD, MVT::v32i16, Legal);
1630 setOperationAction(ISD::ADD, MVT::v64i8, Legal);
1631 setOperationAction(ISD::SUB, MVT::v32i16, Legal);
1632 setOperationAction(ISD::SUB, MVT::v64i8, Legal);
1633 setOperationAction(ISD::MUL, MVT::v32i16, Legal);
1634 setOperationAction(ISD::MULHS, MVT::v32i16, Legal);
1635 setOperationAction(ISD::MULHU, MVT::v32i16, Legal);
1636 setOperationAction(ISD::CONCAT_VECTORS, MVT::v32i1, Custom);
1637 setOperationAction(ISD::CONCAT_VECTORS, MVT::v64i1, Custom);
1638 setOperationAction(ISD::CONCAT_VECTORS, MVT::v32i16, Custom);
1639 setOperationAction(ISD::CONCAT_VECTORS, MVT::v64i8, Custom);
1640 setOperationAction(ISD::INSERT_SUBVECTOR, MVT::v32i1, Custom);
1641 setOperationAction(ISD::INSERT_SUBVECTOR, MVT::v64i1, Custom);
1642 setOperationAction(ISD::INSERT_SUBVECTOR, MVT::v32i16, Custom);
1643 setOperationAction(ISD::INSERT_SUBVECTOR, MVT::v64i8, Custom);
1644 setOperationAction(ISD::EXTRACT_VECTOR_ELT, MVT::v32i16, Custom);
1645 setOperationAction(ISD::EXTRACT_VECTOR_ELT, MVT::v64i8, Custom);
1646 setOperationAction(ISD::SELECT, MVT::v32i1, Custom);
1647 setOperationAction(ISD::SELECT, MVT::v64i1, Custom);
1648 setOperationAction(ISD::SIGN_EXTEND, MVT::v32i8, Custom);
1649 setOperationAction(ISD::ZERO_EXTEND, MVT::v32i8, Custom);
1650 setOperationAction(ISD::SIGN_EXTEND, MVT::v32i16, Custom);
1651 setOperationAction(ISD::ZERO_EXTEND, MVT::v32i16, Custom);
1652 setOperationAction(ISD::VECTOR_SHUFFLE, MVT::v32i16, Custom);
1653 setOperationAction(ISD::VECTOR_SHUFFLE, MVT::v64i8, Custom);
1654 setOperationAction(ISD::SIGN_EXTEND, MVT::v64i8, Custom);
1655 setOperationAction(ISD::ZERO_EXTEND, MVT::v64i8, Custom);
1656 setOperationAction(ISD::INSERT_VECTOR_ELT, MVT::v32i1, Custom);
1657 setOperationAction(ISD::INSERT_VECTOR_ELT, MVT::v64i1, Custom);
1658 setOperationAction(ISD::INSERT_VECTOR_ELT, MVT::v32i16, Custom);
1659 setOperationAction(ISD::INSERT_VECTOR_ELT, MVT::v64i8, Custom);
1660 setOperationAction(ISD::VSELECT, MVT::v32i16, Legal);
1661 setOperationAction(ISD::VSELECT, MVT::v64i8, Legal);
1662 setOperationAction(ISD::TRUNCATE, MVT::v32i1, Custom);
1663 setOperationAction(ISD::TRUNCATE, MVT::v64i1, Custom);
1664 setOperationAction(ISD::TRUNCATE, MVT::v32i8, Custom);
1665 setOperationAction(ISD::VECTOR_SHUFFLE, MVT::v32i1, Custom);
1666 setOperationAction(ISD::VECTOR_SHUFFLE, MVT::v64i1, Custom);
1668 setOperationAction(ISD::SMAX, MVT::v64i8, Legal);
1669 setOperationAction(ISD::SMAX, MVT::v32i16, Legal);
1670 setOperationAction(ISD::UMAX, MVT::v64i8, Legal);
1671 setOperationAction(ISD::UMAX, MVT::v32i16, Legal);
1672 setOperationAction(ISD::SMIN, MVT::v64i8, Legal);
1673 setOperationAction(ISD::SMIN, MVT::v32i16, Legal);
1674 setOperationAction(ISD::UMIN, MVT::v64i8, Legal);
1675 setOperationAction(ISD::UMIN, MVT::v32i16, Legal);
1677 setTruncStoreAction(MVT::v32i16, MVT::v32i8, Legal);
1678 setTruncStoreAction(MVT::v16i16, MVT::v16i8, Legal);
1679 if (Subtarget->hasVLX())
1680 setTruncStoreAction(MVT::v8i16, MVT::v8i8, Legal);
1682 if (Subtarget->hasCDI()) {
1683 setOperationAction(ISD::CTLZ, MVT::v32i16, Custom);
1684 setOperationAction(ISD::CTLZ, MVT::v64i8, Custom);
1685 setOperationAction(ISD::CTLZ_ZERO_UNDEF, MVT::v32i16, Custom);
1686 setOperationAction(ISD::CTLZ_ZERO_UNDEF, MVT::v64i8, Custom);
1689 for (auto VT : { MVT::v64i8, MVT::v32i16 }) {
1690 setOperationAction(ISD::BUILD_VECTOR, VT, Custom);
1691 setOperationAction(ISD::VSELECT, VT, Legal);
1695 if (!Subtarget->useSoftFloat() && Subtarget->hasVLX()) {
1696 addRegisterClass(MVT::v4i1, &X86::VK4RegClass);
1697 addRegisterClass(MVT::v2i1, &X86::VK2RegClass);
1699 setOperationAction(ISD::SETCC, MVT::v4i1, Custom);
1700 setOperationAction(ISD::SETCC, MVT::v2i1, Custom);
1701 setOperationAction(ISD::CONCAT_VECTORS, MVT::v4i1, Custom);
1702 setOperationAction(ISD::CONCAT_VECTORS, MVT::v8i1, Custom);
1703 setOperationAction(ISD::INSERT_SUBVECTOR, MVT::v8i1, Custom);
1704 setOperationAction(ISD::INSERT_SUBVECTOR, MVT::v4i1, Custom);
1705 setOperationAction(ISD::SELECT, MVT::v4i1, Custom);
1706 setOperationAction(ISD::SELECT, MVT::v2i1, Custom);
1707 setOperationAction(ISD::BUILD_VECTOR, MVT::v4i1, Custom);
1708 setOperationAction(ISD::BUILD_VECTOR, MVT::v2i1, Custom);
1709 setOperationAction(ISD::VECTOR_SHUFFLE, MVT::v2i1, Custom);
1710 setOperationAction(ISD::VECTOR_SHUFFLE, MVT::v4i1, Custom);
1712 setOperationAction(ISD::AND, MVT::v8i32, Legal);
1713 setOperationAction(ISD::OR, MVT::v8i32, Legal);
1714 setOperationAction(ISD::XOR, MVT::v8i32, Legal);
1715 setOperationAction(ISD::AND, MVT::v4i32, Legal);
1716 setOperationAction(ISD::OR, MVT::v4i32, Legal);
1717 setOperationAction(ISD::XOR, MVT::v4i32, Legal);
1718 setOperationAction(ISD::SRA, MVT::v2i64, Custom);
1719 setOperationAction(ISD::SRA, MVT::v4i64, Custom);
1721 setOperationAction(ISD::SMAX, MVT::v2i64, Legal);
1722 setOperationAction(ISD::SMAX, MVT::v4i64, Legal);
1723 setOperationAction(ISD::UMAX, MVT::v2i64, Legal);
1724 setOperationAction(ISD::UMAX, MVT::v4i64, Legal);
1725 setOperationAction(ISD::SMIN, MVT::v2i64, Legal);
1726 setOperationAction(ISD::SMIN, MVT::v4i64, Legal);
1727 setOperationAction(ISD::UMIN, MVT::v2i64, Legal);
1728 setOperationAction(ISD::UMIN, MVT::v4i64, Legal);
1731 // We want to custom lower some of our intrinsics.
1732 setOperationAction(ISD::INTRINSIC_WO_CHAIN, MVT::Other, Custom);
1733 setOperationAction(ISD::INTRINSIC_W_CHAIN, MVT::Other, Custom);
1734 setOperationAction(ISD::INTRINSIC_VOID, MVT::Other, Custom);
1735 if (!Subtarget->is64Bit()) {
1736 setOperationAction(ISD::INTRINSIC_W_CHAIN, MVT::i64, Custom);
1737 setOperationAction(ISD::INTRINSIC_WO_CHAIN, MVT::i64, Custom);
1740 // Only custom-lower 64-bit SADDO and friends on 64-bit because we don't
1741 // handle type legalization for these operations here.
1743 // FIXME: We really should do custom legalization for addition and
1744 // subtraction on x86-32 once PR3203 is fixed. We really can't do much better
1745 // than generic legalization for 64-bit multiplication-with-overflow, though.
1746 for (auto VT : { MVT::i8, MVT::i16, MVT::i32, MVT::i64 }) {
1747 if (VT == MVT::i64 && !Subtarget->is64Bit())
1749 // Add/Sub/Mul with overflow operations are custom lowered.
1750 setOperationAction(ISD::SADDO, VT, Custom);
1751 setOperationAction(ISD::UADDO, VT, Custom);
1752 setOperationAction(ISD::SSUBO, VT, Custom);
1753 setOperationAction(ISD::USUBO, VT, Custom);
1754 setOperationAction(ISD::SMULO, VT, Custom);
1755 setOperationAction(ISD::UMULO, VT, Custom);
1758 if (!Subtarget->is64Bit()) {
1759 // These libcalls are not available in 32-bit.
1760 setLibcallName(RTLIB::SHL_I128, nullptr);
1761 setLibcallName(RTLIB::SRL_I128, nullptr);
1762 setLibcallName(RTLIB::SRA_I128, nullptr);
1765 // Combine sin / cos into one node or libcall if possible.
1766 if (Subtarget->hasSinCos()) {
1767 setLibcallName(RTLIB::SINCOS_F32, "sincosf");
1768 setLibcallName(RTLIB::SINCOS_F64, "sincos");
1769 if (Subtarget->isTargetDarwin()) {
1770 // For MacOSX, we don't want the normal expansion of a libcall to sincos.
1771 // We want to issue a libcall to __sincos_stret to avoid memory traffic.
1772 setOperationAction(ISD::FSINCOS, MVT::f64, Custom);
1773 setOperationAction(ISD::FSINCOS, MVT::f32, Custom);
1777 if (Subtarget->isTargetWin64()) {
1778 setOperationAction(ISD::SDIV, MVT::i128, Custom);
1779 setOperationAction(ISD::UDIV, MVT::i128, Custom);
1780 setOperationAction(ISD::SREM, MVT::i128, Custom);
1781 setOperationAction(ISD::UREM, MVT::i128, Custom);
1782 setOperationAction(ISD::SDIVREM, MVT::i128, Custom);
1783 setOperationAction(ISD::UDIVREM, MVT::i128, Custom);
1786 // We have target-specific dag combine patterns for the following nodes:
1787 setTargetDAGCombine(ISD::VECTOR_SHUFFLE);
1788 setTargetDAGCombine(ISD::EXTRACT_VECTOR_ELT);
1789 setTargetDAGCombine(ISD::BITCAST);
1790 setTargetDAGCombine(ISD::VSELECT);
1791 setTargetDAGCombine(ISD::SELECT);
1792 setTargetDAGCombine(ISD::SHL);
1793 setTargetDAGCombine(ISD::SRA);
1794 setTargetDAGCombine(ISD::SRL);
1795 setTargetDAGCombine(ISD::OR);
1796 setTargetDAGCombine(ISD::AND);
1797 setTargetDAGCombine(ISD::ADD);
1798 setTargetDAGCombine(ISD::FADD);
1799 setTargetDAGCombine(ISD::FSUB);
1800 setTargetDAGCombine(ISD::FNEG);
1801 setTargetDAGCombine(ISD::FMA);
1802 setTargetDAGCombine(ISD::FMAXNUM);
1803 setTargetDAGCombine(ISD::SUB);
1804 setTargetDAGCombine(ISD::LOAD);
1805 setTargetDAGCombine(ISD::MLOAD);
1806 setTargetDAGCombine(ISD::STORE);
1807 setTargetDAGCombine(ISD::MSTORE);
1808 setTargetDAGCombine(ISD::TRUNCATE);
1809 setTargetDAGCombine(ISD::ZERO_EXTEND);
1810 setTargetDAGCombine(ISD::ANY_EXTEND);
1811 setTargetDAGCombine(ISD::SIGN_EXTEND);
1812 setTargetDAGCombine(ISD::SIGN_EXTEND_INREG);
1813 setTargetDAGCombine(ISD::SINT_TO_FP);
1814 setTargetDAGCombine(ISD::UINT_TO_FP);
1815 setTargetDAGCombine(ISD::SETCC);
1816 setTargetDAGCombine(ISD::BUILD_VECTOR);
1817 setTargetDAGCombine(ISD::MUL);
1818 setTargetDAGCombine(ISD::XOR);
1819 setTargetDAGCombine(ISD::MSCATTER);
1820 setTargetDAGCombine(ISD::MGATHER);
1822 computeRegisterProperties(Subtarget->getRegisterInfo());
1824 MaxStoresPerMemset = 16; // For @llvm.memset -> sequence of stores
1825 MaxStoresPerMemsetOptSize = 8;
1826 MaxStoresPerMemcpy = 8; // For @llvm.memcpy -> sequence of stores
1827 MaxStoresPerMemcpyOptSize = 4;
1828 MaxStoresPerMemmove = 8; // For @llvm.memmove -> sequence of stores
1829 MaxStoresPerMemmoveOptSize = 4;
1830 setPrefLoopAlignment(4); // 2^4 bytes.
1832 // A predictable cmov does not hurt on an in-order CPU.
1833 // FIXME: Use a CPU attribute to trigger this, not a CPU model.
1834 PredictableSelectIsExpensive = !Subtarget->isAtom();
1835 EnableExtLdPromotion = true;
1836 setPrefFunctionAlignment(4); // 2^4 bytes.
1838 verifyIntrinsicTables();
1841 // This has so far only been implemented for 64-bit MachO.
1842 bool X86TargetLowering::useLoadStackGuardNode() const {
1843 return Subtarget->isTargetMachO() && Subtarget->is64Bit();
1846 TargetLoweringBase::LegalizeTypeAction
1847 X86TargetLowering::getPreferredVectorAction(EVT VT) const {
1848 if (ExperimentalVectorWideningLegalization &&
1849 VT.getVectorNumElements() != 1 &&
1850 VT.getVectorElementType().getSimpleVT() != MVT::i1)
1851 return TypeWidenVector;
1853 return TargetLoweringBase::getPreferredVectorAction(VT);
1856 EVT X86TargetLowering::getSetCCResultType(const DataLayout &DL, LLVMContext &,
1859 return Subtarget->hasAVX512() ? MVT::i1: MVT::i8;
1861 if (VT.isSimple()) {
1862 MVT VVT = VT.getSimpleVT();
1863 const unsigned NumElts = VVT.getVectorNumElements();
1864 const MVT EltVT = VVT.getVectorElementType();
1865 if (VVT.is512BitVector()) {
1866 if (Subtarget->hasAVX512())
1867 if (EltVT == MVT::i32 || EltVT == MVT::i64 ||
1868 EltVT == MVT::f32 || EltVT == MVT::f64)
1870 case 8: return MVT::v8i1;
1871 case 16: return MVT::v16i1;
1873 if (Subtarget->hasBWI())
1874 if (EltVT == MVT::i8 || EltVT == MVT::i16)
1876 case 32: return MVT::v32i1;
1877 case 64: return MVT::v64i1;
1881 if (VVT.is256BitVector() || VVT.is128BitVector()) {
1882 if (Subtarget->hasVLX())
1883 if (EltVT == MVT::i32 || EltVT == MVT::i64 ||
1884 EltVT == MVT::f32 || EltVT == MVT::f64)
1886 case 2: return MVT::v2i1;
1887 case 4: return MVT::v4i1;
1888 case 8: return MVT::v8i1;
1890 if (Subtarget->hasBWI() && Subtarget->hasVLX())
1891 if (EltVT == MVT::i8 || EltVT == MVT::i16)
1893 case 8: return MVT::v8i1;
1894 case 16: return MVT::v16i1;
1895 case 32: return MVT::v32i1;
1900 return VT.changeVectorElementTypeToInteger();
1903 /// Helper for getByValTypeAlignment to determine
1904 /// the desired ByVal argument alignment.
1905 static void getMaxByValAlign(Type *Ty, unsigned &MaxAlign) {
1908 if (VectorType *VTy = dyn_cast<VectorType>(Ty)) {
1909 if (VTy->getBitWidth() == 128)
1911 } else if (ArrayType *ATy = dyn_cast<ArrayType>(Ty)) {
1912 unsigned EltAlign = 0;
1913 getMaxByValAlign(ATy->getElementType(), EltAlign);
1914 if (EltAlign > MaxAlign)
1915 MaxAlign = EltAlign;
1916 } else if (StructType *STy = dyn_cast<StructType>(Ty)) {
1917 for (auto *EltTy : STy->elements()) {
1918 unsigned EltAlign = 0;
1919 getMaxByValAlign(EltTy, EltAlign);
1920 if (EltAlign > MaxAlign)
1921 MaxAlign = EltAlign;
1928 /// Return the desired alignment for ByVal aggregate
1929 /// function arguments in the caller parameter area. For X86, aggregates
1930 /// that contain SSE vectors are placed at 16-byte boundaries while the rest
1931 /// are at 4-byte boundaries.
1932 unsigned X86TargetLowering::getByValTypeAlignment(Type *Ty,
1933 const DataLayout &DL) const {
1934 if (Subtarget->is64Bit()) {
1935 // Max of 8 and alignment of type.
1936 unsigned TyAlign = DL.getABITypeAlignment(Ty);
1943 if (Subtarget->hasSSE1())
1944 getMaxByValAlign(Ty, Align);
1948 /// Returns the target specific optimal type for load
1949 /// and store operations as a result of memset, memcpy, and memmove
1950 /// lowering. If DstAlign is zero that means it's safe to destination
1951 /// alignment can satisfy any constraint. Similarly if SrcAlign is zero it
1952 /// means there isn't a need to check it against alignment requirement,
1953 /// probably because the source does not need to be loaded. If 'IsMemset' is
1954 /// true, that means it's expanding a memset. If 'ZeroMemset' is true, that
1955 /// means it's a memset of zero. 'MemcpyStrSrc' indicates whether the memcpy
1956 /// source is constant so it does not need to be loaded.
1957 /// It returns EVT::Other if the type should be determined using generic
1958 /// target-independent logic.
1960 X86TargetLowering::getOptimalMemOpType(uint64_t Size,
1961 unsigned DstAlign, unsigned SrcAlign,
1962 bool IsMemset, bool ZeroMemset,
1964 MachineFunction &MF) const {
1965 const Function *F = MF.getFunction();
1966 if ((!IsMemset || ZeroMemset) &&
1967 !F->hasFnAttribute(Attribute::NoImplicitFloat)) {
1969 (!Subtarget->isUnalignedMem16Slow() ||
1970 ((DstAlign == 0 || DstAlign >= 16) &&
1971 (SrcAlign == 0 || SrcAlign >= 16)))) {
1973 // FIXME: Check if unaligned 32-byte accesses are slow.
1974 if (Subtarget->hasInt256())
1976 if (Subtarget->hasFp256())
1979 if (Subtarget->hasSSE2())
1981 if (Subtarget->hasSSE1())
1983 } else if (!MemcpyStrSrc && Size >= 8 &&
1984 !Subtarget->is64Bit() &&
1985 Subtarget->hasSSE2()) {
1986 // Do not use f64 to lower memcpy if source is string constant. It's
1987 // better to use i32 to avoid the loads.
1991 // This is a compromise. If we reach here, unaligned accesses may be slow on
1992 // this target. However, creating smaller, aligned accesses could be even
1993 // slower and would certainly be a lot more code.
1994 if (Subtarget->is64Bit() && Size >= 8)
1999 bool X86TargetLowering::isSafeMemOpType(MVT VT) const {
2001 return X86ScalarSSEf32;
2002 else if (VT == MVT::f64)
2003 return X86ScalarSSEf64;
2008 X86TargetLowering::allowsMisalignedMemoryAccesses(EVT VT,
2013 switch (VT.getSizeInBits()) {
2015 // 8-byte and under are always assumed to be fast.
2019 *Fast = !Subtarget->isUnalignedMem16Slow();
2022 *Fast = !Subtarget->isUnalignedMem32Slow();
2024 // TODO: What about AVX-512 (512-bit) accesses?
2027 // Misaligned accesses of any size are always allowed.
2031 /// Return the entry encoding for a jump table in the
2032 /// current function. The returned value is a member of the
2033 /// MachineJumpTableInfo::JTEntryKind enum.
2034 unsigned X86TargetLowering::getJumpTableEncoding() const {
2035 // In GOT pic mode, each entry in the jump table is emitted as a @GOTOFF
2037 if (getTargetMachine().getRelocationModel() == Reloc::PIC_ &&
2038 Subtarget->isPICStyleGOT())
2039 return MachineJumpTableInfo::EK_Custom32;
2041 // Otherwise, use the normal jump table encoding heuristics.
2042 return TargetLowering::getJumpTableEncoding();
2045 bool X86TargetLowering::useSoftFloat() const {
2046 return Subtarget->useSoftFloat();
2050 X86TargetLowering::LowerCustomJumpTableEntry(const MachineJumpTableInfo *MJTI,
2051 const MachineBasicBlock *MBB,
2052 unsigned uid,MCContext &Ctx) const{
2053 assert(MBB->getParent()->getTarget().getRelocationModel() == Reloc::PIC_ &&
2054 Subtarget->isPICStyleGOT());
2055 // In 32-bit ELF systems, our jump table entries are formed with @GOTOFF
2057 return MCSymbolRefExpr::create(MBB->getSymbol(),
2058 MCSymbolRefExpr::VK_GOTOFF, Ctx);
2061 /// Returns relocation base for the given PIC jumptable.
2062 SDValue X86TargetLowering::getPICJumpTableRelocBase(SDValue Table,
2063 SelectionDAG &DAG) const {
2064 if (!Subtarget->is64Bit())
2065 // This doesn't have SDLoc associated with it, but is not really the
2066 // same as a Register.
2067 return DAG.getNode(X86ISD::GlobalBaseReg, SDLoc(),
2068 getPointerTy(DAG.getDataLayout()));
2072 /// This returns the relocation base for the given PIC jumptable,
2073 /// the same as getPICJumpTableRelocBase, but as an MCExpr.
2074 const MCExpr *X86TargetLowering::
2075 getPICJumpTableRelocBaseExpr(const MachineFunction *MF, unsigned JTI,
2076 MCContext &Ctx) const {
2077 // X86-64 uses RIP relative addressing based on the jump table label.
2078 if (Subtarget->isPICStyleRIPRel())
2079 return TargetLowering::getPICJumpTableRelocBaseExpr(MF, JTI, Ctx);
2081 // Otherwise, the reference is relative to the PIC base.
2082 return MCSymbolRefExpr::create(MF->getPICBaseSymbol(), Ctx);
2085 std::pair<const TargetRegisterClass *, uint8_t>
2086 X86TargetLowering::findRepresentativeClass(const TargetRegisterInfo *TRI,
2088 const TargetRegisterClass *RRC = nullptr;
2090 switch (VT.SimpleTy) {
2092 return TargetLowering::findRepresentativeClass(TRI, VT);
2093 case MVT::i8: case MVT::i16: case MVT::i32: case MVT::i64:
2094 RRC = Subtarget->is64Bit() ? &X86::GR64RegClass : &X86::GR32RegClass;
2097 RRC = &X86::VR64RegClass;
2099 case MVT::f32: case MVT::f64:
2100 case MVT::v16i8: case MVT::v8i16: case MVT::v4i32: case MVT::v2i64:
2101 case MVT::v4f32: case MVT::v2f64:
2102 case MVT::v32i8: case MVT::v8i32: case MVT::v4i64: case MVT::v8f32:
2104 RRC = &X86::VR128RegClass;
2107 return std::make_pair(RRC, Cost);
2110 bool X86TargetLowering::getStackCookieLocation(unsigned &AddressSpace,
2111 unsigned &Offset) const {
2112 if (!Subtarget->isTargetLinux())
2115 if (Subtarget->is64Bit()) {
2116 // %fs:0x28, unless we're using a Kernel code model, in which case it's %gs:
2118 if (getTargetMachine().getCodeModel() == CodeModel::Kernel)
2130 Value *X86TargetLowering::getSafeStackPointerLocation(IRBuilder<> &IRB) const {
2131 if (!Subtarget->isTargetAndroid())
2132 return TargetLowering::getSafeStackPointerLocation(IRB);
2134 // Android provides a fixed TLS slot for the SafeStack pointer. See the
2135 // definition of TLS_SLOT_SAFESTACK in
2136 // https://android.googlesource.com/platform/bionic/+/master/libc/private/bionic_tls.h
2137 unsigned AddressSpace, Offset;
2138 if (Subtarget->is64Bit()) {
2139 // %fs:0x48, unless we're using a Kernel code model, in which case it's %gs:
2141 if (getTargetMachine().getCodeModel() == CodeModel::Kernel)
2151 return ConstantExpr::getIntToPtr(
2152 ConstantInt::get(Type::getInt32Ty(IRB.getContext()), Offset),
2153 Type::getInt8PtrTy(IRB.getContext())->getPointerTo(AddressSpace));
2156 bool X86TargetLowering::isNoopAddrSpaceCast(unsigned SrcAS,
2157 unsigned DestAS) const {
2158 assert(SrcAS != DestAS && "Expected different address spaces!");
2160 return SrcAS < 256 && DestAS < 256;
2163 //===----------------------------------------------------------------------===//
2164 // Return Value Calling Convention Implementation
2165 //===----------------------------------------------------------------------===//
2167 #include "X86GenCallingConv.inc"
2169 bool X86TargetLowering::CanLowerReturn(
2170 CallingConv::ID CallConv, MachineFunction &MF, bool isVarArg,
2171 const SmallVectorImpl<ISD::OutputArg> &Outs, LLVMContext &Context) const {
2172 SmallVector<CCValAssign, 16> RVLocs;
2173 CCState CCInfo(CallConv, isVarArg, MF, RVLocs, Context);
2174 return CCInfo.CheckReturn(Outs, RetCC_X86);
2177 const MCPhysReg *X86TargetLowering::getScratchRegisters(CallingConv::ID) const {
2178 static const MCPhysReg ScratchRegs[] = { X86::R11, 0 };
2183 X86TargetLowering::LowerReturn(SDValue Chain,
2184 CallingConv::ID CallConv, bool isVarArg,
2185 const SmallVectorImpl<ISD::OutputArg> &Outs,
2186 const SmallVectorImpl<SDValue> &OutVals,
2187 SDLoc dl, SelectionDAG &DAG) const {
2188 MachineFunction &MF = DAG.getMachineFunction();
2189 X86MachineFunctionInfo *FuncInfo = MF.getInfo<X86MachineFunctionInfo>();
2191 SmallVector<CCValAssign, 16> RVLocs;
2192 CCState CCInfo(CallConv, isVarArg, MF, RVLocs, *DAG.getContext());
2193 CCInfo.AnalyzeReturn(Outs, RetCC_X86);
2196 SmallVector<SDValue, 6> RetOps;
2197 RetOps.push_back(Chain); // Operand #0 = Chain (updated below)
2198 // Operand #1 = Bytes To Pop
2199 RetOps.push_back(DAG.getTargetConstant(FuncInfo->getBytesToPopOnReturn(), dl,
2202 // Copy the result values into the output registers.
2203 for (unsigned i = 0; i != RVLocs.size(); ++i) {
2204 CCValAssign &VA = RVLocs[i];
2205 assert(VA.isRegLoc() && "Can only return in registers!");
2206 SDValue ValToCopy = OutVals[i];
2207 EVT ValVT = ValToCopy.getValueType();
2209 // Promote values to the appropriate types.
2210 if (VA.getLocInfo() == CCValAssign::SExt)
2211 ValToCopy = DAG.getNode(ISD::SIGN_EXTEND, dl, VA.getLocVT(), ValToCopy);
2212 else if (VA.getLocInfo() == CCValAssign::ZExt)
2213 ValToCopy = DAG.getNode(ISD::ZERO_EXTEND, dl, VA.getLocVT(), ValToCopy);
2214 else if (VA.getLocInfo() == CCValAssign::AExt) {
2215 if (ValVT.isVector() && ValVT.getVectorElementType() == MVT::i1)
2216 ValToCopy = DAG.getNode(ISD::SIGN_EXTEND, dl, VA.getLocVT(), ValToCopy);
2218 ValToCopy = DAG.getNode(ISD::ANY_EXTEND, dl, VA.getLocVT(), ValToCopy);
2220 else if (VA.getLocInfo() == CCValAssign::BCvt)
2221 ValToCopy = DAG.getBitcast(VA.getLocVT(), ValToCopy);
2223 assert(VA.getLocInfo() != CCValAssign::FPExt &&
2224 "Unexpected FP-extend for return value.");
2226 // If this is x86-64, and we disabled SSE, we can't return FP values,
2227 // or SSE or MMX vectors.
2228 if ((ValVT == MVT::f32 || ValVT == MVT::f64 ||
2229 VA.getLocReg() == X86::XMM0 || VA.getLocReg() == X86::XMM1) &&
2230 (Subtarget->is64Bit() && !Subtarget->hasSSE1())) {
2231 report_fatal_error("SSE register return with SSE disabled");
2233 // Likewise we can't return F64 values with SSE1 only. gcc does so, but
2234 // llvm-gcc has never done it right and no one has noticed, so this
2235 // should be OK for now.
2236 if (ValVT == MVT::f64 &&
2237 (Subtarget->is64Bit() && !Subtarget->hasSSE2()))
2238 report_fatal_error("SSE2 register return with SSE2 disabled");
2240 // Returns in ST0/ST1 are handled specially: these are pushed as operands to
2241 // the RET instruction and handled by the FP Stackifier.
2242 if (VA.getLocReg() == X86::FP0 ||
2243 VA.getLocReg() == X86::FP1) {
2244 // If this is a copy from an xmm register to ST(0), use an FPExtend to
2245 // change the value to the FP stack register class.
2246 if (isScalarFPTypeInSSEReg(VA.getValVT()))
2247 ValToCopy = DAG.getNode(ISD::FP_EXTEND, dl, MVT::f80, ValToCopy);
2248 RetOps.push_back(ValToCopy);
2249 // Don't emit a copytoreg.
2253 // 64-bit vector (MMX) values are returned in XMM0 / XMM1 except for v1i64
2254 // which is returned in RAX / RDX.
2255 if (Subtarget->is64Bit()) {
2256 if (ValVT == MVT::x86mmx) {
2257 if (VA.getLocReg() == X86::XMM0 || VA.getLocReg() == X86::XMM1) {
2258 ValToCopy = DAG.getBitcast(MVT::i64, ValToCopy);
2259 ValToCopy = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, MVT::v2i64,
2261 // If we don't have SSE2 available, convert to v4f32 so the generated
2262 // register is legal.
2263 if (!Subtarget->hasSSE2())
2264 ValToCopy = DAG.getBitcast(MVT::v4f32, ValToCopy);
2269 Chain = DAG.getCopyToReg(Chain, dl, VA.getLocReg(), ValToCopy, Flag);
2270 Flag = Chain.getValue(1);
2271 RetOps.push_back(DAG.getRegister(VA.getLocReg(), VA.getLocVT()));
2274 // All x86 ABIs require that for returning structs by value we copy
2275 // the sret argument into %rax/%eax (depending on ABI) for the return.
2276 // We saved the argument into a virtual register in the entry block,
2277 // so now we copy the value out and into %rax/%eax.
2279 // Checking Function.hasStructRetAttr() here is insufficient because the IR
2280 // may not have an explicit sret argument. If FuncInfo.CanLowerReturn is
2281 // false, then an sret argument may be implicitly inserted in the SelDAG. In
2282 // either case FuncInfo->setSRetReturnReg() will have been called.
2283 if (unsigned SRetReg = FuncInfo->getSRetReturnReg()) {
2284 SDValue Val = DAG.getCopyFromReg(Chain, dl, SRetReg,
2285 getPointerTy(MF.getDataLayout()));
2288 = (Subtarget->is64Bit() && !Subtarget->isTarget64BitILP32()) ?
2289 X86::RAX : X86::EAX;
2290 Chain = DAG.getCopyToReg(Chain, dl, RetValReg, Val, Flag);
2291 Flag = Chain.getValue(1);
2293 // RAX/EAX now acts like a return value.
2295 DAG.getRegister(RetValReg, getPointerTy(DAG.getDataLayout())));
2298 RetOps[0] = Chain; // Update chain.
2300 // Add the flag if we have it.
2302 RetOps.push_back(Flag);
2304 return DAG.getNode(X86ISD::RET_FLAG, dl, MVT::Other, RetOps);
2307 bool X86TargetLowering::isUsedByReturnOnly(SDNode *N, SDValue &Chain) const {
2308 if (N->getNumValues() != 1)
2310 if (!N->hasNUsesOfValue(1, 0))
2313 SDValue TCChain = Chain;
2314 SDNode *Copy = *N->use_begin();
2315 if (Copy->getOpcode() == ISD::CopyToReg) {
2316 // If the copy has a glue operand, we conservatively assume it isn't safe to
2317 // perform a tail call.
2318 if (Copy->getOperand(Copy->getNumOperands()-1).getValueType() == MVT::Glue)
2320 TCChain = Copy->getOperand(0);
2321 } else if (Copy->getOpcode() != ISD::FP_EXTEND)
2324 bool HasRet = false;
2325 for (SDNode::use_iterator UI = Copy->use_begin(), UE = Copy->use_end();
2327 if (UI->getOpcode() != X86ISD::RET_FLAG)
2329 // If we are returning more than one value, we can definitely
2330 // not make a tail call see PR19530
2331 if (UI->getNumOperands() > 4)
2333 if (UI->getNumOperands() == 4 &&
2334 UI->getOperand(UI->getNumOperands()-1).getValueType() != MVT::Glue)
2347 X86TargetLowering::getTypeForExtArgOrReturn(LLVMContext &Context, EVT VT,
2348 ISD::NodeType ExtendKind) const {
2350 // TODO: Is this also valid on 32-bit?
2351 if (Subtarget->is64Bit() && VT == MVT::i1 && ExtendKind == ISD::ZERO_EXTEND)
2352 ReturnMVT = MVT::i8;
2354 ReturnMVT = MVT::i32;
2356 EVT MinVT = getRegisterType(Context, ReturnMVT);
2357 return VT.bitsLT(MinVT) ? MinVT : VT;
2360 /// Lower the result values of a call into the
2361 /// appropriate copies out of appropriate physical registers.
2364 X86TargetLowering::LowerCallResult(SDValue Chain, SDValue InFlag,
2365 CallingConv::ID CallConv, bool isVarArg,
2366 const SmallVectorImpl<ISD::InputArg> &Ins,
2367 SDLoc dl, SelectionDAG &DAG,
2368 SmallVectorImpl<SDValue> &InVals) const {
2370 // Assign locations to each value returned by this call.
2371 SmallVector<CCValAssign, 16> RVLocs;
2372 bool Is64Bit = Subtarget->is64Bit();
2373 CCState CCInfo(CallConv, isVarArg, DAG.getMachineFunction(), RVLocs,
2375 CCInfo.AnalyzeCallResult(Ins, RetCC_X86);
2377 // Copy all of the result registers out of their specified physreg.
2378 for (unsigned i = 0, e = RVLocs.size(); i != e; ++i) {
2379 CCValAssign &VA = RVLocs[i];
2380 EVT CopyVT = VA.getLocVT();
2382 // If this is x86-64, and we disabled SSE, we can't return FP values
2383 if ((CopyVT == MVT::f32 || CopyVT == MVT::f64 || CopyVT == MVT::f128) &&
2384 ((Is64Bit || Ins[i].Flags.isInReg()) && !Subtarget->hasSSE1())) {
2385 report_fatal_error("SSE register return with SSE disabled");
2388 // If we prefer to use the value in xmm registers, copy it out as f80 and
2389 // use a truncate to move it from fp stack reg to xmm reg.
2390 bool RoundAfterCopy = false;
2391 if ((VA.getLocReg() == X86::FP0 || VA.getLocReg() == X86::FP1) &&
2392 isScalarFPTypeInSSEReg(VA.getValVT())) {
2394 RoundAfterCopy = (CopyVT != VA.getLocVT());
2397 Chain = DAG.getCopyFromReg(Chain, dl, VA.getLocReg(),
2398 CopyVT, InFlag).getValue(1);
2399 SDValue Val = Chain.getValue(0);
2402 Val = DAG.getNode(ISD::FP_ROUND, dl, VA.getValVT(), Val,
2403 // This truncation won't change the value.
2404 DAG.getIntPtrConstant(1, dl));
2406 if (VA.isExtInLoc() && VA.getValVT().getScalarType() == MVT::i1)
2407 Val = DAG.getNode(ISD::TRUNCATE, dl, VA.getValVT(), Val);
2409 InFlag = Chain.getValue(2);
2410 InVals.push_back(Val);
2416 //===----------------------------------------------------------------------===//
2417 // C & StdCall & Fast Calling Convention implementation
2418 //===----------------------------------------------------------------------===//
2419 // StdCall calling convention seems to be standard for many Windows' API
2420 // routines and around. It differs from C calling convention just a little:
2421 // callee should clean up the stack, not caller. Symbols should be also
2422 // decorated in some fancy way :) It doesn't support any vector arguments.
2423 // For info on fast calling convention see Fast Calling Convention (tail call)
2424 // implementation LowerX86_32FastCCCallTo.
2426 /// CallIsStructReturn - Determines whether a call uses struct return
2428 enum StructReturnType {
2433 static StructReturnType
2434 callIsStructReturn(const SmallVectorImpl<ISD::OutputArg> &Outs) {
2436 return NotStructReturn;
2438 const ISD::ArgFlagsTy &Flags = Outs[0].Flags;
2439 if (!Flags.isSRet())
2440 return NotStructReturn;
2441 if (Flags.isInReg())
2442 return RegStructReturn;
2443 return StackStructReturn;
2446 /// Determines whether a function uses struct return semantics.
2447 static StructReturnType
2448 argsAreStructReturn(const SmallVectorImpl<ISD::InputArg> &Ins) {
2450 return NotStructReturn;
2452 const ISD::ArgFlagsTy &Flags = Ins[0].Flags;
2453 if (!Flags.isSRet())
2454 return NotStructReturn;
2455 if (Flags.isInReg())
2456 return RegStructReturn;
2457 return StackStructReturn;
2460 /// Make a copy of an aggregate at address specified by "Src" to address
2461 /// "Dst" with size and alignment information specified by the specific
2462 /// parameter attribute. The copy will be passed as a byval function parameter.
2464 CreateCopyOfByValArgument(SDValue Src, SDValue Dst, SDValue Chain,
2465 ISD::ArgFlagsTy Flags, SelectionDAG &DAG,
2467 SDValue SizeNode = DAG.getConstant(Flags.getByValSize(), dl, MVT::i32);
2469 return DAG.getMemcpy(Chain, dl, Dst, Src, SizeNode, Flags.getByValAlign(),
2470 /*isVolatile*/false, /*AlwaysInline=*/true,
2471 /*isTailCall*/false,
2472 MachinePointerInfo(), MachinePointerInfo());
2475 /// Return true if the calling convention is one that we can guarantee TCO for.
2476 static bool canGuaranteeTCO(CallingConv::ID CC) {
2477 return (CC == CallingConv::Fast || CC == CallingConv::GHC ||
2478 CC == CallingConv::HiPE || CC == CallingConv::HHVM);
2481 /// Return true if we might ever do TCO for calls with this calling convention.
2482 static bool mayTailCallThisCC(CallingConv::ID CC) {
2484 // C calling conventions:
2485 case CallingConv::C:
2486 case CallingConv::X86_64_Win64:
2487 case CallingConv::X86_64_SysV:
2488 // Callee pop conventions:
2489 case CallingConv::X86_ThisCall:
2490 case CallingConv::X86_StdCall:
2491 case CallingConv::X86_VectorCall:
2492 case CallingConv::X86_FastCall:
2495 return canGuaranteeTCO(CC);
2499 /// Return true if the function is being made into a tailcall target by
2500 /// changing its ABI.
2501 static bool shouldGuaranteeTCO(CallingConv::ID CC, bool GuaranteedTailCallOpt) {
2502 return GuaranteedTailCallOpt && canGuaranteeTCO(CC);
2505 bool X86TargetLowering::mayBeEmittedAsTailCall(CallInst *CI) const {
2507 CI->getParent()->getParent()->getFnAttribute("disable-tail-calls");
2508 if (!CI->isTailCall() || Attr.getValueAsString() == "true")
2512 CallingConv::ID CalleeCC = CS.getCallingConv();
2513 if (!mayTailCallThisCC(CalleeCC))
2520 X86TargetLowering::LowerMemArgument(SDValue Chain,
2521 CallingConv::ID CallConv,
2522 const SmallVectorImpl<ISD::InputArg> &Ins,
2523 SDLoc dl, SelectionDAG &DAG,
2524 const CCValAssign &VA,
2525 MachineFrameInfo *MFI,
2527 // Create the nodes corresponding to a load from this parameter slot.
2528 ISD::ArgFlagsTy Flags = Ins[i].Flags;
2529 bool AlwaysUseMutable = shouldGuaranteeTCO(
2530 CallConv, DAG.getTarget().Options.GuaranteedTailCallOpt);
2531 bool isImmutable = !AlwaysUseMutable && !Flags.isByVal();
2534 // If value is passed by pointer we have address passed instead of the value
2536 bool ExtendedInMem = VA.isExtInLoc() &&
2537 VA.getValVT().getScalarType() == MVT::i1;
2539 if (VA.getLocInfo() == CCValAssign::Indirect || ExtendedInMem)
2540 ValVT = VA.getLocVT();
2542 ValVT = VA.getValVT();
2544 // FIXME: For now, all byval parameter objects are marked mutable. This can be
2545 // changed with more analysis.
2546 // In case of tail call optimization mark all arguments mutable. Since they
2547 // could be overwritten by lowering of arguments in case of a tail call.
2548 if (Flags.isByVal()) {
2549 unsigned Bytes = Flags.getByValSize();
2550 if (Bytes == 0) Bytes = 1; // Don't create zero-sized stack objects.
2551 int FI = MFI->CreateFixedObject(Bytes, VA.getLocMemOffset(), isImmutable);
2552 return DAG.getFrameIndex(FI, getPointerTy(DAG.getDataLayout()));
2554 int FI = MFI->CreateFixedObject(ValVT.getSizeInBits()/8,
2555 VA.getLocMemOffset(), isImmutable);
2556 SDValue FIN = DAG.getFrameIndex(FI, getPointerTy(DAG.getDataLayout()));
2557 SDValue Val = DAG.getLoad(
2558 ValVT, dl, Chain, FIN,
2559 MachinePointerInfo::getFixedStack(DAG.getMachineFunction(), FI), false,
2561 return ExtendedInMem ?
2562 DAG.getNode(ISD::TRUNCATE, dl, VA.getValVT(), Val) : Val;
2566 // FIXME: Get this from tablegen.
2567 static ArrayRef<MCPhysReg> get64BitArgumentGPRs(CallingConv::ID CallConv,
2568 const X86Subtarget *Subtarget) {
2569 assert(Subtarget->is64Bit());
2571 if (Subtarget->isCallingConvWin64(CallConv)) {
2572 static const MCPhysReg GPR64ArgRegsWin64[] = {
2573 X86::RCX, X86::RDX, X86::R8, X86::R9
2575 return makeArrayRef(std::begin(GPR64ArgRegsWin64), std::end(GPR64ArgRegsWin64));
2578 static const MCPhysReg GPR64ArgRegs64Bit[] = {
2579 X86::RDI, X86::RSI, X86::RDX, X86::RCX, X86::R8, X86::R9
2581 return makeArrayRef(std::begin(GPR64ArgRegs64Bit), std::end(GPR64ArgRegs64Bit));
2584 // FIXME: Get this from tablegen.
2585 static ArrayRef<MCPhysReg> get64BitArgumentXMMs(MachineFunction &MF,
2586 CallingConv::ID CallConv,
2587 const X86Subtarget *Subtarget) {
2588 assert(Subtarget->is64Bit());
2589 if (Subtarget->isCallingConvWin64(CallConv)) {
2590 // The XMM registers which might contain var arg parameters are shadowed
2591 // in their paired GPR. So we only need to save the GPR to their home
2593 // TODO: __vectorcall will change this.
2597 const Function *Fn = MF.getFunction();
2598 bool NoImplicitFloatOps = Fn->hasFnAttribute(Attribute::NoImplicitFloat);
2599 bool isSoftFloat = Subtarget->useSoftFloat();
2600 assert(!(isSoftFloat && NoImplicitFloatOps) &&
2601 "SSE register cannot be used when SSE is disabled!");
2602 if (isSoftFloat || NoImplicitFloatOps || !Subtarget->hasSSE1())
2603 // Kernel mode asks for SSE to be disabled, so there are no XMM argument
2607 static const MCPhysReg XMMArgRegs64Bit[] = {
2608 X86::XMM0, X86::XMM1, X86::XMM2, X86::XMM3,
2609 X86::XMM4, X86::XMM5, X86::XMM6, X86::XMM7
2611 return makeArrayRef(std::begin(XMMArgRegs64Bit), std::end(XMMArgRegs64Bit));
2614 SDValue X86TargetLowering::LowerFormalArguments(
2615 SDValue Chain, CallingConv::ID CallConv, bool isVarArg,
2616 const SmallVectorImpl<ISD::InputArg> &Ins, SDLoc dl, SelectionDAG &DAG,
2617 SmallVectorImpl<SDValue> &InVals) const {
2618 MachineFunction &MF = DAG.getMachineFunction();
2619 X86MachineFunctionInfo *FuncInfo = MF.getInfo<X86MachineFunctionInfo>();
2620 const TargetFrameLowering &TFI = *Subtarget->getFrameLowering();
2622 const Function* Fn = MF.getFunction();
2623 if (Fn->hasExternalLinkage() &&
2624 Subtarget->isTargetCygMing() &&
2625 Fn->getName() == "main")
2626 FuncInfo->setForceFramePointer(true);
2628 MachineFrameInfo *MFI = MF.getFrameInfo();
2629 bool Is64Bit = Subtarget->is64Bit();
2630 bool IsWin64 = Subtarget->isCallingConvWin64(CallConv);
2632 assert(!(isVarArg && canGuaranteeTCO(CallConv)) &&
2633 "Var args not supported with calling convention fastcc, ghc or hipe");
2635 // Assign locations to all of the incoming arguments.
2636 SmallVector<CCValAssign, 16> ArgLocs;
2637 CCState CCInfo(CallConv, isVarArg, MF, ArgLocs, *DAG.getContext());
2639 // Allocate shadow area for Win64
2641 CCInfo.AllocateStack(32, 8);
2643 CCInfo.AnalyzeFormalArguments(Ins, CC_X86);
2645 unsigned LastVal = ~0U;
2647 for (unsigned i = 0, e = ArgLocs.size(); i != e; ++i) {
2648 CCValAssign &VA = ArgLocs[i];
2649 // TODO: If an arg is passed in two places (e.g. reg and stack), skip later
2651 assert(VA.getValNo() != LastVal &&
2652 "Don't support value assigned to multiple locs yet");
2654 LastVal = VA.getValNo();
2656 if (VA.isRegLoc()) {
2657 EVT RegVT = VA.getLocVT();
2658 const TargetRegisterClass *RC;
2659 if (RegVT == MVT::i32)
2660 RC = &X86::GR32RegClass;
2661 else if (Is64Bit && RegVT == MVT::i64)
2662 RC = &X86::GR64RegClass;
2663 else if (RegVT == MVT::f32)
2664 RC = &X86::FR32RegClass;
2665 else if (RegVT == MVT::f64)
2666 RC = &X86::FR64RegClass;
2667 else if (RegVT == MVT::f128)
2668 RC = &X86::FR128RegClass;
2669 else if (RegVT.is512BitVector())
2670 RC = &X86::VR512RegClass;
2671 else if (RegVT.is256BitVector())
2672 RC = &X86::VR256RegClass;
2673 else if (RegVT.is128BitVector())
2674 RC = &X86::VR128RegClass;
2675 else if (RegVT == MVT::x86mmx)
2676 RC = &X86::VR64RegClass;
2677 else if (RegVT == MVT::i1)
2678 RC = &X86::VK1RegClass;
2679 else if (RegVT == MVT::v8i1)
2680 RC = &X86::VK8RegClass;
2681 else if (RegVT == MVT::v16i1)
2682 RC = &X86::VK16RegClass;
2683 else if (RegVT == MVT::v32i1)
2684 RC = &X86::VK32RegClass;
2685 else if (RegVT == MVT::v64i1)
2686 RC = &X86::VK64RegClass;
2688 llvm_unreachable("Unknown argument type!");
2690 unsigned Reg = MF.addLiveIn(VA.getLocReg(), RC);
2691 ArgValue = DAG.getCopyFromReg(Chain, dl, Reg, RegVT);
2693 // If this is an 8 or 16-bit value, it is really passed promoted to 32
2694 // bits. Insert an assert[sz]ext to capture this, then truncate to the
2696 if (VA.getLocInfo() == CCValAssign::SExt)
2697 ArgValue = DAG.getNode(ISD::AssertSext, dl, RegVT, ArgValue,
2698 DAG.getValueType(VA.getValVT()));
2699 else if (VA.getLocInfo() == CCValAssign::ZExt)
2700 ArgValue = DAG.getNode(ISD::AssertZext, dl, RegVT, ArgValue,
2701 DAG.getValueType(VA.getValVT()));
2702 else if (VA.getLocInfo() == CCValAssign::BCvt)
2703 ArgValue = DAG.getBitcast(VA.getValVT(), ArgValue);
2705 if (VA.isExtInLoc()) {
2706 // Handle MMX values passed in XMM regs.
2707 if (RegVT.isVector() && VA.getValVT().getScalarType() != MVT::i1)
2708 ArgValue = DAG.getNode(X86ISD::MOVDQ2Q, dl, VA.getValVT(), ArgValue);
2710 ArgValue = DAG.getNode(ISD::TRUNCATE, dl, VA.getValVT(), ArgValue);
2713 assert(VA.isMemLoc());
2714 ArgValue = LowerMemArgument(Chain, CallConv, Ins, dl, DAG, VA, MFI, i);
2717 // If value is passed via pointer - do a load.
2718 if (VA.getLocInfo() == CCValAssign::Indirect)
2719 ArgValue = DAG.getLoad(VA.getValVT(), dl, Chain, ArgValue,
2720 MachinePointerInfo(), false, false, false, 0);
2722 InVals.push_back(ArgValue);
2725 for (unsigned i = 0, e = ArgLocs.size(); i != e; ++i) {
2726 // All x86 ABIs require that for returning structs by value we copy the
2727 // sret argument into %rax/%eax (depending on ABI) for the return. Save
2728 // the argument into a virtual register so that we can access it from the
2730 if (Ins[i].Flags.isSRet()) {
2731 unsigned Reg = FuncInfo->getSRetReturnReg();
2733 MVT PtrTy = getPointerTy(DAG.getDataLayout());
2734 Reg = MF.getRegInfo().createVirtualRegister(getRegClassFor(PtrTy));
2735 FuncInfo->setSRetReturnReg(Reg);
2737 SDValue Copy = DAG.getCopyToReg(DAG.getEntryNode(), dl, Reg, InVals[i]);
2738 Chain = DAG.getNode(ISD::TokenFactor, dl, MVT::Other, Copy, Chain);
2743 unsigned StackSize = CCInfo.getNextStackOffset();
2744 // Align stack specially for tail calls.
2745 if (shouldGuaranteeTCO(CallConv,
2746 MF.getTarget().Options.GuaranteedTailCallOpt))
2747 StackSize = GetAlignedArgumentStackSize(StackSize, DAG);
2749 // If the function takes variable number of arguments, make a frame index for
2750 // the start of the first vararg value... for expansion of llvm.va_start. We
2751 // can skip this if there are no va_start calls.
2752 if (MFI->hasVAStart() &&
2753 (Is64Bit || (CallConv != CallingConv::X86_FastCall &&
2754 CallConv != CallingConv::X86_ThisCall))) {
2755 FuncInfo->setVarArgsFrameIndex(
2756 MFI->CreateFixedObject(1, StackSize, true));
2759 // Figure out if XMM registers are in use.
2760 assert(!(Subtarget->useSoftFloat() &&
2761 Fn->hasFnAttribute(Attribute::NoImplicitFloat)) &&
2762 "SSE register cannot be used when SSE is disabled!");
2764 // 64-bit calling conventions support varargs and register parameters, so we
2765 // have to do extra work to spill them in the prologue.
2766 if (Is64Bit && isVarArg && MFI->hasVAStart()) {
2767 // Find the first unallocated argument registers.
2768 ArrayRef<MCPhysReg> ArgGPRs = get64BitArgumentGPRs(CallConv, Subtarget);
2769 ArrayRef<MCPhysReg> ArgXMMs = get64BitArgumentXMMs(MF, CallConv, Subtarget);
2770 unsigned NumIntRegs = CCInfo.getFirstUnallocated(ArgGPRs);
2771 unsigned NumXMMRegs = CCInfo.getFirstUnallocated(ArgXMMs);
2772 assert(!(NumXMMRegs && !Subtarget->hasSSE1()) &&
2773 "SSE register cannot be used when SSE is disabled!");
2775 // Gather all the live in physical registers.
2776 SmallVector<SDValue, 6> LiveGPRs;
2777 SmallVector<SDValue, 8> LiveXMMRegs;
2779 for (MCPhysReg Reg : ArgGPRs.slice(NumIntRegs)) {
2780 unsigned GPR = MF.addLiveIn(Reg, &X86::GR64RegClass);
2782 DAG.getCopyFromReg(Chain, dl, GPR, MVT::i64));
2784 if (!ArgXMMs.empty()) {
2785 unsigned AL = MF.addLiveIn(X86::AL, &X86::GR8RegClass);
2786 ALVal = DAG.getCopyFromReg(Chain, dl, AL, MVT::i8);
2787 for (MCPhysReg Reg : ArgXMMs.slice(NumXMMRegs)) {
2788 unsigned XMMReg = MF.addLiveIn(Reg, &X86::VR128RegClass);
2789 LiveXMMRegs.push_back(
2790 DAG.getCopyFromReg(Chain, dl, XMMReg, MVT::v4f32));
2795 // Get to the caller-allocated home save location. Add 8 to account
2796 // for the return address.
2797 int HomeOffset = TFI.getOffsetOfLocalArea() + 8;
2798 FuncInfo->setRegSaveFrameIndex(
2799 MFI->CreateFixedObject(1, NumIntRegs * 8 + HomeOffset, false));
2800 // Fixup to set vararg frame on shadow area (4 x i64).
2802 FuncInfo->setVarArgsFrameIndex(FuncInfo->getRegSaveFrameIndex());
2804 // For X86-64, if there are vararg parameters that are passed via
2805 // registers, then we must store them to their spots on the stack so
2806 // they may be loaded by deferencing the result of va_next.
2807 FuncInfo->setVarArgsGPOffset(NumIntRegs * 8);
2808 FuncInfo->setVarArgsFPOffset(ArgGPRs.size() * 8 + NumXMMRegs * 16);
2809 FuncInfo->setRegSaveFrameIndex(MFI->CreateStackObject(
2810 ArgGPRs.size() * 8 + ArgXMMs.size() * 16, 16, false));
2813 // Store the integer parameter registers.
2814 SmallVector<SDValue, 8> MemOps;
2815 SDValue RSFIN = DAG.getFrameIndex(FuncInfo->getRegSaveFrameIndex(),
2816 getPointerTy(DAG.getDataLayout()));
2817 unsigned Offset = FuncInfo->getVarArgsGPOffset();
2818 for (SDValue Val : LiveGPRs) {
2819 SDValue FIN = DAG.getNode(ISD::ADD, dl, getPointerTy(DAG.getDataLayout()),
2820 RSFIN, DAG.getIntPtrConstant(Offset, dl));
2822 DAG.getStore(Val.getValue(1), dl, Val, FIN,
2823 MachinePointerInfo::getFixedStack(
2824 DAG.getMachineFunction(),
2825 FuncInfo->getRegSaveFrameIndex(), Offset),
2827 MemOps.push_back(Store);
2831 if (!ArgXMMs.empty() && NumXMMRegs != ArgXMMs.size()) {
2832 // Now store the XMM (fp + vector) parameter registers.
2833 SmallVector<SDValue, 12> SaveXMMOps;
2834 SaveXMMOps.push_back(Chain);
2835 SaveXMMOps.push_back(ALVal);
2836 SaveXMMOps.push_back(DAG.getIntPtrConstant(
2837 FuncInfo->getRegSaveFrameIndex(), dl));
2838 SaveXMMOps.push_back(DAG.getIntPtrConstant(
2839 FuncInfo->getVarArgsFPOffset(), dl));
2840 SaveXMMOps.insert(SaveXMMOps.end(), LiveXMMRegs.begin(),
2842 MemOps.push_back(DAG.getNode(X86ISD::VASTART_SAVE_XMM_REGS, dl,
2843 MVT::Other, SaveXMMOps));
2846 if (!MemOps.empty())
2847 Chain = DAG.getNode(ISD::TokenFactor, dl, MVT::Other, MemOps);
2850 if (isVarArg && MFI->hasMustTailInVarArgFunc()) {
2851 // Find the largest legal vector type.
2852 MVT VecVT = MVT::Other;
2853 // FIXME: Only some x86_32 calling conventions support AVX512.
2854 if (Subtarget->hasAVX512() &&
2855 (Is64Bit || (CallConv == CallingConv::X86_VectorCall ||
2856 CallConv == CallingConv::Intel_OCL_BI)))
2857 VecVT = MVT::v16f32;
2858 else if (Subtarget->hasAVX())
2860 else if (Subtarget->hasSSE2())
2863 // We forward some GPRs and some vector types.
2864 SmallVector<MVT, 2> RegParmTypes;
2865 MVT IntVT = Is64Bit ? MVT::i64 : MVT::i32;
2866 RegParmTypes.push_back(IntVT);
2867 if (VecVT != MVT::Other)
2868 RegParmTypes.push_back(VecVT);
2870 // Compute the set of forwarded registers. The rest are scratch.
2871 SmallVectorImpl<ForwardedRegister> &Forwards =
2872 FuncInfo->getForwardedMustTailRegParms();
2873 CCInfo.analyzeMustTailForwardedRegisters(Forwards, RegParmTypes, CC_X86);
2875 // Conservatively forward AL on x86_64, since it might be used for varargs.
2876 if (Is64Bit && !CCInfo.isAllocated(X86::AL)) {
2877 unsigned ALVReg = MF.addLiveIn(X86::AL, &X86::GR8RegClass);
2878 Forwards.push_back(ForwardedRegister(ALVReg, X86::AL, MVT::i8));
2881 // Copy all forwards from physical to virtual registers.
2882 for (ForwardedRegister &F : Forwards) {
2883 // FIXME: Can we use a less constrained schedule?
2884 SDValue RegVal = DAG.getCopyFromReg(Chain, dl, F.VReg, F.VT);
2885 F.VReg = MF.getRegInfo().createVirtualRegister(getRegClassFor(F.VT));
2886 Chain = DAG.getCopyToReg(Chain, dl, F.VReg, RegVal);
2890 // Some CCs need callee pop.
2891 if (X86::isCalleePop(CallConv, Is64Bit, isVarArg,
2892 MF.getTarget().Options.GuaranteedTailCallOpt)) {
2893 FuncInfo->setBytesToPopOnReturn(StackSize); // Callee pops everything.
2895 FuncInfo->setBytesToPopOnReturn(0); // Callee pops nothing.
2896 // If this is an sret function, the return should pop the hidden pointer.
2897 if (!Is64Bit && !canGuaranteeTCO(CallConv) &&
2898 !Subtarget->getTargetTriple().isOSMSVCRT() &&
2899 argsAreStructReturn(Ins) == StackStructReturn)
2900 FuncInfo->setBytesToPopOnReturn(4);
2904 // RegSaveFrameIndex is X86-64 only.
2905 FuncInfo->setRegSaveFrameIndex(0xAAAAAAA);
2906 if (CallConv == CallingConv::X86_FastCall ||
2907 CallConv == CallingConv::X86_ThisCall)
2908 // fastcc functions can't have varargs.
2909 FuncInfo->setVarArgsFrameIndex(0xAAAAAAA);
2912 FuncInfo->setArgumentStackSize(StackSize);
2914 if (WinEHFuncInfo *EHInfo = MF.getWinEHFuncInfo()) {
2915 EHPersonality Personality = classifyEHPersonality(Fn->getPersonalityFn());
2916 if (Personality == EHPersonality::CoreCLR) {
2918 // TODO: Add a mechanism to frame lowering that will allow us to indicate
2919 // that we'd prefer this slot be allocated towards the bottom of the frame
2920 // (i.e. near the stack pointer after allocating the frame). Every
2921 // funclet needs a copy of this slot in its (mostly empty) frame, and the
2922 // offset from the bottom of this and each funclet's frame must be the
2923 // same, so the size of funclets' (mostly empty) frames is dictated by
2924 // how far this slot is from the bottom (since they allocate just enough
2925 // space to accomodate holding this slot at the correct offset).
2926 int PSPSymFI = MFI->CreateStackObject(8, 8, /*isSS=*/false);
2927 EHInfo->PSPSymFrameIdx = PSPSymFI;
2935 X86TargetLowering::LowerMemOpCallTo(SDValue Chain,
2936 SDValue StackPtr, SDValue Arg,
2937 SDLoc dl, SelectionDAG &DAG,
2938 const CCValAssign &VA,
2939 ISD::ArgFlagsTy Flags) const {
2940 unsigned LocMemOffset = VA.getLocMemOffset();
2941 SDValue PtrOff = DAG.getIntPtrConstant(LocMemOffset, dl);
2942 PtrOff = DAG.getNode(ISD::ADD, dl, getPointerTy(DAG.getDataLayout()),
2944 if (Flags.isByVal())
2945 return CreateCopyOfByValArgument(Arg, PtrOff, Chain, Flags, DAG, dl);
2947 return DAG.getStore(
2948 Chain, dl, Arg, PtrOff,
2949 MachinePointerInfo::getStack(DAG.getMachineFunction(), LocMemOffset),
2953 /// Emit a load of return address if tail call
2954 /// optimization is performed and it is required.
2956 X86TargetLowering::EmitTailCallLoadRetAddr(SelectionDAG &DAG,
2957 SDValue &OutRetAddr, SDValue Chain,
2958 bool IsTailCall, bool Is64Bit,
2959 int FPDiff, SDLoc dl) const {
2960 // Adjust the Return address stack slot.
2961 EVT VT = getPointerTy(DAG.getDataLayout());
2962 OutRetAddr = getReturnAddressFrameIndex(DAG);
2964 // Load the "old" Return address.
2965 OutRetAddr = DAG.getLoad(VT, dl, Chain, OutRetAddr, MachinePointerInfo(),
2966 false, false, false, 0);
2967 return SDValue(OutRetAddr.getNode(), 1);
2970 /// Emit a store of the return address if tail call
2971 /// optimization is performed and it is required (FPDiff!=0).
2972 static SDValue EmitTailCallStoreRetAddr(SelectionDAG &DAG, MachineFunction &MF,
2973 SDValue Chain, SDValue RetAddrFrIdx,
2974 EVT PtrVT, unsigned SlotSize,
2975 int FPDiff, SDLoc dl) {
2976 // Store the return address to the appropriate stack slot.
2977 if (!FPDiff) return Chain;
2978 // Calculate the new stack slot for the return address.
2979 int NewReturnAddrFI =
2980 MF.getFrameInfo()->CreateFixedObject(SlotSize, (int64_t)FPDiff - SlotSize,
2982 SDValue NewRetAddrFrIdx = DAG.getFrameIndex(NewReturnAddrFI, PtrVT);
2983 Chain = DAG.getStore(Chain, dl, RetAddrFrIdx, NewRetAddrFrIdx,
2984 MachinePointerInfo::getFixedStack(
2985 DAG.getMachineFunction(), NewReturnAddrFI),
2990 /// Returns a vector_shuffle mask for an movs{s|d}, movd
2991 /// operation of specified width.
2992 static SDValue getMOVL(SelectionDAG &DAG, SDLoc dl, MVT VT, SDValue V1,
2994 unsigned NumElems = VT.getVectorNumElements();
2995 SmallVector<int, 8> Mask;
2996 Mask.push_back(NumElems);
2997 for (unsigned i = 1; i != NumElems; ++i)
2999 return DAG.getVectorShuffle(VT, dl, V1, V2, &Mask[0]);
3003 X86TargetLowering::LowerCall(TargetLowering::CallLoweringInfo &CLI,
3004 SmallVectorImpl<SDValue> &InVals) const {
3005 SelectionDAG &DAG = CLI.DAG;
3007 SmallVectorImpl<ISD::OutputArg> &Outs = CLI.Outs;
3008 SmallVectorImpl<SDValue> &OutVals = CLI.OutVals;
3009 SmallVectorImpl<ISD::InputArg> &Ins = CLI.Ins;
3010 SDValue Chain = CLI.Chain;
3011 SDValue Callee = CLI.Callee;
3012 CallingConv::ID CallConv = CLI.CallConv;
3013 bool &isTailCall = CLI.IsTailCall;
3014 bool isVarArg = CLI.IsVarArg;
3016 MachineFunction &MF = DAG.getMachineFunction();
3017 bool Is64Bit = Subtarget->is64Bit();
3018 bool IsWin64 = Subtarget->isCallingConvWin64(CallConv);
3019 StructReturnType SR = callIsStructReturn(Outs);
3020 bool IsSibcall = false;
3021 X86MachineFunctionInfo *X86Info = MF.getInfo<X86MachineFunctionInfo>();
3022 auto Attr = MF.getFunction()->getFnAttribute("disable-tail-calls");
3024 if (Attr.getValueAsString() == "true")
3027 if (Subtarget->isPICStyleGOT() &&
3028 !MF.getTarget().Options.GuaranteedTailCallOpt) {
3029 // If we are using a GOT, disable tail calls to external symbols with
3030 // default visibility. Tail calling such a symbol requires using a GOT
3031 // relocation, which forces early binding of the symbol. This breaks code
3032 // that require lazy function symbol resolution. Using musttail or
3033 // GuaranteedTailCallOpt will override this.
3034 GlobalAddressSDNode *G = dyn_cast<GlobalAddressSDNode>(Callee);
3035 if (!G || (!G->getGlobal()->hasLocalLinkage() &&
3036 G->getGlobal()->hasDefaultVisibility()))
3040 bool IsMustTail = CLI.CS && CLI.CS->isMustTailCall();
3042 // Force this to be a tail call. The verifier rules are enough to ensure
3043 // that we can lower this successfully without moving the return address
3046 } else if (isTailCall) {
3047 // Check if it's really possible to do a tail call.
3048 isTailCall = IsEligibleForTailCallOptimization(Callee, CallConv,
3049 isVarArg, SR != NotStructReturn,
3050 MF.getFunction()->hasStructRetAttr(), CLI.RetTy,
3051 Outs, OutVals, Ins, DAG);
3053 // Sibcalls are automatically detected tailcalls which do not require
3055 if (!MF.getTarget().Options.GuaranteedTailCallOpt && isTailCall)
3062 assert(!(isVarArg && canGuaranteeTCO(CallConv)) &&
3063 "Var args not supported with calling convention fastcc, ghc or hipe");
3065 // Analyze operands of the call, assigning locations to each operand.
3066 SmallVector<CCValAssign, 16> ArgLocs;
3067 CCState CCInfo(CallConv, isVarArg, MF, ArgLocs, *DAG.getContext());
3069 // Allocate shadow area for Win64
3071 CCInfo.AllocateStack(32, 8);
3073 CCInfo.AnalyzeCallOperands(Outs, CC_X86);
3075 // Get a count of how many bytes are to be pushed on the stack.
3076 unsigned NumBytes = CCInfo.getAlignedCallFrameSize();
3078 // This is a sibcall. The memory operands are available in caller's
3079 // own caller's stack.
3081 else if (MF.getTarget().Options.GuaranteedTailCallOpt &&
3082 canGuaranteeTCO(CallConv))
3083 NumBytes = GetAlignedArgumentStackSize(NumBytes, DAG);
3086 if (isTailCall && !IsSibcall && !IsMustTail) {
3087 // Lower arguments at fp - stackoffset + fpdiff.
3088 unsigned NumBytesCallerPushed = X86Info->getBytesToPopOnReturn();
3090 FPDiff = NumBytesCallerPushed - NumBytes;
3092 // Set the delta of movement of the returnaddr stackslot.
3093 // But only set if delta is greater than previous delta.
3094 if (FPDiff < X86Info->getTCReturnAddrDelta())
3095 X86Info->setTCReturnAddrDelta(FPDiff);
3098 unsigned NumBytesToPush = NumBytes;
3099 unsigned NumBytesToPop = NumBytes;
3101 // If we have an inalloca argument, all stack space has already been allocated
3102 // for us and be right at the top of the stack. We don't support multiple
3103 // arguments passed in memory when using inalloca.
3104 if (!Outs.empty() && Outs.back().Flags.isInAlloca()) {
3106 if (!ArgLocs.back().isMemLoc())
3107 report_fatal_error("cannot use inalloca attribute on a register "
3109 if (ArgLocs.back().getLocMemOffset() != 0)
3110 report_fatal_error("any parameter with the inalloca attribute must be "
3111 "the only memory argument");
3115 Chain = DAG.getCALLSEQ_START(
3116 Chain, DAG.getIntPtrConstant(NumBytesToPush, dl, true), dl);
3118 SDValue RetAddrFrIdx;
3119 // Load return address for tail calls.
3120 if (isTailCall && FPDiff)
3121 Chain = EmitTailCallLoadRetAddr(DAG, RetAddrFrIdx, Chain, isTailCall,
3122 Is64Bit, FPDiff, dl);
3124 SmallVector<std::pair<unsigned, SDValue>, 8> RegsToPass;
3125 SmallVector<SDValue, 8> MemOpChains;
3128 // Walk the register/memloc assignments, inserting copies/loads. In the case
3129 // of tail call optimization arguments are handle later.
3130 const X86RegisterInfo *RegInfo = Subtarget->getRegisterInfo();
3131 for (unsigned i = 0, e = ArgLocs.size(); i != e; ++i) {
3132 // Skip inalloca arguments, they have already been written.
3133 ISD::ArgFlagsTy Flags = Outs[i].Flags;
3134 if (Flags.isInAlloca())
3137 CCValAssign &VA = ArgLocs[i];
3138 EVT RegVT = VA.getLocVT();
3139 SDValue Arg = OutVals[i];
3140 bool isByVal = Flags.isByVal();
3142 // Promote the value if needed.
3143 switch (VA.getLocInfo()) {
3144 default: llvm_unreachable("Unknown loc info!");
3145 case CCValAssign::Full: break;
3146 case CCValAssign::SExt:
3147 Arg = DAG.getNode(ISD::SIGN_EXTEND, dl, RegVT, Arg);
3149 case CCValAssign::ZExt:
3150 Arg = DAG.getNode(ISD::ZERO_EXTEND, dl, RegVT, Arg);
3152 case CCValAssign::AExt:
3153 if (Arg.getValueType().isVector() &&
3154 Arg.getValueType().getVectorElementType() == MVT::i1)
3155 Arg = DAG.getNode(ISD::SIGN_EXTEND, dl, RegVT, Arg);
3156 else if (RegVT.is128BitVector()) {
3157 // Special case: passing MMX values in XMM registers.
3158 Arg = DAG.getBitcast(MVT::i64, Arg);
3159 Arg = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, MVT::v2i64, Arg);
3160 Arg = getMOVL(DAG, dl, MVT::v2i64, DAG.getUNDEF(MVT::v2i64), Arg);
3162 Arg = DAG.getNode(ISD::ANY_EXTEND, dl, RegVT, Arg);
3164 case CCValAssign::BCvt:
3165 Arg = DAG.getBitcast(RegVT, Arg);
3167 case CCValAssign::Indirect: {
3168 // Store the argument.
3169 SDValue SpillSlot = DAG.CreateStackTemporary(VA.getValVT());
3170 int FI = cast<FrameIndexSDNode>(SpillSlot)->getIndex();
3171 Chain = DAG.getStore(
3172 Chain, dl, Arg, SpillSlot,
3173 MachinePointerInfo::getFixedStack(DAG.getMachineFunction(), FI),
3180 if (VA.isRegLoc()) {
3181 RegsToPass.push_back(std::make_pair(VA.getLocReg(), Arg));
3182 if (isVarArg && IsWin64) {
3183 // Win64 ABI requires argument XMM reg to be copied to the corresponding
3184 // shadow reg if callee is a varargs function.
3185 unsigned ShadowReg = 0;
3186 switch (VA.getLocReg()) {
3187 case X86::XMM0: ShadowReg = X86::RCX; break;
3188 case X86::XMM1: ShadowReg = X86::RDX; break;
3189 case X86::XMM2: ShadowReg = X86::R8; break;
3190 case X86::XMM3: ShadowReg = X86::R9; break;
3193 RegsToPass.push_back(std::make_pair(ShadowReg, Arg));
3195 } else if (!IsSibcall && (!isTailCall || isByVal)) {
3196 assert(VA.isMemLoc());
3197 if (!StackPtr.getNode())
3198 StackPtr = DAG.getCopyFromReg(Chain, dl, RegInfo->getStackRegister(),
3199 getPointerTy(DAG.getDataLayout()));
3200 MemOpChains.push_back(LowerMemOpCallTo(Chain, StackPtr, Arg,
3201 dl, DAG, VA, Flags));
3205 if (!MemOpChains.empty())
3206 Chain = DAG.getNode(ISD::TokenFactor, dl, MVT::Other, MemOpChains);
3208 if (Subtarget->isPICStyleGOT()) {
3209 // ELF / PIC requires GOT in the EBX register before function calls via PLT
3212 RegsToPass.push_back(std::make_pair(
3213 unsigned(X86::EBX), DAG.getNode(X86ISD::GlobalBaseReg, SDLoc(),
3214 getPointerTy(DAG.getDataLayout()))));
3216 // If we are tail calling and generating PIC/GOT style code load the
3217 // address of the callee into ECX. The value in ecx is used as target of
3218 // the tail jump. This is done to circumvent the ebx/callee-saved problem
3219 // for tail calls on PIC/GOT architectures. Normally we would just put the
3220 // address of GOT into ebx and then call target@PLT. But for tail calls
3221 // ebx would be restored (since ebx is callee saved) before jumping to the
3224 // Note: The actual moving to ECX is done further down.
3225 GlobalAddressSDNode *G = dyn_cast<GlobalAddressSDNode>(Callee);
3226 if (G && !G->getGlobal()->hasLocalLinkage() &&
3227 G->getGlobal()->hasDefaultVisibility())
3228 Callee = LowerGlobalAddress(Callee, DAG);
3229 else if (isa<ExternalSymbolSDNode>(Callee))
3230 Callee = LowerExternalSymbol(Callee, DAG);
3234 if (Is64Bit && isVarArg && !IsWin64 && !IsMustTail) {
3235 // From AMD64 ABI document:
3236 // For calls that may call functions that use varargs or stdargs
3237 // (prototype-less calls or calls to functions containing ellipsis (...) in
3238 // the declaration) %al is used as hidden argument to specify the number
3239 // of SSE registers used. The contents of %al do not need to match exactly
3240 // the number of registers, but must be an ubound on the number of SSE
3241 // registers used and is in the range 0 - 8 inclusive.
3243 // Count the number of XMM registers allocated.
3244 static const MCPhysReg XMMArgRegs[] = {
3245 X86::XMM0, X86::XMM1, X86::XMM2, X86::XMM3,
3246 X86::XMM4, X86::XMM5, X86::XMM6, X86::XMM7
3248 unsigned NumXMMRegs = CCInfo.getFirstUnallocated(XMMArgRegs);
3249 assert((Subtarget->hasSSE1() || !NumXMMRegs)
3250 && "SSE registers cannot be used when SSE is disabled");
3252 RegsToPass.push_back(std::make_pair(unsigned(X86::AL),
3253 DAG.getConstant(NumXMMRegs, dl,
3257 if (isVarArg && IsMustTail) {
3258 const auto &Forwards = X86Info->getForwardedMustTailRegParms();
3259 for (const auto &F : Forwards) {
3260 SDValue Val = DAG.getCopyFromReg(Chain, dl, F.VReg, F.VT);
3261 RegsToPass.push_back(std::make_pair(unsigned(F.PReg), Val));
3265 // For tail calls lower the arguments to the 'real' stack slots. Sibcalls
3266 // don't need this because the eligibility check rejects calls that require
3267 // shuffling arguments passed in memory.
3268 if (!IsSibcall && isTailCall) {
3269 // Force all the incoming stack arguments to be loaded from the stack
3270 // before any new outgoing arguments are stored to the stack, because the
3271 // outgoing stack slots may alias the incoming argument stack slots, and
3272 // the alias isn't otherwise explicit. This is slightly more conservative
3273 // than necessary, because it means that each store effectively depends
3274 // on every argument instead of just those arguments it would clobber.
3275 SDValue ArgChain = DAG.getStackArgumentTokenFactor(Chain);
3277 SmallVector<SDValue, 8> MemOpChains2;
3280 for (unsigned i = 0, e = ArgLocs.size(); i != e; ++i) {
3281 CCValAssign &VA = ArgLocs[i];
3284 assert(VA.isMemLoc());
3285 SDValue Arg = OutVals[i];
3286 ISD::ArgFlagsTy Flags = Outs[i].Flags;
3287 // Skip inalloca arguments. They don't require any work.
3288 if (Flags.isInAlloca())
3290 // Create frame index.
3291 int32_t Offset = VA.getLocMemOffset()+FPDiff;
3292 uint32_t OpSize = (VA.getLocVT().getSizeInBits()+7)/8;
3293 FI = MF.getFrameInfo()->CreateFixedObject(OpSize, Offset, true);
3294 FIN = DAG.getFrameIndex(FI, getPointerTy(DAG.getDataLayout()));
3296 if (Flags.isByVal()) {
3297 // Copy relative to framepointer.
3298 SDValue Source = DAG.getIntPtrConstant(VA.getLocMemOffset(), dl);
3299 if (!StackPtr.getNode())
3300 StackPtr = DAG.getCopyFromReg(Chain, dl, RegInfo->getStackRegister(),
3301 getPointerTy(DAG.getDataLayout()));
3302 Source = DAG.getNode(ISD::ADD, dl, getPointerTy(DAG.getDataLayout()),
3305 MemOpChains2.push_back(CreateCopyOfByValArgument(Source, FIN,
3309 // Store relative to framepointer.
3310 MemOpChains2.push_back(DAG.getStore(
3311 ArgChain, dl, Arg, FIN,
3312 MachinePointerInfo::getFixedStack(DAG.getMachineFunction(), FI),
3317 if (!MemOpChains2.empty())
3318 Chain = DAG.getNode(ISD::TokenFactor, dl, MVT::Other, MemOpChains2);
3320 // Store the return address to the appropriate stack slot.
3321 Chain = EmitTailCallStoreRetAddr(DAG, MF, Chain, RetAddrFrIdx,
3322 getPointerTy(DAG.getDataLayout()),
3323 RegInfo->getSlotSize(), FPDiff, dl);
3326 // Build a sequence of copy-to-reg nodes chained together with token chain
3327 // and flag operands which copy the outgoing args into registers.
3329 for (unsigned i = 0, e = RegsToPass.size(); i != e; ++i) {
3330 Chain = DAG.getCopyToReg(Chain, dl, RegsToPass[i].first,
3331 RegsToPass[i].second, InFlag);
3332 InFlag = Chain.getValue(1);
3335 if (DAG.getTarget().getCodeModel() == CodeModel::Large) {
3336 assert(Is64Bit && "Large code model is only legal in 64-bit mode.");
3337 // In the 64-bit large code model, we have to make all calls
3338 // through a register, since the call instruction's 32-bit
3339 // pc-relative offset may not be large enough to hold the whole
3341 } else if (Callee->getOpcode() == ISD::GlobalAddress) {
3342 // If the callee is a GlobalAddress node (quite common, every direct call
3343 // is) turn it into a TargetGlobalAddress node so that legalize doesn't hack
3345 GlobalAddressSDNode* G = cast<GlobalAddressSDNode>(Callee);
3347 // We should use extra load for direct calls to dllimported functions in
3349 const GlobalValue *GV = G->getGlobal();
3350 if (!GV->hasDLLImportStorageClass()) {
3351 unsigned char OpFlags = 0;
3352 bool ExtraLoad = false;
3353 unsigned WrapperKind = ISD::DELETED_NODE;
3355 // On ELF targets, in both X86-64 and X86-32 mode, direct calls to
3356 // external symbols most go through the PLT in PIC mode. If the symbol
3357 // has hidden or protected visibility, or if it is static or local, then
3358 // we don't need to use the PLT - we can directly call it.
3359 if (Subtarget->isTargetELF() &&
3360 DAG.getTarget().getRelocationModel() == Reloc::PIC_ &&
3361 GV->hasDefaultVisibility() && !GV->hasLocalLinkage()) {
3362 OpFlags = X86II::MO_PLT;
3363 } else if (Subtarget->isPICStyleStubAny() &&
3364 !GV->isStrongDefinitionForLinker() &&
3365 (!Subtarget->getTargetTriple().isMacOSX() ||
3366 Subtarget->getTargetTriple().isMacOSXVersionLT(10, 5))) {
3367 // PC-relative references to external symbols should go through $stub,
3368 // unless we're building with the leopard linker or later, which
3369 // automatically synthesizes these stubs.
3370 OpFlags = X86II::MO_DARWIN_STUB;
3371 } else if (Subtarget->isPICStyleRIPRel() && isa<Function>(GV) &&
3372 cast<Function>(GV)->hasFnAttribute(Attribute::NonLazyBind)) {
3373 // If the function is marked as non-lazy, generate an indirect call
3374 // which loads from the GOT directly. This avoids runtime overhead
3375 // at the cost of eager binding (and one extra byte of encoding).
3376 OpFlags = X86II::MO_GOTPCREL;
3377 WrapperKind = X86ISD::WrapperRIP;
3381 Callee = DAG.getTargetGlobalAddress(
3382 GV, dl, getPointerTy(DAG.getDataLayout()), G->getOffset(), OpFlags);
3384 // Add a wrapper if needed.
3385 if (WrapperKind != ISD::DELETED_NODE)
3386 Callee = DAG.getNode(X86ISD::WrapperRIP, dl,
3387 getPointerTy(DAG.getDataLayout()), Callee);
3388 // Add extra indirection if needed.
3390 Callee = DAG.getLoad(
3391 getPointerTy(DAG.getDataLayout()), dl, DAG.getEntryNode(), Callee,
3392 MachinePointerInfo::getGOT(DAG.getMachineFunction()), false, false,
3395 } else if (ExternalSymbolSDNode *S = dyn_cast<ExternalSymbolSDNode>(Callee)) {
3396 unsigned char OpFlags = 0;
3398 // On ELF targets, in either X86-64 or X86-32 mode, direct calls to
3399 // external symbols should go through the PLT.
3400 if (Subtarget->isTargetELF() &&
3401 DAG.getTarget().getRelocationModel() == Reloc::PIC_) {
3402 OpFlags = X86II::MO_PLT;
3403 } else if (Subtarget->isPICStyleStubAny() &&
3404 (!Subtarget->getTargetTriple().isMacOSX() ||
3405 Subtarget->getTargetTriple().isMacOSXVersionLT(10, 5))) {
3406 // PC-relative references to external symbols should go through $stub,
3407 // unless we're building with the leopard linker or later, which
3408 // automatically synthesizes these stubs.
3409 OpFlags = X86II::MO_DARWIN_STUB;
3412 Callee = DAG.getTargetExternalSymbol(
3413 S->getSymbol(), getPointerTy(DAG.getDataLayout()), OpFlags);
3414 } else if (Subtarget->isTarget64BitILP32() &&
3415 Callee->getValueType(0) == MVT::i32) {
3416 // Zero-extend the 32-bit Callee address into a 64-bit according to x32 ABI
3417 Callee = DAG.getNode(ISD::ZERO_EXTEND, dl, MVT::i64, Callee);
3420 // Returns a chain & a flag for retval copy to use.
3421 SDVTList NodeTys = DAG.getVTList(MVT::Other, MVT::Glue);
3422 SmallVector<SDValue, 8> Ops;
3424 if (!IsSibcall && isTailCall) {
3425 Chain = DAG.getCALLSEQ_END(Chain,
3426 DAG.getIntPtrConstant(NumBytesToPop, dl, true),
3427 DAG.getIntPtrConstant(0, dl, true), InFlag, dl);
3428 InFlag = Chain.getValue(1);
3431 Ops.push_back(Chain);
3432 Ops.push_back(Callee);
3435 Ops.push_back(DAG.getConstant(FPDiff, dl, MVT::i32));
3437 // Add argument registers to the end of the list so that they are known live
3439 for (unsigned i = 0, e = RegsToPass.size(); i != e; ++i)
3440 Ops.push_back(DAG.getRegister(RegsToPass[i].first,
3441 RegsToPass[i].second.getValueType()));
3443 // Add a register mask operand representing the call-preserved registers.
3444 const uint32_t *Mask = RegInfo->getCallPreservedMask(MF, CallConv);
3445 assert(Mask && "Missing call preserved mask for calling convention");
3447 // If this is an invoke in a 32-bit function using a funclet-based
3448 // personality, assume the function clobbers all registers. If an exception
3449 // is thrown, the runtime will not restore CSRs.
3450 // FIXME: Model this more precisely so that we can register allocate across
3451 // the normal edge and spill and fill across the exceptional edge.
3452 if (!Is64Bit && CLI.CS && CLI.CS->isInvoke()) {
3453 const Function *CallerFn = MF.getFunction();
3454 EHPersonality Pers =
3455 CallerFn->hasPersonalityFn()
3456 ? classifyEHPersonality(CallerFn->getPersonalityFn())
3457 : EHPersonality::Unknown;
3458 if (isFuncletEHPersonality(Pers))
3459 Mask = RegInfo->getNoPreservedMask();
3462 Ops.push_back(DAG.getRegisterMask(Mask));
3464 if (InFlag.getNode())
3465 Ops.push_back(InFlag);
3469 //// If this is the first return lowered for this function, add the regs
3470 //// to the liveout set for the function.
3471 // This isn't right, although it's probably harmless on x86; liveouts
3472 // should be computed from returns not tail calls. Consider a void
3473 // function making a tail call to a function returning int.
3474 MF.getFrameInfo()->setHasTailCall();
3475 return DAG.getNode(X86ISD::TC_RETURN, dl, NodeTys, Ops);
3478 Chain = DAG.getNode(X86ISD::CALL, dl, NodeTys, Ops);
3479 InFlag = Chain.getValue(1);
3481 // Create the CALLSEQ_END node.
3482 unsigned NumBytesForCalleeToPop;
3483 if (X86::isCalleePop(CallConv, Is64Bit, isVarArg,
3484 DAG.getTarget().Options.GuaranteedTailCallOpt))
3485 NumBytesForCalleeToPop = NumBytes; // Callee pops everything
3486 else if (!Is64Bit && !canGuaranteeTCO(CallConv) &&
3487 !Subtarget->getTargetTriple().isOSMSVCRT() &&
3488 SR == StackStructReturn)
3489 // If this is a call to a struct-return function, the callee
3490 // pops the hidden struct pointer, so we have to push it back.
3491 // This is common for Darwin/X86, Linux & Mingw32 targets.
3492 // For MSVC Win32 targets, the caller pops the hidden struct pointer.
3493 NumBytesForCalleeToPop = 4;
3495 NumBytesForCalleeToPop = 0; // Callee pops nothing.
3497 // Returns a flag for retval copy to use.
3499 Chain = DAG.getCALLSEQ_END(Chain,
3500 DAG.getIntPtrConstant(NumBytesToPop, dl, true),
3501 DAG.getIntPtrConstant(NumBytesForCalleeToPop, dl,
3504 InFlag = Chain.getValue(1);
3507 // Handle result values, copying them out of physregs into vregs that we
3509 return LowerCallResult(Chain, InFlag, CallConv, isVarArg,
3510 Ins, dl, DAG, InVals);
3513 //===----------------------------------------------------------------------===//
3514 // Fast Calling Convention (tail call) implementation
3515 //===----------------------------------------------------------------------===//
3517 // Like std call, callee cleans arguments, convention except that ECX is
3518 // reserved for storing the tail called function address. Only 2 registers are
3519 // free for argument passing (inreg). Tail call optimization is performed
3521 // * tailcallopt is enabled
3522 // * caller/callee are fastcc
3523 // On X86_64 architecture with GOT-style position independent code only local
3524 // (within module) calls are supported at the moment.
3525 // To keep the stack aligned according to platform abi the function
3526 // GetAlignedArgumentStackSize ensures that argument delta is always multiples
3527 // of stack alignment. (Dynamic linkers need this - darwin's dyld for example)
3528 // If a tail called function callee has more arguments than the caller the
3529 // caller needs to make sure that there is room to move the RETADDR to. This is
3530 // achieved by reserving an area the size of the argument delta right after the
3531 // original RETADDR, but before the saved framepointer or the spilled registers
3532 // e.g. caller(arg1, arg2) calls callee(arg1, arg2,arg3,arg4)
3544 /// Make the stack size align e.g 16n + 12 aligned for a 16-byte align
3547 X86TargetLowering::GetAlignedArgumentStackSize(unsigned StackSize,
3548 SelectionDAG& DAG) const {
3549 const X86RegisterInfo *RegInfo = Subtarget->getRegisterInfo();
3550 const TargetFrameLowering &TFI = *Subtarget->getFrameLowering();
3551 unsigned StackAlignment = TFI.getStackAlignment();
3552 uint64_t AlignMask = StackAlignment - 1;
3553 int64_t Offset = StackSize;
3554 unsigned SlotSize = RegInfo->getSlotSize();
3555 if ( (Offset & AlignMask) <= (StackAlignment - SlotSize) ) {
3556 // Number smaller than 12 so just add the difference.
3557 Offset += ((StackAlignment - SlotSize) - (Offset & AlignMask));
3559 // Mask out lower bits, add stackalignment once plus the 12 bytes.
3560 Offset = ((~AlignMask) & Offset) + StackAlignment +
3561 (StackAlignment-SlotSize);
3566 /// Return true if the given stack call argument is already available in the
3567 /// same position (relatively) of the caller's incoming argument stack.
3569 bool MatchingStackOffset(SDValue Arg, unsigned Offset, ISD::ArgFlagsTy Flags,
3570 MachineFrameInfo *MFI, const MachineRegisterInfo *MRI,
3571 const X86InstrInfo *TII) {
3572 unsigned Bytes = Arg.getValueType().getSizeInBits() / 8;
3574 if (Arg.getOpcode() == ISD::CopyFromReg) {
3575 unsigned VR = cast<RegisterSDNode>(Arg.getOperand(1))->getReg();
3576 if (!TargetRegisterInfo::isVirtualRegister(VR))
3578 MachineInstr *Def = MRI->getVRegDef(VR);
3581 if (!Flags.isByVal()) {
3582 if (!TII->isLoadFromStackSlot(Def, FI))
3585 unsigned Opcode = Def->getOpcode();
3586 if ((Opcode == X86::LEA32r || Opcode == X86::LEA64r ||
3587 Opcode == X86::LEA64_32r) &&
3588 Def->getOperand(1).isFI()) {
3589 FI = Def->getOperand(1).getIndex();
3590 Bytes = Flags.getByValSize();
3594 } else if (LoadSDNode *Ld = dyn_cast<LoadSDNode>(Arg)) {
3595 if (Flags.isByVal())
3596 // ByVal argument is passed in as a pointer but it's now being
3597 // dereferenced. e.g.
3598 // define @foo(%struct.X* %A) {
3599 // tail call @bar(%struct.X* byval %A)
3602 SDValue Ptr = Ld->getBasePtr();
3603 FrameIndexSDNode *FINode = dyn_cast<FrameIndexSDNode>(Ptr);
3606 FI = FINode->getIndex();
3607 } else if (Arg.getOpcode() == ISD::FrameIndex && Flags.isByVal()) {
3608 FrameIndexSDNode *FINode = cast<FrameIndexSDNode>(Arg);
3609 FI = FINode->getIndex();
3610 Bytes = Flags.getByValSize();
3614 assert(FI != INT_MAX);
3615 if (!MFI->isFixedObjectIndex(FI))
3617 return Offset == MFI->getObjectOffset(FI) && Bytes == MFI->getObjectSize(FI);
3620 /// Check whether the call is eligible for tail call optimization. Targets
3621 /// that want to do tail call optimization should implement this function.
3622 bool X86TargetLowering::IsEligibleForTailCallOptimization(
3623 SDValue Callee, CallingConv::ID CalleeCC, bool isVarArg,
3624 bool isCalleeStructRet, bool isCallerStructRet, Type *RetTy,
3625 const SmallVectorImpl<ISD::OutputArg> &Outs,
3626 const SmallVectorImpl<SDValue> &OutVals,
3627 const SmallVectorImpl<ISD::InputArg> &Ins, SelectionDAG &DAG) const {
3628 if (!mayTailCallThisCC(CalleeCC))
3631 // If -tailcallopt is specified, make fastcc functions tail-callable.
3632 MachineFunction &MF = DAG.getMachineFunction();
3633 const Function *CallerF = MF.getFunction();
3635 // If the function return type is x86_fp80 and the callee return type is not,
3636 // then the FP_EXTEND of the call result is not a nop. It's not safe to
3637 // perform a tailcall optimization here.
3638 if (CallerF->getReturnType()->isX86_FP80Ty() && !RetTy->isX86_FP80Ty())
3641 CallingConv::ID CallerCC = CallerF->getCallingConv();
3642 bool CCMatch = CallerCC == CalleeCC;
3643 bool IsCalleeWin64 = Subtarget->isCallingConvWin64(CalleeCC);
3644 bool IsCallerWin64 = Subtarget->isCallingConvWin64(CallerCC);
3646 // Win64 functions have extra shadow space for argument homing. Don't do the
3647 // sibcall if the caller and callee have mismatched expectations for this
3649 if (IsCalleeWin64 != IsCallerWin64)
3652 if (DAG.getTarget().Options.GuaranteedTailCallOpt) {
3653 if (canGuaranteeTCO(CalleeCC) && CCMatch)
3658 // Look for obvious safe cases to perform tail call optimization that do not
3659 // require ABI changes. This is what gcc calls sibcall.
3661 // Can't do sibcall if stack needs to be dynamically re-aligned. PEI needs to
3662 // emit a special epilogue.
3663 const X86RegisterInfo *RegInfo = Subtarget->getRegisterInfo();
3664 if (RegInfo->needsStackRealignment(MF))
3667 // Also avoid sibcall optimization if either caller or callee uses struct
3668 // return semantics.
3669 if (isCalleeStructRet || isCallerStructRet)
3672 // Do not sibcall optimize vararg calls unless all arguments are passed via
3674 if (isVarArg && !Outs.empty()) {
3675 // Optimizing for varargs on Win64 is unlikely to be safe without
3676 // additional testing.
3677 if (IsCalleeWin64 || IsCallerWin64)
3680 SmallVector<CCValAssign, 16> ArgLocs;
3681 CCState CCInfo(CalleeCC, isVarArg, DAG.getMachineFunction(), ArgLocs,
3684 CCInfo.AnalyzeCallOperands(Outs, CC_X86);
3685 for (unsigned i = 0, e = ArgLocs.size(); i != e; ++i)
3686 if (!ArgLocs[i].isRegLoc())
3690 // If the call result is in ST0 / ST1, it needs to be popped off the x87
3691 // stack. Therefore, if it's not used by the call it is not safe to optimize
3692 // this into a sibcall.
3693 bool Unused = false;
3694 for (unsigned i = 0, e = Ins.size(); i != e; ++i) {
3701 SmallVector<CCValAssign, 16> RVLocs;
3702 CCState CCInfo(CalleeCC, false, DAG.getMachineFunction(), RVLocs,
3704 CCInfo.AnalyzeCallResult(Ins, RetCC_X86);
3705 for (unsigned i = 0, e = RVLocs.size(); i != e; ++i) {
3706 CCValAssign &VA = RVLocs[i];
3707 if (VA.getLocReg() == X86::FP0 || VA.getLocReg() == X86::FP1)
3712 // If the calling conventions do not match, then we'd better make sure the
3713 // results are returned in the same way as what the caller expects.
3715 SmallVector<CCValAssign, 16> RVLocs1;
3716 CCState CCInfo1(CalleeCC, false, DAG.getMachineFunction(), RVLocs1,
3718 CCInfo1.AnalyzeCallResult(Ins, RetCC_X86);
3720 SmallVector<CCValAssign, 16> RVLocs2;
3721 CCState CCInfo2(CallerCC, false, DAG.getMachineFunction(), RVLocs2,
3723 CCInfo2.AnalyzeCallResult(Ins, RetCC_X86);
3725 if (RVLocs1.size() != RVLocs2.size())
3727 for (unsigned i = 0, e = RVLocs1.size(); i != e; ++i) {
3728 if (RVLocs1[i].isRegLoc() != RVLocs2[i].isRegLoc())
3730 if (RVLocs1[i].getLocInfo() != RVLocs2[i].getLocInfo())
3732 if (RVLocs1[i].isRegLoc()) {
3733 if (RVLocs1[i].getLocReg() != RVLocs2[i].getLocReg())
3736 if (RVLocs1[i].getLocMemOffset() != RVLocs2[i].getLocMemOffset())
3742 unsigned StackArgsSize = 0;
3744 // If the callee takes no arguments then go on to check the results of the
3746 if (!Outs.empty()) {
3747 // Check if stack adjustment is needed. For now, do not do this if any
3748 // argument is passed on the stack.
3749 SmallVector<CCValAssign, 16> ArgLocs;
3750 CCState CCInfo(CalleeCC, isVarArg, DAG.getMachineFunction(), ArgLocs,
3753 // Allocate shadow area for Win64
3755 CCInfo.AllocateStack(32, 8);
3757 CCInfo.AnalyzeCallOperands(Outs, CC_X86);
3758 StackArgsSize = CCInfo.getNextStackOffset();
3760 if (CCInfo.getNextStackOffset()) {
3761 // Check if the arguments are already laid out in the right way as
3762 // the caller's fixed stack objects.
3763 MachineFrameInfo *MFI = MF.getFrameInfo();
3764 const MachineRegisterInfo *MRI = &MF.getRegInfo();
3765 const X86InstrInfo *TII = Subtarget->getInstrInfo();
3766 for (unsigned i = 0, e = ArgLocs.size(); i != e; ++i) {
3767 CCValAssign &VA = ArgLocs[i];
3768 SDValue Arg = OutVals[i];
3769 ISD::ArgFlagsTy Flags = Outs[i].Flags;
3770 if (VA.getLocInfo() == CCValAssign::Indirect)
3772 if (!VA.isRegLoc()) {
3773 if (!MatchingStackOffset(Arg, VA.getLocMemOffset(), Flags,
3780 // If the tailcall address may be in a register, then make sure it's
3781 // possible to register allocate for it. In 32-bit, the call address can
3782 // only target EAX, EDX, or ECX since the tail call must be scheduled after
3783 // callee-saved registers are restored. These happen to be the same
3784 // registers used to pass 'inreg' arguments so watch out for those.
3785 if (!Subtarget->is64Bit() &&
3786 ((!isa<GlobalAddressSDNode>(Callee) &&
3787 !isa<ExternalSymbolSDNode>(Callee)) ||
3788 DAG.getTarget().getRelocationModel() == Reloc::PIC_)) {
3789 unsigned NumInRegs = 0;
3790 // In PIC we need an extra register to formulate the address computation
3792 unsigned MaxInRegs =
3793 (DAG.getTarget().getRelocationModel() == Reloc::PIC_) ? 2 : 3;
3795 for (unsigned i = 0, e = ArgLocs.size(); i != e; ++i) {
3796 CCValAssign &VA = ArgLocs[i];
3799 unsigned Reg = VA.getLocReg();
3802 case X86::EAX: case X86::EDX: case X86::ECX:
3803 if (++NumInRegs == MaxInRegs)
3811 bool CalleeWillPop =
3812 X86::isCalleePop(CalleeCC, Subtarget->is64Bit(), isVarArg,
3813 MF.getTarget().Options.GuaranteedTailCallOpt);
3815 if (unsigned BytesToPop =
3816 MF.getInfo<X86MachineFunctionInfo>()->getBytesToPopOnReturn()) {
3817 // If we have bytes to pop, the callee must pop them.
3818 bool CalleePopMatches = CalleeWillPop && BytesToPop == StackArgsSize;
3819 if (!CalleePopMatches)
3821 } else if (CalleeWillPop && StackArgsSize > 0) {
3822 // If we don't have bytes to pop, make sure the callee doesn't pop any.
3830 X86TargetLowering::createFastISel(FunctionLoweringInfo &funcInfo,
3831 const TargetLibraryInfo *libInfo) const {
3832 return X86::createFastISel(funcInfo, libInfo);
3835 //===----------------------------------------------------------------------===//
3836 // Other Lowering Hooks
3837 //===----------------------------------------------------------------------===//
3839 static bool MayFoldLoad(SDValue Op) {
3840 return Op.hasOneUse() && ISD::isNormalLoad(Op.getNode());
3843 static bool MayFoldIntoStore(SDValue Op) {
3844 return Op.hasOneUse() && ISD::isNormalStore(*Op.getNode()->use_begin());
3847 static bool isTargetShuffle(unsigned Opcode) {
3849 default: return false;
3850 case X86ISD::BLENDI:
3851 case X86ISD::PSHUFB:
3852 case X86ISD::PSHUFD:
3853 case X86ISD::PSHUFHW:
3854 case X86ISD::PSHUFLW:
3856 case X86ISD::PALIGNR:
3857 case X86ISD::MOVLHPS:
3858 case X86ISD::MOVLHPD:
3859 case X86ISD::MOVHLPS:
3860 case X86ISD::MOVLPS:
3861 case X86ISD::MOVLPD:
3862 case X86ISD::MOVSHDUP:
3863 case X86ISD::MOVSLDUP:
3864 case X86ISD::MOVDDUP:
3867 case X86ISD::UNPCKL:
3868 case X86ISD::UNPCKH:
3869 case X86ISD::VPERMILPI:
3870 case X86ISD::VPERM2X128:
3871 case X86ISD::VPERMI:
3872 case X86ISD::VPERMV:
3873 case X86ISD::VPERMV3:
3878 static SDValue getTargetShuffleNode(unsigned Opc, SDLoc dl, MVT VT,
3879 SDValue V1, unsigned TargetMask,
3880 SelectionDAG &DAG) {
3882 default: llvm_unreachable("Unknown x86 shuffle node");
3883 case X86ISD::PSHUFD:
3884 case X86ISD::PSHUFHW:
3885 case X86ISD::PSHUFLW:
3886 case X86ISD::VPERMILPI:
3887 case X86ISD::VPERMI:
3888 return DAG.getNode(Opc, dl, VT, V1,
3889 DAG.getConstant(TargetMask, dl, MVT::i8));
3893 static SDValue getTargetShuffleNode(unsigned Opc, SDLoc dl, MVT VT,
3894 SDValue V1, SDValue V2, SelectionDAG &DAG) {
3896 default: llvm_unreachable("Unknown x86 shuffle node");
3897 case X86ISD::MOVLHPS:
3898 case X86ISD::MOVLHPD:
3899 case X86ISD::MOVHLPS:
3900 case X86ISD::MOVLPS:
3901 case X86ISD::MOVLPD:
3904 case X86ISD::UNPCKL:
3905 case X86ISD::UNPCKH:
3906 return DAG.getNode(Opc, dl, VT, V1, V2);
3910 SDValue X86TargetLowering::getReturnAddressFrameIndex(SelectionDAG &DAG) const {
3911 MachineFunction &MF = DAG.getMachineFunction();
3912 const X86RegisterInfo *RegInfo = Subtarget->getRegisterInfo();
3913 X86MachineFunctionInfo *FuncInfo = MF.getInfo<X86MachineFunctionInfo>();
3914 int ReturnAddrIndex = FuncInfo->getRAIndex();
3916 if (ReturnAddrIndex == 0) {
3917 // Set up a frame object for the return address.
3918 unsigned SlotSize = RegInfo->getSlotSize();
3919 ReturnAddrIndex = MF.getFrameInfo()->CreateFixedObject(SlotSize,
3922 FuncInfo->setRAIndex(ReturnAddrIndex);
3925 return DAG.getFrameIndex(ReturnAddrIndex, getPointerTy(DAG.getDataLayout()));
3928 bool X86::isOffsetSuitableForCodeModel(int64_t Offset, CodeModel::Model M,
3929 bool hasSymbolicDisplacement) {
3930 // Offset should fit into 32 bit immediate field.
3931 if (!isInt<32>(Offset))
3934 // If we don't have a symbolic displacement - we don't have any extra
3936 if (!hasSymbolicDisplacement)
3939 // FIXME: Some tweaks might be needed for medium code model.
3940 if (M != CodeModel::Small && M != CodeModel::Kernel)
3943 // For small code model we assume that latest object is 16MB before end of 31
3944 // bits boundary. We may also accept pretty large negative constants knowing
3945 // that all objects are in the positive half of address space.
3946 if (M == CodeModel::Small && Offset < 16*1024*1024)
3949 // For kernel code model we know that all object resist in the negative half
3950 // of 32bits address space. We may not accept negative offsets, since they may
3951 // be just off and we may accept pretty large positive ones.
3952 if (M == CodeModel::Kernel && Offset >= 0)
3958 /// Determines whether the callee is required to pop its own arguments.
3959 /// Callee pop is necessary to support tail calls.
3960 bool X86::isCalleePop(CallingConv::ID CallingConv,
3961 bool is64Bit, bool IsVarArg, bool GuaranteeTCO) {
3962 // If GuaranteeTCO is true, we force some calls to be callee pop so that we
3963 // can guarantee TCO.
3964 if (!IsVarArg && shouldGuaranteeTCO(CallingConv, GuaranteeTCO))
3967 switch (CallingConv) {
3970 case CallingConv::X86_StdCall:
3971 case CallingConv::X86_FastCall:
3972 case CallingConv::X86_ThisCall:
3973 case CallingConv::X86_VectorCall:
3978 /// \brief Return true if the condition is an unsigned comparison operation.
3979 static bool isX86CCUnsigned(unsigned X86CC) {
3981 default: llvm_unreachable("Invalid integer condition!");
3982 case X86::COND_E: return true;
3983 case X86::COND_G: return false;
3984 case X86::COND_GE: return false;
3985 case X86::COND_L: return false;
3986 case X86::COND_LE: return false;
3987 case X86::COND_NE: return true;
3988 case X86::COND_B: return true;
3989 case X86::COND_A: return true;
3990 case X86::COND_BE: return true;
3991 case X86::COND_AE: return true;
3995 static X86::CondCode TranslateIntegerX86CC(ISD::CondCode SetCCOpcode) {
3996 switch (SetCCOpcode) {
3997 default: llvm_unreachable("Invalid integer condition!");
3998 case ISD::SETEQ: return X86::COND_E;
3999 case ISD::SETGT: return X86::COND_G;
4000 case ISD::SETGE: return X86::COND_GE;
4001 case ISD::SETLT: return X86::COND_L;
4002 case ISD::SETLE: return X86::COND_LE;
4003 case ISD::SETNE: return X86::COND_NE;
4004 case ISD::SETULT: return X86::COND_B;
4005 case ISD::SETUGT: return X86::COND_A;
4006 case ISD::SETULE: return X86::COND_BE;
4007 case ISD::SETUGE: return X86::COND_AE;
4011 /// Do a one-to-one translation of a ISD::CondCode to the X86-specific
4012 /// condition code, returning the condition code and the LHS/RHS of the
4013 /// comparison to make.
4014 static unsigned TranslateX86CC(ISD::CondCode SetCCOpcode, SDLoc DL, bool isFP,
4015 SDValue &LHS, SDValue &RHS, SelectionDAG &DAG) {
4017 if (ConstantSDNode *RHSC = dyn_cast<ConstantSDNode>(RHS)) {
4018 if (SetCCOpcode == ISD::SETGT && RHSC->isAllOnesValue()) {
4019 // X > -1 -> X == 0, jump !sign.
4020 RHS = DAG.getConstant(0, DL, RHS.getValueType());
4021 return X86::COND_NS;
4023 if (SetCCOpcode == ISD::SETLT && RHSC->isNullValue()) {
4024 // X < 0 -> X == 0, jump on sign.
4027 if (SetCCOpcode == ISD::SETLT && RHSC->getZExtValue() == 1) {
4029 RHS = DAG.getConstant(0, DL, RHS.getValueType());
4030 return X86::COND_LE;
4034 return TranslateIntegerX86CC(SetCCOpcode);
4037 // First determine if it is required or is profitable to flip the operands.
4039 // If LHS is a foldable load, but RHS is not, flip the condition.
4040 if (ISD::isNON_EXTLoad(LHS.getNode()) &&
4041 !ISD::isNON_EXTLoad(RHS.getNode())) {
4042 SetCCOpcode = getSetCCSwappedOperands(SetCCOpcode);
4043 std::swap(LHS, RHS);
4046 switch (SetCCOpcode) {
4052 std::swap(LHS, RHS);
4056 // On a floating point condition, the flags are set as follows:
4058 // 0 | 0 | 0 | X > Y
4059 // 0 | 0 | 1 | X < Y
4060 // 1 | 0 | 0 | X == Y
4061 // 1 | 1 | 1 | unordered
4062 switch (SetCCOpcode) {
4063 default: llvm_unreachable("Condcode should be pre-legalized away");
4065 case ISD::SETEQ: return X86::COND_E;
4066 case ISD::SETOLT: // flipped
4068 case ISD::SETGT: return X86::COND_A;
4069 case ISD::SETOLE: // flipped
4071 case ISD::SETGE: return X86::COND_AE;
4072 case ISD::SETUGT: // flipped
4074 case ISD::SETLT: return X86::COND_B;
4075 case ISD::SETUGE: // flipped
4077 case ISD::SETLE: return X86::COND_BE;
4079 case ISD::SETNE: return X86::COND_NE;
4080 case ISD::SETUO: return X86::COND_P;
4081 case ISD::SETO: return X86::COND_NP;
4083 case ISD::SETUNE: return X86::COND_INVALID;
4087 /// Is there a floating point cmov for the specific X86 condition code?
4088 /// Current x86 isa includes the following FP cmov instructions:
4089 /// fcmovb, fcomvbe, fcomve, fcmovu, fcmovae, fcmova, fcmovne, fcmovnu.
4090 static bool hasFPCMov(unsigned X86CC) {
4106 /// Returns true if the target can instruction select the
4107 /// specified FP immediate natively. If false, the legalizer will
4108 /// materialize the FP immediate as a load from a constant pool.
4109 bool X86TargetLowering::isFPImmLegal(const APFloat &Imm, EVT VT) const {
4110 for (unsigned i = 0, e = LegalFPImmediates.size(); i != e; ++i) {
4111 if (Imm.bitwiseIsEqual(LegalFPImmediates[i]))
4117 bool X86TargetLowering::shouldReduceLoadWidth(SDNode *Load,
4118 ISD::LoadExtType ExtTy,
4120 // "ELF Handling for Thread-Local Storage" specifies that R_X86_64_GOTTPOFF
4121 // relocation target a movq or addq instruction: don't let the load shrink.
4122 SDValue BasePtr = cast<LoadSDNode>(Load)->getBasePtr();
4123 if (BasePtr.getOpcode() == X86ISD::WrapperRIP)
4124 if (const auto *GA = dyn_cast<GlobalAddressSDNode>(BasePtr.getOperand(0)))
4125 return GA->getTargetFlags() != X86II::MO_GOTTPOFF;
4129 /// \brief Returns true if it is beneficial to convert a load of a constant
4130 /// to just the constant itself.
4131 bool X86TargetLowering::shouldConvertConstantLoadToIntImm(const APInt &Imm,
4133 assert(Ty->isIntegerTy());
4135 unsigned BitSize = Ty->getPrimitiveSizeInBits();
4136 if (BitSize == 0 || BitSize > 64)
4141 bool X86TargetLowering::isExtractSubvectorCheap(EVT ResVT,
4142 unsigned Index) const {
4143 if (!isOperationLegalOrCustom(ISD::EXTRACT_SUBVECTOR, ResVT))
4146 return (Index == 0 || Index == ResVT.getVectorNumElements());
4149 bool X86TargetLowering::isCheapToSpeculateCttz() const {
4150 // Speculate cttz only if we can directly use TZCNT.
4151 return Subtarget->hasBMI();
4154 bool X86TargetLowering::isCheapToSpeculateCtlz() const {
4155 // Speculate ctlz only if we can directly use LZCNT.
4156 return Subtarget->hasLZCNT();
4159 /// Return true if every element in Mask, beginning
4160 /// from position Pos and ending in Pos+Size is undef.
4161 static bool isUndefInRange(ArrayRef<int> Mask, unsigned Pos, unsigned Size) {
4162 for (unsigned i = Pos, e = Pos + Size; i != e; ++i)
4168 /// Return true if Val is undef or if its value falls within the
4169 /// specified range (L, H].
4170 static bool isUndefOrInRange(int Val, int Low, int Hi) {
4171 return (Val < 0) || (Val >= Low && Val < Hi);
4174 /// Val is either less than zero (undef) or equal to the specified value.
4175 static bool isUndefOrEqual(int Val, int CmpVal) {
4176 return (Val < 0 || Val == CmpVal);
4179 /// Return true if every element in Mask, beginning
4180 /// from position Pos and ending in Pos+Size, falls within the specified
4181 /// sequential range (Low, Low+Size]. or is undef.
4182 static bool isSequentialOrUndefInRange(ArrayRef<int> Mask,
4183 unsigned Pos, unsigned Size, int Low) {
4184 for (unsigned i = Pos, e = Pos+Size; i != e; ++i, ++Low)
4185 if (!isUndefOrEqual(Mask[i], Low))
4190 /// Return true if the specified EXTRACT_SUBVECTOR operand specifies a vector
4191 /// extract that is suitable for instruction that extract 128 or 256 bit vectors
4192 static bool isVEXTRACTIndex(SDNode *N, unsigned vecWidth) {
4193 assert((vecWidth == 128 || vecWidth == 256) && "Unexpected vector width");
4194 if (!isa<ConstantSDNode>(N->getOperand(1).getNode()))
4197 // The index should be aligned on a vecWidth-bit boundary.
4199 cast<ConstantSDNode>(N->getOperand(1).getNode())->getZExtValue();
4201 MVT VT = N->getSimpleValueType(0);
4202 unsigned ElSize = VT.getVectorElementType().getSizeInBits();
4203 bool Result = (Index * ElSize) % vecWidth == 0;
4208 /// Return true if the specified INSERT_SUBVECTOR
4209 /// operand specifies a subvector insert that is suitable for input to
4210 /// insertion of 128 or 256-bit subvectors
4211 static bool isVINSERTIndex(SDNode *N, unsigned vecWidth) {
4212 assert((vecWidth == 128 || vecWidth == 256) && "Unexpected vector width");
4213 if (!isa<ConstantSDNode>(N->getOperand(2).getNode()))
4215 // The index should be aligned on a vecWidth-bit boundary.
4217 cast<ConstantSDNode>(N->getOperand(2).getNode())->getZExtValue();
4219 MVT VT = N->getSimpleValueType(0);
4220 unsigned ElSize = VT.getVectorElementType().getSizeInBits();
4221 bool Result = (Index * ElSize) % vecWidth == 0;
4226 bool X86::isVINSERT128Index(SDNode *N) {
4227 return isVINSERTIndex(N, 128);
4230 bool X86::isVINSERT256Index(SDNode *N) {
4231 return isVINSERTIndex(N, 256);
4234 bool X86::isVEXTRACT128Index(SDNode *N) {
4235 return isVEXTRACTIndex(N, 128);
4238 bool X86::isVEXTRACT256Index(SDNode *N) {
4239 return isVEXTRACTIndex(N, 256);
4242 static unsigned getExtractVEXTRACTImmediate(SDNode *N, unsigned vecWidth) {
4243 assert((vecWidth == 128 || vecWidth == 256) && "Unsupported vector width");
4244 assert(isa<ConstantSDNode>(N->getOperand(1).getNode()) &&
4245 "Illegal extract subvector for VEXTRACT");
4248 cast<ConstantSDNode>(N->getOperand(1).getNode())->getZExtValue();
4250 MVT VecVT = N->getOperand(0).getSimpleValueType();
4251 MVT ElVT = VecVT.getVectorElementType();
4253 unsigned NumElemsPerChunk = vecWidth / ElVT.getSizeInBits();
4254 return Index / NumElemsPerChunk;
4257 static unsigned getInsertVINSERTImmediate(SDNode *N, unsigned vecWidth) {
4258 assert((vecWidth == 128 || vecWidth == 256) && "Unsupported vector width");
4259 assert(isa<ConstantSDNode>(N->getOperand(2).getNode()) &&
4260 "Illegal insert subvector for VINSERT");
4263 cast<ConstantSDNode>(N->getOperand(2).getNode())->getZExtValue();
4265 MVT VecVT = N->getSimpleValueType(0);
4266 MVT ElVT = VecVT.getVectorElementType();
4268 unsigned NumElemsPerChunk = vecWidth / ElVT.getSizeInBits();
4269 return Index / NumElemsPerChunk;
4272 /// Return the appropriate immediate to extract the specified
4273 /// EXTRACT_SUBVECTOR index with VEXTRACTF128 and VINSERTI128 instructions.
4274 unsigned X86::getExtractVEXTRACT128Immediate(SDNode *N) {
4275 return getExtractVEXTRACTImmediate(N, 128);
4278 /// Return the appropriate immediate to extract the specified
4279 /// EXTRACT_SUBVECTOR index with VEXTRACTF64x4 and VINSERTI64x4 instructions.
4280 unsigned X86::getExtractVEXTRACT256Immediate(SDNode *N) {
4281 return getExtractVEXTRACTImmediate(N, 256);
4284 /// Return the appropriate immediate to insert at the specified
4285 /// INSERT_SUBVECTOR index with VINSERTF128 and VINSERTI128 instructions.
4286 unsigned X86::getInsertVINSERT128Immediate(SDNode *N) {
4287 return getInsertVINSERTImmediate(N, 128);
4290 /// Return the appropriate immediate to insert at the specified
4291 /// INSERT_SUBVECTOR index with VINSERTF46x4 and VINSERTI64x4 instructions.
4292 unsigned X86::getInsertVINSERT256Immediate(SDNode *N) {
4293 return getInsertVINSERTImmediate(N, 256);
4296 /// Returns true if Elt is a constant zero or a floating point constant +0.0.
4297 bool X86::isZeroNode(SDValue Elt) {
4298 return isNullConstant(Elt) || isNullFPConstant(Elt);
4301 // Build a vector of constants
4302 // Use an UNDEF node if MaskElt == -1.
4303 // Spilt 64-bit constants in the 32-bit mode.
4304 static SDValue getConstVector(ArrayRef<int> Values, MVT VT,
4306 SDLoc dl, bool IsMask = false) {
4308 SmallVector<SDValue, 32> Ops;
4311 MVT ConstVecVT = VT;
4312 unsigned NumElts = VT.getVectorNumElements();
4313 bool In64BitMode = DAG.getTargetLoweringInfo().isTypeLegal(MVT::i64);
4314 if (!In64BitMode && VT.getVectorElementType() == MVT::i64) {
4315 ConstVecVT = MVT::getVectorVT(MVT::i32, NumElts * 2);
4319 MVT EltVT = ConstVecVT.getVectorElementType();
4320 for (unsigned i = 0; i < NumElts; ++i) {
4321 bool IsUndef = Values[i] < 0 && IsMask;
4322 SDValue OpNode = IsUndef ? DAG.getUNDEF(EltVT) :
4323 DAG.getConstant(Values[i], dl, EltVT);
4324 Ops.push_back(OpNode);
4326 Ops.push_back(IsUndef ? DAG.getUNDEF(EltVT) :
4327 DAG.getConstant(0, dl, EltVT));
4329 SDValue ConstsNode = DAG.getNode(ISD::BUILD_VECTOR, dl, ConstVecVT, Ops);
4331 ConstsNode = DAG.getBitcast(VT, ConstsNode);
4335 /// Returns a vector of specified type with all zero elements.
4336 static SDValue getZeroVector(MVT VT, const X86Subtarget *Subtarget,
4337 SelectionDAG &DAG, SDLoc dl) {
4338 assert(VT.isVector() && "Expected a vector type");
4340 // Always build SSE zero vectors as <4 x i32> bitcasted
4341 // to their dest type. This ensures they get CSE'd.
4343 if (VT.is128BitVector()) { // SSE
4344 if (Subtarget->hasSSE2()) { // SSE2
4345 SDValue Cst = DAG.getConstant(0, dl, MVT::i32);
4346 Vec = DAG.getNode(ISD::BUILD_VECTOR, dl, MVT::v4i32, Cst, Cst, Cst, Cst);
4348 SDValue Cst = DAG.getConstantFP(+0.0, dl, MVT::f32);
4349 Vec = DAG.getNode(ISD::BUILD_VECTOR, dl, MVT::v4f32, Cst, Cst, Cst, Cst);
4351 } else if (VT.is256BitVector()) { // AVX
4352 if (Subtarget->hasInt256()) { // AVX2
4353 SDValue Cst = DAG.getConstant(0, dl, MVT::i32);
4354 SDValue Ops[] = { Cst, Cst, Cst, Cst, Cst, Cst, Cst, Cst };
4355 Vec = DAG.getNode(ISD::BUILD_VECTOR, dl, MVT::v8i32, Ops);
4357 // 256-bit logic and arithmetic instructions in AVX are all
4358 // floating-point, no support for integer ops. Emit fp zeroed vectors.
4359 SDValue Cst = DAG.getConstantFP(+0.0, dl, MVT::f32);
4360 SDValue Ops[] = { Cst, Cst, Cst, Cst, Cst, Cst, Cst, Cst };
4361 Vec = DAG.getNode(ISD::BUILD_VECTOR, dl, MVT::v8f32, Ops);
4363 } else if (VT.is512BitVector()) { // AVX-512
4364 SDValue Cst = DAG.getConstant(0, dl, MVT::i32);
4365 SDValue Ops[] = { Cst, Cst, Cst, Cst, Cst, Cst, Cst, Cst,
4366 Cst, Cst, Cst, Cst, Cst, Cst, Cst, Cst };
4367 Vec = DAG.getNode(ISD::BUILD_VECTOR, dl, MVT::v16i32, Ops);
4368 } else if (VT.getVectorElementType() == MVT::i1) {
4370 assert((Subtarget->hasBWI() || VT.getVectorNumElements() <= 16)
4371 && "Unexpected vector type");
4372 assert((Subtarget->hasVLX() || VT.getVectorNumElements() >= 8)
4373 && "Unexpected vector type");
4374 SDValue Cst = DAG.getConstant(0, dl, MVT::i1);
4375 SmallVector<SDValue, 64> Ops(VT.getVectorNumElements(), Cst);
4376 return DAG.getNode(ISD::BUILD_VECTOR, dl, VT, Ops);
4378 llvm_unreachable("Unexpected vector type");
4380 return DAG.getBitcast(VT, Vec);
4383 static SDValue ExtractSubVector(SDValue Vec, unsigned IdxVal,
4384 SelectionDAG &DAG, SDLoc dl,
4385 unsigned vectorWidth) {
4386 assert((vectorWidth == 128 || vectorWidth == 256) &&
4387 "Unsupported vector width");
4388 EVT VT = Vec.getValueType();
4389 EVT ElVT = VT.getVectorElementType();
4390 unsigned Factor = VT.getSizeInBits()/vectorWidth;
4391 EVT ResultVT = EVT::getVectorVT(*DAG.getContext(), ElVT,
4392 VT.getVectorNumElements()/Factor);
4394 // Extract from UNDEF is UNDEF.
4395 if (Vec.getOpcode() == ISD::UNDEF)
4396 return DAG.getUNDEF(ResultVT);
4398 // Extract the relevant vectorWidth bits. Generate an EXTRACT_SUBVECTOR
4399 unsigned ElemsPerChunk = vectorWidth / ElVT.getSizeInBits();
4400 assert(isPowerOf2_32(ElemsPerChunk) && "Elements per chunk not power of 2");
4402 // This is the index of the first element of the vectorWidth-bit chunk
4403 // we want. Since ElemsPerChunk is a power of 2 just need to clear bits.
4404 IdxVal &= ~(ElemsPerChunk - 1);
4406 // If the input is a buildvector just emit a smaller one.
4407 if (Vec.getOpcode() == ISD::BUILD_VECTOR)
4408 return DAG.getNode(ISD::BUILD_VECTOR, dl, ResultVT,
4409 makeArrayRef(Vec->op_begin() + IdxVal, ElemsPerChunk));
4411 SDValue VecIdx = DAG.getIntPtrConstant(IdxVal, dl);
4412 return DAG.getNode(ISD::EXTRACT_SUBVECTOR, dl, ResultVT, Vec, VecIdx);
4415 /// Generate a DAG to grab 128-bits from a vector > 128 bits. This
4416 /// sets things up to match to an AVX VEXTRACTF128 / VEXTRACTI128
4417 /// or AVX-512 VEXTRACTF32x4 / VEXTRACTI32x4
4418 /// instructions or a simple subregister reference. Idx is an index in the
4419 /// 128 bits we want. It need not be aligned to a 128-bit boundary. That makes
4420 /// lowering EXTRACT_VECTOR_ELT operations easier.
4421 static SDValue Extract128BitVector(SDValue Vec, unsigned IdxVal,
4422 SelectionDAG &DAG, SDLoc dl) {
4423 assert((Vec.getValueType().is256BitVector() ||
4424 Vec.getValueType().is512BitVector()) && "Unexpected vector size!");
4425 return ExtractSubVector(Vec, IdxVal, DAG, dl, 128);
4428 /// Generate a DAG to grab 256-bits from a 512-bit vector.
4429 static SDValue Extract256BitVector(SDValue Vec, unsigned IdxVal,
4430 SelectionDAG &DAG, SDLoc dl) {
4431 assert(Vec.getValueType().is512BitVector() && "Unexpected vector size!");
4432 return ExtractSubVector(Vec, IdxVal, DAG, dl, 256);
4435 static SDValue InsertSubVector(SDValue Result, SDValue Vec,
4436 unsigned IdxVal, SelectionDAG &DAG,
4437 SDLoc dl, unsigned vectorWidth) {
4438 assert((vectorWidth == 128 || vectorWidth == 256) &&
4439 "Unsupported vector width");
4440 // Inserting UNDEF is Result
4441 if (Vec.getOpcode() == ISD::UNDEF)
4443 EVT VT = Vec.getValueType();
4444 EVT ElVT = VT.getVectorElementType();
4445 EVT ResultVT = Result.getValueType();
4447 // Insert the relevant vectorWidth bits.
4448 unsigned ElemsPerChunk = vectorWidth/ElVT.getSizeInBits();
4449 assert(isPowerOf2_32(ElemsPerChunk) && "Elements per chunk not power of 2");
4451 // This is the index of the first element of the vectorWidth-bit chunk
4452 // we want. Since ElemsPerChunk is a power of 2 just need to clear bits.
4453 IdxVal &= ~(ElemsPerChunk - 1);
4455 SDValue VecIdx = DAG.getIntPtrConstant(IdxVal, dl);
4456 return DAG.getNode(ISD::INSERT_SUBVECTOR, dl, ResultVT, Result, Vec, VecIdx);
4459 /// Generate a DAG to put 128-bits into a vector > 128 bits. This
4460 /// sets things up to match to an AVX VINSERTF128/VINSERTI128 or
4461 /// AVX-512 VINSERTF32x4/VINSERTI32x4 instructions or a
4462 /// simple superregister reference. Idx is an index in the 128 bits
4463 /// we want. It need not be aligned to a 128-bit boundary. That makes
4464 /// lowering INSERT_VECTOR_ELT operations easier.
4465 static SDValue Insert128BitVector(SDValue Result, SDValue Vec, unsigned IdxVal,
4466 SelectionDAG &DAG, SDLoc dl) {
4467 assert(Vec.getValueType().is128BitVector() && "Unexpected vector size!");
4469 // For insertion into the zero index (low half) of a 256-bit vector, it is
4470 // more efficient to generate a blend with immediate instead of an insert*128.
4471 // We are still creating an INSERT_SUBVECTOR below with an undef node to
4472 // extend the subvector to the size of the result vector. Make sure that
4473 // we are not recursing on that node by checking for undef here.
4474 if (IdxVal == 0 && Result.getValueType().is256BitVector() &&
4475 Result.getOpcode() != ISD::UNDEF) {
4476 EVT ResultVT = Result.getValueType();
4477 SDValue ZeroIndex = DAG.getIntPtrConstant(0, dl);
4478 SDValue Undef = DAG.getUNDEF(ResultVT);
4479 SDValue Vec256 = DAG.getNode(ISD::INSERT_SUBVECTOR, dl, ResultVT, Undef,
4482 // The blend instruction, and therefore its mask, depend on the data type.
4483 MVT ScalarType = ResultVT.getVectorElementType().getSimpleVT();
4484 if (ScalarType.isFloatingPoint()) {
4485 // Choose either vblendps (float) or vblendpd (double).
4486 unsigned ScalarSize = ScalarType.getSizeInBits();
4487 assert((ScalarSize == 64 || ScalarSize == 32) && "Unknown float type");
4488 unsigned MaskVal = (ScalarSize == 64) ? 0x03 : 0x0f;
4489 SDValue Mask = DAG.getConstant(MaskVal, dl, MVT::i8);
4490 return DAG.getNode(X86ISD::BLENDI, dl, ResultVT, Result, Vec256, Mask);
4493 const X86Subtarget &Subtarget =
4494 static_cast<const X86Subtarget &>(DAG.getSubtarget());
4496 // AVX2 is needed for 256-bit integer blend support.
4497 // Integers must be cast to 32-bit because there is only vpblendd;
4498 // vpblendw can't be used for this because it has a handicapped mask.
4500 // If we don't have AVX2, then cast to float. Using a wrong domain blend
4501 // is still more efficient than using the wrong domain vinsertf128 that
4502 // will be created by InsertSubVector().
4503 MVT CastVT = Subtarget.hasAVX2() ? MVT::v8i32 : MVT::v8f32;
4505 SDValue Mask = DAG.getConstant(0x0f, dl, MVT::i8);
4506 Vec256 = DAG.getBitcast(CastVT, Vec256);
4507 Vec256 = DAG.getNode(X86ISD::BLENDI, dl, CastVT, Result, Vec256, Mask);
4508 return DAG.getBitcast(ResultVT, Vec256);
4511 return InsertSubVector(Result, Vec, IdxVal, DAG, dl, 128);
4514 static SDValue Insert256BitVector(SDValue Result, SDValue Vec, unsigned IdxVal,
4515 SelectionDAG &DAG, SDLoc dl) {
4516 assert(Vec.getValueType().is256BitVector() && "Unexpected vector size!");
4517 return InsertSubVector(Result, Vec, IdxVal, DAG, dl, 256);
4520 /// Insert i1-subvector to i1-vector.
4521 static SDValue Insert1BitVector(SDValue Op, SelectionDAG &DAG) {
4524 SDValue Vec = Op.getOperand(0);
4525 SDValue SubVec = Op.getOperand(1);
4526 SDValue Idx = Op.getOperand(2);
4528 if (!isa<ConstantSDNode>(Idx))
4531 unsigned IdxVal = cast<ConstantSDNode>(Idx)->getZExtValue();
4532 if (IdxVal == 0 && Vec.isUndef()) // the operation is legal
4535 MVT OpVT = Op.getSimpleValueType();
4536 MVT SubVecVT = SubVec.getSimpleValueType();
4537 unsigned NumElems = OpVT.getVectorNumElements();
4538 unsigned SubVecNumElems = SubVecVT.getVectorNumElements();
4540 assert(IdxVal + SubVecNumElems <= NumElems &&
4541 IdxVal % SubVecVT.getSizeInBits() == 0 &&
4542 "Unexpected index value in INSERT_SUBVECTOR");
4544 // There are 3 possible cases:
4545 // 1. Subvector should be inserted in the lower part (IdxVal == 0)
4546 // 2. Subvector should be inserted in the upper part
4547 // (IdxVal + SubVecNumElems == NumElems)
4548 // 3. Subvector should be inserted in the middle (for example v2i1
4549 // to v16i1, index 2)
4551 SDValue ZeroIdx = DAG.getIntPtrConstant(0, dl);
4552 SDValue Undef = DAG.getUNDEF(OpVT);
4553 SDValue WideSubVec =
4554 DAG.getNode(ISD::INSERT_SUBVECTOR, dl, OpVT, Undef, SubVec, ZeroIdx);
4556 return DAG.getNode(X86ISD::VSHLI, dl, OpVT, WideSubVec,
4557 DAG.getConstant(IdxVal, dl, MVT::i8));
4559 if (ISD::isBuildVectorAllZeros(Vec.getNode())) {
4560 unsigned ShiftLeft = NumElems - SubVecNumElems;
4561 unsigned ShiftRight = NumElems - SubVecNumElems - IdxVal;
4562 WideSubVec = DAG.getNode(X86ISD::VSHLI, dl, OpVT, WideSubVec,
4563 DAG.getConstant(ShiftLeft, dl, MVT::i8));
4564 return ShiftRight ? DAG.getNode(X86ISD::VSRLI, dl, OpVT, WideSubVec,
4565 DAG.getConstant(ShiftRight, dl, MVT::i8)) : WideSubVec;
4569 // Zero lower bits of the Vec
4570 SDValue ShiftBits = DAG.getConstant(SubVecNumElems, dl, MVT::i8);
4571 Vec = DAG.getNode(X86ISD::VSRLI, dl, OpVT, Vec, ShiftBits);
4572 Vec = DAG.getNode(X86ISD::VSHLI, dl, OpVT, Vec, ShiftBits);
4573 // Merge them together
4574 return DAG.getNode(ISD::OR, dl, OpVT, Vec, WideSubVec);
4577 // Simple case when we put subvector in the upper part
4578 if (IdxVal + SubVecNumElems == NumElems) {
4579 // Zero upper bits of the Vec
4580 WideSubVec = DAG.getNode(X86ISD::VSHLI, dl, OpVT, Vec,
4581 DAG.getConstant(IdxVal, dl, MVT::i8));
4582 SDValue ShiftBits = DAG.getConstant(SubVecNumElems, dl, MVT::i8);
4583 Vec = DAG.getNode(X86ISD::VSHLI, dl, OpVT, Vec, ShiftBits);
4584 Vec = DAG.getNode(X86ISD::VSRLI, dl, OpVT, Vec, ShiftBits);
4585 return DAG.getNode(ISD::OR, dl, OpVT, Vec, WideSubVec);
4587 // Subvector should be inserted in the middle - use shuffle
4588 SmallVector<int, 64> Mask;
4589 for (unsigned i = 0; i < NumElems; ++i)
4590 Mask.push_back(i >= IdxVal && i < IdxVal + SubVecNumElems ?
4592 return DAG.getVectorShuffle(OpVT, dl, WideSubVec, Vec, Mask);
4595 /// Concat two 128-bit vectors into a 256 bit vector using VINSERTF128
4596 /// instructions. This is used because creating CONCAT_VECTOR nodes of
4597 /// BUILD_VECTORS returns a larger BUILD_VECTOR while we're trying to lower
4598 /// large BUILD_VECTORS.
4599 static SDValue Concat128BitVectors(SDValue V1, SDValue V2, EVT VT,
4600 unsigned NumElems, SelectionDAG &DAG,
4602 SDValue V = Insert128BitVector(DAG.getUNDEF(VT), V1, 0, DAG, dl);
4603 return Insert128BitVector(V, V2, NumElems/2, DAG, dl);
4606 static SDValue Concat256BitVectors(SDValue V1, SDValue V2, EVT VT,
4607 unsigned NumElems, SelectionDAG &DAG,
4609 SDValue V = Insert256BitVector(DAG.getUNDEF(VT), V1, 0, DAG, dl);
4610 return Insert256BitVector(V, V2, NumElems/2, DAG, dl);
4613 /// Returns a vector of specified type with all bits set.
4614 /// Always build ones vectors as <4 x i32> or <8 x i32>. For 256-bit types with
4615 /// no AVX2 supprt, use two <4 x i32> inserted in a <8 x i32> appropriately.
4616 /// Then bitcast to their original type, ensuring they get CSE'd.
4617 static SDValue getOnesVector(EVT VT, const X86Subtarget *Subtarget,
4618 SelectionDAG &DAG, SDLoc dl) {
4619 assert(VT.isVector() && "Expected a vector type");
4621 SDValue Cst = DAG.getConstant(~0U, dl, MVT::i32);
4623 if (VT.is512BitVector()) {
4624 SDValue Ops[] = { Cst, Cst, Cst, Cst, Cst, Cst, Cst, Cst,
4625 Cst, Cst, Cst, Cst, Cst, Cst, Cst, Cst };
4626 Vec = DAG.getNode(ISD::BUILD_VECTOR, dl, MVT::v16i32, Ops);
4627 } else if (VT.is256BitVector()) {
4628 if (Subtarget->hasInt256()) { // AVX2
4629 SDValue Ops[] = { Cst, Cst, Cst, Cst, Cst, Cst, Cst, Cst };
4630 Vec = DAG.getNode(ISD::BUILD_VECTOR, dl, MVT::v8i32, Ops);
4632 Vec = DAG.getNode(ISD::BUILD_VECTOR, dl, MVT::v4i32, Cst, Cst, Cst, Cst);
4633 Vec = Concat128BitVectors(Vec, Vec, MVT::v8i32, 8, DAG, dl);
4635 } else if (VT.is128BitVector()) {
4636 Vec = DAG.getNode(ISD::BUILD_VECTOR, dl, MVT::v4i32, Cst, Cst, Cst, Cst);
4638 llvm_unreachable("Unexpected vector type");
4640 return DAG.getBitcast(VT, Vec);
4643 /// Returns a vector_shuffle node for an unpackl operation.
4644 static SDValue getUnpackl(SelectionDAG &DAG, SDLoc dl, MVT VT, SDValue V1,
4646 unsigned NumElems = VT.getVectorNumElements();
4647 SmallVector<int, 8> Mask;
4648 for (unsigned i = 0, e = NumElems/2; i != e; ++i) {
4650 Mask.push_back(i + NumElems);
4652 return DAG.getVectorShuffle(VT, dl, V1, V2, &Mask[0]);
4655 /// Returns a vector_shuffle node for an unpackh operation.
4656 static SDValue getUnpackh(SelectionDAG &DAG, SDLoc dl, MVT VT, SDValue V1,
4658 unsigned NumElems = VT.getVectorNumElements();
4659 SmallVector<int, 8> Mask;
4660 for (unsigned i = 0, Half = NumElems/2; i != Half; ++i) {
4661 Mask.push_back(i + Half);
4662 Mask.push_back(i + NumElems + Half);
4664 return DAG.getVectorShuffle(VT, dl, V1, V2, &Mask[0]);
4667 /// Return a vector_shuffle of the specified vector of zero or undef vector.
4668 /// This produces a shuffle where the low element of V2 is swizzled into the
4669 /// zero/undef vector, landing at element Idx.
4670 /// This produces a shuffle mask like 4,1,2,3 (idx=0) or 0,1,2,4 (idx=3).
4671 static SDValue getShuffleVectorZeroOrUndef(SDValue V2, unsigned Idx,
4673 const X86Subtarget *Subtarget,
4674 SelectionDAG &DAG) {
4675 MVT VT = V2.getSimpleValueType();
4677 ? getZeroVector(VT, Subtarget, DAG, SDLoc(V2)) : DAG.getUNDEF(VT);
4678 unsigned NumElems = VT.getVectorNumElements();
4679 SmallVector<int, 16> MaskVec;
4680 for (unsigned i = 0; i != NumElems; ++i)
4681 // If this is the insertion idx, put the low elt of V2 here.
4682 MaskVec.push_back(i == Idx ? NumElems : i);
4683 return DAG.getVectorShuffle(VT, SDLoc(V2), V1, V2, &MaskVec[0]);
4686 /// Calculates the shuffle mask corresponding to the target-specific opcode.
4687 /// Returns true if the Mask could be calculated. Sets IsUnary to true if only
4688 /// uses one source. Note that this will set IsUnary for shuffles which use a
4689 /// single input multiple times, and in those cases it will
4690 /// adjust the mask to only have indices within that single input.
4691 /// FIXME: Add support for Decode*Mask functions that return SM_SentinelZero.
4692 static bool getTargetShuffleMask(SDNode *N, MVT VT,
4693 SmallVectorImpl<int> &Mask, bool &IsUnary) {
4694 unsigned NumElems = VT.getVectorNumElements();
4698 bool IsFakeUnary = false;
4699 switch(N->getOpcode()) {
4700 case X86ISD::BLENDI:
4701 ImmN = N->getOperand(N->getNumOperands()-1);
4702 DecodeBLENDMask(VT, cast<ConstantSDNode>(ImmN)->getZExtValue(), Mask);
4705 ImmN = N->getOperand(N->getNumOperands()-1);
4706 DecodeSHUFPMask(VT, cast<ConstantSDNode>(ImmN)->getZExtValue(), Mask);
4707 IsUnary = IsFakeUnary = N->getOperand(0) == N->getOperand(1);
4709 case X86ISD::UNPCKH:
4710 DecodeUNPCKHMask(VT, Mask);
4711 IsUnary = IsFakeUnary = N->getOperand(0) == N->getOperand(1);
4713 case X86ISD::UNPCKL:
4714 DecodeUNPCKLMask(VT, Mask);
4715 IsUnary = IsFakeUnary = N->getOperand(0) == N->getOperand(1);
4717 case X86ISD::MOVHLPS:
4718 DecodeMOVHLPSMask(NumElems, Mask);
4719 IsUnary = IsFakeUnary = N->getOperand(0) == N->getOperand(1);
4721 case X86ISD::MOVLHPS:
4722 DecodeMOVLHPSMask(NumElems, Mask);
4723 IsUnary = IsFakeUnary = N->getOperand(0) == N->getOperand(1);
4725 case X86ISD::PALIGNR:
4726 ImmN = N->getOperand(N->getNumOperands()-1);
4727 DecodePALIGNRMask(VT, cast<ConstantSDNode>(ImmN)->getZExtValue(), Mask);
4729 case X86ISD::PSHUFD:
4730 case X86ISD::VPERMILPI:
4731 ImmN = N->getOperand(N->getNumOperands()-1);
4732 DecodePSHUFMask(VT, cast<ConstantSDNode>(ImmN)->getZExtValue(), Mask);
4735 case X86ISD::PSHUFHW:
4736 ImmN = N->getOperand(N->getNumOperands()-1);
4737 DecodePSHUFHWMask(VT, cast<ConstantSDNode>(ImmN)->getZExtValue(), Mask);
4740 case X86ISD::PSHUFLW:
4741 ImmN = N->getOperand(N->getNumOperands()-1);
4742 DecodePSHUFLWMask(VT, cast<ConstantSDNode>(ImmN)->getZExtValue(), Mask);
4745 case X86ISD::PSHUFB: {
4747 SDValue MaskNode = N->getOperand(1);
4748 while (MaskNode->getOpcode() == ISD::BITCAST)
4749 MaskNode = MaskNode->getOperand(0);
4751 if (MaskNode->getOpcode() == ISD::BUILD_VECTOR) {
4752 // If we have a build-vector, then things are easy.
4753 MVT VT = MaskNode.getSimpleValueType();
4754 assert(VT.isVector() &&
4755 "Can't produce a non-vector with a build_vector!");
4756 if (!VT.isInteger())
4759 int NumBytesPerElement = VT.getVectorElementType().getSizeInBits() / 8;
4761 SmallVector<uint64_t, 32> RawMask;
4762 for (int i = 0, e = MaskNode->getNumOperands(); i < e; ++i) {
4763 SDValue Op = MaskNode->getOperand(i);
4764 if (Op->getOpcode() == ISD::UNDEF) {
4765 RawMask.push_back((uint64_t)SM_SentinelUndef);
4768 auto *CN = dyn_cast<ConstantSDNode>(Op.getNode());
4771 APInt MaskElement = CN->getAPIntValue();
4773 // We now have to decode the element which could be any integer size and
4774 // extract each byte of it.
4775 for (int j = 0; j < NumBytesPerElement; ++j) {
4776 // Note that this is x86 and so always little endian: the low byte is
4777 // the first byte of the mask.
4778 RawMask.push_back(MaskElement.getLoBits(8).getZExtValue());
4779 MaskElement = MaskElement.lshr(8);
4782 DecodePSHUFBMask(RawMask, Mask);
4786 auto *MaskLoad = dyn_cast<LoadSDNode>(MaskNode);
4790 SDValue Ptr = MaskLoad->getBasePtr();
4791 if (Ptr->getOpcode() == X86ISD::Wrapper ||
4792 Ptr->getOpcode() == X86ISD::WrapperRIP)
4793 Ptr = Ptr->getOperand(0);
4795 auto *MaskCP = dyn_cast<ConstantPoolSDNode>(Ptr);
4796 if (!MaskCP || MaskCP->isMachineConstantPoolEntry())
4799 if (auto *C = dyn_cast<Constant>(MaskCP->getConstVal())) {
4800 DecodePSHUFBMask(C, Mask);
4808 case X86ISD::VPERMI:
4809 ImmN = N->getOperand(N->getNumOperands()-1);
4810 DecodeVPERMMask(cast<ConstantSDNode>(ImmN)->getZExtValue(), Mask);
4815 DecodeScalarMoveMask(VT, /* IsLoad */ false, Mask);
4817 case X86ISD::VPERM2X128:
4818 ImmN = N->getOperand(N->getNumOperands()-1);
4819 DecodeVPERM2X128Mask(VT, cast<ConstantSDNode>(ImmN)->getZExtValue(), Mask);
4820 if (Mask.empty()) return false;
4821 // Mask only contains negative index if an element is zero.
4822 if (std::any_of(Mask.begin(), Mask.end(),
4823 [](int M){ return M == SM_SentinelZero; }))
4826 case X86ISD::MOVSLDUP:
4827 DecodeMOVSLDUPMask(VT, Mask);
4830 case X86ISD::MOVSHDUP:
4831 DecodeMOVSHDUPMask(VT, Mask);
4834 case X86ISD::MOVDDUP:
4835 DecodeMOVDDUPMask(VT, Mask);
4838 case X86ISD::MOVLHPD:
4839 case X86ISD::MOVLPD:
4840 case X86ISD::MOVLPS:
4841 // Not yet implemented
4843 case X86ISD::VPERMV: {
4845 SDValue MaskNode = N->getOperand(0);
4846 while (MaskNode->getOpcode() == ISD::BITCAST)
4847 MaskNode = MaskNode->getOperand(0);
4849 unsigned MaskLoBits = Log2_64(VT.getVectorNumElements());
4850 SmallVector<uint64_t, 32> RawMask;
4851 if (MaskNode->getOpcode() == ISD::BUILD_VECTOR) {
4852 // If we have a build-vector, then things are easy.
4853 assert(MaskNode.getSimpleValueType().isInteger() &&
4854 MaskNode.getSimpleValueType().getVectorNumElements() ==
4855 VT.getVectorNumElements());
4857 for (unsigned i = 0; i < MaskNode->getNumOperands(); ++i) {
4858 SDValue Op = MaskNode->getOperand(i);
4859 if (Op->getOpcode() == ISD::UNDEF)
4860 RawMask.push_back((uint64_t)SM_SentinelUndef);
4861 else if (isa<ConstantSDNode>(Op)) {
4862 APInt MaskElement = cast<ConstantSDNode>(Op)->getAPIntValue();
4863 RawMask.push_back(MaskElement.getLoBits(MaskLoBits).getZExtValue());
4867 DecodeVPERMVMask(RawMask, Mask);
4870 if (MaskNode->getOpcode() == X86ISD::VBROADCAST) {
4871 unsigned NumEltsInMask = MaskNode->getNumOperands();
4872 MaskNode = MaskNode->getOperand(0);
4873 auto *CN = dyn_cast<ConstantSDNode>(MaskNode);
4875 APInt MaskEltValue = CN->getAPIntValue();
4876 for (unsigned i = 0; i < NumEltsInMask; ++i)
4877 RawMask.push_back(MaskEltValue.getLoBits(MaskLoBits).getZExtValue());
4878 DecodeVPERMVMask(RawMask, Mask);
4881 // It may be a scalar load
4884 auto *MaskLoad = dyn_cast<LoadSDNode>(MaskNode);
4888 SDValue Ptr = MaskLoad->getBasePtr();
4889 if (Ptr->getOpcode() == X86ISD::Wrapper ||
4890 Ptr->getOpcode() == X86ISD::WrapperRIP)
4891 Ptr = Ptr->getOperand(0);
4893 auto *MaskCP = dyn_cast<ConstantPoolSDNode>(Ptr);
4894 if (!MaskCP || MaskCP->isMachineConstantPoolEntry())
4897 auto *C = dyn_cast<Constant>(MaskCP->getConstVal());
4899 DecodeVPERMVMask(C, VT, Mask);
4906 case X86ISD::VPERMV3: {
4908 SDValue MaskNode = N->getOperand(1);
4909 while (MaskNode->getOpcode() == ISD::BITCAST)
4910 MaskNode = MaskNode->getOperand(1);
4912 if (MaskNode->getOpcode() == ISD::BUILD_VECTOR) {
4913 // If we have a build-vector, then things are easy.
4914 assert(MaskNode.getSimpleValueType().isInteger() &&
4915 MaskNode.getSimpleValueType().getVectorNumElements() ==
4916 VT.getVectorNumElements());
4918 SmallVector<uint64_t, 32> RawMask;
4919 unsigned MaskLoBits = Log2_64(VT.getVectorNumElements()*2);
4921 for (unsigned i = 0; i < MaskNode->getNumOperands(); ++i) {
4922 SDValue Op = MaskNode->getOperand(i);
4923 if (Op->getOpcode() == ISD::UNDEF)
4924 RawMask.push_back((uint64_t)SM_SentinelUndef);
4926 auto *CN = dyn_cast<ConstantSDNode>(Op.getNode());
4929 APInt MaskElement = CN->getAPIntValue();
4930 RawMask.push_back(MaskElement.getLoBits(MaskLoBits).getZExtValue());
4933 DecodeVPERMV3Mask(RawMask, Mask);
4937 auto *MaskLoad = dyn_cast<LoadSDNode>(MaskNode);
4941 SDValue Ptr = MaskLoad->getBasePtr();
4942 if (Ptr->getOpcode() == X86ISD::Wrapper ||
4943 Ptr->getOpcode() == X86ISD::WrapperRIP)
4944 Ptr = Ptr->getOperand(0);
4946 auto *MaskCP = dyn_cast<ConstantPoolSDNode>(Ptr);
4947 if (!MaskCP || MaskCP->isMachineConstantPoolEntry())
4950 auto *C = dyn_cast<Constant>(MaskCP->getConstVal());
4952 DecodeVPERMV3Mask(C, VT, Mask);
4959 default: llvm_unreachable("unknown target shuffle node");
4962 // If we have a fake unary shuffle, the shuffle mask is spread across two
4963 // inputs that are actually the same node. Re-map the mask to always point
4964 // into the first input.
4967 if (M >= (int)Mask.size())
4973 /// Returns the scalar element that will make up the ith
4974 /// element of the result of the vector shuffle.
4975 static SDValue getShuffleScalarElt(SDNode *N, unsigned Index, SelectionDAG &DAG,
4978 return SDValue(); // Limit search depth.
4980 SDValue V = SDValue(N, 0);
4981 EVT VT = V.getValueType();
4982 unsigned Opcode = V.getOpcode();
4984 // Recurse into ISD::VECTOR_SHUFFLE node to find scalars.
4985 if (const ShuffleVectorSDNode *SV = dyn_cast<ShuffleVectorSDNode>(N)) {
4986 int Elt = SV->getMaskElt(Index);
4989 return DAG.getUNDEF(VT.getVectorElementType());
4991 unsigned NumElems = VT.getVectorNumElements();
4992 SDValue NewV = (Elt < (int)NumElems) ? SV->getOperand(0)
4993 : SV->getOperand(1);
4994 return getShuffleScalarElt(NewV.getNode(), Elt % NumElems, DAG, Depth+1);
4997 // Recurse into target specific vector shuffles to find scalars.
4998 if (isTargetShuffle(Opcode)) {
4999 MVT ShufVT = V.getSimpleValueType();
5000 unsigned NumElems = ShufVT.getVectorNumElements();
5001 SmallVector<int, 16> ShuffleMask;
5004 if (!getTargetShuffleMask(N, ShufVT, ShuffleMask, IsUnary))
5007 int Elt = ShuffleMask[Index];
5009 return DAG.getUNDEF(ShufVT.getVectorElementType());
5011 SDValue NewV = (Elt < (int)NumElems) ? N->getOperand(0)
5013 return getShuffleScalarElt(NewV.getNode(), Elt % NumElems, DAG,
5017 // Actual nodes that may contain scalar elements
5018 if (Opcode == ISD::BITCAST) {
5019 V = V.getOperand(0);
5020 EVT SrcVT = V.getValueType();
5021 unsigned NumElems = VT.getVectorNumElements();
5023 if (!SrcVT.isVector() || SrcVT.getVectorNumElements() != NumElems)
5027 if (V.getOpcode() == ISD::SCALAR_TO_VECTOR)
5028 return (Index == 0) ? V.getOperand(0)
5029 : DAG.getUNDEF(VT.getVectorElementType());
5031 if (V.getOpcode() == ISD::BUILD_VECTOR)
5032 return V.getOperand(Index);
5037 /// Custom lower build_vector of v16i8.
5038 static SDValue LowerBuildVectorv16i8(SDValue Op, unsigned NonZeros,
5039 unsigned NumNonZero, unsigned NumZero,
5041 const X86Subtarget* Subtarget,
5042 const TargetLowering &TLI) {
5050 // SSE4.1 - use PINSRB to insert each byte directly.
5051 if (Subtarget->hasSSE41()) {
5052 for (unsigned i = 0; i < 16; ++i) {
5053 bool isNonZero = (NonZeros & (1 << i)) != 0;
5057 V = getZeroVector(MVT::v16i8, Subtarget, DAG, dl);
5059 V = DAG.getUNDEF(MVT::v16i8);
5062 V = DAG.getNode(ISD::INSERT_VECTOR_ELT, dl,
5063 MVT::v16i8, V, Op.getOperand(i),
5064 DAG.getIntPtrConstant(i, dl));
5071 // Pre-SSE4.1 - merge byte pairs and insert with PINSRW.
5072 for (unsigned i = 0; i < 16; ++i) {
5073 bool ThisIsNonZero = (NonZeros & (1 << i)) != 0;
5074 if (ThisIsNonZero && First) {
5076 V = getZeroVector(MVT::v8i16, Subtarget, DAG, dl);
5078 V = DAG.getUNDEF(MVT::v8i16);
5083 SDValue ThisElt, LastElt;
5084 bool LastIsNonZero = (NonZeros & (1 << (i-1))) != 0;
5085 if (LastIsNonZero) {
5086 LastElt = DAG.getNode(ISD::ZERO_EXTEND, dl,
5087 MVT::i16, Op.getOperand(i-1));
5089 if (ThisIsNonZero) {
5090 ThisElt = DAG.getNode(ISD::ZERO_EXTEND, dl, MVT::i16, Op.getOperand(i));
5091 ThisElt = DAG.getNode(ISD::SHL, dl, MVT::i16,
5092 ThisElt, DAG.getConstant(8, dl, MVT::i8));
5094 ThisElt = DAG.getNode(ISD::OR, dl, MVT::i16, ThisElt, LastElt);
5098 if (ThisElt.getNode())
5099 V = DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, MVT::v8i16, V, ThisElt,
5100 DAG.getIntPtrConstant(i/2, dl));
5104 return DAG.getBitcast(MVT::v16i8, V);
5107 /// Custom lower build_vector of v8i16.
5108 static SDValue LowerBuildVectorv8i16(SDValue Op, unsigned NonZeros,
5109 unsigned NumNonZero, unsigned NumZero,
5111 const X86Subtarget* Subtarget,
5112 const TargetLowering &TLI) {
5119 for (unsigned i = 0; i < 8; ++i) {
5120 bool isNonZero = (NonZeros & (1 << i)) != 0;
5124 V = getZeroVector(MVT::v8i16, Subtarget, DAG, dl);
5126 V = DAG.getUNDEF(MVT::v8i16);
5129 V = DAG.getNode(ISD::INSERT_VECTOR_ELT, dl,
5130 MVT::v8i16, V, Op.getOperand(i),
5131 DAG.getIntPtrConstant(i, dl));
5138 /// Custom lower build_vector of v4i32 or v4f32.
5139 static SDValue LowerBuildVectorv4x32(SDValue Op, SelectionDAG &DAG,
5140 const X86Subtarget *Subtarget,
5141 const TargetLowering &TLI) {
5142 // Find all zeroable elements.
5143 std::bitset<4> Zeroable;
5144 for (int i=0; i < 4; ++i) {
5145 SDValue Elt = Op->getOperand(i);
5146 Zeroable[i] = (Elt.getOpcode() == ISD::UNDEF || X86::isZeroNode(Elt));
5148 assert(Zeroable.size() - Zeroable.count() > 1 &&
5149 "We expect at least two non-zero elements!");
5151 // We only know how to deal with build_vector nodes where elements are either
5152 // zeroable or extract_vector_elt with constant index.
5153 SDValue FirstNonZero;
5154 unsigned FirstNonZeroIdx;
5155 for (unsigned i=0; i < 4; ++i) {
5158 SDValue Elt = Op->getOperand(i);
5159 if (Elt.getOpcode() != ISD::EXTRACT_VECTOR_ELT ||
5160 !isa<ConstantSDNode>(Elt.getOperand(1)))
5162 // Make sure that this node is extracting from a 128-bit vector.
5163 MVT VT = Elt.getOperand(0).getSimpleValueType();
5164 if (!VT.is128BitVector())
5166 if (!FirstNonZero.getNode()) {
5168 FirstNonZeroIdx = i;
5172 assert(FirstNonZero.getNode() && "Unexpected build vector of all zeros!");
5173 SDValue V1 = FirstNonZero.getOperand(0);
5174 MVT VT = V1.getSimpleValueType();
5176 // See if this build_vector can be lowered as a blend with zero.
5178 unsigned EltMaskIdx, EltIdx;
5180 for (EltIdx = 0; EltIdx < 4; ++EltIdx) {
5181 if (Zeroable[EltIdx]) {
5182 // The zero vector will be on the right hand side.
5183 Mask[EltIdx] = EltIdx+4;
5187 Elt = Op->getOperand(EltIdx);
5188 // By construction, Elt is a EXTRACT_VECTOR_ELT with constant index.
5189 EltMaskIdx = cast<ConstantSDNode>(Elt.getOperand(1))->getZExtValue();
5190 if (Elt.getOperand(0) != V1 || EltMaskIdx != EltIdx)
5192 Mask[EltIdx] = EltIdx;
5196 // Let the shuffle legalizer deal with blend operations.
5197 SDValue VZero = getZeroVector(VT, Subtarget, DAG, SDLoc(Op));
5198 if (V1.getSimpleValueType() != VT)
5199 V1 = DAG.getNode(ISD::BITCAST, SDLoc(V1), VT, V1);
5200 return DAG.getVectorShuffle(VT, SDLoc(V1), V1, VZero, &Mask[0]);
5203 // See if we can lower this build_vector to a INSERTPS.
5204 if (!Subtarget->hasSSE41())
5207 SDValue V2 = Elt.getOperand(0);
5208 if (Elt == FirstNonZero && EltIdx == FirstNonZeroIdx)
5211 bool CanFold = true;
5212 for (unsigned i = EltIdx + 1; i < 4 && CanFold; ++i) {
5216 SDValue Current = Op->getOperand(i);
5217 SDValue SrcVector = Current->getOperand(0);
5220 CanFold = SrcVector == V1 &&
5221 cast<ConstantSDNode>(Current.getOperand(1))->getZExtValue() == i;
5227 assert(V1.getNode() && "Expected at least two non-zero elements!");
5228 if (V1.getSimpleValueType() != MVT::v4f32)
5229 V1 = DAG.getNode(ISD::BITCAST, SDLoc(V1), MVT::v4f32, V1);
5230 if (V2.getSimpleValueType() != MVT::v4f32)
5231 V2 = DAG.getNode(ISD::BITCAST, SDLoc(V2), MVT::v4f32, V2);
5233 // Ok, we can emit an INSERTPS instruction.
5234 unsigned ZMask = Zeroable.to_ulong();
5236 unsigned InsertPSMask = EltMaskIdx << 6 | EltIdx << 4 | ZMask;
5237 assert((InsertPSMask & ~0xFFu) == 0 && "Invalid mask!");
5239 SDValue Result = DAG.getNode(X86ISD::INSERTPS, DL, MVT::v4f32, V1, V2,
5240 DAG.getIntPtrConstant(InsertPSMask, DL));
5241 return DAG.getBitcast(VT, Result);
5244 /// Return a vector logical shift node.
5245 static SDValue getVShift(bool isLeft, EVT VT, SDValue SrcOp,
5246 unsigned NumBits, SelectionDAG &DAG,
5247 const TargetLowering &TLI, SDLoc dl) {
5248 assert(VT.is128BitVector() && "Unknown type for VShift");
5249 MVT ShVT = MVT::v2i64;
5250 unsigned Opc = isLeft ? X86ISD::VSHLDQ : X86ISD::VSRLDQ;
5251 SrcOp = DAG.getBitcast(ShVT, SrcOp);
5252 MVT ScalarShiftTy = TLI.getScalarShiftAmountTy(DAG.getDataLayout(), VT);
5253 assert(NumBits % 8 == 0 && "Only support byte sized shifts");
5254 SDValue ShiftVal = DAG.getConstant(NumBits/8, dl, ScalarShiftTy);
5255 return DAG.getBitcast(VT, DAG.getNode(Opc, dl, ShVT, SrcOp, ShiftVal));
5259 LowerAsSplatVectorLoad(SDValue SrcOp, MVT VT, SDLoc dl, SelectionDAG &DAG) {
5261 // Check if the scalar load can be widened into a vector load. And if
5262 // the address is "base + cst" see if the cst can be "absorbed" into
5263 // the shuffle mask.
5264 if (LoadSDNode *LD = dyn_cast<LoadSDNode>(SrcOp)) {
5265 SDValue Ptr = LD->getBasePtr();
5266 if (!ISD::isNormalLoad(LD) || LD->isVolatile())
5268 EVT PVT = LD->getValueType(0);
5269 if (PVT != MVT::i32 && PVT != MVT::f32)
5274 if (FrameIndexSDNode *FINode = dyn_cast<FrameIndexSDNode>(Ptr)) {
5275 FI = FINode->getIndex();
5277 } else if (DAG.isBaseWithConstantOffset(Ptr) &&
5278 isa<FrameIndexSDNode>(Ptr.getOperand(0))) {
5279 FI = cast<FrameIndexSDNode>(Ptr.getOperand(0))->getIndex();
5280 Offset = Ptr.getConstantOperandVal(1);
5281 Ptr = Ptr.getOperand(0);
5286 // FIXME: 256-bit vector instructions don't require a strict alignment,
5287 // improve this code to support it better.
5288 unsigned RequiredAlign = VT.getSizeInBits()/8;
5289 SDValue Chain = LD->getChain();
5290 // Make sure the stack object alignment is at least 16 or 32.
5291 MachineFrameInfo *MFI = DAG.getMachineFunction().getFrameInfo();
5292 if (DAG.InferPtrAlignment(Ptr) < RequiredAlign) {
5293 if (MFI->isFixedObjectIndex(FI)) {
5294 // Can't change the alignment. FIXME: It's possible to compute
5295 // the exact stack offset and reference FI + adjust offset instead.
5296 // If someone *really* cares about this. That's the way to implement it.
5299 MFI->setObjectAlignment(FI, RequiredAlign);
5303 // (Offset % 16 or 32) must be multiple of 4. Then address is then
5304 // Ptr + (Offset & ~15).
5307 if ((Offset % RequiredAlign) & 3)
5309 int64_t StartOffset = Offset & ~int64_t(RequiredAlign - 1);
5312 Ptr = DAG.getNode(ISD::ADD, DL, Ptr.getValueType(), Ptr,
5313 DAG.getConstant(StartOffset, DL, Ptr.getValueType()));
5316 int EltNo = (Offset - StartOffset) >> 2;
5317 unsigned NumElems = VT.getVectorNumElements();
5319 EVT NVT = EVT::getVectorVT(*DAG.getContext(), PVT, NumElems);
5320 SDValue V1 = DAG.getLoad(NVT, dl, Chain, Ptr,
5321 LD->getPointerInfo().getWithOffset(StartOffset),
5322 false, false, false, 0);
5324 SmallVector<int, 8> Mask(NumElems, EltNo);
5326 return DAG.getVectorShuffle(NVT, dl, V1, DAG.getUNDEF(NVT), &Mask[0]);
5332 /// Given the initializing elements 'Elts' of a vector of type 'VT', see if the
5333 /// elements can be replaced by a single large load which has the same value as
5334 /// a build_vector or insert_subvector whose loaded operands are 'Elts'.
5336 /// Example: <load i32 *a, load i32 *a+4, undef, undef> -> zextload a
5338 /// FIXME: we'd also like to handle the case where the last elements are zero
5339 /// rather than undef via VZEXT_LOAD, but we do not detect that case today.
5340 /// There's even a handy isZeroNode for that purpose.
5341 static SDValue EltsFromConsecutiveLoads(EVT VT, ArrayRef<SDValue> Elts,
5342 SDLoc &DL, SelectionDAG &DAG,
5343 bool isAfterLegalize) {
5344 unsigned NumElems = Elts.size();
5346 LoadSDNode *LDBase = nullptr;
5347 unsigned LastLoadedElt = -1U;
5349 // For each element in the initializer, see if we've found a load or an undef.
5350 // If we don't find an initial load element, or later load elements are
5351 // non-consecutive, bail out.
5352 for (unsigned i = 0; i < NumElems; ++i) {
5353 SDValue Elt = Elts[i];
5354 // Look through a bitcast.
5355 if (Elt.getNode() && Elt.getOpcode() == ISD::BITCAST)
5356 Elt = Elt.getOperand(0);
5357 if (!Elt.getNode() ||
5358 (Elt.getOpcode() != ISD::UNDEF && !ISD::isNON_EXTLoad(Elt.getNode())))
5361 if (Elt.getNode()->getOpcode() == ISD::UNDEF)
5363 LDBase = cast<LoadSDNode>(Elt.getNode());
5367 if (Elt.getOpcode() == ISD::UNDEF)
5370 LoadSDNode *LD = cast<LoadSDNode>(Elt);
5371 EVT LdVT = Elt.getValueType();
5372 // Each loaded element must be the correct fractional portion of the
5373 // requested vector load.
5374 if (LdVT.getSizeInBits() != VT.getSizeInBits() / NumElems)
5376 if (!DAG.isConsecutiveLoad(LD, LDBase, LdVT.getSizeInBits() / 8, i))
5381 // If we have found an entire vector of loads and undefs, then return a large
5382 // load of the entire vector width starting at the base pointer. If we found
5383 // consecutive loads for the low half, generate a vzext_load node.
5384 if (LastLoadedElt == NumElems - 1) {
5385 assert(LDBase && "Did not find base load for merging consecutive loads");
5386 EVT EltVT = LDBase->getValueType(0);
5387 // Ensure that the input vector size for the merged loads matches the
5388 // cumulative size of the input elements.
5389 if (VT.getSizeInBits() != EltVT.getSizeInBits() * NumElems)
5392 if (isAfterLegalize &&
5393 !DAG.getTargetLoweringInfo().isOperationLegal(ISD::LOAD, VT))
5396 SDValue NewLd = SDValue();
5398 NewLd = DAG.getLoad(VT, DL, LDBase->getChain(), LDBase->getBasePtr(),
5399 LDBase->getPointerInfo(), LDBase->isVolatile(),
5400 LDBase->isNonTemporal(), LDBase->isInvariant(),
5401 LDBase->getAlignment());
5403 if (LDBase->hasAnyUseOfValue(1)) {
5404 SDValue NewChain = DAG.getNode(ISD::TokenFactor, DL, MVT::Other,
5406 SDValue(NewLd.getNode(), 1));
5407 DAG.ReplaceAllUsesOfValueWith(SDValue(LDBase, 1), NewChain);
5408 DAG.UpdateNodeOperands(NewChain.getNode(), SDValue(LDBase, 1),
5409 SDValue(NewLd.getNode(), 1));
5415 //TODO: The code below fires only for for loading the low v2i32 / v2f32
5416 //of a v4i32 / v4f32. It's probably worth generalizing.
5417 EVT EltVT = VT.getVectorElementType();
5418 if (NumElems == 4 && LastLoadedElt == 1 && (EltVT.getSizeInBits() == 32) &&
5419 DAG.getTargetLoweringInfo().isTypeLegal(MVT::v2i64)) {
5420 SDVTList Tys = DAG.getVTList(MVT::v2i64, MVT::Other);
5421 SDValue Ops[] = { LDBase->getChain(), LDBase->getBasePtr() };
5423 DAG.getMemIntrinsicNode(X86ISD::VZEXT_LOAD, DL, Tys, Ops, MVT::i64,
5424 LDBase->getPointerInfo(),
5425 LDBase->getAlignment(),
5426 false/*isVolatile*/, true/*ReadMem*/,
5429 // Make sure the newly-created LOAD is in the same position as LDBase in
5430 // terms of dependency. We create a TokenFactor for LDBase and ResNode, and
5431 // update uses of LDBase's output chain to use the TokenFactor.
5432 if (LDBase->hasAnyUseOfValue(1)) {
5433 SDValue NewChain = DAG.getNode(ISD::TokenFactor, DL, MVT::Other,
5434 SDValue(LDBase, 1), SDValue(ResNode.getNode(), 1));
5435 DAG.ReplaceAllUsesOfValueWith(SDValue(LDBase, 1), NewChain);
5436 DAG.UpdateNodeOperands(NewChain.getNode(), SDValue(LDBase, 1),
5437 SDValue(ResNode.getNode(), 1));
5440 return DAG.getBitcast(VT, ResNode);
5445 /// LowerVectorBroadcast - Attempt to use the vbroadcast instruction
5446 /// to generate a splat value for the following cases:
5447 /// 1. A splat BUILD_VECTOR which uses a single scalar load, or a constant.
5448 /// 2. A splat shuffle which uses a scalar_to_vector node which comes from
5449 /// a scalar load, or a constant.
5450 /// The VBROADCAST node is returned when a pattern is found,
5451 /// or SDValue() otherwise.
5452 static SDValue LowerVectorBroadcast(SDValue Op, const X86Subtarget* Subtarget,
5453 SelectionDAG &DAG) {
5454 // VBROADCAST requires AVX.
5455 // TODO: Splats could be generated for non-AVX CPUs using SSE
5456 // instructions, but there's less potential gain for only 128-bit vectors.
5457 if (!Subtarget->hasAVX())
5460 MVT VT = Op.getSimpleValueType();
5463 assert((VT.is128BitVector() || VT.is256BitVector() || VT.is512BitVector()) &&
5464 "Unsupported vector type for broadcast.");
5469 switch (Op.getOpcode()) {
5471 // Unknown pattern found.
5474 case ISD::BUILD_VECTOR: {
5475 auto *BVOp = cast<BuildVectorSDNode>(Op.getNode());
5476 BitVector UndefElements;
5477 SDValue Splat = BVOp->getSplatValue(&UndefElements);
5479 // We need a splat of a single value to use broadcast, and it doesn't
5480 // make any sense if the value is only in one element of the vector.
5481 if (!Splat || (VT.getVectorNumElements() - UndefElements.count()) <= 1)
5485 ConstSplatVal = (Ld.getOpcode() == ISD::Constant ||
5486 Ld.getOpcode() == ISD::ConstantFP);
5488 // Make sure that all of the users of a non-constant load are from the
5489 // BUILD_VECTOR node.
5490 if (!ConstSplatVal && !BVOp->isOnlyUserOf(Ld.getNode()))
5495 case ISD::VECTOR_SHUFFLE: {
5496 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
5498 // Shuffles must have a splat mask where the first element is
5500 if ((!SVOp->isSplat()) || SVOp->getMaskElt(0) != 0)
5503 SDValue Sc = Op.getOperand(0);
5504 if (Sc.getOpcode() != ISD::SCALAR_TO_VECTOR &&
5505 Sc.getOpcode() != ISD::BUILD_VECTOR) {
5507 if (!Subtarget->hasInt256())
5510 // Use the register form of the broadcast instruction available on AVX2.
5511 if (VT.getSizeInBits() >= 256)
5512 Sc = Extract128BitVector(Sc, 0, DAG, dl);
5513 return DAG.getNode(X86ISD::VBROADCAST, dl, VT, Sc);
5516 Ld = Sc.getOperand(0);
5517 ConstSplatVal = (Ld.getOpcode() == ISD::Constant ||
5518 Ld.getOpcode() == ISD::ConstantFP);
5520 // The scalar_to_vector node and the suspected
5521 // load node must have exactly one user.
5522 // Constants may have multiple users.
5524 // AVX-512 has register version of the broadcast
5525 bool hasRegVer = Subtarget->hasAVX512() && VT.is512BitVector() &&
5526 Ld.getValueType().getSizeInBits() >= 32;
5527 if (!ConstSplatVal && ((!Sc.hasOneUse() || !Ld.hasOneUse()) &&
5534 unsigned ScalarSize = Ld.getValueType().getSizeInBits();
5535 bool IsGE256 = (VT.getSizeInBits() >= 256);
5537 // When optimizing for size, generate up to 5 extra bytes for a broadcast
5538 // instruction to save 8 or more bytes of constant pool data.
5539 // TODO: If multiple splats are generated to load the same constant,
5540 // it may be detrimental to overall size. There needs to be a way to detect
5541 // that condition to know if this is truly a size win.
5542 bool OptForSize = DAG.getMachineFunction().getFunction()->optForSize();
5544 // Handle broadcasting a single constant scalar from the constant pool
5546 // On Sandybridge (no AVX2), it is still better to load a constant vector
5547 // from the constant pool and not to broadcast it from a scalar.
5548 // But override that restriction when optimizing for size.
5549 // TODO: Check if splatting is recommended for other AVX-capable CPUs.
5550 if (ConstSplatVal && (Subtarget->hasAVX2() || OptForSize)) {
5551 EVT CVT = Ld.getValueType();
5552 assert(!CVT.isVector() && "Must not broadcast a vector type");
5554 // Splat f32, i32, v4f64, v4i64 in all cases with AVX2.
5555 // For size optimization, also splat v2f64 and v2i64, and for size opt
5556 // with AVX2, also splat i8 and i16.
5557 // With pattern matching, the VBROADCAST node may become a VMOVDDUP.
5558 if (ScalarSize == 32 || (IsGE256 && ScalarSize == 64) ||
5559 (OptForSize && (ScalarSize == 64 || Subtarget->hasAVX2()))) {
5560 const Constant *C = nullptr;
5561 if (ConstantSDNode *CI = dyn_cast<ConstantSDNode>(Ld))
5562 C = CI->getConstantIntValue();
5563 else if (ConstantFPSDNode *CF = dyn_cast<ConstantFPSDNode>(Ld))
5564 C = CF->getConstantFPValue();
5566 assert(C && "Invalid constant type");
5568 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
5570 DAG.getConstantPool(C, TLI.getPointerTy(DAG.getDataLayout()));
5571 unsigned Alignment = cast<ConstantPoolSDNode>(CP)->getAlignment();
5573 CVT, dl, DAG.getEntryNode(), CP,
5574 MachinePointerInfo::getConstantPool(DAG.getMachineFunction()), false,
5575 false, false, Alignment);
5577 return DAG.getNode(X86ISD::VBROADCAST, dl, VT, Ld);
5581 bool IsLoad = ISD::isNormalLoad(Ld.getNode());
5583 // Handle AVX2 in-register broadcasts.
5584 if (!IsLoad && Subtarget->hasInt256() &&
5585 (ScalarSize == 32 || (IsGE256 && ScalarSize == 64)))
5586 return DAG.getNode(X86ISD::VBROADCAST, dl, VT, Ld);
5588 // The scalar source must be a normal load.
5592 if (ScalarSize == 32 || (IsGE256 && ScalarSize == 64) ||
5593 (Subtarget->hasVLX() && ScalarSize == 64))
5594 return DAG.getNode(X86ISD::VBROADCAST, dl, VT, Ld);
5596 // The integer check is needed for the 64-bit into 128-bit so it doesn't match
5597 // double since there is no vbroadcastsd xmm
5598 if (Subtarget->hasInt256() && Ld.getValueType().isInteger()) {
5599 if (ScalarSize == 8 || ScalarSize == 16 || ScalarSize == 64)
5600 return DAG.getNode(X86ISD::VBROADCAST, dl, VT, Ld);
5603 // Unsupported broadcast.
5607 /// \brief For an EXTRACT_VECTOR_ELT with a constant index return the real
5608 /// underlying vector and index.
5610 /// Modifies \p ExtractedFromVec to the real vector and returns the real
5612 static int getUnderlyingExtractedFromVec(SDValue &ExtractedFromVec,
5614 int Idx = cast<ConstantSDNode>(ExtIdx)->getZExtValue();
5615 if (!isa<ShuffleVectorSDNode>(ExtractedFromVec))
5618 // For 256-bit vectors, LowerEXTRACT_VECTOR_ELT_SSE4 may have already
5620 // (extract_vector_elt (v8f32 %vreg1), Constant<6>)
5622 // (extract_vector_elt (vector_shuffle<2,u,u,u>
5623 // (extract_subvector (v8f32 %vreg0), Constant<4>),
5626 // In this case the vector is the extract_subvector expression and the index
5627 // is 2, as specified by the shuffle.
5628 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(ExtractedFromVec);
5629 SDValue ShuffleVec = SVOp->getOperand(0);
5630 MVT ShuffleVecVT = ShuffleVec.getSimpleValueType();
5631 assert(ShuffleVecVT.getVectorElementType() ==
5632 ExtractedFromVec.getSimpleValueType().getVectorElementType());
5634 int ShuffleIdx = SVOp->getMaskElt(Idx);
5635 if (isUndefOrInRange(ShuffleIdx, 0, ShuffleVecVT.getVectorNumElements())) {
5636 ExtractedFromVec = ShuffleVec;
5642 static SDValue buildFromShuffleMostly(SDValue Op, SelectionDAG &DAG) {
5643 MVT VT = Op.getSimpleValueType();
5645 // Skip if insert_vec_elt is not supported.
5646 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
5647 if (!TLI.isOperationLegalOrCustom(ISD::INSERT_VECTOR_ELT, VT))
5651 unsigned NumElems = Op.getNumOperands();
5655 SmallVector<unsigned, 4> InsertIndices;
5656 SmallVector<int, 8> Mask(NumElems, -1);
5658 for (unsigned i = 0; i != NumElems; ++i) {
5659 unsigned Opc = Op.getOperand(i).getOpcode();
5661 if (Opc == ISD::UNDEF)
5664 if (Opc != ISD::EXTRACT_VECTOR_ELT) {
5665 // Quit if more than 1 elements need inserting.
5666 if (InsertIndices.size() > 1)
5669 InsertIndices.push_back(i);
5673 SDValue ExtractedFromVec = Op.getOperand(i).getOperand(0);
5674 SDValue ExtIdx = Op.getOperand(i).getOperand(1);
5675 // Quit if non-constant index.
5676 if (!isa<ConstantSDNode>(ExtIdx))
5678 int Idx = getUnderlyingExtractedFromVec(ExtractedFromVec, ExtIdx);
5680 // Quit if extracted from vector of different type.
5681 if (ExtractedFromVec.getValueType() != VT)
5684 if (!VecIn1.getNode())
5685 VecIn1 = ExtractedFromVec;
5686 else if (VecIn1 != ExtractedFromVec) {
5687 if (!VecIn2.getNode())
5688 VecIn2 = ExtractedFromVec;
5689 else if (VecIn2 != ExtractedFromVec)
5690 // Quit if more than 2 vectors to shuffle
5694 if (ExtractedFromVec == VecIn1)
5696 else if (ExtractedFromVec == VecIn2)
5697 Mask[i] = Idx + NumElems;
5700 if (!VecIn1.getNode())
5703 VecIn2 = VecIn2.getNode() ? VecIn2 : DAG.getUNDEF(VT);
5704 SDValue NV = DAG.getVectorShuffle(VT, DL, VecIn1, VecIn2, &Mask[0]);
5705 for (unsigned i = 0, e = InsertIndices.size(); i != e; ++i) {
5706 unsigned Idx = InsertIndices[i];
5707 NV = DAG.getNode(ISD::INSERT_VECTOR_ELT, DL, VT, NV, Op.getOperand(Idx),
5708 DAG.getIntPtrConstant(Idx, DL));
5714 static SDValue ConvertI1VectorToInteger(SDValue Op, SelectionDAG &DAG) {
5715 assert(ISD::isBuildVectorOfConstantSDNodes(Op.getNode()) &&
5716 Op.getScalarValueSizeInBits() == 1 &&
5717 "Can not convert non-constant vector");
5718 uint64_t Immediate = 0;
5719 for (unsigned idx = 0, e = Op.getNumOperands(); idx < e; ++idx) {
5720 SDValue In = Op.getOperand(idx);
5721 if (In.getOpcode() != ISD::UNDEF)
5722 Immediate |= cast<ConstantSDNode>(In)->getZExtValue() << idx;
5726 MVT::getIntegerVT(std::max((int)Op.getValueType().getSizeInBits(), 8));
5727 return DAG.getConstant(Immediate, dl, VT);
5729 // Lower BUILD_VECTOR operation for v8i1 and v16i1 types.
5731 X86TargetLowering::LowerBUILD_VECTORvXi1(SDValue Op, SelectionDAG &DAG) const {
5733 MVT VT = Op.getSimpleValueType();
5734 assert((VT.getVectorElementType() == MVT::i1) &&
5735 "Unexpected type in LowerBUILD_VECTORvXi1!");
5738 if (ISD::isBuildVectorAllZeros(Op.getNode())) {
5739 SDValue Cst = DAG.getTargetConstant(0, dl, MVT::i1);
5740 SmallVector<SDValue, 16> Ops(VT.getVectorNumElements(), Cst);
5741 return DAG.getNode(ISD::BUILD_VECTOR, dl, VT, Ops);
5744 if (ISD::isBuildVectorAllOnes(Op.getNode())) {
5745 SDValue Cst = DAG.getTargetConstant(1, dl, MVT::i1);
5746 SmallVector<SDValue, 16> Ops(VT.getVectorNumElements(), Cst);
5747 return DAG.getNode(ISD::BUILD_VECTOR, dl, VT, Ops);
5750 if (ISD::isBuildVectorOfConstantSDNodes(Op.getNode())) {
5751 SDValue Imm = ConvertI1VectorToInteger(Op, DAG);
5752 if (Imm.getValueSizeInBits() == VT.getSizeInBits())
5753 return DAG.getBitcast(VT, Imm);
5754 SDValue ExtVec = DAG.getBitcast(MVT::v8i1, Imm);
5755 return DAG.getNode(ISD::EXTRACT_SUBVECTOR, dl, VT, ExtVec,
5756 DAG.getIntPtrConstant(0, dl));
5759 // Vector has one or more non-const elements
5760 uint64_t Immediate = 0;
5761 SmallVector<unsigned, 16> NonConstIdx;
5762 bool IsSplat = true;
5763 bool HasConstElts = false;
5765 for (unsigned idx = 0, e = Op.getNumOperands(); idx < e; ++idx) {
5766 SDValue In = Op.getOperand(idx);
5767 if (In.getOpcode() == ISD::UNDEF)
5769 if (!isa<ConstantSDNode>(In))
5770 NonConstIdx.push_back(idx);
5772 Immediate |= cast<ConstantSDNode>(In)->getZExtValue() << idx;
5773 HasConstElts = true;
5777 else if (In != Op.getOperand(SplatIdx))
5781 // for splat use " (select i1 splat_elt, all-ones, all-zeroes)"
5783 return DAG.getNode(ISD::SELECT, dl, VT, Op.getOperand(SplatIdx),
5784 DAG.getConstant(1, dl, VT),
5785 DAG.getConstant(0, dl, VT));
5787 // insert elements one by one
5791 MVT ImmVT = MVT::getIntegerVT(std::max((int)VT.getSizeInBits(), 8));
5792 Imm = DAG.getConstant(Immediate, dl, ImmVT);
5794 else if (HasConstElts)
5795 Imm = DAG.getConstant(0, dl, VT);
5797 Imm = DAG.getUNDEF(VT);
5798 if (Imm.getValueSizeInBits() == VT.getSizeInBits())
5799 DstVec = DAG.getBitcast(VT, Imm);
5801 SDValue ExtVec = DAG.getBitcast(MVT::v8i1, Imm);
5802 DstVec = DAG.getNode(ISD::EXTRACT_SUBVECTOR, dl, VT, ExtVec,
5803 DAG.getIntPtrConstant(0, dl));
5806 for (unsigned i = 0; i < NonConstIdx.size(); ++i) {
5807 unsigned InsertIdx = NonConstIdx[i];
5808 DstVec = DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, VT, DstVec,
5809 Op.getOperand(InsertIdx),
5810 DAG.getIntPtrConstant(InsertIdx, dl));
5815 /// \brief Return true if \p N implements a horizontal binop and return the
5816 /// operands for the horizontal binop into V0 and V1.
5818 /// This is a helper function of LowerToHorizontalOp().
5819 /// This function checks that the build_vector \p N in input implements a
5820 /// horizontal operation. Parameter \p Opcode defines the kind of horizontal
5821 /// operation to match.
5822 /// For example, if \p Opcode is equal to ISD::ADD, then this function
5823 /// checks if \p N implements a horizontal arithmetic add; if instead \p Opcode
5824 /// is equal to ISD::SUB, then this function checks if this is a horizontal
5827 /// This function only analyzes elements of \p N whose indices are
5828 /// in range [BaseIdx, LastIdx).
5829 static bool isHorizontalBinOp(const BuildVectorSDNode *N, unsigned Opcode,
5831 unsigned BaseIdx, unsigned LastIdx,
5832 SDValue &V0, SDValue &V1) {
5833 EVT VT = N->getValueType(0);
5835 assert(BaseIdx * 2 <= LastIdx && "Invalid Indices in input!");
5836 assert(VT.isVector() && VT.getVectorNumElements() >= LastIdx &&
5837 "Invalid Vector in input!");
5839 bool IsCommutable = (Opcode == ISD::ADD || Opcode == ISD::FADD);
5840 bool CanFold = true;
5841 unsigned ExpectedVExtractIdx = BaseIdx;
5842 unsigned NumElts = LastIdx - BaseIdx;
5843 V0 = DAG.getUNDEF(VT);
5844 V1 = DAG.getUNDEF(VT);
5846 // Check if N implements a horizontal binop.
5847 for (unsigned i = 0, e = NumElts; i != e && CanFold; ++i) {
5848 SDValue Op = N->getOperand(i + BaseIdx);
5851 if (Op->getOpcode() == ISD::UNDEF) {
5852 // Update the expected vector extract index.
5853 if (i * 2 == NumElts)
5854 ExpectedVExtractIdx = BaseIdx;
5855 ExpectedVExtractIdx += 2;
5859 CanFold = Op->getOpcode() == Opcode && Op->hasOneUse();
5864 SDValue Op0 = Op.getOperand(0);
5865 SDValue Op1 = Op.getOperand(1);
5867 // Try to match the following pattern:
5868 // (BINOP (extract_vector_elt A, I), (extract_vector_elt A, I+1))
5869 CanFold = (Op0.getOpcode() == ISD::EXTRACT_VECTOR_ELT &&
5870 Op1.getOpcode() == ISD::EXTRACT_VECTOR_ELT &&
5871 Op0.getOperand(0) == Op1.getOperand(0) &&
5872 isa<ConstantSDNode>(Op0.getOperand(1)) &&
5873 isa<ConstantSDNode>(Op1.getOperand(1)));
5877 unsigned I0 = cast<ConstantSDNode>(Op0.getOperand(1))->getZExtValue();
5878 unsigned I1 = cast<ConstantSDNode>(Op1.getOperand(1))->getZExtValue();
5880 if (i * 2 < NumElts) {
5881 if (V0.getOpcode() == ISD::UNDEF) {
5882 V0 = Op0.getOperand(0);
5883 if (V0.getValueType() != VT)
5887 if (V1.getOpcode() == ISD::UNDEF) {
5888 V1 = Op0.getOperand(0);
5889 if (V1.getValueType() != VT)
5892 if (i * 2 == NumElts)
5893 ExpectedVExtractIdx = BaseIdx;
5896 SDValue Expected = (i * 2 < NumElts) ? V0 : V1;
5897 if (I0 == ExpectedVExtractIdx)
5898 CanFold = I1 == I0 + 1 && Op0.getOperand(0) == Expected;
5899 else if (IsCommutable && I1 == ExpectedVExtractIdx) {
5900 // Try to match the following dag sequence:
5901 // (BINOP (extract_vector_elt A, I+1), (extract_vector_elt A, I))
5902 CanFold = I0 == I1 + 1 && Op1.getOperand(0) == Expected;
5906 ExpectedVExtractIdx += 2;
5912 /// \brief Emit a sequence of two 128-bit horizontal add/sub followed by
5913 /// a concat_vector.
5915 /// This is a helper function of LowerToHorizontalOp().
5916 /// This function expects two 256-bit vectors called V0 and V1.
5917 /// At first, each vector is split into two separate 128-bit vectors.
5918 /// Then, the resulting 128-bit vectors are used to implement two
5919 /// horizontal binary operations.
5921 /// The kind of horizontal binary operation is defined by \p X86Opcode.
5923 /// \p Mode specifies how the 128-bit parts of V0 and V1 are passed in input to
5924 /// the two new horizontal binop.
5925 /// When Mode is set, the first horizontal binop dag node would take as input
5926 /// the lower 128-bit of V0 and the upper 128-bit of V0. The second
5927 /// horizontal binop dag node would take as input the lower 128-bit of V1
5928 /// and the upper 128-bit of V1.
5930 /// HADD V0_LO, V0_HI
5931 /// HADD V1_LO, V1_HI
5933 /// Otherwise, the first horizontal binop dag node takes as input the lower
5934 /// 128-bit of V0 and the lower 128-bit of V1, and the second horizontal binop
5935 /// dag node takes the upper 128-bit of V0 and the upper 128-bit of V1.
5937 /// HADD V0_LO, V1_LO
5938 /// HADD V0_HI, V1_HI
5940 /// If \p isUndefLO is set, then the algorithm propagates UNDEF to the lower
5941 /// 128-bits of the result. If \p isUndefHI is set, then UNDEF is propagated to
5942 /// the upper 128-bits of the result.
5943 static SDValue ExpandHorizontalBinOp(const SDValue &V0, const SDValue &V1,
5944 SDLoc DL, SelectionDAG &DAG,
5945 unsigned X86Opcode, bool Mode,
5946 bool isUndefLO, bool isUndefHI) {
5947 EVT VT = V0.getValueType();
5948 assert(VT.is256BitVector() && VT == V1.getValueType() &&
5949 "Invalid nodes in input!");
5951 unsigned NumElts = VT.getVectorNumElements();
5952 SDValue V0_LO = Extract128BitVector(V0, 0, DAG, DL);
5953 SDValue V0_HI = Extract128BitVector(V0, NumElts/2, DAG, DL);
5954 SDValue V1_LO = Extract128BitVector(V1, 0, DAG, DL);
5955 SDValue V1_HI = Extract128BitVector(V1, NumElts/2, DAG, DL);
5956 EVT NewVT = V0_LO.getValueType();
5958 SDValue LO = DAG.getUNDEF(NewVT);
5959 SDValue HI = DAG.getUNDEF(NewVT);
5962 // Don't emit a horizontal binop if the result is expected to be UNDEF.
5963 if (!isUndefLO && V0->getOpcode() != ISD::UNDEF)
5964 LO = DAG.getNode(X86Opcode, DL, NewVT, V0_LO, V0_HI);
5965 if (!isUndefHI && V1->getOpcode() != ISD::UNDEF)
5966 HI = DAG.getNode(X86Opcode, DL, NewVT, V1_LO, V1_HI);
5968 // Don't emit a horizontal binop if the result is expected to be UNDEF.
5969 if (!isUndefLO && (V0_LO->getOpcode() != ISD::UNDEF ||
5970 V1_LO->getOpcode() != ISD::UNDEF))
5971 LO = DAG.getNode(X86Opcode, DL, NewVT, V0_LO, V1_LO);
5973 if (!isUndefHI && (V0_HI->getOpcode() != ISD::UNDEF ||
5974 V1_HI->getOpcode() != ISD::UNDEF))
5975 HI = DAG.getNode(X86Opcode, DL, NewVT, V0_HI, V1_HI);
5978 return DAG.getNode(ISD::CONCAT_VECTORS, DL, VT, LO, HI);
5981 /// Try to fold a build_vector that performs an 'addsub' to an X86ISD::ADDSUB
5983 static SDValue LowerToAddSub(const BuildVectorSDNode *BV,
5984 const X86Subtarget *Subtarget, SelectionDAG &DAG) {
5985 MVT VT = BV->getSimpleValueType(0);
5986 if ((!Subtarget->hasSSE3() || (VT != MVT::v4f32 && VT != MVT::v2f64)) &&
5987 (!Subtarget->hasAVX() || (VT != MVT::v8f32 && VT != MVT::v4f64)))
5991 unsigned NumElts = VT.getVectorNumElements();
5992 SDValue InVec0 = DAG.getUNDEF(VT);
5993 SDValue InVec1 = DAG.getUNDEF(VT);
5995 assert((VT == MVT::v8f32 || VT == MVT::v4f64 || VT == MVT::v4f32 ||
5996 VT == MVT::v2f64) && "build_vector with an invalid type found!");
5998 // Odd-numbered elements in the input build vector are obtained from
5999 // adding two integer/float elements.
6000 // Even-numbered elements in the input build vector are obtained from
6001 // subtracting two integer/float elements.
6002 unsigned ExpectedOpcode = ISD::FSUB;
6003 unsigned NextExpectedOpcode = ISD::FADD;
6004 bool AddFound = false;
6005 bool SubFound = false;
6007 for (unsigned i = 0, e = NumElts; i != e; ++i) {
6008 SDValue Op = BV->getOperand(i);
6010 // Skip 'undef' values.
6011 unsigned Opcode = Op.getOpcode();
6012 if (Opcode == ISD::UNDEF) {
6013 std::swap(ExpectedOpcode, NextExpectedOpcode);
6017 // Early exit if we found an unexpected opcode.
6018 if (Opcode != ExpectedOpcode)
6021 SDValue Op0 = Op.getOperand(0);
6022 SDValue Op1 = Op.getOperand(1);
6024 // Try to match the following pattern:
6025 // (BINOP (extract_vector_elt A, i), (extract_vector_elt B, i))
6026 // Early exit if we cannot match that sequence.
6027 if (Op0.getOpcode() != ISD::EXTRACT_VECTOR_ELT ||
6028 Op1.getOpcode() != ISD::EXTRACT_VECTOR_ELT ||
6029 !isa<ConstantSDNode>(Op0.getOperand(1)) ||
6030 !isa<ConstantSDNode>(Op1.getOperand(1)) ||
6031 Op0.getOperand(1) != Op1.getOperand(1))
6034 unsigned I0 = cast<ConstantSDNode>(Op0.getOperand(1))->getZExtValue();
6038 // We found a valid add/sub node. Update the information accordingly.
6044 // Update InVec0 and InVec1.
6045 if (InVec0.getOpcode() == ISD::UNDEF) {
6046 InVec0 = Op0.getOperand(0);
6047 if (InVec0.getSimpleValueType() != VT)
6050 if (InVec1.getOpcode() == ISD::UNDEF) {
6051 InVec1 = Op1.getOperand(0);
6052 if (InVec1.getSimpleValueType() != VT)
6056 // Make sure that operands in input to each add/sub node always
6057 // come from a same pair of vectors.
6058 if (InVec0 != Op0.getOperand(0)) {
6059 if (ExpectedOpcode == ISD::FSUB)
6062 // FADD is commutable. Try to commute the operands
6063 // and then test again.
6064 std::swap(Op0, Op1);
6065 if (InVec0 != Op0.getOperand(0))
6069 if (InVec1 != Op1.getOperand(0))
6072 // Update the pair of expected opcodes.
6073 std::swap(ExpectedOpcode, NextExpectedOpcode);
6076 // Don't try to fold this build_vector into an ADDSUB if the inputs are undef.
6077 if (AddFound && SubFound && InVec0.getOpcode() != ISD::UNDEF &&
6078 InVec1.getOpcode() != ISD::UNDEF)
6079 return DAG.getNode(X86ISD::ADDSUB, DL, VT, InVec0, InVec1);
6084 /// Lower BUILD_VECTOR to a horizontal add/sub operation if possible.
6085 static SDValue LowerToHorizontalOp(const BuildVectorSDNode *BV,
6086 const X86Subtarget *Subtarget,
6087 SelectionDAG &DAG) {
6088 MVT VT = BV->getSimpleValueType(0);
6089 unsigned NumElts = VT.getVectorNumElements();
6090 unsigned NumUndefsLO = 0;
6091 unsigned NumUndefsHI = 0;
6092 unsigned Half = NumElts/2;
6094 // Count the number of UNDEF operands in the build_vector in input.
6095 for (unsigned i = 0, e = Half; i != e; ++i)
6096 if (BV->getOperand(i)->getOpcode() == ISD::UNDEF)
6099 for (unsigned i = Half, e = NumElts; i != e; ++i)
6100 if (BV->getOperand(i)->getOpcode() == ISD::UNDEF)
6103 // Early exit if this is either a build_vector of all UNDEFs or all the
6104 // operands but one are UNDEF.
6105 if (NumUndefsLO + NumUndefsHI + 1 >= NumElts)
6109 SDValue InVec0, InVec1;
6110 if ((VT == MVT::v4f32 || VT == MVT::v2f64) && Subtarget->hasSSE3()) {
6111 // Try to match an SSE3 float HADD/HSUB.
6112 if (isHorizontalBinOp(BV, ISD::FADD, DAG, 0, NumElts, InVec0, InVec1))
6113 return DAG.getNode(X86ISD::FHADD, DL, VT, InVec0, InVec1);
6115 if (isHorizontalBinOp(BV, ISD::FSUB, DAG, 0, NumElts, InVec0, InVec1))
6116 return DAG.getNode(X86ISD::FHSUB, DL, VT, InVec0, InVec1);
6117 } else if ((VT == MVT::v4i32 || VT == MVT::v8i16) && Subtarget->hasSSSE3()) {
6118 // Try to match an SSSE3 integer HADD/HSUB.
6119 if (isHorizontalBinOp(BV, ISD::ADD, DAG, 0, NumElts, InVec0, InVec1))
6120 return DAG.getNode(X86ISD::HADD, DL, VT, InVec0, InVec1);
6122 if (isHorizontalBinOp(BV, ISD::SUB, DAG, 0, NumElts, InVec0, InVec1))
6123 return DAG.getNode(X86ISD::HSUB, DL, VT, InVec0, InVec1);
6126 if (!Subtarget->hasAVX())
6129 if ((VT == MVT::v8f32 || VT == MVT::v4f64)) {
6130 // Try to match an AVX horizontal add/sub of packed single/double
6131 // precision floating point values from 256-bit vectors.
6132 SDValue InVec2, InVec3;
6133 if (isHorizontalBinOp(BV, ISD::FADD, DAG, 0, Half, InVec0, InVec1) &&
6134 isHorizontalBinOp(BV, ISD::FADD, DAG, Half, NumElts, InVec2, InVec3) &&
6135 ((InVec0.getOpcode() == ISD::UNDEF ||
6136 InVec2.getOpcode() == ISD::UNDEF) || InVec0 == InVec2) &&
6137 ((InVec1.getOpcode() == ISD::UNDEF ||
6138 InVec3.getOpcode() == ISD::UNDEF) || InVec1 == InVec3))
6139 return DAG.getNode(X86ISD::FHADD, DL, VT, InVec0, InVec1);
6141 if (isHorizontalBinOp(BV, ISD::FSUB, DAG, 0, Half, InVec0, InVec1) &&
6142 isHorizontalBinOp(BV, ISD::FSUB, DAG, Half, NumElts, InVec2, InVec3) &&
6143 ((InVec0.getOpcode() == ISD::UNDEF ||
6144 InVec2.getOpcode() == ISD::UNDEF) || InVec0 == InVec2) &&
6145 ((InVec1.getOpcode() == ISD::UNDEF ||
6146 InVec3.getOpcode() == ISD::UNDEF) || InVec1 == InVec3))
6147 return DAG.getNode(X86ISD::FHSUB, DL, VT, InVec0, InVec1);
6148 } else if (VT == MVT::v8i32 || VT == MVT::v16i16) {
6149 // Try to match an AVX2 horizontal add/sub of signed integers.
6150 SDValue InVec2, InVec3;
6152 bool CanFold = true;
6154 if (isHorizontalBinOp(BV, ISD::ADD, DAG, 0, Half, InVec0, InVec1) &&
6155 isHorizontalBinOp(BV, ISD::ADD, DAG, Half, NumElts, InVec2, InVec3) &&
6156 ((InVec0.getOpcode() == ISD::UNDEF ||
6157 InVec2.getOpcode() == ISD::UNDEF) || InVec0 == InVec2) &&
6158 ((InVec1.getOpcode() == ISD::UNDEF ||
6159 InVec3.getOpcode() == ISD::UNDEF) || InVec1 == InVec3))
6160 X86Opcode = X86ISD::HADD;
6161 else if (isHorizontalBinOp(BV, ISD::SUB, DAG, 0, Half, InVec0, InVec1) &&
6162 isHorizontalBinOp(BV, ISD::SUB, DAG, Half, NumElts, InVec2, InVec3) &&
6163 ((InVec0.getOpcode() == ISD::UNDEF ||
6164 InVec2.getOpcode() == ISD::UNDEF) || InVec0 == InVec2) &&
6165 ((InVec1.getOpcode() == ISD::UNDEF ||
6166 InVec3.getOpcode() == ISD::UNDEF) || InVec1 == InVec3))
6167 X86Opcode = X86ISD::HSUB;
6172 // Fold this build_vector into a single horizontal add/sub.
6173 // Do this only if the target has AVX2.
6174 if (Subtarget->hasAVX2())
6175 return DAG.getNode(X86Opcode, DL, VT, InVec0, InVec1);
6177 // Do not try to expand this build_vector into a pair of horizontal
6178 // add/sub if we can emit a pair of scalar add/sub.
6179 if (NumUndefsLO + 1 == Half || NumUndefsHI + 1 == Half)
6182 // Convert this build_vector into a pair of horizontal binop followed by
6184 bool isUndefLO = NumUndefsLO == Half;
6185 bool isUndefHI = NumUndefsHI == Half;
6186 return ExpandHorizontalBinOp(InVec0, InVec1, DL, DAG, X86Opcode, false,
6187 isUndefLO, isUndefHI);
6191 if ((VT == MVT::v8f32 || VT == MVT::v4f64 || VT == MVT::v8i32 ||
6192 VT == MVT::v16i16) && Subtarget->hasAVX()) {
6194 if (isHorizontalBinOp(BV, ISD::ADD, DAG, 0, NumElts, InVec0, InVec1))
6195 X86Opcode = X86ISD::HADD;
6196 else if (isHorizontalBinOp(BV, ISD::SUB, DAG, 0, NumElts, InVec0, InVec1))
6197 X86Opcode = X86ISD::HSUB;
6198 else if (isHorizontalBinOp(BV, ISD::FADD, DAG, 0, NumElts, InVec0, InVec1))
6199 X86Opcode = X86ISD::FHADD;
6200 else if (isHorizontalBinOp(BV, ISD::FSUB, DAG, 0, NumElts, InVec0, InVec1))
6201 X86Opcode = X86ISD::FHSUB;
6205 // Don't try to expand this build_vector into a pair of horizontal add/sub
6206 // if we can simply emit a pair of scalar add/sub.
6207 if (NumUndefsLO + 1 == Half || NumUndefsHI + 1 == Half)
6210 // Convert this build_vector into two horizontal add/sub followed by
6212 bool isUndefLO = NumUndefsLO == Half;
6213 bool isUndefHI = NumUndefsHI == Half;
6214 return ExpandHorizontalBinOp(InVec0, InVec1, DL, DAG, X86Opcode, true,
6215 isUndefLO, isUndefHI);
6222 X86TargetLowering::LowerBUILD_VECTOR(SDValue Op, SelectionDAG &DAG) const {
6225 MVT VT = Op.getSimpleValueType();
6226 MVT ExtVT = VT.getVectorElementType();
6227 unsigned NumElems = Op.getNumOperands();
6229 // Generate vectors for predicate vectors.
6230 if (VT.getVectorElementType() == MVT::i1 && Subtarget->hasAVX512())
6231 return LowerBUILD_VECTORvXi1(Op, DAG);
6233 // Vectors containing all zeros can be matched by pxor and xorps later
6234 if (ISD::isBuildVectorAllZeros(Op.getNode())) {
6235 // Canonicalize this to <4 x i32> to 1) ensure the zero vectors are CSE'd
6236 // and 2) ensure that i64 scalars are eliminated on x86-32 hosts.
6237 if (VT == MVT::v4i32 || VT == MVT::v8i32 || VT == MVT::v16i32)
6240 return getZeroVector(VT, Subtarget, DAG, dl);
6243 // Vectors containing all ones can be matched by pcmpeqd on 128-bit width
6244 // vectors or broken into v4i32 operations on 256-bit vectors. AVX2 can use
6245 // vpcmpeqd on 256-bit vectors.
6246 if (Subtarget->hasSSE2() && ISD::isBuildVectorAllOnes(Op.getNode())) {
6247 if (VT == MVT::v4i32 || (VT == MVT::v8i32 && Subtarget->hasInt256()))
6250 if (!VT.is512BitVector())
6251 return getOnesVector(VT, Subtarget, DAG, dl);
6254 BuildVectorSDNode *BV = cast<BuildVectorSDNode>(Op.getNode());
6255 if (SDValue AddSub = LowerToAddSub(BV, Subtarget, DAG))
6257 if (SDValue HorizontalOp = LowerToHorizontalOp(BV, Subtarget, DAG))
6258 return HorizontalOp;
6259 if (SDValue Broadcast = LowerVectorBroadcast(Op, Subtarget, DAG))
6262 unsigned EVTBits = ExtVT.getSizeInBits();
6264 unsigned NumZero = 0;
6265 unsigned NumNonZero = 0;
6266 uint64_t NonZeros = 0;
6267 bool IsAllConstants = true;
6268 SmallSet<SDValue, 8> Values;
6269 for (unsigned i = 0; i < NumElems; ++i) {
6270 SDValue Elt = Op.getOperand(i);
6271 if (Elt.getOpcode() == ISD::UNDEF)
6274 if (Elt.getOpcode() != ISD::Constant &&
6275 Elt.getOpcode() != ISD::ConstantFP)
6276 IsAllConstants = false;
6277 if (X86::isZeroNode(Elt))
6280 assert(i < sizeof(NonZeros) * 8); // Make sure the shift is within range.
6281 NonZeros |= ((uint64_t)1 << i);
6286 // All undef vector. Return an UNDEF. All zero vectors were handled above.
6287 if (NumNonZero == 0)
6288 return DAG.getUNDEF(VT);
6290 // Special case for single non-zero, non-undef, element.
6291 if (NumNonZero == 1) {
6292 unsigned Idx = countTrailingZeros(NonZeros);
6293 SDValue Item = Op.getOperand(Idx);
6295 // If this is an insertion of an i64 value on x86-32, and if the top bits of
6296 // the value are obviously zero, truncate the value to i32 and do the
6297 // insertion that way. Only do this if the value is non-constant or if the
6298 // value is a constant being inserted into element 0. It is cheaper to do
6299 // a constant pool load than it is to do a movd + shuffle.
6300 if (ExtVT == MVT::i64 && !Subtarget->is64Bit() &&
6301 (!IsAllConstants || Idx == 0)) {
6302 if (DAG.MaskedValueIsZero(Item, APInt::getBitsSet(64, 32, 64))) {
6304 assert(VT == MVT::v2i64 && "Expected an SSE value type!");
6305 MVT VecVT = MVT::v4i32;
6307 // Truncate the value (which may itself be a constant) to i32, and
6308 // convert it to a vector with movd (S2V+shuffle to zero extend).
6309 Item = DAG.getNode(ISD::TRUNCATE, dl, MVT::i32, Item);
6310 Item = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VecVT, Item);
6311 return DAG.getBitcast(VT, getShuffleVectorZeroOrUndef(
6312 Item, Idx * 2, true, Subtarget, DAG));
6316 // If we have a constant or non-constant insertion into the low element of
6317 // a vector, we can do this with SCALAR_TO_VECTOR + shuffle of zero into
6318 // the rest of the elements. This will be matched as movd/movq/movss/movsd
6319 // depending on what the source datatype is.
6322 return DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VT, Item);
6324 if (ExtVT == MVT::i32 || ExtVT == MVT::f32 || ExtVT == MVT::f64 ||
6325 (ExtVT == MVT::i64 && Subtarget->is64Bit())) {
6326 if (VT.is512BitVector()) {
6327 SDValue ZeroVec = getZeroVector(VT, Subtarget, DAG, dl);
6328 return DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, VT, ZeroVec,
6329 Item, DAG.getIntPtrConstant(0, dl));
6331 assert((VT.is128BitVector() || VT.is256BitVector()) &&
6332 "Expected an SSE value type!");
6333 Item = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VT, Item);
6334 // Turn it into a MOVL (i.e. movss, movsd, or movd) to a zero vector.
6335 return getShuffleVectorZeroOrUndef(Item, 0, true, Subtarget, DAG);
6338 // We can't directly insert an i8 or i16 into a vector, so zero extend
6340 if (ExtVT == MVT::i16 || ExtVT == MVT::i8) {
6341 Item = DAG.getNode(ISD::ZERO_EXTEND, dl, MVT::i32, Item);
6342 if (VT.is256BitVector()) {
6343 if (Subtarget->hasAVX()) {
6344 Item = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, MVT::v8i32, Item);
6345 Item = getShuffleVectorZeroOrUndef(Item, 0, true, Subtarget, DAG);
6347 // Without AVX, we need to extend to a 128-bit vector and then
6348 // insert into the 256-bit vector.
6349 Item = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, MVT::v4i32, Item);
6350 SDValue ZeroVec = getZeroVector(MVT::v8i32, Subtarget, DAG, dl);
6351 Item = Insert128BitVector(ZeroVec, Item, 0, DAG, dl);
6354 assert(VT.is128BitVector() && "Expected an SSE value type!");
6355 Item = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, MVT::v4i32, Item);
6356 Item = getShuffleVectorZeroOrUndef(Item, 0, true, Subtarget, DAG);
6358 return DAG.getBitcast(VT, Item);
6362 // Is it a vector logical left shift?
6363 if (NumElems == 2 && Idx == 1 &&
6364 X86::isZeroNode(Op.getOperand(0)) &&
6365 !X86::isZeroNode(Op.getOperand(1))) {
6366 unsigned NumBits = VT.getSizeInBits();
6367 return getVShift(true, VT,
6368 DAG.getNode(ISD::SCALAR_TO_VECTOR, dl,
6369 VT, Op.getOperand(1)),
6370 NumBits/2, DAG, *this, dl);
6373 if (IsAllConstants) // Otherwise, it's better to do a constpool load.
6376 // Otherwise, if this is a vector with i32 or f32 elements, and the element
6377 // is a non-constant being inserted into an element other than the low one,
6378 // we can't use a constant pool load. Instead, use SCALAR_TO_VECTOR (aka
6379 // movd/movss) to move this into the low element, then shuffle it into
6381 if (EVTBits == 32) {
6382 Item = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VT, Item);
6383 return getShuffleVectorZeroOrUndef(Item, Idx, NumZero > 0, Subtarget, DAG);
6387 // Splat is obviously ok. Let legalizer expand it to a shuffle.
6388 if (Values.size() == 1) {
6389 if (EVTBits == 32) {
6390 // Instead of a shuffle like this:
6391 // shuffle (scalar_to_vector (load (ptr + 4))), undef, <0, 0, 0, 0>
6392 // Check if it's possible to issue this instead.
6393 // shuffle (vload ptr)), undef, <1, 1, 1, 1>
6394 unsigned Idx = countTrailingZeros(NonZeros);
6395 SDValue Item = Op.getOperand(Idx);
6396 if (Op.getNode()->isOnlyUserOf(Item.getNode()))
6397 return LowerAsSplatVectorLoad(Item, VT, dl, DAG);
6402 // A vector full of immediates; various special cases are already
6403 // handled, so this is best done with a single constant-pool load.
6407 // For AVX-length vectors, see if we can use a vector load to get all of the
6408 // elements, otherwise build the individual 128-bit pieces and use
6409 // shuffles to put them in place.
6410 if (VT.is256BitVector() || VT.is512BitVector()) {
6411 SmallVector<SDValue, 64> V(Op->op_begin(), Op->op_begin() + NumElems);
6413 // Check for a build vector of consecutive loads.
6414 if (SDValue LD = EltsFromConsecutiveLoads(VT, V, dl, DAG, false))
6417 EVT HVT = EVT::getVectorVT(*DAG.getContext(), ExtVT, NumElems/2);
6419 // Build both the lower and upper subvector.
6420 SDValue Lower = DAG.getNode(ISD::BUILD_VECTOR, dl, HVT,
6421 makeArrayRef(&V[0], NumElems/2));
6422 SDValue Upper = DAG.getNode(ISD::BUILD_VECTOR, dl, HVT,
6423 makeArrayRef(&V[NumElems / 2], NumElems/2));
6425 // Recreate the wider vector with the lower and upper part.
6426 if (VT.is256BitVector())
6427 return Concat128BitVectors(Lower, Upper, VT, NumElems, DAG, dl);
6428 return Concat256BitVectors(Lower, Upper, VT, NumElems, DAG, dl);
6431 // Let legalizer expand 2-wide build_vectors.
6432 if (EVTBits == 64) {
6433 if (NumNonZero == 1) {
6434 // One half is zero or undef.
6435 unsigned Idx = countTrailingZeros(NonZeros);
6436 SDValue V2 = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VT,
6437 Op.getOperand(Idx));
6438 return getShuffleVectorZeroOrUndef(V2, Idx, true, Subtarget, DAG);
6443 // If element VT is < 32 bits, convert it to inserts into a zero vector.
6444 if (EVTBits == 8 && NumElems == 16)
6445 if (SDValue V = LowerBuildVectorv16i8(Op, NonZeros, NumNonZero, NumZero,
6446 DAG, Subtarget, *this))
6449 if (EVTBits == 16 && NumElems == 8)
6450 if (SDValue V = LowerBuildVectorv8i16(Op, NonZeros, NumNonZero, NumZero,
6451 DAG, Subtarget, *this))
6454 // If element VT is == 32 bits and has 4 elems, try to generate an INSERTPS
6455 if (EVTBits == 32 && NumElems == 4)
6456 if (SDValue V = LowerBuildVectorv4x32(Op, DAG, Subtarget, *this))
6459 // If element VT is == 32 bits, turn it into a number of shuffles.
6460 SmallVector<SDValue, 8> V(NumElems);
6461 if (NumElems == 4 && NumZero > 0) {
6462 for (unsigned i = 0; i < 4; ++i) {
6463 bool isZero = !(NonZeros & (1ULL << i));
6465 V[i] = getZeroVector(VT, Subtarget, DAG, dl);
6467 V[i] = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VT, Op.getOperand(i));
6470 for (unsigned i = 0; i < 2; ++i) {
6471 switch ((NonZeros & (0x3 << i*2)) >> (i*2)) {
6474 V[i] = V[i*2]; // Must be a zero vector.
6477 V[i] = getMOVL(DAG, dl, VT, V[i*2+1], V[i*2]);
6480 V[i] = getMOVL(DAG, dl, VT, V[i*2], V[i*2+1]);
6483 V[i] = getUnpackl(DAG, dl, VT, V[i*2], V[i*2+1]);
6488 bool Reverse1 = (NonZeros & 0x3) == 2;
6489 bool Reverse2 = ((NonZeros & (0x3 << 2)) >> 2) == 2;
6493 static_cast<int>(Reverse2 ? NumElems+1 : NumElems),
6494 static_cast<int>(Reverse2 ? NumElems : NumElems+1)
6496 return DAG.getVectorShuffle(VT, dl, V[0], V[1], &MaskVec[0]);
6499 if (Values.size() > 1 && VT.is128BitVector()) {
6500 // Check for a build vector of consecutive loads.
6501 for (unsigned i = 0; i < NumElems; ++i)
6502 V[i] = Op.getOperand(i);
6504 // Check for elements which are consecutive loads.
6505 if (SDValue LD = EltsFromConsecutiveLoads(VT, V, dl, DAG, false))
6508 // Check for a build vector from mostly shuffle plus few inserting.
6509 if (SDValue Sh = buildFromShuffleMostly(Op, DAG))
6512 // For SSE 4.1, use insertps to put the high elements into the low element.
6513 if (Subtarget->hasSSE41()) {
6515 if (Op.getOperand(0).getOpcode() != ISD::UNDEF)
6516 Result = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VT, Op.getOperand(0));
6518 Result = DAG.getUNDEF(VT);
6520 for (unsigned i = 1; i < NumElems; ++i) {
6521 if (Op.getOperand(i).getOpcode() == ISD::UNDEF) continue;
6522 Result = DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, VT, Result,
6523 Op.getOperand(i), DAG.getIntPtrConstant(i, dl));
6528 // Otherwise, expand into a number of unpckl*, start by extending each of
6529 // our (non-undef) elements to the full vector width with the element in the
6530 // bottom slot of the vector (which generates no code for SSE).
6531 for (unsigned i = 0; i < NumElems; ++i) {
6532 if (Op.getOperand(i).getOpcode() != ISD::UNDEF)
6533 V[i] = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VT, Op.getOperand(i));
6535 V[i] = DAG.getUNDEF(VT);
6538 // Next, we iteratively mix elements, e.g. for v4f32:
6539 // Step 1: unpcklps 0, 2 ==> X: <?, ?, 2, 0>
6540 // : unpcklps 1, 3 ==> Y: <?, ?, 3, 1>
6541 // Step 2: unpcklps X, Y ==> <3, 2, 1, 0>
6542 unsigned EltStride = NumElems >> 1;
6543 while (EltStride != 0) {
6544 for (unsigned i = 0; i < EltStride; ++i) {
6545 // If V[i+EltStride] is undef and this is the first round of mixing,
6546 // then it is safe to just drop this shuffle: V[i] is already in the
6547 // right place, the one element (since it's the first round) being
6548 // inserted as undef can be dropped. This isn't safe for successive
6549 // rounds because they will permute elements within both vectors.
6550 if (V[i+EltStride].getOpcode() == ISD::UNDEF &&
6551 EltStride == NumElems/2)
6554 V[i] = getUnpackl(DAG, dl, VT, V[i], V[i + EltStride]);
6563 // 256-bit AVX can use the vinsertf128 instruction
6564 // to create 256-bit vectors from two other 128-bit ones.
6565 static SDValue LowerAVXCONCAT_VECTORS(SDValue Op, SelectionDAG &DAG) {
6567 MVT ResVT = Op.getSimpleValueType();
6569 assert((ResVT.is256BitVector() ||
6570 ResVT.is512BitVector()) && "Value type must be 256-/512-bit wide");
6572 SDValue V1 = Op.getOperand(0);
6573 SDValue V2 = Op.getOperand(1);
6574 unsigned NumElems = ResVT.getVectorNumElements();
6575 if (ResVT.is256BitVector())
6576 return Concat128BitVectors(V1, V2, ResVT, NumElems, DAG, dl);
6578 if (Op.getNumOperands() == 4) {
6579 MVT HalfVT = MVT::getVectorVT(ResVT.getVectorElementType(),
6580 ResVT.getVectorNumElements()/2);
6581 SDValue V3 = Op.getOperand(2);
6582 SDValue V4 = Op.getOperand(3);
6583 return Concat256BitVectors(Concat128BitVectors(V1, V2, HalfVT, NumElems/2, DAG, dl),
6584 Concat128BitVectors(V3, V4, HalfVT, NumElems/2, DAG, dl), ResVT, NumElems, DAG, dl);
6586 return Concat256BitVectors(V1, V2, ResVT, NumElems, DAG, dl);
6589 static SDValue LowerCONCAT_VECTORSvXi1(SDValue Op,
6590 const X86Subtarget *Subtarget,
6591 SelectionDAG & DAG) {
6593 MVT ResVT = Op.getSimpleValueType();
6594 unsigned NumOfOperands = Op.getNumOperands();
6596 assert(isPowerOf2_32(NumOfOperands) &&
6597 "Unexpected number of operands in CONCAT_VECTORS");
6599 SDValue Undef = DAG.getUNDEF(ResVT);
6600 if (NumOfOperands > 2) {
6601 // Specialize the cases when all, or all but one, of the operands are undef.
6602 unsigned NumOfDefinedOps = 0;
6604 for (unsigned i = 0; i < NumOfOperands; i++)
6605 if (!Op.getOperand(i).isUndef()) {
6609 if (NumOfDefinedOps == 0)
6611 if (NumOfDefinedOps == 1) {
6612 unsigned SubVecNumElts =
6613 Op.getOperand(OpIdx).getValueType().getVectorNumElements();
6614 SDValue IdxVal = DAG.getIntPtrConstant(SubVecNumElts * OpIdx, dl);
6615 return DAG.getNode(ISD::INSERT_SUBVECTOR, dl, ResVT, Undef,
6616 Op.getOperand(OpIdx), IdxVal);
6619 MVT HalfVT = MVT::getVectorVT(ResVT.getVectorElementType(),
6620 ResVT.getVectorNumElements()/2);
6621 SmallVector<SDValue, 2> Ops;
6622 for (unsigned i = 0; i < NumOfOperands/2; i++)
6623 Ops.push_back(Op.getOperand(i));
6624 SDValue Lo = DAG.getNode(ISD::CONCAT_VECTORS, dl, HalfVT, Ops);
6626 for (unsigned i = NumOfOperands/2; i < NumOfOperands; i++)
6627 Ops.push_back(Op.getOperand(i));
6628 SDValue Hi = DAG.getNode(ISD::CONCAT_VECTORS, dl, HalfVT, Ops);
6629 return DAG.getNode(ISD::CONCAT_VECTORS, dl, ResVT, Lo, Hi);
6633 SDValue V1 = Op.getOperand(0);
6634 SDValue V2 = Op.getOperand(1);
6635 unsigned NumElems = ResVT.getVectorNumElements();
6636 assert(V1.getValueType() == V2.getValueType() &&
6637 V1.getValueType().getVectorNumElements() == NumElems/2 &&
6638 "Unexpected operands in CONCAT_VECTORS");
6640 if (ResVT.getSizeInBits() >= 16)
6641 return Op; // The operation is legal with KUNPCK
6643 bool IsZeroV1 = ISD::isBuildVectorAllZeros(V1.getNode());
6644 bool IsZeroV2 = ISD::isBuildVectorAllZeros(V2.getNode());
6645 SDValue ZeroVec = getZeroVector(ResVT, Subtarget, DAG, dl);
6646 if (IsZeroV1 && IsZeroV2)
6649 SDValue ZeroIdx = DAG.getIntPtrConstant(0, dl);
6651 return DAG.getNode(ISD::INSERT_SUBVECTOR, dl, ResVT, Undef, V1, ZeroIdx);
6653 return DAG.getNode(ISD::INSERT_SUBVECTOR, dl, ResVT, ZeroVec, V1, ZeroIdx);
6655 SDValue IdxVal = DAG.getIntPtrConstant(NumElems/2, dl);
6657 V2 = DAG.getNode(ISD::INSERT_SUBVECTOR, dl, ResVT, Undef, V2, IdxVal);
6660 return DAG.getNode(ISD::INSERT_SUBVECTOR, dl, ResVT, ZeroVec, V2, IdxVal);
6662 V1 = DAG.getNode(ISD::INSERT_SUBVECTOR, dl, ResVT, Undef, V1, ZeroIdx);
6663 return DAG.getNode(ISD::INSERT_SUBVECTOR, dl, ResVT, V1, V2, IdxVal);
6666 static SDValue LowerCONCAT_VECTORS(SDValue Op,
6667 const X86Subtarget *Subtarget,
6668 SelectionDAG &DAG) {
6669 MVT VT = Op.getSimpleValueType();
6670 if (VT.getVectorElementType() == MVT::i1)
6671 return LowerCONCAT_VECTORSvXi1(Op, Subtarget, DAG);
6673 assert((VT.is256BitVector() && Op.getNumOperands() == 2) ||
6674 (VT.is512BitVector() && (Op.getNumOperands() == 2 ||
6675 Op.getNumOperands() == 4)));
6677 // AVX can use the vinsertf128 instruction to create 256-bit vectors
6678 // from two other 128-bit ones.
6680 // 512-bit vector may contain 2 256-bit vectors or 4 128-bit vectors
6681 return LowerAVXCONCAT_VECTORS(Op, DAG);
6684 //===----------------------------------------------------------------------===//
6685 // Vector shuffle lowering
6687 // This is an experimental code path for lowering vector shuffles on x86. It is
6688 // designed to handle arbitrary vector shuffles and blends, gracefully
6689 // degrading performance as necessary. It works hard to recognize idiomatic
6690 // shuffles and lower them to optimal instruction patterns without leaving
6691 // a framework that allows reasonably efficient handling of all vector shuffle
6693 //===----------------------------------------------------------------------===//
6695 /// \brief Tiny helper function to identify a no-op mask.
6697 /// This is a somewhat boring predicate function. It checks whether the mask
6698 /// array input, which is assumed to be a single-input shuffle mask of the kind
6699 /// used by the X86 shuffle instructions (not a fully general
6700 /// ShuffleVectorSDNode mask) requires any shuffles to occur. Both undef and an
6701 /// in-place shuffle are 'no-op's.
6702 static bool isNoopShuffleMask(ArrayRef<int> Mask) {
6703 for (int i = 0, Size = Mask.size(); i < Size; ++i)
6704 if (Mask[i] != -1 && Mask[i] != i)
6709 /// \brief Helper function to classify a mask as a single-input mask.
6711 /// This isn't a generic single-input test because in the vector shuffle
6712 /// lowering we canonicalize single inputs to be the first input operand. This
6713 /// means we can more quickly test for a single input by only checking whether
6714 /// an input from the second operand exists. We also assume that the size of
6715 /// mask corresponds to the size of the input vectors which isn't true in the
6716 /// fully general case.
6717 static bool isSingleInputShuffleMask(ArrayRef<int> Mask) {
6719 if (M >= (int)Mask.size())
6724 /// \brief Test whether there are elements crossing 128-bit lanes in this
6727 /// X86 divides up its shuffles into in-lane and cross-lane shuffle operations
6728 /// and we routinely test for these.
6729 static bool is128BitLaneCrossingShuffleMask(MVT VT, ArrayRef<int> Mask) {
6730 int LaneSize = 128 / VT.getScalarSizeInBits();
6731 int Size = Mask.size();
6732 for (int i = 0; i < Size; ++i)
6733 if (Mask[i] >= 0 && (Mask[i] % Size) / LaneSize != i / LaneSize)
6738 /// \brief Test whether a shuffle mask is equivalent within each 128-bit lane.
6740 /// This checks a shuffle mask to see if it is performing the same
6741 /// 128-bit lane-relative shuffle in each 128-bit lane. This trivially implies
6742 /// that it is also not lane-crossing. It may however involve a blend from the
6743 /// same lane of a second vector.
6745 /// The specific repeated shuffle mask is populated in \p RepeatedMask, as it is
6746 /// non-trivial to compute in the face of undef lanes. The representation is
6747 /// *not* suitable for use with existing 128-bit shuffles as it will contain
6748 /// entries from both V1 and V2 inputs to the wider mask.
6750 is128BitLaneRepeatedShuffleMask(MVT VT, ArrayRef<int> Mask,
6751 SmallVectorImpl<int> &RepeatedMask) {
6752 int LaneSize = 128 / VT.getScalarSizeInBits();
6753 RepeatedMask.resize(LaneSize, -1);
6754 int Size = Mask.size();
6755 for (int i = 0; i < Size; ++i) {
6758 if ((Mask[i] % Size) / LaneSize != i / LaneSize)
6759 // This entry crosses lanes, so there is no way to model this shuffle.
6762 // Ok, handle the in-lane shuffles by detecting if and when they repeat.
6763 if (RepeatedMask[i % LaneSize] == -1)
6764 // This is the first non-undef entry in this slot of a 128-bit lane.
6765 RepeatedMask[i % LaneSize] =
6766 Mask[i] < Size ? Mask[i] % LaneSize : Mask[i] % LaneSize + Size;
6767 else if (RepeatedMask[i % LaneSize] + (i / LaneSize) * LaneSize != Mask[i])
6768 // Found a mismatch with the repeated mask.
6774 /// \brief Checks whether a shuffle mask is equivalent to an explicit list of
6777 /// This is a fast way to test a shuffle mask against a fixed pattern:
6779 /// if (isShuffleEquivalent(Mask, 3, 2, {1, 0})) { ... }
6781 /// It returns true if the mask is exactly as wide as the argument list, and
6782 /// each element of the mask is either -1 (signifying undef) or the value given
6783 /// in the argument.
6784 static bool isShuffleEquivalent(SDValue V1, SDValue V2, ArrayRef<int> Mask,
6785 ArrayRef<int> ExpectedMask) {
6786 if (Mask.size() != ExpectedMask.size())
6789 int Size = Mask.size();
6791 // If the values are build vectors, we can look through them to find
6792 // equivalent inputs that make the shuffles equivalent.
6793 auto *BV1 = dyn_cast<BuildVectorSDNode>(V1);
6794 auto *BV2 = dyn_cast<BuildVectorSDNode>(V2);
6796 for (int i = 0; i < Size; ++i)
6797 if (Mask[i] != -1 && Mask[i] != ExpectedMask[i]) {
6798 auto *MaskBV = Mask[i] < Size ? BV1 : BV2;
6799 auto *ExpectedBV = ExpectedMask[i] < Size ? BV1 : BV2;
6800 if (!MaskBV || !ExpectedBV ||
6801 MaskBV->getOperand(Mask[i] % Size) !=
6802 ExpectedBV->getOperand(ExpectedMask[i] % Size))
6809 /// \brief Get a 4-lane 8-bit shuffle immediate for a mask.
6811 /// This helper function produces an 8-bit shuffle immediate corresponding to
6812 /// the ubiquitous shuffle encoding scheme used in x86 instructions for
6813 /// shuffling 4 lanes. It can be used with most of the PSHUF instructions for
6816 /// NB: We rely heavily on "undef" masks preserving the input lane.
6817 static SDValue getV4X86ShuffleImm8ForMask(ArrayRef<int> Mask, SDLoc DL,
6818 SelectionDAG &DAG) {
6819 assert(Mask.size() == 4 && "Only 4-lane shuffle masks");
6820 assert(Mask[0] >= -1 && Mask[0] < 4 && "Out of bound mask element!");
6821 assert(Mask[1] >= -1 && Mask[1] < 4 && "Out of bound mask element!");
6822 assert(Mask[2] >= -1 && Mask[2] < 4 && "Out of bound mask element!");
6823 assert(Mask[3] >= -1 && Mask[3] < 4 && "Out of bound mask element!");
6826 Imm |= (Mask[0] == -1 ? 0 : Mask[0]) << 0;
6827 Imm |= (Mask[1] == -1 ? 1 : Mask[1]) << 2;
6828 Imm |= (Mask[2] == -1 ? 2 : Mask[2]) << 4;
6829 Imm |= (Mask[3] == -1 ? 3 : Mask[3]) << 6;
6830 return DAG.getConstant(Imm, DL, MVT::i8);
6833 /// \brief Compute whether each element of a shuffle is zeroable.
6835 /// A "zeroable" vector shuffle element is one which can be lowered to zero.
6836 /// Either it is an undef element in the shuffle mask, the element of the input
6837 /// referenced is undef, or the element of the input referenced is known to be
6838 /// zero. Many x86 shuffles can zero lanes cheaply and we often want to handle
6839 /// as many lanes with this technique as possible to simplify the remaining
6841 static SmallBitVector computeZeroableShuffleElements(ArrayRef<int> Mask,
6842 SDValue V1, SDValue V2) {
6843 SmallBitVector Zeroable(Mask.size(), false);
6845 while (V1.getOpcode() == ISD::BITCAST)
6846 V1 = V1->getOperand(0);
6847 while (V2.getOpcode() == ISD::BITCAST)
6848 V2 = V2->getOperand(0);
6850 bool V1IsZero = ISD::isBuildVectorAllZeros(V1.getNode());
6851 bool V2IsZero = ISD::isBuildVectorAllZeros(V2.getNode());
6853 for (int i = 0, Size = Mask.size(); i < Size; ++i) {
6855 // Handle the easy cases.
6856 if (M < 0 || (M >= 0 && M < Size && V1IsZero) || (M >= Size && V2IsZero)) {
6861 // If this is an index into a build_vector node (which has the same number
6862 // of elements), dig out the input value and use it.
6863 SDValue V = M < Size ? V1 : V2;
6864 if (V.getOpcode() != ISD::BUILD_VECTOR || Size != (int)V.getNumOperands())
6867 SDValue Input = V.getOperand(M % Size);
6868 // The UNDEF opcode check really should be dead code here, but not quite
6869 // worth asserting on (it isn't invalid, just unexpected).
6870 if (Input.getOpcode() == ISD::UNDEF || X86::isZeroNode(Input))
6877 // X86 has dedicated unpack instructions that can handle specific blend
6878 // operations: UNPCKH and UNPCKL.
6879 static SDValue lowerVectorShuffleWithUNPCK(SDLoc DL, MVT VT, ArrayRef<int> Mask,
6880 SDValue V1, SDValue V2,
6881 SelectionDAG &DAG) {
6882 int NumElts = VT.getVectorNumElements();
6883 int NumEltsInLane = 128 / VT.getScalarSizeInBits();
6884 SmallVector<int, 8> Unpckl;
6885 SmallVector<int, 8> Unpckh;
6887 for (int i = 0; i < NumElts; ++i) {
6888 unsigned LaneStart = (i / NumEltsInLane) * NumEltsInLane;
6889 int LoPos = (i % NumEltsInLane) / 2 + LaneStart + NumElts * (i % 2);
6890 int HiPos = LoPos + NumEltsInLane / 2;
6891 Unpckl.push_back(LoPos);
6892 Unpckh.push_back(HiPos);
6895 if (isShuffleEquivalent(V1, V2, Mask, Unpckl))
6896 return DAG.getNode(X86ISD::UNPCKL, DL, VT, V1, V2);
6897 if (isShuffleEquivalent(V1, V2, Mask, Unpckh))
6898 return DAG.getNode(X86ISD::UNPCKH, DL, VT, V1, V2);
6900 // Commute and try again.
6901 ShuffleVectorSDNode::commuteMask(Unpckl);
6902 if (isShuffleEquivalent(V1, V2, Mask, Unpckl))
6903 return DAG.getNode(X86ISD::UNPCKL, DL, VT, V2, V1);
6905 ShuffleVectorSDNode::commuteMask(Unpckh);
6906 if (isShuffleEquivalent(V1, V2, Mask, Unpckh))
6907 return DAG.getNode(X86ISD::UNPCKH, DL, VT, V2, V1);
6912 /// \brief Try to emit a bitmask instruction for a shuffle.
6914 /// This handles cases where we can model a blend exactly as a bitmask due to
6915 /// one of the inputs being zeroable.
6916 static SDValue lowerVectorShuffleAsBitMask(SDLoc DL, MVT VT, SDValue V1,
6917 SDValue V2, ArrayRef<int> Mask,
6918 SelectionDAG &DAG) {
6919 MVT EltVT = VT.getVectorElementType();
6920 int NumEltBits = EltVT.getSizeInBits();
6921 MVT IntEltVT = MVT::getIntegerVT(NumEltBits);
6922 SDValue Zero = DAG.getConstant(0, DL, IntEltVT);
6923 SDValue AllOnes = DAG.getConstant(APInt::getAllOnesValue(NumEltBits), DL,
6925 if (EltVT.isFloatingPoint()) {
6926 Zero = DAG.getBitcast(EltVT, Zero);
6927 AllOnes = DAG.getBitcast(EltVT, AllOnes);
6929 SmallVector<SDValue, 16> VMaskOps(Mask.size(), Zero);
6930 SmallBitVector Zeroable = computeZeroableShuffleElements(Mask, V1, V2);
6932 for (int i = 0, Size = Mask.size(); i < Size; ++i) {
6935 if (Mask[i] % Size != i)
6936 return SDValue(); // Not a blend.
6938 V = Mask[i] < Size ? V1 : V2;
6939 else if (V != (Mask[i] < Size ? V1 : V2))
6940 return SDValue(); // Can only let one input through the mask.
6942 VMaskOps[i] = AllOnes;
6945 return SDValue(); // No non-zeroable elements!
6947 SDValue VMask = DAG.getNode(ISD::BUILD_VECTOR, DL, VT, VMaskOps);
6948 V = DAG.getNode(VT.isFloatingPoint()
6949 ? (unsigned) X86ISD::FAND : (unsigned) ISD::AND,
6954 /// \brief Try to emit a blend instruction for a shuffle using bit math.
6956 /// This is used as a fallback approach when first class blend instructions are
6957 /// unavailable. Currently it is only suitable for integer vectors, but could
6958 /// be generalized for floating point vectors if desirable.
6959 static SDValue lowerVectorShuffleAsBitBlend(SDLoc DL, MVT VT, SDValue V1,
6960 SDValue V2, ArrayRef<int> Mask,
6961 SelectionDAG &DAG) {
6962 assert(VT.isInteger() && "Only supports integer vector types!");
6963 MVT EltVT = VT.getVectorElementType();
6964 int NumEltBits = EltVT.getSizeInBits();
6965 SDValue Zero = DAG.getConstant(0, DL, EltVT);
6966 SDValue AllOnes = DAG.getConstant(APInt::getAllOnesValue(NumEltBits), DL,
6968 SmallVector<SDValue, 16> MaskOps;
6969 for (int i = 0, Size = Mask.size(); i < Size; ++i) {
6970 if (Mask[i] != -1 && Mask[i] != i && Mask[i] != i + Size)
6971 return SDValue(); // Shuffled input!
6972 MaskOps.push_back(Mask[i] < Size ? AllOnes : Zero);
6975 SDValue V1Mask = DAG.getNode(ISD::BUILD_VECTOR, DL, VT, MaskOps);
6976 V1 = DAG.getNode(ISD::AND, DL, VT, V1, V1Mask);
6977 // We have to cast V2 around.
6978 MVT MaskVT = MVT::getVectorVT(MVT::i64, VT.getSizeInBits() / 64);
6979 V2 = DAG.getBitcast(VT, DAG.getNode(X86ISD::ANDNP, DL, MaskVT,
6980 DAG.getBitcast(MaskVT, V1Mask),
6981 DAG.getBitcast(MaskVT, V2)));
6982 return DAG.getNode(ISD::OR, DL, VT, V1, V2);
6985 /// \brief Try to emit a blend instruction for a shuffle.
6987 /// This doesn't do any checks for the availability of instructions for blending
6988 /// these values. It relies on the availability of the X86ISD::BLENDI pattern to
6989 /// be matched in the backend with the type given. What it does check for is
6990 /// that the shuffle mask is a blend, or convertible into a blend with zero.
6991 static SDValue lowerVectorShuffleAsBlend(SDLoc DL, MVT VT, SDValue V1,
6992 SDValue V2, ArrayRef<int> Original,
6993 const X86Subtarget *Subtarget,
6994 SelectionDAG &DAG) {
6995 bool V1IsZero = ISD::isBuildVectorAllZeros(V1.getNode());
6996 bool V2IsZero = ISD::isBuildVectorAllZeros(V2.getNode());
6997 SmallVector<int, 8> Mask(Original.begin(), Original.end());
6998 SmallBitVector Zeroable = computeZeroableShuffleElements(Mask, V1, V2);
6999 bool ForceV1Zero = false, ForceV2Zero = false;
7001 // Attempt to generate the binary blend mask. If an input is zero then
7002 // we can use any lane.
7003 // TODO: generalize the zero matching to any scalar like isShuffleEquivalent.
7004 unsigned BlendMask = 0;
7005 for (int i = 0, Size = Mask.size(); i < Size; ++i) {
7011 if (M == i + Size) {
7012 BlendMask |= 1u << i;
7023 BlendMask |= 1u << i;
7028 return SDValue(); // Shuffled input!
7031 // Create a REAL zero vector - ISD::isBuildVectorAllZeros allows UNDEFs.
7033 V1 = getZeroVector(VT, Subtarget, DAG, DL);
7035 V2 = getZeroVector(VT, Subtarget, DAG, DL);
7037 auto ScaleBlendMask = [](unsigned BlendMask, int Size, int Scale) {
7038 unsigned ScaledMask = 0;
7039 for (int i = 0; i != Size; ++i)
7040 if (BlendMask & (1u << i))
7041 for (int j = 0; j != Scale; ++j)
7042 ScaledMask |= 1u << (i * Scale + j);
7046 switch (VT.SimpleTy) {
7051 return DAG.getNode(X86ISD::BLENDI, DL, VT, V1, V2,
7052 DAG.getConstant(BlendMask, DL, MVT::i8));
7056 assert(Subtarget->hasAVX2() && "256-bit integer blends require AVX2!");
7060 // If we have AVX2 it is faster to use VPBLENDD when the shuffle fits into
7061 // that instruction.
7062 if (Subtarget->hasAVX2()) {
7063 // Scale the blend by the number of 32-bit dwords per element.
7064 int Scale = VT.getScalarSizeInBits() / 32;
7065 BlendMask = ScaleBlendMask(BlendMask, Mask.size(), Scale);
7066 MVT BlendVT = VT.getSizeInBits() > 128 ? MVT::v8i32 : MVT::v4i32;
7067 V1 = DAG.getBitcast(BlendVT, V1);
7068 V2 = DAG.getBitcast(BlendVT, V2);
7069 return DAG.getBitcast(
7070 VT, DAG.getNode(X86ISD::BLENDI, DL, BlendVT, V1, V2,
7071 DAG.getConstant(BlendMask, DL, MVT::i8)));
7075 // For integer shuffles we need to expand the mask and cast the inputs to
7076 // v8i16s prior to blending.
7077 int Scale = 8 / VT.getVectorNumElements();
7078 BlendMask = ScaleBlendMask(BlendMask, Mask.size(), Scale);
7079 V1 = DAG.getBitcast(MVT::v8i16, V1);
7080 V2 = DAG.getBitcast(MVT::v8i16, V2);
7081 return DAG.getBitcast(VT,
7082 DAG.getNode(X86ISD::BLENDI, DL, MVT::v8i16, V1, V2,
7083 DAG.getConstant(BlendMask, DL, MVT::i8)));
7087 assert(Subtarget->hasAVX2() && "256-bit integer blends require AVX2!");
7088 SmallVector<int, 8> RepeatedMask;
7089 if (is128BitLaneRepeatedShuffleMask(MVT::v16i16, Mask, RepeatedMask)) {
7090 // We can lower these with PBLENDW which is mirrored across 128-bit lanes.
7091 assert(RepeatedMask.size() == 8 && "Repeated mask size doesn't match!");
7093 for (int i = 0; i < 8; ++i)
7094 if (RepeatedMask[i] >= 16)
7095 BlendMask |= 1u << i;
7096 return DAG.getNode(X86ISD::BLENDI, DL, MVT::v16i16, V1, V2,
7097 DAG.getConstant(BlendMask, DL, MVT::i8));
7103 assert((VT.is128BitVector() || Subtarget->hasAVX2()) &&
7104 "256-bit byte-blends require AVX2 support!");
7106 // Attempt to lower to a bitmask if we can. VPAND is faster than VPBLENDVB.
7107 if (SDValue Masked = lowerVectorShuffleAsBitMask(DL, VT, V1, V2, Mask, DAG))
7110 // Scale the blend by the number of bytes per element.
7111 int Scale = VT.getScalarSizeInBits() / 8;
7113 // This form of blend is always done on bytes. Compute the byte vector
7115 MVT BlendVT = MVT::getVectorVT(MVT::i8, VT.getSizeInBits() / 8);
7117 // Compute the VSELECT mask. Note that VSELECT is really confusing in the
7118 // mix of LLVM's code generator and the x86 backend. We tell the code
7119 // generator that boolean values in the elements of an x86 vector register
7120 // are -1 for true and 0 for false. We then use the LLVM semantics of 'true'
7121 // mapping a select to operand #1, and 'false' mapping to operand #2. The
7122 // reality in x86 is that vector masks (pre-AVX-512) use only the high bit
7123 // of the element (the remaining are ignored) and 0 in that high bit would
7124 // mean operand #1 while 1 in the high bit would mean operand #2. So while
7125 // the LLVM model for boolean values in vector elements gets the relevant
7126 // bit set, it is set backwards and over constrained relative to x86's
7128 SmallVector<SDValue, 32> VSELECTMask;
7129 for (int i = 0, Size = Mask.size(); i < Size; ++i)
7130 for (int j = 0; j < Scale; ++j)
7131 VSELECTMask.push_back(
7132 Mask[i] < 0 ? DAG.getUNDEF(MVT::i8)
7133 : DAG.getConstant(Mask[i] < Size ? -1 : 0, DL,
7136 V1 = DAG.getBitcast(BlendVT, V1);
7137 V2 = DAG.getBitcast(BlendVT, V2);
7138 return DAG.getBitcast(VT, DAG.getNode(ISD::VSELECT, DL, BlendVT,
7139 DAG.getNode(ISD::BUILD_VECTOR, DL,
7140 BlendVT, VSELECTMask),
7145 llvm_unreachable("Not a supported integer vector type!");
7149 /// \brief Try to lower as a blend of elements from two inputs followed by
7150 /// a single-input permutation.
7152 /// This matches the pattern where we can blend elements from two inputs and
7153 /// then reduce the shuffle to a single-input permutation.
7154 static SDValue lowerVectorShuffleAsBlendAndPermute(SDLoc DL, MVT VT, SDValue V1,
7157 SelectionDAG &DAG) {
7158 // We build up the blend mask while checking whether a blend is a viable way
7159 // to reduce the shuffle.
7160 SmallVector<int, 32> BlendMask(Mask.size(), -1);
7161 SmallVector<int, 32> PermuteMask(Mask.size(), -1);
7163 for (int i = 0, Size = Mask.size(); i < Size; ++i) {
7167 assert(Mask[i] < Size * 2 && "Shuffle input is out of bounds.");
7169 if (BlendMask[Mask[i] % Size] == -1)
7170 BlendMask[Mask[i] % Size] = Mask[i];
7171 else if (BlendMask[Mask[i] % Size] != Mask[i])
7172 return SDValue(); // Can't blend in the needed input!
7174 PermuteMask[i] = Mask[i] % Size;
7177 SDValue V = DAG.getVectorShuffle(VT, DL, V1, V2, BlendMask);
7178 return DAG.getVectorShuffle(VT, DL, V, DAG.getUNDEF(VT), PermuteMask);
7181 /// \brief Generic routine to decompose a shuffle and blend into indepndent
7182 /// blends and permutes.
7184 /// This matches the extremely common pattern for handling combined
7185 /// shuffle+blend operations on newer X86 ISAs where we have very fast blend
7186 /// operations. It will try to pick the best arrangement of shuffles and
7188 static SDValue lowerVectorShuffleAsDecomposedShuffleBlend(SDLoc DL, MVT VT,
7192 SelectionDAG &DAG) {
7193 // Shuffle the input elements into the desired positions in V1 and V2 and
7194 // blend them together.
7195 SmallVector<int, 32> V1Mask(Mask.size(), -1);
7196 SmallVector<int, 32> V2Mask(Mask.size(), -1);
7197 SmallVector<int, 32> BlendMask(Mask.size(), -1);
7198 for (int i = 0, Size = Mask.size(); i < Size; ++i)
7199 if (Mask[i] >= 0 && Mask[i] < Size) {
7200 V1Mask[i] = Mask[i];
7202 } else if (Mask[i] >= Size) {
7203 V2Mask[i] = Mask[i] - Size;
7204 BlendMask[i] = i + Size;
7207 // Try to lower with the simpler initial blend strategy unless one of the
7208 // input shuffles would be a no-op. We prefer to shuffle inputs as the
7209 // shuffle may be able to fold with a load or other benefit. However, when
7210 // we'll have to do 2x as many shuffles in order to achieve this, blending
7211 // first is a better strategy.
7212 if (!isNoopShuffleMask(V1Mask) && !isNoopShuffleMask(V2Mask))
7213 if (SDValue BlendPerm =
7214 lowerVectorShuffleAsBlendAndPermute(DL, VT, V1, V2, Mask, DAG))
7217 V1 = DAG.getVectorShuffle(VT, DL, V1, DAG.getUNDEF(VT), V1Mask);
7218 V2 = DAG.getVectorShuffle(VT, DL, V2, DAG.getUNDEF(VT), V2Mask);
7219 return DAG.getVectorShuffle(VT, DL, V1, V2, BlendMask);
7222 /// \brief Try to lower a vector shuffle as a byte rotation.
7224 /// SSSE3 has a generic PALIGNR instruction in x86 that will do an arbitrary
7225 /// byte-rotation of the concatenation of two vectors; pre-SSSE3 can use
7226 /// a PSRLDQ/PSLLDQ/POR pattern to get a similar effect. This routine will
7227 /// try to generically lower a vector shuffle through such an pattern. It
7228 /// does not check for the profitability of lowering either as PALIGNR or
7229 /// PSRLDQ/PSLLDQ/POR, only whether the mask is valid to lower in that form.
7230 /// This matches shuffle vectors that look like:
7232 /// v8i16 [11, 12, 13, 14, 15, 0, 1, 2]
7234 /// Essentially it concatenates V1 and V2, shifts right by some number of
7235 /// elements, and takes the low elements as the result. Note that while this is
7236 /// specified as a *right shift* because x86 is little-endian, it is a *left
7237 /// rotate* of the vector lanes.
7238 static SDValue lowerVectorShuffleAsByteRotate(SDLoc DL, MVT VT, SDValue V1,
7241 const X86Subtarget *Subtarget,
7242 SelectionDAG &DAG) {
7243 assert(!isNoopShuffleMask(Mask) && "We shouldn't lower no-op shuffles!");
7245 int NumElts = Mask.size();
7246 int NumLanes = VT.getSizeInBits() / 128;
7247 int NumLaneElts = NumElts / NumLanes;
7249 // We need to detect various ways of spelling a rotation:
7250 // [11, 12, 13, 14, 15, 0, 1, 2]
7251 // [-1, 12, 13, 14, -1, -1, 1, -1]
7252 // [-1, -1, -1, -1, -1, -1, 1, 2]
7253 // [ 3, 4, 5, 6, 7, 8, 9, 10]
7254 // [-1, 4, 5, 6, -1, -1, 9, -1]
7255 // [-1, 4, 5, 6, -1, -1, -1, -1]
7258 for (int l = 0; l < NumElts; l += NumLaneElts) {
7259 for (int i = 0; i < NumLaneElts; ++i) {
7260 if (Mask[l + i] == -1)
7262 assert(Mask[l + i] >= 0 && "Only -1 is a valid negative mask element!");
7264 // Get the mod-Size index and lane correct it.
7265 int LaneIdx = (Mask[l + i] % NumElts) - l;
7266 // Make sure it was in this lane.
7267 if (LaneIdx < 0 || LaneIdx >= NumLaneElts)
7270 // Determine where a rotated vector would have started.
7271 int StartIdx = i - LaneIdx;
7273 // The identity rotation isn't interesting, stop.
7276 // If we found the tail of a vector the rotation must be the missing
7277 // front. If we found the head of a vector, it must be how much of the
7279 int CandidateRotation = StartIdx < 0 ? -StartIdx : NumLaneElts - StartIdx;
7282 Rotation = CandidateRotation;
7283 else if (Rotation != CandidateRotation)
7284 // The rotations don't match, so we can't match this mask.
7287 // Compute which value this mask is pointing at.
7288 SDValue MaskV = Mask[l + i] < NumElts ? V1 : V2;
7290 // Compute which of the two target values this index should be assigned
7291 // to. This reflects whether the high elements are remaining or the low
7292 // elements are remaining.
7293 SDValue &TargetV = StartIdx < 0 ? Hi : Lo;
7295 // Either set up this value if we've not encountered it before, or check
7296 // that it remains consistent.
7299 else if (TargetV != MaskV)
7300 // This may be a rotation, but it pulls from the inputs in some
7301 // unsupported interleaving.
7306 // Check that we successfully analyzed the mask, and normalize the results.
7307 assert(Rotation != 0 && "Failed to locate a viable rotation!");
7308 assert((Lo || Hi) && "Failed to find a rotated input vector!");
7314 // The actual rotate instruction rotates bytes, so we need to scale the
7315 // rotation based on how many bytes are in the vector lane.
7316 int Scale = 16 / NumLaneElts;
7318 // SSSE3 targets can use the palignr instruction.
7319 if (Subtarget->hasSSSE3()) {
7320 // Cast the inputs to i8 vector of correct length to match PALIGNR.
7321 MVT AlignVT = MVT::getVectorVT(MVT::i8, 16 * NumLanes);
7322 Lo = DAG.getBitcast(AlignVT, Lo);
7323 Hi = DAG.getBitcast(AlignVT, Hi);
7325 return DAG.getBitcast(
7326 VT, DAG.getNode(X86ISD::PALIGNR, DL, AlignVT, Lo, Hi,
7327 DAG.getConstant(Rotation * Scale, DL, MVT::i8)));
7330 assert(VT.is128BitVector() &&
7331 "Rotate-based lowering only supports 128-bit lowering!");
7332 assert(Mask.size() <= 16 &&
7333 "Can shuffle at most 16 bytes in a 128-bit vector!");
7335 // Default SSE2 implementation
7336 int LoByteShift = 16 - Rotation * Scale;
7337 int HiByteShift = Rotation * Scale;
7339 // Cast the inputs to v2i64 to match PSLLDQ/PSRLDQ.
7340 Lo = DAG.getBitcast(MVT::v2i64, Lo);
7341 Hi = DAG.getBitcast(MVT::v2i64, Hi);
7343 SDValue LoShift = DAG.getNode(X86ISD::VSHLDQ, DL, MVT::v2i64, Lo,
7344 DAG.getConstant(LoByteShift, DL, MVT::i8));
7345 SDValue HiShift = DAG.getNode(X86ISD::VSRLDQ, DL, MVT::v2i64, Hi,
7346 DAG.getConstant(HiByteShift, DL, MVT::i8));
7347 return DAG.getBitcast(VT,
7348 DAG.getNode(ISD::OR, DL, MVT::v2i64, LoShift, HiShift));
7351 /// \brief Try to lower a vector shuffle as a bit shift (shifts in zeros).
7353 /// Attempts to match a shuffle mask against the PSLL(W/D/Q/DQ) and
7354 /// PSRL(W/D/Q/DQ) SSE2 and AVX2 logical bit-shift instructions. The function
7355 /// matches elements from one of the input vectors shuffled to the left or
7356 /// right with zeroable elements 'shifted in'. It handles both the strictly
7357 /// bit-wise element shifts and the byte shift across an entire 128-bit double
7360 /// PSHL : (little-endian) left bit shift.
7361 /// [ zz, 0, zz, 2 ]
7362 /// [ -1, 4, zz, -1 ]
7363 /// PSRL : (little-endian) right bit shift.
7365 /// [ -1, -1, 7, zz]
7366 /// PSLLDQ : (little-endian) left byte shift
7367 /// [ zz, 0, 1, 2, 3, 4, 5, 6]
7368 /// [ zz, zz, -1, -1, 2, 3, 4, -1]
7369 /// [ zz, zz, zz, zz, zz, zz, -1, 1]
7370 /// PSRLDQ : (little-endian) right byte shift
7371 /// [ 5, 6, 7, zz, zz, zz, zz, zz]
7372 /// [ -1, 5, 6, 7, zz, zz, zz, zz]
7373 /// [ 1, 2, -1, -1, -1, -1, zz, zz]
7374 static SDValue lowerVectorShuffleAsShift(SDLoc DL, MVT VT, SDValue V1,
7375 SDValue V2, ArrayRef<int> Mask,
7376 SelectionDAG &DAG) {
7377 SmallBitVector Zeroable = computeZeroableShuffleElements(Mask, V1, V2);
7379 int Size = Mask.size();
7380 assert(Size == (int)VT.getVectorNumElements() && "Unexpected mask size");
7382 auto CheckZeros = [&](int Shift, int Scale, bool Left) {
7383 for (int i = 0; i < Size; i += Scale)
7384 for (int j = 0; j < Shift; ++j)
7385 if (!Zeroable[i + j + (Left ? 0 : (Scale - Shift))])
7391 auto MatchShift = [&](int Shift, int Scale, bool Left, SDValue V) {
7392 for (int i = 0; i != Size; i += Scale) {
7393 unsigned Pos = Left ? i + Shift : i;
7394 unsigned Low = Left ? i : i + Shift;
7395 unsigned Len = Scale - Shift;
7396 if (!isSequentialOrUndefInRange(Mask, Pos, Len,
7397 Low + (V == V1 ? 0 : Size)))
7401 int ShiftEltBits = VT.getScalarSizeInBits() * Scale;
7402 bool ByteShift = ShiftEltBits > 64;
7403 unsigned OpCode = Left ? (ByteShift ? X86ISD::VSHLDQ : X86ISD::VSHLI)
7404 : (ByteShift ? X86ISD::VSRLDQ : X86ISD::VSRLI);
7405 int ShiftAmt = Shift * VT.getScalarSizeInBits() / (ByteShift ? 8 : 1);
7407 // Normalize the scale for byte shifts to still produce an i64 element
7409 Scale = ByteShift ? Scale / 2 : Scale;
7411 // We need to round trip through the appropriate type for the shift.
7412 MVT ShiftSVT = MVT::getIntegerVT(VT.getScalarSizeInBits() * Scale);
7413 MVT ShiftVT = MVT::getVectorVT(ShiftSVT, Size / Scale);
7414 assert(DAG.getTargetLoweringInfo().isTypeLegal(ShiftVT) &&
7415 "Illegal integer vector type");
7416 V = DAG.getBitcast(ShiftVT, V);
7418 V = DAG.getNode(OpCode, DL, ShiftVT, V,
7419 DAG.getConstant(ShiftAmt, DL, MVT::i8));
7420 return DAG.getBitcast(VT, V);
7423 // SSE/AVX supports logical shifts up to 64-bit integers - so we can just
7424 // keep doubling the size of the integer elements up to that. We can
7425 // then shift the elements of the integer vector by whole multiples of
7426 // their width within the elements of the larger integer vector. Test each
7427 // multiple to see if we can find a match with the moved element indices
7428 // and that the shifted in elements are all zeroable.
7429 for (int Scale = 2; Scale * VT.getScalarSizeInBits() <= 128; Scale *= 2)
7430 for (int Shift = 1; Shift != Scale; ++Shift)
7431 for (bool Left : {true, false})
7432 if (CheckZeros(Shift, Scale, Left))
7433 for (SDValue V : {V1, V2})
7434 if (SDValue Match = MatchShift(Shift, Scale, Left, V))
7441 /// \brief Try to lower a vector shuffle using SSE4a EXTRQ/INSERTQ.
7442 static SDValue lowerVectorShuffleWithSSE4A(SDLoc DL, MVT VT, SDValue V1,
7443 SDValue V2, ArrayRef<int> Mask,
7444 SelectionDAG &DAG) {
7445 SmallBitVector Zeroable = computeZeroableShuffleElements(Mask, V1, V2);
7446 assert(!Zeroable.all() && "Fully zeroable shuffle mask");
7448 int Size = Mask.size();
7449 int HalfSize = Size / 2;
7450 assert(Size == (int)VT.getVectorNumElements() && "Unexpected mask size");
7452 // Upper half must be undefined.
7453 if (!isUndefInRange(Mask, HalfSize, HalfSize))
7456 // EXTRQ: Extract Len elements from lower half of source, starting at Idx.
7457 // Remainder of lower half result is zero and upper half is all undef.
7458 auto LowerAsEXTRQ = [&]() {
7459 // Determine the extraction length from the part of the
7460 // lower half that isn't zeroable.
7462 for (; Len > 0; --Len)
7463 if (!Zeroable[Len - 1])
7465 assert(Len > 0 && "Zeroable shuffle mask");
7467 // Attempt to match first Len sequential elements from the lower half.
7470 for (int i = 0; i != Len; ++i) {
7474 SDValue &V = (M < Size ? V1 : V2);
7477 // The extracted elements must start at a valid index and all mask
7478 // elements must be in the lower half.
7479 if (i > M || M >= HalfSize)
7482 if (Idx < 0 || (Src == V && Idx == (M - i))) {
7493 assert((Idx + Len) <= HalfSize && "Illegal extraction mask");
7494 int BitLen = (Len * VT.getScalarSizeInBits()) & 0x3f;
7495 int BitIdx = (Idx * VT.getScalarSizeInBits()) & 0x3f;
7496 return DAG.getNode(X86ISD::EXTRQI, DL, VT, Src,
7497 DAG.getConstant(BitLen, DL, MVT::i8),
7498 DAG.getConstant(BitIdx, DL, MVT::i8));
7501 if (SDValue ExtrQ = LowerAsEXTRQ())
7504 // INSERTQ: Extract lowest Len elements from lower half of second source and
7505 // insert over first source, starting at Idx.
7506 // { A[0], .., A[Idx-1], B[0], .., B[Len-1], A[Idx+Len], .., UNDEF, ... }
7507 auto LowerAsInsertQ = [&]() {
7508 for (int Idx = 0; Idx != HalfSize; ++Idx) {
7511 // Attempt to match first source from mask before insertion point.
7512 if (isUndefInRange(Mask, 0, Idx)) {
7514 } else if (isSequentialOrUndefInRange(Mask, 0, Idx, 0)) {
7516 } else if (isSequentialOrUndefInRange(Mask, 0, Idx, Size)) {
7522 // Extend the extraction length looking to match both the insertion of
7523 // the second source and the remaining elements of the first.
7524 for (int Hi = Idx + 1; Hi <= HalfSize; ++Hi) {
7529 if (isSequentialOrUndefInRange(Mask, Idx, Len, 0)) {
7531 } else if (isSequentialOrUndefInRange(Mask, Idx, Len, Size)) {
7537 // Match the remaining elements of the lower half.
7538 if (isUndefInRange(Mask, Hi, HalfSize - Hi)) {
7540 } else if ((!Base || (Base == V1)) &&
7541 isSequentialOrUndefInRange(Mask, Hi, HalfSize - Hi, Hi)) {
7543 } else if ((!Base || (Base == V2)) &&
7544 isSequentialOrUndefInRange(Mask, Hi, HalfSize - Hi,
7551 // We may not have a base (first source) - this can safely be undefined.
7553 Base = DAG.getUNDEF(VT);
7555 int BitLen = (Len * VT.getScalarSizeInBits()) & 0x3f;
7556 int BitIdx = (Idx * VT.getScalarSizeInBits()) & 0x3f;
7557 return DAG.getNode(X86ISD::INSERTQI, DL, VT, Base, Insert,
7558 DAG.getConstant(BitLen, DL, MVT::i8),
7559 DAG.getConstant(BitIdx, DL, MVT::i8));
7566 if (SDValue InsertQ = LowerAsInsertQ())
7572 /// \brief Lower a vector shuffle as a zero or any extension.
7574 /// Given a specific number of elements, element bit width, and extension
7575 /// stride, produce either a zero or any extension based on the available
7576 /// features of the subtarget. The extended elements are consecutive and
7577 /// begin and can start from an offseted element index in the input; to
7578 /// avoid excess shuffling the offset must either being in the bottom lane
7579 /// or at the start of a higher lane. All extended elements must be from
7581 static SDValue lowerVectorShuffleAsSpecificZeroOrAnyExtend(
7582 SDLoc DL, MVT VT, int Scale, int Offset, bool AnyExt, SDValue InputV,
7583 ArrayRef<int> Mask, const X86Subtarget *Subtarget, SelectionDAG &DAG) {
7584 assert(Scale > 1 && "Need a scale to extend.");
7585 int EltBits = VT.getScalarSizeInBits();
7586 int NumElements = VT.getVectorNumElements();
7587 int NumEltsPerLane = 128 / EltBits;
7588 int OffsetLane = Offset / NumEltsPerLane;
7589 assert((EltBits == 8 || EltBits == 16 || EltBits == 32) &&
7590 "Only 8, 16, and 32 bit elements can be extended.");
7591 assert(Scale * EltBits <= 64 && "Cannot zero extend past 64 bits.");
7592 assert(0 <= Offset && "Extension offset must be positive.");
7593 assert((Offset < NumEltsPerLane || Offset % NumEltsPerLane == 0) &&
7594 "Extension offset must be in the first lane or start an upper lane.");
7596 // Check that an index is in same lane as the base offset.
7597 auto SafeOffset = [&](int Idx) {
7598 return OffsetLane == (Idx / NumEltsPerLane);
7601 // Shift along an input so that the offset base moves to the first element.
7602 auto ShuffleOffset = [&](SDValue V) {
7606 SmallVector<int, 8> ShMask((unsigned)NumElements, -1);
7607 for (int i = 0; i * Scale < NumElements; ++i) {
7608 int SrcIdx = i + Offset;
7609 ShMask[i] = SafeOffset(SrcIdx) ? SrcIdx : -1;
7611 return DAG.getVectorShuffle(VT, DL, V, DAG.getUNDEF(VT), ShMask);
7614 // Found a valid zext mask! Try various lowering strategies based on the
7615 // input type and available ISA extensions.
7616 if (Subtarget->hasSSE41()) {
7617 // Not worth offseting 128-bit vectors if scale == 2, a pattern using
7618 // PUNPCK will catch this in a later shuffle match.
7619 if (Offset && Scale == 2 && VT.is128BitVector())
7621 MVT ExtVT = MVT::getVectorVT(MVT::getIntegerVT(EltBits * Scale),
7622 NumElements / Scale);
7623 InputV = DAG.getNode(X86ISD::VZEXT, DL, ExtVT, ShuffleOffset(InputV));
7624 return DAG.getBitcast(VT, InputV);
7627 assert(VT.is128BitVector() && "Only 128-bit vectors can be extended.");
7629 // For any extends we can cheat for larger element sizes and use shuffle
7630 // instructions that can fold with a load and/or copy.
7631 if (AnyExt && EltBits == 32) {
7632 int PSHUFDMask[4] = {Offset, -1, SafeOffset(Offset + 1) ? Offset + 1 : -1,
7634 return DAG.getBitcast(
7635 VT, DAG.getNode(X86ISD::PSHUFD, DL, MVT::v4i32,
7636 DAG.getBitcast(MVT::v4i32, InputV),
7637 getV4X86ShuffleImm8ForMask(PSHUFDMask, DL, DAG)));
7639 if (AnyExt && EltBits == 16 && Scale > 2) {
7640 int PSHUFDMask[4] = {Offset / 2, -1,
7641 SafeOffset(Offset + 1) ? (Offset + 1) / 2 : -1, -1};
7642 InputV = DAG.getNode(X86ISD::PSHUFD, DL, MVT::v4i32,
7643 DAG.getBitcast(MVT::v4i32, InputV),
7644 getV4X86ShuffleImm8ForMask(PSHUFDMask, DL, DAG));
7645 int PSHUFWMask[4] = {1, -1, -1, -1};
7646 unsigned OddEvenOp = (Offset & 1 ? X86ISD::PSHUFLW : X86ISD::PSHUFHW);
7647 return DAG.getBitcast(
7648 VT, DAG.getNode(OddEvenOp, DL, MVT::v8i16,
7649 DAG.getBitcast(MVT::v8i16, InputV),
7650 getV4X86ShuffleImm8ForMask(PSHUFWMask, DL, DAG)));
7653 // The SSE4A EXTRQ instruction can efficiently extend the first 2 lanes
7655 if ((Scale * EltBits) == 64 && EltBits < 32 && Subtarget->hasSSE4A()) {
7656 assert(NumElements == (int)Mask.size() && "Unexpected shuffle mask size!");
7657 assert(VT.is128BitVector() && "Unexpected vector width!");
7659 int LoIdx = Offset * EltBits;
7660 SDValue Lo = DAG.getNode(ISD::BITCAST, DL, MVT::v2i64,
7661 DAG.getNode(X86ISD::EXTRQI, DL, VT, InputV,
7662 DAG.getConstant(EltBits, DL, MVT::i8),
7663 DAG.getConstant(LoIdx, DL, MVT::i8)));
7665 if (isUndefInRange(Mask, NumElements / 2, NumElements / 2) ||
7666 !SafeOffset(Offset + 1))
7667 return DAG.getNode(ISD::BITCAST, DL, VT, Lo);
7669 int HiIdx = (Offset + 1) * EltBits;
7670 SDValue Hi = DAG.getNode(ISD::BITCAST, DL, MVT::v2i64,
7671 DAG.getNode(X86ISD::EXTRQI, DL, VT, InputV,
7672 DAG.getConstant(EltBits, DL, MVT::i8),
7673 DAG.getConstant(HiIdx, DL, MVT::i8)));
7674 return DAG.getNode(ISD::BITCAST, DL, VT,
7675 DAG.getNode(X86ISD::UNPCKL, DL, MVT::v2i64, Lo, Hi));
7678 // If this would require more than 2 unpack instructions to expand, use
7679 // pshufb when available. We can only use more than 2 unpack instructions
7680 // when zero extending i8 elements which also makes it easier to use pshufb.
7681 if (Scale > 4 && EltBits == 8 && Subtarget->hasSSSE3()) {
7682 assert(NumElements == 16 && "Unexpected byte vector width!");
7683 SDValue PSHUFBMask[16];
7684 for (int i = 0; i < 16; ++i) {
7685 int Idx = Offset + (i / Scale);
7686 PSHUFBMask[i] = DAG.getConstant(
7687 (i % Scale == 0 && SafeOffset(Idx)) ? Idx : 0x80, DL, MVT::i8);
7689 InputV = DAG.getBitcast(MVT::v16i8, InputV);
7690 return DAG.getBitcast(VT,
7691 DAG.getNode(X86ISD::PSHUFB, DL, MVT::v16i8, InputV,
7692 DAG.getNode(ISD::BUILD_VECTOR, DL,
7693 MVT::v16i8, PSHUFBMask)));
7696 // If we are extending from an offset, ensure we start on a boundary that
7697 // we can unpack from.
7698 int AlignToUnpack = Offset % (NumElements / Scale);
7699 if (AlignToUnpack) {
7700 SmallVector<int, 8> ShMask((unsigned)NumElements, -1);
7701 for (int i = AlignToUnpack; i < NumElements; ++i)
7702 ShMask[i - AlignToUnpack] = i;
7703 InputV = DAG.getVectorShuffle(VT, DL, InputV, DAG.getUNDEF(VT), ShMask);
7704 Offset -= AlignToUnpack;
7707 // Otherwise emit a sequence of unpacks.
7709 unsigned UnpackLoHi = X86ISD::UNPCKL;
7710 if (Offset >= (NumElements / 2)) {
7711 UnpackLoHi = X86ISD::UNPCKH;
7712 Offset -= (NumElements / 2);
7715 MVT InputVT = MVT::getVectorVT(MVT::getIntegerVT(EltBits), NumElements);
7716 SDValue Ext = AnyExt ? DAG.getUNDEF(InputVT)
7717 : getZeroVector(InputVT, Subtarget, DAG, DL);
7718 InputV = DAG.getBitcast(InputVT, InputV);
7719 InputV = DAG.getNode(UnpackLoHi, DL, InputVT, InputV, Ext);
7723 } while (Scale > 1);
7724 return DAG.getBitcast(VT, InputV);
7727 /// \brief Try to lower a vector shuffle as a zero extension on any microarch.
7729 /// This routine will try to do everything in its power to cleverly lower
7730 /// a shuffle which happens to match the pattern of a zero extend. It doesn't
7731 /// check for the profitability of this lowering, it tries to aggressively
7732 /// match this pattern. It will use all of the micro-architectural details it
7733 /// can to emit an efficient lowering. It handles both blends with all-zero
7734 /// inputs to explicitly zero-extend and undef-lanes (sometimes undef due to
7735 /// masking out later).
7737 /// The reason we have dedicated lowering for zext-style shuffles is that they
7738 /// are both incredibly common and often quite performance sensitive.
7739 static SDValue lowerVectorShuffleAsZeroOrAnyExtend(
7740 SDLoc DL, MVT VT, SDValue V1, SDValue V2, ArrayRef<int> Mask,
7741 const X86Subtarget *Subtarget, SelectionDAG &DAG) {
7742 SmallBitVector Zeroable = computeZeroableShuffleElements(Mask, V1, V2);
7744 int Bits = VT.getSizeInBits();
7745 int NumLanes = Bits / 128;
7746 int NumElements = VT.getVectorNumElements();
7747 int NumEltsPerLane = NumElements / NumLanes;
7748 assert(VT.getScalarSizeInBits() <= 32 &&
7749 "Exceeds 32-bit integer zero extension limit");
7750 assert((int)Mask.size() == NumElements && "Unexpected shuffle mask size");
7752 // Define a helper function to check a particular ext-scale and lower to it if
7754 auto Lower = [&](int Scale) -> SDValue {
7759 for (int i = 0; i < NumElements; ++i) {
7762 continue; // Valid anywhere but doesn't tell us anything.
7763 if (i % Scale != 0) {
7764 // Each of the extended elements need to be zeroable.
7768 // We no longer are in the anyext case.
7773 // Each of the base elements needs to be consecutive indices into the
7774 // same input vector.
7775 SDValue V = M < NumElements ? V1 : V2;
7776 M = M % NumElements;
7779 Offset = M - (i / Scale);
7780 } else if (InputV != V)
7781 return SDValue(); // Flip-flopping inputs.
7783 // Offset must start in the lowest 128-bit lane or at the start of an
7785 // FIXME: Is it ever worth allowing a negative base offset?
7786 if (!((0 <= Offset && Offset < NumEltsPerLane) ||
7787 (Offset % NumEltsPerLane) == 0))
7790 // If we are offsetting, all referenced entries must come from the same
7792 if (Offset && (Offset / NumEltsPerLane) != (M / NumEltsPerLane))
7795 if ((M % NumElements) != (Offset + (i / Scale)))
7796 return SDValue(); // Non-consecutive strided elements.
7800 // If we fail to find an input, we have a zero-shuffle which should always
7801 // have already been handled.
7802 // FIXME: Maybe handle this here in case during blending we end up with one?
7806 // If we are offsetting, don't extend if we only match a single input, we
7807 // can always do better by using a basic PSHUF or PUNPCK.
7808 if (Offset != 0 && Matches < 2)
7811 return lowerVectorShuffleAsSpecificZeroOrAnyExtend(
7812 DL, VT, Scale, Offset, AnyExt, InputV, Mask, Subtarget, DAG);
7815 // The widest scale possible for extending is to a 64-bit integer.
7816 assert(Bits % 64 == 0 &&
7817 "The number of bits in a vector must be divisible by 64 on x86!");
7818 int NumExtElements = Bits / 64;
7820 // Each iteration, try extending the elements half as much, but into twice as
7822 for (; NumExtElements < NumElements; NumExtElements *= 2) {
7823 assert(NumElements % NumExtElements == 0 &&
7824 "The input vector size must be divisible by the extended size.");
7825 if (SDValue V = Lower(NumElements / NumExtElements))
7829 // General extends failed, but 128-bit vectors may be able to use MOVQ.
7833 // Returns one of the source operands if the shuffle can be reduced to a
7834 // MOVQ, copying the lower 64-bits and zero-extending to the upper 64-bits.
7835 auto CanZExtLowHalf = [&]() {
7836 for (int i = NumElements / 2; i != NumElements; ++i)
7839 if (isSequentialOrUndefInRange(Mask, 0, NumElements / 2, 0))
7841 if (isSequentialOrUndefInRange(Mask, 0, NumElements / 2, NumElements))
7846 if (SDValue V = CanZExtLowHalf()) {
7847 V = DAG.getBitcast(MVT::v2i64, V);
7848 V = DAG.getNode(X86ISD::VZEXT_MOVL, DL, MVT::v2i64, V);
7849 return DAG.getBitcast(VT, V);
7852 // No viable ext lowering found.
7856 /// \brief Try to get a scalar value for a specific element of a vector.
7858 /// Looks through BUILD_VECTOR and SCALAR_TO_VECTOR nodes to find a scalar.
7859 static SDValue getScalarValueForVectorElement(SDValue V, int Idx,
7860 SelectionDAG &DAG) {
7861 MVT VT = V.getSimpleValueType();
7862 MVT EltVT = VT.getVectorElementType();
7863 while (V.getOpcode() == ISD::BITCAST)
7864 V = V.getOperand(0);
7865 // If the bitcasts shift the element size, we can't extract an equivalent
7867 MVT NewVT = V.getSimpleValueType();
7868 if (!NewVT.isVector() || NewVT.getScalarSizeInBits() != VT.getScalarSizeInBits())
7871 if (V.getOpcode() == ISD::BUILD_VECTOR ||
7872 (Idx == 0 && V.getOpcode() == ISD::SCALAR_TO_VECTOR)) {
7873 // Ensure the scalar operand is the same size as the destination.
7874 // FIXME: Add support for scalar truncation where possible.
7875 SDValue S = V.getOperand(Idx);
7876 if (EltVT.getSizeInBits() == S.getSimpleValueType().getSizeInBits())
7877 return DAG.getNode(ISD::BITCAST, SDLoc(V), EltVT, S);
7883 /// \brief Helper to test for a load that can be folded with x86 shuffles.
7885 /// This is particularly important because the set of instructions varies
7886 /// significantly based on whether the operand is a load or not.
7887 static bool isShuffleFoldableLoad(SDValue V) {
7888 while (V.getOpcode() == ISD::BITCAST)
7889 V = V.getOperand(0);
7891 return ISD::isNON_EXTLoad(V.getNode());
7894 /// \brief Try to lower insertion of a single element into a zero vector.
7896 /// This is a common pattern that we have especially efficient patterns to lower
7897 /// across all subtarget feature sets.
7898 static SDValue lowerVectorShuffleAsElementInsertion(
7899 SDLoc DL, MVT VT, SDValue V1, SDValue V2, ArrayRef<int> Mask,
7900 const X86Subtarget *Subtarget, SelectionDAG &DAG) {
7901 SmallBitVector Zeroable = computeZeroableShuffleElements(Mask, V1, V2);
7903 MVT EltVT = VT.getVectorElementType();
7905 int V2Index = std::find_if(Mask.begin(), Mask.end(),
7906 [&Mask](int M) { return M >= (int)Mask.size(); }) -
7908 bool IsV1Zeroable = true;
7909 for (int i = 0, Size = Mask.size(); i < Size; ++i)
7910 if (i != V2Index && !Zeroable[i]) {
7911 IsV1Zeroable = false;
7915 // Check for a single input from a SCALAR_TO_VECTOR node.
7916 // FIXME: All of this should be canonicalized into INSERT_VECTOR_ELT and
7917 // all the smarts here sunk into that routine. However, the current
7918 // lowering of BUILD_VECTOR makes that nearly impossible until the old
7919 // vector shuffle lowering is dead.
7920 SDValue V2S = getScalarValueForVectorElement(V2, Mask[V2Index] - Mask.size(),
7922 if (V2S && DAG.getTargetLoweringInfo().isTypeLegal(V2S.getValueType())) {
7923 // We need to zext the scalar if it is smaller than an i32.
7924 V2S = DAG.getBitcast(EltVT, V2S);
7925 if (EltVT == MVT::i8 || EltVT == MVT::i16) {
7926 // Using zext to expand a narrow element won't work for non-zero
7931 // Zero-extend directly to i32.
7933 V2S = DAG.getNode(ISD::ZERO_EXTEND, DL, MVT::i32, V2S);
7935 V2 = DAG.getNode(ISD::SCALAR_TO_VECTOR, DL, ExtVT, V2S);
7936 } else if (Mask[V2Index] != (int)Mask.size() || EltVT == MVT::i8 ||
7937 EltVT == MVT::i16) {
7938 // Either not inserting from the low element of the input or the input
7939 // element size is too small to use VZEXT_MOVL to clear the high bits.
7943 if (!IsV1Zeroable) {
7944 // If V1 can't be treated as a zero vector we have fewer options to lower
7945 // this. We can't support integer vectors or non-zero targets cheaply, and
7946 // the V1 elements can't be permuted in any way.
7947 assert(VT == ExtVT && "Cannot change extended type when non-zeroable!");
7948 if (!VT.isFloatingPoint() || V2Index != 0)
7950 SmallVector<int, 8> V1Mask(Mask.begin(), Mask.end());
7951 V1Mask[V2Index] = -1;
7952 if (!isNoopShuffleMask(V1Mask))
7954 // This is essentially a special case blend operation, but if we have
7955 // general purpose blend operations, they are always faster. Bail and let
7956 // the rest of the lowering handle these as blends.
7957 if (Subtarget->hasSSE41())
7960 // Otherwise, use MOVSD or MOVSS.
7961 assert((EltVT == MVT::f32 || EltVT == MVT::f64) &&
7962 "Only two types of floating point element types to handle!");
7963 return DAG.getNode(EltVT == MVT::f32 ? X86ISD::MOVSS : X86ISD::MOVSD, DL,
7967 // This lowering only works for the low element with floating point vectors.
7968 if (VT.isFloatingPoint() && V2Index != 0)
7971 V2 = DAG.getNode(X86ISD::VZEXT_MOVL, DL, ExtVT, V2);
7973 V2 = DAG.getBitcast(VT, V2);
7976 // If we have 4 or fewer lanes we can cheaply shuffle the element into
7977 // the desired position. Otherwise it is more efficient to do a vector
7978 // shift left. We know that we can do a vector shift left because all
7979 // the inputs are zero.
7980 if (VT.isFloatingPoint() || VT.getVectorNumElements() <= 4) {
7981 SmallVector<int, 4> V2Shuffle(Mask.size(), 1);
7982 V2Shuffle[V2Index] = 0;
7983 V2 = DAG.getVectorShuffle(VT, DL, V2, DAG.getUNDEF(VT), V2Shuffle);
7985 V2 = DAG.getBitcast(MVT::v2i64, V2);
7987 X86ISD::VSHLDQ, DL, MVT::v2i64, V2,
7988 DAG.getConstant(V2Index * EltVT.getSizeInBits() / 8, DL,
7989 DAG.getTargetLoweringInfo().getScalarShiftAmountTy(
7990 DAG.getDataLayout(), VT)));
7991 V2 = DAG.getBitcast(VT, V2);
7997 /// \brief Try to lower broadcast of a single - truncated - integer element,
7998 /// coming from a scalar_to_vector/build_vector node \p V0 with larger elements.
8000 /// This assumes we have AVX2.
8001 static SDValue lowerVectorShuffleAsTruncBroadcast(SDLoc DL, MVT VT, SDValue V0,
8003 const X86Subtarget *Subtarget,
8004 SelectionDAG &DAG) {
8005 assert(Subtarget->hasAVX2() &&
8006 "We can only lower integer broadcasts with AVX2!");
8008 EVT EltVT = VT.getVectorElementType();
8009 EVT V0VT = V0.getValueType();
8011 assert(VT.isInteger() && "Unexpected non-integer trunc broadcast!");
8012 assert(V0VT.isVector() && "Unexpected non-vector vector-sized value!");
8014 EVT V0EltVT = V0VT.getVectorElementType();
8015 if (!V0EltVT.isInteger())
8018 const unsigned EltSize = EltVT.getSizeInBits();
8019 const unsigned V0EltSize = V0EltVT.getSizeInBits();
8021 // This is only a truncation if the original element type is larger.
8022 if (V0EltSize <= EltSize)
8025 assert(((V0EltSize % EltSize) == 0) &&
8026 "Scalar type sizes must all be powers of 2 on x86!");
8028 const unsigned V0Opc = V0.getOpcode();
8029 const unsigned Scale = V0EltSize / EltSize;
8030 const unsigned V0BroadcastIdx = BroadcastIdx / Scale;
8032 if ((V0Opc != ISD::SCALAR_TO_VECTOR || V0BroadcastIdx != 0) &&
8033 V0Opc != ISD::BUILD_VECTOR)
8036 SDValue Scalar = V0.getOperand(V0BroadcastIdx);
8038 // If we're extracting non-least-significant bits, shift so we can truncate.
8039 // Hopefully, we can fold away the trunc/srl/load into the broadcast.
8040 // Even if we can't (and !isShuffleFoldableLoad(Scalar)), prefer
8041 // vpbroadcast+vmovd+shr to vpshufb(m)+vmovd.
8042 if (const int OffsetIdx = BroadcastIdx % Scale)
8043 Scalar = DAG.getNode(ISD::SRL, DL, Scalar.getValueType(), Scalar,
8044 DAG.getConstant(OffsetIdx * EltSize, DL, Scalar.getValueType()));
8046 return DAG.getNode(X86ISD::VBROADCAST, DL, VT,
8047 DAG.getNode(ISD::TRUNCATE, DL, EltVT, Scalar));
8050 /// \brief Try to lower broadcast of a single element.
8052 /// For convenience, this code also bundles all of the subtarget feature set
8053 /// filtering. While a little annoying to re-dispatch on type here, there isn't
8054 /// a convenient way to factor it out.
8055 /// FIXME: This is very similar to LowerVectorBroadcast - can we merge them?
8056 static SDValue lowerVectorShuffleAsBroadcast(SDLoc DL, MVT VT, SDValue V,
8058 const X86Subtarget *Subtarget,
8059 SelectionDAG &DAG) {
8060 if (!Subtarget->hasAVX())
8062 if (VT.isInteger() && !Subtarget->hasAVX2())
8065 // Check that the mask is a broadcast.
8066 int BroadcastIdx = -1;
8068 if (M >= 0 && BroadcastIdx == -1)
8070 else if (M >= 0 && M != BroadcastIdx)
8073 assert(BroadcastIdx < (int)Mask.size() && "We only expect to be called with "
8074 "a sorted mask where the broadcast "
8077 // Go up the chain of (vector) values to find a scalar load that we can
8078 // combine with the broadcast.
8080 switch (V.getOpcode()) {
8081 case ISD::CONCAT_VECTORS: {
8082 int OperandSize = Mask.size() / V.getNumOperands();
8083 V = V.getOperand(BroadcastIdx / OperandSize);
8084 BroadcastIdx %= OperandSize;
8088 case ISD::INSERT_SUBVECTOR: {
8089 SDValue VOuter = V.getOperand(0), VInner = V.getOperand(1);
8090 auto ConstantIdx = dyn_cast<ConstantSDNode>(V.getOperand(2));
8094 int BeginIdx = (int)ConstantIdx->getZExtValue();
8096 BeginIdx + (int)VInner.getSimpleValueType().getVectorNumElements();
8097 if (BroadcastIdx >= BeginIdx && BroadcastIdx < EndIdx) {
8098 BroadcastIdx -= BeginIdx;
8109 // Check if this is a broadcast of a scalar. We special case lowering
8110 // for scalars so that we can more effectively fold with loads.
8111 // First, look through bitcast: if the original value has a larger element
8112 // type than the shuffle, the broadcast element is in essence truncated.
8113 // Make that explicit to ease folding.
8114 if (V.getOpcode() == ISD::BITCAST && VT.isInteger())
8115 if (SDValue TruncBroadcast = lowerVectorShuffleAsTruncBroadcast(
8116 DL, VT, V.getOperand(0), BroadcastIdx, Subtarget, DAG))
8117 return TruncBroadcast;
8119 // Also check the simpler case, where we can directly reuse the scalar.
8120 if (V.getOpcode() == ISD::BUILD_VECTOR ||
8121 (V.getOpcode() == ISD::SCALAR_TO_VECTOR && BroadcastIdx == 0)) {
8122 V = V.getOperand(BroadcastIdx);
8124 // If the scalar isn't a load, we can't broadcast from it in AVX1.
8125 // Only AVX2 has register broadcasts.
8126 if (!Subtarget->hasAVX2() && !isShuffleFoldableLoad(V))
8128 } else if (MayFoldLoad(V) && !cast<LoadSDNode>(V)->isVolatile()) {
8129 // If we are broadcasting a load that is only used by the shuffle
8130 // then we can reduce the vector load to the broadcasted scalar load.
8131 LoadSDNode *Ld = cast<LoadSDNode>(V);
8132 SDValue BaseAddr = Ld->getOperand(1);
8133 EVT AddrVT = BaseAddr.getValueType();
8134 EVT SVT = VT.getScalarType();
8135 unsigned Offset = BroadcastIdx * SVT.getStoreSize();
8136 SDValue NewAddr = DAG.getNode(
8137 ISD::ADD, DL, AddrVT, BaseAddr,
8138 DAG.getConstant(Offset, DL, AddrVT));
8139 V = DAG.getLoad(SVT, DL, Ld->getChain(), NewAddr,
8140 DAG.getMachineFunction().getMachineMemOperand(
8141 Ld->getMemOperand(), Offset, SVT.getStoreSize()));
8142 } else if (BroadcastIdx != 0 || !Subtarget->hasAVX2()) {
8143 // We can't broadcast from a vector register without AVX2, and we can only
8144 // broadcast from the zero-element of a vector register.
8148 return DAG.getNode(X86ISD::VBROADCAST, DL, VT, V);
8151 // Check for whether we can use INSERTPS to perform the shuffle. We only use
8152 // INSERTPS when the V1 elements are already in the correct locations
8153 // because otherwise we can just always use two SHUFPS instructions which
8154 // are much smaller to encode than a SHUFPS and an INSERTPS. We can also
8155 // perform INSERTPS if a single V1 element is out of place and all V2
8156 // elements are zeroable.
8157 static SDValue lowerVectorShuffleAsInsertPS(SDValue Op, SDValue V1, SDValue V2,
8159 SelectionDAG &DAG) {
8160 assert(Op.getSimpleValueType() == MVT::v4f32 && "Bad shuffle type!");
8161 assert(V1.getSimpleValueType() == MVT::v4f32 && "Bad operand type!");
8162 assert(V2.getSimpleValueType() == MVT::v4f32 && "Bad operand type!");
8163 assert(Mask.size() == 4 && "Unexpected mask size for v4 shuffle!");
8165 SmallBitVector Zeroable = computeZeroableShuffleElements(Mask, V1, V2);
8168 int V1DstIndex = -1;
8169 int V2DstIndex = -1;
8170 bool V1UsedInPlace = false;
8172 for (int i = 0; i < 4; ++i) {
8173 // Synthesize a zero mask from the zeroable elements (includes undefs).
8179 // Flag if we use any V1 inputs in place.
8181 V1UsedInPlace = true;
8185 // We can only insert a single non-zeroable element.
8186 if (V1DstIndex != -1 || V2DstIndex != -1)
8190 // V1 input out of place for insertion.
8193 // V2 input for insertion.
8198 // Don't bother if we have no (non-zeroable) element for insertion.
8199 if (V1DstIndex == -1 && V2DstIndex == -1)
8202 // Determine element insertion src/dst indices. The src index is from the
8203 // start of the inserted vector, not the start of the concatenated vector.
8204 unsigned V2SrcIndex = 0;
8205 if (V1DstIndex != -1) {
8206 // If we have a V1 input out of place, we use V1 as the V2 element insertion
8207 // and don't use the original V2 at all.
8208 V2SrcIndex = Mask[V1DstIndex];
8209 V2DstIndex = V1DstIndex;
8212 V2SrcIndex = Mask[V2DstIndex] - 4;
8215 // If no V1 inputs are used in place, then the result is created only from
8216 // the zero mask and the V2 insertion - so remove V1 dependency.
8218 V1 = DAG.getUNDEF(MVT::v4f32);
8220 unsigned InsertPSMask = V2SrcIndex << 6 | V2DstIndex << 4 | ZMask;
8221 assert((InsertPSMask & ~0xFFu) == 0 && "Invalid mask!");
8223 // Insert the V2 element into the desired position.
8225 return DAG.getNode(X86ISD::INSERTPS, DL, MVT::v4f32, V1, V2,
8226 DAG.getConstant(InsertPSMask, DL, MVT::i8));
8229 /// \brief Try to lower a shuffle as a permute of the inputs followed by an
8230 /// UNPCK instruction.
8232 /// This specifically targets cases where we end up with alternating between
8233 /// the two inputs, and so can permute them into something that feeds a single
8234 /// UNPCK instruction. Note that this routine only targets integer vectors
8235 /// because for floating point vectors we have a generalized SHUFPS lowering
8236 /// strategy that handles everything that doesn't *exactly* match an unpack,
8237 /// making this clever lowering unnecessary.
8238 static SDValue lowerVectorShuffleAsPermuteAndUnpack(SDLoc DL, MVT VT,
8239 SDValue V1, SDValue V2,
8241 SelectionDAG &DAG) {
8242 assert(!VT.isFloatingPoint() &&
8243 "This routine only supports integer vectors.");
8244 assert(!isSingleInputShuffleMask(Mask) &&
8245 "This routine should only be used when blending two inputs.");
8246 assert(Mask.size() >= 2 && "Single element masks are invalid.");
8248 int Size = Mask.size();
8250 int NumLoInputs = std::count_if(Mask.begin(), Mask.end(), [Size](int M) {
8251 return M >= 0 && M % Size < Size / 2;
8253 int NumHiInputs = std::count_if(
8254 Mask.begin(), Mask.end(), [Size](int M) { return M % Size >= Size / 2; });
8256 bool UnpackLo = NumLoInputs >= NumHiInputs;
8258 auto TryUnpack = [&](MVT UnpackVT, int Scale) {
8259 SmallVector<int, 32> V1Mask(Mask.size(), -1);
8260 SmallVector<int, 32> V2Mask(Mask.size(), -1);
8262 for (int i = 0; i < Size; ++i) {
8266 // Each element of the unpack contains Scale elements from this mask.
8267 int UnpackIdx = i / Scale;
8269 // We only handle the case where V1 feeds the first slots of the unpack.
8270 // We rely on canonicalization to ensure this is the case.
8271 if ((UnpackIdx % 2 == 0) != (Mask[i] < Size))
8274 // Setup the mask for this input. The indexing is tricky as we have to
8275 // handle the unpack stride.
8276 SmallVectorImpl<int> &VMask = (UnpackIdx % 2 == 0) ? V1Mask : V2Mask;
8277 VMask[(UnpackIdx / 2) * Scale + i % Scale + (UnpackLo ? 0 : Size / 2)] =
8281 // If we will have to shuffle both inputs to use the unpack, check whether
8282 // we can just unpack first and shuffle the result. If so, skip this unpack.
8283 if ((NumLoInputs == 0 || NumHiInputs == 0) && !isNoopShuffleMask(V1Mask) &&
8284 !isNoopShuffleMask(V2Mask))
8287 // Shuffle the inputs into place.
8288 V1 = DAG.getVectorShuffle(VT, DL, V1, DAG.getUNDEF(VT), V1Mask);
8289 V2 = DAG.getVectorShuffle(VT, DL, V2, DAG.getUNDEF(VT), V2Mask);
8291 // Cast the inputs to the type we will use to unpack them.
8292 V1 = DAG.getBitcast(UnpackVT, V1);
8293 V2 = DAG.getBitcast(UnpackVT, V2);
8295 // Unpack the inputs and cast the result back to the desired type.
8296 return DAG.getBitcast(
8297 VT, DAG.getNode(UnpackLo ? X86ISD::UNPCKL : X86ISD::UNPCKH, DL,
8301 // We try each unpack from the largest to the smallest to try and find one
8302 // that fits this mask.
8303 int OrigNumElements = VT.getVectorNumElements();
8304 int OrigScalarSize = VT.getScalarSizeInBits();
8305 for (int ScalarSize = 64; ScalarSize >= OrigScalarSize; ScalarSize /= 2) {
8306 int Scale = ScalarSize / OrigScalarSize;
8307 int NumElements = OrigNumElements / Scale;
8308 MVT UnpackVT = MVT::getVectorVT(MVT::getIntegerVT(ScalarSize), NumElements);
8309 if (SDValue Unpack = TryUnpack(UnpackVT, Scale))
8313 // If none of the unpack-rooted lowerings worked (or were profitable) try an
8315 if (NumLoInputs == 0 || NumHiInputs == 0) {
8316 assert((NumLoInputs > 0 || NumHiInputs > 0) &&
8317 "We have to have *some* inputs!");
8318 int HalfOffset = NumLoInputs == 0 ? Size / 2 : 0;
8320 // FIXME: We could consider the total complexity of the permute of each
8321 // possible unpacking. Or at the least we should consider how many
8322 // half-crossings are created.
8323 // FIXME: We could consider commuting the unpacks.
8325 SmallVector<int, 32> PermMask;
8326 PermMask.assign(Size, -1);
8327 for (int i = 0; i < Size; ++i) {
8331 assert(Mask[i] % Size >= HalfOffset && "Found input from wrong half!");
8334 2 * ((Mask[i] % Size) - HalfOffset) + (Mask[i] < Size ? 0 : 1);
8336 return DAG.getVectorShuffle(
8337 VT, DL, DAG.getNode(NumLoInputs == 0 ? X86ISD::UNPCKH : X86ISD::UNPCKL,
8339 DAG.getUNDEF(VT), PermMask);
8345 /// \brief Handle lowering of 2-lane 64-bit floating point shuffles.
8347 /// This is the basis function for the 2-lane 64-bit shuffles as we have full
8348 /// support for floating point shuffles but not integer shuffles. These
8349 /// instructions will incur a domain crossing penalty on some chips though so
8350 /// it is better to avoid lowering through this for integer vectors where
8352 static SDValue lowerV2F64VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
8353 const X86Subtarget *Subtarget,
8354 SelectionDAG &DAG) {
8356 assert(Op.getSimpleValueType() == MVT::v2f64 && "Bad shuffle type!");
8357 assert(V1.getSimpleValueType() == MVT::v2f64 && "Bad operand type!");
8358 assert(V2.getSimpleValueType() == MVT::v2f64 && "Bad operand type!");
8359 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
8360 ArrayRef<int> Mask = SVOp->getMask();
8361 assert(Mask.size() == 2 && "Unexpected mask size for v2 shuffle!");
8363 if (isSingleInputShuffleMask(Mask)) {
8364 // Use low duplicate instructions for masks that match their pattern.
8365 if (Subtarget->hasSSE3())
8366 if (isShuffleEquivalent(V1, V2, Mask, {0, 0}))
8367 return DAG.getNode(X86ISD::MOVDDUP, DL, MVT::v2f64, V1);
8369 // Straight shuffle of a single input vector. Simulate this by using the
8370 // single input as both of the "inputs" to this instruction..
8371 unsigned SHUFPDMask = (Mask[0] == 1) | ((Mask[1] == 1) << 1);
8373 if (Subtarget->hasAVX()) {
8374 // If we have AVX, we can use VPERMILPS which will allow folding a load
8375 // into the shuffle.
8376 return DAG.getNode(X86ISD::VPERMILPI, DL, MVT::v2f64, V1,
8377 DAG.getConstant(SHUFPDMask, DL, MVT::i8));
8380 return DAG.getNode(X86ISD::SHUFP, DL, MVT::v2f64, V1, V1,
8381 DAG.getConstant(SHUFPDMask, DL, MVT::i8));
8383 assert(Mask[0] >= 0 && Mask[0] < 2 && "Non-canonicalized blend!");
8384 assert(Mask[1] >= 2 && "Non-canonicalized blend!");
8386 // If we have a single input, insert that into V1 if we can do so cheaply.
8387 if ((Mask[0] >= 2) + (Mask[1] >= 2) == 1) {
8388 if (SDValue Insertion = lowerVectorShuffleAsElementInsertion(
8389 DL, MVT::v2f64, V1, V2, Mask, Subtarget, DAG))
8391 // Try inverting the insertion since for v2 masks it is easy to do and we
8392 // can't reliably sort the mask one way or the other.
8393 int InverseMask[2] = {Mask[0] < 0 ? -1 : (Mask[0] ^ 2),
8394 Mask[1] < 0 ? -1 : (Mask[1] ^ 2)};
8395 if (SDValue Insertion = lowerVectorShuffleAsElementInsertion(
8396 DL, MVT::v2f64, V2, V1, InverseMask, Subtarget, DAG))
8400 // Try to use one of the special instruction patterns to handle two common
8401 // blend patterns if a zero-blend above didn't work.
8402 if (isShuffleEquivalent(V1, V2, Mask, {0, 3}) ||
8403 isShuffleEquivalent(V1, V2, Mask, {1, 3}))
8404 if (SDValue V1S = getScalarValueForVectorElement(V1, Mask[0], DAG))
8405 // We can either use a special instruction to load over the low double or
8406 // to move just the low double.
8408 isShuffleFoldableLoad(V1S) ? X86ISD::MOVLPD : X86ISD::MOVSD,
8410 DAG.getNode(ISD::SCALAR_TO_VECTOR, DL, MVT::v2f64, V1S));
8412 if (Subtarget->hasSSE41())
8413 if (SDValue Blend = lowerVectorShuffleAsBlend(DL, MVT::v2f64, V1, V2, Mask,
8417 // Use dedicated unpack instructions for masks that match their pattern.
8419 lowerVectorShuffleWithUNPCK(DL, MVT::v2f64, Mask, V1, V2, DAG))
8422 unsigned SHUFPDMask = (Mask[0] == 1) | (((Mask[1] - 2) == 1) << 1);
8423 return DAG.getNode(X86ISD::SHUFP, DL, MVT::v2f64, V1, V2,
8424 DAG.getConstant(SHUFPDMask, DL, MVT::i8));
8427 /// \brief Handle lowering of 2-lane 64-bit integer shuffles.
8429 /// Tries to lower a 2-lane 64-bit shuffle using shuffle operations provided by
8430 /// the integer unit to minimize domain crossing penalties. However, for blends
8431 /// it falls back to the floating point shuffle operation with appropriate bit
8433 static SDValue lowerV2I64VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
8434 const X86Subtarget *Subtarget,
8435 SelectionDAG &DAG) {
8437 assert(Op.getSimpleValueType() == MVT::v2i64 && "Bad shuffle type!");
8438 assert(V1.getSimpleValueType() == MVT::v2i64 && "Bad operand type!");
8439 assert(V2.getSimpleValueType() == MVT::v2i64 && "Bad operand type!");
8440 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
8441 ArrayRef<int> Mask = SVOp->getMask();
8442 assert(Mask.size() == 2 && "Unexpected mask size for v2 shuffle!");
8444 if (isSingleInputShuffleMask(Mask)) {
8445 // Check for being able to broadcast a single element.
8446 if (SDValue Broadcast = lowerVectorShuffleAsBroadcast(DL, MVT::v2i64, V1,
8447 Mask, Subtarget, DAG))
8450 // Straight shuffle of a single input vector. For everything from SSE2
8451 // onward this has a single fast instruction with no scary immediates.
8452 // We have to map the mask as it is actually a v4i32 shuffle instruction.
8453 V1 = DAG.getBitcast(MVT::v4i32, V1);
8454 int WidenedMask[4] = {
8455 std::max(Mask[0], 0) * 2, std::max(Mask[0], 0) * 2 + 1,
8456 std::max(Mask[1], 0) * 2, std::max(Mask[1], 0) * 2 + 1};
8457 return DAG.getBitcast(
8459 DAG.getNode(X86ISD::PSHUFD, DL, MVT::v4i32, V1,
8460 getV4X86ShuffleImm8ForMask(WidenedMask, DL, DAG)));
8462 assert(Mask[0] != -1 && "No undef lanes in multi-input v2 shuffles!");
8463 assert(Mask[1] != -1 && "No undef lanes in multi-input v2 shuffles!");
8464 assert(Mask[0] < 2 && "We sort V1 to be the first input.");
8465 assert(Mask[1] >= 2 && "We sort V2 to be the second input.");
8467 // If we have a blend of two PACKUS operations an the blend aligns with the
8468 // low and half halves, we can just merge the PACKUS operations. This is
8469 // particularly important as it lets us merge shuffles that this routine itself
8471 auto GetPackNode = [](SDValue V) {
8472 while (V.getOpcode() == ISD::BITCAST)
8473 V = V.getOperand(0);
8475 return V.getOpcode() == X86ISD::PACKUS ? V : SDValue();
8477 if (SDValue V1Pack = GetPackNode(V1))
8478 if (SDValue V2Pack = GetPackNode(V2))
8479 return DAG.getBitcast(MVT::v2i64,
8480 DAG.getNode(X86ISD::PACKUS, DL, MVT::v16i8,
8481 Mask[0] == 0 ? V1Pack.getOperand(0)
8482 : V1Pack.getOperand(1),
8483 Mask[1] == 2 ? V2Pack.getOperand(0)
8484 : V2Pack.getOperand(1)));
8486 // Try to use shift instructions.
8488 lowerVectorShuffleAsShift(DL, MVT::v2i64, V1, V2, Mask, DAG))
8491 // When loading a scalar and then shuffling it into a vector we can often do
8492 // the insertion cheaply.
8493 if (SDValue Insertion = lowerVectorShuffleAsElementInsertion(
8494 DL, MVT::v2i64, V1, V2, Mask, Subtarget, DAG))
8496 // Try inverting the insertion since for v2 masks it is easy to do and we
8497 // can't reliably sort the mask one way or the other.
8498 int InverseMask[2] = {Mask[0] ^ 2, Mask[1] ^ 2};
8499 if (SDValue Insertion = lowerVectorShuffleAsElementInsertion(
8500 DL, MVT::v2i64, V2, V1, InverseMask, Subtarget, DAG))
8503 // We have different paths for blend lowering, but they all must use the
8504 // *exact* same predicate.
8505 bool IsBlendSupported = Subtarget->hasSSE41();
8506 if (IsBlendSupported)
8507 if (SDValue Blend = lowerVectorShuffleAsBlend(DL, MVT::v2i64, V1, V2, Mask,
8511 // Use dedicated unpack instructions for masks that match their pattern.
8513 lowerVectorShuffleWithUNPCK(DL, MVT::v2i64, Mask, V1, V2, DAG))
8516 // Try to use byte rotation instructions.
8517 // Its more profitable for pre-SSSE3 to use shuffles/unpacks.
8518 if (Subtarget->hasSSSE3())
8519 if (SDValue Rotate = lowerVectorShuffleAsByteRotate(
8520 DL, MVT::v2i64, V1, V2, Mask, Subtarget, DAG))
8523 // If we have direct support for blends, we should lower by decomposing into
8524 // a permute. That will be faster than the domain cross.
8525 if (IsBlendSupported)
8526 return lowerVectorShuffleAsDecomposedShuffleBlend(DL, MVT::v2i64, V1, V2,
8529 // We implement this with SHUFPD which is pretty lame because it will likely
8530 // incur 2 cycles of stall for integer vectors on Nehalem and older chips.
8531 // However, all the alternatives are still more cycles and newer chips don't
8532 // have this problem. It would be really nice if x86 had better shuffles here.
8533 V1 = DAG.getBitcast(MVT::v2f64, V1);
8534 V2 = DAG.getBitcast(MVT::v2f64, V2);
8535 return DAG.getBitcast(MVT::v2i64,
8536 DAG.getVectorShuffle(MVT::v2f64, DL, V1, V2, Mask));
8539 /// \brief Test whether this can be lowered with a single SHUFPS instruction.
8541 /// This is used to disable more specialized lowerings when the shufps lowering
8542 /// will happen to be efficient.
8543 static bool isSingleSHUFPSMask(ArrayRef<int> Mask) {
8544 // This routine only handles 128-bit shufps.
8545 assert(Mask.size() == 4 && "Unsupported mask size!");
8547 // To lower with a single SHUFPS we need to have the low half and high half
8548 // each requiring a single input.
8549 if (Mask[0] != -1 && Mask[1] != -1 && (Mask[0] < 4) != (Mask[1] < 4))
8551 if (Mask[2] != -1 && Mask[3] != -1 && (Mask[2] < 4) != (Mask[3] < 4))
8557 /// \brief Lower a vector shuffle using the SHUFPS instruction.
8559 /// This is a helper routine dedicated to lowering vector shuffles using SHUFPS.
8560 /// It makes no assumptions about whether this is the *best* lowering, it simply
8562 static SDValue lowerVectorShuffleWithSHUFPS(SDLoc DL, MVT VT,
8563 ArrayRef<int> Mask, SDValue V1,
8564 SDValue V2, SelectionDAG &DAG) {
8565 SDValue LowV = V1, HighV = V2;
8566 int NewMask[4] = {Mask[0], Mask[1], Mask[2], Mask[3]};
8569 std::count_if(Mask.begin(), Mask.end(), [](int M) { return M >= 4; });
8571 if (NumV2Elements == 1) {
8573 std::find_if(Mask.begin(), Mask.end(), [](int M) { return M >= 4; }) -
8576 // Compute the index adjacent to V2Index and in the same half by toggling
8578 int V2AdjIndex = V2Index ^ 1;
8580 if (Mask[V2AdjIndex] == -1) {
8581 // Handles all the cases where we have a single V2 element and an undef.
8582 // This will only ever happen in the high lanes because we commute the
8583 // vector otherwise.
8585 std::swap(LowV, HighV);
8586 NewMask[V2Index] -= 4;
8588 // Handle the case where the V2 element ends up adjacent to a V1 element.
8589 // To make this work, blend them together as the first step.
8590 int V1Index = V2AdjIndex;
8591 int BlendMask[4] = {Mask[V2Index] - 4, 0, Mask[V1Index], 0};
8592 V2 = DAG.getNode(X86ISD::SHUFP, DL, VT, V2, V1,
8593 getV4X86ShuffleImm8ForMask(BlendMask, DL, DAG));
8595 // Now proceed to reconstruct the final blend as we have the necessary
8596 // high or low half formed.
8603 NewMask[V1Index] = 2; // We put the V1 element in V2[2].
8604 NewMask[V2Index] = 0; // We shifted the V2 element into V2[0].
8606 } else if (NumV2Elements == 2) {
8607 if (Mask[0] < 4 && Mask[1] < 4) {
8608 // Handle the easy case where we have V1 in the low lanes and V2 in the
8612 } else if (Mask[2] < 4 && Mask[3] < 4) {
8613 // We also handle the reversed case because this utility may get called
8614 // when we detect a SHUFPS pattern but can't easily commute the shuffle to
8615 // arrange things in the right direction.
8621 // We have a mixture of V1 and V2 in both low and high lanes. Rather than
8622 // trying to place elements directly, just blend them and set up the final
8623 // shuffle to place them.
8625 // The first two blend mask elements are for V1, the second two are for
8627 int BlendMask[4] = {Mask[0] < 4 ? Mask[0] : Mask[1],
8628 Mask[2] < 4 ? Mask[2] : Mask[3],
8629 (Mask[0] >= 4 ? Mask[0] : Mask[1]) - 4,
8630 (Mask[2] >= 4 ? Mask[2] : Mask[3]) - 4};
8631 V1 = DAG.getNode(X86ISD::SHUFP, DL, VT, V1, V2,
8632 getV4X86ShuffleImm8ForMask(BlendMask, DL, DAG));
8634 // Now we do a normal shuffle of V1 by giving V1 as both operands to
8637 NewMask[0] = Mask[0] < 4 ? 0 : 2;
8638 NewMask[1] = Mask[0] < 4 ? 2 : 0;
8639 NewMask[2] = Mask[2] < 4 ? 1 : 3;
8640 NewMask[3] = Mask[2] < 4 ? 3 : 1;
8643 return DAG.getNode(X86ISD::SHUFP, DL, VT, LowV, HighV,
8644 getV4X86ShuffleImm8ForMask(NewMask, DL, DAG));
8647 /// \brief Lower 4-lane 32-bit floating point shuffles.
8649 /// Uses instructions exclusively from the floating point unit to minimize
8650 /// domain crossing penalties, as these are sufficient to implement all v4f32
8652 static SDValue lowerV4F32VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
8653 const X86Subtarget *Subtarget,
8654 SelectionDAG &DAG) {
8656 assert(Op.getSimpleValueType() == MVT::v4f32 && "Bad shuffle type!");
8657 assert(V1.getSimpleValueType() == MVT::v4f32 && "Bad operand type!");
8658 assert(V2.getSimpleValueType() == MVT::v4f32 && "Bad operand type!");
8659 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
8660 ArrayRef<int> Mask = SVOp->getMask();
8661 assert(Mask.size() == 4 && "Unexpected mask size for v4 shuffle!");
8664 std::count_if(Mask.begin(), Mask.end(), [](int M) { return M >= 4; });
8666 if (NumV2Elements == 0) {
8667 // Check for being able to broadcast a single element.
8668 if (SDValue Broadcast = lowerVectorShuffleAsBroadcast(DL, MVT::v4f32, V1,
8669 Mask, Subtarget, DAG))
8672 // Use even/odd duplicate instructions for masks that match their pattern.
8673 if (Subtarget->hasSSE3()) {
8674 if (isShuffleEquivalent(V1, V2, Mask, {0, 0, 2, 2}))
8675 return DAG.getNode(X86ISD::MOVSLDUP, DL, MVT::v4f32, V1);
8676 if (isShuffleEquivalent(V1, V2, Mask, {1, 1, 3, 3}))
8677 return DAG.getNode(X86ISD::MOVSHDUP, DL, MVT::v4f32, V1);
8680 if (Subtarget->hasAVX()) {
8681 // If we have AVX, we can use VPERMILPS which will allow folding a load
8682 // into the shuffle.
8683 return DAG.getNode(X86ISD::VPERMILPI, DL, MVT::v4f32, V1,
8684 getV4X86ShuffleImm8ForMask(Mask, DL, DAG));
8687 // Otherwise, use a straight shuffle of a single input vector. We pass the
8688 // input vector to both operands to simulate this with a SHUFPS.
8689 return DAG.getNode(X86ISD::SHUFP, DL, MVT::v4f32, V1, V1,
8690 getV4X86ShuffleImm8ForMask(Mask, DL, DAG));
8693 // There are special ways we can lower some single-element blends. However, we
8694 // have custom ways we can lower more complex single-element blends below that
8695 // we defer to if both this and BLENDPS fail to match, so restrict this to
8696 // when the V2 input is targeting element 0 of the mask -- that is the fast
8698 if (NumV2Elements == 1 && Mask[0] >= 4)
8699 if (SDValue V = lowerVectorShuffleAsElementInsertion(DL, MVT::v4f32, V1, V2,
8700 Mask, Subtarget, DAG))
8703 if (Subtarget->hasSSE41()) {
8704 if (SDValue Blend = lowerVectorShuffleAsBlend(DL, MVT::v4f32, V1, V2, Mask,
8708 // Use INSERTPS if we can complete the shuffle efficiently.
8709 if (SDValue V = lowerVectorShuffleAsInsertPS(Op, V1, V2, Mask, DAG))
8712 if (!isSingleSHUFPSMask(Mask))
8713 if (SDValue BlendPerm = lowerVectorShuffleAsBlendAndPermute(
8714 DL, MVT::v4f32, V1, V2, Mask, DAG))
8718 // Use dedicated unpack instructions for masks that match their pattern.
8720 lowerVectorShuffleWithUNPCK(DL, MVT::v4f32, Mask, V1, V2, DAG))
8723 // Otherwise fall back to a SHUFPS lowering strategy.
8724 return lowerVectorShuffleWithSHUFPS(DL, MVT::v4f32, Mask, V1, V2, DAG);
8727 /// \brief Lower 4-lane i32 vector shuffles.
8729 /// We try to handle these with integer-domain shuffles where we can, but for
8730 /// blends we use the floating point domain blend instructions.
8731 static SDValue lowerV4I32VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
8732 const X86Subtarget *Subtarget,
8733 SelectionDAG &DAG) {
8735 assert(Op.getSimpleValueType() == MVT::v4i32 && "Bad shuffle type!");
8736 assert(V1.getSimpleValueType() == MVT::v4i32 && "Bad operand type!");
8737 assert(V2.getSimpleValueType() == MVT::v4i32 && "Bad operand type!");
8738 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
8739 ArrayRef<int> Mask = SVOp->getMask();
8740 assert(Mask.size() == 4 && "Unexpected mask size for v4 shuffle!");
8742 // Whenever we can lower this as a zext, that instruction is strictly faster
8743 // than any alternative. It also allows us to fold memory operands into the
8744 // shuffle in many cases.
8745 if (SDValue ZExt = lowerVectorShuffleAsZeroOrAnyExtend(DL, MVT::v4i32, V1, V2,
8746 Mask, Subtarget, DAG))
8750 std::count_if(Mask.begin(), Mask.end(), [](int M) { return M >= 4; });
8752 if (NumV2Elements == 0) {
8753 // Check for being able to broadcast a single element.
8754 if (SDValue Broadcast = lowerVectorShuffleAsBroadcast(DL, MVT::v4i32, V1,
8755 Mask, Subtarget, DAG))
8758 // Straight shuffle of a single input vector. For everything from SSE2
8759 // onward this has a single fast instruction with no scary immediates.
8760 // We coerce the shuffle pattern to be compatible with UNPCK instructions
8761 // but we aren't actually going to use the UNPCK instruction because doing
8762 // so prevents folding a load into this instruction or making a copy.
8763 const int UnpackLoMask[] = {0, 0, 1, 1};
8764 const int UnpackHiMask[] = {2, 2, 3, 3};
8765 if (isShuffleEquivalent(V1, V2, Mask, {0, 0, 1, 1}))
8766 Mask = UnpackLoMask;
8767 else if (isShuffleEquivalent(V1, V2, Mask, {2, 2, 3, 3}))
8768 Mask = UnpackHiMask;
8770 return DAG.getNode(X86ISD::PSHUFD, DL, MVT::v4i32, V1,
8771 getV4X86ShuffleImm8ForMask(Mask, DL, DAG));
8774 // Try to use shift instructions.
8776 lowerVectorShuffleAsShift(DL, MVT::v4i32, V1, V2, Mask, DAG))
8779 // There are special ways we can lower some single-element blends.
8780 if (NumV2Elements == 1)
8781 if (SDValue V = lowerVectorShuffleAsElementInsertion(DL, MVT::v4i32, V1, V2,
8782 Mask, Subtarget, DAG))
8785 // We have different paths for blend lowering, but they all must use the
8786 // *exact* same predicate.
8787 bool IsBlendSupported = Subtarget->hasSSE41();
8788 if (IsBlendSupported)
8789 if (SDValue Blend = lowerVectorShuffleAsBlend(DL, MVT::v4i32, V1, V2, Mask,
8793 if (SDValue Masked =
8794 lowerVectorShuffleAsBitMask(DL, MVT::v4i32, V1, V2, Mask, DAG))
8797 // Use dedicated unpack instructions for masks that match their pattern.
8799 lowerVectorShuffleWithUNPCK(DL, MVT::v4i32, Mask, V1, V2, DAG))
8802 // Try to use byte rotation instructions.
8803 // Its more profitable for pre-SSSE3 to use shuffles/unpacks.
8804 if (Subtarget->hasSSSE3())
8805 if (SDValue Rotate = lowerVectorShuffleAsByteRotate(
8806 DL, MVT::v4i32, V1, V2, Mask, Subtarget, DAG))
8809 // If we have direct support for blends, we should lower by decomposing into
8810 // a permute. That will be faster than the domain cross.
8811 if (IsBlendSupported)
8812 return lowerVectorShuffleAsDecomposedShuffleBlend(DL, MVT::v4i32, V1, V2,
8815 // Try to lower by permuting the inputs into an unpack instruction.
8816 if (SDValue Unpack = lowerVectorShuffleAsPermuteAndUnpack(DL, MVT::v4i32, V1,
8820 // We implement this with SHUFPS because it can blend from two vectors.
8821 // Because we're going to eventually use SHUFPS, we use SHUFPS even to build
8822 // up the inputs, bypassing domain shift penalties that we would encur if we
8823 // directly used PSHUFD on Nehalem and older. For newer chips, this isn't
8825 return DAG.getBitcast(
8827 DAG.getVectorShuffle(MVT::v4f32, DL, DAG.getBitcast(MVT::v4f32, V1),
8828 DAG.getBitcast(MVT::v4f32, V2), Mask));
8831 /// \brief Lowering of single-input v8i16 shuffles is the cornerstone of SSE2
8832 /// shuffle lowering, and the most complex part.
8834 /// The lowering strategy is to try to form pairs of input lanes which are
8835 /// targeted at the same half of the final vector, and then use a dword shuffle
8836 /// to place them onto the right half, and finally unpack the paired lanes into
8837 /// their final position.
8839 /// The exact breakdown of how to form these dword pairs and align them on the
8840 /// correct sides is really tricky. See the comments within the function for
8841 /// more of the details.
8843 /// This code also handles repeated 128-bit lanes of v8i16 shuffles, but each
8844 /// lane must shuffle the *exact* same way. In fact, you must pass a v8 Mask to
8845 /// this routine for it to work correctly. To shuffle a 256-bit or 512-bit i16
8846 /// vector, form the analogous 128-bit 8-element Mask.
8847 static SDValue lowerV8I16GeneralSingleInputVectorShuffle(
8848 SDLoc DL, MVT VT, SDValue V, MutableArrayRef<int> Mask,
8849 const X86Subtarget *Subtarget, SelectionDAG &DAG) {
8850 assert(VT.getVectorElementType() == MVT::i16 && "Bad input type!");
8851 MVT PSHUFDVT = MVT::getVectorVT(MVT::i32, VT.getVectorNumElements() / 2);
8853 assert(Mask.size() == 8 && "Shuffle mask length doen't match!");
8854 MutableArrayRef<int> LoMask = Mask.slice(0, 4);
8855 MutableArrayRef<int> HiMask = Mask.slice(4, 4);
8857 SmallVector<int, 4> LoInputs;
8858 std::copy_if(LoMask.begin(), LoMask.end(), std::back_inserter(LoInputs),
8859 [](int M) { return M >= 0; });
8860 std::sort(LoInputs.begin(), LoInputs.end());
8861 LoInputs.erase(std::unique(LoInputs.begin(), LoInputs.end()), LoInputs.end());
8862 SmallVector<int, 4> HiInputs;
8863 std::copy_if(HiMask.begin(), HiMask.end(), std::back_inserter(HiInputs),
8864 [](int M) { return M >= 0; });
8865 std::sort(HiInputs.begin(), HiInputs.end());
8866 HiInputs.erase(std::unique(HiInputs.begin(), HiInputs.end()), HiInputs.end());
8868 std::lower_bound(LoInputs.begin(), LoInputs.end(), 4) - LoInputs.begin();
8869 int NumHToL = LoInputs.size() - NumLToL;
8871 std::lower_bound(HiInputs.begin(), HiInputs.end(), 4) - HiInputs.begin();
8872 int NumHToH = HiInputs.size() - NumLToH;
8873 MutableArrayRef<int> LToLInputs(LoInputs.data(), NumLToL);
8874 MutableArrayRef<int> LToHInputs(HiInputs.data(), NumLToH);
8875 MutableArrayRef<int> HToLInputs(LoInputs.data() + NumLToL, NumHToL);
8876 MutableArrayRef<int> HToHInputs(HiInputs.data() + NumLToH, NumHToH);
8878 // Simplify the 1-into-3 and 3-into-1 cases with a single pshufd. For all
8879 // such inputs we can swap two of the dwords across the half mark and end up
8880 // with <=2 inputs to each half in each half. Once there, we can fall through
8881 // to the generic code below. For example:
8883 // Input: [a, b, c, d, e, f, g, h] -PSHUFD[0,2,1,3]-> [a, b, e, f, c, d, g, h]
8884 // Mask: [0, 1, 2, 7, 4, 5, 6, 3] -----------------> [0, 1, 4, 7, 2, 3, 6, 5]
8886 // However in some very rare cases we have a 1-into-3 or 3-into-1 on one half
8887 // and an existing 2-into-2 on the other half. In this case we may have to
8888 // pre-shuffle the 2-into-2 half to avoid turning it into a 3-into-1 or
8889 // 1-into-3 which could cause us to cycle endlessly fixing each side in turn.
8890 // Fortunately, we don't have to handle anything but a 2-into-2 pattern
8891 // because any other situation (including a 3-into-1 or 1-into-3 in the other
8892 // half than the one we target for fixing) will be fixed when we re-enter this
8893 // path. We will also combine away any sequence of PSHUFD instructions that
8894 // result into a single instruction. Here is an example of the tricky case:
8896 // Input: [a, b, c, d, e, f, g, h] -PSHUFD[0,2,1,3]-> [a, b, e, f, c, d, g, h]
8897 // Mask: [3, 7, 1, 0, 2, 7, 3, 5] -THIS-IS-BAD!!!!-> [5, 7, 1, 0, 4, 7, 5, 3]
8899 // This now has a 1-into-3 in the high half! Instead, we do two shuffles:
8901 // Input: [a, b, c, d, e, f, g, h] PSHUFHW[0,2,1,3]-> [a, b, c, d, e, g, f, h]
8902 // Mask: [3, 7, 1, 0, 2, 7, 3, 5] -----------------> [3, 7, 1, 0, 2, 7, 3, 6]
8904 // Input: [a, b, c, d, e, g, f, h] -PSHUFD[0,2,1,3]-> [a, b, e, g, c, d, f, h]
8905 // Mask: [3, 7, 1, 0, 2, 7, 3, 6] -----------------> [5, 7, 1, 0, 4, 7, 5, 6]
8907 // The result is fine to be handled by the generic logic.
8908 auto balanceSides = [&](ArrayRef<int> AToAInputs, ArrayRef<int> BToAInputs,
8909 ArrayRef<int> BToBInputs, ArrayRef<int> AToBInputs,
8910 int AOffset, int BOffset) {
8911 assert((AToAInputs.size() == 3 || AToAInputs.size() == 1) &&
8912 "Must call this with A having 3 or 1 inputs from the A half.");
8913 assert((BToAInputs.size() == 1 || BToAInputs.size() == 3) &&
8914 "Must call this with B having 1 or 3 inputs from the B half.");
8915 assert(AToAInputs.size() + BToAInputs.size() == 4 &&
8916 "Must call this with either 3:1 or 1:3 inputs (summing to 4).");
8918 bool ThreeAInputs = AToAInputs.size() == 3;
8920 // Compute the index of dword with only one word among the three inputs in
8921 // a half by taking the sum of the half with three inputs and subtracting
8922 // the sum of the actual three inputs. The difference is the remaining
8925 int &TripleDWord = ThreeAInputs ? ADWord : BDWord;
8926 int &OneInputDWord = ThreeAInputs ? BDWord : ADWord;
8927 int TripleInputOffset = ThreeAInputs ? AOffset : BOffset;
8928 ArrayRef<int> TripleInputs = ThreeAInputs ? AToAInputs : BToAInputs;
8929 int OneInput = ThreeAInputs ? BToAInputs[0] : AToAInputs[0];
8930 int TripleInputSum = 0 + 1 + 2 + 3 + (4 * TripleInputOffset);
8931 int TripleNonInputIdx =
8932 TripleInputSum - std::accumulate(TripleInputs.begin(), TripleInputs.end(), 0);
8933 TripleDWord = TripleNonInputIdx / 2;
8935 // We use xor with one to compute the adjacent DWord to whichever one the
8937 OneInputDWord = (OneInput / 2) ^ 1;
8939 // Check for one tricky case: We're fixing a 3<-1 or a 1<-3 shuffle for AToA
8940 // and BToA inputs. If there is also such a problem with the BToB and AToB
8941 // inputs, we don't try to fix it necessarily -- we'll recurse and see it in
8942 // the next pass. However, if we have a 2<-2 in the BToB and AToB inputs, it
8943 // is essential that we don't *create* a 3<-1 as then we might oscillate.
8944 if (BToBInputs.size() == 2 && AToBInputs.size() == 2) {
8945 // Compute how many inputs will be flipped by swapping these DWords. We
8947 // to balance this to ensure we don't form a 3-1 shuffle in the other
8949 int NumFlippedAToBInputs =
8950 std::count(AToBInputs.begin(), AToBInputs.end(), 2 * ADWord) +
8951 std::count(AToBInputs.begin(), AToBInputs.end(), 2 * ADWord + 1);
8952 int NumFlippedBToBInputs =
8953 std::count(BToBInputs.begin(), BToBInputs.end(), 2 * BDWord) +
8954 std::count(BToBInputs.begin(), BToBInputs.end(), 2 * BDWord + 1);
8955 if ((NumFlippedAToBInputs == 1 &&
8956 (NumFlippedBToBInputs == 0 || NumFlippedBToBInputs == 2)) ||
8957 (NumFlippedBToBInputs == 1 &&
8958 (NumFlippedAToBInputs == 0 || NumFlippedAToBInputs == 2))) {
8959 // We choose whether to fix the A half or B half based on whether that
8960 // half has zero flipped inputs. At zero, we may not be able to fix it
8961 // with that half. We also bias towards fixing the B half because that
8962 // will more commonly be the high half, and we have to bias one way.
8963 auto FixFlippedInputs = [&V, &DL, &Mask, &DAG](int PinnedIdx, int DWord,
8964 ArrayRef<int> Inputs) {
8965 int FixIdx = PinnedIdx ^ 1; // The adjacent slot to the pinned slot.
8966 bool IsFixIdxInput = std::find(Inputs.begin(), Inputs.end(),
8967 PinnedIdx ^ 1) != Inputs.end();
8968 // Determine whether the free index is in the flipped dword or the
8969 // unflipped dword based on where the pinned index is. We use this bit
8970 // in an xor to conditionally select the adjacent dword.
8971 int FixFreeIdx = 2 * (DWord ^ (PinnedIdx / 2 == DWord));
8972 bool IsFixFreeIdxInput = std::find(Inputs.begin(), Inputs.end(),
8973 FixFreeIdx) != Inputs.end();
8974 if (IsFixIdxInput == IsFixFreeIdxInput)
8976 IsFixFreeIdxInput = std::find(Inputs.begin(), Inputs.end(),
8977 FixFreeIdx) != Inputs.end();
8978 assert(IsFixIdxInput != IsFixFreeIdxInput &&
8979 "We need to be changing the number of flipped inputs!");
8980 int PSHUFHalfMask[] = {0, 1, 2, 3};
8981 std::swap(PSHUFHalfMask[FixFreeIdx % 4], PSHUFHalfMask[FixIdx % 4]);
8982 V = DAG.getNode(FixIdx < 4 ? X86ISD::PSHUFLW : X86ISD::PSHUFHW, DL,
8984 getV4X86ShuffleImm8ForMask(PSHUFHalfMask, DL, DAG));
8987 if (M != -1 && M == FixIdx)
8989 else if (M != -1 && M == FixFreeIdx)
8992 if (NumFlippedBToBInputs != 0) {
8994 BToAInputs.size() == 3 ? TripleNonInputIdx : OneInput;
8995 FixFlippedInputs(BPinnedIdx, BDWord, BToBInputs);
8997 assert(NumFlippedAToBInputs != 0 && "Impossible given predicates!");
8998 int APinnedIdx = ThreeAInputs ? TripleNonInputIdx : OneInput;
8999 FixFlippedInputs(APinnedIdx, ADWord, AToBInputs);
9004 int PSHUFDMask[] = {0, 1, 2, 3};
9005 PSHUFDMask[ADWord] = BDWord;
9006 PSHUFDMask[BDWord] = ADWord;
9009 DAG.getNode(X86ISD::PSHUFD, DL, PSHUFDVT, DAG.getBitcast(PSHUFDVT, V),
9010 getV4X86ShuffleImm8ForMask(PSHUFDMask, DL, DAG)));
9012 // Adjust the mask to match the new locations of A and B.
9014 if (M != -1 && M/2 == ADWord)
9015 M = 2 * BDWord + M % 2;
9016 else if (M != -1 && M/2 == BDWord)
9017 M = 2 * ADWord + M % 2;
9019 // Recurse back into this routine to re-compute state now that this isn't
9020 // a 3 and 1 problem.
9021 return lowerV8I16GeneralSingleInputVectorShuffle(DL, VT, V, Mask, Subtarget,
9024 if ((NumLToL == 3 && NumHToL == 1) || (NumLToL == 1 && NumHToL == 3))
9025 return balanceSides(LToLInputs, HToLInputs, HToHInputs, LToHInputs, 0, 4);
9026 else if ((NumHToH == 3 && NumLToH == 1) || (NumHToH == 1 && NumLToH == 3))
9027 return balanceSides(HToHInputs, LToHInputs, LToLInputs, HToLInputs, 4, 0);
9029 // At this point there are at most two inputs to the low and high halves from
9030 // each half. That means the inputs can always be grouped into dwords and
9031 // those dwords can then be moved to the correct half with a dword shuffle.
9032 // We use at most one low and one high word shuffle to collect these paired
9033 // inputs into dwords, and finally a dword shuffle to place them.
9034 int PSHUFLMask[4] = {-1, -1, -1, -1};
9035 int PSHUFHMask[4] = {-1, -1, -1, -1};
9036 int PSHUFDMask[4] = {-1, -1, -1, -1};
9038 // First fix the masks for all the inputs that are staying in their
9039 // original halves. This will then dictate the targets of the cross-half
9041 auto fixInPlaceInputs =
9042 [&PSHUFDMask](ArrayRef<int> InPlaceInputs, ArrayRef<int> IncomingInputs,
9043 MutableArrayRef<int> SourceHalfMask,
9044 MutableArrayRef<int> HalfMask, int HalfOffset) {
9045 if (InPlaceInputs.empty())
9047 if (InPlaceInputs.size() == 1) {
9048 SourceHalfMask[InPlaceInputs[0] - HalfOffset] =
9049 InPlaceInputs[0] - HalfOffset;
9050 PSHUFDMask[InPlaceInputs[0] / 2] = InPlaceInputs[0] / 2;
9053 if (IncomingInputs.empty()) {
9054 // Just fix all of the in place inputs.
9055 for (int Input : InPlaceInputs) {
9056 SourceHalfMask[Input - HalfOffset] = Input - HalfOffset;
9057 PSHUFDMask[Input / 2] = Input / 2;
9062 assert(InPlaceInputs.size() == 2 && "Cannot handle 3 or 4 inputs!");
9063 SourceHalfMask[InPlaceInputs[0] - HalfOffset] =
9064 InPlaceInputs[0] - HalfOffset;
9065 // Put the second input next to the first so that they are packed into
9066 // a dword. We find the adjacent index by toggling the low bit.
9067 int AdjIndex = InPlaceInputs[0] ^ 1;
9068 SourceHalfMask[AdjIndex - HalfOffset] = InPlaceInputs[1] - HalfOffset;
9069 std::replace(HalfMask.begin(), HalfMask.end(), InPlaceInputs[1], AdjIndex);
9070 PSHUFDMask[AdjIndex / 2] = AdjIndex / 2;
9072 fixInPlaceInputs(LToLInputs, HToLInputs, PSHUFLMask, LoMask, 0);
9073 fixInPlaceInputs(HToHInputs, LToHInputs, PSHUFHMask, HiMask, 4);
9075 // Now gather the cross-half inputs and place them into a free dword of
9076 // their target half.
9077 // FIXME: This operation could almost certainly be simplified dramatically to
9078 // look more like the 3-1 fixing operation.
9079 auto moveInputsToRightHalf = [&PSHUFDMask](
9080 MutableArrayRef<int> IncomingInputs, ArrayRef<int> ExistingInputs,
9081 MutableArrayRef<int> SourceHalfMask, MutableArrayRef<int> HalfMask,
9082 MutableArrayRef<int> FinalSourceHalfMask, int SourceOffset,
9084 auto isWordClobbered = [](ArrayRef<int> SourceHalfMask, int Word) {
9085 return SourceHalfMask[Word] != -1 && SourceHalfMask[Word] != Word;
9087 auto isDWordClobbered = [&isWordClobbered](ArrayRef<int> SourceHalfMask,
9089 int LowWord = Word & ~1;
9090 int HighWord = Word | 1;
9091 return isWordClobbered(SourceHalfMask, LowWord) ||
9092 isWordClobbered(SourceHalfMask, HighWord);
9095 if (IncomingInputs.empty())
9098 if (ExistingInputs.empty()) {
9099 // Map any dwords with inputs from them into the right half.
9100 for (int Input : IncomingInputs) {
9101 // If the source half mask maps over the inputs, turn those into
9102 // swaps and use the swapped lane.
9103 if (isWordClobbered(SourceHalfMask, Input - SourceOffset)) {
9104 if (SourceHalfMask[SourceHalfMask[Input - SourceOffset]] == -1) {
9105 SourceHalfMask[SourceHalfMask[Input - SourceOffset]] =
9106 Input - SourceOffset;
9107 // We have to swap the uses in our half mask in one sweep.
9108 for (int &M : HalfMask)
9109 if (M == SourceHalfMask[Input - SourceOffset] + SourceOffset)
9111 else if (M == Input)
9112 M = SourceHalfMask[Input - SourceOffset] + SourceOffset;
9114 assert(SourceHalfMask[SourceHalfMask[Input - SourceOffset]] ==
9115 Input - SourceOffset &&
9116 "Previous placement doesn't match!");
9118 // Note that this correctly re-maps both when we do a swap and when
9119 // we observe the other side of the swap above. We rely on that to
9120 // avoid swapping the members of the input list directly.
9121 Input = SourceHalfMask[Input - SourceOffset] + SourceOffset;
9124 // Map the input's dword into the correct half.
9125 if (PSHUFDMask[(Input - SourceOffset + DestOffset) / 2] == -1)
9126 PSHUFDMask[(Input - SourceOffset + DestOffset) / 2] = Input / 2;
9128 assert(PSHUFDMask[(Input - SourceOffset + DestOffset) / 2] ==
9130 "Previous placement doesn't match!");
9133 // And just directly shift any other-half mask elements to be same-half
9134 // as we will have mirrored the dword containing the element into the
9135 // same position within that half.
9136 for (int &M : HalfMask)
9137 if (M >= SourceOffset && M < SourceOffset + 4) {
9138 M = M - SourceOffset + DestOffset;
9139 assert(M >= 0 && "This should never wrap below zero!");
9144 // Ensure we have the input in a viable dword of its current half. This
9145 // is particularly tricky because the original position may be clobbered
9146 // by inputs being moved and *staying* in that half.
9147 if (IncomingInputs.size() == 1) {
9148 if (isWordClobbered(SourceHalfMask, IncomingInputs[0] - SourceOffset)) {
9149 int InputFixed = std::find(std::begin(SourceHalfMask),
9150 std::end(SourceHalfMask), -1) -
9151 std::begin(SourceHalfMask) + SourceOffset;
9152 SourceHalfMask[InputFixed - SourceOffset] =
9153 IncomingInputs[0] - SourceOffset;
9154 std::replace(HalfMask.begin(), HalfMask.end(), IncomingInputs[0],
9156 IncomingInputs[0] = InputFixed;
9158 } else if (IncomingInputs.size() == 2) {
9159 if (IncomingInputs[0] / 2 != IncomingInputs[1] / 2 ||
9160 isDWordClobbered(SourceHalfMask, IncomingInputs[0] - SourceOffset)) {
9161 // We have two non-adjacent or clobbered inputs we need to extract from
9162 // the source half. To do this, we need to map them into some adjacent
9163 // dword slot in the source mask.
9164 int InputsFixed[2] = {IncomingInputs[0] - SourceOffset,
9165 IncomingInputs[1] - SourceOffset};
9167 // If there is a free slot in the source half mask adjacent to one of
9168 // the inputs, place the other input in it. We use (Index XOR 1) to
9169 // compute an adjacent index.
9170 if (!isWordClobbered(SourceHalfMask, InputsFixed[0]) &&
9171 SourceHalfMask[InputsFixed[0] ^ 1] == -1) {
9172 SourceHalfMask[InputsFixed[0]] = InputsFixed[0];
9173 SourceHalfMask[InputsFixed[0] ^ 1] = InputsFixed[1];
9174 InputsFixed[1] = InputsFixed[0] ^ 1;
9175 } else if (!isWordClobbered(SourceHalfMask, InputsFixed[1]) &&
9176 SourceHalfMask[InputsFixed[1] ^ 1] == -1) {
9177 SourceHalfMask[InputsFixed[1]] = InputsFixed[1];
9178 SourceHalfMask[InputsFixed[1] ^ 1] = InputsFixed[0];
9179 InputsFixed[0] = InputsFixed[1] ^ 1;
9180 } else if (SourceHalfMask[2 * ((InputsFixed[0] / 2) ^ 1)] == -1 &&
9181 SourceHalfMask[2 * ((InputsFixed[0] / 2) ^ 1) + 1] == -1) {
9182 // The two inputs are in the same DWord but it is clobbered and the
9183 // adjacent DWord isn't used at all. Move both inputs to the free
9185 SourceHalfMask[2 * ((InputsFixed[0] / 2) ^ 1)] = InputsFixed[0];
9186 SourceHalfMask[2 * ((InputsFixed[0] / 2) ^ 1) + 1] = InputsFixed[1];
9187 InputsFixed[0] = 2 * ((InputsFixed[0] / 2) ^ 1);
9188 InputsFixed[1] = 2 * ((InputsFixed[0] / 2) ^ 1) + 1;
9190 // The only way we hit this point is if there is no clobbering
9191 // (because there are no off-half inputs to this half) and there is no
9192 // free slot adjacent to one of the inputs. In this case, we have to
9193 // swap an input with a non-input.
9194 for (int i = 0; i < 4; ++i)
9195 assert((SourceHalfMask[i] == -1 || SourceHalfMask[i] == i) &&
9196 "We can't handle any clobbers here!");
9197 assert(InputsFixed[1] != (InputsFixed[0] ^ 1) &&
9198 "Cannot have adjacent inputs here!");
9200 SourceHalfMask[InputsFixed[0] ^ 1] = InputsFixed[1];
9201 SourceHalfMask[InputsFixed[1]] = InputsFixed[0] ^ 1;
9203 // We also have to update the final source mask in this case because
9204 // it may need to undo the above swap.
9205 for (int &M : FinalSourceHalfMask)
9206 if (M == (InputsFixed[0] ^ 1) + SourceOffset)
9207 M = InputsFixed[1] + SourceOffset;
9208 else if (M == InputsFixed[1] + SourceOffset)
9209 M = (InputsFixed[0] ^ 1) + SourceOffset;
9211 InputsFixed[1] = InputsFixed[0] ^ 1;
9214 // Point everything at the fixed inputs.
9215 for (int &M : HalfMask)
9216 if (M == IncomingInputs[0])
9217 M = InputsFixed[0] + SourceOffset;
9218 else if (M == IncomingInputs[1])
9219 M = InputsFixed[1] + SourceOffset;
9221 IncomingInputs[0] = InputsFixed[0] + SourceOffset;
9222 IncomingInputs[1] = InputsFixed[1] + SourceOffset;
9225 llvm_unreachable("Unhandled input size!");
9228 // Now hoist the DWord down to the right half.
9229 int FreeDWord = (PSHUFDMask[DestOffset / 2] == -1 ? 0 : 1) + DestOffset / 2;
9230 assert(PSHUFDMask[FreeDWord] == -1 && "DWord not free");
9231 PSHUFDMask[FreeDWord] = IncomingInputs[0] / 2;
9232 for (int &M : HalfMask)
9233 for (int Input : IncomingInputs)
9235 M = FreeDWord * 2 + Input % 2;
9237 moveInputsToRightHalf(HToLInputs, LToLInputs, PSHUFHMask, LoMask, HiMask,
9238 /*SourceOffset*/ 4, /*DestOffset*/ 0);
9239 moveInputsToRightHalf(LToHInputs, HToHInputs, PSHUFLMask, HiMask, LoMask,
9240 /*SourceOffset*/ 0, /*DestOffset*/ 4);
9242 // Now enact all the shuffles we've computed to move the inputs into their
9244 if (!isNoopShuffleMask(PSHUFLMask))
9245 V = DAG.getNode(X86ISD::PSHUFLW, DL, VT, V,
9246 getV4X86ShuffleImm8ForMask(PSHUFLMask, DL, DAG));
9247 if (!isNoopShuffleMask(PSHUFHMask))
9248 V = DAG.getNode(X86ISD::PSHUFHW, DL, VT, V,
9249 getV4X86ShuffleImm8ForMask(PSHUFHMask, DL, DAG));
9250 if (!isNoopShuffleMask(PSHUFDMask))
9253 DAG.getNode(X86ISD::PSHUFD, DL, PSHUFDVT, DAG.getBitcast(PSHUFDVT, V),
9254 getV4X86ShuffleImm8ForMask(PSHUFDMask, DL, DAG)));
9256 // At this point, each half should contain all its inputs, and we can then
9257 // just shuffle them into their final position.
9258 assert(std::count_if(LoMask.begin(), LoMask.end(),
9259 [](int M) { return M >= 4; }) == 0 &&
9260 "Failed to lift all the high half inputs to the low mask!");
9261 assert(std::count_if(HiMask.begin(), HiMask.end(),
9262 [](int M) { return M >= 0 && M < 4; }) == 0 &&
9263 "Failed to lift all the low half inputs to the high mask!");
9265 // Do a half shuffle for the low mask.
9266 if (!isNoopShuffleMask(LoMask))
9267 V = DAG.getNode(X86ISD::PSHUFLW, DL, VT, V,
9268 getV4X86ShuffleImm8ForMask(LoMask, DL, DAG));
9270 // Do a half shuffle with the high mask after shifting its values down.
9271 for (int &M : HiMask)
9274 if (!isNoopShuffleMask(HiMask))
9275 V = DAG.getNode(X86ISD::PSHUFHW, DL, VT, V,
9276 getV4X86ShuffleImm8ForMask(HiMask, DL, DAG));
9281 /// \brief Helper to form a PSHUFB-based shuffle+blend.
9282 static SDValue lowerVectorShuffleAsPSHUFB(SDLoc DL, MVT VT, SDValue V1,
9283 SDValue V2, ArrayRef<int> Mask,
9284 SelectionDAG &DAG, bool &V1InUse,
9286 SmallBitVector Zeroable = computeZeroableShuffleElements(Mask, V1, V2);
9292 int Size = Mask.size();
9293 int Scale = 16 / Size;
9294 for (int i = 0; i < 16; ++i) {
9295 if (Mask[i / Scale] == -1) {
9296 V1Mask[i] = V2Mask[i] = DAG.getUNDEF(MVT::i8);
9298 const int ZeroMask = 0x80;
9299 int V1Idx = Mask[i / Scale] < Size ? Mask[i / Scale] * Scale + i % Scale
9301 int V2Idx = Mask[i / Scale] < Size
9303 : (Mask[i / Scale] - Size) * Scale + i % Scale;
9304 if (Zeroable[i / Scale])
9305 V1Idx = V2Idx = ZeroMask;
9306 V1Mask[i] = DAG.getConstant(V1Idx, DL, MVT::i8);
9307 V2Mask[i] = DAG.getConstant(V2Idx, DL, MVT::i8);
9308 V1InUse |= (ZeroMask != V1Idx);
9309 V2InUse |= (ZeroMask != V2Idx);
9314 V1 = DAG.getNode(X86ISD::PSHUFB, DL, MVT::v16i8,
9315 DAG.getBitcast(MVT::v16i8, V1),
9316 DAG.getNode(ISD::BUILD_VECTOR, DL, MVT::v16i8, V1Mask));
9318 V2 = DAG.getNode(X86ISD::PSHUFB, DL, MVT::v16i8,
9319 DAG.getBitcast(MVT::v16i8, V2),
9320 DAG.getNode(ISD::BUILD_VECTOR, DL, MVT::v16i8, V2Mask));
9322 // If we need shuffled inputs from both, blend the two.
9324 if (V1InUse && V2InUse)
9325 V = DAG.getNode(ISD::OR, DL, MVT::v16i8, V1, V2);
9327 V = V1InUse ? V1 : V2;
9329 // Cast the result back to the correct type.
9330 return DAG.getBitcast(VT, V);
9333 /// \brief Generic lowering of 8-lane i16 shuffles.
9335 /// This handles both single-input shuffles and combined shuffle/blends with
9336 /// two inputs. The single input shuffles are immediately delegated to
9337 /// a dedicated lowering routine.
9339 /// The blends are lowered in one of three fundamental ways. If there are few
9340 /// enough inputs, it delegates to a basic UNPCK-based strategy. If the shuffle
9341 /// of the input is significantly cheaper when lowered as an interleaving of
9342 /// the two inputs, try to interleave them. Otherwise, blend the low and high
9343 /// halves of the inputs separately (making them have relatively few inputs)
9344 /// and then concatenate them.
9345 static SDValue lowerV8I16VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
9346 const X86Subtarget *Subtarget,
9347 SelectionDAG &DAG) {
9349 assert(Op.getSimpleValueType() == MVT::v8i16 && "Bad shuffle type!");
9350 assert(V1.getSimpleValueType() == MVT::v8i16 && "Bad operand type!");
9351 assert(V2.getSimpleValueType() == MVT::v8i16 && "Bad operand type!");
9352 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
9353 ArrayRef<int> OrigMask = SVOp->getMask();
9354 int MaskStorage[8] = {OrigMask[0], OrigMask[1], OrigMask[2], OrigMask[3],
9355 OrigMask[4], OrigMask[5], OrigMask[6], OrigMask[7]};
9356 MutableArrayRef<int> Mask(MaskStorage);
9358 assert(Mask.size() == 8 && "Unexpected mask size for v8 shuffle!");
9360 // Whenever we can lower this as a zext, that instruction is strictly faster
9361 // than any alternative.
9362 if (SDValue ZExt = lowerVectorShuffleAsZeroOrAnyExtend(
9363 DL, MVT::v8i16, V1, V2, OrigMask, Subtarget, DAG))
9366 auto isV1 = [](int M) { return M >= 0 && M < 8; };
9368 auto isV2 = [](int M) { return M >= 8; };
9370 int NumV2Inputs = std::count_if(Mask.begin(), Mask.end(), isV2);
9372 if (NumV2Inputs == 0) {
9373 // Check for being able to broadcast a single element.
9374 if (SDValue Broadcast = lowerVectorShuffleAsBroadcast(DL, MVT::v8i16, V1,
9375 Mask, Subtarget, DAG))
9378 // Try to use shift instructions.
9380 lowerVectorShuffleAsShift(DL, MVT::v8i16, V1, V1, Mask, DAG))
9383 // Use dedicated unpack instructions for masks that match their pattern.
9385 lowerVectorShuffleWithUNPCK(DL, MVT::v8i16, Mask, V1, V2, DAG))
9388 // Try to use byte rotation instructions.
9389 if (SDValue Rotate = lowerVectorShuffleAsByteRotate(DL, MVT::v8i16, V1, V1,
9390 Mask, Subtarget, DAG))
9393 return lowerV8I16GeneralSingleInputVectorShuffle(DL, MVT::v8i16, V1, Mask,
9397 assert(std::any_of(Mask.begin(), Mask.end(), isV1) &&
9398 "All single-input shuffles should be canonicalized to be V1-input "
9401 // Try to use shift instructions.
9403 lowerVectorShuffleAsShift(DL, MVT::v8i16, V1, V2, Mask, DAG))
9406 // See if we can use SSE4A Extraction / Insertion.
9407 if (Subtarget->hasSSE4A())
9408 if (SDValue V = lowerVectorShuffleWithSSE4A(DL, MVT::v8i16, V1, V2, Mask, DAG))
9411 // There are special ways we can lower some single-element blends.
9412 if (NumV2Inputs == 1)
9413 if (SDValue V = lowerVectorShuffleAsElementInsertion(DL, MVT::v8i16, V1, V2,
9414 Mask, Subtarget, DAG))
9417 // We have different paths for blend lowering, but they all must use the
9418 // *exact* same predicate.
9419 bool IsBlendSupported = Subtarget->hasSSE41();
9420 if (IsBlendSupported)
9421 if (SDValue Blend = lowerVectorShuffleAsBlend(DL, MVT::v8i16, V1, V2, Mask,
9425 if (SDValue Masked =
9426 lowerVectorShuffleAsBitMask(DL, MVT::v8i16, V1, V2, Mask, DAG))
9429 // Use dedicated unpack instructions for masks that match their pattern.
9431 lowerVectorShuffleWithUNPCK(DL, MVT::v8i16, Mask, V1, V2, DAG))
9434 // Try to use byte rotation instructions.
9435 if (SDValue Rotate = lowerVectorShuffleAsByteRotate(
9436 DL, MVT::v8i16, V1, V2, Mask, Subtarget, DAG))
9439 if (SDValue BitBlend =
9440 lowerVectorShuffleAsBitBlend(DL, MVT::v8i16, V1, V2, Mask, DAG))
9443 if (SDValue Unpack = lowerVectorShuffleAsPermuteAndUnpack(DL, MVT::v8i16, V1,
9447 // If we can't directly blend but can use PSHUFB, that will be better as it
9448 // can both shuffle and set up the inefficient blend.
9449 if (!IsBlendSupported && Subtarget->hasSSSE3()) {
9450 bool V1InUse, V2InUse;
9451 return lowerVectorShuffleAsPSHUFB(DL, MVT::v8i16, V1, V2, Mask, DAG,
9455 // We can always bit-blend if we have to so the fallback strategy is to
9456 // decompose into single-input permutes and blends.
9457 return lowerVectorShuffleAsDecomposedShuffleBlend(DL, MVT::v8i16, V1, V2,
9461 /// \brief Check whether a compaction lowering can be done by dropping even
9462 /// elements and compute how many times even elements must be dropped.
9464 /// This handles shuffles which take every Nth element where N is a power of
9465 /// two. Example shuffle masks:
9467 /// N = 1: 0, 2, 4, 6, 8, 10, 12, 14, 0, 2, 4, 6, 8, 10, 12, 14
9468 /// N = 1: 0, 2, 4, 6, 8, 10, 12, 14, 16, 18, 20, 22, 24, 26, 28, 30
9469 /// N = 2: 0, 4, 8, 12, 0, 4, 8, 12, 0, 4, 8, 12, 0, 4, 8, 12
9470 /// N = 2: 0, 4, 8, 12, 16, 20, 24, 28, 0, 4, 8, 12, 16, 20, 24, 28
9471 /// N = 3: 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8
9472 /// N = 3: 0, 8, 16, 24, 0, 8, 16, 24, 0, 8, 16, 24, 0, 8, 16, 24
9474 /// Any of these lanes can of course be undef.
9476 /// This routine only supports N <= 3.
9477 /// FIXME: Evaluate whether either AVX or AVX-512 have any opportunities here
9480 /// \returns N above, or the number of times even elements must be dropped if
9481 /// there is such a number. Otherwise returns zero.
9482 static int canLowerByDroppingEvenElements(ArrayRef<int> Mask) {
9483 // Figure out whether we're looping over two inputs or just one.
9484 bool IsSingleInput = isSingleInputShuffleMask(Mask);
9486 // The modulus for the shuffle vector entries is based on whether this is
9487 // a single input or not.
9488 int ShuffleModulus = Mask.size() * (IsSingleInput ? 1 : 2);
9489 assert(isPowerOf2_32((uint32_t)ShuffleModulus) &&
9490 "We should only be called with masks with a power-of-2 size!");
9492 uint64_t ModMask = (uint64_t)ShuffleModulus - 1;
9494 // We track whether the input is viable for all power-of-2 strides 2^1, 2^2,
9495 // and 2^3 simultaneously. This is because we may have ambiguity with
9496 // partially undef inputs.
9497 bool ViableForN[3] = {true, true, true};
9499 for (int i = 0, e = Mask.size(); i < e; ++i) {
9500 // Ignore undef lanes, we'll optimistically collapse them to the pattern we
9505 bool IsAnyViable = false;
9506 for (unsigned j = 0; j != array_lengthof(ViableForN); ++j)
9507 if (ViableForN[j]) {
9510 // The shuffle mask must be equal to (i * 2^N) % M.
9511 if ((uint64_t)Mask[i] == (((uint64_t)i << N) & ModMask))
9514 ViableForN[j] = false;
9516 // Early exit if we exhaust the possible powers of two.
9521 for (unsigned j = 0; j != array_lengthof(ViableForN); ++j)
9525 // Return 0 as there is no viable power of two.
9529 /// \brief Generic lowering of v16i8 shuffles.
9531 /// This is a hybrid strategy to lower v16i8 vectors. It first attempts to
9532 /// detect any complexity reducing interleaving. If that doesn't help, it uses
9533 /// UNPCK to spread the i8 elements across two i16-element vectors, and uses
9534 /// the existing lowering for v8i16 blends on each half, finally PACK-ing them
9536 static SDValue lowerV16I8VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
9537 const X86Subtarget *Subtarget,
9538 SelectionDAG &DAG) {
9540 assert(Op.getSimpleValueType() == MVT::v16i8 && "Bad shuffle type!");
9541 assert(V1.getSimpleValueType() == MVT::v16i8 && "Bad operand type!");
9542 assert(V2.getSimpleValueType() == MVT::v16i8 && "Bad operand type!");
9543 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
9544 ArrayRef<int> Mask = SVOp->getMask();
9545 assert(Mask.size() == 16 && "Unexpected mask size for v16 shuffle!");
9547 // Try to use shift instructions.
9549 lowerVectorShuffleAsShift(DL, MVT::v16i8, V1, V2, Mask, DAG))
9552 // Try to use byte rotation instructions.
9553 if (SDValue Rotate = lowerVectorShuffleAsByteRotate(
9554 DL, MVT::v16i8, V1, V2, Mask, Subtarget, DAG))
9557 // Try to use a zext lowering.
9558 if (SDValue ZExt = lowerVectorShuffleAsZeroOrAnyExtend(
9559 DL, MVT::v16i8, V1, V2, Mask, Subtarget, DAG))
9562 // See if we can use SSE4A Extraction / Insertion.
9563 if (Subtarget->hasSSE4A())
9564 if (SDValue V = lowerVectorShuffleWithSSE4A(DL, MVT::v16i8, V1, V2, Mask, DAG))
9568 std::count_if(Mask.begin(), Mask.end(), [](int M) { return M >= 16; });
9570 // For single-input shuffles, there are some nicer lowering tricks we can use.
9571 if (NumV2Elements == 0) {
9572 // Check for being able to broadcast a single element.
9573 if (SDValue Broadcast = lowerVectorShuffleAsBroadcast(DL, MVT::v16i8, V1,
9574 Mask, Subtarget, DAG))
9577 // Check whether we can widen this to an i16 shuffle by duplicating bytes.
9578 // Notably, this handles splat and partial-splat shuffles more efficiently.
9579 // However, it only makes sense if the pre-duplication shuffle simplifies
9580 // things significantly. Currently, this means we need to be able to
9581 // express the pre-duplication shuffle as an i16 shuffle.
9583 // FIXME: We should check for other patterns which can be widened into an
9584 // i16 shuffle as well.
9585 auto canWidenViaDuplication = [](ArrayRef<int> Mask) {
9586 for (int i = 0; i < 16; i += 2)
9587 if (Mask[i] != -1 && Mask[i + 1] != -1 && Mask[i] != Mask[i + 1])
9592 auto tryToWidenViaDuplication = [&]() -> SDValue {
9593 if (!canWidenViaDuplication(Mask))
9595 SmallVector<int, 4> LoInputs;
9596 std::copy_if(Mask.begin(), Mask.end(), std::back_inserter(LoInputs),
9597 [](int M) { return M >= 0 && M < 8; });
9598 std::sort(LoInputs.begin(), LoInputs.end());
9599 LoInputs.erase(std::unique(LoInputs.begin(), LoInputs.end()),
9601 SmallVector<int, 4> HiInputs;
9602 std::copy_if(Mask.begin(), Mask.end(), std::back_inserter(HiInputs),
9603 [](int M) { return M >= 8; });
9604 std::sort(HiInputs.begin(), HiInputs.end());
9605 HiInputs.erase(std::unique(HiInputs.begin(), HiInputs.end()),
9608 bool TargetLo = LoInputs.size() >= HiInputs.size();
9609 ArrayRef<int> InPlaceInputs = TargetLo ? LoInputs : HiInputs;
9610 ArrayRef<int> MovingInputs = TargetLo ? HiInputs : LoInputs;
9612 int PreDupI16Shuffle[] = {-1, -1, -1, -1, -1, -1, -1, -1};
9613 SmallDenseMap<int, int, 8> LaneMap;
9614 for (int I : InPlaceInputs) {
9615 PreDupI16Shuffle[I/2] = I/2;
9618 int j = TargetLo ? 0 : 4, je = j + 4;
9619 for (int i = 0, ie = MovingInputs.size(); i < ie; ++i) {
9620 // Check if j is already a shuffle of this input. This happens when
9621 // there are two adjacent bytes after we move the low one.
9622 if (PreDupI16Shuffle[j] != MovingInputs[i] / 2) {
9623 // If we haven't yet mapped the input, search for a slot into which
9625 while (j < je && PreDupI16Shuffle[j] != -1)
9629 // We can't place the inputs into a single half with a simple i16 shuffle, so bail.
9632 // Map this input with the i16 shuffle.
9633 PreDupI16Shuffle[j] = MovingInputs[i] / 2;
9636 // Update the lane map based on the mapping we ended up with.
9637 LaneMap[MovingInputs[i]] = 2 * j + MovingInputs[i] % 2;
9639 V1 = DAG.getBitcast(
9641 DAG.getVectorShuffle(MVT::v8i16, DL, DAG.getBitcast(MVT::v8i16, V1),
9642 DAG.getUNDEF(MVT::v8i16), PreDupI16Shuffle));
9644 // Unpack the bytes to form the i16s that will be shuffled into place.
9645 V1 = DAG.getNode(TargetLo ? X86ISD::UNPCKL : X86ISD::UNPCKH, DL,
9646 MVT::v16i8, V1, V1);
9648 int PostDupI16Shuffle[8] = {-1, -1, -1, -1, -1, -1, -1, -1};
9649 for (int i = 0; i < 16; ++i)
9650 if (Mask[i] != -1) {
9651 int MappedMask = LaneMap[Mask[i]] - (TargetLo ? 0 : 8);
9652 assert(MappedMask < 8 && "Invalid v8 shuffle mask!");
9653 if (PostDupI16Shuffle[i / 2] == -1)
9654 PostDupI16Shuffle[i / 2] = MappedMask;
9656 assert(PostDupI16Shuffle[i / 2] == MappedMask &&
9657 "Conflicting entrties in the original shuffle!");
9659 return DAG.getBitcast(
9661 DAG.getVectorShuffle(MVT::v8i16, DL, DAG.getBitcast(MVT::v8i16, V1),
9662 DAG.getUNDEF(MVT::v8i16), PostDupI16Shuffle));
9664 if (SDValue V = tryToWidenViaDuplication())
9668 if (SDValue Masked =
9669 lowerVectorShuffleAsBitMask(DL, MVT::v16i8, V1, V2, Mask, DAG))
9672 // Use dedicated unpack instructions for masks that match their pattern.
9674 lowerVectorShuffleWithUNPCK(DL, MVT::v16i8, Mask, V1, V2, DAG))
9677 // Check for SSSE3 which lets us lower all v16i8 shuffles much more directly
9678 // with PSHUFB. It is important to do this before we attempt to generate any
9679 // blends but after all of the single-input lowerings. If the single input
9680 // lowerings can find an instruction sequence that is faster than a PSHUFB, we
9681 // want to preserve that and we can DAG combine any longer sequences into
9682 // a PSHUFB in the end. But once we start blending from multiple inputs,
9683 // the complexity of DAG combining bad patterns back into PSHUFB is too high,
9684 // and there are *very* few patterns that would actually be faster than the
9685 // PSHUFB approach because of its ability to zero lanes.
9687 // FIXME: The only exceptions to the above are blends which are exact
9688 // interleavings with direct instructions supporting them. We currently don't
9689 // handle those well here.
9690 if (Subtarget->hasSSSE3()) {
9691 bool V1InUse = false;
9692 bool V2InUse = false;
9694 SDValue PSHUFB = lowerVectorShuffleAsPSHUFB(DL, MVT::v16i8, V1, V2, Mask,
9695 DAG, V1InUse, V2InUse);
9697 // If both V1 and V2 are in use and we can use a direct blend or an unpack,
9698 // do so. This avoids using them to handle blends-with-zero which is
9699 // important as a single pshufb is significantly faster for that.
9700 if (V1InUse && V2InUse) {
9701 if (Subtarget->hasSSE41())
9702 if (SDValue Blend = lowerVectorShuffleAsBlend(DL, MVT::v16i8, V1, V2,
9703 Mask, Subtarget, DAG))
9706 // We can use an unpack to do the blending rather than an or in some
9707 // cases. Even though the or may be (very minorly) more efficient, we
9708 // preference this lowering because there are common cases where part of
9709 // the complexity of the shuffles goes away when we do the final blend as
9711 // FIXME: It might be worth trying to detect if the unpack-feeding
9712 // shuffles will both be pshufb, in which case we shouldn't bother with
9714 if (SDValue Unpack = lowerVectorShuffleAsPermuteAndUnpack(
9715 DL, MVT::v16i8, V1, V2, Mask, DAG))
9722 // There are special ways we can lower some single-element blends.
9723 if (NumV2Elements == 1)
9724 if (SDValue V = lowerVectorShuffleAsElementInsertion(DL, MVT::v16i8, V1, V2,
9725 Mask, Subtarget, DAG))
9728 if (SDValue BitBlend =
9729 lowerVectorShuffleAsBitBlend(DL, MVT::v16i8, V1, V2, Mask, DAG))
9732 // Check whether a compaction lowering can be done. This handles shuffles
9733 // which take every Nth element for some even N. See the helper function for
9736 // We special case these as they can be particularly efficiently handled with
9737 // the PACKUSB instruction on x86 and they show up in common patterns of
9738 // rearranging bytes to truncate wide elements.
9739 if (int NumEvenDrops = canLowerByDroppingEvenElements(Mask)) {
9740 // NumEvenDrops is the power of two stride of the elements. Another way of
9741 // thinking about it is that we need to drop the even elements this many
9742 // times to get the original input.
9743 bool IsSingleInput = isSingleInputShuffleMask(Mask);
9745 // First we need to zero all the dropped bytes.
9746 assert(NumEvenDrops <= 3 &&
9747 "No support for dropping even elements more than 3 times.");
9748 // We use the mask type to pick which bytes are preserved based on how many
9749 // elements are dropped.
9750 MVT MaskVTs[] = { MVT::v8i16, MVT::v4i32, MVT::v2i64 };
9751 SDValue ByteClearMask = DAG.getBitcast(
9752 MVT::v16i8, DAG.getConstant(0xFF, DL, MaskVTs[NumEvenDrops - 1]));
9753 V1 = DAG.getNode(ISD::AND, DL, MVT::v16i8, V1, ByteClearMask);
9755 V2 = DAG.getNode(ISD::AND, DL, MVT::v16i8, V2, ByteClearMask);
9757 // Now pack things back together.
9758 V1 = DAG.getBitcast(MVT::v8i16, V1);
9759 V2 = IsSingleInput ? V1 : DAG.getBitcast(MVT::v8i16, V2);
9760 SDValue Result = DAG.getNode(X86ISD::PACKUS, DL, MVT::v16i8, V1, V2);
9761 for (int i = 1; i < NumEvenDrops; ++i) {
9762 Result = DAG.getBitcast(MVT::v8i16, Result);
9763 Result = DAG.getNode(X86ISD::PACKUS, DL, MVT::v16i8, Result, Result);
9769 // Handle multi-input cases by blending single-input shuffles.
9770 if (NumV2Elements > 0)
9771 return lowerVectorShuffleAsDecomposedShuffleBlend(DL, MVT::v16i8, V1, V2,
9774 // The fallback path for single-input shuffles widens this into two v8i16
9775 // vectors with unpacks, shuffles those, and then pulls them back together
9779 int LoBlendMask[8] = {-1, -1, -1, -1, -1, -1, -1, -1};
9780 int HiBlendMask[8] = {-1, -1, -1, -1, -1, -1, -1, -1};
9781 for (int i = 0; i < 16; ++i)
9783 (i < 8 ? LoBlendMask[i] : HiBlendMask[i % 8]) = Mask[i];
9785 SDValue Zero = getZeroVector(MVT::v8i16, Subtarget, DAG, DL);
9787 SDValue VLoHalf, VHiHalf;
9788 // Check if any of the odd lanes in the v16i8 are used. If not, we can mask
9789 // them out and avoid using UNPCK{L,H} to extract the elements of V as
9791 if (std::none_of(std::begin(LoBlendMask), std::end(LoBlendMask),
9792 [](int M) { return M >= 0 && M % 2 == 1; }) &&
9793 std::none_of(std::begin(HiBlendMask), std::end(HiBlendMask),
9794 [](int M) { return M >= 0 && M % 2 == 1; })) {
9795 // Use a mask to drop the high bytes.
9796 VLoHalf = DAG.getBitcast(MVT::v8i16, V);
9797 VLoHalf = DAG.getNode(ISD::AND, DL, MVT::v8i16, VLoHalf,
9798 DAG.getConstant(0x00FF, DL, MVT::v8i16));
9800 // This will be a single vector shuffle instead of a blend so nuke VHiHalf.
9801 VHiHalf = DAG.getUNDEF(MVT::v8i16);
9803 // Squash the masks to point directly into VLoHalf.
9804 for (int &M : LoBlendMask)
9807 for (int &M : HiBlendMask)
9811 // Otherwise just unpack the low half of V into VLoHalf and the high half into
9812 // VHiHalf so that we can blend them as i16s.
9813 VLoHalf = DAG.getBitcast(
9814 MVT::v8i16, DAG.getNode(X86ISD::UNPCKL, DL, MVT::v16i8, V, Zero));
9815 VHiHalf = DAG.getBitcast(
9816 MVT::v8i16, DAG.getNode(X86ISD::UNPCKH, DL, MVT::v16i8, V, Zero));
9819 SDValue LoV = DAG.getVectorShuffle(MVT::v8i16, DL, VLoHalf, VHiHalf, LoBlendMask);
9820 SDValue HiV = DAG.getVectorShuffle(MVT::v8i16, DL, VLoHalf, VHiHalf, HiBlendMask);
9822 return DAG.getNode(X86ISD::PACKUS, DL, MVT::v16i8, LoV, HiV);
9825 /// \brief Dispatching routine to lower various 128-bit x86 vector shuffles.
9827 /// This routine breaks down the specific type of 128-bit shuffle and
9828 /// dispatches to the lowering routines accordingly.
9829 static SDValue lower128BitVectorShuffle(SDValue Op, SDValue V1, SDValue V2,
9830 MVT VT, const X86Subtarget *Subtarget,
9831 SelectionDAG &DAG) {
9832 switch (VT.SimpleTy) {
9834 return lowerV2I64VectorShuffle(Op, V1, V2, Subtarget, DAG);
9836 return lowerV2F64VectorShuffle(Op, V1, V2, Subtarget, DAG);
9838 return lowerV4I32VectorShuffle(Op, V1, V2, Subtarget, DAG);
9840 return lowerV4F32VectorShuffle(Op, V1, V2, Subtarget, DAG);
9842 return lowerV8I16VectorShuffle(Op, V1, V2, Subtarget, DAG);
9844 return lowerV16I8VectorShuffle(Op, V1, V2, Subtarget, DAG);
9847 llvm_unreachable("Unimplemented!");
9851 /// \brief Helper function to test whether a shuffle mask could be
9852 /// simplified by widening the elements being shuffled.
9854 /// Appends the mask for wider elements in WidenedMask if valid. Otherwise
9855 /// leaves it in an unspecified state.
9857 /// NOTE: This must handle normal vector shuffle masks and *target* vector
9858 /// shuffle masks. The latter have the special property of a '-2' representing
9859 /// a zero-ed lane of a vector.
9860 static bool canWidenShuffleElements(ArrayRef<int> Mask,
9861 SmallVectorImpl<int> &WidenedMask) {
9862 for (int i = 0, Size = Mask.size(); i < Size; i += 2) {
9863 // If both elements are undef, its trivial.
9864 if (Mask[i] == SM_SentinelUndef && Mask[i + 1] == SM_SentinelUndef) {
9865 WidenedMask.push_back(SM_SentinelUndef);
9869 // Check for an undef mask and a mask value properly aligned to fit with
9870 // a pair of values. If we find such a case, use the non-undef mask's value.
9871 if (Mask[i] == SM_SentinelUndef && Mask[i + 1] >= 0 && Mask[i + 1] % 2 == 1) {
9872 WidenedMask.push_back(Mask[i + 1] / 2);
9875 if (Mask[i + 1] == SM_SentinelUndef && Mask[i] >= 0 && Mask[i] % 2 == 0) {
9876 WidenedMask.push_back(Mask[i] / 2);
9880 // When zeroing, we need to spread the zeroing across both lanes to widen.
9881 if (Mask[i] == SM_SentinelZero || Mask[i + 1] == SM_SentinelZero) {
9882 if ((Mask[i] == SM_SentinelZero || Mask[i] == SM_SentinelUndef) &&
9883 (Mask[i + 1] == SM_SentinelZero || Mask[i + 1] == SM_SentinelUndef)) {
9884 WidenedMask.push_back(SM_SentinelZero);
9890 // Finally check if the two mask values are adjacent and aligned with
9892 if (Mask[i] != SM_SentinelUndef && Mask[i] % 2 == 0 && Mask[i] + 1 == Mask[i + 1]) {
9893 WidenedMask.push_back(Mask[i] / 2);
9897 // Otherwise we can't safely widen the elements used in this shuffle.
9900 assert(WidenedMask.size() == Mask.size() / 2 &&
9901 "Incorrect size of mask after widening the elements!");
9906 /// \brief Generic routine to split vector shuffle into half-sized shuffles.
9908 /// This routine just extracts two subvectors, shuffles them independently, and
9909 /// then concatenates them back together. This should work effectively with all
9910 /// AVX vector shuffle types.
9911 static SDValue splitAndLowerVectorShuffle(SDLoc DL, MVT VT, SDValue V1,
9912 SDValue V2, ArrayRef<int> Mask,
9913 SelectionDAG &DAG) {
9914 assert(VT.getSizeInBits() >= 256 &&
9915 "Only for 256-bit or wider vector shuffles!");
9916 assert(V1.getSimpleValueType() == VT && "Bad operand type!");
9917 assert(V2.getSimpleValueType() == VT && "Bad operand type!");
9919 ArrayRef<int> LoMask = Mask.slice(0, Mask.size() / 2);
9920 ArrayRef<int> HiMask = Mask.slice(Mask.size() / 2);
9922 int NumElements = VT.getVectorNumElements();
9923 int SplitNumElements = NumElements / 2;
9924 MVT ScalarVT = VT.getVectorElementType();
9925 MVT SplitVT = MVT::getVectorVT(ScalarVT, NumElements / 2);
9927 // Rather than splitting build-vectors, just build two narrower build
9928 // vectors. This helps shuffling with splats and zeros.
9929 auto SplitVector = [&](SDValue V) {
9930 while (V.getOpcode() == ISD::BITCAST)
9931 V = V->getOperand(0);
9933 MVT OrigVT = V.getSimpleValueType();
9934 int OrigNumElements = OrigVT.getVectorNumElements();
9935 int OrigSplitNumElements = OrigNumElements / 2;
9936 MVT OrigScalarVT = OrigVT.getVectorElementType();
9937 MVT OrigSplitVT = MVT::getVectorVT(OrigScalarVT, OrigNumElements / 2);
9941 auto *BV = dyn_cast<BuildVectorSDNode>(V);
9943 LoV = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, OrigSplitVT, V,
9944 DAG.getIntPtrConstant(0, DL));
9945 HiV = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, OrigSplitVT, V,
9946 DAG.getIntPtrConstant(OrigSplitNumElements, DL));
9949 SmallVector<SDValue, 16> LoOps, HiOps;
9950 for (int i = 0; i < OrigSplitNumElements; ++i) {
9951 LoOps.push_back(BV->getOperand(i));
9952 HiOps.push_back(BV->getOperand(i + OrigSplitNumElements));
9954 LoV = DAG.getNode(ISD::BUILD_VECTOR, DL, OrigSplitVT, LoOps);
9955 HiV = DAG.getNode(ISD::BUILD_VECTOR, DL, OrigSplitVT, HiOps);
9957 return std::make_pair(DAG.getBitcast(SplitVT, LoV),
9958 DAG.getBitcast(SplitVT, HiV));
9961 SDValue LoV1, HiV1, LoV2, HiV2;
9962 std::tie(LoV1, HiV1) = SplitVector(V1);
9963 std::tie(LoV2, HiV2) = SplitVector(V2);
9965 // Now create two 4-way blends of these half-width vectors.
9966 auto HalfBlend = [&](ArrayRef<int> HalfMask) {
9967 bool UseLoV1 = false, UseHiV1 = false, UseLoV2 = false, UseHiV2 = false;
9968 SmallVector<int, 32> V1BlendMask, V2BlendMask, BlendMask;
9969 for (int i = 0; i < SplitNumElements; ++i) {
9970 int M = HalfMask[i];
9971 if (M >= NumElements) {
9972 if (M >= NumElements + SplitNumElements)
9976 V2BlendMask.push_back(M - NumElements);
9977 V1BlendMask.push_back(-1);
9978 BlendMask.push_back(SplitNumElements + i);
9979 } else if (M >= 0) {
9980 if (M >= SplitNumElements)
9984 V2BlendMask.push_back(-1);
9985 V1BlendMask.push_back(M);
9986 BlendMask.push_back(i);
9988 V2BlendMask.push_back(-1);
9989 V1BlendMask.push_back(-1);
9990 BlendMask.push_back(-1);
9994 // Because the lowering happens after all combining takes place, we need to
9995 // manually combine these blend masks as much as possible so that we create
9996 // a minimal number of high-level vector shuffle nodes.
9998 // First try just blending the halves of V1 or V2.
9999 if (!UseLoV1 && !UseHiV1 && !UseLoV2 && !UseHiV2)
10000 return DAG.getUNDEF(SplitVT);
10001 if (!UseLoV2 && !UseHiV2)
10002 return DAG.getVectorShuffle(SplitVT, DL, LoV1, HiV1, V1BlendMask);
10003 if (!UseLoV1 && !UseHiV1)
10004 return DAG.getVectorShuffle(SplitVT, DL, LoV2, HiV2, V2BlendMask);
10006 SDValue V1Blend, V2Blend;
10007 if (UseLoV1 && UseHiV1) {
10009 DAG.getVectorShuffle(SplitVT, DL, LoV1, HiV1, V1BlendMask);
10011 // We only use half of V1 so map the usage down into the final blend mask.
10012 V1Blend = UseLoV1 ? LoV1 : HiV1;
10013 for (int i = 0; i < SplitNumElements; ++i)
10014 if (BlendMask[i] >= 0 && BlendMask[i] < SplitNumElements)
10015 BlendMask[i] = V1BlendMask[i] - (UseLoV1 ? 0 : SplitNumElements);
10017 if (UseLoV2 && UseHiV2) {
10019 DAG.getVectorShuffle(SplitVT, DL, LoV2, HiV2, V2BlendMask);
10021 // We only use half of V2 so map the usage down into the final blend mask.
10022 V2Blend = UseLoV2 ? LoV2 : HiV2;
10023 for (int i = 0; i < SplitNumElements; ++i)
10024 if (BlendMask[i] >= SplitNumElements)
10025 BlendMask[i] = V2BlendMask[i] + (UseLoV2 ? SplitNumElements : 0);
10027 return DAG.getVectorShuffle(SplitVT, DL, V1Blend, V2Blend, BlendMask);
10029 SDValue Lo = HalfBlend(LoMask);
10030 SDValue Hi = HalfBlend(HiMask);
10031 return DAG.getNode(ISD::CONCAT_VECTORS, DL, VT, Lo, Hi);
10034 /// \brief Either split a vector in halves or decompose the shuffles and the
10037 /// This is provided as a good fallback for many lowerings of non-single-input
10038 /// shuffles with more than one 128-bit lane. In those cases, we want to select
10039 /// between splitting the shuffle into 128-bit components and stitching those
10040 /// back together vs. extracting the single-input shuffles and blending those
10042 static SDValue lowerVectorShuffleAsSplitOrBlend(SDLoc DL, MVT VT, SDValue V1,
10043 SDValue V2, ArrayRef<int> Mask,
10044 SelectionDAG &DAG) {
10045 assert(!isSingleInputShuffleMask(Mask) && "This routine must not be used to "
10046 "lower single-input shuffles as it "
10047 "could then recurse on itself.");
10048 int Size = Mask.size();
10050 // If this can be modeled as a broadcast of two elements followed by a blend,
10051 // prefer that lowering. This is especially important because broadcasts can
10052 // often fold with memory operands.
10053 auto DoBothBroadcast = [&] {
10054 int V1BroadcastIdx = -1, V2BroadcastIdx = -1;
10057 if (V2BroadcastIdx == -1)
10058 V2BroadcastIdx = M - Size;
10059 else if (M - Size != V2BroadcastIdx)
10061 } else if (M >= 0) {
10062 if (V1BroadcastIdx == -1)
10063 V1BroadcastIdx = M;
10064 else if (M != V1BroadcastIdx)
10069 if (DoBothBroadcast())
10070 return lowerVectorShuffleAsDecomposedShuffleBlend(DL, VT, V1, V2, Mask,
10073 // If the inputs all stem from a single 128-bit lane of each input, then we
10074 // split them rather than blending because the split will decompose to
10075 // unusually few instructions.
10076 int LaneCount = VT.getSizeInBits() / 128;
10077 int LaneSize = Size / LaneCount;
10078 SmallBitVector LaneInputs[2];
10079 LaneInputs[0].resize(LaneCount, false);
10080 LaneInputs[1].resize(LaneCount, false);
10081 for (int i = 0; i < Size; ++i)
10083 LaneInputs[Mask[i] / Size][(Mask[i] % Size) / LaneSize] = true;
10084 if (LaneInputs[0].count() <= 1 && LaneInputs[1].count() <= 1)
10085 return splitAndLowerVectorShuffle(DL, VT, V1, V2, Mask, DAG);
10087 // Otherwise, just fall back to decomposed shuffles and a blend. This requires
10088 // that the decomposed single-input shuffles don't end up here.
10089 return lowerVectorShuffleAsDecomposedShuffleBlend(DL, VT, V1, V2, Mask, DAG);
10092 /// \brief Lower a vector shuffle crossing multiple 128-bit lanes as
10093 /// a permutation and blend of those lanes.
10095 /// This essentially blends the out-of-lane inputs to each lane into the lane
10096 /// from a permuted copy of the vector. This lowering strategy results in four
10097 /// instructions in the worst case for a single-input cross lane shuffle which
10098 /// is lower than any other fully general cross-lane shuffle strategy I'm aware
10099 /// of. Special cases for each particular shuffle pattern should be handled
10100 /// prior to trying this lowering.
10101 static SDValue lowerVectorShuffleAsLanePermuteAndBlend(SDLoc DL, MVT VT,
10102 SDValue V1, SDValue V2,
10103 ArrayRef<int> Mask,
10104 SelectionDAG &DAG) {
10105 // FIXME: This should probably be generalized for 512-bit vectors as well.
10106 assert(VT.is256BitVector() && "Only for 256-bit vector shuffles!");
10107 int LaneSize = Mask.size() / 2;
10109 // If there are only inputs from one 128-bit lane, splitting will in fact be
10110 // less expensive. The flags track whether the given lane contains an element
10111 // that crosses to another lane.
10112 bool LaneCrossing[2] = {false, false};
10113 for (int i = 0, Size = Mask.size(); i < Size; ++i)
10114 if (Mask[i] >= 0 && (Mask[i] % Size) / LaneSize != i / LaneSize)
10115 LaneCrossing[(Mask[i] % Size) / LaneSize] = true;
10116 if (!LaneCrossing[0] || !LaneCrossing[1])
10117 return splitAndLowerVectorShuffle(DL, VT, V1, V2, Mask, DAG);
10119 if (isSingleInputShuffleMask(Mask)) {
10120 SmallVector<int, 32> FlippedBlendMask;
10121 for (int i = 0, Size = Mask.size(); i < Size; ++i)
10122 FlippedBlendMask.push_back(
10123 Mask[i] < 0 ? -1 : (((Mask[i] % Size) / LaneSize == i / LaneSize)
10125 : Mask[i] % LaneSize +
10126 (i / LaneSize) * LaneSize + Size));
10128 // Flip the vector, and blend the results which should now be in-lane. The
10129 // VPERM2X128 mask uses the low 2 bits for the low source and bits 4 and
10130 // 5 for the high source. The value 3 selects the high half of source 2 and
10131 // the value 2 selects the low half of source 2. We only use source 2 to
10132 // allow folding it into a memory operand.
10133 unsigned PERMMask = 3 | 2 << 4;
10134 SDValue Flipped = DAG.getNode(X86ISD::VPERM2X128, DL, VT, DAG.getUNDEF(VT),
10135 V1, DAG.getConstant(PERMMask, DL, MVT::i8));
10136 return DAG.getVectorShuffle(VT, DL, V1, Flipped, FlippedBlendMask);
10139 // This now reduces to two single-input shuffles of V1 and V2 which at worst
10140 // will be handled by the above logic and a blend of the results, much like
10141 // other patterns in AVX.
10142 return lowerVectorShuffleAsDecomposedShuffleBlend(DL, VT, V1, V2, Mask, DAG);
10145 /// \brief Handle lowering 2-lane 128-bit shuffles.
10146 static SDValue lowerV2X128VectorShuffle(SDLoc DL, MVT VT, SDValue V1,
10147 SDValue V2, ArrayRef<int> Mask,
10148 const X86Subtarget *Subtarget,
10149 SelectionDAG &DAG) {
10150 // TODO: If minimizing size and one of the inputs is a zero vector and the
10151 // the zero vector has only one use, we could use a VPERM2X128 to save the
10152 // instruction bytes needed to explicitly generate the zero vector.
10154 // Blends are faster and handle all the non-lane-crossing cases.
10155 if (SDValue Blend = lowerVectorShuffleAsBlend(DL, VT, V1, V2, Mask,
10159 bool IsV1Zero = ISD::isBuildVectorAllZeros(V1.getNode());
10160 bool IsV2Zero = ISD::isBuildVectorAllZeros(V2.getNode());
10162 // If either input operand is a zero vector, use VPERM2X128 because its mask
10163 // allows us to replace the zero input with an implicit zero.
10164 if (!IsV1Zero && !IsV2Zero) {
10165 // Check for patterns which can be matched with a single insert of a 128-bit
10167 bool OnlyUsesV1 = isShuffleEquivalent(V1, V2, Mask, {0, 1, 0, 1});
10168 if (OnlyUsesV1 || isShuffleEquivalent(V1, V2, Mask, {0, 1, 4, 5})) {
10169 MVT SubVT = MVT::getVectorVT(VT.getVectorElementType(),
10170 VT.getVectorNumElements() / 2);
10171 SDValue LoV = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, SubVT, V1,
10172 DAG.getIntPtrConstant(0, DL));
10173 SDValue HiV = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, SubVT,
10174 OnlyUsesV1 ? V1 : V2,
10175 DAG.getIntPtrConstant(0, DL));
10176 return DAG.getNode(ISD::CONCAT_VECTORS, DL, VT, LoV, HiV);
10180 // Otherwise form a 128-bit permutation. After accounting for undefs,
10181 // convert the 64-bit shuffle mask selection values into 128-bit
10182 // selection bits by dividing the indexes by 2 and shifting into positions
10183 // defined by a vperm2*128 instruction's immediate control byte.
10185 // The immediate permute control byte looks like this:
10186 // [1:0] - select 128 bits from sources for low half of destination
10188 // [3] - zero low half of destination
10189 // [5:4] - select 128 bits from sources for high half of destination
10191 // [7] - zero high half of destination
10193 int MaskLO = Mask[0];
10194 if (MaskLO == SM_SentinelUndef)
10195 MaskLO = Mask[1] == SM_SentinelUndef ? 0 : Mask[1];
10197 int MaskHI = Mask[2];
10198 if (MaskHI == SM_SentinelUndef)
10199 MaskHI = Mask[3] == SM_SentinelUndef ? 0 : Mask[3];
10201 unsigned PermMask = MaskLO / 2 | (MaskHI / 2) << 4;
10203 // If either input is a zero vector, replace it with an undef input.
10204 // Shuffle mask values < 4 are selecting elements of V1.
10205 // Shuffle mask values >= 4 are selecting elements of V2.
10206 // Adjust each half of the permute mask by clearing the half that was
10207 // selecting the zero vector and setting the zero mask bit.
10209 V1 = DAG.getUNDEF(VT);
10211 PermMask = (PermMask & 0xf0) | 0x08;
10213 PermMask = (PermMask & 0x0f) | 0x80;
10216 V2 = DAG.getUNDEF(VT);
10218 PermMask = (PermMask & 0xf0) | 0x08;
10220 PermMask = (PermMask & 0x0f) | 0x80;
10223 return DAG.getNode(X86ISD::VPERM2X128, DL, VT, V1, V2,
10224 DAG.getConstant(PermMask, DL, MVT::i8));
10227 /// \brief Lower a vector shuffle by first fixing the 128-bit lanes and then
10228 /// shuffling each lane.
10230 /// This will only succeed when the result of fixing the 128-bit lanes results
10231 /// in a single-input non-lane-crossing shuffle with a repeating shuffle mask in
10232 /// each 128-bit lanes. This handles many cases where we can quickly blend away
10233 /// the lane crosses early and then use simpler shuffles within each lane.
10235 /// FIXME: It might be worthwhile at some point to support this without
10236 /// requiring the 128-bit lane-relative shuffles to be repeating, but currently
10237 /// in x86 only floating point has interesting non-repeating shuffles, and even
10238 /// those are still *marginally* more expensive.
10239 static SDValue lowerVectorShuffleByMerging128BitLanes(
10240 SDLoc DL, MVT VT, SDValue V1, SDValue V2, ArrayRef<int> Mask,
10241 const X86Subtarget *Subtarget, SelectionDAG &DAG) {
10242 assert(!isSingleInputShuffleMask(Mask) &&
10243 "This is only useful with multiple inputs.");
10245 int Size = Mask.size();
10246 int LaneSize = 128 / VT.getScalarSizeInBits();
10247 int NumLanes = Size / LaneSize;
10248 assert(NumLanes > 1 && "Only handles 256-bit and wider shuffles.");
10250 // See if we can build a hypothetical 128-bit lane-fixing shuffle mask. Also
10251 // check whether the in-128-bit lane shuffles share a repeating pattern.
10252 SmallVector<int, 4> Lanes;
10253 Lanes.resize(NumLanes, -1);
10254 SmallVector<int, 4> InLaneMask;
10255 InLaneMask.resize(LaneSize, -1);
10256 for (int i = 0; i < Size; ++i) {
10260 int j = i / LaneSize;
10262 if (Lanes[j] < 0) {
10263 // First entry we've seen for this lane.
10264 Lanes[j] = Mask[i] / LaneSize;
10265 } else if (Lanes[j] != Mask[i] / LaneSize) {
10266 // This doesn't match the lane selected previously!
10270 // Check that within each lane we have a consistent shuffle mask.
10271 int k = i % LaneSize;
10272 if (InLaneMask[k] < 0) {
10273 InLaneMask[k] = Mask[i] % LaneSize;
10274 } else if (InLaneMask[k] != Mask[i] % LaneSize) {
10275 // This doesn't fit a repeating in-lane mask.
10280 // First shuffle the lanes into place.
10281 MVT LaneVT = MVT::getVectorVT(VT.isFloatingPoint() ? MVT::f64 : MVT::i64,
10282 VT.getSizeInBits() / 64);
10283 SmallVector<int, 8> LaneMask;
10284 LaneMask.resize(NumLanes * 2, -1);
10285 for (int i = 0; i < NumLanes; ++i)
10286 if (Lanes[i] >= 0) {
10287 LaneMask[2 * i + 0] = 2*Lanes[i] + 0;
10288 LaneMask[2 * i + 1] = 2*Lanes[i] + 1;
10291 V1 = DAG.getBitcast(LaneVT, V1);
10292 V2 = DAG.getBitcast(LaneVT, V2);
10293 SDValue LaneShuffle = DAG.getVectorShuffle(LaneVT, DL, V1, V2, LaneMask);
10295 // Cast it back to the type we actually want.
10296 LaneShuffle = DAG.getBitcast(VT, LaneShuffle);
10298 // Now do a simple shuffle that isn't lane crossing.
10299 SmallVector<int, 8> NewMask;
10300 NewMask.resize(Size, -1);
10301 for (int i = 0; i < Size; ++i)
10303 NewMask[i] = (i / LaneSize) * LaneSize + Mask[i] % LaneSize;
10304 assert(!is128BitLaneCrossingShuffleMask(VT, NewMask) &&
10305 "Must not introduce lane crosses at this point!");
10307 return DAG.getVectorShuffle(VT, DL, LaneShuffle, DAG.getUNDEF(VT), NewMask);
10310 /// \brief Test whether the specified input (0 or 1) is in-place blended by the
10313 /// This returns true if the elements from a particular input are already in the
10314 /// slot required by the given mask and require no permutation.
10315 static bool isShuffleMaskInputInPlace(int Input, ArrayRef<int> Mask) {
10316 assert((Input == 0 || Input == 1) && "Only two inputs to shuffles.");
10317 int Size = Mask.size();
10318 for (int i = 0; i < Size; ++i)
10319 if (Mask[i] >= 0 && Mask[i] / Size == Input && Mask[i] % Size != i)
10325 static SDValue lowerVectorShuffleWithSHUFPD(SDLoc DL, MVT VT,
10326 ArrayRef<int> Mask, SDValue V1,
10327 SDValue V2, SelectionDAG &DAG) {
10329 // Mask for V8F64: 0/1, 8/9, 2/3, 10/11, 4/5, ..
10330 // Mask for V4F64; 0/1, 4/5, 2/3, 6/7..
10331 assert(VT.getScalarSizeInBits() == 64 && "Unexpected data type for VSHUFPD");
10332 int NumElts = VT.getVectorNumElements();
10333 bool ShufpdMask = true;
10334 bool CommutableMask = true;
10335 unsigned Immediate = 0;
10336 for (int i = 0; i < NumElts; ++i) {
10339 int Val = (i & 6) + NumElts * (i & 1);
10340 int CommutVal = (i & 0xe) + NumElts * ((i & 1)^1);
10341 if (Mask[i] < Val || Mask[i] > Val + 1)
10342 ShufpdMask = false;
10343 if (Mask[i] < CommutVal || Mask[i] > CommutVal + 1)
10344 CommutableMask = false;
10345 Immediate |= (Mask[i] % 2) << i;
10348 return DAG.getNode(X86ISD::SHUFP, DL, VT, V1, V2,
10349 DAG.getConstant(Immediate, DL, MVT::i8));
10350 if (CommutableMask)
10351 return DAG.getNode(X86ISD::SHUFP, DL, VT, V2, V1,
10352 DAG.getConstant(Immediate, DL, MVT::i8));
10356 /// \brief Handle lowering of 4-lane 64-bit floating point shuffles.
10358 /// Also ends up handling lowering of 4-lane 64-bit integer shuffles when AVX2
10359 /// isn't available.
10360 static SDValue lowerV4F64VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
10361 const X86Subtarget *Subtarget,
10362 SelectionDAG &DAG) {
10364 assert(V1.getSimpleValueType() == MVT::v4f64 && "Bad operand type!");
10365 assert(V2.getSimpleValueType() == MVT::v4f64 && "Bad operand type!");
10366 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
10367 ArrayRef<int> Mask = SVOp->getMask();
10368 assert(Mask.size() == 4 && "Unexpected mask size for v4 shuffle!");
10370 SmallVector<int, 4> WidenedMask;
10371 if (canWidenShuffleElements(Mask, WidenedMask))
10372 return lowerV2X128VectorShuffle(DL, MVT::v4f64, V1, V2, Mask, Subtarget,
10375 if (isSingleInputShuffleMask(Mask)) {
10376 // Check for being able to broadcast a single element.
10377 if (SDValue Broadcast = lowerVectorShuffleAsBroadcast(DL, MVT::v4f64, V1,
10378 Mask, Subtarget, DAG))
10381 // Use low duplicate instructions for masks that match their pattern.
10382 if (isShuffleEquivalent(V1, V2, Mask, {0, 0, 2, 2}))
10383 return DAG.getNode(X86ISD::MOVDDUP, DL, MVT::v4f64, V1);
10385 if (!is128BitLaneCrossingShuffleMask(MVT::v4f64, Mask)) {
10386 // Non-half-crossing single input shuffles can be lowerid with an
10387 // interleaved permutation.
10388 unsigned VPERMILPMask = (Mask[0] == 1) | ((Mask[1] == 1) << 1) |
10389 ((Mask[2] == 3) << 2) | ((Mask[3] == 3) << 3);
10390 return DAG.getNode(X86ISD::VPERMILPI, DL, MVT::v4f64, V1,
10391 DAG.getConstant(VPERMILPMask, DL, MVT::i8));
10394 // With AVX2 we have direct support for this permutation.
10395 if (Subtarget->hasAVX2())
10396 return DAG.getNode(X86ISD::VPERMI, DL, MVT::v4f64, V1,
10397 getV4X86ShuffleImm8ForMask(Mask, DL, DAG));
10399 // Otherwise, fall back.
10400 return lowerVectorShuffleAsLanePermuteAndBlend(DL, MVT::v4f64, V1, V2, Mask,
10404 // Use dedicated unpack instructions for masks that match their pattern.
10406 lowerVectorShuffleWithUNPCK(DL, MVT::v4f64, Mask, V1, V2, DAG))
10409 if (SDValue Blend = lowerVectorShuffleAsBlend(DL, MVT::v4f64, V1, V2, Mask,
10413 // Check if the blend happens to exactly fit that of SHUFPD.
10415 lowerVectorShuffleWithSHUFPD(DL, MVT::v4f64, Mask, V1, V2, DAG))
10418 // Try to simplify this by merging 128-bit lanes to enable a lane-based
10419 // shuffle. However, if we have AVX2 and either inputs are already in place,
10420 // we will be able to shuffle even across lanes the other input in a single
10421 // instruction so skip this pattern.
10422 if (!(Subtarget->hasAVX2() && (isShuffleMaskInputInPlace(0, Mask) ||
10423 isShuffleMaskInputInPlace(1, Mask))))
10424 if (SDValue Result = lowerVectorShuffleByMerging128BitLanes(
10425 DL, MVT::v4f64, V1, V2, Mask, Subtarget, DAG))
10428 // If we have AVX2 then we always want to lower with a blend because an v4 we
10429 // can fully permute the elements.
10430 if (Subtarget->hasAVX2())
10431 return lowerVectorShuffleAsDecomposedShuffleBlend(DL, MVT::v4f64, V1, V2,
10434 // Otherwise fall back on generic lowering.
10435 return lowerVectorShuffleAsSplitOrBlend(DL, MVT::v4f64, V1, V2, Mask, DAG);
10438 /// \brief Handle lowering of 4-lane 64-bit integer shuffles.
10440 /// This routine is only called when we have AVX2 and thus a reasonable
10441 /// instruction set for v4i64 shuffling..
10442 static SDValue lowerV4I64VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
10443 const X86Subtarget *Subtarget,
10444 SelectionDAG &DAG) {
10446 assert(V1.getSimpleValueType() == MVT::v4i64 && "Bad operand type!");
10447 assert(V2.getSimpleValueType() == MVT::v4i64 && "Bad operand type!");
10448 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
10449 ArrayRef<int> Mask = SVOp->getMask();
10450 assert(Mask.size() == 4 && "Unexpected mask size for v4 shuffle!");
10451 assert(Subtarget->hasAVX2() && "We can only lower v4i64 with AVX2!");
10453 SmallVector<int, 4> WidenedMask;
10454 if (canWidenShuffleElements(Mask, WidenedMask))
10455 return lowerV2X128VectorShuffle(DL, MVT::v4i64, V1, V2, Mask, Subtarget,
10458 if (SDValue Blend = lowerVectorShuffleAsBlend(DL, MVT::v4i64, V1, V2, Mask,
10462 // Check for being able to broadcast a single element.
10463 if (SDValue Broadcast = lowerVectorShuffleAsBroadcast(DL, MVT::v4i64, V1,
10464 Mask, Subtarget, DAG))
10467 // When the shuffle is mirrored between the 128-bit lanes of the unit, we can
10468 // use lower latency instructions that will operate on both 128-bit lanes.
10469 SmallVector<int, 2> RepeatedMask;
10470 if (is128BitLaneRepeatedShuffleMask(MVT::v4i64, Mask, RepeatedMask)) {
10471 if (isSingleInputShuffleMask(Mask)) {
10472 int PSHUFDMask[] = {-1, -1, -1, -1};
10473 for (int i = 0; i < 2; ++i)
10474 if (RepeatedMask[i] >= 0) {
10475 PSHUFDMask[2 * i] = 2 * RepeatedMask[i];
10476 PSHUFDMask[2 * i + 1] = 2 * RepeatedMask[i] + 1;
10478 return DAG.getBitcast(
10480 DAG.getNode(X86ISD::PSHUFD, DL, MVT::v8i32,
10481 DAG.getBitcast(MVT::v8i32, V1),
10482 getV4X86ShuffleImm8ForMask(PSHUFDMask, DL, DAG)));
10486 // AVX2 provides a direct instruction for permuting a single input across
10488 if (isSingleInputShuffleMask(Mask))
10489 return DAG.getNode(X86ISD::VPERMI, DL, MVT::v4i64, V1,
10490 getV4X86ShuffleImm8ForMask(Mask, DL, DAG));
10492 // Try to use shift instructions.
10493 if (SDValue Shift =
10494 lowerVectorShuffleAsShift(DL, MVT::v4i64, V1, V2, Mask, DAG))
10497 // Use dedicated unpack instructions for masks that match their pattern.
10499 lowerVectorShuffleWithUNPCK(DL, MVT::v4i64, Mask, V1, V2, DAG))
10502 // Try to simplify this by merging 128-bit lanes to enable a lane-based
10503 // shuffle. However, if we have AVX2 and either inputs are already in place,
10504 // we will be able to shuffle even across lanes the other input in a single
10505 // instruction so skip this pattern.
10506 if (!(Subtarget->hasAVX2() && (isShuffleMaskInputInPlace(0, Mask) ||
10507 isShuffleMaskInputInPlace(1, Mask))))
10508 if (SDValue Result = lowerVectorShuffleByMerging128BitLanes(
10509 DL, MVT::v4i64, V1, V2, Mask, Subtarget, DAG))
10512 // Otherwise fall back on generic blend lowering.
10513 return lowerVectorShuffleAsDecomposedShuffleBlend(DL, MVT::v4i64, V1, V2,
10517 /// \brief Handle lowering of 8-lane 32-bit floating point shuffles.
10519 /// Also ends up handling lowering of 8-lane 32-bit integer shuffles when AVX2
10520 /// isn't available.
10521 static SDValue lowerV8F32VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
10522 const X86Subtarget *Subtarget,
10523 SelectionDAG &DAG) {
10525 assert(V1.getSimpleValueType() == MVT::v8f32 && "Bad operand type!");
10526 assert(V2.getSimpleValueType() == MVT::v8f32 && "Bad operand type!");
10527 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
10528 ArrayRef<int> Mask = SVOp->getMask();
10529 assert(Mask.size() == 8 && "Unexpected mask size for v8 shuffle!");
10531 if (SDValue Blend = lowerVectorShuffleAsBlend(DL, MVT::v8f32, V1, V2, Mask,
10535 // Check for being able to broadcast a single element.
10536 if (SDValue Broadcast = lowerVectorShuffleAsBroadcast(DL, MVT::v8f32, V1,
10537 Mask, Subtarget, DAG))
10540 // If the shuffle mask is repeated in each 128-bit lane, we have many more
10541 // options to efficiently lower the shuffle.
10542 SmallVector<int, 4> RepeatedMask;
10543 if (is128BitLaneRepeatedShuffleMask(MVT::v8f32, Mask, RepeatedMask)) {
10544 assert(RepeatedMask.size() == 4 &&
10545 "Repeated masks must be half the mask width!");
10547 // Use even/odd duplicate instructions for masks that match their pattern.
10548 if (isShuffleEquivalent(V1, V2, Mask, {0, 0, 2, 2, 4, 4, 6, 6}))
10549 return DAG.getNode(X86ISD::MOVSLDUP, DL, MVT::v8f32, V1);
10550 if (isShuffleEquivalent(V1, V2, Mask, {1, 1, 3, 3, 5, 5, 7, 7}))
10551 return DAG.getNode(X86ISD::MOVSHDUP, DL, MVT::v8f32, V1);
10553 if (isSingleInputShuffleMask(Mask))
10554 return DAG.getNode(X86ISD::VPERMILPI, DL, MVT::v8f32, V1,
10555 getV4X86ShuffleImm8ForMask(RepeatedMask, DL, DAG));
10557 // Use dedicated unpack instructions for masks that match their pattern.
10559 lowerVectorShuffleWithUNPCK(DL, MVT::v8f32, Mask, V1, V2, DAG))
10562 // Otherwise, fall back to a SHUFPS sequence. Here it is important that we
10563 // have already handled any direct blends. We also need to squash the
10564 // repeated mask into a simulated v4f32 mask.
10565 for (int i = 0; i < 4; ++i)
10566 if (RepeatedMask[i] >= 8)
10567 RepeatedMask[i] -= 4;
10568 return lowerVectorShuffleWithSHUFPS(DL, MVT::v8f32, RepeatedMask, V1, V2, DAG);
10571 // If we have a single input shuffle with different shuffle patterns in the
10572 // two 128-bit lanes use the variable mask to VPERMILPS.
10573 if (isSingleInputShuffleMask(Mask)) {
10574 SDValue VPermMask[8];
10575 for (int i = 0; i < 8; ++i)
10576 VPermMask[i] = Mask[i] < 0 ? DAG.getUNDEF(MVT::i32)
10577 : DAG.getConstant(Mask[i], DL, MVT::i32);
10578 if (!is128BitLaneCrossingShuffleMask(MVT::v8f32, Mask))
10579 return DAG.getNode(
10580 X86ISD::VPERMILPV, DL, MVT::v8f32, V1,
10581 DAG.getNode(ISD::BUILD_VECTOR, DL, MVT::v8i32, VPermMask));
10583 if (Subtarget->hasAVX2())
10584 return DAG.getNode(
10585 X86ISD::VPERMV, DL, MVT::v8f32,
10586 DAG.getNode(ISD::BUILD_VECTOR, DL, MVT::v8i32, VPermMask), V1);
10588 // Otherwise, fall back.
10589 return lowerVectorShuffleAsLanePermuteAndBlend(DL, MVT::v8f32, V1, V2, Mask,
10593 // Try to simplify this by merging 128-bit lanes to enable a lane-based
10595 if (SDValue Result = lowerVectorShuffleByMerging128BitLanes(
10596 DL, MVT::v8f32, V1, V2, Mask, Subtarget, DAG))
10599 // If we have AVX2 then we always want to lower with a blend because at v8 we
10600 // can fully permute the elements.
10601 if (Subtarget->hasAVX2())
10602 return lowerVectorShuffleAsDecomposedShuffleBlend(DL, MVT::v8f32, V1, V2,
10605 // Otherwise fall back on generic lowering.
10606 return lowerVectorShuffleAsSplitOrBlend(DL, MVT::v8f32, V1, V2, Mask, DAG);
10609 /// \brief Handle lowering of 8-lane 32-bit integer shuffles.
10611 /// This routine is only called when we have AVX2 and thus a reasonable
10612 /// instruction set for v8i32 shuffling..
10613 static SDValue lowerV8I32VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
10614 const X86Subtarget *Subtarget,
10615 SelectionDAG &DAG) {
10617 assert(V1.getSimpleValueType() == MVT::v8i32 && "Bad operand type!");
10618 assert(V2.getSimpleValueType() == MVT::v8i32 && "Bad operand type!");
10619 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
10620 ArrayRef<int> Mask = SVOp->getMask();
10621 assert(Mask.size() == 8 && "Unexpected mask size for v8 shuffle!");
10622 assert(Subtarget->hasAVX2() && "We can only lower v8i32 with AVX2!");
10624 // Whenever we can lower this as a zext, that instruction is strictly faster
10625 // than any alternative. It also allows us to fold memory operands into the
10626 // shuffle in many cases.
10627 if (SDValue ZExt = lowerVectorShuffleAsZeroOrAnyExtend(DL, MVT::v8i32, V1, V2,
10628 Mask, Subtarget, DAG))
10631 if (SDValue Blend = lowerVectorShuffleAsBlend(DL, MVT::v8i32, V1, V2, Mask,
10635 // Check for being able to broadcast a single element.
10636 if (SDValue Broadcast = lowerVectorShuffleAsBroadcast(DL, MVT::v8i32, V1,
10637 Mask, Subtarget, DAG))
10640 // If the shuffle mask is repeated in each 128-bit lane we can use more
10641 // efficient instructions that mirror the shuffles across the two 128-bit
10643 SmallVector<int, 4> RepeatedMask;
10644 if (is128BitLaneRepeatedShuffleMask(MVT::v8i32, Mask, RepeatedMask)) {
10645 assert(RepeatedMask.size() == 4 && "Unexpected repeated mask size!");
10646 if (isSingleInputShuffleMask(Mask))
10647 return DAG.getNode(X86ISD::PSHUFD, DL, MVT::v8i32, V1,
10648 getV4X86ShuffleImm8ForMask(RepeatedMask, DL, DAG));
10650 // Use dedicated unpack instructions for masks that match their pattern.
10652 lowerVectorShuffleWithUNPCK(DL, MVT::v8i32, Mask, V1, V2, DAG))
10656 // Try to use shift instructions.
10657 if (SDValue Shift =
10658 lowerVectorShuffleAsShift(DL, MVT::v8i32, V1, V2, Mask, DAG))
10661 if (SDValue Rotate = lowerVectorShuffleAsByteRotate(
10662 DL, MVT::v8i32, V1, V2, Mask, Subtarget, DAG))
10665 // If the shuffle patterns aren't repeated but it is a single input, directly
10666 // generate a cross-lane VPERMD instruction.
10667 if (isSingleInputShuffleMask(Mask)) {
10668 SDValue VPermMask[8];
10669 for (int i = 0; i < 8; ++i)
10670 VPermMask[i] = Mask[i] < 0 ? DAG.getUNDEF(MVT::i32)
10671 : DAG.getConstant(Mask[i], DL, MVT::i32);
10672 return DAG.getNode(
10673 X86ISD::VPERMV, DL, MVT::v8i32,
10674 DAG.getNode(ISD::BUILD_VECTOR, DL, MVT::v8i32, VPermMask), V1);
10677 // Try to simplify this by merging 128-bit lanes to enable a lane-based
10679 if (SDValue Result = lowerVectorShuffleByMerging128BitLanes(
10680 DL, MVT::v8i32, V1, V2, Mask, Subtarget, DAG))
10683 // Otherwise fall back on generic blend lowering.
10684 return lowerVectorShuffleAsDecomposedShuffleBlend(DL, MVT::v8i32, V1, V2,
10688 /// \brief Handle lowering of 16-lane 16-bit integer shuffles.
10690 /// This routine is only called when we have AVX2 and thus a reasonable
10691 /// instruction set for v16i16 shuffling..
10692 static SDValue lowerV16I16VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
10693 const X86Subtarget *Subtarget,
10694 SelectionDAG &DAG) {
10696 assert(V1.getSimpleValueType() == MVT::v16i16 && "Bad operand type!");
10697 assert(V2.getSimpleValueType() == MVT::v16i16 && "Bad operand type!");
10698 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
10699 ArrayRef<int> Mask = SVOp->getMask();
10700 assert(Mask.size() == 16 && "Unexpected mask size for v16 shuffle!");
10701 assert(Subtarget->hasAVX2() && "We can only lower v16i16 with AVX2!");
10703 // Whenever we can lower this as a zext, that instruction is strictly faster
10704 // than any alternative. It also allows us to fold memory operands into the
10705 // shuffle in many cases.
10706 if (SDValue ZExt = lowerVectorShuffleAsZeroOrAnyExtend(DL, MVT::v16i16, V1, V2,
10707 Mask, Subtarget, DAG))
10710 // Check for being able to broadcast a single element.
10711 if (SDValue Broadcast = lowerVectorShuffleAsBroadcast(DL, MVT::v16i16, V1,
10712 Mask, Subtarget, DAG))
10715 if (SDValue Blend = lowerVectorShuffleAsBlend(DL, MVT::v16i16, V1, V2, Mask,
10719 // Use dedicated unpack instructions for masks that match their pattern.
10721 lowerVectorShuffleWithUNPCK(DL, MVT::v16i16, Mask, V1, V2, DAG))
10724 // Try to use shift instructions.
10725 if (SDValue Shift =
10726 lowerVectorShuffleAsShift(DL, MVT::v16i16, V1, V2, Mask, DAG))
10729 // Try to use byte rotation instructions.
10730 if (SDValue Rotate = lowerVectorShuffleAsByteRotate(
10731 DL, MVT::v16i16, V1, V2, Mask, Subtarget, DAG))
10734 if (isSingleInputShuffleMask(Mask)) {
10735 // There are no generalized cross-lane shuffle operations available on i16
10737 if (is128BitLaneCrossingShuffleMask(MVT::v16i16, Mask))
10738 return lowerVectorShuffleAsLanePermuteAndBlend(DL, MVT::v16i16, V1, V2,
10741 SmallVector<int, 8> RepeatedMask;
10742 if (is128BitLaneRepeatedShuffleMask(MVT::v16i16, Mask, RepeatedMask)) {
10743 // As this is a single-input shuffle, the repeated mask should be
10744 // a strictly valid v8i16 mask that we can pass through to the v8i16
10745 // lowering to handle even the v16 case.
10746 return lowerV8I16GeneralSingleInputVectorShuffle(
10747 DL, MVT::v16i16, V1, RepeatedMask, Subtarget, DAG);
10750 SDValue PSHUFBMask[32];
10751 for (int i = 0; i < 16; ++i) {
10752 if (Mask[i] == -1) {
10753 PSHUFBMask[2 * i] = PSHUFBMask[2 * i + 1] = DAG.getUNDEF(MVT::i8);
10757 int M = i < 8 ? Mask[i] : Mask[i] - 8;
10758 assert(M >= 0 && M < 8 && "Invalid single-input mask!");
10759 PSHUFBMask[2 * i] = DAG.getConstant(2 * M, DL, MVT::i8);
10760 PSHUFBMask[2 * i + 1] = DAG.getConstant(2 * M + 1, DL, MVT::i8);
10762 return DAG.getBitcast(MVT::v16i16,
10763 DAG.getNode(X86ISD::PSHUFB, DL, MVT::v32i8,
10764 DAG.getBitcast(MVT::v32i8, V1),
10765 DAG.getNode(ISD::BUILD_VECTOR, DL,
10766 MVT::v32i8, PSHUFBMask)));
10769 // Try to simplify this by merging 128-bit lanes to enable a lane-based
10771 if (SDValue Result = lowerVectorShuffleByMerging128BitLanes(
10772 DL, MVT::v16i16, V1, V2, Mask, Subtarget, DAG))
10775 // Otherwise fall back on generic lowering.
10776 return lowerVectorShuffleAsSplitOrBlend(DL, MVT::v16i16, V1, V2, Mask, DAG);
10779 /// \brief Handle lowering of 32-lane 8-bit integer shuffles.
10781 /// This routine is only called when we have AVX2 and thus a reasonable
10782 /// instruction set for v32i8 shuffling..
10783 static SDValue lowerV32I8VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
10784 const X86Subtarget *Subtarget,
10785 SelectionDAG &DAG) {
10787 assert(V1.getSimpleValueType() == MVT::v32i8 && "Bad operand type!");
10788 assert(V2.getSimpleValueType() == MVT::v32i8 && "Bad operand type!");
10789 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
10790 ArrayRef<int> Mask = SVOp->getMask();
10791 assert(Mask.size() == 32 && "Unexpected mask size for v32 shuffle!");
10792 assert(Subtarget->hasAVX2() && "We can only lower v32i8 with AVX2!");
10794 // Whenever we can lower this as a zext, that instruction is strictly faster
10795 // than any alternative. It also allows us to fold memory operands into the
10796 // shuffle in many cases.
10797 if (SDValue ZExt = lowerVectorShuffleAsZeroOrAnyExtend(DL, MVT::v32i8, V1, V2,
10798 Mask, Subtarget, DAG))
10801 // Check for being able to broadcast a single element.
10802 if (SDValue Broadcast = lowerVectorShuffleAsBroadcast(DL, MVT::v32i8, V1,
10803 Mask, Subtarget, DAG))
10806 if (SDValue Blend = lowerVectorShuffleAsBlend(DL, MVT::v32i8, V1, V2, Mask,
10810 // Use dedicated unpack instructions for masks that match their pattern.
10812 lowerVectorShuffleWithUNPCK(DL, MVT::v32i8, Mask, V1, V2, DAG))
10815 // Try to use shift instructions.
10816 if (SDValue Shift =
10817 lowerVectorShuffleAsShift(DL, MVT::v32i8, V1, V2, Mask, DAG))
10820 // Try to use byte rotation instructions.
10821 if (SDValue Rotate = lowerVectorShuffleAsByteRotate(
10822 DL, MVT::v32i8, V1, V2, Mask, Subtarget, DAG))
10825 if (isSingleInputShuffleMask(Mask)) {
10826 // There are no generalized cross-lane shuffle operations available on i8
10828 if (is128BitLaneCrossingShuffleMask(MVT::v32i8, Mask))
10829 return lowerVectorShuffleAsLanePermuteAndBlend(DL, MVT::v32i8, V1, V2,
10832 SDValue PSHUFBMask[32];
10833 for (int i = 0; i < 32; ++i)
10836 ? DAG.getUNDEF(MVT::i8)
10837 : DAG.getConstant(Mask[i] < 16 ? Mask[i] : Mask[i] - 16, DL,
10840 return DAG.getNode(
10841 X86ISD::PSHUFB, DL, MVT::v32i8, V1,
10842 DAG.getNode(ISD::BUILD_VECTOR, DL, MVT::v32i8, PSHUFBMask));
10845 // Try to simplify this by merging 128-bit lanes to enable a lane-based
10847 if (SDValue Result = lowerVectorShuffleByMerging128BitLanes(
10848 DL, MVT::v32i8, V1, V2, Mask, Subtarget, DAG))
10851 // Otherwise fall back on generic lowering.
10852 return lowerVectorShuffleAsSplitOrBlend(DL, MVT::v32i8, V1, V2, Mask, DAG);
10855 /// \brief High-level routine to lower various 256-bit x86 vector shuffles.
10857 /// This routine either breaks down the specific type of a 256-bit x86 vector
10858 /// shuffle or splits it into two 128-bit shuffles and fuses the results back
10859 /// together based on the available instructions.
10860 static SDValue lower256BitVectorShuffle(SDValue Op, SDValue V1, SDValue V2,
10861 MVT VT, const X86Subtarget *Subtarget,
10862 SelectionDAG &DAG) {
10864 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
10865 ArrayRef<int> Mask = SVOp->getMask();
10867 // If we have a single input to the zero element, insert that into V1 if we
10868 // can do so cheaply.
10869 int NumElts = VT.getVectorNumElements();
10870 int NumV2Elements = std::count_if(Mask.begin(), Mask.end(), [NumElts](int M) {
10871 return M >= NumElts;
10874 if (NumV2Elements == 1 && Mask[0] >= NumElts)
10875 if (SDValue Insertion = lowerVectorShuffleAsElementInsertion(
10876 DL, VT, V1, V2, Mask, Subtarget, DAG))
10879 // There is a really nice hard cut-over between AVX1 and AVX2 that means we
10880 // can check for those subtargets here and avoid much of the subtarget
10881 // querying in the per-vector-type lowering routines. With AVX1 we have
10882 // essentially *zero* ability to manipulate a 256-bit vector with integer
10883 // types. Since we'll use floating point types there eventually, just
10884 // immediately cast everything to a float and operate entirely in that domain.
10885 if (VT.isInteger() && !Subtarget->hasAVX2()) {
10886 int ElementBits = VT.getScalarSizeInBits();
10887 if (ElementBits < 32)
10888 // No floating point type available, decompose into 128-bit vectors.
10889 return splitAndLowerVectorShuffle(DL, VT, V1, V2, Mask, DAG);
10891 MVT FpVT = MVT::getVectorVT(MVT::getFloatingPointVT(ElementBits),
10892 VT.getVectorNumElements());
10893 V1 = DAG.getBitcast(FpVT, V1);
10894 V2 = DAG.getBitcast(FpVT, V2);
10895 return DAG.getBitcast(VT, DAG.getVectorShuffle(FpVT, DL, V1, V2, Mask));
10898 switch (VT.SimpleTy) {
10900 return lowerV4F64VectorShuffle(Op, V1, V2, Subtarget, DAG);
10902 return lowerV4I64VectorShuffle(Op, V1, V2, Subtarget, DAG);
10904 return lowerV8F32VectorShuffle(Op, V1, V2, Subtarget, DAG);
10906 return lowerV8I32VectorShuffle(Op, V1, V2, Subtarget, DAG);
10908 return lowerV16I16VectorShuffle(Op, V1, V2, Subtarget, DAG);
10910 return lowerV32I8VectorShuffle(Op, V1, V2, Subtarget, DAG);
10913 llvm_unreachable("Not a valid 256-bit x86 vector type!");
10917 /// \brief Try to lower a vector shuffle as a 128-bit shuffles.
10918 static SDValue lowerV4X128VectorShuffle(SDLoc DL, MVT VT,
10919 ArrayRef<int> Mask,
10920 SDValue V1, SDValue V2,
10921 SelectionDAG &DAG) {
10922 assert(VT.getScalarSizeInBits() == 64 &&
10923 "Unexpected element type size for 128bit shuffle.");
10925 // To handle 256 bit vector requires VLX and most probably
10926 // function lowerV2X128VectorShuffle() is better solution.
10927 assert(VT.is512BitVector() && "Unexpected vector size for 128bit shuffle.");
10929 SmallVector<int, 4> WidenedMask;
10930 if (!canWidenShuffleElements(Mask, WidenedMask))
10933 // Form a 128-bit permutation.
10934 // Convert the 64-bit shuffle mask selection values into 128-bit selection
10935 // bits defined by a vshuf64x2 instruction's immediate control byte.
10936 unsigned PermMask = 0, Imm = 0;
10937 unsigned ControlBitsNum = WidenedMask.size() / 2;
10939 for (int i = 0, Size = WidenedMask.size(); i < Size; ++i) {
10940 if (WidenedMask[i] == SM_SentinelZero)
10943 // Use first element in place of undef mask.
10944 Imm = (WidenedMask[i] == SM_SentinelUndef) ? 0 : WidenedMask[i];
10945 PermMask |= (Imm % WidenedMask.size()) << (i * ControlBitsNum);
10948 return DAG.getNode(X86ISD::SHUF128, DL, VT, V1, V2,
10949 DAG.getConstant(PermMask, DL, MVT::i8));
10952 static SDValue lowerVectorShuffleWithPERMV(SDLoc DL, MVT VT,
10953 ArrayRef<int> Mask, SDValue V1,
10954 SDValue V2, SelectionDAG &DAG) {
10956 assert(VT.getScalarSizeInBits() >= 16 && "Unexpected data type for PERMV");
10958 MVT MaskEltVT = MVT::getIntegerVT(VT.getScalarSizeInBits());
10959 MVT MaskVecVT = MVT::getVectorVT(MaskEltVT, VT.getVectorNumElements());
10961 SDValue MaskNode = getConstVector(Mask, MaskVecVT, DAG, DL, true);
10962 if (isSingleInputShuffleMask(Mask))
10963 return DAG.getNode(X86ISD::VPERMV, DL, VT, MaskNode, V1);
10965 return DAG.getNode(X86ISD::VPERMV3, DL, VT, V1, MaskNode, V2);
10968 /// \brief Handle lowering of 8-lane 64-bit floating point shuffles.
10969 static SDValue lowerV8F64VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
10970 const X86Subtarget *Subtarget,
10971 SelectionDAG &DAG) {
10973 assert(V1.getSimpleValueType() == MVT::v8f64 && "Bad operand type!");
10974 assert(V2.getSimpleValueType() == MVT::v8f64 && "Bad operand type!");
10975 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
10976 ArrayRef<int> Mask = SVOp->getMask();
10977 assert(Mask.size() == 8 && "Unexpected mask size for v8 shuffle!");
10979 if (SDValue Shuf128 =
10980 lowerV4X128VectorShuffle(DL, MVT::v8f64, Mask, V1, V2, DAG))
10983 if (SDValue Unpck =
10984 lowerVectorShuffleWithUNPCK(DL, MVT::v8f64, Mask, V1, V2, DAG))
10987 return lowerVectorShuffleWithPERMV(DL, MVT::v8f64, Mask, V1, V2, DAG);
10990 /// \brief Handle lowering of 16-lane 32-bit floating point shuffles.
10991 static SDValue lowerV16F32VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
10992 const X86Subtarget *Subtarget,
10993 SelectionDAG &DAG) {
10995 assert(V1.getSimpleValueType() == MVT::v16f32 && "Bad operand type!");
10996 assert(V2.getSimpleValueType() == MVT::v16f32 && "Bad operand type!");
10997 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
10998 ArrayRef<int> Mask = SVOp->getMask();
10999 assert(Mask.size() == 16 && "Unexpected mask size for v16 shuffle!");
11001 if (SDValue Unpck =
11002 lowerVectorShuffleWithUNPCK(DL, MVT::v16f32, Mask, V1, V2, DAG))
11005 return lowerVectorShuffleWithPERMV(DL, MVT::v16f32, Mask, V1, V2, DAG);
11008 /// \brief Handle lowering of 8-lane 64-bit integer shuffles.
11009 static SDValue lowerV8I64VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
11010 const X86Subtarget *Subtarget,
11011 SelectionDAG &DAG) {
11013 assert(V1.getSimpleValueType() == MVT::v8i64 && "Bad operand type!");
11014 assert(V2.getSimpleValueType() == MVT::v8i64 && "Bad operand type!");
11015 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
11016 ArrayRef<int> Mask = SVOp->getMask();
11017 assert(Mask.size() == 8 && "Unexpected mask size for v8 shuffle!");
11019 if (SDValue Shuf128 =
11020 lowerV4X128VectorShuffle(DL, MVT::v8i64, Mask, V1, V2, DAG))
11023 if (SDValue Unpck =
11024 lowerVectorShuffleWithUNPCK(DL, MVT::v8i64, Mask, V1, V2, DAG))
11027 return lowerVectorShuffleWithPERMV(DL, MVT::v8i64, Mask, V1, V2, DAG);
11030 /// \brief Handle lowering of 16-lane 32-bit integer shuffles.
11031 static SDValue lowerV16I32VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
11032 const X86Subtarget *Subtarget,
11033 SelectionDAG &DAG) {
11035 assert(V1.getSimpleValueType() == MVT::v16i32 && "Bad operand type!");
11036 assert(V2.getSimpleValueType() == MVT::v16i32 && "Bad operand type!");
11037 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
11038 ArrayRef<int> Mask = SVOp->getMask();
11039 assert(Mask.size() == 16 && "Unexpected mask size for v16 shuffle!");
11041 if (SDValue Unpck =
11042 lowerVectorShuffleWithUNPCK(DL, MVT::v16i32, Mask, V1, V2, DAG))
11045 return lowerVectorShuffleWithPERMV(DL, MVT::v16i32, Mask, V1, V2, DAG);
11048 /// \brief Handle lowering of 32-lane 16-bit integer shuffles.
11049 static SDValue lowerV32I16VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
11050 const X86Subtarget *Subtarget,
11051 SelectionDAG &DAG) {
11053 assert(V1.getSimpleValueType() == MVT::v32i16 && "Bad operand type!");
11054 assert(V2.getSimpleValueType() == MVT::v32i16 && "Bad operand type!");
11055 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
11056 ArrayRef<int> Mask = SVOp->getMask();
11057 assert(Mask.size() == 32 && "Unexpected mask size for v32 shuffle!");
11058 assert(Subtarget->hasBWI() && "We can only lower v32i16 with AVX-512-BWI!");
11060 return lowerVectorShuffleWithPERMV(DL, MVT::v32i16, Mask, V1, V2, DAG);
11063 /// \brief Handle lowering of 64-lane 8-bit integer shuffles.
11064 static SDValue lowerV64I8VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
11065 const X86Subtarget *Subtarget,
11066 SelectionDAG &DAG) {
11068 assert(V1.getSimpleValueType() == MVT::v64i8 && "Bad operand type!");
11069 assert(V2.getSimpleValueType() == MVT::v64i8 && "Bad operand type!");
11070 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
11071 ArrayRef<int> Mask = SVOp->getMask();
11072 assert(Mask.size() == 64 && "Unexpected mask size for v64 shuffle!");
11073 assert(Subtarget->hasBWI() && "We can only lower v64i8 with AVX-512-BWI!");
11075 // FIXME: Implement direct support for this type!
11076 return splitAndLowerVectorShuffle(DL, MVT::v64i8, V1, V2, Mask, DAG);
11079 /// \brief High-level routine to lower various 512-bit x86 vector shuffles.
11081 /// This routine either breaks down the specific type of a 512-bit x86 vector
11082 /// shuffle or splits it into two 256-bit shuffles and fuses the results back
11083 /// together based on the available instructions.
11084 static SDValue lower512BitVectorShuffle(SDValue Op, SDValue V1, SDValue V2,
11085 MVT VT, const X86Subtarget *Subtarget,
11086 SelectionDAG &DAG) {
11088 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
11089 ArrayRef<int> Mask = SVOp->getMask();
11090 assert(Subtarget->hasAVX512() &&
11091 "Cannot lower 512-bit vectors w/ basic ISA!");
11093 // Check for being able to broadcast a single element.
11094 if (SDValue Broadcast =
11095 lowerVectorShuffleAsBroadcast(DL, VT, V1, Mask, Subtarget, DAG))
11098 // Dispatch to each element type for lowering. If we don't have supprot for
11099 // specific element type shuffles at 512 bits, immediately split them and
11100 // lower them. Each lowering routine of a given type is allowed to assume that
11101 // the requisite ISA extensions for that element type are available.
11102 switch (VT.SimpleTy) {
11104 return lowerV8F64VectorShuffle(Op, V1, V2, Subtarget, DAG);
11106 return lowerV16F32VectorShuffle(Op, V1, V2, Subtarget, DAG);
11108 return lowerV8I64VectorShuffle(Op, V1, V2, Subtarget, DAG);
11110 return lowerV16I32VectorShuffle(Op, V1, V2, Subtarget, DAG);
11112 if (Subtarget->hasBWI())
11113 return lowerV32I16VectorShuffle(Op, V1, V2, Subtarget, DAG);
11116 if (Subtarget->hasBWI())
11117 return lowerV64I8VectorShuffle(Op, V1, V2, Subtarget, DAG);
11121 llvm_unreachable("Not a valid 512-bit x86 vector type!");
11124 // Otherwise fall back on splitting.
11125 return splitAndLowerVectorShuffle(DL, VT, V1, V2, Mask, DAG);
11128 // Lower vXi1 vector shuffles.
11129 // There is no a dedicated instruction on AVX-512 that shuffles the masks.
11130 // The only way to shuffle bits is to sign-extend the mask vector to SIMD
11131 // vector, shuffle and then truncate it back.
11132 static SDValue lower1BitVectorShuffle(SDValue Op, SDValue V1, SDValue V2,
11133 MVT VT, const X86Subtarget *Subtarget,
11134 SelectionDAG &DAG) {
11136 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
11137 ArrayRef<int> Mask = SVOp->getMask();
11138 assert(Subtarget->hasAVX512() &&
11139 "Cannot lower 512-bit vectors w/o basic ISA!");
11141 switch (VT.SimpleTy) {
11143 llvm_unreachable("Expected a vector of i1 elements");
11145 ExtVT = MVT::v2i64;
11148 ExtVT = MVT::v4i32;
11151 ExtVT = MVT::v8i64; // Take 512-bit type, more shuffles on KNL
11154 ExtVT = MVT::v16i32;
11157 ExtVT = MVT::v32i16;
11160 ExtVT = MVT::v64i8;
11164 if (ISD::isBuildVectorAllZeros(V1.getNode()))
11165 V1 = getZeroVector(ExtVT, Subtarget, DAG, DL);
11166 else if (ISD::isBuildVectorAllOnes(V1.getNode()))
11167 V1 = getOnesVector(ExtVT, Subtarget, DAG, DL);
11169 V1 = DAG.getNode(ISD::SIGN_EXTEND, DL, ExtVT, V1);
11172 V2 = DAG.getUNDEF(ExtVT);
11173 else if (ISD::isBuildVectorAllZeros(V2.getNode()))
11174 V2 = getZeroVector(ExtVT, Subtarget, DAG, DL);
11175 else if (ISD::isBuildVectorAllOnes(V2.getNode()))
11176 V2 = getOnesVector(ExtVT, Subtarget, DAG, DL);
11178 V2 = DAG.getNode(ISD::SIGN_EXTEND, DL, ExtVT, V2);
11179 return DAG.getNode(ISD::TRUNCATE, DL, VT,
11180 DAG.getVectorShuffle(ExtVT, DL, V1, V2, Mask));
11182 /// \brief Top-level lowering for x86 vector shuffles.
11184 /// This handles decomposition, canonicalization, and lowering of all x86
11185 /// vector shuffles. Most of the specific lowering strategies are encapsulated
11186 /// above in helper routines. The canonicalization attempts to widen shuffles
11187 /// to involve fewer lanes of wider elements, consolidate symmetric patterns
11188 /// s.t. only one of the two inputs needs to be tested, etc.
11189 static SDValue lowerVectorShuffle(SDValue Op, const X86Subtarget *Subtarget,
11190 SelectionDAG &DAG) {
11191 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
11192 ArrayRef<int> Mask = SVOp->getMask();
11193 SDValue V1 = Op.getOperand(0);
11194 SDValue V2 = Op.getOperand(1);
11195 MVT VT = Op.getSimpleValueType();
11196 int NumElements = VT.getVectorNumElements();
11198 bool Is1BitVector = (VT.getVectorElementType() == MVT::i1);
11200 assert((VT.getSizeInBits() != 64 || Is1BitVector) &&
11201 "Can't lower MMX shuffles");
11203 bool V1IsUndef = V1.getOpcode() == ISD::UNDEF;
11204 bool V2IsUndef = V2.getOpcode() == ISD::UNDEF;
11205 if (V1IsUndef && V2IsUndef)
11206 return DAG.getUNDEF(VT);
11208 // When we create a shuffle node we put the UNDEF node to second operand,
11209 // but in some cases the first operand may be transformed to UNDEF.
11210 // In this case we should just commute the node.
11212 return DAG.getCommutedVectorShuffle(*SVOp);
11214 // Check for non-undef masks pointing at an undef vector and make the masks
11215 // undef as well. This makes it easier to match the shuffle based solely on
11219 if (M >= NumElements) {
11220 SmallVector<int, 8> NewMask(Mask.begin(), Mask.end());
11221 for (int &M : NewMask)
11222 if (M >= NumElements)
11224 return DAG.getVectorShuffle(VT, dl, V1, V2, NewMask);
11227 // We actually see shuffles that are entirely re-arrangements of a set of
11228 // zero inputs. This mostly happens while decomposing complex shuffles into
11229 // simple ones. Directly lower these as a buildvector of zeros.
11230 SmallBitVector Zeroable = computeZeroableShuffleElements(Mask, V1, V2);
11231 if (Zeroable.all())
11232 return getZeroVector(VT, Subtarget, DAG, dl);
11234 // Try to collapse shuffles into using a vector type with fewer elements but
11235 // wider element types. We cap this to not form integers or floating point
11236 // elements wider than 64 bits, but it might be interesting to form i128
11237 // integers to handle flipping the low and high halves of AVX 256-bit vectors.
11238 SmallVector<int, 16> WidenedMask;
11239 if (VT.getScalarSizeInBits() < 64 && !Is1BitVector &&
11240 canWidenShuffleElements(Mask, WidenedMask)) {
11241 MVT NewEltVT = VT.isFloatingPoint()
11242 ? MVT::getFloatingPointVT(VT.getScalarSizeInBits() * 2)
11243 : MVT::getIntegerVT(VT.getScalarSizeInBits() * 2);
11244 MVT NewVT = MVT::getVectorVT(NewEltVT, VT.getVectorNumElements() / 2);
11245 // Make sure that the new vector type is legal. For example, v2f64 isn't
11247 if (DAG.getTargetLoweringInfo().isTypeLegal(NewVT)) {
11248 V1 = DAG.getBitcast(NewVT, V1);
11249 V2 = DAG.getBitcast(NewVT, V2);
11250 return DAG.getBitcast(
11251 VT, DAG.getVectorShuffle(NewVT, dl, V1, V2, WidenedMask));
11255 int NumV1Elements = 0, NumUndefElements = 0, NumV2Elements = 0;
11256 for (int M : SVOp->getMask())
11258 ++NumUndefElements;
11259 else if (M < NumElements)
11264 // Commute the shuffle as needed such that more elements come from V1 than
11265 // V2. This allows us to match the shuffle pattern strictly on how many
11266 // elements come from V1 without handling the symmetric cases.
11267 if (NumV2Elements > NumV1Elements)
11268 return DAG.getCommutedVectorShuffle(*SVOp);
11270 // When the number of V1 and V2 elements are the same, try to minimize the
11271 // number of uses of V2 in the low half of the vector. When that is tied,
11272 // ensure that the sum of indices for V1 is equal to or lower than the sum
11273 // indices for V2. When those are equal, try to ensure that the number of odd
11274 // indices for V1 is lower than the number of odd indices for V2.
11275 if (NumV1Elements == NumV2Elements) {
11276 int LowV1Elements = 0, LowV2Elements = 0;
11277 for (int M : SVOp->getMask().slice(0, NumElements / 2))
11278 if (M >= NumElements)
11282 if (LowV2Elements > LowV1Elements) {
11283 return DAG.getCommutedVectorShuffle(*SVOp);
11284 } else if (LowV2Elements == LowV1Elements) {
11285 int SumV1Indices = 0, SumV2Indices = 0;
11286 for (int i = 0, Size = SVOp->getMask().size(); i < Size; ++i)
11287 if (SVOp->getMask()[i] >= NumElements)
11289 else if (SVOp->getMask()[i] >= 0)
11291 if (SumV2Indices < SumV1Indices) {
11292 return DAG.getCommutedVectorShuffle(*SVOp);
11293 } else if (SumV2Indices == SumV1Indices) {
11294 int NumV1OddIndices = 0, NumV2OddIndices = 0;
11295 for (int i = 0, Size = SVOp->getMask().size(); i < Size; ++i)
11296 if (SVOp->getMask()[i] >= NumElements)
11297 NumV2OddIndices += i % 2;
11298 else if (SVOp->getMask()[i] >= 0)
11299 NumV1OddIndices += i % 2;
11300 if (NumV2OddIndices < NumV1OddIndices)
11301 return DAG.getCommutedVectorShuffle(*SVOp);
11306 // For each vector width, delegate to a specialized lowering routine.
11307 if (VT.is128BitVector())
11308 return lower128BitVectorShuffle(Op, V1, V2, VT, Subtarget, DAG);
11310 if (VT.is256BitVector())
11311 return lower256BitVectorShuffle(Op, V1, V2, VT, Subtarget, DAG);
11313 if (VT.is512BitVector())
11314 return lower512BitVectorShuffle(Op, V1, V2, VT, Subtarget, DAG);
11317 return lower1BitVectorShuffle(Op, V1, V2, VT, Subtarget, DAG);
11318 llvm_unreachable("Unimplemented!");
11321 // This function assumes its argument is a BUILD_VECTOR of constants or
11322 // undef SDNodes. i.e: ISD::isBuildVectorOfConstantSDNodes(BuildVector) is
11324 static bool BUILD_VECTORtoBlendMask(BuildVectorSDNode *BuildVector,
11325 unsigned &MaskValue) {
11327 unsigned NumElems = BuildVector->getNumOperands();
11329 // There are 2 lanes if (NumElems > 8), and 1 lane otherwise.
11330 // We don't handle the >2 lanes case right now.
11331 unsigned NumLanes = (NumElems - 1) / 8 + 1;
11335 unsigned NumElemsInLane = NumElems / NumLanes;
11337 // Blend for v16i16 should be symmetric for the both lanes.
11338 for (unsigned i = 0; i < NumElemsInLane; ++i) {
11339 SDValue EltCond = BuildVector->getOperand(i);
11340 SDValue SndLaneEltCond =
11341 (NumLanes == 2) ? BuildVector->getOperand(i + NumElemsInLane) : EltCond;
11343 int Lane1Cond = -1, Lane2Cond = -1;
11344 if (isa<ConstantSDNode>(EltCond))
11345 Lane1Cond = !isNullConstant(EltCond);
11346 if (isa<ConstantSDNode>(SndLaneEltCond))
11347 Lane2Cond = !isNullConstant(SndLaneEltCond);
11349 unsigned LaneMask = 0;
11350 if (Lane1Cond == Lane2Cond || Lane2Cond < 0)
11351 // Lane1Cond != 0, means we want the first argument.
11352 // Lane1Cond == 0, means we want the second argument.
11353 // The encoding of this argument is 0 for the first argument, 1
11354 // for the second. Therefore, invert the condition.
11355 LaneMask = !Lane1Cond << i;
11356 else if (Lane1Cond < 0)
11357 LaneMask = !Lane2Cond << i;
11361 MaskValue |= LaneMask;
11363 MaskValue |= LaneMask << NumElemsInLane;
11368 /// \brief Try to lower a VSELECT instruction to a vector shuffle.
11369 static SDValue lowerVSELECTtoVectorShuffle(SDValue Op,
11370 const X86Subtarget *Subtarget,
11371 SelectionDAG &DAG) {
11372 SDValue Cond = Op.getOperand(0);
11373 SDValue LHS = Op.getOperand(1);
11374 SDValue RHS = Op.getOperand(2);
11376 MVT VT = Op.getSimpleValueType();
11378 if (!ISD::isBuildVectorOfConstantSDNodes(Cond.getNode()))
11380 auto *CondBV = cast<BuildVectorSDNode>(Cond);
11382 // Only non-legal VSELECTs reach this lowering, convert those into generic
11383 // shuffles and re-use the shuffle lowering path for blends.
11384 SmallVector<int, 32> Mask;
11385 for (int i = 0, Size = VT.getVectorNumElements(); i < Size; ++i) {
11386 SDValue CondElt = CondBV->getOperand(i);
11388 isa<ConstantSDNode>(CondElt) ? i + (isNullConstant(CondElt) ? Size : 0)
11391 return DAG.getVectorShuffle(VT, dl, LHS, RHS, Mask);
11394 SDValue X86TargetLowering::LowerVSELECT(SDValue Op, SelectionDAG &DAG) const {
11395 // A vselect where all conditions and data are constants can be optimized into
11396 // a single vector load by SelectionDAGLegalize::ExpandBUILD_VECTOR().
11397 if (ISD::isBuildVectorOfConstantSDNodes(Op.getOperand(0).getNode()) &&
11398 ISD::isBuildVectorOfConstantSDNodes(Op.getOperand(1).getNode()) &&
11399 ISD::isBuildVectorOfConstantSDNodes(Op.getOperand(2).getNode()))
11402 // Try to lower this to a blend-style vector shuffle. This can handle all
11403 // constant condition cases.
11404 if (SDValue BlendOp = lowerVSELECTtoVectorShuffle(Op, Subtarget, DAG))
11407 // Variable blends are only legal from SSE4.1 onward.
11408 if (!Subtarget->hasSSE41())
11411 // Only some types will be legal on some subtargets. If we can emit a legal
11412 // VSELECT-matching blend, return Op, and but if we need to expand, return
11414 switch (Op.getSimpleValueType().SimpleTy) {
11416 // Most of the vector types have blends past SSE4.1.
11420 // The byte blends for AVX vectors were introduced only in AVX2.
11421 if (Subtarget->hasAVX2())
11428 // AVX-512 BWI and VLX features support VSELECT with i16 elements.
11429 if (Subtarget->hasBWI() && Subtarget->hasVLX())
11432 // FIXME: We should custom lower this by fixing the condition and using i8
11438 static SDValue LowerEXTRACT_VECTOR_ELT_SSE4(SDValue Op, SelectionDAG &DAG) {
11439 MVT VT = Op.getSimpleValueType();
11442 if (!Op.getOperand(0).getSimpleValueType().is128BitVector())
11445 if (VT.getSizeInBits() == 8) {
11446 SDValue Extract = DAG.getNode(X86ISD::PEXTRB, dl, MVT::i32,
11447 Op.getOperand(0), Op.getOperand(1));
11448 SDValue Assert = DAG.getNode(ISD::AssertZext, dl, MVT::i32, Extract,
11449 DAG.getValueType(VT));
11450 return DAG.getNode(ISD::TRUNCATE, dl, VT, Assert);
11453 if (VT.getSizeInBits() == 16) {
11454 // If Idx is 0, it's cheaper to do a move instead of a pextrw.
11455 if (isNullConstant(Op.getOperand(1)))
11456 return DAG.getNode(
11457 ISD::TRUNCATE, dl, MVT::i16,
11458 DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::i32,
11459 DAG.getBitcast(MVT::v4i32, Op.getOperand(0)),
11460 Op.getOperand(1)));
11461 SDValue Extract = DAG.getNode(X86ISD::PEXTRW, dl, MVT::i32,
11462 Op.getOperand(0), Op.getOperand(1));
11463 SDValue Assert = DAG.getNode(ISD::AssertZext, dl, MVT::i32, Extract,
11464 DAG.getValueType(VT));
11465 return DAG.getNode(ISD::TRUNCATE, dl, VT, Assert);
11468 if (VT == MVT::f32) {
11469 // EXTRACTPS outputs to a GPR32 register which will require a movd to copy
11470 // the result back to FR32 register. It's only worth matching if the
11471 // result has a single use which is a store or a bitcast to i32. And in
11472 // the case of a store, it's not worth it if the index is a constant 0,
11473 // because a MOVSSmr can be used instead, which is smaller and faster.
11474 if (!Op.hasOneUse())
11476 SDNode *User = *Op.getNode()->use_begin();
11477 if ((User->getOpcode() != ISD::STORE ||
11478 isNullConstant(Op.getOperand(1))) &&
11479 (User->getOpcode() != ISD::BITCAST ||
11480 User->getValueType(0) != MVT::i32))
11482 SDValue Extract = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::i32,
11483 DAG.getBitcast(MVT::v4i32, Op.getOperand(0)),
11485 return DAG.getBitcast(MVT::f32, Extract);
11488 if (VT == MVT::i32 || VT == MVT::i64) {
11489 // ExtractPS/pextrq works with constant index.
11490 if (isa<ConstantSDNode>(Op.getOperand(1)))
11496 /// Extract one bit from mask vector, like v16i1 or v8i1.
11497 /// AVX-512 feature.
11499 X86TargetLowering::ExtractBitFromMaskVector(SDValue Op, SelectionDAG &DAG) const {
11500 SDValue Vec = Op.getOperand(0);
11502 MVT VecVT = Vec.getSimpleValueType();
11503 SDValue Idx = Op.getOperand(1);
11504 MVT EltVT = Op.getSimpleValueType();
11506 assert((EltVT == MVT::i1) && "Unexpected operands in ExtractBitFromMaskVector");
11507 assert((VecVT.getVectorNumElements() <= 16 || Subtarget->hasBWI()) &&
11508 "Unexpected vector type in ExtractBitFromMaskVector");
11510 // variable index can't be handled in mask registers,
11511 // extend vector to VR512
11512 if (!isa<ConstantSDNode>(Idx)) {
11513 MVT ExtVT = (VecVT == MVT::v8i1 ? MVT::v8i64 : MVT::v16i32);
11514 SDValue Ext = DAG.getNode(ISD::ZERO_EXTEND, dl, ExtVT, Vec);
11515 SDValue Elt = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl,
11516 ExtVT.getVectorElementType(), Ext, Idx);
11517 return DAG.getNode(ISD::TRUNCATE, dl, EltVT, Elt);
11520 unsigned IdxVal = cast<ConstantSDNode>(Idx)->getZExtValue();
11521 const TargetRegisterClass* rc = getRegClassFor(VecVT);
11522 if (!Subtarget->hasDQI() && (VecVT.getVectorNumElements() <= 8))
11523 rc = getRegClassFor(MVT::v16i1);
11524 unsigned MaxSift = rc->getSize()*8 - 1;
11525 Vec = DAG.getNode(X86ISD::VSHLI, dl, VecVT, Vec,
11526 DAG.getConstant(MaxSift - IdxVal, dl, MVT::i8));
11527 Vec = DAG.getNode(X86ISD::VSRLI, dl, VecVT, Vec,
11528 DAG.getConstant(MaxSift, dl, MVT::i8));
11529 return DAG.getNode(X86ISD::VEXTRACT, dl, MVT::i1, Vec,
11530 DAG.getIntPtrConstant(0, dl));
11534 X86TargetLowering::LowerEXTRACT_VECTOR_ELT(SDValue Op,
11535 SelectionDAG &DAG) const {
11537 SDValue Vec = Op.getOperand(0);
11538 MVT VecVT = Vec.getSimpleValueType();
11539 SDValue Idx = Op.getOperand(1);
11541 if (Op.getSimpleValueType() == MVT::i1)
11542 return ExtractBitFromMaskVector(Op, DAG);
11544 if (!isa<ConstantSDNode>(Idx)) {
11545 if (VecVT.is512BitVector() ||
11546 (VecVT.is256BitVector() && Subtarget->hasInt256() &&
11547 VecVT.getVectorElementType().getSizeInBits() == 32)) {
11550 MVT::getIntegerVT(VecVT.getVectorElementType().getSizeInBits());
11551 MVT MaskVT = MVT::getVectorVT(MaskEltVT, VecVT.getSizeInBits() /
11552 MaskEltVT.getSizeInBits());
11554 Idx = DAG.getZExtOrTrunc(Idx, dl, MaskEltVT);
11555 auto PtrVT = getPointerTy(DAG.getDataLayout());
11556 SDValue Mask = DAG.getNode(X86ISD::VINSERT, dl, MaskVT,
11557 getZeroVector(MaskVT, Subtarget, DAG, dl), Idx,
11558 DAG.getConstant(0, dl, PtrVT));
11559 SDValue Perm = DAG.getNode(X86ISD::VPERMV, dl, VecVT, Mask, Vec);
11560 return DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, Op.getValueType(), Perm,
11561 DAG.getConstant(0, dl, PtrVT));
11566 // If this is a 256-bit vector result, first extract the 128-bit vector and
11567 // then extract the element from the 128-bit vector.
11568 if (VecVT.is256BitVector() || VecVT.is512BitVector()) {
11570 unsigned IdxVal = cast<ConstantSDNode>(Idx)->getZExtValue();
11571 // Get the 128-bit vector.
11572 Vec = Extract128BitVector(Vec, IdxVal, DAG, dl);
11573 MVT EltVT = VecVT.getVectorElementType();
11575 unsigned ElemsPerChunk = 128 / EltVT.getSizeInBits();
11576 assert(isPowerOf2_32(ElemsPerChunk) && "Elements per chunk not power of 2");
11578 // Find IdxVal modulo ElemsPerChunk. Since ElemsPerChunk is a power of 2
11579 // this can be done with a mask.
11580 IdxVal &= ElemsPerChunk - 1;
11581 return DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, Op.getValueType(), Vec,
11582 DAG.getConstant(IdxVal, dl, MVT::i32));
11585 assert(VecVT.is128BitVector() && "Unexpected vector length");
11587 if (Subtarget->hasSSE41())
11588 if (SDValue Res = LowerEXTRACT_VECTOR_ELT_SSE4(Op, DAG))
11591 MVT VT = Op.getSimpleValueType();
11592 // TODO: handle v16i8.
11593 if (VT.getSizeInBits() == 16) {
11594 SDValue Vec = Op.getOperand(0);
11595 if (isNullConstant(Op.getOperand(1)))
11596 return DAG.getNode(ISD::TRUNCATE, dl, MVT::i16,
11597 DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::i32,
11598 DAG.getBitcast(MVT::v4i32, Vec),
11599 Op.getOperand(1)));
11600 // Transform it so it match pextrw which produces a 32-bit result.
11601 MVT EltVT = MVT::i32;
11602 SDValue Extract = DAG.getNode(X86ISD::PEXTRW, dl, EltVT,
11603 Op.getOperand(0), Op.getOperand(1));
11604 SDValue Assert = DAG.getNode(ISD::AssertZext, dl, EltVT, Extract,
11605 DAG.getValueType(VT));
11606 return DAG.getNode(ISD::TRUNCATE, dl, VT, Assert);
11609 if (VT.getSizeInBits() == 32) {
11610 unsigned Idx = cast<ConstantSDNode>(Op.getOperand(1))->getZExtValue();
11614 // SHUFPS the element to the lowest double word, then movss.
11615 int Mask[4] = { static_cast<int>(Idx), -1, -1, -1 };
11616 MVT VVT = Op.getOperand(0).getSimpleValueType();
11617 SDValue Vec = DAG.getVectorShuffle(VVT, dl, Op.getOperand(0),
11618 DAG.getUNDEF(VVT), Mask);
11619 return DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, VT, Vec,
11620 DAG.getIntPtrConstant(0, dl));
11623 if (VT.getSizeInBits() == 64) {
11624 // FIXME: .td only matches this for <2 x f64>, not <2 x i64> on 32b
11625 // FIXME: seems like this should be unnecessary if mov{h,l}pd were taught
11626 // to match extract_elt for f64.
11627 if (isNullConstant(Op.getOperand(1)))
11630 // UNPCKHPD the element to the lowest double word, then movsd.
11631 // Note if the lower 64 bits of the result of the UNPCKHPD is then stored
11632 // to a f64mem, the whole operation is folded into a single MOVHPDmr.
11633 int Mask[2] = { 1, -1 };
11634 MVT VVT = Op.getOperand(0).getSimpleValueType();
11635 SDValue Vec = DAG.getVectorShuffle(VVT, dl, Op.getOperand(0),
11636 DAG.getUNDEF(VVT), Mask);
11637 return DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, VT, Vec,
11638 DAG.getIntPtrConstant(0, dl));
11644 /// Insert one bit to mask vector, like v16i1 or v8i1.
11645 /// AVX-512 feature.
11647 X86TargetLowering::InsertBitToMaskVector(SDValue Op, SelectionDAG &DAG) const {
11649 SDValue Vec = Op.getOperand(0);
11650 SDValue Elt = Op.getOperand(1);
11651 SDValue Idx = Op.getOperand(2);
11652 MVT VecVT = Vec.getSimpleValueType();
11654 if (!isa<ConstantSDNode>(Idx)) {
11655 // Non constant index. Extend source and destination,
11656 // insert element and then truncate the result.
11657 MVT ExtVecVT = (VecVT == MVT::v8i1 ? MVT::v8i64 : MVT::v16i32);
11658 MVT ExtEltVT = (VecVT == MVT::v8i1 ? MVT::i64 : MVT::i32);
11659 SDValue ExtOp = DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, ExtVecVT,
11660 DAG.getNode(ISD::ZERO_EXTEND, dl, ExtVecVT, Vec),
11661 DAG.getNode(ISD::ZERO_EXTEND, dl, ExtEltVT, Elt), Idx);
11662 return DAG.getNode(ISD::TRUNCATE, dl, VecVT, ExtOp);
11665 unsigned IdxVal = cast<ConstantSDNode>(Idx)->getZExtValue();
11666 SDValue EltInVec = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VecVT, Elt);
11668 EltInVec = DAG.getNode(X86ISD::VSHLI, dl, VecVT, EltInVec,
11669 DAG.getConstant(IdxVal, dl, MVT::i8));
11670 if (Vec.getOpcode() == ISD::UNDEF)
11672 return DAG.getNode(ISD::OR, dl, VecVT, Vec, EltInVec);
11675 SDValue X86TargetLowering::LowerINSERT_VECTOR_ELT(SDValue Op,
11676 SelectionDAG &DAG) const {
11677 MVT VT = Op.getSimpleValueType();
11678 MVT EltVT = VT.getVectorElementType();
11680 if (EltVT == MVT::i1)
11681 return InsertBitToMaskVector(Op, DAG);
11684 SDValue N0 = Op.getOperand(0);
11685 SDValue N1 = Op.getOperand(1);
11686 SDValue N2 = Op.getOperand(2);
11687 if (!isa<ConstantSDNode>(N2))
11689 auto *N2C = cast<ConstantSDNode>(N2);
11690 unsigned IdxVal = N2C->getZExtValue();
11692 // If the vector is wider than 128 bits, extract the 128-bit subvector, insert
11693 // into that, and then insert the subvector back into the result.
11694 if (VT.is256BitVector() || VT.is512BitVector()) {
11695 // With a 256-bit vector, we can insert into the zero element efficiently
11696 // using a blend if we have AVX or AVX2 and the right data type.
11697 if (VT.is256BitVector() && IdxVal == 0) {
11698 // TODO: It is worthwhile to cast integer to floating point and back
11699 // and incur a domain crossing penalty if that's what we'll end up
11700 // doing anyway after extracting to a 128-bit vector.
11701 if ((Subtarget->hasAVX() && (EltVT == MVT::f64 || EltVT == MVT::f32)) ||
11702 (Subtarget->hasAVX2() && EltVT == MVT::i32)) {
11703 SDValue N1Vec = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VT, N1);
11704 N2 = DAG.getIntPtrConstant(1, dl);
11705 return DAG.getNode(X86ISD::BLENDI, dl, VT, N0, N1Vec, N2);
11709 // Get the desired 128-bit vector chunk.
11710 SDValue V = Extract128BitVector(N0, IdxVal, DAG, dl);
11712 // Insert the element into the desired chunk.
11713 unsigned NumEltsIn128 = 128 / EltVT.getSizeInBits();
11714 assert(isPowerOf2_32(NumEltsIn128));
11715 // Since NumEltsIn128 is a power of 2 we can use mask instead of modulo.
11716 unsigned IdxIn128 = IdxVal & (NumEltsIn128 - 1);
11718 V = DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, V.getValueType(), V, N1,
11719 DAG.getConstant(IdxIn128, dl, MVT::i32));
11721 // Insert the changed part back into the bigger vector
11722 return Insert128BitVector(N0, V, IdxVal, DAG, dl);
11724 assert(VT.is128BitVector() && "Only 128-bit vector types should be left!");
11726 if (Subtarget->hasSSE41()) {
11727 if (EltVT.getSizeInBits() == 8 || EltVT.getSizeInBits() == 16) {
11729 if (VT == MVT::v8i16) {
11730 Opc = X86ISD::PINSRW;
11732 assert(VT == MVT::v16i8);
11733 Opc = X86ISD::PINSRB;
11736 // Transform it so it match pinsr{b,w} which expects a GR32 as its second
11738 if (N1.getValueType() != MVT::i32)
11739 N1 = DAG.getNode(ISD::ANY_EXTEND, dl, MVT::i32, N1);
11740 if (N2.getValueType() != MVT::i32)
11741 N2 = DAG.getIntPtrConstant(IdxVal, dl);
11742 return DAG.getNode(Opc, dl, VT, N0, N1, N2);
11745 if (EltVT == MVT::f32) {
11746 // Bits [7:6] of the constant are the source select. This will always be
11747 // zero here. The DAG Combiner may combine an extract_elt index into
11748 // these bits. For example (insert (extract, 3), 2) could be matched by
11749 // putting the '3' into bits [7:6] of X86ISD::INSERTPS.
11750 // Bits [5:4] of the constant are the destination select. This is the
11751 // value of the incoming immediate.
11752 // Bits [3:0] of the constant are the zero mask. The DAG Combiner may
11753 // combine either bitwise AND or insert of float 0.0 to set these bits.
11755 bool MinSize = DAG.getMachineFunction().getFunction()->optForMinSize();
11756 if (IdxVal == 0 && (!MinSize || !MayFoldLoad(N1))) {
11757 // If this is an insertion of 32-bits into the low 32-bits of
11758 // a vector, we prefer to generate a blend with immediate rather
11759 // than an insertps. Blends are simpler operations in hardware and so
11760 // will always have equal or better performance than insertps.
11761 // But if optimizing for size and there's a load folding opportunity,
11762 // generate insertps because blendps does not have a 32-bit memory
11764 N2 = DAG.getIntPtrConstant(1, dl);
11765 N1 = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, MVT::v4f32, N1);
11766 return DAG.getNode(X86ISD::BLENDI, dl, VT, N0, N1, N2);
11768 N2 = DAG.getIntPtrConstant(IdxVal << 4, dl);
11769 // Create this as a scalar to vector..
11770 N1 = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, MVT::v4f32, N1);
11771 return DAG.getNode(X86ISD::INSERTPS, dl, VT, N0, N1, N2);
11774 if (EltVT == MVT::i32 || EltVT == MVT::i64) {
11775 // PINSR* works with constant index.
11780 if (EltVT == MVT::i8)
11783 if (EltVT.getSizeInBits() == 16) {
11784 // Transform it so it match pinsrw which expects a 16-bit value in a GR32
11785 // as its second argument.
11786 if (N1.getValueType() != MVT::i32)
11787 N1 = DAG.getNode(ISD::ANY_EXTEND, dl, MVT::i32, N1);
11788 if (N2.getValueType() != MVT::i32)
11789 N2 = DAG.getIntPtrConstant(IdxVal, dl);
11790 return DAG.getNode(X86ISD::PINSRW, dl, VT, N0, N1, N2);
11795 static SDValue LowerSCALAR_TO_VECTOR(SDValue Op, SelectionDAG &DAG) {
11797 MVT OpVT = Op.getSimpleValueType();
11799 // If this is a 256-bit vector result, first insert into a 128-bit
11800 // vector and then insert into the 256-bit vector.
11801 if (!OpVT.is128BitVector()) {
11802 // Insert into a 128-bit vector.
11803 unsigned SizeFactor = OpVT.getSizeInBits()/128;
11804 MVT VT128 = MVT::getVectorVT(OpVT.getVectorElementType(),
11805 OpVT.getVectorNumElements() / SizeFactor);
11807 Op = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VT128, Op.getOperand(0));
11809 // Insert the 128-bit vector.
11810 return Insert128BitVector(DAG.getUNDEF(OpVT), Op, 0, DAG, dl);
11813 if (OpVT == MVT::v1i64 &&
11814 Op.getOperand(0).getValueType() == MVT::i64)
11815 return DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, MVT::v1i64, Op.getOperand(0));
11817 SDValue AnyExt = DAG.getNode(ISD::ANY_EXTEND, dl, MVT::i32, Op.getOperand(0));
11818 assert(OpVT.is128BitVector() && "Expected an SSE type!");
11819 return DAG.getBitcast(
11820 OpVT, DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, MVT::v4i32, AnyExt));
11823 // Lower a node with an EXTRACT_SUBVECTOR opcode. This may result in
11824 // a simple subregister reference or explicit instructions to grab
11825 // upper bits of a vector.
11826 static SDValue LowerEXTRACT_SUBVECTOR(SDValue Op, const X86Subtarget *Subtarget,
11827 SelectionDAG &DAG) {
11829 SDValue In = Op.getOperand(0);
11830 SDValue Idx = Op.getOperand(1);
11831 unsigned IdxVal = cast<ConstantSDNode>(Idx)->getZExtValue();
11832 MVT ResVT = Op.getSimpleValueType();
11833 MVT InVT = In.getSimpleValueType();
11835 if (Subtarget->hasFp256()) {
11836 if (ResVT.is128BitVector() &&
11837 (InVT.is256BitVector() || InVT.is512BitVector()) &&
11838 isa<ConstantSDNode>(Idx)) {
11839 return Extract128BitVector(In, IdxVal, DAG, dl);
11841 if (ResVT.is256BitVector() && InVT.is512BitVector() &&
11842 isa<ConstantSDNode>(Idx)) {
11843 return Extract256BitVector(In, IdxVal, DAG, dl);
11849 // Lower a node with an INSERT_SUBVECTOR opcode. This may result in a
11850 // simple superregister reference or explicit instructions to insert
11851 // the upper bits of a vector.
11852 static SDValue LowerINSERT_SUBVECTOR(SDValue Op, const X86Subtarget *Subtarget,
11853 SelectionDAG &DAG) {
11854 if (!Subtarget->hasAVX())
11858 SDValue Vec = Op.getOperand(0);
11859 SDValue SubVec = Op.getOperand(1);
11860 SDValue Idx = Op.getOperand(2);
11862 if (!isa<ConstantSDNode>(Idx))
11865 unsigned IdxVal = cast<ConstantSDNode>(Idx)->getZExtValue();
11866 MVT OpVT = Op.getSimpleValueType();
11867 MVT SubVecVT = SubVec.getSimpleValueType();
11869 // Fold two 16-byte subvector loads into one 32-byte load:
11870 // (insert_subvector (insert_subvector undef, (load addr), 0),
11871 // (load addr + 16), Elts/2)
11873 if ((IdxVal == OpVT.getVectorNumElements() / 2) &&
11874 Vec.getOpcode() == ISD::INSERT_SUBVECTOR &&
11875 OpVT.is256BitVector() && SubVecVT.is128BitVector()) {
11876 auto *Idx2 = dyn_cast<ConstantSDNode>(Vec.getOperand(2));
11877 if (Idx2 && Idx2->getZExtValue() == 0) {
11878 SDValue SubVec2 = Vec.getOperand(1);
11879 // If needed, look through a bitcast to get to the load.
11880 if (SubVec2.getNode() && SubVec2.getOpcode() == ISD::BITCAST)
11881 SubVec2 = SubVec2.getOperand(0);
11883 if (auto *FirstLd = dyn_cast<LoadSDNode>(SubVec2)) {
11885 unsigned Alignment = FirstLd->getAlignment();
11886 unsigned AS = FirstLd->getAddressSpace();
11887 const X86TargetLowering *TLI = Subtarget->getTargetLowering();
11888 if (TLI->allowsMemoryAccess(*DAG.getContext(), DAG.getDataLayout(),
11889 OpVT, AS, Alignment, &Fast) && Fast) {
11890 SDValue Ops[] = { SubVec2, SubVec };
11891 if (SDValue Ld = EltsFromConsecutiveLoads(OpVT, Ops, dl, DAG, false))
11898 if ((OpVT.is256BitVector() || OpVT.is512BitVector()) &&
11899 SubVecVT.is128BitVector())
11900 return Insert128BitVector(Vec, SubVec, IdxVal, DAG, dl);
11902 if (OpVT.is512BitVector() && SubVecVT.is256BitVector())
11903 return Insert256BitVector(Vec, SubVec, IdxVal, DAG, dl);
11905 if (OpVT.getVectorElementType() == MVT::i1)
11906 return Insert1BitVector(Op, DAG);
11911 // ConstantPool, JumpTable, GlobalAddress, and ExternalSymbol are lowered as
11912 // their target countpart wrapped in the X86ISD::Wrapper node. Suppose N is
11913 // one of the above mentioned nodes. It has to be wrapped because otherwise
11914 // Select(N) returns N. So the raw TargetGlobalAddress nodes, etc. can only
11915 // be used to form addressing mode. These wrapped nodes will be selected
11918 X86TargetLowering::LowerConstantPool(SDValue Op, SelectionDAG &DAG) const {
11919 ConstantPoolSDNode *CP = cast<ConstantPoolSDNode>(Op);
11921 // In PIC mode (unless we're in RIPRel PIC mode) we add an offset to the
11922 // global base reg.
11923 unsigned char OpFlag = 0;
11924 unsigned WrapperKind = X86ISD::Wrapper;
11925 CodeModel::Model M = DAG.getTarget().getCodeModel();
11927 if (Subtarget->isPICStyleRIPRel() &&
11928 (M == CodeModel::Small || M == CodeModel::Kernel))
11929 WrapperKind = X86ISD::WrapperRIP;
11930 else if (Subtarget->isPICStyleGOT())
11931 OpFlag = X86II::MO_GOTOFF;
11932 else if (Subtarget->isPICStyleStubPIC())
11933 OpFlag = X86II::MO_PIC_BASE_OFFSET;
11935 auto PtrVT = getPointerTy(DAG.getDataLayout());
11936 SDValue Result = DAG.getTargetConstantPool(
11937 CP->getConstVal(), PtrVT, CP->getAlignment(), CP->getOffset(), OpFlag);
11939 Result = DAG.getNode(WrapperKind, DL, PtrVT, Result);
11940 // With PIC, the address is actually $g + Offset.
11943 DAG.getNode(ISD::ADD, DL, PtrVT,
11944 DAG.getNode(X86ISD::GlobalBaseReg, SDLoc(), PtrVT), Result);
11950 SDValue X86TargetLowering::LowerJumpTable(SDValue Op, SelectionDAG &DAG) const {
11951 JumpTableSDNode *JT = cast<JumpTableSDNode>(Op);
11953 // In PIC mode (unless we're in RIPRel PIC mode) we add an offset to the
11954 // global base reg.
11955 unsigned char OpFlag = 0;
11956 unsigned WrapperKind = X86ISD::Wrapper;
11957 CodeModel::Model M = DAG.getTarget().getCodeModel();
11959 if (Subtarget->isPICStyleRIPRel() &&
11960 (M == CodeModel::Small || M == CodeModel::Kernel))
11961 WrapperKind = X86ISD::WrapperRIP;
11962 else if (Subtarget->isPICStyleGOT())
11963 OpFlag = X86II::MO_GOTOFF;
11964 else if (Subtarget->isPICStyleStubPIC())
11965 OpFlag = X86II::MO_PIC_BASE_OFFSET;
11967 auto PtrVT = getPointerTy(DAG.getDataLayout());
11968 SDValue Result = DAG.getTargetJumpTable(JT->getIndex(), PtrVT, OpFlag);
11970 Result = DAG.getNode(WrapperKind, DL, PtrVT, Result);
11972 // With PIC, the address is actually $g + Offset.
11975 DAG.getNode(ISD::ADD, DL, PtrVT,
11976 DAG.getNode(X86ISD::GlobalBaseReg, SDLoc(), PtrVT), Result);
11982 X86TargetLowering::LowerExternalSymbol(SDValue Op, SelectionDAG &DAG) const {
11983 const char *Sym = cast<ExternalSymbolSDNode>(Op)->getSymbol();
11985 // In PIC mode (unless we're in RIPRel PIC mode) we add an offset to the
11986 // global base reg.
11987 unsigned char OpFlag = 0;
11988 unsigned WrapperKind = X86ISD::Wrapper;
11989 CodeModel::Model M = DAG.getTarget().getCodeModel();
11991 if (Subtarget->isPICStyleRIPRel() &&
11992 (M == CodeModel::Small || M == CodeModel::Kernel)) {
11993 if (Subtarget->isTargetDarwin() || Subtarget->isTargetELF())
11994 OpFlag = X86II::MO_GOTPCREL;
11995 WrapperKind = X86ISD::WrapperRIP;
11996 } else if (Subtarget->isPICStyleGOT()) {
11997 OpFlag = X86II::MO_GOT;
11998 } else if (Subtarget->isPICStyleStubPIC()) {
11999 OpFlag = X86II::MO_DARWIN_NONLAZY_PIC_BASE;
12000 } else if (Subtarget->isPICStyleStubNoDynamic()) {
12001 OpFlag = X86II::MO_DARWIN_NONLAZY;
12004 auto PtrVT = getPointerTy(DAG.getDataLayout());
12005 SDValue Result = DAG.getTargetExternalSymbol(Sym, PtrVT, OpFlag);
12008 Result = DAG.getNode(WrapperKind, DL, PtrVT, Result);
12010 // With PIC, the address is actually $g + Offset.
12011 if (DAG.getTarget().getRelocationModel() == Reloc::PIC_ &&
12012 !Subtarget->is64Bit()) {
12014 DAG.getNode(ISD::ADD, DL, PtrVT,
12015 DAG.getNode(X86ISD::GlobalBaseReg, SDLoc(), PtrVT), Result);
12018 // For symbols that require a load from a stub to get the address, emit the
12020 if (isGlobalStubReference(OpFlag))
12021 Result = DAG.getLoad(PtrVT, DL, DAG.getEntryNode(), Result,
12022 MachinePointerInfo::getGOT(DAG.getMachineFunction()),
12023 false, false, false, 0);
12029 X86TargetLowering::LowerBlockAddress(SDValue Op, SelectionDAG &DAG) const {
12030 // Create the TargetBlockAddressAddress node.
12031 unsigned char OpFlags =
12032 Subtarget->ClassifyBlockAddressReference();
12033 CodeModel::Model M = DAG.getTarget().getCodeModel();
12034 const BlockAddress *BA = cast<BlockAddressSDNode>(Op)->getBlockAddress();
12035 int64_t Offset = cast<BlockAddressSDNode>(Op)->getOffset();
12037 auto PtrVT = getPointerTy(DAG.getDataLayout());
12038 SDValue Result = DAG.getTargetBlockAddress(BA, PtrVT, Offset, OpFlags);
12040 if (Subtarget->isPICStyleRIPRel() &&
12041 (M == CodeModel::Small || M == CodeModel::Kernel))
12042 Result = DAG.getNode(X86ISD::WrapperRIP, dl, PtrVT, Result);
12044 Result = DAG.getNode(X86ISD::Wrapper, dl, PtrVT, Result);
12046 // With PIC, the address is actually $g + Offset.
12047 if (isGlobalRelativeToPICBase(OpFlags)) {
12048 Result = DAG.getNode(ISD::ADD, dl, PtrVT,
12049 DAG.getNode(X86ISD::GlobalBaseReg, dl, PtrVT), Result);
12056 X86TargetLowering::LowerGlobalAddress(const GlobalValue *GV, SDLoc dl,
12057 int64_t Offset, SelectionDAG &DAG) const {
12058 // Create the TargetGlobalAddress node, folding in the constant
12059 // offset if it is legal.
12060 unsigned char OpFlags =
12061 Subtarget->ClassifyGlobalReference(GV, DAG.getTarget());
12062 CodeModel::Model M = DAG.getTarget().getCodeModel();
12063 auto PtrVT = getPointerTy(DAG.getDataLayout());
12065 if (OpFlags == X86II::MO_NO_FLAG &&
12066 X86::isOffsetSuitableForCodeModel(Offset, M)) {
12067 // A direct static reference to a global.
12068 Result = DAG.getTargetGlobalAddress(GV, dl, PtrVT, Offset);
12071 Result = DAG.getTargetGlobalAddress(GV, dl, PtrVT, 0, OpFlags);
12074 if (Subtarget->isPICStyleRIPRel() &&
12075 (M == CodeModel::Small || M == CodeModel::Kernel))
12076 Result = DAG.getNode(X86ISD::WrapperRIP, dl, PtrVT, Result);
12078 Result = DAG.getNode(X86ISD::Wrapper, dl, PtrVT, Result);
12080 // With PIC, the address is actually $g + Offset.
12081 if (isGlobalRelativeToPICBase(OpFlags)) {
12082 Result = DAG.getNode(ISD::ADD, dl, PtrVT,
12083 DAG.getNode(X86ISD::GlobalBaseReg, dl, PtrVT), Result);
12086 // For globals that require a load from a stub to get the address, emit the
12088 if (isGlobalStubReference(OpFlags))
12089 Result = DAG.getLoad(PtrVT, dl, DAG.getEntryNode(), Result,
12090 MachinePointerInfo::getGOT(DAG.getMachineFunction()),
12091 false, false, false, 0);
12093 // If there was a non-zero offset that we didn't fold, create an explicit
12094 // addition for it.
12096 Result = DAG.getNode(ISD::ADD, dl, PtrVT, Result,
12097 DAG.getConstant(Offset, dl, PtrVT));
12103 X86TargetLowering::LowerGlobalAddress(SDValue Op, SelectionDAG &DAG) const {
12104 const GlobalValue *GV = cast<GlobalAddressSDNode>(Op)->getGlobal();
12105 int64_t Offset = cast<GlobalAddressSDNode>(Op)->getOffset();
12106 return LowerGlobalAddress(GV, SDLoc(Op), Offset, DAG);
12110 GetTLSADDR(SelectionDAG &DAG, SDValue Chain, GlobalAddressSDNode *GA,
12111 SDValue *InFlag, const EVT PtrVT, unsigned ReturnReg,
12112 unsigned char OperandFlags, bool LocalDynamic = false) {
12113 MachineFrameInfo *MFI = DAG.getMachineFunction().getFrameInfo();
12114 SDVTList NodeTys = DAG.getVTList(MVT::Other, MVT::Glue);
12116 SDValue TGA = DAG.getTargetGlobalAddress(GA->getGlobal(), dl,
12117 GA->getValueType(0),
12121 X86ISD::NodeType CallType = LocalDynamic ? X86ISD::TLSBASEADDR
12125 SDValue Ops[] = { Chain, TGA, *InFlag };
12126 Chain = DAG.getNode(CallType, dl, NodeTys, Ops);
12128 SDValue Ops[] = { Chain, TGA };
12129 Chain = DAG.getNode(CallType, dl, NodeTys, Ops);
12132 // TLSADDR will be codegen'ed as call. Inform MFI that function has calls.
12133 MFI->setAdjustsStack(true);
12134 MFI->setHasCalls(true);
12136 SDValue Flag = Chain.getValue(1);
12137 return DAG.getCopyFromReg(Chain, dl, ReturnReg, PtrVT, Flag);
12140 // Lower ISD::GlobalTLSAddress using the "general dynamic" model, 32 bit
12142 LowerToTLSGeneralDynamicModel32(GlobalAddressSDNode *GA, SelectionDAG &DAG,
12145 SDLoc dl(GA); // ? function entry point might be better
12146 SDValue Chain = DAG.getCopyToReg(DAG.getEntryNode(), dl, X86::EBX,
12147 DAG.getNode(X86ISD::GlobalBaseReg,
12148 SDLoc(), PtrVT), InFlag);
12149 InFlag = Chain.getValue(1);
12151 return GetTLSADDR(DAG, Chain, GA, &InFlag, PtrVT, X86::EAX, X86II::MO_TLSGD);
12154 // Lower ISD::GlobalTLSAddress using the "general dynamic" model, 64 bit
12156 LowerToTLSGeneralDynamicModel64(GlobalAddressSDNode *GA, SelectionDAG &DAG,
12158 return GetTLSADDR(DAG, DAG.getEntryNode(), GA, nullptr, PtrVT,
12159 X86::RAX, X86II::MO_TLSGD);
12162 static SDValue LowerToTLSLocalDynamicModel(GlobalAddressSDNode *GA,
12168 // Get the start address of the TLS block for this module.
12169 X86MachineFunctionInfo* MFI = DAG.getMachineFunction()
12170 .getInfo<X86MachineFunctionInfo>();
12171 MFI->incNumLocalDynamicTLSAccesses();
12175 Base = GetTLSADDR(DAG, DAG.getEntryNode(), GA, nullptr, PtrVT, X86::RAX,
12176 X86II::MO_TLSLD, /*LocalDynamic=*/true);
12179 SDValue Chain = DAG.getCopyToReg(DAG.getEntryNode(), dl, X86::EBX,
12180 DAG.getNode(X86ISD::GlobalBaseReg, SDLoc(), PtrVT), InFlag);
12181 InFlag = Chain.getValue(1);
12182 Base = GetTLSADDR(DAG, Chain, GA, &InFlag, PtrVT, X86::EAX,
12183 X86II::MO_TLSLDM, /*LocalDynamic=*/true);
12186 // Note: the CleanupLocalDynamicTLSPass will remove redundant computations
12190 unsigned char OperandFlags = X86II::MO_DTPOFF;
12191 unsigned WrapperKind = X86ISD::Wrapper;
12192 SDValue TGA = DAG.getTargetGlobalAddress(GA->getGlobal(), dl,
12193 GA->getValueType(0),
12194 GA->getOffset(), OperandFlags);
12195 SDValue Offset = DAG.getNode(WrapperKind, dl, PtrVT, TGA);
12197 // Add x@dtpoff with the base.
12198 return DAG.getNode(ISD::ADD, dl, PtrVT, Offset, Base);
12201 // Lower ISD::GlobalTLSAddress using the "initial exec" or "local exec" model.
12202 static SDValue LowerToTLSExecModel(GlobalAddressSDNode *GA, SelectionDAG &DAG,
12203 const EVT PtrVT, TLSModel::Model model,
12204 bool is64Bit, bool isPIC) {
12207 // Get the Thread Pointer, which is %gs:0 (32-bit) or %fs:0 (64-bit).
12208 Value *Ptr = Constant::getNullValue(Type::getInt8PtrTy(*DAG.getContext(),
12209 is64Bit ? 257 : 256));
12211 SDValue ThreadPointer =
12212 DAG.getLoad(PtrVT, dl, DAG.getEntryNode(), DAG.getIntPtrConstant(0, dl),
12213 MachinePointerInfo(Ptr), false, false, false, 0);
12215 unsigned char OperandFlags = 0;
12216 // Most TLS accesses are not RIP relative, even on x86-64. One exception is
12218 unsigned WrapperKind = X86ISD::Wrapper;
12219 if (model == TLSModel::LocalExec) {
12220 OperandFlags = is64Bit ? X86II::MO_TPOFF : X86II::MO_NTPOFF;
12221 } else if (model == TLSModel::InitialExec) {
12223 OperandFlags = X86II::MO_GOTTPOFF;
12224 WrapperKind = X86ISD::WrapperRIP;
12226 OperandFlags = isPIC ? X86II::MO_GOTNTPOFF : X86II::MO_INDNTPOFF;
12229 llvm_unreachable("Unexpected model");
12232 // emit "addl x@ntpoff,%eax" (local exec)
12233 // or "addl x@indntpoff,%eax" (initial exec)
12234 // or "addl x@gotntpoff(%ebx) ,%eax" (initial exec, 32-bit pic)
12236 DAG.getTargetGlobalAddress(GA->getGlobal(), dl, GA->getValueType(0),
12237 GA->getOffset(), OperandFlags);
12238 SDValue Offset = DAG.getNode(WrapperKind, dl, PtrVT, TGA);
12240 if (model == TLSModel::InitialExec) {
12241 if (isPIC && !is64Bit) {
12242 Offset = DAG.getNode(ISD::ADD, dl, PtrVT,
12243 DAG.getNode(X86ISD::GlobalBaseReg, SDLoc(), PtrVT),
12247 Offset = DAG.getLoad(PtrVT, dl, DAG.getEntryNode(), Offset,
12248 MachinePointerInfo::getGOT(DAG.getMachineFunction()),
12249 false, false, false, 0);
12252 // The address of the thread local variable is the add of the thread
12253 // pointer with the offset of the variable.
12254 return DAG.getNode(ISD::ADD, dl, PtrVT, ThreadPointer, Offset);
12258 X86TargetLowering::LowerGlobalTLSAddress(SDValue Op, SelectionDAG &DAG) const {
12260 GlobalAddressSDNode *GA = cast<GlobalAddressSDNode>(Op);
12261 const GlobalValue *GV = GA->getGlobal();
12262 auto PtrVT = getPointerTy(DAG.getDataLayout());
12264 if (Subtarget->isTargetELF()) {
12265 if (DAG.getTarget().Options.EmulatedTLS)
12266 return LowerToTLSEmulatedModel(GA, DAG);
12267 TLSModel::Model model = DAG.getTarget().getTLSModel(GV);
12269 case TLSModel::GeneralDynamic:
12270 if (Subtarget->is64Bit())
12271 return LowerToTLSGeneralDynamicModel64(GA, DAG, PtrVT);
12272 return LowerToTLSGeneralDynamicModel32(GA, DAG, PtrVT);
12273 case TLSModel::LocalDynamic:
12274 return LowerToTLSLocalDynamicModel(GA, DAG, PtrVT,
12275 Subtarget->is64Bit());
12276 case TLSModel::InitialExec:
12277 case TLSModel::LocalExec:
12278 return LowerToTLSExecModel(GA, DAG, PtrVT, model, Subtarget->is64Bit(),
12279 DAG.getTarget().getRelocationModel() ==
12282 llvm_unreachable("Unknown TLS model.");
12285 if (Subtarget->isTargetDarwin()) {
12286 // Darwin only has one model of TLS. Lower to that.
12287 unsigned char OpFlag = 0;
12288 unsigned WrapperKind = Subtarget->isPICStyleRIPRel() ?
12289 X86ISD::WrapperRIP : X86ISD::Wrapper;
12291 // In PIC mode (unless we're in RIPRel PIC mode) we add an offset to the
12292 // global base reg.
12293 bool PIC32 = (DAG.getTarget().getRelocationModel() == Reloc::PIC_) &&
12294 !Subtarget->is64Bit();
12296 OpFlag = X86II::MO_TLVP_PIC_BASE;
12298 OpFlag = X86II::MO_TLVP;
12300 SDValue Result = DAG.getTargetGlobalAddress(GA->getGlobal(), DL,
12301 GA->getValueType(0),
12302 GA->getOffset(), OpFlag);
12303 SDValue Offset = DAG.getNode(WrapperKind, DL, PtrVT, Result);
12305 // With PIC32, the address is actually $g + Offset.
12307 Offset = DAG.getNode(ISD::ADD, DL, PtrVT,
12308 DAG.getNode(X86ISD::GlobalBaseReg, SDLoc(), PtrVT),
12311 // Lowering the machine isd will make sure everything is in the right
12313 SDValue Chain = DAG.getEntryNode();
12314 SDVTList NodeTys = DAG.getVTList(MVT::Other, MVT::Glue);
12315 SDValue Args[] = { Chain, Offset };
12316 Chain = DAG.getNode(X86ISD::TLSCALL, DL, NodeTys, Args);
12318 // TLSCALL will be codegen'ed as call. Inform MFI that function has calls.
12319 MachineFrameInfo *MFI = DAG.getMachineFunction().getFrameInfo();
12320 MFI->setAdjustsStack(true);
12322 // And our return value (tls address) is in the standard call return value
12324 unsigned Reg = Subtarget->is64Bit() ? X86::RAX : X86::EAX;
12325 return DAG.getCopyFromReg(Chain, DL, Reg, PtrVT, Chain.getValue(1));
12328 if (Subtarget->isTargetKnownWindowsMSVC() ||
12329 Subtarget->isTargetWindowsGNU()) {
12330 // Just use the implicit TLS architecture
12331 // Need to generate someting similar to:
12332 // mov rdx, qword [gs:abs 58H]; Load pointer to ThreadLocalStorage
12334 // mov ecx, dword [rel _tls_index]: Load index (from C runtime)
12335 // mov rcx, qword [rdx+rcx*8]
12336 // mov eax, .tls$:tlsvar
12337 // [rax+rcx] contains the address
12338 // Windows 64bit: gs:0x58
12339 // Windows 32bit: fs:__tls_array
12342 SDValue Chain = DAG.getEntryNode();
12344 // Get the Thread Pointer, which is %fs:__tls_array (32-bit) or
12345 // %gs:0x58 (64-bit). On MinGW, __tls_array is not available, so directly
12346 // use its literal value of 0x2C.
12347 Value *Ptr = Constant::getNullValue(Subtarget->is64Bit()
12348 ? Type::getInt8PtrTy(*DAG.getContext(),
12350 : Type::getInt32PtrTy(*DAG.getContext(),
12353 SDValue TlsArray = Subtarget->is64Bit()
12354 ? DAG.getIntPtrConstant(0x58, dl)
12355 : (Subtarget->isTargetWindowsGNU()
12356 ? DAG.getIntPtrConstant(0x2C, dl)
12357 : DAG.getExternalSymbol("_tls_array", PtrVT));
12359 SDValue ThreadPointer =
12360 DAG.getLoad(PtrVT, dl, Chain, TlsArray, MachinePointerInfo(Ptr), false,
12364 if (GV->getThreadLocalMode() == GlobalVariable::LocalExecTLSModel) {
12365 res = ThreadPointer;
12367 // Load the _tls_index variable
12368 SDValue IDX = DAG.getExternalSymbol("_tls_index", PtrVT);
12369 if (Subtarget->is64Bit())
12370 IDX = DAG.getExtLoad(ISD::ZEXTLOAD, dl, PtrVT, Chain, IDX,
12371 MachinePointerInfo(), MVT::i32, false, false,
12374 IDX = DAG.getLoad(PtrVT, dl, Chain, IDX, MachinePointerInfo(), false,
12377 auto &DL = DAG.getDataLayout();
12379 DAG.getConstant(Log2_64_Ceil(DL.getPointerSize()), dl, PtrVT);
12380 IDX = DAG.getNode(ISD::SHL, dl, PtrVT, IDX, Scale);
12382 res = DAG.getNode(ISD::ADD, dl, PtrVT, ThreadPointer, IDX);
12385 res = DAG.getLoad(PtrVT, dl, Chain, res, MachinePointerInfo(), false, false,
12388 // Get the offset of start of .tls section
12389 SDValue TGA = DAG.getTargetGlobalAddress(GA->getGlobal(), dl,
12390 GA->getValueType(0),
12391 GA->getOffset(), X86II::MO_SECREL);
12392 SDValue Offset = DAG.getNode(X86ISD::Wrapper, dl, PtrVT, TGA);
12394 // The address of the thread local variable is the add of the thread
12395 // pointer with the offset of the variable.
12396 return DAG.getNode(ISD::ADD, dl, PtrVT, res, Offset);
12399 llvm_unreachable("TLS not implemented for this target.");
12402 /// LowerShiftParts - Lower SRA_PARTS and friends, which return two i32 values
12403 /// and take a 2 x i32 value to shift plus a shift amount.
12404 static SDValue LowerShiftParts(SDValue Op, SelectionDAG &DAG) {
12405 assert(Op.getNumOperands() == 3 && "Not a double-shift!");
12406 MVT VT = Op.getSimpleValueType();
12407 unsigned VTBits = VT.getSizeInBits();
12409 bool isSRA = Op.getOpcode() == ISD::SRA_PARTS;
12410 SDValue ShOpLo = Op.getOperand(0);
12411 SDValue ShOpHi = Op.getOperand(1);
12412 SDValue ShAmt = Op.getOperand(2);
12413 // X86ISD::SHLD and X86ISD::SHRD have defined overflow behavior but the
12414 // generic ISD nodes haven't. Insert an AND to be safe, it's optimized away
12416 SDValue SafeShAmt = DAG.getNode(ISD::AND, dl, MVT::i8, ShAmt,
12417 DAG.getConstant(VTBits - 1, dl, MVT::i8));
12418 SDValue Tmp1 = isSRA ? DAG.getNode(ISD::SRA, dl, VT, ShOpHi,
12419 DAG.getConstant(VTBits - 1, dl, MVT::i8))
12420 : DAG.getConstant(0, dl, VT);
12422 SDValue Tmp2, Tmp3;
12423 if (Op.getOpcode() == ISD::SHL_PARTS) {
12424 Tmp2 = DAG.getNode(X86ISD::SHLD, dl, VT, ShOpHi, ShOpLo, ShAmt);
12425 Tmp3 = DAG.getNode(ISD::SHL, dl, VT, ShOpLo, SafeShAmt);
12427 Tmp2 = DAG.getNode(X86ISD::SHRD, dl, VT, ShOpLo, ShOpHi, ShAmt);
12428 Tmp3 = DAG.getNode(isSRA ? ISD::SRA : ISD::SRL, dl, VT, ShOpHi, SafeShAmt);
12431 // If the shift amount is larger or equal than the width of a part we can't
12432 // rely on the results of shld/shrd. Insert a test and select the appropriate
12433 // values for large shift amounts.
12434 SDValue AndNode = DAG.getNode(ISD::AND, dl, MVT::i8, ShAmt,
12435 DAG.getConstant(VTBits, dl, MVT::i8));
12436 SDValue Cond = DAG.getNode(X86ISD::CMP, dl, MVT::i32,
12437 AndNode, DAG.getConstant(0, dl, MVT::i8));
12440 SDValue CC = DAG.getConstant(X86::COND_NE, dl, MVT::i8);
12441 SDValue Ops0[4] = { Tmp2, Tmp3, CC, Cond };
12442 SDValue Ops1[4] = { Tmp3, Tmp1, CC, Cond };
12444 if (Op.getOpcode() == ISD::SHL_PARTS) {
12445 Hi = DAG.getNode(X86ISD::CMOV, dl, VT, Ops0);
12446 Lo = DAG.getNode(X86ISD::CMOV, dl, VT, Ops1);
12448 Lo = DAG.getNode(X86ISD::CMOV, dl, VT, Ops0);
12449 Hi = DAG.getNode(X86ISD::CMOV, dl, VT, Ops1);
12452 SDValue Ops[2] = { Lo, Hi };
12453 return DAG.getMergeValues(Ops, dl);
12456 SDValue X86TargetLowering::LowerSINT_TO_FP(SDValue Op,
12457 SelectionDAG &DAG) const {
12458 SDValue Src = Op.getOperand(0);
12459 MVT SrcVT = Src.getSimpleValueType();
12460 MVT VT = Op.getSimpleValueType();
12463 if (SrcVT.isVector()) {
12464 if (SrcVT == MVT::v2i32 && VT == MVT::v2f64) {
12465 return DAG.getNode(X86ISD::CVTDQ2PD, dl, VT,
12466 DAG.getNode(ISD::CONCAT_VECTORS, dl, MVT::v4i32, Src,
12467 DAG.getUNDEF(SrcVT)));
12469 if (SrcVT.getVectorElementType() == MVT::i1) {
12470 MVT IntegerVT = MVT::getVectorVT(MVT::i32, SrcVT.getVectorNumElements());
12471 return DAG.getNode(ISD::SINT_TO_FP, dl, Op.getValueType(),
12472 DAG.getNode(ISD::SIGN_EXTEND, dl, IntegerVT, Src));
12477 assert(SrcVT <= MVT::i64 && SrcVT >= MVT::i16 &&
12478 "Unknown SINT_TO_FP to lower!");
12480 // These are really Legal; return the operand so the caller accepts it as
12482 if (SrcVT == MVT::i32 && isScalarFPTypeInSSEReg(Op.getValueType()))
12484 if (SrcVT == MVT::i64 && isScalarFPTypeInSSEReg(Op.getValueType()) &&
12485 Subtarget->is64Bit()) {
12489 unsigned Size = SrcVT.getSizeInBits()/8;
12490 MachineFunction &MF = DAG.getMachineFunction();
12491 auto PtrVT = getPointerTy(MF.getDataLayout());
12492 int SSFI = MF.getFrameInfo()->CreateStackObject(Size, Size, false);
12493 SDValue StackSlot = DAG.getFrameIndex(SSFI, PtrVT);
12494 SDValue Chain = DAG.getStore(
12495 DAG.getEntryNode(), dl, Op.getOperand(0), StackSlot,
12496 MachinePointerInfo::getFixedStack(DAG.getMachineFunction(), SSFI), false,
12498 return BuildFILD(Op, SrcVT, Chain, StackSlot, DAG);
12501 SDValue X86TargetLowering::BuildFILD(SDValue Op, EVT SrcVT, SDValue Chain,
12503 SelectionDAG &DAG) const {
12507 bool useSSE = isScalarFPTypeInSSEReg(Op.getValueType());
12509 Tys = DAG.getVTList(MVT::f64, MVT::Other, MVT::Glue);
12511 Tys = DAG.getVTList(Op.getValueType(), MVT::Other);
12513 unsigned ByteSize = SrcVT.getSizeInBits()/8;
12515 FrameIndexSDNode *FI = dyn_cast<FrameIndexSDNode>(StackSlot);
12516 MachineMemOperand *MMO;
12518 int SSFI = FI->getIndex();
12519 MMO = DAG.getMachineFunction().getMachineMemOperand(
12520 MachinePointerInfo::getFixedStack(DAG.getMachineFunction(), SSFI),
12521 MachineMemOperand::MOLoad, ByteSize, ByteSize);
12523 MMO = cast<LoadSDNode>(StackSlot)->getMemOperand();
12524 StackSlot = StackSlot.getOperand(1);
12526 SDValue Ops[] = { Chain, StackSlot, DAG.getValueType(SrcVT) };
12527 SDValue Result = DAG.getMemIntrinsicNode(useSSE ? X86ISD::FILD_FLAG :
12529 Tys, Ops, SrcVT, MMO);
12532 Chain = Result.getValue(1);
12533 SDValue InFlag = Result.getValue(2);
12535 // FIXME: Currently the FST is flagged to the FILD_FLAG. This
12536 // shouldn't be necessary except that RFP cannot be live across
12537 // multiple blocks. When stackifier is fixed, they can be uncoupled.
12538 MachineFunction &MF = DAG.getMachineFunction();
12539 unsigned SSFISize = Op.getValueType().getSizeInBits()/8;
12540 int SSFI = MF.getFrameInfo()->CreateStackObject(SSFISize, SSFISize, false);
12541 auto PtrVT = getPointerTy(MF.getDataLayout());
12542 SDValue StackSlot = DAG.getFrameIndex(SSFI, PtrVT);
12543 Tys = DAG.getVTList(MVT::Other);
12545 Chain, Result, StackSlot, DAG.getValueType(Op.getValueType()), InFlag
12547 MachineMemOperand *MMO = DAG.getMachineFunction().getMachineMemOperand(
12548 MachinePointerInfo::getFixedStack(DAG.getMachineFunction(), SSFI),
12549 MachineMemOperand::MOStore, SSFISize, SSFISize);
12551 Chain = DAG.getMemIntrinsicNode(X86ISD::FST, DL, Tys,
12552 Ops, Op.getValueType(), MMO);
12553 Result = DAG.getLoad(
12554 Op.getValueType(), DL, Chain, StackSlot,
12555 MachinePointerInfo::getFixedStack(DAG.getMachineFunction(), SSFI),
12556 false, false, false, 0);
12562 // LowerUINT_TO_FP_i64 - 64-bit unsigned integer to double expansion.
12563 SDValue X86TargetLowering::LowerUINT_TO_FP_i64(SDValue Op,
12564 SelectionDAG &DAG) const {
12565 // This algorithm is not obvious. Here it is what we're trying to output:
12568 punpckldq (c0), %xmm0 // c0: (uint4){ 0x43300000U, 0x45300000U, 0U, 0U }
12569 subpd (c1), %xmm0 // c1: (double2){ 0x1.0p52, 0x1.0p52 * 0x1.0p32 }
12571 haddpd %xmm0, %xmm0
12573 pshufd $0x4e, %xmm0, %xmm1
12579 LLVMContext *Context = DAG.getContext();
12581 // Build some magic constants.
12582 static const uint32_t CV0[] = { 0x43300000, 0x45300000, 0, 0 };
12583 Constant *C0 = ConstantDataVector::get(*Context, CV0);
12584 auto PtrVT = getPointerTy(DAG.getDataLayout());
12585 SDValue CPIdx0 = DAG.getConstantPool(C0, PtrVT, 16);
12587 SmallVector<Constant*,2> CV1;
12589 ConstantFP::get(*Context, APFloat(APFloat::IEEEdouble,
12590 APInt(64, 0x4330000000000000ULL))));
12592 ConstantFP::get(*Context, APFloat(APFloat::IEEEdouble,
12593 APInt(64, 0x4530000000000000ULL))));
12594 Constant *C1 = ConstantVector::get(CV1);
12595 SDValue CPIdx1 = DAG.getConstantPool(C1, PtrVT, 16);
12597 // Load the 64-bit value into an XMM register.
12598 SDValue XR1 = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, MVT::v2i64,
12601 DAG.getLoad(MVT::v4i32, dl, DAG.getEntryNode(), CPIdx0,
12602 MachinePointerInfo::getConstantPool(DAG.getMachineFunction()),
12603 false, false, false, 16);
12605 getUnpackl(DAG, dl, MVT::v4i32, DAG.getBitcast(MVT::v4i32, XR1), CLod0);
12608 DAG.getLoad(MVT::v2f64, dl, CLod0.getValue(1), CPIdx1,
12609 MachinePointerInfo::getConstantPool(DAG.getMachineFunction()),
12610 false, false, false, 16);
12611 SDValue XR2F = DAG.getBitcast(MVT::v2f64, Unpck1);
12612 // TODO: Are there any fast-math-flags to propagate here?
12613 SDValue Sub = DAG.getNode(ISD::FSUB, dl, MVT::v2f64, XR2F, CLod1);
12616 if (Subtarget->hasSSE3()) {
12617 // FIXME: The 'haddpd' instruction may be slower than 'movhlps + addsd'.
12618 Result = DAG.getNode(X86ISD::FHADD, dl, MVT::v2f64, Sub, Sub);
12620 SDValue S2F = DAG.getBitcast(MVT::v4i32, Sub);
12621 SDValue Shuffle = getTargetShuffleNode(X86ISD::PSHUFD, dl, MVT::v4i32,
12623 Result = DAG.getNode(ISD::FADD, dl, MVT::v2f64,
12624 DAG.getBitcast(MVT::v2f64, Shuffle), Sub);
12627 return DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::f64, Result,
12628 DAG.getIntPtrConstant(0, dl));
12631 // LowerUINT_TO_FP_i32 - 32-bit unsigned integer to float expansion.
12632 SDValue X86TargetLowering::LowerUINT_TO_FP_i32(SDValue Op,
12633 SelectionDAG &DAG) const {
12635 // FP constant to bias correct the final result.
12636 SDValue Bias = DAG.getConstantFP(BitsToDouble(0x4330000000000000ULL), dl,
12639 // Load the 32-bit value into an XMM register.
12640 SDValue Load = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, MVT::v4i32,
12643 // Zero out the upper parts of the register.
12644 Load = getShuffleVectorZeroOrUndef(Load, 0, true, Subtarget, DAG);
12646 Load = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::f64,
12647 DAG.getBitcast(MVT::v2f64, Load),
12648 DAG.getIntPtrConstant(0, dl));
12650 // Or the load with the bias.
12651 SDValue Or = DAG.getNode(
12652 ISD::OR, dl, MVT::v2i64,
12653 DAG.getBitcast(MVT::v2i64,
12654 DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, MVT::v2f64, Load)),
12655 DAG.getBitcast(MVT::v2i64,
12656 DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, MVT::v2f64, Bias)));
12658 DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::f64,
12659 DAG.getBitcast(MVT::v2f64, Or), DAG.getIntPtrConstant(0, dl));
12661 // Subtract the bias.
12662 // TODO: Are there any fast-math-flags to propagate here?
12663 SDValue Sub = DAG.getNode(ISD::FSUB, dl, MVT::f64, Or, Bias);
12665 // Handle final rounding.
12666 MVT DestVT = Op.getSimpleValueType();
12668 if (DestVT.bitsLT(MVT::f64))
12669 return DAG.getNode(ISD::FP_ROUND, dl, DestVT, Sub,
12670 DAG.getIntPtrConstant(0, dl));
12671 if (DestVT.bitsGT(MVT::f64))
12672 return DAG.getNode(ISD::FP_EXTEND, dl, DestVT, Sub);
12674 // Handle final rounding.
12678 static SDValue lowerUINT_TO_FP_vXi32(SDValue Op, SelectionDAG &DAG,
12679 const X86Subtarget &Subtarget) {
12680 // The algorithm is the following:
12681 // #ifdef __SSE4_1__
12682 // uint4 lo = _mm_blend_epi16( v, (uint4) 0x4b000000, 0xaa);
12683 // uint4 hi = _mm_blend_epi16( _mm_srli_epi32(v,16),
12684 // (uint4) 0x53000000, 0xaa);
12686 // uint4 lo = (v & (uint4) 0xffff) | (uint4) 0x4b000000;
12687 // uint4 hi = (v >> 16) | (uint4) 0x53000000;
12689 // float4 fhi = (float4) hi - (0x1.0p39f + 0x1.0p23f);
12690 // return (float4) lo + fhi;
12692 // We shouldn't use it when unsafe-fp-math is enabled though: we might later
12693 // reassociate the two FADDs, and if we do that, the algorithm fails
12694 // spectacularly (PR24512).
12695 // FIXME: If we ever have some kind of Machine FMF, this should be marked
12696 // as non-fast and always be enabled. Why isn't SDAG FMF enough? Because
12697 // there's also the MachineCombiner reassociations happening on Machine IR.
12698 if (DAG.getTarget().Options.UnsafeFPMath)
12702 SDValue V = Op->getOperand(0);
12703 MVT VecIntVT = V.getSimpleValueType();
12704 bool Is128 = VecIntVT == MVT::v4i32;
12705 MVT VecFloatVT = Is128 ? MVT::v4f32 : MVT::v8f32;
12706 // If we convert to something else than the supported type, e.g., to v4f64,
12708 if (VecFloatVT != Op->getSimpleValueType(0))
12711 unsigned NumElts = VecIntVT.getVectorNumElements();
12712 assert((VecIntVT == MVT::v4i32 || VecIntVT == MVT::v8i32) &&
12713 "Unsupported custom type");
12714 assert(NumElts <= 8 && "The size of the constant array must be fixed");
12716 // In the #idef/#else code, we have in common:
12717 // - The vector of constants:
12723 // Create the splat vector for 0x4b000000.
12724 SDValue CstLow = DAG.getConstant(0x4b000000, DL, MVT::i32);
12725 SDValue CstLowArray[] = {CstLow, CstLow, CstLow, CstLow,
12726 CstLow, CstLow, CstLow, CstLow};
12727 SDValue VecCstLow = DAG.getNode(ISD::BUILD_VECTOR, DL, VecIntVT,
12728 makeArrayRef(&CstLowArray[0], NumElts));
12729 // Create the splat vector for 0x53000000.
12730 SDValue CstHigh = DAG.getConstant(0x53000000, DL, MVT::i32);
12731 SDValue CstHighArray[] = {CstHigh, CstHigh, CstHigh, CstHigh,
12732 CstHigh, CstHigh, CstHigh, CstHigh};
12733 SDValue VecCstHigh = DAG.getNode(ISD::BUILD_VECTOR, DL, VecIntVT,
12734 makeArrayRef(&CstHighArray[0], NumElts));
12736 // Create the right shift.
12737 SDValue CstShift = DAG.getConstant(16, DL, MVT::i32);
12738 SDValue CstShiftArray[] = {CstShift, CstShift, CstShift, CstShift,
12739 CstShift, CstShift, CstShift, CstShift};
12740 SDValue VecCstShift = DAG.getNode(ISD::BUILD_VECTOR, DL, VecIntVT,
12741 makeArrayRef(&CstShiftArray[0], NumElts));
12742 SDValue HighShift = DAG.getNode(ISD::SRL, DL, VecIntVT, V, VecCstShift);
12745 if (Subtarget.hasSSE41()) {
12746 MVT VecI16VT = Is128 ? MVT::v8i16 : MVT::v16i16;
12747 // uint4 lo = _mm_blend_epi16( v, (uint4) 0x4b000000, 0xaa);
12748 SDValue VecCstLowBitcast = DAG.getBitcast(VecI16VT, VecCstLow);
12749 SDValue VecBitcast = DAG.getBitcast(VecI16VT, V);
12750 // Low will be bitcasted right away, so do not bother bitcasting back to its
12752 Low = DAG.getNode(X86ISD::BLENDI, DL, VecI16VT, VecBitcast,
12753 VecCstLowBitcast, DAG.getConstant(0xaa, DL, MVT::i32));
12754 // uint4 hi = _mm_blend_epi16( _mm_srli_epi32(v,16),
12755 // (uint4) 0x53000000, 0xaa);
12756 SDValue VecCstHighBitcast = DAG.getBitcast(VecI16VT, VecCstHigh);
12757 SDValue VecShiftBitcast = DAG.getBitcast(VecI16VT, HighShift);
12758 // High will be bitcasted right away, so do not bother bitcasting back to
12759 // its original type.
12760 High = DAG.getNode(X86ISD::BLENDI, DL, VecI16VT, VecShiftBitcast,
12761 VecCstHighBitcast, DAG.getConstant(0xaa, DL, MVT::i32));
12763 SDValue CstMask = DAG.getConstant(0xffff, DL, MVT::i32);
12764 SDValue VecCstMask = DAG.getNode(ISD::BUILD_VECTOR, DL, VecIntVT, CstMask,
12765 CstMask, CstMask, CstMask);
12766 // uint4 lo = (v & (uint4) 0xffff) | (uint4) 0x4b000000;
12767 SDValue LowAnd = DAG.getNode(ISD::AND, DL, VecIntVT, V, VecCstMask);
12768 Low = DAG.getNode(ISD::OR, DL, VecIntVT, LowAnd, VecCstLow);
12770 // uint4 hi = (v >> 16) | (uint4) 0x53000000;
12771 High = DAG.getNode(ISD::OR, DL, VecIntVT, HighShift, VecCstHigh);
12774 // Create the vector constant for -(0x1.0p39f + 0x1.0p23f).
12775 SDValue CstFAdd = DAG.getConstantFP(
12776 APFloat(APFloat::IEEEsingle, APInt(32, 0xD3000080)), DL, MVT::f32);
12777 SDValue CstFAddArray[] = {CstFAdd, CstFAdd, CstFAdd, CstFAdd,
12778 CstFAdd, CstFAdd, CstFAdd, CstFAdd};
12779 SDValue VecCstFAdd = DAG.getNode(ISD::BUILD_VECTOR, DL, VecFloatVT,
12780 makeArrayRef(&CstFAddArray[0], NumElts));
12782 // float4 fhi = (float4) hi - (0x1.0p39f + 0x1.0p23f);
12783 SDValue HighBitcast = DAG.getBitcast(VecFloatVT, High);
12784 // TODO: Are there any fast-math-flags to propagate here?
12786 DAG.getNode(ISD::FADD, DL, VecFloatVT, HighBitcast, VecCstFAdd);
12787 // return (float4) lo + fhi;
12788 SDValue LowBitcast = DAG.getBitcast(VecFloatVT, Low);
12789 return DAG.getNode(ISD::FADD, DL, VecFloatVT, LowBitcast, FHigh);
12792 SDValue X86TargetLowering::lowerUINT_TO_FP_vec(SDValue Op,
12793 SelectionDAG &DAG) const {
12794 SDValue N0 = Op.getOperand(0);
12795 MVT SVT = N0.getSimpleValueType();
12798 switch (SVT.SimpleTy) {
12800 llvm_unreachable("Custom UINT_TO_FP is not supported!");
12805 MVT NVT = MVT::getVectorVT(MVT::i32, SVT.getVectorNumElements());
12806 return DAG.getNode(ISD::SINT_TO_FP, dl, Op.getValueType(),
12807 DAG.getNode(ISD::ZERO_EXTEND, dl, NVT, N0));
12811 return lowerUINT_TO_FP_vXi32(Op, DAG, *Subtarget);
12814 assert(Subtarget->hasAVX512());
12815 return DAG.getNode(ISD::UINT_TO_FP, dl, Op.getValueType(),
12816 DAG.getNode(ISD::ZERO_EXTEND, dl, MVT::v16i32, N0));
12820 SDValue X86TargetLowering::LowerUINT_TO_FP(SDValue Op,
12821 SelectionDAG &DAG) const {
12822 SDValue N0 = Op.getOperand(0);
12824 auto PtrVT = getPointerTy(DAG.getDataLayout());
12826 if (Op.getSimpleValueType().isVector())
12827 return lowerUINT_TO_FP_vec(Op, DAG);
12829 // Since UINT_TO_FP is legal (it's marked custom), dag combiner won't
12830 // optimize it to a SINT_TO_FP when the sign bit is known zero. Perform
12831 // the optimization here.
12832 if (DAG.SignBitIsZero(N0))
12833 return DAG.getNode(ISD::SINT_TO_FP, dl, Op.getValueType(), N0);
12835 MVT SrcVT = N0.getSimpleValueType();
12836 MVT DstVT = Op.getSimpleValueType();
12838 if (Subtarget->hasAVX512() && isScalarFPTypeInSSEReg(DstVT) &&
12839 (SrcVT == MVT::i32 || (SrcVT == MVT::i64 && Subtarget->is64Bit()))) {
12840 // Conversions from unsigned i32 to f32/f64 are legal,
12841 // using VCVTUSI2SS/SD. Same for i64 in 64-bit mode.
12845 if (SrcVT == MVT::i64 && DstVT == MVT::f64 && X86ScalarSSEf64)
12846 return LowerUINT_TO_FP_i64(Op, DAG);
12847 if (SrcVT == MVT::i32 && X86ScalarSSEf64)
12848 return LowerUINT_TO_FP_i32(Op, DAG);
12849 if (Subtarget->is64Bit() && SrcVT == MVT::i64 && DstVT == MVT::f32)
12852 // Make a 64-bit buffer, and use it to build an FILD.
12853 SDValue StackSlot = DAG.CreateStackTemporary(MVT::i64);
12854 if (SrcVT == MVT::i32) {
12855 SDValue WordOff = DAG.getConstant(4, dl, PtrVT);
12856 SDValue OffsetSlot = DAG.getNode(ISD::ADD, dl, PtrVT, StackSlot, WordOff);
12857 SDValue Store1 = DAG.getStore(DAG.getEntryNode(), dl, Op.getOperand(0),
12858 StackSlot, MachinePointerInfo(),
12860 SDValue Store2 = DAG.getStore(Store1, dl, DAG.getConstant(0, dl, MVT::i32),
12861 OffsetSlot, MachinePointerInfo(),
12863 SDValue Fild = BuildFILD(Op, MVT::i64, Store2, StackSlot, DAG);
12867 assert(SrcVT == MVT::i64 && "Unexpected type in UINT_TO_FP");
12868 SDValue Store = DAG.getStore(DAG.getEntryNode(), dl, Op.getOperand(0),
12869 StackSlot, MachinePointerInfo(),
12871 // For i64 source, we need to add the appropriate power of 2 if the input
12872 // was negative. This is the same as the optimization in
12873 // DAGTypeLegalizer::ExpandIntOp_UNIT_TO_FP, and for it to be safe here,
12874 // we must be careful to do the computation in x87 extended precision, not
12875 // in SSE. (The generic code can't know it's OK to do this, or how to.)
12876 int SSFI = cast<FrameIndexSDNode>(StackSlot)->getIndex();
12877 MachineMemOperand *MMO = DAG.getMachineFunction().getMachineMemOperand(
12878 MachinePointerInfo::getFixedStack(DAG.getMachineFunction(), SSFI),
12879 MachineMemOperand::MOLoad, 8, 8);
12881 SDVTList Tys = DAG.getVTList(MVT::f80, MVT::Other);
12882 SDValue Ops[] = { Store, StackSlot, DAG.getValueType(MVT::i64) };
12883 SDValue Fild = DAG.getMemIntrinsicNode(X86ISD::FILD, dl, Tys, Ops,
12886 APInt FF(32, 0x5F800000ULL);
12888 // Check whether the sign bit is set.
12889 SDValue SignSet = DAG.getSetCC(
12890 dl, getSetCCResultType(DAG.getDataLayout(), *DAG.getContext(), MVT::i64),
12891 Op.getOperand(0), DAG.getConstant(0, dl, MVT::i64), ISD::SETLT);
12893 // Build a 64 bit pair (0, FF) in the constant pool, with FF in the lo bits.
12894 SDValue FudgePtr = DAG.getConstantPool(
12895 ConstantInt::get(*DAG.getContext(), FF.zext(64)), PtrVT);
12897 // Get a pointer to FF if the sign bit was set, or to 0 otherwise.
12898 SDValue Zero = DAG.getIntPtrConstant(0, dl);
12899 SDValue Four = DAG.getIntPtrConstant(4, dl);
12900 SDValue Offset = DAG.getNode(ISD::SELECT, dl, Zero.getValueType(), SignSet,
12902 FudgePtr = DAG.getNode(ISD::ADD, dl, PtrVT, FudgePtr, Offset);
12904 // Load the value out, extending it from f32 to f80.
12905 // FIXME: Avoid the extend by constructing the right constant pool?
12906 SDValue Fudge = DAG.getExtLoad(
12907 ISD::EXTLOAD, dl, MVT::f80, DAG.getEntryNode(), FudgePtr,
12908 MachinePointerInfo::getConstantPool(DAG.getMachineFunction()), MVT::f32,
12909 false, false, false, 4);
12910 // Extend everything to 80 bits to force it to be done on x87.
12911 // TODO: Are there any fast-math-flags to propagate here?
12912 SDValue Add = DAG.getNode(ISD::FADD, dl, MVT::f80, Fild, Fudge);
12913 return DAG.getNode(ISD::FP_ROUND, dl, DstVT, Add,
12914 DAG.getIntPtrConstant(0, dl));
12917 // If the given FP_TO_SINT (IsSigned) or FP_TO_UINT (!IsSigned) operation
12918 // is legal, or has an fp128 or f16 source (which needs to be promoted to f32),
12919 // just return an <SDValue(), SDValue()> pair.
12920 // Otherwise it is assumed to be a conversion from one of f32, f64 or f80
12921 // to i16, i32 or i64, and we lower it to a legal sequence.
12922 // If lowered to the final integer result we return a <result, SDValue()> pair.
12923 // Otherwise we lower it to a sequence ending with a FIST, return a
12924 // <FIST, StackSlot> pair, and the caller is responsible for loading
12925 // the final integer result from StackSlot.
12926 std::pair<SDValue,SDValue>
12927 X86TargetLowering::FP_TO_INTHelper(SDValue Op, SelectionDAG &DAG,
12928 bool IsSigned, bool IsReplace) const {
12931 EVT DstTy = Op.getValueType();
12932 EVT TheVT = Op.getOperand(0).getValueType();
12933 auto PtrVT = getPointerTy(DAG.getDataLayout());
12935 if (TheVT != MVT::f32 && TheVT != MVT::f64 && TheVT != MVT::f80) {
12936 // f16 must be promoted before using the lowering in this routine.
12937 // fp128 does not use this lowering.
12938 return std::make_pair(SDValue(), SDValue());
12941 // If using FIST to compute an unsigned i64, we'll need some fixup
12942 // to handle values above the maximum signed i64. A FIST is always
12943 // used for the 32-bit subtarget, but also for f80 on a 64-bit target.
12944 bool UnsignedFixup = !IsSigned &&
12945 DstTy == MVT::i64 &&
12946 (!Subtarget->is64Bit() ||
12947 !isScalarFPTypeInSSEReg(TheVT));
12949 if (!IsSigned && DstTy != MVT::i64 && !Subtarget->hasAVX512()) {
12950 // Replace the fp-to-uint32 operation with an fp-to-sint64 FIST.
12951 // The low 32 bits of the fist result will have the correct uint32 result.
12952 assert(DstTy == MVT::i32 && "Unexpected FP_TO_UINT");
12956 assert(DstTy.getSimpleVT() <= MVT::i64 &&
12957 DstTy.getSimpleVT() >= MVT::i16 &&
12958 "Unknown FP_TO_INT to lower!");
12960 // These are really Legal.
12961 if (DstTy == MVT::i32 &&
12962 isScalarFPTypeInSSEReg(Op.getOperand(0).getValueType()))
12963 return std::make_pair(SDValue(), SDValue());
12964 if (Subtarget->is64Bit() &&
12965 DstTy == MVT::i64 &&
12966 isScalarFPTypeInSSEReg(Op.getOperand(0).getValueType()))
12967 return std::make_pair(SDValue(), SDValue());
12969 // We lower FP->int64 into FISTP64 followed by a load from a temporary
12971 MachineFunction &MF = DAG.getMachineFunction();
12972 unsigned MemSize = DstTy.getSizeInBits()/8;
12973 int SSFI = MF.getFrameInfo()->CreateStackObject(MemSize, MemSize, false);
12974 SDValue StackSlot = DAG.getFrameIndex(SSFI, PtrVT);
12977 switch (DstTy.getSimpleVT().SimpleTy) {
12978 default: llvm_unreachable("Invalid FP_TO_SINT to lower!");
12979 case MVT::i16: Opc = X86ISD::FP_TO_INT16_IN_MEM; break;
12980 case MVT::i32: Opc = X86ISD::FP_TO_INT32_IN_MEM; break;
12981 case MVT::i64: Opc = X86ISD::FP_TO_INT64_IN_MEM; break;
12984 SDValue Chain = DAG.getEntryNode();
12985 SDValue Value = Op.getOperand(0);
12986 SDValue Adjust; // 0x0 or 0x80000000, for result sign bit adjustment.
12988 if (UnsignedFixup) {
12990 // Conversion to unsigned i64 is implemented with a select,
12991 // depending on whether the source value fits in the range
12992 // of a signed i64. Let Thresh be the FP equivalent of
12993 // 0x8000000000000000ULL.
12995 // Adjust i32 = (Value < Thresh) ? 0 : 0x80000000;
12996 // FistSrc = (Value < Thresh) ? Value : (Value - Thresh);
12997 // Fist-to-mem64 FistSrc
12998 // Add 0 or 0x800...0ULL to the 64-bit result, which is equivalent
12999 // to XOR'ing the high 32 bits with Adjust.
13001 // Being a power of 2, Thresh is exactly representable in all FP formats.
13002 // For X87 we'd like to use the smallest FP type for this constant, but
13003 // for DAG type consistency we have to match the FP operand type.
13005 APFloat Thresh(APFloat::IEEEsingle, APInt(32, 0x5f000000));
13006 LLVM_ATTRIBUTE_UNUSED APFloat::opStatus Status = APFloat::opOK;
13007 bool LosesInfo = false;
13008 if (TheVT == MVT::f64)
13009 // The rounding mode is irrelevant as the conversion should be exact.
13010 Status = Thresh.convert(APFloat::IEEEdouble, APFloat::rmNearestTiesToEven,
13012 else if (TheVT == MVT::f80)
13013 Status = Thresh.convert(APFloat::x87DoubleExtended,
13014 APFloat::rmNearestTiesToEven, &LosesInfo);
13016 assert(Status == APFloat::opOK && !LosesInfo &&
13017 "FP conversion should have been exact");
13019 SDValue ThreshVal = DAG.getConstantFP(Thresh, DL, TheVT);
13021 SDValue Cmp = DAG.getSetCC(DL,
13022 getSetCCResultType(DAG.getDataLayout(),
13023 *DAG.getContext(), TheVT),
13024 Value, ThreshVal, ISD::SETLT);
13025 Adjust = DAG.getSelect(DL, MVT::i32, Cmp,
13026 DAG.getConstant(0, DL, MVT::i32),
13027 DAG.getConstant(0x80000000, DL, MVT::i32));
13028 SDValue Sub = DAG.getNode(ISD::FSUB, DL, TheVT, Value, ThreshVal);
13029 Cmp = DAG.getSetCC(DL, getSetCCResultType(DAG.getDataLayout(),
13030 *DAG.getContext(), TheVT),
13031 Value, ThreshVal, ISD::SETLT);
13032 Value = DAG.getSelect(DL, TheVT, Cmp, Value, Sub);
13035 // FIXME This causes a redundant load/store if the SSE-class value is already
13036 // in memory, such as if it is on the callstack.
13037 if (isScalarFPTypeInSSEReg(TheVT)) {
13038 assert(DstTy == MVT::i64 && "Invalid FP_TO_SINT to lower!");
13039 Chain = DAG.getStore(Chain, DL, Value, StackSlot,
13040 MachinePointerInfo::getFixedStack(MF, SSFI), false,
13042 SDVTList Tys = DAG.getVTList(Op.getOperand(0).getValueType(), MVT::Other);
13044 Chain, StackSlot, DAG.getValueType(TheVT)
13047 MachineMemOperand *MMO =
13048 MF.getMachineMemOperand(MachinePointerInfo::getFixedStack(MF, SSFI),
13049 MachineMemOperand::MOLoad, MemSize, MemSize);
13050 Value = DAG.getMemIntrinsicNode(X86ISD::FLD, DL, Tys, Ops, DstTy, MMO);
13051 Chain = Value.getValue(1);
13052 SSFI = MF.getFrameInfo()->CreateStackObject(MemSize, MemSize, false);
13053 StackSlot = DAG.getFrameIndex(SSFI, PtrVT);
13056 MachineMemOperand *MMO =
13057 MF.getMachineMemOperand(MachinePointerInfo::getFixedStack(MF, SSFI),
13058 MachineMemOperand::MOStore, MemSize, MemSize);
13060 if (UnsignedFixup) {
13062 // Insert the FIST, load its result as two i32's,
13063 // and XOR the high i32 with Adjust.
13065 SDValue FistOps[] = { Chain, Value, StackSlot };
13066 SDValue FIST = DAG.getMemIntrinsicNode(Opc, DL, DAG.getVTList(MVT::Other),
13067 FistOps, DstTy, MMO);
13069 SDValue Low32 = DAG.getLoad(MVT::i32, DL, FIST, StackSlot,
13070 MachinePointerInfo(),
13071 false, false, false, 0);
13072 SDValue HighAddr = DAG.getNode(ISD::ADD, DL, PtrVT, StackSlot,
13073 DAG.getConstant(4, DL, PtrVT));
13075 SDValue High32 = DAG.getLoad(MVT::i32, DL, FIST, HighAddr,
13076 MachinePointerInfo(),
13077 false, false, false, 0);
13078 High32 = DAG.getNode(ISD::XOR, DL, MVT::i32, High32, Adjust);
13080 if (Subtarget->is64Bit()) {
13081 // Join High32 and Low32 into a 64-bit result.
13082 // (High32 << 32) | Low32
13083 Low32 = DAG.getNode(ISD::ZERO_EXTEND, DL, MVT::i64, Low32);
13084 High32 = DAG.getNode(ISD::ANY_EXTEND, DL, MVT::i64, High32);
13085 High32 = DAG.getNode(ISD::SHL, DL, MVT::i64, High32,
13086 DAG.getConstant(32, DL, MVT::i8));
13087 SDValue Result = DAG.getNode(ISD::OR, DL, MVT::i64, High32, Low32);
13088 return std::make_pair(Result, SDValue());
13091 SDValue ResultOps[] = { Low32, High32 };
13093 SDValue pair = IsReplace
13094 ? DAG.getNode(ISD::BUILD_PAIR, DL, MVT::i64, ResultOps)
13095 : DAG.getMergeValues(ResultOps, DL);
13096 return std::make_pair(pair, SDValue());
13098 // Build the FP_TO_INT*_IN_MEM
13099 SDValue Ops[] = { Chain, Value, StackSlot };
13100 SDValue FIST = DAG.getMemIntrinsicNode(Opc, DL, DAG.getVTList(MVT::Other),
13102 return std::make_pair(FIST, StackSlot);
13106 static SDValue LowerAVXExtend(SDValue Op, SelectionDAG &DAG,
13107 const X86Subtarget *Subtarget) {
13108 MVT VT = Op->getSimpleValueType(0);
13109 SDValue In = Op->getOperand(0);
13110 MVT InVT = In.getSimpleValueType();
13113 if (VT.is512BitVector() || InVT.getVectorElementType() == MVT::i1)
13114 return DAG.getNode(ISD::ZERO_EXTEND, dl, VT, In);
13116 // Optimize vectors in AVX mode:
13119 // Use vpunpcklwd for 4 lower elements v8i16 -> v4i32.
13120 // Use vpunpckhwd for 4 upper elements v8i16 -> v4i32.
13121 // Concat upper and lower parts.
13124 // Use vpunpckldq for 4 lower elements v4i32 -> v2i64.
13125 // Use vpunpckhdq for 4 upper elements v4i32 -> v2i64.
13126 // Concat upper and lower parts.
13129 if (((VT != MVT::v16i16) || (InVT != MVT::v16i8)) &&
13130 ((VT != MVT::v8i32) || (InVT != MVT::v8i16)) &&
13131 ((VT != MVT::v4i64) || (InVT != MVT::v4i32)))
13134 if (Subtarget->hasInt256())
13135 return DAG.getNode(X86ISD::VZEXT, dl, VT, In);
13137 SDValue ZeroVec = getZeroVector(InVT, Subtarget, DAG, dl);
13138 SDValue Undef = DAG.getUNDEF(InVT);
13139 bool NeedZero = Op.getOpcode() == ISD::ZERO_EXTEND;
13140 SDValue OpLo = getUnpackl(DAG, dl, InVT, In, NeedZero ? ZeroVec : Undef);
13141 SDValue OpHi = getUnpackh(DAG, dl, InVT, In, NeedZero ? ZeroVec : Undef);
13143 MVT HVT = MVT::getVectorVT(VT.getVectorElementType(),
13144 VT.getVectorNumElements()/2);
13146 OpLo = DAG.getBitcast(HVT, OpLo);
13147 OpHi = DAG.getBitcast(HVT, OpHi);
13149 return DAG.getNode(ISD::CONCAT_VECTORS, dl, VT, OpLo, OpHi);
13152 static SDValue LowerZERO_EXTEND_AVX512(SDValue Op,
13153 const X86Subtarget *Subtarget, SelectionDAG &DAG) {
13154 MVT VT = Op->getSimpleValueType(0);
13155 SDValue In = Op->getOperand(0);
13156 MVT InVT = In.getSimpleValueType();
13158 unsigned int NumElts = VT.getVectorNumElements();
13159 if (NumElts != 8 && NumElts != 16 && !Subtarget->hasBWI())
13162 if (VT.is512BitVector() && InVT.getVectorElementType() != MVT::i1)
13163 return DAG.getNode(X86ISD::VZEXT, DL, VT, In);
13165 assert(InVT.getVectorElementType() == MVT::i1);
13166 MVT ExtVT = NumElts == 8 ? MVT::v8i64 : MVT::v16i32;
13168 DAG.getConstant(APInt(ExtVT.getScalarSizeInBits(), 1), DL, ExtVT);
13170 DAG.getConstant(APInt::getNullValue(ExtVT.getScalarSizeInBits()), DL, ExtVT);
13172 SDValue V = DAG.getNode(ISD::VSELECT, DL, ExtVT, In, One, Zero);
13173 if (VT.is512BitVector())
13175 return DAG.getNode(X86ISD::VTRUNC, DL, VT, V);
13178 static SDValue LowerANY_EXTEND(SDValue Op, const X86Subtarget *Subtarget,
13179 SelectionDAG &DAG) {
13180 if (Subtarget->hasFp256())
13181 if (SDValue Res = LowerAVXExtend(Op, DAG, Subtarget))
13187 static SDValue LowerZERO_EXTEND(SDValue Op, const X86Subtarget *Subtarget,
13188 SelectionDAG &DAG) {
13190 MVT VT = Op.getSimpleValueType();
13191 SDValue In = Op.getOperand(0);
13192 MVT SVT = In.getSimpleValueType();
13194 if (VT.is512BitVector() || SVT.getVectorElementType() == MVT::i1)
13195 return LowerZERO_EXTEND_AVX512(Op, Subtarget, DAG);
13197 if (Subtarget->hasFp256())
13198 if (SDValue Res = LowerAVXExtend(Op, DAG, Subtarget))
13201 assert(!VT.is256BitVector() || !SVT.is128BitVector() ||
13202 VT.getVectorNumElements() != SVT.getVectorNumElements());
13206 SDValue X86TargetLowering::LowerTRUNCATE(SDValue Op, SelectionDAG &DAG) const {
13208 MVT VT = Op.getSimpleValueType();
13209 SDValue In = Op.getOperand(0);
13210 MVT InVT = In.getSimpleValueType();
13212 if (VT == MVT::i1) {
13213 assert((InVT.isInteger() && (InVT.getSizeInBits() <= 64)) &&
13214 "Invalid scalar TRUNCATE operation");
13215 if (InVT.getSizeInBits() >= 32)
13217 In = DAG.getNode(ISD::ANY_EXTEND, DL, MVT::i32, In);
13218 return DAG.getNode(ISD::TRUNCATE, DL, VT, In);
13220 assert(VT.getVectorNumElements() == InVT.getVectorNumElements() &&
13221 "Invalid TRUNCATE operation");
13223 // move vector to mask - truncate solution for SKX
13224 if (VT.getVectorElementType() == MVT::i1) {
13225 if (InVT.is512BitVector() && InVT.getScalarSizeInBits() <= 16 &&
13226 Subtarget->hasBWI())
13227 return Op; // legal, will go to VPMOVB2M, VPMOVW2M
13228 if ((InVT.is256BitVector() || InVT.is128BitVector())
13229 && InVT.getScalarSizeInBits() <= 16 &&
13230 Subtarget->hasBWI() && Subtarget->hasVLX())
13231 return Op; // legal, will go to VPMOVB2M, VPMOVW2M
13232 if (InVT.is512BitVector() && InVT.getScalarSizeInBits() >= 32 &&
13233 Subtarget->hasDQI())
13234 return Op; // legal, will go to VPMOVD2M, VPMOVQ2M
13235 if ((InVT.is256BitVector() || InVT.is128BitVector())
13236 && InVT.getScalarSizeInBits() >= 32 &&
13237 Subtarget->hasDQI() && Subtarget->hasVLX())
13238 return Op; // legal, will go to VPMOVB2M, VPMOVQ2M
13241 if (VT.getVectorElementType() == MVT::i1) {
13242 assert(VT.getVectorElementType() == MVT::i1 && "Unexpected vector type");
13243 unsigned NumElts = InVT.getVectorNumElements();
13244 assert ((NumElts == 8 || NumElts == 16) && "Unexpected vector type");
13245 if (InVT.getSizeInBits() < 512) {
13246 MVT ExtVT = (NumElts == 16)? MVT::v16i32 : MVT::v8i64;
13247 In = DAG.getNode(ISD::SIGN_EXTEND, DL, ExtVT, In);
13252 DAG.getConstant(APInt::getSignBit(InVT.getScalarSizeInBits()), DL, InVT);
13253 SDValue And = DAG.getNode(ISD::AND, DL, InVT, OneV, In);
13254 return DAG.getNode(X86ISD::TESTM, DL, VT, And, And);
13257 // vpmovqb/w/d, vpmovdb/w, vpmovwb
13258 if (Subtarget->hasAVX512()) {
13259 // word to byte only under BWI
13260 if (InVT == MVT::v16i16 && !Subtarget->hasBWI()) // v16i16 -> v16i8
13261 return DAG.getNode(X86ISD::VTRUNC, DL, VT,
13262 DAG.getNode(X86ISD::VSEXT, DL, MVT::v16i32, In));
13263 return DAG.getNode(X86ISD::VTRUNC, DL, VT, In);
13265 if ((VT == MVT::v4i32) && (InVT == MVT::v4i64)) {
13266 // On AVX2, v4i64 -> v4i32 becomes VPERMD.
13267 if (Subtarget->hasInt256()) {
13268 static const int ShufMask[] = {0, 2, 4, 6, -1, -1, -1, -1};
13269 In = DAG.getBitcast(MVT::v8i32, In);
13270 In = DAG.getVectorShuffle(MVT::v8i32, DL, In, DAG.getUNDEF(MVT::v8i32),
13272 return DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, VT, In,
13273 DAG.getIntPtrConstant(0, DL));
13276 SDValue OpLo = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, MVT::v2i64, In,
13277 DAG.getIntPtrConstant(0, DL));
13278 SDValue OpHi = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, MVT::v2i64, In,
13279 DAG.getIntPtrConstant(2, DL));
13280 OpLo = DAG.getBitcast(MVT::v4i32, OpLo);
13281 OpHi = DAG.getBitcast(MVT::v4i32, OpHi);
13282 static const int ShufMask[] = {0, 2, 4, 6};
13283 return DAG.getVectorShuffle(VT, DL, OpLo, OpHi, ShufMask);
13286 if ((VT == MVT::v8i16) && (InVT == MVT::v8i32)) {
13287 // On AVX2, v8i32 -> v8i16 becomed PSHUFB.
13288 if (Subtarget->hasInt256()) {
13289 In = DAG.getBitcast(MVT::v32i8, In);
13291 SmallVector<SDValue,32> pshufbMask;
13292 for (unsigned i = 0; i < 2; ++i) {
13293 pshufbMask.push_back(DAG.getConstant(0x0, DL, MVT::i8));
13294 pshufbMask.push_back(DAG.getConstant(0x1, DL, MVT::i8));
13295 pshufbMask.push_back(DAG.getConstant(0x4, DL, MVT::i8));
13296 pshufbMask.push_back(DAG.getConstant(0x5, DL, MVT::i8));
13297 pshufbMask.push_back(DAG.getConstant(0x8, DL, MVT::i8));
13298 pshufbMask.push_back(DAG.getConstant(0x9, DL, MVT::i8));
13299 pshufbMask.push_back(DAG.getConstant(0xc, DL, MVT::i8));
13300 pshufbMask.push_back(DAG.getConstant(0xd, DL, MVT::i8));
13301 for (unsigned j = 0; j < 8; ++j)
13302 pshufbMask.push_back(DAG.getConstant(0x80, DL, MVT::i8));
13304 SDValue BV = DAG.getNode(ISD::BUILD_VECTOR, DL, MVT::v32i8, pshufbMask);
13305 In = DAG.getNode(X86ISD::PSHUFB, DL, MVT::v32i8, In, BV);
13306 In = DAG.getBitcast(MVT::v4i64, In);
13308 static const int ShufMask[] = {0, 2, -1, -1};
13309 In = DAG.getVectorShuffle(MVT::v4i64, DL, In, DAG.getUNDEF(MVT::v4i64),
13311 In = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, MVT::v2i64, In,
13312 DAG.getIntPtrConstant(0, DL));
13313 return DAG.getBitcast(VT, In);
13316 SDValue OpLo = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, MVT::v4i32, In,
13317 DAG.getIntPtrConstant(0, DL));
13319 SDValue OpHi = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, MVT::v4i32, In,
13320 DAG.getIntPtrConstant(4, DL));
13322 OpLo = DAG.getBitcast(MVT::v16i8, OpLo);
13323 OpHi = DAG.getBitcast(MVT::v16i8, OpHi);
13325 // The PSHUFB mask:
13326 static const int ShufMask1[] = {0, 1, 4, 5, 8, 9, 12, 13,
13327 -1, -1, -1, -1, -1, -1, -1, -1};
13329 SDValue Undef = DAG.getUNDEF(MVT::v16i8);
13330 OpLo = DAG.getVectorShuffle(MVT::v16i8, DL, OpLo, Undef, ShufMask1);
13331 OpHi = DAG.getVectorShuffle(MVT::v16i8, DL, OpHi, Undef, ShufMask1);
13333 OpLo = DAG.getBitcast(MVT::v4i32, OpLo);
13334 OpHi = DAG.getBitcast(MVT::v4i32, OpHi);
13336 // The MOVLHPS Mask:
13337 static const int ShufMask2[] = {0, 1, 4, 5};
13338 SDValue res = DAG.getVectorShuffle(MVT::v4i32, DL, OpLo, OpHi, ShufMask2);
13339 return DAG.getBitcast(MVT::v8i16, res);
13342 // Handle truncation of V256 to V128 using shuffles.
13343 if (!VT.is128BitVector() || !InVT.is256BitVector())
13346 assert(Subtarget->hasFp256() && "256-bit vector without AVX!");
13348 unsigned NumElems = VT.getVectorNumElements();
13349 MVT NVT = MVT::getVectorVT(VT.getVectorElementType(), NumElems * 2);
13351 SmallVector<int, 16> MaskVec(NumElems * 2, -1);
13352 // Prepare truncation shuffle mask
13353 for (unsigned i = 0; i != NumElems; ++i)
13354 MaskVec[i] = i * 2;
13355 SDValue V = DAG.getVectorShuffle(NVT, DL, DAG.getBitcast(NVT, In),
13356 DAG.getUNDEF(NVT), &MaskVec[0]);
13357 return DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, VT, V,
13358 DAG.getIntPtrConstant(0, DL));
13361 SDValue X86TargetLowering::LowerFP_TO_SINT(SDValue Op,
13362 SelectionDAG &DAG) const {
13363 assert(!Op.getSimpleValueType().isVector());
13365 std::pair<SDValue,SDValue> Vals = FP_TO_INTHelper(Op, DAG,
13366 /*IsSigned=*/ true, /*IsReplace=*/ false);
13367 SDValue FIST = Vals.first, StackSlot = Vals.second;
13368 // If FP_TO_INTHelper failed, the node is actually supposed to be Legal.
13369 if (!FIST.getNode())
13372 if (StackSlot.getNode())
13373 // Load the result.
13374 return DAG.getLoad(Op.getValueType(), SDLoc(Op),
13375 FIST, StackSlot, MachinePointerInfo(),
13376 false, false, false, 0);
13378 // The node is the result.
13382 SDValue X86TargetLowering::LowerFP_TO_UINT(SDValue Op,
13383 SelectionDAG &DAG) const {
13384 std::pair<SDValue,SDValue> Vals = FP_TO_INTHelper(Op, DAG,
13385 /*IsSigned=*/ false, /*IsReplace=*/ false);
13386 SDValue FIST = Vals.first, StackSlot = Vals.second;
13387 // If FP_TO_INTHelper failed, the node is actually supposed to be Legal.
13388 if (!FIST.getNode())
13391 if (StackSlot.getNode())
13392 // Load the result.
13393 return DAG.getLoad(Op.getValueType(), SDLoc(Op),
13394 FIST, StackSlot, MachinePointerInfo(),
13395 false, false, false, 0);
13397 // The node is the result.
13401 static SDValue LowerFP_EXTEND(SDValue Op, SelectionDAG &DAG) {
13403 MVT VT = Op.getSimpleValueType();
13404 SDValue In = Op.getOperand(0);
13405 MVT SVT = In.getSimpleValueType();
13407 assert(SVT == MVT::v2f32 && "Only customize MVT::v2f32 type legalization!");
13409 return DAG.getNode(X86ISD::VFPEXT, DL, VT,
13410 DAG.getNode(ISD::CONCAT_VECTORS, DL, MVT::v4f32,
13411 In, DAG.getUNDEF(SVT)));
13414 /// The only differences between FABS and FNEG are the mask and the logic op.
13415 /// FNEG also has a folding opportunity for FNEG(FABS(x)).
13416 static SDValue LowerFABSorFNEG(SDValue Op, SelectionDAG &DAG) {
13417 assert((Op.getOpcode() == ISD::FABS || Op.getOpcode() == ISD::FNEG) &&
13418 "Wrong opcode for lowering FABS or FNEG.");
13420 bool IsFABS = (Op.getOpcode() == ISD::FABS);
13422 // If this is a FABS and it has an FNEG user, bail out to fold the combination
13423 // into an FNABS. We'll lower the FABS after that if it is still in use.
13425 for (SDNode *User : Op->uses())
13426 if (User->getOpcode() == ISD::FNEG)
13430 MVT VT = Op.getSimpleValueType();
13432 bool IsF128 = (VT == MVT::f128);
13434 // FIXME: Use function attribute "OptimizeForSize" and/or CodeGenOpt::Level to
13435 // decide if we should generate a 16-byte constant mask when we only need 4 or
13436 // 8 bytes for the scalar case.
13442 if (VT.isVector()) {
13444 EltVT = VT.getVectorElementType();
13445 NumElts = VT.getVectorNumElements();
13446 } else if (IsF128) {
13447 // SSE instructions are used for optimized f128 logical operations.
13448 LogicVT = MVT::f128;
13452 // There are no scalar bitwise logical SSE/AVX instructions, so we
13453 // generate a 16-byte vector constant and logic op even for the scalar case.
13454 // Using a 16-byte mask allows folding the load of the mask with
13455 // the logic op, so it can save (~4 bytes) on code size.
13456 LogicVT = (VT == MVT::f64) ? MVT::v2f64 : MVT::v4f32;
13458 NumElts = (VT == MVT::f64) ? 2 : 4;
13461 unsigned EltBits = EltVT.getSizeInBits();
13462 LLVMContext *Context = DAG.getContext();
13463 // For FABS, mask is 0x7f...; for FNEG, mask is 0x80...
13465 IsFABS ? APInt::getSignedMaxValue(EltBits) : APInt::getSignBit(EltBits);
13466 Constant *C = ConstantInt::get(*Context, MaskElt);
13467 C = ConstantVector::getSplat(NumElts, C);
13468 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
13469 SDValue CPIdx = DAG.getConstantPool(C, TLI.getPointerTy(DAG.getDataLayout()));
13470 unsigned Alignment = cast<ConstantPoolSDNode>(CPIdx)->getAlignment();
13472 DAG.getLoad(LogicVT, dl, DAG.getEntryNode(), CPIdx,
13473 MachinePointerInfo::getConstantPool(DAG.getMachineFunction()),
13474 false, false, false, Alignment);
13476 SDValue Op0 = Op.getOperand(0);
13477 bool IsFNABS = !IsFABS && (Op0.getOpcode() == ISD::FABS);
13479 IsFABS ? X86ISD::FAND : IsFNABS ? X86ISD::FOR : X86ISD::FXOR;
13480 SDValue Operand = IsFNABS ? Op0.getOperand(0) : Op0;
13482 if (VT.isVector() || IsF128)
13483 return DAG.getNode(LogicOp, dl, LogicVT, Operand, Mask);
13485 // For the scalar case extend to a 128-bit vector, perform the logic op,
13486 // and extract the scalar result back out.
13487 Operand = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, LogicVT, Operand);
13488 SDValue LogicNode = DAG.getNode(LogicOp, dl, LogicVT, Operand, Mask);
13489 return DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, VT, LogicNode,
13490 DAG.getIntPtrConstant(0, dl));
13493 static SDValue LowerFCOPYSIGN(SDValue Op, SelectionDAG &DAG) {
13494 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
13495 LLVMContext *Context = DAG.getContext();
13496 SDValue Op0 = Op.getOperand(0);
13497 SDValue Op1 = Op.getOperand(1);
13499 MVT VT = Op.getSimpleValueType();
13500 MVT SrcVT = Op1.getSimpleValueType();
13501 bool IsF128 = (VT == MVT::f128);
13503 // If second operand is smaller, extend it first.
13504 if (SrcVT.bitsLT(VT)) {
13505 Op1 = DAG.getNode(ISD::FP_EXTEND, dl, VT, Op1);
13508 // And if it is bigger, shrink it first.
13509 if (SrcVT.bitsGT(VT)) {
13510 Op1 = DAG.getNode(ISD::FP_ROUND, dl, VT, Op1, DAG.getIntPtrConstant(1, dl));
13514 // At this point the operands and the result should have the same
13515 // type, and that won't be f80 since that is not custom lowered.
13516 assert((VT == MVT::f64 || VT == MVT::f32 || IsF128) &&
13517 "Unexpected type in LowerFCOPYSIGN");
13519 const fltSemantics &Sem =
13520 VT == MVT::f64 ? APFloat::IEEEdouble :
13521 (IsF128 ? APFloat::IEEEquad : APFloat::IEEEsingle);
13522 const unsigned SizeInBits = VT.getSizeInBits();
13524 SmallVector<Constant *, 4> CV(
13525 VT == MVT::f64 ? 2 : (IsF128 ? 1 : 4),
13526 ConstantFP::get(*Context, APFloat(Sem, APInt(SizeInBits, 0))));
13528 // First, clear all bits but the sign bit from the second operand (sign).
13529 CV[0] = ConstantFP::get(*Context,
13530 APFloat(Sem, APInt::getHighBitsSet(SizeInBits, 1)));
13531 Constant *C = ConstantVector::get(CV);
13532 auto PtrVT = TLI.getPointerTy(DAG.getDataLayout());
13533 SDValue CPIdx = DAG.getConstantPool(C, PtrVT, 16);
13535 // Perform all logic operations as 16-byte vectors because there are no
13536 // scalar FP logic instructions in SSE. This allows load folding of the
13537 // constants into the logic instructions.
13538 MVT LogicVT = (VT == MVT::f64) ? MVT::v2f64 : (IsF128 ? MVT::f128 : MVT::v4f32);
13540 DAG.getLoad(LogicVT, dl, DAG.getEntryNode(), CPIdx,
13541 MachinePointerInfo::getConstantPool(DAG.getMachineFunction()),
13542 false, false, false, 16);
13544 Op1 = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, LogicVT, Op1);
13545 SDValue SignBit = DAG.getNode(X86ISD::FAND, dl, LogicVT, Op1, Mask1);
13547 // Next, clear the sign bit from the first operand (magnitude).
13548 // If it's a constant, we can clear it here.
13549 if (ConstantFPSDNode *Op0CN = dyn_cast<ConstantFPSDNode>(Op0)) {
13550 APFloat APF = Op0CN->getValueAPF();
13551 // If the magnitude is a positive zero, the sign bit alone is enough.
13552 if (APF.isPosZero())
13553 return IsF128 ? SignBit :
13554 DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, SrcVT, SignBit,
13555 DAG.getIntPtrConstant(0, dl));
13557 CV[0] = ConstantFP::get(*Context, APF);
13559 CV[0] = ConstantFP::get(
13561 APFloat(Sem, APInt::getLowBitsSet(SizeInBits, SizeInBits - 1)));
13563 C = ConstantVector::get(CV);
13564 CPIdx = DAG.getConstantPool(C, PtrVT, 16);
13566 DAG.getLoad(LogicVT, dl, DAG.getEntryNode(), CPIdx,
13567 MachinePointerInfo::getConstantPool(DAG.getMachineFunction()),
13568 false, false, false, 16);
13569 // If the magnitude operand wasn't a constant, we need to AND out the sign.
13570 if (!isa<ConstantFPSDNode>(Op0)) {
13572 Op0 = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, LogicVT, Op0);
13573 Val = DAG.getNode(X86ISD::FAND, dl, LogicVT, Op0, Val);
13575 // OR the magnitude value with the sign bit.
13576 Val = DAG.getNode(X86ISD::FOR, dl, LogicVT, Val, SignBit);
13577 return IsF128 ? Val :
13578 DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, SrcVT, Val,
13579 DAG.getIntPtrConstant(0, dl));
13582 static SDValue LowerFGETSIGN(SDValue Op, SelectionDAG &DAG) {
13583 SDValue N0 = Op.getOperand(0);
13585 MVT VT = Op.getSimpleValueType();
13587 // Lower ISD::FGETSIGN to (AND (X86ISD::FGETSIGNx86 ...) 1).
13588 SDValue xFGETSIGN = DAG.getNode(X86ISD::FGETSIGNx86, dl, VT, N0,
13589 DAG.getConstant(1, dl, VT));
13590 return DAG.getNode(ISD::AND, dl, VT, xFGETSIGN, DAG.getConstant(1, dl, VT));
13593 // Check whether an OR'd tree is PTEST-able.
13594 static SDValue LowerVectorAllZeroTest(SDValue Op, const X86Subtarget *Subtarget,
13595 SelectionDAG &DAG) {
13596 assert(Op.getOpcode() == ISD::OR && "Only check OR'd tree.");
13598 if (!Subtarget->hasSSE41())
13601 if (!Op->hasOneUse())
13604 SDNode *N = Op.getNode();
13607 SmallVector<SDValue, 8> Opnds;
13608 DenseMap<SDValue, unsigned> VecInMap;
13609 SmallVector<SDValue, 8> VecIns;
13610 EVT VT = MVT::Other;
13612 // Recognize a special case where a vector is casted into wide integer to
13614 Opnds.push_back(N->getOperand(0));
13615 Opnds.push_back(N->getOperand(1));
13617 for (unsigned Slot = 0, e = Opnds.size(); Slot < e; ++Slot) {
13618 SmallVectorImpl<SDValue>::const_iterator I = Opnds.begin() + Slot;
13619 // BFS traverse all OR'd operands.
13620 if (I->getOpcode() == ISD::OR) {
13621 Opnds.push_back(I->getOperand(0));
13622 Opnds.push_back(I->getOperand(1));
13623 // Re-evaluate the number of nodes to be traversed.
13624 e += 2; // 2 more nodes (LHS and RHS) are pushed.
13628 // Quit if a non-EXTRACT_VECTOR_ELT
13629 if (I->getOpcode() != ISD::EXTRACT_VECTOR_ELT)
13632 // Quit if without a constant index.
13633 SDValue Idx = I->getOperand(1);
13634 if (!isa<ConstantSDNode>(Idx))
13637 SDValue ExtractedFromVec = I->getOperand(0);
13638 DenseMap<SDValue, unsigned>::iterator M = VecInMap.find(ExtractedFromVec);
13639 if (M == VecInMap.end()) {
13640 VT = ExtractedFromVec.getValueType();
13641 // Quit if not 128/256-bit vector.
13642 if (!VT.is128BitVector() && !VT.is256BitVector())
13644 // Quit if not the same type.
13645 if (VecInMap.begin() != VecInMap.end() &&
13646 VT != VecInMap.begin()->first.getValueType())
13648 M = VecInMap.insert(std::make_pair(ExtractedFromVec, 0)).first;
13649 VecIns.push_back(ExtractedFromVec);
13651 M->second |= 1U << cast<ConstantSDNode>(Idx)->getZExtValue();
13654 assert((VT.is128BitVector() || VT.is256BitVector()) &&
13655 "Not extracted from 128-/256-bit vector.");
13657 unsigned FullMask = (1U << VT.getVectorNumElements()) - 1U;
13659 for (DenseMap<SDValue, unsigned>::const_iterator
13660 I = VecInMap.begin(), E = VecInMap.end(); I != E; ++I) {
13661 // Quit if not all elements are used.
13662 if (I->second != FullMask)
13666 MVT TestVT = VT.is128BitVector() ? MVT::v2i64 : MVT::v4i64;
13668 // Cast all vectors into TestVT for PTEST.
13669 for (unsigned i = 0, e = VecIns.size(); i < e; ++i)
13670 VecIns[i] = DAG.getBitcast(TestVT, VecIns[i]);
13672 // If more than one full vectors are evaluated, OR them first before PTEST.
13673 for (unsigned Slot = 0, e = VecIns.size(); e - Slot > 1; Slot += 2, e += 1) {
13674 // Each iteration will OR 2 nodes and append the result until there is only
13675 // 1 node left, i.e. the final OR'd value of all vectors.
13676 SDValue LHS = VecIns[Slot];
13677 SDValue RHS = VecIns[Slot + 1];
13678 VecIns.push_back(DAG.getNode(ISD::OR, DL, TestVT, LHS, RHS));
13681 return DAG.getNode(X86ISD::PTEST, DL, MVT::i32,
13682 VecIns.back(), VecIns.back());
13685 /// \brief return true if \c Op has a use that doesn't just read flags.
13686 static bool hasNonFlagsUse(SDValue Op) {
13687 for (SDNode::use_iterator UI = Op->use_begin(), UE = Op->use_end(); UI != UE;
13689 SDNode *User = *UI;
13690 unsigned UOpNo = UI.getOperandNo();
13691 if (User->getOpcode() == ISD::TRUNCATE && User->hasOneUse()) {
13692 // Look pass truncate.
13693 UOpNo = User->use_begin().getOperandNo();
13694 User = *User->use_begin();
13697 if (User->getOpcode() != ISD::BRCOND && User->getOpcode() != ISD::SETCC &&
13698 !(User->getOpcode() == ISD::SELECT && UOpNo == 0))
13704 /// Emit nodes that will be selected as "test Op0,Op0", or something
13706 SDValue X86TargetLowering::EmitTest(SDValue Op, unsigned X86CC, SDLoc dl,
13707 SelectionDAG &DAG) const {
13708 if (Op.getValueType() == MVT::i1) {
13709 SDValue ExtOp = DAG.getNode(ISD::ZERO_EXTEND, dl, MVT::i8, Op);
13710 return DAG.getNode(X86ISD::CMP, dl, MVT::i32, ExtOp,
13711 DAG.getConstant(0, dl, MVT::i8));
13713 // CF and OF aren't always set the way we want. Determine which
13714 // of these we need.
13715 bool NeedCF = false;
13716 bool NeedOF = false;
13719 case X86::COND_A: case X86::COND_AE:
13720 case X86::COND_B: case X86::COND_BE:
13723 case X86::COND_G: case X86::COND_GE:
13724 case X86::COND_L: case X86::COND_LE:
13725 case X86::COND_O: case X86::COND_NO: {
13726 // Check if we really need to set the
13727 // Overflow flag. If NoSignedWrap is present
13728 // that is not actually needed.
13729 switch (Op->getOpcode()) {
13734 const auto *BinNode = cast<BinaryWithFlagsSDNode>(Op.getNode());
13735 if (BinNode->Flags.hasNoSignedWrap())
13745 // See if we can use the EFLAGS value from the operand instead of
13746 // doing a separate TEST. TEST always sets OF and CF to 0, so unless
13747 // we prove that the arithmetic won't overflow, we can't use OF or CF.
13748 if (Op.getResNo() != 0 || NeedOF || NeedCF) {
13749 // Emit a CMP with 0, which is the TEST pattern.
13750 //if (Op.getValueType() == MVT::i1)
13751 // return DAG.getNode(X86ISD::CMP, dl, MVT::i1, Op,
13752 // DAG.getConstant(0, MVT::i1));
13753 return DAG.getNode(X86ISD::CMP, dl, MVT::i32, Op,
13754 DAG.getConstant(0, dl, Op.getValueType()));
13756 unsigned Opcode = 0;
13757 unsigned NumOperands = 0;
13759 // Truncate operations may prevent the merge of the SETCC instruction
13760 // and the arithmetic instruction before it. Attempt to truncate the operands
13761 // of the arithmetic instruction and use a reduced bit-width instruction.
13762 bool NeedTruncation = false;
13763 SDValue ArithOp = Op;
13764 if (Op->getOpcode() == ISD::TRUNCATE && Op->hasOneUse()) {
13765 SDValue Arith = Op->getOperand(0);
13766 // Both the trunc and the arithmetic op need to have one user each.
13767 if (Arith->hasOneUse())
13768 switch (Arith.getOpcode()) {
13775 NeedTruncation = true;
13781 // NOTICE: In the code below we use ArithOp to hold the arithmetic operation
13782 // which may be the result of a CAST. We use the variable 'Op', which is the
13783 // non-casted variable when we check for possible users.
13784 switch (ArithOp.getOpcode()) {
13786 // Due to an isel shortcoming, be conservative if this add is likely to be
13787 // selected as part of a load-modify-store instruction. When the root node
13788 // in a match is a store, isel doesn't know how to remap non-chain non-flag
13789 // uses of other nodes in the match, such as the ADD in this case. This
13790 // leads to the ADD being left around and reselected, with the result being
13791 // two adds in the output. Alas, even if none our users are stores, that
13792 // doesn't prove we're O.K. Ergo, if we have any parents that aren't
13793 // CopyToReg or SETCC, eschew INC/DEC. A better fix seems to require
13794 // climbing the DAG back to the root, and it doesn't seem to be worth the
13796 for (SDNode::use_iterator UI = Op.getNode()->use_begin(),
13797 UE = Op.getNode()->use_end(); UI != UE; ++UI)
13798 if (UI->getOpcode() != ISD::CopyToReg &&
13799 UI->getOpcode() != ISD::SETCC &&
13800 UI->getOpcode() != ISD::STORE)
13803 if (ConstantSDNode *C =
13804 dyn_cast<ConstantSDNode>(ArithOp.getNode()->getOperand(1))) {
13805 // An add of one will be selected as an INC.
13806 if (C->isOne() && !Subtarget->slowIncDec()) {
13807 Opcode = X86ISD::INC;
13812 // An add of negative one (subtract of one) will be selected as a DEC.
13813 if (C->isAllOnesValue() && !Subtarget->slowIncDec()) {
13814 Opcode = X86ISD::DEC;
13820 // Otherwise use a regular EFLAGS-setting add.
13821 Opcode = X86ISD::ADD;
13826 // If we have a constant logical shift that's only used in a comparison
13827 // against zero turn it into an equivalent AND. This allows turning it into
13828 // a TEST instruction later.
13829 if ((X86CC == X86::COND_E || X86CC == X86::COND_NE) && Op->hasOneUse() &&
13830 isa<ConstantSDNode>(Op->getOperand(1)) && !hasNonFlagsUse(Op)) {
13831 EVT VT = Op.getValueType();
13832 unsigned BitWidth = VT.getSizeInBits();
13833 unsigned ShAmt = Op->getConstantOperandVal(1);
13834 if (ShAmt >= BitWidth) // Avoid undefined shifts.
13836 APInt Mask = ArithOp.getOpcode() == ISD::SRL
13837 ? APInt::getHighBitsSet(BitWidth, BitWidth - ShAmt)
13838 : APInt::getLowBitsSet(BitWidth, BitWidth - ShAmt);
13839 if (!Mask.isSignedIntN(32)) // Avoid large immediates.
13841 SDValue New = DAG.getNode(ISD::AND, dl, VT, Op->getOperand(0),
13842 DAG.getConstant(Mask, dl, VT));
13843 DAG.ReplaceAllUsesWith(Op, New);
13849 // If the primary and result isn't used, don't bother using X86ISD::AND,
13850 // because a TEST instruction will be better.
13851 if (!hasNonFlagsUse(Op))
13857 // Due to the ISEL shortcoming noted above, be conservative if this op is
13858 // likely to be selected as part of a load-modify-store instruction.
13859 for (SDNode::use_iterator UI = Op.getNode()->use_begin(),
13860 UE = Op.getNode()->use_end(); UI != UE; ++UI)
13861 if (UI->getOpcode() == ISD::STORE)
13864 // Otherwise use a regular EFLAGS-setting instruction.
13865 switch (ArithOp.getOpcode()) {
13866 default: llvm_unreachable("unexpected operator!");
13867 case ISD::SUB: Opcode = X86ISD::SUB; break;
13868 case ISD::XOR: Opcode = X86ISD::XOR; break;
13869 case ISD::AND: Opcode = X86ISD::AND; break;
13871 if (!NeedTruncation && (X86CC == X86::COND_E || X86CC == X86::COND_NE)) {
13872 SDValue EFLAGS = LowerVectorAllZeroTest(Op, Subtarget, DAG);
13873 if (EFLAGS.getNode())
13876 Opcode = X86ISD::OR;
13890 return SDValue(Op.getNode(), 1);
13896 // If we found that truncation is beneficial, perform the truncation and
13898 if (NeedTruncation) {
13899 EVT VT = Op.getValueType();
13900 SDValue WideVal = Op->getOperand(0);
13901 EVT WideVT = WideVal.getValueType();
13902 unsigned ConvertedOp = 0;
13903 // Use a target machine opcode to prevent further DAGCombine
13904 // optimizations that may separate the arithmetic operations
13905 // from the setcc node.
13906 switch (WideVal.getOpcode()) {
13908 case ISD::ADD: ConvertedOp = X86ISD::ADD; break;
13909 case ISD::SUB: ConvertedOp = X86ISD::SUB; break;
13910 case ISD::AND: ConvertedOp = X86ISD::AND; break;
13911 case ISD::OR: ConvertedOp = X86ISD::OR; break;
13912 case ISD::XOR: ConvertedOp = X86ISD::XOR; break;
13916 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
13917 if (TLI.isOperationLegal(WideVal.getOpcode(), WideVT)) {
13918 SDValue V0 = DAG.getNode(ISD::TRUNCATE, dl, VT, WideVal.getOperand(0));
13919 SDValue V1 = DAG.getNode(ISD::TRUNCATE, dl, VT, WideVal.getOperand(1));
13920 Op = DAG.getNode(ConvertedOp, dl, VT, V0, V1);
13926 // Emit a CMP with 0, which is the TEST pattern.
13927 return DAG.getNode(X86ISD::CMP, dl, MVT::i32, Op,
13928 DAG.getConstant(0, dl, Op.getValueType()));
13930 SDVTList VTs = DAG.getVTList(Op.getValueType(), MVT::i32);
13931 SmallVector<SDValue, 4> Ops(Op->op_begin(), Op->op_begin() + NumOperands);
13933 SDValue New = DAG.getNode(Opcode, dl, VTs, Ops);
13934 DAG.ReplaceAllUsesWith(Op, New);
13935 return SDValue(New.getNode(), 1);
13938 /// Emit nodes that will be selected as "cmp Op0,Op1", or something
13940 SDValue X86TargetLowering::EmitCmp(SDValue Op0, SDValue Op1, unsigned X86CC,
13941 SDLoc dl, SelectionDAG &DAG) const {
13942 if (isNullConstant(Op1))
13943 return EmitTest(Op0, X86CC, dl, DAG);
13945 assert(!(isa<ConstantSDNode>(Op1) && Op0.getValueType() == MVT::i1) &&
13946 "Unexpected comparison operation for MVT::i1 operands");
13948 if ((Op0.getValueType() == MVT::i8 || Op0.getValueType() == MVT::i16 ||
13949 Op0.getValueType() == MVT::i32 || Op0.getValueType() == MVT::i64)) {
13950 // Do the comparison at i32 if it's smaller, besides the Atom case.
13951 // This avoids subregister aliasing issues. Keep the smaller reference
13952 // if we're optimizing for size, however, as that'll allow better folding
13953 // of memory operations.
13954 if (Op0.getValueType() != MVT::i32 && Op0.getValueType() != MVT::i64 &&
13955 !DAG.getMachineFunction().getFunction()->optForMinSize() &&
13956 !Subtarget->isAtom()) {
13957 unsigned ExtendOp =
13958 isX86CCUnsigned(X86CC) ? ISD::ZERO_EXTEND : ISD::SIGN_EXTEND;
13959 Op0 = DAG.getNode(ExtendOp, dl, MVT::i32, Op0);
13960 Op1 = DAG.getNode(ExtendOp, dl, MVT::i32, Op1);
13962 // Use SUB instead of CMP to enable CSE between SUB and CMP.
13963 SDVTList VTs = DAG.getVTList(Op0.getValueType(), MVT::i32);
13964 SDValue Sub = DAG.getNode(X86ISD::SUB, dl, VTs,
13966 return SDValue(Sub.getNode(), 1);
13968 return DAG.getNode(X86ISD::CMP, dl, MVT::i32, Op0, Op1);
13971 /// Convert a comparison if required by the subtarget.
13972 SDValue X86TargetLowering::ConvertCmpIfNecessary(SDValue Cmp,
13973 SelectionDAG &DAG) const {
13974 // If the subtarget does not support the FUCOMI instruction, floating-point
13975 // comparisons have to be converted.
13976 if (Subtarget->hasCMov() ||
13977 Cmp.getOpcode() != X86ISD::CMP ||
13978 !Cmp.getOperand(0).getValueType().isFloatingPoint() ||
13979 !Cmp.getOperand(1).getValueType().isFloatingPoint())
13982 // The instruction selector will select an FUCOM instruction instead of
13983 // FUCOMI, which writes the comparison result to FPSW instead of EFLAGS. Hence
13984 // build an SDNode sequence that transfers the result from FPSW into EFLAGS:
13985 // (X86sahf (trunc (srl (X86fp_stsw (trunc (X86cmp ...)), 8))))
13987 SDValue TruncFPSW = DAG.getNode(ISD::TRUNCATE, dl, MVT::i16, Cmp);
13988 SDValue FNStSW = DAG.getNode(X86ISD::FNSTSW16r, dl, MVT::i16, TruncFPSW);
13989 SDValue Srl = DAG.getNode(ISD::SRL, dl, MVT::i16, FNStSW,
13990 DAG.getConstant(8, dl, MVT::i8));
13991 SDValue TruncSrl = DAG.getNode(ISD::TRUNCATE, dl, MVT::i8, Srl);
13993 // Some 64-bit targets lack SAHF support, but they do support FCOMI.
13994 assert(Subtarget->hasLAHFSAHF() && "Target doesn't support SAHF or FCOMI?");
13995 return DAG.getNode(X86ISD::SAHF, dl, MVT::i32, TruncSrl);
13998 /// The minimum architected relative accuracy is 2^-12. We need one
13999 /// Newton-Raphson step to have a good float result (24 bits of precision).
14000 SDValue X86TargetLowering::getRsqrtEstimate(SDValue Op,
14001 DAGCombinerInfo &DCI,
14002 unsigned &RefinementSteps,
14003 bool &UseOneConstNR) const {
14004 EVT VT = Op.getValueType();
14005 const char *RecipOp;
14007 // SSE1 has rsqrtss and rsqrtps. AVX adds a 256-bit variant for rsqrtps.
14008 // TODO: Add support for AVX512 (v16f32).
14009 // It is likely not profitable to do this for f64 because a double-precision
14010 // rsqrt estimate with refinement on x86 prior to FMA requires at least 16
14011 // instructions: convert to single, rsqrtss, convert back to double, refine
14012 // (3 steps = at least 13 insts). If an 'rsqrtsd' variant was added to the ISA
14013 // along with FMA, this could be a throughput win.
14014 if (VT == MVT::f32 && Subtarget->hasSSE1())
14016 else if ((VT == MVT::v4f32 && Subtarget->hasSSE1()) ||
14017 (VT == MVT::v8f32 && Subtarget->hasAVX()))
14018 RecipOp = "vec-sqrtf";
14022 TargetRecip Recips = DCI.DAG.getTarget().Options.Reciprocals;
14023 if (!Recips.isEnabled(RecipOp))
14026 RefinementSteps = Recips.getRefinementSteps(RecipOp);
14027 UseOneConstNR = false;
14028 return DCI.DAG.getNode(X86ISD::FRSQRT, SDLoc(Op), VT, Op);
14031 /// The minimum architected relative accuracy is 2^-12. We need one
14032 /// Newton-Raphson step to have a good float result (24 bits of precision).
14033 SDValue X86TargetLowering::getRecipEstimate(SDValue Op,
14034 DAGCombinerInfo &DCI,
14035 unsigned &RefinementSteps) const {
14036 EVT VT = Op.getValueType();
14037 const char *RecipOp;
14039 // SSE1 has rcpss and rcpps. AVX adds a 256-bit variant for rcpps.
14040 // TODO: Add support for AVX512 (v16f32).
14041 // It is likely not profitable to do this for f64 because a double-precision
14042 // reciprocal estimate with refinement on x86 prior to FMA requires
14043 // 15 instructions: convert to single, rcpss, convert back to double, refine
14044 // (3 steps = 12 insts). If an 'rcpsd' variant was added to the ISA
14045 // along with FMA, this could be a throughput win.
14046 if (VT == MVT::f32 && Subtarget->hasSSE1())
14048 else if ((VT == MVT::v4f32 && Subtarget->hasSSE1()) ||
14049 (VT == MVT::v8f32 && Subtarget->hasAVX()))
14050 RecipOp = "vec-divf";
14054 TargetRecip Recips = DCI.DAG.getTarget().Options.Reciprocals;
14055 if (!Recips.isEnabled(RecipOp))
14058 RefinementSteps = Recips.getRefinementSteps(RecipOp);
14059 return DCI.DAG.getNode(X86ISD::FRCP, SDLoc(Op), VT, Op);
14062 /// If we have at least two divisions that use the same divisor, convert to
14063 /// multplication by a reciprocal. This may need to be adjusted for a given
14064 /// CPU if a division's cost is not at least twice the cost of a multiplication.
14065 /// This is because we still need one division to calculate the reciprocal and
14066 /// then we need two multiplies by that reciprocal as replacements for the
14067 /// original divisions.
14068 unsigned X86TargetLowering::combineRepeatedFPDivisors() const {
14072 /// LowerToBT - Result of 'and' is compared against zero. Turn it into a BT node
14073 /// if it's possible.
14074 SDValue X86TargetLowering::LowerToBT(SDValue And, ISD::CondCode CC,
14075 SDLoc dl, SelectionDAG &DAG) const {
14076 SDValue Op0 = And.getOperand(0);
14077 SDValue Op1 = And.getOperand(1);
14078 if (Op0.getOpcode() == ISD::TRUNCATE)
14079 Op0 = Op0.getOperand(0);
14080 if (Op1.getOpcode() == ISD::TRUNCATE)
14081 Op1 = Op1.getOperand(0);
14084 if (Op1.getOpcode() == ISD::SHL)
14085 std::swap(Op0, Op1);
14086 if (Op0.getOpcode() == ISD::SHL) {
14087 if (isOneConstant(Op0.getOperand(0))) {
14088 // If we looked past a truncate, check that it's only truncating away
14090 unsigned BitWidth = Op0.getValueSizeInBits();
14091 unsigned AndBitWidth = And.getValueSizeInBits();
14092 if (BitWidth > AndBitWidth) {
14094 DAG.computeKnownBits(Op0, Zeros, Ones);
14095 if (Zeros.countLeadingOnes() < BitWidth - AndBitWidth)
14099 RHS = Op0.getOperand(1);
14101 } else if (Op1.getOpcode() == ISD::Constant) {
14102 ConstantSDNode *AndRHS = cast<ConstantSDNode>(Op1);
14103 uint64_t AndRHSVal = AndRHS->getZExtValue();
14104 SDValue AndLHS = Op0;
14106 if (AndRHSVal == 1 && AndLHS.getOpcode() == ISD::SRL) {
14107 LHS = AndLHS.getOperand(0);
14108 RHS = AndLHS.getOperand(1);
14111 // Use BT if the immediate can't be encoded in a TEST instruction.
14112 if (!isUInt<32>(AndRHSVal) && isPowerOf2_64(AndRHSVal)) {
14114 RHS = DAG.getConstant(Log2_64_Ceil(AndRHSVal), dl, LHS.getValueType());
14118 if (LHS.getNode()) {
14119 // If LHS is i8, promote it to i32 with any_extend. There is no i8 BT
14120 // instruction. Since the shift amount is in-range-or-undefined, we know
14121 // that doing a bittest on the i32 value is ok. We extend to i32 because
14122 // the encoding for the i16 version is larger than the i32 version.
14123 // Also promote i16 to i32 for performance / code size reason.
14124 if (LHS.getValueType() == MVT::i8 ||
14125 LHS.getValueType() == MVT::i16)
14126 LHS = DAG.getNode(ISD::ANY_EXTEND, dl, MVT::i32, LHS);
14128 // If the operand types disagree, extend the shift amount to match. Since
14129 // BT ignores high bits (like shifts) we can use anyextend.
14130 if (LHS.getValueType() != RHS.getValueType())
14131 RHS = DAG.getNode(ISD::ANY_EXTEND, dl, LHS.getValueType(), RHS);
14133 SDValue BT = DAG.getNode(X86ISD::BT, dl, MVT::i32, LHS, RHS);
14134 X86::CondCode Cond = CC == ISD::SETEQ ? X86::COND_AE : X86::COND_B;
14135 return DAG.getNode(X86ISD::SETCC, dl, MVT::i8,
14136 DAG.getConstant(Cond, dl, MVT::i8), BT);
14142 /// \brief - Turns an ISD::CondCode into a value suitable for SSE floating point
14144 static int translateX86FSETCC(ISD::CondCode SetCCOpcode, SDValue &Op0,
14149 // SSE Condition code mapping:
14158 switch (SetCCOpcode) {
14159 default: llvm_unreachable("Unexpected SETCC condition");
14161 case ISD::SETEQ: SSECC = 0; break;
14163 case ISD::SETGT: Swap = true; // Fallthrough
14165 case ISD::SETOLT: SSECC = 1; break;
14167 case ISD::SETGE: Swap = true; // Fallthrough
14169 case ISD::SETOLE: SSECC = 2; break;
14170 case ISD::SETUO: SSECC = 3; break;
14172 case ISD::SETNE: SSECC = 4; break;
14173 case ISD::SETULE: Swap = true; // Fallthrough
14174 case ISD::SETUGE: SSECC = 5; break;
14175 case ISD::SETULT: Swap = true; // Fallthrough
14176 case ISD::SETUGT: SSECC = 6; break;
14177 case ISD::SETO: SSECC = 7; break;
14179 case ISD::SETONE: SSECC = 8; break;
14182 std::swap(Op0, Op1);
14187 // Lower256IntVSETCC - Break a VSETCC 256-bit integer VSETCC into two new 128
14188 // ones, and then concatenate the result back.
14189 static SDValue Lower256IntVSETCC(SDValue Op, SelectionDAG &DAG) {
14190 MVT VT = Op.getSimpleValueType();
14192 assert(VT.is256BitVector() && Op.getOpcode() == ISD::SETCC &&
14193 "Unsupported value type for operation");
14195 unsigned NumElems = VT.getVectorNumElements();
14197 SDValue CC = Op.getOperand(2);
14199 // Extract the LHS vectors
14200 SDValue LHS = Op.getOperand(0);
14201 SDValue LHS1 = Extract128BitVector(LHS, 0, DAG, dl);
14202 SDValue LHS2 = Extract128BitVector(LHS, NumElems/2, DAG, dl);
14204 // Extract the RHS vectors
14205 SDValue RHS = Op.getOperand(1);
14206 SDValue RHS1 = Extract128BitVector(RHS, 0, DAG, dl);
14207 SDValue RHS2 = Extract128BitVector(RHS, NumElems/2, DAG, dl);
14209 // Issue the operation on the smaller types and concatenate the result back
14210 MVT EltVT = VT.getVectorElementType();
14211 MVT NewVT = MVT::getVectorVT(EltVT, NumElems/2);
14212 return DAG.getNode(ISD::CONCAT_VECTORS, dl, VT,
14213 DAG.getNode(Op.getOpcode(), dl, NewVT, LHS1, RHS1, CC),
14214 DAG.getNode(Op.getOpcode(), dl, NewVT, LHS2, RHS2, CC));
14217 static SDValue LowerBoolVSETCC_AVX512(SDValue Op, SelectionDAG &DAG) {
14218 SDValue Op0 = Op.getOperand(0);
14219 SDValue Op1 = Op.getOperand(1);
14220 SDValue CC = Op.getOperand(2);
14221 MVT VT = Op.getSimpleValueType();
14224 assert(Op0.getSimpleValueType().getVectorElementType() == MVT::i1 &&
14225 "Unexpected type for boolean compare operation");
14226 ISD::CondCode SetCCOpcode = cast<CondCodeSDNode>(CC)->get();
14227 SDValue NotOp0 = DAG.getNode(ISD::XOR, dl, VT, Op0,
14228 DAG.getConstant(-1, dl, VT));
14229 SDValue NotOp1 = DAG.getNode(ISD::XOR, dl, VT, Op1,
14230 DAG.getConstant(-1, dl, VT));
14231 switch (SetCCOpcode) {
14232 default: llvm_unreachable("Unexpected SETCC condition");
14234 // (x == y) -> ~(x ^ y)
14235 return DAG.getNode(ISD::XOR, dl, VT,
14236 DAG.getNode(ISD::XOR, dl, VT, Op0, Op1),
14237 DAG.getConstant(-1, dl, VT));
14239 // (x != y) -> (x ^ y)
14240 return DAG.getNode(ISD::XOR, dl, VT, Op0, Op1);
14243 // (x > y) -> (x & ~y)
14244 return DAG.getNode(ISD::AND, dl, VT, Op0, NotOp1);
14247 // (x < y) -> (~x & y)
14248 return DAG.getNode(ISD::AND, dl, VT, NotOp0, Op1);
14251 // (x <= y) -> (~x | y)
14252 return DAG.getNode(ISD::OR, dl, VT, NotOp0, Op1);
14255 // (x >=y) -> (x | ~y)
14256 return DAG.getNode(ISD::OR, dl, VT, Op0, NotOp1);
14260 static SDValue LowerIntVSETCC_AVX512(SDValue Op, SelectionDAG &DAG,
14261 const X86Subtarget *Subtarget) {
14262 SDValue Op0 = Op.getOperand(0);
14263 SDValue Op1 = Op.getOperand(1);
14264 SDValue CC = Op.getOperand(2);
14265 MVT VT = Op.getSimpleValueType();
14268 assert(Op0.getSimpleValueType().getVectorElementType().getSizeInBits() >= 8 &&
14269 Op.getSimpleValueType().getVectorElementType() == MVT::i1 &&
14270 "Cannot set masked compare for this operation");
14272 ISD::CondCode SetCCOpcode = cast<CondCodeSDNode>(CC)->get();
14274 bool Unsigned = false;
14277 switch (SetCCOpcode) {
14278 default: llvm_unreachable("Unexpected SETCC condition");
14279 case ISD::SETNE: SSECC = 4; break;
14280 case ISD::SETEQ: Opc = X86ISD::PCMPEQM; break;
14281 case ISD::SETUGT: SSECC = 6; Unsigned = true; break;
14282 case ISD::SETLT: Swap = true; //fall-through
14283 case ISD::SETGT: Opc = X86ISD::PCMPGTM; break;
14284 case ISD::SETULT: SSECC = 1; Unsigned = true; break;
14285 case ISD::SETUGE: SSECC = 5; Unsigned = true; break; //NLT
14286 case ISD::SETGE: Swap = true; SSECC = 2; break; // LE + swap
14287 case ISD::SETULE: Unsigned = true; //fall-through
14288 case ISD::SETLE: SSECC = 2; break;
14292 std::swap(Op0, Op1);
14294 return DAG.getNode(Opc, dl, VT, Op0, Op1);
14295 Opc = Unsigned ? X86ISD::CMPMU: X86ISD::CMPM;
14296 return DAG.getNode(Opc, dl, VT, Op0, Op1,
14297 DAG.getConstant(SSECC, dl, MVT::i8));
14300 /// \brief Try to turn a VSETULT into a VSETULE by modifying its second
14301 /// operand \p Op1. If non-trivial (for example because it's not constant)
14302 /// return an empty value.
14303 static SDValue ChangeVSETULTtoVSETULE(SDLoc dl, SDValue Op1, SelectionDAG &DAG)
14305 BuildVectorSDNode *BV = dyn_cast<BuildVectorSDNode>(Op1.getNode());
14309 MVT VT = Op1.getSimpleValueType();
14310 MVT EVT = VT.getVectorElementType();
14311 unsigned n = VT.getVectorNumElements();
14312 SmallVector<SDValue, 8> ULTOp1;
14314 for (unsigned i = 0; i < n; ++i) {
14315 ConstantSDNode *Elt = dyn_cast<ConstantSDNode>(BV->getOperand(i));
14316 if (!Elt || Elt->isOpaque() || Elt->getSimpleValueType(0) != EVT)
14319 // Avoid underflow.
14320 APInt Val = Elt->getAPIntValue();
14324 ULTOp1.push_back(DAG.getConstant(Val - 1, dl, EVT));
14327 return DAG.getNode(ISD::BUILD_VECTOR, dl, VT, ULTOp1);
14330 static SDValue LowerVSETCC(SDValue Op, const X86Subtarget *Subtarget,
14331 SelectionDAG &DAG) {
14332 SDValue Op0 = Op.getOperand(0);
14333 SDValue Op1 = Op.getOperand(1);
14334 SDValue CC = Op.getOperand(2);
14335 MVT VT = Op.getSimpleValueType();
14336 ISD::CondCode SetCCOpcode = cast<CondCodeSDNode>(CC)->get();
14337 bool isFP = Op.getOperand(1).getSimpleValueType().isFloatingPoint();
14342 MVT EltVT = Op0.getSimpleValueType().getVectorElementType();
14343 assert(EltVT == MVT::f32 || EltVT == MVT::f64);
14346 unsigned SSECC = translateX86FSETCC(SetCCOpcode, Op0, Op1);
14347 unsigned Opc = X86ISD::CMPP;
14348 if (Subtarget->hasAVX512() && VT.getVectorElementType() == MVT::i1) {
14349 assert(VT.getVectorNumElements() <= 16);
14350 Opc = X86ISD::CMPM;
14352 // In the two special cases we can't handle, emit two comparisons.
14355 unsigned CombineOpc;
14356 if (SetCCOpcode == ISD::SETUEQ) {
14357 CC0 = 3; CC1 = 0; CombineOpc = ISD::OR;
14359 assert(SetCCOpcode == ISD::SETONE);
14360 CC0 = 7; CC1 = 4; CombineOpc = ISD::AND;
14363 SDValue Cmp0 = DAG.getNode(Opc, dl, VT, Op0, Op1,
14364 DAG.getConstant(CC0, dl, MVT::i8));
14365 SDValue Cmp1 = DAG.getNode(Opc, dl, VT, Op0, Op1,
14366 DAG.getConstant(CC1, dl, MVT::i8));
14367 return DAG.getNode(CombineOpc, dl, VT, Cmp0, Cmp1);
14369 // Handle all other FP comparisons here.
14370 return DAG.getNode(Opc, dl, VT, Op0, Op1,
14371 DAG.getConstant(SSECC, dl, MVT::i8));
14374 MVT VTOp0 = Op0.getSimpleValueType();
14375 assert(VTOp0 == Op1.getSimpleValueType() &&
14376 "Expected operands with same type!");
14377 assert(VT.getVectorNumElements() == VTOp0.getVectorNumElements() &&
14378 "Invalid number of packed elements for source and destination!");
14380 if (VT.is128BitVector() && VTOp0.is256BitVector()) {
14381 // On non-AVX512 targets, a vector of MVT::i1 is promoted by the type
14382 // legalizer to a wider vector type. In the case of 'vsetcc' nodes, the
14383 // legalizer firstly checks if the first operand in input to the setcc has
14384 // a legal type. If so, then it promotes the return type to that same type.
14385 // Otherwise, the return type is promoted to the 'next legal type' which,
14386 // for a vector of MVT::i1 is always a 128-bit integer vector type.
14388 // We reach this code only if the following two conditions are met:
14389 // 1. Both return type and operand type have been promoted to wider types
14390 // by the type legalizer.
14391 // 2. The original operand type has been promoted to a 256-bit vector.
14393 // Note that condition 2. only applies for AVX targets.
14394 SDValue NewOp = DAG.getSetCC(dl, VTOp0, Op0, Op1, SetCCOpcode);
14395 return DAG.getZExtOrTrunc(NewOp, dl, VT);
14398 // The non-AVX512 code below works under the assumption that source and
14399 // destination types are the same.
14400 assert((Subtarget->hasAVX512() || (VT == VTOp0)) &&
14401 "Value types for source and destination must be the same!");
14403 // Break 256-bit integer vector compare into smaller ones.
14404 if (VT.is256BitVector() && !Subtarget->hasInt256())
14405 return Lower256IntVSETCC(Op, DAG);
14407 MVT OpVT = Op1.getSimpleValueType();
14408 if (OpVT.getVectorElementType() == MVT::i1)
14409 return LowerBoolVSETCC_AVX512(Op, DAG);
14411 bool MaskResult = (VT.getVectorElementType() == MVT::i1);
14412 if (Subtarget->hasAVX512()) {
14413 if (Op1.getSimpleValueType().is512BitVector() ||
14414 (Subtarget->hasBWI() && Subtarget->hasVLX()) ||
14415 (MaskResult && OpVT.getVectorElementType().getSizeInBits() >= 32))
14416 return LowerIntVSETCC_AVX512(Op, DAG, Subtarget);
14418 // In AVX-512 architecture setcc returns mask with i1 elements,
14419 // But there is no compare instruction for i8 and i16 elements in KNL.
14420 // We are not talking about 512-bit operands in this case, these
14421 // types are illegal.
14423 (OpVT.getVectorElementType().getSizeInBits() < 32 &&
14424 OpVT.getVectorElementType().getSizeInBits() >= 8))
14425 return DAG.getNode(ISD::TRUNCATE, dl, VT,
14426 DAG.getNode(ISD::SETCC, dl, OpVT, Op0, Op1, CC));
14429 // Lower using XOP integer comparisons.
14430 if ((VT == MVT::v16i8 || VT == MVT::v8i16 ||
14431 VT == MVT::v4i32 || VT == MVT::v2i64) && Subtarget->hasXOP()) {
14432 // Translate compare code to XOP PCOM compare mode.
14433 unsigned CmpMode = 0;
14434 switch (SetCCOpcode) {
14435 default: llvm_unreachable("Unexpected SETCC condition");
14437 case ISD::SETLT: CmpMode = 0x00; break;
14439 case ISD::SETLE: CmpMode = 0x01; break;
14441 case ISD::SETGT: CmpMode = 0x02; break;
14443 case ISD::SETGE: CmpMode = 0x03; break;
14444 case ISD::SETEQ: CmpMode = 0x04; break;
14445 case ISD::SETNE: CmpMode = 0x05; break;
14448 // Are we comparing unsigned or signed integers?
14449 unsigned Opc = ISD::isUnsignedIntSetCC(SetCCOpcode)
14450 ? X86ISD::VPCOMU : X86ISD::VPCOM;
14452 return DAG.getNode(Opc, dl, VT, Op0, Op1,
14453 DAG.getConstant(CmpMode, dl, MVT::i8));
14456 // We are handling one of the integer comparisons here. Since SSE only has
14457 // GT and EQ comparisons for integer, swapping operands and multiple
14458 // operations may be required for some comparisons.
14460 bool Swap = false, Invert = false, FlipSigns = false, MinMax = false;
14461 bool Subus = false;
14463 switch (SetCCOpcode) {
14464 default: llvm_unreachable("Unexpected SETCC condition");
14465 case ISD::SETNE: Invert = true;
14466 case ISD::SETEQ: Opc = X86ISD::PCMPEQ; break;
14467 case ISD::SETLT: Swap = true;
14468 case ISD::SETGT: Opc = X86ISD::PCMPGT; break;
14469 case ISD::SETGE: Swap = true;
14470 case ISD::SETLE: Opc = X86ISD::PCMPGT;
14471 Invert = true; break;
14472 case ISD::SETULT: Swap = true;
14473 case ISD::SETUGT: Opc = X86ISD::PCMPGT;
14474 FlipSigns = true; break;
14475 case ISD::SETUGE: Swap = true;
14476 case ISD::SETULE: Opc = X86ISD::PCMPGT;
14477 FlipSigns = true; Invert = true; break;
14480 // Special case: Use min/max operations for SETULE/SETUGE
14481 MVT VET = VT.getVectorElementType();
14483 (Subtarget->hasSSE41() && (VET >= MVT::i8 && VET <= MVT::i32))
14484 || (Subtarget->hasSSE2() && (VET == MVT::i8));
14487 switch (SetCCOpcode) {
14489 case ISD::SETULE: Opc = ISD::UMIN; MinMax = true; break;
14490 case ISD::SETUGE: Opc = ISD::UMAX; MinMax = true; break;
14493 if (MinMax) { Swap = false; Invert = false; FlipSigns = false; }
14496 bool hasSubus = Subtarget->hasSSE2() && (VET == MVT::i8 || VET == MVT::i16);
14497 if (!MinMax && hasSubus) {
14498 // As another special case, use PSUBUS[BW] when it's profitable. E.g. for
14500 // t = psubus Op0, Op1
14501 // pcmpeq t, <0..0>
14502 switch (SetCCOpcode) {
14504 case ISD::SETULT: {
14505 // If the comparison is against a constant we can turn this into a
14506 // setule. With psubus, setule does not require a swap. This is
14507 // beneficial because the constant in the register is no longer
14508 // destructed as the destination so it can be hoisted out of a loop.
14509 // Only do this pre-AVX since vpcmp* is no longer destructive.
14510 if (Subtarget->hasAVX())
14512 SDValue ULEOp1 = ChangeVSETULTtoVSETULE(dl, Op1, DAG);
14513 if (ULEOp1.getNode()) {
14515 Subus = true; Invert = false; Swap = false;
14519 // Psubus is better than flip-sign because it requires no inversion.
14520 case ISD::SETUGE: Subus = true; Invert = false; Swap = true; break;
14521 case ISD::SETULE: Subus = true; Invert = false; Swap = false; break;
14525 Opc = X86ISD::SUBUS;
14531 std::swap(Op0, Op1);
14533 // Check that the operation in question is available (most are plain SSE2,
14534 // but PCMPGTQ and PCMPEQQ have different requirements).
14535 if (VT == MVT::v2i64) {
14536 if (Opc == X86ISD::PCMPGT && !Subtarget->hasSSE42()) {
14537 assert(Subtarget->hasSSE2() && "Don't know how to lower!");
14539 // First cast everything to the right type.
14540 Op0 = DAG.getBitcast(MVT::v4i32, Op0);
14541 Op1 = DAG.getBitcast(MVT::v4i32, Op1);
14543 // Since SSE has no unsigned integer comparisons, we need to flip the sign
14544 // bits of the inputs before performing those operations. The lower
14545 // compare is always unsigned.
14548 SB = DAG.getConstant(0x80000000U, dl, MVT::v4i32);
14550 SDValue Sign = DAG.getConstant(0x80000000U, dl, MVT::i32);
14551 SDValue Zero = DAG.getConstant(0x00000000U, dl, MVT::i32);
14552 SB = DAG.getNode(ISD::BUILD_VECTOR, dl, MVT::v4i32,
14553 Sign, Zero, Sign, Zero);
14555 Op0 = DAG.getNode(ISD::XOR, dl, MVT::v4i32, Op0, SB);
14556 Op1 = DAG.getNode(ISD::XOR, dl, MVT::v4i32, Op1, SB);
14558 // Emulate PCMPGTQ with (hi1 > hi2) | ((hi1 == hi2) & (lo1 > lo2))
14559 SDValue GT = DAG.getNode(X86ISD::PCMPGT, dl, MVT::v4i32, Op0, Op1);
14560 SDValue EQ = DAG.getNode(X86ISD::PCMPEQ, dl, MVT::v4i32, Op0, Op1);
14562 // Create masks for only the low parts/high parts of the 64 bit integers.
14563 static const int MaskHi[] = { 1, 1, 3, 3 };
14564 static const int MaskLo[] = { 0, 0, 2, 2 };
14565 SDValue EQHi = DAG.getVectorShuffle(MVT::v4i32, dl, EQ, EQ, MaskHi);
14566 SDValue GTLo = DAG.getVectorShuffle(MVT::v4i32, dl, GT, GT, MaskLo);
14567 SDValue GTHi = DAG.getVectorShuffle(MVT::v4i32, dl, GT, GT, MaskHi);
14569 SDValue Result = DAG.getNode(ISD::AND, dl, MVT::v4i32, EQHi, GTLo);
14570 Result = DAG.getNode(ISD::OR, dl, MVT::v4i32, Result, GTHi);
14573 Result = DAG.getNOT(dl, Result, MVT::v4i32);
14575 return DAG.getBitcast(VT, Result);
14578 if (Opc == X86ISD::PCMPEQ && !Subtarget->hasSSE41()) {
14579 // If pcmpeqq is missing but pcmpeqd is available synthesize pcmpeqq with
14580 // pcmpeqd + pshufd + pand.
14581 assert(Subtarget->hasSSE2() && !FlipSigns && "Don't know how to lower!");
14583 // First cast everything to the right type.
14584 Op0 = DAG.getBitcast(MVT::v4i32, Op0);
14585 Op1 = DAG.getBitcast(MVT::v4i32, Op1);
14588 SDValue Result = DAG.getNode(Opc, dl, MVT::v4i32, Op0, Op1);
14590 // Make sure the lower and upper halves are both all-ones.
14591 static const int Mask[] = { 1, 0, 3, 2 };
14592 SDValue Shuf = DAG.getVectorShuffle(MVT::v4i32, dl, Result, Result, Mask);
14593 Result = DAG.getNode(ISD::AND, dl, MVT::v4i32, Result, Shuf);
14596 Result = DAG.getNOT(dl, Result, MVT::v4i32);
14598 return DAG.getBitcast(VT, Result);
14602 // Since SSE has no unsigned integer comparisons, we need to flip the sign
14603 // bits of the inputs before performing those operations.
14605 MVT EltVT = VT.getVectorElementType();
14606 SDValue SB = DAG.getConstant(APInt::getSignBit(EltVT.getSizeInBits()), dl,
14608 Op0 = DAG.getNode(ISD::XOR, dl, VT, Op0, SB);
14609 Op1 = DAG.getNode(ISD::XOR, dl, VT, Op1, SB);
14612 SDValue Result = DAG.getNode(Opc, dl, VT, Op0, Op1);
14614 // If the logical-not of the result is required, perform that now.
14616 Result = DAG.getNOT(dl, Result, VT);
14619 Result = DAG.getNode(X86ISD::PCMPEQ, dl, VT, Op0, Result);
14622 Result = DAG.getNode(X86ISD::PCMPEQ, dl, VT, Result,
14623 getZeroVector(VT, Subtarget, DAG, dl));
14628 SDValue X86TargetLowering::LowerSETCC(SDValue Op, SelectionDAG &DAG) const {
14630 MVT VT = Op.getSimpleValueType();
14632 if (VT.isVector()) return LowerVSETCC(Op, Subtarget, DAG);
14634 assert(((!Subtarget->hasAVX512() && VT == MVT::i8) || (VT == MVT::i1))
14635 && "SetCC type must be 8-bit or 1-bit integer");
14636 SDValue Op0 = Op.getOperand(0);
14637 SDValue Op1 = Op.getOperand(1);
14639 ISD::CondCode CC = cast<CondCodeSDNode>(Op.getOperand(2))->get();
14641 // Optimize to BT if possible.
14642 // Lower (X & (1 << N)) == 0 to BT(X, N).
14643 // Lower ((X >>u N) & 1) != 0 to BT(X, N).
14644 // Lower ((X >>s N) & 1) != 0 to BT(X, N).
14645 if (Op0.getOpcode() == ISD::AND && Op0.hasOneUse() &&
14646 isNullConstant(Op1) &&
14647 (CC == ISD::SETEQ || CC == ISD::SETNE)) {
14648 if (SDValue NewSetCC = LowerToBT(Op0, CC, dl, DAG)) {
14650 return DAG.getNode(ISD::TRUNCATE, dl, MVT::i1, NewSetCC);
14655 // Look for X == 0, X == 1, X != 0, or X != 1. We can simplify some forms of
14657 if ((isOneConstant(Op1) || isNullConstant(Op1)) &&
14658 (CC == ISD::SETEQ || CC == ISD::SETNE)) {
14660 // If the input is a setcc, then reuse the input setcc or use a new one with
14661 // the inverted condition.
14662 if (Op0.getOpcode() == X86ISD::SETCC) {
14663 X86::CondCode CCode = (X86::CondCode)Op0.getConstantOperandVal(0);
14664 bool Invert = (CC == ISD::SETNE) ^ isNullConstant(Op1);
14668 CCode = X86::GetOppositeBranchCondition(CCode);
14669 SDValue SetCC = DAG.getNode(X86ISD::SETCC, dl, MVT::i8,
14670 DAG.getConstant(CCode, dl, MVT::i8),
14671 Op0.getOperand(1));
14673 return DAG.getNode(ISD::TRUNCATE, dl, MVT::i1, SetCC);
14677 if ((Op0.getValueType() == MVT::i1) && isOneConstant(Op1) &&
14678 (CC == ISD::SETEQ || CC == ISD::SETNE)) {
14680 ISD::CondCode NewCC = ISD::getSetCCInverse(CC, true);
14681 return DAG.getSetCC(dl, VT, Op0, DAG.getConstant(0, dl, MVT::i1), NewCC);
14684 bool isFP = Op1.getSimpleValueType().isFloatingPoint();
14685 unsigned X86CC = TranslateX86CC(CC, dl, isFP, Op0, Op1, DAG);
14686 if (X86CC == X86::COND_INVALID)
14689 SDValue EFLAGS = EmitCmp(Op0, Op1, X86CC, dl, DAG);
14690 EFLAGS = ConvertCmpIfNecessary(EFLAGS, DAG);
14691 SDValue SetCC = DAG.getNode(X86ISD::SETCC, dl, MVT::i8,
14692 DAG.getConstant(X86CC, dl, MVT::i8), EFLAGS);
14694 return DAG.getNode(ISD::TRUNCATE, dl, MVT::i1, SetCC);
14698 SDValue X86TargetLowering::LowerSETCCE(SDValue Op, SelectionDAG &DAG) const {
14699 SDValue LHS = Op.getOperand(0);
14700 SDValue RHS = Op.getOperand(1);
14701 SDValue Carry = Op.getOperand(2);
14702 SDValue Cond = Op.getOperand(3);
14705 assert(LHS.getSimpleValueType().isInteger() && "SETCCE is integer only.");
14706 X86::CondCode CC = TranslateIntegerX86CC(cast<CondCodeSDNode>(Cond)->get());
14708 assert(Carry.getOpcode() != ISD::CARRY_FALSE);
14709 SDVTList VTs = DAG.getVTList(LHS.getValueType(), MVT::i32);
14710 SDValue Cmp = DAG.getNode(X86ISD::SBB, DL, VTs, LHS, RHS, Carry);
14711 return DAG.getNode(X86ISD::SETCC, DL, Op.getValueType(),
14712 DAG.getConstant(CC, DL, MVT::i8), Cmp.getValue(1));
14715 // isX86LogicalCmp - Return true if opcode is a X86 logical comparison.
14716 static bool isX86LogicalCmp(SDValue Op) {
14717 unsigned Opc = Op.getNode()->getOpcode();
14718 if (Opc == X86ISD::CMP || Opc == X86ISD::COMI || Opc == X86ISD::UCOMI ||
14719 Opc == X86ISD::SAHF)
14721 if (Op.getResNo() == 1 &&
14722 (Opc == X86ISD::ADD ||
14723 Opc == X86ISD::SUB ||
14724 Opc == X86ISD::ADC ||
14725 Opc == X86ISD::SBB ||
14726 Opc == X86ISD::SMUL ||
14727 Opc == X86ISD::UMUL ||
14728 Opc == X86ISD::INC ||
14729 Opc == X86ISD::DEC ||
14730 Opc == X86ISD::OR ||
14731 Opc == X86ISD::XOR ||
14732 Opc == X86ISD::AND))
14735 if (Op.getResNo() == 2 && Opc == X86ISD::UMUL)
14741 static bool isTruncWithZeroHighBitsInput(SDValue V, SelectionDAG &DAG) {
14742 if (V.getOpcode() != ISD::TRUNCATE)
14745 SDValue VOp0 = V.getOperand(0);
14746 unsigned InBits = VOp0.getValueSizeInBits();
14747 unsigned Bits = V.getValueSizeInBits();
14748 return DAG.MaskedValueIsZero(VOp0, APInt::getHighBitsSet(InBits,InBits-Bits));
14751 SDValue X86TargetLowering::LowerSELECT(SDValue Op, SelectionDAG &DAG) const {
14752 bool addTest = true;
14753 SDValue Cond = Op.getOperand(0);
14754 SDValue Op1 = Op.getOperand(1);
14755 SDValue Op2 = Op.getOperand(2);
14757 MVT VT = Op1.getSimpleValueType();
14760 // Lower FP selects into a CMP/AND/ANDN/OR sequence when the necessary SSE ops
14761 // are available or VBLENDV if AVX is available.
14762 // Otherwise FP cmovs get lowered into a less efficient branch sequence later.
14763 if (Cond.getOpcode() == ISD::SETCC &&
14764 ((Subtarget->hasSSE2() && (VT == MVT::f32 || VT == MVT::f64)) ||
14765 (Subtarget->hasSSE1() && VT == MVT::f32)) &&
14766 VT == Cond.getOperand(0).getSimpleValueType() && Cond->hasOneUse()) {
14767 SDValue CondOp0 = Cond.getOperand(0), CondOp1 = Cond.getOperand(1);
14768 int SSECC = translateX86FSETCC(
14769 cast<CondCodeSDNode>(Cond.getOperand(2))->get(), CondOp0, CondOp1);
14772 if (Subtarget->hasAVX512()) {
14773 SDValue Cmp = DAG.getNode(X86ISD::FSETCC, DL, MVT::i1, CondOp0, CondOp1,
14774 DAG.getConstant(SSECC, DL, MVT::i8));
14775 return DAG.getNode(X86ISD::SELECT, DL, VT, Cmp, Op1, Op2);
14778 SDValue Cmp = DAG.getNode(X86ISD::FSETCC, DL, VT, CondOp0, CondOp1,
14779 DAG.getConstant(SSECC, DL, MVT::i8));
14781 // If we have AVX, we can use a variable vector select (VBLENDV) instead
14782 // of 3 logic instructions for size savings and potentially speed.
14783 // Unfortunately, there is no scalar form of VBLENDV.
14785 // If either operand is a constant, don't try this. We can expect to
14786 // optimize away at least one of the logic instructions later in that
14787 // case, so that sequence would be faster than a variable blend.
14789 // BLENDV was introduced with SSE 4.1, but the 2 register form implicitly
14790 // uses XMM0 as the selection register. That may need just as many
14791 // instructions as the AND/ANDN/OR sequence due to register moves, so
14794 if (Subtarget->hasAVX() &&
14795 !isa<ConstantFPSDNode>(Op1) && !isa<ConstantFPSDNode>(Op2)) {
14797 // Convert to vectors, do a VSELECT, and convert back to scalar.
14798 // All of the conversions should be optimized away.
14800 MVT VecVT = VT == MVT::f32 ? MVT::v4f32 : MVT::v2f64;
14801 SDValue VOp1 = DAG.getNode(ISD::SCALAR_TO_VECTOR, DL, VecVT, Op1);
14802 SDValue VOp2 = DAG.getNode(ISD::SCALAR_TO_VECTOR, DL, VecVT, Op2);
14803 SDValue VCmp = DAG.getNode(ISD::SCALAR_TO_VECTOR, DL, VecVT, Cmp);
14805 MVT VCmpVT = VT == MVT::f32 ? MVT::v4i32 : MVT::v2i64;
14806 VCmp = DAG.getBitcast(VCmpVT, VCmp);
14808 SDValue VSel = DAG.getNode(ISD::VSELECT, DL, VecVT, VCmp, VOp1, VOp2);
14810 return DAG.getNode(ISD::EXTRACT_VECTOR_ELT, DL, VT,
14811 VSel, DAG.getIntPtrConstant(0, DL));
14813 SDValue AndN = DAG.getNode(X86ISD::FANDN, DL, VT, Cmp, Op2);
14814 SDValue And = DAG.getNode(X86ISD::FAND, DL, VT, Cmp, Op1);
14815 return DAG.getNode(X86ISD::FOR, DL, VT, AndN, And);
14819 if (VT.isVector() && VT.getVectorElementType() == MVT::i1) {
14821 if (ISD::isBuildVectorOfConstantSDNodes(Op1.getNode()))
14822 Op1Scalar = ConvertI1VectorToInteger(Op1, DAG);
14823 else if (Op1.getOpcode() == ISD::BITCAST && Op1.getOperand(0))
14824 Op1Scalar = Op1.getOperand(0);
14826 if (ISD::isBuildVectorOfConstantSDNodes(Op2.getNode()))
14827 Op2Scalar = ConvertI1VectorToInteger(Op2, DAG);
14828 else if (Op2.getOpcode() == ISD::BITCAST && Op2.getOperand(0))
14829 Op2Scalar = Op2.getOperand(0);
14830 if (Op1Scalar.getNode() && Op2Scalar.getNode()) {
14831 SDValue newSelect = DAG.getNode(ISD::SELECT, DL,
14832 Op1Scalar.getValueType(),
14833 Cond, Op1Scalar, Op2Scalar);
14834 if (newSelect.getValueSizeInBits() == VT.getSizeInBits())
14835 return DAG.getBitcast(VT, newSelect);
14836 SDValue ExtVec = DAG.getBitcast(MVT::v8i1, newSelect);
14837 return DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, VT, ExtVec,
14838 DAG.getIntPtrConstant(0, DL));
14842 if (VT == MVT::v4i1 || VT == MVT::v2i1) {
14843 SDValue zeroConst = DAG.getIntPtrConstant(0, DL);
14844 Op1 = DAG.getNode(ISD::INSERT_SUBVECTOR, DL, MVT::v8i1,
14845 DAG.getUNDEF(MVT::v8i1), Op1, zeroConst);
14846 Op2 = DAG.getNode(ISD::INSERT_SUBVECTOR, DL, MVT::v8i1,
14847 DAG.getUNDEF(MVT::v8i1), Op2, zeroConst);
14848 SDValue newSelect = DAG.getNode(ISD::SELECT, DL, MVT::v8i1,
14850 return DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, VT, newSelect, zeroConst);
14853 if (Cond.getOpcode() == ISD::SETCC) {
14854 SDValue NewCond = LowerSETCC(Cond, DAG);
14855 if (NewCond.getNode())
14859 // (select (x == 0), -1, y) -> (sign_bit (x - 1)) | y
14860 // (select (x == 0), y, -1) -> ~(sign_bit (x - 1)) | y
14861 // (select (x != 0), y, -1) -> (sign_bit (x - 1)) | y
14862 // (select (x != 0), -1, y) -> ~(sign_bit (x - 1)) | y
14863 if (Cond.getOpcode() == X86ISD::SETCC &&
14864 Cond.getOperand(1).getOpcode() == X86ISD::CMP &&
14865 isNullConstant(Cond.getOperand(1).getOperand(1))) {
14866 SDValue Cmp = Cond.getOperand(1);
14868 unsigned CondCode =cast<ConstantSDNode>(Cond.getOperand(0))->getZExtValue();
14870 if ((isAllOnesConstant(Op1) || isAllOnesConstant(Op2)) &&
14871 (CondCode == X86::COND_E || CondCode == X86::COND_NE)) {
14872 SDValue Y = isAllOnesConstant(Op2) ? Op1 : Op2;
14874 SDValue CmpOp0 = Cmp.getOperand(0);
14875 // Apply further optimizations for special cases
14876 // (select (x != 0), -1, 0) -> neg & sbb
14877 // (select (x == 0), 0, -1) -> neg & sbb
14878 if (isNullConstant(Y) &&
14879 (isAllOnesConstant(Op1) == (CondCode == X86::COND_NE))) {
14880 SDVTList VTs = DAG.getVTList(CmpOp0.getValueType(), MVT::i32);
14881 SDValue Neg = DAG.getNode(X86ISD::SUB, DL, VTs,
14882 DAG.getConstant(0, DL,
14883 CmpOp0.getValueType()),
14885 SDValue Res = DAG.getNode(X86ISD::SETCC_CARRY, DL, Op.getValueType(),
14886 DAG.getConstant(X86::COND_B, DL, MVT::i8),
14887 SDValue(Neg.getNode(), 1));
14891 Cmp = DAG.getNode(X86ISD::CMP, DL, MVT::i32,
14892 CmpOp0, DAG.getConstant(1, DL, CmpOp0.getValueType()));
14893 Cmp = ConvertCmpIfNecessary(Cmp, DAG);
14895 SDValue Res = // Res = 0 or -1.
14896 DAG.getNode(X86ISD::SETCC_CARRY, DL, Op.getValueType(),
14897 DAG.getConstant(X86::COND_B, DL, MVT::i8), Cmp);
14899 if (isAllOnesConstant(Op1) != (CondCode == X86::COND_E))
14900 Res = DAG.getNOT(DL, Res, Res.getValueType());
14902 if (!isNullConstant(Op2))
14903 Res = DAG.getNode(ISD::OR, DL, Res.getValueType(), Res, Y);
14908 // Look past (and (setcc_carry (cmp ...)), 1).
14909 if (Cond.getOpcode() == ISD::AND &&
14910 Cond.getOperand(0).getOpcode() == X86ISD::SETCC_CARRY &&
14911 isOneConstant(Cond.getOperand(1)))
14912 Cond = Cond.getOperand(0);
14914 // If condition flag is set by a X86ISD::CMP, then use it as the condition
14915 // setting operand in place of the X86ISD::SETCC.
14916 unsigned CondOpcode = Cond.getOpcode();
14917 if (CondOpcode == X86ISD::SETCC ||
14918 CondOpcode == X86ISD::SETCC_CARRY) {
14919 CC = Cond.getOperand(0);
14921 SDValue Cmp = Cond.getOperand(1);
14922 unsigned Opc = Cmp.getOpcode();
14923 MVT VT = Op.getSimpleValueType();
14925 bool IllegalFPCMov = false;
14926 if (VT.isFloatingPoint() && !VT.isVector() &&
14927 !isScalarFPTypeInSSEReg(VT)) // FPStack?
14928 IllegalFPCMov = !hasFPCMov(cast<ConstantSDNode>(CC)->getSExtValue());
14930 if ((isX86LogicalCmp(Cmp) && !IllegalFPCMov) ||
14931 Opc == X86ISD::BT) { // FIXME
14935 } else if (CondOpcode == ISD::USUBO || CondOpcode == ISD::SSUBO ||
14936 CondOpcode == ISD::UADDO || CondOpcode == ISD::SADDO ||
14937 ((CondOpcode == ISD::UMULO || CondOpcode == ISD::SMULO) &&
14938 Cond.getOperand(0).getValueType() != MVT::i8)) {
14939 SDValue LHS = Cond.getOperand(0);
14940 SDValue RHS = Cond.getOperand(1);
14941 unsigned X86Opcode;
14944 switch (CondOpcode) {
14945 case ISD::UADDO: X86Opcode = X86ISD::ADD; X86Cond = X86::COND_B; break;
14946 case ISD::SADDO: X86Opcode = X86ISD::ADD; X86Cond = X86::COND_O; break;
14947 case ISD::USUBO: X86Opcode = X86ISD::SUB; X86Cond = X86::COND_B; break;
14948 case ISD::SSUBO: X86Opcode = X86ISD::SUB; X86Cond = X86::COND_O; break;
14949 case ISD::UMULO: X86Opcode = X86ISD::UMUL; X86Cond = X86::COND_O; break;
14950 case ISD::SMULO: X86Opcode = X86ISD::SMUL; X86Cond = X86::COND_O; break;
14951 default: llvm_unreachable("unexpected overflowing operator");
14953 if (CondOpcode == ISD::UMULO)
14954 VTs = DAG.getVTList(LHS.getValueType(), LHS.getValueType(),
14957 VTs = DAG.getVTList(LHS.getValueType(), MVT::i32);
14959 SDValue X86Op = DAG.getNode(X86Opcode, DL, VTs, LHS, RHS);
14961 if (CondOpcode == ISD::UMULO)
14962 Cond = X86Op.getValue(2);
14964 Cond = X86Op.getValue(1);
14966 CC = DAG.getConstant(X86Cond, DL, MVT::i8);
14971 // Look past the truncate if the high bits are known zero.
14972 if (isTruncWithZeroHighBitsInput(Cond, DAG))
14973 Cond = Cond.getOperand(0);
14975 // We know the result of AND is compared against zero. Try to match
14977 if (Cond.getOpcode() == ISD::AND && Cond.hasOneUse()) {
14978 if (SDValue NewSetCC = LowerToBT(Cond, ISD::SETNE, DL, DAG)) {
14979 CC = NewSetCC.getOperand(0);
14980 Cond = NewSetCC.getOperand(1);
14987 CC = DAG.getConstant(X86::COND_NE, DL, MVT::i8);
14988 Cond = EmitTest(Cond, X86::COND_NE, DL, DAG);
14991 // a < b ? -1 : 0 -> RES = ~setcc_carry
14992 // a < b ? 0 : -1 -> RES = setcc_carry
14993 // a >= b ? -1 : 0 -> RES = setcc_carry
14994 // a >= b ? 0 : -1 -> RES = ~setcc_carry
14995 if (Cond.getOpcode() == X86ISD::SUB) {
14996 Cond = ConvertCmpIfNecessary(Cond, DAG);
14997 unsigned CondCode = cast<ConstantSDNode>(CC)->getZExtValue();
14999 if ((CondCode == X86::COND_AE || CondCode == X86::COND_B) &&
15000 (isAllOnesConstant(Op1) || isAllOnesConstant(Op2)) &&
15001 (isNullConstant(Op1) || isNullConstant(Op2))) {
15002 SDValue Res = DAG.getNode(X86ISD::SETCC_CARRY, DL, Op.getValueType(),
15003 DAG.getConstant(X86::COND_B, DL, MVT::i8),
15005 if (isAllOnesConstant(Op1) != (CondCode == X86::COND_B))
15006 return DAG.getNOT(DL, Res, Res.getValueType());
15011 // X86 doesn't have an i8 cmov. If both operands are the result of a truncate
15012 // widen the cmov and push the truncate through. This avoids introducing a new
15013 // branch during isel and doesn't add any extensions.
15014 if (Op.getValueType() == MVT::i8 &&
15015 Op1.getOpcode() == ISD::TRUNCATE && Op2.getOpcode() == ISD::TRUNCATE) {
15016 SDValue T1 = Op1.getOperand(0), T2 = Op2.getOperand(0);
15017 if (T1.getValueType() == T2.getValueType() &&
15018 // Blacklist CopyFromReg to avoid partial register stalls.
15019 T1.getOpcode() != ISD::CopyFromReg && T2.getOpcode()!=ISD::CopyFromReg){
15020 SDVTList VTs = DAG.getVTList(T1.getValueType(), MVT::Glue);
15021 SDValue Cmov = DAG.getNode(X86ISD::CMOV, DL, VTs, T2, T1, CC, Cond);
15022 return DAG.getNode(ISD::TRUNCATE, DL, Op.getValueType(), Cmov);
15026 // X86ISD::CMOV means set the result (which is operand 1) to the RHS if
15027 // condition is true.
15028 SDVTList VTs = DAG.getVTList(Op.getValueType(), MVT::Glue);
15029 SDValue Ops[] = { Op2, Op1, CC, Cond };
15030 return DAG.getNode(X86ISD::CMOV, DL, VTs, Ops);
15033 static SDValue LowerSIGN_EXTEND_AVX512(SDValue Op,
15034 const X86Subtarget *Subtarget,
15035 SelectionDAG &DAG) {
15036 MVT VT = Op->getSimpleValueType(0);
15037 SDValue In = Op->getOperand(0);
15038 MVT InVT = In.getSimpleValueType();
15039 MVT VTElt = VT.getVectorElementType();
15040 MVT InVTElt = InVT.getVectorElementType();
15044 if ((InVTElt == MVT::i1) &&
15045 (((Subtarget->hasBWI() && Subtarget->hasVLX() &&
15046 VT.getSizeInBits() <= 256 && VTElt.getSizeInBits() <= 16)) ||
15048 ((Subtarget->hasBWI() && VT.is512BitVector() &&
15049 VTElt.getSizeInBits() <= 16)) ||
15051 ((Subtarget->hasDQI() && Subtarget->hasVLX() &&
15052 VT.getSizeInBits() <= 256 && VTElt.getSizeInBits() >= 32)) ||
15054 ((Subtarget->hasDQI() && VT.is512BitVector() &&
15055 VTElt.getSizeInBits() >= 32))))
15056 return DAG.getNode(X86ISD::VSEXT, dl, VT, In);
15058 unsigned int NumElts = VT.getVectorNumElements();
15060 if (NumElts != 8 && NumElts != 16 && !Subtarget->hasBWI())
15063 if (VT.is512BitVector() && InVT.getVectorElementType() != MVT::i1) {
15064 if (In.getOpcode() == X86ISD::VSEXT || In.getOpcode() == X86ISD::VZEXT)
15065 return DAG.getNode(In.getOpcode(), dl, VT, In.getOperand(0));
15066 return DAG.getNode(X86ISD::VSEXT, dl, VT, In);
15069 assert (InVT.getVectorElementType() == MVT::i1 && "Unexpected vector type");
15070 MVT ExtVT = NumElts == 8 ? MVT::v8i64 : MVT::v16i32;
15072 DAG.getConstant(APInt::getAllOnesValue(ExtVT.getScalarSizeInBits()), dl,
15075 DAG.getConstant(APInt::getNullValue(ExtVT.getScalarSizeInBits()), dl, ExtVT);
15077 SDValue V = DAG.getNode(ISD::VSELECT, dl, ExtVT, In, NegOne, Zero);
15078 if (VT.is512BitVector())
15080 return DAG.getNode(X86ISD::VTRUNC, dl, VT, V);
15083 static SDValue LowerSIGN_EXTEND_VECTOR_INREG(SDValue Op,
15084 const X86Subtarget *Subtarget,
15085 SelectionDAG &DAG) {
15086 SDValue In = Op->getOperand(0);
15087 MVT VT = Op->getSimpleValueType(0);
15088 MVT InVT = In.getSimpleValueType();
15089 assert(VT.getSizeInBits() == InVT.getSizeInBits());
15091 MVT InSVT = InVT.getVectorElementType();
15092 assert(VT.getVectorElementType().getSizeInBits() > InSVT.getSizeInBits());
15094 if (VT != MVT::v2i64 && VT != MVT::v4i32 && VT != MVT::v8i16)
15096 if (InSVT != MVT::i32 && InSVT != MVT::i16 && InSVT != MVT::i8)
15101 // SSE41 targets can use the pmovsx* instructions directly.
15102 if (Subtarget->hasSSE41())
15103 return DAG.getNode(X86ISD::VSEXT, dl, VT, In);
15105 // pre-SSE41 targets unpack lower lanes and then sign-extend using SRAI.
15109 // As SRAI is only available on i16/i32 types, we expand only up to i32
15110 // and handle i64 separately.
15111 while (CurrVT != VT && CurrVT.getVectorElementType() != MVT::i32) {
15112 Curr = DAG.getNode(X86ISD::UNPCKL, dl, CurrVT, DAG.getUNDEF(CurrVT), Curr);
15113 MVT CurrSVT = MVT::getIntegerVT(CurrVT.getScalarSizeInBits() * 2);
15114 CurrVT = MVT::getVectorVT(CurrSVT, CurrVT.getVectorNumElements() / 2);
15115 Curr = DAG.getBitcast(CurrVT, Curr);
15118 SDValue SignExt = Curr;
15119 if (CurrVT != InVT) {
15120 unsigned SignExtShift =
15121 CurrVT.getVectorElementType().getSizeInBits() - InSVT.getSizeInBits();
15122 SignExt = DAG.getNode(X86ISD::VSRAI, dl, CurrVT, Curr,
15123 DAG.getConstant(SignExtShift, dl, MVT::i8));
15129 if (VT == MVT::v2i64 && CurrVT == MVT::v4i32) {
15130 SDValue Sign = DAG.getNode(X86ISD::VSRAI, dl, CurrVT, Curr,
15131 DAG.getConstant(31, dl, MVT::i8));
15132 SDValue Ext = DAG.getVectorShuffle(CurrVT, dl, SignExt, Sign, {0, 4, 1, 5});
15133 return DAG.getBitcast(VT, Ext);
15139 static SDValue LowerSIGN_EXTEND(SDValue Op, const X86Subtarget *Subtarget,
15140 SelectionDAG &DAG) {
15141 MVT VT = Op->getSimpleValueType(0);
15142 SDValue In = Op->getOperand(0);
15143 MVT InVT = In.getSimpleValueType();
15146 if (VT.is512BitVector() || InVT.getVectorElementType() == MVT::i1)
15147 return LowerSIGN_EXTEND_AVX512(Op, Subtarget, DAG);
15149 if ((VT != MVT::v4i64 || InVT != MVT::v4i32) &&
15150 (VT != MVT::v8i32 || InVT != MVT::v8i16) &&
15151 (VT != MVT::v16i16 || InVT != MVT::v16i8))
15154 if (Subtarget->hasInt256())
15155 return DAG.getNode(X86ISD::VSEXT, dl, VT, In);
15157 // Optimize vectors in AVX mode
15158 // Sign extend v8i16 to v8i32 and
15161 // Divide input vector into two parts
15162 // for v4i32 the shuffle mask will be { 0, 1, -1, -1} {2, 3, -1, -1}
15163 // use vpmovsx instruction to extend v4i32 -> v2i64; v8i16 -> v4i32
15164 // concat the vectors to original VT
15166 unsigned NumElems = InVT.getVectorNumElements();
15167 SDValue Undef = DAG.getUNDEF(InVT);
15169 SmallVector<int,8> ShufMask1(NumElems, -1);
15170 for (unsigned i = 0; i != NumElems/2; ++i)
15173 SDValue OpLo = DAG.getVectorShuffle(InVT, dl, In, Undef, &ShufMask1[0]);
15175 SmallVector<int,8> ShufMask2(NumElems, -1);
15176 for (unsigned i = 0; i != NumElems/2; ++i)
15177 ShufMask2[i] = i + NumElems/2;
15179 SDValue OpHi = DAG.getVectorShuffle(InVT, dl, In, Undef, &ShufMask2[0]);
15181 MVT HalfVT = MVT::getVectorVT(VT.getVectorElementType(),
15182 VT.getVectorNumElements()/2);
15184 OpLo = DAG.getNode(X86ISD::VSEXT, dl, HalfVT, OpLo);
15185 OpHi = DAG.getNode(X86ISD::VSEXT, dl, HalfVT, OpHi);
15187 return DAG.getNode(ISD::CONCAT_VECTORS, dl, VT, OpLo, OpHi);
15190 // Lower vector extended loads using a shuffle. If SSSE3 is not available we
15191 // may emit an illegal shuffle but the expansion is still better than scalar
15192 // code. We generate X86ISD::VSEXT for SEXTLOADs if it's available, otherwise
15193 // we'll emit a shuffle and a arithmetic shift.
15194 // FIXME: Is the expansion actually better than scalar code? It doesn't seem so.
15195 // TODO: It is possible to support ZExt by zeroing the undef values during
15196 // the shuffle phase or after the shuffle.
15197 static SDValue LowerExtendedLoad(SDValue Op, const X86Subtarget *Subtarget,
15198 SelectionDAG &DAG) {
15199 MVT RegVT = Op.getSimpleValueType();
15200 assert(RegVT.isVector() && "We only custom lower vector sext loads.");
15201 assert(RegVT.isInteger() &&
15202 "We only custom lower integer vector sext loads.");
15204 // Nothing useful we can do without SSE2 shuffles.
15205 assert(Subtarget->hasSSE2() && "We only custom lower sext loads with SSE2.");
15207 LoadSDNode *Ld = cast<LoadSDNode>(Op.getNode());
15209 EVT MemVT = Ld->getMemoryVT();
15210 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
15211 unsigned RegSz = RegVT.getSizeInBits();
15213 ISD::LoadExtType Ext = Ld->getExtensionType();
15215 assert((Ext == ISD::EXTLOAD || Ext == ISD::SEXTLOAD)
15216 && "Only anyext and sext are currently implemented.");
15217 assert(MemVT != RegVT && "Cannot extend to the same type");
15218 assert(MemVT.isVector() && "Must load a vector from memory");
15220 unsigned NumElems = RegVT.getVectorNumElements();
15221 unsigned MemSz = MemVT.getSizeInBits();
15222 assert(RegSz > MemSz && "Register size must be greater than the mem size");
15224 if (Ext == ISD::SEXTLOAD && RegSz == 256 && !Subtarget->hasInt256()) {
15225 // The only way in which we have a legal 256-bit vector result but not the
15226 // integer 256-bit operations needed to directly lower a sextload is if we
15227 // have AVX1 but not AVX2. In that case, we can always emit a sextload to
15228 // a 128-bit vector and a normal sign_extend to 256-bits that should get
15229 // correctly legalized. We do this late to allow the canonical form of
15230 // sextload to persist throughout the rest of the DAG combiner -- it wants
15231 // to fold together any extensions it can, and so will fuse a sign_extend
15232 // of an sextload into a sextload targeting a wider value.
15234 if (MemSz == 128) {
15235 // Just switch this to a normal load.
15236 assert(TLI.isTypeLegal(MemVT) && "If the memory type is a 128-bit type, "
15237 "it must be a legal 128-bit vector "
15239 Load = DAG.getLoad(MemVT, dl, Ld->getChain(), Ld->getBasePtr(),
15240 Ld->getPointerInfo(), Ld->isVolatile(), Ld->isNonTemporal(),
15241 Ld->isInvariant(), Ld->getAlignment());
15243 assert(MemSz < 128 &&
15244 "Can't extend a type wider than 128 bits to a 256 bit vector!");
15245 // Do an sext load to a 128-bit vector type. We want to use the same
15246 // number of elements, but elements half as wide. This will end up being
15247 // recursively lowered by this routine, but will succeed as we definitely
15248 // have all the necessary features if we're using AVX1.
15250 EVT::getIntegerVT(*DAG.getContext(), RegVT.getScalarSizeInBits() / 2);
15251 EVT HalfVecVT = EVT::getVectorVT(*DAG.getContext(), HalfEltVT, NumElems);
15253 DAG.getExtLoad(Ext, dl, HalfVecVT, Ld->getChain(), Ld->getBasePtr(),
15254 Ld->getPointerInfo(), MemVT, Ld->isVolatile(),
15255 Ld->isNonTemporal(), Ld->isInvariant(),
15256 Ld->getAlignment());
15259 // Replace chain users with the new chain.
15260 assert(Load->getNumValues() == 2 && "Loads must carry a chain!");
15261 DAG.ReplaceAllUsesOfValueWith(SDValue(Ld, 1), Load.getValue(1));
15263 // Finally, do a normal sign-extend to the desired register.
15264 return DAG.getSExtOrTrunc(Load, dl, RegVT);
15267 // All sizes must be a power of two.
15268 assert(isPowerOf2_32(RegSz * MemSz * NumElems) &&
15269 "Non-power-of-two elements are not custom lowered!");
15271 // Attempt to load the original value using scalar loads.
15272 // Find the largest scalar type that divides the total loaded size.
15273 MVT SclrLoadTy = MVT::i8;
15274 for (MVT Tp : MVT::integer_valuetypes()) {
15275 if (TLI.isTypeLegal(Tp) && ((MemSz % Tp.getSizeInBits()) == 0)) {
15280 // On 32bit systems, we can't save 64bit integers. Try bitcasting to F64.
15281 if (TLI.isTypeLegal(MVT::f64) && SclrLoadTy.getSizeInBits() < 64 &&
15283 SclrLoadTy = MVT::f64;
15285 // Calculate the number of scalar loads that we need to perform
15286 // in order to load our vector from memory.
15287 unsigned NumLoads = MemSz / SclrLoadTy.getSizeInBits();
15289 assert((Ext != ISD::SEXTLOAD || NumLoads == 1) &&
15290 "Can only lower sext loads with a single scalar load!");
15292 unsigned loadRegZize = RegSz;
15293 if (Ext == ISD::SEXTLOAD && RegSz >= 256)
15296 // Represent our vector as a sequence of elements which are the
15297 // largest scalar that we can load.
15298 EVT LoadUnitVecVT = EVT::getVectorVT(
15299 *DAG.getContext(), SclrLoadTy, loadRegZize / SclrLoadTy.getSizeInBits());
15301 // Represent the data using the same element type that is stored in
15302 // memory. In practice, we ''widen'' MemVT.
15304 EVT::getVectorVT(*DAG.getContext(), MemVT.getScalarType(),
15305 loadRegZize / MemVT.getScalarSizeInBits());
15307 assert(WideVecVT.getSizeInBits() == LoadUnitVecVT.getSizeInBits() &&
15308 "Invalid vector type");
15310 // We can't shuffle using an illegal type.
15311 assert(TLI.isTypeLegal(WideVecVT) &&
15312 "We only lower types that form legal widened vector types");
15314 SmallVector<SDValue, 8> Chains;
15315 SDValue Ptr = Ld->getBasePtr();
15316 SDValue Increment = DAG.getConstant(SclrLoadTy.getSizeInBits() / 8, dl,
15317 TLI.getPointerTy(DAG.getDataLayout()));
15318 SDValue Res = DAG.getUNDEF(LoadUnitVecVT);
15320 for (unsigned i = 0; i < NumLoads; ++i) {
15321 // Perform a single load.
15322 SDValue ScalarLoad =
15323 DAG.getLoad(SclrLoadTy, dl, Ld->getChain(), Ptr, Ld->getPointerInfo(),
15324 Ld->isVolatile(), Ld->isNonTemporal(), Ld->isInvariant(),
15325 Ld->getAlignment());
15326 Chains.push_back(ScalarLoad.getValue(1));
15327 // Create the first element type using SCALAR_TO_VECTOR in order to avoid
15328 // another round of DAGCombining.
15330 Res = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, LoadUnitVecVT, ScalarLoad);
15332 Res = DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, LoadUnitVecVT, Res,
15333 ScalarLoad, DAG.getIntPtrConstant(i, dl));
15335 Ptr = DAG.getNode(ISD::ADD, dl, Ptr.getValueType(), Ptr, Increment);
15338 SDValue TF = DAG.getNode(ISD::TokenFactor, dl, MVT::Other, Chains);
15340 // Bitcast the loaded value to a vector of the original element type, in
15341 // the size of the target vector type.
15342 SDValue SlicedVec = DAG.getBitcast(WideVecVT, Res);
15343 unsigned SizeRatio = RegSz / MemSz;
15345 if (Ext == ISD::SEXTLOAD) {
15346 // If we have SSE4.1, we can directly emit a VSEXT node.
15347 if (Subtarget->hasSSE41()) {
15348 SDValue Sext = DAG.getNode(X86ISD::VSEXT, dl, RegVT, SlicedVec);
15349 DAG.ReplaceAllUsesOfValueWith(SDValue(Ld, 1), TF);
15353 // Otherwise we'll use SIGN_EXTEND_VECTOR_INREG to sign extend the lowest
15355 assert(TLI.isOperationLegalOrCustom(ISD::SIGN_EXTEND_VECTOR_INREG, RegVT) &&
15356 "We can't implement a sext load without SIGN_EXTEND_VECTOR_INREG!");
15358 SDValue Shuff = DAG.getSignExtendVectorInReg(SlicedVec, dl, RegVT);
15359 DAG.ReplaceAllUsesOfValueWith(SDValue(Ld, 1), TF);
15363 // Redistribute the loaded elements into the different locations.
15364 SmallVector<int, 16> ShuffleVec(NumElems * SizeRatio, -1);
15365 for (unsigned i = 0; i != NumElems; ++i)
15366 ShuffleVec[i * SizeRatio] = i;
15368 SDValue Shuff = DAG.getVectorShuffle(WideVecVT, dl, SlicedVec,
15369 DAG.getUNDEF(WideVecVT), &ShuffleVec[0]);
15371 // Bitcast to the requested type.
15372 Shuff = DAG.getBitcast(RegVT, Shuff);
15373 DAG.ReplaceAllUsesOfValueWith(SDValue(Ld, 1), TF);
15377 // isAndOrOfSingleUseSetCCs - Return true if node is an ISD::AND or
15378 // ISD::OR of two X86ISD::SETCC nodes each of which has no other use apart
15379 // from the AND / OR.
15380 static bool isAndOrOfSetCCs(SDValue Op, unsigned &Opc) {
15381 Opc = Op.getOpcode();
15382 if (Opc != ISD::OR && Opc != ISD::AND)
15384 return (Op.getOperand(0).getOpcode() == X86ISD::SETCC &&
15385 Op.getOperand(0).hasOneUse() &&
15386 Op.getOperand(1).getOpcode() == X86ISD::SETCC &&
15387 Op.getOperand(1).hasOneUse());
15390 // isXor1OfSetCC - Return true if node is an ISD::XOR of a X86ISD::SETCC and
15391 // 1 and that the SETCC node has a single use.
15392 static bool isXor1OfSetCC(SDValue Op) {
15393 if (Op.getOpcode() != ISD::XOR)
15395 if (isOneConstant(Op.getOperand(1)))
15396 return Op.getOperand(0).getOpcode() == X86ISD::SETCC &&
15397 Op.getOperand(0).hasOneUse();
15401 SDValue X86TargetLowering::LowerBRCOND(SDValue Op, SelectionDAG &DAG) const {
15402 bool addTest = true;
15403 SDValue Chain = Op.getOperand(0);
15404 SDValue Cond = Op.getOperand(1);
15405 SDValue Dest = Op.getOperand(2);
15408 bool Inverted = false;
15410 if (Cond.getOpcode() == ISD::SETCC) {
15411 // Check for setcc([su]{add,sub,mul}o == 0).
15412 if (cast<CondCodeSDNode>(Cond.getOperand(2))->get() == ISD::SETEQ &&
15413 isNullConstant(Cond.getOperand(1)) &&
15414 Cond.getOperand(0).getResNo() == 1 &&
15415 (Cond.getOperand(0).getOpcode() == ISD::SADDO ||
15416 Cond.getOperand(0).getOpcode() == ISD::UADDO ||
15417 Cond.getOperand(0).getOpcode() == ISD::SSUBO ||
15418 Cond.getOperand(0).getOpcode() == ISD::USUBO ||
15419 Cond.getOperand(0).getOpcode() == ISD::SMULO ||
15420 Cond.getOperand(0).getOpcode() == ISD::UMULO)) {
15422 Cond = Cond.getOperand(0);
15424 SDValue NewCond = LowerSETCC(Cond, DAG);
15425 if (NewCond.getNode())
15430 // FIXME: LowerXALUO doesn't handle these!!
15431 else if (Cond.getOpcode() == X86ISD::ADD ||
15432 Cond.getOpcode() == X86ISD::SUB ||
15433 Cond.getOpcode() == X86ISD::SMUL ||
15434 Cond.getOpcode() == X86ISD::UMUL)
15435 Cond = LowerXALUO(Cond, DAG);
15438 // Look pass (and (setcc_carry (cmp ...)), 1).
15439 if (Cond.getOpcode() == ISD::AND &&
15440 Cond.getOperand(0).getOpcode() == X86ISD::SETCC_CARRY &&
15441 isOneConstant(Cond.getOperand(1)))
15442 Cond = Cond.getOperand(0);
15444 // If condition flag is set by a X86ISD::CMP, then use it as the condition
15445 // setting operand in place of the X86ISD::SETCC.
15446 unsigned CondOpcode = Cond.getOpcode();
15447 if (CondOpcode == X86ISD::SETCC ||
15448 CondOpcode == X86ISD::SETCC_CARRY) {
15449 CC = Cond.getOperand(0);
15451 SDValue Cmp = Cond.getOperand(1);
15452 unsigned Opc = Cmp.getOpcode();
15453 // FIXME: WHY THE SPECIAL CASING OF LogicalCmp??
15454 if (isX86LogicalCmp(Cmp) || Opc == X86ISD::BT) {
15458 switch (cast<ConstantSDNode>(CC)->getZExtValue()) {
15462 // These can only come from an arithmetic instruction with overflow,
15463 // e.g. SADDO, UADDO.
15464 Cond = Cond.getNode()->getOperand(1);
15470 CondOpcode = Cond.getOpcode();
15471 if (CondOpcode == ISD::UADDO || CondOpcode == ISD::SADDO ||
15472 CondOpcode == ISD::USUBO || CondOpcode == ISD::SSUBO ||
15473 ((CondOpcode == ISD::UMULO || CondOpcode == ISD::SMULO) &&
15474 Cond.getOperand(0).getValueType() != MVT::i8)) {
15475 SDValue LHS = Cond.getOperand(0);
15476 SDValue RHS = Cond.getOperand(1);
15477 unsigned X86Opcode;
15480 // Keep this in sync with LowerXALUO, otherwise we might create redundant
15481 // instructions that can't be removed afterwards (i.e. X86ISD::ADD and
15483 switch (CondOpcode) {
15484 case ISD::UADDO: X86Opcode = X86ISD::ADD; X86Cond = X86::COND_B; break;
15486 if (isOneConstant(RHS)) {
15487 X86Opcode = X86ISD::INC; X86Cond = X86::COND_O;
15490 X86Opcode = X86ISD::ADD; X86Cond = X86::COND_O; break;
15491 case ISD::USUBO: X86Opcode = X86ISD::SUB; X86Cond = X86::COND_B; break;
15493 if (isOneConstant(RHS)) {
15494 X86Opcode = X86ISD::DEC; X86Cond = X86::COND_O;
15497 X86Opcode = X86ISD::SUB; X86Cond = X86::COND_O; break;
15498 case ISD::UMULO: X86Opcode = X86ISD::UMUL; X86Cond = X86::COND_O; break;
15499 case ISD::SMULO: X86Opcode = X86ISD::SMUL; X86Cond = X86::COND_O; break;
15500 default: llvm_unreachable("unexpected overflowing operator");
15503 X86Cond = X86::GetOppositeBranchCondition((X86::CondCode)X86Cond);
15504 if (CondOpcode == ISD::UMULO)
15505 VTs = DAG.getVTList(LHS.getValueType(), LHS.getValueType(),
15508 VTs = DAG.getVTList(LHS.getValueType(), MVT::i32);
15510 SDValue X86Op = DAG.getNode(X86Opcode, dl, VTs, LHS, RHS);
15512 if (CondOpcode == ISD::UMULO)
15513 Cond = X86Op.getValue(2);
15515 Cond = X86Op.getValue(1);
15517 CC = DAG.getConstant(X86Cond, dl, MVT::i8);
15521 if (Cond.hasOneUse() && isAndOrOfSetCCs(Cond, CondOpc)) {
15522 SDValue Cmp = Cond.getOperand(0).getOperand(1);
15523 if (CondOpc == ISD::OR) {
15524 // Also, recognize the pattern generated by an FCMP_UNE. We can emit
15525 // two branches instead of an explicit OR instruction with a
15527 if (Cmp == Cond.getOperand(1).getOperand(1) &&
15528 isX86LogicalCmp(Cmp)) {
15529 CC = Cond.getOperand(0).getOperand(0);
15530 Chain = DAG.getNode(X86ISD::BRCOND, dl, Op.getValueType(),
15531 Chain, Dest, CC, Cmp);
15532 CC = Cond.getOperand(1).getOperand(0);
15536 } else { // ISD::AND
15537 // Also, recognize the pattern generated by an FCMP_OEQ. We can emit
15538 // two branches instead of an explicit AND instruction with a
15539 // separate test. However, we only do this if this block doesn't
15540 // have a fall-through edge, because this requires an explicit
15541 // jmp when the condition is false.
15542 if (Cmp == Cond.getOperand(1).getOperand(1) &&
15543 isX86LogicalCmp(Cmp) &&
15544 Op.getNode()->hasOneUse()) {
15545 X86::CondCode CCode =
15546 (X86::CondCode)Cond.getOperand(0).getConstantOperandVal(0);
15547 CCode = X86::GetOppositeBranchCondition(CCode);
15548 CC = DAG.getConstant(CCode, dl, MVT::i8);
15549 SDNode *User = *Op.getNode()->use_begin();
15550 // Look for an unconditional branch following this conditional branch.
15551 // We need this because we need to reverse the successors in order
15552 // to implement FCMP_OEQ.
15553 if (User->getOpcode() == ISD::BR) {
15554 SDValue FalseBB = User->getOperand(1);
15556 DAG.UpdateNodeOperands(User, User->getOperand(0), Dest);
15557 assert(NewBR == User);
15561 Chain = DAG.getNode(X86ISD::BRCOND, dl, Op.getValueType(),
15562 Chain, Dest, CC, Cmp);
15563 X86::CondCode CCode =
15564 (X86::CondCode)Cond.getOperand(1).getConstantOperandVal(0);
15565 CCode = X86::GetOppositeBranchCondition(CCode);
15566 CC = DAG.getConstant(CCode, dl, MVT::i8);
15572 } else if (Cond.hasOneUse() && isXor1OfSetCC(Cond)) {
15573 // Recognize for xorb (setcc), 1 patterns. The xor inverts the condition.
15574 // It should be transformed during dag combiner except when the condition
15575 // is set by a arithmetics with overflow node.
15576 X86::CondCode CCode =
15577 (X86::CondCode)Cond.getOperand(0).getConstantOperandVal(0);
15578 CCode = X86::GetOppositeBranchCondition(CCode);
15579 CC = DAG.getConstant(CCode, dl, MVT::i8);
15580 Cond = Cond.getOperand(0).getOperand(1);
15582 } else if (Cond.getOpcode() == ISD::SETCC &&
15583 cast<CondCodeSDNode>(Cond.getOperand(2))->get() == ISD::SETOEQ) {
15584 // For FCMP_OEQ, we can emit
15585 // two branches instead of an explicit AND instruction with a
15586 // separate test. However, we only do this if this block doesn't
15587 // have a fall-through edge, because this requires an explicit
15588 // jmp when the condition is false.
15589 if (Op.getNode()->hasOneUse()) {
15590 SDNode *User = *Op.getNode()->use_begin();
15591 // Look for an unconditional branch following this conditional branch.
15592 // We need this because we need to reverse the successors in order
15593 // to implement FCMP_OEQ.
15594 if (User->getOpcode() == ISD::BR) {
15595 SDValue FalseBB = User->getOperand(1);
15597 DAG.UpdateNodeOperands(User, User->getOperand(0), Dest);
15598 assert(NewBR == User);
15602 SDValue Cmp = DAG.getNode(X86ISD::CMP, dl, MVT::i32,
15603 Cond.getOperand(0), Cond.getOperand(1));
15604 Cmp = ConvertCmpIfNecessary(Cmp, DAG);
15605 CC = DAG.getConstant(X86::COND_NE, dl, MVT::i8);
15606 Chain = DAG.getNode(X86ISD::BRCOND, dl, Op.getValueType(),
15607 Chain, Dest, CC, Cmp);
15608 CC = DAG.getConstant(X86::COND_P, dl, MVT::i8);
15613 } else if (Cond.getOpcode() == ISD::SETCC &&
15614 cast<CondCodeSDNode>(Cond.getOperand(2))->get() == ISD::SETUNE) {
15615 // For FCMP_UNE, we can emit
15616 // two branches instead of an explicit AND instruction with a
15617 // separate test. However, we only do this if this block doesn't
15618 // have a fall-through edge, because this requires an explicit
15619 // jmp when the condition is false.
15620 if (Op.getNode()->hasOneUse()) {
15621 SDNode *User = *Op.getNode()->use_begin();
15622 // Look for an unconditional branch following this conditional branch.
15623 // We need this because we need to reverse the successors in order
15624 // to implement FCMP_UNE.
15625 if (User->getOpcode() == ISD::BR) {
15626 SDValue FalseBB = User->getOperand(1);
15628 DAG.UpdateNodeOperands(User, User->getOperand(0), Dest);
15629 assert(NewBR == User);
15632 SDValue Cmp = DAG.getNode(X86ISD::CMP, dl, MVT::i32,
15633 Cond.getOperand(0), Cond.getOperand(1));
15634 Cmp = ConvertCmpIfNecessary(Cmp, DAG);
15635 CC = DAG.getConstant(X86::COND_NE, dl, MVT::i8);
15636 Chain = DAG.getNode(X86ISD::BRCOND, dl, Op.getValueType(),
15637 Chain, Dest, CC, Cmp);
15638 CC = DAG.getConstant(X86::COND_NP, dl, MVT::i8);
15648 // Look pass the truncate if the high bits are known zero.
15649 if (isTruncWithZeroHighBitsInput(Cond, DAG))
15650 Cond = Cond.getOperand(0);
15652 // We know the result of AND is compared against zero. Try to match
15654 if (Cond.getOpcode() == ISD::AND && Cond.hasOneUse()) {
15655 if (SDValue NewSetCC = LowerToBT(Cond, ISD::SETNE, dl, DAG)) {
15656 CC = NewSetCC.getOperand(0);
15657 Cond = NewSetCC.getOperand(1);
15664 X86::CondCode X86Cond = Inverted ? X86::COND_E : X86::COND_NE;
15665 CC = DAG.getConstant(X86Cond, dl, MVT::i8);
15666 Cond = EmitTest(Cond, X86Cond, dl, DAG);
15668 Cond = ConvertCmpIfNecessary(Cond, DAG);
15669 return DAG.getNode(X86ISD::BRCOND, dl, Op.getValueType(),
15670 Chain, Dest, CC, Cond);
15673 // Lower dynamic stack allocation to _alloca call for Cygwin/Mingw targets.
15674 // Calls to _alloca are needed to probe the stack when allocating more than 4k
15675 // bytes in one go. Touching the stack at 4K increments is necessary to ensure
15676 // that the guard pages used by the OS virtual memory manager are allocated in
15677 // correct sequence.
15679 X86TargetLowering::LowerDYNAMIC_STACKALLOC(SDValue Op,
15680 SelectionDAG &DAG) const {
15681 MachineFunction &MF = DAG.getMachineFunction();
15682 bool SplitStack = MF.shouldSplitStack();
15683 bool Lower = (Subtarget->isOSWindows() && !Subtarget->isTargetMachO()) ||
15688 SDNode *Node = Op.getNode();
15689 SDValue Chain = Op.getOperand(0);
15690 SDValue Size = Op.getOperand(1);
15691 unsigned Align = cast<ConstantSDNode>(Op.getOperand(2))->getZExtValue();
15692 EVT VT = Node->getValueType(0);
15694 // Chain the dynamic stack allocation so that it doesn't modify the stack
15695 // pointer when other instructions are using the stack.
15696 Chain = DAG.getCALLSEQ_START(Chain, DAG.getIntPtrConstant(0, dl, true), dl);
15698 bool Is64Bit = Subtarget->is64Bit();
15699 MVT SPTy = getPointerTy(DAG.getDataLayout());
15703 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
15704 unsigned SPReg = TLI.getStackPointerRegisterToSaveRestore();
15705 assert(SPReg && "Target cannot require DYNAMIC_STACKALLOC expansion and"
15706 " not tell us which reg is the stack pointer!");
15707 EVT VT = Node->getValueType(0);
15708 SDValue Tmp3 = Node->getOperand(2);
15710 SDValue SP = DAG.getCopyFromReg(Chain, dl, SPReg, VT);
15711 Chain = SP.getValue(1);
15712 unsigned Align = cast<ConstantSDNode>(Tmp3)->getZExtValue();
15713 const TargetFrameLowering &TFI = *Subtarget->getFrameLowering();
15714 unsigned StackAlign = TFI.getStackAlignment();
15715 Result = DAG.getNode(ISD::SUB, dl, VT, SP, Size); // Value
15716 if (Align > StackAlign)
15717 Result = DAG.getNode(ISD::AND, dl, VT, Result,
15718 DAG.getConstant(-(uint64_t)Align, dl, VT));
15719 Chain = DAG.getCopyToReg(Chain, dl, SPReg, Result); // Output chain
15720 } else if (SplitStack) {
15721 MachineRegisterInfo &MRI = MF.getRegInfo();
15724 // The 64 bit implementation of segmented stacks needs to clobber both r10
15725 // r11. This makes it impossible to use it along with nested parameters.
15726 const Function *F = MF.getFunction();
15728 for (Function::const_arg_iterator I = F->arg_begin(), E = F->arg_end();
15730 if (I->hasNestAttr())
15731 report_fatal_error("Cannot use segmented stacks with functions that "
15732 "have nested arguments.");
15735 const TargetRegisterClass *AddrRegClass = getRegClassFor(SPTy);
15736 unsigned Vreg = MRI.createVirtualRegister(AddrRegClass);
15737 Chain = DAG.getCopyToReg(Chain, dl, Vreg, Size);
15738 Result = DAG.getNode(X86ISD::SEG_ALLOCA, dl, SPTy, Chain,
15739 DAG.getRegister(Vreg, SPTy));
15742 const unsigned Reg = (Subtarget->isTarget64BitLP64() ? X86::RAX : X86::EAX);
15744 Chain = DAG.getCopyToReg(Chain, dl, Reg, Size, Flag);
15745 Flag = Chain.getValue(1);
15746 SDVTList NodeTys = DAG.getVTList(MVT::Other, MVT::Glue);
15748 Chain = DAG.getNode(X86ISD::WIN_ALLOCA, dl, NodeTys, Chain, Flag);
15750 const X86RegisterInfo *RegInfo = Subtarget->getRegisterInfo();
15751 unsigned SPReg = RegInfo->getStackRegister();
15752 SDValue SP = DAG.getCopyFromReg(Chain, dl, SPReg, SPTy);
15753 Chain = SP.getValue(1);
15756 SP = DAG.getNode(ISD::AND, dl, VT, SP.getValue(0),
15757 DAG.getConstant(-(uint64_t)Align, dl, VT));
15758 Chain = DAG.getCopyToReg(Chain, dl, SPReg, SP);
15764 Chain = DAG.getCALLSEQ_END(Chain, DAG.getIntPtrConstant(0, dl, true),
15765 DAG.getIntPtrConstant(0, dl, true), SDValue(), dl);
15767 SDValue Ops[2] = {Result, Chain};
15768 return DAG.getMergeValues(Ops, dl);
15771 SDValue X86TargetLowering::LowerVASTART(SDValue Op, SelectionDAG &DAG) const {
15772 MachineFunction &MF = DAG.getMachineFunction();
15773 auto PtrVT = getPointerTy(MF.getDataLayout());
15774 X86MachineFunctionInfo *FuncInfo = MF.getInfo<X86MachineFunctionInfo>();
15776 const Value *SV = cast<SrcValueSDNode>(Op.getOperand(2))->getValue();
15779 if (!Subtarget->is64Bit() ||
15780 Subtarget->isCallingConvWin64(MF.getFunction()->getCallingConv())) {
15781 // vastart just stores the address of the VarArgsFrameIndex slot into the
15782 // memory location argument.
15783 SDValue FR = DAG.getFrameIndex(FuncInfo->getVarArgsFrameIndex(), PtrVT);
15784 return DAG.getStore(Op.getOperand(0), DL, FR, Op.getOperand(1),
15785 MachinePointerInfo(SV), false, false, 0);
15789 // gp_offset (0 - 6 * 8)
15790 // fp_offset (48 - 48 + 8 * 16)
15791 // overflow_arg_area (point to parameters coming in memory).
15793 SmallVector<SDValue, 8> MemOps;
15794 SDValue FIN = Op.getOperand(1);
15796 SDValue Store = DAG.getStore(Op.getOperand(0), DL,
15797 DAG.getConstant(FuncInfo->getVarArgsGPOffset(),
15799 FIN, MachinePointerInfo(SV), false, false, 0);
15800 MemOps.push_back(Store);
15803 FIN = DAG.getNode(ISD::ADD, DL, PtrVT, FIN, DAG.getIntPtrConstant(4, DL));
15804 Store = DAG.getStore(Op.getOperand(0), DL,
15805 DAG.getConstant(FuncInfo->getVarArgsFPOffset(), DL,
15807 FIN, MachinePointerInfo(SV, 4), false, false, 0);
15808 MemOps.push_back(Store);
15810 // Store ptr to overflow_arg_area
15811 FIN = DAG.getNode(ISD::ADD, DL, PtrVT, FIN, DAG.getIntPtrConstant(4, DL));
15812 SDValue OVFIN = DAG.getFrameIndex(FuncInfo->getVarArgsFrameIndex(), PtrVT);
15813 Store = DAG.getStore(Op.getOperand(0), DL, OVFIN, FIN,
15814 MachinePointerInfo(SV, 8),
15816 MemOps.push_back(Store);
15818 // Store ptr to reg_save_area.
15819 FIN = DAG.getNode(ISD::ADD, DL, PtrVT, FIN, DAG.getIntPtrConstant(
15820 Subtarget->isTarget64BitLP64() ? 8 : 4, DL));
15821 SDValue RSFIN = DAG.getFrameIndex(FuncInfo->getRegSaveFrameIndex(), PtrVT);
15822 Store = DAG.getStore(Op.getOperand(0), DL, RSFIN, FIN, MachinePointerInfo(
15823 SV, Subtarget->isTarget64BitLP64() ? 16 : 12), false, false, 0);
15824 MemOps.push_back(Store);
15825 return DAG.getNode(ISD::TokenFactor, DL, MVT::Other, MemOps);
15828 SDValue X86TargetLowering::LowerVAARG(SDValue Op, SelectionDAG &DAG) const {
15829 assert(Subtarget->is64Bit() &&
15830 "LowerVAARG only handles 64-bit va_arg!");
15831 assert(Op.getNode()->getNumOperands() == 4);
15833 MachineFunction &MF = DAG.getMachineFunction();
15834 if (Subtarget->isCallingConvWin64(MF.getFunction()->getCallingConv()))
15835 // The Win64 ABI uses char* instead of a structure.
15836 return DAG.expandVAArg(Op.getNode());
15838 SDValue Chain = Op.getOperand(0);
15839 SDValue SrcPtr = Op.getOperand(1);
15840 const Value *SV = cast<SrcValueSDNode>(Op.getOperand(2))->getValue();
15841 unsigned Align = Op.getConstantOperandVal(3);
15844 EVT ArgVT = Op.getNode()->getValueType(0);
15845 Type *ArgTy = ArgVT.getTypeForEVT(*DAG.getContext());
15846 uint32_t ArgSize = DAG.getDataLayout().getTypeAllocSize(ArgTy);
15849 // Decide which area this value should be read from.
15850 // TODO: Implement the AMD64 ABI in its entirety. This simple
15851 // selection mechanism works only for the basic types.
15852 if (ArgVT == MVT::f80) {
15853 llvm_unreachable("va_arg for f80 not yet implemented");
15854 } else if (ArgVT.isFloatingPoint() && ArgSize <= 16 /*bytes*/) {
15855 ArgMode = 2; // Argument passed in XMM register. Use fp_offset.
15856 } else if (ArgVT.isInteger() && ArgSize <= 32 /*bytes*/) {
15857 ArgMode = 1; // Argument passed in GPR64 register(s). Use gp_offset.
15859 llvm_unreachable("Unhandled argument type in LowerVAARG");
15862 if (ArgMode == 2) {
15863 // Sanity Check: Make sure using fp_offset makes sense.
15864 assert(!Subtarget->useSoftFloat() &&
15865 !(MF.getFunction()->hasFnAttribute(Attribute::NoImplicitFloat)) &&
15866 Subtarget->hasSSE1());
15869 // Insert VAARG_64 node into the DAG
15870 // VAARG_64 returns two values: Variable Argument Address, Chain
15871 SDValue InstOps[] = {Chain, SrcPtr, DAG.getConstant(ArgSize, dl, MVT::i32),
15872 DAG.getConstant(ArgMode, dl, MVT::i8),
15873 DAG.getConstant(Align, dl, MVT::i32)};
15874 SDVTList VTs = DAG.getVTList(getPointerTy(DAG.getDataLayout()), MVT::Other);
15875 SDValue VAARG = DAG.getMemIntrinsicNode(X86ISD::VAARG_64, dl,
15876 VTs, InstOps, MVT::i64,
15877 MachinePointerInfo(SV),
15879 /*Volatile=*/false,
15881 /*WriteMem=*/true);
15882 Chain = VAARG.getValue(1);
15884 // Load the next argument and return it
15885 return DAG.getLoad(ArgVT, dl,
15888 MachinePointerInfo(),
15889 false, false, false, 0);
15892 static SDValue LowerVACOPY(SDValue Op, const X86Subtarget *Subtarget,
15893 SelectionDAG &DAG) {
15894 // X86-64 va_list is a struct { i32, i32, i8*, i8* }, except on Windows,
15895 // where a va_list is still an i8*.
15896 assert(Subtarget->is64Bit() && "This code only handles 64-bit va_copy!");
15897 if (Subtarget->isCallingConvWin64(
15898 DAG.getMachineFunction().getFunction()->getCallingConv()))
15899 // Probably a Win64 va_copy.
15900 return DAG.expandVACopy(Op.getNode());
15902 SDValue Chain = Op.getOperand(0);
15903 SDValue DstPtr = Op.getOperand(1);
15904 SDValue SrcPtr = Op.getOperand(2);
15905 const Value *DstSV = cast<SrcValueSDNode>(Op.getOperand(3))->getValue();
15906 const Value *SrcSV = cast<SrcValueSDNode>(Op.getOperand(4))->getValue();
15909 return DAG.getMemcpy(Chain, DL, DstPtr, SrcPtr,
15910 DAG.getIntPtrConstant(24, DL), 8, /*isVolatile*/false,
15912 MachinePointerInfo(DstSV), MachinePointerInfo(SrcSV));
15915 // getTargetVShiftByConstNode - Handle vector element shifts where the shift
15916 // amount is a constant. Takes immediate version of shift as input.
15917 static SDValue getTargetVShiftByConstNode(unsigned Opc, SDLoc dl, MVT VT,
15918 SDValue SrcOp, uint64_t ShiftAmt,
15919 SelectionDAG &DAG) {
15920 MVT ElementType = VT.getVectorElementType();
15922 // Fold this packed shift into its first operand if ShiftAmt is 0.
15926 // Check for ShiftAmt >= element width
15927 if (ShiftAmt >= ElementType.getSizeInBits()) {
15928 if (Opc == X86ISD::VSRAI)
15929 ShiftAmt = ElementType.getSizeInBits() - 1;
15931 return DAG.getConstant(0, dl, VT);
15934 assert((Opc == X86ISD::VSHLI || Opc == X86ISD::VSRLI || Opc == X86ISD::VSRAI)
15935 && "Unknown target vector shift-by-constant node");
15937 // Fold this packed vector shift into a build vector if SrcOp is a
15938 // vector of Constants or UNDEFs, and SrcOp valuetype is the same as VT.
15939 if (VT == SrcOp.getSimpleValueType() &&
15940 ISD::isBuildVectorOfConstantSDNodes(SrcOp.getNode())) {
15941 SmallVector<SDValue, 8> Elts;
15942 unsigned NumElts = SrcOp->getNumOperands();
15943 ConstantSDNode *ND;
15946 default: llvm_unreachable(nullptr);
15947 case X86ISD::VSHLI:
15948 for (unsigned i=0; i!=NumElts; ++i) {
15949 SDValue CurrentOp = SrcOp->getOperand(i);
15950 if (CurrentOp->getOpcode() == ISD::UNDEF) {
15951 Elts.push_back(CurrentOp);
15954 ND = cast<ConstantSDNode>(CurrentOp);
15955 const APInt &C = ND->getAPIntValue();
15956 Elts.push_back(DAG.getConstant(C.shl(ShiftAmt), dl, ElementType));
15959 case X86ISD::VSRLI:
15960 for (unsigned i=0; i!=NumElts; ++i) {
15961 SDValue CurrentOp = SrcOp->getOperand(i);
15962 if (CurrentOp->getOpcode() == ISD::UNDEF) {
15963 Elts.push_back(CurrentOp);
15966 ND = cast<ConstantSDNode>(CurrentOp);
15967 const APInt &C = ND->getAPIntValue();
15968 Elts.push_back(DAG.getConstant(C.lshr(ShiftAmt), dl, ElementType));
15971 case X86ISD::VSRAI:
15972 for (unsigned i=0; i!=NumElts; ++i) {
15973 SDValue CurrentOp = SrcOp->getOperand(i);
15974 if (CurrentOp->getOpcode() == ISD::UNDEF) {
15975 Elts.push_back(CurrentOp);
15978 ND = cast<ConstantSDNode>(CurrentOp);
15979 const APInt &C = ND->getAPIntValue();
15980 Elts.push_back(DAG.getConstant(C.ashr(ShiftAmt), dl, ElementType));
15985 return DAG.getNode(ISD::BUILD_VECTOR, dl, VT, Elts);
15988 return DAG.getNode(Opc, dl, VT, SrcOp,
15989 DAG.getConstant(ShiftAmt, dl, MVT::i8));
15992 // getTargetVShiftNode - Handle vector element shifts where the shift amount
15993 // may or may not be a constant. Takes immediate version of shift as input.
15994 static SDValue getTargetVShiftNode(unsigned Opc, SDLoc dl, MVT VT,
15995 SDValue SrcOp, SDValue ShAmt,
15996 SelectionDAG &DAG) {
15997 MVT SVT = ShAmt.getSimpleValueType();
15998 assert((SVT == MVT::i32 || SVT == MVT::i64) && "Unexpected value type!");
16000 // Catch shift-by-constant.
16001 if (ConstantSDNode *CShAmt = dyn_cast<ConstantSDNode>(ShAmt))
16002 return getTargetVShiftByConstNode(Opc, dl, VT, SrcOp,
16003 CShAmt->getZExtValue(), DAG);
16005 // Change opcode to non-immediate version
16007 default: llvm_unreachable("Unknown target vector shift node");
16008 case X86ISD::VSHLI: Opc = X86ISD::VSHL; break;
16009 case X86ISD::VSRLI: Opc = X86ISD::VSRL; break;
16010 case X86ISD::VSRAI: Opc = X86ISD::VSRA; break;
16013 const X86Subtarget &Subtarget =
16014 static_cast<const X86Subtarget &>(DAG.getSubtarget());
16015 if (Subtarget.hasSSE41() && ShAmt.getOpcode() == ISD::ZERO_EXTEND &&
16016 ShAmt.getOperand(0).getSimpleValueType() == MVT::i16) {
16017 // Let the shuffle legalizer expand this shift amount node.
16018 SDValue Op0 = ShAmt.getOperand(0);
16019 Op0 = DAG.getNode(ISD::SCALAR_TO_VECTOR, SDLoc(Op0), MVT::v8i16, Op0);
16020 ShAmt = getShuffleVectorZeroOrUndef(Op0, 0, true, &Subtarget, DAG);
16022 // Need to build a vector containing shift amount.
16023 // SSE/AVX packed shifts only use the lower 64-bit of the shift count.
16024 SmallVector<SDValue, 4> ShOps;
16025 ShOps.push_back(ShAmt);
16026 if (SVT == MVT::i32) {
16027 ShOps.push_back(DAG.getConstant(0, dl, SVT));
16028 ShOps.push_back(DAG.getUNDEF(SVT));
16030 ShOps.push_back(DAG.getUNDEF(SVT));
16032 MVT BVT = SVT == MVT::i32 ? MVT::v4i32 : MVT::v2i64;
16033 ShAmt = DAG.getNode(ISD::BUILD_VECTOR, dl, BVT, ShOps);
16036 // The return type has to be a 128-bit type with the same element
16037 // type as the input type.
16038 MVT EltVT = VT.getVectorElementType();
16039 MVT ShVT = MVT::getVectorVT(EltVT, 128/EltVT.getSizeInBits());
16041 ShAmt = DAG.getBitcast(ShVT, ShAmt);
16042 return DAG.getNode(Opc, dl, VT, SrcOp, ShAmt);
16045 /// \brief Return Mask with the necessary casting or extending
16046 /// for \p Mask according to \p MaskVT when lowering masking intrinsics
16047 static SDValue getMaskNode(SDValue Mask, MVT MaskVT,
16048 const X86Subtarget *Subtarget,
16049 SelectionDAG &DAG, SDLoc dl) {
16051 if (MaskVT.bitsGT(Mask.getSimpleValueType())) {
16052 // Mask should be extended
16053 Mask = DAG.getNode(ISD::ANY_EXTEND, dl,
16054 MVT::getIntegerVT(MaskVT.getSizeInBits()), Mask);
16057 if (Mask.getSimpleValueType() == MVT::i64 && Subtarget->is32Bit()) {
16058 if (MaskVT == MVT::v64i1) {
16059 assert(Subtarget->hasBWI() && "Expected AVX512BW target!");
16060 // In case 32bit mode, bitcast i64 is illegal, extend/split it.
16062 Lo = DAG.getNode(ISD::EXTRACT_ELEMENT, dl, MVT::i32, Mask,
16063 DAG.getConstant(0, dl, MVT::i32));
16064 Hi = DAG.getNode(ISD::EXTRACT_ELEMENT, dl, MVT::i32, Mask,
16065 DAG.getConstant(1, dl, MVT::i32));
16067 Lo = DAG.getBitcast(MVT::v32i1, Lo);
16068 Hi = DAG.getBitcast(MVT::v32i1, Hi);
16070 return DAG.getNode(ISD::CONCAT_VECTORS, dl, MVT::v64i1, Lo, Hi);
16072 // MaskVT require < 64bit. Truncate mask (should succeed in any case),
16074 MVT TruncVT = MVT::getIntegerVT(MaskVT.getSizeInBits());
16075 return DAG.getBitcast(MaskVT,
16076 DAG.getNode(ISD::TRUNCATE, dl, TruncVT, Mask));
16080 MVT BitcastVT = MVT::getVectorVT(MVT::i1,
16081 Mask.getSimpleValueType().getSizeInBits());
16082 // In case when MaskVT equals v2i1 or v4i1, low 2 or 4 elements
16083 // are extracted by EXTRACT_SUBVECTOR.
16084 return DAG.getNode(ISD::EXTRACT_SUBVECTOR, dl, MaskVT,
16085 DAG.getBitcast(BitcastVT, Mask),
16086 DAG.getIntPtrConstant(0, dl));
16090 /// \brief Return (and \p Op, \p Mask) for compare instructions or
16091 /// (vselect \p Mask, \p Op, \p PreservedSrc) for others along with the
16092 /// necessary casting or extending for \p Mask when lowering masking intrinsics
16093 static SDValue getVectorMaskingNode(SDValue Op, SDValue Mask,
16094 SDValue PreservedSrc,
16095 const X86Subtarget *Subtarget,
16096 SelectionDAG &DAG) {
16097 MVT VT = Op.getSimpleValueType();
16098 MVT MaskVT = MVT::getVectorVT(MVT::i1, VT.getVectorNumElements());
16099 unsigned OpcodeSelect = ISD::VSELECT;
16102 if (isAllOnesConstant(Mask))
16105 SDValue VMask = getMaskNode(Mask, MaskVT, Subtarget, DAG, dl);
16107 switch (Op.getOpcode()) {
16109 case X86ISD::PCMPEQM:
16110 case X86ISD::PCMPGTM:
16112 case X86ISD::CMPMU:
16113 return DAG.getNode(ISD::AND, dl, VT, Op, VMask);
16114 case X86ISD::VFPCLASS:
16115 case X86ISD::VFPCLASSS:
16116 return DAG.getNode(ISD::OR, dl, VT, Op, VMask);
16117 case X86ISD::VTRUNC:
16118 case X86ISD::VTRUNCS:
16119 case X86ISD::VTRUNCUS:
16120 // We can't use ISD::VSELECT here because it is not always "Legal"
16121 // for the destination type. For example vpmovqb require only AVX512
16122 // and vselect that can operate on byte element type require BWI
16123 OpcodeSelect = X86ISD::SELECT;
16126 if (PreservedSrc.getOpcode() == ISD::UNDEF)
16127 PreservedSrc = getZeroVector(VT, Subtarget, DAG, dl);
16128 return DAG.getNode(OpcodeSelect, dl, VT, VMask, Op, PreservedSrc);
16131 /// \brief Creates an SDNode for a predicated scalar operation.
16132 /// \returns (X86vselect \p Mask, \p Op, \p PreservedSrc).
16133 /// The mask is coming as MVT::i8 and it should be truncated
16134 /// to MVT::i1 while lowering masking intrinsics.
16135 /// The main difference between ScalarMaskingNode and VectorMaskingNode is using
16136 /// "X86select" instead of "vselect". We just can't create the "vselect" node
16137 /// for a scalar instruction.
16138 static SDValue getScalarMaskingNode(SDValue Op, SDValue Mask,
16139 SDValue PreservedSrc,
16140 const X86Subtarget *Subtarget,
16141 SelectionDAG &DAG) {
16142 if (isAllOnesConstant(Mask))
16145 MVT VT = Op.getSimpleValueType();
16147 // The mask should be of type MVT::i1
16148 SDValue IMask = DAG.getNode(ISD::TRUNCATE, dl, MVT::i1, Mask);
16150 if (Op.getOpcode() == X86ISD::FSETCC)
16151 return DAG.getNode(ISD::AND, dl, VT, Op, IMask);
16152 if (Op.getOpcode() == X86ISD::VFPCLASS ||
16153 Op.getOpcode() == X86ISD::VFPCLASSS)
16154 return DAG.getNode(ISD::OR, dl, VT, Op, IMask);
16156 if (PreservedSrc.getOpcode() == ISD::UNDEF)
16157 PreservedSrc = getZeroVector(VT, Subtarget, DAG, dl);
16158 return DAG.getNode(X86ISD::SELECT, dl, VT, IMask, Op, PreservedSrc);
16161 static int getSEHRegistrationNodeSize(const Function *Fn) {
16162 if (!Fn->hasPersonalityFn())
16163 report_fatal_error(
16164 "querying registration node size for function without personality");
16165 // The RegNodeSize is 6 32-bit words for SEH and 4 for C++ EH. See
16166 // WinEHStatePass for the full struct definition.
16167 switch (classifyEHPersonality(Fn->getPersonalityFn())) {
16168 case EHPersonality::MSVC_X86SEH: return 24;
16169 case EHPersonality::MSVC_CXX: return 16;
16172 report_fatal_error(
16173 "can only recover FP for 32-bit MSVC EH personality functions");
16176 /// When the 32-bit MSVC runtime transfers control to us, either to an outlined
16177 /// function or when returning to a parent frame after catching an exception, we
16178 /// recover the parent frame pointer by doing arithmetic on the incoming EBP.
16179 /// Here's the math:
16180 /// RegNodeBase = EntryEBP - RegNodeSize
16181 /// ParentFP = RegNodeBase - RegNodeFrameOffset
16182 /// Subtracting RegNodeSize takes us to the offset of the registration node, and
16183 /// subtracting the offset (negative on x86) takes us back to the parent FP.
16184 static SDValue recoverFramePointer(SelectionDAG &DAG, const Function *Fn,
16185 SDValue EntryEBP) {
16186 MachineFunction &MF = DAG.getMachineFunction();
16189 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
16190 MVT PtrVT = TLI.getPointerTy(DAG.getDataLayout());
16192 // It's possible that the parent function no longer has a personality function
16193 // if the exceptional code was optimized away, in which case we just return
16194 // the incoming EBP.
16195 if (!Fn->hasPersonalityFn())
16198 int RegNodeSize = getSEHRegistrationNodeSize(Fn);
16200 // Get an MCSymbol that will ultimately resolve to the frame offset of the EH
16202 MCSymbol *OffsetSym =
16203 MF.getMMI().getContext().getOrCreateParentFrameOffsetSymbol(
16204 GlobalValue::getRealLinkageName(Fn->getName()));
16205 SDValue OffsetSymVal = DAG.getMCSymbol(OffsetSym, PtrVT);
16206 SDValue RegNodeFrameOffset =
16207 DAG.getNode(ISD::LOCAL_RECOVER, dl, PtrVT, OffsetSymVal);
16209 // RegNodeBase = EntryEBP - RegNodeSize
16210 // ParentFP = RegNodeBase - RegNodeFrameOffset
16211 SDValue RegNodeBase = DAG.getNode(ISD::SUB, dl, PtrVT, EntryEBP,
16212 DAG.getConstant(RegNodeSize, dl, PtrVT));
16213 return DAG.getNode(ISD::SUB, dl, PtrVT, RegNodeBase, RegNodeFrameOffset);
16216 static SDValue LowerINTRINSIC_WO_CHAIN(SDValue Op, const X86Subtarget *Subtarget,
16217 SelectionDAG &DAG) {
16219 unsigned IntNo = cast<ConstantSDNode>(Op.getOperand(0))->getZExtValue();
16220 MVT VT = Op.getSimpleValueType();
16221 const IntrinsicData* IntrData = getIntrinsicWithoutChain(IntNo);
16223 switch(IntrData->Type) {
16224 case INTR_TYPE_1OP:
16225 return DAG.getNode(IntrData->Opc0, dl, Op.getValueType(), Op.getOperand(1));
16226 case INTR_TYPE_2OP:
16227 return DAG.getNode(IntrData->Opc0, dl, Op.getValueType(), Op.getOperand(1),
16229 case INTR_TYPE_2OP_IMM8:
16230 return DAG.getNode(IntrData->Opc0, dl, Op.getValueType(), Op.getOperand(1),
16231 DAG.getNode(ISD::TRUNCATE, dl, MVT::i8, Op.getOperand(2)));
16232 case INTR_TYPE_3OP:
16233 return DAG.getNode(IntrData->Opc0, dl, Op.getValueType(), Op.getOperand(1),
16234 Op.getOperand(2), Op.getOperand(3));
16235 case INTR_TYPE_4OP:
16236 return DAG.getNode(IntrData->Opc0, dl, Op.getValueType(), Op.getOperand(1),
16237 Op.getOperand(2), Op.getOperand(3), Op.getOperand(4));
16238 case INTR_TYPE_1OP_MASK_RM: {
16239 SDValue Src = Op.getOperand(1);
16240 SDValue PassThru = Op.getOperand(2);
16241 SDValue Mask = Op.getOperand(3);
16242 SDValue RoundingMode;
16243 // We allways add rounding mode to the Node.
16244 // If the rounding mode is not specified, we add the
16245 // "current direction" mode.
16246 if (Op.getNumOperands() == 4)
16248 DAG.getConstant(X86::STATIC_ROUNDING::CUR_DIRECTION, dl, MVT::i32);
16250 RoundingMode = Op.getOperand(4);
16251 unsigned IntrWithRoundingModeOpcode = IntrData->Opc1;
16252 if (IntrWithRoundingModeOpcode != 0)
16253 if (cast<ConstantSDNode>(RoundingMode)->getZExtValue() !=
16254 X86::STATIC_ROUNDING::CUR_DIRECTION)
16255 return getVectorMaskingNode(DAG.getNode(IntrWithRoundingModeOpcode,
16256 dl, Op.getValueType(), Src, RoundingMode),
16257 Mask, PassThru, Subtarget, DAG);
16258 return getVectorMaskingNode(DAG.getNode(IntrData->Opc0, dl, VT, Src,
16260 Mask, PassThru, Subtarget, DAG);
16262 case INTR_TYPE_1OP_MASK: {
16263 SDValue Src = Op.getOperand(1);
16264 SDValue PassThru = Op.getOperand(2);
16265 SDValue Mask = Op.getOperand(3);
16266 // We add rounding mode to the Node when
16267 // - RM Opcode is specified and
16268 // - RM is not "current direction".
16269 unsigned IntrWithRoundingModeOpcode = IntrData->Opc1;
16270 if (IntrWithRoundingModeOpcode != 0) {
16271 SDValue Rnd = Op.getOperand(4);
16272 unsigned Round = cast<ConstantSDNode>(Rnd)->getZExtValue();
16273 if (Round != X86::STATIC_ROUNDING::CUR_DIRECTION) {
16274 return getVectorMaskingNode(DAG.getNode(IntrWithRoundingModeOpcode,
16275 dl, Op.getValueType(),
16277 Mask, PassThru, Subtarget, DAG);
16280 return getVectorMaskingNode(DAG.getNode(IntrData->Opc0, dl, VT, Src),
16281 Mask, PassThru, Subtarget, DAG);
16283 case INTR_TYPE_SCALAR_MASK: {
16284 SDValue Src1 = Op.getOperand(1);
16285 SDValue Src2 = Op.getOperand(2);
16286 SDValue passThru = Op.getOperand(3);
16287 SDValue Mask = Op.getOperand(4);
16288 return getScalarMaskingNode(DAG.getNode(IntrData->Opc0, dl, VT, Src1, Src2),
16289 Mask, passThru, Subtarget, DAG);
16291 case INTR_TYPE_SCALAR_MASK_RM: {
16292 SDValue Src1 = Op.getOperand(1);
16293 SDValue Src2 = Op.getOperand(2);
16294 SDValue Src0 = Op.getOperand(3);
16295 SDValue Mask = Op.getOperand(4);
16296 // There are 2 kinds of intrinsics in this group:
16297 // (1) With suppress-all-exceptions (sae) or rounding mode- 6 operands
16298 // (2) With rounding mode and sae - 7 operands.
16299 if (Op.getNumOperands() == 6) {
16300 SDValue Sae = Op.getOperand(5);
16301 unsigned Opc = IntrData->Opc1 ? IntrData->Opc1 : IntrData->Opc0;
16302 return getScalarMaskingNode(DAG.getNode(Opc, dl, VT, Src1, Src2,
16304 Mask, Src0, Subtarget, DAG);
16306 assert(Op.getNumOperands() == 7 && "Unexpected intrinsic form");
16307 SDValue RoundingMode = Op.getOperand(5);
16308 SDValue Sae = Op.getOperand(6);
16309 return getScalarMaskingNode(DAG.getNode(IntrData->Opc0, dl, VT, Src1, Src2,
16310 RoundingMode, Sae),
16311 Mask, Src0, Subtarget, DAG);
16313 case INTR_TYPE_2OP_MASK:
16314 case INTR_TYPE_2OP_IMM8_MASK: {
16315 SDValue Src1 = Op.getOperand(1);
16316 SDValue Src2 = Op.getOperand(2);
16317 SDValue PassThru = Op.getOperand(3);
16318 SDValue Mask = Op.getOperand(4);
16320 if (IntrData->Type == INTR_TYPE_2OP_IMM8_MASK)
16321 Src2 = DAG.getNode(ISD::TRUNCATE, dl, MVT::i8, Src2);
16323 // We specify 2 possible opcodes for intrinsics with rounding modes.
16324 // First, we check if the intrinsic may have non-default rounding mode,
16325 // (IntrData->Opc1 != 0), then we check the rounding mode operand.
16326 unsigned IntrWithRoundingModeOpcode = IntrData->Opc1;
16327 if (IntrWithRoundingModeOpcode != 0) {
16328 SDValue Rnd = Op.getOperand(5);
16329 unsigned Round = cast<ConstantSDNode>(Rnd)->getZExtValue();
16330 if (Round != X86::STATIC_ROUNDING::CUR_DIRECTION) {
16331 return getVectorMaskingNode(DAG.getNode(IntrWithRoundingModeOpcode,
16332 dl, Op.getValueType(),
16334 Mask, PassThru, Subtarget, DAG);
16337 // TODO: Intrinsics should have fast-math-flags to propagate.
16338 return getVectorMaskingNode(DAG.getNode(IntrData->Opc0, dl, VT,Src1,Src2),
16339 Mask, PassThru, Subtarget, DAG);
16341 case INTR_TYPE_2OP_MASK_RM: {
16342 SDValue Src1 = Op.getOperand(1);
16343 SDValue Src2 = Op.getOperand(2);
16344 SDValue PassThru = Op.getOperand(3);
16345 SDValue Mask = Op.getOperand(4);
16346 // We specify 2 possible modes for intrinsics, with/without rounding
16348 // First, we check if the intrinsic have rounding mode (6 operands),
16349 // if not, we set rounding mode to "current".
16351 if (Op.getNumOperands() == 6)
16352 Rnd = Op.getOperand(5);
16354 Rnd = DAG.getConstant(X86::STATIC_ROUNDING::CUR_DIRECTION, dl, MVT::i32);
16355 return getVectorMaskingNode(DAG.getNode(IntrData->Opc0, dl, VT,
16357 Mask, PassThru, Subtarget, DAG);
16359 case INTR_TYPE_3OP_SCALAR_MASK_RM: {
16360 SDValue Src1 = Op.getOperand(1);
16361 SDValue Src2 = Op.getOperand(2);
16362 SDValue Src3 = Op.getOperand(3);
16363 SDValue PassThru = Op.getOperand(4);
16364 SDValue Mask = Op.getOperand(5);
16365 SDValue Sae = Op.getOperand(6);
16367 return getScalarMaskingNode(DAG.getNode(IntrData->Opc0, dl, VT, Src1,
16369 Mask, PassThru, Subtarget, DAG);
16371 case INTR_TYPE_3OP_MASK_RM: {
16372 SDValue Src1 = Op.getOperand(1);
16373 SDValue Src2 = Op.getOperand(2);
16374 SDValue Imm = Op.getOperand(3);
16375 SDValue PassThru = Op.getOperand(4);
16376 SDValue Mask = Op.getOperand(5);
16377 // We specify 2 possible modes for intrinsics, with/without rounding
16379 // First, we check if the intrinsic have rounding mode (7 operands),
16380 // if not, we set rounding mode to "current".
16382 if (Op.getNumOperands() == 7)
16383 Rnd = Op.getOperand(6);
16385 Rnd = DAG.getConstant(X86::STATIC_ROUNDING::CUR_DIRECTION, dl, MVT::i32);
16386 return getVectorMaskingNode(DAG.getNode(IntrData->Opc0, dl, VT,
16387 Src1, Src2, Imm, Rnd),
16388 Mask, PassThru, Subtarget, DAG);
16390 case INTR_TYPE_3OP_IMM8_MASK:
16391 case INTR_TYPE_3OP_MASK:
16392 case INSERT_SUBVEC: {
16393 SDValue Src1 = Op.getOperand(1);
16394 SDValue Src2 = Op.getOperand(2);
16395 SDValue Src3 = Op.getOperand(3);
16396 SDValue PassThru = Op.getOperand(4);
16397 SDValue Mask = Op.getOperand(5);
16399 if (IntrData->Type == INTR_TYPE_3OP_IMM8_MASK)
16400 Src3 = DAG.getNode(ISD::TRUNCATE, dl, MVT::i8, Src3);
16401 else if (IntrData->Type == INSERT_SUBVEC) {
16402 // imm should be adapted to ISD::INSERT_SUBVECTOR behavior
16403 assert(isa<ConstantSDNode>(Src3) && "Expected a ConstantSDNode here!");
16404 unsigned Imm = cast<ConstantSDNode>(Src3)->getZExtValue();
16405 Imm *= Src2.getSimpleValueType().getVectorNumElements();
16406 Src3 = DAG.getTargetConstant(Imm, dl, MVT::i32);
16409 // We specify 2 possible opcodes for intrinsics with rounding modes.
16410 // First, we check if the intrinsic may have non-default rounding mode,
16411 // (IntrData->Opc1 != 0), then we check the rounding mode operand.
16412 unsigned IntrWithRoundingModeOpcode = IntrData->Opc1;
16413 if (IntrWithRoundingModeOpcode != 0) {
16414 SDValue Rnd = Op.getOperand(6);
16415 unsigned Round = cast<ConstantSDNode>(Rnd)->getZExtValue();
16416 if (Round != X86::STATIC_ROUNDING::CUR_DIRECTION) {
16417 return getVectorMaskingNode(DAG.getNode(IntrWithRoundingModeOpcode,
16418 dl, Op.getValueType(),
16419 Src1, Src2, Src3, Rnd),
16420 Mask, PassThru, Subtarget, DAG);
16423 return getVectorMaskingNode(DAG.getNode(IntrData->Opc0, dl, VT,
16425 Mask, PassThru, Subtarget, DAG);
16427 case VPERM_3OP_MASKZ:
16428 case VPERM_3OP_MASK:{
16429 // Src2 is the PassThru
16430 SDValue Src1 = Op.getOperand(1);
16431 SDValue Src2 = Op.getOperand(2);
16432 SDValue Src3 = Op.getOperand(3);
16433 SDValue Mask = Op.getOperand(4);
16434 MVT VT = Op.getSimpleValueType();
16435 SDValue PassThru = SDValue();
16437 // set PassThru element
16438 if (IntrData->Type == VPERM_3OP_MASKZ)
16439 PassThru = getZeroVector(VT, Subtarget, DAG, dl);
16441 PassThru = DAG.getBitcast(VT, Src2);
16443 // Swap Src1 and Src2 in the node creation
16444 return getVectorMaskingNode(DAG.getNode(IntrData->Opc0,
16445 dl, Op.getValueType(),
16447 Mask, PassThru, Subtarget, DAG);
16451 case FMA_OP_MASK: {
16452 SDValue Src1 = Op.getOperand(1);
16453 SDValue Src2 = Op.getOperand(2);
16454 SDValue Src3 = Op.getOperand(3);
16455 SDValue Mask = Op.getOperand(4);
16456 MVT VT = Op.getSimpleValueType();
16457 SDValue PassThru = SDValue();
16459 // set PassThru element
16460 if (IntrData->Type == FMA_OP_MASKZ)
16461 PassThru = getZeroVector(VT, Subtarget, DAG, dl);
16462 else if (IntrData->Type == FMA_OP_MASK3)
16467 // We specify 2 possible opcodes for intrinsics with rounding modes.
16468 // First, we check if the intrinsic may have non-default rounding mode,
16469 // (IntrData->Opc1 != 0), then we check the rounding mode operand.
16470 unsigned IntrWithRoundingModeOpcode = IntrData->Opc1;
16471 if (IntrWithRoundingModeOpcode != 0) {
16472 SDValue Rnd = Op.getOperand(5);
16473 if (cast<ConstantSDNode>(Rnd)->getZExtValue() !=
16474 X86::STATIC_ROUNDING::CUR_DIRECTION)
16475 return getVectorMaskingNode(DAG.getNode(IntrWithRoundingModeOpcode,
16476 dl, Op.getValueType(),
16477 Src1, Src2, Src3, Rnd),
16478 Mask, PassThru, Subtarget, DAG);
16480 return getVectorMaskingNode(DAG.getNode(IntrData->Opc0,
16481 dl, Op.getValueType(),
16483 Mask, PassThru, Subtarget, DAG);
16485 case TERLOG_OP_MASK:
16486 case TERLOG_OP_MASKZ: {
16487 SDValue Src1 = Op.getOperand(1);
16488 SDValue Src2 = Op.getOperand(2);
16489 SDValue Src3 = Op.getOperand(3);
16490 SDValue Src4 = DAG.getNode(ISD::TRUNCATE, dl, MVT::i8, Op.getOperand(4));
16491 SDValue Mask = Op.getOperand(5);
16492 MVT VT = Op.getSimpleValueType();
16493 SDValue PassThru = Src1;
16494 // Set PassThru element.
16495 if (IntrData->Type == TERLOG_OP_MASKZ)
16496 PassThru = getZeroVector(VT, Subtarget, DAG, dl);
16498 return getVectorMaskingNode(DAG.getNode(IntrData->Opc0, dl, VT,
16499 Src1, Src2, Src3, Src4),
16500 Mask, PassThru, Subtarget, DAG);
16503 // FPclass intrinsics with mask
16504 SDValue Src1 = Op.getOperand(1);
16505 MVT VT = Src1.getSimpleValueType();
16506 MVT MaskVT = MVT::getVectorVT(MVT::i1, VT.getVectorNumElements());
16507 SDValue Imm = Op.getOperand(2);
16508 SDValue Mask = Op.getOperand(3);
16509 MVT BitcastVT = MVT::getVectorVT(MVT::i1,
16510 Mask.getSimpleValueType().getSizeInBits());
16511 SDValue FPclass = DAG.getNode(IntrData->Opc0, dl, MaskVT, Src1, Imm);
16512 SDValue FPclassMask = getVectorMaskingNode(FPclass, Mask,
16513 DAG.getTargetConstant(0, dl, MaskVT),
16515 SDValue Res = DAG.getNode(ISD::INSERT_SUBVECTOR, dl, BitcastVT,
16516 DAG.getUNDEF(BitcastVT), FPclassMask,
16517 DAG.getIntPtrConstant(0, dl));
16518 return DAG.getBitcast(Op.getValueType(), Res);
16521 SDValue Src1 = Op.getOperand(1);
16522 SDValue Imm = Op.getOperand(2);
16523 SDValue Mask = Op.getOperand(3);
16524 SDValue FPclass = DAG.getNode(IntrData->Opc0, dl, MVT::i1, Src1, Imm);
16525 SDValue FPclassMask = getScalarMaskingNode(FPclass, Mask,
16526 DAG.getTargetConstant(0, dl, MVT::i1), Subtarget, DAG);
16527 return DAG.getNode(ISD::SIGN_EXTEND, dl, MVT::i8, FPclassMask);
16530 case CMP_MASK_CC: {
16531 // Comparison intrinsics with masks.
16532 // Example of transformation:
16533 // (i8 (int_x86_avx512_mask_pcmpeq_q_128
16534 // (v2i64 %a), (v2i64 %b), (i8 %mask))) ->
16536 // (v8i1 (insert_subvector undef,
16537 // (v2i1 (and (PCMPEQM %a, %b),
16538 // (extract_subvector
16539 // (v8i1 (bitcast %mask)), 0))), 0))))
16540 MVT VT = Op.getOperand(1).getSimpleValueType();
16541 MVT MaskVT = MVT::getVectorVT(MVT::i1, VT.getVectorNumElements());
16542 SDValue Mask = Op.getOperand((IntrData->Type == CMP_MASK_CC) ? 4 : 3);
16543 MVT BitcastVT = MVT::getVectorVT(MVT::i1,
16544 Mask.getSimpleValueType().getSizeInBits());
16546 if (IntrData->Type == CMP_MASK_CC) {
16547 SDValue CC = Op.getOperand(3);
16548 CC = DAG.getNode(ISD::TRUNCATE, dl, MVT::i8, CC);
16549 // We specify 2 possible opcodes for intrinsics with rounding modes.
16550 // First, we check if the intrinsic may have non-default rounding mode,
16551 // (IntrData->Opc1 != 0), then we check the rounding mode operand.
16552 if (IntrData->Opc1 != 0) {
16553 SDValue Rnd = Op.getOperand(5);
16554 if (cast<ConstantSDNode>(Rnd)->getZExtValue() !=
16555 X86::STATIC_ROUNDING::CUR_DIRECTION)
16556 Cmp = DAG.getNode(IntrData->Opc1, dl, MaskVT, Op.getOperand(1),
16557 Op.getOperand(2), CC, Rnd);
16559 //default rounding mode
16561 Cmp = DAG.getNode(IntrData->Opc0, dl, MaskVT, Op.getOperand(1),
16562 Op.getOperand(2), CC);
16565 assert(IntrData->Type == CMP_MASK && "Unexpected intrinsic type!");
16566 Cmp = DAG.getNode(IntrData->Opc0, dl, MaskVT, Op.getOperand(1),
16569 SDValue CmpMask = getVectorMaskingNode(Cmp, Mask,
16570 DAG.getTargetConstant(0, dl,
16573 SDValue Res = DAG.getNode(ISD::INSERT_SUBVECTOR, dl, BitcastVT,
16574 DAG.getUNDEF(BitcastVT), CmpMask,
16575 DAG.getIntPtrConstant(0, dl));
16576 return DAG.getBitcast(Op.getValueType(), Res);
16578 case CMP_MASK_SCALAR_CC: {
16579 SDValue Src1 = Op.getOperand(1);
16580 SDValue Src2 = Op.getOperand(2);
16581 SDValue CC = DAG.getNode(ISD::TRUNCATE, dl, MVT::i8, Op.getOperand(3));
16582 SDValue Mask = Op.getOperand(4);
16585 if (IntrData->Opc1 != 0) {
16586 SDValue Rnd = Op.getOperand(5);
16587 if (cast<ConstantSDNode>(Rnd)->getZExtValue() !=
16588 X86::STATIC_ROUNDING::CUR_DIRECTION)
16589 Cmp = DAG.getNode(IntrData->Opc1, dl, MVT::i1, Src1, Src2, CC, Rnd);
16591 //default rounding mode
16593 Cmp = DAG.getNode(IntrData->Opc0, dl, MVT::i1, Src1, Src2, CC);
16595 SDValue CmpMask = getScalarMaskingNode(Cmp, Mask,
16596 DAG.getTargetConstant(0, dl,
16600 return DAG.getNode(ISD::SIGN_EXTEND_INREG, dl, MVT::i8,
16601 DAG.getNode(ISD::ANY_EXTEND, dl, MVT::i8, CmpMask),
16602 DAG.getValueType(MVT::i1));
16604 case COMI: { // Comparison intrinsics
16605 ISD::CondCode CC = (ISD::CondCode)IntrData->Opc1;
16606 SDValue LHS = Op.getOperand(1);
16607 SDValue RHS = Op.getOperand(2);
16608 unsigned X86CC = TranslateX86CC(CC, dl, true, LHS, RHS, DAG);
16609 assert(X86CC != X86::COND_INVALID && "Unexpected illegal condition!");
16610 SDValue Cond = DAG.getNode(IntrData->Opc0, dl, MVT::i32, LHS, RHS);
16611 SDValue SetCC = DAG.getNode(X86ISD::SETCC, dl, MVT::i8,
16612 DAG.getConstant(X86CC, dl, MVT::i8), Cond);
16613 return DAG.getNode(ISD::ZERO_EXTEND, dl, MVT::i32, SetCC);
16615 case COMI_RM: { // Comparison intrinsics with Sae
16616 SDValue LHS = Op.getOperand(1);
16617 SDValue RHS = Op.getOperand(2);
16618 SDValue CC = Op.getOperand(3);
16619 SDValue Sae = Op.getOperand(4);
16620 auto ComiType = TranslateX86ConstCondToX86CC(CC);
16621 // choose between ordered and unordered (comi/ucomi)
16622 unsigned comiOp = std::get<0>(ComiType) ? IntrData->Opc0 : IntrData->Opc1;
16624 if (cast<ConstantSDNode>(Sae)->getZExtValue() !=
16625 X86::STATIC_ROUNDING::CUR_DIRECTION)
16626 Cond = DAG.getNode(comiOp, dl, MVT::i32, LHS, RHS, Sae);
16628 Cond = DAG.getNode(comiOp, dl, MVT::i32, LHS, RHS);
16629 SDValue SetCC = DAG.getNode(X86ISD::SETCC, dl, MVT::i8,
16630 DAG.getConstant(std::get<1>(ComiType), dl, MVT::i8), Cond);
16631 return DAG.getNode(ISD::ZERO_EXTEND, dl, MVT::i32, SetCC);
16634 return getTargetVShiftNode(IntrData->Opc0, dl, Op.getSimpleValueType(),
16635 Op.getOperand(1), Op.getOperand(2), DAG);
16637 return getVectorMaskingNode(getTargetVShiftNode(IntrData->Opc0, dl,
16638 Op.getSimpleValueType(),
16640 Op.getOperand(2), DAG),
16641 Op.getOperand(4), Op.getOperand(3), Subtarget,
16643 case COMPRESS_EXPAND_IN_REG: {
16644 SDValue Mask = Op.getOperand(3);
16645 SDValue DataToCompress = Op.getOperand(1);
16646 SDValue PassThru = Op.getOperand(2);
16647 if (isAllOnesConstant(Mask)) // return data as is
16648 return Op.getOperand(1);
16650 return getVectorMaskingNode(DAG.getNode(IntrData->Opc0, dl, VT,
16652 Mask, PassThru, Subtarget, DAG);
16655 SDValue Mask = Op.getOperand(1);
16656 MVT MaskVT = MVT::getVectorVT(MVT::i1, Mask.getSimpleValueType().getSizeInBits());
16657 Mask = DAG.getBitcast(MaskVT, Mask);
16658 return DAG.getNode(IntrData->Opc0, dl, Op.getValueType(), Mask);
16661 SDValue Mask = Op.getOperand(3);
16662 MVT VT = Op.getSimpleValueType();
16663 MVT MaskVT = MVT::getVectorVT(MVT::i1, VT.getVectorNumElements());
16664 SDValue VMask = getMaskNode(Mask, MaskVT, Subtarget, DAG, dl);
16665 return DAG.getNode(IntrData->Opc0, dl, VT, VMask, Op.getOperand(1),
16669 MVT VT = Op.getSimpleValueType();
16670 MVT MaskVT = MVT::getVectorVT(MVT::i1, VT.getSizeInBits()/2);
16672 SDValue Src1 = getMaskNode(Op.getOperand(1), MaskVT, Subtarget, DAG, dl);
16673 SDValue Src2 = getMaskNode(Op.getOperand(2), MaskVT, Subtarget, DAG, dl);
16674 // Arguments should be swapped.
16675 SDValue Res = DAG.getNode(IntrData->Opc0, dl,
16676 MVT::getVectorVT(MVT::i1, VT.getSizeInBits()),
16678 return DAG.getBitcast(VT, Res);
16686 default: return SDValue(); // Don't custom lower most intrinsics.
16688 case Intrinsic::x86_avx2_permd:
16689 case Intrinsic::x86_avx2_permps:
16690 // Operands intentionally swapped. Mask is last operand to intrinsic,
16691 // but second operand for node/instruction.
16692 return DAG.getNode(X86ISD::VPERMV, dl, Op.getValueType(),
16693 Op.getOperand(2), Op.getOperand(1));
16695 // ptest and testp intrinsics. The intrinsic these come from are designed to
16696 // return an integer value, not just an instruction so lower it to the ptest
16697 // or testp pattern and a setcc for the result.
16698 case Intrinsic::x86_sse41_ptestz:
16699 case Intrinsic::x86_sse41_ptestc:
16700 case Intrinsic::x86_sse41_ptestnzc:
16701 case Intrinsic::x86_avx_ptestz_256:
16702 case Intrinsic::x86_avx_ptestc_256:
16703 case Intrinsic::x86_avx_ptestnzc_256:
16704 case Intrinsic::x86_avx_vtestz_ps:
16705 case Intrinsic::x86_avx_vtestc_ps:
16706 case Intrinsic::x86_avx_vtestnzc_ps:
16707 case Intrinsic::x86_avx_vtestz_pd:
16708 case Intrinsic::x86_avx_vtestc_pd:
16709 case Intrinsic::x86_avx_vtestnzc_pd:
16710 case Intrinsic::x86_avx_vtestz_ps_256:
16711 case Intrinsic::x86_avx_vtestc_ps_256:
16712 case Intrinsic::x86_avx_vtestnzc_ps_256:
16713 case Intrinsic::x86_avx_vtestz_pd_256:
16714 case Intrinsic::x86_avx_vtestc_pd_256:
16715 case Intrinsic::x86_avx_vtestnzc_pd_256: {
16716 bool IsTestPacked = false;
16719 default: llvm_unreachable("Bad fallthrough in Intrinsic lowering.");
16720 case Intrinsic::x86_avx_vtestz_ps:
16721 case Intrinsic::x86_avx_vtestz_pd:
16722 case Intrinsic::x86_avx_vtestz_ps_256:
16723 case Intrinsic::x86_avx_vtestz_pd_256:
16724 IsTestPacked = true; // Fallthrough
16725 case Intrinsic::x86_sse41_ptestz:
16726 case Intrinsic::x86_avx_ptestz_256:
16728 X86CC = X86::COND_E;
16730 case Intrinsic::x86_avx_vtestc_ps:
16731 case Intrinsic::x86_avx_vtestc_pd:
16732 case Intrinsic::x86_avx_vtestc_ps_256:
16733 case Intrinsic::x86_avx_vtestc_pd_256:
16734 IsTestPacked = true; // Fallthrough
16735 case Intrinsic::x86_sse41_ptestc:
16736 case Intrinsic::x86_avx_ptestc_256:
16738 X86CC = X86::COND_B;
16740 case Intrinsic::x86_avx_vtestnzc_ps:
16741 case Intrinsic::x86_avx_vtestnzc_pd:
16742 case Intrinsic::x86_avx_vtestnzc_ps_256:
16743 case Intrinsic::x86_avx_vtestnzc_pd_256:
16744 IsTestPacked = true; // Fallthrough
16745 case Intrinsic::x86_sse41_ptestnzc:
16746 case Intrinsic::x86_avx_ptestnzc_256:
16748 X86CC = X86::COND_A;
16752 SDValue LHS = Op.getOperand(1);
16753 SDValue RHS = Op.getOperand(2);
16754 unsigned TestOpc = IsTestPacked ? X86ISD::TESTP : X86ISD::PTEST;
16755 SDValue Test = DAG.getNode(TestOpc, dl, MVT::i32, LHS, RHS);
16756 SDValue CC = DAG.getConstant(X86CC, dl, MVT::i8);
16757 SDValue SetCC = DAG.getNode(X86ISD::SETCC, dl, MVT::i8, CC, Test);
16758 return DAG.getNode(ISD::ZERO_EXTEND, dl, MVT::i32, SetCC);
16760 case Intrinsic::x86_avx512_kortestz_w:
16761 case Intrinsic::x86_avx512_kortestc_w: {
16762 unsigned X86CC = (IntNo == Intrinsic::x86_avx512_kortestz_w)? X86::COND_E: X86::COND_B;
16763 SDValue LHS = DAG.getBitcast(MVT::v16i1, Op.getOperand(1));
16764 SDValue RHS = DAG.getBitcast(MVT::v16i1, Op.getOperand(2));
16765 SDValue CC = DAG.getConstant(X86CC, dl, MVT::i8);
16766 SDValue Test = DAG.getNode(X86ISD::KORTEST, dl, MVT::i32, LHS, RHS);
16767 SDValue SetCC = DAG.getNode(X86ISD::SETCC, dl, MVT::i1, CC, Test);
16768 return DAG.getNode(ISD::ZERO_EXTEND, dl, MVT::i32, SetCC);
16771 case Intrinsic::x86_sse42_pcmpistria128:
16772 case Intrinsic::x86_sse42_pcmpestria128:
16773 case Intrinsic::x86_sse42_pcmpistric128:
16774 case Intrinsic::x86_sse42_pcmpestric128:
16775 case Intrinsic::x86_sse42_pcmpistrio128:
16776 case Intrinsic::x86_sse42_pcmpestrio128:
16777 case Intrinsic::x86_sse42_pcmpistris128:
16778 case Intrinsic::x86_sse42_pcmpestris128:
16779 case Intrinsic::x86_sse42_pcmpistriz128:
16780 case Intrinsic::x86_sse42_pcmpestriz128: {
16784 default: llvm_unreachable("Impossible intrinsic"); // Can't reach here.
16785 case Intrinsic::x86_sse42_pcmpistria128:
16786 Opcode = X86ISD::PCMPISTRI;
16787 X86CC = X86::COND_A;
16789 case Intrinsic::x86_sse42_pcmpestria128:
16790 Opcode = X86ISD::PCMPESTRI;
16791 X86CC = X86::COND_A;
16793 case Intrinsic::x86_sse42_pcmpistric128:
16794 Opcode = X86ISD::PCMPISTRI;
16795 X86CC = X86::COND_B;
16797 case Intrinsic::x86_sse42_pcmpestric128:
16798 Opcode = X86ISD::PCMPESTRI;
16799 X86CC = X86::COND_B;
16801 case Intrinsic::x86_sse42_pcmpistrio128:
16802 Opcode = X86ISD::PCMPISTRI;
16803 X86CC = X86::COND_O;
16805 case Intrinsic::x86_sse42_pcmpestrio128:
16806 Opcode = X86ISD::PCMPESTRI;
16807 X86CC = X86::COND_O;
16809 case Intrinsic::x86_sse42_pcmpistris128:
16810 Opcode = X86ISD::PCMPISTRI;
16811 X86CC = X86::COND_S;
16813 case Intrinsic::x86_sse42_pcmpestris128:
16814 Opcode = X86ISD::PCMPESTRI;
16815 X86CC = X86::COND_S;
16817 case Intrinsic::x86_sse42_pcmpistriz128:
16818 Opcode = X86ISD::PCMPISTRI;
16819 X86CC = X86::COND_E;
16821 case Intrinsic::x86_sse42_pcmpestriz128:
16822 Opcode = X86ISD::PCMPESTRI;
16823 X86CC = X86::COND_E;
16826 SmallVector<SDValue, 5> NewOps(Op->op_begin()+1, Op->op_end());
16827 SDVTList VTs = DAG.getVTList(Op.getValueType(), MVT::i32);
16828 SDValue PCMP = DAG.getNode(Opcode, dl, VTs, NewOps);
16829 SDValue SetCC = DAG.getNode(X86ISD::SETCC, dl, MVT::i8,
16830 DAG.getConstant(X86CC, dl, MVT::i8),
16831 SDValue(PCMP.getNode(), 1));
16832 return DAG.getNode(ISD::ZERO_EXTEND, dl, MVT::i32, SetCC);
16835 case Intrinsic::x86_sse42_pcmpistri128:
16836 case Intrinsic::x86_sse42_pcmpestri128: {
16838 if (IntNo == Intrinsic::x86_sse42_pcmpistri128)
16839 Opcode = X86ISD::PCMPISTRI;
16841 Opcode = X86ISD::PCMPESTRI;
16843 SmallVector<SDValue, 5> NewOps(Op->op_begin()+1, Op->op_end());
16844 SDVTList VTs = DAG.getVTList(Op.getValueType(), MVT::i32);
16845 return DAG.getNode(Opcode, dl, VTs, NewOps);
16848 case Intrinsic::x86_seh_lsda: {
16849 // Compute the symbol for the LSDA. We know it'll get emitted later.
16850 MachineFunction &MF = DAG.getMachineFunction();
16851 SDValue Op1 = Op.getOperand(1);
16852 auto *Fn = cast<Function>(cast<GlobalAddressSDNode>(Op1)->getGlobal());
16853 MCSymbol *LSDASym = MF.getMMI().getContext().getOrCreateLSDASymbol(
16854 GlobalValue::getRealLinkageName(Fn->getName()));
16856 // Generate a simple absolute symbol reference. This intrinsic is only
16857 // supported on 32-bit Windows, which isn't PIC.
16858 SDValue Result = DAG.getMCSymbol(LSDASym, VT);
16859 return DAG.getNode(X86ISD::Wrapper, dl, VT, Result);
16862 case Intrinsic::x86_seh_recoverfp: {
16863 SDValue FnOp = Op.getOperand(1);
16864 SDValue IncomingFPOp = Op.getOperand(2);
16865 GlobalAddressSDNode *GSD = dyn_cast<GlobalAddressSDNode>(FnOp);
16866 auto *Fn = dyn_cast_or_null<Function>(GSD ? GSD->getGlobal() : nullptr);
16868 report_fatal_error(
16869 "llvm.x86.seh.recoverfp must take a function as the first argument");
16870 return recoverFramePointer(DAG, Fn, IncomingFPOp);
16873 case Intrinsic::localaddress: {
16874 // Returns one of the stack, base, or frame pointer registers, depending on
16875 // which is used to reference local variables.
16876 MachineFunction &MF = DAG.getMachineFunction();
16877 const X86RegisterInfo *RegInfo = Subtarget->getRegisterInfo();
16879 if (RegInfo->hasBasePointer(MF))
16880 Reg = RegInfo->getBaseRegister();
16881 else // This function handles the SP or FP case.
16882 Reg = RegInfo->getPtrSizedFrameRegister(MF);
16883 return DAG.getCopyFromReg(DAG.getEntryNode(), dl, Reg, VT);
16888 static SDValue getGatherNode(unsigned Opc, SDValue Op, SelectionDAG &DAG,
16889 SDValue Src, SDValue Mask, SDValue Base,
16890 SDValue Index, SDValue ScaleOp, SDValue Chain,
16891 const X86Subtarget * Subtarget) {
16893 auto *C = cast<ConstantSDNode>(ScaleOp);
16894 SDValue Scale = DAG.getTargetConstant(C->getZExtValue(), dl, MVT::i8);
16895 MVT MaskVT = MVT::getVectorVT(MVT::i1,
16896 Index.getSimpleValueType().getVectorNumElements());
16898 ConstantSDNode *MaskC = dyn_cast<ConstantSDNode>(Mask);
16900 MaskInReg = DAG.getTargetConstant(MaskC->getSExtValue(), dl, MaskVT);
16902 MVT BitcastVT = MVT::getVectorVT(MVT::i1,
16903 Mask.getSimpleValueType().getSizeInBits());
16905 // In case when MaskVT equals v2i1 or v4i1, low 2 or 4 elements
16906 // are extracted by EXTRACT_SUBVECTOR.
16907 MaskInReg = DAG.getNode(ISD::EXTRACT_SUBVECTOR, dl, MaskVT,
16908 DAG.getBitcast(BitcastVT, Mask),
16909 DAG.getIntPtrConstant(0, dl));
16911 SDVTList VTs = DAG.getVTList(Op.getValueType(), MaskVT, MVT::Other);
16912 SDValue Disp = DAG.getTargetConstant(0, dl, MVT::i32);
16913 SDValue Segment = DAG.getRegister(0, MVT::i32);
16914 if (Src.getOpcode() == ISD::UNDEF)
16915 Src = getZeroVector(Op.getSimpleValueType(), Subtarget, DAG, dl);
16916 SDValue Ops[] = {Src, MaskInReg, Base, Scale, Index, Disp, Segment, Chain};
16917 SDNode *Res = DAG.getMachineNode(Opc, dl, VTs, Ops);
16918 SDValue RetOps[] = { SDValue(Res, 0), SDValue(Res, 2) };
16919 return DAG.getMergeValues(RetOps, dl);
16922 static SDValue getScatterNode(unsigned Opc, SDValue Op, SelectionDAG &DAG,
16923 SDValue Src, SDValue Mask, SDValue Base,
16924 SDValue Index, SDValue ScaleOp, SDValue Chain) {
16926 auto *C = cast<ConstantSDNode>(ScaleOp);
16927 SDValue Scale = DAG.getTargetConstant(C->getZExtValue(), dl, MVT::i8);
16928 SDValue Disp = DAG.getTargetConstant(0, dl, MVT::i32);
16929 SDValue Segment = DAG.getRegister(0, MVT::i32);
16930 MVT MaskVT = MVT::getVectorVT(MVT::i1,
16931 Index.getSimpleValueType().getVectorNumElements());
16933 ConstantSDNode *MaskC = dyn_cast<ConstantSDNode>(Mask);
16935 MaskInReg = DAG.getTargetConstant(MaskC->getSExtValue(), dl, MaskVT);
16937 MVT BitcastVT = MVT::getVectorVT(MVT::i1,
16938 Mask.getSimpleValueType().getSizeInBits());
16940 // In case when MaskVT equals v2i1 or v4i1, low 2 or 4 elements
16941 // are extracted by EXTRACT_SUBVECTOR.
16942 MaskInReg = DAG.getNode(ISD::EXTRACT_SUBVECTOR, dl, MaskVT,
16943 DAG.getBitcast(BitcastVT, Mask),
16944 DAG.getIntPtrConstant(0, dl));
16946 SDVTList VTs = DAG.getVTList(MaskVT, MVT::Other);
16947 SDValue Ops[] = {Base, Scale, Index, Disp, Segment, MaskInReg, Src, Chain};
16948 SDNode *Res = DAG.getMachineNode(Opc, dl, VTs, Ops);
16949 return SDValue(Res, 1);
16952 static SDValue getPrefetchNode(unsigned Opc, SDValue Op, SelectionDAG &DAG,
16953 SDValue Mask, SDValue Base, SDValue Index,
16954 SDValue ScaleOp, SDValue Chain) {
16956 auto *C = cast<ConstantSDNode>(ScaleOp);
16957 SDValue Scale = DAG.getTargetConstant(C->getZExtValue(), dl, MVT::i8);
16958 SDValue Disp = DAG.getTargetConstant(0, dl, MVT::i32);
16959 SDValue Segment = DAG.getRegister(0, MVT::i32);
16961 MVT::getVectorVT(MVT::i1, Index.getSimpleValueType().getVectorNumElements());
16963 ConstantSDNode *MaskC = dyn_cast<ConstantSDNode>(Mask);
16965 MaskInReg = DAG.getTargetConstant(MaskC->getSExtValue(), dl, MaskVT);
16967 MaskInReg = DAG.getBitcast(MaskVT, Mask);
16968 //SDVTList VTs = DAG.getVTList(MVT::Other);
16969 SDValue Ops[] = {MaskInReg, Base, Scale, Index, Disp, Segment, Chain};
16970 SDNode *Res = DAG.getMachineNode(Opc, dl, MVT::Other, Ops);
16971 return SDValue(Res, 0);
16974 // getReadPerformanceCounter - Handles the lowering of builtin intrinsics that
16975 // read performance monitor counters (x86_rdpmc).
16976 static void getReadPerformanceCounter(SDNode *N, SDLoc DL,
16977 SelectionDAG &DAG, const X86Subtarget *Subtarget,
16978 SmallVectorImpl<SDValue> &Results) {
16979 assert(N->getNumOperands() == 3 && "Unexpected number of operands!");
16980 SDVTList Tys = DAG.getVTList(MVT::Other, MVT::Glue);
16983 // The ECX register is used to select the index of the performance counter
16985 SDValue Chain = DAG.getCopyToReg(N->getOperand(0), DL, X86::ECX,
16987 SDValue rd = DAG.getNode(X86ISD::RDPMC_DAG, DL, Tys, Chain);
16989 // Reads the content of a 64-bit performance counter and returns it in the
16990 // registers EDX:EAX.
16991 if (Subtarget->is64Bit()) {
16992 LO = DAG.getCopyFromReg(rd, DL, X86::RAX, MVT::i64, rd.getValue(1));
16993 HI = DAG.getCopyFromReg(LO.getValue(1), DL, X86::RDX, MVT::i64,
16996 LO = DAG.getCopyFromReg(rd, DL, X86::EAX, MVT::i32, rd.getValue(1));
16997 HI = DAG.getCopyFromReg(LO.getValue(1), DL, X86::EDX, MVT::i32,
17000 Chain = HI.getValue(1);
17002 if (Subtarget->is64Bit()) {
17003 // The EAX register is loaded with the low-order 32 bits. The EDX register
17004 // is loaded with the supported high-order bits of the counter.
17005 SDValue Tmp = DAG.getNode(ISD::SHL, DL, MVT::i64, HI,
17006 DAG.getConstant(32, DL, MVT::i8));
17007 Results.push_back(DAG.getNode(ISD::OR, DL, MVT::i64, LO, Tmp));
17008 Results.push_back(Chain);
17012 // Use a buildpair to merge the two 32-bit values into a 64-bit one.
17013 SDValue Ops[] = { LO, HI };
17014 SDValue Pair = DAG.getNode(ISD::BUILD_PAIR, DL, MVT::i64, Ops);
17015 Results.push_back(Pair);
17016 Results.push_back(Chain);
17019 // getReadTimeStampCounter - Handles the lowering of builtin intrinsics that
17020 // read the time stamp counter (x86_rdtsc and x86_rdtscp). This function is
17021 // also used to custom lower READCYCLECOUNTER nodes.
17022 static void getReadTimeStampCounter(SDNode *N, SDLoc DL, unsigned Opcode,
17023 SelectionDAG &DAG, const X86Subtarget *Subtarget,
17024 SmallVectorImpl<SDValue> &Results) {
17025 SDVTList Tys = DAG.getVTList(MVT::Other, MVT::Glue);
17026 SDValue rd = DAG.getNode(Opcode, DL, Tys, N->getOperand(0));
17029 // The processor's time-stamp counter (a 64-bit MSR) is stored into the
17030 // EDX:EAX registers. EDX is loaded with the high-order 32 bits of the MSR
17031 // and the EAX register is loaded with the low-order 32 bits.
17032 if (Subtarget->is64Bit()) {
17033 LO = DAG.getCopyFromReg(rd, DL, X86::RAX, MVT::i64, rd.getValue(1));
17034 HI = DAG.getCopyFromReg(LO.getValue(1), DL, X86::RDX, MVT::i64,
17037 LO = DAG.getCopyFromReg(rd, DL, X86::EAX, MVT::i32, rd.getValue(1));
17038 HI = DAG.getCopyFromReg(LO.getValue(1), DL, X86::EDX, MVT::i32,
17041 SDValue Chain = HI.getValue(1);
17043 if (Opcode == X86ISD::RDTSCP_DAG) {
17044 assert(N->getNumOperands() == 3 && "Unexpected number of operands!");
17046 // Instruction RDTSCP loads the IA32:TSC_AUX_MSR (address C000_0103H) into
17047 // the ECX register. Add 'ecx' explicitly to the chain.
17048 SDValue ecx = DAG.getCopyFromReg(Chain, DL, X86::ECX, MVT::i32,
17050 // Explicitly store the content of ECX at the location passed in input
17051 // to the 'rdtscp' intrinsic.
17052 Chain = DAG.getStore(ecx.getValue(1), DL, ecx, N->getOperand(2),
17053 MachinePointerInfo(), false, false, 0);
17056 if (Subtarget->is64Bit()) {
17057 // The EDX register is loaded with the high-order 32 bits of the MSR, and
17058 // the EAX register is loaded with the low-order 32 bits.
17059 SDValue Tmp = DAG.getNode(ISD::SHL, DL, MVT::i64, HI,
17060 DAG.getConstant(32, DL, MVT::i8));
17061 Results.push_back(DAG.getNode(ISD::OR, DL, MVT::i64, LO, Tmp));
17062 Results.push_back(Chain);
17066 // Use a buildpair to merge the two 32-bit values into a 64-bit one.
17067 SDValue Ops[] = { LO, HI };
17068 SDValue Pair = DAG.getNode(ISD::BUILD_PAIR, DL, MVT::i64, Ops);
17069 Results.push_back(Pair);
17070 Results.push_back(Chain);
17073 static SDValue LowerREADCYCLECOUNTER(SDValue Op, const X86Subtarget *Subtarget,
17074 SelectionDAG &DAG) {
17075 SmallVector<SDValue, 2> Results;
17077 getReadTimeStampCounter(Op.getNode(), DL, X86ISD::RDTSC_DAG, DAG, Subtarget,
17079 return DAG.getMergeValues(Results, DL);
17082 static SDValue MarkEHRegistrationNode(SDValue Op, SelectionDAG &DAG) {
17083 MachineFunction &MF = DAG.getMachineFunction();
17084 SDValue Chain = Op.getOperand(0);
17085 SDValue RegNode = Op.getOperand(2);
17086 WinEHFuncInfo *EHInfo = MF.getWinEHFuncInfo();
17088 report_fatal_error("EH registrations only live in functions using WinEH");
17090 // Cast the operand to an alloca, and remember the frame index.
17091 auto *FINode = dyn_cast<FrameIndexSDNode>(RegNode);
17093 report_fatal_error("llvm.x86.seh.ehregnode expects a static alloca");
17094 EHInfo->EHRegNodeFrameIndex = FINode->getIndex();
17096 // Return the chain operand without making any DAG nodes.
17100 /// \brief Lower intrinsics for TRUNCATE_TO_MEM case
17101 /// return truncate Store/MaskedStore Node
17102 static SDValue LowerINTRINSIC_TRUNCATE_TO_MEM(const SDValue & Op,
17106 SDValue Mask = Op.getOperand(4);
17107 SDValue DataToTruncate = Op.getOperand(3);
17108 SDValue Addr = Op.getOperand(2);
17109 SDValue Chain = Op.getOperand(0);
17111 MVT VT = DataToTruncate.getSimpleValueType();
17112 MVT SVT = MVT::getVectorVT(ElementType, VT.getVectorNumElements());
17114 if (isAllOnesConstant(Mask)) // return just a truncate store
17115 return DAG.getTruncStore(Chain, dl, DataToTruncate, Addr,
17116 MachinePointerInfo(), SVT, false, false,
17117 SVT.getScalarSizeInBits()/8);
17119 MVT MaskVT = MVT::getVectorVT(MVT::i1, VT.getVectorNumElements());
17120 MVT BitcastVT = MVT::getVectorVT(MVT::i1,
17121 Mask.getSimpleValueType().getSizeInBits());
17122 // In case when MaskVT equals v2i1 or v4i1, low 2 or 4 elements
17123 // are extracted by EXTRACT_SUBVECTOR.
17124 SDValue VMask = DAG.getNode(ISD::EXTRACT_SUBVECTOR, dl, MaskVT,
17125 DAG.getBitcast(BitcastVT, Mask),
17126 DAG.getIntPtrConstant(0, dl));
17128 MachineMemOperand *MMO = DAG.getMachineFunction().
17129 getMachineMemOperand(MachinePointerInfo(),
17130 MachineMemOperand::MOStore, SVT.getStoreSize(),
17131 SVT.getScalarSizeInBits()/8);
17133 return DAG.getMaskedStore(Chain, dl, DataToTruncate, Addr,
17134 VMask, SVT, MMO, true);
17137 static SDValue LowerINTRINSIC_W_CHAIN(SDValue Op, const X86Subtarget *Subtarget,
17138 SelectionDAG &DAG) {
17139 unsigned IntNo = cast<ConstantSDNode>(Op.getOperand(1))->getZExtValue();
17141 const IntrinsicData* IntrData = getIntrinsicWithChain(IntNo);
17143 if (IntNo == llvm::Intrinsic::x86_seh_ehregnode)
17144 return MarkEHRegistrationNode(Op, DAG);
17149 switch(IntrData->Type) {
17150 default: llvm_unreachable("Unknown Intrinsic Type");
17153 // Emit the node with the right value type.
17154 SDVTList VTs = DAG.getVTList(Op->getValueType(0), MVT::Glue, MVT::Other);
17155 SDValue Result = DAG.getNode(IntrData->Opc0, dl, VTs, Op.getOperand(0));
17157 // If the value returned by RDRAND/RDSEED was valid (CF=1), return 1.
17158 // Otherwise return the value from Rand, which is always 0, casted to i32.
17159 SDValue Ops[] = { DAG.getZExtOrTrunc(Result, dl, Op->getValueType(1)),
17160 DAG.getConstant(1, dl, Op->getValueType(1)),
17161 DAG.getConstant(X86::COND_B, dl, MVT::i32),
17162 SDValue(Result.getNode(), 1) };
17163 SDValue isValid = DAG.getNode(X86ISD::CMOV, dl,
17164 DAG.getVTList(Op->getValueType(1), MVT::Glue),
17167 // Return { result, isValid, chain }.
17168 return DAG.getNode(ISD::MERGE_VALUES, dl, Op->getVTList(), Result, isValid,
17169 SDValue(Result.getNode(), 2));
17172 //gather(v1, mask, index, base, scale);
17173 SDValue Chain = Op.getOperand(0);
17174 SDValue Src = Op.getOperand(2);
17175 SDValue Base = Op.getOperand(3);
17176 SDValue Index = Op.getOperand(4);
17177 SDValue Mask = Op.getOperand(5);
17178 SDValue Scale = Op.getOperand(6);
17179 return getGatherNode(IntrData->Opc0, Op, DAG, Src, Mask, Base, Index, Scale,
17183 //scatter(base, mask, index, v1, scale);
17184 SDValue Chain = Op.getOperand(0);
17185 SDValue Base = Op.getOperand(2);
17186 SDValue Mask = Op.getOperand(3);
17187 SDValue Index = Op.getOperand(4);
17188 SDValue Src = Op.getOperand(5);
17189 SDValue Scale = Op.getOperand(6);
17190 return getScatterNode(IntrData->Opc0, Op, DAG, Src, Mask, Base, Index,
17194 SDValue Hint = Op.getOperand(6);
17195 unsigned HintVal = cast<ConstantSDNode>(Hint)->getZExtValue();
17196 assert(HintVal < 2 && "Wrong prefetch hint in intrinsic: should be 0 or 1");
17197 unsigned Opcode = (HintVal ? IntrData->Opc1 : IntrData->Opc0);
17198 SDValue Chain = Op.getOperand(0);
17199 SDValue Mask = Op.getOperand(2);
17200 SDValue Index = Op.getOperand(3);
17201 SDValue Base = Op.getOperand(4);
17202 SDValue Scale = Op.getOperand(5);
17203 return getPrefetchNode(Opcode, Op, DAG, Mask, Base, Index, Scale, Chain);
17205 // Read Time Stamp Counter (RDTSC) and Processor ID (RDTSCP).
17207 SmallVector<SDValue, 2> Results;
17208 getReadTimeStampCounter(Op.getNode(), dl, IntrData->Opc0, DAG, Subtarget,
17210 return DAG.getMergeValues(Results, dl);
17212 // Read Performance Monitoring Counters.
17214 SmallVector<SDValue, 2> Results;
17215 getReadPerformanceCounter(Op.getNode(), dl, DAG, Subtarget, Results);
17216 return DAG.getMergeValues(Results, dl);
17218 // XTEST intrinsics.
17220 SDVTList VTs = DAG.getVTList(Op->getValueType(0), MVT::Other);
17221 SDValue InTrans = DAG.getNode(IntrData->Opc0, dl, VTs, Op.getOperand(0));
17222 SDValue SetCC = DAG.getNode(X86ISD::SETCC, dl, MVT::i8,
17223 DAG.getConstant(X86::COND_NE, dl, MVT::i8),
17225 SDValue Ret = DAG.getNode(ISD::ZERO_EXTEND, dl, Op->getValueType(0), SetCC);
17226 return DAG.getNode(ISD::MERGE_VALUES, dl, Op->getVTList(),
17227 Ret, SDValue(InTrans.getNode(), 1));
17231 SmallVector<SDValue, 2> Results;
17232 SDVTList CFVTs = DAG.getVTList(Op->getValueType(0), MVT::Other);
17233 SDVTList VTs = DAG.getVTList(Op.getOperand(3)->getValueType(0), MVT::Other);
17234 SDValue GenCF = DAG.getNode(X86ISD::ADD, dl, CFVTs, Op.getOperand(2),
17235 DAG.getConstant(-1, dl, MVT::i8));
17236 SDValue Res = DAG.getNode(IntrData->Opc0, dl, VTs, Op.getOperand(3),
17237 Op.getOperand(4), GenCF.getValue(1));
17238 SDValue Store = DAG.getStore(Op.getOperand(0), dl, Res.getValue(0),
17239 Op.getOperand(5), MachinePointerInfo(),
17241 SDValue SetCC = DAG.getNode(X86ISD::SETCC, dl, MVT::i8,
17242 DAG.getConstant(X86::COND_B, dl, MVT::i8),
17244 Results.push_back(SetCC);
17245 Results.push_back(Store);
17246 return DAG.getMergeValues(Results, dl);
17248 case COMPRESS_TO_MEM: {
17250 SDValue Mask = Op.getOperand(4);
17251 SDValue DataToCompress = Op.getOperand(3);
17252 SDValue Addr = Op.getOperand(2);
17253 SDValue Chain = Op.getOperand(0);
17255 MVT VT = DataToCompress.getSimpleValueType();
17256 if (isAllOnesConstant(Mask)) // return just a store
17257 return DAG.getStore(Chain, dl, DataToCompress, Addr,
17258 MachinePointerInfo(), false, false,
17259 VT.getScalarSizeInBits()/8);
17261 SDValue Compressed =
17262 getVectorMaskingNode(DAG.getNode(IntrData->Opc0, dl, VT, DataToCompress),
17263 Mask, DAG.getUNDEF(VT), Subtarget, DAG);
17264 return DAG.getStore(Chain, dl, Compressed, Addr,
17265 MachinePointerInfo(), false, false,
17266 VT.getScalarSizeInBits()/8);
17268 case TRUNCATE_TO_MEM_VI8:
17269 return LowerINTRINSIC_TRUNCATE_TO_MEM(Op, DAG, MVT::i8);
17270 case TRUNCATE_TO_MEM_VI16:
17271 return LowerINTRINSIC_TRUNCATE_TO_MEM(Op, DAG, MVT::i16);
17272 case TRUNCATE_TO_MEM_VI32:
17273 return LowerINTRINSIC_TRUNCATE_TO_MEM(Op, DAG, MVT::i32);
17274 case EXPAND_FROM_MEM: {
17276 SDValue Mask = Op.getOperand(4);
17277 SDValue PassThru = Op.getOperand(3);
17278 SDValue Addr = Op.getOperand(2);
17279 SDValue Chain = Op.getOperand(0);
17280 MVT VT = Op.getSimpleValueType();
17282 if (isAllOnesConstant(Mask)) // return just a load
17283 return DAG.getLoad(VT, dl, Chain, Addr, MachinePointerInfo(), false, false,
17284 false, VT.getScalarSizeInBits()/8);
17286 SDValue DataToExpand = DAG.getLoad(VT, dl, Chain, Addr, MachinePointerInfo(),
17287 false, false, false,
17288 VT.getScalarSizeInBits()/8);
17290 SDValue Results[] = {
17291 getVectorMaskingNode(DAG.getNode(IntrData->Opc0, dl, VT, DataToExpand),
17292 Mask, PassThru, Subtarget, DAG), Chain};
17293 return DAG.getMergeValues(Results, dl);
17298 SDValue X86TargetLowering::LowerRETURNADDR(SDValue Op,
17299 SelectionDAG &DAG) const {
17300 MachineFrameInfo *MFI = DAG.getMachineFunction().getFrameInfo();
17301 MFI->setReturnAddressIsTaken(true);
17303 if (verifyReturnAddressArgumentIsConstant(Op, DAG))
17306 unsigned Depth = cast<ConstantSDNode>(Op.getOperand(0))->getZExtValue();
17308 EVT PtrVT = getPointerTy(DAG.getDataLayout());
17311 SDValue FrameAddr = LowerFRAMEADDR(Op, DAG);
17312 const X86RegisterInfo *RegInfo = Subtarget->getRegisterInfo();
17313 SDValue Offset = DAG.getConstant(RegInfo->getSlotSize(), dl, PtrVT);
17314 return DAG.getLoad(PtrVT, dl, DAG.getEntryNode(),
17315 DAG.getNode(ISD::ADD, dl, PtrVT,
17316 FrameAddr, Offset),
17317 MachinePointerInfo(), false, false, false, 0);
17320 // Just load the return address.
17321 SDValue RetAddrFI = getReturnAddressFrameIndex(DAG);
17322 return DAG.getLoad(PtrVT, dl, DAG.getEntryNode(),
17323 RetAddrFI, MachinePointerInfo(), false, false, false, 0);
17326 SDValue X86TargetLowering::LowerFRAMEADDR(SDValue Op, SelectionDAG &DAG) const {
17327 MachineFunction &MF = DAG.getMachineFunction();
17328 MachineFrameInfo *MFI = MF.getFrameInfo();
17329 X86MachineFunctionInfo *FuncInfo = MF.getInfo<X86MachineFunctionInfo>();
17330 const X86RegisterInfo *RegInfo = Subtarget->getRegisterInfo();
17331 EVT VT = Op.getValueType();
17333 MFI->setFrameAddressIsTaken(true);
17335 if (MF.getTarget().getMCAsmInfo()->usesWindowsCFI()) {
17336 // Depth > 0 makes no sense on targets which use Windows unwind codes. It
17337 // is not possible to crawl up the stack without looking at the unwind codes
17339 int FrameAddrIndex = FuncInfo->getFAIndex();
17340 if (!FrameAddrIndex) {
17341 // Set up a frame object for the return address.
17342 unsigned SlotSize = RegInfo->getSlotSize();
17343 FrameAddrIndex = MF.getFrameInfo()->CreateFixedObject(
17344 SlotSize, /*Offset=*/0, /*IsImmutable=*/false);
17345 FuncInfo->setFAIndex(FrameAddrIndex);
17347 return DAG.getFrameIndex(FrameAddrIndex, VT);
17350 unsigned FrameReg =
17351 RegInfo->getPtrSizedFrameRegister(DAG.getMachineFunction());
17352 SDLoc dl(Op); // FIXME probably not meaningful
17353 unsigned Depth = cast<ConstantSDNode>(Op.getOperand(0))->getZExtValue();
17354 assert(((FrameReg == X86::RBP && VT == MVT::i64) ||
17355 (FrameReg == X86::EBP && VT == MVT::i32)) &&
17356 "Invalid Frame Register!");
17357 SDValue FrameAddr = DAG.getCopyFromReg(DAG.getEntryNode(), dl, FrameReg, VT);
17359 FrameAddr = DAG.getLoad(VT, dl, DAG.getEntryNode(), FrameAddr,
17360 MachinePointerInfo(),
17361 false, false, false, 0);
17365 // FIXME? Maybe this could be a TableGen attribute on some registers and
17366 // this table could be generated automatically from RegInfo.
17367 unsigned X86TargetLowering::getRegisterByName(const char* RegName, EVT VT,
17368 SelectionDAG &DAG) const {
17369 const TargetFrameLowering &TFI = *Subtarget->getFrameLowering();
17370 const MachineFunction &MF = DAG.getMachineFunction();
17372 unsigned Reg = StringSwitch<unsigned>(RegName)
17373 .Case("esp", X86::ESP)
17374 .Case("rsp", X86::RSP)
17375 .Case("ebp", X86::EBP)
17376 .Case("rbp", X86::RBP)
17379 if (Reg == X86::EBP || Reg == X86::RBP) {
17380 if (!TFI.hasFP(MF))
17381 report_fatal_error("register " + StringRef(RegName) +
17382 " is allocatable: function has no frame pointer");
17385 const X86RegisterInfo *RegInfo = Subtarget->getRegisterInfo();
17386 unsigned FrameReg =
17387 RegInfo->getPtrSizedFrameRegister(DAG.getMachineFunction());
17388 assert((FrameReg == X86::EBP || FrameReg == X86::RBP) &&
17389 "Invalid Frame Register!");
17397 report_fatal_error("Invalid register name global variable");
17400 SDValue X86TargetLowering::LowerFRAME_TO_ARGS_OFFSET(SDValue Op,
17401 SelectionDAG &DAG) const {
17402 const X86RegisterInfo *RegInfo = Subtarget->getRegisterInfo();
17403 return DAG.getIntPtrConstant(2 * RegInfo->getSlotSize(), SDLoc(Op));
17406 unsigned X86TargetLowering::getExceptionPointerRegister(
17407 const Constant *PersonalityFn) const {
17408 if (classifyEHPersonality(PersonalityFn) == EHPersonality::CoreCLR)
17409 return Subtarget->isTarget64BitLP64() ? X86::RDX : X86::EDX;
17411 return Subtarget->isTarget64BitLP64() ? X86::RAX : X86::EAX;
17414 unsigned X86TargetLowering::getExceptionSelectorRegister(
17415 const Constant *PersonalityFn) const {
17416 // Funclet personalities don't use selectors (the runtime does the selection).
17417 assert(!isFuncletEHPersonality(classifyEHPersonality(PersonalityFn)));
17418 return Subtarget->isTarget64BitLP64() ? X86::RDX : X86::EDX;
17421 SDValue X86TargetLowering::LowerEH_RETURN(SDValue Op, SelectionDAG &DAG) const {
17422 SDValue Chain = Op.getOperand(0);
17423 SDValue Offset = Op.getOperand(1);
17424 SDValue Handler = Op.getOperand(2);
17427 EVT PtrVT = getPointerTy(DAG.getDataLayout());
17428 const X86RegisterInfo *RegInfo = Subtarget->getRegisterInfo();
17429 unsigned FrameReg = RegInfo->getFrameRegister(DAG.getMachineFunction());
17430 assert(((FrameReg == X86::RBP && PtrVT == MVT::i64) ||
17431 (FrameReg == X86::EBP && PtrVT == MVT::i32)) &&
17432 "Invalid Frame Register!");
17433 SDValue Frame = DAG.getCopyFromReg(DAG.getEntryNode(), dl, FrameReg, PtrVT);
17434 unsigned StoreAddrReg = (PtrVT == MVT::i64) ? X86::RCX : X86::ECX;
17436 SDValue StoreAddr = DAG.getNode(ISD::ADD, dl, PtrVT, Frame,
17437 DAG.getIntPtrConstant(RegInfo->getSlotSize(),
17439 StoreAddr = DAG.getNode(ISD::ADD, dl, PtrVT, StoreAddr, Offset);
17440 Chain = DAG.getStore(Chain, dl, Handler, StoreAddr, MachinePointerInfo(),
17442 Chain = DAG.getCopyToReg(Chain, dl, StoreAddrReg, StoreAddr);
17444 return DAG.getNode(X86ISD::EH_RETURN, dl, MVT::Other, Chain,
17445 DAG.getRegister(StoreAddrReg, PtrVT));
17448 SDValue X86TargetLowering::lowerEH_SJLJ_SETJMP(SDValue Op,
17449 SelectionDAG &DAG) const {
17451 return DAG.getNode(X86ISD::EH_SJLJ_SETJMP, DL,
17452 DAG.getVTList(MVT::i32, MVT::Other),
17453 Op.getOperand(0), Op.getOperand(1));
17456 SDValue X86TargetLowering::lowerEH_SJLJ_LONGJMP(SDValue Op,
17457 SelectionDAG &DAG) const {
17459 return DAG.getNode(X86ISD::EH_SJLJ_LONGJMP, DL, MVT::Other,
17460 Op.getOperand(0), Op.getOperand(1));
17463 static SDValue LowerADJUST_TRAMPOLINE(SDValue Op, SelectionDAG &DAG) {
17464 return Op.getOperand(0);
17467 SDValue X86TargetLowering::LowerINIT_TRAMPOLINE(SDValue Op,
17468 SelectionDAG &DAG) const {
17469 SDValue Root = Op.getOperand(0);
17470 SDValue Trmp = Op.getOperand(1); // trampoline
17471 SDValue FPtr = Op.getOperand(2); // nested function
17472 SDValue Nest = Op.getOperand(3); // 'nest' parameter value
17475 const Value *TrmpAddr = cast<SrcValueSDNode>(Op.getOperand(4))->getValue();
17476 const TargetRegisterInfo *TRI = Subtarget->getRegisterInfo();
17478 if (Subtarget->is64Bit()) {
17479 SDValue OutChains[6];
17481 // Large code-model.
17482 const unsigned char JMP64r = 0xFF; // 64-bit jmp through register opcode.
17483 const unsigned char MOV64ri = 0xB8; // X86::MOV64ri opcode.
17485 const unsigned char N86R10 = TRI->getEncodingValue(X86::R10) & 0x7;
17486 const unsigned char N86R11 = TRI->getEncodingValue(X86::R11) & 0x7;
17488 const unsigned char REX_WB = 0x40 | 0x08 | 0x01; // REX prefix
17490 // Load the pointer to the nested function into R11.
17491 unsigned OpCode = ((MOV64ri | N86R11) << 8) | REX_WB; // movabsq r11
17492 SDValue Addr = Trmp;
17493 OutChains[0] = DAG.getStore(Root, dl, DAG.getConstant(OpCode, dl, MVT::i16),
17494 Addr, MachinePointerInfo(TrmpAddr),
17497 Addr = DAG.getNode(ISD::ADD, dl, MVT::i64, Trmp,
17498 DAG.getConstant(2, dl, MVT::i64));
17499 OutChains[1] = DAG.getStore(Root, dl, FPtr, Addr,
17500 MachinePointerInfo(TrmpAddr, 2),
17503 // Load the 'nest' parameter value into R10.
17504 // R10 is specified in X86CallingConv.td
17505 OpCode = ((MOV64ri | N86R10) << 8) | REX_WB; // movabsq r10
17506 Addr = DAG.getNode(ISD::ADD, dl, MVT::i64, Trmp,
17507 DAG.getConstant(10, dl, MVT::i64));
17508 OutChains[2] = DAG.getStore(Root, dl, DAG.getConstant(OpCode, dl, MVT::i16),
17509 Addr, MachinePointerInfo(TrmpAddr, 10),
17512 Addr = DAG.getNode(ISD::ADD, dl, MVT::i64, Trmp,
17513 DAG.getConstant(12, dl, MVT::i64));
17514 OutChains[3] = DAG.getStore(Root, dl, Nest, Addr,
17515 MachinePointerInfo(TrmpAddr, 12),
17518 // Jump to the nested function.
17519 OpCode = (JMP64r << 8) | REX_WB; // jmpq *...
17520 Addr = DAG.getNode(ISD::ADD, dl, MVT::i64, Trmp,
17521 DAG.getConstant(20, dl, MVT::i64));
17522 OutChains[4] = DAG.getStore(Root, dl, DAG.getConstant(OpCode, dl, MVT::i16),
17523 Addr, MachinePointerInfo(TrmpAddr, 20),
17526 unsigned char ModRM = N86R11 | (4 << 3) | (3 << 6); // ...r11
17527 Addr = DAG.getNode(ISD::ADD, dl, MVT::i64, Trmp,
17528 DAG.getConstant(22, dl, MVT::i64));
17529 OutChains[5] = DAG.getStore(Root, dl, DAG.getConstant(ModRM, dl, MVT::i8),
17530 Addr, MachinePointerInfo(TrmpAddr, 22),
17533 return DAG.getNode(ISD::TokenFactor, dl, MVT::Other, OutChains);
17535 const Function *Func =
17536 cast<Function>(cast<SrcValueSDNode>(Op.getOperand(5))->getValue());
17537 CallingConv::ID CC = Func->getCallingConv();
17542 llvm_unreachable("Unsupported calling convention");
17543 case CallingConv::C:
17544 case CallingConv::X86_StdCall: {
17545 // Pass 'nest' parameter in ECX.
17546 // Must be kept in sync with X86CallingConv.td
17547 NestReg = X86::ECX;
17549 // Check that ECX wasn't needed by an 'inreg' parameter.
17550 FunctionType *FTy = Func->getFunctionType();
17551 const AttributeSet &Attrs = Func->getAttributes();
17553 if (!Attrs.isEmpty() && !Func->isVarArg()) {
17554 unsigned InRegCount = 0;
17557 for (FunctionType::param_iterator I = FTy->param_begin(),
17558 E = FTy->param_end(); I != E; ++I, ++Idx)
17559 if (Attrs.hasAttribute(Idx, Attribute::InReg)) {
17560 auto &DL = DAG.getDataLayout();
17561 // FIXME: should only count parameters that are lowered to integers.
17562 InRegCount += (DL.getTypeSizeInBits(*I) + 31) / 32;
17565 if (InRegCount > 2) {
17566 report_fatal_error("Nest register in use - reduce number of inreg"
17572 case CallingConv::X86_FastCall:
17573 case CallingConv::X86_ThisCall:
17574 case CallingConv::Fast:
17575 // Pass 'nest' parameter in EAX.
17576 // Must be kept in sync with X86CallingConv.td
17577 NestReg = X86::EAX;
17581 SDValue OutChains[4];
17582 SDValue Addr, Disp;
17584 Addr = DAG.getNode(ISD::ADD, dl, MVT::i32, Trmp,
17585 DAG.getConstant(10, dl, MVT::i32));
17586 Disp = DAG.getNode(ISD::SUB, dl, MVT::i32, FPtr, Addr);
17588 // This is storing the opcode for MOV32ri.
17589 const unsigned char MOV32ri = 0xB8; // X86::MOV32ri's opcode byte.
17590 const unsigned char N86Reg = TRI->getEncodingValue(NestReg) & 0x7;
17591 OutChains[0] = DAG.getStore(Root, dl,
17592 DAG.getConstant(MOV32ri|N86Reg, dl, MVT::i8),
17593 Trmp, MachinePointerInfo(TrmpAddr),
17596 Addr = DAG.getNode(ISD::ADD, dl, MVT::i32, Trmp,
17597 DAG.getConstant(1, dl, MVT::i32));
17598 OutChains[1] = DAG.getStore(Root, dl, Nest, Addr,
17599 MachinePointerInfo(TrmpAddr, 1),
17602 const unsigned char JMP = 0xE9; // jmp <32bit dst> opcode.
17603 Addr = DAG.getNode(ISD::ADD, dl, MVT::i32, Trmp,
17604 DAG.getConstant(5, dl, MVT::i32));
17605 OutChains[2] = DAG.getStore(Root, dl, DAG.getConstant(JMP, dl, MVT::i8),
17606 Addr, MachinePointerInfo(TrmpAddr, 5),
17609 Addr = DAG.getNode(ISD::ADD, dl, MVT::i32, Trmp,
17610 DAG.getConstant(6, dl, MVT::i32));
17611 OutChains[3] = DAG.getStore(Root, dl, Disp, Addr,
17612 MachinePointerInfo(TrmpAddr, 6),
17615 return DAG.getNode(ISD::TokenFactor, dl, MVT::Other, OutChains);
17619 SDValue X86TargetLowering::LowerFLT_ROUNDS_(SDValue Op,
17620 SelectionDAG &DAG) const {
17622 The rounding mode is in bits 11:10 of FPSR, and has the following
17624 00 Round to nearest
17629 FLT_ROUNDS, on the other hand, expects the following:
17636 To perform the conversion, we do:
17637 (((((FPSR & 0x800) >> 11) | ((FPSR & 0x400) >> 9)) + 1) & 3)
17640 MachineFunction &MF = DAG.getMachineFunction();
17641 const TargetFrameLowering &TFI = *Subtarget->getFrameLowering();
17642 unsigned StackAlignment = TFI.getStackAlignment();
17643 MVT VT = Op.getSimpleValueType();
17646 // Save FP Control Word to stack slot
17647 int SSFI = MF.getFrameInfo()->CreateStackObject(2, StackAlignment, false);
17648 SDValue StackSlot =
17649 DAG.getFrameIndex(SSFI, getPointerTy(DAG.getDataLayout()));
17651 MachineMemOperand *MMO =
17652 MF.getMachineMemOperand(MachinePointerInfo::getFixedStack(MF, SSFI),
17653 MachineMemOperand::MOStore, 2, 2);
17655 SDValue Ops[] = { DAG.getEntryNode(), StackSlot };
17656 SDValue Chain = DAG.getMemIntrinsicNode(X86ISD::FNSTCW16m, DL,
17657 DAG.getVTList(MVT::Other),
17658 Ops, MVT::i16, MMO);
17660 // Load FP Control Word from stack slot
17661 SDValue CWD = DAG.getLoad(MVT::i16, DL, Chain, StackSlot,
17662 MachinePointerInfo(), false, false, false, 0);
17664 // Transform as necessary
17666 DAG.getNode(ISD::SRL, DL, MVT::i16,
17667 DAG.getNode(ISD::AND, DL, MVT::i16,
17668 CWD, DAG.getConstant(0x800, DL, MVT::i16)),
17669 DAG.getConstant(11, DL, MVT::i8));
17671 DAG.getNode(ISD::SRL, DL, MVT::i16,
17672 DAG.getNode(ISD::AND, DL, MVT::i16,
17673 CWD, DAG.getConstant(0x400, DL, MVT::i16)),
17674 DAG.getConstant(9, DL, MVT::i8));
17677 DAG.getNode(ISD::AND, DL, MVT::i16,
17678 DAG.getNode(ISD::ADD, DL, MVT::i16,
17679 DAG.getNode(ISD::OR, DL, MVT::i16, CWD1, CWD2),
17680 DAG.getConstant(1, DL, MVT::i16)),
17681 DAG.getConstant(3, DL, MVT::i16));
17683 return DAG.getNode((VT.getSizeInBits() < 16 ?
17684 ISD::TRUNCATE : ISD::ZERO_EXTEND), DL, VT, RetVal);
17687 /// \brief Lower a vector CTLZ using native supported vector CTLZ instruction.
17689 // 1. i32/i64 128/256-bit vector (native support require VLX) are expended
17690 // to 512-bit vector.
17691 // 2. i8/i16 vector implemented using dword LZCNT vector instruction
17692 // ( sub(trunc(lzcnt(zext32(x)))) ). In case zext32(x) is illegal,
17693 // split the vector, perform operation on it's Lo a Hi part and
17694 // concatenate the results.
17695 static SDValue LowerVectorCTLZ_AVX512(SDValue Op, SelectionDAG &DAG) {
17697 MVT VT = Op.getSimpleValueType();
17698 MVT EltVT = VT.getVectorElementType();
17699 unsigned NumElems = VT.getVectorNumElements();
17701 if (EltVT == MVT::i64 || EltVT == MVT::i32) {
17702 // Extend to 512 bit vector.
17703 assert((VT.is256BitVector() || VT.is128BitVector()) &&
17704 "Unsupported value type for operation");
17706 MVT NewVT = MVT::getVectorVT(EltVT, 512 / VT.getScalarSizeInBits());
17707 SDValue Vec512 = DAG.getNode(ISD::INSERT_SUBVECTOR, dl, NewVT,
17708 DAG.getUNDEF(NewVT),
17710 DAG.getIntPtrConstant(0, dl));
17711 SDValue CtlzNode = DAG.getNode(ISD::CTLZ, dl, NewVT, Vec512);
17713 return DAG.getNode(ISD::EXTRACT_SUBVECTOR, dl, VT, CtlzNode,
17714 DAG.getIntPtrConstant(0, dl));
17717 assert((EltVT == MVT::i8 || EltVT == MVT::i16) &&
17718 "Unsupported element type");
17720 if (16 < NumElems) {
17721 // Split vector, it's Lo and Hi parts will be handled in next iteration.
17723 std::tie(Lo, Hi) = DAG.SplitVector(Op.getOperand(0), dl);
17724 MVT OutVT = MVT::getVectorVT(EltVT, NumElems/2);
17726 Lo = DAG.getNode(Op.getOpcode(), dl, OutVT, Lo);
17727 Hi = DAG.getNode(Op.getOpcode(), dl, OutVT, Hi);
17729 return DAG.getNode(ISD::CONCAT_VECTORS, dl, VT, Lo, Hi);
17732 MVT NewVT = MVT::getVectorVT(MVT::i32, NumElems);
17734 assert((NewVT.is256BitVector() || NewVT.is512BitVector()) &&
17735 "Unsupported value type for operation");
17737 // Use native supported vector instruction vplzcntd.
17738 Op = DAG.getNode(ISD::ZERO_EXTEND, dl, NewVT, Op.getOperand(0));
17739 SDValue CtlzNode = DAG.getNode(ISD::CTLZ, dl, NewVT, Op);
17740 SDValue TruncNode = DAG.getNode(ISD::TRUNCATE, dl, VT, CtlzNode);
17741 SDValue Delta = DAG.getConstant(32 - EltVT.getSizeInBits(), dl, VT);
17743 return DAG.getNode(ISD::SUB, dl, VT, TruncNode, Delta);
17746 static SDValue LowerCTLZ(SDValue Op, const X86Subtarget *Subtarget,
17747 SelectionDAG &DAG) {
17748 MVT VT = Op.getSimpleValueType();
17750 unsigned NumBits = VT.getSizeInBits();
17753 if (VT.isVector() && Subtarget->hasAVX512())
17754 return LowerVectorCTLZ_AVX512(Op, DAG);
17756 Op = Op.getOperand(0);
17757 if (VT == MVT::i8) {
17758 // Zero extend to i32 since there is not an i8 bsr.
17760 Op = DAG.getNode(ISD::ZERO_EXTEND, dl, OpVT, Op);
17763 // Issue a bsr (scan bits in reverse) which also sets EFLAGS.
17764 SDVTList VTs = DAG.getVTList(OpVT, MVT::i32);
17765 Op = DAG.getNode(X86ISD::BSR, dl, VTs, Op);
17767 // If src is zero (i.e. bsr sets ZF), returns NumBits.
17770 DAG.getConstant(NumBits + NumBits - 1, dl, OpVT),
17771 DAG.getConstant(X86::COND_E, dl, MVT::i8),
17774 Op = DAG.getNode(X86ISD::CMOV, dl, OpVT, Ops);
17776 // Finally xor with NumBits-1.
17777 Op = DAG.getNode(ISD::XOR, dl, OpVT, Op,
17778 DAG.getConstant(NumBits - 1, dl, OpVT));
17781 Op = DAG.getNode(ISD::TRUNCATE, dl, MVT::i8, Op);
17785 static SDValue LowerCTLZ_ZERO_UNDEF(SDValue Op, const X86Subtarget *Subtarget,
17786 SelectionDAG &DAG) {
17787 MVT VT = Op.getSimpleValueType();
17789 unsigned NumBits = VT.getSizeInBits();
17792 if (VT.isVector() && Subtarget->hasAVX512())
17793 return LowerVectorCTLZ_AVX512(Op, DAG);
17795 Op = Op.getOperand(0);
17796 if (VT == MVT::i8) {
17797 // Zero extend to i32 since there is not an i8 bsr.
17799 Op = DAG.getNode(ISD::ZERO_EXTEND, dl, OpVT, Op);
17802 // Issue a bsr (scan bits in reverse).
17803 SDVTList VTs = DAG.getVTList(OpVT, MVT::i32);
17804 Op = DAG.getNode(X86ISD::BSR, dl, VTs, Op);
17806 // And xor with NumBits-1.
17807 Op = DAG.getNode(ISD::XOR, dl, OpVT, Op,
17808 DAG.getConstant(NumBits - 1, dl, OpVT));
17811 Op = DAG.getNode(ISD::TRUNCATE, dl, MVT::i8, Op);
17815 static SDValue LowerCTTZ(SDValue Op, SelectionDAG &DAG) {
17816 MVT VT = Op.getSimpleValueType();
17817 unsigned NumBits = VT.getScalarSizeInBits();
17820 if (VT.isVector()) {
17821 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
17823 SDValue N0 = Op.getOperand(0);
17824 SDValue Zero = DAG.getConstant(0, dl, VT);
17826 // lsb(x) = (x & -x)
17827 SDValue LSB = DAG.getNode(ISD::AND, dl, VT, N0,
17828 DAG.getNode(ISD::SUB, dl, VT, Zero, N0));
17830 // cttz_undef(x) = (width - 1) - ctlz(lsb)
17831 if (Op.getOpcode() == ISD::CTTZ_ZERO_UNDEF &&
17832 TLI.isOperationLegal(ISD::CTLZ, VT)) {
17833 SDValue WidthMinusOne = DAG.getConstant(NumBits - 1, dl, VT);
17834 return DAG.getNode(ISD::SUB, dl, VT, WidthMinusOne,
17835 DAG.getNode(ISD::CTLZ, dl, VT, LSB));
17838 // cttz(x) = ctpop(lsb - 1)
17839 SDValue One = DAG.getConstant(1, dl, VT);
17840 return DAG.getNode(ISD::CTPOP, dl, VT,
17841 DAG.getNode(ISD::SUB, dl, VT, LSB, One));
17844 assert(Op.getOpcode() == ISD::CTTZ &&
17845 "Only scalar CTTZ requires custom lowering");
17847 // Issue a bsf (scan bits forward) which also sets EFLAGS.
17848 SDVTList VTs = DAG.getVTList(VT, MVT::i32);
17849 Op = DAG.getNode(X86ISD::BSF, dl, VTs, Op.getOperand(0));
17851 // If src is zero (i.e. bsf sets ZF), returns NumBits.
17854 DAG.getConstant(NumBits, dl, VT),
17855 DAG.getConstant(X86::COND_E, dl, MVT::i8),
17858 return DAG.getNode(X86ISD::CMOV, dl, VT, Ops);
17861 // Lower256IntArith - Break a 256-bit integer operation into two new 128-bit
17862 // ones, and then concatenate the result back.
17863 static SDValue Lower256IntArith(SDValue Op, SelectionDAG &DAG) {
17864 MVT VT = Op.getSimpleValueType();
17866 assert(VT.is256BitVector() && VT.isInteger() &&
17867 "Unsupported value type for operation");
17869 unsigned NumElems = VT.getVectorNumElements();
17872 // Extract the LHS vectors
17873 SDValue LHS = Op.getOperand(0);
17874 SDValue LHS1 = Extract128BitVector(LHS, 0, DAG, dl);
17875 SDValue LHS2 = Extract128BitVector(LHS, NumElems/2, DAG, dl);
17877 // Extract the RHS vectors
17878 SDValue RHS = Op.getOperand(1);
17879 SDValue RHS1 = Extract128BitVector(RHS, 0, DAG, dl);
17880 SDValue RHS2 = Extract128BitVector(RHS, NumElems/2, DAG, dl);
17882 MVT EltVT = VT.getVectorElementType();
17883 MVT NewVT = MVT::getVectorVT(EltVT, NumElems/2);
17885 return DAG.getNode(ISD::CONCAT_VECTORS, dl, VT,
17886 DAG.getNode(Op.getOpcode(), dl, NewVT, LHS1, RHS1),
17887 DAG.getNode(Op.getOpcode(), dl, NewVT, LHS2, RHS2));
17890 static SDValue LowerADD(SDValue Op, SelectionDAG &DAG) {
17891 if (Op.getValueType() == MVT::i1)
17892 return DAG.getNode(ISD::XOR, SDLoc(Op), Op.getValueType(),
17893 Op.getOperand(0), Op.getOperand(1));
17894 assert(Op.getSimpleValueType().is256BitVector() &&
17895 Op.getSimpleValueType().isInteger() &&
17896 "Only handle AVX 256-bit vector integer operation");
17897 return Lower256IntArith(Op, DAG);
17900 static SDValue LowerSUB(SDValue Op, SelectionDAG &DAG) {
17901 if (Op.getValueType() == MVT::i1)
17902 return DAG.getNode(ISD::XOR, SDLoc(Op), Op.getValueType(),
17903 Op.getOperand(0), Op.getOperand(1));
17904 assert(Op.getSimpleValueType().is256BitVector() &&
17905 Op.getSimpleValueType().isInteger() &&
17906 "Only handle AVX 256-bit vector integer operation");
17907 return Lower256IntArith(Op, DAG);
17910 static SDValue LowerMINMAX(SDValue Op, SelectionDAG &DAG) {
17911 assert(Op.getSimpleValueType().is256BitVector() &&
17912 Op.getSimpleValueType().isInteger() &&
17913 "Only handle AVX 256-bit vector integer operation");
17914 return Lower256IntArith(Op, DAG);
17917 static SDValue LowerMUL(SDValue Op, const X86Subtarget *Subtarget,
17918 SelectionDAG &DAG) {
17920 MVT VT = Op.getSimpleValueType();
17923 return DAG.getNode(ISD::AND, dl, VT, Op.getOperand(0), Op.getOperand(1));
17925 // Decompose 256-bit ops into smaller 128-bit ops.
17926 if (VT.is256BitVector() && !Subtarget->hasInt256())
17927 return Lower256IntArith(Op, DAG);
17929 SDValue A = Op.getOperand(0);
17930 SDValue B = Op.getOperand(1);
17932 // Lower v16i8/v32i8 mul as promotion to v8i16/v16i16 vector
17933 // pairs, multiply and truncate.
17934 if (VT == MVT::v16i8 || VT == MVT::v32i8) {
17935 if (Subtarget->hasInt256()) {
17936 if (VT == MVT::v32i8) {
17937 MVT SubVT = MVT::getVectorVT(MVT::i8, VT.getVectorNumElements() / 2);
17938 SDValue Lo = DAG.getIntPtrConstant(0, dl);
17939 SDValue Hi = DAG.getIntPtrConstant(VT.getVectorNumElements() / 2, dl);
17940 SDValue ALo = DAG.getNode(ISD::EXTRACT_SUBVECTOR, dl, SubVT, A, Lo);
17941 SDValue BLo = DAG.getNode(ISD::EXTRACT_SUBVECTOR, dl, SubVT, B, Lo);
17942 SDValue AHi = DAG.getNode(ISD::EXTRACT_SUBVECTOR, dl, SubVT, A, Hi);
17943 SDValue BHi = DAG.getNode(ISD::EXTRACT_SUBVECTOR, dl, SubVT, B, Hi);
17944 return DAG.getNode(ISD::CONCAT_VECTORS, dl, VT,
17945 DAG.getNode(ISD::MUL, dl, SubVT, ALo, BLo),
17946 DAG.getNode(ISD::MUL, dl, SubVT, AHi, BHi));
17949 MVT ExVT = MVT::getVectorVT(MVT::i16, VT.getVectorNumElements());
17950 return DAG.getNode(
17951 ISD::TRUNCATE, dl, VT,
17952 DAG.getNode(ISD::MUL, dl, ExVT,
17953 DAG.getNode(ISD::SIGN_EXTEND, dl, ExVT, A),
17954 DAG.getNode(ISD::SIGN_EXTEND, dl, ExVT, B)));
17957 assert(VT == MVT::v16i8 &&
17958 "Pre-AVX2 support only supports v16i8 multiplication");
17959 MVT ExVT = MVT::v8i16;
17961 // Extract the lo parts and sign extend to i16
17963 if (Subtarget->hasSSE41()) {
17964 ALo = DAG.getNode(X86ISD::VSEXT, dl, ExVT, A);
17965 BLo = DAG.getNode(X86ISD::VSEXT, dl, ExVT, B);
17967 const int ShufMask[] = {-1, 0, -1, 1, -1, 2, -1, 3,
17968 -1, 4, -1, 5, -1, 6, -1, 7};
17969 ALo = DAG.getVectorShuffle(VT, dl, A, A, ShufMask);
17970 BLo = DAG.getVectorShuffle(VT, dl, B, B, ShufMask);
17971 ALo = DAG.getBitcast(ExVT, ALo);
17972 BLo = DAG.getBitcast(ExVT, BLo);
17973 ALo = DAG.getNode(ISD::SRA, dl, ExVT, ALo, DAG.getConstant(8, dl, ExVT));
17974 BLo = DAG.getNode(ISD::SRA, dl, ExVT, BLo, DAG.getConstant(8, dl, ExVT));
17977 // Extract the hi parts and sign extend to i16
17979 if (Subtarget->hasSSE41()) {
17980 const int ShufMask[] = {8, 9, 10, 11, 12, 13, 14, 15,
17981 -1, -1, -1, -1, -1, -1, -1, -1};
17982 AHi = DAG.getVectorShuffle(VT, dl, A, A, ShufMask);
17983 BHi = DAG.getVectorShuffle(VT, dl, B, B, ShufMask);
17984 AHi = DAG.getNode(X86ISD::VSEXT, dl, ExVT, AHi);
17985 BHi = DAG.getNode(X86ISD::VSEXT, dl, ExVT, BHi);
17987 const int ShufMask[] = {-1, 8, -1, 9, -1, 10, -1, 11,
17988 -1, 12, -1, 13, -1, 14, -1, 15};
17989 AHi = DAG.getVectorShuffle(VT, dl, A, A, ShufMask);
17990 BHi = DAG.getVectorShuffle(VT, dl, B, B, ShufMask);
17991 AHi = DAG.getBitcast(ExVT, AHi);
17992 BHi = DAG.getBitcast(ExVT, BHi);
17993 AHi = DAG.getNode(ISD::SRA, dl, ExVT, AHi, DAG.getConstant(8, dl, ExVT));
17994 BHi = DAG.getNode(ISD::SRA, dl, ExVT, BHi, DAG.getConstant(8, dl, ExVT));
17997 // Multiply, mask the lower 8bits of the lo/hi results and pack
17998 SDValue RLo = DAG.getNode(ISD::MUL, dl, ExVT, ALo, BLo);
17999 SDValue RHi = DAG.getNode(ISD::MUL, dl, ExVT, AHi, BHi);
18000 RLo = DAG.getNode(ISD::AND, dl, ExVT, RLo, DAG.getConstant(255, dl, ExVT));
18001 RHi = DAG.getNode(ISD::AND, dl, ExVT, RHi, DAG.getConstant(255, dl, ExVT));
18002 return DAG.getNode(X86ISD::PACKUS, dl, VT, RLo, RHi);
18005 // Lower v4i32 mul as 2x shuffle, 2x pmuludq, 2x shuffle.
18006 if (VT == MVT::v4i32) {
18007 assert(Subtarget->hasSSE2() && !Subtarget->hasSSE41() &&
18008 "Should not custom lower when pmuldq is available!");
18010 // Extract the odd parts.
18011 static const int UnpackMask[] = { 1, -1, 3, -1 };
18012 SDValue Aodds = DAG.getVectorShuffle(VT, dl, A, A, UnpackMask);
18013 SDValue Bodds = DAG.getVectorShuffle(VT, dl, B, B, UnpackMask);
18015 // Multiply the even parts.
18016 SDValue Evens = DAG.getNode(X86ISD::PMULUDQ, dl, MVT::v2i64, A, B);
18017 // Now multiply odd parts.
18018 SDValue Odds = DAG.getNode(X86ISD::PMULUDQ, dl, MVT::v2i64, Aodds, Bodds);
18020 Evens = DAG.getBitcast(VT, Evens);
18021 Odds = DAG.getBitcast(VT, Odds);
18023 // Merge the two vectors back together with a shuffle. This expands into 2
18025 static const int ShufMask[] = { 0, 4, 2, 6 };
18026 return DAG.getVectorShuffle(VT, dl, Evens, Odds, ShufMask);
18029 assert((VT == MVT::v2i64 || VT == MVT::v4i64 || VT == MVT::v8i64) &&
18030 "Only know how to lower V2I64/V4I64/V8I64 multiply");
18032 // Ahi = psrlqi(a, 32);
18033 // Bhi = psrlqi(b, 32);
18035 // AloBlo = pmuludq(a, b);
18036 // AloBhi = pmuludq(a, Bhi);
18037 // AhiBlo = pmuludq(Ahi, b);
18039 // AloBhi = psllqi(AloBhi, 32);
18040 // AhiBlo = psllqi(AhiBlo, 32);
18041 // return AloBlo + AloBhi + AhiBlo;
18043 SDValue Ahi = getTargetVShiftByConstNode(X86ISD::VSRLI, dl, VT, A, 32, DAG);
18044 SDValue Bhi = getTargetVShiftByConstNode(X86ISD::VSRLI, dl, VT, B, 32, DAG);
18046 SDValue AhiBlo = Ahi;
18047 SDValue AloBhi = Bhi;
18048 // Bit cast to 32-bit vectors for MULUDQ
18049 MVT MulVT = (VT == MVT::v2i64) ? MVT::v4i32 :
18050 (VT == MVT::v4i64) ? MVT::v8i32 : MVT::v16i32;
18051 A = DAG.getBitcast(MulVT, A);
18052 B = DAG.getBitcast(MulVT, B);
18053 Ahi = DAG.getBitcast(MulVT, Ahi);
18054 Bhi = DAG.getBitcast(MulVT, Bhi);
18056 SDValue AloBlo = DAG.getNode(X86ISD::PMULUDQ, dl, VT, A, B);
18057 // After shifting right const values the result may be all-zero.
18058 if (!ISD::isBuildVectorAllZeros(Ahi.getNode())) {
18059 AhiBlo = DAG.getNode(X86ISD::PMULUDQ, dl, VT, Ahi, B);
18060 AhiBlo = getTargetVShiftByConstNode(X86ISD::VSHLI, dl, VT, AhiBlo, 32, DAG);
18062 if (!ISD::isBuildVectorAllZeros(Bhi.getNode())) {
18063 AloBhi = DAG.getNode(X86ISD::PMULUDQ, dl, VT, A, Bhi);
18064 AloBhi = getTargetVShiftByConstNode(X86ISD::VSHLI, dl, VT, AloBhi, 32, DAG);
18067 SDValue Res = DAG.getNode(ISD::ADD, dl, VT, AloBlo, AloBhi);
18068 return DAG.getNode(ISD::ADD, dl, VT, Res, AhiBlo);
18071 SDValue X86TargetLowering::LowerWin64_i128OP(SDValue Op, SelectionDAG &DAG) const {
18072 assert(Subtarget->isTargetWin64() && "Unexpected target");
18073 EVT VT = Op.getValueType();
18074 assert(VT.isInteger() && VT.getSizeInBits() == 128 &&
18075 "Unexpected return type for lowering");
18079 switch (Op->getOpcode()) {
18080 default: llvm_unreachable("Unexpected request for libcall!");
18081 case ISD::SDIV: isSigned = true; LC = RTLIB::SDIV_I128; break;
18082 case ISD::UDIV: isSigned = false; LC = RTLIB::UDIV_I128; break;
18083 case ISD::SREM: isSigned = true; LC = RTLIB::SREM_I128; break;
18084 case ISD::UREM: isSigned = false; LC = RTLIB::UREM_I128; break;
18085 case ISD::SDIVREM: isSigned = true; LC = RTLIB::SDIVREM_I128; break;
18086 case ISD::UDIVREM: isSigned = false; LC = RTLIB::UDIVREM_I128; break;
18090 SDValue InChain = DAG.getEntryNode();
18092 TargetLowering::ArgListTy Args;
18093 TargetLowering::ArgListEntry Entry;
18094 for (unsigned i = 0, e = Op->getNumOperands(); i != e; ++i) {
18095 EVT ArgVT = Op->getOperand(i).getValueType();
18096 assert(ArgVT.isInteger() && ArgVT.getSizeInBits() == 128 &&
18097 "Unexpected argument type for lowering");
18098 SDValue StackPtr = DAG.CreateStackTemporary(ArgVT, 16);
18099 Entry.Node = StackPtr;
18100 InChain = DAG.getStore(InChain, dl, Op->getOperand(i), StackPtr, MachinePointerInfo(),
18102 Type *ArgTy = ArgVT.getTypeForEVT(*DAG.getContext());
18103 Entry.Ty = PointerType::get(ArgTy,0);
18104 Entry.isSExt = false;
18105 Entry.isZExt = false;
18106 Args.push_back(Entry);
18109 SDValue Callee = DAG.getExternalSymbol(getLibcallName(LC),
18110 getPointerTy(DAG.getDataLayout()));
18112 TargetLowering::CallLoweringInfo CLI(DAG);
18113 CLI.setDebugLoc(dl).setChain(InChain)
18114 .setCallee(getLibcallCallingConv(LC),
18115 static_cast<EVT>(MVT::v2i64).getTypeForEVT(*DAG.getContext()),
18116 Callee, std::move(Args), 0)
18117 .setInRegister().setSExtResult(isSigned).setZExtResult(!isSigned);
18119 std::pair<SDValue, SDValue> CallInfo = LowerCallTo(CLI);
18120 return DAG.getBitcast(VT, CallInfo.first);
18123 static SDValue LowerMUL_LOHI(SDValue Op, const X86Subtarget *Subtarget,
18124 SelectionDAG &DAG) {
18125 SDValue Op0 = Op.getOperand(0), Op1 = Op.getOperand(1);
18126 MVT VT = Op0.getSimpleValueType();
18129 assert((VT == MVT::v4i32 && Subtarget->hasSSE2()) ||
18130 (VT == MVT::v8i32 && Subtarget->hasInt256()));
18132 // PMULxD operations multiply each even value (starting at 0) of LHS with
18133 // the related value of RHS and produce a widen result.
18134 // E.g., PMULUDQ <4 x i32> <a|b|c|d>, <4 x i32> <e|f|g|h>
18135 // => <2 x i64> <ae|cg>
18137 // In other word, to have all the results, we need to perform two PMULxD:
18138 // 1. one with the even values.
18139 // 2. one with the odd values.
18140 // To achieve #2, with need to place the odd values at an even position.
18142 // Place the odd value at an even position (basically, shift all values 1
18143 // step to the left):
18144 const int Mask[] = {1, -1, 3, -1, 5, -1, 7, -1};
18145 // <a|b|c|d> => <b|undef|d|undef>
18146 SDValue Odd0 = DAG.getVectorShuffle(VT, dl, Op0, Op0, Mask);
18147 // <e|f|g|h> => <f|undef|h|undef>
18148 SDValue Odd1 = DAG.getVectorShuffle(VT, dl, Op1, Op1, Mask);
18150 // Emit two multiplies, one for the lower 2 ints and one for the higher 2
18152 MVT MulVT = VT == MVT::v4i32 ? MVT::v2i64 : MVT::v4i64;
18153 bool IsSigned = Op->getOpcode() == ISD::SMUL_LOHI;
18155 (!IsSigned || !Subtarget->hasSSE41()) ? X86ISD::PMULUDQ : X86ISD::PMULDQ;
18156 // PMULUDQ <4 x i32> <a|b|c|d>, <4 x i32> <e|f|g|h>
18157 // => <2 x i64> <ae|cg>
18158 SDValue Mul1 = DAG.getBitcast(VT, DAG.getNode(Opcode, dl, MulVT, Op0, Op1));
18159 // PMULUDQ <4 x i32> <b|undef|d|undef>, <4 x i32> <f|undef|h|undef>
18160 // => <2 x i64> <bf|dh>
18161 SDValue Mul2 = DAG.getBitcast(VT, DAG.getNode(Opcode, dl, MulVT, Odd0, Odd1));
18163 // Shuffle it back into the right order.
18164 SDValue Highs, Lows;
18165 if (VT == MVT::v8i32) {
18166 const int HighMask[] = {1, 9, 3, 11, 5, 13, 7, 15};
18167 Highs = DAG.getVectorShuffle(VT, dl, Mul1, Mul2, HighMask);
18168 const int LowMask[] = {0, 8, 2, 10, 4, 12, 6, 14};
18169 Lows = DAG.getVectorShuffle(VT, dl, Mul1, Mul2, LowMask);
18171 const int HighMask[] = {1, 5, 3, 7};
18172 Highs = DAG.getVectorShuffle(VT, dl, Mul1, Mul2, HighMask);
18173 const int LowMask[] = {0, 4, 2, 6};
18174 Lows = DAG.getVectorShuffle(VT, dl, Mul1, Mul2, LowMask);
18177 // If we have a signed multiply but no PMULDQ fix up the high parts of a
18178 // unsigned multiply.
18179 if (IsSigned && !Subtarget->hasSSE41()) {
18180 SDValue ShAmt = DAG.getConstant(
18182 DAG.getTargetLoweringInfo().getShiftAmountTy(VT, DAG.getDataLayout()));
18183 SDValue T1 = DAG.getNode(ISD::AND, dl, VT,
18184 DAG.getNode(ISD::SRA, dl, VT, Op0, ShAmt), Op1);
18185 SDValue T2 = DAG.getNode(ISD::AND, dl, VT,
18186 DAG.getNode(ISD::SRA, dl, VT, Op1, ShAmt), Op0);
18188 SDValue Fixup = DAG.getNode(ISD::ADD, dl, VT, T1, T2);
18189 Highs = DAG.getNode(ISD::SUB, dl, VT, Highs, Fixup);
18192 // The first result of MUL_LOHI is actually the low value, followed by the
18194 SDValue Ops[] = {Lows, Highs};
18195 return DAG.getMergeValues(Ops, dl);
18198 // Return true if the required (according to Opcode) shift-imm form is natively
18199 // supported by the Subtarget
18200 static bool SupportedVectorShiftWithImm(MVT VT, const X86Subtarget *Subtarget,
18202 if (VT.getScalarSizeInBits() < 16)
18205 if (VT.is512BitVector() &&
18206 (VT.getScalarSizeInBits() > 16 || Subtarget->hasBWI()))
18209 bool LShift = VT.is128BitVector() ||
18210 (VT.is256BitVector() && Subtarget->hasInt256());
18212 bool AShift = LShift && (Subtarget->hasVLX() ||
18213 (VT != MVT::v2i64 && VT != MVT::v4i64));
18214 return (Opcode == ISD::SRA) ? AShift : LShift;
18217 // The shift amount is a variable, but it is the same for all vector lanes.
18218 // These instructions are defined together with shift-immediate.
18220 bool SupportedVectorShiftWithBaseAmnt(MVT VT, const X86Subtarget *Subtarget,
18222 return SupportedVectorShiftWithImm(VT, Subtarget, Opcode);
18225 // Return true if the required (according to Opcode) variable-shift form is
18226 // natively supported by the Subtarget
18227 static bool SupportedVectorVarShift(MVT VT, const X86Subtarget *Subtarget,
18230 if (!Subtarget->hasInt256() || VT.getScalarSizeInBits() < 16)
18233 // vXi16 supported only on AVX-512, BWI
18234 if (VT.getScalarSizeInBits() == 16 && !Subtarget->hasBWI())
18237 if (VT.is512BitVector() || Subtarget->hasVLX())
18240 bool LShift = VT.is128BitVector() || VT.is256BitVector();
18241 bool AShift = LShift && VT != MVT::v2i64 && VT != MVT::v4i64;
18242 return (Opcode == ISD::SRA) ? AShift : LShift;
18245 static SDValue LowerScalarImmediateShift(SDValue Op, SelectionDAG &DAG,
18246 const X86Subtarget *Subtarget) {
18247 MVT VT = Op.getSimpleValueType();
18249 SDValue R = Op.getOperand(0);
18250 SDValue Amt = Op.getOperand(1);
18252 unsigned X86Opc = (Op.getOpcode() == ISD::SHL) ? X86ISD::VSHLI :
18253 (Op.getOpcode() == ISD::SRL) ? X86ISD::VSRLI : X86ISD::VSRAI;
18255 auto ArithmeticShiftRight64 = [&](uint64_t ShiftAmt) {
18256 assert((VT == MVT::v2i64 || VT == MVT::v4i64) && "Unexpected SRA type");
18257 MVT ExVT = MVT::getVectorVT(MVT::i32, VT.getVectorNumElements() * 2);
18258 SDValue Ex = DAG.getBitcast(ExVT, R);
18260 if (ShiftAmt >= 32) {
18261 // Splat sign to upper i32 dst, and SRA upper i32 src to lower i32.
18263 getTargetVShiftByConstNode(X86ISD::VSRAI, dl, ExVT, Ex, 31, DAG);
18264 SDValue Lower = getTargetVShiftByConstNode(X86ISD::VSRAI, dl, ExVT, Ex,
18265 ShiftAmt - 32, DAG);
18266 if (VT == MVT::v2i64)
18267 Ex = DAG.getVectorShuffle(ExVT, dl, Upper, Lower, {5, 1, 7, 3});
18268 if (VT == MVT::v4i64)
18269 Ex = DAG.getVectorShuffle(ExVT, dl, Upper, Lower,
18270 {9, 1, 11, 3, 13, 5, 15, 7});
18272 // SRA upper i32, SHL whole i64 and select lower i32.
18273 SDValue Upper = getTargetVShiftByConstNode(X86ISD::VSRAI, dl, ExVT, Ex,
18276 getTargetVShiftByConstNode(X86ISD::VSRLI, dl, VT, R, ShiftAmt, DAG);
18277 Lower = DAG.getBitcast(ExVT, Lower);
18278 if (VT == MVT::v2i64)
18279 Ex = DAG.getVectorShuffle(ExVT, dl, Upper, Lower, {4, 1, 6, 3});
18280 if (VT == MVT::v4i64)
18281 Ex = DAG.getVectorShuffle(ExVT, dl, Upper, Lower,
18282 {8, 1, 10, 3, 12, 5, 14, 7});
18284 return DAG.getBitcast(VT, Ex);
18287 // Optimize shl/srl/sra with constant shift amount.
18288 if (auto *BVAmt = dyn_cast<BuildVectorSDNode>(Amt)) {
18289 if (auto *ShiftConst = BVAmt->getConstantSplatNode()) {
18290 uint64_t ShiftAmt = ShiftConst->getZExtValue();
18292 if (SupportedVectorShiftWithImm(VT, Subtarget, Op.getOpcode()))
18293 return getTargetVShiftByConstNode(X86Opc, dl, VT, R, ShiftAmt, DAG);
18295 // i64 SRA needs to be performed as partial shifts.
18296 if ((VT == MVT::v2i64 || (Subtarget->hasInt256() && VT == MVT::v4i64)) &&
18297 Op.getOpcode() == ISD::SRA && !Subtarget->hasXOP())
18298 return ArithmeticShiftRight64(ShiftAmt);
18300 if (VT == MVT::v16i8 || (Subtarget->hasInt256() && VT == MVT::v32i8)) {
18301 unsigned NumElts = VT.getVectorNumElements();
18302 MVT ShiftVT = MVT::getVectorVT(MVT::i16, NumElts / 2);
18304 // Simple i8 add case
18305 if (Op.getOpcode() == ISD::SHL && ShiftAmt == 1)
18306 return DAG.getNode(ISD::ADD, dl, VT, R, R);
18308 // ashr(R, 7) === cmp_slt(R, 0)
18309 if (Op.getOpcode() == ISD::SRA && ShiftAmt == 7) {
18310 SDValue Zeros = getZeroVector(VT, Subtarget, DAG, dl);
18311 return DAG.getNode(X86ISD::PCMPGT, dl, VT, Zeros, R);
18314 // XOP can shift v16i8 directly instead of as shift v8i16 + mask.
18315 if (VT == MVT::v16i8 && Subtarget->hasXOP())
18318 if (Op.getOpcode() == ISD::SHL) {
18319 // Make a large shift.
18320 SDValue SHL = getTargetVShiftByConstNode(X86ISD::VSHLI, dl, ShiftVT,
18322 SHL = DAG.getBitcast(VT, SHL);
18323 // Zero out the rightmost bits.
18324 SmallVector<SDValue, 32> V(
18325 NumElts, DAG.getConstant(uint8_t(-1U << ShiftAmt), dl, MVT::i8));
18326 return DAG.getNode(ISD::AND, dl, VT, SHL,
18327 DAG.getNode(ISD::BUILD_VECTOR, dl, VT, V));
18329 if (Op.getOpcode() == ISD::SRL) {
18330 // Make a large shift.
18331 SDValue SRL = getTargetVShiftByConstNode(X86ISD::VSRLI, dl, ShiftVT,
18333 SRL = DAG.getBitcast(VT, SRL);
18334 // Zero out the leftmost bits.
18335 SmallVector<SDValue, 32> V(
18336 NumElts, DAG.getConstant(uint8_t(-1U) >> ShiftAmt, dl, MVT::i8));
18337 return DAG.getNode(ISD::AND, dl, VT, SRL,
18338 DAG.getNode(ISD::BUILD_VECTOR, dl, VT, V));
18340 if (Op.getOpcode() == ISD::SRA) {
18341 // ashr(R, Amt) === sub(xor(lshr(R, Amt), Mask), Mask)
18342 SDValue Res = DAG.getNode(ISD::SRL, dl, VT, R, Amt);
18343 SmallVector<SDValue, 32> V(NumElts,
18344 DAG.getConstant(128 >> ShiftAmt, dl,
18346 SDValue Mask = DAG.getNode(ISD::BUILD_VECTOR, dl, VT, V);
18347 Res = DAG.getNode(ISD::XOR, dl, VT, Res, Mask);
18348 Res = DAG.getNode(ISD::SUB, dl, VT, Res, Mask);
18351 llvm_unreachable("Unknown shift opcode.");
18356 // Special case in 32-bit mode, where i64 is expanded into high and low parts.
18357 if (!Subtarget->is64Bit() && !Subtarget->hasXOP() &&
18358 (VT == MVT::v2i64 || (Subtarget->hasInt256() && VT == MVT::v4i64))) {
18360 // Peek through any splat that was introduced for i64 shift vectorization.
18361 int SplatIndex = -1;
18362 if (ShuffleVectorSDNode *SVN = dyn_cast<ShuffleVectorSDNode>(Amt.getNode()))
18363 if (SVN->isSplat()) {
18364 SplatIndex = SVN->getSplatIndex();
18365 Amt = Amt.getOperand(0);
18366 assert(SplatIndex < (int)VT.getVectorNumElements() &&
18367 "Splat shuffle referencing second operand");
18370 if (Amt.getOpcode() != ISD::BITCAST ||
18371 Amt.getOperand(0).getOpcode() != ISD::BUILD_VECTOR)
18374 Amt = Amt.getOperand(0);
18375 unsigned Ratio = Amt.getSimpleValueType().getVectorNumElements() /
18376 VT.getVectorNumElements();
18377 unsigned RatioInLog2 = Log2_32_Ceil(Ratio);
18378 uint64_t ShiftAmt = 0;
18379 unsigned BaseOp = (SplatIndex < 0 ? 0 : SplatIndex * Ratio);
18380 for (unsigned i = 0; i != Ratio; ++i) {
18381 ConstantSDNode *C = dyn_cast<ConstantSDNode>(Amt.getOperand(i + BaseOp));
18385 ShiftAmt |= C->getZExtValue() << (i * (1 << (6 - RatioInLog2)));
18388 // Check remaining shift amounts (if not a splat).
18389 if (SplatIndex < 0) {
18390 for (unsigned i = Ratio; i != Amt.getNumOperands(); i += Ratio) {
18391 uint64_t ShAmt = 0;
18392 for (unsigned j = 0; j != Ratio; ++j) {
18393 ConstantSDNode *C = dyn_cast<ConstantSDNode>(Amt.getOperand(i + j));
18397 ShAmt |= C->getZExtValue() << (j * (1 << (6 - RatioInLog2)));
18399 if (ShAmt != ShiftAmt)
18404 if (SupportedVectorShiftWithImm(VT, Subtarget, Op.getOpcode()))
18405 return getTargetVShiftByConstNode(X86Opc, dl, VT, R, ShiftAmt, DAG);
18407 if (Op.getOpcode() == ISD::SRA)
18408 return ArithmeticShiftRight64(ShiftAmt);
18414 static SDValue LowerScalarVariableShift(SDValue Op, SelectionDAG &DAG,
18415 const X86Subtarget* Subtarget) {
18416 MVT VT = Op.getSimpleValueType();
18418 SDValue R = Op.getOperand(0);
18419 SDValue Amt = Op.getOperand(1);
18421 unsigned X86OpcI = (Op.getOpcode() == ISD::SHL) ? X86ISD::VSHLI :
18422 (Op.getOpcode() == ISD::SRL) ? X86ISD::VSRLI : X86ISD::VSRAI;
18424 unsigned X86OpcV = (Op.getOpcode() == ISD::SHL) ? X86ISD::VSHL :
18425 (Op.getOpcode() == ISD::SRL) ? X86ISD::VSRL : X86ISD::VSRA;
18427 if (SupportedVectorShiftWithBaseAmnt(VT, Subtarget, Op.getOpcode())) {
18429 MVT EltVT = VT.getVectorElementType();
18431 if (BuildVectorSDNode *BV = dyn_cast<BuildVectorSDNode>(Amt)) {
18432 // Check if this build_vector node is doing a splat.
18433 // If so, then set BaseShAmt equal to the splat value.
18434 BaseShAmt = BV->getSplatValue();
18435 if (BaseShAmt && BaseShAmt.getOpcode() == ISD::UNDEF)
18436 BaseShAmt = SDValue();
18438 if (Amt.getOpcode() == ISD::EXTRACT_SUBVECTOR)
18439 Amt = Amt.getOperand(0);
18441 ShuffleVectorSDNode *SVN = dyn_cast<ShuffleVectorSDNode>(Amt);
18442 if (SVN && SVN->isSplat()) {
18443 unsigned SplatIdx = (unsigned)SVN->getSplatIndex();
18444 SDValue InVec = Amt.getOperand(0);
18445 if (InVec.getOpcode() == ISD::BUILD_VECTOR) {
18446 assert((SplatIdx < InVec.getSimpleValueType().getVectorNumElements()) &&
18447 "Unexpected shuffle index found!");
18448 BaseShAmt = InVec.getOperand(SplatIdx);
18449 } else if (InVec.getOpcode() == ISD::INSERT_VECTOR_ELT) {
18450 if (ConstantSDNode *C =
18451 dyn_cast<ConstantSDNode>(InVec.getOperand(2))) {
18452 if (C->getZExtValue() == SplatIdx)
18453 BaseShAmt = InVec.getOperand(1);
18458 // Avoid introducing an extract element from a shuffle.
18459 BaseShAmt = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, EltVT, InVec,
18460 DAG.getIntPtrConstant(SplatIdx, dl));
18464 if (BaseShAmt.getNode()) {
18465 assert(EltVT.bitsLE(MVT::i64) && "Unexpected element type!");
18466 if (EltVT != MVT::i64 && EltVT.bitsGT(MVT::i32))
18467 BaseShAmt = DAG.getNode(ISD::ZERO_EXTEND, dl, MVT::i64, BaseShAmt);
18468 else if (EltVT.bitsLT(MVT::i32))
18469 BaseShAmt = DAG.getNode(ISD::ZERO_EXTEND, dl, MVT::i32, BaseShAmt);
18471 return getTargetVShiftNode(X86OpcI, dl, VT, R, BaseShAmt, DAG);
18475 // Special case in 32-bit mode, where i64 is expanded into high and low parts.
18476 if (!Subtarget->is64Bit() && VT == MVT::v2i64 &&
18477 Amt.getOpcode() == ISD::BITCAST &&
18478 Amt.getOperand(0).getOpcode() == ISD::BUILD_VECTOR) {
18479 Amt = Amt.getOperand(0);
18480 unsigned Ratio = Amt.getSimpleValueType().getVectorNumElements() /
18481 VT.getVectorNumElements();
18482 std::vector<SDValue> Vals(Ratio);
18483 for (unsigned i = 0; i != Ratio; ++i)
18484 Vals[i] = Amt.getOperand(i);
18485 for (unsigned i = Ratio; i != Amt.getNumOperands(); i += Ratio) {
18486 for (unsigned j = 0; j != Ratio; ++j)
18487 if (Vals[j] != Amt.getOperand(i + j))
18491 if (SupportedVectorShiftWithBaseAmnt(VT, Subtarget, Op.getOpcode()))
18492 return DAG.getNode(X86OpcV, dl, VT, R, Op.getOperand(1));
18497 static SDValue LowerShift(SDValue Op, const X86Subtarget* Subtarget,
18498 SelectionDAG &DAG) {
18499 MVT VT = Op.getSimpleValueType();
18501 SDValue R = Op.getOperand(0);
18502 SDValue Amt = Op.getOperand(1);
18504 assert(VT.isVector() && "Custom lowering only for vector shifts!");
18505 assert(Subtarget->hasSSE2() && "Only custom lower when we have SSE2!");
18507 if (SDValue V = LowerScalarImmediateShift(Op, DAG, Subtarget))
18510 if (SDValue V = LowerScalarVariableShift(Op, DAG, Subtarget))
18513 if (SupportedVectorVarShift(VT, Subtarget, Op.getOpcode()))
18516 // XOP has 128-bit variable logical/arithmetic shifts.
18517 // +ve/-ve Amt = shift left/right.
18518 if (Subtarget->hasXOP() &&
18519 (VT == MVT::v2i64 || VT == MVT::v4i32 ||
18520 VT == MVT::v8i16 || VT == MVT::v16i8)) {
18521 if (Op.getOpcode() == ISD::SRL || Op.getOpcode() == ISD::SRA) {
18522 SDValue Zero = getZeroVector(VT, Subtarget, DAG, dl);
18523 Amt = DAG.getNode(ISD::SUB, dl, VT, Zero, Amt);
18525 if (Op.getOpcode() == ISD::SHL || Op.getOpcode() == ISD::SRL)
18526 return DAG.getNode(X86ISD::VPSHL, dl, VT, R, Amt);
18527 if (Op.getOpcode() == ISD::SRA)
18528 return DAG.getNode(X86ISD::VPSHA, dl, VT, R, Amt);
18531 // 2i64 vector logical shifts can efficiently avoid scalarization - do the
18532 // shifts per-lane and then shuffle the partial results back together.
18533 if (VT == MVT::v2i64 && Op.getOpcode() != ISD::SRA) {
18534 // Splat the shift amounts so the scalar shifts above will catch it.
18535 SDValue Amt0 = DAG.getVectorShuffle(VT, dl, Amt, Amt, {0, 0});
18536 SDValue Amt1 = DAG.getVectorShuffle(VT, dl, Amt, Amt, {1, 1});
18537 SDValue R0 = DAG.getNode(Op->getOpcode(), dl, VT, R, Amt0);
18538 SDValue R1 = DAG.getNode(Op->getOpcode(), dl, VT, R, Amt1);
18539 return DAG.getVectorShuffle(VT, dl, R0, R1, {0, 3});
18542 // i64 vector arithmetic shift can be emulated with the transform:
18543 // M = lshr(SIGN_BIT, Amt)
18544 // ashr(R, Amt) === sub(xor(lshr(R, Amt), M), M)
18545 if ((VT == MVT::v2i64 || (VT == MVT::v4i64 && Subtarget->hasInt256())) &&
18546 Op.getOpcode() == ISD::SRA) {
18547 SDValue S = DAG.getConstant(APInt::getSignBit(64), dl, VT);
18548 SDValue M = DAG.getNode(ISD::SRL, dl, VT, S, Amt);
18549 R = DAG.getNode(ISD::SRL, dl, VT, R, Amt);
18550 R = DAG.getNode(ISD::XOR, dl, VT, R, M);
18551 R = DAG.getNode(ISD::SUB, dl, VT, R, M);
18555 // If possible, lower this packed shift into a vector multiply instead of
18556 // expanding it into a sequence of scalar shifts.
18557 // Do this only if the vector shift count is a constant build_vector.
18558 if (Op.getOpcode() == ISD::SHL &&
18559 (VT == MVT::v8i16 || VT == MVT::v4i32 ||
18560 (Subtarget->hasInt256() && VT == MVT::v16i16)) &&
18561 ISD::isBuildVectorOfConstantSDNodes(Amt.getNode())) {
18562 SmallVector<SDValue, 8> Elts;
18563 MVT SVT = VT.getVectorElementType();
18564 unsigned SVTBits = SVT.getSizeInBits();
18565 APInt One(SVTBits, 1);
18566 unsigned NumElems = VT.getVectorNumElements();
18568 for (unsigned i=0; i !=NumElems; ++i) {
18569 SDValue Op = Amt->getOperand(i);
18570 if (Op->getOpcode() == ISD::UNDEF) {
18571 Elts.push_back(Op);
18575 ConstantSDNode *ND = cast<ConstantSDNode>(Op);
18576 APInt C(SVTBits, ND->getAPIntValue().getZExtValue());
18577 uint64_t ShAmt = C.getZExtValue();
18578 if (ShAmt >= SVTBits) {
18579 Elts.push_back(DAG.getUNDEF(SVT));
18582 Elts.push_back(DAG.getConstant(One.shl(ShAmt), dl, SVT));
18584 SDValue BV = DAG.getNode(ISD::BUILD_VECTOR, dl, VT, Elts);
18585 return DAG.getNode(ISD::MUL, dl, VT, R, BV);
18588 // Lower SHL with variable shift amount.
18589 if (VT == MVT::v4i32 && Op->getOpcode() == ISD::SHL) {
18590 Op = DAG.getNode(ISD::SHL, dl, VT, Amt, DAG.getConstant(23, dl, VT));
18592 Op = DAG.getNode(ISD::ADD, dl, VT, Op,
18593 DAG.getConstant(0x3f800000U, dl, VT));
18594 Op = DAG.getBitcast(MVT::v4f32, Op);
18595 Op = DAG.getNode(ISD::FP_TO_SINT, dl, VT, Op);
18596 return DAG.getNode(ISD::MUL, dl, VT, Op, R);
18599 // If possible, lower this shift as a sequence of two shifts by
18600 // constant plus a MOVSS/MOVSD instead of scalarizing it.
18602 // (v4i32 (srl A, (build_vector < X, Y, Y, Y>)))
18604 // Could be rewritten as:
18605 // (v4i32 (MOVSS (srl A, <Y,Y,Y,Y>), (srl A, <X,X,X,X>)))
18607 // The advantage is that the two shifts from the example would be
18608 // lowered as X86ISD::VSRLI nodes. This would be cheaper than scalarizing
18609 // the vector shift into four scalar shifts plus four pairs of vector
18611 if ((VT == MVT::v8i16 || VT == MVT::v4i32) &&
18612 ISD::isBuildVectorOfConstantSDNodes(Amt.getNode())) {
18613 unsigned TargetOpcode = X86ISD::MOVSS;
18614 bool CanBeSimplified;
18615 // The splat value for the first packed shift (the 'X' from the example).
18616 SDValue Amt1 = Amt->getOperand(0);
18617 // The splat value for the second packed shift (the 'Y' from the example).
18618 SDValue Amt2 = (VT == MVT::v4i32) ? Amt->getOperand(1) :
18619 Amt->getOperand(2);
18621 // See if it is possible to replace this node with a sequence of
18622 // two shifts followed by a MOVSS/MOVSD
18623 if (VT == MVT::v4i32) {
18624 // Check if it is legal to use a MOVSS.
18625 CanBeSimplified = Amt2 == Amt->getOperand(2) &&
18626 Amt2 == Amt->getOperand(3);
18627 if (!CanBeSimplified) {
18628 // Otherwise, check if we can still simplify this node using a MOVSD.
18629 CanBeSimplified = Amt1 == Amt->getOperand(1) &&
18630 Amt->getOperand(2) == Amt->getOperand(3);
18631 TargetOpcode = X86ISD::MOVSD;
18632 Amt2 = Amt->getOperand(2);
18635 // Do similar checks for the case where the machine value type
18637 CanBeSimplified = Amt1 == Amt->getOperand(1);
18638 for (unsigned i=3; i != 8 && CanBeSimplified; ++i)
18639 CanBeSimplified = Amt2 == Amt->getOperand(i);
18641 if (!CanBeSimplified) {
18642 TargetOpcode = X86ISD::MOVSD;
18643 CanBeSimplified = true;
18644 Amt2 = Amt->getOperand(4);
18645 for (unsigned i=0; i != 4 && CanBeSimplified; ++i)
18646 CanBeSimplified = Amt1 == Amt->getOperand(i);
18647 for (unsigned j=4; j != 8 && CanBeSimplified; ++j)
18648 CanBeSimplified = Amt2 == Amt->getOperand(j);
18652 if (CanBeSimplified && isa<ConstantSDNode>(Amt1) &&
18653 isa<ConstantSDNode>(Amt2)) {
18654 // Replace this node with two shifts followed by a MOVSS/MOVSD.
18655 MVT CastVT = MVT::v4i32;
18657 DAG.getConstant(cast<ConstantSDNode>(Amt1)->getAPIntValue(), dl, VT);
18658 SDValue Shift1 = DAG.getNode(Op->getOpcode(), dl, VT, R, Splat1);
18660 DAG.getConstant(cast<ConstantSDNode>(Amt2)->getAPIntValue(), dl, VT);
18661 SDValue Shift2 = DAG.getNode(Op->getOpcode(), dl, VT, R, Splat2);
18662 if (TargetOpcode == X86ISD::MOVSD)
18663 CastVT = MVT::v2i64;
18664 SDValue BitCast1 = DAG.getBitcast(CastVT, Shift1);
18665 SDValue BitCast2 = DAG.getBitcast(CastVT, Shift2);
18666 SDValue Result = getTargetShuffleNode(TargetOpcode, dl, CastVT, BitCast2,
18668 return DAG.getBitcast(VT, Result);
18672 // v4i32 Non Uniform Shifts.
18673 // If the shift amount is constant we can shift each lane using the SSE2
18674 // immediate shifts, else we need to zero-extend each lane to the lower i64
18675 // and shift using the SSE2 variable shifts.
18676 // The separate results can then be blended together.
18677 if (VT == MVT::v4i32) {
18678 unsigned Opc = Op.getOpcode();
18679 SDValue Amt0, Amt1, Amt2, Amt3;
18680 if (ISD::isBuildVectorOfConstantSDNodes(Amt.getNode())) {
18681 Amt0 = DAG.getVectorShuffle(VT, dl, Amt, DAG.getUNDEF(VT), {0, 0, 0, 0});
18682 Amt1 = DAG.getVectorShuffle(VT, dl, Amt, DAG.getUNDEF(VT), {1, 1, 1, 1});
18683 Amt2 = DAG.getVectorShuffle(VT, dl, Amt, DAG.getUNDEF(VT), {2, 2, 2, 2});
18684 Amt3 = DAG.getVectorShuffle(VT, dl, Amt, DAG.getUNDEF(VT), {3, 3, 3, 3});
18686 // ISD::SHL is handled above but we include it here for completeness.
18689 llvm_unreachable("Unknown target vector shift node");
18691 Opc = X86ISD::VSHL;
18694 Opc = X86ISD::VSRL;
18697 Opc = X86ISD::VSRA;
18700 // The SSE2 shifts use the lower i64 as the same shift amount for
18701 // all lanes and the upper i64 is ignored. These shuffle masks
18702 // optimally zero-extend each lanes on SSE2/SSE41/AVX targets.
18703 SDValue Z = getZeroVector(VT, Subtarget, DAG, dl);
18704 Amt0 = DAG.getVectorShuffle(VT, dl, Amt, Z, {0, 4, -1, -1});
18705 Amt1 = DAG.getVectorShuffle(VT, dl, Amt, Z, {1, 5, -1, -1});
18706 Amt2 = DAG.getVectorShuffle(VT, dl, Amt, Z, {2, 6, -1, -1});
18707 Amt3 = DAG.getVectorShuffle(VT, dl, Amt, Z, {3, 7, -1, -1});
18710 SDValue R0 = DAG.getNode(Opc, dl, VT, R, Amt0);
18711 SDValue R1 = DAG.getNode(Opc, dl, VT, R, Amt1);
18712 SDValue R2 = DAG.getNode(Opc, dl, VT, R, Amt2);
18713 SDValue R3 = DAG.getNode(Opc, dl, VT, R, Amt3);
18714 SDValue R02 = DAG.getVectorShuffle(VT, dl, R0, R2, {0, -1, 6, -1});
18715 SDValue R13 = DAG.getVectorShuffle(VT, dl, R1, R3, {-1, 1, -1, 7});
18716 return DAG.getVectorShuffle(VT, dl, R02, R13, {0, 5, 2, 7});
18719 if (VT == MVT::v16i8 ||
18720 (VT == MVT::v32i8 && Subtarget->hasInt256() && !Subtarget->hasXOP())) {
18721 MVT ExtVT = MVT::getVectorVT(MVT::i16, VT.getVectorNumElements() / 2);
18722 unsigned ShiftOpcode = Op->getOpcode();
18724 auto SignBitSelect = [&](MVT SelVT, SDValue Sel, SDValue V0, SDValue V1) {
18725 // On SSE41 targets we make use of the fact that VSELECT lowers
18726 // to PBLENDVB which selects bytes based just on the sign bit.
18727 if (Subtarget->hasSSE41()) {
18728 V0 = DAG.getBitcast(VT, V0);
18729 V1 = DAG.getBitcast(VT, V1);
18730 Sel = DAG.getBitcast(VT, Sel);
18731 return DAG.getBitcast(SelVT,
18732 DAG.getNode(ISD::VSELECT, dl, VT, Sel, V0, V1));
18734 // On pre-SSE41 targets we test for the sign bit by comparing to
18735 // zero - a negative value will set all bits of the lanes to true
18736 // and VSELECT uses that in its OR(AND(V0,C),AND(V1,~C)) lowering.
18737 SDValue Z = getZeroVector(SelVT, Subtarget, DAG, dl);
18738 SDValue C = DAG.getNode(X86ISD::PCMPGT, dl, SelVT, Z, Sel);
18739 return DAG.getNode(ISD::VSELECT, dl, SelVT, C, V0, V1);
18742 // Turn 'a' into a mask suitable for VSELECT: a = a << 5;
18743 // We can safely do this using i16 shifts as we're only interested in
18744 // the 3 lower bits of each byte.
18745 Amt = DAG.getBitcast(ExtVT, Amt);
18746 Amt = DAG.getNode(ISD::SHL, dl, ExtVT, Amt, DAG.getConstant(5, dl, ExtVT));
18747 Amt = DAG.getBitcast(VT, Amt);
18749 if (Op->getOpcode() == ISD::SHL || Op->getOpcode() == ISD::SRL) {
18750 // r = VSELECT(r, shift(r, 4), a);
18752 DAG.getNode(ShiftOpcode, dl, VT, R, DAG.getConstant(4, dl, VT));
18753 R = SignBitSelect(VT, Amt, M, R);
18756 Amt = DAG.getNode(ISD::ADD, dl, VT, Amt, Amt);
18758 // r = VSELECT(r, shift(r, 2), a);
18759 M = DAG.getNode(ShiftOpcode, dl, VT, R, DAG.getConstant(2, dl, VT));
18760 R = SignBitSelect(VT, Amt, M, R);
18763 Amt = DAG.getNode(ISD::ADD, dl, VT, Amt, Amt);
18765 // return VSELECT(r, shift(r, 1), a);
18766 M = DAG.getNode(ShiftOpcode, dl, VT, R, DAG.getConstant(1, dl, VT));
18767 R = SignBitSelect(VT, Amt, M, R);
18771 if (Op->getOpcode() == ISD::SRA) {
18772 // For SRA we need to unpack each byte to the higher byte of a i16 vector
18773 // so we can correctly sign extend. We don't care what happens to the
18775 SDValue ALo = DAG.getNode(X86ISD::UNPCKL, dl, VT, DAG.getUNDEF(VT), Amt);
18776 SDValue AHi = DAG.getNode(X86ISD::UNPCKH, dl, VT, DAG.getUNDEF(VT), Amt);
18777 SDValue RLo = DAG.getNode(X86ISD::UNPCKL, dl, VT, DAG.getUNDEF(VT), R);
18778 SDValue RHi = DAG.getNode(X86ISD::UNPCKH, dl, VT, DAG.getUNDEF(VT), R);
18779 ALo = DAG.getBitcast(ExtVT, ALo);
18780 AHi = DAG.getBitcast(ExtVT, AHi);
18781 RLo = DAG.getBitcast(ExtVT, RLo);
18782 RHi = DAG.getBitcast(ExtVT, RHi);
18784 // r = VSELECT(r, shift(r, 4), a);
18785 SDValue MLo = DAG.getNode(ShiftOpcode, dl, ExtVT, RLo,
18786 DAG.getConstant(4, dl, ExtVT));
18787 SDValue MHi = DAG.getNode(ShiftOpcode, dl, ExtVT, RHi,
18788 DAG.getConstant(4, dl, ExtVT));
18789 RLo = SignBitSelect(ExtVT, ALo, MLo, RLo);
18790 RHi = SignBitSelect(ExtVT, AHi, MHi, RHi);
18793 ALo = DAG.getNode(ISD::ADD, dl, ExtVT, ALo, ALo);
18794 AHi = DAG.getNode(ISD::ADD, dl, ExtVT, AHi, AHi);
18796 // r = VSELECT(r, shift(r, 2), a);
18797 MLo = DAG.getNode(ShiftOpcode, dl, ExtVT, RLo,
18798 DAG.getConstant(2, dl, ExtVT));
18799 MHi = DAG.getNode(ShiftOpcode, dl, ExtVT, RHi,
18800 DAG.getConstant(2, dl, ExtVT));
18801 RLo = SignBitSelect(ExtVT, ALo, MLo, RLo);
18802 RHi = SignBitSelect(ExtVT, AHi, MHi, RHi);
18805 ALo = DAG.getNode(ISD::ADD, dl, ExtVT, ALo, ALo);
18806 AHi = DAG.getNode(ISD::ADD, dl, ExtVT, AHi, AHi);
18808 // r = VSELECT(r, shift(r, 1), a);
18809 MLo = DAG.getNode(ShiftOpcode, dl, ExtVT, RLo,
18810 DAG.getConstant(1, dl, ExtVT));
18811 MHi = DAG.getNode(ShiftOpcode, dl, ExtVT, RHi,
18812 DAG.getConstant(1, dl, ExtVT));
18813 RLo = SignBitSelect(ExtVT, ALo, MLo, RLo);
18814 RHi = SignBitSelect(ExtVT, AHi, MHi, RHi);
18816 // Logical shift the result back to the lower byte, leaving a zero upper
18818 // meaning that we can safely pack with PACKUSWB.
18820 DAG.getNode(ISD::SRL, dl, ExtVT, RLo, DAG.getConstant(8, dl, ExtVT));
18822 DAG.getNode(ISD::SRL, dl, ExtVT, RHi, DAG.getConstant(8, dl, ExtVT));
18823 return DAG.getNode(X86ISD::PACKUS, dl, VT, RLo, RHi);
18827 // It's worth extending once and using the v8i32 shifts for 16-bit types, but
18828 // the extra overheads to get from v16i8 to v8i32 make the existing SSE
18829 // solution better.
18830 if (Subtarget->hasInt256() && VT == MVT::v8i16) {
18831 MVT ExtVT = MVT::v8i32;
18833 Op.getOpcode() == ISD::SRA ? ISD::SIGN_EXTEND : ISD::ZERO_EXTEND;
18834 R = DAG.getNode(ExtOpc, dl, ExtVT, R);
18835 Amt = DAG.getNode(ISD::ANY_EXTEND, dl, ExtVT, Amt);
18836 return DAG.getNode(ISD::TRUNCATE, dl, VT,
18837 DAG.getNode(Op.getOpcode(), dl, ExtVT, R, Amt));
18840 if (Subtarget->hasInt256() && !Subtarget->hasXOP() && VT == MVT::v16i16) {
18841 MVT ExtVT = MVT::v8i32;
18842 SDValue Z = getZeroVector(VT, Subtarget, DAG, dl);
18843 SDValue ALo = DAG.getNode(X86ISD::UNPCKL, dl, VT, Amt, Z);
18844 SDValue AHi = DAG.getNode(X86ISD::UNPCKH, dl, VT, Amt, Z);
18845 SDValue RLo = DAG.getNode(X86ISD::UNPCKL, dl, VT, R, R);
18846 SDValue RHi = DAG.getNode(X86ISD::UNPCKH, dl, VT, R, R);
18847 ALo = DAG.getBitcast(ExtVT, ALo);
18848 AHi = DAG.getBitcast(ExtVT, AHi);
18849 RLo = DAG.getBitcast(ExtVT, RLo);
18850 RHi = DAG.getBitcast(ExtVT, RHi);
18851 SDValue Lo = DAG.getNode(Op.getOpcode(), dl, ExtVT, RLo, ALo);
18852 SDValue Hi = DAG.getNode(Op.getOpcode(), dl, ExtVT, RHi, AHi);
18853 Lo = DAG.getNode(ISD::SRL, dl, ExtVT, Lo, DAG.getConstant(16, dl, ExtVT));
18854 Hi = DAG.getNode(ISD::SRL, dl, ExtVT, Hi, DAG.getConstant(16, dl, ExtVT));
18855 return DAG.getNode(X86ISD::PACKUS, dl, VT, Lo, Hi);
18858 if (VT == MVT::v8i16) {
18859 unsigned ShiftOpcode = Op->getOpcode();
18861 auto SignBitSelect = [&](SDValue Sel, SDValue V0, SDValue V1) {
18862 // On SSE41 targets we make use of the fact that VSELECT lowers
18863 // to PBLENDVB which selects bytes based just on the sign bit.
18864 if (Subtarget->hasSSE41()) {
18865 MVT ExtVT = MVT::getVectorVT(MVT::i8, VT.getVectorNumElements() * 2);
18866 V0 = DAG.getBitcast(ExtVT, V0);
18867 V1 = DAG.getBitcast(ExtVT, V1);
18868 Sel = DAG.getBitcast(ExtVT, Sel);
18869 return DAG.getBitcast(
18870 VT, DAG.getNode(ISD::VSELECT, dl, ExtVT, Sel, V0, V1));
18872 // On pre-SSE41 targets we splat the sign bit - a negative value will
18873 // set all bits of the lanes to true and VSELECT uses that in
18874 // its OR(AND(V0,C),AND(V1,~C)) lowering.
18876 DAG.getNode(ISD::SRA, dl, VT, Sel, DAG.getConstant(15, dl, VT));
18877 return DAG.getNode(ISD::VSELECT, dl, VT, C, V0, V1);
18880 // Turn 'a' into a mask suitable for VSELECT: a = a << 12;
18881 if (Subtarget->hasSSE41()) {
18882 // On SSE41 targets we need to replicate the shift mask in both
18883 // bytes for PBLENDVB.
18886 DAG.getNode(ISD::SHL, dl, VT, Amt, DAG.getConstant(4, dl, VT)),
18887 DAG.getNode(ISD::SHL, dl, VT, Amt, DAG.getConstant(12, dl, VT)));
18889 Amt = DAG.getNode(ISD::SHL, dl, VT, Amt, DAG.getConstant(12, dl, VT));
18892 // r = VSELECT(r, shift(r, 8), a);
18893 SDValue M = DAG.getNode(ShiftOpcode, dl, VT, R, DAG.getConstant(8, dl, VT));
18894 R = SignBitSelect(Amt, M, R);
18897 Amt = DAG.getNode(ISD::ADD, dl, VT, Amt, Amt);
18899 // r = VSELECT(r, shift(r, 4), a);
18900 M = DAG.getNode(ShiftOpcode, dl, VT, R, DAG.getConstant(4, dl, VT));
18901 R = SignBitSelect(Amt, M, R);
18904 Amt = DAG.getNode(ISD::ADD, dl, VT, Amt, Amt);
18906 // r = VSELECT(r, shift(r, 2), a);
18907 M = DAG.getNode(ShiftOpcode, dl, VT, R, DAG.getConstant(2, dl, VT));
18908 R = SignBitSelect(Amt, M, R);
18911 Amt = DAG.getNode(ISD::ADD, dl, VT, Amt, Amt);
18913 // return VSELECT(r, shift(r, 1), a);
18914 M = DAG.getNode(ShiftOpcode, dl, VT, R, DAG.getConstant(1, dl, VT));
18915 R = SignBitSelect(Amt, M, R);
18919 // Decompose 256-bit shifts into smaller 128-bit shifts.
18920 if (VT.is256BitVector()) {
18921 unsigned NumElems = VT.getVectorNumElements();
18922 MVT EltVT = VT.getVectorElementType();
18923 MVT NewVT = MVT::getVectorVT(EltVT, NumElems/2);
18925 // Extract the two vectors
18926 SDValue V1 = Extract128BitVector(R, 0, DAG, dl);
18927 SDValue V2 = Extract128BitVector(R, NumElems/2, DAG, dl);
18929 // Recreate the shift amount vectors
18930 SDValue Amt1, Amt2;
18931 if (Amt.getOpcode() == ISD::BUILD_VECTOR) {
18932 // Constant shift amount
18933 SmallVector<SDValue, 8> Ops(Amt->op_begin(), Amt->op_begin() + NumElems);
18934 ArrayRef<SDValue> Amt1Csts = makeArrayRef(Ops).slice(0, NumElems / 2);
18935 ArrayRef<SDValue> Amt2Csts = makeArrayRef(Ops).slice(NumElems / 2);
18937 Amt1 = DAG.getNode(ISD::BUILD_VECTOR, dl, NewVT, Amt1Csts);
18938 Amt2 = DAG.getNode(ISD::BUILD_VECTOR, dl, NewVT, Amt2Csts);
18940 // Variable shift amount
18941 Amt1 = Extract128BitVector(Amt, 0, DAG, dl);
18942 Amt2 = Extract128BitVector(Amt, NumElems/2, DAG, dl);
18945 // Issue new vector shifts for the smaller types
18946 V1 = DAG.getNode(Op.getOpcode(), dl, NewVT, V1, Amt1);
18947 V2 = DAG.getNode(Op.getOpcode(), dl, NewVT, V2, Amt2);
18949 // Concatenate the result back
18950 return DAG.getNode(ISD::CONCAT_VECTORS, dl, VT, V1, V2);
18956 static SDValue LowerRotate(SDValue Op, const X86Subtarget *Subtarget,
18957 SelectionDAG &DAG) {
18958 MVT VT = Op.getSimpleValueType();
18960 SDValue R = Op.getOperand(0);
18961 SDValue Amt = Op.getOperand(1);
18963 assert(VT.isVector() && "Custom lowering only for vector rotates!");
18964 assert(Subtarget->hasXOP() && "XOP support required for vector rotates!");
18965 assert((Op.getOpcode() == ISD::ROTL) && "Only ROTL supported");
18967 // XOP has 128-bit vector variable + immediate rotates.
18968 // +ve/-ve Amt = rotate left/right.
18970 // Split 256-bit integers.
18971 if (VT.is256BitVector())
18972 return Lower256IntArith(Op, DAG);
18974 assert(VT.is128BitVector() && "Only rotate 128-bit vectors!");
18976 // Attempt to rotate by immediate.
18977 if (auto *BVAmt = dyn_cast<BuildVectorSDNode>(Amt)) {
18978 if (auto *RotateConst = BVAmt->getConstantSplatNode()) {
18979 uint64_t RotateAmt = RotateConst->getAPIntValue().getZExtValue();
18980 assert(RotateAmt < VT.getScalarSizeInBits() && "Rotation out of range");
18981 return DAG.getNode(X86ISD::VPROTI, DL, VT, R,
18982 DAG.getConstant(RotateAmt, DL, MVT::i8));
18986 // Use general rotate by variable (per-element).
18987 return DAG.getNode(X86ISD::VPROT, DL, VT, R, Amt);
18990 static SDValue LowerXALUO(SDValue Op, SelectionDAG &DAG) {
18991 // Lower the "add/sub/mul with overflow" instruction into a regular ins plus
18992 // a "setcc" instruction that checks the overflow flag. The "brcond" lowering
18993 // looks for this combo and may remove the "setcc" instruction if the "setcc"
18994 // has only one use.
18995 SDNode *N = Op.getNode();
18996 SDValue LHS = N->getOperand(0);
18997 SDValue RHS = N->getOperand(1);
18998 unsigned BaseOp = 0;
19001 switch (Op.getOpcode()) {
19002 default: llvm_unreachable("Unknown ovf instruction!");
19004 // A subtract of one will be selected as a INC. Note that INC doesn't
19005 // set CF, so we can't do this for UADDO.
19006 if (isOneConstant(RHS)) {
19007 BaseOp = X86ISD::INC;
19008 Cond = X86::COND_O;
19011 BaseOp = X86ISD::ADD;
19012 Cond = X86::COND_O;
19015 BaseOp = X86ISD::ADD;
19016 Cond = X86::COND_B;
19019 // A subtract of one will be selected as a DEC. Note that DEC doesn't
19020 // set CF, so we can't do this for USUBO.
19021 if (isOneConstant(RHS)) {
19022 BaseOp = X86ISD::DEC;
19023 Cond = X86::COND_O;
19026 BaseOp = X86ISD::SUB;
19027 Cond = X86::COND_O;
19030 BaseOp = X86ISD::SUB;
19031 Cond = X86::COND_B;
19034 BaseOp = N->getValueType(0) == MVT::i8 ? X86ISD::SMUL8 : X86ISD::SMUL;
19035 Cond = X86::COND_O;
19037 case ISD::UMULO: { // i64, i8 = umulo lhs, rhs --> i64, i64, i32 umul lhs,rhs
19038 if (N->getValueType(0) == MVT::i8) {
19039 BaseOp = X86ISD::UMUL8;
19040 Cond = X86::COND_O;
19043 SDVTList VTs = DAG.getVTList(N->getValueType(0), N->getValueType(0),
19045 SDValue Sum = DAG.getNode(X86ISD::UMUL, DL, VTs, LHS, RHS);
19048 DAG.getNode(X86ISD::SETCC, DL, MVT::i8,
19049 DAG.getConstant(X86::COND_O, DL, MVT::i32),
19050 SDValue(Sum.getNode(), 2));
19052 return DAG.getNode(ISD::MERGE_VALUES, DL, N->getVTList(), Sum, SetCC);
19056 // Also sets EFLAGS.
19057 SDVTList VTs = DAG.getVTList(N->getValueType(0), MVT::i32);
19058 SDValue Sum = DAG.getNode(BaseOp, DL, VTs, LHS, RHS);
19061 DAG.getNode(X86ISD::SETCC, DL, N->getValueType(1),
19062 DAG.getConstant(Cond, DL, MVT::i32),
19063 SDValue(Sum.getNode(), 1));
19065 return DAG.getNode(ISD::MERGE_VALUES, DL, N->getVTList(), Sum, SetCC);
19068 /// Returns true if the operand type is exactly twice the native width, and
19069 /// the corresponding cmpxchg8b or cmpxchg16b instruction is available.
19070 /// Used to know whether to use cmpxchg8/16b when expanding atomic operations
19071 /// (otherwise we leave them alone to become __sync_fetch_and_... calls).
19072 bool X86TargetLowering::needsCmpXchgNb(Type *MemType) const {
19073 unsigned OpWidth = MemType->getPrimitiveSizeInBits();
19076 return !Subtarget->is64Bit(); // FIXME this should be Subtarget.hasCmpxchg8b
19077 else if (OpWidth == 128)
19078 return Subtarget->hasCmpxchg16b();
19083 bool X86TargetLowering::shouldExpandAtomicStoreInIR(StoreInst *SI) const {
19084 return needsCmpXchgNb(SI->getValueOperand()->getType());
19087 // Note: this turns large loads into lock cmpxchg8b/16b.
19088 // FIXME: On 32 bits x86, fild/movq might be faster than lock cmpxchg8b.
19089 TargetLowering::AtomicExpansionKind
19090 X86TargetLowering::shouldExpandAtomicLoadInIR(LoadInst *LI) const {
19091 auto PTy = cast<PointerType>(LI->getPointerOperand()->getType());
19092 return needsCmpXchgNb(PTy->getElementType()) ? AtomicExpansionKind::CmpXChg
19093 : AtomicExpansionKind::None;
19096 TargetLowering::AtomicExpansionKind
19097 X86TargetLowering::shouldExpandAtomicRMWInIR(AtomicRMWInst *AI) const {
19098 unsigned NativeWidth = Subtarget->is64Bit() ? 64 : 32;
19099 Type *MemType = AI->getType();
19101 // If the operand is too big, we must see if cmpxchg8/16b is available
19102 // and default to library calls otherwise.
19103 if (MemType->getPrimitiveSizeInBits() > NativeWidth) {
19104 return needsCmpXchgNb(MemType) ? AtomicExpansionKind::CmpXChg
19105 : AtomicExpansionKind::None;
19108 AtomicRMWInst::BinOp Op = AI->getOperation();
19111 llvm_unreachable("Unknown atomic operation");
19112 case AtomicRMWInst::Xchg:
19113 case AtomicRMWInst::Add:
19114 case AtomicRMWInst::Sub:
19115 // It's better to use xadd, xsub or xchg for these in all cases.
19116 return AtomicExpansionKind::None;
19117 case AtomicRMWInst::Or:
19118 case AtomicRMWInst::And:
19119 case AtomicRMWInst::Xor:
19120 // If the atomicrmw's result isn't actually used, we can just add a "lock"
19121 // prefix to a normal instruction for these operations.
19122 return !AI->use_empty() ? AtomicExpansionKind::CmpXChg
19123 : AtomicExpansionKind::None;
19124 case AtomicRMWInst::Nand:
19125 case AtomicRMWInst::Max:
19126 case AtomicRMWInst::Min:
19127 case AtomicRMWInst::UMax:
19128 case AtomicRMWInst::UMin:
19129 // These always require a non-trivial set of data operations on x86. We must
19130 // use a cmpxchg loop.
19131 return AtomicExpansionKind::CmpXChg;
19135 static bool hasMFENCE(const X86Subtarget& Subtarget) {
19136 // Use mfence if we have SSE2 or we're on x86-64 (even if we asked for
19137 // no-sse2). There isn't any reason to disable it if the target processor
19139 return Subtarget.hasSSE2() || Subtarget.is64Bit();
19143 X86TargetLowering::lowerIdempotentRMWIntoFencedLoad(AtomicRMWInst *AI) const {
19144 unsigned NativeWidth = Subtarget->is64Bit() ? 64 : 32;
19145 Type *MemType = AI->getType();
19146 // Accesses larger than the native width are turned into cmpxchg/libcalls, so
19147 // there is no benefit in turning such RMWs into loads, and it is actually
19148 // harmful as it introduces a mfence.
19149 if (MemType->getPrimitiveSizeInBits() > NativeWidth)
19152 auto Builder = IRBuilder<>(AI);
19153 Module *M = Builder.GetInsertBlock()->getParent()->getParent();
19154 auto SynchScope = AI->getSynchScope();
19155 // We must restrict the ordering to avoid generating loads with Release or
19156 // ReleaseAcquire orderings.
19157 auto Order = AtomicCmpXchgInst::getStrongestFailureOrdering(AI->getOrdering());
19158 auto Ptr = AI->getPointerOperand();
19160 // Before the load we need a fence. Here is an example lifted from
19161 // http://www.hpl.hp.com/techreports/2012/HPL-2012-68.pdf showing why a fence
19164 // x.store(1, relaxed);
19165 // r1 = y.fetch_add(0, release);
19167 // y.fetch_add(42, acquire);
19168 // r2 = x.load(relaxed);
19169 // r1 = r2 = 0 is impossible, but becomes possible if the idempotent rmw is
19170 // lowered to just a load without a fence. A mfence flushes the store buffer,
19171 // making the optimization clearly correct.
19172 // FIXME: it is required if isAtLeastRelease(Order) but it is not clear
19173 // otherwise, we might be able to be more aggressive on relaxed idempotent
19174 // rmw. In practice, they do not look useful, so we don't try to be
19175 // especially clever.
19176 if (SynchScope == SingleThread)
19177 // FIXME: we could just insert an X86ISD::MEMBARRIER here, except we are at
19178 // the IR level, so we must wrap it in an intrinsic.
19181 if (!hasMFENCE(*Subtarget))
19182 // FIXME: it might make sense to use a locked operation here but on a
19183 // different cache-line to prevent cache-line bouncing. In practice it
19184 // is probably a small win, and x86 processors without mfence are rare
19185 // enough that we do not bother.
19189 llvm::Intrinsic::getDeclaration(M, Intrinsic::x86_sse2_mfence);
19190 Builder.CreateCall(MFence, {});
19192 // Finally we can emit the atomic load.
19193 LoadInst *Loaded = Builder.CreateAlignedLoad(Ptr,
19194 AI->getType()->getPrimitiveSizeInBits());
19195 Loaded->setAtomic(Order, SynchScope);
19196 AI->replaceAllUsesWith(Loaded);
19197 AI->eraseFromParent();
19201 static SDValue LowerATOMIC_FENCE(SDValue Op, const X86Subtarget *Subtarget,
19202 SelectionDAG &DAG) {
19204 AtomicOrdering FenceOrdering = static_cast<AtomicOrdering>(
19205 cast<ConstantSDNode>(Op.getOperand(1))->getZExtValue());
19206 SynchronizationScope FenceScope = static_cast<SynchronizationScope>(
19207 cast<ConstantSDNode>(Op.getOperand(2))->getZExtValue());
19209 // The only fence that needs an instruction is a sequentially-consistent
19210 // cross-thread fence.
19211 if (FenceOrdering == SequentiallyConsistent && FenceScope == CrossThread) {
19212 if (hasMFENCE(*Subtarget))
19213 return DAG.getNode(X86ISD::MFENCE, dl, MVT::Other, Op.getOperand(0));
19215 SDValue Chain = Op.getOperand(0);
19216 SDValue Zero = DAG.getConstant(0, dl, MVT::i32);
19218 DAG.getRegister(X86::ESP, MVT::i32), // Base
19219 DAG.getTargetConstant(1, dl, MVT::i8), // Scale
19220 DAG.getRegister(0, MVT::i32), // Index
19221 DAG.getTargetConstant(0, dl, MVT::i32), // Disp
19222 DAG.getRegister(0, MVT::i32), // Segment.
19226 SDNode *Res = DAG.getMachineNode(X86::OR32mrLocked, dl, MVT::Other, Ops);
19227 return SDValue(Res, 0);
19230 // MEMBARRIER is a compiler barrier; it codegens to a no-op.
19231 return DAG.getNode(X86ISD::MEMBARRIER, dl, MVT::Other, Op.getOperand(0));
19234 static SDValue LowerCMP_SWAP(SDValue Op, const X86Subtarget *Subtarget,
19235 SelectionDAG &DAG) {
19236 MVT T = Op.getSimpleValueType();
19240 switch(T.SimpleTy) {
19241 default: llvm_unreachable("Invalid value type!");
19242 case MVT::i8: Reg = X86::AL; size = 1; break;
19243 case MVT::i16: Reg = X86::AX; size = 2; break;
19244 case MVT::i32: Reg = X86::EAX; size = 4; break;
19246 assert(Subtarget->is64Bit() && "Node not type legal!");
19247 Reg = X86::RAX; size = 8;
19250 SDValue cpIn = DAG.getCopyToReg(Op.getOperand(0), DL, Reg,
19251 Op.getOperand(2), SDValue());
19252 SDValue Ops[] = { cpIn.getValue(0),
19255 DAG.getTargetConstant(size, DL, MVT::i8),
19256 cpIn.getValue(1) };
19257 SDVTList Tys = DAG.getVTList(MVT::Other, MVT::Glue);
19258 MachineMemOperand *MMO = cast<AtomicSDNode>(Op)->getMemOperand();
19259 SDValue Result = DAG.getMemIntrinsicNode(X86ISD::LCMPXCHG_DAG, DL, Tys,
19263 DAG.getCopyFromReg(Result.getValue(0), DL, Reg, T, Result.getValue(1));
19264 SDValue EFLAGS = DAG.getCopyFromReg(cpOut.getValue(1), DL, X86::EFLAGS,
19265 MVT::i32, cpOut.getValue(2));
19266 SDValue Success = DAG.getNode(X86ISD::SETCC, DL, Op->getValueType(1),
19267 DAG.getConstant(X86::COND_E, DL, MVT::i8),
19270 DAG.ReplaceAllUsesOfValueWith(Op.getValue(0), cpOut);
19271 DAG.ReplaceAllUsesOfValueWith(Op.getValue(1), Success);
19272 DAG.ReplaceAllUsesOfValueWith(Op.getValue(2), EFLAGS.getValue(1));
19276 static SDValue LowerBITCAST(SDValue Op, const X86Subtarget *Subtarget,
19277 SelectionDAG &DAG) {
19278 MVT SrcVT = Op.getOperand(0).getSimpleValueType();
19279 MVT DstVT = Op.getSimpleValueType();
19281 if (SrcVT == MVT::v2i32 || SrcVT == MVT::v4i16 || SrcVT == MVT::v8i8) {
19282 assert(Subtarget->hasSSE2() && "Requires at least SSE2!");
19283 if (DstVT != MVT::f64)
19284 // This conversion needs to be expanded.
19287 SDValue InVec = Op->getOperand(0);
19289 unsigned NumElts = SrcVT.getVectorNumElements();
19290 MVT SVT = SrcVT.getVectorElementType();
19292 // Widen the vector in input in the case of MVT::v2i32.
19293 // Example: from MVT::v2i32 to MVT::v4i32.
19294 SmallVector<SDValue, 16> Elts;
19295 for (unsigned i = 0, e = NumElts; i != e; ++i)
19296 Elts.push_back(DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, SVT, InVec,
19297 DAG.getIntPtrConstant(i, dl)));
19299 // Explicitly mark the extra elements as Undef.
19300 Elts.append(NumElts, DAG.getUNDEF(SVT));
19302 EVT NewVT = EVT::getVectorVT(*DAG.getContext(), SVT, NumElts * 2);
19303 SDValue BV = DAG.getNode(ISD::BUILD_VECTOR, dl, NewVT, Elts);
19304 SDValue ToV2F64 = DAG.getBitcast(MVT::v2f64, BV);
19305 return DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::f64, ToV2F64,
19306 DAG.getIntPtrConstant(0, dl));
19309 assert(Subtarget->is64Bit() && !Subtarget->hasSSE2() &&
19310 Subtarget->hasMMX() && "Unexpected custom BITCAST");
19311 assert((DstVT == MVT::i64 ||
19312 (DstVT.isVector() && DstVT.getSizeInBits()==64)) &&
19313 "Unexpected custom BITCAST");
19314 // i64 <=> MMX conversions are Legal.
19315 if (SrcVT==MVT::i64 && DstVT.isVector())
19317 if (DstVT==MVT::i64 && SrcVT.isVector())
19319 // MMX <=> MMX conversions are Legal.
19320 if (SrcVT.isVector() && DstVT.isVector())
19322 // All other conversions need to be expanded.
19326 /// Compute the horizontal sum of bytes in V for the elements of VT.
19328 /// Requires V to be a byte vector and VT to be an integer vector type with
19329 /// wider elements than V's type. The width of the elements of VT determines
19330 /// how many bytes of V are summed horizontally to produce each element of the
19332 static SDValue LowerHorizontalByteSum(SDValue V, MVT VT,
19333 const X86Subtarget *Subtarget,
19334 SelectionDAG &DAG) {
19336 MVT ByteVecVT = V.getSimpleValueType();
19337 MVT EltVT = VT.getVectorElementType();
19338 int NumElts = VT.getVectorNumElements();
19339 assert(ByteVecVT.getVectorElementType() == MVT::i8 &&
19340 "Expected value to have byte element type.");
19341 assert(EltVT != MVT::i8 &&
19342 "Horizontal byte sum only makes sense for wider elements!");
19343 unsigned VecSize = VT.getSizeInBits();
19344 assert(ByteVecVT.getSizeInBits() == VecSize && "Cannot change vector size!");
19346 // PSADBW instruction horizontally add all bytes and leave the result in i64
19347 // chunks, thus directly computes the pop count for v2i64 and v4i64.
19348 if (EltVT == MVT::i64) {
19349 SDValue Zeros = getZeroVector(ByteVecVT, Subtarget, DAG, DL);
19350 MVT SadVecVT = MVT::getVectorVT(MVT::i64, VecSize / 64);
19351 V = DAG.getNode(X86ISD::PSADBW, DL, SadVecVT, V, Zeros);
19352 return DAG.getBitcast(VT, V);
19355 if (EltVT == MVT::i32) {
19356 // We unpack the low half and high half into i32s interleaved with zeros so
19357 // that we can use PSADBW to horizontally sum them. The most useful part of
19358 // this is that it lines up the results of two PSADBW instructions to be
19359 // two v2i64 vectors which concatenated are the 4 population counts. We can
19360 // then use PACKUSWB to shrink and concatenate them into a v4i32 again.
19361 SDValue Zeros = getZeroVector(VT, Subtarget, DAG, DL);
19362 SDValue Low = DAG.getNode(X86ISD::UNPCKL, DL, VT, V, Zeros);
19363 SDValue High = DAG.getNode(X86ISD::UNPCKH, DL, VT, V, Zeros);
19365 // Do the horizontal sums into two v2i64s.
19366 Zeros = getZeroVector(ByteVecVT, Subtarget, DAG, DL);
19367 MVT SadVecVT = MVT::getVectorVT(MVT::i64, VecSize / 64);
19368 Low = DAG.getNode(X86ISD::PSADBW, DL, SadVecVT,
19369 DAG.getBitcast(ByteVecVT, Low), Zeros);
19370 High = DAG.getNode(X86ISD::PSADBW, DL, SadVecVT,
19371 DAG.getBitcast(ByteVecVT, High), Zeros);
19373 // Merge them together.
19374 MVT ShortVecVT = MVT::getVectorVT(MVT::i16, VecSize / 16);
19375 V = DAG.getNode(X86ISD::PACKUS, DL, ByteVecVT,
19376 DAG.getBitcast(ShortVecVT, Low),
19377 DAG.getBitcast(ShortVecVT, High));
19379 return DAG.getBitcast(VT, V);
19382 // The only element type left is i16.
19383 assert(EltVT == MVT::i16 && "Unknown how to handle type");
19385 // To obtain pop count for each i16 element starting from the pop count for
19386 // i8 elements, shift the i16s left by 8, sum as i8s, and then shift as i16s
19387 // right by 8. It is important to shift as i16s as i8 vector shift isn't
19388 // directly supported.
19389 SmallVector<SDValue, 16> Shifters(NumElts, DAG.getConstant(8, DL, EltVT));
19390 SDValue Shifter = DAG.getNode(ISD::BUILD_VECTOR, DL, VT, Shifters);
19391 SDValue Shl = DAG.getNode(ISD::SHL, DL, VT, DAG.getBitcast(VT, V), Shifter);
19392 V = DAG.getNode(ISD::ADD, DL, ByteVecVT, DAG.getBitcast(ByteVecVT, Shl),
19393 DAG.getBitcast(ByteVecVT, V));
19394 return DAG.getNode(ISD::SRL, DL, VT, DAG.getBitcast(VT, V), Shifter);
19397 static SDValue LowerVectorCTPOPInRegLUT(SDValue Op, SDLoc DL,
19398 const X86Subtarget *Subtarget,
19399 SelectionDAG &DAG) {
19400 MVT VT = Op.getSimpleValueType();
19401 MVT EltVT = VT.getVectorElementType();
19402 unsigned VecSize = VT.getSizeInBits();
19404 // Implement a lookup table in register by using an algorithm based on:
19405 // http://wm.ite.pl/articles/sse-popcount.html
19407 // The general idea is that every lower byte nibble in the input vector is an
19408 // index into a in-register pre-computed pop count table. We then split up the
19409 // input vector in two new ones: (1) a vector with only the shifted-right
19410 // higher nibbles for each byte and (2) a vector with the lower nibbles (and
19411 // masked out higher ones) for each byte. PSHUB is used separately with both
19412 // to index the in-register table. Next, both are added and the result is a
19413 // i8 vector where each element contains the pop count for input byte.
19415 // To obtain the pop count for elements != i8, we follow up with the same
19416 // approach and use additional tricks as described below.
19418 const int LUT[16] = {/* 0 */ 0, /* 1 */ 1, /* 2 */ 1, /* 3 */ 2,
19419 /* 4 */ 1, /* 5 */ 2, /* 6 */ 2, /* 7 */ 3,
19420 /* 8 */ 1, /* 9 */ 2, /* a */ 2, /* b */ 3,
19421 /* c */ 2, /* d */ 3, /* e */ 3, /* f */ 4};
19423 int NumByteElts = VecSize / 8;
19424 MVT ByteVecVT = MVT::getVectorVT(MVT::i8, NumByteElts);
19425 SDValue In = DAG.getBitcast(ByteVecVT, Op);
19426 SmallVector<SDValue, 16> LUTVec;
19427 for (int i = 0; i < NumByteElts; ++i)
19428 LUTVec.push_back(DAG.getConstant(LUT[i % 16], DL, MVT::i8));
19429 SDValue InRegLUT = DAG.getNode(ISD::BUILD_VECTOR, DL, ByteVecVT, LUTVec);
19430 SmallVector<SDValue, 16> Mask0F(NumByteElts,
19431 DAG.getConstant(0x0F, DL, MVT::i8));
19432 SDValue M0F = DAG.getNode(ISD::BUILD_VECTOR, DL, ByteVecVT, Mask0F);
19435 SmallVector<SDValue, 16> Four(NumByteElts, DAG.getConstant(4, DL, MVT::i8));
19436 SDValue FourV = DAG.getNode(ISD::BUILD_VECTOR, DL, ByteVecVT, Four);
19437 SDValue HighNibbles = DAG.getNode(ISD::SRL, DL, ByteVecVT, In, FourV);
19440 SDValue LowNibbles = DAG.getNode(ISD::AND, DL, ByteVecVT, In, M0F);
19442 // The input vector is used as the shuffle mask that index elements into the
19443 // LUT. After counting low and high nibbles, add the vector to obtain the
19444 // final pop count per i8 element.
19445 SDValue HighPopCnt =
19446 DAG.getNode(X86ISD::PSHUFB, DL, ByteVecVT, InRegLUT, HighNibbles);
19447 SDValue LowPopCnt =
19448 DAG.getNode(X86ISD::PSHUFB, DL, ByteVecVT, InRegLUT, LowNibbles);
19449 SDValue PopCnt = DAG.getNode(ISD::ADD, DL, ByteVecVT, HighPopCnt, LowPopCnt);
19451 if (EltVT == MVT::i8)
19454 return LowerHorizontalByteSum(PopCnt, VT, Subtarget, DAG);
19457 static SDValue LowerVectorCTPOPBitmath(SDValue Op, SDLoc DL,
19458 const X86Subtarget *Subtarget,
19459 SelectionDAG &DAG) {
19460 MVT VT = Op.getSimpleValueType();
19461 assert(VT.is128BitVector() &&
19462 "Only 128-bit vector bitmath lowering supported.");
19464 int VecSize = VT.getSizeInBits();
19465 MVT EltVT = VT.getVectorElementType();
19466 int Len = EltVT.getSizeInBits();
19468 // This is the vectorized version of the "best" algorithm from
19469 // http://graphics.stanford.edu/~seander/bithacks.html#CountBitsSetParallel
19470 // with a minor tweak to use a series of adds + shifts instead of vector
19471 // multiplications. Implemented for all integer vector types. We only use
19472 // this when we don't have SSSE3 which allows a LUT-based lowering that is
19473 // much faster, even faster than using native popcnt instructions.
19475 auto GetShift = [&](unsigned OpCode, SDValue V, int Shifter) {
19476 MVT VT = V.getSimpleValueType();
19477 SmallVector<SDValue, 32> Shifters(
19478 VT.getVectorNumElements(),
19479 DAG.getConstant(Shifter, DL, VT.getVectorElementType()));
19480 return DAG.getNode(OpCode, DL, VT, V,
19481 DAG.getNode(ISD::BUILD_VECTOR, DL, VT, Shifters));
19483 auto GetMask = [&](SDValue V, APInt Mask) {
19484 MVT VT = V.getSimpleValueType();
19485 SmallVector<SDValue, 32> Masks(
19486 VT.getVectorNumElements(),
19487 DAG.getConstant(Mask, DL, VT.getVectorElementType()));
19488 return DAG.getNode(ISD::AND, DL, VT, V,
19489 DAG.getNode(ISD::BUILD_VECTOR, DL, VT, Masks));
19492 // We don't want to incur the implicit masks required to SRL vNi8 vectors on
19493 // x86, so set the SRL type to have elements at least i16 wide. This is
19494 // correct because all of our SRLs are followed immediately by a mask anyways
19495 // that handles any bits that sneak into the high bits of the byte elements.
19496 MVT SrlVT = Len > 8 ? VT : MVT::getVectorVT(MVT::i16, VecSize / 16);
19500 // v = v - ((v >> 1) & 0x55555555...)
19502 DAG.getBitcast(VT, GetShift(ISD::SRL, DAG.getBitcast(SrlVT, V), 1));
19503 SDValue And = GetMask(Srl, APInt::getSplat(Len, APInt(8, 0x55)));
19504 V = DAG.getNode(ISD::SUB, DL, VT, V, And);
19506 // v = (v & 0x33333333...) + ((v >> 2) & 0x33333333...)
19507 SDValue AndLHS = GetMask(V, APInt::getSplat(Len, APInt(8, 0x33)));
19508 Srl = DAG.getBitcast(VT, GetShift(ISD::SRL, DAG.getBitcast(SrlVT, V), 2));
19509 SDValue AndRHS = GetMask(Srl, APInt::getSplat(Len, APInt(8, 0x33)));
19510 V = DAG.getNode(ISD::ADD, DL, VT, AndLHS, AndRHS);
19512 // v = (v + (v >> 4)) & 0x0F0F0F0F...
19513 Srl = DAG.getBitcast(VT, GetShift(ISD::SRL, DAG.getBitcast(SrlVT, V), 4));
19514 SDValue Add = DAG.getNode(ISD::ADD, DL, VT, V, Srl);
19515 V = GetMask(Add, APInt::getSplat(Len, APInt(8, 0x0F)));
19517 // At this point, V contains the byte-wise population count, and we are
19518 // merely doing a horizontal sum if necessary to get the wider element
19520 if (EltVT == MVT::i8)
19523 return LowerHorizontalByteSum(
19524 DAG.getBitcast(MVT::getVectorVT(MVT::i8, VecSize / 8), V), VT, Subtarget,
19528 static SDValue LowerVectorCTPOP(SDValue Op, const X86Subtarget *Subtarget,
19529 SelectionDAG &DAG) {
19530 MVT VT = Op.getSimpleValueType();
19531 // FIXME: Need to add AVX-512 support here!
19532 assert((VT.is256BitVector() || VT.is128BitVector()) &&
19533 "Unknown CTPOP type to handle");
19534 SDLoc DL(Op.getNode());
19535 SDValue Op0 = Op.getOperand(0);
19537 if (!Subtarget->hasSSSE3()) {
19538 // We can't use the fast LUT approach, so fall back on vectorized bitmath.
19539 assert(VT.is128BitVector() && "Only 128-bit vectors supported in SSE!");
19540 return LowerVectorCTPOPBitmath(Op0, DL, Subtarget, DAG);
19543 if (VT.is256BitVector() && !Subtarget->hasInt256()) {
19544 unsigned NumElems = VT.getVectorNumElements();
19546 // Extract each 128-bit vector, compute pop count and concat the result.
19547 SDValue LHS = Extract128BitVector(Op0, 0, DAG, DL);
19548 SDValue RHS = Extract128BitVector(Op0, NumElems/2, DAG, DL);
19550 return DAG.getNode(ISD::CONCAT_VECTORS, DL, VT,
19551 LowerVectorCTPOPInRegLUT(LHS, DL, Subtarget, DAG),
19552 LowerVectorCTPOPInRegLUT(RHS, DL, Subtarget, DAG));
19555 return LowerVectorCTPOPInRegLUT(Op0, DL, Subtarget, DAG);
19558 static SDValue LowerCTPOP(SDValue Op, const X86Subtarget *Subtarget,
19559 SelectionDAG &DAG) {
19560 assert(Op.getSimpleValueType().isVector() &&
19561 "We only do custom lowering for vector population count.");
19562 return LowerVectorCTPOP(Op, Subtarget, DAG);
19565 static SDValue LowerLOAD_SUB(SDValue Op, SelectionDAG &DAG) {
19566 SDNode *Node = Op.getNode();
19568 EVT T = Node->getValueType(0);
19569 SDValue negOp = DAG.getNode(ISD::SUB, dl, T,
19570 DAG.getConstant(0, dl, T), Node->getOperand(2));
19571 return DAG.getAtomic(ISD::ATOMIC_LOAD_ADD, dl,
19572 cast<AtomicSDNode>(Node)->getMemoryVT(),
19573 Node->getOperand(0),
19574 Node->getOperand(1), negOp,
19575 cast<AtomicSDNode>(Node)->getMemOperand(),
19576 cast<AtomicSDNode>(Node)->getOrdering(),
19577 cast<AtomicSDNode>(Node)->getSynchScope());
19580 static SDValue LowerATOMIC_STORE(SDValue Op, SelectionDAG &DAG) {
19581 SDNode *Node = Op.getNode();
19583 EVT VT = cast<AtomicSDNode>(Node)->getMemoryVT();
19585 // Convert seq_cst store -> xchg
19586 // Convert wide store -> swap (-> cmpxchg8b/cmpxchg16b)
19587 // FIXME: On 32-bit, store -> fist or movq would be more efficient
19588 // (The only way to get a 16-byte store is cmpxchg16b)
19589 // FIXME: 16-byte ATOMIC_SWAP isn't actually hooked up at the moment.
19590 if (cast<AtomicSDNode>(Node)->getOrdering() == SequentiallyConsistent ||
19591 !DAG.getTargetLoweringInfo().isTypeLegal(VT)) {
19592 SDValue Swap = DAG.getAtomic(ISD::ATOMIC_SWAP, dl,
19593 cast<AtomicSDNode>(Node)->getMemoryVT(),
19594 Node->getOperand(0),
19595 Node->getOperand(1), Node->getOperand(2),
19596 cast<AtomicSDNode>(Node)->getMemOperand(),
19597 cast<AtomicSDNode>(Node)->getOrdering(),
19598 cast<AtomicSDNode>(Node)->getSynchScope());
19599 return Swap.getValue(1);
19601 // Other atomic stores have a simple pattern.
19605 static SDValue LowerADDC_ADDE_SUBC_SUBE(SDValue Op, SelectionDAG &DAG) {
19606 MVT VT = Op.getNode()->getSimpleValueType(0);
19608 // Let legalize expand this if it isn't a legal type yet.
19609 if (!DAG.getTargetLoweringInfo().isTypeLegal(VT))
19612 SDVTList VTs = DAG.getVTList(VT, MVT::i32);
19615 bool ExtraOp = false;
19616 switch (Op.getOpcode()) {
19617 default: llvm_unreachable("Invalid code");
19618 case ISD::ADDC: Opc = X86ISD::ADD; break;
19619 case ISD::ADDE: Opc = X86ISD::ADC; ExtraOp = true; break;
19620 case ISD::SUBC: Opc = X86ISD::SUB; break;
19621 case ISD::SUBE: Opc = X86ISD::SBB; ExtraOp = true; break;
19625 return DAG.getNode(Opc, SDLoc(Op), VTs, Op.getOperand(0),
19627 return DAG.getNode(Opc, SDLoc(Op), VTs, Op.getOperand(0),
19628 Op.getOperand(1), Op.getOperand(2));
19631 static SDValue LowerFSINCOS(SDValue Op, const X86Subtarget *Subtarget,
19632 SelectionDAG &DAG) {
19633 assert(Subtarget->isTargetDarwin() && Subtarget->is64Bit());
19635 // For MacOSX, we want to call an alternative entry point: __sincos_stret,
19636 // which returns the values as { float, float } (in XMM0) or
19637 // { double, double } (which is returned in XMM0, XMM1).
19639 SDValue Arg = Op.getOperand(0);
19640 EVT ArgVT = Arg.getValueType();
19641 Type *ArgTy = ArgVT.getTypeForEVT(*DAG.getContext());
19643 TargetLowering::ArgListTy Args;
19644 TargetLowering::ArgListEntry Entry;
19648 Entry.isSExt = false;
19649 Entry.isZExt = false;
19650 Args.push_back(Entry);
19652 bool isF64 = ArgVT == MVT::f64;
19653 // Only optimize x86_64 for now. i386 is a bit messy. For f32,
19654 // the small struct {f32, f32} is returned in (eax, edx). For f64,
19655 // the results are returned via SRet in memory.
19656 const char *LibcallName = isF64 ? "__sincos_stret" : "__sincosf_stret";
19657 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
19659 DAG.getExternalSymbol(LibcallName, TLI.getPointerTy(DAG.getDataLayout()));
19661 Type *RetTy = isF64
19662 ? (Type*)StructType::get(ArgTy, ArgTy, nullptr)
19663 : (Type*)VectorType::get(ArgTy, 4);
19665 TargetLowering::CallLoweringInfo CLI(DAG);
19666 CLI.setDebugLoc(dl).setChain(DAG.getEntryNode())
19667 .setCallee(CallingConv::C, RetTy, Callee, std::move(Args), 0);
19669 std::pair<SDValue, SDValue> CallResult = TLI.LowerCallTo(CLI);
19672 // Returned in xmm0 and xmm1.
19673 return CallResult.first;
19675 // Returned in bits 0:31 and 32:64 xmm0.
19676 SDValue SinVal = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, ArgVT,
19677 CallResult.first, DAG.getIntPtrConstant(0, dl));
19678 SDValue CosVal = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, ArgVT,
19679 CallResult.first, DAG.getIntPtrConstant(1, dl));
19680 SDVTList Tys = DAG.getVTList(ArgVT, ArgVT);
19681 return DAG.getNode(ISD::MERGE_VALUES, dl, Tys, SinVal, CosVal);
19684 /// Widen a vector input to a vector of NVT. The
19685 /// input vector must have the same element type as NVT.
19686 static SDValue ExtendToType(SDValue InOp, MVT NVT, SelectionDAG &DAG,
19687 bool FillWithZeroes = false) {
19688 // Check if InOp already has the right width.
19689 MVT InVT = InOp.getSimpleValueType();
19693 if (InOp.isUndef())
19694 return DAG.getUNDEF(NVT);
19696 assert(InVT.getVectorElementType() == NVT.getVectorElementType() &&
19697 "input and widen element type must match");
19699 unsigned InNumElts = InVT.getVectorNumElements();
19700 unsigned WidenNumElts = NVT.getVectorNumElements();
19701 assert(WidenNumElts > InNumElts && WidenNumElts % InNumElts == 0 &&
19702 "Unexpected request for vector widening");
19704 EVT EltVT = NVT.getVectorElementType();
19707 if (InOp.getOpcode() == ISD::CONCAT_VECTORS &&
19708 InOp.getNumOperands() == 2) {
19709 SDValue N1 = InOp.getOperand(1);
19710 if ((ISD::isBuildVectorAllZeros(N1.getNode()) && FillWithZeroes) ||
19712 InOp = InOp.getOperand(0);
19713 InVT = InOp.getSimpleValueType();
19714 InNumElts = InVT.getVectorNumElements();
19717 if (ISD::isBuildVectorOfConstantSDNodes(InOp.getNode()) ||
19718 ISD::isBuildVectorOfConstantFPSDNodes(InOp.getNode())) {
19719 SmallVector<SDValue, 16> Ops;
19720 for (unsigned i = 0; i < InNumElts; ++i)
19721 Ops.push_back(InOp.getOperand(i));
19723 SDValue FillVal = FillWithZeroes ? DAG.getConstant(0, dl, EltVT) :
19724 DAG.getUNDEF(EltVT);
19725 for (unsigned i = 0; i < WidenNumElts - InNumElts; ++i)
19726 Ops.push_back(FillVal);
19727 return DAG.getNode(ISD::BUILD_VECTOR, dl, NVT, Ops);
19729 SDValue FillVal = FillWithZeroes ? DAG.getConstant(0, dl, NVT) :
19731 return DAG.getNode(ISD::INSERT_SUBVECTOR, dl, NVT, FillVal,
19732 InOp, DAG.getIntPtrConstant(0, dl));
19735 static SDValue LowerMSCATTER(SDValue Op, const X86Subtarget *Subtarget,
19736 SelectionDAG &DAG) {
19737 assert(Subtarget->hasAVX512() &&
19738 "MGATHER/MSCATTER are supported on AVX-512 arch only");
19740 // X86 scatter kills mask register, so its type should be added to
19741 // the list of return values.
19742 // If the "scatter" has 2 return values, it is already handled.
19743 if (Op.getNode()->getNumValues() == 2)
19746 MaskedScatterSDNode *N = cast<MaskedScatterSDNode>(Op.getNode());
19747 SDValue Src = N->getValue();
19748 MVT VT = Src.getSimpleValueType();
19749 assert(VT.getScalarSizeInBits() >= 32 && "Unsupported scatter op");
19752 SDValue NewScatter;
19753 SDValue Index = N->getIndex();
19754 SDValue Mask = N->getMask();
19755 SDValue Chain = N->getChain();
19756 SDValue BasePtr = N->getBasePtr();
19757 MVT MemVT = N->getMemoryVT().getSimpleVT();
19758 MVT IndexVT = Index.getSimpleValueType();
19759 MVT MaskVT = Mask.getSimpleValueType();
19761 if (MemVT.getScalarSizeInBits() < VT.getScalarSizeInBits()) {
19762 // The v2i32 value was promoted to v2i64.
19763 // Now we "redo" the type legalizer's work and widen the original
19764 // v2i32 value to v4i32. The original v2i32 is retrieved from v2i64
19766 assert((MemVT == MVT::v2i32 && VT == MVT::v2i64) &&
19767 "Unexpected memory type");
19768 int ShuffleMask[] = {0, 2, -1, -1};
19769 Src = DAG.getVectorShuffle(MVT::v4i32, dl, DAG.getBitcast(MVT::v4i32, Src),
19770 DAG.getUNDEF(MVT::v4i32), ShuffleMask);
19771 // Now we have 4 elements instead of 2.
19772 // Expand the index.
19773 MVT NewIndexVT = MVT::getVectorVT(IndexVT.getScalarType(), 4);
19774 Index = ExtendToType(Index, NewIndexVT, DAG);
19776 // Expand the mask with zeroes
19777 // Mask may be <2 x i64> or <2 x i1> at this moment
19778 assert((MaskVT == MVT::v2i1 || MaskVT == MVT::v2i64) &&
19779 "Unexpected mask type");
19780 MVT ExtMaskVT = MVT::getVectorVT(MaskVT.getScalarType(), 4);
19781 Mask = ExtendToType(Mask, ExtMaskVT, DAG, true);
19785 unsigned NumElts = VT.getVectorNumElements();
19786 if (!Subtarget->hasVLX() && !VT.is512BitVector() &&
19787 !Index.getSimpleValueType().is512BitVector()) {
19788 // AVX512F supports only 512-bit vectors. Or data or index should
19789 // be 512 bit wide. If now the both index and data are 256-bit, but
19790 // the vector contains 8 elements, we just sign-extend the index
19791 if (IndexVT == MVT::v8i32)
19792 // Just extend index
19793 Index = DAG.getNode(ISD::SIGN_EXTEND, dl, MVT::v8i64, Index);
19795 // The minimal number of elts in scatter is 8
19798 MVT NewIndexVT = MVT::getVectorVT(IndexVT.getScalarType(), NumElts);
19799 // Use original index here, do not modify the index twice
19800 Index = ExtendToType(N->getIndex(), NewIndexVT, DAG);
19801 if (IndexVT.getScalarType() == MVT::i32)
19802 Index = DAG.getNode(ISD::SIGN_EXTEND, dl, MVT::v8i64, Index);
19805 // At this point we have promoted mask operand
19806 assert(MaskVT.getScalarSizeInBits() >= 32 && "unexpected mask type");
19807 MVT ExtMaskVT = MVT::getVectorVT(MaskVT.getScalarType(), NumElts);
19808 // Use the original mask here, do not modify the mask twice
19809 Mask = ExtendToType(N->getMask(), ExtMaskVT, DAG, true);
19811 // The value that should be stored
19812 MVT NewVT = MVT::getVectorVT(VT.getScalarType(), NumElts);
19813 Src = ExtendToType(Src, NewVT, DAG);
19816 // If the mask is "wide" at this point - truncate it to i1 vector
19817 MVT BitMaskVT = MVT::getVectorVT(MVT::i1, NumElts);
19818 Mask = DAG.getNode(ISD::TRUNCATE, dl, BitMaskVT, Mask);
19820 // The mask is killed by scatter, add it to the values
19821 SDVTList VTs = DAG.getVTList(BitMaskVT, MVT::Other);
19822 SDValue Ops[] = {Chain, Src, Mask, BasePtr, Index};
19823 NewScatter = DAG.getMaskedScatter(VTs, N->getMemoryVT(), dl, Ops,
19824 N->getMemOperand());
19825 DAG.ReplaceAllUsesWith(Op, SDValue(NewScatter.getNode(), 1));
19826 return SDValue(NewScatter.getNode(), 0);
19829 static SDValue LowerMLOAD(SDValue Op, const X86Subtarget *Subtarget,
19830 SelectionDAG &DAG) {
19832 MaskedLoadSDNode *N = cast<MaskedLoadSDNode>(Op.getNode());
19833 MVT VT = Op.getSimpleValueType();
19834 SDValue Mask = N->getMask();
19837 if (Subtarget->hasAVX512() && !Subtarget->hasVLX() &&
19838 !VT.is512BitVector() && Mask.getValueType() == MVT::v8i1) {
19839 // This operation is legal for targets with VLX, but without
19840 // VLX the vector should be widened to 512 bit
19841 unsigned NumEltsInWideVec = 512/VT.getScalarSizeInBits();
19842 MVT WideDataVT = MVT::getVectorVT(VT.getScalarType(), NumEltsInWideVec);
19843 MVT WideMaskVT = MVT::getVectorVT(MVT::i1, NumEltsInWideVec);
19844 SDValue Src0 = N->getSrc0();
19845 Src0 = ExtendToType(Src0, WideDataVT, DAG);
19846 Mask = ExtendToType(Mask, WideMaskVT, DAG, true);
19847 SDValue NewLoad = DAG.getMaskedLoad(WideDataVT, dl, N->getChain(),
19848 N->getBasePtr(), Mask, Src0,
19849 N->getMemoryVT(), N->getMemOperand(),
19850 N->getExtensionType());
19852 SDValue Exract = DAG.getNode(ISD::EXTRACT_SUBVECTOR, dl, VT,
19853 NewLoad.getValue(0),
19854 DAG.getIntPtrConstant(0, dl));
19855 SDValue RetOps[] = {Exract, NewLoad.getValue(1)};
19856 return DAG.getMergeValues(RetOps, dl);
19861 static SDValue LowerMSTORE(SDValue Op, const X86Subtarget *Subtarget,
19862 SelectionDAG &DAG) {
19863 MaskedStoreSDNode *N = cast<MaskedStoreSDNode>(Op.getNode());
19864 SDValue DataToStore = N->getValue();
19865 MVT VT = DataToStore.getSimpleValueType();
19866 SDValue Mask = N->getMask();
19869 if (Subtarget->hasAVX512() && !Subtarget->hasVLX() &&
19870 !VT.is512BitVector() && Mask.getValueType() == MVT::v8i1) {
19871 // This operation is legal for targets with VLX, but without
19872 // VLX the vector should be widened to 512 bit
19873 unsigned NumEltsInWideVec = 512/VT.getScalarSizeInBits();
19874 MVT WideDataVT = MVT::getVectorVT(VT.getScalarType(), NumEltsInWideVec);
19875 MVT WideMaskVT = MVT::getVectorVT(MVT::i1, NumEltsInWideVec);
19876 DataToStore = ExtendToType(DataToStore, WideDataVT, DAG);
19877 Mask = ExtendToType(Mask, WideMaskVT, DAG, true);
19878 return DAG.getMaskedStore(N->getChain(), dl, DataToStore, N->getBasePtr(),
19879 Mask, N->getMemoryVT(), N->getMemOperand(),
19880 N->isTruncatingStore());
19885 static SDValue LowerMGATHER(SDValue Op, const X86Subtarget *Subtarget,
19886 SelectionDAG &DAG) {
19887 assert(Subtarget->hasAVX512() &&
19888 "MGATHER/MSCATTER are supported on AVX-512 arch only");
19890 MaskedGatherSDNode *N = cast<MaskedGatherSDNode>(Op.getNode());
19892 MVT VT = Op.getSimpleValueType();
19893 SDValue Index = N->getIndex();
19894 SDValue Mask = N->getMask();
19895 SDValue Src0 = N->getValue();
19896 MVT IndexVT = Index.getSimpleValueType();
19897 MVT MaskVT = Mask.getSimpleValueType();
19899 unsigned NumElts = VT.getVectorNumElements();
19900 assert(VT.getScalarSizeInBits() >= 32 && "Unsupported gather op");
19902 if (!Subtarget->hasVLX() && !VT.is512BitVector() &&
19903 !Index.getSimpleValueType().is512BitVector()) {
19904 // AVX512F supports only 512-bit vectors. Or data or index should
19905 // be 512 bit wide. If now the both index and data are 256-bit, but
19906 // the vector contains 8 elements, we just sign-extend the index
19907 if (NumElts == 8) {
19908 Index = DAG.getNode(ISD::SIGN_EXTEND, dl, MVT::v8i64, Index);
19909 SDValue Ops[] = { N->getOperand(0), N->getOperand(1), N->getOperand(2),
19910 N->getOperand(3), Index };
19911 DAG.UpdateNodeOperands(N, Ops);
19915 // Minimal number of elements in Gather
19918 MVT NewIndexVT = MVT::getVectorVT(IndexVT.getScalarType(), NumElts);
19919 Index = ExtendToType(Index, NewIndexVT, DAG);
19920 if (IndexVT.getScalarType() == MVT::i32)
19921 Index = DAG.getNode(ISD::SIGN_EXTEND, dl, MVT::v8i64, Index);
19924 MVT MaskBitVT = MVT::getVectorVT(MVT::i1, NumElts);
19925 // At this point we have promoted mask operand
19926 assert(MaskVT.getScalarSizeInBits() >= 32 && "unexpected mask type");
19927 MVT ExtMaskVT = MVT::getVectorVT(MaskVT.getScalarType(), NumElts);
19928 Mask = ExtendToType(Mask, ExtMaskVT, DAG, true);
19929 Mask = DAG.getNode(ISD::TRUNCATE, dl, MaskBitVT, Mask);
19931 // The pass-thru value
19932 MVT NewVT = MVT::getVectorVT(VT.getScalarType(), NumElts);
19933 Src0 = ExtendToType(Src0, NewVT, DAG);
19935 SDValue Ops[] = { N->getChain(), Src0, Mask, N->getBasePtr(), Index };
19936 SDValue NewGather = DAG.getMaskedGather(DAG.getVTList(NewVT, MVT::Other),
19937 N->getMemoryVT(), dl, Ops,
19938 N->getMemOperand());
19939 SDValue Exract = DAG.getNode(ISD::EXTRACT_SUBVECTOR, dl, VT,
19940 NewGather.getValue(0),
19941 DAG.getIntPtrConstant(0, dl));
19942 SDValue RetOps[] = {Exract, NewGather.getValue(1)};
19943 return DAG.getMergeValues(RetOps, dl);
19948 SDValue X86TargetLowering::LowerGC_TRANSITION_START(SDValue Op,
19949 SelectionDAG &DAG) const {
19950 // TODO: Eventually, the lowering of these nodes should be informed by or
19951 // deferred to the GC strategy for the function in which they appear. For
19952 // now, however, they must be lowered to something. Since they are logically
19953 // no-ops in the case of a null GC strategy (or a GC strategy which does not
19954 // require special handling for these nodes), lower them as literal NOOPs for
19956 SmallVector<SDValue, 2> Ops;
19958 Ops.push_back(Op.getOperand(0));
19959 if (Op->getGluedNode())
19960 Ops.push_back(Op->getOperand(Op->getNumOperands() - 1));
19963 SDVTList VTs = DAG.getVTList(MVT::Other, MVT::Glue);
19964 SDValue NOOP(DAG.getMachineNode(X86::NOOP, SDLoc(Op), VTs, Ops), 0);
19969 SDValue X86TargetLowering::LowerGC_TRANSITION_END(SDValue Op,
19970 SelectionDAG &DAG) const {
19971 // TODO: Eventually, the lowering of these nodes should be informed by or
19972 // deferred to the GC strategy for the function in which they appear. For
19973 // now, however, they must be lowered to something. Since they are logically
19974 // no-ops in the case of a null GC strategy (or a GC strategy which does not
19975 // require special handling for these nodes), lower them as literal NOOPs for
19977 SmallVector<SDValue, 2> Ops;
19979 Ops.push_back(Op.getOperand(0));
19980 if (Op->getGluedNode())
19981 Ops.push_back(Op->getOperand(Op->getNumOperands() - 1));
19984 SDVTList VTs = DAG.getVTList(MVT::Other, MVT::Glue);
19985 SDValue NOOP(DAG.getMachineNode(X86::NOOP, SDLoc(Op), VTs, Ops), 0);
19990 /// LowerOperation - Provide custom lowering hooks for some operations.
19992 SDValue X86TargetLowering::LowerOperation(SDValue Op, SelectionDAG &DAG) const {
19993 switch (Op.getOpcode()) {
19994 default: llvm_unreachable("Should not custom lower this!");
19995 case ISD::ATOMIC_FENCE: return LowerATOMIC_FENCE(Op, Subtarget, DAG);
19996 case ISD::ATOMIC_CMP_SWAP_WITH_SUCCESS:
19997 return LowerCMP_SWAP(Op, Subtarget, DAG);
19998 case ISD::CTPOP: return LowerCTPOP(Op, Subtarget, DAG);
19999 case ISD::ATOMIC_LOAD_SUB: return LowerLOAD_SUB(Op,DAG);
20000 case ISD::ATOMIC_STORE: return LowerATOMIC_STORE(Op,DAG);
20001 case ISD::BUILD_VECTOR: return LowerBUILD_VECTOR(Op, DAG);
20002 case ISD::CONCAT_VECTORS: return LowerCONCAT_VECTORS(Op, Subtarget, DAG);
20003 case ISD::VECTOR_SHUFFLE: return lowerVectorShuffle(Op, Subtarget, DAG);
20004 case ISD::VSELECT: return LowerVSELECT(Op, DAG);
20005 case ISD::EXTRACT_VECTOR_ELT: return LowerEXTRACT_VECTOR_ELT(Op, DAG);
20006 case ISD::INSERT_VECTOR_ELT: return LowerINSERT_VECTOR_ELT(Op, DAG);
20007 case ISD::EXTRACT_SUBVECTOR: return LowerEXTRACT_SUBVECTOR(Op,Subtarget,DAG);
20008 case ISD::INSERT_SUBVECTOR: return LowerINSERT_SUBVECTOR(Op, Subtarget,DAG);
20009 case ISD::SCALAR_TO_VECTOR: return LowerSCALAR_TO_VECTOR(Op, DAG);
20010 case ISD::ConstantPool: return LowerConstantPool(Op, DAG);
20011 case ISD::GlobalAddress: return LowerGlobalAddress(Op, DAG);
20012 case ISD::GlobalTLSAddress: return LowerGlobalTLSAddress(Op, DAG);
20013 case ISD::ExternalSymbol: return LowerExternalSymbol(Op, DAG);
20014 case ISD::BlockAddress: return LowerBlockAddress(Op, DAG);
20015 case ISD::SHL_PARTS:
20016 case ISD::SRA_PARTS:
20017 case ISD::SRL_PARTS: return LowerShiftParts(Op, DAG);
20018 case ISD::SINT_TO_FP: return LowerSINT_TO_FP(Op, DAG);
20019 case ISD::UINT_TO_FP: return LowerUINT_TO_FP(Op, DAG);
20020 case ISD::TRUNCATE: return LowerTRUNCATE(Op, DAG);
20021 case ISD::ZERO_EXTEND: return LowerZERO_EXTEND(Op, Subtarget, DAG);
20022 case ISD::SIGN_EXTEND: return LowerSIGN_EXTEND(Op, Subtarget, DAG);
20023 case ISD::ANY_EXTEND: return LowerANY_EXTEND(Op, Subtarget, DAG);
20024 case ISD::SIGN_EXTEND_VECTOR_INREG:
20025 return LowerSIGN_EXTEND_VECTOR_INREG(Op, Subtarget, DAG);
20026 case ISD::FP_TO_SINT: return LowerFP_TO_SINT(Op, DAG);
20027 case ISD::FP_TO_UINT: return LowerFP_TO_UINT(Op, DAG);
20028 case ISD::FP_EXTEND: return LowerFP_EXTEND(Op, DAG);
20029 case ISD::LOAD: return LowerExtendedLoad(Op, Subtarget, DAG);
20031 case ISD::FNEG: return LowerFABSorFNEG(Op, DAG);
20032 case ISD::FCOPYSIGN: return LowerFCOPYSIGN(Op, DAG);
20033 case ISD::FGETSIGN: return LowerFGETSIGN(Op, DAG);
20034 case ISD::SETCC: return LowerSETCC(Op, DAG);
20035 case ISD::SETCCE: return LowerSETCCE(Op, DAG);
20036 case ISD::SELECT: return LowerSELECT(Op, DAG);
20037 case ISD::BRCOND: return LowerBRCOND(Op, DAG);
20038 case ISD::JumpTable: return LowerJumpTable(Op, DAG);
20039 case ISD::VASTART: return LowerVASTART(Op, DAG);
20040 case ISD::VAARG: return LowerVAARG(Op, DAG);
20041 case ISD::VACOPY: return LowerVACOPY(Op, Subtarget, DAG);
20042 case ISD::INTRINSIC_WO_CHAIN: return LowerINTRINSIC_WO_CHAIN(Op, Subtarget, DAG);
20043 case ISD::INTRINSIC_VOID:
20044 case ISD::INTRINSIC_W_CHAIN: return LowerINTRINSIC_W_CHAIN(Op, Subtarget, DAG);
20045 case ISD::RETURNADDR: return LowerRETURNADDR(Op, DAG);
20046 case ISD::FRAMEADDR: return LowerFRAMEADDR(Op, DAG);
20047 case ISD::FRAME_TO_ARGS_OFFSET:
20048 return LowerFRAME_TO_ARGS_OFFSET(Op, DAG);
20049 case ISD::DYNAMIC_STACKALLOC: return LowerDYNAMIC_STACKALLOC(Op, DAG);
20050 case ISD::EH_RETURN: return LowerEH_RETURN(Op, DAG);
20051 case ISD::EH_SJLJ_SETJMP: return lowerEH_SJLJ_SETJMP(Op, DAG);
20052 case ISD::EH_SJLJ_LONGJMP: return lowerEH_SJLJ_LONGJMP(Op, DAG);
20053 case ISD::INIT_TRAMPOLINE: return LowerINIT_TRAMPOLINE(Op, DAG);
20054 case ISD::ADJUST_TRAMPOLINE: return LowerADJUST_TRAMPOLINE(Op, DAG);
20055 case ISD::FLT_ROUNDS_: return LowerFLT_ROUNDS_(Op, DAG);
20056 case ISD::CTLZ: return LowerCTLZ(Op, Subtarget, DAG);
20057 case ISD::CTLZ_ZERO_UNDEF: return LowerCTLZ_ZERO_UNDEF(Op, Subtarget, DAG);
20059 case ISD::CTTZ_ZERO_UNDEF: return LowerCTTZ(Op, DAG);
20060 case ISD::MUL: return LowerMUL(Op, Subtarget, DAG);
20061 case ISD::UMUL_LOHI:
20062 case ISD::SMUL_LOHI: return LowerMUL_LOHI(Op, Subtarget, DAG);
20063 case ISD::ROTL: return LowerRotate(Op, Subtarget, DAG);
20066 case ISD::SHL: return LowerShift(Op, Subtarget, DAG);
20072 case ISD::UMULO: return LowerXALUO(Op, DAG);
20073 case ISD::READCYCLECOUNTER: return LowerREADCYCLECOUNTER(Op, Subtarget,DAG);
20074 case ISD::BITCAST: return LowerBITCAST(Op, Subtarget, DAG);
20078 case ISD::SUBE: return LowerADDC_ADDE_SUBC_SUBE(Op, DAG);
20079 case ISD::ADD: return LowerADD(Op, DAG);
20080 case ISD::SUB: return LowerSUB(Op, DAG);
20084 case ISD::UMIN: return LowerMINMAX(Op, DAG);
20085 case ISD::FSINCOS: return LowerFSINCOS(Op, Subtarget, DAG);
20086 case ISD::MLOAD: return LowerMLOAD(Op, Subtarget, DAG);
20087 case ISD::MSTORE: return LowerMSTORE(Op, Subtarget, DAG);
20088 case ISD::MGATHER: return LowerMGATHER(Op, Subtarget, DAG);
20089 case ISD::MSCATTER: return LowerMSCATTER(Op, Subtarget, DAG);
20090 case ISD::GC_TRANSITION_START:
20091 return LowerGC_TRANSITION_START(Op, DAG);
20092 case ISD::GC_TRANSITION_END: return LowerGC_TRANSITION_END(Op, DAG);
20096 /// ReplaceNodeResults - Replace a node with an illegal result type
20097 /// with a new node built out of custom code.
20098 void X86TargetLowering::ReplaceNodeResults(SDNode *N,
20099 SmallVectorImpl<SDValue>&Results,
20100 SelectionDAG &DAG) const {
20102 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
20103 switch (N->getOpcode()) {
20105 llvm_unreachable("Do not know how to custom type legalize this operation!");
20106 case X86ISD::AVG: {
20107 // Legalize types for X86ISD::AVG by expanding vectors.
20108 assert(Subtarget->hasSSE2() && "Requires at least SSE2!");
20110 auto InVT = N->getValueType(0);
20111 auto InVTSize = InVT.getSizeInBits();
20112 const unsigned RegSize =
20113 (InVTSize > 128) ? ((InVTSize > 256) ? 512 : 256) : 128;
20114 assert((!Subtarget->hasAVX512() || RegSize < 512) &&
20115 "512-bit vector requires AVX512");
20116 assert((!Subtarget->hasAVX2() || RegSize < 256) &&
20117 "256-bit vector requires AVX2");
20119 auto ElemVT = InVT.getVectorElementType();
20120 auto RegVT = EVT::getVectorVT(*DAG.getContext(), ElemVT,
20121 RegSize / ElemVT.getSizeInBits());
20122 assert(RegSize % InVT.getSizeInBits() == 0);
20123 unsigned NumConcat = RegSize / InVT.getSizeInBits();
20125 SmallVector<SDValue, 16> Ops(NumConcat, DAG.getUNDEF(InVT));
20126 Ops[0] = N->getOperand(0);
20127 SDValue InVec0 = DAG.getNode(ISD::CONCAT_VECTORS, dl, RegVT, Ops);
20128 Ops[0] = N->getOperand(1);
20129 SDValue InVec1 = DAG.getNode(ISD::CONCAT_VECTORS, dl, RegVT, Ops);
20131 SDValue Res = DAG.getNode(X86ISD::AVG, dl, RegVT, InVec0, InVec1);
20132 Results.push_back(DAG.getNode(ISD::EXTRACT_SUBVECTOR, dl, InVT, Res,
20133 DAG.getIntPtrConstant(0, dl)));
20136 // We might have generated v2f32 FMIN/FMAX operations. Widen them to v4f32.
20137 case X86ISD::FMINC:
20139 case X86ISD::FMAXC:
20140 case X86ISD::FMAX: {
20141 EVT VT = N->getValueType(0);
20142 assert(VT == MVT::v2f32 && "Unexpected type (!= v2f32) on FMIN/FMAX.");
20143 SDValue UNDEF = DAG.getUNDEF(VT);
20144 SDValue LHS = DAG.getNode(ISD::CONCAT_VECTORS, dl, MVT::v4f32,
20145 N->getOperand(0), UNDEF);
20146 SDValue RHS = DAG.getNode(ISD::CONCAT_VECTORS, dl, MVT::v4f32,
20147 N->getOperand(1), UNDEF);
20148 Results.push_back(DAG.getNode(N->getOpcode(), dl, MVT::v4f32, LHS, RHS));
20151 case ISD::SIGN_EXTEND_INREG:
20156 // We don't want to expand or promote these.
20163 case ISD::UDIVREM: {
20164 SDValue V = LowerWin64_i128OP(SDValue(N,0), DAG);
20165 Results.push_back(V);
20168 case ISD::FP_TO_SINT:
20169 case ISD::FP_TO_UINT: {
20170 bool IsSigned = N->getOpcode() == ISD::FP_TO_SINT;
20172 std::pair<SDValue,SDValue> Vals =
20173 FP_TO_INTHelper(SDValue(N, 0), DAG, IsSigned, /*IsReplace=*/ true);
20174 SDValue FIST = Vals.first, StackSlot = Vals.second;
20175 if (FIST.getNode()) {
20176 EVT VT = N->getValueType(0);
20177 // Return a load from the stack slot.
20178 if (StackSlot.getNode())
20179 Results.push_back(DAG.getLoad(VT, dl, FIST, StackSlot,
20180 MachinePointerInfo(),
20181 false, false, false, 0));
20183 Results.push_back(FIST);
20187 case ISD::UINT_TO_FP: {
20188 assert(Subtarget->hasSSE2() && "Requires at least SSE2!");
20189 if (N->getOperand(0).getValueType() != MVT::v2i32 ||
20190 N->getValueType(0) != MVT::v2f32)
20192 SDValue ZExtIn = DAG.getNode(ISD::ZERO_EXTEND, dl, MVT::v2i64,
20194 SDValue Bias = DAG.getConstantFP(BitsToDouble(0x4330000000000000ULL), dl,
20196 SDValue VBias = DAG.getNode(ISD::BUILD_VECTOR, dl, MVT::v2f64, Bias, Bias);
20197 SDValue Or = DAG.getNode(ISD::OR, dl, MVT::v2i64, ZExtIn,
20198 DAG.getBitcast(MVT::v2i64, VBias));
20199 Or = DAG.getBitcast(MVT::v2f64, Or);
20200 // TODO: Are there any fast-math-flags to propagate here?
20201 SDValue Sub = DAG.getNode(ISD::FSUB, dl, MVT::v2f64, Or, VBias);
20202 Results.push_back(DAG.getNode(X86ISD::VFPROUND, dl, MVT::v4f32, Sub));
20205 case ISD::FP_ROUND: {
20206 if (!TLI.isTypeLegal(N->getOperand(0).getValueType()))
20208 SDValue V = DAG.getNode(X86ISD::VFPROUND, dl, MVT::v4f32, N->getOperand(0));
20209 Results.push_back(V);
20212 case ISD::FP_EXTEND: {
20213 // Right now, only MVT::v2f32 has OperationAction for FP_EXTEND.
20214 // No other ValueType for FP_EXTEND should reach this point.
20215 assert(N->getValueType(0) == MVT::v2f32 &&
20216 "Do not know how to legalize this Node");
20219 case ISD::INTRINSIC_W_CHAIN: {
20220 unsigned IntNo = cast<ConstantSDNode>(N->getOperand(1))->getZExtValue();
20222 default : llvm_unreachable("Do not know how to custom type "
20223 "legalize this intrinsic operation!");
20224 case Intrinsic::x86_rdtsc:
20225 return getReadTimeStampCounter(N, dl, X86ISD::RDTSC_DAG, DAG, Subtarget,
20227 case Intrinsic::x86_rdtscp:
20228 return getReadTimeStampCounter(N, dl, X86ISD::RDTSCP_DAG, DAG, Subtarget,
20230 case Intrinsic::x86_rdpmc:
20231 return getReadPerformanceCounter(N, dl, DAG, Subtarget, Results);
20234 case ISD::INTRINSIC_WO_CHAIN: {
20235 if (SDValue V = LowerINTRINSIC_WO_CHAIN(SDValue(N, 0), Subtarget, DAG))
20236 Results.push_back(V);
20239 case ISD::READCYCLECOUNTER: {
20240 return getReadTimeStampCounter(N, dl, X86ISD::RDTSC_DAG, DAG, Subtarget,
20243 case ISD::ATOMIC_CMP_SWAP_WITH_SUCCESS: {
20244 EVT T = N->getValueType(0);
20245 assert((T == MVT::i64 || T == MVT::i128) && "can only expand cmpxchg pair");
20246 bool Regs64bit = T == MVT::i128;
20247 MVT HalfT = Regs64bit ? MVT::i64 : MVT::i32;
20248 SDValue cpInL, cpInH;
20249 cpInL = DAG.getNode(ISD::EXTRACT_ELEMENT, dl, HalfT, N->getOperand(2),
20250 DAG.getConstant(0, dl, HalfT));
20251 cpInH = DAG.getNode(ISD::EXTRACT_ELEMENT, dl, HalfT, N->getOperand(2),
20252 DAG.getConstant(1, dl, HalfT));
20253 cpInL = DAG.getCopyToReg(N->getOperand(0), dl,
20254 Regs64bit ? X86::RAX : X86::EAX,
20256 cpInH = DAG.getCopyToReg(cpInL.getValue(0), dl,
20257 Regs64bit ? X86::RDX : X86::EDX,
20258 cpInH, cpInL.getValue(1));
20259 SDValue swapInL, swapInH;
20260 swapInL = DAG.getNode(ISD::EXTRACT_ELEMENT, dl, HalfT, N->getOperand(3),
20261 DAG.getConstant(0, dl, HalfT));
20262 swapInH = DAG.getNode(ISD::EXTRACT_ELEMENT, dl, HalfT, N->getOperand(3),
20263 DAG.getConstant(1, dl, HalfT));
20264 swapInL = DAG.getCopyToReg(cpInH.getValue(0), dl,
20265 Regs64bit ? X86::RBX : X86::EBX,
20266 swapInL, cpInH.getValue(1));
20267 swapInH = DAG.getCopyToReg(swapInL.getValue(0), dl,
20268 Regs64bit ? X86::RCX : X86::ECX,
20269 swapInH, swapInL.getValue(1));
20270 SDValue Ops[] = { swapInH.getValue(0),
20272 swapInH.getValue(1) };
20273 SDVTList Tys = DAG.getVTList(MVT::Other, MVT::Glue);
20274 MachineMemOperand *MMO = cast<AtomicSDNode>(N)->getMemOperand();
20275 unsigned Opcode = Regs64bit ? X86ISD::LCMPXCHG16_DAG :
20276 X86ISD::LCMPXCHG8_DAG;
20277 SDValue Result = DAG.getMemIntrinsicNode(Opcode, dl, Tys, Ops, T, MMO);
20278 SDValue cpOutL = DAG.getCopyFromReg(Result.getValue(0), dl,
20279 Regs64bit ? X86::RAX : X86::EAX,
20280 HalfT, Result.getValue(1));
20281 SDValue cpOutH = DAG.getCopyFromReg(cpOutL.getValue(1), dl,
20282 Regs64bit ? X86::RDX : X86::EDX,
20283 HalfT, cpOutL.getValue(2));
20284 SDValue OpsF[] = { cpOutL.getValue(0), cpOutH.getValue(0)};
20286 SDValue EFLAGS = DAG.getCopyFromReg(cpOutH.getValue(1), dl, X86::EFLAGS,
20287 MVT::i32, cpOutH.getValue(2));
20289 DAG.getNode(X86ISD::SETCC, dl, MVT::i8,
20290 DAG.getConstant(X86::COND_E, dl, MVT::i8), EFLAGS);
20291 Success = DAG.getZExtOrTrunc(Success, dl, N->getValueType(1));
20293 Results.push_back(DAG.getNode(ISD::BUILD_PAIR, dl, T, OpsF));
20294 Results.push_back(Success);
20295 Results.push_back(EFLAGS.getValue(1));
20298 case ISD::ATOMIC_SWAP:
20299 case ISD::ATOMIC_LOAD_ADD:
20300 case ISD::ATOMIC_LOAD_SUB:
20301 case ISD::ATOMIC_LOAD_AND:
20302 case ISD::ATOMIC_LOAD_OR:
20303 case ISD::ATOMIC_LOAD_XOR:
20304 case ISD::ATOMIC_LOAD_NAND:
20305 case ISD::ATOMIC_LOAD_MIN:
20306 case ISD::ATOMIC_LOAD_MAX:
20307 case ISD::ATOMIC_LOAD_UMIN:
20308 case ISD::ATOMIC_LOAD_UMAX:
20309 case ISD::ATOMIC_LOAD: {
20310 // Delegate to generic TypeLegalization. Situations we can really handle
20311 // should have already been dealt with by AtomicExpandPass.cpp.
20314 case ISD::BITCAST: {
20315 assert(Subtarget->hasSSE2() && "Requires at least SSE2!");
20316 EVT DstVT = N->getValueType(0);
20317 EVT SrcVT = N->getOperand(0)->getValueType(0);
20319 if (SrcVT != MVT::f64 ||
20320 (DstVT != MVT::v2i32 && DstVT != MVT::v4i16 && DstVT != MVT::v8i8))
20323 unsigned NumElts = DstVT.getVectorNumElements();
20324 EVT SVT = DstVT.getVectorElementType();
20325 EVT WiderVT = EVT::getVectorVT(*DAG.getContext(), SVT, NumElts * 2);
20326 SDValue Expanded = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl,
20327 MVT::v2f64, N->getOperand(0));
20328 SDValue ToVecInt = DAG.getBitcast(WiderVT, Expanded);
20330 if (ExperimentalVectorWideningLegalization) {
20331 // If we are legalizing vectors by widening, we already have the desired
20332 // legal vector type, just return it.
20333 Results.push_back(ToVecInt);
20337 SmallVector<SDValue, 8> Elts;
20338 for (unsigned i = 0, e = NumElts; i != e; ++i)
20339 Elts.push_back(DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, SVT,
20340 ToVecInt, DAG.getIntPtrConstant(i, dl)));
20342 Results.push_back(DAG.getNode(ISD::BUILD_VECTOR, dl, DstVT, Elts));
20347 const char *X86TargetLowering::getTargetNodeName(unsigned Opcode) const {
20348 switch ((X86ISD::NodeType)Opcode) {
20349 case X86ISD::FIRST_NUMBER: break;
20350 case X86ISD::BSF: return "X86ISD::BSF";
20351 case X86ISD::BSR: return "X86ISD::BSR";
20352 case X86ISD::SHLD: return "X86ISD::SHLD";
20353 case X86ISD::SHRD: return "X86ISD::SHRD";
20354 case X86ISD::FAND: return "X86ISD::FAND";
20355 case X86ISD::FANDN: return "X86ISD::FANDN";
20356 case X86ISD::FOR: return "X86ISD::FOR";
20357 case X86ISD::FXOR: return "X86ISD::FXOR";
20358 case X86ISD::FILD: return "X86ISD::FILD";
20359 case X86ISD::FILD_FLAG: return "X86ISD::FILD_FLAG";
20360 case X86ISD::FP_TO_INT16_IN_MEM: return "X86ISD::FP_TO_INT16_IN_MEM";
20361 case X86ISD::FP_TO_INT32_IN_MEM: return "X86ISD::FP_TO_INT32_IN_MEM";
20362 case X86ISD::FP_TO_INT64_IN_MEM: return "X86ISD::FP_TO_INT64_IN_MEM";
20363 case X86ISD::FLD: return "X86ISD::FLD";
20364 case X86ISD::FST: return "X86ISD::FST";
20365 case X86ISD::CALL: return "X86ISD::CALL";
20366 case X86ISD::RDTSC_DAG: return "X86ISD::RDTSC_DAG";
20367 case X86ISD::RDTSCP_DAG: return "X86ISD::RDTSCP_DAG";
20368 case X86ISD::RDPMC_DAG: return "X86ISD::RDPMC_DAG";
20369 case X86ISD::BT: return "X86ISD::BT";
20370 case X86ISD::CMP: return "X86ISD::CMP";
20371 case X86ISD::COMI: return "X86ISD::COMI";
20372 case X86ISD::UCOMI: return "X86ISD::UCOMI";
20373 case X86ISD::CMPM: return "X86ISD::CMPM";
20374 case X86ISD::CMPMU: return "X86ISD::CMPMU";
20375 case X86ISD::CMPM_RND: return "X86ISD::CMPM_RND";
20376 case X86ISD::SETCC: return "X86ISD::SETCC";
20377 case X86ISD::SETCC_CARRY: return "X86ISD::SETCC_CARRY";
20378 case X86ISD::FSETCC: return "X86ISD::FSETCC";
20379 case X86ISD::FGETSIGNx86: return "X86ISD::FGETSIGNx86";
20380 case X86ISD::CMOV: return "X86ISD::CMOV";
20381 case X86ISD::BRCOND: return "X86ISD::BRCOND";
20382 case X86ISD::RET_FLAG: return "X86ISD::RET_FLAG";
20383 case X86ISD::REP_STOS: return "X86ISD::REP_STOS";
20384 case X86ISD::REP_MOVS: return "X86ISD::REP_MOVS";
20385 case X86ISD::GlobalBaseReg: return "X86ISD::GlobalBaseReg";
20386 case X86ISD::Wrapper: return "X86ISD::Wrapper";
20387 case X86ISD::WrapperRIP: return "X86ISD::WrapperRIP";
20388 case X86ISD::MOVDQ2Q: return "X86ISD::MOVDQ2Q";
20389 case X86ISD::MMX_MOVD2W: return "X86ISD::MMX_MOVD2W";
20390 case X86ISD::MMX_MOVW2D: return "X86ISD::MMX_MOVW2D";
20391 case X86ISD::PEXTRB: return "X86ISD::PEXTRB";
20392 case X86ISD::PEXTRW: return "X86ISD::PEXTRW";
20393 case X86ISD::INSERTPS: return "X86ISD::INSERTPS";
20394 case X86ISD::PINSRB: return "X86ISD::PINSRB";
20395 case X86ISD::PINSRW: return "X86ISD::PINSRW";
20396 case X86ISD::MMX_PINSRW: return "X86ISD::MMX_PINSRW";
20397 case X86ISD::PSHUFB: return "X86ISD::PSHUFB";
20398 case X86ISD::ANDNP: return "X86ISD::ANDNP";
20399 case X86ISD::PSIGN: return "X86ISD::PSIGN";
20400 case X86ISD::BLENDI: return "X86ISD::BLENDI";
20401 case X86ISD::SHRUNKBLEND: return "X86ISD::SHRUNKBLEND";
20402 case X86ISD::ADDUS: return "X86ISD::ADDUS";
20403 case X86ISD::SUBUS: return "X86ISD::SUBUS";
20404 case X86ISD::HADD: return "X86ISD::HADD";
20405 case X86ISD::HSUB: return "X86ISD::HSUB";
20406 case X86ISD::FHADD: return "X86ISD::FHADD";
20407 case X86ISD::FHSUB: return "X86ISD::FHSUB";
20408 case X86ISD::ABS: return "X86ISD::ABS";
20409 case X86ISD::CONFLICT: return "X86ISD::CONFLICT";
20410 case X86ISD::FMAX: return "X86ISD::FMAX";
20411 case X86ISD::FMAX_RND: return "X86ISD::FMAX_RND";
20412 case X86ISD::FMIN: return "X86ISD::FMIN";
20413 case X86ISD::FMIN_RND: return "X86ISD::FMIN_RND";
20414 case X86ISD::FMAXC: return "X86ISD::FMAXC";
20415 case X86ISD::FMINC: return "X86ISD::FMINC";
20416 case X86ISD::FRSQRT: return "X86ISD::FRSQRT";
20417 case X86ISD::FRCP: return "X86ISD::FRCP";
20418 case X86ISD::EXTRQI: return "X86ISD::EXTRQI";
20419 case X86ISD::INSERTQI: return "X86ISD::INSERTQI";
20420 case X86ISD::TLSADDR: return "X86ISD::TLSADDR";
20421 case X86ISD::TLSBASEADDR: return "X86ISD::TLSBASEADDR";
20422 case X86ISD::TLSCALL: return "X86ISD::TLSCALL";
20423 case X86ISD::EH_SJLJ_SETJMP: return "X86ISD::EH_SJLJ_SETJMP";
20424 case X86ISD::EH_SJLJ_LONGJMP: return "X86ISD::EH_SJLJ_LONGJMP";
20425 case X86ISD::EH_RETURN: return "X86ISD::EH_RETURN";
20426 case X86ISD::TC_RETURN: return "X86ISD::TC_RETURN";
20427 case X86ISD::FNSTCW16m: return "X86ISD::FNSTCW16m";
20428 case X86ISD::FNSTSW16r: return "X86ISD::FNSTSW16r";
20429 case X86ISD::LCMPXCHG_DAG: return "X86ISD::LCMPXCHG_DAG";
20430 case X86ISD::LCMPXCHG8_DAG: return "X86ISD::LCMPXCHG8_DAG";
20431 case X86ISD::LCMPXCHG16_DAG: return "X86ISD::LCMPXCHG16_DAG";
20432 case X86ISD::VZEXT_MOVL: return "X86ISD::VZEXT_MOVL";
20433 case X86ISD::VZEXT_LOAD: return "X86ISD::VZEXT_LOAD";
20434 case X86ISD::VZEXT: return "X86ISD::VZEXT";
20435 case X86ISD::VSEXT: return "X86ISD::VSEXT";
20436 case X86ISD::VTRUNC: return "X86ISD::VTRUNC";
20437 case X86ISD::VTRUNCS: return "X86ISD::VTRUNCS";
20438 case X86ISD::VTRUNCUS: return "X86ISD::VTRUNCUS";
20439 case X86ISD::VINSERT: return "X86ISD::VINSERT";
20440 case X86ISD::VFPEXT: return "X86ISD::VFPEXT";
20441 case X86ISD::VFPROUND: return "X86ISD::VFPROUND";
20442 case X86ISD::CVTDQ2PD: return "X86ISD::CVTDQ2PD";
20443 case X86ISD::CVTUDQ2PD: return "X86ISD::CVTUDQ2PD";
20444 case X86ISD::VSHLDQ: return "X86ISD::VSHLDQ";
20445 case X86ISD::VSRLDQ: return "X86ISD::VSRLDQ";
20446 case X86ISD::VSHL: return "X86ISD::VSHL";
20447 case X86ISD::VSRL: return "X86ISD::VSRL";
20448 case X86ISD::VSRA: return "X86ISD::VSRA";
20449 case X86ISD::VSHLI: return "X86ISD::VSHLI";
20450 case X86ISD::VSRLI: return "X86ISD::VSRLI";
20451 case X86ISD::VSRAI: return "X86ISD::VSRAI";
20452 case X86ISD::CMPP: return "X86ISD::CMPP";
20453 case X86ISD::PCMPEQ: return "X86ISD::PCMPEQ";
20454 case X86ISD::PCMPGT: return "X86ISD::PCMPGT";
20455 case X86ISD::PCMPEQM: return "X86ISD::PCMPEQM";
20456 case X86ISD::PCMPGTM: return "X86ISD::PCMPGTM";
20457 case X86ISD::ADD: return "X86ISD::ADD";
20458 case X86ISD::SUB: return "X86ISD::SUB";
20459 case X86ISD::ADC: return "X86ISD::ADC";
20460 case X86ISD::SBB: return "X86ISD::SBB";
20461 case X86ISD::SMUL: return "X86ISD::SMUL";
20462 case X86ISD::UMUL: return "X86ISD::UMUL";
20463 case X86ISD::SMUL8: return "X86ISD::SMUL8";
20464 case X86ISD::UMUL8: return "X86ISD::UMUL8";
20465 case X86ISD::SDIVREM8_SEXT_HREG: return "X86ISD::SDIVREM8_SEXT_HREG";
20466 case X86ISD::UDIVREM8_ZEXT_HREG: return "X86ISD::UDIVREM8_ZEXT_HREG";
20467 case X86ISD::INC: return "X86ISD::INC";
20468 case X86ISD::DEC: return "X86ISD::DEC";
20469 case X86ISD::OR: return "X86ISD::OR";
20470 case X86ISD::XOR: return "X86ISD::XOR";
20471 case X86ISD::AND: return "X86ISD::AND";
20472 case X86ISD::BEXTR: return "X86ISD::BEXTR";
20473 case X86ISD::MUL_IMM: return "X86ISD::MUL_IMM";
20474 case X86ISD::PTEST: return "X86ISD::PTEST";
20475 case X86ISD::TESTP: return "X86ISD::TESTP";
20476 case X86ISD::TESTM: return "X86ISD::TESTM";
20477 case X86ISD::TESTNM: return "X86ISD::TESTNM";
20478 case X86ISD::KORTEST: return "X86ISD::KORTEST";
20479 case X86ISD::KTEST: return "X86ISD::KTEST";
20480 case X86ISD::PACKSS: return "X86ISD::PACKSS";
20481 case X86ISD::PACKUS: return "X86ISD::PACKUS";
20482 case X86ISD::PALIGNR: return "X86ISD::PALIGNR";
20483 case X86ISD::VALIGN: return "X86ISD::VALIGN";
20484 case X86ISD::PSHUFD: return "X86ISD::PSHUFD";
20485 case X86ISD::PSHUFHW: return "X86ISD::PSHUFHW";
20486 case X86ISD::PSHUFLW: return "X86ISD::PSHUFLW";
20487 case X86ISD::SHUFP: return "X86ISD::SHUFP";
20488 case X86ISD::SHUF128: return "X86ISD::SHUF128";
20489 case X86ISD::MOVLHPS: return "X86ISD::MOVLHPS";
20490 case X86ISD::MOVLHPD: return "X86ISD::MOVLHPD";
20491 case X86ISD::MOVHLPS: return "X86ISD::MOVHLPS";
20492 case X86ISD::MOVLPS: return "X86ISD::MOVLPS";
20493 case X86ISD::MOVLPD: return "X86ISD::MOVLPD";
20494 case X86ISD::MOVDDUP: return "X86ISD::MOVDDUP";
20495 case X86ISD::MOVSHDUP: return "X86ISD::MOVSHDUP";
20496 case X86ISD::MOVSLDUP: return "X86ISD::MOVSLDUP";
20497 case X86ISD::MOVSD: return "X86ISD::MOVSD";
20498 case X86ISD::MOVSS: return "X86ISD::MOVSS";
20499 case X86ISD::UNPCKL: return "X86ISD::UNPCKL";
20500 case X86ISD::UNPCKH: return "X86ISD::UNPCKH";
20501 case X86ISD::VBROADCAST: return "X86ISD::VBROADCAST";
20502 case X86ISD::VBROADCASTM: return "X86ISD::VBROADCASTM";
20503 case X86ISD::SUBV_BROADCAST: return "X86ISD::SUBV_BROADCAST";
20504 case X86ISD::VEXTRACT: return "X86ISD::VEXTRACT";
20505 case X86ISD::VPERMILPV: return "X86ISD::VPERMILPV";
20506 case X86ISD::VPERMILPI: return "X86ISD::VPERMILPI";
20507 case X86ISD::VPERM2X128: return "X86ISD::VPERM2X128";
20508 case X86ISD::VPERMV: return "X86ISD::VPERMV";
20509 case X86ISD::VPERMV3: return "X86ISD::VPERMV3";
20510 case X86ISD::VPERMIV3: return "X86ISD::VPERMIV3";
20511 case X86ISD::VPERMI: return "X86ISD::VPERMI";
20512 case X86ISD::VPTERNLOG: return "X86ISD::VPTERNLOG";
20513 case X86ISD::VFIXUPIMM: return "X86ISD::VFIXUPIMM";
20514 case X86ISD::VRANGE: return "X86ISD::VRANGE";
20515 case X86ISD::PMULUDQ: return "X86ISD::PMULUDQ";
20516 case X86ISD::PMULDQ: return "X86ISD::PMULDQ";
20517 case X86ISD::PSADBW: return "X86ISD::PSADBW";
20518 case X86ISD::DBPSADBW: return "X86ISD::DBPSADBW";
20519 case X86ISD::VASTART_SAVE_XMM_REGS: return "X86ISD::VASTART_SAVE_XMM_REGS";
20520 case X86ISD::VAARG_64: return "X86ISD::VAARG_64";
20521 case X86ISD::WIN_ALLOCA: return "X86ISD::WIN_ALLOCA";
20522 case X86ISD::MEMBARRIER: return "X86ISD::MEMBARRIER";
20523 case X86ISD::MFENCE: return "X86ISD::MFENCE";
20524 case X86ISD::SFENCE: return "X86ISD::SFENCE";
20525 case X86ISD::LFENCE: return "X86ISD::LFENCE";
20526 case X86ISD::SEG_ALLOCA: return "X86ISD::SEG_ALLOCA";
20527 case X86ISD::SAHF: return "X86ISD::SAHF";
20528 case X86ISD::RDRAND: return "X86ISD::RDRAND";
20529 case X86ISD::RDSEED: return "X86ISD::RDSEED";
20530 case X86ISD::VPMADDUBSW: return "X86ISD::VPMADDUBSW";
20531 case X86ISD::VPMADDWD: return "X86ISD::VPMADDWD";
20532 case X86ISD::VPROT: return "X86ISD::VPROT";
20533 case X86ISD::VPROTI: return "X86ISD::VPROTI";
20534 case X86ISD::VPSHA: return "X86ISD::VPSHA";
20535 case X86ISD::VPSHL: return "X86ISD::VPSHL";
20536 case X86ISD::VPCOM: return "X86ISD::VPCOM";
20537 case X86ISD::VPCOMU: return "X86ISD::VPCOMU";
20538 case X86ISD::FMADD: return "X86ISD::FMADD";
20539 case X86ISD::FMSUB: return "X86ISD::FMSUB";
20540 case X86ISD::FNMADD: return "X86ISD::FNMADD";
20541 case X86ISD::FNMSUB: return "X86ISD::FNMSUB";
20542 case X86ISD::FMADDSUB: return "X86ISD::FMADDSUB";
20543 case X86ISD::FMSUBADD: return "X86ISD::FMSUBADD";
20544 case X86ISD::FMADD_RND: return "X86ISD::FMADD_RND";
20545 case X86ISD::FNMADD_RND: return "X86ISD::FNMADD_RND";
20546 case X86ISD::FMSUB_RND: return "X86ISD::FMSUB_RND";
20547 case X86ISD::FNMSUB_RND: return "X86ISD::FNMSUB_RND";
20548 case X86ISD::FMADDSUB_RND: return "X86ISD::FMADDSUB_RND";
20549 case X86ISD::FMSUBADD_RND: return "X86ISD::FMSUBADD_RND";
20550 case X86ISD::VRNDSCALE: return "X86ISD::VRNDSCALE";
20551 case X86ISD::VREDUCE: return "X86ISD::VREDUCE";
20552 case X86ISD::VGETMANT: return "X86ISD::VGETMANT";
20553 case X86ISD::PCMPESTRI: return "X86ISD::PCMPESTRI";
20554 case X86ISD::PCMPISTRI: return "X86ISD::PCMPISTRI";
20555 case X86ISD::XTEST: return "X86ISD::XTEST";
20556 case X86ISD::COMPRESS: return "X86ISD::COMPRESS";
20557 case X86ISD::EXPAND: return "X86ISD::EXPAND";
20558 case X86ISD::SELECT: return "X86ISD::SELECT";
20559 case X86ISD::ADDSUB: return "X86ISD::ADDSUB";
20560 case X86ISD::RCP28: return "X86ISD::RCP28";
20561 case X86ISD::EXP2: return "X86ISD::EXP2";
20562 case X86ISD::RSQRT28: return "X86ISD::RSQRT28";
20563 case X86ISD::FADD_RND: return "X86ISD::FADD_RND";
20564 case X86ISD::FSUB_RND: return "X86ISD::FSUB_RND";
20565 case X86ISD::FMUL_RND: return "X86ISD::FMUL_RND";
20566 case X86ISD::FDIV_RND: return "X86ISD::FDIV_RND";
20567 case X86ISD::FSQRT_RND: return "X86ISD::FSQRT_RND";
20568 case X86ISD::FGETEXP_RND: return "X86ISD::FGETEXP_RND";
20569 case X86ISD::SCALEF: return "X86ISD::SCALEF";
20570 case X86ISD::ADDS: return "X86ISD::ADDS";
20571 case X86ISD::SUBS: return "X86ISD::SUBS";
20572 case X86ISD::AVG: return "X86ISD::AVG";
20573 case X86ISD::MULHRS: return "X86ISD::MULHRS";
20574 case X86ISD::SINT_TO_FP_RND: return "X86ISD::SINT_TO_FP_RND";
20575 case X86ISD::UINT_TO_FP_RND: return "X86ISD::UINT_TO_FP_RND";
20576 case X86ISD::FP_TO_SINT_RND: return "X86ISD::FP_TO_SINT_RND";
20577 case X86ISD::FP_TO_UINT_RND: return "X86ISD::FP_TO_UINT_RND";
20578 case X86ISD::VFPCLASS: return "X86ISD::VFPCLASS";
20579 case X86ISD::VFPCLASSS: return "X86ISD::VFPCLASSS";
20584 // isLegalAddressingMode - Return true if the addressing mode represented
20585 // by AM is legal for this target, for a load/store of the specified type.
20586 bool X86TargetLowering::isLegalAddressingMode(const DataLayout &DL,
20587 const AddrMode &AM, Type *Ty,
20588 unsigned AS) const {
20589 // X86 supports extremely general addressing modes.
20590 CodeModel::Model M = getTargetMachine().getCodeModel();
20591 Reloc::Model R = getTargetMachine().getRelocationModel();
20593 // X86 allows a sign-extended 32-bit immediate field as a displacement.
20594 if (!X86::isOffsetSuitableForCodeModel(AM.BaseOffs, M, AM.BaseGV != nullptr))
20599 Subtarget->ClassifyGlobalReference(AM.BaseGV, getTargetMachine());
20601 // If a reference to this global requires an extra load, we can't fold it.
20602 if (isGlobalStubReference(GVFlags))
20605 // If BaseGV requires a register for the PIC base, we cannot also have a
20606 // BaseReg specified.
20607 if (AM.HasBaseReg && isGlobalRelativeToPICBase(GVFlags))
20610 // If lower 4G is not available, then we must use rip-relative addressing.
20611 if ((M != CodeModel::Small || R != Reloc::Static) &&
20612 Subtarget->is64Bit() && (AM.BaseOffs || AM.Scale > 1))
20616 switch (AM.Scale) {
20622 // These scales always work.
20627 // These scales are formed with basereg+scalereg. Only accept if there is
20632 default: // Other stuff never works.
20639 bool X86TargetLowering::isVectorShiftByScalarCheap(Type *Ty) const {
20640 unsigned Bits = Ty->getScalarSizeInBits();
20642 // 8-bit shifts are always expensive, but versions with a scalar amount aren't
20643 // particularly cheaper than those without.
20647 // On AVX2 there are new vpsllv[dq] instructions (and other shifts), that make
20648 // variable shifts just as cheap as scalar ones.
20649 if (Subtarget->hasInt256() && (Bits == 32 || Bits == 64))
20652 // Otherwise, it's significantly cheaper to shift by a scalar amount than by a
20653 // fully general vector.
20657 bool X86TargetLowering::isTruncateFree(Type *Ty1, Type *Ty2) const {
20658 if (!Ty1->isIntegerTy() || !Ty2->isIntegerTy())
20660 unsigned NumBits1 = Ty1->getPrimitiveSizeInBits();
20661 unsigned NumBits2 = Ty2->getPrimitiveSizeInBits();
20662 return NumBits1 > NumBits2;
20665 bool X86TargetLowering::allowTruncateForTailCall(Type *Ty1, Type *Ty2) const {
20666 if (!Ty1->isIntegerTy() || !Ty2->isIntegerTy())
20669 if (!isTypeLegal(EVT::getEVT(Ty1)))
20672 assert(Ty1->getPrimitiveSizeInBits() <= 64 && "i128 is probably not a noop");
20674 // Assuming the caller doesn't have a zeroext or signext return parameter,
20675 // truncation all the way down to i1 is valid.
20679 bool X86TargetLowering::isLegalICmpImmediate(int64_t Imm) const {
20680 return isInt<32>(Imm);
20683 bool X86TargetLowering::isLegalAddImmediate(int64_t Imm) const {
20684 // Can also use sub to handle negated immediates.
20685 return isInt<32>(Imm);
20688 bool X86TargetLowering::isTruncateFree(EVT VT1, EVT VT2) const {
20689 if (!VT1.isInteger() || !VT2.isInteger())
20691 unsigned NumBits1 = VT1.getSizeInBits();
20692 unsigned NumBits2 = VT2.getSizeInBits();
20693 return NumBits1 > NumBits2;
20696 bool X86TargetLowering::isZExtFree(Type *Ty1, Type *Ty2) const {
20697 // x86-64 implicitly zero-extends 32-bit results in 64-bit registers.
20698 return Ty1->isIntegerTy(32) && Ty2->isIntegerTy(64) && Subtarget->is64Bit();
20701 bool X86TargetLowering::isZExtFree(EVT VT1, EVT VT2) const {
20702 // x86-64 implicitly zero-extends 32-bit results in 64-bit registers.
20703 return VT1 == MVT::i32 && VT2 == MVT::i64 && Subtarget->is64Bit();
20706 bool X86TargetLowering::isZExtFree(SDValue Val, EVT VT2) const {
20707 EVT VT1 = Val.getValueType();
20708 if (isZExtFree(VT1, VT2))
20711 if (Val.getOpcode() != ISD::LOAD)
20714 if (!VT1.isSimple() || !VT1.isInteger() ||
20715 !VT2.isSimple() || !VT2.isInteger())
20718 switch (VT1.getSimpleVT().SimpleTy) {
20723 // X86 has 8, 16, and 32-bit zero-extending loads.
20730 bool X86TargetLowering::isVectorLoadExtDesirable(SDValue) const { return true; }
20733 X86TargetLowering::isFMAFasterThanFMulAndFAdd(EVT VT) const {
20734 if (!Subtarget->hasAnyFMA())
20737 VT = VT.getScalarType();
20739 if (!VT.isSimple())
20742 switch (VT.getSimpleVT().SimpleTy) {
20753 bool X86TargetLowering::isNarrowingProfitable(EVT VT1, EVT VT2) const {
20754 // i16 instructions are longer (0x66 prefix) and potentially slower.
20755 return !(VT1 == MVT::i32 && VT2 == MVT::i16);
20758 /// isShuffleMaskLegal - Targets can use this to indicate that they only
20759 /// support *some* VECTOR_SHUFFLE operations, those with specific masks.
20760 /// By default, if a target supports the VECTOR_SHUFFLE node, all mask values
20761 /// are assumed to be legal.
20763 X86TargetLowering::isShuffleMaskLegal(const SmallVectorImpl<int> &M,
20765 if (!VT.isSimple())
20768 // Not for i1 vectors
20769 if (VT.getSimpleVT().getScalarType() == MVT::i1)
20772 // Very little shuffling can be done for 64-bit vectors right now.
20773 if (VT.getSimpleVT().getSizeInBits() == 64)
20776 // We only care that the types being shuffled are legal. The lowering can
20777 // handle any possible shuffle mask that results.
20778 return isTypeLegal(VT.getSimpleVT());
20782 X86TargetLowering::isVectorClearMaskLegal(const SmallVectorImpl<int> &Mask,
20784 // Just delegate to the generic legality, clear masks aren't special.
20785 return isShuffleMaskLegal(Mask, VT);
20788 //===----------------------------------------------------------------------===//
20789 // X86 Scheduler Hooks
20790 //===----------------------------------------------------------------------===//
20792 /// Utility function to emit xbegin specifying the start of an RTM region.
20793 static MachineBasicBlock *EmitXBegin(MachineInstr *MI, MachineBasicBlock *MBB,
20794 const TargetInstrInfo *TII) {
20795 DebugLoc DL = MI->getDebugLoc();
20797 const BasicBlock *BB = MBB->getBasicBlock();
20798 MachineFunction::iterator I = ++MBB->getIterator();
20800 // For the v = xbegin(), we generate
20811 MachineBasicBlock *thisMBB = MBB;
20812 MachineFunction *MF = MBB->getParent();
20813 MachineBasicBlock *mainMBB = MF->CreateMachineBasicBlock(BB);
20814 MachineBasicBlock *sinkMBB = MF->CreateMachineBasicBlock(BB);
20815 MF->insert(I, mainMBB);
20816 MF->insert(I, sinkMBB);
20818 // Transfer the remainder of BB and its successor edges to sinkMBB.
20819 sinkMBB->splice(sinkMBB->begin(), MBB,
20820 std::next(MachineBasicBlock::iterator(MI)), MBB->end());
20821 sinkMBB->transferSuccessorsAndUpdatePHIs(MBB);
20825 // # fallthrough to mainMBB
20826 // # abortion to sinkMBB
20827 BuildMI(thisMBB, DL, TII->get(X86::XBEGIN_4)).addMBB(sinkMBB);
20828 thisMBB->addSuccessor(mainMBB);
20829 thisMBB->addSuccessor(sinkMBB);
20833 BuildMI(mainMBB, DL, TII->get(X86::MOV32ri), X86::EAX).addImm(-1);
20834 mainMBB->addSuccessor(sinkMBB);
20837 // EAX is live into the sinkMBB
20838 sinkMBB->addLiveIn(X86::EAX);
20839 BuildMI(*sinkMBB, sinkMBB->begin(), DL,
20840 TII->get(TargetOpcode::COPY), MI->getOperand(0).getReg())
20843 MI->eraseFromParent();
20847 // FIXME: When we get size specific XMM0 registers, i.e. XMM0_V16I8
20848 // or XMM0_V32I8 in AVX all of this code can be replaced with that
20849 // in the .td file.
20850 static MachineBasicBlock *EmitPCMPSTRM(MachineInstr *MI, MachineBasicBlock *BB,
20851 const TargetInstrInfo *TII) {
20853 switch (MI->getOpcode()) {
20854 default: llvm_unreachable("illegal opcode!");
20855 case X86::PCMPISTRM128REG: Opc = X86::PCMPISTRM128rr; break;
20856 case X86::VPCMPISTRM128REG: Opc = X86::VPCMPISTRM128rr; break;
20857 case X86::PCMPISTRM128MEM: Opc = X86::PCMPISTRM128rm; break;
20858 case X86::VPCMPISTRM128MEM: Opc = X86::VPCMPISTRM128rm; break;
20859 case X86::PCMPESTRM128REG: Opc = X86::PCMPESTRM128rr; break;
20860 case X86::VPCMPESTRM128REG: Opc = X86::VPCMPESTRM128rr; break;
20861 case X86::PCMPESTRM128MEM: Opc = X86::PCMPESTRM128rm; break;
20862 case X86::VPCMPESTRM128MEM: Opc = X86::VPCMPESTRM128rm; break;
20865 DebugLoc dl = MI->getDebugLoc();
20866 MachineInstrBuilder MIB = BuildMI(*BB, MI, dl, TII->get(Opc));
20868 unsigned NumArgs = MI->getNumOperands();
20869 for (unsigned i = 1; i < NumArgs; ++i) {
20870 MachineOperand &Op = MI->getOperand(i);
20871 if (!(Op.isReg() && Op.isImplicit()))
20872 MIB.addOperand(Op);
20874 if (MI->hasOneMemOperand())
20875 MIB->setMemRefs(MI->memoperands_begin(), MI->memoperands_end());
20877 BuildMI(*BB, MI, dl,
20878 TII->get(TargetOpcode::COPY), MI->getOperand(0).getReg())
20879 .addReg(X86::XMM0);
20881 MI->eraseFromParent();
20885 // FIXME: Custom handling because TableGen doesn't support multiple implicit
20886 // defs in an instruction pattern
20887 static MachineBasicBlock *EmitPCMPSTRI(MachineInstr *MI, MachineBasicBlock *BB,
20888 const TargetInstrInfo *TII) {
20890 switch (MI->getOpcode()) {
20891 default: llvm_unreachable("illegal opcode!");
20892 case X86::PCMPISTRIREG: Opc = X86::PCMPISTRIrr; break;
20893 case X86::VPCMPISTRIREG: Opc = X86::VPCMPISTRIrr; break;
20894 case X86::PCMPISTRIMEM: Opc = X86::PCMPISTRIrm; break;
20895 case X86::VPCMPISTRIMEM: Opc = X86::VPCMPISTRIrm; break;
20896 case X86::PCMPESTRIREG: Opc = X86::PCMPESTRIrr; break;
20897 case X86::VPCMPESTRIREG: Opc = X86::VPCMPESTRIrr; break;
20898 case X86::PCMPESTRIMEM: Opc = X86::PCMPESTRIrm; break;
20899 case X86::VPCMPESTRIMEM: Opc = X86::VPCMPESTRIrm; break;
20902 DebugLoc dl = MI->getDebugLoc();
20903 MachineInstrBuilder MIB = BuildMI(*BB, MI, dl, TII->get(Opc));
20905 unsigned NumArgs = MI->getNumOperands(); // remove the results
20906 for (unsigned i = 1; i < NumArgs; ++i) {
20907 MachineOperand &Op = MI->getOperand(i);
20908 if (!(Op.isReg() && Op.isImplicit()))
20909 MIB.addOperand(Op);
20911 if (MI->hasOneMemOperand())
20912 MIB->setMemRefs(MI->memoperands_begin(), MI->memoperands_end());
20914 BuildMI(*BB, MI, dl,
20915 TII->get(TargetOpcode::COPY), MI->getOperand(0).getReg())
20918 MI->eraseFromParent();
20922 static MachineBasicBlock *EmitMonitor(MachineInstr *MI, MachineBasicBlock *BB,
20923 const X86Subtarget *Subtarget) {
20924 DebugLoc dl = MI->getDebugLoc();
20925 const TargetInstrInfo *TII = Subtarget->getInstrInfo();
20926 // Address into RAX/EAX, other two args into ECX, EDX.
20927 unsigned MemOpc = Subtarget->is64Bit() ? X86::LEA64r : X86::LEA32r;
20928 unsigned MemReg = Subtarget->is64Bit() ? X86::RAX : X86::EAX;
20929 MachineInstrBuilder MIB = BuildMI(*BB, MI, dl, TII->get(MemOpc), MemReg);
20930 for (int i = 0; i < X86::AddrNumOperands; ++i)
20931 MIB.addOperand(MI->getOperand(i));
20933 unsigned ValOps = X86::AddrNumOperands;
20934 BuildMI(*BB, MI, dl, TII->get(TargetOpcode::COPY), X86::ECX)
20935 .addReg(MI->getOperand(ValOps).getReg());
20936 BuildMI(*BB, MI, dl, TII->get(TargetOpcode::COPY), X86::EDX)
20937 .addReg(MI->getOperand(ValOps+1).getReg());
20939 // The instruction doesn't actually take any operands though.
20940 BuildMI(*BB, MI, dl, TII->get(X86::MONITORrrr));
20942 MI->eraseFromParent(); // The pseudo is gone now.
20946 MachineBasicBlock *
20947 X86TargetLowering::EmitVAARG64WithCustomInserter(MachineInstr *MI,
20948 MachineBasicBlock *MBB) const {
20949 // Emit va_arg instruction on X86-64.
20951 // Operands to this pseudo-instruction:
20952 // 0 ) Output : destination address (reg)
20953 // 1-5) Input : va_list address (addr, i64mem)
20954 // 6 ) ArgSize : Size (in bytes) of vararg type
20955 // 7 ) ArgMode : 0=overflow only, 1=use gp_offset, 2=use fp_offset
20956 // 8 ) Align : Alignment of type
20957 // 9 ) EFLAGS (implicit-def)
20959 assert(MI->getNumOperands() == 10 && "VAARG_64 should have 10 operands!");
20960 static_assert(X86::AddrNumOperands == 5,
20961 "VAARG_64 assumes 5 address operands");
20963 unsigned DestReg = MI->getOperand(0).getReg();
20964 MachineOperand &Base = MI->getOperand(1);
20965 MachineOperand &Scale = MI->getOperand(2);
20966 MachineOperand &Index = MI->getOperand(3);
20967 MachineOperand &Disp = MI->getOperand(4);
20968 MachineOperand &Segment = MI->getOperand(5);
20969 unsigned ArgSize = MI->getOperand(6).getImm();
20970 unsigned ArgMode = MI->getOperand(7).getImm();
20971 unsigned Align = MI->getOperand(8).getImm();
20973 // Memory Reference
20974 assert(MI->hasOneMemOperand() && "Expected VAARG_64 to have one memoperand");
20975 MachineInstr::mmo_iterator MMOBegin = MI->memoperands_begin();
20976 MachineInstr::mmo_iterator MMOEnd = MI->memoperands_end();
20978 // Machine Information
20979 const TargetInstrInfo *TII = Subtarget->getInstrInfo();
20980 MachineRegisterInfo &MRI = MBB->getParent()->getRegInfo();
20981 const TargetRegisterClass *AddrRegClass = getRegClassFor(MVT::i64);
20982 const TargetRegisterClass *OffsetRegClass = getRegClassFor(MVT::i32);
20983 DebugLoc DL = MI->getDebugLoc();
20985 // struct va_list {
20988 // i64 overflow_area (address)
20989 // i64 reg_save_area (address)
20991 // sizeof(va_list) = 24
20992 // alignment(va_list) = 8
20994 unsigned TotalNumIntRegs = 6;
20995 unsigned TotalNumXMMRegs = 8;
20996 bool UseGPOffset = (ArgMode == 1);
20997 bool UseFPOffset = (ArgMode == 2);
20998 unsigned MaxOffset = TotalNumIntRegs * 8 +
20999 (UseFPOffset ? TotalNumXMMRegs * 16 : 0);
21001 /* Align ArgSize to a multiple of 8 */
21002 unsigned ArgSizeA8 = (ArgSize + 7) & ~7;
21003 bool NeedsAlign = (Align > 8);
21005 MachineBasicBlock *thisMBB = MBB;
21006 MachineBasicBlock *overflowMBB;
21007 MachineBasicBlock *offsetMBB;
21008 MachineBasicBlock *endMBB;
21010 unsigned OffsetDestReg = 0; // Argument address computed by offsetMBB
21011 unsigned OverflowDestReg = 0; // Argument address computed by overflowMBB
21012 unsigned OffsetReg = 0;
21014 if (!UseGPOffset && !UseFPOffset) {
21015 // If we only pull from the overflow region, we don't create a branch.
21016 // We don't need to alter control flow.
21017 OffsetDestReg = 0; // unused
21018 OverflowDestReg = DestReg;
21020 offsetMBB = nullptr;
21021 overflowMBB = thisMBB;
21024 // First emit code to check if gp_offset (or fp_offset) is below the bound.
21025 // If so, pull the argument from reg_save_area. (branch to offsetMBB)
21026 // If not, pull from overflow_area. (branch to overflowMBB)
21031 // offsetMBB overflowMBB
21036 // Registers for the PHI in endMBB
21037 OffsetDestReg = MRI.createVirtualRegister(AddrRegClass);
21038 OverflowDestReg = MRI.createVirtualRegister(AddrRegClass);
21040 const BasicBlock *LLVM_BB = MBB->getBasicBlock();
21041 MachineFunction *MF = MBB->getParent();
21042 overflowMBB = MF->CreateMachineBasicBlock(LLVM_BB);
21043 offsetMBB = MF->CreateMachineBasicBlock(LLVM_BB);
21044 endMBB = MF->CreateMachineBasicBlock(LLVM_BB);
21046 MachineFunction::iterator MBBIter = ++MBB->getIterator();
21048 // Insert the new basic blocks
21049 MF->insert(MBBIter, offsetMBB);
21050 MF->insert(MBBIter, overflowMBB);
21051 MF->insert(MBBIter, endMBB);
21053 // Transfer the remainder of MBB and its successor edges to endMBB.
21054 endMBB->splice(endMBB->begin(), thisMBB,
21055 std::next(MachineBasicBlock::iterator(MI)), thisMBB->end());
21056 endMBB->transferSuccessorsAndUpdatePHIs(thisMBB);
21058 // Make offsetMBB and overflowMBB successors of thisMBB
21059 thisMBB->addSuccessor(offsetMBB);
21060 thisMBB->addSuccessor(overflowMBB);
21062 // endMBB is a successor of both offsetMBB and overflowMBB
21063 offsetMBB->addSuccessor(endMBB);
21064 overflowMBB->addSuccessor(endMBB);
21066 // Load the offset value into a register
21067 OffsetReg = MRI.createVirtualRegister(OffsetRegClass);
21068 BuildMI(thisMBB, DL, TII->get(X86::MOV32rm), OffsetReg)
21072 .addDisp(Disp, UseFPOffset ? 4 : 0)
21073 .addOperand(Segment)
21074 .setMemRefs(MMOBegin, MMOEnd);
21076 // Check if there is enough room left to pull this argument.
21077 BuildMI(thisMBB, DL, TII->get(X86::CMP32ri))
21079 .addImm(MaxOffset + 8 - ArgSizeA8);
21081 // Branch to "overflowMBB" if offset >= max
21082 // Fall through to "offsetMBB" otherwise
21083 BuildMI(thisMBB, DL, TII->get(X86::GetCondBranchFromCond(X86::COND_AE)))
21084 .addMBB(overflowMBB);
21087 // In offsetMBB, emit code to use the reg_save_area.
21089 assert(OffsetReg != 0);
21091 // Read the reg_save_area address.
21092 unsigned RegSaveReg = MRI.createVirtualRegister(AddrRegClass);
21093 BuildMI(offsetMBB, DL, TII->get(X86::MOV64rm), RegSaveReg)
21098 .addOperand(Segment)
21099 .setMemRefs(MMOBegin, MMOEnd);
21101 // Zero-extend the offset
21102 unsigned OffsetReg64 = MRI.createVirtualRegister(AddrRegClass);
21103 BuildMI(offsetMBB, DL, TII->get(X86::SUBREG_TO_REG), OffsetReg64)
21106 .addImm(X86::sub_32bit);
21108 // Add the offset to the reg_save_area to get the final address.
21109 BuildMI(offsetMBB, DL, TII->get(X86::ADD64rr), OffsetDestReg)
21110 .addReg(OffsetReg64)
21111 .addReg(RegSaveReg);
21113 // Compute the offset for the next argument
21114 unsigned NextOffsetReg = MRI.createVirtualRegister(OffsetRegClass);
21115 BuildMI(offsetMBB, DL, TII->get(X86::ADD32ri), NextOffsetReg)
21117 .addImm(UseFPOffset ? 16 : 8);
21119 // Store it back into the va_list.
21120 BuildMI(offsetMBB, DL, TII->get(X86::MOV32mr))
21124 .addDisp(Disp, UseFPOffset ? 4 : 0)
21125 .addOperand(Segment)
21126 .addReg(NextOffsetReg)
21127 .setMemRefs(MMOBegin, MMOEnd);
21130 BuildMI(offsetMBB, DL, TII->get(X86::JMP_1))
21135 // Emit code to use overflow area
21138 // Load the overflow_area address into a register.
21139 unsigned OverflowAddrReg = MRI.createVirtualRegister(AddrRegClass);
21140 BuildMI(overflowMBB, DL, TII->get(X86::MOV64rm), OverflowAddrReg)
21145 .addOperand(Segment)
21146 .setMemRefs(MMOBegin, MMOEnd);
21148 // If we need to align it, do so. Otherwise, just copy the address
21149 // to OverflowDestReg.
21151 // Align the overflow address
21152 assert((Align & (Align-1)) == 0 && "Alignment must be a power of 2");
21153 unsigned TmpReg = MRI.createVirtualRegister(AddrRegClass);
21155 // aligned_addr = (addr + (align-1)) & ~(align-1)
21156 BuildMI(overflowMBB, DL, TII->get(X86::ADD64ri32), TmpReg)
21157 .addReg(OverflowAddrReg)
21160 BuildMI(overflowMBB, DL, TII->get(X86::AND64ri32), OverflowDestReg)
21162 .addImm(~(uint64_t)(Align-1));
21164 BuildMI(overflowMBB, DL, TII->get(TargetOpcode::COPY), OverflowDestReg)
21165 .addReg(OverflowAddrReg);
21168 // Compute the next overflow address after this argument.
21169 // (the overflow address should be kept 8-byte aligned)
21170 unsigned NextAddrReg = MRI.createVirtualRegister(AddrRegClass);
21171 BuildMI(overflowMBB, DL, TII->get(X86::ADD64ri32), NextAddrReg)
21172 .addReg(OverflowDestReg)
21173 .addImm(ArgSizeA8);
21175 // Store the new overflow address.
21176 BuildMI(overflowMBB, DL, TII->get(X86::MOV64mr))
21181 .addOperand(Segment)
21182 .addReg(NextAddrReg)
21183 .setMemRefs(MMOBegin, MMOEnd);
21185 // If we branched, emit the PHI to the front of endMBB.
21187 BuildMI(*endMBB, endMBB->begin(), DL,
21188 TII->get(X86::PHI), DestReg)
21189 .addReg(OffsetDestReg).addMBB(offsetMBB)
21190 .addReg(OverflowDestReg).addMBB(overflowMBB);
21193 // Erase the pseudo instruction
21194 MI->eraseFromParent();
21199 MachineBasicBlock *
21200 X86TargetLowering::EmitVAStartSaveXMMRegsWithCustomInserter(
21202 MachineBasicBlock *MBB) const {
21203 // Emit code to save XMM registers to the stack. The ABI says that the
21204 // number of registers to save is given in %al, so it's theoretically
21205 // possible to do an indirect jump trick to avoid saving all of them,
21206 // however this code takes a simpler approach and just executes all
21207 // of the stores if %al is non-zero. It's less code, and it's probably
21208 // easier on the hardware branch predictor, and stores aren't all that
21209 // expensive anyway.
21211 // Create the new basic blocks. One block contains all the XMM stores,
21212 // and one block is the final destination regardless of whether any
21213 // stores were performed.
21214 const BasicBlock *LLVM_BB = MBB->getBasicBlock();
21215 MachineFunction *F = MBB->getParent();
21216 MachineFunction::iterator MBBIter = ++MBB->getIterator();
21217 MachineBasicBlock *XMMSaveMBB = F->CreateMachineBasicBlock(LLVM_BB);
21218 MachineBasicBlock *EndMBB = F->CreateMachineBasicBlock(LLVM_BB);
21219 F->insert(MBBIter, XMMSaveMBB);
21220 F->insert(MBBIter, EndMBB);
21222 // Transfer the remainder of MBB and its successor edges to EndMBB.
21223 EndMBB->splice(EndMBB->begin(), MBB,
21224 std::next(MachineBasicBlock::iterator(MI)), MBB->end());
21225 EndMBB->transferSuccessorsAndUpdatePHIs(MBB);
21227 // The original block will now fall through to the XMM save block.
21228 MBB->addSuccessor(XMMSaveMBB);
21229 // The XMMSaveMBB will fall through to the end block.
21230 XMMSaveMBB->addSuccessor(EndMBB);
21232 // Now add the instructions.
21233 const TargetInstrInfo *TII = Subtarget->getInstrInfo();
21234 DebugLoc DL = MI->getDebugLoc();
21236 unsigned CountReg = MI->getOperand(0).getReg();
21237 int64_t RegSaveFrameIndex = MI->getOperand(1).getImm();
21238 int64_t VarArgsFPOffset = MI->getOperand(2).getImm();
21240 if (!Subtarget->isCallingConvWin64(F->getFunction()->getCallingConv())) {
21241 // If %al is 0, branch around the XMM save block.
21242 BuildMI(MBB, DL, TII->get(X86::TEST8rr)).addReg(CountReg).addReg(CountReg);
21243 BuildMI(MBB, DL, TII->get(X86::JE_1)).addMBB(EndMBB);
21244 MBB->addSuccessor(EndMBB);
21247 // Make sure the last operand is EFLAGS, which gets clobbered by the branch
21248 // that was just emitted, but clearly shouldn't be "saved".
21249 assert((MI->getNumOperands() <= 3 ||
21250 !MI->getOperand(MI->getNumOperands() - 1).isReg() ||
21251 MI->getOperand(MI->getNumOperands() - 1).getReg() == X86::EFLAGS)
21252 && "Expected last argument to be EFLAGS");
21253 unsigned MOVOpc = Subtarget->hasFp256() ? X86::VMOVAPSmr : X86::MOVAPSmr;
21254 // In the XMM save block, save all the XMM argument registers.
21255 for (int i = 3, e = MI->getNumOperands() - 1; i != e; ++i) {
21256 int64_t Offset = (i - 3) * 16 + VarArgsFPOffset;
21257 MachineMemOperand *MMO = F->getMachineMemOperand(
21258 MachinePointerInfo::getFixedStack(*F, RegSaveFrameIndex, Offset),
21259 MachineMemOperand::MOStore,
21260 /*Size=*/16, /*Align=*/16);
21261 BuildMI(XMMSaveMBB, DL, TII->get(MOVOpc))
21262 .addFrameIndex(RegSaveFrameIndex)
21263 .addImm(/*Scale=*/1)
21264 .addReg(/*IndexReg=*/0)
21265 .addImm(/*Disp=*/Offset)
21266 .addReg(/*Segment=*/0)
21267 .addReg(MI->getOperand(i).getReg())
21268 .addMemOperand(MMO);
21271 MI->eraseFromParent(); // The pseudo instruction is gone now.
21276 // The EFLAGS operand of SelectItr might be missing a kill marker
21277 // because there were multiple uses of EFLAGS, and ISel didn't know
21278 // which to mark. Figure out whether SelectItr should have had a
21279 // kill marker, and set it if it should. Returns the correct kill
21281 static bool checkAndUpdateEFLAGSKill(MachineBasicBlock::iterator SelectItr,
21282 MachineBasicBlock* BB,
21283 const TargetRegisterInfo* TRI) {
21284 // Scan forward through BB for a use/def of EFLAGS.
21285 MachineBasicBlock::iterator miI(std::next(SelectItr));
21286 for (MachineBasicBlock::iterator miE = BB->end(); miI != miE; ++miI) {
21287 const MachineInstr& mi = *miI;
21288 if (mi.readsRegister(X86::EFLAGS))
21290 if (mi.definesRegister(X86::EFLAGS))
21291 break; // Should have kill-flag - update below.
21294 // If we hit the end of the block, check whether EFLAGS is live into a
21296 if (miI == BB->end()) {
21297 for (MachineBasicBlock::succ_iterator sItr = BB->succ_begin(),
21298 sEnd = BB->succ_end();
21299 sItr != sEnd; ++sItr) {
21300 MachineBasicBlock* succ = *sItr;
21301 if (succ->isLiveIn(X86::EFLAGS))
21306 // We found a def, or hit the end of the basic block and EFLAGS wasn't live
21307 // out. SelectMI should have a kill flag on EFLAGS.
21308 SelectItr->addRegisterKilled(X86::EFLAGS, TRI);
21312 // Return true if it is OK for this CMOV pseudo-opcode to be cascaded
21313 // together with other CMOV pseudo-opcodes into a single basic-block with
21314 // conditional jump around it.
21315 static bool isCMOVPseudo(MachineInstr *MI) {
21316 switch (MI->getOpcode()) {
21317 case X86::CMOV_FR32:
21318 case X86::CMOV_FR64:
21319 case X86::CMOV_GR8:
21320 case X86::CMOV_GR16:
21321 case X86::CMOV_GR32:
21322 case X86::CMOV_RFP32:
21323 case X86::CMOV_RFP64:
21324 case X86::CMOV_RFP80:
21325 case X86::CMOV_V2F64:
21326 case X86::CMOV_V2I64:
21327 case X86::CMOV_V4F32:
21328 case X86::CMOV_V4F64:
21329 case X86::CMOV_V4I64:
21330 case X86::CMOV_V16F32:
21331 case X86::CMOV_V8F32:
21332 case X86::CMOV_V8F64:
21333 case X86::CMOV_V8I64:
21334 case X86::CMOV_V8I1:
21335 case X86::CMOV_V16I1:
21336 case X86::CMOV_V32I1:
21337 case X86::CMOV_V64I1:
21345 MachineBasicBlock *
21346 X86TargetLowering::EmitLoweredSelect(MachineInstr *MI,
21347 MachineBasicBlock *BB) const {
21348 const TargetInstrInfo *TII = Subtarget->getInstrInfo();
21349 DebugLoc DL = MI->getDebugLoc();
21351 // To "insert" a SELECT_CC instruction, we actually have to insert the
21352 // diamond control-flow pattern. The incoming instruction knows the
21353 // destination vreg to set, the condition code register to branch on, the
21354 // true/false values to select between, and a branch opcode to use.
21355 const BasicBlock *LLVM_BB = BB->getBasicBlock();
21356 MachineFunction::iterator It = ++BB->getIterator();
21361 // cmpTY ccX, r1, r2
21363 // fallthrough --> copy0MBB
21364 MachineBasicBlock *thisMBB = BB;
21365 MachineFunction *F = BB->getParent();
21367 // This code lowers all pseudo-CMOV instructions. Generally it lowers these
21368 // as described above, by inserting a BB, and then making a PHI at the join
21369 // point to select the true and false operands of the CMOV in the PHI.
21371 // The code also handles two different cases of multiple CMOV opcodes
21375 // In this case, there are multiple CMOVs in a row, all which are based on
21376 // the same condition setting (or the exact opposite condition setting).
21377 // In this case we can lower all the CMOVs using a single inserted BB, and
21378 // then make a number of PHIs at the join point to model the CMOVs. The only
21379 // trickiness here, is that in a case like:
21381 // t2 = CMOV cond1 t1, f1
21382 // t3 = CMOV cond1 t2, f2
21384 // when rewriting this into PHIs, we have to perform some renaming on the
21385 // temps since you cannot have a PHI operand refer to a PHI result earlier
21386 // in the same block. The "simple" but wrong lowering would be:
21388 // t2 = PHI t1(BB1), f1(BB2)
21389 // t3 = PHI t2(BB1), f2(BB2)
21391 // but clearly t2 is not defined in BB1, so that is incorrect. The proper
21392 // renaming is to note that on the path through BB1, t2 is really just a
21393 // copy of t1, and do that renaming, properly generating:
21395 // t2 = PHI t1(BB1), f1(BB2)
21396 // t3 = PHI t1(BB1), f2(BB2)
21398 // Case 2, we lower cascaded CMOVs such as
21400 // (CMOV (CMOV F, T, cc1), T, cc2)
21402 // to two successives branches. For that, we look for another CMOV as the
21403 // following instruction.
21405 // Without this, we would add a PHI between the two jumps, which ends up
21406 // creating a few copies all around. For instance, for
21408 // (sitofp (zext (fcmp une)))
21410 // we would generate:
21412 // ucomiss %xmm1, %xmm0
21413 // movss <1.0f>, %xmm0
21414 // movaps %xmm0, %xmm1
21416 // xorps %xmm1, %xmm1
21419 // movaps %xmm1, %xmm0
21423 // because this custom-inserter would have generated:
21435 // A: X = ...; Y = ...
21437 // C: Z = PHI [X, A], [Y, B]
21439 // E: PHI [X, C], [Z, D]
21441 // If we lower both CMOVs in a single step, we can instead generate:
21453 // A: X = ...; Y = ...
21455 // E: PHI [X, A], [X, C], [Y, D]
21457 // Which, in our sitofp/fcmp example, gives us something like:
21459 // ucomiss %xmm1, %xmm0
21460 // movss <1.0f>, %xmm0
21463 // xorps %xmm0, %xmm0
21467 MachineInstr *CascadedCMOV = nullptr;
21468 MachineInstr *LastCMOV = MI;
21469 X86::CondCode CC = X86::CondCode(MI->getOperand(3).getImm());
21470 X86::CondCode OppCC = X86::GetOppositeBranchCondition(CC);
21471 MachineBasicBlock::iterator NextMIIt =
21472 std::next(MachineBasicBlock::iterator(MI));
21474 // Check for case 1, where there are multiple CMOVs with the same condition
21475 // first. Of the two cases of multiple CMOV lowerings, case 1 reduces the
21476 // number of jumps the most.
21478 if (isCMOVPseudo(MI)) {
21479 // See if we have a string of CMOVS with the same condition.
21480 while (NextMIIt != BB->end() &&
21481 isCMOVPseudo(NextMIIt) &&
21482 (NextMIIt->getOperand(3).getImm() == CC ||
21483 NextMIIt->getOperand(3).getImm() == OppCC)) {
21484 LastCMOV = &*NextMIIt;
21489 // This checks for case 2, but only do this if we didn't already find
21490 // case 1, as indicated by LastCMOV == MI.
21491 if (LastCMOV == MI &&
21492 NextMIIt != BB->end() && NextMIIt->getOpcode() == MI->getOpcode() &&
21493 NextMIIt->getOperand(2).getReg() == MI->getOperand(2).getReg() &&
21494 NextMIIt->getOperand(1).getReg() == MI->getOperand(0).getReg()) {
21495 CascadedCMOV = &*NextMIIt;
21498 MachineBasicBlock *jcc1MBB = nullptr;
21500 // If we have a cascaded CMOV, we lower it to two successive branches to
21501 // the same block. EFLAGS is used by both, so mark it as live in the second.
21502 if (CascadedCMOV) {
21503 jcc1MBB = F->CreateMachineBasicBlock(LLVM_BB);
21504 F->insert(It, jcc1MBB);
21505 jcc1MBB->addLiveIn(X86::EFLAGS);
21508 MachineBasicBlock *copy0MBB = F->CreateMachineBasicBlock(LLVM_BB);
21509 MachineBasicBlock *sinkMBB = F->CreateMachineBasicBlock(LLVM_BB);
21510 F->insert(It, copy0MBB);
21511 F->insert(It, sinkMBB);
21513 // If the EFLAGS register isn't dead in the terminator, then claim that it's
21514 // live into the sink and copy blocks.
21515 const TargetRegisterInfo *TRI = Subtarget->getRegisterInfo();
21517 MachineInstr *LastEFLAGSUser = CascadedCMOV ? CascadedCMOV : LastCMOV;
21518 if (!LastEFLAGSUser->killsRegister(X86::EFLAGS) &&
21519 !checkAndUpdateEFLAGSKill(LastEFLAGSUser, BB, TRI)) {
21520 copy0MBB->addLiveIn(X86::EFLAGS);
21521 sinkMBB->addLiveIn(X86::EFLAGS);
21524 // Transfer the remainder of BB and its successor edges to sinkMBB.
21525 sinkMBB->splice(sinkMBB->begin(), BB,
21526 std::next(MachineBasicBlock::iterator(LastCMOV)), BB->end());
21527 sinkMBB->transferSuccessorsAndUpdatePHIs(BB);
21529 // Add the true and fallthrough blocks as its successors.
21530 if (CascadedCMOV) {
21531 // The fallthrough block may be jcc1MBB, if we have a cascaded CMOV.
21532 BB->addSuccessor(jcc1MBB);
21534 // In that case, jcc1MBB will itself fallthrough the copy0MBB, and
21535 // jump to the sinkMBB.
21536 jcc1MBB->addSuccessor(copy0MBB);
21537 jcc1MBB->addSuccessor(sinkMBB);
21539 BB->addSuccessor(copy0MBB);
21542 // The true block target of the first (or only) branch is always sinkMBB.
21543 BB->addSuccessor(sinkMBB);
21545 // Create the conditional branch instruction.
21546 unsigned Opc = X86::GetCondBranchFromCond(CC);
21547 BuildMI(BB, DL, TII->get(Opc)).addMBB(sinkMBB);
21549 if (CascadedCMOV) {
21550 unsigned Opc2 = X86::GetCondBranchFromCond(
21551 (X86::CondCode)CascadedCMOV->getOperand(3).getImm());
21552 BuildMI(jcc1MBB, DL, TII->get(Opc2)).addMBB(sinkMBB);
21556 // %FalseValue = ...
21557 // # fallthrough to sinkMBB
21558 copy0MBB->addSuccessor(sinkMBB);
21561 // %Result = phi [ %FalseValue, copy0MBB ], [ %TrueValue, thisMBB ]
21563 MachineBasicBlock::iterator MIItBegin = MachineBasicBlock::iterator(MI);
21564 MachineBasicBlock::iterator MIItEnd =
21565 std::next(MachineBasicBlock::iterator(LastCMOV));
21566 MachineBasicBlock::iterator SinkInsertionPoint = sinkMBB->begin();
21567 DenseMap<unsigned, std::pair<unsigned, unsigned>> RegRewriteTable;
21568 MachineInstrBuilder MIB;
21570 // As we are creating the PHIs, we have to be careful if there is more than
21571 // one. Later CMOVs may reference the results of earlier CMOVs, but later
21572 // PHIs have to reference the individual true/false inputs from earlier PHIs.
21573 // That also means that PHI construction must work forward from earlier to
21574 // later, and that the code must maintain a mapping from earlier PHI's
21575 // destination registers, and the registers that went into the PHI.
21577 for (MachineBasicBlock::iterator MIIt = MIItBegin; MIIt != MIItEnd; ++MIIt) {
21578 unsigned DestReg = MIIt->getOperand(0).getReg();
21579 unsigned Op1Reg = MIIt->getOperand(1).getReg();
21580 unsigned Op2Reg = MIIt->getOperand(2).getReg();
21582 // If this CMOV we are generating is the opposite condition from
21583 // the jump we generated, then we have to swap the operands for the
21584 // PHI that is going to be generated.
21585 if (MIIt->getOperand(3).getImm() == OppCC)
21586 std::swap(Op1Reg, Op2Reg);
21588 if (RegRewriteTable.find(Op1Reg) != RegRewriteTable.end())
21589 Op1Reg = RegRewriteTable[Op1Reg].first;
21591 if (RegRewriteTable.find(Op2Reg) != RegRewriteTable.end())
21592 Op2Reg = RegRewriteTable[Op2Reg].second;
21594 MIB = BuildMI(*sinkMBB, SinkInsertionPoint, DL,
21595 TII->get(X86::PHI), DestReg)
21596 .addReg(Op1Reg).addMBB(copy0MBB)
21597 .addReg(Op2Reg).addMBB(thisMBB);
21599 // Add this PHI to the rewrite table.
21600 RegRewriteTable[DestReg] = std::make_pair(Op1Reg, Op2Reg);
21603 // If we have a cascaded CMOV, the second Jcc provides the same incoming
21604 // value as the first Jcc (the True operand of the SELECT_CC/CMOV nodes).
21605 if (CascadedCMOV) {
21606 MIB.addReg(MI->getOperand(2).getReg()).addMBB(jcc1MBB);
21607 // Copy the PHI result to the register defined by the second CMOV.
21608 BuildMI(*sinkMBB, std::next(MachineBasicBlock::iterator(MIB.getInstr())),
21609 DL, TII->get(TargetOpcode::COPY),
21610 CascadedCMOV->getOperand(0).getReg())
21611 .addReg(MI->getOperand(0).getReg());
21612 CascadedCMOV->eraseFromParent();
21615 // Now remove the CMOV(s).
21616 for (MachineBasicBlock::iterator MIIt = MIItBegin; MIIt != MIItEnd; )
21617 (MIIt++)->eraseFromParent();
21622 MachineBasicBlock *
21623 X86TargetLowering::EmitLoweredAtomicFP(MachineInstr *MI,
21624 MachineBasicBlock *BB) const {
21625 // Combine the following atomic floating-point modification pattern:
21626 // a.store(reg OP a.load(acquire), release)
21627 // Transform them into:
21628 // OPss (%gpr), %xmm
21629 // movss %xmm, (%gpr)
21630 // Or sd equivalent for 64-bit operations.
21632 switch (MI->getOpcode()) {
21633 default: llvm_unreachable("unexpected instr type for EmitLoweredAtomicFP");
21634 case X86::RELEASE_FADD32mr: MOp = X86::MOVSSmr; FOp = X86::ADDSSrm; break;
21635 case X86::RELEASE_FADD64mr: MOp = X86::MOVSDmr; FOp = X86::ADDSDrm; break;
21637 const X86InstrInfo *TII = Subtarget->getInstrInfo();
21638 DebugLoc DL = MI->getDebugLoc();
21639 MachineRegisterInfo &MRI = BB->getParent()->getRegInfo();
21640 MachineOperand MSrc = MI->getOperand(0);
21641 unsigned VSrc = MI->getOperand(5).getReg();
21642 const MachineOperand &Disp = MI->getOperand(3);
21643 MachineOperand ZeroDisp = MachineOperand::CreateImm(0);
21644 bool hasDisp = Disp.isGlobal() || Disp.isImm();
21645 if (hasDisp && MSrc.isReg())
21646 MSrc.setIsKill(false);
21647 MachineInstrBuilder MIM = BuildMI(*BB, MI, DL, TII->get(MOp))
21648 .addOperand(/*Base=*/MSrc)
21649 .addImm(/*Scale=*/1)
21650 .addReg(/*Index=*/0)
21651 .addDisp(hasDisp ? Disp : ZeroDisp, /*off=*/0)
21653 MachineInstr *MIO = BuildMI(*BB, (MachineInstr *)MIM, DL, TII->get(FOp),
21654 MRI.createVirtualRegister(MRI.getRegClass(VSrc)))
21656 .addOperand(/*Base=*/MSrc)
21657 .addImm(/*Scale=*/1)
21658 .addReg(/*Index=*/0)
21659 .addDisp(hasDisp ? Disp : ZeroDisp, /*off=*/0)
21660 .addReg(/*Segment=*/0);
21661 MIM.addReg(MIO->getOperand(0).getReg(), RegState::Kill);
21662 MI->eraseFromParent(); // The pseudo instruction is gone now.
21666 MachineBasicBlock *
21667 X86TargetLowering::EmitLoweredSegAlloca(MachineInstr *MI,
21668 MachineBasicBlock *BB) const {
21669 MachineFunction *MF = BB->getParent();
21670 const TargetInstrInfo *TII = Subtarget->getInstrInfo();
21671 DebugLoc DL = MI->getDebugLoc();
21672 const BasicBlock *LLVM_BB = BB->getBasicBlock();
21674 assert(MF->shouldSplitStack());
21676 const bool Is64Bit = Subtarget->is64Bit();
21677 const bool IsLP64 = Subtarget->isTarget64BitLP64();
21679 const unsigned TlsReg = Is64Bit ? X86::FS : X86::GS;
21680 const unsigned TlsOffset = IsLP64 ? 0x70 : Is64Bit ? 0x40 : 0x30;
21683 // ... [Till the alloca]
21684 // If stacklet is not large enough, jump to mallocMBB
21687 // Allocate by subtracting from RSP
21688 // Jump to continueMBB
21691 // Allocate by call to runtime
21695 // [rest of original BB]
21698 MachineBasicBlock *mallocMBB = MF->CreateMachineBasicBlock(LLVM_BB);
21699 MachineBasicBlock *bumpMBB = MF->CreateMachineBasicBlock(LLVM_BB);
21700 MachineBasicBlock *continueMBB = MF->CreateMachineBasicBlock(LLVM_BB);
21702 MachineRegisterInfo &MRI = MF->getRegInfo();
21703 const TargetRegisterClass *AddrRegClass =
21704 getRegClassFor(getPointerTy(MF->getDataLayout()));
21706 unsigned mallocPtrVReg = MRI.createVirtualRegister(AddrRegClass),
21707 bumpSPPtrVReg = MRI.createVirtualRegister(AddrRegClass),
21708 tmpSPVReg = MRI.createVirtualRegister(AddrRegClass),
21709 SPLimitVReg = MRI.createVirtualRegister(AddrRegClass),
21710 sizeVReg = MI->getOperand(1).getReg(),
21711 physSPReg = IsLP64 || Subtarget->isTargetNaCl64() ? X86::RSP : X86::ESP;
21713 MachineFunction::iterator MBBIter = ++BB->getIterator();
21715 MF->insert(MBBIter, bumpMBB);
21716 MF->insert(MBBIter, mallocMBB);
21717 MF->insert(MBBIter, continueMBB);
21719 continueMBB->splice(continueMBB->begin(), BB,
21720 std::next(MachineBasicBlock::iterator(MI)), BB->end());
21721 continueMBB->transferSuccessorsAndUpdatePHIs(BB);
21723 // Add code to the main basic block to check if the stack limit has been hit,
21724 // and if so, jump to mallocMBB otherwise to bumpMBB.
21725 BuildMI(BB, DL, TII->get(TargetOpcode::COPY), tmpSPVReg).addReg(physSPReg);
21726 BuildMI(BB, DL, TII->get(IsLP64 ? X86::SUB64rr:X86::SUB32rr), SPLimitVReg)
21727 .addReg(tmpSPVReg).addReg(sizeVReg);
21728 BuildMI(BB, DL, TII->get(IsLP64 ? X86::CMP64mr:X86::CMP32mr))
21729 .addReg(0).addImm(1).addReg(0).addImm(TlsOffset).addReg(TlsReg)
21730 .addReg(SPLimitVReg);
21731 BuildMI(BB, DL, TII->get(X86::JG_1)).addMBB(mallocMBB);
21733 // bumpMBB simply decreases the stack pointer, since we know the current
21734 // stacklet has enough space.
21735 BuildMI(bumpMBB, DL, TII->get(TargetOpcode::COPY), physSPReg)
21736 .addReg(SPLimitVReg);
21737 BuildMI(bumpMBB, DL, TII->get(TargetOpcode::COPY), bumpSPPtrVReg)
21738 .addReg(SPLimitVReg);
21739 BuildMI(bumpMBB, DL, TII->get(X86::JMP_1)).addMBB(continueMBB);
21741 // Calls into a routine in libgcc to allocate more space from the heap.
21742 const uint32_t *RegMask =
21743 Subtarget->getRegisterInfo()->getCallPreservedMask(*MF, CallingConv::C);
21745 BuildMI(mallocMBB, DL, TII->get(X86::MOV64rr), X86::RDI)
21747 BuildMI(mallocMBB, DL, TII->get(X86::CALL64pcrel32))
21748 .addExternalSymbol("__morestack_allocate_stack_space")
21749 .addRegMask(RegMask)
21750 .addReg(X86::RDI, RegState::Implicit)
21751 .addReg(X86::RAX, RegState::ImplicitDefine);
21752 } else if (Is64Bit) {
21753 BuildMI(mallocMBB, DL, TII->get(X86::MOV32rr), X86::EDI)
21755 BuildMI(mallocMBB, DL, TII->get(X86::CALL64pcrel32))
21756 .addExternalSymbol("__morestack_allocate_stack_space")
21757 .addRegMask(RegMask)
21758 .addReg(X86::EDI, RegState::Implicit)
21759 .addReg(X86::EAX, RegState::ImplicitDefine);
21761 BuildMI(mallocMBB, DL, TII->get(X86::SUB32ri), physSPReg).addReg(physSPReg)
21763 BuildMI(mallocMBB, DL, TII->get(X86::PUSH32r)).addReg(sizeVReg);
21764 BuildMI(mallocMBB, DL, TII->get(X86::CALLpcrel32))
21765 .addExternalSymbol("__morestack_allocate_stack_space")
21766 .addRegMask(RegMask)
21767 .addReg(X86::EAX, RegState::ImplicitDefine);
21771 BuildMI(mallocMBB, DL, TII->get(X86::ADD32ri), physSPReg).addReg(physSPReg)
21774 BuildMI(mallocMBB, DL, TII->get(TargetOpcode::COPY), mallocPtrVReg)
21775 .addReg(IsLP64 ? X86::RAX : X86::EAX);
21776 BuildMI(mallocMBB, DL, TII->get(X86::JMP_1)).addMBB(continueMBB);
21778 // Set up the CFG correctly.
21779 BB->addSuccessor(bumpMBB);
21780 BB->addSuccessor(mallocMBB);
21781 mallocMBB->addSuccessor(continueMBB);
21782 bumpMBB->addSuccessor(continueMBB);
21784 // Take care of the PHI nodes.
21785 BuildMI(*continueMBB, continueMBB->begin(), DL, TII->get(X86::PHI),
21786 MI->getOperand(0).getReg())
21787 .addReg(mallocPtrVReg).addMBB(mallocMBB)
21788 .addReg(bumpSPPtrVReg).addMBB(bumpMBB);
21790 // Delete the original pseudo instruction.
21791 MI->eraseFromParent();
21794 return continueMBB;
21797 MachineBasicBlock *
21798 X86TargetLowering::EmitLoweredWinAlloca(MachineInstr *MI,
21799 MachineBasicBlock *BB) const {
21800 assert(!Subtarget->isTargetMachO());
21801 DebugLoc DL = MI->getDebugLoc();
21802 MachineInstr *ResumeMI = Subtarget->getFrameLowering()->emitStackProbe(
21803 *BB->getParent(), *BB, MI, DL, false);
21804 MachineBasicBlock *ResumeBB = ResumeMI->getParent();
21805 MI->eraseFromParent(); // The pseudo instruction is gone now.
21809 MachineBasicBlock *
21810 X86TargetLowering::EmitLoweredCatchRet(MachineInstr *MI,
21811 MachineBasicBlock *BB) const {
21812 MachineFunction *MF = BB->getParent();
21813 const TargetInstrInfo &TII = *Subtarget->getInstrInfo();
21814 MachineBasicBlock *TargetMBB = MI->getOperand(0).getMBB();
21815 DebugLoc DL = MI->getDebugLoc();
21817 assert(!isAsynchronousEHPersonality(
21818 classifyEHPersonality(MF->getFunction()->getPersonalityFn())) &&
21819 "SEH does not use catchret!");
21821 // Only 32-bit EH needs to worry about manually restoring stack pointers.
21822 if (!Subtarget->is32Bit())
21825 // C++ EH creates a new target block to hold the restore code, and wires up
21826 // the new block to the return destination with a normal JMP_4.
21827 MachineBasicBlock *RestoreMBB =
21828 MF->CreateMachineBasicBlock(BB->getBasicBlock());
21829 assert(BB->succ_size() == 1);
21830 MF->insert(std::next(BB->getIterator()), RestoreMBB);
21831 RestoreMBB->transferSuccessorsAndUpdatePHIs(BB);
21832 BB->addSuccessor(RestoreMBB);
21833 MI->getOperand(0).setMBB(RestoreMBB);
21835 auto RestoreMBBI = RestoreMBB->begin();
21836 BuildMI(*RestoreMBB, RestoreMBBI, DL, TII.get(X86::EH_RESTORE));
21837 BuildMI(*RestoreMBB, RestoreMBBI, DL, TII.get(X86::JMP_4)).addMBB(TargetMBB);
21841 MachineBasicBlock *
21842 X86TargetLowering::EmitLoweredCatchPad(MachineInstr *MI,
21843 MachineBasicBlock *BB) const {
21844 MachineFunction *MF = BB->getParent();
21845 const Constant *PerFn = MF->getFunction()->getPersonalityFn();
21846 bool IsSEH = isAsynchronousEHPersonality(classifyEHPersonality(PerFn));
21847 // Only 32-bit SEH requires special handling for catchpad.
21848 if (IsSEH && Subtarget->is32Bit()) {
21849 const TargetInstrInfo &TII = *Subtarget->getInstrInfo();
21850 DebugLoc DL = MI->getDebugLoc();
21851 BuildMI(*BB, MI, DL, TII.get(X86::EH_RESTORE));
21853 MI->eraseFromParent();
21857 MachineBasicBlock *
21858 X86TargetLowering::EmitLoweredTLSCall(MachineInstr *MI,
21859 MachineBasicBlock *BB) const {
21860 // This is pretty easy. We're taking the value that we received from
21861 // our load from the relocation, sticking it in either RDI (x86-64)
21862 // or EAX and doing an indirect call. The return value will then
21863 // be in the normal return register.
21864 MachineFunction *F = BB->getParent();
21865 const X86InstrInfo *TII = Subtarget->getInstrInfo();
21866 DebugLoc DL = MI->getDebugLoc();
21868 assert(Subtarget->isTargetDarwin() && "Darwin only instr emitted?");
21869 assert(MI->getOperand(3).isGlobal() && "This should be a global");
21871 // Get a register mask for the lowered call.
21872 // FIXME: The 32-bit calls have non-standard calling conventions. Use a
21873 // proper register mask.
21874 const uint32_t *RegMask =
21875 Subtarget->is64Bit() ?
21876 Subtarget->getRegisterInfo()->getDarwinTLSCallPreservedMask() :
21877 Subtarget->getRegisterInfo()->getCallPreservedMask(*F, CallingConv::C);
21878 if (Subtarget->is64Bit()) {
21879 MachineInstrBuilder MIB = BuildMI(*BB, MI, DL,
21880 TII->get(X86::MOV64rm), X86::RDI)
21882 .addImm(0).addReg(0)
21883 .addGlobalAddress(MI->getOperand(3).getGlobal(), 0,
21884 MI->getOperand(3).getTargetFlags())
21886 MIB = BuildMI(*BB, MI, DL, TII->get(X86::CALL64m));
21887 addDirectMem(MIB, X86::RDI);
21888 MIB.addReg(X86::RAX, RegState::ImplicitDefine).addRegMask(RegMask);
21889 } else if (F->getTarget().getRelocationModel() != Reloc::PIC_) {
21890 MachineInstrBuilder MIB = BuildMI(*BB, MI, DL,
21891 TII->get(X86::MOV32rm), X86::EAX)
21893 .addImm(0).addReg(0)
21894 .addGlobalAddress(MI->getOperand(3).getGlobal(), 0,
21895 MI->getOperand(3).getTargetFlags())
21897 MIB = BuildMI(*BB, MI, DL, TII->get(X86::CALL32m));
21898 addDirectMem(MIB, X86::EAX);
21899 MIB.addReg(X86::EAX, RegState::ImplicitDefine).addRegMask(RegMask);
21901 MachineInstrBuilder MIB = BuildMI(*BB, MI, DL,
21902 TII->get(X86::MOV32rm), X86::EAX)
21903 .addReg(TII->getGlobalBaseReg(F))
21904 .addImm(0).addReg(0)
21905 .addGlobalAddress(MI->getOperand(3).getGlobal(), 0,
21906 MI->getOperand(3).getTargetFlags())
21908 MIB = BuildMI(*BB, MI, DL, TII->get(X86::CALL32m));
21909 addDirectMem(MIB, X86::EAX);
21910 MIB.addReg(X86::EAX, RegState::ImplicitDefine).addRegMask(RegMask);
21913 MI->eraseFromParent(); // The pseudo instruction is gone now.
21917 MachineBasicBlock *
21918 X86TargetLowering::emitEHSjLjSetJmp(MachineInstr *MI,
21919 MachineBasicBlock *MBB) const {
21920 DebugLoc DL = MI->getDebugLoc();
21921 MachineFunction *MF = MBB->getParent();
21922 const TargetInstrInfo *TII = Subtarget->getInstrInfo();
21923 MachineRegisterInfo &MRI = MF->getRegInfo();
21925 const BasicBlock *BB = MBB->getBasicBlock();
21926 MachineFunction::iterator I = ++MBB->getIterator();
21928 // Memory Reference
21929 MachineInstr::mmo_iterator MMOBegin = MI->memoperands_begin();
21930 MachineInstr::mmo_iterator MMOEnd = MI->memoperands_end();
21933 unsigned MemOpndSlot = 0;
21935 unsigned CurOp = 0;
21937 DstReg = MI->getOperand(CurOp++).getReg();
21938 const TargetRegisterClass *RC = MRI.getRegClass(DstReg);
21939 assert(RC->hasType(MVT::i32) && "Invalid destination!");
21940 unsigned mainDstReg = MRI.createVirtualRegister(RC);
21941 unsigned restoreDstReg = MRI.createVirtualRegister(RC);
21943 MemOpndSlot = CurOp;
21945 MVT PVT = getPointerTy(MF->getDataLayout());
21946 assert((PVT == MVT::i64 || PVT == MVT::i32) &&
21947 "Invalid Pointer Size!");
21949 // For v = setjmp(buf), we generate
21952 // buf[LabelOffset] = restoreMBB <-- takes address of restoreMBB
21953 // SjLjSetup restoreMBB
21959 // v = phi(main, restore)
21962 // if base pointer being used, load it from frame
21965 MachineBasicBlock *thisMBB = MBB;
21966 MachineBasicBlock *mainMBB = MF->CreateMachineBasicBlock(BB);
21967 MachineBasicBlock *sinkMBB = MF->CreateMachineBasicBlock(BB);
21968 MachineBasicBlock *restoreMBB = MF->CreateMachineBasicBlock(BB);
21969 MF->insert(I, mainMBB);
21970 MF->insert(I, sinkMBB);
21971 MF->push_back(restoreMBB);
21972 restoreMBB->setHasAddressTaken();
21974 MachineInstrBuilder MIB;
21976 // Transfer the remainder of BB and its successor edges to sinkMBB.
21977 sinkMBB->splice(sinkMBB->begin(), MBB,
21978 std::next(MachineBasicBlock::iterator(MI)), MBB->end());
21979 sinkMBB->transferSuccessorsAndUpdatePHIs(MBB);
21982 unsigned PtrStoreOpc = 0;
21983 unsigned LabelReg = 0;
21984 const int64_t LabelOffset = 1 * PVT.getStoreSize();
21985 Reloc::Model RM = MF->getTarget().getRelocationModel();
21986 bool UseImmLabel = (MF->getTarget().getCodeModel() == CodeModel::Small) &&
21987 (RM == Reloc::Static || RM == Reloc::DynamicNoPIC);
21989 // Prepare IP either in reg or imm.
21990 if (!UseImmLabel) {
21991 PtrStoreOpc = (PVT == MVT::i64) ? X86::MOV64mr : X86::MOV32mr;
21992 const TargetRegisterClass *PtrRC = getRegClassFor(PVT);
21993 LabelReg = MRI.createVirtualRegister(PtrRC);
21994 if (Subtarget->is64Bit()) {
21995 MIB = BuildMI(*thisMBB, MI, DL, TII->get(X86::LEA64r), LabelReg)
21999 .addMBB(restoreMBB)
22002 const X86InstrInfo *XII = static_cast<const X86InstrInfo*>(TII);
22003 MIB = BuildMI(*thisMBB, MI, DL, TII->get(X86::LEA32r), LabelReg)
22004 .addReg(XII->getGlobalBaseReg(MF))
22007 .addMBB(restoreMBB, Subtarget->ClassifyBlockAddressReference())
22011 PtrStoreOpc = (PVT == MVT::i64) ? X86::MOV64mi32 : X86::MOV32mi;
22013 MIB = BuildMI(*thisMBB, MI, DL, TII->get(PtrStoreOpc));
22014 for (unsigned i = 0; i < X86::AddrNumOperands; ++i) {
22015 if (i == X86::AddrDisp)
22016 MIB.addDisp(MI->getOperand(MemOpndSlot + i), LabelOffset);
22018 MIB.addOperand(MI->getOperand(MemOpndSlot + i));
22021 MIB.addReg(LabelReg);
22023 MIB.addMBB(restoreMBB);
22024 MIB.setMemRefs(MMOBegin, MMOEnd);
22026 MIB = BuildMI(*thisMBB, MI, DL, TII->get(X86::EH_SjLj_Setup))
22027 .addMBB(restoreMBB);
22029 const X86RegisterInfo *RegInfo = Subtarget->getRegisterInfo();
22030 MIB.addRegMask(RegInfo->getNoPreservedMask());
22031 thisMBB->addSuccessor(mainMBB);
22032 thisMBB->addSuccessor(restoreMBB);
22036 BuildMI(mainMBB, DL, TII->get(X86::MOV32r0), mainDstReg);
22037 mainMBB->addSuccessor(sinkMBB);
22040 BuildMI(*sinkMBB, sinkMBB->begin(), DL,
22041 TII->get(X86::PHI), DstReg)
22042 .addReg(mainDstReg).addMBB(mainMBB)
22043 .addReg(restoreDstReg).addMBB(restoreMBB);
22046 if (RegInfo->hasBasePointer(*MF)) {
22047 const bool Uses64BitFramePtr =
22048 Subtarget->isTarget64BitLP64() || Subtarget->isTargetNaCl64();
22049 X86MachineFunctionInfo *X86FI = MF->getInfo<X86MachineFunctionInfo>();
22050 X86FI->setRestoreBasePointer(MF);
22051 unsigned FramePtr = RegInfo->getFrameRegister(*MF);
22052 unsigned BasePtr = RegInfo->getBaseRegister();
22053 unsigned Opm = Uses64BitFramePtr ? X86::MOV64rm : X86::MOV32rm;
22054 addRegOffset(BuildMI(restoreMBB, DL, TII->get(Opm), BasePtr),
22055 FramePtr, true, X86FI->getRestoreBasePointerOffset())
22056 .setMIFlag(MachineInstr::FrameSetup);
22058 BuildMI(restoreMBB, DL, TII->get(X86::MOV32ri), restoreDstReg).addImm(1);
22059 BuildMI(restoreMBB, DL, TII->get(X86::JMP_1)).addMBB(sinkMBB);
22060 restoreMBB->addSuccessor(sinkMBB);
22062 MI->eraseFromParent();
22066 MachineBasicBlock *
22067 X86TargetLowering::emitEHSjLjLongJmp(MachineInstr *MI,
22068 MachineBasicBlock *MBB) const {
22069 DebugLoc DL = MI->getDebugLoc();
22070 MachineFunction *MF = MBB->getParent();
22071 const TargetInstrInfo *TII = Subtarget->getInstrInfo();
22072 MachineRegisterInfo &MRI = MF->getRegInfo();
22074 // Memory Reference
22075 MachineInstr::mmo_iterator MMOBegin = MI->memoperands_begin();
22076 MachineInstr::mmo_iterator MMOEnd = MI->memoperands_end();
22078 MVT PVT = getPointerTy(MF->getDataLayout());
22079 assert((PVT == MVT::i64 || PVT == MVT::i32) &&
22080 "Invalid Pointer Size!");
22082 const TargetRegisterClass *RC =
22083 (PVT == MVT::i64) ? &X86::GR64RegClass : &X86::GR32RegClass;
22084 unsigned Tmp = MRI.createVirtualRegister(RC);
22085 // Since FP is only updated here but NOT referenced, it's treated as GPR.
22086 const X86RegisterInfo *RegInfo = Subtarget->getRegisterInfo();
22087 unsigned FP = (PVT == MVT::i64) ? X86::RBP : X86::EBP;
22088 unsigned SP = RegInfo->getStackRegister();
22090 MachineInstrBuilder MIB;
22092 const int64_t LabelOffset = 1 * PVT.getStoreSize();
22093 const int64_t SPOffset = 2 * PVT.getStoreSize();
22095 unsigned PtrLoadOpc = (PVT == MVT::i64) ? X86::MOV64rm : X86::MOV32rm;
22096 unsigned IJmpOpc = (PVT == MVT::i64) ? X86::JMP64r : X86::JMP32r;
22099 MIB = BuildMI(*MBB, MI, DL, TII->get(PtrLoadOpc), FP);
22100 for (unsigned i = 0; i < X86::AddrNumOperands; ++i)
22101 MIB.addOperand(MI->getOperand(i));
22102 MIB.setMemRefs(MMOBegin, MMOEnd);
22104 MIB = BuildMI(*MBB, MI, DL, TII->get(PtrLoadOpc), Tmp);
22105 for (unsigned i = 0; i < X86::AddrNumOperands; ++i) {
22106 if (i == X86::AddrDisp)
22107 MIB.addDisp(MI->getOperand(i), LabelOffset);
22109 MIB.addOperand(MI->getOperand(i));
22111 MIB.setMemRefs(MMOBegin, MMOEnd);
22113 MIB = BuildMI(*MBB, MI, DL, TII->get(PtrLoadOpc), SP);
22114 for (unsigned i = 0; i < X86::AddrNumOperands; ++i) {
22115 if (i == X86::AddrDisp)
22116 MIB.addDisp(MI->getOperand(i), SPOffset);
22118 MIB.addOperand(MI->getOperand(i));
22120 MIB.setMemRefs(MMOBegin, MMOEnd);
22122 BuildMI(*MBB, MI, DL, TII->get(IJmpOpc)).addReg(Tmp);
22124 MI->eraseFromParent();
22128 // Replace 213-type (isel default) FMA3 instructions with 231-type for
22129 // accumulator loops. Writing back to the accumulator allows the coalescer
22130 // to remove extra copies in the loop.
22131 // FIXME: Do this on AVX512. We don't support 231 variants yet (PR23937).
22132 MachineBasicBlock *
22133 X86TargetLowering::emitFMA3Instr(MachineInstr *MI,
22134 MachineBasicBlock *MBB) const {
22135 MachineOperand &AddendOp = MI->getOperand(3);
22137 // Bail out early if the addend isn't a register - we can't switch these.
22138 if (!AddendOp.isReg())
22141 MachineFunction &MF = *MBB->getParent();
22142 MachineRegisterInfo &MRI = MF.getRegInfo();
22144 // Check whether the addend is defined by a PHI:
22145 assert(MRI.hasOneDef(AddendOp.getReg()) && "Multiple defs in SSA?");
22146 MachineInstr &AddendDef = *MRI.def_instr_begin(AddendOp.getReg());
22147 if (!AddendDef.isPHI())
22150 // Look for the following pattern:
22152 // %addend = phi [%entry, 0], [%loop, %result]
22154 // %result<tied1> = FMA213 %m2<tied0>, %m1, %addend
22158 // %addend = phi [%entry, 0], [%loop, %result]
22160 // %result<tied1> = FMA231 %addend<tied0>, %m1, %m2
22162 for (unsigned i = 1, e = AddendDef.getNumOperands(); i < e; i += 2) {
22163 assert(AddendDef.getOperand(i).isReg());
22164 MachineOperand PHISrcOp = AddendDef.getOperand(i);
22165 MachineInstr &PHISrcInst = *MRI.def_instr_begin(PHISrcOp.getReg());
22166 if (&PHISrcInst == MI) {
22167 // Found a matching instruction.
22168 unsigned NewFMAOpc = 0;
22169 switch (MI->getOpcode()) {
22170 case X86::VFMADDPDr213r: NewFMAOpc = X86::VFMADDPDr231r; break;
22171 case X86::VFMADDPSr213r: NewFMAOpc = X86::VFMADDPSr231r; break;
22172 case X86::VFMADDSDr213r: NewFMAOpc = X86::VFMADDSDr231r; break;
22173 case X86::VFMADDSSr213r: NewFMAOpc = X86::VFMADDSSr231r; break;
22174 case X86::VFMSUBPDr213r: NewFMAOpc = X86::VFMSUBPDr231r; break;
22175 case X86::VFMSUBPSr213r: NewFMAOpc = X86::VFMSUBPSr231r; break;
22176 case X86::VFMSUBSDr213r: NewFMAOpc = X86::VFMSUBSDr231r; break;
22177 case X86::VFMSUBSSr213r: NewFMAOpc = X86::VFMSUBSSr231r; break;
22178 case X86::VFNMADDPDr213r: NewFMAOpc = X86::VFNMADDPDr231r; break;
22179 case X86::VFNMADDPSr213r: NewFMAOpc = X86::VFNMADDPSr231r; break;
22180 case X86::VFNMADDSDr213r: NewFMAOpc = X86::VFNMADDSDr231r; break;
22181 case X86::VFNMADDSSr213r: NewFMAOpc = X86::VFNMADDSSr231r; break;
22182 case X86::VFNMSUBPDr213r: NewFMAOpc = X86::VFNMSUBPDr231r; break;
22183 case X86::VFNMSUBPSr213r: NewFMAOpc = X86::VFNMSUBPSr231r; break;
22184 case X86::VFNMSUBSDr213r: NewFMAOpc = X86::VFNMSUBSDr231r; break;
22185 case X86::VFNMSUBSSr213r: NewFMAOpc = X86::VFNMSUBSSr231r; break;
22186 case X86::VFMADDSUBPDr213r: NewFMAOpc = X86::VFMADDSUBPDr231r; break;
22187 case X86::VFMADDSUBPSr213r: NewFMAOpc = X86::VFMADDSUBPSr231r; break;
22188 case X86::VFMSUBADDPDr213r: NewFMAOpc = X86::VFMSUBADDPDr231r; break;
22189 case X86::VFMSUBADDPSr213r: NewFMAOpc = X86::VFMSUBADDPSr231r; break;
22191 case X86::VFMADDPDr213rY: NewFMAOpc = X86::VFMADDPDr231rY; break;
22192 case X86::VFMADDPSr213rY: NewFMAOpc = X86::VFMADDPSr231rY; break;
22193 case X86::VFMSUBPDr213rY: NewFMAOpc = X86::VFMSUBPDr231rY; break;
22194 case X86::VFMSUBPSr213rY: NewFMAOpc = X86::VFMSUBPSr231rY; break;
22195 case X86::VFNMADDPDr213rY: NewFMAOpc = X86::VFNMADDPDr231rY; break;
22196 case X86::VFNMADDPSr213rY: NewFMAOpc = X86::VFNMADDPSr231rY; break;
22197 case X86::VFNMSUBPDr213rY: NewFMAOpc = X86::VFNMSUBPDr231rY; break;
22198 case X86::VFNMSUBPSr213rY: NewFMAOpc = X86::VFNMSUBPSr231rY; break;
22199 case X86::VFMADDSUBPDr213rY: NewFMAOpc = X86::VFMADDSUBPDr231rY; break;
22200 case X86::VFMADDSUBPSr213rY: NewFMAOpc = X86::VFMADDSUBPSr231rY; break;
22201 case X86::VFMSUBADDPDr213rY: NewFMAOpc = X86::VFMSUBADDPDr231rY; break;
22202 case X86::VFMSUBADDPSr213rY: NewFMAOpc = X86::VFMSUBADDPSr231rY; break;
22203 default: llvm_unreachable("Unrecognized FMA variant.");
22206 const TargetInstrInfo &TII = *Subtarget->getInstrInfo();
22207 MachineInstrBuilder MIB =
22208 BuildMI(MF, MI->getDebugLoc(), TII.get(NewFMAOpc))
22209 .addOperand(MI->getOperand(0))
22210 .addOperand(MI->getOperand(3))
22211 .addOperand(MI->getOperand(2))
22212 .addOperand(MI->getOperand(1));
22213 MBB->insert(MachineBasicBlock::iterator(MI), MIB);
22214 MI->eraseFromParent();
22221 MachineBasicBlock *
22222 X86TargetLowering::EmitInstrWithCustomInserter(MachineInstr *MI,
22223 MachineBasicBlock *BB) const {
22224 switch (MI->getOpcode()) {
22225 default: llvm_unreachable("Unexpected instr type to insert");
22226 case X86::TAILJMPd64:
22227 case X86::TAILJMPr64:
22228 case X86::TAILJMPm64:
22229 case X86::TAILJMPd64_REX:
22230 case X86::TAILJMPr64_REX:
22231 case X86::TAILJMPm64_REX:
22232 llvm_unreachable("TAILJMP64 would not be touched here.");
22233 case X86::TCRETURNdi64:
22234 case X86::TCRETURNri64:
22235 case X86::TCRETURNmi64:
22237 case X86::WIN_ALLOCA:
22238 return EmitLoweredWinAlloca(MI, BB);
22239 case X86::CATCHRET:
22240 return EmitLoweredCatchRet(MI, BB);
22241 case X86::CATCHPAD:
22242 return EmitLoweredCatchPad(MI, BB);
22243 case X86::SEG_ALLOCA_32:
22244 case X86::SEG_ALLOCA_64:
22245 return EmitLoweredSegAlloca(MI, BB);
22246 case X86::TLSCall_32:
22247 case X86::TLSCall_64:
22248 return EmitLoweredTLSCall(MI, BB);
22249 case X86::CMOV_FR32:
22250 case X86::CMOV_FR64:
22251 case X86::CMOV_FR128:
22252 case X86::CMOV_GR8:
22253 case X86::CMOV_GR16:
22254 case X86::CMOV_GR32:
22255 case X86::CMOV_RFP32:
22256 case X86::CMOV_RFP64:
22257 case X86::CMOV_RFP80:
22258 case X86::CMOV_V2F64:
22259 case X86::CMOV_V2I64:
22260 case X86::CMOV_V4F32:
22261 case X86::CMOV_V4F64:
22262 case X86::CMOV_V4I64:
22263 case X86::CMOV_V16F32:
22264 case X86::CMOV_V8F32:
22265 case X86::CMOV_V8F64:
22266 case X86::CMOV_V8I64:
22267 case X86::CMOV_V8I1:
22268 case X86::CMOV_V16I1:
22269 case X86::CMOV_V32I1:
22270 case X86::CMOV_V64I1:
22271 return EmitLoweredSelect(MI, BB);
22273 case X86::RELEASE_FADD32mr:
22274 case X86::RELEASE_FADD64mr:
22275 return EmitLoweredAtomicFP(MI, BB);
22277 case X86::FP32_TO_INT16_IN_MEM:
22278 case X86::FP32_TO_INT32_IN_MEM:
22279 case X86::FP32_TO_INT64_IN_MEM:
22280 case X86::FP64_TO_INT16_IN_MEM:
22281 case X86::FP64_TO_INT32_IN_MEM:
22282 case X86::FP64_TO_INT64_IN_MEM:
22283 case X86::FP80_TO_INT16_IN_MEM:
22284 case X86::FP80_TO_INT32_IN_MEM:
22285 case X86::FP80_TO_INT64_IN_MEM: {
22286 MachineFunction *F = BB->getParent();
22287 const TargetInstrInfo *TII = Subtarget->getInstrInfo();
22288 DebugLoc DL = MI->getDebugLoc();
22290 // Change the floating point control register to use "round towards zero"
22291 // mode when truncating to an integer value.
22292 int CWFrameIdx = F->getFrameInfo()->CreateStackObject(2, 2, false);
22293 addFrameReference(BuildMI(*BB, MI, DL,
22294 TII->get(X86::FNSTCW16m)), CWFrameIdx);
22296 // Load the old value of the high byte of the control word...
22298 F->getRegInfo().createVirtualRegister(&X86::GR16RegClass);
22299 addFrameReference(BuildMI(*BB, MI, DL, TII->get(X86::MOV16rm), OldCW),
22302 // Set the high part to be round to zero...
22303 addFrameReference(BuildMI(*BB, MI, DL, TII->get(X86::MOV16mi)), CWFrameIdx)
22306 // Reload the modified control word now...
22307 addFrameReference(BuildMI(*BB, MI, DL,
22308 TII->get(X86::FLDCW16m)), CWFrameIdx);
22310 // Restore the memory image of control word to original value
22311 addFrameReference(BuildMI(*BB, MI, DL, TII->get(X86::MOV16mr)), CWFrameIdx)
22314 // Get the X86 opcode to use.
22316 switch (MI->getOpcode()) {
22317 default: llvm_unreachable("illegal opcode!");
22318 case X86::FP32_TO_INT16_IN_MEM: Opc = X86::IST_Fp16m32; break;
22319 case X86::FP32_TO_INT32_IN_MEM: Opc = X86::IST_Fp32m32; break;
22320 case X86::FP32_TO_INT64_IN_MEM: Opc = X86::IST_Fp64m32; break;
22321 case X86::FP64_TO_INT16_IN_MEM: Opc = X86::IST_Fp16m64; break;
22322 case X86::FP64_TO_INT32_IN_MEM: Opc = X86::IST_Fp32m64; break;
22323 case X86::FP64_TO_INT64_IN_MEM: Opc = X86::IST_Fp64m64; break;
22324 case X86::FP80_TO_INT16_IN_MEM: Opc = X86::IST_Fp16m80; break;
22325 case X86::FP80_TO_INT32_IN_MEM: Opc = X86::IST_Fp32m80; break;
22326 case X86::FP80_TO_INT64_IN_MEM: Opc = X86::IST_Fp64m80; break;
22330 MachineOperand &Op = MI->getOperand(0);
22332 AM.BaseType = X86AddressMode::RegBase;
22333 AM.Base.Reg = Op.getReg();
22335 AM.BaseType = X86AddressMode::FrameIndexBase;
22336 AM.Base.FrameIndex = Op.getIndex();
22338 Op = MI->getOperand(1);
22340 AM.Scale = Op.getImm();
22341 Op = MI->getOperand(2);
22343 AM.IndexReg = Op.getImm();
22344 Op = MI->getOperand(3);
22345 if (Op.isGlobal()) {
22346 AM.GV = Op.getGlobal();
22348 AM.Disp = Op.getImm();
22350 addFullAddress(BuildMI(*BB, MI, DL, TII->get(Opc)), AM)
22351 .addReg(MI->getOperand(X86::AddrNumOperands).getReg());
22353 // Reload the original control word now.
22354 addFrameReference(BuildMI(*BB, MI, DL,
22355 TII->get(X86::FLDCW16m)), CWFrameIdx);
22357 MI->eraseFromParent(); // The pseudo instruction is gone now.
22360 // String/text processing lowering.
22361 case X86::PCMPISTRM128REG:
22362 case X86::VPCMPISTRM128REG:
22363 case X86::PCMPISTRM128MEM:
22364 case X86::VPCMPISTRM128MEM:
22365 case X86::PCMPESTRM128REG:
22366 case X86::VPCMPESTRM128REG:
22367 case X86::PCMPESTRM128MEM:
22368 case X86::VPCMPESTRM128MEM:
22369 assert(Subtarget->hasSSE42() &&
22370 "Target must have SSE4.2 or AVX features enabled");
22371 return EmitPCMPSTRM(MI, BB, Subtarget->getInstrInfo());
22373 // String/text processing lowering.
22374 case X86::PCMPISTRIREG:
22375 case X86::VPCMPISTRIREG:
22376 case X86::PCMPISTRIMEM:
22377 case X86::VPCMPISTRIMEM:
22378 case X86::PCMPESTRIREG:
22379 case X86::VPCMPESTRIREG:
22380 case X86::PCMPESTRIMEM:
22381 case X86::VPCMPESTRIMEM:
22382 assert(Subtarget->hasSSE42() &&
22383 "Target must have SSE4.2 or AVX features enabled");
22384 return EmitPCMPSTRI(MI, BB, Subtarget->getInstrInfo());
22386 // Thread synchronization.
22388 return EmitMonitor(MI, BB, Subtarget);
22392 return EmitXBegin(MI, BB, Subtarget->getInstrInfo());
22394 case X86::VASTART_SAVE_XMM_REGS:
22395 return EmitVAStartSaveXMMRegsWithCustomInserter(MI, BB);
22397 case X86::VAARG_64:
22398 return EmitVAARG64WithCustomInserter(MI, BB);
22400 case X86::EH_SjLj_SetJmp32:
22401 case X86::EH_SjLj_SetJmp64:
22402 return emitEHSjLjSetJmp(MI, BB);
22404 case X86::EH_SjLj_LongJmp32:
22405 case X86::EH_SjLj_LongJmp64:
22406 return emitEHSjLjLongJmp(MI, BB);
22408 case TargetOpcode::STATEPOINT:
22409 // As an implementation detail, STATEPOINT shares the STACKMAP format at
22410 // this point in the process. We diverge later.
22411 return emitPatchPoint(MI, BB);
22413 case TargetOpcode::STACKMAP:
22414 case TargetOpcode::PATCHPOINT:
22415 return emitPatchPoint(MI, BB);
22417 case X86::VFMADDPDr213r:
22418 case X86::VFMADDPSr213r:
22419 case X86::VFMADDSDr213r:
22420 case X86::VFMADDSSr213r:
22421 case X86::VFMSUBPDr213r:
22422 case X86::VFMSUBPSr213r:
22423 case X86::VFMSUBSDr213r:
22424 case X86::VFMSUBSSr213r:
22425 case X86::VFNMADDPDr213r:
22426 case X86::VFNMADDPSr213r:
22427 case X86::VFNMADDSDr213r:
22428 case X86::VFNMADDSSr213r:
22429 case X86::VFNMSUBPDr213r:
22430 case X86::VFNMSUBPSr213r:
22431 case X86::VFNMSUBSDr213r:
22432 case X86::VFNMSUBSSr213r:
22433 case X86::VFMADDSUBPDr213r:
22434 case X86::VFMADDSUBPSr213r:
22435 case X86::VFMSUBADDPDr213r:
22436 case X86::VFMSUBADDPSr213r:
22437 case X86::VFMADDPDr213rY:
22438 case X86::VFMADDPSr213rY:
22439 case X86::VFMSUBPDr213rY:
22440 case X86::VFMSUBPSr213rY:
22441 case X86::VFNMADDPDr213rY:
22442 case X86::VFNMADDPSr213rY:
22443 case X86::VFNMSUBPDr213rY:
22444 case X86::VFNMSUBPSr213rY:
22445 case X86::VFMADDSUBPDr213rY:
22446 case X86::VFMADDSUBPSr213rY:
22447 case X86::VFMSUBADDPDr213rY:
22448 case X86::VFMSUBADDPSr213rY:
22449 return emitFMA3Instr(MI, BB);
22453 //===----------------------------------------------------------------------===//
22454 // X86 Optimization Hooks
22455 //===----------------------------------------------------------------------===//
22457 void X86TargetLowering::computeKnownBitsForTargetNode(const SDValue Op,
22460 const SelectionDAG &DAG,
22461 unsigned Depth) const {
22462 unsigned BitWidth = KnownZero.getBitWidth();
22463 unsigned Opc = Op.getOpcode();
22464 assert((Opc >= ISD::BUILTIN_OP_END ||
22465 Opc == ISD::INTRINSIC_WO_CHAIN ||
22466 Opc == ISD::INTRINSIC_W_CHAIN ||
22467 Opc == ISD::INTRINSIC_VOID) &&
22468 "Should use MaskedValueIsZero if you don't know whether Op"
22469 " is a target node!");
22471 KnownZero = KnownOne = APInt(BitWidth, 0); // Don't know anything.
22485 // These nodes' second result is a boolean.
22486 if (Op.getResNo() == 0)
22489 case X86ISD::SETCC:
22490 KnownZero |= APInt::getHighBitsSet(BitWidth, BitWidth - 1);
22492 case ISD::INTRINSIC_WO_CHAIN: {
22493 unsigned IntId = cast<ConstantSDNode>(Op.getOperand(0))->getZExtValue();
22494 unsigned NumLoBits = 0;
22497 case Intrinsic::x86_sse_movmsk_ps:
22498 case Intrinsic::x86_avx_movmsk_ps_256:
22499 case Intrinsic::x86_sse2_movmsk_pd:
22500 case Intrinsic::x86_avx_movmsk_pd_256:
22501 case Intrinsic::x86_mmx_pmovmskb:
22502 case Intrinsic::x86_sse2_pmovmskb_128:
22503 case Intrinsic::x86_avx2_pmovmskb: {
22504 // High bits of movmskp{s|d}, pmovmskb are known zero.
22506 default: llvm_unreachable("Impossible intrinsic"); // Can't reach here.
22507 case Intrinsic::x86_sse_movmsk_ps: NumLoBits = 4; break;
22508 case Intrinsic::x86_avx_movmsk_ps_256: NumLoBits = 8; break;
22509 case Intrinsic::x86_sse2_movmsk_pd: NumLoBits = 2; break;
22510 case Intrinsic::x86_avx_movmsk_pd_256: NumLoBits = 4; break;
22511 case Intrinsic::x86_mmx_pmovmskb: NumLoBits = 8; break;
22512 case Intrinsic::x86_sse2_pmovmskb_128: NumLoBits = 16; break;
22513 case Intrinsic::x86_avx2_pmovmskb: NumLoBits = 32; break;
22515 KnownZero = APInt::getHighBitsSet(BitWidth, BitWidth - NumLoBits);
22524 unsigned X86TargetLowering::ComputeNumSignBitsForTargetNode(
22526 const SelectionDAG &,
22527 unsigned Depth) const {
22528 // SETCC_CARRY sets the dest to ~0 for true or 0 for false.
22529 if (Op.getOpcode() == X86ISD::SETCC_CARRY)
22530 return Op.getValueType().getScalarSizeInBits();
22536 /// isGAPlusOffset - Returns true (and the GlobalValue and the offset) if the
22537 /// node is a GlobalAddress + offset.
22538 bool X86TargetLowering::isGAPlusOffset(SDNode *N,
22539 const GlobalValue* &GA,
22540 int64_t &Offset) const {
22541 if (N->getOpcode() == X86ISD::Wrapper) {
22542 if (isa<GlobalAddressSDNode>(N->getOperand(0))) {
22543 GA = cast<GlobalAddressSDNode>(N->getOperand(0))->getGlobal();
22544 Offset = cast<GlobalAddressSDNode>(N->getOperand(0))->getOffset();
22548 return TargetLowering::isGAPlusOffset(N, GA, Offset);
22551 /// isShuffleHigh128VectorInsertLow - Checks whether the shuffle node is the
22552 /// same as extracting the high 128-bit part of 256-bit vector and then
22553 /// inserting the result into the low part of a new 256-bit vector
22554 static bool isShuffleHigh128VectorInsertLow(ShuffleVectorSDNode *SVOp) {
22555 EVT VT = SVOp->getValueType(0);
22556 unsigned NumElems = VT.getVectorNumElements();
22558 // vector_shuffle <4, 5, 6, 7, u, u, u, u> or <2, 3, u, u>
22559 for (unsigned i = 0, j = NumElems/2; i != NumElems/2; ++i, ++j)
22560 if (!isUndefOrEqual(SVOp->getMaskElt(i), j) ||
22561 SVOp->getMaskElt(j) >= 0)
22567 /// isShuffleLow128VectorInsertHigh - Checks whether the shuffle node is the
22568 /// same as extracting the low 128-bit part of 256-bit vector and then
22569 /// inserting the result into the high part of a new 256-bit vector
22570 static bool isShuffleLow128VectorInsertHigh(ShuffleVectorSDNode *SVOp) {
22571 EVT VT = SVOp->getValueType(0);
22572 unsigned NumElems = VT.getVectorNumElements();
22574 // vector_shuffle <u, u, u, u, 0, 1, 2, 3> or <u, u, 0, 1>
22575 for (unsigned i = NumElems/2, j = 0; i != NumElems; ++i, ++j)
22576 if (!isUndefOrEqual(SVOp->getMaskElt(i), j) ||
22577 SVOp->getMaskElt(j) >= 0)
22583 /// PerformShuffleCombine256 - Performs shuffle combines for 256-bit vectors.
22584 static SDValue PerformShuffleCombine256(SDNode *N, SelectionDAG &DAG,
22585 TargetLowering::DAGCombinerInfo &DCI,
22586 const X86Subtarget* Subtarget) {
22588 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(N);
22589 SDValue V1 = SVOp->getOperand(0);
22590 SDValue V2 = SVOp->getOperand(1);
22591 MVT VT = SVOp->getSimpleValueType(0);
22592 unsigned NumElems = VT.getVectorNumElements();
22594 if (V1.getOpcode() == ISD::CONCAT_VECTORS &&
22595 V2.getOpcode() == ISD::CONCAT_VECTORS) {
22599 // V UNDEF BUILD_VECTOR UNDEF
22601 // CONCAT_VECTOR CONCAT_VECTOR
22604 // RESULT: V + zero extended
22606 if (V2.getOperand(0).getOpcode() != ISD::BUILD_VECTOR ||
22607 V2.getOperand(1).getOpcode() != ISD::UNDEF ||
22608 V1.getOperand(1).getOpcode() != ISD::UNDEF)
22611 if (!ISD::isBuildVectorAllZeros(V2.getOperand(0).getNode()))
22614 // To match the shuffle mask, the first half of the mask should
22615 // be exactly the first vector, and all the rest a splat with the
22616 // first element of the second one.
22617 for (unsigned i = 0; i != NumElems/2; ++i)
22618 if (!isUndefOrEqual(SVOp->getMaskElt(i), i) ||
22619 !isUndefOrEqual(SVOp->getMaskElt(i+NumElems/2), NumElems))
22622 // If V1 is coming from a vector load then just fold to a VZEXT_LOAD.
22623 if (LoadSDNode *Ld = dyn_cast<LoadSDNode>(V1.getOperand(0))) {
22624 if (Ld->hasNUsesOfValue(1, 0)) {
22625 SDVTList Tys = DAG.getVTList(MVT::v4i64, MVT::Other);
22626 SDValue Ops[] = { Ld->getChain(), Ld->getBasePtr() };
22628 DAG.getMemIntrinsicNode(X86ISD::VZEXT_LOAD, dl, Tys, Ops,
22630 Ld->getPointerInfo(),
22631 Ld->getAlignment(),
22632 false/*isVolatile*/, true/*ReadMem*/,
22633 false/*WriteMem*/);
22635 // Make sure the newly-created LOAD is in the same position as Ld in
22636 // terms of dependency. We create a TokenFactor for Ld and ResNode,
22637 // and update uses of Ld's output chain to use the TokenFactor.
22638 if (Ld->hasAnyUseOfValue(1)) {
22639 SDValue NewChain = DAG.getNode(ISD::TokenFactor, dl, MVT::Other,
22640 SDValue(Ld, 1), SDValue(ResNode.getNode(), 1));
22641 DAG.ReplaceAllUsesOfValueWith(SDValue(Ld, 1), NewChain);
22642 DAG.UpdateNodeOperands(NewChain.getNode(), SDValue(Ld, 1),
22643 SDValue(ResNode.getNode(), 1));
22646 return DAG.getBitcast(VT, ResNode);
22650 // Emit a zeroed vector and insert the desired subvector on its
22652 SDValue Zeros = getZeroVector(VT, Subtarget, DAG, dl);
22653 SDValue InsV = Insert128BitVector(Zeros, V1.getOperand(0), 0, DAG, dl);
22654 return DCI.CombineTo(N, InsV);
22657 //===--------------------------------------------------------------------===//
22658 // Combine some shuffles into subvector extracts and inserts:
22661 // vector_shuffle <4, 5, 6, 7, u, u, u, u> or <2, 3, u, u>
22662 if (isShuffleHigh128VectorInsertLow(SVOp)) {
22663 SDValue V = Extract128BitVector(V1, NumElems/2, DAG, dl);
22664 SDValue InsV = Insert128BitVector(DAG.getUNDEF(VT), V, 0, DAG, dl);
22665 return DCI.CombineTo(N, InsV);
22668 // vector_shuffle <u, u, u, u, 0, 1, 2, 3> or <u, u, 0, 1>
22669 if (isShuffleLow128VectorInsertHigh(SVOp)) {
22670 SDValue V = Extract128BitVector(V1, 0, DAG, dl);
22671 SDValue InsV = Insert128BitVector(DAG.getUNDEF(VT), V, NumElems/2, DAG, dl);
22672 return DCI.CombineTo(N, InsV);
22678 /// \brief Combine an arbitrary chain of shuffles into a single instruction if
22681 /// This is the leaf of the recursive combinine below. When we have found some
22682 /// chain of single-use x86 shuffle instructions and accumulated the combined
22683 /// shuffle mask represented by them, this will try to pattern match that mask
22684 /// into either a single instruction if there is a special purpose instruction
22685 /// for this operation, or into a PSHUFB instruction which is a fully general
22686 /// instruction but should only be used to replace chains over a certain depth.
22687 static bool combineX86ShuffleChain(SDValue Op, SDValue Root, ArrayRef<int> Mask,
22688 int Depth, bool HasPSHUFB, SelectionDAG &DAG,
22689 TargetLowering::DAGCombinerInfo &DCI,
22690 const X86Subtarget *Subtarget) {
22691 assert(!Mask.empty() && "Cannot combine an empty shuffle mask!");
22693 // Find the operand that enters the chain. Note that multiple uses are OK
22694 // here, we're not going to remove the operand we find.
22695 SDValue Input = Op.getOperand(0);
22696 while (Input.getOpcode() == ISD::BITCAST)
22697 Input = Input.getOperand(0);
22699 MVT VT = Input.getSimpleValueType();
22700 MVT RootVT = Root.getSimpleValueType();
22703 if (Mask.size() == 1) {
22704 int Index = Mask[0];
22705 assert((Index >= 0 || Index == SM_SentinelUndef ||
22706 Index == SM_SentinelZero) &&
22707 "Invalid shuffle index found!");
22709 // We may end up with an accumulated mask of size 1 as a result of
22710 // widening of shuffle operands (see function canWidenShuffleElements).
22711 // If the only shuffle index is equal to SM_SentinelZero then propagate
22712 // a zero vector. Otherwise, the combine shuffle mask is a no-op shuffle
22713 // mask, and therefore the entire chain of shuffles can be folded away.
22714 if (Index == SM_SentinelZero)
22715 DCI.CombineTo(Root.getNode(), getZeroVector(RootVT, Subtarget, DAG, DL));
22717 DCI.CombineTo(Root.getNode(), DAG.getBitcast(RootVT, Input),
22722 // Use the float domain if the operand type is a floating point type.
22723 bool FloatDomain = VT.isFloatingPoint();
22725 // For floating point shuffles, we don't have free copies in the shuffle
22726 // instructions or the ability to load as part of the instruction, so
22727 // canonicalize their shuffles to UNPCK or MOV variants.
22729 // Note that even with AVX we prefer the PSHUFD form of shuffle for integer
22730 // vectors because it can have a load folded into it that UNPCK cannot. This
22731 // doesn't preclude something switching to the shorter encoding post-RA.
22733 // FIXME: Should teach these routines about AVX vector widths.
22734 if (FloatDomain && VT.is128BitVector()) {
22735 if (Mask.equals({0, 0}) || Mask.equals({1, 1})) {
22736 bool Lo = Mask.equals({0, 0});
22739 // Check if we have SSE3 which will let us use MOVDDUP. That instruction
22740 // is no slower than UNPCKLPD but has the option to fold the input operand
22741 // into even an unaligned memory load.
22742 if (Lo && Subtarget->hasSSE3()) {
22743 Shuffle = X86ISD::MOVDDUP;
22744 ShuffleVT = MVT::v2f64;
22746 // We have MOVLHPS and MOVHLPS throughout SSE and they encode smaller
22747 // than the UNPCK variants.
22748 Shuffle = Lo ? X86ISD::MOVLHPS : X86ISD::MOVHLPS;
22749 ShuffleVT = MVT::v4f32;
22751 if (Depth == 1 && Root->getOpcode() == Shuffle)
22752 return false; // Nothing to do!
22753 Op = DAG.getBitcast(ShuffleVT, Input);
22754 DCI.AddToWorklist(Op.getNode());
22755 if (Shuffle == X86ISD::MOVDDUP)
22756 Op = DAG.getNode(Shuffle, DL, ShuffleVT, Op);
22758 Op = DAG.getNode(Shuffle, DL, ShuffleVT, Op, Op);
22759 DCI.AddToWorklist(Op.getNode());
22760 DCI.CombineTo(Root.getNode(), DAG.getBitcast(RootVT, Op),
22764 if (Subtarget->hasSSE3() &&
22765 (Mask.equals({0, 0, 2, 2}) || Mask.equals({1, 1, 3, 3}))) {
22766 bool Lo = Mask.equals({0, 0, 2, 2});
22767 unsigned Shuffle = Lo ? X86ISD::MOVSLDUP : X86ISD::MOVSHDUP;
22768 MVT ShuffleVT = MVT::v4f32;
22769 if (Depth == 1 && Root->getOpcode() == Shuffle)
22770 return false; // Nothing to do!
22771 Op = DAG.getBitcast(ShuffleVT, Input);
22772 DCI.AddToWorklist(Op.getNode());
22773 Op = DAG.getNode(Shuffle, DL, ShuffleVT, Op);
22774 DCI.AddToWorklist(Op.getNode());
22775 DCI.CombineTo(Root.getNode(), DAG.getBitcast(RootVT, Op),
22779 if (Mask.equals({0, 0, 1, 1}) || Mask.equals({2, 2, 3, 3})) {
22780 bool Lo = Mask.equals({0, 0, 1, 1});
22781 unsigned Shuffle = Lo ? X86ISD::UNPCKL : X86ISD::UNPCKH;
22782 MVT ShuffleVT = MVT::v4f32;
22783 if (Depth == 1 && Root->getOpcode() == Shuffle)
22784 return false; // Nothing to do!
22785 Op = DAG.getBitcast(ShuffleVT, Input);
22786 DCI.AddToWorklist(Op.getNode());
22787 Op = DAG.getNode(Shuffle, DL, ShuffleVT, Op, Op);
22788 DCI.AddToWorklist(Op.getNode());
22789 DCI.CombineTo(Root.getNode(), DAG.getBitcast(RootVT, Op),
22795 // We always canonicalize the 8 x i16 and 16 x i8 shuffles into their UNPCK
22796 // variants as none of these have single-instruction variants that are
22797 // superior to the UNPCK formulation.
22798 if (!FloatDomain && VT.is128BitVector() &&
22799 (Mask.equals({0, 0, 1, 1, 2, 2, 3, 3}) ||
22800 Mask.equals({4, 4, 5, 5, 6, 6, 7, 7}) ||
22801 Mask.equals({0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7}) ||
22803 {8, 8, 9, 9, 10, 10, 11, 11, 12, 12, 13, 13, 14, 14, 15, 15}))) {
22804 bool Lo = Mask[0] == 0;
22805 unsigned Shuffle = Lo ? X86ISD::UNPCKL : X86ISD::UNPCKH;
22806 if (Depth == 1 && Root->getOpcode() == Shuffle)
22807 return false; // Nothing to do!
22809 switch (Mask.size()) {
22811 ShuffleVT = MVT::v8i16;
22814 ShuffleVT = MVT::v16i8;
22817 llvm_unreachable("Impossible mask size!");
22819 Op = DAG.getBitcast(ShuffleVT, Input);
22820 DCI.AddToWorklist(Op.getNode());
22821 Op = DAG.getNode(Shuffle, DL, ShuffleVT, Op, Op);
22822 DCI.AddToWorklist(Op.getNode());
22823 DCI.CombineTo(Root.getNode(), DAG.getBitcast(RootVT, Op),
22828 // Don't try to re-form single instruction chains under any circumstances now
22829 // that we've done encoding canonicalization for them.
22833 // If we have 3 or more shuffle instructions or a chain involving PSHUFB, we
22834 // can replace them with a single PSHUFB instruction profitably. Intel's
22835 // manuals suggest only using PSHUFB if doing so replacing 5 instructions, but
22836 // in practice PSHUFB tends to be *very* fast so we're more aggressive.
22837 if ((Depth >= 3 || HasPSHUFB) && Subtarget->hasSSSE3()) {
22838 SmallVector<SDValue, 16> PSHUFBMask;
22839 int NumBytes = VT.getSizeInBits() / 8;
22840 int Ratio = NumBytes / Mask.size();
22841 for (int i = 0; i < NumBytes; ++i) {
22842 if (Mask[i / Ratio] == SM_SentinelUndef) {
22843 PSHUFBMask.push_back(DAG.getUNDEF(MVT::i8));
22846 int M = Mask[i / Ratio] != SM_SentinelZero
22847 ? Ratio * Mask[i / Ratio] + i % Ratio
22849 PSHUFBMask.push_back(DAG.getConstant(M, DL, MVT::i8));
22851 MVT ByteVT = MVT::getVectorVT(MVT::i8, NumBytes);
22852 Op = DAG.getBitcast(ByteVT, Input);
22853 DCI.AddToWorklist(Op.getNode());
22854 SDValue PSHUFBMaskOp =
22855 DAG.getNode(ISD::BUILD_VECTOR, DL, ByteVT, PSHUFBMask);
22856 DCI.AddToWorklist(PSHUFBMaskOp.getNode());
22857 Op = DAG.getNode(X86ISD::PSHUFB, DL, ByteVT, Op, PSHUFBMaskOp);
22858 DCI.AddToWorklist(Op.getNode());
22859 DCI.CombineTo(Root.getNode(), DAG.getBitcast(RootVT, Op),
22864 // Failed to find any combines.
22868 /// \brief Fully generic combining of x86 shuffle instructions.
22870 /// This should be the last combine run over the x86 shuffle instructions. Once
22871 /// they have been fully optimized, this will recursively consider all chains
22872 /// of single-use shuffle instructions, build a generic model of the cumulative
22873 /// shuffle operation, and check for simpler instructions which implement this
22874 /// operation. We use this primarily for two purposes:
22876 /// 1) Collapse generic shuffles to specialized single instructions when
22877 /// equivalent. In most cases, this is just an encoding size win, but
22878 /// sometimes we will collapse multiple generic shuffles into a single
22879 /// special-purpose shuffle.
22880 /// 2) Look for sequences of shuffle instructions with 3 or more total
22881 /// instructions, and replace them with the slightly more expensive SSSE3
22882 /// PSHUFB instruction if available. We do this as the last combining step
22883 /// to ensure we avoid using PSHUFB if we can implement the shuffle with
22884 /// a suitable short sequence of other instructions. The PHUFB will either
22885 /// use a register or have to read from memory and so is slightly (but only
22886 /// slightly) more expensive than the other shuffle instructions.
22888 /// Because this is inherently a quadratic operation (for each shuffle in
22889 /// a chain, we recurse up the chain), the depth is limited to 8 instructions.
22890 /// This should never be an issue in practice as the shuffle lowering doesn't
22891 /// produce sequences of more than 8 instructions.
22893 /// FIXME: We will currently miss some cases where the redundant shuffling
22894 /// would simplify under the threshold for PSHUFB formation because of
22895 /// combine-ordering. To fix this, we should do the redundant instruction
22896 /// combining in this recursive walk.
22897 static bool combineX86ShufflesRecursively(SDValue Op, SDValue Root,
22898 ArrayRef<int> RootMask,
22899 int Depth, bool HasPSHUFB,
22901 TargetLowering::DAGCombinerInfo &DCI,
22902 const X86Subtarget *Subtarget) {
22903 // Bound the depth of our recursive combine because this is ultimately
22904 // quadratic in nature.
22908 // Directly rip through bitcasts to find the underlying operand.
22909 while (Op.getOpcode() == ISD::BITCAST && Op.getOperand(0).hasOneUse())
22910 Op = Op.getOperand(0);
22912 MVT VT = Op.getSimpleValueType();
22913 if (!VT.isVector())
22914 return false; // Bail if we hit a non-vector.
22916 assert(Root.getSimpleValueType().isVector() &&
22917 "Shuffles operate on vector types!");
22918 assert(VT.getSizeInBits() == Root.getSimpleValueType().getSizeInBits() &&
22919 "Can only combine shuffles of the same vector register size.");
22921 if (!isTargetShuffle(Op.getOpcode()))
22923 SmallVector<int, 16> OpMask;
22925 bool HaveMask = getTargetShuffleMask(Op.getNode(), VT, OpMask, IsUnary);
22926 // We only can combine unary shuffles which we can decode the mask for.
22927 if (!HaveMask || !IsUnary)
22930 assert(VT.getVectorNumElements() == OpMask.size() &&
22931 "Different mask size from vector size!");
22932 assert(((RootMask.size() > OpMask.size() &&
22933 RootMask.size() % OpMask.size() == 0) ||
22934 (OpMask.size() > RootMask.size() &&
22935 OpMask.size() % RootMask.size() == 0) ||
22936 OpMask.size() == RootMask.size()) &&
22937 "The smaller number of elements must divide the larger.");
22938 int RootRatio = std::max<int>(1, OpMask.size() / RootMask.size());
22939 int OpRatio = std::max<int>(1, RootMask.size() / OpMask.size());
22940 assert(((RootRatio == 1 && OpRatio == 1) ||
22941 (RootRatio == 1) != (OpRatio == 1)) &&
22942 "Must not have a ratio for both incoming and op masks!");
22944 SmallVector<int, 16> Mask;
22945 Mask.reserve(std::max(OpMask.size(), RootMask.size()));
22947 // Merge this shuffle operation's mask into our accumulated mask. Note that
22948 // this shuffle's mask will be the first applied to the input, followed by the
22949 // root mask to get us all the way to the root value arrangement. The reason
22950 // for this order is that we are recursing up the operation chain.
22951 for (int i = 0, e = std::max(OpMask.size(), RootMask.size()); i < e; ++i) {
22952 int RootIdx = i / RootRatio;
22953 if (RootMask[RootIdx] < 0) {
22954 // This is a zero or undef lane, we're done.
22955 Mask.push_back(RootMask[RootIdx]);
22959 int RootMaskedIdx = RootMask[RootIdx] * RootRatio + i % RootRatio;
22960 int OpIdx = RootMaskedIdx / OpRatio;
22961 if (OpMask[OpIdx] < 0) {
22962 // The incoming lanes are zero or undef, it doesn't matter which ones we
22964 Mask.push_back(OpMask[OpIdx]);
22968 // Ok, we have non-zero lanes, map them through.
22969 Mask.push_back(OpMask[OpIdx] * OpRatio +
22970 RootMaskedIdx % OpRatio);
22973 // See if we can recurse into the operand to combine more things.
22974 switch (Op.getOpcode()) {
22975 case X86ISD::PSHUFB:
22977 case X86ISD::PSHUFD:
22978 case X86ISD::PSHUFHW:
22979 case X86ISD::PSHUFLW:
22980 if (Op.getOperand(0).hasOneUse() &&
22981 combineX86ShufflesRecursively(Op.getOperand(0), Root, Mask, Depth + 1,
22982 HasPSHUFB, DAG, DCI, Subtarget))
22986 case X86ISD::UNPCKL:
22987 case X86ISD::UNPCKH:
22988 assert(Op.getOperand(0) == Op.getOperand(1) &&
22989 "We only combine unary shuffles!");
22990 // We can't check for single use, we have to check that this shuffle is the
22992 if (Op->isOnlyUserOf(Op.getOperand(0).getNode()) &&
22993 combineX86ShufflesRecursively(Op.getOperand(0), Root, Mask, Depth + 1,
22994 HasPSHUFB, DAG, DCI, Subtarget))
22999 // Minor canonicalization of the accumulated shuffle mask to make it easier
23000 // to match below. All this does is detect masks with squential pairs of
23001 // elements, and shrink them to the half-width mask. It does this in a loop
23002 // so it will reduce the size of the mask to the minimal width mask which
23003 // performs an equivalent shuffle.
23004 SmallVector<int, 16> WidenedMask;
23005 while (Mask.size() > 1 && canWidenShuffleElements(Mask, WidenedMask)) {
23006 Mask = std::move(WidenedMask);
23007 WidenedMask.clear();
23010 return combineX86ShuffleChain(Op, Root, Mask, Depth, HasPSHUFB, DAG, DCI,
23014 /// \brief Get the PSHUF-style mask from PSHUF node.
23016 /// This is a very minor wrapper around getTargetShuffleMask to easy forming v4
23017 /// PSHUF-style masks that can be reused with such instructions.
23018 static SmallVector<int, 4> getPSHUFShuffleMask(SDValue N) {
23019 MVT VT = N.getSimpleValueType();
23020 SmallVector<int, 4> Mask;
23022 bool HaveMask = getTargetShuffleMask(N.getNode(), VT, Mask, IsUnary);
23026 // If we have more than 128-bits, only the low 128-bits of shuffle mask
23027 // matter. Check that the upper masks are repeats and remove them.
23028 if (VT.getSizeInBits() > 128) {
23029 int LaneElts = 128 / VT.getScalarSizeInBits();
23031 for (int i = 1, NumLanes = VT.getSizeInBits() / 128; i < NumLanes; ++i)
23032 for (int j = 0; j < LaneElts; ++j)
23033 assert(Mask[j] == Mask[i * LaneElts + j] - (LaneElts * i) &&
23034 "Mask doesn't repeat in high 128-bit lanes!");
23036 Mask.resize(LaneElts);
23039 switch (N.getOpcode()) {
23040 case X86ISD::PSHUFD:
23042 case X86ISD::PSHUFLW:
23045 case X86ISD::PSHUFHW:
23046 Mask.erase(Mask.begin(), Mask.begin() + 4);
23047 for (int &M : Mask)
23051 llvm_unreachable("No valid shuffle instruction found!");
23055 /// \brief Search for a combinable shuffle across a chain ending in pshufd.
23057 /// We walk up the chain and look for a combinable shuffle, skipping over
23058 /// shuffles that we could hoist this shuffle's transformation past without
23059 /// altering anything.
23061 combineRedundantDWordShuffle(SDValue N, MutableArrayRef<int> Mask,
23063 TargetLowering::DAGCombinerInfo &DCI) {
23064 assert(N.getOpcode() == X86ISD::PSHUFD &&
23065 "Called with something other than an x86 128-bit half shuffle!");
23068 // Walk up a single-use chain looking for a combinable shuffle. Keep a stack
23069 // of the shuffles in the chain so that we can form a fresh chain to replace
23071 SmallVector<SDValue, 8> Chain;
23072 SDValue V = N.getOperand(0);
23073 for (; V.hasOneUse(); V = V.getOperand(0)) {
23074 switch (V.getOpcode()) {
23076 return SDValue(); // Nothing combined!
23079 // Skip bitcasts as we always know the type for the target specific
23083 case X86ISD::PSHUFD:
23084 // Found another dword shuffle.
23087 case X86ISD::PSHUFLW:
23088 // Check that the low words (being shuffled) are the identity in the
23089 // dword shuffle, and the high words are self-contained.
23090 if (Mask[0] != 0 || Mask[1] != 1 ||
23091 !(Mask[2] >= 2 && Mask[2] < 4 && Mask[3] >= 2 && Mask[3] < 4))
23094 Chain.push_back(V);
23097 case X86ISD::PSHUFHW:
23098 // Check that the high words (being shuffled) are the identity in the
23099 // dword shuffle, and the low words are self-contained.
23100 if (Mask[2] != 2 || Mask[3] != 3 ||
23101 !(Mask[0] >= 0 && Mask[0] < 2 && Mask[1] >= 0 && Mask[1] < 2))
23104 Chain.push_back(V);
23107 case X86ISD::UNPCKL:
23108 case X86ISD::UNPCKH:
23109 // For either i8 -> i16 or i16 -> i32 unpacks, we can combine a dword
23110 // shuffle into a preceding word shuffle.
23111 if (V.getSimpleValueType().getVectorElementType() != MVT::i8 &&
23112 V.getSimpleValueType().getVectorElementType() != MVT::i16)
23115 // Search for a half-shuffle which we can combine with.
23116 unsigned CombineOp =
23117 V.getOpcode() == X86ISD::UNPCKL ? X86ISD::PSHUFLW : X86ISD::PSHUFHW;
23118 if (V.getOperand(0) != V.getOperand(1) ||
23119 !V->isOnlyUserOf(V.getOperand(0).getNode()))
23121 Chain.push_back(V);
23122 V = V.getOperand(0);
23124 switch (V.getOpcode()) {
23126 return SDValue(); // Nothing to combine.
23128 case X86ISD::PSHUFLW:
23129 case X86ISD::PSHUFHW:
23130 if (V.getOpcode() == CombineOp)
23133 Chain.push_back(V);
23137 V = V.getOperand(0);
23141 } while (V.hasOneUse());
23144 // Break out of the loop if we break out of the switch.
23148 if (!V.hasOneUse())
23149 // We fell out of the loop without finding a viable combining instruction.
23152 // Merge this node's mask and our incoming mask.
23153 SmallVector<int, 4> VMask = getPSHUFShuffleMask(V);
23154 for (int &M : Mask)
23156 V = DAG.getNode(V.getOpcode(), DL, V.getValueType(), V.getOperand(0),
23157 getV4X86ShuffleImm8ForMask(Mask, DL, DAG));
23159 // Rebuild the chain around this new shuffle.
23160 while (!Chain.empty()) {
23161 SDValue W = Chain.pop_back_val();
23163 if (V.getValueType() != W.getOperand(0).getValueType())
23164 V = DAG.getBitcast(W.getOperand(0).getValueType(), V);
23166 switch (W.getOpcode()) {
23168 llvm_unreachable("Only PSHUF and UNPCK instructions get here!");
23170 case X86ISD::UNPCKL:
23171 case X86ISD::UNPCKH:
23172 V = DAG.getNode(W.getOpcode(), DL, W.getValueType(), V, V);
23175 case X86ISD::PSHUFD:
23176 case X86ISD::PSHUFLW:
23177 case X86ISD::PSHUFHW:
23178 V = DAG.getNode(W.getOpcode(), DL, W.getValueType(), V, W.getOperand(1));
23182 if (V.getValueType() != N.getValueType())
23183 V = DAG.getBitcast(N.getValueType(), V);
23185 // Return the new chain to replace N.
23189 /// \brief Search for a combinable shuffle across a chain ending in pshuflw or
23192 /// We walk up the chain, skipping shuffles of the other half and looking
23193 /// through shuffles which switch halves trying to find a shuffle of the same
23194 /// pair of dwords.
23195 static bool combineRedundantHalfShuffle(SDValue N, MutableArrayRef<int> Mask,
23197 TargetLowering::DAGCombinerInfo &DCI) {
23199 (N.getOpcode() == X86ISD::PSHUFLW || N.getOpcode() == X86ISD::PSHUFHW) &&
23200 "Called with something other than an x86 128-bit half shuffle!");
23202 unsigned CombineOpcode = N.getOpcode();
23204 // Walk up a single-use chain looking for a combinable shuffle.
23205 SDValue V = N.getOperand(0);
23206 for (; V.hasOneUse(); V = V.getOperand(0)) {
23207 switch (V.getOpcode()) {
23209 return false; // Nothing combined!
23212 // Skip bitcasts as we always know the type for the target specific
23216 case X86ISD::PSHUFLW:
23217 case X86ISD::PSHUFHW:
23218 if (V.getOpcode() == CombineOpcode)
23221 // Other-half shuffles are no-ops.
23224 // Break out of the loop if we break out of the switch.
23228 if (!V.hasOneUse())
23229 // We fell out of the loop without finding a viable combining instruction.
23232 // Combine away the bottom node as its shuffle will be accumulated into
23233 // a preceding shuffle.
23234 DCI.CombineTo(N.getNode(), N.getOperand(0), /*AddTo*/ true);
23236 // Record the old value.
23239 // Merge this node's mask and our incoming mask (adjusted to account for all
23240 // the pshufd instructions encountered).
23241 SmallVector<int, 4> VMask = getPSHUFShuffleMask(V);
23242 for (int &M : Mask)
23244 V = DAG.getNode(V.getOpcode(), DL, MVT::v8i16, V.getOperand(0),
23245 getV4X86ShuffleImm8ForMask(Mask, DL, DAG));
23247 // Check that the shuffles didn't cancel each other out. If not, we need to
23248 // combine to the new one.
23250 // Replace the combinable shuffle with the combined one, updating all users
23251 // so that we re-evaluate the chain here.
23252 DCI.CombineTo(Old.getNode(), V, /*AddTo*/ true);
23257 /// \brief Try to combine x86 target specific shuffles.
23258 static SDValue PerformTargetShuffleCombine(SDValue N, SelectionDAG &DAG,
23259 TargetLowering::DAGCombinerInfo &DCI,
23260 const X86Subtarget *Subtarget) {
23262 MVT VT = N.getSimpleValueType();
23263 SmallVector<int, 4> Mask;
23265 switch (N.getOpcode()) {
23266 case X86ISD::PSHUFD:
23267 case X86ISD::PSHUFLW:
23268 case X86ISD::PSHUFHW:
23269 Mask = getPSHUFShuffleMask(N);
23270 assert(Mask.size() == 4);
23272 case X86ISD::UNPCKL: {
23273 // Combine X86ISD::UNPCKL and ISD::VECTOR_SHUFFLE into X86ISD::UNPCKH, in
23274 // which X86ISD::UNPCKL has a ISD::UNDEF operand, and ISD::VECTOR_SHUFFLE
23275 // moves upper half elements into the lower half part. For example:
23277 // t2: v16i8 = vector_shuffle<8,9,10,11,12,13,14,15,u,u,u,u,u,u,u,u> t1,
23279 // t3: v16i8 = X86ISD::UNPCKL undef:v16i8, t2
23281 // will be combined to:
23283 // t3: v16i8 = X86ISD::UNPCKH undef:v16i8, t1
23285 // This is only for 128-bit vectors. From SSE4.1 onward this combine may not
23286 // happen due to advanced instructions.
23287 if (!VT.is128BitVector())
23290 auto Op0 = N.getOperand(0);
23291 auto Op1 = N.getOperand(1);
23292 if (Op0.getOpcode() == ISD::UNDEF &&
23293 Op1.getNode()->getOpcode() == ISD::VECTOR_SHUFFLE) {
23294 ArrayRef<int> Mask = cast<ShuffleVectorSDNode>(Op1.getNode())->getMask();
23296 unsigned NumElts = VT.getVectorNumElements();
23297 SmallVector<int, 8> ExpectedMask(NumElts, -1);
23298 std::iota(ExpectedMask.begin(), ExpectedMask.begin() + NumElts / 2,
23301 auto ShufOp = Op1.getOperand(0);
23302 if (isShuffleEquivalent(Op1, ShufOp, Mask, ExpectedMask))
23303 return DAG.getNode(X86ISD::UNPCKH, DL, VT, N.getOperand(0), ShufOp);
23311 // Nuke no-op shuffles that show up after combining.
23312 if (isNoopShuffleMask(Mask))
23313 return DCI.CombineTo(N.getNode(), N.getOperand(0), /*AddTo*/ true);
23315 // Look for simplifications involving one or two shuffle instructions.
23316 SDValue V = N.getOperand(0);
23317 switch (N.getOpcode()) {
23320 case X86ISD::PSHUFLW:
23321 case X86ISD::PSHUFHW:
23322 assert(VT.getVectorElementType() == MVT::i16 && "Bad word shuffle type!");
23324 if (combineRedundantHalfShuffle(N, Mask, DAG, DCI))
23325 return SDValue(); // We combined away this shuffle, so we're done.
23327 // See if this reduces to a PSHUFD which is no more expensive and can
23328 // combine with more operations. Note that it has to at least flip the
23329 // dwords as otherwise it would have been removed as a no-op.
23330 if (makeArrayRef(Mask).equals({2, 3, 0, 1})) {
23331 int DMask[] = {0, 1, 2, 3};
23332 int DOffset = N.getOpcode() == X86ISD::PSHUFLW ? 0 : 2;
23333 DMask[DOffset + 0] = DOffset + 1;
23334 DMask[DOffset + 1] = DOffset + 0;
23335 MVT DVT = MVT::getVectorVT(MVT::i32, VT.getVectorNumElements() / 2);
23336 V = DAG.getBitcast(DVT, V);
23337 DCI.AddToWorklist(V.getNode());
23338 V = DAG.getNode(X86ISD::PSHUFD, DL, DVT, V,
23339 getV4X86ShuffleImm8ForMask(DMask, DL, DAG));
23340 DCI.AddToWorklist(V.getNode());
23341 return DAG.getBitcast(VT, V);
23344 // Look for shuffle patterns which can be implemented as a single unpack.
23345 // FIXME: This doesn't handle the location of the PSHUFD generically, and
23346 // only works when we have a PSHUFD followed by two half-shuffles.
23347 if (Mask[0] == Mask[1] && Mask[2] == Mask[3] &&
23348 (V.getOpcode() == X86ISD::PSHUFLW ||
23349 V.getOpcode() == X86ISD::PSHUFHW) &&
23350 V.getOpcode() != N.getOpcode() &&
23352 SDValue D = V.getOperand(0);
23353 while (D.getOpcode() == ISD::BITCAST && D.hasOneUse())
23354 D = D.getOperand(0);
23355 if (D.getOpcode() == X86ISD::PSHUFD && D.hasOneUse()) {
23356 SmallVector<int, 4> VMask = getPSHUFShuffleMask(V);
23357 SmallVector<int, 4> DMask = getPSHUFShuffleMask(D);
23358 int NOffset = N.getOpcode() == X86ISD::PSHUFLW ? 0 : 4;
23359 int VOffset = V.getOpcode() == X86ISD::PSHUFLW ? 0 : 4;
23361 for (int i = 0; i < 4; ++i) {
23362 WordMask[i + NOffset] = Mask[i] + NOffset;
23363 WordMask[i + VOffset] = VMask[i] + VOffset;
23365 // Map the word mask through the DWord mask.
23367 for (int i = 0; i < 8; ++i)
23368 MappedMask[i] = 2 * DMask[WordMask[i] / 2] + WordMask[i] % 2;
23369 if (makeArrayRef(MappedMask).equals({0, 0, 1, 1, 2, 2, 3, 3}) ||
23370 makeArrayRef(MappedMask).equals({4, 4, 5, 5, 6, 6, 7, 7})) {
23371 // We can replace all three shuffles with an unpack.
23372 V = DAG.getBitcast(VT, D.getOperand(0));
23373 DCI.AddToWorklist(V.getNode());
23374 return DAG.getNode(MappedMask[0] == 0 ? X86ISD::UNPCKL
23383 case X86ISD::PSHUFD:
23384 if (SDValue NewN = combineRedundantDWordShuffle(N, Mask, DAG, DCI))
23393 /// \brief Try to combine a shuffle into a target-specific add-sub node.
23395 /// We combine this directly on the abstract vector shuffle nodes so it is
23396 /// easier to generically match. We also insert dummy vector shuffle nodes for
23397 /// the operands which explicitly discard the lanes which are unused by this
23398 /// operation to try to flow through the rest of the combiner the fact that
23399 /// they're unused.
23400 static SDValue combineShuffleToAddSub(SDNode *N, SelectionDAG &DAG) {
23402 EVT VT = N->getValueType(0);
23404 // We only handle target-independent shuffles.
23405 // FIXME: It would be easy and harmless to use the target shuffle mask
23406 // extraction tool to support more.
23407 if (N->getOpcode() != ISD::VECTOR_SHUFFLE)
23410 auto *SVN = cast<ShuffleVectorSDNode>(N);
23411 SmallVector<int, 8> Mask;
23412 for (int M : SVN->getMask())
23415 SDValue V1 = N->getOperand(0);
23416 SDValue V2 = N->getOperand(1);
23418 // We require the first shuffle operand to be the FSUB node, and the second to
23419 // be the FADD node.
23420 if (V1.getOpcode() == ISD::FADD && V2.getOpcode() == ISD::FSUB) {
23421 ShuffleVectorSDNode::commuteMask(Mask);
23423 } else if (V1.getOpcode() != ISD::FSUB || V2.getOpcode() != ISD::FADD)
23426 // If there are other uses of these operations we can't fold them.
23427 if (!V1->hasOneUse() || !V2->hasOneUse())
23430 // Ensure that both operations have the same operands. Note that we can
23431 // commute the FADD operands.
23432 SDValue LHS = V1->getOperand(0), RHS = V1->getOperand(1);
23433 if ((V2->getOperand(0) != LHS || V2->getOperand(1) != RHS) &&
23434 (V2->getOperand(0) != RHS || V2->getOperand(1) != LHS))
23437 // We're looking for blends between FADD and FSUB nodes. We insist on these
23438 // nodes being lined up in a specific expected pattern.
23439 if (!(isShuffleEquivalent(V1, V2, Mask, {0, 3}) ||
23440 isShuffleEquivalent(V1, V2, Mask, {0, 5, 2, 7}) ||
23441 isShuffleEquivalent(V1, V2, Mask, {0, 9, 2, 11, 4, 13, 6, 15})))
23444 // Only specific types are legal at this point, assert so we notice if and
23445 // when these change.
23446 assert((VT == MVT::v4f32 || VT == MVT::v2f64 || VT == MVT::v8f32 ||
23447 VT == MVT::v4f64) &&
23448 "Unknown vector type encountered!");
23450 return DAG.getNode(X86ISD::ADDSUB, DL, VT, LHS, RHS);
23453 /// PerformShuffleCombine - Performs several different shuffle combines.
23454 static SDValue PerformShuffleCombine(SDNode *N, SelectionDAG &DAG,
23455 TargetLowering::DAGCombinerInfo &DCI,
23456 const X86Subtarget *Subtarget) {
23458 SDValue N0 = N->getOperand(0);
23459 SDValue N1 = N->getOperand(1);
23460 EVT VT = N->getValueType(0);
23462 // Don't create instructions with illegal types after legalize types has run.
23463 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
23464 if (!DCI.isBeforeLegalize() && !TLI.isTypeLegal(VT.getVectorElementType()))
23467 // If we have legalized the vector types, look for blends of FADD and FSUB
23468 // nodes that we can fuse into an ADDSUB node.
23469 if (TLI.isTypeLegal(VT) && Subtarget->hasSSE3())
23470 if (SDValue AddSub = combineShuffleToAddSub(N, DAG))
23473 // Combine 256-bit vector shuffles. This is only profitable when in AVX mode
23474 if (TLI.isTypeLegal(VT) && Subtarget->hasFp256() && VT.is256BitVector() &&
23475 N->getOpcode() == ISD::VECTOR_SHUFFLE)
23476 return PerformShuffleCombine256(N, DAG, DCI, Subtarget);
23478 // During Type Legalization, when promoting illegal vector types,
23479 // the backend might introduce new shuffle dag nodes and bitcasts.
23481 // This code performs the following transformation:
23482 // fold: (shuffle (bitcast (BINOP A, B)), Undef, <Mask>) ->
23483 // (shuffle (BINOP (bitcast A), (bitcast B)), Undef, <Mask>)
23485 // We do this only if both the bitcast and the BINOP dag nodes have
23486 // one use. Also, perform this transformation only if the new binary
23487 // operation is legal. This is to avoid introducing dag nodes that
23488 // potentially need to be further expanded (or custom lowered) into a
23489 // less optimal sequence of dag nodes.
23490 if (!DCI.isBeforeLegalize() && DCI.isBeforeLegalizeOps() &&
23491 N1.getOpcode() == ISD::UNDEF && N0.hasOneUse() &&
23492 N0.getOpcode() == ISD::BITCAST) {
23493 SDValue BC0 = N0.getOperand(0);
23494 EVT SVT = BC0.getValueType();
23495 unsigned Opcode = BC0.getOpcode();
23496 unsigned NumElts = VT.getVectorNumElements();
23498 if (BC0.hasOneUse() && SVT.isVector() &&
23499 SVT.getVectorNumElements() * 2 == NumElts &&
23500 TLI.isOperationLegal(Opcode, VT)) {
23501 bool CanFold = false;
23513 unsigned SVTNumElts = SVT.getVectorNumElements();
23514 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(N);
23515 for (unsigned i = 0, e = SVTNumElts; i != e && CanFold; ++i)
23516 CanFold = SVOp->getMaskElt(i) == (int)(i * 2);
23517 for (unsigned i = SVTNumElts, e = NumElts; i != e && CanFold; ++i)
23518 CanFold = SVOp->getMaskElt(i) < 0;
23521 SDValue BC00 = DAG.getBitcast(VT, BC0.getOperand(0));
23522 SDValue BC01 = DAG.getBitcast(VT, BC0.getOperand(1));
23523 SDValue NewBinOp = DAG.getNode(BC0.getOpcode(), dl, VT, BC00, BC01);
23524 return DAG.getVectorShuffle(VT, dl, NewBinOp, N1, &SVOp->getMask()[0]);
23529 // Combine a vector_shuffle that is equal to build_vector load1, load2, load3,
23530 // load4, <0, 1, 2, 3> into a 128-bit load if the load addresses are
23531 // consecutive, non-overlapping, and in the right order.
23532 SmallVector<SDValue, 16> Elts;
23533 for (unsigned i = 0, e = VT.getVectorNumElements(); i != e; ++i)
23534 Elts.push_back(getShuffleScalarElt(N, i, DAG, 0));
23536 if (SDValue LD = EltsFromConsecutiveLoads(VT, Elts, dl, DAG, true))
23539 if (isTargetShuffle(N->getOpcode())) {
23541 PerformTargetShuffleCombine(SDValue(N, 0), DAG, DCI, Subtarget);
23542 if (Shuffle.getNode())
23545 // Try recursively combining arbitrary sequences of x86 shuffle
23546 // instructions into higher-order shuffles. We do this after combining
23547 // specific PSHUF instruction sequences into their minimal form so that we
23548 // can evaluate how many specialized shuffle instructions are involved in
23549 // a particular chain.
23550 SmallVector<int, 1> NonceMask; // Just a placeholder.
23551 NonceMask.push_back(0);
23552 if (combineX86ShufflesRecursively(SDValue(N, 0), SDValue(N, 0), NonceMask,
23553 /*Depth*/ 1, /*HasPSHUFB*/ false, DAG,
23555 return SDValue(); // This routine will use CombineTo to replace N.
23561 /// XFormVExtractWithShuffleIntoLoad - Check if a vector extract from a target
23562 /// specific shuffle of a load can be folded into a single element load.
23563 /// Similar handling for VECTOR_SHUFFLE is performed by DAGCombiner, but
23564 /// shuffles have been custom lowered so we need to handle those here.
23565 static SDValue XFormVExtractWithShuffleIntoLoad(SDNode *N, SelectionDAG &DAG,
23566 TargetLowering::DAGCombinerInfo &DCI) {
23567 if (DCI.isBeforeLegalizeOps())
23570 SDValue InVec = N->getOperand(0);
23571 SDValue EltNo = N->getOperand(1);
23573 if (!isa<ConstantSDNode>(EltNo))
23576 EVT OriginalVT = InVec.getValueType();
23578 if (InVec.getOpcode() == ISD::BITCAST) {
23579 // Don't duplicate a load with other uses.
23580 if (!InVec.hasOneUse())
23582 EVT BCVT = InVec.getOperand(0).getValueType();
23583 if (!BCVT.isVector() ||
23584 BCVT.getVectorNumElements() != OriginalVT.getVectorNumElements())
23586 InVec = InVec.getOperand(0);
23589 EVT CurrentVT = InVec.getValueType();
23591 if (!isTargetShuffle(InVec.getOpcode()))
23594 // Don't duplicate a load with other uses.
23595 if (!InVec.hasOneUse())
23598 SmallVector<int, 16> ShuffleMask;
23600 if (!getTargetShuffleMask(InVec.getNode(), CurrentVT.getSimpleVT(),
23601 ShuffleMask, UnaryShuffle))
23604 // Select the input vector, guarding against out of range extract vector.
23605 unsigned NumElems = CurrentVT.getVectorNumElements();
23606 int Elt = cast<ConstantSDNode>(EltNo)->getZExtValue();
23607 int Idx = (Elt > (int)NumElems) ? -1 : ShuffleMask[Elt];
23608 SDValue LdNode = (Idx < (int)NumElems) ? InVec.getOperand(0)
23609 : InVec.getOperand(1);
23611 // If inputs to shuffle are the same for both ops, then allow 2 uses
23612 unsigned AllowedUses = InVec.getNumOperands() > 1 &&
23613 InVec.getOperand(0) == InVec.getOperand(1) ? 2 : 1;
23615 if (LdNode.getOpcode() == ISD::BITCAST) {
23616 // Don't duplicate a load with other uses.
23617 if (!LdNode.getNode()->hasNUsesOfValue(AllowedUses, 0))
23620 AllowedUses = 1; // only allow 1 load use if we have a bitcast
23621 LdNode = LdNode.getOperand(0);
23624 if (!ISD::isNormalLoad(LdNode.getNode()))
23627 LoadSDNode *LN0 = cast<LoadSDNode>(LdNode);
23629 if (!LN0 ||!LN0->hasNUsesOfValue(AllowedUses, 0) || LN0->isVolatile())
23632 EVT EltVT = N->getValueType(0);
23633 // If there's a bitcast before the shuffle, check if the load type and
23634 // alignment is valid.
23635 unsigned Align = LN0->getAlignment();
23636 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
23637 unsigned NewAlign = DAG.getDataLayout().getABITypeAlignment(
23638 EltVT.getTypeForEVT(*DAG.getContext()));
23640 if (NewAlign > Align || !TLI.isOperationLegalOrCustom(ISD::LOAD, EltVT))
23643 // All checks match so transform back to vector_shuffle so that DAG combiner
23644 // can finish the job
23647 // Create shuffle node taking into account the case that its a unary shuffle
23648 SDValue Shuffle = (UnaryShuffle) ? DAG.getUNDEF(CurrentVT)
23649 : InVec.getOperand(1);
23650 Shuffle = DAG.getVectorShuffle(CurrentVT, dl,
23651 InVec.getOperand(0), Shuffle,
23653 Shuffle = DAG.getBitcast(OriginalVT, Shuffle);
23654 return DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, N->getValueType(0), Shuffle,
23658 static SDValue PerformBITCASTCombine(SDNode *N, SelectionDAG &DAG,
23659 const X86Subtarget *Subtarget) {
23660 SDValue N0 = N->getOperand(0);
23661 EVT VT = N->getValueType(0);
23663 // Detect bitcasts between i32 to x86mmx low word. Since MMX types are
23664 // special and don't usually play with other vector types, it's better to
23665 // handle them early to be sure we emit efficient code by avoiding
23666 // store-load conversions.
23667 if (VT == MVT::x86mmx && N0.getOpcode() == ISD::BUILD_VECTOR &&
23668 N0.getValueType() == MVT::v2i32 &&
23669 isNullConstant(N0.getOperand(1))) {
23670 SDValue N00 = N0->getOperand(0);
23671 if (N00.getValueType() == MVT::i32)
23672 return DAG.getNode(X86ISD::MMX_MOVW2D, SDLoc(N00), VT, N00);
23675 // Convert a bitcasted integer logic operation that has one bitcasted
23676 // floating-point operand and one constant operand into a floating-point
23677 // logic operation. This may create a load of the constant, but that is
23678 // cheaper than materializing the constant in an integer register and
23679 // transferring it to an SSE register or transferring the SSE operand to
23680 // integer register and back.
23682 switch (N0.getOpcode()) {
23683 case ISD::AND: FPOpcode = X86ISD::FAND; break;
23684 case ISD::OR: FPOpcode = X86ISD::FOR; break;
23685 case ISD::XOR: FPOpcode = X86ISD::FXOR; break;
23686 default: return SDValue();
23688 if (((Subtarget->hasSSE1() && VT == MVT::f32) ||
23689 (Subtarget->hasSSE2() && VT == MVT::f64)) &&
23690 isa<ConstantSDNode>(N0.getOperand(1)) &&
23691 N0.getOperand(0).getOpcode() == ISD::BITCAST &&
23692 N0.getOperand(0).getOperand(0).getValueType() == VT) {
23693 SDValue N000 = N0.getOperand(0).getOperand(0);
23694 SDValue FPConst = DAG.getBitcast(VT, N0.getOperand(1));
23695 return DAG.getNode(FPOpcode, SDLoc(N0), VT, N000, FPConst);
23701 /// PerformEXTRACT_VECTOR_ELTCombine - Detect vector gather/scatter index
23702 /// generation and convert it from being a bunch of shuffles and extracts
23703 /// into a somewhat faster sequence. For i686, the best sequence is apparently
23704 /// storing the value and loading scalars back, while for x64 we should
23705 /// use 64-bit extracts and shifts.
23706 static SDValue PerformEXTRACT_VECTOR_ELTCombine(SDNode *N, SelectionDAG &DAG,
23707 TargetLowering::DAGCombinerInfo &DCI) {
23708 if (SDValue NewOp = XFormVExtractWithShuffleIntoLoad(N, DAG, DCI))
23711 SDValue InputVector = N->getOperand(0);
23712 SDLoc dl(InputVector);
23713 // Detect mmx to i32 conversion through a v2i32 elt extract.
23714 if (InputVector.getOpcode() == ISD::BITCAST && InputVector.hasOneUse() &&
23715 N->getValueType(0) == MVT::i32 &&
23716 InputVector.getValueType() == MVT::v2i32) {
23718 // The bitcast source is a direct mmx result.
23719 SDValue MMXSrc = InputVector.getNode()->getOperand(0);
23720 if (MMXSrc.getValueType() == MVT::x86mmx)
23721 return DAG.getNode(X86ISD::MMX_MOVD2W, SDLoc(InputVector),
23722 N->getValueType(0),
23723 InputVector.getNode()->getOperand(0));
23725 // The mmx is indirect: (i64 extract_elt (v1i64 bitcast (x86mmx ...))).
23726 if (MMXSrc.getOpcode() == ISD::EXTRACT_VECTOR_ELT && MMXSrc.hasOneUse() &&
23727 MMXSrc.getValueType() == MVT::i64) {
23728 SDValue MMXSrcOp = MMXSrc.getOperand(0);
23729 if (MMXSrcOp.hasOneUse() && MMXSrcOp.getOpcode() == ISD::BITCAST &&
23730 MMXSrcOp.getValueType() == MVT::v1i64 &&
23731 MMXSrcOp.getOperand(0).getValueType() == MVT::x86mmx)
23732 return DAG.getNode(X86ISD::MMX_MOVD2W, SDLoc(InputVector),
23733 N->getValueType(0), MMXSrcOp.getOperand(0));
23737 EVT VT = N->getValueType(0);
23739 if (VT == MVT::i1 && isa<ConstantSDNode>(N->getOperand(1)) &&
23740 InputVector.getOpcode() == ISD::BITCAST &&
23741 isa<ConstantSDNode>(InputVector.getOperand(0))) {
23742 uint64_t ExtractedElt =
23743 cast<ConstantSDNode>(N->getOperand(1))->getZExtValue();
23744 uint64_t InputValue =
23745 cast<ConstantSDNode>(InputVector.getOperand(0))->getZExtValue();
23746 uint64_t Res = (InputValue >> ExtractedElt) & 1;
23747 return DAG.getConstant(Res, dl, MVT::i1);
23749 // Only operate on vectors of 4 elements, where the alternative shuffling
23750 // gets to be more expensive.
23751 if (InputVector.getValueType() != MVT::v4i32)
23754 // Check whether every use of InputVector is an EXTRACT_VECTOR_ELT with a
23755 // single use which is a sign-extend or zero-extend, and all elements are
23757 SmallVector<SDNode *, 4> Uses;
23758 unsigned ExtractedElements = 0;
23759 for (SDNode::use_iterator UI = InputVector.getNode()->use_begin(),
23760 UE = InputVector.getNode()->use_end(); UI != UE; ++UI) {
23761 if (UI.getUse().getResNo() != InputVector.getResNo())
23764 SDNode *Extract = *UI;
23765 if (Extract->getOpcode() != ISD::EXTRACT_VECTOR_ELT)
23768 if (Extract->getValueType(0) != MVT::i32)
23770 if (!Extract->hasOneUse())
23772 if (Extract->use_begin()->getOpcode() != ISD::SIGN_EXTEND &&
23773 Extract->use_begin()->getOpcode() != ISD::ZERO_EXTEND)
23775 if (!isa<ConstantSDNode>(Extract->getOperand(1)))
23778 // Record which element was extracted.
23779 ExtractedElements |=
23780 1 << cast<ConstantSDNode>(Extract->getOperand(1))->getZExtValue();
23782 Uses.push_back(Extract);
23785 // If not all the elements were used, this may not be worthwhile.
23786 if (ExtractedElements != 15)
23789 // Ok, we've now decided to do the transformation.
23790 // If 64-bit shifts are legal, use the extract-shift sequence,
23791 // otherwise bounce the vector off the cache.
23792 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
23795 if (TLI.isOperationLegal(ISD::SRA, MVT::i64)) {
23796 SDValue Cst = DAG.getBitcast(MVT::v2i64, InputVector);
23797 auto &DL = DAG.getDataLayout();
23798 EVT VecIdxTy = DAG.getTargetLoweringInfo().getVectorIdxTy(DL);
23799 SDValue BottomHalf = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::i64, Cst,
23800 DAG.getConstant(0, dl, VecIdxTy));
23801 SDValue TopHalf = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::i64, Cst,
23802 DAG.getConstant(1, dl, VecIdxTy));
23804 SDValue ShAmt = DAG.getConstant(
23805 32, dl, DAG.getTargetLoweringInfo().getShiftAmountTy(MVT::i64, DL));
23806 Vals[0] = DAG.getNode(ISD::TRUNCATE, dl, MVT::i32, BottomHalf);
23807 Vals[1] = DAG.getNode(ISD::TRUNCATE, dl, MVT::i32,
23808 DAG.getNode(ISD::SRA, dl, MVT::i64, BottomHalf, ShAmt));
23809 Vals[2] = DAG.getNode(ISD::TRUNCATE, dl, MVT::i32, TopHalf);
23810 Vals[3] = DAG.getNode(ISD::TRUNCATE, dl, MVT::i32,
23811 DAG.getNode(ISD::SRA, dl, MVT::i64, TopHalf, ShAmt));
23813 // Store the value to a temporary stack slot.
23814 SDValue StackPtr = DAG.CreateStackTemporary(InputVector.getValueType());
23815 SDValue Ch = DAG.getStore(DAG.getEntryNode(), dl, InputVector, StackPtr,
23816 MachinePointerInfo(), false, false, 0);
23818 EVT ElementType = InputVector.getValueType().getVectorElementType();
23819 unsigned EltSize = ElementType.getSizeInBits() / 8;
23821 // Replace each use (extract) with a load of the appropriate element.
23822 for (unsigned i = 0; i < 4; ++i) {
23823 uint64_t Offset = EltSize * i;
23824 auto PtrVT = TLI.getPointerTy(DAG.getDataLayout());
23825 SDValue OffsetVal = DAG.getConstant(Offset, dl, PtrVT);
23827 SDValue ScalarAddr =
23828 DAG.getNode(ISD::ADD, dl, PtrVT, StackPtr, OffsetVal);
23830 // Load the scalar.
23831 Vals[i] = DAG.getLoad(ElementType, dl, Ch,
23832 ScalarAddr, MachinePointerInfo(),
23833 false, false, false, 0);
23838 // Replace the extracts
23839 for (SmallVectorImpl<SDNode *>::iterator UI = Uses.begin(),
23840 UE = Uses.end(); UI != UE; ++UI) {
23841 SDNode *Extract = *UI;
23843 SDValue Idx = Extract->getOperand(1);
23844 uint64_t IdxVal = cast<ConstantSDNode>(Idx)->getZExtValue();
23845 DAG.ReplaceAllUsesOfValueWith(SDValue(Extract, 0), Vals[IdxVal]);
23848 // The replacement was made in place; don't return anything.
23853 transformVSELECTtoBlendVECTOR_SHUFFLE(SDNode *N, SelectionDAG &DAG,
23854 const X86Subtarget *Subtarget) {
23856 SDValue Cond = N->getOperand(0);
23857 SDValue LHS = N->getOperand(1);
23858 SDValue RHS = N->getOperand(2);
23860 if (Cond.getOpcode() == ISD::SIGN_EXTEND) {
23861 SDValue CondSrc = Cond->getOperand(0);
23862 if (CondSrc->getOpcode() == ISD::SIGN_EXTEND_INREG)
23863 Cond = CondSrc->getOperand(0);
23866 if (!ISD::isBuildVectorOfConstantSDNodes(Cond.getNode()))
23869 // A vselect where all conditions and data are constants can be optimized into
23870 // a single vector load by SelectionDAGLegalize::ExpandBUILD_VECTOR().
23871 if (ISD::isBuildVectorOfConstantSDNodes(LHS.getNode()) &&
23872 ISD::isBuildVectorOfConstantSDNodes(RHS.getNode()))
23875 unsigned MaskValue = 0;
23876 if (!BUILD_VECTORtoBlendMask(cast<BuildVectorSDNode>(Cond), MaskValue))
23879 MVT VT = N->getSimpleValueType(0);
23880 unsigned NumElems = VT.getVectorNumElements();
23881 SmallVector<int, 8> ShuffleMask(NumElems, -1);
23882 for (unsigned i = 0; i < NumElems; ++i) {
23883 // Be sure we emit undef where we can.
23884 if (Cond.getOperand(i)->getOpcode() == ISD::UNDEF)
23885 ShuffleMask[i] = -1;
23887 ShuffleMask[i] = i + NumElems * ((MaskValue >> i) & 1);
23890 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
23891 if (!TLI.isShuffleMaskLegal(ShuffleMask, VT))
23893 return DAG.getVectorShuffle(VT, dl, LHS, RHS, &ShuffleMask[0]);
23896 /// PerformSELECTCombine - Do target-specific dag combines on SELECT and VSELECT
23898 static SDValue PerformSELECTCombine(SDNode *N, SelectionDAG &DAG,
23899 TargetLowering::DAGCombinerInfo &DCI,
23900 const X86Subtarget *Subtarget) {
23902 SDValue Cond = N->getOperand(0);
23903 // Get the LHS/RHS of the select.
23904 SDValue LHS = N->getOperand(1);
23905 SDValue RHS = N->getOperand(2);
23906 EVT VT = LHS.getValueType();
23907 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
23909 // If we have SSE[12] support, try to form min/max nodes. SSE min/max
23910 // instructions match the semantics of the common C idiom x<y?x:y but not
23911 // x<=y?x:y, because of how they handle negative zero (which can be
23912 // ignored in unsafe-math mode).
23913 // We also try to create v2f32 min/max nodes, which we later widen to v4f32.
23914 if (Cond.getOpcode() == ISD::SETCC && VT.isFloatingPoint() &&
23915 VT != MVT::f80 && VT != MVT::f128 &&
23916 (TLI.isTypeLegal(VT) || VT == MVT::v2f32) &&
23917 (Subtarget->hasSSE2() ||
23918 (Subtarget->hasSSE1() && VT.getScalarType() == MVT::f32))) {
23919 ISD::CondCode CC = cast<CondCodeSDNode>(Cond.getOperand(2))->get();
23921 unsigned Opcode = 0;
23922 // Check for x CC y ? x : y.
23923 if (DAG.isEqualTo(LHS, Cond.getOperand(0)) &&
23924 DAG.isEqualTo(RHS, Cond.getOperand(1))) {
23928 // Converting this to a min would handle NaNs incorrectly, and swapping
23929 // the operands would cause it to handle comparisons between positive
23930 // and negative zero incorrectly.
23931 if (!DAG.isKnownNeverNaN(LHS) || !DAG.isKnownNeverNaN(RHS)) {
23932 if (!DAG.getTarget().Options.UnsafeFPMath &&
23933 !(DAG.isKnownNeverZero(LHS) || DAG.isKnownNeverZero(RHS)))
23935 std::swap(LHS, RHS);
23937 Opcode = X86ISD::FMIN;
23940 // Converting this to a min would handle comparisons between positive
23941 // and negative zero incorrectly.
23942 if (!DAG.getTarget().Options.UnsafeFPMath &&
23943 !DAG.isKnownNeverZero(LHS) && !DAG.isKnownNeverZero(RHS))
23945 Opcode = X86ISD::FMIN;
23948 // Converting this to a min would handle both negative zeros and NaNs
23949 // incorrectly, but we can swap the operands to fix both.
23950 std::swap(LHS, RHS);
23954 Opcode = X86ISD::FMIN;
23958 // Converting this to a max would handle comparisons between positive
23959 // and negative zero incorrectly.
23960 if (!DAG.getTarget().Options.UnsafeFPMath &&
23961 !DAG.isKnownNeverZero(LHS) && !DAG.isKnownNeverZero(RHS))
23963 Opcode = X86ISD::FMAX;
23966 // Converting this to a max would handle NaNs incorrectly, and swapping
23967 // the operands would cause it to handle comparisons between positive
23968 // and negative zero incorrectly.
23969 if (!DAG.isKnownNeverNaN(LHS) || !DAG.isKnownNeverNaN(RHS)) {
23970 if (!DAG.getTarget().Options.UnsafeFPMath &&
23971 !(DAG.isKnownNeverZero(LHS) || DAG.isKnownNeverZero(RHS)))
23973 std::swap(LHS, RHS);
23975 Opcode = X86ISD::FMAX;
23978 // Converting this to a max would handle both negative zeros and NaNs
23979 // incorrectly, but we can swap the operands to fix both.
23980 std::swap(LHS, RHS);
23984 Opcode = X86ISD::FMAX;
23987 // Check for x CC y ? y : x -- a min/max with reversed arms.
23988 } else if (DAG.isEqualTo(LHS, Cond.getOperand(1)) &&
23989 DAG.isEqualTo(RHS, Cond.getOperand(0))) {
23993 // Converting this to a min would handle comparisons between positive
23994 // and negative zero incorrectly, and swapping the operands would
23995 // cause it to handle NaNs incorrectly.
23996 if (!DAG.getTarget().Options.UnsafeFPMath &&
23997 !(DAG.isKnownNeverZero(LHS) || DAG.isKnownNeverZero(RHS))) {
23998 if (!DAG.isKnownNeverNaN(LHS) || !DAG.isKnownNeverNaN(RHS))
24000 std::swap(LHS, RHS);
24002 Opcode = X86ISD::FMIN;
24005 // Converting this to a min would handle NaNs incorrectly.
24006 if (!DAG.getTarget().Options.UnsafeFPMath &&
24007 (!DAG.isKnownNeverNaN(LHS) || !DAG.isKnownNeverNaN(RHS)))
24009 Opcode = X86ISD::FMIN;
24012 // Converting this to a min would handle both negative zeros and NaNs
24013 // incorrectly, but we can swap the operands to fix both.
24014 std::swap(LHS, RHS);
24018 Opcode = X86ISD::FMIN;
24022 // Converting this to a max would handle NaNs incorrectly.
24023 if (!DAG.isKnownNeverNaN(LHS) || !DAG.isKnownNeverNaN(RHS))
24025 Opcode = X86ISD::FMAX;
24028 // Converting this to a max would handle comparisons between positive
24029 // and negative zero incorrectly, and swapping the operands would
24030 // cause it to handle NaNs incorrectly.
24031 if (!DAG.getTarget().Options.UnsafeFPMath &&
24032 !DAG.isKnownNeverZero(LHS) && !DAG.isKnownNeverZero(RHS)) {
24033 if (!DAG.isKnownNeverNaN(LHS) || !DAG.isKnownNeverNaN(RHS))
24035 std::swap(LHS, RHS);
24037 Opcode = X86ISD::FMAX;
24040 // Converting this to a max would handle both negative zeros and NaNs
24041 // incorrectly, but we can swap the operands to fix both.
24042 std::swap(LHS, RHS);
24046 Opcode = X86ISD::FMAX;
24052 return DAG.getNode(Opcode, DL, N->getValueType(0), LHS, RHS);
24055 EVT CondVT = Cond.getValueType();
24056 if (Subtarget->hasAVX512() && VT.isVector() && CondVT.isVector() &&
24057 CondVT.getVectorElementType() == MVT::i1) {
24058 // v16i8 (select v16i1, v16i8, v16i8) does not have a proper
24059 // lowering on KNL. In this case we convert it to
24060 // v16i8 (select v16i8, v16i8, v16i8) and use AVX instruction.
24061 // The same situation for all 128 and 256-bit vectors of i8 and i16.
24062 // Since SKX these selects have a proper lowering.
24063 EVT OpVT = LHS.getValueType();
24064 if ((OpVT.is128BitVector() || OpVT.is256BitVector()) &&
24065 (OpVT.getVectorElementType() == MVT::i8 ||
24066 OpVT.getVectorElementType() == MVT::i16) &&
24067 !(Subtarget->hasBWI() && Subtarget->hasVLX())) {
24068 Cond = DAG.getNode(ISD::SIGN_EXTEND, DL, OpVT, Cond);
24069 DCI.AddToWorklist(Cond.getNode());
24070 return DAG.getNode(N->getOpcode(), DL, OpVT, Cond, LHS, RHS);
24073 // If this is a select between two integer constants, try to do some
24075 if (ConstantSDNode *TrueC = dyn_cast<ConstantSDNode>(LHS)) {
24076 if (ConstantSDNode *FalseC = dyn_cast<ConstantSDNode>(RHS))
24077 // Don't do this for crazy integer types.
24078 if (DAG.getTargetLoweringInfo().isTypeLegal(LHS.getValueType())) {
24079 // If this is efficiently invertible, canonicalize the LHSC/RHSC values
24080 // so that TrueC (the true value) is larger than FalseC.
24081 bool NeedsCondInvert = false;
24083 if (TrueC->getAPIntValue().ult(FalseC->getAPIntValue()) &&
24084 // Efficiently invertible.
24085 (Cond.getOpcode() == ISD::SETCC || // setcc -> invertible.
24086 (Cond.getOpcode() == ISD::XOR && // xor(X, C) -> invertible.
24087 isa<ConstantSDNode>(Cond.getOperand(1))))) {
24088 NeedsCondInvert = true;
24089 std::swap(TrueC, FalseC);
24092 // Optimize C ? 8 : 0 -> zext(C) << 3. Likewise for any pow2/0.
24093 if (FalseC->getAPIntValue() == 0 &&
24094 TrueC->getAPIntValue().isPowerOf2()) {
24095 if (NeedsCondInvert) // Invert the condition if needed.
24096 Cond = DAG.getNode(ISD::XOR, DL, Cond.getValueType(), Cond,
24097 DAG.getConstant(1, DL, Cond.getValueType()));
24099 // Zero extend the condition if needed.
24100 Cond = DAG.getNode(ISD::ZERO_EXTEND, DL, LHS.getValueType(), Cond);
24102 unsigned ShAmt = TrueC->getAPIntValue().logBase2();
24103 return DAG.getNode(ISD::SHL, DL, LHS.getValueType(), Cond,
24104 DAG.getConstant(ShAmt, DL, MVT::i8));
24107 // Optimize Cond ? cst+1 : cst -> zext(setcc(C)+cst.
24108 if (FalseC->getAPIntValue()+1 == TrueC->getAPIntValue()) {
24109 if (NeedsCondInvert) // Invert the condition if needed.
24110 Cond = DAG.getNode(ISD::XOR, DL, Cond.getValueType(), Cond,
24111 DAG.getConstant(1, DL, Cond.getValueType()));
24113 // Zero extend the condition if needed.
24114 Cond = DAG.getNode(ISD::ZERO_EXTEND, DL,
24115 FalseC->getValueType(0), Cond);
24116 return DAG.getNode(ISD::ADD, DL, Cond.getValueType(), Cond,
24117 SDValue(FalseC, 0));
24120 // Optimize cases that will turn into an LEA instruction. This requires
24121 // an i32 or i64 and an efficient multiplier (1, 2, 3, 4, 5, 8, 9).
24122 if (N->getValueType(0) == MVT::i32 || N->getValueType(0) == MVT::i64) {
24123 uint64_t Diff = TrueC->getZExtValue()-FalseC->getZExtValue();
24124 if (N->getValueType(0) == MVT::i32) Diff = (unsigned)Diff;
24126 bool isFastMultiplier = false;
24128 switch ((unsigned char)Diff) {
24130 case 1: // result = add base, cond
24131 case 2: // result = lea base( , cond*2)
24132 case 3: // result = lea base(cond, cond*2)
24133 case 4: // result = lea base( , cond*4)
24134 case 5: // result = lea base(cond, cond*4)
24135 case 8: // result = lea base( , cond*8)
24136 case 9: // result = lea base(cond, cond*8)
24137 isFastMultiplier = true;
24142 if (isFastMultiplier) {
24143 APInt Diff = TrueC->getAPIntValue()-FalseC->getAPIntValue();
24144 if (NeedsCondInvert) // Invert the condition if needed.
24145 Cond = DAG.getNode(ISD::XOR, DL, Cond.getValueType(), Cond,
24146 DAG.getConstant(1, DL, Cond.getValueType()));
24148 // Zero extend the condition if needed.
24149 Cond = DAG.getNode(ISD::ZERO_EXTEND, DL, FalseC->getValueType(0),
24151 // Scale the condition by the difference.
24153 Cond = DAG.getNode(ISD::MUL, DL, Cond.getValueType(), Cond,
24154 DAG.getConstant(Diff, DL,
24155 Cond.getValueType()));
24157 // Add the base if non-zero.
24158 if (FalseC->getAPIntValue() != 0)
24159 Cond = DAG.getNode(ISD::ADD, DL, Cond.getValueType(), Cond,
24160 SDValue(FalseC, 0));
24167 // Canonicalize max and min:
24168 // (x > y) ? x : y -> (x >= y) ? x : y
24169 // (x < y) ? x : y -> (x <= y) ? x : y
24170 // This allows use of COND_S / COND_NS (see TranslateX86CC) which eliminates
24171 // the need for an extra compare
24172 // against zero. e.g.
24173 // (x - y) > 0 : (x - y) ? 0 -> (x - y) >= 0 : (x - y) ? 0
24175 // testl %edi, %edi
24177 // cmovgl %edi, %eax
24181 // cmovsl %eax, %edi
24182 if (N->getOpcode() == ISD::SELECT && Cond.getOpcode() == ISD::SETCC &&
24183 DAG.isEqualTo(LHS, Cond.getOperand(0)) &&
24184 DAG.isEqualTo(RHS, Cond.getOperand(1))) {
24185 ISD::CondCode CC = cast<CondCodeSDNode>(Cond.getOperand(2))->get();
24190 ISD::CondCode NewCC = (CC == ISD::SETLT) ? ISD::SETLE : ISD::SETGE;
24191 Cond = DAG.getSetCC(SDLoc(Cond), Cond.getValueType(),
24192 Cond.getOperand(0), Cond.getOperand(1), NewCC);
24193 return DAG.getNode(ISD::SELECT, DL, VT, Cond, LHS, RHS);
24198 // Early exit check
24199 if (!TLI.isTypeLegal(VT))
24202 // Match VSELECTs into subs with unsigned saturation.
24203 if (N->getOpcode() == ISD::VSELECT && Cond.getOpcode() == ISD::SETCC &&
24204 // psubus is available in SSE2 and AVX2 for i8 and i16 vectors.
24205 ((Subtarget->hasSSE2() && (VT == MVT::v16i8 || VT == MVT::v8i16)) ||
24206 (Subtarget->hasAVX2() && (VT == MVT::v32i8 || VT == MVT::v16i16)))) {
24207 ISD::CondCode CC = cast<CondCodeSDNode>(Cond.getOperand(2))->get();
24209 // Check if one of the arms of the VSELECT is a zero vector. If it's on the
24210 // left side invert the predicate to simplify logic below.
24212 if (ISD::isBuildVectorAllZeros(LHS.getNode())) {
24214 CC = ISD::getSetCCInverse(CC, true);
24215 } else if (ISD::isBuildVectorAllZeros(RHS.getNode())) {
24219 if (Other.getNode() && Other->getNumOperands() == 2 &&
24220 DAG.isEqualTo(Other->getOperand(0), Cond.getOperand(0))) {
24221 SDValue OpLHS = Other->getOperand(0), OpRHS = Other->getOperand(1);
24222 SDValue CondRHS = Cond->getOperand(1);
24224 // Look for a general sub with unsigned saturation first.
24225 // x >= y ? x-y : 0 --> subus x, y
24226 // x > y ? x-y : 0 --> subus x, y
24227 if ((CC == ISD::SETUGE || CC == ISD::SETUGT) &&
24228 Other->getOpcode() == ISD::SUB && DAG.isEqualTo(OpRHS, CondRHS))
24229 return DAG.getNode(X86ISD::SUBUS, DL, VT, OpLHS, OpRHS);
24231 if (auto *OpRHSBV = dyn_cast<BuildVectorSDNode>(OpRHS))
24232 if (auto *OpRHSConst = OpRHSBV->getConstantSplatNode()) {
24233 if (auto *CondRHSBV = dyn_cast<BuildVectorSDNode>(CondRHS))
24234 if (auto *CondRHSConst = CondRHSBV->getConstantSplatNode())
24235 // If the RHS is a constant we have to reverse the const
24236 // canonicalization.
24237 // x > C-1 ? x+-C : 0 --> subus x, C
24238 if (CC == ISD::SETUGT && Other->getOpcode() == ISD::ADD &&
24239 CondRHSConst->getAPIntValue() ==
24240 (-OpRHSConst->getAPIntValue() - 1))
24241 return DAG.getNode(
24242 X86ISD::SUBUS, DL, VT, OpLHS,
24243 DAG.getConstant(-OpRHSConst->getAPIntValue(), DL, VT));
24245 // Another special case: If C was a sign bit, the sub has been
24246 // canonicalized into a xor.
24247 // FIXME: Would it be better to use computeKnownBits to determine
24248 // whether it's safe to decanonicalize the xor?
24249 // x s< 0 ? x^C : 0 --> subus x, C
24250 if (CC == ISD::SETLT && Other->getOpcode() == ISD::XOR &&
24251 ISD::isBuildVectorAllZeros(CondRHS.getNode()) &&
24252 OpRHSConst->getAPIntValue().isSignBit())
24253 // Note that we have to rebuild the RHS constant here to ensure we
24254 // don't rely on particular values of undef lanes.
24255 return DAG.getNode(
24256 X86ISD::SUBUS, DL, VT, OpLHS,
24257 DAG.getConstant(OpRHSConst->getAPIntValue(), DL, VT));
24262 // Simplify vector selection if condition value type matches vselect
24264 if (N->getOpcode() == ISD::VSELECT && CondVT == VT) {
24265 assert(Cond.getValueType().isVector() &&
24266 "vector select expects a vector selector!");
24268 bool TValIsAllOnes = ISD::isBuildVectorAllOnes(LHS.getNode());
24269 bool FValIsAllZeros = ISD::isBuildVectorAllZeros(RHS.getNode());
24271 // Try invert the condition if true value is not all 1s and false value
24273 if (!TValIsAllOnes && !FValIsAllZeros &&
24274 // Check if the selector will be produced by CMPP*/PCMP*
24275 Cond.getOpcode() == ISD::SETCC &&
24276 // Check if SETCC has already been promoted
24277 TLI.getSetCCResultType(DAG.getDataLayout(), *DAG.getContext(), VT) ==
24279 bool TValIsAllZeros = ISD::isBuildVectorAllZeros(LHS.getNode());
24280 bool FValIsAllOnes = ISD::isBuildVectorAllOnes(RHS.getNode());
24282 if (TValIsAllZeros || FValIsAllOnes) {
24283 SDValue CC = Cond.getOperand(2);
24284 ISD::CondCode NewCC =
24285 ISD::getSetCCInverse(cast<CondCodeSDNode>(CC)->get(),
24286 Cond.getOperand(0).getValueType().isInteger());
24287 Cond = DAG.getSetCC(DL, CondVT, Cond.getOperand(0), Cond.getOperand(1), NewCC);
24288 std::swap(LHS, RHS);
24289 TValIsAllOnes = FValIsAllOnes;
24290 FValIsAllZeros = TValIsAllZeros;
24294 if (TValIsAllOnes || FValIsAllZeros) {
24297 if (TValIsAllOnes && FValIsAllZeros)
24299 else if (TValIsAllOnes)
24301 DAG.getNode(ISD::OR, DL, CondVT, Cond, DAG.getBitcast(CondVT, RHS));
24302 else if (FValIsAllZeros)
24303 Ret = DAG.getNode(ISD::AND, DL, CondVT, Cond,
24304 DAG.getBitcast(CondVT, LHS));
24306 return DAG.getBitcast(VT, Ret);
24310 // We should generate an X86ISD::BLENDI from a vselect if its argument
24311 // is a sign_extend_inreg of an any_extend of a BUILD_VECTOR of
24312 // constants. This specific pattern gets generated when we split a
24313 // selector for a 512 bit vector in a machine without AVX512 (but with
24314 // 256-bit vectors), during legalization:
24316 // (vselect (sign_extend (any_extend (BUILD_VECTOR)) i1) LHS RHS)
24318 // Iff we find this pattern and the build_vectors are built from
24319 // constants, we translate the vselect into a shuffle_vector that we
24320 // know will be matched by LowerVECTOR_SHUFFLEtoBlend.
24321 if ((N->getOpcode() == ISD::VSELECT ||
24322 N->getOpcode() == X86ISD::SHRUNKBLEND) &&
24323 !DCI.isBeforeLegalize() && !VT.is512BitVector()) {
24324 SDValue Shuffle = transformVSELECTtoBlendVECTOR_SHUFFLE(N, DAG, Subtarget);
24325 if (Shuffle.getNode())
24329 // If this is a *dynamic* select (non-constant condition) and we can match
24330 // this node with one of the variable blend instructions, restructure the
24331 // condition so that the blends can use the high bit of each element and use
24332 // SimplifyDemandedBits to simplify the condition operand.
24333 if (N->getOpcode() == ISD::VSELECT && DCI.isBeforeLegalizeOps() &&
24334 !DCI.isBeforeLegalize() &&
24335 !ISD::isBuildVectorOfConstantSDNodes(Cond.getNode())) {
24336 unsigned BitWidth = Cond.getValueType().getScalarSizeInBits();
24338 // Don't optimize vector selects that map to mask-registers.
24342 // We can only handle the cases where VSELECT is directly legal on the
24343 // subtarget. We custom lower VSELECT nodes with constant conditions and
24344 // this makes it hard to see whether a dynamic VSELECT will correctly
24345 // lower, so we both check the operation's status and explicitly handle the
24346 // cases where a *dynamic* blend will fail even though a constant-condition
24347 // blend could be custom lowered.
24348 // FIXME: We should find a better way to handle this class of problems.
24349 // Potentially, we should combine constant-condition vselect nodes
24350 // pre-legalization into shuffles and not mark as many types as custom
24352 if (!TLI.isOperationLegalOrCustom(ISD::VSELECT, VT))
24354 // FIXME: We don't support i16-element blends currently. We could and
24355 // should support them by making *all* the bits in the condition be set
24356 // rather than just the high bit and using an i8-element blend.
24357 if (VT.getVectorElementType() == MVT::i16)
24359 // Dynamic blending was only available from SSE4.1 onward.
24360 if (VT.is128BitVector() && !Subtarget->hasSSE41())
24362 // Byte blends are only available in AVX2
24363 if (VT == MVT::v32i8 && !Subtarget->hasAVX2())
24366 assert(BitWidth >= 8 && BitWidth <= 64 && "Invalid mask size");
24367 APInt DemandedMask = APInt::getHighBitsSet(BitWidth, 1);
24369 APInt KnownZero, KnownOne;
24370 TargetLowering::TargetLoweringOpt TLO(DAG, DCI.isBeforeLegalize(),
24371 DCI.isBeforeLegalizeOps());
24372 if (TLO.ShrinkDemandedConstant(Cond, DemandedMask) ||
24373 TLI.SimplifyDemandedBits(Cond, DemandedMask, KnownZero, KnownOne,
24375 // If we changed the computation somewhere in the DAG, this change
24376 // will affect all users of Cond.
24377 // Make sure it is fine and update all the nodes so that we do not
24378 // use the generic VSELECT anymore. Otherwise, we may perform
24379 // wrong optimizations as we messed up with the actual expectation
24380 // for the vector boolean values.
24381 if (Cond != TLO.Old) {
24382 // Check all uses of that condition operand to check whether it will be
24383 // consumed by non-BLEND instructions, which may depend on all bits are
24385 for (SDNode::use_iterator I = Cond->use_begin(), E = Cond->use_end();
24387 if (I->getOpcode() != ISD::VSELECT)
24388 // TODO: Add other opcodes eventually lowered into BLEND.
24391 // Update all the users of the condition, before committing the change,
24392 // so that the VSELECT optimizations that expect the correct vector
24393 // boolean value will not be triggered.
24394 for (SDNode::use_iterator I = Cond->use_begin(), E = Cond->use_end();
24396 DAG.ReplaceAllUsesOfValueWith(
24398 DAG.getNode(X86ISD::SHRUNKBLEND, SDLoc(*I), I->getValueType(0),
24399 Cond, I->getOperand(1), I->getOperand(2)));
24400 DCI.CommitTargetLoweringOpt(TLO);
24403 // At this point, only Cond is changed. Change the condition
24404 // just for N to keep the opportunity to optimize all other
24405 // users their own way.
24406 DAG.ReplaceAllUsesOfValueWith(
24408 DAG.getNode(X86ISD::SHRUNKBLEND, SDLoc(N), N->getValueType(0),
24409 TLO.New, N->getOperand(1), N->getOperand(2)));
24417 // Check whether a boolean test is testing a boolean value generated by
24418 // X86ISD::SETCC. If so, return the operand of that SETCC and proper condition
24421 // Simplify the following patterns:
24422 // (Op (CMP (SETCC Cond EFLAGS) 1) EQ) or
24423 // (Op (CMP (SETCC Cond EFLAGS) 0) NEQ)
24424 // to (Op EFLAGS Cond)
24426 // (Op (CMP (SETCC Cond EFLAGS) 0) EQ) or
24427 // (Op (CMP (SETCC Cond EFLAGS) 1) NEQ)
24428 // to (Op EFLAGS !Cond)
24430 // where Op could be BRCOND or CMOV.
24432 static SDValue checkBoolTestSetCCCombine(SDValue Cmp, X86::CondCode &CC) {
24433 // Quit if not CMP and SUB with its value result used.
24434 if (Cmp.getOpcode() != X86ISD::CMP &&
24435 (Cmp.getOpcode() != X86ISD::SUB || Cmp.getNode()->hasAnyUseOfValue(0)))
24438 // Quit if not used as a boolean value.
24439 if (CC != X86::COND_E && CC != X86::COND_NE)
24442 // Check CMP operands. One of them should be 0 or 1 and the other should be
24443 // an SetCC or extended from it.
24444 SDValue Op1 = Cmp.getOperand(0);
24445 SDValue Op2 = Cmp.getOperand(1);
24448 const ConstantSDNode* C = nullptr;
24449 bool needOppositeCond = (CC == X86::COND_E);
24450 bool checkAgainstTrue = false; // Is it a comparison against 1?
24452 if ((C = dyn_cast<ConstantSDNode>(Op1)))
24454 else if ((C = dyn_cast<ConstantSDNode>(Op2)))
24456 else // Quit if all operands are not constants.
24459 if (C->getZExtValue() == 1) {
24460 needOppositeCond = !needOppositeCond;
24461 checkAgainstTrue = true;
24462 } else if (C->getZExtValue() != 0)
24463 // Quit if the constant is neither 0 or 1.
24466 bool truncatedToBoolWithAnd = false;
24467 // Skip (zext $x), (trunc $x), or (and $x, 1) node.
24468 while (SetCC.getOpcode() == ISD::ZERO_EXTEND ||
24469 SetCC.getOpcode() == ISD::TRUNCATE ||
24470 SetCC.getOpcode() == ISD::AND) {
24471 if (SetCC.getOpcode() == ISD::AND) {
24473 if (isOneConstant(SetCC.getOperand(0)))
24475 if (isOneConstant(SetCC.getOperand(1)))
24479 SetCC = SetCC.getOperand(OpIdx);
24480 truncatedToBoolWithAnd = true;
24482 SetCC = SetCC.getOperand(0);
24485 switch (SetCC.getOpcode()) {
24486 case X86ISD::SETCC_CARRY:
24487 // Since SETCC_CARRY gives output based on R = CF ? ~0 : 0, it's unsafe to
24488 // simplify it if the result of SETCC_CARRY is not canonicalized to 0 or 1,
24489 // i.e. it's a comparison against true but the result of SETCC_CARRY is not
24490 // truncated to i1 using 'and'.
24491 if (checkAgainstTrue && !truncatedToBoolWithAnd)
24493 assert(X86::CondCode(SetCC.getConstantOperandVal(0)) == X86::COND_B &&
24494 "Invalid use of SETCC_CARRY!");
24496 case X86ISD::SETCC:
24497 // Set the condition code or opposite one if necessary.
24498 CC = X86::CondCode(SetCC.getConstantOperandVal(0));
24499 if (needOppositeCond)
24500 CC = X86::GetOppositeBranchCondition(CC);
24501 return SetCC.getOperand(1);
24502 case X86ISD::CMOV: {
24503 // Check whether false/true value has canonical one, i.e. 0 or 1.
24504 ConstantSDNode *FVal = dyn_cast<ConstantSDNode>(SetCC.getOperand(0));
24505 ConstantSDNode *TVal = dyn_cast<ConstantSDNode>(SetCC.getOperand(1));
24506 // Quit if true value is not a constant.
24509 // Quit if false value is not a constant.
24511 SDValue Op = SetCC.getOperand(0);
24512 // Skip 'zext' or 'trunc' node.
24513 if (Op.getOpcode() == ISD::ZERO_EXTEND ||
24514 Op.getOpcode() == ISD::TRUNCATE)
24515 Op = Op.getOperand(0);
24516 // A special case for rdrand/rdseed, where 0 is set if false cond is
24518 if ((Op.getOpcode() != X86ISD::RDRAND &&
24519 Op.getOpcode() != X86ISD::RDSEED) || Op.getResNo() != 0)
24522 // Quit if false value is not the constant 0 or 1.
24523 bool FValIsFalse = true;
24524 if (FVal && FVal->getZExtValue() != 0) {
24525 if (FVal->getZExtValue() != 1)
24527 // If FVal is 1, opposite cond is needed.
24528 needOppositeCond = !needOppositeCond;
24529 FValIsFalse = false;
24531 // Quit if TVal is not the constant opposite of FVal.
24532 if (FValIsFalse && TVal->getZExtValue() != 1)
24534 if (!FValIsFalse && TVal->getZExtValue() != 0)
24536 CC = X86::CondCode(SetCC.getConstantOperandVal(2));
24537 if (needOppositeCond)
24538 CC = X86::GetOppositeBranchCondition(CC);
24539 return SetCC.getOperand(3);
24546 /// Check whether Cond is an AND/OR of SETCCs off of the same EFLAGS.
24548 /// (X86or (X86setcc) (X86setcc))
24549 /// (X86cmp (and (X86setcc) (X86setcc)), 0)
24550 static bool checkBoolTestAndOrSetCCCombine(SDValue Cond, X86::CondCode &CC0,
24551 X86::CondCode &CC1, SDValue &Flags,
24553 if (Cond->getOpcode() == X86ISD::CMP) {
24554 if (!isNullConstant(Cond->getOperand(1)))
24557 Cond = Cond->getOperand(0);
24562 SDValue SetCC0, SetCC1;
24563 switch (Cond->getOpcode()) {
24564 default: return false;
24571 SetCC0 = Cond->getOperand(0);
24572 SetCC1 = Cond->getOperand(1);
24576 // Make sure we have SETCC nodes, using the same flags value.
24577 if (SetCC0.getOpcode() != X86ISD::SETCC ||
24578 SetCC1.getOpcode() != X86ISD::SETCC ||
24579 SetCC0->getOperand(1) != SetCC1->getOperand(1))
24582 CC0 = (X86::CondCode)SetCC0->getConstantOperandVal(0);
24583 CC1 = (X86::CondCode)SetCC1->getConstantOperandVal(0);
24584 Flags = SetCC0->getOperand(1);
24588 /// Optimize X86ISD::CMOV [LHS, RHS, CONDCODE (e.g. X86::COND_NE), CONDVAL]
24589 static SDValue PerformCMOVCombine(SDNode *N, SelectionDAG &DAG,
24590 TargetLowering::DAGCombinerInfo &DCI,
24591 const X86Subtarget *Subtarget) {
24594 // If the flag operand isn't dead, don't touch this CMOV.
24595 if (N->getNumValues() == 2 && !SDValue(N, 1).use_empty())
24598 SDValue FalseOp = N->getOperand(0);
24599 SDValue TrueOp = N->getOperand(1);
24600 X86::CondCode CC = (X86::CondCode)N->getConstantOperandVal(2);
24601 SDValue Cond = N->getOperand(3);
24603 if (CC == X86::COND_E || CC == X86::COND_NE) {
24604 switch (Cond.getOpcode()) {
24608 // If operand of BSR / BSF are proven never zero, then ZF cannot be set.
24609 if (DAG.isKnownNeverZero(Cond.getOperand(0)))
24610 return (CC == X86::COND_E) ? FalseOp : TrueOp;
24616 Flags = checkBoolTestSetCCCombine(Cond, CC);
24617 if (Flags.getNode() &&
24618 // Extra check as FCMOV only supports a subset of X86 cond.
24619 (FalseOp.getValueType() != MVT::f80 || hasFPCMov(CC))) {
24620 SDValue Ops[] = { FalseOp, TrueOp,
24621 DAG.getConstant(CC, DL, MVT::i8), Flags };
24622 return DAG.getNode(X86ISD::CMOV, DL, N->getVTList(), Ops);
24625 // If this is a select between two integer constants, try to do some
24626 // optimizations. Note that the operands are ordered the opposite of SELECT
24628 if (ConstantSDNode *TrueC = dyn_cast<ConstantSDNode>(TrueOp)) {
24629 if (ConstantSDNode *FalseC = dyn_cast<ConstantSDNode>(FalseOp)) {
24630 // Canonicalize the TrueC/FalseC values so that TrueC (the true value) is
24631 // larger than FalseC (the false value).
24632 if (TrueC->getAPIntValue().ult(FalseC->getAPIntValue())) {
24633 CC = X86::GetOppositeBranchCondition(CC);
24634 std::swap(TrueC, FalseC);
24635 std::swap(TrueOp, FalseOp);
24638 // Optimize C ? 8 : 0 -> zext(setcc(C)) << 3. Likewise for any pow2/0.
24639 // This is efficient for any integer data type (including i8/i16) and
24641 if (FalseC->getAPIntValue() == 0 && TrueC->getAPIntValue().isPowerOf2()) {
24642 Cond = DAG.getNode(X86ISD::SETCC, DL, MVT::i8,
24643 DAG.getConstant(CC, DL, MVT::i8), Cond);
24645 // Zero extend the condition if needed.
24646 Cond = DAG.getNode(ISD::ZERO_EXTEND, DL, TrueC->getValueType(0), Cond);
24648 unsigned ShAmt = TrueC->getAPIntValue().logBase2();
24649 Cond = DAG.getNode(ISD::SHL, DL, Cond.getValueType(), Cond,
24650 DAG.getConstant(ShAmt, DL, MVT::i8));
24651 if (N->getNumValues() == 2) // Dead flag value?
24652 return DCI.CombineTo(N, Cond, SDValue());
24656 // Optimize Cond ? cst+1 : cst -> zext(setcc(C)+cst. This is efficient
24657 // for any integer data type, including i8/i16.
24658 if (FalseC->getAPIntValue()+1 == TrueC->getAPIntValue()) {
24659 Cond = DAG.getNode(X86ISD::SETCC, DL, MVT::i8,
24660 DAG.getConstant(CC, DL, MVT::i8), Cond);
24662 // Zero extend the condition if needed.
24663 Cond = DAG.getNode(ISD::ZERO_EXTEND, DL,
24664 FalseC->getValueType(0), Cond);
24665 Cond = DAG.getNode(ISD::ADD, DL, Cond.getValueType(), Cond,
24666 SDValue(FalseC, 0));
24668 if (N->getNumValues() == 2) // Dead flag value?
24669 return DCI.CombineTo(N, Cond, SDValue());
24673 // Optimize cases that will turn into an LEA instruction. This requires
24674 // an i32 or i64 and an efficient multiplier (1, 2, 3, 4, 5, 8, 9).
24675 if (N->getValueType(0) == MVT::i32 || N->getValueType(0) == MVT::i64) {
24676 uint64_t Diff = TrueC->getZExtValue()-FalseC->getZExtValue();
24677 if (N->getValueType(0) == MVT::i32) Diff = (unsigned)Diff;
24679 bool isFastMultiplier = false;
24681 switch ((unsigned char)Diff) {
24683 case 1: // result = add base, cond
24684 case 2: // result = lea base( , cond*2)
24685 case 3: // result = lea base(cond, cond*2)
24686 case 4: // result = lea base( , cond*4)
24687 case 5: // result = lea base(cond, cond*4)
24688 case 8: // result = lea base( , cond*8)
24689 case 9: // result = lea base(cond, cond*8)
24690 isFastMultiplier = true;
24695 if (isFastMultiplier) {
24696 APInt Diff = TrueC->getAPIntValue()-FalseC->getAPIntValue();
24697 Cond = DAG.getNode(X86ISD::SETCC, DL, MVT::i8,
24698 DAG.getConstant(CC, DL, MVT::i8), Cond);
24699 // Zero extend the condition if needed.
24700 Cond = DAG.getNode(ISD::ZERO_EXTEND, DL, FalseC->getValueType(0),
24702 // Scale the condition by the difference.
24704 Cond = DAG.getNode(ISD::MUL, DL, Cond.getValueType(), Cond,
24705 DAG.getConstant(Diff, DL, Cond.getValueType()));
24707 // Add the base if non-zero.
24708 if (FalseC->getAPIntValue() != 0)
24709 Cond = DAG.getNode(ISD::ADD, DL, Cond.getValueType(), Cond,
24710 SDValue(FalseC, 0));
24711 if (N->getNumValues() == 2) // Dead flag value?
24712 return DCI.CombineTo(N, Cond, SDValue());
24719 // Handle these cases:
24720 // (select (x != c), e, c) -> select (x != c), e, x),
24721 // (select (x == c), c, e) -> select (x == c), x, e)
24722 // where the c is an integer constant, and the "select" is the combination
24723 // of CMOV and CMP.
24725 // The rationale for this change is that the conditional-move from a constant
24726 // needs two instructions, however, conditional-move from a register needs
24727 // only one instruction.
24729 // CAVEAT: By replacing a constant with a symbolic value, it may obscure
24730 // some instruction-combining opportunities. This opt needs to be
24731 // postponed as late as possible.
24733 if (!DCI.isBeforeLegalize() && !DCI.isBeforeLegalizeOps()) {
24734 // the DCI.xxxx conditions are provided to postpone the optimization as
24735 // late as possible.
24737 ConstantSDNode *CmpAgainst = nullptr;
24738 if ((Cond.getOpcode() == X86ISD::CMP || Cond.getOpcode() == X86ISD::SUB) &&
24739 (CmpAgainst = dyn_cast<ConstantSDNode>(Cond.getOperand(1))) &&
24740 !isa<ConstantSDNode>(Cond.getOperand(0))) {
24742 if (CC == X86::COND_NE &&
24743 CmpAgainst == dyn_cast<ConstantSDNode>(FalseOp)) {
24744 CC = X86::GetOppositeBranchCondition(CC);
24745 std::swap(TrueOp, FalseOp);
24748 if (CC == X86::COND_E &&
24749 CmpAgainst == dyn_cast<ConstantSDNode>(TrueOp)) {
24750 SDValue Ops[] = { FalseOp, Cond.getOperand(0),
24751 DAG.getConstant(CC, DL, MVT::i8), Cond };
24752 return DAG.getNode(X86ISD::CMOV, DL, N->getVTList (), Ops);
24757 // Fold and/or of setcc's to double CMOV:
24758 // (CMOV F, T, ((cc1 | cc2) != 0)) -> (CMOV (CMOV F, T, cc1), T, cc2)
24759 // (CMOV F, T, ((cc1 & cc2) != 0)) -> (CMOV (CMOV T, F, !cc1), F, !cc2)
24761 // This combine lets us generate:
24762 // cmovcc1 (jcc1 if we don't have CMOV)
24768 // cmovne (jne if we don't have CMOV)
24769 // When we can't use the CMOV instruction, it might increase branch
24771 // When we can use CMOV, or when there is no mispredict, this improves
24772 // throughput and reduces register pressure.
24774 if (CC == X86::COND_NE) {
24776 X86::CondCode CC0, CC1;
24778 if (checkBoolTestAndOrSetCCCombine(Cond, CC0, CC1, Flags, isAndSetCC)) {
24780 std::swap(FalseOp, TrueOp);
24781 CC0 = X86::GetOppositeBranchCondition(CC0);
24782 CC1 = X86::GetOppositeBranchCondition(CC1);
24785 SDValue LOps[] = {FalseOp, TrueOp, DAG.getConstant(CC0, DL, MVT::i8),
24787 SDValue LCMOV = DAG.getNode(X86ISD::CMOV, DL, N->getVTList(), LOps);
24788 SDValue Ops[] = {LCMOV, TrueOp, DAG.getConstant(CC1, DL, MVT::i8), Flags};
24789 SDValue CMOV = DAG.getNode(X86ISD::CMOV, DL, N->getVTList(), Ops);
24790 DAG.ReplaceAllUsesOfValueWith(SDValue(N, 1), SDValue(CMOV.getNode(), 1));
24798 /// PerformMulCombine - Optimize a single multiply with constant into two
24799 /// in order to implement it with two cheaper instructions, e.g.
24800 /// LEA + SHL, LEA + LEA.
24801 static SDValue PerformMulCombine(SDNode *N, SelectionDAG &DAG,
24802 TargetLowering::DAGCombinerInfo &DCI) {
24803 // An imul is usually smaller than the alternative sequence.
24804 if (DAG.getMachineFunction().getFunction()->optForMinSize())
24807 if (DCI.isBeforeLegalize() || DCI.isCalledByLegalizer())
24810 EVT VT = N->getValueType(0);
24811 if (VT != MVT::i64 && VT != MVT::i32)
24814 ConstantSDNode *C = dyn_cast<ConstantSDNode>(N->getOperand(1));
24817 uint64_t MulAmt = C->getZExtValue();
24818 if (isPowerOf2_64(MulAmt) || MulAmt == 3 || MulAmt == 5 || MulAmt == 9)
24821 uint64_t MulAmt1 = 0;
24822 uint64_t MulAmt2 = 0;
24823 if ((MulAmt % 9) == 0) {
24825 MulAmt2 = MulAmt / 9;
24826 } else if ((MulAmt % 5) == 0) {
24828 MulAmt2 = MulAmt / 5;
24829 } else if ((MulAmt % 3) == 0) {
24831 MulAmt2 = MulAmt / 3;
24837 (isPowerOf2_64(MulAmt2) || MulAmt2 == 3 || MulAmt2 == 5 || MulAmt2 == 9)){
24839 if (isPowerOf2_64(MulAmt2) &&
24840 !(N->hasOneUse() && N->use_begin()->getOpcode() == ISD::ADD))
24841 // If second multiplifer is pow2, issue it first. We want the multiply by
24842 // 3, 5, or 9 to be folded into the addressing mode unless the lone use
24844 std::swap(MulAmt1, MulAmt2);
24846 if (isPowerOf2_64(MulAmt1))
24847 NewMul = DAG.getNode(ISD::SHL, DL, VT, N->getOperand(0),
24848 DAG.getConstant(Log2_64(MulAmt1), DL, MVT::i8));
24850 NewMul = DAG.getNode(X86ISD::MUL_IMM, DL, VT, N->getOperand(0),
24851 DAG.getConstant(MulAmt1, DL, VT));
24853 if (isPowerOf2_64(MulAmt2))
24854 NewMul = DAG.getNode(ISD::SHL, DL, VT, NewMul,
24855 DAG.getConstant(Log2_64(MulAmt2), DL, MVT::i8));
24857 NewMul = DAG.getNode(X86ISD::MUL_IMM, DL, VT, NewMul,
24858 DAG.getConstant(MulAmt2, DL, VT));
24862 assert(MulAmt != 0 && MulAmt != (VT == MVT::i64 ? UINT64_MAX : UINT32_MAX)
24863 && "Both cases that could cause potential overflows should have "
24864 "already been handled.");
24865 if (isPowerOf2_64(MulAmt - 1))
24866 // (mul x, 2^N + 1) => (add (shl x, N), x)
24867 NewMul = DAG.getNode(ISD::ADD, DL, VT, N->getOperand(0),
24868 DAG.getNode(ISD::SHL, DL, VT, N->getOperand(0),
24869 DAG.getConstant(Log2_64(MulAmt - 1), DL,
24872 else if (isPowerOf2_64(MulAmt + 1))
24873 // (mul x, 2^N - 1) => (sub (shl x, N), x)
24874 NewMul = DAG.getNode(ISD::SUB, DL, VT, DAG.getNode(ISD::SHL, DL, VT,
24876 DAG.getConstant(Log2_64(MulAmt + 1),
24877 DL, MVT::i8)), N->getOperand(0));
24881 // Do not add new nodes to DAG combiner worklist.
24882 DCI.CombineTo(N, NewMul, false);
24887 static SDValue PerformSHLCombine(SDNode *N, SelectionDAG &DAG) {
24888 SDValue N0 = N->getOperand(0);
24889 SDValue N1 = N->getOperand(1);
24890 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1);
24891 EVT VT = N0.getValueType();
24893 // fold (shl (and (setcc_c), c1), c2) -> (and setcc_c, (c1 << c2))
24894 // since the result of setcc_c is all zero's or all ones.
24895 if (VT.isInteger() && !VT.isVector() &&
24896 N1C && N0.getOpcode() == ISD::AND &&
24897 N0.getOperand(1).getOpcode() == ISD::Constant) {
24898 SDValue N00 = N0.getOperand(0);
24899 APInt Mask = cast<ConstantSDNode>(N0.getOperand(1))->getAPIntValue();
24900 APInt ShAmt = N1C->getAPIntValue();
24901 Mask = Mask.shl(ShAmt);
24902 bool MaskOK = false;
24903 // We can handle cases concerning bit-widening nodes containing setcc_c if
24904 // we carefully interrogate the mask to make sure we are semantics
24906 // The transform is not safe if the result of C1 << C2 exceeds the bitwidth
24907 // of the underlying setcc_c operation if the setcc_c was zero extended.
24908 // Consider the following example:
24909 // zext(setcc_c) -> i32 0x0000FFFF
24910 // c1 -> i32 0x0000FFFF
24911 // c2 -> i32 0x00000001
24912 // (shl (and (setcc_c), c1), c2) -> i32 0x0001FFFE
24913 // (and setcc_c, (c1 << c2)) -> i32 0x0000FFFE
24914 if (N00.getOpcode() == X86ISD::SETCC_CARRY) {
24916 } else if (N00.getOpcode() == ISD::SIGN_EXTEND &&
24917 N00.getOperand(0).getOpcode() == X86ISD::SETCC_CARRY) {
24919 } else if ((N00.getOpcode() == ISD::ZERO_EXTEND ||
24920 N00.getOpcode() == ISD::ANY_EXTEND) &&
24921 N00.getOperand(0).getOpcode() == X86ISD::SETCC_CARRY) {
24922 MaskOK = Mask.isIntN(N00.getOperand(0).getValueSizeInBits());
24924 if (MaskOK && Mask != 0) {
24926 return DAG.getNode(ISD::AND, DL, VT, N00, DAG.getConstant(Mask, DL, VT));
24930 // Hardware support for vector shifts is sparse which makes us scalarize the
24931 // vector operations in many cases. Also, on sandybridge ADD is faster than
24933 // (shl V, 1) -> add V,V
24934 if (auto *N1BV = dyn_cast<BuildVectorSDNode>(N1))
24935 if (auto *N1SplatC = N1BV->getConstantSplatNode()) {
24936 assert(N0.getValueType().isVector() && "Invalid vector shift type");
24937 // We shift all of the values by one. In many cases we do not have
24938 // hardware support for this operation. This is better expressed as an ADD
24940 if (N1SplatC->getAPIntValue() == 1)
24941 return DAG.getNode(ISD::ADD, SDLoc(N), VT, N0, N0);
24947 /// \brief Returns a vector of 0s if the node in input is a vector logical
24948 /// shift by a constant amount which is known to be bigger than or equal
24949 /// to the vector element size in bits.
24950 static SDValue performShiftToAllZeros(SDNode *N, SelectionDAG &DAG,
24951 const X86Subtarget *Subtarget) {
24952 EVT VT = N->getValueType(0);
24954 if (VT != MVT::v2i64 && VT != MVT::v4i32 && VT != MVT::v8i16 &&
24955 (!Subtarget->hasInt256() ||
24956 (VT != MVT::v4i64 && VT != MVT::v8i32 && VT != MVT::v16i16)))
24959 SDValue Amt = N->getOperand(1);
24961 if (auto *AmtBV = dyn_cast<BuildVectorSDNode>(Amt))
24962 if (auto *AmtSplat = AmtBV->getConstantSplatNode()) {
24963 APInt ShiftAmt = AmtSplat->getAPIntValue();
24964 unsigned MaxAmount =
24965 VT.getSimpleVT().getVectorElementType().getSizeInBits();
24967 // SSE2/AVX2 logical shifts always return a vector of 0s
24968 // if the shift amount is bigger than or equal to
24969 // the element size. The constant shift amount will be
24970 // encoded as a 8-bit immediate.
24971 if (ShiftAmt.trunc(8).uge(MaxAmount))
24972 return getZeroVector(VT.getSimpleVT(), Subtarget, DAG, DL);
24978 /// PerformShiftCombine - Combine shifts.
24979 static SDValue PerformShiftCombine(SDNode* N, SelectionDAG &DAG,
24980 TargetLowering::DAGCombinerInfo &DCI,
24981 const X86Subtarget *Subtarget) {
24982 if (N->getOpcode() == ISD::SHL)
24983 if (SDValue V = PerformSHLCombine(N, DAG))
24986 // Try to fold this logical shift into a zero vector.
24987 if (N->getOpcode() != ISD::SRA)
24988 if (SDValue V = performShiftToAllZeros(N, DAG, Subtarget))
24994 // CMPEQCombine - Recognize the distinctive (AND (setcc ...) (setcc ..))
24995 // where both setccs reference the same FP CMP, and rewrite for CMPEQSS
24996 // and friends. Likewise for OR -> CMPNEQSS.
24997 static SDValue CMPEQCombine(SDNode *N, SelectionDAG &DAG,
24998 TargetLowering::DAGCombinerInfo &DCI,
24999 const X86Subtarget *Subtarget) {
25002 // SSE1 supports CMP{eq|ne}SS, and SSE2 added CMP{eq|ne}SD, but
25003 // we're requiring SSE2 for both.
25004 if (Subtarget->hasSSE2() && isAndOrOfSetCCs(SDValue(N, 0U), opcode)) {
25005 SDValue N0 = N->getOperand(0);
25006 SDValue N1 = N->getOperand(1);
25007 SDValue CMP0 = N0->getOperand(1);
25008 SDValue CMP1 = N1->getOperand(1);
25011 // The SETCCs should both refer to the same CMP.
25012 if (CMP0.getOpcode() != X86ISD::CMP || CMP0 != CMP1)
25015 SDValue CMP00 = CMP0->getOperand(0);
25016 SDValue CMP01 = CMP0->getOperand(1);
25017 EVT VT = CMP00.getValueType();
25019 if (VT == MVT::f32 || VT == MVT::f64) {
25020 bool ExpectingFlags = false;
25021 // Check for any users that want flags:
25022 for (SDNode::use_iterator UI = N->use_begin(), UE = N->use_end();
25023 !ExpectingFlags && UI != UE; ++UI)
25024 switch (UI->getOpcode()) {
25029 ExpectingFlags = true;
25031 case ISD::CopyToReg:
25032 case ISD::SIGN_EXTEND:
25033 case ISD::ZERO_EXTEND:
25034 case ISD::ANY_EXTEND:
25038 if (!ExpectingFlags) {
25039 enum X86::CondCode cc0 = (enum X86::CondCode)N0.getConstantOperandVal(0);
25040 enum X86::CondCode cc1 = (enum X86::CondCode)N1.getConstantOperandVal(0);
25042 if (cc1 == X86::COND_E || cc1 == X86::COND_NE) {
25043 X86::CondCode tmp = cc0;
25048 if ((cc0 == X86::COND_E && cc1 == X86::COND_NP) ||
25049 (cc0 == X86::COND_NE && cc1 == X86::COND_P)) {
25050 // FIXME: need symbolic constants for these magic numbers.
25051 // See X86ATTInstPrinter.cpp:printSSECC().
25052 unsigned x86cc = (cc0 == X86::COND_E) ? 0 : 4;
25053 if (Subtarget->hasAVX512()) {
25054 SDValue FSetCC = DAG.getNode(X86ISD::FSETCC, DL, MVT::i1, CMP00,
25056 DAG.getConstant(x86cc, DL, MVT::i8));
25057 if (N->getValueType(0) != MVT::i1)
25058 return DAG.getNode(ISD::ZERO_EXTEND, DL, N->getValueType(0),
25062 SDValue OnesOrZeroesF = DAG.getNode(X86ISD::FSETCC, DL,
25063 CMP00.getValueType(), CMP00, CMP01,
25064 DAG.getConstant(x86cc, DL,
25067 bool is64BitFP = (CMP00.getValueType() == MVT::f64);
25068 MVT IntVT = is64BitFP ? MVT::i64 : MVT::i32;
25070 if (is64BitFP && !Subtarget->is64Bit()) {
25071 // On a 32-bit target, we cannot bitcast the 64-bit float to a
25072 // 64-bit integer, since that's not a legal type. Since
25073 // OnesOrZeroesF is all ones of all zeroes, we don't need all the
25074 // bits, but can do this little dance to extract the lowest 32 bits
25075 // and work with those going forward.
25076 SDValue Vector64 = DAG.getNode(ISD::SCALAR_TO_VECTOR, DL, MVT::v2f64,
25078 SDValue Vector32 = DAG.getBitcast(MVT::v4f32, Vector64);
25079 OnesOrZeroesF = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, DL, MVT::f32,
25080 Vector32, DAG.getIntPtrConstant(0, DL));
25084 SDValue OnesOrZeroesI = DAG.getBitcast(IntVT, OnesOrZeroesF);
25085 SDValue ANDed = DAG.getNode(ISD::AND, DL, IntVT, OnesOrZeroesI,
25086 DAG.getConstant(1, DL, IntVT));
25087 SDValue OneBitOfTruth = DAG.getNode(ISD::TRUNCATE, DL, MVT::i8,
25089 return OneBitOfTruth;
25097 /// CanFoldXORWithAllOnes - Test whether the XOR operand is a AllOnes vector
25098 /// so it can be folded inside ANDNP.
25099 static bool CanFoldXORWithAllOnes(const SDNode *N) {
25100 EVT VT = N->getValueType(0);
25102 // Match direct AllOnes for 128 and 256-bit vectors
25103 if (ISD::isBuildVectorAllOnes(N))
25106 // Look through a bit convert.
25107 if (N->getOpcode() == ISD::BITCAST)
25108 N = N->getOperand(0).getNode();
25110 // Sometimes the operand may come from a insert_subvector building a 256-bit
25112 if (VT.is256BitVector() &&
25113 N->getOpcode() == ISD::INSERT_SUBVECTOR) {
25114 SDValue V1 = N->getOperand(0);
25115 SDValue V2 = N->getOperand(1);
25117 if (V1.getOpcode() == ISD::INSERT_SUBVECTOR &&
25118 V1.getOperand(0).getOpcode() == ISD::UNDEF &&
25119 ISD::isBuildVectorAllOnes(V1.getOperand(1).getNode()) &&
25120 ISD::isBuildVectorAllOnes(V2.getNode()))
25127 // On AVX/AVX2 the type v8i1 is legalized to v8i16, which is an XMM sized
25128 // register. In most cases we actually compare or select YMM-sized registers
25129 // and mixing the two types creates horrible code. This method optimizes
25130 // some of the transition sequences.
25131 static SDValue WidenMaskArithmetic(SDNode *N, SelectionDAG &DAG,
25132 TargetLowering::DAGCombinerInfo &DCI,
25133 const X86Subtarget *Subtarget) {
25134 EVT VT = N->getValueType(0);
25135 if (!VT.is256BitVector())
25138 assert((N->getOpcode() == ISD::ANY_EXTEND ||
25139 N->getOpcode() == ISD::ZERO_EXTEND ||
25140 N->getOpcode() == ISD::SIGN_EXTEND) && "Invalid Node");
25142 SDValue Narrow = N->getOperand(0);
25143 EVT NarrowVT = Narrow->getValueType(0);
25144 if (!NarrowVT.is128BitVector())
25147 if (Narrow->getOpcode() != ISD::XOR &&
25148 Narrow->getOpcode() != ISD::AND &&
25149 Narrow->getOpcode() != ISD::OR)
25152 SDValue N0 = Narrow->getOperand(0);
25153 SDValue N1 = Narrow->getOperand(1);
25156 // The Left side has to be a trunc.
25157 if (N0.getOpcode() != ISD::TRUNCATE)
25160 // The type of the truncated inputs.
25161 EVT WideVT = N0->getOperand(0)->getValueType(0);
25165 // The right side has to be a 'trunc' or a constant vector.
25166 bool RHSTrunc = N1.getOpcode() == ISD::TRUNCATE;
25167 ConstantSDNode *RHSConstSplat = nullptr;
25168 if (auto *RHSBV = dyn_cast<BuildVectorSDNode>(N1))
25169 RHSConstSplat = RHSBV->getConstantSplatNode();
25170 if (!RHSTrunc && !RHSConstSplat)
25173 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
25175 if (!TLI.isOperationLegalOrPromote(Narrow->getOpcode(), WideVT))
25178 // Set N0 and N1 to hold the inputs to the new wide operation.
25179 N0 = N0->getOperand(0);
25180 if (RHSConstSplat) {
25181 N1 = DAG.getNode(ISD::ZERO_EXTEND, DL, WideVT.getVectorElementType(),
25182 SDValue(RHSConstSplat, 0));
25183 SmallVector<SDValue, 8> C(WideVT.getVectorNumElements(), N1);
25184 N1 = DAG.getNode(ISD::BUILD_VECTOR, DL, WideVT, C);
25185 } else if (RHSTrunc) {
25186 N1 = N1->getOperand(0);
25189 // Generate the wide operation.
25190 SDValue Op = DAG.getNode(Narrow->getOpcode(), DL, WideVT, N0, N1);
25191 unsigned Opcode = N->getOpcode();
25193 case ISD::ANY_EXTEND:
25195 case ISD::ZERO_EXTEND: {
25196 unsigned InBits = NarrowVT.getScalarSizeInBits();
25197 APInt Mask = APInt::getAllOnesValue(InBits);
25198 Mask = Mask.zext(VT.getScalarSizeInBits());
25199 return DAG.getNode(ISD::AND, DL, VT,
25200 Op, DAG.getConstant(Mask, DL, VT));
25202 case ISD::SIGN_EXTEND:
25203 return DAG.getNode(ISD::SIGN_EXTEND_INREG, DL, VT,
25204 Op, DAG.getValueType(NarrowVT));
25206 llvm_unreachable("Unexpected opcode");
25210 static SDValue VectorZextCombine(SDNode *N, SelectionDAG &DAG,
25211 TargetLowering::DAGCombinerInfo &DCI,
25212 const X86Subtarget *Subtarget) {
25213 SDValue N0 = N->getOperand(0);
25214 SDValue N1 = N->getOperand(1);
25217 // A vector zext_in_reg may be represented as a shuffle,
25218 // feeding into a bitcast (this represents anyext) feeding into
25219 // an and with a mask.
25220 // We'd like to try to combine that into a shuffle with zero
25221 // plus a bitcast, removing the and.
25222 if (N0.getOpcode() != ISD::BITCAST ||
25223 N0.getOperand(0).getOpcode() != ISD::VECTOR_SHUFFLE)
25226 // The other side of the AND should be a splat of 2^C, where C
25227 // is the number of bits in the source type.
25228 if (N1.getOpcode() == ISD::BITCAST)
25229 N1 = N1.getOperand(0);
25230 if (N1.getOpcode() != ISD::BUILD_VECTOR)
25232 BuildVectorSDNode *Vector = cast<BuildVectorSDNode>(N1);
25234 ShuffleVectorSDNode *Shuffle = cast<ShuffleVectorSDNode>(N0.getOperand(0));
25235 EVT SrcType = Shuffle->getValueType(0);
25237 // We expect a single-source shuffle
25238 if (Shuffle->getOperand(1)->getOpcode() != ISD::UNDEF)
25241 unsigned SrcSize = SrcType.getScalarSizeInBits();
25243 APInt SplatValue, SplatUndef;
25244 unsigned SplatBitSize;
25246 if (!Vector->isConstantSplat(SplatValue, SplatUndef,
25247 SplatBitSize, HasAnyUndefs))
25250 unsigned ResSize = N1.getValueType().getScalarSizeInBits();
25251 // Make sure the splat matches the mask we expect
25252 if (SplatBitSize > ResSize ||
25253 (SplatValue + 1).exactLogBase2() != (int)SrcSize)
25256 // Make sure the input and output size make sense
25257 if (SrcSize >= ResSize || ResSize % SrcSize)
25260 // We expect a shuffle of the form <0, u, u, u, 1, u, u, u...>
25261 // The number of u's between each two values depends on the ratio between
25262 // the source and dest type.
25263 unsigned ZextRatio = ResSize / SrcSize;
25264 bool IsZext = true;
25265 for (unsigned i = 0; i < SrcType.getVectorNumElements(); ++i) {
25266 if (i % ZextRatio) {
25267 if (Shuffle->getMaskElt(i) > 0) {
25273 if (Shuffle->getMaskElt(i) != (int)(i / ZextRatio)) {
25274 // Expected element number
25284 // Ok, perform the transformation - replace the shuffle with
25285 // a shuffle of the form <0, k, k, k, 1, k, k, k> with zero
25286 // (instead of undef) where the k elements come from the zero vector.
25287 SmallVector<int, 8> Mask;
25288 unsigned NumElems = SrcType.getVectorNumElements();
25289 for (unsigned i = 0; i < NumElems; ++i)
25291 Mask.push_back(NumElems);
25293 Mask.push_back(i / ZextRatio);
25295 SDValue NewShuffle = DAG.getVectorShuffle(Shuffle->getValueType(0), DL,
25296 Shuffle->getOperand(0), DAG.getConstant(0, DL, SrcType), Mask);
25297 return DAG.getBitcast(N0.getValueType(), NewShuffle);
25300 /// If both input operands of a logic op are being cast from floating point
25301 /// types, try to convert this into a floating point logic node to avoid
25302 /// unnecessary moves from SSE to integer registers.
25303 static SDValue convertIntLogicToFPLogic(SDNode *N, SelectionDAG &DAG,
25304 const X86Subtarget *Subtarget) {
25305 unsigned FPOpcode = ISD::DELETED_NODE;
25306 if (N->getOpcode() == ISD::AND)
25307 FPOpcode = X86ISD::FAND;
25308 else if (N->getOpcode() == ISD::OR)
25309 FPOpcode = X86ISD::FOR;
25310 else if (N->getOpcode() == ISD::XOR)
25311 FPOpcode = X86ISD::FXOR;
25313 assert(FPOpcode != ISD::DELETED_NODE &&
25314 "Unexpected input node for FP logic conversion");
25316 EVT VT = N->getValueType(0);
25317 SDValue N0 = N->getOperand(0);
25318 SDValue N1 = N->getOperand(1);
25320 if (N0.getOpcode() == ISD::BITCAST && N1.getOpcode() == ISD::BITCAST &&
25321 ((Subtarget->hasSSE1() && VT == MVT::i32) ||
25322 (Subtarget->hasSSE2() && VT == MVT::i64))) {
25323 SDValue N00 = N0.getOperand(0);
25324 SDValue N10 = N1.getOperand(0);
25325 EVT N00Type = N00.getValueType();
25326 EVT N10Type = N10.getValueType();
25327 if (N00Type.isFloatingPoint() && N10Type.isFloatingPoint()) {
25328 SDValue FPLogic = DAG.getNode(FPOpcode, DL, N00Type, N00, N10);
25329 return DAG.getBitcast(VT, FPLogic);
25335 static SDValue PerformAndCombine(SDNode *N, SelectionDAG &DAG,
25336 TargetLowering::DAGCombinerInfo &DCI,
25337 const X86Subtarget *Subtarget) {
25338 if (DCI.isBeforeLegalizeOps())
25341 if (SDValue Zext = VectorZextCombine(N, DAG, DCI, Subtarget))
25344 if (SDValue R = CMPEQCombine(N, DAG, DCI, Subtarget))
25347 if (SDValue FPLogic = convertIntLogicToFPLogic(N, DAG, Subtarget))
25350 EVT VT = N->getValueType(0);
25351 SDValue N0 = N->getOperand(0);
25352 SDValue N1 = N->getOperand(1);
25355 // Create BEXTR instructions
25356 // BEXTR is ((X >> imm) & (2**size-1))
25357 if (VT == MVT::i32 || VT == MVT::i64) {
25358 // Check for BEXTR.
25359 if ((Subtarget->hasBMI() || Subtarget->hasTBM()) &&
25360 (N0.getOpcode() == ISD::SRA || N0.getOpcode() == ISD::SRL)) {
25361 ConstantSDNode *MaskNode = dyn_cast<ConstantSDNode>(N1);
25362 ConstantSDNode *ShiftNode = dyn_cast<ConstantSDNode>(N0.getOperand(1));
25363 if (MaskNode && ShiftNode) {
25364 uint64_t Mask = MaskNode->getZExtValue();
25365 uint64_t Shift = ShiftNode->getZExtValue();
25366 if (isMask_64(Mask)) {
25367 uint64_t MaskSize = countPopulation(Mask);
25368 if (Shift + MaskSize <= VT.getSizeInBits())
25369 return DAG.getNode(X86ISD::BEXTR, DL, VT, N0.getOperand(0),
25370 DAG.getConstant(Shift | (MaskSize << 8), DL,
25379 // Want to form ANDNP nodes:
25380 // 1) In the hopes of then easily combining them with OR and AND nodes
25381 // to form PBLEND/PSIGN.
25382 // 2) To match ANDN packed intrinsics
25383 if (VT != MVT::v2i64 && VT != MVT::v4i64)
25386 // Check LHS for vnot
25387 if (N0.getOpcode() == ISD::XOR &&
25388 //ISD::isBuildVectorAllOnes(N0.getOperand(1).getNode()))
25389 CanFoldXORWithAllOnes(N0.getOperand(1).getNode()))
25390 return DAG.getNode(X86ISD::ANDNP, DL, VT, N0.getOperand(0), N1);
25392 // Check RHS for vnot
25393 if (N1.getOpcode() == ISD::XOR &&
25394 //ISD::isBuildVectorAllOnes(N1.getOperand(1).getNode()))
25395 CanFoldXORWithAllOnes(N1.getOperand(1).getNode()))
25396 return DAG.getNode(X86ISD::ANDNP, DL, VT, N1.getOperand(0), N0);
25401 static SDValue PerformOrCombine(SDNode *N, SelectionDAG &DAG,
25402 TargetLowering::DAGCombinerInfo &DCI,
25403 const X86Subtarget *Subtarget) {
25404 if (DCI.isBeforeLegalizeOps())
25407 if (SDValue R = CMPEQCombine(N, DAG, DCI, Subtarget))
25410 if (SDValue FPLogic = convertIntLogicToFPLogic(N, DAG, Subtarget))
25413 SDValue N0 = N->getOperand(0);
25414 SDValue N1 = N->getOperand(1);
25415 EVT VT = N->getValueType(0);
25417 // look for psign/blend
25418 if (VT == MVT::v2i64 || VT == MVT::v4i64) {
25419 if (!Subtarget->hasSSSE3() ||
25420 (VT == MVT::v4i64 && !Subtarget->hasInt256()))
25423 // Canonicalize pandn to RHS
25424 if (N0.getOpcode() == X86ISD::ANDNP)
25426 // or (and (m, y), (pandn m, x))
25427 if (N0.getOpcode() == ISD::AND && N1.getOpcode() == X86ISD::ANDNP) {
25428 SDValue Mask = N1.getOperand(0);
25429 SDValue X = N1.getOperand(1);
25431 if (N0.getOperand(0) == Mask)
25432 Y = N0.getOperand(1);
25433 if (N0.getOperand(1) == Mask)
25434 Y = N0.getOperand(0);
25436 // Check to see if the mask appeared in both the AND and ANDNP and
25440 // Validate that X, Y, and Mask are BIT_CONVERTS, and see through them.
25441 // Look through mask bitcast.
25442 if (Mask.getOpcode() == ISD::BITCAST)
25443 Mask = Mask.getOperand(0);
25444 if (X.getOpcode() == ISD::BITCAST)
25445 X = X.getOperand(0);
25446 if (Y.getOpcode() == ISD::BITCAST)
25447 Y = Y.getOperand(0);
25449 EVT MaskVT = Mask.getValueType();
25451 // Validate that the Mask operand is a vector sra node.
25452 // FIXME: what to do for bytes, since there is a psignb/pblendvb, but
25453 // there is no psrai.b
25454 unsigned EltBits = MaskVT.getVectorElementType().getSizeInBits();
25455 unsigned SraAmt = ~0;
25456 if (Mask.getOpcode() == ISD::SRA) {
25457 if (auto *AmtBV = dyn_cast<BuildVectorSDNode>(Mask.getOperand(1)))
25458 if (auto *AmtConst = AmtBV->getConstantSplatNode())
25459 SraAmt = AmtConst->getZExtValue();
25460 } else if (Mask.getOpcode() == X86ISD::VSRAI) {
25461 SDValue SraC = Mask.getOperand(1);
25462 SraAmt = cast<ConstantSDNode>(SraC)->getZExtValue();
25464 if ((SraAmt + 1) != EltBits)
25469 // Now we know we at least have a plendvb with the mask val. See if
25470 // we can form a psignb/w/d.
25471 // psign = x.type == y.type == mask.type && y = sub(0, x);
25472 if (Y.getOpcode() == ISD::SUB && Y.getOperand(1) == X &&
25473 ISD::isBuildVectorAllZeros(Y.getOperand(0).getNode()) &&
25474 X.getValueType() == MaskVT && Y.getValueType() == MaskVT) {
25475 assert((EltBits == 8 || EltBits == 16 || EltBits == 32) &&
25476 "Unsupported VT for PSIGN");
25477 Mask = DAG.getNode(X86ISD::PSIGN, DL, MaskVT, X, Mask.getOperand(0));
25478 return DAG.getBitcast(VT, Mask);
25480 // PBLENDVB only available on SSE 4.1
25481 if (!Subtarget->hasSSE41())
25484 MVT BlendVT = (VT == MVT::v4i64) ? MVT::v32i8 : MVT::v16i8;
25486 X = DAG.getBitcast(BlendVT, X);
25487 Y = DAG.getBitcast(BlendVT, Y);
25488 Mask = DAG.getBitcast(BlendVT, Mask);
25489 Mask = DAG.getNode(ISD::VSELECT, DL, BlendVT, Mask, Y, X);
25490 return DAG.getBitcast(VT, Mask);
25494 if (VT != MVT::i16 && VT != MVT::i32 && VT != MVT::i64)
25497 // fold (or (x << c) | (y >> (64 - c))) ==> (shld64 x, y, c)
25498 bool OptForSize = DAG.getMachineFunction().getFunction()->optForSize();
25500 // SHLD/SHRD instructions have lower register pressure, but on some
25501 // platforms they have higher latency than the equivalent
25502 // series of shifts/or that would otherwise be generated.
25503 // Don't fold (or (x << c) | (y >> (64 - c))) if SHLD/SHRD instructions
25504 // have higher latencies and we are not optimizing for size.
25505 if (!OptForSize && Subtarget->isSHLDSlow())
25508 if (N0.getOpcode() == ISD::SRL && N1.getOpcode() == ISD::SHL)
25510 if (N0.getOpcode() != ISD::SHL || N1.getOpcode() != ISD::SRL)
25512 if (!N0.hasOneUse() || !N1.hasOneUse())
25515 SDValue ShAmt0 = N0.getOperand(1);
25516 if (ShAmt0.getValueType() != MVT::i8)
25518 SDValue ShAmt1 = N1.getOperand(1);
25519 if (ShAmt1.getValueType() != MVT::i8)
25521 if (ShAmt0.getOpcode() == ISD::TRUNCATE)
25522 ShAmt0 = ShAmt0.getOperand(0);
25523 if (ShAmt1.getOpcode() == ISD::TRUNCATE)
25524 ShAmt1 = ShAmt1.getOperand(0);
25527 unsigned Opc = X86ISD::SHLD;
25528 SDValue Op0 = N0.getOperand(0);
25529 SDValue Op1 = N1.getOperand(0);
25530 if (ShAmt0.getOpcode() == ISD::SUB) {
25531 Opc = X86ISD::SHRD;
25532 std::swap(Op0, Op1);
25533 std::swap(ShAmt0, ShAmt1);
25536 unsigned Bits = VT.getSizeInBits();
25537 if (ShAmt1.getOpcode() == ISD::SUB) {
25538 SDValue Sum = ShAmt1.getOperand(0);
25539 if (ConstantSDNode *SumC = dyn_cast<ConstantSDNode>(Sum)) {
25540 SDValue ShAmt1Op1 = ShAmt1.getOperand(1);
25541 if (ShAmt1Op1.getNode()->getOpcode() == ISD::TRUNCATE)
25542 ShAmt1Op1 = ShAmt1Op1.getOperand(0);
25543 if (SumC->getSExtValue() == Bits && ShAmt1Op1 == ShAmt0)
25544 return DAG.getNode(Opc, DL, VT,
25546 DAG.getNode(ISD::TRUNCATE, DL,
25549 } else if (ConstantSDNode *ShAmt1C = dyn_cast<ConstantSDNode>(ShAmt1)) {
25550 ConstantSDNode *ShAmt0C = dyn_cast<ConstantSDNode>(ShAmt0);
25552 ShAmt0C->getSExtValue() + ShAmt1C->getSExtValue() == Bits)
25553 return DAG.getNode(Opc, DL, VT,
25554 N0.getOperand(0), N1.getOperand(0),
25555 DAG.getNode(ISD::TRUNCATE, DL,
25562 // Generate NEG and CMOV for integer abs.
25563 static SDValue performIntegerAbsCombine(SDNode *N, SelectionDAG &DAG) {
25564 EVT VT = N->getValueType(0);
25566 // Since X86 does not have CMOV for 8-bit integer, we don't convert
25567 // 8-bit integer abs to NEG and CMOV.
25568 if (VT.isInteger() && VT.getSizeInBits() == 8)
25571 SDValue N0 = N->getOperand(0);
25572 SDValue N1 = N->getOperand(1);
25575 // Check pattern of XOR(ADD(X,Y), Y) where Y is SRA(X, size(X)-1)
25576 // and change it to SUB and CMOV.
25577 if (VT.isInteger() && N->getOpcode() == ISD::XOR &&
25578 N0.getOpcode() == ISD::ADD &&
25579 N0.getOperand(1) == N1 &&
25580 N1.getOpcode() == ISD::SRA &&
25581 N1.getOperand(0) == N0.getOperand(0))
25582 if (ConstantSDNode *Y1C = dyn_cast<ConstantSDNode>(N1.getOperand(1)))
25583 if (Y1C->getAPIntValue() == VT.getSizeInBits()-1) {
25584 // Generate SUB & CMOV.
25585 SDValue Neg = DAG.getNode(X86ISD::SUB, DL, DAG.getVTList(VT, MVT::i32),
25586 DAG.getConstant(0, DL, VT), N0.getOperand(0));
25588 SDValue Ops[] = { N0.getOperand(0), Neg,
25589 DAG.getConstant(X86::COND_GE, DL, MVT::i8),
25590 SDValue(Neg.getNode(), 1) };
25591 return DAG.getNode(X86ISD::CMOV, DL, DAG.getVTList(VT, MVT::Glue), Ops);
25596 // Try to turn tests against the signbit in the form of:
25597 // XOR(TRUNCATE(SRL(X, size(X)-1)), 1)
25600 static SDValue foldXorTruncShiftIntoCmp(SDNode *N, SelectionDAG &DAG) {
25601 // This is only worth doing if the output type is i8.
25602 if (N->getValueType(0) != MVT::i8)
25605 SDValue N0 = N->getOperand(0);
25606 SDValue N1 = N->getOperand(1);
25608 // We should be performing an xor against a truncated shift.
25609 if (N0.getOpcode() != ISD::TRUNCATE || !N0.hasOneUse())
25612 // Make sure we are performing an xor against one.
25613 if (!isOneConstant(N1))
25616 // SetCC on x86 zero extends so only act on this if it's a logical shift.
25617 SDValue Shift = N0.getOperand(0);
25618 if (Shift.getOpcode() != ISD::SRL || !Shift.hasOneUse())
25621 // Make sure we are truncating from one of i16, i32 or i64.
25622 EVT ShiftTy = Shift.getValueType();
25623 if (ShiftTy != MVT::i16 && ShiftTy != MVT::i32 && ShiftTy != MVT::i64)
25626 // Make sure the shift amount extracts the sign bit.
25627 if (!isa<ConstantSDNode>(Shift.getOperand(1)) ||
25628 Shift.getConstantOperandVal(1) != ShiftTy.getSizeInBits() - 1)
25631 // Create a greater-than comparison against -1.
25632 // N.B. Using SETGE against 0 works but we want a canonical looking
25633 // comparison, using SETGT matches up with what TranslateX86CC.
25635 SDValue ShiftOp = Shift.getOperand(0);
25636 EVT ShiftOpTy = ShiftOp.getValueType();
25637 SDValue Cond = DAG.getSetCC(DL, MVT::i8, ShiftOp,
25638 DAG.getConstant(-1, DL, ShiftOpTy), ISD::SETGT);
25642 static SDValue PerformXorCombine(SDNode *N, SelectionDAG &DAG,
25643 TargetLowering::DAGCombinerInfo &DCI,
25644 const X86Subtarget *Subtarget) {
25645 if (DCI.isBeforeLegalizeOps())
25648 if (SDValue RV = foldXorTruncShiftIntoCmp(N, DAG))
25651 if (Subtarget->hasCMov())
25652 if (SDValue RV = performIntegerAbsCombine(N, DAG))
25655 if (SDValue FPLogic = convertIntLogicToFPLogic(N, DAG, Subtarget))
25661 /// This function detects the AVG pattern between vectors of unsigned i8/i16,
25662 /// which is c = (a + b + 1) / 2, and replace this operation with the efficient
25663 /// X86ISD::AVG instruction.
25664 static SDValue detectAVGPattern(SDValue In, EVT VT, SelectionDAG &DAG,
25665 const X86Subtarget *Subtarget, SDLoc DL) {
25666 if (!VT.isVector() || !VT.isSimple())
25668 EVT InVT = In.getValueType();
25669 unsigned NumElems = VT.getVectorNumElements();
25671 EVT ScalarVT = VT.getVectorElementType();
25672 if (!((ScalarVT == MVT::i8 || ScalarVT == MVT::i16) &&
25673 isPowerOf2_32(NumElems)))
25676 // InScalarVT is the intermediate type in AVG pattern and it should be greater
25677 // than the original input type (i8/i16).
25678 EVT InScalarVT = InVT.getVectorElementType();
25679 if (InScalarVT.getSizeInBits() <= ScalarVT.getSizeInBits())
25682 if (Subtarget->hasAVX512()) {
25683 if (VT.getSizeInBits() > 512)
25685 } else if (Subtarget->hasAVX2()) {
25686 if (VT.getSizeInBits() > 256)
25689 if (VT.getSizeInBits() > 128)
25693 // Detect the following pattern:
25695 // %1 = zext <N x i8> %a to <N x i32>
25696 // %2 = zext <N x i8> %b to <N x i32>
25697 // %3 = add nuw nsw <N x i32> %1, <i32 1 x N>
25698 // %4 = add nuw nsw <N x i32> %3, %2
25699 // %5 = lshr <N x i32> %N, <i32 1 x N>
25700 // %6 = trunc <N x i32> %5 to <N x i8>
25702 // In AVX512, the last instruction can also be a trunc store.
25704 if (In.getOpcode() != ISD::SRL)
25707 // A lambda checking the given SDValue is a constant vector and each element
25708 // is in the range [Min, Max].
25709 auto IsConstVectorInRange = [](SDValue V, unsigned Min, unsigned Max) {
25710 BuildVectorSDNode *BV = dyn_cast<BuildVectorSDNode>(V);
25711 if (!BV || !BV->isConstant())
25713 for (unsigned i = 0, e = V.getNumOperands(); i < e; i++) {
25714 ConstantSDNode *C = dyn_cast<ConstantSDNode>(V.getOperand(i));
25717 uint64_t Val = C->getZExtValue();
25718 if (Val < Min || Val > Max)
25724 // Check if each element of the vector is left-shifted by one.
25725 auto LHS = In.getOperand(0);
25726 auto RHS = In.getOperand(1);
25727 if (!IsConstVectorInRange(RHS, 1, 1))
25729 if (LHS.getOpcode() != ISD::ADD)
25732 // Detect a pattern of a + b + 1 where the order doesn't matter.
25733 SDValue Operands[3];
25734 Operands[0] = LHS.getOperand(0);
25735 Operands[1] = LHS.getOperand(1);
25737 // Take care of the case when one of the operands is a constant vector whose
25738 // element is in the range [1, 256].
25739 if (IsConstVectorInRange(Operands[1], 1, ScalarVT == MVT::i8 ? 256 : 65536) &&
25740 Operands[0].getOpcode() == ISD::ZERO_EXTEND &&
25741 Operands[0].getOperand(0).getValueType() == VT) {
25742 // The pattern is detected. Subtract one from the constant vector, then
25743 // demote it and emit X86ISD::AVG instruction.
25744 SDValue One = DAG.getConstant(1, DL, InScalarVT);
25745 SDValue Ones = DAG.getNode(ISD::BUILD_VECTOR, DL, InVT,
25746 SmallVector<SDValue, 8>(NumElems, One));
25747 Operands[1] = DAG.getNode(ISD::SUB, DL, InVT, Operands[1], Ones);
25748 Operands[1] = DAG.getNode(ISD::TRUNCATE, DL, VT, Operands[1]);
25749 return DAG.getNode(X86ISD::AVG, DL, VT, Operands[0].getOperand(0),
25753 if (Operands[0].getOpcode() == ISD::ADD)
25754 std::swap(Operands[0], Operands[1]);
25755 else if (Operands[1].getOpcode() != ISD::ADD)
25757 Operands[2] = Operands[1].getOperand(0);
25758 Operands[1] = Operands[1].getOperand(1);
25760 // Now we have three operands of two additions. Check that one of them is a
25761 // constant vector with ones, and the other two are promoted from i8/i16.
25762 for (int i = 0; i < 3; ++i) {
25763 if (!IsConstVectorInRange(Operands[i], 1, 1))
25765 std::swap(Operands[i], Operands[2]);
25767 // Check if Operands[0] and Operands[1] are results of type promotion.
25768 for (int j = 0; j < 2; ++j)
25769 if (Operands[j].getOpcode() != ISD::ZERO_EXTEND ||
25770 Operands[j].getOperand(0).getValueType() != VT)
25773 // The pattern is detected, emit X86ISD::AVG instruction.
25774 return DAG.getNode(X86ISD::AVG, DL, VT, Operands[0].getOperand(0),
25775 Operands[1].getOperand(0));
25781 static SDValue PerformTRUNCATECombine(SDNode *N, SelectionDAG &DAG,
25782 const X86Subtarget *Subtarget) {
25783 return detectAVGPattern(N->getOperand(0), N->getValueType(0), DAG, Subtarget,
25787 /// PerformLOADCombine - Do target-specific dag combines on LOAD nodes.
25788 static SDValue PerformLOADCombine(SDNode *N, SelectionDAG &DAG,
25789 TargetLowering::DAGCombinerInfo &DCI,
25790 const X86Subtarget *Subtarget) {
25791 LoadSDNode *Ld = cast<LoadSDNode>(N);
25792 EVT RegVT = Ld->getValueType(0);
25793 EVT MemVT = Ld->getMemoryVT();
25795 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
25797 // For chips with slow 32-byte unaligned loads, break the 32-byte operation
25798 // into two 16-byte operations.
25799 ISD::LoadExtType Ext = Ld->getExtensionType();
25801 unsigned AddressSpace = Ld->getAddressSpace();
25802 unsigned Alignment = Ld->getAlignment();
25803 if (RegVT.is256BitVector() && !DCI.isBeforeLegalizeOps() &&
25804 Ext == ISD::NON_EXTLOAD &&
25805 TLI.allowsMemoryAccess(*DAG.getContext(), DAG.getDataLayout(), RegVT,
25806 AddressSpace, Alignment, &Fast) && !Fast) {
25807 unsigned NumElems = RegVT.getVectorNumElements();
25811 SDValue Ptr = Ld->getBasePtr();
25812 SDValue Increment =
25813 DAG.getConstant(16, dl, TLI.getPointerTy(DAG.getDataLayout()));
25815 EVT HalfVT = EVT::getVectorVT(*DAG.getContext(), MemVT.getScalarType(),
25817 SDValue Load1 = DAG.getLoad(HalfVT, dl, Ld->getChain(), Ptr,
25818 Ld->getPointerInfo(), Ld->isVolatile(),
25819 Ld->isNonTemporal(), Ld->isInvariant(),
25821 Ptr = DAG.getNode(ISD::ADD, dl, Ptr.getValueType(), Ptr, Increment);
25822 SDValue Load2 = DAG.getLoad(HalfVT, dl, Ld->getChain(), Ptr,
25823 Ld->getPointerInfo(), Ld->isVolatile(),
25824 Ld->isNonTemporal(), Ld->isInvariant(),
25825 std::min(16U, Alignment));
25826 SDValue TF = DAG.getNode(ISD::TokenFactor, dl, MVT::Other,
25828 Load2.getValue(1));
25830 SDValue NewVec = DAG.getUNDEF(RegVT);
25831 NewVec = Insert128BitVector(NewVec, Load1, 0, DAG, dl);
25832 NewVec = Insert128BitVector(NewVec, Load2, NumElems/2, DAG, dl);
25833 return DCI.CombineTo(N, NewVec, TF, true);
25839 /// PerformMLOADCombine - Resolve extending loads
25840 static SDValue PerformMLOADCombine(SDNode *N, SelectionDAG &DAG,
25841 TargetLowering::DAGCombinerInfo &DCI,
25842 const X86Subtarget *Subtarget) {
25843 MaskedLoadSDNode *Mld = cast<MaskedLoadSDNode>(N);
25844 if (Mld->getExtensionType() != ISD::SEXTLOAD)
25847 EVT VT = Mld->getValueType(0);
25848 unsigned NumElems = VT.getVectorNumElements();
25849 EVT LdVT = Mld->getMemoryVT();
25852 assert(LdVT != VT && "Cannot extend to the same type");
25853 unsigned ToSz = VT.getVectorElementType().getSizeInBits();
25854 unsigned FromSz = LdVT.getVectorElementType().getSizeInBits();
25855 // From, To sizes and ElemCount must be pow of two
25856 assert (isPowerOf2_32(NumElems * FromSz * ToSz) &&
25857 "Unexpected size for extending masked load");
25859 unsigned SizeRatio = ToSz / FromSz;
25860 assert(SizeRatio * NumElems * FromSz == VT.getSizeInBits());
25862 // Create a type on which we perform the shuffle
25863 EVT WideVecVT = EVT::getVectorVT(*DAG.getContext(),
25864 LdVT.getScalarType(), NumElems*SizeRatio);
25865 assert(WideVecVT.getSizeInBits() == VT.getSizeInBits());
25867 // Convert Src0 value
25868 SDValue WideSrc0 = DAG.getBitcast(WideVecVT, Mld->getSrc0());
25869 if (Mld->getSrc0().getOpcode() != ISD::UNDEF) {
25870 SmallVector<int, 16> ShuffleVec(NumElems * SizeRatio, -1);
25871 for (unsigned i = 0; i != NumElems; ++i)
25872 ShuffleVec[i] = i * SizeRatio;
25874 // Can't shuffle using an illegal type.
25875 assert(DAG.getTargetLoweringInfo().isTypeLegal(WideVecVT) &&
25876 "WideVecVT should be legal");
25877 WideSrc0 = DAG.getVectorShuffle(WideVecVT, dl, WideSrc0,
25878 DAG.getUNDEF(WideVecVT), &ShuffleVec[0]);
25880 // Prepare the new mask
25882 SDValue Mask = Mld->getMask();
25883 if (Mask.getValueType() == VT) {
25884 // Mask and original value have the same type
25885 NewMask = DAG.getBitcast(WideVecVT, Mask);
25886 SmallVector<int, 16> ShuffleVec(NumElems * SizeRatio, -1);
25887 for (unsigned i = 0; i != NumElems; ++i)
25888 ShuffleVec[i] = i * SizeRatio;
25889 for (unsigned i = NumElems; i != NumElems * SizeRatio; ++i)
25890 ShuffleVec[i] = NumElems * SizeRatio;
25891 NewMask = DAG.getVectorShuffle(WideVecVT, dl, NewMask,
25892 DAG.getConstant(0, dl, WideVecVT),
25896 assert(Mask.getValueType().getVectorElementType() == MVT::i1);
25897 unsigned WidenNumElts = NumElems*SizeRatio;
25898 unsigned MaskNumElts = VT.getVectorNumElements();
25899 EVT NewMaskVT = EVT::getVectorVT(*DAG.getContext(), MVT::i1,
25902 unsigned NumConcat = WidenNumElts / MaskNumElts;
25903 SmallVector<SDValue, 16> Ops(NumConcat);
25904 SDValue ZeroVal = DAG.getConstant(0, dl, Mask.getValueType());
25906 for (unsigned i = 1; i != NumConcat; ++i)
25909 NewMask = DAG.getNode(ISD::CONCAT_VECTORS, dl, NewMaskVT, Ops);
25912 SDValue WideLd = DAG.getMaskedLoad(WideVecVT, dl, Mld->getChain(),
25913 Mld->getBasePtr(), NewMask, WideSrc0,
25914 Mld->getMemoryVT(), Mld->getMemOperand(),
25916 SDValue NewVec = DAG.getNode(X86ISD::VSEXT, dl, VT, WideLd);
25917 return DCI.CombineTo(N, NewVec, WideLd.getValue(1), true);
25919 /// PerformMSTORECombine - Resolve truncating stores
25920 static SDValue PerformMSTORECombine(SDNode *N, SelectionDAG &DAG,
25921 const X86Subtarget *Subtarget) {
25922 MaskedStoreSDNode *Mst = cast<MaskedStoreSDNode>(N);
25923 if (!Mst->isTruncatingStore())
25926 EVT VT = Mst->getValue().getValueType();
25927 unsigned NumElems = VT.getVectorNumElements();
25928 EVT StVT = Mst->getMemoryVT();
25931 assert(StVT != VT && "Cannot truncate to the same type");
25932 unsigned FromSz = VT.getVectorElementType().getSizeInBits();
25933 unsigned ToSz = StVT.getVectorElementType().getSizeInBits();
25935 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
25937 // The truncating store is legal in some cases. For example
25938 // vpmovqb, vpmovqw, vpmovqd, vpmovdb, vpmovdw
25939 // are designated for truncate store.
25940 // In this case we don't need any further transformations.
25941 if (TLI.isTruncStoreLegal(VT, StVT))
25944 // From, To sizes and ElemCount must be pow of two
25945 assert (isPowerOf2_32(NumElems * FromSz * ToSz) &&
25946 "Unexpected size for truncating masked store");
25947 // We are going to use the original vector elt for storing.
25948 // Accumulated smaller vector elements must be a multiple of the store size.
25949 assert (((NumElems * FromSz) % ToSz) == 0 &&
25950 "Unexpected ratio for truncating masked store");
25952 unsigned SizeRatio = FromSz / ToSz;
25953 assert(SizeRatio * NumElems * ToSz == VT.getSizeInBits());
25955 // Create a type on which we perform the shuffle
25956 EVT WideVecVT = EVT::getVectorVT(*DAG.getContext(),
25957 StVT.getScalarType(), NumElems*SizeRatio);
25959 assert(WideVecVT.getSizeInBits() == VT.getSizeInBits());
25961 SDValue WideVec = DAG.getBitcast(WideVecVT, Mst->getValue());
25962 SmallVector<int, 16> ShuffleVec(NumElems * SizeRatio, -1);
25963 for (unsigned i = 0; i != NumElems; ++i)
25964 ShuffleVec[i] = i * SizeRatio;
25966 // Can't shuffle using an illegal type.
25967 assert(DAG.getTargetLoweringInfo().isTypeLegal(WideVecVT) &&
25968 "WideVecVT should be legal");
25970 SDValue TruncatedVal = DAG.getVectorShuffle(WideVecVT, dl, WideVec,
25971 DAG.getUNDEF(WideVecVT),
25975 SDValue Mask = Mst->getMask();
25976 if (Mask.getValueType() == VT) {
25977 // Mask and original value have the same type
25978 NewMask = DAG.getBitcast(WideVecVT, Mask);
25979 for (unsigned i = 0; i != NumElems; ++i)
25980 ShuffleVec[i] = i * SizeRatio;
25981 for (unsigned i = NumElems; i != NumElems*SizeRatio; ++i)
25982 ShuffleVec[i] = NumElems*SizeRatio;
25983 NewMask = DAG.getVectorShuffle(WideVecVT, dl, NewMask,
25984 DAG.getConstant(0, dl, WideVecVT),
25988 assert(Mask.getValueType().getVectorElementType() == MVT::i1);
25989 unsigned WidenNumElts = NumElems*SizeRatio;
25990 unsigned MaskNumElts = VT.getVectorNumElements();
25991 EVT NewMaskVT = EVT::getVectorVT(*DAG.getContext(), MVT::i1,
25994 unsigned NumConcat = WidenNumElts / MaskNumElts;
25995 SmallVector<SDValue, 16> Ops(NumConcat);
25996 SDValue ZeroVal = DAG.getConstant(0, dl, Mask.getValueType());
25998 for (unsigned i = 1; i != NumConcat; ++i)
26001 NewMask = DAG.getNode(ISD::CONCAT_VECTORS, dl, NewMaskVT, Ops);
26004 return DAG.getMaskedStore(Mst->getChain(), dl, TruncatedVal,
26005 Mst->getBasePtr(), NewMask, StVT,
26006 Mst->getMemOperand(), false);
26008 /// PerformSTORECombine - Do target-specific dag combines on STORE nodes.
26009 static SDValue PerformSTORECombine(SDNode *N, SelectionDAG &DAG,
26010 const X86Subtarget *Subtarget) {
26011 StoreSDNode *St = cast<StoreSDNode>(N);
26012 EVT VT = St->getValue().getValueType();
26013 EVT StVT = St->getMemoryVT();
26015 SDValue StoredVal = St->getOperand(1);
26016 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
26018 // If we are saving a concatenation of two XMM registers and 32-byte stores
26019 // are slow, such as on Sandy Bridge, perform two 16-byte stores.
26021 unsigned AddressSpace = St->getAddressSpace();
26022 unsigned Alignment = St->getAlignment();
26023 if (VT.is256BitVector() && StVT == VT &&
26024 TLI.allowsMemoryAccess(*DAG.getContext(), DAG.getDataLayout(), VT,
26025 AddressSpace, Alignment, &Fast) && !Fast) {
26026 unsigned NumElems = VT.getVectorNumElements();
26030 SDValue Value0 = Extract128BitVector(StoredVal, 0, DAG, dl);
26031 SDValue Value1 = Extract128BitVector(StoredVal, NumElems/2, DAG, dl);
26034 DAG.getConstant(16, dl, TLI.getPointerTy(DAG.getDataLayout()));
26035 SDValue Ptr0 = St->getBasePtr();
26036 SDValue Ptr1 = DAG.getNode(ISD::ADD, dl, Ptr0.getValueType(), Ptr0, Stride);
26038 SDValue Ch0 = DAG.getStore(St->getChain(), dl, Value0, Ptr0,
26039 St->getPointerInfo(), St->isVolatile(),
26040 St->isNonTemporal(), Alignment);
26041 SDValue Ch1 = DAG.getStore(St->getChain(), dl, Value1, Ptr1,
26042 St->getPointerInfo(), St->isVolatile(),
26043 St->isNonTemporal(),
26044 std::min(16U, Alignment));
26045 return DAG.getNode(ISD::TokenFactor, dl, MVT::Other, Ch0, Ch1);
26048 // Optimize trunc store (of multiple scalars) to shuffle and store.
26049 // First, pack all of the elements in one place. Next, store to memory
26050 // in fewer chunks.
26051 if (St->isTruncatingStore() && VT.isVector()) {
26052 // Check if we can detect an AVG pattern from the truncation. If yes,
26053 // replace the trunc store by a normal store with the result of X86ISD::AVG
26056 detectAVGPattern(St->getValue(), St->getMemoryVT(), DAG, Subtarget, dl);
26058 return DAG.getStore(St->getChain(), dl, Avg, St->getBasePtr(),
26059 St->getPointerInfo(), St->isVolatile(),
26060 St->isNonTemporal(), St->getAlignment());
26062 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
26063 unsigned NumElems = VT.getVectorNumElements();
26064 assert(StVT != VT && "Cannot truncate to the same type");
26065 unsigned FromSz = VT.getVectorElementType().getSizeInBits();
26066 unsigned ToSz = StVT.getVectorElementType().getSizeInBits();
26068 // The truncating store is legal in some cases. For example
26069 // vpmovqb, vpmovqw, vpmovqd, vpmovdb, vpmovdw
26070 // are designated for truncate store.
26071 // In this case we don't need any further transformations.
26072 if (TLI.isTruncStoreLegal(VT, StVT))
26075 // From, To sizes and ElemCount must be pow of two
26076 if (!isPowerOf2_32(NumElems * FromSz * ToSz)) return SDValue();
26077 // We are going to use the original vector elt for storing.
26078 // Accumulated smaller vector elements must be a multiple of the store size.
26079 if (0 != (NumElems * FromSz) % ToSz) return SDValue();
26081 unsigned SizeRatio = FromSz / ToSz;
26083 assert(SizeRatio * NumElems * ToSz == VT.getSizeInBits());
26085 // Create a type on which we perform the shuffle
26086 EVT WideVecVT = EVT::getVectorVT(*DAG.getContext(),
26087 StVT.getScalarType(), NumElems*SizeRatio);
26089 assert(WideVecVT.getSizeInBits() == VT.getSizeInBits());
26091 SDValue WideVec = DAG.getBitcast(WideVecVT, St->getValue());
26092 SmallVector<int, 8> ShuffleVec(NumElems * SizeRatio, -1);
26093 for (unsigned i = 0; i != NumElems; ++i)
26094 ShuffleVec[i] = i * SizeRatio;
26096 // Can't shuffle using an illegal type.
26097 if (!TLI.isTypeLegal(WideVecVT))
26100 SDValue Shuff = DAG.getVectorShuffle(WideVecVT, dl, WideVec,
26101 DAG.getUNDEF(WideVecVT),
26103 // At this point all of the data is stored at the bottom of the
26104 // register. We now need to save it to mem.
26106 // Find the largest store unit
26107 MVT StoreType = MVT::i8;
26108 for (MVT Tp : MVT::integer_valuetypes()) {
26109 if (TLI.isTypeLegal(Tp) && Tp.getSizeInBits() <= NumElems * ToSz)
26113 // On 32bit systems, we can't save 64bit integers. Try bitcasting to F64.
26114 if (TLI.isTypeLegal(MVT::f64) && StoreType.getSizeInBits() < 64 &&
26115 (64 <= NumElems * ToSz))
26116 StoreType = MVT::f64;
26118 // Bitcast the original vector into a vector of store-size units
26119 EVT StoreVecVT = EVT::getVectorVT(*DAG.getContext(),
26120 StoreType, VT.getSizeInBits()/StoreType.getSizeInBits());
26121 assert(StoreVecVT.getSizeInBits() == VT.getSizeInBits());
26122 SDValue ShuffWide = DAG.getBitcast(StoreVecVT, Shuff);
26123 SmallVector<SDValue, 8> Chains;
26124 SDValue Increment = DAG.getConstant(StoreType.getSizeInBits() / 8, dl,
26125 TLI.getPointerTy(DAG.getDataLayout()));
26126 SDValue Ptr = St->getBasePtr();
26128 // Perform one or more big stores into memory.
26129 for (unsigned i=0, e=(ToSz*NumElems)/StoreType.getSizeInBits(); i!=e; ++i) {
26130 SDValue SubVec = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl,
26131 StoreType, ShuffWide,
26132 DAG.getIntPtrConstant(i, dl));
26133 SDValue Ch = DAG.getStore(St->getChain(), dl, SubVec, Ptr,
26134 St->getPointerInfo(), St->isVolatile(),
26135 St->isNonTemporal(), St->getAlignment());
26136 Ptr = DAG.getNode(ISD::ADD, dl, Ptr.getValueType(), Ptr, Increment);
26137 Chains.push_back(Ch);
26140 return DAG.getNode(ISD::TokenFactor, dl, MVT::Other, Chains);
26143 // Turn load->store of MMX types into GPR load/stores. This avoids clobbering
26144 // the FP state in cases where an emms may be missing.
26145 // A preferable solution to the general problem is to figure out the right
26146 // places to insert EMMS. This qualifies as a quick hack.
26148 // Similarly, turn load->store of i64 into double load/stores in 32-bit mode.
26149 if (VT.getSizeInBits() != 64)
26152 const Function *F = DAG.getMachineFunction().getFunction();
26153 bool NoImplicitFloatOps = F->hasFnAttribute(Attribute::NoImplicitFloat);
26155 !Subtarget->useSoftFloat() && !NoImplicitFloatOps && Subtarget->hasSSE2();
26156 if ((VT.isVector() ||
26157 (VT == MVT::i64 && F64IsLegal && !Subtarget->is64Bit())) &&
26158 isa<LoadSDNode>(St->getValue()) &&
26159 !cast<LoadSDNode>(St->getValue())->isVolatile() &&
26160 St->getChain().hasOneUse() && !St->isVolatile()) {
26161 SDNode* LdVal = St->getValue().getNode();
26162 LoadSDNode *Ld = nullptr;
26163 int TokenFactorIndex = -1;
26164 SmallVector<SDValue, 8> Ops;
26165 SDNode* ChainVal = St->getChain().getNode();
26166 // Must be a store of a load. We currently handle two cases: the load
26167 // is a direct child, and it's under an intervening TokenFactor. It is
26168 // possible to dig deeper under nested TokenFactors.
26169 if (ChainVal == LdVal)
26170 Ld = cast<LoadSDNode>(St->getChain());
26171 else if (St->getValue().hasOneUse() &&
26172 ChainVal->getOpcode() == ISD::TokenFactor) {
26173 for (unsigned i = 0, e = ChainVal->getNumOperands(); i != e; ++i) {
26174 if (ChainVal->getOperand(i).getNode() == LdVal) {
26175 TokenFactorIndex = i;
26176 Ld = cast<LoadSDNode>(St->getValue());
26178 Ops.push_back(ChainVal->getOperand(i));
26182 if (!Ld || !ISD::isNormalLoad(Ld))
26185 // If this is not the MMX case, i.e. we are just turning i64 load/store
26186 // into f64 load/store, avoid the transformation if there are multiple
26187 // uses of the loaded value.
26188 if (!VT.isVector() && !Ld->hasNUsesOfValue(1, 0))
26193 // If we are a 64-bit capable x86, lower to a single movq load/store pair.
26194 // Otherwise, if it's legal to use f64 SSE instructions, use f64 load/store
26196 if (Subtarget->is64Bit() || F64IsLegal) {
26197 MVT LdVT = Subtarget->is64Bit() ? MVT::i64 : MVT::f64;
26198 SDValue NewLd = DAG.getLoad(LdVT, LdDL, Ld->getChain(), Ld->getBasePtr(),
26199 Ld->getPointerInfo(), Ld->isVolatile(),
26200 Ld->isNonTemporal(), Ld->isInvariant(),
26201 Ld->getAlignment());
26202 SDValue NewChain = NewLd.getValue(1);
26203 if (TokenFactorIndex != -1) {
26204 Ops.push_back(NewChain);
26205 NewChain = DAG.getNode(ISD::TokenFactor, LdDL, MVT::Other, Ops);
26207 return DAG.getStore(NewChain, StDL, NewLd, St->getBasePtr(),
26208 St->getPointerInfo(),
26209 St->isVolatile(), St->isNonTemporal(),
26210 St->getAlignment());
26213 // Otherwise, lower to two pairs of 32-bit loads / stores.
26214 SDValue LoAddr = Ld->getBasePtr();
26215 SDValue HiAddr = DAG.getNode(ISD::ADD, LdDL, MVT::i32, LoAddr,
26216 DAG.getConstant(4, LdDL, MVT::i32));
26218 SDValue LoLd = DAG.getLoad(MVT::i32, LdDL, Ld->getChain(), LoAddr,
26219 Ld->getPointerInfo(),
26220 Ld->isVolatile(), Ld->isNonTemporal(),
26221 Ld->isInvariant(), Ld->getAlignment());
26222 SDValue HiLd = DAG.getLoad(MVT::i32, LdDL, Ld->getChain(), HiAddr,
26223 Ld->getPointerInfo().getWithOffset(4),
26224 Ld->isVolatile(), Ld->isNonTemporal(),
26226 MinAlign(Ld->getAlignment(), 4));
26228 SDValue NewChain = LoLd.getValue(1);
26229 if (TokenFactorIndex != -1) {
26230 Ops.push_back(LoLd);
26231 Ops.push_back(HiLd);
26232 NewChain = DAG.getNode(ISD::TokenFactor, LdDL, MVT::Other, Ops);
26235 LoAddr = St->getBasePtr();
26236 HiAddr = DAG.getNode(ISD::ADD, StDL, MVT::i32, LoAddr,
26237 DAG.getConstant(4, StDL, MVT::i32));
26239 SDValue LoSt = DAG.getStore(NewChain, StDL, LoLd, LoAddr,
26240 St->getPointerInfo(),
26241 St->isVolatile(), St->isNonTemporal(),
26242 St->getAlignment());
26243 SDValue HiSt = DAG.getStore(NewChain, StDL, HiLd, HiAddr,
26244 St->getPointerInfo().getWithOffset(4),
26246 St->isNonTemporal(),
26247 MinAlign(St->getAlignment(), 4));
26248 return DAG.getNode(ISD::TokenFactor, StDL, MVT::Other, LoSt, HiSt);
26251 // This is similar to the above case, but here we handle a scalar 64-bit
26252 // integer store that is extracted from a vector on a 32-bit target.
26253 // If we have SSE2, then we can treat it like a floating-point double
26254 // to get past legalization. The execution dependencies fixup pass will
26255 // choose the optimal machine instruction for the store if this really is
26256 // an integer or v2f32 rather than an f64.
26257 if (VT == MVT::i64 && F64IsLegal && !Subtarget->is64Bit() &&
26258 St->getOperand(1).getOpcode() == ISD::EXTRACT_VECTOR_ELT) {
26259 SDValue OldExtract = St->getOperand(1);
26260 SDValue ExtOp0 = OldExtract.getOperand(0);
26261 unsigned VecSize = ExtOp0.getValueSizeInBits();
26262 EVT VecVT = EVT::getVectorVT(*DAG.getContext(), MVT::f64, VecSize / 64);
26263 SDValue BitCast = DAG.getBitcast(VecVT, ExtOp0);
26264 SDValue NewExtract = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::f64,
26265 BitCast, OldExtract.getOperand(1));
26266 return DAG.getStore(St->getChain(), dl, NewExtract, St->getBasePtr(),
26267 St->getPointerInfo(), St->isVolatile(),
26268 St->isNonTemporal(), St->getAlignment());
26274 /// Return 'true' if this vector operation is "horizontal"
26275 /// and return the operands for the horizontal operation in LHS and RHS. A
26276 /// horizontal operation performs the binary operation on successive elements
26277 /// of its first operand, then on successive elements of its second operand,
26278 /// returning the resulting values in a vector. For example, if
26279 /// A = < float a0, float a1, float a2, float a3 >
26281 /// B = < float b0, float b1, float b2, float b3 >
26282 /// then the result of doing a horizontal operation on A and B is
26283 /// A horizontal-op B = < a0 op a1, a2 op a3, b0 op b1, b2 op b3 >.
26284 /// In short, LHS and RHS are inspected to see if LHS op RHS is of the form
26285 /// A horizontal-op B, for some already available A and B, and if so then LHS is
26286 /// set to A, RHS to B, and the routine returns 'true'.
26287 /// Note that the binary operation should have the property that if one of the
26288 /// operands is UNDEF then the result is UNDEF.
26289 static bool isHorizontalBinOp(SDValue &LHS, SDValue &RHS, bool IsCommutative) {
26290 // Look for the following pattern: if
26291 // A = < float a0, float a1, float a2, float a3 >
26292 // B = < float b0, float b1, float b2, float b3 >
26294 // LHS = VECTOR_SHUFFLE A, B, <0, 2, 4, 6>
26295 // RHS = VECTOR_SHUFFLE A, B, <1, 3, 5, 7>
26296 // then LHS op RHS = < a0 op a1, a2 op a3, b0 op b1, b2 op b3 >
26297 // which is A horizontal-op B.
26299 // At least one of the operands should be a vector shuffle.
26300 if (LHS.getOpcode() != ISD::VECTOR_SHUFFLE &&
26301 RHS.getOpcode() != ISD::VECTOR_SHUFFLE)
26304 MVT VT = LHS.getSimpleValueType();
26306 assert((VT.is128BitVector() || VT.is256BitVector()) &&
26307 "Unsupported vector type for horizontal add/sub");
26309 // Handle 128 and 256-bit vector lengths. AVX defines horizontal add/sub to
26310 // operate independently on 128-bit lanes.
26311 unsigned NumElts = VT.getVectorNumElements();
26312 unsigned NumLanes = VT.getSizeInBits()/128;
26313 unsigned NumLaneElts = NumElts / NumLanes;
26314 assert((NumLaneElts % 2 == 0) &&
26315 "Vector type should have an even number of elements in each lane");
26316 unsigned HalfLaneElts = NumLaneElts/2;
26318 // View LHS in the form
26319 // LHS = VECTOR_SHUFFLE A, B, LMask
26320 // If LHS is not a shuffle then pretend it is the shuffle
26321 // LHS = VECTOR_SHUFFLE LHS, undef, <0, 1, ..., N-1>
26322 // NOTE: in what follows a default initialized SDValue represents an UNDEF of
26325 SmallVector<int, 16> LMask(NumElts);
26326 if (LHS.getOpcode() == ISD::VECTOR_SHUFFLE) {
26327 if (LHS.getOperand(0).getOpcode() != ISD::UNDEF)
26328 A = LHS.getOperand(0);
26329 if (LHS.getOperand(1).getOpcode() != ISD::UNDEF)
26330 B = LHS.getOperand(1);
26331 ArrayRef<int> Mask = cast<ShuffleVectorSDNode>(LHS.getNode())->getMask();
26332 std::copy(Mask.begin(), Mask.end(), LMask.begin());
26334 if (LHS.getOpcode() != ISD::UNDEF)
26336 for (unsigned i = 0; i != NumElts; ++i)
26340 // Likewise, view RHS in the form
26341 // RHS = VECTOR_SHUFFLE C, D, RMask
26343 SmallVector<int, 16> RMask(NumElts);
26344 if (RHS.getOpcode() == ISD::VECTOR_SHUFFLE) {
26345 if (RHS.getOperand(0).getOpcode() != ISD::UNDEF)
26346 C = RHS.getOperand(0);
26347 if (RHS.getOperand(1).getOpcode() != ISD::UNDEF)
26348 D = RHS.getOperand(1);
26349 ArrayRef<int> Mask = cast<ShuffleVectorSDNode>(RHS.getNode())->getMask();
26350 std::copy(Mask.begin(), Mask.end(), RMask.begin());
26352 if (RHS.getOpcode() != ISD::UNDEF)
26354 for (unsigned i = 0; i != NumElts; ++i)
26358 // Check that the shuffles are both shuffling the same vectors.
26359 if (!(A == C && B == D) && !(A == D && B == C))
26362 // If everything is UNDEF then bail out: it would be better to fold to UNDEF.
26363 if (!A.getNode() && !B.getNode())
26366 // If A and B occur in reverse order in RHS, then "swap" them (which means
26367 // rewriting the mask).
26369 ShuffleVectorSDNode::commuteMask(RMask);
26371 // At this point LHS and RHS are equivalent to
26372 // LHS = VECTOR_SHUFFLE A, B, LMask
26373 // RHS = VECTOR_SHUFFLE A, B, RMask
26374 // Check that the masks correspond to performing a horizontal operation.
26375 for (unsigned l = 0; l != NumElts; l += NumLaneElts) {
26376 for (unsigned i = 0; i != NumLaneElts; ++i) {
26377 int LIdx = LMask[i+l], RIdx = RMask[i+l];
26379 // Ignore any UNDEF components.
26380 if (LIdx < 0 || RIdx < 0 ||
26381 (!A.getNode() && (LIdx < (int)NumElts || RIdx < (int)NumElts)) ||
26382 (!B.getNode() && (LIdx >= (int)NumElts || RIdx >= (int)NumElts)))
26385 // Check that successive elements are being operated on. If not, this is
26386 // not a horizontal operation.
26387 unsigned Src = (i/HalfLaneElts); // each lane is split between srcs
26388 int Index = 2*(i%HalfLaneElts) + NumElts*Src + l;
26389 if (!(LIdx == Index && RIdx == Index + 1) &&
26390 !(IsCommutative && LIdx == Index + 1 && RIdx == Index))
26395 LHS = A.getNode() ? A : B; // If A is 'UNDEF', use B for it.
26396 RHS = B.getNode() ? B : A; // If B is 'UNDEF', use A for it.
26400 /// Do target-specific dag combines on floating point adds.
26401 static SDValue PerformFADDCombine(SDNode *N, SelectionDAG &DAG,
26402 const X86Subtarget *Subtarget) {
26403 EVT VT = N->getValueType(0);
26404 SDValue LHS = N->getOperand(0);
26405 SDValue RHS = N->getOperand(1);
26407 // Try to synthesize horizontal adds from adds of shuffles.
26408 if (((Subtarget->hasSSE3() && (VT == MVT::v4f32 || VT == MVT::v2f64)) ||
26409 (Subtarget->hasFp256() && (VT == MVT::v8f32 || VT == MVT::v4f64))) &&
26410 isHorizontalBinOp(LHS, RHS, true))
26411 return DAG.getNode(X86ISD::FHADD, SDLoc(N), VT, LHS, RHS);
26415 /// Do target-specific dag combines on floating point subs.
26416 static SDValue PerformFSUBCombine(SDNode *N, SelectionDAG &DAG,
26417 const X86Subtarget *Subtarget) {
26418 EVT VT = N->getValueType(0);
26419 SDValue LHS = N->getOperand(0);
26420 SDValue RHS = N->getOperand(1);
26422 // Try to synthesize horizontal subs from subs of shuffles.
26423 if (((Subtarget->hasSSE3() && (VT == MVT::v4f32 || VT == MVT::v2f64)) ||
26424 (Subtarget->hasFp256() && (VT == MVT::v8f32 || VT == MVT::v4f64))) &&
26425 isHorizontalBinOp(LHS, RHS, false))
26426 return DAG.getNode(X86ISD::FHSUB, SDLoc(N), VT, LHS, RHS);
26430 /// Do target-specific dag combines on floating point negations.
26431 static SDValue PerformFNEGCombine(SDNode *N, SelectionDAG &DAG,
26432 const X86Subtarget *Subtarget) {
26433 EVT VT = N->getValueType(0);
26434 EVT SVT = VT.getScalarType();
26435 SDValue Arg = N->getOperand(0);
26438 // Let legalize expand this if it isn't a legal type yet.
26439 if (!DAG.getTargetLoweringInfo().isTypeLegal(VT))
26442 // If we're negating a FMUL node on a target with FMA, then we can avoid the
26443 // use of a constant by performing (-0 - A*B) instead.
26444 // FIXME: Check rounding control flags as well once it becomes available.
26445 if (Arg.getOpcode() == ISD::FMUL && (SVT == MVT::f32 || SVT == MVT::f64) &&
26446 Arg->getFlags()->hasNoSignedZeros() && Subtarget->hasAnyFMA()) {
26447 SDValue Zero = DAG.getConstantFP(0.0, DL, VT);
26448 return DAG.getNode(X86ISD::FNMSUB, DL, VT, Arg.getOperand(0),
26449 Arg.getOperand(1), Zero);
26452 // If we're negating a FMA node, then we can adjust the
26453 // instruction to include the extra negation.
26454 if (Arg.hasOneUse()) {
26455 switch (Arg.getOpcode()) {
26456 case X86ISD::FMADD:
26457 return DAG.getNode(X86ISD::FNMSUB, DL, VT, Arg.getOperand(0),
26458 Arg.getOperand(1), Arg.getOperand(2));
26459 case X86ISD::FMSUB:
26460 return DAG.getNode(X86ISD::FNMADD, DL, VT, Arg.getOperand(0),
26461 Arg.getOperand(1), Arg.getOperand(2));
26462 case X86ISD::FNMADD:
26463 return DAG.getNode(X86ISD::FMSUB, DL, VT, Arg.getOperand(0),
26464 Arg.getOperand(1), Arg.getOperand(2));
26465 case X86ISD::FNMSUB:
26466 return DAG.getNode(X86ISD::FMADD, DL, VT, Arg.getOperand(0),
26467 Arg.getOperand(1), Arg.getOperand(2));
26473 static SDValue lowerX86FPLogicOp(SDNode *N, SelectionDAG &DAG,
26474 const X86Subtarget *Subtarget) {
26475 EVT VT = N->getValueType(0);
26476 if (VT.is512BitVector() && !Subtarget->hasDQI()) {
26477 // VXORPS, VORPS, VANDPS, VANDNPS are supported only under DQ extention.
26478 // These logic operations may be executed in the integer domain.
26480 MVT IntScalar = MVT::getIntegerVT(VT.getScalarSizeInBits());
26481 MVT IntVT = MVT::getVectorVT(IntScalar, VT.getVectorNumElements());
26483 SDValue Op0 = DAG.getNode(ISD::BITCAST, dl, IntVT, N->getOperand(0));
26484 SDValue Op1 = DAG.getNode(ISD::BITCAST, dl, IntVT, N->getOperand(1));
26485 unsigned IntOpcode = 0;
26486 switch (N->getOpcode()) {
26487 default: llvm_unreachable("Unexpected FP logic op");
26488 case X86ISD::FOR: IntOpcode = ISD::OR; break;
26489 case X86ISD::FXOR: IntOpcode = ISD::XOR; break;
26490 case X86ISD::FAND: IntOpcode = ISD::AND; break;
26491 case X86ISD::FANDN: IntOpcode = X86ISD::ANDNP; break;
26493 SDValue IntOp = DAG.getNode(IntOpcode, dl, IntVT, Op0, Op1);
26494 return DAG.getNode(ISD::BITCAST, dl, VT, IntOp);
26498 /// Do target-specific dag combines on X86ISD::FOR and X86ISD::FXOR nodes.
26499 static SDValue PerformFORCombine(SDNode *N, SelectionDAG &DAG,
26500 const X86Subtarget *Subtarget) {
26501 assert(N->getOpcode() == X86ISD::FOR || N->getOpcode() == X86ISD::FXOR);
26503 // F[X]OR(0.0, x) -> x
26504 if (ConstantFPSDNode *C = dyn_cast<ConstantFPSDNode>(N->getOperand(0)))
26505 if (C->getValueAPF().isPosZero())
26506 return N->getOperand(1);
26508 // F[X]OR(x, 0.0) -> x
26509 if (ConstantFPSDNode *C = dyn_cast<ConstantFPSDNode>(N->getOperand(1)))
26510 if (C->getValueAPF().isPosZero())
26511 return N->getOperand(0);
26513 return lowerX86FPLogicOp(N, DAG, Subtarget);
26516 /// Do target-specific dag combines on X86ISD::FMIN and X86ISD::FMAX nodes.
26517 static SDValue PerformFMinFMaxCombine(SDNode *N, SelectionDAG &DAG) {
26518 assert(N->getOpcode() == X86ISD::FMIN || N->getOpcode() == X86ISD::FMAX);
26520 // Only perform optimizations if UnsafeMath is used.
26521 if (!DAG.getTarget().Options.UnsafeFPMath)
26524 // If we run in unsafe-math mode, then convert the FMAX and FMIN nodes
26525 // into FMINC and FMAXC, which are Commutative operations.
26526 unsigned NewOp = 0;
26527 switch (N->getOpcode()) {
26528 default: llvm_unreachable("unknown opcode");
26529 case X86ISD::FMIN: NewOp = X86ISD::FMINC; break;
26530 case X86ISD::FMAX: NewOp = X86ISD::FMAXC; break;
26533 return DAG.getNode(NewOp, SDLoc(N), N->getValueType(0),
26534 N->getOperand(0), N->getOperand(1));
26537 static SDValue performFMaxNumCombine(SDNode *N, SelectionDAG &DAG,
26538 const X86Subtarget *Subtarget) {
26539 // This takes at least 3 instructions, so favor a library call when
26540 // minimizing code size.
26541 if (DAG.getMachineFunction().getFunction()->optForMinSize())
26544 EVT VT = N->getValueType(0);
26546 // TODO: Check for global or instruction-level "nnan". In that case, we
26547 // should be able to lower to FMAX/FMIN alone.
26548 // TODO: If an operand is already known to be a NaN or not a NaN, this
26549 // should be an optional swap and FMAX/FMIN.
26550 // TODO: Allow f64, vectors, and fminnum.
26552 if (VT != MVT::f32 || !Subtarget->hasSSE1() || Subtarget->useSoftFloat())
26555 SDValue Op0 = N->getOperand(0);
26556 SDValue Op1 = N->getOperand(1);
26558 EVT SetCCType = DAG.getTargetLoweringInfo().getSetCCResultType(
26559 DAG.getDataLayout(), *DAG.getContext(), VT);
26561 // There are 4 possibilities involving NaN inputs, and these are the required
26565 // ----------------
26566 // Num | Max | Op0 |
26567 // Op0 ----------------
26568 // NaN | Op1 | NaN |
26569 // ----------------
26571 // The SSE FP max/min instructions were not designed for this case, but rather
26573 // Max = Op1 > Op0 ? Op1 : Op0
26575 // So they always return Op0 if either input is a NaN. However, we can still
26576 // use those instructions for fmaxnum by selecting away a NaN input.
26578 // If either operand is NaN, the 2nd source operand (Op0) is passed through.
26579 SDValue Max = DAG.getNode(X86ISD::FMAX, DL, VT, Op1, Op0);
26580 SDValue IsOp0Nan = DAG.getSetCC(DL, SetCCType , Op0, Op0, ISD::SETUO);
26582 // If Op0 is a NaN, select Op1. Otherwise, select the max. If both operands
26583 // are NaN, the NaN value of Op1 is the result.
26584 return DAG.getNode(ISD::SELECT, DL, VT, IsOp0Nan, Op1, Max);
26587 /// Do target-specific dag combines on X86ISD::FAND nodes.
26588 static SDValue PerformFANDCombine(SDNode *N, SelectionDAG &DAG,
26589 const X86Subtarget *Subtarget) {
26590 // FAND(0.0, x) -> 0.0
26591 if (ConstantFPSDNode *C = dyn_cast<ConstantFPSDNode>(N->getOperand(0)))
26592 if (C->getValueAPF().isPosZero())
26593 return N->getOperand(0);
26595 // FAND(x, 0.0) -> 0.0
26596 if (ConstantFPSDNode *C = dyn_cast<ConstantFPSDNode>(N->getOperand(1)))
26597 if (C->getValueAPF().isPosZero())
26598 return N->getOperand(1);
26600 return lowerX86FPLogicOp(N, DAG, Subtarget);
26603 /// Do target-specific dag combines on X86ISD::FANDN nodes
26604 static SDValue PerformFANDNCombine(SDNode *N, SelectionDAG &DAG,
26605 const X86Subtarget *Subtarget) {
26606 // FANDN(0.0, x) -> x
26607 if (ConstantFPSDNode *C = dyn_cast<ConstantFPSDNode>(N->getOperand(0)))
26608 if (C->getValueAPF().isPosZero())
26609 return N->getOperand(1);
26611 // FANDN(x, 0.0) -> 0.0
26612 if (ConstantFPSDNode *C = dyn_cast<ConstantFPSDNode>(N->getOperand(1)))
26613 if (C->getValueAPF().isPosZero())
26614 return N->getOperand(1);
26616 return lowerX86FPLogicOp(N, DAG, Subtarget);
26619 static SDValue PerformBTCombine(SDNode *N,
26621 TargetLowering::DAGCombinerInfo &DCI) {
26622 // BT ignores high bits in the bit index operand.
26623 SDValue Op1 = N->getOperand(1);
26624 if (Op1.hasOneUse()) {
26625 unsigned BitWidth = Op1.getValueSizeInBits();
26626 APInt DemandedMask = APInt::getLowBitsSet(BitWidth, Log2_32(BitWidth));
26627 APInt KnownZero, KnownOne;
26628 TargetLowering::TargetLoweringOpt TLO(DAG, !DCI.isBeforeLegalize(),
26629 !DCI.isBeforeLegalizeOps());
26630 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
26631 if (TLO.ShrinkDemandedConstant(Op1, DemandedMask) ||
26632 TLI.SimplifyDemandedBits(Op1, DemandedMask, KnownZero, KnownOne, TLO))
26633 DCI.CommitTargetLoweringOpt(TLO);
26638 static SDValue PerformVZEXT_MOVLCombine(SDNode *N, SelectionDAG &DAG) {
26639 SDValue Op = N->getOperand(0);
26640 if (Op.getOpcode() == ISD::BITCAST)
26641 Op = Op.getOperand(0);
26642 EVT VT = N->getValueType(0), OpVT = Op.getValueType();
26643 if (Op.getOpcode() == X86ISD::VZEXT_LOAD &&
26644 VT.getVectorElementType().getSizeInBits() ==
26645 OpVT.getVectorElementType().getSizeInBits()) {
26646 return DAG.getNode(ISD::BITCAST, SDLoc(N), VT, Op);
26651 static SDValue PerformSIGN_EXTEND_INREGCombine(SDNode *N, SelectionDAG &DAG,
26652 const X86Subtarget *Subtarget) {
26653 EVT VT = N->getValueType(0);
26654 if (!VT.isVector())
26657 SDValue N0 = N->getOperand(0);
26658 SDValue N1 = N->getOperand(1);
26659 EVT ExtraVT = cast<VTSDNode>(N1)->getVT();
26662 // The SIGN_EXTEND_INREG to v4i64 is expensive operation on the
26663 // both SSE and AVX2 since there is no sign-extended shift right
26664 // operation on a vector with 64-bit elements.
26665 //(sext_in_reg (v4i64 anyext (v4i32 x )), ExtraVT) ->
26666 // (v4i64 sext (v4i32 sext_in_reg (v4i32 x , ExtraVT)))
26667 if (VT == MVT::v4i64 && (N0.getOpcode() == ISD::ANY_EXTEND ||
26668 N0.getOpcode() == ISD::SIGN_EXTEND)) {
26669 SDValue N00 = N0.getOperand(0);
26671 // EXTLOAD has a better solution on AVX2,
26672 // it may be replaced with X86ISD::VSEXT node.
26673 if (N00.getOpcode() == ISD::LOAD && Subtarget->hasInt256())
26674 if (!ISD::isNormalLoad(N00.getNode()))
26677 if (N00.getValueType() == MVT::v4i32 && ExtraVT.getSizeInBits() < 128) {
26678 SDValue Tmp = DAG.getNode(ISD::SIGN_EXTEND_INREG, dl, MVT::v4i32,
26680 return DAG.getNode(ISD::SIGN_EXTEND, dl, MVT::v4i64, Tmp);
26686 /// sext(add_nsw(x, C)) --> add(sext(x), C_sext)
26687 /// Promoting a sign extension ahead of an 'add nsw' exposes opportunities
26688 /// to combine math ops, use an LEA, or use a complex addressing mode. This can
26689 /// eliminate extend, add, and shift instructions.
26690 static SDValue promoteSextBeforeAddNSW(SDNode *Sext, SelectionDAG &DAG,
26691 const X86Subtarget *Subtarget) {
26692 // TODO: This should be valid for other integer types.
26693 EVT VT = Sext->getValueType(0);
26694 if (VT != MVT::i64)
26697 // We need an 'add nsw' feeding into the 'sext'.
26698 SDValue Add = Sext->getOperand(0);
26699 if (Add.getOpcode() != ISD::ADD || !Add->getFlags()->hasNoSignedWrap())
26702 // Having a constant operand to the 'add' ensures that we are not increasing
26703 // the instruction count because the constant is extended for free below.
26704 // A constant operand can also become the displacement field of an LEA.
26705 auto *AddOp1 = dyn_cast<ConstantSDNode>(Add.getOperand(1));
26709 // Don't make the 'add' bigger if there's no hope of combining it with some
26710 // other 'add' or 'shl' instruction.
26711 // TODO: It may be profitable to generate simpler LEA instructions in place
26712 // of single 'add' instructions, but the cost model for selecting an LEA
26713 // currently has a high threshold.
26714 bool HasLEAPotential = false;
26715 for (auto *User : Sext->uses()) {
26716 if (User->getOpcode() == ISD::ADD || User->getOpcode() == ISD::SHL) {
26717 HasLEAPotential = true;
26721 if (!HasLEAPotential)
26724 // Everything looks good, so pull the 'sext' ahead of the 'add'.
26725 int64_t AddConstant = AddOp1->getSExtValue();
26726 SDValue AddOp0 = Add.getOperand(0);
26727 SDValue NewSext = DAG.getNode(ISD::SIGN_EXTEND, SDLoc(Sext), VT, AddOp0);
26728 SDValue NewConstant = DAG.getConstant(AddConstant, SDLoc(Add), VT);
26730 // The wider add is guaranteed to not wrap because both operands are
26733 Flags.setNoSignedWrap(true);
26734 return DAG.getNode(ISD::ADD, SDLoc(Add), VT, NewSext, NewConstant, &Flags);
26737 static SDValue PerformSExtCombine(SDNode *N, SelectionDAG &DAG,
26738 TargetLowering::DAGCombinerInfo &DCI,
26739 const X86Subtarget *Subtarget) {
26740 SDValue N0 = N->getOperand(0);
26741 EVT VT = N->getValueType(0);
26742 EVT SVT = VT.getScalarType();
26743 EVT InVT = N0.getValueType();
26744 EVT InSVT = InVT.getScalarType();
26747 // (i8,i32 sext (sdivrem (i8 x, i8 y)) ->
26748 // (i8,i32 (sdivrem_sext_hreg (i8 x, i8 y)
26749 // This exposes the sext to the sdivrem lowering, so that it directly extends
26750 // from AH (which we otherwise need to do contortions to access).
26751 if (N0.getOpcode() == ISD::SDIVREM && N0.getResNo() == 1 &&
26752 InVT == MVT::i8 && VT == MVT::i32) {
26753 SDVTList NodeTys = DAG.getVTList(MVT::i8, VT);
26754 SDValue R = DAG.getNode(X86ISD::SDIVREM8_SEXT_HREG, DL, NodeTys,
26755 N0.getOperand(0), N0.getOperand(1));
26756 DAG.ReplaceAllUsesOfValueWith(N0.getValue(0), R.getValue(0));
26757 return R.getValue(1);
26760 if (!DCI.isBeforeLegalizeOps()) {
26761 if (InVT == MVT::i1) {
26762 SDValue Zero = DAG.getConstant(0, DL, VT);
26764 DAG.getConstant(APInt::getAllOnesValue(VT.getSizeInBits()), DL, VT);
26765 return DAG.getNode(ISD::SELECT, DL, VT, N0, AllOnes, Zero);
26770 if (VT.isVector() && Subtarget->hasSSE2()) {
26771 auto ExtendVecSize = [&DAG](SDLoc DL, SDValue N, unsigned Size) {
26772 EVT InVT = N.getValueType();
26773 EVT OutVT = EVT::getVectorVT(*DAG.getContext(), InVT.getScalarType(),
26774 Size / InVT.getScalarSizeInBits());
26775 SmallVector<SDValue, 8> Opnds(Size / InVT.getSizeInBits(),
26776 DAG.getUNDEF(InVT));
26778 return DAG.getNode(ISD::CONCAT_VECTORS, DL, OutVT, Opnds);
26781 // If target-size is less than 128-bits, extend to a type that would extend
26782 // to 128 bits, extend that and extract the original target vector.
26783 if (VT.getSizeInBits() < 128 && !(128 % VT.getSizeInBits()) &&
26784 (SVT == MVT::i64 || SVT == MVT::i32 || SVT == MVT::i16) &&
26785 (InSVT == MVT::i32 || InSVT == MVT::i16 || InSVT == MVT::i8)) {
26786 unsigned Scale = 128 / VT.getSizeInBits();
26788 EVT::getVectorVT(*DAG.getContext(), SVT, 128 / SVT.getSizeInBits());
26789 SDValue Ex = ExtendVecSize(DL, N0, Scale * InVT.getSizeInBits());
26790 SDValue SExt = DAG.getNode(ISD::SIGN_EXTEND, DL, ExVT, Ex);
26791 return DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, VT, SExt,
26792 DAG.getIntPtrConstant(0, DL));
26795 // If target-size is 128-bits, then convert to ISD::SIGN_EXTEND_VECTOR_INREG
26796 // which ensures lowering to X86ISD::VSEXT (pmovsx*).
26797 if (VT.getSizeInBits() == 128 &&
26798 (SVT == MVT::i64 || SVT == MVT::i32 || SVT == MVT::i16) &&
26799 (InSVT == MVT::i32 || InSVT == MVT::i16 || InSVT == MVT::i8)) {
26800 SDValue ExOp = ExtendVecSize(DL, N0, 128);
26801 return DAG.getSignExtendVectorInReg(ExOp, DL, VT);
26804 // On pre-AVX2 targets, split into 128-bit nodes of
26805 // ISD::SIGN_EXTEND_VECTOR_INREG.
26806 if (!Subtarget->hasInt256() && !(VT.getSizeInBits() % 128) &&
26807 (SVT == MVT::i64 || SVT == MVT::i32 || SVT == MVT::i16) &&
26808 (InSVT == MVT::i32 || InSVT == MVT::i16 || InSVT == MVT::i8)) {
26809 unsigned NumVecs = VT.getSizeInBits() / 128;
26810 unsigned NumSubElts = 128 / SVT.getSizeInBits();
26811 EVT SubVT = EVT::getVectorVT(*DAG.getContext(), SVT, NumSubElts);
26812 EVT InSubVT = EVT::getVectorVT(*DAG.getContext(), InSVT, NumSubElts);
26814 SmallVector<SDValue, 8> Opnds;
26815 for (unsigned i = 0, Offset = 0; i != NumVecs;
26816 ++i, Offset += NumSubElts) {
26817 SDValue SrcVec = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, InSubVT, N0,
26818 DAG.getIntPtrConstant(Offset, DL));
26819 SrcVec = ExtendVecSize(DL, SrcVec, 128);
26820 SrcVec = DAG.getSignExtendVectorInReg(SrcVec, DL, SubVT);
26821 Opnds.push_back(SrcVec);
26823 return DAG.getNode(ISD::CONCAT_VECTORS, DL, VT, Opnds);
26827 if (Subtarget->hasAVX() && VT.is256BitVector())
26828 if (SDValue R = WidenMaskArithmetic(N, DAG, DCI, Subtarget))
26831 if (SDValue NewAdd = promoteSextBeforeAddNSW(N, DAG, Subtarget))
26837 static SDValue PerformFMACombine(SDNode *N, SelectionDAG &DAG,
26838 const X86Subtarget* Subtarget) {
26840 EVT VT = N->getValueType(0);
26842 // Let legalize expand this if it isn't a legal type yet.
26843 if (!DAG.getTargetLoweringInfo().isTypeLegal(VT))
26846 EVT ScalarVT = VT.getScalarType();
26847 if ((ScalarVT != MVT::f32 && ScalarVT != MVT::f64) || !Subtarget->hasAnyFMA())
26850 SDValue A = N->getOperand(0);
26851 SDValue B = N->getOperand(1);
26852 SDValue C = N->getOperand(2);
26854 bool NegA = (A.getOpcode() == ISD::FNEG);
26855 bool NegB = (B.getOpcode() == ISD::FNEG);
26856 bool NegC = (C.getOpcode() == ISD::FNEG);
26858 // Negative multiplication when NegA xor NegB
26859 bool NegMul = (NegA != NegB);
26861 A = A.getOperand(0);
26863 B = B.getOperand(0);
26865 C = C.getOperand(0);
26869 Opcode = (!NegC) ? X86ISD::FMADD : X86ISD::FMSUB;
26871 Opcode = (!NegC) ? X86ISD::FNMADD : X86ISD::FNMSUB;
26873 return DAG.getNode(Opcode, dl, VT, A, B, C);
26876 static SDValue PerformZExtCombine(SDNode *N, SelectionDAG &DAG,
26877 TargetLowering::DAGCombinerInfo &DCI,
26878 const X86Subtarget *Subtarget) {
26879 // (i32 zext (and (i8 x86isd::setcc_carry), 1)) ->
26880 // (and (i32 x86isd::setcc_carry), 1)
26881 // This eliminates the zext. This transformation is necessary because
26882 // ISD::SETCC is always legalized to i8.
26884 SDValue N0 = N->getOperand(0);
26885 EVT VT = N->getValueType(0);
26887 if (N0.getOpcode() == ISD::AND &&
26889 N0.getOperand(0).hasOneUse()) {
26890 SDValue N00 = N0.getOperand(0);
26891 if (N00.getOpcode() == X86ISD::SETCC_CARRY) {
26892 if (!isOneConstant(N0.getOperand(1)))
26894 return DAG.getNode(ISD::AND, dl, VT,
26895 DAG.getNode(X86ISD::SETCC_CARRY, dl, VT,
26896 N00.getOperand(0), N00.getOperand(1)),
26897 DAG.getConstant(1, dl, VT));
26901 if (N0.getOpcode() == ISD::TRUNCATE &&
26903 N0.getOperand(0).hasOneUse()) {
26904 SDValue N00 = N0.getOperand(0);
26905 if (N00.getOpcode() == X86ISD::SETCC_CARRY) {
26906 return DAG.getNode(ISD::AND, dl, VT,
26907 DAG.getNode(X86ISD::SETCC_CARRY, dl, VT,
26908 N00.getOperand(0), N00.getOperand(1)),
26909 DAG.getConstant(1, dl, VT));
26913 if (VT.is256BitVector())
26914 if (SDValue R = WidenMaskArithmetic(N, DAG, DCI, Subtarget))
26917 // (i8,i32 zext (udivrem (i8 x, i8 y)) ->
26918 // (i8,i32 (udivrem_zext_hreg (i8 x, i8 y)
26919 // This exposes the zext to the udivrem lowering, so that it directly extends
26920 // from AH (which we otherwise need to do contortions to access).
26921 if (N0.getOpcode() == ISD::UDIVREM &&
26922 N0.getResNo() == 1 && N0.getValueType() == MVT::i8 &&
26923 (VT == MVT::i32 || VT == MVT::i64)) {
26924 SDVTList NodeTys = DAG.getVTList(MVT::i8, VT);
26925 SDValue R = DAG.getNode(X86ISD::UDIVREM8_ZEXT_HREG, dl, NodeTys,
26926 N0.getOperand(0), N0.getOperand(1));
26927 DAG.ReplaceAllUsesOfValueWith(N0.getValue(0), R.getValue(0));
26928 return R.getValue(1);
26934 // Optimize x == -y --> x+y == 0
26935 // x != -y --> x+y != 0
26936 static SDValue PerformISDSETCCCombine(SDNode *N, SelectionDAG &DAG,
26937 const X86Subtarget* Subtarget) {
26938 ISD::CondCode CC = cast<CondCodeSDNode>(N->getOperand(2))->get();
26939 SDValue LHS = N->getOperand(0);
26940 SDValue RHS = N->getOperand(1);
26941 EVT VT = N->getValueType(0);
26944 if ((CC == ISD::SETNE || CC == ISD::SETEQ) && LHS.getOpcode() == ISD::SUB)
26945 if (isNullConstant(LHS.getOperand(0)) && LHS.hasOneUse()) {
26946 SDValue addV = DAG.getNode(ISD::ADD, DL, LHS.getValueType(), RHS,
26947 LHS.getOperand(1));
26948 return DAG.getSetCC(DL, N->getValueType(0), addV,
26949 DAG.getConstant(0, DL, addV.getValueType()), CC);
26951 if ((CC == ISD::SETNE || CC == ISD::SETEQ) && RHS.getOpcode() == ISD::SUB)
26952 if (isNullConstant(RHS.getOperand(0)) && RHS.hasOneUse()) {
26953 SDValue addV = DAG.getNode(ISD::ADD, DL, RHS.getValueType(), LHS,
26954 RHS.getOperand(1));
26955 return DAG.getSetCC(DL, N->getValueType(0), addV,
26956 DAG.getConstant(0, DL, addV.getValueType()), CC);
26959 if (VT.getScalarType() == MVT::i1 &&
26960 (CC == ISD::SETNE || CC == ISD::SETEQ || ISD::isSignedIntSetCC(CC))) {
26962 (LHS.getOpcode() == ISD::SIGN_EXTEND) &&
26963 (LHS.getOperand(0).getValueType().getScalarType() == MVT::i1);
26964 bool IsVZero1 = ISD::isBuildVectorAllZeros(RHS.getNode());
26966 if (!IsSEXT0 || !IsVZero1) {
26967 // Swap the operands and update the condition code.
26968 std::swap(LHS, RHS);
26969 CC = ISD::getSetCCSwappedOperands(CC);
26971 IsSEXT0 = (LHS.getOpcode() == ISD::SIGN_EXTEND) &&
26972 (LHS.getOperand(0).getValueType().getScalarType() == MVT::i1);
26973 IsVZero1 = ISD::isBuildVectorAllZeros(RHS.getNode());
26976 if (IsSEXT0 && IsVZero1) {
26977 assert(VT == LHS.getOperand(0).getValueType() &&
26978 "Uexpected operand type");
26979 if (CC == ISD::SETGT)
26980 return DAG.getConstant(0, DL, VT);
26981 if (CC == ISD::SETLE)
26982 return DAG.getConstant(1, DL, VT);
26983 if (CC == ISD::SETEQ || CC == ISD::SETGE)
26984 return DAG.getNOT(DL, LHS.getOperand(0), VT);
26986 assert((CC == ISD::SETNE || CC == ISD::SETLT) &&
26987 "Unexpected condition code!");
26988 return LHS.getOperand(0);
26995 static SDValue PerformBLENDICombine(SDNode *N, SelectionDAG &DAG) {
26996 SDValue V0 = N->getOperand(0);
26997 SDValue V1 = N->getOperand(1);
26999 EVT VT = N->getValueType(0);
27001 // Canonicalize a v2f64 blend with a mask of 2 by swapping the vector
27002 // operands and changing the mask to 1. This saves us a bunch of
27003 // pattern-matching possibilities related to scalar math ops in SSE/AVX.
27004 // x86InstrInfo knows how to commute this back after instruction selection
27005 // if it would help register allocation.
27007 // TODO: If optimizing for size or a processor that doesn't suffer from
27008 // partial register update stalls, this should be transformed into a MOVSD
27009 // instruction because a MOVSD is 1-2 bytes smaller than a BLENDPD.
27011 if (VT == MVT::v2f64)
27012 if (auto *Mask = dyn_cast<ConstantSDNode>(N->getOperand(2)))
27013 if (Mask->getZExtValue() == 2 && !isShuffleFoldableLoad(V0)) {
27014 SDValue NewMask = DAG.getConstant(1, DL, MVT::i8);
27015 return DAG.getNode(X86ISD::BLENDI, DL, VT, V1, V0, NewMask);
27021 static SDValue PerformGatherScatterCombine(SDNode *N, SelectionDAG &DAG) {
27023 // Gather and Scatter instructions use k-registers for masks. The type of
27024 // the masks is v*i1. So the mask will be truncated anyway.
27025 // The SIGN_EXTEND_INREG my be dropped.
27026 SDValue Mask = N->getOperand(2);
27027 if (Mask.getOpcode() == ISD::SIGN_EXTEND_INREG) {
27028 SmallVector<SDValue, 5> NewOps(N->op_begin(), N->op_end());
27029 NewOps[2] = Mask.getOperand(0);
27030 DAG.UpdateNodeOperands(N, NewOps);
27035 // Helper function of PerformSETCCCombine. It is to materialize "setb reg"
27036 // as "sbb reg,reg", since it can be extended without zext and produces
27037 // an all-ones bit which is more useful than 0/1 in some cases.
27038 static SDValue MaterializeSETB(SDLoc DL, SDValue EFLAGS, SelectionDAG &DAG,
27041 return DAG.getNode(ISD::AND, DL, VT,
27042 DAG.getNode(X86ISD::SETCC_CARRY, DL, MVT::i8,
27043 DAG.getConstant(X86::COND_B, DL, MVT::i8),
27045 DAG.getConstant(1, DL, VT));
27046 assert (VT == MVT::i1 && "Unexpected type for SECCC node");
27047 return DAG.getNode(ISD::TRUNCATE, DL, MVT::i1,
27048 DAG.getNode(X86ISD::SETCC_CARRY, DL, MVT::i8,
27049 DAG.getConstant(X86::COND_B, DL, MVT::i8),
27053 // Optimize RES = X86ISD::SETCC CONDCODE, EFLAG_INPUT
27054 static SDValue PerformSETCCCombine(SDNode *N, SelectionDAG &DAG,
27055 TargetLowering::DAGCombinerInfo &DCI,
27056 const X86Subtarget *Subtarget) {
27058 X86::CondCode CC = X86::CondCode(N->getConstantOperandVal(0));
27059 SDValue EFLAGS = N->getOperand(1);
27061 if (CC == X86::COND_A) {
27062 // Try to convert COND_A into COND_B in an attempt to facilitate
27063 // materializing "setb reg".
27065 // Do not flip "e > c", where "c" is a constant, because Cmp instruction
27066 // cannot take an immediate as its first operand.
27068 if (EFLAGS.getOpcode() == X86ISD::SUB && EFLAGS.hasOneUse() &&
27069 EFLAGS.getValueType().isInteger() &&
27070 !isa<ConstantSDNode>(EFLAGS.getOperand(1))) {
27071 SDValue NewSub = DAG.getNode(X86ISD::SUB, SDLoc(EFLAGS),
27072 EFLAGS.getNode()->getVTList(),
27073 EFLAGS.getOperand(1), EFLAGS.getOperand(0));
27074 SDValue NewEFLAGS = SDValue(NewSub.getNode(), EFLAGS.getResNo());
27075 return MaterializeSETB(DL, NewEFLAGS, DAG, N->getSimpleValueType(0));
27079 // Materialize "setb reg" as "sbb reg,reg", since it can be extended without
27080 // a zext and produces an all-ones bit which is more useful than 0/1 in some
27082 if (CC == X86::COND_B)
27083 return MaterializeSETB(DL, EFLAGS, DAG, N->getSimpleValueType(0));
27085 if (SDValue Flags = checkBoolTestSetCCCombine(EFLAGS, CC)) {
27086 SDValue Cond = DAG.getConstant(CC, DL, MVT::i8);
27087 return DAG.getNode(X86ISD::SETCC, DL, N->getVTList(), Cond, Flags);
27093 // Optimize branch condition evaluation.
27095 static SDValue PerformBrCondCombine(SDNode *N, SelectionDAG &DAG,
27096 TargetLowering::DAGCombinerInfo &DCI,
27097 const X86Subtarget *Subtarget) {
27099 SDValue Chain = N->getOperand(0);
27100 SDValue Dest = N->getOperand(1);
27101 SDValue EFLAGS = N->getOperand(3);
27102 X86::CondCode CC = X86::CondCode(N->getConstantOperandVal(2));
27104 if (SDValue Flags = checkBoolTestSetCCCombine(EFLAGS, CC)) {
27105 SDValue Cond = DAG.getConstant(CC, DL, MVT::i8);
27106 return DAG.getNode(X86ISD::BRCOND, DL, N->getVTList(), Chain, Dest, Cond,
27113 static SDValue performVectorCompareAndMaskUnaryOpCombine(SDNode *N,
27114 SelectionDAG &DAG) {
27115 // Take advantage of vector comparisons producing 0 or -1 in each lane to
27116 // optimize away operation when it's from a constant.
27118 // The general transformation is:
27119 // UNARYOP(AND(VECTOR_CMP(x,y), constant)) -->
27120 // AND(VECTOR_CMP(x,y), constant2)
27121 // constant2 = UNARYOP(constant)
27123 // Early exit if this isn't a vector operation, the operand of the
27124 // unary operation isn't a bitwise AND, or if the sizes of the operations
27125 // aren't the same.
27126 EVT VT = N->getValueType(0);
27127 if (!VT.isVector() || N->getOperand(0)->getOpcode() != ISD::AND ||
27128 N->getOperand(0)->getOperand(0)->getOpcode() != ISD::SETCC ||
27129 VT.getSizeInBits() != N->getOperand(0)->getValueType(0).getSizeInBits())
27132 // Now check that the other operand of the AND is a constant. We could
27133 // make the transformation for non-constant splats as well, but it's unclear
27134 // that would be a benefit as it would not eliminate any operations, just
27135 // perform one more step in scalar code before moving to the vector unit.
27136 if (BuildVectorSDNode *BV =
27137 dyn_cast<BuildVectorSDNode>(N->getOperand(0)->getOperand(1))) {
27138 // Bail out if the vector isn't a constant.
27139 if (!BV->isConstant())
27142 // Everything checks out. Build up the new and improved node.
27144 EVT IntVT = BV->getValueType(0);
27145 // Create a new constant of the appropriate type for the transformed
27147 SDValue SourceConst = DAG.getNode(N->getOpcode(), DL, VT, SDValue(BV, 0));
27148 // The AND node needs bitcasts to/from an integer vector type around it.
27149 SDValue MaskConst = DAG.getBitcast(IntVT, SourceConst);
27150 SDValue NewAnd = DAG.getNode(ISD::AND, DL, IntVT,
27151 N->getOperand(0)->getOperand(0), MaskConst);
27152 SDValue Res = DAG.getBitcast(VT, NewAnd);
27159 static SDValue PerformUINT_TO_FPCombine(SDNode *N, SelectionDAG &DAG,
27160 const X86Subtarget *Subtarget) {
27161 SDValue Op0 = N->getOperand(0);
27162 EVT VT = N->getValueType(0);
27163 EVT InVT = Op0.getValueType();
27164 EVT InSVT = InVT.getScalarType();
27165 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
27167 // UINT_TO_FP(vXi8) -> SINT_TO_FP(ZEXT(vXi8 to vXi32))
27168 // UINT_TO_FP(vXi16) -> SINT_TO_FP(ZEXT(vXi16 to vXi32))
27169 if (InVT.isVector() && (InSVT == MVT::i8 || InSVT == MVT::i16)) {
27171 EVT DstVT = EVT::getVectorVT(*DAG.getContext(), MVT::i32,
27172 InVT.getVectorNumElements());
27173 SDValue P = DAG.getNode(ISD::ZERO_EXTEND, dl, DstVT, Op0);
27175 if (TLI.isOperationLegal(ISD::UINT_TO_FP, DstVT))
27176 return DAG.getNode(ISD::UINT_TO_FP, dl, VT, P);
27178 return DAG.getNode(ISD::SINT_TO_FP, dl, VT, P);
27184 static SDValue PerformSINT_TO_FPCombine(SDNode *N, SelectionDAG &DAG,
27185 const X86Subtarget *Subtarget) {
27186 // First try to optimize away the conversion entirely when it's
27187 // conditionally from a constant. Vectors only.
27188 if (SDValue Res = performVectorCompareAndMaskUnaryOpCombine(N, DAG))
27191 // Now move on to more general possibilities.
27192 SDValue Op0 = N->getOperand(0);
27193 EVT VT = N->getValueType(0);
27194 EVT InVT = Op0.getValueType();
27195 EVT InSVT = InVT.getScalarType();
27197 // SINT_TO_FP(vXi8) -> SINT_TO_FP(SEXT(vXi8 to vXi32))
27198 // SINT_TO_FP(vXi16) -> SINT_TO_FP(SEXT(vXi16 to vXi32))
27199 if (InVT.isVector() && (InSVT == MVT::i8 || InSVT == MVT::i16)) {
27201 EVT DstVT = EVT::getVectorVT(*DAG.getContext(), MVT::i32,
27202 InVT.getVectorNumElements());
27203 SDValue P = DAG.getNode(ISD::SIGN_EXTEND, dl, DstVT, Op0);
27204 return DAG.getNode(ISD::SINT_TO_FP, dl, VT, P);
27207 // Transform (SINT_TO_FP (i64 ...)) into an x87 operation if we have
27208 // a 32-bit target where SSE doesn't support i64->FP operations.
27209 if (!Subtarget->useSoftFloat() && Op0.getOpcode() == ISD::LOAD) {
27210 LoadSDNode *Ld = cast<LoadSDNode>(Op0.getNode());
27211 EVT LdVT = Ld->getValueType(0);
27213 // This transformation is not supported if the result type is f16
27214 if (VT == MVT::f16)
27217 if (!Ld->isVolatile() && !VT.isVector() &&
27218 ISD::isNON_EXTLoad(Op0.getNode()) && Op0.hasOneUse() &&
27219 !Subtarget->is64Bit() && LdVT == MVT::i64) {
27220 SDValue FILDChain = Subtarget->getTargetLowering()->BuildFILD(
27221 SDValue(N, 0), LdVT, Ld->getChain(), Op0, DAG);
27222 DAG.ReplaceAllUsesOfValueWith(Op0.getValue(1), FILDChain.getValue(1));
27229 // Optimize RES, EFLAGS = X86ISD::ADC LHS, RHS, EFLAGS
27230 static SDValue PerformADCCombine(SDNode *N, SelectionDAG &DAG,
27231 X86TargetLowering::DAGCombinerInfo &DCI) {
27232 // If the LHS and RHS of the ADC node are zero, then it can't overflow and
27233 // the result is either zero or one (depending on the input carry bit).
27234 // Strength reduce this down to a "set on carry" aka SETCC_CARRY&1.
27235 if (X86::isZeroNode(N->getOperand(0)) &&
27236 X86::isZeroNode(N->getOperand(1)) &&
27237 // We don't have a good way to replace an EFLAGS use, so only do this when
27239 SDValue(N, 1).use_empty()) {
27241 EVT VT = N->getValueType(0);
27242 SDValue CarryOut = DAG.getConstant(0, DL, N->getValueType(1));
27243 SDValue Res1 = DAG.getNode(ISD::AND, DL, VT,
27244 DAG.getNode(X86ISD::SETCC_CARRY, DL, VT,
27245 DAG.getConstant(X86::COND_B, DL,
27248 DAG.getConstant(1, DL, VT));
27249 return DCI.CombineTo(N, Res1, CarryOut);
27255 // fold (add Y, (sete X, 0)) -> adc 0, Y
27256 // (add Y, (setne X, 0)) -> sbb -1, Y
27257 // (sub (sete X, 0), Y) -> sbb 0, Y
27258 // (sub (setne X, 0), Y) -> adc -1, Y
27259 static SDValue OptimizeConditionalInDecrement(SDNode *N, SelectionDAG &DAG) {
27262 // Look through ZExts.
27263 SDValue Ext = N->getOperand(N->getOpcode() == ISD::SUB ? 1 : 0);
27264 if (Ext.getOpcode() != ISD::ZERO_EXTEND || !Ext.hasOneUse())
27267 SDValue SetCC = Ext.getOperand(0);
27268 if (SetCC.getOpcode() != X86ISD::SETCC || !SetCC.hasOneUse())
27271 X86::CondCode CC = (X86::CondCode)SetCC.getConstantOperandVal(0);
27272 if (CC != X86::COND_E && CC != X86::COND_NE)
27275 SDValue Cmp = SetCC.getOperand(1);
27276 if (Cmp.getOpcode() != X86ISD::CMP || !Cmp.hasOneUse() ||
27277 !X86::isZeroNode(Cmp.getOperand(1)) ||
27278 !Cmp.getOperand(0).getValueType().isInteger())
27281 SDValue CmpOp0 = Cmp.getOperand(0);
27282 SDValue NewCmp = DAG.getNode(X86ISD::CMP, DL, MVT::i32, CmpOp0,
27283 DAG.getConstant(1, DL, CmpOp0.getValueType()));
27285 SDValue OtherVal = N->getOperand(N->getOpcode() == ISD::SUB ? 0 : 1);
27286 if (CC == X86::COND_NE)
27287 return DAG.getNode(N->getOpcode() == ISD::SUB ? X86ISD::ADC : X86ISD::SBB,
27288 DL, OtherVal.getValueType(), OtherVal,
27289 DAG.getConstant(-1ULL, DL, OtherVal.getValueType()),
27291 return DAG.getNode(N->getOpcode() == ISD::SUB ? X86ISD::SBB : X86ISD::ADC,
27292 DL, OtherVal.getValueType(), OtherVal,
27293 DAG.getConstant(0, DL, OtherVal.getValueType()), NewCmp);
27296 /// PerformADDCombine - Do target-specific dag combines on integer adds.
27297 static SDValue PerformAddCombine(SDNode *N, SelectionDAG &DAG,
27298 const X86Subtarget *Subtarget) {
27299 EVT VT = N->getValueType(0);
27300 SDValue Op0 = N->getOperand(0);
27301 SDValue Op1 = N->getOperand(1);
27303 // Try to synthesize horizontal adds from adds of shuffles.
27304 if (((Subtarget->hasSSSE3() && (VT == MVT::v8i16 || VT == MVT::v4i32)) ||
27305 (Subtarget->hasInt256() && (VT == MVT::v16i16 || VT == MVT::v8i32))) &&
27306 isHorizontalBinOp(Op0, Op1, true))
27307 return DAG.getNode(X86ISD::HADD, SDLoc(N), VT, Op0, Op1);
27309 return OptimizeConditionalInDecrement(N, DAG);
27312 static SDValue PerformSubCombine(SDNode *N, SelectionDAG &DAG,
27313 const X86Subtarget *Subtarget) {
27314 SDValue Op0 = N->getOperand(0);
27315 SDValue Op1 = N->getOperand(1);
27317 // X86 can't encode an immediate LHS of a sub. See if we can push the
27318 // negation into a preceding instruction.
27319 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op0)) {
27320 // If the RHS of the sub is a XOR with one use and a constant, invert the
27321 // immediate. Then add one to the LHS of the sub so we can turn
27322 // X-Y -> X+~Y+1, saving one register.
27323 if (Op1->hasOneUse() && Op1.getOpcode() == ISD::XOR &&
27324 isa<ConstantSDNode>(Op1.getOperand(1))) {
27325 APInt XorC = cast<ConstantSDNode>(Op1.getOperand(1))->getAPIntValue();
27326 EVT VT = Op0.getValueType();
27327 SDValue NewXor = DAG.getNode(ISD::XOR, SDLoc(Op1), VT,
27329 DAG.getConstant(~XorC, SDLoc(Op1), VT));
27330 return DAG.getNode(ISD::ADD, SDLoc(N), VT, NewXor,
27331 DAG.getConstant(C->getAPIntValue() + 1, SDLoc(N), VT));
27335 // Try to synthesize horizontal adds from adds of shuffles.
27336 EVT VT = N->getValueType(0);
27337 if (((Subtarget->hasSSSE3() && (VT == MVT::v8i16 || VT == MVT::v4i32)) ||
27338 (Subtarget->hasInt256() && (VT == MVT::v16i16 || VT == MVT::v8i32))) &&
27339 isHorizontalBinOp(Op0, Op1, true))
27340 return DAG.getNode(X86ISD::HSUB, SDLoc(N), VT, Op0, Op1);
27342 return OptimizeConditionalInDecrement(N, DAG);
27345 /// performVZEXTCombine - Performs build vector combines
27346 static SDValue performVZEXTCombine(SDNode *N, SelectionDAG &DAG,
27347 TargetLowering::DAGCombinerInfo &DCI,
27348 const X86Subtarget *Subtarget) {
27350 MVT VT = N->getSimpleValueType(0);
27351 SDValue Op = N->getOperand(0);
27352 MVT OpVT = Op.getSimpleValueType();
27353 MVT OpEltVT = OpVT.getVectorElementType();
27354 unsigned InputBits = OpEltVT.getSizeInBits() * VT.getVectorNumElements();
27356 // (vzext (bitcast (vzext (x)) -> (vzext x)
27358 while (V.getOpcode() == ISD::BITCAST)
27359 V = V.getOperand(0);
27361 if (V != Op && V.getOpcode() == X86ISD::VZEXT) {
27362 MVT InnerVT = V.getSimpleValueType();
27363 MVT InnerEltVT = InnerVT.getVectorElementType();
27365 // If the element sizes match exactly, we can just do one larger vzext. This
27366 // is always an exact type match as vzext operates on integer types.
27367 if (OpEltVT == InnerEltVT) {
27368 assert(OpVT == InnerVT && "Types must match for vzext!");
27369 return DAG.getNode(X86ISD::VZEXT, DL, VT, V.getOperand(0));
27372 // The only other way we can combine them is if only a single element of the
27373 // inner vzext is used in the input to the outer vzext.
27374 if (InnerEltVT.getSizeInBits() < InputBits)
27377 // In this case, the inner vzext is completely dead because we're going to
27378 // only look at bits inside of the low element. Just do the outer vzext on
27379 // a bitcast of the input to the inner.
27380 return DAG.getNode(X86ISD::VZEXT, DL, VT, DAG.getBitcast(OpVT, V));
27383 // Check if we can bypass extracting and re-inserting an element of an input
27384 // vector. Essentially:
27385 // (bitcast (sclr2vec (ext_vec_elt x))) -> (bitcast x)
27386 if (V.getOpcode() == ISD::SCALAR_TO_VECTOR &&
27387 V.getOperand(0).getOpcode() == ISD::EXTRACT_VECTOR_ELT &&
27388 V.getOperand(0).getSimpleValueType().getSizeInBits() == InputBits) {
27389 SDValue ExtractedV = V.getOperand(0);
27390 SDValue OrigV = ExtractedV.getOperand(0);
27391 if (isNullConstant(ExtractedV.getOperand(1))) {
27392 MVT OrigVT = OrigV.getSimpleValueType();
27393 // Extract a subvector if necessary...
27394 if (OrigVT.getSizeInBits() > OpVT.getSizeInBits()) {
27395 int Ratio = OrigVT.getSizeInBits() / OpVT.getSizeInBits();
27396 OrigVT = MVT::getVectorVT(OrigVT.getVectorElementType(),
27397 OrigVT.getVectorNumElements() / Ratio);
27398 OrigV = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, OrigVT, OrigV,
27399 DAG.getIntPtrConstant(0, DL));
27401 Op = DAG.getBitcast(OpVT, OrigV);
27402 return DAG.getNode(X86ISD::VZEXT, DL, VT, Op);
27409 SDValue X86TargetLowering::PerformDAGCombine(SDNode *N,
27410 DAGCombinerInfo &DCI) const {
27411 SelectionDAG &DAG = DCI.DAG;
27412 switch (N->getOpcode()) {
27414 case ISD::EXTRACT_VECTOR_ELT:
27415 return PerformEXTRACT_VECTOR_ELTCombine(N, DAG, DCI);
27418 case X86ISD::SHRUNKBLEND:
27419 return PerformSELECTCombine(N, DAG, DCI, Subtarget);
27420 case ISD::BITCAST: return PerformBITCASTCombine(N, DAG, Subtarget);
27421 case X86ISD::CMOV: return PerformCMOVCombine(N, DAG, DCI, Subtarget);
27422 case ISD::ADD: return PerformAddCombine(N, DAG, Subtarget);
27423 case ISD::SUB: return PerformSubCombine(N, DAG, Subtarget);
27424 case X86ISD::ADC: return PerformADCCombine(N, DAG, DCI);
27425 case ISD::MUL: return PerformMulCombine(N, DAG, DCI);
27428 case ISD::SRL: return PerformShiftCombine(N, DAG, DCI, Subtarget);
27429 case ISD::AND: return PerformAndCombine(N, DAG, DCI, Subtarget);
27430 case ISD::OR: return PerformOrCombine(N, DAG, DCI, Subtarget);
27431 case ISD::XOR: return PerformXorCombine(N, DAG, DCI, Subtarget);
27432 case ISD::LOAD: return PerformLOADCombine(N, DAG, DCI, Subtarget);
27433 case ISD::MLOAD: return PerformMLOADCombine(N, DAG, DCI, Subtarget);
27434 case ISD::STORE: return PerformSTORECombine(N, DAG, Subtarget);
27435 case ISD::MSTORE: return PerformMSTORECombine(N, DAG, Subtarget);
27436 case ISD::SINT_TO_FP: return PerformSINT_TO_FPCombine(N, DAG, Subtarget);
27437 case ISD::UINT_TO_FP: return PerformUINT_TO_FPCombine(N, DAG, Subtarget);
27438 case ISD::FADD: return PerformFADDCombine(N, DAG, Subtarget);
27439 case ISD::FSUB: return PerformFSUBCombine(N, DAG, Subtarget);
27440 case ISD::FNEG: return PerformFNEGCombine(N, DAG, Subtarget);
27441 case ISD::TRUNCATE: return PerformTRUNCATECombine(N, DAG, Subtarget);
27443 case X86ISD::FOR: return PerformFORCombine(N, DAG, Subtarget);
27445 case X86ISD::FMAX: return PerformFMinFMaxCombine(N, DAG);
27446 case ISD::FMAXNUM: return performFMaxNumCombine(N, DAG, Subtarget);
27447 case X86ISD::FAND: return PerformFANDCombine(N, DAG, Subtarget);
27448 case X86ISD::FANDN: return PerformFANDNCombine(N, DAG, Subtarget);
27449 case X86ISD::BT: return PerformBTCombine(N, DAG, DCI);
27450 case X86ISD::VZEXT_MOVL: return PerformVZEXT_MOVLCombine(N, DAG);
27451 case ISD::ANY_EXTEND:
27452 case ISD::ZERO_EXTEND: return PerformZExtCombine(N, DAG, DCI, Subtarget);
27453 case ISD::SIGN_EXTEND: return PerformSExtCombine(N, DAG, DCI, Subtarget);
27454 case ISD::SIGN_EXTEND_INREG:
27455 return PerformSIGN_EXTEND_INREGCombine(N, DAG, Subtarget);
27456 case ISD::SETCC: return PerformISDSETCCCombine(N, DAG, Subtarget);
27457 case X86ISD::SETCC: return PerformSETCCCombine(N, DAG, DCI, Subtarget);
27458 case X86ISD::BRCOND: return PerformBrCondCombine(N, DAG, DCI, Subtarget);
27459 case X86ISD::VZEXT: return performVZEXTCombine(N, DAG, DCI, Subtarget);
27460 case X86ISD::SHUFP: // Handle all target specific shuffles
27461 case X86ISD::PALIGNR:
27462 case X86ISD::UNPCKH:
27463 case X86ISD::UNPCKL:
27464 case X86ISD::MOVHLPS:
27465 case X86ISD::MOVLHPS:
27466 case X86ISD::PSHUFB:
27467 case X86ISD::PSHUFD:
27468 case X86ISD::PSHUFHW:
27469 case X86ISD::PSHUFLW:
27470 case X86ISD::MOVSS:
27471 case X86ISD::MOVSD:
27472 case X86ISD::VPERMILPI:
27473 case X86ISD::VPERM2X128:
27474 case ISD::VECTOR_SHUFFLE: return PerformShuffleCombine(N, DAG, DCI,Subtarget);
27475 case ISD::FMA: return PerformFMACombine(N, DAG, Subtarget);
27476 case X86ISD::BLENDI: return PerformBLENDICombine(N, DAG);
27478 case ISD::MSCATTER: return PerformGatherScatterCombine(N, DAG);
27484 /// isTypeDesirableForOp - Return true if the target has native support for
27485 /// the specified value type and it is 'desirable' to use the type for the
27486 /// given node type. e.g. On x86 i16 is legal, but undesirable since i16
27487 /// instruction encodings are longer and some i16 instructions are slow.
27488 bool X86TargetLowering::isTypeDesirableForOp(unsigned Opc, EVT VT) const {
27489 if (!isTypeLegal(VT))
27491 if (VT != MVT::i16)
27498 case ISD::SIGN_EXTEND:
27499 case ISD::ZERO_EXTEND:
27500 case ISD::ANY_EXTEND:
27513 /// IsDesirableToPromoteOp - This method query the target whether it is
27514 /// beneficial for dag combiner to promote the specified node. If true, it
27515 /// should return the desired promotion type by reference.
27516 bool X86TargetLowering::IsDesirableToPromoteOp(SDValue Op, EVT &PVT) const {
27517 EVT VT = Op.getValueType();
27518 if (VT != MVT::i16)
27521 bool Promote = false;
27522 bool Commute = false;
27523 switch (Op.getOpcode()) {
27526 LoadSDNode *LD = cast<LoadSDNode>(Op);
27527 // If the non-extending load has a single use and it's not live out, then it
27528 // might be folded.
27529 if (LD->getExtensionType() == ISD::NON_EXTLOAD /*&&
27530 Op.hasOneUse()*/) {
27531 for (SDNode::use_iterator UI = Op.getNode()->use_begin(),
27532 UE = Op.getNode()->use_end(); UI != UE; ++UI) {
27533 // The only case where we'd want to promote LOAD (rather then it being
27534 // promoted as an operand is when it's only use is liveout.
27535 if (UI->getOpcode() != ISD::CopyToReg)
27542 case ISD::SIGN_EXTEND:
27543 case ISD::ZERO_EXTEND:
27544 case ISD::ANY_EXTEND:
27549 SDValue N0 = Op.getOperand(0);
27550 // Look out for (store (shl (load), x)).
27551 if (MayFoldLoad(N0) && MayFoldIntoStore(Op))
27564 SDValue N0 = Op.getOperand(0);
27565 SDValue N1 = Op.getOperand(1);
27566 if (!Commute && MayFoldLoad(N1))
27568 // Avoid disabling potential load folding opportunities.
27569 if (MayFoldLoad(N0) && (!isa<ConstantSDNode>(N1) || MayFoldIntoStore(Op)))
27571 if (MayFoldLoad(N1) && (!isa<ConstantSDNode>(N0) || MayFoldIntoStore(Op)))
27581 //===----------------------------------------------------------------------===//
27582 // X86 Inline Assembly Support
27583 //===----------------------------------------------------------------------===//
27585 // Helper to match a string separated by whitespace.
27586 static bool matchAsm(StringRef S, ArrayRef<const char *> Pieces) {
27587 S = S.substr(S.find_first_not_of(" \t")); // Skip leading whitespace.
27589 for (StringRef Piece : Pieces) {
27590 if (!S.startswith(Piece)) // Check if the piece matches.
27593 S = S.substr(Piece.size());
27594 StringRef::size_type Pos = S.find_first_not_of(" \t");
27595 if (Pos == 0) // We matched a prefix.
27604 static bool clobbersFlagRegisters(const SmallVector<StringRef, 4> &AsmPieces) {
27606 if (AsmPieces.size() == 3 || AsmPieces.size() == 4) {
27607 if (std::count(AsmPieces.begin(), AsmPieces.end(), "~{cc}") &&
27608 std::count(AsmPieces.begin(), AsmPieces.end(), "~{flags}") &&
27609 std::count(AsmPieces.begin(), AsmPieces.end(), "~{fpsr}")) {
27611 if (AsmPieces.size() == 3)
27613 else if (std::count(AsmPieces.begin(), AsmPieces.end(), "~{dirflag}"))
27620 bool X86TargetLowering::ExpandInlineAsm(CallInst *CI) const {
27621 InlineAsm *IA = cast<InlineAsm>(CI->getCalledValue());
27623 std::string AsmStr = IA->getAsmString();
27625 IntegerType *Ty = dyn_cast<IntegerType>(CI->getType());
27626 if (!Ty || Ty->getBitWidth() % 16 != 0)
27629 // TODO: should remove alternatives from the asmstring: "foo {a|b}" -> "foo a"
27630 SmallVector<StringRef, 4> AsmPieces;
27631 SplitString(AsmStr, AsmPieces, ";\n");
27633 switch (AsmPieces.size()) {
27634 default: return false;
27636 // FIXME: this should verify that we are targeting a 486 or better. If not,
27637 // we will turn this bswap into something that will be lowered to logical
27638 // ops instead of emitting the bswap asm. For now, we don't support 486 or
27639 // lower so don't worry about this.
27641 if (matchAsm(AsmPieces[0], {"bswap", "$0"}) ||
27642 matchAsm(AsmPieces[0], {"bswapl", "$0"}) ||
27643 matchAsm(AsmPieces[0], {"bswapq", "$0"}) ||
27644 matchAsm(AsmPieces[0], {"bswap", "${0:q}"}) ||
27645 matchAsm(AsmPieces[0], {"bswapl", "${0:q}"}) ||
27646 matchAsm(AsmPieces[0], {"bswapq", "${0:q}"})) {
27647 // No need to check constraints, nothing other than the equivalent of
27648 // "=r,0" would be valid here.
27649 return IntrinsicLowering::LowerToByteSwap(CI);
27652 // rorw $$8, ${0:w} --> llvm.bswap.i16
27653 if (CI->getType()->isIntegerTy(16) &&
27654 IA->getConstraintString().compare(0, 5, "=r,0,") == 0 &&
27655 (matchAsm(AsmPieces[0], {"rorw", "$$8,", "${0:w}"}) ||
27656 matchAsm(AsmPieces[0], {"rolw", "$$8,", "${0:w}"}))) {
27658 StringRef ConstraintsStr = IA->getConstraintString();
27659 SplitString(StringRef(ConstraintsStr).substr(5), AsmPieces, ",");
27660 array_pod_sort(AsmPieces.begin(), AsmPieces.end());
27661 if (clobbersFlagRegisters(AsmPieces))
27662 return IntrinsicLowering::LowerToByteSwap(CI);
27666 if (CI->getType()->isIntegerTy(32) &&
27667 IA->getConstraintString().compare(0, 5, "=r,0,") == 0 &&
27668 matchAsm(AsmPieces[0], {"rorw", "$$8,", "${0:w}"}) &&
27669 matchAsm(AsmPieces[1], {"rorl", "$$16,", "$0"}) &&
27670 matchAsm(AsmPieces[2], {"rorw", "$$8,", "${0:w}"})) {
27672 StringRef ConstraintsStr = IA->getConstraintString();
27673 SplitString(StringRef(ConstraintsStr).substr(5), AsmPieces, ",");
27674 array_pod_sort(AsmPieces.begin(), AsmPieces.end());
27675 if (clobbersFlagRegisters(AsmPieces))
27676 return IntrinsicLowering::LowerToByteSwap(CI);
27679 if (CI->getType()->isIntegerTy(64)) {
27680 InlineAsm::ConstraintInfoVector Constraints = IA->ParseConstraints();
27681 if (Constraints.size() >= 2 &&
27682 Constraints[0].Codes.size() == 1 && Constraints[0].Codes[0] == "A" &&
27683 Constraints[1].Codes.size() == 1 && Constraints[1].Codes[0] == "0") {
27684 // bswap %eax / bswap %edx / xchgl %eax, %edx -> llvm.bswap.i64
27685 if (matchAsm(AsmPieces[0], {"bswap", "%eax"}) &&
27686 matchAsm(AsmPieces[1], {"bswap", "%edx"}) &&
27687 matchAsm(AsmPieces[2], {"xchgl", "%eax,", "%edx"}))
27688 return IntrinsicLowering::LowerToByteSwap(CI);
27696 /// getConstraintType - Given a constraint letter, return the type of
27697 /// constraint it is for this target.
27698 X86TargetLowering::ConstraintType
27699 X86TargetLowering::getConstraintType(StringRef Constraint) const {
27700 if (Constraint.size() == 1) {
27701 switch (Constraint[0]) {
27712 return C_RegisterClass;
27736 return TargetLowering::getConstraintType(Constraint);
27739 /// Examine constraint type and operand type and determine a weight value.
27740 /// This object must already have been set up with the operand type
27741 /// and the current alternative constraint selected.
27742 TargetLowering::ConstraintWeight
27743 X86TargetLowering::getSingleConstraintMatchWeight(
27744 AsmOperandInfo &info, const char *constraint) const {
27745 ConstraintWeight weight = CW_Invalid;
27746 Value *CallOperandVal = info.CallOperandVal;
27747 // If we don't have a value, we can't do a match,
27748 // but allow it at the lowest weight.
27749 if (!CallOperandVal)
27751 Type *type = CallOperandVal->getType();
27752 // Look at the constraint type.
27753 switch (*constraint) {
27755 weight = TargetLowering::getSingleConstraintMatchWeight(info, constraint);
27766 if (CallOperandVal->getType()->isIntegerTy())
27767 weight = CW_SpecificReg;
27772 if (type->isFloatingPointTy())
27773 weight = CW_SpecificReg;
27776 if (type->isX86_MMXTy() && Subtarget->hasMMX())
27777 weight = CW_SpecificReg;
27781 if (((type->getPrimitiveSizeInBits() == 128) && Subtarget->hasSSE1()) ||
27782 ((type->getPrimitiveSizeInBits() == 256) && Subtarget->hasFp256()))
27783 weight = CW_Register;
27786 if (ConstantInt *C = dyn_cast<ConstantInt>(info.CallOperandVal)) {
27787 if (C->getZExtValue() <= 31)
27788 weight = CW_Constant;
27792 if (ConstantInt *C = dyn_cast<ConstantInt>(CallOperandVal)) {
27793 if (C->getZExtValue() <= 63)
27794 weight = CW_Constant;
27798 if (ConstantInt *C = dyn_cast<ConstantInt>(CallOperandVal)) {
27799 if ((C->getSExtValue() >= -0x80) && (C->getSExtValue() <= 0x7f))
27800 weight = CW_Constant;
27804 if (ConstantInt *C = dyn_cast<ConstantInt>(CallOperandVal)) {
27805 if ((C->getZExtValue() == 0xff) || (C->getZExtValue() == 0xffff))
27806 weight = CW_Constant;
27810 if (ConstantInt *C = dyn_cast<ConstantInt>(CallOperandVal)) {
27811 if (C->getZExtValue() <= 3)
27812 weight = CW_Constant;
27816 if (ConstantInt *C = dyn_cast<ConstantInt>(CallOperandVal)) {
27817 if (C->getZExtValue() <= 0xff)
27818 weight = CW_Constant;
27823 if (isa<ConstantFP>(CallOperandVal)) {
27824 weight = CW_Constant;
27828 if (ConstantInt *C = dyn_cast<ConstantInt>(CallOperandVal)) {
27829 if ((C->getSExtValue() >= -0x80000000LL) &&
27830 (C->getSExtValue() <= 0x7fffffffLL))
27831 weight = CW_Constant;
27835 if (ConstantInt *C = dyn_cast<ConstantInt>(CallOperandVal)) {
27836 if (C->getZExtValue() <= 0xffffffff)
27837 weight = CW_Constant;
27844 /// LowerXConstraint - try to replace an X constraint, which matches anything,
27845 /// with another that has more specific requirements based on the type of the
27846 /// corresponding operand.
27847 const char *X86TargetLowering::
27848 LowerXConstraint(EVT ConstraintVT) const {
27849 // FP X constraints get lowered to SSE1/2 registers if available, otherwise
27850 // 'f' like normal targets.
27851 if (ConstraintVT.isFloatingPoint()) {
27852 if (Subtarget->hasSSE2())
27854 if (Subtarget->hasSSE1())
27858 return TargetLowering::LowerXConstraint(ConstraintVT);
27861 /// LowerAsmOperandForConstraint - Lower the specified operand into the Ops
27862 /// vector. If it is invalid, don't add anything to Ops.
27863 void X86TargetLowering::LowerAsmOperandForConstraint(SDValue Op,
27864 std::string &Constraint,
27865 std::vector<SDValue>&Ops,
27866 SelectionDAG &DAG) const {
27869 // Only support length 1 constraints for now.
27870 if (Constraint.length() > 1) return;
27872 char ConstraintLetter = Constraint[0];
27873 switch (ConstraintLetter) {
27876 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op)) {
27877 if (C->getZExtValue() <= 31) {
27878 Result = DAG.getTargetConstant(C->getZExtValue(), SDLoc(Op),
27879 Op.getValueType());
27885 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op)) {
27886 if (C->getZExtValue() <= 63) {
27887 Result = DAG.getTargetConstant(C->getZExtValue(), SDLoc(Op),
27888 Op.getValueType());
27894 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op)) {
27895 if (isInt<8>(C->getSExtValue())) {
27896 Result = DAG.getTargetConstant(C->getZExtValue(), SDLoc(Op),
27897 Op.getValueType());
27903 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op)) {
27904 if (C->getZExtValue() == 0xff || C->getZExtValue() == 0xffff ||
27905 (Subtarget->is64Bit() && C->getZExtValue() == 0xffffffff)) {
27906 Result = DAG.getTargetConstant(C->getSExtValue(), SDLoc(Op),
27907 Op.getValueType());
27913 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op)) {
27914 if (C->getZExtValue() <= 3) {
27915 Result = DAG.getTargetConstant(C->getZExtValue(), SDLoc(Op),
27916 Op.getValueType());
27922 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op)) {
27923 if (C->getZExtValue() <= 255) {
27924 Result = DAG.getTargetConstant(C->getZExtValue(), SDLoc(Op),
27925 Op.getValueType());
27931 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op)) {
27932 if (C->getZExtValue() <= 127) {
27933 Result = DAG.getTargetConstant(C->getZExtValue(), SDLoc(Op),
27934 Op.getValueType());
27940 // 32-bit signed value
27941 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op)) {
27942 if (ConstantInt::isValueValidForType(Type::getInt32Ty(*DAG.getContext()),
27943 C->getSExtValue())) {
27944 // Widen to 64 bits here to get it sign extended.
27945 Result = DAG.getTargetConstant(C->getSExtValue(), SDLoc(Op), MVT::i64);
27948 // FIXME gcc accepts some relocatable values here too, but only in certain
27949 // memory models; it's complicated.
27954 // 32-bit unsigned value
27955 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op)) {
27956 if (ConstantInt::isValueValidForType(Type::getInt32Ty(*DAG.getContext()),
27957 C->getZExtValue())) {
27958 Result = DAG.getTargetConstant(C->getZExtValue(), SDLoc(Op),
27959 Op.getValueType());
27963 // FIXME gcc accepts some relocatable values here too, but only in certain
27964 // memory models; it's complicated.
27968 // Literal immediates are always ok.
27969 if (ConstantSDNode *CST = dyn_cast<ConstantSDNode>(Op)) {
27970 // Widen to 64 bits here to get it sign extended.
27971 Result = DAG.getTargetConstant(CST->getSExtValue(), SDLoc(Op), MVT::i64);
27975 // In any sort of PIC mode addresses need to be computed at runtime by
27976 // adding in a register or some sort of table lookup. These can't
27977 // be used as immediates.
27978 if (Subtarget->isPICStyleGOT() || Subtarget->isPICStyleStubPIC())
27981 // If we are in non-pic codegen mode, we allow the address of a global (with
27982 // an optional displacement) to be used with 'i'.
27983 GlobalAddressSDNode *GA = nullptr;
27984 int64_t Offset = 0;
27986 // Match either (GA), (GA+C), (GA+C1+C2), etc.
27988 if ((GA = dyn_cast<GlobalAddressSDNode>(Op))) {
27989 Offset += GA->getOffset();
27991 } else if (Op.getOpcode() == ISD::ADD) {
27992 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op.getOperand(1))) {
27993 Offset += C->getZExtValue();
27994 Op = Op.getOperand(0);
27997 } else if (Op.getOpcode() == ISD::SUB) {
27998 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op.getOperand(1))) {
27999 Offset += -C->getZExtValue();
28000 Op = Op.getOperand(0);
28005 // Otherwise, this isn't something we can handle, reject it.
28009 const GlobalValue *GV = GA->getGlobal();
28010 // If we require an extra load to get this address, as in PIC mode, we
28011 // can't accept it.
28012 if (isGlobalStubReference(
28013 Subtarget->ClassifyGlobalReference(GV, DAG.getTarget())))
28016 Result = DAG.getTargetGlobalAddress(GV, SDLoc(Op),
28017 GA->getValueType(0), Offset);
28022 if (Result.getNode()) {
28023 Ops.push_back(Result);
28026 return TargetLowering::LowerAsmOperandForConstraint(Op, Constraint, Ops, DAG);
28029 std::pair<unsigned, const TargetRegisterClass *>
28030 X86TargetLowering::getRegForInlineAsmConstraint(const TargetRegisterInfo *TRI,
28031 StringRef Constraint,
28033 // First, see if this is a constraint that directly corresponds to an LLVM
28035 if (Constraint.size() == 1) {
28036 // GCC Constraint Letters
28037 switch (Constraint[0]) {
28039 // TODO: Slight differences here in allocation order and leaving
28040 // RIP in the class. Do they matter any more here than they do
28041 // in the normal allocation?
28042 case 'q': // GENERAL_REGS in 64-bit mode, Q_REGS in 32-bit mode.
28043 if (Subtarget->is64Bit()) {
28044 if (VT == MVT::i32 || VT == MVT::f32)
28045 return std::make_pair(0U, &X86::GR32RegClass);
28046 if (VT == MVT::i16)
28047 return std::make_pair(0U, &X86::GR16RegClass);
28048 if (VT == MVT::i8 || VT == MVT::i1)
28049 return std::make_pair(0U, &X86::GR8RegClass);
28050 if (VT == MVT::i64 || VT == MVT::f64)
28051 return std::make_pair(0U, &X86::GR64RegClass);
28054 // 32-bit fallthrough
28055 case 'Q': // Q_REGS
28056 if (VT == MVT::i32 || VT == MVT::f32)
28057 return std::make_pair(0U, &X86::GR32_ABCDRegClass);
28058 if (VT == MVT::i16)
28059 return std::make_pair(0U, &X86::GR16_ABCDRegClass);
28060 if (VT == MVT::i8 || VT == MVT::i1)
28061 return std::make_pair(0U, &X86::GR8_ABCD_LRegClass);
28062 if (VT == MVT::i64)
28063 return std::make_pair(0U, &X86::GR64_ABCDRegClass);
28065 case 'r': // GENERAL_REGS
28066 case 'l': // INDEX_REGS
28067 if (VT == MVT::i8 || VT == MVT::i1)
28068 return std::make_pair(0U, &X86::GR8RegClass);
28069 if (VT == MVT::i16)
28070 return std::make_pair(0U, &X86::GR16RegClass);
28071 if (VT == MVT::i32 || VT == MVT::f32 || !Subtarget->is64Bit())
28072 return std::make_pair(0U, &X86::GR32RegClass);
28073 return std::make_pair(0U, &X86::GR64RegClass);
28074 case 'R': // LEGACY_REGS
28075 if (VT == MVT::i8 || VT == MVT::i1)
28076 return std::make_pair(0U, &X86::GR8_NOREXRegClass);
28077 if (VT == MVT::i16)
28078 return std::make_pair(0U, &X86::GR16_NOREXRegClass);
28079 if (VT == MVT::i32 || !Subtarget->is64Bit())
28080 return std::make_pair(0U, &X86::GR32_NOREXRegClass);
28081 return std::make_pair(0U, &X86::GR64_NOREXRegClass);
28082 case 'f': // FP Stack registers.
28083 // If SSE is enabled for this VT, use f80 to ensure the isel moves the
28084 // value to the correct fpstack register class.
28085 if (VT == MVT::f32 && !isScalarFPTypeInSSEReg(VT))
28086 return std::make_pair(0U, &X86::RFP32RegClass);
28087 if (VT == MVT::f64 && !isScalarFPTypeInSSEReg(VT))
28088 return std::make_pair(0U, &X86::RFP64RegClass);
28089 return std::make_pair(0U, &X86::RFP80RegClass);
28090 case 'y': // MMX_REGS if MMX allowed.
28091 if (!Subtarget->hasMMX()) break;
28092 return std::make_pair(0U, &X86::VR64RegClass);
28093 case 'Y': // SSE_REGS if SSE2 allowed
28094 if (!Subtarget->hasSSE2()) break;
28096 case 'x': // SSE_REGS if SSE1 allowed or AVX_REGS if AVX allowed
28097 if (!Subtarget->hasSSE1()) break;
28099 switch (VT.SimpleTy) {
28101 // Scalar SSE types.
28104 return std::make_pair(0U, &X86::FR32RegClass);
28107 return std::make_pair(0U, &X86::FR64RegClass);
28108 // TODO: Handle f128 and i128 in FR128RegClass after it is tested well.
28116 return std::make_pair(0U, &X86::VR128RegClass);
28124 return std::make_pair(0U, &X86::VR256RegClass);
28129 return std::make_pair(0U, &X86::VR512RegClass);
28135 // Use the default implementation in TargetLowering to convert the register
28136 // constraint into a member of a register class.
28137 std::pair<unsigned, const TargetRegisterClass*> Res;
28138 Res = TargetLowering::getRegForInlineAsmConstraint(TRI, Constraint, VT);
28140 // Not found as a standard register?
28142 // Map st(0) -> st(7) -> ST0
28143 if (Constraint.size() == 7 && Constraint[0] == '{' &&
28144 tolower(Constraint[1]) == 's' &&
28145 tolower(Constraint[2]) == 't' &&
28146 Constraint[3] == '(' &&
28147 (Constraint[4] >= '0' && Constraint[4] <= '7') &&
28148 Constraint[5] == ')' &&
28149 Constraint[6] == '}') {
28151 Res.first = X86::FP0+Constraint[4]-'0';
28152 Res.second = &X86::RFP80RegClass;
28156 // GCC allows "st(0)" to be called just plain "st".
28157 if (StringRef("{st}").equals_lower(Constraint)) {
28158 Res.first = X86::FP0;
28159 Res.second = &X86::RFP80RegClass;
28164 if (StringRef("{flags}").equals_lower(Constraint)) {
28165 Res.first = X86::EFLAGS;
28166 Res.second = &X86::CCRRegClass;
28170 // 'A' means EAX + EDX.
28171 if (Constraint == "A") {
28172 Res.first = X86::EAX;
28173 Res.second = &X86::GR32_ADRegClass;
28179 // Otherwise, check to see if this is a register class of the wrong value
28180 // type. For example, we want to map "{ax},i32" -> {eax}, we don't want it to
28181 // turn into {ax},{dx}.
28182 // MVT::Other is used to specify clobber names.
28183 if (Res.second->hasType(VT) || VT == MVT::Other)
28184 return Res; // Correct type already, nothing to do.
28186 // Get a matching integer of the correct size. i.e. "ax" with MVT::32 should
28187 // return "eax". This should even work for things like getting 64bit integer
28188 // registers when given an f64 type.
28189 const TargetRegisterClass *Class = Res.second;
28190 if (Class == &X86::GR8RegClass || Class == &X86::GR16RegClass ||
28191 Class == &X86::GR32RegClass || Class == &X86::GR64RegClass) {
28192 unsigned Size = VT.getSizeInBits();
28193 MVT::SimpleValueType SimpleTy = Size == 1 || Size == 8 ? MVT::i8
28194 : Size == 16 ? MVT::i16
28195 : Size == 32 ? MVT::i32
28196 : Size == 64 ? MVT::i64
28198 unsigned DestReg = getX86SubSuperRegisterOrZero(Res.first, SimpleTy);
28200 Res.first = DestReg;
28201 Res.second = SimpleTy == MVT::i8 ? &X86::GR8RegClass
28202 : SimpleTy == MVT::i16 ? &X86::GR16RegClass
28203 : SimpleTy == MVT::i32 ? &X86::GR32RegClass
28204 : &X86::GR64RegClass;
28205 assert(Res.second->contains(Res.first) && "Register in register class");
28207 // No register found/type mismatch.
28209 Res.second = nullptr;
28211 } else if (Class == &X86::FR32RegClass || Class == &X86::FR64RegClass ||
28212 Class == &X86::VR128RegClass || Class == &X86::VR256RegClass ||
28213 Class == &X86::FR32XRegClass || Class == &X86::FR64XRegClass ||
28214 Class == &X86::VR128XRegClass || Class == &X86::VR256XRegClass ||
28215 Class == &X86::VR512RegClass) {
28216 // Handle references to XMM physical registers that got mapped into the
28217 // wrong class. This can happen with constraints like {xmm0} where the
28218 // target independent register mapper will just pick the first match it can
28219 // find, ignoring the required type.
28221 // TODO: Handle f128 and i128 in FR128RegClass after it is tested well.
28222 if (VT == MVT::f32 || VT == MVT::i32)
28223 Res.second = &X86::FR32RegClass;
28224 else if (VT == MVT::f64 || VT == MVT::i64)
28225 Res.second = &X86::FR64RegClass;
28226 else if (X86::VR128RegClass.hasType(VT))
28227 Res.second = &X86::VR128RegClass;
28228 else if (X86::VR256RegClass.hasType(VT))
28229 Res.second = &X86::VR256RegClass;
28230 else if (X86::VR512RegClass.hasType(VT))
28231 Res.second = &X86::VR512RegClass;
28233 // Type mismatch and not a clobber: Return an error;
28235 Res.second = nullptr;
28242 int X86TargetLowering::getScalingFactorCost(const DataLayout &DL,
28243 const AddrMode &AM, Type *Ty,
28244 unsigned AS) const {
28245 // Scaling factors are not free at all.
28246 // An indexed folded instruction, i.e., inst (reg1, reg2, scale),
28247 // will take 2 allocations in the out of order engine instead of 1
28248 // for plain addressing mode, i.e. inst (reg1).
28250 // vaddps (%rsi,%drx), %ymm0, %ymm1
28251 // Requires two allocations (one for the load, one for the computation)
28253 // vaddps (%rsi), %ymm0, %ymm1
28254 // Requires just 1 allocation, i.e., freeing allocations for other operations
28255 // and having less micro operations to execute.
28257 // For some X86 architectures, this is even worse because for instance for
28258 // stores, the complex addressing mode forces the instruction to use the
28259 // "load" ports instead of the dedicated "store" port.
28260 // E.g., on Haswell:
28261 // vmovaps %ymm1, (%r8, %rdi) can use port 2 or 3.
28262 // vmovaps %ymm1, (%r8) can use port 2, 3, or 7.
28263 if (isLegalAddressingMode(DL, AM, Ty, AS))
28264 // Scale represents reg2 * scale, thus account for 1
28265 // as soon as we use a second register.
28266 return AM.Scale != 0;
28270 bool X86TargetLowering::isIntDivCheap(EVT VT, AttributeSet Attr) const {
28271 // Integer division on x86 is expensive. However, when aggressively optimizing
28272 // for code size, we prefer to use a div instruction, as it is usually smaller
28273 // than the alternative sequence.
28274 // The exception to this is vector division. Since x86 doesn't have vector
28275 // integer division, leaving the division as-is is a loss even in terms of
28276 // size, because it will have to be scalarized, while the alternative code
28277 // sequence can be performed in vector form.
28278 bool OptSize = Attr.hasAttribute(AttributeSet::FunctionIndex,
28279 Attribute::MinSize);
28280 return OptSize && !VT.isVector();
28283 void X86TargetLowering::markInRegArguments(SelectionDAG &DAG,
28284 TargetLowering::ArgListTy& Args) const {
28285 // The MCU psABI requires some arguments to be passed in-register.
28286 // For regular calls, the inreg arguments are marked by the front-end.
28287 // However, for compiler generated library calls, we have to patch this
28289 if (!Subtarget->isTargetMCU() || !Args.size())
28292 unsigned FreeRegs = 3;
28293 for (auto &Arg : Args) {
28294 // For library functions, we do not expect any fancy types.
28295 unsigned Size = DAG.getDataLayout().getTypeSizeInBits(Arg.Ty);
28296 unsigned SizeInRegs = (Size + 31) / 32;
28297 if (SizeInRegs > 2 || SizeInRegs > FreeRegs)
28300 Arg.isInReg = true;
28301 FreeRegs -= SizeInRegs;