2011-04-15 21:51:11 +00:00
|
|
|
//===-- MipsISelLowering.h - Mips DAG Lowering Interface --------*- C++ -*-===//
|
2007-06-06 07:42:06 +00:00
|
|
|
//
|
|
|
|
// 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.
|
2007-06-06 07:42:06 +00:00
|
|
|
//
|
2011-04-15 21:51:11 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
2007-06-06 07:42:06 +00:00
|
|
|
//
|
|
|
|
// This file defines the interfaces that Mips uses to lower LLVM code into a
|
|
|
|
// selection DAG.
|
|
|
|
//
|
2011-04-15 21:51:11 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
2007-06-06 07:42:06 +00:00
|
|
|
|
|
|
|
#ifndef MipsISELLOWERING_H
|
|
|
|
#define MipsISELLOWERING_H
|
|
|
|
|
|
|
|
#include "Mips.h"
|
|
|
|
#include "MipsSubtarget.h"
|
2012-10-26 23:56:38 +00:00
|
|
|
#include "llvm/CodeGen/CallingConvLower.h"
|
2012-03-17 18:46:09 +00:00
|
|
|
#include "llvm/CodeGen/SelectionDAG.h"
|
2013-03-05 22:13:04 +00:00
|
|
|
#include "llvm/IR/Function.h"
|
2012-03-17 18:46:09 +00:00
|
|
|
#include "llvm/Target/TargetLowering.h"
|
2013-01-22 20:05:56 +00:00
|
|
|
#include <deque>
|
2013-01-24 04:24:02 +00:00
|
|
|
#include <string>
|
2007-06-06 07:42:06 +00:00
|
|
|
|
|
|
|
namespace llvm {
|
|
|
|
namespace MipsISD {
|
|
|
|
enum NodeType {
|
|
|
|
// Start the numbering from where ISD NodeType finishes.
|
2008-09-23 18:42:32 +00:00
|
|
|
FIRST_NUMBER = ISD::BUILTIN_OP_END,
|
2007-06-06 07:42:06 +00:00
|
|
|
|
|
|
|
// Jump and link (call)
|
|
|
|
JmpLink,
|
|
|
|
|
2012-10-19 20:59:39 +00:00
|
|
|
// Tail call
|
|
|
|
TailCall,
|
|
|
|
|
2007-06-06 07:42:06 +00:00
|
|
|
// Get the Higher 16 bits from a 32-bit immediate
|
|
|
|
// No relation with Mips Hi register
|
2011-03-04 17:51:39 +00:00
|
|
|
Hi,
|
2007-06-06 07:42:06 +00:00
|
|
|
|
|
|
|
// Get the Lower 16 bits from a 32-bit immediate
|
|
|
|
// No relation with Mips Lo register
|
2011-03-04 17:51:39 +00:00
|
|
|
Lo,
|
2007-06-06 07:42:06 +00:00
|
|
|
|
2008-07-21 18:52:34 +00:00
|
|
|
// Handle gp_rel (small data/bss sections) relocation.
|
|
|
|
GPRel,
|
|
|
|
|
2011-05-31 02:53:58 +00:00
|
|
|
// Thread Pointer
|
|
|
|
ThreadPointer,
|
|
|
|
|
2008-07-09 04:45:36 +00:00
|
|
|
// Floating Point Branch Conditional
|
Several changes to Mips backend, experimental fp support being the most
important.
- Cleanup in the Subtarget info with addition of new features, not all support
yet, but they allow the future inclusion of features easier. Among new features,
we have : Arch family info (mips1, mips2, ...), ABI info (o32, eabi), 64-bit
integer
and float registers, allegrex vector FPU (VFPU), single float only support.
- TargetMachine now detects allegrex core.
- Added allegrex (Mips32r2) sext_inreg instructions.
- *Added Float Point Instructions*, handling single float only, and
aliased accesses for 32-bit FPUs.
- Some cleanup in FP instruction formats and FP register classes.
- Calling conventions improved to support mips 32-bit EABI.
- Added Asm Printer support for fp cond codes.
- Added support for sret copy to a return register.
- EABI support added into LowerCALL and FORMAL_ARGS.
- MipsFunctionInfo now keeps a virtual register per function to track the
sret on function entry until function ret.
- MipsInstrInfo FP support into methods (isMoveInstr, isLoadFromStackSlot, ...),
FP cond codes mapping and initial FP Branch Analysis.
- Two new Mips SDNode to handle fp branch and compare instructions : FPBrcond,
FPCmp
- MipsTargetLowering : handling different FP classes, Allegrex support, sret
return copy, no homing location within EABI, non 32-bit stack objects
arguments, and asm constraint for float.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@53146 91177308-0d34-0410-b5e6-96231b3b80d8
2008-07-05 19:05:21 +00:00
|
|
|
FPBrcond,
|
|
|
|
|
2008-07-09 04:45:36 +00:00
|
|
|
// Floating Point Compare
|
Several changes to Mips backend, experimental fp support being the most
important.
- Cleanup in the Subtarget info with addition of new features, not all support
yet, but they allow the future inclusion of features easier. Among new features,
we have : Arch family info (mips1, mips2, ...), ABI info (o32, eabi), 64-bit
integer
and float registers, allegrex vector FPU (VFPU), single float only support.
- TargetMachine now detects allegrex core.
- Added allegrex (Mips32r2) sext_inreg instructions.
- *Added Float Point Instructions*, handling single float only, and
aliased accesses for 32-bit FPUs.
- Some cleanup in FP instruction formats and FP register classes.
- Calling conventions improved to support mips 32-bit EABI.
- Added Asm Printer support for fp cond codes.
- Added support for sret copy to a return register.
- EABI support added into LowerCALL and FORMAL_ARGS.
- MipsFunctionInfo now keeps a virtual register per function to track the
sret on function entry until function ret.
- MipsInstrInfo FP support into methods (isMoveInstr, isLoadFromStackSlot, ...),
FP cond codes mapping and initial FP Branch Analysis.
- Two new Mips SDNode to handle fp branch and compare instructions : FPBrcond,
FPCmp
- MipsTargetLowering : handling different FP classes, Allegrex support, sret
return copy, no homing location within EABI, non 32-bit stack objects
arguments, and asm constraint for float.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@53146 91177308-0d34-0410-b5e6-96231b3b80d8
2008-07-05 19:05:21 +00:00
|
|
|
FPCmp,
|
|
|
|
|
2011-03-31 18:26:17 +00:00
|
|
|
// Floating Point Conditional Moves
|
|
|
|
CMovFP_T,
|
|
|
|
CMovFP_F,
|
|
|
|
|
2009-05-27 17:23:44 +00:00
|
|
|
// Floating Point Rounding
|
|
|
|
FPRound,
|
|
|
|
|
2011-03-04 17:51:39 +00:00
|
|
|
// Return
|
2011-01-18 19:29:17 +00:00
|
|
|
Ret,
|
|
|
|
|
2013-01-30 00:26:49 +00:00
|
|
|
EH_RETURN,
|
|
|
|
|
2013-03-30 01:14:04 +00:00
|
|
|
// Node used to extract integer from accumulator.
|
|
|
|
ExtractLOHI,
|
|
|
|
|
|
|
|
// Node used to insert integers to accumulator.
|
|
|
|
InsertLOHI,
|
|
|
|
|
|
|
|
// Mult nodes.
|
|
|
|
Mult,
|
|
|
|
Multu,
|
|
|
|
|
2011-01-18 19:29:17 +00:00
|
|
|
// MAdd/Sub nodes
|
|
|
|
MAdd,
|
|
|
|
MAddu,
|
|
|
|
MSub,
|
2011-03-04 21:03:24 +00:00
|
|
|
MSubu,
|
|
|
|
|
|
|
|
// DivRem(u)
|
|
|
|
DivRem,
|
2011-04-15 19:52:08 +00:00
|
|
|
DivRemU,
|
2013-03-30 01:14:04 +00:00
|
|
|
DivRem16,
|
|
|
|
DivRemU16,
|
2011-04-15 19:52:08 +00:00
|
|
|
|
|
|
|
BuildPairF64,
|
2011-05-28 01:07:07 +00:00
|
|
|
ExtractElementF64,
|
|
|
|
|
2011-12-09 01:53:17 +00:00
|
|
|
Wrapper,
|
2011-06-21 00:40:49 +00:00
|
|
|
|
2011-07-19 23:30:50 +00:00
|
|
|
DynAlloc,
|
|
|
|
|
2011-08-17 02:05:42 +00:00
|
|
|
Sync,
|
|
|
|
|
|
|
|
Ext,
|
2012-06-02 00:03:12 +00:00
|
|
|
Ins,
|
|
|
|
|
2012-09-21 23:52:47 +00:00
|
|
|
// EXTR.W instrinsic nodes.
|
|
|
|
EXTP,
|
|
|
|
EXTPDP,
|
|
|
|
EXTR_S_H,
|
|
|
|
EXTR_W,
|
|
|
|
EXTR_R_W,
|
|
|
|
EXTR_RS_W,
|
|
|
|
SHILO,
|
|
|
|
MTHLIP,
|
|
|
|
|
|
|
|
// DPA.W intrinsic nodes.
|
|
|
|
MULSAQ_S_W_PH,
|
|
|
|
MAQ_S_W_PHL,
|
|
|
|
MAQ_S_W_PHR,
|
|
|
|
MAQ_SA_W_PHL,
|
|
|
|
MAQ_SA_W_PHR,
|
|
|
|
DPAU_H_QBL,
|
|
|
|
DPAU_H_QBR,
|
|
|
|
DPSU_H_QBL,
|
|
|
|
DPSU_H_QBR,
|
|
|
|
DPAQ_S_W_PH,
|
|
|
|
DPSQ_S_W_PH,
|
|
|
|
DPAQ_SA_L_W,
|
|
|
|
DPSQ_SA_L_W,
|
|
|
|
DPA_W_PH,
|
|
|
|
DPS_W_PH,
|
|
|
|
DPAQX_S_W_PH,
|
|
|
|
DPAQX_SA_W_PH,
|
|
|
|
DPAX_W_PH,
|
|
|
|
DPSX_W_PH,
|
|
|
|
DPSQX_S_W_PH,
|
|
|
|
DPSQX_SA_W_PH,
|
|
|
|
MULSA_W_PH,
|
|
|
|
|
|
|
|
MULT,
|
|
|
|
MULTU,
|
|
|
|
MADD_DSP,
|
|
|
|
MADDU_DSP,
|
|
|
|
MSUB_DSP,
|
|
|
|
MSUBU_DSP,
|
|
|
|
|
2013-04-19 23:21:32 +00:00
|
|
|
// DSP shift nodes.
|
|
|
|
SHLL_DSP,
|
|
|
|
SHRA_DSP,
|
|
|
|
SHRL_DSP,
|
|
|
|
|
2013-04-30 22:37:26 +00:00
|
|
|
// DSP setcc and select_cc nodes.
|
|
|
|
SETCC_DSP,
|
|
|
|
SELECT_CC_DSP,
|
|
|
|
|
2012-06-02 00:03:12 +00:00
|
|
|
// Load/Store Left/Right nodes.
|
|
|
|
LWL = ISD::FIRST_TARGET_MEMORY_OPCODE,
|
|
|
|
LWR,
|
|
|
|
SWL,
|
|
|
|
SWR,
|
|
|
|
LDL,
|
|
|
|
LDR,
|
|
|
|
SDL,
|
|
|
|
SDR
|
2007-06-06 07:42:06 +00:00
|
|
|
};
|
|
|
|
}
|
|
|
|
|
2011-04-15 21:51:11 +00:00
|
|
|
//===--------------------------------------------------------------------===//
|
2007-06-06 07:42:06 +00:00
|
|
|
// TargetLowering Implementation
|
2011-04-15 21:51:11 +00:00
|
|
|
//===--------------------------------------------------------------------===//
|
2012-10-30 20:16:31 +00:00
|
|
|
class MipsFunctionInfo;
|
2011-03-04 17:51:39 +00:00
|
|
|
|
2009-08-13 05:41:27 +00:00
|
|
|
class MipsTargetLowering : public TargetLowering {
|
2007-06-06 07:42:06 +00:00
|
|
|
public:
|
2007-08-02 21:21:54 +00:00
|
|
|
explicit MipsTargetLowering(MipsTargetMachine &TM);
|
2007-06-06 07:42:06 +00:00
|
|
|
|
2013-03-13 00:54:29 +00:00
|
|
|
static const MipsTargetLowering *create(MipsTargetMachine &TM);
|
2011-11-07 18:59:49 +00:00
|
|
|
|
2013-03-13 00:54:29 +00:00
|
|
|
virtual MVT getScalarShiftAmountTy(EVT LHSTy) const { return MVT::i32; }
|
2011-08-12 21:30:06 +00:00
|
|
|
|
2012-09-21 23:58:31 +00:00
|
|
|
virtual void LowerOperationWrapper(SDNode *N,
|
|
|
|
SmallVectorImpl<SDValue> &Results,
|
|
|
|
SelectionDAG &DAG) const;
|
|
|
|
|
2007-06-06 07:42:06 +00:00
|
|
|
/// LowerOperation - Provide custom lowering hooks for some operations.
|
2010-04-17 15:26:15 +00:00
|
|
|
virtual SDValue LowerOperation(SDValue Op, SelectionDAG &DAG) const;
|
2007-06-06 07:42:06 +00:00
|
|
|
|
2012-09-21 23:58:31 +00:00
|
|
|
/// ReplaceNodeResults - Replace the results of node with an illegal result
|
|
|
|
/// type with new values built out of custom code.
|
|
|
|
///
|
|
|
|
virtual void ReplaceNodeResults(SDNode *N, SmallVectorImpl<SDValue>&Results,
|
|
|
|
SelectionDAG &DAG) const;
|
|
|
|
|
2011-03-04 17:51:39 +00:00
|
|
|
/// getTargetNodeName - This method returns the name of a target specific
|
2007-06-06 07:42:06 +00:00
|
|
|
// DAG node.
|
|
|
|
virtual const char *getTargetNodeName(unsigned Opcode) const;
|
|
|
|
|
2008-03-10 15:42:14 +00:00
|
|
|
/// getSetCCResultType - get the ISD::SETCC result ValueType
|
2011-09-06 19:07:46 +00:00
|
|
|
EVT getSetCCResultType(EVT VT) const;
|
2008-03-10 15:42:14 +00:00
|
|
|
|
2011-03-04 17:51:39 +00:00
|
|
|
virtual SDValue PerformDAGCombine(SDNode *N, DAGCombinerInfo &DCI) const;
|
2012-10-26 23:56:38 +00:00
|
|
|
|
2013-03-13 00:54:29 +00:00
|
|
|
virtual MachineBasicBlock *
|
|
|
|
EmitInstrWithCustomInserter(MachineInstr *MI, MachineBasicBlock *MBB) const;
|
|
|
|
|
|
|
|
struct LTStr {
|
|
|
|
bool operator()(const char *S1, const char *S2) const {
|
|
|
|
return strcmp(S1, S2) < 0;
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
protected:
|
|
|
|
SDValue getGlobalReg(SelectionDAG &DAG, EVT Ty) const;
|
2013-01-28 02:46:49 +00:00
|
|
|
|
2013-03-13 00:54:29 +00:00
|
|
|
SDValue getAddrLocal(SDValue Op, SelectionDAG &DAG, bool HasMips64) const;
|
2012-12-15 00:20:05 +00:00
|
|
|
|
2013-03-13 00:54:29 +00:00
|
|
|
SDValue getAddrGlobal(SDValue Op, SelectionDAG &DAG, unsigned Flag) const;
|
2013-01-24 04:24:02 +00:00
|
|
|
|
2013-03-13 00:54:29 +00:00
|
|
|
SDValue getAddrGlobalLargeGOT(SDValue Op, SelectionDAG &DAG,
|
|
|
|
unsigned HiFlag, unsigned LoFlag) const;
|
|
|
|
|
|
|
|
/// This function fills Ops, which is the list of operands that will later
|
|
|
|
/// be used when a function call node is created. It also generates
|
|
|
|
/// copyToReg nodes to set up argument registers.
|
|
|
|
virtual void
|
|
|
|
getOpndList(SmallVectorImpl<SDValue> &Ops,
|
|
|
|
std::deque< std::pair<unsigned, SDValue> > &RegsToPass,
|
|
|
|
bool IsPICCall, bool GlobalOrExternal, bool InternalLinkage,
|
|
|
|
CallLoweringInfo &CLI, SDValue Callee, SDValue Chain) const;
|
2013-01-24 04:24:02 +00:00
|
|
|
|
2012-10-26 23:56:38 +00:00
|
|
|
/// ByValArgInfo - Byval argument information.
|
|
|
|
struct ByValArgInfo {
|
|
|
|
unsigned FirstIdx; // Index of the first register used.
|
|
|
|
unsigned NumRegs; // Number of registers used for this argument.
|
|
|
|
unsigned Address; // Offset of the stack area used to pass this argument.
|
|
|
|
|
|
|
|
ByValArgInfo() : FirstIdx(0), NumRegs(0), Address(0) {}
|
|
|
|
};
|
|
|
|
|
|
|
|
/// MipsCC - This class provides methods used to analyze formal and call
|
|
|
|
/// arguments and inquire about calling convention information.
|
|
|
|
class MipsCC {
|
|
|
|
public:
|
2013-02-15 21:45:11 +00:00
|
|
|
MipsCC(CallingConv::ID CallConv, bool IsO32, CCState &Info);
|
2012-10-26 23:56:38 +00:00
|
|
|
|
2013-02-15 21:45:11 +00:00
|
|
|
void analyzeCallOperands(const SmallVectorImpl<ISD::OutputArg> &Outs,
|
2013-03-05 22:20:28 +00:00
|
|
|
bool IsVarArg, bool IsSoftFloat,
|
|
|
|
const SDNode *CallNode,
|
|
|
|
std::vector<ArgListEntry> &FuncArgs);
|
2013-03-05 22:13:04 +00:00
|
|
|
void analyzeFormalArguments(const SmallVectorImpl<ISD::InputArg> &Ins,
|
|
|
|
bool IsSoftFloat,
|
|
|
|
Function::const_arg_iterator FuncArg);
|
2013-03-05 22:41:55 +00:00
|
|
|
|
|
|
|
void analyzeCallResult(const SmallVectorImpl<ISD::InputArg> &Ins,
|
|
|
|
bool IsSoftFloat, const SDNode *CallNode,
|
|
|
|
const Type *RetTy) const;
|
|
|
|
|
|
|
|
void analyzeReturn(const SmallVectorImpl<ISD::OutputArg> &Outs,
|
|
|
|
bool IsSoftFloat, const Type *RetTy) const;
|
|
|
|
|
2012-10-26 23:56:38 +00:00
|
|
|
const CCState &getCCInfo() const { return CCInfo; }
|
|
|
|
|
|
|
|
/// hasByValArg - Returns true if function has byval arguments.
|
|
|
|
bool hasByValArg() const { return !ByValArgs.empty(); }
|
|
|
|
|
|
|
|
/// regSize - Size (in number of bits) of integer registers.
|
2013-02-15 21:45:11 +00:00
|
|
|
unsigned regSize() const { return IsO32 ? 4 : 8; }
|
2012-10-26 23:56:38 +00:00
|
|
|
|
|
|
|
/// numIntArgRegs - Number of integer registers available for calls.
|
2013-02-15 21:45:11 +00:00
|
|
|
unsigned numIntArgRegs() const;
|
2012-10-26 23:56:38 +00:00
|
|
|
|
|
|
|
/// reservedArgArea - The size of the area the caller reserves for
|
|
|
|
/// register arguments. This is 16-byte if ABI is O32.
|
2013-02-15 21:45:11 +00:00
|
|
|
unsigned reservedArgArea() const;
|
2012-10-26 23:56:38 +00:00
|
|
|
|
2013-02-15 21:45:11 +00:00
|
|
|
/// Return pointer to array of integer argument registers.
|
|
|
|
const uint16_t *intArgRegs() const;
|
2012-10-26 23:56:38 +00:00
|
|
|
|
|
|
|
typedef SmallVector<ByValArgInfo, 2>::const_iterator byval_iterator;
|
|
|
|
byval_iterator byval_begin() const { return ByValArgs.begin(); }
|
|
|
|
byval_iterator byval_end() const { return ByValArgs.end(); }
|
|
|
|
|
|
|
|
private:
|
2013-02-15 21:45:11 +00:00
|
|
|
void handleByValArg(unsigned ValNo, MVT ValVT, MVT LocVT,
|
|
|
|
CCValAssign::LocInfo LocInfo,
|
|
|
|
ISD::ArgFlagsTy ArgFlags);
|
|
|
|
|
|
|
|
/// useRegsForByval - Returns true if the calling convention allows the
|
|
|
|
/// use of registers to pass byval arguments.
|
|
|
|
bool useRegsForByval() const { return CallConv != CallingConv::Fast; }
|
|
|
|
|
|
|
|
/// Return the function that analyzes fixed argument list functions.
|
|
|
|
llvm::CCAssignFn *fixedArgFn() const;
|
|
|
|
|
|
|
|
/// Return the function that analyzes variable argument list functions.
|
|
|
|
llvm::CCAssignFn *varArgFn() const;
|
|
|
|
|
|
|
|
const uint16_t *shadowRegs() const;
|
|
|
|
|
2012-10-26 23:56:38 +00:00
|
|
|
void allocateRegs(ByValArgInfo &ByVal, unsigned ByValSize,
|
|
|
|
unsigned Align);
|
|
|
|
|
2013-03-05 22:13:04 +00:00
|
|
|
/// Return the type of the register which is used to pass an argument or
|
|
|
|
/// return a value. This function returns f64 if the argument is an i64
|
|
|
|
/// value which has been generated as a result of softening an f128 value.
|
|
|
|
/// Otherwise, it just returns VT.
|
|
|
|
MVT getRegVT(MVT VT, const Type *OrigTy, const SDNode *CallNode,
|
|
|
|
bool IsSoftFloat) const;
|
|
|
|
|
2013-03-05 22:41:55 +00:00
|
|
|
template<typename Ty>
|
|
|
|
void analyzeReturn(const SmallVectorImpl<Ty> &RetVals, bool IsSoftFloat,
|
|
|
|
const SDNode *CallNode, const Type *RetTy) const;
|
|
|
|
|
2012-10-26 23:56:38 +00:00
|
|
|
CCState &CCInfo;
|
2013-02-15 21:45:11 +00:00
|
|
|
CallingConv::ID CallConv;
|
|
|
|
bool IsO32;
|
2012-10-26 23:56:38 +00:00
|
|
|
SmallVector<ByValArgInfo, 2> ByValArgs;
|
|
|
|
};
|
|
|
|
|
Several changes to Mips backend, experimental fp support being the most
important.
- Cleanup in the Subtarget info with addition of new features, not all support
yet, but they allow the future inclusion of features easier. Among new features,
we have : Arch family info (mips1, mips2, ...), ABI info (o32, eabi), 64-bit
integer
and float registers, allegrex vector FPU (VFPU), single float only support.
- TargetMachine now detects allegrex core.
- Added allegrex (Mips32r2) sext_inreg instructions.
- *Added Float Point Instructions*, handling single float only, and
aliased accesses for 32-bit FPUs.
- Some cleanup in FP instruction formats and FP register classes.
- Calling conventions improved to support mips 32-bit EABI.
- Added Asm Printer support for fp cond codes.
- Added support for sret copy to a return register.
- EABI support added into LowerCALL and FORMAL_ARGS.
- MipsFunctionInfo now keeps a virtual register per function to track the
sret on function entry until function ret.
- MipsInstrInfo FP support into methods (isMoveInstr, isLoadFromStackSlot, ...),
FP cond codes mapping and initial FP Branch Analysis.
- Two new Mips SDNode to handle fp branch and compare instructions : FPBrcond,
FPCmp
- MipsTargetLowering : handling different FP classes, Allegrex support, sret
return copy, no homing location within EABI, non 32-bit stack objects
arguments, and asm constraint for float.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@53146 91177308-0d34-0410-b5e6-96231b3b80d8
2008-07-05 19:05:21 +00:00
|
|
|
// Subtarget Info
|
|
|
|
const MipsSubtarget *Subtarget;
|
2012-02-28 07:46:26 +00:00
|
|
|
|
2011-10-28 18:47:24 +00:00
|
|
|
bool HasMips64, IsN64, IsO32;
|
2009-08-13 05:41:27 +00:00
|
|
|
|
2013-03-13 00:54:29 +00:00
|
|
|
private:
|
2007-06-06 07:42:06 +00:00
|
|
|
// Lower Operand helpers
|
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.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@78142 91177308-0d34-0410-b5e6-96231b3b80d8
2009-08-05 01:29:28 +00:00
|
|
|
SDValue LowerCallResult(SDValue Chain, SDValue InFlag,
|
2009-09-02 08:44:58 +00: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.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@78142 91177308-0d34-0410-b5e6-96231b3b80d8
2009-08-05 01:29:28 +00:00
|
|
|
const SmallVectorImpl<ISD::InputArg> &Ins,
|
|
|
|
DebugLoc dl, SelectionDAG &DAG,
|
2013-03-05 22:41:55 +00:00
|
|
|
SmallVectorImpl<SDValue> &InVals,
|
|
|
|
const SDNode *CallNode, const Type *RetTy) const;
|
2007-06-06 07:42:06 +00:00
|
|
|
|
|
|
|
// Lower Operand specifics
|
2013-03-12 00:16:36 +00:00
|
|
|
SDValue lowerBR_JT(SDValue Op, SelectionDAG &DAG) const;
|
|
|
|
SDValue lowerBRCOND(SDValue Op, SelectionDAG &DAG) const;
|
|
|
|
SDValue lowerConstantPool(SDValue Op, SelectionDAG &DAG) const;
|
|
|
|
SDValue lowerGlobalAddress(SDValue Op, SelectionDAG &DAG) const;
|
|
|
|
SDValue lowerBlockAddress(SDValue Op, SelectionDAG &DAG) const;
|
|
|
|
SDValue lowerGlobalTLSAddress(SDValue Op, SelectionDAG &DAG) const;
|
|
|
|
SDValue lowerJumpTable(SDValue Op, SelectionDAG &DAG) const;
|
|
|
|
SDValue lowerSELECT(SDValue Op, SelectionDAG &DAG) const;
|
|
|
|
SDValue lowerSELECT_CC(SDValue Op, SelectionDAG &DAG) const;
|
|
|
|
SDValue lowerSETCC(SDValue Op, SelectionDAG &DAG) const;
|
|
|
|
SDValue lowerVASTART(SDValue Op, SelectionDAG &DAG) const;
|
|
|
|
SDValue lowerFCOPYSIGN(SDValue Op, SelectionDAG &DAG) const;
|
|
|
|
SDValue lowerFABS(SDValue Op, SelectionDAG &DAG) const;
|
|
|
|
SDValue lowerFRAMEADDR(SDValue Op, SelectionDAG &DAG) const;
|
|
|
|
SDValue lowerRETURNADDR(SDValue Op, SelectionDAG &DAG) const;
|
|
|
|
SDValue lowerEH_RETURN(SDValue Op, SelectionDAG &DAG) const;
|
|
|
|
SDValue lowerATOMIC_FENCE(SDValue Op, SelectionDAG& DAG) const;
|
|
|
|
SDValue lowerShiftLeftParts(SDValue Op, SelectionDAG& DAG) const;
|
|
|
|
SDValue lowerShiftRightParts(SDValue Op, SelectionDAG& DAG,
|
2012-06-14 21:10:56 +00:00
|
|
|
bool IsSRA) const;
|
2013-03-12 00:16:36 +00:00
|
|
|
SDValue lowerLOAD(SDValue Op, SelectionDAG &DAG) const;
|
|
|
|
SDValue lowerSTORE(SDValue Op, SelectionDAG &DAG) const;
|
|
|
|
SDValue lowerADD(SDValue Op, SelectionDAG &DAG) const;
|
2008-06-06 00:58:26 +00:00
|
|
|
|
2013-03-12 00:16:36 +00:00
|
|
|
/// isEligibleForTailCallOptimization - Check whether the call is eligible
|
2012-10-19 21:47:33 +00:00
|
|
|
/// for tail call optimization.
|
2013-03-13 00:54:29 +00:00
|
|
|
virtual bool
|
|
|
|
isEligibleForTailCallOptimization(const MipsCC &MipsCCInfo,
|
|
|
|
unsigned NextStackOffset,
|
|
|
|
const MipsFunctionInfo& FI) const = 0;
|
2012-10-19 21:47:33 +00:00
|
|
|
|
2012-10-27 00:10:18 +00:00
|
|
|
/// copyByValArg - Copy argument registers which were used to pass a byval
|
|
|
|
/// argument to the stack. Create a stack frame object for the byval
|
|
|
|
/// argument.
|
|
|
|
void copyByValRegs(SDValue Chain, DebugLoc DL,
|
|
|
|
std::vector<SDValue> &OutChains, SelectionDAG &DAG,
|
|
|
|
const ISD::ArgFlagsTy &Flags,
|
|
|
|
SmallVectorImpl<SDValue> &InVals,
|
|
|
|
const Argument *FuncArg,
|
|
|
|
const MipsCC &CC, const ByValArgInfo &ByVal) const;
|
|
|
|
|
2012-10-27 00:16:36 +00:00
|
|
|
/// passByValArg - Pass a byval argument in registers or on stack.
|
|
|
|
void passByValArg(SDValue Chain, DebugLoc DL,
|
2013-01-22 20:05:56 +00:00
|
|
|
std::deque< std::pair<unsigned, SDValue> > &RegsToPass,
|
2012-10-27 00:16:36 +00:00
|
|
|
SmallVector<SDValue, 8> &MemOpChains, SDValue StackPtr,
|
|
|
|
MachineFrameInfo *MFI, SelectionDAG &DAG, SDValue Arg,
|
|
|
|
const MipsCC &CC, const ByValArgInfo &ByVal,
|
|
|
|
const ISD::ArgFlagsTy &Flags, bool isLittle) const;
|
|
|
|
|
2012-10-27 00:21:13 +00:00
|
|
|
/// writeVarArgRegs - Write variable function arguments passed in registers
|
|
|
|
/// to the stack. Also create a stack frame object for the first variable
|
|
|
|
/// argument.
|
|
|
|
void writeVarArgRegs(std::vector<SDValue> &OutChains, const MipsCC &CC,
|
|
|
|
SDValue Chain, DebugLoc DL, SelectionDAG &DAG) 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.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@78142 91177308-0d34-0410-b5e6-96231b3b80d8
2009-08-05 01:29:28 +00:00
|
|
|
virtual SDValue
|
|
|
|
LowerFormalArguments(SDValue Chain,
|
2009-09-02 08:44:58 +00: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.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@78142 91177308-0d34-0410-b5e6-96231b3b80d8
2009-08-05 01:29:28 +00:00
|
|
|
const SmallVectorImpl<ISD::InputArg> &Ins,
|
|
|
|
DebugLoc dl, SelectionDAG &DAG,
|
2010-04-17 15:26:15 +00:00
|
|
|
SmallVectorImpl<SDValue> &InVals) 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.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@78142 91177308-0d34-0410-b5e6-96231b3b80d8
2009-08-05 01:29:28 +00:00
|
|
|
|
2012-10-30 19:23:25 +00:00
|
|
|
SDValue passArgOnStack(SDValue StackPtr, unsigned Offset, SDValue Chain,
|
|
|
|
SDValue Arg, DebugLoc DL, bool IsTailCall,
|
|
|
|
SelectionDAG &DAG) 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.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@78142 91177308-0d34-0410-b5e6-96231b3b80d8
2009-08-05 01:29:28 +00:00
|
|
|
virtual SDValue
|
2012-05-25 16:35:28 +00:00
|
|
|
LowerCall(TargetLowering::CallLoweringInfo &CLI,
|
2010-04-17 15:26:15 +00:00
|
|
|
SmallVectorImpl<SDValue> &InVals) 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.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@78142 91177308-0d34-0410-b5e6-96231b3b80d8
2009-08-05 01:29:28 +00:00
|
|
|
|
2012-10-10 01:27:09 +00:00
|
|
|
virtual bool
|
|
|
|
CanLowerReturn(CallingConv::ID CallConv, MachineFunction &MF,
|
|
|
|
bool isVarArg,
|
|
|
|
const SmallVectorImpl<ISD::OutputArg> &Outs,
|
|
|
|
LLVMContext &Context) 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.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@78142 91177308-0d34-0410-b5e6-96231b3b80d8
2009-08-05 01:29:28 +00:00
|
|
|
virtual SDValue
|
|
|
|
LowerReturn(SDValue Chain,
|
2009-09-02 08:44:58 +00: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.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@78142 91177308-0d34-0410-b5e6-96231b3b80d8
2009-08-05 01:29:28 +00:00
|
|
|
const SmallVectorImpl<ISD::OutputArg> &Outs,
|
2010-07-07 15:54:55 +00:00
|
|
|
const SmallVectorImpl<SDValue> &OutVals,
|
2010-04-17 15:26:15 +00:00
|
|
|
DebugLoc dl, SelectionDAG &DAG) 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.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@78142 91177308-0d34-0410-b5e6-96231b3b80d8
2009-08-05 01:29:28 +00:00
|
|
|
|
2007-08-21 16:09:25 +00:00
|
|
|
// Inline asm support
|
|
|
|
ConstraintType getConstraintType(const std::string &Constraint) const;
|
|
|
|
|
2011-04-15 21:51:11 +00:00
|
|
|
/// Examine constraint string and operand type and determine a weight value.
|
|
|
|
/// The operand object must already have been set up with the operand type.
|
2010-10-29 17:29:13 +00:00
|
|
|
ConstraintWeight getSingleConstraintMatchWeight(
|
|
|
|
AsmOperandInfo &info, const char *constraint) const;
|
|
|
|
|
2011-03-04 17:51:39 +00:00
|
|
|
std::pair<unsigned, const TargetRegisterClass*>
|
2007-08-21 16:09:25 +00:00
|
|
|
getRegForInlineAsmConstraint(const std::string &Constraint,
|
2009-08-10 22:56:29 +00:00
|
|
|
EVT VT) const;
|
2007-08-21 16:09:25 +00:00
|
|
|
|
2012-05-07 03:13:32 +00:00
|
|
|
/// LowerAsmOperandForConstraint - 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'.
|
|
|
|
virtual void LowerAsmOperandForConstraint(SDValue Op,
|
|
|
|
std::string &Constraint,
|
|
|
|
std::vector<SDValue> &Ops,
|
|
|
|
SelectionDAG &DAG) const;
|
|
|
|
|
2012-11-17 00:25:41 +00:00
|
|
|
virtual bool isLegalAddressingMode(const AddrMode &AM, Type *Ty) const;
|
|
|
|
|
Teach DAGCombine to fold constant offsets into GlobalAddress nodes,
and add a TargetLowering hook for it to use to determine when this
is legal (i.e. not in PIC mode, etc.)
This allows instruction selection to emit folded constant offsets
in more cases, such as the included testcase, eliminating the need
for explicit arithmetic instructions.
This eliminates the need for the C++ code in X86ISelDAGToDAG.cpp
that attempted to achieve the same effect, but wasn't as effective.
Also, fix handling of offsets in GlobalAddressSDNodes in several
places, including changing GlobalAddressSDNode's offset from
int to int64_t.
The Mips, Alpha, Sparc, and CellSPU targets appear to be
unaware of GlobalAddress offsets currently, so set the hook to
false on those targets.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@57748 91177308-0d34-0410-b5e6-96231b3b80d8
2008-10-18 02:06:02 +00:00
|
|
|
virtual bool isOffsetFoldingLegal(const GlobalAddressSDNode *GA) const;
|
2009-10-27 19:56:55 +00:00
|
|
|
|
2012-06-13 19:33:32 +00:00
|
|
|
virtual EVT getOptimalMemOpType(uint64_t Size, unsigned DstAlign,
|
2012-12-12 02:34:41 +00:00
|
|
|
unsigned SrcAlign,
|
|
|
|
bool IsMemset, bool ZeroMemset,
|
2012-06-13 19:33:32 +00:00
|
|
|
bool MemcpyStrSrc,
|
|
|
|
MachineFunction &MF) const;
|
|
|
|
|
2009-10-27 19:56:55 +00:00
|
|
|
/// isFPImmLegal - Returns true if the target can instruction select the
|
|
|
|
/// specified FP immediate natively. If false, the legalizer will
|
|
|
|
/// materialize the FP immediate as a load from a constant pool.
|
2009-10-28 01:43:28 +00:00
|
|
|
virtual bool isFPImmLegal(const APFloat &Imm, EVT VT) const;
|
2011-05-31 02:54:07 +00:00
|
|
|
|
2012-02-03 04:33:00 +00:00
|
|
|
virtual unsigned getJumpTableEncoding() const;
|
|
|
|
|
2013-03-12 00:16:36 +00:00
|
|
|
MachineBasicBlock *emitAtomicBinary(MachineInstr *MI, MachineBasicBlock *BB,
|
2011-05-31 02:54:07 +00:00
|
|
|
unsigned Size, unsigned BinOpcode, bool Nand = false) const;
|
2013-03-12 00:16:36 +00:00
|
|
|
MachineBasicBlock *emitAtomicBinaryPartword(MachineInstr *MI,
|
2011-05-31 02:54:07 +00:00
|
|
|
MachineBasicBlock *BB, unsigned Size, unsigned BinOpcode,
|
|
|
|
bool Nand = false) const;
|
2013-03-12 00:16:36 +00:00
|
|
|
MachineBasicBlock *emitAtomicCmpSwap(MachineInstr *MI,
|
2011-05-31 02:54:07 +00:00
|
|
|
MachineBasicBlock *BB, unsigned Size) const;
|
2013-03-12 00:16:36 +00:00
|
|
|
MachineBasicBlock *emitAtomicCmpSwapPartword(MachineInstr *MI,
|
2011-05-31 02:54:07 +00:00
|
|
|
MachineBasicBlock *BB, unsigned Size) const;
|
2007-06-06 07:42:06 +00:00
|
|
|
};
|
2013-03-13 00:54:29 +00:00
|
|
|
|
|
|
|
/// Create MipsTargetLowering objects.
|
|
|
|
const MipsTargetLowering *createMips16TargetLowering(MipsTargetMachine &TM);
|
|
|
|
const MipsTargetLowering *createMipsSETargetLowering(MipsTargetMachine &TM);
|
2007-06-06 07:42:06 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
#endif // MipsISELLOWERING_H
|