2011-05-09 18:16:46 +00:00
|
|
|
//===- MipsInstrInfo.td - Target Description for Mips Target -*- tablegen -*-=//
|
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
|
|
|
//===----------------------------------------------------------------------===//
|
2011-05-09 18:16:46 +00:00
|
|
|
//
|
|
|
|
// This file contains the Mips implementation of the TargetInstrInfo class.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
2007-06-06 07:42:06 +00:00
|
|
|
|
|
|
|
|
2011-04-15 21:51:11 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
2007-06-06 07:42:06 +00:00
|
|
|
// Mips profiles and nodes
|
2011-04-15 21:51:11 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
2007-06-06 07:42:06 +00:00
|
|
|
|
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
|
|
|
def SDT_MipsJmpLink : SDTypeProfile<0, 1, [SDTCisVT<0, iPTR>]>;
|
2010-11-09 17:25:34 +00:00
|
|
|
def SDT_MipsCMov : SDTypeProfile<1, 4, [SDTCisSameAs<0, 1>,
|
2011-04-15 21:00:26 +00:00
|
|
|
SDTCisSameAs<1, 2>,
|
|
|
|
SDTCisSameAs<3, 4>,
|
|
|
|
SDTCisInt<4>]>;
|
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
|
|
|
def SDT_MipsCallSeqStart : SDCallSeqStart<[SDTCisVT<0, i32>]>;
|
|
|
|
def SDT_MipsCallSeqEnd : SDCallSeqEnd<[SDTCisVT<0, i32>, SDTCisVT<1, i32>]>;
|
2013-10-15 01:12:50 +00:00
|
|
|
def SDT_MFLOHI : SDTypeProfile<1, 1, [SDTCisInt<0>, SDTCisVT<1, untyped>]>;
|
|
|
|
def SDT_MTLOHI : SDTypeProfile<1, 2, [SDTCisVT<0, untyped>,
|
2013-10-15 01:48:30 +00:00
|
|
|
SDTCisInt<1>, SDTCisSameAs<1, 2>]>;
|
2013-03-30 01:36:35 +00:00
|
|
|
def SDT_MipsMultDiv : SDTypeProfile<1, 2, [SDTCisVT<0, untyped>, SDTCisInt<1>,
|
|
|
|
SDTCisSameAs<1, 2>]>;
|
|
|
|
def SDT_MipsMAddMSub : SDTypeProfile<1, 3,
|
|
|
|
[SDTCisVT<0, untyped>, SDTCisSameAs<0, 3>,
|
|
|
|
SDTCisVT<1, i32>, SDTCisSameAs<1, 2>]>;
|
|
|
|
def SDT_MipsDivRem16 : SDTypeProfile<0, 2, [SDTCisInt<0>, SDTCisSameAs<0, 1>]>;
|
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
|
|
|
|
2011-05-31 02:53:58 +00:00
|
|
|
def SDT_MipsThreadPointer : SDTypeProfile<1, 0, [SDTCisPtrTy<0>]>;
|
|
|
|
|
2011-07-19 23:30:50 +00:00
|
|
|
def SDT_Sync : SDTypeProfile<0, 1, [SDTCisVT<0, i32>]>;
|
2011-06-21 00:40:49 +00:00
|
|
|
|
2011-09-22 23:31:54 +00:00
|
|
|
def SDT_Ext : SDTypeProfile<1, 3, [SDTCisInt<0>, SDTCisSameAs<0, 1>,
|
|
|
|
SDTCisVT<2, i32>, SDTCisSameAs<2, 3>]>;
|
|
|
|
def SDT_Ins : SDTypeProfile<1, 4, [SDTCisInt<0>, SDTCisSameAs<0, 1>,
|
|
|
|
SDTCisVT<2, i32>, SDTCisSameAs<2, 3>,
|
2011-08-17 02:05:42 +00:00
|
|
|
SDTCisSameAs<0, 4>]>;
|
|
|
|
|
2012-06-02 00:03:12 +00:00
|
|
|
def SDTMipsLoadLR : SDTypeProfile<1, 2,
|
|
|
|
[SDTCisInt<0>, SDTCisPtrTy<1>,
|
|
|
|
SDTCisSameAs<0, 2>]>;
|
|
|
|
|
2007-06-06 07:42:06 +00:00
|
|
|
// Call
|
2010-11-09 17:25:34 +00:00
|
|
|
def MipsJmpLink : SDNode<"MipsISD::JmpLink",SDT_MipsJmpLink,
|
2010-12-23 18:28:41 +00:00
|
|
|
[SDNPHasChain, SDNPOutGlue, SDNPOptInGlue,
|
2010-03-19 05:33:51 +00:00
|
|
|
SDNPVariadic]>;
|
2007-06-06 07:42:06 +00:00
|
|
|
|
2012-10-19 20:59:39 +00:00
|
|
|
// Tail call
|
|
|
|
def MipsTailCall : SDNode<"MipsISD::TailCall", SDT_MipsJmpLink,
|
|
|
|
[SDNPHasChain, SDNPOptInGlue, SDNPVariadic]>;
|
|
|
|
|
2010-11-09 17:25:34 +00:00
|
|
|
// Hi and Lo nodes are used to handle global addresses. Used on
|
|
|
|
// MipsISelLowering to lower stuff like GlobalAddress, ExternalSymbol
|
2007-11-05 03:02:32 +00:00
|
|
|
// static model. (nothing to do with Mips Registers Hi and Lo)
|
2008-07-21 18:52:34 +00:00
|
|
|
def MipsHi : SDNode<"MipsISD::Hi", SDTIntUnaryOp>;
|
|
|
|
def MipsLo : SDNode<"MipsISD::Lo", SDTIntUnaryOp>;
|
|
|
|
def MipsGPRel : SDNode<"MipsISD::GPRel", SDTIntUnaryOp>;
|
2007-10-09 02:55:31 +00:00
|
|
|
|
2011-05-31 02:53:58 +00:00
|
|
|
// TlsGd node is used to handle General Dynamic TLS
|
|
|
|
def MipsTlsGd : SDNode<"MipsISD::TlsGd", SDTIntUnaryOp>;
|
|
|
|
|
|
|
|
// TprelHi and TprelLo nodes are used to handle Local Exec TLS
|
|
|
|
def MipsTprelHi : SDNode<"MipsISD::TprelHi", SDTIntUnaryOp>;
|
|
|
|
def MipsTprelLo : SDNode<"MipsISD::TprelLo", SDTIntUnaryOp>;
|
|
|
|
|
|
|
|
// Thread pointer
|
|
|
|
def MipsThreadPointer: SDNode<"MipsISD::ThreadPointer", SDT_MipsThreadPointer>;
|
|
|
|
|
2007-10-26 04:00:13 +00:00
|
|
|
// Return
|
2013-02-05 18:12:03 +00:00
|
|
|
def MipsRet : SDNode<"MipsISD::Ret", SDTNone,
|
|
|
|
[SDNPHasChain, SDNPOptInGlue, SDNPVariadic]>;
|
2007-06-06 07:42:06 +00:00
|
|
|
|
|
|
|
// These are target-independent nodes, but have target-specific formats.
|
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
|
|
|
def callseq_start : SDNode<"ISD::CALLSEQ_START", SDT_MipsCallSeqStart,
|
2012-08-24 14:43:27 +00:00
|
|
|
[SDNPHasChain, SDNPSideEffect, SDNPOutGlue]>;
|
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
|
|
|
def callseq_end : SDNode<"ISD::CALLSEQ_END", SDT_MipsCallSeqEnd,
|
2012-08-24 14:43:27 +00:00
|
|
|
[SDNPHasChain, SDNPSideEffect,
|
|
|
|
SDNPOptInGlue, SDNPOutGlue]>;
|
2007-11-13 00:44:25 +00:00
|
|
|
|
2013-10-07 18:49:46 +00:00
|
|
|
// Nodes used to extract LO/HI registers.
|
2013-10-15 01:12:50 +00:00
|
|
|
def MipsMFHI : SDNode<"MipsISD::MFHI", SDT_MFLOHI>;
|
|
|
|
def MipsMFLO : SDNode<"MipsISD::MFLO", SDT_MFLOHI>;
|
2013-03-30 01:36:35 +00:00
|
|
|
|
|
|
|
// Node used to insert 32-bit integers to LOHI register pair.
|
2013-10-15 01:12:50 +00:00
|
|
|
def MipsMTLOHI : SDNode<"MipsISD::MTLOHI", SDT_MTLOHI>;
|
2013-03-30 01:36:35 +00:00
|
|
|
|
|
|
|
// Mult nodes.
|
|
|
|
def MipsMult : SDNode<"MipsISD::Mult", SDT_MipsMultDiv>;
|
|
|
|
def MipsMultu : SDNode<"MipsISD::Multu", SDT_MipsMultDiv>;
|
|
|
|
|
2011-01-18 19:29:17 +00:00
|
|
|
// MAdd*/MSub* nodes
|
2013-03-30 01:36:35 +00:00
|
|
|
def MipsMAdd : SDNode<"MipsISD::MAdd", SDT_MipsMAddMSub>;
|
|
|
|
def MipsMAddu : SDNode<"MipsISD::MAddu", SDT_MipsMAddMSub>;
|
|
|
|
def MipsMSub : SDNode<"MipsISD::MSub", SDT_MipsMAddMSub>;
|
|
|
|
def MipsMSubu : SDNode<"MipsISD::MSubu", SDT_MipsMAddMSub>;
|
2011-01-18 19:29:17 +00:00
|
|
|
|
2011-03-04 21:03:24 +00:00
|
|
|
// DivRem(u) nodes
|
2013-03-30 01:36:35 +00:00
|
|
|
def MipsDivRem : SDNode<"MipsISD::DivRem", SDT_MipsMultDiv>;
|
|
|
|
def MipsDivRemU : SDNode<"MipsISD::DivRemU", SDT_MipsMultDiv>;
|
2013-05-16 20:08:49 +00:00
|
|
|
def MipsDivRem16 : SDNode<"MipsISD::DivRem16", SDT_MipsDivRem16,
|
|
|
|
[SDNPOutGlue]>;
|
2013-03-30 01:36:35 +00:00
|
|
|
def MipsDivRemU16 : SDNode<"MipsISD::DivRemU16", SDT_MipsDivRem16,
|
2011-03-04 21:03:24 +00:00
|
|
|
[SDNPOutGlue]>;
|
|
|
|
|
2011-06-07 18:00:14 +00:00
|
|
|
// Target constant nodes that are not part of any isel patterns and remain
|
|
|
|
// unchanged can cause instructions with illegal operands to be emitted.
|
|
|
|
// Wrapper node patterns give the instruction selector a chance to replace
|
|
|
|
// target constant nodes that would otherwise remain unchanged with ADDiu
|
|
|
|
// nodes. Without these wrapper node patterns, the following conditional move
|
2013-09-28 13:42:22 +00:00
|
|
|
// instruction is emitted when function cmov2 in test/CodeGen/Mips/cmov.ll is
|
2012-02-28 07:46:26 +00:00
|
|
|
// compiled:
|
2011-06-07 18:00:14 +00:00
|
|
|
// movn %got(d)($gp), %got(c)($gp), $4
|
|
|
|
// This instruction is illegal since movn can take only register operands.
|
|
|
|
|
2012-02-24 22:34:47 +00:00
|
|
|
def MipsWrapper : SDNode<"MipsISD::Wrapper", SDTIntBinOp>;
|
2011-05-28 01:07:07 +00:00
|
|
|
|
2012-08-24 14:43:27 +00:00
|
|
|
def MipsSync : SDNode<"MipsISD::Sync", SDT_Sync, [SDNPHasChain,SDNPSideEffect]>;
|
2011-07-19 23:30:50 +00:00
|
|
|
|
2011-08-17 02:05:42 +00:00
|
|
|
def MipsExt : SDNode<"MipsISD::Ext", SDT_Ext>;
|
|
|
|
def MipsIns : SDNode<"MipsISD::Ins", SDT_Ins>;
|
|
|
|
|
2012-06-02 00:03:12 +00:00
|
|
|
def MipsLWL : SDNode<"MipsISD::LWL", SDTMipsLoadLR,
|
|
|
|
[SDNPHasChain, SDNPMayLoad, SDNPMemOperand]>;
|
|
|
|
def MipsLWR : SDNode<"MipsISD::LWR", SDTMipsLoadLR,
|
|
|
|
[SDNPHasChain, SDNPMayLoad, SDNPMemOperand]>;
|
|
|
|
def MipsSWL : SDNode<"MipsISD::SWL", SDTStore,
|
|
|
|
[SDNPHasChain, SDNPMayStore, SDNPMemOperand]>;
|
|
|
|
def MipsSWR : SDNode<"MipsISD::SWR", SDTStore,
|
|
|
|
[SDNPHasChain, SDNPMayStore, SDNPMemOperand]>;
|
|
|
|
def MipsLDL : SDNode<"MipsISD::LDL", SDTMipsLoadLR,
|
|
|
|
[SDNPHasChain, SDNPMayLoad, SDNPMemOperand]>;
|
|
|
|
def MipsLDR : SDNode<"MipsISD::LDR", SDTMipsLoadLR,
|
|
|
|
[SDNPHasChain, SDNPMayLoad, SDNPMemOperand]>;
|
|
|
|
def MipsSDL : SDNode<"MipsISD::SDL", SDTStore,
|
|
|
|
[SDNPHasChain, SDNPMayStore, SDNPMemOperand]>;
|
|
|
|
def MipsSDR : SDNode<"MipsISD::SDR", SDTStore,
|
|
|
|
[SDNPHasChain, SDNPMayStore, SDNPMemOperand]>;
|
|
|
|
|
2011-04-15 21:51:11 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
2007-10-09 02:55:31 +00:00
|
|
|
// Mips Instruction Predicate Definitions.
|
2011-04-15 21:51:11 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
2012-04-17 18:03:21 +00:00
|
|
|
def HasSEInReg : Predicate<"Subtarget.hasSEInReg()">,
|
|
|
|
AssemblerPredicate<"FeatureSEInReg">;
|
|
|
|
def HasBitCount : Predicate<"Subtarget.hasBitCount()">,
|
|
|
|
AssemblerPredicate<"FeatureBitCount">;
|
|
|
|
def HasSwap : Predicate<"Subtarget.hasSwap()">,
|
|
|
|
AssemblerPredicate<"FeatureSwap">;
|
|
|
|
def HasCondMov : Predicate<"Subtarget.hasCondMov()">,
|
|
|
|
AssemblerPredicate<"FeatureCondMov">;
|
2012-11-15 21:17:13 +00:00
|
|
|
def HasFPIdx : Predicate<"Subtarget.hasFPIdx()">,
|
|
|
|
AssemblerPredicate<"FeatureFPIdx">;
|
2012-04-17 18:03:21 +00:00
|
|
|
def HasMips32 : Predicate<"Subtarget.hasMips32()">,
|
|
|
|
AssemblerPredicate<"FeatureMips32">;
|
|
|
|
def HasMips32r2 : Predicate<"Subtarget.hasMips32r2()">,
|
|
|
|
AssemblerPredicate<"FeatureMips32r2">;
|
2014-04-14 15:44:42 +00:00
|
|
|
def IsGP64bit : Predicate<"Subtarget.isGP64bit()">,
|
|
|
|
AssemblerPredicate<"FeatureGP64Bit">;
|
|
|
|
def IsGP32bit : Predicate<"!Subtarget.isGP64bit()">,
|
|
|
|
AssemblerPredicate<"!FeatureGP64Bit">;
|
2012-04-17 18:03:21 +00:00
|
|
|
def HasMips64 : Predicate<"Subtarget.hasMips64()">,
|
|
|
|
AssemblerPredicate<"FeatureMips64">;
|
2014-04-10 15:00:28 +00:00
|
|
|
def IsGP32 : Predicate<"!Subtarget.isGP64()">,
|
|
|
|
AssemblerPredicate<"!FeatureGP64Bit">;
|
|
|
|
def IsGP64 : Predicate<"Subtarget.isGP64()">,
|
|
|
|
AssemblerPredicate<"FeatureGP64Bit">;
|
2012-04-17 18:03:21 +00:00
|
|
|
def HasMips64r2 : Predicate<"Subtarget.hasMips64r2()">,
|
|
|
|
AssemblerPredicate<"FeatureMips64r2">;
|
|
|
|
def IsN64 : Predicate<"Subtarget.isABI_N64()">,
|
|
|
|
AssemblerPredicate<"FeatureN64">;
|
2012-05-24 18:32:33 +00:00
|
|
|
def InMips16Mode : Predicate<"Subtarget.inMips16Mode()">,
|
|
|
|
AssemblerPredicate<"FeatureMips16">;
|
2014-03-20 11:51:58 +00:00
|
|
|
def HasCnMips : Predicate<"Subtarget.hasCnMips()">,
|
|
|
|
AssemblerPredicate<"FeatureCnMips">;
|
2012-04-17 18:03:21 +00:00
|
|
|
def RelocStatic : Predicate<"TM.getRelocationModel() == Reloc::Static">,
|
|
|
|
AssemblerPredicate<"FeatureMips32">;
|
|
|
|
def RelocPIC : Predicate<"TM.getRelocationModel() == Reloc::PIC_">,
|
|
|
|
AssemblerPredicate<"FeatureMips32">;
|
2014-04-09 09:56:43 +00:00
|
|
|
def NoNaNsFPMath : Predicate<"TM.Options.NoNaNsFPMath">;
|
2012-12-07 03:06:09 +00:00
|
|
|
def HasStdEnc : Predicate<"Subtarget.hasStandardEncoding()">,
|
2013-11-15 08:07:34 +00:00
|
|
|
AssemblerPredicate<"!FeatureMips16">;
|
2013-04-13 00:55:41 +00:00
|
|
|
def NotDSP : Predicate<"!Subtarget.hasDSP()">;
|
2013-08-13 20:19:16 +00:00
|
|
|
def InMicroMips : Predicate<"Subtarget.inMicroMipsMode()">,
|
|
|
|
AssemblerPredicate<"FeatureMicroMips">;
|
|
|
|
def NotInMicroMips : Predicate<"!Subtarget.inMicroMipsMode()">,
|
|
|
|
AssemblerPredicate<"!FeatureMicroMips">;
|
2013-08-27 09:40:30 +00:00
|
|
|
def IsLE : Predicate<"Subtarget.isLittle()">;
|
|
|
|
def IsBE : Predicate<"!Subtarget.isLittle()">;
|
2014-02-05 17:19:30 +00:00
|
|
|
def IsNotNaCl : Predicate<"!Subtarget.isTargetNaCl()">;
|
2012-05-22 03:10:09 +00:00
|
|
|
|
2014-05-07 14:25:43 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// Mips GPR size adjectives.
|
|
|
|
// They are mutually exclusive.
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
|
|
|
class GPR_64 { list<Predicate> GPRPredicates = [IsGP64bit]; }
|
|
|
|
|
2014-05-07 13:57:22 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
2014-05-07 14:11:46 +00:00
|
|
|
// Mips ISA/ASE membership and instruction group membership adjectives.
|
|
|
|
// They are mutually exclusive.
|
2014-05-07 13:57:22 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
|
|
|
class ISA_MIPS32R2 { list<Predicate> InsnPredicates = [HasMips32r2]; }
|
|
|
|
class ISA_MIPS64R2 { list<Predicate> InsnPredicates = [HasMips64r2]; }
|
|
|
|
|
2014-05-07 14:11:46 +00:00
|
|
|
class INSN_SWAP { list<Predicate> InsnPredicates = [HasSwap]; }
|
|
|
|
class INSN_SEINREG { list<Predicate> InsnPredicates = [HasSEInReg]; }
|
|
|
|
|
2014-05-07 13:57:22 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2014-05-07 10:27:09 +00:00
|
|
|
class MipsPat<dag pattern, dag result> : Pat<pattern, result>, PredicateControl {
|
|
|
|
let EncodingPredicates = [HasStdEnc];
|
2012-06-14 21:03:23 +00:00
|
|
|
}
|
|
|
|
|
2012-12-13 00:32:01 +00:00
|
|
|
class IsCommutable {
|
|
|
|
bit isCommutable = 1;
|
|
|
|
}
|
|
|
|
|
2012-10-19 21:11:03 +00:00
|
|
|
class IsBranch {
|
|
|
|
bit isBranch = 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
class IsReturn {
|
|
|
|
bit isReturn = 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
class IsCall {
|
|
|
|
bit isCall = 1;
|
|
|
|
}
|
|
|
|
|
2012-10-19 21:14:34 +00:00
|
|
|
class IsTailCall {
|
|
|
|
bit isCall = 1;
|
|
|
|
bit isTerminator = 1;
|
|
|
|
bit isReturn = 1;
|
|
|
|
bit isBarrier = 1;
|
|
|
|
bit hasExtraSrcRegAllocReq = 1;
|
|
|
|
bit isCodeGenOnly = 1;
|
|
|
|
}
|
|
|
|
|
2012-10-31 18:37:55 +00:00
|
|
|
class IsAsCheapAsAMove {
|
|
|
|
bit isAsCheapAsAMove = 1;
|
|
|
|
}
|
|
|
|
|
2012-11-03 00:53:12 +00:00
|
|
|
class NeverHasSideEffects {
|
|
|
|
bit neverHasSideEffects = 1;
|
|
|
|
}
|
|
|
|
|
2012-05-22 03:10:09 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// Instruction format superclass
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
|
|
|
include "MipsInstrFormats.td"
|
2007-10-09 02:55:31 +00:00
|
|
|
|
2011-04-15 21:51:11 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
2007-10-09 02:55:31 +00:00
|
|
|
// Mips Operand, Complex Patterns and Transformations Definitions.
|
2011-04-15 21:51:11 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
2007-10-09 02:55:31 +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
|
|
|
def MipsJumpTargetAsmOperand : AsmOperandClass {
|
|
|
|
let Name = "JumpTarget";
|
|
|
|
let ParserMethod = "ParseJumpTarget";
|
|
|
|
let PredicateMethod = "isImm";
|
|
|
|
let RenderMethod = "addImmOperands";
|
|
|
|
}
|
|
|
|
|
2007-06-06 07:42:06 +00:00
|
|
|
// Instruction operand types
|
2011-11-11 22:58:42 +00:00
|
|
|
def jmptarget : Operand<OtherVT> {
|
|
|
|
let EncoderMethod = "getJumpTargetOpValue";
|
[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
|
|
|
let ParserMatchClass = MipsJumpTargetAsmOperand;
|
2011-11-11 22:58:42 +00:00
|
|
|
}
|
|
|
|
def brtarget : Operand<OtherVT> {
|
|
|
|
let EncoderMethod = "getBranchTargetOpValue";
|
|
|
|
let OperandType = "OPERAND_PCREL";
|
2012-04-17 18:03:21 +00:00
|
|
|
let DecoderMethod = "DecodeBranchTarget";
|
[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
|
|
|
let ParserMatchClass = MipsJumpTargetAsmOperand;
|
2011-11-11 22:58:42 +00:00
|
|
|
}
|
2011-11-23 22:19:28 +00:00
|
|
|
def calltarget : Operand<iPTR> {
|
|
|
|
let EncoderMethod = "getJumpTargetOpValue";
|
[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
|
|
|
let ParserMatchClass = MipsJumpTargetAsmOperand;
|
2011-11-23 22:19:28 +00:00
|
|
|
}
|
2013-09-06 23:42:58 +00:00
|
|
|
|
2014-03-03 14:31:21 +00:00
|
|
|
def simm10 : Operand<i32>;
|
|
|
|
|
2012-04-17 18:03:21 +00:00
|
|
|
def simm16 : Operand<i32> {
|
|
|
|
let DecoderMethod= "DecodeSimm16";
|
|
|
|
}
|
2013-02-02 04:07:35 +00:00
|
|
|
|
|
|
|
def simm20 : Operand<i32> {
|
|
|
|
}
|
|
|
|
|
2013-07-12 09:25:35 +00:00
|
|
|
def uimm20 : Operand<i32> {
|
|
|
|
}
|
|
|
|
|
|
|
|
def uimm10 : Operand<i32> {
|
|
|
|
}
|
|
|
|
|
2013-10-11 19:05:08 +00:00
|
|
|
def simm16_64 : Operand<i64> {
|
|
|
|
let DecoderMethod = "DecodeSimm16";
|
|
|
|
}
|
2007-06-06 07:42:06 +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
|
|
|
// Zero
|
|
|
|
def uimmz : Operand<i32> {
|
|
|
|
let PrintMethod = "printUnsignedImm";
|
|
|
|
}
|
|
|
|
|
2008-08-13 07:13:40 +00:00
|
|
|
// Unsigned Operand
|
[Mips][msa] Added the simple builtins (add_a to dpsub[su], ilvev to ldi)
Includes:
add_a, adds_[asu], addv, addvi, andi.b, asub_[su].[bhwd], aver?_[su]_[bhwd],
bclr, bclri, bins[lr], bins[lr]i, bmnzi, bmzi, bneg, bnegi, bseli, bset, bseti,
c(eq|ne), c(eq|ne)i, cl[et]_[su], cl[et]i_[su], copy_[su].[bhw], div_[su],
dotp_[su], dpadd_[su], dpsub_[su], ilvev, ilvl, ilvod, ilvr, insv, insve,
ldi
Patch by Daniel Sanders
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@188457 91177308-0d34-0410-b5e6-96231b3b80d8
2013-08-15 12:24:57 +00:00
|
|
|
def uimm5 : Operand<i32> {
|
|
|
|
let PrintMethod = "printUnsignedImm";
|
|
|
|
}
|
|
|
|
|
2013-09-07 00:02:02 +00:00
|
|
|
def uimm6 : Operand<i32> {
|
|
|
|
let PrintMethod = "printUnsignedImm";
|
|
|
|
}
|
|
|
|
|
2008-08-13 07:13:40 +00:00
|
|
|
def uimm16 : Operand<i32> {
|
|
|
|
let PrintMethod = "printUnsignedImm";
|
|
|
|
}
|
|
|
|
|
2013-10-27 21:57:36 +00:00
|
|
|
def pcrel16 : Operand<i32> {
|
|
|
|
}
|
|
|
|
|
2012-08-17 20:16:42 +00:00
|
|
|
def MipsMemAsmOperand : AsmOperandClass {
|
|
|
|
let Name = "Mem";
|
|
|
|
let ParserMethod = "parseMemOperand";
|
|
|
|
}
|
|
|
|
|
2013-10-01 09:48:56 +00:00
|
|
|
def MipsInvertedImmoperand : AsmOperandClass {
|
|
|
|
let Name = "InvNum";
|
|
|
|
let RenderMethod = "addImmOperands";
|
|
|
|
let ParserMethod = "parseInvNum";
|
|
|
|
}
|
|
|
|
|
|
|
|
def InvertedImOperand : Operand<i32> {
|
|
|
|
let ParserMatchClass = MipsInvertedImmoperand;
|
|
|
|
}
|
|
|
|
|
2014-04-15 10:14:49 +00:00
|
|
|
def InvertedImOperand64 : Operand<i64> {
|
|
|
|
let ParserMatchClass = MipsInvertedImmoperand;
|
|
|
|
}
|
|
|
|
|
2013-12-05 11:06:22 +00:00
|
|
|
class mem_generic : Operand<iPTR> {
|
2007-06-06 07:42:06 +00:00
|
|
|
let PrintMethod = "printMemOperand";
|
2013-08-20 21:08:22 +00:00
|
|
|
let MIOperandInfo = (ops ptr_rc, simm16);
|
2011-10-18 17:50:36 +00:00
|
|
|
let EncoderMethod = "getMemEncoding";
|
2012-08-17 20:16:42 +00:00
|
|
|
let ParserMatchClass = MipsMemAsmOperand;
|
2013-03-22 00:05:30 +00:00
|
|
|
let OperandType = "OPERAND_MEMORY";
|
2007-06-06 07:42:06 +00:00
|
|
|
}
|
|
|
|
|
2013-12-05 11:06:22 +00:00
|
|
|
// Address operand
|
|
|
|
def mem : mem_generic;
|
|
|
|
|
|
|
|
// MSA specific address operand
|
|
|
|
def mem_msa : mem_generic {
|
2014-03-03 14:31:21 +00:00
|
|
|
let MIOperandInfo = (ops ptr_rc, simm10);
|
2013-12-05 11:06:22 +00:00
|
|
|
let EncoderMethod = "getMSAMemEncoding";
|
|
|
|
}
|
|
|
|
|
2013-08-20 21:08:22 +00:00
|
|
|
def mem_ea : Operand<iPTR> {
|
2011-07-07 20:54:20 +00:00
|
|
|
let PrintMethod = "printMemOperandEA";
|
2013-08-20 21:08:22 +00:00
|
|
|
let MIOperandInfo = (ops ptr_rc, simm16);
|
2011-10-18 17:50:36 +00:00
|
|
|
let EncoderMethod = "getMemEncoding";
|
2013-03-22 00:05:30 +00:00
|
|
|
let OperandType = "OPERAND_MEMORY";
|
2011-10-18 17:50:36 +00:00
|
|
|
}
|
|
|
|
|
2013-08-20 21:08:22 +00:00
|
|
|
def PtrRC : Operand<iPTR> {
|
|
|
|
let MIOperandInfo = (ops ptr_rc);
|
2013-08-28 00:55:15 +00:00
|
|
|
let DecoderMethod = "DecodePtrRegisterClass";
|
[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
|
|
|
let ParserMatchClass = GPR32AsmOperand;
|
2011-11-11 04:06:38 +00:00
|
|
|
}
|
|
|
|
|
2011-10-18 17:50:36 +00:00
|
|
|
// size operand of ext instruction
|
|
|
|
def size_ext : Operand<i32> {
|
|
|
|
let EncoderMethod = "getSizeExtEncoding";
|
2012-04-17 18:03:21 +00:00
|
|
|
let DecoderMethod = "DecodeExtSize";
|
2011-10-18 17:50:36 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
// size operand of ins instruction
|
|
|
|
def size_ins : Operand<i32> {
|
|
|
|
let EncoderMethod = "getSizeInsEncoding";
|
2012-04-17 18:03:21 +00:00
|
|
|
let DecoderMethod = "DecodeInsSize";
|
2011-07-07 20:54:20 +00:00
|
|
|
}
|
|
|
|
|
2007-06-06 07:42:06 +00:00
|
|
|
// Transformation Function - get the lower 16 bits.
|
|
|
|
def LO16 : SDNodeXForm<imm, [{
|
2011-12-07 20:10:24 +00:00
|
|
|
return getImm(N, N->getZExtValue() & 0xFFFF);
|
2007-06-06 07:42:06 +00:00
|
|
|
}]>;
|
|
|
|
|
|
|
|
// Transformation Function - get the higher 16 bits.
|
|
|
|
def HI16 : SDNodeXForm<imm, [{
|
2011-12-07 20:10:24 +00:00
|
|
|
return getImm(N, (N->getZExtValue() >> 16) & 0xFFFF);
|
2007-06-06 07:42:06 +00:00
|
|
|
}]>;
|
|
|
|
|
2013-03-01 21:52:08 +00:00
|
|
|
// Plus 1.
|
|
|
|
def Plus1 : SDNodeXForm<imm, [{ return getImm(N, N->getSExtValue() + 1); }]>;
|
|
|
|
|
[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
|
|
|
// Node immediate is zero (e.g. insve.d)
|
|
|
|
def immz : PatLeaf<(imm), [{ return N->getSExtValue() == 0; }]>;
|
|
|
|
|
2013-02-08 21:42:56 +00:00
|
|
|
// Node immediate fits as 16-bit sign extended on target immediate.
|
|
|
|
// e.g. addi, andi
|
|
|
|
def immSExt8 : PatLeaf<(imm), [{ return isInt<8>(N->getSExtValue()); }]>;
|
|
|
|
|
2007-06-06 07:42:06 +00:00
|
|
|
// Node immediate fits as 16-bit sign extended on target immediate.
|
|
|
|
// e.g. addi, andi
|
2010-08-18 23:56:46 +00:00
|
|
|
def immSExt16 : PatLeaf<(imm), [{ return isInt<16>(N->getSExtValue()); }]>;
|
2007-06-06 07:42:06 +00:00
|
|
|
|
2012-12-20 06:57:00 +00:00
|
|
|
// Node immediate fits as 15-bit sign extended on target immediate.
|
|
|
|
// e.g. addi, andi
|
|
|
|
def immSExt15 : PatLeaf<(imm), [{ return isInt<15>(N->getSExtValue()); }]>;
|
|
|
|
|
2007-06-06 07:42:06 +00:00
|
|
|
// Node immediate fits as 16-bit zero extended on target immediate.
|
|
|
|
// The LO16 param means that only the lower 16 bits of the node
|
|
|
|
// immediate are caught.
|
|
|
|
// e.g. addiu, sltiu
|
|
|
|
def immZExt16 : PatLeaf<(imm), [{
|
2009-08-11 20:47:22 +00:00
|
|
|
if (N->getValueType(0) == MVT::i32)
|
2008-09-12 16:56:44 +00:00
|
|
|
return (uint32_t)N->getZExtValue() == (unsigned short)N->getZExtValue();
|
2007-10-26 04:00:13 +00:00
|
|
|
else
|
2008-09-12 16:56:44 +00:00
|
|
|
return (uint64_t)N->getZExtValue() == (unsigned short)N->getZExtValue();
|
2007-06-06 07:42:06 +00:00
|
|
|
}], LO16>;
|
|
|
|
|
2011-12-19 20:21:18 +00:00
|
|
|
// Immediate can be loaded with LUi (32-bit int with lower 16-bit cleared).
|
2012-01-04 03:09:26 +00:00
|
|
|
def immLow16Zero : PatLeaf<(imm), [{
|
2011-12-19 20:21:18 +00:00
|
|
|
int64_t Val = N->getSExtValue();
|
|
|
|
return isInt<32>(Val) && !(Val & 0xffff);
|
|
|
|
}]>;
|
|
|
|
|
2007-06-06 07:42:06 +00:00
|
|
|
// shamt field must fit in 5 bits.
|
2011-10-17 18:01:00 +00:00
|
|
|
def immZExt5 : ImmLeaf<i32, [{return Imm == (Imm & 0x1f);}]>;
|
2007-06-06 07:42:06 +00:00
|
|
|
|
2013-03-01 21:52:08 +00:00
|
|
|
// True if (N + 1) fits in 16-bit field.
|
|
|
|
def immSExt16Plus1 : PatLeaf<(imm), [{
|
|
|
|
return isInt<17>(N->getSExtValue()) && isInt<16>(N->getSExtValue() + 1);
|
|
|
|
}]>;
|
|
|
|
|
2007-10-26 04:00:13 +00:00
|
|
|
// Mips Address Mode! SDNode frameindex could possibily be a match
|
2007-06-06 07:42:06 +00:00
|
|
|
// since load and store instructions from stack used it.
|
2012-05-24 18:32:33 +00:00
|
|
|
def addr :
|
2013-02-16 00:14:37 +00:00
|
|
|
ComplexPattern<iPTR, 2, "selectIntAddr", [frameindex]>;
|
2013-02-15 21:20:45 +00:00
|
|
|
|
|
|
|
def addrRegImm :
|
2013-02-16 00:14:37 +00:00
|
|
|
ComplexPattern<iPTR, 2, "selectAddrRegImm", [frameindex]>;
|
2013-02-15 21:20:45 +00:00
|
|
|
|
2013-08-28 12:04:29 +00:00
|
|
|
def addrRegReg :
|
|
|
|
ComplexPattern<iPTR, 2, "selectAddrRegReg", [frameindex]>;
|
|
|
|
|
2013-02-15 21:20:45 +00:00
|
|
|
def addrDefault :
|
2013-02-16 00:14:37 +00:00
|
|
|
ComplexPattern<iPTR, 2, "selectAddrDefault", [frameindex]>;
|
2007-06-06 07:42:06 +00:00
|
|
|
|
2014-03-03 14:31:21 +00:00
|
|
|
def addrimm10 : ComplexPattern<iPTR, 2, "selectIntAddrMSA", [frameindex]>;
|
|
|
|
|
2011-04-15 21:51:11 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
2007-06-06 07:42:06 +00:00
|
|
|
// Instructions specific format
|
2011-04-15 21:51:11 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
2007-06-06 07:42:06 +00:00
|
|
|
|
2011-10-11 23:12:12 +00:00
|
|
|
// Arithmetic and logical instructions with 3 register operands.
|
2013-01-12 01:03:14 +00:00
|
|
|
class ArithLogicR<string opstr, RegisterOperand RO, bit isComm = 0,
|
2012-12-20 03:52:08 +00:00
|
|
|
InstrItinClass Itin = NoItinerary,
|
|
|
|
SDPatternOperator OpNode = null_frag>:
|
2013-01-12 01:03:14 +00:00
|
|
|
InstSE<(outs RO:$rd), (ins RO:$rs, RO:$rt),
|
2012-12-20 03:34:05 +00:00
|
|
|
!strconcat(opstr, "\t$rd, $rs, $rt"),
|
2013-04-19 19:03:11 +00:00
|
|
|
[(set RO:$rd, (OpNode RO:$rs, RO:$rt))], Itin, FrmR, opstr> {
|
2011-05-12 17:42:08 +00:00
|
|
|
let isCommutable = isComm;
|
2012-04-18 18:52:10 +00:00
|
|
|
let isReMaterializable = 1;
|
2014-03-26 16:09:43 +00:00
|
|
|
let TwoOperandAliasConstraint = "$rd = $rs";
|
2011-05-12 17:42:08 +00:00
|
|
|
}
|
2007-06-06 07:42:06 +00:00
|
|
|
|
2011-10-11 23:38:52 +00:00
|
|
|
// Arithmetic and logical instructions with 2 register operands.
|
2013-01-12 01:03:14 +00:00
|
|
|
class ArithLogicI<string opstr, Operand Od, RegisterOperand RO,
|
2013-07-31 00:55:34 +00:00
|
|
|
InstrItinClass Itin = NoItinerary,
|
2012-12-20 03:52:08 +00:00
|
|
|
SDPatternOperator imm_type = null_frag,
|
|
|
|
SDPatternOperator OpNode = null_frag> :
|
2013-01-12 01:03:14 +00:00
|
|
|
InstSE<(outs RO:$rt), (ins RO:$rs, Od:$imm16),
|
2012-12-20 03:40:03 +00:00
|
|
|
!strconcat(opstr, "\t$rt, $rs, $imm16"),
|
2013-04-19 19:03:11 +00:00
|
|
|
[(set RO:$rt, (OpNode RO:$rs, imm_type:$imm16))],
|
2013-07-31 00:55:34 +00:00
|
|
|
Itin, FrmI, opstr> {
|
2012-04-18 18:52:10 +00:00
|
|
|
let isReMaterializable = 1;
|
2013-05-16 20:24:27 +00:00
|
|
|
let TwoOperandAliasConstraint = "$rs = $rt";
|
2012-04-18 18:52:10 +00:00
|
|
|
}
|
2007-06-06 07:42:06 +00:00
|
|
|
|
|
|
|
// Arithmetic Multiply ADD/SUB
|
2014-01-17 14:32:41 +00:00
|
|
|
class MArithR<string opstr, InstrItinClass itin, bit isComm = 0> :
|
2013-08-06 23:08:38 +00:00
|
|
|
InstSE<(outs), (ins GPR32Opnd:$rs, GPR32Opnd:$rt),
|
2014-01-17 14:32:41 +00:00
|
|
|
!strconcat(opstr, "\t$rs, $rt"), [], itin, FrmR, opstr> {
|
2013-08-14 00:47:08 +00:00
|
|
|
let Defs = [HI0, LO0];
|
|
|
|
let Uses = [HI0, LO0];
|
2011-05-12 17:42:08 +00:00
|
|
|
let isCommutable = isComm;
|
|
|
|
}
|
2007-06-06 07:42:06 +00:00
|
|
|
|
|
|
|
// Logical
|
2013-08-06 22:20:40 +00:00
|
|
|
class LogicNOR<string opstr, RegisterOperand RO>:
|
|
|
|
InstSE<(outs RO:$rd), (ins RO:$rs, RO:$rt),
|
2012-12-21 22:35:47 +00:00
|
|
|
!strconcat(opstr, "\t$rd, $rs, $rt"),
|
[mips][sched] Split IIArith in preparation for the first scheduler targeting a specific MIPS CPU.
IIArith -> II_ADD, II_ADDU, II_AND, II_CL[ZO], II_DADDIU, II_DADDU,
II_DROTR, II_DROTR32, II_DROTRV, II_DSLL, II_DSLL32, II_DSLLV,
II_DSR[AL], II_DSR[AL]32, II_DSR[AL]V, II_DSUBU, II_LUI, II_MOV[ZFNT],
II_NOR, II_OR, II_RDHWR, II_ROTR, II_ROTRV, II_SLL, II_SLLV, II_SR[AL],
II_SR[AL]V, II_SUBU, II_XOR
No functional change since the InstrItinData's have been duplicated.
This is necessary because the classes are shared between all schedulers.
Once this patch series is committed there will be an InstrItinClass for
each mnemonic with minimal grouping. This does increase the size of the
itinerary tables for each MIPS scheduler but we have a few options for dealing
with that later. These options include reducing the number of classes once
we see the best way to simplify them, or by extending tablegen to be able
to compress the table by eliminating duplicates entries, etc.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@199391 91177308-0d34-0410-b5e6-96231b3b80d8
2014-01-16 14:27:20 +00:00
|
|
|
[(set RO:$rd, (not (or RO:$rs, RO:$rt)))], II_NOR, FrmR, opstr> {
|
2011-10-12 00:56:06 +00:00
|
|
|
let isCommutable = 1;
|
|
|
|
}
|
2007-06-06 07:42:06 +00:00
|
|
|
|
|
|
|
// Shifts
|
2013-01-04 19:25:46 +00:00
|
|
|
class shift_rotate_imm<string opstr, Operand ImmOpnd,
|
[mips][sched] Split IIArith in preparation for the first scheduler targeting a specific MIPS CPU.
IIArith -> II_ADD, II_ADDU, II_AND, II_CL[ZO], II_DADDIU, II_DADDU,
II_DROTR, II_DROTR32, II_DROTRV, II_DSLL, II_DSLL32, II_DSLLV,
II_DSR[AL], II_DSR[AL]32, II_DSR[AL]V, II_DSUBU, II_LUI, II_MOV[ZFNT],
II_NOR, II_OR, II_RDHWR, II_ROTR, II_ROTRV, II_SLL, II_SLLV, II_SR[AL],
II_SR[AL]V, II_SUBU, II_XOR
No functional change since the InstrItinData's have been duplicated.
This is necessary because the classes are shared between all schedulers.
Once this patch series is committed there will be an InstrItinClass for
each mnemonic with minimal grouping. This does increase the size of the
itinerary tables for each MIPS scheduler but we have a few options for dealing
with that later. These options include reducing the number of classes once
we see the best way to simplify them, or by extending tablegen to be able
to compress the table by eliminating duplicates entries, etc.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@199391 91177308-0d34-0410-b5e6-96231b3b80d8
2014-01-16 14:27:20 +00:00
|
|
|
RegisterOperand RO, InstrItinClass itin,
|
|
|
|
SDPatternOperator OpNode = null_frag,
|
2013-01-04 19:25:46 +00:00
|
|
|
SDPatternOperator PF = null_frag> :
|
2013-08-06 22:20:40 +00:00
|
|
|
InstSE<(outs RO:$rd), (ins RO:$rt, ImmOpnd:$shamt),
|
2012-12-20 03:44:41 +00:00
|
|
|
!strconcat(opstr, "\t$rd, $rt, $shamt"),
|
2014-04-16 16:28:59 +00:00
|
|
|
[(set RO:$rd, (OpNode RO:$rt, PF:$shamt))], itin, FrmR, opstr> {
|
|
|
|
let TwoOperandAliasConstraint = "$rt = $rd";
|
|
|
|
}
|
2007-06-06 07:42:06 +00:00
|
|
|
|
[mips][sched] Split IIArith in preparation for the first scheduler targeting a specific MIPS CPU.
IIArith -> II_ADD, II_ADDU, II_AND, II_CL[ZO], II_DADDIU, II_DADDU,
II_DROTR, II_DROTR32, II_DROTRV, II_DSLL, II_DSLL32, II_DSLLV,
II_DSR[AL], II_DSR[AL]32, II_DSR[AL]V, II_DSUBU, II_LUI, II_MOV[ZFNT],
II_NOR, II_OR, II_RDHWR, II_ROTR, II_ROTRV, II_SLL, II_SLLV, II_SR[AL],
II_SR[AL]V, II_SUBU, II_XOR
No functional change since the InstrItinData's have been duplicated.
This is necessary because the classes are shared between all schedulers.
Once this patch series is committed there will be an InstrItinClass for
each mnemonic with minimal grouping. This does increase the size of the
itinerary tables for each MIPS scheduler but we have a few options for dealing
with that later. These options include reducing the number of classes once
we see the best way to simplify them, or by extending tablegen to be able
to compress the table by eliminating duplicates entries, etc.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@199391 91177308-0d34-0410-b5e6-96231b3b80d8
2014-01-16 14:27:20 +00:00
|
|
|
class shift_rotate_reg<string opstr, RegisterOperand RO, InstrItinClass itin,
|
2013-01-04 19:25:46 +00:00
|
|
|
SDPatternOperator OpNode = null_frag>:
|
2013-08-06 23:08:38 +00:00
|
|
|
InstSE<(outs RO:$rd), (ins RO:$rt, GPR32Opnd:$rs),
|
2012-12-20 03:48:24 +00:00
|
|
|
!strconcat(opstr, "\t$rd, $rt, $rs"),
|
[mips][sched] Split IIArith in preparation for the first scheduler targeting a specific MIPS CPU.
IIArith -> II_ADD, II_ADDU, II_AND, II_CL[ZO], II_DADDIU, II_DADDU,
II_DROTR, II_DROTR32, II_DROTRV, II_DSLL, II_DSLL32, II_DSLLV,
II_DSR[AL], II_DSR[AL]32, II_DSR[AL]V, II_DSUBU, II_LUI, II_MOV[ZFNT],
II_NOR, II_OR, II_RDHWR, II_ROTR, II_ROTRV, II_SLL, II_SLLV, II_SR[AL],
II_SR[AL]V, II_SUBU, II_XOR
No functional change since the InstrItinData's have been duplicated.
This is necessary because the classes are shared between all schedulers.
Once this patch series is committed there will be an InstrItinClass for
each mnemonic with minimal grouping. This does increase the size of the
itinerary tables for each MIPS scheduler but we have a few options for dealing
with that later. These options include reducing the number of classes once
we see the best way to simplify them, or by extending tablegen to be able
to compress the table by eliminating duplicates entries, etc.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@199391 91177308-0d34-0410-b5e6-96231b3b80d8
2014-01-16 14:27:20 +00:00
|
|
|
[(set RO:$rd, (OpNode RO:$rt, GPR32Opnd:$rs))], itin, FrmR,
|
2014-05-01 10:08:36 +00:00
|
|
|
opstr>;
|
2007-06-06 07:42:06 +00:00
|
|
|
|
|
|
|
// Load Upper Imediate
|
2013-08-06 22:20:40 +00:00
|
|
|
class LoadUpper<string opstr, RegisterOperand RO, Operand Imm>:
|
|
|
|
InstSE<(outs RO:$rt), (ins Imm:$imm16), !strconcat(opstr, "\t$rt, $imm16"),
|
[mips][sched] Split IIArith in preparation for the first scheduler targeting a specific MIPS CPU.
IIArith -> II_ADD, II_ADDU, II_AND, II_CL[ZO], II_DADDIU, II_DADDU,
II_DROTR, II_DROTR32, II_DROTRV, II_DSLL, II_DSLL32, II_DSLLV,
II_DSR[AL], II_DSR[AL]32, II_DSR[AL]V, II_DSUBU, II_LUI, II_MOV[ZFNT],
II_NOR, II_OR, II_RDHWR, II_ROTR, II_ROTRV, II_SLL, II_SLLV, II_SR[AL],
II_SR[AL]V, II_SUBU, II_XOR
No functional change since the InstrItinData's have been duplicated.
This is necessary because the classes are shared between all schedulers.
Once this patch series is committed there will be an InstrItinClass for
each mnemonic with minimal grouping. This does increase the size of the
itinerary tables for each MIPS scheduler but we have a few options for dealing
with that later. These options include reducing the number of classes once
we see the best way to simplify them, or by extending tablegen to be able
to compress the table by eliminating duplicates entries, etc.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@199391 91177308-0d34-0410-b5e6-96231b3b80d8
2014-01-16 14:27:20 +00:00
|
|
|
[], II_LUI, FrmI, opstr>, IsAsCheapAsAMove {
|
2012-04-03 02:51:09 +00:00
|
|
|
let neverHasSideEffects = 1;
|
2012-04-18 18:52:10 +00:00
|
|
|
let isReMaterializable = 1;
|
2011-10-12 00:56:06 +00:00
|
|
|
}
|
2007-06-06 07:42:06 +00:00
|
|
|
|
2007-10-26 04:00:13 +00:00
|
|
|
// Memory Load/Store
|
2013-08-20 21:08:22 +00:00
|
|
|
class Load<string opstr, DAGOperand RO, SDPatternOperator OpNode = null_frag,
|
|
|
|
InstrItinClass Itin = NoItinerary, ComplexPattern Addr = addr> :
|
|
|
|
InstSE<(outs RO:$rt), (ins mem:$addr), !strconcat(opstr, "\t$rt, $addr"),
|
2013-09-06 23:28:24 +00:00
|
|
|
[(set RO:$rt, (OpNode Addr:$addr))], Itin, FrmI, opstr> {
|
2012-12-21 22:58:55 +00:00
|
|
|
let DecoderMethod = "DecodeMem";
|
|
|
|
let canFoldAsLoad = 1;
|
2013-03-30 00:54:52 +00:00
|
|
|
let mayLoad = 1;
|
2012-02-28 07:46:26 +00:00
|
|
|
}
|
2011-10-11 00:11:12 +00:00
|
|
|
|
2013-08-20 21:08:22 +00:00
|
|
|
class Store<string opstr, DAGOperand RO, SDPatternOperator OpNode = null_frag,
|
|
|
|
InstrItinClass Itin = NoItinerary, ComplexPattern Addr = addr> :
|
|
|
|
InstSE<(outs), (ins RO:$rt, mem:$addr), !strconcat(opstr, "\t$rt, $addr"),
|
2013-09-06 23:28:24 +00:00
|
|
|
[(OpNode RO:$rt, Addr:$addr)], Itin, FrmI, opstr> {
|
2012-12-21 22:58:55 +00:00
|
|
|
let DecoderMethod = "DecodeMem";
|
2013-03-30 00:54:52 +00:00
|
|
|
let mayStore = 1;
|
2012-02-28 07:46:26 +00:00
|
|
|
}
|
2011-10-11 00:11:12 +00:00
|
|
|
|
2012-06-02 00:04:19 +00:00
|
|
|
// Load/Store Left/Right
|
|
|
|
let canFoldAsLoad = 1 in
|
2013-09-06 23:28:24 +00:00
|
|
|
class LoadLeftRight<string opstr, SDNode OpNode, RegisterOperand RO,
|
|
|
|
InstrItinClass Itin> :
|
2013-08-20 21:08:22 +00:00
|
|
|
InstSE<(outs RO:$rt), (ins mem:$addr, RO:$src),
|
2012-12-21 23:01:24 +00:00
|
|
|
!strconcat(opstr, "\t$rt, $addr"),
|
2013-09-06 23:28:24 +00:00
|
|
|
[(set RO:$rt, (OpNode addr:$addr, RO:$src))], Itin, FrmI> {
|
2012-12-21 23:01:24 +00:00
|
|
|
let DecoderMethod = "DecodeMem";
|
2012-06-02 00:04:19 +00:00
|
|
|
string Constraints = "$src = $rt";
|
|
|
|
}
|
|
|
|
|
2013-09-06 23:28:24 +00:00
|
|
|
class StoreLeftRight<string opstr, SDNode OpNode, RegisterOperand RO,
|
|
|
|
InstrItinClass Itin> :
|
2013-08-20 21:08:22 +00:00
|
|
|
InstSE<(outs), (ins RO:$rt, mem:$addr), !strconcat(opstr, "\t$rt, $addr"),
|
2013-09-06 23:28:24 +00:00
|
|
|
[(OpNode RO:$rt, addr:$addr)], Itin, FrmI> {
|
2012-12-21 23:01:24 +00:00
|
|
|
let DecoderMethod = "DecodeMem";
|
2012-06-02 00:04:19 +00:00
|
|
|
}
|
|
|
|
|
2007-06-06 07:42:06 +00:00
|
|
|
// Conditional Branch
|
2013-11-04 14:53:22 +00:00
|
|
|
class CBranch<string opstr, DAGOperand opnd, PatFrag cond_op,
|
|
|
|
RegisterOperand RO> :
|
|
|
|
InstSE<(outs), (ins RO:$rs, RO:$rt, opnd:$offset),
|
2012-12-20 04:10:13 +00:00
|
|
|
!strconcat(opstr, "\t$rs, $rt, $offset"),
|
2013-08-06 22:20:40 +00:00
|
|
|
[(brcond (i32 (cond_op RO:$rs, RO:$rt)), bb:$offset)], IIBranch,
|
2013-11-04 14:53:22 +00:00
|
|
|
FrmI, opstr> {
|
2011-10-11 18:49:17 +00:00
|
|
|
let isBranch = 1;
|
|
|
|
let isTerminator = 1;
|
|
|
|
let hasDelaySlot = 1;
|
2012-06-14 01:17:59 +00:00
|
|
|
let Defs = [AT];
|
2011-10-11 18:49:17 +00:00
|
|
|
}
|
|
|
|
|
2013-11-04 14:53:22 +00:00
|
|
|
class CBranchZero<string opstr, DAGOperand opnd, PatFrag cond_op,
|
|
|
|
RegisterOperand RO> :
|
|
|
|
InstSE<(outs), (ins RO:$rs, opnd:$offset),
|
2012-12-20 04:13:23 +00:00
|
|
|
!strconcat(opstr, "\t$rs, $offset"),
|
2013-11-04 14:53:22 +00:00
|
|
|
[(brcond (i32 (cond_op RO:$rs, 0)), bb:$offset)], IIBranch,
|
|
|
|
FrmI, opstr> {
|
2011-10-11 18:49:17 +00:00
|
|
|
let isBranch = 1;
|
|
|
|
let isTerminator = 1;
|
|
|
|
let hasDelaySlot = 1;
|
2012-06-14 01:17:59 +00:00
|
|
|
let Defs = [AT];
|
2007-10-26 04:00:13 +00:00
|
|
|
}
|
2007-06-06 07:42:06 +00:00
|
|
|
|
2007-10-26 04:00:13 +00:00
|
|
|
// SetCC
|
2013-08-06 22:20:40 +00:00
|
|
|
class SetCC_R<string opstr, PatFrag cond_op, RegisterOperand RO> :
|
2013-08-06 23:08:38 +00:00
|
|
|
InstSE<(outs GPR32Opnd:$rd), (ins RO:$rs, RO:$rt),
|
2012-12-20 04:27:52 +00:00
|
|
|
!strconcat(opstr, "\t$rd, $rs, $rt"),
|
2013-08-06 23:08:38 +00:00
|
|
|
[(set GPR32Opnd:$rd, (cond_op RO:$rs, RO:$rt))],
|
2014-01-21 10:42:13 +00:00
|
|
|
II_SLT_SLTU, FrmR, opstr>;
|
2007-06-06 07:42:06 +00:00
|
|
|
|
2012-12-20 04:27:52 +00:00
|
|
|
class SetCC_I<string opstr, PatFrag cond_op, Operand Od, PatLeaf imm_type,
|
2013-08-06 22:20:40 +00:00
|
|
|
RegisterOperand RO>:
|
2013-08-06 23:08:38 +00:00
|
|
|
InstSE<(outs GPR32Opnd:$rt), (ins RO:$rs, Od:$imm16),
|
2012-12-20 04:27:52 +00:00
|
|
|
!strconcat(opstr, "\t$rt, $rs, $imm16"),
|
2013-08-06 23:08:38 +00:00
|
|
|
[(set GPR32Opnd:$rt, (cond_op RO:$rs, imm_type:$imm16))],
|
2014-01-21 10:42:13 +00:00
|
|
|
II_SLTI_SLTIU, FrmI, opstr>;
|
2007-06-06 07:42:06 +00:00
|
|
|
|
2011-12-12 22:39:35 +00:00
|
|
|
// Jump
|
2012-12-21 23:03:50 +00:00
|
|
|
class JumpFJ<DAGOperand opnd, string opstr, SDPatternOperator operator,
|
2013-10-29 16:38:59 +00:00
|
|
|
SDPatternOperator targetoperator, string bopstr> :
|
2012-12-21 23:03:50 +00:00
|
|
|
InstSE<(outs), (ins opnd:$target), !strconcat(opstr, "\t$target"),
|
2013-10-29 16:38:59 +00:00
|
|
|
[(operator targetoperator:$target)], IIBranch, FrmJ, bopstr> {
|
2011-12-12 22:39:35 +00:00
|
|
|
let isTerminator=1;
|
|
|
|
let isBarrier=1;
|
|
|
|
let hasDelaySlot = 1;
|
2012-04-17 18:03:21 +00:00
|
|
|
let DecoderMethod = "DecodeJumpTarget";
|
2012-06-14 01:17:59 +00:00
|
|
|
let Defs = [AT];
|
2011-12-12 22:39:35 +00:00
|
|
|
}
|
|
|
|
|
2007-06-06 07:42:06 +00:00
|
|
|
// Unconditional branch
|
2013-09-06 23:40:15 +00:00
|
|
|
class UncondBranch<Instruction BEQInst> :
|
|
|
|
PseudoSE<(outs), (ins brtarget:$offset), [(br bb:$offset)], IIBranch>,
|
|
|
|
PseudoInstExpansion<(BEQInst ZERO, ZERO, brtarget:$offset)> {
|
2011-12-06 03:34:48 +00:00
|
|
|
let isBranch = 1;
|
|
|
|
let isTerminator = 1;
|
|
|
|
let isBarrier = 1;
|
|
|
|
let hasDelaySlot = 1;
|
2014-05-07 10:27:09 +00:00
|
|
|
let AdditionalPredicates = [RelocPIC];
|
2012-06-14 01:17:59 +00:00
|
|
|
let Defs = [AT];
|
2011-12-06 03:34:48 +00:00
|
|
|
}
|
2007-06-06 07:42:06 +00:00
|
|
|
|
2012-07-10 00:19:06 +00:00
|
|
|
// Base class for indirect branch and return instruction classes.
|
|
|
|
let isTerminator=1, isBarrier=1, hasDelaySlot = 1 in
|
2013-10-29 16:38:59 +00:00
|
|
|
class JumpFR<string opstr, RegisterOperand RO,
|
|
|
|
SDPatternOperator operator = null_frag>:
|
|
|
|
InstSE<(outs), (ins RO:$rs), "jr\t$rs", [(operator RO:$rs)], IIBranch,
|
|
|
|
FrmR, opstr>;
|
2007-06-06 07:42:06 +00:00
|
|
|
|
2012-07-10 00:19:06 +00:00
|
|
|
// Indirect branch
|
2013-10-29 16:38:59 +00:00
|
|
|
class IndirectBranch<string opstr, RegisterOperand RO> :
|
|
|
|
JumpFR<opstr, RO, brind> {
|
2012-07-10 00:19:06 +00:00
|
|
|
let isBranch = 1;
|
|
|
|
let isIndirectBranch = 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Return instruction
|
2013-10-29 16:38:59 +00:00
|
|
|
class RetBase<string opstr, RegisterOperand RO>: JumpFR<opstr, RO> {
|
2012-07-10 00:19:06 +00:00
|
|
|
let isReturn = 1;
|
|
|
|
let isCodeGenOnly = 1;
|
|
|
|
let hasCtrlDep = 1;
|
|
|
|
let hasExtraSrcRegAllocReq = 1;
|
|
|
|
}
|
|
|
|
|
2007-06-06 07:42:06 +00:00
|
|
|
// Jump and Link (Call)
|
2012-07-10 00:19:06 +00:00
|
|
|
let isCall=1, hasDelaySlot=1, Defs = [RA] in {
|
2013-10-29 16:38:59 +00:00
|
|
|
class JumpLink<string opstr, DAGOperand opnd> :
|
|
|
|
InstSE<(outs), (ins opnd:$target), !strconcat(opstr, "\t$target"),
|
|
|
|
[(MipsJmpLink imm:$target)], IIBranch, FrmJ, opstr> {
|
2012-12-21 23:03:50 +00:00
|
|
|
let DecoderMethod = "DecodeJumpTarget";
|
2011-10-12 00:56:06 +00:00
|
|
|
}
|
2007-08-18 02:37:46 +00:00
|
|
|
|
2013-08-06 22:20:40 +00:00
|
|
|
class JumpLinkRegPseudo<RegisterOperand RO, Instruction JALRInst,
|
|
|
|
Register RetReg, RegisterOperand ResRO = RO>:
|
|
|
|
PseudoSE<(outs), (ins RO:$rs), [(MipsJmpLink RO:$rs)], IIBranch>,
|
|
|
|
PseudoInstExpansion<(JALRInst RetReg, ResRO:$rs)>;
|
2013-02-07 19:48:00 +00:00
|
|
|
|
2013-08-06 22:20:40 +00:00
|
|
|
class JumpLinkReg<string opstr, RegisterOperand RO>:
|
|
|
|
InstSE<(outs RO:$rd), (ins RO:$rs), !strconcat(opstr, "\t$rd, $rs"),
|
2014-03-20 10:18:24 +00:00
|
|
|
[], IIBranch, FrmR>;
|
2012-12-21 23:03:50 +00:00
|
|
|
|
2013-11-04 14:53:22 +00:00
|
|
|
class BGEZAL_FT<string opstr, DAGOperand opnd, RegisterOperand RO> :
|
|
|
|
InstSE<(outs), (ins RO:$rs, opnd:$offset),
|
|
|
|
!strconcat(opstr, "\t$rs, $offset"), [], IIBranch, FrmI, opstr>;
|
2012-12-21 23:15:59 +00:00
|
|
|
|
2007-08-18 02:37:46 +00:00
|
|
|
}
|
2007-06-06 07:42:06 +00:00
|
|
|
|
2013-11-27 23:58:32 +00:00
|
|
|
let isCall = 1, isTerminator = 1, isReturn = 1, isBarrier = 1, hasDelaySlot = 1,
|
|
|
|
hasExtraSrcRegAllocReq = 1, Defs = [AT] in {
|
|
|
|
class TailCall<Instruction JumpInst> :
|
|
|
|
PseudoSE<(outs), (ins calltarget:$target), [], IIBranch>,
|
|
|
|
PseudoInstExpansion<(JumpInst jmptarget:$target)>;
|
|
|
|
|
|
|
|
class TailCallReg<RegisterOperand RO, Instruction JRInst,
|
|
|
|
RegisterOperand ResRO = RO> :
|
|
|
|
PseudoSE<(outs), (ins RO:$rs), [(MipsTailCall RO:$rs)], IIBranch>,
|
|
|
|
PseudoInstExpansion<(JRInst ResRO:$rs)>;
|
|
|
|
}
|
|
|
|
|
2013-07-30 20:24:24 +00:00
|
|
|
class BAL_BR_Pseudo<Instruction RealInst> :
|
|
|
|
PseudoSE<(outs), (ins brtarget:$offset), [], IIBranch>,
|
|
|
|
PseudoInstExpansion<(RealInst ZERO, brtarget:$offset)> {
|
2012-12-21 23:15:59 +00:00
|
|
|
let isBranch = 1;
|
|
|
|
let isTerminator = 1;
|
|
|
|
let isBarrier = 1;
|
|
|
|
let hasDelaySlot = 1;
|
|
|
|
let Defs = [RA];
|
|
|
|
}
|
2013-07-30 20:24:24 +00:00
|
|
|
|
2013-07-12 09:25:35 +00:00
|
|
|
// Syscall
|
|
|
|
class SYS_FT<string opstr> :
|
|
|
|
InstSE<(outs), (ins uimm20:$code_),
|
2013-12-19 16:25:00 +00:00
|
|
|
!strconcat(opstr, "\t$code_"), [], NoItinerary, FrmI, opstr>;
|
2013-07-12 09:25:35 +00:00
|
|
|
// Break
|
|
|
|
class BRK_FT<string opstr> :
|
|
|
|
InstSE<(outs), (ins uimm10:$code_1, uimm10:$code_2),
|
2013-12-19 16:25:00 +00:00
|
|
|
!strconcat(opstr, "\t$code_1, $code_2"), [], NoItinerary,
|
|
|
|
FrmOther, opstr>;
|
2012-12-21 23:15:59 +00:00
|
|
|
|
2013-07-17 14:05:19 +00:00
|
|
|
// (D)Eret
|
|
|
|
class ER_FT<string opstr> :
|
|
|
|
InstSE<(outs), (ins),
|
2013-12-19 16:25:00 +00:00
|
|
|
opstr, [], NoItinerary, FrmOther, opstr>;
|
2013-07-17 14:05:19 +00:00
|
|
|
|
2013-08-12 13:07:23 +00:00
|
|
|
// Interrupts
|
|
|
|
class DEI_FT<string opstr, RegisterOperand RO> :
|
|
|
|
InstSE<(outs RO:$rt), (ins),
|
2013-12-19 16:25:00 +00:00
|
|
|
!strconcat(opstr, "\t$rt"), [], NoItinerary, FrmOther, opstr>;
|
2013-08-12 13:07:23 +00:00
|
|
|
|
2013-08-16 10:17:03 +00:00
|
|
|
// Wait
|
|
|
|
class WAIT_FT<string opstr> :
|
2013-12-19 16:25:00 +00:00
|
|
|
InstSE<(outs), (ins), opstr, [], NoItinerary, FrmOther, opstr>;
|
2013-08-16 10:17:03 +00:00
|
|
|
|
2012-12-21 23:17:36 +00:00
|
|
|
// Sync
|
|
|
|
let hasSideEffects = 1 in
|
2013-12-19 16:25:00 +00:00
|
|
|
class SYNC_FT<string opstr> :
|
2012-12-21 23:17:36 +00:00
|
|
|
InstSE<(outs), (ins i32imm:$stype), "sync $stype", [(MipsSync imm:$stype)],
|
2013-12-19 16:25:00 +00:00
|
|
|
NoItinerary, FrmOther, opstr>;
|
2012-12-21 23:15:59 +00:00
|
|
|
|
2013-05-20 18:07:43 +00:00
|
|
|
let hasSideEffects = 1 in
|
|
|
|
class TEQ_FT<string opstr, RegisterOperand RO> :
|
|
|
|
InstSE<(outs), (ins RO:$rs, RO:$rt, uimm16:$code_),
|
2013-11-07 14:35:24 +00:00
|
|
|
!strconcat(opstr, "\t$rs, $rt, $code_"), [], NoItinerary,
|
|
|
|
FrmI, opstr>;
|
2013-05-20 18:07:43 +00:00
|
|
|
|
2013-08-26 10:02:40 +00:00
|
|
|
class TEQI_FT<string opstr, RegisterOperand RO> :
|
|
|
|
InstSE<(outs), (ins RO:$rs, uimm16:$imm16),
|
2013-11-13 13:15:03 +00:00
|
|
|
!strconcat(opstr, "\t$rs, $imm16"), [], NoItinerary, FrmOther, opstr>;
|
2007-10-26 04:00:13 +00:00
|
|
|
// Mul, Div
|
2013-01-12 01:03:14 +00:00
|
|
|
class Mult<string opstr, InstrItinClass itin, RegisterOperand RO,
|
2012-12-21 23:17:36 +00:00
|
|
|
list<Register> DefRegs> :
|
2013-01-12 01:03:14 +00:00
|
|
|
InstSE<(outs), (ins RO:$rs, RO:$rt), !strconcat(opstr, "\t$rs, $rt"), [],
|
2013-04-19 19:03:11 +00:00
|
|
|
itin, FrmR, opstr> {
|
2011-10-12 00:56:06 +00:00
|
|
|
let isCommutable = 1;
|
2011-10-17 18:21:24 +00:00
|
|
|
let Defs = DefRegs;
|
2012-04-03 02:51:09 +00:00
|
|
|
let neverHasSideEffects = 1;
|
2011-10-12 00:56:06 +00:00
|
|
|
}
|
2011-03-04 21:03:24 +00:00
|
|
|
|
2013-03-30 01:36:35 +00:00
|
|
|
// Pseudo multiply/divide instruction with explicit accumulator register
|
|
|
|
// operands.
|
|
|
|
class MultDivPseudo<Instruction RealInst, RegisterClass R0, RegisterOperand R1,
|
|
|
|
SDPatternOperator OpNode, InstrItinClass Itin,
|
2013-05-20 18:07:43 +00:00
|
|
|
bit IsComm = 1, bit HasSideEffects = 0,
|
|
|
|
bit UsesCustomInserter = 0> :
|
2013-03-30 01:36:35 +00:00
|
|
|
PseudoSE<(outs R0:$ac), (ins R1:$rs, R1:$rt),
|
|
|
|
[(set R0:$ac, (OpNode R1:$rs, R1:$rt))], Itin>,
|
|
|
|
PseudoInstExpansion<(RealInst R1:$rs, R1:$rt)> {
|
|
|
|
let isCommutable = IsComm;
|
|
|
|
let hasSideEffects = HasSideEffects;
|
2013-05-20 18:07:43 +00:00
|
|
|
let usesCustomInserter = UsesCustomInserter;
|
2013-03-30 01:36:35 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
// Pseudo multiply add/sub instruction with explicit accumulator register
|
|
|
|
// operands.
|
2014-01-17 14:32:41 +00:00
|
|
|
class MAddSubPseudo<Instruction RealInst, SDPatternOperator OpNode,
|
|
|
|
InstrItinClass itin>
|
2013-08-08 21:54:26 +00:00
|
|
|
: PseudoSE<(outs ACC64:$ac),
|
|
|
|
(ins GPR32Opnd:$rs, GPR32Opnd:$rt, ACC64:$acin),
|
|
|
|
[(set ACC64:$ac,
|
|
|
|
(OpNode GPR32Opnd:$rs, GPR32Opnd:$rt, ACC64:$acin))],
|
2014-01-17 14:32:41 +00:00
|
|
|
itin>,
|
2013-08-06 23:08:38 +00:00
|
|
|
PseudoInstExpansion<(RealInst GPR32Opnd:$rs, GPR32Opnd:$rt)> {
|
2013-03-30 01:36:35 +00:00
|
|
|
string Constraints = "$acin = $ac";
|
|
|
|
}
|
|
|
|
|
|
|
|
class Div<string opstr, InstrItinClass itin, RegisterOperand RO,
|
2012-12-21 23:17:36 +00:00
|
|
|
list<Register> DefRegs> :
|
2013-03-30 01:36:35 +00:00
|
|
|
InstSE<(outs), (ins RO:$rs, RO:$rt), !strconcat(opstr, "\t$$zero, $rs, $rt"),
|
2013-09-14 07:15:21 +00:00
|
|
|
[], itin, FrmR, opstr> {
|
2011-10-17 18:21:24 +00:00
|
|
|
let Defs = DefRegs;
|
2011-03-04 21:03:24 +00:00
|
|
|
}
|
2007-06-06 07:42:06 +00:00
|
|
|
|
2007-10-26 04:00:13 +00:00
|
|
|
// Move from Hi/Lo
|
2013-10-07 18:49:46 +00:00
|
|
|
class PseudoMFLOHI<RegisterClass DstRC, RegisterClass SrcRC, SDNode OpNode>
|
|
|
|
: PseudoSE<(outs DstRC:$rd), (ins SrcRC:$hilo),
|
2014-01-17 14:17:34 +00:00
|
|
|
[(set DstRC:$rd, (OpNode SrcRC:$hilo))], II_MFHI_MFLO>;
|
2013-10-07 18:49:46 +00:00
|
|
|
|
|
|
|
class MoveFromLOHI<string opstr, RegisterOperand RO, Register UseReg>:
|
2014-01-17 14:17:34 +00:00
|
|
|
InstSE<(outs RO:$rd), (ins), !strconcat(opstr, "\t$rd"), [], II_MFHI_MFLO,
|
|
|
|
FrmR, opstr> {
|
2013-10-07 18:49:46 +00:00
|
|
|
let Uses = [UseReg];
|
2012-04-03 02:51:09 +00:00
|
|
|
let neverHasSideEffects = 1;
|
2011-10-12 00:56:06 +00:00
|
|
|
}
|
2007-06-06 07:42:06 +00:00
|
|
|
|
2013-10-15 01:48:30 +00:00
|
|
|
class PseudoMTLOHI<RegisterClass DstRC, RegisterClass SrcRC>
|
|
|
|
: PseudoSE<(outs DstRC:$lohi), (ins SrcRC:$lo, SrcRC:$hi),
|
2014-01-17 14:17:34 +00:00
|
|
|
[(set DstRC:$lohi, (MipsMTLOHI SrcRC:$lo, SrcRC:$hi))],
|
|
|
|
II_MTHI_MTLO>;
|
2013-10-15 01:48:30 +00:00
|
|
|
|
2013-08-06 22:20:40 +00:00
|
|
|
class MoveToLOHI<string opstr, RegisterOperand RO, list<Register> DefRegs>:
|
2014-01-17 14:17:34 +00:00
|
|
|
InstSE<(outs), (ins RO:$rs), !strconcat(opstr, "\t$rs"), [], II_MTHI_MTLO,
|
2013-09-06 12:53:21 +00:00
|
|
|
FrmR, opstr> {
|
2011-10-17 18:24:15 +00:00
|
|
|
let Defs = DefRegs;
|
2012-04-03 02:51:09 +00:00
|
|
|
let neverHasSideEffects = 1;
|
2011-10-03 19:28:44 +00:00
|
|
|
}
|
2008-08-02 19:42:36 +00:00
|
|
|
|
2013-08-20 21:08:22 +00:00
|
|
|
class EffectiveAddress<string opstr, RegisterOperand RO> :
|
|
|
|
InstSE<(outs RO:$rt), (ins mem_ea:$addr), !strconcat(opstr, "\t$rt, $addr"),
|
2013-12-25 10:14:07 +00:00
|
|
|
[(set RO:$rt, addr:$addr)], NoItinerary, FrmI,
|
|
|
|
!strconcat(opstr, "_lea")> {
|
2012-12-21 23:21:32 +00:00
|
|
|
let isCodeGenOnly = 1;
|
|
|
|
let DecoderMethod = "DecodeMem";
|
2012-08-06 23:29:06 +00:00
|
|
|
}
|
2007-06-06 07:42:06 +00:00
|
|
|
|
2008-08-08 06:16:31 +00:00
|
|
|
// Count Leading Ones/Zeros in Word
|
2013-01-12 01:03:14 +00:00
|
|
|
class CountLeading0<string opstr, RegisterOperand RO>:
|
|
|
|
InstSE<(outs RO:$rd), (ins RO:$rs), !strconcat(opstr, "\t$rd, $rs"),
|
[mips][sched] Split IIArith in preparation for the first scheduler targeting a specific MIPS CPU.
IIArith -> II_ADD, II_ADDU, II_AND, II_CL[ZO], II_DADDIU, II_DADDU,
II_DROTR, II_DROTR32, II_DROTRV, II_DSLL, II_DSLL32, II_DSLLV,
II_DSR[AL], II_DSR[AL]32, II_DSR[AL]V, II_DSUBU, II_LUI, II_MOV[ZFNT],
II_NOR, II_OR, II_RDHWR, II_ROTR, II_ROTRV, II_SLL, II_SLLV, II_SR[AL],
II_SR[AL]V, II_SUBU, II_XOR
No functional change since the InstrItinData's have been duplicated.
This is necessary because the classes are shared between all schedulers.
Once this patch series is committed there will be an InstrItinClass for
each mnemonic with minimal grouping. This does increase the size of the
itinerary tables for each MIPS scheduler but we have a few options for dealing
with that later. These options include reducing the number of classes once
we see the best way to simplify them, or by extending tablegen to be able
to compress the table by eliminating duplicates entries, etc.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@199391 91177308-0d34-0410-b5e6-96231b3b80d8
2014-01-16 14:27:20 +00:00
|
|
|
[(set RO:$rd, (ctlz RO:$rs))], II_CLZ, FrmR, opstr>,
|
2014-05-07 10:27:09 +00:00
|
|
|
AdditionalRequires<[HasBitCount]>;
|
2012-12-21 22:43:58 +00:00
|
|
|
|
2013-01-12 01:03:14 +00:00
|
|
|
class CountLeading1<string opstr, RegisterOperand RO>:
|
|
|
|
InstSE<(outs RO:$rd), (ins RO:$rs), !strconcat(opstr, "\t$rd, $rs"),
|
[mips][sched] Split IIArith in preparation for the first scheduler targeting a specific MIPS CPU.
IIArith -> II_ADD, II_ADDU, II_AND, II_CL[ZO], II_DADDIU, II_DADDU,
II_DROTR, II_DROTR32, II_DROTRV, II_DSLL, II_DSLL32, II_DSLLV,
II_DSR[AL], II_DSR[AL]32, II_DSR[AL]V, II_DSUBU, II_LUI, II_MOV[ZFNT],
II_NOR, II_OR, II_RDHWR, II_ROTR, II_ROTRV, II_SLL, II_SLLV, II_SR[AL],
II_SR[AL]V, II_SUBU, II_XOR
No functional change since the InstrItinData's have been duplicated.
This is necessary because the classes are shared between all schedulers.
Once this patch series is committed there will be an InstrItinClass for
each mnemonic with minimal grouping. This does increase the size of the
itinerary tables for each MIPS scheduler but we have a few options for dealing
with that later. These options include reducing the number of classes once
we see the best way to simplify them, or by extending tablegen to be able
to compress the table by eliminating duplicates entries, etc.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@199391 91177308-0d34-0410-b5e6-96231b3b80d8
2014-01-16 14:27:20 +00:00
|
|
|
[(set RO:$rd, (ctlz (not RO:$rs)))], II_CLO, FrmR, opstr>,
|
2014-05-07 10:27:09 +00:00
|
|
|
AdditionalRequires<[HasBitCount]>;
|
2011-10-17 18:26:37 +00:00
|
|
|
|
2008-08-08 06:16:31 +00:00
|
|
|
// Sign Extend in Register.
|
2014-01-16 16:19:38 +00:00
|
|
|
class SignExtInReg<string opstr, ValueType vt, RegisterOperand RO,
|
|
|
|
InstrItinClass itin> :
|
2013-08-06 22:20:40 +00:00
|
|
|
InstSE<(outs RO:$rd), (ins RO:$rt), !strconcat(opstr, "\t$rd, $rt"),
|
2014-05-07 14:11:46 +00:00
|
|
|
[(set RO:$rd, (sext_inreg RO:$rt, vt))], itin, FrmR, opstr>,
|
|
|
|
INSN_SEINREG;
|
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
|
|
|
|
2011-12-20 23:47:44 +00:00
|
|
|
// Subword Swap
|
2013-01-12 01:03:14 +00:00
|
|
|
class SubwordSwap<string opstr, RegisterOperand RO>:
|
|
|
|
InstSE<(outs RO:$rd), (ins RO:$rt), !strconcat(opstr, "\t$rd, $rt"), [],
|
2014-05-07 14:11:46 +00:00
|
|
|
NoItinerary, FrmR, opstr>, INSN_SWAP {
|
2012-04-03 02:51:09 +00:00
|
|
|
let neverHasSideEffects = 1;
|
2011-10-12 00:56:06 +00:00
|
|
|
}
|
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
|
|
|
|
2011-05-31 02:53:58 +00:00
|
|
|
// Read Hardware
|
2013-08-06 22:20:40 +00:00
|
|
|
class ReadHardware<RegisterOperand CPURegOperand, RegisterOperand RO> :
|
|
|
|
InstSE<(outs CPURegOperand:$rt), (ins RO:$rd), "rdhwr\t$rt, $rd", [],
|
[mips][sched] Split IIArith in preparation for the first scheduler targeting a specific MIPS CPU.
IIArith -> II_ADD, II_ADDU, II_AND, II_CL[ZO], II_DADDIU, II_DADDU,
II_DROTR, II_DROTR32, II_DROTRV, II_DSLL, II_DSLL32, II_DSLLV,
II_DSR[AL], II_DSR[AL]32, II_DSR[AL]V, II_DSUBU, II_LUI, II_MOV[ZFNT],
II_NOR, II_OR, II_RDHWR, II_ROTR, II_ROTRV, II_SLL, II_SLLV, II_SR[AL],
II_SR[AL]V, II_SUBU, II_XOR
No functional change since the InstrItinData's have been duplicated.
This is necessary because the classes are shared between all schedulers.
Once this patch series is committed there will be an InstrItinClass for
each mnemonic with minimal grouping. This does increase the size of the
itinerary tables for each MIPS scheduler but we have a few options for dealing
with that later. These options include reducing the number of classes once
we see the best way to simplify them, or by extending tablegen to be able
to compress the table by eliminating duplicates entries, etc.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@199391 91177308-0d34-0410-b5e6-96231b3b80d8
2014-01-16 14:27:20 +00:00
|
|
|
II_RDHWR, FrmR>;
|
2011-05-31 02:53:58 +00:00
|
|
|
|
2011-08-17 22:59:46 +00:00
|
|
|
// Ext and Ins
|
2013-09-07 00:02:02 +00:00
|
|
|
class ExtBase<string opstr, RegisterOperand RO, Operand PosOpnd,
|
|
|
|
SDPatternOperator Op = null_frag>:
|
|
|
|
InstSE<(outs RO:$rt), (ins RO:$rs, PosOpnd:$pos, size_ext:$size),
|
2012-12-21 23:21:32 +00:00
|
|
|
!strconcat(opstr, " $rt, $rs, $pos, $size"),
|
2013-09-07 00:02:02 +00:00
|
|
|
[(set RO:$rt, (Op RO:$rs, imm:$pos, imm:$size))], NoItinerary,
|
2014-05-07 13:57:22 +00:00
|
|
|
FrmR, opstr>, ISA_MIPS32R2;
|
2011-12-05 21:14:28 +00:00
|
|
|
|
2013-09-07 00:02:02 +00:00
|
|
|
class InsBase<string opstr, RegisterOperand RO, Operand PosOpnd,
|
|
|
|
SDPatternOperator Op = null_frag>:
|
|
|
|
InstSE<(outs RO:$rt), (ins RO:$rs, PosOpnd:$pos, size_ins:$size, RO:$src),
|
2012-12-21 23:21:32 +00:00
|
|
|
!strconcat(opstr, " $rt, $rs, $pos, $size"),
|
2013-09-07 00:02:02 +00:00
|
|
|
[(set RO:$rt, (Op RO:$rs, imm:$pos, imm:$size, RO:$src))],
|
2014-05-07 13:57:22 +00:00
|
|
|
NoItinerary, FrmR, opstr>, ISA_MIPS32R2 {
|
2011-12-05 21:14:28 +00:00
|
|
|
let Constraints = "$src = $rt";
|
2011-08-17 22:59:46 +00:00
|
|
|
}
|
|
|
|
|
2011-07-20 00:23:01 +00:00
|
|
|
// Atomic instructions with 2 source operands (ATOMIC_SWAP & ATOMIC_LOAD_*).
|
2013-08-20 21:08:22 +00:00
|
|
|
class Atomic2Ops<PatFrag Op, RegisterClass DRC> :
|
|
|
|
PseudoSE<(outs DRC:$dst), (ins PtrRC:$ptr, DRC:$incr),
|
|
|
|
[(set DRC:$dst, (Op iPTR:$ptr, DRC:$incr))]>;
|
2011-07-20 00:23:01 +00:00
|
|
|
|
|
|
|
// Atomic Compare & Swap.
|
2013-08-20 21:08:22 +00:00
|
|
|
class AtomicCmpSwap<PatFrag Op, RegisterClass DRC> :
|
|
|
|
PseudoSE<(outs DRC:$dst), (ins PtrRC:$ptr, DRC:$cmp, DRC:$swap),
|
|
|
|
[(set DRC:$dst, (Op iPTR:$ptr, DRC:$cmp, DRC:$swap))]>;
|
2011-11-11 04:14:30 +00:00
|
|
|
|
2013-08-20 21:08:22 +00:00
|
|
|
class LLBase<string opstr, RegisterOperand RO> :
|
|
|
|
InstSE<(outs RO:$rt), (ins mem:$addr), !strconcat(opstr, "\t$rt, $addr"),
|
2012-12-21 23:01:24 +00:00
|
|
|
[], NoItinerary, FrmI> {
|
|
|
|
let DecoderMethod = "DecodeMem";
|
2011-11-11 04:14:30 +00:00
|
|
|
let mayLoad = 1;
|
|
|
|
}
|
|
|
|
|
2013-08-20 21:08:22 +00:00
|
|
|
class SCBase<string opstr, RegisterOperand RO> :
|
|
|
|
InstSE<(outs RO:$dst), (ins RO:$rt, mem:$addr),
|
2012-12-21 23:01:24 +00:00
|
|
|
!strconcat(opstr, "\t$rt, $addr"), [], NoItinerary, FrmI> {
|
|
|
|
let DecoderMethod = "DecodeMem";
|
2011-11-11 04:14:30 +00:00
|
|
|
let mayStore = 1;
|
|
|
|
let Constraints = "$rt = $dst";
|
|
|
|
}
|
2011-07-20 00:23:01 +00:00
|
|
|
|
2013-08-28 00:42:50 +00:00
|
|
|
class MFC3OP<string asmstr, RegisterOperand RO> :
|
|
|
|
InstSE<(outs RO:$rt, RO:$rd, uimm16:$sel), (ins),
|
|
|
|
!strconcat(asmstr, "\t$rt, $rd, $sel"), [], NoItinerary, FrmFR>;
|
2013-01-04 19:13:49 +00:00
|
|
|
|
2013-09-06 23:52:46 +00:00
|
|
|
class TrapBase<Instruction RealInst>
|
|
|
|
: PseudoSE<(outs), (ins), [(trap)], NoItinerary>,
|
|
|
|
PseudoInstExpansion<(RealInst 0, 0)> {
|
|
|
|
let isBarrier = 1;
|
|
|
|
let isTerminator = 1;
|
|
|
|
let isCodeGenOnly = 1;
|
2013-07-26 20:58:55 +00:00
|
|
|
}
|
|
|
|
|
2011-04-15 21:51:11 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
2007-06-06 07:42:06 +00:00
|
|
|
// Pseudo instructions
|
2011-04-15 21:51:11 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
2007-06-06 07:42:06 +00:00
|
|
|
|
2012-07-10 00:19:06 +00:00
|
|
|
// Return RA.
|
|
|
|
let isReturn=1, isTerminator=1, hasDelaySlot=1, isBarrier=1, hasCtrlDep=1 in
|
2012-12-20 04:20:09 +00:00
|
|
|
def RetRA : PseudoSE<(outs), (ins), [(MipsRet)]>;
|
2012-07-10 00:19:06 +00:00
|
|
|
|
2012-07-31 19:13:07 +00:00
|
|
|
let Defs = [SP], Uses = [SP], hasSideEffects = 1 in {
|
|
|
|
def ADJCALLSTACKDOWN : MipsPseudo<(outs), (ins i32imm:$amt),
|
2008-10-11 22:08:30 +00:00
|
|
|
[(callseq_start timm:$amt)]>;
|
2012-07-31 19:13:07 +00:00
|
|
|
def ADJCALLSTACKUP : MipsPseudo<(outs), (ins i32imm:$amt1, i32imm:$amt2),
|
2008-10-11 22:08:30 +00:00
|
|
|
[(callseq_end timm:$amt1, timm:$amt2)]>;
|
2007-09-11 19:55:27 +00:00
|
|
|
}
|
2007-06-06 07:42:06 +00:00
|
|
|
|
2011-05-31 02:54:07 +00:00
|
|
|
let usesCustomInserter = 1 in {
|
2013-08-20 21:08:22 +00:00
|
|
|
def ATOMIC_LOAD_ADD_I8 : Atomic2Ops<atomic_load_add_8, GPR32>;
|
|
|
|
def ATOMIC_LOAD_ADD_I16 : Atomic2Ops<atomic_load_add_16, GPR32>;
|
|
|
|
def ATOMIC_LOAD_ADD_I32 : Atomic2Ops<atomic_load_add_32, GPR32>;
|
|
|
|
def ATOMIC_LOAD_SUB_I8 : Atomic2Ops<atomic_load_sub_8, GPR32>;
|
|
|
|
def ATOMIC_LOAD_SUB_I16 : Atomic2Ops<atomic_load_sub_16, GPR32>;
|
|
|
|
def ATOMIC_LOAD_SUB_I32 : Atomic2Ops<atomic_load_sub_32, GPR32>;
|
|
|
|
def ATOMIC_LOAD_AND_I8 : Atomic2Ops<atomic_load_and_8, GPR32>;
|
|
|
|
def ATOMIC_LOAD_AND_I16 : Atomic2Ops<atomic_load_and_16, GPR32>;
|
|
|
|
def ATOMIC_LOAD_AND_I32 : Atomic2Ops<atomic_load_and_32, GPR32>;
|
|
|
|
def ATOMIC_LOAD_OR_I8 : Atomic2Ops<atomic_load_or_8, GPR32>;
|
|
|
|
def ATOMIC_LOAD_OR_I16 : Atomic2Ops<atomic_load_or_16, GPR32>;
|
|
|
|
def ATOMIC_LOAD_OR_I32 : Atomic2Ops<atomic_load_or_32, GPR32>;
|
|
|
|
def ATOMIC_LOAD_XOR_I8 : Atomic2Ops<atomic_load_xor_8, GPR32>;
|
|
|
|
def ATOMIC_LOAD_XOR_I16 : Atomic2Ops<atomic_load_xor_16, GPR32>;
|
|
|
|
def ATOMIC_LOAD_XOR_I32 : Atomic2Ops<atomic_load_xor_32, GPR32>;
|
|
|
|
def ATOMIC_LOAD_NAND_I8 : Atomic2Ops<atomic_load_nand_8, GPR32>;
|
|
|
|
def ATOMIC_LOAD_NAND_I16 : Atomic2Ops<atomic_load_nand_16, GPR32>;
|
|
|
|
def ATOMIC_LOAD_NAND_I32 : Atomic2Ops<atomic_load_nand_32, GPR32>;
|
|
|
|
|
|
|
|
def ATOMIC_SWAP_I8 : Atomic2Ops<atomic_swap_8, GPR32>;
|
|
|
|
def ATOMIC_SWAP_I16 : Atomic2Ops<atomic_swap_16, GPR32>;
|
|
|
|
def ATOMIC_SWAP_I32 : Atomic2Ops<atomic_swap_32, GPR32>;
|
|
|
|
|
|
|
|
def ATOMIC_CMP_SWAP_I8 : AtomicCmpSwap<atomic_cmp_swap_8, GPR32>;
|
|
|
|
def ATOMIC_CMP_SWAP_I16 : AtomicCmpSwap<atomic_cmp_swap_16, GPR32>;
|
|
|
|
def ATOMIC_CMP_SWAP_I32 : AtomicCmpSwap<atomic_cmp_swap_32, GPR32>;
|
2011-05-31 02:54:07 +00:00
|
|
|
}
|
|
|
|
|
2013-04-30 23:22:09 +00:00
|
|
|
/// Pseudo instructions for loading and storing accumulator registers.
|
2013-08-01 23:14:16 +00:00
|
|
|
let isPseudo = 1, isCodeGenOnly = 1 in {
|
2013-08-20 21:08:22 +00:00
|
|
|
def LOAD_ACC64 : Load<"", ACC64>;
|
|
|
|
def STORE_ACC64 : Store<"", ACC64>;
|
2013-03-30 00:54:52 +00:00
|
|
|
}
|
|
|
|
|
2014-04-30 15:06:25 +00:00
|
|
|
// We need these two pseudo instructions to avoid offset calculation for long
|
|
|
|
// branches. See the comment in file MipsLongBranch.cpp for detailed
|
|
|
|
// explanation.
|
|
|
|
|
|
|
|
// Expands to: lui $dst, %hi($tgt - $baltgt)
|
|
|
|
def LONG_BRANCH_LUi : PseudoSE<(outs GPR32Opnd:$dst),
|
|
|
|
(ins brtarget:$tgt, brtarget:$baltgt), []>;
|
|
|
|
|
|
|
|
// Expands to: addiu $dst, $src, %lo($tgt - $baltgt)
|
|
|
|
def LONG_BRANCH_ADDiu : PseudoSE<(outs GPR32Opnd:$dst),
|
|
|
|
(ins GPR32Opnd:$src, brtarget:$tgt, brtarget:$baltgt), []>;
|
|
|
|
|
2011-04-15 21:51:11 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
2007-06-06 07:42:06 +00:00
|
|
|
// Instruction definition
|
2011-04-15 21:51:11 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
//===----------------------------------------------------------------------===//
|
2007-08-18 02:37:46 +00:00
|
|
|
// MipsI Instructions
|
2011-04-15 21:51:11 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
2007-06-06 07:42:06 +00:00
|
|
|
|
2008-07-30 16:58:59 +00:00
|
|
|
/// Arithmetic Instructions (ALU Immediate)
|
[mips][sched] Split IIArith in preparation for the first scheduler targeting a specific MIPS CPU.
IIArith -> II_ADD, II_ADDU, II_AND, II_CL[ZO], II_DADDIU, II_DADDU,
II_DROTR, II_DROTR32, II_DROTRV, II_DSLL, II_DSLL32, II_DSLLV,
II_DSR[AL], II_DSR[AL]32, II_DSR[AL]V, II_DSUBU, II_LUI, II_MOV[ZFNT],
II_NOR, II_OR, II_RDHWR, II_ROTR, II_ROTRV, II_SLL, II_SLLV, II_SR[AL],
II_SR[AL]V, II_SUBU, II_XOR
No functional change since the InstrItinData's have been duplicated.
This is necessary because the classes are shared between all schedulers.
Once this patch series is committed there will be an InstrItinClass for
each mnemonic with minimal grouping. This does increase the size of the
itinerary tables for each MIPS scheduler but we have a few options for dealing
with that later. These options include reducing the number of classes once
we see the best way to simplify them, or by extending tablegen to be able
to compress the table by eliminating duplicates entries, etc.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@199391 91177308-0d34-0410-b5e6-96231b3b80d8
2014-01-16 14:27:20 +00:00
|
|
|
def ADDiu : MMRel, ArithLogicI<"addiu", simm16, GPR32Opnd, II_ADDIU, immSExt16,
|
2013-07-31 00:55:34 +00:00
|
|
|
add>,
|
2012-12-20 03:40:03 +00:00
|
|
|
ADDI_FM<0x9>, IsAsCheapAsAMove;
|
2013-08-06 23:08:38 +00:00
|
|
|
def ADDi : MMRel, ArithLogicI<"addi", simm16, GPR32Opnd>, ADDI_FM<0x8>;
|
|
|
|
def SLTi : MMRel, SetCC_I<"slti", setlt, simm16, immSExt16, GPR32Opnd>,
|
2013-04-19 19:03:11 +00:00
|
|
|
SLTI_FM<0xa>;
|
2013-08-06 23:08:38 +00:00
|
|
|
def SLTiu : MMRel, SetCC_I<"sltiu", setult, simm16, immSExt16, GPR32Opnd>,
|
2013-04-19 19:03:11 +00:00
|
|
|
SLTI_FM<0xb>;
|
2014-01-16 15:57:05 +00:00
|
|
|
def ANDi : MMRel, ArithLogicI<"andi", uimm16, GPR32Opnd, II_ANDI, immZExt16,
|
2013-07-31 00:55:34 +00:00
|
|
|
and>,
|
2013-01-18 20:15:06 +00:00
|
|
|
ADDI_FM<0xc>;
|
2014-01-16 15:57:05 +00:00
|
|
|
def ORi : MMRel, ArithLogicI<"ori", uimm16, GPR32Opnd, II_ORI, immZExt16,
|
2013-07-31 00:55:34 +00:00
|
|
|
or>,
|
2013-01-18 20:15:06 +00:00
|
|
|
ADDI_FM<0xd>;
|
2014-01-16 15:57:05 +00:00
|
|
|
def XORi : MMRel, ArithLogicI<"xori", uimm16, GPR32Opnd, II_XORI, immZExt16,
|
2013-07-31 00:55:34 +00:00
|
|
|
xor>,
|
2013-01-18 20:15:06 +00:00
|
|
|
ADDI_FM<0xe>;
|
2013-08-06 23:08:38 +00:00
|
|
|
def LUi : MMRel, LoadUpper<"lui", GPR32Opnd, uimm16>, LUI_FM;
|
2008-07-30 16:58:59 +00:00
|
|
|
|
|
|
|
/// Arithmetic Instructions (3-Operand, R-Type)
|
[mips][sched] Split IIArith in preparation for the first scheduler targeting a specific MIPS CPU.
IIArith -> II_ADD, II_ADDU, II_AND, II_CL[ZO], II_DADDIU, II_DADDU,
II_DROTR, II_DROTR32, II_DROTRV, II_DSLL, II_DSLL32, II_DSLLV,
II_DSR[AL], II_DSR[AL]32, II_DSR[AL]V, II_DSUBU, II_LUI, II_MOV[ZFNT],
II_NOR, II_OR, II_RDHWR, II_ROTR, II_ROTRV, II_SLL, II_SLLV, II_SR[AL],
II_SR[AL]V, II_SUBU, II_XOR
No functional change since the InstrItinData's have been duplicated.
This is necessary because the classes are shared between all schedulers.
Once this patch series is committed there will be an InstrItinClass for
each mnemonic with minimal grouping. This does increase the size of the
itinerary tables for each MIPS scheduler but we have a few options for dealing
with that later. These options include reducing the number of classes once
we see the best way to simplify them, or by extending tablegen to be able
to compress the table by eliminating duplicates entries, etc.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@199391 91177308-0d34-0410-b5e6-96231b3b80d8
2014-01-16 14:27:20 +00:00
|
|
|
def ADDu : MMRel, ArithLogicR<"addu", GPR32Opnd, 1, II_ADDU, add>,
|
2013-04-19 19:03:11 +00:00
|
|
|
ADD_FM<0, 0x21>;
|
[mips][sched] Split IIArith in preparation for the first scheduler targeting a specific MIPS CPU.
IIArith -> II_ADD, II_ADDU, II_AND, II_CL[ZO], II_DADDIU, II_DADDU,
II_DROTR, II_DROTR32, II_DROTRV, II_DSLL, II_DSLL32, II_DSLLV,
II_DSR[AL], II_DSR[AL]32, II_DSR[AL]V, II_DSUBU, II_LUI, II_MOV[ZFNT],
II_NOR, II_OR, II_RDHWR, II_ROTR, II_ROTRV, II_SLL, II_SLLV, II_SR[AL],
II_SR[AL]V, II_SUBU, II_XOR
No functional change since the InstrItinData's have been duplicated.
This is necessary because the classes are shared between all schedulers.
Once this patch series is committed there will be an InstrItinClass for
each mnemonic with minimal grouping. This does increase the size of the
itinerary tables for each MIPS scheduler but we have a few options for dealing
with that later. These options include reducing the number of classes once
we see the best way to simplify them, or by extending tablegen to be able
to compress the table by eliminating duplicates entries, etc.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@199391 91177308-0d34-0410-b5e6-96231b3b80d8
2014-01-16 14:27:20 +00:00
|
|
|
def SUBu : MMRel, ArithLogicR<"subu", GPR32Opnd, 0, II_SUBU, sub>,
|
2013-04-19 19:03:11 +00:00
|
|
|
ADD_FM<0, 0x23>;
|
2013-09-20 21:22:28 +00:00
|
|
|
let Defs = [HI0, LO0] in
|
2014-01-17 14:32:41 +00:00
|
|
|
def MUL : MMRel, ArithLogicR<"mul", GPR32Opnd, 1, II_MUL, mul>,
|
2013-04-19 19:03:11 +00:00
|
|
|
ADD_FM<0x1c, 2>;
|
2013-08-06 23:08:38 +00:00
|
|
|
def ADD : MMRel, ArithLogicR<"add", GPR32Opnd>, ADD_FM<0, 0x20>;
|
|
|
|
def SUB : MMRel, ArithLogicR<"sub", GPR32Opnd>, ADD_FM<0, 0x22>;
|
|
|
|
def SLT : MMRel, SetCC_R<"slt", setlt, GPR32Opnd>, ADD_FM<0, 0x2a>;
|
|
|
|
def SLTu : MMRel, SetCC_R<"sltu", setult, GPR32Opnd>, ADD_FM<0, 0x2b>;
|
2014-01-16 15:57:05 +00:00
|
|
|
def AND : MMRel, ArithLogicR<"and", GPR32Opnd, 1, II_AND, and>,
|
2013-04-19 19:03:11 +00:00
|
|
|
ADD_FM<0, 0x24>;
|
2014-01-16 15:57:05 +00:00
|
|
|
def OR : MMRel, ArithLogicR<"or", GPR32Opnd, 1, II_OR, or>,
|
2013-04-19 19:03:11 +00:00
|
|
|
ADD_FM<0, 0x25>;
|
2014-01-16 15:57:05 +00:00
|
|
|
def XOR : MMRel, ArithLogicR<"xor", GPR32Opnd, 1, II_XOR, xor>,
|
2013-04-19 19:03:11 +00:00
|
|
|
ADD_FM<0, 0x26>;
|
2013-08-06 23:08:38 +00:00
|
|
|
def NOR : MMRel, LogicNOR<"nor", GPR32Opnd>, ADD_FM<0, 0x27>;
|
2007-06-06 07:42:06 +00:00
|
|
|
|
2008-07-30 16:58:59 +00:00
|
|
|
/// Shift Instructions
|
[mips][sched] Split IIArith in preparation for the first scheduler targeting a specific MIPS CPU.
IIArith -> II_ADD, II_ADDU, II_AND, II_CL[ZO], II_DADDIU, II_DADDU,
II_DROTR, II_DROTR32, II_DROTRV, II_DSLL, II_DSLL32, II_DSLLV,
II_DSR[AL], II_DSR[AL]32, II_DSR[AL]V, II_DSUBU, II_LUI, II_MOV[ZFNT],
II_NOR, II_OR, II_RDHWR, II_ROTR, II_ROTRV, II_SLL, II_SLLV, II_SR[AL],
II_SR[AL]V, II_SUBU, II_XOR
No functional change since the InstrItinData's have been duplicated.
This is necessary because the classes are shared between all schedulers.
Once this patch series is committed there will be an InstrItinClass for
each mnemonic with minimal grouping. This does increase the size of the
itinerary tables for each MIPS scheduler but we have a few options for dealing
with that later. These options include reducing the number of classes once
we see the best way to simplify them, or by extending tablegen to be able
to compress the table by eliminating duplicates entries, etc.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@199391 91177308-0d34-0410-b5e6-96231b3b80d8
2014-01-16 14:27:20 +00:00
|
|
|
def SLL : MMRel, shift_rotate_imm<"sll", uimm5, GPR32Opnd, II_SLL, shl,
|
|
|
|
immZExt5>, SRA_FM<0, 0>;
|
|
|
|
def SRL : MMRel, shift_rotate_imm<"srl", uimm5, GPR32Opnd, II_SRL, srl,
|
|
|
|
immZExt5>, SRA_FM<2, 0>;
|
|
|
|
def SRA : MMRel, shift_rotate_imm<"sra", uimm5, GPR32Opnd, II_SRA, sra,
|
|
|
|
immZExt5>, SRA_FM<3, 0>;
|
|
|
|
def SLLV : MMRel, shift_rotate_reg<"sllv", GPR32Opnd, II_SLLV, shl>,
|
|
|
|
SRLV_FM<4, 0>;
|
|
|
|
def SRLV : MMRel, shift_rotate_reg<"srlv", GPR32Opnd, II_SRLV, srl>,
|
|
|
|
SRLV_FM<6, 0>;
|
|
|
|
def SRAV : MMRel, shift_rotate_reg<"srav", GPR32Opnd, II_SRAV, sra>,
|
|
|
|
SRLV_FM<7, 0>;
|
2010-12-09 17:32:30 +00:00
|
|
|
|
|
|
|
// Rotate Instructions
|
2014-05-07 13:57:22 +00:00
|
|
|
def ROTR : MMRel, shift_rotate_imm<"rotr", uimm5, GPR32Opnd, II_ROTR, rotr,
|
|
|
|
immZExt5>,
|
|
|
|
SRA_FM<2, 1>, ISA_MIPS32R2;
|
|
|
|
def ROTRV : MMRel, shift_rotate_reg<"rotrv", GPR32Opnd, II_ROTRV, rotr>,
|
|
|
|
SRLV_FM<6, 1>, ISA_MIPS32R2;
|
2007-06-06 07:42:06 +00:00
|
|
|
|
2008-07-30 16:58:59 +00:00
|
|
|
/// Load and Store Instructions
|
2011-10-08 02:24:10 +00:00
|
|
|
/// aligned
|
2014-01-21 15:21:14 +00:00
|
|
|
def LB : Load<"lb", GPR32Opnd, sextloadi8, II_LB>, MMRel, LW_FM<0x20>;
|
|
|
|
def LBu : Load<"lbu", GPR32Opnd, zextloadi8, II_LBU, addrDefault>, MMRel,
|
2013-08-20 21:08:22 +00:00
|
|
|
LW_FM<0x24>;
|
2014-01-21 15:21:14 +00:00
|
|
|
def LH : Load<"lh", GPR32Opnd, sextloadi16, II_LH, addrDefault>, MMRel,
|
2013-08-20 21:08:22 +00:00
|
|
|
LW_FM<0x21>;
|
2014-01-21 15:21:14 +00:00
|
|
|
def LHu : Load<"lhu", GPR32Opnd, zextloadi16, II_LHU>, MMRel, LW_FM<0x25>;
|
|
|
|
def LW : Load<"lw", GPR32Opnd, load, II_LW, addrDefault>, MMRel,
|
2013-08-20 21:08:22 +00:00
|
|
|
LW_FM<0x23>;
|
2014-01-23 10:31:31 +00:00
|
|
|
def SB : Store<"sb", GPR32Opnd, truncstorei8, II_SB>, MMRel, LW_FM<0x28>;
|
|
|
|
def SH : Store<"sh", GPR32Opnd, truncstorei16, II_SH>, MMRel, LW_FM<0x29>;
|
|
|
|
def SW : Store<"sw", GPR32Opnd, store, II_SW>, MMRel, LW_FM<0x2b>;
|
2007-06-06 07:42:06 +00:00
|
|
|
|
2012-06-02 00:04:19 +00:00
|
|
|
/// load/store left/right
|
2014-05-07 10:27:09 +00:00
|
|
|
let EncodingPredicates = []<Predicate>, // FIXME: Lack of HasStdEnc is probably a bug
|
|
|
|
AdditionalPredicates = [NotInMicroMips] in {
|
2014-01-21 15:21:14 +00:00
|
|
|
def LWL : LoadLeftRight<"lwl", MipsLWL, GPR32Opnd, II_LWL>, LW_FM<0x22>;
|
|
|
|
def LWR : LoadLeftRight<"lwr", MipsLWR, GPR32Opnd, II_LWR>, LW_FM<0x26>;
|
2014-01-23 10:31:31 +00:00
|
|
|
def SWL : StoreLeftRight<"swl", MipsSWL, GPR32Opnd, II_SWL>, LW_FM<0x2a>;
|
|
|
|
def SWR : StoreLeftRight<"swr", MipsSWR, GPR32Opnd, II_SWR>, LW_FM<0x2e>;
|
2013-11-15 08:07:34 +00:00
|
|
|
}
|
2011-11-23 22:19:28 +00:00
|
|
|
|
2013-12-19 16:25:00 +00:00
|
|
|
def SYNC : MMRel, SYNC_FT<"sync">, SYNC_FM;
|
2013-11-07 14:35:24 +00:00
|
|
|
def TEQ : MMRel, TEQ_FT<"teq", GPR32Opnd>, TEQ_FM<0x34>;
|
|
|
|
def TGE : MMRel, TEQ_FT<"tge", GPR32Opnd>, TEQ_FM<0x30>;
|
|
|
|
def TGEU : MMRel, TEQ_FT<"tgeu", GPR32Opnd>, TEQ_FM<0x31>;
|
|
|
|
def TLT : MMRel, TEQ_FT<"tlt", GPR32Opnd>, TEQ_FM<0x32>;
|
|
|
|
def TLTU : MMRel, TEQ_FT<"tltu", GPR32Opnd>, TEQ_FM<0x33>;
|
|
|
|
def TNE : MMRel, TEQ_FT<"tne", GPR32Opnd>, TEQ_FM<0x36>;
|
2013-08-26 10:02:40 +00:00
|
|
|
|
2013-11-13 13:15:03 +00:00
|
|
|
def TEQI : MMRel, TEQI_FT<"teqi", GPR32Opnd>, TEQI_FM<0xc>;
|
|
|
|
def TGEI : MMRel, TEQI_FT<"tgei", GPR32Opnd>, TEQI_FM<0x8>;
|
|
|
|
def TGEIU : MMRel, TEQI_FT<"tgeiu", GPR32Opnd>, TEQI_FM<0x9>;
|
|
|
|
def TLTI : MMRel, TEQI_FT<"tlti", GPR32Opnd>, TEQI_FM<0xa>;
|
|
|
|
def TTLTIU : MMRel, TEQI_FT<"tltiu", GPR32Opnd>, TEQI_FM<0xb>;
|
|
|
|
def TNEI : MMRel, TEQI_FT<"tnei", GPR32Opnd>, TEQI_FM<0xe>;
|
2011-07-19 23:30:50 +00:00
|
|
|
|
2013-12-19 16:25:00 +00:00
|
|
|
def BREAK : MMRel, BRK_FT<"break">, BRK_FM<0xd>;
|
|
|
|
def SYSCALL : MMRel, SYS_FT<"syscall">, SYS_FM<0xc>;
|
2013-09-06 23:52:46 +00:00
|
|
|
def TRAP : TrapBase<BREAK>;
|
2013-07-12 09:25:35 +00:00
|
|
|
|
2013-12-19 16:25:00 +00:00
|
|
|
def ERET : MMRel, ER_FT<"eret">, ER_FM<0x18>;
|
|
|
|
def DERET : MMRel, ER_FT<"deret">, ER_FM<0x1f>;
|
2013-07-17 14:05:19 +00:00
|
|
|
|
2013-12-19 16:25:00 +00:00
|
|
|
def EI : MMRel, DEI_FT<"ei", GPR32Opnd>, EI_FM<1>;
|
|
|
|
def DI : MMRel, DEI_FT<"di", GPR32Opnd>, EI_FM<0>;
|
2013-08-12 13:07:23 +00:00
|
|
|
|
2014-05-07 10:27:09 +00:00
|
|
|
let EncodingPredicates = []<Predicate>, // FIXME: Lack of HasStdEnc is probably a bug
|
|
|
|
AdditionalPredicates = [NotInMicroMips] in {
|
2014-03-20 10:41:37 +00:00
|
|
|
def WAIT : WAIT_FT<"wait">, WAIT_FM;
|
2013-08-16 10:17:03 +00:00
|
|
|
|
2011-05-31 02:54:07 +00:00
|
|
|
/// Load-linked, Store-conditional
|
2013-08-20 21:08:22 +00:00
|
|
|
def LL : LLBase<"ll", GPR32Opnd>, LW_FM<0x30>;
|
|
|
|
def SC : SCBase<"sc", GPR32Opnd>, LW_FM<0x38>;
|
2013-12-19 16:12:56 +00:00
|
|
|
}
|
2011-05-31 02:54:07 +00:00
|
|
|
|
2008-07-30 16:58:59 +00:00
|
|
|
/// Jump and Branch Instructions
|
2013-10-29 16:38:59 +00:00
|
|
|
def J : MMRel, JumpFJ<jmptarget, "j", br, bb, "j">, FJ<2>,
|
2014-05-07 10:27:09 +00:00
|
|
|
AdditionalRequires<[RelocStatic]>, IsBranch;
|
2013-10-29 16:38:59 +00:00
|
|
|
def JR : MMRel, IndirectBranch<"jr", GPR32Opnd>, MTLO_FM<8>;
|
2013-11-04 14:53:22 +00:00
|
|
|
def BEQ : MMRel, CBranch<"beq", brtarget, seteq, GPR32Opnd>, BEQ_FM<4>;
|
|
|
|
def BNE : MMRel, CBranch<"bne", brtarget, setne, GPR32Opnd>, BEQ_FM<5>;
|
|
|
|
def BGEZ : MMRel, CBranchZero<"bgez", brtarget, setge, GPR32Opnd>,
|
|
|
|
BGEZ_FM<1, 1>;
|
|
|
|
def BGTZ : MMRel, CBranchZero<"bgtz", brtarget, setgt, GPR32Opnd>,
|
|
|
|
BGEZ_FM<7, 0>;
|
|
|
|
def BLEZ : MMRel, CBranchZero<"blez", brtarget, setle, GPR32Opnd>,
|
|
|
|
BGEZ_FM<6, 0>;
|
|
|
|
def BLTZ : MMRel, CBranchZero<"bltz", brtarget, setlt, GPR32Opnd>,
|
|
|
|
BGEZ_FM<1, 0>;
|
2013-09-06 23:40:15 +00:00
|
|
|
def B : UncondBranch<BEQ>;
|
2007-08-18 02:37:46 +00:00
|
|
|
|
2013-10-29 16:38:59 +00:00
|
|
|
def JAL : MMRel, JumpLink<"jal", calltarget>, FJ<3>;
|
2014-05-07 10:27:09 +00:00
|
|
|
let AdditionalPredicates = [NotInMicroMips] in {
|
2014-03-20 10:18:24 +00:00
|
|
|
def JALR : JumpLinkReg<"jalr", GPR32Opnd>, JALR_FM;
|
2014-03-31 14:00:10 +00:00
|
|
|
def JALRPseudo : JumpLinkRegPseudo<GPR32Opnd, JALR, RA>;
|
2014-03-20 10:18:24 +00:00
|
|
|
}
|
2014-03-03 14:05:14 +00:00
|
|
|
def JALX : JumpLink<"jalx", calltarget>, FJ<0x1D>;
|
2013-11-04 14:53:22 +00:00
|
|
|
def BGEZAL : MMRel, BGEZAL_FT<"bgezal", brtarget, GPR32Opnd>, BGEZAL_FM<0x11>;
|
|
|
|
def BLTZAL : MMRel, BGEZAL_FT<"bltzal", brtarget, GPR32Opnd>, BGEZAL_FM<0x10>;
|
2013-07-30 20:24:24 +00:00
|
|
|
def BAL_BR : BAL_BR_Pseudo<BGEZAL>;
|
2013-11-27 23:58:32 +00:00
|
|
|
def TAILCALL : TailCall<J>;
|
|
|
|
def TAILCALL_R : TailCallReg<GPR32Opnd, JR>;
|
2007-06-06 07:42:06 +00:00
|
|
|
|
2013-10-29 16:38:59 +00:00
|
|
|
def RET : MMRel, RetBase<"ret", GPR32Opnd>, MTLO_FM<8>;
|
2008-07-30 16:58:59 +00:00
|
|
|
|
2013-01-30 00:26:49 +00:00
|
|
|
// Exception handling related node and instructions.
|
|
|
|
// The conversion sequence is:
|
|
|
|
// ISD::EH_RETURN -> MipsISD::EH_RETURN ->
|
|
|
|
// MIPSeh_return -> (stack change + indirect branch)
|
|
|
|
//
|
|
|
|
// MIPSeh_return takes the place of regular return instruction
|
|
|
|
// but takes two arguments (V1, V0) which are used for storing
|
|
|
|
// the offset and return address respectively.
|
|
|
|
def SDT_MipsEHRET : SDTypeProfile<0, 2, [SDTCisInt<0>, SDTCisPtrTy<1>]>;
|
|
|
|
|
|
|
|
def MIPSehret : SDNode<"MipsISD::EH_RETURN", SDT_MipsEHRET,
|
|
|
|
[SDNPHasChain, SDNPOptInGlue, SDNPVariadic]>;
|
|
|
|
|
|
|
|
let Uses = [V0, V1], isTerminator = 1, isReturn = 1, isBarrier = 1 in {
|
2013-08-06 23:08:38 +00:00
|
|
|
def MIPSeh_return32 : MipsPseudo<(outs), (ins GPR32:$spoff, GPR32:$dst),
|
|
|
|
[(MIPSehret GPR32:$spoff, GPR32:$dst)]>;
|
|
|
|
def MIPSeh_return64 : MipsPseudo<(outs), (ins GPR64:$spoff,
|
|
|
|
GPR64:$dst),
|
|
|
|
[(MIPSehret GPR64:$spoff, GPR64:$dst)]>;
|
2013-01-30 00:26:49 +00:00
|
|
|
}
|
|
|
|
|
2010-11-09 17:25:34 +00:00
|
|
|
/// Multiply and Divide Instructions.
|
2014-01-17 14:32:41 +00:00
|
|
|
def MULT : MMRel, Mult<"mult", II_MULT, GPR32Opnd, [HI0, LO0]>,
|
2013-04-19 19:03:11 +00:00
|
|
|
MULT_FM<0, 0x18>;
|
2014-01-17 14:32:41 +00:00
|
|
|
def MULTu : MMRel, Mult<"multu", II_MULTU, GPR32Opnd, [HI0, LO0]>,
|
2013-04-19 19:03:11 +00:00
|
|
|
MULT_FM<0, 0x19>;
|
2014-01-17 14:48:06 +00:00
|
|
|
def SDIV : MMRel, Div<"div", II_DIV, GPR32Opnd, [HI0, LO0]>,
|
2013-11-15 08:07:34 +00:00
|
|
|
MULT_FM<0, 0x1a>;
|
2014-01-17 14:48:06 +00:00
|
|
|
def UDIV : MMRel, Div<"divu", II_DIVU, GPR32Opnd, [HI0, LO0]>,
|
2013-11-15 08:07:34 +00:00
|
|
|
MULT_FM<0, 0x1b>;
|
2008-08-02 19:42:36 +00:00
|
|
|
|
2013-09-06 12:53:21 +00:00
|
|
|
def MTHI : MMRel, MoveToLOHI<"mthi", GPR32Opnd, [HI0]>, MTLO_FM<0x11>;
|
|
|
|
def MTLO : MMRel, MoveToLOHI<"mtlo", GPR32Opnd, [LO0]>, MTLO_FM<0x13>;
|
2014-05-07 10:27:09 +00:00
|
|
|
let EncodingPredicates = []<Predicate>, // FIXME: Lack of HasStdEnc is probably a bug
|
|
|
|
AdditionalPredicates = [NotInMicroMips] in {
|
2013-10-07 18:49:46 +00:00
|
|
|
def MFHI : MMRel, MoveFromLOHI<"mfhi", GPR32Opnd, AC0>, MFLO_FM<0x10>;
|
|
|
|
def MFLO : MMRel, MoveFromLOHI<"mflo", GPR32Opnd, AC0>, MFLO_FM<0x12>;
|
2014-04-03 12:47:34 +00:00
|
|
|
}
|
2007-06-06 07:42:06 +00:00
|
|
|
|
2008-07-30 16:58:59 +00:00
|
|
|
/// Sign Ext In Register Instructions.
|
2014-01-16 16:19:38 +00:00
|
|
|
def SEB : MMRel, SignExtInReg<"seb", i8, GPR32Opnd, II_SEB>, SEB_FM<0x10, 0x20>;
|
|
|
|
def SEH : MMRel, SignExtInReg<"seh", i16, GPR32Opnd, II_SEH>, SEB_FM<0x18, 0x20>;
|
2007-06-06 07:42:06 +00:00
|
|
|
|
2008-08-08 06:16:31 +00:00
|
|
|
/// Count Leading
|
2013-09-14 06:49:25 +00:00
|
|
|
def CLZ : MMRel, CountLeading0<"clz", GPR32Opnd>, CLO_FM<0x20>;
|
|
|
|
def CLO : MMRel, CountLeading1<"clo", GPR32Opnd>, CLO_FM<0x21>;
|
2008-08-13 07:13:40 +00:00
|
|
|
|
2011-12-20 23:47:44 +00:00
|
|
|
/// Word Swap Bytes Within Halfwords
|
2013-09-14 06:49:25 +00:00
|
|
|
def WSBH : MMRel, SubwordSwap<"wsbh", GPR32Opnd>, SEB_FM<2, 0x20>;
|
2008-08-13 07:13:40 +00:00
|
|
|
|
2012-12-21 23:03:50 +00:00
|
|
|
/// No operation.
|
2013-02-06 21:50:15 +00:00
|
|
|
def NOP : PseudoSE<(outs), (ins), []>, PseudoInstExpansion<(SLL ZERO, ZERO, 0)>;
|
2008-07-30 16:58:59 +00:00
|
|
|
|
2007-10-26 04:00:13 +00:00
|
|
|
// FrameIndexes are legalized when they are operands from load/store
|
2007-09-24 20:15:11 +00:00
|
|
|
// instructions. The same not happens for stack address copies, so an
|
|
|
|
// add op with mem ComplexPattern is used and the stack address copy
|
|
|
|
// can be matched. It's similar to Sparc LEA_ADDRi
|
2013-12-25 10:14:07 +00:00
|
|
|
def LEA_ADDiu : MMRel, EffectiveAddress<"addiu", GPR32Opnd>, LW_FM<9>;
|
2007-09-24 20:15:11 +00:00
|
|
|
|
2011-01-18 19:29:17 +00:00
|
|
|
// MADD*/MSUB*
|
2014-01-17 14:32:41 +00:00
|
|
|
def MADD : MMRel, MArithR<"madd", II_MADD, 1>, MULT_FM<0x1c, 0>;
|
|
|
|
def MADDU : MMRel, MArithR<"maddu", II_MADDU, 1>, MULT_FM<0x1c, 1>;
|
|
|
|
def MSUB : MMRel, MArithR<"msub", II_MSUB>, MULT_FM<0x1c, 4>;
|
|
|
|
def MSUBU : MMRel, MArithR<"msubu", II_MSUBU>, MULT_FM<0x1c, 5>;
|
2013-10-15 01:21:37 +00:00
|
|
|
|
2014-05-07 10:27:09 +00:00
|
|
|
let AdditionalPredicates = [NotDSP] in {
|
2014-01-17 14:32:41 +00:00
|
|
|
def PseudoMULT : MultDivPseudo<MULT, ACC64, GPR32Opnd, MipsMult, II_MULT>;
|
|
|
|
def PseudoMULTu : MultDivPseudo<MULTu, ACC64, GPR32Opnd, MipsMultu, II_MULTU>;
|
2013-10-15 01:21:37 +00:00
|
|
|
def PseudoMFHI : PseudoMFLOHI<GPR32, ACC64, MipsMFHI>;
|
|
|
|
def PseudoMFLO : PseudoMFLOHI<GPR32, ACC64, MipsMFLO>;
|
2013-10-15 01:48:30 +00:00
|
|
|
def PseudoMTLOHI : PseudoMTLOHI<ACC64, GPR32>;
|
2014-01-17 14:32:41 +00:00
|
|
|
def PseudoMADD : MAddSubPseudo<MADD, MipsMAdd, II_MADD>;
|
|
|
|
def PseudoMADDU : MAddSubPseudo<MADDU, MipsMAddu, II_MADDU>;
|
|
|
|
def PseudoMSUB : MAddSubPseudo<MSUB, MipsMSub, II_MSUB>;
|
|
|
|
def PseudoMSUBU : MAddSubPseudo<MSUBU, MipsMSubu, II_MSUBU>;
|
2013-10-15 01:21:37 +00:00
|
|
|
}
|
|
|
|
|
2014-01-17 14:48:06 +00:00
|
|
|
def PseudoSDIV : MultDivPseudo<SDIV, ACC64, GPR32Opnd, MipsDivRem, II_DIV,
|
2013-10-15 01:21:37 +00:00
|
|
|
0, 1, 1>;
|
2014-01-17 14:48:06 +00:00
|
|
|
def PseudoUDIV : MultDivPseudo<UDIV, ACC64, GPR32Opnd, MipsDivRemU, II_DIVU,
|
2013-10-15 01:21:37 +00:00
|
|
|
0, 1, 1>;
|
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
|
|
|
|
2013-08-06 23:08:38 +00:00
|
|
|
def RDHWR : ReadHardware<GPR32Opnd, HWRegsOpnd>, RDHWR_FM;
|
2011-05-31 02:53:58 +00:00
|
|
|
|
2013-09-14 06:49:25 +00:00
|
|
|
def EXT : MMRel, ExtBase<"ext", GPR32Opnd, uimm5, MipsExt>, EXT_FM<0>;
|
|
|
|
def INS : MMRel, InsBase<"ins", GPR32Opnd, uimm5, MipsIns>, EXT_FM<4>;
|
2011-08-17 02:05:42 +00:00
|
|
|
|
2012-12-21 22:33:43 +00:00
|
|
|
/// Move Control Registers From/To CPU Registers
|
2013-08-28 00:42:50 +00:00
|
|
|
def MFC0 : MFC3OP<"mfc0", GPR32Opnd>, MFC3OP_FM<0x10, 0>;
|
|
|
|
def MTC0 : MFC3OP<"mtc0", GPR32Opnd>, MFC3OP_FM<0x10, 4>;
|
|
|
|
def MFC2 : MFC3OP<"mfc2", GPR32Opnd>, MFC3OP_FM<0x12, 0>;
|
|
|
|
def MTC2 : MFC3OP<"mtc2", GPR32Opnd>, MFC3OP_FM<0x12, 4>;
|
2012-12-21 22:33:43 +00:00
|
|
|
|
2014-04-03 13:21:51 +00:00
|
|
|
class Barrier<string asmstr> : InstSE<(outs), (ins), asmstr, [], NoItinerary,
|
|
|
|
FrmOther>;
|
|
|
|
def SSNOP : Barrier<"ssnop">, BARRIER_FM<1>;
|
|
|
|
def EHB : Barrier<"ehb">, BARRIER_FM<3>;
|
2014-05-07 13:57:22 +00:00
|
|
|
def PAUSE : Barrier<"pause">, BARRIER_FM<5>, ISA_MIPS32R2;
|
2014-04-03 13:21:51 +00:00
|
|
|
|
2012-09-07 01:42:38 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// Instruction aliases
|
|
|
|
//===----------------------------------------------------------------------===//
|
2013-02-05 08:32:10 +00:00
|
|
|
def : InstAlias<"move $dst, $src",
|
2013-08-06 23:08:38 +00:00
|
|
|
(ADDu GPR32Opnd:$dst, GPR32Opnd:$src,ZERO), 1>,
|
2014-04-10 15:00:28 +00:00
|
|
|
Requires<[IsGP32, NotInMicroMips]>;
|
2013-08-06 22:35:29 +00:00
|
|
|
def : InstAlias<"bal $offset", (BGEZAL ZERO, brtarget:$offset), 0>;
|
2013-01-12 01:03:14 +00:00
|
|
|
def : InstAlias<"addu $rs, $rt, $imm",
|
2013-08-06 23:08:38 +00:00
|
|
|
(ADDiu GPR32Opnd:$rs, GPR32Opnd:$rt, simm16:$imm), 0>;
|
2013-01-12 01:03:14 +00:00
|
|
|
def : InstAlias<"add $rs, $rt, $imm",
|
2013-08-06 23:08:38 +00:00
|
|
|
(ADDi GPR32Opnd:$rs, GPR32Opnd:$rt, simm16:$imm), 0>;
|
2013-01-12 01:03:14 +00:00
|
|
|
def : InstAlias<"and $rs, $rt, $imm",
|
2013-08-06 23:08:38 +00:00
|
|
|
(ANDi GPR32Opnd:$rs, GPR32Opnd:$rt, simm16:$imm), 0>;
|
|
|
|
def : InstAlias<"j $rs", (JR GPR32Opnd:$rs), 0>;
|
2014-03-20 10:18:24 +00:00
|
|
|
let Predicates = [NotInMicroMips] in {
|
2013-08-06 23:08:38 +00:00
|
|
|
def : InstAlias<"jalr $rs", (JALR RA, GPR32Opnd:$rs), 0>;
|
2014-03-20 10:18:24 +00:00
|
|
|
}
|
2013-08-06 23:08:38 +00:00
|
|
|
def : InstAlias<"jal $rs", (JALR RA, GPR32Opnd:$rs), 0>;
|
|
|
|
def : InstAlias<"jal $rd,$rs", (JALR GPR32Opnd:$rd, GPR32Opnd:$rs), 0>;
|
2013-02-05 08:32:10 +00:00
|
|
|
def : InstAlias<"not $rt, $rs",
|
2013-08-06 23:08:38 +00:00
|
|
|
(NOR GPR32Opnd:$rt, GPR32Opnd:$rs, ZERO), 0>;
|
2013-02-05 08:32:10 +00:00
|
|
|
def : InstAlias<"neg $rt, $rs",
|
2013-08-06 23:08:38 +00:00
|
|
|
(SUB GPR32Opnd:$rt, ZERO, GPR32Opnd:$rs), 1>;
|
2014-04-30 16:53:49 +00:00
|
|
|
def : InstAlias<"negu $rt",
|
|
|
|
(SUBu GPR32Opnd:$rt, ZERO, GPR32Opnd:$rt), 0>;
|
2013-02-05 08:32:10 +00:00
|
|
|
def : InstAlias<"negu $rt, $rs",
|
2013-08-06 23:08:38 +00:00
|
|
|
(SUBu GPR32Opnd:$rt, ZERO, GPR32Opnd:$rs), 1>;
|
2013-01-12 01:03:14 +00:00
|
|
|
def : InstAlias<"slt $rs, $rt, $imm",
|
2013-08-06 23:08:38 +00:00
|
|
|
(SLTi GPR32Opnd:$rs, GPR32Opnd:$rt, simm16:$imm), 0>;
|
2014-04-30 16:29:56 +00:00
|
|
|
def : InstAlias<"sltu $rt, $rs, $imm",
|
|
|
|
(SLTiu GPR32Opnd:$rt, GPR32Opnd:$rs, simm16:$imm), 0>;
|
2013-01-12 01:03:14 +00:00
|
|
|
def : InstAlias<"xor $rs, $rt, $imm",
|
2013-08-06 23:08:38 +00:00
|
|
|
(XORi GPR32Opnd:$rs, GPR32Opnd:$rt, uimm16:$imm), 0>;
|
2013-03-28 23:45:13 +00:00
|
|
|
def : InstAlias<"or $rs, $rt, $imm",
|
2013-08-06 23:08:38 +00:00
|
|
|
(ORi GPR32Opnd:$rs, GPR32Opnd:$rt, uimm16:$imm), 0>;
|
2013-02-05 08:32:10 +00:00
|
|
|
def : InstAlias<"nop", (SLL ZERO, ZERO, 0), 1>;
|
2013-08-28 00:42:50 +00:00
|
|
|
def : InstAlias<"mfc0 $rt, $rd", (MFC0 GPR32Opnd:$rt, GPR32Opnd:$rd, 0), 0>;
|
|
|
|
def : InstAlias<"mtc0 $rt, $rd", (MTC0 GPR32Opnd:$rt, GPR32Opnd:$rd, 0), 0>;
|
|
|
|
def : InstAlias<"mfc2 $rt, $rd", (MFC2 GPR32Opnd:$rt, GPR32Opnd:$rd, 0), 0>;
|
|
|
|
def : InstAlias<"mtc2 $rt, $rd", (MTC2 GPR32Opnd:$rt, GPR32Opnd:$rd, 0), 0>;
|
2013-09-06 23:40:15 +00:00
|
|
|
def : InstAlias<"b $offset", (BEQ ZERO, ZERO, brtarget:$offset), 0>;
|
2013-05-16 19:40:19 +00:00
|
|
|
def : InstAlias<"bnez $rs,$offset",
|
2013-08-06 23:08:38 +00:00
|
|
|
(BNE GPR32Opnd:$rs, ZERO, brtarget:$offset), 0>;
|
2013-05-16 19:40:19 +00:00
|
|
|
def : InstAlias<"beqz $rs,$offset",
|
2013-08-06 23:08:38 +00:00
|
|
|
(BEQ GPR32Opnd:$rs, ZERO, brtarget:$offset), 0>;
|
2013-07-12 09:25:35 +00:00
|
|
|
def : InstAlias<"syscall", (SYSCALL 0), 1>;
|
|
|
|
|
|
|
|
def : InstAlias<"break $imm", (BREAK uimm10:$imm, 0), 1>;
|
|
|
|
def : InstAlias<"break", (BREAK 0, 0), 1>;
|
2013-08-12 13:07:23 +00:00
|
|
|
def : InstAlias<"ei", (EI ZERO), 1>;
|
|
|
|
def : InstAlias<"di", (DI ZERO), 1>;
|
2013-08-26 10:02:40 +00:00
|
|
|
|
|
|
|
def : InstAlias<"teq $rs, $rt", (TEQ GPR32Opnd:$rs, GPR32Opnd:$rt, 0), 1>;
|
|
|
|
def : InstAlias<"tge $rs, $rt", (TGE GPR32Opnd:$rs, GPR32Opnd:$rt, 0), 1>;
|
|
|
|
def : InstAlias<"tgeu $rs, $rt", (TGEU GPR32Opnd:$rs, GPR32Opnd:$rt, 0), 1>;
|
|
|
|
def : InstAlias<"tlt $rs, $rt", (TLT GPR32Opnd:$rs, GPR32Opnd:$rt, 0), 1>;
|
|
|
|
def : InstAlias<"tltu $rs, $rt", (TLTU GPR32Opnd:$rs, GPR32Opnd:$rt, 0), 1>;
|
|
|
|
def : InstAlias<"tne $rs, $rt", (TNE GPR32Opnd:$rs, GPR32Opnd:$rt, 0), 1>;
|
2014-04-30 15:23:04 +00:00
|
|
|
def : InstAlias<"sll $rd, $rt, $rs",
|
|
|
|
(SLLV GPR32Opnd:$rd, GPR32Opnd:$rt, GPR32Opnd:$rs), 0>;
|
2013-10-01 09:48:56 +00:00
|
|
|
def : InstAlias<"sub, $rd, $rs, $imm",
|
|
|
|
(ADDi GPR32Opnd:$rd, GPR32Opnd:$rs, InvertedImOperand:$imm)>;
|
2014-04-15 10:14:49 +00:00
|
|
|
def : InstAlias<"sub $rs, $imm",
|
|
|
|
(ADDi GPR32Opnd:$rs, GPR32Opnd:$rs, InvertedImOperand:$imm),
|
|
|
|
0>;
|
2013-10-01 09:48:56 +00:00
|
|
|
def : InstAlias<"subu, $rd, $rs, $imm",
|
|
|
|
(ADDiu GPR32Opnd:$rd, GPR32Opnd:$rs, InvertedImOperand:$imm)>;
|
2014-04-15 10:14:49 +00:00
|
|
|
def : InstAlias<"subu $rs, $imm",
|
|
|
|
(ADDiu GPR32Opnd:$rs, GPR32Opnd:$rs, InvertedImOperand:$imm),
|
|
|
|
0>;
|
2014-04-30 15:23:04 +00:00
|
|
|
def : InstAlias<"srl $rd, $rt, $rs",
|
|
|
|
(SRLV GPR32Opnd:$rd, GPR32Opnd:$rt, GPR32Opnd:$rs), 0>;
|
2012-12-21 22:33:43 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// Assembler Pseudo Instructions
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2013-01-12 01:03:14 +00:00
|
|
|
class LoadImm32< string instr_asm, Operand Od, RegisterOperand RO> :
|
|
|
|
MipsAsmPseudoInst<(outs RO:$rt), (ins Od:$imm32),
|
2012-12-21 22:33:43 +00:00
|
|
|
!strconcat(instr_asm, "\t$rt, $imm32")> ;
|
2013-09-07 00:02:02 +00:00
|
|
|
def LoadImm32Reg : LoadImm32<"li", uimm5, GPR32Opnd>;
|
2012-12-21 22:33:43 +00:00
|
|
|
|
2013-01-12 01:03:14 +00:00
|
|
|
class LoadAddress<string instr_asm, Operand MemOpnd, RegisterOperand RO> :
|
|
|
|
MipsAsmPseudoInst<(outs RO:$rt), (ins MemOpnd:$addr),
|
2012-12-21 22:33:43 +00:00
|
|
|
!strconcat(instr_asm, "\t$rt, $addr")> ;
|
2013-08-06 23:08:38 +00:00
|
|
|
def LoadAddr32Reg : LoadAddress<"la", mem, GPR32Opnd>;
|
2012-12-21 22:33:43 +00:00
|
|
|
|
2013-01-12 01:03:14 +00:00
|
|
|
class LoadAddressImm<string instr_asm, Operand Od, RegisterOperand RO> :
|
|
|
|
MipsAsmPseudoInst<(outs RO:$rt), (ins Od:$imm32),
|
2012-12-21 22:33:43 +00:00
|
|
|
!strconcat(instr_asm, "\t$rt, $imm32")> ;
|
2013-09-07 00:02:02 +00:00
|
|
|
def LoadAddr32Imm : LoadAddressImm<"la", uimm5, GPR32Opnd>;
|
2012-12-21 22:33:43 +00:00
|
|
|
|
2011-04-15 21:51:11 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
2007-06-06 07:42:06 +00:00
|
|
|
// Arbitrary patterns that map to one or more instructions
|
2011-04-15 21:51:11 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
2007-06-06 07:42:06 +00:00
|
|
|
|
2013-03-30 02:01:48 +00:00
|
|
|
// Load/store pattern templates.
|
|
|
|
class LoadRegImmPat<Instruction LoadInst, ValueType ValTy, PatFrag Node> :
|
|
|
|
MipsPat<(ValTy (Node addrRegImm:$a)), (LoadInst addrRegImm:$a)>;
|
|
|
|
|
|
|
|
class StoreRegImmPat<Instruction StoreInst, ValueType ValTy> :
|
|
|
|
MipsPat<(store ValTy:$v, addrRegImm:$a), (StoreInst ValTy:$v, addrRegImm:$a)>;
|
|
|
|
|
2007-06-06 07:42:06 +00:00
|
|
|
// Small immediates
|
2012-06-14 21:03:23 +00:00
|
|
|
def : MipsPat<(i32 immSExt16:$in),
|
|
|
|
(ADDiu ZERO, imm:$in)>;
|
|
|
|
def : MipsPat<(i32 immZExt16:$in),
|
|
|
|
(ORi ZERO, imm:$in)>;
|
|
|
|
def : MipsPat<(i32 immLow16Zero:$in),
|
|
|
|
(LUi (HI16 imm:$in))>;
|
2007-06-06 07:42:06 +00:00
|
|
|
|
|
|
|
// Arbitrary immediates
|
2012-06-14 21:03:23 +00:00
|
|
|
def : MipsPat<(i32 imm:$imm),
|
2007-06-06 07:42:06 +00:00
|
|
|
(ORi (LUi (HI16 imm:$imm)), (LO16 imm:$imm))>;
|
|
|
|
|
2012-06-14 21:03:23 +00:00
|
|
|
// Carry MipsPatterns
|
2013-08-06 23:08:38 +00:00
|
|
|
def : MipsPat<(subc GPR32:$lhs, GPR32:$rhs),
|
|
|
|
(SUBu GPR32:$lhs, GPR32:$rhs)>;
|
2014-05-07 10:27:09 +00:00
|
|
|
let AdditionalPredicates = [NotDSP] in {
|
2013-08-06 23:08:38 +00:00
|
|
|
def : MipsPat<(addc GPR32:$lhs, GPR32:$rhs),
|
|
|
|
(ADDu GPR32:$lhs, GPR32:$rhs)>;
|
|
|
|
def : MipsPat<(addc GPR32:$src, immSExt16:$imm),
|
|
|
|
(ADDiu GPR32:$src, imm:$imm)>;
|
2013-04-13 00:55:41 +00:00
|
|
|
}
|
2008-06-06 00:58:26 +00:00
|
|
|
|
2007-06-06 07:42:06 +00:00
|
|
|
// Call
|
2012-06-14 21:03:23 +00:00
|
|
|
def : MipsPat<(MipsJmpLink (i32 tglobaladdr:$dst)),
|
|
|
|
(JAL tglobaladdr:$dst)>;
|
|
|
|
def : MipsPat<(MipsJmpLink (i32 texternalsym:$dst)),
|
|
|
|
(JAL texternalsym:$dst)>;
|
2013-08-06 23:08:38 +00:00
|
|
|
//def : MipsPat<(MipsJmpLink GPR32:$dst),
|
|
|
|
// (JALR GPR32:$dst)>;
|
2007-06-06 07:42:06 +00:00
|
|
|
|
2012-10-19 21:30:15 +00:00
|
|
|
// Tail call
|
|
|
|
def : MipsPat<(MipsTailCall (iPTR tglobaladdr:$dst)),
|
|
|
|
(TAILCALL tglobaladdr:$dst)>;
|
|
|
|
def : MipsPat<(MipsTailCall (iPTR texternalsym:$dst)),
|
|
|
|
(TAILCALL texternalsym:$dst)>;
|
2008-07-23 16:01:50 +00:00
|
|
|
// hi/lo relocs
|
2012-06-14 21:03:23 +00:00
|
|
|
def : MipsPat<(MipsHi tglobaladdr:$in), (LUi tglobaladdr:$in)>;
|
|
|
|
def : MipsPat<(MipsHi tblockaddress:$in), (LUi tblockaddress:$in)>;
|
|
|
|
def : MipsPat<(MipsHi tjumptable:$in), (LUi tjumptable:$in)>;
|
|
|
|
def : MipsPat<(MipsHi tconstpool:$in), (LUi tconstpool:$in)>;
|
|
|
|
def : MipsPat<(MipsHi tglobaltlsaddr:$in), (LUi tglobaltlsaddr:$in)>;
|
2012-11-21 20:40:38 +00:00
|
|
|
def : MipsPat<(MipsHi texternalsym:$in), (LUi texternalsym:$in)>;
|
2012-06-14 21:03:23 +00:00
|
|
|
|
|
|
|
def : MipsPat<(MipsLo tglobaladdr:$in), (ADDiu ZERO, tglobaladdr:$in)>;
|
|
|
|
def : MipsPat<(MipsLo tblockaddress:$in), (ADDiu ZERO, tblockaddress:$in)>;
|
|
|
|
def : MipsPat<(MipsLo tjumptable:$in), (ADDiu ZERO, tjumptable:$in)>;
|
|
|
|
def : MipsPat<(MipsLo tconstpool:$in), (ADDiu ZERO, tconstpool:$in)>;
|
|
|
|
def : MipsPat<(MipsLo tglobaltlsaddr:$in), (ADDiu ZERO, tglobaltlsaddr:$in)>;
|
2012-11-21 20:40:38 +00:00
|
|
|
def : MipsPat<(MipsLo texternalsym:$in), (ADDiu ZERO, texternalsym:$in)>;
|
2012-06-14 21:03:23 +00:00
|
|
|
|
2013-08-06 23:08:38 +00:00
|
|
|
def : MipsPat<(add GPR32:$hi, (MipsLo tglobaladdr:$lo)),
|
|
|
|
(ADDiu GPR32:$hi, tglobaladdr:$lo)>;
|
|
|
|
def : MipsPat<(add GPR32:$hi, (MipsLo tblockaddress:$lo)),
|
|
|
|
(ADDiu GPR32:$hi, tblockaddress:$lo)>;
|
|
|
|
def : MipsPat<(add GPR32:$hi, (MipsLo tjumptable:$lo)),
|
|
|
|
(ADDiu GPR32:$hi, tjumptable:$lo)>;
|
|
|
|
def : MipsPat<(add GPR32:$hi, (MipsLo tconstpool:$lo)),
|
|
|
|
(ADDiu GPR32:$hi, tconstpool:$lo)>;
|
|
|
|
def : MipsPat<(add GPR32:$hi, (MipsLo tglobaltlsaddr:$lo)),
|
|
|
|
(ADDiu GPR32:$hi, tglobaltlsaddr:$lo)>;
|
2008-07-23 16:01:50 +00:00
|
|
|
|
|
|
|
// gp_rel relocs
|
2013-08-06 23:08:38 +00:00
|
|
|
def : MipsPat<(add GPR32:$gp, (MipsGPRel tglobaladdr:$in)),
|
|
|
|
(ADDiu GPR32:$gp, tglobaladdr:$in)>;
|
|
|
|
def : MipsPat<(add GPR32:$gp, (MipsGPRel tconstpool:$in)),
|
|
|
|
(ADDiu GPR32:$gp, tconstpool:$in)>;
|
2007-06-06 07:42:06 +00:00
|
|
|
|
2011-05-28 01:07:07 +00:00
|
|
|
// wrapper_pic
|
2012-02-24 22:34:47 +00:00
|
|
|
class WrapperPat<SDNode node, Instruction ADDiuOp, RegisterClass RC>:
|
2012-06-14 21:03:23 +00:00
|
|
|
MipsPat<(MipsWrapper RC:$gp, node:$in),
|
|
|
|
(ADDiuOp RC:$gp, node:$in)>;
|
2012-02-24 22:34:47 +00:00
|
|
|
|
2013-08-06 23:08:38 +00:00
|
|
|
def : WrapperPat<tglobaladdr, ADDiu, GPR32>;
|
|
|
|
def : WrapperPat<tconstpool, ADDiu, GPR32>;
|
|
|
|
def : WrapperPat<texternalsym, ADDiu, GPR32>;
|
|
|
|
def : WrapperPat<tblockaddress, ADDiu, GPR32>;
|
|
|
|
def : WrapperPat<tjumptable, ADDiu, GPR32>;
|
|
|
|
def : WrapperPat<tglobaltlsaddr, ADDiu, GPR32>;
|
2011-05-28 01:07:07 +00:00
|
|
|
|
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
|
|
|
// Mips does not have "not", so we expand our way
|
2013-08-06 23:08:38 +00:00
|
|
|
def : MipsPat<(not GPR32:$in),
|
|
|
|
(NOR GPR32Opnd:$in, ZERO)>;
|
2007-06-06 07:42:06 +00:00
|
|
|
|
2011-12-20 22:33:53 +00:00
|
|
|
// extended loads
|
2014-04-29 16:24:10 +00:00
|
|
|
def : MipsPat<(i32 (extloadi1 addr:$src)), (LBu addr:$src)>;
|
|
|
|
def : MipsPat<(i32 (extloadi8 addr:$src)), (LBu addr:$src)>;
|
|
|
|
def : MipsPat<(i32 (extloadi16 addr:$src)), (LHu addr:$src)>;
|
2007-08-18 02:37:46 +00:00
|
|
|
|
2008-06-06 00:58:26 +00:00
|
|
|
// peepholes
|
2013-08-20 21:08:22 +00:00
|
|
|
def : MipsPat<(store (i32 0), addr:$dst), (SW ZERO, addr:$dst)>;
|
2007-11-05 03:02:32 +00:00
|
|
|
|
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
|
|
|
// brcond patterns
|
2011-10-11 19:09:09 +00:00
|
|
|
multiclass BrcondPats<RegisterClass RC, Instruction BEQOp, Instruction BNEOp,
|
|
|
|
Instruction SLTOp, Instruction SLTuOp, Instruction SLTiOp,
|
|
|
|
Instruction SLTiuOp, Register ZEROReg> {
|
2012-06-14 21:03:23 +00:00
|
|
|
def : MipsPat<(brcond (i32 (setne RC:$lhs, 0)), bb:$dst),
|
|
|
|
(BNEOp RC:$lhs, ZEROReg, bb:$dst)>;
|
|
|
|
def : MipsPat<(brcond (i32 (seteq RC:$lhs, 0)), bb:$dst),
|
|
|
|
(BEQOp RC:$lhs, ZEROReg, bb:$dst)>;
|
2011-10-11 19:09:09 +00:00
|
|
|
|
2012-06-14 21:03:23 +00:00
|
|
|
def : MipsPat<(brcond (i32 (setge RC:$lhs, RC:$rhs)), bb:$dst),
|
|
|
|
(BEQ (SLTOp RC:$lhs, RC:$rhs), ZERO, bb:$dst)>;
|
|
|
|
def : MipsPat<(brcond (i32 (setuge RC:$lhs, RC:$rhs)), bb:$dst),
|
|
|
|
(BEQ (SLTuOp RC:$lhs, RC:$rhs), ZERO, bb:$dst)>;
|
|
|
|
def : MipsPat<(brcond (i32 (setge RC:$lhs, immSExt16:$rhs)), bb:$dst),
|
|
|
|
(BEQ (SLTiOp RC:$lhs, immSExt16:$rhs), ZERO, bb:$dst)>;
|
|
|
|
def : MipsPat<(brcond (i32 (setuge RC:$lhs, immSExt16:$rhs)), bb:$dst),
|
|
|
|
(BEQ (SLTiuOp RC:$lhs, immSExt16:$rhs), ZERO, bb:$dst)>;
|
2013-06-05 19:49:55 +00:00
|
|
|
def : MipsPat<(brcond (i32 (setgt RC:$lhs, immSExt16Plus1:$rhs)), bb:$dst),
|
|
|
|
(BEQ (SLTiOp RC:$lhs, (Plus1 imm:$rhs)), ZERO, bb:$dst)>;
|
|
|
|
def : MipsPat<(brcond (i32 (setugt RC:$lhs, immSExt16Plus1:$rhs)), bb:$dst),
|
|
|
|
(BEQ (SLTiuOp RC:$lhs, (Plus1 imm:$rhs)), ZERO, bb:$dst)>;
|
2011-10-11 19:09:09 +00:00
|
|
|
|
2012-06-14 21:03:23 +00:00
|
|
|
def : MipsPat<(brcond (i32 (setle RC:$lhs, RC:$rhs)), bb:$dst),
|
|
|
|
(BEQ (SLTOp RC:$rhs, RC:$lhs), ZERO, bb:$dst)>;
|
|
|
|
def : MipsPat<(brcond (i32 (setule RC:$lhs, RC:$rhs)), bb:$dst),
|
|
|
|
(BEQ (SLTuOp RC:$rhs, RC:$lhs), ZERO, bb:$dst)>;
|
2011-10-11 19:09:09 +00:00
|
|
|
|
2012-06-14 21:03:23 +00:00
|
|
|
def : MipsPat<(brcond RC:$cond, bb:$dst),
|
|
|
|
(BNEOp RC:$cond, ZEROReg, bb:$dst)>;
|
2011-10-11 19:09:09 +00:00
|
|
|
}
|
|
|
|
|
2013-08-06 23:08:38 +00:00
|
|
|
defm : BrcondPats<GPR32, BEQ, BNE, SLT, SLTu, SLTi, SLTiu, ZERO>;
|
2007-08-18 02:37:46 +00:00
|
|
|
|
2013-05-21 17:13:47 +00:00
|
|
|
def : MipsPat<(brcond (i32 (setlt i32:$lhs, 1)), bb:$dst),
|
|
|
|
(BLEZ i32:$lhs, bb:$dst)>;
|
|
|
|
def : MipsPat<(brcond (i32 (setgt i32:$lhs, -1)), bb:$dst),
|
|
|
|
(BGEZ i32:$lhs, bb:$dst)>;
|
|
|
|
|
2008-08-13 07:13:40 +00:00
|
|
|
// setcc patterns
|
2011-10-11 21:40:01 +00:00
|
|
|
multiclass SeteqPats<RegisterClass RC, Instruction SLTiuOp, Instruction XOROp,
|
|
|
|
Instruction SLTuOp, Register ZEROReg> {
|
2013-05-08 19:38:04 +00:00
|
|
|
def : MipsPat<(seteq RC:$lhs, 0),
|
|
|
|
(SLTiuOp RC:$lhs, 1)>;
|
2013-05-20 18:18:07 +00:00
|
|
|
def : MipsPat<(setne RC:$lhs, 0),
|
|
|
|
(SLTuOp ZEROReg, RC:$lhs)>;
|
2012-06-14 21:03:23 +00:00
|
|
|
def : MipsPat<(seteq RC:$lhs, RC:$rhs),
|
|
|
|
(SLTiuOp (XOROp RC:$lhs, RC:$rhs), 1)>;
|
|
|
|
def : MipsPat<(setne RC:$lhs, RC:$rhs),
|
|
|
|
(SLTuOp ZEROReg, (XOROp RC:$lhs, RC:$rhs))>;
|
2011-10-11 21:40:01 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
multiclass SetlePats<RegisterClass RC, Instruction SLTOp, Instruction SLTuOp> {
|
2012-06-14 21:03:23 +00:00
|
|
|
def : MipsPat<(setle RC:$lhs, RC:$rhs),
|
|
|
|
(XORi (SLTOp RC:$rhs, RC:$lhs), 1)>;
|
|
|
|
def : MipsPat<(setule RC:$lhs, RC:$rhs),
|
|
|
|
(XORi (SLTuOp RC:$rhs, RC:$lhs), 1)>;
|
2011-10-11 21:40:01 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
multiclass SetgtPats<RegisterClass RC, Instruction SLTOp, Instruction SLTuOp> {
|
2012-06-14 21:03:23 +00:00
|
|
|
def : MipsPat<(setgt RC:$lhs, RC:$rhs),
|
|
|
|
(SLTOp RC:$rhs, RC:$lhs)>;
|
|
|
|
def : MipsPat<(setugt RC:$lhs, RC:$rhs),
|
|
|
|
(SLTuOp RC:$rhs, RC:$lhs)>;
|
2011-10-11 21:40:01 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
multiclass SetgePats<RegisterClass RC, Instruction SLTOp, Instruction SLTuOp> {
|
2012-06-14 21:03:23 +00:00
|
|
|
def : MipsPat<(setge RC:$lhs, RC:$rhs),
|
|
|
|
(XORi (SLTOp RC:$lhs, RC:$rhs), 1)>;
|
|
|
|
def : MipsPat<(setuge RC:$lhs, RC:$rhs),
|
|
|
|
(XORi (SLTuOp RC:$lhs, RC:$rhs), 1)>;
|
2011-10-11 21:40:01 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
multiclass SetgeImmPats<RegisterClass RC, Instruction SLTiOp,
|
|
|
|
Instruction SLTiuOp> {
|
2012-06-14 21:03:23 +00:00
|
|
|
def : MipsPat<(setge RC:$lhs, immSExt16:$rhs),
|
|
|
|
(XORi (SLTiOp RC:$lhs, immSExt16:$rhs), 1)>;
|
|
|
|
def : MipsPat<(setuge RC:$lhs, immSExt16:$rhs),
|
|
|
|
(XORi (SLTiuOp RC:$lhs, immSExt16:$rhs), 1)>;
|
2011-10-11 21:40:01 +00:00
|
|
|
}
|
|
|
|
|
2013-08-06 23:08:38 +00:00
|
|
|
defm : SeteqPats<GPR32, SLTiu, XOR, SLTu, ZERO>;
|
|
|
|
defm : SetlePats<GPR32, SLT, SLTu>;
|
|
|
|
defm : SetgtPats<GPR32, SLT, SLTu>;
|
|
|
|
defm : SetgePats<GPR32, SLT, SLTu>;
|
|
|
|
defm : SetgeImmPats<GPR32, SLTi, SLTiu>;
|
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
|
|
|
|
2011-12-20 23:47:44 +00:00
|
|
|
// bswap pattern
|
2013-08-06 23:08:38 +00:00
|
|
|
def : MipsPat<(bswap GPR32:$rt), (ROTR (WSBH GPR32:$rt), 16)>;
|
2011-12-20 23:47:44 +00:00
|
|
|
|
2013-03-30 02:14:45 +00:00
|
|
|
// Load halfword/word patterns.
|
|
|
|
let AddedComplexity = 40 in {
|
2014-04-29 16:24:10 +00:00
|
|
|
def : LoadRegImmPat<LBu, i32, zextloadi8>;
|
|
|
|
def : LoadRegImmPat<LH, i32, sextloadi16>;
|
|
|
|
def : LoadRegImmPat<LW, i32, load>;
|
2013-03-30 02:14:45 +00:00
|
|
|
}
|
|
|
|
|
2011-04-15 21:51:11 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
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
|
|
|
// Floating Point Support
|
2011-04-15 21:51:11 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
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
|
|
|
|
|
|
|
include "MipsInstrFPU.td"
|
2011-09-24 01:34:44 +00:00
|
|
|
include "Mips64InstrInfo.td"
|
2011-10-17 18:53:29 +00:00
|
|
|
include "MipsCondMov.td"
|
2011-04-15 21:51:11 +00:00
|
|
|
|
2012-05-08 19:08:58 +00:00
|
|
|
//
|
|
|
|
// Mips16
|
|
|
|
|
|
|
|
include "Mips16InstrFormats.td"
|
2012-05-24 18:32:33 +00:00
|
|
|
include "Mips16InstrInfo.td"
|
2012-09-27 01:50:59 +00:00
|
|
|
|
|
|
|
// DSP
|
|
|
|
include "MipsDSPInstrFormats.td"
|
|
|
|
include "MipsDSPInstrInfo.td"
|
|
|
|
|
2013-08-13 20:54:07 +00:00
|
|
|
// MSA
|
|
|
|
include "MipsMSAInstrFormats.td"
|
|
|
|
include "MipsMSAInstrInfo.td"
|
|
|
|
|
2013-04-19 19:03:11 +00:00
|
|
|
// Micromips
|
|
|
|
include "MicroMipsInstrFormats.td"
|
|
|
|
include "MicroMipsInstrInfo.td"
|
2013-12-20 15:44:08 +00:00
|
|
|
include "MicroMipsInstrFPU.td"
|