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
|
|
|
|
2014-08-13 16:26:38 +00:00
|
|
|
#ifndef LLVM_LIB_TARGET_MIPS_MIPSISELLOWERING_H
|
|
|
|
#define LLVM_LIB_TARGET_MIPS_MIPSISELLOWERING_H
|
2007-06-06 07:42:06 +00:00
|
|
|
|
2015-01-29 23:27:36 +00:00
|
|
|
#include "MCTargetDesc/MipsABIInfo.h"
|
2014-01-07 11:48:04 +00:00
|
|
|
#include "MCTargetDesc/MipsBaseInfo.h"
|
2007-06-06 07:42:06 +00:00
|
|
|
#include "Mips.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,
|
|
|
|
|
2013-05-16 21:17:15 +00:00
|
|
|
// FP-to-int truncation node.
|
|
|
|
TruncIntFP,
|
|
|
|
|
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.
|
2013-10-15 01:12:50 +00:00
|
|
|
MFHI,
|
|
|
|
MFLO,
|
2013-03-30 01:14:04 +00:00
|
|
|
|
|
|
|
// Node used to insert integers to accumulator.
|
2013-10-15 01:12:50 +00:00
|
|
|
MTLOHI,
|
2013-03-30 01:14:04 +00:00
|
|
|
|
|
|
|
// 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,
|
|
|
|
|
2013-09-23 12:02:46 +00:00
|
|
|
// Vector comparisons.
|
2013-09-24 10:46:19 +00:00
|
|
|
// These take a vector and return a boolean.
|
2013-08-28 12:14:50 +00:00
|
|
|
VALL_ZERO,
|
|
|
|
VANY_ZERO,
|
|
|
|
VALL_NONZERO,
|
|
|
|
VANY_NONZERO,
|
|
|
|
|
2013-09-24 10:46:19 +00:00
|
|
|
// These take a vector and return a vector bitmask.
|
|
|
|
VCEQ,
|
|
|
|
VCLE_S,
|
|
|
|
VCLE_U,
|
|
|
|
VCLT_S,
|
|
|
|
VCLT_U,
|
|
|
|
|
2013-09-24 12:18:31 +00:00
|
|
|
// Element-wise vector max/min.
|
|
|
|
VSMAX,
|
|
|
|
VSMIN,
|
|
|
|
VUMAX,
|
|
|
|
VUMIN,
|
|
|
|
|
2013-09-24 14:02:15 +00:00
|
|
|
// Vector Shuffle with mask as an operand
|
|
|
|
VSHF, // Generic shuffle
|
2013-09-24 14:20:00 +00:00
|
|
|
SHF, // 4-element set shuffle.
|
2013-09-24 14:36:12 +00:00
|
|
|
ILVEV, // Interleave even elements
|
|
|
|
ILVOD, // Interleave odd elements
|
|
|
|
ILVL, // Interleave left elements
|
|
|
|
ILVR, // Interleave right elements
|
2013-09-24 14:53:25 +00:00
|
|
|
PCKEV, // Pack even elements
|
|
|
|
PCKOD, // Pack odd elements
|
2013-09-24 14:02:15 +00:00
|
|
|
|
[mips] Rewrite MipsAsmParser and MipsOperand.
Summary:
Highlights:
- Registers are resolved much later (by the render method).
Prior to that point, GPR32's/GPR64's are GPR's regardless of register
size. Similarly FGR32's/FGR64's/AFGR64's are FGR's regardless of register
size or FR mode. Numeric registers can be anything.
- All registers are parsed the same way everywhere (even when handling
symbol aliasing)
- One consequence is that all registers can be specified numerically
almost anywhere (e.g. $fccX, $wX). The exception is symbol aliasing
but that can be easily resolved.
- Removes the need for the hasConsumedDollar hack
- Parenthesis and Bracket suffixes are handled generically
- Micromips instructions are parsed directly instead of going through the
standard encodings first.
- rdhwr accepts all 32 registers, and the following instructions that previously
xfailed now work:
ddiv, ddivu, div, divu, cvt.l.[ds], se[bh], wsbh, floor.w.[ds], c.ngl.d,
c.sf.s, dsbh, dshd, madd.s, msub.s, nmadd.s, nmsub.s, swxc1
- Diagnostics involving registers point at the correct character (the $)
- There's only one kind of immediate in MipsOperand. LSA immediates are handled
by the predicate and renderer.
Lowlights:
- Hardcoded '$zero' in the div patterns is handled with a hack.
MipsOperand::isReg() will return true for a k_RegisterIndex token
with Index == 0 and getReg() will return ZERO for this case. Note that it
doesn't return ZERO_64 on isGP64() targets.
- I haven't cleaned up all of the now-unused functions.
Some more of the generic parser could be removed too (integers and relocs
for example).
- insve.df needed a custom decoder to handle the implicit fourth operand that
was needed to make it parse correctly. The difficulty was that the matcher
expected a Token<'0'> but gets an Imm<0>. Adding an implicit zero solved this.
Reviewers: matheusalmeida, vmedic
Reviewed By: matheusalmeida
Differential Revision: http://llvm-reviews.chandlerc.com/D3222
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@205292 91177308-0d34-0410-b5e6-96231b3b80d8
2014-04-01 10:35:28 +00:00
|
|
|
// Vector Lane Copy
|
|
|
|
INSVE, // Copy element from one vector to another
|
|
|
|
|
2013-09-23 13:22:24 +00:00
|
|
|
// Combined (XOR (OR $a, $b), -1)
|
|
|
|
VNOR,
|
|
|
|
|
2013-09-23 14:03:12 +00:00
|
|
|
// Extended vector element extraction
|
|
|
|
VEXTRACT_SEXT_ELT,
|
|
|
|
VEXTRACT_ZEXT_ELT,
|
|
|
|
|
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;
|
2014-07-02 23:18:40 +00:00
|
|
|
class MipsSubtarget;
|
2014-11-07 15:03:53 +00:00
|
|
|
class MipsCCState;
|
2011-03-04 17:51:39 +00:00
|
|
|
|
2009-08-13 05:41:27 +00:00
|
|
|
class MipsTargetLowering : public TargetLowering {
|
2013-12-19 16:12:56 +00:00
|
|
|
bool isMicroMips;
|
2007-06-06 07:42:06 +00:00
|
|
|
public:
|
2014-09-19 23:30:42 +00:00
|
|
|
explicit MipsTargetLowering(const MipsTargetMachine &TM,
|
2014-07-18 23:25:04 +00:00
|
|
|
const MipsSubtarget &STI);
|
2007-06-06 07:42:06 +00:00
|
|
|
|
2014-09-19 23:30:42 +00:00
|
|
|
static const MipsTargetLowering *create(const MipsTargetMachine &TM,
|
2014-07-18 23:25:04 +00:00
|
|
|
const MipsSubtarget &STI);
|
2011-11-07 18:59:49 +00:00
|
|
|
|
2014-04-17 22:15:34 +00:00
|
|
|
/// createFastISel - This method returns a target specific FastISel object,
|
|
|
|
/// or null if the target does not support "fast" ISel.
|
|
|
|
FastISel *createFastISel(FunctionLoweringInfo &funcInfo,
|
|
|
|
const TargetLibraryInfo *libInfo) const override;
|
|
|
|
|
2014-04-29 07:58:02 +00:00
|
|
|
MVT getScalarShiftAmountTy(EVT LHSTy) const override { return MVT::i32; }
|
2011-08-12 21:30:06 +00:00
|
|
|
|
2014-04-29 07:58:02 +00:00
|
|
|
void LowerOperationWrapper(SDNode *N,
|
|
|
|
SmallVectorImpl<SDValue> &Results,
|
|
|
|
SelectionDAG &DAG) const override;
|
2012-09-21 23:58:31 +00:00
|
|
|
|
2007-06-06 07:42:06 +00:00
|
|
|
/// LowerOperation - Provide custom lowering hooks for some operations.
|
2014-04-29 07:58:02 +00:00
|
|
|
SDValue LowerOperation(SDValue Op, SelectionDAG &DAG) const override;
|
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.
|
|
|
|
///
|
2014-04-29 07:58:02 +00:00
|
|
|
void ReplaceNodeResults(SDNode *N, SmallVectorImpl<SDValue>&Results,
|
|
|
|
SelectionDAG &DAG) const override;
|
2012-09-21 23:58:31 +00:00
|
|
|
|
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.
|
2014-04-29 07:58:02 +00:00
|
|
|
const char *getTargetNodeName(unsigned Opcode) const override;
|
2007-06-06 07:42:06 +00:00
|
|
|
|
2008-03-10 15:42:14 +00:00
|
|
|
/// getSetCCResultType - get the ISD::SETCC result ValueType
|
2014-04-29 07:58:02 +00:00
|
|
|
EVT getSetCCResultType(LLVMContext &Context, EVT VT) const override;
|
2008-03-10 15:42:14 +00:00
|
|
|
|
2014-04-29 07:58:02 +00:00
|
|
|
SDValue PerformDAGCombine(SDNode *N, DAGCombinerInfo &DCI) const override;
|
2012-10-26 23:56:38 +00:00
|
|
|
|
2014-04-29 07:58:02 +00:00
|
|
|
MachineBasicBlock *
|
|
|
|
EmitInstrWithCustomInserter(MachineInstr *MI,
|
|
|
|
MachineBasicBlock *MBB) const override;
|
2013-03-13 00:54:29 +00:00
|
|
|
|
|
|
|
struct LTStr {
|
|
|
|
bool operator()(const char *S1, const char *S2) const {
|
|
|
|
return strcmp(S1, S2) < 0;
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
2014-11-02 16:09:29 +00:00
|
|
|
void HandleByVal(CCState *, unsigned &, unsigned) const override;
|
|
|
|
|
2015-01-09 17:21:30 +00:00
|
|
|
unsigned getRegisterByName(const char* RegName, EVT VT) const override;
|
|
|
|
|
2013-03-13 00:54:29 +00:00
|
|
|
protected:
|
|
|
|
SDValue getGlobalReg(SelectionDAG &DAG, EVT Ty) const;
|
2013-01-28 02:46:49 +00:00
|
|
|
|
2013-09-27 19:51:35 +00:00
|
|
|
// This method creates the following nodes, which are necessary for
|
|
|
|
// computing a local symbol's address:
|
|
|
|
//
|
|
|
|
// (add (load (wrapper $gp, %got(sym)), %lo(sym))
|
2014-03-26 13:59:42 +00:00
|
|
|
template <class NodeTy>
|
2015-01-24 14:35:11 +00:00
|
|
|
SDValue getAddrLocal(NodeTy *N, SDLoc DL, EVT Ty, SelectionDAG &DAG,
|
2014-03-26 13:59:42 +00:00
|
|
|
bool IsN32OrN64) const {
|
|
|
|
unsigned GOTFlag = IsN32OrN64 ? MipsII::MO_GOT_PAGE : MipsII::MO_GOT;
|
2013-09-27 19:51:35 +00:00
|
|
|
SDValue GOT = DAG.getNode(MipsISD::Wrapper, DL, Ty, getGlobalReg(DAG, Ty),
|
|
|
|
getTargetNode(N, Ty, DAG, GOTFlag));
|
|
|
|
SDValue Load = DAG.getLoad(Ty, DL, DAG.getEntryNode(), GOT,
|
|
|
|
MachinePointerInfo::getGOT(), false, false,
|
|
|
|
false, 0);
|
2014-03-26 13:59:42 +00:00
|
|
|
unsigned LoFlag = IsN32OrN64 ? MipsII::MO_GOT_OFST : MipsII::MO_ABS_LO;
|
2013-09-27 19:51:35 +00:00
|
|
|
SDValue Lo = DAG.getNode(MipsISD::Lo, DL, Ty,
|
|
|
|
getTargetNode(N, Ty, DAG, LoFlag));
|
|
|
|
return DAG.getNode(ISD::ADD, DL, Ty, Load, Lo);
|
|
|
|
}
|
|
|
|
|
|
|
|
// This method creates the following nodes, which are necessary for
|
|
|
|
// computing a global symbol's address:
|
|
|
|
//
|
|
|
|
// (load (wrapper $gp, %got(sym)))
|
2015-01-24 14:35:11 +00:00
|
|
|
template <class NodeTy>
|
|
|
|
SDValue getAddrGlobal(NodeTy *N, SDLoc DL, EVT Ty, SelectionDAG &DAG,
|
2013-09-28 00:12:32 +00:00
|
|
|
unsigned Flag, SDValue Chain,
|
|
|
|
const MachinePointerInfo &PtrInfo) const {
|
2013-09-27 19:51:35 +00:00
|
|
|
SDValue Tgt = DAG.getNode(MipsISD::Wrapper, DL, Ty, getGlobalReg(DAG, Ty),
|
|
|
|
getTargetNode(N, Ty, DAG, Flag));
|
2013-09-28 00:12:32 +00:00
|
|
|
return DAG.getLoad(Ty, DL, Chain, Tgt, PtrInfo, false, false, false, 0);
|
2013-09-27 19:51:35 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
// This method creates the following nodes, which are necessary for
|
|
|
|
// computing a global symbol's address in large-GOT mode:
|
|
|
|
//
|
|
|
|
// (load (wrapper (add %hi(sym), $gp), %lo(sym)))
|
2015-01-24 14:35:11 +00:00
|
|
|
template <class NodeTy>
|
|
|
|
SDValue getAddrGlobalLargeGOT(NodeTy *N, SDLoc DL, EVT Ty,
|
|
|
|
SelectionDAG &DAG, unsigned HiFlag,
|
|
|
|
unsigned LoFlag, SDValue Chain,
|
2013-09-28 00:12:32 +00:00
|
|
|
const MachinePointerInfo &PtrInfo) const {
|
2015-01-24 14:35:11 +00:00
|
|
|
SDValue Hi =
|
|
|
|
DAG.getNode(MipsISD::Hi, DL, Ty, getTargetNode(N, Ty, DAG, HiFlag));
|
2013-09-27 19:51:35 +00:00
|
|
|
Hi = DAG.getNode(ISD::ADD, DL, Ty, Hi, getGlobalReg(DAG, Ty));
|
|
|
|
SDValue Wrapper = DAG.getNode(MipsISD::Wrapper, DL, Ty, Hi,
|
|
|
|
getTargetNode(N, Ty, DAG, LoFlag));
|
2013-09-28 00:12:32 +00:00
|
|
|
return DAG.getLoad(Ty, DL, Chain, Wrapper, PtrInfo, false, false, false,
|
|
|
|
0);
|
2013-09-27 19:51:35 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
// This method creates the following nodes, which are necessary for
|
|
|
|
// computing a symbol's address in non-PIC mode:
|
|
|
|
//
|
|
|
|
// (add %hi(sym), %lo(sym))
|
2015-01-24 14:35:11 +00:00
|
|
|
template <class NodeTy>
|
|
|
|
SDValue getAddrNonPIC(NodeTy *N, SDLoc DL, EVT Ty,
|
|
|
|
SelectionDAG &DAG) const {
|
2013-09-27 19:51:35 +00:00
|
|
|
SDValue Hi = getTargetNode(N, Ty, DAG, MipsII::MO_ABS_HI);
|
|
|
|
SDValue Lo = getTargetNode(N, Ty, DAG, MipsII::MO_ABS_LO);
|
|
|
|
return DAG.getNode(ISD::ADD, DL, Ty,
|
|
|
|
DAG.getNode(MipsISD::Hi, DL, Ty, Hi),
|
|
|
|
DAG.getNode(MipsISD::Lo, DL, Ty, Lo));
|
|
|
|
}
|
2013-03-13 00:54:29 +00:00
|
|
|
|
2014-11-06 13:20:12 +00:00
|
|
|
// This method creates the following nodes, which are necessary for
|
|
|
|
// computing a symbol's address using gp-relative addressing:
|
|
|
|
//
|
|
|
|
// (add $gp, %gp_rel(sym))
|
2015-01-24 14:35:11 +00:00
|
|
|
template <class NodeTy>
|
|
|
|
SDValue getAddrGPRel(NodeTy *N, SDLoc DL, EVT Ty, SelectionDAG &DAG) const {
|
2014-11-06 13:20:12 +00:00
|
|
|
assert(Ty == MVT::i32);
|
|
|
|
SDValue GPRel = getTargetNode(N, Ty, DAG, MipsII::MO_GPREL);
|
|
|
|
return DAG.getNode(ISD::ADD, DL, Ty,
|
|
|
|
DAG.getRegister(Mips::GP, Ty),
|
|
|
|
DAG.getNode(MipsISD::GPRel, DL, DAG.getVTList(Ty),
|
|
|
|
GPRel));
|
|
|
|
}
|
|
|
|
|
2013-03-13 00:54:29 +00:00
|
|
|
/// 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,
|
2014-10-01 08:22:21 +00:00
|
|
|
bool IsCallReloc, CallLoweringInfo &CLI, SDValue Callee,
|
|
|
|
SDValue Chain) const;
|
2013-01-24 04:24:02 +00:00
|
|
|
|
Checkin in of first of several patches to finish implementation of
mips16/mips32 floating point interoperability.
This patch fixes returns from mips16 functions so that if the function
was in fact called by a mips32 hard float routine, then values
that would have been returned in floating point registers are so returned.
Mips16 mode has no floating point instructions so there is no way to
load values into floating point registers.
This is needed when returning float, double, single complex, double complex
in the Mips ABI.
Helper functions in libc for mips16 are available to do this.
For efficiency purposes, these helper functions have a different calling
convention from normal Mips calls.
Registers v0,v1,a0,a1 are used to pass parameters instead of
a0,a1,a2,a3.
This is because v0,v1,a0,a1 are the natural registers used to return
floating point values in soft float. These values can then be moved
to the appropriate floating point registers with no extra cost.
The only register that is modified is ra in this call.
The helper functions make sure that the return values are in the floating
point registers that they would be in if soft float was not in effect
(which it is for mips16, though the soft float is implemented using a mips32
library that uses hard float).
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@181641 91177308-0d34-0410-b5e6-96231b3b80d8
2013-05-10 22:25:39 +00:00
|
|
|
protected:
|
2013-09-07 00:52:30 +00:00
|
|
|
SDValue lowerLOAD(SDValue Op, SelectionDAG &DAG) const;
|
|
|
|
SDValue lowerSTORE(SDValue Op, SelectionDAG &DAG) const;
|
|
|
|
|
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
|
2014-07-18 22:55:25 +00:00
|
|
|
const MipsSubtarget &Subtarget;
|
2015-01-29 23:27:36 +00:00
|
|
|
// Cache the ABI from the TargetMachine, we use it everywhere.
|
|
|
|
const MipsABIInfo &ABI;
|
2012-02-28 07:46:26 +00:00
|
|
|
|
2013-03-13 00:54:29 +00:00
|
|
|
private:
|
2013-09-27 19:51:35 +00:00
|
|
|
// Create a TargetGlobalAddress node.
|
|
|
|
SDValue getTargetNode(GlobalAddressSDNode *N, EVT Ty, SelectionDAG &DAG,
|
|
|
|
unsigned Flag) const;
|
|
|
|
|
|
|
|
// Create a TargetExternalSymbol node.
|
|
|
|
SDValue getTargetNode(ExternalSymbolSDNode *N, EVT Ty, SelectionDAG &DAG,
|
|
|
|
unsigned Flag) const;
|
|
|
|
|
|
|
|
// Create a TargetBlockAddress node.
|
|
|
|
SDValue getTargetNode(BlockAddressSDNode *N, EVT Ty, SelectionDAG &DAG,
|
|
|
|
unsigned Flag) const;
|
|
|
|
|
|
|
|
// Create a TargetJumpTable node.
|
|
|
|
SDValue getTargetNode(JumpTableSDNode *N, EVT Ty, SelectionDAG &DAG,
|
|
|
|
unsigned Flag) const;
|
|
|
|
|
|
|
|
// Create a TargetConstantPool node.
|
|
|
|
SDValue getTargetNode(ConstantPoolSDNode *N, EVT Ty, SelectionDAG &DAG,
|
|
|
|
unsigned Flag) const;
|
Checkin in of first of several patches to finish implementation of
mips16/mips32 floating point interoperability.
This patch fixes returns from mips16 functions so that if the function
was in fact called by a mips32 hard float routine, then values
that would have been returned in floating point registers are so returned.
Mips16 mode has no floating point instructions so there is no way to
load values into floating point registers.
This is needed when returning float, double, single complex, double complex
in the Mips ABI.
Helper functions in libc for mips16 are available to do this.
For efficiency purposes, these helper functions have a different calling
convention from normal Mips calls.
Registers v0,v1,a0,a1 are used to pass parameters instead of
a0,a1,a2,a3.
This is because v0,v1,a0,a1 are the natural registers used to return
floating point values in soft float. These values can then be moved
to the appropriate floating point registers with no extra cost.
The only register that is modified is ra in this call.
The helper functions make sure that the return values are in the floating
point registers that they would be in if soft float was not in effect
(which it is for mips16, though the soft float is implemented using a mips32
library that uses hard float).
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@181641 91177308-0d34-0410-b5e6-96231b3b80d8
2013-05-10 22:25:39 +00:00
|
|
|
|
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,
|
2014-09-26 10:06:12 +00:00
|
|
|
const SmallVectorImpl<ISD::InputArg> &Ins, SDLoc dl,
|
|
|
|
SelectionDAG &DAG, SmallVectorImpl<SDValue> &InVals,
|
|
|
|
TargetLowering::CallLoweringInfo &CLI) 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;
|
2014-08-01 09:17:39 +00:00
|
|
|
SDValue lowerVAARG(SDValue Op, SelectionDAG &DAG) const;
|
2013-03-12 00:16:36 +00:00
|
|
|
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 lowerADD(SDValue Op, SelectionDAG &DAG) const;
|
2013-05-16 21:17:15 +00:00
|
|
|
SDValue lowerFP_TO_SINT(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
|
2014-11-02 16:09:29 +00:00
|
|
|
isEligibleForTailCallOptimization(const CCState &CCInfo,
|
2013-03-13 00:54:29 +00:00
|
|
|
unsigned NextStackOffset,
|
2014-11-02 16:09:29 +00:00
|
|
|
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.
|
2014-11-01 18:44:56 +00:00
|
|
|
void copyByValRegs(SDValue Chain, SDLoc DL, std::vector<SDValue> &OutChains,
|
|
|
|
SelectionDAG &DAG, const ISD::ArgFlagsTy &Flags,
|
2012-10-27 00:10:18 +00:00
|
|
|
SmallVectorImpl<SDValue> &InVals,
|
2014-11-07 15:33:08 +00:00
|
|
|
const Argument *FuncArg, unsigned FirstReg,
|
|
|
|
unsigned LastReg, const CCValAssign &VA,
|
|
|
|
MipsCCState &State) const;
|
2012-10-27 00:10:18 +00:00
|
|
|
|
2012-10-27 00:16:36 +00:00
|
|
|
/// passByValArg - Pass a byval argument in registers or on stack.
|
2013-05-25 02:42:55 +00:00
|
|
|
void passByValArg(SDValue Chain, SDLoc DL,
|
2014-11-01 18:44:56 +00:00
|
|
|
std::deque<std::pair<unsigned, SDValue>> &RegsToPass,
|
2013-07-14 04:42:23 +00:00
|
|
|
SmallVectorImpl<SDValue> &MemOpChains, SDValue StackPtr,
|
2012-10-27 00:16:36 +00:00
|
|
|
MachineFrameInfo *MFI, SelectionDAG &DAG, SDValue Arg,
|
2014-11-07 15:33:08 +00:00
|
|
|
unsigned FirstReg, unsigned LastReg,
|
2014-11-01 18:44:56 +00:00
|
|
|
const ISD::ArgFlagsTy &Flags, bool isLittle,
|
|
|
|
const CCValAssign &VA) const;
|
2012-10-27 00:16:36 +00:00
|
|
|
|
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.
|
2014-11-07 15:33:08 +00:00
|
|
|
void writeVarArgRegs(std::vector<SDValue> &OutChains, SDValue Chain,
|
|
|
|
SDLoc DL, SelectionDAG &DAG, CCState &State) const;
|
2012-10-27 00:21:13 +00:00
|
|
|
|
2014-04-29 07:58:02 +00:00
|
|
|
SDValue
|
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
|
|
|
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,
|
2013-05-25 02:42:55 +00:00
|
|
|
SDLoc dl, SelectionDAG &DAG,
|
2014-04-29 07:58:02 +00:00
|
|
|
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.
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,
|
2013-05-25 02:42:55 +00:00
|
|
|
SDValue Arg, SDLoc DL, bool IsTailCall,
|
2012-10-30 19:23:25 +00:00
|
|
|
SelectionDAG &DAG) const;
|
|
|
|
|
2014-04-29 07:58:02 +00:00
|
|
|
SDValue LowerCall(TargetLowering::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.
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
|
|
|
|
2014-04-29 07:58:02 +00:00
|
|
|
bool CanLowerReturn(CallingConv::ID CallConv, MachineFunction &MF,
|
|
|
|
bool isVarArg,
|
|
|
|
const SmallVectorImpl<ISD::OutputArg> &Outs,
|
|
|
|
LLVMContext &Context) const override;
|
|
|
|
|
|
|
|
SDValue LowerReturn(SDValue Chain,
|
|
|
|
CallingConv::ID CallConv, bool isVarArg,
|
|
|
|
const SmallVectorImpl<ISD::OutputArg> &Outs,
|
|
|
|
const SmallVectorImpl<SDValue> &OutVals,
|
|
|
|
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.
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
|
|
|
|
2015-03-23 12:28:13 +00:00
|
|
|
bool shouldSignExtendTypeInLibCall(EVT Type, bool IsSigned) const override;
|
|
|
|
|
2007-08-21 16:09:25 +00:00
|
|
|
// Inline asm support
|
2014-04-29 07:58:02 +00:00
|
|
|
ConstraintType
|
|
|
|
getConstraintType(const std::string &Constraint) const override;
|
2007-08-21 16:09:25 +00:00
|
|
|
|
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(
|
2014-04-29 07:58:02 +00:00
|
|
|
AsmOperandInfo &info, const char *constraint) const override;
|
2010-10-29 17:29:13 +00:00
|
|
|
|
2013-08-14 00:21:25 +00:00
|
|
|
/// This function parses registers that appear in inline-asm constraints.
|
|
|
|
/// It returns pair (0, 0) on failure.
|
|
|
|
std::pair<unsigned, const TargetRegisterClass *>
|
2014-08-30 16:48:02 +00:00
|
|
|
parseRegForInlineAsmConstraint(StringRef C, MVT VT) const;
|
2013-08-14 00:21:25 +00:00
|
|
|
|
2015-02-26 22:38:43 +00:00
|
|
|
std::pair<unsigned, const TargetRegisterClass *>
|
|
|
|
getRegForInlineAsmConstraint(const TargetRegisterInfo *TRI,
|
|
|
|
const std::string &Constraint,
|
|
|
|
MVT VT) const override;
|
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'.
|
2014-04-29 07:58:02 +00:00
|
|
|
void LowerAsmOperandForConstraint(SDValue Op,
|
|
|
|
std::string &Constraint,
|
|
|
|
std::vector<SDValue> &Ops,
|
|
|
|
SelectionDAG &DAG) const override;
|
2012-05-07 03:13:32 +00:00
|
|
|
|
2015-03-16 13:13:41 +00:00
|
|
|
unsigned getInlineAsmMemConstraint(
|
|
|
|
const std::string &ConstraintCode) const override {
|
2015-03-24 11:26:34 +00:00
|
|
|
if (ConstraintCode == "R")
|
|
|
|
return InlineAsm::Constraint_R;
|
|
|
|
else if (ConstraintCode == "ZC")
|
|
|
|
return InlineAsm::Constraint_ZC;
|
|
|
|
return TargetLowering::getInlineAsmMemConstraint(ConstraintCode);
|
2015-03-16 13:13:41 +00:00
|
|
|
}
|
|
|
|
|
2014-04-29 07:58:02 +00:00
|
|
|
bool isLegalAddressingMode(const AddrMode &AM, Type *Ty) const override;
|
2012-11-17 00:25:41 +00:00
|
|
|
|
2014-04-29 07:58:02 +00:00
|
|
|
bool isOffsetFoldingLegal(const GlobalAddressSDNode *GA) const override;
|
2009-10-27 19:56:55 +00:00
|
|
|
|
2014-04-29 07:58:02 +00:00
|
|
|
EVT getOptimalMemOpType(uint64_t Size, unsigned DstAlign,
|
|
|
|
unsigned SrcAlign,
|
|
|
|
bool IsMemset, bool ZeroMemset,
|
|
|
|
bool MemcpyStrSrc,
|
|
|
|
MachineFunction &MF) const override;
|
2012-06-13 19:33:32 +00:00
|
|
|
|
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.
|
2014-04-29 07:58:02 +00:00
|
|
|
bool isFPImmLegal(const APFloat &Imm, EVT VT) const override;
|
2011-05-31 02:54:07 +00:00
|
|
|
|
2014-04-29 07:58:02 +00:00
|
|
|
unsigned getJumpTableEncoding() const override;
|
2012-02-03 04:33:00 +00:00
|
|
|
|
2014-06-16 13:13:03 +00:00
|
|
|
/// Emit a sign-extension using sll/sra, seb, or seh appropriately.
|
|
|
|
MachineBasicBlock *emitSignExtendToI32InReg(MachineInstr *MI,
|
|
|
|
MachineBasicBlock *BB,
|
|
|
|
unsigned Size, unsigned DstReg,
|
|
|
|
unsigned SrcRec) 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;
|
2014-06-12 13:39:06 +00:00
|
|
|
MachineBasicBlock *emitSEL_D(MachineInstr *MI, MachineBasicBlock *BB) const;
|
2014-12-12 14:41:37 +00:00
|
|
|
MachineBasicBlock *emitPseudoSELECT(MachineInstr *MI,
|
|
|
|
MachineBasicBlock *BB, bool isFPCmp,
|
|
|
|
unsigned Opc) const;
|
2007-06-06 07:42:06 +00:00
|
|
|
};
|
2013-03-13 00:54:29 +00:00
|
|
|
|
|
|
|
/// Create MipsTargetLowering objects.
|
2014-07-18 23:25:04 +00:00
|
|
|
const MipsTargetLowering *
|
2014-09-19 23:30:42 +00:00
|
|
|
createMips16TargetLowering(const MipsTargetMachine &TM,
|
|
|
|
const MipsSubtarget &STI);
|
2014-07-18 23:25:04 +00:00
|
|
|
const MipsTargetLowering *
|
2014-09-19 23:30:42 +00:00
|
|
|
createMipsSETargetLowering(const MipsTargetMachine &TM,
|
|
|
|
const MipsSubtarget &STI);
|
2014-04-17 22:15:34 +00:00
|
|
|
|
|
|
|
namespace Mips {
|
|
|
|
FastISel *createFastISel(FunctionLoweringInfo &funcInfo,
|
|
|
|
const TargetLibraryInfo *libInfo);
|
|
|
|
}
|
2007-06-06 07:42:06 +00:00
|
|
|
}
|
|
|
|
|
2014-08-13 16:26:38 +00:00
|
|
|
#endif
|