2005-11-15 08:40:23 +08:00
|
|
|
//===-- X86ISelLowering.h - X86 DAG Lowering Interface ----------*- C++ -*-===//
|
|
|
|
//
|
2019-01-19 16:50:56 +08:00
|
|
|
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
|
|
|
|
// See https://llvm.org/LICENSE.txt for license information.
|
|
|
|
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
|
2005-11-15 08:40:23 +08:00
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
//
|
|
|
|
// This file defines the interfaces that X86 uses to lower LLVM code into a
|
|
|
|
// selection DAG.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2014-08-14 00:26:38 +08:00
|
|
|
#ifndef LLVM_LIB_TARGET_X86_X86ISELLOWERING_H
|
|
|
|
#define LLVM_LIB_TARGET_X86_X86ISELLOWERING_H
|
2005-11-15 08:40:23 +08:00
|
|
|
|
2012-12-04 15:12:27 +08:00
|
|
|
#include "llvm/CodeGen/CallingConvLower.h"
|
2005-11-15 08:40:23 +08:00
|
|
|
#include "llvm/CodeGen/SelectionDAG.h"
|
2017-11-17 09:07:10 +08:00
|
|
|
#include "llvm/CodeGen/TargetLowering.h"
|
2012-12-04 15:12:27 +08:00
|
|
|
#include "llvm/Target/TargetOptions.h"
|
2005-11-15 08:40:23 +08:00
|
|
|
|
|
|
|
namespace llvm {
|
2014-06-10 01:08:19 +08:00
|
|
|
class X86Subtarget;
|
2014-03-19 14:53:25 +08:00
|
|
|
class X86TargetMachine;
|
|
|
|
|
2005-11-15 08:40:23 +08:00
|
|
|
namespace X86ISD {
|
2006-01-06 08:43:03 +08:00
|
|
|
// X86 Specific DAG Nodes
|
2015-05-08 05:33:59 +08:00
|
|
|
enum NodeType : unsigned {
|
2005-11-15 08:40:23 +08:00
|
|
|
// Start the numbering where the builtin ops leave off.
|
2008-09-24 02:42:32 +08:00
|
|
|
FIRST_NUMBER = ISD::BUILTIN_OP_END,
|
2005-11-15 08:40:23 +08:00
|
|
|
|
2015-03-04 04:58:35 +08:00
|
|
|
/// Bit scan forward.
|
2007-12-14 10:13:44 +08:00
|
|
|
BSF,
|
2015-03-04 04:58:35 +08:00
|
|
|
/// Bit scan reverse.
|
2007-12-14 10:13:44 +08:00
|
|
|
BSR,
|
|
|
|
|
2015-03-04 04:58:35 +08:00
|
|
|
/// Double shift instructions. These correspond to
|
2006-01-10 02:33:28 +08:00
|
|
|
/// X86::SHLDxx and X86::SHRDxx instructions.
|
|
|
|
SHLD,
|
|
|
|
SHRD,
|
|
|
|
|
2015-03-04 04:58:35 +08:00
|
|
|
/// Bitwise logical AND of floating point values. This corresponds
|
2006-01-31 11:14:29 +08:00
|
|
|
/// to X86::ANDPS or X86::ANDPD.
|
|
|
|
FAND,
|
|
|
|
|
2015-03-04 04:58:35 +08:00
|
|
|
/// Bitwise logical OR of floating point values. This corresponds
|
2007-01-05 15:55:56 +08:00
|
|
|
/// to X86::ORPS or X86::ORPD.
|
|
|
|
FOR,
|
|
|
|
|
2015-03-04 04:58:35 +08:00
|
|
|
/// Bitwise logical XOR of floating point values. This corresponds
|
2006-02-01 06:28:30 +08:00
|
|
|
/// to X86::XORPS or X86::XORPD.
|
|
|
|
FXOR,
|
|
|
|
|
2015-03-04 04:58:35 +08:00
|
|
|
/// Bitwise logical ANDNOT of floating point values. This
|
X86: Turn fp selects into mask operations.
double test(double a, double b, double c, double d) { return a<b ? c : d; }
before:
_test:
ucomisd %xmm0, %xmm1
ja LBB0_2
movaps %xmm3, %xmm2
LBB0_2:
movaps %xmm2, %xmm0
after:
_test:
cmpltsd %xmm1, %xmm0
andpd %xmm0, %xmm2
andnpd %xmm3, %xmm0
orpd %xmm2, %xmm0
Small speedup on Benchmarks/SmallPT
llvm-svn: 187706
2013-08-04 20:05:16 +08:00
|
|
|
/// corresponds to X86::ANDNPS or X86::ANDNPD.
|
|
|
|
FANDN,
|
|
|
|
|
2015-03-04 04:58:35 +08:00
|
|
|
/// These operations represent an abstract X86 call
|
2005-11-15 08:40:23 +08:00
|
|
|
/// instruction, which includes a bunch of information. In particular the
|
|
|
|
/// operands of these node are:
|
|
|
|
///
|
|
|
|
/// #0 - The incoming token chain
|
|
|
|
/// #1 - The callee
|
|
|
|
/// #2 - The number of arg bytes the caller pushes on the stack.
|
|
|
|
/// #3 - The number of arg bytes the callee pops off the stack.
|
|
|
|
/// #4 - The value to pass in AL/AX/EAX (optional)
|
|
|
|
/// #5 - The value to pass in DL/DX/EDX (optional)
|
|
|
|
///
|
|
|
|
/// The result values of these nodes are:
|
|
|
|
///
|
|
|
|
/// #0 - The outgoing token chain
|
|
|
|
/// #1 - The first register result value (optional)
|
|
|
|
/// #2 - The second register result value (optional)
|
|
|
|
///
|
|
|
|
CALL,
|
Major calling convention code refactoring.
Instead of awkwardly encoding calling-convention information with ISD::CALL,
ISD::FORMAL_ARGUMENTS, ISD::RET, and ISD::ARG_FLAGS nodes, TargetLowering
provides three virtual functions for targets to override:
LowerFormalArguments, LowerCall, and LowerRet, which replace the custom
lowering done on the special nodes. They provide the same information, but
in a more immediately usable format.
This also reworks much of the target-independent tail call logic. The
decision of whether or not to perform a tail call is now cleanly split
between target-independent portions, and the target dependent portion
in IsEligibleForTailCallOptimization.
This also synchronizes all in-tree targets, to help enable future
refactoring and feature work.
llvm-svn: 78142
2009-08-05 09:29:28 +08:00
|
|
|
|
2018-03-17 21:29:46 +08:00
|
|
|
/// Same as call except it adds the NoTrack prefix.
|
|
|
|
NT_CALL,
|
|
|
|
|
2005-12-17 09:21:05 +08:00
|
|
|
/// X86 compare and logical compare instructions.
|
2007-09-18 01:42:53 +08:00
|
|
|
CMP, COMI, UCOMI,
|
2005-12-17 09:21:05 +08:00
|
|
|
|
2008-12-24 06:45:23 +08:00
|
|
|
/// X86 bit-test instructions.
|
|
|
|
BT,
|
|
|
|
|
2010-12-20 08:59:46 +08:00
|
|
|
/// X86 SetCC. Operand 0 is condition code, and operand 1 is the EFLAGS
|
|
|
|
/// operand, usually produced by a CMP instruction.
|
2005-12-22 04:21:51 +08:00
|
|
|
SETCC,
|
|
|
|
|
2013-12-16 21:52:35 +08:00
|
|
|
/// X86 Select
|
2019-01-12 16:15:54 +08:00
|
|
|
SELECTS,
|
2013-12-16 21:52:35 +08:00
|
|
|
|
2009-12-15 08:53:42 +08:00
|
|
|
// Same as SETCC except it's materialized with a sbb and the value is all
|
|
|
|
// one's or all zero's.
|
2010-12-20 06:08:31 +08:00
|
|
|
SETCC_CARRY, // R = carry_bit ? ~0 : 0
|
2009-12-15 08:53:42 +08:00
|
|
|
|
2011-06-04 07:53:54 +08:00
|
|
|
/// X86 FP SETCC, implemented with CMP{cc}SS/CMP{cc}SD.
|
|
|
|
/// Operands are two FP values to compare; result is a mask of
|
|
|
|
/// 0s or 1s. Generally DTRT for C/C++ with NaNs.
|
2013-12-16 21:52:35 +08:00
|
|
|
FSETCC,
|
2011-06-04 07:53:54 +08:00
|
|
|
|
2016-09-21 14:37:54 +08:00
|
|
|
/// X86 FP SETCC, similar to above, but with output as an i1 mask and
|
2019-03-11 12:36:49 +08:00
|
|
|
/// and a version with SAE.
|
|
|
|
FSETCCM, FSETCCM_SAE,
|
2016-09-21 14:37:54 +08:00
|
|
|
|
2009-03-12 14:46:02 +08:00
|
|
|
/// X86 conditional moves. Operand 0 and operand 1 are the two values
|
|
|
|
/// to select from. Operand 2 is the condition code, and operand 3 is the
|
2019-06-29 05:45:55 +08:00
|
|
|
/// flag operand produced by a CMP or TEST instruction.
|
2005-12-17 09:21:05 +08:00
|
|
|
CMOV,
|
2005-12-20 07:12:38 +08:00
|
|
|
|
2009-03-23 23:40:10 +08:00
|
|
|
/// X86 conditional branches. Operand 0 is the chain operand, operand 1
|
|
|
|
/// is the block to branch if condition is true, operand 2 is the
|
|
|
|
/// condition code, and operand 3 is the flag operand produced by a CMP
|
2005-12-22 04:21:51 +08:00
|
|
|
/// or TEST instruction.
|
2005-12-20 07:12:38 +08:00
|
|
|
BRCOND,
|
2005-12-21 10:39:21 +08:00
|
|
|
|
2018-03-17 21:29:46 +08:00
|
|
|
/// BRIND node with NoTrack prefix. Operand 0 is the chain operand and
|
|
|
|
/// operand 1 is the target address.
|
|
|
|
NT_BRIND,
|
|
|
|
|
2009-03-23 23:40:10 +08:00
|
|
|
/// Return with a flag operand. Operand 0 is the chain operand, operand
|
|
|
|
/// 1 is the number of bytes of stack to pop.
|
2005-12-21 10:39:21 +08:00
|
|
|
RET_FLAG,
|
2006-01-12 06:15:48 +08:00
|
|
|
|
2015-12-21 22:07:14 +08:00
|
|
|
/// Return from interrupt. Operand 0 is the number of bytes to pop.
|
|
|
|
IRET,
|
|
|
|
|
2015-03-04 04:58:35 +08:00
|
|
|
/// Repeat fill, corresponds to X86::REP_STOSx.
|
2006-01-12 06:15:48 +08:00
|
|
|
REP_STOS,
|
|
|
|
|
2015-03-04 04:58:35 +08:00
|
|
|
/// Repeat move, corresponds to X86::REP_MOVSx.
|
2006-01-12 06:15:48 +08:00
|
|
|
REP_MOVS,
|
2006-02-01 06:28:30 +08:00
|
|
|
|
2015-03-04 04:58:35 +08:00
|
|
|
/// On Darwin, this node represents the result of the popl
|
2006-02-18 08:15:05 +08:00
|
|
|
/// at function entry, used for PIC code.
|
|
|
|
GlobalBaseReg,
|
2006-02-23 10:43:52 +08:00
|
|
|
|
2016-11-17 05:48:59 +08:00
|
|
|
/// A wrapper node for TargetConstantPool, TargetJumpTable,
|
|
|
|
/// TargetExternalSymbol, TargetGlobalAddress, TargetGlobalTLSAddress,
|
|
|
|
/// MCSymbol and TargetBlockAddress.
|
2006-02-24 04:41:18 +08:00
|
|
|
Wrapper,
|
2006-03-22 07:01:21 +08:00
|
|
|
|
2015-03-04 04:58:35 +08:00
|
|
|
/// Special wrapper used under X86-64 PIC mode for RIP
|
2006-12-01 05:55:46 +08:00
|
|
|
/// relative displacements.
|
|
|
|
WrapperRIP,
|
|
|
|
|
2015-03-04 04:58:35 +08:00
|
|
|
/// Copies a 64-bit value from the low word of an XMM vector
|
2017-03-29 18:44:51 +08:00
|
|
|
/// to an MMX vector.
|
2010-10-01 07:57:10 +08:00
|
|
|
MOVDQ2Q,
|
|
|
|
|
2015-03-04 04:58:35 +08:00
|
|
|
/// Copies a 32-bit value from the low word of a MMX
|
2012-10-31 06:15:38 +08:00
|
|
|
/// vector to a GPR.
|
|
|
|
MMX_MOVD2W,
|
|
|
|
|
2015-03-04 04:58:35 +08:00
|
|
|
/// Copies a GPR into the low 32-bit word of a MMX vector
|
2015-02-05 21:23:07 +08:00
|
|
|
/// and zero out the high word.
|
|
|
|
MMX_MOVW2D,
|
|
|
|
|
2015-03-04 04:58:35 +08:00
|
|
|
/// Extract an 8-bit value from a vector and zero extend it to
|
2008-02-11 12:19:36 +08:00
|
|
|
/// i32, corresponds to X86::PEXTRB.
|
|
|
|
PEXTRB,
|
|
|
|
|
2015-03-04 04:58:35 +08:00
|
|
|
/// Extract a 16-bit value from a vector and zero extend it to
|
2006-04-01 05:55:24 +08:00
|
|
|
/// i32, corresponds to X86::PEXTRW.
|
2006-04-01 03:22:53 +08:00
|
|
|
PEXTRW,
|
2006-04-01 05:55:24 +08:00
|
|
|
|
2015-03-04 04:58:35 +08:00
|
|
|
/// Insert any element of a 4 x float vector into any element
|
2008-02-11 12:19:36 +08:00
|
|
|
/// of a destination 4 x floatvector.
|
|
|
|
INSERTPS,
|
|
|
|
|
2015-03-04 04:58:35 +08:00
|
|
|
/// Insert the lower 8-bits of a 32-bit value to a vector,
|
2008-02-11 12:19:36 +08:00
|
|
|
/// corresponds to X86::PINSRB.
|
|
|
|
PINSRB,
|
|
|
|
|
2015-03-04 04:58:35 +08:00
|
|
|
/// Insert the lower 16-bits of a 32-bit value to a vector,
|
2006-04-01 05:55:24 +08:00
|
|
|
/// corresponds to X86::PINSRW.
|
2017-02-10 01:08:47 +08:00
|
|
|
PINSRW,
|
2006-11-11 05:43:37 +08:00
|
|
|
|
2015-03-04 04:58:35 +08:00
|
|
|
/// Shuffle 16 8-bit values within a vector.
|
Generate better code for v8i16 shuffles on SSE2
Generate better code for v16i8 shuffles on SSE2 (avoids stack)
Generate pshufb for v8i16 and v16i8 shuffles on SSSE3 where it is fewer uops.
Document the shuffle matching logic and add some FIXMEs for later further
cleanups.
New tests that test the above.
Examples:
New:
_shuf2:
pextrw $7, %xmm0, %eax
punpcklqdq %xmm1, %xmm0
pshuflw $128, %xmm0, %xmm0
pinsrw $2, %eax, %xmm0
Old:
_shuf2:
pextrw $2, %xmm0, %eax
pextrw $7, %xmm0, %ecx
pinsrw $2, %ecx, %xmm0
pinsrw $3, %eax, %xmm0
movd %xmm1, %eax
pinsrw $4, %eax, %xmm0
ret
=========
New:
_shuf4:
punpcklqdq %xmm1, %xmm0
pshufb LCPI1_0, %xmm0
Old:
_shuf4:
pextrw $3, %xmm0, %eax
movsd %xmm1, %xmm0
pextrw $3, %xmm1, %ecx
pinsrw $4, %ecx, %xmm0
pinsrw $5, %eax, %xmm0
========
New:
_shuf1:
pushl %ebx
pushl %edi
pushl %esi
pextrw $1, %xmm0, %eax
rolw $8, %ax
movd %xmm0, %ecx
rolw $8, %cx
pextrw $5, %xmm0, %edx
pextrw $4, %xmm0, %esi
pextrw $3, %xmm0, %edi
pextrw $2, %xmm0, %ebx
movaps %xmm0, %xmm1
pinsrw $0, %ecx, %xmm1
pinsrw $1, %eax, %xmm1
rolw $8, %bx
pinsrw $2, %ebx, %xmm1
rolw $8, %di
pinsrw $3, %edi, %xmm1
rolw $8, %si
pinsrw $4, %esi, %xmm1
rolw $8, %dx
pinsrw $5, %edx, %xmm1
pextrw $7, %xmm0, %eax
rolw $8, %ax
movaps %xmm1, %xmm0
pinsrw $7, %eax, %xmm0
popl %esi
popl %edi
popl %ebx
ret
Old:
_shuf1:
subl $252, %esp
movaps %xmm0, (%esp)
movaps %xmm0, 16(%esp)
movaps %xmm0, 32(%esp)
movaps %xmm0, 48(%esp)
movaps %xmm0, 64(%esp)
movaps %xmm0, 80(%esp)
movaps %xmm0, 96(%esp)
movaps %xmm0, 224(%esp)
movaps %xmm0, 208(%esp)
movaps %xmm0, 192(%esp)
movaps %xmm0, 176(%esp)
movaps %xmm0, 160(%esp)
movaps %xmm0, 144(%esp)
movaps %xmm0, 128(%esp)
movaps %xmm0, 112(%esp)
movzbl 14(%esp), %eax
movd %eax, %xmm1
movzbl 22(%esp), %eax
movd %eax, %xmm2
punpcklbw %xmm1, %xmm2
movzbl 42(%esp), %eax
movd %eax, %xmm1
movzbl 50(%esp), %eax
movd %eax, %xmm3
punpcklbw %xmm1, %xmm3
punpcklbw %xmm2, %xmm3
movzbl 77(%esp), %eax
movd %eax, %xmm1
movzbl 84(%esp), %eax
movd %eax, %xmm2
punpcklbw %xmm1, %xmm2
movzbl 104(%esp), %eax
movd %eax, %xmm1
punpcklbw %xmm1, %xmm0
punpcklbw %xmm2, %xmm0
movaps %xmm0, %xmm1
punpcklbw %xmm3, %xmm1
movzbl 127(%esp), %eax
movd %eax, %xmm0
movzbl 135(%esp), %eax
movd %eax, %xmm2
punpcklbw %xmm0, %xmm2
movzbl 155(%esp), %eax
movd %eax, %xmm0
movzbl 163(%esp), %eax
movd %eax, %xmm3
punpcklbw %xmm0, %xmm3
punpcklbw %xmm2, %xmm3
movzbl 188(%esp), %eax
movd %eax, %xmm0
movzbl 197(%esp), %eax
movd %eax, %xmm2
punpcklbw %xmm0, %xmm2
movzbl 217(%esp), %eax
movd %eax, %xmm4
movzbl 225(%esp), %eax
movd %eax, %xmm0
punpcklbw %xmm4, %xmm0
punpcklbw %xmm2, %xmm0
punpcklbw %xmm3, %xmm0
punpcklbw %xmm1, %xmm0
addl $252, %esp
ret
llvm-svn: 65311
2009-02-23 16:49:38 +08:00
|
|
|
PSHUFB,
|
2011-02-26 05:41:48 +08:00
|
|
|
|
[x86] Implement a faster vector population count based on the PSHUFB
in-register LUT technique.
Summary:
A description of this technique can be found here:
http://wm.ite.pl/articles/sse-popcount.html
The core of the idea is to use an in-register lookup table and the
PSHUFB instruction to compute the population count for the low and high
nibbles of each byte, and then to use horizontal sums to aggregate these
into vector population counts with wider element types.
On x86 there is an instruction that will directly compute the horizontal
sum for the low 8 and high 8 bytes, giving vNi64 popcount very easily.
Various tricks are used to get vNi32 and vNi16 from the vNi8 that the
LUT computes.
The base implemantion of this, and most of the work, was done by Bruno
in a follow up to D6531. See Bruno's detailed post there for lots of
timing information about these changes.
I have extended Bruno's patch in the following ways:
0) I committed the new tests with baseline sequences so this shows
a diff, and regenerated the tests using the update scripts.
1) Bruno had noticed and mentioned in IRC a redundant mask that
I removed.
2) I introduced a particular optimization for the i32 vector cases where
we use PSHL + PSADBW to compute the the low i32 popcounts, and PSHUFD
+ PSADBW to compute doubled high i32 popcounts. This takes advantage
of the fact that to line up the high i32 popcounts we have to shift
them anyways, and we can shift them by one fewer bit to effectively
divide the count by two. While the PSHUFD based horizontal add is no
faster, it doesn't require registers or load traffic the way a mask
would, and provides more ILP as it happens on different ports with
high throughput.
3) I did some code cleanups throughout to simplify the implementation
logic.
4) I refactored it to continue to use the parallel bitmath lowering when
SSSE3 is not available to preserve the performance of that version on
SSE2 targets where it is still much better than scalarizing as we'll
still do a bitmath implementation of popcount even in scalar code
there.
With #1 and #2 above, I analyzed the result in IACA for sandybridge,
ivybridge, and haswell. In every case I measured, the throughput is the
same or better using the LUT lowering, even v2i64 and v4i64, and even
compared with using the native popcnt instruction! The latency of the
LUT lowering is often higher than the latency of the scalarized popcnt
instruction sequence, but I think those latency measurements are deeply
misleading. Keeping the operation fully in the vector unit and having
many chances for increased throughput seems much more likely to win.
With this, we can lower every integer vector popcount implementation
using the LUT strategy if we have SSSE3 or better (and thus have
PSHUFB). I've updated the operation lowering to reflect this. This also
fixes an issue where we were scalarizing horribly some AVX lowerings.
Finally, there are some remaining cleanups. There is duplication between
the two techniques in how they perform the horizontal sum once the byte
population count is computed. I'm going to factor and merge those two in
a separate follow-up commit.
Differential Revision: http://reviews.llvm.org/D10084
llvm-svn: 238636
2015-05-30 11:20:59 +08:00
|
|
|
/// Compute Sum of Absolute Differences.
|
|
|
|
PSADBW,
|
2015-08-31 21:09:30 +08:00
|
|
|
/// Compute Double Block Packed Sum-Absolute-Differences
|
|
|
|
DBPSADBW,
|
[x86] Implement a faster vector population count based on the PSHUFB
in-register LUT technique.
Summary:
A description of this technique can be found here:
http://wm.ite.pl/articles/sse-popcount.html
The core of the idea is to use an in-register lookup table and the
PSHUFB instruction to compute the population count for the low and high
nibbles of each byte, and then to use horizontal sums to aggregate these
into vector population counts with wider element types.
On x86 there is an instruction that will directly compute the horizontal
sum for the low 8 and high 8 bytes, giving vNi64 popcount very easily.
Various tricks are used to get vNi32 and vNi16 from the vNi8 that the
LUT computes.
The base implemantion of this, and most of the work, was done by Bruno
in a follow up to D6531. See Bruno's detailed post there for lots of
timing information about these changes.
I have extended Bruno's patch in the following ways:
0) I committed the new tests with baseline sequences so this shows
a diff, and regenerated the tests using the update scripts.
1) Bruno had noticed and mentioned in IRC a redundant mask that
I removed.
2) I introduced a particular optimization for the i32 vector cases where
we use PSHL + PSADBW to compute the the low i32 popcounts, and PSHUFD
+ PSADBW to compute doubled high i32 popcounts. This takes advantage
of the fact that to line up the high i32 popcounts we have to shift
them anyways, and we can shift them by one fewer bit to effectively
divide the count by two. While the PSHUFD based horizontal add is no
faster, it doesn't require registers or load traffic the way a mask
would, and provides more ILP as it happens on different ports with
high throughput.
3) I did some code cleanups throughout to simplify the implementation
logic.
4) I refactored it to continue to use the parallel bitmath lowering when
SSSE3 is not available to preserve the performance of that version on
SSE2 targets where it is still much better than scalarizing as we'll
still do a bitmath implementation of popcount even in scalar code
there.
With #1 and #2 above, I analyzed the result in IACA for sandybridge,
ivybridge, and haswell. In every case I measured, the throughput is the
same or better using the LUT lowering, even v2i64 and v4i64, and even
compared with using the native popcnt instruction! The latency of the
LUT lowering is often higher than the latency of the scalarized popcnt
instruction sequence, but I think those latency measurements are deeply
misleading. Keeping the operation fully in the vector unit and having
many chances for increased throughput seems much more likely to win.
With this, we can lower every integer vector popcount implementation
using the LUT strategy if we have SSSE3 or better (and thus have
PSHUFB). I've updated the operation lowering to reflect this. This also
fixes an issue where we were scalarizing horribly some AVX lowerings.
Finally, there are some remaining cleanups. There is duplication between
the two techniques in how they perform the horizontal sum once the byte
population count is computed. I'm going to factor and merge those two in
a separate follow-up commit.
Differential Revision: http://reviews.llvm.org/D10084
llvm-svn: 238636
2015-05-30 11:20:59 +08:00
|
|
|
|
2015-03-04 04:58:35 +08:00
|
|
|
/// Bitwise Logical AND NOT of Packed FP values.
|
2011-07-14 05:36:47 +08:00
|
|
|
ANDNP,
|
2011-02-26 05:41:48 +08:00
|
|
|
|
2015-03-04 04:58:35 +08:00
|
|
|
/// Blend where the selector is an immediate.
|
2012-12-05 17:24:57 +08:00
|
|
|
BLENDI,
|
2012-04-11 14:40:27 +08:00
|
|
|
|
2017-02-08 03:54:16 +08:00
|
|
|
/// Dynamic (non-constant condition) vector blend where only the sign bits
|
|
|
|
/// of the condition elements are used. This is used to enforce that the
|
2019-01-16 08:20:30 +08:00
|
|
|
/// condition mask is not valid for generic VSELECT optimizations. This
|
2019-01-17 05:46:28 +08:00
|
|
|
/// is also used to implement the intrinsics.
|
|
|
|
/// Operands are in VSELECT order: MASK, TRUE, FALSE
|
2019-01-16 08:20:30 +08:00
|
|
|
BLENDV,
|
2014-11-06 10:25:03 +08:00
|
|
|
|
2015-03-04 04:58:35 +08:00
|
|
|
/// Combined add and sub on an FP vector.
|
2014-09-16 04:09:47 +08:00
|
|
|
ADDSUB,
|
2015-06-03 21:41:48 +08:00
|
|
|
|
2015-03-04 04:58:35 +08:00
|
|
|
// FP vector ops with rounding mode.
|
2019-03-11 12:36:44 +08:00
|
|
|
FADD_RND, FADDS, FADDS_RND,
|
|
|
|
FSUB_RND, FSUBS, FSUBS_RND,
|
|
|
|
FMUL_RND, FMULS, FMULS_RND,
|
|
|
|
FDIV_RND, FDIVS, FDIVS_RND,
|
|
|
|
FMAX_SAE, FMAXS_SAE,
|
|
|
|
FMIN_SAE, FMINS_SAE,
|
|
|
|
FSQRT_RND, FSQRTS, FSQRTS_RND,
|
2015-06-03 21:41:48 +08:00
|
|
|
|
2016-04-03 22:14:32 +08:00
|
|
|
// FP vector get exponent.
|
2019-03-11 12:36:57 +08:00
|
|
|
FGETEXP, FGETEXP_SAE, FGETEXPS, FGETEXPS_SAE,
|
2016-04-03 22:14:32 +08:00
|
|
|
// Extract Normalized Mantissas.
|
2019-03-11 12:36:55 +08:00
|
|
|
VGETMANT, VGETMANT_SAE, VGETMANTS, VGETMANTS_SAE,
|
2016-04-03 22:14:32 +08:00
|
|
|
// FP Scale.
|
2019-03-11 12:36:59 +08:00
|
|
|
SCALEF, SCALEF_RND,
|
|
|
|
SCALEFS, SCALEFS_RND,
|
2016-04-03 22:14:32 +08:00
|
|
|
|
|
|
|
// Unsigned Integer average.
|
2015-06-18 20:30:53 +08:00
|
|
|
AVG,
|
2011-11-19 17:02:40 +08:00
|
|
|
|
2016-04-03 22:14:32 +08:00
|
|
|
/// Integer horizontal add/sub.
|
|
|
|
HADD,
|
2011-11-19 17:02:40 +08:00
|
|
|
HSUB,
|
|
|
|
|
2016-04-03 22:14:32 +08:00
|
|
|
/// Floating point horizontal add/sub.
|
2011-09-23 04:15:48 +08:00
|
|
|
FHADD,
|
|
|
|
FHSUB,
|
|
|
|
|
2015-09-03 17:05:31 +08:00
|
|
|
// Detect Conflicts Within a Vector
|
|
|
|
CONFLICT,
|
|
|
|
|
2015-03-04 04:58:35 +08:00
|
|
|
/// Floating point max and min.
|
2007-04-21 05:38:10 +08:00
|
|
|
FMAX, FMIN,
|
2007-07-10 08:05:58 +08:00
|
|
|
|
2015-03-04 04:58:35 +08:00
|
|
|
/// Commutative FMIN and FMAX.
|
2012-08-19 21:06:16 +08:00
|
|
|
FMAXC, FMINC,
|
|
|
|
|
2017-02-22 14:54:18 +08:00
|
|
|
/// Scalar intrinsic floating point max and min.
|
|
|
|
FMAXS, FMINS,
|
|
|
|
|
2015-03-04 04:58:35 +08:00
|
|
|
/// Floating point reciprocal-sqrt and reciprocal approximation.
|
|
|
|
/// Note that these typically require refinement
|
2007-07-10 08:05:58 +08:00
|
|
|
/// in order to obtain suitable precision.
|
|
|
|
FRSQRT, FRCP,
|
2017-11-05 02:26:41 +08:00
|
|
|
|
|
|
|
// AVX-512 reciprocal approximations with a little more precision.
|
|
|
|
RSQRT14, RSQRT14S, RCP14, RCP14S,
|
2016-09-04 21:28:46 +08:00
|
|
|
|
2015-03-04 04:58:35 +08:00
|
|
|
// Thread Local Storage.
|
2009-04-09 05:14:34 +08:00
|
|
|
TLSADDR,
|
2010-10-21 07:40:27 +08:00
|
|
|
|
2015-03-04 04:58:35 +08:00
|
|
|
// Thread Local Storage. A call to get the start address
|
2012-06-02 00:27:21 +08:00
|
|
|
// of the TLS block for the current module.
|
|
|
|
TLSBASEADDR,
|
|
|
|
|
2015-03-04 04:58:35 +08:00
|
|
|
// Thread Local Storage. When calling to an OS provided
|
2010-06-03 12:07:48 +08:00
|
|
|
// thunk at the address from an earlier relocation.
|
|
|
|
TLSCALL,
|
2009-04-09 05:14:34 +08:00
|
|
|
|
2015-03-04 04:58:35 +08:00
|
|
|
// Exception Handling helpers.
|
2007-10-12 03:40:01 +08:00
|
|
|
EH_RETURN,
|
2010-10-21 07:40:27 +08:00
|
|
|
|
2015-03-04 04:58:35 +08:00
|
|
|
// SjLj exception handling setjmp.
|
2012-10-16 06:39:43 +08:00
|
|
|
EH_SJLJ_SETJMP,
|
|
|
|
|
2015-03-04 04:58:35 +08:00
|
|
|
// SjLj exception handling longjmp.
|
2012-10-16 06:39:43 +08:00
|
|
|
EH_SJLJ_LONGJMP,
|
|
|
|
|
2016-05-31 09:48:07 +08:00
|
|
|
// SjLj exception handling dispatch.
|
|
|
|
EH_SJLJ_SETUP_DISPATCH,
|
|
|
|
|
2015-03-04 04:58:35 +08:00
|
|
|
/// Tail call return. See X86TargetLowering::LowerCall for
|
2013-02-15 07:17:03 +08:00
|
|
|
/// the list of operands.
|
2007-11-16 09:31:51 +08:00
|
|
|
TC_RETURN,
|
|
|
|
|
2015-03-04 04:58:35 +08:00
|
|
|
// Vector move to low scalar and zero higher vector elements.
|
2008-05-10 05:53:03 +08:00
|
|
|
VZEXT_MOVL,
|
|
|
|
|
2015-03-04 04:58:35 +08:00
|
|
|
// Vector integer truncate.
|
2013-08-29 19:56:53 +08:00
|
|
|
VTRUNC,
|
2015-07-25 01:24:15 +08:00
|
|
|
// Vector integer truncate with unsigned/signed saturation.
|
|
|
|
VTRUNCUS, VTRUNCS,
|
2013-08-29 19:56:53 +08:00
|
|
|
|
2019-01-12 08:55:27 +08:00
|
|
|
// Masked version of the above. Used when less than a 128-bit result is
|
|
|
|
// produced since the mask only applies to the lower elements and can't
|
|
|
|
// be represented by a select.
|
|
|
|
// SRC, PASSTHRU, MASK
|
|
|
|
VMTRUNC, VMTRUNCUS, VMTRUNCS,
|
|
|
|
|
2015-03-04 04:58:35 +08:00
|
|
|
// Vector FP extend.
|
2019-03-11 12:36:51 +08:00
|
|
|
VFPEXT, VFPEXT_SAE, VFPEXTS, VFPEXTS_SAE,
|
2012-08-15 05:24:47 +08:00
|
|
|
|
2015-03-04 04:58:35 +08:00
|
|
|
// Vector FP round.
|
2019-03-11 12:36:51 +08:00
|
|
|
VFPROUND, VFPROUND_RND, VFPROUNDS, VFPROUNDS_RND,
|
2012-10-11 00:53:28 +08:00
|
|
|
|
2019-01-13 10:59:57 +08:00
|
|
|
// Masked version of above. Used for v2f64->v4f32.
|
|
|
|
// SRC, PASSTHRU, MASK
|
|
|
|
VMFPROUND,
|
|
|
|
|
2015-03-04 04:58:35 +08:00
|
|
|
// 128-bit vector logical left / right shift
|
2012-01-23 03:15:14 +08:00
|
|
|
VSHLDQ, VSRLDQ,
|
|
|
|
|
2015-03-04 04:58:35 +08:00
|
|
|
// Vector shift elements
|
2012-01-23 03:15:14 +08:00
|
|
|
VSHL, VSRL, VSRA,
|
|
|
|
|
2019-01-17 05:46:32 +08:00
|
|
|
// Vector variable shift
|
|
|
|
VSHLV, VSRLV, VSRAV,
|
2016-06-20 15:05:43 +08:00
|
|
|
|
2015-03-04 04:58:35 +08:00
|
|
|
// Vector shift elements by immediate
|
2012-01-23 03:15:14 +08:00
|
|
|
VSHLI, VSRLI, VSRAI,
|
2009-04-28 02:41:29 +08:00
|
|
|
|
2017-01-30 08:06:01 +08:00
|
|
|
// Shifts of mask registers.
|
|
|
|
KSHIFTL, KSHIFTR,
|
|
|
|
|
2016-01-13 05:19:17 +08:00
|
|
|
// Bit rotate by immediate
|
2016-01-13 20:39:33 +08:00
|
|
|
VROTLI, VROTRI,
|
2016-01-13 05:19:17 +08:00
|
|
|
|
2015-03-04 04:58:35 +08:00
|
|
|
// Vector packed double/float comparison.
|
2012-01-23 07:36:02 +08:00
|
|
|
CMPP,
|
2010-10-21 07:40:27 +08:00
|
|
|
|
2015-03-04 04:58:35 +08:00
|
|
|
// Vector integer comparisons.
|
2012-01-23 06:42:16 +08:00
|
|
|
PCMPEQ, PCMPGT,
|
2013-08-13 21:24:07 +08:00
|
|
|
|
2017-11-23 21:50:27 +08:00
|
|
|
// v8i16 Horizontal minimum and position.
|
|
|
|
PHMINPOS,
|
|
|
|
|
2016-02-01 23:48:21 +08:00
|
|
|
MULTISHIFT,
|
|
|
|
|
2015-03-04 04:58:35 +08:00
|
|
|
/// Vector comparison generating mask bits for fp and
|
2013-08-13 21:24:07 +08:00
|
|
|
/// integer signed and unsigned data types.
|
|
|
|
CMPM,
|
2019-03-11 12:36:49 +08:00
|
|
|
// Vector comparison with SAE for FP values
|
|
|
|
CMPM_SAE,
|
2008-12-12 08:56:36 +08:00
|
|
|
|
2015-03-04 04:58:35 +08:00
|
|
|
// Arithmetic operations with FLAGS results.
|
2019-01-02 14:40:11 +08:00
|
|
|
ADD, SUB, ADC, SBB, SMUL, UMUL,
|
2019-01-03 03:01:05 +08:00
|
|
|
OR, XOR, AND,
|
2011-02-26 05:41:48 +08:00
|
|
|
|
2018-02-13 05:18:11 +08:00
|
|
|
// Bit field extract.
|
|
|
|
BEXTR,
|
|
|
|
|
[X86] X86DAGToDAGISel: handle BZHI selection too, not just BEXTR.
Summary:
As discussed in D52304 / IRC, we now have pattern matching for
'bit extract' in two places - tablegen and `X86DAGToDAGISel`.
There are 4 patterns.
And we will have a problem with `x & (-1 >> (32 - y))` pattern.
* If the mask is one-use, then it is always unfolded into `x << (32 - y) >> (32 - y)` first.
Thus, the existing test coverage is already broken.
* If it is not one-use, then it is not unfolded, and is matched as BZHI.
* If it is not one-use, we will not match it as BEXTR. And if it is one-use, it will have been unfolded already.
So we will either not handle that pattern for BEXTR, or not have test coverage for it.
This is bad.
As discussed with @craig.topper, let's unify this matching, and do everything in `X86DAGToDAGISel`.
Then we will not have code duplication, and will have proper test coverage.
This indeed does not affect any tests, and this is great.
It means that for these two patterns, the `X86DAGToDAGISel` is identical to the tablegen version.
Please review carefully, i'm not fully sure about that intrinsic change, and introduction of the new `X86ISD` opcode.
Reviewers: craig.topper, RKSimon, spatel
Reviewed By: craig.topper
Subscribers: llvm-commits, craig.topper
Differential Revision: https://reviews.llvm.org/D53164
llvm-svn: 344904
2018-10-22 22:12:44 +08:00
|
|
|
// Zero High Bits Starting with Specified Bit Position.
|
|
|
|
BZHI,
|
|
|
|
|
2015-03-04 04:58:35 +08:00
|
|
|
// X86-specific multiply by immediate.
|
2009-07-29 08:28:05 +08:00
|
|
|
MUL_IMM,
|
2010-10-21 07:40:27 +08:00
|
|
|
|
2016-04-04 02:22:03 +08:00
|
|
|
// Vector sign bit extraction.
|
|
|
|
MOVMSK,
|
|
|
|
|
2015-03-04 04:58:35 +08:00
|
|
|
// Vector bitwise comparisons.
|
2009-08-15 09:38:56 +08:00
|
|
|
PTEST,
|
|
|
|
|
2015-03-04 04:58:35 +08:00
|
|
|
// Vector packed fp sign bitwise comparisons.
|
2010-08-11 07:25:42 +08:00
|
|
|
TESTP,
|
|
|
|
|
2016-04-03 22:14:32 +08:00
|
|
|
// OR/AND test for masks.
|
2013-08-05 16:52:21 +08:00
|
|
|
KORTEST,
|
2015-08-31 21:30:19 +08:00
|
|
|
KTEST,
|
2013-08-05 16:52:21 +08:00
|
|
|
|
2018-02-12 09:33:38 +08:00
|
|
|
// ADD for masks.
|
|
|
|
KADD,
|
|
|
|
|
2010-08-21 06:55:05 +08:00
|
|
|
// Several flavors of instructions with vector shuffle behaviors.
|
2016-04-03 22:14:32 +08:00
|
|
|
// Saturated signed/unnsigned packing.
|
2014-06-20 09:05:28 +08:00
|
|
|
PACKSS,
|
|
|
|
PACKUS,
|
2016-04-03 22:14:32 +08:00
|
|
|
// Intra-lane alignr.
|
2013-01-28 14:48:25 +08:00
|
|
|
PALIGNR,
|
2016-04-03 22:14:32 +08:00
|
|
|
// AVX512 inter-lane alignr.
|
2014-08-06 01:22:55 +08:00
|
|
|
VALIGN,
|
2010-08-21 06:55:05 +08:00
|
|
|
PSHUFD,
|
|
|
|
PSHUFHW,
|
|
|
|
PSHUFLW,
|
2012-01-01 07:50:21 +08:00
|
|
|
SHUFP,
|
2017-11-21 17:48:44 +08:00
|
|
|
// VBMI2 Concat & Shift.
|
|
|
|
VSHLD,
|
|
|
|
VSHRD,
|
|
|
|
VSHLDV,
|
|
|
|
VSHRDV,
|
2016-04-03 22:14:32 +08:00
|
|
|
//Shuffle Packed Values at 128-bit granularity.
|
2015-06-03 18:56:40 +08:00
|
|
|
SHUF128,
|
2010-08-21 06:55:05 +08:00
|
|
|
MOVDDUP,
|
|
|
|
MOVSHDUP,
|
|
|
|
MOVSLDUP,
|
|
|
|
MOVLHPS,
|
2010-09-01 05:15:21 +08:00
|
|
|
MOVHLPS,
|
2010-08-21 06:55:05 +08:00
|
|
|
MOVSD,
|
|
|
|
MOVSS,
|
2011-12-06 16:21:25 +08:00
|
|
|
UNPCKL,
|
|
|
|
UNPCKH,
|
2014-09-23 18:08:29 +08:00
|
|
|
VPERMILPV,
|
2014-09-23 06:29:42 +08:00
|
|
|
VPERMILPI,
|
2016-03-04 00:53:50 +08:00
|
|
|
VPERMI,
|
|
|
|
VPERM2X128,
|
|
|
|
|
2016-04-03 22:14:32 +08:00
|
|
|
// Variable Permute (VPERM).
|
2016-03-04 00:53:50 +08:00
|
|
|
// Res = VPERMV MaskV, V0
|
2012-04-16 08:41:45 +08:00
|
|
|
VPERMV,
|
2016-03-04 00:53:50 +08:00
|
|
|
|
2016-04-03 22:14:32 +08:00
|
|
|
// 3-op Variable Permute (VPERMT2).
|
2016-03-04 00:53:50 +08:00
|
|
|
// Res = VPERMV3 V0, MaskV, V1
|
2013-08-11 15:55:09 +08:00
|
|
|
VPERMV3,
|
2016-03-04 00:53:50 +08:00
|
|
|
|
2016-04-03 22:14:32 +08:00
|
|
|
// Bitwise ternary logic.
|
2015-10-15 20:33:24 +08:00
|
|
|
VPTERNLOG,
|
2016-04-03 22:14:32 +08:00
|
|
|
// Fix Up Special Packed Float32/64 values.
|
2019-03-11 12:36:47 +08:00
|
|
|
VFIXUPIMM, VFIXUPIMM_SAE,
|
|
|
|
VFIXUPIMMS, VFIXUPIMMS_SAE,
|
2016-04-03 22:14:32 +08:00
|
|
|
// Range Restriction Calculation For Packed Pairs of Float32/64 values.
|
2019-03-11 12:36:55 +08:00
|
|
|
VRANGE, VRANGE_SAE, VRANGES, VRANGES_SAE,
|
2016-04-03 22:14:32 +08:00
|
|
|
// Reduce - Perform Reduction Transformation on scalar\packed FP.
|
2019-03-11 12:36:55 +08:00
|
|
|
VREDUCE, VREDUCE_SAE, VREDUCES, VREDUCES_SAE,
|
2016-04-03 22:14:32 +08:00
|
|
|
// RndScale - Round FP Values To Include A Given Number Of Fraction Bits.
|
2017-11-13 10:03:00 +08:00
|
|
|
// Also used by the legacy (V)ROUND intrinsics where we mask out the
|
|
|
|
// scaling part of the immediate.
|
2019-03-11 12:36:55 +08:00
|
|
|
VRNDSCALE, VRNDSCALE_SAE, VRNDSCALES, VRNDSCALES_SAE,
|
2016-04-03 22:14:32 +08:00
|
|
|
// Tests Types Of a FP Values for packed types.
|
|
|
|
VFPCLASS,
|
|
|
|
// Tests Types Of a FP Values for scalar types.
|
|
|
|
VFPCLASSS,
|
|
|
|
|
|
|
|
// Broadcast scalar to vector.
|
2011-08-17 10:29:19 +08:00
|
|
|
VBROADCAST,
|
2016-04-03 22:14:32 +08:00
|
|
|
// Broadcast mask to vector.
|
2015-11-18 17:42:45 +08:00
|
|
|
VBROADCASTM,
|
2016-04-03 22:14:32 +08:00
|
|
|
// Broadcast subvector to vector.
|
2015-05-18 14:42:57 +08:00
|
|
|
SUBV_BROADCAST,
|
2016-04-03 22:14:32 +08:00
|
|
|
|
2015-07-07 04:46:41 +08:00
|
|
|
/// SSE4A Extraction and Insertion.
|
|
|
|
EXTRQI, INSERTQI,
|
|
|
|
|
2016-04-03 22:14:32 +08:00
|
|
|
// XOP arithmetic/logical shifts.
|
2015-09-30 16:17:50 +08:00
|
|
|
VPSHA, VPSHL,
|
2016-04-03 22:14:32 +08:00
|
|
|
// XOP signed/unsigned integer comparisons.
|
2015-10-11 22:15:17 +08:00
|
|
|
VPCOM, VPCOMU,
|
2016-04-03 22:14:32 +08:00
|
|
|
// XOP packed permute bytes.
|
2016-03-24 19:52:43 +08:00
|
|
|
VPPERM,
|
2016-06-03 16:06:03 +08:00
|
|
|
// XOP two source permutation.
|
|
|
|
VPERMIL2,
|
2015-09-30 16:17:50 +08:00
|
|
|
|
2016-04-03 22:14:32 +08:00
|
|
|
// Vector multiply packed unsigned doubleword integers.
|
2012-02-05 11:14:49 +08:00
|
|
|
PMULUDQ,
|
2016-04-03 22:14:32 +08:00
|
|
|
// Vector multiply packed signed doubleword integers.
|
2014-04-26 22:12:19 +08:00
|
|
|
PMULDQ,
|
2016-04-03 22:14:32 +08:00
|
|
|
// Vector Multiply Packed UnsignedIntegers with Round and Scale.
|
2015-07-06 22:03:40 +08:00
|
|
|
MULHRS,
|
2016-04-03 22:14:32 +08:00
|
|
|
|
|
|
|
// Multiply and Add Packed Integers.
|
2015-07-21 15:11:28 +08:00
|
|
|
VPMADDUBSW, VPMADDWD,
|
2017-09-25 03:30:55 +08:00
|
|
|
|
|
|
|
// AVX512IFMA multiply and add.
|
|
|
|
// NOTE: These are different than the instruction and perform
|
|
|
|
// op0 x op1 + op2.
|
2016-01-25 19:14:24 +08:00
|
|
|
VPMADD52L, VPMADD52H,
|
2016-04-03 22:14:32 +08:00
|
|
|
|
2017-11-21 18:04:28 +08:00
|
|
|
// VNNI
|
|
|
|
VPDPBUSD,
|
|
|
|
VPDPBUSDS,
|
|
|
|
VPDPWSSD,
|
|
|
|
VPDPWSSDS,
|
|
|
|
|
2016-04-03 22:14:32 +08:00
|
|
|
// FMA nodes.
|
2017-08-24 00:28:04 +08:00
|
|
|
// We use the target independent ISD::FMA for the non-inverted case.
|
2012-08-01 20:06:00 +08:00
|
|
|
FNMADD,
|
|
|
|
FMSUB,
|
|
|
|
FNMSUB,
|
|
|
|
FMADDSUB,
|
|
|
|
FMSUBADD,
|
2016-04-03 22:14:32 +08:00
|
|
|
|
|
|
|
// FMA with rounding mode.
|
2015-01-28 18:21:27 +08:00
|
|
|
FMADD_RND,
|
|
|
|
FNMADD_RND,
|
|
|
|
FMSUB_RND,
|
|
|
|
FNMSUB_RND,
|
|
|
|
FMADDSUB_RND,
|
2015-02-23 23:12:31 +08:00
|
|
|
FMSUBADD_RND,
|
2012-08-01 20:06:00 +08:00
|
|
|
|
2016-04-03 22:14:32 +08:00
|
|
|
// Compress and expand.
|
2014-12-11 23:02:24 +08:00
|
|
|
COMPRESS,
|
|
|
|
EXPAND,
|
|
|
|
|
2017-11-23 19:15:50 +08:00
|
|
|
// Bits shuffle
|
|
|
|
VPSHUFBITQMB,
|
|
|
|
|
2016-09-23 14:24:39 +08:00
|
|
|
// Convert Unsigned/Integer to Floating-Point Value with rounding mode.
|
|
|
|
SINT_TO_FP_RND, UINT_TO_FP_RND,
|
2019-03-11 12:37:01 +08:00
|
|
|
SCALAR_SINT_TO_FP, SCALAR_UINT_TO_FP,
|
2016-09-23 14:24:39 +08:00
|
|
|
SCALAR_SINT_TO_FP_RND, SCALAR_UINT_TO_FP_RND,
|
2015-07-13 21:26:20 +08:00
|
|
|
|
|
|
|
// Vector float/double to signed/unsigned integer.
|
2016-09-23 14:24:39 +08:00
|
|
|
CVTP2SI, CVTP2UI, CVTP2SI_RND, CVTP2UI_RND,
|
2016-02-07 22:59:13 +08:00
|
|
|
// Scalar float/double to signed/unsigned integer.
|
2018-08-15 09:23:00 +08:00
|
|
|
CVTS2SI, CVTS2UI, CVTS2SI_RND, CVTS2UI_RND,
|
2016-09-23 14:24:39 +08:00
|
|
|
|
|
|
|
// Vector float/double to signed/unsigned integer with truncation.
|
2019-03-11 12:36:51 +08:00
|
|
|
CVTTP2SI, CVTTP2UI, CVTTP2SI_SAE, CVTTP2UI_SAE,
|
2016-09-23 14:24:39 +08:00
|
|
|
// Scalar float/double to signed/unsigned integer with truncation.
|
2019-03-11 12:36:51 +08:00
|
|
|
CVTTS2SI, CVTTS2UI, CVTTS2SI_SAE, CVTTS2UI_SAE,
|
2016-04-03 22:14:32 +08:00
|
|
|
|
2016-11-24 20:13:46 +08:00
|
|
|
// Vector signed/unsigned integer to float/double.
|
|
|
|
CVTSI2P, CVTUI2P,
|
|
|
|
|
2019-01-13 10:59:59 +08:00
|
|
|
// Masked versions of above. Used for v2f64->v4f32.
|
|
|
|
// SRC, PASSTHRU, MASK
|
|
|
|
MCVTP2SI, MCVTP2UI, MCVTTP2SI, MCVTTP2UI,
|
2019-01-20 05:26:20 +08:00
|
|
|
MCVTSI2P, MCVTUI2P,
|
2019-01-13 10:59:59 +08:00
|
|
|
|
Enable AVX512_BF16 instructions, which are supported for BFLOAT16 in Cooper Lake
Summary:
1. Enable infrastructure of AVX512_BF16, which is supported for BFLOAT16 in Cooper Lake;
2. Enable VCVTNE2PS2BF16, VCVTNEPS2BF16 and DPBF16PS instructions, which are Vector Neural Network Instructions supporting BFLOAT16 inputs and conversion instructions from IEEE single precision.
VCVTNE2PS2BF16: Convert Two Packed Single Data to One Packed BF16 Data.
VCVTNEPS2BF16: Convert Packed Single Data to Packed BF16 Data.
VDPBF16PS: Dot Product of BF16 Pairs Accumulated into Packed Single Precision.
For more details about BF16 isa, please refer to the latest ISE document: https://software.intel.com/en-us/download/intel-architecture-instruction-set-extensions-programming-reference
Author: LiuTianle
Reviewers: craig.topper, smaslov, LuoYuanke, wxiao3, annita.zhang, RKSimon, spatel
Reviewed By: craig.topper
Subscribers: kristina, llvm-commits
Tags: #llvm
Differential Revision: https://reviews.llvm.org/D60550
llvm-svn: 360017
2019-05-06 16:22:37 +08:00
|
|
|
// Vector float to bfloat16.
|
|
|
|
// Convert TWO packed single data to one packed BF16 data
|
|
|
|
CVTNE2PS2BF16,
|
|
|
|
// Convert packed single data to packed BF16 data
|
|
|
|
CVTNEPS2BF16,
|
|
|
|
// Masked version of above.
|
|
|
|
// SRC, PASSTHRU, MASK
|
|
|
|
MCVTNEPS2BF16,
|
|
|
|
|
|
|
|
// Dot product of BF16 pairs to accumulated into
|
|
|
|
// packed single precision.
|
|
|
|
DPBF16PS,
|
|
|
|
|
2014-10-02 03:39:32 +08:00
|
|
|
// Save xmm argument registers to the stack, according to %al. An operator
|
|
|
|
// is needed so that this can be expanded with control flow.
|
2009-09-26 04:36:54 +08:00
|
|
|
VASTART_SAVE_XMM_REGS,
|
|
|
|
|
2014-10-02 03:39:32 +08:00
|
|
|
// Windows's _chkstk call to do stack probing.
|
2010-10-21 09:41:01 +08:00
|
|
|
WIN_ALLOCA,
|
2010-03-07 03:32:29 +08:00
|
|
|
|
2014-10-02 03:39:32 +08:00
|
|
|
// For allocating variable amounts of stack space when using
|
2011-08-31 03:43:21 +08:00
|
|
|
// segmented stacks. Check if the current stacklet has enough space, and
|
2011-09-07 03:29:31 +08:00
|
|
|
// falls back to heap allocation if not.
|
2011-08-31 03:43:21 +08:00
|
|
|
SEG_ALLOCA,
|
|
|
|
|
2016-04-03 22:14:32 +08:00
|
|
|
// Memory barriers.
|
2010-11-20 19:25:00 +08:00
|
|
|
MEMBARRIER,
|
|
|
|
MFENCE,
|
|
|
|
|
2014-10-02 03:39:32 +08:00
|
|
|
// Store FP status word into i16 register.
|
2012-04-27 20:07:43 +08:00
|
|
|
FNSTSW16r,
|
|
|
|
|
2014-10-02 03:39:32 +08:00
|
|
|
// Store contents of %ah into %eflags.
|
2012-04-27 20:07:43 +08:00
|
|
|
SAHF,
|
|
|
|
|
2014-10-02 03:39:32 +08:00
|
|
|
// Get a random integer and indicate whether it is valid in CF.
|
2012-07-12 17:31:43 +08:00
|
|
|
RDRAND,
|
|
|
|
|
2014-10-02 03:39:32 +08:00
|
|
|
// Get a NIST SP800-90B & C compliant random integer and
|
2013-03-29 07:41:26 +08:00
|
|
|
// indicate whether it is valid in CF.
|
|
|
|
RDSEED,
|
|
|
|
|
2019-04-04 08:28:49 +08:00
|
|
|
// Protection keys
|
|
|
|
// RDPKRU - Operand 0 is chain. Operand 1 is value for ECX.
|
|
|
|
// WRPKRU - Operand 0 is chain. Operand 1 is value for EDX. Operand 2 is
|
|
|
|
// value for ECX.
|
|
|
|
RDPKRU, WRPKRU,
|
|
|
|
|
2016-04-03 22:14:32 +08:00
|
|
|
// SSE42 string comparisons.
|
2018-04-28 06:15:33 +08:00
|
|
|
// These nodes produce 3 results, index, mask, and flags. X86ISelDAGToDAG
|
|
|
|
// will emit one or two instructions based on which results are used. If
|
|
|
|
// flags and index/mask this allows us to use a single instruction since
|
|
|
|
// we won't have to pick and opcode for flags. Instead we can rely on the
|
|
|
|
// DAG to CSE everything and decide at isel.
|
|
|
|
PCMPISTR,
|
|
|
|
PCMPESTR,
|
2012-08-06 14:22:36 +08:00
|
|
|
|
2014-10-02 03:39:32 +08:00
|
|
|
// Test if in transactional execution.
|
2013-03-27 06:47:01 +08:00
|
|
|
XTEST,
|
|
|
|
|
2016-04-03 22:14:32 +08:00
|
|
|
// ERI instructions.
|
2019-03-11 12:36:57 +08:00
|
|
|
RSQRT28, RSQRT28_SAE, RSQRT28S, RSQRT28S_SAE,
|
|
|
|
RCP28, RCP28_SAE, RCP28S, RCP28S_SAE, EXP2, EXP2_SAE,
|
2014-11-12 15:31:03 +08:00
|
|
|
|
2016-09-21 10:05:22 +08:00
|
|
|
// Conversions between float and half-float.
|
2019-03-11 12:36:53 +08:00
|
|
|
CVTPS2PH, CVTPH2PS, CVTPH2PS_SAE,
|
2016-09-21 10:05:22 +08:00
|
|
|
|
2019-01-12 16:05:12 +08:00
|
|
|
// Masked version of above.
|
|
|
|
// SRC, RND, PASSTHRU, MASK
|
|
|
|
MCVTPS2PH,
|
|
|
|
|
2017-11-26 17:36:41 +08:00
|
|
|
// Galois Field Arithmetic Instructions
|
|
|
|
GF2P8AFFINEINVQB, GF2P8AFFINEQB, GF2P8MULB,
|
|
|
|
|
2017-05-03 23:51:39 +08:00
|
|
|
// LWP insert record.
|
|
|
|
LWPINS,
|
|
|
|
|
2018-04-21 02:42:47 +08:00
|
|
|
// User level wait
|
|
|
|
UMWAIT, TPAUSE,
|
|
|
|
|
2019-05-30 11:59:16 +08:00
|
|
|
// Enqueue Stores Instructions
|
|
|
|
ENQCMD, ENQCMDS,
|
|
|
|
|
2019-05-31 10:50:41 +08:00
|
|
|
// For avx512-vp2intersect
|
|
|
|
VP2INTERSECT,
|
|
|
|
|
2014-10-02 03:39:32 +08:00
|
|
|
// Compare and swap.
|
2014-07-02 02:53:31 +08:00
|
|
|
LCMPXCHG_DAG = ISD::FIRST_TARGET_MEMORY_OPCODE,
|
2010-09-22 08:34:38 +08:00
|
|
|
LCMPXCHG8_DAG,
|
2011-08-27 05:21:21 +08:00
|
|
|
LCMPXCHG16_DAG,
|
[X86] Make sure we do not clobber RBX with cmpxchg when used as a base pointer.
cmpxchg[8|16]b uses RBX as one of its argument.
In other words, using this instruction clobbers RBX as it is defined to hold one
the input. When the backend uses dynamically allocated stack, RBX is used as a
reserved register for the base pointer.
Reserved registers have special semantic that only the target understands and
enforces, because of that, the register allocator don’t use them, but also,
don’t try to make sure they are used properly (remember it does not know how
they are supposed to be used).
Therefore, when RBX is used as a reserved register but defined by something that
is not compatible with that use, the register allocator will not fix the
surrounding code to make sure it gets saved and restored properly around the
broken code. This is the responsibility of the target to do the right thing with
its reserved register.
To fix that, when the base pointer needs to be preserved, we use a different
pseudo instruction for cmpxchg that save rbx.
That pseudo takes two more arguments than the regular instruction:
- One is the value to be copied into RBX to set the proper value for the
comparison.
- The other is the virtual register holding the save of the value of RBX as the
base pointer. This saving is done as part of isel (i.e., we emit a copy from
rbx).
cmpxchg_save_rbx <regular cmpxchg args>, input_for_rbx_reg, save_of_rbx_as_bp
This gets expanded into:
rbx = copy input_for_rbx_reg
cmpxchg <regular cmpxchg args>
rbx = save_of_rbx_as_bp
Note: The actual modeling of the pseudo is a bit more complicated to make sure
the interferes that appears after the pseudo gets expanded are properly modeled
before that expansion.
This fixes PR26883.
llvm-svn: 263325
2016-03-12 10:25:27 +08:00
|
|
|
LCMPXCHG8_SAVE_EBX_DAG,
|
|
|
|
LCMPXCHG16_SAVE_RBX_DAG,
|
2010-03-07 03:32:29 +08:00
|
|
|
|
2016-03-01 03:28:07 +08:00
|
|
|
/// LOCK-prefixed arithmetic read-modify-write instructions.
|
|
|
|
/// EFLAGS, OUTCHAIN = LADD(INCHAIN, PTR, RHS)
|
2019-01-03 03:01:05 +08:00
|
|
|
LADD, LSUB, LOR, LXOR, LAND,
|
2016-03-01 03:28:07 +08:00
|
|
|
|
2014-10-02 03:39:32 +08:00
|
|
|
// Load, scalar_to_vector, and zero extend.
|
2010-09-22 09:05:16 +08:00
|
|
|
VZEXT_LOAD,
|
2010-10-21 07:40:27 +08:00
|
|
|
|
2019-04-27 11:38:15 +08:00
|
|
|
// extract_vector_elt, store.
|
|
|
|
VEXTRACT_STORE,
|
|
|
|
|
2014-10-02 03:39:32 +08:00
|
|
|
// Store FP control world into i16 memory.
|
2010-09-22 09:11:26 +08:00
|
|
|
FNSTCW16m,
|
2010-10-21 07:40:27 +08:00
|
|
|
|
2014-10-02 03:39:32 +08:00
|
|
|
/// This instruction implements FP_TO_SINT with the
|
2010-09-22 09:05:16 +08:00
|
|
|
/// integer destination in memory and a FP reg source. This corresponds
|
|
|
|
/// to the X86::FIST*m instructions and the rounding mode change stuff. It
|
|
|
|
/// has two inputs (token chain and address) and two outputs (int value
|
2019-02-12 14:14:18 +08:00
|
|
|
/// and token chain). Memory VT specifies the type to store to.
|
|
|
|
FP_TO_INT_IN_MEM,
|
2010-10-21 07:40:27 +08:00
|
|
|
|
2014-10-02 03:39:32 +08:00
|
|
|
/// This instruction implements SINT_TO_FP with the
|
2010-09-22 09:28:21 +08:00
|
|
|
/// integer source in memory and FP reg result. This corresponds to the
|
2019-02-12 14:14:16 +08:00
|
|
|
/// X86::FILD*m instructions. It has two inputs (token chain and address)
|
|
|
|
/// and two outputs (FP value and token chain). FILD_FLAG also produces a
|
|
|
|
/// flag). The integer source type is specified by the memory VT.
|
2010-09-22 09:28:21 +08:00
|
|
|
FILD,
|
|
|
|
FILD_FLAG,
|
2010-10-21 07:40:27 +08:00
|
|
|
|
2019-04-12 03:19:42 +08:00
|
|
|
/// This instruction implements a fp->int store from FP stack
|
|
|
|
/// slots. This corresponds to the fist instruction. It takes a
|
|
|
|
/// chain operand, value to store, address, and glue. The memory VT
|
|
|
|
/// specifies the type to store as.
|
|
|
|
FIST,
|
|
|
|
|
2014-10-02 03:39:32 +08:00
|
|
|
/// This instruction implements an extending load to FP stack slots.
|
2010-09-22 09:28:21 +08:00
|
|
|
/// This corresponds to the X86::FLD32m / X86::FLD64m. It takes a chain
|
2019-02-12 14:14:16 +08:00
|
|
|
/// operand, and ptr to load from. The memory VT specifies the type to
|
|
|
|
/// load from.
|
2010-09-22 09:28:21 +08:00
|
|
|
FLD,
|
2010-10-21 07:40:27 +08:00
|
|
|
|
2019-04-12 03:19:42 +08:00
|
|
|
/// This instruction implements a truncating store from FP stack
|
2010-09-22 09:28:21 +08:00
|
|
|
/// slots. This corresponds to the X86::FST32m / X86::FST64m. It takes a
|
2019-04-12 03:19:42 +08:00
|
|
|
/// chain operand, value to store, address, and glue. The memory VT
|
|
|
|
/// specifies the type to store as.
|
2010-10-13 02:00:49 +08:00
|
|
|
FST,
|
|
|
|
|
2014-10-02 03:39:32 +08:00
|
|
|
/// This instruction grabs the address of the next argument
|
2010-10-13 02:00:49 +08:00
|
|
|
/// from a va_list. (reads and modifies the va_list in memory)
|
2016-12-21 18:43:36 +08:00
|
|
|
VAARG_64,
|
|
|
|
|
|
|
|
// Vector truncating store with unsigned/signed saturation
|
|
|
|
VTRUNCSTOREUS, VTRUNCSTORES,
|
|
|
|
// Vector truncating masked store with unsigned/signed saturation
|
2017-06-22 14:47:41 +08:00
|
|
|
VMTRUNCSTOREUS, VMTRUNCSTORES,
|
|
|
|
|
2017-11-22 16:10:54 +08:00
|
|
|
// X86 specific gather and scatter
|
|
|
|
MGATHER, MSCATTER,
|
2010-10-21 07:40:27 +08:00
|
|
|
|
2010-03-07 03:32:29 +08:00
|
|
|
// WARNING: Do not add anything in the end unless you want the node to
|
2016-02-27 06:59:57 +08:00
|
|
|
// have memop! In fact, starting from FIRST_TARGET_MEMORY_OPCODE all
|
|
|
|
// opcodes will be thought as target memory ops!
|
2005-11-15 08:40:23 +08:00
|
|
|
};
|
2016-01-27 02:48:36 +08:00
|
|
|
} // end namespace X86ISD
|
2005-11-15 08:40:23 +08:00
|
|
|
|
2008-01-30 03:34:22 +08:00
|
|
|
/// Define some predicates that are used for node matching.
|
|
|
|
namespace X86 {
|
2014-10-02 03:39:32 +08:00
|
|
|
/// Returns true if Elt is a constant zero or floating point constant +0.0.
|
2009-07-30 16:33:02 +08:00
|
|
|
bool isZeroNode(SDValue Elt);
|
2009-08-06 07:01:26 +08:00
|
|
|
|
2014-10-02 03:39:32 +08:00
|
|
|
/// Returns true of the given offset can be
|
2009-08-06 07:01:26 +08:00
|
|
|
/// fit into displacement field of the instruction.
|
|
|
|
bool isOffsetSuitableForCodeModel(int64_t Offset, CodeModel::Model M,
|
|
|
|
bool hasSymbolicDisplacement = true);
|
2011-06-24 01:54:54 +08:00
|
|
|
|
2014-10-02 03:39:32 +08:00
|
|
|
/// Determines whether the callee is required to pop its
|
2011-06-24 01:54:54 +08:00
|
|
|
/// own arguments. Callee pop is necessary to support tail calls.
|
|
|
|
bool isCalleePop(CallingConv::ID CallingConv,
|
2016-01-16 08:08:36 +08:00
|
|
|
bool is64Bit, bool IsVarArg, bool GuaranteeTCO);
|
2014-08-15 01:13:26 +08:00
|
|
|
|
2016-01-27 02:48:36 +08:00
|
|
|
} // end namespace X86
|
2008-01-30 03:34:22 +08:00
|
|
|
|
2006-10-19 02:26:48 +08:00
|
|
|
//===--------------------------------------------------------------------===//
|
2014-10-02 03:39:32 +08:00
|
|
|
// X86 Implementation of the TargetLowering interface
|
2014-03-31 14:22:15 +08:00
|
|
|
class X86TargetLowering final : public TargetLowering {
|
2005-11-15 08:40:23 +08:00
|
|
|
public:
|
2015-02-03 01:38:43 +08:00
|
|
|
explicit X86TargetLowering(const X86TargetMachine &TM,
|
|
|
|
const X86Subtarget &STI);
|
2005-11-15 08:40:23 +08:00
|
|
|
|
2014-03-09 15:44:38 +08:00
|
|
|
unsigned getJumpTableEncoding() const override;
|
2015-05-12 09:26:05 +08:00
|
|
|
bool useSoftFloat() const override;
|
2010-01-26 07:38:14 +08:00
|
|
|
|
2017-03-18 08:44:07 +08:00
|
|
|
void markLibCallAttributes(MachineFunction *MF, unsigned CC,
|
|
|
|
ArgListTy &Args) const override;
|
|
|
|
|
2017-11-21 10:29:54 +08:00
|
|
|
MVT getScalarShiftAmountTy(const DataLayout &, EVT VT) const override {
|
2017-11-23 11:08:51 +08:00
|
|
|
return MVT::i8;
|
2015-07-09 10:09:20 +08:00
|
|
|
}
|
2011-02-26 05:41:48 +08:00
|
|
|
|
2014-03-09 15:44:38 +08:00
|
|
|
const MCExpr *
|
2010-01-26 13:02:42 +08:00
|
|
|
LowerCustomJumpTableEntry(const MachineJumpTableInfo *MJTI,
|
|
|
|
const MachineBasicBlock *MBB, unsigned uid,
|
2014-03-09 15:44:38 +08:00
|
|
|
MCContext &Ctx) const override;
|
2010-10-21 07:40:27 +08:00
|
|
|
|
2014-10-02 03:39:32 +08:00
|
|
|
/// Returns relocation base for the given PIC jumptable.
|
2014-03-09 15:44:38 +08:00
|
|
|
SDValue getPICJumpTableRelocBase(SDValue Table,
|
|
|
|
SelectionDAG &DAG) const override;
|
|
|
|
const MCExpr *
|
2010-01-26 14:28:43 +08:00
|
|
|
getPICJumpTableRelocBaseExpr(const MachineFunction *MF,
|
2014-03-09 15:44:38 +08:00
|
|
|
unsigned JTI, MCContext &Ctx) const override;
|
2010-10-21 07:40:27 +08:00
|
|
|
|
2014-10-02 03:39:32 +08:00
|
|
|
/// Return the desired alignment for ByVal aggregate
|
2008-01-24 07:17:41 +08:00
|
|
|
/// function arguments in the caller parameter area. For X86, aggregates
|
|
|
|
/// that contains are placed at 16-byte boundaries while the rest are at
|
|
|
|
/// 4-byte boundaries.
|
2015-07-09 10:09:28 +08:00
|
|
|
unsigned getByValTypeAlignment(Type *Ty,
|
|
|
|
const DataLayout &DL) const override;
|
2008-05-15 16:39:06 +08:00
|
|
|
|
2014-10-02 03:39:32 +08:00
|
|
|
/// Returns the target specific optimal type for load
|
2010-04-03 03:36:14 +08:00
|
|
|
/// and store operations as a result of memset, memcpy, and memmove
|
|
|
|
/// lowering. If DstAlign is zero that means it's safe to destination
|
|
|
|
/// alignment can satisfy any constraint. Similarly if SrcAlign is zero it
|
|
|
|
/// means there isn't a need to check it against alignment requirement,
|
2012-12-12 10:34:41 +08:00
|
|
|
/// probably because the source does not need to be loaded. If 'IsMemset' is
|
|
|
|
/// true, that means it's expanding a memset. If 'ZeroMemset' is true, that
|
|
|
|
/// means it's a memset of zero. 'MemcpyStrSrc' indicates whether the memcpy
|
|
|
|
/// source is constant so it does not need to be loaded.
|
2010-04-17 04:11:05 +08:00
|
|
|
/// It returns EVT::Other if the type should be determined using generic
|
|
|
|
/// target-independent logic.
|
2014-03-09 15:44:38 +08:00
|
|
|
EVT getOptimalMemOpType(uint64_t Size, unsigned DstAlign, unsigned SrcAlign,
|
|
|
|
bool IsMemset, bool ZeroMemset, bool MemcpyStrSrc,
|
2019-04-30 16:38:12 +08:00
|
|
|
const AttributeList &FuncAttributes) const override;
|
2009-08-16 05:21:19 +08:00
|
|
|
|
2014-10-02 03:39:32 +08:00
|
|
|
/// Returns true if it's safe to use load / store of the
|
2012-12-12 08:42:09 +08:00
|
|
|
/// specified type to expand memcpy / memset inline. This is mostly true
|
2012-12-12 09:32:07 +08:00
|
|
|
/// for all types except for some special cases. For example, on X86
|
2012-12-12 08:42:09 +08:00
|
|
|
/// targets without SSE2 f64 load / store are done with fldl / fstpl which
|
2012-12-12 09:32:07 +08:00
|
|
|
/// also does type conversion. Note the specified type doesn't have to be
|
|
|
|
/// legal as the hook is used before type legalization.
|
2014-03-09 15:44:38 +08:00
|
|
|
bool isSafeMemOpType(MVT VT) const override;
|
2012-12-12 08:42:09 +08:00
|
|
|
|
2015-07-02 01:55:07 +08:00
|
|
|
/// Returns true if the target allows unaligned memory accesses of the
|
|
|
|
/// specified type. Returns whether it is "fast" in the last argument.
|
2014-07-28 01:46:40 +08:00
|
|
|
bool allowsMisalignedMemoryAccesses(EVT VT, unsigned AS, unsigned Align,
|
2019-06-13 01:14:03 +08:00
|
|
|
MachineMemOperand::Flags Flags,
|
|
|
|
bool *Fast) const override;
|
2009-07-01 06:38:32 +08:00
|
|
|
|
2014-10-02 03:39:32 +08:00
|
|
|
/// Provide custom lowering hooks for some operations.
|
2005-11-15 08:40:23 +08:00
|
|
|
///
|
2014-03-09 15:44:38 +08:00
|
|
|
SDValue LowerOperation(SDValue Op, SelectionDAG &DAG) const override;
|
2005-11-15 08:40:23 +08:00
|
|
|
|
2016-01-24 16:04:33 +08:00
|
|
|
/// Places new result values for the node in Results (their number
|
|
|
|
/// and types must exactly match those of the original return values of
|
|
|
|
/// the node), or leaves Results empty, which indicates that the node is not
|
|
|
|
/// to be custom lowered after all.
|
2016-01-27 02:48:36 +08:00
|
|
|
void LowerOperationWrapper(SDNode *N,
|
|
|
|
SmallVectorImpl<SDValue> &Results,
|
|
|
|
SelectionDAG &DAG) const override;
|
2016-01-24 16:04:33 +08:00
|
|
|
|
2014-10-02 03:39:32 +08:00
|
|
|
/// Replace the results of node with an illegal result
|
2008-12-01 19:39:25 +08:00
|
|
|
/// type with new values built out of custom code.
|
2007-11-24 15:07:01 +08:00
|
|
|
///
|
2014-03-09 15:44:38 +08:00
|
|
|
void ReplaceNodeResults(SDNode *N, SmallVectorImpl<SDValue>&Results,
|
|
|
|
SelectionDAG &DAG) const override;
|
2007-11-24 15:07:01 +08:00
|
|
|
|
2014-03-09 15:44:38 +08:00
|
|
|
SDValue PerformDAGCombine(SDNode *N, DAGCombinerInfo &DCI) const override;
|
X86 target specific DAG combine: turn build_vector (load x), (load x+4),
(load x+8), (load x+12), <0, 1, 2, 3> to a single 128-bit load (aligned and
unaligned).
e.g.
__m128 test(float a, float b, float c, float d) {
return _mm_set_ps(d, c, b, a);
}
_test:
movups 4(%esp), %xmm0
ret
llvm-svn: 29042
2006-07-07 16:33:52 +08:00
|
|
|
|
DAGCombiner: Extend reduceBuildVecToTrunc to handle non-zero offset
Summary:
Adding support for combining power2-strided build_vector's where the
first build_vectori's operand is extracted from a non-zero index.
Example:
v4i32 build_vector((extract_elt V, 1),
(extract_elt V, 3),
(extract_elt V, 5),
(extract_elt V, 7))
-->
v4i32 truncate (bitcast (shuffle<1,u,3,u,5,u,7,u> V, u) to v4i64)
Reviewers: delena, RKSimon, guyblank
Reviewed By: RKSimon
Subscribers: llvm-commits
Differential Revision: https://reviews.llvm.org/D35700
llvm-svn: 309108
2017-07-26 20:57:03 +08:00
|
|
|
// Return true if it is profitable to combine a BUILD_VECTOR with a
|
|
|
|
// stride-pattern to a shuffle and a truncate.
|
|
|
|
// Example of such a combine:
|
|
|
|
// v4i32 build_vector((extract_elt V, 1),
|
|
|
|
// (extract_elt V, 3),
|
|
|
|
// (extract_elt V, 5),
|
|
|
|
// (extract_elt V, 7))
|
|
|
|
// -->
|
|
|
|
// v4i32 truncate (bitcast (shuffle<1,u,3,u,4,u,5,u,6,u,7,u> V, u) to
|
|
|
|
// v4i64)
|
|
|
|
bool isDesirableToCombineBuildVectorToShuffleTruncate(
|
|
|
|
ArrayRef<int> ShuffleMask, EVT SrcVT, EVT TruncVT) const override;
|
|
|
|
|
2014-10-02 03:39:32 +08:00
|
|
|
/// Return true if the target has native support for
|
2010-04-17 14:13:15 +08:00
|
|
|
/// the specified value type and it is 'desirable' to use the type for the
|
|
|
|
/// given node type. e.g. On x86 i16 is legal, but undesirable since i16
|
|
|
|
/// instruction encodings are longer and some i16 instructions are slow.
|
2014-03-09 15:44:38 +08:00
|
|
|
bool isTypeDesirableForOp(unsigned Opc, EVT VT) const override;
|
2010-04-17 14:13:15 +08:00
|
|
|
|
2014-10-02 03:39:32 +08:00
|
|
|
/// Return true if the target has native support for the
|
2010-04-17 14:13:15 +08:00
|
|
|
/// specified value type and it is 'desirable' to use the type. e.g. On x86
|
|
|
|
/// i16 is legal, but undesirable since i16 instruction encodings are longer
|
|
|
|
/// and some i16 instructions are slow.
|
2014-03-09 15:44:38 +08:00
|
|
|
bool IsDesirableToPromoteOp(SDValue Op, EVT &PVT) const override;
|
2010-04-16 14:14:10 +08:00
|
|
|
|
2014-03-09 15:44:38 +08:00
|
|
|
MachineBasicBlock *
|
2016-07-01 06:52:52 +08:00
|
|
|
EmitInstrWithCustomInserter(MachineInstr &MI,
|
|
|
|
MachineBasicBlock *MBB) const override;
|
2010-10-21 07:40:27 +08:00
|
|
|
|
2014-10-02 03:39:32 +08:00
|
|
|
/// This method returns the name of a target specific DAG node.
|
2014-03-09 15:44:38 +08:00
|
|
|
const char *getTargetNodeName(unsigned Opcode) const override;
|
2005-12-20 14:22:03 +08:00
|
|
|
|
2019-06-04 23:15:59 +08:00
|
|
|
/// Do not merge vector stores after legalization because that may conflict
|
|
|
|
/// with x86-specific store splitting optimizations.
|
|
|
|
bool mergeStoresAfterLegalization(EVT MemVT) const override {
|
|
|
|
return !MemVT.isVector();
|
|
|
|
}
|
2017-08-11 21:21:35 +08:00
|
|
|
|
2017-09-05 21:40:29 +08:00
|
|
|
bool canMergeStoresTo(unsigned AddressSpace, EVT MemVT,
|
|
|
|
const SelectionDAG &DAG) const override;
|
|
|
|
|
[CodeGenPrepare] Teach when it is profitable to speculate calls to @llvm.cttz/ctlz.
If the control flow is modelling an if-statement where the only instruction in
the 'then' basic block (excluding the terminator) is a call to cttz/ctlz,
CodeGenPrepare can try to speculate the cttz/ctlz call and simplify the control
flow graph.
Example:
\code
entry:
%cmp = icmp eq i64 %val, 0
br i1 %cmp, label %end.bb, label %then.bb
then.bb:
%c = tail call i64 @llvm.cttz.i64(i64 %val, i1 true)
br label %end.bb
end.bb:
%cond = phi i64 [ %c, %then.bb ], [ 64, %entry]
\code
In this example, basic block %then.bb is taken if value %val is not zero.
Also, the phi node in %end.bb would propagate the size-of in bits of %val
only if %val is equal to zero.
With this patch, CodeGenPrepare will try to hoist the call to cttz from %then.bb
into basic block %entry only if cttz is cheap to speculate for the target.
Added two new hooks in TargetLowering.h to let targets customize the behavior
(i.e. decide whether it is cheap or not to speculate calls to cttz/ctlz). The
two new methods are 'isCheapToSpeculateCtlz' and 'isCheapToSpeculateCttz'.
By default, both methods return 'false'.
On X86, method 'isCheapToSpeculateCtlz' returns true only if the target has
LZCNT. Method 'isCheapToSpeculateCttz' only returns true if the target has BMI.
Differential Revision: http://reviews.llvm.org/D6728
llvm-svn: 224899
2014-12-28 19:07:35 +08:00
|
|
|
bool isCheapToSpeculateCttz() const override;
|
|
|
|
|
|
|
|
bool isCheapToSpeculateCtlz() const override;
|
|
|
|
|
2016-10-15 00:41:38 +08:00
|
|
|
bool isCtlzFast() const override;
|
|
|
|
|
2016-06-11 04:33:50 +08:00
|
|
|
bool hasBitPreservingFPLogic(EVT VT) const override {
|
|
|
|
return VT == MVT::f32 || VT == MVT::f64 || VT.isVector();
|
|
|
|
}
|
|
|
|
|
2016-12-23 03:38:22 +08:00
|
|
|
bool isMultiStoresCheaperThanBitsMerge(EVT LTy, EVT HTy) const override {
|
2016-09-03 01:17:04 +08:00
|
|
|
// If the pair to store is a mixture of float and int values, we will
|
|
|
|
// save two bitwise instructions and one float-to-int instruction and
|
|
|
|
// increase one store instruction. There is potentially a more
|
|
|
|
// significant benefit because it avoids the float->int domain switch
|
|
|
|
// for input value. So It is more likely a win.
|
2016-12-23 03:38:22 +08:00
|
|
|
if ((LTy.isFloatingPoint() && HTy.isInteger()) ||
|
|
|
|
(LTy.isInteger() && HTy.isFloatingPoint()))
|
|
|
|
return true;
|
2016-09-03 01:17:04 +08:00
|
|
|
// If the pair only contains int values, we will save two bitwise
|
|
|
|
// instructions and increase one store instruction (costing one more
|
|
|
|
// store buffer). Since the benefit is more blurred so we leave
|
|
|
|
// such pair out until we get testcase to prove it is a win.
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2017-02-22 02:53:14 +08:00
|
|
|
bool isMaskAndCmp0FoldingBeneficial(const Instruction &AndI) const override;
|
|
|
|
|
2016-05-07 23:03:40 +08:00
|
|
|
bool hasAndNotCompare(SDValue Y) const override;
|
|
|
|
|
2018-05-08 05:52:11 +08:00
|
|
|
bool hasAndNot(SDValue Y) const override;
|
|
|
|
|
2019-04-24 20:34:08 +08:00
|
|
|
bool shouldFoldConstantShiftPairToMask(const SDNode *N,
|
|
|
|
CombineLevel Level) const override;
|
|
|
|
|
2019-04-17 04:57:28 +08:00
|
|
|
bool shouldFoldMaskToVariableShiftPair(SDValue Y) const override;
|
2018-07-10 03:06:42 +08:00
|
|
|
|
2018-07-16 20:44:10 +08:00
|
|
|
bool
|
|
|
|
shouldTransformSignedTruncationCheck(EVT XVT,
|
|
|
|
unsigned KeptBits) const override {
|
|
|
|
// For vectors, we don't have a preference..
|
|
|
|
if (XVT.isVector())
|
|
|
|
return false;
|
|
|
|
|
|
|
|
auto VTIsOk = [](EVT VT) -> bool {
|
|
|
|
return VT == MVT::i8 || VT == MVT::i16 || VT == MVT::i32 ||
|
|
|
|
VT == MVT::i64;
|
|
|
|
};
|
|
|
|
|
|
|
|
// We are ok with KeptBitsVT being byte/word/dword, what MOVS supports.
|
|
|
|
// XVT will be larger than KeptBitsVT.
|
|
|
|
MVT KeptBitsVT = MVT::getIntegerVT(KeptBits);
|
|
|
|
return VTIsOk(XVT) && VTIsOk(KeptBitsVT);
|
|
|
|
}
|
|
|
|
|
2019-01-31 16:07:30 +08:00
|
|
|
bool shouldExpandShift(SelectionDAG &DAG, SDNode *N) const override {
|
2019-04-05 06:40:06 +08:00
|
|
|
if (DAG.getMachineFunction().getFunction().hasMinSize())
|
2019-01-31 16:07:30 +08:00
|
|
|
return false;
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2018-08-27 02:20:41 +08:00
|
|
|
bool shouldSplatInsEltVarIndex(EVT VT) const override;
|
|
|
|
|
2017-04-05 22:09:39 +08:00
|
|
|
bool convertSetCCLogicToBitwiseLogic(EVT VT) const override {
|
|
|
|
return VT.isScalarInteger();
|
|
|
|
}
|
|
|
|
|
2017-03-26 00:05:33 +08:00
|
|
|
/// Vector-sized comparisons are fast using PCMPEQ + PMOVMSK or PTEST.
|
|
|
|
MVT hasFastEqualityCompare(unsigned NumBits) const override;
|
|
|
|
|
2014-10-02 03:39:32 +08:00
|
|
|
/// Return the value type to use for ISD::SETCC.
|
2015-07-09 10:09:04 +08:00
|
|
|
EVT getSetCCResultType(const DataLayout &DL, LLVMContext &Context,
|
|
|
|
EVT VT) const override;
|
2008-03-10 23:42:14 +08:00
|
|
|
|
2018-01-21 02:50:09 +08:00
|
|
|
bool targetShrinkDemandedConstant(SDValue Op, const APInt &Demanded,
|
|
|
|
TargetLoweringOpt &TLO) const override;
|
|
|
|
|
2014-10-02 03:39:32 +08:00
|
|
|
/// Determine which of the bits specified in Mask are known to be either
|
|
|
|
/// zero or one and return them in the KnownZero/KnownOne bitsets.
|
2014-05-15 05:14:37 +08:00
|
|
|
void computeKnownBitsForTargetNode(const SDValue Op,
|
2017-04-28 13:31:46 +08:00
|
|
|
KnownBits &Known,
|
2017-03-31 19:24:16 +08:00
|
|
|
const APInt &DemandedElts,
|
2014-05-15 05:14:37 +08:00
|
|
|
const SelectionDAG &DAG,
|
|
|
|
unsigned Depth = 0) const override;
|
2008-05-13 03:56:52 +08:00
|
|
|
|
2014-10-02 03:39:32 +08:00
|
|
|
/// Determine the number of bits in the operation that are sign bits.
|
2014-03-09 15:44:38 +08:00
|
|
|
unsigned ComputeNumSignBitsForTargetNode(SDValue Op,
|
2017-03-31 21:54:09 +08:00
|
|
|
const APInt &DemandedElts,
|
2014-04-05 04:13:13 +08:00
|
|
|
const SelectionDAG &DAG,
|
2014-03-09 15:44:38 +08:00
|
|
|
unsigned Depth) const override;
|
2010-09-22 04:42:50 +08:00
|
|
|
|
2018-09-20 02:11:34 +08:00
|
|
|
bool SimplifyDemandedVectorEltsForTargetNode(SDValue Op,
|
|
|
|
const APInt &DemandedElts,
|
|
|
|
APInt &KnownUndef,
|
|
|
|
APInt &KnownZero,
|
|
|
|
TargetLoweringOpt &TLO,
|
|
|
|
unsigned Depth) const override;
|
|
|
|
|
2018-10-25 03:11:28 +08:00
|
|
|
bool SimplifyDemandedBitsForTargetNode(SDValue Op,
|
|
|
|
const APInt &DemandedBits,
|
2018-12-18 02:43:43 +08:00
|
|
|
const APInt &DemandedElts,
|
2018-10-25 03:11:28 +08:00
|
|
|
KnownBits &Known,
|
|
|
|
TargetLoweringOpt &TLO,
|
|
|
|
unsigned Depth) const override;
|
|
|
|
|
2019-05-24 18:03:11 +08:00
|
|
|
const Constant *getTargetConstantFromLoad(LoadSDNode *LD) const override;
|
|
|
|
|
2017-08-11 21:21:35 +08:00
|
|
|
SDValue unwrapAddress(SDValue N) const override;
|
|
|
|
|
2010-04-17 23:26:15 +08:00
|
|
|
SDValue getReturnAddressFrameIndex(SelectionDAG &DAG) const;
|
2005-11-15 08:40:23 +08:00
|
|
|
|
2014-03-09 15:44:38 +08:00
|
|
|
bool ExpandInlineAsm(CallInst *CI) const override;
|
2010-10-21 07:40:27 +08:00
|
|
|
|
2015-07-06 03:29:18 +08:00
|
|
|
ConstraintType getConstraintType(StringRef Constraint) const override;
|
2010-10-21 07:40:27 +08:00
|
|
|
|
2010-10-30 01:29:13 +08:00
|
|
|
/// Examine constraint string and operand type and determine a weight value.
|
2010-09-14 02:15:37 +08:00
|
|
|
/// The operand object must already have been set up with the operand type.
|
2014-03-09 15:44:38 +08:00
|
|
|
ConstraintWeight
|
|
|
|
getSingleConstraintMatchWeight(AsmOperandInfo &info,
|
|
|
|
const char *constraint) const override;
|
2010-10-21 07:40:27 +08:00
|
|
|
|
2014-03-09 15:44:38 +08:00
|
|
|
const char *LowerXConstraint(EVT ConstraintVT) const override;
|
2008-01-29 10:21:21 +08:00
|
|
|
|
2014-10-02 03:39:32 +08:00
|
|
|
/// Lower the specified operand into the Ops vector. If it is invalid, don't
|
|
|
|
/// add anything to Ops. If hasMemory is true it means one of the asm
|
|
|
|
/// constraint of the inline asm instruction being processed is 'm'.
|
2014-03-09 15:44:38 +08:00
|
|
|
void LowerAsmOperandForConstraint(SDValue Op,
|
|
|
|
std::string &Constraint,
|
|
|
|
std::vector<SDValue> &Ops,
|
|
|
|
SelectionDAG &DAG) const override;
|
2010-10-21 07:40:27 +08:00
|
|
|
|
2015-07-06 03:29:18 +08:00
|
|
|
unsigned
|
|
|
|
getInlineAsmMemConstraint(StringRef ConstraintCode) const override {
|
2015-05-16 20:09:54 +08:00
|
|
|
if (ConstraintCode == "i")
|
|
|
|
return InlineAsm::Constraint_i;
|
|
|
|
else if (ConstraintCode == "o")
|
|
|
|
return InlineAsm::Constraint_o;
|
|
|
|
else if (ConstraintCode == "v")
|
|
|
|
return InlineAsm::Constraint_v;
|
|
|
|
else if (ConstraintCode == "X")
|
|
|
|
return InlineAsm::Constraint_X;
|
|
|
|
return TargetLowering::getInlineAsmMemConstraint(ConstraintCode);
|
2015-03-16 21:13:41 +08:00
|
|
|
}
|
|
|
|
|
2019-02-06 23:26:29 +08:00
|
|
|
/// Handle Lowering flag assembly outputs.
|
2019-02-16 04:01:55 +08:00
|
|
|
SDValue LowerAsmOutputForConstraint(SDValue &Chain, SDValue &Flag, SDLoc DL,
|
2019-02-06 23:26:29 +08:00
|
|
|
const AsmOperandInfo &Constraint,
|
|
|
|
SelectionDAG &DAG) const override;
|
|
|
|
|
2014-10-02 03:39:32 +08:00
|
|
|
/// Given a physical register constraint
|
2006-10-19 02:26:48 +08:00
|
|
|
/// (e.g. {edx}), return the register number and the register class for the
|
|
|
|
/// register. This should only be used for C_Register constraints. On
|
|
|
|
/// error, this returns a register number of 0.
|
2015-02-27 06:38:43 +08:00
|
|
|
std::pair<unsigned, const TargetRegisterClass *>
|
|
|
|
getRegForInlineAsmConstraint(const TargetRegisterInfo *TRI,
|
2015-07-06 03:29:18 +08:00
|
|
|
StringRef Constraint, MVT VT) const override;
|
2010-10-21 07:40:27 +08:00
|
|
|
|
2014-10-02 03:39:32 +08:00
|
|
|
/// Return true if the addressing mode represented
|
2007-03-31 07:15:24 +08:00
|
|
|
/// by AM is legal for this target, for a load/store of the specified type.
|
2015-07-09 10:09:40 +08:00
|
|
|
bool isLegalAddressingMode(const DataLayout &DL, const AddrMode &AM,
|
2017-07-21 19:59:37 +08:00
|
|
|
Type *Ty, unsigned AS,
|
|
|
|
Instruction *I = nullptr) const override;
|
2007-03-31 07:15:24 +08:00
|
|
|
|
2014-10-02 03:39:32 +08:00
|
|
|
/// Return true if the specified immediate is legal
|
2012-07-17 14:53:39 +08:00
|
|
|
/// icmp immediate, that is the target has icmp instructions which can
|
|
|
|
/// compare a register against the immediate without having to materialize
|
|
|
|
/// the immediate into a register.
|
2014-03-09 15:44:38 +08:00
|
|
|
bool isLegalICmpImmediate(int64_t Imm) const override;
|
2012-07-17 14:53:39 +08:00
|
|
|
|
2014-10-02 03:39:32 +08:00
|
|
|
/// Return true if the specified immediate is legal
|
2012-07-17 14:53:39 +08:00
|
|
|
/// add immediate, that is the target has add instructions which can
|
|
|
|
/// add a register and the immediate without having to materialize
|
|
|
|
/// the immediate into a register.
|
2014-03-09 15:44:38 +08:00
|
|
|
bool isLegalAddImmediate(int64_t Imm) const override;
|
2012-07-17 14:53:39 +08:00
|
|
|
|
2018-10-24 07:19:23 +08:00
|
|
|
bool isLegalStoreImmediate(int64_t Imm) const override;
|
|
|
|
|
2018-05-01 23:54:18 +08:00
|
|
|
/// Return the cost of the scaling factor used in the addressing
|
2014-04-26 09:11:26 +08:00
|
|
|
/// mode represented by AM for this target, for a load/store
|
|
|
|
/// of the specified type.
|
|
|
|
/// If the AM is supported, the return value must be >= 0.
|
|
|
|
/// If the AM is not supported, it returns a negative value.
|
2015-07-09 10:09:40 +08:00
|
|
|
int getScalingFactorCost(const DataLayout &DL, const AddrMode &AM, Type *Ty,
|
2015-06-01 13:31:59 +08:00
|
|
|
unsigned AS) const override;
|
2014-02-19 18:02:43 +08:00
|
|
|
|
2014-03-09 15:44:38 +08:00
|
|
|
bool isVectorShiftByScalarCheap(Type *Ty) const override;
|
2014-02-19 18:02:43 +08:00
|
|
|
|
2019-05-14 08:39:40 +08:00
|
|
|
/// Add x86-specific opcodes to the default list.
|
|
|
|
bool isBinOp(unsigned Opcode) const override;
|
|
|
|
|
2019-03-29 19:25:58 +08:00
|
|
|
/// Returns true if the opcode is a commutative binary operation.
|
|
|
|
bool isCommutativeBinOp(unsigned Opcode) const override;
|
|
|
|
|
2014-10-02 03:39:32 +08:00
|
|
|
/// Return true if it's free to truncate a value of
|
Loosen up iv reuse to allow reuse of the same stride but a larger type when truncating from the larger type to smaller type is free.
e.g.
Turns this loop:
LBB1_1: # entry.bb_crit_edge
xorl %ecx, %ecx
xorw %dx, %dx
movw %dx, %si
LBB1_2: # bb
movl L_X$non_lazy_ptr, %edi
movw %si, (%edi)
movl L_Y$non_lazy_ptr, %edi
movw %dx, (%edi)
addw $4, %dx
incw %si
incl %ecx
cmpl %eax, %ecx
jne LBB1_2 # bb
into
LBB1_1: # entry.bb_crit_edge
xorl %ecx, %ecx
xorw %dx, %dx
LBB1_2: # bb
movl L_X$non_lazy_ptr, %esi
movw %cx, (%esi)
movl L_Y$non_lazy_ptr, %esi
movw %dx, (%esi)
addw $4, %dx
incl %ecx
cmpl %eax, %ecx
jne LBB1_2 # bb
llvm-svn: 43375
2007-10-26 09:56:11 +08:00
|
|
|
/// type Ty1 to type Ty2. e.g. On x86 it's free to truncate a i32 value in
|
|
|
|
/// register EAX to i16 by referencing its sub-register AX.
|
2014-03-09 15:44:38 +08:00
|
|
|
bool isTruncateFree(Type *Ty1, Type *Ty2) const override;
|
|
|
|
bool isTruncateFree(EVT VT1, EVT VT2) const override;
|
Implement support for using modeling implicit-zero-extension on x86-64
with SUBREG_TO_REG, teach SimpleRegisterCoalescing to coalesce
SUBREG_TO_REG instructions (which are similar to INSERT_SUBREG
instructions), and teach the DAGCombiner to take advantage of this on
targets which support it. This eliminates many redundant
zero-extension operations on x86-64.
This adds a new TargetLowering hook, isZExtFree. It's similar to
isTruncateFree, except it only applies to actual definitions, and not
no-op truncates which may not zero the high bits.
Also, this adds a new optimization to SimplifyDemandedBits: transform
operations like x+y into (zext (add (trunc x), (trunc y))) on targets
where all the casts are no-ops. In contexts where the high part of the
add is explicitly masked off, this allows the mask operation to be
eliminated. Fix the DAGCombiner to avoid undoing these transformations
to eliminate casts on targets where the casts are no-ops.
Also, this adds a new two-address lowering heuristic. Since
two-address lowering runs before coalescing, it helps to be able to
look through copies when deciding whether commuting and/or
three-address conversion are profitable.
Also, fix a bug in LiveInterval::MergeInClobberRanges. It didn't handle
the case that a clobber range extended both before and beyond an
existing live range. In that case, multiple live ranges need to be
added. This was exposed by the new subreg coalescing code.
Remove 2008-05-06-SpillerBug.ll. It was bugpoint-reduced, and the
spiller behavior it was looking for no longer occurrs with the new
instruction selection.
llvm-svn: 68576
2009-04-08 08:15:30 +08:00
|
|
|
|
2014-03-09 15:44:38 +08:00
|
|
|
bool allowTruncateForTailCall(Type *Ty1, Type *Ty2) const override;
|
Refactor isInTailCallPosition handling
This change came about primarily because of two issues in the existing code.
Niether of:
define i64 @test1(i64 %val) {
%in = trunc i64 %val to i32
tail call i32 @ret32(i32 returned %in)
ret i64 %val
}
define i64 @test2(i64 %val) {
tail call i32 @ret32(i32 returned undef)
ret i32 42
}
should be tail calls, and the function sameNoopInput is responsible. The main
problem is that it is completely symmetric in the "tail call" and "ret" value,
but in reality different things are allowed on each side.
For these cases:
1. Any truncation should lead to a larger value being generated by "tail call"
than needed by "ret".
2. Undef should only be allowed as a source for ret, not as a result of the
call.
Along the way I noticed that a mismatch between what this function treats as a
valid truncation and what the backends see can lead to invalid calls as well
(see x86-32 test case).
This patch refactors the code so that instead of being based primarily on
values which it recurses into when necessary, it starts by inspecting the type
and considers each fundamental slot that the backend will see in turn. For
example, given a pathological function that returned {{}, {{}, i32, {}}, i32}
we would consider each "real" i32 in turn, and ask if it passes through
unchanged. This is much closer to what the backend sees as a result of
ComputeValueVTs.
Aside from the bug fixes, this eliminates the recursion that's going on and, I
believe, makes the bulk of the code significantly easier to understand. The
trade-off is the nasty iterators needed to find the real types inside a
returned value.
llvm-svn: 187787
2013-08-06 17:12:35 +08:00
|
|
|
|
2014-10-02 03:39:32 +08:00
|
|
|
/// Return true if any actual instruction that defines a
|
Implement support for using modeling implicit-zero-extension on x86-64
with SUBREG_TO_REG, teach SimpleRegisterCoalescing to coalesce
SUBREG_TO_REG instructions (which are similar to INSERT_SUBREG
instructions), and teach the DAGCombiner to take advantage of this on
targets which support it. This eliminates many redundant
zero-extension operations on x86-64.
This adds a new TargetLowering hook, isZExtFree. It's similar to
isTruncateFree, except it only applies to actual definitions, and not
no-op truncates which may not zero the high bits.
Also, this adds a new optimization to SimplifyDemandedBits: transform
operations like x+y into (zext (add (trunc x), (trunc y))) on targets
where all the casts are no-ops. In contexts where the high part of the
add is explicitly masked off, this allows the mask operation to be
eliminated. Fix the DAGCombiner to avoid undoing these transformations
to eliminate casts on targets where the casts are no-ops.
Also, this adds a new two-address lowering heuristic. Since
two-address lowering runs before coalescing, it helps to be able to
look through copies when deciding whether commuting and/or
three-address conversion are profitable.
Also, fix a bug in LiveInterval::MergeInClobberRanges. It didn't handle
the case that a clobber range extended both before and beyond an
existing live range. In that case, multiple live ranges need to be
added. This was exposed by the new subreg coalescing code.
Remove 2008-05-06-SpillerBug.ll. It was bugpoint-reduced, and the
spiller behavior it was looking for no longer occurrs with the new
instruction selection.
llvm-svn: 68576
2009-04-08 08:15:30 +08:00
|
|
|
/// value of type Ty1 implicit zero-extends the value to Ty2 in the result
|
|
|
|
/// register. This does not necessarily include registers defined in
|
|
|
|
/// unknown ways, such as incoming arguments, or copies from unknown
|
|
|
|
/// virtual registers. Also, if isTruncateFree(Ty2, Ty1) is true, this
|
|
|
|
/// does not necessarily apply to truncate instructions. e.g. on x86-64,
|
|
|
|
/// all instructions that define 32-bit values implicit zero-extend the
|
|
|
|
/// result out to 64 bits.
|
2014-03-09 15:44:38 +08:00
|
|
|
bool isZExtFree(Type *Ty1, Type *Ty2) const override;
|
|
|
|
bool isZExtFree(EVT VT1, EVT VT2) const override;
|
|
|
|
bool isZExtFree(SDValue Val, EVT VT2) const override;
|
Implement support for using modeling implicit-zero-extension on x86-64
with SUBREG_TO_REG, teach SimpleRegisterCoalescing to coalesce
SUBREG_TO_REG instructions (which are similar to INSERT_SUBREG
instructions), and teach the DAGCombiner to take advantage of this on
targets which support it. This eliminates many redundant
zero-extension operations on x86-64.
This adds a new TargetLowering hook, isZExtFree. It's similar to
isTruncateFree, except it only applies to actual definitions, and not
no-op truncates which may not zero the high bits.
Also, this adds a new optimization to SimplifyDemandedBits: transform
operations like x+y into (zext (add (trunc x), (trunc y))) on targets
where all the casts are no-ops. In contexts where the high part of the
add is explicitly masked off, this allows the mask operation to be
eliminated. Fix the DAGCombiner to avoid undoing these transformations
to eliminate casts on targets where the casts are no-ops.
Also, this adds a new two-address lowering heuristic. Since
two-address lowering runs before coalescing, it helps to be able to
look through copies when deciding whether commuting and/or
three-address conversion are profitable.
Also, fix a bug in LiveInterval::MergeInClobberRanges. It didn't handle
the case that a clobber range extended both before and beyond an
existing live range. In that case, multiple live ranges need to be
added. This was exposed by the new subreg coalescing code.
Remove 2008-05-06-SpillerBug.ll. It was bugpoint-reduced, and the
spiller behavior it was looking for no longer occurrs with the new
instruction selection.
llvm-svn: 68576
2009-04-08 08:15:30 +08:00
|
|
|
|
[CodeGen] Add hook/combine to form vector extloads, enabled on X86.
The combine that forms extloads used to be disabled on vector types,
because "None of the supported targets knows how to perform load and
sign extend on vectors in one instruction."
That's not entirely true, since at least SSE4.1 X86 knows how to do
those sextloads/zextloads (with PMOVS/ZX).
But there are several aspects to getting this right.
First, vector extloads are controlled by a profitability callback.
For instance, on ARM, several instructions have folded extload forms,
so it's not always beneficial to create an extload node (and trying to
match extloads is a whole 'nother can of worms).
The interesting optimization enables folding of s/zextloads to illegal
(splittable) vector types, expanding them into smaller legal extloads.
It's not ideal (it introduces some legalization-like behavior in the
combine) but it's better than the obvious alternative: form illegal
extloads, and later try to split them up. If you do that, you might
generate extloads that can't be split up, but have a valid ext+load
expansion. At vector-op legalization time, it's too late to generate
this kind of code, so you end up forced to scalarize. It's better to
just avoid creating egregiously illegal nodes.
This optimization is enabled unconditionally on X86.
Note that the splitting combine is happy with "custom" extloads. As
is, this bypasses the actual custom lowering, and just unrolls the
extload. But from what I've seen, this is still much better than the
current custom lowering, which does some kind of unrolling at the end
anyway (see for instance load_sext_4i8_to_4i64 on SSE2, and the added
FIXME).
Also note that the existing combine that forms extloads is now also
enabled on legal vectors. This doesn't have a big effect on X86
(because sext+load is usually combined to sext_inreg+aextload).
On ARM it fires on some rare occasions; that's for a separate commit.
Differential Revision: http://reviews.llvm.org/D6904
llvm-svn: 228325
2015-02-06 02:31:02 +08:00
|
|
|
/// Return true if folding a vector load into ExtVal (a sign, zero, or any
|
|
|
|
/// extend node) is profitable.
|
|
|
|
bool isVectorLoadExtDesirable(SDValue) const override;
|
|
|
|
|
2014-10-02 03:39:32 +08:00
|
|
|
/// Return true if an FMA operation is faster than a pair of fmul and fadd
|
|
|
|
/// instructions. fmuladd intrinsics will be expanded to FMAs when this
|
|
|
|
/// method returns true, otherwise fmuladd is expanded to fmul + fadd.
|
2014-03-09 15:44:38 +08:00
|
|
|
bool isFMAFasterThanFMulAndFAdd(EVT VT) const override;
|
2012-08-01 20:06:00 +08:00
|
|
|
|
2014-10-02 03:39:32 +08:00
|
|
|
/// Return true if it's profitable to narrow
|
2009-05-28 08:35:15 +08:00
|
|
|
/// operations of type VT1 to VT2. e.g. on x86, it's profitable to narrow
|
|
|
|
/// from i32 to i8 but not from i32 to i16.
|
2014-03-09 15:44:38 +08:00
|
|
|
bool isNarrowingProfitable(EVT VT1, EVT VT2) const override;
|
2009-05-28 08:35:15 +08:00
|
|
|
|
2016-01-12 18:02:32 +08:00
|
|
|
/// Given an intrinsic, checks if on the target the intrinsic will need to map
|
|
|
|
/// to a MemIntrinsicNode (touches memory). If this is the case, it returns
|
|
|
|
/// true and stores the intrinsic information into the IntrinsicInfo that was
|
|
|
|
/// passed to the function.
|
|
|
|
bool getTgtMemIntrinsic(IntrinsicInfo &Info, const CallInst &I,
|
2017-12-15 06:34:10 +08:00
|
|
|
MachineFunction &MF,
|
2016-01-12 18:02:32 +08:00
|
|
|
unsigned Intrinsic) const override;
|
|
|
|
|
2014-10-02 03:39:32 +08:00
|
|
|
/// Returns true if the target can instruction select the
|
2009-10-28 03:56:55 +08:00
|
|
|
/// specified FP immediate natively. If false, the legalizer will
|
|
|
|
/// materialize the FP immediate as a load from a constant pool.
|
2019-03-19 02:40:07 +08:00
|
|
|
bool isFPImmLegal(const APFloat &Imm, EVT VT,
|
|
|
|
bool ForCodeSize) const override;
|
2009-10-28 03:56:55 +08:00
|
|
|
|
2014-10-02 03:39:32 +08:00
|
|
|
/// Targets can use this to indicate that they only support *some*
|
|
|
|
/// VECTOR_SHUFFLE operations, those with specific masks. By default, if a
|
|
|
|
/// target supports the VECTOR_SHUFFLE node, all mask values are assumed to
|
|
|
|
/// be legal.
|
2017-07-26 16:06:58 +08:00
|
|
|
bool isShuffleMaskLegal(ArrayRef<int> Mask, EVT VT) const override;
|
2006-04-20 16:58:49 +08:00
|
|
|
|
2018-06-26 22:15:31 +08:00
|
|
|
/// Similar to isShuffleMaskLegal. Targets can use this to indicate if there
|
|
|
|
/// is a suitable VECTOR_SHUFFLE that can be used to replace a VAND with a
|
|
|
|
/// constant pool entry.
|
|
|
|
bool isVectorClearMaskLegal(ArrayRef<int> Mask, EVT VT) const override;
|
2008-03-05 09:30:59 +08:00
|
|
|
|
Introduce the "retpoline" x86 mitigation technique for variant #2 of the speculative execution vulnerabilities disclosed today, specifically identified by CVE-2017-5715, "Branch Target Injection", and is one of the two halves to Spectre..
Summary:
First, we need to explain the core of the vulnerability. Note that this
is a very incomplete description, please see the Project Zero blog post
for details:
https://googleprojectzero.blogspot.com/2018/01/reading-privileged-memory-with-side.html
The basis for branch target injection is to direct speculative execution
of the processor to some "gadget" of executable code by poisoning the
prediction of indirect branches with the address of that gadget. The
gadget in turn contains an operation that provides a side channel for
reading data. Most commonly, this will look like a load of secret data
followed by a branch on the loaded value and then a load of some
predictable cache line. The attacker then uses timing of the processors
cache to determine which direction the branch took *in the speculative
execution*, and in turn what one bit of the loaded value was. Due to the
nature of these timing side channels and the branch predictor on Intel
processors, this allows an attacker to leak data only accessible to
a privileged domain (like the kernel) back into an unprivileged domain.
The goal is simple: avoid generating code which contains an indirect
branch that could have its prediction poisoned by an attacker. In many
cases, the compiler can simply use directed conditional branches and
a small search tree. LLVM already has support for lowering switches in
this way and the first step of this patch is to disable jump-table
lowering of switches and introduce a pass to rewrite explicit indirectbr
sequences into a switch over integers.
However, there is no fully general alternative to indirect calls. We
introduce a new construct we call a "retpoline" to implement indirect
calls in a non-speculatable way. It can be thought of loosely as
a trampoline for indirect calls which uses the RET instruction on x86.
Further, we arrange for a specific call->ret sequence which ensures the
processor predicts the return to go to a controlled, known location. The
retpoline then "smashes" the return address pushed onto the stack by the
call with the desired target of the original indirect call. The result
is a predicted return to the next instruction after a call (which can be
used to trap speculative execution within an infinite loop) and an
actual indirect branch to an arbitrary address.
On 64-bit x86 ABIs, this is especially easily done in the compiler by
using a guaranteed scratch register to pass the target into this device.
For 32-bit ABIs there isn't a guaranteed scratch register and so several
different retpoline variants are introduced to use a scratch register if
one is available in the calling convention and to otherwise use direct
stack push/pop sequences to pass the target address.
This "retpoline" mitigation is fully described in the following blog
post: https://support.google.com/faqs/answer/7625886
We also support a target feature that disables emission of the retpoline
thunk by the compiler to allow for custom thunks if users want them.
These are particularly useful in environments like kernels that
routinely do hot-patching on boot and want to hot-patch their thunk to
different code sequences. They can write this custom thunk and use
`-mretpoline-external-thunk` *in addition* to `-mretpoline`. In this
case, on x86-64 thu thunk names must be:
```
__llvm_external_retpoline_r11
```
or on 32-bit:
```
__llvm_external_retpoline_eax
__llvm_external_retpoline_ecx
__llvm_external_retpoline_edx
__llvm_external_retpoline_push
```
And the target of the retpoline is passed in the named register, or in
the case of the `push` suffix on the top of the stack via a `pushl`
instruction.
There is one other important source of indirect branches in x86 ELF
binaries: the PLT. These patches also include support for LLD to
generate PLT entries that perform a retpoline-style indirection.
The only other indirect branches remaining that we are aware of are from
precompiled runtimes (such as crt0.o and similar). The ones we have
found are not really attackable, and so we have not focused on them
here, but eventually these runtimes should also be replicated for
retpoline-ed configurations for completeness.
For kernels or other freestanding or fully static executables, the
compiler switch `-mretpoline` is sufficient to fully mitigate this
particular attack. For dynamic executables, you must compile *all*
libraries with `-mretpoline` and additionally link the dynamic
executable and all shared libraries with LLD and pass `-z retpolineplt`
(or use similar functionality from some other linker). We strongly
recommend also using `-z now` as non-lazy binding allows the
retpoline-mitigated PLT to be substantially smaller.
When manually apply similar transformations to `-mretpoline` to the
Linux kernel we observed very small performance hits to applications
running typical workloads, and relatively minor hits (approximately 2%)
even for extremely syscall-heavy applications. This is largely due to
the small number of indirect branches that occur in performance
sensitive paths of the kernel.
When using these patches on statically linked applications, especially
C++ applications, you should expect to see a much more dramatic
performance hit. For microbenchmarks that are switch, indirect-, or
virtual-call heavy we have seen overheads ranging from 10% to 50%.
However, real-world workloads exhibit substantially lower performance
impact. Notably, techniques such as PGO and ThinLTO dramatically reduce
the impact of hot indirect calls (by speculatively promoting them to
direct calls) and allow optimized search trees to be used to lower
switches. If you need to deploy these techniques in C++ applications, we
*strongly* recommend that you ensure all hot call targets are statically
linked (avoiding PLT indirection) and use both PGO and ThinLTO. Well
tuned servers using all of these techniques saw 5% - 10% overhead from
the use of retpoline.
We will add detailed documentation covering these components in
subsequent patches, but wanted to make the core functionality available
as soon as possible. Happy for more code review, but we'd really like to
get these patches landed and backported ASAP for obvious reasons. We're
planning to backport this to both 6.0 and 5.0 release streams and get
a 5.0 release with just this cherry picked ASAP for distros and vendors.
This patch is the work of a number of people over the past month: Eric, Reid,
Rui, and myself. I'm mailing it out as a single commit due to the time
sensitive nature of landing this and the need to backport it. Huge thanks to
everyone who helped out here, and everyone at Intel who helped out in
discussions about how to craft this. Also, credit goes to Paul Turner (at
Google, but not an LLVM contributor) for much of the underlying retpoline
design.
Reviewers: echristo, rnk, ruiu, craig.topper, DavidKreitzer
Subscribers: sanjoy, emaste, mcrosier, mgorny, mehdi_amini, hiraditya, llvm-commits
Differential Revision: https://reviews.llvm.org/D41723
llvm-svn: 323155
2018-01-23 06:05:25 +08:00
|
|
|
/// Returns true if lowering to a jump table is allowed.
|
|
|
|
bool areJTsAllowed(const Function *Fn) const override;
|
|
|
|
|
2014-10-02 03:39:32 +08:00
|
|
|
/// If true, then instruction selection should
|
2008-03-05 09:30:59 +08:00
|
|
|
/// seek to shrink the FP constant of the specified type to a smaller type
|
|
|
|
/// in order to save space and / or reduce runtime.
|
2014-03-09 15:44:38 +08:00
|
|
|
bool ShouldShrinkFPConstant(EVT VT) const override {
|
2008-03-05 09:30:59 +08:00
|
|
|
// Don't shrink FP constpool if SSE2 is available since cvtss2sd is more
|
|
|
|
// expensive than a straight movsd. On the other hand, it's important to
|
|
|
|
// shrink long double fp constant since fldt is very slow.
|
2009-08-12 04:47:22 +08:00
|
|
|
return !X86ScalarSSEf64 || VT == MVT::f80;
|
2008-03-05 09:30:59 +08:00
|
|
|
}
|
2010-10-21 07:40:27 +08:00
|
|
|
|
2015-01-06 15:12:52 +08:00
|
|
|
/// Return true if we believe it is correct and profitable to reduce the
|
|
|
|
/// load node to a smaller type.
|
|
|
|
bool shouldReduceLoadWidth(SDNode *Load, ISD::LoadExtType ExtTy,
|
|
|
|
EVT NewVT) const override;
|
|
|
|
|
2014-10-02 03:39:32 +08:00
|
|
|
/// Return true if the specified scalar FP type is computed in an SSE
|
|
|
|
/// register, not on the X87 floating point stack.
|
2009-08-11 06:56:29 +08:00
|
|
|
bool isScalarFPTypeInSSEReg(EVT VT) const {
|
2009-08-12 04:47:22 +08:00
|
|
|
return (VT == MVT::f64 && X86ScalarSSEf64) || // f64 is when SSE2
|
2015-11-02 13:24:22 +08:00
|
|
|
(VT == MVT::f32 && X86ScalarSSEf32); // f32 is when SSE1
|
2008-01-18 14:52:41 +08:00
|
|
|
}
|
2008-08-20 05:32:53 +08:00
|
|
|
|
2018-05-01 23:54:18 +08:00
|
|
|
/// Returns true if it is beneficial to convert a load of a constant
|
2014-01-28 09:20:14 +08:00
|
|
|
/// to just the constant itself.
|
2014-03-09 15:44:38 +08:00
|
|
|
bool shouldConvertConstantLoadToIntImm(const APInt &Imm,
|
|
|
|
Type *Ty) const override;
|
2014-01-28 09:20:14 +08:00
|
|
|
|
2018-11-26 01:27:02 +08:00
|
|
|
bool reduceSelectOfFPConstantLoads(bool IsFPSetCC) const override;
|
|
|
|
|
2017-08-25 07:24:43 +08:00
|
|
|
bool convertSelectOfConstantsToMath(EVT VT) const override;
|
[DAGCombiner] allow transforming (select Cond, C +/- 1, C) to (add(ext Cond), C)
select Cond, C +/- 1, C --> add(ext Cond), C -- with a target hook.
This is part of the ongoing process to obsolete D24480. The motivation is to
canonicalize to select IR in InstCombine whenever possible, so we need to have a way to
undo that easily in codegen.
PowerPC is an obvious winner for this kind of transform because it has fast and complete
bit-twiddling abilities but generally lousy conditional execution perf (although this might
have changed in recent implementations).
x86 also sees some wins, but the effect is limited because these transforms already mostly
exist in its target-specific combineSelectOfTwoConstants(). The fact that we see any x86
changes just shows that that code is a mess of special-case holes. We may be able to remove
some of that logic now.
My guess is that other targets will want to enable this hook for most cases. The likely
follow-ups would be to add value type and/or the constants themselves as parameters for the
hook. As the tests in select_const.ll show, we can transform any select-of-constants to
math/logic, but the general transform for any 2 constants needs one more instruction
(multiply or 'and').
ARM is one target that I think may not want this for most cases. I see infinite loops there
because it wants to use selects to enable conditionally executed instructions.
Differential Revision: https://reviews.llvm.org/D30537
llvm-svn: 296977
2017-03-05 03:18:09 +08:00
|
|
|
|
2018-09-19 23:57:40 +08:00
|
|
|
bool decomposeMulByConstant(EVT VT, SDValue C) const override;
|
|
|
|
|
2018-12-04 19:21:30 +08:00
|
|
|
bool shouldUseStrictFP_TO_INT(EVT FpVT, EVT IntVT,
|
|
|
|
bool IsSigned) const override;
|
|
|
|
|
2014-12-17 20:32:17 +08:00
|
|
|
/// Return true if EXTRACT_SUBVECTOR is cheap for this result type
|
|
|
|
/// with this index.
|
2017-08-14 01:29:07 +08:00
|
|
|
bool isExtractSubvectorCheap(EVT ResVT, EVT SrcVT,
|
|
|
|
unsigned Index) const override;
|
2014-12-17 20:32:17 +08:00
|
|
|
|
2019-01-04 05:31:16 +08:00
|
|
|
/// Scalar ops always have equal or better analysis/performance/power than
|
|
|
|
/// the vector equivalent, so this always makes sense if the scalar op is
|
|
|
|
/// supported.
|
|
|
|
bool shouldScalarizeBinop(SDValue) const override;
|
|
|
|
|
2019-04-05 21:32:17 +08:00
|
|
|
/// Extract of a scalar FP value from index 0 of a vector is free.
|
|
|
|
bool isExtractVecEltCheap(EVT VT, unsigned Index) const override {
|
|
|
|
EVT EltVT = VT.getScalarType();
|
|
|
|
return (EltVT == MVT::f32 || EltVT == MVT::f64) && Index == 0;
|
|
|
|
}
|
|
|
|
|
2019-02-19 07:33:05 +08:00
|
|
|
/// Overflow nodes should get combined/lowered to optimal instructions
|
|
|
|
/// (they should allow eliminating explicit compares by getting flags from
|
|
|
|
/// math ops).
|
|
|
|
bool shouldFormOverflowOp(unsigned Opcode, EVT VT) const override;
|
|
|
|
|
2017-09-16 21:29:12 +08:00
|
|
|
bool storeOfVectorConstantIsCheap(EVT MemVT, unsigned NumElem,
|
|
|
|
unsigned AddrSpace) const override {
|
|
|
|
// If we can replace more than 2 scalar stores, there will be a reduction
|
|
|
|
// in instructions even after we add a vector constant load.
|
|
|
|
return NumElem > 2;
|
|
|
|
}
|
|
|
|
|
2019-07-10 03:55:28 +08:00
|
|
|
bool isLoadBitCastBeneficial(EVT LoadVT, EVT BitcastVT,
|
|
|
|
const SelectionDAG &DAG,
|
|
|
|
const MachineMemOperand &MMO) const override;
|
2017-12-31 15:38:41 +08:00
|
|
|
|
2014-03-26 20:52:28 +08:00
|
|
|
/// Intel processors have a unified instruction and data cache
|
2014-04-29 15:58:41 +08:00
|
|
|
const char * getClearCacheBuiltinName() const override {
|
2014-04-28 12:05:08 +08:00
|
|
|
return nullptr; // nothing to do, move along.
|
2014-03-26 20:52:28 +08:00
|
|
|
}
|
|
|
|
|
2015-07-10 01:40:29 +08:00
|
|
|
unsigned getRegisterByName(const char* RegName, EVT VT,
|
|
|
|
SelectionDAG &DAG) const override;
|
2014-05-07 00:51:25 +08:00
|
|
|
|
2015-11-07 09:11:31 +08:00
|
|
|
/// If a physical register, this returns the register that receives the
|
|
|
|
/// exception address on entry to an EH pad.
|
|
|
|
unsigned
|
|
|
|
getExceptionPointerRegister(const Constant *PersonalityFn) const override;
|
|
|
|
|
|
|
|
/// If a physical register, this returns the register that receives the
|
|
|
|
/// exception typeid on entry to a landing pad.
|
|
|
|
unsigned
|
|
|
|
getExceptionSelectorRegister(const Constant *PersonalityFn) const override;
|
|
|
|
|
2016-03-03 08:01:25 +08:00
|
|
|
virtual bool needsFixedCatchObjects() const override;
|
|
|
|
|
2014-10-02 03:39:32 +08:00
|
|
|
/// This method returns a target specific FastISel object,
|
2008-08-20 05:32:53 +08:00
|
|
|
/// or null if the target does not support "fast" ISel.
|
2014-03-09 15:44:38 +08:00
|
|
|
FastISel *createFastISel(FunctionLoweringInfo &funcInfo,
|
|
|
|
const TargetLibraryInfo *libInfo) const override;
|
2009-07-01 06:38:32 +08:00
|
|
|
|
2016-04-06 06:41:50 +08:00
|
|
|
/// If the target has a standard location for the stack protector cookie,
|
|
|
|
/// returns the address of that location. Otherwise, returns nullptr.
|
2016-04-09 05:26:31 +08:00
|
|
|
Value *getIRStackGuard(IRBuilder<> &IRB) const override;
|
|
|
|
|
[stack-protection] Add support for MSVC buffer security check
Summary:
This patch is adding support for the MSVC buffer security check implementation
The buffer security check is turned on with the '/GS' compiler switch.
* https://msdn.microsoft.com/en-us/library/8dbf701c.aspx
* To be added to clang here: http://reviews.llvm.org/D20347
Some overview of buffer security check feature and implementation:
* https://msdn.microsoft.com/en-us/library/aa290051(VS.71).aspx
* http://www.ksyash.com/2011/01/buffer-overflow-protection-3/
* http://blog.osom.info/2012/02/understanding-vs-c-compilers-buffer.html
For the following example:
```
int example(int offset, int index) {
char buffer[10];
memset(buffer, 0xCC, index);
return buffer[index];
}
```
The MSVC compiler is adding these instructions to perform stack integrity check:
```
push ebp
mov ebp,esp
sub esp,50h
[1] mov eax,dword ptr [__security_cookie (01068024h)]
[2] xor eax,ebp
[3] mov dword ptr [ebp-4],eax
push ebx
push esi
push edi
mov eax,dword ptr [index]
push eax
push 0CCh
lea ecx,[buffer]
push ecx
call _memset (010610B9h)
add esp,0Ch
mov eax,dword ptr [index]
movsx eax,byte ptr buffer[eax]
pop edi
pop esi
pop ebx
[4] mov ecx,dword ptr [ebp-4]
[5] xor ecx,ebp
[6] call @__security_check_cookie@4 (01061276h)
mov esp,ebp
pop ebp
ret
```
The instrumentation above is:
* [1] is loading the global security canary,
* [3] is storing the local computed ([2]) canary to the guard slot,
* [4] is loading the guard slot and ([5]) re-compute the global canary,
* [6] is validating the resulting canary with the '__security_check_cookie' and performs error handling.
Overview of the current stack-protection implementation:
* lib/CodeGen/StackProtector.cpp
* There is a default stack-protection implementation applied on intermediate representation.
* The target can overload 'getIRStackGuard' method if it has a standard location for the stack protector cookie.
* An intrinsic 'Intrinsic::stackprotector' is added to the prologue. It will be expanded by the instruction selection pass (DAG or Fast).
* Basic Blocks are added to every instrumented function to receive the code for handling stack guard validation and errors handling.
* Guard manipulation and comparison are added directly to the intermediate representation.
* lib/CodeGen/SelectionDAG/SelectionDAGISel.cpp
* lib/CodeGen/SelectionDAG/SelectionDAGBuilder.cpp
* There is an implementation that adds instrumentation during instruction selection (for better handling of sibbling calls).
* see long comment above 'class StackProtectorDescriptor' declaration.
* The target needs to override 'getSDagStackGuard' to activate SDAG stack protection generation. (note: getIRStackGuard MUST be nullptr).
* 'getSDagStackGuard' returns the appropriate stack guard (security cookie)
* The code is generated by 'SelectionDAGBuilder.cpp' and 'SelectionDAGISel.cpp'.
* include/llvm/Target/TargetLowering.h
* Contains function to retrieve the default Guard 'Value'; should be overriden by each target to select which implementation is used and provide Guard 'Value'.
* lib/Target/X86/X86ISelLowering.cpp
* Contains the x86 specialisation; Guard 'Value' used by the SelectionDAG algorithm.
Function-based Instrumentation:
* The MSVC doesn't inline the stack guard comparison in every function. Instead, a call to '__security_check_cookie' is added to the epilogue before every return instructions.
* To support function-based instrumentation, this patch is
* adding a function to get the function-based check (llvm 'Value', see include/llvm/Target/TargetLowering.h),
* If provided, the stack protection instrumentation won't be inlined and a call to that function will be added to the prologue.
* modifying (SelectionDAGISel.cpp) do avoid producing basic blocks used for inline instrumentation,
* generating the function-based instrumentation during the ISEL pass (SelectionDAGBuilder.cpp),
* if FastISEL (not SelectionDAG), using the fallback which rely on the same function-based implemented over intermediate representation (StackProtector.cpp).
Modifications
* adding support for MSVC (lib/Target/X86/X86ISelLowering.cpp)
* adding support function-based instrumentation (lib/CodeGen/SelectionDAG/SelectionDAGBuilder.cpp, .h)
Results
* IR generated instrumentation:
```
clang-cl /GS test.cc /Od /c -mllvm -print-isel-input
```
```
*** Final LLVM Code input to ISel ***
; Function Attrs: nounwind sspstrong
define i32 @"\01?example@@YAHHH@Z"(i32 %offset, i32 %index) #0 {
entry:
%StackGuardSlot = alloca i8* <<<-- Allocated guard slot
%0 = call i8* @llvm.stackguard() <<<-- Loading Stack Guard value
call void @llvm.stackprotector(i8* %0, i8** %StackGuardSlot) <<<-- Prologue intrinsic call (store to Guard slot)
%index.addr = alloca i32, align 4
%offset.addr = alloca i32, align 4
%buffer = alloca [10 x i8], align 1
store i32 %index, i32* %index.addr, align 4
store i32 %offset, i32* %offset.addr, align 4
%arraydecay = getelementptr inbounds [10 x i8], [10 x i8]* %buffer, i32 0, i32 0
%1 = load i32, i32* %index.addr, align 4
call void @llvm.memset.p0i8.i32(i8* %arraydecay, i8 -52, i32 %1, i32 1, i1 false)
%2 = load i32, i32* %index.addr, align 4
%arrayidx = getelementptr inbounds [10 x i8], [10 x i8]* %buffer, i32 0, i32 %2
%3 = load i8, i8* %arrayidx, align 1
%conv = sext i8 %3 to i32
%4 = load volatile i8*, i8** %StackGuardSlot <<<-- Loading Guard slot
call void @__security_check_cookie(i8* %4) <<<-- Epilogue function-based check
ret i32 %conv
}
```
* SelectionDAG generated instrumentation:
```
clang-cl /GS test.cc /O1 /c /FA
```
```
"?example@@YAHHH@Z": # @"\01?example@@YAHHH@Z"
# BB#0: # %entry
pushl %esi
subl $16, %esp
movl ___security_cookie, %eax <<<-- Loading Stack Guard value
movl 28(%esp), %esi
movl %eax, 12(%esp) <<<-- Store to Guard slot
leal 2(%esp), %eax
pushl %esi
pushl $204
pushl %eax
calll _memset
addl $12, %esp
movsbl 2(%esp,%esi), %esi
movl 12(%esp), %ecx <<<-- Loading Guard slot
calll @__security_check_cookie@4 <<<-- Epilogue function-based check
movl %esi, %eax
addl $16, %esp
popl %esi
retl
```
Reviewers: kcc, pcc, eugenis, rnk
Subscribers: majnemer, llvm-commits, hans, thakis, rnk
Differential Revision: http://reviews.llvm.org/D20346
llvm-svn: 272053
2016-06-08 04:15:35 +08:00
|
|
|
bool useLoadStackGuardNode() const override;
|
2017-12-06 04:22:20 +08:00
|
|
|
bool useStackGuardXorFP() const override;
|
2016-04-09 05:26:31 +08:00
|
|
|
void insertSSPDeclarations(Module &M) const override;
|
[stack-protection] Add support for MSVC buffer security check
Summary:
This patch is adding support for the MSVC buffer security check implementation
The buffer security check is turned on with the '/GS' compiler switch.
* https://msdn.microsoft.com/en-us/library/8dbf701c.aspx
* To be added to clang here: http://reviews.llvm.org/D20347
Some overview of buffer security check feature and implementation:
* https://msdn.microsoft.com/en-us/library/aa290051(VS.71).aspx
* http://www.ksyash.com/2011/01/buffer-overflow-protection-3/
* http://blog.osom.info/2012/02/understanding-vs-c-compilers-buffer.html
For the following example:
```
int example(int offset, int index) {
char buffer[10];
memset(buffer, 0xCC, index);
return buffer[index];
}
```
The MSVC compiler is adding these instructions to perform stack integrity check:
```
push ebp
mov ebp,esp
sub esp,50h
[1] mov eax,dword ptr [__security_cookie (01068024h)]
[2] xor eax,ebp
[3] mov dword ptr [ebp-4],eax
push ebx
push esi
push edi
mov eax,dword ptr [index]
push eax
push 0CCh
lea ecx,[buffer]
push ecx
call _memset (010610B9h)
add esp,0Ch
mov eax,dword ptr [index]
movsx eax,byte ptr buffer[eax]
pop edi
pop esi
pop ebx
[4] mov ecx,dword ptr [ebp-4]
[5] xor ecx,ebp
[6] call @__security_check_cookie@4 (01061276h)
mov esp,ebp
pop ebp
ret
```
The instrumentation above is:
* [1] is loading the global security canary,
* [3] is storing the local computed ([2]) canary to the guard slot,
* [4] is loading the guard slot and ([5]) re-compute the global canary,
* [6] is validating the resulting canary with the '__security_check_cookie' and performs error handling.
Overview of the current stack-protection implementation:
* lib/CodeGen/StackProtector.cpp
* There is a default stack-protection implementation applied on intermediate representation.
* The target can overload 'getIRStackGuard' method if it has a standard location for the stack protector cookie.
* An intrinsic 'Intrinsic::stackprotector' is added to the prologue. It will be expanded by the instruction selection pass (DAG or Fast).
* Basic Blocks are added to every instrumented function to receive the code for handling stack guard validation and errors handling.
* Guard manipulation and comparison are added directly to the intermediate representation.
* lib/CodeGen/SelectionDAG/SelectionDAGISel.cpp
* lib/CodeGen/SelectionDAG/SelectionDAGBuilder.cpp
* There is an implementation that adds instrumentation during instruction selection (for better handling of sibbling calls).
* see long comment above 'class StackProtectorDescriptor' declaration.
* The target needs to override 'getSDagStackGuard' to activate SDAG stack protection generation. (note: getIRStackGuard MUST be nullptr).
* 'getSDagStackGuard' returns the appropriate stack guard (security cookie)
* The code is generated by 'SelectionDAGBuilder.cpp' and 'SelectionDAGISel.cpp'.
* include/llvm/Target/TargetLowering.h
* Contains function to retrieve the default Guard 'Value'; should be overriden by each target to select which implementation is used and provide Guard 'Value'.
* lib/Target/X86/X86ISelLowering.cpp
* Contains the x86 specialisation; Guard 'Value' used by the SelectionDAG algorithm.
Function-based Instrumentation:
* The MSVC doesn't inline the stack guard comparison in every function. Instead, a call to '__security_check_cookie' is added to the epilogue before every return instructions.
* To support function-based instrumentation, this patch is
* adding a function to get the function-based check (llvm 'Value', see include/llvm/Target/TargetLowering.h),
* If provided, the stack protection instrumentation won't be inlined and a call to that function will be added to the prologue.
* modifying (SelectionDAGISel.cpp) do avoid producing basic blocks used for inline instrumentation,
* generating the function-based instrumentation during the ISEL pass (SelectionDAGBuilder.cpp),
* if FastISEL (not SelectionDAG), using the fallback which rely on the same function-based implemented over intermediate representation (StackProtector.cpp).
Modifications
* adding support for MSVC (lib/Target/X86/X86ISelLowering.cpp)
* adding support function-based instrumentation (lib/CodeGen/SelectionDAG/SelectionDAGBuilder.cpp, .h)
Results
* IR generated instrumentation:
```
clang-cl /GS test.cc /Od /c -mllvm -print-isel-input
```
```
*** Final LLVM Code input to ISel ***
; Function Attrs: nounwind sspstrong
define i32 @"\01?example@@YAHHH@Z"(i32 %offset, i32 %index) #0 {
entry:
%StackGuardSlot = alloca i8* <<<-- Allocated guard slot
%0 = call i8* @llvm.stackguard() <<<-- Loading Stack Guard value
call void @llvm.stackprotector(i8* %0, i8** %StackGuardSlot) <<<-- Prologue intrinsic call (store to Guard slot)
%index.addr = alloca i32, align 4
%offset.addr = alloca i32, align 4
%buffer = alloca [10 x i8], align 1
store i32 %index, i32* %index.addr, align 4
store i32 %offset, i32* %offset.addr, align 4
%arraydecay = getelementptr inbounds [10 x i8], [10 x i8]* %buffer, i32 0, i32 0
%1 = load i32, i32* %index.addr, align 4
call void @llvm.memset.p0i8.i32(i8* %arraydecay, i8 -52, i32 %1, i32 1, i1 false)
%2 = load i32, i32* %index.addr, align 4
%arrayidx = getelementptr inbounds [10 x i8], [10 x i8]* %buffer, i32 0, i32 %2
%3 = load i8, i8* %arrayidx, align 1
%conv = sext i8 %3 to i32
%4 = load volatile i8*, i8** %StackGuardSlot <<<-- Loading Guard slot
call void @__security_check_cookie(i8* %4) <<<-- Epilogue function-based check
ret i32 %conv
}
```
* SelectionDAG generated instrumentation:
```
clang-cl /GS test.cc /O1 /c /FA
```
```
"?example@@YAHHH@Z": # @"\01?example@@YAHHH@Z"
# BB#0: # %entry
pushl %esi
subl $16, %esp
movl ___security_cookie, %eax <<<-- Loading Stack Guard value
movl 28(%esp), %esi
movl %eax, 12(%esp) <<<-- Store to Guard slot
leal 2(%esp), %eax
pushl %esi
pushl $204
pushl %eax
calll _memset
addl $12, %esp
movsbl 2(%esp,%esi), %esi
movl 12(%esp), %ecx <<<-- Loading Guard slot
calll @__security_check_cookie@4 <<<-- Epilogue function-based check
movl %esi, %eax
addl $16, %esp
popl %esi
retl
```
Reviewers: kcc, pcc, eugenis, rnk
Subscribers: majnemer, llvm-commits, hans, thakis, rnk
Differential Revision: http://reviews.llvm.org/D20346
llvm-svn: 272053
2016-06-08 04:15:35 +08:00
|
|
|
Value *getSDagStackGuard(const Module &M) const override;
|
2019-02-02 04:43:25 +08:00
|
|
|
Function *getSSPStackGuardCheck(const Module &M) const override;
|
2017-12-06 04:22:20 +08:00
|
|
|
SDValue emitStackGuardXorFP(SelectionDAG &DAG, SDValue Val,
|
|
|
|
const SDLoc &DL) const override;
|
|
|
|
|
2016-04-09 05:26:31 +08:00
|
|
|
|
2015-09-24 02:07:56 +08:00
|
|
|
/// Return true if the target stores SafeStack pointer at a fixed offset in
|
|
|
|
/// some non-standard address space, and populates the address space and
|
|
|
|
/// offset as appropriate.
|
2015-10-27 02:28:25 +08:00
|
|
|
Value *getSafeStackPointerLocation(IRBuilder<> &IRB) const override;
|
2015-09-24 02:07:56 +08:00
|
|
|
|
2011-06-07 07:15:58 +08:00
|
|
|
SDValue BuildFILD(SDValue Op, EVT SrcVT, SDValue Chain, SDValue StackSlot,
|
|
|
|
SelectionDAG &DAG) const;
|
|
|
|
|
2014-03-09 15:44:38 +08:00
|
|
|
bool isNoopAddrSpaceCast(unsigned SrcAS, unsigned DestAS) const override;
|
2013-11-15 09:34:59 +08:00
|
|
|
|
2018-05-01 23:54:18 +08:00
|
|
|
/// Customize the preferred legalization strategy for certain types.
|
2018-11-06 07:26:13 +08:00
|
|
|
LegalizeTypeAction getPreferredVectorAction(MVT VT) const override;
|
2014-07-03 10:11:29 +08:00
|
|
|
|
2018-07-28 21:25:19 +08:00
|
|
|
MVT getRegisterTypeForCallingConv(LLVMContext &Context, CallingConv::ID CC,
|
2018-01-23 22:25:39 +08:00
|
|
|
EVT VT) const override;
|
|
|
|
|
|
|
|
unsigned getNumRegistersForCallingConv(LLVMContext &Context,
|
2018-07-28 21:25:19 +08:00
|
|
|
CallingConv::ID CC,
|
2018-01-23 22:25:39 +08:00
|
|
|
EVT VT) const override;
|
|
|
|
|
Rename AttributeSet to AttributeList
Summary:
This class is a list of AttributeSetNodes corresponding the function
prototype of a call or function declaration. This class used to be
called ParamAttrListPtr, then AttrListPtr, then AttributeSet. It is
typically accessed by parameter and return value index, so
"AttributeList" seems like a more intuitive name.
Rename AttributeSetImpl to AttributeListImpl to follow suit.
It's useful to rename this class so that we can rename AttributeSetNode
to AttributeSet later. AttributeSet is the set of attributes that apply
to a single function, argument, or return value.
Reviewers: sanjoy, javed.absar, chandlerc, pete
Reviewed By: pete
Subscribers: pete, jholewinski, arsenm, dschuff, mehdi_amini, jfb, nhaehnle, sbc100, void, llvm-commits
Differential Revision: https://reviews.llvm.org/D31102
llvm-svn: 298393
2017-03-22 00:57:19 +08:00
|
|
|
bool isIntDivCheap(EVT VT, AttributeList Attr) const override;
|
2015-08-19 19:21:43 +08:00
|
|
|
|
2016-09-23 04:06:25 +08:00
|
|
|
bool supportSwiftError() const override;
|
2016-04-12 05:08:06 +08:00
|
|
|
|
2017-06-22 23:42:53 +08:00
|
|
|
StringRef getStackProbeSymbolName(MachineFunction &MF) const override;
|
|
|
|
|
2018-03-09 22:29:21 +08:00
|
|
|
bool hasVectorBlend() const override { return true; }
|
|
|
|
|
2016-10-15 02:20:41 +08:00
|
|
|
unsigned getMaxSupportedInterleaveFactor() const override { return 4; }
|
|
|
|
|
2018-05-01 23:54:18 +08:00
|
|
|
/// Lower interleaved load(s) into target specific
|
2016-10-15 02:20:41 +08:00
|
|
|
/// instructions/intrinsics.
|
|
|
|
bool lowerInterleavedLoad(LoadInst *LI,
|
|
|
|
ArrayRef<ShuffleVectorInst *> Shuffles,
|
|
|
|
ArrayRef<unsigned> Indices,
|
|
|
|
unsigned Factor) const override;
|
2017-04-29 04:25:05 +08:00
|
|
|
|
2018-05-01 23:54:18 +08:00
|
|
|
/// Lower interleaved store(s) into target specific
|
2017-06-23 06:59:04 +08:00
|
|
|
/// instructions/intrinsics.
|
|
|
|
bool lowerInterleavedStore(StoreInst *SI, ShuffleVectorInst *SVI,
|
|
|
|
unsigned Factor) const override;
|
|
|
|
|
2018-07-31 03:41:25 +08:00
|
|
|
SDValue expandIndirectJTBranch(const SDLoc& dl, SDValue Value,
|
|
|
|
SDValue Addr, SelectionDAG &DAG)
|
2018-03-17 21:29:46 +08:00
|
|
|
const override;
|
|
|
|
|
2010-07-27 05:50:05 +08:00
|
|
|
protected:
|
2015-02-26 08:00:24 +08:00
|
|
|
std::pair<const TargetRegisterClass *, uint8_t>
|
|
|
|
findRepresentativeClass(const TargetRegisterInfo *TRI,
|
|
|
|
MVT VT) const override;
|
2010-07-27 05:50:05 +08:00
|
|
|
|
2005-11-15 08:40:23 +08:00
|
|
|
private:
|
2016-01-27 06:08:58 +08:00
|
|
|
/// Keep a reference to the X86Subtarget around so that we can
|
2006-04-26 04:13:52 +08:00
|
|
|
/// make the right decision when generating code for different targets.
|
2016-01-27 06:08:58 +08:00
|
|
|
const X86Subtarget &Subtarget;
|
2006-04-26 04:13:52 +08:00
|
|
|
|
2014-10-02 03:39:32 +08:00
|
|
|
/// Select between SSE or x87 floating point ops.
|
2007-09-23 22:52:20 +08:00
|
|
|
/// When SSE is available, use it for f32 operations.
|
|
|
|
/// When SSE2 is available, use it for f64 operations.
|
|
|
|
bool X86ScalarSSEf32;
|
|
|
|
bool X86ScalarSSEf64;
|
2008-01-30 03:34:22 +08:00
|
|
|
|
2014-10-02 03:39:32 +08:00
|
|
|
/// A list of legal FP immediates.
|
2009-10-28 03:56:55 +08:00
|
|
|
std::vector<APFloat> LegalFPImmediates;
|
|
|
|
|
2014-10-02 03:39:32 +08:00
|
|
|
/// Indicate that this x86 target can instruction
|
2009-10-28 03:56:55 +08:00
|
|
|
/// select the specified FP immediate natively.
|
|
|
|
void addLegalFPImmediate(const APFloat& Imm) {
|
|
|
|
LegalFPImmediates.push_back(Imm);
|
|
|
|
}
|
|
|
|
|
Major calling convention code refactoring.
Instead of awkwardly encoding calling-convention information with ISD::CALL,
ISD::FORMAL_ARGUMENTS, ISD::RET, and ISD::ARG_FLAGS nodes, TargetLowering
provides three virtual functions for targets to override:
LowerFormalArguments, LowerCall, and LowerRet, which replace the custom
lowering done on the special nodes. They provide the same information, but
in a more immediately usable format.
This also reworks much of the target-independent tail call logic. The
decision of whether or not to perform a tail call is now cleanly split
between target-independent portions, and the target dependent portion
in IsEligibleForTailCallOptimization.
This also synchronizes all in-tree targets, to help enable future
refactoring and feature work.
llvm-svn: 78142
2009-08-05 09:29:28 +08:00
|
|
|
SDValue LowerCallResult(SDValue Chain, SDValue InFlag,
|
2009-09-02 16:44:58 +08:00
|
|
|
CallingConv::ID CallConv, bool isVarArg,
|
Major calling convention code refactoring.
Instead of awkwardly encoding calling-convention information with ISD::CALL,
ISD::FORMAL_ARGUMENTS, ISD::RET, and ISD::ARG_FLAGS nodes, TargetLowering
provides three virtual functions for targets to override:
LowerFormalArguments, LowerCall, and LowerRet, which replace the custom
lowering done on the special nodes. They provide the same information, but
in a more immediately usable format.
This also reworks much of the target-independent tail call logic. The
decision of whether or not to perform a tail call is now cleanly split
between target-independent portions, and the target dependent portion
in IsEligibleForTailCallOptimization.
This also synchronizes all in-tree targets, to help enable future
refactoring and feature work.
llvm-svn: 78142
2009-08-05 09:29:28 +08:00
|
|
|
const SmallVectorImpl<ISD::InputArg> &Ins,
|
2016-06-12 23:39:02 +08:00
|
|
|
const SDLoc &dl, SelectionDAG &DAG,
|
2017-03-14 17:09:26 +08:00
|
|
|
SmallVectorImpl<SDValue> &InVals,
|
|
|
|
uint32_t *RegMask) const;
|
2016-06-12 23:39:02 +08:00
|
|
|
SDValue LowerMemArgument(SDValue Chain, CallingConv::ID CallConv,
|
Major calling convention code refactoring.
Instead of awkwardly encoding calling-convention information with ISD::CALL,
ISD::FORMAL_ARGUMENTS, ISD::RET, and ISD::ARG_FLAGS nodes, TargetLowering
provides three virtual functions for targets to override:
LowerFormalArguments, LowerCall, and LowerRet, which replace the custom
lowering done on the special nodes. They provide the same information, but
in a more immediately usable format.
This also reworks much of the target-independent tail call logic. The
decision of whether or not to perform a tail call is now cleanly split
between target-independent portions, and the target dependent portion
in IsEligibleForTailCallOptimization.
This also synchronizes all in-tree targets, to help enable future
refactoring and feature work.
llvm-svn: 78142
2009-08-05 09:29:28 +08:00
|
|
|
const SmallVectorImpl<ISD::InputArg> &ArgInfo,
|
2016-06-12 23:39:02 +08:00
|
|
|
const SDLoc &dl, SelectionDAG &DAG,
|
2016-07-29 02:40:00 +08:00
|
|
|
const CCValAssign &VA, MachineFrameInfo &MFI,
|
2016-06-12 23:39:02 +08:00
|
|
|
unsigned i) const;
|
Major calling convention code refactoring.
Instead of awkwardly encoding calling-convention information with ISD::CALL,
ISD::FORMAL_ARGUMENTS, ISD::RET, and ISD::ARG_FLAGS nodes, TargetLowering
provides three virtual functions for targets to override:
LowerFormalArguments, LowerCall, and LowerRet, which replace the custom
lowering done on the special nodes. They provide the same information, but
in a more immediately usable format.
This also reworks much of the target-independent tail call logic. The
decision of whether or not to perform a tail call is now cleanly split
between target-independent portions, and the target dependent portion
in IsEligibleForTailCallOptimization.
This also synchronizes all in-tree targets, to help enable future
refactoring and feature work.
llvm-svn: 78142
2009-08-05 09:29:28 +08:00
|
|
|
SDValue LowerMemOpCallTo(SDValue Chain, SDValue StackPtr, SDValue Arg,
|
2016-06-12 23:39:02 +08:00
|
|
|
const SDLoc &dl, SelectionDAG &DAG,
|
Major calling convention code refactoring.
Instead of awkwardly encoding calling-convention information with ISD::CALL,
ISD::FORMAL_ARGUMENTS, ISD::RET, and ISD::ARG_FLAGS nodes, TargetLowering
provides three virtual functions for targets to override:
LowerFormalArguments, LowerCall, and LowerRet, which replace the custom
lowering done on the special nodes. They provide the same information, but
in a more immediately usable format.
This also reworks much of the target-independent tail call logic. The
decision of whether or not to perform a tail call is now cleanly split
between target-independent portions, and the target dependent portion
in IsEligibleForTailCallOptimization.
This also synchronizes all in-tree targets, to help enable future
refactoring and feature work.
llvm-svn: 78142
2009-08-05 09:29:28 +08:00
|
|
|
const CCValAssign &VA,
|
2010-04-17 23:26:15 +08:00
|
|
|
ISD::ArgFlagsTy Flags) const;
|
2007-08-31 23:06:30 +08:00
|
|
|
|
2008-01-06 00:56:59 +08:00
|
|
|
// Call lowering helpers.
|
2010-01-27 08:07:07 +08:00
|
|
|
|
2014-10-02 03:39:32 +08:00
|
|
|
/// Check whether the call is eligible for tail call optimization. Targets
|
|
|
|
/// that want to do tail call optimization should implement this function.
|
2010-02-03 07:55:14 +08:00
|
|
|
bool IsEligibleForTailCallOptimization(SDValue Callee,
|
2010-01-27 08:07:07 +08:00
|
|
|
CallingConv::ID CalleeCC,
|
|
|
|
bool isVarArg,
|
2010-03-16 02:54:48 +08:00
|
|
|
bool isCalleeStructRet,
|
|
|
|
bool isCallerStructRet,
|
2012-09-25 13:32:34 +08:00
|
|
|
Type *RetTy,
|
2010-01-27 14:25:16 +08:00
|
|
|
const SmallVectorImpl<ISD::OutputArg> &Outs,
|
2010-07-07 23:54:55 +08:00
|
|
|
const SmallVectorImpl<SDValue> &OutVals,
|
2010-01-27 14:25:16 +08:00
|
|
|
const SmallVectorImpl<ISD::InputArg> &Ins,
|
2010-01-27 08:07:07 +08:00
|
|
|
SelectionDAG& DAG) const;
|
2008-07-28 05:46:04 +08:00
|
|
|
SDValue EmitTailCallLoadRetAddr(SelectionDAG &DAG, SDValue &OutRetAddr,
|
2016-06-12 23:39:02 +08:00
|
|
|
SDValue Chain, bool IsTailCall,
|
|
|
|
bool Is64Bit, int FPDiff,
|
|
|
|
const SDLoc &dl) const;
|
2008-04-13 02:11:06 +08:00
|
|
|
|
2010-04-17 23:26:15 +08:00
|
|
|
unsigned GetAlignedArgumentStackSize(unsigned StackSize,
|
|
|
|
SelectionDAG &DAG) const;
|
2006-01-27 16:10:46 +08:00
|
|
|
|
2016-02-23 05:06:46 +08:00
|
|
|
unsigned getAddressSpace(void) const;
|
|
|
|
|
2019-02-13 15:42:31 +08:00
|
|
|
SDValue FP_TO_INTHelper(SDValue Op, SelectionDAG &DAG, bool isSigned) const;
|
Optimize splat of a scalar load into a shuffle of a vector load when it's legal. e.g.
vector_shuffle (scalar_to_vector (i32 load (ptr + 4))), undef, <0, 0, 0, 0>
=>
vector_shuffle (v4i32 load ptr), undef, <1, 1, 1, 1>
iff ptr is 16-byte aligned (or can be made into 16-byte aligned).
llvm-svn: 90984
2009-12-10 05:00:30 +08:00
|
|
|
|
2010-04-17 23:26:15 +08:00
|
|
|
SDValue LowerBUILD_VECTOR(SDValue Op, SelectionDAG &DAG) const;
|
2014-05-17 06:47:43 +08:00
|
|
|
SDValue LowerVSELECT(SDValue Op, SelectionDAG &DAG) const;
|
2010-04-17 23:26:15 +08:00
|
|
|
SDValue LowerEXTRACT_VECTOR_ELT(SDValue Op, SelectionDAG &DAG) const;
|
|
|
|
SDValue LowerINSERT_VECTOR_ELT(SDValue Op, SelectionDAG &DAG) const;
|
2016-10-20 09:21:26 +08:00
|
|
|
|
2018-04-11 06:50:05 +08:00
|
|
|
unsigned getGlobalWrapperKind(const GlobalValue *GV = nullptr,
|
|
|
|
const unsigned char OpFlags = 0) const;
|
2010-04-17 23:26:15 +08:00
|
|
|
SDValue LowerConstantPool(SDValue Op, SelectionDAG &DAG) const;
|
|
|
|
SDValue LowerBlockAddress(SDValue Op, SelectionDAG &DAG) const;
|
|
|
|
SDValue LowerGlobalAddress(SDValue Op, SelectionDAG &DAG) const;
|
|
|
|
SDValue LowerGlobalTLSAddress(SDValue Op, SelectionDAG &DAG) const;
|
|
|
|
SDValue LowerExternalSymbol(SDValue Op, SelectionDAG &DAG) const;
|
2016-10-20 09:21:26 +08:00
|
|
|
|
2019-05-17 07:15:26 +08:00
|
|
|
/// Creates target global address or external symbol nodes for calls or
|
|
|
|
/// other uses.
|
|
|
|
SDValue LowerGlobalOrExternal(SDValue Op, SelectionDAG &DAG,
|
|
|
|
bool ForCall) const;
|
|
|
|
|
2010-04-17 23:26:15 +08:00
|
|
|
SDValue LowerSINT_TO_FP(SDValue Op, SelectionDAG &DAG) const;
|
|
|
|
SDValue LowerUINT_TO_FP(SDValue Op, SelectionDAG &DAG) const;
|
2013-01-21 05:34:37 +08:00
|
|
|
SDValue LowerTRUNCATE(SDValue Op, SelectionDAG &DAG) const;
|
2017-03-24 01:35:08 +08:00
|
|
|
SDValue LowerFP_TO_INT(SDValue Op, SelectionDAG &DAG) const;
|
2010-04-17 23:26:15 +08:00
|
|
|
SDValue LowerSETCC(SDValue Op, SelectionDAG &DAG) const;
|
2017-06-01 19:14:17 +08:00
|
|
|
SDValue LowerSETCCCARRY(SDValue Op, SelectionDAG &DAG) const;
|
2010-04-17 23:26:15 +08:00
|
|
|
SDValue LowerSELECT(SDValue Op, SelectionDAG &DAG) const;
|
|
|
|
SDValue LowerBRCOND(SDValue Op, SelectionDAG &DAG) const;
|
|
|
|
SDValue LowerJumpTable(SDValue Op, SelectionDAG &DAG) const;
|
|
|
|
SDValue LowerDYNAMIC_STACKALLOC(SDValue Op, SelectionDAG &DAG) const;
|
|
|
|
SDValue LowerVASTART(SDValue Op, SelectionDAG &DAG) const;
|
|
|
|
SDValue LowerVAARG(SDValue Op, SelectionDAG &DAG) const;
|
|
|
|
SDValue LowerRETURNADDR(SDValue Op, SelectionDAG &DAG) const;
|
2016-10-13 06:13:19 +08:00
|
|
|
SDValue LowerADDROFRETURNADDR(SDValue Op, SelectionDAG &DAG) const;
|
2010-04-17 23:26:15 +08:00
|
|
|
SDValue LowerFRAMEADDR(SDValue Op, SelectionDAG &DAG) const;
|
|
|
|
SDValue LowerFRAME_TO_ARGS_OFFSET(SDValue Op, SelectionDAG &DAG) const;
|
|
|
|
SDValue LowerEH_RETURN(SDValue Op, SelectionDAG &DAG) const;
|
2012-10-16 06:39:43 +08:00
|
|
|
SDValue lowerEH_SJLJ_SETJMP(SDValue Op, SelectionDAG &DAG) const;
|
|
|
|
SDValue lowerEH_SJLJ_LONGJMP(SDValue Op, SelectionDAG &DAG) const;
|
2016-05-31 09:48:07 +08:00
|
|
|
SDValue lowerEH_SJLJ_SETUP_DISPATCH(SDValue Op, SelectionDAG &DAG) const;
|
2011-09-06 21:37:06 +08:00
|
|
|
SDValue LowerINIT_TRAMPOLINE(SDValue Op, SelectionDAG &DAG) const;
|
2010-04-17 23:26:15 +08:00
|
|
|
SDValue LowerFLT_ROUNDS_(SDValue Op, SelectionDAG &DAG) const;
|
2014-05-06 09:20:42 +08:00
|
|
|
SDValue LowerWin64_i128OP(SDValue Op, SelectionDAG &DAG) const;
|
Extend the statepoint intrinsic to allow statepoints to be marked as transitions from GC-aware code to code that is not GC-aware.
This changes the shape of the statepoint intrinsic from:
@llvm.experimental.gc.statepoint(anyptr target, i32 # call args, i32 unused, ...call args, i32 # deopt args, ...deopt args, ...gc args)
to:
@llvm.experimental.gc.statepoint(anyptr target, i32 # call args, i32 flags, ...call args, i32 # transition args, ...transition args, i32 # deopt args, ...deopt args, ...gc args)
This extension offers the backend the opportunity to insert (somewhat) arbitrary code to manage the transition from GC-aware code to code that is not GC-aware and back.
In order to support the injection of transition code, this extension wraps the STATEPOINT ISD node generated by the usual lowering lowering with two additional nodes: GC_TRANSITION_START and GC_TRANSITION_END. The transition arguments that were passed passed to the intrinsic (if any) are lowered and provided as operands to these nodes and may be used by the backend during code generation.
Eventually, the lowering of the GC_TRANSITION_{START,END} nodes should be informed by the GC strategy in use for the function containing the intrinsic call; for now, these nodes are instead replaced with no-ops.
Differential Revision: http://reviews.llvm.org/D9501
llvm-svn: 236888
2015-05-09 02:07:42 +08:00
|
|
|
SDValue LowerGC_TRANSITION_START(SDValue Op, SelectionDAG &DAG) const;
|
|
|
|
SDValue LowerGC_TRANSITION_END(SDValue Op, SelectionDAG &DAG) const;
|
2017-10-03 14:29:58 +08:00
|
|
|
SDValue LowerINTRINSIC_WO_CHAIN(SDValue Op, SelectionDAG &DAG) const;
|
2008-12-01 19:39:25 +08:00
|
|
|
|
2014-03-09 15:44:38 +08:00
|
|
|
SDValue
|
2016-06-12 23:39:02 +08:00
|
|
|
LowerFormalArguments(SDValue Chain, CallingConv::ID CallConv, bool isVarArg,
|
|
|
|
const SmallVectorImpl<ISD::InputArg> &Ins,
|
|
|
|
const SDLoc &dl, SelectionDAG &DAG,
|
|
|
|
SmallVectorImpl<SDValue> &InVals) const override;
|
2014-03-09 15:44:38 +08:00
|
|
|
SDValue LowerCall(CallLoweringInfo &CLI,
|
|
|
|
SmallVectorImpl<SDValue> &InVals) const override;
|
Major calling convention code refactoring.
Instead of awkwardly encoding calling-convention information with ISD::CALL,
ISD::FORMAL_ARGUMENTS, ISD::RET, and ISD::ARG_FLAGS nodes, TargetLowering
provides three virtual functions for targets to override:
LowerFormalArguments, LowerCall, and LowerRet, which replace the custom
lowering done on the special nodes. They provide the same information, but
in a more immediately usable format.
This also reworks much of the target-independent tail call logic. The
decision of whether or not to perform a tail call is now cleanly split
between target-independent portions, and the target dependent portion
in IsEligibleForTailCallOptimization.
This also synchronizes all in-tree targets, to help enable future
refactoring and feature work.
llvm-svn: 78142
2009-08-05 09:29:28 +08:00
|
|
|
|
2016-06-12 23:39:02 +08:00
|
|
|
SDValue LowerReturn(SDValue Chain, CallingConv::ID CallConv, bool isVarArg,
|
2014-03-09 15:44:38 +08:00
|
|
|
const SmallVectorImpl<ISD::OutputArg> &Outs,
|
|
|
|
const SmallVectorImpl<SDValue> &OutVals,
|
2016-06-12 23:39:02 +08:00
|
|
|
const SDLoc &dl, SelectionDAG &DAG) const override;
|
Major calling convention code refactoring.
Instead of awkwardly encoding calling-convention information with ISD::CALL,
ISD::FORMAL_ARGUMENTS, ISD::RET, and ISD::ARG_FLAGS nodes, TargetLowering
provides three virtual functions for targets to override:
LowerFormalArguments, LowerCall, and LowerRet, which replace the custom
lowering done on the special nodes. They provide the same information, but
in a more immediately usable format.
This also reworks much of the target-independent tail call logic. The
decision of whether or not to perform a tail call is now cleanly split
between target-independent portions, and the target dependent portion
in IsEligibleForTailCallOptimization.
This also synchronizes all in-tree targets, to help enable future
refactoring and feature work.
llvm-svn: 78142
2009-08-05 09:29:28 +08:00
|
|
|
|
2016-01-12 09:08:46 +08:00
|
|
|
bool supportSplitCSR(MachineFunction *MF) const override {
|
2017-12-16 06:22:58 +08:00
|
|
|
return MF->getFunction().getCallingConv() == CallingConv::CXX_FAST_TLS &&
|
|
|
|
MF->getFunction().hasFnAttribute(Attribute::NoUnwind);
|
2016-01-12 09:08:46 +08:00
|
|
|
}
|
|
|
|
void initializeSplitCSR(MachineBasicBlock *Entry) const override;
|
|
|
|
void insertCopiesSplitCSR(
|
|
|
|
MachineBasicBlock *Entry,
|
|
|
|
const SmallVectorImpl<MachineBasicBlock *> &Exits) const override;
|
|
|
|
|
2014-03-09 15:44:38 +08:00
|
|
|
bool isUsedByReturnOnly(SDNode *N, SDValue &Chain) const override;
|
2010-12-01 07:55:39 +08:00
|
|
|
|
2017-04-19 05:16:46 +08:00
|
|
|
bool mayBeEmittedAsTailCall(const CallInst *CI) const override;
|
2011-03-21 09:19:09 +08:00
|
|
|
|
2016-02-09 03:34:30 +08:00
|
|
|
EVT getTypeForExtReturn(LLVMContext &Context, EVT VT,
|
|
|
|
ISD::NodeType ExtendKind) const override;
|
2011-03-17 06:20:18 +08:00
|
|
|
|
2014-03-09 15:44:38 +08:00
|
|
|
bool CanLowerReturn(CallingConv::ID CallConv, MachineFunction &MF,
|
|
|
|
bool isVarArg,
|
|
|
|
const SmallVectorImpl<ISD::OutputArg> &Outs,
|
|
|
|
LLVMContext &Context) const override;
|
2009-11-07 10:11:54 +08:00
|
|
|
|
2014-04-04 13:16:06 +08:00
|
|
|
const MCPhysReg *getScratchRegisters(CallingConv::ID CC) const override;
|
2013-11-09 09:51:33 +08:00
|
|
|
|
2015-09-12 01:08:28 +08:00
|
|
|
TargetLoweringBase::AtomicExpansionKind
|
|
|
|
shouldExpandAtomicLoadInIR(LoadInst *SI) const override;
|
2014-09-17 08:06:58 +08:00
|
|
|
bool shouldExpandAtomicStoreInIR(StoreInst *SI) const override;
|
2015-09-12 01:08:17 +08:00
|
|
|
TargetLoweringBase::AtomicExpansionKind
|
Mutate TargetLowering::shouldExpandAtomicRMWInIR to specifically dictate how AtomicRMWInsts are expanded.
Summary:
In PNaCl, most atomic instructions have their own @llvm.nacl.atomic.* function, each one, with a few exceptions, represents a consistent behaviour across all NaCl-supported targets. Unfortunately, the atomic RMW operations nand, [u]min, and [u]max aren't directly represented by any such @llvm.nacl.atomic.* function. This patch refines shouldExpandAtomicRMWInIR in TargetLowering so that a future `Le32TargetLowering` class can selectively inform the caller how the target desires the atomic RMW instruction to be expanded (ie via load-linked/store-conditional for ARM/AArch64, via cmpxchg for X86/others?, or not at all for Mips) if at all.
This does not represent a behavioural change and as such no tests were added.
Patch by: Richard Diamond.
Reviewers: jfb
Reviewed By: jfb
Subscribers: jfb, aemerson, t.p.northover, llvm-commits
Differential Revision: http://reviews.llvm.org/D7713
llvm-svn: 231250
2015-03-04 23:47:57 +08:00
|
|
|
shouldExpandAtomicRMWInIR(AtomicRMWInst *AI) const override;
|
2014-09-17 08:06:58 +08:00
|
|
|
|
2014-09-26 01:27:43 +08:00
|
|
|
LoadInst *
|
|
|
|
lowerIdempotentRMWIntoFencedLoad(AtomicRMWInst *AI) const override;
|
|
|
|
|
2015-08-02 06:20:21 +08:00
|
|
|
bool needsCmpXchgNb(Type *MemType) const;
|
2014-09-17 08:06:58 +08:00
|
|
|
|
2016-07-01 06:52:52 +08:00
|
|
|
void SetupEntryBlockForSjLj(MachineInstr &MI, MachineBasicBlock *MBB,
|
2016-05-31 09:48:07 +08:00
|
|
|
MachineBasicBlock *DispatchBB, int FI) const;
|
|
|
|
|
2010-10-13 02:00:49 +08:00
|
|
|
// Utility function to emit the low-level va_arg code for X86-64.
|
2016-07-01 06:52:52 +08:00
|
|
|
MachineBasicBlock *
|
|
|
|
EmitVAARG64WithCustomInserter(MachineInstr &MI,
|
|
|
|
MachineBasicBlock *MBB) const;
|
2010-10-13 02:00:49 +08:00
|
|
|
|
2009-08-15 09:38:56 +08:00
|
|
|
/// Utility function to emit the xmm reg save portion of va_start.
|
2016-07-01 06:52:52 +08:00
|
|
|
MachineBasicBlock *
|
|
|
|
EmitVAStartSaveXMMRegsWithCustomInserter(MachineInstr &BInstr,
|
|
|
|
MachineBasicBlock *BB) const;
|
2009-08-15 09:38:56 +08:00
|
|
|
|
2017-08-17 20:12:30 +08:00
|
|
|
MachineBasicBlock *EmitLoweredCascadedSelect(MachineInstr &MI1,
|
|
|
|
MachineInstr &MI2,
|
|
|
|
MachineBasicBlock *BB) const;
|
|
|
|
|
2016-07-01 06:52:52 +08:00
|
|
|
MachineBasicBlock *EmitLoweredSelect(MachineInstr &I,
|
2010-05-01 08:01:06 +08:00
|
|
|
MachineBasicBlock *BB) const;
|
2010-03-07 03:32:29 +08:00
|
|
|
|
2016-07-01 06:52:52 +08:00
|
|
|
MachineBasicBlock *EmitLoweredAtomicFP(MachineInstr &I,
|
2015-08-06 05:04:59 +08:00
|
|
|
MachineBasicBlock *BB) const;
|
|
|
|
|
2016-07-01 06:52:52 +08:00
|
|
|
MachineBasicBlock *EmitLoweredCatchRet(MachineInstr &MI,
|
2015-11-06 09:49:05 +08:00
|
|
|
MachineBasicBlock *BB) const;
|
2015-11-10 07:07:48 +08:00
|
|
|
|
2016-07-01 06:52:52 +08:00
|
|
|
MachineBasicBlock *EmitLoweredCatchPad(MachineInstr &MI,
|
2015-11-10 07:07:48 +08:00
|
|
|
MachineBasicBlock *BB) const;
|
2010-10-21 07:40:27 +08:00
|
|
|
|
2016-07-01 06:52:52 +08:00
|
|
|
MachineBasicBlock *EmitLoweredSegAlloca(MachineInstr &MI,
|
2014-09-22 21:11:35 +08:00
|
|
|
MachineBasicBlock *BB) const;
|
2011-08-31 03:47:04 +08:00
|
|
|
|
2016-07-01 06:52:52 +08:00
|
|
|
MachineBasicBlock *EmitLoweredTLSAddr(MachineInstr &MI,
|
2016-02-20 08:44:47 +08:00
|
|
|
MachineBasicBlock *BB) const;
|
|
|
|
|
2016-07-01 06:52:52 +08:00
|
|
|
MachineBasicBlock *EmitLoweredTLSCall(MachineInstr &MI,
|
2010-06-03 12:07:48 +08:00
|
|
|
MachineBasicBlock *BB) const;
|
2010-03-07 03:32:29 +08:00
|
|
|
|
Introduce the "retpoline" x86 mitigation technique for variant #2 of the speculative execution vulnerabilities disclosed today, specifically identified by CVE-2017-5715, "Branch Target Injection", and is one of the two halves to Spectre..
Summary:
First, we need to explain the core of the vulnerability. Note that this
is a very incomplete description, please see the Project Zero blog post
for details:
https://googleprojectzero.blogspot.com/2018/01/reading-privileged-memory-with-side.html
The basis for branch target injection is to direct speculative execution
of the processor to some "gadget" of executable code by poisoning the
prediction of indirect branches with the address of that gadget. The
gadget in turn contains an operation that provides a side channel for
reading data. Most commonly, this will look like a load of secret data
followed by a branch on the loaded value and then a load of some
predictable cache line. The attacker then uses timing of the processors
cache to determine which direction the branch took *in the speculative
execution*, and in turn what one bit of the loaded value was. Due to the
nature of these timing side channels and the branch predictor on Intel
processors, this allows an attacker to leak data only accessible to
a privileged domain (like the kernel) back into an unprivileged domain.
The goal is simple: avoid generating code which contains an indirect
branch that could have its prediction poisoned by an attacker. In many
cases, the compiler can simply use directed conditional branches and
a small search tree. LLVM already has support for lowering switches in
this way and the first step of this patch is to disable jump-table
lowering of switches and introduce a pass to rewrite explicit indirectbr
sequences into a switch over integers.
However, there is no fully general alternative to indirect calls. We
introduce a new construct we call a "retpoline" to implement indirect
calls in a non-speculatable way. It can be thought of loosely as
a trampoline for indirect calls which uses the RET instruction on x86.
Further, we arrange for a specific call->ret sequence which ensures the
processor predicts the return to go to a controlled, known location. The
retpoline then "smashes" the return address pushed onto the stack by the
call with the desired target of the original indirect call. The result
is a predicted return to the next instruction after a call (which can be
used to trap speculative execution within an infinite loop) and an
actual indirect branch to an arbitrary address.
On 64-bit x86 ABIs, this is especially easily done in the compiler by
using a guaranteed scratch register to pass the target into this device.
For 32-bit ABIs there isn't a guaranteed scratch register and so several
different retpoline variants are introduced to use a scratch register if
one is available in the calling convention and to otherwise use direct
stack push/pop sequences to pass the target address.
This "retpoline" mitigation is fully described in the following blog
post: https://support.google.com/faqs/answer/7625886
We also support a target feature that disables emission of the retpoline
thunk by the compiler to allow for custom thunks if users want them.
These are particularly useful in environments like kernels that
routinely do hot-patching on boot and want to hot-patch their thunk to
different code sequences. They can write this custom thunk and use
`-mretpoline-external-thunk` *in addition* to `-mretpoline`. In this
case, on x86-64 thu thunk names must be:
```
__llvm_external_retpoline_r11
```
or on 32-bit:
```
__llvm_external_retpoline_eax
__llvm_external_retpoline_ecx
__llvm_external_retpoline_edx
__llvm_external_retpoline_push
```
And the target of the retpoline is passed in the named register, or in
the case of the `push` suffix on the top of the stack via a `pushl`
instruction.
There is one other important source of indirect branches in x86 ELF
binaries: the PLT. These patches also include support for LLD to
generate PLT entries that perform a retpoline-style indirection.
The only other indirect branches remaining that we are aware of are from
precompiled runtimes (such as crt0.o and similar). The ones we have
found are not really attackable, and so we have not focused on them
here, but eventually these runtimes should also be replicated for
retpoline-ed configurations for completeness.
For kernels or other freestanding or fully static executables, the
compiler switch `-mretpoline` is sufficient to fully mitigate this
particular attack. For dynamic executables, you must compile *all*
libraries with `-mretpoline` and additionally link the dynamic
executable and all shared libraries with LLD and pass `-z retpolineplt`
(or use similar functionality from some other linker). We strongly
recommend also using `-z now` as non-lazy binding allows the
retpoline-mitigated PLT to be substantially smaller.
When manually apply similar transformations to `-mretpoline` to the
Linux kernel we observed very small performance hits to applications
running typical workloads, and relatively minor hits (approximately 2%)
even for extremely syscall-heavy applications. This is largely due to
the small number of indirect branches that occur in performance
sensitive paths of the kernel.
When using these patches on statically linked applications, especially
C++ applications, you should expect to see a much more dramatic
performance hit. For microbenchmarks that are switch, indirect-, or
virtual-call heavy we have seen overheads ranging from 10% to 50%.
However, real-world workloads exhibit substantially lower performance
impact. Notably, techniques such as PGO and ThinLTO dramatically reduce
the impact of hot indirect calls (by speculatively promoting them to
direct calls) and allow optimized search trees to be used to lower
switches. If you need to deploy these techniques in C++ applications, we
*strongly* recommend that you ensure all hot call targets are statically
linked (avoiding PLT indirection) and use both PGO and ThinLTO. Well
tuned servers using all of these techniques saw 5% - 10% overhead from
the use of retpoline.
We will add detailed documentation covering these components in
subsequent patches, but wanted to make the core functionality available
as soon as possible. Happy for more code review, but we'd really like to
get these patches landed and backported ASAP for obvious reasons. We're
planning to backport this to both 6.0 and 5.0 release streams and get
a 5.0 release with just this cherry picked ASAP for distros and vendors.
This patch is the work of a number of people over the past month: Eric, Reid,
Rui, and myself. I'm mailing it out as a single commit due to the time
sensitive nature of landing this and the need to backport it. Huge thanks to
everyone who helped out here, and everyone at Intel who helped out in
discussions about how to craft this. Also, credit goes to Paul Turner (at
Google, but not an LLVM contributor) for much of the underlying retpoline
design.
Reviewers: echristo, rnk, ruiu, craig.topper, DavidKreitzer
Subscribers: sanjoy, emaste, mcrosier, mgorny, mehdi_amini, hiraditya, llvm-commits
Differential Revision: https://reviews.llvm.org/D41723
llvm-svn: 323155
2018-01-23 06:05:25 +08:00
|
|
|
MachineBasicBlock *EmitLoweredRetpoline(MachineInstr &MI,
|
|
|
|
MachineBasicBlock *BB) const;
|
|
|
|
|
2016-07-01 06:52:52 +08:00
|
|
|
MachineBasicBlock *emitEHSjLjSetJmp(MachineInstr &MI,
|
2012-10-16 06:39:43 +08:00
|
|
|
MachineBasicBlock *MBB) const;
|
|
|
|
|
2018-06-05 17:22:30 +08:00
|
|
|
void emitSetJmpShadowStackFix(MachineInstr &MI,
|
|
|
|
MachineBasicBlock *MBB) const;
|
|
|
|
|
2016-07-01 06:52:52 +08:00
|
|
|
MachineBasicBlock *emitEHSjLjLongJmp(MachineInstr &MI,
|
2012-10-16 06:39:43 +08:00
|
|
|
MachineBasicBlock *MBB) const;
|
|
|
|
|
2018-06-05 17:22:30 +08:00
|
|
|
MachineBasicBlock *emitLongJmpShadowStackFix(MachineInstr &MI,
|
|
|
|
MachineBasicBlock *MBB) const;
|
|
|
|
|
2016-07-01 06:52:52 +08:00
|
|
|
MachineBasicBlock *emitFMA3Instr(MachineInstr &MI,
|
2014-01-24 04:23:36 +08:00
|
|
|
MachineBasicBlock *MBB) const;
|
|
|
|
|
2016-07-01 06:52:52 +08:00
|
|
|
MachineBasicBlock *EmitSjLjDispatchBlock(MachineInstr &MI,
|
2016-05-31 09:48:07 +08:00
|
|
|
MachineBasicBlock *MBB) const;
|
|
|
|
|
2009-03-05 03:44:21 +08:00
|
|
|
/// Emit nodes that will be selected as "cmp Op0,Op1", or something
|
2014-06-10 18:50:11 +08:00
|
|
|
/// equivalent, for use with the given x86 condition code.
|
2016-06-12 23:39:02 +08:00
|
|
|
SDValue EmitCmp(SDValue Op0, SDValue Op1, unsigned X86CC, const SDLoc &dl,
|
2014-06-10 18:50:11 +08:00
|
|
|
SelectionDAG &DAG) const;
|
2012-04-27 20:07:43 +08:00
|
|
|
|
|
|
|
/// Convert a comparison if required by the subtarget.
|
|
|
|
SDValue ConvertCmpIfNecessary(SDValue Cmp, SelectionDAG &DAG) const;
|
2014-10-25 01:02:16 +08:00
|
|
|
|
2018-12-27 09:50:40 +08:00
|
|
|
/// Emit flags for the given setcc condition and operands. Also returns the
|
|
|
|
/// corresponding X86 condition code constant in X86CC.
|
|
|
|
SDValue emitFlagsForSetcc(SDValue Op0, SDValue Op1,
|
|
|
|
ISD::CondCode CC, const SDLoc &dl,
|
|
|
|
SelectionDAG &DAG,
|
|
|
|
SDValue &X86CC) const;
|
|
|
|
|
2016-08-04 20:47:28 +08:00
|
|
|
/// Check if replacement of SQRT with RSQRT should be disabled.
|
|
|
|
bool isFsqrtCheap(SDValue Operand, SelectionDAG &DAG) const override;
|
|
|
|
|
2014-10-25 01:02:16 +08:00
|
|
|
/// Use rsqrt* to speed up sqrt calculations.
|
2016-11-11 07:31:06 +08:00
|
|
|
SDValue getSqrtEstimate(SDValue Operand, SelectionDAG &DAG, int Enabled,
|
|
|
|
int &RefinementSteps, bool &UseOneConstNR,
|
|
|
|
bool Reciprocal) const override;
|
2014-11-12 04:51:00 +08:00
|
|
|
|
|
|
|
/// Use rcp* to speed up fdiv calculations.
|
2016-10-21 00:55:45 +08:00
|
|
|
SDValue getRecipEstimate(SDValue Operand, SelectionDAG &DAG, int Enabled,
|
|
|
|
int &RefinementSteps) const override;
|
[x86] Implement combineRepeatedFPDivisors
Set the transform bar at 2 divisions because the fastest current
x86 FP divider circuit is in SandyBridge / Haswell at 10 cycle
latency (best case) relative to a 5 cycle multiplier.
So that's the worst case for this transform (no latency win),
but multiplies are obviously pipelined while divisions are not,
so there's still a big throughput win which we would expect to
show up in typical FP code.
These are the sequences I'm comparing:
divss %xmm2, %xmm0
mulss %xmm1, %xmm0
divss %xmm2, %xmm0
Becomes:
movss LCPI0_0(%rip), %xmm3 ## xmm3 = mem[0],zero,zero,zero
divss %xmm2, %xmm3
mulss %xmm3, %xmm0
mulss %xmm1, %xmm0
mulss %xmm3, %xmm0
[Ignore for the moment that we don't optimize the chain of 3 multiplies
into 2 independent fmuls followed by 1 dependent fmul...this is the DAG
version of: https://llvm.org/bugs/show_bug.cgi?id=21768 ...if we fix that,
then the transform becomes even more profitable on all targets.]
Differential Revision: http://reviews.llvm.org/D8941
llvm-svn: 235012
2015-04-15 23:22:55 +08:00
|
|
|
|
|
|
|
/// Reassociate floating point divisions into multiply by reciprocal.
|
2015-07-29 07:05:48 +08:00
|
|
|
unsigned combineRepeatedFPDivisors() const override;
|
2005-11-15 08:40:23 +08:00
|
|
|
};
|
2008-09-03 08:03:49 +08:00
|
|
|
|
|
|
|
namespace X86 {
|
2012-08-03 12:06:28 +08:00
|
|
|
FastISel *createFastISel(FunctionLoweringInfo &funcInfo,
|
|
|
|
const TargetLibraryInfo *libInfo);
|
2016-01-27 02:48:36 +08:00
|
|
|
} // end namespace X86
|
2016-12-21 18:43:36 +08:00
|
|
|
|
|
|
|
// Base class for all X86 non-masked store operations.
|
|
|
|
class X86StoreSDNode : public MemSDNode {
|
|
|
|
public:
|
|
|
|
X86StoreSDNode(unsigned Opcode, unsigned Order, const DebugLoc &dl,
|
|
|
|
SDVTList VTs, EVT MemVT,
|
|
|
|
MachineMemOperand *MMO)
|
|
|
|
:MemSDNode(Opcode, Order, dl, VTs, MemVT, MMO) {}
|
|
|
|
const SDValue &getValue() const { return getOperand(1); }
|
|
|
|
const SDValue &getBasePtr() const { return getOperand(2); }
|
|
|
|
|
|
|
|
static bool classof(const SDNode *N) {
|
|
|
|
return N->getOpcode() == X86ISD::VTRUNCSTORES ||
|
|
|
|
N->getOpcode() == X86ISD::VTRUNCSTOREUS;
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
// Base class for all X86 masked store operations.
|
|
|
|
// The class has the same order of operands as MaskedStoreSDNode for
|
|
|
|
// convenience.
|
|
|
|
class X86MaskedStoreSDNode : public MemSDNode {
|
|
|
|
public:
|
|
|
|
X86MaskedStoreSDNode(unsigned Opcode, unsigned Order,
|
|
|
|
const DebugLoc &dl, SDVTList VTs, EVT MemVT,
|
|
|
|
MachineMemOperand *MMO)
|
|
|
|
: MemSDNode(Opcode, Order, dl, VTs, MemVT, MMO) {}
|
|
|
|
|
2018-08-26 01:48:17 +08:00
|
|
|
const SDValue &getValue() const { return getOperand(1); }
|
|
|
|
const SDValue &getBasePtr() const { return getOperand(2); }
|
|
|
|
const SDValue &getMask() const { return getOperand(3); }
|
2016-12-21 18:43:36 +08:00
|
|
|
|
|
|
|
static bool classof(const SDNode *N) {
|
|
|
|
return N->getOpcode() == X86ISD::VMTRUNCSTORES ||
|
|
|
|
N->getOpcode() == X86ISD::VMTRUNCSTOREUS;
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
// X86 Truncating Store with Signed saturation.
|
|
|
|
class TruncSStoreSDNode : public X86StoreSDNode {
|
|
|
|
public:
|
|
|
|
TruncSStoreSDNode(unsigned Order, const DebugLoc &dl,
|
|
|
|
SDVTList VTs, EVT MemVT, MachineMemOperand *MMO)
|
|
|
|
: X86StoreSDNode(X86ISD::VTRUNCSTORES, Order, dl, VTs, MemVT, MMO) {}
|
|
|
|
|
|
|
|
static bool classof(const SDNode *N) {
|
|
|
|
return N->getOpcode() == X86ISD::VTRUNCSTORES;
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
// X86 Truncating Store with Unsigned saturation.
|
|
|
|
class TruncUSStoreSDNode : public X86StoreSDNode {
|
|
|
|
public:
|
|
|
|
TruncUSStoreSDNode(unsigned Order, const DebugLoc &dl,
|
|
|
|
SDVTList VTs, EVT MemVT, MachineMemOperand *MMO)
|
|
|
|
: X86StoreSDNode(X86ISD::VTRUNCSTOREUS, Order, dl, VTs, MemVT, MMO) {}
|
|
|
|
|
|
|
|
static bool classof(const SDNode *N) {
|
|
|
|
return N->getOpcode() == X86ISD::VTRUNCSTOREUS;
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
// X86 Truncating Masked Store with Signed saturation.
|
|
|
|
class MaskedTruncSStoreSDNode : public X86MaskedStoreSDNode {
|
|
|
|
public:
|
|
|
|
MaskedTruncSStoreSDNode(unsigned Order,
|
|
|
|
const DebugLoc &dl, SDVTList VTs, EVT MemVT,
|
|
|
|
MachineMemOperand *MMO)
|
|
|
|
: X86MaskedStoreSDNode(X86ISD::VMTRUNCSTORES, Order, dl, VTs, MemVT, MMO) {}
|
|
|
|
|
|
|
|
static bool classof(const SDNode *N) {
|
|
|
|
return N->getOpcode() == X86ISD::VMTRUNCSTORES;
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
// X86 Truncating Masked Store with Unsigned saturation.
|
|
|
|
class MaskedTruncUSStoreSDNode : public X86MaskedStoreSDNode {
|
|
|
|
public:
|
|
|
|
MaskedTruncUSStoreSDNode(unsigned Order,
|
|
|
|
const DebugLoc &dl, SDVTList VTs, EVT MemVT,
|
|
|
|
MachineMemOperand *MMO)
|
|
|
|
: X86MaskedStoreSDNode(X86ISD::VMTRUNCSTOREUS, Order, dl, VTs, MemVT, MMO) {}
|
|
|
|
|
|
|
|
static bool classof(const SDNode *N) {
|
|
|
|
return N->getOpcode() == X86ISD::VMTRUNCSTOREUS;
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
2017-11-22 16:10:54 +08:00
|
|
|
// X86 specific Gather/Scatter nodes.
|
|
|
|
// The class has the same order of operands as MaskedGatherScatterSDNode for
|
2017-11-09 06:26:41 +08:00
|
|
|
// convenience.
|
2017-11-22 16:10:54 +08:00
|
|
|
class X86MaskedGatherScatterSDNode : public MemSDNode {
|
2017-06-22 14:47:41 +08:00
|
|
|
public:
|
2017-11-22 16:10:54 +08:00
|
|
|
X86MaskedGatherScatterSDNode(unsigned Opc, unsigned Order,
|
|
|
|
const DebugLoc &dl, SDVTList VTs, EVT MemVT,
|
|
|
|
MachineMemOperand *MMO)
|
|
|
|
: MemSDNode(Opc, Order, dl, VTs, MemVT, MMO) {}
|
2017-11-09 06:26:41 +08:00
|
|
|
|
|
|
|
const SDValue &getBasePtr() const { return getOperand(3); }
|
|
|
|
const SDValue &getIndex() const { return getOperand(4); }
|
|
|
|
const SDValue &getMask() const { return getOperand(2); }
|
2018-01-11 03:16:05 +08:00
|
|
|
const SDValue &getScale() const { return getOperand(5); }
|
2017-11-09 06:26:41 +08:00
|
|
|
|
2017-11-22 16:10:54 +08:00
|
|
|
static bool classof(const SDNode *N) {
|
|
|
|
return N->getOpcode() == X86ISD::MGATHER ||
|
|
|
|
N->getOpcode() == X86ISD::MSCATTER;
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
class X86MaskedGatherSDNode : public X86MaskedGatherScatterSDNode {
|
|
|
|
public:
|
|
|
|
X86MaskedGatherSDNode(unsigned Order, const DebugLoc &dl, SDVTList VTs,
|
|
|
|
EVT MemVT, MachineMemOperand *MMO)
|
|
|
|
: X86MaskedGatherScatterSDNode(X86ISD::MGATHER, Order, dl, VTs, MemVT,
|
|
|
|
MMO) {}
|
|
|
|
|
2018-08-07 14:13:40 +08:00
|
|
|
const SDValue &getPassThru() const { return getOperand(1); }
|
|
|
|
|
2017-06-22 14:47:41 +08:00
|
|
|
static bool classof(const SDNode *N) {
|
|
|
|
return N->getOpcode() == X86ISD::MGATHER;
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
2017-11-22 16:10:54 +08:00
|
|
|
class X86MaskedScatterSDNode : public X86MaskedGatherScatterSDNode {
|
|
|
|
public:
|
|
|
|
X86MaskedScatterSDNode(unsigned Order, const DebugLoc &dl, SDVTList VTs,
|
|
|
|
EVT MemVT, MachineMemOperand *MMO)
|
|
|
|
: X86MaskedGatherScatterSDNode(X86ISD::MSCATTER, Order, dl, VTs, MemVT,
|
|
|
|
MMO) {}
|
|
|
|
|
2018-08-07 14:13:40 +08:00
|
|
|
const SDValue &getValue() const { return getOperand(1); }
|
|
|
|
|
2017-11-22 16:10:54 +08:00
|
|
|
static bool classof(const SDNode *N) {
|
|
|
|
return N->getOpcode() == X86ISD::MSCATTER;
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
2017-07-26 15:45:02 +08:00
|
|
|
/// Generate unpacklo/unpackhi shuffle mask.
|
|
|
|
template <typename T = int>
|
|
|
|
void createUnpackShuffleMask(MVT VT, SmallVectorImpl<T> &Mask, bool Lo,
|
|
|
|
bool Unary) {
|
|
|
|
assert(Mask.empty() && "Expected an empty shuffle mask vector");
|
|
|
|
int NumElts = VT.getVectorNumElements();
|
|
|
|
int NumEltsInLane = 128 / VT.getScalarSizeInBits();
|
|
|
|
for (int i = 0; i < NumElts; ++i) {
|
|
|
|
unsigned LaneStart = (i / NumEltsInLane) * NumEltsInLane;
|
|
|
|
int Pos = (i % NumEltsInLane) / 2 + LaneStart;
|
|
|
|
Pos += (Unary ? 0 : NumElts * (i % 2));
|
|
|
|
Pos += (Lo ? 0 : NumEltsInLane / 2);
|
|
|
|
Mask.push_back(Pos);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/// Helper function to scale a shuffle or target shuffle mask, replacing each
|
|
|
|
/// mask index with the scaled sequential indices for an equivalent narrowed
|
|
|
|
/// mask. This is the reverse process to canWidenShuffleElements, but can
|
|
|
|
/// always succeed.
|
|
|
|
template <typename T>
|
|
|
|
void scaleShuffleMask(int Scale, ArrayRef<T> Mask,
|
|
|
|
SmallVectorImpl<T> &ScaledMask) {
|
|
|
|
assert(0 < Scale && "Unexpected scaling factor");
|
2019-04-30 02:32:06 +08:00
|
|
|
size_t NumElts = Mask.size();
|
|
|
|
ScaledMask.assign(NumElts * Scale, -1);
|
2017-07-26 15:45:02 +08:00
|
|
|
|
2019-04-30 02:32:06 +08:00
|
|
|
for (int i = 0; i != (int)NumElts; ++i) {
|
2017-07-26 15:45:02 +08:00
|
|
|
int M = Mask[i];
|
|
|
|
|
|
|
|
// Repeat sentinel values in every mask element.
|
|
|
|
if (M < 0) {
|
|
|
|
for (int s = 0; s != Scale; ++s)
|
|
|
|
ScaledMask[(Scale * i) + s] = M;
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Scale mask element and increment across each mask element.
|
|
|
|
for (int s = 0; s != Scale; ++s)
|
|
|
|
ScaledMask[(Scale * i) + s] = (Scale * M) + s;
|
|
|
|
}
|
|
|
|
}
|
2016-01-27 02:48:36 +08:00
|
|
|
} // end namespace llvm
|
2005-11-15 08:40:23 +08:00
|
|
|
|
2016-01-27 02:48:36 +08:00
|
|
|
#endif // LLVM_LIB_TARGET_X86_X86ISELLOWERING_H
|