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 "X86ShuffleDecodeConstantPool.h"
22 #include "X86TargetMachine.h"
23 #include "X86TargetObjectFile.h"
24 #include "llvm/ADT/SmallBitVector.h"
25 #include "llvm/ADT/SmallSet.h"
26 #include "llvm/ADT/Statistic.h"
27 #include "llvm/ADT/StringExtras.h"
28 #include "llvm/ADT/StringSwitch.h"
29 #include "llvm/Analysis/EHPersonalities.h"
30 #include "llvm/CodeGen/IntrinsicLowering.h"
31 #include "llvm/CodeGen/MachineFrameInfo.h"
32 #include "llvm/CodeGen/MachineFunction.h"
33 #include "llvm/CodeGen/MachineInstrBuilder.h"
34 #include "llvm/CodeGen/MachineJumpTableInfo.h"
35 #include "llvm/CodeGen/MachineModuleInfo.h"
36 #include "llvm/CodeGen/MachineRegisterInfo.h"
37 #include "llvm/CodeGen/WinEHFuncInfo.h"
38 #include "llvm/IR/CallSite.h"
39 #include "llvm/IR/CallingConv.h"
40 #include "llvm/IR/Constants.h"
41 #include "llvm/IR/DerivedTypes.h"
42 #include "llvm/IR/Function.h"
43 #include "llvm/IR/GlobalAlias.h"
44 #include "llvm/IR/GlobalVariable.h"
45 #include "llvm/IR/Instructions.h"
46 #include "llvm/IR/Intrinsics.h"
47 #include "llvm/MC/MCAsmInfo.h"
48 #include "llvm/MC/MCContext.h"
49 #include "llvm/MC/MCExpr.h"
50 #include "llvm/MC/MCSymbol.h"
51 #include "llvm/Support/CommandLine.h"
52 #include "llvm/Support/Debug.h"
53 #include "llvm/Support/ErrorHandling.h"
54 #include "llvm/Support/MathExtras.h"
55 #include "llvm/Target/TargetOptions.h"
56 #include "X86IntrinsicsInfo.h"
62 #define DEBUG_TYPE "x86-isel"
64 STATISTIC(NumTailCalls, "Number of tail calls");
66 static cl::opt<bool> ExperimentalVectorWideningLegalization(
67 "x86-experimental-vector-widening-legalization", cl::init(false),
68 cl::desc("Enable an experimental vector type legalization through widening "
69 "rather than promotion."),
72 X86TargetLowering::X86TargetLowering(const X86TargetMachine &TM,
73 const X86Subtarget &STI)
74 : TargetLowering(TM), Subtarget(&STI) {
75 X86ScalarSSEf64 = Subtarget->hasSSE2();
76 X86ScalarSSEf32 = Subtarget->hasSSE1();
77 MVT PtrVT = MVT::getIntegerVT(8 * TM.getPointerSize());
79 // Set up the TargetLowering object.
81 // X86 is weird. It always uses i8 for shift amounts and setcc results.
82 setBooleanContents(ZeroOrOneBooleanContent);
83 // X86-SSE is even stranger. It uses -1 or 0 for vector masks.
84 setBooleanVectorContents(ZeroOrNegativeOneBooleanContent);
86 // For 64-bit, since we have so many registers, use the ILP scheduler.
87 // For 32-bit, use the register pressure specific scheduling.
88 // For Atom, always use ILP scheduling.
89 if (Subtarget->isAtom())
90 setSchedulingPreference(Sched::ILP);
91 else if (Subtarget->is64Bit())
92 setSchedulingPreference(Sched::ILP);
94 setSchedulingPreference(Sched::RegPressure);
95 const X86RegisterInfo *RegInfo = Subtarget->getRegisterInfo();
96 setStackPointerRegisterToSaveRestore(RegInfo->getStackRegister());
98 // Bypass expensive divides on Atom when compiling with O2.
99 if (TM.getOptLevel() >= CodeGenOpt::Default) {
100 if (Subtarget->hasSlowDivide32())
101 addBypassSlowDiv(32, 8);
102 if (Subtarget->hasSlowDivide64() && Subtarget->is64Bit())
103 addBypassSlowDiv(64, 16);
106 if (Subtarget->isTargetKnownWindowsMSVC()) {
107 // Setup Windows compiler runtime calls.
108 setLibcallName(RTLIB::SDIV_I64, "_alldiv");
109 setLibcallName(RTLIB::UDIV_I64, "_aulldiv");
110 setLibcallName(RTLIB::SREM_I64, "_allrem");
111 setLibcallName(RTLIB::UREM_I64, "_aullrem");
112 setLibcallName(RTLIB::MUL_I64, "_allmul");
113 setLibcallCallingConv(RTLIB::SDIV_I64, CallingConv::X86_StdCall);
114 setLibcallCallingConv(RTLIB::UDIV_I64, CallingConv::X86_StdCall);
115 setLibcallCallingConv(RTLIB::SREM_I64, CallingConv::X86_StdCall);
116 setLibcallCallingConv(RTLIB::UREM_I64, CallingConv::X86_StdCall);
117 setLibcallCallingConv(RTLIB::MUL_I64, CallingConv::X86_StdCall);
120 if (Subtarget->isTargetDarwin()) {
121 // Darwin should use _setjmp/_longjmp instead of setjmp/longjmp.
122 setUseUnderscoreSetJmp(false);
123 setUseUnderscoreLongJmp(false);
124 } else if (Subtarget->isTargetWindowsGNU()) {
125 // MS runtime is weird: it exports _setjmp, but longjmp!
126 setUseUnderscoreSetJmp(true);
127 setUseUnderscoreLongJmp(false);
129 setUseUnderscoreSetJmp(true);
130 setUseUnderscoreLongJmp(true);
133 // Set up the register classes.
134 addRegisterClass(MVT::i8, &X86::GR8RegClass);
135 addRegisterClass(MVT::i16, &X86::GR16RegClass);
136 addRegisterClass(MVT::i32, &X86::GR32RegClass);
137 if (Subtarget->is64Bit())
138 addRegisterClass(MVT::i64, &X86::GR64RegClass);
140 for (MVT VT : MVT::integer_valuetypes())
141 setLoadExtAction(ISD::SEXTLOAD, VT, MVT::i1, Promote);
143 // We don't accept any truncstore of integer registers.
144 setTruncStoreAction(MVT::i64, MVT::i32, Expand);
145 setTruncStoreAction(MVT::i64, MVT::i16, Expand);
146 setTruncStoreAction(MVT::i64, MVT::i8 , Expand);
147 setTruncStoreAction(MVT::i32, MVT::i16, Expand);
148 setTruncStoreAction(MVT::i32, MVT::i8 , Expand);
149 setTruncStoreAction(MVT::i16, MVT::i8, Expand);
151 setTruncStoreAction(MVT::f64, MVT::f32, Expand);
153 // SETOEQ and SETUNE require checking two conditions.
154 setCondCodeAction(ISD::SETOEQ, MVT::f32, Expand);
155 setCondCodeAction(ISD::SETOEQ, MVT::f64, Expand);
156 setCondCodeAction(ISD::SETOEQ, MVT::f80, Expand);
157 setCondCodeAction(ISD::SETUNE, MVT::f32, Expand);
158 setCondCodeAction(ISD::SETUNE, MVT::f64, Expand);
159 setCondCodeAction(ISD::SETUNE, MVT::f80, Expand);
161 // Promote all UINT_TO_FP to larger SINT_TO_FP's, as X86 doesn't have this
163 setOperationAction(ISD::UINT_TO_FP , MVT::i1 , Promote);
164 setOperationAction(ISD::UINT_TO_FP , MVT::i8 , Promote);
165 setOperationAction(ISD::UINT_TO_FP , MVT::i16 , Promote);
167 if (Subtarget->is64Bit()) {
168 if (!Subtarget->useSoftFloat() && Subtarget->hasAVX512())
169 // f32/f64 are legal, f80 is custom.
170 setOperationAction(ISD::UINT_TO_FP , MVT::i32 , Custom);
172 setOperationAction(ISD::UINT_TO_FP , MVT::i32 , Promote);
173 setOperationAction(ISD::UINT_TO_FP , MVT::i64 , Custom);
174 } else if (!Subtarget->useSoftFloat()) {
175 // We have an algorithm for SSE2->double, and we turn this into a
176 // 64-bit FILD followed by conditional FADD for other targets.
177 setOperationAction(ISD::UINT_TO_FP , MVT::i64 , Custom);
178 // We have an algorithm for SSE2, and we turn this into a 64-bit
179 // FILD or VCVTUSI2SS/SD for other targets.
180 setOperationAction(ISD::UINT_TO_FP , MVT::i32 , Custom);
183 // Promote i1/i8 SINT_TO_FP to larger SINT_TO_FP's, as X86 doesn't have
185 setOperationAction(ISD::SINT_TO_FP , MVT::i1 , Promote);
186 setOperationAction(ISD::SINT_TO_FP , MVT::i8 , Promote);
188 if (!Subtarget->useSoftFloat()) {
189 // SSE has no i16 to fp conversion, only i32
190 if (X86ScalarSSEf32) {
191 setOperationAction(ISD::SINT_TO_FP , MVT::i16 , Promote);
192 // f32 and f64 cases are Legal, f80 case is not
193 setOperationAction(ISD::SINT_TO_FP , MVT::i32 , Custom);
195 setOperationAction(ISD::SINT_TO_FP , MVT::i16 , Custom);
196 setOperationAction(ISD::SINT_TO_FP , MVT::i32 , Custom);
199 setOperationAction(ISD::SINT_TO_FP , MVT::i16 , Promote);
200 setOperationAction(ISD::SINT_TO_FP , MVT::i32 , Promote);
203 // Promote i1/i8 FP_TO_SINT to larger FP_TO_SINTS's, as X86 doesn't have
205 setOperationAction(ISD::FP_TO_SINT , MVT::i1 , Promote);
206 setOperationAction(ISD::FP_TO_SINT , MVT::i8 , Promote);
208 if (!Subtarget->useSoftFloat()) {
209 // In 32-bit mode these are custom lowered. In 64-bit mode F32 and F64
210 // are Legal, f80 is custom lowered.
211 setOperationAction(ISD::FP_TO_SINT , MVT::i64 , Custom);
212 setOperationAction(ISD::SINT_TO_FP , MVT::i64 , Custom);
214 if (X86ScalarSSEf32) {
215 setOperationAction(ISD::FP_TO_SINT , MVT::i16 , Promote);
216 // f32 and f64 cases are Legal, f80 case is not
217 setOperationAction(ISD::FP_TO_SINT , MVT::i32 , Custom);
219 setOperationAction(ISD::FP_TO_SINT , MVT::i16 , Custom);
220 setOperationAction(ISD::FP_TO_SINT , MVT::i32 , Custom);
223 setOperationAction(ISD::FP_TO_SINT , MVT::i16 , Promote);
224 setOperationAction(ISD::FP_TO_SINT , MVT::i32 , Expand);
225 setOperationAction(ISD::FP_TO_SINT , MVT::i64 , Expand);
228 // Handle FP_TO_UINT by promoting the destination to a larger signed
230 setOperationAction(ISD::FP_TO_UINT , MVT::i1 , Promote);
231 setOperationAction(ISD::FP_TO_UINT , MVT::i8 , Promote);
232 setOperationAction(ISD::FP_TO_UINT , MVT::i16 , Promote);
234 if (Subtarget->is64Bit()) {
235 if (!Subtarget->useSoftFloat() && Subtarget->hasAVX512()) {
236 // FP_TO_UINT-i32/i64 is legal for f32/f64, but custom for f80.
237 setOperationAction(ISD::FP_TO_UINT , MVT::i32 , Custom);
238 setOperationAction(ISD::FP_TO_UINT , MVT::i64 , Custom);
240 setOperationAction(ISD::FP_TO_UINT , MVT::i32 , Promote);
241 setOperationAction(ISD::FP_TO_UINT , MVT::i64 , Expand);
243 } else if (!Subtarget->useSoftFloat()) {
244 // Since AVX is a superset of SSE3, only check for SSE here.
245 if (Subtarget->hasSSE1() && !Subtarget->hasSSE3())
246 // Expand FP_TO_UINT into a select.
247 // FIXME: We would like to use a Custom expander here eventually to do
248 // the optimal thing for SSE vs. the default expansion in the legalizer.
249 setOperationAction(ISD::FP_TO_UINT , MVT::i32 , Expand);
251 // With AVX512 we can use vcvts[ds]2usi for f32/f64->i32, f80 is custom.
252 // With SSE3 we can use fisttpll to convert to a signed i64; without
253 // SSE, we're stuck with a fistpll.
254 setOperationAction(ISD::FP_TO_UINT , MVT::i32 , Custom);
256 setOperationAction(ISD::FP_TO_UINT , MVT::i64 , Custom);
259 // TODO: when we have SSE, these could be more efficient, by using movd/movq.
260 if (!X86ScalarSSEf64) {
261 setOperationAction(ISD::BITCAST , MVT::f32 , Expand);
262 setOperationAction(ISD::BITCAST , MVT::i32 , Expand);
263 if (Subtarget->is64Bit()) {
264 setOperationAction(ISD::BITCAST , MVT::f64 , Expand);
265 // Without SSE, i64->f64 goes through memory.
266 setOperationAction(ISD::BITCAST , MVT::i64 , Expand);
270 // Scalar integer divide and remainder are lowered to use operations that
271 // produce two results, to match the available instructions. This exposes
272 // the two-result form to trivial CSE, which is able to combine x/y and x%y
273 // into a single instruction.
275 // Scalar integer multiply-high is also lowered to use two-result
276 // operations, to match the available instructions. However, plain multiply
277 // (low) operations are left as Legal, as there are single-result
278 // instructions for this in x86. Using the two-result multiply instructions
279 // when both high and low results are needed must be arranged by dagcombine.
280 for (auto VT : { MVT::i8, MVT::i16, MVT::i32, MVT::i64 }) {
281 setOperationAction(ISD::MULHS, VT, Expand);
282 setOperationAction(ISD::MULHU, VT, Expand);
283 setOperationAction(ISD::SDIV, VT, Expand);
284 setOperationAction(ISD::UDIV, VT, Expand);
285 setOperationAction(ISD::SREM, VT, Expand);
286 setOperationAction(ISD::UREM, VT, Expand);
288 // Add/Sub overflow ops with MVT::Glues are lowered to EFLAGS dependences.
289 setOperationAction(ISD::ADDC, VT, Custom);
290 setOperationAction(ISD::ADDE, VT, Custom);
291 setOperationAction(ISD::SUBC, VT, Custom);
292 setOperationAction(ISD::SUBE, VT, Custom);
295 setOperationAction(ISD::BR_JT , MVT::Other, Expand);
296 setOperationAction(ISD::BRCOND , MVT::Other, Custom);
297 setOperationAction(ISD::BR_CC , MVT::f32, Expand);
298 setOperationAction(ISD::BR_CC , MVT::f64, Expand);
299 setOperationAction(ISD::BR_CC , MVT::f80, Expand);
300 setOperationAction(ISD::BR_CC , MVT::f128, Expand);
301 setOperationAction(ISD::BR_CC , MVT::i8, Expand);
302 setOperationAction(ISD::BR_CC , MVT::i16, Expand);
303 setOperationAction(ISD::BR_CC , MVT::i32, Expand);
304 setOperationAction(ISD::BR_CC , MVT::i64, Expand);
305 setOperationAction(ISD::SELECT_CC , MVT::f32, Expand);
306 setOperationAction(ISD::SELECT_CC , MVT::f64, Expand);
307 setOperationAction(ISD::SELECT_CC , MVT::f80, Expand);
308 setOperationAction(ISD::SELECT_CC , MVT::f128, Expand);
309 setOperationAction(ISD::SELECT_CC , MVT::i8, Expand);
310 setOperationAction(ISD::SELECT_CC , MVT::i16, Expand);
311 setOperationAction(ISD::SELECT_CC , MVT::i32, Expand);
312 setOperationAction(ISD::SELECT_CC , MVT::i64, Expand);
313 if (Subtarget->is64Bit())
314 setOperationAction(ISD::SIGN_EXTEND_INREG, MVT::i32, Legal);
315 setOperationAction(ISD::SIGN_EXTEND_INREG, MVT::i16 , Legal);
316 setOperationAction(ISD::SIGN_EXTEND_INREG, MVT::i8 , Legal);
317 setOperationAction(ISD::SIGN_EXTEND_INREG, MVT::i1 , Expand);
318 setOperationAction(ISD::FP_ROUND_INREG , MVT::f32 , Expand);
320 if (Subtarget->is32Bit() && Subtarget->isTargetKnownWindowsMSVC()) {
321 // On 32 bit MSVC, `fmodf(f32)` is not defined - only `fmod(f64)`
322 // is. We should promote the value to 64-bits to solve this.
323 // This is what the CRT headers do - `fmodf` is an inline header
324 // function casting to f64 and calling `fmod`.
325 setOperationAction(ISD::FREM , MVT::f32 , Promote);
327 setOperationAction(ISD::FREM , MVT::f32 , Expand);
330 setOperationAction(ISD::FREM , MVT::f64 , Expand);
331 setOperationAction(ISD::FREM , MVT::f80 , Expand);
332 setOperationAction(ISD::FLT_ROUNDS_ , MVT::i32 , Custom);
334 // Promote the i8 variants and force them on up to i32 which has a shorter
336 setOperationAction(ISD::CTTZ , MVT::i8 , Promote);
337 AddPromotedToType (ISD::CTTZ , MVT::i8 , MVT::i32);
338 setOperationAction(ISD::CTTZ_ZERO_UNDEF , MVT::i8 , Promote);
339 AddPromotedToType (ISD::CTTZ_ZERO_UNDEF , MVT::i8 , MVT::i32);
340 if (Subtarget->hasBMI()) {
341 setOperationAction(ISD::CTTZ_ZERO_UNDEF, MVT::i16 , Expand);
342 setOperationAction(ISD::CTTZ_ZERO_UNDEF, MVT::i32 , Expand);
343 if (Subtarget->is64Bit())
344 setOperationAction(ISD::CTTZ_ZERO_UNDEF, MVT::i64, Expand);
346 setOperationAction(ISD::CTTZ , MVT::i16 , Custom);
347 setOperationAction(ISD::CTTZ , MVT::i32 , Custom);
348 if (Subtarget->is64Bit())
349 setOperationAction(ISD::CTTZ , MVT::i64 , Custom);
352 if (Subtarget->hasLZCNT()) {
353 // When promoting the i8 variants, force them to i32 for a shorter
355 setOperationAction(ISD::CTLZ , MVT::i8 , Promote);
356 AddPromotedToType (ISD::CTLZ , MVT::i8 , MVT::i32);
357 setOperationAction(ISD::CTLZ_ZERO_UNDEF, MVT::i8 , Promote);
358 AddPromotedToType (ISD::CTLZ_ZERO_UNDEF, MVT::i8 , MVT::i32);
359 setOperationAction(ISD::CTLZ_ZERO_UNDEF, MVT::i16 , Expand);
360 setOperationAction(ISD::CTLZ_ZERO_UNDEF, MVT::i32 , Expand);
361 if (Subtarget->is64Bit())
362 setOperationAction(ISD::CTLZ_ZERO_UNDEF, MVT::i64, Expand);
364 setOperationAction(ISD::CTLZ , MVT::i8 , Custom);
365 setOperationAction(ISD::CTLZ , MVT::i16 , Custom);
366 setOperationAction(ISD::CTLZ , MVT::i32 , Custom);
367 setOperationAction(ISD::CTLZ_ZERO_UNDEF, MVT::i8 , Custom);
368 setOperationAction(ISD::CTLZ_ZERO_UNDEF, MVT::i16 , Custom);
369 setOperationAction(ISD::CTLZ_ZERO_UNDEF, MVT::i32 , Custom);
370 if (Subtarget->is64Bit()) {
371 setOperationAction(ISD::CTLZ , MVT::i64 , Custom);
372 setOperationAction(ISD::CTLZ_ZERO_UNDEF, MVT::i64, Custom);
376 // Special handling for half-precision floating point conversions.
377 // If we don't have F16C support, then lower half float conversions
378 // into library calls.
379 if (Subtarget->useSoftFloat() || !Subtarget->hasF16C()) {
380 setOperationAction(ISD::FP16_TO_FP, MVT::f32, Expand);
381 setOperationAction(ISD::FP_TO_FP16, MVT::f32, Expand);
384 // There's never any support for operations beyond MVT::f32.
385 setOperationAction(ISD::FP16_TO_FP, MVT::f64, Expand);
386 setOperationAction(ISD::FP16_TO_FP, MVT::f80, Expand);
387 setOperationAction(ISD::FP_TO_FP16, MVT::f64, Expand);
388 setOperationAction(ISD::FP_TO_FP16, MVT::f80, Expand);
390 setLoadExtAction(ISD::EXTLOAD, MVT::f32, MVT::f16, Expand);
391 setLoadExtAction(ISD::EXTLOAD, MVT::f64, MVT::f16, Expand);
392 setLoadExtAction(ISD::EXTLOAD, MVT::f80, MVT::f16, Expand);
393 setTruncStoreAction(MVT::f32, MVT::f16, Expand);
394 setTruncStoreAction(MVT::f64, MVT::f16, Expand);
395 setTruncStoreAction(MVT::f80, MVT::f16, Expand);
397 if (Subtarget->hasPOPCNT()) {
398 setOperationAction(ISD::CTPOP , MVT::i8 , Promote);
400 setOperationAction(ISD::CTPOP , MVT::i8 , Expand);
401 setOperationAction(ISD::CTPOP , MVT::i16 , Expand);
402 setOperationAction(ISD::CTPOP , MVT::i32 , Expand);
403 if (Subtarget->is64Bit())
404 setOperationAction(ISD::CTPOP , MVT::i64 , Expand);
407 setOperationAction(ISD::READCYCLECOUNTER , MVT::i64 , Custom);
409 if (!Subtarget->hasMOVBE())
410 setOperationAction(ISD::BSWAP , MVT::i16 , Expand);
412 // These should be promoted to a larger select which is supported.
413 setOperationAction(ISD::SELECT , MVT::i1 , Promote);
414 // X86 wants to expand cmov itself.
415 setOperationAction(ISD::SELECT , MVT::i8 , Custom);
416 setOperationAction(ISD::SELECT , MVT::i16 , Custom);
417 setOperationAction(ISD::SELECT , MVT::i32 , Custom);
418 setOperationAction(ISD::SELECT , MVT::f32 , Custom);
419 setOperationAction(ISD::SELECT , MVT::f64 , Custom);
420 setOperationAction(ISD::SELECT , MVT::f80 , Custom);
421 setOperationAction(ISD::SELECT , MVT::f128 , Custom);
422 setOperationAction(ISD::SETCC , MVT::i8 , Custom);
423 setOperationAction(ISD::SETCC , MVT::i16 , Custom);
424 setOperationAction(ISD::SETCC , MVT::i32 , Custom);
425 setOperationAction(ISD::SETCC , MVT::f32 , Custom);
426 setOperationAction(ISD::SETCC , MVT::f64 , Custom);
427 setOperationAction(ISD::SETCC , MVT::f80 , Custom);
428 setOperationAction(ISD::SETCC , MVT::f128 , Custom);
429 setOperationAction(ISD::SETCCE , MVT::i8 , Custom);
430 setOperationAction(ISD::SETCCE , MVT::i16 , Custom);
431 setOperationAction(ISD::SETCCE , MVT::i32 , Custom);
432 if (Subtarget->is64Bit()) {
433 setOperationAction(ISD::SELECT , MVT::i64 , Custom);
434 setOperationAction(ISD::SETCC , MVT::i64 , Custom);
435 setOperationAction(ISD::SETCCE , MVT::i64 , Custom);
437 setOperationAction(ISD::EH_RETURN , MVT::Other, Custom);
438 // NOTE: EH_SJLJ_SETJMP/_LONGJMP supported here is NOT intended to support
439 // SjLj exception handling but a light-weight setjmp/longjmp replacement to
440 // support continuation, user-level threading, and etc.. As a result, no
441 // other SjLj exception interfaces are implemented and please don't build
442 // your own exception handling based on them.
443 // LLVM/Clang supports zero-cost DWARF exception handling.
444 setOperationAction(ISD::EH_SJLJ_SETJMP, MVT::i32, Custom);
445 setOperationAction(ISD::EH_SJLJ_LONGJMP, MVT::Other, Custom);
448 setOperationAction(ISD::ConstantPool , MVT::i32 , Custom);
449 setOperationAction(ISD::JumpTable , MVT::i32 , Custom);
450 setOperationAction(ISD::GlobalAddress , MVT::i32 , Custom);
451 setOperationAction(ISD::GlobalTLSAddress, MVT::i32 , Custom);
452 if (Subtarget->is64Bit())
453 setOperationAction(ISD::GlobalTLSAddress, MVT::i64, Custom);
454 setOperationAction(ISD::ExternalSymbol , MVT::i32 , Custom);
455 setOperationAction(ISD::BlockAddress , MVT::i32 , Custom);
456 if (Subtarget->is64Bit()) {
457 setOperationAction(ISD::ConstantPool , MVT::i64 , Custom);
458 setOperationAction(ISD::JumpTable , MVT::i64 , Custom);
459 setOperationAction(ISD::GlobalAddress , MVT::i64 , Custom);
460 setOperationAction(ISD::ExternalSymbol, MVT::i64 , Custom);
461 setOperationAction(ISD::BlockAddress , MVT::i64 , Custom);
463 // 64-bit addm sub, shl, sra, srl (iff 32-bit x86)
464 setOperationAction(ISD::SHL_PARTS , MVT::i32 , Custom);
465 setOperationAction(ISD::SRA_PARTS , MVT::i32 , Custom);
466 setOperationAction(ISD::SRL_PARTS , MVT::i32 , Custom);
467 if (Subtarget->is64Bit()) {
468 setOperationAction(ISD::SHL_PARTS , MVT::i64 , Custom);
469 setOperationAction(ISD::SRA_PARTS , MVT::i64 , Custom);
470 setOperationAction(ISD::SRL_PARTS , MVT::i64 , Custom);
473 if (Subtarget->hasSSE1())
474 setOperationAction(ISD::PREFETCH , MVT::Other, Legal);
476 setOperationAction(ISD::ATOMIC_FENCE , MVT::Other, Custom);
478 // Expand certain atomics
479 for (auto VT : { MVT::i8, MVT::i16, MVT::i32, MVT::i64 }) {
480 setOperationAction(ISD::ATOMIC_CMP_SWAP_WITH_SUCCESS, VT, Custom);
481 setOperationAction(ISD::ATOMIC_LOAD_SUB, VT, Custom);
482 setOperationAction(ISD::ATOMIC_STORE, VT, Custom);
485 if (Subtarget->hasCmpxchg16b()) {
486 setOperationAction(ISD::ATOMIC_CMP_SWAP_WITH_SUCCESS, MVT::i128, Custom);
489 // FIXME - use subtarget debug flags
490 if (!Subtarget->isTargetDarwin() && !Subtarget->isTargetELF() &&
491 !Subtarget->isTargetCygMing() && !Subtarget->isTargetWin64()) {
492 setOperationAction(ISD::EH_LABEL, MVT::Other, Expand);
495 setOperationAction(ISD::FRAME_TO_ARGS_OFFSET, MVT::i32, Custom);
496 setOperationAction(ISD::FRAME_TO_ARGS_OFFSET, MVT::i64, Custom);
498 setOperationAction(ISD::INIT_TRAMPOLINE, MVT::Other, Custom);
499 setOperationAction(ISD::ADJUST_TRAMPOLINE, MVT::Other, Custom);
501 setOperationAction(ISD::TRAP, MVT::Other, Legal);
502 setOperationAction(ISD::DEBUGTRAP, MVT::Other, Legal);
504 // VASTART needs to be custom lowered to use the VarArgsFrameIndex
505 setOperationAction(ISD::VASTART , MVT::Other, Custom);
506 setOperationAction(ISD::VAEND , MVT::Other, Expand);
507 if (Subtarget->is64Bit()) {
508 setOperationAction(ISD::VAARG , MVT::Other, Custom);
509 setOperationAction(ISD::VACOPY , MVT::Other, Custom);
511 // TargetInfo::CharPtrBuiltinVaList
512 setOperationAction(ISD::VAARG , MVT::Other, Expand);
513 setOperationAction(ISD::VACOPY , MVT::Other, Expand);
516 setOperationAction(ISD::STACKSAVE, MVT::Other, Expand);
517 setOperationAction(ISD::STACKRESTORE, MVT::Other, Expand);
519 setOperationAction(ISD::DYNAMIC_STACKALLOC, PtrVT, Custom);
521 // GC_TRANSITION_START and GC_TRANSITION_END need custom lowering.
522 setOperationAction(ISD::GC_TRANSITION_START, MVT::Other, Custom);
523 setOperationAction(ISD::GC_TRANSITION_END, MVT::Other, Custom);
525 if (!Subtarget->useSoftFloat() && X86ScalarSSEf64) {
526 // f32 and f64 use SSE.
527 // Set up the FP register classes.
528 addRegisterClass(MVT::f32, &X86::FR32RegClass);
529 addRegisterClass(MVT::f64, &X86::FR64RegClass);
531 // Use ANDPD to simulate FABS.
532 setOperationAction(ISD::FABS , MVT::f64, Custom);
533 setOperationAction(ISD::FABS , MVT::f32, Custom);
535 // Use XORP to simulate FNEG.
536 setOperationAction(ISD::FNEG , MVT::f64, Custom);
537 setOperationAction(ISD::FNEG , MVT::f32, Custom);
539 // Use ANDPD and ORPD to simulate FCOPYSIGN.
540 setOperationAction(ISD::FCOPYSIGN, MVT::f64, Custom);
541 setOperationAction(ISD::FCOPYSIGN, MVT::f32, Custom);
543 // Lower this to FGETSIGNx86 plus an AND.
544 setOperationAction(ISD::FGETSIGN, MVT::i64, Custom);
545 setOperationAction(ISD::FGETSIGN, MVT::i32, Custom);
547 // We don't support sin/cos/fmod
548 setOperationAction(ISD::FSIN , MVT::f64, Expand);
549 setOperationAction(ISD::FCOS , MVT::f64, Expand);
550 setOperationAction(ISD::FSINCOS, MVT::f64, Expand);
551 setOperationAction(ISD::FSIN , MVT::f32, Expand);
552 setOperationAction(ISD::FCOS , MVT::f32, Expand);
553 setOperationAction(ISD::FSINCOS, MVT::f32, Expand);
555 // Expand FP immediates into loads from the stack, except for the special
557 addLegalFPImmediate(APFloat(+0.0)); // xorpd
558 addLegalFPImmediate(APFloat(+0.0f)); // xorps
559 } else if (!Subtarget->useSoftFloat() && X86ScalarSSEf32) {
560 // Use SSE for f32, x87 for f64.
561 // Set up the FP register classes.
562 addRegisterClass(MVT::f32, &X86::FR32RegClass);
563 addRegisterClass(MVT::f64, &X86::RFP64RegClass);
565 // Use ANDPS to simulate FABS.
566 setOperationAction(ISD::FABS , MVT::f32, Custom);
568 // Use XORP to simulate FNEG.
569 setOperationAction(ISD::FNEG , MVT::f32, Custom);
571 setOperationAction(ISD::UNDEF, MVT::f64, Expand);
573 // Use ANDPS and ORPS to simulate FCOPYSIGN.
574 setOperationAction(ISD::FCOPYSIGN, MVT::f64, Expand);
575 setOperationAction(ISD::FCOPYSIGN, MVT::f32, Custom);
577 // We don't support sin/cos/fmod
578 setOperationAction(ISD::FSIN , MVT::f32, Expand);
579 setOperationAction(ISD::FCOS , MVT::f32, Expand);
580 setOperationAction(ISD::FSINCOS, MVT::f32, Expand);
582 // Special cases we handle for FP constants.
583 addLegalFPImmediate(APFloat(+0.0f)); // xorps
584 addLegalFPImmediate(APFloat(+0.0)); // FLD0
585 addLegalFPImmediate(APFloat(+1.0)); // FLD1
586 addLegalFPImmediate(APFloat(-0.0)); // FLD0/FCHS
587 addLegalFPImmediate(APFloat(-1.0)); // FLD1/FCHS
589 if (!TM.Options.UnsafeFPMath) {
590 setOperationAction(ISD::FSIN , MVT::f64, Expand);
591 setOperationAction(ISD::FCOS , MVT::f64, Expand);
592 setOperationAction(ISD::FSINCOS, MVT::f64, Expand);
594 } else if (!Subtarget->useSoftFloat()) {
595 // f32 and f64 in x87.
596 // Set up the FP register classes.
597 addRegisterClass(MVT::f64, &X86::RFP64RegClass);
598 addRegisterClass(MVT::f32, &X86::RFP32RegClass);
600 setOperationAction(ISD::UNDEF, MVT::f64, Expand);
601 setOperationAction(ISD::UNDEF, MVT::f32, Expand);
602 setOperationAction(ISD::FCOPYSIGN, MVT::f64, Expand);
603 setOperationAction(ISD::FCOPYSIGN, MVT::f32, Expand);
605 if (!TM.Options.UnsafeFPMath) {
606 setOperationAction(ISD::FSIN , MVT::f64, Expand);
607 setOperationAction(ISD::FSIN , MVT::f32, Expand);
608 setOperationAction(ISD::FCOS , MVT::f64, Expand);
609 setOperationAction(ISD::FCOS , MVT::f32, Expand);
610 setOperationAction(ISD::FSINCOS, MVT::f64, Expand);
611 setOperationAction(ISD::FSINCOS, MVT::f32, Expand);
613 addLegalFPImmediate(APFloat(+0.0)); // FLD0
614 addLegalFPImmediate(APFloat(+1.0)); // FLD1
615 addLegalFPImmediate(APFloat(-0.0)); // FLD0/FCHS
616 addLegalFPImmediate(APFloat(-1.0)); // FLD1/FCHS
617 addLegalFPImmediate(APFloat(+0.0f)); // FLD0
618 addLegalFPImmediate(APFloat(+1.0f)); // FLD1
619 addLegalFPImmediate(APFloat(-0.0f)); // FLD0/FCHS
620 addLegalFPImmediate(APFloat(-1.0f)); // FLD1/FCHS
623 // We don't support FMA.
624 setOperationAction(ISD::FMA, MVT::f64, Expand);
625 setOperationAction(ISD::FMA, MVT::f32, Expand);
627 // Long double always uses X87, except f128 in MMX.
628 if (!Subtarget->useSoftFloat()) {
629 if (Subtarget->is64Bit() && Subtarget->hasMMX()) {
630 addRegisterClass(MVT::f128, &X86::FR128RegClass);
631 ValueTypeActions.setTypeAction(MVT::f128, TypeSoftenFloat);
632 setOperationAction(ISD::FABS , MVT::f128, Custom);
633 setOperationAction(ISD::FNEG , MVT::f128, Custom);
634 setOperationAction(ISD::FCOPYSIGN, MVT::f128, Custom);
637 addRegisterClass(MVT::f80, &X86::RFP80RegClass);
638 setOperationAction(ISD::UNDEF, MVT::f80, Expand);
639 setOperationAction(ISD::FCOPYSIGN, MVT::f80, Expand);
641 APFloat TmpFlt = APFloat::getZero(APFloat::x87DoubleExtended);
642 addLegalFPImmediate(TmpFlt); // FLD0
644 addLegalFPImmediate(TmpFlt); // FLD0/FCHS
647 APFloat TmpFlt2(+1.0);
648 TmpFlt2.convert(APFloat::x87DoubleExtended, APFloat::rmNearestTiesToEven,
650 addLegalFPImmediate(TmpFlt2); // FLD1
651 TmpFlt2.changeSign();
652 addLegalFPImmediate(TmpFlt2); // FLD1/FCHS
655 if (!TM.Options.UnsafeFPMath) {
656 setOperationAction(ISD::FSIN , MVT::f80, Expand);
657 setOperationAction(ISD::FCOS , MVT::f80, Expand);
658 setOperationAction(ISD::FSINCOS, MVT::f80, Expand);
661 setOperationAction(ISD::FFLOOR, MVT::f80, Expand);
662 setOperationAction(ISD::FCEIL, MVT::f80, Expand);
663 setOperationAction(ISD::FTRUNC, MVT::f80, Expand);
664 setOperationAction(ISD::FRINT, MVT::f80, Expand);
665 setOperationAction(ISD::FNEARBYINT, MVT::f80, Expand);
666 setOperationAction(ISD::FMA, MVT::f80, Expand);
669 // Always use a library call for pow.
670 setOperationAction(ISD::FPOW , MVT::f32 , Expand);
671 setOperationAction(ISD::FPOW , MVT::f64 , Expand);
672 setOperationAction(ISD::FPOW , MVT::f80 , Expand);
674 setOperationAction(ISD::FLOG, MVT::f80, Expand);
675 setOperationAction(ISD::FLOG2, MVT::f80, Expand);
676 setOperationAction(ISD::FLOG10, MVT::f80, Expand);
677 setOperationAction(ISD::FEXP, MVT::f80, Expand);
678 setOperationAction(ISD::FEXP2, MVT::f80, Expand);
679 setOperationAction(ISD::FMINNUM, MVT::f80, Expand);
680 setOperationAction(ISD::FMAXNUM, MVT::f80, Expand);
682 // First set operation action for all vector types to either promote
683 // (for widening) or expand (for scalarization). Then we will selectively
684 // turn on ones that can be effectively codegen'd.
685 for (MVT VT : MVT::vector_valuetypes()) {
686 setOperationAction(ISD::ADD , VT, Expand);
687 setOperationAction(ISD::SUB , VT, Expand);
688 setOperationAction(ISD::FADD, VT, Expand);
689 setOperationAction(ISD::FNEG, VT, Expand);
690 setOperationAction(ISD::FSUB, VT, Expand);
691 setOperationAction(ISD::MUL , VT, Expand);
692 setOperationAction(ISD::FMUL, VT, Expand);
693 setOperationAction(ISD::SDIV, VT, Expand);
694 setOperationAction(ISD::UDIV, VT, Expand);
695 setOperationAction(ISD::FDIV, VT, Expand);
696 setOperationAction(ISD::SREM, VT, Expand);
697 setOperationAction(ISD::UREM, VT, Expand);
698 setOperationAction(ISD::LOAD, VT, Expand);
699 setOperationAction(ISD::VECTOR_SHUFFLE, VT, Expand);
700 setOperationAction(ISD::EXTRACT_VECTOR_ELT, VT,Expand);
701 setOperationAction(ISD::INSERT_VECTOR_ELT, VT, Expand);
702 setOperationAction(ISD::EXTRACT_SUBVECTOR, VT,Expand);
703 setOperationAction(ISD::INSERT_SUBVECTOR, VT,Expand);
704 setOperationAction(ISD::FABS, VT, Expand);
705 setOperationAction(ISD::FSIN, VT, Expand);
706 setOperationAction(ISD::FSINCOS, VT, Expand);
707 setOperationAction(ISD::FCOS, VT, Expand);
708 setOperationAction(ISD::FSINCOS, VT, Expand);
709 setOperationAction(ISD::FREM, VT, Expand);
710 setOperationAction(ISD::FMA, VT, Expand);
711 setOperationAction(ISD::FPOWI, VT, Expand);
712 setOperationAction(ISD::FSQRT, VT, Expand);
713 setOperationAction(ISD::FCOPYSIGN, VT, Expand);
714 setOperationAction(ISD::FFLOOR, VT, Expand);
715 setOperationAction(ISD::FCEIL, VT, Expand);
716 setOperationAction(ISD::FTRUNC, VT, Expand);
717 setOperationAction(ISD::FRINT, VT, Expand);
718 setOperationAction(ISD::FNEARBYINT, VT, Expand);
719 setOperationAction(ISD::SMUL_LOHI, VT, Expand);
720 setOperationAction(ISD::MULHS, VT, Expand);
721 setOperationAction(ISD::UMUL_LOHI, VT, Expand);
722 setOperationAction(ISD::MULHU, VT, Expand);
723 setOperationAction(ISD::SDIVREM, VT, Expand);
724 setOperationAction(ISD::UDIVREM, VT, Expand);
725 setOperationAction(ISD::FPOW, VT, Expand);
726 setOperationAction(ISD::CTPOP, VT, Expand);
727 setOperationAction(ISD::CTTZ, VT, Expand);
728 setOperationAction(ISD::CTTZ_ZERO_UNDEF, VT, Expand);
729 setOperationAction(ISD::CTLZ, VT, Expand);
730 setOperationAction(ISD::CTLZ_ZERO_UNDEF, VT, Expand);
731 setOperationAction(ISD::SHL, VT, Expand);
732 setOperationAction(ISD::SRA, VT, Expand);
733 setOperationAction(ISD::SRL, VT, Expand);
734 setOperationAction(ISD::ROTL, VT, Expand);
735 setOperationAction(ISD::ROTR, VT, Expand);
736 setOperationAction(ISD::BSWAP, VT, Expand);
737 setOperationAction(ISD::SETCC, VT, Expand);
738 setOperationAction(ISD::FLOG, VT, Expand);
739 setOperationAction(ISD::FLOG2, VT, Expand);
740 setOperationAction(ISD::FLOG10, VT, Expand);
741 setOperationAction(ISD::FEXP, VT, Expand);
742 setOperationAction(ISD::FEXP2, VT, Expand);
743 setOperationAction(ISD::FP_TO_UINT, VT, Expand);
744 setOperationAction(ISD::FP_TO_SINT, VT, Expand);
745 setOperationAction(ISD::UINT_TO_FP, VT, Expand);
746 setOperationAction(ISD::SINT_TO_FP, VT, Expand);
747 setOperationAction(ISD::SIGN_EXTEND_INREG, VT,Expand);
748 setOperationAction(ISD::TRUNCATE, VT, Expand);
749 setOperationAction(ISD::SIGN_EXTEND, VT, Expand);
750 setOperationAction(ISD::ZERO_EXTEND, VT, Expand);
751 setOperationAction(ISD::ANY_EXTEND, VT, Expand);
752 setOperationAction(ISD::VSELECT, VT, Expand);
753 setOperationAction(ISD::SELECT_CC, VT, Expand);
754 for (MVT InnerVT : MVT::vector_valuetypes()) {
755 setTruncStoreAction(InnerVT, VT, Expand);
757 setLoadExtAction(ISD::SEXTLOAD, InnerVT, VT, Expand);
758 setLoadExtAction(ISD::ZEXTLOAD, InnerVT, VT, Expand);
760 // N.b. ISD::EXTLOAD legality is basically ignored except for i1-like
761 // types, we have to deal with them whether we ask for Expansion or not.
762 // Setting Expand causes its own optimisation problems though, so leave
764 if (VT.getVectorElementType() == MVT::i1)
765 setLoadExtAction(ISD::EXTLOAD, InnerVT, VT, Expand);
767 // EXTLOAD for MVT::f16 vectors is not legal because f16 vectors are
768 // split/scalarized right now.
769 if (VT.getVectorElementType() == MVT::f16)
770 setLoadExtAction(ISD::EXTLOAD, InnerVT, VT, Expand);
774 // FIXME: In order to prevent SSE instructions being expanded to MMX ones
775 // with -msoft-float, disable use of MMX as well.
776 if (!Subtarget->useSoftFloat() && Subtarget->hasMMX()) {
777 addRegisterClass(MVT::x86mmx, &X86::VR64RegClass);
778 // No operations on x86mmx supported, everything uses intrinsics.
781 // MMX-sized vectors (other than x86mmx) are expected to be expanded
782 // into smaller operations.
783 for (MVT MMXTy : {MVT::v8i8, MVT::v4i16, MVT::v2i32, MVT::v1i64}) {
784 setOperationAction(ISD::MULHS, MMXTy, Expand);
785 setOperationAction(ISD::AND, MMXTy, Expand);
786 setOperationAction(ISD::OR, MMXTy, Expand);
787 setOperationAction(ISD::XOR, MMXTy, Expand);
788 setOperationAction(ISD::SCALAR_TO_VECTOR, MMXTy, Expand);
789 setOperationAction(ISD::SELECT, MMXTy, Expand);
790 setOperationAction(ISD::BITCAST, MMXTy, Expand);
792 setOperationAction(ISD::INSERT_VECTOR_ELT, MVT::v1i64, Expand);
794 if (!Subtarget->useSoftFloat() && Subtarget->hasSSE1()) {
795 addRegisterClass(MVT::v4f32, &X86::VR128RegClass);
797 setOperationAction(ISD::FADD, MVT::v4f32, Legal);
798 setOperationAction(ISD::FSUB, MVT::v4f32, Legal);
799 setOperationAction(ISD::FMUL, MVT::v4f32, Legal);
800 setOperationAction(ISD::FDIV, MVT::v4f32, Legal);
801 setOperationAction(ISD::FSQRT, MVT::v4f32, Legal);
802 setOperationAction(ISD::FNEG, MVT::v4f32, Custom);
803 setOperationAction(ISD::FABS, MVT::v4f32, Custom);
804 setOperationAction(ISD::LOAD, MVT::v4f32, Legal);
805 setOperationAction(ISD::BUILD_VECTOR, MVT::v4f32, Custom);
806 setOperationAction(ISD::VECTOR_SHUFFLE, MVT::v4f32, Custom);
807 setOperationAction(ISD::VSELECT, MVT::v4f32, Custom);
808 setOperationAction(ISD::EXTRACT_VECTOR_ELT, MVT::v4f32, Custom);
809 setOperationAction(ISD::SELECT, MVT::v4f32, Custom);
810 setOperationAction(ISD::UINT_TO_FP, MVT::v4i32, Custom);
813 if (!Subtarget->useSoftFloat() && Subtarget->hasSSE2()) {
814 addRegisterClass(MVT::v2f64, &X86::VR128RegClass);
816 // FIXME: Unfortunately, -soft-float and -no-implicit-float mean XMM
817 // registers cannot be used even for integer operations.
818 addRegisterClass(MVT::v16i8, &X86::VR128RegClass);
819 addRegisterClass(MVT::v8i16, &X86::VR128RegClass);
820 addRegisterClass(MVT::v4i32, &X86::VR128RegClass);
821 addRegisterClass(MVT::v2i64, &X86::VR128RegClass);
823 setOperationAction(ISD::ADD, MVT::v16i8, Legal);
824 setOperationAction(ISD::ADD, MVT::v8i16, Legal);
825 setOperationAction(ISD::ADD, MVT::v4i32, Legal);
826 setOperationAction(ISD::ADD, MVT::v2i64, Legal);
827 setOperationAction(ISD::MUL, MVT::v16i8, Custom);
828 setOperationAction(ISD::MUL, MVT::v4i32, Custom);
829 setOperationAction(ISD::MUL, MVT::v2i64, Custom);
830 setOperationAction(ISD::UMUL_LOHI, MVT::v4i32, Custom);
831 setOperationAction(ISD::SMUL_LOHI, MVT::v4i32, Custom);
832 setOperationAction(ISD::MULHU, MVT::v8i16, Legal);
833 setOperationAction(ISD::MULHS, MVT::v8i16, Legal);
834 setOperationAction(ISD::SUB, MVT::v16i8, Legal);
835 setOperationAction(ISD::SUB, MVT::v8i16, Legal);
836 setOperationAction(ISD::SUB, MVT::v4i32, Legal);
837 setOperationAction(ISD::SUB, MVT::v2i64, Legal);
838 setOperationAction(ISD::MUL, MVT::v8i16, Legal);
839 setOperationAction(ISD::FADD, MVT::v2f64, Legal);
840 setOperationAction(ISD::FSUB, MVT::v2f64, Legal);
841 setOperationAction(ISD::FMUL, MVT::v2f64, Legal);
842 setOperationAction(ISD::FDIV, MVT::v2f64, Legal);
843 setOperationAction(ISD::FSQRT, MVT::v2f64, Legal);
844 setOperationAction(ISD::FNEG, MVT::v2f64, Custom);
845 setOperationAction(ISD::FABS, MVT::v2f64, Custom);
847 setOperationAction(ISD::SMAX, MVT::v8i16, Legal);
848 setOperationAction(ISD::UMAX, MVT::v16i8, Legal);
849 setOperationAction(ISD::SMIN, MVT::v8i16, Legal);
850 setOperationAction(ISD::UMIN, MVT::v16i8, Legal);
852 setOperationAction(ISD::SETCC, MVT::v2i64, Custom);
853 setOperationAction(ISD::SETCC, MVT::v16i8, Custom);
854 setOperationAction(ISD::SETCC, MVT::v8i16, Custom);
855 setOperationAction(ISD::SETCC, MVT::v4i32, Custom);
857 setOperationAction(ISD::SCALAR_TO_VECTOR, MVT::v16i8, Custom);
858 setOperationAction(ISD::SCALAR_TO_VECTOR, MVT::v8i16, Custom);
859 setOperationAction(ISD::INSERT_VECTOR_ELT, MVT::v8i16, Custom);
860 setOperationAction(ISD::INSERT_VECTOR_ELT, MVT::v4i32, Custom);
861 setOperationAction(ISD::INSERT_VECTOR_ELT, MVT::v4f32, Custom);
863 setOperationAction(ISD::CTPOP, MVT::v16i8, Custom);
864 setOperationAction(ISD::CTPOP, MVT::v8i16, Custom);
865 setOperationAction(ISD::CTPOP, MVT::v4i32, Custom);
866 setOperationAction(ISD::CTPOP, MVT::v2i64, Custom);
868 setOperationAction(ISD::CTTZ, MVT::v16i8, Custom);
869 setOperationAction(ISD::CTTZ, MVT::v8i16, Custom);
870 setOperationAction(ISD::CTTZ, MVT::v4i32, Custom);
871 // ISD::CTTZ v2i64 - scalarization is faster.
872 setOperationAction(ISD::CTTZ_ZERO_UNDEF, MVT::v16i8, Custom);
873 setOperationAction(ISD::CTTZ_ZERO_UNDEF, MVT::v8i16, Custom);
874 setOperationAction(ISD::CTTZ_ZERO_UNDEF, MVT::v4i32, Custom);
875 // ISD::CTTZ_ZERO_UNDEF v2i64 - scalarization is faster.
877 // Custom lower build_vector, vector_shuffle, and extract_vector_elt.
878 for (auto VT : { MVT::v16i8, MVT::v8i16, MVT::v4i32 }) {
879 setOperationAction(ISD::BUILD_VECTOR, VT, Custom);
880 setOperationAction(ISD::VECTOR_SHUFFLE, VT, Custom);
881 setOperationAction(ISD::VSELECT, VT, Custom);
882 setOperationAction(ISD::EXTRACT_VECTOR_ELT, VT, Custom);
885 // We support custom legalizing of sext and anyext loads for specific
886 // memory vector types which we can load as a scalar (or sequence of
887 // scalars) and extend in-register to a legal 128-bit vector type. For sext
888 // loads these must work with a single scalar load.
889 for (MVT VT : MVT::integer_vector_valuetypes()) {
890 setLoadExtAction(ISD::SEXTLOAD, VT, MVT::v4i8, Custom);
891 setLoadExtAction(ISD::SEXTLOAD, VT, MVT::v4i16, Custom);
892 setLoadExtAction(ISD::SEXTLOAD, VT, MVT::v8i8, Custom);
893 setLoadExtAction(ISD::EXTLOAD, VT, MVT::v2i8, Custom);
894 setLoadExtAction(ISD::EXTLOAD, VT, MVT::v2i16, Custom);
895 setLoadExtAction(ISD::EXTLOAD, VT, MVT::v2i32, Custom);
896 setLoadExtAction(ISD::EXTLOAD, VT, MVT::v4i8, Custom);
897 setLoadExtAction(ISD::EXTLOAD, VT, MVT::v4i16, Custom);
898 setLoadExtAction(ISD::EXTLOAD, VT, MVT::v8i8, Custom);
901 setOperationAction(ISD::BUILD_VECTOR, MVT::v2f64, Custom);
902 setOperationAction(ISD::BUILD_VECTOR, MVT::v2i64, Custom);
903 setOperationAction(ISD::VECTOR_SHUFFLE, MVT::v2f64, Custom);
904 setOperationAction(ISD::VECTOR_SHUFFLE, MVT::v2i64, Custom);
905 setOperationAction(ISD::VSELECT, MVT::v2f64, Custom);
906 setOperationAction(ISD::VSELECT, MVT::v2i64, Custom);
907 setOperationAction(ISD::INSERT_VECTOR_ELT, MVT::v2f64, Custom);
908 setOperationAction(ISD::EXTRACT_VECTOR_ELT, MVT::v2f64, Custom);
910 if (Subtarget->is64Bit()) {
911 setOperationAction(ISD::INSERT_VECTOR_ELT, MVT::v2i64, Custom);
912 setOperationAction(ISD::EXTRACT_VECTOR_ELT, MVT::v2i64, Custom);
915 // Promote v16i8, v8i16, v4i32 load, select, and, or, xor to v2i64.
916 for (auto VT : { MVT::v16i8, MVT::v8i16, MVT::v4i32 }) {
917 setOperationAction(ISD::AND, VT, Promote);
918 AddPromotedToType (ISD::AND, VT, MVT::v2i64);
919 setOperationAction(ISD::OR, VT, Promote);
920 AddPromotedToType (ISD::OR, VT, MVT::v2i64);
921 setOperationAction(ISD::XOR, VT, Promote);
922 AddPromotedToType (ISD::XOR, VT, MVT::v2i64);
923 setOperationAction(ISD::LOAD, VT, Promote);
924 AddPromotedToType (ISD::LOAD, VT, MVT::v2i64);
925 setOperationAction(ISD::SELECT, VT, Promote);
926 AddPromotedToType (ISD::SELECT, VT, MVT::v2i64);
929 // Custom lower v2i64 and v2f64 selects.
930 setOperationAction(ISD::LOAD, MVT::v2f64, Legal);
931 setOperationAction(ISD::LOAD, MVT::v2i64, Legal);
932 setOperationAction(ISD::SELECT, MVT::v2f64, Custom);
933 setOperationAction(ISD::SELECT, MVT::v2i64, Custom);
935 setOperationAction(ISD::FP_TO_SINT, MVT::v4i32, Legal);
936 setOperationAction(ISD::SINT_TO_FP, MVT::v4i32, Legal);
938 setOperationAction(ISD::SINT_TO_FP, MVT::v2i32, Custom);
940 setOperationAction(ISD::UINT_TO_FP, MVT::v4i8, Custom);
941 setOperationAction(ISD::UINT_TO_FP, MVT::v4i16, Custom);
942 // As there is no 64-bit GPR available, we need build a special custom
943 // sequence to convert from v2i32 to v2f32.
944 if (!Subtarget->is64Bit())
945 setOperationAction(ISD::UINT_TO_FP, MVT::v2f32, Custom);
947 setOperationAction(ISD::FP_EXTEND, MVT::v2f32, Custom);
948 setOperationAction(ISD::FP_ROUND, MVT::v2f32, Custom);
950 for (MVT VT : MVT::fp_vector_valuetypes())
951 setLoadExtAction(ISD::EXTLOAD, VT, MVT::v2f32, Legal);
953 setOperationAction(ISD::BITCAST, MVT::v2i32, Custom);
954 setOperationAction(ISD::BITCAST, MVT::v4i16, Custom);
955 setOperationAction(ISD::BITCAST, MVT::v8i8, Custom);
958 if (!Subtarget->useSoftFloat() && Subtarget->hasSSE41()) {
959 for (MVT RoundedTy : {MVT::f32, MVT::f64, MVT::v4f32, MVT::v2f64}) {
960 setOperationAction(ISD::FFLOOR, RoundedTy, Legal);
961 setOperationAction(ISD::FCEIL, RoundedTy, Legal);
962 setOperationAction(ISD::FTRUNC, RoundedTy, Legal);
963 setOperationAction(ISD::FRINT, RoundedTy, Legal);
964 setOperationAction(ISD::FNEARBYINT, RoundedTy, Legal);
967 setOperationAction(ISD::SMAX, MVT::v16i8, Legal);
968 setOperationAction(ISD::SMAX, MVT::v4i32, Legal);
969 setOperationAction(ISD::UMAX, MVT::v8i16, Legal);
970 setOperationAction(ISD::UMAX, MVT::v4i32, Legal);
971 setOperationAction(ISD::SMIN, MVT::v16i8, Legal);
972 setOperationAction(ISD::SMIN, MVT::v4i32, Legal);
973 setOperationAction(ISD::UMIN, MVT::v8i16, Legal);
974 setOperationAction(ISD::UMIN, MVT::v4i32, Legal);
976 // FIXME: Do we need to handle scalar-to-vector here?
977 setOperationAction(ISD::MUL, MVT::v4i32, Legal);
979 // We directly match byte blends in the backend as they match the VSELECT
981 setOperationAction(ISD::VSELECT, MVT::v16i8, Legal);
983 // SSE41 brings specific instructions for doing vector sign extend even in
984 // cases where we don't have SRA.
985 for (MVT VT : MVT::integer_vector_valuetypes()) {
986 setLoadExtAction(ISD::SEXTLOAD, VT, MVT::v2i8, Custom);
987 setLoadExtAction(ISD::SEXTLOAD, VT, MVT::v2i16, Custom);
988 setLoadExtAction(ISD::SEXTLOAD, VT, MVT::v2i32, Custom);
991 // SSE41 also has vector sign/zero extending loads, PMOV[SZ]X
992 setLoadExtAction(ISD::SEXTLOAD, MVT::v8i16, MVT::v8i8, Legal);
993 setLoadExtAction(ISD::SEXTLOAD, MVT::v4i32, MVT::v4i8, Legal);
994 setLoadExtAction(ISD::SEXTLOAD, MVT::v2i64, MVT::v2i8, Legal);
995 setLoadExtAction(ISD::SEXTLOAD, MVT::v4i32, MVT::v4i16, Legal);
996 setLoadExtAction(ISD::SEXTLOAD, MVT::v2i64, MVT::v2i16, Legal);
997 setLoadExtAction(ISD::SEXTLOAD, MVT::v2i64, MVT::v2i32, Legal);
999 setLoadExtAction(ISD::ZEXTLOAD, MVT::v8i16, MVT::v8i8, Legal);
1000 setLoadExtAction(ISD::ZEXTLOAD, MVT::v4i32, MVT::v4i8, Legal);
1001 setLoadExtAction(ISD::ZEXTLOAD, MVT::v2i64, MVT::v2i8, Legal);
1002 setLoadExtAction(ISD::ZEXTLOAD, MVT::v4i32, MVT::v4i16, Legal);
1003 setLoadExtAction(ISD::ZEXTLOAD, MVT::v2i64, MVT::v2i16, Legal);
1004 setLoadExtAction(ISD::ZEXTLOAD, MVT::v2i64, MVT::v2i32, Legal);
1006 // i8 and i16 vectors are custom because the source register and source
1007 // source memory operand types are not the same width. f32 vectors are
1008 // custom since the immediate controlling the insert encodes additional
1010 setOperationAction(ISD::INSERT_VECTOR_ELT, MVT::v16i8, Custom);
1011 setOperationAction(ISD::INSERT_VECTOR_ELT, MVT::v8i16, Custom);
1012 setOperationAction(ISD::INSERT_VECTOR_ELT, MVT::v4i32, Custom);
1013 setOperationAction(ISD::INSERT_VECTOR_ELT, MVT::v4f32, Custom);
1015 setOperationAction(ISD::EXTRACT_VECTOR_ELT, MVT::v16i8, Custom);
1016 setOperationAction(ISD::EXTRACT_VECTOR_ELT, MVT::v8i16, Custom);
1017 setOperationAction(ISD::EXTRACT_VECTOR_ELT, MVT::v4i32, Custom);
1018 setOperationAction(ISD::EXTRACT_VECTOR_ELT, MVT::v4f32, Custom);
1020 // FIXME: these should be Legal, but that's only for the case where
1021 // the index is constant. For now custom expand to deal with that.
1022 if (Subtarget->is64Bit()) {
1023 setOperationAction(ISD::INSERT_VECTOR_ELT, MVT::v2i64, Custom);
1024 setOperationAction(ISD::EXTRACT_VECTOR_ELT, MVT::v2i64, Custom);
1028 if (Subtarget->hasSSE2()) {
1029 setOperationAction(ISD::SIGN_EXTEND_VECTOR_INREG, MVT::v2i64, Custom);
1030 setOperationAction(ISD::SIGN_EXTEND_VECTOR_INREG, MVT::v4i32, Custom);
1031 setOperationAction(ISD::SIGN_EXTEND_VECTOR_INREG, MVT::v8i16, Custom);
1033 setOperationAction(ISD::SRL, MVT::v8i16, Custom);
1034 setOperationAction(ISD::SRL, MVT::v16i8, Custom);
1036 setOperationAction(ISD::SHL, MVT::v8i16, Custom);
1037 setOperationAction(ISD::SHL, MVT::v16i8, Custom);
1039 setOperationAction(ISD::SRA, MVT::v8i16, Custom);
1040 setOperationAction(ISD::SRA, MVT::v16i8, Custom);
1042 // In the customized shift lowering, the legal cases in AVX2 will be
1044 setOperationAction(ISD::SRL, MVT::v2i64, Custom);
1045 setOperationAction(ISD::SRL, MVT::v4i32, Custom);
1047 setOperationAction(ISD::SHL, MVT::v2i64, Custom);
1048 setOperationAction(ISD::SHL, MVT::v4i32, Custom);
1050 setOperationAction(ISD::SRA, MVT::v2i64, Custom);
1051 setOperationAction(ISD::SRA, MVT::v4i32, Custom);
1054 if (Subtarget->hasXOP()) {
1055 setOperationAction(ISD::ROTL, MVT::v16i8, Custom);
1056 setOperationAction(ISD::ROTL, MVT::v8i16, Custom);
1057 setOperationAction(ISD::ROTL, MVT::v4i32, Custom);
1058 setOperationAction(ISD::ROTL, MVT::v2i64, Custom);
1059 setOperationAction(ISD::ROTL, MVT::v32i8, Custom);
1060 setOperationAction(ISD::ROTL, MVT::v16i16, Custom);
1061 setOperationAction(ISD::ROTL, MVT::v8i32, Custom);
1062 setOperationAction(ISD::ROTL, MVT::v4i64, Custom);
1065 if (!Subtarget->useSoftFloat() && Subtarget->hasFp256()) {
1066 addRegisterClass(MVT::v32i8, &X86::VR256RegClass);
1067 addRegisterClass(MVT::v16i16, &X86::VR256RegClass);
1068 addRegisterClass(MVT::v8i32, &X86::VR256RegClass);
1069 addRegisterClass(MVT::v8f32, &X86::VR256RegClass);
1070 addRegisterClass(MVT::v4i64, &X86::VR256RegClass);
1071 addRegisterClass(MVT::v4f64, &X86::VR256RegClass);
1073 setOperationAction(ISD::LOAD, MVT::v8f32, Legal);
1074 setOperationAction(ISD::LOAD, MVT::v4f64, Legal);
1075 setOperationAction(ISD::LOAD, MVT::v4i64, Legal);
1077 setOperationAction(ISD::FADD, MVT::v8f32, Legal);
1078 setOperationAction(ISD::FSUB, MVT::v8f32, Legal);
1079 setOperationAction(ISD::FMUL, MVT::v8f32, Legal);
1080 setOperationAction(ISD::FDIV, MVT::v8f32, Legal);
1081 setOperationAction(ISD::FSQRT, MVT::v8f32, Legal);
1082 setOperationAction(ISD::FFLOOR, MVT::v8f32, Legal);
1083 setOperationAction(ISD::FCEIL, MVT::v8f32, Legal);
1084 setOperationAction(ISD::FTRUNC, MVT::v8f32, Legal);
1085 setOperationAction(ISD::FRINT, MVT::v8f32, Legal);
1086 setOperationAction(ISD::FNEARBYINT, MVT::v8f32, Legal);
1087 setOperationAction(ISD::FNEG, MVT::v8f32, Custom);
1088 setOperationAction(ISD::FABS, MVT::v8f32, Custom);
1090 setOperationAction(ISD::FADD, MVT::v4f64, Legal);
1091 setOperationAction(ISD::FSUB, MVT::v4f64, Legal);
1092 setOperationAction(ISD::FMUL, MVT::v4f64, Legal);
1093 setOperationAction(ISD::FDIV, MVT::v4f64, Legal);
1094 setOperationAction(ISD::FSQRT, MVT::v4f64, Legal);
1095 setOperationAction(ISD::FFLOOR, MVT::v4f64, Legal);
1096 setOperationAction(ISD::FCEIL, MVT::v4f64, Legal);
1097 setOperationAction(ISD::FTRUNC, MVT::v4f64, Legal);
1098 setOperationAction(ISD::FRINT, MVT::v4f64, Legal);
1099 setOperationAction(ISD::FNEARBYINT, MVT::v4f64, Legal);
1100 setOperationAction(ISD::FNEG, MVT::v4f64, Custom);
1101 setOperationAction(ISD::FABS, MVT::v4f64, Custom);
1103 // (fp_to_int:v8i16 (v8f32 ..)) requires the result type to be promoted
1104 // even though v8i16 is a legal type.
1105 setOperationAction(ISD::FP_TO_SINT, MVT::v8i16, Promote);
1106 setOperationAction(ISD::FP_TO_UINT, MVT::v8i16, Promote);
1107 setOperationAction(ISD::FP_TO_SINT, MVT::v8i32, Legal);
1109 setOperationAction(ISD::SINT_TO_FP, MVT::v8i16, Promote);
1110 setOperationAction(ISD::SINT_TO_FP, MVT::v8i32, Legal);
1111 setOperationAction(ISD::FP_ROUND, MVT::v4f32, Legal);
1113 setOperationAction(ISD::UINT_TO_FP, MVT::v8i8, Custom);
1114 setOperationAction(ISD::UINT_TO_FP, MVT::v8i16, Custom);
1116 for (MVT VT : MVT::fp_vector_valuetypes())
1117 setLoadExtAction(ISD::EXTLOAD, VT, MVT::v4f32, Legal);
1119 setOperationAction(ISD::SRL, MVT::v16i16, Custom);
1120 setOperationAction(ISD::SRL, MVT::v32i8, Custom);
1122 setOperationAction(ISD::SHL, MVT::v16i16, Custom);
1123 setOperationAction(ISD::SHL, MVT::v32i8, Custom);
1125 setOperationAction(ISD::SRA, MVT::v16i16, Custom);
1126 setOperationAction(ISD::SRA, MVT::v32i8, Custom);
1128 setOperationAction(ISD::SETCC, MVT::v32i8, Custom);
1129 setOperationAction(ISD::SETCC, MVT::v16i16, Custom);
1130 setOperationAction(ISD::SETCC, MVT::v8i32, Custom);
1131 setOperationAction(ISD::SETCC, MVT::v4i64, Custom);
1133 setOperationAction(ISD::SELECT, MVT::v4f64, Custom);
1134 setOperationAction(ISD::SELECT, MVT::v4i64, Custom);
1135 setOperationAction(ISD::SELECT, MVT::v8f32, Custom);
1137 setOperationAction(ISD::SIGN_EXTEND, MVT::v4i64, Custom);
1138 setOperationAction(ISD::SIGN_EXTEND, MVT::v8i32, Custom);
1139 setOperationAction(ISD::SIGN_EXTEND, MVT::v16i16, Custom);
1140 setOperationAction(ISD::ZERO_EXTEND, MVT::v4i64, Custom);
1141 setOperationAction(ISD::ZERO_EXTEND, MVT::v8i32, Custom);
1142 setOperationAction(ISD::ZERO_EXTEND, MVT::v16i16, Custom);
1143 setOperationAction(ISD::ANY_EXTEND, MVT::v4i64, Custom);
1144 setOperationAction(ISD::ANY_EXTEND, MVT::v8i32, Custom);
1145 setOperationAction(ISD::ANY_EXTEND, MVT::v16i16, Custom);
1146 setOperationAction(ISD::TRUNCATE, MVT::v16i8, Custom);
1147 setOperationAction(ISD::TRUNCATE, MVT::v8i16, Custom);
1148 setOperationAction(ISD::TRUNCATE, MVT::v4i32, Custom);
1150 setOperationAction(ISD::CTPOP, MVT::v32i8, Custom);
1151 setOperationAction(ISD::CTPOP, MVT::v16i16, Custom);
1152 setOperationAction(ISD::CTPOP, MVT::v8i32, Custom);
1153 setOperationAction(ISD::CTPOP, MVT::v4i64, Custom);
1155 setOperationAction(ISD::CTTZ, MVT::v32i8, Custom);
1156 setOperationAction(ISD::CTTZ, MVT::v16i16, Custom);
1157 setOperationAction(ISD::CTTZ, MVT::v8i32, Custom);
1158 setOperationAction(ISD::CTTZ, MVT::v4i64, Custom);
1159 setOperationAction(ISD::CTTZ_ZERO_UNDEF, MVT::v32i8, Custom);
1160 setOperationAction(ISD::CTTZ_ZERO_UNDEF, MVT::v16i16, Custom);
1161 setOperationAction(ISD::CTTZ_ZERO_UNDEF, MVT::v8i32, Custom);
1162 setOperationAction(ISD::CTTZ_ZERO_UNDEF, MVT::v4i64, Custom);
1164 if (Subtarget->hasAnyFMA()) {
1165 setOperationAction(ISD::FMA, MVT::v8f32, Legal);
1166 setOperationAction(ISD::FMA, MVT::v4f64, Legal);
1167 setOperationAction(ISD::FMA, MVT::v4f32, Legal);
1168 setOperationAction(ISD::FMA, MVT::v2f64, Legal);
1169 setOperationAction(ISD::FMA, MVT::f32, Legal);
1170 setOperationAction(ISD::FMA, MVT::f64, Legal);
1173 if (Subtarget->hasInt256()) {
1174 setOperationAction(ISD::ADD, MVT::v4i64, Legal);
1175 setOperationAction(ISD::ADD, MVT::v8i32, Legal);
1176 setOperationAction(ISD::ADD, MVT::v16i16, Legal);
1177 setOperationAction(ISD::ADD, MVT::v32i8, Legal);
1179 setOperationAction(ISD::SUB, MVT::v4i64, Legal);
1180 setOperationAction(ISD::SUB, MVT::v8i32, Legal);
1181 setOperationAction(ISD::SUB, MVT::v16i16, Legal);
1182 setOperationAction(ISD::SUB, MVT::v32i8, Legal);
1184 setOperationAction(ISD::MUL, MVT::v4i64, Custom);
1185 setOperationAction(ISD::MUL, MVT::v8i32, Legal);
1186 setOperationAction(ISD::MUL, MVT::v16i16, Legal);
1187 setOperationAction(ISD::MUL, MVT::v32i8, Custom);
1189 setOperationAction(ISD::UMUL_LOHI, MVT::v8i32, Custom);
1190 setOperationAction(ISD::SMUL_LOHI, MVT::v8i32, Custom);
1191 setOperationAction(ISD::MULHU, MVT::v16i16, Legal);
1192 setOperationAction(ISD::MULHS, MVT::v16i16, Legal);
1194 setOperationAction(ISD::SMAX, MVT::v32i8, Legal);
1195 setOperationAction(ISD::SMAX, MVT::v16i16, Legal);
1196 setOperationAction(ISD::SMAX, MVT::v8i32, Legal);
1197 setOperationAction(ISD::UMAX, MVT::v32i8, Legal);
1198 setOperationAction(ISD::UMAX, MVT::v16i16, Legal);
1199 setOperationAction(ISD::UMAX, MVT::v8i32, Legal);
1200 setOperationAction(ISD::SMIN, MVT::v32i8, Legal);
1201 setOperationAction(ISD::SMIN, MVT::v16i16, Legal);
1202 setOperationAction(ISD::SMIN, MVT::v8i32, Legal);
1203 setOperationAction(ISD::UMIN, MVT::v32i8, Legal);
1204 setOperationAction(ISD::UMIN, MVT::v16i16, Legal);
1205 setOperationAction(ISD::UMIN, MVT::v8i32, Legal);
1207 // The custom lowering for UINT_TO_FP for v8i32 becomes interesting
1208 // when we have a 256bit-wide blend with immediate.
1209 setOperationAction(ISD::UINT_TO_FP, MVT::v8i32, Custom);
1211 // AVX2 also has wider vector sign/zero extending loads, VPMOV[SZ]X
1212 setLoadExtAction(ISD::SEXTLOAD, MVT::v16i16, MVT::v16i8, Legal);
1213 setLoadExtAction(ISD::SEXTLOAD, MVT::v8i32, MVT::v8i8, Legal);
1214 setLoadExtAction(ISD::SEXTLOAD, MVT::v4i64, MVT::v4i8, Legal);
1215 setLoadExtAction(ISD::SEXTLOAD, MVT::v8i32, MVT::v8i16, Legal);
1216 setLoadExtAction(ISD::SEXTLOAD, MVT::v4i64, MVT::v4i16, Legal);
1217 setLoadExtAction(ISD::SEXTLOAD, MVT::v4i64, MVT::v4i32, Legal);
1219 setLoadExtAction(ISD::ZEXTLOAD, MVT::v16i16, MVT::v16i8, Legal);
1220 setLoadExtAction(ISD::ZEXTLOAD, MVT::v8i32, MVT::v8i8, Legal);
1221 setLoadExtAction(ISD::ZEXTLOAD, MVT::v4i64, MVT::v4i8, Legal);
1222 setLoadExtAction(ISD::ZEXTLOAD, MVT::v8i32, MVT::v8i16, Legal);
1223 setLoadExtAction(ISD::ZEXTLOAD, MVT::v4i64, MVT::v4i16, Legal);
1224 setLoadExtAction(ISD::ZEXTLOAD, MVT::v4i64, MVT::v4i32, Legal);
1226 setOperationAction(ISD::ADD, MVT::v4i64, Custom);
1227 setOperationAction(ISD::ADD, MVT::v8i32, Custom);
1228 setOperationAction(ISD::ADD, MVT::v16i16, Custom);
1229 setOperationAction(ISD::ADD, MVT::v32i8, Custom);
1231 setOperationAction(ISD::SUB, MVT::v4i64, Custom);
1232 setOperationAction(ISD::SUB, MVT::v8i32, Custom);
1233 setOperationAction(ISD::SUB, MVT::v16i16, Custom);
1234 setOperationAction(ISD::SUB, MVT::v32i8, Custom);
1236 setOperationAction(ISD::MUL, MVT::v4i64, Custom);
1237 setOperationAction(ISD::MUL, MVT::v8i32, Custom);
1238 setOperationAction(ISD::MUL, MVT::v16i16, Custom);
1239 setOperationAction(ISD::MUL, MVT::v32i8, Custom);
1241 setOperationAction(ISD::SMAX, MVT::v32i8, Custom);
1242 setOperationAction(ISD::SMAX, MVT::v16i16, Custom);
1243 setOperationAction(ISD::SMAX, MVT::v8i32, Custom);
1244 setOperationAction(ISD::UMAX, MVT::v32i8, Custom);
1245 setOperationAction(ISD::UMAX, MVT::v16i16, Custom);
1246 setOperationAction(ISD::UMAX, MVT::v8i32, Custom);
1247 setOperationAction(ISD::SMIN, MVT::v32i8, Custom);
1248 setOperationAction(ISD::SMIN, MVT::v16i16, Custom);
1249 setOperationAction(ISD::SMIN, MVT::v8i32, Custom);
1250 setOperationAction(ISD::UMIN, MVT::v32i8, Custom);
1251 setOperationAction(ISD::UMIN, MVT::v16i16, Custom);
1252 setOperationAction(ISD::UMIN, MVT::v8i32, Custom);
1255 // In the customized shift lowering, the legal cases in AVX2 will be
1257 setOperationAction(ISD::SRL, MVT::v4i64, Custom);
1258 setOperationAction(ISD::SRL, MVT::v8i32, Custom);
1260 setOperationAction(ISD::SHL, MVT::v4i64, Custom);
1261 setOperationAction(ISD::SHL, MVT::v8i32, Custom);
1263 setOperationAction(ISD::SRA, MVT::v4i64, Custom);
1264 setOperationAction(ISD::SRA, MVT::v8i32, Custom);
1266 // Custom lower several nodes for 256-bit types.
1267 for (MVT VT : MVT::vector_valuetypes()) {
1268 if (VT.getScalarSizeInBits() >= 32) {
1269 setOperationAction(ISD::MLOAD, VT, Legal);
1270 setOperationAction(ISD::MSTORE, VT, Legal);
1272 // Extract subvector is special because the value type
1273 // (result) is 128-bit but the source is 256-bit wide.
1274 if (VT.is128BitVector()) {
1275 setOperationAction(ISD::EXTRACT_SUBVECTOR, VT, Custom);
1277 // Do not attempt to custom lower other non-256-bit vectors
1278 if (!VT.is256BitVector())
1281 setOperationAction(ISD::BUILD_VECTOR, VT, Custom);
1282 setOperationAction(ISD::VECTOR_SHUFFLE, VT, Custom);
1283 setOperationAction(ISD::VSELECT, VT, Custom);
1284 setOperationAction(ISD::INSERT_VECTOR_ELT, VT, Custom);
1285 setOperationAction(ISD::EXTRACT_VECTOR_ELT, VT, Custom);
1286 setOperationAction(ISD::SCALAR_TO_VECTOR, VT, Custom);
1287 setOperationAction(ISD::INSERT_SUBVECTOR, VT, Custom);
1288 setOperationAction(ISD::CONCAT_VECTORS, VT, Custom);
1291 if (Subtarget->hasInt256())
1292 setOperationAction(ISD::VSELECT, MVT::v32i8, Legal);
1294 // Promote v32i8, v16i16, v8i32 select, and, or, xor to v4i64.
1295 for (auto VT : { MVT::v32i8, MVT::v16i16, MVT::v8i32 }) {
1296 setOperationAction(ISD::AND, VT, Promote);
1297 AddPromotedToType (ISD::AND, VT, MVT::v4i64);
1298 setOperationAction(ISD::OR, VT, Promote);
1299 AddPromotedToType (ISD::OR, VT, MVT::v4i64);
1300 setOperationAction(ISD::XOR, VT, Promote);
1301 AddPromotedToType (ISD::XOR, VT, MVT::v4i64);
1302 setOperationAction(ISD::LOAD, VT, Promote);
1303 AddPromotedToType (ISD::LOAD, VT, MVT::v4i64);
1304 setOperationAction(ISD::SELECT, VT, Promote);
1305 AddPromotedToType (ISD::SELECT, VT, MVT::v4i64);
1309 if (!Subtarget->useSoftFloat() && Subtarget->hasAVX512()) {
1310 addRegisterClass(MVT::v16i32, &X86::VR512RegClass);
1311 addRegisterClass(MVT::v16f32, &X86::VR512RegClass);
1312 addRegisterClass(MVT::v8i64, &X86::VR512RegClass);
1313 addRegisterClass(MVT::v8f64, &X86::VR512RegClass);
1315 addRegisterClass(MVT::i1, &X86::VK1RegClass);
1316 addRegisterClass(MVT::v8i1, &X86::VK8RegClass);
1317 addRegisterClass(MVT::v16i1, &X86::VK16RegClass);
1319 for (MVT VT : MVT::fp_vector_valuetypes())
1320 setLoadExtAction(ISD::EXTLOAD, VT, MVT::v8f32, Legal);
1322 setLoadExtAction(ISD::ZEXTLOAD, MVT::v16i32, MVT::v16i8, Legal);
1323 setLoadExtAction(ISD::SEXTLOAD, MVT::v16i32, MVT::v16i8, Legal);
1324 setLoadExtAction(ISD::ZEXTLOAD, MVT::v16i32, MVT::v16i16, Legal);
1325 setLoadExtAction(ISD::SEXTLOAD, MVT::v16i32, MVT::v16i16, Legal);
1326 setLoadExtAction(ISD::ZEXTLOAD, MVT::v32i16, MVT::v32i8, Legal);
1327 setLoadExtAction(ISD::SEXTLOAD, MVT::v32i16, MVT::v32i8, Legal);
1328 setLoadExtAction(ISD::ZEXTLOAD, MVT::v8i64, MVT::v8i8, Legal);
1329 setLoadExtAction(ISD::SEXTLOAD, MVT::v8i64, MVT::v8i8, Legal);
1330 setLoadExtAction(ISD::ZEXTLOAD, MVT::v8i64, MVT::v8i16, Legal);
1331 setLoadExtAction(ISD::SEXTLOAD, MVT::v8i64, MVT::v8i16, Legal);
1332 setLoadExtAction(ISD::ZEXTLOAD, MVT::v8i64, MVT::v8i32, Legal);
1333 setLoadExtAction(ISD::SEXTLOAD, MVT::v8i64, MVT::v8i32, Legal);
1335 setOperationAction(ISD::BR_CC, MVT::i1, Expand);
1336 setOperationAction(ISD::SETCC, MVT::i1, Custom);
1337 setOperationAction(ISD::SELECT_CC, MVT::i1, Expand);
1338 setOperationAction(ISD::XOR, MVT::i1, Legal);
1339 setOperationAction(ISD::OR, MVT::i1, Legal);
1340 setOperationAction(ISD::AND, MVT::i1, Legal);
1341 setOperationAction(ISD::SUB, MVT::i1, Custom);
1342 setOperationAction(ISD::ADD, MVT::i1, Custom);
1343 setOperationAction(ISD::MUL, MVT::i1, Custom);
1344 setOperationAction(ISD::LOAD, MVT::v16f32, Legal);
1345 setOperationAction(ISD::LOAD, MVT::v8f64, Legal);
1346 setOperationAction(ISD::LOAD, MVT::v8i64, Legal);
1347 setOperationAction(ISD::LOAD, MVT::v16i32, Legal);
1348 setOperationAction(ISD::LOAD, MVT::v16i1, Legal);
1350 setOperationAction(ISD::FADD, MVT::v16f32, Legal);
1351 setOperationAction(ISD::FSUB, MVT::v16f32, Legal);
1352 setOperationAction(ISD::FMUL, MVT::v16f32, Legal);
1353 setOperationAction(ISD::FDIV, MVT::v16f32, Legal);
1354 setOperationAction(ISD::FSQRT, MVT::v16f32, Legal);
1355 setOperationAction(ISD::FNEG, MVT::v16f32, Custom);
1356 setOperationAction(ISD::FABS, MVT::v16f32, Custom);
1358 setOperationAction(ISD::FADD, MVT::v8f64, Legal);
1359 setOperationAction(ISD::FSUB, MVT::v8f64, Legal);
1360 setOperationAction(ISD::FMUL, MVT::v8f64, Legal);
1361 setOperationAction(ISD::FDIV, MVT::v8f64, Legal);
1362 setOperationAction(ISD::FSQRT, MVT::v8f64, Legal);
1363 setOperationAction(ISD::FNEG, MVT::v8f64, Custom);
1364 setOperationAction(ISD::FABS, MVT::v8f64, Custom);
1365 setOperationAction(ISD::FMA, MVT::v8f64, Legal);
1366 setOperationAction(ISD::FMA, MVT::v16f32, Legal);
1368 setOperationAction(ISD::FP_TO_SINT, MVT::v16i32, Legal);
1369 setOperationAction(ISD::FP_TO_UINT, MVT::v16i32, Legal);
1370 setOperationAction(ISD::FP_TO_UINT, MVT::v8i32, Legal);
1371 setOperationAction(ISD::FP_TO_UINT, MVT::v4i32, Legal);
1372 setOperationAction(ISD::SINT_TO_FP, MVT::v16i32, Legal);
1373 setOperationAction(ISD::SINT_TO_FP, MVT::v8i1, Custom);
1374 setOperationAction(ISD::SINT_TO_FP, MVT::v16i1, Custom);
1375 setOperationAction(ISD::SINT_TO_FP, MVT::v16i8, Promote);
1376 setOperationAction(ISD::SINT_TO_FP, MVT::v16i16, Promote);
1377 setOperationAction(ISD::UINT_TO_FP, MVT::v16i32, Legal);
1378 setOperationAction(ISD::UINT_TO_FP, MVT::v8i32, Legal);
1379 setOperationAction(ISD::UINT_TO_FP, MVT::v4i32, Legal);
1380 setOperationAction(ISD::UINT_TO_FP, MVT::v16i8, Custom);
1381 setOperationAction(ISD::UINT_TO_FP, MVT::v16i16, Custom);
1382 setOperationAction(ISD::FP_ROUND, MVT::v8f32, Legal);
1383 setOperationAction(ISD::FP_EXTEND, MVT::v8f32, Legal);
1385 setTruncStoreAction(MVT::v8i64, MVT::v8i8, Legal);
1386 setTruncStoreAction(MVT::v8i64, MVT::v8i16, Legal);
1387 setTruncStoreAction(MVT::v8i64, MVT::v8i32, Legal);
1388 setTruncStoreAction(MVT::v16i32, MVT::v16i8, Legal);
1389 setTruncStoreAction(MVT::v16i32, MVT::v16i16, Legal);
1390 if (Subtarget->hasVLX()){
1391 setTruncStoreAction(MVT::v4i64, MVT::v4i8, Legal);
1392 setTruncStoreAction(MVT::v4i64, MVT::v4i16, Legal);
1393 setTruncStoreAction(MVT::v4i64, MVT::v4i32, Legal);
1394 setTruncStoreAction(MVT::v8i32, MVT::v8i8, Legal);
1395 setTruncStoreAction(MVT::v8i32, MVT::v8i16, Legal);
1397 setTruncStoreAction(MVT::v2i64, MVT::v2i8, Legal);
1398 setTruncStoreAction(MVT::v2i64, MVT::v2i16, Legal);
1399 setTruncStoreAction(MVT::v2i64, MVT::v2i32, Legal);
1400 setTruncStoreAction(MVT::v4i32, MVT::v4i8, Legal);
1401 setTruncStoreAction(MVT::v4i32, MVT::v4i16, Legal);
1403 setOperationAction(ISD::MLOAD, MVT::v8i32, Custom);
1404 setOperationAction(ISD::MLOAD, MVT::v8f32, Custom);
1405 setOperationAction(ISD::MSTORE, MVT::v8i32, Custom);
1406 setOperationAction(ISD::MSTORE, MVT::v8f32, Custom);
1408 setOperationAction(ISD::TRUNCATE, MVT::i1, Custom);
1409 setOperationAction(ISD::TRUNCATE, MVT::v16i8, Custom);
1410 setOperationAction(ISD::TRUNCATE, MVT::v8i32, Custom);
1411 setOperationAction(ISD::VECTOR_SHUFFLE, MVT::v8i1, Custom);
1412 setOperationAction(ISD::VECTOR_SHUFFLE, MVT::v16i1, Custom);
1413 if (Subtarget->hasDQI()) {
1414 setOperationAction(ISD::TRUNCATE, MVT::v2i1, Custom);
1415 setOperationAction(ISD::TRUNCATE, MVT::v4i1, Custom);
1417 setOperationAction(ISD::SINT_TO_FP, MVT::v8i64, Legal);
1418 setOperationAction(ISD::UINT_TO_FP, MVT::v8i64, Legal);
1419 setOperationAction(ISD::FP_TO_SINT, MVT::v8i64, Legal);
1420 setOperationAction(ISD::FP_TO_UINT, MVT::v8i64, Legal);
1421 if (Subtarget->hasVLX()) {
1422 setOperationAction(ISD::SINT_TO_FP, MVT::v4i64, Legal);
1423 setOperationAction(ISD::SINT_TO_FP, MVT::v2i64, Legal);
1424 setOperationAction(ISD::UINT_TO_FP, MVT::v4i64, Legal);
1425 setOperationAction(ISD::UINT_TO_FP, MVT::v2i64, Legal);
1426 setOperationAction(ISD::FP_TO_SINT, MVT::v4i64, Legal);
1427 setOperationAction(ISD::FP_TO_SINT, MVT::v2i64, Legal);
1428 setOperationAction(ISD::FP_TO_UINT, MVT::v4i64, Legal);
1429 setOperationAction(ISD::FP_TO_UINT, MVT::v2i64, Legal);
1432 if (Subtarget->hasVLX()) {
1433 setOperationAction(ISD::SINT_TO_FP, MVT::v8i32, Legal);
1434 setOperationAction(ISD::UINT_TO_FP, MVT::v8i32, Legal);
1435 setOperationAction(ISD::FP_TO_SINT, MVT::v8i32, Legal);
1436 setOperationAction(ISD::FP_TO_UINT, MVT::v8i32, Legal);
1437 setOperationAction(ISD::SINT_TO_FP, MVT::v4i32, Legal);
1438 setOperationAction(ISD::UINT_TO_FP, MVT::v4i32, Legal);
1439 setOperationAction(ISD::FP_TO_SINT, MVT::v4i32, Legal);
1440 setOperationAction(ISD::FP_TO_UINT, MVT::v4i32, Legal);
1442 setOperationAction(ISD::TRUNCATE, MVT::v8i1, Custom);
1443 setOperationAction(ISD::TRUNCATE, MVT::v16i1, Custom);
1444 setOperationAction(ISD::TRUNCATE, MVT::v16i16, Custom);
1445 setOperationAction(ISD::ZERO_EXTEND, MVT::v16i32, Custom);
1446 setOperationAction(ISD::ZERO_EXTEND, MVT::v8i64, Custom);
1447 setOperationAction(ISD::ANY_EXTEND, MVT::v16i32, Custom);
1448 setOperationAction(ISD::ANY_EXTEND, MVT::v8i64, Custom);
1449 setOperationAction(ISD::SIGN_EXTEND, MVT::v16i32, Custom);
1450 setOperationAction(ISD::SIGN_EXTEND, MVT::v8i64, Custom);
1451 setOperationAction(ISD::SIGN_EXTEND, MVT::v16i8, Custom);
1452 setOperationAction(ISD::SIGN_EXTEND, MVT::v8i16, Custom);
1453 setOperationAction(ISD::SIGN_EXTEND, MVT::v16i16, Custom);
1454 if (Subtarget->hasDQI()) {
1455 setOperationAction(ISD::SIGN_EXTEND, MVT::v4i32, Custom);
1456 setOperationAction(ISD::SIGN_EXTEND, MVT::v2i64, Custom);
1458 setOperationAction(ISD::FFLOOR, MVT::v16f32, Legal);
1459 setOperationAction(ISD::FFLOOR, MVT::v8f64, Legal);
1460 setOperationAction(ISD::FCEIL, MVT::v16f32, Legal);
1461 setOperationAction(ISD::FCEIL, MVT::v8f64, Legal);
1462 setOperationAction(ISD::FTRUNC, MVT::v16f32, Legal);
1463 setOperationAction(ISD::FTRUNC, MVT::v8f64, Legal);
1464 setOperationAction(ISD::FRINT, MVT::v16f32, Legal);
1465 setOperationAction(ISD::FRINT, MVT::v8f64, Legal);
1466 setOperationAction(ISD::FNEARBYINT, MVT::v16f32, Legal);
1467 setOperationAction(ISD::FNEARBYINT, MVT::v8f64, Legal);
1469 setOperationAction(ISD::CONCAT_VECTORS, MVT::v8f64, Custom);
1470 setOperationAction(ISD::CONCAT_VECTORS, MVT::v8i64, Custom);
1471 setOperationAction(ISD::CONCAT_VECTORS, MVT::v16f32, Custom);
1472 setOperationAction(ISD::CONCAT_VECTORS, MVT::v16i32, Custom);
1473 setOperationAction(ISD::CONCAT_VECTORS, MVT::v16i1, Custom);
1475 setOperationAction(ISD::SETCC, MVT::v16i1, Custom);
1476 setOperationAction(ISD::SETCC, MVT::v8i1, Custom);
1478 setOperationAction(ISD::MUL, MVT::v8i64, Custom);
1480 setOperationAction(ISD::EXTRACT_VECTOR_ELT, MVT::v8i1, Custom);
1481 setOperationAction(ISD::EXTRACT_VECTOR_ELT, MVT::v16i1, Custom);
1482 setOperationAction(ISD::INSERT_SUBVECTOR, MVT::v16i1, Custom);
1483 setOperationAction(ISD::INSERT_VECTOR_ELT, MVT::v16i1, Custom);
1484 setOperationAction(ISD::INSERT_VECTOR_ELT, MVT::v8i1, Custom);
1485 setOperationAction(ISD::BUILD_VECTOR, MVT::v8i1, Custom);
1486 setOperationAction(ISD::BUILD_VECTOR, MVT::v16i1, Custom);
1487 setOperationAction(ISD::SELECT, MVT::v8f64, Custom);
1488 setOperationAction(ISD::SELECT, MVT::v8i64, Custom);
1489 setOperationAction(ISD::SELECT, MVT::v16f32, Custom);
1490 setOperationAction(ISD::SELECT, MVT::v16i1, Custom);
1491 setOperationAction(ISD::SELECT, MVT::v8i1, Custom);
1493 setOperationAction(ISD::SMAX, MVT::v16i32, Legal);
1494 setOperationAction(ISD::SMAX, MVT::v8i64, Legal);
1495 setOperationAction(ISD::UMAX, MVT::v16i32, Legal);
1496 setOperationAction(ISD::UMAX, MVT::v8i64, Legal);
1497 setOperationAction(ISD::SMIN, MVT::v16i32, Legal);
1498 setOperationAction(ISD::SMIN, MVT::v8i64, Legal);
1499 setOperationAction(ISD::UMIN, MVT::v16i32, Legal);
1500 setOperationAction(ISD::UMIN, MVT::v8i64, Legal);
1502 setOperationAction(ISD::ADD, MVT::v8i64, Legal);
1503 setOperationAction(ISD::ADD, MVT::v16i32, Legal);
1505 setOperationAction(ISD::SUB, MVT::v8i64, Legal);
1506 setOperationAction(ISD::SUB, MVT::v16i32, Legal);
1508 setOperationAction(ISD::MUL, MVT::v16i32, Legal);
1510 setOperationAction(ISD::SRL, MVT::v8i64, Custom);
1511 setOperationAction(ISD::SRL, MVT::v16i32, Custom);
1513 setOperationAction(ISD::SHL, MVT::v8i64, Custom);
1514 setOperationAction(ISD::SHL, MVT::v16i32, Custom);
1516 setOperationAction(ISD::SRA, MVT::v8i64, Custom);
1517 setOperationAction(ISD::SRA, MVT::v16i32, Custom);
1519 setOperationAction(ISD::AND, MVT::v8i64, Legal);
1520 setOperationAction(ISD::OR, MVT::v8i64, Legal);
1521 setOperationAction(ISD::XOR, MVT::v8i64, Legal);
1522 setOperationAction(ISD::AND, MVT::v16i32, Legal);
1523 setOperationAction(ISD::OR, MVT::v16i32, Legal);
1524 setOperationAction(ISD::XOR, MVT::v16i32, Legal);
1526 if (Subtarget->hasCDI()) {
1527 setOperationAction(ISD::CTLZ, MVT::v8i64, Legal);
1528 setOperationAction(ISD::CTLZ, MVT::v16i32, Legal);
1529 setOperationAction(ISD::CTLZ_ZERO_UNDEF, MVT::v8i64, Expand);
1530 setOperationAction(ISD::CTLZ_ZERO_UNDEF, MVT::v16i32, Expand);
1532 setOperationAction(ISD::CTLZ, MVT::v8i16, Custom);
1533 setOperationAction(ISD::CTLZ, MVT::v16i8, Custom);
1534 setOperationAction(ISD::CTLZ, MVT::v16i16, Custom);
1535 setOperationAction(ISD::CTLZ, MVT::v32i8, Custom);
1536 setOperationAction(ISD::CTLZ_ZERO_UNDEF, MVT::v8i16, Expand);
1537 setOperationAction(ISD::CTLZ_ZERO_UNDEF, MVT::v16i8, Expand);
1538 setOperationAction(ISD::CTLZ_ZERO_UNDEF, MVT::v16i16, Expand);
1539 setOperationAction(ISD::CTLZ_ZERO_UNDEF, MVT::v32i8, Expand);
1541 setOperationAction(ISD::CTTZ_ZERO_UNDEF, MVT::v8i64, Custom);
1542 setOperationAction(ISD::CTTZ_ZERO_UNDEF, MVT::v16i32, Custom);
1544 if (Subtarget->hasVLX()) {
1545 setOperationAction(ISD::CTLZ, MVT::v4i64, Legal);
1546 setOperationAction(ISD::CTLZ, MVT::v8i32, Legal);
1547 setOperationAction(ISD::CTLZ, MVT::v2i64, Legal);
1548 setOperationAction(ISD::CTLZ, MVT::v4i32, Legal);
1549 setOperationAction(ISD::CTLZ_ZERO_UNDEF, MVT::v4i64, Expand);
1550 setOperationAction(ISD::CTLZ_ZERO_UNDEF, MVT::v8i32, Expand);
1551 setOperationAction(ISD::CTLZ_ZERO_UNDEF, MVT::v2i64, Expand);
1552 setOperationAction(ISD::CTLZ_ZERO_UNDEF, MVT::v4i32, Expand);
1554 setOperationAction(ISD::CTTZ_ZERO_UNDEF, MVT::v4i64, Custom);
1555 setOperationAction(ISD::CTTZ_ZERO_UNDEF, MVT::v8i32, Custom);
1556 setOperationAction(ISD::CTTZ_ZERO_UNDEF, MVT::v2i64, Custom);
1557 setOperationAction(ISD::CTTZ_ZERO_UNDEF, MVT::v4i32, Custom);
1559 setOperationAction(ISD::CTLZ, MVT::v4i64, Custom);
1560 setOperationAction(ISD::CTLZ, MVT::v8i32, Custom);
1561 setOperationAction(ISD::CTLZ, MVT::v2i64, Custom);
1562 setOperationAction(ISD::CTLZ, MVT::v4i32, Custom);
1563 setOperationAction(ISD::CTLZ_ZERO_UNDEF, MVT::v4i64, Expand);
1564 setOperationAction(ISD::CTLZ_ZERO_UNDEF, MVT::v8i32, Expand);
1565 setOperationAction(ISD::CTLZ_ZERO_UNDEF, MVT::v2i64, Expand);
1566 setOperationAction(ISD::CTLZ_ZERO_UNDEF, MVT::v4i32, Expand);
1568 } // Subtarget->hasCDI()
1570 if (Subtarget->hasDQI()) {
1571 setOperationAction(ISD::MUL, MVT::v2i64, Legal);
1572 setOperationAction(ISD::MUL, MVT::v4i64, Legal);
1573 setOperationAction(ISD::MUL, MVT::v8i64, Legal);
1575 // Custom lower several nodes.
1576 for (MVT VT : MVT::vector_valuetypes()) {
1577 unsigned EltSize = VT.getVectorElementType().getSizeInBits();
1579 setOperationAction(ISD::AND, VT, Legal);
1580 setOperationAction(ISD::OR, VT, Legal);
1581 setOperationAction(ISD::XOR, VT, Legal);
1583 if ((VT.is128BitVector() || VT.is256BitVector()) && EltSize >= 32) {
1584 setOperationAction(ISD::MGATHER, VT, Custom);
1585 setOperationAction(ISD::MSCATTER, VT, Custom);
1587 // Extract subvector is special because the value type
1588 // (result) is 256/128-bit but the source is 512-bit wide.
1589 if (VT.is128BitVector() || VT.is256BitVector()) {
1590 setOperationAction(ISD::EXTRACT_SUBVECTOR, VT, Custom);
1592 if (VT.getVectorElementType() == MVT::i1)
1593 setOperationAction(ISD::EXTRACT_SUBVECTOR, VT, Legal);
1595 // Do not attempt to custom lower other non-512-bit vectors
1596 if (!VT.is512BitVector())
1599 if (EltSize >= 32) {
1600 setOperationAction(ISD::VECTOR_SHUFFLE, VT, Custom);
1601 setOperationAction(ISD::INSERT_VECTOR_ELT, VT, Custom);
1602 setOperationAction(ISD::BUILD_VECTOR, VT, Custom);
1603 setOperationAction(ISD::VSELECT, VT, Legal);
1604 setOperationAction(ISD::EXTRACT_VECTOR_ELT, VT, Custom);
1605 setOperationAction(ISD::SCALAR_TO_VECTOR, VT, Custom);
1606 setOperationAction(ISD::INSERT_SUBVECTOR, VT, Custom);
1607 setOperationAction(ISD::MLOAD, VT, Legal);
1608 setOperationAction(ISD::MSTORE, VT, Legal);
1609 setOperationAction(ISD::MGATHER, VT, Legal);
1610 setOperationAction(ISD::MSCATTER, VT, Custom);
1613 for (auto VT : { MVT::v64i8, MVT::v32i16, MVT::v16i32 }) {
1614 setOperationAction(ISD::SELECT, VT, Promote);
1615 AddPromotedToType (ISD::SELECT, VT, MVT::v8i64);
1619 if (!Subtarget->useSoftFloat() && Subtarget->hasBWI()) {
1620 addRegisterClass(MVT::v32i16, &X86::VR512RegClass);
1621 addRegisterClass(MVT::v64i8, &X86::VR512RegClass);
1623 addRegisterClass(MVT::v32i1, &X86::VK32RegClass);
1624 addRegisterClass(MVT::v64i1, &X86::VK64RegClass);
1626 setOperationAction(ISD::LOAD, MVT::v32i16, Legal);
1627 setOperationAction(ISD::LOAD, MVT::v64i8, Legal);
1628 setOperationAction(ISD::SETCC, MVT::v32i1, Custom);
1629 setOperationAction(ISD::SETCC, MVT::v64i1, Custom);
1630 setOperationAction(ISD::ADD, MVT::v32i16, Legal);
1631 setOperationAction(ISD::ADD, MVT::v64i8, Legal);
1632 setOperationAction(ISD::SUB, MVT::v32i16, Legal);
1633 setOperationAction(ISD::SUB, MVT::v64i8, Legal);
1634 setOperationAction(ISD::MUL, MVT::v32i16, Legal);
1635 setOperationAction(ISD::MULHS, MVT::v32i16, Legal);
1636 setOperationAction(ISD::MULHU, MVT::v32i16, Legal);
1637 setOperationAction(ISD::CONCAT_VECTORS, MVT::v32i1, Custom);
1638 setOperationAction(ISD::CONCAT_VECTORS, MVT::v64i1, Custom);
1639 setOperationAction(ISD::CONCAT_VECTORS, MVT::v32i16, Custom);
1640 setOperationAction(ISD::CONCAT_VECTORS, MVT::v64i8, Custom);
1641 setOperationAction(ISD::INSERT_SUBVECTOR, MVT::v32i1, Custom);
1642 setOperationAction(ISD::INSERT_SUBVECTOR, MVT::v64i1, Custom);
1643 setOperationAction(ISD::INSERT_SUBVECTOR, MVT::v32i16, Custom);
1644 setOperationAction(ISD::INSERT_SUBVECTOR, MVT::v64i8, Custom);
1645 setOperationAction(ISD::EXTRACT_VECTOR_ELT, MVT::v32i16, Custom);
1646 setOperationAction(ISD::EXTRACT_VECTOR_ELT, MVT::v64i8, Custom);
1647 setOperationAction(ISD::SELECT, MVT::v32i1, Custom);
1648 setOperationAction(ISD::SELECT, MVT::v64i1, Custom);
1649 setOperationAction(ISD::SIGN_EXTEND, MVT::v32i8, Custom);
1650 setOperationAction(ISD::ZERO_EXTEND, MVT::v32i8, Custom);
1651 setOperationAction(ISD::SIGN_EXTEND, MVT::v32i16, Custom);
1652 setOperationAction(ISD::ZERO_EXTEND, MVT::v32i16, Custom);
1653 setOperationAction(ISD::VECTOR_SHUFFLE, MVT::v32i16, Custom);
1654 setOperationAction(ISD::VECTOR_SHUFFLE, MVT::v64i8, Custom);
1655 setOperationAction(ISD::SIGN_EXTEND, MVT::v64i8, Custom);
1656 setOperationAction(ISD::ZERO_EXTEND, MVT::v64i8, Custom);
1657 setOperationAction(ISD::INSERT_VECTOR_ELT, MVT::v32i1, Custom);
1658 setOperationAction(ISD::INSERT_VECTOR_ELT, MVT::v64i1, Custom);
1659 setOperationAction(ISD::INSERT_VECTOR_ELT, MVT::v32i16, Custom);
1660 setOperationAction(ISD::INSERT_VECTOR_ELT, MVT::v64i8, Custom);
1661 setOperationAction(ISD::VSELECT, MVT::v32i16, Legal);
1662 setOperationAction(ISD::VSELECT, MVT::v64i8, Legal);
1663 setOperationAction(ISD::TRUNCATE, MVT::v32i1, Custom);
1664 setOperationAction(ISD::TRUNCATE, MVT::v64i1, Custom);
1665 setOperationAction(ISD::TRUNCATE, MVT::v32i8, Custom);
1666 setOperationAction(ISD::VECTOR_SHUFFLE, MVT::v32i1, Custom);
1667 setOperationAction(ISD::VECTOR_SHUFFLE, MVT::v64i1, Custom);
1669 setOperationAction(ISD::SMAX, MVT::v64i8, Legal);
1670 setOperationAction(ISD::SMAX, MVT::v32i16, Legal);
1671 setOperationAction(ISD::UMAX, MVT::v64i8, Legal);
1672 setOperationAction(ISD::UMAX, MVT::v32i16, Legal);
1673 setOperationAction(ISD::SMIN, MVT::v64i8, Legal);
1674 setOperationAction(ISD::SMIN, MVT::v32i16, Legal);
1675 setOperationAction(ISD::UMIN, MVT::v64i8, Legal);
1676 setOperationAction(ISD::UMIN, MVT::v32i16, Legal);
1678 setTruncStoreAction(MVT::v32i16, MVT::v32i8, Legal);
1679 setTruncStoreAction(MVT::v16i16, MVT::v16i8, Legal);
1680 if (Subtarget->hasVLX())
1681 setTruncStoreAction(MVT::v8i16, MVT::v8i8, Legal);
1683 if (Subtarget->hasCDI()) {
1684 setOperationAction(ISD::CTLZ, MVT::v32i16, Custom);
1685 setOperationAction(ISD::CTLZ, MVT::v64i8, Custom);
1686 setOperationAction(ISD::CTLZ_ZERO_UNDEF, MVT::v32i16, Expand);
1687 setOperationAction(ISD::CTLZ_ZERO_UNDEF, MVT::v64i8, Expand);
1690 for (auto VT : { MVT::v64i8, MVT::v32i16 }) {
1691 setOperationAction(ISD::BUILD_VECTOR, VT, Custom);
1692 setOperationAction(ISD::VSELECT, VT, Legal);
1693 setOperationAction(ISD::SRL, VT, Custom);
1694 setOperationAction(ISD::SHL, VT, Custom);
1695 setOperationAction(ISD::SRA, VT, Custom);
1697 setOperationAction(ISD::AND, VT, Promote);
1698 AddPromotedToType (ISD::AND, VT, MVT::v8i64);
1699 setOperationAction(ISD::OR, VT, Promote);
1700 AddPromotedToType (ISD::OR, VT, MVT::v8i64);
1701 setOperationAction(ISD::XOR, VT, Promote);
1702 AddPromotedToType (ISD::XOR, VT, MVT::v8i64);
1706 if (!Subtarget->useSoftFloat() && Subtarget->hasVLX()) {
1707 addRegisterClass(MVT::v4i1, &X86::VK4RegClass);
1708 addRegisterClass(MVT::v2i1, &X86::VK2RegClass);
1710 setOperationAction(ISD::SETCC, MVT::v4i1, Custom);
1711 setOperationAction(ISD::SETCC, MVT::v2i1, Custom);
1712 setOperationAction(ISD::CONCAT_VECTORS, MVT::v4i1, Custom);
1713 setOperationAction(ISD::CONCAT_VECTORS, MVT::v8i1, Custom);
1714 setOperationAction(ISD::INSERT_SUBVECTOR, MVT::v8i1, Custom);
1715 setOperationAction(ISD::INSERT_SUBVECTOR, MVT::v4i1, Custom);
1716 setOperationAction(ISD::SELECT, MVT::v4i1, Custom);
1717 setOperationAction(ISD::SELECT, MVT::v2i1, Custom);
1718 setOperationAction(ISD::BUILD_VECTOR, MVT::v4i1, Custom);
1719 setOperationAction(ISD::BUILD_VECTOR, MVT::v2i1, Custom);
1720 setOperationAction(ISD::VECTOR_SHUFFLE, MVT::v2i1, Custom);
1721 setOperationAction(ISD::VECTOR_SHUFFLE, MVT::v4i1, Custom);
1723 setOperationAction(ISD::AND, MVT::v8i32, Legal);
1724 setOperationAction(ISD::OR, MVT::v8i32, Legal);
1725 setOperationAction(ISD::XOR, MVT::v8i32, Legal);
1726 setOperationAction(ISD::AND, MVT::v4i32, Legal);
1727 setOperationAction(ISD::OR, MVT::v4i32, Legal);
1728 setOperationAction(ISD::XOR, MVT::v4i32, Legal);
1729 setOperationAction(ISD::SRA, MVT::v2i64, Custom);
1730 setOperationAction(ISD::SRA, MVT::v4i64, Custom);
1732 setOperationAction(ISD::SMAX, MVT::v2i64, Legal);
1733 setOperationAction(ISD::SMAX, MVT::v4i64, Legal);
1734 setOperationAction(ISD::UMAX, MVT::v2i64, Legal);
1735 setOperationAction(ISD::UMAX, MVT::v4i64, Legal);
1736 setOperationAction(ISD::SMIN, MVT::v2i64, Legal);
1737 setOperationAction(ISD::SMIN, MVT::v4i64, Legal);
1738 setOperationAction(ISD::UMIN, MVT::v2i64, Legal);
1739 setOperationAction(ISD::UMIN, MVT::v4i64, Legal);
1742 // We want to custom lower some of our intrinsics.
1743 setOperationAction(ISD::INTRINSIC_WO_CHAIN, MVT::Other, Custom);
1744 setOperationAction(ISD::INTRINSIC_W_CHAIN, MVT::Other, Custom);
1745 setOperationAction(ISD::INTRINSIC_VOID, MVT::Other, Custom);
1746 if (!Subtarget->is64Bit()) {
1747 setOperationAction(ISD::INTRINSIC_W_CHAIN, MVT::i64, Custom);
1748 setOperationAction(ISD::INTRINSIC_WO_CHAIN, MVT::i64, Custom);
1751 // Only custom-lower 64-bit SADDO and friends on 64-bit because we don't
1752 // handle type legalization for these operations here.
1754 // FIXME: We really should do custom legalization for addition and
1755 // subtraction on x86-32 once PR3203 is fixed. We really can't do much better
1756 // than generic legalization for 64-bit multiplication-with-overflow, though.
1757 for (auto VT : { MVT::i8, MVT::i16, MVT::i32, MVT::i64 }) {
1758 if (VT == MVT::i64 && !Subtarget->is64Bit())
1760 // Add/Sub/Mul with overflow operations are custom lowered.
1761 setOperationAction(ISD::SADDO, VT, Custom);
1762 setOperationAction(ISD::UADDO, VT, Custom);
1763 setOperationAction(ISD::SSUBO, VT, Custom);
1764 setOperationAction(ISD::USUBO, VT, Custom);
1765 setOperationAction(ISD::SMULO, VT, Custom);
1766 setOperationAction(ISD::UMULO, VT, Custom);
1769 if (!Subtarget->is64Bit()) {
1770 // These libcalls are not available in 32-bit.
1771 setLibcallName(RTLIB::SHL_I128, nullptr);
1772 setLibcallName(RTLIB::SRL_I128, nullptr);
1773 setLibcallName(RTLIB::SRA_I128, nullptr);
1776 // Combine sin / cos into one node or libcall if possible.
1777 if (Subtarget->hasSinCos()) {
1778 setLibcallName(RTLIB::SINCOS_F32, "sincosf");
1779 setLibcallName(RTLIB::SINCOS_F64, "sincos");
1780 if (Subtarget->isTargetDarwin()) {
1781 // For MacOSX, we don't want the normal expansion of a libcall to sincos.
1782 // We want to issue a libcall to __sincos_stret to avoid memory traffic.
1783 setOperationAction(ISD::FSINCOS, MVT::f64, Custom);
1784 setOperationAction(ISD::FSINCOS, MVT::f32, Custom);
1788 if (Subtarget->isTargetWin64()) {
1789 setOperationAction(ISD::SDIV, MVT::i128, Custom);
1790 setOperationAction(ISD::UDIV, MVT::i128, Custom);
1791 setOperationAction(ISD::SREM, MVT::i128, Custom);
1792 setOperationAction(ISD::UREM, MVT::i128, Custom);
1793 setOperationAction(ISD::SDIVREM, MVT::i128, Custom);
1794 setOperationAction(ISD::UDIVREM, MVT::i128, Custom);
1797 // We have target-specific dag combine patterns for the following nodes:
1798 setTargetDAGCombine(ISD::VECTOR_SHUFFLE);
1799 setTargetDAGCombine(ISD::EXTRACT_VECTOR_ELT);
1800 setTargetDAGCombine(ISD::BITCAST);
1801 setTargetDAGCombine(ISD::VSELECT);
1802 setTargetDAGCombine(ISD::SELECT);
1803 setTargetDAGCombine(ISD::SHL);
1804 setTargetDAGCombine(ISD::SRA);
1805 setTargetDAGCombine(ISD::SRL);
1806 setTargetDAGCombine(ISD::OR);
1807 setTargetDAGCombine(ISD::AND);
1808 setTargetDAGCombine(ISD::ADD);
1809 setTargetDAGCombine(ISD::FADD);
1810 setTargetDAGCombine(ISD::FSUB);
1811 setTargetDAGCombine(ISD::FNEG);
1812 setTargetDAGCombine(ISD::FMA);
1813 setTargetDAGCombine(ISD::FMINNUM);
1814 setTargetDAGCombine(ISD::FMAXNUM);
1815 setTargetDAGCombine(ISD::SUB);
1816 setTargetDAGCombine(ISD::LOAD);
1817 setTargetDAGCombine(ISD::MLOAD);
1818 setTargetDAGCombine(ISD::STORE);
1819 setTargetDAGCombine(ISD::MSTORE);
1820 setTargetDAGCombine(ISD::TRUNCATE);
1821 setTargetDAGCombine(ISD::ZERO_EXTEND);
1822 setTargetDAGCombine(ISD::ANY_EXTEND);
1823 setTargetDAGCombine(ISD::SIGN_EXTEND);
1824 setTargetDAGCombine(ISD::SIGN_EXTEND_INREG);
1825 setTargetDAGCombine(ISD::SINT_TO_FP);
1826 setTargetDAGCombine(ISD::UINT_TO_FP);
1827 setTargetDAGCombine(ISD::SETCC);
1828 setTargetDAGCombine(ISD::BUILD_VECTOR);
1829 setTargetDAGCombine(ISD::MUL);
1830 setTargetDAGCombine(ISD::XOR);
1831 setTargetDAGCombine(ISD::MSCATTER);
1832 setTargetDAGCombine(ISD::MGATHER);
1834 computeRegisterProperties(Subtarget->getRegisterInfo());
1836 MaxStoresPerMemset = 16; // For @llvm.memset -> sequence of stores
1837 MaxStoresPerMemsetOptSize = 8;
1838 MaxStoresPerMemcpy = 8; // For @llvm.memcpy -> sequence of stores
1839 MaxStoresPerMemcpyOptSize = 4;
1840 MaxStoresPerMemmove = 8; // For @llvm.memmove -> sequence of stores
1841 MaxStoresPerMemmoveOptSize = 4;
1842 setPrefLoopAlignment(4); // 2^4 bytes.
1844 // A predictable cmov does not hurt on an in-order CPU.
1845 // FIXME: Use a CPU attribute to trigger this, not a CPU model.
1846 PredictableSelectIsExpensive = !Subtarget->isAtom();
1847 EnableExtLdPromotion = true;
1848 setPrefFunctionAlignment(4); // 2^4 bytes.
1850 verifyIntrinsicTables();
1853 // This has so far only been implemented for 64-bit MachO.
1854 bool X86TargetLowering::useLoadStackGuardNode() const {
1855 return Subtarget->isTargetMachO() && Subtarget->is64Bit();
1858 TargetLoweringBase::LegalizeTypeAction
1859 X86TargetLowering::getPreferredVectorAction(EVT VT) const {
1860 if (ExperimentalVectorWideningLegalization &&
1861 VT.getVectorNumElements() != 1 &&
1862 VT.getVectorElementType().getSimpleVT() != MVT::i1)
1863 return TypeWidenVector;
1865 return TargetLoweringBase::getPreferredVectorAction(VT);
1868 EVT X86TargetLowering::getSetCCResultType(const DataLayout &DL, LLVMContext &,
1871 return Subtarget->hasAVX512() ? MVT::i1: MVT::i8;
1873 if (VT.isSimple()) {
1874 MVT VVT = VT.getSimpleVT();
1875 const unsigned NumElts = VVT.getVectorNumElements();
1876 const MVT EltVT = VVT.getVectorElementType();
1877 if (VVT.is512BitVector()) {
1878 if (Subtarget->hasAVX512())
1879 if (EltVT == MVT::i32 || EltVT == MVT::i64 ||
1880 EltVT == MVT::f32 || EltVT == MVT::f64)
1882 case 8: return MVT::v8i1;
1883 case 16: return MVT::v16i1;
1885 if (Subtarget->hasBWI())
1886 if (EltVT == MVT::i8 || EltVT == MVT::i16)
1888 case 32: return MVT::v32i1;
1889 case 64: return MVT::v64i1;
1893 if (VVT.is256BitVector() || VVT.is128BitVector()) {
1894 if (Subtarget->hasVLX())
1895 if (EltVT == MVT::i32 || EltVT == MVT::i64 ||
1896 EltVT == MVT::f32 || EltVT == MVT::f64)
1898 case 2: return MVT::v2i1;
1899 case 4: return MVT::v4i1;
1900 case 8: return MVT::v8i1;
1902 if (Subtarget->hasBWI() && Subtarget->hasVLX())
1903 if (EltVT == MVT::i8 || EltVT == MVT::i16)
1905 case 8: return MVT::v8i1;
1906 case 16: return MVT::v16i1;
1907 case 32: return MVT::v32i1;
1912 return VT.changeVectorElementTypeToInteger();
1915 /// Helper for getByValTypeAlignment to determine
1916 /// the desired ByVal argument alignment.
1917 static void getMaxByValAlign(Type *Ty, unsigned &MaxAlign) {
1920 if (VectorType *VTy = dyn_cast<VectorType>(Ty)) {
1921 if (VTy->getBitWidth() == 128)
1923 } else if (ArrayType *ATy = dyn_cast<ArrayType>(Ty)) {
1924 unsigned EltAlign = 0;
1925 getMaxByValAlign(ATy->getElementType(), EltAlign);
1926 if (EltAlign > MaxAlign)
1927 MaxAlign = EltAlign;
1928 } else if (StructType *STy = dyn_cast<StructType>(Ty)) {
1929 for (auto *EltTy : STy->elements()) {
1930 unsigned EltAlign = 0;
1931 getMaxByValAlign(EltTy, EltAlign);
1932 if (EltAlign > MaxAlign)
1933 MaxAlign = EltAlign;
1940 /// Return the desired alignment for ByVal aggregate
1941 /// function arguments in the caller parameter area. For X86, aggregates
1942 /// that contain SSE vectors are placed at 16-byte boundaries while the rest
1943 /// are at 4-byte boundaries.
1944 unsigned X86TargetLowering::getByValTypeAlignment(Type *Ty,
1945 const DataLayout &DL) const {
1946 if (Subtarget->is64Bit()) {
1947 // Max of 8 and alignment of type.
1948 unsigned TyAlign = DL.getABITypeAlignment(Ty);
1955 if (Subtarget->hasSSE1())
1956 getMaxByValAlign(Ty, Align);
1960 /// Returns the target specific optimal type for load
1961 /// and store operations as a result of memset, memcpy, and memmove
1962 /// lowering. If DstAlign is zero that means it's safe to destination
1963 /// alignment can satisfy any constraint. Similarly if SrcAlign is zero it
1964 /// means there isn't a need to check it against alignment requirement,
1965 /// probably because the source does not need to be loaded. If 'IsMemset' is
1966 /// true, that means it's expanding a memset. If 'ZeroMemset' is true, that
1967 /// means it's a memset of zero. 'MemcpyStrSrc' indicates whether the memcpy
1968 /// source is constant so it does not need to be loaded.
1969 /// It returns EVT::Other if the type should be determined using generic
1970 /// target-independent logic.
1972 X86TargetLowering::getOptimalMemOpType(uint64_t Size,
1973 unsigned DstAlign, unsigned SrcAlign,
1974 bool IsMemset, bool ZeroMemset,
1976 MachineFunction &MF) const {
1977 const Function *F = MF.getFunction();
1978 if ((!IsMemset || ZeroMemset) &&
1979 !F->hasFnAttribute(Attribute::NoImplicitFloat)) {
1981 (!Subtarget->isUnalignedMem16Slow() ||
1982 ((DstAlign == 0 || DstAlign >= 16) &&
1983 (SrcAlign == 0 || SrcAlign >= 16)))) {
1985 // FIXME: Check if unaligned 32-byte accesses are slow.
1986 if (Subtarget->hasInt256())
1988 if (Subtarget->hasFp256())
1991 if (Subtarget->hasSSE2())
1993 if (Subtarget->hasSSE1())
1995 } else if (!MemcpyStrSrc && Size >= 8 &&
1996 !Subtarget->is64Bit() &&
1997 Subtarget->hasSSE2()) {
1998 // Do not use f64 to lower memcpy if source is string constant. It's
1999 // better to use i32 to avoid the loads.
2003 // This is a compromise. If we reach here, unaligned accesses may be slow on
2004 // this target. However, creating smaller, aligned accesses could be even
2005 // slower and would certainly be a lot more code.
2006 if (Subtarget->is64Bit() && Size >= 8)
2011 bool X86TargetLowering::isSafeMemOpType(MVT VT) const {
2013 return X86ScalarSSEf32;
2014 else if (VT == MVT::f64)
2015 return X86ScalarSSEf64;
2020 X86TargetLowering::allowsMisalignedMemoryAccesses(EVT VT,
2025 switch (VT.getSizeInBits()) {
2027 // 8-byte and under are always assumed to be fast.
2031 *Fast = !Subtarget->isUnalignedMem16Slow();
2034 *Fast = !Subtarget->isUnalignedMem32Slow();
2036 // TODO: What about AVX-512 (512-bit) accesses?
2039 // Misaligned accesses of any size are always allowed.
2043 /// Return the entry encoding for a jump table in the
2044 /// current function. The returned value is a member of the
2045 /// MachineJumpTableInfo::JTEntryKind enum.
2046 unsigned X86TargetLowering::getJumpTableEncoding() const {
2047 // In GOT pic mode, each entry in the jump table is emitted as a @GOTOFF
2049 if (getTargetMachine().getRelocationModel() == Reloc::PIC_ &&
2050 Subtarget->isPICStyleGOT())
2051 return MachineJumpTableInfo::EK_Custom32;
2053 // Otherwise, use the normal jump table encoding heuristics.
2054 return TargetLowering::getJumpTableEncoding();
2057 bool X86TargetLowering::useSoftFloat() const {
2058 return Subtarget->useSoftFloat();
2062 X86TargetLowering::LowerCustomJumpTableEntry(const MachineJumpTableInfo *MJTI,
2063 const MachineBasicBlock *MBB,
2064 unsigned uid,MCContext &Ctx) const{
2065 assert(MBB->getParent()->getTarget().getRelocationModel() == Reloc::PIC_ &&
2066 Subtarget->isPICStyleGOT());
2067 // In 32-bit ELF systems, our jump table entries are formed with @GOTOFF
2069 return MCSymbolRefExpr::create(MBB->getSymbol(),
2070 MCSymbolRefExpr::VK_GOTOFF, Ctx);
2073 /// Returns relocation base for the given PIC jumptable.
2074 SDValue X86TargetLowering::getPICJumpTableRelocBase(SDValue Table,
2075 SelectionDAG &DAG) const {
2076 if (!Subtarget->is64Bit())
2077 // This doesn't have SDLoc associated with it, but is not really the
2078 // same as a Register.
2079 return DAG.getNode(X86ISD::GlobalBaseReg, SDLoc(),
2080 getPointerTy(DAG.getDataLayout()));
2084 /// This returns the relocation base for the given PIC jumptable,
2085 /// the same as getPICJumpTableRelocBase, but as an MCExpr.
2086 const MCExpr *X86TargetLowering::
2087 getPICJumpTableRelocBaseExpr(const MachineFunction *MF, unsigned JTI,
2088 MCContext &Ctx) const {
2089 // X86-64 uses RIP relative addressing based on the jump table label.
2090 if (Subtarget->isPICStyleRIPRel())
2091 return TargetLowering::getPICJumpTableRelocBaseExpr(MF, JTI, Ctx);
2093 // Otherwise, the reference is relative to the PIC base.
2094 return MCSymbolRefExpr::create(MF->getPICBaseSymbol(), Ctx);
2097 std::pair<const TargetRegisterClass *, uint8_t>
2098 X86TargetLowering::findRepresentativeClass(const TargetRegisterInfo *TRI,
2100 const TargetRegisterClass *RRC = nullptr;
2102 switch (VT.SimpleTy) {
2104 return TargetLowering::findRepresentativeClass(TRI, VT);
2105 case MVT::i8: case MVT::i16: case MVT::i32: case MVT::i64:
2106 RRC = Subtarget->is64Bit() ? &X86::GR64RegClass : &X86::GR32RegClass;
2109 RRC = &X86::VR64RegClass;
2111 case MVT::f32: case MVT::f64:
2112 case MVT::v16i8: case MVT::v8i16: case MVT::v4i32: case MVT::v2i64:
2113 case MVT::v4f32: case MVT::v2f64:
2114 case MVT::v32i8: case MVT::v8i32: case MVT::v4i64: case MVT::v8f32:
2116 RRC = &X86::VR128RegClass;
2119 return std::make_pair(RRC, Cost);
2122 bool X86TargetLowering::getStackCookieLocation(unsigned &AddressSpace,
2123 unsigned &Offset) const {
2124 if (!Subtarget->isTargetLinux())
2127 if (Subtarget->is64Bit()) {
2128 // %fs:0x28, unless we're using a Kernel code model, in which case it's %gs:
2130 if (getTargetMachine().getCodeModel() == CodeModel::Kernel)
2142 Value *X86TargetLowering::getSafeStackPointerLocation(IRBuilder<> &IRB) const {
2143 if (!Subtarget->isTargetAndroid())
2144 return TargetLowering::getSafeStackPointerLocation(IRB);
2146 // Android provides a fixed TLS slot for the SafeStack pointer. See the
2147 // definition of TLS_SLOT_SAFESTACK in
2148 // https://android.googlesource.com/platform/bionic/+/master/libc/private/bionic_tls.h
2149 unsigned AddressSpace, Offset;
2150 if (Subtarget->is64Bit()) {
2151 // %fs:0x48, unless we're using a Kernel code model, in which case it's %gs:
2153 if (getTargetMachine().getCodeModel() == CodeModel::Kernel)
2163 return ConstantExpr::getIntToPtr(
2164 ConstantInt::get(Type::getInt32Ty(IRB.getContext()), Offset),
2165 Type::getInt8PtrTy(IRB.getContext())->getPointerTo(AddressSpace));
2168 bool X86TargetLowering::isNoopAddrSpaceCast(unsigned SrcAS,
2169 unsigned DestAS) const {
2170 assert(SrcAS != DestAS && "Expected different address spaces!");
2172 return SrcAS < 256 && DestAS < 256;
2175 //===----------------------------------------------------------------------===//
2176 // Return Value Calling Convention Implementation
2177 //===----------------------------------------------------------------------===//
2179 #include "X86GenCallingConv.inc"
2181 bool X86TargetLowering::CanLowerReturn(
2182 CallingConv::ID CallConv, MachineFunction &MF, bool isVarArg,
2183 const SmallVectorImpl<ISD::OutputArg> &Outs, LLVMContext &Context) const {
2184 SmallVector<CCValAssign, 16> RVLocs;
2185 CCState CCInfo(CallConv, isVarArg, MF, RVLocs, Context);
2186 return CCInfo.CheckReturn(Outs, RetCC_X86);
2189 const MCPhysReg *X86TargetLowering::getScratchRegisters(CallingConv::ID) const {
2190 static const MCPhysReg ScratchRegs[] = { X86::R11, 0 };
2195 X86TargetLowering::LowerReturn(SDValue Chain,
2196 CallingConv::ID CallConv, bool isVarArg,
2197 const SmallVectorImpl<ISD::OutputArg> &Outs,
2198 const SmallVectorImpl<SDValue> &OutVals,
2199 SDLoc dl, SelectionDAG &DAG) const {
2200 MachineFunction &MF = DAG.getMachineFunction();
2201 X86MachineFunctionInfo *FuncInfo = MF.getInfo<X86MachineFunctionInfo>();
2203 if (CallConv == CallingConv::X86_INTR && !Outs.empty())
2204 report_fatal_error("X86 interrupts may not return any value");
2206 SmallVector<CCValAssign, 16> RVLocs;
2207 CCState CCInfo(CallConv, isVarArg, MF, RVLocs, *DAG.getContext());
2208 CCInfo.AnalyzeReturn(Outs, RetCC_X86);
2211 SmallVector<SDValue, 6> RetOps;
2212 RetOps.push_back(Chain); // Operand #0 = Chain (updated below)
2213 // Operand #1 = Bytes To Pop
2214 RetOps.push_back(DAG.getTargetConstant(FuncInfo->getBytesToPopOnReturn(), dl,
2217 // Copy the result values into the output registers.
2218 for (unsigned i = 0; i != RVLocs.size(); ++i) {
2219 CCValAssign &VA = RVLocs[i];
2220 assert(VA.isRegLoc() && "Can only return in registers!");
2221 SDValue ValToCopy = OutVals[i];
2222 EVT ValVT = ValToCopy.getValueType();
2224 // Promote values to the appropriate types.
2225 if (VA.getLocInfo() == CCValAssign::SExt)
2226 ValToCopy = DAG.getNode(ISD::SIGN_EXTEND, dl, VA.getLocVT(), ValToCopy);
2227 else if (VA.getLocInfo() == CCValAssign::ZExt)
2228 ValToCopy = DAG.getNode(ISD::ZERO_EXTEND, dl, VA.getLocVT(), ValToCopy);
2229 else if (VA.getLocInfo() == CCValAssign::AExt) {
2230 if (ValVT.isVector() && ValVT.getVectorElementType() == MVT::i1)
2231 ValToCopy = DAG.getNode(ISD::SIGN_EXTEND, dl, VA.getLocVT(), ValToCopy);
2233 ValToCopy = DAG.getNode(ISD::ANY_EXTEND, dl, VA.getLocVT(), ValToCopy);
2235 else if (VA.getLocInfo() == CCValAssign::BCvt)
2236 ValToCopy = DAG.getBitcast(VA.getLocVT(), ValToCopy);
2238 assert(VA.getLocInfo() != CCValAssign::FPExt &&
2239 "Unexpected FP-extend for return value.");
2241 // If this is x86-64, and we disabled SSE, we can't return FP values,
2242 // or SSE or MMX vectors.
2243 if ((ValVT == MVT::f32 || ValVT == MVT::f64 ||
2244 VA.getLocReg() == X86::XMM0 || VA.getLocReg() == X86::XMM1) &&
2245 (Subtarget->is64Bit() && !Subtarget->hasSSE1())) {
2246 report_fatal_error("SSE register return with SSE disabled");
2248 // Likewise we can't return F64 values with SSE1 only. gcc does so, but
2249 // llvm-gcc has never done it right and no one has noticed, so this
2250 // should be OK for now.
2251 if (ValVT == MVT::f64 &&
2252 (Subtarget->is64Bit() && !Subtarget->hasSSE2()))
2253 report_fatal_error("SSE2 register return with SSE2 disabled");
2255 // Returns in ST0/ST1 are handled specially: these are pushed as operands to
2256 // the RET instruction and handled by the FP Stackifier.
2257 if (VA.getLocReg() == X86::FP0 ||
2258 VA.getLocReg() == X86::FP1) {
2259 // If this is a copy from an xmm register to ST(0), use an FPExtend to
2260 // change the value to the FP stack register class.
2261 if (isScalarFPTypeInSSEReg(VA.getValVT()))
2262 ValToCopy = DAG.getNode(ISD::FP_EXTEND, dl, MVT::f80, ValToCopy);
2263 RetOps.push_back(ValToCopy);
2264 // Don't emit a copytoreg.
2268 // 64-bit vector (MMX) values are returned in XMM0 / XMM1 except for v1i64
2269 // which is returned in RAX / RDX.
2270 if (Subtarget->is64Bit()) {
2271 if (ValVT == MVT::x86mmx) {
2272 if (VA.getLocReg() == X86::XMM0 || VA.getLocReg() == X86::XMM1) {
2273 ValToCopy = DAG.getBitcast(MVT::i64, ValToCopy);
2274 ValToCopy = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, MVT::v2i64,
2276 // If we don't have SSE2 available, convert to v4f32 so the generated
2277 // register is legal.
2278 if (!Subtarget->hasSSE2())
2279 ValToCopy = DAG.getBitcast(MVT::v4f32, ValToCopy);
2284 Chain = DAG.getCopyToReg(Chain, dl, VA.getLocReg(), ValToCopy, Flag);
2285 Flag = Chain.getValue(1);
2286 RetOps.push_back(DAG.getRegister(VA.getLocReg(), VA.getLocVT()));
2289 // All x86 ABIs require that for returning structs by value we copy
2290 // the sret argument into %rax/%eax (depending on ABI) for the return.
2291 // We saved the argument into a virtual register in the entry block,
2292 // so now we copy the value out and into %rax/%eax.
2294 // Checking Function.hasStructRetAttr() here is insufficient because the IR
2295 // may not have an explicit sret argument. If FuncInfo.CanLowerReturn is
2296 // false, then an sret argument may be implicitly inserted in the SelDAG. In
2297 // either case FuncInfo->setSRetReturnReg() will have been called.
2298 if (unsigned SRetReg = FuncInfo->getSRetReturnReg()) {
2299 SDValue Val = DAG.getCopyFromReg(Chain, dl, SRetReg,
2300 getPointerTy(MF.getDataLayout()));
2303 = (Subtarget->is64Bit() && !Subtarget->isTarget64BitILP32()) ?
2304 X86::RAX : X86::EAX;
2305 Chain = DAG.getCopyToReg(Chain, dl, RetValReg, Val, Flag);
2306 Flag = Chain.getValue(1);
2308 // RAX/EAX now acts like a return value.
2310 DAG.getRegister(RetValReg, getPointerTy(DAG.getDataLayout())));
2313 RetOps[0] = Chain; // Update chain.
2315 // Add the flag if we have it.
2317 RetOps.push_back(Flag);
2319 X86ISD::NodeType opcode = X86ISD::RET_FLAG;
2320 if (CallConv == CallingConv::X86_INTR)
2321 opcode = X86ISD::IRET;
2322 return DAG.getNode(opcode, dl, MVT::Other, RetOps);
2325 bool X86TargetLowering::isUsedByReturnOnly(SDNode *N, SDValue &Chain) const {
2326 if (N->getNumValues() != 1)
2328 if (!N->hasNUsesOfValue(1, 0))
2331 SDValue TCChain = Chain;
2332 SDNode *Copy = *N->use_begin();
2333 if (Copy->getOpcode() == ISD::CopyToReg) {
2334 // If the copy has a glue operand, we conservatively assume it isn't safe to
2335 // perform a tail call.
2336 if (Copy->getOperand(Copy->getNumOperands()-1).getValueType() == MVT::Glue)
2338 TCChain = Copy->getOperand(0);
2339 } else if (Copy->getOpcode() != ISD::FP_EXTEND)
2342 bool HasRet = false;
2343 for (SDNode::use_iterator UI = Copy->use_begin(), UE = Copy->use_end();
2345 if (UI->getOpcode() != X86ISD::RET_FLAG)
2347 // If we are returning more than one value, we can definitely
2348 // not make a tail call see PR19530
2349 if (UI->getNumOperands() > 4)
2351 if (UI->getNumOperands() == 4 &&
2352 UI->getOperand(UI->getNumOperands()-1).getValueType() != MVT::Glue)
2365 X86TargetLowering::getTypeForExtArgOrReturn(LLVMContext &Context, EVT VT,
2366 ISD::NodeType ExtendKind) const {
2368 // TODO: Is this also valid on 32-bit?
2369 if (Subtarget->is64Bit() && VT == MVT::i1 && ExtendKind == ISD::ZERO_EXTEND)
2370 ReturnMVT = MVT::i8;
2372 ReturnMVT = MVT::i32;
2374 EVT MinVT = getRegisterType(Context, ReturnMVT);
2375 return VT.bitsLT(MinVT) ? MinVT : VT;
2378 /// Lower the result values of a call into the
2379 /// appropriate copies out of appropriate physical registers.
2382 X86TargetLowering::LowerCallResult(SDValue Chain, SDValue InFlag,
2383 CallingConv::ID CallConv, bool isVarArg,
2384 const SmallVectorImpl<ISD::InputArg> &Ins,
2385 SDLoc dl, SelectionDAG &DAG,
2386 SmallVectorImpl<SDValue> &InVals) const {
2388 // Assign locations to each value returned by this call.
2389 SmallVector<CCValAssign, 16> RVLocs;
2390 bool Is64Bit = Subtarget->is64Bit();
2391 CCState CCInfo(CallConv, isVarArg, DAG.getMachineFunction(), RVLocs,
2393 CCInfo.AnalyzeCallResult(Ins, RetCC_X86);
2395 // Copy all of the result registers out of their specified physreg.
2396 for (unsigned i = 0, e = RVLocs.size(); i != e; ++i) {
2397 CCValAssign &VA = RVLocs[i];
2398 EVT CopyVT = VA.getLocVT();
2400 // If this is x86-64, and we disabled SSE, we can't return FP values
2401 if ((CopyVT == MVT::f32 || CopyVT == MVT::f64 || CopyVT == MVT::f128) &&
2402 ((Is64Bit || Ins[i].Flags.isInReg()) && !Subtarget->hasSSE1())) {
2403 report_fatal_error("SSE register return with SSE disabled");
2406 // If we prefer to use the value in xmm registers, copy it out as f80 and
2407 // use a truncate to move it from fp stack reg to xmm reg.
2408 bool RoundAfterCopy = false;
2409 if ((VA.getLocReg() == X86::FP0 || VA.getLocReg() == X86::FP1) &&
2410 isScalarFPTypeInSSEReg(VA.getValVT())) {
2412 RoundAfterCopy = (CopyVT != VA.getLocVT());
2415 Chain = DAG.getCopyFromReg(Chain, dl, VA.getLocReg(),
2416 CopyVT, InFlag).getValue(1);
2417 SDValue Val = Chain.getValue(0);
2420 Val = DAG.getNode(ISD::FP_ROUND, dl, VA.getValVT(), Val,
2421 // This truncation won't change the value.
2422 DAG.getIntPtrConstant(1, dl));
2424 if (VA.isExtInLoc() && VA.getValVT().getScalarType() == MVT::i1)
2425 Val = DAG.getNode(ISD::TRUNCATE, dl, VA.getValVT(), Val);
2427 InFlag = Chain.getValue(2);
2428 InVals.push_back(Val);
2434 //===----------------------------------------------------------------------===//
2435 // C & StdCall & Fast Calling Convention implementation
2436 //===----------------------------------------------------------------------===//
2437 // StdCall calling convention seems to be standard for many Windows' API
2438 // routines and around. It differs from C calling convention just a little:
2439 // callee should clean up the stack, not caller. Symbols should be also
2440 // decorated in some fancy way :) It doesn't support any vector arguments.
2441 // For info on fast calling convention see Fast Calling Convention (tail call)
2442 // implementation LowerX86_32FastCCCallTo.
2444 /// CallIsStructReturn - Determines whether a call uses struct return
2446 enum StructReturnType {
2451 static StructReturnType
2452 callIsStructReturn(const SmallVectorImpl<ISD::OutputArg> &Outs, bool IsMCU) {
2454 return NotStructReturn;
2456 const ISD::ArgFlagsTy &Flags = Outs[0].Flags;
2457 if (!Flags.isSRet())
2458 return NotStructReturn;
2459 if (Flags.isInReg() || IsMCU)
2460 return RegStructReturn;
2461 return StackStructReturn;
2464 /// Determines whether a function uses struct return semantics.
2465 static StructReturnType
2466 argsAreStructReturn(const SmallVectorImpl<ISD::InputArg> &Ins, bool IsMCU) {
2468 return NotStructReturn;
2470 const ISD::ArgFlagsTy &Flags = Ins[0].Flags;
2471 if (!Flags.isSRet())
2472 return NotStructReturn;
2473 if (Flags.isInReg() || IsMCU)
2474 return RegStructReturn;
2475 return StackStructReturn;
2478 /// Make a copy of an aggregate at address specified by "Src" to address
2479 /// "Dst" with size and alignment information specified by the specific
2480 /// parameter attribute. The copy will be passed as a byval function parameter.
2482 CreateCopyOfByValArgument(SDValue Src, SDValue Dst, SDValue Chain,
2483 ISD::ArgFlagsTy Flags, SelectionDAG &DAG,
2485 SDValue SizeNode = DAG.getConstant(Flags.getByValSize(), dl, MVT::i32);
2487 return DAG.getMemcpy(Chain, dl, Dst, Src, SizeNode, Flags.getByValAlign(),
2488 /*isVolatile*/false, /*AlwaysInline=*/true,
2489 /*isTailCall*/false,
2490 MachinePointerInfo(), MachinePointerInfo());
2493 /// Return true if the calling convention is one that we can guarantee TCO for.
2494 static bool canGuaranteeTCO(CallingConv::ID CC) {
2495 return (CC == CallingConv::Fast || CC == CallingConv::GHC ||
2496 CC == CallingConv::HiPE || CC == CallingConv::HHVM);
2499 /// Return true if we might ever do TCO for calls with this calling convention.
2500 static bool mayTailCallThisCC(CallingConv::ID CC) {
2502 // C calling conventions:
2503 case CallingConv::C:
2504 case CallingConv::X86_64_Win64:
2505 case CallingConv::X86_64_SysV:
2506 // Callee pop conventions:
2507 case CallingConv::X86_ThisCall:
2508 case CallingConv::X86_StdCall:
2509 case CallingConv::X86_VectorCall:
2510 case CallingConv::X86_FastCall:
2513 return canGuaranteeTCO(CC);
2517 /// Return true if the function is being made into a tailcall target by
2518 /// changing its ABI.
2519 static bool shouldGuaranteeTCO(CallingConv::ID CC, bool GuaranteedTailCallOpt) {
2520 return GuaranteedTailCallOpt && canGuaranteeTCO(CC);
2523 bool X86TargetLowering::mayBeEmittedAsTailCall(CallInst *CI) const {
2525 CI->getParent()->getParent()->getFnAttribute("disable-tail-calls");
2526 if (!CI->isTailCall() || Attr.getValueAsString() == "true")
2530 CallingConv::ID CalleeCC = CS.getCallingConv();
2531 if (!mayTailCallThisCC(CalleeCC))
2538 X86TargetLowering::LowerMemArgument(SDValue Chain,
2539 CallingConv::ID CallConv,
2540 const SmallVectorImpl<ISD::InputArg> &Ins,
2541 SDLoc dl, SelectionDAG &DAG,
2542 const CCValAssign &VA,
2543 MachineFrameInfo *MFI,
2545 // Create the nodes corresponding to a load from this parameter slot.
2546 ISD::ArgFlagsTy Flags = Ins[i].Flags;
2547 bool AlwaysUseMutable = shouldGuaranteeTCO(
2548 CallConv, DAG.getTarget().Options.GuaranteedTailCallOpt);
2549 bool isImmutable = !AlwaysUseMutable && !Flags.isByVal();
2552 // If value is passed by pointer we have address passed instead of the value
2554 bool ExtendedInMem = VA.isExtInLoc() &&
2555 VA.getValVT().getScalarType() == MVT::i1;
2557 if (VA.getLocInfo() == CCValAssign::Indirect || ExtendedInMem)
2558 ValVT = VA.getLocVT();
2560 ValVT = VA.getValVT();
2562 // Calculate SP offset of interrupt parameter, re-arrange the slot normally
2563 // taken by a return address.
2565 if (CallConv == CallingConv::X86_INTR) {
2566 const X86Subtarget& Subtarget =
2567 static_cast<const X86Subtarget&>(DAG.getSubtarget());
2568 // X86 interrupts may take one or two arguments.
2569 // On the stack there will be no return address as in regular call.
2570 // Offset of last argument need to be set to -4/-8 bytes.
2571 // Where offset of the first argument out of two, should be set to 0 bytes.
2572 Offset = (Subtarget.is64Bit() ? 8 : 4) * ((i + 1) % Ins.size() - 1);
2575 // FIXME: For now, all byval parameter objects are marked mutable. This can be
2576 // changed with more analysis.
2577 // In case of tail call optimization mark all arguments mutable. Since they
2578 // could be overwritten by lowering of arguments in case of a tail call.
2579 if (Flags.isByVal()) {
2580 unsigned Bytes = Flags.getByValSize();
2581 if (Bytes == 0) Bytes = 1; // Don't create zero-sized stack objects.
2582 int FI = MFI->CreateFixedObject(Bytes, VA.getLocMemOffset(), isImmutable);
2583 // Adjust SP offset of interrupt parameter.
2584 if (CallConv == CallingConv::X86_INTR) {
2585 MFI->setObjectOffset(FI, Offset);
2587 return DAG.getFrameIndex(FI, getPointerTy(DAG.getDataLayout()));
2589 int FI = MFI->CreateFixedObject(ValVT.getSizeInBits()/8,
2590 VA.getLocMemOffset(), isImmutable);
2591 // Adjust SP offset of interrupt parameter.
2592 if (CallConv == CallingConv::X86_INTR) {
2593 MFI->setObjectOffset(FI, Offset);
2596 SDValue FIN = DAG.getFrameIndex(FI, getPointerTy(DAG.getDataLayout()));
2597 SDValue Val = DAG.getLoad(
2598 ValVT, dl, Chain, FIN,
2599 MachinePointerInfo::getFixedStack(DAG.getMachineFunction(), FI), false,
2601 return ExtendedInMem ?
2602 DAG.getNode(ISD::TRUNCATE, dl, VA.getValVT(), Val) : Val;
2606 // FIXME: Get this from tablegen.
2607 static ArrayRef<MCPhysReg> get64BitArgumentGPRs(CallingConv::ID CallConv,
2608 const X86Subtarget *Subtarget) {
2609 assert(Subtarget->is64Bit());
2611 if (Subtarget->isCallingConvWin64(CallConv)) {
2612 static const MCPhysReg GPR64ArgRegsWin64[] = {
2613 X86::RCX, X86::RDX, X86::R8, X86::R9
2615 return makeArrayRef(std::begin(GPR64ArgRegsWin64), std::end(GPR64ArgRegsWin64));
2618 static const MCPhysReg GPR64ArgRegs64Bit[] = {
2619 X86::RDI, X86::RSI, X86::RDX, X86::RCX, X86::R8, X86::R9
2621 return makeArrayRef(std::begin(GPR64ArgRegs64Bit), std::end(GPR64ArgRegs64Bit));
2624 // FIXME: Get this from tablegen.
2625 static ArrayRef<MCPhysReg> get64BitArgumentXMMs(MachineFunction &MF,
2626 CallingConv::ID CallConv,
2627 const X86Subtarget *Subtarget) {
2628 assert(Subtarget->is64Bit());
2629 if (Subtarget->isCallingConvWin64(CallConv)) {
2630 // The XMM registers which might contain var arg parameters are shadowed
2631 // in their paired GPR. So we only need to save the GPR to their home
2633 // TODO: __vectorcall will change this.
2637 const Function *Fn = MF.getFunction();
2638 bool NoImplicitFloatOps = Fn->hasFnAttribute(Attribute::NoImplicitFloat);
2639 bool isSoftFloat = Subtarget->useSoftFloat();
2640 assert(!(isSoftFloat && NoImplicitFloatOps) &&
2641 "SSE register cannot be used when SSE is disabled!");
2642 if (isSoftFloat || NoImplicitFloatOps || !Subtarget->hasSSE1())
2643 // Kernel mode asks for SSE to be disabled, so there are no XMM argument
2647 static const MCPhysReg XMMArgRegs64Bit[] = {
2648 X86::XMM0, X86::XMM1, X86::XMM2, X86::XMM3,
2649 X86::XMM4, X86::XMM5, X86::XMM6, X86::XMM7
2651 return makeArrayRef(std::begin(XMMArgRegs64Bit), std::end(XMMArgRegs64Bit));
2654 SDValue X86TargetLowering::LowerFormalArguments(
2655 SDValue Chain, CallingConv::ID CallConv, bool isVarArg,
2656 const SmallVectorImpl<ISD::InputArg> &Ins, SDLoc dl, SelectionDAG &DAG,
2657 SmallVectorImpl<SDValue> &InVals) const {
2658 MachineFunction &MF = DAG.getMachineFunction();
2659 X86MachineFunctionInfo *FuncInfo = MF.getInfo<X86MachineFunctionInfo>();
2660 const TargetFrameLowering &TFI = *Subtarget->getFrameLowering();
2662 const Function* Fn = MF.getFunction();
2663 if (Fn->hasExternalLinkage() &&
2664 Subtarget->isTargetCygMing() &&
2665 Fn->getName() == "main")
2666 FuncInfo->setForceFramePointer(true);
2668 MachineFrameInfo *MFI = MF.getFrameInfo();
2669 bool Is64Bit = Subtarget->is64Bit();
2670 bool IsWin64 = Subtarget->isCallingConvWin64(CallConv);
2672 assert(!(isVarArg && canGuaranteeTCO(CallConv)) &&
2673 "Var args not supported with calling convention fastcc, ghc or hipe");
2675 if (CallConv == CallingConv::X86_INTR) {
2676 bool isLegal = Ins.size() == 1 ||
2677 (Ins.size() == 2 && ((Is64Bit && Ins[1].VT == MVT::i64) ||
2678 (!Is64Bit && Ins[1].VT == MVT::i32)));
2680 report_fatal_error("X86 interrupts may take one or two arguments");
2683 // Assign locations to all of the incoming arguments.
2684 SmallVector<CCValAssign, 16> ArgLocs;
2685 CCState CCInfo(CallConv, isVarArg, MF, ArgLocs, *DAG.getContext());
2687 // Allocate shadow area for Win64
2689 CCInfo.AllocateStack(32, 8);
2691 CCInfo.AnalyzeFormalArguments(Ins, CC_X86);
2693 unsigned LastVal = ~0U;
2695 for (unsigned i = 0, e = ArgLocs.size(); i != e; ++i) {
2696 CCValAssign &VA = ArgLocs[i];
2697 // TODO: If an arg is passed in two places (e.g. reg and stack), skip later
2699 assert(VA.getValNo() != LastVal &&
2700 "Don't support value assigned to multiple locs yet");
2702 LastVal = VA.getValNo();
2704 if (VA.isRegLoc()) {
2705 EVT RegVT = VA.getLocVT();
2706 const TargetRegisterClass *RC;
2707 if (RegVT == MVT::i32)
2708 RC = &X86::GR32RegClass;
2709 else if (Is64Bit && RegVT == MVT::i64)
2710 RC = &X86::GR64RegClass;
2711 else if (RegVT == MVT::f32)
2712 RC = &X86::FR32RegClass;
2713 else if (RegVT == MVT::f64)
2714 RC = &X86::FR64RegClass;
2715 else if (RegVT == MVT::f128)
2716 RC = &X86::FR128RegClass;
2717 else if (RegVT.is512BitVector())
2718 RC = &X86::VR512RegClass;
2719 else if (RegVT.is256BitVector())
2720 RC = &X86::VR256RegClass;
2721 else if (RegVT.is128BitVector())
2722 RC = &X86::VR128RegClass;
2723 else if (RegVT == MVT::x86mmx)
2724 RC = &X86::VR64RegClass;
2725 else if (RegVT == MVT::i1)
2726 RC = &X86::VK1RegClass;
2727 else if (RegVT == MVT::v8i1)
2728 RC = &X86::VK8RegClass;
2729 else if (RegVT == MVT::v16i1)
2730 RC = &X86::VK16RegClass;
2731 else if (RegVT == MVT::v32i1)
2732 RC = &X86::VK32RegClass;
2733 else if (RegVT == MVT::v64i1)
2734 RC = &X86::VK64RegClass;
2736 llvm_unreachable("Unknown argument type!");
2738 unsigned Reg = MF.addLiveIn(VA.getLocReg(), RC);
2739 ArgValue = DAG.getCopyFromReg(Chain, dl, Reg, RegVT);
2741 // If this is an 8 or 16-bit value, it is really passed promoted to 32
2742 // bits. Insert an assert[sz]ext to capture this, then truncate to the
2744 if (VA.getLocInfo() == CCValAssign::SExt)
2745 ArgValue = DAG.getNode(ISD::AssertSext, dl, RegVT, ArgValue,
2746 DAG.getValueType(VA.getValVT()));
2747 else if (VA.getLocInfo() == CCValAssign::ZExt)
2748 ArgValue = DAG.getNode(ISD::AssertZext, dl, RegVT, ArgValue,
2749 DAG.getValueType(VA.getValVT()));
2750 else if (VA.getLocInfo() == CCValAssign::BCvt)
2751 ArgValue = DAG.getBitcast(VA.getValVT(), ArgValue);
2753 if (VA.isExtInLoc()) {
2754 // Handle MMX values passed in XMM regs.
2755 if (RegVT.isVector() && VA.getValVT().getScalarType() != MVT::i1)
2756 ArgValue = DAG.getNode(X86ISD::MOVDQ2Q, dl, VA.getValVT(), ArgValue);
2758 ArgValue = DAG.getNode(ISD::TRUNCATE, dl, VA.getValVT(), ArgValue);
2761 assert(VA.isMemLoc());
2762 ArgValue = LowerMemArgument(Chain, CallConv, Ins, dl, DAG, VA, MFI, i);
2765 // If value is passed via pointer - do a load.
2766 if (VA.getLocInfo() == CCValAssign::Indirect)
2767 ArgValue = DAG.getLoad(VA.getValVT(), dl, Chain, ArgValue,
2768 MachinePointerInfo(), false, false, false, 0);
2770 InVals.push_back(ArgValue);
2773 for (unsigned i = 0, e = ArgLocs.size(); i != e; ++i) {
2774 // All x86 ABIs require that for returning structs by value we copy the
2775 // sret argument into %rax/%eax (depending on ABI) for the return. Save
2776 // the argument into a virtual register so that we can access it from the
2778 if (Ins[i].Flags.isSRet()) {
2779 unsigned Reg = FuncInfo->getSRetReturnReg();
2781 MVT PtrTy = getPointerTy(DAG.getDataLayout());
2782 Reg = MF.getRegInfo().createVirtualRegister(getRegClassFor(PtrTy));
2783 FuncInfo->setSRetReturnReg(Reg);
2785 SDValue Copy = DAG.getCopyToReg(DAG.getEntryNode(), dl, Reg, InVals[i]);
2786 Chain = DAG.getNode(ISD::TokenFactor, dl, MVT::Other, Copy, Chain);
2791 unsigned StackSize = CCInfo.getNextStackOffset();
2792 // Align stack specially for tail calls.
2793 if (shouldGuaranteeTCO(CallConv,
2794 MF.getTarget().Options.GuaranteedTailCallOpt))
2795 StackSize = GetAlignedArgumentStackSize(StackSize, DAG);
2797 // If the function takes variable number of arguments, make a frame index for
2798 // the start of the first vararg value... for expansion of llvm.va_start. We
2799 // can skip this if there are no va_start calls.
2800 if (MFI->hasVAStart() &&
2801 (Is64Bit || (CallConv != CallingConv::X86_FastCall &&
2802 CallConv != CallingConv::X86_ThisCall))) {
2803 FuncInfo->setVarArgsFrameIndex(
2804 MFI->CreateFixedObject(1, StackSize, true));
2807 // Figure out if XMM registers are in use.
2808 assert(!(Subtarget->useSoftFloat() &&
2809 Fn->hasFnAttribute(Attribute::NoImplicitFloat)) &&
2810 "SSE register cannot be used when SSE is disabled!");
2812 // 64-bit calling conventions support varargs and register parameters, so we
2813 // have to do extra work to spill them in the prologue.
2814 if (Is64Bit && isVarArg && MFI->hasVAStart()) {
2815 // Find the first unallocated argument registers.
2816 ArrayRef<MCPhysReg> ArgGPRs = get64BitArgumentGPRs(CallConv, Subtarget);
2817 ArrayRef<MCPhysReg> ArgXMMs = get64BitArgumentXMMs(MF, CallConv, Subtarget);
2818 unsigned NumIntRegs = CCInfo.getFirstUnallocated(ArgGPRs);
2819 unsigned NumXMMRegs = CCInfo.getFirstUnallocated(ArgXMMs);
2820 assert(!(NumXMMRegs && !Subtarget->hasSSE1()) &&
2821 "SSE register cannot be used when SSE is disabled!");
2823 // Gather all the live in physical registers.
2824 SmallVector<SDValue, 6> LiveGPRs;
2825 SmallVector<SDValue, 8> LiveXMMRegs;
2827 for (MCPhysReg Reg : ArgGPRs.slice(NumIntRegs)) {
2828 unsigned GPR = MF.addLiveIn(Reg, &X86::GR64RegClass);
2830 DAG.getCopyFromReg(Chain, dl, GPR, MVT::i64));
2832 if (!ArgXMMs.empty()) {
2833 unsigned AL = MF.addLiveIn(X86::AL, &X86::GR8RegClass);
2834 ALVal = DAG.getCopyFromReg(Chain, dl, AL, MVT::i8);
2835 for (MCPhysReg Reg : ArgXMMs.slice(NumXMMRegs)) {
2836 unsigned XMMReg = MF.addLiveIn(Reg, &X86::VR128RegClass);
2837 LiveXMMRegs.push_back(
2838 DAG.getCopyFromReg(Chain, dl, XMMReg, MVT::v4f32));
2843 // Get to the caller-allocated home save location. Add 8 to account
2844 // for the return address.
2845 int HomeOffset = TFI.getOffsetOfLocalArea() + 8;
2846 FuncInfo->setRegSaveFrameIndex(
2847 MFI->CreateFixedObject(1, NumIntRegs * 8 + HomeOffset, false));
2848 // Fixup to set vararg frame on shadow area (4 x i64).
2850 FuncInfo->setVarArgsFrameIndex(FuncInfo->getRegSaveFrameIndex());
2852 // For X86-64, if there are vararg parameters that are passed via
2853 // registers, then we must store them to their spots on the stack so
2854 // they may be loaded by deferencing the result of va_next.
2855 FuncInfo->setVarArgsGPOffset(NumIntRegs * 8);
2856 FuncInfo->setVarArgsFPOffset(ArgGPRs.size() * 8 + NumXMMRegs * 16);
2857 FuncInfo->setRegSaveFrameIndex(MFI->CreateStackObject(
2858 ArgGPRs.size() * 8 + ArgXMMs.size() * 16, 16, false));
2861 // Store the integer parameter registers.
2862 SmallVector<SDValue, 8> MemOps;
2863 SDValue RSFIN = DAG.getFrameIndex(FuncInfo->getRegSaveFrameIndex(),
2864 getPointerTy(DAG.getDataLayout()));
2865 unsigned Offset = FuncInfo->getVarArgsGPOffset();
2866 for (SDValue Val : LiveGPRs) {
2867 SDValue FIN = DAG.getNode(ISD::ADD, dl, getPointerTy(DAG.getDataLayout()),
2868 RSFIN, DAG.getIntPtrConstant(Offset, dl));
2870 DAG.getStore(Val.getValue(1), dl, Val, FIN,
2871 MachinePointerInfo::getFixedStack(
2872 DAG.getMachineFunction(),
2873 FuncInfo->getRegSaveFrameIndex(), Offset),
2875 MemOps.push_back(Store);
2879 if (!ArgXMMs.empty() && NumXMMRegs != ArgXMMs.size()) {
2880 // Now store the XMM (fp + vector) parameter registers.
2881 SmallVector<SDValue, 12> SaveXMMOps;
2882 SaveXMMOps.push_back(Chain);
2883 SaveXMMOps.push_back(ALVal);
2884 SaveXMMOps.push_back(DAG.getIntPtrConstant(
2885 FuncInfo->getRegSaveFrameIndex(), dl));
2886 SaveXMMOps.push_back(DAG.getIntPtrConstant(
2887 FuncInfo->getVarArgsFPOffset(), dl));
2888 SaveXMMOps.insert(SaveXMMOps.end(), LiveXMMRegs.begin(),
2890 MemOps.push_back(DAG.getNode(X86ISD::VASTART_SAVE_XMM_REGS, dl,
2891 MVT::Other, SaveXMMOps));
2894 if (!MemOps.empty())
2895 Chain = DAG.getNode(ISD::TokenFactor, dl, MVT::Other, MemOps);
2898 if (isVarArg && MFI->hasMustTailInVarArgFunc()) {
2899 // Find the largest legal vector type.
2900 MVT VecVT = MVT::Other;
2901 // FIXME: Only some x86_32 calling conventions support AVX512.
2902 if (Subtarget->hasAVX512() &&
2903 (Is64Bit || (CallConv == CallingConv::X86_VectorCall ||
2904 CallConv == CallingConv::Intel_OCL_BI)))
2905 VecVT = MVT::v16f32;
2906 else if (Subtarget->hasAVX())
2908 else if (Subtarget->hasSSE2())
2911 // We forward some GPRs and some vector types.
2912 SmallVector<MVT, 2> RegParmTypes;
2913 MVT IntVT = Is64Bit ? MVT::i64 : MVT::i32;
2914 RegParmTypes.push_back(IntVT);
2915 if (VecVT != MVT::Other)
2916 RegParmTypes.push_back(VecVT);
2918 // Compute the set of forwarded registers. The rest are scratch.
2919 SmallVectorImpl<ForwardedRegister> &Forwards =
2920 FuncInfo->getForwardedMustTailRegParms();
2921 CCInfo.analyzeMustTailForwardedRegisters(Forwards, RegParmTypes, CC_X86);
2923 // Conservatively forward AL on x86_64, since it might be used for varargs.
2924 if (Is64Bit && !CCInfo.isAllocated(X86::AL)) {
2925 unsigned ALVReg = MF.addLiveIn(X86::AL, &X86::GR8RegClass);
2926 Forwards.push_back(ForwardedRegister(ALVReg, X86::AL, MVT::i8));
2929 // Copy all forwards from physical to virtual registers.
2930 for (ForwardedRegister &F : Forwards) {
2931 // FIXME: Can we use a less constrained schedule?
2932 SDValue RegVal = DAG.getCopyFromReg(Chain, dl, F.VReg, F.VT);
2933 F.VReg = MF.getRegInfo().createVirtualRegister(getRegClassFor(F.VT));
2934 Chain = DAG.getCopyToReg(Chain, dl, F.VReg, RegVal);
2938 // Some CCs need callee pop.
2939 if (X86::isCalleePop(CallConv, Is64Bit, isVarArg,
2940 MF.getTarget().Options.GuaranteedTailCallOpt)) {
2941 FuncInfo->setBytesToPopOnReturn(StackSize); // Callee pops everything.
2942 } else if (CallConv == CallingConv::X86_INTR && Ins.size() == 2) {
2943 // X86 interrupts must pop the error code if present
2944 FuncInfo->setBytesToPopOnReturn(Is64Bit ? 8 : 4);
2946 FuncInfo->setBytesToPopOnReturn(0); // Callee pops nothing.
2947 // If this is an sret function, the return should pop the hidden pointer.
2948 if (!Is64Bit && !canGuaranteeTCO(CallConv) &&
2949 !Subtarget->getTargetTriple().isOSMSVCRT() &&
2950 argsAreStructReturn(Ins, Subtarget->isTargetMCU()) == StackStructReturn)
2951 FuncInfo->setBytesToPopOnReturn(4);
2955 // RegSaveFrameIndex is X86-64 only.
2956 FuncInfo->setRegSaveFrameIndex(0xAAAAAAA);
2957 if (CallConv == CallingConv::X86_FastCall ||
2958 CallConv == CallingConv::X86_ThisCall)
2959 // fastcc functions can't have varargs.
2960 FuncInfo->setVarArgsFrameIndex(0xAAAAAAA);
2963 FuncInfo->setArgumentStackSize(StackSize);
2965 if (WinEHFuncInfo *EHInfo = MF.getWinEHFuncInfo()) {
2966 EHPersonality Personality = classifyEHPersonality(Fn->getPersonalityFn());
2967 if (Personality == EHPersonality::CoreCLR) {
2969 // TODO: Add a mechanism to frame lowering that will allow us to indicate
2970 // that we'd prefer this slot be allocated towards the bottom of the frame
2971 // (i.e. near the stack pointer after allocating the frame). Every
2972 // funclet needs a copy of this slot in its (mostly empty) frame, and the
2973 // offset from the bottom of this and each funclet's frame must be the
2974 // same, so the size of funclets' (mostly empty) frames is dictated by
2975 // how far this slot is from the bottom (since they allocate just enough
2976 // space to accomodate holding this slot at the correct offset).
2977 int PSPSymFI = MFI->CreateStackObject(8, 8, /*isSS=*/false);
2978 EHInfo->PSPSymFrameIdx = PSPSymFI;
2986 X86TargetLowering::LowerMemOpCallTo(SDValue Chain,
2987 SDValue StackPtr, SDValue Arg,
2988 SDLoc dl, SelectionDAG &DAG,
2989 const CCValAssign &VA,
2990 ISD::ArgFlagsTy Flags) const {
2991 unsigned LocMemOffset = VA.getLocMemOffset();
2992 SDValue PtrOff = DAG.getIntPtrConstant(LocMemOffset, dl);
2993 PtrOff = DAG.getNode(ISD::ADD, dl, getPointerTy(DAG.getDataLayout()),
2995 if (Flags.isByVal())
2996 return CreateCopyOfByValArgument(Arg, PtrOff, Chain, Flags, DAG, dl);
2998 return DAG.getStore(
2999 Chain, dl, Arg, PtrOff,
3000 MachinePointerInfo::getStack(DAG.getMachineFunction(), LocMemOffset),
3004 /// Emit a load of return address if tail call
3005 /// optimization is performed and it is required.
3007 X86TargetLowering::EmitTailCallLoadRetAddr(SelectionDAG &DAG,
3008 SDValue &OutRetAddr, SDValue Chain,
3009 bool IsTailCall, bool Is64Bit,
3010 int FPDiff, SDLoc dl) const {
3011 // Adjust the Return address stack slot.
3012 EVT VT = getPointerTy(DAG.getDataLayout());
3013 OutRetAddr = getReturnAddressFrameIndex(DAG);
3015 // Load the "old" Return address.
3016 OutRetAddr = DAG.getLoad(VT, dl, Chain, OutRetAddr, MachinePointerInfo(),
3017 false, false, false, 0);
3018 return SDValue(OutRetAddr.getNode(), 1);
3021 /// Emit a store of the return address if tail call
3022 /// optimization is performed and it is required (FPDiff!=0).
3023 static SDValue EmitTailCallStoreRetAddr(SelectionDAG &DAG, MachineFunction &MF,
3024 SDValue Chain, SDValue RetAddrFrIdx,
3025 EVT PtrVT, unsigned SlotSize,
3026 int FPDiff, SDLoc dl) {
3027 // Store the return address to the appropriate stack slot.
3028 if (!FPDiff) return Chain;
3029 // Calculate the new stack slot for the return address.
3030 int NewReturnAddrFI =
3031 MF.getFrameInfo()->CreateFixedObject(SlotSize, (int64_t)FPDiff - SlotSize,
3033 SDValue NewRetAddrFrIdx = DAG.getFrameIndex(NewReturnAddrFI, PtrVT);
3034 Chain = DAG.getStore(Chain, dl, RetAddrFrIdx, NewRetAddrFrIdx,
3035 MachinePointerInfo::getFixedStack(
3036 DAG.getMachineFunction(), NewReturnAddrFI),
3041 /// Returns a vector_shuffle mask for an movs{s|d}, movd
3042 /// operation of specified width.
3043 static SDValue getMOVL(SelectionDAG &DAG, SDLoc dl, MVT VT, SDValue V1,
3045 unsigned NumElems = VT.getVectorNumElements();
3046 SmallVector<int, 8> Mask;
3047 Mask.push_back(NumElems);
3048 for (unsigned i = 1; i != NumElems; ++i)
3050 return DAG.getVectorShuffle(VT, dl, V1, V2, &Mask[0]);
3054 X86TargetLowering::LowerCall(TargetLowering::CallLoweringInfo &CLI,
3055 SmallVectorImpl<SDValue> &InVals) const {
3056 SelectionDAG &DAG = CLI.DAG;
3058 SmallVectorImpl<ISD::OutputArg> &Outs = CLI.Outs;
3059 SmallVectorImpl<SDValue> &OutVals = CLI.OutVals;
3060 SmallVectorImpl<ISD::InputArg> &Ins = CLI.Ins;
3061 SDValue Chain = CLI.Chain;
3062 SDValue Callee = CLI.Callee;
3063 CallingConv::ID CallConv = CLI.CallConv;
3064 bool &isTailCall = CLI.IsTailCall;
3065 bool isVarArg = CLI.IsVarArg;
3067 MachineFunction &MF = DAG.getMachineFunction();
3068 bool Is64Bit = Subtarget->is64Bit();
3069 bool IsWin64 = Subtarget->isCallingConvWin64(CallConv);
3070 StructReturnType SR = callIsStructReturn(Outs, Subtarget->isTargetMCU());
3071 bool IsSibcall = false;
3072 X86MachineFunctionInfo *X86Info = MF.getInfo<X86MachineFunctionInfo>();
3073 auto Attr = MF.getFunction()->getFnAttribute("disable-tail-calls");
3075 if (CallConv == CallingConv::X86_INTR)
3076 report_fatal_error("X86 interrupts may not be called directly");
3078 if (Attr.getValueAsString() == "true")
3081 if (Subtarget->isPICStyleGOT() &&
3082 !MF.getTarget().Options.GuaranteedTailCallOpt) {
3083 // If we are using a GOT, disable tail calls to external symbols with
3084 // default visibility. Tail calling such a symbol requires using a GOT
3085 // relocation, which forces early binding of the symbol. This breaks code
3086 // that require lazy function symbol resolution. Using musttail or
3087 // GuaranteedTailCallOpt will override this.
3088 GlobalAddressSDNode *G = dyn_cast<GlobalAddressSDNode>(Callee);
3089 if (!G || (!G->getGlobal()->hasLocalLinkage() &&
3090 G->getGlobal()->hasDefaultVisibility()))
3094 bool IsMustTail = CLI.CS && CLI.CS->isMustTailCall();
3096 // Force this to be a tail call. The verifier rules are enough to ensure
3097 // that we can lower this successfully without moving the return address
3100 } else if (isTailCall) {
3101 // Check if it's really possible to do a tail call.
3102 isTailCall = IsEligibleForTailCallOptimization(Callee, CallConv,
3103 isVarArg, SR != NotStructReturn,
3104 MF.getFunction()->hasStructRetAttr(), CLI.RetTy,
3105 Outs, OutVals, Ins, DAG);
3107 // Sibcalls are automatically detected tailcalls which do not require
3109 if (!MF.getTarget().Options.GuaranteedTailCallOpt && isTailCall)
3116 assert(!(isVarArg && canGuaranteeTCO(CallConv)) &&
3117 "Var args not supported with calling convention fastcc, ghc or hipe");
3119 // Analyze operands of the call, assigning locations to each operand.
3120 SmallVector<CCValAssign, 16> ArgLocs;
3121 CCState CCInfo(CallConv, isVarArg, MF, ArgLocs, *DAG.getContext());
3123 // Allocate shadow area for Win64
3125 CCInfo.AllocateStack(32, 8);
3127 CCInfo.AnalyzeCallOperands(Outs, CC_X86);
3129 // Get a count of how many bytes are to be pushed on the stack.
3130 unsigned NumBytes = CCInfo.getAlignedCallFrameSize();
3132 // This is a sibcall. The memory operands are available in caller's
3133 // own caller's stack.
3135 else if (MF.getTarget().Options.GuaranteedTailCallOpt &&
3136 canGuaranteeTCO(CallConv))
3137 NumBytes = GetAlignedArgumentStackSize(NumBytes, DAG);
3140 if (isTailCall && !IsSibcall && !IsMustTail) {
3141 // Lower arguments at fp - stackoffset + fpdiff.
3142 unsigned NumBytesCallerPushed = X86Info->getBytesToPopOnReturn();
3144 FPDiff = NumBytesCallerPushed - NumBytes;
3146 // Set the delta of movement of the returnaddr stackslot.
3147 // But only set if delta is greater than previous delta.
3148 if (FPDiff < X86Info->getTCReturnAddrDelta())
3149 X86Info->setTCReturnAddrDelta(FPDiff);
3152 unsigned NumBytesToPush = NumBytes;
3153 unsigned NumBytesToPop = NumBytes;
3155 // If we have an inalloca argument, all stack space has already been allocated
3156 // for us and be right at the top of the stack. We don't support multiple
3157 // arguments passed in memory when using inalloca.
3158 if (!Outs.empty() && Outs.back().Flags.isInAlloca()) {
3160 if (!ArgLocs.back().isMemLoc())
3161 report_fatal_error("cannot use inalloca attribute on a register "
3163 if (ArgLocs.back().getLocMemOffset() != 0)
3164 report_fatal_error("any parameter with the inalloca attribute must be "
3165 "the only memory argument");
3169 Chain = DAG.getCALLSEQ_START(
3170 Chain, DAG.getIntPtrConstant(NumBytesToPush, dl, true), dl);
3172 SDValue RetAddrFrIdx;
3173 // Load return address for tail calls.
3174 if (isTailCall && FPDiff)
3175 Chain = EmitTailCallLoadRetAddr(DAG, RetAddrFrIdx, Chain, isTailCall,
3176 Is64Bit, FPDiff, dl);
3178 SmallVector<std::pair<unsigned, SDValue>, 8> RegsToPass;
3179 SmallVector<SDValue, 8> MemOpChains;
3182 // Walk the register/memloc assignments, inserting copies/loads. In the case
3183 // of tail call optimization arguments are handle later.
3184 const X86RegisterInfo *RegInfo = Subtarget->getRegisterInfo();
3185 for (unsigned i = 0, e = ArgLocs.size(); i != e; ++i) {
3186 // Skip inalloca arguments, they have already been written.
3187 ISD::ArgFlagsTy Flags = Outs[i].Flags;
3188 if (Flags.isInAlloca())
3191 CCValAssign &VA = ArgLocs[i];
3192 EVT RegVT = VA.getLocVT();
3193 SDValue Arg = OutVals[i];
3194 bool isByVal = Flags.isByVal();
3196 // Promote the value if needed.
3197 switch (VA.getLocInfo()) {
3198 default: llvm_unreachable("Unknown loc info!");
3199 case CCValAssign::Full: break;
3200 case CCValAssign::SExt:
3201 Arg = DAG.getNode(ISD::SIGN_EXTEND, dl, RegVT, Arg);
3203 case CCValAssign::ZExt:
3204 Arg = DAG.getNode(ISD::ZERO_EXTEND, dl, RegVT, Arg);
3206 case CCValAssign::AExt:
3207 if (Arg.getValueType().isVector() &&
3208 Arg.getValueType().getVectorElementType() == MVT::i1)
3209 Arg = DAG.getNode(ISD::SIGN_EXTEND, dl, RegVT, Arg);
3210 else if (RegVT.is128BitVector()) {
3211 // Special case: passing MMX values in XMM registers.
3212 Arg = DAG.getBitcast(MVT::i64, Arg);
3213 Arg = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, MVT::v2i64, Arg);
3214 Arg = getMOVL(DAG, dl, MVT::v2i64, DAG.getUNDEF(MVT::v2i64), Arg);
3216 Arg = DAG.getNode(ISD::ANY_EXTEND, dl, RegVT, Arg);
3218 case CCValAssign::BCvt:
3219 Arg = DAG.getBitcast(RegVT, Arg);
3221 case CCValAssign::Indirect: {
3222 // Store the argument.
3223 SDValue SpillSlot = DAG.CreateStackTemporary(VA.getValVT());
3224 int FI = cast<FrameIndexSDNode>(SpillSlot)->getIndex();
3225 Chain = DAG.getStore(
3226 Chain, dl, Arg, SpillSlot,
3227 MachinePointerInfo::getFixedStack(DAG.getMachineFunction(), FI),
3234 if (VA.isRegLoc()) {
3235 RegsToPass.push_back(std::make_pair(VA.getLocReg(), Arg));
3236 if (isVarArg && IsWin64) {
3237 // Win64 ABI requires argument XMM reg to be copied to the corresponding
3238 // shadow reg if callee is a varargs function.
3239 unsigned ShadowReg = 0;
3240 switch (VA.getLocReg()) {
3241 case X86::XMM0: ShadowReg = X86::RCX; break;
3242 case X86::XMM1: ShadowReg = X86::RDX; break;
3243 case X86::XMM2: ShadowReg = X86::R8; break;
3244 case X86::XMM3: ShadowReg = X86::R9; break;
3247 RegsToPass.push_back(std::make_pair(ShadowReg, Arg));
3249 } else if (!IsSibcall && (!isTailCall || isByVal)) {
3250 assert(VA.isMemLoc());
3251 if (!StackPtr.getNode())
3252 StackPtr = DAG.getCopyFromReg(Chain, dl, RegInfo->getStackRegister(),
3253 getPointerTy(DAG.getDataLayout()));
3254 MemOpChains.push_back(LowerMemOpCallTo(Chain, StackPtr, Arg,
3255 dl, DAG, VA, Flags));
3259 if (!MemOpChains.empty())
3260 Chain = DAG.getNode(ISD::TokenFactor, dl, MVT::Other, MemOpChains);
3262 if (Subtarget->isPICStyleGOT()) {
3263 // ELF / PIC requires GOT in the EBX register before function calls via PLT
3266 RegsToPass.push_back(std::make_pair(
3267 unsigned(X86::EBX), DAG.getNode(X86ISD::GlobalBaseReg, SDLoc(),
3268 getPointerTy(DAG.getDataLayout()))));
3270 // If we are tail calling and generating PIC/GOT style code load the
3271 // address of the callee into ECX. The value in ecx is used as target of
3272 // the tail jump. This is done to circumvent the ebx/callee-saved problem
3273 // for tail calls on PIC/GOT architectures. Normally we would just put the
3274 // address of GOT into ebx and then call target@PLT. But for tail calls
3275 // ebx would be restored (since ebx is callee saved) before jumping to the
3278 // Note: The actual moving to ECX is done further down.
3279 GlobalAddressSDNode *G = dyn_cast<GlobalAddressSDNode>(Callee);
3280 if (G && !G->getGlobal()->hasLocalLinkage() &&
3281 G->getGlobal()->hasDefaultVisibility())
3282 Callee = LowerGlobalAddress(Callee, DAG);
3283 else if (isa<ExternalSymbolSDNode>(Callee))
3284 Callee = LowerExternalSymbol(Callee, DAG);
3288 if (Is64Bit && isVarArg && !IsWin64 && !IsMustTail) {
3289 // From AMD64 ABI document:
3290 // For calls that may call functions that use varargs or stdargs
3291 // (prototype-less calls or calls to functions containing ellipsis (...) in
3292 // the declaration) %al is used as hidden argument to specify the number
3293 // of SSE registers used. The contents of %al do not need to match exactly
3294 // the number of registers, but must be an ubound on the number of SSE
3295 // registers used and is in the range 0 - 8 inclusive.
3297 // Count the number of XMM registers allocated.
3298 static const MCPhysReg XMMArgRegs[] = {
3299 X86::XMM0, X86::XMM1, X86::XMM2, X86::XMM3,
3300 X86::XMM4, X86::XMM5, X86::XMM6, X86::XMM7
3302 unsigned NumXMMRegs = CCInfo.getFirstUnallocated(XMMArgRegs);
3303 assert((Subtarget->hasSSE1() || !NumXMMRegs)
3304 && "SSE registers cannot be used when SSE is disabled");
3306 RegsToPass.push_back(std::make_pair(unsigned(X86::AL),
3307 DAG.getConstant(NumXMMRegs, dl,
3311 if (isVarArg && IsMustTail) {
3312 const auto &Forwards = X86Info->getForwardedMustTailRegParms();
3313 for (const auto &F : Forwards) {
3314 SDValue Val = DAG.getCopyFromReg(Chain, dl, F.VReg, F.VT);
3315 RegsToPass.push_back(std::make_pair(unsigned(F.PReg), Val));
3319 // For tail calls lower the arguments to the 'real' stack slots. Sibcalls
3320 // don't need this because the eligibility check rejects calls that require
3321 // shuffling arguments passed in memory.
3322 if (!IsSibcall && isTailCall) {
3323 // Force all the incoming stack arguments to be loaded from the stack
3324 // before any new outgoing arguments are stored to the stack, because the
3325 // outgoing stack slots may alias the incoming argument stack slots, and
3326 // the alias isn't otherwise explicit. This is slightly more conservative
3327 // than necessary, because it means that each store effectively depends
3328 // on every argument instead of just those arguments it would clobber.
3329 SDValue ArgChain = DAG.getStackArgumentTokenFactor(Chain);
3331 SmallVector<SDValue, 8> MemOpChains2;
3334 for (unsigned i = 0, e = ArgLocs.size(); i != e; ++i) {
3335 CCValAssign &VA = ArgLocs[i];
3338 assert(VA.isMemLoc());
3339 SDValue Arg = OutVals[i];
3340 ISD::ArgFlagsTy Flags = Outs[i].Flags;
3341 // Skip inalloca arguments. They don't require any work.
3342 if (Flags.isInAlloca())
3344 // Create frame index.
3345 int32_t Offset = VA.getLocMemOffset()+FPDiff;
3346 uint32_t OpSize = (VA.getLocVT().getSizeInBits()+7)/8;
3347 FI = MF.getFrameInfo()->CreateFixedObject(OpSize, Offset, true);
3348 FIN = DAG.getFrameIndex(FI, getPointerTy(DAG.getDataLayout()));
3350 if (Flags.isByVal()) {
3351 // Copy relative to framepointer.
3352 SDValue Source = DAG.getIntPtrConstant(VA.getLocMemOffset(), dl);
3353 if (!StackPtr.getNode())
3354 StackPtr = DAG.getCopyFromReg(Chain, dl, RegInfo->getStackRegister(),
3355 getPointerTy(DAG.getDataLayout()));
3356 Source = DAG.getNode(ISD::ADD, dl, getPointerTy(DAG.getDataLayout()),
3359 MemOpChains2.push_back(CreateCopyOfByValArgument(Source, FIN,
3363 // Store relative to framepointer.
3364 MemOpChains2.push_back(DAG.getStore(
3365 ArgChain, dl, Arg, FIN,
3366 MachinePointerInfo::getFixedStack(DAG.getMachineFunction(), FI),
3371 if (!MemOpChains2.empty())
3372 Chain = DAG.getNode(ISD::TokenFactor, dl, MVT::Other, MemOpChains2);
3374 // Store the return address to the appropriate stack slot.
3375 Chain = EmitTailCallStoreRetAddr(DAG, MF, Chain, RetAddrFrIdx,
3376 getPointerTy(DAG.getDataLayout()),
3377 RegInfo->getSlotSize(), FPDiff, dl);
3380 // Build a sequence of copy-to-reg nodes chained together with token chain
3381 // and flag operands which copy the outgoing args into registers.
3383 for (unsigned i = 0, e = RegsToPass.size(); i != e; ++i) {
3384 Chain = DAG.getCopyToReg(Chain, dl, RegsToPass[i].first,
3385 RegsToPass[i].second, InFlag);
3386 InFlag = Chain.getValue(1);
3389 if (DAG.getTarget().getCodeModel() == CodeModel::Large) {
3390 assert(Is64Bit && "Large code model is only legal in 64-bit mode.");
3391 // In the 64-bit large code model, we have to make all calls
3392 // through a register, since the call instruction's 32-bit
3393 // pc-relative offset may not be large enough to hold the whole
3395 } else if (Callee->getOpcode() == ISD::GlobalAddress) {
3396 // If the callee is a GlobalAddress node (quite common, every direct call
3397 // is) turn it into a TargetGlobalAddress node so that legalize doesn't hack
3399 GlobalAddressSDNode* G = cast<GlobalAddressSDNode>(Callee);
3401 // We should use extra load for direct calls to dllimported functions in
3403 const GlobalValue *GV = G->getGlobal();
3404 if (!GV->hasDLLImportStorageClass()) {
3405 unsigned char OpFlags = 0;
3406 bool ExtraLoad = false;
3407 unsigned WrapperKind = ISD::DELETED_NODE;
3409 // On ELF targets, in both X86-64 and X86-32 mode, direct calls to
3410 // external symbols most go through the PLT in PIC mode. If the symbol
3411 // has hidden or protected visibility, or if it is static or local, then
3412 // we don't need to use the PLT - we can directly call it.
3413 if (Subtarget->isTargetELF() &&
3414 DAG.getTarget().getRelocationModel() == Reloc::PIC_ &&
3415 GV->hasDefaultVisibility() && !GV->hasLocalLinkage()) {
3416 OpFlags = X86II::MO_PLT;
3417 } else if (Subtarget->isPICStyleStubAny() &&
3418 !GV->isStrongDefinitionForLinker() &&
3419 (!Subtarget->getTargetTriple().isMacOSX() ||
3420 Subtarget->getTargetTriple().isMacOSXVersionLT(10, 5))) {
3421 // PC-relative references to external symbols should go through $stub,
3422 // unless we're building with the leopard linker or later, which
3423 // automatically synthesizes these stubs.
3424 OpFlags = X86II::MO_DARWIN_STUB;
3425 } else if (Subtarget->isPICStyleRIPRel() && isa<Function>(GV) &&
3426 cast<Function>(GV)->hasFnAttribute(Attribute::NonLazyBind)) {
3427 // If the function is marked as non-lazy, generate an indirect call
3428 // which loads from the GOT directly. This avoids runtime overhead
3429 // at the cost of eager binding (and one extra byte of encoding).
3430 OpFlags = X86II::MO_GOTPCREL;
3431 WrapperKind = X86ISD::WrapperRIP;
3435 Callee = DAG.getTargetGlobalAddress(
3436 GV, dl, getPointerTy(DAG.getDataLayout()), G->getOffset(), OpFlags);
3438 // Add a wrapper if needed.
3439 if (WrapperKind != ISD::DELETED_NODE)
3440 Callee = DAG.getNode(X86ISD::WrapperRIP, dl,
3441 getPointerTy(DAG.getDataLayout()), Callee);
3442 // Add extra indirection if needed.
3444 Callee = DAG.getLoad(
3445 getPointerTy(DAG.getDataLayout()), dl, DAG.getEntryNode(), Callee,
3446 MachinePointerInfo::getGOT(DAG.getMachineFunction()), false, false,
3449 } else if (ExternalSymbolSDNode *S = dyn_cast<ExternalSymbolSDNode>(Callee)) {
3450 unsigned char OpFlags = 0;
3452 // On ELF targets, in either X86-64 or X86-32 mode, direct calls to
3453 // external symbols should go through the PLT.
3454 if (Subtarget->isTargetELF() &&
3455 DAG.getTarget().getRelocationModel() == Reloc::PIC_) {
3456 OpFlags = X86II::MO_PLT;
3457 } else if (Subtarget->isPICStyleStubAny() &&
3458 (!Subtarget->getTargetTriple().isMacOSX() ||
3459 Subtarget->getTargetTriple().isMacOSXVersionLT(10, 5))) {
3460 // PC-relative references to external symbols should go through $stub,
3461 // unless we're building with the leopard linker or later, which
3462 // automatically synthesizes these stubs.
3463 OpFlags = X86II::MO_DARWIN_STUB;
3466 Callee = DAG.getTargetExternalSymbol(
3467 S->getSymbol(), getPointerTy(DAG.getDataLayout()), OpFlags);
3468 } else if (Subtarget->isTarget64BitILP32() &&
3469 Callee->getValueType(0) == MVT::i32) {
3470 // Zero-extend the 32-bit Callee address into a 64-bit according to x32 ABI
3471 Callee = DAG.getNode(ISD::ZERO_EXTEND, dl, MVT::i64, Callee);
3474 // Returns a chain & a flag for retval copy to use.
3475 SDVTList NodeTys = DAG.getVTList(MVT::Other, MVT::Glue);
3476 SmallVector<SDValue, 8> Ops;
3478 if (!IsSibcall && isTailCall) {
3479 Chain = DAG.getCALLSEQ_END(Chain,
3480 DAG.getIntPtrConstant(NumBytesToPop, dl, true),
3481 DAG.getIntPtrConstant(0, dl, true), InFlag, dl);
3482 InFlag = Chain.getValue(1);
3485 Ops.push_back(Chain);
3486 Ops.push_back(Callee);
3489 Ops.push_back(DAG.getConstant(FPDiff, dl, MVT::i32));
3491 // Add argument registers to the end of the list so that they are known live
3493 for (unsigned i = 0, e = RegsToPass.size(); i != e; ++i)
3494 Ops.push_back(DAG.getRegister(RegsToPass[i].first,
3495 RegsToPass[i].second.getValueType()));
3497 // Add a register mask operand representing the call-preserved registers.
3498 const uint32_t *Mask = RegInfo->getCallPreservedMask(MF, CallConv);
3499 assert(Mask && "Missing call preserved mask for calling convention");
3501 // If this is an invoke in a 32-bit function using a funclet-based
3502 // personality, assume the function clobbers all registers. If an exception
3503 // is thrown, the runtime will not restore CSRs.
3504 // FIXME: Model this more precisely so that we can register allocate across
3505 // the normal edge and spill and fill across the exceptional edge.
3506 if (!Is64Bit && CLI.CS && CLI.CS->isInvoke()) {
3507 const Function *CallerFn = MF.getFunction();
3508 EHPersonality Pers =
3509 CallerFn->hasPersonalityFn()
3510 ? classifyEHPersonality(CallerFn->getPersonalityFn())
3511 : EHPersonality::Unknown;
3512 if (isFuncletEHPersonality(Pers))
3513 Mask = RegInfo->getNoPreservedMask();
3516 Ops.push_back(DAG.getRegisterMask(Mask));
3518 if (InFlag.getNode())
3519 Ops.push_back(InFlag);
3523 //// If this is the first return lowered for this function, add the regs
3524 //// to the liveout set for the function.
3525 // This isn't right, although it's probably harmless on x86; liveouts
3526 // should be computed from returns not tail calls. Consider a void
3527 // function making a tail call to a function returning int.
3528 MF.getFrameInfo()->setHasTailCall();
3529 return DAG.getNode(X86ISD::TC_RETURN, dl, NodeTys, Ops);
3532 Chain = DAG.getNode(X86ISD::CALL, dl, NodeTys, Ops);
3533 InFlag = Chain.getValue(1);
3535 // Create the CALLSEQ_END node.
3536 unsigned NumBytesForCalleeToPop;
3537 if (X86::isCalleePop(CallConv, Is64Bit, isVarArg,
3538 DAG.getTarget().Options.GuaranteedTailCallOpt))
3539 NumBytesForCalleeToPop = NumBytes; // Callee pops everything
3540 else if (!Is64Bit && !canGuaranteeTCO(CallConv) &&
3541 !Subtarget->getTargetTriple().isOSMSVCRT() &&
3542 SR == StackStructReturn)
3543 // If this is a call to a struct-return function, the callee
3544 // pops the hidden struct pointer, so we have to push it back.
3545 // This is common for Darwin/X86, Linux & Mingw32 targets.
3546 // For MSVC Win32 targets, the caller pops the hidden struct pointer.
3547 NumBytesForCalleeToPop = 4;
3549 NumBytesForCalleeToPop = 0; // Callee pops nothing.
3551 // Returns a flag for retval copy to use.
3553 Chain = DAG.getCALLSEQ_END(Chain,
3554 DAG.getIntPtrConstant(NumBytesToPop, dl, true),
3555 DAG.getIntPtrConstant(NumBytesForCalleeToPop, dl,
3558 InFlag = Chain.getValue(1);
3561 // Handle result values, copying them out of physregs into vregs that we
3563 return LowerCallResult(Chain, InFlag, CallConv, isVarArg,
3564 Ins, dl, DAG, InVals);
3567 //===----------------------------------------------------------------------===//
3568 // Fast Calling Convention (tail call) implementation
3569 //===----------------------------------------------------------------------===//
3571 // Like std call, callee cleans arguments, convention except that ECX is
3572 // reserved for storing the tail called function address. Only 2 registers are
3573 // free for argument passing (inreg). Tail call optimization is performed
3575 // * tailcallopt is enabled
3576 // * caller/callee are fastcc
3577 // On X86_64 architecture with GOT-style position independent code only local
3578 // (within module) calls are supported at the moment.
3579 // To keep the stack aligned according to platform abi the function
3580 // GetAlignedArgumentStackSize ensures that argument delta is always multiples
3581 // of stack alignment. (Dynamic linkers need this - darwin's dyld for example)
3582 // If a tail called function callee has more arguments than the caller the
3583 // caller needs to make sure that there is room to move the RETADDR to. This is
3584 // achieved by reserving an area the size of the argument delta right after the
3585 // original RETADDR, but before the saved framepointer or the spilled registers
3586 // e.g. caller(arg1, arg2) calls callee(arg1, arg2,arg3,arg4)
3598 /// Make the stack size align e.g 16n + 12 aligned for a 16-byte align
3601 X86TargetLowering::GetAlignedArgumentStackSize(unsigned StackSize,
3602 SelectionDAG& DAG) const {
3603 const X86RegisterInfo *RegInfo = Subtarget->getRegisterInfo();
3604 const TargetFrameLowering &TFI = *Subtarget->getFrameLowering();
3605 unsigned StackAlignment = TFI.getStackAlignment();
3606 uint64_t AlignMask = StackAlignment - 1;
3607 int64_t Offset = StackSize;
3608 unsigned SlotSize = RegInfo->getSlotSize();
3609 if ( (Offset & AlignMask) <= (StackAlignment - SlotSize) ) {
3610 // Number smaller than 12 so just add the difference.
3611 Offset += ((StackAlignment - SlotSize) - (Offset & AlignMask));
3613 // Mask out lower bits, add stackalignment once plus the 12 bytes.
3614 Offset = ((~AlignMask) & Offset) + StackAlignment +
3615 (StackAlignment-SlotSize);
3620 /// Return true if the given stack call argument is already available in the
3621 /// same position (relatively) of the caller's incoming argument stack.
3623 bool MatchingStackOffset(SDValue Arg, unsigned Offset, ISD::ArgFlagsTy Flags,
3624 MachineFrameInfo *MFI, const MachineRegisterInfo *MRI,
3625 const X86InstrInfo *TII) {
3626 unsigned Bytes = Arg.getValueType().getSizeInBits() / 8;
3628 if (Arg.getOpcode() == ISD::CopyFromReg) {
3629 unsigned VR = cast<RegisterSDNode>(Arg.getOperand(1))->getReg();
3630 if (!TargetRegisterInfo::isVirtualRegister(VR))
3632 MachineInstr *Def = MRI->getVRegDef(VR);
3635 if (!Flags.isByVal()) {
3636 if (!TII->isLoadFromStackSlot(Def, FI))
3639 unsigned Opcode = Def->getOpcode();
3640 if ((Opcode == X86::LEA32r || Opcode == X86::LEA64r ||
3641 Opcode == X86::LEA64_32r) &&
3642 Def->getOperand(1).isFI()) {
3643 FI = Def->getOperand(1).getIndex();
3644 Bytes = Flags.getByValSize();
3648 } else if (LoadSDNode *Ld = dyn_cast<LoadSDNode>(Arg)) {
3649 if (Flags.isByVal())
3650 // ByVal argument is passed in as a pointer but it's now being
3651 // dereferenced. e.g.
3652 // define @foo(%struct.X* %A) {
3653 // tail call @bar(%struct.X* byval %A)
3656 SDValue Ptr = Ld->getBasePtr();
3657 FrameIndexSDNode *FINode = dyn_cast<FrameIndexSDNode>(Ptr);
3660 FI = FINode->getIndex();
3661 } else if (Arg.getOpcode() == ISD::FrameIndex && Flags.isByVal()) {
3662 FrameIndexSDNode *FINode = cast<FrameIndexSDNode>(Arg);
3663 FI = FINode->getIndex();
3664 Bytes = Flags.getByValSize();
3668 assert(FI != INT_MAX);
3669 if (!MFI->isFixedObjectIndex(FI))
3671 return Offset == MFI->getObjectOffset(FI) && Bytes == MFI->getObjectSize(FI);
3674 /// Check whether the call is eligible for tail call optimization. Targets
3675 /// that want to do tail call optimization should implement this function.
3676 bool X86TargetLowering::IsEligibleForTailCallOptimization(
3677 SDValue Callee, CallingConv::ID CalleeCC, bool isVarArg,
3678 bool isCalleeStructRet, bool isCallerStructRet, Type *RetTy,
3679 const SmallVectorImpl<ISD::OutputArg> &Outs,
3680 const SmallVectorImpl<SDValue> &OutVals,
3681 const SmallVectorImpl<ISD::InputArg> &Ins, SelectionDAG &DAG) const {
3682 if (!mayTailCallThisCC(CalleeCC))
3685 // If -tailcallopt is specified, make fastcc functions tail-callable.
3686 MachineFunction &MF = DAG.getMachineFunction();
3687 const Function *CallerF = MF.getFunction();
3689 // If the function return type is x86_fp80 and the callee return type is not,
3690 // then the FP_EXTEND of the call result is not a nop. It's not safe to
3691 // perform a tailcall optimization here.
3692 if (CallerF->getReturnType()->isX86_FP80Ty() && !RetTy->isX86_FP80Ty())
3695 CallingConv::ID CallerCC = CallerF->getCallingConv();
3696 bool CCMatch = CallerCC == CalleeCC;
3697 bool IsCalleeWin64 = Subtarget->isCallingConvWin64(CalleeCC);
3698 bool IsCallerWin64 = Subtarget->isCallingConvWin64(CallerCC);
3700 // Win64 functions have extra shadow space for argument homing. Don't do the
3701 // sibcall if the caller and callee have mismatched expectations for this
3703 if (IsCalleeWin64 != IsCallerWin64)
3706 if (DAG.getTarget().Options.GuaranteedTailCallOpt) {
3707 if (canGuaranteeTCO(CalleeCC) && CCMatch)
3712 // Look for obvious safe cases to perform tail call optimization that do not
3713 // require ABI changes. This is what gcc calls sibcall.
3715 // Can't do sibcall if stack needs to be dynamically re-aligned. PEI needs to
3716 // emit a special epilogue.
3717 const X86RegisterInfo *RegInfo = Subtarget->getRegisterInfo();
3718 if (RegInfo->needsStackRealignment(MF))
3721 // Also avoid sibcall optimization if either caller or callee uses struct
3722 // return semantics.
3723 if (isCalleeStructRet || isCallerStructRet)
3726 // Do not sibcall optimize vararg calls unless all arguments are passed via
3728 if (isVarArg && !Outs.empty()) {
3729 // Optimizing for varargs on Win64 is unlikely to be safe without
3730 // additional testing.
3731 if (IsCalleeWin64 || IsCallerWin64)
3734 SmallVector<CCValAssign, 16> ArgLocs;
3735 CCState CCInfo(CalleeCC, isVarArg, DAG.getMachineFunction(), ArgLocs,
3738 CCInfo.AnalyzeCallOperands(Outs, CC_X86);
3739 for (unsigned i = 0, e = ArgLocs.size(); i != e; ++i)
3740 if (!ArgLocs[i].isRegLoc())
3744 // If the call result is in ST0 / ST1, it needs to be popped off the x87
3745 // stack. Therefore, if it's not used by the call it is not safe to optimize
3746 // this into a sibcall.
3747 bool Unused = false;
3748 for (unsigned i = 0, e = Ins.size(); i != e; ++i) {
3755 SmallVector<CCValAssign, 16> RVLocs;
3756 CCState CCInfo(CalleeCC, false, DAG.getMachineFunction(), RVLocs,
3758 CCInfo.AnalyzeCallResult(Ins, RetCC_X86);
3759 for (unsigned i = 0, e = RVLocs.size(); i != e; ++i) {
3760 CCValAssign &VA = RVLocs[i];
3761 if (VA.getLocReg() == X86::FP0 || VA.getLocReg() == X86::FP1)
3766 // If the calling conventions do not match, then we'd better make sure the
3767 // results are returned in the same way as what the caller expects.
3769 SmallVector<CCValAssign, 16> RVLocs1;
3770 CCState CCInfo1(CalleeCC, false, DAG.getMachineFunction(), RVLocs1,
3772 CCInfo1.AnalyzeCallResult(Ins, RetCC_X86);
3774 SmallVector<CCValAssign, 16> RVLocs2;
3775 CCState CCInfo2(CallerCC, false, DAG.getMachineFunction(), RVLocs2,
3777 CCInfo2.AnalyzeCallResult(Ins, RetCC_X86);
3779 if (RVLocs1.size() != RVLocs2.size())
3781 for (unsigned i = 0, e = RVLocs1.size(); i != e; ++i) {
3782 if (RVLocs1[i].isRegLoc() != RVLocs2[i].isRegLoc())
3784 if (RVLocs1[i].getLocInfo() != RVLocs2[i].getLocInfo())
3786 if (RVLocs1[i].isRegLoc()) {
3787 if (RVLocs1[i].getLocReg() != RVLocs2[i].getLocReg())
3790 if (RVLocs1[i].getLocMemOffset() != RVLocs2[i].getLocMemOffset())
3796 unsigned StackArgsSize = 0;
3798 // If the callee takes no arguments then go on to check the results of the
3800 if (!Outs.empty()) {
3801 // Check if stack adjustment is needed. For now, do not do this if any
3802 // argument is passed on the stack.
3803 SmallVector<CCValAssign, 16> ArgLocs;
3804 CCState CCInfo(CalleeCC, isVarArg, DAG.getMachineFunction(), ArgLocs,
3807 // Allocate shadow area for Win64
3809 CCInfo.AllocateStack(32, 8);
3811 CCInfo.AnalyzeCallOperands(Outs, CC_X86);
3812 StackArgsSize = CCInfo.getNextStackOffset();
3814 if (CCInfo.getNextStackOffset()) {
3815 // Check if the arguments are already laid out in the right way as
3816 // the caller's fixed stack objects.
3817 MachineFrameInfo *MFI = MF.getFrameInfo();
3818 const MachineRegisterInfo *MRI = &MF.getRegInfo();
3819 const X86InstrInfo *TII = Subtarget->getInstrInfo();
3820 for (unsigned i = 0, e = ArgLocs.size(); i != e; ++i) {
3821 CCValAssign &VA = ArgLocs[i];
3822 SDValue Arg = OutVals[i];
3823 ISD::ArgFlagsTy Flags = Outs[i].Flags;
3824 if (VA.getLocInfo() == CCValAssign::Indirect)
3826 if (!VA.isRegLoc()) {
3827 if (!MatchingStackOffset(Arg, VA.getLocMemOffset(), Flags,
3834 // If the tailcall address may be in a register, then make sure it's
3835 // possible to register allocate for it. In 32-bit, the call address can
3836 // only target EAX, EDX, or ECX since the tail call must be scheduled after
3837 // callee-saved registers are restored. These happen to be the same
3838 // registers used to pass 'inreg' arguments so watch out for those.
3839 if (!Subtarget->is64Bit() &&
3840 ((!isa<GlobalAddressSDNode>(Callee) &&
3841 !isa<ExternalSymbolSDNode>(Callee)) ||
3842 DAG.getTarget().getRelocationModel() == Reloc::PIC_)) {
3843 unsigned NumInRegs = 0;
3844 // In PIC we need an extra register to formulate the address computation
3846 unsigned MaxInRegs =
3847 (DAG.getTarget().getRelocationModel() == Reloc::PIC_) ? 2 : 3;
3849 for (unsigned i = 0, e = ArgLocs.size(); i != e; ++i) {
3850 CCValAssign &VA = ArgLocs[i];
3853 unsigned Reg = VA.getLocReg();
3856 case X86::EAX: case X86::EDX: case X86::ECX:
3857 if (++NumInRegs == MaxInRegs)
3865 bool CalleeWillPop =
3866 X86::isCalleePop(CalleeCC, Subtarget->is64Bit(), isVarArg,
3867 MF.getTarget().Options.GuaranteedTailCallOpt);
3869 if (unsigned BytesToPop =
3870 MF.getInfo<X86MachineFunctionInfo>()->getBytesToPopOnReturn()) {
3871 // If we have bytes to pop, the callee must pop them.
3872 bool CalleePopMatches = CalleeWillPop && BytesToPop == StackArgsSize;
3873 if (!CalleePopMatches)
3875 } else if (CalleeWillPop && StackArgsSize > 0) {
3876 // If we don't have bytes to pop, make sure the callee doesn't pop any.
3884 X86TargetLowering::createFastISel(FunctionLoweringInfo &funcInfo,
3885 const TargetLibraryInfo *libInfo) const {
3886 return X86::createFastISel(funcInfo, libInfo);
3889 //===----------------------------------------------------------------------===//
3890 // Other Lowering Hooks
3891 //===----------------------------------------------------------------------===//
3893 static bool MayFoldLoad(SDValue Op) {
3894 return Op.hasOneUse() && ISD::isNormalLoad(Op.getNode());
3897 static bool MayFoldIntoStore(SDValue Op) {
3898 return Op.hasOneUse() && ISD::isNormalStore(*Op.getNode()->use_begin());
3901 static bool isTargetShuffle(unsigned Opcode) {
3903 default: return false;
3904 case X86ISD::BLENDI:
3905 case X86ISD::PSHUFB:
3906 case X86ISD::PSHUFD:
3907 case X86ISD::PSHUFHW:
3908 case X86ISD::PSHUFLW:
3910 case X86ISD::PALIGNR:
3911 case X86ISD::MOVLHPS:
3912 case X86ISD::MOVLHPD:
3913 case X86ISD::MOVHLPS:
3914 case X86ISD::MOVLPS:
3915 case X86ISD::MOVLPD:
3916 case X86ISD::MOVSHDUP:
3917 case X86ISD::MOVSLDUP:
3918 case X86ISD::MOVDDUP:
3921 case X86ISD::UNPCKL:
3922 case X86ISD::UNPCKH:
3923 case X86ISD::VPERMILPI:
3924 case X86ISD::VPERM2X128:
3925 case X86ISD::VPERMI:
3926 case X86ISD::VPERMV:
3927 case X86ISD::VPERMV3:
3932 static SDValue getTargetShuffleNode(unsigned Opc, SDLoc dl, MVT VT,
3933 SDValue V1, unsigned TargetMask,
3934 SelectionDAG &DAG) {
3936 default: llvm_unreachable("Unknown x86 shuffle node");
3937 case X86ISD::PSHUFD:
3938 case X86ISD::PSHUFHW:
3939 case X86ISD::PSHUFLW:
3940 case X86ISD::VPERMILPI:
3941 case X86ISD::VPERMI:
3942 return DAG.getNode(Opc, dl, VT, V1,
3943 DAG.getConstant(TargetMask, dl, MVT::i8));
3947 static SDValue getTargetShuffleNode(unsigned Opc, SDLoc dl, MVT VT,
3948 SDValue V1, SDValue V2, SelectionDAG &DAG) {
3950 default: llvm_unreachable("Unknown x86 shuffle node");
3951 case X86ISD::MOVLHPS:
3952 case X86ISD::MOVLHPD:
3953 case X86ISD::MOVHLPS:
3954 case X86ISD::MOVLPS:
3955 case X86ISD::MOVLPD:
3958 case X86ISD::UNPCKL:
3959 case X86ISD::UNPCKH:
3960 return DAG.getNode(Opc, dl, VT, V1, V2);
3964 SDValue X86TargetLowering::getReturnAddressFrameIndex(SelectionDAG &DAG) const {
3965 MachineFunction &MF = DAG.getMachineFunction();
3966 const X86RegisterInfo *RegInfo = Subtarget->getRegisterInfo();
3967 X86MachineFunctionInfo *FuncInfo = MF.getInfo<X86MachineFunctionInfo>();
3968 int ReturnAddrIndex = FuncInfo->getRAIndex();
3970 if (ReturnAddrIndex == 0) {
3971 // Set up a frame object for the return address.
3972 unsigned SlotSize = RegInfo->getSlotSize();
3973 ReturnAddrIndex = MF.getFrameInfo()->CreateFixedObject(SlotSize,
3976 FuncInfo->setRAIndex(ReturnAddrIndex);
3979 return DAG.getFrameIndex(ReturnAddrIndex, getPointerTy(DAG.getDataLayout()));
3982 bool X86::isOffsetSuitableForCodeModel(int64_t Offset, CodeModel::Model M,
3983 bool hasSymbolicDisplacement) {
3984 // Offset should fit into 32 bit immediate field.
3985 if (!isInt<32>(Offset))
3988 // If we don't have a symbolic displacement - we don't have any extra
3990 if (!hasSymbolicDisplacement)
3993 // FIXME: Some tweaks might be needed for medium code model.
3994 if (M != CodeModel::Small && M != CodeModel::Kernel)
3997 // For small code model we assume that latest object is 16MB before end of 31
3998 // bits boundary. We may also accept pretty large negative constants knowing
3999 // that all objects are in the positive half of address space.
4000 if (M == CodeModel::Small && Offset < 16*1024*1024)
4003 // For kernel code model we know that all object resist in the negative half
4004 // of 32bits address space. We may not accept negative offsets, since they may
4005 // be just off and we may accept pretty large positive ones.
4006 if (M == CodeModel::Kernel && Offset >= 0)
4012 /// Determines whether the callee is required to pop its own arguments.
4013 /// Callee pop is necessary to support tail calls.
4014 bool X86::isCalleePop(CallingConv::ID CallingConv,
4015 bool is64Bit, bool IsVarArg, bool GuaranteeTCO) {
4016 // If GuaranteeTCO is true, we force some calls to be callee pop so that we
4017 // can guarantee TCO.
4018 if (!IsVarArg && shouldGuaranteeTCO(CallingConv, GuaranteeTCO))
4021 switch (CallingConv) {
4024 case CallingConv::X86_StdCall:
4025 case CallingConv::X86_FastCall:
4026 case CallingConv::X86_ThisCall:
4027 case CallingConv::X86_VectorCall:
4032 /// \brief Return true if the condition is an unsigned comparison operation.
4033 static bool isX86CCUnsigned(unsigned X86CC) {
4035 default: llvm_unreachable("Invalid integer condition!");
4036 case X86::COND_E: return true;
4037 case X86::COND_G: return false;
4038 case X86::COND_GE: return false;
4039 case X86::COND_L: return false;
4040 case X86::COND_LE: return false;
4041 case X86::COND_NE: return true;
4042 case X86::COND_B: return true;
4043 case X86::COND_A: return true;
4044 case X86::COND_BE: return true;
4045 case X86::COND_AE: return true;
4049 static X86::CondCode TranslateIntegerX86CC(ISD::CondCode SetCCOpcode) {
4050 switch (SetCCOpcode) {
4051 default: llvm_unreachable("Invalid integer condition!");
4052 case ISD::SETEQ: return X86::COND_E;
4053 case ISD::SETGT: return X86::COND_G;
4054 case ISD::SETGE: return X86::COND_GE;
4055 case ISD::SETLT: return X86::COND_L;
4056 case ISD::SETLE: return X86::COND_LE;
4057 case ISD::SETNE: return X86::COND_NE;
4058 case ISD::SETULT: return X86::COND_B;
4059 case ISD::SETUGT: return X86::COND_A;
4060 case ISD::SETULE: return X86::COND_BE;
4061 case ISD::SETUGE: return X86::COND_AE;
4065 /// Do a one-to-one translation of a ISD::CondCode to the X86-specific
4066 /// condition code, returning the condition code and the LHS/RHS of the
4067 /// comparison to make.
4068 static unsigned TranslateX86CC(ISD::CondCode SetCCOpcode, SDLoc DL, bool isFP,
4069 SDValue &LHS, SDValue &RHS, SelectionDAG &DAG) {
4071 if (ConstantSDNode *RHSC = dyn_cast<ConstantSDNode>(RHS)) {
4072 if (SetCCOpcode == ISD::SETGT && RHSC->isAllOnesValue()) {
4073 // X > -1 -> X == 0, jump !sign.
4074 RHS = DAG.getConstant(0, DL, RHS.getValueType());
4075 return X86::COND_NS;
4077 if (SetCCOpcode == ISD::SETLT && RHSC->isNullValue()) {
4078 // X < 0 -> X == 0, jump on sign.
4081 if (SetCCOpcode == ISD::SETLT && RHSC->getZExtValue() == 1) {
4083 RHS = DAG.getConstant(0, DL, RHS.getValueType());
4084 return X86::COND_LE;
4088 return TranslateIntegerX86CC(SetCCOpcode);
4091 // First determine if it is required or is profitable to flip the operands.
4093 // If LHS is a foldable load, but RHS is not, flip the condition.
4094 if (ISD::isNON_EXTLoad(LHS.getNode()) &&
4095 !ISD::isNON_EXTLoad(RHS.getNode())) {
4096 SetCCOpcode = getSetCCSwappedOperands(SetCCOpcode);
4097 std::swap(LHS, RHS);
4100 switch (SetCCOpcode) {
4106 std::swap(LHS, RHS);
4110 // On a floating point condition, the flags are set as follows:
4112 // 0 | 0 | 0 | X > Y
4113 // 0 | 0 | 1 | X < Y
4114 // 1 | 0 | 0 | X == Y
4115 // 1 | 1 | 1 | unordered
4116 switch (SetCCOpcode) {
4117 default: llvm_unreachable("Condcode should be pre-legalized away");
4119 case ISD::SETEQ: return X86::COND_E;
4120 case ISD::SETOLT: // flipped
4122 case ISD::SETGT: return X86::COND_A;
4123 case ISD::SETOLE: // flipped
4125 case ISD::SETGE: return X86::COND_AE;
4126 case ISD::SETUGT: // flipped
4128 case ISD::SETLT: return X86::COND_B;
4129 case ISD::SETUGE: // flipped
4131 case ISD::SETLE: return X86::COND_BE;
4133 case ISD::SETNE: return X86::COND_NE;
4134 case ISD::SETUO: return X86::COND_P;
4135 case ISD::SETO: return X86::COND_NP;
4137 case ISD::SETUNE: return X86::COND_INVALID;
4141 /// Is there a floating point cmov for the specific X86 condition code?
4142 /// Current x86 isa includes the following FP cmov instructions:
4143 /// fcmovb, fcomvbe, fcomve, fcmovu, fcmovae, fcmova, fcmovne, fcmovnu.
4144 static bool hasFPCMov(unsigned X86CC) {
4160 /// Returns true if the target can instruction select the
4161 /// specified FP immediate natively. If false, the legalizer will
4162 /// materialize the FP immediate as a load from a constant pool.
4163 bool X86TargetLowering::isFPImmLegal(const APFloat &Imm, EVT VT) const {
4164 for (unsigned i = 0, e = LegalFPImmediates.size(); i != e; ++i) {
4165 if (Imm.bitwiseIsEqual(LegalFPImmediates[i]))
4171 bool X86TargetLowering::shouldReduceLoadWidth(SDNode *Load,
4172 ISD::LoadExtType ExtTy,
4174 // "ELF Handling for Thread-Local Storage" specifies that R_X86_64_GOTTPOFF
4175 // relocation target a movq or addq instruction: don't let the load shrink.
4176 SDValue BasePtr = cast<LoadSDNode>(Load)->getBasePtr();
4177 if (BasePtr.getOpcode() == X86ISD::WrapperRIP)
4178 if (const auto *GA = dyn_cast<GlobalAddressSDNode>(BasePtr.getOperand(0)))
4179 return GA->getTargetFlags() != X86II::MO_GOTTPOFF;
4183 /// \brief Returns true if it is beneficial to convert a load of a constant
4184 /// to just the constant itself.
4185 bool X86TargetLowering::shouldConvertConstantLoadToIntImm(const APInt &Imm,
4187 assert(Ty->isIntegerTy());
4189 unsigned BitSize = Ty->getPrimitiveSizeInBits();
4190 if (BitSize == 0 || BitSize > 64)
4195 bool X86TargetLowering::isExtractSubvectorCheap(EVT ResVT,
4196 unsigned Index) const {
4197 if (!isOperationLegalOrCustom(ISD::EXTRACT_SUBVECTOR, ResVT))
4200 return (Index == 0 || Index == ResVT.getVectorNumElements());
4203 bool X86TargetLowering::isCheapToSpeculateCttz() const {
4204 // Speculate cttz only if we can directly use TZCNT.
4205 return Subtarget->hasBMI();
4208 bool X86TargetLowering::isCheapToSpeculateCtlz() const {
4209 // Speculate ctlz only if we can directly use LZCNT.
4210 return Subtarget->hasLZCNT();
4213 /// Return true if every element in Mask, beginning
4214 /// from position Pos and ending in Pos+Size is undef.
4215 static bool isUndefInRange(ArrayRef<int> Mask, unsigned Pos, unsigned Size) {
4216 for (unsigned i = Pos, e = Pos + Size; i != e; ++i)
4222 /// Return true if Val is undef or if its value falls within the
4223 /// specified range (L, H].
4224 static bool isUndefOrInRange(int Val, int Low, int Hi) {
4225 return (Val < 0) || (Val >= Low && Val < Hi);
4228 /// Val is either less than zero (undef) or equal to the specified value.
4229 static bool isUndefOrEqual(int Val, int CmpVal) {
4230 return (Val < 0 || Val == CmpVal);
4233 /// Return true if every element in Mask, beginning
4234 /// from position Pos and ending in Pos+Size, falls within the specified
4235 /// sequential range (Low, Low+Size]. or is undef.
4236 static bool isSequentialOrUndefInRange(ArrayRef<int> Mask,
4237 unsigned Pos, unsigned Size, int Low) {
4238 for (unsigned i = Pos, e = Pos+Size; i != e; ++i, ++Low)
4239 if (!isUndefOrEqual(Mask[i], Low))
4244 /// Return true if the specified EXTRACT_SUBVECTOR operand specifies a vector
4245 /// extract that is suitable for instruction that extract 128 or 256 bit vectors
4246 static bool isVEXTRACTIndex(SDNode *N, unsigned vecWidth) {
4247 assert((vecWidth == 128 || vecWidth == 256) && "Unexpected vector width");
4248 if (!isa<ConstantSDNode>(N->getOperand(1).getNode()))
4251 // The index should be aligned on a vecWidth-bit boundary.
4253 cast<ConstantSDNode>(N->getOperand(1).getNode())->getZExtValue();
4255 MVT VT = N->getSimpleValueType(0);
4256 unsigned ElSize = VT.getVectorElementType().getSizeInBits();
4257 bool Result = (Index * ElSize) % vecWidth == 0;
4262 /// Return true if the specified INSERT_SUBVECTOR
4263 /// operand specifies a subvector insert that is suitable for input to
4264 /// insertion of 128 or 256-bit subvectors
4265 static bool isVINSERTIndex(SDNode *N, unsigned vecWidth) {
4266 assert((vecWidth == 128 || vecWidth == 256) && "Unexpected vector width");
4267 if (!isa<ConstantSDNode>(N->getOperand(2).getNode()))
4269 // The index should be aligned on a vecWidth-bit boundary.
4271 cast<ConstantSDNode>(N->getOperand(2).getNode())->getZExtValue();
4273 MVT VT = N->getSimpleValueType(0);
4274 unsigned ElSize = VT.getVectorElementType().getSizeInBits();
4275 bool Result = (Index * ElSize) % vecWidth == 0;
4280 bool X86::isVINSERT128Index(SDNode *N) {
4281 return isVINSERTIndex(N, 128);
4284 bool X86::isVINSERT256Index(SDNode *N) {
4285 return isVINSERTIndex(N, 256);
4288 bool X86::isVEXTRACT128Index(SDNode *N) {
4289 return isVEXTRACTIndex(N, 128);
4292 bool X86::isVEXTRACT256Index(SDNode *N) {
4293 return isVEXTRACTIndex(N, 256);
4296 static unsigned getExtractVEXTRACTImmediate(SDNode *N, unsigned vecWidth) {
4297 assert((vecWidth == 128 || vecWidth == 256) && "Unsupported vector width");
4298 assert(isa<ConstantSDNode>(N->getOperand(1).getNode()) &&
4299 "Illegal extract subvector for VEXTRACT");
4302 cast<ConstantSDNode>(N->getOperand(1).getNode())->getZExtValue();
4304 MVT VecVT = N->getOperand(0).getSimpleValueType();
4305 MVT ElVT = VecVT.getVectorElementType();
4307 unsigned NumElemsPerChunk = vecWidth / ElVT.getSizeInBits();
4308 return Index / NumElemsPerChunk;
4311 static unsigned getInsertVINSERTImmediate(SDNode *N, unsigned vecWidth) {
4312 assert((vecWidth == 128 || vecWidth == 256) && "Unsupported vector width");
4313 assert(isa<ConstantSDNode>(N->getOperand(2).getNode()) &&
4314 "Illegal insert subvector for VINSERT");
4317 cast<ConstantSDNode>(N->getOperand(2).getNode())->getZExtValue();
4319 MVT VecVT = N->getSimpleValueType(0);
4320 MVT ElVT = VecVT.getVectorElementType();
4322 unsigned NumElemsPerChunk = vecWidth / ElVT.getSizeInBits();
4323 return Index / NumElemsPerChunk;
4326 /// Return the appropriate immediate to extract the specified
4327 /// EXTRACT_SUBVECTOR index with VEXTRACTF128 and VINSERTI128 instructions.
4328 unsigned X86::getExtractVEXTRACT128Immediate(SDNode *N) {
4329 return getExtractVEXTRACTImmediate(N, 128);
4332 /// Return the appropriate immediate to extract the specified
4333 /// EXTRACT_SUBVECTOR index with VEXTRACTF64x4 and VINSERTI64x4 instructions.
4334 unsigned X86::getExtractVEXTRACT256Immediate(SDNode *N) {
4335 return getExtractVEXTRACTImmediate(N, 256);
4338 /// Return the appropriate immediate to insert at the specified
4339 /// INSERT_SUBVECTOR index with VINSERTF128 and VINSERTI128 instructions.
4340 unsigned X86::getInsertVINSERT128Immediate(SDNode *N) {
4341 return getInsertVINSERTImmediate(N, 128);
4344 /// Return the appropriate immediate to insert at the specified
4345 /// INSERT_SUBVECTOR index with VINSERTF46x4 and VINSERTI64x4 instructions.
4346 unsigned X86::getInsertVINSERT256Immediate(SDNode *N) {
4347 return getInsertVINSERTImmediate(N, 256);
4350 /// Returns true if Elt is a constant zero or a floating point constant +0.0.
4351 bool X86::isZeroNode(SDValue Elt) {
4352 return isNullConstant(Elt) || isNullFPConstant(Elt);
4355 // Build a vector of constants
4356 // Use an UNDEF node if MaskElt == -1.
4357 // Spilt 64-bit constants in the 32-bit mode.
4358 static SDValue getConstVector(ArrayRef<int> Values, MVT VT,
4360 SDLoc dl, bool IsMask = false) {
4362 SmallVector<SDValue, 32> Ops;
4365 MVT ConstVecVT = VT;
4366 unsigned NumElts = VT.getVectorNumElements();
4367 bool In64BitMode = DAG.getTargetLoweringInfo().isTypeLegal(MVT::i64);
4368 if (!In64BitMode && VT.getVectorElementType() == MVT::i64) {
4369 ConstVecVT = MVT::getVectorVT(MVT::i32, NumElts * 2);
4373 MVT EltVT = ConstVecVT.getVectorElementType();
4374 for (unsigned i = 0; i < NumElts; ++i) {
4375 bool IsUndef = Values[i] < 0 && IsMask;
4376 SDValue OpNode = IsUndef ? DAG.getUNDEF(EltVT) :
4377 DAG.getConstant(Values[i], dl, EltVT);
4378 Ops.push_back(OpNode);
4380 Ops.push_back(IsUndef ? DAG.getUNDEF(EltVT) :
4381 DAG.getConstant(0, dl, EltVT));
4383 SDValue ConstsNode = DAG.getNode(ISD::BUILD_VECTOR, dl, ConstVecVT, Ops);
4385 ConstsNode = DAG.getBitcast(VT, ConstsNode);
4389 /// Returns a vector of specified type with all zero elements.
4390 static SDValue getZeroVector(MVT VT, const X86Subtarget *Subtarget,
4391 SelectionDAG &DAG, SDLoc dl) {
4392 assert(VT.isVector() && "Expected a vector type");
4394 // Always build SSE zero vectors as <4 x i32> bitcasted
4395 // to their dest type. This ensures they get CSE'd.
4397 if (VT.is128BitVector()) { // SSE
4398 if (Subtarget->hasSSE2()) { // SSE2
4399 SDValue Cst = DAG.getConstant(0, dl, MVT::i32);
4400 Vec = DAG.getNode(ISD::BUILD_VECTOR, dl, MVT::v4i32, Cst, Cst, Cst, Cst);
4402 SDValue Cst = DAG.getConstantFP(+0.0, dl, MVT::f32);
4403 Vec = DAG.getNode(ISD::BUILD_VECTOR, dl, MVT::v4f32, Cst, Cst, Cst, Cst);
4405 } else if (VT.is256BitVector()) { // AVX
4406 if (Subtarget->hasInt256()) { // AVX2
4407 SDValue Cst = DAG.getConstant(0, dl, MVT::i32);
4408 SDValue Ops[] = { Cst, Cst, Cst, Cst, Cst, Cst, Cst, Cst };
4409 Vec = DAG.getNode(ISD::BUILD_VECTOR, dl, MVT::v8i32, Ops);
4411 // 256-bit logic and arithmetic instructions in AVX are all
4412 // floating-point, no support for integer ops. Emit fp zeroed vectors.
4413 SDValue Cst = DAG.getConstantFP(+0.0, dl, MVT::f32);
4414 SDValue Ops[] = { Cst, Cst, Cst, Cst, Cst, Cst, Cst, Cst };
4415 Vec = DAG.getNode(ISD::BUILD_VECTOR, dl, MVT::v8f32, Ops);
4417 } else if (VT.is512BitVector()) { // AVX-512
4418 SDValue Cst = DAG.getConstant(0, dl, MVT::i32);
4419 SDValue Ops[] = { Cst, Cst, Cst, Cst, Cst, Cst, Cst, Cst,
4420 Cst, Cst, Cst, Cst, Cst, Cst, Cst, Cst };
4421 Vec = DAG.getNode(ISD::BUILD_VECTOR, dl, MVT::v16i32, Ops);
4422 } else if (VT.getVectorElementType() == MVT::i1) {
4424 assert((Subtarget->hasBWI() || VT.getVectorNumElements() <= 16)
4425 && "Unexpected vector type");
4426 assert((Subtarget->hasVLX() || VT.getVectorNumElements() >= 8)
4427 && "Unexpected vector type");
4428 SDValue Cst = DAG.getConstant(0, dl, MVT::i1);
4429 SmallVector<SDValue, 64> Ops(VT.getVectorNumElements(), Cst);
4430 return DAG.getNode(ISD::BUILD_VECTOR, dl, VT, Ops);
4432 llvm_unreachable("Unexpected vector type");
4434 return DAG.getBitcast(VT, Vec);
4437 static SDValue ExtractSubVector(SDValue Vec, unsigned IdxVal,
4438 SelectionDAG &DAG, SDLoc dl,
4439 unsigned vectorWidth) {
4440 assert((vectorWidth == 128 || vectorWidth == 256) &&
4441 "Unsupported vector width");
4442 EVT VT = Vec.getValueType();
4443 EVT ElVT = VT.getVectorElementType();
4444 unsigned Factor = VT.getSizeInBits()/vectorWidth;
4445 EVT ResultVT = EVT::getVectorVT(*DAG.getContext(), ElVT,
4446 VT.getVectorNumElements()/Factor);
4448 // Extract from UNDEF is UNDEF.
4449 if (Vec.getOpcode() == ISD::UNDEF)
4450 return DAG.getUNDEF(ResultVT);
4452 // Extract the relevant vectorWidth bits. Generate an EXTRACT_SUBVECTOR
4453 unsigned ElemsPerChunk = vectorWidth / ElVT.getSizeInBits();
4454 assert(isPowerOf2_32(ElemsPerChunk) && "Elements per chunk not power of 2");
4456 // This is the index of the first element of the vectorWidth-bit chunk
4457 // we want. Since ElemsPerChunk is a power of 2 just need to clear bits.
4458 IdxVal &= ~(ElemsPerChunk - 1);
4460 // If the input is a buildvector just emit a smaller one.
4461 if (Vec.getOpcode() == ISD::BUILD_VECTOR)
4462 return DAG.getNode(ISD::BUILD_VECTOR, dl, ResultVT,
4463 makeArrayRef(Vec->op_begin() + IdxVal, ElemsPerChunk));
4465 SDValue VecIdx = DAG.getIntPtrConstant(IdxVal, dl);
4466 return DAG.getNode(ISD::EXTRACT_SUBVECTOR, dl, ResultVT, Vec, VecIdx);
4469 /// Generate a DAG to grab 128-bits from a vector > 128 bits. This
4470 /// sets things up to match to an AVX VEXTRACTF128 / VEXTRACTI128
4471 /// or AVX-512 VEXTRACTF32x4 / VEXTRACTI32x4
4472 /// instructions or a simple subregister reference. Idx is an index in the
4473 /// 128 bits we want. It need not be aligned to a 128-bit boundary. That makes
4474 /// lowering EXTRACT_VECTOR_ELT operations easier.
4475 static SDValue Extract128BitVector(SDValue Vec, unsigned IdxVal,
4476 SelectionDAG &DAG, SDLoc dl) {
4477 assert((Vec.getValueType().is256BitVector() ||
4478 Vec.getValueType().is512BitVector()) && "Unexpected vector size!");
4479 return ExtractSubVector(Vec, IdxVal, DAG, dl, 128);
4482 /// Generate a DAG to grab 256-bits from a 512-bit vector.
4483 static SDValue Extract256BitVector(SDValue Vec, unsigned IdxVal,
4484 SelectionDAG &DAG, SDLoc dl) {
4485 assert(Vec.getValueType().is512BitVector() && "Unexpected vector size!");
4486 return ExtractSubVector(Vec, IdxVal, DAG, dl, 256);
4489 static SDValue InsertSubVector(SDValue Result, SDValue Vec,
4490 unsigned IdxVal, SelectionDAG &DAG,
4491 SDLoc dl, unsigned vectorWidth) {
4492 assert((vectorWidth == 128 || vectorWidth == 256) &&
4493 "Unsupported vector width");
4494 // Inserting UNDEF is Result
4495 if (Vec.getOpcode() == ISD::UNDEF)
4497 EVT VT = Vec.getValueType();
4498 EVT ElVT = VT.getVectorElementType();
4499 EVT ResultVT = Result.getValueType();
4501 // Insert the relevant vectorWidth bits.
4502 unsigned ElemsPerChunk = vectorWidth/ElVT.getSizeInBits();
4503 assert(isPowerOf2_32(ElemsPerChunk) && "Elements per chunk not power of 2");
4505 // This is the index of the first element of the vectorWidth-bit chunk
4506 // we want. Since ElemsPerChunk is a power of 2 just need to clear bits.
4507 IdxVal &= ~(ElemsPerChunk - 1);
4509 SDValue VecIdx = DAG.getIntPtrConstant(IdxVal, dl);
4510 return DAG.getNode(ISD::INSERT_SUBVECTOR, dl, ResultVT, Result, Vec, VecIdx);
4513 /// Generate a DAG to put 128-bits into a vector > 128 bits. This
4514 /// sets things up to match to an AVX VINSERTF128/VINSERTI128 or
4515 /// AVX-512 VINSERTF32x4/VINSERTI32x4 instructions or a
4516 /// simple superregister reference. Idx is an index in the 128 bits
4517 /// we want. It need not be aligned to a 128-bit boundary. That makes
4518 /// lowering INSERT_VECTOR_ELT operations easier.
4519 static SDValue Insert128BitVector(SDValue Result, SDValue Vec, unsigned IdxVal,
4520 SelectionDAG &DAG, SDLoc dl) {
4521 assert(Vec.getValueType().is128BitVector() && "Unexpected vector size!");
4523 // For insertion into the zero index (low half) of a 256-bit vector, it is
4524 // more efficient to generate a blend with immediate instead of an insert*128.
4525 // We are still creating an INSERT_SUBVECTOR below with an undef node to
4526 // extend the subvector to the size of the result vector. Make sure that
4527 // we are not recursing on that node by checking for undef here.
4528 if (IdxVal == 0 && Result.getValueType().is256BitVector() &&
4529 Result.getOpcode() != ISD::UNDEF) {
4530 EVT ResultVT = Result.getValueType();
4531 SDValue ZeroIndex = DAG.getIntPtrConstant(0, dl);
4532 SDValue Undef = DAG.getUNDEF(ResultVT);
4533 SDValue Vec256 = DAG.getNode(ISD::INSERT_SUBVECTOR, dl, ResultVT, Undef,
4536 // The blend instruction, and therefore its mask, depend on the data type.
4537 MVT ScalarType = ResultVT.getVectorElementType().getSimpleVT();
4538 if (ScalarType.isFloatingPoint()) {
4539 // Choose either vblendps (float) or vblendpd (double).
4540 unsigned ScalarSize = ScalarType.getSizeInBits();
4541 assert((ScalarSize == 64 || ScalarSize == 32) && "Unknown float type");
4542 unsigned MaskVal = (ScalarSize == 64) ? 0x03 : 0x0f;
4543 SDValue Mask = DAG.getConstant(MaskVal, dl, MVT::i8);
4544 return DAG.getNode(X86ISD::BLENDI, dl, ResultVT, Result, Vec256, Mask);
4547 const X86Subtarget &Subtarget =
4548 static_cast<const X86Subtarget &>(DAG.getSubtarget());
4550 // AVX2 is needed for 256-bit integer blend support.
4551 // Integers must be cast to 32-bit because there is only vpblendd;
4552 // vpblendw can't be used for this because it has a handicapped mask.
4554 // If we don't have AVX2, then cast to float. Using a wrong domain blend
4555 // is still more efficient than using the wrong domain vinsertf128 that
4556 // will be created by InsertSubVector().
4557 MVT CastVT = Subtarget.hasAVX2() ? MVT::v8i32 : MVT::v8f32;
4559 SDValue Mask = DAG.getConstant(0x0f, dl, MVT::i8);
4560 Result = DAG.getBitcast(CastVT, Result);
4561 Vec256 = DAG.getBitcast(CastVT, Vec256);
4562 Vec256 = DAG.getNode(X86ISD::BLENDI, dl, CastVT, Result, Vec256, Mask);
4563 return DAG.getBitcast(ResultVT, Vec256);
4566 return InsertSubVector(Result, Vec, IdxVal, DAG, dl, 128);
4569 static SDValue Insert256BitVector(SDValue Result, SDValue Vec, unsigned IdxVal,
4570 SelectionDAG &DAG, SDLoc dl) {
4571 assert(Vec.getValueType().is256BitVector() && "Unexpected vector size!");
4572 return InsertSubVector(Result, Vec, IdxVal, DAG, dl, 256);
4575 /// Insert i1-subvector to i1-vector.
4576 static SDValue Insert1BitVector(SDValue Op, SelectionDAG &DAG) {
4579 SDValue Vec = Op.getOperand(0);
4580 SDValue SubVec = Op.getOperand(1);
4581 SDValue Idx = Op.getOperand(2);
4583 if (!isa<ConstantSDNode>(Idx))
4586 unsigned IdxVal = cast<ConstantSDNode>(Idx)->getZExtValue();
4587 if (IdxVal == 0 && Vec.isUndef()) // the operation is legal
4590 MVT OpVT = Op.getSimpleValueType();
4591 MVT SubVecVT = SubVec.getSimpleValueType();
4592 unsigned NumElems = OpVT.getVectorNumElements();
4593 unsigned SubVecNumElems = SubVecVT.getVectorNumElements();
4595 assert(IdxVal + SubVecNumElems <= NumElems &&
4596 IdxVal % SubVecVT.getSizeInBits() == 0 &&
4597 "Unexpected index value in INSERT_SUBVECTOR");
4599 // There are 3 possible cases:
4600 // 1. Subvector should be inserted in the lower part (IdxVal == 0)
4601 // 2. Subvector should be inserted in the upper part
4602 // (IdxVal + SubVecNumElems == NumElems)
4603 // 3. Subvector should be inserted in the middle (for example v2i1
4604 // to v16i1, index 2)
4606 SDValue ZeroIdx = DAG.getIntPtrConstant(0, dl);
4607 SDValue Undef = DAG.getUNDEF(OpVT);
4608 SDValue WideSubVec =
4609 DAG.getNode(ISD::INSERT_SUBVECTOR, dl, OpVT, Undef, SubVec, ZeroIdx);
4611 return DAG.getNode(X86ISD::VSHLI, dl, OpVT, WideSubVec,
4612 DAG.getConstant(IdxVal, dl, MVT::i8));
4614 if (ISD::isBuildVectorAllZeros(Vec.getNode())) {
4615 unsigned ShiftLeft = NumElems - SubVecNumElems;
4616 unsigned ShiftRight = NumElems - SubVecNumElems - IdxVal;
4617 WideSubVec = DAG.getNode(X86ISD::VSHLI, dl, OpVT, WideSubVec,
4618 DAG.getConstant(ShiftLeft, dl, MVT::i8));
4619 return ShiftRight ? DAG.getNode(X86ISD::VSRLI, dl, OpVT, WideSubVec,
4620 DAG.getConstant(ShiftRight, dl, MVT::i8)) : WideSubVec;
4624 // Zero lower bits of the Vec
4625 SDValue ShiftBits = DAG.getConstant(SubVecNumElems, dl, MVT::i8);
4626 Vec = DAG.getNode(X86ISD::VSRLI, dl, OpVT, Vec, ShiftBits);
4627 Vec = DAG.getNode(X86ISD::VSHLI, dl, OpVT, Vec, ShiftBits);
4628 // Merge them together
4629 return DAG.getNode(ISD::OR, dl, OpVT, Vec, WideSubVec);
4632 // Simple case when we put subvector in the upper part
4633 if (IdxVal + SubVecNumElems == NumElems) {
4634 // Zero upper bits of the Vec
4635 WideSubVec = DAG.getNode(X86ISD::VSHLI, dl, OpVT, Vec,
4636 DAG.getConstant(IdxVal, dl, MVT::i8));
4637 SDValue ShiftBits = DAG.getConstant(SubVecNumElems, dl, MVT::i8);
4638 Vec = DAG.getNode(X86ISD::VSHLI, dl, OpVT, Vec, ShiftBits);
4639 Vec = DAG.getNode(X86ISD::VSRLI, dl, OpVT, Vec, ShiftBits);
4640 return DAG.getNode(ISD::OR, dl, OpVT, Vec, WideSubVec);
4642 // Subvector should be inserted in the middle - use shuffle
4643 SmallVector<int, 64> Mask;
4644 for (unsigned i = 0; i < NumElems; ++i)
4645 Mask.push_back(i >= IdxVal && i < IdxVal + SubVecNumElems ?
4647 return DAG.getVectorShuffle(OpVT, dl, WideSubVec, Vec, Mask);
4650 /// Concat two 128-bit vectors into a 256 bit vector using VINSERTF128
4651 /// instructions. This is used because creating CONCAT_VECTOR nodes of
4652 /// BUILD_VECTORS returns a larger BUILD_VECTOR while we're trying to lower
4653 /// large BUILD_VECTORS.
4654 static SDValue Concat128BitVectors(SDValue V1, SDValue V2, EVT VT,
4655 unsigned NumElems, SelectionDAG &DAG,
4657 SDValue V = Insert128BitVector(DAG.getUNDEF(VT), V1, 0, DAG, dl);
4658 return Insert128BitVector(V, V2, NumElems/2, DAG, dl);
4661 static SDValue Concat256BitVectors(SDValue V1, SDValue V2, EVT VT,
4662 unsigned NumElems, SelectionDAG &DAG,
4664 SDValue V = Insert256BitVector(DAG.getUNDEF(VT), V1, 0, DAG, dl);
4665 return Insert256BitVector(V, V2, NumElems/2, DAG, dl);
4668 /// Returns a vector of specified type with all bits set.
4669 /// Always build ones vectors as <4 x i32> or <8 x i32>. For 256-bit types with
4670 /// no AVX2 supprt, use two <4 x i32> inserted in a <8 x i32> appropriately.
4671 /// Then bitcast to their original type, ensuring they get CSE'd.
4672 static SDValue getOnesVector(EVT VT, const X86Subtarget *Subtarget,
4673 SelectionDAG &DAG, SDLoc dl) {
4674 assert(VT.isVector() && "Expected a vector type");
4676 SDValue Cst = DAG.getConstant(~0U, dl, MVT::i32);
4678 if (VT.is512BitVector()) {
4679 SDValue Ops[] = { Cst, Cst, Cst, Cst, Cst, Cst, Cst, Cst,
4680 Cst, Cst, Cst, Cst, Cst, Cst, Cst, Cst };
4681 Vec = DAG.getNode(ISD::BUILD_VECTOR, dl, MVT::v16i32, Ops);
4682 } else if (VT.is256BitVector()) {
4683 if (Subtarget->hasInt256()) { // AVX2
4684 SDValue Ops[] = { Cst, Cst, Cst, Cst, Cst, Cst, Cst, Cst };
4685 Vec = DAG.getNode(ISD::BUILD_VECTOR, dl, MVT::v8i32, Ops);
4687 Vec = DAG.getNode(ISD::BUILD_VECTOR, dl, MVT::v4i32, Cst, Cst, Cst, Cst);
4688 Vec = Concat128BitVectors(Vec, Vec, MVT::v8i32, 8, DAG, dl);
4690 } else if (VT.is128BitVector()) {
4691 Vec = DAG.getNode(ISD::BUILD_VECTOR, dl, MVT::v4i32, Cst, Cst, Cst, Cst);
4693 llvm_unreachable("Unexpected vector type");
4695 return DAG.getBitcast(VT, Vec);
4698 /// Returns a vector_shuffle node for an unpackl operation.
4699 static SDValue getUnpackl(SelectionDAG &DAG, SDLoc dl, MVT VT, SDValue V1,
4701 unsigned NumElems = VT.getVectorNumElements();
4702 SmallVector<int, 8> Mask;
4703 for (unsigned i = 0, e = NumElems/2; i != e; ++i) {
4705 Mask.push_back(i + NumElems);
4707 return DAG.getVectorShuffle(VT, dl, V1, V2, &Mask[0]);
4710 /// Returns a vector_shuffle node for an unpackh operation.
4711 static SDValue getUnpackh(SelectionDAG &DAG, SDLoc dl, MVT VT, SDValue V1,
4713 unsigned NumElems = VT.getVectorNumElements();
4714 SmallVector<int, 8> Mask;
4715 for (unsigned i = 0, Half = NumElems/2; i != Half; ++i) {
4716 Mask.push_back(i + Half);
4717 Mask.push_back(i + NumElems + Half);
4719 return DAG.getVectorShuffle(VT, dl, V1, V2, &Mask[0]);
4722 /// Return a vector_shuffle of the specified vector of zero or undef vector.
4723 /// This produces a shuffle where the low element of V2 is swizzled into the
4724 /// zero/undef vector, landing at element Idx.
4725 /// This produces a shuffle mask like 4,1,2,3 (idx=0) or 0,1,2,4 (idx=3).
4726 static SDValue getShuffleVectorZeroOrUndef(SDValue V2, unsigned Idx,
4728 const X86Subtarget *Subtarget,
4729 SelectionDAG &DAG) {
4730 MVT VT = V2.getSimpleValueType();
4732 ? getZeroVector(VT, Subtarget, DAG, SDLoc(V2)) : DAG.getUNDEF(VT);
4733 unsigned NumElems = VT.getVectorNumElements();
4734 SmallVector<int, 16> MaskVec;
4735 for (unsigned i = 0; i != NumElems; ++i)
4736 // If this is the insertion idx, put the low elt of V2 here.
4737 MaskVec.push_back(i == Idx ? NumElems : i);
4738 return DAG.getVectorShuffle(VT, SDLoc(V2), V1, V2, &MaskVec[0]);
4741 /// Calculates the shuffle mask corresponding to the target-specific opcode.
4742 /// Returns true if the Mask could be calculated. Sets IsUnary to true if only
4743 /// uses one source. Note that this will set IsUnary for shuffles which use a
4744 /// single input multiple times, and in those cases it will
4745 /// adjust the mask to only have indices within that single input.
4746 /// FIXME: Add support for Decode*Mask functions that return SM_SentinelZero.
4747 static bool getTargetShuffleMask(SDNode *N, MVT VT,
4748 SmallVectorImpl<int> &Mask, bool &IsUnary) {
4749 unsigned NumElems = VT.getVectorNumElements();
4753 bool IsFakeUnary = false;
4754 switch(N->getOpcode()) {
4755 case X86ISD::BLENDI:
4756 ImmN = N->getOperand(N->getNumOperands()-1);
4757 DecodeBLENDMask(VT, cast<ConstantSDNode>(ImmN)->getZExtValue(), Mask);
4760 ImmN = N->getOperand(N->getNumOperands()-1);
4761 DecodeSHUFPMask(VT, cast<ConstantSDNode>(ImmN)->getZExtValue(), Mask);
4762 IsUnary = IsFakeUnary = N->getOperand(0) == N->getOperand(1);
4764 case X86ISD::UNPCKH:
4765 DecodeUNPCKHMask(VT, Mask);
4766 IsUnary = IsFakeUnary = N->getOperand(0) == N->getOperand(1);
4768 case X86ISD::UNPCKL:
4769 DecodeUNPCKLMask(VT, Mask);
4770 IsUnary = IsFakeUnary = N->getOperand(0) == N->getOperand(1);
4772 case X86ISD::MOVHLPS:
4773 DecodeMOVHLPSMask(NumElems, Mask);
4774 IsUnary = IsFakeUnary = N->getOperand(0) == N->getOperand(1);
4776 case X86ISD::MOVLHPS:
4777 DecodeMOVLHPSMask(NumElems, Mask);
4778 IsUnary = IsFakeUnary = N->getOperand(0) == N->getOperand(1);
4780 case X86ISD::PALIGNR:
4781 ImmN = N->getOperand(N->getNumOperands()-1);
4782 DecodePALIGNRMask(VT, cast<ConstantSDNode>(ImmN)->getZExtValue(), Mask);
4784 case X86ISD::PSHUFD:
4785 case X86ISD::VPERMILPI:
4786 ImmN = N->getOperand(N->getNumOperands()-1);
4787 DecodePSHUFMask(VT, cast<ConstantSDNode>(ImmN)->getZExtValue(), Mask);
4790 case X86ISD::PSHUFHW:
4791 ImmN = N->getOperand(N->getNumOperands()-1);
4792 DecodePSHUFHWMask(VT, cast<ConstantSDNode>(ImmN)->getZExtValue(), Mask);
4795 case X86ISD::PSHUFLW:
4796 ImmN = N->getOperand(N->getNumOperands()-1);
4797 DecodePSHUFLWMask(VT, cast<ConstantSDNode>(ImmN)->getZExtValue(), Mask);
4800 case X86ISD::PSHUFB: {
4802 SDValue MaskNode = N->getOperand(1);
4803 while (MaskNode->getOpcode() == ISD::BITCAST)
4804 MaskNode = MaskNode->getOperand(0);
4806 if (MaskNode->getOpcode() == ISD::BUILD_VECTOR) {
4807 // If we have a build-vector, then things are easy.
4808 MVT VT = MaskNode.getSimpleValueType();
4809 assert(VT.isVector() &&
4810 "Can't produce a non-vector with a build_vector!");
4811 if (!VT.isInteger())
4814 int NumBytesPerElement = VT.getVectorElementType().getSizeInBits() / 8;
4816 SmallVector<uint64_t, 32> RawMask;
4817 for (int i = 0, e = MaskNode->getNumOperands(); i < e; ++i) {
4818 SDValue Op = MaskNode->getOperand(i);
4819 if (Op->getOpcode() == ISD::UNDEF) {
4820 RawMask.push_back((uint64_t)SM_SentinelUndef);
4823 auto *CN = dyn_cast<ConstantSDNode>(Op.getNode());
4826 APInt MaskElement = CN->getAPIntValue();
4828 // We now have to decode the element which could be any integer size and
4829 // extract each byte of it.
4830 for (int j = 0; j < NumBytesPerElement; ++j) {
4831 // Note that this is x86 and so always little endian: the low byte is
4832 // the first byte of the mask.
4833 RawMask.push_back(MaskElement.getLoBits(8).getZExtValue());
4834 MaskElement = MaskElement.lshr(8);
4837 DecodePSHUFBMask(RawMask, Mask);
4841 auto *MaskLoad = dyn_cast<LoadSDNode>(MaskNode);
4845 SDValue Ptr = MaskLoad->getBasePtr();
4846 if (Ptr->getOpcode() == X86ISD::Wrapper ||
4847 Ptr->getOpcode() == X86ISD::WrapperRIP)
4848 Ptr = Ptr->getOperand(0);
4850 auto *MaskCP = dyn_cast<ConstantPoolSDNode>(Ptr);
4851 if (!MaskCP || MaskCP->isMachineConstantPoolEntry())
4854 if (auto *C = dyn_cast<Constant>(MaskCP->getConstVal())) {
4855 DecodePSHUFBMask(C, Mask);
4861 case X86ISD::VPERMI:
4862 ImmN = N->getOperand(N->getNumOperands()-1);
4863 DecodeVPERMMask(cast<ConstantSDNode>(ImmN)->getZExtValue(), Mask);
4868 DecodeScalarMoveMask(VT, /* IsLoad */ false, Mask);
4870 case X86ISD::VPERM2X128:
4871 ImmN = N->getOperand(N->getNumOperands()-1);
4872 DecodeVPERM2X128Mask(VT, cast<ConstantSDNode>(ImmN)->getZExtValue(), Mask);
4873 // Mask only contains negative index if an element is zero.
4874 if (std::any_of(Mask.begin(), Mask.end(),
4875 [](int M){ return M == SM_SentinelZero; }))
4878 case X86ISD::MOVSLDUP:
4879 DecodeMOVSLDUPMask(VT, Mask);
4882 case X86ISD::MOVSHDUP:
4883 DecodeMOVSHDUPMask(VT, Mask);
4886 case X86ISD::MOVDDUP:
4887 DecodeMOVDDUPMask(VT, Mask);
4890 case X86ISD::MOVLHPD:
4891 case X86ISD::MOVLPD:
4892 case X86ISD::MOVLPS:
4893 // Not yet implemented
4895 case X86ISD::VPERMV: {
4897 SDValue MaskNode = N->getOperand(0);
4898 while (MaskNode->getOpcode() == ISD::BITCAST)
4899 MaskNode = MaskNode->getOperand(0);
4901 unsigned MaskLoBits = Log2_64(VT.getVectorNumElements());
4902 SmallVector<uint64_t, 32> RawMask;
4903 if (MaskNode->getOpcode() == ISD::BUILD_VECTOR) {
4904 // If we have a build-vector, then things are easy.
4905 assert(MaskNode.getSimpleValueType().isInteger() &&
4906 MaskNode.getSimpleValueType().getVectorNumElements() ==
4907 VT.getVectorNumElements());
4909 for (unsigned i = 0; i < MaskNode->getNumOperands(); ++i) {
4910 SDValue Op = MaskNode->getOperand(i);
4911 if (Op->getOpcode() == ISD::UNDEF)
4912 RawMask.push_back((uint64_t)SM_SentinelUndef);
4913 else if (isa<ConstantSDNode>(Op)) {
4914 APInt MaskElement = cast<ConstantSDNode>(Op)->getAPIntValue();
4915 RawMask.push_back(MaskElement.getLoBits(MaskLoBits).getZExtValue());
4919 DecodeVPERMVMask(RawMask, Mask);
4922 if (MaskNode->getOpcode() == X86ISD::VBROADCAST) {
4923 unsigned NumEltsInMask = MaskNode->getNumOperands();
4924 MaskNode = MaskNode->getOperand(0);
4925 if (auto *CN = dyn_cast<ConstantSDNode>(MaskNode)) {
4926 APInt MaskEltValue = CN->getAPIntValue();
4927 for (unsigned i = 0; i < NumEltsInMask; ++i)
4928 RawMask.push_back(MaskEltValue.getLoBits(MaskLoBits).getZExtValue());
4929 DecodeVPERMVMask(RawMask, Mask);
4932 // It may be a scalar load
4935 auto *MaskLoad = dyn_cast<LoadSDNode>(MaskNode);
4939 SDValue Ptr = MaskLoad->getBasePtr();
4940 if (Ptr->getOpcode() == X86ISD::Wrapper ||
4941 Ptr->getOpcode() == X86ISD::WrapperRIP)
4942 Ptr = Ptr->getOperand(0);
4944 auto *MaskCP = dyn_cast<ConstantPoolSDNode>(Ptr);
4945 if (!MaskCP || MaskCP->isMachineConstantPoolEntry())
4948 if (auto *C = dyn_cast<Constant>(MaskCP->getConstVal())) {
4949 DecodeVPERMVMask(C, VT, Mask);
4954 case X86ISD::VPERMV3: {
4956 SDValue MaskNode = N->getOperand(1);
4957 while (MaskNode->getOpcode() == ISD::BITCAST)
4958 MaskNode = MaskNode->getOperand(1);
4960 if (MaskNode->getOpcode() == ISD::BUILD_VECTOR) {
4961 // If we have a build-vector, then things are easy.
4962 assert(MaskNode.getSimpleValueType().isInteger() &&
4963 MaskNode.getSimpleValueType().getVectorNumElements() ==
4964 VT.getVectorNumElements());
4966 SmallVector<uint64_t, 32> RawMask;
4967 unsigned MaskLoBits = Log2_64(VT.getVectorNumElements()*2);
4969 for (unsigned i = 0; i < MaskNode->getNumOperands(); ++i) {
4970 SDValue Op = MaskNode->getOperand(i);
4971 if (Op->getOpcode() == ISD::UNDEF)
4972 RawMask.push_back((uint64_t)SM_SentinelUndef);
4974 auto *CN = dyn_cast<ConstantSDNode>(Op.getNode());
4977 APInt MaskElement = CN->getAPIntValue();
4978 RawMask.push_back(MaskElement.getLoBits(MaskLoBits).getZExtValue());
4981 DecodeVPERMV3Mask(RawMask, Mask);
4985 auto *MaskLoad = dyn_cast<LoadSDNode>(MaskNode);
4989 SDValue Ptr = MaskLoad->getBasePtr();
4990 if (Ptr->getOpcode() == X86ISD::Wrapper ||
4991 Ptr->getOpcode() == X86ISD::WrapperRIP)
4992 Ptr = Ptr->getOperand(0);
4994 auto *MaskCP = dyn_cast<ConstantPoolSDNode>(Ptr);
4995 if (!MaskCP || MaskCP->isMachineConstantPoolEntry())
4998 if (auto *C = dyn_cast<Constant>(MaskCP->getConstVal())) {
4999 DecodeVPERMV3Mask(C, VT, Mask);
5004 default: llvm_unreachable("unknown target shuffle node");
5007 // Empty mask indicates the decode failed.
5011 // If we have a fake unary shuffle, the shuffle mask is spread across two
5012 // inputs that are actually the same node. Re-map the mask to always point
5013 // into the first input.
5016 if (M >= (int)Mask.size())
5022 /// Returns the scalar element that will make up the ith
5023 /// element of the result of the vector shuffle.
5024 static SDValue getShuffleScalarElt(SDNode *N, unsigned Index, SelectionDAG &DAG,
5027 return SDValue(); // Limit search depth.
5029 SDValue V = SDValue(N, 0);
5030 EVT VT = V.getValueType();
5031 unsigned Opcode = V.getOpcode();
5033 // Recurse into ISD::VECTOR_SHUFFLE node to find scalars.
5034 if (const ShuffleVectorSDNode *SV = dyn_cast<ShuffleVectorSDNode>(N)) {
5035 int Elt = SV->getMaskElt(Index);
5038 return DAG.getUNDEF(VT.getVectorElementType());
5040 unsigned NumElems = VT.getVectorNumElements();
5041 SDValue NewV = (Elt < (int)NumElems) ? SV->getOperand(0)
5042 : SV->getOperand(1);
5043 return getShuffleScalarElt(NewV.getNode(), Elt % NumElems, DAG, Depth+1);
5046 // Recurse into target specific vector shuffles to find scalars.
5047 if (isTargetShuffle(Opcode)) {
5048 MVT ShufVT = V.getSimpleValueType();
5049 unsigned NumElems = ShufVT.getVectorNumElements();
5050 SmallVector<int, 16> ShuffleMask;
5053 if (!getTargetShuffleMask(N, ShufVT, ShuffleMask, IsUnary))
5056 int Elt = ShuffleMask[Index];
5058 return DAG.getUNDEF(ShufVT.getVectorElementType());
5060 SDValue NewV = (Elt < (int)NumElems) ? N->getOperand(0)
5062 return getShuffleScalarElt(NewV.getNode(), Elt % NumElems, DAG,
5066 // Actual nodes that may contain scalar elements
5067 if (Opcode == ISD::BITCAST) {
5068 V = V.getOperand(0);
5069 EVT SrcVT = V.getValueType();
5070 unsigned NumElems = VT.getVectorNumElements();
5072 if (!SrcVT.isVector() || SrcVT.getVectorNumElements() != NumElems)
5076 if (V.getOpcode() == ISD::SCALAR_TO_VECTOR)
5077 return (Index == 0) ? V.getOperand(0)
5078 : DAG.getUNDEF(VT.getVectorElementType());
5080 if (V.getOpcode() == ISD::BUILD_VECTOR)
5081 return V.getOperand(Index);
5086 /// Custom lower build_vector of v16i8.
5087 static SDValue LowerBuildVectorv16i8(SDValue Op, unsigned NonZeros,
5088 unsigned NumNonZero, unsigned NumZero,
5090 const X86Subtarget* Subtarget,
5091 const TargetLowering &TLI) {
5099 // SSE4.1 - use PINSRB to insert each byte directly.
5100 if (Subtarget->hasSSE41()) {
5101 for (unsigned i = 0; i < 16; ++i) {
5102 bool isNonZero = (NonZeros & (1 << i)) != 0;
5106 V = getZeroVector(MVT::v16i8, Subtarget, DAG, dl);
5108 V = DAG.getUNDEF(MVT::v16i8);
5111 V = DAG.getNode(ISD::INSERT_VECTOR_ELT, dl,
5112 MVT::v16i8, V, Op.getOperand(i),
5113 DAG.getIntPtrConstant(i, dl));
5120 // Pre-SSE4.1 - merge byte pairs and insert with PINSRW.
5121 for (unsigned i = 0; i < 16; ++i) {
5122 bool ThisIsNonZero = (NonZeros & (1 << i)) != 0;
5123 if (ThisIsNonZero && First) {
5125 V = getZeroVector(MVT::v8i16, Subtarget, DAG, dl);
5127 V = DAG.getUNDEF(MVT::v8i16);
5132 SDValue ThisElt, LastElt;
5133 bool LastIsNonZero = (NonZeros & (1 << (i-1))) != 0;
5134 if (LastIsNonZero) {
5135 LastElt = DAG.getNode(ISD::ZERO_EXTEND, dl,
5136 MVT::i16, Op.getOperand(i-1));
5138 if (ThisIsNonZero) {
5139 ThisElt = DAG.getNode(ISD::ZERO_EXTEND, dl, MVT::i16, Op.getOperand(i));
5140 ThisElt = DAG.getNode(ISD::SHL, dl, MVT::i16,
5141 ThisElt, DAG.getConstant(8, dl, MVT::i8));
5143 ThisElt = DAG.getNode(ISD::OR, dl, MVT::i16, ThisElt, LastElt);
5147 if (ThisElt.getNode())
5148 V = DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, MVT::v8i16, V, ThisElt,
5149 DAG.getIntPtrConstant(i/2, dl));
5153 return DAG.getBitcast(MVT::v16i8, V);
5156 /// Custom lower build_vector of v8i16.
5157 static SDValue LowerBuildVectorv8i16(SDValue Op, unsigned NonZeros,
5158 unsigned NumNonZero, unsigned NumZero,
5160 const X86Subtarget* Subtarget,
5161 const TargetLowering &TLI) {
5168 for (unsigned i = 0; i < 8; ++i) {
5169 bool isNonZero = (NonZeros & (1 << i)) != 0;
5173 V = getZeroVector(MVT::v8i16, Subtarget, DAG, dl);
5175 V = DAG.getUNDEF(MVT::v8i16);
5178 V = DAG.getNode(ISD::INSERT_VECTOR_ELT, dl,
5179 MVT::v8i16, V, Op.getOperand(i),
5180 DAG.getIntPtrConstant(i, dl));
5187 /// Custom lower build_vector of v4i32 or v4f32.
5188 static SDValue LowerBuildVectorv4x32(SDValue Op, SelectionDAG &DAG,
5189 const X86Subtarget *Subtarget,
5190 const TargetLowering &TLI) {
5191 // Find all zeroable elements.
5192 std::bitset<4> Zeroable;
5193 for (int i=0; i < 4; ++i) {
5194 SDValue Elt = Op->getOperand(i);
5195 Zeroable[i] = (Elt.getOpcode() == ISD::UNDEF || X86::isZeroNode(Elt));
5197 assert(Zeroable.size() - Zeroable.count() > 1 &&
5198 "We expect at least two non-zero elements!");
5200 // We only know how to deal with build_vector nodes where elements are either
5201 // zeroable or extract_vector_elt with constant index.
5202 SDValue FirstNonZero;
5203 unsigned FirstNonZeroIdx;
5204 for (unsigned i=0; i < 4; ++i) {
5207 SDValue Elt = Op->getOperand(i);
5208 if (Elt.getOpcode() != ISD::EXTRACT_VECTOR_ELT ||
5209 !isa<ConstantSDNode>(Elt.getOperand(1)))
5211 // Make sure that this node is extracting from a 128-bit vector.
5212 MVT VT = Elt.getOperand(0).getSimpleValueType();
5213 if (!VT.is128BitVector())
5215 if (!FirstNonZero.getNode()) {
5217 FirstNonZeroIdx = i;
5221 assert(FirstNonZero.getNode() && "Unexpected build vector of all zeros!");
5222 SDValue V1 = FirstNonZero.getOperand(0);
5223 MVT VT = V1.getSimpleValueType();
5225 // See if this build_vector can be lowered as a blend with zero.
5227 unsigned EltMaskIdx, EltIdx;
5229 for (EltIdx = 0; EltIdx < 4; ++EltIdx) {
5230 if (Zeroable[EltIdx]) {
5231 // The zero vector will be on the right hand side.
5232 Mask[EltIdx] = EltIdx+4;
5236 Elt = Op->getOperand(EltIdx);
5237 // By construction, Elt is a EXTRACT_VECTOR_ELT with constant index.
5238 EltMaskIdx = cast<ConstantSDNode>(Elt.getOperand(1))->getZExtValue();
5239 if (Elt.getOperand(0) != V1 || EltMaskIdx != EltIdx)
5241 Mask[EltIdx] = EltIdx;
5245 // Let the shuffle legalizer deal with blend operations.
5246 SDValue VZero = getZeroVector(VT, Subtarget, DAG, SDLoc(Op));
5247 if (V1.getSimpleValueType() != VT)
5248 V1 = DAG.getNode(ISD::BITCAST, SDLoc(V1), VT, V1);
5249 return DAG.getVectorShuffle(VT, SDLoc(V1), V1, VZero, &Mask[0]);
5252 // See if we can lower this build_vector to a INSERTPS.
5253 if (!Subtarget->hasSSE41())
5256 SDValue V2 = Elt.getOperand(0);
5257 if (Elt == FirstNonZero && EltIdx == FirstNonZeroIdx)
5260 bool CanFold = true;
5261 for (unsigned i = EltIdx + 1; i < 4 && CanFold; ++i) {
5265 SDValue Current = Op->getOperand(i);
5266 SDValue SrcVector = Current->getOperand(0);
5269 CanFold = SrcVector == V1 &&
5270 cast<ConstantSDNode>(Current.getOperand(1))->getZExtValue() == i;
5276 assert(V1.getNode() && "Expected at least two non-zero elements!");
5277 if (V1.getSimpleValueType() != MVT::v4f32)
5278 V1 = DAG.getNode(ISD::BITCAST, SDLoc(V1), MVT::v4f32, V1);
5279 if (V2.getSimpleValueType() != MVT::v4f32)
5280 V2 = DAG.getNode(ISD::BITCAST, SDLoc(V2), MVT::v4f32, V2);
5282 // Ok, we can emit an INSERTPS instruction.
5283 unsigned ZMask = Zeroable.to_ulong();
5285 unsigned InsertPSMask = EltMaskIdx << 6 | EltIdx << 4 | ZMask;
5286 assert((InsertPSMask & ~0xFFu) == 0 && "Invalid mask!");
5288 SDValue Result = DAG.getNode(X86ISD::INSERTPS, DL, MVT::v4f32, V1, V2,
5289 DAG.getIntPtrConstant(InsertPSMask, DL));
5290 return DAG.getBitcast(VT, Result);
5293 /// Return a vector logical shift node.
5294 static SDValue getVShift(bool isLeft, EVT VT, SDValue SrcOp,
5295 unsigned NumBits, SelectionDAG &DAG,
5296 const TargetLowering &TLI, SDLoc dl) {
5297 assert(VT.is128BitVector() && "Unknown type for VShift");
5298 MVT ShVT = MVT::v2i64;
5299 unsigned Opc = isLeft ? X86ISD::VSHLDQ : X86ISD::VSRLDQ;
5300 SrcOp = DAG.getBitcast(ShVT, SrcOp);
5301 MVT ScalarShiftTy = TLI.getScalarShiftAmountTy(DAG.getDataLayout(), VT);
5302 assert(NumBits % 8 == 0 && "Only support byte sized shifts");
5303 SDValue ShiftVal = DAG.getConstant(NumBits/8, dl, ScalarShiftTy);
5304 return DAG.getBitcast(VT, DAG.getNode(Opc, dl, ShVT, SrcOp, ShiftVal));
5308 LowerAsSplatVectorLoad(SDValue SrcOp, MVT VT, SDLoc dl, SelectionDAG &DAG) {
5310 // Check if the scalar load can be widened into a vector load. And if
5311 // the address is "base + cst" see if the cst can be "absorbed" into
5312 // the shuffle mask.
5313 if (LoadSDNode *LD = dyn_cast<LoadSDNode>(SrcOp)) {
5314 SDValue Ptr = LD->getBasePtr();
5315 if (!ISD::isNormalLoad(LD) || LD->isVolatile())
5317 EVT PVT = LD->getValueType(0);
5318 if (PVT != MVT::i32 && PVT != MVT::f32)
5323 if (FrameIndexSDNode *FINode = dyn_cast<FrameIndexSDNode>(Ptr)) {
5324 FI = FINode->getIndex();
5326 } else if (DAG.isBaseWithConstantOffset(Ptr) &&
5327 isa<FrameIndexSDNode>(Ptr.getOperand(0))) {
5328 FI = cast<FrameIndexSDNode>(Ptr.getOperand(0))->getIndex();
5329 Offset = Ptr.getConstantOperandVal(1);
5330 Ptr = Ptr.getOperand(0);
5335 // FIXME: 256-bit vector instructions don't require a strict alignment,
5336 // improve this code to support it better.
5337 unsigned RequiredAlign = VT.getSizeInBits()/8;
5338 SDValue Chain = LD->getChain();
5339 // Make sure the stack object alignment is at least 16 or 32.
5340 MachineFrameInfo *MFI = DAG.getMachineFunction().getFrameInfo();
5341 if (DAG.InferPtrAlignment(Ptr) < RequiredAlign) {
5342 if (MFI->isFixedObjectIndex(FI)) {
5343 // Can't change the alignment. FIXME: It's possible to compute
5344 // the exact stack offset and reference FI + adjust offset instead.
5345 // If someone *really* cares about this. That's the way to implement it.
5348 MFI->setObjectAlignment(FI, RequiredAlign);
5352 // (Offset % 16 or 32) must be multiple of 4. Then address is then
5353 // Ptr + (Offset & ~15).
5356 if ((Offset % RequiredAlign) & 3)
5358 int64_t StartOffset = Offset & ~int64_t(RequiredAlign - 1);
5361 Ptr = DAG.getNode(ISD::ADD, DL, Ptr.getValueType(), Ptr,
5362 DAG.getConstant(StartOffset, DL, Ptr.getValueType()));
5365 int EltNo = (Offset - StartOffset) >> 2;
5366 unsigned NumElems = VT.getVectorNumElements();
5368 EVT NVT = EVT::getVectorVT(*DAG.getContext(), PVT, NumElems);
5369 SDValue V1 = DAG.getLoad(NVT, dl, Chain, Ptr,
5370 LD->getPointerInfo().getWithOffset(StartOffset),
5371 false, false, false, 0);
5373 SmallVector<int, 8> Mask(NumElems, EltNo);
5375 return DAG.getVectorShuffle(NVT, dl, V1, DAG.getUNDEF(NVT), &Mask[0]);
5381 /// Given the initializing elements 'Elts' of a vector of type 'VT', see if the
5382 /// elements can be replaced by a single large load which has the same value as
5383 /// a build_vector or insert_subvector whose loaded operands are 'Elts'.
5385 /// Example: <load i32 *a, load i32 *a+4, undef, undef> -> zextload a
5387 /// FIXME: we'd also like to handle the case where the last elements are zero
5388 /// rather than undef via VZEXT_LOAD, but we do not detect that case today.
5389 /// There's even a handy isZeroNode for that purpose.
5390 static SDValue EltsFromConsecutiveLoads(EVT VT, ArrayRef<SDValue> Elts,
5391 SDLoc &DL, SelectionDAG &DAG,
5392 bool isAfterLegalize) {
5393 unsigned NumElems = Elts.size();
5395 LoadSDNode *LDBase = nullptr;
5396 unsigned LastLoadedElt = -1U;
5398 // For each element in the initializer, see if we've found a load or an undef.
5399 // If we don't find an initial load element, or later load elements are
5400 // non-consecutive, bail out.
5401 for (unsigned i = 0; i < NumElems; ++i) {
5402 SDValue Elt = Elts[i];
5403 // Look through a bitcast.
5404 if (Elt.getNode() && Elt.getOpcode() == ISD::BITCAST)
5405 Elt = Elt.getOperand(0);
5406 if (!Elt.getNode() ||
5407 (Elt.getOpcode() != ISD::UNDEF && !ISD::isNON_EXTLoad(Elt.getNode())))
5410 if (Elt.getNode()->getOpcode() == ISD::UNDEF)
5412 LDBase = cast<LoadSDNode>(Elt.getNode());
5416 if (Elt.getOpcode() == ISD::UNDEF)
5419 LoadSDNode *LD = cast<LoadSDNode>(Elt);
5420 EVT LdVT = Elt.getValueType();
5421 // Each loaded element must be the correct fractional portion of the
5422 // requested vector load.
5423 if (LdVT.getSizeInBits() != VT.getSizeInBits() / NumElems)
5425 if (!DAG.isConsecutiveLoad(LD, LDBase, LdVT.getSizeInBits() / 8, i))
5430 // If we have found an entire vector of loads and undefs, then return a large
5431 // load of the entire vector width starting at the base pointer. If we found
5432 // consecutive loads for the low half, generate a vzext_load node.
5433 if (LastLoadedElt == NumElems - 1) {
5434 assert(LDBase && "Did not find base load for merging consecutive loads");
5435 EVT EltVT = LDBase->getValueType(0);
5436 // Ensure that the input vector size for the merged loads matches the
5437 // cumulative size of the input elements.
5438 if (VT.getSizeInBits() != EltVT.getSizeInBits() * NumElems)
5441 if (isAfterLegalize &&
5442 !DAG.getTargetLoweringInfo().isOperationLegal(ISD::LOAD, VT))
5445 SDValue NewLd = SDValue();
5447 NewLd = DAG.getLoad(VT, DL, LDBase->getChain(), LDBase->getBasePtr(),
5448 LDBase->getPointerInfo(), LDBase->isVolatile(),
5449 LDBase->isNonTemporal(), LDBase->isInvariant(),
5450 LDBase->getAlignment());
5452 if (LDBase->hasAnyUseOfValue(1)) {
5453 SDValue NewChain = DAG.getNode(ISD::TokenFactor, DL, MVT::Other,
5455 SDValue(NewLd.getNode(), 1));
5456 DAG.ReplaceAllUsesOfValueWith(SDValue(LDBase, 1), NewChain);
5457 DAG.UpdateNodeOperands(NewChain.getNode(), SDValue(LDBase, 1),
5458 SDValue(NewLd.getNode(), 1));
5464 //TODO: The code below fires only for for loading the low v2i32 / v2f32
5465 //of a v4i32 / v4f32. It's probably worth generalizing.
5466 EVT EltVT = VT.getVectorElementType();
5467 if (NumElems == 4 && LastLoadedElt == 1 && (EltVT.getSizeInBits() == 32) &&
5468 DAG.getTargetLoweringInfo().isTypeLegal(MVT::v2i64)) {
5469 SDVTList Tys = DAG.getVTList(MVT::v2i64, MVT::Other);
5470 SDValue Ops[] = { LDBase->getChain(), LDBase->getBasePtr() };
5472 DAG.getMemIntrinsicNode(X86ISD::VZEXT_LOAD, DL, Tys, Ops, MVT::i64,
5473 LDBase->getPointerInfo(),
5474 LDBase->getAlignment(),
5475 false/*isVolatile*/, true/*ReadMem*/,
5478 // Make sure the newly-created LOAD is in the same position as LDBase in
5479 // terms of dependency. We create a TokenFactor for LDBase and ResNode, and
5480 // update uses of LDBase's output chain to use the TokenFactor.
5481 if (LDBase->hasAnyUseOfValue(1)) {
5482 SDValue NewChain = DAG.getNode(ISD::TokenFactor, DL, MVT::Other,
5483 SDValue(LDBase, 1), SDValue(ResNode.getNode(), 1));
5484 DAG.ReplaceAllUsesOfValueWith(SDValue(LDBase, 1), NewChain);
5485 DAG.UpdateNodeOperands(NewChain.getNode(), SDValue(LDBase, 1),
5486 SDValue(ResNode.getNode(), 1));
5489 return DAG.getBitcast(VT, ResNode);
5494 /// LowerVectorBroadcast - Attempt to use the vbroadcast instruction
5495 /// to generate a splat value for the following cases:
5496 /// 1. A splat BUILD_VECTOR which uses a single scalar load, or a constant.
5497 /// 2. A splat shuffle which uses a scalar_to_vector node which comes from
5498 /// a scalar load, or a constant.
5499 /// The VBROADCAST node is returned when a pattern is found,
5500 /// or SDValue() otherwise.
5501 static SDValue LowerVectorBroadcast(SDValue Op, const X86Subtarget* Subtarget,
5502 SelectionDAG &DAG) {
5503 // VBROADCAST requires AVX.
5504 // TODO: Splats could be generated for non-AVX CPUs using SSE
5505 // instructions, but there's less potential gain for only 128-bit vectors.
5506 if (!Subtarget->hasAVX())
5509 MVT VT = Op.getSimpleValueType();
5512 assert((VT.is128BitVector() || VT.is256BitVector() || VT.is512BitVector()) &&
5513 "Unsupported vector type for broadcast.");
5518 switch (Op.getOpcode()) {
5520 // Unknown pattern found.
5523 case ISD::BUILD_VECTOR: {
5524 auto *BVOp = cast<BuildVectorSDNode>(Op.getNode());
5525 BitVector UndefElements;
5526 SDValue Splat = BVOp->getSplatValue(&UndefElements);
5528 // We need a splat of a single value to use broadcast, and it doesn't
5529 // make any sense if the value is only in one element of the vector.
5530 if (!Splat || (VT.getVectorNumElements() - UndefElements.count()) <= 1)
5534 ConstSplatVal = (Ld.getOpcode() == ISD::Constant ||
5535 Ld.getOpcode() == ISD::ConstantFP);
5537 // Make sure that all of the users of a non-constant load are from the
5538 // BUILD_VECTOR node.
5539 if (!ConstSplatVal && !BVOp->isOnlyUserOf(Ld.getNode()))
5544 case ISD::VECTOR_SHUFFLE: {
5545 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
5547 // Shuffles must have a splat mask where the first element is
5549 if ((!SVOp->isSplat()) || SVOp->getMaskElt(0) != 0)
5552 SDValue Sc = Op.getOperand(0);
5553 if (Sc.getOpcode() != ISD::SCALAR_TO_VECTOR &&
5554 Sc.getOpcode() != ISD::BUILD_VECTOR) {
5556 if (!Subtarget->hasInt256())
5559 // Use the register form of the broadcast instruction available on AVX2.
5560 if (VT.getSizeInBits() >= 256)
5561 Sc = Extract128BitVector(Sc, 0, DAG, dl);
5562 return DAG.getNode(X86ISD::VBROADCAST, dl, VT, Sc);
5565 Ld = Sc.getOperand(0);
5566 ConstSplatVal = (Ld.getOpcode() == ISD::Constant ||
5567 Ld.getOpcode() == ISD::ConstantFP);
5569 // The scalar_to_vector node and the suspected
5570 // load node must have exactly one user.
5571 // Constants may have multiple users.
5573 // AVX-512 has register version of the broadcast
5574 bool hasRegVer = Subtarget->hasAVX512() && VT.is512BitVector() &&
5575 Ld.getValueType().getSizeInBits() >= 32;
5576 if (!ConstSplatVal && ((!Sc.hasOneUse() || !Ld.hasOneUse()) &&
5583 unsigned ScalarSize = Ld.getValueType().getSizeInBits();
5584 bool IsGE256 = (VT.getSizeInBits() >= 256);
5586 // When optimizing for size, generate up to 5 extra bytes for a broadcast
5587 // instruction to save 8 or more bytes of constant pool data.
5588 // TODO: If multiple splats are generated to load the same constant,
5589 // it may be detrimental to overall size. There needs to be a way to detect
5590 // that condition to know if this is truly a size win.
5591 bool OptForSize = DAG.getMachineFunction().getFunction()->optForSize();
5593 // Handle broadcasting a single constant scalar from the constant pool
5595 // On Sandybridge (no AVX2), it is still better to load a constant vector
5596 // from the constant pool and not to broadcast it from a scalar.
5597 // But override that restriction when optimizing for size.
5598 // TODO: Check if splatting is recommended for other AVX-capable CPUs.
5599 if (ConstSplatVal && (Subtarget->hasAVX2() || OptForSize)) {
5600 EVT CVT = Ld.getValueType();
5601 assert(!CVT.isVector() && "Must not broadcast a vector type");
5603 // Splat f32, i32, v4f64, v4i64 in all cases with AVX2.
5604 // For size optimization, also splat v2f64 and v2i64, and for size opt
5605 // with AVX2, also splat i8 and i16.
5606 // With pattern matching, the VBROADCAST node may become a VMOVDDUP.
5607 if (ScalarSize == 32 || (IsGE256 && ScalarSize == 64) ||
5608 (OptForSize && (ScalarSize == 64 || Subtarget->hasAVX2()))) {
5609 const Constant *C = nullptr;
5610 if (ConstantSDNode *CI = dyn_cast<ConstantSDNode>(Ld))
5611 C = CI->getConstantIntValue();
5612 else if (ConstantFPSDNode *CF = dyn_cast<ConstantFPSDNode>(Ld))
5613 C = CF->getConstantFPValue();
5615 assert(C && "Invalid constant type");
5617 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
5619 DAG.getConstantPool(C, TLI.getPointerTy(DAG.getDataLayout()));
5620 unsigned Alignment = cast<ConstantPoolSDNode>(CP)->getAlignment();
5622 CVT, dl, DAG.getEntryNode(), CP,
5623 MachinePointerInfo::getConstantPool(DAG.getMachineFunction()), false,
5624 false, false, Alignment);
5626 return DAG.getNode(X86ISD::VBROADCAST, dl, VT, Ld);
5630 bool IsLoad = ISD::isNormalLoad(Ld.getNode());
5632 // Handle AVX2 in-register broadcasts.
5633 if (!IsLoad && Subtarget->hasInt256() &&
5634 (ScalarSize == 32 || (IsGE256 && ScalarSize == 64)))
5635 return DAG.getNode(X86ISD::VBROADCAST, dl, VT, Ld);
5637 // The scalar source must be a normal load.
5641 if (ScalarSize == 32 || (IsGE256 && ScalarSize == 64) ||
5642 (Subtarget->hasVLX() && ScalarSize == 64))
5643 return DAG.getNode(X86ISD::VBROADCAST, dl, VT, Ld);
5645 // The integer check is needed for the 64-bit into 128-bit so it doesn't match
5646 // double since there is no vbroadcastsd xmm
5647 if (Subtarget->hasInt256() && Ld.getValueType().isInteger()) {
5648 if (ScalarSize == 8 || ScalarSize == 16 || ScalarSize == 64)
5649 return DAG.getNode(X86ISD::VBROADCAST, dl, VT, Ld);
5652 // Unsupported broadcast.
5656 /// \brief For an EXTRACT_VECTOR_ELT with a constant index return the real
5657 /// underlying vector and index.
5659 /// Modifies \p ExtractedFromVec to the real vector and returns the real
5661 static int getUnderlyingExtractedFromVec(SDValue &ExtractedFromVec,
5663 int Idx = cast<ConstantSDNode>(ExtIdx)->getZExtValue();
5664 if (!isa<ShuffleVectorSDNode>(ExtractedFromVec))
5667 // For 256-bit vectors, LowerEXTRACT_VECTOR_ELT_SSE4 may have already
5669 // (extract_vector_elt (v8f32 %vreg1), Constant<6>)
5671 // (extract_vector_elt (vector_shuffle<2,u,u,u>
5672 // (extract_subvector (v8f32 %vreg0), Constant<4>),
5675 // In this case the vector is the extract_subvector expression and the index
5676 // is 2, as specified by the shuffle.
5677 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(ExtractedFromVec);
5678 SDValue ShuffleVec = SVOp->getOperand(0);
5679 MVT ShuffleVecVT = ShuffleVec.getSimpleValueType();
5680 assert(ShuffleVecVT.getVectorElementType() ==
5681 ExtractedFromVec.getSimpleValueType().getVectorElementType());
5683 int ShuffleIdx = SVOp->getMaskElt(Idx);
5684 if (isUndefOrInRange(ShuffleIdx, 0, ShuffleVecVT.getVectorNumElements())) {
5685 ExtractedFromVec = ShuffleVec;
5691 static SDValue buildFromShuffleMostly(SDValue Op, SelectionDAG &DAG) {
5692 MVT VT = Op.getSimpleValueType();
5694 // Skip if insert_vec_elt is not supported.
5695 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
5696 if (!TLI.isOperationLegalOrCustom(ISD::INSERT_VECTOR_ELT, VT))
5700 unsigned NumElems = Op.getNumOperands();
5704 SmallVector<unsigned, 4> InsertIndices;
5705 SmallVector<int, 8> Mask(NumElems, -1);
5707 for (unsigned i = 0; i != NumElems; ++i) {
5708 unsigned Opc = Op.getOperand(i).getOpcode();
5710 if (Opc == ISD::UNDEF)
5713 if (Opc != ISD::EXTRACT_VECTOR_ELT) {
5714 // Quit if more than 1 elements need inserting.
5715 if (InsertIndices.size() > 1)
5718 InsertIndices.push_back(i);
5722 SDValue ExtractedFromVec = Op.getOperand(i).getOperand(0);
5723 SDValue ExtIdx = Op.getOperand(i).getOperand(1);
5724 // Quit if non-constant index.
5725 if (!isa<ConstantSDNode>(ExtIdx))
5727 int Idx = getUnderlyingExtractedFromVec(ExtractedFromVec, ExtIdx);
5729 // Quit if extracted from vector of different type.
5730 if (ExtractedFromVec.getValueType() != VT)
5733 if (!VecIn1.getNode())
5734 VecIn1 = ExtractedFromVec;
5735 else if (VecIn1 != ExtractedFromVec) {
5736 if (!VecIn2.getNode())
5737 VecIn2 = ExtractedFromVec;
5738 else if (VecIn2 != ExtractedFromVec)
5739 // Quit if more than 2 vectors to shuffle
5743 if (ExtractedFromVec == VecIn1)
5745 else if (ExtractedFromVec == VecIn2)
5746 Mask[i] = Idx + NumElems;
5749 if (!VecIn1.getNode())
5752 VecIn2 = VecIn2.getNode() ? VecIn2 : DAG.getUNDEF(VT);
5753 SDValue NV = DAG.getVectorShuffle(VT, DL, VecIn1, VecIn2, &Mask[0]);
5754 for (unsigned i = 0, e = InsertIndices.size(); i != e; ++i) {
5755 unsigned Idx = InsertIndices[i];
5756 NV = DAG.getNode(ISD::INSERT_VECTOR_ELT, DL, VT, NV, Op.getOperand(Idx),
5757 DAG.getIntPtrConstant(Idx, DL));
5763 static SDValue ConvertI1VectorToInteger(SDValue Op, SelectionDAG &DAG) {
5764 assert(ISD::isBuildVectorOfConstantSDNodes(Op.getNode()) &&
5765 Op.getScalarValueSizeInBits() == 1 &&
5766 "Can not convert non-constant vector");
5767 uint64_t Immediate = 0;
5768 for (unsigned idx = 0, e = Op.getNumOperands(); idx < e; ++idx) {
5769 SDValue In = Op.getOperand(idx);
5770 if (In.getOpcode() != ISD::UNDEF)
5771 Immediate |= cast<ConstantSDNode>(In)->getZExtValue() << idx;
5775 MVT::getIntegerVT(std::max((int)Op.getValueType().getSizeInBits(), 8));
5776 return DAG.getConstant(Immediate, dl, VT);
5778 // Lower BUILD_VECTOR operation for v8i1 and v16i1 types.
5780 X86TargetLowering::LowerBUILD_VECTORvXi1(SDValue Op, SelectionDAG &DAG) const {
5782 MVT VT = Op.getSimpleValueType();
5783 assert((VT.getVectorElementType() == MVT::i1) &&
5784 "Unexpected type in LowerBUILD_VECTORvXi1!");
5787 if (ISD::isBuildVectorAllZeros(Op.getNode())) {
5788 SDValue Cst = DAG.getTargetConstant(0, dl, MVT::i1);
5789 SmallVector<SDValue, 16> Ops(VT.getVectorNumElements(), Cst);
5790 return DAG.getNode(ISD::BUILD_VECTOR, dl, VT, Ops);
5793 if (ISD::isBuildVectorAllOnes(Op.getNode())) {
5794 SDValue Cst = DAG.getTargetConstant(1, dl, MVT::i1);
5795 SmallVector<SDValue, 16> Ops(VT.getVectorNumElements(), Cst);
5796 return DAG.getNode(ISD::BUILD_VECTOR, dl, VT, Ops);
5799 if (ISD::isBuildVectorOfConstantSDNodes(Op.getNode())) {
5800 SDValue Imm = ConvertI1VectorToInteger(Op, DAG);
5801 if (Imm.getValueSizeInBits() == VT.getSizeInBits())
5802 return DAG.getBitcast(VT, Imm);
5803 SDValue ExtVec = DAG.getBitcast(MVT::v8i1, Imm);
5804 return DAG.getNode(ISD::EXTRACT_SUBVECTOR, dl, VT, ExtVec,
5805 DAG.getIntPtrConstant(0, dl));
5808 // Vector has one or more non-const elements
5809 uint64_t Immediate = 0;
5810 SmallVector<unsigned, 16> NonConstIdx;
5811 bool IsSplat = true;
5812 bool HasConstElts = false;
5814 for (unsigned idx = 0, e = Op.getNumOperands(); idx < e; ++idx) {
5815 SDValue In = Op.getOperand(idx);
5816 if (In.getOpcode() == ISD::UNDEF)
5818 if (!isa<ConstantSDNode>(In))
5819 NonConstIdx.push_back(idx);
5821 Immediate |= cast<ConstantSDNode>(In)->getZExtValue() << idx;
5822 HasConstElts = true;
5826 else if (In != Op.getOperand(SplatIdx))
5830 // for splat use " (select i1 splat_elt, all-ones, all-zeroes)"
5832 return DAG.getNode(ISD::SELECT, dl, VT, Op.getOperand(SplatIdx),
5833 DAG.getConstant(1, dl, VT),
5834 DAG.getConstant(0, dl, VT));
5836 // insert elements one by one
5840 MVT ImmVT = MVT::getIntegerVT(std::max((int)VT.getSizeInBits(), 8));
5841 Imm = DAG.getConstant(Immediate, dl, ImmVT);
5843 else if (HasConstElts)
5844 Imm = DAG.getConstant(0, dl, VT);
5846 Imm = DAG.getUNDEF(VT);
5847 if (Imm.getValueSizeInBits() == VT.getSizeInBits())
5848 DstVec = DAG.getBitcast(VT, Imm);
5850 SDValue ExtVec = DAG.getBitcast(MVT::v8i1, Imm);
5851 DstVec = DAG.getNode(ISD::EXTRACT_SUBVECTOR, dl, VT, ExtVec,
5852 DAG.getIntPtrConstant(0, dl));
5855 for (unsigned i = 0; i < NonConstIdx.size(); ++i) {
5856 unsigned InsertIdx = NonConstIdx[i];
5857 DstVec = DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, VT, DstVec,
5858 Op.getOperand(InsertIdx),
5859 DAG.getIntPtrConstant(InsertIdx, dl));
5864 /// \brief Return true if \p N implements a horizontal binop and return the
5865 /// operands for the horizontal binop into V0 and V1.
5867 /// This is a helper function of LowerToHorizontalOp().
5868 /// This function checks that the build_vector \p N in input implements a
5869 /// horizontal operation. Parameter \p Opcode defines the kind of horizontal
5870 /// operation to match.
5871 /// For example, if \p Opcode is equal to ISD::ADD, then this function
5872 /// checks if \p N implements a horizontal arithmetic add; if instead \p Opcode
5873 /// is equal to ISD::SUB, then this function checks if this is a horizontal
5876 /// This function only analyzes elements of \p N whose indices are
5877 /// in range [BaseIdx, LastIdx).
5878 static bool isHorizontalBinOp(const BuildVectorSDNode *N, unsigned Opcode,
5880 unsigned BaseIdx, unsigned LastIdx,
5881 SDValue &V0, SDValue &V1) {
5882 EVT VT = N->getValueType(0);
5884 assert(BaseIdx * 2 <= LastIdx && "Invalid Indices in input!");
5885 assert(VT.isVector() && VT.getVectorNumElements() >= LastIdx &&
5886 "Invalid Vector in input!");
5888 bool IsCommutable = (Opcode == ISD::ADD || Opcode == ISD::FADD);
5889 bool CanFold = true;
5890 unsigned ExpectedVExtractIdx = BaseIdx;
5891 unsigned NumElts = LastIdx - BaseIdx;
5892 V0 = DAG.getUNDEF(VT);
5893 V1 = DAG.getUNDEF(VT);
5895 // Check if N implements a horizontal binop.
5896 for (unsigned i = 0, e = NumElts; i != e && CanFold; ++i) {
5897 SDValue Op = N->getOperand(i + BaseIdx);
5900 if (Op->getOpcode() == ISD::UNDEF) {
5901 // Update the expected vector extract index.
5902 if (i * 2 == NumElts)
5903 ExpectedVExtractIdx = BaseIdx;
5904 ExpectedVExtractIdx += 2;
5908 CanFold = Op->getOpcode() == Opcode && Op->hasOneUse();
5913 SDValue Op0 = Op.getOperand(0);
5914 SDValue Op1 = Op.getOperand(1);
5916 // Try to match the following pattern:
5917 // (BINOP (extract_vector_elt A, I), (extract_vector_elt A, I+1))
5918 CanFold = (Op0.getOpcode() == ISD::EXTRACT_VECTOR_ELT &&
5919 Op1.getOpcode() == ISD::EXTRACT_VECTOR_ELT &&
5920 Op0.getOperand(0) == Op1.getOperand(0) &&
5921 isa<ConstantSDNode>(Op0.getOperand(1)) &&
5922 isa<ConstantSDNode>(Op1.getOperand(1)));
5926 unsigned I0 = cast<ConstantSDNode>(Op0.getOperand(1))->getZExtValue();
5927 unsigned I1 = cast<ConstantSDNode>(Op1.getOperand(1))->getZExtValue();
5929 if (i * 2 < NumElts) {
5930 if (V0.getOpcode() == ISD::UNDEF) {
5931 V0 = Op0.getOperand(0);
5932 if (V0.getValueType() != VT)
5936 if (V1.getOpcode() == ISD::UNDEF) {
5937 V1 = Op0.getOperand(0);
5938 if (V1.getValueType() != VT)
5941 if (i * 2 == NumElts)
5942 ExpectedVExtractIdx = BaseIdx;
5945 SDValue Expected = (i * 2 < NumElts) ? V0 : V1;
5946 if (I0 == ExpectedVExtractIdx)
5947 CanFold = I1 == I0 + 1 && Op0.getOperand(0) == Expected;
5948 else if (IsCommutable && I1 == ExpectedVExtractIdx) {
5949 // Try to match the following dag sequence:
5950 // (BINOP (extract_vector_elt A, I+1), (extract_vector_elt A, I))
5951 CanFold = I0 == I1 + 1 && Op1.getOperand(0) == Expected;
5955 ExpectedVExtractIdx += 2;
5961 /// \brief Emit a sequence of two 128-bit horizontal add/sub followed by
5962 /// a concat_vector.
5964 /// This is a helper function of LowerToHorizontalOp().
5965 /// This function expects two 256-bit vectors called V0 and V1.
5966 /// At first, each vector is split into two separate 128-bit vectors.
5967 /// Then, the resulting 128-bit vectors are used to implement two
5968 /// horizontal binary operations.
5970 /// The kind of horizontal binary operation is defined by \p X86Opcode.
5972 /// \p Mode specifies how the 128-bit parts of V0 and V1 are passed in input to
5973 /// the two new horizontal binop.
5974 /// When Mode is set, the first horizontal binop dag node would take as input
5975 /// the lower 128-bit of V0 and the upper 128-bit of V0. The second
5976 /// horizontal binop dag node would take as input the lower 128-bit of V1
5977 /// and the upper 128-bit of V1.
5979 /// HADD V0_LO, V0_HI
5980 /// HADD V1_LO, V1_HI
5982 /// Otherwise, the first horizontal binop dag node takes as input the lower
5983 /// 128-bit of V0 and the lower 128-bit of V1, and the second horizontal binop
5984 /// dag node takes the upper 128-bit of V0 and the upper 128-bit of V1.
5986 /// HADD V0_LO, V1_LO
5987 /// HADD V0_HI, V1_HI
5989 /// If \p isUndefLO is set, then the algorithm propagates UNDEF to the lower
5990 /// 128-bits of the result. If \p isUndefHI is set, then UNDEF is propagated to
5991 /// the upper 128-bits of the result.
5992 static SDValue ExpandHorizontalBinOp(const SDValue &V0, const SDValue &V1,
5993 SDLoc DL, SelectionDAG &DAG,
5994 unsigned X86Opcode, bool Mode,
5995 bool isUndefLO, bool isUndefHI) {
5996 EVT VT = V0.getValueType();
5997 assert(VT.is256BitVector() && VT == V1.getValueType() &&
5998 "Invalid nodes in input!");
6000 unsigned NumElts = VT.getVectorNumElements();
6001 SDValue V0_LO = Extract128BitVector(V0, 0, DAG, DL);
6002 SDValue V0_HI = Extract128BitVector(V0, NumElts/2, DAG, DL);
6003 SDValue V1_LO = Extract128BitVector(V1, 0, DAG, DL);
6004 SDValue V1_HI = Extract128BitVector(V1, NumElts/2, DAG, DL);
6005 EVT NewVT = V0_LO.getValueType();
6007 SDValue LO = DAG.getUNDEF(NewVT);
6008 SDValue HI = DAG.getUNDEF(NewVT);
6011 // Don't emit a horizontal binop if the result is expected to be UNDEF.
6012 if (!isUndefLO && V0->getOpcode() != ISD::UNDEF)
6013 LO = DAG.getNode(X86Opcode, DL, NewVT, V0_LO, V0_HI);
6014 if (!isUndefHI && V1->getOpcode() != ISD::UNDEF)
6015 HI = DAG.getNode(X86Opcode, DL, NewVT, V1_LO, V1_HI);
6017 // Don't emit a horizontal binop if the result is expected to be UNDEF.
6018 if (!isUndefLO && (V0_LO->getOpcode() != ISD::UNDEF ||
6019 V1_LO->getOpcode() != ISD::UNDEF))
6020 LO = DAG.getNode(X86Opcode, DL, NewVT, V0_LO, V1_LO);
6022 if (!isUndefHI && (V0_HI->getOpcode() != ISD::UNDEF ||
6023 V1_HI->getOpcode() != ISD::UNDEF))
6024 HI = DAG.getNode(X86Opcode, DL, NewVT, V0_HI, V1_HI);
6027 return DAG.getNode(ISD::CONCAT_VECTORS, DL, VT, LO, HI);
6030 /// Try to fold a build_vector that performs an 'addsub' to an X86ISD::ADDSUB
6032 static SDValue LowerToAddSub(const BuildVectorSDNode *BV,
6033 const X86Subtarget *Subtarget, SelectionDAG &DAG) {
6034 MVT VT = BV->getSimpleValueType(0);
6035 if ((!Subtarget->hasSSE3() || (VT != MVT::v4f32 && VT != MVT::v2f64)) &&
6036 (!Subtarget->hasAVX() || (VT != MVT::v8f32 && VT != MVT::v4f64)))
6040 unsigned NumElts = VT.getVectorNumElements();
6041 SDValue InVec0 = DAG.getUNDEF(VT);
6042 SDValue InVec1 = DAG.getUNDEF(VT);
6044 assert((VT == MVT::v8f32 || VT == MVT::v4f64 || VT == MVT::v4f32 ||
6045 VT == MVT::v2f64) && "build_vector with an invalid type found!");
6047 // Odd-numbered elements in the input build vector are obtained from
6048 // adding two integer/float elements.
6049 // Even-numbered elements in the input build vector are obtained from
6050 // subtracting two integer/float elements.
6051 unsigned ExpectedOpcode = ISD::FSUB;
6052 unsigned NextExpectedOpcode = ISD::FADD;
6053 bool AddFound = false;
6054 bool SubFound = false;
6056 for (unsigned i = 0, e = NumElts; i != e; ++i) {
6057 SDValue Op = BV->getOperand(i);
6059 // Skip 'undef' values.
6060 unsigned Opcode = Op.getOpcode();
6061 if (Opcode == ISD::UNDEF) {
6062 std::swap(ExpectedOpcode, NextExpectedOpcode);
6066 // Early exit if we found an unexpected opcode.
6067 if (Opcode != ExpectedOpcode)
6070 SDValue Op0 = Op.getOperand(0);
6071 SDValue Op1 = Op.getOperand(1);
6073 // Try to match the following pattern:
6074 // (BINOP (extract_vector_elt A, i), (extract_vector_elt B, i))
6075 // Early exit if we cannot match that sequence.
6076 if (Op0.getOpcode() != ISD::EXTRACT_VECTOR_ELT ||
6077 Op1.getOpcode() != ISD::EXTRACT_VECTOR_ELT ||
6078 !isa<ConstantSDNode>(Op0.getOperand(1)) ||
6079 !isa<ConstantSDNode>(Op1.getOperand(1)) ||
6080 Op0.getOperand(1) != Op1.getOperand(1))
6083 unsigned I0 = cast<ConstantSDNode>(Op0.getOperand(1))->getZExtValue();
6087 // We found a valid add/sub node. Update the information accordingly.
6093 // Update InVec0 and InVec1.
6094 if (InVec0.getOpcode() == ISD::UNDEF) {
6095 InVec0 = Op0.getOperand(0);
6096 if (InVec0.getSimpleValueType() != VT)
6099 if (InVec1.getOpcode() == ISD::UNDEF) {
6100 InVec1 = Op1.getOperand(0);
6101 if (InVec1.getSimpleValueType() != VT)
6105 // Make sure that operands in input to each add/sub node always
6106 // come from a same pair of vectors.
6107 if (InVec0 != Op0.getOperand(0)) {
6108 if (ExpectedOpcode == ISD::FSUB)
6111 // FADD is commutable. Try to commute the operands
6112 // and then test again.
6113 std::swap(Op0, Op1);
6114 if (InVec0 != Op0.getOperand(0))
6118 if (InVec1 != Op1.getOperand(0))
6121 // Update the pair of expected opcodes.
6122 std::swap(ExpectedOpcode, NextExpectedOpcode);
6125 // Don't try to fold this build_vector into an ADDSUB if the inputs are undef.
6126 if (AddFound && SubFound && InVec0.getOpcode() != ISD::UNDEF &&
6127 InVec1.getOpcode() != ISD::UNDEF)
6128 return DAG.getNode(X86ISD::ADDSUB, DL, VT, InVec0, InVec1);
6133 /// Lower BUILD_VECTOR to a horizontal add/sub operation if possible.
6134 static SDValue LowerToHorizontalOp(const BuildVectorSDNode *BV,
6135 const X86Subtarget *Subtarget,
6136 SelectionDAG &DAG) {
6137 MVT VT = BV->getSimpleValueType(0);
6138 unsigned NumElts = VT.getVectorNumElements();
6139 unsigned NumUndefsLO = 0;
6140 unsigned NumUndefsHI = 0;
6141 unsigned Half = NumElts/2;
6143 // Count the number of UNDEF operands in the build_vector in input.
6144 for (unsigned i = 0, e = Half; i != e; ++i)
6145 if (BV->getOperand(i)->getOpcode() == ISD::UNDEF)
6148 for (unsigned i = Half, e = NumElts; i != e; ++i)
6149 if (BV->getOperand(i)->getOpcode() == ISD::UNDEF)
6152 // Early exit if this is either a build_vector of all UNDEFs or all the
6153 // operands but one are UNDEF.
6154 if (NumUndefsLO + NumUndefsHI + 1 >= NumElts)
6158 SDValue InVec0, InVec1;
6159 if ((VT == MVT::v4f32 || VT == MVT::v2f64) && Subtarget->hasSSE3()) {
6160 // Try to match an SSE3 float HADD/HSUB.
6161 if (isHorizontalBinOp(BV, ISD::FADD, DAG, 0, NumElts, InVec0, InVec1))
6162 return DAG.getNode(X86ISD::FHADD, DL, VT, InVec0, InVec1);
6164 if (isHorizontalBinOp(BV, ISD::FSUB, DAG, 0, NumElts, InVec0, InVec1))
6165 return DAG.getNode(X86ISD::FHSUB, DL, VT, InVec0, InVec1);
6166 } else if ((VT == MVT::v4i32 || VT == MVT::v8i16) && Subtarget->hasSSSE3()) {
6167 // Try to match an SSSE3 integer HADD/HSUB.
6168 if (isHorizontalBinOp(BV, ISD::ADD, DAG, 0, NumElts, InVec0, InVec1))
6169 return DAG.getNode(X86ISD::HADD, DL, VT, InVec0, InVec1);
6171 if (isHorizontalBinOp(BV, ISD::SUB, DAG, 0, NumElts, InVec0, InVec1))
6172 return DAG.getNode(X86ISD::HSUB, DL, VT, InVec0, InVec1);
6175 if (!Subtarget->hasAVX())
6178 if ((VT == MVT::v8f32 || VT == MVT::v4f64)) {
6179 // Try to match an AVX horizontal add/sub of packed single/double
6180 // precision floating point values from 256-bit vectors.
6181 SDValue InVec2, InVec3;
6182 if (isHorizontalBinOp(BV, ISD::FADD, DAG, 0, Half, InVec0, InVec1) &&
6183 isHorizontalBinOp(BV, ISD::FADD, DAG, Half, NumElts, InVec2, InVec3) &&
6184 ((InVec0.getOpcode() == ISD::UNDEF ||
6185 InVec2.getOpcode() == ISD::UNDEF) || InVec0 == InVec2) &&
6186 ((InVec1.getOpcode() == ISD::UNDEF ||
6187 InVec3.getOpcode() == ISD::UNDEF) || InVec1 == InVec3))
6188 return DAG.getNode(X86ISD::FHADD, DL, VT, InVec0, InVec1);
6190 if (isHorizontalBinOp(BV, ISD::FSUB, DAG, 0, Half, InVec0, InVec1) &&
6191 isHorizontalBinOp(BV, ISD::FSUB, DAG, Half, NumElts, InVec2, InVec3) &&
6192 ((InVec0.getOpcode() == ISD::UNDEF ||
6193 InVec2.getOpcode() == ISD::UNDEF) || InVec0 == InVec2) &&
6194 ((InVec1.getOpcode() == ISD::UNDEF ||
6195 InVec3.getOpcode() == ISD::UNDEF) || InVec1 == InVec3))
6196 return DAG.getNode(X86ISD::FHSUB, DL, VT, InVec0, InVec1);
6197 } else if (VT == MVT::v8i32 || VT == MVT::v16i16) {
6198 // Try to match an AVX2 horizontal add/sub of signed integers.
6199 SDValue InVec2, InVec3;
6201 bool CanFold = true;
6203 if (isHorizontalBinOp(BV, ISD::ADD, DAG, 0, Half, InVec0, InVec1) &&
6204 isHorizontalBinOp(BV, ISD::ADD, DAG, Half, NumElts, InVec2, InVec3) &&
6205 ((InVec0.getOpcode() == ISD::UNDEF ||
6206 InVec2.getOpcode() == ISD::UNDEF) || InVec0 == InVec2) &&
6207 ((InVec1.getOpcode() == ISD::UNDEF ||
6208 InVec3.getOpcode() == ISD::UNDEF) || InVec1 == InVec3))
6209 X86Opcode = X86ISD::HADD;
6210 else if (isHorizontalBinOp(BV, ISD::SUB, DAG, 0, Half, InVec0, InVec1) &&
6211 isHorizontalBinOp(BV, ISD::SUB, DAG, Half, NumElts, InVec2, InVec3) &&
6212 ((InVec0.getOpcode() == ISD::UNDEF ||
6213 InVec2.getOpcode() == ISD::UNDEF) || InVec0 == InVec2) &&
6214 ((InVec1.getOpcode() == ISD::UNDEF ||
6215 InVec3.getOpcode() == ISD::UNDEF) || InVec1 == InVec3))
6216 X86Opcode = X86ISD::HSUB;
6221 // Fold this build_vector into a single horizontal add/sub.
6222 // Do this only if the target has AVX2.
6223 if (Subtarget->hasAVX2())
6224 return DAG.getNode(X86Opcode, DL, VT, InVec0, InVec1);
6226 // Do not try to expand this build_vector into a pair of horizontal
6227 // add/sub if we can emit a pair of scalar add/sub.
6228 if (NumUndefsLO + 1 == Half || NumUndefsHI + 1 == Half)
6231 // Convert this build_vector into a pair of horizontal binop followed by
6233 bool isUndefLO = NumUndefsLO == Half;
6234 bool isUndefHI = NumUndefsHI == Half;
6235 return ExpandHorizontalBinOp(InVec0, InVec1, DL, DAG, X86Opcode, false,
6236 isUndefLO, isUndefHI);
6240 if ((VT == MVT::v8f32 || VT == MVT::v4f64 || VT == MVT::v8i32 ||
6241 VT == MVT::v16i16) && Subtarget->hasAVX()) {
6243 if (isHorizontalBinOp(BV, ISD::ADD, DAG, 0, NumElts, InVec0, InVec1))
6244 X86Opcode = X86ISD::HADD;
6245 else if (isHorizontalBinOp(BV, ISD::SUB, DAG, 0, NumElts, InVec0, InVec1))
6246 X86Opcode = X86ISD::HSUB;
6247 else if (isHorizontalBinOp(BV, ISD::FADD, DAG, 0, NumElts, InVec0, InVec1))
6248 X86Opcode = X86ISD::FHADD;
6249 else if (isHorizontalBinOp(BV, ISD::FSUB, DAG, 0, NumElts, InVec0, InVec1))
6250 X86Opcode = X86ISD::FHSUB;
6254 // Don't try to expand this build_vector into a pair of horizontal add/sub
6255 // if we can simply emit a pair of scalar add/sub.
6256 if (NumUndefsLO + 1 == Half || NumUndefsHI + 1 == Half)
6259 // Convert this build_vector into two horizontal add/sub followed by
6261 bool isUndefLO = NumUndefsLO == Half;
6262 bool isUndefHI = NumUndefsHI == Half;
6263 return ExpandHorizontalBinOp(InVec0, InVec1, DL, DAG, X86Opcode, true,
6264 isUndefLO, isUndefHI);
6271 X86TargetLowering::LowerBUILD_VECTOR(SDValue Op, SelectionDAG &DAG) const {
6274 MVT VT = Op.getSimpleValueType();
6275 MVT ExtVT = VT.getVectorElementType();
6276 unsigned NumElems = Op.getNumOperands();
6278 // Generate vectors for predicate vectors.
6279 if (VT.getVectorElementType() == MVT::i1 && Subtarget->hasAVX512())
6280 return LowerBUILD_VECTORvXi1(Op, DAG);
6282 // Vectors containing all zeros can be matched by pxor and xorps later
6283 if (ISD::isBuildVectorAllZeros(Op.getNode())) {
6284 // Canonicalize this to <4 x i32> to 1) ensure the zero vectors are CSE'd
6285 // and 2) ensure that i64 scalars are eliminated on x86-32 hosts.
6286 if (VT == MVT::v4i32 || VT == MVT::v8i32 || VT == MVT::v16i32)
6289 return getZeroVector(VT, Subtarget, DAG, dl);
6292 // Vectors containing all ones can be matched by pcmpeqd on 128-bit width
6293 // vectors or broken into v4i32 operations on 256-bit vectors. AVX2 can use
6294 // vpcmpeqd on 256-bit vectors.
6295 if (Subtarget->hasSSE2() && ISD::isBuildVectorAllOnes(Op.getNode())) {
6296 if (VT == MVT::v4i32 || (VT == MVT::v8i32 && Subtarget->hasInt256()))
6299 if (!VT.is512BitVector())
6300 return getOnesVector(VT, Subtarget, DAG, dl);
6303 BuildVectorSDNode *BV = cast<BuildVectorSDNode>(Op.getNode());
6304 if (SDValue AddSub = LowerToAddSub(BV, Subtarget, DAG))
6306 if (SDValue HorizontalOp = LowerToHorizontalOp(BV, Subtarget, DAG))
6307 return HorizontalOp;
6308 if (SDValue Broadcast = LowerVectorBroadcast(Op, Subtarget, DAG))
6311 unsigned EVTBits = ExtVT.getSizeInBits();
6313 unsigned NumZero = 0;
6314 unsigned NumNonZero = 0;
6315 uint64_t NonZeros = 0;
6316 bool IsAllConstants = true;
6317 SmallSet<SDValue, 8> Values;
6318 for (unsigned i = 0; i < NumElems; ++i) {
6319 SDValue Elt = Op.getOperand(i);
6320 if (Elt.getOpcode() == ISD::UNDEF)
6323 if (Elt.getOpcode() != ISD::Constant &&
6324 Elt.getOpcode() != ISD::ConstantFP)
6325 IsAllConstants = false;
6326 if (X86::isZeroNode(Elt))
6329 assert(i < sizeof(NonZeros) * 8); // Make sure the shift is within range.
6330 NonZeros |= ((uint64_t)1 << i);
6335 // All undef vector. Return an UNDEF. All zero vectors were handled above.
6336 if (NumNonZero == 0)
6337 return DAG.getUNDEF(VT);
6339 // Special case for single non-zero, non-undef, element.
6340 if (NumNonZero == 1) {
6341 unsigned Idx = countTrailingZeros(NonZeros);
6342 SDValue Item = Op.getOperand(Idx);
6344 // If this is an insertion of an i64 value on x86-32, and if the top bits of
6345 // the value are obviously zero, truncate the value to i32 and do the
6346 // insertion that way. Only do this if the value is non-constant or if the
6347 // value is a constant being inserted into element 0. It is cheaper to do
6348 // a constant pool load than it is to do a movd + shuffle.
6349 if (ExtVT == MVT::i64 && !Subtarget->is64Bit() &&
6350 (!IsAllConstants || Idx == 0)) {
6351 if (DAG.MaskedValueIsZero(Item, APInt::getBitsSet(64, 32, 64))) {
6353 assert(VT == MVT::v2i64 && "Expected an SSE value type!");
6354 MVT VecVT = MVT::v4i32;
6356 // Truncate the value (which may itself be a constant) to i32, and
6357 // convert it to a vector with movd (S2V+shuffle to zero extend).
6358 Item = DAG.getNode(ISD::TRUNCATE, dl, MVT::i32, Item);
6359 Item = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VecVT, Item);
6360 return DAG.getBitcast(VT, getShuffleVectorZeroOrUndef(
6361 Item, Idx * 2, true, Subtarget, DAG));
6365 // If we have a constant or non-constant insertion into the low element of
6366 // a vector, we can do this with SCALAR_TO_VECTOR + shuffle of zero into
6367 // the rest of the elements. This will be matched as movd/movq/movss/movsd
6368 // depending on what the source datatype is.
6371 return DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VT, Item);
6373 if (ExtVT == MVT::i32 || ExtVT == MVT::f32 || ExtVT == MVT::f64 ||
6374 (ExtVT == MVT::i64 && Subtarget->is64Bit())) {
6375 if (VT.is512BitVector()) {
6376 SDValue ZeroVec = getZeroVector(VT, Subtarget, DAG, dl);
6377 return DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, VT, ZeroVec,
6378 Item, DAG.getIntPtrConstant(0, dl));
6380 assert((VT.is128BitVector() || VT.is256BitVector()) &&
6381 "Expected an SSE value type!");
6382 Item = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VT, Item);
6383 // Turn it into a MOVL (i.e. movss, movsd, or movd) to a zero vector.
6384 return getShuffleVectorZeroOrUndef(Item, 0, true, Subtarget, DAG);
6387 // We can't directly insert an i8 or i16 into a vector, so zero extend
6389 if (ExtVT == MVT::i16 || ExtVT == MVT::i8) {
6390 Item = DAG.getNode(ISD::ZERO_EXTEND, dl, MVT::i32, Item);
6391 if (VT.is256BitVector()) {
6392 if (Subtarget->hasAVX()) {
6393 Item = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, MVT::v8i32, Item);
6394 Item = getShuffleVectorZeroOrUndef(Item, 0, true, Subtarget, DAG);
6396 // Without AVX, we need to extend to a 128-bit vector and then
6397 // insert into the 256-bit vector.
6398 Item = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, MVT::v4i32, Item);
6399 SDValue ZeroVec = getZeroVector(MVT::v8i32, Subtarget, DAG, dl);
6400 Item = Insert128BitVector(ZeroVec, Item, 0, DAG, dl);
6403 assert(VT.is128BitVector() && "Expected an SSE value type!");
6404 Item = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, MVT::v4i32, Item);
6405 Item = getShuffleVectorZeroOrUndef(Item, 0, true, Subtarget, DAG);
6407 return DAG.getBitcast(VT, Item);
6411 // Is it a vector logical left shift?
6412 if (NumElems == 2 && Idx == 1 &&
6413 X86::isZeroNode(Op.getOperand(0)) &&
6414 !X86::isZeroNode(Op.getOperand(1))) {
6415 unsigned NumBits = VT.getSizeInBits();
6416 return getVShift(true, VT,
6417 DAG.getNode(ISD::SCALAR_TO_VECTOR, dl,
6418 VT, Op.getOperand(1)),
6419 NumBits/2, DAG, *this, dl);
6422 if (IsAllConstants) // Otherwise, it's better to do a constpool load.
6425 // Otherwise, if this is a vector with i32 or f32 elements, and the element
6426 // is a non-constant being inserted into an element other than the low one,
6427 // we can't use a constant pool load. Instead, use SCALAR_TO_VECTOR (aka
6428 // movd/movss) to move this into the low element, then shuffle it into
6430 if (EVTBits == 32) {
6431 Item = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VT, Item);
6432 return getShuffleVectorZeroOrUndef(Item, Idx, NumZero > 0, Subtarget, DAG);
6436 // Splat is obviously ok. Let legalizer expand it to a shuffle.
6437 if (Values.size() == 1) {
6438 if (EVTBits == 32) {
6439 // Instead of a shuffle like this:
6440 // shuffle (scalar_to_vector (load (ptr + 4))), undef, <0, 0, 0, 0>
6441 // Check if it's possible to issue this instead.
6442 // shuffle (vload ptr)), undef, <1, 1, 1, 1>
6443 unsigned Idx = countTrailingZeros(NonZeros);
6444 SDValue Item = Op.getOperand(Idx);
6445 if (Op.getNode()->isOnlyUserOf(Item.getNode()))
6446 return LowerAsSplatVectorLoad(Item, VT, dl, DAG);
6451 // A vector full of immediates; various special cases are already
6452 // handled, so this is best done with a single constant-pool load.
6456 // For AVX-length vectors, see if we can use a vector load to get all of the
6457 // elements, otherwise build the individual 128-bit pieces and use
6458 // shuffles to put them in place.
6459 if (VT.is256BitVector() || VT.is512BitVector()) {
6460 SmallVector<SDValue, 64> V(Op->op_begin(), Op->op_begin() + NumElems);
6462 // Check for a build vector of consecutive loads.
6463 if (SDValue LD = EltsFromConsecutiveLoads(VT, V, dl, DAG, false))
6466 EVT HVT = EVT::getVectorVT(*DAG.getContext(), ExtVT, NumElems/2);
6468 // Build both the lower and upper subvector.
6469 SDValue Lower = DAG.getNode(ISD::BUILD_VECTOR, dl, HVT,
6470 makeArrayRef(&V[0], NumElems/2));
6471 SDValue Upper = DAG.getNode(ISD::BUILD_VECTOR, dl, HVT,
6472 makeArrayRef(&V[NumElems / 2], NumElems/2));
6474 // Recreate the wider vector with the lower and upper part.
6475 if (VT.is256BitVector())
6476 return Concat128BitVectors(Lower, Upper, VT, NumElems, DAG, dl);
6477 return Concat256BitVectors(Lower, Upper, VT, NumElems, DAG, dl);
6480 // Let legalizer expand 2-wide build_vectors.
6481 if (EVTBits == 64) {
6482 if (NumNonZero == 1) {
6483 // One half is zero or undef.
6484 unsigned Idx = countTrailingZeros(NonZeros);
6485 SDValue V2 = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VT,
6486 Op.getOperand(Idx));
6487 return getShuffleVectorZeroOrUndef(V2, Idx, true, Subtarget, DAG);
6492 // If element VT is < 32 bits, convert it to inserts into a zero vector.
6493 if (EVTBits == 8 && NumElems == 16)
6494 if (SDValue V = LowerBuildVectorv16i8(Op, NonZeros, NumNonZero, NumZero,
6495 DAG, Subtarget, *this))
6498 if (EVTBits == 16 && NumElems == 8)
6499 if (SDValue V = LowerBuildVectorv8i16(Op, NonZeros, NumNonZero, NumZero,
6500 DAG, Subtarget, *this))
6503 // If element VT is == 32 bits and has 4 elems, try to generate an INSERTPS
6504 if (EVTBits == 32 && NumElems == 4)
6505 if (SDValue V = LowerBuildVectorv4x32(Op, DAG, Subtarget, *this))
6508 // If element VT is == 32 bits, turn it into a number of shuffles.
6509 SmallVector<SDValue, 8> V(NumElems);
6510 if (NumElems == 4 && NumZero > 0) {
6511 for (unsigned i = 0; i < 4; ++i) {
6512 bool isZero = !(NonZeros & (1ULL << i));
6514 V[i] = getZeroVector(VT, Subtarget, DAG, dl);
6516 V[i] = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VT, Op.getOperand(i));
6519 for (unsigned i = 0; i < 2; ++i) {
6520 switch ((NonZeros & (0x3 << i*2)) >> (i*2)) {
6523 V[i] = V[i*2]; // Must be a zero vector.
6526 V[i] = getMOVL(DAG, dl, VT, V[i*2+1], V[i*2]);
6529 V[i] = getMOVL(DAG, dl, VT, V[i*2], V[i*2+1]);
6532 V[i] = getUnpackl(DAG, dl, VT, V[i*2], V[i*2+1]);
6537 bool Reverse1 = (NonZeros & 0x3) == 2;
6538 bool Reverse2 = ((NonZeros & (0x3 << 2)) >> 2) == 2;
6542 static_cast<int>(Reverse2 ? NumElems+1 : NumElems),
6543 static_cast<int>(Reverse2 ? NumElems : NumElems+1)
6545 return DAG.getVectorShuffle(VT, dl, V[0], V[1], &MaskVec[0]);
6548 if (Values.size() > 1 && VT.is128BitVector()) {
6549 // Check for a build vector of consecutive loads.
6550 for (unsigned i = 0; i < NumElems; ++i)
6551 V[i] = Op.getOperand(i);
6553 // Check for elements which are consecutive loads.
6554 if (SDValue LD = EltsFromConsecutiveLoads(VT, V, dl, DAG, false))
6557 // Check for a build vector from mostly shuffle plus few inserting.
6558 if (SDValue Sh = buildFromShuffleMostly(Op, DAG))
6561 // For SSE 4.1, use insertps to put the high elements into the low element.
6562 if (Subtarget->hasSSE41()) {
6564 if (Op.getOperand(0).getOpcode() != ISD::UNDEF)
6565 Result = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VT, Op.getOperand(0));
6567 Result = DAG.getUNDEF(VT);
6569 for (unsigned i = 1; i < NumElems; ++i) {
6570 if (Op.getOperand(i).getOpcode() == ISD::UNDEF) continue;
6571 Result = DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, VT, Result,
6572 Op.getOperand(i), DAG.getIntPtrConstant(i, dl));
6577 // Otherwise, expand into a number of unpckl*, start by extending each of
6578 // our (non-undef) elements to the full vector width with the element in the
6579 // bottom slot of the vector (which generates no code for SSE).
6580 for (unsigned i = 0; i < NumElems; ++i) {
6581 if (Op.getOperand(i).getOpcode() != ISD::UNDEF)
6582 V[i] = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VT, Op.getOperand(i));
6584 V[i] = DAG.getUNDEF(VT);
6587 // Next, we iteratively mix elements, e.g. for v4f32:
6588 // Step 1: unpcklps 0, 2 ==> X: <?, ?, 2, 0>
6589 // : unpcklps 1, 3 ==> Y: <?, ?, 3, 1>
6590 // Step 2: unpcklps X, Y ==> <3, 2, 1, 0>
6591 unsigned EltStride = NumElems >> 1;
6592 while (EltStride != 0) {
6593 for (unsigned i = 0; i < EltStride; ++i) {
6594 // If V[i+EltStride] is undef and this is the first round of mixing,
6595 // then it is safe to just drop this shuffle: V[i] is already in the
6596 // right place, the one element (since it's the first round) being
6597 // inserted as undef can be dropped. This isn't safe for successive
6598 // rounds because they will permute elements within both vectors.
6599 if (V[i+EltStride].getOpcode() == ISD::UNDEF &&
6600 EltStride == NumElems/2)
6603 V[i] = getUnpackl(DAG, dl, VT, V[i], V[i + EltStride]);
6612 // 256-bit AVX can use the vinsertf128 instruction
6613 // to create 256-bit vectors from two other 128-bit ones.
6614 static SDValue LowerAVXCONCAT_VECTORS(SDValue Op, SelectionDAG &DAG) {
6616 MVT ResVT = Op.getSimpleValueType();
6618 assert((ResVT.is256BitVector() ||
6619 ResVT.is512BitVector()) && "Value type must be 256-/512-bit wide");
6621 SDValue V1 = Op.getOperand(0);
6622 SDValue V2 = Op.getOperand(1);
6623 unsigned NumElems = ResVT.getVectorNumElements();
6624 if (ResVT.is256BitVector())
6625 return Concat128BitVectors(V1, V2, ResVT, NumElems, DAG, dl);
6627 if (Op.getNumOperands() == 4) {
6628 MVT HalfVT = MVT::getVectorVT(ResVT.getVectorElementType(),
6629 ResVT.getVectorNumElements()/2);
6630 SDValue V3 = Op.getOperand(2);
6631 SDValue V4 = Op.getOperand(3);
6632 return Concat256BitVectors(Concat128BitVectors(V1, V2, HalfVT, NumElems/2, DAG, dl),
6633 Concat128BitVectors(V3, V4, HalfVT, NumElems/2, DAG, dl), ResVT, NumElems, DAG, dl);
6635 return Concat256BitVectors(V1, V2, ResVT, NumElems, DAG, dl);
6638 static SDValue LowerCONCAT_VECTORSvXi1(SDValue Op,
6639 const X86Subtarget *Subtarget,
6640 SelectionDAG & DAG) {
6642 MVT ResVT = Op.getSimpleValueType();
6643 unsigned NumOfOperands = Op.getNumOperands();
6645 assert(isPowerOf2_32(NumOfOperands) &&
6646 "Unexpected number of operands in CONCAT_VECTORS");
6648 SDValue Undef = DAG.getUNDEF(ResVT);
6649 if (NumOfOperands > 2) {
6650 // Specialize the cases when all, or all but one, of the operands are undef.
6651 unsigned NumOfDefinedOps = 0;
6653 for (unsigned i = 0; i < NumOfOperands; i++)
6654 if (!Op.getOperand(i).isUndef()) {
6658 if (NumOfDefinedOps == 0)
6660 if (NumOfDefinedOps == 1) {
6661 unsigned SubVecNumElts =
6662 Op.getOperand(OpIdx).getValueType().getVectorNumElements();
6663 SDValue IdxVal = DAG.getIntPtrConstant(SubVecNumElts * OpIdx, dl);
6664 return DAG.getNode(ISD::INSERT_SUBVECTOR, dl, ResVT, Undef,
6665 Op.getOperand(OpIdx), IdxVal);
6668 MVT HalfVT = MVT::getVectorVT(ResVT.getVectorElementType(),
6669 ResVT.getVectorNumElements()/2);
6670 SmallVector<SDValue, 2> Ops;
6671 for (unsigned i = 0; i < NumOfOperands/2; i++)
6672 Ops.push_back(Op.getOperand(i));
6673 SDValue Lo = DAG.getNode(ISD::CONCAT_VECTORS, dl, HalfVT, Ops);
6675 for (unsigned i = NumOfOperands/2; i < NumOfOperands; i++)
6676 Ops.push_back(Op.getOperand(i));
6677 SDValue Hi = DAG.getNode(ISD::CONCAT_VECTORS, dl, HalfVT, Ops);
6678 return DAG.getNode(ISD::CONCAT_VECTORS, dl, ResVT, Lo, Hi);
6682 SDValue V1 = Op.getOperand(0);
6683 SDValue V2 = Op.getOperand(1);
6684 unsigned NumElems = ResVT.getVectorNumElements();
6685 assert(V1.getValueType() == V2.getValueType() &&
6686 V1.getValueType().getVectorNumElements() == NumElems/2 &&
6687 "Unexpected operands in CONCAT_VECTORS");
6689 if (ResVT.getSizeInBits() >= 16)
6690 return Op; // The operation is legal with KUNPCK
6692 bool IsZeroV1 = ISD::isBuildVectorAllZeros(V1.getNode());
6693 bool IsZeroV2 = ISD::isBuildVectorAllZeros(V2.getNode());
6694 SDValue ZeroVec = getZeroVector(ResVT, Subtarget, DAG, dl);
6695 if (IsZeroV1 && IsZeroV2)
6698 SDValue ZeroIdx = DAG.getIntPtrConstant(0, dl);
6700 return DAG.getNode(ISD::INSERT_SUBVECTOR, dl, ResVT, Undef, V1, ZeroIdx);
6702 return DAG.getNode(ISD::INSERT_SUBVECTOR, dl, ResVT, ZeroVec, V1, ZeroIdx);
6704 SDValue IdxVal = DAG.getIntPtrConstant(NumElems/2, dl);
6706 V2 = DAG.getNode(ISD::INSERT_SUBVECTOR, dl, ResVT, Undef, V2, IdxVal);
6709 return DAG.getNode(ISD::INSERT_SUBVECTOR, dl, ResVT, ZeroVec, V2, IdxVal);
6711 V1 = DAG.getNode(ISD::INSERT_SUBVECTOR, dl, ResVT, Undef, V1, ZeroIdx);
6712 return DAG.getNode(ISD::INSERT_SUBVECTOR, dl, ResVT, V1, V2, IdxVal);
6715 static SDValue LowerCONCAT_VECTORS(SDValue Op,
6716 const X86Subtarget *Subtarget,
6717 SelectionDAG &DAG) {
6718 MVT VT = Op.getSimpleValueType();
6719 if (VT.getVectorElementType() == MVT::i1)
6720 return LowerCONCAT_VECTORSvXi1(Op, Subtarget, DAG);
6722 assert((VT.is256BitVector() && Op.getNumOperands() == 2) ||
6723 (VT.is512BitVector() && (Op.getNumOperands() == 2 ||
6724 Op.getNumOperands() == 4)));
6726 // AVX can use the vinsertf128 instruction to create 256-bit vectors
6727 // from two other 128-bit ones.
6729 // 512-bit vector may contain 2 256-bit vectors or 4 128-bit vectors
6730 return LowerAVXCONCAT_VECTORS(Op, DAG);
6733 //===----------------------------------------------------------------------===//
6734 // Vector shuffle lowering
6736 // This is an experimental code path for lowering vector shuffles on x86. It is
6737 // designed to handle arbitrary vector shuffles and blends, gracefully
6738 // degrading performance as necessary. It works hard to recognize idiomatic
6739 // shuffles and lower them to optimal instruction patterns without leaving
6740 // a framework that allows reasonably efficient handling of all vector shuffle
6742 //===----------------------------------------------------------------------===//
6744 /// \brief Tiny helper function to identify a no-op mask.
6746 /// This is a somewhat boring predicate function. It checks whether the mask
6747 /// array input, which is assumed to be a single-input shuffle mask of the kind
6748 /// used by the X86 shuffle instructions (not a fully general
6749 /// ShuffleVectorSDNode mask) requires any shuffles to occur. Both undef and an
6750 /// in-place shuffle are 'no-op's.
6751 static bool isNoopShuffleMask(ArrayRef<int> Mask) {
6752 for (int i = 0, Size = Mask.size(); i < Size; ++i)
6753 if (Mask[i] != -1 && Mask[i] != i)
6758 /// \brief Helper function to classify a mask as a single-input mask.
6760 /// This isn't a generic single-input test because in the vector shuffle
6761 /// lowering we canonicalize single inputs to be the first input operand. This
6762 /// means we can more quickly test for a single input by only checking whether
6763 /// an input from the second operand exists. We also assume that the size of
6764 /// mask corresponds to the size of the input vectors which isn't true in the
6765 /// fully general case.
6766 static bool isSingleInputShuffleMask(ArrayRef<int> Mask) {
6768 if (M >= (int)Mask.size())
6773 /// \brief Test whether there are elements crossing 128-bit lanes in this
6776 /// X86 divides up its shuffles into in-lane and cross-lane shuffle operations
6777 /// and we routinely test for these.
6778 static bool is128BitLaneCrossingShuffleMask(MVT VT, ArrayRef<int> Mask) {
6779 int LaneSize = 128 / VT.getScalarSizeInBits();
6780 int Size = Mask.size();
6781 for (int i = 0; i < Size; ++i)
6782 if (Mask[i] >= 0 && (Mask[i] % Size) / LaneSize != i / LaneSize)
6787 /// \brief Test whether a shuffle mask is equivalent within each 128-bit lane.
6789 /// This checks a shuffle mask to see if it is performing the same
6790 /// 128-bit lane-relative shuffle in each 128-bit lane. This trivially implies
6791 /// that it is also not lane-crossing. It may however involve a blend from the
6792 /// same lane of a second vector.
6794 /// The specific repeated shuffle mask is populated in \p RepeatedMask, as it is
6795 /// non-trivial to compute in the face of undef lanes. The representation is
6796 /// *not* suitable for use with existing 128-bit shuffles as it will contain
6797 /// entries from both V1 and V2 inputs to the wider mask.
6799 is128BitLaneRepeatedShuffleMask(MVT VT, ArrayRef<int> Mask,
6800 SmallVectorImpl<int> &RepeatedMask) {
6801 int LaneSize = 128 / VT.getScalarSizeInBits();
6802 RepeatedMask.resize(LaneSize, -1);
6803 int Size = Mask.size();
6804 for (int i = 0; i < Size; ++i) {
6807 if ((Mask[i] % Size) / LaneSize != i / LaneSize)
6808 // This entry crosses lanes, so there is no way to model this shuffle.
6811 // Ok, handle the in-lane shuffles by detecting if and when they repeat.
6812 if (RepeatedMask[i % LaneSize] == -1)
6813 // This is the first non-undef entry in this slot of a 128-bit lane.
6814 RepeatedMask[i % LaneSize] =
6815 Mask[i] < Size ? Mask[i] % LaneSize : Mask[i] % LaneSize + Size;
6816 else if (RepeatedMask[i % LaneSize] + (i / LaneSize) * LaneSize != Mask[i])
6817 // Found a mismatch with the repeated mask.
6823 /// \brief Checks whether a shuffle mask is equivalent to an explicit list of
6826 /// This is a fast way to test a shuffle mask against a fixed pattern:
6828 /// if (isShuffleEquivalent(Mask, 3, 2, {1, 0})) { ... }
6830 /// It returns true if the mask is exactly as wide as the argument list, and
6831 /// each element of the mask is either -1 (signifying undef) or the value given
6832 /// in the argument.
6833 static bool isShuffleEquivalent(SDValue V1, SDValue V2, ArrayRef<int> Mask,
6834 ArrayRef<int> ExpectedMask) {
6835 if (Mask.size() != ExpectedMask.size())
6838 int Size = Mask.size();
6840 // If the values are build vectors, we can look through them to find
6841 // equivalent inputs that make the shuffles equivalent.
6842 auto *BV1 = dyn_cast<BuildVectorSDNode>(V1);
6843 auto *BV2 = dyn_cast<BuildVectorSDNode>(V2);
6845 for (int i = 0; i < Size; ++i)
6846 if (Mask[i] != -1 && Mask[i] != ExpectedMask[i]) {
6847 auto *MaskBV = Mask[i] < Size ? BV1 : BV2;
6848 auto *ExpectedBV = ExpectedMask[i] < Size ? BV1 : BV2;
6849 if (!MaskBV || !ExpectedBV ||
6850 MaskBV->getOperand(Mask[i] % Size) !=
6851 ExpectedBV->getOperand(ExpectedMask[i] % Size))
6858 /// \brief Get a 4-lane 8-bit shuffle immediate for a mask.
6860 /// This helper function produces an 8-bit shuffle immediate corresponding to
6861 /// the ubiquitous shuffle encoding scheme used in x86 instructions for
6862 /// shuffling 4 lanes. It can be used with most of the PSHUF instructions for
6865 /// NB: We rely heavily on "undef" masks preserving the input lane.
6866 static SDValue getV4X86ShuffleImm8ForMask(ArrayRef<int> Mask, SDLoc DL,
6867 SelectionDAG &DAG) {
6868 assert(Mask.size() == 4 && "Only 4-lane shuffle masks");
6869 assert(Mask[0] >= -1 && Mask[0] < 4 && "Out of bound mask element!");
6870 assert(Mask[1] >= -1 && Mask[1] < 4 && "Out of bound mask element!");
6871 assert(Mask[2] >= -1 && Mask[2] < 4 && "Out of bound mask element!");
6872 assert(Mask[3] >= -1 && Mask[3] < 4 && "Out of bound mask element!");
6875 Imm |= (Mask[0] == -1 ? 0 : Mask[0]) << 0;
6876 Imm |= (Mask[1] == -1 ? 1 : Mask[1]) << 2;
6877 Imm |= (Mask[2] == -1 ? 2 : Mask[2]) << 4;
6878 Imm |= (Mask[3] == -1 ? 3 : Mask[3]) << 6;
6879 return DAG.getConstant(Imm, DL, MVT::i8);
6882 /// \brief Compute whether each element of a shuffle is zeroable.
6884 /// A "zeroable" vector shuffle element is one which can be lowered to zero.
6885 /// Either it is an undef element in the shuffle mask, the element of the input
6886 /// referenced is undef, or the element of the input referenced is known to be
6887 /// zero. Many x86 shuffles can zero lanes cheaply and we often want to handle
6888 /// as many lanes with this technique as possible to simplify the remaining
6890 static SmallBitVector computeZeroableShuffleElements(ArrayRef<int> Mask,
6891 SDValue V1, SDValue V2) {
6892 SmallBitVector Zeroable(Mask.size(), false);
6894 while (V1.getOpcode() == ISD::BITCAST)
6895 V1 = V1->getOperand(0);
6896 while (V2.getOpcode() == ISD::BITCAST)
6897 V2 = V2->getOperand(0);
6899 bool V1IsZero = ISD::isBuildVectorAllZeros(V1.getNode());
6900 bool V2IsZero = ISD::isBuildVectorAllZeros(V2.getNode());
6902 for (int i = 0, Size = Mask.size(); i < Size; ++i) {
6904 // Handle the easy cases.
6905 if (M < 0 || (M >= 0 && M < Size && V1IsZero) || (M >= Size && V2IsZero)) {
6910 // If this is an index into a build_vector node (which has the same number
6911 // of elements), dig out the input value and use it.
6912 SDValue V = M < Size ? V1 : V2;
6913 if (V.getOpcode() != ISD::BUILD_VECTOR || Size != (int)V.getNumOperands())
6916 SDValue Input = V.getOperand(M % Size);
6917 // The UNDEF opcode check really should be dead code here, but not quite
6918 // worth asserting on (it isn't invalid, just unexpected).
6919 if (Input.getOpcode() == ISD::UNDEF || X86::isZeroNode(Input))
6926 // X86 has dedicated unpack instructions that can handle specific blend
6927 // operations: UNPCKH and UNPCKL.
6928 static SDValue lowerVectorShuffleWithUNPCK(SDLoc DL, MVT VT, ArrayRef<int> Mask,
6929 SDValue V1, SDValue V2,
6930 SelectionDAG &DAG) {
6931 int NumElts = VT.getVectorNumElements();
6932 int NumEltsInLane = 128 / VT.getScalarSizeInBits();
6933 SmallVector<int, 8> Unpckl;
6934 SmallVector<int, 8> Unpckh;
6936 for (int i = 0; i < NumElts; ++i) {
6937 unsigned LaneStart = (i / NumEltsInLane) * NumEltsInLane;
6938 int LoPos = (i % NumEltsInLane) / 2 + LaneStart + NumElts * (i % 2);
6939 int HiPos = LoPos + NumEltsInLane / 2;
6940 Unpckl.push_back(LoPos);
6941 Unpckh.push_back(HiPos);
6944 if (isShuffleEquivalent(V1, V2, Mask, Unpckl))
6945 return DAG.getNode(X86ISD::UNPCKL, DL, VT, V1, V2);
6946 if (isShuffleEquivalent(V1, V2, Mask, Unpckh))
6947 return DAG.getNode(X86ISD::UNPCKH, DL, VT, V1, V2);
6949 // Commute and try again.
6950 ShuffleVectorSDNode::commuteMask(Unpckl);
6951 if (isShuffleEquivalent(V1, V2, Mask, Unpckl))
6952 return DAG.getNode(X86ISD::UNPCKL, DL, VT, V2, V1);
6954 ShuffleVectorSDNode::commuteMask(Unpckh);
6955 if (isShuffleEquivalent(V1, V2, Mask, Unpckh))
6956 return DAG.getNode(X86ISD::UNPCKH, DL, VT, V2, V1);
6961 /// \brief Try to emit a bitmask instruction for a shuffle.
6963 /// This handles cases where we can model a blend exactly as a bitmask due to
6964 /// one of the inputs being zeroable.
6965 static SDValue lowerVectorShuffleAsBitMask(SDLoc DL, MVT VT, SDValue V1,
6966 SDValue V2, ArrayRef<int> Mask,
6967 SelectionDAG &DAG) {
6968 MVT EltVT = VT.getVectorElementType();
6969 int NumEltBits = EltVT.getSizeInBits();
6970 MVT IntEltVT = MVT::getIntegerVT(NumEltBits);
6971 SDValue Zero = DAG.getConstant(0, DL, IntEltVT);
6972 SDValue AllOnes = DAG.getConstant(APInt::getAllOnesValue(NumEltBits), DL,
6974 if (EltVT.isFloatingPoint()) {
6975 Zero = DAG.getBitcast(EltVT, Zero);
6976 AllOnes = DAG.getBitcast(EltVT, AllOnes);
6978 SmallVector<SDValue, 16> VMaskOps(Mask.size(), Zero);
6979 SmallBitVector Zeroable = computeZeroableShuffleElements(Mask, V1, V2);
6981 for (int i = 0, Size = Mask.size(); i < Size; ++i) {
6984 if (Mask[i] % Size != i)
6985 return SDValue(); // Not a blend.
6987 V = Mask[i] < Size ? V1 : V2;
6988 else if (V != (Mask[i] < Size ? V1 : V2))
6989 return SDValue(); // Can only let one input through the mask.
6991 VMaskOps[i] = AllOnes;
6994 return SDValue(); // No non-zeroable elements!
6996 SDValue VMask = DAG.getNode(ISD::BUILD_VECTOR, DL, VT, VMaskOps);
6997 V = DAG.getNode(VT.isFloatingPoint()
6998 ? (unsigned) X86ISD::FAND : (unsigned) ISD::AND,
7003 /// \brief Try to emit a blend instruction for a shuffle using bit math.
7005 /// This is used as a fallback approach when first class blend instructions are
7006 /// unavailable. Currently it is only suitable for integer vectors, but could
7007 /// be generalized for floating point vectors if desirable.
7008 static SDValue lowerVectorShuffleAsBitBlend(SDLoc DL, MVT VT, SDValue V1,
7009 SDValue V2, ArrayRef<int> Mask,
7010 SelectionDAG &DAG) {
7011 assert(VT.isInteger() && "Only supports integer vector types!");
7012 MVT EltVT = VT.getVectorElementType();
7013 int NumEltBits = EltVT.getSizeInBits();
7014 SDValue Zero = DAG.getConstant(0, DL, EltVT);
7015 SDValue AllOnes = DAG.getConstant(APInt::getAllOnesValue(NumEltBits), DL,
7017 SmallVector<SDValue, 16> MaskOps;
7018 for (int i = 0, Size = Mask.size(); i < Size; ++i) {
7019 if (Mask[i] != -1 && Mask[i] != i && Mask[i] != i + Size)
7020 return SDValue(); // Shuffled input!
7021 MaskOps.push_back(Mask[i] < Size ? AllOnes : Zero);
7024 SDValue V1Mask = DAG.getNode(ISD::BUILD_VECTOR, DL, VT, MaskOps);
7025 V1 = DAG.getNode(ISD::AND, DL, VT, V1, V1Mask);
7026 // We have to cast V2 around.
7027 MVT MaskVT = MVT::getVectorVT(MVT::i64, VT.getSizeInBits() / 64);
7028 V2 = DAG.getBitcast(VT, DAG.getNode(X86ISD::ANDNP, DL, MaskVT,
7029 DAG.getBitcast(MaskVT, V1Mask),
7030 DAG.getBitcast(MaskVT, V2)));
7031 return DAG.getNode(ISD::OR, DL, VT, V1, V2);
7034 /// \brief Try to emit a blend instruction for a shuffle.
7036 /// This doesn't do any checks for the availability of instructions for blending
7037 /// these values. It relies on the availability of the X86ISD::BLENDI pattern to
7038 /// be matched in the backend with the type given. What it does check for is
7039 /// that the shuffle mask is a blend, or convertible into a blend with zero.
7040 static SDValue lowerVectorShuffleAsBlend(SDLoc DL, MVT VT, SDValue V1,
7041 SDValue V2, ArrayRef<int> Original,
7042 const X86Subtarget *Subtarget,
7043 SelectionDAG &DAG) {
7044 bool V1IsZero = ISD::isBuildVectorAllZeros(V1.getNode());
7045 bool V2IsZero = ISD::isBuildVectorAllZeros(V2.getNode());
7046 SmallVector<int, 8> Mask(Original.begin(), Original.end());
7047 SmallBitVector Zeroable = computeZeroableShuffleElements(Mask, V1, V2);
7048 bool ForceV1Zero = false, ForceV2Zero = false;
7050 // Attempt to generate the binary blend mask. If an input is zero then
7051 // we can use any lane.
7052 // TODO: generalize the zero matching to any scalar like isShuffleEquivalent.
7053 unsigned BlendMask = 0;
7054 for (int i = 0, Size = Mask.size(); i < Size; ++i) {
7060 if (M == i + Size) {
7061 BlendMask |= 1u << i;
7072 BlendMask |= 1u << i;
7077 return SDValue(); // Shuffled input!
7080 // Create a REAL zero vector - ISD::isBuildVectorAllZeros allows UNDEFs.
7082 V1 = getZeroVector(VT, Subtarget, DAG, DL);
7084 V2 = getZeroVector(VT, Subtarget, DAG, DL);
7086 auto ScaleBlendMask = [](unsigned BlendMask, int Size, int Scale) {
7087 unsigned ScaledMask = 0;
7088 for (int i = 0; i != Size; ++i)
7089 if (BlendMask & (1u << i))
7090 for (int j = 0; j != Scale; ++j)
7091 ScaledMask |= 1u << (i * Scale + j);
7095 switch (VT.SimpleTy) {
7100 return DAG.getNode(X86ISD::BLENDI, DL, VT, V1, V2,
7101 DAG.getConstant(BlendMask, DL, MVT::i8));
7105 assert(Subtarget->hasAVX2() && "256-bit integer blends require AVX2!");
7109 // If we have AVX2 it is faster to use VPBLENDD when the shuffle fits into
7110 // that instruction.
7111 if (Subtarget->hasAVX2()) {
7112 // Scale the blend by the number of 32-bit dwords per element.
7113 int Scale = VT.getScalarSizeInBits() / 32;
7114 BlendMask = ScaleBlendMask(BlendMask, Mask.size(), Scale);
7115 MVT BlendVT = VT.getSizeInBits() > 128 ? MVT::v8i32 : MVT::v4i32;
7116 V1 = DAG.getBitcast(BlendVT, V1);
7117 V2 = DAG.getBitcast(BlendVT, V2);
7118 return DAG.getBitcast(
7119 VT, DAG.getNode(X86ISD::BLENDI, DL, BlendVT, V1, V2,
7120 DAG.getConstant(BlendMask, DL, MVT::i8)));
7124 // For integer shuffles we need to expand the mask and cast the inputs to
7125 // v8i16s prior to blending.
7126 int Scale = 8 / VT.getVectorNumElements();
7127 BlendMask = ScaleBlendMask(BlendMask, Mask.size(), Scale);
7128 V1 = DAG.getBitcast(MVT::v8i16, V1);
7129 V2 = DAG.getBitcast(MVT::v8i16, V2);
7130 return DAG.getBitcast(VT,
7131 DAG.getNode(X86ISD::BLENDI, DL, MVT::v8i16, V1, V2,
7132 DAG.getConstant(BlendMask, DL, MVT::i8)));
7136 assert(Subtarget->hasAVX2() && "256-bit integer blends require AVX2!");
7137 SmallVector<int, 8> RepeatedMask;
7138 if (is128BitLaneRepeatedShuffleMask(MVT::v16i16, Mask, RepeatedMask)) {
7139 // We can lower these with PBLENDW which is mirrored across 128-bit lanes.
7140 assert(RepeatedMask.size() == 8 && "Repeated mask size doesn't match!");
7142 for (int i = 0; i < 8; ++i)
7143 if (RepeatedMask[i] >= 16)
7144 BlendMask |= 1u << i;
7145 return DAG.getNode(X86ISD::BLENDI, DL, MVT::v16i16, V1, V2,
7146 DAG.getConstant(BlendMask, DL, MVT::i8));
7152 assert((VT.is128BitVector() || Subtarget->hasAVX2()) &&
7153 "256-bit byte-blends require AVX2 support!");
7155 // Attempt to lower to a bitmask if we can. VPAND is faster than VPBLENDVB.
7156 if (SDValue Masked = lowerVectorShuffleAsBitMask(DL, VT, V1, V2, Mask, DAG))
7159 // Scale the blend by the number of bytes per element.
7160 int Scale = VT.getScalarSizeInBits() / 8;
7162 // This form of blend is always done on bytes. Compute the byte vector
7164 MVT BlendVT = MVT::getVectorVT(MVT::i8, VT.getSizeInBits() / 8);
7166 // Compute the VSELECT mask. Note that VSELECT is really confusing in the
7167 // mix of LLVM's code generator and the x86 backend. We tell the code
7168 // generator that boolean values in the elements of an x86 vector register
7169 // are -1 for true and 0 for false. We then use the LLVM semantics of 'true'
7170 // mapping a select to operand #1, and 'false' mapping to operand #2. The
7171 // reality in x86 is that vector masks (pre-AVX-512) use only the high bit
7172 // of the element (the remaining are ignored) and 0 in that high bit would
7173 // mean operand #1 while 1 in the high bit would mean operand #2. So while
7174 // the LLVM model for boolean values in vector elements gets the relevant
7175 // bit set, it is set backwards and over constrained relative to x86's
7177 SmallVector<SDValue, 32> VSELECTMask;
7178 for (int i = 0, Size = Mask.size(); i < Size; ++i)
7179 for (int j = 0; j < Scale; ++j)
7180 VSELECTMask.push_back(
7181 Mask[i] < 0 ? DAG.getUNDEF(MVT::i8)
7182 : DAG.getConstant(Mask[i] < Size ? -1 : 0, DL,
7185 V1 = DAG.getBitcast(BlendVT, V1);
7186 V2 = DAG.getBitcast(BlendVT, V2);
7187 return DAG.getBitcast(VT, DAG.getNode(ISD::VSELECT, DL, BlendVT,
7188 DAG.getNode(ISD::BUILD_VECTOR, DL,
7189 BlendVT, VSELECTMask),
7194 llvm_unreachable("Not a supported integer vector type!");
7198 /// \brief Try to lower as a blend of elements from two inputs followed by
7199 /// a single-input permutation.
7201 /// This matches the pattern where we can blend elements from two inputs and
7202 /// then reduce the shuffle to a single-input permutation.
7203 static SDValue lowerVectorShuffleAsBlendAndPermute(SDLoc DL, MVT VT, SDValue V1,
7206 SelectionDAG &DAG) {
7207 // We build up the blend mask while checking whether a blend is a viable way
7208 // to reduce the shuffle.
7209 SmallVector<int, 32> BlendMask(Mask.size(), -1);
7210 SmallVector<int, 32> PermuteMask(Mask.size(), -1);
7212 for (int i = 0, Size = Mask.size(); i < Size; ++i) {
7216 assert(Mask[i] < Size * 2 && "Shuffle input is out of bounds.");
7218 if (BlendMask[Mask[i] % Size] == -1)
7219 BlendMask[Mask[i] % Size] = Mask[i];
7220 else if (BlendMask[Mask[i] % Size] != Mask[i])
7221 return SDValue(); // Can't blend in the needed input!
7223 PermuteMask[i] = Mask[i] % Size;
7226 SDValue V = DAG.getVectorShuffle(VT, DL, V1, V2, BlendMask);
7227 return DAG.getVectorShuffle(VT, DL, V, DAG.getUNDEF(VT), PermuteMask);
7230 /// \brief Generic routine to decompose a shuffle and blend into indepndent
7231 /// blends and permutes.
7233 /// This matches the extremely common pattern for handling combined
7234 /// shuffle+blend operations on newer X86 ISAs where we have very fast blend
7235 /// operations. It will try to pick the best arrangement of shuffles and
7237 static SDValue lowerVectorShuffleAsDecomposedShuffleBlend(SDLoc DL, MVT VT,
7241 SelectionDAG &DAG) {
7242 // Shuffle the input elements into the desired positions in V1 and V2 and
7243 // blend them together.
7244 SmallVector<int, 32> V1Mask(Mask.size(), -1);
7245 SmallVector<int, 32> V2Mask(Mask.size(), -1);
7246 SmallVector<int, 32> BlendMask(Mask.size(), -1);
7247 for (int i = 0, Size = Mask.size(); i < Size; ++i)
7248 if (Mask[i] >= 0 && Mask[i] < Size) {
7249 V1Mask[i] = Mask[i];
7251 } else if (Mask[i] >= Size) {
7252 V2Mask[i] = Mask[i] - Size;
7253 BlendMask[i] = i + Size;
7256 // Try to lower with the simpler initial blend strategy unless one of the
7257 // input shuffles would be a no-op. We prefer to shuffle inputs as the
7258 // shuffle may be able to fold with a load or other benefit. However, when
7259 // we'll have to do 2x as many shuffles in order to achieve this, blending
7260 // first is a better strategy.
7261 if (!isNoopShuffleMask(V1Mask) && !isNoopShuffleMask(V2Mask))
7262 if (SDValue BlendPerm =
7263 lowerVectorShuffleAsBlendAndPermute(DL, VT, V1, V2, Mask, DAG))
7266 V1 = DAG.getVectorShuffle(VT, DL, V1, DAG.getUNDEF(VT), V1Mask);
7267 V2 = DAG.getVectorShuffle(VT, DL, V2, DAG.getUNDEF(VT), V2Mask);
7268 return DAG.getVectorShuffle(VT, DL, V1, V2, BlendMask);
7271 /// \brief Try to lower a vector shuffle as a byte rotation.
7273 /// SSSE3 has a generic PALIGNR instruction in x86 that will do an arbitrary
7274 /// byte-rotation of the concatenation of two vectors; pre-SSSE3 can use
7275 /// a PSRLDQ/PSLLDQ/POR pattern to get a similar effect. This routine will
7276 /// try to generically lower a vector shuffle through such an pattern. It
7277 /// does not check for the profitability of lowering either as PALIGNR or
7278 /// PSRLDQ/PSLLDQ/POR, only whether the mask is valid to lower in that form.
7279 /// This matches shuffle vectors that look like:
7281 /// v8i16 [11, 12, 13, 14, 15, 0, 1, 2]
7283 /// Essentially it concatenates V1 and V2, shifts right by some number of
7284 /// elements, and takes the low elements as the result. Note that while this is
7285 /// specified as a *right shift* because x86 is little-endian, it is a *left
7286 /// rotate* of the vector lanes.
7287 static SDValue lowerVectorShuffleAsByteRotate(SDLoc DL, MVT VT, SDValue V1,
7290 const X86Subtarget *Subtarget,
7291 SelectionDAG &DAG) {
7292 assert(!isNoopShuffleMask(Mask) && "We shouldn't lower no-op shuffles!");
7294 int NumElts = Mask.size();
7295 int NumLanes = VT.getSizeInBits() / 128;
7296 int NumLaneElts = NumElts / NumLanes;
7298 // We need to detect various ways of spelling a rotation:
7299 // [11, 12, 13, 14, 15, 0, 1, 2]
7300 // [-1, 12, 13, 14, -1, -1, 1, -1]
7301 // [-1, -1, -1, -1, -1, -1, 1, 2]
7302 // [ 3, 4, 5, 6, 7, 8, 9, 10]
7303 // [-1, 4, 5, 6, -1, -1, 9, -1]
7304 // [-1, 4, 5, 6, -1, -1, -1, -1]
7307 for (int l = 0; l < NumElts; l += NumLaneElts) {
7308 for (int i = 0; i < NumLaneElts; ++i) {
7309 if (Mask[l + i] == -1)
7311 assert(Mask[l + i] >= 0 && "Only -1 is a valid negative mask element!");
7313 // Get the mod-Size index and lane correct it.
7314 int LaneIdx = (Mask[l + i] % NumElts) - l;
7315 // Make sure it was in this lane.
7316 if (LaneIdx < 0 || LaneIdx >= NumLaneElts)
7319 // Determine where a rotated vector would have started.
7320 int StartIdx = i - LaneIdx;
7322 // The identity rotation isn't interesting, stop.
7325 // If we found the tail of a vector the rotation must be the missing
7326 // front. If we found the head of a vector, it must be how much of the
7328 int CandidateRotation = StartIdx < 0 ? -StartIdx : NumLaneElts - StartIdx;
7331 Rotation = CandidateRotation;
7332 else if (Rotation != CandidateRotation)
7333 // The rotations don't match, so we can't match this mask.
7336 // Compute which value this mask is pointing at.
7337 SDValue MaskV = Mask[l + i] < NumElts ? V1 : V2;
7339 // Compute which of the two target values this index should be assigned
7340 // to. This reflects whether the high elements are remaining or the low
7341 // elements are remaining.
7342 SDValue &TargetV = StartIdx < 0 ? Hi : Lo;
7344 // Either set up this value if we've not encountered it before, or check
7345 // that it remains consistent.
7348 else if (TargetV != MaskV)
7349 // This may be a rotation, but it pulls from the inputs in some
7350 // unsupported interleaving.
7355 // Check that we successfully analyzed the mask, and normalize the results.
7356 assert(Rotation != 0 && "Failed to locate a viable rotation!");
7357 assert((Lo || Hi) && "Failed to find a rotated input vector!");
7363 // The actual rotate instruction rotates bytes, so we need to scale the
7364 // rotation based on how many bytes are in the vector lane.
7365 int Scale = 16 / NumLaneElts;
7367 // SSSE3 targets can use the palignr instruction.
7368 if (Subtarget->hasSSSE3()) {
7369 // Cast the inputs to i8 vector of correct length to match PALIGNR.
7370 MVT AlignVT = MVT::getVectorVT(MVT::i8, 16 * NumLanes);
7371 Lo = DAG.getBitcast(AlignVT, Lo);
7372 Hi = DAG.getBitcast(AlignVT, Hi);
7374 return DAG.getBitcast(
7375 VT, DAG.getNode(X86ISD::PALIGNR, DL, AlignVT, Lo, Hi,
7376 DAG.getConstant(Rotation * Scale, DL, MVT::i8)));
7379 assert(VT.is128BitVector() &&
7380 "Rotate-based lowering only supports 128-bit lowering!");
7381 assert(Mask.size() <= 16 &&
7382 "Can shuffle at most 16 bytes in a 128-bit vector!");
7384 // Default SSE2 implementation
7385 int LoByteShift = 16 - Rotation * Scale;
7386 int HiByteShift = Rotation * Scale;
7388 // Cast the inputs to v2i64 to match PSLLDQ/PSRLDQ.
7389 Lo = DAG.getBitcast(MVT::v2i64, Lo);
7390 Hi = DAG.getBitcast(MVT::v2i64, Hi);
7392 SDValue LoShift = DAG.getNode(X86ISD::VSHLDQ, DL, MVT::v2i64, Lo,
7393 DAG.getConstant(LoByteShift, DL, MVT::i8));
7394 SDValue HiShift = DAG.getNode(X86ISD::VSRLDQ, DL, MVT::v2i64, Hi,
7395 DAG.getConstant(HiByteShift, DL, MVT::i8));
7396 return DAG.getBitcast(VT,
7397 DAG.getNode(ISD::OR, DL, MVT::v2i64, LoShift, HiShift));
7400 /// \brief Try to lower a vector shuffle as a bit shift (shifts in zeros).
7402 /// Attempts to match a shuffle mask against the PSLL(W/D/Q/DQ) and
7403 /// PSRL(W/D/Q/DQ) SSE2 and AVX2 logical bit-shift instructions. The function
7404 /// matches elements from one of the input vectors shuffled to the left or
7405 /// right with zeroable elements 'shifted in'. It handles both the strictly
7406 /// bit-wise element shifts and the byte shift across an entire 128-bit double
7409 /// PSHL : (little-endian) left bit shift.
7410 /// [ zz, 0, zz, 2 ]
7411 /// [ -1, 4, zz, -1 ]
7412 /// PSRL : (little-endian) right bit shift.
7414 /// [ -1, -1, 7, zz]
7415 /// PSLLDQ : (little-endian) left byte shift
7416 /// [ zz, 0, 1, 2, 3, 4, 5, 6]
7417 /// [ zz, zz, -1, -1, 2, 3, 4, -1]
7418 /// [ zz, zz, zz, zz, zz, zz, -1, 1]
7419 /// PSRLDQ : (little-endian) right byte shift
7420 /// [ 5, 6, 7, zz, zz, zz, zz, zz]
7421 /// [ -1, 5, 6, 7, zz, zz, zz, zz]
7422 /// [ 1, 2, -1, -1, -1, -1, zz, zz]
7423 static SDValue lowerVectorShuffleAsShift(SDLoc DL, MVT VT, SDValue V1,
7424 SDValue V2, ArrayRef<int> Mask,
7425 SelectionDAG &DAG) {
7426 SmallBitVector Zeroable = computeZeroableShuffleElements(Mask, V1, V2);
7428 int Size = Mask.size();
7429 assert(Size == (int)VT.getVectorNumElements() && "Unexpected mask size");
7431 auto CheckZeros = [&](int Shift, int Scale, bool Left) {
7432 for (int i = 0; i < Size; i += Scale)
7433 for (int j = 0; j < Shift; ++j)
7434 if (!Zeroable[i + j + (Left ? 0 : (Scale - Shift))])
7440 auto MatchShift = [&](int Shift, int Scale, bool Left, SDValue V) {
7441 for (int i = 0; i != Size; i += Scale) {
7442 unsigned Pos = Left ? i + Shift : i;
7443 unsigned Low = Left ? i : i + Shift;
7444 unsigned Len = Scale - Shift;
7445 if (!isSequentialOrUndefInRange(Mask, Pos, Len,
7446 Low + (V == V1 ? 0 : Size)))
7450 int ShiftEltBits = VT.getScalarSizeInBits() * Scale;
7451 bool ByteShift = ShiftEltBits > 64;
7452 unsigned OpCode = Left ? (ByteShift ? X86ISD::VSHLDQ : X86ISD::VSHLI)
7453 : (ByteShift ? X86ISD::VSRLDQ : X86ISD::VSRLI);
7454 int ShiftAmt = Shift * VT.getScalarSizeInBits() / (ByteShift ? 8 : 1);
7456 // Normalize the scale for byte shifts to still produce an i64 element
7458 Scale = ByteShift ? Scale / 2 : Scale;
7460 // We need to round trip through the appropriate type for the shift.
7461 MVT ShiftSVT = MVT::getIntegerVT(VT.getScalarSizeInBits() * Scale);
7462 MVT ShiftVT = MVT::getVectorVT(ShiftSVT, Size / Scale);
7463 assert(DAG.getTargetLoweringInfo().isTypeLegal(ShiftVT) &&
7464 "Illegal integer vector type");
7465 V = DAG.getBitcast(ShiftVT, V);
7467 V = DAG.getNode(OpCode, DL, ShiftVT, V,
7468 DAG.getConstant(ShiftAmt, DL, MVT::i8));
7469 return DAG.getBitcast(VT, V);
7472 // SSE/AVX supports logical shifts up to 64-bit integers - so we can just
7473 // keep doubling the size of the integer elements up to that. We can
7474 // then shift the elements of the integer vector by whole multiples of
7475 // their width within the elements of the larger integer vector. Test each
7476 // multiple to see if we can find a match with the moved element indices
7477 // and that the shifted in elements are all zeroable.
7478 for (int Scale = 2; Scale * VT.getScalarSizeInBits() <= 128; Scale *= 2)
7479 for (int Shift = 1; Shift != Scale; ++Shift)
7480 for (bool Left : {true, false})
7481 if (CheckZeros(Shift, Scale, Left))
7482 for (SDValue V : {V1, V2})
7483 if (SDValue Match = MatchShift(Shift, Scale, Left, V))
7490 /// \brief Try to lower a vector shuffle using SSE4a EXTRQ/INSERTQ.
7491 static SDValue lowerVectorShuffleWithSSE4A(SDLoc DL, MVT VT, SDValue V1,
7492 SDValue V2, ArrayRef<int> Mask,
7493 SelectionDAG &DAG) {
7494 SmallBitVector Zeroable = computeZeroableShuffleElements(Mask, V1, V2);
7495 assert(!Zeroable.all() && "Fully zeroable shuffle mask");
7497 int Size = Mask.size();
7498 int HalfSize = Size / 2;
7499 assert(Size == (int)VT.getVectorNumElements() && "Unexpected mask size");
7501 // Upper half must be undefined.
7502 if (!isUndefInRange(Mask, HalfSize, HalfSize))
7505 // EXTRQ: Extract Len elements from lower half of source, starting at Idx.
7506 // Remainder of lower half result is zero and upper half is all undef.
7507 auto LowerAsEXTRQ = [&]() {
7508 // Determine the extraction length from the part of the
7509 // lower half that isn't zeroable.
7511 for (; Len > 0; --Len)
7512 if (!Zeroable[Len - 1])
7514 assert(Len > 0 && "Zeroable shuffle mask");
7516 // Attempt to match first Len sequential elements from the lower half.
7519 for (int i = 0; i != Len; ++i) {
7523 SDValue &V = (M < Size ? V1 : V2);
7526 // The extracted elements must start at a valid index and all mask
7527 // elements must be in the lower half.
7528 if (i > M || M >= HalfSize)
7531 if (Idx < 0 || (Src == V && Idx == (M - i))) {
7542 assert((Idx + Len) <= HalfSize && "Illegal extraction mask");
7543 int BitLen = (Len * VT.getScalarSizeInBits()) & 0x3f;
7544 int BitIdx = (Idx * VT.getScalarSizeInBits()) & 0x3f;
7545 return DAG.getNode(X86ISD::EXTRQI, DL, VT, Src,
7546 DAG.getConstant(BitLen, DL, MVT::i8),
7547 DAG.getConstant(BitIdx, DL, MVT::i8));
7550 if (SDValue ExtrQ = LowerAsEXTRQ())
7553 // INSERTQ: Extract lowest Len elements from lower half of second source and
7554 // insert over first source, starting at Idx.
7555 // { A[0], .., A[Idx-1], B[0], .., B[Len-1], A[Idx+Len], .., UNDEF, ... }
7556 auto LowerAsInsertQ = [&]() {
7557 for (int Idx = 0; Idx != HalfSize; ++Idx) {
7560 // Attempt to match first source from mask before insertion point.
7561 if (isUndefInRange(Mask, 0, Idx)) {
7563 } else if (isSequentialOrUndefInRange(Mask, 0, Idx, 0)) {
7565 } else if (isSequentialOrUndefInRange(Mask, 0, Idx, Size)) {
7571 // Extend the extraction length looking to match both the insertion of
7572 // the second source and the remaining elements of the first.
7573 for (int Hi = Idx + 1; Hi <= HalfSize; ++Hi) {
7578 if (isSequentialOrUndefInRange(Mask, Idx, Len, 0)) {
7580 } else if (isSequentialOrUndefInRange(Mask, Idx, Len, Size)) {
7586 // Match the remaining elements of the lower half.
7587 if (isUndefInRange(Mask, Hi, HalfSize - Hi)) {
7589 } else if ((!Base || (Base == V1)) &&
7590 isSequentialOrUndefInRange(Mask, Hi, HalfSize - Hi, Hi)) {
7592 } else if ((!Base || (Base == V2)) &&
7593 isSequentialOrUndefInRange(Mask, Hi, HalfSize - Hi,
7600 // We may not have a base (first source) - this can safely be undefined.
7602 Base = DAG.getUNDEF(VT);
7604 int BitLen = (Len * VT.getScalarSizeInBits()) & 0x3f;
7605 int BitIdx = (Idx * VT.getScalarSizeInBits()) & 0x3f;
7606 return DAG.getNode(X86ISD::INSERTQI, DL, VT, Base, Insert,
7607 DAG.getConstant(BitLen, DL, MVT::i8),
7608 DAG.getConstant(BitIdx, DL, MVT::i8));
7615 if (SDValue InsertQ = LowerAsInsertQ())
7621 /// \brief Lower a vector shuffle as a zero or any extension.
7623 /// Given a specific number of elements, element bit width, and extension
7624 /// stride, produce either a zero or any extension based on the available
7625 /// features of the subtarget. The extended elements are consecutive and
7626 /// begin and can start from an offseted element index in the input; to
7627 /// avoid excess shuffling the offset must either being in the bottom lane
7628 /// or at the start of a higher lane. All extended elements must be from
7630 static SDValue lowerVectorShuffleAsSpecificZeroOrAnyExtend(
7631 SDLoc DL, MVT VT, int Scale, int Offset, bool AnyExt, SDValue InputV,
7632 ArrayRef<int> Mask, const X86Subtarget *Subtarget, SelectionDAG &DAG) {
7633 assert(Scale > 1 && "Need a scale to extend.");
7634 int EltBits = VT.getScalarSizeInBits();
7635 int NumElements = VT.getVectorNumElements();
7636 int NumEltsPerLane = 128 / EltBits;
7637 int OffsetLane = Offset / NumEltsPerLane;
7638 assert((EltBits == 8 || EltBits == 16 || EltBits == 32) &&
7639 "Only 8, 16, and 32 bit elements can be extended.");
7640 assert(Scale * EltBits <= 64 && "Cannot zero extend past 64 bits.");
7641 assert(0 <= Offset && "Extension offset must be positive.");
7642 assert((Offset < NumEltsPerLane || Offset % NumEltsPerLane == 0) &&
7643 "Extension offset must be in the first lane or start an upper lane.");
7645 // Check that an index is in same lane as the base offset.
7646 auto SafeOffset = [&](int Idx) {
7647 return OffsetLane == (Idx / NumEltsPerLane);
7650 // Shift along an input so that the offset base moves to the first element.
7651 auto ShuffleOffset = [&](SDValue V) {
7655 SmallVector<int, 8> ShMask((unsigned)NumElements, -1);
7656 for (int i = 0; i * Scale < NumElements; ++i) {
7657 int SrcIdx = i + Offset;
7658 ShMask[i] = SafeOffset(SrcIdx) ? SrcIdx : -1;
7660 return DAG.getVectorShuffle(VT, DL, V, DAG.getUNDEF(VT), ShMask);
7663 // Found a valid zext mask! Try various lowering strategies based on the
7664 // input type and available ISA extensions.
7665 if (Subtarget->hasSSE41()) {
7666 // Not worth offseting 128-bit vectors if scale == 2, a pattern using
7667 // PUNPCK will catch this in a later shuffle match.
7668 if (Offset && Scale == 2 && VT.is128BitVector())
7670 MVT ExtVT = MVT::getVectorVT(MVT::getIntegerVT(EltBits * Scale),
7671 NumElements / Scale);
7672 InputV = DAG.getNode(X86ISD::VZEXT, DL, ExtVT, ShuffleOffset(InputV));
7673 return DAG.getBitcast(VT, InputV);
7676 assert(VT.is128BitVector() && "Only 128-bit vectors can be extended.");
7678 // For any extends we can cheat for larger element sizes and use shuffle
7679 // instructions that can fold with a load and/or copy.
7680 if (AnyExt && EltBits == 32) {
7681 int PSHUFDMask[4] = {Offset, -1, SafeOffset(Offset + 1) ? Offset + 1 : -1,
7683 return DAG.getBitcast(
7684 VT, DAG.getNode(X86ISD::PSHUFD, DL, MVT::v4i32,
7685 DAG.getBitcast(MVT::v4i32, InputV),
7686 getV4X86ShuffleImm8ForMask(PSHUFDMask, DL, DAG)));
7688 if (AnyExt && EltBits == 16 && Scale > 2) {
7689 int PSHUFDMask[4] = {Offset / 2, -1,
7690 SafeOffset(Offset + 1) ? (Offset + 1) / 2 : -1, -1};
7691 InputV = DAG.getNode(X86ISD::PSHUFD, DL, MVT::v4i32,
7692 DAG.getBitcast(MVT::v4i32, InputV),
7693 getV4X86ShuffleImm8ForMask(PSHUFDMask, DL, DAG));
7694 int PSHUFWMask[4] = {1, -1, -1, -1};
7695 unsigned OddEvenOp = (Offset & 1 ? X86ISD::PSHUFLW : X86ISD::PSHUFHW);
7696 return DAG.getBitcast(
7697 VT, DAG.getNode(OddEvenOp, DL, MVT::v8i16,
7698 DAG.getBitcast(MVT::v8i16, InputV),
7699 getV4X86ShuffleImm8ForMask(PSHUFWMask, DL, DAG)));
7702 // The SSE4A EXTRQ instruction can efficiently extend the first 2 lanes
7704 if ((Scale * EltBits) == 64 && EltBits < 32 && Subtarget->hasSSE4A()) {
7705 assert(NumElements == (int)Mask.size() && "Unexpected shuffle mask size!");
7706 assert(VT.is128BitVector() && "Unexpected vector width!");
7708 int LoIdx = Offset * EltBits;
7709 SDValue Lo = DAG.getNode(ISD::BITCAST, DL, MVT::v2i64,
7710 DAG.getNode(X86ISD::EXTRQI, DL, VT, InputV,
7711 DAG.getConstant(EltBits, DL, MVT::i8),
7712 DAG.getConstant(LoIdx, DL, MVT::i8)));
7714 if (isUndefInRange(Mask, NumElements / 2, NumElements / 2) ||
7715 !SafeOffset(Offset + 1))
7716 return DAG.getNode(ISD::BITCAST, DL, VT, Lo);
7718 int HiIdx = (Offset + 1) * EltBits;
7719 SDValue Hi = DAG.getNode(ISD::BITCAST, DL, MVT::v2i64,
7720 DAG.getNode(X86ISD::EXTRQI, DL, VT, InputV,
7721 DAG.getConstant(EltBits, DL, MVT::i8),
7722 DAG.getConstant(HiIdx, DL, MVT::i8)));
7723 return DAG.getNode(ISD::BITCAST, DL, VT,
7724 DAG.getNode(X86ISD::UNPCKL, DL, MVT::v2i64, Lo, Hi));
7727 // If this would require more than 2 unpack instructions to expand, use
7728 // pshufb when available. We can only use more than 2 unpack instructions
7729 // when zero extending i8 elements which also makes it easier to use pshufb.
7730 if (Scale > 4 && EltBits == 8 && Subtarget->hasSSSE3()) {
7731 assert(NumElements == 16 && "Unexpected byte vector width!");
7732 SDValue PSHUFBMask[16];
7733 for (int i = 0; i < 16; ++i) {
7734 int Idx = Offset + (i / Scale);
7735 PSHUFBMask[i] = DAG.getConstant(
7736 (i % Scale == 0 && SafeOffset(Idx)) ? Idx : 0x80, DL, MVT::i8);
7738 InputV = DAG.getBitcast(MVT::v16i8, InputV);
7739 return DAG.getBitcast(VT,
7740 DAG.getNode(X86ISD::PSHUFB, DL, MVT::v16i8, InputV,
7741 DAG.getNode(ISD::BUILD_VECTOR, DL,
7742 MVT::v16i8, PSHUFBMask)));
7745 // If we are extending from an offset, ensure we start on a boundary that
7746 // we can unpack from.
7747 int AlignToUnpack = Offset % (NumElements / Scale);
7748 if (AlignToUnpack) {
7749 SmallVector<int, 8> ShMask((unsigned)NumElements, -1);
7750 for (int i = AlignToUnpack; i < NumElements; ++i)
7751 ShMask[i - AlignToUnpack] = i;
7752 InputV = DAG.getVectorShuffle(VT, DL, InputV, DAG.getUNDEF(VT), ShMask);
7753 Offset -= AlignToUnpack;
7756 // Otherwise emit a sequence of unpacks.
7758 unsigned UnpackLoHi = X86ISD::UNPCKL;
7759 if (Offset >= (NumElements / 2)) {
7760 UnpackLoHi = X86ISD::UNPCKH;
7761 Offset -= (NumElements / 2);
7764 MVT InputVT = MVT::getVectorVT(MVT::getIntegerVT(EltBits), NumElements);
7765 SDValue Ext = AnyExt ? DAG.getUNDEF(InputVT)
7766 : getZeroVector(InputVT, Subtarget, DAG, DL);
7767 InputV = DAG.getBitcast(InputVT, InputV);
7768 InputV = DAG.getNode(UnpackLoHi, DL, InputVT, InputV, Ext);
7772 } while (Scale > 1);
7773 return DAG.getBitcast(VT, InputV);
7776 /// \brief Try to lower a vector shuffle as a zero extension on any microarch.
7778 /// This routine will try to do everything in its power to cleverly lower
7779 /// a shuffle which happens to match the pattern of a zero extend. It doesn't
7780 /// check for the profitability of this lowering, it tries to aggressively
7781 /// match this pattern. It will use all of the micro-architectural details it
7782 /// can to emit an efficient lowering. It handles both blends with all-zero
7783 /// inputs to explicitly zero-extend and undef-lanes (sometimes undef due to
7784 /// masking out later).
7786 /// The reason we have dedicated lowering for zext-style shuffles is that they
7787 /// are both incredibly common and often quite performance sensitive.
7788 static SDValue lowerVectorShuffleAsZeroOrAnyExtend(
7789 SDLoc DL, MVT VT, SDValue V1, SDValue V2, ArrayRef<int> Mask,
7790 const X86Subtarget *Subtarget, SelectionDAG &DAG) {
7791 SmallBitVector Zeroable = computeZeroableShuffleElements(Mask, V1, V2);
7793 int Bits = VT.getSizeInBits();
7794 int NumLanes = Bits / 128;
7795 int NumElements = VT.getVectorNumElements();
7796 int NumEltsPerLane = NumElements / NumLanes;
7797 assert(VT.getScalarSizeInBits() <= 32 &&
7798 "Exceeds 32-bit integer zero extension limit");
7799 assert((int)Mask.size() == NumElements && "Unexpected shuffle mask size");
7801 // Define a helper function to check a particular ext-scale and lower to it if
7803 auto Lower = [&](int Scale) -> SDValue {
7808 for (int i = 0; i < NumElements; ++i) {
7811 continue; // Valid anywhere but doesn't tell us anything.
7812 if (i % Scale != 0) {
7813 // Each of the extended elements need to be zeroable.
7817 // We no longer are in the anyext case.
7822 // Each of the base elements needs to be consecutive indices into the
7823 // same input vector.
7824 SDValue V = M < NumElements ? V1 : V2;
7825 M = M % NumElements;
7828 Offset = M - (i / Scale);
7829 } else if (InputV != V)
7830 return SDValue(); // Flip-flopping inputs.
7832 // Offset must start in the lowest 128-bit lane or at the start of an
7834 // FIXME: Is it ever worth allowing a negative base offset?
7835 if (!((0 <= Offset && Offset < NumEltsPerLane) ||
7836 (Offset % NumEltsPerLane) == 0))
7839 // If we are offsetting, all referenced entries must come from the same
7841 if (Offset && (Offset / NumEltsPerLane) != (M / NumEltsPerLane))
7844 if ((M % NumElements) != (Offset + (i / Scale)))
7845 return SDValue(); // Non-consecutive strided elements.
7849 // If we fail to find an input, we have a zero-shuffle which should always
7850 // have already been handled.
7851 // FIXME: Maybe handle this here in case during blending we end up with one?
7855 // If we are offsetting, don't extend if we only match a single input, we
7856 // can always do better by using a basic PSHUF or PUNPCK.
7857 if (Offset != 0 && Matches < 2)
7860 return lowerVectorShuffleAsSpecificZeroOrAnyExtend(
7861 DL, VT, Scale, Offset, AnyExt, InputV, Mask, Subtarget, DAG);
7864 // The widest scale possible for extending is to a 64-bit integer.
7865 assert(Bits % 64 == 0 &&
7866 "The number of bits in a vector must be divisible by 64 on x86!");
7867 int NumExtElements = Bits / 64;
7869 // Each iteration, try extending the elements half as much, but into twice as
7871 for (; NumExtElements < NumElements; NumExtElements *= 2) {
7872 assert(NumElements % NumExtElements == 0 &&
7873 "The input vector size must be divisible by the extended size.");
7874 if (SDValue V = Lower(NumElements / NumExtElements))
7878 // General extends failed, but 128-bit vectors may be able to use MOVQ.
7882 // Returns one of the source operands if the shuffle can be reduced to a
7883 // MOVQ, copying the lower 64-bits and zero-extending to the upper 64-bits.
7884 auto CanZExtLowHalf = [&]() {
7885 for (int i = NumElements / 2; i != NumElements; ++i)
7888 if (isSequentialOrUndefInRange(Mask, 0, NumElements / 2, 0))
7890 if (isSequentialOrUndefInRange(Mask, 0, NumElements / 2, NumElements))
7895 if (SDValue V = CanZExtLowHalf()) {
7896 V = DAG.getBitcast(MVT::v2i64, V);
7897 V = DAG.getNode(X86ISD::VZEXT_MOVL, DL, MVT::v2i64, V);
7898 return DAG.getBitcast(VT, V);
7901 // No viable ext lowering found.
7905 /// \brief Try to get a scalar value for a specific element of a vector.
7907 /// Looks through BUILD_VECTOR and SCALAR_TO_VECTOR nodes to find a scalar.
7908 static SDValue getScalarValueForVectorElement(SDValue V, int Idx,
7909 SelectionDAG &DAG) {
7910 MVT VT = V.getSimpleValueType();
7911 MVT EltVT = VT.getVectorElementType();
7912 while (V.getOpcode() == ISD::BITCAST)
7913 V = V.getOperand(0);
7914 // If the bitcasts shift the element size, we can't extract an equivalent
7916 MVT NewVT = V.getSimpleValueType();
7917 if (!NewVT.isVector() || NewVT.getScalarSizeInBits() != VT.getScalarSizeInBits())
7920 if (V.getOpcode() == ISD::BUILD_VECTOR ||
7921 (Idx == 0 && V.getOpcode() == ISD::SCALAR_TO_VECTOR)) {
7922 // Ensure the scalar operand is the same size as the destination.
7923 // FIXME: Add support for scalar truncation where possible.
7924 SDValue S = V.getOperand(Idx);
7925 if (EltVT.getSizeInBits() == S.getSimpleValueType().getSizeInBits())
7926 return DAG.getNode(ISD::BITCAST, SDLoc(V), EltVT, S);
7932 /// \brief Helper to test for a load that can be folded with x86 shuffles.
7934 /// This is particularly important because the set of instructions varies
7935 /// significantly based on whether the operand is a load or not.
7936 static bool isShuffleFoldableLoad(SDValue V) {
7937 while (V.getOpcode() == ISD::BITCAST)
7938 V = V.getOperand(0);
7940 return ISD::isNON_EXTLoad(V.getNode());
7943 /// \brief Try to lower insertion of a single element into a zero vector.
7945 /// This is a common pattern that we have especially efficient patterns to lower
7946 /// across all subtarget feature sets.
7947 static SDValue lowerVectorShuffleAsElementInsertion(
7948 SDLoc DL, MVT VT, SDValue V1, SDValue V2, ArrayRef<int> Mask,
7949 const X86Subtarget *Subtarget, SelectionDAG &DAG) {
7950 SmallBitVector Zeroable = computeZeroableShuffleElements(Mask, V1, V2);
7952 MVT EltVT = VT.getVectorElementType();
7954 int V2Index = std::find_if(Mask.begin(), Mask.end(),
7955 [&Mask](int M) { return M >= (int)Mask.size(); }) -
7957 bool IsV1Zeroable = true;
7958 for (int i = 0, Size = Mask.size(); i < Size; ++i)
7959 if (i != V2Index && !Zeroable[i]) {
7960 IsV1Zeroable = false;
7964 // Check for a single input from a SCALAR_TO_VECTOR node.
7965 // FIXME: All of this should be canonicalized into INSERT_VECTOR_ELT and
7966 // all the smarts here sunk into that routine. However, the current
7967 // lowering of BUILD_VECTOR makes that nearly impossible until the old
7968 // vector shuffle lowering is dead.
7969 SDValue V2S = getScalarValueForVectorElement(V2, Mask[V2Index] - Mask.size(),
7971 if (V2S && DAG.getTargetLoweringInfo().isTypeLegal(V2S.getValueType())) {
7972 // We need to zext the scalar if it is smaller than an i32.
7973 V2S = DAG.getBitcast(EltVT, V2S);
7974 if (EltVT == MVT::i8 || EltVT == MVT::i16) {
7975 // Using zext to expand a narrow element won't work for non-zero
7980 // Zero-extend directly to i32.
7982 V2S = DAG.getNode(ISD::ZERO_EXTEND, DL, MVT::i32, V2S);
7984 V2 = DAG.getNode(ISD::SCALAR_TO_VECTOR, DL, ExtVT, V2S);
7985 } else if (Mask[V2Index] != (int)Mask.size() || EltVT == MVT::i8 ||
7986 EltVT == MVT::i16) {
7987 // Either not inserting from the low element of the input or the input
7988 // element size is too small to use VZEXT_MOVL to clear the high bits.
7992 if (!IsV1Zeroable) {
7993 // If V1 can't be treated as a zero vector we have fewer options to lower
7994 // this. We can't support integer vectors or non-zero targets cheaply, and
7995 // the V1 elements can't be permuted in any way.
7996 assert(VT == ExtVT && "Cannot change extended type when non-zeroable!");
7997 if (!VT.isFloatingPoint() || V2Index != 0)
7999 SmallVector<int, 8> V1Mask(Mask.begin(), Mask.end());
8000 V1Mask[V2Index] = -1;
8001 if (!isNoopShuffleMask(V1Mask))
8003 // This is essentially a special case blend operation, but if we have
8004 // general purpose blend operations, they are always faster. Bail and let
8005 // the rest of the lowering handle these as blends.
8006 if (Subtarget->hasSSE41())
8009 // Otherwise, use MOVSD or MOVSS.
8010 assert((EltVT == MVT::f32 || EltVT == MVT::f64) &&
8011 "Only two types of floating point element types to handle!");
8012 return DAG.getNode(EltVT == MVT::f32 ? X86ISD::MOVSS : X86ISD::MOVSD, DL,
8016 // This lowering only works for the low element with floating point vectors.
8017 if (VT.isFloatingPoint() && V2Index != 0)
8020 V2 = DAG.getNode(X86ISD::VZEXT_MOVL, DL, ExtVT, V2);
8022 V2 = DAG.getBitcast(VT, V2);
8025 // If we have 4 or fewer lanes we can cheaply shuffle the element into
8026 // the desired position. Otherwise it is more efficient to do a vector
8027 // shift left. We know that we can do a vector shift left because all
8028 // the inputs are zero.
8029 if (VT.isFloatingPoint() || VT.getVectorNumElements() <= 4) {
8030 SmallVector<int, 4> V2Shuffle(Mask.size(), 1);
8031 V2Shuffle[V2Index] = 0;
8032 V2 = DAG.getVectorShuffle(VT, DL, V2, DAG.getUNDEF(VT), V2Shuffle);
8034 V2 = DAG.getBitcast(MVT::v2i64, V2);
8036 X86ISD::VSHLDQ, DL, MVT::v2i64, V2,
8037 DAG.getConstant(V2Index * EltVT.getSizeInBits() / 8, DL,
8038 DAG.getTargetLoweringInfo().getScalarShiftAmountTy(
8039 DAG.getDataLayout(), VT)));
8040 V2 = DAG.getBitcast(VT, V2);
8046 /// \brief Try to lower broadcast of a single - truncated - integer element,
8047 /// coming from a scalar_to_vector/build_vector node \p V0 with larger elements.
8049 /// This assumes we have AVX2.
8050 static SDValue lowerVectorShuffleAsTruncBroadcast(SDLoc DL, MVT VT, SDValue V0,
8052 const X86Subtarget *Subtarget,
8053 SelectionDAG &DAG) {
8054 assert(Subtarget->hasAVX2() &&
8055 "We can only lower integer broadcasts with AVX2!");
8057 EVT EltVT = VT.getVectorElementType();
8058 EVT V0VT = V0.getValueType();
8060 assert(VT.isInteger() && "Unexpected non-integer trunc broadcast!");
8061 assert(V0VT.isVector() && "Unexpected non-vector vector-sized value!");
8063 EVT V0EltVT = V0VT.getVectorElementType();
8064 if (!V0EltVT.isInteger())
8067 const unsigned EltSize = EltVT.getSizeInBits();
8068 const unsigned V0EltSize = V0EltVT.getSizeInBits();
8070 // This is only a truncation if the original element type is larger.
8071 if (V0EltSize <= EltSize)
8074 assert(((V0EltSize % EltSize) == 0) &&
8075 "Scalar type sizes must all be powers of 2 on x86!");
8077 const unsigned V0Opc = V0.getOpcode();
8078 const unsigned Scale = V0EltSize / EltSize;
8079 const unsigned V0BroadcastIdx = BroadcastIdx / Scale;
8081 if ((V0Opc != ISD::SCALAR_TO_VECTOR || V0BroadcastIdx != 0) &&
8082 V0Opc != ISD::BUILD_VECTOR)
8085 SDValue Scalar = V0.getOperand(V0BroadcastIdx);
8087 // If we're extracting non-least-significant bits, shift so we can truncate.
8088 // Hopefully, we can fold away the trunc/srl/load into the broadcast.
8089 // Even if we can't (and !isShuffleFoldableLoad(Scalar)), prefer
8090 // vpbroadcast+vmovd+shr to vpshufb(m)+vmovd.
8091 if (const int OffsetIdx = BroadcastIdx % Scale)
8092 Scalar = DAG.getNode(ISD::SRL, DL, Scalar.getValueType(), Scalar,
8093 DAG.getConstant(OffsetIdx * EltSize, DL, Scalar.getValueType()));
8095 return DAG.getNode(X86ISD::VBROADCAST, DL, VT,
8096 DAG.getNode(ISD::TRUNCATE, DL, EltVT, Scalar));
8099 /// \brief Try to lower broadcast of a single element.
8101 /// For convenience, this code also bundles all of the subtarget feature set
8102 /// filtering. While a little annoying to re-dispatch on type here, there isn't
8103 /// a convenient way to factor it out.
8104 /// FIXME: This is very similar to LowerVectorBroadcast - can we merge them?
8105 static SDValue lowerVectorShuffleAsBroadcast(SDLoc DL, MVT VT, SDValue V,
8107 const X86Subtarget *Subtarget,
8108 SelectionDAG &DAG) {
8109 if (!Subtarget->hasAVX())
8111 if (VT.isInteger() && !Subtarget->hasAVX2())
8114 // Check that the mask is a broadcast.
8115 int BroadcastIdx = -1;
8117 if (M >= 0 && BroadcastIdx == -1)
8119 else if (M >= 0 && M != BroadcastIdx)
8122 assert(BroadcastIdx < (int)Mask.size() && "We only expect to be called with "
8123 "a sorted mask where the broadcast "
8126 // Go up the chain of (vector) values to find a scalar load that we can
8127 // combine with the broadcast.
8129 switch (V.getOpcode()) {
8130 case ISD::CONCAT_VECTORS: {
8131 int OperandSize = Mask.size() / V.getNumOperands();
8132 V = V.getOperand(BroadcastIdx / OperandSize);
8133 BroadcastIdx %= OperandSize;
8137 case ISD::INSERT_SUBVECTOR: {
8138 SDValue VOuter = V.getOperand(0), VInner = V.getOperand(1);
8139 auto ConstantIdx = dyn_cast<ConstantSDNode>(V.getOperand(2));
8143 int BeginIdx = (int)ConstantIdx->getZExtValue();
8145 BeginIdx + (int)VInner.getSimpleValueType().getVectorNumElements();
8146 if (BroadcastIdx >= BeginIdx && BroadcastIdx < EndIdx) {
8147 BroadcastIdx -= BeginIdx;
8158 // Check if this is a broadcast of a scalar. We special case lowering
8159 // for scalars so that we can more effectively fold with loads.
8160 // First, look through bitcast: if the original value has a larger element
8161 // type than the shuffle, the broadcast element is in essence truncated.
8162 // Make that explicit to ease folding.
8163 if (V.getOpcode() == ISD::BITCAST && VT.isInteger())
8164 if (SDValue TruncBroadcast = lowerVectorShuffleAsTruncBroadcast(
8165 DL, VT, V.getOperand(0), BroadcastIdx, Subtarget, DAG))
8166 return TruncBroadcast;
8168 // Also check the simpler case, where we can directly reuse the scalar.
8169 if (V.getOpcode() == ISD::BUILD_VECTOR ||
8170 (V.getOpcode() == ISD::SCALAR_TO_VECTOR && BroadcastIdx == 0)) {
8171 V = V.getOperand(BroadcastIdx);
8173 // If the scalar isn't a load, we can't broadcast from it in AVX1.
8174 // Only AVX2 has register broadcasts.
8175 if (!Subtarget->hasAVX2() && !isShuffleFoldableLoad(V))
8177 } else if (MayFoldLoad(V) && !cast<LoadSDNode>(V)->isVolatile()) {
8178 // If we are broadcasting a load that is only used by the shuffle
8179 // then we can reduce the vector load to the broadcasted scalar load.
8180 LoadSDNode *Ld = cast<LoadSDNode>(V);
8181 SDValue BaseAddr = Ld->getOperand(1);
8182 EVT AddrVT = BaseAddr.getValueType();
8183 EVT SVT = VT.getScalarType();
8184 unsigned Offset = BroadcastIdx * SVT.getStoreSize();
8185 SDValue NewAddr = DAG.getNode(
8186 ISD::ADD, DL, AddrVT, BaseAddr,
8187 DAG.getConstant(Offset, DL, AddrVT));
8188 V = DAG.getLoad(SVT, DL, Ld->getChain(), NewAddr,
8189 DAG.getMachineFunction().getMachineMemOperand(
8190 Ld->getMemOperand(), Offset, SVT.getStoreSize()));
8191 } else if (BroadcastIdx != 0 || !Subtarget->hasAVX2()) {
8192 // We can't broadcast from a vector register without AVX2, and we can only
8193 // broadcast from the zero-element of a vector register.
8197 return DAG.getNode(X86ISD::VBROADCAST, DL, VT, V);
8200 // Check for whether we can use INSERTPS to perform the shuffle. We only use
8201 // INSERTPS when the V1 elements are already in the correct locations
8202 // because otherwise we can just always use two SHUFPS instructions which
8203 // are much smaller to encode than a SHUFPS and an INSERTPS. We can also
8204 // perform INSERTPS if a single V1 element is out of place and all V2
8205 // elements are zeroable.
8206 static SDValue lowerVectorShuffleAsInsertPS(SDValue Op, SDValue V1, SDValue V2,
8208 SelectionDAG &DAG) {
8209 assert(Op.getSimpleValueType() == MVT::v4f32 && "Bad shuffle type!");
8210 assert(V1.getSimpleValueType() == MVT::v4f32 && "Bad operand type!");
8211 assert(V2.getSimpleValueType() == MVT::v4f32 && "Bad operand type!");
8212 assert(Mask.size() == 4 && "Unexpected mask size for v4 shuffle!");
8214 SmallBitVector Zeroable = computeZeroableShuffleElements(Mask, V1, V2);
8217 int V1DstIndex = -1;
8218 int V2DstIndex = -1;
8219 bool V1UsedInPlace = false;
8221 for (int i = 0; i < 4; ++i) {
8222 // Synthesize a zero mask from the zeroable elements (includes undefs).
8228 // Flag if we use any V1 inputs in place.
8230 V1UsedInPlace = true;
8234 // We can only insert a single non-zeroable element.
8235 if (V1DstIndex != -1 || V2DstIndex != -1)
8239 // V1 input out of place for insertion.
8242 // V2 input for insertion.
8247 // Don't bother if we have no (non-zeroable) element for insertion.
8248 if (V1DstIndex == -1 && V2DstIndex == -1)
8251 // Determine element insertion src/dst indices. The src index is from the
8252 // start of the inserted vector, not the start of the concatenated vector.
8253 unsigned V2SrcIndex = 0;
8254 if (V1DstIndex != -1) {
8255 // If we have a V1 input out of place, we use V1 as the V2 element insertion
8256 // and don't use the original V2 at all.
8257 V2SrcIndex = Mask[V1DstIndex];
8258 V2DstIndex = V1DstIndex;
8261 V2SrcIndex = Mask[V2DstIndex] - 4;
8264 // If no V1 inputs are used in place, then the result is created only from
8265 // the zero mask and the V2 insertion - so remove V1 dependency.
8267 V1 = DAG.getUNDEF(MVT::v4f32);
8269 unsigned InsertPSMask = V2SrcIndex << 6 | V2DstIndex << 4 | ZMask;
8270 assert((InsertPSMask & ~0xFFu) == 0 && "Invalid mask!");
8272 // Insert the V2 element into the desired position.
8274 return DAG.getNode(X86ISD::INSERTPS, DL, MVT::v4f32, V1, V2,
8275 DAG.getConstant(InsertPSMask, DL, MVT::i8));
8278 /// \brief Try to lower a shuffle as a permute of the inputs followed by an
8279 /// UNPCK instruction.
8281 /// This specifically targets cases where we end up with alternating between
8282 /// the two inputs, and so can permute them into something that feeds a single
8283 /// UNPCK instruction. Note that this routine only targets integer vectors
8284 /// because for floating point vectors we have a generalized SHUFPS lowering
8285 /// strategy that handles everything that doesn't *exactly* match an unpack,
8286 /// making this clever lowering unnecessary.
8287 static SDValue lowerVectorShuffleAsPermuteAndUnpack(SDLoc DL, MVT VT,
8288 SDValue V1, SDValue V2,
8290 SelectionDAG &DAG) {
8291 assert(!VT.isFloatingPoint() &&
8292 "This routine only supports integer vectors.");
8293 assert(!isSingleInputShuffleMask(Mask) &&
8294 "This routine should only be used when blending two inputs.");
8295 assert(Mask.size() >= 2 && "Single element masks are invalid.");
8297 int Size = Mask.size();
8299 int NumLoInputs = std::count_if(Mask.begin(), Mask.end(), [Size](int M) {
8300 return M >= 0 && M % Size < Size / 2;
8302 int NumHiInputs = std::count_if(
8303 Mask.begin(), Mask.end(), [Size](int M) { return M % Size >= Size / 2; });
8305 bool UnpackLo = NumLoInputs >= NumHiInputs;
8307 auto TryUnpack = [&](MVT UnpackVT, int Scale) {
8308 SmallVector<int, 32> V1Mask(Mask.size(), -1);
8309 SmallVector<int, 32> V2Mask(Mask.size(), -1);
8311 for (int i = 0; i < Size; ++i) {
8315 // Each element of the unpack contains Scale elements from this mask.
8316 int UnpackIdx = i / Scale;
8318 // We only handle the case where V1 feeds the first slots of the unpack.
8319 // We rely on canonicalization to ensure this is the case.
8320 if ((UnpackIdx % 2 == 0) != (Mask[i] < Size))
8323 // Setup the mask for this input. The indexing is tricky as we have to
8324 // handle the unpack stride.
8325 SmallVectorImpl<int> &VMask = (UnpackIdx % 2 == 0) ? V1Mask : V2Mask;
8326 VMask[(UnpackIdx / 2) * Scale + i % Scale + (UnpackLo ? 0 : Size / 2)] =
8330 // If we will have to shuffle both inputs to use the unpack, check whether
8331 // we can just unpack first and shuffle the result. If so, skip this unpack.
8332 if ((NumLoInputs == 0 || NumHiInputs == 0) && !isNoopShuffleMask(V1Mask) &&
8333 !isNoopShuffleMask(V2Mask))
8336 // Shuffle the inputs into place.
8337 V1 = DAG.getVectorShuffle(VT, DL, V1, DAG.getUNDEF(VT), V1Mask);
8338 V2 = DAG.getVectorShuffle(VT, DL, V2, DAG.getUNDEF(VT), V2Mask);
8340 // Cast the inputs to the type we will use to unpack them.
8341 V1 = DAG.getBitcast(UnpackVT, V1);
8342 V2 = DAG.getBitcast(UnpackVT, V2);
8344 // Unpack the inputs and cast the result back to the desired type.
8345 return DAG.getBitcast(
8346 VT, DAG.getNode(UnpackLo ? X86ISD::UNPCKL : X86ISD::UNPCKH, DL,
8350 // We try each unpack from the largest to the smallest to try and find one
8351 // that fits this mask.
8352 int OrigNumElements = VT.getVectorNumElements();
8353 int OrigScalarSize = VT.getScalarSizeInBits();
8354 for (int ScalarSize = 64; ScalarSize >= OrigScalarSize; ScalarSize /= 2) {
8355 int Scale = ScalarSize / OrigScalarSize;
8356 int NumElements = OrigNumElements / Scale;
8357 MVT UnpackVT = MVT::getVectorVT(MVT::getIntegerVT(ScalarSize), NumElements);
8358 if (SDValue Unpack = TryUnpack(UnpackVT, Scale))
8362 // If none of the unpack-rooted lowerings worked (or were profitable) try an
8364 if (NumLoInputs == 0 || NumHiInputs == 0) {
8365 assert((NumLoInputs > 0 || NumHiInputs > 0) &&
8366 "We have to have *some* inputs!");
8367 int HalfOffset = NumLoInputs == 0 ? Size / 2 : 0;
8369 // FIXME: We could consider the total complexity of the permute of each
8370 // possible unpacking. Or at the least we should consider how many
8371 // half-crossings are created.
8372 // FIXME: We could consider commuting the unpacks.
8374 SmallVector<int, 32> PermMask;
8375 PermMask.assign(Size, -1);
8376 for (int i = 0; i < Size; ++i) {
8380 assert(Mask[i] % Size >= HalfOffset && "Found input from wrong half!");
8383 2 * ((Mask[i] % Size) - HalfOffset) + (Mask[i] < Size ? 0 : 1);
8385 return DAG.getVectorShuffle(
8386 VT, DL, DAG.getNode(NumLoInputs == 0 ? X86ISD::UNPCKH : X86ISD::UNPCKL,
8388 DAG.getUNDEF(VT), PermMask);
8394 /// \brief Handle lowering of 2-lane 64-bit floating point shuffles.
8396 /// This is the basis function for the 2-lane 64-bit shuffles as we have full
8397 /// support for floating point shuffles but not integer shuffles. These
8398 /// instructions will incur a domain crossing penalty on some chips though so
8399 /// it is better to avoid lowering through this for integer vectors where
8401 static SDValue lowerV2F64VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
8402 const X86Subtarget *Subtarget,
8403 SelectionDAG &DAG) {
8405 assert(Op.getSimpleValueType() == MVT::v2f64 && "Bad shuffle type!");
8406 assert(V1.getSimpleValueType() == MVT::v2f64 && "Bad operand type!");
8407 assert(V2.getSimpleValueType() == MVT::v2f64 && "Bad operand type!");
8408 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
8409 ArrayRef<int> Mask = SVOp->getMask();
8410 assert(Mask.size() == 2 && "Unexpected mask size for v2 shuffle!");
8412 if (isSingleInputShuffleMask(Mask)) {
8413 // Use low duplicate instructions for masks that match their pattern.
8414 if (Subtarget->hasSSE3())
8415 if (isShuffleEquivalent(V1, V2, Mask, {0, 0}))
8416 return DAG.getNode(X86ISD::MOVDDUP, DL, MVT::v2f64, V1);
8418 // Straight shuffle of a single input vector. Simulate this by using the
8419 // single input as both of the "inputs" to this instruction..
8420 unsigned SHUFPDMask = (Mask[0] == 1) | ((Mask[1] == 1) << 1);
8422 if (Subtarget->hasAVX()) {
8423 // If we have AVX, we can use VPERMILPS which will allow folding a load
8424 // into the shuffle.
8425 return DAG.getNode(X86ISD::VPERMILPI, DL, MVT::v2f64, V1,
8426 DAG.getConstant(SHUFPDMask, DL, MVT::i8));
8429 return DAG.getNode(X86ISD::SHUFP, DL, MVT::v2f64, V1, V1,
8430 DAG.getConstant(SHUFPDMask, DL, MVT::i8));
8432 assert(Mask[0] >= 0 && Mask[0] < 2 && "Non-canonicalized blend!");
8433 assert(Mask[1] >= 2 && "Non-canonicalized blend!");
8435 // If we have a single input, insert that into V1 if we can do so cheaply.
8436 if ((Mask[0] >= 2) + (Mask[1] >= 2) == 1) {
8437 if (SDValue Insertion = lowerVectorShuffleAsElementInsertion(
8438 DL, MVT::v2f64, V1, V2, Mask, Subtarget, DAG))
8440 // Try inverting the insertion since for v2 masks it is easy to do and we
8441 // can't reliably sort the mask one way or the other.
8442 int InverseMask[2] = {Mask[0] < 0 ? -1 : (Mask[0] ^ 2),
8443 Mask[1] < 0 ? -1 : (Mask[1] ^ 2)};
8444 if (SDValue Insertion = lowerVectorShuffleAsElementInsertion(
8445 DL, MVT::v2f64, V2, V1, InverseMask, Subtarget, DAG))
8449 // Try to use one of the special instruction patterns to handle two common
8450 // blend patterns if a zero-blend above didn't work.
8451 if (isShuffleEquivalent(V1, V2, Mask, {0, 3}) ||
8452 isShuffleEquivalent(V1, V2, Mask, {1, 3}))
8453 if (SDValue V1S = getScalarValueForVectorElement(V1, Mask[0], DAG))
8454 // We can either use a special instruction to load over the low double or
8455 // to move just the low double.
8457 isShuffleFoldableLoad(V1S) ? X86ISD::MOVLPD : X86ISD::MOVSD,
8459 DAG.getNode(ISD::SCALAR_TO_VECTOR, DL, MVT::v2f64, V1S));
8461 if (Subtarget->hasSSE41())
8462 if (SDValue Blend = lowerVectorShuffleAsBlend(DL, MVT::v2f64, V1, V2, Mask,
8466 // Use dedicated unpack instructions for masks that match their pattern.
8468 lowerVectorShuffleWithUNPCK(DL, MVT::v2f64, Mask, V1, V2, DAG))
8471 unsigned SHUFPDMask = (Mask[0] == 1) | (((Mask[1] - 2) == 1) << 1);
8472 return DAG.getNode(X86ISD::SHUFP, DL, MVT::v2f64, V1, V2,
8473 DAG.getConstant(SHUFPDMask, DL, MVT::i8));
8476 /// \brief Handle lowering of 2-lane 64-bit integer shuffles.
8478 /// Tries to lower a 2-lane 64-bit shuffle using shuffle operations provided by
8479 /// the integer unit to minimize domain crossing penalties. However, for blends
8480 /// it falls back to the floating point shuffle operation with appropriate bit
8482 static SDValue lowerV2I64VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
8483 const X86Subtarget *Subtarget,
8484 SelectionDAG &DAG) {
8486 assert(Op.getSimpleValueType() == MVT::v2i64 && "Bad shuffle type!");
8487 assert(V1.getSimpleValueType() == MVT::v2i64 && "Bad operand type!");
8488 assert(V2.getSimpleValueType() == MVT::v2i64 && "Bad operand type!");
8489 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
8490 ArrayRef<int> Mask = SVOp->getMask();
8491 assert(Mask.size() == 2 && "Unexpected mask size for v2 shuffle!");
8493 if (isSingleInputShuffleMask(Mask)) {
8494 // Check for being able to broadcast a single element.
8495 if (SDValue Broadcast = lowerVectorShuffleAsBroadcast(DL, MVT::v2i64, V1,
8496 Mask, Subtarget, DAG))
8499 // Straight shuffle of a single input vector. For everything from SSE2
8500 // onward this has a single fast instruction with no scary immediates.
8501 // We have to map the mask as it is actually a v4i32 shuffle instruction.
8502 V1 = DAG.getBitcast(MVT::v4i32, V1);
8503 int WidenedMask[4] = {
8504 std::max(Mask[0], 0) * 2, std::max(Mask[0], 0) * 2 + 1,
8505 std::max(Mask[1], 0) * 2, std::max(Mask[1], 0) * 2 + 1};
8506 return DAG.getBitcast(
8508 DAG.getNode(X86ISD::PSHUFD, DL, MVT::v4i32, V1,
8509 getV4X86ShuffleImm8ForMask(WidenedMask, DL, DAG)));
8511 assert(Mask[0] != -1 && "No undef lanes in multi-input v2 shuffles!");
8512 assert(Mask[1] != -1 && "No undef lanes in multi-input v2 shuffles!");
8513 assert(Mask[0] < 2 && "We sort V1 to be the first input.");
8514 assert(Mask[1] >= 2 && "We sort V2 to be the second input.");
8516 // If we have a blend of two PACKUS operations an the blend aligns with the
8517 // low and half halves, we can just merge the PACKUS operations. This is
8518 // particularly important as it lets us merge shuffles that this routine itself
8520 auto GetPackNode = [](SDValue V) {
8521 while (V.getOpcode() == ISD::BITCAST)
8522 V = V.getOperand(0);
8524 return V.getOpcode() == X86ISD::PACKUS ? V : SDValue();
8526 if (SDValue V1Pack = GetPackNode(V1))
8527 if (SDValue V2Pack = GetPackNode(V2))
8528 return DAG.getBitcast(MVT::v2i64,
8529 DAG.getNode(X86ISD::PACKUS, DL, MVT::v16i8,
8530 Mask[0] == 0 ? V1Pack.getOperand(0)
8531 : V1Pack.getOperand(1),
8532 Mask[1] == 2 ? V2Pack.getOperand(0)
8533 : V2Pack.getOperand(1)));
8535 // Try to use shift instructions.
8537 lowerVectorShuffleAsShift(DL, MVT::v2i64, V1, V2, Mask, DAG))
8540 // When loading a scalar and then shuffling it into a vector we can often do
8541 // the insertion cheaply.
8542 if (SDValue Insertion = lowerVectorShuffleAsElementInsertion(
8543 DL, MVT::v2i64, V1, V2, Mask, Subtarget, DAG))
8545 // Try inverting the insertion since for v2 masks it is easy to do and we
8546 // can't reliably sort the mask one way or the other.
8547 int InverseMask[2] = {Mask[0] ^ 2, Mask[1] ^ 2};
8548 if (SDValue Insertion = lowerVectorShuffleAsElementInsertion(
8549 DL, MVT::v2i64, V2, V1, InverseMask, Subtarget, DAG))
8552 // We have different paths for blend lowering, but they all must use the
8553 // *exact* same predicate.
8554 bool IsBlendSupported = Subtarget->hasSSE41();
8555 if (IsBlendSupported)
8556 if (SDValue Blend = lowerVectorShuffleAsBlend(DL, MVT::v2i64, V1, V2, Mask,
8560 // Use dedicated unpack instructions for masks that match their pattern.
8562 lowerVectorShuffleWithUNPCK(DL, MVT::v2i64, Mask, V1, V2, DAG))
8565 // Try to use byte rotation instructions.
8566 // Its more profitable for pre-SSSE3 to use shuffles/unpacks.
8567 if (Subtarget->hasSSSE3())
8568 if (SDValue Rotate = lowerVectorShuffleAsByteRotate(
8569 DL, MVT::v2i64, V1, V2, Mask, Subtarget, DAG))
8572 // If we have direct support for blends, we should lower by decomposing into
8573 // a permute. That will be faster than the domain cross.
8574 if (IsBlendSupported)
8575 return lowerVectorShuffleAsDecomposedShuffleBlend(DL, MVT::v2i64, V1, V2,
8578 // We implement this with SHUFPD which is pretty lame because it will likely
8579 // incur 2 cycles of stall for integer vectors on Nehalem and older chips.
8580 // However, all the alternatives are still more cycles and newer chips don't
8581 // have this problem. It would be really nice if x86 had better shuffles here.
8582 V1 = DAG.getBitcast(MVT::v2f64, V1);
8583 V2 = DAG.getBitcast(MVT::v2f64, V2);
8584 return DAG.getBitcast(MVT::v2i64,
8585 DAG.getVectorShuffle(MVT::v2f64, DL, V1, V2, Mask));
8588 /// \brief Test whether this can be lowered with a single SHUFPS instruction.
8590 /// This is used to disable more specialized lowerings when the shufps lowering
8591 /// will happen to be efficient.
8592 static bool isSingleSHUFPSMask(ArrayRef<int> Mask) {
8593 // This routine only handles 128-bit shufps.
8594 assert(Mask.size() == 4 && "Unsupported mask size!");
8596 // To lower with a single SHUFPS we need to have the low half and high half
8597 // each requiring a single input.
8598 if (Mask[0] != -1 && Mask[1] != -1 && (Mask[0] < 4) != (Mask[1] < 4))
8600 if (Mask[2] != -1 && Mask[3] != -1 && (Mask[2] < 4) != (Mask[3] < 4))
8606 /// \brief Lower a vector shuffle using the SHUFPS instruction.
8608 /// This is a helper routine dedicated to lowering vector shuffles using SHUFPS.
8609 /// It makes no assumptions about whether this is the *best* lowering, it simply
8611 static SDValue lowerVectorShuffleWithSHUFPS(SDLoc DL, MVT VT,
8612 ArrayRef<int> Mask, SDValue V1,
8613 SDValue V2, SelectionDAG &DAG) {
8614 SDValue LowV = V1, HighV = V2;
8615 int NewMask[4] = {Mask[0], Mask[1], Mask[2], Mask[3]};
8618 std::count_if(Mask.begin(), Mask.end(), [](int M) { return M >= 4; });
8620 if (NumV2Elements == 1) {
8622 std::find_if(Mask.begin(), Mask.end(), [](int M) { return M >= 4; }) -
8625 // Compute the index adjacent to V2Index and in the same half by toggling
8627 int V2AdjIndex = V2Index ^ 1;
8629 if (Mask[V2AdjIndex] == -1) {
8630 // Handles all the cases where we have a single V2 element and an undef.
8631 // This will only ever happen in the high lanes because we commute the
8632 // vector otherwise.
8634 std::swap(LowV, HighV);
8635 NewMask[V2Index] -= 4;
8637 // Handle the case where the V2 element ends up adjacent to a V1 element.
8638 // To make this work, blend them together as the first step.
8639 int V1Index = V2AdjIndex;
8640 int BlendMask[4] = {Mask[V2Index] - 4, 0, Mask[V1Index], 0};
8641 V2 = DAG.getNode(X86ISD::SHUFP, DL, VT, V2, V1,
8642 getV4X86ShuffleImm8ForMask(BlendMask, DL, DAG));
8644 // Now proceed to reconstruct the final blend as we have the necessary
8645 // high or low half formed.
8652 NewMask[V1Index] = 2; // We put the V1 element in V2[2].
8653 NewMask[V2Index] = 0; // We shifted the V2 element into V2[0].
8655 } else if (NumV2Elements == 2) {
8656 if (Mask[0] < 4 && Mask[1] < 4) {
8657 // Handle the easy case where we have V1 in the low lanes and V2 in the
8661 } else if (Mask[2] < 4 && Mask[3] < 4) {
8662 // We also handle the reversed case because this utility may get called
8663 // when we detect a SHUFPS pattern but can't easily commute the shuffle to
8664 // arrange things in the right direction.
8670 // We have a mixture of V1 and V2 in both low and high lanes. Rather than
8671 // trying to place elements directly, just blend them and set up the final
8672 // shuffle to place them.
8674 // The first two blend mask elements are for V1, the second two are for
8676 int BlendMask[4] = {Mask[0] < 4 ? Mask[0] : Mask[1],
8677 Mask[2] < 4 ? Mask[2] : Mask[3],
8678 (Mask[0] >= 4 ? Mask[0] : Mask[1]) - 4,
8679 (Mask[2] >= 4 ? Mask[2] : Mask[3]) - 4};
8680 V1 = DAG.getNode(X86ISD::SHUFP, DL, VT, V1, V2,
8681 getV4X86ShuffleImm8ForMask(BlendMask, DL, DAG));
8683 // Now we do a normal shuffle of V1 by giving V1 as both operands to
8686 NewMask[0] = Mask[0] < 4 ? 0 : 2;
8687 NewMask[1] = Mask[0] < 4 ? 2 : 0;
8688 NewMask[2] = Mask[2] < 4 ? 1 : 3;
8689 NewMask[3] = Mask[2] < 4 ? 3 : 1;
8692 return DAG.getNode(X86ISD::SHUFP, DL, VT, LowV, HighV,
8693 getV4X86ShuffleImm8ForMask(NewMask, DL, DAG));
8696 /// \brief Lower 4-lane 32-bit floating point shuffles.
8698 /// Uses instructions exclusively from the floating point unit to minimize
8699 /// domain crossing penalties, as these are sufficient to implement all v4f32
8701 static SDValue lowerV4F32VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
8702 const X86Subtarget *Subtarget,
8703 SelectionDAG &DAG) {
8705 assert(Op.getSimpleValueType() == MVT::v4f32 && "Bad shuffle type!");
8706 assert(V1.getSimpleValueType() == MVT::v4f32 && "Bad operand type!");
8707 assert(V2.getSimpleValueType() == MVT::v4f32 && "Bad operand type!");
8708 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
8709 ArrayRef<int> Mask = SVOp->getMask();
8710 assert(Mask.size() == 4 && "Unexpected mask size for v4 shuffle!");
8713 std::count_if(Mask.begin(), Mask.end(), [](int M) { return M >= 4; });
8715 if (NumV2Elements == 0) {
8716 // Check for being able to broadcast a single element.
8717 if (SDValue Broadcast = lowerVectorShuffleAsBroadcast(DL, MVT::v4f32, V1,
8718 Mask, Subtarget, DAG))
8721 // Use even/odd duplicate instructions for masks that match their pattern.
8722 if (Subtarget->hasSSE3()) {
8723 if (isShuffleEquivalent(V1, V2, Mask, {0, 0, 2, 2}))
8724 return DAG.getNode(X86ISD::MOVSLDUP, DL, MVT::v4f32, V1);
8725 if (isShuffleEquivalent(V1, V2, Mask, {1, 1, 3, 3}))
8726 return DAG.getNode(X86ISD::MOVSHDUP, DL, MVT::v4f32, V1);
8729 if (Subtarget->hasAVX()) {
8730 // If we have AVX, we can use VPERMILPS which will allow folding a load
8731 // into the shuffle.
8732 return DAG.getNode(X86ISD::VPERMILPI, DL, MVT::v4f32, V1,
8733 getV4X86ShuffleImm8ForMask(Mask, DL, DAG));
8736 // Otherwise, use a straight shuffle of a single input vector. We pass the
8737 // input vector to both operands to simulate this with a SHUFPS.
8738 return DAG.getNode(X86ISD::SHUFP, DL, MVT::v4f32, V1, V1,
8739 getV4X86ShuffleImm8ForMask(Mask, DL, DAG));
8742 // There are special ways we can lower some single-element blends. However, we
8743 // have custom ways we can lower more complex single-element blends below that
8744 // we defer to if both this and BLENDPS fail to match, so restrict this to
8745 // when the V2 input is targeting element 0 of the mask -- that is the fast
8747 if (NumV2Elements == 1 && Mask[0] >= 4)
8748 if (SDValue V = lowerVectorShuffleAsElementInsertion(DL, MVT::v4f32, V1, V2,
8749 Mask, Subtarget, DAG))
8752 if (Subtarget->hasSSE41()) {
8753 if (SDValue Blend = lowerVectorShuffleAsBlend(DL, MVT::v4f32, V1, V2, Mask,
8757 // Use INSERTPS if we can complete the shuffle efficiently.
8758 if (SDValue V = lowerVectorShuffleAsInsertPS(Op, V1, V2, Mask, DAG))
8761 if (!isSingleSHUFPSMask(Mask))
8762 if (SDValue BlendPerm = lowerVectorShuffleAsBlendAndPermute(
8763 DL, MVT::v4f32, V1, V2, Mask, DAG))
8767 // Use dedicated unpack instructions for masks that match their pattern.
8769 lowerVectorShuffleWithUNPCK(DL, MVT::v4f32, Mask, V1, V2, DAG))
8772 // Otherwise fall back to a SHUFPS lowering strategy.
8773 return lowerVectorShuffleWithSHUFPS(DL, MVT::v4f32, Mask, V1, V2, DAG);
8776 /// \brief Lower 4-lane i32 vector shuffles.
8778 /// We try to handle these with integer-domain shuffles where we can, but for
8779 /// blends we use the floating point domain blend instructions.
8780 static SDValue lowerV4I32VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
8781 const X86Subtarget *Subtarget,
8782 SelectionDAG &DAG) {
8784 assert(Op.getSimpleValueType() == MVT::v4i32 && "Bad shuffle type!");
8785 assert(V1.getSimpleValueType() == MVT::v4i32 && "Bad operand type!");
8786 assert(V2.getSimpleValueType() == MVT::v4i32 && "Bad operand type!");
8787 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
8788 ArrayRef<int> Mask = SVOp->getMask();
8789 assert(Mask.size() == 4 && "Unexpected mask size for v4 shuffle!");
8791 // Whenever we can lower this as a zext, that instruction is strictly faster
8792 // than any alternative. It also allows us to fold memory operands into the
8793 // shuffle in many cases.
8794 if (SDValue ZExt = lowerVectorShuffleAsZeroOrAnyExtend(DL, MVT::v4i32, V1, V2,
8795 Mask, Subtarget, DAG))
8799 std::count_if(Mask.begin(), Mask.end(), [](int M) { return M >= 4; });
8801 if (NumV2Elements == 0) {
8802 // Check for being able to broadcast a single element.
8803 if (SDValue Broadcast = lowerVectorShuffleAsBroadcast(DL, MVT::v4i32, V1,
8804 Mask, Subtarget, DAG))
8807 // Straight shuffle of a single input vector. For everything from SSE2
8808 // onward this has a single fast instruction with no scary immediates.
8809 // We coerce the shuffle pattern to be compatible with UNPCK instructions
8810 // but we aren't actually going to use the UNPCK instruction because doing
8811 // so prevents folding a load into this instruction or making a copy.
8812 const int UnpackLoMask[] = {0, 0, 1, 1};
8813 const int UnpackHiMask[] = {2, 2, 3, 3};
8814 if (isShuffleEquivalent(V1, V2, Mask, {0, 0, 1, 1}))
8815 Mask = UnpackLoMask;
8816 else if (isShuffleEquivalent(V1, V2, Mask, {2, 2, 3, 3}))
8817 Mask = UnpackHiMask;
8819 return DAG.getNode(X86ISD::PSHUFD, DL, MVT::v4i32, V1,
8820 getV4X86ShuffleImm8ForMask(Mask, DL, DAG));
8823 // Try to use shift instructions.
8825 lowerVectorShuffleAsShift(DL, MVT::v4i32, V1, V2, Mask, DAG))
8828 // There are special ways we can lower some single-element blends.
8829 if (NumV2Elements == 1)
8830 if (SDValue V = lowerVectorShuffleAsElementInsertion(DL, MVT::v4i32, V1, V2,
8831 Mask, Subtarget, DAG))
8834 // We have different paths for blend lowering, but they all must use the
8835 // *exact* same predicate.
8836 bool IsBlendSupported = Subtarget->hasSSE41();
8837 if (IsBlendSupported)
8838 if (SDValue Blend = lowerVectorShuffleAsBlend(DL, MVT::v4i32, V1, V2, Mask,
8842 if (SDValue Masked =
8843 lowerVectorShuffleAsBitMask(DL, MVT::v4i32, V1, V2, Mask, DAG))
8846 // Use dedicated unpack instructions for masks that match their pattern.
8848 lowerVectorShuffleWithUNPCK(DL, MVT::v4i32, Mask, V1, V2, DAG))
8851 // Try to use byte rotation instructions.
8852 // Its more profitable for pre-SSSE3 to use shuffles/unpacks.
8853 if (Subtarget->hasSSSE3())
8854 if (SDValue Rotate = lowerVectorShuffleAsByteRotate(
8855 DL, MVT::v4i32, V1, V2, Mask, Subtarget, DAG))
8858 // If we have direct support for blends, we should lower by decomposing into
8859 // a permute. That will be faster than the domain cross.
8860 if (IsBlendSupported)
8861 return lowerVectorShuffleAsDecomposedShuffleBlend(DL, MVT::v4i32, V1, V2,
8864 // Try to lower by permuting the inputs into an unpack instruction.
8865 if (SDValue Unpack = lowerVectorShuffleAsPermuteAndUnpack(DL, MVT::v4i32, V1,
8869 // We implement this with SHUFPS because it can blend from two vectors.
8870 // Because we're going to eventually use SHUFPS, we use SHUFPS even to build
8871 // up the inputs, bypassing domain shift penalties that we would encur if we
8872 // directly used PSHUFD on Nehalem and older. For newer chips, this isn't
8874 return DAG.getBitcast(
8876 DAG.getVectorShuffle(MVT::v4f32, DL, DAG.getBitcast(MVT::v4f32, V1),
8877 DAG.getBitcast(MVT::v4f32, V2), Mask));
8880 /// \brief Lowering of single-input v8i16 shuffles is the cornerstone of SSE2
8881 /// shuffle lowering, and the most complex part.
8883 /// The lowering strategy is to try to form pairs of input lanes which are
8884 /// targeted at the same half of the final vector, and then use a dword shuffle
8885 /// to place them onto the right half, and finally unpack the paired lanes into
8886 /// their final position.
8888 /// The exact breakdown of how to form these dword pairs and align them on the
8889 /// correct sides is really tricky. See the comments within the function for
8890 /// more of the details.
8892 /// This code also handles repeated 128-bit lanes of v8i16 shuffles, but each
8893 /// lane must shuffle the *exact* same way. In fact, you must pass a v8 Mask to
8894 /// this routine for it to work correctly. To shuffle a 256-bit or 512-bit i16
8895 /// vector, form the analogous 128-bit 8-element Mask.
8896 static SDValue lowerV8I16GeneralSingleInputVectorShuffle(
8897 SDLoc DL, MVT VT, SDValue V, MutableArrayRef<int> Mask,
8898 const X86Subtarget *Subtarget, SelectionDAG &DAG) {
8899 assert(VT.getVectorElementType() == MVT::i16 && "Bad input type!");
8900 MVT PSHUFDVT = MVT::getVectorVT(MVT::i32, VT.getVectorNumElements() / 2);
8902 assert(Mask.size() == 8 && "Shuffle mask length doen't match!");
8903 MutableArrayRef<int> LoMask = Mask.slice(0, 4);
8904 MutableArrayRef<int> HiMask = Mask.slice(4, 4);
8906 SmallVector<int, 4> LoInputs;
8907 std::copy_if(LoMask.begin(), LoMask.end(), std::back_inserter(LoInputs),
8908 [](int M) { return M >= 0; });
8909 std::sort(LoInputs.begin(), LoInputs.end());
8910 LoInputs.erase(std::unique(LoInputs.begin(), LoInputs.end()), LoInputs.end());
8911 SmallVector<int, 4> HiInputs;
8912 std::copy_if(HiMask.begin(), HiMask.end(), std::back_inserter(HiInputs),
8913 [](int M) { return M >= 0; });
8914 std::sort(HiInputs.begin(), HiInputs.end());
8915 HiInputs.erase(std::unique(HiInputs.begin(), HiInputs.end()), HiInputs.end());
8917 std::lower_bound(LoInputs.begin(), LoInputs.end(), 4) - LoInputs.begin();
8918 int NumHToL = LoInputs.size() - NumLToL;
8920 std::lower_bound(HiInputs.begin(), HiInputs.end(), 4) - HiInputs.begin();
8921 int NumHToH = HiInputs.size() - NumLToH;
8922 MutableArrayRef<int> LToLInputs(LoInputs.data(), NumLToL);
8923 MutableArrayRef<int> LToHInputs(HiInputs.data(), NumLToH);
8924 MutableArrayRef<int> HToLInputs(LoInputs.data() + NumLToL, NumHToL);
8925 MutableArrayRef<int> HToHInputs(HiInputs.data() + NumLToH, NumHToH);
8927 // Simplify the 1-into-3 and 3-into-1 cases with a single pshufd. For all
8928 // such inputs we can swap two of the dwords across the half mark and end up
8929 // with <=2 inputs to each half in each half. Once there, we can fall through
8930 // to the generic code below. For example:
8932 // Input: [a, b, c, d, e, f, g, h] -PSHUFD[0,2,1,3]-> [a, b, e, f, c, d, g, h]
8933 // Mask: [0, 1, 2, 7, 4, 5, 6, 3] -----------------> [0, 1, 4, 7, 2, 3, 6, 5]
8935 // However in some very rare cases we have a 1-into-3 or 3-into-1 on one half
8936 // and an existing 2-into-2 on the other half. In this case we may have to
8937 // pre-shuffle the 2-into-2 half to avoid turning it into a 3-into-1 or
8938 // 1-into-3 which could cause us to cycle endlessly fixing each side in turn.
8939 // Fortunately, we don't have to handle anything but a 2-into-2 pattern
8940 // because any other situation (including a 3-into-1 or 1-into-3 in the other
8941 // half than the one we target for fixing) will be fixed when we re-enter this
8942 // path. We will also combine away any sequence of PSHUFD instructions that
8943 // result into a single instruction. Here is an example of the tricky case:
8945 // Input: [a, b, c, d, e, f, g, h] -PSHUFD[0,2,1,3]-> [a, b, e, f, c, d, g, h]
8946 // Mask: [3, 7, 1, 0, 2, 7, 3, 5] -THIS-IS-BAD!!!!-> [5, 7, 1, 0, 4, 7, 5, 3]
8948 // This now has a 1-into-3 in the high half! Instead, we do two shuffles:
8950 // Input: [a, b, c, d, e, f, g, h] PSHUFHW[0,2,1,3]-> [a, b, c, d, e, g, f, h]
8951 // Mask: [3, 7, 1, 0, 2, 7, 3, 5] -----------------> [3, 7, 1, 0, 2, 7, 3, 6]
8953 // Input: [a, b, c, d, e, g, f, h] -PSHUFD[0,2,1,3]-> [a, b, e, g, c, d, f, h]
8954 // Mask: [3, 7, 1, 0, 2, 7, 3, 6] -----------------> [5, 7, 1, 0, 4, 7, 5, 6]
8956 // The result is fine to be handled by the generic logic.
8957 auto balanceSides = [&](ArrayRef<int> AToAInputs, ArrayRef<int> BToAInputs,
8958 ArrayRef<int> BToBInputs, ArrayRef<int> AToBInputs,
8959 int AOffset, int BOffset) {
8960 assert((AToAInputs.size() == 3 || AToAInputs.size() == 1) &&
8961 "Must call this with A having 3 or 1 inputs from the A half.");
8962 assert((BToAInputs.size() == 1 || BToAInputs.size() == 3) &&
8963 "Must call this with B having 1 or 3 inputs from the B half.");
8964 assert(AToAInputs.size() + BToAInputs.size() == 4 &&
8965 "Must call this with either 3:1 or 1:3 inputs (summing to 4).");
8967 bool ThreeAInputs = AToAInputs.size() == 3;
8969 // Compute the index of dword with only one word among the three inputs in
8970 // a half by taking the sum of the half with three inputs and subtracting
8971 // the sum of the actual three inputs. The difference is the remaining
8974 int &TripleDWord = ThreeAInputs ? ADWord : BDWord;
8975 int &OneInputDWord = ThreeAInputs ? BDWord : ADWord;
8976 int TripleInputOffset = ThreeAInputs ? AOffset : BOffset;
8977 ArrayRef<int> TripleInputs = ThreeAInputs ? AToAInputs : BToAInputs;
8978 int OneInput = ThreeAInputs ? BToAInputs[0] : AToAInputs[0];
8979 int TripleInputSum = 0 + 1 + 2 + 3 + (4 * TripleInputOffset);
8980 int TripleNonInputIdx =
8981 TripleInputSum - std::accumulate(TripleInputs.begin(), TripleInputs.end(), 0);
8982 TripleDWord = TripleNonInputIdx / 2;
8984 // We use xor with one to compute the adjacent DWord to whichever one the
8986 OneInputDWord = (OneInput / 2) ^ 1;
8988 // Check for one tricky case: We're fixing a 3<-1 or a 1<-3 shuffle for AToA
8989 // and BToA inputs. If there is also such a problem with the BToB and AToB
8990 // inputs, we don't try to fix it necessarily -- we'll recurse and see it in
8991 // the next pass. However, if we have a 2<-2 in the BToB and AToB inputs, it
8992 // is essential that we don't *create* a 3<-1 as then we might oscillate.
8993 if (BToBInputs.size() == 2 && AToBInputs.size() == 2) {
8994 // Compute how many inputs will be flipped by swapping these DWords. We
8996 // to balance this to ensure we don't form a 3-1 shuffle in the other
8998 int NumFlippedAToBInputs =
8999 std::count(AToBInputs.begin(), AToBInputs.end(), 2 * ADWord) +
9000 std::count(AToBInputs.begin(), AToBInputs.end(), 2 * ADWord + 1);
9001 int NumFlippedBToBInputs =
9002 std::count(BToBInputs.begin(), BToBInputs.end(), 2 * BDWord) +
9003 std::count(BToBInputs.begin(), BToBInputs.end(), 2 * BDWord + 1);
9004 if ((NumFlippedAToBInputs == 1 &&
9005 (NumFlippedBToBInputs == 0 || NumFlippedBToBInputs == 2)) ||
9006 (NumFlippedBToBInputs == 1 &&
9007 (NumFlippedAToBInputs == 0 || NumFlippedAToBInputs == 2))) {
9008 // We choose whether to fix the A half or B half based on whether that
9009 // half has zero flipped inputs. At zero, we may not be able to fix it
9010 // with that half. We also bias towards fixing the B half because that
9011 // will more commonly be the high half, and we have to bias one way.
9012 auto FixFlippedInputs = [&V, &DL, &Mask, &DAG](int PinnedIdx, int DWord,
9013 ArrayRef<int> Inputs) {
9014 int FixIdx = PinnedIdx ^ 1; // The adjacent slot to the pinned slot.
9015 bool IsFixIdxInput = std::find(Inputs.begin(), Inputs.end(),
9016 PinnedIdx ^ 1) != Inputs.end();
9017 // Determine whether the free index is in the flipped dword or the
9018 // unflipped dword based on where the pinned index is. We use this bit
9019 // in an xor to conditionally select the adjacent dword.
9020 int FixFreeIdx = 2 * (DWord ^ (PinnedIdx / 2 == DWord));
9021 bool IsFixFreeIdxInput = std::find(Inputs.begin(), Inputs.end(),
9022 FixFreeIdx) != Inputs.end();
9023 if (IsFixIdxInput == IsFixFreeIdxInput)
9025 IsFixFreeIdxInput = std::find(Inputs.begin(), Inputs.end(),
9026 FixFreeIdx) != Inputs.end();
9027 assert(IsFixIdxInput != IsFixFreeIdxInput &&
9028 "We need to be changing the number of flipped inputs!");
9029 int PSHUFHalfMask[] = {0, 1, 2, 3};
9030 std::swap(PSHUFHalfMask[FixFreeIdx % 4], PSHUFHalfMask[FixIdx % 4]);
9031 V = DAG.getNode(FixIdx < 4 ? X86ISD::PSHUFLW : X86ISD::PSHUFHW, DL,
9033 getV4X86ShuffleImm8ForMask(PSHUFHalfMask, DL, DAG));
9036 if (M != -1 && M == FixIdx)
9038 else if (M != -1 && M == FixFreeIdx)
9041 if (NumFlippedBToBInputs != 0) {
9043 BToAInputs.size() == 3 ? TripleNonInputIdx : OneInput;
9044 FixFlippedInputs(BPinnedIdx, BDWord, BToBInputs);
9046 assert(NumFlippedAToBInputs != 0 && "Impossible given predicates!");
9047 int APinnedIdx = ThreeAInputs ? TripleNonInputIdx : OneInput;
9048 FixFlippedInputs(APinnedIdx, ADWord, AToBInputs);
9053 int PSHUFDMask[] = {0, 1, 2, 3};
9054 PSHUFDMask[ADWord] = BDWord;
9055 PSHUFDMask[BDWord] = ADWord;
9058 DAG.getNode(X86ISD::PSHUFD, DL, PSHUFDVT, DAG.getBitcast(PSHUFDVT, V),
9059 getV4X86ShuffleImm8ForMask(PSHUFDMask, DL, DAG)));
9061 // Adjust the mask to match the new locations of A and B.
9063 if (M != -1 && M/2 == ADWord)
9064 M = 2 * BDWord + M % 2;
9065 else if (M != -1 && M/2 == BDWord)
9066 M = 2 * ADWord + M % 2;
9068 // Recurse back into this routine to re-compute state now that this isn't
9069 // a 3 and 1 problem.
9070 return lowerV8I16GeneralSingleInputVectorShuffle(DL, VT, V, Mask, Subtarget,
9073 if ((NumLToL == 3 && NumHToL == 1) || (NumLToL == 1 && NumHToL == 3))
9074 return balanceSides(LToLInputs, HToLInputs, HToHInputs, LToHInputs, 0, 4);
9075 else if ((NumHToH == 3 && NumLToH == 1) || (NumHToH == 1 && NumLToH == 3))
9076 return balanceSides(HToHInputs, LToHInputs, LToLInputs, HToLInputs, 4, 0);
9078 // At this point there are at most two inputs to the low and high halves from
9079 // each half. That means the inputs can always be grouped into dwords and
9080 // those dwords can then be moved to the correct half with a dword shuffle.
9081 // We use at most one low and one high word shuffle to collect these paired
9082 // inputs into dwords, and finally a dword shuffle to place them.
9083 int PSHUFLMask[4] = {-1, -1, -1, -1};
9084 int PSHUFHMask[4] = {-1, -1, -1, -1};
9085 int PSHUFDMask[4] = {-1, -1, -1, -1};
9087 // First fix the masks for all the inputs that are staying in their
9088 // original halves. This will then dictate the targets of the cross-half
9090 auto fixInPlaceInputs =
9091 [&PSHUFDMask](ArrayRef<int> InPlaceInputs, ArrayRef<int> IncomingInputs,
9092 MutableArrayRef<int> SourceHalfMask,
9093 MutableArrayRef<int> HalfMask, int HalfOffset) {
9094 if (InPlaceInputs.empty())
9096 if (InPlaceInputs.size() == 1) {
9097 SourceHalfMask[InPlaceInputs[0] - HalfOffset] =
9098 InPlaceInputs[0] - HalfOffset;
9099 PSHUFDMask[InPlaceInputs[0] / 2] = InPlaceInputs[0] / 2;
9102 if (IncomingInputs.empty()) {
9103 // Just fix all of the in place inputs.
9104 for (int Input : InPlaceInputs) {
9105 SourceHalfMask[Input - HalfOffset] = Input - HalfOffset;
9106 PSHUFDMask[Input / 2] = Input / 2;
9111 assert(InPlaceInputs.size() == 2 && "Cannot handle 3 or 4 inputs!");
9112 SourceHalfMask[InPlaceInputs[0] - HalfOffset] =
9113 InPlaceInputs[0] - HalfOffset;
9114 // Put the second input next to the first so that they are packed into
9115 // a dword. We find the adjacent index by toggling the low bit.
9116 int AdjIndex = InPlaceInputs[0] ^ 1;
9117 SourceHalfMask[AdjIndex - HalfOffset] = InPlaceInputs[1] - HalfOffset;
9118 std::replace(HalfMask.begin(), HalfMask.end(), InPlaceInputs[1], AdjIndex);
9119 PSHUFDMask[AdjIndex / 2] = AdjIndex / 2;
9121 fixInPlaceInputs(LToLInputs, HToLInputs, PSHUFLMask, LoMask, 0);
9122 fixInPlaceInputs(HToHInputs, LToHInputs, PSHUFHMask, HiMask, 4);
9124 // Now gather the cross-half inputs and place them into a free dword of
9125 // their target half.
9126 // FIXME: This operation could almost certainly be simplified dramatically to
9127 // look more like the 3-1 fixing operation.
9128 auto moveInputsToRightHalf = [&PSHUFDMask](
9129 MutableArrayRef<int> IncomingInputs, ArrayRef<int> ExistingInputs,
9130 MutableArrayRef<int> SourceHalfMask, MutableArrayRef<int> HalfMask,
9131 MutableArrayRef<int> FinalSourceHalfMask, int SourceOffset,
9133 auto isWordClobbered = [](ArrayRef<int> SourceHalfMask, int Word) {
9134 return SourceHalfMask[Word] != -1 && SourceHalfMask[Word] != Word;
9136 auto isDWordClobbered = [&isWordClobbered](ArrayRef<int> SourceHalfMask,
9138 int LowWord = Word & ~1;
9139 int HighWord = Word | 1;
9140 return isWordClobbered(SourceHalfMask, LowWord) ||
9141 isWordClobbered(SourceHalfMask, HighWord);
9144 if (IncomingInputs.empty())
9147 if (ExistingInputs.empty()) {
9148 // Map any dwords with inputs from them into the right half.
9149 for (int Input : IncomingInputs) {
9150 // If the source half mask maps over the inputs, turn those into
9151 // swaps and use the swapped lane.
9152 if (isWordClobbered(SourceHalfMask, Input - SourceOffset)) {
9153 if (SourceHalfMask[SourceHalfMask[Input - SourceOffset]] == -1) {
9154 SourceHalfMask[SourceHalfMask[Input - SourceOffset]] =
9155 Input - SourceOffset;
9156 // We have to swap the uses in our half mask in one sweep.
9157 for (int &M : HalfMask)
9158 if (M == SourceHalfMask[Input - SourceOffset] + SourceOffset)
9160 else if (M == Input)
9161 M = SourceHalfMask[Input - SourceOffset] + SourceOffset;
9163 assert(SourceHalfMask[SourceHalfMask[Input - SourceOffset]] ==
9164 Input - SourceOffset &&
9165 "Previous placement doesn't match!");
9167 // Note that this correctly re-maps both when we do a swap and when
9168 // we observe the other side of the swap above. We rely on that to
9169 // avoid swapping the members of the input list directly.
9170 Input = SourceHalfMask[Input - SourceOffset] + SourceOffset;
9173 // Map the input's dword into the correct half.
9174 if (PSHUFDMask[(Input - SourceOffset + DestOffset) / 2] == -1)
9175 PSHUFDMask[(Input - SourceOffset + DestOffset) / 2] = Input / 2;
9177 assert(PSHUFDMask[(Input - SourceOffset + DestOffset) / 2] ==
9179 "Previous placement doesn't match!");
9182 // And just directly shift any other-half mask elements to be same-half
9183 // as we will have mirrored the dword containing the element into the
9184 // same position within that half.
9185 for (int &M : HalfMask)
9186 if (M >= SourceOffset && M < SourceOffset + 4) {
9187 M = M - SourceOffset + DestOffset;
9188 assert(M >= 0 && "This should never wrap below zero!");
9193 // Ensure we have the input in a viable dword of its current half. This
9194 // is particularly tricky because the original position may be clobbered
9195 // by inputs being moved and *staying* in that half.
9196 if (IncomingInputs.size() == 1) {
9197 if (isWordClobbered(SourceHalfMask, IncomingInputs[0] - SourceOffset)) {
9198 int InputFixed = std::find(std::begin(SourceHalfMask),
9199 std::end(SourceHalfMask), -1) -
9200 std::begin(SourceHalfMask) + SourceOffset;
9201 SourceHalfMask[InputFixed - SourceOffset] =
9202 IncomingInputs[0] - SourceOffset;
9203 std::replace(HalfMask.begin(), HalfMask.end(), IncomingInputs[0],
9205 IncomingInputs[0] = InputFixed;
9207 } else if (IncomingInputs.size() == 2) {
9208 if (IncomingInputs[0] / 2 != IncomingInputs[1] / 2 ||
9209 isDWordClobbered(SourceHalfMask, IncomingInputs[0] - SourceOffset)) {
9210 // We have two non-adjacent or clobbered inputs we need to extract from
9211 // the source half. To do this, we need to map them into some adjacent
9212 // dword slot in the source mask.
9213 int InputsFixed[2] = {IncomingInputs[0] - SourceOffset,
9214 IncomingInputs[1] - SourceOffset};
9216 // If there is a free slot in the source half mask adjacent to one of
9217 // the inputs, place the other input in it. We use (Index XOR 1) to
9218 // compute an adjacent index.
9219 if (!isWordClobbered(SourceHalfMask, InputsFixed[0]) &&
9220 SourceHalfMask[InputsFixed[0] ^ 1] == -1) {
9221 SourceHalfMask[InputsFixed[0]] = InputsFixed[0];
9222 SourceHalfMask[InputsFixed[0] ^ 1] = InputsFixed[1];
9223 InputsFixed[1] = InputsFixed[0] ^ 1;
9224 } else if (!isWordClobbered(SourceHalfMask, InputsFixed[1]) &&
9225 SourceHalfMask[InputsFixed[1] ^ 1] == -1) {
9226 SourceHalfMask[InputsFixed[1]] = InputsFixed[1];
9227 SourceHalfMask[InputsFixed[1] ^ 1] = InputsFixed[0];
9228 InputsFixed[0] = InputsFixed[1] ^ 1;
9229 } else if (SourceHalfMask[2 * ((InputsFixed[0] / 2) ^ 1)] == -1 &&
9230 SourceHalfMask[2 * ((InputsFixed[0] / 2) ^ 1) + 1] == -1) {
9231 // The two inputs are in the same DWord but it is clobbered and the
9232 // adjacent DWord isn't used at all. Move both inputs to the free
9234 SourceHalfMask[2 * ((InputsFixed[0] / 2) ^ 1)] = InputsFixed[0];
9235 SourceHalfMask[2 * ((InputsFixed[0] / 2) ^ 1) + 1] = InputsFixed[1];
9236 InputsFixed[0] = 2 * ((InputsFixed[0] / 2) ^ 1);
9237 InputsFixed[1] = 2 * ((InputsFixed[0] / 2) ^ 1) + 1;
9239 // The only way we hit this point is if there is no clobbering
9240 // (because there are no off-half inputs to this half) and there is no
9241 // free slot adjacent to one of the inputs. In this case, we have to
9242 // swap an input with a non-input.
9243 for (int i = 0; i < 4; ++i)
9244 assert((SourceHalfMask[i] == -1 || SourceHalfMask[i] == i) &&
9245 "We can't handle any clobbers here!");
9246 assert(InputsFixed[1] != (InputsFixed[0] ^ 1) &&
9247 "Cannot have adjacent inputs here!");
9249 SourceHalfMask[InputsFixed[0] ^ 1] = InputsFixed[1];
9250 SourceHalfMask[InputsFixed[1]] = InputsFixed[0] ^ 1;
9252 // We also have to update the final source mask in this case because
9253 // it may need to undo the above swap.
9254 for (int &M : FinalSourceHalfMask)
9255 if (M == (InputsFixed[0] ^ 1) + SourceOffset)
9256 M = InputsFixed[1] + SourceOffset;
9257 else if (M == InputsFixed[1] + SourceOffset)
9258 M = (InputsFixed[0] ^ 1) + SourceOffset;
9260 InputsFixed[1] = InputsFixed[0] ^ 1;
9263 // Point everything at the fixed inputs.
9264 for (int &M : HalfMask)
9265 if (M == IncomingInputs[0])
9266 M = InputsFixed[0] + SourceOffset;
9267 else if (M == IncomingInputs[1])
9268 M = InputsFixed[1] + SourceOffset;
9270 IncomingInputs[0] = InputsFixed[0] + SourceOffset;
9271 IncomingInputs[1] = InputsFixed[1] + SourceOffset;
9274 llvm_unreachable("Unhandled input size!");
9277 // Now hoist the DWord down to the right half.
9278 int FreeDWord = (PSHUFDMask[DestOffset / 2] == -1 ? 0 : 1) + DestOffset / 2;
9279 assert(PSHUFDMask[FreeDWord] == -1 && "DWord not free");
9280 PSHUFDMask[FreeDWord] = IncomingInputs[0] / 2;
9281 for (int &M : HalfMask)
9282 for (int Input : IncomingInputs)
9284 M = FreeDWord * 2 + Input % 2;
9286 moveInputsToRightHalf(HToLInputs, LToLInputs, PSHUFHMask, LoMask, HiMask,
9287 /*SourceOffset*/ 4, /*DestOffset*/ 0);
9288 moveInputsToRightHalf(LToHInputs, HToHInputs, PSHUFLMask, HiMask, LoMask,
9289 /*SourceOffset*/ 0, /*DestOffset*/ 4);
9291 // Now enact all the shuffles we've computed to move the inputs into their
9293 if (!isNoopShuffleMask(PSHUFLMask))
9294 V = DAG.getNode(X86ISD::PSHUFLW, DL, VT, V,
9295 getV4X86ShuffleImm8ForMask(PSHUFLMask, DL, DAG));
9296 if (!isNoopShuffleMask(PSHUFHMask))
9297 V = DAG.getNode(X86ISD::PSHUFHW, DL, VT, V,
9298 getV4X86ShuffleImm8ForMask(PSHUFHMask, DL, DAG));
9299 if (!isNoopShuffleMask(PSHUFDMask))
9302 DAG.getNode(X86ISD::PSHUFD, DL, PSHUFDVT, DAG.getBitcast(PSHUFDVT, V),
9303 getV4X86ShuffleImm8ForMask(PSHUFDMask, DL, DAG)));
9305 // At this point, each half should contain all its inputs, and we can then
9306 // just shuffle them into their final position.
9307 assert(std::count_if(LoMask.begin(), LoMask.end(),
9308 [](int M) { return M >= 4; }) == 0 &&
9309 "Failed to lift all the high half inputs to the low mask!");
9310 assert(std::count_if(HiMask.begin(), HiMask.end(),
9311 [](int M) { return M >= 0 && M < 4; }) == 0 &&
9312 "Failed to lift all the low half inputs to the high mask!");
9314 // Do a half shuffle for the low mask.
9315 if (!isNoopShuffleMask(LoMask))
9316 V = DAG.getNode(X86ISD::PSHUFLW, DL, VT, V,
9317 getV4X86ShuffleImm8ForMask(LoMask, DL, DAG));
9319 // Do a half shuffle with the high mask after shifting its values down.
9320 for (int &M : HiMask)
9323 if (!isNoopShuffleMask(HiMask))
9324 V = DAG.getNode(X86ISD::PSHUFHW, DL, VT, V,
9325 getV4X86ShuffleImm8ForMask(HiMask, DL, DAG));
9330 /// \brief Helper to form a PSHUFB-based shuffle+blend.
9331 static SDValue lowerVectorShuffleAsPSHUFB(SDLoc DL, MVT VT, SDValue V1,
9332 SDValue V2, ArrayRef<int> Mask,
9333 SelectionDAG &DAG, bool &V1InUse,
9335 SmallBitVector Zeroable = computeZeroableShuffleElements(Mask, V1, V2);
9341 int Size = Mask.size();
9342 int Scale = 16 / Size;
9343 for (int i = 0; i < 16; ++i) {
9344 if (Mask[i / Scale] == -1) {
9345 V1Mask[i] = V2Mask[i] = DAG.getUNDEF(MVT::i8);
9347 const int ZeroMask = 0x80;
9348 int V1Idx = Mask[i / Scale] < Size ? Mask[i / Scale] * Scale + i % Scale
9350 int V2Idx = Mask[i / Scale] < Size
9352 : (Mask[i / Scale] - Size) * Scale + i % Scale;
9353 if (Zeroable[i / Scale])
9354 V1Idx = V2Idx = ZeroMask;
9355 V1Mask[i] = DAG.getConstant(V1Idx, DL, MVT::i8);
9356 V2Mask[i] = DAG.getConstant(V2Idx, DL, MVT::i8);
9357 V1InUse |= (ZeroMask != V1Idx);
9358 V2InUse |= (ZeroMask != V2Idx);
9363 V1 = DAG.getNode(X86ISD::PSHUFB, DL, MVT::v16i8,
9364 DAG.getBitcast(MVT::v16i8, V1),
9365 DAG.getNode(ISD::BUILD_VECTOR, DL, MVT::v16i8, V1Mask));
9367 V2 = DAG.getNode(X86ISD::PSHUFB, DL, MVT::v16i8,
9368 DAG.getBitcast(MVT::v16i8, V2),
9369 DAG.getNode(ISD::BUILD_VECTOR, DL, MVT::v16i8, V2Mask));
9371 // If we need shuffled inputs from both, blend the two.
9373 if (V1InUse && V2InUse)
9374 V = DAG.getNode(ISD::OR, DL, MVT::v16i8, V1, V2);
9376 V = V1InUse ? V1 : V2;
9378 // Cast the result back to the correct type.
9379 return DAG.getBitcast(VT, V);
9382 /// \brief Generic lowering of 8-lane i16 shuffles.
9384 /// This handles both single-input shuffles and combined shuffle/blends with
9385 /// two inputs. The single input shuffles are immediately delegated to
9386 /// a dedicated lowering routine.
9388 /// The blends are lowered in one of three fundamental ways. If there are few
9389 /// enough inputs, it delegates to a basic UNPCK-based strategy. If the shuffle
9390 /// of the input is significantly cheaper when lowered as an interleaving of
9391 /// the two inputs, try to interleave them. Otherwise, blend the low and high
9392 /// halves of the inputs separately (making them have relatively few inputs)
9393 /// and then concatenate them.
9394 static SDValue lowerV8I16VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
9395 const X86Subtarget *Subtarget,
9396 SelectionDAG &DAG) {
9398 assert(Op.getSimpleValueType() == MVT::v8i16 && "Bad shuffle type!");
9399 assert(V1.getSimpleValueType() == MVT::v8i16 && "Bad operand type!");
9400 assert(V2.getSimpleValueType() == MVT::v8i16 && "Bad operand type!");
9401 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
9402 ArrayRef<int> OrigMask = SVOp->getMask();
9403 int MaskStorage[8] = {OrigMask[0], OrigMask[1], OrigMask[2], OrigMask[3],
9404 OrigMask[4], OrigMask[5], OrigMask[6], OrigMask[7]};
9405 MutableArrayRef<int> Mask(MaskStorage);
9407 assert(Mask.size() == 8 && "Unexpected mask size for v8 shuffle!");
9409 // Whenever we can lower this as a zext, that instruction is strictly faster
9410 // than any alternative.
9411 if (SDValue ZExt = lowerVectorShuffleAsZeroOrAnyExtend(
9412 DL, MVT::v8i16, V1, V2, OrigMask, Subtarget, DAG))
9415 auto isV1 = [](int M) { return M >= 0 && M < 8; };
9417 auto isV2 = [](int M) { return M >= 8; };
9419 int NumV2Inputs = std::count_if(Mask.begin(), Mask.end(), isV2);
9421 if (NumV2Inputs == 0) {
9422 // Check for being able to broadcast a single element.
9423 if (SDValue Broadcast = lowerVectorShuffleAsBroadcast(DL, MVT::v8i16, V1,
9424 Mask, Subtarget, DAG))
9427 // Try to use shift instructions.
9429 lowerVectorShuffleAsShift(DL, MVT::v8i16, V1, V1, Mask, DAG))
9432 // Use dedicated unpack instructions for masks that match their pattern.
9434 lowerVectorShuffleWithUNPCK(DL, MVT::v8i16, Mask, V1, V2, DAG))
9437 // Try to use byte rotation instructions.
9438 if (SDValue Rotate = lowerVectorShuffleAsByteRotate(DL, MVT::v8i16, V1, V1,
9439 Mask, Subtarget, DAG))
9442 return lowerV8I16GeneralSingleInputVectorShuffle(DL, MVT::v8i16, V1, Mask,
9446 assert(std::any_of(Mask.begin(), Mask.end(), isV1) &&
9447 "All single-input shuffles should be canonicalized to be V1-input "
9450 // Try to use shift instructions.
9452 lowerVectorShuffleAsShift(DL, MVT::v8i16, V1, V2, Mask, DAG))
9455 // See if we can use SSE4A Extraction / Insertion.
9456 if (Subtarget->hasSSE4A())
9457 if (SDValue V = lowerVectorShuffleWithSSE4A(DL, MVT::v8i16, V1, V2, Mask, DAG))
9460 // There are special ways we can lower some single-element blends.
9461 if (NumV2Inputs == 1)
9462 if (SDValue V = lowerVectorShuffleAsElementInsertion(DL, MVT::v8i16, V1, V2,
9463 Mask, Subtarget, DAG))
9466 // We have different paths for blend lowering, but they all must use the
9467 // *exact* same predicate.
9468 bool IsBlendSupported = Subtarget->hasSSE41();
9469 if (IsBlendSupported)
9470 if (SDValue Blend = lowerVectorShuffleAsBlend(DL, MVT::v8i16, V1, V2, Mask,
9474 if (SDValue Masked =
9475 lowerVectorShuffleAsBitMask(DL, MVT::v8i16, V1, V2, Mask, DAG))
9478 // Use dedicated unpack instructions for masks that match their pattern.
9480 lowerVectorShuffleWithUNPCK(DL, MVT::v8i16, Mask, V1, V2, DAG))
9483 // Try to use byte rotation instructions.
9484 if (SDValue Rotate = lowerVectorShuffleAsByteRotate(
9485 DL, MVT::v8i16, V1, V2, Mask, Subtarget, DAG))
9488 if (SDValue BitBlend =
9489 lowerVectorShuffleAsBitBlend(DL, MVT::v8i16, V1, V2, Mask, DAG))
9492 if (SDValue Unpack = lowerVectorShuffleAsPermuteAndUnpack(DL, MVT::v8i16, V1,
9496 // If we can't directly blend but can use PSHUFB, that will be better as it
9497 // can both shuffle and set up the inefficient blend.
9498 if (!IsBlendSupported && Subtarget->hasSSSE3()) {
9499 bool V1InUse, V2InUse;
9500 return lowerVectorShuffleAsPSHUFB(DL, MVT::v8i16, V1, V2, Mask, DAG,
9504 // We can always bit-blend if we have to so the fallback strategy is to
9505 // decompose into single-input permutes and blends.
9506 return lowerVectorShuffleAsDecomposedShuffleBlend(DL, MVT::v8i16, V1, V2,
9510 /// \brief Check whether a compaction lowering can be done by dropping even
9511 /// elements and compute how many times even elements must be dropped.
9513 /// This handles shuffles which take every Nth element where N is a power of
9514 /// two. Example shuffle masks:
9516 /// N = 1: 0, 2, 4, 6, 8, 10, 12, 14, 0, 2, 4, 6, 8, 10, 12, 14
9517 /// N = 1: 0, 2, 4, 6, 8, 10, 12, 14, 16, 18, 20, 22, 24, 26, 28, 30
9518 /// N = 2: 0, 4, 8, 12, 0, 4, 8, 12, 0, 4, 8, 12, 0, 4, 8, 12
9519 /// N = 2: 0, 4, 8, 12, 16, 20, 24, 28, 0, 4, 8, 12, 16, 20, 24, 28
9520 /// N = 3: 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8
9521 /// N = 3: 0, 8, 16, 24, 0, 8, 16, 24, 0, 8, 16, 24, 0, 8, 16, 24
9523 /// Any of these lanes can of course be undef.
9525 /// This routine only supports N <= 3.
9526 /// FIXME: Evaluate whether either AVX or AVX-512 have any opportunities here
9529 /// \returns N above, or the number of times even elements must be dropped if
9530 /// there is such a number. Otherwise returns zero.
9531 static int canLowerByDroppingEvenElements(ArrayRef<int> Mask) {
9532 // Figure out whether we're looping over two inputs or just one.
9533 bool IsSingleInput = isSingleInputShuffleMask(Mask);
9535 // The modulus for the shuffle vector entries is based on whether this is
9536 // a single input or not.
9537 int ShuffleModulus = Mask.size() * (IsSingleInput ? 1 : 2);
9538 assert(isPowerOf2_32((uint32_t)ShuffleModulus) &&
9539 "We should only be called with masks with a power-of-2 size!");
9541 uint64_t ModMask = (uint64_t)ShuffleModulus - 1;
9543 // We track whether the input is viable for all power-of-2 strides 2^1, 2^2,
9544 // and 2^3 simultaneously. This is because we may have ambiguity with
9545 // partially undef inputs.
9546 bool ViableForN[3] = {true, true, true};
9548 for (int i = 0, e = Mask.size(); i < e; ++i) {
9549 // Ignore undef lanes, we'll optimistically collapse them to the pattern we
9554 bool IsAnyViable = false;
9555 for (unsigned j = 0; j != array_lengthof(ViableForN); ++j)
9556 if (ViableForN[j]) {
9559 // The shuffle mask must be equal to (i * 2^N) % M.
9560 if ((uint64_t)Mask[i] == (((uint64_t)i << N) & ModMask))
9563 ViableForN[j] = false;
9565 // Early exit if we exhaust the possible powers of two.
9570 for (unsigned j = 0; j != array_lengthof(ViableForN); ++j)
9574 // Return 0 as there is no viable power of two.
9578 /// \brief Generic lowering of v16i8 shuffles.
9580 /// This is a hybrid strategy to lower v16i8 vectors. It first attempts to
9581 /// detect any complexity reducing interleaving. If that doesn't help, it uses
9582 /// UNPCK to spread the i8 elements across two i16-element vectors, and uses
9583 /// the existing lowering for v8i16 blends on each half, finally PACK-ing them
9585 static SDValue lowerV16I8VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
9586 const X86Subtarget *Subtarget,
9587 SelectionDAG &DAG) {
9589 assert(Op.getSimpleValueType() == MVT::v16i8 && "Bad shuffle type!");
9590 assert(V1.getSimpleValueType() == MVT::v16i8 && "Bad operand type!");
9591 assert(V2.getSimpleValueType() == MVT::v16i8 && "Bad operand type!");
9592 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
9593 ArrayRef<int> Mask = SVOp->getMask();
9594 assert(Mask.size() == 16 && "Unexpected mask size for v16 shuffle!");
9596 // Try to use shift instructions.
9598 lowerVectorShuffleAsShift(DL, MVT::v16i8, V1, V2, Mask, DAG))
9601 // Try to use byte rotation instructions.
9602 if (SDValue Rotate = lowerVectorShuffleAsByteRotate(
9603 DL, MVT::v16i8, V1, V2, Mask, Subtarget, DAG))
9606 // Try to use a zext lowering.
9607 if (SDValue ZExt = lowerVectorShuffleAsZeroOrAnyExtend(
9608 DL, MVT::v16i8, V1, V2, Mask, Subtarget, DAG))
9611 // See if we can use SSE4A Extraction / Insertion.
9612 if (Subtarget->hasSSE4A())
9613 if (SDValue V = lowerVectorShuffleWithSSE4A(DL, MVT::v16i8, V1, V2, Mask, DAG))
9617 std::count_if(Mask.begin(), Mask.end(), [](int M) { return M >= 16; });
9619 // For single-input shuffles, there are some nicer lowering tricks we can use.
9620 if (NumV2Elements == 0) {
9621 // Check for being able to broadcast a single element.
9622 if (SDValue Broadcast = lowerVectorShuffleAsBroadcast(DL, MVT::v16i8, V1,
9623 Mask, Subtarget, DAG))
9626 // Check whether we can widen this to an i16 shuffle by duplicating bytes.
9627 // Notably, this handles splat and partial-splat shuffles more efficiently.
9628 // However, it only makes sense if the pre-duplication shuffle simplifies
9629 // things significantly. Currently, this means we need to be able to
9630 // express the pre-duplication shuffle as an i16 shuffle.
9632 // FIXME: We should check for other patterns which can be widened into an
9633 // i16 shuffle as well.
9634 auto canWidenViaDuplication = [](ArrayRef<int> Mask) {
9635 for (int i = 0; i < 16; i += 2)
9636 if (Mask[i] != -1 && Mask[i + 1] != -1 && Mask[i] != Mask[i + 1])
9641 auto tryToWidenViaDuplication = [&]() -> SDValue {
9642 if (!canWidenViaDuplication(Mask))
9644 SmallVector<int, 4> LoInputs;
9645 std::copy_if(Mask.begin(), Mask.end(), std::back_inserter(LoInputs),
9646 [](int M) { return M >= 0 && M < 8; });
9647 std::sort(LoInputs.begin(), LoInputs.end());
9648 LoInputs.erase(std::unique(LoInputs.begin(), LoInputs.end()),
9650 SmallVector<int, 4> HiInputs;
9651 std::copy_if(Mask.begin(), Mask.end(), std::back_inserter(HiInputs),
9652 [](int M) { return M >= 8; });
9653 std::sort(HiInputs.begin(), HiInputs.end());
9654 HiInputs.erase(std::unique(HiInputs.begin(), HiInputs.end()),
9657 bool TargetLo = LoInputs.size() >= HiInputs.size();
9658 ArrayRef<int> InPlaceInputs = TargetLo ? LoInputs : HiInputs;
9659 ArrayRef<int> MovingInputs = TargetLo ? HiInputs : LoInputs;
9661 int PreDupI16Shuffle[] = {-1, -1, -1, -1, -1, -1, -1, -1};
9662 SmallDenseMap<int, int, 8> LaneMap;
9663 for (int I : InPlaceInputs) {
9664 PreDupI16Shuffle[I/2] = I/2;
9667 int j = TargetLo ? 0 : 4, je = j + 4;
9668 for (int i = 0, ie = MovingInputs.size(); i < ie; ++i) {
9669 // Check if j is already a shuffle of this input. This happens when
9670 // there are two adjacent bytes after we move the low one.
9671 if (PreDupI16Shuffle[j] != MovingInputs[i] / 2) {
9672 // If we haven't yet mapped the input, search for a slot into which
9674 while (j < je && PreDupI16Shuffle[j] != -1)
9678 // We can't place the inputs into a single half with a simple i16 shuffle, so bail.
9681 // Map this input with the i16 shuffle.
9682 PreDupI16Shuffle[j] = MovingInputs[i] / 2;
9685 // Update the lane map based on the mapping we ended up with.
9686 LaneMap[MovingInputs[i]] = 2 * j + MovingInputs[i] % 2;
9688 V1 = DAG.getBitcast(
9690 DAG.getVectorShuffle(MVT::v8i16, DL, DAG.getBitcast(MVT::v8i16, V1),
9691 DAG.getUNDEF(MVT::v8i16), PreDupI16Shuffle));
9693 // Unpack the bytes to form the i16s that will be shuffled into place.
9694 V1 = DAG.getNode(TargetLo ? X86ISD::UNPCKL : X86ISD::UNPCKH, DL,
9695 MVT::v16i8, V1, V1);
9697 int PostDupI16Shuffle[8] = {-1, -1, -1, -1, -1, -1, -1, -1};
9698 for (int i = 0; i < 16; ++i)
9699 if (Mask[i] != -1) {
9700 int MappedMask = LaneMap[Mask[i]] - (TargetLo ? 0 : 8);
9701 assert(MappedMask < 8 && "Invalid v8 shuffle mask!");
9702 if (PostDupI16Shuffle[i / 2] == -1)
9703 PostDupI16Shuffle[i / 2] = MappedMask;
9705 assert(PostDupI16Shuffle[i / 2] == MappedMask &&
9706 "Conflicting entrties in the original shuffle!");
9708 return DAG.getBitcast(
9710 DAG.getVectorShuffle(MVT::v8i16, DL, DAG.getBitcast(MVT::v8i16, V1),
9711 DAG.getUNDEF(MVT::v8i16), PostDupI16Shuffle));
9713 if (SDValue V = tryToWidenViaDuplication())
9717 if (SDValue Masked =
9718 lowerVectorShuffleAsBitMask(DL, MVT::v16i8, V1, V2, Mask, DAG))
9721 // Use dedicated unpack instructions for masks that match their pattern.
9723 lowerVectorShuffleWithUNPCK(DL, MVT::v16i8, Mask, V1, V2, DAG))
9726 // Check for SSSE3 which lets us lower all v16i8 shuffles much more directly
9727 // with PSHUFB. It is important to do this before we attempt to generate any
9728 // blends but after all of the single-input lowerings. If the single input
9729 // lowerings can find an instruction sequence that is faster than a PSHUFB, we
9730 // want to preserve that and we can DAG combine any longer sequences into
9731 // a PSHUFB in the end. But once we start blending from multiple inputs,
9732 // the complexity of DAG combining bad patterns back into PSHUFB is too high,
9733 // and there are *very* few patterns that would actually be faster than the
9734 // PSHUFB approach because of its ability to zero lanes.
9736 // FIXME: The only exceptions to the above are blends which are exact
9737 // interleavings with direct instructions supporting them. We currently don't
9738 // handle those well here.
9739 if (Subtarget->hasSSSE3()) {
9740 bool V1InUse = false;
9741 bool V2InUse = false;
9743 SDValue PSHUFB = lowerVectorShuffleAsPSHUFB(DL, MVT::v16i8, V1, V2, Mask,
9744 DAG, V1InUse, V2InUse);
9746 // If both V1 and V2 are in use and we can use a direct blend or an unpack,
9747 // do so. This avoids using them to handle blends-with-zero which is
9748 // important as a single pshufb is significantly faster for that.
9749 if (V1InUse && V2InUse) {
9750 if (Subtarget->hasSSE41())
9751 if (SDValue Blend = lowerVectorShuffleAsBlend(DL, MVT::v16i8, V1, V2,
9752 Mask, Subtarget, DAG))
9755 // We can use an unpack to do the blending rather than an or in some
9756 // cases. Even though the or may be (very minorly) more efficient, we
9757 // preference this lowering because there are common cases where part of
9758 // the complexity of the shuffles goes away when we do the final blend as
9760 // FIXME: It might be worth trying to detect if the unpack-feeding
9761 // shuffles will both be pshufb, in which case we shouldn't bother with
9763 if (SDValue Unpack = lowerVectorShuffleAsPermuteAndUnpack(
9764 DL, MVT::v16i8, V1, V2, Mask, DAG))
9771 // There are special ways we can lower some single-element blends.
9772 if (NumV2Elements == 1)
9773 if (SDValue V = lowerVectorShuffleAsElementInsertion(DL, MVT::v16i8, V1, V2,
9774 Mask, Subtarget, DAG))
9777 if (SDValue BitBlend =
9778 lowerVectorShuffleAsBitBlend(DL, MVT::v16i8, V1, V2, Mask, DAG))
9781 // Check whether a compaction lowering can be done. This handles shuffles
9782 // which take every Nth element for some even N. See the helper function for
9785 // We special case these as they can be particularly efficiently handled with
9786 // the PACKUSB instruction on x86 and they show up in common patterns of
9787 // rearranging bytes to truncate wide elements.
9788 if (int NumEvenDrops = canLowerByDroppingEvenElements(Mask)) {
9789 // NumEvenDrops is the power of two stride of the elements. Another way of
9790 // thinking about it is that we need to drop the even elements this many
9791 // times to get the original input.
9792 bool IsSingleInput = isSingleInputShuffleMask(Mask);
9794 // First we need to zero all the dropped bytes.
9795 assert(NumEvenDrops <= 3 &&
9796 "No support for dropping even elements more than 3 times.");
9797 // We use the mask type to pick which bytes are preserved based on how many
9798 // elements are dropped.
9799 MVT MaskVTs[] = { MVT::v8i16, MVT::v4i32, MVT::v2i64 };
9800 SDValue ByteClearMask = DAG.getBitcast(
9801 MVT::v16i8, DAG.getConstant(0xFF, DL, MaskVTs[NumEvenDrops - 1]));
9802 V1 = DAG.getNode(ISD::AND, DL, MVT::v16i8, V1, ByteClearMask);
9804 V2 = DAG.getNode(ISD::AND, DL, MVT::v16i8, V2, ByteClearMask);
9806 // Now pack things back together.
9807 V1 = DAG.getBitcast(MVT::v8i16, V1);
9808 V2 = IsSingleInput ? V1 : DAG.getBitcast(MVT::v8i16, V2);
9809 SDValue Result = DAG.getNode(X86ISD::PACKUS, DL, MVT::v16i8, V1, V2);
9810 for (int i = 1; i < NumEvenDrops; ++i) {
9811 Result = DAG.getBitcast(MVT::v8i16, Result);
9812 Result = DAG.getNode(X86ISD::PACKUS, DL, MVT::v16i8, Result, Result);
9818 // Handle multi-input cases by blending single-input shuffles.
9819 if (NumV2Elements > 0)
9820 return lowerVectorShuffleAsDecomposedShuffleBlend(DL, MVT::v16i8, V1, V2,
9823 // The fallback path for single-input shuffles widens this into two v8i16
9824 // vectors with unpacks, shuffles those, and then pulls them back together
9828 int LoBlendMask[8] = {-1, -1, -1, -1, -1, -1, -1, -1};
9829 int HiBlendMask[8] = {-1, -1, -1, -1, -1, -1, -1, -1};
9830 for (int i = 0; i < 16; ++i)
9832 (i < 8 ? LoBlendMask[i] : HiBlendMask[i % 8]) = Mask[i];
9834 SDValue Zero = getZeroVector(MVT::v8i16, Subtarget, DAG, DL);
9836 SDValue VLoHalf, VHiHalf;
9837 // Check if any of the odd lanes in the v16i8 are used. If not, we can mask
9838 // them out and avoid using UNPCK{L,H} to extract the elements of V as
9840 if (std::none_of(std::begin(LoBlendMask), std::end(LoBlendMask),
9841 [](int M) { return M >= 0 && M % 2 == 1; }) &&
9842 std::none_of(std::begin(HiBlendMask), std::end(HiBlendMask),
9843 [](int M) { return M >= 0 && M % 2 == 1; })) {
9844 // Use a mask to drop the high bytes.
9845 VLoHalf = DAG.getBitcast(MVT::v8i16, V);
9846 VLoHalf = DAG.getNode(ISD::AND, DL, MVT::v8i16, VLoHalf,
9847 DAG.getConstant(0x00FF, DL, MVT::v8i16));
9849 // This will be a single vector shuffle instead of a blend so nuke VHiHalf.
9850 VHiHalf = DAG.getUNDEF(MVT::v8i16);
9852 // Squash the masks to point directly into VLoHalf.
9853 for (int &M : LoBlendMask)
9856 for (int &M : HiBlendMask)
9860 // Otherwise just unpack the low half of V into VLoHalf and the high half into
9861 // VHiHalf so that we can blend them as i16s.
9862 VLoHalf = DAG.getBitcast(
9863 MVT::v8i16, DAG.getNode(X86ISD::UNPCKL, DL, MVT::v16i8, V, Zero));
9864 VHiHalf = DAG.getBitcast(
9865 MVT::v8i16, DAG.getNode(X86ISD::UNPCKH, DL, MVT::v16i8, V, Zero));
9868 SDValue LoV = DAG.getVectorShuffle(MVT::v8i16, DL, VLoHalf, VHiHalf, LoBlendMask);
9869 SDValue HiV = DAG.getVectorShuffle(MVT::v8i16, DL, VLoHalf, VHiHalf, HiBlendMask);
9871 return DAG.getNode(X86ISD::PACKUS, DL, MVT::v16i8, LoV, HiV);
9874 /// \brief Dispatching routine to lower various 128-bit x86 vector shuffles.
9876 /// This routine breaks down the specific type of 128-bit shuffle and
9877 /// dispatches to the lowering routines accordingly.
9878 static SDValue lower128BitVectorShuffle(SDValue Op, SDValue V1, SDValue V2,
9879 MVT VT, const X86Subtarget *Subtarget,
9880 SelectionDAG &DAG) {
9881 switch (VT.SimpleTy) {
9883 return lowerV2I64VectorShuffle(Op, V1, V2, Subtarget, DAG);
9885 return lowerV2F64VectorShuffle(Op, V1, V2, Subtarget, DAG);
9887 return lowerV4I32VectorShuffle(Op, V1, V2, Subtarget, DAG);
9889 return lowerV4F32VectorShuffle(Op, V1, V2, Subtarget, DAG);
9891 return lowerV8I16VectorShuffle(Op, V1, V2, Subtarget, DAG);
9893 return lowerV16I8VectorShuffle(Op, V1, V2, Subtarget, DAG);
9896 llvm_unreachable("Unimplemented!");
9900 /// \brief Helper function to test whether a shuffle mask could be
9901 /// simplified by widening the elements being shuffled.
9903 /// Appends the mask for wider elements in WidenedMask if valid. Otherwise
9904 /// leaves it in an unspecified state.
9906 /// NOTE: This must handle normal vector shuffle masks and *target* vector
9907 /// shuffle masks. The latter have the special property of a '-2' representing
9908 /// a zero-ed lane of a vector.
9909 static bool canWidenShuffleElements(ArrayRef<int> Mask,
9910 SmallVectorImpl<int> &WidenedMask) {
9911 for (int i = 0, Size = Mask.size(); i < Size; i += 2) {
9912 // If both elements are undef, its trivial.
9913 if (Mask[i] == SM_SentinelUndef && Mask[i + 1] == SM_SentinelUndef) {
9914 WidenedMask.push_back(SM_SentinelUndef);
9918 // Check for an undef mask and a mask value properly aligned to fit with
9919 // a pair of values. If we find such a case, use the non-undef mask's value.
9920 if (Mask[i] == SM_SentinelUndef && Mask[i + 1] >= 0 && Mask[i + 1] % 2 == 1) {
9921 WidenedMask.push_back(Mask[i + 1] / 2);
9924 if (Mask[i + 1] == SM_SentinelUndef && Mask[i] >= 0 && Mask[i] % 2 == 0) {
9925 WidenedMask.push_back(Mask[i] / 2);
9929 // When zeroing, we need to spread the zeroing across both lanes to widen.
9930 if (Mask[i] == SM_SentinelZero || Mask[i + 1] == SM_SentinelZero) {
9931 if ((Mask[i] == SM_SentinelZero || Mask[i] == SM_SentinelUndef) &&
9932 (Mask[i + 1] == SM_SentinelZero || Mask[i + 1] == SM_SentinelUndef)) {
9933 WidenedMask.push_back(SM_SentinelZero);
9939 // Finally check if the two mask values are adjacent and aligned with
9941 if (Mask[i] != SM_SentinelUndef && Mask[i] % 2 == 0 && Mask[i] + 1 == Mask[i + 1]) {
9942 WidenedMask.push_back(Mask[i] / 2);
9946 // Otherwise we can't safely widen the elements used in this shuffle.
9949 assert(WidenedMask.size() == Mask.size() / 2 &&
9950 "Incorrect size of mask after widening the elements!");
9955 /// \brief Generic routine to split vector shuffle into half-sized shuffles.
9957 /// This routine just extracts two subvectors, shuffles them independently, and
9958 /// then concatenates them back together. This should work effectively with all
9959 /// AVX vector shuffle types.
9960 static SDValue splitAndLowerVectorShuffle(SDLoc DL, MVT VT, SDValue V1,
9961 SDValue V2, ArrayRef<int> Mask,
9962 SelectionDAG &DAG) {
9963 assert(VT.getSizeInBits() >= 256 &&
9964 "Only for 256-bit or wider vector shuffles!");
9965 assert(V1.getSimpleValueType() == VT && "Bad operand type!");
9966 assert(V2.getSimpleValueType() == VT && "Bad operand type!");
9968 ArrayRef<int> LoMask = Mask.slice(0, Mask.size() / 2);
9969 ArrayRef<int> HiMask = Mask.slice(Mask.size() / 2);
9971 int NumElements = VT.getVectorNumElements();
9972 int SplitNumElements = NumElements / 2;
9973 MVT ScalarVT = VT.getVectorElementType();
9974 MVT SplitVT = MVT::getVectorVT(ScalarVT, NumElements / 2);
9976 // Rather than splitting build-vectors, just build two narrower build
9977 // vectors. This helps shuffling with splats and zeros.
9978 auto SplitVector = [&](SDValue V) {
9979 while (V.getOpcode() == ISD::BITCAST)
9980 V = V->getOperand(0);
9982 MVT OrigVT = V.getSimpleValueType();
9983 int OrigNumElements = OrigVT.getVectorNumElements();
9984 int OrigSplitNumElements = OrigNumElements / 2;
9985 MVT OrigScalarVT = OrigVT.getVectorElementType();
9986 MVT OrigSplitVT = MVT::getVectorVT(OrigScalarVT, OrigNumElements / 2);
9990 auto *BV = dyn_cast<BuildVectorSDNode>(V);
9992 LoV = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, OrigSplitVT, V,
9993 DAG.getIntPtrConstant(0, DL));
9994 HiV = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, OrigSplitVT, V,
9995 DAG.getIntPtrConstant(OrigSplitNumElements, DL));
9998 SmallVector<SDValue, 16> LoOps, HiOps;
9999 for (int i = 0; i < OrigSplitNumElements; ++i) {
10000 LoOps.push_back(BV->getOperand(i));
10001 HiOps.push_back(BV->getOperand(i + OrigSplitNumElements));
10003 LoV = DAG.getNode(ISD::BUILD_VECTOR, DL, OrigSplitVT, LoOps);
10004 HiV = DAG.getNode(ISD::BUILD_VECTOR, DL, OrigSplitVT, HiOps);
10006 return std::make_pair(DAG.getBitcast(SplitVT, LoV),
10007 DAG.getBitcast(SplitVT, HiV));
10010 SDValue LoV1, HiV1, LoV2, HiV2;
10011 std::tie(LoV1, HiV1) = SplitVector(V1);
10012 std::tie(LoV2, HiV2) = SplitVector(V2);
10014 // Now create two 4-way blends of these half-width vectors.
10015 auto HalfBlend = [&](ArrayRef<int> HalfMask) {
10016 bool UseLoV1 = false, UseHiV1 = false, UseLoV2 = false, UseHiV2 = false;
10017 SmallVector<int, 32> V1BlendMask, V2BlendMask, BlendMask;
10018 for (int i = 0; i < SplitNumElements; ++i) {
10019 int M = HalfMask[i];
10020 if (M >= NumElements) {
10021 if (M >= NumElements + SplitNumElements)
10025 V2BlendMask.push_back(M - NumElements);
10026 V1BlendMask.push_back(-1);
10027 BlendMask.push_back(SplitNumElements + i);
10028 } else if (M >= 0) {
10029 if (M >= SplitNumElements)
10033 V2BlendMask.push_back(-1);
10034 V1BlendMask.push_back(M);
10035 BlendMask.push_back(i);
10037 V2BlendMask.push_back(-1);
10038 V1BlendMask.push_back(-1);
10039 BlendMask.push_back(-1);
10043 // Because the lowering happens after all combining takes place, we need to
10044 // manually combine these blend masks as much as possible so that we create
10045 // a minimal number of high-level vector shuffle nodes.
10047 // First try just blending the halves of V1 or V2.
10048 if (!UseLoV1 && !UseHiV1 && !UseLoV2 && !UseHiV2)
10049 return DAG.getUNDEF(SplitVT);
10050 if (!UseLoV2 && !UseHiV2)
10051 return DAG.getVectorShuffle(SplitVT, DL, LoV1, HiV1, V1BlendMask);
10052 if (!UseLoV1 && !UseHiV1)
10053 return DAG.getVectorShuffle(SplitVT, DL, LoV2, HiV2, V2BlendMask);
10055 SDValue V1Blend, V2Blend;
10056 if (UseLoV1 && UseHiV1) {
10058 DAG.getVectorShuffle(SplitVT, DL, LoV1, HiV1, V1BlendMask);
10060 // We only use half of V1 so map the usage down into the final blend mask.
10061 V1Blend = UseLoV1 ? LoV1 : HiV1;
10062 for (int i = 0; i < SplitNumElements; ++i)
10063 if (BlendMask[i] >= 0 && BlendMask[i] < SplitNumElements)
10064 BlendMask[i] = V1BlendMask[i] - (UseLoV1 ? 0 : SplitNumElements);
10066 if (UseLoV2 && UseHiV2) {
10068 DAG.getVectorShuffle(SplitVT, DL, LoV2, HiV2, V2BlendMask);
10070 // We only use half of V2 so map the usage down into the final blend mask.
10071 V2Blend = UseLoV2 ? LoV2 : HiV2;
10072 for (int i = 0; i < SplitNumElements; ++i)
10073 if (BlendMask[i] >= SplitNumElements)
10074 BlendMask[i] = V2BlendMask[i] + (UseLoV2 ? SplitNumElements : 0);
10076 return DAG.getVectorShuffle(SplitVT, DL, V1Blend, V2Blend, BlendMask);
10078 SDValue Lo = HalfBlend(LoMask);
10079 SDValue Hi = HalfBlend(HiMask);
10080 return DAG.getNode(ISD::CONCAT_VECTORS, DL, VT, Lo, Hi);
10083 /// \brief Either split a vector in halves or decompose the shuffles and the
10086 /// This is provided as a good fallback for many lowerings of non-single-input
10087 /// shuffles with more than one 128-bit lane. In those cases, we want to select
10088 /// between splitting the shuffle into 128-bit components and stitching those
10089 /// back together vs. extracting the single-input shuffles and blending those
10091 static SDValue lowerVectorShuffleAsSplitOrBlend(SDLoc DL, MVT VT, SDValue V1,
10092 SDValue V2, ArrayRef<int> Mask,
10093 SelectionDAG &DAG) {
10094 assert(!isSingleInputShuffleMask(Mask) && "This routine must not be used to "
10095 "lower single-input shuffles as it "
10096 "could then recurse on itself.");
10097 int Size = Mask.size();
10099 // If this can be modeled as a broadcast of two elements followed by a blend,
10100 // prefer that lowering. This is especially important because broadcasts can
10101 // often fold with memory operands.
10102 auto DoBothBroadcast = [&] {
10103 int V1BroadcastIdx = -1, V2BroadcastIdx = -1;
10106 if (V2BroadcastIdx == -1)
10107 V2BroadcastIdx = M - Size;
10108 else if (M - Size != V2BroadcastIdx)
10110 } else if (M >= 0) {
10111 if (V1BroadcastIdx == -1)
10112 V1BroadcastIdx = M;
10113 else if (M != V1BroadcastIdx)
10118 if (DoBothBroadcast())
10119 return lowerVectorShuffleAsDecomposedShuffleBlend(DL, VT, V1, V2, Mask,
10122 // If the inputs all stem from a single 128-bit lane of each input, then we
10123 // split them rather than blending because the split will decompose to
10124 // unusually few instructions.
10125 int LaneCount = VT.getSizeInBits() / 128;
10126 int LaneSize = Size / LaneCount;
10127 SmallBitVector LaneInputs[2];
10128 LaneInputs[0].resize(LaneCount, false);
10129 LaneInputs[1].resize(LaneCount, false);
10130 for (int i = 0; i < Size; ++i)
10132 LaneInputs[Mask[i] / Size][(Mask[i] % Size) / LaneSize] = true;
10133 if (LaneInputs[0].count() <= 1 && LaneInputs[1].count() <= 1)
10134 return splitAndLowerVectorShuffle(DL, VT, V1, V2, Mask, DAG);
10136 // Otherwise, just fall back to decomposed shuffles and a blend. This requires
10137 // that the decomposed single-input shuffles don't end up here.
10138 return lowerVectorShuffleAsDecomposedShuffleBlend(DL, VT, V1, V2, Mask, DAG);
10141 /// \brief Lower a vector shuffle crossing multiple 128-bit lanes as
10142 /// a permutation and blend of those lanes.
10144 /// This essentially blends the out-of-lane inputs to each lane into the lane
10145 /// from a permuted copy of the vector. This lowering strategy results in four
10146 /// instructions in the worst case for a single-input cross lane shuffle which
10147 /// is lower than any other fully general cross-lane shuffle strategy I'm aware
10148 /// of. Special cases for each particular shuffle pattern should be handled
10149 /// prior to trying this lowering.
10150 static SDValue lowerVectorShuffleAsLanePermuteAndBlend(SDLoc DL, MVT VT,
10151 SDValue V1, SDValue V2,
10152 ArrayRef<int> Mask,
10153 SelectionDAG &DAG) {
10154 // FIXME: This should probably be generalized for 512-bit vectors as well.
10155 assert(VT.is256BitVector() && "Only for 256-bit vector shuffles!");
10156 int LaneSize = Mask.size() / 2;
10158 // If there are only inputs from one 128-bit lane, splitting will in fact be
10159 // less expensive. The flags track whether the given lane contains an element
10160 // that crosses to another lane.
10161 bool LaneCrossing[2] = {false, false};
10162 for (int i = 0, Size = Mask.size(); i < Size; ++i)
10163 if (Mask[i] >= 0 && (Mask[i] % Size) / LaneSize != i / LaneSize)
10164 LaneCrossing[(Mask[i] % Size) / LaneSize] = true;
10165 if (!LaneCrossing[0] || !LaneCrossing[1])
10166 return splitAndLowerVectorShuffle(DL, VT, V1, V2, Mask, DAG);
10168 if (isSingleInputShuffleMask(Mask)) {
10169 SmallVector<int, 32> FlippedBlendMask;
10170 for (int i = 0, Size = Mask.size(); i < Size; ++i)
10171 FlippedBlendMask.push_back(
10172 Mask[i] < 0 ? -1 : (((Mask[i] % Size) / LaneSize == i / LaneSize)
10174 : Mask[i] % LaneSize +
10175 (i / LaneSize) * LaneSize + Size));
10177 // Flip the vector, and blend the results which should now be in-lane. The
10178 // VPERM2X128 mask uses the low 2 bits for the low source and bits 4 and
10179 // 5 for the high source. The value 3 selects the high half of source 2 and
10180 // the value 2 selects the low half of source 2. We only use source 2 to
10181 // allow folding it into a memory operand.
10182 unsigned PERMMask = 3 | 2 << 4;
10183 SDValue Flipped = DAG.getNode(X86ISD::VPERM2X128, DL, VT, DAG.getUNDEF(VT),
10184 V1, DAG.getConstant(PERMMask, DL, MVT::i8));
10185 return DAG.getVectorShuffle(VT, DL, V1, Flipped, FlippedBlendMask);
10188 // This now reduces to two single-input shuffles of V1 and V2 which at worst
10189 // will be handled by the above logic and a blend of the results, much like
10190 // other patterns in AVX.
10191 return lowerVectorShuffleAsDecomposedShuffleBlend(DL, VT, V1, V2, Mask, DAG);
10194 /// \brief Handle lowering 2-lane 128-bit shuffles.
10195 static SDValue lowerV2X128VectorShuffle(SDLoc DL, MVT VT, SDValue V1,
10196 SDValue V2, ArrayRef<int> Mask,
10197 const X86Subtarget *Subtarget,
10198 SelectionDAG &DAG) {
10199 // TODO: If minimizing size and one of the inputs is a zero vector and the
10200 // the zero vector has only one use, we could use a VPERM2X128 to save the
10201 // instruction bytes needed to explicitly generate the zero vector.
10203 // Blends are faster and handle all the non-lane-crossing cases.
10204 if (SDValue Blend = lowerVectorShuffleAsBlend(DL, VT, V1, V2, Mask,
10208 bool IsV1Zero = ISD::isBuildVectorAllZeros(V1.getNode());
10209 bool IsV2Zero = ISD::isBuildVectorAllZeros(V2.getNode());
10211 // If either input operand is a zero vector, use VPERM2X128 because its mask
10212 // allows us to replace the zero input with an implicit zero.
10213 if (!IsV1Zero && !IsV2Zero) {
10214 // Check for patterns which can be matched with a single insert of a 128-bit
10216 bool OnlyUsesV1 = isShuffleEquivalent(V1, V2, Mask, {0, 1, 0, 1});
10217 if (OnlyUsesV1 || isShuffleEquivalent(V1, V2, Mask, {0, 1, 4, 5})) {
10218 MVT SubVT = MVT::getVectorVT(VT.getVectorElementType(),
10219 VT.getVectorNumElements() / 2);
10220 SDValue LoV = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, SubVT, V1,
10221 DAG.getIntPtrConstant(0, DL));
10222 SDValue HiV = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, SubVT,
10223 OnlyUsesV1 ? V1 : V2,
10224 DAG.getIntPtrConstant(0, DL));
10225 return DAG.getNode(ISD::CONCAT_VECTORS, DL, VT, LoV, HiV);
10229 // Otherwise form a 128-bit permutation. After accounting for undefs,
10230 // convert the 64-bit shuffle mask selection values into 128-bit
10231 // selection bits by dividing the indexes by 2 and shifting into positions
10232 // defined by a vperm2*128 instruction's immediate control byte.
10234 // The immediate permute control byte looks like this:
10235 // [1:0] - select 128 bits from sources for low half of destination
10237 // [3] - zero low half of destination
10238 // [5:4] - select 128 bits from sources for high half of destination
10240 // [7] - zero high half of destination
10242 int MaskLO = Mask[0];
10243 if (MaskLO == SM_SentinelUndef)
10244 MaskLO = Mask[1] == SM_SentinelUndef ? 0 : Mask[1];
10246 int MaskHI = Mask[2];
10247 if (MaskHI == SM_SentinelUndef)
10248 MaskHI = Mask[3] == SM_SentinelUndef ? 0 : Mask[3];
10250 unsigned PermMask = MaskLO / 2 | (MaskHI / 2) << 4;
10252 // If either input is a zero vector, replace it with an undef input.
10253 // Shuffle mask values < 4 are selecting elements of V1.
10254 // Shuffle mask values >= 4 are selecting elements of V2.
10255 // Adjust each half of the permute mask by clearing the half that was
10256 // selecting the zero vector and setting the zero mask bit.
10258 V1 = DAG.getUNDEF(VT);
10260 PermMask = (PermMask & 0xf0) | 0x08;
10262 PermMask = (PermMask & 0x0f) | 0x80;
10265 V2 = DAG.getUNDEF(VT);
10267 PermMask = (PermMask & 0xf0) | 0x08;
10269 PermMask = (PermMask & 0x0f) | 0x80;
10272 return DAG.getNode(X86ISD::VPERM2X128, DL, VT, V1, V2,
10273 DAG.getConstant(PermMask, DL, MVT::i8));
10276 /// \brief Lower a vector shuffle by first fixing the 128-bit lanes and then
10277 /// shuffling each lane.
10279 /// This will only succeed when the result of fixing the 128-bit lanes results
10280 /// in a single-input non-lane-crossing shuffle with a repeating shuffle mask in
10281 /// each 128-bit lanes. This handles many cases where we can quickly blend away
10282 /// the lane crosses early and then use simpler shuffles within each lane.
10284 /// FIXME: It might be worthwhile at some point to support this without
10285 /// requiring the 128-bit lane-relative shuffles to be repeating, but currently
10286 /// in x86 only floating point has interesting non-repeating shuffles, and even
10287 /// those are still *marginally* more expensive.
10288 static SDValue lowerVectorShuffleByMerging128BitLanes(
10289 SDLoc DL, MVT VT, SDValue V1, SDValue V2, ArrayRef<int> Mask,
10290 const X86Subtarget *Subtarget, SelectionDAG &DAG) {
10291 assert(!isSingleInputShuffleMask(Mask) &&
10292 "This is only useful with multiple inputs.");
10294 int Size = Mask.size();
10295 int LaneSize = 128 / VT.getScalarSizeInBits();
10296 int NumLanes = Size / LaneSize;
10297 assert(NumLanes > 1 && "Only handles 256-bit and wider shuffles.");
10299 // See if we can build a hypothetical 128-bit lane-fixing shuffle mask. Also
10300 // check whether the in-128-bit lane shuffles share a repeating pattern.
10301 SmallVector<int, 4> Lanes;
10302 Lanes.resize(NumLanes, -1);
10303 SmallVector<int, 4> InLaneMask;
10304 InLaneMask.resize(LaneSize, -1);
10305 for (int i = 0; i < Size; ++i) {
10309 int j = i / LaneSize;
10311 if (Lanes[j] < 0) {
10312 // First entry we've seen for this lane.
10313 Lanes[j] = Mask[i] / LaneSize;
10314 } else if (Lanes[j] != Mask[i] / LaneSize) {
10315 // This doesn't match the lane selected previously!
10319 // Check that within each lane we have a consistent shuffle mask.
10320 int k = i % LaneSize;
10321 if (InLaneMask[k] < 0) {
10322 InLaneMask[k] = Mask[i] % LaneSize;
10323 } else if (InLaneMask[k] != Mask[i] % LaneSize) {
10324 // This doesn't fit a repeating in-lane mask.
10329 // First shuffle the lanes into place.
10330 MVT LaneVT = MVT::getVectorVT(VT.isFloatingPoint() ? MVT::f64 : MVT::i64,
10331 VT.getSizeInBits() / 64);
10332 SmallVector<int, 8> LaneMask;
10333 LaneMask.resize(NumLanes * 2, -1);
10334 for (int i = 0; i < NumLanes; ++i)
10335 if (Lanes[i] >= 0) {
10336 LaneMask[2 * i + 0] = 2*Lanes[i] + 0;
10337 LaneMask[2 * i + 1] = 2*Lanes[i] + 1;
10340 V1 = DAG.getBitcast(LaneVT, V1);
10341 V2 = DAG.getBitcast(LaneVT, V2);
10342 SDValue LaneShuffle = DAG.getVectorShuffle(LaneVT, DL, V1, V2, LaneMask);
10344 // Cast it back to the type we actually want.
10345 LaneShuffle = DAG.getBitcast(VT, LaneShuffle);
10347 // Now do a simple shuffle that isn't lane crossing.
10348 SmallVector<int, 8> NewMask;
10349 NewMask.resize(Size, -1);
10350 for (int i = 0; i < Size; ++i)
10352 NewMask[i] = (i / LaneSize) * LaneSize + Mask[i] % LaneSize;
10353 assert(!is128BitLaneCrossingShuffleMask(VT, NewMask) &&
10354 "Must not introduce lane crosses at this point!");
10356 return DAG.getVectorShuffle(VT, DL, LaneShuffle, DAG.getUNDEF(VT), NewMask);
10359 /// Lower shuffles where an entire half of a 256-bit vector is UNDEF.
10360 /// This allows for fast cases such as subvector extraction/insertion
10361 /// or shuffling smaller vector types which can lower more efficiently.
10362 static SDValue lowerVectorShuffleWithUndefHalf(SDLoc DL, MVT VT, SDValue V1,
10363 SDValue V2, ArrayRef<int> Mask,
10364 const X86Subtarget *Subtarget,
10365 SelectionDAG &DAG) {
10366 assert(VT.getSizeInBits() == 256 && "Expected 256-bit vector");
10368 unsigned NumElts = VT.getVectorNumElements();
10369 unsigned HalfNumElts = NumElts / 2;
10370 MVT HalfVT = MVT::getVectorVT(VT.getVectorElementType(), HalfNumElts);
10372 bool UndefLower = isUndefInRange(Mask, 0, HalfNumElts);
10373 bool UndefUpper = isUndefInRange(Mask, HalfNumElts, HalfNumElts);
10374 if (!UndefLower && !UndefUpper)
10377 // Upper half is undef and lower half is whole upper subvector.
10378 // e.g. vector_shuffle <4, 5, 6, 7, u, u, u, u> or <2, 3, u, u>
10380 isSequentialOrUndefInRange(Mask, 0, HalfNumElts, HalfNumElts)) {
10381 SDValue Hi = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, HalfVT, V1,
10382 DAG.getIntPtrConstant(HalfNumElts, DL));
10383 return DAG.getNode(ISD::INSERT_SUBVECTOR, DL, VT, DAG.getUNDEF(VT), Hi,
10384 DAG.getIntPtrConstant(0, DL));
10387 // Lower half is undef and upper half is whole lower subvector.
10388 // e.g. vector_shuffle <u, u, u, u, 0, 1, 2, 3> or <u, u, 0, 1>
10390 isSequentialOrUndefInRange(Mask, HalfNumElts, HalfNumElts, 0)) {
10391 SDValue Hi = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, HalfVT, V1,
10392 DAG.getIntPtrConstant(0, DL));
10393 return DAG.getNode(ISD::INSERT_SUBVECTOR, DL, VT, DAG.getUNDEF(VT), Hi,
10394 DAG.getIntPtrConstant(HalfNumElts, DL));
10397 // AVX2 supports efficient immediate 64-bit element cross-lane shuffles.
10398 if (UndefLower && Subtarget->hasAVX2() &&
10399 (VT == MVT::v4f64 || VT == MVT::v4i64))
10402 // If the shuffle only uses the lower halves of the input operands,
10403 // then extract them and perform the 'half' shuffle at half width.
10404 // e.g. vector_shuffle <X, X, X, X, u, u, u, u> or <X, X, u, u>
10405 int HalfIdx1 = -1, HalfIdx2 = -1;
10406 SmallVector<int, 8> HalfMask;
10407 unsigned Offset = UndefLower ? HalfNumElts : 0;
10408 for (unsigned i = 0; i != HalfNumElts; ++i) {
10409 int M = Mask[i + Offset];
10411 HalfMask.push_back(M);
10415 // Determine which of the 4 half vectors this element is from.
10416 // i.e. 0 = Lower V1, 1 = Upper V1, 2 = Lower V2, 3 = Upper V2.
10417 int HalfIdx = M / HalfNumElts;
10419 // Only shuffle using the lower halves of the inputs.
10420 // TODO: Investigate usefulness of shuffling with upper halves.
10421 if (HalfIdx != 0 && HalfIdx != 2)
10424 // Determine the element index into its half vector source.
10425 int HalfElt = M % HalfNumElts;
10427 // We can shuffle with up to 2 half vectors, set the new 'half'
10428 // shuffle mask accordingly.
10429 if (-1 == HalfIdx1 || HalfIdx1 == HalfIdx) {
10430 HalfMask.push_back(HalfElt);
10431 HalfIdx1 = HalfIdx;
10434 if (-1 == HalfIdx2 || HalfIdx2 == HalfIdx) {
10435 HalfMask.push_back(HalfElt + HalfNumElts);
10436 HalfIdx2 = HalfIdx;
10440 // Too many half vectors referenced.
10443 assert(HalfMask.size() == HalfNumElts && "Unexpected shuffle mask length");
10445 auto GetHalfVector = [&](int HalfIdx) {
10447 return DAG.getUNDEF(HalfVT);
10448 SDValue V = (HalfIdx < 2 ? V1 : V2);
10449 HalfIdx = (HalfIdx % 2) * HalfNumElts;
10450 return DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, HalfVT, V,
10451 DAG.getIntPtrConstant(HalfIdx, DL));
10454 SDValue Half1 = GetHalfVector(HalfIdx1);
10455 SDValue Half2 = GetHalfVector(HalfIdx2);
10456 SDValue V = DAG.getVectorShuffle(HalfVT, DL, Half1, Half2, HalfMask);
10457 return DAG.getNode(ISD::INSERT_SUBVECTOR, DL, VT, DAG.getUNDEF(VT), V,
10458 DAG.getIntPtrConstant(Offset, DL));
10461 /// \brief Test whether the specified input (0 or 1) is in-place blended by the
10464 /// This returns true if the elements from a particular input are already in the
10465 /// slot required by the given mask and require no permutation.
10466 static bool isShuffleMaskInputInPlace(int Input, ArrayRef<int> Mask) {
10467 assert((Input == 0 || Input == 1) && "Only two inputs to shuffles.");
10468 int Size = Mask.size();
10469 for (int i = 0; i < Size; ++i)
10470 if (Mask[i] >= 0 && Mask[i] / Size == Input && Mask[i] % Size != i)
10476 static SDValue lowerVectorShuffleWithSHUFPD(SDLoc DL, MVT VT,
10477 ArrayRef<int> Mask, SDValue V1,
10478 SDValue V2, SelectionDAG &DAG) {
10480 // Mask for V8F64: 0/1, 8/9, 2/3, 10/11, 4/5, ..
10481 // Mask for V4F64; 0/1, 4/5, 2/3, 6/7..
10482 assert(VT.getScalarSizeInBits() == 64 && "Unexpected data type for VSHUFPD");
10483 int NumElts = VT.getVectorNumElements();
10484 bool ShufpdMask = true;
10485 bool CommutableMask = true;
10486 unsigned Immediate = 0;
10487 for (int i = 0; i < NumElts; ++i) {
10490 int Val = (i & 6) + NumElts * (i & 1);
10491 int CommutVal = (i & 0xe) + NumElts * ((i & 1)^1);
10492 if (Mask[i] < Val || Mask[i] > Val + 1)
10493 ShufpdMask = false;
10494 if (Mask[i] < CommutVal || Mask[i] > CommutVal + 1)
10495 CommutableMask = false;
10496 Immediate |= (Mask[i] % 2) << i;
10499 return DAG.getNode(X86ISD::SHUFP, DL, VT, V1, V2,
10500 DAG.getConstant(Immediate, DL, MVT::i8));
10501 if (CommutableMask)
10502 return DAG.getNode(X86ISD::SHUFP, DL, VT, V2, V1,
10503 DAG.getConstant(Immediate, DL, MVT::i8));
10507 /// \brief Handle lowering of 4-lane 64-bit floating point shuffles.
10509 /// Also ends up handling lowering of 4-lane 64-bit integer shuffles when AVX2
10510 /// isn't available.
10511 static SDValue lowerV4F64VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
10512 const X86Subtarget *Subtarget,
10513 SelectionDAG &DAG) {
10515 assert(V1.getSimpleValueType() == MVT::v4f64 && "Bad operand type!");
10516 assert(V2.getSimpleValueType() == MVT::v4f64 && "Bad operand type!");
10517 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
10518 ArrayRef<int> Mask = SVOp->getMask();
10519 assert(Mask.size() == 4 && "Unexpected mask size for v4 shuffle!");
10521 SmallVector<int, 4> WidenedMask;
10522 if (canWidenShuffleElements(Mask, WidenedMask))
10523 return lowerV2X128VectorShuffle(DL, MVT::v4f64, V1, V2, Mask, Subtarget,
10526 if (isSingleInputShuffleMask(Mask)) {
10527 // Check for being able to broadcast a single element.
10528 if (SDValue Broadcast = lowerVectorShuffleAsBroadcast(DL, MVT::v4f64, V1,
10529 Mask, Subtarget, DAG))
10532 // Use low duplicate instructions for masks that match their pattern.
10533 if (isShuffleEquivalent(V1, V2, Mask, {0, 0, 2, 2}))
10534 return DAG.getNode(X86ISD::MOVDDUP, DL, MVT::v4f64, V1);
10536 if (!is128BitLaneCrossingShuffleMask(MVT::v4f64, Mask)) {
10537 // Non-half-crossing single input shuffles can be lowerid with an
10538 // interleaved permutation.
10539 unsigned VPERMILPMask = (Mask[0] == 1) | ((Mask[1] == 1) << 1) |
10540 ((Mask[2] == 3) << 2) | ((Mask[3] == 3) << 3);
10541 return DAG.getNode(X86ISD::VPERMILPI, DL, MVT::v4f64, V1,
10542 DAG.getConstant(VPERMILPMask, DL, MVT::i8));
10545 // With AVX2 we have direct support for this permutation.
10546 if (Subtarget->hasAVX2())
10547 return DAG.getNode(X86ISD::VPERMI, DL, MVT::v4f64, V1,
10548 getV4X86ShuffleImm8ForMask(Mask, DL, DAG));
10550 // Otherwise, fall back.
10551 return lowerVectorShuffleAsLanePermuteAndBlend(DL, MVT::v4f64, V1, V2, Mask,
10555 // Use dedicated unpack instructions for masks that match their pattern.
10557 lowerVectorShuffleWithUNPCK(DL, MVT::v4f64, Mask, V1, V2, DAG))
10560 if (SDValue Blend = lowerVectorShuffleAsBlend(DL, MVT::v4f64, V1, V2, Mask,
10564 // Check if the blend happens to exactly fit that of SHUFPD.
10566 lowerVectorShuffleWithSHUFPD(DL, MVT::v4f64, Mask, V1, V2, DAG))
10569 // Try to simplify this by merging 128-bit lanes to enable a lane-based
10570 // shuffle. However, if we have AVX2 and either inputs are already in place,
10571 // we will be able to shuffle even across lanes the other input in a single
10572 // instruction so skip this pattern.
10573 if (!(Subtarget->hasAVX2() && (isShuffleMaskInputInPlace(0, Mask) ||
10574 isShuffleMaskInputInPlace(1, Mask))))
10575 if (SDValue Result = lowerVectorShuffleByMerging128BitLanes(
10576 DL, MVT::v4f64, V1, V2, Mask, Subtarget, DAG))
10579 // If we have AVX2 then we always want to lower with a blend because an v4 we
10580 // can fully permute the elements.
10581 if (Subtarget->hasAVX2())
10582 return lowerVectorShuffleAsDecomposedShuffleBlend(DL, MVT::v4f64, V1, V2,
10585 // Otherwise fall back on generic lowering.
10586 return lowerVectorShuffleAsSplitOrBlend(DL, MVT::v4f64, V1, V2, Mask, DAG);
10589 /// \brief Handle lowering of 4-lane 64-bit integer shuffles.
10591 /// This routine is only called when we have AVX2 and thus a reasonable
10592 /// instruction set for v4i64 shuffling..
10593 static SDValue lowerV4I64VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
10594 const X86Subtarget *Subtarget,
10595 SelectionDAG &DAG) {
10597 assert(V1.getSimpleValueType() == MVT::v4i64 && "Bad operand type!");
10598 assert(V2.getSimpleValueType() == MVT::v4i64 && "Bad operand type!");
10599 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
10600 ArrayRef<int> Mask = SVOp->getMask();
10601 assert(Mask.size() == 4 && "Unexpected mask size for v4 shuffle!");
10602 assert(Subtarget->hasAVX2() && "We can only lower v4i64 with AVX2!");
10604 SmallVector<int, 4> WidenedMask;
10605 if (canWidenShuffleElements(Mask, WidenedMask))
10606 return lowerV2X128VectorShuffle(DL, MVT::v4i64, V1, V2, Mask, Subtarget,
10609 if (SDValue Blend = lowerVectorShuffleAsBlend(DL, MVT::v4i64, V1, V2, Mask,
10613 // Check for being able to broadcast a single element.
10614 if (SDValue Broadcast = lowerVectorShuffleAsBroadcast(DL, MVT::v4i64, V1,
10615 Mask, Subtarget, DAG))
10618 // When the shuffle is mirrored between the 128-bit lanes of the unit, we can
10619 // use lower latency instructions that will operate on both 128-bit lanes.
10620 SmallVector<int, 2> RepeatedMask;
10621 if (is128BitLaneRepeatedShuffleMask(MVT::v4i64, Mask, RepeatedMask)) {
10622 if (isSingleInputShuffleMask(Mask)) {
10623 int PSHUFDMask[] = {-1, -1, -1, -1};
10624 for (int i = 0; i < 2; ++i)
10625 if (RepeatedMask[i] >= 0) {
10626 PSHUFDMask[2 * i] = 2 * RepeatedMask[i];
10627 PSHUFDMask[2 * i + 1] = 2 * RepeatedMask[i] + 1;
10629 return DAG.getBitcast(
10631 DAG.getNode(X86ISD::PSHUFD, DL, MVT::v8i32,
10632 DAG.getBitcast(MVT::v8i32, V1),
10633 getV4X86ShuffleImm8ForMask(PSHUFDMask, DL, DAG)));
10637 // AVX2 provides a direct instruction for permuting a single input across
10639 if (isSingleInputShuffleMask(Mask))
10640 return DAG.getNode(X86ISD::VPERMI, DL, MVT::v4i64, V1,
10641 getV4X86ShuffleImm8ForMask(Mask, DL, DAG));
10643 // Try to use shift instructions.
10644 if (SDValue Shift =
10645 lowerVectorShuffleAsShift(DL, MVT::v4i64, V1, V2, Mask, DAG))
10648 // Use dedicated unpack instructions for masks that match their pattern.
10650 lowerVectorShuffleWithUNPCK(DL, MVT::v4i64, Mask, V1, V2, DAG))
10653 // Try to simplify this by merging 128-bit lanes to enable a lane-based
10654 // shuffle. However, if we have AVX2 and either inputs are already in place,
10655 // we will be able to shuffle even across lanes the other input in a single
10656 // instruction so skip this pattern.
10657 if (!(Subtarget->hasAVX2() && (isShuffleMaskInputInPlace(0, Mask) ||
10658 isShuffleMaskInputInPlace(1, Mask))))
10659 if (SDValue Result = lowerVectorShuffleByMerging128BitLanes(
10660 DL, MVT::v4i64, V1, V2, Mask, Subtarget, DAG))
10663 // Otherwise fall back on generic blend lowering.
10664 return lowerVectorShuffleAsDecomposedShuffleBlend(DL, MVT::v4i64, V1, V2,
10668 /// \brief Handle lowering of 8-lane 32-bit floating point shuffles.
10670 /// Also ends up handling lowering of 8-lane 32-bit integer shuffles when AVX2
10671 /// isn't available.
10672 static SDValue lowerV8F32VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
10673 const X86Subtarget *Subtarget,
10674 SelectionDAG &DAG) {
10676 assert(V1.getSimpleValueType() == MVT::v8f32 && "Bad operand type!");
10677 assert(V2.getSimpleValueType() == MVT::v8f32 && "Bad operand type!");
10678 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
10679 ArrayRef<int> Mask = SVOp->getMask();
10680 assert(Mask.size() == 8 && "Unexpected mask size for v8 shuffle!");
10682 if (SDValue Blend = lowerVectorShuffleAsBlend(DL, MVT::v8f32, V1, V2, Mask,
10686 // Check for being able to broadcast a single element.
10687 if (SDValue Broadcast = lowerVectorShuffleAsBroadcast(DL, MVT::v8f32, V1,
10688 Mask, Subtarget, DAG))
10691 // If the shuffle mask is repeated in each 128-bit lane, we have many more
10692 // options to efficiently lower the shuffle.
10693 SmallVector<int, 4> RepeatedMask;
10694 if (is128BitLaneRepeatedShuffleMask(MVT::v8f32, Mask, RepeatedMask)) {
10695 assert(RepeatedMask.size() == 4 &&
10696 "Repeated masks must be half the mask width!");
10698 // Use even/odd duplicate instructions for masks that match their pattern.
10699 if (isShuffleEquivalent(V1, V2, Mask, {0, 0, 2, 2, 4, 4, 6, 6}))
10700 return DAG.getNode(X86ISD::MOVSLDUP, DL, MVT::v8f32, V1);
10701 if (isShuffleEquivalent(V1, V2, Mask, {1, 1, 3, 3, 5, 5, 7, 7}))
10702 return DAG.getNode(X86ISD::MOVSHDUP, DL, MVT::v8f32, V1);
10704 if (isSingleInputShuffleMask(Mask))
10705 return DAG.getNode(X86ISD::VPERMILPI, DL, MVT::v8f32, V1,
10706 getV4X86ShuffleImm8ForMask(RepeatedMask, DL, DAG));
10708 // Use dedicated unpack instructions for masks that match their pattern.
10710 lowerVectorShuffleWithUNPCK(DL, MVT::v8f32, Mask, V1, V2, DAG))
10713 // Otherwise, fall back to a SHUFPS sequence. Here it is important that we
10714 // have already handled any direct blends. We also need to squash the
10715 // repeated mask into a simulated v4f32 mask.
10716 for (int i = 0; i < 4; ++i)
10717 if (RepeatedMask[i] >= 8)
10718 RepeatedMask[i] -= 4;
10719 return lowerVectorShuffleWithSHUFPS(DL, MVT::v8f32, RepeatedMask, V1, V2, DAG);
10722 // If we have a single input shuffle with different shuffle patterns in the
10723 // two 128-bit lanes use the variable mask to VPERMILPS.
10724 if (isSingleInputShuffleMask(Mask)) {
10725 SDValue VPermMask[8];
10726 for (int i = 0; i < 8; ++i)
10727 VPermMask[i] = Mask[i] < 0 ? DAG.getUNDEF(MVT::i32)
10728 : DAG.getConstant(Mask[i], DL, MVT::i32);
10729 if (!is128BitLaneCrossingShuffleMask(MVT::v8f32, Mask))
10730 return DAG.getNode(
10731 X86ISD::VPERMILPV, DL, MVT::v8f32, V1,
10732 DAG.getNode(ISD::BUILD_VECTOR, DL, MVT::v8i32, VPermMask));
10734 if (Subtarget->hasAVX2())
10735 return DAG.getNode(
10736 X86ISD::VPERMV, DL, MVT::v8f32,
10737 DAG.getNode(ISD::BUILD_VECTOR, DL, MVT::v8i32, VPermMask), V1);
10739 // Otherwise, fall back.
10740 return lowerVectorShuffleAsLanePermuteAndBlend(DL, MVT::v8f32, V1, V2, Mask,
10744 // Try to simplify this by merging 128-bit lanes to enable a lane-based
10746 if (SDValue Result = lowerVectorShuffleByMerging128BitLanes(
10747 DL, MVT::v8f32, V1, V2, Mask, Subtarget, DAG))
10750 // If we have AVX2 then we always want to lower with a blend because at v8 we
10751 // can fully permute the elements.
10752 if (Subtarget->hasAVX2())
10753 return lowerVectorShuffleAsDecomposedShuffleBlend(DL, MVT::v8f32, V1, V2,
10756 // Otherwise fall back on generic lowering.
10757 return lowerVectorShuffleAsSplitOrBlend(DL, MVT::v8f32, V1, V2, Mask, DAG);
10760 /// \brief Handle lowering of 8-lane 32-bit integer shuffles.
10762 /// This routine is only called when we have AVX2 and thus a reasonable
10763 /// instruction set for v8i32 shuffling..
10764 static SDValue lowerV8I32VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
10765 const X86Subtarget *Subtarget,
10766 SelectionDAG &DAG) {
10768 assert(V1.getSimpleValueType() == MVT::v8i32 && "Bad operand type!");
10769 assert(V2.getSimpleValueType() == MVT::v8i32 && "Bad operand type!");
10770 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
10771 ArrayRef<int> Mask = SVOp->getMask();
10772 assert(Mask.size() == 8 && "Unexpected mask size for v8 shuffle!");
10773 assert(Subtarget->hasAVX2() && "We can only lower v8i32 with AVX2!");
10775 // Whenever we can lower this as a zext, that instruction is strictly faster
10776 // than any alternative. It also allows us to fold memory operands into the
10777 // shuffle in many cases.
10778 if (SDValue ZExt = lowerVectorShuffleAsZeroOrAnyExtend(DL, MVT::v8i32, V1, V2,
10779 Mask, Subtarget, DAG))
10782 if (SDValue Blend = lowerVectorShuffleAsBlend(DL, MVT::v8i32, V1, V2, Mask,
10786 // Check for being able to broadcast a single element.
10787 if (SDValue Broadcast = lowerVectorShuffleAsBroadcast(DL, MVT::v8i32, V1,
10788 Mask, Subtarget, DAG))
10791 // If the shuffle mask is repeated in each 128-bit lane we can use more
10792 // efficient instructions that mirror the shuffles across the two 128-bit
10794 SmallVector<int, 4> RepeatedMask;
10795 if (is128BitLaneRepeatedShuffleMask(MVT::v8i32, Mask, RepeatedMask)) {
10796 assert(RepeatedMask.size() == 4 && "Unexpected repeated mask size!");
10797 if (isSingleInputShuffleMask(Mask))
10798 return DAG.getNode(X86ISD::PSHUFD, DL, MVT::v8i32, V1,
10799 getV4X86ShuffleImm8ForMask(RepeatedMask, DL, DAG));
10801 // Use dedicated unpack instructions for masks that match their pattern.
10803 lowerVectorShuffleWithUNPCK(DL, MVT::v8i32, Mask, V1, V2, DAG))
10807 // Try to use shift instructions.
10808 if (SDValue Shift =
10809 lowerVectorShuffleAsShift(DL, MVT::v8i32, V1, V2, Mask, DAG))
10812 if (SDValue Rotate = lowerVectorShuffleAsByteRotate(
10813 DL, MVT::v8i32, V1, V2, Mask, Subtarget, DAG))
10816 // If the shuffle patterns aren't repeated but it is a single input, directly
10817 // generate a cross-lane VPERMD instruction.
10818 if (isSingleInputShuffleMask(Mask)) {
10819 SDValue VPermMask[8];
10820 for (int i = 0; i < 8; ++i)
10821 VPermMask[i] = Mask[i] < 0 ? DAG.getUNDEF(MVT::i32)
10822 : DAG.getConstant(Mask[i], DL, MVT::i32);
10823 return DAG.getNode(
10824 X86ISD::VPERMV, DL, MVT::v8i32,
10825 DAG.getNode(ISD::BUILD_VECTOR, DL, MVT::v8i32, VPermMask), V1);
10828 // Try to simplify this by merging 128-bit lanes to enable a lane-based
10830 if (SDValue Result = lowerVectorShuffleByMerging128BitLanes(
10831 DL, MVT::v8i32, V1, V2, Mask, Subtarget, DAG))
10834 // Otherwise fall back on generic blend lowering.
10835 return lowerVectorShuffleAsDecomposedShuffleBlend(DL, MVT::v8i32, V1, V2,
10839 /// \brief Handle lowering of 16-lane 16-bit integer shuffles.
10841 /// This routine is only called when we have AVX2 and thus a reasonable
10842 /// instruction set for v16i16 shuffling..
10843 static SDValue lowerV16I16VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
10844 const X86Subtarget *Subtarget,
10845 SelectionDAG &DAG) {
10847 assert(V1.getSimpleValueType() == MVT::v16i16 && "Bad operand type!");
10848 assert(V2.getSimpleValueType() == MVT::v16i16 && "Bad operand type!");
10849 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
10850 ArrayRef<int> Mask = SVOp->getMask();
10851 assert(Mask.size() == 16 && "Unexpected mask size for v16 shuffle!");
10852 assert(Subtarget->hasAVX2() && "We can only lower v16i16 with AVX2!");
10854 // Whenever we can lower this as a zext, that instruction is strictly faster
10855 // than any alternative. It also allows us to fold memory operands into the
10856 // shuffle in many cases.
10857 if (SDValue ZExt = lowerVectorShuffleAsZeroOrAnyExtend(DL, MVT::v16i16, V1, V2,
10858 Mask, Subtarget, DAG))
10861 // Check for being able to broadcast a single element.
10862 if (SDValue Broadcast = lowerVectorShuffleAsBroadcast(DL, MVT::v16i16, V1,
10863 Mask, Subtarget, DAG))
10866 if (SDValue Blend = lowerVectorShuffleAsBlend(DL, MVT::v16i16, V1, V2, Mask,
10870 // Use dedicated unpack instructions for masks that match their pattern.
10872 lowerVectorShuffleWithUNPCK(DL, MVT::v16i16, Mask, V1, V2, DAG))
10875 // Try to use shift instructions.
10876 if (SDValue Shift =
10877 lowerVectorShuffleAsShift(DL, MVT::v16i16, V1, V2, Mask, DAG))
10880 // Try to use byte rotation instructions.
10881 if (SDValue Rotate = lowerVectorShuffleAsByteRotate(
10882 DL, MVT::v16i16, V1, V2, Mask, Subtarget, DAG))
10885 if (isSingleInputShuffleMask(Mask)) {
10886 // There are no generalized cross-lane shuffle operations available on i16
10888 if (is128BitLaneCrossingShuffleMask(MVT::v16i16, Mask))
10889 return lowerVectorShuffleAsLanePermuteAndBlend(DL, MVT::v16i16, V1, V2,
10892 SmallVector<int, 8> RepeatedMask;
10893 if (is128BitLaneRepeatedShuffleMask(MVT::v16i16, Mask, RepeatedMask)) {
10894 // As this is a single-input shuffle, the repeated mask should be
10895 // a strictly valid v8i16 mask that we can pass through to the v8i16
10896 // lowering to handle even the v16 case.
10897 return lowerV8I16GeneralSingleInputVectorShuffle(
10898 DL, MVT::v16i16, V1, RepeatedMask, Subtarget, DAG);
10901 SDValue PSHUFBMask[32];
10902 for (int i = 0; i < 16; ++i) {
10903 if (Mask[i] == -1) {
10904 PSHUFBMask[2 * i] = PSHUFBMask[2 * i + 1] = DAG.getUNDEF(MVT::i8);
10908 int M = i < 8 ? Mask[i] : Mask[i] - 8;
10909 assert(M >= 0 && M < 8 && "Invalid single-input mask!");
10910 PSHUFBMask[2 * i] = DAG.getConstant(2 * M, DL, MVT::i8);
10911 PSHUFBMask[2 * i + 1] = DAG.getConstant(2 * M + 1, DL, MVT::i8);
10913 return DAG.getBitcast(MVT::v16i16,
10914 DAG.getNode(X86ISD::PSHUFB, DL, MVT::v32i8,
10915 DAG.getBitcast(MVT::v32i8, V1),
10916 DAG.getNode(ISD::BUILD_VECTOR, DL,
10917 MVT::v32i8, PSHUFBMask)));
10920 // Try to simplify this by merging 128-bit lanes to enable a lane-based
10922 if (SDValue Result = lowerVectorShuffleByMerging128BitLanes(
10923 DL, MVT::v16i16, V1, V2, Mask, Subtarget, DAG))
10926 // Otherwise fall back on generic lowering.
10927 return lowerVectorShuffleAsSplitOrBlend(DL, MVT::v16i16, V1, V2, Mask, DAG);
10930 /// \brief Handle lowering of 32-lane 8-bit integer shuffles.
10932 /// This routine is only called when we have AVX2 and thus a reasonable
10933 /// instruction set for v32i8 shuffling..
10934 static SDValue lowerV32I8VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
10935 const X86Subtarget *Subtarget,
10936 SelectionDAG &DAG) {
10938 assert(V1.getSimpleValueType() == MVT::v32i8 && "Bad operand type!");
10939 assert(V2.getSimpleValueType() == MVT::v32i8 && "Bad operand type!");
10940 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
10941 ArrayRef<int> Mask = SVOp->getMask();
10942 assert(Mask.size() == 32 && "Unexpected mask size for v32 shuffle!");
10943 assert(Subtarget->hasAVX2() && "We can only lower v32i8 with AVX2!");
10945 // Whenever we can lower this as a zext, that instruction is strictly faster
10946 // than any alternative. It also allows us to fold memory operands into the
10947 // shuffle in many cases.
10948 if (SDValue ZExt = lowerVectorShuffleAsZeroOrAnyExtend(DL, MVT::v32i8, V1, V2,
10949 Mask, Subtarget, DAG))
10952 // Check for being able to broadcast a single element.
10953 if (SDValue Broadcast = lowerVectorShuffleAsBroadcast(DL, MVT::v32i8, V1,
10954 Mask, Subtarget, DAG))
10957 if (SDValue Blend = lowerVectorShuffleAsBlend(DL, MVT::v32i8, V1, V2, Mask,
10961 // Use dedicated unpack instructions for masks that match their pattern.
10963 lowerVectorShuffleWithUNPCK(DL, MVT::v32i8, Mask, V1, V2, DAG))
10966 // Try to use shift instructions.
10967 if (SDValue Shift =
10968 lowerVectorShuffleAsShift(DL, MVT::v32i8, V1, V2, Mask, DAG))
10971 // Try to use byte rotation instructions.
10972 if (SDValue Rotate = lowerVectorShuffleAsByteRotate(
10973 DL, MVT::v32i8, V1, V2, Mask, Subtarget, DAG))
10976 if (isSingleInputShuffleMask(Mask)) {
10977 // There are no generalized cross-lane shuffle operations available on i8
10979 if (is128BitLaneCrossingShuffleMask(MVT::v32i8, Mask))
10980 return lowerVectorShuffleAsLanePermuteAndBlend(DL, MVT::v32i8, V1, V2,
10983 SDValue PSHUFBMask[32];
10984 for (int i = 0; i < 32; ++i)
10987 ? DAG.getUNDEF(MVT::i8)
10988 : DAG.getConstant(Mask[i] < 16 ? Mask[i] : Mask[i] - 16, DL,
10991 return DAG.getNode(
10992 X86ISD::PSHUFB, DL, MVT::v32i8, V1,
10993 DAG.getNode(ISD::BUILD_VECTOR, DL, MVT::v32i8, PSHUFBMask));
10996 // Try to simplify this by merging 128-bit lanes to enable a lane-based
10998 if (SDValue Result = lowerVectorShuffleByMerging128BitLanes(
10999 DL, MVT::v32i8, V1, V2, Mask, Subtarget, DAG))
11002 // Otherwise fall back on generic lowering.
11003 return lowerVectorShuffleAsSplitOrBlend(DL, MVT::v32i8, V1, V2, Mask, DAG);
11006 /// \brief High-level routine to lower various 256-bit x86 vector shuffles.
11008 /// This routine either breaks down the specific type of a 256-bit x86 vector
11009 /// shuffle or splits it into two 128-bit shuffles and fuses the results back
11010 /// together based on the available instructions.
11011 static SDValue lower256BitVectorShuffle(SDValue Op, SDValue V1, SDValue V2,
11012 MVT VT, const X86Subtarget *Subtarget,
11013 SelectionDAG &DAG) {
11015 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
11016 ArrayRef<int> Mask = SVOp->getMask();
11018 // If we have a single input to the zero element, insert that into V1 if we
11019 // can do so cheaply.
11020 int NumElts = VT.getVectorNumElements();
11021 int NumV2Elements = std::count_if(Mask.begin(), Mask.end(), [NumElts](int M) {
11022 return M >= NumElts;
11025 if (NumV2Elements == 1 && Mask[0] >= NumElts)
11026 if (SDValue Insertion = lowerVectorShuffleAsElementInsertion(
11027 DL, VT, V1, V2, Mask, Subtarget, DAG))
11030 // Handle special cases where the lower or upper half is UNDEF.
11032 lowerVectorShuffleWithUndefHalf(DL, VT, V1, V2, Mask, Subtarget, DAG))
11035 // There is a really nice hard cut-over between AVX1 and AVX2 that means we
11036 // can check for those subtargets here and avoid much of the subtarget
11037 // querying in the per-vector-type lowering routines. With AVX1 we have
11038 // essentially *zero* ability to manipulate a 256-bit vector with integer
11039 // types. Since we'll use floating point types there eventually, just
11040 // immediately cast everything to a float and operate entirely in that domain.
11041 if (VT.isInteger() && !Subtarget->hasAVX2()) {
11042 int ElementBits = VT.getScalarSizeInBits();
11043 if (ElementBits < 32)
11044 // No floating point type available, decompose into 128-bit vectors.
11045 return splitAndLowerVectorShuffle(DL, VT, V1, V2, Mask, DAG);
11047 MVT FpVT = MVT::getVectorVT(MVT::getFloatingPointVT(ElementBits),
11048 VT.getVectorNumElements());
11049 V1 = DAG.getBitcast(FpVT, V1);
11050 V2 = DAG.getBitcast(FpVT, V2);
11051 return DAG.getBitcast(VT, DAG.getVectorShuffle(FpVT, DL, V1, V2, Mask));
11054 switch (VT.SimpleTy) {
11056 return lowerV4F64VectorShuffle(Op, V1, V2, Subtarget, DAG);
11058 return lowerV4I64VectorShuffle(Op, V1, V2, Subtarget, DAG);
11060 return lowerV8F32VectorShuffle(Op, V1, V2, Subtarget, DAG);
11062 return lowerV8I32VectorShuffle(Op, V1, V2, Subtarget, DAG);
11064 return lowerV16I16VectorShuffle(Op, V1, V2, Subtarget, DAG);
11066 return lowerV32I8VectorShuffle(Op, V1, V2, Subtarget, DAG);
11069 llvm_unreachable("Not a valid 256-bit x86 vector type!");
11073 /// \brief Try to lower a vector shuffle as a 128-bit shuffles.
11074 static SDValue lowerV4X128VectorShuffle(SDLoc DL, MVT VT,
11075 ArrayRef<int> Mask,
11076 SDValue V1, SDValue V2,
11077 SelectionDAG &DAG) {
11078 assert(VT.getScalarSizeInBits() == 64 &&
11079 "Unexpected element type size for 128bit shuffle.");
11081 // To handle 256 bit vector requires VLX and most probably
11082 // function lowerV2X128VectorShuffle() is better solution.
11083 assert(VT.is512BitVector() && "Unexpected vector size for 128bit shuffle.");
11085 SmallVector<int, 4> WidenedMask;
11086 if (!canWidenShuffleElements(Mask, WidenedMask))
11089 // Form a 128-bit permutation.
11090 // Convert the 64-bit shuffle mask selection values into 128-bit selection
11091 // bits defined by a vshuf64x2 instruction's immediate control byte.
11092 unsigned PermMask = 0, Imm = 0;
11093 unsigned ControlBitsNum = WidenedMask.size() / 2;
11095 for (int i = 0, Size = WidenedMask.size(); i < Size; ++i) {
11096 if (WidenedMask[i] == SM_SentinelZero)
11099 // Use first element in place of undef mask.
11100 Imm = (WidenedMask[i] == SM_SentinelUndef) ? 0 : WidenedMask[i];
11101 PermMask |= (Imm % WidenedMask.size()) << (i * ControlBitsNum);
11104 return DAG.getNode(X86ISD::SHUF128, DL, VT, V1, V2,
11105 DAG.getConstant(PermMask, DL, MVT::i8));
11108 static SDValue lowerVectorShuffleWithPERMV(SDLoc DL, MVT VT,
11109 ArrayRef<int> Mask, SDValue V1,
11110 SDValue V2, SelectionDAG &DAG) {
11112 assert(VT.getScalarSizeInBits() >= 16 && "Unexpected data type for PERMV");
11114 MVT MaskEltVT = MVT::getIntegerVT(VT.getScalarSizeInBits());
11115 MVT MaskVecVT = MVT::getVectorVT(MaskEltVT, VT.getVectorNumElements());
11117 SDValue MaskNode = getConstVector(Mask, MaskVecVT, DAG, DL, true);
11118 if (isSingleInputShuffleMask(Mask))
11119 return DAG.getNode(X86ISD::VPERMV, DL, VT, MaskNode, V1);
11121 return DAG.getNode(X86ISD::VPERMV3, DL, VT, V1, MaskNode, V2);
11124 /// \brief Handle lowering of 8-lane 64-bit floating point shuffles.
11125 static SDValue lowerV8F64VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
11126 const X86Subtarget *Subtarget,
11127 SelectionDAG &DAG) {
11129 assert(V1.getSimpleValueType() == MVT::v8f64 && "Bad operand type!");
11130 assert(V2.getSimpleValueType() == MVT::v8f64 && "Bad operand type!");
11131 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
11132 ArrayRef<int> Mask = SVOp->getMask();
11133 assert(Mask.size() == 8 && "Unexpected mask size for v8 shuffle!");
11135 if (SDValue Shuf128 =
11136 lowerV4X128VectorShuffle(DL, MVT::v8f64, Mask, V1, V2, DAG))
11139 if (SDValue Unpck =
11140 lowerVectorShuffleWithUNPCK(DL, MVT::v8f64, Mask, V1, V2, DAG))
11143 return lowerVectorShuffleWithPERMV(DL, MVT::v8f64, Mask, V1, V2, DAG);
11146 /// \brief Handle lowering of 16-lane 32-bit floating point shuffles.
11147 static SDValue lowerV16F32VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
11148 const X86Subtarget *Subtarget,
11149 SelectionDAG &DAG) {
11151 assert(V1.getSimpleValueType() == MVT::v16f32 && "Bad operand type!");
11152 assert(V2.getSimpleValueType() == MVT::v16f32 && "Bad operand type!");
11153 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
11154 ArrayRef<int> Mask = SVOp->getMask();
11155 assert(Mask.size() == 16 && "Unexpected mask size for v16 shuffle!");
11157 if (SDValue Unpck =
11158 lowerVectorShuffleWithUNPCK(DL, MVT::v16f32, Mask, V1, V2, DAG))
11161 return lowerVectorShuffleWithPERMV(DL, MVT::v16f32, Mask, V1, V2, DAG);
11164 /// \brief Handle lowering of 8-lane 64-bit integer shuffles.
11165 static SDValue lowerV8I64VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
11166 const X86Subtarget *Subtarget,
11167 SelectionDAG &DAG) {
11169 assert(V1.getSimpleValueType() == MVT::v8i64 && "Bad operand type!");
11170 assert(V2.getSimpleValueType() == MVT::v8i64 && "Bad operand type!");
11171 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
11172 ArrayRef<int> Mask = SVOp->getMask();
11173 assert(Mask.size() == 8 && "Unexpected mask size for v8 shuffle!");
11175 if (SDValue Shuf128 =
11176 lowerV4X128VectorShuffle(DL, MVT::v8i64, Mask, V1, V2, DAG))
11179 if (SDValue Unpck =
11180 lowerVectorShuffleWithUNPCK(DL, MVT::v8i64, Mask, V1, V2, DAG))
11183 return lowerVectorShuffleWithPERMV(DL, MVT::v8i64, Mask, V1, V2, DAG);
11186 /// \brief Handle lowering of 16-lane 32-bit integer shuffles.
11187 static SDValue lowerV16I32VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
11188 const X86Subtarget *Subtarget,
11189 SelectionDAG &DAG) {
11191 assert(V1.getSimpleValueType() == MVT::v16i32 && "Bad operand type!");
11192 assert(V2.getSimpleValueType() == MVT::v16i32 && "Bad operand type!");
11193 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
11194 ArrayRef<int> Mask = SVOp->getMask();
11195 assert(Mask.size() == 16 && "Unexpected mask size for v16 shuffle!");
11197 if (SDValue Unpck =
11198 lowerVectorShuffleWithUNPCK(DL, MVT::v16i32, Mask, V1, V2, DAG))
11201 return lowerVectorShuffleWithPERMV(DL, MVT::v16i32, Mask, V1, V2, DAG);
11204 /// \brief Handle lowering of 32-lane 16-bit integer shuffles.
11205 static SDValue lowerV32I16VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
11206 const X86Subtarget *Subtarget,
11207 SelectionDAG &DAG) {
11209 assert(V1.getSimpleValueType() == MVT::v32i16 && "Bad operand type!");
11210 assert(V2.getSimpleValueType() == MVT::v32i16 && "Bad operand type!");
11211 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
11212 ArrayRef<int> Mask = SVOp->getMask();
11213 assert(Mask.size() == 32 && "Unexpected mask size for v32 shuffle!");
11214 assert(Subtarget->hasBWI() && "We can only lower v32i16 with AVX-512-BWI!");
11216 return lowerVectorShuffleWithPERMV(DL, MVT::v32i16, Mask, V1, V2, DAG);
11219 /// \brief Handle lowering of 64-lane 8-bit integer shuffles.
11220 static SDValue lowerV64I8VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
11221 const X86Subtarget *Subtarget,
11222 SelectionDAG &DAG) {
11224 assert(V1.getSimpleValueType() == MVT::v64i8 && "Bad operand type!");
11225 assert(V2.getSimpleValueType() == MVT::v64i8 && "Bad operand type!");
11226 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
11227 ArrayRef<int> Mask = SVOp->getMask();
11228 assert(Mask.size() == 64 && "Unexpected mask size for v64 shuffle!");
11229 assert(Subtarget->hasBWI() && "We can only lower v64i8 with AVX-512-BWI!");
11231 // FIXME: Implement direct support for this type!
11232 return splitAndLowerVectorShuffle(DL, MVT::v64i8, V1, V2, Mask, DAG);
11235 /// \brief High-level routine to lower various 512-bit x86 vector shuffles.
11237 /// This routine either breaks down the specific type of a 512-bit x86 vector
11238 /// shuffle or splits it into two 256-bit shuffles and fuses the results back
11239 /// together based on the available instructions.
11240 static SDValue lower512BitVectorShuffle(SDValue Op, SDValue V1, SDValue V2,
11241 MVT VT, const X86Subtarget *Subtarget,
11242 SelectionDAG &DAG) {
11244 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
11245 ArrayRef<int> Mask = SVOp->getMask();
11246 assert(Subtarget->hasAVX512() &&
11247 "Cannot lower 512-bit vectors w/ basic ISA!");
11249 // Check for being able to broadcast a single element.
11250 if (SDValue Broadcast =
11251 lowerVectorShuffleAsBroadcast(DL, VT, V1, Mask, Subtarget, DAG))
11254 // Dispatch to each element type for lowering. If we don't have supprot for
11255 // specific element type shuffles at 512 bits, immediately split them and
11256 // lower them. Each lowering routine of a given type is allowed to assume that
11257 // the requisite ISA extensions for that element type are available.
11258 switch (VT.SimpleTy) {
11260 return lowerV8F64VectorShuffle(Op, V1, V2, Subtarget, DAG);
11262 return lowerV16F32VectorShuffle(Op, V1, V2, Subtarget, DAG);
11264 return lowerV8I64VectorShuffle(Op, V1, V2, Subtarget, DAG);
11266 return lowerV16I32VectorShuffle(Op, V1, V2, Subtarget, DAG);
11268 if (Subtarget->hasBWI())
11269 return lowerV32I16VectorShuffle(Op, V1, V2, Subtarget, DAG);
11272 if (Subtarget->hasBWI())
11273 return lowerV64I8VectorShuffle(Op, V1, V2, Subtarget, DAG);
11277 llvm_unreachable("Not a valid 512-bit x86 vector type!");
11280 // Otherwise fall back on splitting.
11281 return splitAndLowerVectorShuffle(DL, VT, V1, V2, Mask, DAG);
11284 // Lower vXi1 vector shuffles.
11285 // There is no a dedicated instruction on AVX-512 that shuffles the masks.
11286 // The only way to shuffle bits is to sign-extend the mask vector to SIMD
11287 // vector, shuffle and then truncate it back.
11288 static SDValue lower1BitVectorShuffle(SDValue Op, SDValue V1, SDValue V2,
11289 MVT VT, const X86Subtarget *Subtarget,
11290 SelectionDAG &DAG) {
11292 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
11293 ArrayRef<int> Mask = SVOp->getMask();
11294 assert(Subtarget->hasAVX512() &&
11295 "Cannot lower 512-bit vectors w/o basic ISA!");
11297 switch (VT.SimpleTy) {
11299 llvm_unreachable("Expected a vector of i1 elements");
11301 ExtVT = MVT::v2i64;
11304 ExtVT = MVT::v4i32;
11307 ExtVT = MVT::v8i64; // Take 512-bit type, more shuffles on KNL
11310 ExtVT = MVT::v16i32;
11313 ExtVT = MVT::v32i16;
11316 ExtVT = MVT::v64i8;
11320 if (ISD::isBuildVectorAllZeros(V1.getNode()))
11321 V1 = getZeroVector(ExtVT, Subtarget, DAG, DL);
11322 else if (ISD::isBuildVectorAllOnes(V1.getNode()))
11323 V1 = getOnesVector(ExtVT, Subtarget, DAG, DL);
11325 V1 = DAG.getNode(ISD::SIGN_EXTEND, DL, ExtVT, V1);
11328 V2 = DAG.getUNDEF(ExtVT);
11329 else if (ISD::isBuildVectorAllZeros(V2.getNode()))
11330 V2 = getZeroVector(ExtVT, Subtarget, DAG, DL);
11331 else if (ISD::isBuildVectorAllOnes(V2.getNode()))
11332 V2 = getOnesVector(ExtVT, Subtarget, DAG, DL);
11334 V2 = DAG.getNode(ISD::SIGN_EXTEND, DL, ExtVT, V2);
11335 return DAG.getNode(ISD::TRUNCATE, DL, VT,
11336 DAG.getVectorShuffle(ExtVT, DL, V1, V2, Mask));
11338 /// \brief Top-level lowering for x86 vector shuffles.
11340 /// This handles decomposition, canonicalization, and lowering of all x86
11341 /// vector shuffles. Most of the specific lowering strategies are encapsulated
11342 /// above in helper routines. The canonicalization attempts to widen shuffles
11343 /// to involve fewer lanes of wider elements, consolidate symmetric patterns
11344 /// s.t. only one of the two inputs needs to be tested, etc.
11345 static SDValue lowerVectorShuffle(SDValue Op, const X86Subtarget *Subtarget,
11346 SelectionDAG &DAG) {
11347 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
11348 ArrayRef<int> Mask = SVOp->getMask();
11349 SDValue V1 = Op.getOperand(0);
11350 SDValue V2 = Op.getOperand(1);
11351 MVT VT = Op.getSimpleValueType();
11352 int NumElements = VT.getVectorNumElements();
11354 bool Is1BitVector = (VT.getVectorElementType() == MVT::i1);
11356 assert((VT.getSizeInBits() != 64 || Is1BitVector) &&
11357 "Can't lower MMX shuffles");
11359 bool V1IsUndef = V1.getOpcode() == ISD::UNDEF;
11360 bool V2IsUndef = V2.getOpcode() == ISD::UNDEF;
11361 if (V1IsUndef && V2IsUndef)
11362 return DAG.getUNDEF(VT);
11364 // When we create a shuffle node we put the UNDEF node to second operand,
11365 // but in some cases the first operand may be transformed to UNDEF.
11366 // In this case we should just commute the node.
11368 return DAG.getCommutedVectorShuffle(*SVOp);
11370 // Check for non-undef masks pointing at an undef vector and make the masks
11371 // undef as well. This makes it easier to match the shuffle based solely on
11375 if (M >= NumElements) {
11376 SmallVector<int, 8> NewMask(Mask.begin(), Mask.end());
11377 for (int &M : NewMask)
11378 if (M >= NumElements)
11380 return DAG.getVectorShuffle(VT, dl, V1, V2, NewMask);
11383 // We actually see shuffles that are entirely re-arrangements of a set of
11384 // zero inputs. This mostly happens while decomposing complex shuffles into
11385 // simple ones. Directly lower these as a buildvector of zeros.
11386 SmallBitVector Zeroable = computeZeroableShuffleElements(Mask, V1, V2);
11387 if (Zeroable.all())
11388 return getZeroVector(VT, Subtarget, DAG, dl);
11390 // Try to collapse shuffles into using a vector type with fewer elements but
11391 // wider element types. We cap this to not form integers or floating point
11392 // elements wider than 64 bits, but it might be interesting to form i128
11393 // integers to handle flipping the low and high halves of AVX 256-bit vectors.
11394 SmallVector<int, 16> WidenedMask;
11395 if (VT.getScalarSizeInBits() < 64 && !Is1BitVector &&
11396 canWidenShuffleElements(Mask, WidenedMask)) {
11397 MVT NewEltVT = VT.isFloatingPoint()
11398 ? MVT::getFloatingPointVT(VT.getScalarSizeInBits() * 2)
11399 : MVT::getIntegerVT(VT.getScalarSizeInBits() * 2);
11400 MVT NewVT = MVT::getVectorVT(NewEltVT, VT.getVectorNumElements() / 2);
11401 // Make sure that the new vector type is legal. For example, v2f64 isn't
11403 if (DAG.getTargetLoweringInfo().isTypeLegal(NewVT)) {
11404 V1 = DAG.getBitcast(NewVT, V1);
11405 V2 = DAG.getBitcast(NewVT, V2);
11406 return DAG.getBitcast(
11407 VT, DAG.getVectorShuffle(NewVT, dl, V1, V2, WidenedMask));
11411 int NumV1Elements = 0, NumUndefElements = 0, NumV2Elements = 0;
11412 for (int M : SVOp->getMask())
11414 ++NumUndefElements;
11415 else if (M < NumElements)
11420 // Commute the shuffle as needed such that more elements come from V1 than
11421 // V2. This allows us to match the shuffle pattern strictly on how many
11422 // elements come from V1 without handling the symmetric cases.
11423 if (NumV2Elements > NumV1Elements)
11424 return DAG.getCommutedVectorShuffle(*SVOp);
11426 // When the number of V1 and V2 elements are the same, try to minimize the
11427 // number of uses of V2 in the low half of the vector. When that is tied,
11428 // ensure that the sum of indices for V1 is equal to or lower than the sum
11429 // indices for V2. When those are equal, try to ensure that the number of odd
11430 // indices for V1 is lower than the number of odd indices for V2.
11431 if (NumV1Elements == NumV2Elements) {
11432 int LowV1Elements = 0, LowV2Elements = 0;
11433 for (int M : SVOp->getMask().slice(0, NumElements / 2))
11434 if (M >= NumElements)
11438 if (LowV2Elements > LowV1Elements) {
11439 return DAG.getCommutedVectorShuffle(*SVOp);
11440 } else if (LowV2Elements == LowV1Elements) {
11441 int SumV1Indices = 0, SumV2Indices = 0;
11442 for (int i = 0, Size = SVOp->getMask().size(); i < Size; ++i)
11443 if (SVOp->getMask()[i] >= NumElements)
11445 else if (SVOp->getMask()[i] >= 0)
11447 if (SumV2Indices < SumV1Indices) {
11448 return DAG.getCommutedVectorShuffle(*SVOp);
11449 } else if (SumV2Indices == SumV1Indices) {
11450 int NumV1OddIndices = 0, NumV2OddIndices = 0;
11451 for (int i = 0, Size = SVOp->getMask().size(); i < Size; ++i)
11452 if (SVOp->getMask()[i] >= NumElements)
11453 NumV2OddIndices += i % 2;
11454 else if (SVOp->getMask()[i] >= 0)
11455 NumV1OddIndices += i % 2;
11456 if (NumV2OddIndices < NumV1OddIndices)
11457 return DAG.getCommutedVectorShuffle(*SVOp);
11462 // For each vector width, delegate to a specialized lowering routine.
11463 if (VT.is128BitVector())
11464 return lower128BitVectorShuffle(Op, V1, V2, VT, Subtarget, DAG);
11466 if (VT.is256BitVector())
11467 return lower256BitVectorShuffle(Op, V1, V2, VT, Subtarget, DAG);
11469 if (VT.is512BitVector())
11470 return lower512BitVectorShuffle(Op, V1, V2, VT, Subtarget, DAG);
11473 return lower1BitVectorShuffle(Op, V1, V2, VT, Subtarget, DAG);
11474 llvm_unreachable("Unimplemented!");
11477 // This function assumes its argument is a BUILD_VECTOR of constants or
11478 // undef SDNodes. i.e: ISD::isBuildVectorOfConstantSDNodes(BuildVector) is
11480 static bool BUILD_VECTORtoBlendMask(BuildVectorSDNode *BuildVector,
11481 unsigned &MaskValue) {
11483 unsigned NumElems = BuildVector->getNumOperands();
11485 // There are 2 lanes if (NumElems > 8), and 1 lane otherwise.
11486 // We don't handle the >2 lanes case right now.
11487 unsigned NumLanes = (NumElems - 1) / 8 + 1;
11491 unsigned NumElemsInLane = NumElems / NumLanes;
11493 // Blend for v16i16 should be symmetric for the both lanes.
11494 for (unsigned i = 0; i < NumElemsInLane; ++i) {
11495 SDValue EltCond = BuildVector->getOperand(i);
11496 SDValue SndLaneEltCond =
11497 (NumLanes == 2) ? BuildVector->getOperand(i + NumElemsInLane) : EltCond;
11499 int Lane1Cond = -1, Lane2Cond = -1;
11500 if (isa<ConstantSDNode>(EltCond))
11501 Lane1Cond = !isNullConstant(EltCond);
11502 if (isa<ConstantSDNode>(SndLaneEltCond))
11503 Lane2Cond = !isNullConstant(SndLaneEltCond);
11505 unsigned LaneMask = 0;
11506 if (Lane1Cond == Lane2Cond || Lane2Cond < 0)
11507 // Lane1Cond != 0, means we want the first argument.
11508 // Lane1Cond == 0, means we want the second argument.
11509 // The encoding of this argument is 0 for the first argument, 1
11510 // for the second. Therefore, invert the condition.
11511 LaneMask = !Lane1Cond << i;
11512 else if (Lane1Cond < 0)
11513 LaneMask = !Lane2Cond << i;
11517 MaskValue |= LaneMask;
11519 MaskValue |= LaneMask << NumElemsInLane;
11524 /// \brief Try to lower a VSELECT instruction to a vector shuffle.
11525 static SDValue lowerVSELECTtoVectorShuffle(SDValue Op,
11526 const X86Subtarget *Subtarget,
11527 SelectionDAG &DAG) {
11528 SDValue Cond = Op.getOperand(0);
11529 SDValue LHS = Op.getOperand(1);
11530 SDValue RHS = Op.getOperand(2);
11532 MVT VT = Op.getSimpleValueType();
11534 if (!ISD::isBuildVectorOfConstantSDNodes(Cond.getNode()))
11536 auto *CondBV = cast<BuildVectorSDNode>(Cond);
11538 // Only non-legal VSELECTs reach this lowering, convert those into generic
11539 // shuffles and re-use the shuffle lowering path for blends.
11540 SmallVector<int, 32> Mask;
11541 for (int i = 0, Size = VT.getVectorNumElements(); i < Size; ++i) {
11542 SDValue CondElt = CondBV->getOperand(i);
11544 isa<ConstantSDNode>(CondElt) ? i + (isNullConstant(CondElt) ? Size : 0)
11547 return DAG.getVectorShuffle(VT, dl, LHS, RHS, Mask);
11550 SDValue X86TargetLowering::LowerVSELECT(SDValue Op, SelectionDAG &DAG) const {
11551 // A vselect where all conditions and data are constants can be optimized into
11552 // a single vector load by SelectionDAGLegalize::ExpandBUILD_VECTOR().
11553 if (ISD::isBuildVectorOfConstantSDNodes(Op.getOperand(0).getNode()) &&
11554 ISD::isBuildVectorOfConstantSDNodes(Op.getOperand(1).getNode()) &&
11555 ISD::isBuildVectorOfConstantSDNodes(Op.getOperand(2).getNode()))
11558 // Try to lower this to a blend-style vector shuffle. This can handle all
11559 // constant condition cases.
11560 if (SDValue BlendOp = lowerVSELECTtoVectorShuffle(Op, Subtarget, DAG))
11563 // Variable blends are only legal from SSE4.1 onward.
11564 if (!Subtarget->hasSSE41())
11567 // Only some types will be legal on some subtargets. If we can emit a legal
11568 // VSELECT-matching blend, return Op, and but if we need to expand, return
11570 switch (Op.getSimpleValueType().SimpleTy) {
11572 // Most of the vector types have blends past SSE4.1.
11576 // The byte blends for AVX vectors were introduced only in AVX2.
11577 if (Subtarget->hasAVX2())
11584 // AVX-512 BWI and VLX features support VSELECT with i16 elements.
11585 if (Subtarget->hasBWI() && Subtarget->hasVLX())
11588 // FIXME: We should custom lower this by fixing the condition and using i8
11594 static SDValue LowerEXTRACT_VECTOR_ELT_SSE4(SDValue Op, SelectionDAG &DAG) {
11595 MVT VT = Op.getSimpleValueType();
11598 if (!Op.getOperand(0).getSimpleValueType().is128BitVector())
11601 if (VT.getSizeInBits() == 8) {
11602 SDValue Extract = DAG.getNode(X86ISD::PEXTRB, dl, MVT::i32,
11603 Op.getOperand(0), Op.getOperand(1));
11604 SDValue Assert = DAG.getNode(ISD::AssertZext, dl, MVT::i32, Extract,
11605 DAG.getValueType(VT));
11606 return DAG.getNode(ISD::TRUNCATE, dl, VT, Assert);
11609 if (VT.getSizeInBits() == 16) {
11610 // If Idx is 0, it's cheaper to do a move instead of a pextrw.
11611 if (isNullConstant(Op.getOperand(1)))
11612 return DAG.getNode(
11613 ISD::TRUNCATE, dl, MVT::i16,
11614 DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::i32,
11615 DAG.getBitcast(MVT::v4i32, Op.getOperand(0)),
11616 Op.getOperand(1)));
11617 SDValue Extract = DAG.getNode(X86ISD::PEXTRW, dl, MVT::i32,
11618 Op.getOperand(0), Op.getOperand(1));
11619 SDValue Assert = DAG.getNode(ISD::AssertZext, dl, MVT::i32, Extract,
11620 DAG.getValueType(VT));
11621 return DAG.getNode(ISD::TRUNCATE, dl, VT, Assert);
11624 if (VT == MVT::f32) {
11625 // EXTRACTPS outputs to a GPR32 register which will require a movd to copy
11626 // the result back to FR32 register. It's only worth matching if the
11627 // result has a single use which is a store or a bitcast to i32. And in
11628 // the case of a store, it's not worth it if the index is a constant 0,
11629 // because a MOVSSmr can be used instead, which is smaller and faster.
11630 if (!Op.hasOneUse())
11632 SDNode *User = *Op.getNode()->use_begin();
11633 if ((User->getOpcode() != ISD::STORE ||
11634 isNullConstant(Op.getOperand(1))) &&
11635 (User->getOpcode() != ISD::BITCAST ||
11636 User->getValueType(0) != MVT::i32))
11638 SDValue Extract = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::i32,
11639 DAG.getBitcast(MVT::v4i32, Op.getOperand(0)),
11641 return DAG.getBitcast(MVT::f32, Extract);
11644 if (VT == MVT::i32 || VT == MVT::i64) {
11645 // ExtractPS/pextrq works with constant index.
11646 if (isa<ConstantSDNode>(Op.getOperand(1)))
11652 /// Extract one bit from mask vector, like v16i1 or v8i1.
11653 /// AVX-512 feature.
11655 X86TargetLowering::ExtractBitFromMaskVector(SDValue Op, SelectionDAG &DAG) const {
11656 SDValue Vec = Op.getOperand(0);
11658 MVT VecVT = Vec.getSimpleValueType();
11659 SDValue Idx = Op.getOperand(1);
11660 MVT EltVT = Op.getSimpleValueType();
11662 assert((EltVT == MVT::i1) && "Unexpected operands in ExtractBitFromMaskVector");
11663 assert((VecVT.getVectorNumElements() <= 16 || Subtarget->hasBWI()) &&
11664 "Unexpected vector type in ExtractBitFromMaskVector");
11666 // variable index can't be handled in mask registers,
11667 // extend vector to VR512
11668 if (!isa<ConstantSDNode>(Idx)) {
11669 MVT ExtVT = (VecVT == MVT::v8i1 ? MVT::v8i64 : MVT::v16i32);
11670 SDValue Ext = DAG.getNode(ISD::ZERO_EXTEND, dl, ExtVT, Vec);
11671 SDValue Elt = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl,
11672 ExtVT.getVectorElementType(), Ext, Idx);
11673 return DAG.getNode(ISD::TRUNCATE, dl, EltVT, Elt);
11676 unsigned IdxVal = cast<ConstantSDNode>(Idx)->getZExtValue();
11677 const TargetRegisterClass* rc = getRegClassFor(VecVT);
11678 if (!Subtarget->hasDQI() && (VecVT.getVectorNumElements() <= 8))
11679 rc = getRegClassFor(MVT::v16i1);
11680 unsigned MaxSift = rc->getSize()*8 - 1;
11681 Vec = DAG.getNode(X86ISD::VSHLI, dl, VecVT, Vec,
11682 DAG.getConstant(MaxSift - IdxVal, dl, MVT::i8));
11683 Vec = DAG.getNode(X86ISD::VSRLI, dl, VecVT, Vec,
11684 DAG.getConstant(MaxSift, dl, MVT::i8));
11685 return DAG.getNode(X86ISD::VEXTRACT, dl, MVT::i1, Vec,
11686 DAG.getIntPtrConstant(0, dl));
11690 X86TargetLowering::LowerEXTRACT_VECTOR_ELT(SDValue Op,
11691 SelectionDAG &DAG) const {
11693 SDValue Vec = Op.getOperand(0);
11694 MVT VecVT = Vec.getSimpleValueType();
11695 SDValue Idx = Op.getOperand(1);
11697 if (Op.getSimpleValueType() == MVT::i1)
11698 return ExtractBitFromMaskVector(Op, DAG);
11700 if (!isa<ConstantSDNode>(Idx)) {
11701 if (VecVT.is512BitVector() ||
11702 (VecVT.is256BitVector() && Subtarget->hasInt256() &&
11703 VecVT.getVectorElementType().getSizeInBits() == 32)) {
11706 MVT::getIntegerVT(VecVT.getVectorElementType().getSizeInBits());
11707 MVT MaskVT = MVT::getVectorVT(MaskEltVT, VecVT.getSizeInBits() /
11708 MaskEltVT.getSizeInBits());
11710 Idx = DAG.getZExtOrTrunc(Idx, dl, MaskEltVT);
11711 auto PtrVT = getPointerTy(DAG.getDataLayout());
11712 SDValue Mask = DAG.getNode(X86ISD::VINSERT, dl, MaskVT,
11713 getZeroVector(MaskVT, Subtarget, DAG, dl), Idx,
11714 DAG.getConstant(0, dl, PtrVT));
11715 SDValue Perm = DAG.getNode(X86ISD::VPERMV, dl, VecVT, Mask, Vec);
11716 return DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, Op.getValueType(), Perm,
11717 DAG.getConstant(0, dl, PtrVT));
11722 // If this is a 256-bit vector result, first extract the 128-bit vector and
11723 // then extract the element from the 128-bit vector.
11724 if (VecVT.is256BitVector() || VecVT.is512BitVector()) {
11726 unsigned IdxVal = cast<ConstantSDNode>(Idx)->getZExtValue();
11727 // Get the 128-bit vector.
11728 Vec = Extract128BitVector(Vec, IdxVal, DAG, dl);
11729 MVT EltVT = VecVT.getVectorElementType();
11731 unsigned ElemsPerChunk = 128 / EltVT.getSizeInBits();
11732 assert(isPowerOf2_32(ElemsPerChunk) && "Elements per chunk not power of 2");
11734 // Find IdxVal modulo ElemsPerChunk. Since ElemsPerChunk is a power of 2
11735 // this can be done with a mask.
11736 IdxVal &= ElemsPerChunk - 1;
11737 return DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, Op.getValueType(), Vec,
11738 DAG.getConstant(IdxVal, dl, MVT::i32));
11741 assert(VecVT.is128BitVector() && "Unexpected vector length");
11743 if (Subtarget->hasSSE41())
11744 if (SDValue Res = LowerEXTRACT_VECTOR_ELT_SSE4(Op, DAG))
11747 MVT VT = Op.getSimpleValueType();
11748 // TODO: handle v16i8.
11749 if (VT.getSizeInBits() == 16) {
11750 SDValue Vec = Op.getOperand(0);
11751 if (isNullConstant(Op.getOperand(1)))
11752 return DAG.getNode(ISD::TRUNCATE, dl, MVT::i16,
11753 DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::i32,
11754 DAG.getBitcast(MVT::v4i32, Vec),
11755 Op.getOperand(1)));
11756 // Transform it so it match pextrw which produces a 32-bit result.
11757 MVT EltVT = MVT::i32;
11758 SDValue Extract = DAG.getNode(X86ISD::PEXTRW, dl, EltVT,
11759 Op.getOperand(0), Op.getOperand(1));
11760 SDValue Assert = DAG.getNode(ISD::AssertZext, dl, EltVT, Extract,
11761 DAG.getValueType(VT));
11762 return DAG.getNode(ISD::TRUNCATE, dl, VT, Assert);
11765 if (VT.getSizeInBits() == 32) {
11766 unsigned Idx = cast<ConstantSDNode>(Op.getOperand(1))->getZExtValue();
11770 // SHUFPS the element to the lowest double word, then movss.
11771 int Mask[4] = { static_cast<int>(Idx), -1, -1, -1 };
11772 MVT VVT = Op.getOperand(0).getSimpleValueType();
11773 SDValue Vec = DAG.getVectorShuffle(VVT, dl, Op.getOperand(0),
11774 DAG.getUNDEF(VVT), Mask);
11775 return DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, VT, Vec,
11776 DAG.getIntPtrConstant(0, dl));
11779 if (VT.getSizeInBits() == 64) {
11780 // FIXME: .td only matches this for <2 x f64>, not <2 x i64> on 32b
11781 // FIXME: seems like this should be unnecessary if mov{h,l}pd were taught
11782 // to match extract_elt for f64.
11783 if (isNullConstant(Op.getOperand(1)))
11786 // UNPCKHPD the element to the lowest double word, then movsd.
11787 // Note if the lower 64 bits of the result of the UNPCKHPD is then stored
11788 // to a f64mem, the whole operation is folded into a single MOVHPDmr.
11789 int Mask[2] = { 1, -1 };
11790 MVT VVT = Op.getOperand(0).getSimpleValueType();
11791 SDValue Vec = DAG.getVectorShuffle(VVT, dl, Op.getOperand(0),
11792 DAG.getUNDEF(VVT), Mask);
11793 return DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, VT, Vec,
11794 DAG.getIntPtrConstant(0, dl));
11800 /// Insert one bit to mask vector, like v16i1 or v8i1.
11801 /// AVX-512 feature.
11803 X86TargetLowering::InsertBitToMaskVector(SDValue Op, SelectionDAG &DAG) const {
11805 SDValue Vec = Op.getOperand(0);
11806 SDValue Elt = Op.getOperand(1);
11807 SDValue Idx = Op.getOperand(2);
11808 MVT VecVT = Vec.getSimpleValueType();
11810 if (!isa<ConstantSDNode>(Idx)) {
11811 // Non constant index. Extend source and destination,
11812 // insert element and then truncate the result.
11813 MVT ExtVecVT = (VecVT == MVT::v8i1 ? MVT::v8i64 : MVT::v16i32);
11814 MVT ExtEltVT = (VecVT == MVT::v8i1 ? MVT::i64 : MVT::i32);
11815 SDValue ExtOp = DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, ExtVecVT,
11816 DAG.getNode(ISD::ZERO_EXTEND, dl, ExtVecVT, Vec),
11817 DAG.getNode(ISD::ZERO_EXTEND, dl, ExtEltVT, Elt), Idx);
11818 return DAG.getNode(ISD::TRUNCATE, dl, VecVT, ExtOp);
11821 unsigned IdxVal = cast<ConstantSDNode>(Idx)->getZExtValue();
11822 SDValue EltInVec = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VecVT, Elt);
11824 EltInVec = DAG.getNode(X86ISD::VSHLI, dl, VecVT, EltInVec,
11825 DAG.getConstant(IdxVal, dl, MVT::i8));
11826 if (Vec.getOpcode() == ISD::UNDEF)
11828 return DAG.getNode(ISD::OR, dl, VecVT, Vec, EltInVec);
11831 SDValue X86TargetLowering::LowerINSERT_VECTOR_ELT(SDValue Op,
11832 SelectionDAG &DAG) const {
11833 MVT VT = Op.getSimpleValueType();
11834 MVT EltVT = VT.getVectorElementType();
11836 if (EltVT == MVT::i1)
11837 return InsertBitToMaskVector(Op, DAG);
11840 SDValue N0 = Op.getOperand(0);
11841 SDValue N1 = Op.getOperand(1);
11842 SDValue N2 = Op.getOperand(2);
11843 if (!isa<ConstantSDNode>(N2))
11845 auto *N2C = cast<ConstantSDNode>(N2);
11846 unsigned IdxVal = N2C->getZExtValue();
11848 // If the vector is wider than 128 bits, extract the 128-bit subvector, insert
11849 // into that, and then insert the subvector back into the result.
11850 if (VT.is256BitVector() || VT.is512BitVector()) {
11851 // With a 256-bit vector, we can insert into the zero element efficiently
11852 // using a blend if we have AVX or AVX2 and the right data type.
11853 if (VT.is256BitVector() && IdxVal == 0) {
11854 // TODO: It is worthwhile to cast integer to floating point and back
11855 // and incur a domain crossing penalty if that's what we'll end up
11856 // doing anyway after extracting to a 128-bit vector.
11857 if ((Subtarget->hasAVX() && (EltVT == MVT::f64 || EltVT == MVT::f32)) ||
11858 (Subtarget->hasAVX2() && EltVT == MVT::i32)) {
11859 SDValue N1Vec = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VT, N1);
11860 N2 = DAG.getIntPtrConstant(1, dl);
11861 return DAG.getNode(X86ISD::BLENDI, dl, VT, N0, N1Vec, N2);
11865 // Get the desired 128-bit vector chunk.
11866 SDValue V = Extract128BitVector(N0, IdxVal, DAG, dl);
11868 // Insert the element into the desired chunk.
11869 unsigned NumEltsIn128 = 128 / EltVT.getSizeInBits();
11870 assert(isPowerOf2_32(NumEltsIn128));
11871 // Since NumEltsIn128 is a power of 2 we can use mask instead of modulo.
11872 unsigned IdxIn128 = IdxVal & (NumEltsIn128 - 1);
11874 V = DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, V.getValueType(), V, N1,
11875 DAG.getConstant(IdxIn128, dl, MVT::i32));
11877 // Insert the changed part back into the bigger vector
11878 return Insert128BitVector(N0, V, IdxVal, DAG, dl);
11880 assert(VT.is128BitVector() && "Only 128-bit vector types should be left!");
11882 if (Subtarget->hasSSE41()) {
11883 if (EltVT.getSizeInBits() == 8 || EltVT.getSizeInBits() == 16) {
11885 if (VT == MVT::v8i16) {
11886 Opc = X86ISD::PINSRW;
11888 assert(VT == MVT::v16i8);
11889 Opc = X86ISD::PINSRB;
11892 // Transform it so it match pinsr{b,w} which expects a GR32 as its second
11894 if (N1.getValueType() != MVT::i32)
11895 N1 = DAG.getNode(ISD::ANY_EXTEND, dl, MVT::i32, N1);
11896 if (N2.getValueType() != MVT::i32)
11897 N2 = DAG.getIntPtrConstant(IdxVal, dl);
11898 return DAG.getNode(Opc, dl, VT, N0, N1, N2);
11901 if (EltVT == MVT::f32) {
11902 // Bits [7:6] of the constant are the source select. This will always be
11903 // zero here. The DAG Combiner may combine an extract_elt index into
11904 // these bits. For example (insert (extract, 3), 2) could be matched by
11905 // putting the '3' into bits [7:6] of X86ISD::INSERTPS.
11906 // Bits [5:4] of the constant are the destination select. This is the
11907 // value of the incoming immediate.
11908 // Bits [3:0] of the constant are the zero mask. The DAG Combiner may
11909 // combine either bitwise AND or insert of float 0.0 to set these bits.
11911 bool MinSize = DAG.getMachineFunction().getFunction()->optForMinSize();
11912 if (IdxVal == 0 && (!MinSize || !MayFoldLoad(N1))) {
11913 // If this is an insertion of 32-bits into the low 32-bits of
11914 // a vector, we prefer to generate a blend with immediate rather
11915 // than an insertps. Blends are simpler operations in hardware and so
11916 // will always have equal or better performance than insertps.
11917 // But if optimizing for size and there's a load folding opportunity,
11918 // generate insertps because blendps does not have a 32-bit memory
11920 N2 = DAG.getIntPtrConstant(1, dl);
11921 N1 = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, MVT::v4f32, N1);
11922 return DAG.getNode(X86ISD::BLENDI, dl, VT, N0, N1, N2);
11924 N2 = DAG.getIntPtrConstant(IdxVal << 4, dl);
11925 // Create this as a scalar to vector..
11926 N1 = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, MVT::v4f32, N1);
11927 return DAG.getNode(X86ISD::INSERTPS, dl, VT, N0, N1, N2);
11930 if (EltVT == MVT::i32 || EltVT == MVT::i64) {
11931 // PINSR* works with constant index.
11936 if (EltVT == MVT::i8)
11939 if (EltVT.getSizeInBits() == 16) {
11940 // Transform it so it match pinsrw which expects a 16-bit value in a GR32
11941 // as its second argument.
11942 if (N1.getValueType() != MVT::i32)
11943 N1 = DAG.getNode(ISD::ANY_EXTEND, dl, MVT::i32, N1);
11944 if (N2.getValueType() != MVT::i32)
11945 N2 = DAG.getIntPtrConstant(IdxVal, dl);
11946 return DAG.getNode(X86ISD::PINSRW, dl, VT, N0, N1, N2);
11951 static SDValue LowerSCALAR_TO_VECTOR(SDValue Op, SelectionDAG &DAG) {
11953 MVT OpVT = Op.getSimpleValueType();
11955 // If this is a 256-bit vector result, first insert into a 128-bit
11956 // vector and then insert into the 256-bit vector.
11957 if (!OpVT.is128BitVector()) {
11958 // Insert into a 128-bit vector.
11959 unsigned SizeFactor = OpVT.getSizeInBits()/128;
11960 MVT VT128 = MVT::getVectorVT(OpVT.getVectorElementType(),
11961 OpVT.getVectorNumElements() / SizeFactor);
11963 Op = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VT128, Op.getOperand(0));
11965 // Insert the 128-bit vector.
11966 return Insert128BitVector(DAG.getUNDEF(OpVT), Op, 0, DAG, dl);
11969 if (OpVT == MVT::v1i64 &&
11970 Op.getOperand(0).getValueType() == MVT::i64)
11971 return DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, MVT::v1i64, Op.getOperand(0));
11973 SDValue AnyExt = DAG.getNode(ISD::ANY_EXTEND, dl, MVT::i32, Op.getOperand(0));
11974 assert(OpVT.is128BitVector() && "Expected an SSE type!");
11975 return DAG.getBitcast(
11976 OpVT, DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, MVT::v4i32, AnyExt));
11979 // Lower a node with an EXTRACT_SUBVECTOR opcode. This may result in
11980 // a simple subregister reference or explicit instructions to grab
11981 // upper bits of a vector.
11982 static SDValue LowerEXTRACT_SUBVECTOR(SDValue Op, const X86Subtarget *Subtarget,
11983 SelectionDAG &DAG) {
11985 SDValue In = Op.getOperand(0);
11986 SDValue Idx = Op.getOperand(1);
11987 unsigned IdxVal = cast<ConstantSDNode>(Idx)->getZExtValue();
11988 MVT ResVT = Op.getSimpleValueType();
11989 MVT InVT = In.getSimpleValueType();
11991 if (Subtarget->hasFp256()) {
11992 if (ResVT.is128BitVector() &&
11993 (InVT.is256BitVector() || InVT.is512BitVector()) &&
11994 isa<ConstantSDNode>(Idx)) {
11995 return Extract128BitVector(In, IdxVal, DAG, dl);
11997 if (ResVT.is256BitVector() && InVT.is512BitVector() &&
11998 isa<ConstantSDNode>(Idx)) {
11999 return Extract256BitVector(In, IdxVal, DAG, dl);
12005 // Lower a node with an INSERT_SUBVECTOR opcode. This may result in a
12006 // simple superregister reference or explicit instructions to insert
12007 // the upper bits of a vector.
12008 static SDValue LowerINSERT_SUBVECTOR(SDValue Op, const X86Subtarget *Subtarget,
12009 SelectionDAG &DAG) {
12010 if (!Subtarget->hasAVX())
12014 SDValue Vec = Op.getOperand(0);
12015 SDValue SubVec = Op.getOperand(1);
12016 SDValue Idx = Op.getOperand(2);
12018 if (!isa<ConstantSDNode>(Idx))
12021 unsigned IdxVal = cast<ConstantSDNode>(Idx)->getZExtValue();
12022 MVT OpVT = Op.getSimpleValueType();
12023 MVT SubVecVT = SubVec.getSimpleValueType();
12025 // Fold two 16-byte subvector loads into one 32-byte load:
12026 // (insert_subvector (insert_subvector undef, (load addr), 0),
12027 // (load addr + 16), Elts/2)
12029 if ((IdxVal == OpVT.getVectorNumElements() / 2) &&
12030 Vec.getOpcode() == ISD::INSERT_SUBVECTOR &&
12031 OpVT.is256BitVector() && SubVecVT.is128BitVector()) {
12032 auto *Idx2 = dyn_cast<ConstantSDNode>(Vec.getOperand(2));
12033 if (Idx2 && Idx2->getZExtValue() == 0) {
12034 SDValue SubVec2 = Vec.getOperand(1);
12035 // If needed, look through a bitcast to get to the load.
12036 if (SubVec2.getNode() && SubVec2.getOpcode() == ISD::BITCAST)
12037 SubVec2 = SubVec2.getOperand(0);
12039 if (auto *FirstLd = dyn_cast<LoadSDNode>(SubVec2)) {
12041 unsigned Alignment = FirstLd->getAlignment();
12042 unsigned AS = FirstLd->getAddressSpace();
12043 const X86TargetLowering *TLI = Subtarget->getTargetLowering();
12044 if (TLI->allowsMemoryAccess(*DAG.getContext(), DAG.getDataLayout(),
12045 OpVT, AS, Alignment, &Fast) && Fast) {
12046 SDValue Ops[] = { SubVec2, SubVec };
12047 if (SDValue Ld = EltsFromConsecutiveLoads(OpVT, Ops, dl, DAG, false))
12054 if ((OpVT.is256BitVector() || OpVT.is512BitVector()) &&
12055 SubVecVT.is128BitVector())
12056 return Insert128BitVector(Vec, SubVec, IdxVal, DAG, dl);
12058 if (OpVT.is512BitVector() && SubVecVT.is256BitVector())
12059 return Insert256BitVector(Vec, SubVec, IdxVal, DAG, dl);
12061 if (OpVT.getVectorElementType() == MVT::i1)
12062 return Insert1BitVector(Op, DAG);
12067 // ConstantPool, JumpTable, GlobalAddress, and ExternalSymbol are lowered as
12068 // their target countpart wrapped in the X86ISD::Wrapper node. Suppose N is
12069 // one of the above mentioned nodes. It has to be wrapped because otherwise
12070 // Select(N) returns N. So the raw TargetGlobalAddress nodes, etc. can only
12071 // be used to form addressing mode. These wrapped nodes will be selected
12074 X86TargetLowering::LowerConstantPool(SDValue Op, SelectionDAG &DAG) const {
12075 ConstantPoolSDNode *CP = cast<ConstantPoolSDNode>(Op);
12077 // In PIC mode (unless we're in RIPRel PIC mode) we add an offset to the
12078 // global base reg.
12079 unsigned char OpFlag = 0;
12080 unsigned WrapperKind = X86ISD::Wrapper;
12081 CodeModel::Model M = DAG.getTarget().getCodeModel();
12083 if (Subtarget->isPICStyleRIPRel() &&
12084 (M == CodeModel::Small || M == CodeModel::Kernel))
12085 WrapperKind = X86ISD::WrapperRIP;
12086 else if (Subtarget->isPICStyleGOT())
12087 OpFlag = X86II::MO_GOTOFF;
12088 else if (Subtarget->isPICStyleStubPIC())
12089 OpFlag = X86II::MO_PIC_BASE_OFFSET;
12091 auto PtrVT = getPointerTy(DAG.getDataLayout());
12092 SDValue Result = DAG.getTargetConstantPool(
12093 CP->getConstVal(), PtrVT, CP->getAlignment(), CP->getOffset(), OpFlag);
12095 Result = DAG.getNode(WrapperKind, DL, PtrVT, Result);
12096 // With PIC, the address is actually $g + Offset.
12099 DAG.getNode(ISD::ADD, DL, PtrVT,
12100 DAG.getNode(X86ISD::GlobalBaseReg, SDLoc(), PtrVT), Result);
12106 SDValue X86TargetLowering::LowerJumpTable(SDValue Op, SelectionDAG &DAG) const {
12107 JumpTableSDNode *JT = cast<JumpTableSDNode>(Op);
12109 // In PIC mode (unless we're in RIPRel PIC mode) we add an offset to the
12110 // global base reg.
12111 unsigned char OpFlag = 0;
12112 unsigned WrapperKind = X86ISD::Wrapper;
12113 CodeModel::Model M = DAG.getTarget().getCodeModel();
12115 if (Subtarget->isPICStyleRIPRel() &&
12116 (M == CodeModel::Small || M == CodeModel::Kernel))
12117 WrapperKind = X86ISD::WrapperRIP;
12118 else if (Subtarget->isPICStyleGOT())
12119 OpFlag = X86II::MO_GOTOFF;
12120 else if (Subtarget->isPICStyleStubPIC())
12121 OpFlag = X86II::MO_PIC_BASE_OFFSET;
12123 auto PtrVT = getPointerTy(DAG.getDataLayout());
12124 SDValue Result = DAG.getTargetJumpTable(JT->getIndex(), PtrVT, OpFlag);
12126 Result = DAG.getNode(WrapperKind, DL, PtrVT, Result);
12128 // With PIC, the address is actually $g + Offset.
12131 DAG.getNode(ISD::ADD, DL, PtrVT,
12132 DAG.getNode(X86ISD::GlobalBaseReg, SDLoc(), PtrVT), Result);
12138 X86TargetLowering::LowerExternalSymbol(SDValue Op, SelectionDAG &DAG) const {
12139 const char *Sym = cast<ExternalSymbolSDNode>(Op)->getSymbol();
12141 // In PIC mode (unless we're in RIPRel PIC mode) we add an offset to the
12142 // global base reg.
12143 unsigned char OpFlag = 0;
12144 unsigned WrapperKind = X86ISD::Wrapper;
12145 CodeModel::Model M = DAG.getTarget().getCodeModel();
12147 if (Subtarget->isPICStyleRIPRel() &&
12148 (M == CodeModel::Small || M == CodeModel::Kernel)) {
12149 if (Subtarget->isTargetDarwin() || Subtarget->isTargetELF())
12150 OpFlag = X86II::MO_GOTPCREL;
12151 WrapperKind = X86ISD::WrapperRIP;
12152 } else if (Subtarget->isPICStyleGOT()) {
12153 OpFlag = X86II::MO_GOT;
12154 } else if (Subtarget->isPICStyleStubPIC()) {
12155 OpFlag = X86II::MO_DARWIN_NONLAZY_PIC_BASE;
12156 } else if (Subtarget->isPICStyleStubNoDynamic()) {
12157 OpFlag = X86II::MO_DARWIN_NONLAZY;
12160 auto PtrVT = getPointerTy(DAG.getDataLayout());
12161 SDValue Result = DAG.getTargetExternalSymbol(Sym, PtrVT, OpFlag);
12164 Result = DAG.getNode(WrapperKind, DL, PtrVT, Result);
12166 // With PIC, the address is actually $g + Offset.
12167 if (DAG.getTarget().getRelocationModel() == Reloc::PIC_ &&
12168 !Subtarget->is64Bit()) {
12170 DAG.getNode(ISD::ADD, DL, PtrVT,
12171 DAG.getNode(X86ISD::GlobalBaseReg, SDLoc(), PtrVT), Result);
12174 // For symbols that require a load from a stub to get the address, emit the
12176 if (isGlobalStubReference(OpFlag))
12177 Result = DAG.getLoad(PtrVT, DL, DAG.getEntryNode(), Result,
12178 MachinePointerInfo::getGOT(DAG.getMachineFunction()),
12179 false, false, false, 0);
12185 X86TargetLowering::LowerBlockAddress(SDValue Op, SelectionDAG &DAG) const {
12186 // Create the TargetBlockAddressAddress node.
12187 unsigned char OpFlags =
12188 Subtarget->ClassifyBlockAddressReference();
12189 CodeModel::Model M = DAG.getTarget().getCodeModel();
12190 const BlockAddress *BA = cast<BlockAddressSDNode>(Op)->getBlockAddress();
12191 int64_t Offset = cast<BlockAddressSDNode>(Op)->getOffset();
12193 auto PtrVT = getPointerTy(DAG.getDataLayout());
12194 SDValue Result = DAG.getTargetBlockAddress(BA, PtrVT, Offset, OpFlags);
12196 if (Subtarget->isPICStyleRIPRel() &&
12197 (M == CodeModel::Small || M == CodeModel::Kernel))
12198 Result = DAG.getNode(X86ISD::WrapperRIP, dl, PtrVT, Result);
12200 Result = DAG.getNode(X86ISD::Wrapper, dl, PtrVT, Result);
12202 // With PIC, the address is actually $g + Offset.
12203 if (isGlobalRelativeToPICBase(OpFlags)) {
12204 Result = DAG.getNode(ISD::ADD, dl, PtrVT,
12205 DAG.getNode(X86ISD::GlobalBaseReg, dl, PtrVT), Result);
12212 X86TargetLowering::LowerGlobalAddress(const GlobalValue *GV, SDLoc dl,
12213 int64_t Offset, SelectionDAG &DAG) const {
12214 // Create the TargetGlobalAddress node, folding in the constant
12215 // offset if it is legal.
12216 unsigned char OpFlags =
12217 Subtarget->ClassifyGlobalReference(GV, DAG.getTarget());
12218 CodeModel::Model M = DAG.getTarget().getCodeModel();
12219 auto PtrVT = getPointerTy(DAG.getDataLayout());
12221 if (OpFlags == X86II::MO_NO_FLAG &&
12222 X86::isOffsetSuitableForCodeModel(Offset, M)) {
12223 // A direct static reference to a global.
12224 Result = DAG.getTargetGlobalAddress(GV, dl, PtrVT, Offset);
12227 Result = DAG.getTargetGlobalAddress(GV, dl, PtrVT, 0, OpFlags);
12230 if (Subtarget->isPICStyleRIPRel() &&
12231 (M == CodeModel::Small || M == CodeModel::Kernel))
12232 Result = DAG.getNode(X86ISD::WrapperRIP, dl, PtrVT, Result);
12234 Result = DAG.getNode(X86ISD::Wrapper, dl, PtrVT, Result);
12236 // With PIC, the address is actually $g + Offset.
12237 if (isGlobalRelativeToPICBase(OpFlags)) {
12238 Result = DAG.getNode(ISD::ADD, dl, PtrVT,
12239 DAG.getNode(X86ISD::GlobalBaseReg, dl, PtrVT), Result);
12242 // For globals that require a load from a stub to get the address, emit the
12244 if (isGlobalStubReference(OpFlags))
12245 Result = DAG.getLoad(PtrVT, dl, DAG.getEntryNode(), Result,
12246 MachinePointerInfo::getGOT(DAG.getMachineFunction()),
12247 false, false, false, 0);
12249 // If there was a non-zero offset that we didn't fold, create an explicit
12250 // addition for it.
12252 Result = DAG.getNode(ISD::ADD, dl, PtrVT, Result,
12253 DAG.getConstant(Offset, dl, PtrVT));
12259 X86TargetLowering::LowerGlobalAddress(SDValue Op, SelectionDAG &DAG) const {
12260 const GlobalValue *GV = cast<GlobalAddressSDNode>(Op)->getGlobal();
12261 int64_t Offset = cast<GlobalAddressSDNode>(Op)->getOffset();
12262 return LowerGlobalAddress(GV, SDLoc(Op), Offset, DAG);
12266 GetTLSADDR(SelectionDAG &DAG, SDValue Chain, GlobalAddressSDNode *GA,
12267 SDValue *InFlag, const EVT PtrVT, unsigned ReturnReg,
12268 unsigned char OperandFlags, bool LocalDynamic = false) {
12269 MachineFrameInfo *MFI = DAG.getMachineFunction().getFrameInfo();
12270 SDVTList NodeTys = DAG.getVTList(MVT::Other, MVT::Glue);
12272 SDValue TGA = DAG.getTargetGlobalAddress(GA->getGlobal(), dl,
12273 GA->getValueType(0),
12277 X86ISD::NodeType CallType = LocalDynamic ? X86ISD::TLSBASEADDR
12281 SDValue Ops[] = { Chain, TGA, *InFlag };
12282 Chain = DAG.getNode(CallType, dl, NodeTys, Ops);
12284 SDValue Ops[] = { Chain, TGA };
12285 Chain = DAG.getNode(CallType, dl, NodeTys, Ops);
12288 // TLSADDR will be codegen'ed as call. Inform MFI that function has calls.
12289 MFI->setAdjustsStack(true);
12290 MFI->setHasCalls(true);
12292 SDValue Flag = Chain.getValue(1);
12293 return DAG.getCopyFromReg(Chain, dl, ReturnReg, PtrVT, Flag);
12296 // Lower ISD::GlobalTLSAddress using the "general dynamic" model, 32 bit
12298 LowerToTLSGeneralDynamicModel32(GlobalAddressSDNode *GA, SelectionDAG &DAG,
12301 SDLoc dl(GA); // ? function entry point might be better
12302 SDValue Chain = DAG.getCopyToReg(DAG.getEntryNode(), dl, X86::EBX,
12303 DAG.getNode(X86ISD::GlobalBaseReg,
12304 SDLoc(), PtrVT), InFlag);
12305 InFlag = Chain.getValue(1);
12307 return GetTLSADDR(DAG, Chain, GA, &InFlag, PtrVT, X86::EAX, X86II::MO_TLSGD);
12310 // Lower ISD::GlobalTLSAddress using the "general dynamic" model, 64 bit
12312 LowerToTLSGeneralDynamicModel64(GlobalAddressSDNode *GA, SelectionDAG &DAG,
12314 return GetTLSADDR(DAG, DAG.getEntryNode(), GA, nullptr, PtrVT,
12315 X86::RAX, X86II::MO_TLSGD);
12318 static SDValue LowerToTLSLocalDynamicModel(GlobalAddressSDNode *GA,
12324 // Get the start address of the TLS block for this module.
12325 X86MachineFunctionInfo* MFI = DAG.getMachineFunction()
12326 .getInfo<X86MachineFunctionInfo>();
12327 MFI->incNumLocalDynamicTLSAccesses();
12331 Base = GetTLSADDR(DAG, DAG.getEntryNode(), GA, nullptr, PtrVT, X86::RAX,
12332 X86II::MO_TLSLD, /*LocalDynamic=*/true);
12335 SDValue Chain = DAG.getCopyToReg(DAG.getEntryNode(), dl, X86::EBX,
12336 DAG.getNode(X86ISD::GlobalBaseReg, SDLoc(), PtrVT), InFlag);
12337 InFlag = Chain.getValue(1);
12338 Base = GetTLSADDR(DAG, Chain, GA, &InFlag, PtrVT, X86::EAX,
12339 X86II::MO_TLSLDM, /*LocalDynamic=*/true);
12342 // Note: the CleanupLocalDynamicTLSPass will remove redundant computations
12346 unsigned char OperandFlags = X86II::MO_DTPOFF;
12347 unsigned WrapperKind = X86ISD::Wrapper;
12348 SDValue TGA = DAG.getTargetGlobalAddress(GA->getGlobal(), dl,
12349 GA->getValueType(0),
12350 GA->getOffset(), OperandFlags);
12351 SDValue Offset = DAG.getNode(WrapperKind, dl, PtrVT, TGA);
12353 // Add x@dtpoff with the base.
12354 return DAG.getNode(ISD::ADD, dl, PtrVT, Offset, Base);
12357 // Lower ISD::GlobalTLSAddress using the "initial exec" or "local exec" model.
12358 static SDValue LowerToTLSExecModel(GlobalAddressSDNode *GA, SelectionDAG &DAG,
12359 const EVT PtrVT, TLSModel::Model model,
12360 bool is64Bit, bool isPIC) {
12363 // Get the Thread Pointer, which is %gs:0 (32-bit) or %fs:0 (64-bit).
12364 Value *Ptr = Constant::getNullValue(Type::getInt8PtrTy(*DAG.getContext(),
12365 is64Bit ? 257 : 256));
12367 SDValue ThreadPointer =
12368 DAG.getLoad(PtrVT, dl, DAG.getEntryNode(), DAG.getIntPtrConstant(0, dl),
12369 MachinePointerInfo(Ptr), false, false, false, 0);
12371 unsigned char OperandFlags = 0;
12372 // Most TLS accesses are not RIP relative, even on x86-64. One exception is
12374 unsigned WrapperKind = X86ISD::Wrapper;
12375 if (model == TLSModel::LocalExec) {
12376 OperandFlags = is64Bit ? X86II::MO_TPOFF : X86II::MO_NTPOFF;
12377 } else if (model == TLSModel::InitialExec) {
12379 OperandFlags = X86II::MO_GOTTPOFF;
12380 WrapperKind = X86ISD::WrapperRIP;
12382 OperandFlags = isPIC ? X86II::MO_GOTNTPOFF : X86II::MO_INDNTPOFF;
12385 llvm_unreachable("Unexpected model");
12388 // emit "addl x@ntpoff,%eax" (local exec)
12389 // or "addl x@indntpoff,%eax" (initial exec)
12390 // or "addl x@gotntpoff(%ebx) ,%eax" (initial exec, 32-bit pic)
12392 DAG.getTargetGlobalAddress(GA->getGlobal(), dl, GA->getValueType(0),
12393 GA->getOffset(), OperandFlags);
12394 SDValue Offset = DAG.getNode(WrapperKind, dl, PtrVT, TGA);
12396 if (model == TLSModel::InitialExec) {
12397 if (isPIC && !is64Bit) {
12398 Offset = DAG.getNode(ISD::ADD, dl, PtrVT,
12399 DAG.getNode(X86ISD::GlobalBaseReg, SDLoc(), PtrVT),
12403 Offset = DAG.getLoad(PtrVT, dl, DAG.getEntryNode(), Offset,
12404 MachinePointerInfo::getGOT(DAG.getMachineFunction()),
12405 false, false, false, 0);
12408 // The address of the thread local variable is the add of the thread
12409 // pointer with the offset of the variable.
12410 return DAG.getNode(ISD::ADD, dl, PtrVT, ThreadPointer, Offset);
12414 X86TargetLowering::LowerGlobalTLSAddress(SDValue Op, SelectionDAG &DAG) const {
12416 GlobalAddressSDNode *GA = cast<GlobalAddressSDNode>(Op);
12418 // Cygwin uses emutls.
12419 // FIXME: It may be EmulatedTLS-generic also for X86-Android.
12420 if (Subtarget->isTargetWindowsCygwin())
12421 return LowerToTLSEmulatedModel(GA, DAG);
12423 const GlobalValue *GV = GA->getGlobal();
12424 auto PtrVT = getPointerTy(DAG.getDataLayout());
12426 if (Subtarget->isTargetELF()) {
12427 if (DAG.getTarget().Options.EmulatedTLS)
12428 return LowerToTLSEmulatedModel(GA, DAG);
12429 TLSModel::Model model = DAG.getTarget().getTLSModel(GV);
12431 case TLSModel::GeneralDynamic:
12432 if (Subtarget->is64Bit())
12433 return LowerToTLSGeneralDynamicModel64(GA, DAG, PtrVT);
12434 return LowerToTLSGeneralDynamicModel32(GA, DAG, PtrVT);
12435 case TLSModel::LocalDynamic:
12436 return LowerToTLSLocalDynamicModel(GA, DAG, PtrVT,
12437 Subtarget->is64Bit());
12438 case TLSModel::InitialExec:
12439 case TLSModel::LocalExec:
12440 return LowerToTLSExecModel(GA, DAG, PtrVT, model, Subtarget->is64Bit(),
12441 DAG.getTarget().getRelocationModel() ==
12444 llvm_unreachable("Unknown TLS model.");
12447 if (Subtarget->isTargetDarwin()) {
12448 // Darwin only has one model of TLS. Lower to that.
12449 unsigned char OpFlag = 0;
12450 unsigned WrapperKind = Subtarget->isPICStyleRIPRel() ?
12451 X86ISD::WrapperRIP : X86ISD::Wrapper;
12453 // In PIC mode (unless we're in RIPRel PIC mode) we add an offset to the
12454 // global base reg.
12455 bool PIC32 = (DAG.getTarget().getRelocationModel() == Reloc::PIC_) &&
12456 !Subtarget->is64Bit();
12458 OpFlag = X86II::MO_TLVP_PIC_BASE;
12460 OpFlag = X86II::MO_TLVP;
12462 SDValue Result = DAG.getTargetGlobalAddress(GA->getGlobal(), DL,
12463 GA->getValueType(0),
12464 GA->getOffset(), OpFlag);
12465 SDValue Offset = DAG.getNode(WrapperKind, DL, PtrVT, Result);
12467 // With PIC32, the address is actually $g + Offset.
12469 Offset = DAG.getNode(ISD::ADD, DL, PtrVT,
12470 DAG.getNode(X86ISD::GlobalBaseReg, SDLoc(), PtrVT),
12473 // Lowering the machine isd will make sure everything is in the right
12475 SDValue Chain = DAG.getEntryNode();
12476 SDVTList NodeTys = DAG.getVTList(MVT::Other, MVT::Glue);
12477 Chain = DAG.getCALLSEQ_START(Chain, DAG.getIntPtrConstant(0, DL, true), DL);
12478 SDValue Args[] = { Chain, Offset };
12479 Chain = DAG.getNode(X86ISD::TLSCALL, DL, NodeTys, Args);
12481 DAG.getCALLSEQ_END(Chain, DAG.getIntPtrConstant(0, DL, true),
12482 DAG.getIntPtrConstant(0, DL, true), SDValue(), DL);
12484 // TLSCALL will be codegen'ed as call. Inform MFI that function has calls.
12485 MachineFrameInfo *MFI = DAG.getMachineFunction().getFrameInfo();
12486 MFI->setAdjustsStack(true);
12488 // And our return value (tls address) is in the standard call return value
12490 unsigned Reg = Subtarget->is64Bit() ? X86::RAX : X86::EAX;
12491 return DAG.getCopyFromReg(Chain, DL, Reg, PtrVT, Chain.getValue(1));
12494 if (Subtarget->isTargetKnownWindowsMSVC() ||
12495 Subtarget->isTargetWindowsGNU()) {
12496 // Just use the implicit TLS architecture
12497 // Need to generate someting similar to:
12498 // mov rdx, qword [gs:abs 58H]; Load pointer to ThreadLocalStorage
12500 // mov ecx, dword [rel _tls_index]: Load index (from C runtime)
12501 // mov rcx, qword [rdx+rcx*8]
12502 // mov eax, .tls$:tlsvar
12503 // [rax+rcx] contains the address
12504 // Windows 64bit: gs:0x58
12505 // Windows 32bit: fs:__tls_array
12508 SDValue Chain = DAG.getEntryNode();
12510 // Get the Thread Pointer, which is %fs:__tls_array (32-bit) or
12511 // %gs:0x58 (64-bit). On MinGW, __tls_array is not available, so directly
12512 // use its literal value of 0x2C.
12513 Value *Ptr = Constant::getNullValue(Subtarget->is64Bit()
12514 ? Type::getInt8PtrTy(*DAG.getContext(),
12516 : Type::getInt32PtrTy(*DAG.getContext(),
12519 SDValue TlsArray = Subtarget->is64Bit()
12520 ? DAG.getIntPtrConstant(0x58, dl)
12521 : (Subtarget->isTargetWindowsGNU()
12522 ? DAG.getIntPtrConstant(0x2C, dl)
12523 : DAG.getExternalSymbol("_tls_array", PtrVT));
12525 SDValue ThreadPointer =
12526 DAG.getLoad(PtrVT, dl, Chain, TlsArray, MachinePointerInfo(Ptr), false,
12530 if (GV->getThreadLocalMode() == GlobalVariable::LocalExecTLSModel) {
12531 res = ThreadPointer;
12533 // Load the _tls_index variable
12534 SDValue IDX = DAG.getExternalSymbol("_tls_index", PtrVT);
12535 if (Subtarget->is64Bit())
12536 IDX = DAG.getExtLoad(ISD::ZEXTLOAD, dl, PtrVT, Chain, IDX,
12537 MachinePointerInfo(), MVT::i32, false, false,
12540 IDX = DAG.getLoad(PtrVT, dl, Chain, IDX, MachinePointerInfo(), false,
12543 auto &DL = DAG.getDataLayout();
12545 DAG.getConstant(Log2_64_Ceil(DL.getPointerSize()), dl, PtrVT);
12546 IDX = DAG.getNode(ISD::SHL, dl, PtrVT, IDX, Scale);
12548 res = DAG.getNode(ISD::ADD, dl, PtrVT, ThreadPointer, IDX);
12551 res = DAG.getLoad(PtrVT, dl, Chain, res, MachinePointerInfo(), false, false,
12554 // Get the offset of start of .tls section
12555 SDValue TGA = DAG.getTargetGlobalAddress(GA->getGlobal(), dl,
12556 GA->getValueType(0),
12557 GA->getOffset(), X86II::MO_SECREL);
12558 SDValue Offset = DAG.getNode(X86ISD::Wrapper, dl, PtrVT, TGA);
12560 // The address of the thread local variable is the add of the thread
12561 // pointer with the offset of the variable.
12562 return DAG.getNode(ISD::ADD, dl, PtrVT, res, Offset);
12565 llvm_unreachable("TLS not implemented for this target.");
12568 /// LowerShiftParts - Lower SRA_PARTS and friends, which return two i32 values
12569 /// and take a 2 x i32 value to shift plus a shift amount.
12570 static SDValue LowerShiftParts(SDValue Op, SelectionDAG &DAG) {
12571 assert(Op.getNumOperands() == 3 && "Not a double-shift!");
12572 MVT VT = Op.getSimpleValueType();
12573 unsigned VTBits = VT.getSizeInBits();
12575 bool isSRA = Op.getOpcode() == ISD::SRA_PARTS;
12576 SDValue ShOpLo = Op.getOperand(0);
12577 SDValue ShOpHi = Op.getOperand(1);
12578 SDValue ShAmt = Op.getOperand(2);
12579 // X86ISD::SHLD and X86ISD::SHRD have defined overflow behavior but the
12580 // generic ISD nodes haven't. Insert an AND to be safe, it's optimized away
12582 SDValue SafeShAmt = DAG.getNode(ISD::AND, dl, MVT::i8, ShAmt,
12583 DAG.getConstant(VTBits - 1, dl, MVT::i8));
12584 SDValue Tmp1 = isSRA ? DAG.getNode(ISD::SRA, dl, VT, ShOpHi,
12585 DAG.getConstant(VTBits - 1, dl, MVT::i8))
12586 : DAG.getConstant(0, dl, VT);
12588 SDValue Tmp2, Tmp3;
12589 if (Op.getOpcode() == ISD::SHL_PARTS) {
12590 Tmp2 = DAG.getNode(X86ISD::SHLD, dl, VT, ShOpHi, ShOpLo, ShAmt);
12591 Tmp3 = DAG.getNode(ISD::SHL, dl, VT, ShOpLo, SafeShAmt);
12593 Tmp2 = DAG.getNode(X86ISD::SHRD, dl, VT, ShOpLo, ShOpHi, ShAmt);
12594 Tmp3 = DAG.getNode(isSRA ? ISD::SRA : ISD::SRL, dl, VT, ShOpHi, SafeShAmt);
12597 // If the shift amount is larger or equal than the width of a part we can't
12598 // rely on the results of shld/shrd. Insert a test and select the appropriate
12599 // values for large shift amounts.
12600 SDValue AndNode = DAG.getNode(ISD::AND, dl, MVT::i8, ShAmt,
12601 DAG.getConstant(VTBits, dl, MVT::i8));
12602 SDValue Cond = DAG.getNode(X86ISD::CMP, dl, MVT::i32,
12603 AndNode, DAG.getConstant(0, dl, MVT::i8));
12606 SDValue CC = DAG.getConstant(X86::COND_NE, dl, MVT::i8);
12607 SDValue Ops0[4] = { Tmp2, Tmp3, CC, Cond };
12608 SDValue Ops1[4] = { Tmp3, Tmp1, CC, Cond };
12610 if (Op.getOpcode() == ISD::SHL_PARTS) {
12611 Hi = DAG.getNode(X86ISD::CMOV, dl, VT, Ops0);
12612 Lo = DAG.getNode(X86ISD::CMOV, dl, VT, Ops1);
12614 Lo = DAG.getNode(X86ISD::CMOV, dl, VT, Ops0);
12615 Hi = DAG.getNode(X86ISD::CMOV, dl, VT, Ops1);
12618 SDValue Ops[2] = { Lo, Hi };
12619 return DAG.getMergeValues(Ops, dl);
12622 SDValue X86TargetLowering::LowerSINT_TO_FP(SDValue Op,
12623 SelectionDAG &DAG) const {
12624 SDValue Src = Op.getOperand(0);
12625 MVT SrcVT = Src.getSimpleValueType();
12626 MVT VT = Op.getSimpleValueType();
12629 if (SrcVT.isVector()) {
12630 if (SrcVT == MVT::v2i32 && VT == MVT::v2f64) {
12631 return DAG.getNode(X86ISD::CVTDQ2PD, dl, VT,
12632 DAG.getNode(ISD::CONCAT_VECTORS, dl, MVT::v4i32, Src,
12633 DAG.getUNDEF(SrcVT)));
12635 if (SrcVT.getVectorElementType() == MVT::i1) {
12636 MVT IntegerVT = MVT::getVectorVT(MVT::i32, SrcVT.getVectorNumElements());
12637 return DAG.getNode(ISD::SINT_TO_FP, dl, Op.getValueType(),
12638 DAG.getNode(ISD::SIGN_EXTEND, dl, IntegerVT, Src));
12643 assert(SrcVT <= MVT::i64 && SrcVT >= MVT::i16 &&
12644 "Unknown SINT_TO_FP to lower!");
12646 // These are really Legal; return the operand so the caller accepts it as
12648 if (SrcVT == MVT::i32 && isScalarFPTypeInSSEReg(Op.getValueType()))
12650 if (SrcVT == MVT::i64 && isScalarFPTypeInSSEReg(Op.getValueType()) &&
12651 Subtarget->is64Bit()) {
12655 unsigned Size = SrcVT.getSizeInBits()/8;
12656 MachineFunction &MF = DAG.getMachineFunction();
12657 auto PtrVT = getPointerTy(MF.getDataLayout());
12658 int SSFI = MF.getFrameInfo()->CreateStackObject(Size, Size, false);
12659 SDValue StackSlot = DAG.getFrameIndex(SSFI, PtrVT);
12660 SDValue Chain = DAG.getStore(
12661 DAG.getEntryNode(), dl, Op.getOperand(0), StackSlot,
12662 MachinePointerInfo::getFixedStack(DAG.getMachineFunction(), SSFI), false,
12664 return BuildFILD(Op, SrcVT, Chain, StackSlot, DAG);
12667 SDValue X86TargetLowering::BuildFILD(SDValue Op, EVT SrcVT, SDValue Chain,
12669 SelectionDAG &DAG) const {
12673 bool useSSE = isScalarFPTypeInSSEReg(Op.getValueType());
12675 Tys = DAG.getVTList(MVT::f64, MVT::Other, MVT::Glue);
12677 Tys = DAG.getVTList(Op.getValueType(), MVT::Other);
12679 unsigned ByteSize = SrcVT.getSizeInBits()/8;
12681 FrameIndexSDNode *FI = dyn_cast<FrameIndexSDNode>(StackSlot);
12682 MachineMemOperand *MMO;
12684 int SSFI = FI->getIndex();
12685 MMO = DAG.getMachineFunction().getMachineMemOperand(
12686 MachinePointerInfo::getFixedStack(DAG.getMachineFunction(), SSFI),
12687 MachineMemOperand::MOLoad, ByteSize, ByteSize);
12689 MMO = cast<LoadSDNode>(StackSlot)->getMemOperand();
12690 StackSlot = StackSlot.getOperand(1);
12692 SDValue Ops[] = { Chain, StackSlot, DAG.getValueType(SrcVT) };
12693 SDValue Result = DAG.getMemIntrinsicNode(useSSE ? X86ISD::FILD_FLAG :
12695 Tys, Ops, SrcVT, MMO);
12698 Chain = Result.getValue(1);
12699 SDValue InFlag = Result.getValue(2);
12701 // FIXME: Currently the FST is flagged to the FILD_FLAG. This
12702 // shouldn't be necessary except that RFP cannot be live across
12703 // multiple blocks. When stackifier is fixed, they can be uncoupled.
12704 MachineFunction &MF = DAG.getMachineFunction();
12705 unsigned SSFISize = Op.getValueType().getSizeInBits()/8;
12706 int SSFI = MF.getFrameInfo()->CreateStackObject(SSFISize, SSFISize, false);
12707 auto PtrVT = getPointerTy(MF.getDataLayout());
12708 SDValue StackSlot = DAG.getFrameIndex(SSFI, PtrVT);
12709 Tys = DAG.getVTList(MVT::Other);
12711 Chain, Result, StackSlot, DAG.getValueType(Op.getValueType()), InFlag
12713 MachineMemOperand *MMO = DAG.getMachineFunction().getMachineMemOperand(
12714 MachinePointerInfo::getFixedStack(DAG.getMachineFunction(), SSFI),
12715 MachineMemOperand::MOStore, SSFISize, SSFISize);
12717 Chain = DAG.getMemIntrinsicNode(X86ISD::FST, DL, Tys,
12718 Ops, Op.getValueType(), MMO);
12719 Result = DAG.getLoad(
12720 Op.getValueType(), DL, Chain, StackSlot,
12721 MachinePointerInfo::getFixedStack(DAG.getMachineFunction(), SSFI),
12722 false, false, false, 0);
12728 // LowerUINT_TO_FP_i64 - 64-bit unsigned integer to double expansion.
12729 SDValue X86TargetLowering::LowerUINT_TO_FP_i64(SDValue Op,
12730 SelectionDAG &DAG) const {
12731 // This algorithm is not obvious. Here it is what we're trying to output:
12734 punpckldq (c0), %xmm0 // c0: (uint4){ 0x43300000U, 0x45300000U, 0U, 0U }
12735 subpd (c1), %xmm0 // c1: (double2){ 0x1.0p52, 0x1.0p52 * 0x1.0p32 }
12737 haddpd %xmm0, %xmm0
12739 pshufd $0x4e, %xmm0, %xmm1
12745 LLVMContext *Context = DAG.getContext();
12747 // Build some magic constants.
12748 static const uint32_t CV0[] = { 0x43300000, 0x45300000, 0, 0 };
12749 Constant *C0 = ConstantDataVector::get(*Context, CV0);
12750 auto PtrVT = getPointerTy(DAG.getDataLayout());
12751 SDValue CPIdx0 = DAG.getConstantPool(C0, PtrVT, 16);
12753 SmallVector<Constant*,2> CV1;
12755 ConstantFP::get(*Context, APFloat(APFloat::IEEEdouble,
12756 APInt(64, 0x4330000000000000ULL))));
12758 ConstantFP::get(*Context, APFloat(APFloat::IEEEdouble,
12759 APInt(64, 0x4530000000000000ULL))));
12760 Constant *C1 = ConstantVector::get(CV1);
12761 SDValue CPIdx1 = DAG.getConstantPool(C1, PtrVT, 16);
12763 // Load the 64-bit value into an XMM register.
12764 SDValue XR1 = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, MVT::v2i64,
12767 DAG.getLoad(MVT::v4i32, dl, DAG.getEntryNode(), CPIdx0,
12768 MachinePointerInfo::getConstantPool(DAG.getMachineFunction()),
12769 false, false, false, 16);
12771 getUnpackl(DAG, dl, MVT::v4i32, DAG.getBitcast(MVT::v4i32, XR1), CLod0);
12774 DAG.getLoad(MVT::v2f64, dl, CLod0.getValue(1), CPIdx1,
12775 MachinePointerInfo::getConstantPool(DAG.getMachineFunction()),
12776 false, false, false, 16);
12777 SDValue XR2F = DAG.getBitcast(MVT::v2f64, Unpck1);
12778 // TODO: Are there any fast-math-flags to propagate here?
12779 SDValue Sub = DAG.getNode(ISD::FSUB, dl, MVT::v2f64, XR2F, CLod1);
12782 if (Subtarget->hasSSE3()) {
12783 // FIXME: The 'haddpd' instruction may be slower than 'movhlps + addsd'.
12784 Result = DAG.getNode(X86ISD::FHADD, dl, MVT::v2f64, Sub, Sub);
12786 SDValue S2F = DAG.getBitcast(MVT::v4i32, Sub);
12787 SDValue Shuffle = getTargetShuffleNode(X86ISD::PSHUFD, dl, MVT::v4i32,
12789 Result = DAG.getNode(ISD::FADD, dl, MVT::v2f64,
12790 DAG.getBitcast(MVT::v2f64, Shuffle), Sub);
12793 return DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::f64, Result,
12794 DAG.getIntPtrConstant(0, dl));
12797 // LowerUINT_TO_FP_i32 - 32-bit unsigned integer to float expansion.
12798 SDValue X86TargetLowering::LowerUINT_TO_FP_i32(SDValue Op,
12799 SelectionDAG &DAG) const {
12801 // FP constant to bias correct the final result.
12802 SDValue Bias = DAG.getConstantFP(BitsToDouble(0x4330000000000000ULL), dl,
12805 // Load the 32-bit value into an XMM register.
12806 SDValue Load = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, MVT::v4i32,
12809 // Zero out the upper parts of the register.
12810 Load = getShuffleVectorZeroOrUndef(Load, 0, true, Subtarget, DAG);
12812 Load = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::f64,
12813 DAG.getBitcast(MVT::v2f64, Load),
12814 DAG.getIntPtrConstant(0, dl));
12816 // Or the load with the bias.
12817 SDValue Or = DAG.getNode(
12818 ISD::OR, dl, MVT::v2i64,
12819 DAG.getBitcast(MVT::v2i64,
12820 DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, MVT::v2f64, Load)),
12821 DAG.getBitcast(MVT::v2i64,
12822 DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, MVT::v2f64, Bias)));
12824 DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::f64,
12825 DAG.getBitcast(MVT::v2f64, Or), DAG.getIntPtrConstant(0, dl));
12827 // Subtract the bias.
12828 // TODO: Are there any fast-math-flags to propagate here?
12829 SDValue Sub = DAG.getNode(ISD::FSUB, dl, MVT::f64, Or, Bias);
12831 // Handle final rounding.
12832 MVT DestVT = Op.getSimpleValueType();
12834 if (DestVT.bitsLT(MVT::f64))
12835 return DAG.getNode(ISD::FP_ROUND, dl, DestVT, Sub,
12836 DAG.getIntPtrConstant(0, dl));
12837 if (DestVT.bitsGT(MVT::f64))
12838 return DAG.getNode(ISD::FP_EXTEND, dl, DestVT, Sub);
12840 // Handle final rounding.
12844 static SDValue lowerUINT_TO_FP_vXi32(SDValue Op, SelectionDAG &DAG,
12845 const X86Subtarget &Subtarget) {
12846 // The algorithm is the following:
12847 // #ifdef __SSE4_1__
12848 // uint4 lo = _mm_blend_epi16( v, (uint4) 0x4b000000, 0xaa);
12849 // uint4 hi = _mm_blend_epi16( _mm_srli_epi32(v,16),
12850 // (uint4) 0x53000000, 0xaa);
12852 // uint4 lo = (v & (uint4) 0xffff) | (uint4) 0x4b000000;
12853 // uint4 hi = (v >> 16) | (uint4) 0x53000000;
12855 // float4 fhi = (float4) hi - (0x1.0p39f + 0x1.0p23f);
12856 // return (float4) lo + fhi;
12858 // We shouldn't use it when unsafe-fp-math is enabled though: we might later
12859 // reassociate the two FADDs, and if we do that, the algorithm fails
12860 // spectacularly (PR24512).
12861 // FIXME: If we ever have some kind of Machine FMF, this should be marked
12862 // as non-fast and always be enabled. Why isn't SDAG FMF enough? Because
12863 // there's also the MachineCombiner reassociations happening on Machine IR.
12864 if (DAG.getTarget().Options.UnsafeFPMath)
12868 SDValue V = Op->getOperand(0);
12869 MVT VecIntVT = V.getSimpleValueType();
12870 bool Is128 = VecIntVT == MVT::v4i32;
12871 MVT VecFloatVT = Is128 ? MVT::v4f32 : MVT::v8f32;
12872 // If we convert to something else than the supported type, e.g., to v4f64,
12874 if (VecFloatVT != Op->getSimpleValueType(0))
12877 unsigned NumElts = VecIntVT.getVectorNumElements();
12878 assert((VecIntVT == MVT::v4i32 || VecIntVT == MVT::v8i32) &&
12879 "Unsupported custom type");
12880 assert(NumElts <= 8 && "The size of the constant array must be fixed");
12882 // In the #idef/#else code, we have in common:
12883 // - The vector of constants:
12889 // Create the splat vector for 0x4b000000.
12890 SDValue CstLow = DAG.getConstant(0x4b000000, DL, MVT::i32);
12891 SDValue CstLowArray[] = {CstLow, CstLow, CstLow, CstLow,
12892 CstLow, CstLow, CstLow, CstLow};
12893 SDValue VecCstLow = DAG.getNode(ISD::BUILD_VECTOR, DL, VecIntVT,
12894 makeArrayRef(&CstLowArray[0], NumElts));
12895 // Create the splat vector for 0x53000000.
12896 SDValue CstHigh = DAG.getConstant(0x53000000, DL, MVT::i32);
12897 SDValue CstHighArray[] = {CstHigh, CstHigh, CstHigh, CstHigh,
12898 CstHigh, CstHigh, CstHigh, CstHigh};
12899 SDValue VecCstHigh = DAG.getNode(ISD::BUILD_VECTOR, DL, VecIntVT,
12900 makeArrayRef(&CstHighArray[0], NumElts));
12902 // Create the right shift.
12903 SDValue CstShift = DAG.getConstant(16, DL, MVT::i32);
12904 SDValue CstShiftArray[] = {CstShift, CstShift, CstShift, CstShift,
12905 CstShift, CstShift, CstShift, CstShift};
12906 SDValue VecCstShift = DAG.getNode(ISD::BUILD_VECTOR, DL, VecIntVT,
12907 makeArrayRef(&CstShiftArray[0], NumElts));
12908 SDValue HighShift = DAG.getNode(ISD::SRL, DL, VecIntVT, V, VecCstShift);
12911 if (Subtarget.hasSSE41()) {
12912 MVT VecI16VT = Is128 ? MVT::v8i16 : MVT::v16i16;
12913 // uint4 lo = _mm_blend_epi16( v, (uint4) 0x4b000000, 0xaa);
12914 SDValue VecCstLowBitcast = DAG.getBitcast(VecI16VT, VecCstLow);
12915 SDValue VecBitcast = DAG.getBitcast(VecI16VT, V);
12916 // Low will be bitcasted right away, so do not bother bitcasting back to its
12918 Low = DAG.getNode(X86ISD::BLENDI, DL, VecI16VT, VecBitcast,
12919 VecCstLowBitcast, DAG.getConstant(0xaa, DL, MVT::i32));
12920 // uint4 hi = _mm_blend_epi16( _mm_srli_epi32(v,16),
12921 // (uint4) 0x53000000, 0xaa);
12922 SDValue VecCstHighBitcast = DAG.getBitcast(VecI16VT, VecCstHigh);
12923 SDValue VecShiftBitcast = DAG.getBitcast(VecI16VT, HighShift);
12924 // High will be bitcasted right away, so do not bother bitcasting back to
12925 // its original type.
12926 High = DAG.getNode(X86ISD::BLENDI, DL, VecI16VT, VecShiftBitcast,
12927 VecCstHighBitcast, DAG.getConstant(0xaa, DL, MVT::i32));
12929 SDValue CstMask = DAG.getConstant(0xffff, DL, MVT::i32);
12930 SDValue VecCstMask = DAG.getNode(ISD::BUILD_VECTOR, DL, VecIntVT, CstMask,
12931 CstMask, CstMask, CstMask);
12932 // uint4 lo = (v & (uint4) 0xffff) | (uint4) 0x4b000000;
12933 SDValue LowAnd = DAG.getNode(ISD::AND, DL, VecIntVT, V, VecCstMask);
12934 Low = DAG.getNode(ISD::OR, DL, VecIntVT, LowAnd, VecCstLow);
12936 // uint4 hi = (v >> 16) | (uint4) 0x53000000;
12937 High = DAG.getNode(ISD::OR, DL, VecIntVT, HighShift, VecCstHigh);
12940 // Create the vector constant for -(0x1.0p39f + 0x1.0p23f).
12941 SDValue CstFAdd = DAG.getConstantFP(
12942 APFloat(APFloat::IEEEsingle, APInt(32, 0xD3000080)), DL, MVT::f32);
12943 SDValue CstFAddArray[] = {CstFAdd, CstFAdd, CstFAdd, CstFAdd,
12944 CstFAdd, CstFAdd, CstFAdd, CstFAdd};
12945 SDValue VecCstFAdd = DAG.getNode(ISD::BUILD_VECTOR, DL, VecFloatVT,
12946 makeArrayRef(&CstFAddArray[0], NumElts));
12948 // float4 fhi = (float4) hi - (0x1.0p39f + 0x1.0p23f);
12949 SDValue HighBitcast = DAG.getBitcast(VecFloatVT, High);
12950 // TODO: Are there any fast-math-flags to propagate here?
12952 DAG.getNode(ISD::FADD, DL, VecFloatVT, HighBitcast, VecCstFAdd);
12953 // return (float4) lo + fhi;
12954 SDValue LowBitcast = DAG.getBitcast(VecFloatVT, Low);
12955 return DAG.getNode(ISD::FADD, DL, VecFloatVT, LowBitcast, FHigh);
12958 SDValue X86TargetLowering::lowerUINT_TO_FP_vec(SDValue Op,
12959 SelectionDAG &DAG) const {
12960 SDValue N0 = Op.getOperand(0);
12961 MVT SVT = N0.getSimpleValueType();
12964 switch (SVT.SimpleTy) {
12966 llvm_unreachable("Custom UINT_TO_FP is not supported!");
12971 MVT NVT = MVT::getVectorVT(MVT::i32, SVT.getVectorNumElements());
12972 return DAG.getNode(ISD::SINT_TO_FP, dl, Op.getValueType(),
12973 DAG.getNode(ISD::ZERO_EXTEND, dl, NVT, N0));
12977 return lowerUINT_TO_FP_vXi32(Op, DAG, *Subtarget);
12980 assert(Subtarget->hasAVX512());
12981 return DAG.getNode(ISD::UINT_TO_FP, dl, Op.getValueType(),
12982 DAG.getNode(ISD::ZERO_EXTEND, dl, MVT::v16i32, N0));
12986 SDValue X86TargetLowering::LowerUINT_TO_FP(SDValue Op,
12987 SelectionDAG &DAG) const {
12988 SDValue N0 = Op.getOperand(0);
12990 auto PtrVT = getPointerTy(DAG.getDataLayout());
12992 if (Op.getSimpleValueType().isVector())
12993 return lowerUINT_TO_FP_vec(Op, DAG);
12995 // Since UINT_TO_FP is legal (it's marked custom), dag combiner won't
12996 // optimize it to a SINT_TO_FP when the sign bit is known zero. Perform
12997 // the optimization here.
12998 if (DAG.SignBitIsZero(N0))
12999 return DAG.getNode(ISD::SINT_TO_FP, dl, Op.getValueType(), N0);
13001 MVT SrcVT = N0.getSimpleValueType();
13002 MVT DstVT = Op.getSimpleValueType();
13004 if (Subtarget->hasAVX512() && isScalarFPTypeInSSEReg(DstVT) &&
13005 (SrcVT == MVT::i32 || (SrcVT == MVT::i64 && Subtarget->is64Bit()))) {
13006 // Conversions from unsigned i32 to f32/f64 are legal,
13007 // using VCVTUSI2SS/SD. Same for i64 in 64-bit mode.
13011 if (SrcVT == MVT::i64 && DstVT == MVT::f64 && X86ScalarSSEf64)
13012 return LowerUINT_TO_FP_i64(Op, DAG);
13013 if (SrcVT == MVT::i32 && X86ScalarSSEf64)
13014 return LowerUINT_TO_FP_i32(Op, DAG);
13015 if (Subtarget->is64Bit() && SrcVT == MVT::i64 && DstVT == MVT::f32)
13018 // Make a 64-bit buffer, and use it to build an FILD.
13019 SDValue StackSlot = DAG.CreateStackTemporary(MVT::i64);
13020 if (SrcVT == MVT::i32) {
13021 SDValue WordOff = DAG.getConstant(4, dl, PtrVT);
13022 SDValue OffsetSlot = DAG.getNode(ISD::ADD, dl, PtrVT, StackSlot, WordOff);
13023 SDValue Store1 = DAG.getStore(DAG.getEntryNode(), dl, Op.getOperand(0),
13024 StackSlot, MachinePointerInfo(),
13026 SDValue Store2 = DAG.getStore(Store1, dl, DAG.getConstant(0, dl, MVT::i32),
13027 OffsetSlot, MachinePointerInfo(),
13029 SDValue Fild = BuildFILD(Op, MVT::i64, Store2, StackSlot, DAG);
13033 assert(SrcVT == MVT::i64 && "Unexpected type in UINT_TO_FP");
13034 SDValue Store = DAG.getStore(DAG.getEntryNode(), dl, Op.getOperand(0),
13035 StackSlot, MachinePointerInfo(),
13037 // For i64 source, we need to add the appropriate power of 2 if the input
13038 // was negative. This is the same as the optimization in
13039 // DAGTypeLegalizer::ExpandIntOp_UNIT_TO_FP, and for it to be safe here,
13040 // we must be careful to do the computation in x87 extended precision, not
13041 // in SSE. (The generic code can't know it's OK to do this, or how to.)
13042 int SSFI = cast<FrameIndexSDNode>(StackSlot)->getIndex();
13043 MachineMemOperand *MMO = DAG.getMachineFunction().getMachineMemOperand(
13044 MachinePointerInfo::getFixedStack(DAG.getMachineFunction(), SSFI),
13045 MachineMemOperand::MOLoad, 8, 8);
13047 SDVTList Tys = DAG.getVTList(MVT::f80, MVT::Other);
13048 SDValue Ops[] = { Store, StackSlot, DAG.getValueType(MVT::i64) };
13049 SDValue Fild = DAG.getMemIntrinsicNode(X86ISD::FILD, dl, Tys, Ops,
13052 APInt FF(32, 0x5F800000ULL);
13054 // Check whether the sign bit is set.
13055 SDValue SignSet = DAG.getSetCC(
13056 dl, getSetCCResultType(DAG.getDataLayout(), *DAG.getContext(), MVT::i64),
13057 Op.getOperand(0), DAG.getConstant(0, dl, MVT::i64), ISD::SETLT);
13059 // Build a 64 bit pair (0, FF) in the constant pool, with FF in the lo bits.
13060 SDValue FudgePtr = DAG.getConstantPool(
13061 ConstantInt::get(*DAG.getContext(), FF.zext(64)), PtrVT);
13063 // Get a pointer to FF if the sign bit was set, or to 0 otherwise.
13064 SDValue Zero = DAG.getIntPtrConstant(0, dl);
13065 SDValue Four = DAG.getIntPtrConstant(4, dl);
13066 SDValue Offset = DAG.getNode(ISD::SELECT, dl, Zero.getValueType(), SignSet,
13068 FudgePtr = DAG.getNode(ISD::ADD, dl, PtrVT, FudgePtr, Offset);
13070 // Load the value out, extending it from f32 to f80.
13071 // FIXME: Avoid the extend by constructing the right constant pool?
13072 SDValue Fudge = DAG.getExtLoad(
13073 ISD::EXTLOAD, dl, MVT::f80, DAG.getEntryNode(), FudgePtr,
13074 MachinePointerInfo::getConstantPool(DAG.getMachineFunction()), MVT::f32,
13075 false, false, false, 4);
13076 // Extend everything to 80 bits to force it to be done on x87.
13077 // TODO: Are there any fast-math-flags to propagate here?
13078 SDValue Add = DAG.getNode(ISD::FADD, dl, MVT::f80, Fild, Fudge);
13079 return DAG.getNode(ISD::FP_ROUND, dl, DstVT, Add,
13080 DAG.getIntPtrConstant(0, dl));
13083 // If the given FP_TO_SINT (IsSigned) or FP_TO_UINT (!IsSigned) operation
13084 // is legal, or has an fp128 or f16 source (which needs to be promoted to f32),
13085 // just return an <SDValue(), SDValue()> pair.
13086 // Otherwise it is assumed to be a conversion from one of f32, f64 or f80
13087 // to i16, i32 or i64, and we lower it to a legal sequence.
13088 // If lowered to the final integer result we return a <result, SDValue()> pair.
13089 // Otherwise we lower it to a sequence ending with a FIST, return a
13090 // <FIST, StackSlot> pair, and the caller is responsible for loading
13091 // the final integer result from StackSlot.
13092 std::pair<SDValue,SDValue>
13093 X86TargetLowering::FP_TO_INTHelper(SDValue Op, SelectionDAG &DAG,
13094 bool IsSigned, bool IsReplace) const {
13097 EVT DstTy = Op.getValueType();
13098 EVT TheVT = Op.getOperand(0).getValueType();
13099 auto PtrVT = getPointerTy(DAG.getDataLayout());
13101 if (TheVT != MVT::f32 && TheVT != MVT::f64 && TheVT != MVT::f80) {
13102 // f16 must be promoted before using the lowering in this routine.
13103 // fp128 does not use this lowering.
13104 return std::make_pair(SDValue(), SDValue());
13107 // If using FIST to compute an unsigned i64, we'll need some fixup
13108 // to handle values above the maximum signed i64. A FIST is always
13109 // used for the 32-bit subtarget, but also for f80 on a 64-bit target.
13110 bool UnsignedFixup = !IsSigned &&
13111 DstTy == MVT::i64 &&
13112 (!Subtarget->is64Bit() ||
13113 !isScalarFPTypeInSSEReg(TheVT));
13115 if (!IsSigned && DstTy != MVT::i64 && !Subtarget->hasAVX512()) {
13116 // Replace the fp-to-uint32 operation with an fp-to-sint64 FIST.
13117 // The low 32 bits of the fist result will have the correct uint32 result.
13118 assert(DstTy == MVT::i32 && "Unexpected FP_TO_UINT");
13122 assert(DstTy.getSimpleVT() <= MVT::i64 &&
13123 DstTy.getSimpleVT() >= MVT::i16 &&
13124 "Unknown FP_TO_INT to lower!");
13126 // These are really Legal.
13127 if (DstTy == MVT::i32 &&
13128 isScalarFPTypeInSSEReg(Op.getOperand(0).getValueType()))
13129 return std::make_pair(SDValue(), SDValue());
13130 if (Subtarget->is64Bit() &&
13131 DstTy == MVT::i64 &&
13132 isScalarFPTypeInSSEReg(Op.getOperand(0).getValueType()))
13133 return std::make_pair(SDValue(), SDValue());
13135 // We lower FP->int64 into FISTP64 followed by a load from a temporary
13137 MachineFunction &MF = DAG.getMachineFunction();
13138 unsigned MemSize = DstTy.getSizeInBits()/8;
13139 int SSFI = MF.getFrameInfo()->CreateStackObject(MemSize, MemSize, false);
13140 SDValue StackSlot = DAG.getFrameIndex(SSFI, PtrVT);
13143 switch (DstTy.getSimpleVT().SimpleTy) {
13144 default: llvm_unreachable("Invalid FP_TO_SINT to lower!");
13145 case MVT::i16: Opc = X86ISD::FP_TO_INT16_IN_MEM; break;
13146 case MVT::i32: Opc = X86ISD::FP_TO_INT32_IN_MEM; break;
13147 case MVT::i64: Opc = X86ISD::FP_TO_INT64_IN_MEM; break;
13150 SDValue Chain = DAG.getEntryNode();
13151 SDValue Value = Op.getOperand(0);
13152 SDValue Adjust; // 0x0 or 0x80000000, for result sign bit adjustment.
13154 if (UnsignedFixup) {
13156 // Conversion to unsigned i64 is implemented with a select,
13157 // depending on whether the source value fits in the range
13158 // of a signed i64. Let Thresh be the FP equivalent of
13159 // 0x8000000000000000ULL.
13161 // Adjust i32 = (Value < Thresh) ? 0 : 0x80000000;
13162 // FistSrc = (Value < Thresh) ? Value : (Value - Thresh);
13163 // Fist-to-mem64 FistSrc
13164 // Add 0 or 0x800...0ULL to the 64-bit result, which is equivalent
13165 // to XOR'ing the high 32 bits with Adjust.
13167 // Being a power of 2, Thresh is exactly representable in all FP formats.
13168 // For X87 we'd like to use the smallest FP type for this constant, but
13169 // for DAG type consistency we have to match the FP operand type.
13171 APFloat Thresh(APFloat::IEEEsingle, APInt(32, 0x5f000000));
13172 LLVM_ATTRIBUTE_UNUSED APFloat::opStatus Status = APFloat::opOK;
13173 bool LosesInfo = false;
13174 if (TheVT == MVT::f64)
13175 // The rounding mode is irrelevant as the conversion should be exact.
13176 Status = Thresh.convert(APFloat::IEEEdouble, APFloat::rmNearestTiesToEven,
13178 else if (TheVT == MVT::f80)
13179 Status = Thresh.convert(APFloat::x87DoubleExtended,
13180 APFloat::rmNearestTiesToEven, &LosesInfo);
13182 assert(Status == APFloat::opOK && !LosesInfo &&
13183 "FP conversion should have been exact");
13185 SDValue ThreshVal = DAG.getConstantFP(Thresh, DL, TheVT);
13187 SDValue Cmp = DAG.getSetCC(DL,
13188 getSetCCResultType(DAG.getDataLayout(),
13189 *DAG.getContext(), TheVT),
13190 Value, ThreshVal, ISD::SETLT);
13191 Adjust = DAG.getSelect(DL, MVT::i32, Cmp,
13192 DAG.getConstant(0, DL, MVT::i32),
13193 DAG.getConstant(0x80000000, DL, MVT::i32));
13194 SDValue Sub = DAG.getNode(ISD::FSUB, DL, TheVT, Value, ThreshVal);
13195 Cmp = DAG.getSetCC(DL, getSetCCResultType(DAG.getDataLayout(),
13196 *DAG.getContext(), TheVT),
13197 Value, ThreshVal, ISD::SETLT);
13198 Value = DAG.getSelect(DL, TheVT, Cmp, Value, Sub);
13201 // FIXME This causes a redundant load/store if the SSE-class value is already
13202 // in memory, such as if it is on the callstack.
13203 if (isScalarFPTypeInSSEReg(TheVT)) {
13204 assert(DstTy == MVT::i64 && "Invalid FP_TO_SINT to lower!");
13205 Chain = DAG.getStore(Chain, DL, Value, StackSlot,
13206 MachinePointerInfo::getFixedStack(MF, SSFI), false,
13208 SDVTList Tys = DAG.getVTList(Op.getOperand(0).getValueType(), MVT::Other);
13210 Chain, StackSlot, DAG.getValueType(TheVT)
13213 MachineMemOperand *MMO =
13214 MF.getMachineMemOperand(MachinePointerInfo::getFixedStack(MF, SSFI),
13215 MachineMemOperand::MOLoad, MemSize, MemSize);
13216 Value = DAG.getMemIntrinsicNode(X86ISD::FLD, DL, Tys, Ops, DstTy, MMO);
13217 Chain = Value.getValue(1);
13218 SSFI = MF.getFrameInfo()->CreateStackObject(MemSize, MemSize, false);
13219 StackSlot = DAG.getFrameIndex(SSFI, PtrVT);
13222 MachineMemOperand *MMO =
13223 MF.getMachineMemOperand(MachinePointerInfo::getFixedStack(MF, SSFI),
13224 MachineMemOperand::MOStore, MemSize, MemSize);
13226 if (UnsignedFixup) {
13228 // Insert the FIST, load its result as two i32's,
13229 // and XOR the high i32 with Adjust.
13231 SDValue FistOps[] = { Chain, Value, StackSlot };
13232 SDValue FIST = DAG.getMemIntrinsicNode(Opc, DL, DAG.getVTList(MVT::Other),
13233 FistOps, DstTy, MMO);
13235 SDValue Low32 = DAG.getLoad(MVT::i32, DL, FIST, StackSlot,
13236 MachinePointerInfo(),
13237 false, false, false, 0);
13238 SDValue HighAddr = DAG.getNode(ISD::ADD, DL, PtrVT, StackSlot,
13239 DAG.getConstant(4, DL, PtrVT));
13241 SDValue High32 = DAG.getLoad(MVT::i32, DL, FIST, HighAddr,
13242 MachinePointerInfo(),
13243 false, false, false, 0);
13244 High32 = DAG.getNode(ISD::XOR, DL, MVT::i32, High32, Adjust);
13246 if (Subtarget->is64Bit()) {
13247 // Join High32 and Low32 into a 64-bit result.
13248 // (High32 << 32) | Low32
13249 Low32 = DAG.getNode(ISD::ZERO_EXTEND, DL, MVT::i64, Low32);
13250 High32 = DAG.getNode(ISD::ANY_EXTEND, DL, MVT::i64, High32);
13251 High32 = DAG.getNode(ISD::SHL, DL, MVT::i64, High32,
13252 DAG.getConstant(32, DL, MVT::i8));
13253 SDValue Result = DAG.getNode(ISD::OR, DL, MVT::i64, High32, Low32);
13254 return std::make_pair(Result, SDValue());
13257 SDValue ResultOps[] = { Low32, High32 };
13259 SDValue pair = IsReplace
13260 ? DAG.getNode(ISD::BUILD_PAIR, DL, MVT::i64, ResultOps)
13261 : DAG.getMergeValues(ResultOps, DL);
13262 return std::make_pair(pair, SDValue());
13264 // Build the FP_TO_INT*_IN_MEM
13265 SDValue Ops[] = { Chain, Value, StackSlot };
13266 SDValue FIST = DAG.getMemIntrinsicNode(Opc, DL, DAG.getVTList(MVT::Other),
13268 return std::make_pair(FIST, StackSlot);
13272 static SDValue LowerAVXExtend(SDValue Op, SelectionDAG &DAG,
13273 const X86Subtarget *Subtarget) {
13274 MVT VT = Op->getSimpleValueType(0);
13275 SDValue In = Op->getOperand(0);
13276 MVT InVT = In.getSimpleValueType();
13279 if (VT.is512BitVector() || InVT.getVectorElementType() == MVT::i1)
13280 return DAG.getNode(ISD::ZERO_EXTEND, dl, VT, In);
13282 // Optimize vectors in AVX mode:
13285 // Use vpunpcklwd for 4 lower elements v8i16 -> v4i32.
13286 // Use vpunpckhwd for 4 upper elements v8i16 -> v4i32.
13287 // Concat upper and lower parts.
13290 // Use vpunpckldq for 4 lower elements v4i32 -> v2i64.
13291 // Use vpunpckhdq for 4 upper elements v4i32 -> v2i64.
13292 // Concat upper and lower parts.
13295 if (((VT != MVT::v16i16) || (InVT != MVT::v16i8)) &&
13296 ((VT != MVT::v8i32) || (InVT != MVT::v8i16)) &&
13297 ((VT != MVT::v4i64) || (InVT != MVT::v4i32)))
13300 if (Subtarget->hasInt256())
13301 return DAG.getNode(X86ISD::VZEXT, dl, VT, In);
13303 SDValue ZeroVec = getZeroVector(InVT, Subtarget, DAG, dl);
13304 SDValue Undef = DAG.getUNDEF(InVT);
13305 bool NeedZero = Op.getOpcode() == ISD::ZERO_EXTEND;
13306 SDValue OpLo = getUnpackl(DAG, dl, InVT, In, NeedZero ? ZeroVec : Undef);
13307 SDValue OpHi = getUnpackh(DAG, dl, InVT, In, NeedZero ? ZeroVec : Undef);
13309 MVT HVT = MVT::getVectorVT(VT.getVectorElementType(),
13310 VT.getVectorNumElements()/2);
13312 OpLo = DAG.getBitcast(HVT, OpLo);
13313 OpHi = DAG.getBitcast(HVT, OpHi);
13315 return DAG.getNode(ISD::CONCAT_VECTORS, dl, VT, OpLo, OpHi);
13318 static SDValue LowerZERO_EXTEND_AVX512(SDValue Op,
13319 const X86Subtarget *Subtarget, SelectionDAG &DAG) {
13320 MVT VT = Op->getSimpleValueType(0);
13321 SDValue In = Op->getOperand(0);
13322 MVT InVT = In.getSimpleValueType();
13324 unsigned int NumElts = VT.getVectorNumElements();
13325 if (NumElts != 8 && NumElts != 16 && !Subtarget->hasBWI())
13328 if (VT.is512BitVector() && InVT.getVectorElementType() != MVT::i1)
13329 return DAG.getNode(X86ISD::VZEXT, DL, VT, In);
13331 assert(InVT.getVectorElementType() == MVT::i1);
13332 MVT ExtVT = NumElts == 8 ? MVT::v8i64 : MVT::v16i32;
13334 DAG.getConstant(APInt(ExtVT.getScalarSizeInBits(), 1), DL, ExtVT);
13336 DAG.getConstant(APInt::getNullValue(ExtVT.getScalarSizeInBits()), DL, ExtVT);
13338 SDValue V = DAG.getNode(ISD::VSELECT, DL, ExtVT, In, One, Zero);
13339 if (VT.is512BitVector())
13341 return DAG.getNode(X86ISD::VTRUNC, DL, VT, V);
13344 static SDValue LowerANY_EXTEND(SDValue Op, const X86Subtarget *Subtarget,
13345 SelectionDAG &DAG) {
13346 if (Subtarget->hasFp256())
13347 if (SDValue Res = LowerAVXExtend(Op, DAG, Subtarget))
13353 static SDValue LowerZERO_EXTEND(SDValue Op, const X86Subtarget *Subtarget,
13354 SelectionDAG &DAG) {
13356 MVT VT = Op.getSimpleValueType();
13357 SDValue In = Op.getOperand(0);
13358 MVT SVT = In.getSimpleValueType();
13360 if (VT.is512BitVector() || SVT.getVectorElementType() == MVT::i1)
13361 return LowerZERO_EXTEND_AVX512(Op, Subtarget, DAG);
13363 if (Subtarget->hasFp256())
13364 if (SDValue Res = LowerAVXExtend(Op, DAG, Subtarget))
13367 assert(!VT.is256BitVector() || !SVT.is128BitVector() ||
13368 VT.getVectorNumElements() != SVT.getVectorNumElements());
13372 static SDValue LowerTruncateVecI1(SDValue Op, SelectionDAG &DAG,
13373 const X86Subtarget *Subtarget) {
13376 MVT VT = Op.getSimpleValueType();
13377 SDValue In = Op.getOperand(0);
13378 MVT InVT = In.getSimpleValueType();
13380 assert(VT.getVectorElementType() == MVT::i1 && "Unexected vector type.");
13382 // Shift LSB to MSB and use VPMOVB2M - SKX.
13383 unsigned ShiftInx = InVT.getScalarSizeInBits() - 1;
13384 if ((InVT.is512BitVector() && InVT.getScalarSizeInBits() <= 16 &&
13385 Subtarget->hasBWI()) || // legal, will go to VPMOVB2M, VPMOVW2M
13386 ((InVT.is256BitVector() || InVT.is128BitVector()) &&
13387 InVT.getScalarSizeInBits() <= 16 && Subtarget->hasBWI() &&
13388 Subtarget->hasVLX())) { // legal, will go to VPMOVB2M, VPMOVW2M
13389 // Shift packed bytes not supported natively, bitcast to dword
13390 MVT ExtVT = MVT::getVectorVT(MVT::i16, InVT.getSizeInBits()/16);
13391 SDValue ShiftNode = DAG.getNode(ISD::SHL, DL, ExtVT,
13392 DAG.getBitcast(ExtVT, In),
13393 DAG.getConstant(ShiftInx, DL, ExtVT));
13394 ShiftNode = DAG.getBitcast(InVT, ShiftNode);
13395 return DAG.getNode(X86ISD::CVT2MASK, DL, VT, ShiftNode);
13397 if ((InVT.is512BitVector() && InVT.getScalarSizeInBits() >= 32 &&
13398 Subtarget->hasDQI()) || // legal, will go to VPMOVD2M, VPMOVQ2M
13399 ((InVT.is256BitVector() || InVT.is128BitVector()) &&
13400 InVT.getScalarSizeInBits() >= 32 && Subtarget->hasDQI() &&
13401 Subtarget->hasVLX())) { // legal, will go to VPMOVD2M, VPMOVQ2M
13403 SDValue ShiftNode = DAG.getNode(ISD::SHL, DL, InVT, In,
13404 DAG.getConstant(ShiftInx, DL, InVT));
13405 return DAG.getNode(X86ISD::CVT2MASK, DL, VT, ShiftNode);
13408 // Shift LSB to MSB, extend if necessary and use TESTM.
13409 unsigned NumElts = InVT.getVectorNumElements();
13410 if (InVT.getSizeInBits() < 512 &&
13411 (InVT.getScalarType() == MVT::i8 || InVT.getScalarType() == MVT::i16 ||
13412 !Subtarget->hasVLX())) {
13413 assert((NumElts == 8 || NumElts == 16) && "Unexected vector type.");
13415 // TESTD/Q should be used (if BW supported we use CVT2MASK above),
13416 // so vector should be extended to packed dword/qword.
13417 MVT ExtVT = MVT::getVectorVT(MVT::getIntegerVT(512/NumElts), NumElts);
13418 In = DAG.getNode(ISD::SIGN_EXTEND, DL, ExtVT, In);
13420 ShiftInx = InVT.getScalarSizeInBits() - 1;
13423 SDValue ShiftNode = DAG.getNode(ISD::SHL, DL, InVT, In,
13424 DAG.getConstant(ShiftInx, DL, InVT));
13425 return DAG.getNode(X86ISD::TESTM, DL, VT, ShiftNode, ShiftNode);
13428 SDValue X86TargetLowering::LowerTRUNCATE(SDValue Op, SelectionDAG &DAG) const {
13430 MVT VT = Op.getSimpleValueType();
13431 SDValue In = Op.getOperand(0);
13432 MVT InVT = In.getSimpleValueType();
13434 if (VT == MVT::i1) {
13435 assert((InVT.isInteger() && (InVT.getSizeInBits() <= 64)) &&
13436 "Invalid scalar TRUNCATE operation");
13437 if (InVT.getSizeInBits() >= 32)
13439 In = DAG.getNode(ISD::ANY_EXTEND, DL, MVT::i32, In);
13440 return DAG.getNode(ISD::TRUNCATE, DL, VT, In);
13442 assert(VT.getVectorNumElements() == InVT.getVectorNumElements() &&
13443 "Invalid TRUNCATE operation");
13445 if (VT.getVectorElementType() == MVT::i1)
13446 return LowerTruncateVecI1(Op, DAG, Subtarget);
13448 // vpmovqb/w/d, vpmovdb/w, vpmovwb
13449 if (Subtarget->hasAVX512()) {
13450 // word to byte only under BWI
13451 if (InVT == MVT::v16i16 && !Subtarget->hasBWI()) // v16i16 -> v16i8
13452 return DAG.getNode(X86ISD::VTRUNC, DL, VT,
13453 DAG.getNode(X86ISD::VSEXT, DL, MVT::v16i32, In));
13454 return DAG.getNode(X86ISD::VTRUNC, DL, VT, In);
13456 if ((VT == MVT::v4i32) && (InVT == MVT::v4i64)) {
13457 // On AVX2, v4i64 -> v4i32 becomes VPERMD.
13458 if (Subtarget->hasInt256()) {
13459 static const int ShufMask[] = {0, 2, 4, 6, -1, -1, -1, -1};
13460 In = DAG.getBitcast(MVT::v8i32, In);
13461 In = DAG.getVectorShuffle(MVT::v8i32, DL, In, DAG.getUNDEF(MVT::v8i32),
13463 return DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, VT, In,
13464 DAG.getIntPtrConstant(0, DL));
13467 SDValue OpLo = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, MVT::v2i64, In,
13468 DAG.getIntPtrConstant(0, DL));
13469 SDValue OpHi = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, MVT::v2i64, In,
13470 DAG.getIntPtrConstant(2, DL));
13471 OpLo = DAG.getBitcast(MVT::v4i32, OpLo);
13472 OpHi = DAG.getBitcast(MVT::v4i32, OpHi);
13473 static const int ShufMask[] = {0, 2, 4, 6};
13474 return DAG.getVectorShuffle(VT, DL, OpLo, OpHi, ShufMask);
13477 if ((VT == MVT::v8i16) && (InVT == MVT::v8i32)) {
13478 // On AVX2, v8i32 -> v8i16 becomed PSHUFB.
13479 if (Subtarget->hasInt256()) {
13480 In = DAG.getBitcast(MVT::v32i8, In);
13482 SmallVector<SDValue,32> pshufbMask;
13483 for (unsigned i = 0; i < 2; ++i) {
13484 pshufbMask.push_back(DAG.getConstant(0x0, DL, MVT::i8));
13485 pshufbMask.push_back(DAG.getConstant(0x1, DL, MVT::i8));
13486 pshufbMask.push_back(DAG.getConstant(0x4, DL, MVT::i8));
13487 pshufbMask.push_back(DAG.getConstant(0x5, DL, MVT::i8));
13488 pshufbMask.push_back(DAG.getConstant(0x8, DL, MVT::i8));
13489 pshufbMask.push_back(DAG.getConstant(0x9, DL, MVT::i8));
13490 pshufbMask.push_back(DAG.getConstant(0xc, DL, MVT::i8));
13491 pshufbMask.push_back(DAG.getConstant(0xd, DL, MVT::i8));
13492 for (unsigned j = 0; j < 8; ++j)
13493 pshufbMask.push_back(DAG.getConstant(0x80, DL, MVT::i8));
13495 SDValue BV = DAG.getNode(ISD::BUILD_VECTOR, DL, MVT::v32i8, pshufbMask);
13496 In = DAG.getNode(X86ISD::PSHUFB, DL, MVT::v32i8, In, BV);
13497 In = DAG.getBitcast(MVT::v4i64, In);
13499 static const int ShufMask[] = {0, 2, -1, -1};
13500 In = DAG.getVectorShuffle(MVT::v4i64, DL, In, DAG.getUNDEF(MVT::v4i64),
13502 In = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, MVT::v2i64, In,
13503 DAG.getIntPtrConstant(0, DL));
13504 return DAG.getBitcast(VT, In);
13507 SDValue OpLo = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, MVT::v4i32, In,
13508 DAG.getIntPtrConstant(0, DL));
13510 SDValue OpHi = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, MVT::v4i32, In,
13511 DAG.getIntPtrConstant(4, DL));
13513 OpLo = DAG.getBitcast(MVT::v16i8, OpLo);
13514 OpHi = DAG.getBitcast(MVT::v16i8, OpHi);
13516 // The PSHUFB mask:
13517 static const int ShufMask1[] = {0, 1, 4, 5, 8, 9, 12, 13,
13518 -1, -1, -1, -1, -1, -1, -1, -1};
13520 SDValue Undef = DAG.getUNDEF(MVT::v16i8);
13521 OpLo = DAG.getVectorShuffle(MVT::v16i8, DL, OpLo, Undef, ShufMask1);
13522 OpHi = DAG.getVectorShuffle(MVT::v16i8, DL, OpHi, Undef, ShufMask1);
13524 OpLo = DAG.getBitcast(MVT::v4i32, OpLo);
13525 OpHi = DAG.getBitcast(MVT::v4i32, OpHi);
13527 // The MOVLHPS Mask:
13528 static const int ShufMask2[] = {0, 1, 4, 5};
13529 SDValue res = DAG.getVectorShuffle(MVT::v4i32, DL, OpLo, OpHi, ShufMask2);
13530 return DAG.getBitcast(MVT::v8i16, res);
13533 // Handle truncation of V256 to V128 using shuffles.
13534 if (!VT.is128BitVector() || !InVT.is256BitVector())
13537 assert(Subtarget->hasFp256() && "256-bit vector without AVX!");
13539 unsigned NumElems = VT.getVectorNumElements();
13540 MVT NVT = MVT::getVectorVT(VT.getVectorElementType(), NumElems * 2);
13542 SmallVector<int, 16> MaskVec(NumElems * 2, -1);
13543 // Prepare truncation shuffle mask
13544 for (unsigned i = 0; i != NumElems; ++i)
13545 MaskVec[i] = i * 2;
13546 SDValue V = DAG.getVectorShuffle(NVT, DL, DAG.getBitcast(NVT, In),
13547 DAG.getUNDEF(NVT), &MaskVec[0]);
13548 return DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, VT, V,
13549 DAG.getIntPtrConstant(0, DL));
13552 SDValue X86TargetLowering::LowerFP_TO_SINT(SDValue Op,
13553 SelectionDAG &DAG) const {
13554 assert(!Op.getSimpleValueType().isVector());
13556 std::pair<SDValue,SDValue> Vals = FP_TO_INTHelper(Op, DAG,
13557 /*IsSigned=*/ true, /*IsReplace=*/ false);
13558 SDValue FIST = Vals.first, StackSlot = Vals.second;
13559 // If FP_TO_INTHelper failed, the node is actually supposed to be Legal.
13560 if (!FIST.getNode())
13563 if (StackSlot.getNode())
13564 // Load the result.
13565 return DAG.getLoad(Op.getValueType(), SDLoc(Op),
13566 FIST, StackSlot, MachinePointerInfo(),
13567 false, false, false, 0);
13569 // The node is the result.
13573 SDValue X86TargetLowering::LowerFP_TO_UINT(SDValue Op,
13574 SelectionDAG &DAG) const {
13575 std::pair<SDValue,SDValue> Vals = FP_TO_INTHelper(Op, DAG,
13576 /*IsSigned=*/ false, /*IsReplace=*/ false);
13577 SDValue FIST = Vals.first, StackSlot = Vals.second;
13578 // If FP_TO_INTHelper failed, the node is actually supposed to be Legal.
13579 if (!FIST.getNode())
13582 if (StackSlot.getNode())
13583 // Load the result.
13584 return DAG.getLoad(Op.getValueType(), SDLoc(Op),
13585 FIST, StackSlot, MachinePointerInfo(),
13586 false, false, false, 0);
13588 // The node is the result.
13592 static SDValue LowerFP_EXTEND(SDValue Op, SelectionDAG &DAG) {
13594 MVT VT = Op.getSimpleValueType();
13595 SDValue In = Op.getOperand(0);
13596 MVT SVT = In.getSimpleValueType();
13598 assert(SVT == MVT::v2f32 && "Only customize MVT::v2f32 type legalization!");
13600 return DAG.getNode(X86ISD::VFPEXT, DL, VT,
13601 DAG.getNode(ISD::CONCAT_VECTORS, DL, MVT::v4f32,
13602 In, DAG.getUNDEF(SVT)));
13605 /// The only differences between FABS and FNEG are the mask and the logic op.
13606 /// FNEG also has a folding opportunity for FNEG(FABS(x)).
13607 static SDValue LowerFABSorFNEG(SDValue Op, SelectionDAG &DAG) {
13608 assert((Op.getOpcode() == ISD::FABS || Op.getOpcode() == ISD::FNEG) &&
13609 "Wrong opcode for lowering FABS or FNEG.");
13611 bool IsFABS = (Op.getOpcode() == ISD::FABS);
13613 // If this is a FABS and it has an FNEG user, bail out to fold the combination
13614 // into an FNABS. We'll lower the FABS after that if it is still in use.
13616 for (SDNode *User : Op->uses())
13617 if (User->getOpcode() == ISD::FNEG)
13621 MVT VT = Op.getSimpleValueType();
13623 bool IsF128 = (VT == MVT::f128);
13625 // FIXME: Use function attribute "OptimizeForSize" and/or CodeGenOpt::Level to
13626 // decide if we should generate a 16-byte constant mask when we only need 4 or
13627 // 8 bytes for the scalar case.
13633 if (VT.isVector()) {
13635 EltVT = VT.getVectorElementType();
13636 NumElts = VT.getVectorNumElements();
13637 } else if (IsF128) {
13638 // SSE instructions are used for optimized f128 logical operations.
13639 LogicVT = MVT::f128;
13643 // There are no scalar bitwise logical SSE/AVX instructions, so we
13644 // generate a 16-byte vector constant and logic op even for the scalar case.
13645 // Using a 16-byte mask allows folding the load of the mask with
13646 // the logic op, so it can save (~4 bytes) on code size.
13647 LogicVT = (VT == MVT::f64) ? MVT::v2f64 : MVT::v4f32;
13649 NumElts = (VT == MVT::f64) ? 2 : 4;
13652 unsigned EltBits = EltVT.getSizeInBits();
13653 LLVMContext *Context = DAG.getContext();
13654 // For FABS, mask is 0x7f...; for FNEG, mask is 0x80...
13656 IsFABS ? APInt::getSignedMaxValue(EltBits) : APInt::getSignBit(EltBits);
13657 Constant *C = ConstantInt::get(*Context, MaskElt);
13658 C = ConstantVector::getSplat(NumElts, C);
13659 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
13660 SDValue CPIdx = DAG.getConstantPool(C, TLI.getPointerTy(DAG.getDataLayout()));
13661 unsigned Alignment = cast<ConstantPoolSDNode>(CPIdx)->getAlignment();
13663 DAG.getLoad(LogicVT, dl, DAG.getEntryNode(), CPIdx,
13664 MachinePointerInfo::getConstantPool(DAG.getMachineFunction()),
13665 false, false, false, Alignment);
13667 SDValue Op0 = Op.getOperand(0);
13668 bool IsFNABS = !IsFABS && (Op0.getOpcode() == ISD::FABS);
13670 IsFABS ? X86ISD::FAND : IsFNABS ? X86ISD::FOR : X86ISD::FXOR;
13671 SDValue Operand = IsFNABS ? Op0.getOperand(0) : Op0;
13673 if (VT.isVector() || IsF128)
13674 return DAG.getNode(LogicOp, dl, LogicVT, Operand, Mask);
13676 // For the scalar case extend to a 128-bit vector, perform the logic op,
13677 // and extract the scalar result back out.
13678 Operand = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, LogicVT, Operand);
13679 SDValue LogicNode = DAG.getNode(LogicOp, dl, LogicVT, Operand, Mask);
13680 return DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, VT, LogicNode,
13681 DAG.getIntPtrConstant(0, dl));
13684 static SDValue LowerFCOPYSIGN(SDValue Op, SelectionDAG &DAG) {
13685 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
13686 LLVMContext *Context = DAG.getContext();
13687 SDValue Op0 = Op.getOperand(0);
13688 SDValue Op1 = Op.getOperand(1);
13690 MVT VT = Op.getSimpleValueType();
13691 MVT SrcVT = Op1.getSimpleValueType();
13692 bool IsF128 = (VT == MVT::f128);
13694 // If second operand is smaller, extend it first.
13695 if (SrcVT.bitsLT(VT)) {
13696 Op1 = DAG.getNode(ISD::FP_EXTEND, dl, VT, Op1);
13699 // And if it is bigger, shrink it first.
13700 if (SrcVT.bitsGT(VT)) {
13701 Op1 = DAG.getNode(ISD::FP_ROUND, dl, VT, Op1, DAG.getIntPtrConstant(1, dl));
13705 // At this point the operands and the result should have the same
13706 // type, and that won't be f80 since that is not custom lowered.
13707 assert((VT == MVT::f64 || VT == MVT::f32 || IsF128) &&
13708 "Unexpected type in LowerFCOPYSIGN");
13710 const fltSemantics &Sem =
13711 VT == MVT::f64 ? APFloat::IEEEdouble :
13712 (IsF128 ? APFloat::IEEEquad : APFloat::IEEEsingle);
13713 const unsigned SizeInBits = VT.getSizeInBits();
13715 SmallVector<Constant *, 4> CV(
13716 VT == MVT::f64 ? 2 : (IsF128 ? 1 : 4),
13717 ConstantFP::get(*Context, APFloat(Sem, APInt(SizeInBits, 0))));
13719 // First, clear all bits but the sign bit from the second operand (sign).
13720 CV[0] = ConstantFP::get(*Context,
13721 APFloat(Sem, APInt::getHighBitsSet(SizeInBits, 1)));
13722 Constant *C = ConstantVector::get(CV);
13723 auto PtrVT = TLI.getPointerTy(DAG.getDataLayout());
13724 SDValue CPIdx = DAG.getConstantPool(C, PtrVT, 16);
13726 // Perform all logic operations as 16-byte vectors because there are no
13727 // scalar FP logic instructions in SSE. This allows load folding of the
13728 // constants into the logic instructions.
13729 MVT LogicVT = (VT == MVT::f64) ? MVT::v2f64 : (IsF128 ? MVT::f128 : MVT::v4f32);
13731 DAG.getLoad(LogicVT, dl, DAG.getEntryNode(), CPIdx,
13732 MachinePointerInfo::getConstantPool(DAG.getMachineFunction()),
13733 false, false, false, 16);
13735 Op1 = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, LogicVT, Op1);
13736 SDValue SignBit = DAG.getNode(X86ISD::FAND, dl, LogicVT, Op1, Mask1);
13738 // Next, clear the sign bit from the first operand (magnitude).
13739 // If it's a constant, we can clear it here.
13740 if (ConstantFPSDNode *Op0CN = dyn_cast<ConstantFPSDNode>(Op0)) {
13741 APFloat APF = Op0CN->getValueAPF();
13742 // If the magnitude is a positive zero, the sign bit alone is enough.
13743 if (APF.isPosZero())
13744 return IsF128 ? SignBit :
13745 DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, SrcVT, SignBit,
13746 DAG.getIntPtrConstant(0, dl));
13748 CV[0] = ConstantFP::get(*Context, APF);
13750 CV[0] = ConstantFP::get(
13752 APFloat(Sem, APInt::getLowBitsSet(SizeInBits, SizeInBits - 1)));
13754 C = ConstantVector::get(CV);
13755 CPIdx = DAG.getConstantPool(C, PtrVT, 16);
13757 DAG.getLoad(LogicVT, dl, DAG.getEntryNode(), CPIdx,
13758 MachinePointerInfo::getConstantPool(DAG.getMachineFunction()),
13759 false, false, false, 16);
13760 // If the magnitude operand wasn't a constant, we need to AND out the sign.
13761 if (!isa<ConstantFPSDNode>(Op0)) {
13763 Op0 = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, LogicVT, Op0);
13764 Val = DAG.getNode(X86ISD::FAND, dl, LogicVT, Op0, Val);
13766 // OR the magnitude value with the sign bit.
13767 Val = DAG.getNode(X86ISD::FOR, dl, LogicVT, Val, SignBit);
13768 return IsF128 ? Val :
13769 DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, SrcVT, Val,
13770 DAG.getIntPtrConstant(0, dl));
13773 static SDValue LowerFGETSIGN(SDValue Op, SelectionDAG &DAG) {
13774 SDValue N0 = Op.getOperand(0);
13776 MVT VT = Op.getSimpleValueType();
13778 // Lower ISD::FGETSIGN to (AND (X86ISD::FGETSIGNx86 ...) 1).
13779 SDValue xFGETSIGN = DAG.getNode(X86ISD::FGETSIGNx86, dl, VT, N0,
13780 DAG.getConstant(1, dl, VT));
13781 return DAG.getNode(ISD::AND, dl, VT, xFGETSIGN, DAG.getConstant(1, dl, VT));
13784 // Check whether an OR'd tree is PTEST-able.
13785 static SDValue LowerVectorAllZeroTest(SDValue Op, const X86Subtarget *Subtarget,
13786 SelectionDAG &DAG) {
13787 assert(Op.getOpcode() == ISD::OR && "Only check OR'd tree.");
13789 if (!Subtarget->hasSSE41())
13792 if (!Op->hasOneUse())
13795 SDNode *N = Op.getNode();
13798 SmallVector<SDValue, 8> Opnds;
13799 DenseMap<SDValue, unsigned> VecInMap;
13800 SmallVector<SDValue, 8> VecIns;
13801 EVT VT = MVT::Other;
13803 // Recognize a special case where a vector is casted into wide integer to
13805 Opnds.push_back(N->getOperand(0));
13806 Opnds.push_back(N->getOperand(1));
13808 for (unsigned Slot = 0, e = Opnds.size(); Slot < e; ++Slot) {
13809 SmallVectorImpl<SDValue>::const_iterator I = Opnds.begin() + Slot;
13810 // BFS traverse all OR'd operands.
13811 if (I->getOpcode() == ISD::OR) {
13812 Opnds.push_back(I->getOperand(0));
13813 Opnds.push_back(I->getOperand(1));
13814 // Re-evaluate the number of nodes to be traversed.
13815 e += 2; // 2 more nodes (LHS and RHS) are pushed.
13819 // Quit if a non-EXTRACT_VECTOR_ELT
13820 if (I->getOpcode() != ISD::EXTRACT_VECTOR_ELT)
13823 // Quit if without a constant index.
13824 SDValue Idx = I->getOperand(1);
13825 if (!isa<ConstantSDNode>(Idx))
13828 SDValue ExtractedFromVec = I->getOperand(0);
13829 DenseMap<SDValue, unsigned>::iterator M = VecInMap.find(ExtractedFromVec);
13830 if (M == VecInMap.end()) {
13831 VT = ExtractedFromVec.getValueType();
13832 // Quit if not 128/256-bit vector.
13833 if (!VT.is128BitVector() && !VT.is256BitVector())
13835 // Quit if not the same type.
13836 if (VecInMap.begin() != VecInMap.end() &&
13837 VT != VecInMap.begin()->first.getValueType())
13839 M = VecInMap.insert(std::make_pair(ExtractedFromVec, 0)).first;
13840 VecIns.push_back(ExtractedFromVec);
13842 M->second |= 1U << cast<ConstantSDNode>(Idx)->getZExtValue();
13845 assert((VT.is128BitVector() || VT.is256BitVector()) &&
13846 "Not extracted from 128-/256-bit vector.");
13848 unsigned FullMask = (1U << VT.getVectorNumElements()) - 1U;
13850 for (DenseMap<SDValue, unsigned>::const_iterator
13851 I = VecInMap.begin(), E = VecInMap.end(); I != E; ++I) {
13852 // Quit if not all elements are used.
13853 if (I->second != FullMask)
13857 MVT TestVT = VT.is128BitVector() ? MVT::v2i64 : MVT::v4i64;
13859 // Cast all vectors into TestVT for PTEST.
13860 for (unsigned i = 0, e = VecIns.size(); i < e; ++i)
13861 VecIns[i] = DAG.getBitcast(TestVT, VecIns[i]);
13863 // If more than one full vectors are evaluated, OR them first before PTEST.
13864 for (unsigned Slot = 0, e = VecIns.size(); e - Slot > 1; Slot += 2, e += 1) {
13865 // Each iteration will OR 2 nodes and append the result until there is only
13866 // 1 node left, i.e. the final OR'd value of all vectors.
13867 SDValue LHS = VecIns[Slot];
13868 SDValue RHS = VecIns[Slot + 1];
13869 VecIns.push_back(DAG.getNode(ISD::OR, DL, TestVT, LHS, RHS));
13872 return DAG.getNode(X86ISD::PTEST, DL, MVT::i32,
13873 VecIns.back(), VecIns.back());
13876 /// \brief return true if \c Op has a use that doesn't just read flags.
13877 static bool hasNonFlagsUse(SDValue Op) {
13878 for (SDNode::use_iterator UI = Op->use_begin(), UE = Op->use_end(); UI != UE;
13880 SDNode *User = *UI;
13881 unsigned UOpNo = UI.getOperandNo();
13882 if (User->getOpcode() == ISD::TRUNCATE && User->hasOneUse()) {
13883 // Look pass truncate.
13884 UOpNo = User->use_begin().getOperandNo();
13885 User = *User->use_begin();
13888 if (User->getOpcode() != ISD::BRCOND && User->getOpcode() != ISD::SETCC &&
13889 !(User->getOpcode() == ISD::SELECT && UOpNo == 0))
13895 /// Emit nodes that will be selected as "test Op0,Op0", or something
13897 SDValue X86TargetLowering::EmitTest(SDValue Op, unsigned X86CC, SDLoc dl,
13898 SelectionDAG &DAG) const {
13899 if (Op.getValueType() == MVT::i1) {
13900 SDValue ExtOp = DAG.getNode(ISD::ZERO_EXTEND, dl, MVT::i8, Op);
13901 return DAG.getNode(X86ISD::CMP, dl, MVT::i32, ExtOp,
13902 DAG.getConstant(0, dl, MVT::i8));
13904 // CF and OF aren't always set the way we want. Determine which
13905 // of these we need.
13906 bool NeedCF = false;
13907 bool NeedOF = false;
13910 case X86::COND_A: case X86::COND_AE:
13911 case X86::COND_B: case X86::COND_BE:
13914 case X86::COND_G: case X86::COND_GE:
13915 case X86::COND_L: case X86::COND_LE:
13916 case X86::COND_O: case X86::COND_NO: {
13917 // Check if we really need to set the
13918 // Overflow flag. If NoSignedWrap is present
13919 // that is not actually needed.
13920 switch (Op->getOpcode()) {
13925 const auto *BinNode = cast<BinaryWithFlagsSDNode>(Op.getNode());
13926 if (BinNode->Flags.hasNoSignedWrap())
13936 // See if we can use the EFLAGS value from the operand instead of
13937 // doing a separate TEST. TEST always sets OF and CF to 0, so unless
13938 // we prove that the arithmetic won't overflow, we can't use OF or CF.
13939 if (Op.getResNo() != 0 || NeedOF || NeedCF) {
13940 // Emit a CMP with 0, which is the TEST pattern.
13941 //if (Op.getValueType() == MVT::i1)
13942 // return DAG.getNode(X86ISD::CMP, dl, MVT::i1, Op,
13943 // DAG.getConstant(0, MVT::i1));
13944 return DAG.getNode(X86ISD::CMP, dl, MVT::i32, Op,
13945 DAG.getConstant(0, dl, Op.getValueType()));
13947 unsigned Opcode = 0;
13948 unsigned NumOperands = 0;
13950 // Truncate operations may prevent the merge of the SETCC instruction
13951 // and the arithmetic instruction before it. Attempt to truncate the operands
13952 // of the arithmetic instruction and use a reduced bit-width instruction.
13953 bool NeedTruncation = false;
13954 SDValue ArithOp = Op;
13955 if (Op->getOpcode() == ISD::TRUNCATE && Op->hasOneUse()) {
13956 SDValue Arith = Op->getOperand(0);
13957 // Both the trunc and the arithmetic op need to have one user each.
13958 if (Arith->hasOneUse())
13959 switch (Arith.getOpcode()) {
13966 NeedTruncation = true;
13972 // NOTICE: In the code below we use ArithOp to hold the arithmetic operation
13973 // which may be the result of a CAST. We use the variable 'Op', which is the
13974 // non-casted variable when we check for possible users.
13975 switch (ArithOp.getOpcode()) {
13977 // Due to an isel shortcoming, be conservative if this add is likely to be
13978 // selected as part of a load-modify-store instruction. When the root node
13979 // in a match is a store, isel doesn't know how to remap non-chain non-flag
13980 // uses of other nodes in the match, such as the ADD in this case. This
13981 // leads to the ADD being left around and reselected, with the result being
13982 // two adds in the output. Alas, even if none our users are stores, that
13983 // doesn't prove we're O.K. Ergo, if we have any parents that aren't
13984 // CopyToReg or SETCC, eschew INC/DEC. A better fix seems to require
13985 // climbing the DAG back to the root, and it doesn't seem to be worth the
13987 for (SDNode::use_iterator UI = Op.getNode()->use_begin(),
13988 UE = Op.getNode()->use_end(); UI != UE; ++UI)
13989 if (UI->getOpcode() != ISD::CopyToReg &&
13990 UI->getOpcode() != ISD::SETCC &&
13991 UI->getOpcode() != ISD::STORE)
13994 if (ConstantSDNode *C =
13995 dyn_cast<ConstantSDNode>(ArithOp.getNode()->getOperand(1))) {
13996 // An add of one will be selected as an INC.
13997 if (C->isOne() && !Subtarget->slowIncDec()) {
13998 Opcode = X86ISD::INC;
14003 // An add of negative one (subtract of one) will be selected as a DEC.
14004 if (C->isAllOnesValue() && !Subtarget->slowIncDec()) {
14005 Opcode = X86ISD::DEC;
14011 // Otherwise use a regular EFLAGS-setting add.
14012 Opcode = X86ISD::ADD;
14017 // If we have a constant logical shift that's only used in a comparison
14018 // against zero turn it into an equivalent AND. This allows turning it into
14019 // a TEST instruction later.
14020 if ((X86CC == X86::COND_E || X86CC == X86::COND_NE) && Op->hasOneUse() &&
14021 isa<ConstantSDNode>(Op->getOperand(1)) && !hasNonFlagsUse(Op)) {
14022 EVT VT = Op.getValueType();
14023 unsigned BitWidth = VT.getSizeInBits();
14024 unsigned ShAmt = Op->getConstantOperandVal(1);
14025 if (ShAmt >= BitWidth) // Avoid undefined shifts.
14027 APInt Mask = ArithOp.getOpcode() == ISD::SRL
14028 ? APInt::getHighBitsSet(BitWidth, BitWidth - ShAmt)
14029 : APInt::getLowBitsSet(BitWidth, BitWidth - ShAmt);
14030 if (!Mask.isSignedIntN(32)) // Avoid large immediates.
14032 SDValue New = DAG.getNode(ISD::AND, dl, VT, Op->getOperand(0),
14033 DAG.getConstant(Mask, dl, VT));
14034 DAG.ReplaceAllUsesWith(Op, New);
14040 // If the primary and result isn't used, don't bother using X86ISD::AND,
14041 // because a TEST instruction will be better.
14042 if (!hasNonFlagsUse(Op))
14048 // Due to the ISEL shortcoming noted above, be conservative if this op is
14049 // likely to be selected as part of a load-modify-store instruction.
14050 for (SDNode::use_iterator UI = Op.getNode()->use_begin(),
14051 UE = Op.getNode()->use_end(); UI != UE; ++UI)
14052 if (UI->getOpcode() == ISD::STORE)
14055 // Otherwise use a regular EFLAGS-setting instruction.
14056 switch (ArithOp.getOpcode()) {
14057 default: llvm_unreachable("unexpected operator!");
14058 case ISD::SUB: Opcode = X86ISD::SUB; break;
14059 case ISD::XOR: Opcode = X86ISD::XOR; break;
14060 case ISD::AND: Opcode = X86ISD::AND; break;
14062 if (!NeedTruncation && (X86CC == X86::COND_E || X86CC == X86::COND_NE)) {
14063 SDValue EFLAGS = LowerVectorAllZeroTest(Op, Subtarget, DAG);
14064 if (EFLAGS.getNode())
14067 Opcode = X86ISD::OR;
14081 return SDValue(Op.getNode(), 1);
14087 // If we found that truncation is beneficial, perform the truncation and
14089 if (NeedTruncation) {
14090 EVT VT = Op.getValueType();
14091 SDValue WideVal = Op->getOperand(0);
14092 EVT WideVT = WideVal.getValueType();
14093 unsigned ConvertedOp = 0;
14094 // Use a target machine opcode to prevent further DAGCombine
14095 // optimizations that may separate the arithmetic operations
14096 // from the setcc node.
14097 switch (WideVal.getOpcode()) {
14099 case ISD::ADD: ConvertedOp = X86ISD::ADD; break;
14100 case ISD::SUB: ConvertedOp = X86ISD::SUB; break;
14101 case ISD::AND: ConvertedOp = X86ISD::AND; break;
14102 case ISD::OR: ConvertedOp = X86ISD::OR; break;
14103 case ISD::XOR: ConvertedOp = X86ISD::XOR; break;
14107 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
14108 if (TLI.isOperationLegal(WideVal.getOpcode(), WideVT)) {
14109 SDValue V0 = DAG.getNode(ISD::TRUNCATE, dl, VT, WideVal.getOperand(0));
14110 SDValue V1 = DAG.getNode(ISD::TRUNCATE, dl, VT, WideVal.getOperand(1));
14111 Op = DAG.getNode(ConvertedOp, dl, VT, V0, V1);
14117 // Emit a CMP with 0, which is the TEST pattern.
14118 return DAG.getNode(X86ISD::CMP, dl, MVT::i32, Op,
14119 DAG.getConstant(0, dl, Op.getValueType()));
14121 SDVTList VTs = DAG.getVTList(Op.getValueType(), MVT::i32);
14122 SmallVector<SDValue, 4> Ops(Op->op_begin(), Op->op_begin() + NumOperands);
14124 SDValue New = DAG.getNode(Opcode, dl, VTs, Ops);
14125 DAG.ReplaceAllUsesWith(Op, New);
14126 return SDValue(New.getNode(), 1);
14129 /// Emit nodes that will be selected as "cmp Op0,Op1", or something
14131 SDValue X86TargetLowering::EmitCmp(SDValue Op0, SDValue Op1, unsigned X86CC,
14132 SDLoc dl, SelectionDAG &DAG) const {
14133 if (isNullConstant(Op1))
14134 return EmitTest(Op0, X86CC, dl, DAG);
14136 assert(!(isa<ConstantSDNode>(Op1) && Op0.getValueType() == MVT::i1) &&
14137 "Unexpected comparison operation for MVT::i1 operands");
14139 if ((Op0.getValueType() == MVT::i8 || Op0.getValueType() == MVT::i16 ||
14140 Op0.getValueType() == MVT::i32 || Op0.getValueType() == MVT::i64)) {
14141 // Do the comparison at i32 if it's smaller, besides the Atom case.
14142 // This avoids subregister aliasing issues. Keep the smaller reference
14143 // if we're optimizing for size, however, as that'll allow better folding
14144 // of memory operations.
14145 if (Op0.getValueType() != MVT::i32 && Op0.getValueType() != MVT::i64 &&
14146 !DAG.getMachineFunction().getFunction()->optForMinSize() &&
14147 !Subtarget->isAtom()) {
14148 unsigned ExtendOp =
14149 isX86CCUnsigned(X86CC) ? ISD::ZERO_EXTEND : ISD::SIGN_EXTEND;
14150 Op0 = DAG.getNode(ExtendOp, dl, MVT::i32, Op0);
14151 Op1 = DAG.getNode(ExtendOp, dl, MVT::i32, Op1);
14153 // Use SUB instead of CMP to enable CSE between SUB and CMP.
14154 SDVTList VTs = DAG.getVTList(Op0.getValueType(), MVT::i32);
14155 SDValue Sub = DAG.getNode(X86ISD::SUB, dl, VTs,
14157 return SDValue(Sub.getNode(), 1);
14159 return DAG.getNode(X86ISD::CMP, dl, MVT::i32, Op0, Op1);
14162 /// Convert a comparison if required by the subtarget.
14163 SDValue X86TargetLowering::ConvertCmpIfNecessary(SDValue Cmp,
14164 SelectionDAG &DAG) const {
14165 // If the subtarget does not support the FUCOMI instruction, floating-point
14166 // comparisons have to be converted.
14167 if (Subtarget->hasCMov() ||
14168 Cmp.getOpcode() != X86ISD::CMP ||
14169 !Cmp.getOperand(0).getValueType().isFloatingPoint() ||
14170 !Cmp.getOperand(1).getValueType().isFloatingPoint())
14173 // The instruction selector will select an FUCOM instruction instead of
14174 // FUCOMI, which writes the comparison result to FPSW instead of EFLAGS. Hence
14175 // build an SDNode sequence that transfers the result from FPSW into EFLAGS:
14176 // (X86sahf (trunc (srl (X86fp_stsw (trunc (X86cmp ...)), 8))))
14178 SDValue TruncFPSW = DAG.getNode(ISD::TRUNCATE, dl, MVT::i16, Cmp);
14179 SDValue FNStSW = DAG.getNode(X86ISD::FNSTSW16r, dl, MVT::i16, TruncFPSW);
14180 SDValue Srl = DAG.getNode(ISD::SRL, dl, MVT::i16, FNStSW,
14181 DAG.getConstant(8, dl, MVT::i8));
14182 SDValue TruncSrl = DAG.getNode(ISD::TRUNCATE, dl, MVT::i8, Srl);
14184 // Some 64-bit targets lack SAHF support, but they do support FCOMI.
14185 assert(Subtarget->hasLAHFSAHF() && "Target doesn't support SAHF or FCOMI?");
14186 return DAG.getNode(X86ISD::SAHF, dl, MVT::i32, TruncSrl);
14189 /// The minimum architected relative accuracy is 2^-12. We need one
14190 /// Newton-Raphson step to have a good float result (24 bits of precision).
14191 SDValue X86TargetLowering::getRsqrtEstimate(SDValue Op,
14192 DAGCombinerInfo &DCI,
14193 unsigned &RefinementSteps,
14194 bool &UseOneConstNR) const {
14195 EVT VT = Op.getValueType();
14196 const char *RecipOp;
14198 // SSE1 has rsqrtss and rsqrtps. AVX adds a 256-bit variant for rsqrtps.
14199 // TODO: Add support for AVX512 (v16f32).
14200 // It is likely not profitable to do this for f64 because a double-precision
14201 // rsqrt estimate with refinement on x86 prior to FMA requires at least 16
14202 // instructions: convert to single, rsqrtss, convert back to double, refine
14203 // (3 steps = at least 13 insts). If an 'rsqrtsd' variant was added to the ISA
14204 // along with FMA, this could be a throughput win.
14205 if (VT == MVT::f32 && Subtarget->hasSSE1())
14207 else if ((VT == MVT::v4f32 && Subtarget->hasSSE1()) ||
14208 (VT == MVT::v8f32 && Subtarget->hasAVX()))
14209 RecipOp = "vec-sqrtf";
14213 TargetRecip Recips = DCI.DAG.getTarget().Options.Reciprocals;
14214 if (!Recips.isEnabled(RecipOp))
14217 RefinementSteps = Recips.getRefinementSteps(RecipOp);
14218 UseOneConstNR = false;
14219 return DCI.DAG.getNode(X86ISD::FRSQRT, SDLoc(Op), VT, Op);
14222 /// The minimum architected relative accuracy is 2^-12. We need one
14223 /// Newton-Raphson step to have a good float result (24 bits of precision).
14224 SDValue X86TargetLowering::getRecipEstimate(SDValue Op,
14225 DAGCombinerInfo &DCI,
14226 unsigned &RefinementSteps) const {
14227 EVT VT = Op.getValueType();
14228 const char *RecipOp;
14230 // SSE1 has rcpss and rcpps. AVX adds a 256-bit variant for rcpps.
14231 // TODO: Add support for AVX512 (v16f32).
14232 // It is likely not profitable to do this for f64 because a double-precision
14233 // reciprocal estimate with refinement on x86 prior to FMA requires
14234 // 15 instructions: convert to single, rcpss, convert back to double, refine
14235 // (3 steps = 12 insts). If an 'rcpsd' variant was added to the ISA
14236 // along with FMA, this could be a throughput win.
14237 if (VT == MVT::f32 && Subtarget->hasSSE1())
14239 else if ((VT == MVT::v4f32 && Subtarget->hasSSE1()) ||
14240 (VT == MVT::v8f32 && Subtarget->hasAVX()))
14241 RecipOp = "vec-divf";
14245 TargetRecip Recips = DCI.DAG.getTarget().Options.Reciprocals;
14246 if (!Recips.isEnabled(RecipOp))
14249 RefinementSteps = Recips.getRefinementSteps(RecipOp);
14250 return DCI.DAG.getNode(X86ISD::FRCP, SDLoc(Op), VT, Op);
14253 /// If we have at least two divisions that use the same divisor, convert to
14254 /// multplication by a reciprocal. This may need to be adjusted for a given
14255 /// CPU if a division's cost is not at least twice the cost of a multiplication.
14256 /// This is because we still need one division to calculate the reciprocal and
14257 /// then we need two multiplies by that reciprocal as replacements for the
14258 /// original divisions.
14259 unsigned X86TargetLowering::combineRepeatedFPDivisors() const {
14263 /// LowerToBT - Result of 'and' is compared against zero. Turn it into a BT node
14264 /// if it's possible.
14265 SDValue X86TargetLowering::LowerToBT(SDValue And, ISD::CondCode CC,
14266 SDLoc dl, SelectionDAG &DAG) const {
14267 SDValue Op0 = And.getOperand(0);
14268 SDValue Op1 = And.getOperand(1);
14269 if (Op0.getOpcode() == ISD::TRUNCATE)
14270 Op0 = Op0.getOperand(0);
14271 if (Op1.getOpcode() == ISD::TRUNCATE)
14272 Op1 = Op1.getOperand(0);
14275 if (Op1.getOpcode() == ISD::SHL)
14276 std::swap(Op0, Op1);
14277 if (Op0.getOpcode() == ISD::SHL) {
14278 if (isOneConstant(Op0.getOperand(0))) {
14279 // If we looked past a truncate, check that it's only truncating away
14281 unsigned BitWidth = Op0.getValueSizeInBits();
14282 unsigned AndBitWidth = And.getValueSizeInBits();
14283 if (BitWidth > AndBitWidth) {
14285 DAG.computeKnownBits(Op0, Zeros, Ones);
14286 if (Zeros.countLeadingOnes() < BitWidth - AndBitWidth)
14290 RHS = Op0.getOperand(1);
14292 } else if (Op1.getOpcode() == ISD::Constant) {
14293 ConstantSDNode *AndRHS = cast<ConstantSDNode>(Op1);
14294 uint64_t AndRHSVal = AndRHS->getZExtValue();
14295 SDValue AndLHS = Op0;
14297 if (AndRHSVal == 1 && AndLHS.getOpcode() == ISD::SRL) {
14298 LHS = AndLHS.getOperand(0);
14299 RHS = AndLHS.getOperand(1);
14302 // Use BT if the immediate can't be encoded in a TEST instruction.
14303 if (!isUInt<32>(AndRHSVal) && isPowerOf2_64(AndRHSVal)) {
14305 RHS = DAG.getConstant(Log2_64_Ceil(AndRHSVal), dl, LHS.getValueType());
14309 if (LHS.getNode()) {
14310 // If LHS is i8, promote it to i32 with any_extend. There is no i8 BT
14311 // instruction. Since the shift amount is in-range-or-undefined, we know
14312 // that doing a bittest on the i32 value is ok. We extend to i32 because
14313 // the encoding for the i16 version is larger than the i32 version.
14314 // Also promote i16 to i32 for performance / code size reason.
14315 if (LHS.getValueType() == MVT::i8 ||
14316 LHS.getValueType() == MVT::i16)
14317 LHS = DAG.getNode(ISD::ANY_EXTEND, dl, MVT::i32, LHS);
14319 // If the operand types disagree, extend the shift amount to match. Since
14320 // BT ignores high bits (like shifts) we can use anyextend.
14321 if (LHS.getValueType() != RHS.getValueType())
14322 RHS = DAG.getNode(ISD::ANY_EXTEND, dl, LHS.getValueType(), RHS);
14324 SDValue BT = DAG.getNode(X86ISD::BT, dl, MVT::i32, LHS, RHS);
14325 X86::CondCode Cond = CC == ISD::SETEQ ? X86::COND_AE : X86::COND_B;
14326 return DAG.getNode(X86ISD::SETCC, dl, MVT::i8,
14327 DAG.getConstant(Cond, dl, MVT::i8), BT);
14333 /// \brief - Turns an ISD::CondCode into a value suitable for SSE floating point
14335 static int translateX86FSETCC(ISD::CondCode SetCCOpcode, SDValue &Op0,
14340 // SSE Condition code mapping:
14349 switch (SetCCOpcode) {
14350 default: llvm_unreachable("Unexpected SETCC condition");
14352 case ISD::SETEQ: SSECC = 0; break;
14354 case ISD::SETGT: Swap = true; // Fallthrough
14356 case ISD::SETOLT: SSECC = 1; break;
14358 case ISD::SETGE: Swap = true; // Fallthrough
14360 case ISD::SETOLE: SSECC = 2; break;
14361 case ISD::SETUO: SSECC = 3; break;
14363 case ISD::SETNE: SSECC = 4; break;
14364 case ISD::SETULE: Swap = true; // Fallthrough
14365 case ISD::SETUGE: SSECC = 5; break;
14366 case ISD::SETULT: Swap = true; // Fallthrough
14367 case ISD::SETUGT: SSECC = 6; break;
14368 case ISD::SETO: SSECC = 7; break;
14370 case ISD::SETONE: SSECC = 8; break;
14373 std::swap(Op0, Op1);
14378 // Lower256IntVSETCC - Break a VSETCC 256-bit integer VSETCC into two new 128
14379 // ones, and then concatenate the result back.
14380 static SDValue Lower256IntVSETCC(SDValue Op, SelectionDAG &DAG) {
14381 MVT VT = Op.getSimpleValueType();
14383 assert(VT.is256BitVector() && Op.getOpcode() == ISD::SETCC &&
14384 "Unsupported value type for operation");
14386 unsigned NumElems = VT.getVectorNumElements();
14388 SDValue CC = Op.getOperand(2);
14390 // Extract the LHS vectors
14391 SDValue LHS = Op.getOperand(0);
14392 SDValue LHS1 = Extract128BitVector(LHS, 0, DAG, dl);
14393 SDValue LHS2 = Extract128BitVector(LHS, NumElems/2, DAG, dl);
14395 // Extract the RHS vectors
14396 SDValue RHS = Op.getOperand(1);
14397 SDValue RHS1 = Extract128BitVector(RHS, 0, DAG, dl);
14398 SDValue RHS2 = Extract128BitVector(RHS, NumElems/2, DAG, dl);
14400 // Issue the operation on the smaller types and concatenate the result back
14401 MVT EltVT = VT.getVectorElementType();
14402 MVT NewVT = MVT::getVectorVT(EltVT, NumElems/2);
14403 return DAG.getNode(ISD::CONCAT_VECTORS, dl, VT,
14404 DAG.getNode(Op.getOpcode(), dl, NewVT, LHS1, RHS1, CC),
14405 DAG.getNode(Op.getOpcode(), dl, NewVT, LHS2, RHS2, CC));
14408 static SDValue LowerBoolVSETCC_AVX512(SDValue Op, SelectionDAG &DAG) {
14409 SDValue Op0 = Op.getOperand(0);
14410 SDValue Op1 = Op.getOperand(1);
14411 SDValue CC = Op.getOperand(2);
14412 MVT VT = Op.getSimpleValueType();
14415 assert(Op0.getSimpleValueType().getVectorElementType() == MVT::i1 &&
14416 "Unexpected type for boolean compare operation");
14417 ISD::CondCode SetCCOpcode = cast<CondCodeSDNode>(CC)->get();
14418 SDValue NotOp0 = DAG.getNode(ISD::XOR, dl, VT, Op0,
14419 DAG.getConstant(-1, dl, VT));
14420 SDValue NotOp1 = DAG.getNode(ISD::XOR, dl, VT, Op1,
14421 DAG.getConstant(-1, dl, VT));
14422 switch (SetCCOpcode) {
14423 default: llvm_unreachable("Unexpected SETCC condition");
14425 // (x == y) -> ~(x ^ y)
14426 return DAG.getNode(ISD::XOR, dl, VT,
14427 DAG.getNode(ISD::XOR, dl, VT, Op0, Op1),
14428 DAG.getConstant(-1, dl, VT));
14430 // (x != y) -> (x ^ y)
14431 return DAG.getNode(ISD::XOR, dl, VT, Op0, Op1);
14434 // (x > y) -> (x & ~y)
14435 return DAG.getNode(ISD::AND, dl, VT, Op0, NotOp1);
14438 // (x < y) -> (~x & y)
14439 return DAG.getNode(ISD::AND, dl, VT, NotOp0, Op1);
14442 // (x <= y) -> (~x | y)
14443 return DAG.getNode(ISD::OR, dl, VT, NotOp0, Op1);
14446 // (x >=y) -> (x | ~y)
14447 return DAG.getNode(ISD::OR, dl, VT, Op0, NotOp1);
14451 static SDValue LowerIntVSETCC_AVX512(SDValue Op, SelectionDAG &DAG,
14452 const X86Subtarget *Subtarget) {
14453 SDValue Op0 = Op.getOperand(0);
14454 SDValue Op1 = Op.getOperand(1);
14455 SDValue CC = Op.getOperand(2);
14456 MVT VT = Op.getSimpleValueType();
14459 assert(Op0.getSimpleValueType().getVectorElementType().getSizeInBits() >= 8 &&
14460 Op.getSimpleValueType().getVectorElementType() == MVT::i1 &&
14461 "Cannot set masked compare for this operation");
14463 ISD::CondCode SetCCOpcode = cast<CondCodeSDNode>(CC)->get();
14465 bool Unsigned = false;
14468 switch (SetCCOpcode) {
14469 default: llvm_unreachable("Unexpected SETCC condition");
14470 case ISD::SETNE: SSECC = 4; break;
14471 case ISD::SETEQ: Opc = X86ISD::PCMPEQM; break;
14472 case ISD::SETUGT: SSECC = 6; Unsigned = true; break;
14473 case ISD::SETLT: Swap = true; //fall-through
14474 case ISD::SETGT: Opc = X86ISD::PCMPGTM; break;
14475 case ISD::SETULT: SSECC = 1; Unsigned = true; break;
14476 case ISD::SETUGE: SSECC = 5; Unsigned = true; break; //NLT
14477 case ISD::SETGE: Swap = true; SSECC = 2; break; // LE + swap
14478 case ISD::SETULE: Unsigned = true; //fall-through
14479 case ISD::SETLE: SSECC = 2; break;
14483 std::swap(Op0, Op1);
14485 return DAG.getNode(Opc, dl, VT, Op0, Op1);
14486 Opc = Unsigned ? X86ISD::CMPMU: X86ISD::CMPM;
14487 return DAG.getNode(Opc, dl, VT, Op0, Op1,
14488 DAG.getConstant(SSECC, dl, MVT::i8));
14491 /// \brief Try to turn a VSETULT into a VSETULE by modifying its second
14492 /// operand \p Op1. If non-trivial (for example because it's not constant)
14493 /// return an empty value.
14494 static SDValue ChangeVSETULTtoVSETULE(SDLoc dl, SDValue Op1, SelectionDAG &DAG)
14496 BuildVectorSDNode *BV = dyn_cast<BuildVectorSDNode>(Op1.getNode());
14500 MVT VT = Op1.getSimpleValueType();
14501 MVT EVT = VT.getVectorElementType();
14502 unsigned n = VT.getVectorNumElements();
14503 SmallVector<SDValue, 8> ULTOp1;
14505 for (unsigned i = 0; i < n; ++i) {
14506 ConstantSDNode *Elt = dyn_cast<ConstantSDNode>(BV->getOperand(i));
14507 if (!Elt || Elt->isOpaque() || Elt->getSimpleValueType(0) != EVT)
14510 // Avoid underflow.
14511 APInt Val = Elt->getAPIntValue();
14515 ULTOp1.push_back(DAG.getConstant(Val - 1, dl, EVT));
14518 return DAG.getNode(ISD::BUILD_VECTOR, dl, VT, ULTOp1);
14521 static SDValue LowerVSETCC(SDValue Op, const X86Subtarget *Subtarget,
14522 SelectionDAG &DAG) {
14523 SDValue Op0 = Op.getOperand(0);
14524 SDValue Op1 = Op.getOperand(1);
14525 SDValue CC = Op.getOperand(2);
14526 MVT VT = Op.getSimpleValueType();
14527 ISD::CondCode SetCCOpcode = cast<CondCodeSDNode>(CC)->get();
14528 bool isFP = Op.getOperand(1).getSimpleValueType().isFloatingPoint();
14533 MVT EltVT = Op0.getSimpleValueType().getVectorElementType();
14534 assert(EltVT == MVT::f32 || EltVT == MVT::f64);
14537 unsigned SSECC = translateX86FSETCC(SetCCOpcode, Op0, Op1);
14538 unsigned Opc = X86ISD::CMPP;
14539 if (Subtarget->hasAVX512() && VT.getVectorElementType() == MVT::i1) {
14540 assert(VT.getVectorNumElements() <= 16);
14541 Opc = X86ISD::CMPM;
14543 // In the two special cases we can't handle, emit two comparisons.
14546 unsigned CombineOpc;
14547 if (SetCCOpcode == ISD::SETUEQ) {
14548 CC0 = 3; CC1 = 0; CombineOpc = ISD::OR;
14550 assert(SetCCOpcode == ISD::SETONE);
14551 CC0 = 7; CC1 = 4; CombineOpc = ISD::AND;
14554 SDValue Cmp0 = DAG.getNode(Opc, dl, VT, Op0, Op1,
14555 DAG.getConstant(CC0, dl, MVT::i8));
14556 SDValue Cmp1 = DAG.getNode(Opc, dl, VT, Op0, Op1,
14557 DAG.getConstant(CC1, dl, MVT::i8));
14558 return DAG.getNode(CombineOpc, dl, VT, Cmp0, Cmp1);
14560 // Handle all other FP comparisons here.
14561 return DAG.getNode(Opc, dl, VT, Op0, Op1,
14562 DAG.getConstant(SSECC, dl, MVT::i8));
14565 MVT VTOp0 = Op0.getSimpleValueType();
14566 assert(VTOp0 == Op1.getSimpleValueType() &&
14567 "Expected operands with same type!");
14568 assert(VT.getVectorNumElements() == VTOp0.getVectorNumElements() &&
14569 "Invalid number of packed elements for source and destination!");
14571 if (VT.is128BitVector() && VTOp0.is256BitVector()) {
14572 // On non-AVX512 targets, a vector of MVT::i1 is promoted by the type
14573 // legalizer to a wider vector type. In the case of 'vsetcc' nodes, the
14574 // legalizer firstly checks if the first operand in input to the setcc has
14575 // a legal type. If so, then it promotes the return type to that same type.
14576 // Otherwise, the return type is promoted to the 'next legal type' which,
14577 // for a vector of MVT::i1 is always a 128-bit integer vector type.
14579 // We reach this code only if the following two conditions are met:
14580 // 1. Both return type and operand type have been promoted to wider types
14581 // by the type legalizer.
14582 // 2. The original operand type has been promoted to a 256-bit vector.
14584 // Note that condition 2. only applies for AVX targets.
14585 SDValue NewOp = DAG.getSetCC(dl, VTOp0, Op0, Op1, SetCCOpcode);
14586 return DAG.getZExtOrTrunc(NewOp, dl, VT);
14589 // The non-AVX512 code below works under the assumption that source and
14590 // destination types are the same.
14591 assert((Subtarget->hasAVX512() || (VT == VTOp0)) &&
14592 "Value types for source and destination must be the same!");
14594 // Break 256-bit integer vector compare into smaller ones.
14595 if (VT.is256BitVector() && !Subtarget->hasInt256())
14596 return Lower256IntVSETCC(Op, DAG);
14598 MVT OpVT = Op1.getSimpleValueType();
14599 if (OpVT.getVectorElementType() == MVT::i1)
14600 return LowerBoolVSETCC_AVX512(Op, DAG);
14602 bool MaskResult = (VT.getVectorElementType() == MVT::i1);
14603 if (Subtarget->hasAVX512()) {
14604 if (Op1.getSimpleValueType().is512BitVector() ||
14605 (Subtarget->hasBWI() && Subtarget->hasVLX()) ||
14606 (MaskResult && OpVT.getVectorElementType().getSizeInBits() >= 32))
14607 return LowerIntVSETCC_AVX512(Op, DAG, Subtarget);
14609 // In AVX-512 architecture setcc returns mask with i1 elements,
14610 // But there is no compare instruction for i8 and i16 elements in KNL.
14611 // We are not talking about 512-bit operands in this case, these
14612 // types are illegal.
14614 (OpVT.getVectorElementType().getSizeInBits() < 32 &&
14615 OpVT.getVectorElementType().getSizeInBits() >= 8))
14616 return DAG.getNode(ISD::TRUNCATE, dl, VT,
14617 DAG.getNode(ISD::SETCC, dl, OpVT, Op0, Op1, CC));
14620 // Lower using XOP integer comparisons.
14621 if ((VT == MVT::v16i8 || VT == MVT::v8i16 ||
14622 VT == MVT::v4i32 || VT == MVT::v2i64) && Subtarget->hasXOP()) {
14623 // Translate compare code to XOP PCOM compare mode.
14624 unsigned CmpMode = 0;
14625 switch (SetCCOpcode) {
14626 default: llvm_unreachable("Unexpected SETCC condition");
14628 case ISD::SETLT: CmpMode = 0x00; break;
14630 case ISD::SETLE: CmpMode = 0x01; break;
14632 case ISD::SETGT: CmpMode = 0x02; break;
14634 case ISD::SETGE: CmpMode = 0x03; break;
14635 case ISD::SETEQ: CmpMode = 0x04; break;
14636 case ISD::SETNE: CmpMode = 0x05; break;
14639 // Are we comparing unsigned or signed integers?
14640 unsigned Opc = ISD::isUnsignedIntSetCC(SetCCOpcode)
14641 ? X86ISD::VPCOMU : X86ISD::VPCOM;
14643 return DAG.getNode(Opc, dl, VT, Op0, Op1,
14644 DAG.getConstant(CmpMode, dl, MVT::i8));
14647 // We are handling one of the integer comparisons here. Since SSE only has
14648 // GT and EQ comparisons for integer, swapping operands and multiple
14649 // operations may be required for some comparisons.
14651 bool Swap = false, Invert = false, FlipSigns = false, MinMax = false;
14652 bool Subus = false;
14654 switch (SetCCOpcode) {
14655 default: llvm_unreachable("Unexpected SETCC condition");
14656 case ISD::SETNE: Invert = true;
14657 case ISD::SETEQ: Opc = X86ISD::PCMPEQ; break;
14658 case ISD::SETLT: Swap = true;
14659 case ISD::SETGT: Opc = X86ISD::PCMPGT; break;
14660 case ISD::SETGE: Swap = true;
14661 case ISD::SETLE: Opc = X86ISD::PCMPGT;
14662 Invert = true; break;
14663 case ISD::SETULT: Swap = true;
14664 case ISD::SETUGT: Opc = X86ISD::PCMPGT;
14665 FlipSigns = true; break;
14666 case ISD::SETUGE: Swap = true;
14667 case ISD::SETULE: Opc = X86ISD::PCMPGT;
14668 FlipSigns = true; Invert = true; break;
14671 // Special case: Use min/max operations for SETULE/SETUGE
14672 MVT VET = VT.getVectorElementType();
14674 (Subtarget->hasSSE41() && (VET >= MVT::i8 && VET <= MVT::i32))
14675 || (Subtarget->hasSSE2() && (VET == MVT::i8));
14678 switch (SetCCOpcode) {
14680 case ISD::SETULE: Opc = ISD::UMIN; MinMax = true; break;
14681 case ISD::SETUGE: Opc = ISD::UMAX; MinMax = true; break;
14684 if (MinMax) { Swap = false; Invert = false; FlipSigns = false; }
14687 bool hasSubus = Subtarget->hasSSE2() && (VET == MVT::i8 || VET == MVT::i16);
14688 if (!MinMax && hasSubus) {
14689 // As another special case, use PSUBUS[BW] when it's profitable. E.g. for
14691 // t = psubus Op0, Op1
14692 // pcmpeq t, <0..0>
14693 switch (SetCCOpcode) {
14695 case ISD::SETULT: {
14696 // If the comparison is against a constant we can turn this into a
14697 // setule. With psubus, setule does not require a swap. This is
14698 // beneficial because the constant in the register is no longer
14699 // destructed as the destination so it can be hoisted out of a loop.
14700 // Only do this pre-AVX since vpcmp* is no longer destructive.
14701 if (Subtarget->hasAVX())
14703 SDValue ULEOp1 = ChangeVSETULTtoVSETULE(dl, Op1, DAG);
14704 if (ULEOp1.getNode()) {
14706 Subus = true; Invert = false; Swap = false;
14710 // Psubus is better than flip-sign because it requires no inversion.
14711 case ISD::SETUGE: Subus = true; Invert = false; Swap = true; break;
14712 case ISD::SETULE: Subus = true; Invert = false; Swap = false; break;
14716 Opc = X86ISD::SUBUS;
14722 std::swap(Op0, Op1);
14724 // Check that the operation in question is available (most are plain SSE2,
14725 // but PCMPGTQ and PCMPEQQ have different requirements).
14726 if (VT == MVT::v2i64) {
14727 if (Opc == X86ISD::PCMPGT && !Subtarget->hasSSE42()) {
14728 assert(Subtarget->hasSSE2() && "Don't know how to lower!");
14730 // First cast everything to the right type.
14731 Op0 = DAG.getBitcast(MVT::v4i32, Op0);
14732 Op1 = DAG.getBitcast(MVT::v4i32, Op1);
14734 // Since SSE has no unsigned integer comparisons, we need to flip the sign
14735 // bits of the inputs before performing those operations. The lower
14736 // compare is always unsigned.
14739 SB = DAG.getConstant(0x80000000U, dl, MVT::v4i32);
14741 SDValue Sign = DAG.getConstant(0x80000000U, dl, MVT::i32);
14742 SDValue Zero = DAG.getConstant(0x00000000U, dl, MVT::i32);
14743 SB = DAG.getNode(ISD::BUILD_VECTOR, dl, MVT::v4i32,
14744 Sign, Zero, Sign, Zero);
14746 Op0 = DAG.getNode(ISD::XOR, dl, MVT::v4i32, Op0, SB);
14747 Op1 = DAG.getNode(ISD::XOR, dl, MVT::v4i32, Op1, SB);
14749 // Emulate PCMPGTQ with (hi1 > hi2) | ((hi1 == hi2) & (lo1 > lo2))
14750 SDValue GT = DAG.getNode(X86ISD::PCMPGT, dl, MVT::v4i32, Op0, Op1);
14751 SDValue EQ = DAG.getNode(X86ISD::PCMPEQ, dl, MVT::v4i32, Op0, Op1);
14753 // Create masks for only the low parts/high parts of the 64 bit integers.
14754 static const int MaskHi[] = { 1, 1, 3, 3 };
14755 static const int MaskLo[] = { 0, 0, 2, 2 };
14756 SDValue EQHi = DAG.getVectorShuffle(MVT::v4i32, dl, EQ, EQ, MaskHi);
14757 SDValue GTLo = DAG.getVectorShuffle(MVT::v4i32, dl, GT, GT, MaskLo);
14758 SDValue GTHi = DAG.getVectorShuffle(MVT::v4i32, dl, GT, GT, MaskHi);
14760 SDValue Result = DAG.getNode(ISD::AND, dl, MVT::v4i32, EQHi, GTLo);
14761 Result = DAG.getNode(ISD::OR, dl, MVT::v4i32, Result, GTHi);
14764 Result = DAG.getNOT(dl, Result, MVT::v4i32);
14766 return DAG.getBitcast(VT, Result);
14769 if (Opc == X86ISD::PCMPEQ && !Subtarget->hasSSE41()) {
14770 // If pcmpeqq is missing but pcmpeqd is available synthesize pcmpeqq with
14771 // pcmpeqd + pshufd + pand.
14772 assert(Subtarget->hasSSE2() && !FlipSigns && "Don't know how to lower!");
14774 // First cast everything to the right type.
14775 Op0 = DAG.getBitcast(MVT::v4i32, Op0);
14776 Op1 = DAG.getBitcast(MVT::v4i32, Op1);
14779 SDValue Result = DAG.getNode(Opc, dl, MVT::v4i32, Op0, Op1);
14781 // Make sure the lower and upper halves are both all-ones.
14782 static const int Mask[] = { 1, 0, 3, 2 };
14783 SDValue Shuf = DAG.getVectorShuffle(MVT::v4i32, dl, Result, Result, Mask);
14784 Result = DAG.getNode(ISD::AND, dl, MVT::v4i32, Result, Shuf);
14787 Result = DAG.getNOT(dl, Result, MVT::v4i32);
14789 return DAG.getBitcast(VT, Result);
14793 // Since SSE has no unsigned integer comparisons, we need to flip the sign
14794 // bits of the inputs before performing those operations.
14796 MVT EltVT = VT.getVectorElementType();
14797 SDValue SB = DAG.getConstant(APInt::getSignBit(EltVT.getSizeInBits()), dl,
14799 Op0 = DAG.getNode(ISD::XOR, dl, VT, Op0, SB);
14800 Op1 = DAG.getNode(ISD::XOR, dl, VT, Op1, SB);
14803 SDValue Result = DAG.getNode(Opc, dl, VT, Op0, Op1);
14805 // If the logical-not of the result is required, perform that now.
14807 Result = DAG.getNOT(dl, Result, VT);
14810 Result = DAG.getNode(X86ISD::PCMPEQ, dl, VT, Op0, Result);
14813 Result = DAG.getNode(X86ISD::PCMPEQ, dl, VT, Result,
14814 getZeroVector(VT, Subtarget, DAG, dl));
14819 SDValue X86TargetLowering::LowerSETCC(SDValue Op, SelectionDAG &DAG) const {
14821 MVT VT = Op.getSimpleValueType();
14823 if (VT.isVector()) return LowerVSETCC(Op, Subtarget, DAG);
14825 assert(((!Subtarget->hasAVX512() && VT == MVT::i8) || (VT == MVT::i1))
14826 && "SetCC type must be 8-bit or 1-bit integer");
14827 SDValue Op0 = Op.getOperand(0);
14828 SDValue Op1 = Op.getOperand(1);
14830 ISD::CondCode CC = cast<CondCodeSDNode>(Op.getOperand(2))->get();
14832 // Optimize to BT if possible.
14833 // Lower (X & (1 << N)) == 0 to BT(X, N).
14834 // Lower ((X >>u N) & 1) != 0 to BT(X, N).
14835 // Lower ((X >>s N) & 1) != 0 to BT(X, N).
14836 if (Op0.getOpcode() == ISD::AND && Op0.hasOneUse() &&
14837 isNullConstant(Op1) &&
14838 (CC == ISD::SETEQ || CC == ISD::SETNE)) {
14839 if (SDValue NewSetCC = LowerToBT(Op0, CC, dl, DAG)) {
14841 return DAG.getNode(ISD::TRUNCATE, dl, MVT::i1, NewSetCC);
14846 // Look for X == 0, X == 1, X != 0, or X != 1. We can simplify some forms of
14848 if ((isOneConstant(Op1) || isNullConstant(Op1)) &&
14849 (CC == ISD::SETEQ || CC == ISD::SETNE)) {
14851 // If the input is a setcc, then reuse the input setcc or use a new one with
14852 // the inverted condition.
14853 if (Op0.getOpcode() == X86ISD::SETCC) {
14854 X86::CondCode CCode = (X86::CondCode)Op0.getConstantOperandVal(0);
14855 bool Invert = (CC == ISD::SETNE) ^ isNullConstant(Op1);
14859 CCode = X86::GetOppositeBranchCondition(CCode);
14860 SDValue SetCC = DAG.getNode(X86ISD::SETCC, dl, MVT::i8,
14861 DAG.getConstant(CCode, dl, MVT::i8),
14862 Op0.getOperand(1));
14864 return DAG.getNode(ISD::TRUNCATE, dl, MVT::i1, SetCC);
14868 if ((Op0.getValueType() == MVT::i1) && isOneConstant(Op1) &&
14869 (CC == ISD::SETEQ || CC == ISD::SETNE)) {
14871 ISD::CondCode NewCC = ISD::getSetCCInverse(CC, true);
14872 return DAG.getSetCC(dl, VT, Op0, DAG.getConstant(0, dl, MVT::i1), NewCC);
14875 bool isFP = Op1.getSimpleValueType().isFloatingPoint();
14876 unsigned X86CC = TranslateX86CC(CC, dl, isFP, Op0, Op1, DAG);
14877 if (X86CC == X86::COND_INVALID)
14880 SDValue EFLAGS = EmitCmp(Op0, Op1, X86CC, dl, DAG);
14881 EFLAGS = ConvertCmpIfNecessary(EFLAGS, DAG);
14882 SDValue SetCC = DAG.getNode(X86ISD::SETCC, dl, MVT::i8,
14883 DAG.getConstant(X86CC, dl, MVT::i8), EFLAGS);
14885 return DAG.getNode(ISD::TRUNCATE, dl, MVT::i1, SetCC);
14889 SDValue X86TargetLowering::LowerSETCCE(SDValue Op, SelectionDAG &DAG) const {
14890 SDValue LHS = Op.getOperand(0);
14891 SDValue RHS = Op.getOperand(1);
14892 SDValue Carry = Op.getOperand(2);
14893 SDValue Cond = Op.getOperand(3);
14896 assert(LHS.getSimpleValueType().isInteger() && "SETCCE is integer only.");
14897 X86::CondCode CC = TranslateIntegerX86CC(cast<CondCodeSDNode>(Cond)->get());
14899 assert(Carry.getOpcode() != ISD::CARRY_FALSE);
14900 SDVTList VTs = DAG.getVTList(LHS.getValueType(), MVT::i32);
14901 SDValue Cmp = DAG.getNode(X86ISD::SBB, DL, VTs, LHS, RHS, Carry);
14902 return DAG.getNode(X86ISD::SETCC, DL, Op.getValueType(),
14903 DAG.getConstant(CC, DL, MVT::i8), Cmp.getValue(1));
14906 // isX86LogicalCmp - Return true if opcode is a X86 logical comparison.
14907 static bool isX86LogicalCmp(SDValue Op) {
14908 unsigned Opc = Op.getNode()->getOpcode();
14909 if (Opc == X86ISD::CMP || Opc == X86ISD::COMI || Opc == X86ISD::UCOMI ||
14910 Opc == X86ISD::SAHF)
14912 if (Op.getResNo() == 1 &&
14913 (Opc == X86ISD::ADD ||
14914 Opc == X86ISD::SUB ||
14915 Opc == X86ISD::ADC ||
14916 Opc == X86ISD::SBB ||
14917 Opc == X86ISD::SMUL ||
14918 Opc == X86ISD::UMUL ||
14919 Opc == X86ISD::INC ||
14920 Opc == X86ISD::DEC ||
14921 Opc == X86ISD::OR ||
14922 Opc == X86ISD::XOR ||
14923 Opc == X86ISD::AND))
14926 if (Op.getResNo() == 2 && Opc == X86ISD::UMUL)
14932 static bool isTruncWithZeroHighBitsInput(SDValue V, SelectionDAG &DAG) {
14933 if (V.getOpcode() != ISD::TRUNCATE)
14936 SDValue VOp0 = V.getOperand(0);
14937 unsigned InBits = VOp0.getValueSizeInBits();
14938 unsigned Bits = V.getValueSizeInBits();
14939 return DAG.MaskedValueIsZero(VOp0, APInt::getHighBitsSet(InBits,InBits-Bits));
14942 SDValue X86TargetLowering::LowerSELECT(SDValue Op, SelectionDAG &DAG) const {
14943 bool addTest = true;
14944 SDValue Cond = Op.getOperand(0);
14945 SDValue Op1 = Op.getOperand(1);
14946 SDValue Op2 = Op.getOperand(2);
14948 MVT VT = Op1.getSimpleValueType();
14951 // Lower FP selects into a CMP/AND/ANDN/OR sequence when the necessary SSE ops
14952 // are available or VBLENDV if AVX is available.
14953 // Otherwise FP cmovs get lowered into a less efficient branch sequence later.
14954 if (Cond.getOpcode() == ISD::SETCC &&
14955 ((Subtarget->hasSSE2() && (VT == MVT::f32 || VT == MVT::f64)) ||
14956 (Subtarget->hasSSE1() && VT == MVT::f32)) &&
14957 VT == Cond.getOperand(0).getSimpleValueType() && Cond->hasOneUse()) {
14958 SDValue CondOp0 = Cond.getOperand(0), CondOp1 = Cond.getOperand(1);
14959 int SSECC = translateX86FSETCC(
14960 cast<CondCodeSDNode>(Cond.getOperand(2))->get(), CondOp0, CondOp1);
14963 if (Subtarget->hasAVX512()) {
14964 SDValue Cmp = DAG.getNode(X86ISD::FSETCC, DL, MVT::i1, CondOp0, CondOp1,
14965 DAG.getConstant(SSECC, DL, MVT::i8));
14966 return DAG.getNode(X86ISD::SELECT, DL, VT, Cmp, Op1, Op2);
14969 SDValue Cmp = DAG.getNode(X86ISD::FSETCC, DL, VT, CondOp0, CondOp1,
14970 DAG.getConstant(SSECC, DL, MVT::i8));
14972 // If we have AVX, we can use a variable vector select (VBLENDV) instead
14973 // of 3 logic instructions for size savings and potentially speed.
14974 // Unfortunately, there is no scalar form of VBLENDV.
14976 // If either operand is a constant, don't try this. We can expect to
14977 // optimize away at least one of the logic instructions later in that
14978 // case, so that sequence would be faster than a variable blend.
14980 // BLENDV was introduced with SSE 4.1, but the 2 register form implicitly
14981 // uses XMM0 as the selection register. That may need just as many
14982 // instructions as the AND/ANDN/OR sequence due to register moves, so
14985 if (Subtarget->hasAVX() &&
14986 !isa<ConstantFPSDNode>(Op1) && !isa<ConstantFPSDNode>(Op2)) {
14988 // Convert to vectors, do a VSELECT, and convert back to scalar.
14989 // All of the conversions should be optimized away.
14991 MVT VecVT = VT == MVT::f32 ? MVT::v4f32 : MVT::v2f64;
14992 SDValue VOp1 = DAG.getNode(ISD::SCALAR_TO_VECTOR, DL, VecVT, Op1);
14993 SDValue VOp2 = DAG.getNode(ISD::SCALAR_TO_VECTOR, DL, VecVT, Op2);
14994 SDValue VCmp = DAG.getNode(ISD::SCALAR_TO_VECTOR, DL, VecVT, Cmp);
14996 MVT VCmpVT = VT == MVT::f32 ? MVT::v4i32 : MVT::v2i64;
14997 VCmp = DAG.getBitcast(VCmpVT, VCmp);
14999 SDValue VSel = DAG.getNode(ISD::VSELECT, DL, VecVT, VCmp, VOp1, VOp2);
15001 return DAG.getNode(ISD::EXTRACT_VECTOR_ELT, DL, VT,
15002 VSel, DAG.getIntPtrConstant(0, DL));
15004 SDValue AndN = DAG.getNode(X86ISD::FANDN, DL, VT, Cmp, Op2);
15005 SDValue And = DAG.getNode(X86ISD::FAND, DL, VT, Cmp, Op1);
15006 return DAG.getNode(X86ISD::FOR, DL, VT, AndN, And);
15010 if (VT.isVector() && VT.getVectorElementType() == MVT::i1) {
15012 if (ISD::isBuildVectorOfConstantSDNodes(Op1.getNode()))
15013 Op1Scalar = ConvertI1VectorToInteger(Op1, DAG);
15014 else if (Op1.getOpcode() == ISD::BITCAST && Op1.getOperand(0))
15015 Op1Scalar = Op1.getOperand(0);
15017 if (ISD::isBuildVectorOfConstantSDNodes(Op2.getNode()))
15018 Op2Scalar = ConvertI1VectorToInteger(Op2, DAG);
15019 else if (Op2.getOpcode() == ISD::BITCAST && Op2.getOperand(0))
15020 Op2Scalar = Op2.getOperand(0);
15021 if (Op1Scalar.getNode() && Op2Scalar.getNode()) {
15022 SDValue newSelect = DAG.getNode(ISD::SELECT, DL,
15023 Op1Scalar.getValueType(),
15024 Cond, Op1Scalar, Op2Scalar);
15025 if (newSelect.getValueSizeInBits() == VT.getSizeInBits())
15026 return DAG.getBitcast(VT, newSelect);
15027 SDValue ExtVec = DAG.getBitcast(MVT::v8i1, newSelect);
15028 return DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, VT, ExtVec,
15029 DAG.getIntPtrConstant(0, DL));
15033 if (VT == MVT::v4i1 || VT == MVT::v2i1) {
15034 SDValue zeroConst = DAG.getIntPtrConstant(0, DL);
15035 Op1 = DAG.getNode(ISD::INSERT_SUBVECTOR, DL, MVT::v8i1,
15036 DAG.getUNDEF(MVT::v8i1), Op1, zeroConst);
15037 Op2 = DAG.getNode(ISD::INSERT_SUBVECTOR, DL, MVT::v8i1,
15038 DAG.getUNDEF(MVT::v8i1), Op2, zeroConst);
15039 SDValue newSelect = DAG.getNode(ISD::SELECT, DL, MVT::v8i1,
15041 return DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, VT, newSelect, zeroConst);
15044 if (Cond.getOpcode() == ISD::SETCC) {
15045 SDValue NewCond = LowerSETCC(Cond, DAG);
15046 if (NewCond.getNode())
15050 // (select (x == 0), -1, y) -> (sign_bit (x - 1)) | y
15051 // (select (x == 0), y, -1) -> ~(sign_bit (x - 1)) | y
15052 // (select (x != 0), y, -1) -> (sign_bit (x - 1)) | y
15053 // (select (x != 0), -1, y) -> ~(sign_bit (x - 1)) | y
15054 if (Cond.getOpcode() == X86ISD::SETCC &&
15055 Cond.getOperand(1).getOpcode() == X86ISD::CMP &&
15056 isNullConstant(Cond.getOperand(1).getOperand(1))) {
15057 SDValue Cmp = Cond.getOperand(1);
15059 unsigned CondCode =cast<ConstantSDNode>(Cond.getOperand(0))->getZExtValue();
15061 if ((isAllOnesConstant(Op1) || isAllOnesConstant(Op2)) &&
15062 (CondCode == X86::COND_E || CondCode == X86::COND_NE)) {
15063 SDValue Y = isAllOnesConstant(Op2) ? Op1 : Op2;
15065 SDValue CmpOp0 = Cmp.getOperand(0);
15066 // Apply further optimizations for special cases
15067 // (select (x != 0), -1, 0) -> neg & sbb
15068 // (select (x == 0), 0, -1) -> neg & sbb
15069 if (isNullConstant(Y) &&
15070 (isAllOnesConstant(Op1) == (CondCode == X86::COND_NE))) {
15071 SDVTList VTs = DAG.getVTList(CmpOp0.getValueType(), MVT::i32);
15072 SDValue Neg = DAG.getNode(X86ISD::SUB, DL, VTs,
15073 DAG.getConstant(0, DL,
15074 CmpOp0.getValueType()),
15076 SDValue Res = DAG.getNode(X86ISD::SETCC_CARRY, DL, Op.getValueType(),
15077 DAG.getConstant(X86::COND_B, DL, MVT::i8),
15078 SDValue(Neg.getNode(), 1));
15082 Cmp = DAG.getNode(X86ISD::CMP, DL, MVT::i32,
15083 CmpOp0, DAG.getConstant(1, DL, CmpOp0.getValueType()));
15084 Cmp = ConvertCmpIfNecessary(Cmp, DAG);
15086 SDValue Res = // Res = 0 or -1.
15087 DAG.getNode(X86ISD::SETCC_CARRY, DL, Op.getValueType(),
15088 DAG.getConstant(X86::COND_B, DL, MVT::i8), Cmp);
15090 if (isAllOnesConstant(Op1) != (CondCode == X86::COND_E))
15091 Res = DAG.getNOT(DL, Res, Res.getValueType());
15093 if (!isNullConstant(Op2))
15094 Res = DAG.getNode(ISD::OR, DL, Res.getValueType(), Res, Y);
15099 // Look past (and (setcc_carry (cmp ...)), 1).
15100 if (Cond.getOpcode() == ISD::AND &&
15101 Cond.getOperand(0).getOpcode() == X86ISD::SETCC_CARRY &&
15102 isOneConstant(Cond.getOperand(1)))
15103 Cond = Cond.getOperand(0);
15105 // If condition flag is set by a X86ISD::CMP, then use it as the condition
15106 // setting operand in place of the X86ISD::SETCC.
15107 unsigned CondOpcode = Cond.getOpcode();
15108 if (CondOpcode == X86ISD::SETCC ||
15109 CondOpcode == X86ISD::SETCC_CARRY) {
15110 CC = Cond.getOperand(0);
15112 SDValue Cmp = Cond.getOperand(1);
15113 unsigned Opc = Cmp.getOpcode();
15114 MVT VT = Op.getSimpleValueType();
15116 bool IllegalFPCMov = false;
15117 if (VT.isFloatingPoint() && !VT.isVector() &&
15118 !isScalarFPTypeInSSEReg(VT)) // FPStack?
15119 IllegalFPCMov = !hasFPCMov(cast<ConstantSDNode>(CC)->getSExtValue());
15121 if ((isX86LogicalCmp(Cmp) && !IllegalFPCMov) ||
15122 Opc == X86ISD::BT) { // FIXME
15126 } else if (CondOpcode == ISD::USUBO || CondOpcode == ISD::SSUBO ||
15127 CondOpcode == ISD::UADDO || CondOpcode == ISD::SADDO ||
15128 ((CondOpcode == ISD::UMULO || CondOpcode == ISD::SMULO) &&
15129 Cond.getOperand(0).getValueType() != MVT::i8)) {
15130 SDValue LHS = Cond.getOperand(0);
15131 SDValue RHS = Cond.getOperand(1);
15132 unsigned X86Opcode;
15135 switch (CondOpcode) {
15136 case ISD::UADDO: X86Opcode = X86ISD::ADD; X86Cond = X86::COND_B; break;
15137 case ISD::SADDO: X86Opcode = X86ISD::ADD; X86Cond = X86::COND_O; break;
15138 case ISD::USUBO: X86Opcode = X86ISD::SUB; X86Cond = X86::COND_B; break;
15139 case ISD::SSUBO: X86Opcode = X86ISD::SUB; X86Cond = X86::COND_O; break;
15140 case ISD::UMULO: X86Opcode = X86ISD::UMUL; X86Cond = X86::COND_O; break;
15141 case ISD::SMULO: X86Opcode = X86ISD::SMUL; X86Cond = X86::COND_O; break;
15142 default: llvm_unreachable("unexpected overflowing operator");
15144 if (CondOpcode == ISD::UMULO)
15145 VTs = DAG.getVTList(LHS.getValueType(), LHS.getValueType(),
15148 VTs = DAG.getVTList(LHS.getValueType(), MVT::i32);
15150 SDValue X86Op = DAG.getNode(X86Opcode, DL, VTs, LHS, RHS);
15152 if (CondOpcode == ISD::UMULO)
15153 Cond = X86Op.getValue(2);
15155 Cond = X86Op.getValue(1);
15157 CC = DAG.getConstant(X86Cond, DL, MVT::i8);
15162 // Look past the truncate if the high bits are known zero.
15163 if (isTruncWithZeroHighBitsInput(Cond, DAG))
15164 Cond = Cond.getOperand(0);
15166 // We know the result of AND is compared against zero. Try to match
15168 if (Cond.getOpcode() == ISD::AND && Cond.hasOneUse()) {
15169 if (SDValue NewSetCC = LowerToBT(Cond, ISD::SETNE, DL, DAG)) {
15170 CC = NewSetCC.getOperand(0);
15171 Cond = NewSetCC.getOperand(1);
15178 CC = DAG.getConstant(X86::COND_NE, DL, MVT::i8);
15179 Cond = EmitTest(Cond, X86::COND_NE, DL, DAG);
15182 // a < b ? -1 : 0 -> RES = ~setcc_carry
15183 // a < b ? 0 : -1 -> RES = setcc_carry
15184 // a >= b ? -1 : 0 -> RES = setcc_carry
15185 // a >= b ? 0 : -1 -> RES = ~setcc_carry
15186 if (Cond.getOpcode() == X86ISD::SUB) {
15187 Cond = ConvertCmpIfNecessary(Cond, DAG);
15188 unsigned CondCode = cast<ConstantSDNode>(CC)->getZExtValue();
15190 if ((CondCode == X86::COND_AE || CondCode == X86::COND_B) &&
15191 (isAllOnesConstant(Op1) || isAllOnesConstant(Op2)) &&
15192 (isNullConstant(Op1) || isNullConstant(Op2))) {
15193 SDValue Res = DAG.getNode(X86ISD::SETCC_CARRY, DL, Op.getValueType(),
15194 DAG.getConstant(X86::COND_B, DL, MVT::i8),
15196 if (isAllOnesConstant(Op1) != (CondCode == X86::COND_B))
15197 return DAG.getNOT(DL, Res, Res.getValueType());
15202 // X86 doesn't have an i8 cmov. If both operands are the result of a truncate
15203 // widen the cmov and push the truncate through. This avoids introducing a new
15204 // branch during isel and doesn't add any extensions.
15205 if (Op.getValueType() == MVT::i8 &&
15206 Op1.getOpcode() == ISD::TRUNCATE && Op2.getOpcode() == ISD::TRUNCATE) {
15207 SDValue T1 = Op1.getOperand(0), T2 = Op2.getOperand(0);
15208 if (T1.getValueType() == T2.getValueType() &&
15209 // Blacklist CopyFromReg to avoid partial register stalls.
15210 T1.getOpcode() != ISD::CopyFromReg && T2.getOpcode()!=ISD::CopyFromReg){
15211 SDVTList VTs = DAG.getVTList(T1.getValueType(), MVT::Glue);
15212 SDValue Cmov = DAG.getNode(X86ISD::CMOV, DL, VTs, T2, T1, CC, Cond);
15213 return DAG.getNode(ISD::TRUNCATE, DL, Op.getValueType(), Cmov);
15217 // X86ISD::CMOV means set the result (which is operand 1) to the RHS if
15218 // condition is true.
15219 SDVTList VTs = DAG.getVTList(Op.getValueType(), MVT::Glue);
15220 SDValue Ops[] = { Op2, Op1, CC, Cond };
15221 return DAG.getNode(X86ISD::CMOV, DL, VTs, Ops);
15224 static SDValue LowerSIGN_EXTEND_AVX512(SDValue Op,
15225 const X86Subtarget *Subtarget,
15226 SelectionDAG &DAG) {
15227 MVT VT = Op->getSimpleValueType(0);
15228 SDValue In = Op->getOperand(0);
15229 MVT InVT = In.getSimpleValueType();
15230 MVT VTElt = VT.getVectorElementType();
15231 MVT InVTElt = InVT.getVectorElementType();
15235 if ((InVTElt == MVT::i1) &&
15236 (((Subtarget->hasBWI() && Subtarget->hasVLX() &&
15237 VT.getSizeInBits() <= 256 && VTElt.getSizeInBits() <= 16)) ||
15239 ((Subtarget->hasBWI() && VT.is512BitVector() &&
15240 VTElt.getSizeInBits() <= 16)) ||
15242 ((Subtarget->hasDQI() && Subtarget->hasVLX() &&
15243 VT.getSizeInBits() <= 256 && VTElt.getSizeInBits() >= 32)) ||
15245 ((Subtarget->hasDQI() && VT.is512BitVector() &&
15246 VTElt.getSizeInBits() >= 32))))
15247 return DAG.getNode(X86ISD::VSEXT, dl, VT, In);
15249 unsigned int NumElts = VT.getVectorNumElements();
15251 if (NumElts != 8 && NumElts != 16 && !Subtarget->hasBWI())
15254 if (VT.is512BitVector() && InVT.getVectorElementType() != MVT::i1) {
15255 if (In.getOpcode() == X86ISD::VSEXT || In.getOpcode() == X86ISD::VZEXT)
15256 return DAG.getNode(In.getOpcode(), dl, VT, In.getOperand(0));
15257 return DAG.getNode(X86ISD::VSEXT, dl, VT, In);
15260 assert (InVT.getVectorElementType() == MVT::i1 && "Unexpected vector type");
15261 MVT ExtVT = NumElts == 8 ? MVT::v8i64 : MVT::v16i32;
15263 DAG.getConstant(APInt::getAllOnesValue(ExtVT.getScalarSizeInBits()), dl,
15266 DAG.getConstant(APInt::getNullValue(ExtVT.getScalarSizeInBits()), dl, ExtVT);
15268 SDValue V = DAG.getNode(ISD::VSELECT, dl, ExtVT, In, NegOne, Zero);
15269 if (VT.is512BitVector())
15271 return DAG.getNode(X86ISD::VTRUNC, dl, VT, V);
15274 static SDValue LowerSIGN_EXTEND_VECTOR_INREG(SDValue Op,
15275 const X86Subtarget *Subtarget,
15276 SelectionDAG &DAG) {
15277 SDValue In = Op->getOperand(0);
15278 MVT VT = Op->getSimpleValueType(0);
15279 MVT InVT = In.getSimpleValueType();
15280 assert(VT.getSizeInBits() == InVT.getSizeInBits());
15282 MVT InSVT = InVT.getVectorElementType();
15283 assert(VT.getVectorElementType().getSizeInBits() > InSVT.getSizeInBits());
15285 if (VT != MVT::v2i64 && VT != MVT::v4i32 && VT != MVT::v8i16)
15287 if (InSVT != MVT::i32 && InSVT != MVT::i16 && InSVT != MVT::i8)
15292 // SSE41 targets can use the pmovsx* instructions directly.
15293 if (Subtarget->hasSSE41())
15294 return DAG.getNode(X86ISD::VSEXT, dl, VT, In);
15296 // pre-SSE41 targets unpack lower lanes and then sign-extend using SRAI.
15300 // As SRAI is only available on i16/i32 types, we expand only up to i32
15301 // and handle i64 separately.
15302 while (CurrVT != VT && CurrVT.getVectorElementType() != MVT::i32) {
15303 Curr = DAG.getNode(X86ISD::UNPCKL, dl, CurrVT, DAG.getUNDEF(CurrVT), Curr);
15304 MVT CurrSVT = MVT::getIntegerVT(CurrVT.getScalarSizeInBits() * 2);
15305 CurrVT = MVT::getVectorVT(CurrSVT, CurrVT.getVectorNumElements() / 2);
15306 Curr = DAG.getBitcast(CurrVT, Curr);
15309 SDValue SignExt = Curr;
15310 if (CurrVT != InVT) {
15311 unsigned SignExtShift =
15312 CurrVT.getVectorElementType().getSizeInBits() - InSVT.getSizeInBits();
15313 SignExt = DAG.getNode(X86ISD::VSRAI, dl, CurrVT, Curr,
15314 DAG.getConstant(SignExtShift, dl, MVT::i8));
15320 if (VT == MVT::v2i64 && CurrVT == MVT::v4i32) {
15321 SDValue Sign = DAG.getNode(X86ISD::VSRAI, dl, CurrVT, Curr,
15322 DAG.getConstant(31, dl, MVT::i8));
15323 SDValue Ext = DAG.getVectorShuffle(CurrVT, dl, SignExt, Sign, {0, 4, 1, 5});
15324 return DAG.getBitcast(VT, Ext);
15330 static SDValue LowerSIGN_EXTEND(SDValue Op, const X86Subtarget *Subtarget,
15331 SelectionDAG &DAG) {
15332 MVT VT = Op->getSimpleValueType(0);
15333 SDValue In = Op->getOperand(0);
15334 MVT InVT = In.getSimpleValueType();
15337 if (VT.is512BitVector() || InVT.getVectorElementType() == MVT::i1)
15338 return LowerSIGN_EXTEND_AVX512(Op, Subtarget, DAG);
15340 if ((VT != MVT::v4i64 || InVT != MVT::v4i32) &&
15341 (VT != MVT::v8i32 || InVT != MVT::v8i16) &&
15342 (VT != MVT::v16i16 || InVT != MVT::v16i8))
15345 if (Subtarget->hasInt256())
15346 return DAG.getNode(X86ISD::VSEXT, dl, VT, In);
15348 // Optimize vectors in AVX mode
15349 // Sign extend v8i16 to v8i32 and
15352 // Divide input vector into two parts
15353 // for v4i32 the shuffle mask will be { 0, 1, -1, -1} {2, 3, -1, -1}
15354 // use vpmovsx instruction to extend v4i32 -> v2i64; v8i16 -> v4i32
15355 // concat the vectors to original VT
15357 unsigned NumElems = InVT.getVectorNumElements();
15358 SDValue Undef = DAG.getUNDEF(InVT);
15360 SmallVector<int,8> ShufMask1(NumElems, -1);
15361 for (unsigned i = 0; i != NumElems/2; ++i)
15364 SDValue OpLo = DAG.getVectorShuffle(InVT, dl, In, Undef, &ShufMask1[0]);
15366 SmallVector<int,8> ShufMask2(NumElems, -1);
15367 for (unsigned i = 0; i != NumElems/2; ++i)
15368 ShufMask2[i] = i + NumElems/2;
15370 SDValue OpHi = DAG.getVectorShuffle(InVT, dl, In, Undef, &ShufMask2[0]);
15372 MVT HalfVT = MVT::getVectorVT(VT.getVectorElementType(),
15373 VT.getVectorNumElements()/2);
15375 OpLo = DAG.getNode(X86ISD::VSEXT, dl, HalfVT, OpLo);
15376 OpHi = DAG.getNode(X86ISD::VSEXT, dl, HalfVT, OpHi);
15378 return DAG.getNode(ISD::CONCAT_VECTORS, dl, VT, OpLo, OpHi);
15381 // Lower vector extended loads using a shuffle. If SSSE3 is not available we
15382 // may emit an illegal shuffle but the expansion is still better than scalar
15383 // code. We generate X86ISD::VSEXT for SEXTLOADs if it's available, otherwise
15384 // we'll emit a shuffle and a arithmetic shift.
15385 // FIXME: Is the expansion actually better than scalar code? It doesn't seem so.
15386 // TODO: It is possible to support ZExt by zeroing the undef values during
15387 // the shuffle phase or after the shuffle.
15388 static SDValue LowerExtendedLoad(SDValue Op, const X86Subtarget *Subtarget,
15389 SelectionDAG &DAG) {
15390 MVT RegVT = Op.getSimpleValueType();
15391 assert(RegVT.isVector() && "We only custom lower vector sext loads.");
15392 assert(RegVT.isInteger() &&
15393 "We only custom lower integer vector sext loads.");
15395 // Nothing useful we can do without SSE2 shuffles.
15396 assert(Subtarget->hasSSE2() && "We only custom lower sext loads with SSE2.");
15398 LoadSDNode *Ld = cast<LoadSDNode>(Op.getNode());
15400 EVT MemVT = Ld->getMemoryVT();
15401 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
15402 unsigned RegSz = RegVT.getSizeInBits();
15404 ISD::LoadExtType Ext = Ld->getExtensionType();
15406 assert((Ext == ISD::EXTLOAD || Ext == ISD::SEXTLOAD)
15407 && "Only anyext and sext are currently implemented.");
15408 assert(MemVT != RegVT && "Cannot extend to the same type");
15409 assert(MemVT.isVector() && "Must load a vector from memory");
15411 unsigned NumElems = RegVT.getVectorNumElements();
15412 unsigned MemSz = MemVT.getSizeInBits();
15413 assert(RegSz > MemSz && "Register size must be greater than the mem size");
15415 if (Ext == ISD::SEXTLOAD && RegSz == 256 && !Subtarget->hasInt256()) {
15416 // The only way in which we have a legal 256-bit vector result but not the
15417 // integer 256-bit operations needed to directly lower a sextload is if we
15418 // have AVX1 but not AVX2. In that case, we can always emit a sextload to
15419 // a 128-bit vector and a normal sign_extend to 256-bits that should get
15420 // correctly legalized. We do this late to allow the canonical form of
15421 // sextload to persist throughout the rest of the DAG combiner -- it wants
15422 // to fold together any extensions it can, and so will fuse a sign_extend
15423 // of an sextload into a sextload targeting a wider value.
15425 if (MemSz == 128) {
15426 // Just switch this to a normal load.
15427 assert(TLI.isTypeLegal(MemVT) && "If the memory type is a 128-bit type, "
15428 "it must be a legal 128-bit vector "
15430 Load = DAG.getLoad(MemVT, dl, Ld->getChain(), Ld->getBasePtr(),
15431 Ld->getPointerInfo(), Ld->isVolatile(), Ld->isNonTemporal(),
15432 Ld->isInvariant(), Ld->getAlignment());
15434 assert(MemSz < 128 &&
15435 "Can't extend a type wider than 128 bits to a 256 bit vector!");
15436 // Do an sext load to a 128-bit vector type. We want to use the same
15437 // number of elements, but elements half as wide. This will end up being
15438 // recursively lowered by this routine, but will succeed as we definitely
15439 // have all the necessary features if we're using AVX1.
15441 EVT::getIntegerVT(*DAG.getContext(), RegVT.getScalarSizeInBits() / 2);
15442 EVT HalfVecVT = EVT::getVectorVT(*DAG.getContext(), HalfEltVT, NumElems);
15444 DAG.getExtLoad(Ext, dl, HalfVecVT, Ld->getChain(), Ld->getBasePtr(),
15445 Ld->getPointerInfo(), MemVT, Ld->isVolatile(),
15446 Ld->isNonTemporal(), Ld->isInvariant(),
15447 Ld->getAlignment());
15450 // Replace chain users with the new chain.
15451 assert(Load->getNumValues() == 2 && "Loads must carry a chain!");
15452 DAG.ReplaceAllUsesOfValueWith(SDValue(Ld, 1), Load.getValue(1));
15454 // Finally, do a normal sign-extend to the desired register.
15455 return DAG.getSExtOrTrunc(Load, dl, RegVT);
15458 // All sizes must be a power of two.
15459 assert(isPowerOf2_32(RegSz * MemSz * NumElems) &&
15460 "Non-power-of-two elements are not custom lowered!");
15462 // Attempt to load the original value using scalar loads.
15463 // Find the largest scalar type that divides the total loaded size.
15464 MVT SclrLoadTy = MVT::i8;
15465 for (MVT Tp : MVT::integer_valuetypes()) {
15466 if (TLI.isTypeLegal(Tp) && ((MemSz % Tp.getSizeInBits()) == 0)) {
15471 // On 32bit systems, we can't save 64bit integers. Try bitcasting to F64.
15472 if (TLI.isTypeLegal(MVT::f64) && SclrLoadTy.getSizeInBits() < 64 &&
15474 SclrLoadTy = MVT::f64;
15476 // Calculate the number of scalar loads that we need to perform
15477 // in order to load our vector from memory.
15478 unsigned NumLoads = MemSz / SclrLoadTy.getSizeInBits();
15480 assert((Ext != ISD::SEXTLOAD || NumLoads == 1) &&
15481 "Can only lower sext loads with a single scalar load!");
15483 unsigned loadRegZize = RegSz;
15484 if (Ext == ISD::SEXTLOAD && RegSz >= 256)
15487 // Represent our vector as a sequence of elements which are the
15488 // largest scalar that we can load.
15489 EVT LoadUnitVecVT = EVT::getVectorVT(
15490 *DAG.getContext(), SclrLoadTy, loadRegZize / SclrLoadTy.getSizeInBits());
15492 // Represent the data using the same element type that is stored in
15493 // memory. In practice, we ''widen'' MemVT.
15495 EVT::getVectorVT(*DAG.getContext(), MemVT.getScalarType(),
15496 loadRegZize / MemVT.getScalarSizeInBits());
15498 assert(WideVecVT.getSizeInBits() == LoadUnitVecVT.getSizeInBits() &&
15499 "Invalid vector type");
15501 // We can't shuffle using an illegal type.
15502 assert(TLI.isTypeLegal(WideVecVT) &&
15503 "We only lower types that form legal widened vector types");
15505 SmallVector<SDValue, 8> Chains;
15506 SDValue Ptr = Ld->getBasePtr();
15507 SDValue Increment = DAG.getConstant(SclrLoadTy.getSizeInBits() / 8, dl,
15508 TLI.getPointerTy(DAG.getDataLayout()));
15509 SDValue Res = DAG.getUNDEF(LoadUnitVecVT);
15511 for (unsigned i = 0; i < NumLoads; ++i) {
15512 // Perform a single load.
15513 SDValue ScalarLoad =
15514 DAG.getLoad(SclrLoadTy, dl, Ld->getChain(), Ptr, Ld->getPointerInfo(),
15515 Ld->isVolatile(), Ld->isNonTemporal(), Ld->isInvariant(),
15516 Ld->getAlignment());
15517 Chains.push_back(ScalarLoad.getValue(1));
15518 // Create the first element type using SCALAR_TO_VECTOR in order to avoid
15519 // another round of DAGCombining.
15521 Res = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, LoadUnitVecVT, ScalarLoad);
15523 Res = DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, LoadUnitVecVT, Res,
15524 ScalarLoad, DAG.getIntPtrConstant(i, dl));
15526 Ptr = DAG.getNode(ISD::ADD, dl, Ptr.getValueType(), Ptr, Increment);
15529 SDValue TF = DAG.getNode(ISD::TokenFactor, dl, MVT::Other, Chains);
15531 // Bitcast the loaded value to a vector of the original element type, in
15532 // the size of the target vector type.
15533 SDValue SlicedVec = DAG.getBitcast(WideVecVT, Res);
15534 unsigned SizeRatio = RegSz / MemSz;
15536 if (Ext == ISD::SEXTLOAD) {
15537 // If we have SSE4.1, we can directly emit a VSEXT node.
15538 if (Subtarget->hasSSE41()) {
15539 SDValue Sext = DAG.getNode(X86ISD::VSEXT, dl, RegVT, SlicedVec);
15540 DAG.ReplaceAllUsesOfValueWith(SDValue(Ld, 1), TF);
15544 // Otherwise we'll use SIGN_EXTEND_VECTOR_INREG to sign extend the lowest
15546 assert(TLI.isOperationLegalOrCustom(ISD::SIGN_EXTEND_VECTOR_INREG, RegVT) &&
15547 "We can't implement a sext load without SIGN_EXTEND_VECTOR_INREG!");
15549 SDValue Shuff = DAG.getSignExtendVectorInReg(SlicedVec, dl, RegVT);
15550 DAG.ReplaceAllUsesOfValueWith(SDValue(Ld, 1), TF);
15554 // Redistribute the loaded elements into the different locations.
15555 SmallVector<int, 16> ShuffleVec(NumElems * SizeRatio, -1);
15556 for (unsigned i = 0; i != NumElems; ++i)
15557 ShuffleVec[i * SizeRatio] = i;
15559 SDValue Shuff = DAG.getVectorShuffle(WideVecVT, dl, SlicedVec,
15560 DAG.getUNDEF(WideVecVT), &ShuffleVec[0]);
15562 // Bitcast to the requested type.
15563 Shuff = DAG.getBitcast(RegVT, Shuff);
15564 DAG.ReplaceAllUsesOfValueWith(SDValue(Ld, 1), TF);
15568 // isAndOrOfSingleUseSetCCs - Return true if node is an ISD::AND or
15569 // ISD::OR of two X86ISD::SETCC nodes each of which has no other use apart
15570 // from the AND / OR.
15571 static bool isAndOrOfSetCCs(SDValue Op, unsigned &Opc) {
15572 Opc = Op.getOpcode();
15573 if (Opc != ISD::OR && Opc != ISD::AND)
15575 return (Op.getOperand(0).getOpcode() == X86ISD::SETCC &&
15576 Op.getOperand(0).hasOneUse() &&
15577 Op.getOperand(1).getOpcode() == X86ISD::SETCC &&
15578 Op.getOperand(1).hasOneUse());
15581 // isXor1OfSetCC - Return true if node is an ISD::XOR of a X86ISD::SETCC and
15582 // 1 and that the SETCC node has a single use.
15583 static bool isXor1OfSetCC(SDValue Op) {
15584 if (Op.getOpcode() != ISD::XOR)
15586 if (isOneConstant(Op.getOperand(1)))
15587 return Op.getOperand(0).getOpcode() == X86ISD::SETCC &&
15588 Op.getOperand(0).hasOneUse();
15592 SDValue X86TargetLowering::LowerBRCOND(SDValue Op, SelectionDAG &DAG) const {
15593 bool addTest = true;
15594 SDValue Chain = Op.getOperand(0);
15595 SDValue Cond = Op.getOperand(1);
15596 SDValue Dest = Op.getOperand(2);
15599 bool Inverted = false;
15601 if (Cond.getOpcode() == ISD::SETCC) {
15602 // Check for setcc([su]{add,sub,mul}o == 0).
15603 if (cast<CondCodeSDNode>(Cond.getOperand(2))->get() == ISD::SETEQ &&
15604 isNullConstant(Cond.getOperand(1)) &&
15605 Cond.getOperand(0).getResNo() == 1 &&
15606 (Cond.getOperand(0).getOpcode() == ISD::SADDO ||
15607 Cond.getOperand(0).getOpcode() == ISD::UADDO ||
15608 Cond.getOperand(0).getOpcode() == ISD::SSUBO ||
15609 Cond.getOperand(0).getOpcode() == ISD::USUBO ||
15610 Cond.getOperand(0).getOpcode() == ISD::SMULO ||
15611 Cond.getOperand(0).getOpcode() == ISD::UMULO)) {
15613 Cond = Cond.getOperand(0);
15615 SDValue NewCond = LowerSETCC(Cond, DAG);
15616 if (NewCond.getNode())
15621 // FIXME: LowerXALUO doesn't handle these!!
15622 else if (Cond.getOpcode() == X86ISD::ADD ||
15623 Cond.getOpcode() == X86ISD::SUB ||
15624 Cond.getOpcode() == X86ISD::SMUL ||
15625 Cond.getOpcode() == X86ISD::UMUL)
15626 Cond = LowerXALUO(Cond, DAG);
15629 // Look pass (and (setcc_carry (cmp ...)), 1).
15630 if (Cond.getOpcode() == ISD::AND &&
15631 Cond.getOperand(0).getOpcode() == X86ISD::SETCC_CARRY &&
15632 isOneConstant(Cond.getOperand(1)))
15633 Cond = Cond.getOperand(0);
15635 // If condition flag is set by a X86ISD::CMP, then use it as the condition
15636 // setting operand in place of the X86ISD::SETCC.
15637 unsigned CondOpcode = Cond.getOpcode();
15638 if (CondOpcode == X86ISD::SETCC ||
15639 CondOpcode == X86ISD::SETCC_CARRY) {
15640 CC = Cond.getOperand(0);
15642 SDValue Cmp = Cond.getOperand(1);
15643 unsigned Opc = Cmp.getOpcode();
15644 // FIXME: WHY THE SPECIAL CASING OF LogicalCmp??
15645 if (isX86LogicalCmp(Cmp) || Opc == X86ISD::BT) {
15649 switch (cast<ConstantSDNode>(CC)->getZExtValue()) {
15653 // These can only come from an arithmetic instruction with overflow,
15654 // e.g. SADDO, UADDO.
15655 Cond = Cond.getNode()->getOperand(1);
15661 CondOpcode = Cond.getOpcode();
15662 if (CondOpcode == ISD::UADDO || CondOpcode == ISD::SADDO ||
15663 CondOpcode == ISD::USUBO || CondOpcode == ISD::SSUBO ||
15664 ((CondOpcode == ISD::UMULO || CondOpcode == ISD::SMULO) &&
15665 Cond.getOperand(0).getValueType() != MVT::i8)) {
15666 SDValue LHS = Cond.getOperand(0);
15667 SDValue RHS = Cond.getOperand(1);
15668 unsigned X86Opcode;
15671 // Keep this in sync with LowerXALUO, otherwise we might create redundant
15672 // instructions that can't be removed afterwards (i.e. X86ISD::ADD and
15674 switch (CondOpcode) {
15675 case ISD::UADDO: X86Opcode = X86ISD::ADD; X86Cond = X86::COND_B; break;
15677 if (isOneConstant(RHS)) {
15678 X86Opcode = X86ISD::INC; X86Cond = X86::COND_O;
15681 X86Opcode = X86ISD::ADD; X86Cond = X86::COND_O; break;
15682 case ISD::USUBO: X86Opcode = X86ISD::SUB; X86Cond = X86::COND_B; break;
15684 if (isOneConstant(RHS)) {
15685 X86Opcode = X86ISD::DEC; X86Cond = X86::COND_O;
15688 X86Opcode = X86ISD::SUB; X86Cond = X86::COND_O; break;
15689 case ISD::UMULO: X86Opcode = X86ISD::UMUL; X86Cond = X86::COND_O; break;
15690 case ISD::SMULO: X86Opcode = X86ISD::SMUL; X86Cond = X86::COND_O; break;
15691 default: llvm_unreachable("unexpected overflowing operator");
15694 X86Cond = X86::GetOppositeBranchCondition((X86::CondCode)X86Cond);
15695 if (CondOpcode == ISD::UMULO)
15696 VTs = DAG.getVTList(LHS.getValueType(), LHS.getValueType(),
15699 VTs = DAG.getVTList(LHS.getValueType(), MVT::i32);
15701 SDValue X86Op = DAG.getNode(X86Opcode, dl, VTs, LHS, RHS);
15703 if (CondOpcode == ISD::UMULO)
15704 Cond = X86Op.getValue(2);
15706 Cond = X86Op.getValue(1);
15708 CC = DAG.getConstant(X86Cond, dl, MVT::i8);
15712 if (Cond.hasOneUse() && isAndOrOfSetCCs(Cond, CondOpc)) {
15713 SDValue Cmp = Cond.getOperand(0).getOperand(1);
15714 if (CondOpc == ISD::OR) {
15715 // Also, recognize the pattern generated by an FCMP_UNE. We can emit
15716 // two branches instead of an explicit OR instruction with a
15718 if (Cmp == Cond.getOperand(1).getOperand(1) &&
15719 isX86LogicalCmp(Cmp)) {
15720 CC = Cond.getOperand(0).getOperand(0);
15721 Chain = DAG.getNode(X86ISD::BRCOND, dl, Op.getValueType(),
15722 Chain, Dest, CC, Cmp);
15723 CC = Cond.getOperand(1).getOperand(0);
15727 } else { // ISD::AND
15728 // Also, recognize the pattern generated by an FCMP_OEQ. We can emit
15729 // two branches instead of an explicit AND instruction with a
15730 // separate test. However, we only do this if this block doesn't
15731 // have a fall-through edge, because this requires an explicit
15732 // jmp when the condition is false.
15733 if (Cmp == Cond.getOperand(1).getOperand(1) &&
15734 isX86LogicalCmp(Cmp) &&
15735 Op.getNode()->hasOneUse()) {
15736 X86::CondCode CCode =
15737 (X86::CondCode)Cond.getOperand(0).getConstantOperandVal(0);
15738 CCode = X86::GetOppositeBranchCondition(CCode);
15739 CC = DAG.getConstant(CCode, dl, MVT::i8);
15740 SDNode *User = *Op.getNode()->use_begin();
15741 // Look for an unconditional branch following this conditional branch.
15742 // We need this because we need to reverse the successors in order
15743 // to implement FCMP_OEQ.
15744 if (User->getOpcode() == ISD::BR) {
15745 SDValue FalseBB = User->getOperand(1);
15747 DAG.UpdateNodeOperands(User, User->getOperand(0), Dest);
15748 assert(NewBR == User);
15752 Chain = DAG.getNode(X86ISD::BRCOND, dl, Op.getValueType(),
15753 Chain, Dest, CC, Cmp);
15754 X86::CondCode CCode =
15755 (X86::CondCode)Cond.getOperand(1).getConstantOperandVal(0);
15756 CCode = X86::GetOppositeBranchCondition(CCode);
15757 CC = DAG.getConstant(CCode, dl, MVT::i8);
15763 } else if (Cond.hasOneUse() && isXor1OfSetCC(Cond)) {
15764 // Recognize for xorb (setcc), 1 patterns. The xor inverts the condition.
15765 // It should be transformed during dag combiner except when the condition
15766 // is set by a arithmetics with overflow node.
15767 X86::CondCode CCode =
15768 (X86::CondCode)Cond.getOperand(0).getConstantOperandVal(0);
15769 CCode = X86::GetOppositeBranchCondition(CCode);
15770 CC = DAG.getConstant(CCode, dl, MVT::i8);
15771 Cond = Cond.getOperand(0).getOperand(1);
15773 } else if (Cond.getOpcode() == ISD::SETCC &&
15774 cast<CondCodeSDNode>(Cond.getOperand(2))->get() == ISD::SETOEQ) {
15775 // For FCMP_OEQ, we can emit
15776 // two branches instead of an explicit AND instruction with a
15777 // separate test. However, we only do this if this block doesn't
15778 // have a fall-through edge, because this requires an explicit
15779 // jmp when the condition is false.
15780 if (Op.getNode()->hasOneUse()) {
15781 SDNode *User = *Op.getNode()->use_begin();
15782 // Look for an unconditional branch following this conditional branch.
15783 // We need this because we need to reverse the successors in order
15784 // to implement FCMP_OEQ.
15785 if (User->getOpcode() == ISD::BR) {
15786 SDValue FalseBB = User->getOperand(1);
15788 DAG.UpdateNodeOperands(User, User->getOperand(0), Dest);
15789 assert(NewBR == User);
15793 SDValue Cmp = DAG.getNode(X86ISD::CMP, dl, MVT::i32,
15794 Cond.getOperand(0), Cond.getOperand(1));
15795 Cmp = ConvertCmpIfNecessary(Cmp, DAG);
15796 CC = DAG.getConstant(X86::COND_NE, dl, MVT::i8);
15797 Chain = DAG.getNode(X86ISD::BRCOND, dl, Op.getValueType(),
15798 Chain, Dest, CC, Cmp);
15799 CC = DAG.getConstant(X86::COND_P, dl, MVT::i8);
15804 } else if (Cond.getOpcode() == ISD::SETCC &&
15805 cast<CondCodeSDNode>(Cond.getOperand(2))->get() == ISD::SETUNE) {
15806 // For FCMP_UNE, we can emit
15807 // two branches instead of an explicit AND instruction with a
15808 // separate test. However, we only do this if this block doesn't
15809 // have a fall-through edge, because this requires an explicit
15810 // jmp when the condition is false.
15811 if (Op.getNode()->hasOneUse()) {
15812 SDNode *User = *Op.getNode()->use_begin();
15813 // Look for an unconditional branch following this conditional branch.
15814 // We need this because we need to reverse the successors in order
15815 // to implement FCMP_UNE.
15816 if (User->getOpcode() == ISD::BR) {
15817 SDValue FalseBB = User->getOperand(1);
15819 DAG.UpdateNodeOperands(User, User->getOperand(0), Dest);
15820 assert(NewBR == User);
15823 SDValue Cmp = DAG.getNode(X86ISD::CMP, dl, MVT::i32,
15824 Cond.getOperand(0), Cond.getOperand(1));
15825 Cmp = ConvertCmpIfNecessary(Cmp, DAG);
15826 CC = DAG.getConstant(X86::COND_NE, dl, MVT::i8);
15827 Chain = DAG.getNode(X86ISD::BRCOND, dl, Op.getValueType(),
15828 Chain, Dest, CC, Cmp);
15829 CC = DAG.getConstant(X86::COND_NP, dl, MVT::i8);
15839 // Look pass the truncate if the high bits are known zero.
15840 if (isTruncWithZeroHighBitsInput(Cond, DAG))
15841 Cond = Cond.getOperand(0);
15843 // We know the result of AND is compared against zero. Try to match
15845 if (Cond.getOpcode() == ISD::AND && Cond.hasOneUse()) {
15846 if (SDValue NewSetCC = LowerToBT(Cond, ISD::SETNE, dl, DAG)) {
15847 CC = NewSetCC.getOperand(0);
15848 Cond = NewSetCC.getOperand(1);
15855 X86::CondCode X86Cond = Inverted ? X86::COND_E : X86::COND_NE;
15856 CC = DAG.getConstant(X86Cond, dl, MVT::i8);
15857 Cond = EmitTest(Cond, X86Cond, dl, DAG);
15859 Cond = ConvertCmpIfNecessary(Cond, DAG);
15860 return DAG.getNode(X86ISD::BRCOND, dl, Op.getValueType(),
15861 Chain, Dest, CC, Cond);
15864 // Lower dynamic stack allocation to _alloca call for Cygwin/Mingw targets.
15865 // Calls to _alloca are needed to probe the stack when allocating more than 4k
15866 // bytes in one go. Touching the stack at 4K increments is necessary to ensure
15867 // that the guard pages used by the OS virtual memory manager are allocated in
15868 // correct sequence.
15870 X86TargetLowering::LowerDYNAMIC_STACKALLOC(SDValue Op,
15871 SelectionDAG &DAG) const {
15872 MachineFunction &MF = DAG.getMachineFunction();
15873 bool SplitStack = MF.shouldSplitStack();
15874 bool Lower = (Subtarget->isOSWindows() && !Subtarget->isTargetMachO()) ||
15879 SDNode *Node = Op.getNode();
15880 SDValue Chain = Op.getOperand(0);
15881 SDValue Size = Op.getOperand(1);
15882 unsigned Align = cast<ConstantSDNode>(Op.getOperand(2))->getZExtValue();
15883 EVT VT = Node->getValueType(0);
15885 // Chain the dynamic stack allocation so that it doesn't modify the stack
15886 // pointer when other instructions are using the stack.
15887 Chain = DAG.getCALLSEQ_START(Chain, DAG.getIntPtrConstant(0, dl, true), dl);
15889 bool Is64Bit = Subtarget->is64Bit();
15890 MVT SPTy = getPointerTy(DAG.getDataLayout());
15894 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
15895 unsigned SPReg = TLI.getStackPointerRegisterToSaveRestore();
15896 assert(SPReg && "Target cannot require DYNAMIC_STACKALLOC expansion and"
15897 " not tell us which reg is the stack pointer!");
15898 EVT VT = Node->getValueType(0);
15899 SDValue Tmp3 = Node->getOperand(2);
15901 SDValue SP = DAG.getCopyFromReg(Chain, dl, SPReg, VT);
15902 Chain = SP.getValue(1);
15903 unsigned Align = cast<ConstantSDNode>(Tmp3)->getZExtValue();
15904 const TargetFrameLowering &TFI = *Subtarget->getFrameLowering();
15905 unsigned StackAlign = TFI.getStackAlignment();
15906 Result = DAG.getNode(ISD::SUB, dl, VT, SP, Size); // Value
15907 if (Align > StackAlign)
15908 Result = DAG.getNode(ISD::AND, dl, VT, Result,
15909 DAG.getConstant(-(uint64_t)Align, dl, VT));
15910 Chain = DAG.getCopyToReg(Chain, dl, SPReg, Result); // Output chain
15911 } else if (SplitStack) {
15912 MachineRegisterInfo &MRI = MF.getRegInfo();
15915 // The 64 bit implementation of segmented stacks needs to clobber both r10
15916 // r11. This makes it impossible to use it along with nested parameters.
15917 const Function *F = MF.getFunction();
15919 for (Function::const_arg_iterator I = F->arg_begin(), E = F->arg_end();
15921 if (I->hasNestAttr())
15922 report_fatal_error("Cannot use segmented stacks with functions that "
15923 "have nested arguments.");
15926 const TargetRegisterClass *AddrRegClass = getRegClassFor(SPTy);
15927 unsigned Vreg = MRI.createVirtualRegister(AddrRegClass);
15928 Chain = DAG.getCopyToReg(Chain, dl, Vreg, Size);
15929 Result = DAG.getNode(X86ISD::SEG_ALLOCA, dl, SPTy, Chain,
15930 DAG.getRegister(Vreg, SPTy));
15933 const unsigned Reg = (Subtarget->isTarget64BitLP64() ? X86::RAX : X86::EAX);
15935 Chain = DAG.getCopyToReg(Chain, dl, Reg, Size, Flag);
15936 Flag = Chain.getValue(1);
15937 SDVTList NodeTys = DAG.getVTList(MVT::Other, MVT::Glue);
15939 Chain = DAG.getNode(X86ISD::WIN_ALLOCA, dl, NodeTys, Chain, Flag);
15941 const X86RegisterInfo *RegInfo = Subtarget->getRegisterInfo();
15942 unsigned SPReg = RegInfo->getStackRegister();
15943 SDValue SP = DAG.getCopyFromReg(Chain, dl, SPReg, SPTy);
15944 Chain = SP.getValue(1);
15947 SP = DAG.getNode(ISD::AND, dl, VT, SP.getValue(0),
15948 DAG.getConstant(-(uint64_t)Align, dl, VT));
15949 Chain = DAG.getCopyToReg(Chain, dl, SPReg, SP);
15955 Chain = DAG.getCALLSEQ_END(Chain, DAG.getIntPtrConstant(0, dl, true),
15956 DAG.getIntPtrConstant(0, dl, true), SDValue(), dl);
15958 SDValue Ops[2] = {Result, Chain};
15959 return DAG.getMergeValues(Ops, dl);
15962 SDValue X86TargetLowering::LowerVASTART(SDValue Op, SelectionDAG &DAG) const {
15963 MachineFunction &MF = DAG.getMachineFunction();
15964 auto PtrVT = getPointerTy(MF.getDataLayout());
15965 X86MachineFunctionInfo *FuncInfo = MF.getInfo<X86MachineFunctionInfo>();
15967 const Value *SV = cast<SrcValueSDNode>(Op.getOperand(2))->getValue();
15970 if (!Subtarget->is64Bit() ||
15971 Subtarget->isCallingConvWin64(MF.getFunction()->getCallingConv())) {
15972 // vastart just stores the address of the VarArgsFrameIndex slot into the
15973 // memory location argument.
15974 SDValue FR = DAG.getFrameIndex(FuncInfo->getVarArgsFrameIndex(), PtrVT);
15975 return DAG.getStore(Op.getOperand(0), DL, FR, Op.getOperand(1),
15976 MachinePointerInfo(SV), false, false, 0);
15980 // gp_offset (0 - 6 * 8)
15981 // fp_offset (48 - 48 + 8 * 16)
15982 // overflow_arg_area (point to parameters coming in memory).
15984 SmallVector<SDValue, 8> MemOps;
15985 SDValue FIN = Op.getOperand(1);
15987 SDValue Store = DAG.getStore(Op.getOperand(0), DL,
15988 DAG.getConstant(FuncInfo->getVarArgsGPOffset(),
15990 FIN, MachinePointerInfo(SV), false, false, 0);
15991 MemOps.push_back(Store);
15994 FIN = DAG.getNode(ISD::ADD, DL, PtrVT, FIN, DAG.getIntPtrConstant(4, DL));
15995 Store = DAG.getStore(Op.getOperand(0), DL,
15996 DAG.getConstant(FuncInfo->getVarArgsFPOffset(), DL,
15998 FIN, MachinePointerInfo(SV, 4), false, false, 0);
15999 MemOps.push_back(Store);
16001 // Store ptr to overflow_arg_area
16002 FIN = DAG.getNode(ISD::ADD, DL, PtrVT, FIN, DAG.getIntPtrConstant(4, DL));
16003 SDValue OVFIN = DAG.getFrameIndex(FuncInfo->getVarArgsFrameIndex(), PtrVT);
16004 Store = DAG.getStore(Op.getOperand(0), DL, OVFIN, FIN,
16005 MachinePointerInfo(SV, 8),
16007 MemOps.push_back(Store);
16009 // Store ptr to reg_save_area.
16010 FIN = DAG.getNode(ISD::ADD, DL, PtrVT, FIN, DAG.getIntPtrConstant(
16011 Subtarget->isTarget64BitLP64() ? 8 : 4, DL));
16012 SDValue RSFIN = DAG.getFrameIndex(FuncInfo->getRegSaveFrameIndex(), PtrVT);
16013 Store = DAG.getStore(Op.getOperand(0), DL, RSFIN, FIN, MachinePointerInfo(
16014 SV, Subtarget->isTarget64BitLP64() ? 16 : 12), false, false, 0);
16015 MemOps.push_back(Store);
16016 return DAG.getNode(ISD::TokenFactor, DL, MVT::Other, MemOps);
16019 SDValue X86TargetLowering::LowerVAARG(SDValue Op, SelectionDAG &DAG) const {
16020 assert(Subtarget->is64Bit() &&
16021 "LowerVAARG only handles 64-bit va_arg!");
16022 assert(Op.getNode()->getNumOperands() == 4);
16024 MachineFunction &MF = DAG.getMachineFunction();
16025 if (Subtarget->isCallingConvWin64(MF.getFunction()->getCallingConv()))
16026 // The Win64 ABI uses char* instead of a structure.
16027 return DAG.expandVAArg(Op.getNode());
16029 SDValue Chain = Op.getOperand(0);
16030 SDValue SrcPtr = Op.getOperand(1);
16031 const Value *SV = cast<SrcValueSDNode>(Op.getOperand(2))->getValue();
16032 unsigned Align = Op.getConstantOperandVal(3);
16035 EVT ArgVT = Op.getNode()->getValueType(0);
16036 Type *ArgTy = ArgVT.getTypeForEVT(*DAG.getContext());
16037 uint32_t ArgSize = DAG.getDataLayout().getTypeAllocSize(ArgTy);
16040 // Decide which area this value should be read from.
16041 // TODO: Implement the AMD64 ABI in its entirety. This simple
16042 // selection mechanism works only for the basic types.
16043 if (ArgVT == MVT::f80) {
16044 llvm_unreachable("va_arg for f80 not yet implemented");
16045 } else if (ArgVT.isFloatingPoint() && ArgSize <= 16 /*bytes*/) {
16046 ArgMode = 2; // Argument passed in XMM register. Use fp_offset.
16047 } else if (ArgVT.isInteger() && ArgSize <= 32 /*bytes*/) {
16048 ArgMode = 1; // Argument passed in GPR64 register(s). Use gp_offset.
16050 llvm_unreachable("Unhandled argument type in LowerVAARG");
16053 if (ArgMode == 2) {
16054 // Sanity Check: Make sure using fp_offset makes sense.
16055 assert(!Subtarget->useSoftFloat() &&
16056 !(MF.getFunction()->hasFnAttribute(Attribute::NoImplicitFloat)) &&
16057 Subtarget->hasSSE1());
16060 // Insert VAARG_64 node into the DAG
16061 // VAARG_64 returns two values: Variable Argument Address, Chain
16062 SDValue InstOps[] = {Chain, SrcPtr, DAG.getConstant(ArgSize, dl, MVT::i32),
16063 DAG.getConstant(ArgMode, dl, MVT::i8),
16064 DAG.getConstant(Align, dl, MVT::i32)};
16065 SDVTList VTs = DAG.getVTList(getPointerTy(DAG.getDataLayout()), MVT::Other);
16066 SDValue VAARG = DAG.getMemIntrinsicNode(X86ISD::VAARG_64, dl,
16067 VTs, InstOps, MVT::i64,
16068 MachinePointerInfo(SV),
16070 /*Volatile=*/false,
16072 /*WriteMem=*/true);
16073 Chain = VAARG.getValue(1);
16075 // Load the next argument and return it
16076 return DAG.getLoad(ArgVT, dl,
16079 MachinePointerInfo(),
16080 false, false, false, 0);
16083 static SDValue LowerVACOPY(SDValue Op, const X86Subtarget *Subtarget,
16084 SelectionDAG &DAG) {
16085 // X86-64 va_list is a struct { i32, i32, i8*, i8* }, except on Windows,
16086 // where a va_list is still an i8*.
16087 assert(Subtarget->is64Bit() && "This code only handles 64-bit va_copy!");
16088 if (Subtarget->isCallingConvWin64(
16089 DAG.getMachineFunction().getFunction()->getCallingConv()))
16090 // Probably a Win64 va_copy.
16091 return DAG.expandVACopy(Op.getNode());
16093 SDValue Chain = Op.getOperand(0);
16094 SDValue DstPtr = Op.getOperand(1);
16095 SDValue SrcPtr = Op.getOperand(2);
16096 const Value *DstSV = cast<SrcValueSDNode>(Op.getOperand(3))->getValue();
16097 const Value *SrcSV = cast<SrcValueSDNode>(Op.getOperand(4))->getValue();
16100 return DAG.getMemcpy(Chain, DL, DstPtr, SrcPtr,
16101 DAG.getIntPtrConstant(24, DL), 8, /*isVolatile*/false,
16103 MachinePointerInfo(DstSV), MachinePointerInfo(SrcSV));
16106 // getTargetVShiftByConstNode - Handle vector element shifts where the shift
16107 // amount is a constant. Takes immediate version of shift as input.
16108 static SDValue getTargetVShiftByConstNode(unsigned Opc, SDLoc dl, MVT VT,
16109 SDValue SrcOp, uint64_t ShiftAmt,
16110 SelectionDAG &DAG) {
16111 MVT ElementType = VT.getVectorElementType();
16113 // Fold this packed shift into its first operand if ShiftAmt is 0.
16117 // Check for ShiftAmt >= element width
16118 if (ShiftAmt >= ElementType.getSizeInBits()) {
16119 if (Opc == X86ISD::VSRAI)
16120 ShiftAmt = ElementType.getSizeInBits() - 1;
16122 return DAG.getConstant(0, dl, VT);
16125 assert((Opc == X86ISD::VSHLI || Opc == X86ISD::VSRLI || Opc == X86ISD::VSRAI)
16126 && "Unknown target vector shift-by-constant node");
16128 // Fold this packed vector shift into a build vector if SrcOp is a
16129 // vector of Constants or UNDEFs, and SrcOp valuetype is the same as VT.
16130 if (VT == SrcOp.getSimpleValueType() &&
16131 ISD::isBuildVectorOfConstantSDNodes(SrcOp.getNode())) {
16132 SmallVector<SDValue, 8> Elts;
16133 unsigned NumElts = SrcOp->getNumOperands();
16134 ConstantSDNode *ND;
16137 default: llvm_unreachable(nullptr);
16138 case X86ISD::VSHLI:
16139 for (unsigned i=0; i!=NumElts; ++i) {
16140 SDValue CurrentOp = SrcOp->getOperand(i);
16141 if (CurrentOp->getOpcode() == ISD::UNDEF) {
16142 Elts.push_back(CurrentOp);
16145 ND = cast<ConstantSDNode>(CurrentOp);
16146 const APInt &C = ND->getAPIntValue();
16147 Elts.push_back(DAG.getConstant(C.shl(ShiftAmt), dl, ElementType));
16150 case X86ISD::VSRLI:
16151 for (unsigned i=0; i!=NumElts; ++i) {
16152 SDValue CurrentOp = SrcOp->getOperand(i);
16153 if (CurrentOp->getOpcode() == ISD::UNDEF) {
16154 Elts.push_back(CurrentOp);
16157 ND = cast<ConstantSDNode>(CurrentOp);
16158 const APInt &C = ND->getAPIntValue();
16159 Elts.push_back(DAG.getConstant(C.lshr(ShiftAmt), dl, ElementType));
16162 case X86ISD::VSRAI:
16163 for (unsigned i=0; i!=NumElts; ++i) {
16164 SDValue CurrentOp = SrcOp->getOperand(i);
16165 if (CurrentOp->getOpcode() == ISD::UNDEF) {
16166 Elts.push_back(CurrentOp);
16169 ND = cast<ConstantSDNode>(CurrentOp);
16170 const APInt &C = ND->getAPIntValue();
16171 Elts.push_back(DAG.getConstant(C.ashr(ShiftAmt), dl, ElementType));
16176 return DAG.getNode(ISD::BUILD_VECTOR, dl, VT, Elts);
16179 return DAG.getNode(Opc, dl, VT, SrcOp,
16180 DAG.getConstant(ShiftAmt, dl, MVT::i8));
16183 // getTargetVShiftNode - Handle vector element shifts where the shift amount
16184 // may or may not be a constant. Takes immediate version of shift as input.
16185 static SDValue getTargetVShiftNode(unsigned Opc, SDLoc dl, MVT VT,
16186 SDValue SrcOp, SDValue ShAmt,
16187 SelectionDAG &DAG) {
16188 MVT SVT = ShAmt.getSimpleValueType();
16189 assert((SVT == MVT::i32 || SVT == MVT::i64) && "Unexpected value type!");
16191 // Catch shift-by-constant.
16192 if (ConstantSDNode *CShAmt = dyn_cast<ConstantSDNode>(ShAmt))
16193 return getTargetVShiftByConstNode(Opc, dl, VT, SrcOp,
16194 CShAmt->getZExtValue(), DAG);
16196 // Change opcode to non-immediate version
16198 default: llvm_unreachable("Unknown target vector shift node");
16199 case X86ISD::VSHLI: Opc = X86ISD::VSHL; break;
16200 case X86ISD::VSRLI: Opc = X86ISD::VSRL; break;
16201 case X86ISD::VSRAI: Opc = X86ISD::VSRA; break;
16204 const X86Subtarget &Subtarget =
16205 static_cast<const X86Subtarget &>(DAG.getSubtarget());
16206 if (Subtarget.hasSSE41() && ShAmt.getOpcode() == ISD::ZERO_EXTEND &&
16207 ShAmt.getOperand(0).getSimpleValueType() == MVT::i16) {
16208 // Let the shuffle legalizer expand this shift amount node.
16209 SDValue Op0 = ShAmt.getOperand(0);
16210 Op0 = DAG.getNode(ISD::SCALAR_TO_VECTOR, SDLoc(Op0), MVT::v8i16, Op0);
16211 ShAmt = getShuffleVectorZeroOrUndef(Op0, 0, true, &Subtarget, DAG);
16213 // Need to build a vector containing shift amount.
16214 // SSE/AVX packed shifts only use the lower 64-bit of the shift count.
16215 SmallVector<SDValue, 4> ShOps;
16216 ShOps.push_back(ShAmt);
16217 if (SVT == MVT::i32) {
16218 ShOps.push_back(DAG.getConstant(0, dl, SVT));
16219 ShOps.push_back(DAG.getUNDEF(SVT));
16221 ShOps.push_back(DAG.getUNDEF(SVT));
16223 MVT BVT = SVT == MVT::i32 ? MVT::v4i32 : MVT::v2i64;
16224 ShAmt = DAG.getNode(ISD::BUILD_VECTOR, dl, BVT, ShOps);
16227 // The return type has to be a 128-bit type with the same element
16228 // type as the input type.
16229 MVT EltVT = VT.getVectorElementType();
16230 MVT ShVT = MVT::getVectorVT(EltVT, 128/EltVT.getSizeInBits());
16232 ShAmt = DAG.getBitcast(ShVT, ShAmt);
16233 return DAG.getNode(Opc, dl, VT, SrcOp, ShAmt);
16236 /// \brief Return Mask with the necessary casting or extending
16237 /// for \p Mask according to \p MaskVT when lowering masking intrinsics
16238 static SDValue getMaskNode(SDValue Mask, MVT MaskVT,
16239 const X86Subtarget *Subtarget,
16240 SelectionDAG &DAG, SDLoc dl) {
16242 if (MaskVT.bitsGT(Mask.getSimpleValueType())) {
16243 // Mask should be extended
16244 Mask = DAG.getNode(ISD::ANY_EXTEND, dl,
16245 MVT::getIntegerVT(MaskVT.getSizeInBits()), Mask);
16248 if (Mask.getSimpleValueType() == MVT::i64 && Subtarget->is32Bit()) {
16249 if (MaskVT == MVT::v64i1) {
16250 assert(Subtarget->hasBWI() && "Expected AVX512BW target!");
16251 // In case 32bit mode, bitcast i64 is illegal, extend/split it.
16253 Lo = DAG.getNode(ISD::EXTRACT_ELEMENT, dl, MVT::i32, Mask,
16254 DAG.getConstant(0, dl, MVT::i32));
16255 Hi = DAG.getNode(ISD::EXTRACT_ELEMENT, dl, MVT::i32, Mask,
16256 DAG.getConstant(1, dl, MVT::i32));
16258 Lo = DAG.getBitcast(MVT::v32i1, Lo);
16259 Hi = DAG.getBitcast(MVT::v32i1, Hi);
16261 return DAG.getNode(ISD::CONCAT_VECTORS, dl, MVT::v64i1, Lo, Hi);
16263 // MaskVT require < 64bit. Truncate mask (should succeed in any case),
16265 MVT TruncVT = MVT::getIntegerVT(MaskVT.getSizeInBits());
16266 return DAG.getBitcast(MaskVT,
16267 DAG.getNode(ISD::TRUNCATE, dl, TruncVT, Mask));
16271 MVT BitcastVT = MVT::getVectorVT(MVT::i1,
16272 Mask.getSimpleValueType().getSizeInBits());
16273 // In case when MaskVT equals v2i1 or v4i1, low 2 or 4 elements
16274 // are extracted by EXTRACT_SUBVECTOR.
16275 return DAG.getNode(ISD::EXTRACT_SUBVECTOR, dl, MaskVT,
16276 DAG.getBitcast(BitcastVT, Mask),
16277 DAG.getIntPtrConstant(0, dl));
16281 /// \brief Return (and \p Op, \p Mask) for compare instructions or
16282 /// (vselect \p Mask, \p Op, \p PreservedSrc) for others along with the
16283 /// necessary casting or extending for \p Mask when lowering masking intrinsics
16284 static SDValue getVectorMaskingNode(SDValue Op, SDValue Mask,
16285 SDValue PreservedSrc,
16286 const X86Subtarget *Subtarget,
16287 SelectionDAG &DAG) {
16288 MVT VT = Op.getSimpleValueType();
16289 MVT MaskVT = MVT::getVectorVT(MVT::i1, VT.getVectorNumElements());
16290 unsigned OpcodeSelect = ISD::VSELECT;
16293 if (isAllOnesConstant(Mask))
16296 SDValue VMask = getMaskNode(Mask, MaskVT, Subtarget, DAG, dl);
16298 switch (Op.getOpcode()) {
16300 case X86ISD::PCMPEQM:
16301 case X86ISD::PCMPGTM:
16303 case X86ISD::CMPMU:
16304 return DAG.getNode(ISD::AND, dl, VT, Op, VMask);
16305 case X86ISD::VFPCLASS:
16306 case X86ISD::VFPCLASSS:
16307 return DAG.getNode(ISD::OR, dl, VT, Op, VMask);
16308 case X86ISD::VTRUNC:
16309 case X86ISD::VTRUNCS:
16310 case X86ISD::VTRUNCUS:
16311 // We can't use ISD::VSELECT here because it is not always "Legal"
16312 // for the destination type. For example vpmovqb require only AVX512
16313 // and vselect that can operate on byte element type require BWI
16314 OpcodeSelect = X86ISD::SELECT;
16317 if (PreservedSrc.getOpcode() == ISD::UNDEF)
16318 PreservedSrc = getZeroVector(VT, Subtarget, DAG, dl);
16319 return DAG.getNode(OpcodeSelect, dl, VT, VMask, Op, PreservedSrc);
16322 /// \brief Creates an SDNode for a predicated scalar operation.
16323 /// \returns (X86vselect \p Mask, \p Op, \p PreservedSrc).
16324 /// The mask is coming as MVT::i8 and it should be truncated
16325 /// to MVT::i1 while lowering masking intrinsics.
16326 /// The main difference between ScalarMaskingNode and VectorMaskingNode is using
16327 /// "X86select" instead of "vselect". We just can't create the "vselect" node
16328 /// for a scalar instruction.
16329 static SDValue getScalarMaskingNode(SDValue Op, SDValue Mask,
16330 SDValue PreservedSrc,
16331 const X86Subtarget *Subtarget,
16332 SelectionDAG &DAG) {
16333 if (isAllOnesConstant(Mask))
16336 MVT VT = Op.getSimpleValueType();
16338 // The mask should be of type MVT::i1
16339 SDValue IMask = DAG.getNode(ISD::TRUNCATE, dl, MVT::i1, Mask);
16341 if (Op.getOpcode() == X86ISD::FSETCC)
16342 return DAG.getNode(ISD::AND, dl, VT, Op, IMask);
16343 if (Op.getOpcode() == X86ISD::VFPCLASS ||
16344 Op.getOpcode() == X86ISD::VFPCLASSS)
16345 return DAG.getNode(ISD::OR, dl, VT, Op, IMask);
16347 if (PreservedSrc.getOpcode() == ISD::UNDEF)
16348 PreservedSrc = getZeroVector(VT, Subtarget, DAG, dl);
16349 return DAG.getNode(X86ISD::SELECT, dl, VT, IMask, Op, PreservedSrc);
16352 static int getSEHRegistrationNodeSize(const Function *Fn) {
16353 if (!Fn->hasPersonalityFn())
16354 report_fatal_error(
16355 "querying registration node size for function without personality");
16356 // The RegNodeSize is 6 32-bit words for SEH and 4 for C++ EH. See
16357 // WinEHStatePass for the full struct definition.
16358 switch (classifyEHPersonality(Fn->getPersonalityFn())) {
16359 case EHPersonality::MSVC_X86SEH: return 24;
16360 case EHPersonality::MSVC_CXX: return 16;
16363 report_fatal_error(
16364 "can only recover FP for 32-bit MSVC EH personality functions");
16367 /// When the MSVC runtime transfers control to us, either to an outlined
16368 /// function or when returning to a parent frame after catching an exception, we
16369 /// recover the parent frame pointer by doing arithmetic on the incoming EBP.
16370 /// Here's the math:
16371 /// RegNodeBase = EntryEBP - RegNodeSize
16372 /// ParentFP = RegNodeBase - ParentFrameOffset
16373 /// Subtracting RegNodeSize takes us to the offset of the registration node, and
16374 /// subtracting the offset (negative on x86) takes us back to the parent FP.
16375 static SDValue recoverFramePointer(SelectionDAG &DAG, const Function *Fn,
16376 SDValue EntryEBP) {
16377 MachineFunction &MF = DAG.getMachineFunction();
16380 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
16381 MVT PtrVT = TLI.getPointerTy(DAG.getDataLayout());
16383 // It's possible that the parent function no longer has a personality function
16384 // if the exceptional code was optimized away, in which case we just return
16385 // the incoming EBP.
16386 if (!Fn->hasPersonalityFn())
16389 // Get an MCSymbol that will ultimately resolve to the frame offset of the EH
16390 // registration, or the .set_setframe offset.
16391 MCSymbol *OffsetSym =
16392 MF.getMMI().getContext().getOrCreateParentFrameOffsetSymbol(
16393 GlobalValue::getRealLinkageName(Fn->getName()));
16394 SDValue OffsetSymVal = DAG.getMCSymbol(OffsetSym, PtrVT);
16395 SDValue ParentFrameOffset =
16396 DAG.getNode(ISD::LOCAL_RECOVER, dl, PtrVT, OffsetSymVal);
16398 // Return EntryEBP + ParentFrameOffset for x64. This adjusts from RSP after
16399 // prologue to RBP in the parent function.
16400 const X86Subtarget &Subtarget =
16401 static_cast<const X86Subtarget &>(DAG.getSubtarget());
16402 if (Subtarget.is64Bit())
16403 return DAG.getNode(ISD::ADD, dl, PtrVT, EntryEBP, ParentFrameOffset);
16405 int RegNodeSize = getSEHRegistrationNodeSize(Fn);
16406 // RegNodeBase = EntryEBP - RegNodeSize
16407 // ParentFP = RegNodeBase - ParentFrameOffset
16408 SDValue RegNodeBase = DAG.getNode(ISD::SUB, dl, PtrVT, EntryEBP,
16409 DAG.getConstant(RegNodeSize, dl, PtrVT));
16410 return DAG.getNode(ISD::SUB, dl, PtrVT, RegNodeBase, ParentFrameOffset);
16413 static SDValue LowerINTRINSIC_WO_CHAIN(SDValue Op, const X86Subtarget *Subtarget,
16414 SelectionDAG &DAG) {
16416 unsigned IntNo = cast<ConstantSDNode>(Op.getOperand(0))->getZExtValue();
16417 MVT VT = Op.getSimpleValueType();
16418 const IntrinsicData* IntrData = getIntrinsicWithoutChain(IntNo);
16420 switch(IntrData->Type) {
16421 case INTR_TYPE_1OP:
16422 return DAG.getNode(IntrData->Opc0, dl, Op.getValueType(), Op.getOperand(1));
16423 case INTR_TYPE_2OP:
16424 return DAG.getNode(IntrData->Opc0, dl, Op.getValueType(), Op.getOperand(1),
16426 case INTR_TYPE_2OP_IMM8:
16427 return DAG.getNode(IntrData->Opc0, dl, Op.getValueType(), Op.getOperand(1),
16428 DAG.getNode(ISD::TRUNCATE, dl, MVT::i8, Op.getOperand(2)));
16429 case INTR_TYPE_3OP:
16430 return DAG.getNode(IntrData->Opc0, dl, Op.getValueType(), Op.getOperand(1),
16431 Op.getOperand(2), Op.getOperand(3));
16432 case INTR_TYPE_4OP:
16433 return DAG.getNode(IntrData->Opc0, dl, Op.getValueType(), Op.getOperand(1),
16434 Op.getOperand(2), Op.getOperand(3), Op.getOperand(4));
16435 case INTR_TYPE_1OP_MASK_RM: {
16436 SDValue Src = Op.getOperand(1);
16437 SDValue PassThru = Op.getOperand(2);
16438 SDValue Mask = Op.getOperand(3);
16439 SDValue RoundingMode;
16440 // We allways add rounding mode to the Node.
16441 // If the rounding mode is not specified, we add the
16442 // "current direction" mode.
16443 if (Op.getNumOperands() == 4)
16445 DAG.getConstant(X86::STATIC_ROUNDING::CUR_DIRECTION, dl, MVT::i32);
16447 RoundingMode = Op.getOperand(4);
16448 unsigned IntrWithRoundingModeOpcode = IntrData->Opc1;
16449 if (IntrWithRoundingModeOpcode != 0)
16450 if (cast<ConstantSDNode>(RoundingMode)->getZExtValue() !=
16451 X86::STATIC_ROUNDING::CUR_DIRECTION)
16452 return getVectorMaskingNode(DAG.getNode(IntrWithRoundingModeOpcode,
16453 dl, Op.getValueType(), Src, RoundingMode),
16454 Mask, PassThru, Subtarget, DAG);
16455 return getVectorMaskingNode(DAG.getNode(IntrData->Opc0, dl, VT, Src,
16457 Mask, PassThru, Subtarget, DAG);
16459 case INTR_TYPE_1OP_MASK: {
16460 SDValue Src = Op.getOperand(1);
16461 SDValue PassThru = Op.getOperand(2);
16462 SDValue Mask = Op.getOperand(3);
16463 // We add rounding mode to the Node when
16464 // - RM Opcode is specified and
16465 // - RM is not "current direction".
16466 unsigned IntrWithRoundingModeOpcode = IntrData->Opc1;
16467 if (IntrWithRoundingModeOpcode != 0) {
16468 SDValue Rnd = Op.getOperand(4);
16469 unsigned Round = cast<ConstantSDNode>(Rnd)->getZExtValue();
16470 if (Round != X86::STATIC_ROUNDING::CUR_DIRECTION) {
16471 return getVectorMaskingNode(DAG.getNode(IntrWithRoundingModeOpcode,
16472 dl, Op.getValueType(),
16474 Mask, PassThru, Subtarget, DAG);
16477 return getVectorMaskingNode(DAG.getNode(IntrData->Opc0, dl, VT, Src),
16478 Mask, PassThru, Subtarget, DAG);
16480 case INTR_TYPE_SCALAR_MASK: {
16481 SDValue Src1 = Op.getOperand(1);
16482 SDValue Src2 = Op.getOperand(2);
16483 SDValue passThru = Op.getOperand(3);
16484 SDValue Mask = Op.getOperand(4);
16485 return getScalarMaskingNode(DAG.getNode(IntrData->Opc0, dl, VT, Src1, Src2),
16486 Mask, passThru, Subtarget, DAG);
16488 case INTR_TYPE_SCALAR_MASK_RM: {
16489 SDValue Src1 = Op.getOperand(1);
16490 SDValue Src2 = Op.getOperand(2);
16491 SDValue Src0 = Op.getOperand(3);
16492 SDValue Mask = Op.getOperand(4);
16493 // There are 2 kinds of intrinsics in this group:
16494 // (1) With suppress-all-exceptions (sae) or rounding mode- 6 operands
16495 // (2) With rounding mode and sae - 7 operands.
16496 if (Op.getNumOperands() == 6) {
16497 SDValue Sae = Op.getOperand(5);
16498 unsigned Opc = IntrData->Opc1 ? IntrData->Opc1 : IntrData->Opc0;
16499 return getScalarMaskingNode(DAG.getNode(Opc, dl, VT, Src1, Src2,
16501 Mask, Src0, Subtarget, DAG);
16503 assert(Op.getNumOperands() == 7 && "Unexpected intrinsic form");
16504 SDValue RoundingMode = Op.getOperand(5);
16505 SDValue Sae = Op.getOperand(6);
16506 return getScalarMaskingNode(DAG.getNode(IntrData->Opc0, dl, VT, Src1, Src2,
16507 RoundingMode, Sae),
16508 Mask, Src0, Subtarget, DAG);
16510 case INTR_TYPE_2OP_MASK:
16511 case INTR_TYPE_2OP_IMM8_MASK: {
16512 SDValue Src1 = Op.getOperand(1);
16513 SDValue Src2 = Op.getOperand(2);
16514 SDValue PassThru = Op.getOperand(3);
16515 SDValue Mask = Op.getOperand(4);
16517 if (IntrData->Type == INTR_TYPE_2OP_IMM8_MASK)
16518 Src2 = DAG.getNode(ISD::TRUNCATE, dl, MVT::i8, Src2);
16520 // We specify 2 possible opcodes for intrinsics with rounding modes.
16521 // First, we check if the intrinsic may have non-default rounding mode,
16522 // (IntrData->Opc1 != 0), then we check the rounding mode operand.
16523 unsigned IntrWithRoundingModeOpcode = IntrData->Opc1;
16524 if (IntrWithRoundingModeOpcode != 0) {
16525 SDValue Rnd = Op.getOperand(5);
16526 unsigned Round = cast<ConstantSDNode>(Rnd)->getZExtValue();
16527 if (Round != X86::STATIC_ROUNDING::CUR_DIRECTION) {
16528 return getVectorMaskingNode(DAG.getNode(IntrWithRoundingModeOpcode,
16529 dl, Op.getValueType(),
16531 Mask, PassThru, Subtarget, DAG);
16534 // TODO: Intrinsics should have fast-math-flags to propagate.
16535 return getVectorMaskingNode(DAG.getNode(IntrData->Opc0, dl, VT,Src1,Src2),
16536 Mask, PassThru, Subtarget, DAG);
16538 case INTR_TYPE_2OP_MASK_RM: {
16539 SDValue Src1 = Op.getOperand(1);
16540 SDValue Src2 = Op.getOperand(2);
16541 SDValue PassThru = Op.getOperand(3);
16542 SDValue Mask = Op.getOperand(4);
16543 // We specify 2 possible modes for intrinsics, with/without rounding
16545 // First, we check if the intrinsic have rounding mode (6 operands),
16546 // if not, we set rounding mode to "current".
16548 if (Op.getNumOperands() == 6)
16549 Rnd = Op.getOperand(5);
16551 Rnd = DAG.getConstant(X86::STATIC_ROUNDING::CUR_DIRECTION, dl, MVT::i32);
16552 return getVectorMaskingNode(DAG.getNode(IntrData->Opc0, dl, VT,
16554 Mask, PassThru, Subtarget, DAG);
16556 case INTR_TYPE_3OP_SCALAR_MASK_RM: {
16557 SDValue Src1 = Op.getOperand(1);
16558 SDValue Src2 = Op.getOperand(2);
16559 SDValue Src3 = Op.getOperand(3);
16560 SDValue PassThru = Op.getOperand(4);
16561 SDValue Mask = Op.getOperand(5);
16562 SDValue Sae = Op.getOperand(6);
16564 return getScalarMaskingNode(DAG.getNode(IntrData->Opc0, dl, VT, Src1,
16566 Mask, PassThru, Subtarget, DAG);
16568 case INTR_TYPE_3OP_MASK_RM: {
16569 SDValue Src1 = Op.getOperand(1);
16570 SDValue Src2 = Op.getOperand(2);
16571 SDValue Imm = Op.getOperand(3);
16572 SDValue PassThru = Op.getOperand(4);
16573 SDValue Mask = Op.getOperand(5);
16574 // We specify 2 possible modes for intrinsics, with/without rounding
16576 // First, we check if the intrinsic have rounding mode (7 operands),
16577 // if not, we set rounding mode to "current".
16579 if (Op.getNumOperands() == 7)
16580 Rnd = Op.getOperand(6);
16582 Rnd = DAG.getConstant(X86::STATIC_ROUNDING::CUR_DIRECTION, dl, MVT::i32);
16583 return getVectorMaskingNode(DAG.getNode(IntrData->Opc0, dl, VT,
16584 Src1, Src2, Imm, Rnd),
16585 Mask, PassThru, Subtarget, DAG);
16587 case INTR_TYPE_3OP_IMM8_MASK:
16588 case INTR_TYPE_3OP_MASK:
16589 case INSERT_SUBVEC: {
16590 SDValue Src1 = Op.getOperand(1);
16591 SDValue Src2 = Op.getOperand(2);
16592 SDValue Src3 = Op.getOperand(3);
16593 SDValue PassThru = Op.getOperand(4);
16594 SDValue Mask = Op.getOperand(5);
16596 if (IntrData->Type == INTR_TYPE_3OP_IMM8_MASK)
16597 Src3 = DAG.getNode(ISD::TRUNCATE, dl, MVT::i8, Src3);
16598 else if (IntrData->Type == INSERT_SUBVEC) {
16599 // imm should be adapted to ISD::INSERT_SUBVECTOR behavior
16600 assert(isa<ConstantSDNode>(Src3) && "Expected a ConstantSDNode here!");
16601 unsigned Imm = cast<ConstantSDNode>(Src3)->getZExtValue();
16602 Imm *= Src2.getSimpleValueType().getVectorNumElements();
16603 Src3 = DAG.getTargetConstant(Imm, dl, MVT::i32);
16606 // We specify 2 possible opcodes for intrinsics with rounding modes.
16607 // First, we check if the intrinsic may have non-default rounding mode,
16608 // (IntrData->Opc1 != 0), then we check the rounding mode operand.
16609 unsigned IntrWithRoundingModeOpcode = IntrData->Opc1;
16610 if (IntrWithRoundingModeOpcode != 0) {
16611 SDValue Rnd = Op.getOperand(6);
16612 unsigned Round = cast<ConstantSDNode>(Rnd)->getZExtValue();
16613 if (Round != X86::STATIC_ROUNDING::CUR_DIRECTION) {
16614 return getVectorMaskingNode(DAG.getNode(IntrWithRoundingModeOpcode,
16615 dl, Op.getValueType(),
16616 Src1, Src2, Src3, Rnd),
16617 Mask, PassThru, Subtarget, DAG);
16620 return getVectorMaskingNode(DAG.getNode(IntrData->Opc0, dl, VT,
16622 Mask, PassThru, Subtarget, DAG);
16624 case VPERM_3OP_MASKZ:
16625 case VPERM_3OP_MASK:{
16626 // Src2 is the PassThru
16627 SDValue Src1 = Op.getOperand(1);
16628 SDValue Src2 = Op.getOperand(2);
16629 SDValue Src3 = Op.getOperand(3);
16630 SDValue Mask = Op.getOperand(4);
16631 MVT VT = Op.getSimpleValueType();
16632 SDValue PassThru = SDValue();
16634 // set PassThru element
16635 if (IntrData->Type == VPERM_3OP_MASKZ)
16636 PassThru = getZeroVector(VT, Subtarget, DAG, dl);
16638 PassThru = DAG.getBitcast(VT, Src2);
16640 // Swap Src1 and Src2 in the node creation
16641 return getVectorMaskingNode(DAG.getNode(IntrData->Opc0,
16642 dl, Op.getValueType(),
16644 Mask, PassThru, Subtarget, DAG);
16648 case FMA_OP_MASK: {
16649 SDValue Src1 = Op.getOperand(1);
16650 SDValue Src2 = Op.getOperand(2);
16651 SDValue Src3 = Op.getOperand(3);
16652 SDValue Mask = Op.getOperand(4);
16653 MVT VT = Op.getSimpleValueType();
16654 SDValue PassThru = SDValue();
16656 // set PassThru element
16657 if (IntrData->Type == FMA_OP_MASKZ)
16658 PassThru = getZeroVector(VT, Subtarget, DAG, dl);
16659 else if (IntrData->Type == FMA_OP_MASK3)
16664 // We specify 2 possible opcodes for intrinsics with rounding modes.
16665 // First, we check if the intrinsic may have non-default rounding mode,
16666 // (IntrData->Opc1 != 0), then we check the rounding mode operand.
16667 unsigned IntrWithRoundingModeOpcode = IntrData->Opc1;
16668 if (IntrWithRoundingModeOpcode != 0) {
16669 SDValue Rnd = Op.getOperand(5);
16670 if (cast<ConstantSDNode>(Rnd)->getZExtValue() !=
16671 X86::STATIC_ROUNDING::CUR_DIRECTION)
16672 return getVectorMaskingNode(DAG.getNode(IntrWithRoundingModeOpcode,
16673 dl, Op.getValueType(),
16674 Src1, Src2, Src3, Rnd),
16675 Mask, PassThru, Subtarget, DAG);
16677 return getVectorMaskingNode(DAG.getNode(IntrData->Opc0,
16678 dl, Op.getValueType(),
16680 Mask, PassThru, Subtarget, DAG);
16682 case TERLOG_OP_MASK:
16683 case TERLOG_OP_MASKZ: {
16684 SDValue Src1 = Op.getOperand(1);
16685 SDValue Src2 = Op.getOperand(2);
16686 SDValue Src3 = Op.getOperand(3);
16687 SDValue Src4 = DAG.getNode(ISD::TRUNCATE, dl, MVT::i8, Op.getOperand(4));
16688 SDValue Mask = Op.getOperand(5);
16689 MVT VT = Op.getSimpleValueType();
16690 SDValue PassThru = Src1;
16691 // Set PassThru element.
16692 if (IntrData->Type == TERLOG_OP_MASKZ)
16693 PassThru = getZeroVector(VT, Subtarget, DAG, dl);
16695 return getVectorMaskingNode(DAG.getNode(IntrData->Opc0, dl, VT,
16696 Src1, Src2, Src3, Src4),
16697 Mask, PassThru, Subtarget, DAG);
16700 // FPclass intrinsics with mask
16701 SDValue Src1 = Op.getOperand(1);
16702 MVT VT = Src1.getSimpleValueType();
16703 MVT MaskVT = MVT::getVectorVT(MVT::i1, VT.getVectorNumElements());
16704 SDValue Imm = Op.getOperand(2);
16705 SDValue Mask = Op.getOperand(3);
16706 MVT BitcastVT = MVT::getVectorVT(MVT::i1,
16707 Mask.getSimpleValueType().getSizeInBits());
16708 SDValue FPclass = DAG.getNode(IntrData->Opc0, dl, MaskVT, Src1, Imm);
16709 SDValue FPclassMask = getVectorMaskingNode(FPclass, Mask,
16710 DAG.getTargetConstant(0, dl, MaskVT),
16712 SDValue Res = DAG.getNode(ISD::INSERT_SUBVECTOR, dl, BitcastVT,
16713 DAG.getUNDEF(BitcastVT), FPclassMask,
16714 DAG.getIntPtrConstant(0, dl));
16715 return DAG.getBitcast(Op.getValueType(), Res);
16718 SDValue Src1 = Op.getOperand(1);
16719 SDValue Imm = Op.getOperand(2);
16720 SDValue Mask = Op.getOperand(3);
16721 SDValue FPclass = DAG.getNode(IntrData->Opc0, dl, MVT::i1, Src1, Imm);
16722 SDValue FPclassMask = getScalarMaskingNode(FPclass, Mask,
16723 DAG.getTargetConstant(0, dl, MVT::i1), Subtarget, DAG);
16724 return DAG.getNode(ISD::SIGN_EXTEND, dl, MVT::i8, FPclassMask);
16727 case CMP_MASK_CC: {
16728 // Comparison intrinsics with masks.
16729 // Example of transformation:
16730 // (i8 (int_x86_avx512_mask_pcmpeq_q_128
16731 // (v2i64 %a), (v2i64 %b), (i8 %mask))) ->
16733 // (v8i1 (insert_subvector undef,
16734 // (v2i1 (and (PCMPEQM %a, %b),
16735 // (extract_subvector
16736 // (v8i1 (bitcast %mask)), 0))), 0))))
16737 MVT VT = Op.getOperand(1).getSimpleValueType();
16738 MVT MaskVT = MVT::getVectorVT(MVT::i1, VT.getVectorNumElements());
16739 SDValue Mask = Op.getOperand((IntrData->Type == CMP_MASK_CC) ? 4 : 3);
16740 MVT BitcastVT = MVT::getVectorVT(MVT::i1,
16741 Mask.getSimpleValueType().getSizeInBits());
16743 if (IntrData->Type == CMP_MASK_CC) {
16744 SDValue CC = Op.getOperand(3);
16745 CC = DAG.getNode(ISD::TRUNCATE, dl, MVT::i8, CC);
16746 // We specify 2 possible opcodes for intrinsics with rounding modes.
16747 // First, we check if the intrinsic may have non-default rounding mode,
16748 // (IntrData->Opc1 != 0), then we check the rounding mode operand.
16749 if (IntrData->Opc1 != 0) {
16750 SDValue Rnd = Op.getOperand(5);
16751 if (cast<ConstantSDNode>(Rnd)->getZExtValue() !=
16752 X86::STATIC_ROUNDING::CUR_DIRECTION)
16753 Cmp = DAG.getNode(IntrData->Opc1, dl, MaskVT, Op.getOperand(1),
16754 Op.getOperand(2), CC, Rnd);
16756 //default rounding mode
16758 Cmp = DAG.getNode(IntrData->Opc0, dl, MaskVT, Op.getOperand(1),
16759 Op.getOperand(2), CC);
16762 assert(IntrData->Type == CMP_MASK && "Unexpected intrinsic type!");
16763 Cmp = DAG.getNode(IntrData->Opc0, dl, MaskVT, Op.getOperand(1),
16766 SDValue CmpMask = getVectorMaskingNode(Cmp, Mask,
16767 DAG.getTargetConstant(0, dl,
16770 SDValue Res = DAG.getNode(ISD::INSERT_SUBVECTOR, dl, BitcastVT,
16771 DAG.getUNDEF(BitcastVT), CmpMask,
16772 DAG.getIntPtrConstant(0, dl));
16773 return DAG.getBitcast(Op.getValueType(), Res);
16775 case CMP_MASK_SCALAR_CC: {
16776 SDValue Src1 = Op.getOperand(1);
16777 SDValue Src2 = Op.getOperand(2);
16778 SDValue CC = DAG.getNode(ISD::TRUNCATE, dl, MVT::i8, Op.getOperand(3));
16779 SDValue Mask = Op.getOperand(4);
16782 if (IntrData->Opc1 != 0) {
16783 SDValue Rnd = Op.getOperand(5);
16784 if (cast<ConstantSDNode>(Rnd)->getZExtValue() !=
16785 X86::STATIC_ROUNDING::CUR_DIRECTION)
16786 Cmp = DAG.getNode(IntrData->Opc1, dl, MVT::i1, Src1, Src2, CC, Rnd);
16788 //default rounding mode
16790 Cmp = DAG.getNode(IntrData->Opc0, dl, MVT::i1, Src1, Src2, CC);
16792 SDValue CmpMask = getScalarMaskingNode(Cmp, Mask,
16793 DAG.getTargetConstant(0, dl,
16797 return DAG.getNode(ISD::SIGN_EXTEND_INREG, dl, MVT::i8,
16798 DAG.getNode(ISD::ANY_EXTEND, dl, MVT::i8, CmpMask),
16799 DAG.getValueType(MVT::i1));
16801 case COMI: { // Comparison intrinsics
16802 ISD::CondCode CC = (ISD::CondCode)IntrData->Opc1;
16803 SDValue LHS = Op.getOperand(1);
16804 SDValue RHS = Op.getOperand(2);
16805 unsigned X86CC = TranslateX86CC(CC, dl, true, LHS, RHS, DAG);
16806 assert(X86CC != X86::COND_INVALID && "Unexpected illegal condition!");
16807 SDValue Cond = DAG.getNode(IntrData->Opc0, dl, MVT::i32, LHS, RHS);
16808 SDValue SetCC = DAG.getNode(X86ISD::SETCC, dl, MVT::i8,
16809 DAG.getConstant(X86CC, dl, MVT::i8), Cond);
16810 return DAG.getNode(ISD::ZERO_EXTEND, dl, MVT::i32, SetCC);
16812 case COMI_RM: { // Comparison intrinsics with Sae
16813 SDValue LHS = Op.getOperand(1);
16814 SDValue RHS = Op.getOperand(2);
16815 SDValue CC = Op.getOperand(3);
16816 SDValue Sae = Op.getOperand(4);
16817 auto ComiType = TranslateX86ConstCondToX86CC(CC);
16818 // choose between ordered and unordered (comi/ucomi)
16819 unsigned comiOp = std::get<0>(ComiType) ? IntrData->Opc0 : IntrData->Opc1;
16821 if (cast<ConstantSDNode>(Sae)->getZExtValue() !=
16822 X86::STATIC_ROUNDING::CUR_DIRECTION)
16823 Cond = DAG.getNode(comiOp, dl, MVT::i32, LHS, RHS, Sae);
16825 Cond = DAG.getNode(comiOp, dl, MVT::i32, LHS, RHS);
16826 SDValue SetCC = DAG.getNode(X86ISD::SETCC, dl, MVT::i8,
16827 DAG.getConstant(std::get<1>(ComiType), dl, MVT::i8), Cond);
16828 return DAG.getNode(ISD::ZERO_EXTEND, dl, MVT::i32, SetCC);
16831 return getTargetVShiftNode(IntrData->Opc0, dl, Op.getSimpleValueType(),
16832 Op.getOperand(1), Op.getOperand(2), DAG);
16834 return getVectorMaskingNode(getTargetVShiftNode(IntrData->Opc0, dl,
16835 Op.getSimpleValueType(),
16837 Op.getOperand(2), DAG),
16838 Op.getOperand(4), Op.getOperand(3), Subtarget,
16840 case COMPRESS_EXPAND_IN_REG: {
16841 SDValue Mask = Op.getOperand(3);
16842 SDValue DataToCompress = Op.getOperand(1);
16843 SDValue PassThru = Op.getOperand(2);
16844 if (isAllOnesConstant(Mask)) // return data as is
16845 return Op.getOperand(1);
16847 return getVectorMaskingNode(DAG.getNode(IntrData->Opc0, dl, VT,
16849 Mask, PassThru, Subtarget, DAG);
16852 SDValue Mask = Op.getOperand(1);
16853 MVT MaskVT = MVT::getVectorVT(MVT::i1,
16854 Mask.getSimpleValueType().getSizeInBits());
16855 Mask = DAG.getBitcast(MaskVT, Mask);
16856 return DAG.getNode(IntrData->Opc0, dl, Op.getValueType(), Mask);
16859 SDValue Mask = Op.getOperand(3);
16860 MVT VT = Op.getSimpleValueType();
16861 MVT MaskVT = MVT::getVectorVT(MVT::i1, VT.getVectorNumElements());
16862 SDValue VMask = getMaskNode(Mask, MaskVT, Subtarget, DAG, dl);
16863 return DAG.getNode(IntrData->Opc0, dl, VT, VMask, Op.getOperand(1),
16867 MVT VT = Op.getSimpleValueType();
16868 MVT MaskVT = MVT::getVectorVT(MVT::i1, VT.getSizeInBits()/2);
16870 SDValue Src1 = getMaskNode(Op.getOperand(1), MaskVT, Subtarget, DAG, dl);
16871 SDValue Src2 = getMaskNode(Op.getOperand(2), MaskVT, Subtarget, DAG, dl);
16872 // Arguments should be swapped.
16873 SDValue Res = DAG.getNode(IntrData->Opc0, dl,
16874 MVT::getVectorVT(MVT::i1, VT.getSizeInBits()),
16876 return DAG.getBitcast(VT, Res);
16878 case CONVERT_TO_MASK: {
16879 MVT SrcVT = Op.getOperand(1).getSimpleValueType();
16880 MVT MaskVT = MVT::getVectorVT(MVT::i1, SrcVT.getVectorNumElements());
16881 MVT BitcastVT = MVT::getVectorVT(MVT::i1, VT.getSizeInBits());
16883 SDValue CvtMask = DAG.getNode(IntrData->Opc0, dl, MaskVT,
16885 SDValue Res = DAG.getNode(ISD::INSERT_SUBVECTOR, dl, BitcastVT,
16886 DAG.getUNDEF(BitcastVT), CvtMask,
16887 DAG.getIntPtrConstant(0, dl));
16888 return DAG.getBitcast(Op.getValueType(), Res);
16890 case CONVERT_MASK_TO_VEC: {
16891 SDValue Mask = Op.getOperand(1);
16892 MVT MaskVT = MVT::getVectorVT(MVT::i1, VT.getVectorNumElements());
16893 SDValue VMask = getMaskNode(Mask, MaskVT, Subtarget, DAG, dl);
16894 return DAG.getNode(IntrData->Opc0, dl, VT, VMask);
16896 case BRCST_SUBVEC_TO_VEC: {
16897 SDValue Src = Op.getOperand(1);
16898 SDValue Passthru = Op.getOperand(2);
16899 SDValue Mask = Op.getOperand(3);
16900 EVT resVT = Passthru.getValueType();
16901 SDValue subVec = DAG.getNode(ISD::INSERT_SUBVECTOR, dl, resVT,
16902 DAG.getUNDEF(resVT), Src,
16903 DAG.getIntPtrConstant(0, dl));
16905 if (Src.getSimpleValueType().is256BitVector() && resVT.is512BitVector())
16906 immVal = DAG.getConstant(0x44, dl, MVT::i8);
16908 immVal = DAG.getConstant(0, dl, MVT::i8);
16909 return getVectorMaskingNode(DAG.getNode(IntrData->Opc0, dl, VT,
16910 subVec, subVec, immVal),
16911 Mask, Passthru, Subtarget, DAG);
16919 default: return SDValue(); // Don't custom lower most intrinsics.
16921 case Intrinsic::x86_avx2_permd:
16922 case Intrinsic::x86_avx2_permps:
16923 // Operands intentionally swapped. Mask is last operand to intrinsic,
16924 // but second operand for node/instruction.
16925 return DAG.getNode(X86ISD::VPERMV, dl, Op.getValueType(),
16926 Op.getOperand(2), Op.getOperand(1));
16928 // ptest and testp intrinsics. The intrinsic these come from are designed to
16929 // return an integer value, not just an instruction so lower it to the ptest
16930 // or testp pattern and a setcc for the result.
16931 case Intrinsic::x86_sse41_ptestz:
16932 case Intrinsic::x86_sse41_ptestc:
16933 case Intrinsic::x86_sse41_ptestnzc:
16934 case Intrinsic::x86_avx_ptestz_256:
16935 case Intrinsic::x86_avx_ptestc_256:
16936 case Intrinsic::x86_avx_ptestnzc_256:
16937 case Intrinsic::x86_avx_vtestz_ps:
16938 case Intrinsic::x86_avx_vtestc_ps:
16939 case Intrinsic::x86_avx_vtestnzc_ps:
16940 case Intrinsic::x86_avx_vtestz_pd:
16941 case Intrinsic::x86_avx_vtestc_pd:
16942 case Intrinsic::x86_avx_vtestnzc_pd:
16943 case Intrinsic::x86_avx_vtestz_ps_256:
16944 case Intrinsic::x86_avx_vtestc_ps_256:
16945 case Intrinsic::x86_avx_vtestnzc_ps_256:
16946 case Intrinsic::x86_avx_vtestz_pd_256:
16947 case Intrinsic::x86_avx_vtestc_pd_256:
16948 case Intrinsic::x86_avx_vtestnzc_pd_256: {
16949 bool IsTestPacked = false;
16952 default: llvm_unreachable("Bad fallthrough in Intrinsic lowering.");
16953 case Intrinsic::x86_avx_vtestz_ps:
16954 case Intrinsic::x86_avx_vtestz_pd:
16955 case Intrinsic::x86_avx_vtestz_ps_256:
16956 case Intrinsic::x86_avx_vtestz_pd_256:
16957 IsTestPacked = true; // Fallthrough
16958 case Intrinsic::x86_sse41_ptestz:
16959 case Intrinsic::x86_avx_ptestz_256:
16961 X86CC = X86::COND_E;
16963 case Intrinsic::x86_avx_vtestc_ps:
16964 case Intrinsic::x86_avx_vtestc_pd:
16965 case Intrinsic::x86_avx_vtestc_ps_256:
16966 case Intrinsic::x86_avx_vtestc_pd_256:
16967 IsTestPacked = true; // Fallthrough
16968 case Intrinsic::x86_sse41_ptestc:
16969 case Intrinsic::x86_avx_ptestc_256:
16971 X86CC = X86::COND_B;
16973 case Intrinsic::x86_avx_vtestnzc_ps:
16974 case Intrinsic::x86_avx_vtestnzc_pd:
16975 case Intrinsic::x86_avx_vtestnzc_ps_256:
16976 case Intrinsic::x86_avx_vtestnzc_pd_256:
16977 IsTestPacked = true; // Fallthrough
16978 case Intrinsic::x86_sse41_ptestnzc:
16979 case Intrinsic::x86_avx_ptestnzc_256:
16981 X86CC = X86::COND_A;
16985 SDValue LHS = Op.getOperand(1);
16986 SDValue RHS = Op.getOperand(2);
16987 unsigned TestOpc = IsTestPacked ? X86ISD::TESTP : X86ISD::PTEST;
16988 SDValue Test = DAG.getNode(TestOpc, dl, MVT::i32, LHS, RHS);
16989 SDValue CC = DAG.getConstant(X86CC, dl, MVT::i8);
16990 SDValue SetCC = DAG.getNode(X86ISD::SETCC, dl, MVT::i8, CC, Test);
16991 return DAG.getNode(ISD::ZERO_EXTEND, dl, MVT::i32, SetCC);
16993 case Intrinsic::x86_avx512_kortestz_w:
16994 case Intrinsic::x86_avx512_kortestc_w: {
16995 unsigned X86CC = (IntNo == Intrinsic::x86_avx512_kortestz_w)? X86::COND_E: X86::COND_B;
16996 SDValue LHS = DAG.getBitcast(MVT::v16i1, Op.getOperand(1));
16997 SDValue RHS = DAG.getBitcast(MVT::v16i1, Op.getOperand(2));
16998 SDValue CC = DAG.getConstant(X86CC, dl, MVT::i8);
16999 SDValue Test = DAG.getNode(X86ISD::KORTEST, dl, MVT::i32, LHS, RHS);
17000 SDValue SetCC = DAG.getNode(X86ISD::SETCC, dl, MVT::i1, CC, Test);
17001 return DAG.getNode(ISD::ZERO_EXTEND, dl, MVT::i32, SetCC);
17004 case Intrinsic::x86_sse42_pcmpistria128:
17005 case Intrinsic::x86_sse42_pcmpestria128:
17006 case Intrinsic::x86_sse42_pcmpistric128:
17007 case Intrinsic::x86_sse42_pcmpestric128:
17008 case Intrinsic::x86_sse42_pcmpistrio128:
17009 case Intrinsic::x86_sse42_pcmpestrio128:
17010 case Intrinsic::x86_sse42_pcmpistris128:
17011 case Intrinsic::x86_sse42_pcmpestris128:
17012 case Intrinsic::x86_sse42_pcmpistriz128:
17013 case Intrinsic::x86_sse42_pcmpestriz128: {
17017 default: llvm_unreachable("Impossible intrinsic"); // Can't reach here.
17018 case Intrinsic::x86_sse42_pcmpistria128:
17019 Opcode = X86ISD::PCMPISTRI;
17020 X86CC = X86::COND_A;
17022 case Intrinsic::x86_sse42_pcmpestria128:
17023 Opcode = X86ISD::PCMPESTRI;
17024 X86CC = X86::COND_A;
17026 case Intrinsic::x86_sse42_pcmpistric128:
17027 Opcode = X86ISD::PCMPISTRI;
17028 X86CC = X86::COND_B;
17030 case Intrinsic::x86_sse42_pcmpestric128:
17031 Opcode = X86ISD::PCMPESTRI;
17032 X86CC = X86::COND_B;
17034 case Intrinsic::x86_sse42_pcmpistrio128:
17035 Opcode = X86ISD::PCMPISTRI;
17036 X86CC = X86::COND_O;
17038 case Intrinsic::x86_sse42_pcmpestrio128:
17039 Opcode = X86ISD::PCMPESTRI;
17040 X86CC = X86::COND_O;
17042 case Intrinsic::x86_sse42_pcmpistris128:
17043 Opcode = X86ISD::PCMPISTRI;
17044 X86CC = X86::COND_S;
17046 case Intrinsic::x86_sse42_pcmpestris128:
17047 Opcode = X86ISD::PCMPESTRI;
17048 X86CC = X86::COND_S;
17050 case Intrinsic::x86_sse42_pcmpistriz128:
17051 Opcode = X86ISD::PCMPISTRI;
17052 X86CC = X86::COND_E;
17054 case Intrinsic::x86_sse42_pcmpestriz128:
17055 Opcode = X86ISD::PCMPESTRI;
17056 X86CC = X86::COND_E;
17059 SmallVector<SDValue, 5> NewOps(Op->op_begin()+1, Op->op_end());
17060 SDVTList VTs = DAG.getVTList(Op.getValueType(), MVT::i32);
17061 SDValue PCMP = DAG.getNode(Opcode, dl, VTs, NewOps);
17062 SDValue SetCC = DAG.getNode(X86ISD::SETCC, dl, MVT::i8,
17063 DAG.getConstant(X86CC, dl, MVT::i8),
17064 SDValue(PCMP.getNode(), 1));
17065 return DAG.getNode(ISD::ZERO_EXTEND, dl, MVT::i32, SetCC);
17068 case Intrinsic::x86_sse42_pcmpistri128:
17069 case Intrinsic::x86_sse42_pcmpestri128: {
17071 if (IntNo == Intrinsic::x86_sse42_pcmpistri128)
17072 Opcode = X86ISD::PCMPISTRI;
17074 Opcode = X86ISD::PCMPESTRI;
17076 SmallVector<SDValue, 5> NewOps(Op->op_begin()+1, Op->op_end());
17077 SDVTList VTs = DAG.getVTList(Op.getValueType(), MVT::i32);
17078 return DAG.getNode(Opcode, dl, VTs, NewOps);
17081 case Intrinsic::x86_seh_lsda: {
17082 // Compute the symbol for the LSDA. We know it'll get emitted later.
17083 MachineFunction &MF = DAG.getMachineFunction();
17084 SDValue Op1 = Op.getOperand(1);
17085 auto *Fn = cast<Function>(cast<GlobalAddressSDNode>(Op1)->getGlobal());
17086 MCSymbol *LSDASym = MF.getMMI().getContext().getOrCreateLSDASymbol(
17087 GlobalValue::getRealLinkageName(Fn->getName()));
17089 // Generate a simple absolute symbol reference. This intrinsic is only
17090 // supported on 32-bit Windows, which isn't PIC.
17091 SDValue Result = DAG.getMCSymbol(LSDASym, VT);
17092 return DAG.getNode(X86ISD::Wrapper, dl, VT, Result);
17095 case Intrinsic::x86_seh_recoverfp: {
17096 SDValue FnOp = Op.getOperand(1);
17097 SDValue IncomingFPOp = Op.getOperand(2);
17098 GlobalAddressSDNode *GSD = dyn_cast<GlobalAddressSDNode>(FnOp);
17099 auto *Fn = dyn_cast_or_null<Function>(GSD ? GSD->getGlobal() : nullptr);
17101 report_fatal_error(
17102 "llvm.x86.seh.recoverfp must take a function as the first argument");
17103 return recoverFramePointer(DAG, Fn, IncomingFPOp);
17106 case Intrinsic::localaddress: {
17107 // Returns one of the stack, base, or frame pointer registers, depending on
17108 // which is used to reference local variables.
17109 MachineFunction &MF = DAG.getMachineFunction();
17110 const X86RegisterInfo *RegInfo = Subtarget->getRegisterInfo();
17112 if (RegInfo->hasBasePointer(MF))
17113 Reg = RegInfo->getBaseRegister();
17114 else // This function handles the SP or FP case.
17115 Reg = RegInfo->getPtrSizedFrameRegister(MF);
17116 return DAG.getCopyFromReg(DAG.getEntryNode(), dl, Reg, VT);
17121 static SDValue getGatherNode(unsigned Opc, SDValue Op, SelectionDAG &DAG,
17122 SDValue Src, SDValue Mask, SDValue Base,
17123 SDValue Index, SDValue ScaleOp, SDValue Chain,
17124 const X86Subtarget * Subtarget) {
17126 auto *C = cast<ConstantSDNode>(ScaleOp);
17127 SDValue Scale = DAG.getTargetConstant(C->getZExtValue(), dl, MVT::i8);
17128 MVT MaskVT = MVT::getVectorVT(MVT::i1,
17129 Index.getSimpleValueType().getVectorNumElements());
17131 ConstantSDNode *MaskC = dyn_cast<ConstantSDNode>(Mask);
17133 MaskInReg = DAG.getTargetConstant(MaskC->getSExtValue(), dl, MaskVT);
17135 MVT BitcastVT = MVT::getVectorVT(MVT::i1,
17136 Mask.getSimpleValueType().getSizeInBits());
17138 // In case when MaskVT equals v2i1 or v4i1, low 2 or 4 elements
17139 // are extracted by EXTRACT_SUBVECTOR.
17140 MaskInReg = DAG.getNode(ISD::EXTRACT_SUBVECTOR, dl, MaskVT,
17141 DAG.getBitcast(BitcastVT, Mask),
17142 DAG.getIntPtrConstant(0, dl));
17144 SDVTList VTs = DAG.getVTList(Op.getValueType(), MaskVT, MVT::Other);
17145 SDValue Disp = DAG.getTargetConstant(0, dl, MVT::i32);
17146 SDValue Segment = DAG.getRegister(0, MVT::i32);
17147 if (Src.getOpcode() == ISD::UNDEF)
17148 Src = getZeroVector(Op.getSimpleValueType(), Subtarget, DAG, dl);
17149 SDValue Ops[] = {Src, MaskInReg, Base, Scale, Index, Disp, Segment, Chain};
17150 SDNode *Res = DAG.getMachineNode(Opc, dl, VTs, Ops);
17151 SDValue RetOps[] = { SDValue(Res, 0), SDValue(Res, 2) };
17152 return DAG.getMergeValues(RetOps, dl);
17155 static SDValue getScatterNode(unsigned Opc, SDValue Op, SelectionDAG &DAG,
17156 SDValue Src, SDValue Mask, SDValue Base,
17157 SDValue Index, SDValue ScaleOp, SDValue Chain) {
17159 auto *C = cast<ConstantSDNode>(ScaleOp);
17160 SDValue Scale = DAG.getTargetConstant(C->getZExtValue(), dl, MVT::i8);
17161 SDValue Disp = DAG.getTargetConstant(0, dl, MVT::i32);
17162 SDValue Segment = DAG.getRegister(0, MVT::i32);
17163 MVT MaskVT = MVT::getVectorVT(MVT::i1,
17164 Index.getSimpleValueType().getVectorNumElements());
17166 ConstantSDNode *MaskC = dyn_cast<ConstantSDNode>(Mask);
17168 MaskInReg = DAG.getTargetConstant(MaskC->getSExtValue(), dl, MaskVT);
17170 MVT BitcastVT = MVT::getVectorVT(MVT::i1,
17171 Mask.getSimpleValueType().getSizeInBits());
17173 // In case when MaskVT equals v2i1 or v4i1, low 2 or 4 elements
17174 // are extracted by EXTRACT_SUBVECTOR.
17175 MaskInReg = DAG.getNode(ISD::EXTRACT_SUBVECTOR, dl, MaskVT,
17176 DAG.getBitcast(BitcastVT, Mask),
17177 DAG.getIntPtrConstant(0, dl));
17179 SDVTList VTs = DAG.getVTList(MaskVT, MVT::Other);
17180 SDValue Ops[] = {Base, Scale, Index, Disp, Segment, MaskInReg, Src, Chain};
17181 SDNode *Res = DAG.getMachineNode(Opc, dl, VTs, Ops);
17182 return SDValue(Res, 1);
17185 static SDValue getPrefetchNode(unsigned Opc, SDValue Op, SelectionDAG &DAG,
17186 SDValue Mask, SDValue Base, SDValue Index,
17187 SDValue ScaleOp, SDValue Chain) {
17189 auto *C = cast<ConstantSDNode>(ScaleOp);
17190 SDValue Scale = DAG.getTargetConstant(C->getZExtValue(), dl, MVT::i8);
17191 SDValue Disp = DAG.getTargetConstant(0, dl, MVT::i32);
17192 SDValue Segment = DAG.getRegister(0, MVT::i32);
17194 MVT::getVectorVT(MVT::i1, Index.getSimpleValueType().getVectorNumElements());
17196 ConstantSDNode *MaskC = dyn_cast<ConstantSDNode>(Mask);
17198 MaskInReg = DAG.getTargetConstant(MaskC->getSExtValue(), dl, MaskVT);
17200 MaskInReg = DAG.getBitcast(MaskVT, Mask);
17201 //SDVTList VTs = DAG.getVTList(MVT::Other);
17202 SDValue Ops[] = {MaskInReg, Base, Scale, Index, Disp, Segment, Chain};
17203 SDNode *Res = DAG.getMachineNode(Opc, dl, MVT::Other, Ops);
17204 return SDValue(Res, 0);
17207 // getReadPerformanceCounter - Handles the lowering of builtin intrinsics that
17208 // read performance monitor counters (x86_rdpmc).
17209 static void getReadPerformanceCounter(SDNode *N, SDLoc DL,
17210 SelectionDAG &DAG, const X86Subtarget *Subtarget,
17211 SmallVectorImpl<SDValue> &Results) {
17212 assert(N->getNumOperands() == 3 && "Unexpected number of operands!");
17213 SDVTList Tys = DAG.getVTList(MVT::Other, MVT::Glue);
17216 // The ECX register is used to select the index of the performance counter
17218 SDValue Chain = DAG.getCopyToReg(N->getOperand(0), DL, X86::ECX,
17220 SDValue rd = DAG.getNode(X86ISD::RDPMC_DAG, DL, Tys, Chain);
17222 // Reads the content of a 64-bit performance counter and returns it in the
17223 // registers EDX:EAX.
17224 if (Subtarget->is64Bit()) {
17225 LO = DAG.getCopyFromReg(rd, DL, X86::RAX, MVT::i64, rd.getValue(1));
17226 HI = DAG.getCopyFromReg(LO.getValue(1), DL, X86::RDX, MVT::i64,
17229 LO = DAG.getCopyFromReg(rd, DL, X86::EAX, MVT::i32, rd.getValue(1));
17230 HI = DAG.getCopyFromReg(LO.getValue(1), DL, X86::EDX, MVT::i32,
17233 Chain = HI.getValue(1);
17235 if (Subtarget->is64Bit()) {
17236 // The EAX register is loaded with the low-order 32 bits. The EDX register
17237 // is loaded with the supported high-order bits of the counter.
17238 SDValue Tmp = DAG.getNode(ISD::SHL, DL, MVT::i64, HI,
17239 DAG.getConstant(32, DL, MVT::i8));
17240 Results.push_back(DAG.getNode(ISD::OR, DL, MVT::i64, LO, Tmp));
17241 Results.push_back(Chain);
17245 // Use a buildpair to merge the two 32-bit values into a 64-bit one.
17246 SDValue Ops[] = { LO, HI };
17247 SDValue Pair = DAG.getNode(ISD::BUILD_PAIR, DL, MVT::i64, Ops);
17248 Results.push_back(Pair);
17249 Results.push_back(Chain);
17252 // getReadTimeStampCounter - Handles the lowering of builtin intrinsics that
17253 // read the time stamp counter (x86_rdtsc and x86_rdtscp). This function is
17254 // also used to custom lower READCYCLECOUNTER nodes.
17255 static void getReadTimeStampCounter(SDNode *N, SDLoc DL, unsigned Opcode,
17256 SelectionDAG &DAG, const X86Subtarget *Subtarget,
17257 SmallVectorImpl<SDValue> &Results) {
17258 SDVTList Tys = DAG.getVTList(MVT::Other, MVT::Glue);
17259 SDValue rd = DAG.getNode(Opcode, DL, Tys, N->getOperand(0));
17262 // The processor's time-stamp counter (a 64-bit MSR) is stored into the
17263 // EDX:EAX registers. EDX is loaded with the high-order 32 bits of the MSR
17264 // and the EAX register is loaded with the low-order 32 bits.
17265 if (Subtarget->is64Bit()) {
17266 LO = DAG.getCopyFromReg(rd, DL, X86::RAX, MVT::i64, rd.getValue(1));
17267 HI = DAG.getCopyFromReg(LO.getValue(1), DL, X86::RDX, MVT::i64,
17270 LO = DAG.getCopyFromReg(rd, DL, X86::EAX, MVT::i32, rd.getValue(1));
17271 HI = DAG.getCopyFromReg(LO.getValue(1), DL, X86::EDX, MVT::i32,
17274 SDValue Chain = HI.getValue(1);
17276 if (Opcode == X86ISD::RDTSCP_DAG) {
17277 assert(N->getNumOperands() == 3 && "Unexpected number of operands!");
17279 // Instruction RDTSCP loads the IA32:TSC_AUX_MSR (address C000_0103H) into
17280 // the ECX register. Add 'ecx' explicitly to the chain.
17281 SDValue ecx = DAG.getCopyFromReg(Chain, DL, X86::ECX, MVT::i32,
17283 // Explicitly store the content of ECX at the location passed in input
17284 // to the 'rdtscp' intrinsic.
17285 Chain = DAG.getStore(ecx.getValue(1), DL, ecx, N->getOperand(2),
17286 MachinePointerInfo(), false, false, 0);
17289 if (Subtarget->is64Bit()) {
17290 // The EDX register is loaded with the high-order 32 bits of the MSR, and
17291 // the EAX register is loaded with the low-order 32 bits.
17292 SDValue Tmp = DAG.getNode(ISD::SHL, DL, MVT::i64, HI,
17293 DAG.getConstant(32, DL, MVT::i8));
17294 Results.push_back(DAG.getNode(ISD::OR, DL, MVT::i64, LO, Tmp));
17295 Results.push_back(Chain);
17299 // Use a buildpair to merge the two 32-bit values into a 64-bit one.
17300 SDValue Ops[] = { LO, HI };
17301 SDValue Pair = DAG.getNode(ISD::BUILD_PAIR, DL, MVT::i64, Ops);
17302 Results.push_back(Pair);
17303 Results.push_back(Chain);
17306 static SDValue LowerREADCYCLECOUNTER(SDValue Op, const X86Subtarget *Subtarget,
17307 SelectionDAG &DAG) {
17308 SmallVector<SDValue, 2> Results;
17310 getReadTimeStampCounter(Op.getNode(), DL, X86ISD::RDTSC_DAG, DAG, Subtarget,
17312 return DAG.getMergeValues(Results, DL);
17315 static SDValue MarkEHRegistrationNode(SDValue Op, SelectionDAG &DAG) {
17316 MachineFunction &MF = DAG.getMachineFunction();
17317 SDValue Chain = Op.getOperand(0);
17318 SDValue RegNode = Op.getOperand(2);
17319 WinEHFuncInfo *EHInfo = MF.getWinEHFuncInfo();
17321 report_fatal_error("EH registrations only live in functions using WinEH");
17323 // Cast the operand to an alloca, and remember the frame index.
17324 auto *FINode = dyn_cast<FrameIndexSDNode>(RegNode);
17326 report_fatal_error("llvm.x86.seh.ehregnode expects a static alloca");
17327 EHInfo->EHRegNodeFrameIndex = FINode->getIndex();
17329 // Return the chain operand without making any DAG nodes.
17333 /// \brief Lower intrinsics for TRUNCATE_TO_MEM case
17334 /// return truncate Store/MaskedStore Node
17335 static SDValue LowerINTRINSIC_TRUNCATE_TO_MEM(const SDValue & Op,
17339 SDValue Mask = Op.getOperand(4);
17340 SDValue DataToTruncate = Op.getOperand(3);
17341 SDValue Addr = Op.getOperand(2);
17342 SDValue Chain = Op.getOperand(0);
17344 MVT VT = DataToTruncate.getSimpleValueType();
17345 MVT SVT = MVT::getVectorVT(ElementType, VT.getVectorNumElements());
17347 if (isAllOnesConstant(Mask)) // return just a truncate store
17348 return DAG.getTruncStore(Chain, dl, DataToTruncate, Addr,
17349 MachinePointerInfo(), SVT, false, false,
17350 SVT.getScalarSizeInBits()/8);
17352 MVT MaskVT = MVT::getVectorVT(MVT::i1, VT.getVectorNumElements());
17353 MVT BitcastVT = MVT::getVectorVT(MVT::i1,
17354 Mask.getSimpleValueType().getSizeInBits());
17355 // In case when MaskVT equals v2i1 or v4i1, low 2 or 4 elements
17356 // are extracted by EXTRACT_SUBVECTOR.
17357 SDValue VMask = DAG.getNode(ISD::EXTRACT_SUBVECTOR, dl, MaskVT,
17358 DAG.getBitcast(BitcastVT, Mask),
17359 DAG.getIntPtrConstant(0, dl));
17361 MachineMemOperand *MMO = DAG.getMachineFunction().
17362 getMachineMemOperand(MachinePointerInfo(),
17363 MachineMemOperand::MOStore, SVT.getStoreSize(),
17364 SVT.getScalarSizeInBits()/8);
17366 return DAG.getMaskedStore(Chain, dl, DataToTruncate, Addr,
17367 VMask, SVT, MMO, true);
17370 static SDValue LowerINTRINSIC_W_CHAIN(SDValue Op, const X86Subtarget *Subtarget,
17371 SelectionDAG &DAG) {
17372 unsigned IntNo = cast<ConstantSDNode>(Op.getOperand(1))->getZExtValue();
17374 const IntrinsicData* IntrData = getIntrinsicWithChain(IntNo);
17376 if (IntNo == llvm::Intrinsic::x86_seh_ehregnode)
17377 return MarkEHRegistrationNode(Op, DAG);
17378 if (IntNo == llvm::Intrinsic::x86_flags_read_u32 ||
17379 IntNo == llvm::Intrinsic::x86_flags_read_u64 ||
17380 IntNo == llvm::Intrinsic::x86_flags_write_u32 ||
17381 IntNo == llvm::Intrinsic::x86_flags_write_u64) {
17382 // We need a frame pointer because this will get lowered to a PUSH/POP
17384 MachineFrameInfo *MFI = DAG.getMachineFunction().getFrameInfo();
17385 MFI->setHasOpaqueSPAdjustment(true);
17386 // Don't do anything here, we will expand these intrinsics out later
17387 // during ExpandISelPseudos in EmitInstrWithCustomInserter.
17394 switch(IntrData->Type) {
17395 default: llvm_unreachable("Unknown Intrinsic Type");
17398 // Emit the node with the right value type.
17399 SDVTList VTs = DAG.getVTList(Op->getValueType(0), MVT::Glue, MVT::Other);
17400 SDValue Result = DAG.getNode(IntrData->Opc0, dl, VTs, Op.getOperand(0));
17402 // If the value returned by RDRAND/RDSEED was valid (CF=1), return 1.
17403 // Otherwise return the value from Rand, which is always 0, casted to i32.
17404 SDValue Ops[] = { DAG.getZExtOrTrunc(Result, dl, Op->getValueType(1)),
17405 DAG.getConstant(1, dl, Op->getValueType(1)),
17406 DAG.getConstant(X86::COND_B, dl, MVT::i32),
17407 SDValue(Result.getNode(), 1) };
17408 SDValue isValid = DAG.getNode(X86ISD::CMOV, dl,
17409 DAG.getVTList(Op->getValueType(1), MVT::Glue),
17412 // Return { result, isValid, chain }.
17413 return DAG.getNode(ISD::MERGE_VALUES, dl, Op->getVTList(), Result, isValid,
17414 SDValue(Result.getNode(), 2));
17417 //gather(v1, mask, index, base, scale);
17418 SDValue Chain = Op.getOperand(0);
17419 SDValue Src = Op.getOperand(2);
17420 SDValue Base = Op.getOperand(3);
17421 SDValue Index = Op.getOperand(4);
17422 SDValue Mask = Op.getOperand(5);
17423 SDValue Scale = Op.getOperand(6);
17424 return getGatherNode(IntrData->Opc0, Op, DAG, Src, Mask, Base, Index, Scale,
17428 //scatter(base, mask, index, v1, scale);
17429 SDValue Chain = Op.getOperand(0);
17430 SDValue Base = Op.getOperand(2);
17431 SDValue Mask = Op.getOperand(3);
17432 SDValue Index = Op.getOperand(4);
17433 SDValue Src = Op.getOperand(5);
17434 SDValue Scale = Op.getOperand(6);
17435 return getScatterNode(IntrData->Opc0, Op, DAG, Src, Mask, Base, Index,
17439 SDValue Hint = Op.getOperand(6);
17440 unsigned HintVal = cast<ConstantSDNode>(Hint)->getZExtValue();
17441 assert(HintVal < 2 && "Wrong prefetch hint in intrinsic: should be 0 or 1");
17442 unsigned Opcode = (HintVal ? IntrData->Opc1 : IntrData->Opc0);
17443 SDValue Chain = Op.getOperand(0);
17444 SDValue Mask = Op.getOperand(2);
17445 SDValue Index = Op.getOperand(3);
17446 SDValue Base = Op.getOperand(4);
17447 SDValue Scale = Op.getOperand(5);
17448 return getPrefetchNode(Opcode, Op, DAG, Mask, Base, Index, Scale, Chain);
17450 // Read Time Stamp Counter (RDTSC) and Processor ID (RDTSCP).
17452 SmallVector<SDValue, 2> Results;
17453 getReadTimeStampCounter(Op.getNode(), dl, IntrData->Opc0, DAG, Subtarget,
17455 return DAG.getMergeValues(Results, dl);
17457 // Read Performance Monitoring Counters.
17459 SmallVector<SDValue, 2> Results;
17460 getReadPerformanceCounter(Op.getNode(), dl, DAG, Subtarget, Results);
17461 return DAG.getMergeValues(Results, dl);
17463 // XTEST intrinsics.
17465 SDVTList VTs = DAG.getVTList(Op->getValueType(0), MVT::Other);
17466 SDValue InTrans = DAG.getNode(IntrData->Opc0, dl, VTs, Op.getOperand(0));
17467 SDValue SetCC = DAG.getNode(X86ISD::SETCC, dl, MVT::i8,
17468 DAG.getConstant(X86::COND_NE, dl, MVT::i8),
17470 SDValue Ret = DAG.getNode(ISD::ZERO_EXTEND, dl, Op->getValueType(0), SetCC);
17471 return DAG.getNode(ISD::MERGE_VALUES, dl, Op->getVTList(),
17472 Ret, SDValue(InTrans.getNode(), 1));
17476 SmallVector<SDValue, 2> Results;
17477 SDVTList CFVTs = DAG.getVTList(Op->getValueType(0), MVT::Other);
17478 SDVTList VTs = DAG.getVTList(Op.getOperand(3)->getValueType(0), MVT::Other);
17479 SDValue GenCF = DAG.getNode(X86ISD::ADD, dl, CFVTs, Op.getOperand(2),
17480 DAG.getConstant(-1, dl, MVT::i8));
17481 SDValue Res = DAG.getNode(IntrData->Opc0, dl, VTs, Op.getOperand(3),
17482 Op.getOperand(4), GenCF.getValue(1));
17483 SDValue Store = DAG.getStore(Op.getOperand(0), dl, Res.getValue(0),
17484 Op.getOperand(5), MachinePointerInfo(),
17486 SDValue SetCC = DAG.getNode(X86ISD::SETCC, dl, MVT::i8,
17487 DAG.getConstant(X86::COND_B, dl, MVT::i8),
17489 Results.push_back(SetCC);
17490 Results.push_back(Store);
17491 return DAG.getMergeValues(Results, dl);
17493 case COMPRESS_TO_MEM: {
17495 SDValue Mask = Op.getOperand(4);
17496 SDValue DataToCompress = Op.getOperand(3);
17497 SDValue Addr = Op.getOperand(2);
17498 SDValue Chain = Op.getOperand(0);
17500 MVT VT = DataToCompress.getSimpleValueType();
17501 if (isAllOnesConstant(Mask)) // return just a store
17502 return DAG.getStore(Chain, dl, DataToCompress, Addr,
17503 MachinePointerInfo(), false, false,
17504 VT.getScalarSizeInBits()/8);
17506 SDValue Compressed =
17507 getVectorMaskingNode(DAG.getNode(IntrData->Opc0, dl, VT, DataToCompress),
17508 Mask, DAG.getUNDEF(VT), Subtarget, DAG);
17509 return DAG.getStore(Chain, dl, Compressed, Addr,
17510 MachinePointerInfo(), false, false,
17511 VT.getScalarSizeInBits()/8);
17513 case TRUNCATE_TO_MEM_VI8:
17514 return LowerINTRINSIC_TRUNCATE_TO_MEM(Op, DAG, MVT::i8);
17515 case TRUNCATE_TO_MEM_VI16:
17516 return LowerINTRINSIC_TRUNCATE_TO_MEM(Op, DAG, MVT::i16);
17517 case TRUNCATE_TO_MEM_VI32:
17518 return LowerINTRINSIC_TRUNCATE_TO_MEM(Op, DAG, MVT::i32);
17519 case EXPAND_FROM_MEM: {
17521 SDValue Mask = Op.getOperand(4);
17522 SDValue PassThru = Op.getOperand(3);
17523 SDValue Addr = Op.getOperand(2);
17524 SDValue Chain = Op.getOperand(0);
17525 MVT VT = Op.getSimpleValueType();
17527 if (isAllOnesConstant(Mask)) // return just a load
17528 return DAG.getLoad(VT, dl, Chain, Addr, MachinePointerInfo(), false, false,
17529 false, VT.getScalarSizeInBits()/8);
17531 SDValue DataToExpand = DAG.getLoad(VT, dl, Chain, Addr, MachinePointerInfo(),
17532 false, false, false,
17533 VT.getScalarSizeInBits()/8);
17535 SDValue Results[] = {
17536 getVectorMaskingNode(DAG.getNode(IntrData->Opc0, dl, VT, DataToExpand),
17537 Mask, PassThru, Subtarget, DAG), Chain};
17538 return DAG.getMergeValues(Results, dl);
17543 SDValue X86TargetLowering::LowerRETURNADDR(SDValue Op,
17544 SelectionDAG &DAG) const {
17545 MachineFrameInfo *MFI = DAG.getMachineFunction().getFrameInfo();
17546 MFI->setReturnAddressIsTaken(true);
17548 if (verifyReturnAddressArgumentIsConstant(Op, DAG))
17551 unsigned Depth = cast<ConstantSDNode>(Op.getOperand(0))->getZExtValue();
17553 EVT PtrVT = getPointerTy(DAG.getDataLayout());
17556 SDValue FrameAddr = LowerFRAMEADDR(Op, DAG);
17557 const X86RegisterInfo *RegInfo = Subtarget->getRegisterInfo();
17558 SDValue Offset = DAG.getConstant(RegInfo->getSlotSize(), dl, PtrVT);
17559 return DAG.getLoad(PtrVT, dl, DAG.getEntryNode(),
17560 DAG.getNode(ISD::ADD, dl, PtrVT,
17561 FrameAddr, Offset),
17562 MachinePointerInfo(), false, false, false, 0);
17565 // Just load the return address.
17566 SDValue RetAddrFI = getReturnAddressFrameIndex(DAG);
17567 return DAG.getLoad(PtrVT, dl, DAG.getEntryNode(),
17568 RetAddrFI, MachinePointerInfo(), false, false, false, 0);
17571 SDValue X86TargetLowering::LowerFRAMEADDR(SDValue Op, SelectionDAG &DAG) const {
17572 MachineFunction &MF = DAG.getMachineFunction();
17573 MachineFrameInfo *MFI = MF.getFrameInfo();
17574 X86MachineFunctionInfo *FuncInfo = MF.getInfo<X86MachineFunctionInfo>();
17575 const X86RegisterInfo *RegInfo = Subtarget->getRegisterInfo();
17576 EVT VT = Op.getValueType();
17578 MFI->setFrameAddressIsTaken(true);
17580 if (MF.getTarget().getMCAsmInfo()->usesWindowsCFI()) {
17581 // Depth > 0 makes no sense on targets which use Windows unwind codes. It
17582 // is not possible to crawl up the stack without looking at the unwind codes
17584 int FrameAddrIndex = FuncInfo->getFAIndex();
17585 if (!FrameAddrIndex) {
17586 // Set up a frame object for the return address.
17587 unsigned SlotSize = RegInfo->getSlotSize();
17588 FrameAddrIndex = MF.getFrameInfo()->CreateFixedObject(
17589 SlotSize, /*Offset=*/0, /*IsImmutable=*/false);
17590 FuncInfo->setFAIndex(FrameAddrIndex);
17592 return DAG.getFrameIndex(FrameAddrIndex, VT);
17595 unsigned FrameReg =
17596 RegInfo->getPtrSizedFrameRegister(DAG.getMachineFunction());
17597 SDLoc dl(Op); // FIXME probably not meaningful
17598 unsigned Depth = cast<ConstantSDNode>(Op.getOperand(0))->getZExtValue();
17599 assert(((FrameReg == X86::RBP && VT == MVT::i64) ||
17600 (FrameReg == X86::EBP && VT == MVT::i32)) &&
17601 "Invalid Frame Register!");
17602 SDValue FrameAddr = DAG.getCopyFromReg(DAG.getEntryNode(), dl, FrameReg, VT);
17604 FrameAddr = DAG.getLoad(VT, dl, DAG.getEntryNode(), FrameAddr,
17605 MachinePointerInfo(),
17606 false, false, false, 0);
17610 // FIXME? Maybe this could be a TableGen attribute on some registers and
17611 // this table could be generated automatically from RegInfo.
17612 unsigned X86TargetLowering::getRegisterByName(const char* RegName, EVT VT,
17613 SelectionDAG &DAG) const {
17614 const TargetFrameLowering &TFI = *Subtarget->getFrameLowering();
17615 const MachineFunction &MF = DAG.getMachineFunction();
17617 unsigned Reg = StringSwitch<unsigned>(RegName)
17618 .Case("esp", X86::ESP)
17619 .Case("rsp", X86::RSP)
17620 .Case("ebp", X86::EBP)
17621 .Case("rbp", X86::RBP)
17624 if (Reg == X86::EBP || Reg == X86::RBP) {
17625 if (!TFI.hasFP(MF))
17626 report_fatal_error("register " + StringRef(RegName) +
17627 " is allocatable: function has no frame pointer");
17630 const X86RegisterInfo *RegInfo = Subtarget->getRegisterInfo();
17631 unsigned FrameReg =
17632 RegInfo->getPtrSizedFrameRegister(DAG.getMachineFunction());
17633 assert((FrameReg == X86::EBP || FrameReg == X86::RBP) &&
17634 "Invalid Frame Register!");
17642 report_fatal_error("Invalid register name global variable");
17645 SDValue X86TargetLowering::LowerFRAME_TO_ARGS_OFFSET(SDValue Op,
17646 SelectionDAG &DAG) const {
17647 const X86RegisterInfo *RegInfo = Subtarget->getRegisterInfo();
17648 return DAG.getIntPtrConstant(2 * RegInfo->getSlotSize(), SDLoc(Op));
17651 unsigned X86TargetLowering::getExceptionPointerRegister(
17652 const Constant *PersonalityFn) const {
17653 if (classifyEHPersonality(PersonalityFn) == EHPersonality::CoreCLR)
17654 return Subtarget->isTarget64BitLP64() ? X86::RDX : X86::EDX;
17656 return Subtarget->isTarget64BitLP64() ? X86::RAX : X86::EAX;
17659 unsigned X86TargetLowering::getExceptionSelectorRegister(
17660 const Constant *PersonalityFn) const {
17661 // Funclet personalities don't use selectors (the runtime does the selection).
17662 assert(!isFuncletEHPersonality(classifyEHPersonality(PersonalityFn)));
17663 return Subtarget->isTarget64BitLP64() ? X86::RDX : X86::EDX;
17666 SDValue X86TargetLowering::LowerEH_RETURN(SDValue Op, SelectionDAG &DAG) const {
17667 SDValue Chain = Op.getOperand(0);
17668 SDValue Offset = Op.getOperand(1);
17669 SDValue Handler = Op.getOperand(2);
17672 EVT PtrVT = getPointerTy(DAG.getDataLayout());
17673 const X86RegisterInfo *RegInfo = Subtarget->getRegisterInfo();
17674 unsigned FrameReg = RegInfo->getFrameRegister(DAG.getMachineFunction());
17675 assert(((FrameReg == X86::RBP && PtrVT == MVT::i64) ||
17676 (FrameReg == X86::EBP && PtrVT == MVT::i32)) &&
17677 "Invalid Frame Register!");
17678 SDValue Frame = DAG.getCopyFromReg(DAG.getEntryNode(), dl, FrameReg, PtrVT);
17679 unsigned StoreAddrReg = (PtrVT == MVT::i64) ? X86::RCX : X86::ECX;
17681 SDValue StoreAddr = DAG.getNode(ISD::ADD, dl, PtrVT, Frame,
17682 DAG.getIntPtrConstant(RegInfo->getSlotSize(),
17684 StoreAddr = DAG.getNode(ISD::ADD, dl, PtrVT, StoreAddr, Offset);
17685 Chain = DAG.getStore(Chain, dl, Handler, StoreAddr, MachinePointerInfo(),
17687 Chain = DAG.getCopyToReg(Chain, dl, StoreAddrReg, StoreAddr);
17689 return DAG.getNode(X86ISD::EH_RETURN, dl, MVT::Other, Chain,
17690 DAG.getRegister(StoreAddrReg, PtrVT));
17693 SDValue X86TargetLowering::lowerEH_SJLJ_SETJMP(SDValue Op,
17694 SelectionDAG &DAG) const {
17696 return DAG.getNode(X86ISD::EH_SJLJ_SETJMP, DL,
17697 DAG.getVTList(MVT::i32, MVT::Other),
17698 Op.getOperand(0), Op.getOperand(1));
17701 SDValue X86TargetLowering::lowerEH_SJLJ_LONGJMP(SDValue Op,
17702 SelectionDAG &DAG) const {
17704 return DAG.getNode(X86ISD::EH_SJLJ_LONGJMP, DL, MVT::Other,
17705 Op.getOperand(0), Op.getOperand(1));
17708 static SDValue LowerADJUST_TRAMPOLINE(SDValue Op, SelectionDAG &DAG) {
17709 return Op.getOperand(0);
17712 SDValue X86TargetLowering::LowerINIT_TRAMPOLINE(SDValue Op,
17713 SelectionDAG &DAG) const {
17714 SDValue Root = Op.getOperand(0);
17715 SDValue Trmp = Op.getOperand(1); // trampoline
17716 SDValue FPtr = Op.getOperand(2); // nested function
17717 SDValue Nest = Op.getOperand(3); // 'nest' parameter value
17720 const Value *TrmpAddr = cast<SrcValueSDNode>(Op.getOperand(4))->getValue();
17721 const TargetRegisterInfo *TRI = Subtarget->getRegisterInfo();
17723 if (Subtarget->is64Bit()) {
17724 SDValue OutChains[6];
17726 // Large code-model.
17727 const unsigned char JMP64r = 0xFF; // 64-bit jmp through register opcode.
17728 const unsigned char MOV64ri = 0xB8; // X86::MOV64ri opcode.
17730 const unsigned char N86R10 = TRI->getEncodingValue(X86::R10) & 0x7;
17731 const unsigned char N86R11 = TRI->getEncodingValue(X86::R11) & 0x7;
17733 const unsigned char REX_WB = 0x40 | 0x08 | 0x01; // REX prefix
17735 // Load the pointer to the nested function into R11.
17736 unsigned OpCode = ((MOV64ri | N86R11) << 8) | REX_WB; // movabsq r11
17737 SDValue Addr = Trmp;
17738 OutChains[0] = DAG.getStore(Root, dl, DAG.getConstant(OpCode, dl, MVT::i16),
17739 Addr, MachinePointerInfo(TrmpAddr),
17742 Addr = DAG.getNode(ISD::ADD, dl, MVT::i64, Trmp,
17743 DAG.getConstant(2, dl, MVT::i64));
17744 OutChains[1] = DAG.getStore(Root, dl, FPtr, Addr,
17745 MachinePointerInfo(TrmpAddr, 2),
17748 // Load the 'nest' parameter value into R10.
17749 // R10 is specified in X86CallingConv.td
17750 OpCode = ((MOV64ri | N86R10) << 8) | REX_WB; // movabsq r10
17751 Addr = DAG.getNode(ISD::ADD, dl, MVT::i64, Trmp,
17752 DAG.getConstant(10, dl, MVT::i64));
17753 OutChains[2] = DAG.getStore(Root, dl, DAG.getConstant(OpCode, dl, MVT::i16),
17754 Addr, MachinePointerInfo(TrmpAddr, 10),
17757 Addr = DAG.getNode(ISD::ADD, dl, MVT::i64, Trmp,
17758 DAG.getConstant(12, dl, MVT::i64));
17759 OutChains[3] = DAG.getStore(Root, dl, Nest, Addr,
17760 MachinePointerInfo(TrmpAddr, 12),
17763 // Jump to the nested function.
17764 OpCode = (JMP64r << 8) | REX_WB; // jmpq *...
17765 Addr = DAG.getNode(ISD::ADD, dl, MVT::i64, Trmp,
17766 DAG.getConstant(20, dl, MVT::i64));
17767 OutChains[4] = DAG.getStore(Root, dl, DAG.getConstant(OpCode, dl, MVT::i16),
17768 Addr, MachinePointerInfo(TrmpAddr, 20),
17771 unsigned char ModRM = N86R11 | (4 << 3) | (3 << 6); // ...r11
17772 Addr = DAG.getNode(ISD::ADD, dl, MVT::i64, Trmp,
17773 DAG.getConstant(22, dl, MVT::i64));
17774 OutChains[5] = DAG.getStore(Root, dl, DAG.getConstant(ModRM, dl, MVT::i8),
17775 Addr, MachinePointerInfo(TrmpAddr, 22),
17778 return DAG.getNode(ISD::TokenFactor, dl, MVT::Other, OutChains);
17780 const Function *Func =
17781 cast<Function>(cast<SrcValueSDNode>(Op.getOperand(5))->getValue());
17782 CallingConv::ID CC = Func->getCallingConv();
17787 llvm_unreachable("Unsupported calling convention");
17788 case CallingConv::C:
17789 case CallingConv::X86_StdCall: {
17790 // Pass 'nest' parameter in ECX.
17791 // Must be kept in sync with X86CallingConv.td
17792 NestReg = X86::ECX;
17794 // Check that ECX wasn't needed by an 'inreg' parameter.
17795 FunctionType *FTy = Func->getFunctionType();
17796 const AttributeSet &Attrs = Func->getAttributes();
17798 if (!Attrs.isEmpty() && !Func->isVarArg()) {
17799 unsigned InRegCount = 0;
17802 for (FunctionType::param_iterator I = FTy->param_begin(),
17803 E = FTy->param_end(); I != E; ++I, ++Idx)
17804 if (Attrs.hasAttribute(Idx, Attribute::InReg)) {
17805 auto &DL = DAG.getDataLayout();
17806 // FIXME: should only count parameters that are lowered to integers.
17807 InRegCount += (DL.getTypeSizeInBits(*I) + 31) / 32;
17810 if (InRegCount > 2) {
17811 report_fatal_error("Nest register in use - reduce number of inreg"
17817 case CallingConv::X86_FastCall:
17818 case CallingConv::X86_ThisCall:
17819 case CallingConv::Fast:
17820 // Pass 'nest' parameter in EAX.
17821 // Must be kept in sync with X86CallingConv.td
17822 NestReg = X86::EAX;
17826 SDValue OutChains[4];
17827 SDValue Addr, Disp;
17829 Addr = DAG.getNode(ISD::ADD, dl, MVT::i32, Trmp,
17830 DAG.getConstant(10, dl, MVT::i32));
17831 Disp = DAG.getNode(ISD::SUB, dl, MVT::i32, FPtr, Addr);
17833 // This is storing the opcode for MOV32ri.
17834 const unsigned char MOV32ri = 0xB8; // X86::MOV32ri's opcode byte.
17835 const unsigned char N86Reg = TRI->getEncodingValue(NestReg) & 0x7;
17836 OutChains[0] = DAG.getStore(Root, dl,
17837 DAG.getConstant(MOV32ri|N86Reg, dl, MVT::i8),
17838 Trmp, MachinePointerInfo(TrmpAddr),
17841 Addr = DAG.getNode(ISD::ADD, dl, MVT::i32, Trmp,
17842 DAG.getConstant(1, dl, MVT::i32));
17843 OutChains[1] = DAG.getStore(Root, dl, Nest, Addr,
17844 MachinePointerInfo(TrmpAddr, 1),
17847 const unsigned char JMP = 0xE9; // jmp <32bit dst> opcode.
17848 Addr = DAG.getNode(ISD::ADD, dl, MVT::i32, Trmp,
17849 DAG.getConstant(5, dl, MVT::i32));
17850 OutChains[2] = DAG.getStore(Root, dl, DAG.getConstant(JMP, dl, MVT::i8),
17851 Addr, MachinePointerInfo(TrmpAddr, 5),
17854 Addr = DAG.getNode(ISD::ADD, dl, MVT::i32, Trmp,
17855 DAG.getConstant(6, dl, MVT::i32));
17856 OutChains[3] = DAG.getStore(Root, dl, Disp, Addr,
17857 MachinePointerInfo(TrmpAddr, 6),
17860 return DAG.getNode(ISD::TokenFactor, dl, MVT::Other, OutChains);
17864 SDValue X86TargetLowering::LowerFLT_ROUNDS_(SDValue Op,
17865 SelectionDAG &DAG) const {
17867 The rounding mode is in bits 11:10 of FPSR, and has the following
17869 00 Round to nearest
17874 FLT_ROUNDS, on the other hand, expects the following:
17881 To perform the conversion, we do:
17882 (((((FPSR & 0x800) >> 11) | ((FPSR & 0x400) >> 9)) + 1) & 3)
17885 MachineFunction &MF = DAG.getMachineFunction();
17886 const TargetFrameLowering &TFI = *Subtarget->getFrameLowering();
17887 unsigned StackAlignment = TFI.getStackAlignment();
17888 MVT VT = Op.getSimpleValueType();
17891 // Save FP Control Word to stack slot
17892 int SSFI = MF.getFrameInfo()->CreateStackObject(2, StackAlignment, false);
17893 SDValue StackSlot =
17894 DAG.getFrameIndex(SSFI, getPointerTy(DAG.getDataLayout()));
17896 MachineMemOperand *MMO =
17897 MF.getMachineMemOperand(MachinePointerInfo::getFixedStack(MF, SSFI),
17898 MachineMemOperand::MOStore, 2, 2);
17900 SDValue Ops[] = { DAG.getEntryNode(), StackSlot };
17901 SDValue Chain = DAG.getMemIntrinsicNode(X86ISD::FNSTCW16m, DL,
17902 DAG.getVTList(MVT::Other),
17903 Ops, MVT::i16, MMO);
17905 // Load FP Control Word from stack slot
17906 SDValue CWD = DAG.getLoad(MVT::i16, DL, Chain, StackSlot,
17907 MachinePointerInfo(), false, false, false, 0);
17909 // Transform as necessary
17911 DAG.getNode(ISD::SRL, DL, MVT::i16,
17912 DAG.getNode(ISD::AND, DL, MVT::i16,
17913 CWD, DAG.getConstant(0x800, DL, MVT::i16)),
17914 DAG.getConstant(11, DL, MVT::i8));
17916 DAG.getNode(ISD::SRL, DL, MVT::i16,
17917 DAG.getNode(ISD::AND, DL, MVT::i16,
17918 CWD, DAG.getConstant(0x400, DL, MVT::i16)),
17919 DAG.getConstant(9, DL, MVT::i8));
17922 DAG.getNode(ISD::AND, DL, MVT::i16,
17923 DAG.getNode(ISD::ADD, DL, MVT::i16,
17924 DAG.getNode(ISD::OR, DL, MVT::i16, CWD1, CWD2),
17925 DAG.getConstant(1, DL, MVT::i16)),
17926 DAG.getConstant(3, DL, MVT::i16));
17928 return DAG.getNode((VT.getSizeInBits() < 16 ?
17929 ISD::TRUNCATE : ISD::ZERO_EXTEND), DL, VT, RetVal);
17932 /// \brief Lower a vector CTLZ using native supported vector CTLZ instruction.
17934 // 1. i32/i64 128/256-bit vector (native support require VLX) are expended
17935 // to 512-bit vector.
17936 // 2. i8/i16 vector implemented using dword LZCNT vector instruction
17937 // ( sub(trunc(lzcnt(zext32(x)))) ). In case zext32(x) is illegal,
17938 // split the vector, perform operation on it's Lo a Hi part and
17939 // concatenate the results.
17940 static SDValue LowerVectorCTLZ_AVX512(SDValue Op, SelectionDAG &DAG) {
17942 MVT VT = Op.getSimpleValueType();
17943 MVT EltVT = VT.getVectorElementType();
17944 unsigned NumElems = VT.getVectorNumElements();
17946 if (EltVT == MVT::i64 || EltVT == MVT::i32) {
17947 // Extend to 512 bit vector.
17948 assert((VT.is256BitVector() || VT.is128BitVector()) &&
17949 "Unsupported value type for operation");
17951 MVT NewVT = MVT::getVectorVT(EltVT, 512 / VT.getScalarSizeInBits());
17952 SDValue Vec512 = DAG.getNode(ISD::INSERT_SUBVECTOR, dl, NewVT,
17953 DAG.getUNDEF(NewVT),
17955 DAG.getIntPtrConstant(0, dl));
17956 SDValue CtlzNode = DAG.getNode(ISD::CTLZ, dl, NewVT, Vec512);
17958 return DAG.getNode(ISD::EXTRACT_SUBVECTOR, dl, VT, CtlzNode,
17959 DAG.getIntPtrConstant(0, dl));
17962 assert((EltVT == MVT::i8 || EltVT == MVT::i16) &&
17963 "Unsupported element type");
17965 if (16 < NumElems) {
17966 // Split vector, it's Lo and Hi parts will be handled in next iteration.
17968 std::tie(Lo, Hi) = DAG.SplitVector(Op.getOperand(0), dl);
17969 MVT OutVT = MVT::getVectorVT(EltVT, NumElems/2);
17971 Lo = DAG.getNode(Op.getOpcode(), dl, OutVT, Lo);
17972 Hi = DAG.getNode(Op.getOpcode(), dl, OutVT, Hi);
17974 return DAG.getNode(ISD::CONCAT_VECTORS, dl, VT, Lo, Hi);
17977 MVT NewVT = MVT::getVectorVT(MVT::i32, NumElems);
17979 assert((NewVT.is256BitVector() || NewVT.is512BitVector()) &&
17980 "Unsupported value type for operation");
17982 // Use native supported vector instruction vplzcntd.
17983 Op = DAG.getNode(ISD::ZERO_EXTEND, dl, NewVT, Op.getOperand(0));
17984 SDValue CtlzNode = DAG.getNode(ISD::CTLZ, dl, NewVT, Op);
17985 SDValue TruncNode = DAG.getNode(ISD::TRUNCATE, dl, VT, CtlzNode);
17986 SDValue Delta = DAG.getConstant(32 - EltVT.getSizeInBits(), dl, VT);
17988 return DAG.getNode(ISD::SUB, dl, VT, TruncNode, Delta);
17991 static SDValue LowerCTLZ(SDValue Op, const X86Subtarget *Subtarget,
17992 SelectionDAG &DAG) {
17993 MVT VT = Op.getSimpleValueType();
17995 unsigned NumBits = VT.getSizeInBits();
17998 if (VT.isVector() && Subtarget->hasAVX512())
17999 return LowerVectorCTLZ_AVX512(Op, DAG);
18001 Op = Op.getOperand(0);
18002 if (VT == MVT::i8) {
18003 // Zero extend to i32 since there is not an i8 bsr.
18005 Op = DAG.getNode(ISD::ZERO_EXTEND, dl, OpVT, Op);
18008 // Issue a bsr (scan bits in reverse) which also sets EFLAGS.
18009 SDVTList VTs = DAG.getVTList(OpVT, MVT::i32);
18010 Op = DAG.getNode(X86ISD::BSR, dl, VTs, Op);
18012 // If src is zero (i.e. bsr sets ZF), returns NumBits.
18015 DAG.getConstant(NumBits + NumBits - 1, dl, OpVT),
18016 DAG.getConstant(X86::COND_E, dl, MVT::i8),
18019 Op = DAG.getNode(X86ISD::CMOV, dl, OpVT, Ops);
18021 // Finally xor with NumBits-1.
18022 Op = DAG.getNode(ISD::XOR, dl, OpVT, Op,
18023 DAG.getConstant(NumBits - 1, dl, OpVT));
18026 Op = DAG.getNode(ISD::TRUNCATE, dl, MVT::i8, Op);
18030 static SDValue LowerCTLZ_ZERO_UNDEF(SDValue Op, const X86Subtarget *Subtarget,
18031 SelectionDAG &DAG) {
18032 MVT VT = Op.getSimpleValueType();
18034 unsigned NumBits = VT.getSizeInBits();
18037 Op = Op.getOperand(0);
18038 if (VT == MVT::i8) {
18039 // Zero extend to i32 since there is not an i8 bsr.
18041 Op = DAG.getNode(ISD::ZERO_EXTEND, dl, OpVT, Op);
18044 // Issue a bsr (scan bits in reverse).
18045 SDVTList VTs = DAG.getVTList(OpVT, MVT::i32);
18046 Op = DAG.getNode(X86ISD::BSR, dl, VTs, Op);
18048 // And xor with NumBits-1.
18049 Op = DAG.getNode(ISD::XOR, dl, OpVT, Op,
18050 DAG.getConstant(NumBits - 1, dl, OpVT));
18053 Op = DAG.getNode(ISD::TRUNCATE, dl, MVT::i8, Op);
18057 static SDValue LowerCTTZ(SDValue Op, SelectionDAG &DAG) {
18058 MVT VT = Op.getSimpleValueType();
18059 unsigned NumBits = VT.getScalarSizeInBits();
18062 if (VT.isVector()) {
18063 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
18065 SDValue N0 = Op.getOperand(0);
18066 SDValue Zero = DAG.getConstant(0, dl, VT);
18068 // lsb(x) = (x & -x)
18069 SDValue LSB = DAG.getNode(ISD::AND, dl, VT, N0,
18070 DAG.getNode(ISD::SUB, dl, VT, Zero, N0));
18072 // cttz_undef(x) = (width - 1) - ctlz(lsb)
18073 if (Op.getOpcode() == ISD::CTTZ_ZERO_UNDEF &&
18074 TLI.isOperationLegal(ISD::CTLZ, VT)) {
18075 SDValue WidthMinusOne = DAG.getConstant(NumBits - 1, dl, VT);
18076 return DAG.getNode(ISD::SUB, dl, VT, WidthMinusOne,
18077 DAG.getNode(ISD::CTLZ, dl, VT, LSB));
18080 // cttz(x) = ctpop(lsb - 1)
18081 SDValue One = DAG.getConstant(1, dl, VT);
18082 return DAG.getNode(ISD::CTPOP, dl, VT,
18083 DAG.getNode(ISD::SUB, dl, VT, LSB, One));
18086 assert(Op.getOpcode() == ISD::CTTZ &&
18087 "Only scalar CTTZ requires custom lowering");
18089 // Issue a bsf (scan bits forward) which also sets EFLAGS.
18090 SDVTList VTs = DAG.getVTList(VT, MVT::i32);
18091 Op = DAG.getNode(X86ISD::BSF, dl, VTs, Op.getOperand(0));
18093 // If src is zero (i.e. bsf sets ZF), returns NumBits.
18096 DAG.getConstant(NumBits, dl, VT),
18097 DAG.getConstant(X86::COND_E, dl, MVT::i8),
18100 return DAG.getNode(X86ISD::CMOV, dl, VT, Ops);
18103 // Lower256IntArith - Break a 256-bit integer operation into two new 128-bit
18104 // ones, and then concatenate the result back.
18105 static SDValue Lower256IntArith(SDValue Op, SelectionDAG &DAG) {
18106 MVT VT = Op.getSimpleValueType();
18108 assert(VT.is256BitVector() && VT.isInteger() &&
18109 "Unsupported value type for operation");
18111 unsigned NumElems = VT.getVectorNumElements();
18114 // Extract the LHS vectors
18115 SDValue LHS = Op.getOperand(0);
18116 SDValue LHS1 = Extract128BitVector(LHS, 0, DAG, dl);
18117 SDValue LHS2 = Extract128BitVector(LHS, NumElems/2, DAG, dl);
18119 // Extract the RHS vectors
18120 SDValue RHS = Op.getOperand(1);
18121 SDValue RHS1 = Extract128BitVector(RHS, 0, DAG, dl);
18122 SDValue RHS2 = Extract128BitVector(RHS, NumElems/2, DAG, dl);
18124 MVT EltVT = VT.getVectorElementType();
18125 MVT NewVT = MVT::getVectorVT(EltVT, NumElems/2);
18127 return DAG.getNode(ISD::CONCAT_VECTORS, dl, VT,
18128 DAG.getNode(Op.getOpcode(), dl, NewVT, LHS1, RHS1),
18129 DAG.getNode(Op.getOpcode(), dl, NewVT, LHS2, RHS2));
18132 static SDValue LowerADD(SDValue Op, SelectionDAG &DAG) {
18133 if (Op.getValueType() == MVT::i1)
18134 return DAG.getNode(ISD::XOR, SDLoc(Op), Op.getValueType(),
18135 Op.getOperand(0), Op.getOperand(1));
18136 assert(Op.getSimpleValueType().is256BitVector() &&
18137 Op.getSimpleValueType().isInteger() &&
18138 "Only handle AVX 256-bit vector integer operation");
18139 return Lower256IntArith(Op, DAG);
18142 static SDValue LowerSUB(SDValue Op, SelectionDAG &DAG) {
18143 if (Op.getValueType() == MVT::i1)
18144 return DAG.getNode(ISD::XOR, SDLoc(Op), Op.getValueType(),
18145 Op.getOperand(0), Op.getOperand(1));
18146 assert(Op.getSimpleValueType().is256BitVector() &&
18147 Op.getSimpleValueType().isInteger() &&
18148 "Only handle AVX 256-bit vector integer operation");
18149 return Lower256IntArith(Op, DAG);
18152 static SDValue LowerMINMAX(SDValue Op, SelectionDAG &DAG) {
18153 assert(Op.getSimpleValueType().is256BitVector() &&
18154 Op.getSimpleValueType().isInteger() &&
18155 "Only handle AVX 256-bit vector integer operation");
18156 return Lower256IntArith(Op, DAG);
18159 static SDValue LowerMUL(SDValue Op, const X86Subtarget *Subtarget,
18160 SelectionDAG &DAG) {
18162 MVT VT = Op.getSimpleValueType();
18165 return DAG.getNode(ISD::AND, dl, VT, Op.getOperand(0), Op.getOperand(1));
18167 // Decompose 256-bit ops into smaller 128-bit ops.
18168 if (VT.is256BitVector() && !Subtarget->hasInt256())
18169 return Lower256IntArith(Op, DAG);
18171 SDValue A = Op.getOperand(0);
18172 SDValue B = Op.getOperand(1);
18174 // Lower v16i8/v32i8 mul as promotion to v8i16/v16i16 vector
18175 // pairs, multiply and truncate.
18176 if (VT == MVT::v16i8 || VT == MVT::v32i8) {
18177 if (Subtarget->hasInt256()) {
18178 if (VT == MVT::v32i8) {
18179 MVT SubVT = MVT::getVectorVT(MVT::i8, VT.getVectorNumElements() / 2);
18180 SDValue Lo = DAG.getIntPtrConstant(0, dl);
18181 SDValue Hi = DAG.getIntPtrConstant(VT.getVectorNumElements() / 2, dl);
18182 SDValue ALo = DAG.getNode(ISD::EXTRACT_SUBVECTOR, dl, SubVT, A, Lo);
18183 SDValue BLo = DAG.getNode(ISD::EXTRACT_SUBVECTOR, dl, SubVT, B, Lo);
18184 SDValue AHi = DAG.getNode(ISD::EXTRACT_SUBVECTOR, dl, SubVT, A, Hi);
18185 SDValue BHi = DAG.getNode(ISD::EXTRACT_SUBVECTOR, dl, SubVT, B, Hi);
18186 return DAG.getNode(ISD::CONCAT_VECTORS, dl, VT,
18187 DAG.getNode(ISD::MUL, dl, SubVT, ALo, BLo),
18188 DAG.getNode(ISD::MUL, dl, SubVT, AHi, BHi));
18191 MVT ExVT = MVT::getVectorVT(MVT::i16, VT.getVectorNumElements());
18192 return DAG.getNode(
18193 ISD::TRUNCATE, dl, VT,
18194 DAG.getNode(ISD::MUL, dl, ExVT,
18195 DAG.getNode(ISD::SIGN_EXTEND, dl, ExVT, A),
18196 DAG.getNode(ISD::SIGN_EXTEND, dl, ExVT, B)));
18199 assert(VT == MVT::v16i8 &&
18200 "Pre-AVX2 support only supports v16i8 multiplication");
18201 MVT ExVT = MVT::v8i16;
18203 // Extract the lo parts and sign extend to i16
18205 if (Subtarget->hasSSE41()) {
18206 ALo = DAG.getNode(X86ISD::VSEXT, dl, ExVT, A);
18207 BLo = DAG.getNode(X86ISD::VSEXT, dl, ExVT, B);
18209 const int ShufMask[] = {-1, 0, -1, 1, -1, 2, -1, 3,
18210 -1, 4, -1, 5, -1, 6, -1, 7};
18211 ALo = DAG.getVectorShuffle(VT, dl, A, A, ShufMask);
18212 BLo = DAG.getVectorShuffle(VT, dl, B, B, ShufMask);
18213 ALo = DAG.getBitcast(ExVT, ALo);
18214 BLo = DAG.getBitcast(ExVT, BLo);
18215 ALo = DAG.getNode(ISD::SRA, dl, ExVT, ALo, DAG.getConstant(8, dl, ExVT));
18216 BLo = DAG.getNode(ISD::SRA, dl, ExVT, BLo, DAG.getConstant(8, dl, ExVT));
18219 // Extract the hi parts and sign extend to i16
18221 if (Subtarget->hasSSE41()) {
18222 const int ShufMask[] = {8, 9, 10, 11, 12, 13, 14, 15,
18223 -1, -1, -1, -1, -1, -1, -1, -1};
18224 AHi = DAG.getVectorShuffle(VT, dl, A, A, ShufMask);
18225 BHi = DAG.getVectorShuffle(VT, dl, B, B, ShufMask);
18226 AHi = DAG.getNode(X86ISD::VSEXT, dl, ExVT, AHi);
18227 BHi = DAG.getNode(X86ISD::VSEXT, dl, ExVT, BHi);
18229 const int ShufMask[] = {-1, 8, -1, 9, -1, 10, -1, 11,
18230 -1, 12, -1, 13, -1, 14, -1, 15};
18231 AHi = DAG.getVectorShuffle(VT, dl, A, A, ShufMask);
18232 BHi = DAG.getVectorShuffle(VT, dl, B, B, ShufMask);
18233 AHi = DAG.getBitcast(ExVT, AHi);
18234 BHi = DAG.getBitcast(ExVT, BHi);
18235 AHi = DAG.getNode(ISD::SRA, dl, ExVT, AHi, DAG.getConstant(8, dl, ExVT));
18236 BHi = DAG.getNode(ISD::SRA, dl, ExVT, BHi, DAG.getConstant(8, dl, ExVT));
18239 // Multiply, mask the lower 8bits of the lo/hi results and pack
18240 SDValue RLo = DAG.getNode(ISD::MUL, dl, ExVT, ALo, BLo);
18241 SDValue RHi = DAG.getNode(ISD::MUL, dl, ExVT, AHi, BHi);
18242 RLo = DAG.getNode(ISD::AND, dl, ExVT, RLo, DAG.getConstant(255, dl, ExVT));
18243 RHi = DAG.getNode(ISD::AND, dl, ExVT, RHi, DAG.getConstant(255, dl, ExVT));
18244 return DAG.getNode(X86ISD::PACKUS, dl, VT, RLo, RHi);
18247 // Lower v4i32 mul as 2x shuffle, 2x pmuludq, 2x shuffle.
18248 if (VT == MVT::v4i32) {
18249 assert(Subtarget->hasSSE2() && !Subtarget->hasSSE41() &&
18250 "Should not custom lower when pmuldq is available!");
18252 // Extract the odd parts.
18253 static const int UnpackMask[] = { 1, -1, 3, -1 };
18254 SDValue Aodds = DAG.getVectorShuffle(VT, dl, A, A, UnpackMask);
18255 SDValue Bodds = DAG.getVectorShuffle(VT, dl, B, B, UnpackMask);
18257 // Multiply the even parts.
18258 SDValue Evens = DAG.getNode(X86ISD::PMULUDQ, dl, MVT::v2i64, A, B);
18259 // Now multiply odd parts.
18260 SDValue Odds = DAG.getNode(X86ISD::PMULUDQ, dl, MVT::v2i64, Aodds, Bodds);
18262 Evens = DAG.getBitcast(VT, Evens);
18263 Odds = DAG.getBitcast(VT, Odds);
18265 // Merge the two vectors back together with a shuffle. This expands into 2
18267 static const int ShufMask[] = { 0, 4, 2, 6 };
18268 return DAG.getVectorShuffle(VT, dl, Evens, Odds, ShufMask);
18271 assert((VT == MVT::v2i64 || VT == MVT::v4i64 || VT == MVT::v8i64) &&
18272 "Only know how to lower V2I64/V4I64/V8I64 multiply");
18274 // Ahi = psrlqi(a, 32);
18275 // Bhi = psrlqi(b, 32);
18277 // AloBlo = pmuludq(a, b);
18278 // AloBhi = pmuludq(a, Bhi);
18279 // AhiBlo = pmuludq(Ahi, b);
18281 // AloBhi = psllqi(AloBhi, 32);
18282 // AhiBlo = psllqi(AhiBlo, 32);
18283 // return AloBlo + AloBhi + AhiBlo;
18285 SDValue Ahi = getTargetVShiftByConstNode(X86ISD::VSRLI, dl, VT, A, 32, DAG);
18286 SDValue Bhi = getTargetVShiftByConstNode(X86ISD::VSRLI, dl, VT, B, 32, DAG);
18288 SDValue AhiBlo = Ahi;
18289 SDValue AloBhi = Bhi;
18290 // Bit cast to 32-bit vectors for MULUDQ
18291 MVT MulVT = (VT == MVT::v2i64) ? MVT::v4i32 :
18292 (VT == MVT::v4i64) ? MVT::v8i32 : MVT::v16i32;
18293 A = DAG.getBitcast(MulVT, A);
18294 B = DAG.getBitcast(MulVT, B);
18295 Ahi = DAG.getBitcast(MulVT, Ahi);
18296 Bhi = DAG.getBitcast(MulVT, Bhi);
18298 SDValue AloBlo = DAG.getNode(X86ISD::PMULUDQ, dl, VT, A, B);
18299 // After shifting right const values the result may be all-zero.
18300 if (!ISD::isBuildVectorAllZeros(Ahi.getNode())) {
18301 AhiBlo = DAG.getNode(X86ISD::PMULUDQ, dl, VT, Ahi, B);
18302 AhiBlo = getTargetVShiftByConstNode(X86ISD::VSHLI, dl, VT, AhiBlo, 32, DAG);
18304 if (!ISD::isBuildVectorAllZeros(Bhi.getNode())) {
18305 AloBhi = DAG.getNode(X86ISD::PMULUDQ, dl, VT, A, Bhi);
18306 AloBhi = getTargetVShiftByConstNode(X86ISD::VSHLI, dl, VT, AloBhi, 32, DAG);
18309 SDValue Res = DAG.getNode(ISD::ADD, dl, VT, AloBlo, AloBhi);
18310 return DAG.getNode(ISD::ADD, dl, VT, Res, AhiBlo);
18313 SDValue X86TargetLowering::LowerWin64_i128OP(SDValue Op, SelectionDAG &DAG) const {
18314 assert(Subtarget->isTargetWin64() && "Unexpected target");
18315 EVT VT = Op.getValueType();
18316 assert(VT.isInteger() && VT.getSizeInBits() == 128 &&
18317 "Unexpected return type for lowering");
18321 switch (Op->getOpcode()) {
18322 default: llvm_unreachable("Unexpected request for libcall!");
18323 case ISD::SDIV: isSigned = true; LC = RTLIB::SDIV_I128; break;
18324 case ISD::UDIV: isSigned = false; LC = RTLIB::UDIV_I128; break;
18325 case ISD::SREM: isSigned = true; LC = RTLIB::SREM_I128; break;
18326 case ISD::UREM: isSigned = false; LC = RTLIB::UREM_I128; break;
18327 case ISD::SDIVREM: isSigned = true; LC = RTLIB::SDIVREM_I128; break;
18328 case ISD::UDIVREM: isSigned = false; LC = RTLIB::UDIVREM_I128; break;
18332 SDValue InChain = DAG.getEntryNode();
18334 TargetLowering::ArgListTy Args;
18335 TargetLowering::ArgListEntry Entry;
18336 for (unsigned i = 0, e = Op->getNumOperands(); i != e; ++i) {
18337 EVT ArgVT = Op->getOperand(i).getValueType();
18338 assert(ArgVT.isInteger() && ArgVT.getSizeInBits() == 128 &&
18339 "Unexpected argument type for lowering");
18340 SDValue StackPtr = DAG.CreateStackTemporary(ArgVT, 16);
18341 Entry.Node = StackPtr;
18342 InChain = DAG.getStore(InChain, dl, Op->getOperand(i), StackPtr, MachinePointerInfo(),
18344 Type *ArgTy = ArgVT.getTypeForEVT(*DAG.getContext());
18345 Entry.Ty = PointerType::get(ArgTy,0);
18346 Entry.isSExt = false;
18347 Entry.isZExt = false;
18348 Args.push_back(Entry);
18351 SDValue Callee = DAG.getExternalSymbol(getLibcallName(LC),
18352 getPointerTy(DAG.getDataLayout()));
18354 TargetLowering::CallLoweringInfo CLI(DAG);
18355 CLI.setDebugLoc(dl).setChain(InChain)
18356 .setCallee(getLibcallCallingConv(LC),
18357 static_cast<EVT>(MVT::v2i64).getTypeForEVT(*DAG.getContext()),
18358 Callee, std::move(Args), 0)
18359 .setInRegister().setSExtResult(isSigned).setZExtResult(!isSigned);
18361 std::pair<SDValue, SDValue> CallInfo = LowerCallTo(CLI);
18362 return DAG.getBitcast(VT, CallInfo.first);
18365 static SDValue LowerMUL_LOHI(SDValue Op, const X86Subtarget *Subtarget,
18366 SelectionDAG &DAG) {
18367 SDValue Op0 = Op.getOperand(0), Op1 = Op.getOperand(1);
18368 MVT VT = Op0.getSimpleValueType();
18371 assert((VT == MVT::v4i32 && Subtarget->hasSSE2()) ||
18372 (VT == MVT::v8i32 && Subtarget->hasInt256()));
18374 // PMULxD operations multiply each even value (starting at 0) of LHS with
18375 // the related value of RHS and produce a widen result.
18376 // E.g., PMULUDQ <4 x i32> <a|b|c|d>, <4 x i32> <e|f|g|h>
18377 // => <2 x i64> <ae|cg>
18379 // In other word, to have all the results, we need to perform two PMULxD:
18380 // 1. one with the even values.
18381 // 2. one with the odd values.
18382 // To achieve #2, with need to place the odd values at an even position.
18384 // Place the odd value at an even position (basically, shift all values 1
18385 // step to the left):
18386 const int Mask[] = {1, -1, 3, -1, 5, -1, 7, -1};
18387 // <a|b|c|d> => <b|undef|d|undef>
18388 SDValue Odd0 = DAG.getVectorShuffle(VT, dl, Op0, Op0, Mask);
18389 // <e|f|g|h> => <f|undef|h|undef>
18390 SDValue Odd1 = DAG.getVectorShuffle(VT, dl, Op1, Op1, Mask);
18392 // Emit two multiplies, one for the lower 2 ints and one for the higher 2
18394 MVT MulVT = VT == MVT::v4i32 ? MVT::v2i64 : MVT::v4i64;
18395 bool IsSigned = Op->getOpcode() == ISD::SMUL_LOHI;
18397 (!IsSigned || !Subtarget->hasSSE41()) ? X86ISD::PMULUDQ : X86ISD::PMULDQ;
18398 // PMULUDQ <4 x i32> <a|b|c|d>, <4 x i32> <e|f|g|h>
18399 // => <2 x i64> <ae|cg>
18400 SDValue Mul1 = DAG.getBitcast(VT, DAG.getNode(Opcode, dl, MulVT, Op0, Op1));
18401 // PMULUDQ <4 x i32> <b|undef|d|undef>, <4 x i32> <f|undef|h|undef>
18402 // => <2 x i64> <bf|dh>
18403 SDValue Mul2 = DAG.getBitcast(VT, DAG.getNode(Opcode, dl, MulVT, Odd0, Odd1));
18405 // Shuffle it back into the right order.
18406 SDValue Highs, Lows;
18407 if (VT == MVT::v8i32) {
18408 const int HighMask[] = {1, 9, 3, 11, 5, 13, 7, 15};
18409 Highs = DAG.getVectorShuffle(VT, dl, Mul1, Mul2, HighMask);
18410 const int LowMask[] = {0, 8, 2, 10, 4, 12, 6, 14};
18411 Lows = DAG.getVectorShuffle(VT, dl, Mul1, Mul2, LowMask);
18413 const int HighMask[] = {1, 5, 3, 7};
18414 Highs = DAG.getVectorShuffle(VT, dl, Mul1, Mul2, HighMask);
18415 const int LowMask[] = {0, 4, 2, 6};
18416 Lows = DAG.getVectorShuffle(VT, dl, Mul1, Mul2, LowMask);
18419 // If we have a signed multiply but no PMULDQ fix up the high parts of a
18420 // unsigned multiply.
18421 if (IsSigned && !Subtarget->hasSSE41()) {
18422 SDValue ShAmt = DAG.getConstant(
18424 DAG.getTargetLoweringInfo().getShiftAmountTy(VT, DAG.getDataLayout()));
18425 SDValue T1 = DAG.getNode(ISD::AND, dl, VT,
18426 DAG.getNode(ISD::SRA, dl, VT, Op0, ShAmt), Op1);
18427 SDValue T2 = DAG.getNode(ISD::AND, dl, VT,
18428 DAG.getNode(ISD::SRA, dl, VT, Op1, ShAmt), Op0);
18430 SDValue Fixup = DAG.getNode(ISD::ADD, dl, VT, T1, T2);
18431 Highs = DAG.getNode(ISD::SUB, dl, VT, Highs, Fixup);
18434 // The first result of MUL_LOHI is actually the low value, followed by the
18436 SDValue Ops[] = {Lows, Highs};
18437 return DAG.getMergeValues(Ops, dl);
18440 // Return true if the required (according to Opcode) shift-imm form is natively
18441 // supported by the Subtarget
18442 static bool SupportedVectorShiftWithImm(MVT VT, const X86Subtarget *Subtarget,
18444 if (VT.getScalarSizeInBits() < 16)
18447 if (VT.is512BitVector() &&
18448 (VT.getScalarSizeInBits() > 16 || Subtarget->hasBWI()))
18451 bool LShift = VT.is128BitVector() ||
18452 (VT.is256BitVector() && Subtarget->hasInt256());
18454 bool AShift = LShift && (Subtarget->hasVLX() ||
18455 (VT != MVT::v2i64 && VT != MVT::v4i64));
18456 return (Opcode == ISD::SRA) ? AShift : LShift;
18459 // The shift amount is a variable, but it is the same for all vector lanes.
18460 // These instructions are defined together with shift-immediate.
18462 bool SupportedVectorShiftWithBaseAmnt(MVT VT, const X86Subtarget *Subtarget,
18464 return SupportedVectorShiftWithImm(VT, Subtarget, Opcode);
18467 // Return true if the required (according to Opcode) variable-shift form is
18468 // natively supported by the Subtarget
18469 static bool SupportedVectorVarShift(MVT VT, const X86Subtarget *Subtarget,
18472 if (!Subtarget->hasInt256() || VT.getScalarSizeInBits() < 16)
18475 // vXi16 supported only on AVX-512, BWI
18476 if (VT.getScalarSizeInBits() == 16 && !Subtarget->hasBWI())
18479 if (VT.is512BitVector() || Subtarget->hasVLX())
18482 bool LShift = VT.is128BitVector() || VT.is256BitVector();
18483 bool AShift = LShift && VT != MVT::v2i64 && VT != MVT::v4i64;
18484 return (Opcode == ISD::SRA) ? AShift : LShift;
18487 static SDValue LowerScalarImmediateShift(SDValue Op, SelectionDAG &DAG,
18488 const X86Subtarget *Subtarget) {
18489 MVT VT = Op.getSimpleValueType();
18491 SDValue R = Op.getOperand(0);
18492 SDValue Amt = Op.getOperand(1);
18494 unsigned X86Opc = (Op.getOpcode() == ISD::SHL) ? X86ISD::VSHLI :
18495 (Op.getOpcode() == ISD::SRL) ? X86ISD::VSRLI : X86ISD::VSRAI;
18497 auto ArithmeticShiftRight64 = [&](uint64_t ShiftAmt) {
18498 assert((VT == MVT::v2i64 || VT == MVT::v4i64) && "Unexpected SRA type");
18499 MVT ExVT = MVT::getVectorVT(MVT::i32, VT.getVectorNumElements() * 2);
18500 SDValue Ex = DAG.getBitcast(ExVT, R);
18502 if (ShiftAmt >= 32) {
18503 // Splat sign to upper i32 dst, and SRA upper i32 src to lower i32.
18505 getTargetVShiftByConstNode(X86ISD::VSRAI, dl, ExVT, Ex, 31, DAG);
18506 SDValue Lower = getTargetVShiftByConstNode(X86ISD::VSRAI, dl, ExVT, Ex,
18507 ShiftAmt - 32, DAG);
18508 if (VT == MVT::v2i64)
18509 Ex = DAG.getVectorShuffle(ExVT, dl, Upper, Lower, {5, 1, 7, 3});
18510 if (VT == MVT::v4i64)
18511 Ex = DAG.getVectorShuffle(ExVT, dl, Upper, Lower,
18512 {9, 1, 11, 3, 13, 5, 15, 7});
18514 // SRA upper i32, SHL whole i64 and select lower i32.
18515 SDValue Upper = getTargetVShiftByConstNode(X86ISD::VSRAI, dl, ExVT, Ex,
18518 getTargetVShiftByConstNode(X86ISD::VSRLI, dl, VT, R, ShiftAmt, DAG);
18519 Lower = DAG.getBitcast(ExVT, Lower);
18520 if (VT == MVT::v2i64)
18521 Ex = DAG.getVectorShuffle(ExVT, dl, Upper, Lower, {4, 1, 6, 3});
18522 if (VT == MVT::v4i64)
18523 Ex = DAG.getVectorShuffle(ExVT, dl, Upper, Lower,
18524 {8, 1, 10, 3, 12, 5, 14, 7});
18526 return DAG.getBitcast(VT, Ex);
18529 // Optimize shl/srl/sra with constant shift amount.
18530 if (auto *BVAmt = dyn_cast<BuildVectorSDNode>(Amt)) {
18531 if (auto *ShiftConst = BVAmt->getConstantSplatNode()) {
18532 uint64_t ShiftAmt = ShiftConst->getZExtValue();
18534 if (SupportedVectorShiftWithImm(VT, Subtarget, Op.getOpcode()))
18535 return getTargetVShiftByConstNode(X86Opc, dl, VT, R, ShiftAmt, DAG);
18537 // i64 SRA needs to be performed as partial shifts.
18538 if ((VT == MVT::v2i64 || (Subtarget->hasInt256() && VT == MVT::v4i64)) &&
18539 Op.getOpcode() == ISD::SRA && !Subtarget->hasXOP())
18540 return ArithmeticShiftRight64(ShiftAmt);
18542 if (VT == MVT::v16i8 ||
18543 (Subtarget->hasInt256() && VT == MVT::v32i8) ||
18544 VT == MVT::v64i8) {
18545 unsigned NumElts = VT.getVectorNumElements();
18546 MVT ShiftVT = MVT::getVectorVT(MVT::i16, NumElts / 2);
18548 // Simple i8 add case
18549 if (Op.getOpcode() == ISD::SHL && ShiftAmt == 1)
18550 return DAG.getNode(ISD::ADD, dl, VT, R, R);
18552 // ashr(R, 7) === cmp_slt(R, 0)
18553 if (Op.getOpcode() == ISD::SRA && ShiftAmt == 7) {
18554 SDValue Zeros = getZeroVector(VT, Subtarget, DAG, dl);
18555 return DAG.getNode(X86ISD::PCMPGT, dl, VT, Zeros, R);
18558 // XOP can shift v16i8 directly instead of as shift v8i16 + mask.
18559 if (VT == MVT::v16i8 && Subtarget->hasXOP())
18562 if (Op.getOpcode() == ISD::SHL) {
18563 // Make a large shift.
18564 SDValue SHL = getTargetVShiftByConstNode(X86ISD::VSHLI, dl, ShiftVT,
18566 SHL = DAG.getBitcast(VT, SHL);
18567 // Zero out the rightmost bits.
18568 return DAG.getNode(ISD::AND, dl, VT, SHL,
18569 DAG.getConstant(uint8_t(-1U << ShiftAmt), dl, VT));
18571 if (Op.getOpcode() == ISD::SRL) {
18572 // Make a large shift.
18573 SDValue SRL = getTargetVShiftByConstNode(X86ISD::VSRLI, dl, ShiftVT,
18575 SRL = DAG.getBitcast(VT, SRL);
18576 // Zero out the leftmost bits.
18577 return DAG.getNode(ISD::AND, dl, VT, SRL,
18578 DAG.getConstant(uint8_t(-1U) >> ShiftAmt, dl, VT));
18580 if (Op.getOpcode() == ISD::SRA) {
18581 // ashr(R, Amt) === sub(xor(lshr(R, Amt), Mask), Mask)
18582 SDValue Res = DAG.getNode(ISD::SRL, dl, VT, R, Amt);
18584 SDValue Mask = DAG.getConstant(128 >> ShiftAmt, dl, VT);
18585 Res = DAG.getNode(ISD::XOR, dl, VT, Res, Mask);
18586 Res = DAG.getNode(ISD::SUB, dl, VT, Res, Mask);
18589 llvm_unreachable("Unknown shift opcode.");
18594 // Special case in 32-bit mode, where i64 is expanded into high and low parts.
18595 if (!Subtarget->is64Bit() && !Subtarget->hasXOP() &&
18596 (VT == MVT::v2i64 || (Subtarget->hasInt256() && VT == MVT::v4i64))) {
18598 // Peek through any splat that was introduced for i64 shift vectorization.
18599 int SplatIndex = -1;
18600 if (ShuffleVectorSDNode *SVN = dyn_cast<ShuffleVectorSDNode>(Amt.getNode()))
18601 if (SVN->isSplat()) {
18602 SplatIndex = SVN->getSplatIndex();
18603 Amt = Amt.getOperand(0);
18604 assert(SplatIndex < (int)VT.getVectorNumElements() &&
18605 "Splat shuffle referencing second operand");
18608 if (Amt.getOpcode() != ISD::BITCAST ||
18609 Amt.getOperand(0).getOpcode() != ISD::BUILD_VECTOR)
18612 Amt = Amt.getOperand(0);
18613 unsigned Ratio = Amt.getSimpleValueType().getVectorNumElements() /
18614 VT.getVectorNumElements();
18615 unsigned RatioInLog2 = Log2_32_Ceil(Ratio);
18616 uint64_t ShiftAmt = 0;
18617 unsigned BaseOp = (SplatIndex < 0 ? 0 : SplatIndex * Ratio);
18618 for (unsigned i = 0; i != Ratio; ++i) {
18619 ConstantSDNode *C = dyn_cast<ConstantSDNode>(Amt.getOperand(i + BaseOp));
18623 ShiftAmt |= C->getZExtValue() << (i * (1 << (6 - RatioInLog2)));
18626 // Check remaining shift amounts (if not a splat).
18627 if (SplatIndex < 0) {
18628 for (unsigned i = Ratio; i != Amt.getNumOperands(); i += Ratio) {
18629 uint64_t ShAmt = 0;
18630 for (unsigned j = 0; j != Ratio; ++j) {
18631 ConstantSDNode *C = dyn_cast<ConstantSDNode>(Amt.getOperand(i + j));
18635 ShAmt |= C->getZExtValue() << (j * (1 << (6 - RatioInLog2)));
18637 if (ShAmt != ShiftAmt)
18642 if (SupportedVectorShiftWithImm(VT, Subtarget, Op.getOpcode()))
18643 return getTargetVShiftByConstNode(X86Opc, dl, VT, R, ShiftAmt, DAG);
18645 if (Op.getOpcode() == ISD::SRA)
18646 return ArithmeticShiftRight64(ShiftAmt);
18652 static SDValue LowerScalarVariableShift(SDValue Op, SelectionDAG &DAG,
18653 const X86Subtarget* Subtarget) {
18654 MVT VT = Op.getSimpleValueType();
18656 SDValue R = Op.getOperand(0);
18657 SDValue Amt = Op.getOperand(1);
18659 unsigned X86OpcI = (Op.getOpcode() == ISD::SHL) ? X86ISD::VSHLI :
18660 (Op.getOpcode() == ISD::SRL) ? X86ISD::VSRLI : X86ISD::VSRAI;
18662 unsigned X86OpcV = (Op.getOpcode() == ISD::SHL) ? X86ISD::VSHL :
18663 (Op.getOpcode() == ISD::SRL) ? X86ISD::VSRL : X86ISD::VSRA;
18665 if (SupportedVectorShiftWithBaseAmnt(VT, Subtarget, Op.getOpcode())) {
18667 MVT EltVT = VT.getVectorElementType();
18669 if (BuildVectorSDNode *BV = dyn_cast<BuildVectorSDNode>(Amt)) {
18670 // Check if this build_vector node is doing a splat.
18671 // If so, then set BaseShAmt equal to the splat value.
18672 BaseShAmt = BV->getSplatValue();
18673 if (BaseShAmt && BaseShAmt.getOpcode() == ISD::UNDEF)
18674 BaseShAmt = SDValue();
18676 if (Amt.getOpcode() == ISD::EXTRACT_SUBVECTOR)
18677 Amt = Amt.getOperand(0);
18679 ShuffleVectorSDNode *SVN = dyn_cast<ShuffleVectorSDNode>(Amt);
18680 if (SVN && SVN->isSplat()) {
18681 unsigned SplatIdx = (unsigned)SVN->getSplatIndex();
18682 SDValue InVec = Amt.getOperand(0);
18683 if (InVec.getOpcode() == ISD::BUILD_VECTOR) {
18684 assert((SplatIdx < InVec.getSimpleValueType().getVectorNumElements()) &&
18685 "Unexpected shuffle index found!");
18686 BaseShAmt = InVec.getOperand(SplatIdx);
18687 } else if (InVec.getOpcode() == ISD::INSERT_VECTOR_ELT) {
18688 if (ConstantSDNode *C =
18689 dyn_cast<ConstantSDNode>(InVec.getOperand(2))) {
18690 if (C->getZExtValue() == SplatIdx)
18691 BaseShAmt = InVec.getOperand(1);
18696 // Avoid introducing an extract element from a shuffle.
18697 BaseShAmt = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, EltVT, InVec,
18698 DAG.getIntPtrConstant(SplatIdx, dl));
18702 if (BaseShAmt.getNode()) {
18703 assert(EltVT.bitsLE(MVT::i64) && "Unexpected element type!");
18704 if (EltVT != MVT::i64 && EltVT.bitsGT(MVT::i32))
18705 BaseShAmt = DAG.getNode(ISD::ZERO_EXTEND, dl, MVT::i64, BaseShAmt);
18706 else if (EltVT.bitsLT(MVT::i32))
18707 BaseShAmt = DAG.getNode(ISD::ZERO_EXTEND, dl, MVT::i32, BaseShAmt);
18709 return getTargetVShiftNode(X86OpcI, dl, VT, R, BaseShAmt, DAG);
18713 // Special case in 32-bit mode, where i64 is expanded into high and low parts.
18714 if (!Subtarget->is64Bit() && VT == MVT::v2i64 &&
18715 Amt.getOpcode() == ISD::BITCAST &&
18716 Amt.getOperand(0).getOpcode() == ISD::BUILD_VECTOR) {
18717 Amt = Amt.getOperand(0);
18718 unsigned Ratio = Amt.getSimpleValueType().getVectorNumElements() /
18719 VT.getVectorNumElements();
18720 std::vector<SDValue> Vals(Ratio);
18721 for (unsigned i = 0; i != Ratio; ++i)
18722 Vals[i] = Amt.getOperand(i);
18723 for (unsigned i = Ratio; i != Amt.getNumOperands(); i += Ratio) {
18724 for (unsigned j = 0; j != Ratio; ++j)
18725 if (Vals[j] != Amt.getOperand(i + j))
18729 if (SupportedVectorShiftWithBaseAmnt(VT, Subtarget, Op.getOpcode()))
18730 return DAG.getNode(X86OpcV, dl, VT, R, Op.getOperand(1));
18735 static SDValue LowerShift(SDValue Op, const X86Subtarget* Subtarget,
18736 SelectionDAG &DAG) {
18737 MVT VT = Op.getSimpleValueType();
18739 SDValue R = Op.getOperand(0);
18740 SDValue Amt = Op.getOperand(1);
18742 assert(VT.isVector() && "Custom lowering only for vector shifts!");
18743 assert(Subtarget->hasSSE2() && "Only custom lower when we have SSE2!");
18745 if (SDValue V = LowerScalarImmediateShift(Op, DAG, Subtarget))
18748 if (SDValue V = LowerScalarVariableShift(Op, DAG, Subtarget))
18751 if (SupportedVectorVarShift(VT, Subtarget, Op.getOpcode()))
18754 // XOP has 128-bit variable logical/arithmetic shifts.
18755 // +ve/-ve Amt = shift left/right.
18756 if (Subtarget->hasXOP() &&
18757 (VT == MVT::v2i64 || VT == MVT::v4i32 ||
18758 VT == MVT::v8i16 || VT == MVT::v16i8)) {
18759 if (Op.getOpcode() == ISD::SRL || Op.getOpcode() == ISD::SRA) {
18760 SDValue Zero = getZeroVector(VT, Subtarget, DAG, dl);
18761 Amt = DAG.getNode(ISD::SUB, dl, VT, Zero, Amt);
18763 if (Op.getOpcode() == ISD::SHL || Op.getOpcode() == ISD::SRL)
18764 return DAG.getNode(X86ISD::VPSHL, dl, VT, R, Amt);
18765 if (Op.getOpcode() == ISD::SRA)
18766 return DAG.getNode(X86ISD::VPSHA, dl, VT, R, Amt);
18769 // 2i64 vector logical shifts can efficiently avoid scalarization - do the
18770 // shifts per-lane and then shuffle the partial results back together.
18771 if (VT == MVT::v2i64 && Op.getOpcode() != ISD::SRA) {
18772 // Splat the shift amounts so the scalar shifts above will catch it.
18773 SDValue Amt0 = DAG.getVectorShuffle(VT, dl, Amt, Amt, {0, 0});
18774 SDValue Amt1 = DAG.getVectorShuffle(VT, dl, Amt, Amt, {1, 1});
18775 SDValue R0 = DAG.getNode(Op->getOpcode(), dl, VT, R, Amt0);
18776 SDValue R1 = DAG.getNode(Op->getOpcode(), dl, VT, R, Amt1);
18777 return DAG.getVectorShuffle(VT, dl, R0, R1, {0, 3});
18780 // i64 vector arithmetic shift can be emulated with the transform:
18781 // M = lshr(SIGN_BIT, Amt)
18782 // ashr(R, Amt) === sub(xor(lshr(R, Amt), M), M)
18783 if ((VT == MVT::v2i64 || (VT == MVT::v4i64 && Subtarget->hasInt256())) &&
18784 Op.getOpcode() == ISD::SRA) {
18785 SDValue S = DAG.getConstant(APInt::getSignBit(64), dl, VT);
18786 SDValue M = DAG.getNode(ISD::SRL, dl, VT, S, Amt);
18787 R = DAG.getNode(ISD::SRL, dl, VT, R, Amt);
18788 R = DAG.getNode(ISD::XOR, dl, VT, R, M);
18789 R = DAG.getNode(ISD::SUB, dl, VT, R, M);
18793 // If possible, lower this packed shift into a vector multiply instead of
18794 // expanding it into a sequence of scalar shifts.
18795 // Do this only if the vector shift count is a constant build_vector.
18796 if (Op.getOpcode() == ISD::SHL &&
18797 (VT == MVT::v8i16 || VT == MVT::v4i32 ||
18798 (Subtarget->hasInt256() && VT == MVT::v16i16)) &&
18799 ISD::isBuildVectorOfConstantSDNodes(Amt.getNode())) {
18800 SmallVector<SDValue, 8> Elts;
18801 MVT SVT = VT.getVectorElementType();
18802 unsigned SVTBits = SVT.getSizeInBits();
18803 APInt One(SVTBits, 1);
18804 unsigned NumElems = VT.getVectorNumElements();
18806 for (unsigned i=0; i !=NumElems; ++i) {
18807 SDValue Op = Amt->getOperand(i);
18808 if (Op->getOpcode() == ISD::UNDEF) {
18809 Elts.push_back(Op);
18813 ConstantSDNode *ND = cast<ConstantSDNode>(Op);
18814 APInt C(SVTBits, ND->getAPIntValue().getZExtValue());
18815 uint64_t ShAmt = C.getZExtValue();
18816 if (ShAmt >= SVTBits) {
18817 Elts.push_back(DAG.getUNDEF(SVT));
18820 Elts.push_back(DAG.getConstant(One.shl(ShAmt), dl, SVT));
18822 SDValue BV = DAG.getNode(ISD::BUILD_VECTOR, dl, VT, Elts);
18823 return DAG.getNode(ISD::MUL, dl, VT, R, BV);
18826 // Lower SHL with variable shift amount.
18827 if (VT == MVT::v4i32 && Op->getOpcode() == ISD::SHL) {
18828 Op = DAG.getNode(ISD::SHL, dl, VT, Amt, DAG.getConstant(23, dl, VT));
18830 Op = DAG.getNode(ISD::ADD, dl, VT, Op,
18831 DAG.getConstant(0x3f800000U, dl, VT));
18832 Op = DAG.getBitcast(MVT::v4f32, Op);
18833 Op = DAG.getNode(ISD::FP_TO_SINT, dl, VT, Op);
18834 return DAG.getNode(ISD::MUL, dl, VT, Op, R);
18837 // If possible, lower this shift as a sequence of two shifts by
18838 // constant plus a MOVSS/MOVSD instead of scalarizing it.
18840 // (v4i32 (srl A, (build_vector < X, Y, Y, Y>)))
18842 // Could be rewritten as:
18843 // (v4i32 (MOVSS (srl A, <Y,Y,Y,Y>), (srl A, <X,X,X,X>)))
18845 // The advantage is that the two shifts from the example would be
18846 // lowered as X86ISD::VSRLI nodes. This would be cheaper than scalarizing
18847 // the vector shift into four scalar shifts plus four pairs of vector
18849 if ((VT == MVT::v8i16 || VT == MVT::v4i32) &&
18850 ISD::isBuildVectorOfConstantSDNodes(Amt.getNode())) {
18851 unsigned TargetOpcode = X86ISD::MOVSS;
18852 bool CanBeSimplified;
18853 // The splat value for the first packed shift (the 'X' from the example).
18854 SDValue Amt1 = Amt->getOperand(0);
18855 // The splat value for the second packed shift (the 'Y' from the example).
18856 SDValue Amt2 = (VT == MVT::v4i32) ? Amt->getOperand(1) :
18857 Amt->getOperand(2);
18859 // See if it is possible to replace this node with a sequence of
18860 // two shifts followed by a MOVSS/MOVSD
18861 if (VT == MVT::v4i32) {
18862 // Check if it is legal to use a MOVSS.
18863 CanBeSimplified = Amt2 == Amt->getOperand(2) &&
18864 Amt2 == Amt->getOperand(3);
18865 if (!CanBeSimplified) {
18866 // Otherwise, check if we can still simplify this node using a MOVSD.
18867 CanBeSimplified = Amt1 == Amt->getOperand(1) &&
18868 Amt->getOperand(2) == Amt->getOperand(3);
18869 TargetOpcode = X86ISD::MOVSD;
18870 Amt2 = Amt->getOperand(2);
18873 // Do similar checks for the case where the machine value type
18875 CanBeSimplified = Amt1 == Amt->getOperand(1);
18876 for (unsigned i=3; i != 8 && CanBeSimplified; ++i)
18877 CanBeSimplified = Amt2 == Amt->getOperand(i);
18879 if (!CanBeSimplified) {
18880 TargetOpcode = X86ISD::MOVSD;
18881 CanBeSimplified = true;
18882 Amt2 = Amt->getOperand(4);
18883 for (unsigned i=0; i != 4 && CanBeSimplified; ++i)
18884 CanBeSimplified = Amt1 == Amt->getOperand(i);
18885 for (unsigned j=4; j != 8 && CanBeSimplified; ++j)
18886 CanBeSimplified = Amt2 == Amt->getOperand(j);
18890 if (CanBeSimplified && isa<ConstantSDNode>(Amt1) &&
18891 isa<ConstantSDNode>(Amt2)) {
18892 // Replace this node with two shifts followed by a MOVSS/MOVSD.
18893 MVT CastVT = MVT::v4i32;
18895 DAG.getConstant(cast<ConstantSDNode>(Amt1)->getAPIntValue(), dl, VT);
18896 SDValue Shift1 = DAG.getNode(Op->getOpcode(), dl, VT, R, Splat1);
18898 DAG.getConstant(cast<ConstantSDNode>(Amt2)->getAPIntValue(), dl, VT);
18899 SDValue Shift2 = DAG.getNode(Op->getOpcode(), dl, VT, R, Splat2);
18900 if (TargetOpcode == X86ISD::MOVSD)
18901 CastVT = MVT::v2i64;
18902 SDValue BitCast1 = DAG.getBitcast(CastVT, Shift1);
18903 SDValue BitCast2 = DAG.getBitcast(CastVT, Shift2);
18904 SDValue Result = getTargetShuffleNode(TargetOpcode, dl, CastVT, BitCast2,
18906 return DAG.getBitcast(VT, Result);
18910 // v4i32 Non Uniform Shifts.
18911 // If the shift amount is constant we can shift each lane using the SSE2
18912 // immediate shifts, else we need to zero-extend each lane to the lower i64
18913 // and shift using the SSE2 variable shifts.
18914 // The separate results can then be blended together.
18915 if (VT == MVT::v4i32) {
18916 unsigned Opc = Op.getOpcode();
18917 SDValue Amt0, Amt1, Amt2, Amt3;
18918 if (ISD::isBuildVectorOfConstantSDNodes(Amt.getNode())) {
18919 Amt0 = DAG.getVectorShuffle(VT, dl, Amt, DAG.getUNDEF(VT), {0, 0, 0, 0});
18920 Amt1 = DAG.getVectorShuffle(VT, dl, Amt, DAG.getUNDEF(VT), {1, 1, 1, 1});
18921 Amt2 = DAG.getVectorShuffle(VT, dl, Amt, DAG.getUNDEF(VT), {2, 2, 2, 2});
18922 Amt3 = DAG.getVectorShuffle(VT, dl, Amt, DAG.getUNDEF(VT), {3, 3, 3, 3});
18924 // ISD::SHL is handled above but we include it here for completeness.
18927 llvm_unreachable("Unknown target vector shift node");
18929 Opc = X86ISD::VSHL;
18932 Opc = X86ISD::VSRL;
18935 Opc = X86ISD::VSRA;
18938 // The SSE2 shifts use the lower i64 as the same shift amount for
18939 // all lanes and the upper i64 is ignored. These shuffle masks
18940 // optimally zero-extend each lanes on SSE2/SSE41/AVX targets.
18941 SDValue Z = getZeroVector(VT, Subtarget, DAG, dl);
18942 Amt0 = DAG.getVectorShuffle(VT, dl, Amt, Z, {0, 4, -1, -1});
18943 Amt1 = DAG.getVectorShuffle(VT, dl, Amt, Z, {1, 5, -1, -1});
18944 Amt2 = DAG.getVectorShuffle(VT, dl, Amt, Z, {2, 6, -1, -1});
18945 Amt3 = DAG.getVectorShuffle(VT, dl, Amt, Z, {3, 7, -1, -1});
18948 SDValue R0 = DAG.getNode(Opc, dl, VT, R, Amt0);
18949 SDValue R1 = DAG.getNode(Opc, dl, VT, R, Amt1);
18950 SDValue R2 = DAG.getNode(Opc, dl, VT, R, Amt2);
18951 SDValue R3 = DAG.getNode(Opc, dl, VT, R, Amt3);
18952 SDValue R02 = DAG.getVectorShuffle(VT, dl, R0, R2, {0, -1, 6, -1});
18953 SDValue R13 = DAG.getVectorShuffle(VT, dl, R1, R3, {-1, 1, -1, 7});
18954 return DAG.getVectorShuffle(VT, dl, R02, R13, {0, 5, 2, 7});
18957 if (VT == MVT::v16i8 ||
18958 (VT == MVT::v32i8 && Subtarget->hasInt256() && !Subtarget->hasXOP())) {
18959 MVT ExtVT = MVT::getVectorVT(MVT::i16, VT.getVectorNumElements() / 2);
18960 unsigned ShiftOpcode = Op->getOpcode();
18962 auto SignBitSelect = [&](MVT SelVT, SDValue Sel, SDValue V0, SDValue V1) {
18963 // On SSE41 targets we make use of the fact that VSELECT lowers
18964 // to PBLENDVB which selects bytes based just on the sign bit.
18965 if (Subtarget->hasSSE41()) {
18966 V0 = DAG.getBitcast(VT, V0);
18967 V1 = DAG.getBitcast(VT, V1);
18968 Sel = DAG.getBitcast(VT, Sel);
18969 return DAG.getBitcast(SelVT,
18970 DAG.getNode(ISD::VSELECT, dl, VT, Sel, V0, V1));
18972 // On pre-SSE41 targets we test for the sign bit by comparing to
18973 // zero - a negative value will set all bits of the lanes to true
18974 // and VSELECT uses that in its OR(AND(V0,C),AND(V1,~C)) lowering.
18975 SDValue Z = getZeroVector(SelVT, Subtarget, DAG, dl);
18976 SDValue C = DAG.getNode(X86ISD::PCMPGT, dl, SelVT, Z, Sel);
18977 return DAG.getNode(ISD::VSELECT, dl, SelVT, C, V0, V1);
18980 // Turn 'a' into a mask suitable for VSELECT: a = a << 5;
18981 // We can safely do this using i16 shifts as we're only interested in
18982 // the 3 lower bits of each byte.
18983 Amt = DAG.getBitcast(ExtVT, Amt);
18984 Amt = DAG.getNode(ISD::SHL, dl, ExtVT, Amt, DAG.getConstant(5, dl, ExtVT));
18985 Amt = DAG.getBitcast(VT, Amt);
18987 if (Op->getOpcode() == ISD::SHL || Op->getOpcode() == ISD::SRL) {
18988 // r = VSELECT(r, shift(r, 4), a);
18990 DAG.getNode(ShiftOpcode, dl, VT, R, DAG.getConstant(4, dl, VT));
18991 R = SignBitSelect(VT, Amt, M, R);
18994 Amt = DAG.getNode(ISD::ADD, dl, VT, Amt, Amt);
18996 // r = VSELECT(r, shift(r, 2), a);
18997 M = DAG.getNode(ShiftOpcode, dl, VT, R, DAG.getConstant(2, dl, VT));
18998 R = SignBitSelect(VT, Amt, M, R);
19001 Amt = DAG.getNode(ISD::ADD, dl, VT, Amt, Amt);
19003 // return VSELECT(r, shift(r, 1), a);
19004 M = DAG.getNode(ShiftOpcode, dl, VT, R, DAG.getConstant(1, dl, VT));
19005 R = SignBitSelect(VT, Amt, M, R);
19009 if (Op->getOpcode() == ISD::SRA) {
19010 // For SRA we need to unpack each byte to the higher byte of a i16 vector
19011 // so we can correctly sign extend. We don't care what happens to the
19013 SDValue ALo = DAG.getNode(X86ISD::UNPCKL, dl, VT, DAG.getUNDEF(VT), Amt);
19014 SDValue AHi = DAG.getNode(X86ISD::UNPCKH, dl, VT, DAG.getUNDEF(VT), Amt);
19015 SDValue RLo = DAG.getNode(X86ISD::UNPCKL, dl, VT, DAG.getUNDEF(VT), R);
19016 SDValue RHi = DAG.getNode(X86ISD::UNPCKH, dl, VT, DAG.getUNDEF(VT), R);
19017 ALo = DAG.getBitcast(ExtVT, ALo);
19018 AHi = DAG.getBitcast(ExtVT, AHi);
19019 RLo = DAG.getBitcast(ExtVT, RLo);
19020 RHi = DAG.getBitcast(ExtVT, RHi);
19022 // r = VSELECT(r, shift(r, 4), a);
19023 SDValue MLo = DAG.getNode(ShiftOpcode, dl, ExtVT, RLo,
19024 DAG.getConstant(4, dl, ExtVT));
19025 SDValue MHi = DAG.getNode(ShiftOpcode, dl, ExtVT, RHi,
19026 DAG.getConstant(4, dl, ExtVT));
19027 RLo = SignBitSelect(ExtVT, ALo, MLo, RLo);
19028 RHi = SignBitSelect(ExtVT, AHi, MHi, RHi);
19031 ALo = DAG.getNode(ISD::ADD, dl, ExtVT, ALo, ALo);
19032 AHi = DAG.getNode(ISD::ADD, dl, ExtVT, AHi, AHi);
19034 // r = VSELECT(r, shift(r, 2), a);
19035 MLo = DAG.getNode(ShiftOpcode, dl, ExtVT, RLo,
19036 DAG.getConstant(2, dl, ExtVT));
19037 MHi = DAG.getNode(ShiftOpcode, dl, ExtVT, RHi,
19038 DAG.getConstant(2, dl, ExtVT));
19039 RLo = SignBitSelect(ExtVT, ALo, MLo, RLo);
19040 RHi = SignBitSelect(ExtVT, AHi, MHi, RHi);
19043 ALo = DAG.getNode(ISD::ADD, dl, ExtVT, ALo, ALo);
19044 AHi = DAG.getNode(ISD::ADD, dl, ExtVT, AHi, AHi);
19046 // r = VSELECT(r, shift(r, 1), a);
19047 MLo = DAG.getNode(ShiftOpcode, dl, ExtVT, RLo,
19048 DAG.getConstant(1, dl, ExtVT));
19049 MHi = DAG.getNode(ShiftOpcode, dl, ExtVT, RHi,
19050 DAG.getConstant(1, dl, ExtVT));
19051 RLo = SignBitSelect(ExtVT, ALo, MLo, RLo);
19052 RHi = SignBitSelect(ExtVT, AHi, MHi, RHi);
19054 // Logical shift the result back to the lower byte, leaving a zero upper
19056 // meaning that we can safely pack with PACKUSWB.
19058 DAG.getNode(ISD::SRL, dl, ExtVT, RLo, DAG.getConstant(8, dl, ExtVT));
19060 DAG.getNode(ISD::SRL, dl, ExtVT, RHi, DAG.getConstant(8, dl, ExtVT));
19061 return DAG.getNode(X86ISD::PACKUS, dl, VT, RLo, RHi);
19065 // It's worth extending once and using the v8i32 shifts for 16-bit types, but
19066 // the extra overheads to get from v16i8 to v8i32 make the existing SSE
19067 // solution better.
19068 if (Subtarget->hasInt256() && VT == MVT::v8i16) {
19069 MVT ExtVT = MVT::v8i32;
19071 Op.getOpcode() == ISD::SRA ? ISD::SIGN_EXTEND : ISD::ZERO_EXTEND;
19072 R = DAG.getNode(ExtOpc, dl, ExtVT, R);
19073 Amt = DAG.getNode(ISD::ANY_EXTEND, dl, ExtVT, Amt);
19074 return DAG.getNode(ISD::TRUNCATE, dl, VT,
19075 DAG.getNode(Op.getOpcode(), dl, ExtVT, R, Amt));
19078 if (Subtarget->hasInt256() && !Subtarget->hasXOP() && VT == MVT::v16i16) {
19079 MVT ExtVT = MVT::v8i32;
19080 SDValue Z = getZeroVector(VT, Subtarget, DAG, dl);
19081 SDValue ALo = DAG.getNode(X86ISD::UNPCKL, dl, VT, Amt, Z);
19082 SDValue AHi = DAG.getNode(X86ISD::UNPCKH, dl, VT, Amt, Z);
19083 SDValue RLo = DAG.getNode(X86ISD::UNPCKL, dl, VT, R, R);
19084 SDValue RHi = DAG.getNode(X86ISD::UNPCKH, dl, VT, R, R);
19085 ALo = DAG.getBitcast(ExtVT, ALo);
19086 AHi = DAG.getBitcast(ExtVT, AHi);
19087 RLo = DAG.getBitcast(ExtVT, RLo);
19088 RHi = DAG.getBitcast(ExtVT, RHi);
19089 SDValue Lo = DAG.getNode(Op.getOpcode(), dl, ExtVT, RLo, ALo);
19090 SDValue Hi = DAG.getNode(Op.getOpcode(), dl, ExtVT, RHi, AHi);
19091 Lo = DAG.getNode(ISD::SRL, dl, ExtVT, Lo, DAG.getConstant(16, dl, ExtVT));
19092 Hi = DAG.getNode(ISD::SRL, dl, ExtVT, Hi, DAG.getConstant(16, dl, ExtVT));
19093 return DAG.getNode(X86ISD::PACKUS, dl, VT, Lo, Hi);
19096 if (VT == MVT::v8i16) {
19097 unsigned ShiftOpcode = Op->getOpcode();
19099 auto SignBitSelect = [&](SDValue Sel, SDValue V0, SDValue V1) {
19100 // On SSE41 targets we make use of the fact that VSELECT lowers
19101 // to PBLENDVB which selects bytes based just on the sign bit.
19102 if (Subtarget->hasSSE41()) {
19103 MVT ExtVT = MVT::getVectorVT(MVT::i8, VT.getVectorNumElements() * 2);
19104 V0 = DAG.getBitcast(ExtVT, V0);
19105 V1 = DAG.getBitcast(ExtVT, V1);
19106 Sel = DAG.getBitcast(ExtVT, Sel);
19107 return DAG.getBitcast(
19108 VT, DAG.getNode(ISD::VSELECT, dl, ExtVT, Sel, V0, V1));
19110 // On pre-SSE41 targets we splat the sign bit - a negative value will
19111 // set all bits of the lanes to true and VSELECT uses that in
19112 // its OR(AND(V0,C),AND(V1,~C)) lowering.
19114 DAG.getNode(ISD::SRA, dl, VT, Sel, DAG.getConstant(15, dl, VT));
19115 return DAG.getNode(ISD::VSELECT, dl, VT, C, V0, V1);
19118 // Turn 'a' into a mask suitable for VSELECT: a = a << 12;
19119 if (Subtarget->hasSSE41()) {
19120 // On SSE41 targets we need to replicate the shift mask in both
19121 // bytes for PBLENDVB.
19124 DAG.getNode(ISD::SHL, dl, VT, Amt, DAG.getConstant(4, dl, VT)),
19125 DAG.getNode(ISD::SHL, dl, VT, Amt, DAG.getConstant(12, dl, VT)));
19127 Amt = DAG.getNode(ISD::SHL, dl, VT, Amt, DAG.getConstant(12, dl, VT));
19130 // r = VSELECT(r, shift(r, 8), a);
19131 SDValue M = DAG.getNode(ShiftOpcode, dl, VT, R, DAG.getConstant(8, dl, VT));
19132 R = SignBitSelect(Amt, M, R);
19135 Amt = DAG.getNode(ISD::ADD, dl, VT, Amt, Amt);
19137 // r = VSELECT(r, shift(r, 4), a);
19138 M = DAG.getNode(ShiftOpcode, dl, VT, R, DAG.getConstant(4, dl, VT));
19139 R = SignBitSelect(Amt, M, R);
19142 Amt = DAG.getNode(ISD::ADD, dl, VT, Amt, Amt);
19144 // r = VSELECT(r, shift(r, 2), a);
19145 M = DAG.getNode(ShiftOpcode, dl, VT, R, DAG.getConstant(2, dl, VT));
19146 R = SignBitSelect(Amt, M, R);
19149 Amt = DAG.getNode(ISD::ADD, dl, VT, Amt, Amt);
19151 // return VSELECT(r, shift(r, 1), a);
19152 M = DAG.getNode(ShiftOpcode, dl, VT, R, DAG.getConstant(1, dl, VT));
19153 R = SignBitSelect(Amt, M, R);
19157 // Decompose 256-bit shifts into smaller 128-bit shifts.
19158 if (VT.is256BitVector()) {
19159 unsigned NumElems = VT.getVectorNumElements();
19160 MVT EltVT = VT.getVectorElementType();
19161 MVT NewVT = MVT::getVectorVT(EltVT, NumElems/2);
19163 // Extract the two vectors
19164 SDValue V1 = Extract128BitVector(R, 0, DAG, dl);
19165 SDValue V2 = Extract128BitVector(R, NumElems/2, DAG, dl);
19167 // Recreate the shift amount vectors
19168 SDValue Amt1, Amt2;
19169 if (Amt.getOpcode() == ISD::BUILD_VECTOR) {
19170 // Constant shift amount
19171 SmallVector<SDValue, 8> Ops(Amt->op_begin(), Amt->op_begin() + NumElems);
19172 ArrayRef<SDValue> Amt1Csts = makeArrayRef(Ops).slice(0, NumElems / 2);
19173 ArrayRef<SDValue> Amt2Csts = makeArrayRef(Ops).slice(NumElems / 2);
19175 Amt1 = DAG.getNode(ISD::BUILD_VECTOR, dl, NewVT, Amt1Csts);
19176 Amt2 = DAG.getNode(ISD::BUILD_VECTOR, dl, NewVT, Amt2Csts);
19178 // Variable shift amount
19179 Amt1 = Extract128BitVector(Amt, 0, DAG, dl);
19180 Amt2 = Extract128BitVector(Amt, NumElems/2, DAG, dl);
19183 // Issue new vector shifts for the smaller types
19184 V1 = DAG.getNode(Op.getOpcode(), dl, NewVT, V1, Amt1);
19185 V2 = DAG.getNode(Op.getOpcode(), dl, NewVT, V2, Amt2);
19187 // Concatenate the result back
19188 return DAG.getNode(ISD::CONCAT_VECTORS, dl, VT, V1, V2);
19194 static SDValue LowerRotate(SDValue Op, const X86Subtarget *Subtarget,
19195 SelectionDAG &DAG) {
19196 MVT VT = Op.getSimpleValueType();
19198 SDValue R = Op.getOperand(0);
19199 SDValue Amt = Op.getOperand(1);
19201 assert(VT.isVector() && "Custom lowering only for vector rotates!");
19202 assert(Subtarget->hasXOP() && "XOP support required for vector rotates!");
19203 assert((Op.getOpcode() == ISD::ROTL) && "Only ROTL supported");
19205 // XOP has 128-bit vector variable + immediate rotates.
19206 // +ve/-ve Amt = rotate left/right.
19208 // Split 256-bit integers.
19209 if (VT.is256BitVector())
19210 return Lower256IntArith(Op, DAG);
19212 assert(VT.is128BitVector() && "Only rotate 128-bit vectors!");
19214 // Attempt to rotate by immediate.
19215 if (auto *BVAmt = dyn_cast<BuildVectorSDNode>(Amt)) {
19216 if (auto *RotateConst = BVAmt->getConstantSplatNode()) {
19217 uint64_t RotateAmt = RotateConst->getAPIntValue().getZExtValue();
19218 assert(RotateAmt < VT.getScalarSizeInBits() && "Rotation out of range");
19219 return DAG.getNode(X86ISD::VPROTI, DL, VT, R,
19220 DAG.getConstant(RotateAmt, DL, MVT::i8));
19224 // Use general rotate by variable (per-element).
19225 return DAG.getNode(X86ISD::VPROT, DL, VT, R, Amt);
19228 static SDValue LowerXALUO(SDValue Op, SelectionDAG &DAG) {
19229 // Lower the "add/sub/mul with overflow" instruction into a regular ins plus
19230 // a "setcc" instruction that checks the overflow flag. The "brcond" lowering
19231 // looks for this combo and may remove the "setcc" instruction if the "setcc"
19232 // has only one use.
19233 SDNode *N = Op.getNode();
19234 SDValue LHS = N->getOperand(0);
19235 SDValue RHS = N->getOperand(1);
19236 unsigned BaseOp = 0;
19239 switch (Op.getOpcode()) {
19240 default: llvm_unreachable("Unknown ovf instruction!");
19242 // A subtract of one will be selected as a INC. Note that INC doesn't
19243 // set CF, so we can't do this for UADDO.
19244 if (isOneConstant(RHS)) {
19245 BaseOp = X86ISD::INC;
19246 Cond = X86::COND_O;
19249 BaseOp = X86ISD::ADD;
19250 Cond = X86::COND_O;
19253 BaseOp = X86ISD::ADD;
19254 Cond = X86::COND_B;
19257 // A subtract of one will be selected as a DEC. Note that DEC doesn't
19258 // set CF, so we can't do this for USUBO.
19259 if (isOneConstant(RHS)) {
19260 BaseOp = X86ISD::DEC;
19261 Cond = X86::COND_O;
19264 BaseOp = X86ISD::SUB;
19265 Cond = X86::COND_O;
19268 BaseOp = X86ISD::SUB;
19269 Cond = X86::COND_B;
19272 BaseOp = N->getValueType(0) == MVT::i8 ? X86ISD::SMUL8 : X86ISD::SMUL;
19273 Cond = X86::COND_O;
19275 case ISD::UMULO: { // i64, i8 = umulo lhs, rhs --> i64, i64, i32 umul lhs,rhs
19276 if (N->getValueType(0) == MVT::i8) {
19277 BaseOp = X86ISD::UMUL8;
19278 Cond = X86::COND_O;
19281 SDVTList VTs = DAG.getVTList(N->getValueType(0), N->getValueType(0),
19283 SDValue Sum = DAG.getNode(X86ISD::UMUL, DL, VTs, LHS, RHS);
19286 DAG.getNode(X86ISD::SETCC, DL, MVT::i8,
19287 DAG.getConstant(X86::COND_O, DL, MVT::i32),
19288 SDValue(Sum.getNode(), 2));
19290 return DAG.getNode(ISD::MERGE_VALUES, DL, N->getVTList(), Sum, SetCC);
19294 // Also sets EFLAGS.
19295 SDVTList VTs = DAG.getVTList(N->getValueType(0), MVT::i32);
19296 SDValue Sum = DAG.getNode(BaseOp, DL, VTs, LHS, RHS);
19299 DAG.getNode(X86ISD::SETCC, DL, N->getValueType(1),
19300 DAG.getConstant(Cond, DL, MVT::i32),
19301 SDValue(Sum.getNode(), 1));
19303 return DAG.getNode(ISD::MERGE_VALUES, DL, N->getVTList(), Sum, SetCC);
19306 /// Returns true if the operand type is exactly twice the native width, and
19307 /// the corresponding cmpxchg8b or cmpxchg16b instruction is available.
19308 /// Used to know whether to use cmpxchg8/16b when expanding atomic operations
19309 /// (otherwise we leave them alone to become __sync_fetch_and_... calls).
19310 bool X86TargetLowering::needsCmpXchgNb(Type *MemType) const {
19311 unsigned OpWidth = MemType->getPrimitiveSizeInBits();
19314 return !Subtarget->is64Bit(); // FIXME this should be Subtarget.hasCmpxchg8b
19315 else if (OpWidth == 128)
19316 return Subtarget->hasCmpxchg16b();
19321 bool X86TargetLowering::shouldExpandAtomicStoreInIR(StoreInst *SI) const {
19322 return needsCmpXchgNb(SI->getValueOperand()->getType());
19325 // Note: this turns large loads into lock cmpxchg8b/16b.
19326 // FIXME: On 32 bits x86, fild/movq might be faster than lock cmpxchg8b.
19327 TargetLowering::AtomicExpansionKind
19328 X86TargetLowering::shouldExpandAtomicLoadInIR(LoadInst *LI) const {
19329 auto PTy = cast<PointerType>(LI->getPointerOperand()->getType());
19330 return needsCmpXchgNb(PTy->getElementType()) ? AtomicExpansionKind::CmpXChg
19331 : AtomicExpansionKind::None;
19334 TargetLowering::AtomicExpansionKind
19335 X86TargetLowering::shouldExpandAtomicRMWInIR(AtomicRMWInst *AI) const {
19336 unsigned NativeWidth = Subtarget->is64Bit() ? 64 : 32;
19337 Type *MemType = AI->getType();
19339 // If the operand is too big, we must see if cmpxchg8/16b is available
19340 // and default to library calls otherwise.
19341 if (MemType->getPrimitiveSizeInBits() > NativeWidth) {
19342 return needsCmpXchgNb(MemType) ? AtomicExpansionKind::CmpXChg
19343 : AtomicExpansionKind::None;
19346 AtomicRMWInst::BinOp Op = AI->getOperation();
19349 llvm_unreachable("Unknown atomic operation");
19350 case AtomicRMWInst::Xchg:
19351 case AtomicRMWInst::Add:
19352 case AtomicRMWInst::Sub:
19353 // It's better to use xadd, xsub or xchg for these in all cases.
19354 return AtomicExpansionKind::None;
19355 case AtomicRMWInst::Or:
19356 case AtomicRMWInst::And:
19357 case AtomicRMWInst::Xor:
19358 // If the atomicrmw's result isn't actually used, we can just add a "lock"
19359 // prefix to a normal instruction for these operations.
19360 return !AI->use_empty() ? AtomicExpansionKind::CmpXChg
19361 : AtomicExpansionKind::None;
19362 case AtomicRMWInst::Nand:
19363 case AtomicRMWInst::Max:
19364 case AtomicRMWInst::Min:
19365 case AtomicRMWInst::UMax:
19366 case AtomicRMWInst::UMin:
19367 // These always require a non-trivial set of data operations on x86. We must
19368 // use a cmpxchg loop.
19369 return AtomicExpansionKind::CmpXChg;
19373 static bool hasMFENCE(const X86Subtarget& Subtarget) {
19374 // Use mfence if we have SSE2 or we're on x86-64 (even if we asked for
19375 // no-sse2). There isn't any reason to disable it if the target processor
19377 return Subtarget.hasSSE2() || Subtarget.is64Bit();
19381 X86TargetLowering::lowerIdempotentRMWIntoFencedLoad(AtomicRMWInst *AI) const {
19382 unsigned NativeWidth = Subtarget->is64Bit() ? 64 : 32;
19383 Type *MemType = AI->getType();
19384 // Accesses larger than the native width are turned into cmpxchg/libcalls, so
19385 // there is no benefit in turning such RMWs into loads, and it is actually
19386 // harmful as it introduces a mfence.
19387 if (MemType->getPrimitiveSizeInBits() > NativeWidth)
19390 auto Builder = IRBuilder<>(AI);
19391 Module *M = Builder.GetInsertBlock()->getParent()->getParent();
19392 auto SynchScope = AI->getSynchScope();
19393 // We must restrict the ordering to avoid generating loads with Release or
19394 // ReleaseAcquire orderings.
19395 auto Order = AtomicCmpXchgInst::getStrongestFailureOrdering(AI->getOrdering());
19396 auto Ptr = AI->getPointerOperand();
19398 // Before the load we need a fence. Here is an example lifted from
19399 // http://www.hpl.hp.com/techreports/2012/HPL-2012-68.pdf showing why a fence
19402 // x.store(1, relaxed);
19403 // r1 = y.fetch_add(0, release);
19405 // y.fetch_add(42, acquire);
19406 // r2 = x.load(relaxed);
19407 // r1 = r2 = 0 is impossible, but becomes possible if the idempotent rmw is
19408 // lowered to just a load without a fence. A mfence flushes the store buffer,
19409 // making the optimization clearly correct.
19410 // FIXME: it is required if isAtLeastRelease(Order) but it is not clear
19411 // otherwise, we might be able to be more aggressive on relaxed idempotent
19412 // rmw. In practice, they do not look useful, so we don't try to be
19413 // especially clever.
19414 if (SynchScope == SingleThread)
19415 // FIXME: we could just insert an X86ISD::MEMBARRIER here, except we are at
19416 // the IR level, so we must wrap it in an intrinsic.
19419 if (!hasMFENCE(*Subtarget))
19420 // FIXME: it might make sense to use a locked operation here but on a
19421 // different cache-line to prevent cache-line bouncing. In practice it
19422 // is probably a small win, and x86 processors without mfence are rare
19423 // enough that we do not bother.
19427 llvm::Intrinsic::getDeclaration(M, Intrinsic::x86_sse2_mfence);
19428 Builder.CreateCall(MFence, {});
19430 // Finally we can emit the atomic load.
19431 LoadInst *Loaded = Builder.CreateAlignedLoad(Ptr,
19432 AI->getType()->getPrimitiveSizeInBits());
19433 Loaded->setAtomic(Order, SynchScope);
19434 AI->replaceAllUsesWith(Loaded);
19435 AI->eraseFromParent();
19439 static SDValue LowerATOMIC_FENCE(SDValue Op, const X86Subtarget *Subtarget,
19440 SelectionDAG &DAG) {
19442 AtomicOrdering FenceOrdering = static_cast<AtomicOrdering>(
19443 cast<ConstantSDNode>(Op.getOperand(1))->getZExtValue());
19444 SynchronizationScope FenceScope = static_cast<SynchronizationScope>(
19445 cast<ConstantSDNode>(Op.getOperand(2))->getZExtValue());
19447 // The only fence that needs an instruction is a sequentially-consistent
19448 // cross-thread fence.
19449 if (FenceOrdering == SequentiallyConsistent && FenceScope == CrossThread) {
19450 if (hasMFENCE(*Subtarget))
19451 return DAG.getNode(X86ISD::MFENCE, dl, MVT::Other, Op.getOperand(0));
19453 SDValue Chain = Op.getOperand(0);
19454 SDValue Zero = DAG.getConstant(0, dl, MVT::i32);
19456 DAG.getRegister(X86::ESP, MVT::i32), // Base
19457 DAG.getTargetConstant(1, dl, MVT::i8), // Scale
19458 DAG.getRegister(0, MVT::i32), // Index
19459 DAG.getTargetConstant(0, dl, MVT::i32), // Disp
19460 DAG.getRegister(0, MVT::i32), // Segment.
19464 SDNode *Res = DAG.getMachineNode(X86::OR32mrLocked, dl, MVT::Other, Ops);
19465 return SDValue(Res, 0);
19468 // MEMBARRIER is a compiler barrier; it codegens to a no-op.
19469 return DAG.getNode(X86ISD::MEMBARRIER, dl, MVT::Other, Op.getOperand(0));
19472 static SDValue LowerCMP_SWAP(SDValue Op, const X86Subtarget *Subtarget,
19473 SelectionDAG &DAG) {
19474 MVT T = Op.getSimpleValueType();
19478 switch(T.SimpleTy) {
19479 default: llvm_unreachable("Invalid value type!");
19480 case MVT::i8: Reg = X86::AL; size = 1; break;
19481 case MVT::i16: Reg = X86::AX; size = 2; break;
19482 case MVT::i32: Reg = X86::EAX; size = 4; break;
19484 assert(Subtarget->is64Bit() && "Node not type legal!");
19485 Reg = X86::RAX; size = 8;
19488 SDValue cpIn = DAG.getCopyToReg(Op.getOperand(0), DL, Reg,
19489 Op.getOperand(2), SDValue());
19490 SDValue Ops[] = { cpIn.getValue(0),
19493 DAG.getTargetConstant(size, DL, MVT::i8),
19494 cpIn.getValue(1) };
19495 SDVTList Tys = DAG.getVTList(MVT::Other, MVT::Glue);
19496 MachineMemOperand *MMO = cast<AtomicSDNode>(Op)->getMemOperand();
19497 SDValue Result = DAG.getMemIntrinsicNode(X86ISD::LCMPXCHG_DAG, DL, Tys,
19501 DAG.getCopyFromReg(Result.getValue(0), DL, Reg, T, Result.getValue(1));
19502 SDValue EFLAGS = DAG.getCopyFromReg(cpOut.getValue(1), DL, X86::EFLAGS,
19503 MVT::i32, cpOut.getValue(2));
19504 SDValue Success = DAG.getNode(X86ISD::SETCC, DL, Op->getValueType(1),
19505 DAG.getConstant(X86::COND_E, DL, MVT::i8),
19508 DAG.ReplaceAllUsesOfValueWith(Op.getValue(0), cpOut);
19509 DAG.ReplaceAllUsesOfValueWith(Op.getValue(1), Success);
19510 DAG.ReplaceAllUsesOfValueWith(Op.getValue(2), EFLAGS.getValue(1));
19514 static SDValue LowerBITCAST(SDValue Op, const X86Subtarget *Subtarget,
19515 SelectionDAG &DAG) {
19516 MVT SrcVT = Op.getOperand(0).getSimpleValueType();
19517 MVT DstVT = Op.getSimpleValueType();
19519 if (SrcVT == MVT::v2i32 || SrcVT == MVT::v4i16 || SrcVT == MVT::v8i8) {
19520 assert(Subtarget->hasSSE2() && "Requires at least SSE2!");
19521 if (DstVT != MVT::f64)
19522 // This conversion needs to be expanded.
19525 SDValue InVec = Op->getOperand(0);
19527 unsigned NumElts = SrcVT.getVectorNumElements();
19528 MVT SVT = SrcVT.getVectorElementType();
19530 // Widen the vector in input in the case of MVT::v2i32.
19531 // Example: from MVT::v2i32 to MVT::v4i32.
19532 SmallVector<SDValue, 16> Elts;
19533 for (unsigned i = 0, e = NumElts; i != e; ++i)
19534 Elts.push_back(DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, SVT, InVec,
19535 DAG.getIntPtrConstant(i, dl)));
19537 // Explicitly mark the extra elements as Undef.
19538 Elts.append(NumElts, DAG.getUNDEF(SVT));
19540 EVT NewVT = EVT::getVectorVT(*DAG.getContext(), SVT, NumElts * 2);
19541 SDValue BV = DAG.getNode(ISD::BUILD_VECTOR, dl, NewVT, Elts);
19542 SDValue ToV2F64 = DAG.getBitcast(MVT::v2f64, BV);
19543 return DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::f64, ToV2F64,
19544 DAG.getIntPtrConstant(0, dl));
19547 assert(Subtarget->is64Bit() && !Subtarget->hasSSE2() &&
19548 Subtarget->hasMMX() && "Unexpected custom BITCAST");
19549 assert((DstVT == MVT::i64 ||
19550 (DstVT.isVector() && DstVT.getSizeInBits()==64)) &&
19551 "Unexpected custom BITCAST");
19552 // i64 <=> MMX conversions are Legal.
19553 if (SrcVT==MVT::i64 && DstVT.isVector())
19555 if (DstVT==MVT::i64 && SrcVT.isVector())
19557 // MMX <=> MMX conversions are Legal.
19558 if (SrcVT.isVector() && DstVT.isVector())
19560 // All other conversions need to be expanded.
19564 /// Compute the horizontal sum of bytes in V for the elements of VT.
19566 /// Requires V to be a byte vector and VT to be an integer vector type with
19567 /// wider elements than V's type. The width of the elements of VT determines
19568 /// how many bytes of V are summed horizontally to produce each element of the
19570 static SDValue LowerHorizontalByteSum(SDValue V, MVT VT,
19571 const X86Subtarget *Subtarget,
19572 SelectionDAG &DAG) {
19574 MVT ByteVecVT = V.getSimpleValueType();
19575 MVT EltVT = VT.getVectorElementType();
19576 int NumElts = VT.getVectorNumElements();
19577 assert(ByteVecVT.getVectorElementType() == MVT::i8 &&
19578 "Expected value to have byte element type.");
19579 assert(EltVT != MVT::i8 &&
19580 "Horizontal byte sum only makes sense for wider elements!");
19581 unsigned VecSize = VT.getSizeInBits();
19582 assert(ByteVecVT.getSizeInBits() == VecSize && "Cannot change vector size!");
19584 // PSADBW instruction horizontally add all bytes and leave the result in i64
19585 // chunks, thus directly computes the pop count for v2i64 and v4i64.
19586 if (EltVT == MVT::i64) {
19587 SDValue Zeros = getZeroVector(ByteVecVT, Subtarget, DAG, DL);
19588 MVT SadVecVT = MVT::getVectorVT(MVT::i64, VecSize / 64);
19589 V = DAG.getNode(X86ISD::PSADBW, DL, SadVecVT, V, Zeros);
19590 return DAG.getBitcast(VT, V);
19593 if (EltVT == MVT::i32) {
19594 // We unpack the low half and high half into i32s interleaved with zeros so
19595 // that we can use PSADBW to horizontally sum them. The most useful part of
19596 // this is that it lines up the results of two PSADBW instructions to be
19597 // two v2i64 vectors which concatenated are the 4 population counts. We can
19598 // then use PACKUSWB to shrink and concatenate them into a v4i32 again.
19599 SDValue Zeros = getZeroVector(VT, Subtarget, DAG, DL);
19600 SDValue Low = DAG.getNode(X86ISD::UNPCKL, DL, VT, V, Zeros);
19601 SDValue High = DAG.getNode(X86ISD::UNPCKH, DL, VT, V, Zeros);
19603 // Do the horizontal sums into two v2i64s.
19604 Zeros = getZeroVector(ByteVecVT, Subtarget, DAG, DL);
19605 MVT SadVecVT = MVT::getVectorVT(MVT::i64, VecSize / 64);
19606 Low = DAG.getNode(X86ISD::PSADBW, DL, SadVecVT,
19607 DAG.getBitcast(ByteVecVT, Low), Zeros);
19608 High = DAG.getNode(X86ISD::PSADBW, DL, SadVecVT,
19609 DAG.getBitcast(ByteVecVT, High), Zeros);
19611 // Merge them together.
19612 MVT ShortVecVT = MVT::getVectorVT(MVT::i16, VecSize / 16);
19613 V = DAG.getNode(X86ISD::PACKUS, DL, ByteVecVT,
19614 DAG.getBitcast(ShortVecVT, Low),
19615 DAG.getBitcast(ShortVecVT, High));
19617 return DAG.getBitcast(VT, V);
19620 // The only element type left is i16.
19621 assert(EltVT == MVT::i16 && "Unknown how to handle type");
19623 // To obtain pop count for each i16 element starting from the pop count for
19624 // i8 elements, shift the i16s left by 8, sum as i8s, and then shift as i16s
19625 // right by 8. It is important to shift as i16s as i8 vector shift isn't
19626 // directly supported.
19627 SmallVector<SDValue, 16> Shifters(NumElts, DAG.getConstant(8, DL, EltVT));
19628 SDValue Shifter = DAG.getNode(ISD::BUILD_VECTOR, DL, VT, Shifters);
19629 SDValue Shl = DAG.getNode(ISD::SHL, DL, VT, DAG.getBitcast(VT, V), Shifter);
19630 V = DAG.getNode(ISD::ADD, DL, ByteVecVT, DAG.getBitcast(ByteVecVT, Shl),
19631 DAG.getBitcast(ByteVecVT, V));
19632 return DAG.getNode(ISD::SRL, DL, VT, DAG.getBitcast(VT, V), Shifter);
19635 static SDValue LowerVectorCTPOPInRegLUT(SDValue Op, SDLoc DL,
19636 const X86Subtarget *Subtarget,
19637 SelectionDAG &DAG) {
19638 MVT VT = Op.getSimpleValueType();
19639 MVT EltVT = VT.getVectorElementType();
19640 unsigned VecSize = VT.getSizeInBits();
19642 // Implement a lookup table in register by using an algorithm based on:
19643 // http://wm.ite.pl/articles/sse-popcount.html
19645 // The general idea is that every lower byte nibble in the input vector is an
19646 // index into a in-register pre-computed pop count table. We then split up the
19647 // input vector in two new ones: (1) a vector with only the shifted-right
19648 // higher nibbles for each byte and (2) a vector with the lower nibbles (and
19649 // masked out higher ones) for each byte. PSHUB is used separately with both
19650 // to index the in-register table. Next, both are added and the result is a
19651 // i8 vector where each element contains the pop count for input byte.
19653 // To obtain the pop count for elements != i8, we follow up with the same
19654 // approach and use additional tricks as described below.
19656 const int LUT[16] = {/* 0 */ 0, /* 1 */ 1, /* 2 */ 1, /* 3 */ 2,
19657 /* 4 */ 1, /* 5 */ 2, /* 6 */ 2, /* 7 */ 3,
19658 /* 8 */ 1, /* 9 */ 2, /* a */ 2, /* b */ 3,
19659 /* c */ 2, /* d */ 3, /* e */ 3, /* f */ 4};
19661 int NumByteElts = VecSize / 8;
19662 MVT ByteVecVT = MVT::getVectorVT(MVT::i8, NumByteElts);
19663 SDValue In = DAG.getBitcast(ByteVecVT, Op);
19664 SmallVector<SDValue, 16> LUTVec;
19665 for (int i = 0; i < NumByteElts; ++i)
19666 LUTVec.push_back(DAG.getConstant(LUT[i % 16], DL, MVT::i8));
19667 SDValue InRegLUT = DAG.getNode(ISD::BUILD_VECTOR, DL, ByteVecVT, LUTVec);
19668 SmallVector<SDValue, 16> Mask0F(NumByteElts,
19669 DAG.getConstant(0x0F, DL, MVT::i8));
19670 SDValue M0F = DAG.getNode(ISD::BUILD_VECTOR, DL, ByteVecVT, Mask0F);
19673 SmallVector<SDValue, 16> Four(NumByteElts, DAG.getConstant(4, DL, MVT::i8));
19674 SDValue FourV = DAG.getNode(ISD::BUILD_VECTOR, DL, ByteVecVT, Four);
19675 SDValue HighNibbles = DAG.getNode(ISD::SRL, DL, ByteVecVT, In, FourV);
19678 SDValue LowNibbles = DAG.getNode(ISD::AND, DL, ByteVecVT, In, M0F);
19680 // The input vector is used as the shuffle mask that index elements into the
19681 // LUT. After counting low and high nibbles, add the vector to obtain the
19682 // final pop count per i8 element.
19683 SDValue HighPopCnt =
19684 DAG.getNode(X86ISD::PSHUFB, DL, ByteVecVT, InRegLUT, HighNibbles);
19685 SDValue LowPopCnt =
19686 DAG.getNode(X86ISD::PSHUFB, DL, ByteVecVT, InRegLUT, LowNibbles);
19687 SDValue PopCnt = DAG.getNode(ISD::ADD, DL, ByteVecVT, HighPopCnt, LowPopCnt);
19689 if (EltVT == MVT::i8)
19692 return LowerHorizontalByteSum(PopCnt, VT, Subtarget, DAG);
19695 static SDValue LowerVectorCTPOPBitmath(SDValue Op, SDLoc DL,
19696 const X86Subtarget *Subtarget,
19697 SelectionDAG &DAG) {
19698 MVT VT = Op.getSimpleValueType();
19699 assert(VT.is128BitVector() &&
19700 "Only 128-bit vector bitmath lowering supported.");
19702 int VecSize = VT.getSizeInBits();
19703 MVT EltVT = VT.getVectorElementType();
19704 int Len = EltVT.getSizeInBits();
19706 // This is the vectorized version of the "best" algorithm from
19707 // http://graphics.stanford.edu/~seander/bithacks.html#CountBitsSetParallel
19708 // with a minor tweak to use a series of adds + shifts instead of vector
19709 // multiplications. Implemented for all integer vector types. We only use
19710 // this when we don't have SSSE3 which allows a LUT-based lowering that is
19711 // much faster, even faster than using native popcnt instructions.
19713 auto GetShift = [&](unsigned OpCode, SDValue V, int Shifter) {
19714 MVT VT = V.getSimpleValueType();
19715 SmallVector<SDValue, 32> Shifters(
19716 VT.getVectorNumElements(),
19717 DAG.getConstant(Shifter, DL, VT.getVectorElementType()));
19718 return DAG.getNode(OpCode, DL, VT, V,
19719 DAG.getNode(ISD::BUILD_VECTOR, DL, VT, Shifters));
19721 auto GetMask = [&](SDValue V, APInt Mask) {
19722 MVT VT = V.getSimpleValueType();
19723 SmallVector<SDValue, 32> Masks(
19724 VT.getVectorNumElements(),
19725 DAG.getConstant(Mask, DL, VT.getVectorElementType()));
19726 return DAG.getNode(ISD::AND, DL, VT, V,
19727 DAG.getNode(ISD::BUILD_VECTOR, DL, VT, Masks));
19730 // We don't want to incur the implicit masks required to SRL vNi8 vectors on
19731 // x86, so set the SRL type to have elements at least i16 wide. This is
19732 // correct because all of our SRLs are followed immediately by a mask anyways
19733 // that handles any bits that sneak into the high bits of the byte elements.
19734 MVT SrlVT = Len > 8 ? VT : MVT::getVectorVT(MVT::i16, VecSize / 16);
19738 // v = v - ((v >> 1) & 0x55555555...)
19740 DAG.getBitcast(VT, GetShift(ISD::SRL, DAG.getBitcast(SrlVT, V), 1));
19741 SDValue And = GetMask(Srl, APInt::getSplat(Len, APInt(8, 0x55)));
19742 V = DAG.getNode(ISD::SUB, DL, VT, V, And);
19744 // v = (v & 0x33333333...) + ((v >> 2) & 0x33333333...)
19745 SDValue AndLHS = GetMask(V, APInt::getSplat(Len, APInt(8, 0x33)));
19746 Srl = DAG.getBitcast(VT, GetShift(ISD::SRL, DAG.getBitcast(SrlVT, V), 2));
19747 SDValue AndRHS = GetMask(Srl, APInt::getSplat(Len, APInt(8, 0x33)));
19748 V = DAG.getNode(ISD::ADD, DL, VT, AndLHS, AndRHS);
19750 // v = (v + (v >> 4)) & 0x0F0F0F0F...
19751 Srl = DAG.getBitcast(VT, GetShift(ISD::SRL, DAG.getBitcast(SrlVT, V), 4));
19752 SDValue Add = DAG.getNode(ISD::ADD, DL, VT, V, Srl);
19753 V = GetMask(Add, APInt::getSplat(Len, APInt(8, 0x0F)));
19755 // At this point, V contains the byte-wise population count, and we are
19756 // merely doing a horizontal sum if necessary to get the wider element
19758 if (EltVT == MVT::i8)
19761 return LowerHorizontalByteSum(
19762 DAG.getBitcast(MVT::getVectorVT(MVT::i8, VecSize / 8), V), VT, Subtarget,
19766 static SDValue LowerVectorCTPOP(SDValue Op, const X86Subtarget *Subtarget,
19767 SelectionDAG &DAG) {
19768 MVT VT = Op.getSimpleValueType();
19769 // FIXME: Need to add AVX-512 support here!
19770 assert((VT.is256BitVector() || VT.is128BitVector()) &&
19771 "Unknown CTPOP type to handle");
19772 SDLoc DL(Op.getNode());
19773 SDValue Op0 = Op.getOperand(0);
19775 if (!Subtarget->hasSSSE3()) {
19776 // We can't use the fast LUT approach, so fall back on vectorized bitmath.
19777 assert(VT.is128BitVector() && "Only 128-bit vectors supported in SSE!");
19778 return LowerVectorCTPOPBitmath(Op0, DL, Subtarget, DAG);
19781 if (VT.is256BitVector() && !Subtarget->hasInt256()) {
19782 unsigned NumElems = VT.getVectorNumElements();
19784 // Extract each 128-bit vector, compute pop count and concat the result.
19785 SDValue LHS = Extract128BitVector(Op0, 0, DAG, DL);
19786 SDValue RHS = Extract128BitVector(Op0, NumElems/2, DAG, DL);
19788 return DAG.getNode(ISD::CONCAT_VECTORS, DL, VT,
19789 LowerVectorCTPOPInRegLUT(LHS, DL, Subtarget, DAG),
19790 LowerVectorCTPOPInRegLUT(RHS, DL, Subtarget, DAG));
19793 return LowerVectorCTPOPInRegLUT(Op0, DL, Subtarget, DAG);
19796 static SDValue LowerCTPOP(SDValue Op, const X86Subtarget *Subtarget,
19797 SelectionDAG &DAG) {
19798 assert(Op.getSimpleValueType().isVector() &&
19799 "We only do custom lowering for vector population count.");
19800 return LowerVectorCTPOP(Op, Subtarget, DAG);
19803 static SDValue LowerLOAD_SUB(SDValue Op, SelectionDAG &DAG) {
19804 SDNode *Node = Op.getNode();
19806 EVT T = Node->getValueType(0);
19807 SDValue negOp = DAG.getNode(ISD::SUB, dl, T,
19808 DAG.getConstant(0, dl, T), Node->getOperand(2));
19809 return DAG.getAtomic(ISD::ATOMIC_LOAD_ADD, dl,
19810 cast<AtomicSDNode>(Node)->getMemoryVT(),
19811 Node->getOperand(0),
19812 Node->getOperand(1), negOp,
19813 cast<AtomicSDNode>(Node)->getMemOperand(),
19814 cast<AtomicSDNode>(Node)->getOrdering(),
19815 cast<AtomicSDNode>(Node)->getSynchScope());
19818 static SDValue LowerATOMIC_STORE(SDValue Op, SelectionDAG &DAG) {
19819 SDNode *Node = Op.getNode();
19821 EVT VT = cast<AtomicSDNode>(Node)->getMemoryVT();
19823 // Convert seq_cst store -> xchg
19824 // Convert wide store -> swap (-> cmpxchg8b/cmpxchg16b)
19825 // FIXME: On 32-bit, store -> fist or movq would be more efficient
19826 // (The only way to get a 16-byte store is cmpxchg16b)
19827 // FIXME: 16-byte ATOMIC_SWAP isn't actually hooked up at the moment.
19828 if (cast<AtomicSDNode>(Node)->getOrdering() == SequentiallyConsistent ||
19829 !DAG.getTargetLoweringInfo().isTypeLegal(VT)) {
19830 SDValue Swap = DAG.getAtomic(ISD::ATOMIC_SWAP, dl,
19831 cast<AtomicSDNode>(Node)->getMemoryVT(),
19832 Node->getOperand(0),
19833 Node->getOperand(1), Node->getOperand(2),
19834 cast<AtomicSDNode>(Node)->getMemOperand(),
19835 cast<AtomicSDNode>(Node)->getOrdering(),
19836 cast<AtomicSDNode>(Node)->getSynchScope());
19837 return Swap.getValue(1);
19839 // Other atomic stores have a simple pattern.
19843 static SDValue LowerADDC_ADDE_SUBC_SUBE(SDValue Op, SelectionDAG &DAG) {
19844 MVT VT = Op.getNode()->getSimpleValueType(0);
19846 // Let legalize expand this if it isn't a legal type yet.
19847 if (!DAG.getTargetLoweringInfo().isTypeLegal(VT))
19850 SDVTList VTs = DAG.getVTList(VT, MVT::i32);
19853 bool ExtraOp = false;
19854 switch (Op.getOpcode()) {
19855 default: llvm_unreachable("Invalid code");
19856 case ISD::ADDC: Opc = X86ISD::ADD; break;
19857 case ISD::ADDE: Opc = X86ISD::ADC; ExtraOp = true; break;
19858 case ISD::SUBC: Opc = X86ISD::SUB; break;
19859 case ISD::SUBE: Opc = X86ISD::SBB; ExtraOp = true; break;
19863 return DAG.getNode(Opc, SDLoc(Op), VTs, Op.getOperand(0),
19865 return DAG.getNode(Opc, SDLoc(Op), VTs, Op.getOperand(0),
19866 Op.getOperand(1), Op.getOperand(2));
19869 static SDValue LowerFSINCOS(SDValue Op, const X86Subtarget *Subtarget,
19870 SelectionDAG &DAG) {
19871 assert(Subtarget->isTargetDarwin() && Subtarget->is64Bit());
19873 // For MacOSX, we want to call an alternative entry point: __sincos_stret,
19874 // which returns the values as { float, float } (in XMM0) or
19875 // { double, double } (which is returned in XMM0, XMM1).
19877 SDValue Arg = Op.getOperand(0);
19878 EVT ArgVT = Arg.getValueType();
19879 Type *ArgTy = ArgVT.getTypeForEVT(*DAG.getContext());
19881 TargetLowering::ArgListTy Args;
19882 TargetLowering::ArgListEntry Entry;
19886 Entry.isSExt = false;
19887 Entry.isZExt = false;
19888 Args.push_back(Entry);
19890 bool isF64 = ArgVT == MVT::f64;
19891 // Only optimize x86_64 for now. i386 is a bit messy. For f32,
19892 // the small struct {f32, f32} is returned in (eax, edx). For f64,
19893 // the results are returned via SRet in memory.
19894 const char *LibcallName = isF64 ? "__sincos_stret" : "__sincosf_stret";
19895 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
19897 DAG.getExternalSymbol(LibcallName, TLI.getPointerTy(DAG.getDataLayout()));
19899 Type *RetTy = isF64
19900 ? (Type*)StructType::get(ArgTy, ArgTy, nullptr)
19901 : (Type*)VectorType::get(ArgTy, 4);
19903 TargetLowering::CallLoweringInfo CLI(DAG);
19904 CLI.setDebugLoc(dl).setChain(DAG.getEntryNode())
19905 .setCallee(CallingConv::C, RetTy, Callee, std::move(Args), 0);
19907 std::pair<SDValue, SDValue> CallResult = TLI.LowerCallTo(CLI);
19910 // Returned in xmm0 and xmm1.
19911 return CallResult.first;
19913 // Returned in bits 0:31 and 32:64 xmm0.
19914 SDValue SinVal = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, ArgVT,
19915 CallResult.first, DAG.getIntPtrConstant(0, dl));
19916 SDValue CosVal = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, ArgVT,
19917 CallResult.first, DAG.getIntPtrConstant(1, dl));
19918 SDVTList Tys = DAG.getVTList(ArgVT, ArgVT);
19919 return DAG.getNode(ISD::MERGE_VALUES, dl, Tys, SinVal, CosVal);
19922 /// Widen a vector input to a vector of NVT. The
19923 /// input vector must have the same element type as NVT.
19924 static SDValue ExtendToType(SDValue InOp, MVT NVT, SelectionDAG &DAG,
19925 bool FillWithZeroes = false) {
19926 // Check if InOp already has the right width.
19927 MVT InVT = InOp.getSimpleValueType();
19931 if (InOp.isUndef())
19932 return DAG.getUNDEF(NVT);
19934 assert(InVT.getVectorElementType() == NVT.getVectorElementType() &&
19935 "input and widen element type must match");
19937 unsigned InNumElts = InVT.getVectorNumElements();
19938 unsigned WidenNumElts = NVT.getVectorNumElements();
19939 assert(WidenNumElts > InNumElts && WidenNumElts % InNumElts == 0 &&
19940 "Unexpected request for vector widening");
19942 EVT EltVT = NVT.getVectorElementType();
19945 if (InOp.getOpcode() == ISD::CONCAT_VECTORS &&
19946 InOp.getNumOperands() == 2) {
19947 SDValue N1 = InOp.getOperand(1);
19948 if ((ISD::isBuildVectorAllZeros(N1.getNode()) && FillWithZeroes) ||
19950 InOp = InOp.getOperand(0);
19951 InVT = InOp.getSimpleValueType();
19952 InNumElts = InVT.getVectorNumElements();
19955 if (ISD::isBuildVectorOfConstantSDNodes(InOp.getNode()) ||
19956 ISD::isBuildVectorOfConstantFPSDNodes(InOp.getNode())) {
19957 SmallVector<SDValue, 16> Ops;
19958 for (unsigned i = 0; i < InNumElts; ++i)
19959 Ops.push_back(InOp.getOperand(i));
19961 SDValue FillVal = FillWithZeroes ? DAG.getConstant(0, dl, EltVT) :
19962 DAG.getUNDEF(EltVT);
19963 for (unsigned i = 0; i < WidenNumElts - InNumElts; ++i)
19964 Ops.push_back(FillVal);
19965 return DAG.getNode(ISD::BUILD_VECTOR, dl, NVT, Ops);
19967 SDValue FillVal = FillWithZeroes ? DAG.getConstant(0, dl, NVT) :
19969 return DAG.getNode(ISD::INSERT_SUBVECTOR, dl, NVT, FillVal,
19970 InOp, DAG.getIntPtrConstant(0, dl));
19973 static SDValue LowerMSCATTER(SDValue Op, const X86Subtarget *Subtarget,
19974 SelectionDAG &DAG) {
19975 assert(Subtarget->hasAVX512() &&
19976 "MGATHER/MSCATTER are supported on AVX-512 arch only");
19978 // X86 scatter kills mask register, so its type should be added to
19979 // the list of return values.
19980 // If the "scatter" has 2 return values, it is already handled.
19981 if (Op.getNode()->getNumValues() == 2)
19984 MaskedScatterSDNode *N = cast<MaskedScatterSDNode>(Op.getNode());
19985 SDValue Src = N->getValue();
19986 MVT VT = Src.getSimpleValueType();
19987 assert(VT.getScalarSizeInBits() >= 32 && "Unsupported scatter op");
19990 SDValue NewScatter;
19991 SDValue Index = N->getIndex();
19992 SDValue Mask = N->getMask();
19993 SDValue Chain = N->getChain();
19994 SDValue BasePtr = N->getBasePtr();
19995 MVT MemVT = N->getMemoryVT().getSimpleVT();
19996 MVT IndexVT = Index.getSimpleValueType();
19997 MVT MaskVT = Mask.getSimpleValueType();
19999 if (MemVT.getScalarSizeInBits() < VT.getScalarSizeInBits()) {
20000 // The v2i32 value was promoted to v2i64.
20001 // Now we "redo" the type legalizer's work and widen the original
20002 // v2i32 value to v4i32. The original v2i32 is retrieved from v2i64
20004 assert((MemVT == MVT::v2i32 && VT == MVT::v2i64) &&
20005 "Unexpected memory type");
20006 int ShuffleMask[] = {0, 2, -1, -1};
20007 Src = DAG.getVectorShuffle(MVT::v4i32, dl, DAG.getBitcast(MVT::v4i32, Src),
20008 DAG.getUNDEF(MVT::v4i32), ShuffleMask);
20009 // Now we have 4 elements instead of 2.
20010 // Expand the index.
20011 MVT NewIndexVT = MVT::getVectorVT(IndexVT.getScalarType(), 4);
20012 Index = ExtendToType(Index, NewIndexVT, DAG);
20014 // Expand the mask with zeroes
20015 // Mask may be <2 x i64> or <2 x i1> at this moment
20016 assert((MaskVT == MVT::v2i1 || MaskVT == MVT::v2i64) &&
20017 "Unexpected mask type");
20018 MVT ExtMaskVT = MVT::getVectorVT(MaskVT.getScalarType(), 4);
20019 Mask = ExtendToType(Mask, ExtMaskVT, DAG, true);
20023 unsigned NumElts = VT.getVectorNumElements();
20024 if (!Subtarget->hasVLX() && !VT.is512BitVector() &&
20025 !Index.getSimpleValueType().is512BitVector()) {
20026 // AVX512F supports only 512-bit vectors. Or data or index should
20027 // be 512 bit wide. If now the both index and data are 256-bit, but
20028 // the vector contains 8 elements, we just sign-extend the index
20029 if (IndexVT == MVT::v8i32)
20030 // Just extend index
20031 Index = DAG.getNode(ISD::SIGN_EXTEND, dl, MVT::v8i64, Index);
20033 // The minimal number of elts in scatter is 8
20036 MVT NewIndexVT = MVT::getVectorVT(IndexVT.getScalarType(), NumElts);
20037 // Use original index here, do not modify the index twice
20038 Index = ExtendToType(N->getIndex(), NewIndexVT, DAG);
20039 if (IndexVT.getScalarType() == MVT::i32)
20040 Index = DAG.getNode(ISD::SIGN_EXTEND, dl, MVT::v8i64, Index);
20043 // At this point we have promoted mask operand
20044 assert(MaskVT.getScalarSizeInBits() >= 32 && "unexpected mask type");
20045 MVT ExtMaskVT = MVT::getVectorVT(MaskVT.getScalarType(), NumElts);
20046 // Use the original mask here, do not modify the mask twice
20047 Mask = ExtendToType(N->getMask(), ExtMaskVT, DAG, true);
20049 // The value that should be stored
20050 MVT NewVT = MVT::getVectorVT(VT.getScalarType(), NumElts);
20051 Src = ExtendToType(Src, NewVT, DAG);
20054 // If the mask is "wide" at this point - truncate it to i1 vector
20055 MVT BitMaskVT = MVT::getVectorVT(MVT::i1, NumElts);
20056 Mask = DAG.getNode(ISD::TRUNCATE, dl, BitMaskVT, Mask);
20058 // The mask is killed by scatter, add it to the values
20059 SDVTList VTs = DAG.getVTList(BitMaskVT, MVT::Other);
20060 SDValue Ops[] = {Chain, Src, Mask, BasePtr, Index};
20061 NewScatter = DAG.getMaskedScatter(VTs, N->getMemoryVT(), dl, Ops,
20062 N->getMemOperand());
20063 DAG.ReplaceAllUsesWith(Op, SDValue(NewScatter.getNode(), 1));
20064 return SDValue(NewScatter.getNode(), 0);
20067 static SDValue LowerMLOAD(SDValue Op, const X86Subtarget *Subtarget,
20068 SelectionDAG &DAG) {
20070 MaskedLoadSDNode *N = cast<MaskedLoadSDNode>(Op.getNode());
20071 MVT VT = Op.getSimpleValueType();
20072 SDValue Mask = N->getMask();
20075 if (Subtarget->hasAVX512() && !Subtarget->hasVLX() &&
20076 !VT.is512BitVector() && Mask.getValueType() == MVT::v8i1) {
20077 // This operation is legal for targets with VLX, but without
20078 // VLX the vector should be widened to 512 bit
20079 unsigned NumEltsInWideVec = 512/VT.getScalarSizeInBits();
20080 MVT WideDataVT = MVT::getVectorVT(VT.getScalarType(), NumEltsInWideVec);
20081 MVT WideMaskVT = MVT::getVectorVT(MVT::i1, NumEltsInWideVec);
20082 SDValue Src0 = N->getSrc0();
20083 Src0 = ExtendToType(Src0, WideDataVT, DAG);
20084 Mask = ExtendToType(Mask, WideMaskVT, DAG, true);
20085 SDValue NewLoad = DAG.getMaskedLoad(WideDataVT, dl, N->getChain(),
20086 N->getBasePtr(), Mask, Src0,
20087 N->getMemoryVT(), N->getMemOperand(),
20088 N->getExtensionType());
20090 SDValue Exract = DAG.getNode(ISD::EXTRACT_SUBVECTOR, dl, VT,
20091 NewLoad.getValue(0),
20092 DAG.getIntPtrConstant(0, dl));
20093 SDValue RetOps[] = {Exract, NewLoad.getValue(1)};
20094 return DAG.getMergeValues(RetOps, dl);
20099 static SDValue LowerMSTORE(SDValue Op, const X86Subtarget *Subtarget,
20100 SelectionDAG &DAG) {
20101 MaskedStoreSDNode *N = cast<MaskedStoreSDNode>(Op.getNode());
20102 SDValue DataToStore = N->getValue();
20103 MVT VT = DataToStore.getSimpleValueType();
20104 SDValue Mask = N->getMask();
20107 if (Subtarget->hasAVX512() && !Subtarget->hasVLX() &&
20108 !VT.is512BitVector() && Mask.getValueType() == MVT::v8i1) {
20109 // This operation is legal for targets with VLX, but without
20110 // VLX the vector should be widened to 512 bit
20111 unsigned NumEltsInWideVec = 512/VT.getScalarSizeInBits();
20112 MVT WideDataVT = MVT::getVectorVT(VT.getScalarType(), NumEltsInWideVec);
20113 MVT WideMaskVT = MVT::getVectorVT(MVT::i1, NumEltsInWideVec);
20114 DataToStore = ExtendToType(DataToStore, WideDataVT, DAG);
20115 Mask = ExtendToType(Mask, WideMaskVT, DAG, true);
20116 return DAG.getMaskedStore(N->getChain(), dl, DataToStore, N->getBasePtr(),
20117 Mask, N->getMemoryVT(), N->getMemOperand(),
20118 N->isTruncatingStore());
20123 static SDValue LowerMGATHER(SDValue Op, const X86Subtarget *Subtarget,
20124 SelectionDAG &DAG) {
20125 assert(Subtarget->hasAVX512() &&
20126 "MGATHER/MSCATTER are supported on AVX-512 arch only");
20128 MaskedGatherSDNode *N = cast<MaskedGatherSDNode>(Op.getNode());
20130 MVT VT = Op.getSimpleValueType();
20131 SDValue Index = N->getIndex();
20132 SDValue Mask = N->getMask();
20133 SDValue Src0 = N->getValue();
20134 MVT IndexVT = Index.getSimpleValueType();
20135 MVT MaskVT = Mask.getSimpleValueType();
20137 unsigned NumElts = VT.getVectorNumElements();
20138 assert(VT.getScalarSizeInBits() >= 32 && "Unsupported gather op");
20140 if (!Subtarget->hasVLX() && !VT.is512BitVector() &&
20141 !Index.getSimpleValueType().is512BitVector()) {
20142 // AVX512F supports only 512-bit vectors. Or data or index should
20143 // be 512 bit wide. If now the both index and data are 256-bit, but
20144 // the vector contains 8 elements, we just sign-extend the index
20145 if (NumElts == 8) {
20146 Index = DAG.getNode(ISD::SIGN_EXTEND, dl, MVT::v8i64, Index);
20147 SDValue Ops[] = { N->getOperand(0), N->getOperand(1), N->getOperand(2),
20148 N->getOperand(3), Index };
20149 DAG.UpdateNodeOperands(N, Ops);
20153 // Minimal number of elements in Gather
20156 MVT NewIndexVT = MVT::getVectorVT(IndexVT.getScalarType(), NumElts);
20157 Index = ExtendToType(Index, NewIndexVT, DAG);
20158 if (IndexVT.getScalarType() == MVT::i32)
20159 Index = DAG.getNode(ISD::SIGN_EXTEND, dl, MVT::v8i64, Index);
20162 MVT MaskBitVT = MVT::getVectorVT(MVT::i1, NumElts);
20163 // At this point we have promoted mask operand
20164 assert(MaskVT.getScalarSizeInBits() >= 32 && "unexpected mask type");
20165 MVT ExtMaskVT = MVT::getVectorVT(MaskVT.getScalarType(), NumElts);
20166 Mask = ExtendToType(Mask, ExtMaskVT, DAG, true);
20167 Mask = DAG.getNode(ISD::TRUNCATE, dl, MaskBitVT, Mask);
20169 // The pass-thru value
20170 MVT NewVT = MVT::getVectorVT(VT.getScalarType(), NumElts);
20171 Src0 = ExtendToType(Src0, NewVT, DAG);
20173 SDValue Ops[] = { N->getChain(), Src0, Mask, N->getBasePtr(), Index };
20174 SDValue NewGather = DAG.getMaskedGather(DAG.getVTList(NewVT, MVT::Other),
20175 N->getMemoryVT(), dl, Ops,
20176 N->getMemOperand());
20177 SDValue Exract = DAG.getNode(ISD::EXTRACT_SUBVECTOR, dl, VT,
20178 NewGather.getValue(0),
20179 DAG.getIntPtrConstant(0, dl));
20180 SDValue RetOps[] = {Exract, NewGather.getValue(1)};
20181 return DAG.getMergeValues(RetOps, dl);
20186 SDValue X86TargetLowering::LowerGC_TRANSITION_START(SDValue Op,
20187 SelectionDAG &DAG) const {
20188 // TODO: Eventually, the lowering of these nodes should be informed by or
20189 // deferred to the GC strategy for the function in which they appear. For
20190 // now, however, they must be lowered to something. Since they are logically
20191 // no-ops in the case of a null GC strategy (or a GC strategy which does not
20192 // require special handling for these nodes), lower them as literal NOOPs for
20194 SmallVector<SDValue, 2> Ops;
20196 Ops.push_back(Op.getOperand(0));
20197 if (Op->getGluedNode())
20198 Ops.push_back(Op->getOperand(Op->getNumOperands() - 1));
20201 SDVTList VTs = DAG.getVTList(MVT::Other, MVT::Glue);
20202 SDValue NOOP(DAG.getMachineNode(X86::NOOP, SDLoc(Op), VTs, Ops), 0);
20207 SDValue X86TargetLowering::LowerGC_TRANSITION_END(SDValue Op,
20208 SelectionDAG &DAG) const {
20209 // TODO: Eventually, the lowering of these nodes should be informed by or
20210 // deferred to the GC strategy for the function in which they appear. For
20211 // now, however, they must be lowered to something. Since they are logically
20212 // no-ops in the case of a null GC strategy (or a GC strategy which does not
20213 // require special handling for these nodes), lower them as literal NOOPs for
20215 SmallVector<SDValue, 2> Ops;
20217 Ops.push_back(Op.getOperand(0));
20218 if (Op->getGluedNode())
20219 Ops.push_back(Op->getOperand(Op->getNumOperands() - 1));
20222 SDVTList VTs = DAG.getVTList(MVT::Other, MVT::Glue);
20223 SDValue NOOP(DAG.getMachineNode(X86::NOOP, SDLoc(Op), VTs, Ops), 0);
20228 /// LowerOperation - Provide custom lowering hooks for some operations.
20230 SDValue X86TargetLowering::LowerOperation(SDValue Op, SelectionDAG &DAG) const {
20231 switch (Op.getOpcode()) {
20232 default: llvm_unreachable("Should not custom lower this!");
20233 case ISD::ATOMIC_FENCE: return LowerATOMIC_FENCE(Op, Subtarget, DAG);
20234 case ISD::ATOMIC_CMP_SWAP_WITH_SUCCESS:
20235 return LowerCMP_SWAP(Op, Subtarget, DAG);
20236 case ISD::CTPOP: return LowerCTPOP(Op, Subtarget, DAG);
20237 case ISD::ATOMIC_LOAD_SUB: return LowerLOAD_SUB(Op,DAG);
20238 case ISD::ATOMIC_STORE: return LowerATOMIC_STORE(Op,DAG);
20239 case ISD::BUILD_VECTOR: return LowerBUILD_VECTOR(Op, DAG);
20240 case ISD::CONCAT_VECTORS: return LowerCONCAT_VECTORS(Op, Subtarget, DAG);
20241 case ISD::VECTOR_SHUFFLE: return lowerVectorShuffle(Op, Subtarget, DAG);
20242 case ISD::VSELECT: return LowerVSELECT(Op, DAG);
20243 case ISD::EXTRACT_VECTOR_ELT: return LowerEXTRACT_VECTOR_ELT(Op, DAG);
20244 case ISD::INSERT_VECTOR_ELT: return LowerINSERT_VECTOR_ELT(Op, DAG);
20245 case ISD::EXTRACT_SUBVECTOR: return LowerEXTRACT_SUBVECTOR(Op,Subtarget,DAG);
20246 case ISD::INSERT_SUBVECTOR: return LowerINSERT_SUBVECTOR(Op, Subtarget,DAG);
20247 case ISD::SCALAR_TO_VECTOR: return LowerSCALAR_TO_VECTOR(Op, DAG);
20248 case ISD::ConstantPool: return LowerConstantPool(Op, DAG);
20249 case ISD::GlobalAddress: return LowerGlobalAddress(Op, DAG);
20250 case ISD::GlobalTLSAddress: return LowerGlobalTLSAddress(Op, DAG);
20251 case ISD::ExternalSymbol: return LowerExternalSymbol(Op, DAG);
20252 case ISD::BlockAddress: return LowerBlockAddress(Op, DAG);
20253 case ISD::SHL_PARTS:
20254 case ISD::SRA_PARTS:
20255 case ISD::SRL_PARTS: return LowerShiftParts(Op, DAG);
20256 case ISD::SINT_TO_FP: return LowerSINT_TO_FP(Op, DAG);
20257 case ISD::UINT_TO_FP: return LowerUINT_TO_FP(Op, DAG);
20258 case ISD::TRUNCATE: return LowerTRUNCATE(Op, DAG);
20259 case ISD::ZERO_EXTEND: return LowerZERO_EXTEND(Op, Subtarget, DAG);
20260 case ISD::SIGN_EXTEND: return LowerSIGN_EXTEND(Op, Subtarget, DAG);
20261 case ISD::ANY_EXTEND: return LowerANY_EXTEND(Op, Subtarget, DAG);
20262 case ISD::SIGN_EXTEND_VECTOR_INREG:
20263 return LowerSIGN_EXTEND_VECTOR_INREG(Op, Subtarget, DAG);
20264 case ISD::FP_TO_SINT: return LowerFP_TO_SINT(Op, DAG);
20265 case ISD::FP_TO_UINT: return LowerFP_TO_UINT(Op, DAG);
20266 case ISD::FP_EXTEND: return LowerFP_EXTEND(Op, DAG);
20267 case ISD::LOAD: return LowerExtendedLoad(Op, Subtarget, DAG);
20269 case ISD::FNEG: return LowerFABSorFNEG(Op, DAG);
20270 case ISD::FCOPYSIGN: return LowerFCOPYSIGN(Op, DAG);
20271 case ISD::FGETSIGN: return LowerFGETSIGN(Op, DAG);
20272 case ISD::SETCC: return LowerSETCC(Op, DAG);
20273 case ISD::SETCCE: return LowerSETCCE(Op, DAG);
20274 case ISD::SELECT: return LowerSELECT(Op, DAG);
20275 case ISD::BRCOND: return LowerBRCOND(Op, DAG);
20276 case ISD::JumpTable: return LowerJumpTable(Op, DAG);
20277 case ISD::VASTART: return LowerVASTART(Op, DAG);
20278 case ISD::VAARG: return LowerVAARG(Op, DAG);
20279 case ISD::VACOPY: return LowerVACOPY(Op, Subtarget, DAG);
20280 case ISD::INTRINSIC_WO_CHAIN: return LowerINTRINSIC_WO_CHAIN(Op, Subtarget, DAG);
20281 case ISD::INTRINSIC_VOID:
20282 case ISD::INTRINSIC_W_CHAIN: return LowerINTRINSIC_W_CHAIN(Op, Subtarget, DAG);
20283 case ISD::RETURNADDR: return LowerRETURNADDR(Op, DAG);
20284 case ISD::FRAMEADDR: return LowerFRAMEADDR(Op, DAG);
20285 case ISD::FRAME_TO_ARGS_OFFSET:
20286 return LowerFRAME_TO_ARGS_OFFSET(Op, DAG);
20287 case ISD::DYNAMIC_STACKALLOC: return LowerDYNAMIC_STACKALLOC(Op, DAG);
20288 case ISD::EH_RETURN: return LowerEH_RETURN(Op, DAG);
20289 case ISD::EH_SJLJ_SETJMP: return lowerEH_SJLJ_SETJMP(Op, DAG);
20290 case ISD::EH_SJLJ_LONGJMP: return lowerEH_SJLJ_LONGJMP(Op, DAG);
20291 case ISD::INIT_TRAMPOLINE: return LowerINIT_TRAMPOLINE(Op, DAG);
20292 case ISD::ADJUST_TRAMPOLINE: return LowerADJUST_TRAMPOLINE(Op, DAG);
20293 case ISD::FLT_ROUNDS_: return LowerFLT_ROUNDS_(Op, DAG);
20294 case ISD::CTLZ: return LowerCTLZ(Op, Subtarget, DAG);
20295 case ISD::CTLZ_ZERO_UNDEF: return LowerCTLZ_ZERO_UNDEF(Op, Subtarget, DAG);
20297 case ISD::CTTZ_ZERO_UNDEF: return LowerCTTZ(Op, DAG);
20298 case ISD::MUL: return LowerMUL(Op, Subtarget, DAG);
20299 case ISD::UMUL_LOHI:
20300 case ISD::SMUL_LOHI: return LowerMUL_LOHI(Op, Subtarget, DAG);
20301 case ISD::ROTL: return LowerRotate(Op, Subtarget, DAG);
20304 case ISD::SHL: return LowerShift(Op, Subtarget, DAG);
20310 case ISD::UMULO: return LowerXALUO(Op, DAG);
20311 case ISD::READCYCLECOUNTER: return LowerREADCYCLECOUNTER(Op, Subtarget,DAG);
20312 case ISD::BITCAST: return LowerBITCAST(Op, Subtarget, DAG);
20316 case ISD::SUBE: return LowerADDC_ADDE_SUBC_SUBE(Op, DAG);
20317 case ISD::ADD: return LowerADD(Op, DAG);
20318 case ISD::SUB: return LowerSUB(Op, DAG);
20322 case ISD::UMIN: return LowerMINMAX(Op, DAG);
20323 case ISD::FSINCOS: return LowerFSINCOS(Op, Subtarget, DAG);
20324 case ISD::MLOAD: return LowerMLOAD(Op, Subtarget, DAG);
20325 case ISD::MSTORE: return LowerMSTORE(Op, Subtarget, DAG);
20326 case ISD::MGATHER: return LowerMGATHER(Op, Subtarget, DAG);
20327 case ISD::MSCATTER: return LowerMSCATTER(Op, Subtarget, DAG);
20328 case ISD::GC_TRANSITION_START:
20329 return LowerGC_TRANSITION_START(Op, DAG);
20330 case ISD::GC_TRANSITION_END: return LowerGC_TRANSITION_END(Op, DAG);
20334 /// ReplaceNodeResults - Replace a node with an illegal result type
20335 /// with a new node built out of custom code.
20336 void X86TargetLowering::ReplaceNodeResults(SDNode *N,
20337 SmallVectorImpl<SDValue>&Results,
20338 SelectionDAG &DAG) const {
20340 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
20341 switch (N->getOpcode()) {
20343 llvm_unreachable("Do not know how to custom type legalize this operation!");
20344 case X86ISD::AVG: {
20345 // Legalize types for X86ISD::AVG by expanding vectors.
20346 assert(Subtarget->hasSSE2() && "Requires at least SSE2!");
20348 auto InVT = N->getValueType(0);
20349 auto InVTSize = InVT.getSizeInBits();
20350 const unsigned RegSize =
20351 (InVTSize > 128) ? ((InVTSize > 256) ? 512 : 256) : 128;
20352 assert((!Subtarget->hasAVX512() || RegSize < 512) &&
20353 "512-bit vector requires AVX512");
20354 assert((!Subtarget->hasAVX2() || RegSize < 256) &&
20355 "256-bit vector requires AVX2");
20357 auto ElemVT = InVT.getVectorElementType();
20358 auto RegVT = EVT::getVectorVT(*DAG.getContext(), ElemVT,
20359 RegSize / ElemVT.getSizeInBits());
20360 assert(RegSize % InVT.getSizeInBits() == 0);
20361 unsigned NumConcat = RegSize / InVT.getSizeInBits();
20363 SmallVector<SDValue, 16> Ops(NumConcat, DAG.getUNDEF(InVT));
20364 Ops[0] = N->getOperand(0);
20365 SDValue InVec0 = DAG.getNode(ISD::CONCAT_VECTORS, dl, RegVT, Ops);
20366 Ops[0] = N->getOperand(1);
20367 SDValue InVec1 = DAG.getNode(ISD::CONCAT_VECTORS, dl, RegVT, Ops);
20369 SDValue Res = DAG.getNode(X86ISD::AVG, dl, RegVT, InVec0, InVec1);
20370 Results.push_back(DAG.getNode(ISD::EXTRACT_SUBVECTOR, dl, InVT, Res,
20371 DAG.getIntPtrConstant(0, dl)));
20374 // We might have generated v2f32 FMIN/FMAX operations. Widen them to v4f32.
20375 case X86ISD::FMINC:
20377 case X86ISD::FMAXC:
20378 case X86ISD::FMAX: {
20379 EVT VT = N->getValueType(0);
20380 assert(VT == MVT::v2f32 && "Unexpected type (!= v2f32) on FMIN/FMAX.");
20381 SDValue UNDEF = DAG.getUNDEF(VT);
20382 SDValue LHS = DAG.getNode(ISD::CONCAT_VECTORS, dl, MVT::v4f32,
20383 N->getOperand(0), UNDEF);
20384 SDValue RHS = DAG.getNode(ISD::CONCAT_VECTORS, dl, MVT::v4f32,
20385 N->getOperand(1), UNDEF);
20386 Results.push_back(DAG.getNode(N->getOpcode(), dl, MVT::v4f32, LHS, RHS));
20389 case ISD::SIGN_EXTEND_INREG:
20394 // We don't want to expand or promote these.
20401 case ISD::UDIVREM: {
20402 SDValue V = LowerWin64_i128OP(SDValue(N,0), DAG);
20403 Results.push_back(V);
20406 case ISD::FP_TO_SINT:
20407 case ISD::FP_TO_UINT: {
20408 bool IsSigned = N->getOpcode() == ISD::FP_TO_SINT;
20410 std::pair<SDValue,SDValue> Vals =
20411 FP_TO_INTHelper(SDValue(N, 0), DAG, IsSigned, /*IsReplace=*/ true);
20412 SDValue FIST = Vals.first, StackSlot = Vals.second;
20413 if (FIST.getNode()) {
20414 EVT VT = N->getValueType(0);
20415 // Return a load from the stack slot.
20416 if (StackSlot.getNode())
20417 Results.push_back(DAG.getLoad(VT, dl, FIST, StackSlot,
20418 MachinePointerInfo(),
20419 false, false, false, 0));
20421 Results.push_back(FIST);
20425 case ISD::UINT_TO_FP: {
20426 assert(Subtarget->hasSSE2() && "Requires at least SSE2!");
20427 if (N->getOperand(0).getValueType() != MVT::v2i32 ||
20428 N->getValueType(0) != MVT::v2f32)
20430 SDValue ZExtIn = DAG.getNode(ISD::ZERO_EXTEND, dl, MVT::v2i64,
20432 SDValue Bias = DAG.getConstantFP(BitsToDouble(0x4330000000000000ULL), dl,
20434 SDValue VBias = DAG.getNode(ISD::BUILD_VECTOR, dl, MVT::v2f64, Bias, Bias);
20435 SDValue Or = DAG.getNode(ISD::OR, dl, MVT::v2i64, ZExtIn,
20436 DAG.getBitcast(MVT::v2i64, VBias));
20437 Or = DAG.getBitcast(MVT::v2f64, Or);
20438 // TODO: Are there any fast-math-flags to propagate here?
20439 SDValue Sub = DAG.getNode(ISD::FSUB, dl, MVT::v2f64, Or, VBias);
20440 Results.push_back(DAG.getNode(X86ISD::VFPROUND, dl, MVT::v4f32, Sub));
20443 case ISD::FP_ROUND: {
20444 if (!TLI.isTypeLegal(N->getOperand(0).getValueType()))
20446 SDValue V = DAG.getNode(X86ISD::VFPROUND, dl, MVT::v4f32, N->getOperand(0));
20447 Results.push_back(V);
20450 case ISD::FP_EXTEND: {
20451 // Right now, only MVT::v2f32 has OperationAction for FP_EXTEND.
20452 // No other ValueType for FP_EXTEND should reach this point.
20453 assert(N->getValueType(0) == MVT::v2f32 &&
20454 "Do not know how to legalize this Node");
20457 case ISD::INTRINSIC_W_CHAIN: {
20458 unsigned IntNo = cast<ConstantSDNode>(N->getOperand(1))->getZExtValue();
20460 default : llvm_unreachable("Do not know how to custom type "
20461 "legalize this intrinsic operation!");
20462 case Intrinsic::x86_rdtsc:
20463 return getReadTimeStampCounter(N, dl, X86ISD::RDTSC_DAG, DAG, Subtarget,
20465 case Intrinsic::x86_rdtscp:
20466 return getReadTimeStampCounter(N, dl, X86ISD::RDTSCP_DAG, DAG, Subtarget,
20468 case Intrinsic::x86_rdpmc:
20469 return getReadPerformanceCounter(N, dl, DAG, Subtarget, Results);
20472 case ISD::INTRINSIC_WO_CHAIN: {
20473 if (SDValue V = LowerINTRINSIC_WO_CHAIN(SDValue(N, 0), Subtarget, DAG))
20474 Results.push_back(V);
20477 case ISD::READCYCLECOUNTER: {
20478 return getReadTimeStampCounter(N, dl, X86ISD::RDTSC_DAG, DAG, Subtarget,
20481 case ISD::ATOMIC_CMP_SWAP_WITH_SUCCESS: {
20482 EVT T = N->getValueType(0);
20483 assert((T == MVT::i64 || T == MVT::i128) && "can only expand cmpxchg pair");
20484 bool Regs64bit = T == MVT::i128;
20485 MVT HalfT = Regs64bit ? MVT::i64 : MVT::i32;
20486 SDValue cpInL, cpInH;
20487 cpInL = DAG.getNode(ISD::EXTRACT_ELEMENT, dl, HalfT, N->getOperand(2),
20488 DAG.getConstant(0, dl, HalfT));
20489 cpInH = DAG.getNode(ISD::EXTRACT_ELEMENT, dl, HalfT, N->getOperand(2),
20490 DAG.getConstant(1, dl, HalfT));
20491 cpInL = DAG.getCopyToReg(N->getOperand(0), dl,
20492 Regs64bit ? X86::RAX : X86::EAX,
20494 cpInH = DAG.getCopyToReg(cpInL.getValue(0), dl,
20495 Regs64bit ? X86::RDX : X86::EDX,
20496 cpInH, cpInL.getValue(1));
20497 SDValue swapInL, swapInH;
20498 swapInL = DAG.getNode(ISD::EXTRACT_ELEMENT, dl, HalfT, N->getOperand(3),
20499 DAG.getConstant(0, dl, HalfT));
20500 swapInH = DAG.getNode(ISD::EXTRACT_ELEMENT, dl, HalfT, N->getOperand(3),
20501 DAG.getConstant(1, dl, HalfT));
20502 swapInL = DAG.getCopyToReg(cpInH.getValue(0), dl,
20503 Regs64bit ? X86::RBX : X86::EBX,
20504 swapInL, cpInH.getValue(1));
20505 swapInH = DAG.getCopyToReg(swapInL.getValue(0), dl,
20506 Regs64bit ? X86::RCX : X86::ECX,
20507 swapInH, swapInL.getValue(1));
20508 SDValue Ops[] = { swapInH.getValue(0),
20510 swapInH.getValue(1) };
20511 SDVTList Tys = DAG.getVTList(MVT::Other, MVT::Glue);
20512 MachineMemOperand *MMO = cast<AtomicSDNode>(N)->getMemOperand();
20513 unsigned Opcode = Regs64bit ? X86ISD::LCMPXCHG16_DAG :
20514 X86ISD::LCMPXCHG8_DAG;
20515 SDValue Result = DAG.getMemIntrinsicNode(Opcode, dl, Tys, Ops, T, MMO);
20516 SDValue cpOutL = DAG.getCopyFromReg(Result.getValue(0), dl,
20517 Regs64bit ? X86::RAX : X86::EAX,
20518 HalfT, Result.getValue(1));
20519 SDValue cpOutH = DAG.getCopyFromReg(cpOutL.getValue(1), dl,
20520 Regs64bit ? X86::RDX : X86::EDX,
20521 HalfT, cpOutL.getValue(2));
20522 SDValue OpsF[] = { cpOutL.getValue(0), cpOutH.getValue(0)};
20524 SDValue EFLAGS = DAG.getCopyFromReg(cpOutH.getValue(1), dl, X86::EFLAGS,
20525 MVT::i32, cpOutH.getValue(2));
20527 DAG.getNode(X86ISD::SETCC, dl, MVT::i8,
20528 DAG.getConstant(X86::COND_E, dl, MVT::i8), EFLAGS);
20529 Success = DAG.getZExtOrTrunc(Success, dl, N->getValueType(1));
20531 Results.push_back(DAG.getNode(ISD::BUILD_PAIR, dl, T, OpsF));
20532 Results.push_back(Success);
20533 Results.push_back(EFLAGS.getValue(1));
20536 case ISD::ATOMIC_SWAP:
20537 case ISD::ATOMIC_LOAD_ADD:
20538 case ISD::ATOMIC_LOAD_SUB:
20539 case ISD::ATOMIC_LOAD_AND:
20540 case ISD::ATOMIC_LOAD_OR:
20541 case ISD::ATOMIC_LOAD_XOR:
20542 case ISD::ATOMIC_LOAD_NAND:
20543 case ISD::ATOMIC_LOAD_MIN:
20544 case ISD::ATOMIC_LOAD_MAX:
20545 case ISD::ATOMIC_LOAD_UMIN:
20546 case ISD::ATOMIC_LOAD_UMAX:
20547 case ISD::ATOMIC_LOAD: {
20548 // Delegate to generic TypeLegalization. Situations we can really handle
20549 // should have already been dealt with by AtomicExpandPass.cpp.
20552 case ISD::BITCAST: {
20553 assert(Subtarget->hasSSE2() && "Requires at least SSE2!");
20554 EVT DstVT = N->getValueType(0);
20555 EVT SrcVT = N->getOperand(0)->getValueType(0);
20557 if (SrcVT != MVT::f64 ||
20558 (DstVT != MVT::v2i32 && DstVT != MVT::v4i16 && DstVT != MVT::v8i8))
20561 unsigned NumElts = DstVT.getVectorNumElements();
20562 EVT SVT = DstVT.getVectorElementType();
20563 EVT WiderVT = EVT::getVectorVT(*DAG.getContext(), SVT, NumElts * 2);
20564 SDValue Expanded = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl,
20565 MVT::v2f64, N->getOperand(0));
20566 SDValue ToVecInt = DAG.getBitcast(WiderVT, Expanded);
20568 if (ExperimentalVectorWideningLegalization) {
20569 // If we are legalizing vectors by widening, we already have the desired
20570 // legal vector type, just return it.
20571 Results.push_back(ToVecInt);
20575 SmallVector<SDValue, 8> Elts;
20576 for (unsigned i = 0, e = NumElts; i != e; ++i)
20577 Elts.push_back(DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, SVT,
20578 ToVecInt, DAG.getIntPtrConstant(i, dl)));
20580 Results.push_back(DAG.getNode(ISD::BUILD_VECTOR, dl, DstVT, Elts));
20585 const char *X86TargetLowering::getTargetNodeName(unsigned Opcode) const {
20586 switch ((X86ISD::NodeType)Opcode) {
20587 case X86ISD::FIRST_NUMBER: break;
20588 case X86ISD::BSF: return "X86ISD::BSF";
20589 case X86ISD::BSR: return "X86ISD::BSR";
20590 case X86ISD::SHLD: return "X86ISD::SHLD";
20591 case X86ISD::SHRD: return "X86ISD::SHRD";
20592 case X86ISD::FAND: return "X86ISD::FAND";
20593 case X86ISD::FANDN: return "X86ISD::FANDN";
20594 case X86ISD::FOR: return "X86ISD::FOR";
20595 case X86ISD::FXOR: return "X86ISD::FXOR";
20596 case X86ISD::FILD: return "X86ISD::FILD";
20597 case X86ISD::FILD_FLAG: return "X86ISD::FILD_FLAG";
20598 case X86ISD::FP_TO_INT16_IN_MEM: return "X86ISD::FP_TO_INT16_IN_MEM";
20599 case X86ISD::FP_TO_INT32_IN_MEM: return "X86ISD::FP_TO_INT32_IN_MEM";
20600 case X86ISD::FP_TO_INT64_IN_MEM: return "X86ISD::FP_TO_INT64_IN_MEM";
20601 case X86ISD::FLD: return "X86ISD::FLD";
20602 case X86ISD::FST: return "X86ISD::FST";
20603 case X86ISD::CALL: return "X86ISD::CALL";
20604 case X86ISD::RDTSC_DAG: return "X86ISD::RDTSC_DAG";
20605 case X86ISD::RDTSCP_DAG: return "X86ISD::RDTSCP_DAG";
20606 case X86ISD::RDPMC_DAG: return "X86ISD::RDPMC_DAG";
20607 case X86ISD::BT: return "X86ISD::BT";
20608 case X86ISD::CMP: return "X86ISD::CMP";
20609 case X86ISD::COMI: return "X86ISD::COMI";
20610 case X86ISD::UCOMI: return "X86ISD::UCOMI";
20611 case X86ISD::CMPM: return "X86ISD::CMPM";
20612 case X86ISD::CMPMU: return "X86ISD::CMPMU";
20613 case X86ISD::CMPM_RND: return "X86ISD::CMPM_RND";
20614 case X86ISD::SETCC: return "X86ISD::SETCC";
20615 case X86ISD::SETCC_CARRY: return "X86ISD::SETCC_CARRY";
20616 case X86ISD::FSETCC: return "X86ISD::FSETCC";
20617 case X86ISD::FGETSIGNx86: return "X86ISD::FGETSIGNx86";
20618 case X86ISD::CMOV: return "X86ISD::CMOV";
20619 case X86ISD::BRCOND: return "X86ISD::BRCOND";
20620 case X86ISD::RET_FLAG: return "X86ISD::RET_FLAG";
20621 case X86ISD::IRET: return "X86ISD::IRET";
20622 case X86ISD::REP_STOS: return "X86ISD::REP_STOS";
20623 case X86ISD::REP_MOVS: return "X86ISD::REP_MOVS";
20624 case X86ISD::GlobalBaseReg: return "X86ISD::GlobalBaseReg";
20625 case X86ISD::Wrapper: return "X86ISD::Wrapper";
20626 case X86ISD::WrapperRIP: return "X86ISD::WrapperRIP";
20627 case X86ISD::MOVDQ2Q: return "X86ISD::MOVDQ2Q";
20628 case X86ISD::MMX_MOVD2W: return "X86ISD::MMX_MOVD2W";
20629 case X86ISD::MMX_MOVW2D: return "X86ISD::MMX_MOVW2D";
20630 case X86ISD::PEXTRB: return "X86ISD::PEXTRB";
20631 case X86ISD::PEXTRW: return "X86ISD::PEXTRW";
20632 case X86ISD::INSERTPS: return "X86ISD::INSERTPS";
20633 case X86ISD::PINSRB: return "X86ISD::PINSRB";
20634 case X86ISD::PINSRW: return "X86ISD::PINSRW";
20635 case X86ISD::MMX_PINSRW: return "X86ISD::MMX_PINSRW";
20636 case X86ISD::PSHUFB: return "X86ISD::PSHUFB";
20637 case X86ISD::ANDNP: return "X86ISD::ANDNP";
20638 case X86ISD::PSIGN: return "X86ISD::PSIGN";
20639 case X86ISD::BLENDI: return "X86ISD::BLENDI";
20640 case X86ISD::SHRUNKBLEND: return "X86ISD::SHRUNKBLEND";
20641 case X86ISD::ADDUS: return "X86ISD::ADDUS";
20642 case X86ISD::SUBUS: return "X86ISD::SUBUS";
20643 case X86ISD::HADD: return "X86ISD::HADD";
20644 case X86ISD::HSUB: return "X86ISD::HSUB";
20645 case X86ISD::FHADD: return "X86ISD::FHADD";
20646 case X86ISD::FHSUB: return "X86ISD::FHSUB";
20647 case X86ISD::ABS: return "X86ISD::ABS";
20648 case X86ISD::CONFLICT: return "X86ISD::CONFLICT";
20649 case X86ISD::FMAX: return "X86ISD::FMAX";
20650 case X86ISD::FMAX_RND: return "X86ISD::FMAX_RND";
20651 case X86ISD::FMIN: return "X86ISD::FMIN";
20652 case X86ISD::FMIN_RND: return "X86ISD::FMIN_RND";
20653 case X86ISD::FMAXC: return "X86ISD::FMAXC";
20654 case X86ISD::FMINC: return "X86ISD::FMINC";
20655 case X86ISD::FRSQRT: return "X86ISD::FRSQRT";
20656 case X86ISD::FRCP: return "X86ISD::FRCP";
20657 case X86ISD::EXTRQI: return "X86ISD::EXTRQI";
20658 case X86ISD::INSERTQI: return "X86ISD::INSERTQI";
20659 case X86ISD::TLSADDR: return "X86ISD::TLSADDR";
20660 case X86ISD::TLSBASEADDR: return "X86ISD::TLSBASEADDR";
20661 case X86ISD::TLSCALL: return "X86ISD::TLSCALL";
20662 case X86ISD::EH_SJLJ_SETJMP: return "X86ISD::EH_SJLJ_SETJMP";
20663 case X86ISD::EH_SJLJ_LONGJMP: return "X86ISD::EH_SJLJ_LONGJMP";
20664 case X86ISD::EH_RETURN: return "X86ISD::EH_RETURN";
20665 case X86ISD::TC_RETURN: return "X86ISD::TC_RETURN";
20666 case X86ISD::FNSTCW16m: return "X86ISD::FNSTCW16m";
20667 case X86ISD::FNSTSW16r: return "X86ISD::FNSTSW16r";
20668 case X86ISD::LCMPXCHG_DAG: return "X86ISD::LCMPXCHG_DAG";
20669 case X86ISD::LCMPXCHG8_DAG: return "X86ISD::LCMPXCHG8_DAG";
20670 case X86ISD::LCMPXCHG16_DAG: return "X86ISD::LCMPXCHG16_DAG";
20671 case X86ISD::VZEXT_MOVL: return "X86ISD::VZEXT_MOVL";
20672 case X86ISD::VZEXT_LOAD: return "X86ISD::VZEXT_LOAD";
20673 case X86ISD::VZEXT: return "X86ISD::VZEXT";
20674 case X86ISD::VSEXT: return "X86ISD::VSEXT";
20675 case X86ISD::VTRUNC: return "X86ISD::VTRUNC";
20676 case X86ISD::VTRUNCS: return "X86ISD::VTRUNCS";
20677 case X86ISD::VTRUNCUS: return "X86ISD::VTRUNCUS";
20678 case X86ISD::VINSERT: return "X86ISD::VINSERT";
20679 case X86ISD::VFPEXT: return "X86ISD::VFPEXT";
20680 case X86ISD::VFPROUND: return "X86ISD::VFPROUND";
20681 case X86ISD::CVTDQ2PD: return "X86ISD::CVTDQ2PD";
20682 case X86ISD::CVTUDQ2PD: return "X86ISD::CVTUDQ2PD";
20683 case X86ISD::CVT2MASK: return "X86ISD::CVT2MASK";
20684 case X86ISD::VSHLDQ: return "X86ISD::VSHLDQ";
20685 case X86ISD::VSRLDQ: return "X86ISD::VSRLDQ";
20686 case X86ISD::VSHL: return "X86ISD::VSHL";
20687 case X86ISD::VSRL: return "X86ISD::VSRL";
20688 case X86ISD::VSRA: return "X86ISD::VSRA";
20689 case X86ISD::VSHLI: return "X86ISD::VSHLI";
20690 case X86ISD::VSRLI: return "X86ISD::VSRLI";
20691 case X86ISD::VSRAI: return "X86ISD::VSRAI";
20692 case X86ISD::CMPP: return "X86ISD::CMPP";
20693 case X86ISD::PCMPEQ: return "X86ISD::PCMPEQ";
20694 case X86ISD::PCMPGT: return "X86ISD::PCMPGT";
20695 case X86ISD::PCMPEQM: return "X86ISD::PCMPEQM";
20696 case X86ISD::PCMPGTM: return "X86ISD::PCMPGTM";
20697 case X86ISD::ADD: return "X86ISD::ADD";
20698 case X86ISD::SUB: return "X86ISD::SUB";
20699 case X86ISD::ADC: return "X86ISD::ADC";
20700 case X86ISD::SBB: return "X86ISD::SBB";
20701 case X86ISD::SMUL: return "X86ISD::SMUL";
20702 case X86ISD::UMUL: return "X86ISD::UMUL";
20703 case X86ISD::SMUL8: return "X86ISD::SMUL8";
20704 case X86ISD::UMUL8: return "X86ISD::UMUL8";
20705 case X86ISD::SDIVREM8_SEXT_HREG: return "X86ISD::SDIVREM8_SEXT_HREG";
20706 case X86ISD::UDIVREM8_ZEXT_HREG: return "X86ISD::UDIVREM8_ZEXT_HREG";
20707 case X86ISD::INC: return "X86ISD::INC";
20708 case X86ISD::DEC: return "X86ISD::DEC";
20709 case X86ISD::OR: return "X86ISD::OR";
20710 case X86ISD::XOR: return "X86ISD::XOR";
20711 case X86ISD::AND: return "X86ISD::AND";
20712 case X86ISD::BEXTR: return "X86ISD::BEXTR";
20713 case X86ISD::MUL_IMM: return "X86ISD::MUL_IMM";
20714 case X86ISD::PTEST: return "X86ISD::PTEST";
20715 case X86ISD::TESTP: return "X86ISD::TESTP";
20716 case X86ISD::TESTM: return "X86ISD::TESTM";
20717 case X86ISD::TESTNM: return "X86ISD::TESTNM";
20718 case X86ISD::KORTEST: return "X86ISD::KORTEST";
20719 case X86ISD::KTEST: return "X86ISD::KTEST";
20720 case X86ISD::PACKSS: return "X86ISD::PACKSS";
20721 case X86ISD::PACKUS: return "X86ISD::PACKUS";
20722 case X86ISD::PALIGNR: return "X86ISD::PALIGNR";
20723 case X86ISD::VALIGN: return "X86ISD::VALIGN";
20724 case X86ISD::PSHUFD: return "X86ISD::PSHUFD";
20725 case X86ISD::PSHUFHW: return "X86ISD::PSHUFHW";
20726 case X86ISD::PSHUFLW: return "X86ISD::PSHUFLW";
20727 case X86ISD::SHUFP: return "X86ISD::SHUFP";
20728 case X86ISD::SHUF128: return "X86ISD::SHUF128";
20729 case X86ISD::MOVLHPS: return "X86ISD::MOVLHPS";
20730 case X86ISD::MOVLHPD: return "X86ISD::MOVLHPD";
20731 case X86ISD::MOVHLPS: return "X86ISD::MOVHLPS";
20732 case X86ISD::MOVLPS: return "X86ISD::MOVLPS";
20733 case X86ISD::MOVLPD: return "X86ISD::MOVLPD";
20734 case X86ISD::MOVDDUP: return "X86ISD::MOVDDUP";
20735 case X86ISD::MOVSHDUP: return "X86ISD::MOVSHDUP";
20736 case X86ISD::MOVSLDUP: return "X86ISD::MOVSLDUP";
20737 case X86ISD::MOVSD: return "X86ISD::MOVSD";
20738 case X86ISD::MOVSS: return "X86ISD::MOVSS";
20739 case X86ISD::UNPCKL: return "X86ISD::UNPCKL";
20740 case X86ISD::UNPCKH: return "X86ISD::UNPCKH";
20741 case X86ISD::VBROADCAST: return "X86ISD::VBROADCAST";
20742 case X86ISD::VBROADCASTM: return "X86ISD::VBROADCASTM";
20743 case X86ISD::SUBV_BROADCAST: return "X86ISD::SUBV_BROADCAST";
20744 case X86ISD::VEXTRACT: return "X86ISD::VEXTRACT";
20745 case X86ISD::VPERMILPV: return "X86ISD::VPERMILPV";
20746 case X86ISD::VPERMILPI: return "X86ISD::VPERMILPI";
20747 case X86ISD::VPERM2X128: return "X86ISD::VPERM2X128";
20748 case X86ISD::VPERMV: return "X86ISD::VPERMV";
20749 case X86ISD::VPERMV3: return "X86ISD::VPERMV3";
20750 case X86ISD::VPERMIV3: return "X86ISD::VPERMIV3";
20751 case X86ISD::VPERMI: return "X86ISD::VPERMI";
20752 case X86ISD::VPTERNLOG: return "X86ISD::VPTERNLOG";
20753 case X86ISD::VFIXUPIMM: return "X86ISD::VFIXUPIMM";
20754 case X86ISD::VRANGE: return "X86ISD::VRANGE";
20755 case X86ISD::PMULUDQ: return "X86ISD::PMULUDQ";
20756 case X86ISD::PMULDQ: return "X86ISD::PMULDQ";
20757 case X86ISD::PSADBW: return "X86ISD::PSADBW";
20758 case X86ISD::DBPSADBW: return "X86ISD::DBPSADBW";
20759 case X86ISD::VASTART_SAVE_XMM_REGS: return "X86ISD::VASTART_SAVE_XMM_REGS";
20760 case X86ISD::VAARG_64: return "X86ISD::VAARG_64";
20761 case X86ISD::WIN_ALLOCA: return "X86ISD::WIN_ALLOCA";
20762 case X86ISD::MEMBARRIER: return "X86ISD::MEMBARRIER";
20763 case X86ISD::MFENCE: return "X86ISD::MFENCE";
20764 case X86ISD::SFENCE: return "X86ISD::SFENCE";
20765 case X86ISD::LFENCE: return "X86ISD::LFENCE";
20766 case X86ISD::SEG_ALLOCA: return "X86ISD::SEG_ALLOCA";
20767 case X86ISD::SAHF: return "X86ISD::SAHF";
20768 case X86ISD::RDRAND: return "X86ISD::RDRAND";
20769 case X86ISD::RDSEED: return "X86ISD::RDSEED";
20770 case X86ISD::VPMADDUBSW: return "X86ISD::VPMADDUBSW";
20771 case X86ISD::VPMADDWD: return "X86ISD::VPMADDWD";
20772 case X86ISD::VPROT: return "X86ISD::VPROT";
20773 case X86ISD::VPROTI: return "X86ISD::VPROTI";
20774 case X86ISD::VPSHA: return "X86ISD::VPSHA";
20775 case X86ISD::VPSHL: return "X86ISD::VPSHL";
20776 case X86ISD::VPCOM: return "X86ISD::VPCOM";
20777 case X86ISD::VPCOMU: return "X86ISD::VPCOMU";
20778 case X86ISD::FMADD: return "X86ISD::FMADD";
20779 case X86ISD::FMSUB: return "X86ISD::FMSUB";
20780 case X86ISD::FNMADD: return "X86ISD::FNMADD";
20781 case X86ISD::FNMSUB: return "X86ISD::FNMSUB";
20782 case X86ISD::FMADDSUB: return "X86ISD::FMADDSUB";
20783 case X86ISD::FMSUBADD: return "X86ISD::FMSUBADD";
20784 case X86ISD::FMADD_RND: return "X86ISD::FMADD_RND";
20785 case X86ISD::FNMADD_RND: return "X86ISD::FNMADD_RND";
20786 case X86ISD::FMSUB_RND: return "X86ISD::FMSUB_RND";
20787 case X86ISD::FNMSUB_RND: return "X86ISD::FNMSUB_RND";
20788 case X86ISD::FMADDSUB_RND: return "X86ISD::FMADDSUB_RND";
20789 case X86ISD::FMSUBADD_RND: return "X86ISD::FMSUBADD_RND";
20790 case X86ISD::VRNDSCALE: return "X86ISD::VRNDSCALE";
20791 case X86ISD::VREDUCE: return "X86ISD::VREDUCE";
20792 case X86ISD::VGETMANT: return "X86ISD::VGETMANT";
20793 case X86ISD::PCMPESTRI: return "X86ISD::PCMPESTRI";
20794 case X86ISD::PCMPISTRI: return "X86ISD::PCMPISTRI";
20795 case X86ISD::XTEST: return "X86ISD::XTEST";
20796 case X86ISD::COMPRESS: return "X86ISD::COMPRESS";
20797 case X86ISD::EXPAND: return "X86ISD::EXPAND";
20798 case X86ISD::SELECT: return "X86ISD::SELECT";
20799 case X86ISD::ADDSUB: return "X86ISD::ADDSUB";
20800 case X86ISD::RCP28: return "X86ISD::RCP28";
20801 case X86ISD::EXP2: return "X86ISD::EXP2";
20802 case X86ISD::RSQRT28: return "X86ISD::RSQRT28";
20803 case X86ISD::FADD_RND: return "X86ISD::FADD_RND";
20804 case X86ISD::FSUB_RND: return "X86ISD::FSUB_RND";
20805 case X86ISD::FMUL_RND: return "X86ISD::FMUL_RND";
20806 case X86ISD::FDIV_RND: return "X86ISD::FDIV_RND";
20807 case X86ISD::FSQRT_RND: return "X86ISD::FSQRT_RND";
20808 case X86ISD::FGETEXP_RND: return "X86ISD::FGETEXP_RND";
20809 case X86ISD::SCALEF: return "X86ISD::SCALEF";
20810 case X86ISD::ADDS: return "X86ISD::ADDS";
20811 case X86ISD::SUBS: return "X86ISD::SUBS";
20812 case X86ISD::AVG: return "X86ISD::AVG";
20813 case X86ISD::MULHRS: return "X86ISD::MULHRS";
20814 case X86ISD::SINT_TO_FP_RND: return "X86ISD::SINT_TO_FP_RND";
20815 case X86ISD::UINT_TO_FP_RND: return "X86ISD::UINT_TO_FP_RND";
20816 case X86ISD::FP_TO_SINT_RND: return "X86ISD::FP_TO_SINT_RND";
20817 case X86ISD::FP_TO_UINT_RND: return "X86ISD::FP_TO_UINT_RND";
20818 case X86ISD::VFPCLASS: return "X86ISD::VFPCLASS";
20819 case X86ISD::VFPCLASSS: return "X86ISD::VFPCLASSS";
20824 // isLegalAddressingMode - Return true if the addressing mode represented
20825 // by AM is legal for this target, for a load/store of the specified type.
20826 bool X86TargetLowering::isLegalAddressingMode(const DataLayout &DL,
20827 const AddrMode &AM, Type *Ty,
20828 unsigned AS) const {
20829 // X86 supports extremely general addressing modes.
20830 CodeModel::Model M = getTargetMachine().getCodeModel();
20831 Reloc::Model R = getTargetMachine().getRelocationModel();
20833 // X86 allows a sign-extended 32-bit immediate field as a displacement.
20834 if (!X86::isOffsetSuitableForCodeModel(AM.BaseOffs, M, AM.BaseGV != nullptr))
20839 Subtarget->ClassifyGlobalReference(AM.BaseGV, getTargetMachine());
20841 // If a reference to this global requires an extra load, we can't fold it.
20842 if (isGlobalStubReference(GVFlags))
20845 // If BaseGV requires a register for the PIC base, we cannot also have a
20846 // BaseReg specified.
20847 if (AM.HasBaseReg && isGlobalRelativeToPICBase(GVFlags))
20850 // If lower 4G is not available, then we must use rip-relative addressing.
20851 if ((M != CodeModel::Small || R != Reloc::Static) &&
20852 Subtarget->is64Bit() && (AM.BaseOffs || AM.Scale > 1))
20856 switch (AM.Scale) {
20862 // These scales always work.
20867 // These scales are formed with basereg+scalereg. Only accept if there is
20872 default: // Other stuff never works.
20879 bool X86TargetLowering::isVectorShiftByScalarCheap(Type *Ty) const {
20880 unsigned Bits = Ty->getScalarSizeInBits();
20882 // 8-bit shifts are always expensive, but versions with a scalar amount aren't
20883 // particularly cheaper than those without.
20887 // On AVX2 there are new vpsllv[dq] instructions (and other shifts), that make
20888 // variable shifts just as cheap as scalar ones.
20889 if (Subtarget->hasInt256() && (Bits == 32 || Bits == 64))
20892 // Otherwise, it's significantly cheaper to shift by a scalar amount than by a
20893 // fully general vector.
20897 bool X86TargetLowering::isTruncateFree(Type *Ty1, Type *Ty2) const {
20898 if (!Ty1->isIntegerTy() || !Ty2->isIntegerTy())
20900 unsigned NumBits1 = Ty1->getPrimitiveSizeInBits();
20901 unsigned NumBits2 = Ty2->getPrimitiveSizeInBits();
20902 return NumBits1 > NumBits2;
20905 bool X86TargetLowering::allowTruncateForTailCall(Type *Ty1, Type *Ty2) const {
20906 if (!Ty1->isIntegerTy() || !Ty2->isIntegerTy())
20909 if (!isTypeLegal(EVT::getEVT(Ty1)))
20912 assert(Ty1->getPrimitiveSizeInBits() <= 64 && "i128 is probably not a noop");
20914 // Assuming the caller doesn't have a zeroext or signext return parameter,
20915 // truncation all the way down to i1 is valid.
20919 bool X86TargetLowering::isLegalICmpImmediate(int64_t Imm) const {
20920 return isInt<32>(Imm);
20923 bool X86TargetLowering::isLegalAddImmediate(int64_t Imm) const {
20924 // Can also use sub to handle negated immediates.
20925 return isInt<32>(Imm);
20928 bool X86TargetLowering::isTruncateFree(EVT VT1, EVT VT2) const {
20929 if (!VT1.isInteger() || !VT2.isInteger())
20931 unsigned NumBits1 = VT1.getSizeInBits();
20932 unsigned NumBits2 = VT2.getSizeInBits();
20933 return NumBits1 > NumBits2;
20936 bool X86TargetLowering::isZExtFree(Type *Ty1, Type *Ty2) const {
20937 // x86-64 implicitly zero-extends 32-bit results in 64-bit registers.
20938 return Ty1->isIntegerTy(32) && Ty2->isIntegerTy(64) && Subtarget->is64Bit();
20941 bool X86TargetLowering::isZExtFree(EVT VT1, EVT VT2) const {
20942 // x86-64 implicitly zero-extends 32-bit results in 64-bit registers.
20943 return VT1 == MVT::i32 && VT2 == MVT::i64 && Subtarget->is64Bit();
20946 bool X86TargetLowering::isZExtFree(SDValue Val, EVT VT2) const {
20947 EVT VT1 = Val.getValueType();
20948 if (isZExtFree(VT1, VT2))
20951 if (Val.getOpcode() != ISD::LOAD)
20954 if (!VT1.isSimple() || !VT1.isInteger() ||
20955 !VT2.isSimple() || !VT2.isInteger())
20958 switch (VT1.getSimpleVT().SimpleTy) {
20963 // X86 has 8, 16, and 32-bit zero-extending loads.
20970 bool X86TargetLowering::isVectorLoadExtDesirable(SDValue) const { return true; }
20973 X86TargetLowering::isFMAFasterThanFMulAndFAdd(EVT VT) const {
20974 if (!Subtarget->hasAnyFMA())
20977 VT = VT.getScalarType();
20979 if (!VT.isSimple())
20982 switch (VT.getSimpleVT().SimpleTy) {
20993 bool X86TargetLowering::isNarrowingProfitable(EVT VT1, EVT VT2) const {
20994 // i16 instructions are longer (0x66 prefix) and potentially slower.
20995 return !(VT1 == MVT::i32 && VT2 == MVT::i16);
20998 /// isShuffleMaskLegal - Targets can use this to indicate that they only
20999 /// support *some* VECTOR_SHUFFLE operations, those with specific masks.
21000 /// By default, if a target supports the VECTOR_SHUFFLE node, all mask values
21001 /// are assumed to be legal.
21003 X86TargetLowering::isShuffleMaskLegal(const SmallVectorImpl<int> &M,
21005 if (!VT.isSimple())
21008 // Not for i1 vectors
21009 if (VT.getSimpleVT().getScalarType() == MVT::i1)
21012 // Very little shuffling can be done for 64-bit vectors right now.
21013 if (VT.getSimpleVT().getSizeInBits() == 64)
21016 // We only care that the types being shuffled are legal. The lowering can
21017 // handle any possible shuffle mask that results.
21018 return isTypeLegal(VT.getSimpleVT());
21022 X86TargetLowering::isVectorClearMaskLegal(const SmallVectorImpl<int> &Mask,
21024 // Just delegate to the generic legality, clear masks aren't special.
21025 return isShuffleMaskLegal(Mask, VT);
21028 //===----------------------------------------------------------------------===//
21029 // X86 Scheduler Hooks
21030 //===----------------------------------------------------------------------===//
21032 /// Utility function to emit xbegin specifying the start of an RTM region.
21033 static MachineBasicBlock *EmitXBegin(MachineInstr *MI, MachineBasicBlock *MBB,
21034 const TargetInstrInfo *TII) {
21035 DebugLoc DL = MI->getDebugLoc();
21037 const BasicBlock *BB = MBB->getBasicBlock();
21038 MachineFunction::iterator I = ++MBB->getIterator();
21040 // For the v = xbegin(), we generate
21051 MachineBasicBlock *thisMBB = MBB;
21052 MachineFunction *MF = MBB->getParent();
21053 MachineBasicBlock *mainMBB = MF->CreateMachineBasicBlock(BB);
21054 MachineBasicBlock *sinkMBB = MF->CreateMachineBasicBlock(BB);
21055 MF->insert(I, mainMBB);
21056 MF->insert(I, sinkMBB);
21058 // Transfer the remainder of BB and its successor edges to sinkMBB.
21059 sinkMBB->splice(sinkMBB->begin(), MBB,
21060 std::next(MachineBasicBlock::iterator(MI)), MBB->end());
21061 sinkMBB->transferSuccessorsAndUpdatePHIs(MBB);
21065 // # fallthrough to mainMBB
21066 // # abortion to sinkMBB
21067 BuildMI(thisMBB, DL, TII->get(X86::XBEGIN_4)).addMBB(sinkMBB);
21068 thisMBB->addSuccessor(mainMBB);
21069 thisMBB->addSuccessor(sinkMBB);
21073 BuildMI(mainMBB, DL, TII->get(X86::MOV32ri), X86::EAX).addImm(-1);
21074 mainMBB->addSuccessor(sinkMBB);
21077 // EAX is live into the sinkMBB
21078 sinkMBB->addLiveIn(X86::EAX);
21079 BuildMI(*sinkMBB, sinkMBB->begin(), DL,
21080 TII->get(TargetOpcode::COPY), MI->getOperand(0).getReg())
21083 MI->eraseFromParent();
21087 // FIXME: When we get size specific XMM0 registers, i.e. XMM0_V16I8
21088 // or XMM0_V32I8 in AVX all of this code can be replaced with that
21089 // in the .td file.
21090 static MachineBasicBlock *EmitPCMPSTRM(MachineInstr *MI, MachineBasicBlock *BB,
21091 const TargetInstrInfo *TII) {
21093 switch (MI->getOpcode()) {
21094 default: llvm_unreachable("illegal opcode!");
21095 case X86::PCMPISTRM128REG: Opc = X86::PCMPISTRM128rr; break;
21096 case X86::VPCMPISTRM128REG: Opc = X86::VPCMPISTRM128rr; break;
21097 case X86::PCMPISTRM128MEM: Opc = X86::PCMPISTRM128rm; break;
21098 case X86::VPCMPISTRM128MEM: Opc = X86::VPCMPISTRM128rm; break;
21099 case X86::PCMPESTRM128REG: Opc = X86::PCMPESTRM128rr; break;
21100 case X86::VPCMPESTRM128REG: Opc = X86::VPCMPESTRM128rr; break;
21101 case X86::PCMPESTRM128MEM: Opc = X86::PCMPESTRM128rm; break;
21102 case X86::VPCMPESTRM128MEM: Opc = X86::VPCMPESTRM128rm; break;
21105 DebugLoc dl = MI->getDebugLoc();
21106 MachineInstrBuilder MIB = BuildMI(*BB, MI, dl, TII->get(Opc));
21108 unsigned NumArgs = MI->getNumOperands();
21109 for (unsigned i = 1; i < NumArgs; ++i) {
21110 MachineOperand &Op = MI->getOperand(i);
21111 if (!(Op.isReg() && Op.isImplicit()))
21112 MIB.addOperand(Op);
21114 if (MI->hasOneMemOperand())
21115 MIB->setMemRefs(MI->memoperands_begin(), MI->memoperands_end());
21117 BuildMI(*BB, MI, dl,
21118 TII->get(TargetOpcode::COPY), MI->getOperand(0).getReg())
21119 .addReg(X86::XMM0);
21121 MI->eraseFromParent();
21125 // FIXME: Custom handling because TableGen doesn't support multiple implicit
21126 // defs in an instruction pattern
21127 static MachineBasicBlock *EmitPCMPSTRI(MachineInstr *MI, MachineBasicBlock *BB,
21128 const TargetInstrInfo *TII) {
21130 switch (MI->getOpcode()) {
21131 default: llvm_unreachable("illegal opcode!");
21132 case X86::PCMPISTRIREG: Opc = X86::PCMPISTRIrr; break;
21133 case X86::VPCMPISTRIREG: Opc = X86::VPCMPISTRIrr; break;
21134 case X86::PCMPISTRIMEM: Opc = X86::PCMPISTRIrm; break;
21135 case X86::VPCMPISTRIMEM: Opc = X86::VPCMPISTRIrm; break;
21136 case X86::PCMPESTRIREG: Opc = X86::PCMPESTRIrr; break;
21137 case X86::VPCMPESTRIREG: Opc = X86::VPCMPESTRIrr; break;
21138 case X86::PCMPESTRIMEM: Opc = X86::PCMPESTRIrm; break;
21139 case X86::VPCMPESTRIMEM: Opc = X86::VPCMPESTRIrm; break;
21142 DebugLoc dl = MI->getDebugLoc();
21143 MachineInstrBuilder MIB = BuildMI(*BB, MI, dl, TII->get(Opc));
21145 unsigned NumArgs = MI->getNumOperands(); // remove the results
21146 for (unsigned i = 1; i < NumArgs; ++i) {
21147 MachineOperand &Op = MI->getOperand(i);
21148 if (!(Op.isReg() && Op.isImplicit()))
21149 MIB.addOperand(Op);
21151 if (MI->hasOneMemOperand())
21152 MIB->setMemRefs(MI->memoperands_begin(), MI->memoperands_end());
21154 BuildMI(*BB, MI, dl,
21155 TII->get(TargetOpcode::COPY), MI->getOperand(0).getReg())
21158 MI->eraseFromParent();
21162 static MachineBasicBlock *EmitWRPKRU(MachineInstr *MI, MachineBasicBlock *BB,
21163 const X86Subtarget *Subtarget) {
21164 DebugLoc dl = MI->getDebugLoc();
21165 const TargetInstrInfo *TII = Subtarget->getInstrInfo();
21167 // insert input VAL into EAX
21168 BuildMI(*BB, MI, dl, TII->get(TargetOpcode::COPY), X86::EAX)
21169 .addReg(MI->getOperand(0).getReg());
21170 // insert zero to ECX
21171 BuildMI(*BB, MI, dl, TII->get(X86::XOR32rr), X86::ECX)
21174 // insert zero to EDX
21175 BuildMI(*BB, MI, dl, TII->get(X86::XOR32rr), X86::EDX)
21178 // insert WRPKRU instruction
21179 BuildMI(*BB, MI, dl, TII->get(X86::WRPKRUr));
21181 MI->eraseFromParent(); // The pseudo is gone now.
21185 static MachineBasicBlock *EmitRDPKRU(MachineInstr *MI, MachineBasicBlock *BB,
21186 const X86Subtarget *Subtarget) {
21187 DebugLoc dl = MI->getDebugLoc();
21188 const TargetInstrInfo *TII = Subtarget->getInstrInfo();
21190 // insert zero to ECX
21191 BuildMI(*BB, MI, dl, TII->get(X86::XOR32rr), X86::ECX)
21194 // insert RDPKRU instruction
21195 BuildMI(*BB, MI, dl, TII->get(X86::RDPKRUr));
21196 BuildMI(*BB, MI, dl, TII->get(TargetOpcode::COPY), MI->getOperand(0).getReg())
21199 MI->eraseFromParent(); // The pseudo is gone now.
21203 static MachineBasicBlock *EmitMonitor(MachineInstr *MI, MachineBasicBlock *BB,
21204 const X86Subtarget *Subtarget) {
21205 DebugLoc dl = MI->getDebugLoc();
21206 const TargetInstrInfo *TII = Subtarget->getInstrInfo();
21207 // Address into RAX/EAX, other two args into ECX, EDX.
21208 unsigned MemOpc = Subtarget->is64Bit() ? X86::LEA64r : X86::LEA32r;
21209 unsigned MemReg = Subtarget->is64Bit() ? X86::RAX : X86::EAX;
21210 MachineInstrBuilder MIB = BuildMI(*BB, MI, dl, TII->get(MemOpc), MemReg);
21211 for (int i = 0; i < X86::AddrNumOperands; ++i)
21212 MIB.addOperand(MI->getOperand(i));
21214 unsigned ValOps = X86::AddrNumOperands;
21215 BuildMI(*BB, MI, dl, TII->get(TargetOpcode::COPY), X86::ECX)
21216 .addReg(MI->getOperand(ValOps).getReg());
21217 BuildMI(*BB, MI, dl, TII->get(TargetOpcode::COPY), X86::EDX)
21218 .addReg(MI->getOperand(ValOps+1).getReg());
21220 // The instruction doesn't actually take any operands though.
21221 BuildMI(*BB, MI, dl, TII->get(X86::MONITORrrr));
21223 MI->eraseFromParent(); // The pseudo is gone now.
21227 MachineBasicBlock *
21228 X86TargetLowering::EmitVAARG64WithCustomInserter(MachineInstr *MI,
21229 MachineBasicBlock *MBB) const {
21230 // Emit va_arg instruction on X86-64.
21232 // Operands to this pseudo-instruction:
21233 // 0 ) Output : destination address (reg)
21234 // 1-5) Input : va_list address (addr, i64mem)
21235 // 6 ) ArgSize : Size (in bytes) of vararg type
21236 // 7 ) ArgMode : 0=overflow only, 1=use gp_offset, 2=use fp_offset
21237 // 8 ) Align : Alignment of type
21238 // 9 ) EFLAGS (implicit-def)
21240 assert(MI->getNumOperands() == 10 && "VAARG_64 should have 10 operands!");
21241 static_assert(X86::AddrNumOperands == 5,
21242 "VAARG_64 assumes 5 address operands");
21244 unsigned DestReg = MI->getOperand(0).getReg();
21245 MachineOperand &Base = MI->getOperand(1);
21246 MachineOperand &Scale = MI->getOperand(2);
21247 MachineOperand &Index = MI->getOperand(3);
21248 MachineOperand &Disp = MI->getOperand(4);
21249 MachineOperand &Segment = MI->getOperand(5);
21250 unsigned ArgSize = MI->getOperand(6).getImm();
21251 unsigned ArgMode = MI->getOperand(7).getImm();
21252 unsigned Align = MI->getOperand(8).getImm();
21254 // Memory Reference
21255 assert(MI->hasOneMemOperand() && "Expected VAARG_64 to have one memoperand");
21256 MachineInstr::mmo_iterator MMOBegin = MI->memoperands_begin();
21257 MachineInstr::mmo_iterator MMOEnd = MI->memoperands_end();
21259 // Machine Information
21260 const TargetInstrInfo *TII = Subtarget->getInstrInfo();
21261 MachineRegisterInfo &MRI = MBB->getParent()->getRegInfo();
21262 const TargetRegisterClass *AddrRegClass = getRegClassFor(MVT::i64);
21263 const TargetRegisterClass *OffsetRegClass = getRegClassFor(MVT::i32);
21264 DebugLoc DL = MI->getDebugLoc();
21266 // struct va_list {
21269 // i64 overflow_area (address)
21270 // i64 reg_save_area (address)
21272 // sizeof(va_list) = 24
21273 // alignment(va_list) = 8
21275 unsigned TotalNumIntRegs = 6;
21276 unsigned TotalNumXMMRegs = 8;
21277 bool UseGPOffset = (ArgMode == 1);
21278 bool UseFPOffset = (ArgMode == 2);
21279 unsigned MaxOffset = TotalNumIntRegs * 8 +
21280 (UseFPOffset ? TotalNumXMMRegs * 16 : 0);
21282 /* Align ArgSize to a multiple of 8 */
21283 unsigned ArgSizeA8 = (ArgSize + 7) & ~7;
21284 bool NeedsAlign = (Align > 8);
21286 MachineBasicBlock *thisMBB = MBB;
21287 MachineBasicBlock *overflowMBB;
21288 MachineBasicBlock *offsetMBB;
21289 MachineBasicBlock *endMBB;
21291 unsigned OffsetDestReg = 0; // Argument address computed by offsetMBB
21292 unsigned OverflowDestReg = 0; // Argument address computed by overflowMBB
21293 unsigned OffsetReg = 0;
21295 if (!UseGPOffset && !UseFPOffset) {
21296 // If we only pull from the overflow region, we don't create a branch.
21297 // We don't need to alter control flow.
21298 OffsetDestReg = 0; // unused
21299 OverflowDestReg = DestReg;
21301 offsetMBB = nullptr;
21302 overflowMBB = thisMBB;
21305 // First emit code to check if gp_offset (or fp_offset) is below the bound.
21306 // If so, pull the argument from reg_save_area. (branch to offsetMBB)
21307 // If not, pull from overflow_area. (branch to overflowMBB)
21312 // offsetMBB overflowMBB
21317 // Registers for the PHI in endMBB
21318 OffsetDestReg = MRI.createVirtualRegister(AddrRegClass);
21319 OverflowDestReg = MRI.createVirtualRegister(AddrRegClass);
21321 const BasicBlock *LLVM_BB = MBB->getBasicBlock();
21322 MachineFunction *MF = MBB->getParent();
21323 overflowMBB = MF->CreateMachineBasicBlock(LLVM_BB);
21324 offsetMBB = MF->CreateMachineBasicBlock(LLVM_BB);
21325 endMBB = MF->CreateMachineBasicBlock(LLVM_BB);
21327 MachineFunction::iterator MBBIter = ++MBB->getIterator();
21329 // Insert the new basic blocks
21330 MF->insert(MBBIter, offsetMBB);
21331 MF->insert(MBBIter, overflowMBB);
21332 MF->insert(MBBIter, endMBB);
21334 // Transfer the remainder of MBB and its successor edges to endMBB.
21335 endMBB->splice(endMBB->begin(), thisMBB,
21336 std::next(MachineBasicBlock::iterator(MI)), thisMBB->end());
21337 endMBB->transferSuccessorsAndUpdatePHIs(thisMBB);
21339 // Make offsetMBB and overflowMBB successors of thisMBB
21340 thisMBB->addSuccessor(offsetMBB);
21341 thisMBB->addSuccessor(overflowMBB);
21343 // endMBB is a successor of both offsetMBB and overflowMBB
21344 offsetMBB->addSuccessor(endMBB);
21345 overflowMBB->addSuccessor(endMBB);
21347 // Load the offset value into a register
21348 OffsetReg = MRI.createVirtualRegister(OffsetRegClass);
21349 BuildMI(thisMBB, DL, TII->get(X86::MOV32rm), OffsetReg)
21353 .addDisp(Disp, UseFPOffset ? 4 : 0)
21354 .addOperand(Segment)
21355 .setMemRefs(MMOBegin, MMOEnd);
21357 // Check if there is enough room left to pull this argument.
21358 BuildMI(thisMBB, DL, TII->get(X86::CMP32ri))
21360 .addImm(MaxOffset + 8 - ArgSizeA8);
21362 // Branch to "overflowMBB" if offset >= max
21363 // Fall through to "offsetMBB" otherwise
21364 BuildMI(thisMBB, DL, TII->get(X86::GetCondBranchFromCond(X86::COND_AE)))
21365 .addMBB(overflowMBB);
21368 // In offsetMBB, emit code to use the reg_save_area.
21370 assert(OffsetReg != 0);
21372 // Read the reg_save_area address.
21373 unsigned RegSaveReg = MRI.createVirtualRegister(AddrRegClass);
21374 BuildMI(offsetMBB, DL, TII->get(X86::MOV64rm), RegSaveReg)
21379 .addOperand(Segment)
21380 .setMemRefs(MMOBegin, MMOEnd);
21382 // Zero-extend the offset
21383 unsigned OffsetReg64 = MRI.createVirtualRegister(AddrRegClass);
21384 BuildMI(offsetMBB, DL, TII->get(X86::SUBREG_TO_REG), OffsetReg64)
21387 .addImm(X86::sub_32bit);
21389 // Add the offset to the reg_save_area to get the final address.
21390 BuildMI(offsetMBB, DL, TII->get(X86::ADD64rr), OffsetDestReg)
21391 .addReg(OffsetReg64)
21392 .addReg(RegSaveReg);
21394 // Compute the offset for the next argument
21395 unsigned NextOffsetReg = MRI.createVirtualRegister(OffsetRegClass);
21396 BuildMI(offsetMBB, DL, TII->get(X86::ADD32ri), NextOffsetReg)
21398 .addImm(UseFPOffset ? 16 : 8);
21400 // Store it back into the va_list.
21401 BuildMI(offsetMBB, DL, TII->get(X86::MOV32mr))
21405 .addDisp(Disp, UseFPOffset ? 4 : 0)
21406 .addOperand(Segment)
21407 .addReg(NextOffsetReg)
21408 .setMemRefs(MMOBegin, MMOEnd);
21411 BuildMI(offsetMBB, DL, TII->get(X86::JMP_1))
21416 // Emit code to use overflow area
21419 // Load the overflow_area address into a register.
21420 unsigned OverflowAddrReg = MRI.createVirtualRegister(AddrRegClass);
21421 BuildMI(overflowMBB, DL, TII->get(X86::MOV64rm), OverflowAddrReg)
21426 .addOperand(Segment)
21427 .setMemRefs(MMOBegin, MMOEnd);
21429 // If we need to align it, do so. Otherwise, just copy the address
21430 // to OverflowDestReg.
21432 // Align the overflow address
21433 assert((Align & (Align-1)) == 0 && "Alignment must be a power of 2");
21434 unsigned TmpReg = MRI.createVirtualRegister(AddrRegClass);
21436 // aligned_addr = (addr + (align-1)) & ~(align-1)
21437 BuildMI(overflowMBB, DL, TII->get(X86::ADD64ri32), TmpReg)
21438 .addReg(OverflowAddrReg)
21441 BuildMI(overflowMBB, DL, TII->get(X86::AND64ri32), OverflowDestReg)
21443 .addImm(~(uint64_t)(Align-1));
21445 BuildMI(overflowMBB, DL, TII->get(TargetOpcode::COPY), OverflowDestReg)
21446 .addReg(OverflowAddrReg);
21449 // Compute the next overflow address after this argument.
21450 // (the overflow address should be kept 8-byte aligned)
21451 unsigned NextAddrReg = MRI.createVirtualRegister(AddrRegClass);
21452 BuildMI(overflowMBB, DL, TII->get(X86::ADD64ri32), NextAddrReg)
21453 .addReg(OverflowDestReg)
21454 .addImm(ArgSizeA8);
21456 // Store the new overflow address.
21457 BuildMI(overflowMBB, DL, TII->get(X86::MOV64mr))
21462 .addOperand(Segment)
21463 .addReg(NextAddrReg)
21464 .setMemRefs(MMOBegin, MMOEnd);
21466 // If we branched, emit the PHI to the front of endMBB.
21468 BuildMI(*endMBB, endMBB->begin(), DL,
21469 TII->get(X86::PHI), DestReg)
21470 .addReg(OffsetDestReg).addMBB(offsetMBB)
21471 .addReg(OverflowDestReg).addMBB(overflowMBB);
21474 // Erase the pseudo instruction
21475 MI->eraseFromParent();
21480 MachineBasicBlock *
21481 X86TargetLowering::EmitVAStartSaveXMMRegsWithCustomInserter(
21483 MachineBasicBlock *MBB) const {
21484 // Emit code to save XMM registers to the stack. The ABI says that the
21485 // number of registers to save is given in %al, so it's theoretically
21486 // possible to do an indirect jump trick to avoid saving all of them,
21487 // however this code takes a simpler approach and just executes all
21488 // of the stores if %al is non-zero. It's less code, and it's probably
21489 // easier on the hardware branch predictor, and stores aren't all that
21490 // expensive anyway.
21492 // Create the new basic blocks. One block contains all the XMM stores,
21493 // and one block is the final destination regardless of whether any
21494 // stores were performed.
21495 const BasicBlock *LLVM_BB = MBB->getBasicBlock();
21496 MachineFunction *F = MBB->getParent();
21497 MachineFunction::iterator MBBIter = ++MBB->getIterator();
21498 MachineBasicBlock *XMMSaveMBB = F->CreateMachineBasicBlock(LLVM_BB);
21499 MachineBasicBlock *EndMBB = F->CreateMachineBasicBlock(LLVM_BB);
21500 F->insert(MBBIter, XMMSaveMBB);
21501 F->insert(MBBIter, EndMBB);
21503 // Transfer the remainder of MBB and its successor edges to EndMBB.
21504 EndMBB->splice(EndMBB->begin(), MBB,
21505 std::next(MachineBasicBlock::iterator(MI)), MBB->end());
21506 EndMBB->transferSuccessorsAndUpdatePHIs(MBB);
21508 // The original block will now fall through to the XMM save block.
21509 MBB->addSuccessor(XMMSaveMBB);
21510 // The XMMSaveMBB will fall through to the end block.
21511 XMMSaveMBB->addSuccessor(EndMBB);
21513 // Now add the instructions.
21514 const TargetInstrInfo *TII = Subtarget->getInstrInfo();
21515 DebugLoc DL = MI->getDebugLoc();
21517 unsigned CountReg = MI->getOperand(0).getReg();
21518 int64_t RegSaveFrameIndex = MI->getOperand(1).getImm();
21519 int64_t VarArgsFPOffset = MI->getOperand(2).getImm();
21521 if (!Subtarget->isCallingConvWin64(F->getFunction()->getCallingConv())) {
21522 // If %al is 0, branch around the XMM save block.
21523 BuildMI(MBB, DL, TII->get(X86::TEST8rr)).addReg(CountReg).addReg(CountReg);
21524 BuildMI(MBB, DL, TII->get(X86::JE_1)).addMBB(EndMBB);
21525 MBB->addSuccessor(EndMBB);
21528 // Make sure the last operand is EFLAGS, which gets clobbered by the branch
21529 // that was just emitted, but clearly shouldn't be "saved".
21530 assert((MI->getNumOperands() <= 3 ||
21531 !MI->getOperand(MI->getNumOperands() - 1).isReg() ||
21532 MI->getOperand(MI->getNumOperands() - 1).getReg() == X86::EFLAGS)
21533 && "Expected last argument to be EFLAGS");
21534 unsigned MOVOpc = Subtarget->hasFp256() ? X86::VMOVAPSmr : X86::MOVAPSmr;
21535 // In the XMM save block, save all the XMM argument registers.
21536 for (int i = 3, e = MI->getNumOperands() - 1; i != e; ++i) {
21537 int64_t Offset = (i - 3) * 16 + VarArgsFPOffset;
21538 MachineMemOperand *MMO = F->getMachineMemOperand(
21539 MachinePointerInfo::getFixedStack(*F, RegSaveFrameIndex, Offset),
21540 MachineMemOperand::MOStore,
21541 /*Size=*/16, /*Align=*/16);
21542 BuildMI(XMMSaveMBB, DL, TII->get(MOVOpc))
21543 .addFrameIndex(RegSaveFrameIndex)
21544 .addImm(/*Scale=*/1)
21545 .addReg(/*IndexReg=*/0)
21546 .addImm(/*Disp=*/Offset)
21547 .addReg(/*Segment=*/0)
21548 .addReg(MI->getOperand(i).getReg())
21549 .addMemOperand(MMO);
21552 MI->eraseFromParent(); // The pseudo instruction is gone now.
21557 // The EFLAGS operand of SelectItr might be missing a kill marker
21558 // because there were multiple uses of EFLAGS, and ISel didn't know
21559 // which to mark. Figure out whether SelectItr should have had a
21560 // kill marker, and set it if it should. Returns the correct kill
21562 static bool checkAndUpdateEFLAGSKill(MachineBasicBlock::iterator SelectItr,
21563 MachineBasicBlock* BB,
21564 const TargetRegisterInfo* TRI) {
21565 // Scan forward through BB for a use/def of EFLAGS.
21566 MachineBasicBlock::iterator miI(std::next(SelectItr));
21567 for (MachineBasicBlock::iterator miE = BB->end(); miI != miE; ++miI) {
21568 const MachineInstr& mi = *miI;
21569 if (mi.readsRegister(X86::EFLAGS))
21571 if (mi.definesRegister(X86::EFLAGS))
21572 break; // Should have kill-flag - update below.
21575 // If we hit the end of the block, check whether EFLAGS is live into a
21577 if (miI == BB->end()) {
21578 for (MachineBasicBlock::succ_iterator sItr = BB->succ_begin(),
21579 sEnd = BB->succ_end();
21580 sItr != sEnd; ++sItr) {
21581 MachineBasicBlock* succ = *sItr;
21582 if (succ->isLiveIn(X86::EFLAGS))
21587 // We found a def, or hit the end of the basic block and EFLAGS wasn't live
21588 // out. SelectMI should have a kill flag on EFLAGS.
21589 SelectItr->addRegisterKilled(X86::EFLAGS, TRI);
21593 // Return true if it is OK for this CMOV pseudo-opcode to be cascaded
21594 // together with other CMOV pseudo-opcodes into a single basic-block with
21595 // conditional jump around it.
21596 static bool isCMOVPseudo(MachineInstr *MI) {
21597 switch (MI->getOpcode()) {
21598 case X86::CMOV_FR32:
21599 case X86::CMOV_FR64:
21600 case X86::CMOV_GR8:
21601 case X86::CMOV_GR16:
21602 case X86::CMOV_GR32:
21603 case X86::CMOV_RFP32:
21604 case X86::CMOV_RFP64:
21605 case X86::CMOV_RFP80:
21606 case X86::CMOV_V2F64:
21607 case X86::CMOV_V2I64:
21608 case X86::CMOV_V4F32:
21609 case X86::CMOV_V4F64:
21610 case X86::CMOV_V4I64:
21611 case X86::CMOV_V16F32:
21612 case X86::CMOV_V8F32:
21613 case X86::CMOV_V8F64:
21614 case X86::CMOV_V8I64:
21615 case X86::CMOV_V8I1:
21616 case X86::CMOV_V16I1:
21617 case X86::CMOV_V32I1:
21618 case X86::CMOV_V64I1:
21626 MachineBasicBlock *
21627 X86TargetLowering::EmitLoweredSelect(MachineInstr *MI,
21628 MachineBasicBlock *BB) const {
21629 const TargetInstrInfo *TII = Subtarget->getInstrInfo();
21630 DebugLoc DL = MI->getDebugLoc();
21632 // To "insert" a SELECT_CC instruction, we actually have to insert the
21633 // diamond control-flow pattern. The incoming instruction knows the
21634 // destination vreg to set, the condition code register to branch on, the
21635 // true/false values to select between, and a branch opcode to use.
21636 const BasicBlock *LLVM_BB = BB->getBasicBlock();
21637 MachineFunction::iterator It = ++BB->getIterator();
21642 // cmpTY ccX, r1, r2
21644 // fallthrough --> copy0MBB
21645 MachineBasicBlock *thisMBB = BB;
21646 MachineFunction *F = BB->getParent();
21648 // This code lowers all pseudo-CMOV instructions. Generally it lowers these
21649 // as described above, by inserting a BB, and then making a PHI at the join
21650 // point to select the true and false operands of the CMOV in the PHI.
21652 // The code also handles two different cases of multiple CMOV opcodes
21656 // In this case, there are multiple CMOVs in a row, all which are based on
21657 // the same condition setting (or the exact opposite condition setting).
21658 // In this case we can lower all the CMOVs using a single inserted BB, and
21659 // then make a number of PHIs at the join point to model the CMOVs. The only
21660 // trickiness here, is that in a case like:
21662 // t2 = CMOV cond1 t1, f1
21663 // t3 = CMOV cond1 t2, f2
21665 // when rewriting this into PHIs, we have to perform some renaming on the
21666 // temps since you cannot have a PHI operand refer to a PHI result earlier
21667 // in the same block. The "simple" but wrong lowering would be:
21669 // t2 = PHI t1(BB1), f1(BB2)
21670 // t3 = PHI t2(BB1), f2(BB2)
21672 // but clearly t2 is not defined in BB1, so that is incorrect. The proper
21673 // renaming is to note that on the path through BB1, t2 is really just a
21674 // copy of t1, and do that renaming, properly generating:
21676 // t2 = PHI t1(BB1), f1(BB2)
21677 // t3 = PHI t1(BB1), f2(BB2)
21679 // Case 2, we lower cascaded CMOVs such as
21681 // (CMOV (CMOV F, T, cc1), T, cc2)
21683 // to two successives branches. For that, we look for another CMOV as the
21684 // following instruction.
21686 // Without this, we would add a PHI between the two jumps, which ends up
21687 // creating a few copies all around. For instance, for
21689 // (sitofp (zext (fcmp une)))
21691 // we would generate:
21693 // ucomiss %xmm1, %xmm0
21694 // movss <1.0f>, %xmm0
21695 // movaps %xmm0, %xmm1
21697 // xorps %xmm1, %xmm1
21700 // movaps %xmm1, %xmm0
21704 // because this custom-inserter would have generated:
21716 // A: X = ...; Y = ...
21718 // C: Z = PHI [X, A], [Y, B]
21720 // E: PHI [X, C], [Z, D]
21722 // If we lower both CMOVs in a single step, we can instead generate:
21734 // A: X = ...; Y = ...
21736 // E: PHI [X, A], [X, C], [Y, D]
21738 // Which, in our sitofp/fcmp example, gives us something like:
21740 // ucomiss %xmm1, %xmm0
21741 // movss <1.0f>, %xmm0
21744 // xorps %xmm0, %xmm0
21748 MachineInstr *CascadedCMOV = nullptr;
21749 MachineInstr *LastCMOV = MI;
21750 X86::CondCode CC = X86::CondCode(MI->getOperand(3).getImm());
21751 X86::CondCode OppCC = X86::GetOppositeBranchCondition(CC);
21752 MachineBasicBlock::iterator NextMIIt =
21753 std::next(MachineBasicBlock::iterator(MI));
21755 // Check for case 1, where there are multiple CMOVs with the same condition
21756 // first. Of the two cases of multiple CMOV lowerings, case 1 reduces the
21757 // number of jumps the most.
21759 if (isCMOVPseudo(MI)) {
21760 // See if we have a string of CMOVS with the same condition.
21761 while (NextMIIt != BB->end() &&
21762 isCMOVPseudo(NextMIIt) &&
21763 (NextMIIt->getOperand(3).getImm() == CC ||
21764 NextMIIt->getOperand(3).getImm() == OppCC)) {
21765 LastCMOV = &*NextMIIt;
21770 // This checks for case 2, but only do this if we didn't already find
21771 // case 1, as indicated by LastCMOV == MI.
21772 if (LastCMOV == MI &&
21773 NextMIIt != BB->end() && NextMIIt->getOpcode() == MI->getOpcode() &&
21774 NextMIIt->getOperand(2).getReg() == MI->getOperand(2).getReg() &&
21775 NextMIIt->getOperand(1).getReg() == MI->getOperand(0).getReg()) {
21776 CascadedCMOV = &*NextMIIt;
21779 MachineBasicBlock *jcc1MBB = nullptr;
21781 // If we have a cascaded CMOV, we lower it to two successive branches to
21782 // the same block. EFLAGS is used by both, so mark it as live in the second.
21783 if (CascadedCMOV) {
21784 jcc1MBB = F->CreateMachineBasicBlock(LLVM_BB);
21785 F->insert(It, jcc1MBB);
21786 jcc1MBB->addLiveIn(X86::EFLAGS);
21789 MachineBasicBlock *copy0MBB = F->CreateMachineBasicBlock(LLVM_BB);
21790 MachineBasicBlock *sinkMBB = F->CreateMachineBasicBlock(LLVM_BB);
21791 F->insert(It, copy0MBB);
21792 F->insert(It, sinkMBB);
21794 // If the EFLAGS register isn't dead in the terminator, then claim that it's
21795 // live into the sink and copy blocks.
21796 const TargetRegisterInfo *TRI = Subtarget->getRegisterInfo();
21798 MachineInstr *LastEFLAGSUser = CascadedCMOV ? CascadedCMOV : LastCMOV;
21799 if (!LastEFLAGSUser->killsRegister(X86::EFLAGS) &&
21800 !checkAndUpdateEFLAGSKill(LastEFLAGSUser, BB, TRI)) {
21801 copy0MBB->addLiveIn(X86::EFLAGS);
21802 sinkMBB->addLiveIn(X86::EFLAGS);
21805 // Transfer the remainder of BB and its successor edges to sinkMBB.
21806 sinkMBB->splice(sinkMBB->begin(), BB,
21807 std::next(MachineBasicBlock::iterator(LastCMOV)), BB->end());
21808 sinkMBB->transferSuccessorsAndUpdatePHIs(BB);
21810 // Add the true and fallthrough blocks as its successors.
21811 if (CascadedCMOV) {
21812 // The fallthrough block may be jcc1MBB, if we have a cascaded CMOV.
21813 BB->addSuccessor(jcc1MBB);
21815 // In that case, jcc1MBB will itself fallthrough the copy0MBB, and
21816 // jump to the sinkMBB.
21817 jcc1MBB->addSuccessor(copy0MBB);
21818 jcc1MBB->addSuccessor(sinkMBB);
21820 BB->addSuccessor(copy0MBB);
21823 // The true block target of the first (or only) branch is always sinkMBB.
21824 BB->addSuccessor(sinkMBB);
21826 // Create the conditional branch instruction.
21827 unsigned Opc = X86::GetCondBranchFromCond(CC);
21828 BuildMI(BB, DL, TII->get(Opc)).addMBB(sinkMBB);
21830 if (CascadedCMOV) {
21831 unsigned Opc2 = X86::GetCondBranchFromCond(
21832 (X86::CondCode)CascadedCMOV->getOperand(3).getImm());
21833 BuildMI(jcc1MBB, DL, TII->get(Opc2)).addMBB(sinkMBB);
21837 // %FalseValue = ...
21838 // # fallthrough to sinkMBB
21839 copy0MBB->addSuccessor(sinkMBB);
21842 // %Result = phi [ %FalseValue, copy0MBB ], [ %TrueValue, thisMBB ]
21844 MachineBasicBlock::iterator MIItBegin = MachineBasicBlock::iterator(MI);
21845 MachineBasicBlock::iterator MIItEnd =
21846 std::next(MachineBasicBlock::iterator(LastCMOV));
21847 MachineBasicBlock::iterator SinkInsertionPoint = sinkMBB->begin();
21848 DenseMap<unsigned, std::pair<unsigned, unsigned>> RegRewriteTable;
21849 MachineInstrBuilder MIB;
21851 // As we are creating the PHIs, we have to be careful if there is more than
21852 // one. Later CMOVs may reference the results of earlier CMOVs, but later
21853 // PHIs have to reference the individual true/false inputs from earlier PHIs.
21854 // That also means that PHI construction must work forward from earlier to
21855 // later, and that the code must maintain a mapping from earlier PHI's
21856 // destination registers, and the registers that went into the PHI.
21858 for (MachineBasicBlock::iterator MIIt = MIItBegin; MIIt != MIItEnd; ++MIIt) {
21859 unsigned DestReg = MIIt->getOperand(0).getReg();
21860 unsigned Op1Reg = MIIt->getOperand(1).getReg();
21861 unsigned Op2Reg = MIIt->getOperand(2).getReg();
21863 // If this CMOV we are generating is the opposite condition from
21864 // the jump we generated, then we have to swap the operands for the
21865 // PHI that is going to be generated.
21866 if (MIIt->getOperand(3).getImm() == OppCC)
21867 std::swap(Op1Reg, Op2Reg);
21869 if (RegRewriteTable.find(Op1Reg) != RegRewriteTable.end())
21870 Op1Reg = RegRewriteTable[Op1Reg].first;
21872 if (RegRewriteTable.find(Op2Reg) != RegRewriteTable.end())
21873 Op2Reg = RegRewriteTable[Op2Reg].second;
21875 MIB = BuildMI(*sinkMBB, SinkInsertionPoint, DL,
21876 TII->get(X86::PHI), DestReg)
21877 .addReg(Op1Reg).addMBB(copy0MBB)
21878 .addReg(Op2Reg).addMBB(thisMBB);
21880 // Add this PHI to the rewrite table.
21881 RegRewriteTable[DestReg] = std::make_pair(Op1Reg, Op2Reg);
21884 // If we have a cascaded CMOV, the second Jcc provides the same incoming
21885 // value as the first Jcc (the True operand of the SELECT_CC/CMOV nodes).
21886 if (CascadedCMOV) {
21887 MIB.addReg(MI->getOperand(2).getReg()).addMBB(jcc1MBB);
21888 // Copy the PHI result to the register defined by the second CMOV.
21889 BuildMI(*sinkMBB, std::next(MachineBasicBlock::iterator(MIB.getInstr())),
21890 DL, TII->get(TargetOpcode::COPY),
21891 CascadedCMOV->getOperand(0).getReg())
21892 .addReg(MI->getOperand(0).getReg());
21893 CascadedCMOV->eraseFromParent();
21896 // Now remove the CMOV(s).
21897 for (MachineBasicBlock::iterator MIIt = MIItBegin; MIIt != MIItEnd; )
21898 (MIIt++)->eraseFromParent();
21903 MachineBasicBlock *
21904 X86TargetLowering::EmitLoweredAtomicFP(MachineInstr *MI,
21905 MachineBasicBlock *BB) const {
21906 // Combine the following atomic floating-point modification pattern:
21907 // a.store(reg OP a.load(acquire), release)
21908 // Transform them into:
21909 // OPss (%gpr), %xmm
21910 // movss %xmm, (%gpr)
21911 // Or sd equivalent for 64-bit operations.
21913 switch (MI->getOpcode()) {
21914 default: llvm_unreachable("unexpected instr type for EmitLoweredAtomicFP");
21915 case X86::RELEASE_FADD32mr: MOp = X86::MOVSSmr; FOp = X86::ADDSSrm; break;
21916 case X86::RELEASE_FADD64mr: MOp = X86::MOVSDmr; FOp = X86::ADDSDrm; break;
21918 const X86InstrInfo *TII = Subtarget->getInstrInfo();
21919 DebugLoc DL = MI->getDebugLoc();
21920 MachineRegisterInfo &MRI = BB->getParent()->getRegInfo();
21921 MachineOperand MSrc = MI->getOperand(0);
21922 unsigned VSrc = MI->getOperand(5).getReg();
21923 const MachineOperand &Disp = MI->getOperand(3);
21924 MachineOperand ZeroDisp = MachineOperand::CreateImm(0);
21925 bool hasDisp = Disp.isGlobal() || Disp.isImm();
21926 if (hasDisp && MSrc.isReg())
21927 MSrc.setIsKill(false);
21928 MachineInstrBuilder MIM = BuildMI(*BB, MI, DL, TII->get(MOp))
21929 .addOperand(/*Base=*/MSrc)
21930 .addImm(/*Scale=*/1)
21931 .addReg(/*Index=*/0)
21932 .addDisp(hasDisp ? Disp : ZeroDisp, /*off=*/0)
21934 MachineInstr *MIO = BuildMI(*BB, (MachineInstr *)MIM, DL, TII->get(FOp),
21935 MRI.createVirtualRegister(MRI.getRegClass(VSrc)))
21937 .addOperand(/*Base=*/MSrc)
21938 .addImm(/*Scale=*/1)
21939 .addReg(/*Index=*/0)
21940 .addDisp(hasDisp ? Disp : ZeroDisp, /*off=*/0)
21941 .addReg(/*Segment=*/0);
21942 MIM.addReg(MIO->getOperand(0).getReg(), RegState::Kill);
21943 MI->eraseFromParent(); // The pseudo instruction is gone now.
21947 MachineBasicBlock *
21948 X86TargetLowering::EmitLoweredSegAlloca(MachineInstr *MI,
21949 MachineBasicBlock *BB) const {
21950 MachineFunction *MF = BB->getParent();
21951 const TargetInstrInfo *TII = Subtarget->getInstrInfo();
21952 DebugLoc DL = MI->getDebugLoc();
21953 const BasicBlock *LLVM_BB = BB->getBasicBlock();
21955 assert(MF->shouldSplitStack());
21957 const bool Is64Bit = Subtarget->is64Bit();
21958 const bool IsLP64 = Subtarget->isTarget64BitLP64();
21960 const unsigned TlsReg = Is64Bit ? X86::FS : X86::GS;
21961 const unsigned TlsOffset = IsLP64 ? 0x70 : Is64Bit ? 0x40 : 0x30;
21964 // ... [Till the alloca]
21965 // If stacklet is not large enough, jump to mallocMBB
21968 // Allocate by subtracting from RSP
21969 // Jump to continueMBB
21972 // Allocate by call to runtime
21976 // [rest of original BB]
21979 MachineBasicBlock *mallocMBB = MF->CreateMachineBasicBlock(LLVM_BB);
21980 MachineBasicBlock *bumpMBB = MF->CreateMachineBasicBlock(LLVM_BB);
21981 MachineBasicBlock *continueMBB = MF->CreateMachineBasicBlock(LLVM_BB);
21983 MachineRegisterInfo &MRI = MF->getRegInfo();
21984 const TargetRegisterClass *AddrRegClass =
21985 getRegClassFor(getPointerTy(MF->getDataLayout()));
21987 unsigned mallocPtrVReg = MRI.createVirtualRegister(AddrRegClass),
21988 bumpSPPtrVReg = MRI.createVirtualRegister(AddrRegClass),
21989 tmpSPVReg = MRI.createVirtualRegister(AddrRegClass),
21990 SPLimitVReg = MRI.createVirtualRegister(AddrRegClass),
21991 sizeVReg = MI->getOperand(1).getReg(),
21992 physSPReg = IsLP64 || Subtarget->isTargetNaCl64() ? X86::RSP : X86::ESP;
21994 MachineFunction::iterator MBBIter = ++BB->getIterator();
21996 MF->insert(MBBIter, bumpMBB);
21997 MF->insert(MBBIter, mallocMBB);
21998 MF->insert(MBBIter, continueMBB);
22000 continueMBB->splice(continueMBB->begin(), BB,
22001 std::next(MachineBasicBlock::iterator(MI)), BB->end());
22002 continueMBB->transferSuccessorsAndUpdatePHIs(BB);
22004 // Add code to the main basic block to check if the stack limit has been hit,
22005 // and if so, jump to mallocMBB otherwise to bumpMBB.
22006 BuildMI(BB, DL, TII->get(TargetOpcode::COPY), tmpSPVReg).addReg(physSPReg);
22007 BuildMI(BB, DL, TII->get(IsLP64 ? X86::SUB64rr:X86::SUB32rr), SPLimitVReg)
22008 .addReg(tmpSPVReg).addReg(sizeVReg);
22009 BuildMI(BB, DL, TII->get(IsLP64 ? X86::CMP64mr:X86::CMP32mr))
22010 .addReg(0).addImm(1).addReg(0).addImm(TlsOffset).addReg(TlsReg)
22011 .addReg(SPLimitVReg);
22012 BuildMI(BB, DL, TII->get(X86::JG_1)).addMBB(mallocMBB);
22014 // bumpMBB simply decreases the stack pointer, since we know the current
22015 // stacklet has enough space.
22016 BuildMI(bumpMBB, DL, TII->get(TargetOpcode::COPY), physSPReg)
22017 .addReg(SPLimitVReg);
22018 BuildMI(bumpMBB, DL, TII->get(TargetOpcode::COPY), bumpSPPtrVReg)
22019 .addReg(SPLimitVReg);
22020 BuildMI(bumpMBB, DL, TII->get(X86::JMP_1)).addMBB(continueMBB);
22022 // Calls into a routine in libgcc to allocate more space from the heap.
22023 const uint32_t *RegMask =
22024 Subtarget->getRegisterInfo()->getCallPreservedMask(*MF, CallingConv::C);
22026 BuildMI(mallocMBB, DL, TII->get(X86::MOV64rr), X86::RDI)
22028 BuildMI(mallocMBB, DL, TII->get(X86::CALL64pcrel32))
22029 .addExternalSymbol("__morestack_allocate_stack_space")
22030 .addRegMask(RegMask)
22031 .addReg(X86::RDI, RegState::Implicit)
22032 .addReg(X86::RAX, RegState::ImplicitDefine);
22033 } else if (Is64Bit) {
22034 BuildMI(mallocMBB, DL, TII->get(X86::MOV32rr), X86::EDI)
22036 BuildMI(mallocMBB, DL, TII->get(X86::CALL64pcrel32))
22037 .addExternalSymbol("__morestack_allocate_stack_space")
22038 .addRegMask(RegMask)
22039 .addReg(X86::EDI, RegState::Implicit)
22040 .addReg(X86::EAX, RegState::ImplicitDefine);
22042 BuildMI(mallocMBB, DL, TII->get(X86::SUB32ri), physSPReg).addReg(physSPReg)
22044 BuildMI(mallocMBB, DL, TII->get(X86::PUSH32r)).addReg(sizeVReg);
22045 BuildMI(mallocMBB, DL, TII->get(X86::CALLpcrel32))
22046 .addExternalSymbol("__morestack_allocate_stack_space")
22047 .addRegMask(RegMask)
22048 .addReg(X86::EAX, RegState::ImplicitDefine);
22052 BuildMI(mallocMBB, DL, TII->get(X86::ADD32ri), physSPReg).addReg(physSPReg)
22055 BuildMI(mallocMBB, DL, TII->get(TargetOpcode::COPY), mallocPtrVReg)
22056 .addReg(IsLP64 ? X86::RAX : X86::EAX);
22057 BuildMI(mallocMBB, DL, TII->get(X86::JMP_1)).addMBB(continueMBB);
22059 // Set up the CFG correctly.
22060 BB->addSuccessor(bumpMBB);
22061 BB->addSuccessor(mallocMBB);
22062 mallocMBB->addSuccessor(continueMBB);
22063 bumpMBB->addSuccessor(continueMBB);
22065 // Take care of the PHI nodes.
22066 BuildMI(*continueMBB, continueMBB->begin(), DL, TII->get(X86::PHI),
22067 MI->getOperand(0).getReg())
22068 .addReg(mallocPtrVReg).addMBB(mallocMBB)
22069 .addReg(bumpSPPtrVReg).addMBB(bumpMBB);
22071 // Delete the original pseudo instruction.
22072 MI->eraseFromParent();
22075 return continueMBB;
22078 MachineBasicBlock *
22079 X86TargetLowering::EmitLoweredWinAlloca(MachineInstr *MI,
22080 MachineBasicBlock *BB) const {
22081 assert(!Subtarget->isTargetMachO());
22082 DebugLoc DL = MI->getDebugLoc();
22083 MachineInstr *ResumeMI = Subtarget->getFrameLowering()->emitStackProbe(
22084 *BB->getParent(), *BB, MI, DL, false);
22085 MachineBasicBlock *ResumeBB = ResumeMI->getParent();
22086 MI->eraseFromParent(); // The pseudo instruction is gone now.
22090 MachineBasicBlock *
22091 X86TargetLowering::EmitLoweredCatchRet(MachineInstr *MI,
22092 MachineBasicBlock *BB) const {
22093 MachineFunction *MF = BB->getParent();
22094 const TargetInstrInfo &TII = *Subtarget->getInstrInfo();
22095 MachineBasicBlock *TargetMBB = MI->getOperand(0).getMBB();
22096 DebugLoc DL = MI->getDebugLoc();
22098 assert(!isAsynchronousEHPersonality(
22099 classifyEHPersonality(MF->getFunction()->getPersonalityFn())) &&
22100 "SEH does not use catchret!");
22102 // Only 32-bit EH needs to worry about manually restoring stack pointers.
22103 if (!Subtarget->is32Bit())
22106 // C++ EH creates a new target block to hold the restore code, and wires up
22107 // the new block to the return destination with a normal JMP_4.
22108 MachineBasicBlock *RestoreMBB =
22109 MF->CreateMachineBasicBlock(BB->getBasicBlock());
22110 assert(BB->succ_size() == 1);
22111 MF->insert(std::next(BB->getIterator()), RestoreMBB);
22112 RestoreMBB->transferSuccessorsAndUpdatePHIs(BB);
22113 BB->addSuccessor(RestoreMBB);
22114 MI->getOperand(0).setMBB(RestoreMBB);
22116 auto RestoreMBBI = RestoreMBB->begin();
22117 BuildMI(*RestoreMBB, RestoreMBBI, DL, TII.get(X86::EH_RESTORE));
22118 BuildMI(*RestoreMBB, RestoreMBBI, DL, TII.get(X86::JMP_4)).addMBB(TargetMBB);
22122 MachineBasicBlock *
22123 X86TargetLowering::EmitLoweredCatchPad(MachineInstr *MI,
22124 MachineBasicBlock *BB) const {
22125 MachineFunction *MF = BB->getParent();
22126 const Constant *PerFn = MF->getFunction()->getPersonalityFn();
22127 bool IsSEH = isAsynchronousEHPersonality(classifyEHPersonality(PerFn));
22128 // Only 32-bit SEH requires special handling for catchpad.
22129 if (IsSEH && Subtarget->is32Bit()) {
22130 const TargetInstrInfo &TII = *Subtarget->getInstrInfo();
22131 DebugLoc DL = MI->getDebugLoc();
22132 BuildMI(*BB, MI, DL, TII.get(X86::EH_RESTORE));
22134 MI->eraseFromParent();
22138 MachineBasicBlock *
22139 X86TargetLowering::EmitLoweredTLSCall(MachineInstr *MI,
22140 MachineBasicBlock *BB) const {
22141 // This is pretty easy. We're taking the value that we received from
22142 // our load from the relocation, sticking it in either RDI (x86-64)
22143 // or EAX and doing an indirect call. The return value will then
22144 // be in the normal return register.
22145 MachineFunction *F = BB->getParent();
22146 const X86InstrInfo *TII = Subtarget->getInstrInfo();
22147 DebugLoc DL = MI->getDebugLoc();
22149 assert(Subtarget->isTargetDarwin() && "Darwin only instr emitted?");
22150 assert(MI->getOperand(3).isGlobal() && "This should be a global");
22152 // Get a register mask for the lowered call.
22153 // FIXME: The 32-bit calls have non-standard calling conventions. Use a
22154 // proper register mask.
22155 const uint32_t *RegMask =
22156 Subtarget->is64Bit() ?
22157 Subtarget->getRegisterInfo()->getDarwinTLSCallPreservedMask() :
22158 Subtarget->getRegisterInfo()->getCallPreservedMask(*F, CallingConv::C);
22159 if (Subtarget->is64Bit()) {
22160 MachineInstrBuilder MIB = BuildMI(*BB, MI, DL,
22161 TII->get(X86::MOV64rm), X86::RDI)
22163 .addImm(0).addReg(0)
22164 .addGlobalAddress(MI->getOperand(3).getGlobal(), 0,
22165 MI->getOperand(3).getTargetFlags())
22167 MIB = BuildMI(*BB, MI, DL, TII->get(X86::CALL64m));
22168 addDirectMem(MIB, X86::RDI);
22169 MIB.addReg(X86::RAX, RegState::ImplicitDefine).addRegMask(RegMask);
22170 } else if (F->getTarget().getRelocationModel() != Reloc::PIC_) {
22171 MachineInstrBuilder MIB = BuildMI(*BB, MI, DL,
22172 TII->get(X86::MOV32rm), X86::EAX)
22174 .addImm(0).addReg(0)
22175 .addGlobalAddress(MI->getOperand(3).getGlobal(), 0,
22176 MI->getOperand(3).getTargetFlags())
22178 MIB = BuildMI(*BB, MI, DL, TII->get(X86::CALL32m));
22179 addDirectMem(MIB, X86::EAX);
22180 MIB.addReg(X86::EAX, RegState::ImplicitDefine).addRegMask(RegMask);
22182 MachineInstrBuilder MIB = BuildMI(*BB, MI, DL,
22183 TII->get(X86::MOV32rm), X86::EAX)
22184 .addReg(TII->getGlobalBaseReg(F))
22185 .addImm(0).addReg(0)
22186 .addGlobalAddress(MI->getOperand(3).getGlobal(), 0,
22187 MI->getOperand(3).getTargetFlags())
22189 MIB = BuildMI(*BB, MI, DL, TII->get(X86::CALL32m));
22190 addDirectMem(MIB, X86::EAX);
22191 MIB.addReg(X86::EAX, RegState::ImplicitDefine).addRegMask(RegMask);
22194 MI->eraseFromParent(); // The pseudo instruction is gone now.
22198 MachineBasicBlock *
22199 X86TargetLowering::emitEHSjLjSetJmp(MachineInstr *MI,
22200 MachineBasicBlock *MBB) const {
22201 DebugLoc DL = MI->getDebugLoc();
22202 MachineFunction *MF = MBB->getParent();
22203 const TargetInstrInfo *TII = Subtarget->getInstrInfo();
22204 MachineRegisterInfo &MRI = MF->getRegInfo();
22206 const BasicBlock *BB = MBB->getBasicBlock();
22207 MachineFunction::iterator I = ++MBB->getIterator();
22209 // Memory Reference
22210 MachineInstr::mmo_iterator MMOBegin = MI->memoperands_begin();
22211 MachineInstr::mmo_iterator MMOEnd = MI->memoperands_end();
22214 unsigned MemOpndSlot = 0;
22216 unsigned CurOp = 0;
22218 DstReg = MI->getOperand(CurOp++).getReg();
22219 const TargetRegisterClass *RC = MRI.getRegClass(DstReg);
22220 assert(RC->hasType(MVT::i32) && "Invalid destination!");
22221 unsigned mainDstReg = MRI.createVirtualRegister(RC);
22222 unsigned restoreDstReg = MRI.createVirtualRegister(RC);
22224 MemOpndSlot = CurOp;
22226 MVT PVT = getPointerTy(MF->getDataLayout());
22227 assert((PVT == MVT::i64 || PVT == MVT::i32) &&
22228 "Invalid Pointer Size!");
22230 // For v = setjmp(buf), we generate
22233 // buf[LabelOffset] = restoreMBB <-- takes address of restoreMBB
22234 // SjLjSetup restoreMBB
22240 // v = phi(main, restore)
22243 // if base pointer being used, load it from frame
22246 MachineBasicBlock *thisMBB = MBB;
22247 MachineBasicBlock *mainMBB = MF->CreateMachineBasicBlock(BB);
22248 MachineBasicBlock *sinkMBB = MF->CreateMachineBasicBlock(BB);
22249 MachineBasicBlock *restoreMBB = MF->CreateMachineBasicBlock(BB);
22250 MF->insert(I, mainMBB);
22251 MF->insert(I, sinkMBB);
22252 MF->push_back(restoreMBB);
22253 restoreMBB->setHasAddressTaken();
22255 MachineInstrBuilder MIB;
22257 // Transfer the remainder of BB and its successor edges to sinkMBB.
22258 sinkMBB->splice(sinkMBB->begin(), MBB,
22259 std::next(MachineBasicBlock::iterator(MI)), MBB->end());
22260 sinkMBB->transferSuccessorsAndUpdatePHIs(MBB);
22263 unsigned PtrStoreOpc = 0;
22264 unsigned LabelReg = 0;
22265 const int64_t LabelOffset = 1 * PVT.getStoreSize();
22266 Reloc::Model RM = MF->getTarget().getRelocationModel();
22267 bool UseImmLabel = (MF->getTarget().getCodeModel() == CodeModel::Small) &&
22268 (RM == Reloc::Static || RM == Reloc::DynamicNoPIC);
22270 // Prepare IP either in reg or imm.
22271 if (!UseImmLabel) {
22272 PtrStoreOpc = (PVT == MVT::i64) ? X86::MOV64mr : X86::MOV32mr;
22273 const TargetRegisterClass *PtrRC = getRegClassFor(PVT);
22274 LabelReg = MRI.createVirtualRegister(PtrRC);
22275 if (Subtarget->is64Bit()) {
22276 MIB = BuildMI(*thisMBB, MI, DL, TII->get(X86::LEA64r), LabelReg)
22280 .addMBB(restoreMBB)
22283 const X86InstrInfo *XII = static_cast<const X86InstrInfo*>(TII);
22284 MIB = BuildMI(*thisMBB, MI, DL, TII->get(X86::LEA32r), LabelReg)
22285 .addReg(XII->getGlobalBaseReg(MF))
22288 .addMBB(restoreMBB, Subtarget->ClassifyBlockAddressReference())
22292 PtrStoreOpc = (PVT == MVT::i64) ? X86::MOV64mi32 : X86::MOV32mi;
22294 MIB = BuildMI(*thisMBB, MI, DL, TII->get(PtrStoreOpc));
22295 for (unsigned i = 0; i < X86::AddrNumOperands; ++i) {
22296 if (i == X86::AddrDisp)
22297 MIB.addDisp(MI->getOperand(MemOpndSlot + i), LabelOffset);
22299 MIB.addOperand(MI->getOperand(MemOpndSlot + i));
22302 MIB.addReg(LabelReg);
22304 MIB.addMBB(restoreMBB);
22305 MIB.setMemRefs(MMOBegin, MMOEnd);
22307 MIB = BuildMI(*thisMBB, MI, DL, TII->get(X86::EH_SjLj_Setup))
22308 .addMBB(restoreMBB);
22310 const X86RegisterInfo *RegInfo = Subtarget->getRegisterInfo();
22311 MIB.addRegMask(RegInfo->getNoPreservedMask());
22312 thisMBB->addSuccessor(mainMBB);
22313 thisMBB->addSuccessor(restoreMBB);
22317 BuildMI(mainMBB, DL, TII->get(X86::MOV32r0), mainDstReg);
22318 mainMBB->addSuccessor(sinkMBB);
22321 BuildMI(*sinkMBB, sinkMBB->begin(), DL,
22322 TII->get(X86::PHI), DstReg)
22323 .addReg(mainDstReg).addMBB(mainMBB)
22324 .addReg(restoreDstReg).addMBB(restoreMBB);
22327 if (RegInfo->hasBasePointer(*MF)) {
22328 const bool Uses64BitFramePtr =
22329 Subtarget->isTarget64BitLP64() || Subtarget->isTargetNaCl64();
22330 X86MachineFunctionInfo *X86FI = MF->getInfo<X86MachineFunctionInfo>();
22331 X86FI->setRestoreBasePointer(MF);
22332 unsigned FramePtr = RegInfo->getFrameRegister(*MF);
22333 unsigned BasePtr = RegInfo->getBaseRegister();
22334 unsigned Opm = Uses64BitFramePtr ? X86::MOV64rm : X86::MOV32rm;
22335 addRegOffset(BuildMI(restoreMBB, DL, TII->get(Opm), BasePtr),
22336 FramePtr, true, X86FI->getRestoreBasePointerOffset())
22337 .setMIFlag(MachineInstr::FrameSetup);
22339 BuildMI(restoreMBB, DL, TII->get(X86::MOV32ri), restoreDstReg).addImm(1);
22340 BuildMI(restoreMBB, DL, TII->get(X86::JMP_1)).addMBB(sinkMBB);
22341 restoreMBB->addSuccessor(sinkMBB);
22343 MI->eraseFromParent();
22347 MachineBasicBlock *
22348 X86TargetLowering::emitEHSjLjLongJmp(MachineInstr *MI,
22349 MachineBasicBlock *MBB) const {
22350 DebugLoc DL = MI->getDebugLoc();
22351 MachineFunction *MF = MBB->getParent();
22352 const TargetInstrInfo *TII = Subtarget->getInstrInfo();
22353 MachineRegisterInfo &MRI = MF->getRegInfo();
22355 // Memory Reference
22356 MachineInstr::mmo_iterator MMOBegin = MI->memoperands_begin();
22357 MachineInstr::mmo_iterator MMOEnd = MI->memoperands_end();
22359 MVT PVT = getPointerTy(MF->getDataLayout());
22360 assert((PVT == MVT::i64 || PVT == MVT::i32) &&
22361 "Invalid Pointer Size!");
22363 const TargetRegisterClass *RC =
22364 (PVT == MVT::i64) ? &X86::GR64RegClass : &X86::GR32RegClass;
22365 unsigned Tmp = MRI.createVirtualRegister(RC);
22366 // Since FP is only updated here but NOT referenced, it's treated as GPR.
22367 const X86RegisterInfo *RegInfo = Subtarget->getRegisterInfo();
22368 unsigned FP = (PVT == MVT::i64) ? X86::RBP : X86::EBP;
22369 unsigned SP = RegInfo->getStackRegister();
22371 MachineInstrBuilder MIB;
22373 const int64_t LabelOffset = 1 * PVT.getStoreSize();
22374 const int64_t SPOffset = 2 * PVT.getStoreSize();
22376 unsigned PtrLoadOpc = (PVT == MVT::i64) ? X86::MOV64rm : X86::MOV32rm;
22377 unsigned IJmpOpc = (PVT == MVT::i64) ? X86::JMP64r : X86::JMP32r;
22380 MIB = BuildMI(*MBB, MI, DL, TII->get(PtrLoadOpc), FP);
22381 for (unsigned i = 0; i < X86::AddrNumOperands; ++i)
22382 MIB.addOperand(MI->getOperand(i));
22383 MIB.setMemRefs(MMOBegin, MMOEnd);
22385 MIB = BuildMI(*MBB, MI, DL, TII->get(PtrLoadOpc), Tmp);
22386 for (unsigned i = 0; i < X86::AddrNumOperands; ++i) {
22387 if (i == X86::AddrDisp)
22388 MIB.addDisp(MI->getOperand(i), LabelOffset);
22390 MIB.addOperand(MI->getOperand(i));
22392 MIB.setMemRefs(MMOBegin, MMOEnd);
22394 MIB = BuildMI(*MBB, MI, DL, TII->get(PtrLoadOpc), SP);
22395 for (unsigned i = 0; i < X86::AddrNumOperands; ++i) {
22396 if (i == X86::AddrDisp)
22397 MIB.addDisp(MI->getOperand(i), SPOffset);
22399 MIB.addOperand(MI->getOperand(i));
22401 MIB.setMemRefs(MMOBegin, MMOEnd);
22403 BuildMI(*MBB, MI, DL, TII->get(IJmpOpc)).addReg(Tmp);
22405 MI->eraseFromParent();
22409 // Replace 213-type (isel default) FMA3 instructions with 231-type for
22410 // accumulator loops. Writing back to the accumulator allows the coalescer
22411 // to remove extra copies in the loop.
22412 // FIXME: Do this on AVX512. We don't support 231 variants yet (PR23937).
22413 MachineBasicBlock *
22414 X86TargetLowering::emitFMA3Instr(MachineInstr *MI,
22415 MachineBasicBlock *MBB) const {
22416 MachineOperand &AddendOp = MI->getOperand(3);
22418 // Bail out early if the addend isn't a register - we can't switch these.
22419 if (!AddendOp.isReg())
22422 MachineFunction &MF = *MBB->getParent();
22423 MachineRegisterInfo &MRI = MF.getRegInfo();
22425 // Check whether the addend is defined by a PHI:
22426 assert(MRI.hasOneDef(AddendOp.getReg()) && "Multiple defs in SSA?");
22427 MachineInstr &AddendDef = *MRI.def_instr_begin(AddendOp.getReg());
22428 if (!AddendDef.isPHI())
22431 // Look for the following pattern:
22433 // %addend = phi [%entry, 0], [%loop, %result]
22435 // %result<tied1> = FMA213 %m2<tied0>, %m1, %addend
22439 // %addend = phi [%entry, 0], [%loop, %result]
22441 // %result<tied1> = FMA231 %addend<tied0>, %m1, %m2
22443 for (unsigned i = 1, e = AddendDef.getNumOperands(); i < e; i += 2) {
22444 assert(AddendDef.getOperand(i).isReg());
22445 MachineOperand PHISrcOp = AddendDef.getOperand(i);
22446 MachineInstr &PHISrcInst = *MRI.def_instr_begin(PHISrcOp.getReg());
22447 if (&PHISrcInst == MI) {
22448 // Found a matching instruction.
22449 unsigned NewFMAOpc = 0;
22450 switch (MI->getOpcode()) {
22451 case X86::VFMADDPDr213r: NewFMAOpc = X86::VFMADDPDr231r; break;
22452 case X86::VFMADDPSr213r: NewFMAOpc = X86::VFMADDPSr231r; break;
22453 case X86::VFMADDSDr213r: NewFMAOpc = X86::VFMADDSDr231r; break;
22454 case X86::VFMADDSSr213r: NewFMAOpc = X86::VFMADDSSr231r; break;
22455 case X86::VFMSUBPDr213r: NewFMAOpc = X86::VFMSUBPDr231r; break;
22456 case X86::VFMSUBPSr213r: NewFMAOpc = X86::VFMSUBPSr231r; break;
22457 case X86::VFMSUBSDr213r: NewFMAOpc = X86::VFMSUBSDr231r; break;
22458 case X86::VFMSUBSSr213r: NewFMAOpc = X86::VFMSUBSSr231r; break;
22459 case X86::VFNMADDPDr213r: NewFMAOpc = X86::VFNMADDPDr231r; break;
22460 case X86::VFNMADDPSr213r: NewFMAOpc = X86::VFNMADDPSr231r; break;
22461 case X86::VFNMADDSDr213r: NewFMAOpc = X86::VFNMADDSDr231r; break;
22462 case X86::VFNMADDSSr213r: NewFMAOpc = X86::VFNMADDSSr231r; break;
22463 case X86::VFNMSUBPDr213r: NewFMAOpc = X86::VFNMSUBPDr231r; break;
22464 case X86::VFNMSUBPSr213r: NewFMAOpc = X86::VFNMSUBPSr231r; break;
22465 case X86::VFNMSUBSDr213r: NewFMAOpc = X86::VFNMSUBSDr231r; break;
22466 case X86::VFNMSUBSSr213r: NewFMAOpc = X86::VFNMSUBSSr231r; break;
22467 case X86::VFMADDSUBPDr213r: NewFMAOpc = X86::VFMADDSUBPDr231r; break;
22468 case X86::VFMADDSUBPSr213r: NewFMAOpc = X86::VFMADDSUBPSr231r; break;
22469 case X86::VFMSUBADDPDr213r: NewFMAOpc = X86::VFMSUBADDPDr231r; break;
22470 case X86::VFMSUBADDPSr213r: NewFMAOpc = X86::VFMSUBADDPSr231r; break;
22472 case X86::VFMADDPDr213rY: NewFMAOpc = X86::VFMADDPDr231rY; break;
22473 case X86::VFMADDPSr213rY: NewFMAOpc = X86::VFMADDPSr231rY; break;
22474 case X86::VFMSUBPDr213rY: NewFMAOpc = X86::VFMSUBPDr231rY; break;
22475 case X86::VFMSUBPSr213rY: NewFMAOpc = X86::VFMSUBPSr231rY; break;
22476 case X86::VFNMADDPDr213rY: NewFMAOpc = X86::VFNMADDPDr231rY; break;
22477 case X86::VFNMADDPSr213rY: NewFMAOpc = X86::VFNMADDPSr231rY; break;
22478 case X86::VFNMSUBPDr213rY: NewFMAOpc = X86::VFNMSUBPDr231rY; break;
22479 case X86::VFNMSUBPSr213rY: NewFMAOpc = X86::VFNMSUBPSr231rY; break;
22480 case X86::VFMADDSUBPDr213rY: NewFMAOpc = X86::VFMADDSUBPDr231rY; break;
22481 case X86::VFMADDSUBPSr213rY: NewFMAOpc = X86::VFMADDSUBPSr231rY; break;
22482 case X86::VFMSUBADDPDr213rY: NewFMAOpc = X86::VFMSUBADDPDr231rY; break;
22483 case X86::VFMSUBADDPSr213rY: NewFMAOpc = X86::VFMSUBADDPSr231rY; break;
22484 default: llvm_unreachable("Unrecognized FMA variant.");
22487 const TargetInstrInfo &TII = *Subtarget->getInstrInfo();
22488 MachineInstrBuilder MIB =
22489 BuildMI(MF, MI->getDebugLoc(), TII.get(NewFMAOpc))
22490 .addOperand(MI->getOperand(0))
22491 .addOperand(MI->getOperand(3))
22492 .addOperand(MI->getOperand(2))
22493 .addOperand(MI->getOperand(1));
22494 MBB->insert(MachineBasicBlock::iterator(MI), MIB);
22495 MI->eraseFromParent();
22502 MachineBasicBlock *
22503 X86TargetLowering::EmitInstrWithCustomInserter(MachineInstr *MI,
22504 MachineBasicBlock *BB) const {
22505 switch (MI->getOpcode()) {
22506 default: llvm_unreachable("Unexpected instr type to insert");
22507 case X86::TAILJMPd64:
22508 case X86::TAILJMPr64:
22509 case X86::TAILJMPm64:
22510 case X86::TAILJMPd64_REX:
22511 case X86::TAILJMPr64_REX:
22512 case X86::TAILJMPm64_REX:
22513 llvm_unreachable("TAILJMP64 would not be touched here.");
22514 case X86::TCRETURNdi64:
22515 case X86::TCRETURNri64:
22516 case X86::TCRETURNmi64:
22518 case X86::WIN_ALLOCA:
22519 return EmitLoweredWinAlloca(MI, BB);
22520 case X86::CATCHRET:
22521 return EmitLoweredCatchRet(MI, BB);
22522 case X86::CATCHPAD:
22523 return EmitLoweredCatchPad(MI, BB);
22524 case X86::SEG_ALLOCA_32:
22525 case X86::SEG_ALLOCA_64:
22526 return EmitLoweredSegAlloca(MI, BB);
22527 case X86::TLSCall_32:
22528 case X86::TLSCall_64:
22529 return EmitLoweredTLSCall(MI, BB);
22530 case X86::CMOV_FR32:
22531 case X86::CMOV_FR64:
22532 case X86::CMOV_FR128:
22533 case X86::CMOV_GR8:
22534 case X86::CMOV_GR16:
22535 case X86::CMOV_GR32:
22536 case X86::CMOV_RFP32:
22537 case X86::CMOV_RFP64:
22538 case X86::CMOV_RFP80:
22539 case X86::CMOV_V2F64:
22540 case X86::CMOV_V2I64:
22541 case X86::CMOV_V4F32:
22542 case X86::CMOV_V4F64:
22543 case X86::CMOV_V4I64:
22544 case X86::CMOV_V16F32:
22545 case X86::CMOV_V8F32:
22546 case X86::CMOV_V8F64:
22547 case X86::CMOV_V8I64:
22548 case X86::CMOV_V8I1:
22549 case X86::CMOV_V16I1:
22550 case X86::CMOV_V32I1:
22551 case X86::CMOV_V64I1:
22552 return EmitLoweredSelect(MI, BB);
22554 case X86::RDFLAGS32:
22555 case X86::RDFLAGS64: {
22556 DebugLoc DL = MI->getDebugLoc();
22557 const TargetInstrInfo *TII = Subtarget->getInstrInfo();
22559 MI->getOpcode() == X86::RDFLAGS32 ? X86::PUSHF32 : X86::PUSHF64;
22561 MI->getOpcode() == X86::RDFLAGS32 ? X86::POP32r : X86::POP64r;
22562 BuildMI(*BB, MI, DL, TII->get(PushF));
22563 BuildMI(*BB, MI, DL, TII->get(Pop), MI->getOperand(0).getReg());
22565 MI->eraseFromParent(); // The pseudo is gone now.
22569 case X86::WRFLAGS32:
22570 case X86::WRFLAGS64: {
22571 DebugLoc DL = MI->getDebugLoc();
22572 const TargetInstrInfo *TII = Subtarget->getInstrInfo();
22574 MI->getOpcode() == X86::WRFLAGS32 ? X86::PUSH32r : X86::PUSH64r;
22576 MI->getOpcode() == X86::WRFLAGS32 ? X86::POPF32 : X86::POPF64;
22577 BuildMI(*BB, MI, DL, TII->get(Push)).addReg(MI->getOperand(0).getReg());
22578 BuildMI(*BB, MI, DL, TII->get(PopF));
22580 MI->eraseFromParent(); // The pseudo is gone now.
22584 case X86::RELEASE_FADD32mr:
22585 case X86::RELEASE_FADD64mr:
22586 return EmitLoweredAtomicFP(MI, BB);
22588 case X86::FP32_TO_INT16_IN_MEM:
22589 case X86::FP32_TO_INT32_IN_MEM:
22590 case X86::FP32_TO_INT64_IN_MEM:
22591 case X86::FP64_TO_INT16_IN_MEM:
22592 case X86::FP64_TO_INT32_IN_MEM:
22593 case X86::FP64_TO_INT64_IN_MEM:
22594 case X86::FP80_TO_INT16_IN_MEM:
22595 case X86::FP80_TO_INT32_IN_MEM:
22596 case X86::FP80_TO_INT64_IN_MEM: {
22597 MachineFunction *F = BB->getParent();
22598 const TargetInstrInfo *TII = Subtarget->getInstrInfo();
22599 DebugLoc DL = MI->getDebugLoc();
22601 // Change the floating point control register to use "round towards zero"
22602 // mode when truncating to an integer value.
22603 int CWFrameIdx = F->getFrameInfo()->CreateStackObject(2, 2, false);
22604 addFrameReference(BuildMI(*BB, MI, DL,
22605 TII->get(X86::FNSTCW16m)), CWFrameIdx);
22607 // Load the old value of the high byte of the control word...
22609 F->getRegInfo().createVirtualRegister(&X86::GR16RegClass);
22610 addFrameReference(BuildMI(*BB, MI, DL, TII->get(X86::MOV16rm), OldCW),
22613 // Set the high part to be round to zero...
22614 addFrameReference(BuildMI(*BB, MI, DL, TII->get(X86::MOV16mi)), CWFrameIdx)
22617 // Reload the modified control word now...
22618 addFrameReference(BuildMI(*BB, MI, DL,
22619 TII->get(X86::FLDCW16m)), CWFrameIdx);
22621 // Restore the memory image of control word to original value
22622 addFrameReference(BuildMI(*BB, MI, DL, TII->get(X86::MOV16mr)), CWFrameIdx)
22625 // Get the X86 opcode to use.
22627 switch (MI->getOpcode()) {
22628 default: llvm_unreachable("illegal opcode!");
22629 case X86::FP32_TO_INT16_IN_MEM: Opc = X86::IST_Fp16m32; break;
22630 case X86::FP32_TO_INT32_IN_MEM: Opc = X86::IST_Fp32m32; break;
22631 case X86::FP32_TO_INT64_IN_MEM: Opc = X86::IST_Fp64m32; break;
22632 case X86::FP64_TO_INT16_IN_MEM: Opc = X86::IST_Fp16m64; break;
22633 case X86::FP64_TO_INT32_IN_MEM: Opc = X86::IST_Fp32m64; break;
22634 case X86::FP64_TO_INT64_IN_MEM: Opc = X86::IST_Fp64m64; break;
22635 case X86::FP80_TO_INT16_IN_MEM: Opc = X86::IST_Fp16m80; break;
22636 case X86::FP80_TO_INT32_IN_MEM: Opc = X86::IST_Fp32m80; break;
22637 case X86::FP80_TO_INT64_IN_MEM: Opc = X86::IST_Fp64m80; break;
22641 MachineOperand &Op = MI->getOperand(0);
22643 AM.BaseType = X86AddressMode::RegBase;
22644 AM.Base.Reg = Op.getReg();
22646 AM.BaseType = X86AddressMode::FrameIndexBase;
22647 AM.Base.FrameIndex = Op.getIndex();
22649 Op = MI->getOperand(1);
22651 AM.Scale = Op.getImm();
22652 Op = MI->getOperand(2);
22654 AM.IndexReg = Op.getImm();
22655 Op = MI->getOperand(3);
22656 if (Op.isGlobal()) {
22657 AM.GV = Op.getGlobal();
22659 AM.Disp = Op.getImm();
22661 addFullAddress(BuildMI(*BB, MI, DL, TII->get(Opc)), AM)
22662 .addReg(MI->getOperand(X86::AddrNumOperands).getReg());
22664 // Reload the original control word now.
22665 addFrameReference(BuildMI(*BB, MI, DL,
22666 TII->get(X86::FLDCW16m)), CWFrameIdx);
22668 MI->eraseFromParent(); // The pseudo instruction is gone now.
22671 // String/text processing lowering.
22672 case X86::PCMPISTRM128REG:
22673 case X86::VPCMPISTRM128REG:
22674 case X86::PCMPISTRM128MEM:
22675 case X86::VPCMPISTRM128MEM:
22676 case X86::PCMPESTRM128REG:
22677 case X86::VPCMPESTRM128REG:
22678 case X86::PCMPESTRM128MEM:
22679 case X86::VPCMPESTRM128MEM:
22680 assert(Subtarget->hasSSE42() &&
22681 "Target must have SSE4.2 or AVX features enabled");
22682 return EmitPCMPSTRM(MI, BB, Subtarget->getInstrInfo());
22684 // String/text processing lowering.
22685 case X86::PCMPISTRIREG:
22686 case X86::VPCMPISTRIREG:
22687 case X86::PCMPISTRIMEM:
22688 case X86::VPCMPISTRIMEM:
22689 case X86::PCMPESTRIREG:
22690 case X86::VPCMPESTRIREG:
22691 case X86::PCMPESTRIMEM:
22692 case X86::VPCMPESTRIMEM:
22693 assert(Subtarget->hasSSE42() &&
22694 "Target must have SSE4.2 or AVX features enabled");
22695 return EmitPCMPSTRI(MI, BB, Subtarget->getInstrInfo());
22697 // Thread synchronization.
22699 return EmitMonitor(MI, BB, Subtarget);
22702 return EmitWRPKRU(MI, BB, Subtarget);
22704 return EmitRDPKRU(MI, BB, Subtarget);
22707 return EmitXBegin(MI, BB, Subtarget->getInstrInfo());
22709 case X86::VASTART_SAVE_XMM_REGS:
22710 return EmitVAStartSaveXMMRegsWithCustomInserter(MI, BB);
22712 case X86::VAARG_64:
22713 return EmitVAARG64WithCustomInserter(MI, BB);
22715 case X86::EH_SjLj_SetJmp32:
22716 case X86::EH_SjLj_SetJmp64:
22717 return emitEHSjLjSetJmp(MI, BB);
22719 case X86::EH_SjLj_LongJmp32:
22720 case X86::EH_SjLj_LongJmp64:
22721 return emitEHSjLjLongJmp(MI, BB);
22723 case TargetOpcode::STATEPOINT:
22724 // As an implementation detail, STATEPOINT shares the STACKMAP format at
22725 // this point in the process. We diverge later.
22726 return emitPatchPoint(MI, BB);
22728 case TargetOpcode::STACKMAP:
22729 case TargetOpcode::PATCHPOINT:
22730 return emitPatchPoint(MI, BB);
22732 case X86::VFMADDPDr213r:
22733 case X86::VFMADDPSr213r:
22734 case X86::VFMADDSDr213r:
22735 case X86::VFMADDSSr213r:
22736 case X86::VFMSUBPDr213r:
22737 case X86::VFMSUBPSr213r:
22738 case X86::VFMSUBSDr213r:
22739 case X86::VFMSUBSSr213r:
22740 case X86::VFNMADDPDr213r:
22741 case X86::VFNMADDPSr213r:
22742 case X86::VFNMADDSDr213r:
22743 case X86::VFNMADDSSr213r:
22744 case X86::VFNMSUBPDr213r:
22745 case X86::VFNMSUBPSr213r:
22746 case X86::VFNMSUBSDr213r:
22747 case X86::VFNMSUBSSr213r:
22748 case X86::VFMADDSUBPDr213r:
22749 case X86::VFMADDSUBPSr213r:
22750 case X86::VFMSUBADDPDr213r:
22751 case X86::VFMSUBADDPSr213r:
22752 case X86::VFMADDPDr213rY:
22753 case X86::VFMADDPSr213rY:
22754 case X86::VFMSUBPDr213rY:
22755 case X86::VFMSUBPSr213rY:
22756 case X86::VFNMADDPDr213rY:
22757 case X86::VFNMADDPSr213rY:
22758 case X86::VFNMSUBPDr213rY:
22759 case X86::VFNMSUBPSr213rY:
22760 case X86::VFMADDSUBPDr213rY:
22761 case X86::VFMADDSUBPSr213rY:
22762 case X86::VFMSUBADDPDr213rY:
22763 case X86::VFMSUBADDPSr213rY:
22764 return emitFMA3Instr(MI, BB);
22768 //===----------------------------------------------------------------------===//
22769 // X86 Optimization Hooks
22770 //===----------------------------------------------------------------------===//
22772 void X86TargetLowering::computeKnownBitsForTargetNode(const SDValue Op,
22775 const SelectionDAG &DAG,
22776 unsigned Depth) const {
22777 unsigned BitWidth = KnownZero.getBitWidth();
22778 unsigned Opc = Op.getOpcode();
22779 assert((Opc >= ISD::BUILTIN_OP_END ||
22780 Opc == ISD::INTRINSIC_WO_CHAIN ||
22781 Opc == ISD::INTRINSIC_W_CHAIN ||
22782 Opc == ISD::INTRINSIC_VOID) &&
22783 "Should use MaskedValueIsZero if you don't know whether Op"
22784 " is a target node!");
22786 KnownZero = KnownOne = APInt(BitWidth, 0); // Don't know anything.
22800 // These nodes' second result is a boolean.
22801 if (Op.getResNo() == 0)
22804 case X86ISD::SETCC:
22805 KnownZero |= APInt::getHighBitsSet(BitWidth, BitWidth - 1);
22807 case ISD::INTRINSIC_WO_CHAIN: {
22808 unsigned IntId = cast<ConstantSDNode>(Op.getOperand(0))->getZExtValue();
22809 unsigned NumLoBits = 0;
22812 case Intrinsic::x86_sse_movmsk_ps:
22813 case Intrinsic::x86_avx_movmsk_ps_256:
22814 case Intrinsic::x86_sse2_movmsk_pd:
22815 case Intrinsic::x86_avx_movmsk_pd_256:
22816 case Intrinsic::x86_mmx_pmovmskb:
22817 case Intrinsic::x86_sse2_pmovmskb_128:
22818 case Intrinsic::x86_avx2_pmovmskb: {
22819 // High bits of movmskp{s|d}, pmovmskb are known zero.
22821 default: llvm_unreachable("Impossible intrinsic"); // Can't reach here.
22822 case Intrinsic::x86_sse_movmsk_ps: NumLoBits = 4; break;
22823 case Intrinsic::x86_avx_movmsk_ps_256: NumLoBits = 8; break;
22824 case Intrinsic::x86_sse2_movmsk_pd: NumLoBits = 2; break;
22825 case Intrinsic::x86_avx_movmsk_pd_256: NumLoBits = 4; break;
22826 case Intrinsic::x86_mmx_pmovmskb: NumLoBits = 8; break;
22827 case Intrinsic::x86_sse2_pmovmskb_128: NumLoBits = 16; break;
22828 case Intrinsic::x86_avx2_pmovmskb: NumLoBits = 32; break;
22830 KnownZero = APInt::getHighBitsSet(BitWidth, BitWidth - NumLoBits);
22839 unsigned X86TargetLowering::ComputeNumSignBitsForTargetNode(
22841 const SelectionDAG &,
22842 unsigned Depth) const {
22843 // SETCC_CARRY sets the dest to ~0 for true or 0 for false.
22844 if (Op.getOpcode() == X86ISD::SETCC_CARRY)
22845 return Op.getValueType().getScalarSizeInBits();
22851 /// isGAPlusOffset - Returns true (and the GlobalValue and the offset) if the
22852 /// node is a GlobalAddress + offset.
22853 bool X86TargetLowering::isGAPlusOffset(SDNode *N,
22854 const GlobalValue* &GA,
22855 int64_t &Offset) const {
22856 if (N->getOpcode() == X86ISD::Wrapper) {
22857 if (isa<GlobalAddressSDNode>(N->getOperand(0))) {
22858 GA = cast<GlobalAddressSDNode>(N->getOperand(0))->getGlobal();
22859 Offset = cast<GlobalAddressSDNode>(N->getOperand(0))->getOffset();
22863 return TargetLowering::isGAPlusOffset(N, GA, Offset);
22866 /// PerformShuffleCombine256 - Performs shuffle combines for 256-bit vectors.
22867 /// FIXME: This could be expanded to support 512 bit vectors as well.
22868 static SDValue PerformShuffleCombine256(SDNode *N, SelectionDAG &DAG,
22869 TargetLowering::DAGCombinerInfo &DCI,
22870 const X86Subtarget* Subtarget) {
22872 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(N);
22873 SDValue V1 = SVOp->getOperand(0);
22874 SDValue V2 = SVOp->getOperand(1);
22875 MVT VT = SVOp->getSimpleValueType(0);
22876 unsigned NumElems = VT.getVectorNumElements();
22878 if (V1.getOpcode() == ISD::CONCAT_VECTORS &&
22879 V2.getOpcode() == ISD::CONCAT_VECTORS) {
22883 // V UNDEF BUILD_VECTOR UNDEF
22885 // CONCAT_VECTOR CONCAT_VECTOR
22888 // RESULT: V + zero extended
22890 if (V2.getOperand(0).getOpcode() != ISD::BUILD_VECTOR ||
22891 V2.getOperand(1).getOpcode() != ISD::UNDEF ||
22892 V1.getOperand(1).getOpcode() != ISD::UNDEF)
22895 if (!ISD::isBuildVectorAllZeros(V2.getOperand(0).getNode()))
22898 // To match the shuffle mask, the first half of the mask should
22899 // be exactly the first vector, and all the rest a splat with the
22900 // first element of the second one.
22901 for (unsigned i = 0; i != NumElems/2; ++i)
22902 if (!isUndefOrEqual(SVOp->getMaskElt(i), i) ||
22903 !isUndefOrEqual(SVOp->getMaskElt(i+NumElems/2), NumElems))
22906 // If V1 is coming from a vector load then just fold to a VZEXT_LOAD.
22907 if (LoadSDNode *Ld = dyn_cast<LoadSDNode>(V1.getOperand(0))) {
22908 if (Ld->hasNUsesOfValue(1, 0)) {
22909 SDVTList Tys = DAG.getVTList(MVT::v4i64, MVT::Other);
22910 SDValue Ops[] = { Ld->getChain(), Ld->getBasePtr() };
22912 DAG.getMemIntrinsicNode(X86ISD::VZEXT_LOAD, dl, Tys, Ops,
22914 Ld->getPointerInfo(),
22915 Ld->getAlignment(),
22916 false/*isVolatile*/, true/*ReadMem*/,
22917 false/*WriteMem*/);
22919 // Make sure the newly-created LOAD is in the same position as Ld in
22920 // terms of dependency. We create a TokenFactor for Ld and ResNode,
22921 // and update uses of Ld's output chain to use the TokenFactor.
22922 if (Ld->hasAnyUseOfValue(1)) {
22923 SDValue NewChain = DAG.getNode(ISD::TokenFactor, dl, MVT::Other,
22924 SDValue(Ld, 1), SDValue(ResNode.getNode(), 1));
22925 DAG.ReplaceAllUsesOfValueWith(SDValue(Ld, 1), NewChain);
22926 DAG.UpdateNodeOperands(NewChain.getNode(), SDValue(Ld, 1),
22927 SDValue(ResNode.getNode(), 1));
22930 return DAG.getBitcast(VT, ResNode);
22934 // Emit a zeroed vector and insert the desired subvector on its
22936 SDValue Zeros = getZeroVector(VT, Subtarget, DAG, dl);
22937 SDValue InsV = Insert128BitVector(Zeros, V1.getOperand(0), 0, DAG, dl);
22938 return DCI.CombineTo(N, InsV);
22944 /// \brief Combine an arbitrary chain of shuffles into a single instruction if
22947 /// This is the leaf of the recursive combinine below. When we have found some
22948 /// chain of single-use x86 shuffle instructions and accumulated the combined
22949 /// shuffle mask represented by them, this will try to pattern match that mask
22950 /// into either a single instruction if there is a special purpose instruction
22951 /// for this operation, or into a PSHUFB instruction which is a fully general
22952 /// instruction but should only be used to replace chains over a certain depth.
22953 static bool combineX86ShuffleChain(SDValue Op, SDValue Root, ArrayRef<int> Mask,
22954 int Depth, bool HasPSHUFB, SelectionDAG &DAG,
22955 TargetLowering::DAGCombinerInfo &DCI,
22956 const X86Subtarget *Subtarget) {
22957 assert(!Mask.empty() && "Cannot combine an empty shuffle mask!");
22959 // Find the operand that enters the chain. Note that multiple uses are OK
22960 // here, we're not going to remove the operand we find.
22961 SDValue Input = Op.getOperand(0);
22962 while (Input.getOpcode() == ISD::BITCAST)
22963 Input = Input.getOperand(0);
22965 MVT VT = Input.getSimpleValueType();
22966 MVT RootVT = Root.getSimpleValueType();
22969 if (Mask.size() == 1) {
22970 int Index = Mask[0];
22971 assert((Index >= 0 || Index == SM_SentinelUndef ||
22972 Index == SM_SentinelZero) &&
22973 "Invalid shuffle index found!");
22975 // We may end up with an accumulated mask of size 1 as a result of
22976 // widening of shuffle operands (see function canWidenShuffleElements).
22977 // If the only shuffle index is equal to SM_SentinelZero then propagate
22978 // a zero vector. Otherwise, the combine shuffle mask is a no-op shuffle
22979 // mask, and therefore the entire chain of shuffles can be folded away.
22980 if (Index == SM_SentinelZero)
22981 DCI.CombineTo(Root.getNode(), getZeroVector(RootVT, Subtarget, DAG, DL));
22983 DCI.CombineTo(Root.getNode(), DAG.getBitcast(RootVT, Input),
22988 // Use the float domain if the operand type is a floating point type.
22989 bool FloatDomain = VT.isFloatingPoint();
22991 // For floating point shuffles, we don't have free copies in the shuffle
22992 // instructions or the ability to load as part of the instruction, so
22993 // canonicalize their shuffles to UNPCK or MOV variants.
22995 // Note that even with AVX we prefer the PSHUFD form of shuffle for integer
22996 // vectors because it can have a load folded into it that UNPCK cannot. This
22997 // doesn't preclude something switching to the shorter encoding post-RA.
22999 // FIXME: Should teach these routines about AVX vector widths.
23000 if (FloatDomain && VT.is128BitVector()) {
23001 if (Mask.equals({0, 0}) || Mask.equals({1, 1})) {
23002 bool Lo = Mask.equals({0, 0});
23005 // Check if we have SSE3 which will let us use MOVDDUP. That instruction
23006 // is no slower than UNPCKLPD but has the option to fold the input operand
23007 // into even an unaligned memory load.
23008 if (Lo && Subtarget->hasSSE3()) {
23009 Shuffle = X86ISD::MOVDDUP;
23010 ShuffleVT = MVT::v2f64;
23012 // We have MOVLHPS and MOVHLPS throughout SSE and they encode smaller
23013 // than the UNPCK variants.
23014 Shuffle = Lo ? X86ISD::MOVLHPS : X86ISD::MOVHLPS;
23015 ShuffleVT = MVT::v4f32;
23017 if (Depth == 1 && Root->getOpcode() == Shuffle)
23018 return false; // Nothing to do!
23019 Op = DAG.getBitcast(ShuffleVT, Input);
23020 DCI.AddToWorklist(Op.getNode());
23021 if (Shuffle == X86ISD::MOVDDUP)
23022 Op = DAG.getNode(Shuffle, DL, ShuffleVT, Op);
23024 Op = DAG.getNode(Shuffle, DL, ShuffleVT, Op, Op);
23025 DCI.AddToWorklist(Op.getNode());
23026 DCI.CombineTo(Root.getNode(), DAG.getBitcast(RootVT, Op),
23030 if (Subtarget->hasSSE3() &&
23031 (Mask.equals({0, 0, 2, 2}) || Mask.equals({1, 1, 3, 3}))) {
23032 bool Lo = Mask.equals({0, 0, 2, 2});
23033 unsigned Shuffle = Lo ? X86ISD::MOVSLDUP : X86ISD::MOVSHDUP;
23034 MVT ShuffleVT = MVT::v4f32;
23035 if (Depth == 1 && Root->getOpcode() == Shuffle)
23036 return false; // Nothing to do!
23037 Op = DAG.getBitcast(ShuffleVT, Input);
23038 DCI.AddToWorklist(Op.getNode());
23039 Op = DAG.getNode(Shuffle, DL, ShuffleVT, Op);
23040 DCI.AddToWorklist(Op.getNode());
23041 DCI.CombineTo(Root.getNode(), DAG.getBitcast(RootVT, Op),
23045 if (Mask.equals({0, 0, 1, 1}) || Mask.equals({2, 2, 3, 3})) {
23046 bool Lo = Mask.equals({0, 0, 1, 1});
23047 unsigned Shuffle = Lo ? X86ISD::UNPCKL : X86ISD::UNPCKH;
23048 MVT ShuffleVT = MVT::v4f32;
23049 if (Depth == 1 && Root->getOpcode() == Shuffle)
23050 return false; // Nothing to do!
23051 Op = DAG.getBitcast(ShuffleVT, Input);
23052 DCI.AddToWorklist(Op.getNode());
23053 Op = DAG.getNode(Shuffle, DL, ShuffleVT, Op, Op);
23054 DCI.AddToWorklist(Op.getNode());
23055 DCI.CombineTo(Root.getNode(), DAG.getBitcast(RootVT, Op),
23061 // We always canonicalize the 8 x i16 and 16 x i8 shuffles into their UNPCK
23062 // variants as none of these have single-instruction variants that are
23063 // superior to the UNPCK formulation.
23064 if (!FloatDomain && VT.is128BitVector() &&
23065 (Mask.equals({0, 0, 1, 1, 2, 2, 3, 3}) ||
23066 Mask.equals({4, 4, 5, 5, 6, 6, 7, 7}) ||
23067 Mask.equals({0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7}) ||
23069 {8, 8, 9, 9, 10, 10, 11, 11, 12, 12, 13, 13, 14, 14, 15, 15}))) {
23070 bool Lo = Mask[0] == 0;
23071 unsigned Shuffle = Lo ? X86ISD::UNPCKL : X86ISD::UNPCKH;
23072 if (Depth == 1 && Root->getOpcode() == Shuffle)
23073 return false; // Nothing to do!
23075 switch (Mask.size()) {
23077 ShuffleVT = MVT::v8i16;
23080 ShuffleVT = MVT::v16i8;
23083 llvm_unreachable("Impossible mask size!");
23085 Op = DAG.getBitcast(ShuffleVT, Input);
23086 DCI.AddToWorklist(Op.getNode());
23087 Op = DAG.getNode(Shuffle, DL, ShuffleVT, Op, Op);
23088 DCI.AddToWorklist(Op.getNode());
23089 DCI.CombineTo(Root.getNode(), DAG.getBitcast(RootVT, Op),
23094 // Don't try to re-form single instruction chains under any circumstances now
23095 // that we've done encoding canonicalization for them.
23099 // If we have 3 or more shuffle instructions or a chain involving PSHUFB, we
23100 // can replace them with a single PSHUFB instruction profitably. Intel's
23101 // manuals suggest only using PSHUFB if doing so replacing 5 instructions, but
23102 // in practice PSHUFB tends to be *very* fast so we're more aggressive.
23103 if ((Depth >= 3 || HasPSHUFB) && Subtarget->hasSSSE3()) {
23104 SmallVector<SDValue, 16> PSHUFBMask;
23105 int NumBytes = VT.getSizeInBits() / 8;
23106 int Ratio = NumBytes / Mask.size();
23107 for (int i = 0; i < NumBytes; ++i) {
23108 if (Mask[i / Ratio] == SM_SentinelUndef) {
23109 PSHUFBMask.push_back(DAG.getUNDEF(MVT::i8));
23112 int M = Mask[i / Ratio] != SM_SentinelZero
23113 ? Ratio * Mask[i / Ratio] + i % Ratio
23115 PSHUFBMask.push_back(DAG.getConstant(M, DL, MVT::i8));
23117 MVT ByteVT = MVT::getVectorVT(MVT::i8, NumBytes);
23118 Op = DAG.getBitcast(ByteVT, Input);
23119 DCI.AddToWorklist(Op.getNode());
23120 SDValue PSHUFBMaskOp =
23121 DAG.getNode(ISD::BUILD_VECTOR, DL, ByteVT, PSHUFBMask);
23122 DCI.AddToWorklist(PSHUFBMaskOp.getNode());
23123 Op = DAG.getNode(X86ISD::PSHUFB, DL, ByteVT, Op, PSHUFBMaskOp);
23124 DCI.AddToWorklist(Op.getNode());
23125 DCI.CombineTo(Root.getNode(), DAG.getBitcast(RootVT, Op),
23130 // Failed to find any combines.
23134 /// \brief Fully generic combining of x86 shuffle instructions.
23136 /// This should be the last combine run over the x86 shuffle instructions. Once
23137 /// they have been fully optimized, this will recursively consider all chains
23138 /// of single-use shuffle instructions, build a generic model of the cumulative
23139 /// shuffle operation, and check for simpler instructions which implement this
23140 /// operation. We use this primarily for two purposes:
23142 /// 1) Collapse generic shuffles to specialized single instructions when
23143 /// equivalent. In most cases, this is just an encoding size win, but
23144 /// sometimes we will collapse multiple generic shuffles into a single
23145 /// special-purpose shuffle.
23146 /// 2) Look for sequences of shuffle instructions with 3 or more total
23147 /// instructions, and replace them with the slightly more expensive SSSE3
23148 /// PSHUFB instruction if available. We do this as the last combining step
23149 /// to ensure we avoid using PSHUFB if we can implement the shuffle with
23150 /// a suitable short sequence of other instructions. The PHUFB will either
23151 /// use a register or have to read from memory and so is slightly (but only
23152 /// slightly) more expensive than the other shuffle instructions.
23154 /// Because this is inherently a quadratic operation (for each shuffle in
23155 /// a chain, we recurse up the chain), the depth is limited to 8 instructions.
23156 /// This should never be an issue in practice as the shuffle lowering doesn't
23157 /// produce sequences of more than 8 instructions.
23159 /// FIXME: We will currently miss some cases where the redundant shuffling
23160 /// would simplify under the threshold for PSHUFB formation because of
23161 /// combine-ordering. To fix this, we should do the redundant instruction
23162 /// combining in this recursive walk.
23163 static bool combineX86ShufflesRecursively(SDValue Op, SDValue Root,
23164 ArrayRef<int> RootMask,
23165 int Depth, bool HasPSHUFB,
23167 TargetLowering::DAGCombinerInfo &DCI,
23168 const X86Subtarget *Subtarget) {
23169 // Bound the depth of our recursive combine because this is ultimately
23170 // quadratic in nature.
23174 // Directly rip through bitcasts to find the underlying operand.
23175 while (Op.getOpcode() == ISD::BITCAST && Op.getOperand(0).hasOneUse())
23176 Op = Op.getOperand(0);
23178 MVT VT = Op.getSimpleValueType();
23179 if (!VT.isVector())
23180 return false; // Bail if we hit a non-vector.
23182 assert(Root.getSimpleValueType().isVector() &&
23183 "Shuffles operate on vector types!");
23184 assert(VT.getSizeInBits() == Root.getSimpleValueType().getSizeInBits() &&
23185 "Can only combine shuffles of the same vector register size.");
23187 if (!isTargetShuffle(Op.getOpcode()))
23189 SmallVector<int, 16> OpMask;
23191 bool HaveMask = getTargetShuffleMask(Op.getNode(), VT, OpMask, IsUnary);
23192 // We only can combine unary shuffles which we can decode the mask for.
23193 if (!HaveMask || !IsUnary)
23196 assert(VT.getVectorNumElements() == OpMask.size() &&
23197 "Different mask size from vector size!");
23198 assert(((RootMask.size() > OpMask.size() &&
23199 RootMask.size() % OpMask.size() == 0) ||
23200 (OpMask.size() > RootMask.size() &&
23201 OpMask.size() % RootMask.size() == 0) ||
23202 OpMask.size() == RootMask.size()) &&
23203 "The smaller number of elements must divide the larger.");
23204 int RootRatio = std::max<int>(1, OpMask.size() / RootMask.size());
23205 int OpRatio = std::max<int>(1, RootMask.size() / OpMask.size());
23206 assert(((RootRatio == 1 && OpRatio == 1) ||
23207 (RootRatio == 1) != (OpRatio == 1)) &&
23208 "Must not have a ratio for both incoming and op masks!");
23210 SmallVector<int, 16> Mask;
23211 Mask.reserve(std::max(OpMask.size(), RootMask.size()));
23213 // Merge this shuffle operation's mask into our accumulated mask. Note that
23214 // this shuffle's mask will be the first applied to the input, followed by the
23215 // root mask to get us all the way to the root value arrangement. The reason
23216 // for this order is that we are recursing up the operation chain.
23217 for (int i = 0, e = std::max(OpMask.size(), RootMask.size()); i < e; ++i) {
23218 int RootIdx = i / RootRatio;
23219 if (RootMask[RootIdx] < 0) {
23220 // This is a zero or undef lane, we're done.
23221 Mask.push_back(RootMask[RootIdx]);
23225 int RootMaskedIdx = RootMask[RootIdx] * RootRatio + i % RootRatio;
23226 int OpIdx = RootMaskedIdx / OpRatio;
23227 if (OpMask[OpIdx] < 0) {
23228 // The incoming lanes are zero or undef, it doesn't matter which ones we
23230 Mask.push_back(OpMask[OpIdx]);
23234 // Ok, we have non-zero lanes, map them through.
23235 Mask.push_back(OpMask[OpIdx] * OpRatio +
23236 RootMaskedIdx % OpRatio);
23239 // See if we can recurse into the operand to combine more things.
23240 switch (Op.getOpcode()) {
23241 case X86ISD::PSHUFB:
23243 case X86ISD::PSHUFD:
23244 case X86ISD::PSHUFHW:
23245 case X86ISD::PSHUFLW:
23246 if (Op.getOperand(0).hasOneUse() &&
23247 combineX86ShufflesRecursively(Op.getOperand(0), Root, Mask, Depth + 1,
23248 HasPSHUFB, DAG, DCI, Subtarget))
23252 case X86ISD::UNPCKL:
23253 case X86ISD::UNPCKH:
23254 assert(Op.getOperand(0) == Op.getOperand(1) &&
23255 "We only combine unary shuffles!");
23256 // We can't check for single use, we have to check that this shuffle is the
23258 if (Op->isOnlyUserOf(Op.getOperand(0).getNode()) &&
23259 combineX86ShufflesRecursively(Op.getOperand(0), Root, Mask, Depth + 1,
23260 HasPSHUFB, DAG, DCI, Subtarget))
23265 // Minor canonicalization of the accumulated shuffle mask to make it easier
23266 // to match below. All this does is detect masks with squential pairs of
23267 // elements, and shrink them to the half-width mask. It does this in a loop
23268 // so it will reduce the size of the mask to the minimal width mask which
23269 // performs an equivalent shuffle.
23270 SmallVector<int, 16> WidenedMask;
23271 while (Mask.size() > 1 && canWidenShuffleElements(Mask, WidenedMask)) {
23272 Mask = std::move(WidenedMask);
23273 WidenedMask.clear();
23276 return combineX86ShuffleChain(Op, Root, Mask, Depth, HasPSHUFB, DAG, DCI,
23280 /// \brief Get the PSHUF-style mask from PSHUF node.
23282 /// This is a very minor wrapper around getTargetShuffleMask to easy forming v4
23283 /// PSHUF-style masks that can be reused with such instructions.
23284 static SmallVector<int, 4> getPSHUFShuffleMask(SDValue N) {
23285 MVT VT = N.getSimpleValueType();
23286 SmallVector<int, 4> Mask;
23288 bool HaveMask = getTargetShuffleMask(N.getNode(), VT, Mask, IsUnary);
23292 // If we have more than 128-bits, only the low 128-bits of shuffle mask
23293 // matter. Check that the upper masks are repeats and remove them.
23294 if (VT.getSizeInBits() > 128) {
23295 int LaneElts = 128 / VT.getScalarSizeInBits();
23297 for (int i = 1, NumLanes = VT.getSizeInBits() / 128; i < NumLanes; ++i)
23298 for (int j = 0; j < LaneElts; ++j)
23299 assert(Mask[j] == Mask[i * LaneElts + j] - (LaneElts * i) &&
23300 "Mask doesn't repeat in high 128-bit lanes!");
23302 Mask.resize(LaneElts);
23305 switch (N.getOpcode()) {
23306 case X86ISD::PSHUFD:
23308 case X86ISD::PSHUFLW:
23311 case X86ISD::PSHUFHW:
23312 Mask.erase(Mask.begin(), Mask.begin() + 4);
23313 for (int &M : Mask)
23317 llvm_unreachable("No valid shuffle instruction found!");
23321 /// \brief Search for a combinable shuffle across a chain ending in pshufd.
23323 /// We walk up the chain and look for a combinable shuffle, skipping over
23324 /// shuffles that we could hoist this shuffle's transformation past without
23325 /// altering anything.
23327 combineRedundantDWordShuffle(SDValue N, MutableArrayRef<int> Mask,
23329 TargetLowering::DAGCombinerInfo &DCI) {
23330 assert(N.getOpcode() == X86ISD::PSHUFD &&
23331 "Called with something other than an x86 128-bit half shuffle!");
23334 // Walk up a single-use chain looking for a combinable shuffle. Keep a stack
23335 // of the shuffles in the chain so that we can form a fresh chain to replace
23337 SmallVector<SDValue, 8> Chain;
23338 SDValue V = N.getOperand(0);
23339 for (; V.hasOneUse(); V = V.getOperand(0)) {
23340 switch (V.getOpcode()) {
23342 return SDValue(); // Nothing combined!
23345 // Skip bitcasts as we always know the type for the target specific
23349 case X86ISD::PSHUFD:
23350 // Found another dword shuffle.
23353 case X86ISD::PSHUFLW:
23354 // Check that the low words (being shuffled) are the identity in the
23355 // dword shuffle, and the high words are self-contained.
23356 if (Mask[0] != 0 || Mask[1] != 1 ||
23357 !(Mask[2] >= 2 && Mask[2] < 4 && Mask[3] >= 2 && Mask[3] < 4))
23360 Chain.push_back(V);
23363 case X86ISD::PSHUFHW:
23364 // Check that the high words (being shuffled) are the identity in the
23365 // dword shuffle, and the low words are self-contained.
23366 if (Mask[2] != 2 || Mask[3] != 3 ||
23367 !(Mask[0] >= 0 && Mask[0] < 2 && Mask[1] >= 0 && Mask[1] < 2))
23370 Chain.push_back(V);
23373 case X86ISD::UNPCKL:
23374 case X86ISD::UNPCKH:
23375 // For either i8 -> i16 or i16 -> i32 unpacks, we can combine a dword
23376 // shuffle into a preceding word shuffle.
23377 if (V.getSimpleValueType().getVectorElementType() != MVT::i8 &&
23378 V.getSimpleValueType().getVectorElementType() != MVT::i16)
23381 // Search for a half-shuffle which we can combine with.
23382 unsigned CombineOp =
23383 V.getOpcode() == X86ISD::UNPCKL ? X86ISD::PSHUFLW : X86ISD::PSHUFHW;
23384 if (V.getOperand(0) != V.getOperand(1) ||
23385 !V->isOnlyUserOf(V.getOperand(0).getNode()))
23387 Chain.push_back(V);
23388 V = V.getOperand(0);
23390 switch (V.getOpcode()) {
23392 return SDValue(); // Nothing to combine.
23394 case X86ISD::PSHUFLW:
23395 case X86ISD::PSHUFHW:
23396 if (V.getOpcode() == CombineOp)
23399 Chain.push_back(V);
23403 V = V.getOperand(0);
23407 } while (V.hasOneUse());
23410 // Break out of the loop if we break out of the switch.
23414 if (!V.hasOneUse())
23415 // We fell out of the loop without finding a viable combining instruction.
23418 // Merge this node's mask and our incoming mask.
23419 SmallVector<int, 4> VMask = getPSHUFShuffleMask(V);
23420 for (int &M : Mask)
23422 V = DAG.getNode(V.getOpcode(), DL, V.getValueType(), V.getOperand(0),
23423 getV4X86ShuffleImm8ForMask(Mask, DL, DAG));
23425 // Rebuild the chain around this new shuffle.
23426 while (!Chain.empty()) {
23427 SDValue W = Chain.pop_back_val();
23429 if (V.getValueType() != W.getOperand(0).getValueType())
23430 V = DAG.getBitcast(W.getOperand(0).getValueType(), V);
23432 switch (W.getOpcode()) {
23434 llvm_unreachable("Only PSHUF and UNPCK instructions get here!");
23436 case X86ISD::UNPCKL:
23437 case X86ISD::UNPCKH:
23438 V = DAG.getNode(W.getOpcode(), DL, W.getValueType(), V, V);
23441 case X86ISD::PSHUFD:
23442 case X86ISD::PSHUFLW:
23443 case X86ISD::PSHUFHW:
23444 V = DAG.getNode(W.getOpcode(), DL, W.getValueType(), V, W.getOperand(1));
23448 if (V.getValueType() != N.getValueType())
23449 V = DAG.getBitcast(N.getValueType(), V);
23451 // Return the new chain to replace N.
23455 /// \brief Search for a combinable shuffle across a chain ending in pshuflw or
23458 /// We walk up the chain, skipping shuffles of the other half and looking
23459 /// through shuffles which switch halves trying to find a shuffle of the same
23460 /// pair of dwords.
23461 static bool combineRedundantHalfShuffle(SDValue N, MutableArrayRef<int> Mask,
23463 TargetLowering::DAGCombinerInfo &DCI) {
23465 (N.getOpcode() == X86ISD::PSHUFLW || N.getOpcode() == X86ISD::PSHUFHW) &&
23466 "Called with something other than an x86 128-bit half shuffle!");
23468 unsigned CombineOpcode = N.getOpcode();
23470 // Walk up a single-use chain looking for a combinable shuffle.
23471 SDValue V = N.getOperand(0);
23472 for (; V.hasOneUse(); V = V.getOperand(0)) {
23473 switch (V.getOpcode()) {
23475 return false; // Nothing combined!
23478 // Skip bitcasts as we always know the type for the target specific
23482 case X86ISD::PSHUFLW:
23483 case X86ISD::PSHUFHW:
23484 if (V.getOpcode() == CombineOpcode)
23487 // Other-half shuffles are no-ops.
23490 // Break out of the loop if we break out of the switch.
23494 if (!V.hasOneUse())
23495 // We fell out of the loop without finding a viable combining instruction.
23498 // Combine away the bottom node as its shuffle will be accumulated into
23499 // a preceding shuffle.
23500 DCI.CombineTo(N.getNode(), N.getOperand(0), /*AddTo*/ true);
23502 // Record the old value.
23505 // Merge this node's mask and our incoming mask (adjusted to account for all
23506 // the pshufd instructions encountered).
23507 SmallVector<int, 4> VMask = getPSHUFShuffleMask(V);
23508 for (int &M : Mask)
23510 V = DAG.getNode(V.getOpcode(), DL, MVT::v8i16, V.getOperand(0),
23511 getV4X86ShuffleImm8ForMask(Mask, DL, DAG));
23513 // Check that the shuffles didn't cancel each other out. If not, we need to
23514 // combine to the new one.
23516 // Replace the combinable shuffle with the combined one, updating all users
23517 // so that we re-evaluate the chain here.
23518 DCI.CombineTo(Old.getNode(), V, /*AddTo*/ true);
23523 /// \brief Try to combine x86 target specific shuffles.
23524 static SDValue PerformTargetShuffleCombine(SDValue N, SelectionDAG &DAG,
23525 TargetLowering::DAGCombinerInfo &DCI,
23526 const X86Subtarget *Subtarget) {
23528 MVT VT = N.getSimpleValueType();
23529 SmallVector<int, 4> Mask;
23531 switch (N.getOpcode()) {
23532 case X86ISD::PSHUFD:
23533 case X86ISD::PSHUFLW:
23534 case X86ISD::PSHUFHW:
23535 Mask = getPSHUFShuffleMask(N);
23536 assert(Mask.size() == 4);
23538 case X86ISD::UNPCKL: {
23539 // Combine X86ISD::UNPCKL and ISD::VECTOR_SHUFFLE into X86ISD::UNPCKH, in
23540 // which X86ISD::UNPCKL has a ISD::UNDEF operand, and ISD::VECTOR_SHUFFLE
23541 // moves upper half elements into the lower half part. For example:
23543 // t2: v16i8 = vector_shuffle<8,9,10,11,12,13,14,15,u,u,u,u,u,u,u,u> t1,
23545 // t3: v16i8 = X86ISD::UNPCKL undef:v16i8, t2
23547 // will be combined to:
23549 // t3: v16i8 = X86ISD::UNPCKH undef:v16i8, t1
23551 // This is only for 128-bit vectors. From SSE4.1 onward this combine may not
23552 // happen due to advanced instructions.
23553 if (!VT.is128BitVector())
23556 auto Op0 = N.getOperand(0);
23557 auto Op1 = N.getOperand(1);
23558 if (Op0.getOpcode() == ISD::UNDEF &&
23559 Op1.getNode()->getOpcode() == ISD::VECTOR_SHUFFLE) {
23560 ArrayRef<int> Mask = cast<ShuffleVectorSDNode>(Op1.getNode())->getMask();
23562 unsigned NumElts = VT.getVectorNumElements();
23563 SmallVector<int, 8> ExpectedMask(NumElts, -1);
23564 std::iota(ExpectedMask.begin(), ExpectedMask.begin() + NumElts / 2,
23567 auto ShufOp = Op1.getOperand(0);
23568 if (isShuffleEquivalent(Op1, ShufOp, Mask, ExpectedMask))
23569 return DAG.getNode(X86ISD::UNPCKH, DL, VT, N.getOperand(0), ShufOp);
23573 case X86ISD::BLENDI: {
23574 SDValue V0 = N->getOperand(0);
23575 SDValue V1 = N->getOperand(1);
23576 assert(VT == V0.getSimpleValueType() && VT == V1.getSimpleValueType() &&
23577 "Unexpected input vector types");
23579 // Canonicalize a v2f64 blend with a mask of 2 by swapping the vector
23580 // operands and changing the mask to 1. This saves us a bunch of
23581 // pattern-matching possibilities related to scalar math ops in SSE/AVX.
23582 // x86InstrInfo knows how to commute this back after instruction selection
23583 // if it would help register allocation.
23585 // TODO: If optimizing for size or a processor that doesn't suffer from
23586 // partial register update stalls, this should be transformed into a MOVSD
23587 // instruction because a MOVSD is 1-2 bytes smaller than a BLENDPD.
23589 if (VT == MVT::v2f64)
23590 if (auto *Mask = dyn_cast<ConstantSDNode>(N->getOperand(2)))
23591 if (Mask->getZExtValue() == 2 && !isShuffleFoldableLoad(V0)) {
23592 SDValue NewMask = DAG.getConstant(1, DL, MVT::i8);
23593 return DAG.getNode(X86ISD::BLENDI, DL, VT, V1, V0, NewMask);
23602 // Nuke no-op shuffles that show up after combining.
23603 if (isNoopShuffleMask(Mask))
23604 return DCI.CombineTo(N.getNode(), N.getOperand(0), /*AddTo*/ true);
23606 // Look for simplifications involving one or two shuffle instructions.
23607 SDValue V = N.getOperand(0);
23608 switch (N.getOpcode()) {
23611 case X86ISD::PSHUFLW:
23612 case X86ISD::PSHUFHW:
23613 assert(VT.getVectorElementType() == MVT::i16 && "Bad word shuffle type!");
23615 if (combineRedundantHalfShuffle(N, Mask, DAG, DCI))
23616 return SDValue(); // We combined away this shuffle, so we're done.
23618 // See if this reduces to a PSHUFD which is no more expensive and can
23619 // combine with more operations. Note that it has to at least flip the
23620 // dwords as otherwise it would have been removed as a no-op.
23621 if (makeArrayRef(Mask).equals({2, 3, 0, 1})) {
23622 int DMask[] = {0, 1, 2, 3};
23623 int DOffset = N.getOpcode() == X86ISD::PSHUFLW ? 0 : 2;
23624 DMask[DOffset + 0] = DOffset + 1;
23625 DMask[DOffset + 1] = DOffset + 0;
23626 MVT DVT = MVT::getVectorVT(MVT::i32, VT.getVectorNumElements() / 2);
23627 V = DAG.getBitcast(DVT, V);
23628 DCI.AddToWorklist(V.getNode());
23629 V = DAG.getNode(X86ISD::PSHUFD, DL, DVT, V,
23630 getV4X86ShuffleImm8ForMask(DMask, DL, DAG));
23631 DCI.AddToWorklist(V.getNode());
23632 return DAG.getBitcast(VT, V);
23635 // Look for shuffle patterns which can be implemented as a single unpack.
23636 // FIXME: This doesn't handle the location of the PSHUFD generically, and
23637 // only works when we have a PSHUFD followed by two half-shuffles.
23638 if (Mask[0] == Mask[1] && Mask[2] == Mask[3] &&
23639 (V.getOpcode() == X86ISD::PSHUFLW ||
23640 V.getOpcode() == X86ISD::PSHUFHW) &&
23641 V.getOpcode() != N.getOpcode() &&
23643 SDValue D = V.getOperand(0);
23644 while (D.getOpcode() == ISD::BITCAST && D.hasOneUse())
23645 D = D.getOperand(0);
23646 if (D.getOpcode() == X86ISD::PSHUFD && D.hasOneUse()) {
23647 SmallVector<int, 4> VMask = getPSHUFShuffleMask(V);
23648 SmallVector<int, 4> DMask = getPSHUFShuffleMask(D);
23649 int NOffset = N.getOpcode() == X86ISD::PSHUFLW ? 0 : 4;
23650 int VOffset = V.getOpcode() == X86ISD::PSHUFLW ? 0 : 4;
23652 for (int i = 0; i < 4; ++i) {
23653 WordMask[i + NOffset] = Mask[i] + NOffset;
23654 WordMask[i + VOffset] = VMask[i] + VOffset;
23656 // Map the word mask through the DWord mask.
23658 for (int i = 0; i < 8; ++i)
23659 MappedMask[i] = 2 * DMask[WordMask[i] / 2] + WordMask[i] % 2;
23660 if (makeArrayRef(MappedMask).equals({0, 0, 1, 1, 2, 2, 3, 3}) ||
23661 makeArrayRef(MappedMask).equals({4, 4, 5, 5, 6, 6, 7, 7})) {
23662 // We can replace all three shuffles with an unpack.
23663 V = DAG.getBitcast(VT, D.getOperand(0));
23664 DCI.AddToWorklist(V.getNode());
23665 return DAG.getNode(MappedMask[0] == 0 ? X86ISD::UNPCKL
23674 case X86ISD::PSHUFD:
23675 if (SDValue NewN = combineRedundantDWordShuffle(N, Mask, DAG, DCI))
23684 /// \brief Try to combine a shuffle into a target-specific add-sub node.
23686 /// We combine this directly on the abstract vector shuffle nodes so it is
23687 /// easier to generically match. We also insert dummy vector shuffle nodes for
23688 /// the operands which explicitly discard the lanes which are unused by this
23689 /// operation to try to flow through the rest of the combiner the fact that
23690 /// they're unused.
23691 static SDValue combineShuffleToAddSub(SDNode *N, const X86Subtarget *Subtarget,
23692 SelectionDAG &DAG) {
23694 EVT VT = N->getValueType(0);
23695 if ((!Subtarget->hasSSE3() || (VT != MVT::v4f32 && VT != MVT::v2f64)) &&
23696 (!Subtarget->hasAVX() || (VT != MVT::v8f32 && VT != MVT::v4f64)))
23699 // We only handle target-independent shuffles.
23700 // FIXME: It would be easy and harmless to use the target shuffle mask
23701 // extraction tool to support more.
23702 if (N->getOpcode() != ISD::VECTOR_SHUFFLE)
23705 auto *SVN = cast<ShuffleVectorSDNode>(N);
23706 SmallVector<int, 8> Mask;
23707 for (int M : SVN->getMask())
23710 SDValue V1 = N->getOperand(0);
23711 SDValue V2 = N->getOperand(1);
23713 // We require the first shuffle operand to be the FSUB node, and the second to
23714 // be the FADD node.
23715 if (V1.getOpcode() == ISD::FADD && V2.getOpcode() == ISD::FSUB) {
23716 ShuffleVectorSDNode::commuteMask(Mask);
23718 } else if (V1.getOpcode() != ISD::FSUB || V2.getOpcode() != ISD::FADD)
23721 // If there are other uses of these operations we can't fold them.
23722 if (!V1->hasOneUse() || !V2->hasOneUse())
23725 // Ensure that both operations have the same operands. Note that we can
23726 // commute the FADD operands.
23727 SDValue LHS = V1->getOperand(0), RHS = V1->getOperand(1);
23728 if ((V2->getOperand(0) != LHS || V2->getOperand(1) != RHS) &&
23729 (V2->getOperand(0) != RHS || V2->getOperand(1) != LHS))
23732 // We're looking for blends between FADD and FSUB nodes. We insist on these
23733 // nodes being lined up in a specific expected pattern.
23734 if (!(isShuffleEquivalent(V1, V2, Mask, {0, 3}) ||
23735 isShuffleEquivalent(V1, V2, Mask, {0, 5, 2, 7}) ||
23736 isShuffleEquivalent(V1, V2, Mask, {0, 9, 2, 11, 4, 13, 6, 15})))
23739 return DAG.getNode(X86ISD::ADDSUB, DL, VT, LHS, RHS);
23742 /// PerformShuffleCombine - Performs several different shuffle combines.
23743 static SDValue PerformShuffleCombine(SDNode *N, SelectionDAG &DAG,
23744 TargetLowering::DAGCombinerInfo &DCI,
23745 const X86Subtarget *Subtarget) {
23747 SDValue N0 = N->getOperand(0);
23748 SDValue N1 = N->getOperand(1);
23749 EVT VT = N->getValueType(0);
23751 // Don't create instructions with illegal types after legalize types has run.
23752 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
23753 if (!DCI.isBeforeLegalize() && !TLI.isTypeLegal(VT.getVectorElementType()))
23756 // If we have legalized the vector types, look for blends of FADD and FSUB
23757 // nodes that we can fuse into an ADDSUB node.
23758 if (TLI.isTypeLegal(VT))
23759 if (SDValue AddSub = combineShuffleToAddSub(N, Subtarget, DAG))
23762 // Combine 256-bit vector shuffles. This is only profitable when in AVX mode
23763 if (TLI.isTypeLegal(VT) && Subtarget->hasFp256() && VT.is256BitVector() &&
23764 N->getOpcode() == ISD::VECTOR_SHUFFLE)
23765 return PerformShuffleCombine256(N, DAG, DCI, Subtarget);
23767 // During Type Legalization, when promoting illegal vector types,
23768 // the backend might introduce new shuffle dag nodes and bitcasts.
23770 // This code performs the following transformation:
23771 // fold: (shuffle (bitcast (BINOP A, B)), Undef, <Mask>) ->
23772 // (shuffle (BINOP (bitcast A), (bitcast B)), Undef, <Mask>)
23774 // We do this only if both the bitcast and the BINOP dag nodes have
23775 // one use. Also, perform this transformation only if the new binary
23776 // operation is legal. This is to avoid introducing dag nodes that
23777 // potentially need to be further expanded (or custom lowered) into a
23778 // less optimal sequence of dag nodes.
23779 if (!DCI.isBeforeLegalize() && DCI.isBeforeLegalizeOps() &&
23780 N1.getOpcode() == ISD::UNDEF && N0.hasOneUse() &&
23781 N0.getOpcode() == ISD::BITCAST) {
23782 SDValue BC0 = N0.getOperand(0);
23783 EVT SVT = BC0.getValueType();
23784 unsigned Opcode = BC0.getOpcode();
23785 unsigned NumElts = VT.getVectorNumElements();
23787 if (BC0.hasOneUse() && SVT.isVector() &&
23788 SVT.getVectorNumElements() * 2 == NumElts &&
23789 TLI.isOperationLegal(Opcode, VT)) {
23790 bool CanFold = false;
23802 unsigned SVTNumElts = SVT.getVectorNumElements();
23803 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(N);
23804 for (unsigned i = 0, e = SVTNumElts; i != e && CanFold; ++i)
23805 CanFold = SVOp->getMaskElt(i) == (int)(i * 2);
23806 for (unsigned i = SVTNumElts, e = NumElts; i != e && CanFold; ++i)
23807 CanFold = SVOp->getMaskElt(i) < 0;
23810 SDValue BC00 = DAG.getBitcast(VT, BC0.getOperand(0));
23811 SDValue BC01 = DAG.getBitcast(VT, BC0.getOperand(1));
23812 SDValue NewBinOp = DAG.getNode(BC0.getOpcode(), dl, VT, BC00, BC01);
23813 return DAG.getVectorShuffle(VT, dl, NewBinOp, N1, &SVOp->getMask()[0]);
23818 // Combine a vector_shuffle that is equal to build_vector load1, load2, load3,
23819 // load4, <0, 1, 2, 3> into a 128-bit load if the load addresses are
23820 // consecutive, non-overlapping, and in the right order.
23821 SmallVector<SDValue, 16> Elts;
23822 for (unsigned i = 0, e = VT.getVectorNumElements(); i != e; ++i)
23823 Elts.push_back(getShuffleScalarElt(N, i, DAG, 0));
23825 if (SDValue LD = EltsFromConsecutiveLoads(VT, Elts, dl, DAG, true))
23828 if (isTargetShuffle(N->getOpcode())) {
23830 PerformTargetShuffleCombine(SDValue(N, 0), DAG, DCI, Subtarget);
23831 if (Shuffle.getNode())
23834 // Try recursively combining arbitrary sequences of x86 shuffle
23835 // instructions into higher-order shuffles. We do this after combining
23836 // specific PSHUF instruction sequences into their minimal form so that we
23837 // can evaluate how many specialized shuffle instructions are involved in
23838 // a particular chain.
23839 SmallVector<int, 1> NonceMask; // Just a placeholder.
23840 NonceMask.push_back(0);
23841 if (combineX86ShufflesRecursively(SDValue(N, 0), SDValue(N, 0), NonceMask,
23842 /*Depth*/ 1, /*HasPSHUFB*/ false, DAG,
23844 return SDValue(); // This routine will use CombineTo to replace N.
23850 /// XFormVExtractWithShuffleIntoLoad - Check if a vector extract from a target
23851 /// specific shuffle of a load can be folded into a single element load.
23852 /// Similar handling for VECTOR_SHUFFLE is performed by DAGCombiner, but
23853 /// shuffles have been custom lowered so we need to handle those here.
23854 static SDValue XFormVExtractWithShuffleIntoLoad(SDNode *N, SelectionDAG &DAG,
23855 TargetLowering::DAGCombinerInfo &DCI) {
23856 if (DCI.isBeforeLegalizeOps())
23859 SDValue InVec = N->getOperand(0);
23860 SDValue EltNo = N->getOperand(1);
23862 if (!isa<ConstantSDNode>(EltNo))
23865 EVT OriginalVT = InVec.getValueType();
23867 if (InVec.getOpcode() == ISD::BITCAST) {
23868 // Don't duplicate a load with other uses.
23869 if (!InVec.hasOneUse())
23871 EVT BCVT = InVec.getOperand(0).getValueType();
23872 if (!BCVT.isVector() ||
23873 BCVT.getVectorNumElements() != OriginalVT.getVectorNumElements())
23875 InVec = InVec.getOperand(0);
23878 EVT CurrentVT = InVec.getValueType();
23880 if (!isTargetShuffle(InVec.getOpcode()))
23883 // Don't duplicate a load with other uses.
23884 if (!InVec.hasOneUse())
23887 SmallVector<int, 16> ShuffleMask;
23889 if (!getTargetShuffleMask(InVec.getNode(), CurrentVT.getSimpleVT(),
23890 ShuffleMask, UnaryShuffle))
23893 // Select the input vector, guarding against out of range extract vector.
23894 unsigned NumElems = CurrentVT.getVectorNumElements();
23895 int Elt = cast<ConstantSDNode>(EltNo)->getZExtValue();
23896 int Idx = (Elt > (int)NumElems) ? -1 : ShuffleMask[Elt];
23897 SDValue LdNode = (Idx < (int)NumElems) ? InVec.getOperand(0)
23898 : InVec.getOperand(1);
23900 // If inputs to shuffle are the same for both ops, then allow 2 uses
23901 unsigned AllowedUses = InVec.getNumOperands() > 1 &&
23902 InVec.getOperand(0) == InVec.getOperand(1) ? 2 : 1;
23904 if (LdNode.getOpcode() == ISD::BITCAST) {
23905 // Don't duplicate a load with other uses.
23906 if (!LdNode.getNode()->hasNUsesOfValue(AllowedUses, 0))
23909 AllowedUses = 1; // only allow 1 load use if we have a bitcast
23910 LdNode = LdNode.getOperand(0);
23913 if (!ISD::isNormalLoad(LdNode.getNode()))
23916 LoadSDNode *LN0 = cast<LoadSDNode>(LdNode);
23918 if (!LN0 ||!LN0->hasNUsesOfValue(AllowedUses, 0) || LN0->isVolatile())
23921 EVT EltVT = N->getValueType(0);
23922 // If there's a bitcast before the shuffle, check if the load type and
23923 // alignment is valid.
23924 unsigned Align = LN0->getAlignment();
23925 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
23926 unsigned NewAlign = DAG.getDataLayout().getABITypeAlignment(
23927 EltVT.getTypeForEVT(*DAG.getContext()));
23929 if (NewAlign > Align || !TLI.isOperationLegalOrCustom(ISD::LOAD, EltVT))
23932 // All checks match so transform back to vector_shuffle so that DAG combiner
23933 // can finish the job
23936 // Create shuffle node taking into account the case that its a unary shuffle
23937 SDValue Shuffle = (UnaryShuffle) ? DAG.getUNDEF(CurrentVT)
23938 : InVec.getOperand(1);
23939 Shuffle = DAG.getVectorShuffle(CurrentVT, dl,
23940 InVec.getOperand(0), Shuffle,
23942 Shuffle = DAG.getBitcast(OriginalVT, Shuffle);
23943 return DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, N->getValueType(0), Shuffle,
23947 static SDValue PerformBITCASTCombine(SDNode *N, SelectionDAG &DAG,
23948 const X86Subtarget *Subtarget) {
23949 SDValue N0 = N->getOperand(0);
23950 EVT VT = N->getValueType(0);
23952 // Detect bitcasts between i32 to x86mmx low word. Since MMX types are
23953 // special and don't usually play with other vector types, it's better to
23954 // handle them early to be sure we emit efficient code by avoiding
23955 // store-load conversions.
23956 if (VT == MVT::x86mmx && N0.getOpcode() == ISD::BUILD_VECTOR &&
23957 N0.getValueType() == MVT::v2i32 &&
23958 isNullConstant(N0.getOperand(1))) {
23959 SDValue N00 = N0->getOperand(0);
23960 if (N00.getValueType() == MVT::i32)
23961 return DAG.getNode(X86ISD::MMX_MOVW2D, SDLoc(N00), VT, N00);
23964 // Convert a bitcasted integer logic operation that has one bitcasted
23965 // floating-point operand and one constant operand into a floating-point
23966 // logic operation. This may create a load of the constant, but that is
23967 // cheaper than materializing the constant in an integer register and
23968 // transferring it to an SSE register or transferring the SSE operand to
23969 // integer register and back.
23971 switch (N0.getOpcode()) {
23972 case ISD::AND: FPOpcode = X86ISD::FAND; break;
23973 case ISD::OR: FPOpcode = X86ISD::FOR; break;
23974 case ISD::XOR: FPOpcode = X86ISD::FXOR; break;
23975 default: return SDValue();
23977 if (((Subtarget->hasSSE1() && VT == MVT::f32) ||
23978 (Subtarget->hasSSE2() && VT == MVT::f64)) &&
23979 isa<ConstantSDNode>(N0.getOperand(1)) &&
23980 N0.getOperand(0).getOpcode() == ISD::BITCAST &&
23981 N0.getOperand(0).getOperand(0).getValueType() == VT) {
23982 SDValue N000 = N0.getOperand(0).getOperand(0);
23983 SDValue FPConst = DAG.getBitcast(VT, N0.getOperand(1));
23984 return DAG.getNode(FPOpcode, SDLoc(N0), VT, N000, FPConst);
23990 /// PerformEXTRACT_VECTOR_ELTCombine - Detect vector gather/scatter index
23991 /// generation and convert it from being a bunch of shuffles and extracts
23992 /// into a somewhat faster sequence. For i686, the best sequence is apparently
23993 /// storing the value and loading scalars back, while for x64 we should
23994 /// use 64-bit extracts and shifts.
23995 static SDValue PerformEXTRACT_VECTOR_ELTCombine(SDNode *N, SelectionDAG &DAG,
23996 TargetLowering::DAGCombinerInfo &DCI) {
23997 if (SDValue NewOp = XFormVExtractWithShuffleIntoLoad(N, DAG, DCI))
24000 SDValue InputVector = N->getOperand(0);
24001 SDLoc dl(InputVector);
24002 // Detect mmx to i32 conversion through a v2i32 elt extract.
24003 if (InputVector.getOpcode() == ISD::BITCAST && InputVector.hasOneUse() &&
24004 N->getValueType(0) == MVT::i32 &&
24005 InputVector.getValueType() == MVT::v2i32) {
24007 // The bitcast source is a direct mmx result.
24008 SDValue MMXSrc = InputVector.getNode()->getOperand(0);
24009 if (MMXSrc.getValueType() == MVT::x86mmx)
24010 return DAG.getNode(X86ISD::MMX_MOVD2W, SDLoc(InputVector),
24011 N->getValueType(0),
24012 InputVector.getNode()->getOperand(0));
24014 // The mmx is indirect: (i64 extract_elt (v1i64 bitcast (x86mmx ...))).
24015 if (MMXSrc.getOpcode() == ISD::EXTRACT_VECTOR_ELT && MMXSrc.hasOneUse() &&
24016 MMXSrc.getValueType() == MVT::i64) {
24017 SDValue MMXSrcOp = MMXSrc.getOperand(0);
24018 if (MMXSrcOp.hasOneUse() && MMXSrcOp.getOpcode() == ISD::BITCAST &&
24019 MMXSrcOp.getValueType() == MVT::v1i64 &&
24020 MMXSrcOp.getOperand(0).getValueType() == MVT::x86mmx)
24021 return DAG.getNode(X86ISD::MMX_MOVD2W, SDLoc(InputVector),
24022 N->getValueType(0), MMXSrcOp.getOperand(0));
24026 EVT VT = N->getValueType(0);
24028 if (VT == MVT::i1 && isa<ConstantSDNode>(N->getOperand(1)) &&
24029 InputVector.getOpcode() == ISD::BITCAST &&
24030 isa<ConstantSDNode>(InputVector.getOperand(0))) {
24031 uint64_t ExtractedElt =
24032 cast<ConstantSDNode>(N->getOperand(1))->getZExtValue();
24033 uint64_t InputValue =
24034 cast<ConstantSDNode>(InputVector.getOperand(0))->getZExtValue();
24035 uint64_t Res = (InputValue >> ExtractedElt) & 1;
24036 return DAG.getConstant(Res, dl, MVT::i1);
24038 // Only operate on vectors of 4 elements, where the alternative shuffling
24039 // gets to be more expensive.
24040 if (InputVector.getValueType() != MVT::v4i32)
24043 // Check whether every use of InputVector is an EXTRACT_VECTOR_ELT with a
24044 // single use which is a sign-extend or zero-extend, and all elements are
24046 SmallVector<SDNode *, 4> Uses;
24047 unsigned ExtractedElements = 0;
24048 for (SDNode::use_iterator UI = InputVector.getNode()->use_begin(),
24049 UE = InputVector.getNode()->use_end(); UI != UE; ++UI) {
24050 if (UI.getUse().getResNo() != InputVector.getResNo())
24053 SDNode *Extract = *UI;
24054 if (Extract->getOpcode() != ISD::EXTRACT_VECTOR_ELT)
24057 if (Extract->getValueType(0) != MVT::i32)
24059 if (!Extract->hasOneUse())
24061 if (Extract->use_begin()->getOpcode() != ISD::SIGN_EXTEND &&
24062 Extract->use_begin()->getOpcode() != ISD::ZERO_EXTEND)
24064 if (!isa<ConstantSDNode>(Extract->getOperand(1)))
24067 // Record which element was extracted.
24068 ExtractedElements |=
24069 1 << cast<ConstantSDNode>(Extract->getOperand(1))->getZExtValue();
24071 Uses.push_back(Extract);
24074 // If not all the elements were used, this may not be worthwhile.
24075 if (ExtractedElements != 15)
24078 // Ok, we've now decided to do the transformation.
24079 // If 64-bit shifts are legal, use the extract-shift sequence,
24080 // otherwise bounce the vector off the cache.
24081 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
24084 if (TLI.isOperationLegal(ISD::SRA, MVT::i64)) {
24085 SDValue Cst = DAG.getBitcast(MVT::v2i64, InputVector);
24086 auto &DL = DAG.getDataLayout();
24087 EVT VecIdxTy = DAG.getTargetLoweringInfo().getVectorIdxTy(DL);
24088 SDValue BottomHalf = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::i64, Cst,
24089 DAG.getConstant(0, dl, VecIdxTy));
24090 SDValue TopHalf = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::i64, Cst,
24091 DAG.getConstant(1, dl, VecIdxTy));
24093 SDValue ShAmt = DAG.getConstant(
24094 32, dl, DAG.getTargetLoweringInfo().getShiftAmountTy(MVT::i64, DL));
24095 Vals[0] = DAG.getNode(ISD::TRUNCATE, dl, MVT::i32, BottomHalf);
24096 Vals[1] = DAG.getNode(ISD::TRUNCATE, dl, MVT::i32,
24097 DAG.getNode(ISD::SRA, dl, MVT::i64, BottomHalf, ShAmt));
24098 Vals[2] = DAG.getNode(ISD::TRUNCATE, dl, MVT::i32, TopHalf);
24099 Vals[3] = DAG.getNode(ISD::TRUNCATE, dl, MVT::i32,
24100 DAG.getNode(ISD::SRA, dl, MVT::i64, TopHalf, ShAmt));
24102 // Store the value to a temporary stack slot.
24103 SDValue StackPtr = DAG.CreateStackTemporary(InputVector.getValueType());
24104 SDValue Ch = DAG.getStore(DAG.getEntryNode(), dl, InputVector, StackPtr,
24105 MachinePointerInfo(), false, false, 0);
24107 EVT ElementType = InputVector.getValueType().getVectorElementType();
24108 unsigned EltSize = ElementType.getSizeInBits() / 8;
24110 // Replace each use (extract) with a load of the appropriate element.
24111 for (unsigned i = 0; i < 4; ++i) {
24112 uint64_t Offset = EltSize * i;
24113 auto PtrVT = TLI.getPointerTy(DAG.getDataLayout());
24114 SDValue OffsetVal = DAG.getConstant(Offset, dl, PtrVT);
24116 SDValue ScalarAddr =
24117 DAG.getNode(ISD::ADD, dl, PtrVT, StackPtr, OffsetVal);
24119 // Load the scalar.
24120 Vals[i] = DAG.getLoad(ElementType, dl, Ch,
24121 ScalarAddr, MachinePointerInfo(),
24122 false, false, false, 0);
24127 // Replace the extracts
24128 for (SmallVectorImpl<SDNode *>::iterator UI = Uses.begin(),
24129 UE = Uses.end(); UI != UE; ++UI) {
24130 SDNode *Extract = *UI;
24132 SDValue Idx = Extract->getOperand(1);
24133 uint64_t IdxVal = cast<ConstantSDNode>(Idx)->getZExtValue();
24134 DAG.ReplaceAllUsesOfValueWith(SDValue(Extract, 0), Vals[IdxVal]);
24137 // The replacement was made in place; don't return anything.
24142 transformVSELECTtoBlendVECTOR_SHUFFLE(SDNode *N, SelectionDAG &DAG,
24143 const X86Subtarget *Subtarget) {
24145 SDValue Cond = N->getOperand(0);
24146 SDValue LHS = N->getOperand(1);
24147 SDValue RHS = N->getOperand(2);
24149 if (Cond.getOpcode() == ISD::SIGN_EXTEND) {
24150 SDValue CondSrc = Cond->getOperand(0);
24151 if (CondSrc->getOpcode() == ISD::SIGN_EXTEND_INREG)
24152 Cond = CondSrc->getOperand(0);
24155 if (!ISD::isBuildVectorOfConstantSDNodes(Cond.getNode()))
24158 // A vselect where all conditions and data are constants can be optimized into
24159 // a single vector load by SelectionDAGLegalize::ExpandBUILD_VECTOR().
24160 if (ISD::isBuildVectorOfConstantSDNodes(LHS.getNode()) &&
24161 ISD::isBuildVectorOfConstantSDNodes(RHS.getNode()))
24164 unsigned MaskValue = 0;
24165 if (!BUILD_VECTORtoBlendMask(cast<BuildVectorSDNode>(Cond), MaskValue))
24168 MVT VT = N->getSimpleValueType(0);
24169 unsigned NumElems = VT.getVectorNumElements();
24170 SmallVector<int, 8> ShuffleMask(NumElems, -1);
24171 for (unsigned i = 0; i < NumElems; ++i) {
24172 // Be sure we emit undef where we can.
24173 if (Cond.getOperand(i)->getOpcode() == ISD::UNDEF)
24174 ShuffleMask[i] = -1;
24176 ShuffleMask[i] = i + NumElems * ((MaskValue >> i) & 1);
24179 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
24180 if (!TLI.isShuffleMaskLegal(ShuffleMask, VT))
24182 return DAG.getVectorShuffle(VT, dl, LHS, RHS, &ShuffleMask[0]);
24185 /// PerformSELECTCombine - Do target-specific dag combines on SELECT and VSELECT
24187 static SDValue PerformSELECTCombine(SDNode *N, SelectionDAG &DAG,
24188 TargetLowering::DAGCombinerInfo &DCI,
24189 const X86Subtarget *Subtarget) {
24191 SDValue Cond = N->getOperand(0);
24192 // Get the LHS/RHS of the select.
24193 SDValue LHS = N->getOperand(1);
24194 SDValue RHS = N->getOperand(2);
24195 EVT VT = LHS.getValueType();
24196 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
24198 // If we have SSE[12] support, try to form min/max nodes. SSE min/max
24199 // instructions match the semantics of the common C idiom x<y?x:y but not
24200 // x<=y?x:y, because of how they handle negative zero (which can be
24201 // ignored in unsafe-math mode).
24202 // We also try to create v2f32 min/max nodes, which we later widen to v4f32.
24203 if (Cond.getOpcode() == ISD::SETCC && VT.isFloatingPoint() &&
24204 VT != MVT::f80 && VT != MVT::f128 &&
24205 (TLI.isTypeLegal(VT) || VT == MVT::v2f32) &&
24206 (Subtarget->hasSSE2() ||
24207 (Subtarget->hasSSE1() && VT.getScalarType() == MVT::f32))) {
24208 ISD::CondCode CC = cast<CondCodeSDNode>(Cond.getOperand(2))->get();
24210 unsigned Opcode = 0;
24211 // Check for x CC y ? x : y.
24212 if (DAG.isEqualTo(LHS, Cond.getOperand(0)) &&
24213 DAG.isEqualTo(RHS, Cond.getOperand(1))) {
24217 // Converting this to a min would handle NaNs incorrectly, and swapping
24218 // the operands would cause it to handle comparisons between positive
24219 // and negative zero incorrectly.
24220 if (!DAG.isKnownNeverNaN(LHS) || !DAG.isKnownNeverNaN(RHS)) {
24221 if (!DAG.getTarget().Options.UnsafeFPMath &&
24222 !(DAG.isKnownNeverZero(LHS) || DAG.isKnownNeverZero(RHS)))
24224 std::swap(LHS, RHS);
24226 Opcode = X86ISD::FMIN;
24229 // Converting this to a min would handle comparisons between positive
24230 // and negative zero incorrectly.
24231 if (!DAG.getTarget().Options.UnsafeFPMath &&
24232 !DAG.isKnownNeverZero(LHS) && !DAG.isKnownNeverZero(RHS))
24234 Opcode = X86ISD::FMIN;
24237 // Converting this to a min would handle both negative zeros and NaNs
24238 // incorrectly, but we can swap the operands to fix both.
24239 std::swap(LHS, RHS);
24243 Opcode = X86ISD::FMIN;
24247 // Converting this to a max would handle comparisons between positive
24248 // and negative zero incorrectly.
24249 if (!DAG.getTarget().Options.UnsafeFPMath &&
24250 !DAG.isKnownNeverZero(LHS) && !DAG.isKnownNeverZero(RHS))
24252 Opcode = X86ISD::FMAX;
24255 // Converting this to a max would handle NaNs incorrectly, and swapping
24256 // the operands would cause it to handle comparisons between positive
24257 // and negative zero incorrectly.
24258 if (!DAG.isKnownNeverNaN(LHS) || !DAG.isKnownNeverNaN(RHS)) {
24259 if (!DAG.getTarget().Options.UnsafeFPMath &&
24260 !(DAG.isKnownNeverZero(LHS) || DAG.isKnownNeverZero(RHS)))
24262 std::swap(LHS, RHS);
24264 Opcode = X86ISD::FMAX;
24267 // Converting this to a max would handle both negative zeros and NaNs
24268 // incorrectly, but we can swap the operands to fix both.
24269 std::swap(LHS, RHS);
24273 Opcode = X86ISD::FMAX;
24276 // Check for x CC y ? y : x -- a min/max with reversed arms.
24277 } else if (DAG.isEqualTo(LHS, Cond.getOperand(1)) &&
24278 DAG.isEqualTo(RHS, Cond.getOperand(0))) {
24282 // Converting this to a min would handle comparisons between positive
24283 // and negative zero incorrectly, and swapping the operands would
24284 // cause it to handle NaNs incorrectly.
24285 if (!DAG.getTarget().Options.UnsafeFPMath &&
24286 !(DAG.isKnownNeverZero(LHS) || DAG.isKnownNeverZero(RHS))) {
24287 if (!DAG.isKnownNeverNaN(LHS) || !DAG.isKnownNeverNaN(RHS))
24289 std::swap(LHS, RHS);
24291 Opcode = X86ISD::FMIN;
24294 // Converting this to a min would handle NaNs incorrectly.
24295 if (!DAG.getTarget().Options.UnsafeFPMath &&
24296 (!DAG.isKnownNeverNaN(LHS) || !DAG.isKnownNeverNaN(RHS)))
24298 Opcode = X86ISD::FMIN;
24301 // Converting this to a min would handle both negative zeros and NaNs
24302 // incorrectly, but we can swap the operands to fix both.
24303 std::swap(LHS, RHS);
24307 Opcode = X86ISD::FMIN;
24311 // Converting this to a max would handle NaNs incorrectly.
24312 if (!DAG.isKnownNeverNaN(LHS) || !DAG.isKnownNeverNaN(RHS))
24314 Opcode = X86ISD::FMAX;
24317 // Converting this to a max would handle comparisons between positive
24318 // and negative zero incorrectly, and swapping the operands would
24319 // cause it to handle NaNs incorrectly.
24320 if (!DAG.getTarget().Options.UnsafeFPMath &&
24321 !DAG.isKnownNeverZero(LHS) && !DAG.isKnownNeverZero(RHS)) {
24322 if (!DAG.isKnownNeverNaN(LHS) || !DAG.isKnownNeverNaN(RHS))
24324 std::swap(LHS, RHS);
24326 Opcode = X86ISD::FMAX;
24329 // Converting this to a max would handle both negative zeros and NaNs
24330 // incorrectly, but we can swap the operands to fix both.
24331 std::swap(LHS, RHS);
24335 Opcode = X86ISD::FMAX;
24341 return DAG.getNode(Opcode, DL, N->getValueType(0), LHS, RHS);
24344 EVT CondVT = Cond.getValueType();
24345 if (Subtarget->hasAVX512() && VT.isVector() && CondVT.isVector() &&
24346 CondVT.getVectorElementType() == MVT::i1) {
24347 // v16i8 (select v16i1, v16i8, v16i8) does not have a proper
24348 // lowering on KNL. In this case we convert it to
24349 // v16i8 (select v16i8, v16i8, v16i8) and use AVX instruction.
24350 // The same situation for all 128 and 256-bit vectors of i8 and i16.
24351 // Since SKX these selects have a proper lowering.
24352 EVT OpVT = LHS.getValueType();
24353 if ((OpVT.is128BitVector() || OpVT.is256BitVector()) &&
24354 (OpVT.getVectorElementType() == MVT::i8 ||
24355 OpVT.getVectorElementType() == MVT::i16) &&
24356 !(Subtarget->hasBWI() && Subtarget->hasVLX())) {
24357 Cond = DAG.getNode(ISD::SIGN_EXTEND, DL, OpVT, Cond);
24358 DCI.AddToWorklist(Cond.getNode());
24359 return DAG.getNode(N->getOpcode(), DL, OpVT, Cond, LHS, RHS);
24362 // If this is a select between two integer constants, try to do some
24364 if (ConstantSDNode *TrueC = dyn_cast<ConstantSDNode>(LHS)) {
24365 if (ConstantSDNode *FalseC = dyn_cast<ConstantSDNode>(RHS))
24366 // Don't do this for crazy integer types.
24367 if (DAG.getTargetLoweringInfo().isTypeLegal(LHS.getValueType())) {
24368 // If this is efficiently invertible, canonicalize the LHSC/RHSC values
24369 // so that TrueC (the true value) is larger than FalseC.
24370 bool NeedsCondInvert = false;
24372 if (TrueC->getAPIntValue().ult(FalseC->getAPIntValue()) &&
24373 // Efficiently invertible.
24374 (Cond.getOpcode() == ISD::SETCC || // setcc -> invertible.
24375 (Cond.getOpcode() == ISD::XOR && // xor(X, C) -> invertible.
24376 isa<ConstantSDNode>(Cond.getOperand(1))))) {
24377 NeedsCondInvert = true;
24378 std::swap(TrueC, FalseC);
24381 // Optimize C ? 8 : 0 -> zext(C) << 3. Likewise for any pow2/0.
24382 if (FalseC->getAPIntValue() == 0 &&
24383 TrueC->getAPIntValue().isPowerOf2()) {
24384 if (NeedsCondInvert) // Invert the condition if needed.
24385 Cond = DAG.getNode(ISD::XOR, DL, Cond.getValueType(), Cond,
24386 DAG.getConstant(1, DL, Cond.getValueType()));
24388 // Zero extend the condition if needed.
24389 Cond = DAG.getNode(ISD::ZERO_EXTEND, DL, LHS.getValueType(), Cond);
24391 unsigned ShAmt = TrueC->getAPIntValue().logBase2();
24392 return DAG.getNode(ISD::SHL, DL, LHS.getValueType(), Cond,
24393 DAG.getConstant(ShAmt, DL, MVT::i8));
24396 // Optimize Cond ? cst+1 : cst -> zext(setcc(C)+cst.
24397 if (FalseC->getAPIntValue()+1 == TrueC->getAPIntValue()) {
24398 if (NeedsCondInvert) // Invert the condition if needed.
24399 Cond = DAG.getNode(ISD::XOR, DL, Cond.getValueType(), Cond,
24400 DAG.getConstant(1, DL, Cond.getValueType()));
24402 // Zero extend the condition if needed.
24403 Cond = DAG.getNode(ISD::ZERO_EXTEND, DL,
24404 FalseC->getValueType(0), Cond);
24405 return DAG.getNode(ISD::ADD, DL, Cond.getValueType(), Cond,
24406 SDValue(FalseC, 0));
24409 // Optimize cases that will turn into an LEA instruction. This requires
24410 // an i32 or i64 and an efficient multiplier (1, 2, 3, 4, 5, 8, 9).
24411 if (N->getValueType(0) == MVT::i32 || N->getValueType(0) == MVT::i64) {
24412 uint64_t Diff = TrueC->getZExtValue()-FalseC->getZExtValue();
24413 if (N->getValueType(0) == MVT::i32) Diff = (unsigned)Diff;
24415 bool isFastMultiplier = false;
24417 switch ((unsigned char)Diff) {
24419 case 1: // result = add base, cond
24420 case 2: // result = lea base( , cond*2)
24421 case 3: // result = lea base(cond, cond*2)
24422 case 4: // result = lea base( , cond*4)
24423 case 5: // result = lea base(cond, cond*4)
24424 case 8: // result = lea base( , cond*8)
24425 case 9: // result = lea base(cond, cond*8)
24426 isFastMultiplier = true;
24431 if (isFastMultiplier) {
24432 APInt Diff = TrueC->getAPIntValue()-FalseC->getAPIntValue();
24433 if (NeedsCondInvert) // Invert the condition if needed.
24434 Cond = DAG.getNode(ISD::XOR, DL, Cond.getValueType(), Cond,
24435 DAG.getConstant(1, DL, Cond.getValueType()));
24437 // Zero extend the condition if needed.
24438 Cond = DAG.getNode(ISD::ZERO_EXTEND, DL, FalseC->getValueType(0),
24440 // Scale the condition by the difference.
24442 Cond = DAG.getNode(ISD::MUL, DL, Cond.getValueType(), Cond,
24443 DAG.getConstant(Diff, DL,
24444 Cond.getValueType()));
24446 // Add the base if non-zero.
24447 if (FalseC->getAPIntValue() != 0)
24448 Cond = DAG.getNode(ISD::ADD, DL, Cond.getValueType(), Cond,
24449 SDValue(FalseC, 0));
24456 // Canonicalize max and min:
24457 // (x > y) ? x : y -> (x >= y) ? x : y
24458 // (x < y) ? x : y -> (x <= y) ? x : y
24459 // This allows use of COND_S / COND_NS (see TranslateX86CC) which eliminates
24460 // the need for an extra compare
24461 // against zero. e.g.
24462 // (x - y) > 0 : (x - y) ? 0 -> (x - y) >= 0 : (x - y) ? 0
24464 // testl %edi, %edi
24466 // cmovgl %edi, %eax
24470 // cmovsl %eax, %edi
24471 if (N->getOpcode() == ISD::SELECT && Cond.getOpcode() == ISD::SETCC &&
24472 DAG.isEqualTo(LHS, Cond.getOperand(0)) &&
24473 DAG.isEqualTo(RHS, Cond.getOperand(1))) {
24474 ISD::CondCode CC = cast<CondCodeSDNode>(Cond.getOperand(2))->get();
24479 ISD::CondCode NewCC = (CC == ISD::SETLT) ? ISD::SETLE : ISD::SETGE;
24480 Cond = DAG.getSetCC(SDLoc(Cond), Cond.getValueType(),
24481 Cond.getOperand(0), Cond.getOperand(1), NewCC);
24482 return DAG.getNode(ISD::SELECT, DL, VT, Cond, LHS, RHS);
24487 // Early exit check
24488 if (!TLI.isTypeLegal(VT))
24491 // Match VSELECTs into subs with unsigned saturation.
24492 if (N->getOpcode() == ISD::VSELECT && Cond.getOpcode() == ISD::SETCC &&
24493 // psubus is available in SSE2 and AVX2 for i8 and i16 vectors.
24494 ((Subtarget->hasSSE2() && (VT == MVT::v16i8 || VT == MVT::v8i16)) ||
24495 (Subtarget->hasAVX2() && (VT == MVT::v32i8 || VT == MVT::v16i16)))) {
24496 ISD::CondCode CC = cast<CondCodeSDNode>(Cond.getOperand(2))->get();
24498 // Check if one of the arms of the VSELECT is a zero vector. If it's on the
24499 // left side invert the predicate to simplify logic below.
24501 if (ISD::isBuildVectorAllZeros(LHS.getNode())) {
24503 CC = ISD::getSetCCInverse(CC, true);
24504 } else if (ISD::isBuildVectorAllZeros(RHS.getNode())) {
24508 if (Other.getNode() && Other->getNumOperands() == 2 &&
24509 DAG.isEqualTo(Other->getOperand(0), Cond.getOperand(0))) {
24510 SDValue OpLHS = Other->getOperand(0), OpRHS = Other->getOperand(1);
24511 SDValue CondRHS = Cond->getOperand(1);
24513 // Look for a general sub with unsigned saturation first.
24514 // x >= y ? x-y : 0 --> subus x, y
24515 // x > y ? x-y : 0 --> subus x, y
24516 if ((CC == ISD::SETUGE || CC == ISD::SETUGT) &&
24517 Other->getOpcode() == ISD::SUB && DAG.isEqualTo(OpRHS, CondRHS))
24518 return DAG.getNode(X86ISD::SUBUS, DL, VT, OpLHS, OpRHS);
24520 if (auto *OpRHSBV = dyn_cast<BuildVectorSDNode>(OpRHS))
24521 if (auto *OpRHSConst = OpRHSBV->getConstantSplatNode()) {
24522 if (auto *CondRHSBV = dyn_cast<BuildVectorSDNode>(CondRHS))
24523 if (auto *CondRHSConst = CondRHSBV->getConstantSplatNode())
24524 // If the RHS is a constant we have to reverse the const
24525 // canonicalization.
24526 // x > C-1 ? x+-C : 0 --> subus x, C
24527 if (CC == ISD::SETUGT && Other->getOpcode() == ISD::ADD &&
24528 CondRHSConst->getAPIntValue() ==
24529 (-OpRHSConst->getAPIntValue() - 1))
24530 return DAG.getNode(
24531 X86ISD::SUBUS, DL, VT, OpLHS,
24532 DAG.getConstant(-OpRHSConst->getAPIntValue(), DL, VT));
24534 // Another special case: If C was a sign bit, the sub has been
24535 // canonicalized into a xor.
24536 // FIXME: Would it be better to use computeKnownBits to determine
24537 // whether it's safe to decanonicalize the xor?
24538 // x s< 0 ? x^C : 0 --> subus x, C
24539 if (CC == ISD::SETLT && Other->getOpcode() == ISD::XOR &&
24540 ISD::isBuildVectorAllZeros(CondRHS.getNode()) &&
24541 OpRHSConst->getAPIntValue().isSignBit())
24542 // Note that we have to rebuild the RHS constant here to ensure we
24543 // don't rely on particular values of undef lanes.
24544 return DAG.getNode(
24545 X86ISD::SUBUS, DL, VT, OpLHS,
24546 DAG.getConstant(OpRHSConst->getAPIntValue(), DL, VT));
24551 // Simplify vector selection if condition value type matches vselect
24553 if (N->getOpcode() == ISD::VSELECT && CondVT == VT) {
24554 assert(Cond.getValueType().isVector() &&
24555 "vector select expects a vector selector!");
24557 bool TValIsAllOnes = ISD::isBuildVectorAllOnes(LHS.getNode());
24558 bool FValIsAllZeros = ISD::isBuildVectorAllZeros(RHS.getNode());
24560 // Try invert the condition if true value is not all 1s and false value
24562 if (!TValIsAllOnes && !FValIsAllZeros &&
24563 // Check if the selector will be produced by CMPP*/PCMP*
24564 Cond.getOpcode() == ISD::SETCC &&
24565 // Check if SETCC has already been promoted
24566 TLI.getSetCCResultType(DAG.getDataLayout(), *DAG.getContext(), VT) ==
24568 bool TValIsAllZeros = ISD::isBuildVectorAllZeros(LHS.getNode());
24569 bool FValIsAllOnes = ISD::isBuildVectorAllOnes(RHS.getNode());
24571 if (TValIsAllZeros || FValIsAllOnes) {
24572 SDValue CC = Cond.getOperand(2);
24573 ISD::CondCode NewCC =
24574 ISD::getSetCCInverse(cast<CondCodeSDNode>(CC)->get(),
24575 Cond.getOperand(0).getValueType().isInteger());
24576 Cond = DAG.getSetCC(DL, CondVT, Cond.getOperand(0), Cond.getOperand(1), NewCC);
24577 std::swap(LHS, RHS);
24578 TValIsAllOnes = FValIsAllOnes;
24579 FValIsAllZeros = TValIsAllZeros;
24583 if (TValIsAllOnes || FValIsAllZeros) {
24586 if (TValIsAllOnes && FValIsAllZeros)
24588 else if (TValIsAllOnes)
24590 DAG.getNode(ISD::OR, DL, CondVT, Cond, DAG.getBitcast(CondVT, RHS));
24591 else if (FValIsAllZeros)
24592 Ret = DAG.getNode(ISD::AND, DL, CondVT, Cond,
24593 DAG.getBitcast(CondVT, LHS));
24595 return DAG.getBitcast(VT, Ret);
24599 // We should generate an X86ISD::BLENDI from a vselect if its argument
24600 // is a sign_extend_inreg of an any_extend of a BUILD_VECTOR of
24601 // constants. This specific pattern gets generated when we split a
24602 // selector for a 512 bit vector in a machine without AVX512 (but with
24603 // 256-bit vectors), during legalization:
24605 // (vselect (sign_extend (any_extend (BUILD_VECTOR)) i1) LHS RHS)
24607 // Iff we find this pattern and the build_vectors are built from
24608 // constants, we translate the vselect into a shuffle_vector that we
24609 // know will be matched by LowerVECTOR_SHUFFLEtoBlend.
24610 if ((N->getOpcode() == ISD::VSELECT ||
24611 N->getOpcode() == X86ISD::SHRUNKBLEND) &&
24612 !DCI.isBeforeLegalize() && !VT.is512BitVector()) {
24613 SDValue Shuffle = transformVSELECTtoBlendVECTOR_SHUFFLE(N, DAG, Subtarget);
24614 if (Shuffle.getNode())
24618 // If this is a *dynamic* select (non-constant condition) and we can match
24619 // this node with one of the variable blend instructions, restructure the
24620 // condition so that the blends can use the high bit of each element and use
24621 // SimplifyDemandedBits to simplify the condition operand.
24622 if (N->getOpcode() == ISD::VSELECT && DCI.isBeforeLegalizeOps() &&
24623 !DCI.isBeforeLegalize() &&
24624 !ISD::isBuildVectorOfConstantSDNodes(Cond.getNode())) {
24625 unsigned BitWidth = Cond.getValueType().getScalarSizeInBits();
24627 // Don't optimize vector selects that map to mask-registers.
24631 // We can only handle the cases where VSELECT is directly legal on the
24632 // subtarget. We custom lower VSELECT nodes with constant conditions and
24633 // this makes it hard to see whether a dynamic VSELECT will correctly
24634 // lower, so we both check the operation's status and explicitly handle the
24635 // cases where a *dynamic* blend will fail even though a constant-condition
24636 // blend could be custom lowered.
24637 // FIXME: We should find a better way to handle this class of problems.
24638 // Potentially, we should combine constant-condition vselect nodes
24639 // pre-legalization into shuffles and not mark as many types as custom
24641 if (!TLI.isOperationLegalOrCustom(ISD::VSELECT, VT))
24643 // FIXME: We don't support i16-element blends currently. We could and
24644 // should support them by making *all* the bits in the condition be set
24645 // rather than just the high bit and using an i8-element blend.
24646 if (VT.getVectorElementType() == MVT::i16)
24648 // Dynamic blending was only available from SSE4.1 onward.
24649 if (VT.is128BitVector() && !Subtarget->hasSSE41())
24651 // Byte blends are only available in AVX2
24652 if (VT == MVT::v32i8 && !Subtarget->hasAVX2())
24655 assert(BitWidth >= 8 && BitWidth <= 64 && "Invalid mask size");
24656 APInt DemandedMask = APInt::getHighBitsSet(BitWidth, 1);
24658 APInt KnownZero, KnownOne;
24659 TargetLowering::TargetLoweringOpt TLO(DAG, DCI.isBeforeLegalize(),
24660 DCI.isBeforeLegalizeOps());
24661 if (TLO.ShrinkDemandedConstant(Cond, DemandedMask) ||
24662 TLI.SimplifyDemandedBits(Cond, DemandedMask, KnownZero, KnownOne,
24664 // If we changed the computation somewhere in the DAG, this change
24665 // will affect all users of Cond.
24666 // Make sure it is fine and update all the nodes so that we do not
24667 // use the generic VSELECT anymore. Otherwise, we may perform
24668 // wrong optimizations as we messed up with the actual expectation
24669 // for the vector boolean values.
24670 if (Cond != TLO.Old) {
24671 // Check all uses of that condition operand to check whether it will be
24672 // consumed by non-BLEND instructions, which may depend on all bits are
24674 for (SDNode::use_iterator I = Cond->use_begin(), E = Cond->use_end();
24676 if (I->getOpcode() != ISD::VSELECT)
24677 // TODO: Add other opcodes eventually lowered into BLEND.
24680 // Update all the users of the condition, before committing the change,
24681 // so that the VSELECT optimizations that expect the correct vector
24682 // boolean value will not be triggered.
24683 for (SDNode::use_iterator I = Cond->use_begin(), E = Cond->use_end();
24685 DAG.ReplaceAllUsesOfValueWith(
24687 DAG.getNode(X86ISD::SHRUNKBLEND, SDLoc(*I), I->getValueType(0),
24688 Cond, I->getOperand(1), I->getOperand(2)));
24689 DCI.CommitTargetLoweringOpt(TLO);
24692 // At this point, only Cond is changed. Change the condition
24693 // just for N to keep the opportunity to optimize all other
24694 // users their own way.
24695 DAG.ReplaceAllUsesOfValueWith(
24697 DAG.getNode(X86ISD::SHRUNKBLEND, SDLoc(N), N->getValueType(0),
24698 TLO.New, N->getOperand(1), N->getOperand(2)));
24706 // Check whether a boolean test is testing a boolean value generated by
24707 // X86ISD::SETCC. If so, return the operand of that SETCC and proper condition
24710 // Simplify the following patterns:
24711 // (Op (CMP (SETCC Cond EFLAGS) 1) EQ) or
24712 // (Op (CMP (SETCC Cond EFLAGS) 0) NEQ)
24713 // to (Op EFLAGS Cond)
24715 // (Op (CMP (SETCC Cond EFLAGS) 0) EQ) or
24716 // (Op (CMP (SETCC Cond EFLAGS) 1) NEQ)
24717 // to (Op EFLAGS !Cond)
24719 // where Op could be BRCOND or CMOV.
24721 static SDValue checkBoolTestSetCCCombine(SDValue Cmp, X86::CondCode &CC) {
24722 // Quit if not CMP and SUB with its value result used.
24723 if (Cmp.getOpcode() != X86ISD::CMP &&
24724 (Cmp.getOpcode() != X86ISD::SUB || Cmp.getNode()->hasAnyUseOfValue(0)))
24727 // Quit if not used as a boolean value.
24728 if (CC != X86::COND_E && CC != X86::COND_NE)
24731 // Check CMP operands. One of them should be 0 or 1 and the other should be
24732 // an SetCC or extended from it.
24733 SDValue Op1 = Cmp.getOperand(0);
24734 SDValue Op2 = Cmp.getOperand(1);
24737 const ConstantSDNode* C = nullptr;
24738 bool needOppositeCond = (CC == X86::COND_E);
24739 bool checkAgainstTrue = false; // Is it a comparison against 1?
24741 if ((C = dyn_cast<ConstantSDNode>(Op1)))
24743 else if ((C = dyn_cast<ConstantSDNode>(Op2)))
24745 else // Quit if all operands are not constants.
24748 if (C->getZExtValue() == 1) {
24749 needOppositeCond = !needOppositeCond;
24750 checkAgainstTrue = true;
24751 } else if (C->getZExtValue() != 0)
24752 // Quit if the constant is neither 0 or 1.
24755 bool truncatedToBoolWithAnd = false;
24756 // Skip (zext $x), (trunc $x), or (and $x, 1) node.
24757 while (SetCC.getOpcode() == ISD::ZERO_EXTEND ||
24758 SetCC.getOpcode() == ISD::TRUNCATE ||
24759 SetCC.getOpcode() == ISD::AND) {
24760 if (SetCC.getOpcode() == ISD::AND) {
24762 if (isOneConstant(SetCC.getOperand(0)))
24764 if (isOneConstant(SetCC.getOperand(1)))
24768 SetCC = SetCC.getOperand(OpIdx);
24769 truncatedToBoolWithAnd = true;
24771 SetCC = SetCC.getOperand(0);
24774 switch (SetCC.getOpcode()) {
24775 case X86ISD::SETCC_CARRY:
24776 // Since SETCC_CARRY gives output based on R = CF ? ~0 : 0, it's unsafe to
24777 // simplify it if the result of SETCC_CARRY is not canonicalized to 0 or 1,
24778 // i.e. it's a comparison against true but the result of SETCC_CARRY is not
24779 // truncated to i1 using 'and'.
24780 if (checkAgainstTrue && !truncatedToBoolWithAnd)
24782 assert(X86::CondCode(SetCC.getConstantOperandVal(0)) == X86::COND_B &&
24783 "Invalid use of SETCC_CARRY!");
24785 case X86ISD::SETCC:
24786 // Set the condition code or opposite one if necessary.
24787 CC = X86::CondCode(SetCC.getConstantOperandVal(0));
24788 if (needOppositeCond)
24789 CC = X86::GetOppositeBranchCondition(CC);
24790 return SetCC.getOperand(1);
24791 case X86ISD::CMOV: {
24792 // Check whether false/true value has canonical one, i.e. 0 or 1.
24793 ConstantSDNode *FVal = dyn_cast<ConstantSDNode>(SetCC.getOperand(0));
24794 ConstantSDNode *TVal = dyn_cast<ConstantSDNode>(SetCC.getOperand(1));
24795 // Quit if true value is not a constant.
24798 // Quit if false value is not a constant.
24800 SDValue Op = SetCC.getOperand(0);
24801 // Skip 'zext' or 'trunc' node.
24802 if (Op.getOpcode() == ISD::ZERO_EXTEND ||
24803 Op.getOpcode() == ISD::TRUNCATE)
24804 Op = Op.getOperand(0);
24805 // A special case for rdrand/rdseed, where 0 is set if false cond is
24807 if ((Op.getOpcode() != X86ISD::RDRAND &&
24808 Op.getOpcode() != X86ISD::RDSEED) || Op.getResNo() != 0)
24811 // Quit if false value is not the constant 0 or 1.
24812 bool FValIsFalse = true;
24813 if (FVal && FVal->getZExtValue() != 0) {
24814 if (FVal->getZExtValue() != 1)
24816 // If FVal is 1, opposite cond is needed.
24817 needOppositeCond = !needOppositeCond;
24818 FValIsFalse = false;
24820 // Quit if TVal is not the constant opposite of FVal.
24821 if (FValIsFalse && TVal->getZExtValue() != 1)
24823 if (!FValIsFalse && TVal->getZExtValue() != 0)
24825 CC = X86::CondCode(SetCC.getConstantOperandVal(2));
24826 if (needOppositeCond)
24827 CC = X86::GetOppositeBranchCondition(CC);
24828 return SetCC.getOperand(3);
24835 /// Check whether Cond is an AND/OR of SETCCs off of the same EFLAGS.
24837 /// (X86or (X86setcc) (X86setcc))
24838 /// (X86cmp (and (X86setcc) (X86setcc)), 0)
24839 static bool checkBoolTestAndOrSetCCCombine(SDValue Cond, X86::CondCode &CC0,
24840 X86::CondCode &CC1, SDValue &Flags,
24842 if (Cond->getOpcode() == X86ISD::CMP) {
24843 if (!isNullConstant(Cond->getOperand(1)))
24846 Cond = Cond->getOperand(0);
24851 SDValue SetCC0, SetCC1;
24852 switch (Cond->getOpcode()) {
24853 default: return false;
24860 SetCC0 = Cond->getOperand(0);
24861 SetCC1 = Cond->getOperand(1);
24865 // Make sure we have SETCC nodes, using the same flags value.
24866 if (SetCC0.getOpcode() != X86ISD::SETCC ||
24867 SetCC1.getOpcode() != X86ISD::SETCC ||
24868 SetCC0->getOperand(1) != SetCC1->getOperand(1))
24871 CC0 = (X86::CondCode)SetCC0->getConstantOperandVal(0);
24872 CC1 = (X86::CondCode)SetCC1->getConstantOperandVal(0);
24873 Flags = SetCC0->getOperand(1);
24877 /// Optimize X86ISD::CMOV [LHS, RHS, CONDCODE (e.g. X86::COND_NE), CONDVAL]
24878 static SDValue PerformCMOVCombine(SDNode *N, SelectionDAG &DAG,
24879 TargetLowering::DAGCombinerInfo &DCI,
24880 const X86Subtarget *Subtarget) {
24883 // If the flag operand isn't dead, don't touch this CMOV.
24884 if (N->getNumValues() == 2 && !SDValue(N, 1).use_empty())
24887 SDValue FalseOp = N->getOperand(0);
24888 SDValue TrueOp = N->getOperand(1);
24889 X86::CondCode CC = (X86::CondCode)N->getConstantOperandVal(2);
24890 SDValue Cond = N->getOperand(3);
24892 if (CC == X86::COND_E || CC == X86::COND_NE) {
24893 switch (Cond.getOpcode()) {
24897 // If operand of BSR / BSF are proven never zero, then ZF cannot be set.
24898 if (DAG.isKnownNeverZero(Cond.getOperand(0)))
24899 return (CC == X86::COND_E) ? FalseOp : TrueOp;
24905 Flags = checkBoolTestSetCCCombine(Cond, CC);
24906 if (Flags.getNode() &&
24907 // Extra check as FCMOV only supports a subset of X86 cond.
24908 (FalseOp.getValueType() != MVT::f80 || hasFPCMov(CC))) {
24909 SDValue Ops[] = { FalseOp, TrueOp,
24910 DAG.getConstant(CC, DL, MVT::i8), Flags };
24911 return DAG.getNode(X86ISD::CMOV, DL, N->getVTList(), Ops);
24914 // If this is a select between two integer constants, try to do some
24915 // optimizations. Note that the operands are ordered the opposite of SELECT
24917 if (ConstantSDNode *TrueC = dyn_cast<ConstantSDNode>(TrueOp)) {
24918 if (ConstantSDNode *FalseC = dyn_cast<ConstantSDNode>(FalseOp)) {
24919 // Canonicalize the TrueC/FalseC values so that TrueC (the true value) is
24920 // larger than FalseC (the false value).
24921 if (TrueC->getAPIntValue().ult(FalseC->getAPIntValue())) {
24922 CC = X86::GetOppositeBranchCondition(CC);
24923 std::swap(TrueC, FalseC);
24924 std::swap(TrueOp, FalseOp);
24927 // Optimize C ? 8 : 0 -> zext(setcc(C)) << 3. Likewise for any pow2/0.
24928 // This is efficient for any integer data type (including i8/i16) and
24930 if (FalseC->getAPIntValue() == 0 && TrueC->getAPIntValue().isPowerOf2()) {
24931 Cond = DAG.getNode(X86ISD::SETCC, DL, MVT::i8,
24932 DAG.getConstant(CC, DL, MVT::i8), Cond);
24934 // Zero extend the condition if needed.
24935 Cond = DAG.getNode(ISD::ZERO_EXTEND, DL, TrueC->getValueType(0), Cond);
24937 unsigned ShAmt = TrueC->getAPIntValue().logBase2();
24938 Cond = DAG.getNode(ISD::SHL, DL, Cond.getValueType(), Cond,
24939 DAG.getConstant(ShAmt, DL, MVT::i8));
24940 if (N->getNumValues() == 2) // Dead flag value?
24941 return DCI.CombineTo(N, Cond, SDValue());
24945 // Optimize Cond ? cst+1 : cst -> zext(setcc(C)+cst. This is efficient
24946 // for any integer data type, including i8/i16.
24947 if (FalseC->getAPIntValue()+1 == TrueC->getAPIntValue()) {
24948 Cond = DAG.getNode(X86ISD::SETCC, DL, MVT::i8,
24949 DAG.getConstant(CC, DL, MVT::i8), Cond);
24951 // Zero extend the condition if needed.
24952 Cond = DAG.getNode(ISD::ZERO_EXTEND, DL,
24953 FalseC->getValueType(0), Cond);
24954 Cond = DAG.getNode(ISD::ADD, DL, Cond.getValueType(), Cond,
24955 SDValue(FalseC, 0));
24957 if (N->getNumValues() == 2) // Dead flag value?
24958 return DCI.CombineTo(N, Cond, SDValue());
24962 // Optimize cases that will turn into an LEA instruction. This requires
24963 // an i32 or i64 and an efficient multiplier (1, 2, 3, 4, 5, 8, 9).
24964 if (N->getValueType(0) == MVT::i32 || N->getValueType(0) == MVT::i64) {
24965 uint64_t Diff = TrueC->getZExtValue()-FalseC->getZExtValue();
24966 if (N->getValueType(0) == MVT::i32) Diff = (unsigned)Diff;
24968 bool isFastMultiplier = false;
24970 switch ((unsigned char)Diff) {
24972 case 1: // result = add base, cond
24973 case 2: // result = lea base( , cond*2)
24974 case 3: // result = lea base(cond, cond*2)
24975 case 4: // result = lea base( , cond*4)
24976 case 5: // result = lea base(cond, cond*4)
24977 case 8: // result = lea base( , cond*8)
24978 case 9: // result = lea base(cond, cond*8)
24979 isFastMultiplier = true;
24984 if (isFastMultiplier) {
24985 APInt Diff = TrueC->getAPIntValue()-FalseC->getAPIntValue();
24986 Cond = DAG.getNode(X86ISD::SETCC, DL, MVT::i8,
24987 DAG.getConstant(CC, DL, MVT::i8), Cond);
24988 // Zero extend the condition if needed.
24989 Cond = DAG.getNode(ISD::ZERO_EXTEND, DL, FalseC->getValueType(0),
24991 // Scale the condition by the difference.
24993 Cond = DAG.getNode(ISD::MUL, DL, Cond.getValueType(), Cond,
24994 DAG.getConstant(Diff, DL, Cond.getValueType()));
24996 // Add the base if non-zero.
24997 if (FalseC->getAPIntValue() != 0)
24998 Cond = DAG.getNode(ISD::ADD, DL, Cond.getValueType(), Cond,
24999 SDValue(FalseC, 0));
25000 if (N->getNumValues() == 2) // Dead flag value?
25001 return DCI.CombineTo(N, Cond, SDValue());
25008 // Handle these cases:
25009 // (select (x != c), e, c) -> select (x != c), e, x),
25010 // (select (x == c), c, e) -> select (x == c), x, e)
25011 // where the c is an integer constant, and the "select" is the combination
25012 // of CMOV and CMP.
25014 // The rationale for this change is that the conditional-move from a constant
25015 // needs two instructions, however, conditional-move from a register needs
25016 // only one instruction.
25018 // CAVEAT: By replacing a constant with a symbolic value, it may obscure
25019 // some instruction-combining opportunities. This opt needs to be
25020 // postponed as late as possible.
25022 if (!DCI.isBeforeLegalize() && !DCI.isBeforeLegalizeOps()) {
25023 // the DCI.xxxx conditions are provided to postpone the optimization as
25024 // late as possible.
25026 ConstantSDNode *CmpAgainst = nullptr;
25027 if ((Cond.getOpcode() == X86ISD::CMP || Cond.getOpcode() == X86ISD::SUB) &&
25028 (CmpAgainst = dyn_cast<ConstantSDNode>(Cond.getOperand(1))) &&
25029 !isa<ConstantSDNode>(Cond.getOperand(0))) {
25031 if (CC == X86::COND_NE &&
25032 CmpAgainst == dyn_cast<ConstantSDNode>(FalseOp)) {
25033 CC = X86::GetOppositeBranchCondition(CC);
25034 std::swap(TrueOp, FalseOp);
25037 if (CC == X86::COND_E &&
25038 CmpAgainst == dyn_cast<ConstantSDNode>(TrueOp)) {
25039 SDValue Ops[] = { FalseOp, Cond.getOperand(0),
25040 DAG.getConstant(CC, DL, MVT::i8), Cond };
25041 return DAG.getNode(X86ISD::CMOV, DL, N->getVTList (), Ops);
25046 // Fold and/or of setcc's to double CMOV:
25047 // (CMOV F, T, ((cc1 | cc2) != 0)) -> (CMOV (CMOV F, T, cc1), T, cc2)
25048 // (CMOV F, T, ((cc1 & cc2) != 0)) -> (CMOV (CMOV T, F, !cc1), F, !cc2)
25050 // This combine lets us generate:
25051 // cmovcc1 (jcc1 if we don't have CMOV)
25057 // cmovne (jne if we don't have CMOV)
25058 // When we can't use the CMOV instruction, it might increase branch
25060 // When we can use CMOV, or when there is no mispredict, this improves
25061 // throughput and reduces register pressure.
25063 if (CC == X86::COND_NE) {
25065 X86::CondCode CC0, CC1;
25067 if (checkBoolTestAndOrSetCCCombine(Cond, CC0, CC1, Flags, isAndSetCC)) {
25069 std::swap(FalseOp, TrueOp);
25070 CC0 = X86::GetOppositeBranchCondition(CC0);
25071 CC1 = X86::GetOppositeBranchCondition(CC1);
25074 SDValue LOps[] = {FalseOp, TrueOp, DAG.getConstant(CC0, DL, MVT::i8),
25076 SDValue LCMOV = DAG.getNode(X86ISD::CMOV, DL, N->getVTList(), LOps);
25077 SDValue Ops[] = {LCMOV, TrueOp, DAG.getConstant(CC1, DL, MVT::i8), Flags};
25078 SDValue CMOV = DAG.getNode(X86ISD::CMOV, DL, N->getVTList(), Ops);
25079 DAG.ReplaceAllUsesOfValueWith(SDValue(N, 1), SDValue(CMOV.getNode(), 1));
25087 /// PerformMulCombine - Optimize a single multiply with constant into two
25088 /// in order to implement it with two cheaper instructions, e.g.
25089 /// LEA + SHL, LEA + LEA.
25090 static SDValue PerformMulCombine(SDNode *N, SelectionDAG &DAG,
25091 TargetLowering::DAGCombinerInfo &DCI) {
25092 // An imul is usually smaller than the alternative sequence.
25093 if (DAG.getMachineFunction().getFunction()->optForMinSize())
25096 if (DCI.isBeforeLegalize() || DCI.isCalledByLegalizer())
25099 EVT VT = N->getValueType(0);
25100 if (VT != MVT::i64 && VT != MVT::i32)
25103 ConstantSDNode *C = dyn_cast<ConstantSDNode>(N->getOperand(1));
25106 uint64_t MulAmt = C->getZExtValue();
25107 if (isPowerOf2_64(MulAmt) || MulAmt == 3 || MulAmt == 5 || MulAmt == 9)
25110 uint64_t MulAmt1 = 0;
25111 uint64_t MulAmt2 = 0;
25112 if ((MulAmt % 9) == 0) {
25114 MulAmt2 = MulAmt / 9;
25115 } else if ((MulAmt % 5) == 0) {
25117 MulAmt2 = MulAmt / 5;
25118 } else if ((MulAmt % 3) == 0) {
25120 MulAmt2 = MulAmt / 3;
25126 (isPowerOf2_64(MulAmt2) || MulAmt2 == 3 || MulAmt2 == 5 || MulAmt2 == 9)){
25128 if (isPowerOf2_64(MulAmt2) &&
25129 !(N->hasOneUse() && N->use_begin()->getOpcode() == ISD::ADD))
25130 // If second multiplifer is pow2, issue it first. We want the multiply by
25131 // 3, 5, or 9 to be folded into the addressing mode unless the lone use
25133 std::swap(MulAmt1, MulAmt2);
25135 if (isPowerOf2_64(MulAmt1))
25136 NewMul = DAG.getNode(ISD::SHL, DL, VT, N->getOperand(0),
25137 DAG.getConstant(Log2_64(MulAmt1), DL, MVT::i8));
25139 NewMul = DAG.getNode(X86ISD::MUL_IMM, DL, VT, N->getOperand(0),
25140 DAG.getConstant(MulAmt1, DL, VT));
25142 if (isPowerOf2_64(MulAmt2))
25143 NewMul = DAG.getNode(ISD::SHL, DL, VT, NewMul,
25144 DAG.getConstant(Log2_64(MulAmt2), DL, MVT::i8));
25146 NewMul = DAG.getNode(X86ISD::MUL_IMM, DL, VT, NewMul,
25147 DAG.getConstant(MulAmt2, DL, VT));
25151 assert(MulAmt != 0 && MulAmt != (VT == MVT::i64 ? UINT64_MAX : UINT32_MAX)
25152 && "Both cases that could cause potential overflows should have "
25153 "already been handled.");
25154 if (isPowerOf2_64(MulAmt - 1))
25155 // (mul x, 2^N + 1) => (add (shl x, N), x)
25156 NewMul = DAG.getNode(ISD::ADD, DL, VT, N->getOperand(0),
25157 DAG.getNode(ISD::SHL, DL, VT, N->getOperand(0),
25158 DAG.getConstant(Log2_64(MulAmt - 1), DL,
25161 else if (isPowerOf2_64(MulAmt + 1))
25162 // (mul x, 2^N - 1) => (sub (shl x, N), x)
25163 NewMul = DAG.getNode(ISD::SUB, DL, VT, DAG.getNode(ISD::SHL, DL, VT,
25165 DAG.getConstant(Log2_64(MulAmt + 1),
25166 DL, MVT::i8)), N->getOperand(0));
25170 // Do not add new nodes to DAG combiner worklist.
25171 DCI.CombineTo(N, NewMul, false);
25176 static SDValue PerformSHLCombine(SDNode *N, SelectionDAG &DAG) {
25177 SDValue N0 = N->getOperand(0);
25178 SDValue N1 = N->getOperand(1);
25179 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1);
25180 EVT VT = N0.getValueType();
25182 // fold (shl (and (setcc_c), c1), c2) -> (and setcc_c, (c1 << c2))
25183 // since the result of setcc_c is all zero's or all ones.
25184 if (VT.isInteger() && !VT.isVector() &&
25185 N1C && N0.getOpcode() == ISD::AND &&
25186 N0.getOperand(1).getOpcode() == ISD::Constant) {
25187 SDValue N00 = N0.getOperand(0);
25188 APInt Mask = cast<ConstantSDNode>(N0.getOperand(1))->getAPIntValue();
25189 APInt ShAmt = N1C->getAPIntValue();
25190 Mask = Mask.shl(ShAmt);
25191 bool MaskOK = false;
25192 // We can handle cases concerning bit-widening nodes containing setcc_c if
25193 // we carefully interrogate the mask to make sure we are semantics
25195 // The transform is not safe if the result of C1 << C2 exceeds the bitwidth
25196 // of the underlying setcc_c operation if the setcc_c was zero extended.
25197 // Consider the following example:
25198 // zext(setcc_c) -> i32 0x0000FFFF
25199 // c1 -> i32 0x0000FFFF
25200 // c2 -> i32 0x00000001
25201 // (shl (and (setcc_c), c1), c2) -> i32 0x0001FFFE
25202 // (and setcc_c, (c1 << c2)) -> i32 0x0000FFFE
25203 if (N00.getOpcode() == X86ISD::SETCC_CARRY) {
25205 } else if (N00.getOpcode() == ISD::SIGN_EXTEND &&
25206 N00.getOperand(0).getOpcode() == X86ISD::SETCC_CARRY) {
25208 } else if ((N00.getOpcode() == ISD::ZERO_EXTEND ||
25209 N00.getOpcode() == ISD::ANY_EXTEND) &&
25210 N00.getOperand(0).getOpcode() == X86ISD::SETCC_CARRY) {
25211 MaskOK = Mask.isIntN(N00.getOperand(0).getValueSizeInBits());
25213 if (MaskOK && Mask != 0) {
25215 return DAG.getNode(ISD::AND, DL, VT, N00, DAG.getConstant(Mask, DL, VT));
25219 // Hardware support for vector shifts is sparse which makes us scalarize the
25220 // vector operations in many cases. Also, on sandybridge ADD is faster than
25222 // (shl V, 1) -> add V,V
25223 if (auto *N1BV = dyn_cast<BuildVectorSDNode>(N1))
25224 if (auto *N1SplatC = N1BV->getConstantSplatNode()) {
25225 assert(N0.getValueType().isVector() && "Invalid vector shift type");
25226 // We shift all of the values by one. In many cases we do not have
25227 // hardware support for this operation. This is better expressed as an ADD
25229 if (N1SplatC->getAPIntValue() == 1)
25230 return DAG.getNode(ISD::ADD, SDLoc(N), VT, N0, N0);
25236 static SDValue PerformSRACombine(SDNode *N, SelectionDAG &DAG) {
25237 SDValue N0 = N->getOperand(0);
25238 SDValue N1 = N->getOperand(1);
25239 EVT VT = N0.getValueType();
25240 unsigned Size = VT.getSizeInBits();
25242 // fold (ashr (shl, a, [56,48,32,24,16]), SarConst)
25243 // into (shl, (sext (a), [56,48,32,24,16] - SarConst)) or
25244 // into (lshr, (sext (a), SarConst - [56,48,32,24,16]))
25245 // depending on sign of (SarConst - [56,48,32,24,16])
25247 // sexts in X86 are MOVs. The MOVs have the same code size
25248 // as above SHIFTs (only SHIFT on 1 has lower code size).
25249 // However the MOVs have 2 advantages to a SHIFT:
25250 // 1. MOVs can write to a register that differs from source
25251 // 2. MOVs accept memory operands
25253 if (!VT.isInteger() || VT.isVector() || N1.getOpcode() != ISD::Constant ||
25254 N0.getOpcode() != ISD::SHL || !N0.hasOneUse() ||
25255 N0.getOperand(1).getOpcode() != ISD::Constant)
25258 SDValue N00 = N0.getOperand(0);
25259 SDValue N01 = N0.getOperand(1);
25260 APInt ShlConst = (cast<ConstantSDNode>(N01))->getAPIntValue();
25261 APInt SarConst = (cast<ConstantSDNode>(N1))->getAPIntValue();
25262 EVT CVT = N1.getValueType();
25264 if (SarConst.isNegative())
25267 for (MVT SVT : MVT::integer_valuetypes()) {
25268 unsigned ShiftSize = SVT.getSizeInBits();
25269 // skipping types without corresponding sext/zext and
25270 // ShlConst that is not one of [56,48,32,24,16]
25271 if (ShiftSize < 8 || ShiftSize > 64 || ShlConst != Size - ShiftSize)
25275 DAG.getNode(ISD::SIGN_EXTEND_INREG, DL, VT, N00, DAG.getValueType(SVT));
25276 SarConst = SarConst - (Size - ShiftSize);
25279 else if (SarConst.isNegative())
25280 return DAG.getNode(ISD::SHL, DL, VT, NN,
25281 DAG.getConstant(-SarConst, DL, CVT));
25283 return DAG.getNode(ISD::SRA, DL, VT, NN,
25284 DAG.getConstant(SarConst, DL, CVT));
25289 /// \brief Returns a vector of 0s if the node in input is a vector logical
25290 /// shift by a constant amount which is known to be bigger than or equal
25291 /// to the vector element size in bits.
25292 static SDValue performShiftToAllZeros(SDNode *N, SelectionDAG &DAG,
25293 const X86Subtarget *Subtarget) {
25294 EVT VT = N->getValueType(0);
25296 if (VT != MVT::v2i64 && VT != MVT::v4i32 && VT != MVT::v8i16 &&
25297 (!Subtarget->hasInt256() ||
25298 (VT != MVT::v4i64 && VT != MVT::v8i32 && VT != MVT::v16i16)))
25301 SDValue Amt = N->getOperand(1);
25303 if (auto *AmtBV = dyn_cast<BuildVectorSDNode>(Amt))
25304 if (auto *AmtSplat = AmtBV->getConstantSplatNode()) {
25305 APInt ShiftAmt = AmtSplat->getAPIntValue();
25306 unsigned MaxAmount =
25307 VT.getSimpleVT().getVectorElementType().getSizeInBits();
25309 // SSE2/AVX2 logical shifts always return a vector of 0s
25310 // if the shift amount is bigger than or equal to
25311 // the element size. The constant shift amount will be
25312 // encoded as a 8-bit immediate.
25313 if (ShiftAmt.trunc(8).uge(MaxAmount))
25314 return getZeroVector(VT.getSimpleVT(), Subtarget, DAG, DL);
25320 /// PerformShiftCombine - Combine shifts.
25321 static SDValue PerformShiftCombine(SDNode* N, SelectionDAG &DAG,
25322 TargetLowering::DAGCombinerInfo &DCI,
25323 const X86Subtarget *Subtarget) {
25324 if (N->getOpcode() == ISD::SHL)
25325 if (SDValue V = PerformSHLCombine(N, DAG))
25328 if (N->getOpcode() == ISD::SRA)
25329 if (SDValue V = PerformSRACombine(N, DAG))
25332 // Try to fold this logical shift into a zero vector.
25333 if (N->getOpcode() != ISD::SRA)
25334 if (SDValue V = performShiftToAllZeros(N, DAG, Subtarget))
25340 // CMPEQCombine - Recognize the distinctive (AND (setcc ...) (setcc ..))
25341 // where both setccs reference the same FP CMP, and rewrite for CMPEQSS
25342 // and friends. Likewise for OR -> CMPNEQSS.
25343 static SDValue CMPEQCombine(SDNode *N, SelectionDAG &DAG,
25344 TargetLowering::DAGCombinerInfo &DCI,
25345 const X86Subtarget *Subtarget) {
25348 // SSE1 supports CMP{eq|ne}SS, and SSE2 added CMP{eq|ne}SD, but
25349 // we're requiring SSE2 for both.
25350 if (Subtarget->hasSSE2() && isAndOrOfSetCCs(SDValue(N, 0U), opcode)) {
25351 SDValue N0 = N->getOperand(0);
25352 SDValue N1 = N->getOperand(1);
25353 SDValue CMP0 = N0->getOperand(1);
25354 SDValue CMP1 = N1->getOperand(1);
25357 // The SETCCs should both refer to the same CMP.
25358 if (CMP0.getOpcode() != X86ISD::CMP || CMP0 != CMP1)
25361 SDValue CMP00 = CMP0->getOperand(0);
25362 SDValue CMP01 = CMP0->getOperand(1);
25363 EVT VT = CMP00.getValueType();
25365 if (VT == MVT::f32 || VT == MVT::f64) {
25366 bool ExpectingFlags = false;
25367 // Check for any users that want flags:
25368 for (SDNode::use_iterator UI = N->use_begin(), UE = N->use_end();
25369 !ExpectingFlags && UI != UE; ++UI)
25370 switch (UI->getOpcode()) {
25375 ExpectingFlags = true;
25377 case ISD::CopyToReg:
25378 case ISD::SIGN_EXTEND:
25379 case ISD::ZERO_EXTEND:
25380 case ISD::ANY_EXTEND:
25384 if (!ExpectingFlags) {
25385 enum X86::CondCode cc0 = (enum X86::CondCode)N0.getConstantOperandVal(0);
25386 enum X86::CondCode cc1 = (enum X86::CondCode)N1.getConstantOperandVal(0);
25388 if (cc1 == X86::COND_E || cc1 == X86::COND_NE) {
25389 X86::CondCode tmp = cc0;
25394 if ((cc0 == X86::COND_E && cc1 == X86::COND_NP) ||
25395 (cc0 == X86::COND_NE && cc1 == X86::COND_P)) {
25396 // FIXME: need symbolic constants for these magic numbers.
25397 // See X86ATTInstPrinter.cpp:printSSECC().
25398 unsigned x86cc = (cc0 == X86::COND_E) ? 0 : 4;
25399 if (Subtarget->hasAVX512()) {
25400 SDValue FSetCC = DAG.getNode(X86ISD::FSETCC, DL, MVT::i1, CMP00,
25402 DAG.getConstant(x86cc, DL, MVT::i8));
25403 if (N->getValueType(0) != MVT::i1)
25404 return DAG.getNode(ISD::ZERO_EXTEND, DL, N->getValueType(0),
25408 SDValue OnesOrZeroesF = DAG.getNode(X86ISD::FSETCC, DL,
25409 CMP00.getValueType(), CMP00, CMP01,
25410 DAG.getConstant(x86cc, DL,
25413 bool is64BitFP = (CMP00.getValueType() == MVT::f64);
25414 MVT IntVT = is64BitFP ? MVT::i64 : MVT::i32;
25416 if (is64BitFP && !Subtarget->is64Bit()) {
25417 // On a 32-bit target, we cannot bitcast the 64-bit float to a
25418 // 64-bit integer, since that's not a legal type. Since
25419 // OnesOrZeroesF is all ones of all zeroes, we don't need all the
25420 // bits, but can do this little dance to extract the lowest 32 bits
25421 // and work with those going forward.
25422 SDValue Vector64 = DAG.getNode(ISD::SCALAR_TO_VECTOR, DL, MVT::v2f64,
25424 SDValue Vector32 = DAG.getBitcast(MVT::v4f32, Vector64);
25425 OnesOrZeroesF = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, DL, MVT::f32,
25426 Vector32, DAG.getIntPtrConstant(0, DL));
25430 SDValue OnesOrZeroesI = DAG.getBitcast(IntVT, OnesOrZeroesF);
25431 SDValue ANDed = DAG.getNode(ISD::AND, DL, IntVT, OnesOrZeroesI,
25432 DAG.getConstant(1, DL, IntVT));
25433 SDValue OneBitOfTruth = DAG.getNode(ISD::TRUNCATE, DL, MVT::i8,
25435 return OneBitOfTruth;
25443 /// CanFoldXORWithAllOnes - Test whether the XOR operand is a AllOnes vector
25444 /// so it can be folded inside ANDNP.
25445 static bool CanFoldXORWithAllOnes(const SDNode *N) {
25446 EVT VT = N->getValueType(0);
25448 // Match direct AllOnes for 128 and 256-bit vectors
25449 if (ISD::isBuildVectorAllOnes(N))
25452 // Look through a bit convert.
25453 if (N->getOpcode() == ISD::BITCAST)
25454 N = N->getOperand(0).getNode();
25456 // Sometimes the operand may come from a insert_subvector building a 256-bit
25458 if (VT.is256BitVector() &&
25459 N->getOpcode() == ISD::INSERT_SUBVECTOR) {
25460 SDValue V1 = N->getOperand(0);
25461 SDValue V2 = N->getOperand(1);
25463 if (V1.getOpcode() == ISD::INSERT_SUBVECTOR &&
25464 V1.getOperand(0).getOpcode() == ISD::UNDEF &&
25465 ISD::isBuildVectorAllOnes(V1.getOperand(1).getNode()) &&
25466 ISD::isBuildVectorAllOnes(V2.getNode()))
25473 // On AVX/AVX2 the type v8i1 is legalized to v8i16, which is an XMM sized
25474 // register. In most cases we actually compare or select YMM-sized registers
25475 // and mixing the two types creates horrible code. This method optimizes
25476 // some of the transition sequences.
25477 static SDValue WidenMaskArithmetic(SDNode *N, SelectionDAG &DAG,
25478 TargetLowering::DAGCombinerInfo &DCI,
25479 const X86Subtarget *Subtarget) {
25480 EVT VT = N->getValueType(0);
25481 if (!VT.is256BitVector())
25484 assert((N->getOpcode() == ISD::ANY_EXTEND ||
25485 N->getOpcode() == ISD::ZERO_EXTEND ||
25486 N->getOpcode() == ISD::SIGN_EXTEND) && "Invalid Node");
25488 SDValue Narrow = N->getOperand(0);
25489 EVT NarrowVT = Narrow->getValueType(0);
25490 if (!NarrowVT.is128BitVector())
25493 if (Narrow->getOpcode() != ISD::XOR &&
25494 Narrow->getOpcode() != ISD::AND &&
25495 Narrow->getOpcode() != ISD::OR)
25498 SDValue N0 = Narrow->getOperand(0);
25499 SDValue N1 = Narrow->getOperand(1);
25502 // The Left side has to be a trunc.
25503 if (N0.getOpcode() != ISD::TRUNCATE)
25506 // The type of the truncated inputs.
25507 EVT WideVT = N0->getOperand(0)->getValueType(0);
25511 // The right side has to be a 'trunc' or a constant vector.
25512 bool RHSTrunc = N1.getOpcode() == ISD::TRUNCATE;
25513 ConstantSDNode *RHSConstSplat = nullptr;
25514 if (auto *RHSBV = dyn_cast<BuildVectorSDNode>(N1))
25515 RHSConstSplat = RHSBV->getConstantSplatNode();
25516 if (!RHSTrunc && !RHSConstSplat)
25519 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
25521 if (!TLI.isOperationLegalOrPromote(Narrow->getOpcode(), WideVT))
25524 // Set N0 and N1 to hold the inputs to the new wide operation.
25525 N0 = N0->getOperand(0);
25526 if (RHSConstSplat) {
25527 N1 = DAG.getNode(ISD::ZERO_EXTEND, DL, WideVT.getVectorElementType(),
25528 SDValue(RHSConstSplat, 0));
25529 SmallVector<SDValue, 8> C(WideVT.getVectorNumElements(), N1);
25530 N1 = DAG.getNode(ISD::BUILD_VECTOR, DL, WideVT, C);
25531 } else if (RHSTrunc) {
25532 N1 = N1->getOperand(0);
25535 // Generate the wide operation.
25536 SDValue Op = DAG.getNode(Narrow->getOpcode(), DL, WideVT, N0, N1);
25537 unsigned Opcode = N->getOpcode();
25539 case ISD::ANY_EXTEND:
25541 case ISD::ZERO_EXTEND: {
25542 unsigned InBits = NarrowVT.getScalarSizeInBits();
25543 APInt Mask = APInt::getAllOnesValue(InBits);
25544 Mask = Mask.zext(VT.getScalarSizeInBits());
25545 return DAG.getNode(ISD::AND, DL, VT,
25546 Op, DAG.getConstant(Mask, DL, VT));
25548 case ISD::SIGN_EXTEND:
25549 return DAG.getNode(ISD::SIGN_EXTEND_INREG, DL, VT,
25550 Op, DAG.getValueType(NarrowVT));
25552 llvm_unreachable("Unexpected opcode");
25556 static SDValue VectorZextCombine(SDNode *N, SelectionDAG &DAG,
25557 TargetLowering::DAGCombinerInfo &DCI,
25558 const X86Subtarget *Subtarget) {
25559 SDValue N0 = N->getOperand(0);
25560 SDValue N1 = N->getOperand(1);
25563 // A vector zext_in_reg may be represented as a shuffle,
25564 // feeding into a bitcast (this represents anyext) feeding into
25565 // an and with a mask.
25566 // We'd like to try to combine that into a shuffle with zero
25567 // plus a bitcast, removing the and.
25568 if (N0.getOpcode() != ISD::BITCAST ||
25569 N0.getOperand(0).getOpcode() != ISD::VECTOR_SHUFFLE)
25572 // The other side of the AND should be a splat of 2^C, where C
25573 // is the number of bits in the source type.
25574 if (N1.getOpcode() == ISD::BITCAST)
25575 N1 = N1.getOperand(0);
25576 if (N1.getOpcode() != ISD::BUILD_VECTOR)
25578 BuildVectorSDNode *Vector = cast<BuildVectorSDNode>(N1);
25580 ShuffleVectorSDNode *Shuffle = cast<ShuffleVectorSDNode>(N0.getOperand(0));
25581 EVT SrcType = Shuffle->getValueType(0);
25583 // We expect a single-source shuffle
25584 if (Shuffle->getOperand(1)->getOpcode() != ISD::UNDEF)
25587 unsigned SrcSize = SrcType.getScalarSizeInBits();
25589 APInt SplatValue, SplatUndef;
25590 unsigned SplatBitSize;
25592 if (!Vector->isConstantSplat(SplatValue, SplatUndef,
25593 SplatBitSize, HasAnyUndefs))
25596 unsigned ResSize = N1.getValueType().getScalarSizeInBits();
25597 // Make sure the splat matches the mask we expect
25598 if (SplatBitSize > ResSize ||
25599 (SplatValue + 1).exactLogBase2() != (int)SrcSize)
25602 // Make sure the input and output size make sense
25603 if (SrcSize >= ResSize || ResSize % SrcSize)
25606 // We expect a shuffle of the form <0, u, u, u, 1, u, u, u...>
25607 // The number of u's between each two values depends on the ratio between
25608 // the source and dest type.
25609 unsigned ZextRatio = ResSize / SrcSize;
25610 bool IsZext = true;
25611 for (unsigned i = 0; i < SrcType.getVectorNumElements(); ++i) {
25612 if (i % ZextRatio) {
25613 if (Shuffle->getMaskElt(i) > 0) {
25619 if (Shuffle->getMaskElt(i) != (int)(i / ZextRatio)) {
25620 // Expected element number
25630 // Ok, perform the transformation - replace the shuffle with
25631 // a shuffle of the form <0, k, k, k, 1, k, k, k> with zero
25632 // (instead of undef) where the k elements come from the zero vector.
25633 SmallVector<int, 8> Mask;
25634 unsigned NumElems = SrcType.getVectorNumElements();
25635 for (unsigned i = 0; i < NumElems; ++i)
25637 Mask.push_back(NumElems);
25639 Mask.push_back(i / ZextRatio);
25641 SDValue NewShuffle = DAG.getVectorShuffle(Shuffle->getValueType(0), DL,
25642 Shuffle->getOperand(0), DAG.getConstant(0, DL, SrcType), Mask);
25643 return DAG.getBitcast(N0.getValueType(), NewShuffle);
25646 /// If both input operands of a logic op are being cast from floating point
25647 /// types, try to convert this into a floating point logic node to avoid
25648 /// unnecessary moves from SSE to integer registers.
25649 static SDValue convertIntLogicToFPLogic(SDNode *N, SelectionDAG &DAG,
25650 const X86Subtarget *Subtarget) {
25651 unsigned FPOpcode = ISD::DELETED_NODE;
25652 if (N->getOpcode() == ISD::AND)
25653 FPOpcode = X86ISD::FAND;
25654 else if (N->getOpcode() == ISD::OR)
25655 FPOpcode = X86ISD::FOR;
25656 else if (N->getOpcode() == ISD::XOR)
25657 FPOpcode = X86ISD::FXOR;
25659 assert(FPOpcode != ISD::DELETED_NODE &&
25660 "Unexpected input node for FP logic conversion");
25662 EVT VT = N->getValueType(0);
25663 SDValue N0 = N->getOperand(0);
25664 SDValue N1 = N->getOperand(1);
25666 if (N0.getOpcode() == ISD::BITCAST && N1.getOpcode() == ISD::BITCAST &&
25667 ((Subtarget->hasSSE1() && VT == MVT::i32) ||
25668 (Subtarget->hasSSE2() && VT == MVT::i64))) {
25669 SDValue N00 = N0.getOperand(0);
25670 SDValue N10 = N1.getOperand(0);
25671 EVT N00Type = N00.getValueType();
25672 EVT N10Type = N10.getValueType();
25673 if (N00Type.isFloatingPoint() && N10Type.isFloatingPoint()) {
25674 SDValue FPLogic = DAG.getNode(FPOpcode, DL, N00Type, N00, N10);
25675 return DAG.getBitcast(VT, FPLogic);
25681 static SDValue PerformAndCombine(SDNode *N, SelectionDAG &DAG,
25682 TargetLowering::DAGCombinerInfo &DCI,
25683 const X86Subtarget *Subtarget) {
25684 if (DCI.isBeforeLegalizeOps())
25687 if (SDValue Zext = VectorZextCombine(N, DAG, DCI, Subtarget))
25690 if (SDValue R = CMPEQCombine(N, DAG, DCI, Subtarget))
25693 if (SDValue FPLogic = convertIntLogicToFPLogic(N, DAG, Subtarget))
25696 EVT VT = N->getValueType(0);
25697 SDValue N0 = N->getOperand(0);
25698 SDValue N1 = N->getOperand(1);
25701 // Create BEXTR instructions
25702 // BEXTR is ((X >> imm) & (2**size-1))
25703 if (VT == MVT::i32 || VT == MVT::i64) {
25704 // Check for BEXTR.
25705 if ((Subtarget->hasBMI() || Subtarget->hasTBM()) &&
25706 (N0.getOpcode() == ISD::SRA || N0.getOpcode() == ISD::SRL)) {
25707 ConstantSDNode *MaskNode = dyn_cast<ConstantSDNode>(N1);
25708 ConstantSDNode *ShiftNode = dyn_cast<ConstantSDNode>(N0.getOperand(1));
25709 if (MaskNode && ShiftNode) {
25710 uint64_t Mask = MaskNode->getZExtValue();
25711 uint64_t Shift = ShiftNode->getZExtValue();
25712 if (isMask_64(Mask)) {
25713 uint64_t MaskSize = countPopulation(Mask);
25714 if (Shift + MaskSize <= VT.getSizeInBits())
25715 return DAG.getNode(X86ISD::BEXTR, DL, VT, N0.getOperand(0),
25716 DAG.getConstant(Shift | (MaskSize << 8), DL,
25725 // Want to form ANDNP nodes:
25726 // 1) In the hopes of then easily combining them with OR and AND nodes
25727 // to form PBLEND/PSIGN.
25728 // 2) To match ANDN packed intrinsics
25729 if (VT != MVT::v2i64 && VT != MVT::v4i64)
25732 // Check LHS for vnot
25733 if (N0.getOpcode() == ISD::XOR &&
25734 //ISD::isBuildVectorAllOnes(N0.getOperand(1).getNode()))
25735 CanFoldXORWithAllOnes(N0.getOperand(1).getNode()))
25736 return DAG.getNode(X86ISD::ANDNP, DL, VT, N0.getOperand(0), N1);
25738 // Check RHS for vnot
25739 if (N1.getOpcode() == ISD::XOR &&
25740 //ISD::isBuildVectorAllOnes(N1.getOperand(1).getNode()))
25741 CanFoldXORWithAllOnes(N1.getOperand(1).getNode()))
25742 return DAG.getNode(X86ISD::ANDNP, DL, VT, N1.getOperand(0), N0);
25747 static SDValue PerformOrCombine(SDNode *N, SelectionDAG &DAG,
25748 TargetLowering::DAGCombinerInfo &DCI,
25749 const X86Subtarget *Subtarget) {
25750 if (DCI.isBeforeLegalizeOps())
25753 if (SDValue R = CMPEQCombine(N, DAG, DCI, Subtarget))
25756 if (SDValue FPLogic = convertIntLogicToFPLogic(N, DAG, Subtarget))
25759 SDValue N0 = N->getOperand(0);
25760 SDValue N1 = N->getOperand(1);
25761 EVT VT = N->getValueType(0);
25763 // look for psign/blend
25764 if (VT == MVT::v2i64 || VT == MVT::v4i64) {
25765 if (!Subtarget->hasSSSE3() ||
25766 (VT == MVT::v4i64 && !Subtarget->hasInt256()))
25769 // Canonicalize pandn to RHS
25770 if (N0.getOpcode() == X86ISD::ANDNP)
25772 // or (and (m, y), (pandn m, x))
25773 if (N0.getOpcode() == ISD::AND && N1.getOpcode() == X86ISD::ANDNP) {
25774 SDValue Mask = N1.getOperand(0);
25775 SDValue X = N1.getOperand(1);
25777 if (N0.getOperand(0) == Mask)
25778 Y = N0.getOperand(1);
25779 if (N0.getOperand(1) == Mask)
25780 Y = N0.getOperand(0);
25782 // Check to see if the mask appeared in both the AND and ANDNP and
25786 // Validate that X, Y, and Mask are BIT_CONVERTS, and see through them.
25787 // Look through mask bitcast.
25788 if (Mask.getOpcode() == ISD::BITCAST)
25789 Mask = Mask.getOperand(0);
25790 if (X.getOpcode() == ISD::BITCAST)
25791 X = X.getOperand(0);
25792 if (Y.getOpcode() == ISD::BITCAST)
25793 Y = Y.getOperand(0);
25795 EVT MaskVT = Mask.getValueType();
25797 // Validate that the Mask operand is a vector sra node.
25798 // FIXME: what to do for bytes, since there is a psignb/pblendvb, but
25799 // there is no psrai.b
25800 unsigned EltBits = MaskVT.getVectorElementType().getSizeInBits();
25801 unsigned SraAmt = ~0;
25802 if (Mask.getOpcode() == ISD::SRA) {
25803 if (auto *AmtBV = dyn_cast<BuildVectorSDNode>(Mask.getOperand(1)))
25804 if (auto *AmtConst = AmtBV->getConstantSplatNode())
25805 SraAmt = AmtConst->getZExtValue();
25806 } else if (Mask.getOpcode() == X86ISD::VSRAI) {
25807 SDValue SraC = Mask.getOperand(1);
25808 SraAmt = cast<ConstantSDNode>(SraC)->getZExtValue();
25810 if ((SraAmt + 1) != EltBits)
25815 // Now we know we at least have a plendvb with the mask val. See if
25816 // we can form a psignb/w/d.
25817 // psign = x.type == y.type == mask.type && y = sub(0, x);
25818 if (Y.getOpcode() == ISD::SUB && Y.getOperand(1) == X &&
25819 ISD::isBuildVectorAllZeros(Y.getOperand(0).getNode()) &&
25820 X.getValueType() == MaskVT && Y.getValueType() == MaskVT) {
25821 assert((EltBits == 8 || EltBits == 16 || EltBits == 32) &&
25822 "Unsupported VT for PSIGN");
25823 Mask = DAG.getNode(X86ISD::PSIGN, DL, MaskVT, X, Mask.getOperand(0));
25824 return DAG.getBitcast(VT, Mask);
25826 // PBLENDVB only available on SSE 4.1
25827 if (!Subtarget->hasSSE41())
25830 MVT BlendVT = (VT == MVT::v4i64) ? MVT::v32i8 : MVT::v16i8;
25832 X = DAG.getBitcast(BlendVT, X);
25833 Y = DAG.getBitcast(BlendVT, Y);
25834 Mask = DAG.getBitcast(BlendVT, Mask);
25835 Mask = DAG.getNode(ISD::VSELECT, DL, BlendVT, Mask, Y, X);
25836 return DAG.getBitcast(VT, Mask);
25840 if (VT != MVT::i16 && VT != MVT::i32 && VT != MVT::i64)
25843 // fold (or (x << c) | (y >> (64 - c))) ==> (shld64 x, y, c)
25844 bool OptForSize = DAG.getMachineFunction().getFunction()->optForSize();
25846 // SHLD/SHRD instructions have lower register pressure, but on some
25847 // platforms they have higher latency than the equivalent
25848 // series of shifts/or that would otherwise be generated.
25849 // Don't fold (or (x << c) | (y >> (64 - c))) if SHLD/SHRD instructions
25850 // have higher latencies and we are not optimizing for size.
25851 if (!OptForSize && Subtarget->isSHLDSlow())
25854 if (N0.getOpcode() == ISD::SRL && N1.getOpcode() == ISD::SHL)
25856 if (N0.getOpcode() != ISD::SHL || N1.getOpcode() != ISD::SRL)
25858 if (!N0.hasOneUse() || !N1.hasOneUse())
25861 SDValue ShAmt0 = N0.getOperand(1);
25862 if (ShAmt0.getValueType() != MVT::i8)
25864 SDValue ShAmt1 = N1.getOperand(1);
25865 if (ShAmt1.getValueType() != MVT::i8)
25867 if (ShAmt0.getOpcode() == ISD::TRUNCATE)
25868 ShAmt0 = ShAmt0.getOperand(0);
25869 if (ShAmt1.getOpcode() == ISD::TRUNCATE)
25870 ShAmt1 = ShAmt1.getOperand(0);
25873 unsigned Opc = X86ISD::SHLD;
25874 SDValue Op0 = N0.getOperand(0);
25875 SDValue Op1 = N1.getOperand(0);
25876 if (ShAmt0.getOpcode() == ISD::SUB) {
25877 Opc = X86ISD::SHRD;
25878 std::swap(Op0, Op1);
25879 std::swap(ShAmt0, ShAmt1);
25882 unsigned Bits = VT.getSizeInBits();
25883 if (ShAmt1.getOpcode() == ISD::SUB) {
25884 SDValue Sum = ShAmt1.getOperand(0);
25885 if (ConstantSDNode *SumC = dyn_cast<ConstantSDNode>(Sum)) {
25886 SDValue ShAmt1Op1 = ShAmt1.getOperand(1);
25887 if (ShAmt1Op1.getNode()->getOpcode() == ISD::TRUNCATE)
25888 ShAmt1Op1 = ShAmt1Op1.getOperand(0);
25889 if (SumC->getSExtValue() == Bits && ShAmt1Op1 == ShAmt0)
25890 return DAG.getNode(Opc, DL, VT,
25892 DAG.getNode(ISD::TRUNCATE, DL,
25895 } else if (ConstantSDNode *ShAmt1C = dyn_cast<ConstantSDNode>(ShAmt1)) {
25896 ConstantSDNode *ShAmt0C = dyn_cast<ConstantSDNode>(ShAmt0);
25898 ShAmt0C->getSExtValue() + ShAmt1C->getSExtValue() == Bits)
25899 return DAG.getNode(Opc, DL, VT,
25900 N0.getOperand(0), N1.getOperand(0),
25901 DAG.getNode(ISD::TRUNCATE, DL,
25908 // Generate NEG and CMOV for integer abs.
25909 static SDValue performIntegerAbsCombine(SDNode *N, SelectionDAG &DAG) {
25910 EVT VT = N->getValueType(0);
25912 // Since X86 does not have CMOV for 8-bit integer, we don't convert
25913 // 8-bit integer abs to NEG and CMOV.
25914 if (VT.isInteger() && VT.getSizeInBits() == 8)
25917 SDValue N0 = N->getOperand(0);
25918 SDValue N1 = N->getOperand(1);
25921 // Check pattern of XOR(ADD(X,Y), Y) where Y is SRA(X, size(X)-1)
25922 // and change it to SUB and CMOV.
25923 if (VT.isInteger() && N->getOpcode() == ISD::XOR &&
25924 N0.getOpcode() == ISD::ADD &&
25925 N0.getOperand(1) == N1 &&
25926 N1.getOpcode() == ISD::SRA &&
25927 N1.getOperand(0) == N0.getOperand(0))
25928 if (ConstantSDNode *Y1C = dyn_cast<ConstantSDNode>(N1.getOperand(1)))
25929 if (Y1C->getAPIntValue() == VT.getSizeInBits()-1) {
25930 // Generate SUB & CMOV.
25931 SDValue Neg = DAG.getNode(X86ISD::SUB, DL, DAG.getVTList(VT, MVT::i32),
25932 DAG.getConstant(0, DL, VT), N0.getOperand(0));
25934 SDValue Ops[] = { N0.getOperand(0), Neg,
25935 DAG.getConstant(X86::COND_GE, DL, MVT::i8),
25936 SDValue(Neg.getNode(), 1) };
25937 return DAG.getNode(X86ISD::CMOV, DL, DAG.getVTList(VT, MVT::Glue), Ops);
25942 // Try to turn tests against the signbit in the form of:
25943 // XOR(TRUNCATE(SRL(X, size(X)-1)), 1)
25946 static SDValue foldXorTruncShiftIntoCmp(SDNode *N, SelectionDAG &DAG) {
25947 // This is only worth doing if the output type is i8.
25948 if (N->getValueType(0) != MVT::i8)
25951 SDValue N0 = N->getOperand(0);
25952 SDValue N1 = N->getOperand(1);
25954 // We should be performing an xor against a truncated shift.
25955 if (N0.getOpcode() != ISD::TRUNCATE || !N0.hasOneUse())
25958 // Make sure we are performing an xor against one.
25959 if (!isOneConstant(N1))
25962 // SetCC on x86 zero extends so only act on this if it's a logical shift.
25963 SDValue Shift = N0.getOperand(0);
25964 if (Shift.getOpcode() != ISD::SRL || !Shift.hasOneUse())
25967 // Make sure we are truncating from one of i16, i32 or i64.
25968 EVT ShiftTy = Shift.getValueType();
25969 if (ShiftTy != MVT::i16 && ShiftTy != MVT::i32 && ShiftTy != MVT::i64)
25972 // Make sure the shift amount extracts the sign bit.
25973 if (!isa<ConstantSDNode>(Shift.getOperand(1)) ||
25974 Shift.getConstantOperandVal(1) != ShiftTy.getSizeInBits() - 1)
25977 // Create a greater-than comparison against -1.
25978 // N.B. Using SETGE against 0 works but we want a canonical looking
25979 // comparison, using SETGT matches up with what TranslateX86CC.
25981 SDValue ShiftOp = Shift.getOperand(0);
25982 EVT ShiftOpTy = ShiftOp.getValueType();
25983 SDValue Cond = DAG.getSetCC(DL, MVT::i8, ShiftOp,
25984 DAG.getConstant(-1, DL, ShiftOpTy), ISD::SETGT);
25988 static SDValue PerformXorCombine(SDNode *N, SelectionDAG &DAG,
25989 TargetLowering::DAGCombinerInfo &DCI,
25990 const X86Subtarget *Subtarget) {
25991 if (DCI.isBeforeLegalizeOps())
25994 if (SDValue RV = foldXorTruncShiftIntoCmp(N, DAG))
25997 if (Subtarget->hasCMov())
25998 if (SDValue RV = performIntegerAbsCombine(N, DAG))
26001 if (SDValue FPLogic = convertIntLogicToFPLogic(N, DAG, Subtarget))
26007 /// This function detects the AVG pattern between vectors of unsigned i8/i16,
26008 /// which is c = (a + b + 1) / 2, and replace this operation with the efficient
26009 /// X86ISD::AVG instruction.
26010 static SDValue detectAVGPattern(SDValue In, EVT VT, SelectionDAG &DAG,
26011 const X86Subtarget *Subtarget, SDLoc DL) {
26012 if (!VT.isVector() || !VT.isSimple())
26014 EVT InVT = In.getValueType();
26015 unsigned NumElems = VT.getVectorNumElements();
26017 EVT ScalarVT = VT.getVectorElementType();
26018 if (!((ScalarVT == MVT::i8 || ScalarVT == MVT::i16) &&
26019 isPowerOf2_32(NumElems)))
26022 // InScalarVT is the intermediate type in AVG pattern and it should be greater
26023 // than the original input type (i8/i16).
26024 EVT InScalarVT = InVT.getVectorElementType();
26025 if (InScalarVT.getSizeInBits() <= ScalarVT.getSizeInBits())
26028 if (Subtarget->hasAVX512()) {
26029 if (VT.getSizeInBits() > 512)
26031 } else if (Subtarget->hasAVX2()) {
26032 if (VT.getSizeInBits() > 256)
26035 if (VT.getSizeInBits() > 128)
26039 // Detect the following pattern:
26041 // %1 = zext <N x i8> %a to <N x i32>
26042 // %2 = zext <N x i8> %b to <N x i32>
26043 // %3 = add nuw nsw <N x i32> %1, <i32 1 x N>
26044 // %4 = add nuw nsw <N x i32> %3, %2
26045 // %5 = lshr <N x i32> %N, <i32 1 x N>
26046 // %6 = trunc <N x i32> %5 to <N x i8>
26048 // In AVX512, the last instruction can also be a trunc store.
26050 if (In.getOpcode() != ISD::SRL)
26053 // A lambda checking the given SDValue is a constant vector and each element
26054 // is in the range [Min, Max].
26055 auto IsConstVectorInRange = [](SDValue V, unsigned Min, unsigned Max) {
26056 BuildVectorSDNode *BV = dyn_cast<BuildVectorSDNode>(V);
26057 if (!BV || !BV->isConstant())
26059 for (unsigned i = 0, e = V.getNumOperands(); i < e; i++) {
26060 ConstantSDNode *C = dyn_cast<ConstantSDNode>(V.getOperand(i));
26063 uint64_t Val = C->getZExtValue();
26064 if (Val < Min || Val > Max)
26070 // Check if each element of the vector is left-shifted by one.
26071 auto LHS = In.getOperand(0);
26072 auto RHS = In.getOperand(1);
26073 if (!IsConstVectorInRange(RHS, 1, 1))
26075 if (LHS.getOpcode() != ISD::ADD)
26078 // Detect a pattern of a + b + 1 where the order doesn't matter.
26079 SDValue Operands[3];
26080 Operands[0] = LHS.getOperand(0);
26081 Operands[1] = LHS.getOperand(1);
26083 // Take care of the case when one of the operands is a constant vector whose
26084 // element is in the range [1, 256].
26085 if (IsConstVectorInRange(Operands[1], 1, ScalarVT == MVT::i8 ? 256 : 65536) &&
26086 Operands[0].getOpcode() == ISD::ZERO_EXTEND &&
26087 Operands[0].getOperand(0).getValueType() == VT) {
26088 // The pattern is detected. Subtract one from the constant vector, then
26089 // demote it and emit X86ISD::AVG instruction.
26090 SDValue One = DAG.getConstant(1, DL, InScalarVT);
26091 SDValue Ones = DAG.getNode(ISD::BUILD_VECTOR, DL, InVT,
26092 SmallVector<SDValue, 8>(NumElems, One));
26093 Operands[1] = DAG.getNode(ISD::SUB, DL, InVT, Operands[1], Ones);
26094 Operands[1] = DAG.getNode(ISD::TRUNCATE, DL, VT, Operands[1]);
26095 return DAG.getNode(X86ISD::AVG, DL, VT, Operands[0].getOperand(0),
26099 if (Operands[0].getOpcode() == ISD::ADD)
26100 std::swap(Operands[0], Operands[1]);
26101 else if (Operands[1].getOpcode() != ISD::ADD)
26103 Operands[2] = Operands[1].getOperand(0);
26104 Operands[1] = Operands[1].getOperand(1);
26106 // Now we have three operands of two additions. Check that one of them is a
26107 // constant vector with ones, and the other two are promoted from i8/i16.
26108 for (int i = 0; i < 3; ++i) {
26109 if (!IsConstVectorInRange(Operands[i], 1, 1))
26111 std::swap(Operands[i], Operands[2]);
26113 // Check if Operands[0] and Operands[1] are results of type promotion.
26114 for (int j = 0; j < 2; ++j)
26115 if (Operands[j].getOpcode() != ISD::ZERO_EXTEND ||
26116 Operands[j].getOperand(0).getValueType() != VT)
26119 // The pattern is detected, emit X86ISD::AVG instruction.
26120 return DAG.getNode(X86ISD::AVG, DL, VT, Operands[0].getOperand(0),
26121 Operands[1].getOperand(0));
26127 /// PerformLOADCombine - Do target-specific dag combines on LOAD nodes.
26128 static SDValue PerformLOADCombine(SDNode *N, SelectionDAG &DAG,
26129 TargetLowering::DAGCombinerInfo &DCI,
26130 const X86Subtarget *Subtarget) {
26131 LoadSDNode *Ld = cast<LoadSDNode>(N);
26132 EVT RegVT = Ld->getValueType(0);
26133 EVT MemVT = Ld->getMemoryVT();
26135 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
26137 // For chips with slow 32-byte unaligned loads, break the 32-byte operation
26138 // into two 16-byte operations.
26139 ISD::LoadExtType Ext = Ld->getExtensionType();
26141 unsigned AddressSpace = Ld->getAddressSpace();
26142 unsigned Alignment = Ld->getAlignment();
26143 if (RegVT.is256BitVector() && !DCI.isBeforeLegalizeOps() &&
26144 Ext == ISD::NON_EXTLOAD &&
26145 TLI.allowsMemoryAccess(*DAG.getContext(), DAG.getDataLayout(), RegVT,
26146 AddressSpace, Alignment, &Fast) && !Fast) {
26147 unsigned NumElems = RegVT.getVectorNumElements();
26151 SDValue Ptr = Ld->getBasePtr();
26152 SDValue Increment =
26153 DAG.getConstant(16, dl, TLI.getPointerTy(DAG.getDataLayout()));
26155 EVT HalfVT = EVT::getVectorVT(*DAG.getContext(), MemVT.getScalarType(),
26157 SDValue Load1 = DAG.getLoad(HalfVT, dl, Ld->getChain(), Ptr,
26158 Ld->getPointerInfo(), Ld->isVolatile(),
26159 Ld->isNonTemporal(), Ld->isInvariant(),
26161 Ptr = DAG.getNode(ISD::ADD, dl, Ptr.getValueType(), Ptr, Increment);
26162 SDValue Load2 = DAG.getLoad(HalfVT, dl, Ld->getChain(), Ptr,
26163 Ld->getPointerInfo(), Ld->isVolatile(),
26164 Ld->isNonTemporal(), Ld->isInvariant(),
26165 std::min(16U, Alignment));
26166 SDValue TF = DAG.getNode(ISD::TokenFactor, dl, MVT::Other,
26168 Load2.getValue(1));
26170 SDValue NewVec = DAG.getUNDEF(RegVT);
26171 NewVec = Insert128BitVector(NewVec, Load1, 0, DAG, dl);
26172 NewVec = Insert128BitVector(NewVec, Load2, NumElems/2, DAG, dl);
26173 return DCI.CombineTo(N, NewVec, TF, true);
26179 /// PerformMLOADCombine - Resolve extending loads
26180 static SDValue PerformMLOADCombine(SDNode *N, SelectionDAG &DAG,
26181 TargetLowering::DAGCombinerInfo &DCI,
26182 const X86Subtarget *Subtarget) {
26183 MaskedLoadSDNode *Mld = cast<MaskedLoadSDNode>(N);
26184 if (Mld->getExtensionType() != ISD::SEXTLOAD)
26187 EVT VT = Mld->getValueType(0);
26188 unsigned NumElems = VT.getVectorNumElements();
26189 EVT LdVT = Mld->getMemoryVT();
26192 assert(LdVT != VT && "Cannot extend to the same type");
26193 unsigned ToSz = VT.getVectorElementType().getSizeInBits();
26194 unsigned FromSz = LdVT.getVectorElementType().getSizeInBits();
26195 // From, To sizes and ElemCount must be pow of two
26196 assert (isPowerOf2_32(NumElems * FromSz * ToSz) &&
26197 "Unexpected size for extending masked load");
26199 unsigned SizeRatio = ToSz / FromSz;
26200 assert(SizeRatio * NumElems * FromSz == VT.getSizeInBits());
26202 // Create a type on which we perform the shuffle
26203 EVT WideVecVT = EVT::getVectorVT(*DAG.getContext(),
26204 LdVT.getScalarType(), NumElems*SizeRatio);
26205 assert(WideVecVT.getSizeInBits() == VT.getSizeInBits());
26207 // Convert Src0 value
26208 SDValue WideSrc0 = DAG.getBitcast(WideVecVT, Mld->getSrc0());
26209 if (Mld->getSrc0().getOpcode() != ISD::UNDEF) {
26210 SmallVector<int, 16> ShuffleVec(NumElems * SizeRatio, -1);
26211 for (unsigned i = 0; i != NumElems; ++i)
26212 ShuffleVec[i] = i * SizeRatio;
26214 // Can't shuffle using an illegal type.
26215 assert(DAG.getTargetLoweringInfo().isTypeLegal(WideVecVT) &&
26216 "WideVecVT should be legal");
26217 WideSrc0 = DAG.getVectorShuffle(WideVecVT, dl, WideSrc0,
26218 DAG.getUNDEF(WideVecVT), &ShuffleVec[0]);
26220 // Prepare the new mask
26222 SDValue Mask = Mld->getMask();
26223 if (Mask.getValueType() == VT) {
26224 // Mask and original value have the same type
26225 NewMask = DAG.getBitcast(WideVecVT, Mask);
26226 SmallVector<int, 16> ShuffleVec(NumElems * SizeRatio, -1);
26227 for (unsigned i = 0; i != NumElems; ++i)
26228 ShuffleVec[i] = i * SizeRatio;
26229 for (unsigned i = NumElems; i != NumElems * SizeRatio; ++i)
26230 ShuffleVec[i] = NumElems * SizeRatio;
26231 NewMask = DAG.getVectorShuffle(WideVecVT, dl, NewMask,
26232 DAG.getConstant(0, dl, WideVecVT),
26236 assert(Mask.getValueType().getVectorElementType() == MVT::i1);
26237 unsigned WidenNumElts = NumElems*SizeRatio;
26238 unsigned MaskNumElts = VT.getVectorNumElements();
26239 EVT NewMaskVT = EVT::getVectorVT(*DAG.getContext(), MVT::i1,
26242 unsigned NumConcat = WidenNumElts / MaskNumElts;
26243 SmallVector<SDValue, 16> Ops(NumConcat);
26244 SDValue ZeroVal = DAG.getConstant(0, dl, Mask.getValueType());
26246 for (unsigned i = 1; i != NumConcat; ++i)
26249 NewMask = DAG.getNode(ISD::CONCAT_VECTORS, dl, NewMaskVT, Ops);
26252 SDValue WideLd = DAG.getMaskedLoad(WideVecVT, dl, Mld->getChain(),
26253 Mld->getBasePtr(), NewMask, WideSrc0,
26254 Mld->getMemoryVT(), Mld->getMemOperand(),
26256 SDValue NewVec = DAG.getNode(X86ISD::VSEXT, dl, VT, WideLd);
26257 return DCI.CombineTo(N, NewVec, WideLd.getValue(1), true);
26259 /// PerformMSTORECombine - Resolve truncating stores
26260 static SDValue PerformMSTORECombine(SDNode *N, SelectionDAG &DAG,
26261 const X86Subtarget *Subtarget) {
26262 MaskedStoreSDNode *Mst = cast<MaskedStoreSDNode>(N);
26263 if (!Mst->isTruncatingStore())
26266 EVT VT = Mst->getValue().getValueType();
26267 unsigned NumElems = VT.getVectorNumElements();
26268 EVT StVT = Mst->getMemoryVT();
26271 assert(StVT != VT && "Cannot truncate to the same type");
26272 unsigned FromSz = VT.getVectorElementType().getSizeInBits();
26273 unsigned ToSz = StVT.getVectorElementType().getSizeInBits();
26275 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
26277 // The truncating store is legal in some cases. For example
26278 // vpmovqb, vpmovqw, vpmovqd, vpmovdb, vpmovdw
26279 // are designated for truncate store.
26280 // In this case we don't need any further transformations.
26281 if (TLI.isTruncStoreLegal(VT, StVT))
26284 // From, To sizes and ElemCount must be pow of two
26285 assert (isPowerOf2_32(NumElems * FromSz * ToSz) &&
26286 "Unexpected size for truncating masked store");
26287 // We are going to use the original vector elt for storing.
26288 // Accumulated smaller vector elements must be a multiple of the store size.
26289 assert (((NumElems * FromSz) % ToSz) == 0 &&
26290 "Unexpected ratio for truncating masked store");
26292 unsigned SizeRatio = FromSz / ToSz;
26293 assert(SizeRatio * NumElems * ToSz == VT.getSizeInBits());
26295 // Create a type on which we perform the shuffle
26296 EVT WideVecVT = EVT::getVectorVT(*DAG.getContext(),
26297 StVT.getScalarType(), NumElems*SizeRatio);
26299 assert(WideVecVT.getSizeInBits() == VT.getSizeInBits());
26301 SDValue WideVec = DAG.getBitcast(WideVecVT, Mst->getValue());
26302 SmallVector<int, 16> ShuffleVec(NumElems * SizeRatio, -1);
26303 for (unsigned i = 0; i != NumElems; ++i)
26304 ShuffleVec[i] = i * SizeRatio;
26306 // Can't shuffle using an illegal type.
26307 assert(DAG.getTargetLoweringInfo().isTypeLegal(WideVecVT) &&
26308 "WideVecVT should be legal");
26310 SDValue TruncatedVal = DAG.getVectorShuffle(WideVecVT, dl, WideVec,
26311 DAG.getUNDEF(WideVecVT),
26315 SDValue Mask = Mst->getMask();
26316 if (Mask.getValueType() == VT) {
26317 // Mask and original value have the same type
26318 NewMask = DAG.getBitcast(WideVecVT, Mask);
26319 for (unsigned i = 0; i != NumElems; ++i)
26320 ShuffleVec[i] = i * SizeRatio;
26321 for (unsigned i = NumElems; i != NumElems*SizeRatio; ++i)
26322 ShuffleVec[i] = NumElems*SizeRatio;
26323 NewMask = DAG.getVectorShuffle(WideVecVT, dl, NewMask,
26324 DAG.getConstant(0, dl, WideVecVT),
26328 assert(Mask.getValueType().getVectorElementType() == MVT::i1);
26329 unsigned WidenNumElts = NumElems*SizeRatio;
26330 unsigned MaskNumElts = VT.getVectorNumElements();
26331 EVT NewMaskVT = EVT::getVectorVT(*DAG.getContext(), MVT::i1,
26334 unsigned NumConcat = WidenNumElts / MaskNumElts;
26335 SmallVector<SDValue, 16> Ops(NumConcat);
26336 SDValue ZeroVal = DAG.getConstant(0, dl, Mask.getValueType());
26338 for (unsigned i = 1; i != NumConcat; ++i)
26341 NewMask = DAG.getNode(ISD::CONCAT_VECTORS, dl, NewMaskVT, Ops);
26344 return DAG.getMaskedStore(Mst->getChain(), dl, TruncatedVal,
26345 Mst->getBasePtr(), NewMask, StVT,
26346 Mst->getMemOperand(), false);
26348 /// PerformSTORECombine - Do target-specific dag combines on STORE nodes.
26349 static SDValue PerformSTORECombine(SDNode *N, SelectionDAG &DAG,
26350 const X86Subtarget *Subtarget) {
26351 StoreSDNode *St = cast<StoreSDNode>(N);
26352 EVT VT = St->getValue().getValueType();
26353 EVT StVT = St->getMemoryVT();
26355 SDValue StoredVal = St->getOperand(1);
26356 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
26358 // If we are saving a concatenation of two XMM registers and 32-byte stores
26359 // are slow, such as on Sandy Bridge, perform two 16-byte stores.
26361 unsigned AddressSpace = St->getAddressSpace();
26362 unsigned Alignment = St->getAlignment();
26363 if (VT.is256BitVector() && StVT == VT &&
26364 TLI.allowsMemoryAccess(*DAG.getContext(), DAG.getDataLayout(), VT,
26365 AddressSpace, Alignment, &Fast) && !Fast) {
26366 unsigned NumElems = VT.getVectorNumElements();
26370 SDValue Value0 = Extract128BitVector(StoredVal, 0, DAG, dl);
26371 SDValue Value1 = Extract128BitVector(StoredVal, NumElems/2, DAG, dl);
26374 DAG.getConstant(16, dl, TLI.getPointerTy(DAG.getDataLayout()));
26375 SDValue Ptr0 = St->getBasePtr();
26376 SDValue Ptr1 = DAG.getNode(ISD::ADD, dl, Ptr0.getValueType(), Ptr0, Stride);
26378 SDValue Ch0 = DAG.getStore(St->getChain(), dl, Value0, Ptr0,
26379 St->getPointerInfo(), St->isVolatile(),
26380 St->isNonTemporal(), Alignment);
26381 SDValue Ch1 = DAG.getStore(St->getChain(), dl, Value1, Ptr1,
26382 St->getPointerInfo(), St->isVolatile(),
26383 St->isNonTemporal(),
26384 std::min(16U, Alignment));
26385 return DAG.getNode(ISD::TokenFactor, dl, MVT::Other, Ch0, Ch1);
26388 // Optimize trunc store (of multiple scalars) to shuffle and store.
26389 // First, pack all of the elements in one place. Next, store to memory
26390 // in fewer chunks.
26391 if (St->isTruncatingStore() && VT.isVector()) {
26392 // Check if we can detect an AVG pattern from the truncation. If yes,
26393 // replace the trunc store by a normal store with the result of X86ISD::AVG
26396 detectAVGPattern(St->getValue(), St->getMemoryVT(), DAG, Subtarget, dl);
26398 return DAG.getStore(St->getChain(), dl, Avg, St->getBasePtr(),
26399 St->getPointerInfo(), St->isVolatile(),
26400 St->isNonTemporal(), St->getAlignment());
26402 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
26403 unsigned NumElems = VT.getVectorNumElements();
26404 assert(StVT != VT && "Cannot truncate to the same type");
26405 unsigned FromSz = VT.getVectorElementType().getSizeInBits();
26406 unsigned ToSz = StVT.getVectorElementType().getSizeInBits();
26408 // The truncating store is legal in some cases. For example
26409 // vpmovqb, vpmovqw, vpmovqd, vpmovdb, vpmovdw
26410 // are designated for truncate store.
26411 // In this case we don't need any further transformations.
26412 if (TLI.isTruncStoreLegal(VT, StVT))
26415 // From, To sizes and ElemCount must be pow of two
26416 if (!isPowerOf2_32(NumElems * FromSz * ToSz)) return SDValue();
26417 // We are going to use the original vector elt for storing.
26418 // Accumulated smaller vector elements must be a multiple of the store size.
26419 if (0 != (NumElems * FromSz) % ToSz) return SDValue();
26421 unsigned SizeRatio = FromSz / ToSz;
26423 assert(SizeRatio * NumElems * ToSz == VT.getSizeInBits());
26425 // Create a type on which we perform the shuffle
26426 EVT WideVecVT = EVT::getVectorVT(*DAG.getContext(),
26427 StVT.getScalarType(), NumElems*SizeRatio);
26429 assert(WideVecVT.getSizeInBits() == VT.getSizeInBits());
26431 SDValue WideVec = DAG.getBitcast(WideVecVT, St->getValue());
26432 SmallVector<int, 8> ShuffleVec(NumElems * SizeRatio, -1);
26433 for (unsigned i = 0; i != NumElems; ++i)
26434 ShuffleVec[i] = i * SizeRatio;
26436 // Can't shuffle using an illegal type.
26437 if (!TLI.isTypeLegal(WideVecVT))
26440 SDValue Shuff = DAG.getVectorShuffle(WideVecVT, dl, WideVec,
26441 DAG.getUNDEF(WideVecVT),
26443 // At this point all of the data is stored at the bottom of the
26444 // register. We now need to save it to mem.
26446 // Find the largest store unit
26447 MVT StoreType = MVT::i8;
26448 for (MVT Tp : MVT::integer_valuetypes()) {
26449 if (TLI.isTypeLegal(Tp) && Tp.getSizeInBits() <= NumElems * ToSz)
26453 // On 32bit systems, we can't save 64bit integers. Try bitcasting to F64.
26454 if (TLI.isTypeLegal(MVT::f64) && StoreType.getSizeInBits() < 64 &&
26455 (64 <= NumElems * ToSz))
26456 StoreType = MVT::f64;
26458 // Bitcast the original vector into a vector of store-size units
26459 EVT StoreVecVT = EVT::getVectorVT(*DAG.getContext(),
26460 StoreType, VT.getSizeInBits()/StoreType.getSizeInBits());
26461 assert(StoreVecVT.getSizeInBits() == VT.getSizeInBits());
26462 SDValue ShuffWide = DAG.getBitcast(StoreVecVT, Shuff);
26463 SmallVector<SDValue, 8> Chains;
26464 SDValue Increment = DAG.getConstant(StoreType.getSizeInBits() / 8, dl,
26465 TLI.getPointerTy(DAG.getDataLayout()));
26466 SDValue Ptr = St->getBasePtr();
26468 // Perform one or more big stores into memory.
26469 for (unsigned i=0, e=(ToSz*NumElems)/StoreType.getSizeInBits(); i!=e; ++i) {
26470 SDValue SubVec = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl,
26471 StoreType, ShuffWide,
26472 DAG.getIntPtrConstant(i, dl));
26473 SDValue Ch = DAG.getStore(St->getChain(), dl, SubVec, Ptr,
26474 St->getPointerInfo(), St->isVolatile(),
26475 St->isNonTemporal(), St->getAlignment());
26476 Ptr = DAG.getNode(ISD::ADD, dl, Ptr.getValueType(), Ptr, Increment);
26477 Chains.push_back(Ch);
26480 return DAG.getNode(ISD::TokenFactor, dl, MVT::Other, Chains);
26483 // Turn load->store of MMX types into GPR load/stores. This avoids clobbering
26484 // the FP state in cases where an emms may be missing.
26485 // A preferable solution to the general problem is to figure out the right
26486 // places to insert EMMS. This qualifies as a quick hack.
26488 // Similarly, turn load->store of i64 into double load/stores in 32-bit mode.
26489 if (VT.getSizeInBits() != 64)
26492 const Function *F = DAG.getMachineFunction().getFunction();
26493 bool NoImplicitFloatOps = F->hasFnAttribute(Attribute::NoImplicitFloat);
26495 !Subtarget->useSoftFloat() && !NoImplicitFloatOps && Subtarget->hasSSE2();
26496 if ((VT.isVector() ||
26497 (VT == MVT::i64 && F64IsLegal && !Subtarget->is64Bit())) &&
26498 isa<LoadSDNode>(St->getValue()) &&
26499 !cast<LoadSDNode>(St->getValue())->isVolatile() &&
26500 St->getChain().hasOneUse() && !St->isVolatile()) {
26501 SDNode* LdVal = St->getValue().getNode();
26502 LoadSDNode *Ld = nullptr;
26503 int TokenFactorIndex = -1;
26504 SmallVector<SDValue, 8> Ops;
26505 SDNode* ChainVal = St->getChain().getNode();
26506 // Must be a store of a load. We currently handle two cases: the load
26507 // is a direct child, and it's under an intervening TokenFactor. It is
26508 // possible to dig deeper under nested TokenFactors.
26509 if (ChainVal == LdVal)
26510 Ld = cast<LoadSDNode>(St->getChain());
26511 else if (St->getValue().hasOneUse() &&
26512 ChainVal->getOpcode() == ISD::TokenFactor) {
26513 for (unsigned i = 0, e = ChainVal->getNumOperands(); i != e; ++i) {
26514 if (ChainVal->getOperand(i).getNode() == LdVal) {
26515 TokenFactorIndex = i;
26516 Ld = cast<LoadSDNode>(St->getValue());
26518 Ops.push_back(ChainVal->getOperand(i));
26522 if (!Ld || !ISD::isNormalLoad(Ld))
26525 // If this is not the MMX case, i.e. we are just turning i64 load/store
26526 // into f64 load/store, avoid the transformation if there are multiple
26527 // uses of the loaded value.
26528 if (!VT.isVector() && !Ld->hasNUsesOfValue(1, 0))
26533 // If we are a 64-bit capable x86, lower to a single movq load/store pair.
26534 // Otherwise, if it's legal to use f64 SSE instructions, use f64 load/store
26536 if (Subtarget->is64Bit() || F64IsLegal) {
26537 MVT LdVT = Subtarget->is64Bit() ? MVT::i64 : MVT::f64;
26538 SDValue NewLd = DAG.getLoad(LdVT, LdDL, Ld->getChain(), Ld->getBasePtr(),
26539 Ld->getPointerInfo(), Ld->isVolatile(),
26540 Ld->isNonTemporal(), Ld->isInvariant(),
26541 Ld->getAlignment());
26542 SDValue NewChain = NewLd.getValue(1);
26543 if (TokenFactorIndex != -1) {
26544 Ops.push_back(NewChain);
26545 NewChain = DAG.getNode(ISD::TokenFactor, LdDL, MVT::Other, Ops);
26547 return DAG.getStore(NewChain, StDL, NewLd, St->getBasePtr(),
26548 St->getPointerInfo(),
26549 St->isVolatile(), St->isNonTemporal(),
26550 St->getAlignment());
26553 // Otherwise, lower to two pairs of 32-bit loads / stores.
26554 SDValue LoAddr = Ld->getBasePtr();
26555 SDValue HiAddr = DAG.getNode(ISD::ADD, LdDL, MVT::i32, LoAddr,
26556 DAG.getConstant(4, LdDL, MVT::i32));
26558 SDValue LoLd = DAG.getLoad(MVT::i32, LdDL, Ld->getChain(), LoAddr,
26559 Ld->getPointerInfo(),
26560 Ld->isVolatile(), Ld->isNonTemporal(),
26561 Ld->isInvariant(), Ld->getAlignment());
26562 SDValue HiLd = DAG.getLoad(MVT::i32, LdDL, Ld->getChain(), HiAddr,
26563 Ld->getPointerInfo().getWithOffset(4),
26564 Ld->isVolatile(), Ld->isNonTemporal(),
26566 MinAlign(Ld->getAlignment(), 4));
26568 SDValue NewChain = LoLd.getValue(1);
26569 if (TokenFactorIndex != -1) {
26570 Ops.push_back(LoLd);
26571 Ops.push_back(HiLd);
26572 NewChain = DAG.getNode(ISD::TokenFactor, LdDL, MVT::Other, Ops);
26575 LoAddr = St->getBasePtr();
26576 HiAddr = DAG.getNode(ISD::ADD, StDL, MVT::i32, LoAddr,
26577 DAG.getConstant(4, StDL, MVT::i32));
26579 SDValue LoSt = DAG.getStore(NewChain, StDL, LoLd, LoAddr,
26580 St->getPointerInfo(),
26581 St->isVolatile(), St->isNonTemporal(),
26582 St->getAlignment());
26583 SDValue HiSt = DAG.getStore(NewChain, StDL, HiLd, HiAddr,
26584 St->getPointerInfo().getWithOffset(4),
26586 St->isNonTemporal(),
26587 MinAlign(St->getAlignment(), 4));
26588 return DAG.getNode(ISD::TokenFactor, StDL, MVT::Other, LoSt, HiSt);
26591 // This is similar to the above case, but here we handle a scalar 64-bit
26592 // integer store that is extracted from a vector on a 32-bit target.
26593 // If we have SSE2, then we can treat it like a floating-point double
26594 // to get past legalization. The execution dependencies fixup pass will
26595 // choose the optimal machine instruction for the store if this really is
26596 // an integer or v2f32 rather than an f64.
26597 if (VT == MVT::i64 && F64IsLegal && !Subtarget->is64Bit() &&
26598 St->getOperand(1).getOpcode() == ISD::EXTRACT_VECTOR_ELT) {
26599 SDValue OldExtract = St->getOperand(1);
26600 SDValue ExtOp0 = OldExtract.getOperand(0);
26601 unsigned VecSize = ExtOp0.getValueSizeInBits();
26602 EVT VecVT = EVT::getVectorVT(*DAG.getContext(), MVT::f64, VecSize / 64);
26603 SDValue BitCast = DAG.getBitcast(VecVT, ExtOp0);
26604 SDValue NewExtract = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::f64,
26605 BitCast, OldExtract.getOperand(1));
26606 return DAG.getStore(St->getChain(), dl, NewExtract, St->getBasePtr(),
26607 St->getPointerInfo(), St->isVolatile(),
26608 St->isNonTemporal(), St->getAlignment());
26614 /// Return 'true' if this vector operation is "horizontal"
26615 /// and return the operands for the horizontal operation in LHS and RHS. A
26616 /// horizontal operation performs the binary operation on successive elements
26617 /// of its first operand, then on successive elements of its second operand,
26618 /// returning the resulting values in a vector. For example, if
26619 /// A = < float a0, float a1, float a2, float a3 >
26621 /// B = < float b0, float b1, float b2, float b3 >
26622 /// then the result of doing a horizontal operation on A and B is
26623 /// A horizontal-op B = < a0 op a1, a2 op a3, b0 op b1, b2 op b3 >.
26624 /// In short, LHS and RHS are inspected to see if LHS op RHS is of the form
26625 /// A horizontal-op B, for some already available A and B, and if so then LHS is
26626 /// set to A, RHS to B, and the routine returns 'true'.
26627 /// Note that the binary operation should have the property that if one of the
26628 /// operands is UNDEF then the result is UNDEF.
26629 static bool isHorizontalBinOp(SDValue &LHS, SDValue &RHS, bool IsCommutative) {
26630 // Look for the following pattern: if
26631 // A = < float a0, float a1, float a2, float a3 >
26632 // B = < float b0, float b1, float b2, float b3 >
26634 // LHS = VECTOR_SHUFFLE A, B, <0, 2, 4, 6>
26635 // RHS = VECTOR_SHUFFLE A, B, <1, 3, 5, 7>
26636 // then LHS op RHS = < a0 op a1, a2 op a3, b0 op b1, b2 op b3 >
26637 // which is A horizontal-op B.
26639 // At least one of the operands should be a vector shuffle.
26640 if (LHS.getOpcode() != ISD::VECTOR_SHUFFLE &&
26641 RHS.getOpcode() != ISD::VECTOR_SHUFFLE)
26644 MVT VT = LHS.getSimpleValueType();
26646 assert((VT.is128BitVector() || VT.is256BitVector()) &&
26647 "Unsupported vector type for horizontal add/sub");
26649 // Handle 128 and 256-bit vector lengths. AVX defines horizontal add/sub to
26650 // operate independently on 128-bit lanes.
26651 unsigned NumElts = VT.getVectorNumElements();
26652 unsigned NumLanes = VT.getSizeInBits()/128;
26653 unsigned NumLaneElts = NumElts / NumLanes;
26654 assert((NumLaneElts % 2 == 0) &&
26655 "Vector type should have an even number of elements in each lane");
26656 unsigned HalfLaneElts = NumLaneElts/2;
26658 // View LHS in the form
26659 // LHS = VECTOR_SHUFFLE A, B, LMask
26660 // If LHS is not a shuffle then pretend it is the shuffle
26661 // LHS = VECTOR_SHUFFLE LHS, undef, <0, 1, ..., N-1>
26662 // NOTE: in what follows a default initialized SDValue represents an UNDEF of
26665 SmallVector<int, 16> LMask(NumElts);
26666 if (LHS.getOpcode() == ISD::VECTOR_SHUFFLE) {
26667 if (LHS.getOperand(0).getOpcode() != ISD::UNDEF)
26668 A = LHS.getOperand(0);
26669 if (LHS.getOperand(1).getOpcode() != ISD::UNDEF)
26670 B = LHS.getOperand(1);
26671 ArrayRef<int> Mask = cast<ShuffleVectorSDNode>(LHS.getNode())->getMask();
26672 std::copy(Mask.begin(), Mask.end(), LMask.begin());
26674 if (LHS.getOpcode() != ISD::UNDEF)
26676 for (unsigned i = 0; i != NumElts; ++i)
26680 // Likewise, view RHS in the form
26681 // RHS = VECTOR_SHUFFLE C, D, RMask
26683 SmallVector<int, 16> RMask(NumElts);
26684 if (RHS.getOpcode() == ISD::VECTOR_SHUFFLE) {
26685 if (RHS.getOperand(0).getOpcode() != ISD::UNDEF)
26686 C = RHS.getOperand(0);
26687 if (RHS.getOperand(1).getOpcode() != ISD::UNDEF)
26688 D = RHS.getOperand(1);
26689 ArrayRef<int> Mask = cast<ShuffleVectorSDNode>(RHS.getNode())->getMask();
26690 std::copy(Mask.begin(), Mask.end(), RMask.begin());
26692 if (RHS.getOpcode() != ISD::UNDEF)
26694 for (unsigned i = 0; i != NumElts; ++i)
26698 // Check that the shuffles are both shuffling the same vectors.
26699 if (!(A == C && B == D) && !(A == D && B == C))
26702 // If everything is UNDEF then bail out: it would be better to fold to UNDEF.
26703 if (!A.getNode() && !B.getNode())
26706 // If A and B occur in reverse order in RHS, then "swap" them (which means
26707 // rewriting the mask).
26709 ShuffleVectorSDNode::commuteMask(RMask);
26711 // At this point LHS and RHS are equivalent to
26712 // LHS = VECTOR_SHUFFLE A, B, LMask
26713 // RHS = VECTOR_SHUFFLE A, B, RMask
26714 // Check that the masks correspond to performing a horizontal operation.
26715 for (unsigned l = 0; l != NumElts; l += NumLaneElts) {
26716 for (unsigned i = 0; i != NumLaneElts; ++i) {
26717 int LIdx = LMask[i+l], RIdx = RMask[i+l];
26719 // Ignore any UNDEF components.
26720 if (LIdx < 0 || RIdx < 0 ||
26721 (!A.getNode() && (LIdx < (int)NumElts || RIdx < (int)NumElts)) ||
26722 (!B.getNode() && (LIdx >= (int)NumElts || RIdx >= (int)NumElts)))
26725 // Check that successive elements are being operated on. If not, this is
26726 // not a horizontal operation.
26727 unsigned Src = (i/HalfLaneElts); // each lane is split between srcs
26728 int Index = 2*(i%HalfLaneElts) + NumElts*Src + l;
26729 if (!(LIdx == Index && RIdx == Index + 1) &&
26730 !(IsCommutative && LIdx == Index + 1 && RIdx == Index))
26735 LHS = A.getNode() ? A : B; // If A is 'UNDEF', use B for it.
26736 RHS = B.getNode() ? B : A; // If B is 'UNDEF', use A for it.
26740 /// Do target-specific dag combines on floating point adds.
26741 static SDValue PerformFADDCombine(SDNode *N, SelectionDAG &DAG,
26742 const X86Subtarget *Subtarget) {
26743 EVT VT = N->getValueType(0);
26744 SDValue LHS = N->getOperand(0);
26745 SDValue RHS = N->getOperand(1);
26747 // Try to synthesize horizontal adds from adds of shuffles.
26748 if (((Subtarget->hasSSE3() && (VT == MVT::v4f32 || VT == MVT::v2f64)) ||
26749 (Subtarget->hasFp256() && (VT == MVT::v8f32 || VT == MVT::v4f64))) &&
26750 isHorizontalBinOp(LHS, RHS, true))
26751 return DAG.getNode(X86ISD::FHADD, SDLoc(N), VT, LHS, RHS);
26755 /// Do target-specific dag combines on floating point subs.
26756 static SDValue PerformFSUBCombine(SDNode *N, SelectionDAG &DAG,
26757 const X86Subtarget *Subtarget) {
26758 EVT VT = N->getValueType(0);
26759 SDValue LHS = N->getOperand(0);
26760 SDValue RHS = N->getOperand(1);
26762 // Try to synthesize horizontal subs from subs of shuffles.
26763 if (((Subtarget->hasSSE3() && (VT == MVT::v4f32 || VT == MVT::v2f64)) ||
26764 (Subtarget->hasFp256() && (VT == MVT::v8f32 || VT == MVT::v4f64))) &&
26765 isHorizontalBinOp(LHS, RHS, false))
26766 return DAG.getNode(X86ISD::FHSUB, SDLoc(N), VT, LHS, RHS);
26770 /// Truncate a group of v4i32 into v16i8/v8i16 using X86ISD::PACKUS.
26772 combineVectorTruncationWithPACKUS(SDNode *N, SelectionDAG &DAG,
26773 SmallVector<SDValue, 8> &Regs) {
26774 assert(Regs.size() > 0 && (Regs[0].getValueType() == MVT::v4i32 ||
26775 Regs[0].getValueType() == MVT::v2i64));
26776 EVT OutVT = N->getValueType(0);
26777 EVT OutSVT = OutVT.getVectorElementType();
26778 EVT InVT = Regs[0].getValueType();
26779 EVT InSVT = InVT.getVectorElementType();
26782 // First, use mask to unset all bits that won't appear in the result.
26783 assert((OutSVT == MVT::i8 || OutSVT == MVT::i16) &&
26784 "OutSVT can only be either i8 or i16.");
26786 DAG.getConstant(OutSVT == MVT::i8 ? 0xFF : 0xFFFF, DL, InSVT);
26787 SDValue MaskVec = DAG.getNode(
26788 ISD::BUILD_VECTOR, DL, InVT,
26789 SmallVector<SDValue, 8>(InVT.getVectorNumElements(), MaskVal));
26790 for (auto &Reg : Regs)
26791 Reg = DAG.getNode(ISD::AND, DL, InVT, MaskVec, Reg);
26793 MVT UnpackedVT, PackedVT;
26794 if (OutSVT == MVT::i8) {
26795 UnpackedVT = MVT::v8i16;
26796 PackedVT = MVT::v16i8;
26798 UnpackedVT = MVT::v4i32;
26799 PackedVT = MVT::v8i16;
26802 // In each iteration, truncate the type by a half size.
26803 auto RegNum = Regs.size();
26804 for (unsigned j = 1, e = InSVT.getSizeInBits() / OutSVT.getSizeInBits();
26805 j < e; j *= 2, RegNum /= 2) {
26806 for (unsigned i = 0; i < RegNum; i++)
26807 Regs[i] = DAG.getNode(ISD::BITCAST, DL, UnpackedVT, Regs[i]);
26808 for (unsigned i = 0; i < RegNum / 2; i++)
26809 Regs[i] = DAG.getNode(X86ISD::PACKUS, DL, PackedVT, Regs[i * 2],
26813 // If the type of the result is v8i8, we need do one more X86ISD::PACKUS, and
26814 // then extract a subvector as the result since v8i8 is not a legal type.
26815 if (OutVT == MVT::v8i8) {
26816 Regs[0] = DAG.getNode(X86ISD::PACKUS, DL, PackedVT, Regs[0], Regs[0]);
26817 Regs[0] = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, OutVT, Regs[0],
26818 DAG.getIntPtrConstant(0, DL));
26820 } else if (RegNum > 1) {
26821 Regs.resize(RegNum);
26822 return DAG.getNode(ISD::CONCAT_VECTORS, DL, OutVT, Regs);
26827 /// Truncate a group of v4i32 into v8i16 using X86ISD::PACKSS.
26829 combineVectorTruncationWithPACKSS(SDNode *N, SelectionDAG &DAG,
26830 SmallVector<SDValue, 8> &Regs) {
26831 assert(Regs.size() > 0 && Regs[0].getValueType() == MVT::v4i32);
26832 EVT OutVT = N->getValueType(0);
26835 // Shift left by 16 bits, then arithmetic-shift right by 16 bits.
26836 SDValue ShAmt = DAG.getConstant(16, DL, MVT::i32);
26837 for (auto &Reg : Regs) {
26838 Reg = getTargetVShiftNode(X86ISD::VSHLI, DL, MVT::v4i32, Reg, ShAmt, DAG);
26839 Reg = getTargetVShiftNode(X86ISD::VSRAI, DL, MVT::v4i32, Reg, ShAmt, DAG);
26842 for (unsigned i = 0, e = Regs.size() / 2; i < e; i++)
26843 Regs[i] = DAG.getNode(X86ISD::PACKSS, DL, MVT::v8i16, Regs[i * 2],
26846 if (Regs.size() > 2) {
26847 Regs.resize(Regs.size() / 2);
26848 return DAG.getNode(ISD::CONCAT_VECTORS, DL, OutVT, Regs);
26853 /// This function transforms truncation from vXi32/vXi64 to vXi8/vXi16 into
26854 /// X86ISD::PACKUS/X86ISD::PACKSS operations. We do it here because after type
26855 /// legalization the truncation will be translated into a BUILD_VECTOR with each
26856 /// element that is extracted from a vector and then truncated, and it is
26857 /// diffcult to do this optimization based on them.
26858 static SDValue combineVectorTruncation(SDNode *N, SelectionDAG &DAG,
26859 const X86Subtarget *Subtarget) {
26860 EVT OutVT = N->getValueType(0);
26861 if (!OutVT.isVector())
26864 SDValue In = N->getOperand(0);
26865 if (!In.getValueType().isSimple())
26868 EVT InVT = In.getValueType();
26869 unsigned NumElems = OutVT.getVectorNumElements();
26871 // TODO: On AVX2, the behavior of X86ISD::PACKUS is different from that on
26872 // SSE2, and we need to take care of it specially.
26873 // AVX512 provides vpmovdb.
26874 if (!Subtarget->hasSSE2() || Subtarget->hasAVX2())
26877 EVT OutSVT = OutVT.getVectorElementType();
26878 EVT InSVT = InVT.getVectorElementType();
26879 if (!((InSVT == MVT::i32 || InSVT == MVT::i64) &&
26880 (OutSVT == MVT::i8 || OutSVT == MVT::i16) && isPowerOf2_32(NumElems) &&
26884 // SSSE3's pshufb results in less instructions in the cases below.
26885 if (Subtarget->hasSSSE3() && NumElems == 8 &&
26886 ((OutSVT == MVT::i8 && InSVT != MVT::i64) ||
26887 (InSVT == MVT::i32 && OutSVT == MVT::i16)))
26892 // Split a long vector into vectors of legal type.
26893 unsigned RegNum = InVT.getSizeInBits() / 128;
26894 SmallVector<SDValue, 8> SubVec(RegNum);
26895 if (InSVT == MVT::i32) {
26896 for (unsigned i = 0; i < RegNum; i++)
26897 SubVec[i] = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, MVT::v4i32, In,
26898 DAG.getIntPtrConstant(i * 4, DL));
26900 for (unsigned i = 0; i < RegNum; i++)
26901 SubVec[i] = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, MVT::v2i64, In,
26902 DAG.getIntPtrConstant(i * 2, DL));
26905 // SSE2 provides PACKUS for only 2 x v8i16 -> v16i8 and SSE4.1 provides PAKCUS
26906 // for 2 x v4i32 -> v8i16. For SSSE3 and below, we need to use PACKSS to
26907 // truncate 2 x v4i32 to v8i16.
26908 if (Subtarget->hasSSE41() || OutSVT == MVT::i8)
26909 return combineVectorTruncationWithPACKUS(N, DAG, SubVec);
26910 else if (InSVT == MVT::i32)
26911 return combineVectorTruncationWithPACKSS(N, DAG, SubVec);
26916 static SDValue PerformTRUNCATECombine(SDNode *N, SelectionDAG &DAG,
26917 const X86Subtarget *Subtarget) {
26918 // Try to detect AVG pattern first.
26919 SDValue Avg = detectAVGPattern(N->getOperand(0), N->getValueType(0), DAG,
26920 Subtarget, SDLoc(N));
26924 return combineVectorTruncation(N, DAG, Subtarget);
26927 /// Do target-specific dag combines on floating point negations.
26928 static SDValue PerformFNEGCombine(SDNode *N, SelectionDAG &DAG,
26929 const X86Subtarget *Subtarget) {
26930 EVT VT = N->getValueType(0);
26931 EVT SVT = VT.getScalarType();
26932 SDValue Arg = N->getOperand(0);
26935 // Let legalize expand this if it isn't a legal type yet.
26936 if (!DAG.getTargetLoweringInfo().isTypeLegal(VT))
26939 // If we're negating a FMUL node on a target with FMA, then we can avoid the
26940 // use of a constant by performing (-0 - A*B) instead.
26941 // FIXME: Check rounding control flags as well once it becomes available.
26942 if (Arg.getOpcode() == ISD::FMUL && (SVT == MVT::f32 || SVT == MVT::f64) &&
26943 Arg->getFlags()->hasNoSignedZeros() && Subtarget->hasAnyFMA()) {
26944 SDValue Zero = DAG.getConstantFP(0.0, DL, VT);
26945 return DAG.getNode(X86ISD::FNMSUB, DL, VT, Arg.getOperand(0),
26946 Arg.getOperand(1), Zero);
26949 // If we're negating a FMA node, then we can adjust the
26950 // instruction to include the extra negation.
26951 if (Arg.hasOneUse()) {
26952 switch (Arg.getOpcode()) {
26953 case X86ISD::FMADD:
26954 return DAG.getNode(X86ISD::FNMSUB, DL, VT, Arg.getOperand(0),
26955 Arg.getOperand(1), Arg.getOperand(2));
26956 case X86ISD::FMSUB:
26957 return DAG.getNode(X86ISD::FNMADD, DL, VT, Arg.getOperand(0),
26958 Arg.getOperand(1), Arg.getOperand(2));
26959 case X86ISD::FNMADD:
26960 return DAG.getNode(X86ISD::FMSUB, DL, VT, Arg.getOperand(0),
26961 Arg.getOperand(1), Arg.getOperand(2));
26962 case X86ISD::FNMSUB:
26963 return DAG.getNode(X86ISD::FMADD, DL, VT, Arg.getOperand(0),
26964 Arg.getOperand(1), Arg.getOperand(2));
26970 static SDValue lowerX86FPLogicOp(SDNode *N, SelectionDAG &DAG,
26971 const X86Subtarget *Subtarget) {
26972 EVT VT = N->getValueType(0);
26973 if (VT.is512BitVector() && !Subtarget->hasDQI()) {
26974 // VXORPS, VORPS, VANDPS, VANDNPS are supported only under DQ extention.
26975 // These logic operations may be executed in the integer domain.
26977 MVT IntScalar = MVT::getIntegerVT(VT.getScalarSizeInBits());
26978 MVT IntVT = MVT::getVectorVT(IntScalar, VT.getVectorNumElements());
26980 SDValue Op0 = DAG.getNode(ISD::BITCAST, dl, IntVT, N->getOperand(0));
26981 SDValue Op1 = DAG.getNode(ISD::BITCAST, dl, IntVT, N->getOperand(1));
26982 unsigned IntOpcode = 0;
26983 switch (N->getOpcode()) {
26984 default: llvm_unreachable("Unexpected FP logic op");
26985 case X86ISD::FOR: IntOpcode = ISD::OR; break;
26986 case X86ISD::FXOR: IntOpcode = ISD::XOR; break;
26987 case X86ISD::FAND: IntOpcode = ISD::AND; break;
26988 case X86ISD::FANDN: IntOpcode = X86ISD::ANDNP; break;
26990 SDValue IntOp = DAG.getNode(IntOpcode, dl, IntVT, Op0, Op1);
26991 return DAG.getNode(ISD::BITCAST, dl, VT, IntOp);
26995 /// Do target-specific dag combines on X86ISD::FOR and X86ISD::FXOR nodes.
26996 static SDValue PerformFORCombine(SDNode *N, SelectionDAG &DAG,
26997 const X86Subtarget *Subtarget) {
26998 assert(N->getOpcode() == X86ISD::FOR || N->getOpcode() == X86ISD::FXOR);
27000 // F[X]OR(0.0, x) -> x
27001 if (ConstantFPSDNode *C = dyn_cast<ConstantFPSDNode>(N->getOperand(0)))
27002 if (C->getValueAPF().isPosZero())
27003 return N->getOperand(1);
27005 // F[X]OR(x, 0.0) -> x
27006 if (ConstantFPSDNode *C = dyn_cast<ConstantFPSDNode>(N->getOperand(1)))
27007 if (C->getValueAPF().isPosZero())
27008 return N->getOperand(0);
27010 return lowerX86FPLogicOp(N, DAG, Subtarget);
27013 /// Do target-specific dag combines on X86ISD::FMIN and X86ISD::FMAX nodes.
27014 static SDValue PerformFMinFMaxCombine(SDNode *N, SelectionDAG &DAG) {
27015 assert(N->getOpcode() == X86ISD::FMIN || N->getOpcode() == X86ISD::FMAX);
27017 // Only perform optimizations if UnsafeMath is used.
27018 if (!DAG.getTarget().Options.UnsafeFPMath)
27021 // If we run in unsafe-math mode, then convert the FMAX and FMIN nodes
27022 // into FMINC and FMAXC, which are Commutative operations.
27023 unsigned NewOp = 0;
27024 switch (N->getOpcode()) {
27025 default: llvm_unreachable("unknown opcode");
27026 case X86ISD::FMIN: NewOp = X86ISD::FMINC; break;
27027 case X86ISD::FMAX: NewOp = X86ISD::FMAXC; break;
27030 return DAG.getNode(NewOp, SDLoc(N), N->getValueType(0),
27031 N->getOperand(0), N->getOperand(1));
27034 static SDValue performFMinNumFMaxNumCombine(SDNode *N, SelectionDAG &DAG,
27035 const X86Subtarget *Subtarget) {
27036 if (Subtarget->useSoftFloat())
27039 // TODO: Check for global or instruction-level "nnan". In that case, we
27040 // should be able to lower to FMAX/FMIN alone.
27041 // TODO: If an operand is already known to be a NaN or not a NaN, this
27042 // should be an optional swap and FMAX/FMIN.
27044 EVT VT = N->getValueType(0);
27045 if (!((Subtarget->hasSSE1() && (VT == MVT::f32 || VT == MVT::v4f32)) ||
27046 (Subtarget->hasSSE2() && (VT == MVT::f64 || VT == MVT::v2f64)) ||
27047 (Subtarget->hasAVX() && (VT == MVT::v8f32 || VT == MVT::v4f64))))
27050 // This takes at least 3 instructions, so favor a library call when operating
27051 // on a scalar and minimizing code size.
27052 if (!VT.isVector() && DAG.getMachineFunction().getFunction()->optForMinSize())
27055 SDValue Op0 = N->getOperand(0);
27056 SDValue Op1 = N->getOperand(1);
27058 EVT SetCCType = DAG.getTargetLoweringInfo().getSetCCResultType(
27059 DAG.getDataLayout(), *DAG.getContext(), VT);
27061 // There are 4 possibilities involving NaN inputs, and these are the required
27065 // ----------------
27066 // Num | Max | Op0 |
27067 // Op0 ----------------
27068 // NaN | Op1 | NaN |
27069 // ----------------
27071 // The SSE FP max/min instructions were not designed for this case, but rather
27073 // Min = Op1 < Op0 ? Op1 : Op0
27074 // Max = Op1 > Op0 ? Op1 : Op0
27076 // So they always return Op0 if either input is a NaN. However, we can still
27077 // use those instructions for fmaxnum by selecting away a NaN input.
27079 // If either operand is NaN, the 2nd source operand (Op0) is passed through.
27080 auto MinMaxOp = N->getOpcode() == ISD::FMAXNUM ? X86ISD::FMAX : X86ISD::FMIN;
27081 SDValue MinOrMax = DAG.getNode(MinMaxOp, DL, VT, Op1, Op0);
27082 SDValue IsOp0Nan = DAG.getSetCC(DL, SetCCType , Op0, Op0, ISD::SETUO);
27084 // If Op0 is a NaN, select Op1. Otherwise, select the max. If both operands
27085 // are NaN, the NaN value of Op1 is the result.
27086 auto SelectOpcode = VT.isVector() ? ISD::VSELECT : ISD::SELECT;
27087 return DAG.getNode(SelectOpcode, DL, VT, IsOp0Nan, Op1, MinOrMax);
27090 /// Do target-specific dag combines on X86ISD::FAND nodes.
27091 static SDValue PerformFANDCombine(SDNode *N, SelectionDAG &DAG,
27092 const X86Subtarget *Subtarget) {
27093 // FAND(0.0, x) -> 0.0
27094 if (ConstantFPSDNode *C = dyn_cast<ConstantFPSDNode>(N->getOperand(0)))
27095 if (C->getValueAPF().isPosZero())
27096 return N->getOperand(0);
27098 // FAND(x, 0.0) -> 0.0
27099 if (ConstantFPSDNode *C = dyn_cast<ConstantFPSDNode>(N->getOperand(1)))
27100 if (C->getValueAPF().isPosZero())
27101 return N->getOperand(1);
27103 return lowerX86FPLogicOp(N, DAG, Subtarget);
27106 /// Do target-specific dag combines on X86ISD::FANDN nodes
27107 static SDValue PerformFANDNCombine(SDNode *N, SelectionDAG &DAG,
27108 const X86Subtarget *Subtarget) {
27109 // FANDN(0.0, x) -> x
27110 if (ConstantFPSDNode *C = dyn_cast<ConstantFPSDNode>(N->getOperand(0)))
27111 if (C->getValueAPF().isPosZero())
27112 return N->getOperand(1);
27114 // FANDN(x, 0.0) -> 0.0
27115 if (ConstantFPSDNode *C = dyn_cast<ConstantFPSDNode>(N->getOperand(1)))
27116 if (C->getValueAPF().isPosZero())
27117 return N->getOperand(1);
27119 return lowerX86FPLogicOp(N, DAG, Subtarget);
27122 static SDValue PerformBTCombine(SDNode *N,
27124 TargetLowering::DAGCombinerInfo &DCI) {
27125 // BT ignores high bits in the bit index operand.
27126 SDValue Op1 = N->getOperand(1);
27127 if (Op1.hasOneUse()) {
27128 unsigned BitWidth = Op1.getValueSizeInBits();
27129 APInt DemandedMask = APInt::getLowBitsSet(BitWidth, Log2_32(BitWidth));
27130 APInt KnownZero, KnownOne;
27131 TargetLowering::TargetLoweringOpt TLO(DAG, !DCI.isBeforeLegalize(),
27132 !DCI.isBeforeLegalizeOps());
27133 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
27134 if (TLO.ShrinkDemandedConstant(Op1, DemandedMask) ||
27135 TLI.SimplifyDemandedBits(Op1, DemandedMask, KnownZero, KnownOne, TLO))
27136 DCI.CommitTargetLoweringOpt(TLO);
27141 static SDValue PerformVZEXT_MOVLCombine(SDNode *N, SelectionDAG &DAG) {
27142 SDValue Op = N->getOperand(0);
27143 if (Op.getOpcode() == ISD::BITCAST)
27144 Op = Op.getOperand(0);
27145 EVT VT = N->getValueType(0), OpVT = Op.getValueType();
27146 if (Op.getOpcode() == X86ISD::VZEXT_LOAD &&
27147 VT.getVectorElementType().getSizeInBits() ==
27148 OpVT.getVectorElementType().getSizeInBits()) {
27149 return DAG.getNode(ISD::BITCAST, SDLoc(N), VT, Op);
27154 static SDValue PerformSIGN_EXTEND_INREGCombine(SDNode *N, SelectionDAG &DAG,
27155 const X86Subtarget *Subtarget) {
27156 EVT VT = N->getValueType(0);
27157 if (!VT.isVector())
27160 SDValue N0 = N->getOperand(0);
27161 SDValue N1 = N->getOperand(1);
27162 EVT ExtraVT = cast<VTSDNode>(N1)->getVT();
27165 // The SIGN_EXTEND_INREG to v4i64 is expensive operation on the
27166 // both SSE and AVX2 since there is no sign-extended shift right
27167 // operation on a vector with 64-bit elements.
27168 //(sext_in_reg (v4i64 anyext (v4i32 x )), ExtraVT) ->
27169 // (v4i64 sext (v4i32 sext_in_reg (v4i32 x , ExtraVT)))
27170 if (VT == MVT::v4i64 && (N0.getOpcode() == ISD::ANY_EXTEND ||
27171 N0.getOpcode() == ISD::SIGN_EXTEND)) {
27172 SDValue N00 = N0.getOperand(0);
27174 // EXTLOAD has a better solution on AVX2,
27175 // it may be replaced with X86ISD::VSEXT node.
27176 if (N00.getOpcode() == ISD::LOAD && Subtarget->hasInt256())
27177 if (!ISD::isNormalLoad(N00.getNode()))
27180 if (N00.getValueType() == MVT::v4i32 && ExtraVT.getSizeInBits() < 128) {
27181 SDValue Tmp = DAG.getNode(ISD::SIGN_EXTEND_INREG, dl, MVT::v4i32,
27183 return DAG.getNode(ISD::SIGN_EXTEND, dl, MVT::v4i64, Tmp);
27189 /// sext(add_nsw(x, C)) --> add(sext(x), C_sext)
27190 /// Promoting a sign extension ahead of an 'add nsw' exposes opportunities
27191 /// to combine math ops, use an LEA, or use a complex addressing mode. This can
27192 /// eliminate extend, add, and shift instructions.
27193 static SDValue promoteSextBeforeAddNSW(SDNode *Sext, SelectionDAG &DAG,
27194 const X86Subtarget *Subtarget) {
27195 // TODO: This should be valid for other integer types.
27196 EVT VT = Sext->getValueType(0);
27197 if (VT != MVT::i64)
27200 // We need an 'add nsw' feeding into the 'sext'.
27201 SDValue Add = Sext->getOperand(0);
27202 if (Add.getOpcode() != ISD::ADD || !Add->getFlags()->hasNoSignedWrap())
27205 // Having a constant operand to the 'add' ensures that we are not increasing
27206 // the instruction count because the constant is extended for free below.
27207 // A constant operand can also become the displacement field of an LEA.
27208 auto *AddOp1 = dyn_cast<ConstantSDNode>(Add.getOperand(1));
27212 // Don't make the 'add' bigger if there's no hope of combining it with some
27213 // other 'add' or 'shl' instruction.
27214 // TODO: It may be profitable to generate simpler LEA instructions in place
27215 // of single 'add' instructions, but the cost model for selecting an LEA
27216 // currently has a high threshold.
27217 bool HasLEAPotential = false;
27218 for (auto *User : Sext->uses()) {
27219 if (User->getOpcode() == ISD::ADD || User->getOpcode() == ISD::SHL) {
27220 HasLEAPotential = true;
27224 if (!HasLEAPotential)
27227 // Everything looks good, so pull the 'sext' ahead of the 'add'.
27228 int64_t AddConstant = AddOp1->getSExtValue();
27229 SDValue AddOp0 = Add.getOperand(0);
27230 SDValue NewSext = DAG.getNode(ISD::SIGN_EXTEND, SDLoc(Sext), VT, AddOp0);
27231 SDValue NewConstant = DAG.getConstant(AddConstant, SDLoc(Add), VT);
27233 // The wider add is guaranteed to not wrap because both operands are
27236 Flags.setNoSignedWrap(true);
27237 return DAG.getNode(ISD::ADD, SDLoc(Add), VT, NewSext, NewConstant, &Flags);
27240 /// (i8,i32 {s/z}ext ({s/u}divrem (i8 x, i8 y)) ->
27241 /// (i8,i32 ({s/u}divrem_sext_hreg (i8 x, i8 y)
27242 /// This exposes the {s/z}ext to the sdivrem lowering, so that it directly
27243 /// extends from AH (which we otherwise need to do contortions to access).
27244 static SDValue getDivRem8(SDNode *N, SelectionDAG &DAG) {
27245 SDValue N0 = N->getOperand(0);
27246 auto OpcodeN = N->getOpcode();
27247 auto OpcodeN0 = N0.getOpcode();
27248 if (!((OpcodeN == ISD::SIGN_EXTEND && OpcodeN0 == ISD::SDIVREM) ||
27249 (OpcodeN == ISD::ZERO_EXTEND && OpcodeN0 == ISD::UDIVREM)))
27252 EVT VT = N->getValueType(0);
27253 EVT InVT = N0.getValueType();
27254 if (N0.getResNo() != 1 || InVT != MVT::i8 || VT != MVT::i32)
27257 SDVTList NodeTys = DAG.getVTList(MVT::i8, VT);
27258 auto DivRemOpcode = OpcodeN0 == ISD::SDIVREM ? X86ISD::SDIVREM8_SEXT_HREG
27259 : X86ISD::UDIVREM8_ZEXT_HREG;
27260 SDValue R = DAG.getNode(DivRemOpcode, SDLoc(N), NodeTys, N0.getOperand(0),
27262 DAG.ReplaceAllUsesOfValueWith(N0.getValue(0), R.getValue(0));
27263 return R.getValue(1);
27266 static SDValue PerformSExtCombine(SDNode *N, SelectionDAG &DAG,
27267 TargetLowering::DAGCombinerInfo &DCI,
27268 const X86Subtarget *Subtarget) {
27269 SDValue N0 = N->getOperand(0);
27270 EVT VT = N->getValueType(0);
27271 EVT SVT = VT.getScalarType();
27272 EVT InVT = N0.getValueType();
27273 EVT InSVT = InVT.getScalarType();
27276 if (SDValue DivRem8 = getDivRem8(N, DAG))
27279 if (!DCI.isBeforeLegalizeOps()) {
27280 if (InVT == MVT::i1) {
27281 SDValue Zero = DAG.getConstant(0, DL, VT);
27283 DAG.getConstant(APInt::getAllOnesValue(VT.getSizeInBits()), DL, VT);
27284 return DAG.getNode(ISD::SELECT, DL, VT, N0, AllOnes, Zero);
27289 if (VT.isVector() && Subtarget->hasSSE2()) {
27290 auto ExtendVecSize = [&DAG](SDLoc DL, SDValue N, unsigned Size) {
27291 EVT InVT = N.getValueType();
27292 EVT OutVT = EVT::getVectorVT(*DAG.getContext(), InVT.getScalarType(),
27293 Size / InVT.getScalarSizeInBits());
27294 SmallVector<SDValue, 8> Opnds(Size / InVT.getSizeInBits(),
27295 DAG.getUNDEF(InVT));
27297 return DAG.getNode(ISD::CONCAT_VECTORS, DL, OutVT, Opnds);
27300 // If target-size is less than 128-bits, extend to a type that would extend
27301 // to 128 bits, extend that and extract the original target vector.
27302 if (VT.getSizeInBits() < 128 && !(128 % VT.getSizeInBits()) &&
27303 (SVT == MVT::i64 || SVT == MVT::i32 || SVT == MVT::i16) &&
27304 (InSVT == MVT::i32 || InSVT == MVT::i16 || InSVT == MVT::i8)) {
27305 unsigned Scale = 128 / VT.getSizeInBits();
27307 EVT::getVectorVT(*DAG.getContext(), SVT, 128 / SVT.getSizeInBits());
27308 SDValue Ex = ExtendVecSize(DL, N0, Scale * InVT.getSizeInBits());
27309 SDValue SExt = DAG.getNode(ISD::SIGN_EXTEND, DL, ExVT, Ex);
27310 return DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, VT, SExt,
27311 DAG.getIntPtrConstant(0, DL));
27314 // If target-size is 128-bits, then convert to ISD::SIGN_EXTEND_VECTOR_INREG
27315 // which ensures lowering to X86ISD::VSEXT (pmovsx*).
27316 if (VT.getSizeInBits() == 128 &&
27317 (SVT == MVT::i64 || SVT == MVT::i32 || SVT == MVT::i16) &&
27318 (InSVT == MVT::i32 || InSVT == MVT::i16 || InSVT == MVT::i8)) {
27319 SDValue ExOp = ExtendVecSize(DL, N0, 128);
27320 return DAG.getSignExtendVectorInReg(ExOp, DL, VT);
27323 // On pre-AVX2 targets, split into 128-bit nodes of
27324 // ISD::SIGN_EXTEND_VECTOR_INREG.
27325 if (!Subtarget->hasInt256() && !(VT.getSizeInBits() % 128) &&
27326 (SVT == MVT::i64 || SVT == MVT::i32 || SVT == MVT::i16) &&
27327 (InSVT == MVT::i32 || InSVT == MVT::i16 || InSVT == MVT::i8)) {
27328 unsigned NumVecs = VT.getSizeInBits() / 128;
27329 unsigned NumSubElts = 128 / SVT.getSizeInBits();
27330 EVT SubVT = EVT::getVectorVT(*DAG.getContext(), SVT, NumSubElts);
27331 EVT InSubVT = EVT::getVectorVT(*DAG.getContext(), InSVT, NumSubElts);
27333 SmallVector<SDValue, 8> Opnds;
27334 for (unsigned i = 0, Offset = 0; i != NumVecs;
27335 ++i, Offset += NumSubElts) {
27336 SDValue SrcVec = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, InSubVT, N0,
27337 DAG.getIntPtrConstant(Offset, DL));
27338 SrcVec = ExtendVecSize(DL, SrcVec, 128);
27339 SrcVec = DAG.getSignExtendVectorInReg(SrcVec, DL, SubVT);
27340 Opnds.push_back(SrcVec);
27342 return DAG.getNode(ISD::CONCAT_VECTORS, DL, VT, Opnds);
27346 if (Subtarget->hasAVX() && VT.is256BitVector())
27347 if (SDValue R = WidenMaskArithmetic(N, DAG, DCI, Subtarget))
27350 if (SDValue NewAdd = promoteSextBeforeAddNSW(N, DAG, Subtarget))
27356 static SDValue PerformFMACombine(SDNode *N, SelectionDAG &DAG,
27357 const X86Subtarget* Subtarget) {
27359 EVT VT = N->getValueType(0);
27361 // Let legalize expand this if it isn't a legal type yet.
27362 if (!DAG.getTargetLoweringInfo().isTypeLegal(VT))
27365 EVT ScalarVT = VT.getScalarType();
27366 if ((ScalarVT != MVT::f32 && ScalarVT != MVT::f64) || !Subtarget->hasAnyFMA())
27369 SDValue A = N->getOperand(0);
27370 SDValue B = N->getOperand(1);
27371 SDValue C = N->getOperand(2);
27373 bool NegA = (A.getOpcode() == ISD::FNEG);
27374 bool NegB = (B.getOpcode() == ISD::FNEG);
27375 bool NegC = (C.getOpcode() == ISD::FNEG);
27377 // Negative multiplication when NegA xor NegB
27378 bool NegMul = (NegA != NegB);
27380 A = A.getOperand(0);
27382 B = B.getOperand(0);
27384 C = C.getOperand(0);
27388 Opcode = (!NegC) ? X86ISD::FMADD : X86ISD::FMSUB;
27390 Opcode = (!NegC) ? X86ISD::FNMADD : X86ISD::FNMSUB;
27392 return DAG.getNode(Opcode, dl, VT, A, B, C);
27395 static SDValue PerformZExtCombine(SDNode *N, SelectionDAG &DAG,
27396 TargetLowering::DAGCombinerInfo &DCI,
27397 const X86Subtarget *Subtarget) {
27398 // (i32 zext (and (i8 x86isd::setcc_carry), 1)) ->
27399 // (and (i32 x86isd::setcc_carry), 1)
27400 // This eliminates the zext. This transformation is necessary because
27401 // ISD::SETCC is always legalized to i8.
27403 SDValue N0 = N->getOperand(0);
27404 EVT VT = N->getValueType(0);
27406 if (N0.getOpcode() == ISD::AND &&
27408 N0.getOperand(0).hasOneUse()) {
27409 SDValue N00 = N0.getOperand(0);
27410 if (N00.getOpcode() == X86ISD::SETCC_CARRY) {
27411 if (!isOneConstant(N0.getOperand(1)))
27413 return DAG.getNode(ISD::AND, dl, VT,
27414 DAG.getNode(X86ISD::SETCC_CARRY, dl, VT,
27415 N00.getOperand(0), N00.getOperand(1)),
27416 DAG.getConstant(1, dl, VT));
27420 if (N0.getOpcode() == ISD::TRUNCATE &&
27422 N0.getOperand(0).hasOneUse()) {
27423 SDValue N00 = N0.getOperand(0);
27424 if (N00.getOpcode() == X86ISD::SETCC_CARRY) {
27425 return DAG.getNode(ISD::AND, dl, VT,
27426 DAG.getNode(X86ISD::SETCC_CARRY, dl, VT,
27427 N00.getOperand(0), N00.getOperand(1)),
27428 DAG.getConstant(1, dl, VT));
27432 if (VT.is256BitVector())
27433 if (SDValue R = WidenMaskArithmetic(N, DAG, DCI, Subtarget))
27436 if (SDValue DivRem8 = getDivRem8(N, DAG))
27442 // Optimize x == -y --> x+y == 0
27443 // x != -y --> x+y != 0
27444 static SDValue PerformISDSETCCCombine(SDNode *N, SelectionDAG &DAG,
27445 const X86Subtarget* Subtarget) {
27446 ISD::CondCode CC = cast<CondCodeSDNode>(N->getOperand(2))->get();
27447 SDValue LHS = N->getOperand(0);
27448 SDValue RHS = N->getOperand(1);
27449 EVT VT = N->getValueType(0);
27452 if ((CC == ISD::SETNE || CC == ISD::SETEQ) && LHS.getOpcode() == ISD::SUB)
27453 if (isNullConstant(LHS.getOperand(0)) && LHS.hasOneUse()) {
27454 SDValue addV = DAG.getNode(ISD::ADD, DL, LHS.getValueType(), RHS,
27455 LHS.getOperand(1));
27456 return DAG.getSetCC(DL, N->getValueType(0), addV,
27457 DAG.getConstant(0, DL, addV.getValueType()), CC);
27459 if ((CC == ISD::SETNE || CC == ISD::SETEQ) && RHS.getOpcode() == ISD::SUB)
27460 if (isNullConstant(RHS.getOperand(0)) && RHS.hasOneUse()) {
27461 SDValue addV = DAG.getNode(ISD::ADD, DL, RHS.getValueType(), LHS,
27462 RHS.getOperand(1));
27463 return DAG.getSetCC(DL, N->getValueType(0), addV,
27464 DAG.getConstant(0, DL, addV.getValueType()), CC);
27467 if (VT.getScalarType() == MVT::i1 &&
27468 (CC == ISD::SETNE || CC == ISD::SETEQ || ISD::isSignedIntSetCC(CC))) {
27470 (LHS.getOpcode() == ISD::SIGN_EXTEND) &&
27471 (LHS.getOperand(0).getValueType().getScalarType() == MVT::i1);
27472 bool IsVZero1 = ISD::isBuildVectorAllZeros(RHS.getNode());
27474 if (!IsSEXT0 || !IsVZero1) {
27475 // Swap the operands and update the condition code.
27476 std::swap(LHS, RHS);
27477 CC = ISD::getSetCCSwappedOperands(CC);
27479 IsSEXT0 = (LHS.getOpcode() == ISD::SIGN_EXTEND) &&
27480 (LHS.getOperand(0).getValueType().getScalarType() == MVT::i1);
27481 IsVZero1 = ISD::isBuildVectorAllZeros(RHS.getNode());
27484 if (IsSEXT0 && IsVZero1) {
27485 assert(VT == LHS.getOperand(0).getValueType() &&
27486 "Uexpected operand type");
27487 if (CC == ISD::SETGT)
27488 return DAG.getConstant(0, DL, VT);
27489 if (CC == ISD::SETLE)
27490 return DAG.getConstant(1, DL, VT);
27491 if (CC == ISD::SETEQ || CC == ISD::SETGE)
27492 return DAG.getNOT(DL, LHS.getOperand(0), VT);
27494 assert((CC == ISD::SETNE || CC == ISD::SETLT) &&
27495 "Unexpected condition code!");
27496 return LHS.getOperand(0);
27503 static SDValue PerformGatherScatterCombine(SDNode *N, SelectionDAG &DAG) {
27505 // Gather and Scatter instructions use k-registers for masks. The type of
27506 // the masks is v*i1. So the mask will be truncated anyway.
27507 // The SIGN_EXTEND_INREG my be dropped.
27508 SDValue Mask = N->getOperand(2);
27509 if (Mask.getOpcode() == ISD::SIGN_EXTEND_INREG) {
27510 SmallVector<SDValue, 5> NewOps(N->op_begin(), N->op_end());
27511 NewOps[2] = Mask.getOperand(0);
27512 DAG.UpdateNodeOperands(N, NewOps);
27517 // Helper function of PerformSETCCCombine. It is to materialize "setb reg"
27518 // as "sbb reg,reg", since it can be extended without zext and produces
27519 // an all-ones bit which is more useful than 0/1 in some cases.
27520 static SDValue MaterializeSETB(SDLoc DL, SDValue EFLAGS, SelectionDAG &DAG,
27523 return DAG.getNode(ISD::AND, DL, VT,
27524 DAG.getNode(X86ISD::SETCC_CARRY, DL, MVT::i8,
27525 DAG.getConstant(X86::COND_B, DL, MVT::i8),
27527 DAG.getConstant(1, DL, VT));
27528 assert (VT == MVT::i1 && "Unexpected type for SECCC node");
27529 return DAG.getNode(ISD::TRUNCATE, DL, MVT::i1,
27530 DAG.getNode(X86ISD::SETCC_CARRY, DL, MVT::i8,
27531 DAG.getConstant(X86::COND_B, DL, MVT::i8),
27535 // Optimize RES = X86ISD::SETCC CONDCODE, EFLAG_INPUT
27536 static SDValue PerformSETCCCombine(SDNode *N, SelectionDAG &DAG,
27537 TargetLowering::DAGCombinerInfo &DCI,
27538 const X86Subtarget *Subtarget) {
27540 X86::CondCode CC = X86::CondCode(N->getConstantOperandVal(0));
27541 SDValue EFLAGS = N->getOperand(1);
27543 if (CC == X86::COND_A) {
27544 // Try to convert COND_A into COND_B in an attempt to facilitate
27545 // materializing "setb reg".
27547 // Do not flip "e > c", where "c" is a constant, because Cmp instruction
27548 // cannot take an immediate as its first operand.
27550 if (EFLAGS.getOpcode() == X86ISD::SUB && EFLAGS.hasOneUse() &&
27551 EFLAGS.getValueType().isInteger() &&
27552 !isa<ConstantSDNode>(EFLAGS.getOperand(1))) {
27553 SDValue NewSub = DAG.getNode(X86ISD::SUB, SDLoc(EFLAGS),
27554 EFLAGS.getNode()->getVTList(),
27555 EFLAGS.getOperand(1), EFLAGS.getOperand(0));
27556 SDValue NewEFLAGS = SDValue(NewSub.getNode(), EFLAGS.getResNo());
27557 return MaterializeSETB(DL, NewEFLAGS, DAG, N->getSimpleValueType(0));
27561 // Materialize "setb reg" as "sbb reg,reg", since it can be extended without
27562 // a zext and produces an all-ones bit which is more useful than 0/1 in some
27564 if (CC == X86::COND_B)
27565 return MaterializeSETB(DL, EFLAGS, DAG, N->getSimpleValueType(0));
27567 if (SDValue Flags = checkBoolTestSetCCCombine(EFLAGS, CC)) {
27568 SDValue Cond = DAG.getConstant(CC, DL, MVT::i8);
27569 return DAG.getNode(X86ISD::SETCC, DL, N->getVTList(), Cond, Flags);
27575 // Optimize branch condition evaluation.
27577 static SDValue PerformBrCondCombine(SDNode *N, SelectionDAG &DAG,
27578 TargetLowering::DAGCombinerInfo &DCI,
27579 const X86Subtarget *Subtarget) {
27581 SDValue Chain = N->getOperand(0);
27582 SDValue Dest = N->getOperand(1);
27583 SDValue EFLAGS = N->getOperand(3);
27584 X86::CondCode CC = X86::CondCode(N->getConstantOperandVal(2));
27586 if (SDValue Flags = checkBoolTestSetCCCombine(EFLAGS, CC)) {
27587 SDValue Cond = DAG.getConstant(CC, DL, MVT::i8);
27588 return DAG.getNode(X86ISD::BRCOND, DL, N->getVTList(), Chain, Dest, Cond,
27595 static SDValue performVectorCompareAndMaskUnaryOpCombine(SDNode *N,
27596 SelectionDAG &DAG) {
27597 // Take advantage of vector comparisons producing 0 or -1 in each lane to
27598 // optimize away operation when it's from a constant.
27600 // The general transformation is:
27601 // UNARYOP(AND(VECTOR_CMP(x,y), constant)) -->
27602 // AND(VECTOR_CMP(x,y), constant2)
27603 // constant2 = UNARYOP(constant)
27605 // Early exit if this isn't a vector operation, the operand of the
27606 // unary operation isn't a bitwise AND, or if the sizes of the operations
27607 // aren't the same.
27608 EVT VT = N->getValueType(0);
27609 if (!VT.isVector() || N->getOperand(0)->getOpcode() != ISD::AND ||
27610 N->getOperand(0)->getOperand(0)->getOpcode() != ISD::SETCC ||
27611 VT.getSizeInBits() != N->getOperand(0)->getValueType(0).getSizeInBits())
27614 // Now check that the other operand of the AND is a constant. We could
27615 // make the transformation for non-constant splats as well, but it's unclear
27616 // that would be a benefit as it would not eliminate any operations, just
27617 // perform one more step in scalar code before moving to the vector unit.
27618 if (BuildVectorSDNode *BV =
27619 dyn_cast<BuildVectorSDNode>(N->getOperand(0)->getOperand(1))) {
27620 // Bail out if the vector isn't a constant.
27621 if (!BV->isConstant())
27624 // Everything checks out. Build up the new and improved node.
27626 EVT IntVT = BV->getValueType(0);
27627 // Create a new constant of the appropriate type for the transformed
27629 SDValue SourceConst = DAG.getNode(N->getOpcode(), DL, VT, SDValue(BV, 0));
27630 // The AND node needs bitcasts to/from an integer vector type around it.
27631 SDValue MaskConst = DAG.getBitcast(IntVT, SourceConst);
27632 SDValue NewAnd = DAG.getNode(ISD::AND, DL, IntVT,
27633 N->getOperand(0)->getOperand(0), MaskConst);
27634 SDValue Res = DAG.getBitcast(VT, NewAnd);
27641 static SDValue PerformUINT_TO_FPCombine(SDNode *N, SelectionDAG &DAG,
27642 const X86Subtarget *Subtarget) {
27643 SDValue Op0 = N->getOperand(0);
27644 EVT VT = N->getValueType(0);
27645 EVT InVT = Op0.getValueType();
27646 EVT InSVT = InVT.getScalarType();
27647 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
27649 // UINT_TO_FP(vXi8) -> SINT_TO_FP(ZEXT(vXi8 to vXi32))
27650 // UINT_TO_FP(vXi16) -> SINT_TO_FP(ZEXT(vXi16 to vXi32))
27651 if (InVT.isVector() && (InSVT == MVT::i8 || InSVT == MVT::i16)) {
27653 EVT DstVT = EVT::getVectorVT(*DAG.getContext(), MVT::i32,
27654 InVT.getVectorNumElements());
27655 SDValue P = DAG.getNode(ISD::ZERO_EXTEND, dl, DstVT, Op0);
27657 if (TLI.isOperationLegal(ISD::UINT_TO_FP, DstVT))
27658 return DAG.getNode(ISD::UINT_TO_FP, dl, VT, P);
27660 return DAG.getNode(ISD::SINT_TO_FP, dl, VT, P);
27666 static SDValue PerformSINT_TO_FPCombine(SDNode *N, SelectionDAG &DAG,
27667 const X86Subtarget *Subtarget) {
27668 // First try to optimize away the conversion entirely when it's
27669 // conditionally from a constant. Vectors only.
27670 if (SDValue Res = performVectorCompareAndMaskUnaryOpCombine(N, DAG))
27673 // Now move on to more general possibilities.
27674 SDValue Op0 = N->getOperand(0);
27675 EVT VT = N->getValueType(0);
27676 EVT InVT = Op0.getValueType();
27677 EVT InSVT = InVT.getScalarType();
27679 // SINT_TO_FP(vXi8) -> SINT_TO_FP(SEXT(vXi8 to vXi32))
27680 // SINT_TO_FP(vXi16) -> SINT_TO_FP(SEXT(vXi16 to vXi32))
27681 if (InVT.isVector() && (InSVT == MVT::i8 || InSVT == MVT::i16)) {
27683 EVT DstVT = EVT::getVectorVT(*DAG.getContext(), MVT::i32,
27684 InVT.getVectorNumElements());
27685 SDValue P = DAG.getNode(ISD::SIGN_EXTEND, dl, DstVT, Op0);
27686 return DAG.getNode(ISD::SINT_TO_FP, dl, VT, P);
27689 // Transform (SINT_TO_FP (i64 ...)) into an x87 operation if we have
27690 // a 32-bit target where SSE doesn't support i64->FP operations.
27691 if (!Subtarget->useSoftFloat() && Op0.getOpcode() == ISD::LOAD) {
27692 LoadSDNode *Ld = cast<LoadSDNode>(Op0.getNode());
27693 EVT LdVT = Ld->getValueType(0);
27695 // This transformation is not supported if the result type is f16
27696 if (VT == MVT::f16)
27699 if (!Ld->isVolatile() && !VT.isVector() &&
27700 ISD::isNON_EXTLoad(Op0.getNode()) && Op0.hasOneUse() &&
27701 !Subtarget->is64Bit() && LdVT == MVT::i64) {
27702 SDValue FILDChain = Subtarget->getTargetLowering()->BuildFILD(
27703 SDValue(N, 0), LdVT, Ld->getChain(), Op0, DAG);
27704 DAG.ReplaceAllUsesOfValueWith(Op0.getValue(1), FILDChain.getValue(1));
27711 // Optimize RES, EFLAGS = X86ISD::ADC LHS, RHS, EFLAGS
27712 static SDValue PerformADCCombine(SDNode *N, SelectionDAG &DAG,
27713 X86TargetLowering::DAGCombinerInfo &DCI) {
27714 // If the LHS and RHS of the ADC node are zero, then it can't overflow and
27715 // the result is either zero or one (depending on the input carry bit).
27716 // Strength reduce this down to a "set on carry" aka SETCC_CARRY&1.
27717 if (X86::isZeroNode(N->getOperand(0)) &&
27718 X86::isZeroNode(N->getOperand(1)) &&
27719 // We don't have a good way to replace an EFLAGS use, so only do this when
27721 SDValue(N, 1).use_empty()) {
27723 EVT VT = N->getValueType(0);
27724 SDValue CarryOut = DAG.getConstant(0, DL, N->getValueType(1));
27725 SDValue Res1 = DAG.getNode(ISD::AND, DL, VT,
27726 DAG.getNode(X86ISD::SETCC_CARRY, DL, VT,
27727 DAG.getConstant(X86::COND_B, DL,
27730 DAG.getConstant(1, DL, VT));
27731 return DCI.CombineTo(N, Res1, CarryOut);
27737 // fold (add Y, (sete X, 0)) -> adc 0, Y
27738 // (add Y, (setne X, 0)) -> sbb -1, Y
27739 // (sub (sete X, 0), Y) -> sbb 0, Y
27740 // (sub (setne X, 0), Y) -> adc -1, Y
27741 static SDValue OptimizeConditionalInDecrement(SDNode *N, SelectionDAG &DAG) {
27744 // Look through ZExts.
27745 SDValue Ext = N->getOperand(N->getOpcode() == ISD::SUB ? 1 : 0);
27746 if (Ext.getOpcode() != ISD::ZERO_EXTEND || !Ext.hasOneUse())
27749 SDValue SetCC = Ext.getOperand(0);
27750 if (SetCC.getOpcode() != X86ISD::SETCC || !SetCC.hasOneUse())
27753 X86::CondCode CC = (X86::CondCode)SetCC.getConstantOperandVal(0);
27754 if (CC != X86::COND_E && CC != X86::COND_NE)
27757 SDValue Cmp = SetCC.getOperand(1);
27758 if (Cmp.getOpcode() != X86ISD::CMP || !Cmp.hasOneUse() ||
27759 !X86::isZeroNode(Cmp.getOperand(1)) ||
27760 !Cmp.getOperand(0).getValueType().isInteger())
27763 SDValue CmpOp0 = Cmp.getOperand(0);
27764 SDValue NewCmp = DAG.getNode(X86ISD::CMP, DL, MVT::i32, CmpOp0,
27765 DAG.getConstant(1, DL, CmpOp0.getValueType()));
27767 SDValue OtherVal = N->getOperand(N->getOpcode() == ISD::SUB ? 0 : 1);
27768 if (CC == X86::COND_NE)
27769 return DAG.getNode(N->getOpcode() == ISD::SUB ? X86ISD::ADC : X86ISD::SBB,
27770 DL, OtherVal.getValueType(), OtherVal,
27771 DAG.getConstant(-1ULL, DL, OtherVal.getValueType()),
27773 return DAG.getNode(N->getOpcode() == ISD::SUB ? X86ISD::SBB : X86ISD::ADC,
27774 DL, OtherVal.getValueType(), OtherVal,
27775 DAG.getConstant(0, DL, OtherVal.getValueType()), NewCmp);
27778 /// PerformADDCombine - Do target-specific dag combines on integer adds.
27779 static SDValue PerformAddCombine(SDNode *N, SelectionDAG &DAG,
27780 const X86Subtarget *Subtarget) {
27781 EVT VT = N->getValueType(0);
27782 SDValue Op0 = N->getOperand(0);
27783 SDValue Op1 = N->getOperand(1);
27785 // Try to synthesize horizontal adds from adds of shuffles.
27786 if (((Subtarget->hasSSSE3() && (VT == MVT::v8i16 || VT == MVT::v4i32)) ||
27787 (Subtarget->hasInt256() && (VT == MVT::v16i16 || VT == MVT::v8i32))) &&
27788 isHorizontalBinOp(Op0, Op1, true))
27789 return DAG.getNode(X86ISD::HADD, SDLoc(N), VT, Op0, Op1);
27791 return OptimizeConditionalInDecrement(N, DAG);
27794 static SDValue PerformSubCombine(SDNode *N, SelectionDAG &DAG,
27795 const X86Subtarget *Subtarget) {
27796 SDValue Op0 = N->getOperand(0);
27797 SDValue Op1 = N->getOperand(1);
27799 // X86 can't encode an immediate LHS of a sub. See if we can push the
27800 // negation into a preceding instruction.
27801 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op0)) {
27802 // If the RHS of the sub is a XOR with one use and a constant, invert the
27803 // immediate. Then add one to the LHS of the sub so we can turn
27804 // X-Y -> X+~Y+1, saving one register.
27805 if (Op1->hasOneUse() && Op1.getOpcode() == ISD::XOR &&
27806 isa<ConstantSDNode>(Op1.getOperand(1))) {
27807 APInt XorC = cast<ConstantSDNode>(Op1.getOperand(1))->getAPIntValue();
27808 EVT VT = Op0.getValueType();
27809 SDValue NewXor = DAG.getNode(ISD::XOR, SDLoc(Op1), VT,
27811 DAG.getConstant(~XorC, SDLoc(Op1), VT));
27812 return DAG.getNode(ISD::ADD, SDLoc(N), VT, NewXor,
27813 DAG.getConstant(C->getAPIntValue() + 1, SDLoc(N), VT));
27817 // Try to synthesize horizontal adds from adds of shuffles.
27818 EVT VT = N->getValueType(0);
27819 if (((Subtarget->hasSSSE3() && (VT == MVT::v8i16 || VT == MVT::v4i32)) ||
27820 (Subtarget->hasInt256() && (VT == MVT::v16i16 || VT == MVT::v8i32))) &&
27821 isHorizontalBinOp(Op0, Op1, true))
27822 return DAG.getNode(X86ISD::HSUB, SDLoc(N), VT, Op0, Op1);
27824 return OptimizeConditionalInDecrement(N, DAG);
27827 /// performVZEXTCombine - Performs build vector combines
27828 static SDValue performVZEXTCombine(SDNode *N, SelectionDAG &DAG,
27829 TargetLowering::DAGCombinerInfo &DCI,
27830 const X86Subtarget *Subtarget) {
27832 MVT VT = N->getSimpleValueType(0);
27833 SDValue Op = N->getOperand(0);
27834 MVT OpVT = Op.getSimpleValueType();
27835 MVT OpEltVT = OpVT.getVectorElementType();
27836 unsigned InputBits = OpEltVT.getSizeInBits() * VT.getVectorNumElements();
27838 // (vzext (bitcast (vzext (x)) -> (vzext x)
27840 while (V.getOpcode() == ISD::BITCAST)
27841 V = V.getOperand(0);
27843 if (V != Op && V.getOpcode() == X86ISD::VZEXT) {
27844 MVT InnerVT = V.getSimpleValueType();
27845 MVT InnerEltVT = InnerVT.getVectorElementType();
27847 // If the element sizes match exactly, we can just do one larger vzext. This
27848 // is always an exact type match as vzext operates on integer types.
27849 if (OpEltVT == InnerEltVT) {
27850 assert(OpVT == InnerVT && "Types must match for vzext!");
27851 return DAG.getNode(X86ISD::VZEXT, DL, VT, V.getOperand(0));
27854 // The only other way we can combine them is if only a single element of the
27855 // inner vzext is used in the input to the outer vzext.
27856 if (InnerEltVT.getSizeInBits() < InputBits)
27859 // In this case, the inner vzext is completely dead because we're going to
27860 // only look at bits inside of the low element. Just do the outer vzext on
27861 // a bitcast of the input to the inner.
27862 return DAG.getNode(X86ISD::VZEXT, DL, VT, DAG.getBitcast(OpVT, V));
27865 // Check if we can bypass extracting and re-inserting an element of an input
27866 // vector. Essentially:
27867 // (bitcast (sclr2vec (ext_vec_elt x))) -> (bitcast x)
27868 if (V.getOpcode() == ISD::SCALAR_TO_VECTOR &&
27869 V.getOperand(0).getOpcode() == ISD::EXTRACT_VECTOR_ELT &&
27870 V.getOperand(0).getSimpleValueType().getSizeInBits() == InputBits) {
27871 SDValue ExtractedV = V.getOperand(0);
27872 SDValue OrigV = ExtractedV.getOperand(0);
27873 if (isNullConstant(ExtractedV.getOperand(1))) {
27874 MVT OrigVT = OrigV.getSimpleValueType();
27875 // Extract a subvector if necessary...
27876 if (OrigVT.getSizeInBits() > OpVT.getSizeInBits()) {
27877 int Ratio = OrigVT.getSizeInBits() / OpVT.getSizeInBits();
27878 OrigVT = MVT::getVectorVT(OrigVT.getVectorElementType(),
27879 OrigVT.getVectorNumElements() / Ratio);
27880 OrigV = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, OrigVT, OrigV,
27881 DAG.getIntPtrConstant(0, DL));
27883 Op = DAG.getBitcast(OpVT, OrigV);
27884 return DAG.getNode(X86ISD::VZEXT, DL, VT, Op);
27891 SDValue X86TargetLowering::PerformDAGCombine(SDNode *N,
27892 DAGCombinerInfo &DCI) const {
27893 SelectionDAG &DAG = DCI.DAG;
27894 switch (N->getOpcode()) {
27896 case ISD::EXTRACT_VECTOR_ELT:
27897 return PerformEXTRACT_VECTOR_ELTCombine(N, DAG, DCI);
27900 case X86ISD::SHRUNKBLEND:
27901 return PerformSELECTCombine(N, DAG, DCI, Subtarget);
27902 case ISD::BITCAST: return PerformBITCASTCombine(N, DAG, Subtarget);
27903 case X86ISD::CMOV: return PerformCMOVCombine(N, DAG, DCI, Subtarget);
27904 case ISD::ADD: return PerformAddCombine(N, DAG, Subtarget);
27905 case ISD::SUB: return PerformSubCombine(N, DAG, Subtarget);
27906 case X86ISD::ADC: return PerformADCCombine(N, DAG, DCI);
27907 case ISD::MUL: return PerformMulCombine(N, DAG, DCI);
27910 case ISD::SRL: return PerformShiftCombine(N, DAG, DCI, Subtarget);
27911 case ISD::AND: return PerformAndCombine(N, DAG, DCI, Subtarget);
27912 case ISD::OR: return PerformOrCombine(N, DAG, DCI, Subtarget);
27913 case ISD::XOR: return PerformXorCombine(N, DAG, DCI, Subtarget);
27914 case ISD::LOAD: return PerformLOADCombine(N, DAG, DCI, Subtarget);
27915 case ISD::MLOAD: return PerformMLOADCombine(N, DAG, DCI, Subtarget);
27916 case ISD::STORE: return PerformSTORECombine(N, DAG, Subtarget);
27917 case ISD::MSTORE: return PerformMSTORECombine(N, DAG, Subtarget);
27918 case ISD::SINT_TO_FP: return PerformSINT_TO_FPCombine(N, DAG, Subtarget);
27919 case ISD::UINT_TO_FP: return PerformUINT_TO_FPCombine(N, DAG, Subtarget);
27920 case ISD::FADD: return PerformFADDCombine(N, DAG, Subtarget);
27921 case ISD::FSUB: return PerformFSUBCombine(N, DAG, Subtarget);
27922 case ISD::FNEG: return PerformFNEGCombine(N, DAG, Subtarget);
27923 case ISD::TRUNCATE: return PerformTRUNCATECombine(N, DAG, Subtarget);
27925 case X86ISD::FOR: return PerformFORCombine(N, DAG, Subtarget);
27927 case X86ISD::FMAX: return PerformFMinFMaxCombine(N, DAG);
27929 case ISD::FMAXNUM: return performFMinNumFMaxNumCombine(N, DAG,
27931 case X86ISD::FAND: return PerformFANDCombine(N, DAG, Subtarget);
27932 case X86ISD::FANDN: return PerformFANDNCombine(N, DAG, Subtarget);
27933 case X86ISD::BT: return PerformBTCombine(N, DAG, DCI);
27934 case X86ISD::VZEXT_MOVL: return PerformVZEXT_MOVLCombine(N, DAG);
27935 case ISD::ANY_EXTEND:
27936 case ISD::ZERO_EXTEND: return PerformZExtCombine(N, DAG, DCI, Subtarget);
27937 case ISD::SIGN_EXTEND: return PerformSExtCombine(N, DAG, DCI, Subtarget);
27938 case ISD::SIGN_EXTEND_INREG:
27939 return PerformSIGN_EXTEND_INREGCombine(N, DAG, Subtarget);
27940 case ISD::SETCC: return PerformISDSETCCCombine(N, DAG, Subtarget);
27941 case X86ISD::SETCC: return PerformSETCCCombine(N, DAG, DCI, Subtarget);
27942 case X86ISD::BRCOND: return PerformBrCondCombine(N, DAG, DCI, Subtarget);
27943 case X86ISD::VZEXT: return performVZEXTCombine(N, DAG, DCI, Subtarget);
27944 case X86ISD::SHUFP: // Handle all target specific shuffles
27945 case X86ISD::PALIGNR:
27946 case X86ISD::BLENDI:
27947 case X86ISD::UNPCKH:
27948 case X86ISD::UNPCKL:
27949 case X86ISD::MOVHLPS:
27950 case X86ISD::MOVLHPS:
27951 case X86ISD::PSHUFB:
27952 case X86ISD::PSHUFD:
27953 case X86ISD::PSHUFHW:
27954 case X86ISD::PSHUFLW:
27955 case X86ISD::MOVSS:
27956 case X86ISD::MOVSD:
27957 case X86ISD::VPERMILPI:
27958 case X86ISD::VPERM2X128:
27959 case ISD::VECTOR_SHUFFLE: return PerformShuffleCombine(N, DAG, DCI,Subtarget);
27960 case ISD::FMA: return PerformFMACombine(N, DAG, Subtarget);
27962 case ISD::MSCATTER: return PerformGatherScatterCombine(N, DAG);
27968 /// isTypeDesirableForOp - Return true if the target has native support for
27969 /// the specified value type and it is 'desirable' to use the type for the
27970 /// given node type. e.g. On x86 i16 is legal, but undesirable since i16
27971 /// instruction encodings are longer and some i16 instructions are slow.
27972 bool X86TargetLowering::isTypeDesirableForOp(unsigned Opc, EVT VT) const {
27973 if (!isTypeLegal(VT))
27975 if (VT != MVT::i16)
27982 case ISD::SIGN_EXTEND:
27983 case ISD::ZERO_EXTEND:
27984 case ISD::ANY_EXTEND:
27997 /// This function checks if any of the users of EFLAGS copies the EFLAGS. We
27998 /// know that the code that lowers COPY of EFLAGS has to use the stack, and if
27999 /// we don't adjust the stack we clobber the first frame index.
28000 /// See X86InstrInfo::copyPhysReg.
28001 bool X86TargetLowering::hasCopyImplyingStackAdjustment(
28002 MachineFunction *MF) const {
28003 const MachineRegisterInfo &MRI = MF->getRegInfo();
28005 return any_of(MRI.reg_instructions(X86::EFLAGS),
28006 [](const MachineInstr &RI) { return RI.isCopy(); });
28009 /// IsDesirableToPromoteOp - This method query the target whether it is
28010 /// beneficial for dag combiner to promote the specified node. If true, it
28011 /// should return the desired promotion type by reference.
28012 bool X86TargetLowering::IsDesirableToPromoteOp(SDValue Op, EVT &PVT) const {
28013 EVT VT = Op.getValueType();
28014 if (VT != MVT::i16)
28017 bool Promote = false;
28018 bool Commute = false;
28019 switch (Op.getOpcode()) {
28022 LoadSDNode *LD = cast<LoadSDNode>(Op);
28023 // If the non-extending load has a single use and it's not live out, then it
28024 // might be folded.
28025 if (LD->getExtensionType() == ISD::NON_EXTLOAD /*&&
28026 Op.hasOneUse()*/) {
28027 for (SDNode::use_iterator UI = Op.getNode()->use_begin(),
28028 UE = Op.getNode()->use_end(); UI != UE; ++UI) {
28029 // The only case where we'd want to promote LOAD (rather then it being
28030 // promoted as an operand is when it's only use is liveout.
28031 if (UI->getOpcode() != ISD::CopyToReg)
28038 case ISD::SIGN_EXTEND:
28039 case ISD::ZERO_EXTEND:
28040 case ISD::ANY_EXTEND:
28045 SDValue N0 = Op.getOperand(0);
28046 // Look out for (store (shl (load), x)).
28047 if (MayFoldLoad(N0) && MayFoldIntoStore(Op))
28060 SDValue N0 = Op.getOperand(0);
28061 SDValue N1 = Op.getOperand(1);
28062 if (!Commute && MayFoldLoad(N1))
28064 // Avoid disabling potential load folding opportunities.
28065 if (MayFoldLoad(N0) && (!isa<ConstantSDNode>(N1) || MayFoldIntoStore(Op)))
28067 if (MayFoldLoad(N1) && (!isa<ConstantSDNode>(N0) || MayFoldIntoStore(Op)))
28077 //===----------------------------------------------------------------------===//
28078 // X86 Inline Assembly Support
28079 //===----------------------------------------------------------------------===//
28081 // Helper to match a string separated by whitespace.
28082 static bool matchAsm(StringRef S, ArrayRef<const char *> Pieces) {
28083 S = S.substr(S.find_first_not_of(" \t")); // Skip leading whitespace.
28085 for (StringRef Piece : Pieces) {
28086 if (!S.startswith(Piece)) // Check if the piece matches.
28089 S = S.substr(Piece.size());
28090 StringRef::size_type Pos = S.find_first_not_of(" \t");
28091 if (Pos == 0) // We matched a prefix.
28100 static bool clobbersFlagRegisters(const SmallVector<StringRef, 4> &AsmPieces) {
28102 if (AsmPieces.size() == 3 || AsmPieces.size() == 4) {
28103 if (std::count(AsmPieces.begin(), AsmPieces.end(), "~{cc}") &&
28104 std::count(AsmPieces.begin(), AsmPieces.end(), "~{flags}") &&
28105 std::count(AsmPieces.begin(), AsmPieces.end(), "~{fpsr}")) {
28107 if (AsmPieces.size() == 3)
28109 else if (std::count(AsmPieces.begin(), AsmPieces.end(), "~{dirflag}"))
28116 bool X86TargetLowering::ExpandInlineAsm(CallInst *CI) const {
28117 InlineAsm *IA = cast<InlineAsm>(CI->getCalledValue());
28119 std::string AsmStr = IA->getAsmString();
28121 IntegerType *Ty = dyn_cast<IntegerType>(CI->getType());
28122 if (!Ty || Ty->getBitWidth() % 16 != 0)
28125 // TODO: should remove alternatives from the asmstring: "foo {a|b}" -> "foo a"
28126 SmallVector<StringRef, 4> AsmPieces;
28127 SplitString(AsmStr, AsmPieces, ";\n");
28129 switch (AsmPieces.size()) {
28130 default: return false;
28132 // FIXME: this should verify that we are targeting a 486 or better. If not,
28133 // we will turn this bswap into something that will be lowered to logical
28134 // ops instead of emitting the bswap asm. For now, we don't support 486 or
28135 // lower so don't worry about this.
28137 if (matchAsm(AsmPieces[0], {"bswap", "$0"}) ||
28138 matchAsm(AsmPieces[0], {"bswapl", "$0"}) ||
28139 matchAsm(AsmPieces[0], {"bswapq", "$0"}) ||
28140 matchAsm(AsmPieces[0], {"bswap", "${0:q}"}) ||
28141 matchAsm(AsmPieces[0], {"bswapl", "${0:q}"}) ||
28142 matchAsm(AsmPieces[0], {"bswapq", "${0:q}"})) {
28143 // No need to check constraints, nothing other than the equivalent of
28144 // "=r,0" would be valid here.
28145 return IntrinsicLowering::LowerToByteSwap(CI);
28148 // rorw $$8, ${0:w} --> llvm.bswap.i16
28149 if (CI->getType()->isIntegerTy(16) &&
28150 IA->getConstraintString().compare(0, 5, "=r,0,") == 0 &&
28151 (matchAsm(AsmPieces[0], {"rorw", "$$8,", "${0:w}"}) ||
28152 matchAsm(AsmPieces[0], {"rolw", "$$8,", "${0:w}"}))) {
28154 StringRef ConstraintsStr = IA->getConstraintString();
28155 SplitString(StringRef(ConstraintsStr).substr(5), AsmPieces, ",");
28156 array_pod_sort(AsmPieces.begin(), AsmPieces.end());
28157 if (clobbersFlagRegisters(AsmPieces))
28158 return IntrinsicLowering::LowerToByteSwap(CI);
28162 if (CI->getType()->isIntegerTy(32) &&
28163 IA->getConstraintString().compare(0, 5, "=r,0,") == 0 &&
28164 matchAsm(AsmPieces[0], {"rorw", "$$8,", "${0:w}"}) &&
28165 matchAsm(AsmPieces[1], {"rorl", "$$16,", "$0"}) &&
28166 matchAsm(AsmPieces[2], {"rorw", "$$8,", "${0:w}"})) {
28168 StringRef ConstraintsStr = IA->getConstraintString();
28169 SplitString(StringRef(ConstraintsStr).substr(5), AsmPieces, ",");
28170 array_pod_sort(AsmPieces.begin(), AsmPieces.end());
28171 if (clobbersFlagRegisters(AsmPieces))
28172 return IntrinsicLowering::LowerToByteSwap(CI);
28175 if (CI->getType()->isIntegerTy(64)) {
28176 InlineAsm::ConstraintInfoVector Constraints = IA->ParseConstraints();
28177 if (Constraints.size() >= 2 &&
28178 Constraints[0].Codes.size() == 1 && Constraints[0].Codes[0] == "A" &&
28179 Constraints[1].Codes.size() == 1 && Constraints[1].Codes[0] == "0") {
28180 // bswap %eax / bswap %edx / xchgl %eax, %edx -> llvm.bswap.i64
28181 if (matchAsm(AsmPieces[0], {"bswap", "%eax"}) &&
28182 matchAsm(AsmPieces[1], {"bswap", "%edx"}) &&
28183 matchAsm(AsmPieces[2], {"xchgl", "%eax,", "%edx"}))
28184 return IntrinsicLowering::LowerToByteSwap(CI);
28192 /// getConstraintType - Given a constraint letter, return the type of
28193 /// constraint it is for this target.
28194 X86TargetLowering::ConstraintType
28195 X86TargetLowering::getConstraintType(StringRef Constraint) const {
28196 if (Constraint.size() == 1) {
28197 switch (Constraint[0]) {
28208 return C_RegisterClass;
28232 return TargetLowering::getConstraintType(Constraint);
28235 /// Examine constraint type and operand type and determine a weight value.
28236 /// This object must already have been set up with the operand type
28237 /// and the current alternative constraint selected.
28238 TargetLowering::ConstraintWeight
28239 X86TargetLowering::getSingleConstraintMatchWeight(
28240 AsmOperandInfo &info, const char *constraint) const {
28241 ConstraintWeight weight = CW_Invalid;
28242 Value *CallOperandVal = info.CallOperandVal;
28243 // If we don't have a value, we can't do a match,
28244 // but allow it at the lowest weight.
28245 if (!CallOperandVal)
28247 Type *type = CallOperandVal->getType();
28248 // Look at the constraint type.
28249 switch (*constraint) {
28251 weight = TargetLowering::getSingleConstraintMatchWeight(info, constraint);
28262 if (CallOperandVal->getType()->isIntegerTy())
28263 weight = CW_SpecificReg;
28268 if (type->isFloatingPointTy())
28269 weight = CW_SpecificReg;
28272 if (type->isX86_MMXTy() && Subtarget->hasMMX())
28273 weight = CW_SpecificReg;
28277 if (((type->getPrimitiveSizeInBits() == 128) && Subtarget->hasSSE1()) ||
28278 ((type->getPrimitiveSizeInBits() == 256) && Subtarget->hasFp256()))
28279 weight = CW_Register;
28282 if (ConstantInt *C = dyn_cast<ConstantInt>(info.CallOperandVal)) {
28283 if (C->getZExtValue() <= 31)
28284 weight = CW_Constant;
28288 if (ConstantInt *C = dyn_cast<ConstantInt>(CallOperandVal)) {
28289 if (C->getZExtValue() <= 63)
28290 weight = CW_Constant;
28294 if (ConstantInt *C = dyn_cast<ConstantInt>(CallOperandVal)) {
28295 if ((C->getSExtValue() >= -0x80) && (C->getSExtValue() <= 0x7f))
28296 weight = CW_Constant;
28300 if (ConstantInt *C = dyn_cast<ConstantInt>(CallOperandVal)) {
28301 if ((C->getZExtValue() == 0xff) || (C->getZExtValue() == 0xffff))
28302 weight = CW_Constant;
28306 if (ConstantInt *C = dyn_cast<ConstantInt>(CallOperandVal)) {
28307 if (C->getZExtValue() <= 3)
28308 weight = CW_Constant;
28312 if (ConstantInt *C = dyn_cast<ConstantInt>(CallOperandVal)) {
28313 if (C->getZExtValue() <= 0xff)
28314 weight = CW_Constant;
28319 if (isa<ConstantFP>(CallOperandVal)) {
28320 weight = CW_Constant;
28324 if (ConstantInt *C = dyn_cast<ConstantInt>(CallOperandVal)) {
28325 if ((C->getSExtValue() >= -0x80000000LL) &&
28326 (C->getSExtValue() <= 0x7fffffffLL))
28327 weight = CW_Constant;
28331 if (ConstantInt *C = dyn_cast<ConstantInt>(CallOperandVal)) {
28332 if (C->getZExtValue() <= 0xffffffff)
28333 weight = CW_Constant;
28340 /// LowerXConstraint - try to replace an X constraint, which matches anything,
28341 /// with another that has more specific requirements based on the type of the
28342 /// corresponding operand.
28343 const char *X86TargetLowering::
28344 LowerXConstraint(EVT ConstraintVT) const {
28345 // FP X constraints get lowered to SSE1/2 registers if available, otherwise
28346 // 'f' like normal targets.
28347 if (ConstraintVT.isFloatingPoint()) {
28348 if (Subtarget->hasSSE2())
28350 if (Subtarget->hasSSE1())
28354 return TargetLowering::LowerXConstraint(ConstraintVT);
28357 /// LowerAsmOperandForConstraint - Lower the specified operand into the Ops
28358 /// vector. If it is invalid, don't add anything to Ops.
28359 void X86TargetLowering::LowerAsmOperandForConstraint(SDValue Op,
28360 std::string &Constraint,
28361 std::vector<SDValue>&Ops,
28362 SelectionDAG &DAG) const {
28365 // Only support length 1 constraints for now.
28366 if (Constraint.length() > 1) return;
28368 char ConstraintLetter = Constraint[0];
28369 switch (ConstraintLetter) {
28372 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op)) {
28373 if (C->getZExtValue() <= 31) {
28374 Result = DAG.getTargetConstant(C->getZExtValue(), SDLoc(Op),
28375 Op.getValueType());
28381 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op)) {
28382 if (C->getZExtValue() <= 63) {
28383 Result = DAG.getTargetConstant(C->getZExtValue(), SDLoc(Op),
28384 Op.getValueType());
28390 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op)) {
28391 if (isInt<8>(C->getSExtValue())) {
28392 Result = DAG.getTargetConstant(C->getZExtValue(), SDLoc(Op),
28393 Op.getValueType());
28399 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op)) {
28400 if (C->getZExtValue() == 0xff || C->getZExtValue() == 0xffff ||
28401 (Subtarget->is64Bit() && C->getZExtValue() == 0xffffffff)) {
28402 Result = DAG.getTargetConstant(C->getSExtValue(), SDLoc(Op),
28403 Op.getValueType());
28409 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op)) {
28410 if (C->getZExtValue() <= 3) {
28411 Result = DAG.getTargetConstant(C->getZExtValue(), SDLoc(Op),
28412 Op.getValueType());
28418 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op)) {
28419 if (C->getZExtValue() <= 255) {
28420 Result = DAG.getTargetConstant(C->getZExtValue(), SDLoc(Op),
28421 Op.getValueType());
28427 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op)) {
28428 if (C->getZExtValue() <= 127) {
28429 Result = DAG.getTargetConstant(C->getZExtValue(), SDLoc(Op),
28430 Op.getValueType());
28436 // 32-bit signed value
28437 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op)) {
28438 if (ConstantInt::isValueValidForType(Type::getInt32Ty(*DAG.getContext()),
28439 C->getSExtValue())) {
28440 // Widen to 64 bits here to get it sign extended.
28441 Result = DAG.getTargetConstant(C->getSExtValue(), SDLoc(Op), MVT::i64);
28444 // FIXME gcc accepts some relocatable values here too, but only in certain
28445 // memory models; it's complicated.
28450 // 32-bit unsigned value
28451 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op)) {
28452 if (ConstantInt::isValueValidForType(Type::getInt32Ty(*DAG.getContext()),
28453 C->getZExtValue())) {
28454 Result = DAG.getTargetConstant(C->getZExtValue(), SDLoc(Op),
28455 Op.getValueType());
28459 // FIXME gcc accepts some relocatable values here too, but only in certain
28460 // memory models; it's complicated.
28464 // Literal immediates are always ok.
28465 if (ConstantSDNode *CST = dyn_cast<ConstantSDNode>(Op)) {
28466 // Widen to 64 bits here to get it sign extended.
28467 Result = DAG.getTargetConstant(CST->getSExtValue(), SDLoc(Op), MVT::i64);
28471 // In any sort of PIC mode addresses need to be computed at runtime by
28472 // adding in a register or some sort of table lookup. These can't
28473 // be used as immediates.
28474 if (Subtarget->isPICStyleGOT() || Subtarget->isPICStyleStubPIC())
28477 // If we are in non-pic codegen mode, we allow the address of a global (with
28478 // an optional displacement) to be used with 'i'.
28479 GlobalAddressSDNode *GA = nullptr;
28480 int64_t Offset = 0;
28482 // Match either (GA), (GA+C), (GA+C1+C2), etc.
28484 if ((GA = dyn_cast<GlobalAddressSDNode>(Op))) {
28485 Offset += GA->getOffset();
28487 } else if (Op.getOpcode() == ISD::ADD) {
28488 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op.getOperand(1))) {
28489 Offset += C->getZExtValue();
28490 Op = Op.getOperand(0);
28493 } else if (Op.getOpcode() == ISD::SUB) {
28494 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op.getOperand(1))) {
28495 Offset += -C->getZExtValue();
28496 Op = Op.getOperand(0);
28501 // Otherwise, this isn't something we can handle, reject it.
28505 const GlobalValue *GV = GA->getGlobal();
28506 // If we require an extra load to get this address, as in PIC mode, we
28507 // can't accept it.
28508 if (isGlobalStubReference(
28509 Subtarget->ClassifyGlobalReference(GV, DAG.getTarget())))
28512 Result = DAG.getTargetGlobalAddress(GV, SDLoc(Op),
28513 GA->getValueType(0), Offset);
28518 if (Result.getNode()) {
28519 Ops.push_back(Result);
28522 return TargetLowering::LowerAsmOperandForConstraint(Op, Constraint, Ops, DAG);
28525 std::pair<unsigned, const TargetRegisterClass *>
28526 X86TargetLowering::getRegForInlineAsmConstraint(const TargetRegisterInfo *TRI,
28527 StringRef Constraint,
28529 // First, see if this is a constraint that directly corresponds to an LLVM
28531 if (Constraint.size() == 1) {
28532 // GCC Constraint Letters
28533 switch (Constraint[0]) {
28535 // TODO: Slight differences here in allocation order and leaving
28536 // RIP in the class. Do they matter any more here than they do
28537 // in the normal allocation?
28538 case 'q': // GENERAL_REGS in 64-bit mode, Q_REGS in 32-bit mode.
28539 if (Subtarget->is64Bit()) {
28540 if (VT == MVT::i32 || VT == MVT::f32)
28541 return std::make_pair(0U, &X86::GR32RegClass);
28542 if (VT == MVT::i16)
28543 return std::make_pair(0U, &X86::GR16RegClass);
28544 if (VT == MVT::i8 || VT == MVT::i1)
28545 return std::make_pair(0U, &X86::GR8RegClass);
28546 if (VT == MVT::i64 || VT == MVT::f64)
28547 return std::make_pair(0U, &X86::GR64RegClass);
28550 // 32-bit fallthrough
28551 case 'Q': // Q_REGS
28552 if (VT == MVT::i32 || VT == MVT::f32)
28553 return std::make_pair(0U, &X86::GR32_ABCDRegClass);
28554 if (VT == MVT::i16)
28555 return std::make_pair(0U, &X86::GR16_ABCDRegClass);
28556 if (VT == MVT::i8 || VT == MVT::i1)
28557 return std::make_pair(0U, &X86::GR8_ABCD_LRegClass);
28558 if (VT == MVT::i64)
28559 return std::make_pair(0U, &X86::GR64_ABCDRegClass);
28561 case 'r': // GENERAL_REGS
28562 case 'l': // INDEX_REGS
28563 if (VT == MVT::i8 || VT == MVT::i1)
28564 return std::make_pair(0U, &X86::GR8RegClass);
28565 if (VT == MVT::i16)
28566 return std::make_pair(0U, &X86::GR16RegClass);
28567 if (VT == MVT::i32 || VT == MVT::f32 || !Subtarget->is64Bit())
28568 return std::make_pair(0U, &X86::GR32RegClass);
28569 return std::make_pair(0U, &X86::GR64RegClass);
28570 case 'R': // LEGACY_REGS
28571 if (VT == MVT::i8 || VT == MVT::i1)
28572 return std::make_pair(0U, &X86::GR8_NOREXRegClass);
28573 if (VT == MVT::i16)
28574 return std::make_pair(0U, &X86::GR16_NOREXRegClass);
28575 if (VT == MVT::i32 || !Subtarget->is64Bit())
28576 return std::make_pair(0U, &X86::GR32_NOREXRegClass);
28577 return std::make_pair(0U, &X86::GR64_NOREXRegClass);
28578 case 'f': // FP Stack registers.
28579 // If SSE is enabled for this VT, use f80 to ensure the isel moves the
28580 // value to the correct fpstack register class.
28581 if (VT == MVT::f32 && !isScalarFPTypeInSSEReg(VT))
28582 return std::make_pair(0U, &X86::RFP32RegClass);
28583 if (VT == MVT::f64 && !isScalarFPTypeInSSEReg(VT))
28584 return std::make_pair(0U, &X86::RFP64RegClass);
28585 return std::make_pair(0U, &X86::RFP80RegClass);
28586 case 'y': // MMX_REGS if MMX allowed.
28587 if (!Subtarget->hasMMX()) break;
28588 return std::make_pair(0U, &X86::VR64RegClass);
28589 case 'Y': // SSE_REGS if SSE2 allowed
28590 if (!Subtarget->hasSSE2()) break;
28592 case 'x': // SSE_REGS if SSE1 allowed or AVX_REGS if AVX allowed
28593 if (!Subtarget->hasSSE1()) break;
28595 switch (VT.SimpleTy) {
28597 // Scalar SSE types.
28600 return std::make_pair(0U, &X86::FR32RegClass);
28603 return std::make_pair(0U, &X86::FR64RegClass);
28604 // TODO: Handle f128 and i128 in FR128RegClass after it is tested well.
28612 return std::make_pair(0U, &X86::VR128RegClass);
28620 return std::make_pair(0U, &X86::VR256RegClass);
28625 return std::make_pair(0U, &X86::VR512RegClass);
28631 // Use the default implementation in TargetLowering to convert the register
28632 // constraint into a member of a register class.
28633 std::pair<unsigned, const TargetRegisterClass*> Res;
28634 Res = TargetLowering::getRegForInlineAsmConstraint(TRI, Constraint, VT);
28636 // Not found as a standard register?
28638 // Map st(0) -> st(7) -> ST0
28639 if (Constraint.size() == 7 && Constraint[0] == '{' &&
28640 tolower(Constraint[1]) == 's' &&
28641 tolower(Constraint[2]) == 't' &&
28642 Constraint[3] == '(' &&
28643 (Constraint[4] >= '0' && Constraint[4] <= '7') &&
28644 Constraint[5] == ')' &&
28645 Constraint[6] == '}') {
28647 Res.first = X86::FP0+Constraint[4]-'0';
28648 Res.second = &X86::RFP80RegClass;
28652 // GCC allows "st(0)" to be called just plain "st".
28653 if (StringRef("{st}").equals_lower(Constraint)) {
28654 Res.first = X86::FP0;
28655 Res.second = &X86::RFP80RegClass;
28660 if (StringRef("{flags}").equals_lower(Constraint)) {
28661 Res.first = X86::EFLAGS;
28662 Res.second = &X86::CCRRegClass;
28666 // 'A' means EAX + EDX.
28667 if (Constraint == "A") {
28668 Res.first = X86::EAX;
28669 Res.second = &X86::GR32_ADRegClass;
28675 // Otherwise, check to see if this is a register class of the wrong value
28676 // type. For example, we want to map "{ax},i32" -> {eax}, we don't want it to
28677 // turn into {ax},{dx}.
28678 // MVT::Other is used to specify clobber names.
28679 if (Res.second->hasType(VT) || VT == MVT::Other)
28680 return Res; // Correct type already, nothing to do.
28682 // Get a matching integer of the correct size. i.e. "ax" with MVT::32 should
28683 // return "eax". This should even work for things like getting 64bit integer
28684 // registers when given an f64 type.
28685 const TargetRegisterClass *Class = Res.second;
28686 if (Class == &X86::GR8RegClass || Class == &X86::GR16RegClass ||
28687 Class == &X86::GR32RegClass || Class == &X86::GR64RegClass) {
28688 unsigned Size = VT.getSizeInBits();
28689 if (Size == 1) Size = 8;
28690 unsigned DestReg = getX86SubSuperRegisterOrZero(Res.first, Size);
28692 Res.first = DestReg;
28693 Res.second = Size == 8 ? &X86::GR8RegClass
28694 : Size == 16 ? &X86::GR16RegClass
28695 : Size == 32 ? &X86::GR32RegClass
28696 : &X86::GR64RegClass;
28697 assert(Res.second->contains(Res.first) && "Register in register class");
28699 // No register found/type mismatch.
28701 Res.second = nullptr;
28703 } else if (Class == &X86::FR32RegClass || Class == &X86::FR64RegClass ||
28704 Class == &X86::VR128RegClass || Class == &X86::VR256RegClass ||
28705 Class == &X86::FR32XRegClass || Class == &X86::FR64XRegClass ||
28706 Class == &X86::VR128XRegClass || Class == &X86::VR256XRegClass ||
28707 Class == &X86::VR512RegClass) {
28708 // Handle references to XMM physical registers that got mapped into the
28709 // wrong class. This can happen with constraints like {xmm0} where the
28710 // target independent register mapper will just pick the first match it can
28711 // find, ignoring the required type.
28713 // TODO: Handle f128 and i128 in FR128RegClass after it is tested well.
28714 if (VT == MVT::f32 || VT == MVT::i32)
28715 Res.second = &X86::FR32RegClass;
28716 else if (VT == MVT::f64 || VT == MVT::i64)
28717 Res.second = &X86::FR64RegClass;
28718 else if (X86::VR128RegClass.hasType(VT))
28719 Res.second = &X86::VR128RegClass;
28720 else if (X86::VR256RegClass.hasType(VT))
28721 Res.second = &X86::VR256RegClass;
28722 else if (X86::VR512RegClass.hasType(VT))
28723 Res.second = &X86::VR512RegClass;
28725 // Type mismatch and not a clobber: Return an error;
28727 Res.second = nullptr;
28734 int X86TargetLowering::getScalingFactorCost(const DataLayout &DL,
28735 const AddrMode &AM, Type *Ty,
28736 unsigned AS) const {
28737 // Scaling factors are not free at all.
28738 // An indexed folded instruction, i.e., inst (reg1, reg2, scale),
28739 // will take 2 allocations in the out of order engine instead of 1
28740 // for plain addressing mode, i.e. inst (reg1).
28742 // vaddps (%rsi,%drx), %ymm0, %ymm1
28743 // Requires two allocations (one for the load, one for the computation)
28745 // vaddps (%rsi), %ymm0, %ymm1
28746 // Requires just 1 allocation, i.e., freeing allocations for other operations
28747 // and having less micro operations to execute.
28749 // For some X86 architectures, this is even worse because for instance for
28750 // stores, the complex addressing mode forces the instruction to use the
28751 // "load" ports instead of the dedicated "store" port.
28752 // E.g., on Haswell:
28753 // vmovaps %ymm1, (%r8, %rdi) can use port 2 or 3.
28754 // vmovaps %ymm1, (%r8) can use port 2, 3, or 7.
28755 if (isLegalAddressingMode(DL, AM, Ty, AS))
28756 // Scale represents reg2 * scale, thus account for 1
28757 // as soon as we use a second register.
28758 return AM.Scale != 0;
28762 bool X86TargetLowering::isIntDivCheap(EVT VT, AttributeSet Attr) const {
28763 // Integer division on x86 is expensive. However, when aggressively optimizing
28764 // for code size, we prefer to use a div instruction, as it is usually smaller
28765 // than the alternative sequence.
28766 // The exception to this is vector division. Since x86 doesn't have vector
28767 // integer division, leaving the division as-is is a loss even in terms of
28768 // size, because it will have to be scalarized, while the alternative code
28769 // sequence can be performed in vector form.
28770 bool OptSize = Attr.hasAttribute(AttributeSet::FunctionIndex,
28771 Attribute::MinSize);
28772 return OptSize && !VT.isVector();