2005-11-15 00:40:23 +00:00
|
|
|
//===-- X86ISelLowering.h - X86 DAG Lowering Interface ----------*- C++ -*-===//
|
|
|
|
//
|
|
|
|
// The LLVM Compiler Infrastructure
|
|
|
|
//
|
2007-12-29 20:36:04 +00:00
|
|
|
// This file is distributed under the University of Illinois Open Source
|
|
|
|
// License. See LICENSE.TXT for details.
|
2005-11-15 00:40:23 +00:00
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
//
|
|
|
|
// This file defines the interfaces that X86 uses to lower LLVM code into a
|
|
|
|
// selection DAG.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
|
|
|
#ifndef X86ISELLOWERING_H
|
|
|
|
#define X86ISELLOWERING_H
|
|
|
|
|
2006-01-27 08:10:46 +00:00
|
|
|
#include "X86Subtarget.h"
|
2007-07-14 14:06:15 +00:00
|
|
|
#include "X86RegisterInfo.h"
|
2008-01-05 16:56:59 +00:00
|
|
|
#include "X86MachineFunctionInfo.h"
|
2005-11-15 00:40:23 +00:00
|
|
|
#include "llvm/Target/TargetLowering.h"
|
2008-09-03 02:54:11 +00:00
|
|
|
#include "llvm/CodeGen/FastISel.h"
|
2005-11-15 00:40:23 +00:00
|
|
|
#include "llvm/CodeGen/SelectionDAG.h"
|
2007-08-31 15:06:30 +00:00
|
|
|
#include "llvm/CodeGen/CallingConvLower.h"
|
2005-11-15 00:40:23 +00:00
|
|
|
|
|
|
|
namespace llvm {
|
|
|
|
namespace X86ISD {
|
2006-01-06 00:43:03 +00:00
|
|
|
// X86 Specific DAG Nodes
|
2005-11-15 00:40:23 +00:00
|
|
|
enum NodeType {
|
|
|
|
// Start the numbering where the builtin ops leave off.
|
2008-09-23 18:42:32 +00:00
|
|
|
FIRST_NUMBER = ISD::BUILTIN_OP_END,
|
2005-11-15 00:40:23 +00:00
|
|
|
|
2007-12-14 02:13:44 +00:00
|
|
|
/// BSF - Bit scan forward.
|
|
|
|
/// BSR - Bit scan reverse.
|
|
|
|
BSF,
|
|
|
|
BSR,
|
|
|
|
|
2006-01-09 18:33:28 +00:00
|
|
|
/// SHLD, SHRD - Double shift instructions. These correspond to
|
|
|
|
/// X86::SHLDxx and X86::SHRDxx instructions.
|
|
|
|
SHLD,
|
|
|
|
SHRD,
|
|
|
|
|
2006-01-31 03:14:29 +00:00
|
|
|
/// FAND - Bitwise logical AND of floating point values. This corresponds
|
|
|
|
/// to X86::ANDPS or X86::ANDPD.
|
|
|
|
FAND,
|
|
|
|
|
2007-01-05 07:55:56 +00:00
|
|
|
/// FOR - Bitwise logical OR of floating point values. This corresponds
|
|
|
|
/// to X86::ORPS or X86::ORPD.
|
|
|
|
FOR,
|
|
|
|
|
2006-01-31 22:28:30 +00:00
|
|
|
/// FXOR - Bitwise logical XOR of floating point values. This corresponds
|
|
|
|
/// to X86::XORPS or X86::XORPD.
|
|
|
|
FXOR,
|
|
|
|
|
2007-01-05 21:37:56 +00:00
|
|
|
/// FSRL - Bitwise logical right shift of floating point values. These
|
|
|
|
/// corresponds to X86::PSRLDQ.
|
2007-01-05 07:55:56 +00:00
|
|
|
FSRL,
|
|
|
|
|
2006-02-04 02:20:30 +00:00
|
|
|
/// FILD, FILD_FLAG - This instruction implements SINT_TO_FP with the
|
|
|
|
/// integer source in memory and FP reg result. This corresponds to the
|
|
|
|
/// X86::FILD*m instructions. It has three inputs (token chain, address,
|
|
|
|
/// and source type) and two outputs (FP value and token chain). FILD_FLAG
|
|
|
|
/// also produces a flag).
|
2006-01-12 22:54:21 +00:00
|
|
|
FILD,
|
2006-02-04 02:20:30 +00:00
|
|
|
FILD_FLAG,
|
2005-11-15 00:40:23 +00:00
|
|
|
|
|
|
|
/// FP_TO_INT*_IN_MEM - This instruction implements FP_TO_SINT with the
|
|
|
|
/// integer destination in memory and a FP reg source. This corresponds
|
|
|
|
/// to the X86::FIST*m instructions and the rounding mode change stuff. It
|
2006-10-18 18:26:48 +00:00
|
|
|
/// has two inputs (token chain and address) and two outputs (int value
|
|
|
|
/// and token chain).
|
2005-11-15 00:40:23 +00:00
|
|
|
FP_TO_INT16_IN_MEM,
|
|
|
|
FP_TO_INT32_IN_MEM,
|
|
|
|
FP_TO_INT64_IN_MEM,
|
|
|
|
|
2005-12-21 02:39:21 +00:00
|
|
|
/// FLD - This instruction implements an extending load to FP stack slots.
|
|
|
|
/// This corresponds to the X86::FLD32m / X86::FLD64m. It takes a chain
|
2005-12-23 07:31:11 +00:00
|
|
|
/// operand, ptr to load from, and a ValueType node indicating the type
|
|
|
|
/// to load to.
|
2005-12-21 02:39:21 +00:00
|
|
|
FLD,
|
|
|
|
|
2006-01-05 00:27:02 +00:00
|
|
|
/// FST - This instruction implements a truncating store to FP stack
|
|
|
|
/// slots. This corresponds to the X86::FST32m / X86::FST64m. It takes a
|
|
|
|
/// chain operand, value to store, address, and a ValueType to store it
|
|
|
|
/// as.
|
|
|
|
FST,
|
|
|
|
|
2005-11-15 00:40:23 +00:00
|
|
|
/// CALL/TAILCALL - These operations represent an abstract X86 call
|
|
|
|
/// 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)
|
|
|
|
///
|
|
|
|
/// The CALL vs TAILCALL distinction boils down to whether the callee is
|
|
|
|
/// known not to modify the caller's stack frame, as is standard with
|
|
|
|
/// LLVM.
|
|
|
|
CALL,
|
|
|
|
TAILCALL,
|
2005-11-20 21:41:10 +00:00
|
|
|
|
|
|
|
/// RDTSC_DAG - This operation implements the lowering for
|
|
|
|
/// readcyclecounter
|
|
|
|
RDTSC_DAG,
|
2005-12-17 01:21:05 +00:00
|
|
|
|
|
|
|
/// X86 compare and logical compare instructions.
|
2007-09-17 17:42:53 +00:00
|
|
|
CMP, COMI, UCOMI,
|
2005-12-17 01:21:05 +00:00
|
|
|
|
2005-12-21 20:21:51 +00:00
|
|
|
/// X86 SetCC. Operand 1 is condition code, and operand 2 is the flag
|
|
|
|
/// operand produced by a CMP instruction.
|
|
|
|
SETCC,
|
|
|
|
|
|
|
|
/// X86 conditional moves. Operand 1 and operand 2 are the two values
|
2006-10-18 18:26:48 +00:00
|
|
|
/// to select from (operand 1 is a R/W operand). Operand 3 is the
|
|
|
|
/// condition code, and operand 4 is the flag operand produced by a CMP
|
|
|
|
/// or TEST instruction. It also writes a flag result.
|
2005-12-17 01:21:05 +00:00
|
|
|
CMOV,
|
2005-12-19 23:12:38 +00:00
|
|
|
|
2005-12-21 20:21:51 +00:00
|
|
|
/// X86 conditional branches. Operand 1 is the chain operand, operand 2
|
|
|
|
/// is the block to branch if condition is true, operand 3 is the
|
|
|
|
/// condition code, and operand 4 is the flag operand produced by a CMP
|
|
|
|
/// or TEST instruction.
|
2005-12-19 23:12:38 +00:00
|
|
|
BRCOND,
|
2005-12-21 02:39:21 +00:00
|
|
|
|
2006-01-11 22:15:48 +00:00
|
|
|
/// Return with a flag operand. Operand 1 is the chain operand, operand
|
|
|
|
/// 2 is the number of bytes of stack to pop.
|
2005-12-21 02:39:21 +00:00
|
|
|
RET_FLAG,
|
2006-01-11 22:15:48 +00:00
|
|
|
|
|
|
|
/// REP_STOS - Repeat fill, corresponds to X86::REP_STOSx.
|
|
|
|
REP_STOS,
|
|
|
|
|
|
|
|
/// REP_MOVS - Repeat move, corresponds to X86::REP_MOVSx.
|
|
|
|
REP_MOVS,
|
2006-01-31 22:28:30 +00:00
|
|
|
|
2006-02-18 00:15:05 +00:00
|
|
|
/// GlobalBaseReg - On Darwin, this node represents the result of the popl
|
|
|
|
/// at function entry, used for PIC code.
|
|
|
|
GlobalBaseReg,
|
2006-02-23 02:43:52 +00:00
|
|
|
|
2008-09-16 21:48:12 +00:00
|
|
|
/// Wrapper - A wrapper node for TargetConstantPool,
|
|
|
|
/// TargetExternalSymbol, and TargetGlobalAddress.
|
2006-02-23 20:41:18 +00:00
|
|
|
Wrapper,
|
2006-03-21 23:01:21 +00:00
|
|
|
|
2006-11-30 21:55:46 +00:00
|
|
|
/// WrapperRIP - Special wrapper used under X86-64 PIC mode for RIP
|
|
|
|
/// relative displacements.
|
|
|
|
WrapperRIP,
|
|
|
|
|
2008-02-11 04:19:36 +00:00
|
|
|
/// PEXTRB - Extract an 8-bit value from a vector and zero extend it to
|
|
|
|
/// i32, corresponds to X86::PEXTRB.
|
|
|
|
PEXTRB,
|
|
|
|
|
2006-03-31 19:22:53 +00:00
|
|
|
/// PEXTRW - Extract a 16-bit value from a vector and zero extend it to
|
2006-03-31 21:55:24 +00:00
|
|
|
/// i32, corresponds to X86::PEXTRW.
|
2006-03-31 19:22:53 +00:00
|
|
|
PEXTRW,
|
2006-03-31 21:55:24 +00:00
|
|
|
|
2008-02-11 04:19:36 +00:00
|
|
|
/// INSERTPS - Insert any element of a 4 x float vector into any element
|
|
|
|
/// of a destination 4 x floatvector.
|
|
|
|
INSERTPS,
|
|
|
|
|
|
|
|
/// PINSRB - Insert the lower 8-bits of a 32-bit value to a vector,
|
|
|
|
/// corresponds to X86::PINSRB.
|
|
|
|
PINSRB,
|
|
|
|
|
2006-03-31 21:55:24 +00:00
|
|
|
/// PINSRW - Insert the lower 16-bits of a 32-bit value to a vector,
|
|
|
|
/// corresponds to X86::PINSRW.
|
2006-11-10 21:43:37 +00:00
|
|
|
PINSRW,
|
|
|
|
|
|
|
|
/// FMAX, FMIN - Floating point max and min.
|
|
|
|
///
|
2007-04-20 21:38:10 +00:00
|
|
|
FMAX, FMIN,
|
2007-07-10 00:05:58 +00:00
|
|
|
|
|
|
|
/// FRSQRT, FRCP - Floating point reciprocal-sqrt and reciprocal
|
|
|
|
/// approximation. Note that these typically require refinement
|
|
|
|
/// in order to obtain suitable precision.
|
|
|
|
FRSQRT, FRCP,
|
|
|
|
|
2008-05-08 00:57:18 +00:00
|
|
|
// TLSADDR, THREAThread - Thread Local Storage.
|
2007-07-14 14:06:15 +00:00
|
|
|
TLSADDR, THREAD_POINTER,
|
|
|
|
|
2008-05-08 00:57:18 +00:00
|
|
|
// EH_RETURN - Exception Handling helpers.
|
2007-10-11 19:40:01 +00:00
|
|
|
EH_RETURN,
|
|
|
|
|
2008-03-19 16:39:45 +00:00
|
|
|
/// TC_RETURN - Tail call return.
|
|
|
|
/// operand #0 chain
|
|
|
|
/// operand #1 callee (register or absolute)
|
|
|
|
/// operand #2 stack adjustment
|
|
|
|
/// operand #3 optional in flag
|
2007-11-16 01:31:51 +00:00
|
|
|
TC_RETURN,
|
|
|
|
|
2008-05-08 00:57:18 +00:00
|
|
|
// LCMPXCHG_DAG, LCMPXCHG8_DAG - Compare and swap.
|
2008-03-01 21:52:34 +00:00
|
|
|
LCMPXCHG_DAG,
|
2008-03-05 01:15:49 +00:00
|
|
|
LCMPXCHG8_DAG,
|
2008-03-01 21:52:34 +00:00
|
|
|
|
2008-05-08 00:57:18 +00:00
|
|
|
// FNSTCW16m - Store FP control world into i16 memory.
|
|
|
|
FNSTCW16m,
|
|
|
|
|
2008-05-09 21:53:03 +00:00
|
|
|
// VZEXT_MOVL - Vector move low and zero extend.
|
|
|
|
VZEXT_MOVL,
|
|
|
|
|
|
|
|
// VZEXT_LOAD - Load, scalar_to_vector, and zero extend.
|
2008-05-29 08:22:04 +00:00
|
|
|
VZEXT_LOAD,
|
|
|
|
|
|
|
|
// VSHL, VSRL - Vector logical left / right shift.
|
2008-07-17 16:51:19 +00:00
|
|
|
VSHL, VSRL,
|
|
|
|
|
|
|
|
// CMPPD, CMPPS - Vector double/float comparison.
|
|
|
|
CMPPD, CMPPS,
|
|
|
|
|
|
|
|
// PCMP* - Vector integer comparisons.
|
|
|
|
PCMPEQB, PCMPEQW, PCMPEQD, PCMPEQQ,
|
|
|
|
PCMPGTB, PCMPGTW, PCMPGTD, PCMPGTQ
|
2005-11-15 00:40:23 +00:00
|
|
|
};
|
|
|
|
}
|
|
|
|
|
2008-01-29 19:34:22 +00:00
|
|
|
/// Define some predicates that are used for node matching.
|
|
|
|
namespace X86 {
|
|
|
|
/// isPSHUFDMask - Return true if the specified VECTOR_SHUFFLE operand
|
|
|
|
/// specifies a shuffle of elements that is suitable for input to PSHUFD.
|
|
|
|
bool isPSHUFDMask(SDNode *N);
|
|
|
|
|
|
|
|
/// isPSHUFHWMask - Return true if the specified VECTOR_SHUFFLE operand
|
|
|
|
/// specifies a shuffle of elements that is suitable for input to PSHUFD.
|
|
|
|
bool isPSHUFHWMask(SDNode *N);
|
|
|
|
|
|
|
|
/// isPSHUFLWMask - Return true if the specified VECTOR_SHUFFLE operand
|
|
|
|
/// specifies a shuffle of elements that is suitable for input to PSHUFD.
|
|
|
|
bool isPSHUFLWMask(SDNode *N);
|
|
|
|
|
|
|
|
/// isSHUFPMask - Return true if the specified VECTOR_SHUFFLE operand
|
|
|
|
/// specifies a shuffle of elements that is suitable for input to SHUFP*.
|
|
|
|
bool isSHUFPMask(SDNode *N);
|
|
|
|
|
|
|
|
/// isMOVHLPSMask - Return true if the specified VECTOR_SHUFFLE operand
|
|
|
|
/// specifies a shuffle of elements that is suitable for input to MOVHLPS.
|
|
|
|
bool isMOVHLPSMask(SDNode *N);
|
|
|
|
|
|
|
|
/// isMOVHLPS_v_undef_Mask - Special case of isMOVHLPSMask for canonical form
|
|
|
|
/// of vector_shuffle v, v, <2, 3, 2, 3>, i.e. vector_shuffle v, undef,
|
|
|
|
/// <2, 3, 2, 3>
|
|
|
|
bool isMOVHLPS_v_undef_Mask(SDNode *N);
|
|
|
|
|
|
|
|
/// isMOVLPMask - Return true if the specified VECTOR_SHUFFLE operand
|
|
|
|
/// specifies a shuffle of elements that is suitable for input to MOVLP{S|D}.
|
|
|
|
bool isMOVLPMask(SDNode *N);
|
|
|
|
|
|
|
|
/// isMOVHPMask - Return true if the specified VECTOR_SHUFFLE operand
|
|
|
|
/// specifies a shuffle of elements that is suitable for input to MOVHP{S|D}
|
|
|
|
/// as well as MOVLHPS.
|
|
|
|
bool isMOVHPMask(SDNode *N);
|
|
|
|
|
|
|
|
/// isUNPCKLMask - Return true if the specified VECTOR_SHUFFLE operand
|
|
|
|
/// specifies a shuffle of elements that is suitable for input to UNPCKL.
|
|
|
|
bool isUNPCKLMask(SDNode *N, bool V2IsSplat = false);
|
|
|
|
|
|
|
|
/// isUNPCKHMask - Return true if the specified VECTOR_SHUFFLE operand
|
|
|
|
/// specifies a shuffle of elements that is suitable for input to UNPCKH.
|
|
|
|
bool isUNPCKHMask(SDNode *N, bool V2IsSplat = false);
|
|
|
|
|
|
|
|
/// isUNPCKL_v_undef_Mask - Special case of isUNPCKLMask for canonical form
|
|
|
|
/// of vector_shuffle v, v, <0, 4, 1, 5>, i.e. vector_shuffle v, undef,
|
|
|
|
/// <0, 0, 1, 1>
|
|
|
|
bool isUNPCKL_v_undef_Mask(SDNode *N);
|
|
|
|
|
|
|
|
/// isUNPCKH_v_undef_Mask - Special case of isUNPCKHMask for canonical form
|
|
|
|
/// of vector_shuffle v, v, <2, 6, 3, 7>, i.e. vector_shuffle v, undef,
|
|
|
|
/// <2, 2, 3, 3>
|
|
|
|
bool isUNPCKH_v_undef_Mask(SDNode *N);
|
|
|
|
|
|
|
|
/// isMOVLMask - Return true if the specified VECTOR_SHUFFLE operand
|
|
|
|
/// specifies a shuffle of elements that is suitable for input to MOVSS,
|
|
|
|
/// MOVSD, and MOVD, i.e. setting the lowest element.
|
|
|
|
bool isMOVLMask(SDNode *N);
|
|
|
|
|
|
|
|
/// isMOVSHDUPMask - Return true if the specified VECTOR_SHUFFLE operand
|
|
|
|
/// specifies a shuffle of elements that is suitable for input to MOVSHDUP.
|
|
|
|
bool isMOVSHDUPMask(SDNode *N);
|
|
|
|
|
|
|
|
/// isMOVSLDUPMask - Return true if the specified VECTOR_SHUFFLE operand
|
|
|
|
/// specifies a shuffle of elements that is suitable for input to MOVSLDUP.
|
|
|
|
bool isMOVSLDUPMask(SDNode *N);
|
|
|
|
|
|
|
|
/// isSplatMask - Return true if the specified VECTOR_SHUFFLE operand
|
|
|
|
/// specifies a splat of a single element.
|
|
|
|
bool isSplatMask(SDNode *N);
|
|
|
|
|
|
|
|
/// isSplatLoMask - Return true if the specified VECTOR_SHUFFLE operand
|
|
|
|
/// specifies a splat of zero element.
|
|
|
|
bool isSplatLoMask(SDNode *N);
|
|
|
|
|
|
|
|
/// getShuffleSHUFImmediate - Return the appropriate immediate to shuffle
|
|
|
|
/// the specified isShuffleMask VECTOR_SHUFFLE mask with PSHUF* and SHUFP*
|
|
|
|
/// instructions.
|
|
|
|
unsigned getShuffleSHUFImmediate(SDNode *N);
|
|
|
|
|
|
|
|
/// getShufflePSHUFHWImmediate - Return the appropriate immediate to shuffle
|
|
|
|
/// the specified isShuffleMask VECTOR_SHUFFLE mask with PSHUFHW
|
|
|
|
/// instructions.
|
|
|
|
unsigned getShufflePSHUFHWImmediate(SDNode *N);
|
|
|
|
|
|
|
|
/// getShufflePSHUFKWImmediate - Return the appropriate immediate to shuffle
|
|
|
|
/// the specified isShuffleMask VECTOR_SHUFFLE mask with PSHUFLW
|
|
|
|
/// instructions.
|
|
|
|
unsigned getShufflePSHUFLWImmediate(SDNode *N);
|
|
|
|
}
|
|
|
|
|
2006-10-18 18:26:48 +00:00
|
|
|
//===--------------------------------------------------------------------===//
|
2005-11-15 00:40:23 +00:00
|
|
|
// X86TargetLowering - X86 Implementation of the TargetLowering interface
|
|
|
|
class X86TargetLowering : public TargetLowering {
|
|
|
|
int VarArgsFrameIndex; // FrameIndex for start of varargs area.
|
2006-09-08 06:48:29 +00:00
|
|
|
int RegSaveFrameIndex; // X86-64 vararg func register save area.
|
|
|
|
unsigned VarArgsGPOffset; // X86-64 vararg func int reg offset.
|
|
|
|
unsigned VarArgsFPOffset; // X86-64 vararg func fp reg offset.
|
2005-11-15 00:40:23 +00:00
|
|
|
int BytesToPopOnReturn; // Number of arg bytes ret should pop.
|
|
|
|
int BytesCallerReserves; // Number of arg bytes caller makes.
|
2007-10-11 19:40:01 +00:00
|
|
|
|
2005-11-15 00:40:23 +00:00
|
|
|
public:
|
2008-05-14 01:58:56 +00:00
|
|
|
explicit X86TargetLowering(X86TargetMachine &TM);
|
2005-11-15 00:40:23 +00:00
|
|
|
|
Much improved pic jumptable codegen:
Then:
call "L1$pb"
"L1$pb":
popl %eax
...
LBB1_1: # entry
imull $4, %ecx, %ecx
leal LJTI1_0-"L1$pb"(%eax), %edx
addl LJTI1_0-"L1$pb"(%ecx,%eax), %edx
jmpl *%edx
.align 2
.set L1_0_set_3,LBB1_3-LJTI1_0
.set L1_0_set_2,LBB1_2-LJTI1_0
.set L1_0_set_5,LBB1_5-LJTI1_0
.set L1_0_set_4,LBB1_4-LJTI1_0
LJTI1_0:
.long L1_0_set_3
.long L1_0_set_2
Now:
call "L1$pb"
"L1$pb":
popl %eax
...
LBB1_1: # entry
addl LJTI1_0-"L1$pb"(%eax,%ecx,4), %eax
jmpl *%eax
.align 2
.set L1_0_set_3,LBB1_3-"L1$pb"
.set L1_0_set_2,LBB1_2-"L1$pb"
.set L1_0_set_5,LBB1_5-"L1$pb"
.set L1_0_set_4,LBB1_4-"L1$pb"
LJTI1_0:
.long L1_0_set_3
.long L1_0_set_2
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@43924 91177308-0d34-0410-b5e6-96231b3b80d8
2007-11-09 01:32:10 +00:00
|
|
|
/// getPICJumpTableRelocaBase - Returns relocation base for the given PIC
|
|
|
|
/// jumptable.
|
2008-07-27 21:46:04 +00:00
|
|
|
SDValue getPICJumpTableRelocBase(SDValue Table,
|
Much improved pic jumptable codegen:
Then:
call "L1$pb"
"L1$pb":
popl %eax
...
LBB1_1: # entry
imull $4, %ecx, %ecx
leal LJTI1_0-"L1$pb"(%eax), %edx
addl LJTI1_0-"L1$pb"(%ecx,%eax), %edx
jmpl *%edx
.align 2
.set L1_0_set_3,LBB1_3-LJTI1_0
.set L1_0_set_2,LBB1_2-LJTI1_0
.set L1_0_set_5,LBB1_5-LJTI1_0
.set L1_0_set_4,LBB1_4-LJTI1_0
LJTI1_0:
.long L1_0_set_3
.long L1_0_set_2
Now:
call "L1$pb"
"L1$pb":
popl %eax
...
LBB1_1: # entry
addl LJTI1_0-"L1$pb"(%eax,%ecx,4), %eax
jmpl *%eax
.align 2
.set L1_0_set_3,LBB1_3-"L1$pb"
.set L1_0_set_2,LBB1_2-"L1$pb"
.set L1_0_set_5,LBB1_5-"L1$pb"
.set L1_0_set_4,LBB1_4-"L1$pb"
LJTI1_0:
.long L1_0_set_3
.long L1_0_set_2
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@43924 91177308-0d34-0410-b5e6-96231b3b80d8
2007-11-09 01:32:10 +00:00
|
|
|
SelectionDAG &DAG) const;
|
|
|
|
|
2005-11-15 00:40:23 +00:00
|
|
|
// Return the number of bytes that a function should pop when it returns (in
|
|
|
|
// addition to the space used by the return address).
|
|
|
|
//
|
|
|
|
unsigned getBytesToPopOnReturn() const { return BytesToPopOnReturn; }
|
|
|
|
|
|
|
|
// Return the number of bytes that the caller reserves for arguments passed
|
|
|
|
// to this function.
|
|
|
|
unsigned getBytesCallerReserves() const { return BytesCallerReserves; }
|
|
|
|
|
2007-02-26 04:01:25 +00:00
|
|
|
/// getStackPtrReg - Return the stack pointer register we are using: either
|
|
|
|
/// ESP or RSP.
|
|
|
|
unsigned getStackPtrReg() const { return X86StackPtr; }
|
2008-01-23 23:17:41 +00:00
|
|
|
|
|
|
|
/// getByValTypeAlignment - Return the desired alignment for ByVal aggregate
|
|
|
|
/// 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.
|
|
|
|
virtual unsigned getByValTypeAlignment(const Type *Ty) const;
|
2008-05-15 08:39:06 +00:00
|
|
|
|
|
|
|
/// getOptimalMemOpType - Returns the target specific optimal type for load
|
2008-05-15 22:13:02 +00:00
|
|
|
/// and store operations as a result of memset, memcpy, and memmove
|
|
|
|
/// lowering. It returns MVT::iAny if SelectionDAG should be responsible for
|
2008-05-15 08:39:06 +00:00
|
|
|
/// determining it.
|
|
|
|
virtual
|
2008-06-06 12:08:01 +00:00
|
|
|
MVT getOptimalMemOpType(uint64_t Size, unsigned Align,
|
|
|
|
bool isSrcConst, bool isSrcStr) const;
|
2007-02-26 04:01:25 +00:00
|
|
|
|
2005-11-15 00:40:23 +00:00
|
|
|
/// LowerOperation - Provide custom lowering hooks for some operations.
|
|
|
|
///
|
2008-07-27 21:46:04 +00:00
|
|
|
virtual SDValue LowerOperation(SDValue Op, SelectionDAG &DAG);
|
2005-11-15 00:40:23 +00:00
|
|
|
|
2008-07-04 11:47:58 +00:00
|
|
|
/// ReplaceNodeResults - Replace a node with an illegal result type
|
|
|
|
/// with a new node built out of custom code.
|
2007-11-24 07:07:01 +00:00
|
|
|
///
|
2008-07-04 11:47:58 +00:00
|
|
|
virtual SDNode *ReplaceNodeResults(SDNode *N, SelectionDAG &DAG);
|
2007-11-24 07:07:01 +00:00
|
|
|
|
|
|
|
|
2008-07-27 21:46:04 +00:00
|
|
|
virtual SDValue PerformDAGCombine(SDNode *N, DAGCombinerInfo &DCI) const;
|
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
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@29042 91177308-0d34-0410-b5e6-96231b3b80d8
2006-07-07 08:33:52 +00:00
|
|
|
|
2008-01-30 18:18:23 +00:00
|
|
|
virtual MachineBasicBlock *EmitInstrWithCustomInserter(MachineInstr *MI,
|
|
|
|
MachineBasicBlock *MBB);
|
2006-01-11 00:33:36 +00:00
|
|
|
|
2008-05-05 19:05:59 +00:00
|
|
|
|
2005-12-20 06:22:03 +00:00
|
|
|
/// getTargetNodeName - This method returns the name of a target specific
|
|
|
|
/// DAG node.
|
|
|
|
virtual const char *getTargetNodeName(unsigned Opcode) const;
|
|
|
|
|
2008-03-10 15:42:14 +00:00
|
|
|
/// getSetCCResultType - Return the ISD::SETCC ValueType
|
2008-07-27 21:46:04 +00:00
|
|
|
virtual MVT getSetCCResultType(const SDValue &) const;
|
2008-03-10 15:42:14 +00:00
|
|
|
|
2006-02-16 21:11:51 +00:00
|
|
|
/// computeMaskedBitsForTargetNode - Determine which of the bits specified
|
|
|
|
/// in Mask are known to be either zero or one and return them in the
|
|
|
|
/// KnownZero/KnownOne bitsets.
|
2008-07-27 21:46:04 +00:00
|
|
|
virtual void computeMaskedBitsForTargetNode(const SDValue Op,
|
2008-02-13 22:28:48 +00:00
|
|
|
const APInt &Mask,
|
2008-02-13 00:35:47 +00:00
|
|
|
APInt &KnownZero,
|
|
|
|
APInt &KnownOne,
|
2007-06-22 14:59:07 +00:00
|
|
|
const SelectionDAG &DAG,
|
2006-02-16 21:11:51 +00:00
|
|
|
unsigned Depth = 0) const;
|
2008-05-12 19:56:52 +00:00
|
|
|
|
|
|
|
virtual bool
|
|
|
|
isGAPlusOffset(SDNode *N, GlobalValue* &GA, int64_t &Offset) const;
|
2006-02-16 21:11:51 +00:00
|
|
|
|
2008-07-27 21:46:04 +00:00
|
|
|
SDValue getReturnAddressFrameIndex(SelectionDAG &DAG);
|
2005-11-15 00:40:23 +00:00
|
|
|
|
2007-03-25 02:14:49 +00:00
|
|
|
ConstraintType getConstraintType(const std::string &Constraint) const;
|
2006-07-11 02:54:03 +00:00
|
|
|
|
2006-01-31 19:43:35 +00:00
|
|
|
std::vector<unsigned>
|
2006-02-22 00:56:39 +00:00
|
|
|
getRegClassForInlineAsmConstraint(const std::string &Constraint,
|
2008-06-06 12:08:01 +00:00
|
|
|
MVT VT) const;
|
2007-08-25 00:47:38 +00:00
|
|
|
|
2008-06-06 12:08:01 +00:00
|
|
|
virtual const char *LowerXConstraint(MVT ConstraintVT) const;
|
2008-01-29 02:21:21 +00:00
|
|
|
|
2007-08-25 00:47:38 +00:00
|
|
|
/// LowerAsmOperandForConstraint - Lower the specified operand into the Ops
|
|
|
|
/// vector. If it is invalid, don't add anything to Ops.
|
2008-07-27 21:46:04 +00:00
|
|
|
virtual void LowerAsmOperandForConstraint(SDValue Op,
|
2007-08-25 00:47:38 +00:00
|
|
|
char ConstraintLetter,
|
2008-07-27 21:46:04 +00:00
|
|
|
std::vector<SDValue> &Ops,
|
2008-04-26 23:02:14 +00:00
|
|
|
SelectionDAG &DAG) const;
|
2006-10-31 20:13:11 +00:00
|
|
|
|
2006-10-18 18:26:48 +00:00
|
|
|
/// getRegForInlineAsmConstraint - Given a physical register constraint
|
|
|
|
/// (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.
|
2006-07-31 23:26:50 +00:00
|
|
|
std::pair<unsigned, const TargetRegisterClass*>
|
|
|
|
getRegForInlineAsmConstraint(const std::string &Constraint,
|
2008-06-06 12:08:01 +00:00
|
|
|
MVT VT) const;
|
2006-07-31 23:26:50 +00:00
|
|
|
|
2007-03-30 23:15:24 +00:00
|
|
|
/// isLegalAddressingMode - Return true if the addressing mode represented
|
|
|
|
/// by AM is legal for this target, for a load/store of the specified type.
|
|
|
|
virtual bool isLegalAddressingMode(const AddrMode &AM, const Type *Ty)const;
|
|
|
|
|
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
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@43375 91177308-0d34-0410-b5e6-96231b3b80d8
2007-10-26 01:56:11 +00:00
|
|
|
/// isTruncateFree - Return true if it's free to truncate a value of
|
|
|
|
/// 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.
|
|
|
|
virtual bool isTruncateFree(const Type *Ty1, const Type *Ty2) const;
|
2008-06-06 12:08:01 +00:00
|
|
|
virtual bool isTruncateFree(MVT VT1, MVT VT2) const;
|
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
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@43375 91177308-0d34-0410-b5e6-96231b3b80d8
2007-10-26 01:56:11 +00:00
|
|
|
|
2006-03-22 18:59:22 +00:00
|
|
|
/// isShuffleMaskLegal - Targets can use this to indicate that they only
|
|
|
|
/// support *some* VECTOR_SHUFFLE operations, those with specific masks.
|
2006-10-18 18:26:48 +00:00
|
|
|
/// By default, if a target supports the VECTOR_SHUFFLE node, all mask
|
|
|
|
/// values are assumed to be legal.
|
2008-07-27 21:46:04 +00:00
|
|
|
virtual bool isShuffleMaskLegal(SDValue Mask, MVT VT) const;
|
2006-04-20 08:58:49 +00:00
|
|
|
|
|
|
|
/// isVectorClearMaskLegal - Similar to isShuffleMaskLegal. This is
|
|
|
|
/// used by 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.
|
2008-07-27 21:46:04 +00:00
|
|
|
virtual bool isVectorClearMaskLegal(const std::vector<SDValue> &BVOps,
|
2008-06-06 12:08:01 +00:00
|
|
|
MVT EVT, SelectionDAG &DAG) const;
|
2008-03-05 01:30:59 +00:00
|
|
|
|
|
|
|
/// ShouldShrinkFPConstant - If true, then instruction selection should
|
|
|
|
/// seek to shrink the FP constant of the specified type to a smaller type
|
|
|
|
/// in order to save space and / or reduce runtime.
|
2008-06-06 12:08:01 +00:00
|
|
|
virtual bool ShouldShrinkFPConstant(MVT VT) const {
|
2008-03-05 01:30:59 +00: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.
|
|
|
|
return !X86ScalarSSEf64 || VT == MVT::f80;
|
|
|
|
}
|
2007-10-11 19:40:01 +00:00
|
|
|
|
|
|
|
/// IsEligibleForTailCallOptimization - Check whether the call is eligible
|
|
|
|
/// for tail call optimization. Target which want to do tail call
|
|
|
|
/// optimization should implement this function.
|
2008-09-13 01:54:27 +00:00
|
|
|
virtual bool IsEligibleForTailCallOptimization(CallSDNode *TheCall,
|
2008-07-27 21:46:04 +00:00
|
|
|
SDValue Ret,
|
2007-10-11 19:40:01 +00:00
|
|
|
SelectionDAG &DAG) const;
|
|
|
|
|
Drop ISD::MEMSET, ISD::MEMMOVE, and ISD::MEMCPY, which are not Legal
on any current target and aren't optimized in DAGCombiner. Instead
of using intermediate nodes, expand the operations, choosing between
simple loads/stores, target-specific code, and library calls,
immediately.
Previously, the code to emit optimized code for these operations
was only used at initial SelectionDAG construction time; now it is
used at all times. This fixes some cases where rep;movs was being
used for small copies where simple loads/stores would be better.
This also cleans up code that checks for alignments less than 4;
let the targets make that decision instead of doing it in
target-independent code. This allows x86 to use rep;movs in
low-alignment cases.
Also, this fixes a bug that resulted in the use of rep;stos for
memsets of 0 with non-constant memory size when the alignment was
at least 4. It's better to use the library in this case, which
can be significantly faster when the size is large.
This also preserves more SourceValue information when memory
intrinsics are lowered into simple loads/stores.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@49572 91177308-0d34-0410-b5e6-96231b3b80d8
2008-04-12 04:36:06 +00:00
|
|
|
virtual const X86Subtarget* getSubtarget() {
|
|
|
|
return Subtarget;
|
2007-11-05 23:12:20 +00:00
|
|
|
}
|
|
|
|
|
2008-01-18 06:52:41 +00:00
|
|
|
/// isScalarFPTypeInSSEReg - Return true if the specified scalar FP type is
|
|
|
|
/// computed in an SSE register, not on the X87 floating point stack.
|
2008-06-06 12:08:01 +00:00
|
|
|
bool isScalarFPTypeInSSEReg(MVT VT) const {
|
2008-01-18 06:52:41 +00:00
|
|
|
return (VT == MVT::f64 && X86ScalarSSEf64) || // f64 is when SSE2
|
|
|
|
(VT == MVT::f32 && X86ScalarSSEf32); // f32 is when SSE1
|
|
|
|
}
|
2008-08-19 21:32:53 +00:00
|
|
|
|
|
|
|
/// createFastISel - This method returns a target specific FastISel object,
|
|
|
|
/// or null if the target does not support "fast" ISel.
|
2008-09-03 23:12:08 +00:00
|
|
|
virtual FastISel *
|
|
|
|
createFastISel(MachineFunction &mf,
|
|
|
|
DenseMap<const Value *, unsigned> &,
|
2008-09-10 20:11:02 +00:00
|
|
|
DenseMap<const BasicBlock *, MachineBasicBlock *> &,
|
|
|
|
DenseMap<const AllocaInst *, int> &);
|
2008-01-18 06:52:41 +00:00
|
|
|
|
2005-11-15 00:40:23 +00:00
|
|
|
private:
|
2006-04-25 20:13:52 +00:00
|
|
|
/// Subtarget - Keep a pointer to the X86Subtarget around so that we can
|
|
|
|
/// make the right decision when generating code for different targets.
|
|
|
|
const X86Subtarget *Subtarget;
|
2008-05-14 01:58:56 +00:00
|
|
|
const X86RegisterInfo *RegInfo;
|
2008-09-09 18:22:57 +00:00
|
|
|
const TargetData *TD;
|
2006-04-25 20:13:52 +00:00
|
|
|
|
2006-09-08 06:48:29 +00:00
|
|
|
/// X86StackPtr - X86 physical register used as stack ptr.
|
|
|
|
unsigned X86StackPtr;
|
2007-10-11 19:40:01 +00:00
|
|
|
|
2007-09-23 14:52:20 +00:00
|
|
|
/// X86ScalarSSEf32, X86ScalarSSEf64 - Select between SSE or x87
|
|
|
|
/// floating point ops.
|
|
|
|
/// When SSE is available, use it for f32 operations.
|
|
|
|
/// When SSE2 is available, use it for f64 operations.
|
|
|
|
bool X86ScalarSSEf32;
|
|
|
|
bool X86ScalarSSEf64;
|
2008-01-29 19:34:22 +00:00
|
|
|
|
2008-09-13 01:54:27 +00:00
|
|
|
SDNode *LowerCallResult(SDValue Chain, SDValue InFlag, CallSDNode *TheCall,
|
2007-02-25 08:59:22 +00:00
|
|
|
unsigned CallingConv, SelectionDAG &DAG);
|
2008-01-29 19:34:22 +00:00
|
|
|
|
2008-07-27 21:46:04 +00:00
|
|
|
SDValue LowerMemArgument(SDValue Op, SelectionDAG &DAG,
|
2007-09-14 15:48:13 +00:00
|
|
|
const CCValAssign &VA, MachineFrameInfo *MFI,
|
2008-07-27 21:46:04 +00:00
|
|
|
unsigned CC, SDValue Root, unsigned i);
|
2007-09-14 15:48:13 +00:00
|
|
|
|
2008-09-13 01:54:27 +00:00
|
|
|
SDValue LowerMemOpCallTo(CallSDNode *TheCall, SelectionDAG &DAG,
|
2008-07-27 21:46:04 +00:00
|
|
|
const SDValue &StackPtr,
|
|
|
|
const CCValAssign &VA, SDValue Chain,
|
2008-09-13 01:54:27 +00:00
|
|
|
SDValue Arg, ISD::ArgFlagsTy Flags);
|
2007-08-31 15:06:30 +00:00
|
|
|
|
2008-01-05 16:56:59 +00:00
|
|
|
// Call lowering helpers.
|
2008-09-13 01:54:27 +00:00
|
|
|
bool IsCalleePop(bool isVarArg, unsigned CallingConv);
|
2008-02-26 22:21:54 +00:00
|
|
|
bool CallRequiresGOTPtrInReg(bool Is64Bit, bool IsTailCall);
|
|
|
|
bool CallRequiresFnAddressInReg(bool Is64Bit, bool IsTailCall);
|
2008-07-27 21:46:04 +00:00
|
|
|
SDValue EmitTailCallLoadRetAddr(SelectionDAG &DAG, SDValue &OutRetAddr,
|
|
|
|
SDValue Chain, bool IsTailCall, bool Is64Bit,
|
2008-04-12 18:11:06 +00:00
|
|
|
int FPDiff);
|
|
|
|
|
2008-09-13 01:54:27 +00:00
|
|
|
CCAssignFn *CCAssignFnForNode(unsigned CallingConv) const;
|
2008-07-27 21:46:04 +00:00
|
|
|
NameDecorationStyle NameDecorationForFORMAL_ARGUMENTS(SDValue Op);
|
2007-10-11 19:40:01 +00:00
|
|
|
unsigned GetAlignedArgumentStackSize(unsigned StackSize, SelectionDAG &DAG);
|
2006-01-27 08:10:46 +00:00
|
|
|
|
2008-07-27 21:46:04 +00:00
|
|
|
std::pair<SDValue,SDValue> FP_TO_SINTHelper(SDValue Op,
|
2007-11-24 07:07:01 +00:00
|
|
|
SelectionDAG &DAG);
|
|
|
|
|
2008-07-27 21:46:04 +00:00
|
|
|
SDValue LowerBUILD_VECTOR(SDValue Op, SelectionDAG &DAG);
|
|
|
|
SDValue LowerVECTOR_SHUFFLE(SDValue Op, SelectionDAG &DAG);
|
|
|
|
SDValue LowerEXTRACT_VECTOR_ELT(SDValue Op, SelectionDAG &DAG);
|
|
|
|
SDValue LowerEXTRACT_VECTOR_ELT_SSE4(SDValue Op, SelectionDAG &DAG);
|
|
|
|
SDValue LowerINSERT_VECTOR_ELT(SDValue Op, SelectionDAG &DAG);
|
|
|
|
SDValue LowerINSERT_VECTOR_ELT_SSE4(SDValue Op, SelectionDAG &DAG);
|
|
|
|
SDValue LowerSCALAR_TO_VECTOR(SDValue Op, SelectionDAG &DAG);
|
|
|
|
SDValue LowerConstantPool(SDValue Op, SelectionDAG &DAG);
|
|
|
|
SDValue LowerGlobalAddress(SDValue Op, SelectionDAG &DAG);
|
|
|
|
SDValue LowerGlobalTLSAddress(SDValue Op, SelectionDAG &DAG);
|
|
|
|
SDValue LowerExternalSymbol(SDValue Op, SelectionDAG &DAG);
|
|
|
|
SDValue LowerShift(SDValue Op, SelectionDAG &DAG);
|
|
|
|
SDValue LowerSINT_TO_FP(SDValue Op, SelectionDAG &DAG);
|
|
|
|
SDValue LowerFP_TO_SINT(SDValue Op, SelectionDAG &DAG);
|
|
|
|
SDValue LowerFABS(SDValue Op, SelectionDAG &DAG);
|
|
|
|
SDValue LowerFNEG(SDValue Op, SelectionDAG &DAG);
|
|
|
|
SDValue LowerFCOPYSIGN(SDValue Op, SelectionDAG &DAG);
|
|
|
|
SDValue LowerSETCC(SDValue Op, SelectionDAG &DAG);
|
|
|
|
SDValue LowerVSETCC(SDValue Op, SelectionDAG &DAG);
|
|
|
|
SDValue LowerSELECT(SDValue Op, SelectionDAG &DAG);
|
|
|
|
SDValue LowerBRCOND(SDValue Op, SelectionDAG &DAG);
|
|
|
|
SDValue LowerMEMSET(SDValue Op, SelectionDAG &DAG);
|
|
|
|
SDValue LowerJumpTable(SDValue Op, SelectionDAG &DAG);
|
|
|
|
SDValue LowerCALL(SDValue Op, SelectionDAG &DAG);
|
|
|
|
SDValue LowerRET(SDValue Op, SelectionDAG &DAG);
|
|
|
|
SDValue LowerDYNAMIC_STACKALLOC(SDValue Op, SelectionDAG &DAG);
|
|
|
|
SDValue LowerFORMAL_ARGUMENTS(SDValue Op, SelectionDAG &DAG);
|
|
|
|
SDValue LowerVASTART(SDValue Op, SelectionDAG &DAG);
|
|
|
|
SDValue LowerVAARG(SDValue Op, SelectionDAG &DAG);
|
|
|
|
SDValue LowerVACOPY(SDValue Op, SelectionDAG &DAG);
|
|
|
|
SDValue LowerINTRINSIC_WO_CHAIN(SDValue Op, SelectionDAG &DAG);
|
|
|
|
SDValue LowerRETURNADDR(SDValue Op, SelectionDAG &DAG);
|
|
|
|
SDValue LowerFRAMEADDR(SDValue Op, SelectionDAG &DAG);
|
|
|
|
SDValue LowerFRAME_TO_ARGS_OFFSET(SDValue Op, SelectionDAG &DAG);
|
|
|
|
SDValue LowerEH_RETURN(SDValue Op, SelectionDAG &DAG);
|
|
|
|
SDValue LowerTRAMPOLINE(SDValue Op, SelectionDAG &DAG);
|
|
|
|
SDValue LowerFLT_ROUNDS_(SDValue Op, SelectionDAG &DAG);
|
|
|
|
SDValue LowerCTLZ(SDValue Op, SelectionDAG &DAG);
|
|
|
|
SDValue LowerCTTZ(SDValue Op, SelectionDAG &DAG);
|
|
|
|
SDValue LowerCMP_SWAP(SDValue Op, SelectionDAG &DAG);
|
2007-11-24 07:07:01 +00:00
|
|
|
SDNode *ExpandFP_TO_SINT(SDNode *N, SelectionDAG &DAG);
|
|
|
|
SDNode *ExpandREADCYCLECOUNTER(SDNode *N, SelectionDAG &DAG);
|
2008-06-25 08:15:39 +00:00
|
|
|
SDNode *ExpandATOMIC_CMP_SWAP(SDNode *N, SelectionDAG &DAG);
|
|
|
|
SDNode *ExpandATOMIC_LOAD_SUB(SDNode *N, SelectionDAG &DAG);
|
2008-05-05 19:05:59 +00:00
|
|
|
|
2008-07-27 21:46:04 +00:00
|
|
|
SDValue EmitTargetCodeForMemset(SelectionDAG &DAG,
|
|
|
|
SDValue Chain,
|
|
|
|
SDValue Dst, SDValue Src,
|
|
|
|
SDValue Size, unsigned Align,
|
2008-04-28 17:15:20 +00:00
|
|
|
const Value *DstSV, uint64_t DstSVOff);
|
2008-07-27 21:46:04 +00:00
|
|
|
SDValue EmitTargetCodeForMemcpy(SelectionDAG &DAG,
|
|
|
|
SDValue Chain,
|
|
|
|
SDValue Dst, SDValue Src,
|
|
|
|
SDValue Size, unsigned Align,
|
Drop ISD::MEMSET, ISD::MEMMOVE, and ISD::MEMCPY, which are not Legal
on any current target and aren't optimized in DAGCombiner. Instead
of using intermediate nodes, expand the operations, choosing between
simple loads/stores, target-specific code, and library calls,
immediately.
Previously, the code to emit optimized code for these operations
was only used at initial SelectionDAG construction time; now it is
used at all times. This fixes some cases where rep;movs was being
used for small copies where simple loads/stores would be better.
This also cleans up code that checks for alignments less than 4;
let the targets make that decision instead of doing it in
target-independent code. This allows x86 to use rep;movs in
low-alignment cases.
Also, this fixes a bug that resulted in the use of rep;stos for
memsets of 0 with non-constant memory size when the alignment was
at least 4. It's better to use the library in this case, which
can be significantly faster when the size is large.
This also preserves more SourceValue information when memory
intrinsics are lowered into simple loads/stores.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@49572 91177308-0d34-0410-b5e6-96231b3b80d8
2008-04-12 04:36:06 +00:00
|
|
|
bool AlwaysInline,
|
2008-04-28 17:15:20 +00:00
|
|
|
const Value *DstSV, uint64_t DstSVOff,
|
|
|
|
const Value *SrcSV, uint64_t SrcSVOff);
|
2008-05-05 19:05:59 +00:00
|
|
|
|
|
|
|
/// Utility function to emit atomic bitwise operations (and, or, xor).
|
|
|
|
// It takes the bitwise instruction to expand, the associated machine basic
|
|
|
|
// block, and the associated X86 opcodes for reg/reg and reg/imm.
|
|
|
|
MachineBasicBlock *EmitAtomicBitwiseWithCustomInserter(
|
|
|
|
MachineInstr *BInstr,
|
|
|
|
MachineBasicBlock *BB,
|
|
|
|
unsigned regOpc,
|
2008-06-14 05:48:15 +00:00
|
|
|
unsigned immOpc,
|
2008-08-19 18:47:28 +00:00
|
|
|
unsigned loadOpc,
|
|
|
|
unsigned cxchgOpc,
|
|
|
|
unsigned copyOpc,
|
|
|
|
unsigned notOpc,
|
|
|
|
unsigned EAXreg,
|
|
|
|
TargetRegisterClass *RC,
|
2008-06-14 05:48:15 +00:00
|
|
|
bool invSrc = false);
|
2008-05-05 19:05:59 +00:00
|
|
|
|
|
|
|
/// Utility function to emit atomic min and max. It takes the min/max
|
|
|
|
// instruction to expand, the associated basic block, and the associated
|
|
|
|
// cmov opcode for moving the min or max value.
|
|
|
|
MachineBasicBlock *EmitAtomicMinMaxWithCustomInserter(MachineInstr *BInstr,
|
|
|
|
MachineBasicBlock *BB,
|
|
|
|
unsigned cmovOpc);
|
2005-11-15 00:40:23 +00:00
|
|
|
};
|
2008-09-03 00:03:49 +00:00
|
|
|
|
|
|
|
namespace X86 {
|
2008-09-03 23:12:08 +00:00
|
|
|
FastISel *createFastISel(MachineFunction &mf,
|
|
|
|
DenseMap<const Value *, unsigned> &,
|
2008-09-10 20:11:02 +00:00
|
|
|
DenseMap<const BasicBlock *, MachineBasicBlock *> &,
|
|
|
|
DenseMap<const AllocaInst *, int> &);
|
2008-09-03 00:03:49 +00:00
|
|
|
}
|
2005-11-15 00:40:23 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
#endif // X86ISELLOWERING_H
|