2009-05-03 12:57:15 +00:00
|
|
|
//===-- MSP430ISelLowering.cpp - MSP430 DAG Lowering Implementation ------===//
|
|
|
|
//
|
|
|
|
// The LLVM Compiler Infrastructure
|
|
|
|
//
|
|
|
|
// This file is distributed under the University of Illinois Open Source
|
|
|
|
// License. See LICENSE.TXT for details.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
//
|
|
|
|
// This file implements the MSP430TargetLowering class.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
|
|
|
#define DEBUG_TYPE "msp430-lower"
|
|
|
|
|
|
|
|
#include "MSP430ISelLowering.h"
|
|
|
|
#include "MSP430.h"
|
2009-12-07 02:28:10 +00:00
|
|
|
#include "MSP430MachineFunctionInfo.h"
|
2009-05-03 12:57:15 +00:00
|
|
|
#include "MSP430TargetMachine.h"
|
|
|
|
#include "MSP430Subtarget.h"
|
|
|
|
#include "llvm/DerivedTypes.h"
|
|
|
|
#include "llvm/Function.h"
|
|
|
|
#include "llvm/Intrinsics.h"
|
|
|
|
#include "llvm/CallingConv.h"
|
|
|
|
#include "llvm/GlobalVariable.h"
|
|
|
|
#include "llvm/GlobalAlias.h"
|
|
|
|
#include "llvm/CodeGen/CallingConvLower.h"
|
|
|
|
#include "llvm/CodeGen/MachineFrameInfo.h"
|
|
|
|
#include "llvm/CodeGen/MachineFunction.h"
|
|
|
|
#include "llvm/CodeGen/MachineInstrBuilder.h"
|
|
|
|
#include "llvm/CodeGen/MachineRegisterInfo.h"
|
2009-05-03 12:59:33 +00:00
|
|
|
#include "llvm/CodeGen/PseudoSourceValue.h"
|
2009-05-03 12:57:15 +00:00
|
|
|
#include "llvm/CodeGen/SelectionDAGISel.h"
|
|
|
|
#include "llvm/CodeGen/ValueTypes.h"
|
2009-07-28 03:13:23 +00:00
|
|
|
#include "llvm/Target/TargetLoweringObjectFile.h"
|
2009-12-07 02:27:08 +00:00
|
|
|
#include "llvm/Support/CommandLine.h"
|
2009-05-03 12:57:15 +00:00
|
|
|
#include "llvm/Support/Debug.h"
|
2009-07-08 19:04:27 +00:00
|
|
|
#include "llvm/Support/ErrorHandling.h"
|
2009-08-23 07:05:07 +00:00
|
|
|
#include "llvm/Support/raw_ostream.h"
|
2009-05-03 12:57:15 +00:00
|
|
|
#include "llvm/ADT/VectorExtras.h"
|
|
|
|
using namespace llvm;
|
|
|
|
|
2009-12-07 02:27:08 +00:00
|
|
|
typedef enum {
|
|
|
|
NoHWMult,
|
|
|
|
HWMultIntr,
|
|
|
|
HWMultNoIntr
|
|
|
|
} HWMultUseMode;
|
|
|
|
|
|
|
|
static cl::opt<HWMultUseMode>
|
|
|
|
HWMultMode("msp430-hwmult-mode",
|
|
|
|
cl::desc("Hardware multiplier use mode"),
|
|
|
|
cl::init(HWMultNoIntr),
|
|
|
|
cl::values(
|
|
|
|
clEnumValN(NoHWMult, "no",
|
|
|
|
"Do not use hardware multiplier"),
|
|
|
|
clEnumValN(HWMultIntr, "interrupts",
|
|
|
|
"Assume hardware multiplier can be used inside interrupts"),
|
|
|
|
clEnumValN(HWMultNoIntr, "use",
|
|
|
|
"Assume hardware multiplier cannot be used inside interrupts"),
|
|
|
|
clEnumValEnd));
|
|
|
|
|
2009-05-03 12:57:15 +00:00
|
|
|
MSP430TargetLowering::MSP430TargetLowering(MSP430TargetMachine &tm) :
|
2009-07-28 03:13:23 +00:00
|
|
|
TargetLowering(tm, new TargetLoweringObjectFileELF()),
|
|
|
|
Subtarget(*tm.getSubtargetImpl()), TM(tm) {
|
2009-05-03 12:57:15 +00:00
|
|
|
|
2009-12-07 02:28:10 +00:00
|
|
|
TD = getTargetData();
|
|
|
|
|
2009-05-03 12:57:15 +00:00
|
|
|
// Set up the register classes.
|
2009-08-11 20:47:22 +00:00
|
|
|
addRegisterClass(MVT::i8, MSP430::GR8RegisterClass);
|
|
|
|
addRegisterClass(MVT::i16, MSP430::GR16RegisterClass);
|
2009-05-03 12:57:15 +00:00
|
|
|
|
|
|
|
// Compute derived properties from the register classes
|
|
|
|
computeRegisterProperties();
|
2009-05-03 12:59:50 +00:00
|
|
|
|
2009-05-03 13:03:14 +00:00
|
|
|
// Provide all sorts of operation actions
|
|
|
|
|
|
|
|
// Division is expensive
|
|
|
|
setIntDivIsCheap(false);
|
|
|
|
|
2009-05-03 13:03:33 +00:00
|
|
|
// Even if we have only 1 bit shift here, we can perform
|
|
|
|
// shifts of the whole bitwidth 1 bit per step.
|
2009-08-11 20:47:22 +00:00
|
|
|
setShiftAmountType(MVT::i8);
|
2009-05-03 13:03:33 +00:00
|
|
|
|
2009-05-03 13:11:35 +00:00
|
|
|
setStackPointerRegisterToSaveRestore(MSP430::SPW);
|
|
|
|
setBooleanContents(ZeroOrOneBooleanContent);
|
|
|
|
setSchedulingPreference(SchedulingForLatency);
|
|
|
|
|
2009-11-07 17:15:25 +00:00
|
|
|
// We have post-incremented loads / stores.
|
2009-11-07 17:15:06 +00:00
|
|
|
setIndexedLoadAction(ISD::POST_INC, MVT::i8, Legal);
|
|
|
|
setIndexedLoadAction(ISD::POST_INC, MVT::i16, Legal);
|
|
|
|
|
|
|
|
setLoadExtAction(ISD::EXTLOAD, MVT::i1, Promote);
|
|
|
|
setLoadExtAction(ISD::SEXTLOAD, MVT::i1, Promote);
|
|
|
|
setLoadExtAction(ISD::ZEXTLOAD, MVT::i1, Promote);
|
|
|
|
setLoadExtAction(ISD::SEXTLOAD, MVT::i8, Expand);
|
2009-08-11 20:47:22 +00:00
|
|
|
setLoadExtAction(ISD::SEXTLOAD, MVT::i16, Expand);
|
2009-05-03 13:06:03 +00:00
|
|
|
|
2009-05-03 13:06:26 +00:00
|
|
|
// We don't have any truncstores
|
2009-08-11 20:47:22 +00:00
|
|
|
setTruncStoreAction(MVT::i16, MVT::i8, Expand);
|
|
|
|
|
|
|
|
setOperationAction(ISD::SRA, MVT::i8, Custom);
|
|
|
|
setOperationAction(ISD::SHL, MVT::i8, Custom);
|
|
|
|
setOperationAction(ISD::SRL, MVT::i8, Custom);
|
|
|
|
setOperationAction(ISD::SRA, MVT::i16, Custom);
|
|
|
|
setOperationAction(ISD::SHL, MVT::i16, Custom);
|
|
|
|
setOperationAction(ISD::SRL, MVT::i16, Custom);
|
|
|
|
setOperationAction(ISD::ROTL, MVT::i8, Expand);
|
|
|
|
setOperationAction(ISD::ROTR, MVT::i8, Expand);
|
|
|
|
setOperationAction(ISD::ROTL, MVT::i16, Expand);
|
|
|
|
setOperationAction(ISD::ROTR, MVT::i16, Expand);
|
|
|
|
setOperationAction(ISD::GlobalAddress, MVT::i16, Custom);
|
|
|
|
setOperationAction(ISD::ExternalSymbol, MVT::i16, Custom);
|
|
|
|
setOperationAction(ISD::BR_JT, MVT::Other, Expand);
|
|
|
|
setOperationAction(ISD::BRIND, MVT::Other, Expand);
|
|
|
|
setOperationAction(ISD::BR_CC, MVT::i8, Custom);
|
|
|
|
setOperationAction(ISD::BR_CC, MVT::i16, Custom);
|
|
|
|
setOperationAction(ISD::BRCOND, MVT::Other, Expand);
|
2009-12-11 23:01:29 +00:00
|
|
|
setOperationAction(ISD::SETCC, MVT::i8, Custom);
|
|
|
|
setOperationAction(ISD::SETCC, MVT::i16, Custom);
|
2009-08-11 20:47:22 +00:00
|
|
|
setOperationAction(ISD::SELECT, MVT::i8, Expand);
|
|
|
|
setOperationAction(ISD::SELECT, MVT::i16, Expand);
|
|
|
|
setOperationAction(ISD::SELECT_CC, MVT::i8, Custom);
|
|
|
|
setOperationAction(ISD::SELECT_CC, MVT::i16, Custom);
|
|
|
|
setOperationAction(ISD::SIGN_EXTEND, MVT::i16, Custom);
|
2009-08-25 17:00:23 +00:00
|
|
|
setOperationAction(ISD::DYNAMIC_STACKALLOC, MVT::i8, Expand);
|
|
|
|
setOperationAction(ISD::DYNAMIC_STACKALLOC, MVT::i16, Expand);
|
2009-08-11 20:47:22 +00:00
|
|
|
|
|
|
|
setOperationAction(ISD::CTTZ, MVT::i8, Expand);
|
|
|
|
setOperationAction(ISD::CTTZ, MVT::i16, Expand);
|
|
|
|
setOperationAction(ISD::CTLZ, MVT::i8, Expand);
|
|
|
|
setOperationAction(ISD::CTLZ, MVT::i16, Expand);
|
|
|
|
setOperationAction(ISD::CTPOP, MVT::i8, Expand);
|
|
|
|
setOperationAction(ISD::CTPOP, MVT::i16, Expand);
|
|
|
|
|
|
|
|
setOperationAction(ISD::SHL_PARTS, MVT::i8, Expand);
|
|
|
|
setOperationAction(ISD::SHL_PARTS, MVT::i16, Expand);
|
|
|
|
setOperationAction(ISD::SRL_PARTS, MVT::i8, Expand);
|
|
|
|
setOperationAction(ISD::SRL_PARTS, MVT::i16, Expand);
|
|
|
|
setOperationAction(ISD::SRA_PARTS, MVT::i8, Expand);
|
|
|
|
setOperationAction(ISD::SRA_PARTS, MVT::i16, Expand);
|
|
|
|
|
|
|
|
setOperationAction(ISD::SIGN_EXTEND_INREG, MVT::i1, Expand);
|
2009-07-17 07:28:06 +00:00
|
|
|
|
2009-05-03 13:14:25 +00:00
|
|
|
// FIXME: Implement efficiently multiplication by a constant
|
2009-11-07 17:14:39 +00:00
|
|
|
setOperationAction(ISD::MUL, MVT::i8, Expand);
|
|
|
|
setOperationAction(ISD::MULHS, MVT::i8, Expand);
|
|
|
|
setOperationAction(ISD::MULHU, MVT::i8, Expand);
|
|
|
|
setOperationAction(ISD::SMUL_LOHI, MVT::i8, Expand);
|
|
|
|
setOperationAction(ISD::UMUL_LOHI, MVT::i8, Expand);
|
2009-08-11 20:47:22 +00:00
|
|
|
setOperationAction(ISD::MUL, MVT::i16, Expand);
|
|
|
|
setOperationAction(ISD::MULHS, MVT::i16, Expand);
|
|
|
|
setOperationAction(ISD::MULHU, MVT::i16, Expand);
|
|
|
|
setOperationAction(ISD::SMUL_LOHI, MVT::i16, Expand);
|
|
|
|
setOperationAction(ISD::UMUL_LOHI, MVT::i16, Expand);
|
|
|
|
|
2009-11-07 17:14:39 +00:00
|
|
|
setOperationAction(ISD::UDIV, MVT::i8, Expand);
|
|
|
|
setOperationAction(ISD::UDIVREM, MVT::i8, Expand);
|
|
|
|
setOperationAction(ISD::UREM, MVT::i8, Expand);
|
|
|
|
setOperationAction(ISD::SDIV, MVT::i8, Expand);
|
|
|
|
setOperationAction(ISD::SDIVREM, MVT::i8, Expand);
|
|
|
|
setOperationAction(ISD::SREM, MVT::i8, Expand);
|
2009-08-11 20:47:22 +00:00
|
|
|
setOperationAction(ISD::UDIV, MVT::i16, Expand);
|
|
|
|
setOperationAction(ISD::UDIVREM, MVT::i16, Expand);
|
|
|
|
setOperationAction(ISD::UREM, MVT::i16, Expand);
|
|
|
|
setOperationAction(ISD::SDIV, MVT::i16, Expand);
|
|
|
|
setOperationAction(ISD::SDIVREM, MVT::i16, Expand);
|
|
|
|
setOperationAction(ISD::SREM, MVT::i16, Expand);
|
2009-12-07 02:27:08 +00:00
|
|
|
|
|
|
|
// Libcalls names.
|
|
|
|
if (HWMultMode == HWMultIntr) {
|
|
|
|
setLibcallName(RTLIB::MUL_I8, "__mulqi3hw");
|
|
|
|
setLibcallName(RTLIB::MUL_I16, "__mulhi3hw");
|
|
|
|
} else if (HWMultMode == HWMultNoIntr) {
|
|
|
|
setLibcallName(RTLIB::MUL_I8, "__mulqi3hw_noint");
|
|
|
|
setLibcallName(RTLIB::MUL_I16, "__mulhi3hw_noint");
|
|
|
|
}
|
2009-05-03 12:57:15 +00:00
|
|
|
}
|
|
|
|
|
2009-05-03 13:03:50 +00:00
|
|
|
SDValue MSP430TargetLowering::LowerOperation(SDValue Op, SelectionDAG &DAG) {
|
2009-05-03 12:57:15 +00:00
|
|
|
switch (Op.getOpcode()) {
|
2009-05-03 13:13:17 +00:00
|
|
|
case ISD::SHL: // FALLTHROUGH
|
2009-05-03 13:16:17 +00:00
|
|
|
case ISD::SRL:
|
2009-05-03 13:07:31 +00:00
|
|
|
case ISD::SRA: return LowerShifts(Op, DAG);
|
2009-05-03 13:08:33 +00:00
|
|
|
case ISD::GlobalAddress: return LowerGlobalAddress(Op, DAG);
|
2009-05-03 13:14:46 +00:00
|
|
|
case ISD::ExternalSymbol: return LowerExternalSymbol(Op, DAG);
|
2009-12-11 23:01:29 +00:00
|
|
|
case ISD::SETCC: return LowerSETCC(Op, DAG);
|
2009-05-03 13:19:09 +00:00
|
|
|
case ISD::BR_CC: return LowerBR_CC(Op, DAG);
|
|
|
|
case ISD::SELECT_CC: return LowerSELECT_CC(Op, DAG);
|
2009-05-03 13:17:49 +00:00
|
|
|
case ISD::SIGN_EXTEND: return LowerSIGN_EXTEND(Op, DAG);
|
2009-12-07 02:28:10 +00:00
|
|
|
case ISD::RETURNADDR: return LowerRETURNADDR(Op, DAG);
|
|
|
|
case ISD::FRAMEADDR: return LowerFRAMEADDR(Op, DAG);
|
2009-05-03 12:57:15 +00:00
|
|
|
default:
|
2009-07-14 16:55:14 +00:00
|
|
|
llvm_unreachable("unimplemented operand");
|
2009-05-03 12:57:15 +00:00
|
|
|
return SDValue();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2009-07-01 18:50:55 +00:00
|
|
|
/// getFunctionAlignment - Return the Log2 alignment of this function.
|
2009-06-30 22:38:32 +00:00
|
|
|
unsigned MSP430TargetLowering::getFunctionAlignment(const Function *F) const {
|
2009-11-22 01:13:39 +00:00
|
|
|
return F->hasFnAttr(Attribute::OptimizeForSize) ? 1 : 2;
|
2009-06-30 22:38:32 +00:00
|
|
|
}
|
|
|
|
|
2009-08-26 13:44:29 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// MSP430 Inline Assembly Support
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
|
|
|
/// getConstraintType - Given a constraint letter, return the type of
|
|
|
|
/// constraint it is for this target.
|
|
|
|
TargetLowering::ConstraintType
|
|
|
|
MSP430TargetLowering::getConstraintType(const std::string &Constraint) const {
|
|
|
|
if (Constraint.size() == 1) {
|
|
|
|
switch (Constraint[0]) {
|
|
|
|
case 'r':
|
|
|
|
return C_RegisterClass;
|
|
|
|
default:
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return TargetLowering::getConstraintType(Constraint);
|
|
|
|
}
|
|
|
|
|
|
|
|
std::pair<unsigned, const TargetRegisterClass*>
|
|
|
|
MSP430TargetLowering::
|
|
|
|
getRegForInlineAsmConstraint(const std::string &Constraint,
|
|
|
|
EVT VT) const {
|
|
|
|
if (Constraint.size() == 1) {
|
|
|
|
// GCC Constraint Letters
|
|
|
|
switch (Constraint[0]) {
|
|
|
|
default: break;
|
|
|
|
case 'r': // GENERAL_REGS
|
|
|
|
if (VT == MVT::i8)
|
|
|
|
return std::make_pair(0U, MSP430::GR8RegisterClass);
|
|
|
|
|
|
|
|
return std::make_pair(0U, MSP430::GR16RegisterClass);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return TargetLowering::getRegForInlineAsmConstraint(Constraint, VT);
|
|
|
|
}
|
|
|
|
|
2009-05-03 12:59:33 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// Calling Convention Implementation
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2009-05-03 12:57:15 +00:00
|
|
|
#include "MSP430GenCallingConv.inc"
|
2009-05-03 12:59:33 +00:00
|
|
|
|
Major calling convention code refactoring.
Instead of awkwardly encoding calling-convention information with ISD::CALL,
ISD::FORMAL_ARGUMENTS, ISD::RET, and ISD::ARG_FLAGS nodes, TargetLowering
provides three virtual functions for targets to override:
LowerFormalArguments, LowerCall, and LowerRet, which replace the custom
lowering done on the special nodes. They provide the same information, but
in a more immediately usable format.
This also reworks much of the target-independent tail call logic. The
decision of whether or not to perform a tail call is now cleanly split
between target-independent portions, and the target dependent portion
in IsEligibleForTailCallOptimization.
This also synchronizes all in-tree targets, to help enable future
refactoring and feature work.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@78142 91177308-0d34-0410-b5e6-96231b3b80d8
2009-08-05 01:29:28 +00:00
|
|
|
SDValue
|
|
|
|
MSP430TargetLowering::LowerFormalArguments(SDValue Chain,
|
2009-09-02 08:44:58 +00:00
|
|
|
CallingConv::ID CallConv,
|
Major calling convention code refactoring.
Instead of awkwardly encoding calling-convention information with ISD::CALL,
ISD::FORMAL_ARGUMENTS, ISD::RET, and ISD::ARG_FLAGS nodes, TargetLowering
provides three virtual functions for targets to override:
LowerFormalArguments, LowerCall, and LowerRet, which replace the custom
lowering done on the special nodes. They provide the same information, but
in a more immediately usable format.
This also reworks much of the target-independent tail call logic. The
decision of whether or not to perform a tail call is now cleanly split
between target-independent portions, and the target dependent portion
in IsEligibleForTailCallOptimization.
This also synchronizes all in-tree targets, to help enable future
refactoring and feature work.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@78142 91177308-0d34-0410-b5e6-96231b3b80d8
2009-08-05 01:29:28 +00:00
|
|
|
bool isVarArg,
|
|
|
|
const SmallVectorImpl<ISD::InputArg>
|
|
|
|
&Ins,
|
|
|
|
DebugLoc dl,
|
|
|
|
SelectionDAG &DAG,
|
|
|
|
SmallVectorImpl<SDValue> &InVals) {
|
|
|
|
|
|
|
|
switch (CallConv) {
|
2009-05-03 12:59:33 +00:00
|
|
|
default:
|
2009-07-14 16:55:14 +00:00
|
|
|
llvm_unreachable("Unsupported calling convention");
|
2009-05-03 12:59:33 +00:00
|
|
|
case CallingConv::C:
|
|
|
|
case CallingConv::Fast:
|
Major calling convention code refactoring.
Instead of awkwardly encoding calling-convention information with ISD::CALL,
ISD::FORMAL_ARGUMENTS, ISD::RET, and ISD::ARG_FLAGS nodes, TargetLowering
provides three virtual functions for targets to override:
LowerFormalArguments, LowerCall, and LowerRet, which replace the custom
lowering done on the special nodes. They provide the same information, but
in a more immediately usable format.
This also reworks much of the target-independent tail call logic. The
decision of whether or not to perform a tail call is now cleanly split
between target-independent portions, and the target dependent portion
in IsEligibleForTailCallOptimization.
This also synchronizes all in-tree targets, to help enable future
refactoring and feature work.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@78142 91177308-0d34-0410-b5e6-96231b3b80d8
2009-08-05 01:29:28 +00:00
|
|
|
return LowerCCCArguments(Chain, CallConv, isVarArg, Ins, dl, DAG, InVals);
|
2009-12-07 02:27:53 +00:00
|
|
|
case CallingConv::MSP430_INTR:
|
|
|
|
if (Ins.empty())
|
|
|
|
return Chain;
|
|
|
|
else {
|
|
|
|
llvm_report_error("ISRs cannot have arguments");
|
|
|
|
return SDValue();
|
|
|
|
}
|
2009-05-03 12:59:33 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
Major calling convention code refactoring.
Instead of awkwardly encoding calling-convention information with ISD::CALL,
ISD::FORMAL_ARGUMENTS, ISD::RET, and ISD::ARG_FLAGS nodes, TargetLowering
provides three virtual functions for targets to override:
LowerFormalArguments, LowerCall, and LowerRet, which replace the custom
lowering done on the special nodes. They provide the same information, but
in a more immediately usable format.
This also reworks much of the target-independent tail call logic. The
decision of whether or not to perform a tail call is now cleanly split
between target-independent portions, and the target dependent portion
in IsEligibleForTailCallOptimization.
This also synchronizes all in-tree targets, to help enable future
refactoring and feature work.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@78142 91177308-0d34-0410-b5e6-96231b3b80d8
2009-08-05 01:29:28 +00:00
|
|
|
SDValue
|
|
|
|
MSP430TargetLowering::LowerCall(SDValue Chain, SDValue Callee,
|
2009-09-02 08:44:58 +00:00
|
|
|
CallingConv::ID CallConv, bool isVarArg,
|
Major calling convention code refactoring.
Instead of awkwardly encoding calling-convention information with ISD::CALL,
ISD::FORMAL_ARGUMENTS, ISD::RET, and ISD::ARG_FLAGS nodes, TargetLowering
provides three virtual functions for targets to override:
LowerFormalArguments, LowerCall, and LowerRet, which replace the custom
lowering done on the special nodes. They provide the same information, but
in a more immediately usable format.
This also reworks much of the target-independent tail call logic. The
decision of whether or not to perform a tail call is now cleanly split
between target-independent portions, and the target dependent portion
in IsEligibleForTailCallOptimization.
This also synchronizes all in-tree targets, to help enable future
refactoring and feature work.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@78142 91177308-0d34-0410-b5e6-96231b3b80d8
2009-08-05 01:29:28 +00:00
|
|
|
bool isTailCall,
|
|
|
|
const SmallVectorImpl<ISD::OutputArg> &Outs,
|
|
|
|
const SmallVectorImpl<ISD::InputArg> &Ins,
|
|
|
|
DebugLoc dl, SelectionDAG &DAG,
|
|
|
|
SmallVectorImpl<SDValue> &InVals) {
|
|
|
|
|
|
|
|
switch (CallConv) {
|
2009-05-03 13:07:31 +00:00
|
|
|
default:
|
2009-07-14 16:55:14 +00:00
|
|
|
llvm_unreachable("Unsupported calling convention");
|
2009-05-03 13:07:31 +00:00
|
|
|
case CallingConv::Fast:
|
|
|
|
case CallingConv::C:
|
Major calling convention code refactoring.
Instead of awkwardly encoding calling-convention information with ISD::CALL,
ISD::FORMAL_ARGUMENTS, ISD::RET, and ISD::ARG_FLAGS nodes, TargetLowering
provides three virtual functions for targets to override:
LowerFormalArguments, LowerCall, and LowerRet, which replace the custom
lowering done on the special nodes. They provide the same information, but
in a more immediately usable format.
This also reworks much of the target-independent tail call logic. The
decision of whether or not to perform a tail call is now cleanly split
between target-independent portions, and the target dependent portion
in IsEligibleForTailCallOptimization.
This also synchronizes all in-tree targets, to help enable future
refactoring and feature work.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@78142 91177308-0d34-0410-b5e6-96231b3b80d8
2009-08-05 01:29:28 +00:00
|
|
|
return LowerCCCCallTo(Chain, Callee, CallConv, isVarArg, isTailCall,
|
|
|
|
Outs, Ins, dl, DAG, InVals);
|
2009-12-07 02:27:53 +00:00
|
|
|
case CallingConv::MSP430_INTR:
|
|
|
|
llvm_report_error("ISRs cannot be called directly");
|
|
|
|
return SDValue();
|
2009-05-03 13:07:31 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2009-05-03 12:59:33 +00:00
|
|
|
/// LowerCCCArguments - transform physical registers into virtual registers and
|
|
|
|
/// generate load operations for arguments places on the stack.
|
|
|
|
// FIXME: struct return stuff
|
|
|
|
// FIXME: varargs
|
Major calling convention code refactoring.
Instead of awkwardly encoding calling-convention information with ISD::CALL,
ISD::FORMAL_ARGUMENTS, ISD::RET, and ISD::ARG_FLAGS nodes, TargetLowering
provides three virtual functions for targets to override:
LowerFormalArguments, LowerCall, and LowerRet, which replace the custom
lowering done on the special nodes. They provide the same information, but
in a more immediately usable format.
This also reworks much of the target-independent tail call logic. The
decision of whether or not to perform a tail call is now cleanly split
between target-independent portions, and the target dependent portion
in IsEligibleForTailCallOptimization.
This also synchronizes all in-tree targets, to help enable future
refactoring and feature work.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@78142 91177308-0d34-0410-b5e6-96231b3b80d8
2009-08-05 01:29:28 +00:00
|
|
|
SDValue
|
|
|
|
MSP430TargetLowering::LowerCCCArguments(SDValue Chain,
|
2009-09-02 08:44:58 +00:00
|
|
|
CallingConv::ID CallConv,
|
Major calling convention code refactoring.
Instead of awkwardly encoding calling-convention information with ISD::CALL,
ISD::FORMAL_ARGUMENTS, ISD::RET, and ISD::ARG_FLAGS nodes, TargetLowering
provides three virtual functions for targets to override:
LowerFormalArguments, LowerCall, and LowerRet, which replace the custom
lowering done on the special nodes. They provide the same information, but
in a more immediately usable format.
This also reworks much of the target-independent tail call logic. The
decision of whether or not to perform a tail call is now cleanly split
between target-independent portions, and the target dependent portion
in IsEligibleForTailCallOptimization.
This also synchronizes all in-tree targets, to help enable future
refactoring and feature work.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@78142 91177308-0d34-0410-b5e6-96231b3b80d8
2009-08-05 01:29:28 +00:00
|
|
|
bool isVarArg,
|
|
|
|
const SmallVectorImpl<ISD::InputArg>
|
|
|
|
&Ins,
|
|
|
|
DebugLoc dl,
|
|
|
|
SelectionDAG &DAG,
|
|
|
|
SmallVectorImpl<SDValue> &InVals) {
|
2009-05-03 12:59:33 +00:00
|
|
|
MachineFunction &MF = DAG.getMachineFunction();
|
|
|
|
MachineFrameInfo *MFI = MF.getFrameInfo();
|
|
|
|
MachineRegisterInfo &RegInfo = MF.getRegInfo();
|
|
|
|
|
|
|
|
// Assign locations to all of the incoming arguments.
|
|
|
|
SmallVector<CCValAssign, 16> ArgLocs;
|
Major calling convention code refactoring.
Instead of awkwardly encoding calling-convention information with ISD::CALL,
ISD::FORMAL_ARGUMENTS, ISD::RET, and ISD::ARG_FLAGS nodes, TargetLowering
provides three virtual functions for targets to override:
LowerFormalArguments, LowerCall, and LowerRet, which replace the custom
lowering done on the special nodes. They provide the same information, but
in a more immediately usable format.
This also reworks much of the target-independent tail call logic. The
decision of whether or not to perform a tail call is now cleanly split
between target-independent portions, and the target dependent portion
in IsEligibleForTailCallOptimization.
This also synchronizes all in-tree targets, to help enable future
refactoring and feature work.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@78142 91177308-0d34-0410-b5e6-96231b3b80d8
2009-08-05 01:29:28 +00:00
|
|
|
CCState CCInfo(CallConv, isVarArg, getTargetMachine(),
|
|
|
|
ArgLocs, *DAG.getContext());
|
|
|
|
CCInfo.AnalyzeFormalArguments(Ins, CC_MSP430);
|
2009-05-03 12:59:33 +00:00
|
|
|
|
|
|
|
assert(!isVarArg && "Varargs not supported yet");
|
|
|
|
|
|
|
|
for (unsigned i = 0, e = ArgLocs.size(); i != e; ++i) {
|
|
|
|
CCValAssign &VA = ArgLocs[i];
|
|
|
|
if (VA.isRegLoc()) {
|
|
|
|
// Arguments passed in registers
|
2009-08-10 22:56:29 +00:00
|
|
|
EVT RegVT = VA.getLocVT();
|
2009-08-11 20:47:22 +00:00
|
|
|
switch (RegVT.getSimpleVT().SimpleTy) {
|
2009-07-08 19:04:27 +00:00
|
|
|
default:
|
|
|
|
{
|
2009-07-08 20:53:28 +00:00
|
|
|
#ifndef NDEBUG
|
2009-08-23 07:05:07 +00:00
|
|
|
errs() << "LowerFormalArguments Unhandled argument type: "
|
2009-08-11 20:47:22 +00:00
|
|
|
<< RegVT.getSimpleVT().SimpleTy << "\n";
|
2009-07-08 20:53:28 +00:00
|
|
|
#endif
|
2009-07-14 16:55:14 +00:00
|
|
|
llvm_unreachable(0);
|
2009-07-08 19:04:27 +00:00
|
|
|
}
|
2009-08-11 20:47:22 +00:00
|
|
|
case MVT::i16:
|
2009-05-03 12:59:33 +00:00
|
|
|
unsigned VReg =
|
2009-05-03 13:02:04 +00:00
|
|
|
RegInfo.createVirtualRegister(MSP430::GR16RegisterClass);
|
2009-05-03 12:59:33 +00:00
|
|
|
RegInfo.addLiveIn(VA.getLocReg(), VReg);
|
Major calling convention code refactoring.
Instead of awkwardly encoding calling-convention information with ISD::CALL,
ISD::FORMAL_ARGUMENTS, ISD::RET, and ISD::ARG_FLAGS nodes, TargetLowering
provides three virtual functions for targets to override:
LowerFormalArguments, LowerCall, and LowerRet, which replace the custom
lowering done on the special nodes. They provide the same information, but
in a more immediately usable format.
This also reworks much of the target-independent tail call logic. The
decision of whether or not to perform a tail call is now cleanly split
between target-independent portions, and the target dependent portion
in IsEligibleForTailCallOptimization.
This also synchronizes all in-tree targets, to help enable future
refactoring and feature work.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@78142 91177308-0d34-0410-b5e6-96231b3b80d8
2009-08-05 01:29:28 +00:00
|
|
|
SDValue ArgValue = DAG.getCopyFromReg(Chain, dl, VReg, RegVT);
|
2009-05-03 12:59:33 +00:00
|
|
|
|
|
|
|
// If this is an 8-bit value, it is really passed promoted to 16
|
|
|
|
// bits. Insert an assert[sz]ext to capture this, then truncate to the
|
|
|
|
// right size.
|
|
|
|
if (VA.getLocInfo() == CCValAssign::SExt)
|
|
|
|
ArgValue = DAG.getNode(ISD::AssertSext, dl, RegVT, ArgValue,
|
|
|
|
DAG.getValueType(VA.getValVT()));
|
|
|
|
else if (VA.getLocInfo() == CCValAssign::ZExt)
|
|
|
|
ArgValue = DAG.getNode(ISD::AssertZext, dl, RegVT, ArgValue,
|
|
|
|
DAG.getValueType(VA.getValVT()));
|
|
|
|
|
|
|
|
if (VA.getLocInfo() != CCValAssign::Full)
|
|
|
|
ArgValue = DAG.getNode(ISD::TRUNCATE, dl, VA.getValVT(), ArgValue);
|
|
|
|
|
Major calling convention code refactoring.
Instead of awkwardly encoding calling-convention information with ISD::CALL,
ISD::FORMAL_ARGUMENTS, ISD::RET, and ISD::ARG_FLAGS nodes, TargetLowering
provides three virtual functions for targets to override:
LowerFormalArguments, LowerCall, and LowerRet, which replace the custom
lowering done on the special nodes. They provide the same information, but
in a more immediately usable format.
This also reworks much of the target-independent tail call logic. The
decision of whether or not to perform a tail call is now cleanly split
between target-independent portions, and the target dependent portion
in IsEligibleForTailCallOptimization.
This also synchronizes all in-tree targets, to help enable future
refactoring and feature work.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@78142 91177308-0d34-0410-b5e6-96231b3b80d8
2009-08-05 01:29:28 +00:00
|
|
|
InVals.push_back(ArgValue);
|
2009-05-03 12:59:33 +00:00
|
|
|
}
|
|
|
|
} else {
|
|
|
|
// Sanity check
|
|
|
|
assert(VA.isMemLoc());
|
|
|
|
// Load the argument to a virtual register
|
|
|
|
unsigned ObjSize = VA.getLocVT().getSizeInBits()/8;
|
|
|
|
if (ObjSize > 2) {
|
2009-08-23 07:05:07 +00:00
|
|
|
errs() << "LowerFormalArguments Unhandled argument type: "
|
2009-08-11 20:47:22 +00:00
|
|
|
<< VA.getLocVT().getSimpleVT().SimpleTy
|
2009-05-03 12:59:33 +00:00
|
|
|
<< "\n";
|
|
|
|
}
|
|
|
|
// Create the frame index object for this incoming parameter...
|
2009-11-12 20:49:22 +00:00
|
|
|
int FI = MFI->CreateFixedObject(ObjSize, VA.getLocMemOffset(), true, false);
|
2009-05-03 12:59:33 +00:00
|
|
|
|
|
|
|
// Create the SelectionDAG nodes corresponding to a load
|
|
|
|
//from this parameter
|
2009-08-11 20:47:22 +00:00
|
|
|
SDValue FIN = DAG.getFrameIndex(FI, MVT::i16);
|
Major calling convention code refactoring.
Instead of awkwardly encoding calling-convention information with ISD::CALL,
ISD::FORMAL_ARGUMENTS, ISD::RET, and ISD::ARG_FLAGS nodes, TargetLowering
provides three virtual functions for targets to override:
LowerFormalArguments, LowerCall, and LowerRet, which replace the custom
lowering done on the special nodes. They provide the same information, but
in a more immediately usable format.
This also reworks much of the target-independent tail call logic. The
decision of whether or not to perform a tail call is now cleanly split
between target-independent portions, and the target dependent portion
in IsEligibleForTailCallOptimization.
This also synchronizes all in-tree targets, to help enable future
refactoring and feature work.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@78142 91177308-0d34-0410-b5e6-96231b3b80d8
2009-08-05 01:29:28 +00:00
|
|
|
InVals.push_back(DAG.getLoad(VA.getLocVT(), dl, Chain, FIN,
|
2009-10-17 07:53:04 +00:00
|
|
|
PseudoSourceValue::getFixedStack(FI), 0));
|
2009-05-03 12:59:33 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
Major calling convention code refactoring.
Instead of awkwardly encoding calling-convention information with ISD::CALL,
ISD::FORMAL_ARGUMENTS, ISD::RET, and ISD::ARG_FLAGS nodes, TargetLowering
provides three virtual functions for targets to override:
LowerFormalArguments, LowerCall, and LowerRet, which replace the custom
lowering done on the special nodes. They provide the same information, but
in a more immediately usable format.
This also reworks much of the target-independent tail call logic. The
decision of whether or not to perform a tail call is now cleanly split
between target-independent portions, and the target dependent portion
in IsEligibleForTailCallOptimization.
This also synchronizes all in-tree targets, to help enable future
refactoring and feature work.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@78142 91177308-0d34-0410-b5e6-96231b3b80d8
2009-08-05 01:29:28 +00:00
|
|
|
return Chain;
|
2009-05-03 12:59:33 +00:00
|
|
|
}
|
2009-05-03 12:59:50 +00:00
|
|
|
|
Major calling convention code refactoring.
Instead of awkwardly encoding calling-convention information with ISD::CALL,
ISD::FORMAL_ARGUMENTS, ISD::RET, and ISD::ARG_FLAGS nodes, TargetLowering
provides three virtual functions for targets to override:
LowerFormalArguments, LowerCall, and LowerRet, which replace the custom
lowering done on the special nodes. They provide the same information, but
in a more immediately usable format.
This also reworks much of the target-independent tail call logic. The
decision of whether or not to perform a tail call is now cleanly split
between target-independent portions, and the target dependent portion
in IsEligibleForTailCallOptimization.
This also synchronizes all in-tree targets, to help enable future
refactoring and feature work.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@78142 91177308-0d34-0410-b5e6-96231b3b80d8
2009-08-05 01:29:28 +00:00
|
|
|
SDValue
|
|
|
|
MSP430TargetLowering::LowerReturn(SDValue Chain,
|
2009-09-02 08:44:58 +00:00
|
|
|
CallingConv::ID CallConv, bool isVarArg,
|
Major calling convention code refactoring.
Instead of awkwardly encoding calling-convention information with ISD::CALL,
ISD::FORMAL_ARGUMENTS, ISD::RET, and ISD::ARG_FLAGS nodes, TargetLowering
provides three virtual functions for targets to override:
LowerFormalArguments, LowerCall, and LowerRet, which replace the custom
lowering done on the special nodes. They provide the same information, but
in a more immediately usable format.
This also reworks much of the target-independent tail call logic. The
decision of whether or not to perform a tail call is now cleanly split
between target-independent portions, and the target dependent portion
in IsEligibleForTailCallOptimization.
This also synchronizes all in-tree targets, to help enable future
refactoring and feature work.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@78142 91177308-0d34-0410-b5e6-96231b3b80d8
2009-08-05 01:29:28 +00:00
|
|
|
const SmallVectorImpl<ISD::OutputArg> &Outs,
|
|
|
|
DebugLoc dl, SelectionDAG &DAG) {
|
|
|
|
|
2009-05-03 12:59:50 +00:00
|
|
|
// CCValAssign - represent the assignment of the return value to a location
|
|
|
|
SmallVector<CCValAssign, 16> RVLocs;
|
|
|
|
|
2009-12-07 02:27:53 +00:00
|
|
|
// ISRs cannot return any value.
|
|
|
|
if (CallConv == CallingConv::MSP430_INTR && !Outs.empty()) {
|
|
|
|
llvm_report_error("ISRs cannot return any value");
|
|
|
|
return SDValue();
|
|
|
|
}
|
|
|
|
|
2009-05-03 12:59:50 +00:00
|
|
|
// CCState - Info about the registers and stack slot.
|
Major calling convention code refactoring.
Instead of awkwardly encoding calling-convention information with ISD::CALL,
ISD::FORMAL_ARGUMENTS, ISD::RET, and ISD::ARG_FLAGS nodes, TargetLowering
provides three virtual functions for targets to override:
LowerFormalArguments, LowerCall, and LowerRet, which replace the custom
lowering done on the special nodes. They provide the same information, but
in a more immediately usable format.
This also reworks much of the target-independent tail call logic. The
decision of whether or not to perform a tail call is now cleanly split
between target-independent portions, and the target dependent portion
in IsEligibleForTailCallOptimization.
This also synchronizes all in-tree targets, to help enable future
refactoring and feature work.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@78142 91177308-0d34-0410-b5e6-96231b3b80d8
2009-08-05 01:29:28 +00:00
|
|
|
CCState CCInfo(CallConv, isVarArg, getTargetMachine(),
|
|
|
|
RVLocs, *DAG.getContext());
|
2009-05-03 12:59:50 +00:00
|
|
|
|
Major calling convention code refactoring.
Instead of awkwardly encoding calling-convention information with ISD::CALL,
ISD::FORMAL_ARGUMENTS, ISD::RET, and ISD::ARG_FLAGS nodes, TargetLowering
provides three virtual functions for targets to override:
LowerFormalArguments, LowerCall, and LowerRet, which replace the custom
lowering done on the special nodes. They provide the same information, but
in a more immediately usable format.
This also reworks much of the target-independent tail call logic. The
decision of whether or not to perform a tail call is now cleanly split
between target-independent portions, and the target dependent portion
in IsEligibleForTailCallOptimization.
This also synchronizes all in-tree targets, to help enable future
refactoring and feature work.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@78142 91177308-0d34-0410-b5e6-96231b3b80d8
2009-08-05 01:29:28 +00:00
|
|
|
// Analize return values.
|
|
|
|
CCInfo.AnalyzeReturn(Outs, RetCC_MSP430);
|
2009-05-03 12:59:50 +00:00
|
|
|
|
|
|
|
// If this is the first return lowered for this function, add the regs to the
|
|
|
|
// liveout set for the function.
|
|
|
|
if (DAG.getMachineFunction().getRegInfo().liveout_empty()) {
|
|
|
|
for (unsigned i = 0; i != RVLocs.size(); ++i)
|
|
|
|
if (RVLocs[i].isRegLoc())
|
|
|
|
DAG.getMachineFunction().getRegInfo().addLiveOut(RVLocs[i].getLocReg());
|
|
|
|
}
|
|
|
|
|
|
|
|
SDValue Flag;
|
|
|
|
|
|
|
|
// Copy the result values into the output registers.
|
|
|
|
for (unsigned i = 0; i != RVLocs.size(); ++i) {
|
|
|
|
CCValAssign &VA = RVLocs[i];
|
|
|
|
assert(VA.isRegLoc() && "Can only return in registers!");
|
|
|
|
|
|
|
|
Chain = DAG.getCopyToReg(Chain, dl, VA.getLocReg(),
|
Major calling convention code refactoring.
Instead of awkwardly encoding calling-convention information with ISD::CALL,
ISD::FORMAL_ARGUMENTS, ISD::RET, and ISD::ARG_FLAGS nodes, TargetLowering
provides three virtual functions for targets to override:
LowerFormalArguments, LowerCall, and LowerRet, which replace the custom
lowering done on the special nodes. They provide the same information, but
in a more immediately usable format.
This also reworks much of the target-independent tail call logic. The
decision of whether or not to perform a tail call is now cleanly split
between target-independent portions, and the target dependent portion
in IsEligibleForTailCallOptimization.
This also synchronizes all in-tree targets, to help enable future
refactoring and feature work.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@78142 91177308-0d34-0410-b5e6-96231b3b80d8
2009-08-05 01:29:28 +00:00
|
|
|
Outs[i].Val, Flag);
|
2009-05-03 12:59:50 +00:00
|
|
|
|
2009-05-03 13:00:11 +00:00
|
|
|
// Guarantee that all emitted copies are stuck together,
|
|
|
|
// avoiding something bad.
|
2009-05-03 12:59:50 +00:00
|
|
|
Flag = Chain.getValue(1);
|
|
|
|
}
|
|
|
|
|
2009-12-07 02:27:53 +00:00
|
|
|
unsigned Opc = (CallConv == CallingConv::MSP430_INTR ?
|
|
|
|
MSP430ISD::RETI_FLAG : MSP430ISD::RET_FLAG);
|
|
|
|
|
2009-05-03 12:59:50 +00:00
|
|
|
if (Flag.getNode())
|
2009-12-07 02:27:53 +00:00
|
|
|
return DAG.getNode(Opc, dl, MVT::Other, Chain, Flag);
|
2009-05-03 12:59:50 +00:00
|
|
|
|
|
|
|
// Return Void
|
2009-12-07 02:27:53 +00:00
|
|
|
return DAG.getNode(Opc, dl, MVT::Other, Chain);
|
2009-05-03 12:59:50 +00:00
|
|
|
}
|
|
|
|
|
2009-05-03 13:07:31 +00:00
|
|
|
/// LowerCCCCallTo - functions arguments are copied from virtual regs to
|
|
|
|
/// (physical regs)/(stack frame), CALLSEQ_START and CALLSEQ_END are emitted.
|
|
|
|
/// TODO: sret.
|
Major calling convention code refactoring.
Instead of awkwardly encoding calling-convention information with ISD::CALL,
ISD::FORMAL_ARGUMENTS, ISD::RET, and ISD::ARG_FLAGS nodes, TargetLowering
provides three virtual functions for targets to override:
LowerFormalArguments, LowerCall, and LowerRet, which replace the custom
lowering done on the special nodes. They provide the same information, but
in a more immediately usable format.
This also reworks much of the target-independent tail call logic. The
decision of whether or not to perform a tail call is now cleanly split
between target-independent portions, and the target dependent portion
in IsEligibleForTailCallOptimization.
This also synchronizes all in-tree targets, to help enable future
refactoring and feature work.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@78142 91177308-0d34-0410-b5e6-96231b3b80d8
2009-08-05 01:29:28 +00:00
|
|
|
SDValue
|
|
|
|
MSP430TargetLowering::LowerCCCCallTo(SDValue Chain, SDValue Callee,
|
2009-09-02 08:44:58 +00:00
|
|
|
CallingConv::ID CallConv, bool isVarArg,
|
Major calling convention code refactoring.
Instead of awkwardly encoding calling-convention information with ISD::CALL,
ISD::FORMAL_ARGUMENTS, ISD::RET, and ISD::ARG_FLAGS nodes, TargetLowering
provides three virtual functions for targets to override:
LowerFormalArguments, LowerCall, and LowerRet, which replace the custom
lowering done on the special nodes. They provide the same information, but
in a more immediately usable format.
This also reworks much of the target-independent tail call logic. The
decision of whether or not to perform a tail call is now cleanly split
between target-independent portions, and the target dependent portion
in IsEligibleForTailCallOptimization.
This also synchronizes all in-tree targets, to help enable future
refactoring and feature work.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@78142 91177308-0d34-0410-b5e6-96231b3b80d8
2009-08-05 01:29:28 +00:00
|
|
|
bool isTailCall,
|
|
|
|
const SmallVectorImpl<ISD::OutputArg>
|
|
|
|
&Outs,
|
|
|
|
const SmallVectorImpl<ISD::InputArg> &Ins,
|
|
|
|
DebugLoc dl, SelectionDAG &DAG,
|
|
|
|
SmallVectorImpl<SDValue> &InVals) {
|
2009-05-03 13:07:31 +00:00
|
|
|
// Analyze operands of the call, assigning locations to each operand.
|
|
|
|
SmallVector<CCValAssign, 16> ArgLocs;
|
Major calling convention code refactoring.
Instead of awkwardly encoding calling-convention information with ISD::CALL,
ISD::FORMAL_ARGUMENTS, ISD::RET, and ISD::ARG_FLAGS nodes, TargetLowering
provides three virtual functions for targets to override:
LowerFormalArguments, LowerCall, and LowerRet, which replace the custom
lowering done on the special nodes. They provide the same information, but
in a more immediately usable format.
This also reworks much of the target-independent tail call logic. The
decision of whether or not to perform a tail call is now cleanly split
between target-independent portions, and the target dependent portion
in IsEligibleForTailCallOptimization.
This also synchronizes all in-tree targets, to help enable future
refactoring and feature work.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@78142 91177308-0d34-0410-b5e6-96231b3b80d8
2009-08-05 01:29:28 +00:00
|
|
|
CCState CCInfo(CallConv, isVarArg, getTargetMachine(),
|
|
|
|
ArgLocs, *DAG.getContext());
|
2009-05-03 13:07:31 +00:00
|
|
|
|
Major calling convention code refactoring.
Instead of awkwardly encoding calling-convention information with ISD::CALL,
ISD::FORMAL_ARGUMENTS, ISD::RET, and ISD::ARG_FLAGS nodes, TargetLowering
provides three virtual functions for targets to override:
LowerFormalArguments, LowerCall, and LowerRet, which replace the custom
lowering done on the special nodes. They provide the same information, but
in a more immediately usable format.
This also reworks much of the target-independent tail call logic. The
decision of whether or not to perform a tail call is now cleanly split
between target-independent portions, and the target dependent portion
in IsEligibleForTailCallOptimization.
This also synchronizes all in-tree targets, to help enable future
refactoring and feature work.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@78142 91177308-0d34-0410-b5e6-96231b3b80d8
2009-08-05 01:29:28 +00:00
|
|
|
CCInfo.AnalyzeCallOperands(Outs, CC_MSP430);
|
2009-05-03 13:07:31 +00:00
|
|
|
|
|
|
|
// Get a count of how many bytes are to be pushed on the stack.
|
|
|
|
unsigned NumBytes = CCInfo.getNextStackOffset();
|
|
|
|
|
|
|
|
Chain = DAG.getCALLSEQ_START(Chain ,DAG.getConstant(NumBytes,
|
|
|
|
getPointerTy(), true));
|
|
|
|
|
|
|
|
SmallVector<std::pair<unsigned, SDValue>, 4> RegsToPass;
|
|
|
|
SmallVector<SDValue, 12> MemOpChains;
|
|
|
|
SDValue StackPtr;
|
|
|
|
|
|
|
|
// Walk the register/memloc assignments, inserting copies/loads.
|
|
|
|
for (unsigned i = 0, e = ArgLocs.size(); i != e; ++i) {
|
|
|
|
CCValAssign &VA = ArgLocs[i];
|
|
|
|
|
Major calling convention code refactoring.
Instead of awkwardly encoding calling-convention information with ISD::CALL,
ISD::FORMAL_ARGUMENTS, ISD::RET, and ISD::ARG_FLAGS nodes, TargetLowering
provides three virtual functions for targets to override:
LowerFormalArguments, LowerCall, and LowerRet, which replace the custom
lowering done on the special nodes. They provide the same information, but
in a more immediately usable format.
This also reworks much of the target-independent tail call logic. The
decision of whether or not to perform a tail call is now cleanly split
between target-independent portions, and the target dependent portion
in IsEligibleForTailCallOptimization.
This also synchronizes all in-tree targets, to help enable future
refactoring and feature work.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@78142 91177308-0d34-0410-b5e6-96231b3b80d8
2009-08-05 01:29:28 +00:00
|
|
|
SDValue Arg = Outs[i].Val;
|
2009-05-03 13:07:31 +00:00
|
|
|
|
|
|
|
// Promote the value if needed.
|
|
|
|
switch (VA.getLocInfo()) {
|
2009-07-14 16:55:14 +00:00
|
|
|
default: llvm_unreachable("Unknown loc info!");
|
2009-05-03 13:07:31 +00:00
|
|
|
case CCValAssign::Full: break;
|
|
|
|
case CCValAssign::SExt:
|
|
|
|
Arg = DAG.getNode(ISD::SIGN_EXTEND, dl, VA.getLocVT(), Arg);
|
|
|
|
break;
|
|
|
|
case CCValAssign::ZExt:
|
|
|
|
Arg = DAG.getNode(ISD::ZERO_EXTEND, dl, VA.getLocVT(), Arg);
|
|
|
|
break;
|
|
|
|
case CCValAssign::AExt:
|
|
|
|
Arg = DAG.getNode(ISD::ANY_EXTEND, dl, VA.getLocVT(), Arg);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Arguments that can be passed on register must be kept at RegsToPass
|
|
|
|
// vector
|
|
|
|
if (VA.isRegLoc()) {
|
|
|
|
RegsToPass.push_back(std::make_pair(VA.getLocReg(), Arg));
|
|
|
|
} else {
|
|
|
|
assert(VA.isMemLoc());
|
|
|
|
|
|
|
|
if (StackPtr.getNode() == 0)
|
|
|
|
StackPtr = DAG.getCopyFromReg(Chain, dl, MSP430::SPW, getPointerTy());
|
|
|
|
|
|
|
|
SDValue PtrOff = DAG.getNode(ISD::ADD, dl, getPointerTy(),
|
|
|
|
StackPtr,
|
|
|
|
DAG.getIntPtrConstant(VA.getLocMemOffset()));
|
|
|
|
|
|
|
|
|
|
|
|
MemOpChains.push_back(DAG.getStore(Chain, dl, Arg, PtrOff,
|
|
|
|
PseudoSourceValue::getStack(),
|
|
|
|
VA.getLocMemOffset()));
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// Transform all store nodes into one single node because all store nodes are
|
|
|
|
// independent of each other.
|
|
|
|
if (!MemOpChains.empty())
|
2009-08-11 20:47:22 +00:00
|
|
|
Chain = DAG.getNode(ISD::TokenFactor, dl, MVT::Other,
|
2009-05-03 13:07:31 +00:00
|
|
|
&MemOpChains[0], MemOpChains.size());
|
|
|
|
|
|
|
|
// Build a sequence of copy-to-reg nodes chained together with token chain and
|
|
|
|
// flag operands which copy the outgoing args into registers. The InFlag in
|
|
|
|
// necessary since all emited instructions must be stuck together.
|
|
|
|
SDValue InFlag;
|
|
|
|
for (unsigned i = 0, e = RegsToPass.size(); i != e; ++i) {
|
|
|
|
Chain = DAG.getCopyToReg(Chain, dl, RegsToPass[i].first,
|
|
|
|
RegsToPass[i].second, InFlag);
|
|
|
|
InFlag = Chain.getValue(1);
|
|
|
|
}
|
|
|
|
|
|
|
|
// If the callee is a GlobalAddress node (quite common, every direct call is)
|
|
|
|
// turn it into a TargetGlobalAddress node so that legalize doesn't hack it.
|
|
|
|
// Likewise ExternalSymbol -> TargetExternalSymbol.
|
|
|
|
if (GlobalAddressSDNode *G = dyn_cast<GlobalAddressSDNode>(Callee))
|
2009-08-11 20:47:22 +00:00
|
|
|
Callee = DAG.getTargetGlobalAddress(G->getGlobal(), MVT::i16);
|
2009-05-03 13:07:31 +00:00
|
|
|
else if (ExternalSymbolSDNode *E = dyn_cast<ExternalSymbolSDNode>(Callee))
|
2009-08-11 20:47:22 +00:00
|
|
|
Callee = DAG.getTargetExternalSymbol(E->getSymbol(), MVT::i16);
|
2009-05-03 13:07:31 +00:00
|
|
|
|
|
|
|
// Returns a chain & a flag for retval copy to use.
|
2009-08-11 20:47:22 +00:00
|
|
|
SDVTList NodeTys = DAG.getVTList(MVT::Other, MVT::Flag);
|
2009-05-03 13:07:31 +00:00
|
|
|
SmallVector<SDValue, 8> Ops;
|
|
|
|
Ops.push_back(Chain);
|
|
|
|
Ops.push_back(Callee);
|
|
|
|
|
|
|
|
// Add argument registers to the end of the list so that they are
|
|
|
|
// known live into the call.
|
|
|
|
for (unsigned i = 0, e = RegsToPass.size(); i != e; ++i)
|
|
|
|
Ops.push_back(DAG.getRegister(RegsToPass[i].first,
|
|
|
|
RegsToPass[i].second.getValueType()));
|
|
|
|
|
|
|
|
if (InFlag.getNode())
|
|
|
|
Ops.push_back(InFlag);
|
|
|
|
|
|
|
|
Chain = DAG.getNode(MSP430ISD::CALL, dl, NodeTys, &Ops[0], Ops.size());
|
|
|
|
InFlag = Chain.getValue(1);
|
|
|
|
|
|
|
|
// Create the CALLSEQ_END node.
|
|
|
|
Chain = DAG.getCALLSEQ_END(Chain,
|
|
|
|
DAG.getConstant(NumBytes, getPointerTy(), true),
|
|
|
|
DAG.getConstant(0, getPointerTy(), true),
|
|
|
|
InFlag);
|
|
|
|
InFlag = Chain.getValue(1);
|
|
|
|
|
|
|
|
// Handle result values, copying them out of physregs into vregs that we
|
|
|
|
// return.
|
Major calling convention code refactoring.
Instead of awkwardly encoding calling-convention information with ISD::CALL,
ISD::FORMAL_ARGUMENTS, ISD::RET, and ISD::ARG_FLAGS nodes, TargetLowering
provides three virtual functions for targets to override:
LowerFormalArguments, LowerCall, and LowerRet, which replace the custom
lowering done on the special nodes. They provide the same information, but
in a more immediately usable format.
This also reworks much of the target-independent tail call logic. The
decision of whether or not to perform a tail call is now cleanly split
between target-independent portions, and the target dependent portion
in IsEligibleForTailCallOptimization.
This also synchronizes all in-tree targets, to help enable future
refactoring and feature work.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@78142 91177308-0d34-0410-b5e6-96231b3b80d8
2009-08-05 01:29:28 +00:00
|
|
|
return LowerCallResult(Chain, InFlag, CallConv, isVarArg, Ins, dl,
|
|
|
|
DAG, InVals);
|
2009-05-03 13:07:31 +00:00
|
|
|
}
|
|
|
|
|
Major calling convention code refactoring.
Instead of awkwardly encoding calling-convention information with ISD::CALL,
ISD::FORMAL_ARGUMENTS, ISD::RET, and ISD::ARG_FLAGS nodes, TargetLowering
provides three virtual functions for targets to override:
LowerFormalArguments, LowerCall, and LowerRet, which replace the custom
lowering done on the special nodes. They provide the same information, but
in a more immediately usable format.
This also reworks much of the target-independent tail call logic. The
decision of whether or not to perform a tail call is now cleanly split
between target-independent portions, and the target dependent portion
in IsEligibleForTailCallOptimization.
This also synchronizes all in-tree targets, to help enable future
refactoring and feature work.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@78142 91177308-0d34-0410-b5e6-96231b3b80d8
2009-08-05 01:29:28 +00:00
|
|
|
/// LowerCallResult - Lower the result values of a call into the
|
|
|
|
/// appropriate copies out of appropriate physical registers.
|
|
|
|
///
|
|
|
|
SDValue
|
2009-05-03 13:07:31 +00:00
|
|
|
MSP430TargetLowering::LowerCallResult(SDValue Chain, SDValue InFlag,
|
2009-09-02 08:44:58 +00:00
|
|
|
CallingConv::ID CallConv, bool isVarArg,
|
Major calling convention code refactoring.
Instead of awkwardly encoding calling-convention information with ISD::CALL,
ISD::FORMAL_ARGUMENTS, ISD::RET, and ISD::ARG_FLAGS nodes, TargetLowering
provides three virtual functions for targets to override:
LowerFormalArguments, LowerCall, and LowerRet, which replace the custom
lowering done on the special nodes. They provide the same information, but
in a more immediately usable format.
This also reworks much of the target-independent tail call logic. The
decision of whether or not to perform a tail call is now cleanly split
between target-independent portions, and the target dependent portion
in IsEligibleForTailCallOptimization.
This also synchronizes all in-tree targets, to help enable future
refactoring and feature work.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@78142 91177308-0d34-0410-b5e6-96231b3b80d8
2009-08-05 01:29:28 +00:00
|
|
|
const SmallVectorImpl<ISD::InputArg> &Ins,
|
|
|
|
DebugLoc dl, SelectionDAG &DAG,
|
|
|
|
SmallVectorImpl<SDValue> &InVals) {
|
2009-05-03 13:07:31 +00:00
|
|
|
|
|
|
|
// Assign locations to each value returned by this call.
|
|
|
|
SmallVector<CCValAssign, 16> RVLocs;
|
Major calling convention code refactoring.
Instead of awkwardly encoding calling-convention information with ISD::CALL,
ISD::FORMAL_ARGUMENTS, ISD::RET, and ISD::ARG_FLAGS nodes, TargetLowering
provides three virtual functions for targets to override:
LowerFormalArguments, LowerCall, and LowerRet, which replace the custom
lowering done on the special nodes. They provide the same information, but
in a more immediately usable format.
This also reworks much of the target-independent tail call logic. The
decision of whether or not to perform a tail call is now cleanly split
between target-independent portions, and the target dependent portion
in IsEligibleForTailCallOptimization.
This also synchronizes all in-tree targets, to help enable future
refactoring and feature work.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@78142 91177308-0d34-0410-b5e6-96231b3b80d8
2009-08-05 01:29:28 +00:00
|
|
|
CCState CCInfo(CallConv, isVarArg, getTargetMachine(),
|
2009-07-22 00:24:57 +00:00
|
|
|
RVLocs, *DAG.getContext());
|
2009-05-03 13:07:31 +00:00
|
|
|
|
Major calling convention code refactoring.
Instead of awkwardly encoding calling-convention information with ISD::CALL,
ISD::FORMAL_ARGUMENTS, ISD::RET, and ISD::ARG_FLAGS nodes, TargetLowering
provides three virtual functions for targets to override:
LowerFormalArguments, LowerCall, and LowerRet, which replace the custom
lowering done on the special nodes. They provide the same information, but
in a more immediately usable format.
This also reworks much of the target-independent tail call logic. The
decision of whether or not to perform a tail call is now cleanly split
between target-independent portions, and the target dependent portion
in IsEligibleForTailCallOptimization.
This also synchronizes all in-tree targets, to help enable future
refactoring and feature work.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@78142 91177308-0d34-0410-b5e6-96231b3b80d8
2009-08-05 01:29:28 +00:00
|
|
|
CCInfo.AnalyzeCallResult(Ins, RetCC_MSP430);
|
2009-05-03 13:07:31 +00:00
|
|
|
|
|
|
|
// Copy all of the result registers out of their specified physreg.
|
|
|
|
for (unsigned i = 0; i != RVLocs.size(); ++i) {
|
|
|
|
Chain = DAG.getCopyFromReg(Chain, dl, RVLocs[i].getLocReg(),
|
|
|
|
RVLocs[i].getValVT(), InFlag).getValue(1);
|
|
|
|
InFlag = Chain.getValue(2);
|
Major calling convention code refactoring.
Instead of awkwardly encoding calling-convention information with ISD::CALL,
ISD::FORMAL_ARGUMENTS, ISD::RET, and ISD::ARG_FLAGS nodes, TargetLowering
provides three virtual functions for targets to override:
LowerFormalArguments, LowerCall, and LowerRet, which replace the custom
lowering done on the special nodes. They provide the same information, but
in a more immediately usable format.
This also reworks much of the target-independent tail call logic. The
decision of whether or not to perform a tail call is now cleanly split
between target-independent portions, and the target dependent portion
in IsEligibleForTailCallOptimization.
This also synchronizes all in-tree targets, to help enable future
refactoring and feature work.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@78142 91177308-0d34-0410-b5e6-96231b3b80d8
2009-08-05 01:29:28 +00:00
|
|
|
InVals.push_back(Chain.getValue(0));
|
2009-05-03 13:07:31 +00:00
|
|
|
}
|
|
|
|
|
Major calling convention code refactoring.
Instead of awkwardly encoding calling-convention information with ISD::CALL,
ISD::FORMAL_ARGUMENTS, ISD::RET, and ISD::ARG_FLAGS nodes, TargetLowering
provides three virtual functions for targets to override:
LowerFormalArguments, LowerCall, and LowerRet, which replace the custom
lowering done on the special nodes. They provide the same information, but
in a more immediately usable format.
This also reworks much of the target-independent tail call logic. The
decision of whether or not to perform a tail call is now cleanly split
between target-independent portions, and the target dependent portion
in IsEligibleForTailCallOptimization.
This also synchronizes all in-tree targets, to help enable future
refactoring and feature work.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@78142 91177308-0d34-0410-b5e6-96231b3b80d8
2009-08-05 01:29:28 +00:00
|
|
|
return Chain;
|
2009-05-03 13:07:31 +00:00
|
|
|
}
|
|
|
|
|
2009-05-03 13:03:33 +00:00
|
|
|
SDValue MSP430TargetLowering::LowerShifts(SDValue Op,
|
|
|
|
SelectionDAG &DAG) {
|
2009-05-03 13:13:17 +00:00
|
|
|
unsigned Opc = Op.getOpcode();
|
2009-05-03 13:03:33 +00:00
|
|
|
SDNode* N = Op.getNode();
|
2009-08-10 22:56:29 +00:00
|
|
|
EVT VT = Op.getValueType();
|
2009-05-03 13:03:33 +00:00
|
|
|
DebugLoc dl = N->getDebugLoc();
|
|
|
|
|
2009-12-12 18:55:37 +00:00
|
|
|
// Expand non-constant shifts to loops:
|
2009-05-03 13:03:33 +00:00
|
|
|
if (!isa<ConstantSDNode>(N->getOperand(1)))
|
2009-12-12 18:55:37 +00:00
|
|
|
switch (Opc) {
|
|
|
|
default:
|
|
|
|
assert(0 && "Invalid shift opcode!");
|
|
|
|
case ISD::SHL:
|
|
|
|
return DAG.getNode(MSP430ISD::SHL, dl,
|
|
|
|
VT, N->getOperand(0), N->getOperand(1));
|
|
|
|
case ISD::SRA:
|
|
|
|
return DAG.getNode(MSP430ISD::SRA, dl,
|
|
|
|
VT, N->getOperand(0), N->getOperand(1));
|
|
|
|
case ISD::SRL:
|
|
|
|
return DAG.getNode(MSP430ISD::SRL, dl,
|
|
|
|
VT, N->getOperand(0), N->getOperand(1));
|
|
|
|
}
|
2009-05-03 13:03:33 +00:00
|
|
|
|
|
|
|
uint64_t ShiftAmount = cast<ConstantSDNode>(N->getOperand(1))->getZExtValue();
|
|
|
|
|
|
|
|
// Expand the stuff into sequence of shifts.
|
|
|
|
// FIXME: for some shift amounts this might be done better!
|
|
|
|
// E.g.: foo >> (8 + N) => sxt(swpb(foo)) >> N
|
|
|
|
SDValue Victim = N->getOperand(0);
|
2009-05-03 13:16:17 +00:00
|
|
|
|
|
|
|
if (Opc == ISD::SRL && ShiftAmount) {
|
|
|
|
// Emit a special goodness here:
|
|
|
|
// srl A, 1 => clrc; rrc A
|
2009-05-03 13:16:37 +00:00
|
|
|
Victim = DAG.getNode(MSP430ISD::RRC, dl, VT, Victim);
|
2009-05-03 13:16:17 +00:00
|
|
|
ShiftAmount -= 1;
|
|
|
|
}
|
|
|
|
|
2009-05-03 13:03:33 +00:00
|
|
|
while (ShiftAmount--)
|
2009-05-17 10:15:22 +00:00
|
|
|
Victim = DAG.getNode((Opc == ISD::SHL ? MSP430ISD::RLA : MSP430ISD::RRA),
|
2009-05-03 13:13:17 +00:00
|
|
|
dl, VT, Victim);
|
2009-05-03 13:03:33 +00:00
|
|
|
|
|
|
|
return Victim;
|
|
|
|
}
|
|
|
|
|
2009-05-03 13:08:33 +00:00
|
|
|
SDValue MSP430TargetLowering::LowerGlobalAddress(SDValue Op, SelectionDAG &DAG) {
|
|
|
|
const GlobalValue *GV = cast<GlobalAddressSDNode>(Op)->getGlobal();
|
|
|
|
int64_t Offset = cast<GlobalAddressSDNode>(Op)->getOffset();
|
|
|
|
|
|
|
|
// Create the TargetGlobalAddress node, folding in the constant offset.
|
|
|
|
SDValue Result = DAG.getTargetGlobalAddress(GV, getPointerTy(), Offset);
|
|
|
|
return DAG.getNode(MSP430ISD::Wrapper, Op.getDebugLoc(),
|
|
|
|
getPointerTy(), Result);
|
|
|
|
}
|
|
|
|
|
2009-05-03 13:14:46 +00:00
|
|
|
SDValue MSP430TargetLowering::LowerExternalSymbol(SDValue Op,
|
|
|
|
SelectionDAG &DAG) {
|
|
|
|
DebugLoc dl = Op.getDebugLoc();
|
|
|
|
const char *Sym = cast<ExternalSymbolSDNode>(Op)->getSymbol();
|
|
|
|
SDValue Result = DAG.getTargetExternalSymbol(Sym, getPointerTy());
|
|
|
|
|
|
|
|
return DAG.getNode(MSP430ISD::Wrapper, dl, getPointerTy(), Result);;
|
|
|
|
}
|
|
|
|
|
2009-10-21 19:16:49 +00:00
|
|
|
static SDValue EmitCMP(SDValue &LHS, SDValue &RHS, SDValue &TargetCC,
|
2009-05-03 13:19:09 +00:00
|
|
|
ISD::CondCode CC,
|
|
|
|
DebugLoc dl, SelectionDAG &DAG) {
|
2009-05-03 13:12:06 +00:00
|
|
|
// FIXME: Handle bittests someday
|
|
|
|
assert(!LHS.getValueType().isFloatingPoint() && "We don't handle FP yet");
|
|
|
|
|
|
|
|
// FIXME: Handle jump negative someday
|
2009-10-21 19:16:49 +00:00
|
|
|
MSP430CC::CondCodes TCC = MSP430CC::COND_INVALID;
|
2009-05-03 13:12:06 +00:00
|
|
|
switch (CC) {
|
2009-07-14 16:55:14 +00:00
|
|
|
default: llvm_unreachable("Invalid integer condition!");
|
2009-05-03 13:12:06 +00:00
|
|
|
case ISD::SETEQ:
|
2009-10-21 19:16:49 +00:00
|
|
|
TCC = MSP430CC::COND_E; // aka COND_Z
|
2010-01-15 01:29:49 +00:00
|
|
|
// Minor optimization: if LHS is a constant, swap operands, then the
|
2009-11-22 01:14:08 +00:00
|
|
|
// constant can be folded into comparison.
|
2010-01-15 01:29:49 +00:00
|
|
|
if (LHS.getOpcode() == ISD::Constant)
|
2009-11-22 01:14:08 +00:00
|
|
|
std::swap(LHS, RHS);
|
2009-05-03 13:12:06 +00:00
|
|
|
break;
|
|
|
|
case ISD::SETNE:
|
2009-10-21 19:16:49 +00:00
|
|
|
TCC = MSP430CC::COND_NE; // aka COND_NZ
|
2010-01-15 01:29:49 +00:00
|
|
|
// Minor optimization: if LHS is a constant, swap operands, then the
|
2009-11-22 01:14:08 +00:00
|
|
|
// constant can be folded into comparison.
|
2010-01-15 01:29:49 +00:00
|
|
|
if (LHS.getOpcode() == ISD::Constant)
|
2009-11-22 01:14:08 +00:00
|
|
|
std::swap(LHS, RHS);
|
2009-05-03 13:12:06 +00:00
|
|
|
break;
|
|
|
|
case ISD::SETULE:
|
|
|
|
std::swap(LHS, RHS); // FALLTHROUGH
|
|
|
|
case ISD::SETUGE:
|
2010-01-15 21:18:02 +00:00
|
|
|
// Turn lhs u>= rhs with lhs constant into rhs u< lhs+1, this allows us to
|
|
|
|
// fold constant into instruction.
|
|
|
|
if (const ConstantSDNode * C = dyn_cast<ConstantSDNode>(LHS)) {
|
|
|
|
LHS = RHS;
|
|
|
|
RHS = DAG.getConstant(C->getSExtValue() + 1, C->getValueType(0));
|
|
|
|
TCC = MSP430CC::COND_LO;
|
|
|
|
break;
|
|
|
|
}
|
2009-10-21 19:16:49 +00:00
|
|
|
TCC = MSP430CC::COND_HS; // aka COND_C
|
2009-05-03 13:12:06 +00:00
|
|
|
break;
|
|
|
|
case ISD::SETUGT:
|
|
|
|
std::swap(LHS, RHS); // FALLTHROUGH
|
|
|
|
case ISD::SETULT:
|
2010-01-15 21:18:02 +00:00
|
|
|
// Turn lhs u< rhs with lhs constant into rhs u>= lhs+1, this allows us to
|
|
|
|
// fold constant into instruction.
|
|
|
|
if (const ConstantSDNode * C = dyn_cast<ConstantSDNode>(LHS)) {
|
|
|
|
LHS = RHS;
|
|
|
|
RHS = DAG.getConstant(C->getSExtValue() + 1, C->getValueType(0));
|
|
|
|
TCC = MSP430CC::COND_HS;
|
|
|
|
break;
|
|
|
|
}
|
2009-10-21 19:16:49 +00:00
|
|
|
TCC = MSP430CC::COND_LO; // aka COND_NC
|
2009-05-03 13:12:06 +00:00
|
|
|
break;
|
|
|
|
case ISD::SETLE:
|
|
|
|
std::swap(LHS, RHS); // FALLTHROUGH
|
|
|
|
case ISD::SETGE:
|
2010-01-15 21:18:02 +00:00
|
|
|
// Turn lhs >= rhs with lhs constant into rhs < lhs+1, this allows us to
|
|
|
|
// fold constant into instruction.
|
|
|
|
if (const ConstantSDNode * C = dyn_cast<ConstantSDNode>(LHS)) {
|
|
|
|
LHS = RHS;
|
|
|
|
RHS = DAG.getConstant(C->getSExtValue() + 1, C->getValueType(0));
|
|
|
|
TCC = MSP430CC::COND_L;
|
|
|
|
break;
|
|
|
|
}
|
2009-10-21 19:16:49 +00:00
|
|
|
TCC = MSP430CC::COND_GE;
|
2009-05-03 13:12:06 +00:00
|
|
|
break;
|
|
|
|
case ISD::SETGT:
|
|
|
|
std::swap(LHS, RHS); // FALLTHROUGH
|
|
|
|
case ISD::SETLT:
|
2010-01-15 21:18:02 +00:00
|
|
|
// Turn lhs < rhs with lhs constant into rhs >= lhs+1, this allows us to
|
|
|
|
// fold constant into instruction.
|
|
|
|
if (const ConstantSDNode * C = dyn_cast<ConstantSDNode>(LHS)) {
|
|
|
|
LHS = RHS;
|
|
|
|
RHS = DAG.getConstant(C->getSExtValue() + 1, C->getValueType(0));
|
|
|
|
TCC = MSP430CC::COND_GE;
|
|
|
|
break;
|
|
|
|
}
|
2009-10-21 19:16:49 +00:00
|
|
|
TCC = MSP430CC::COND_L;
|
2009-05-03 13:12:06 +00:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
2009-10-21 19:16:49 +00:00
|
|
|
TargetCC = DAG.getConstant(TCC, MVT::i8);
|
2009-08-11 20:47:22 +00:00
|
|
|
return DAG.getNode(MSP430ISD::CMP, dl, MVT::Flag, LHS, RHS);
|
2009-05-03 13:12:06 +00:00
|
|
|
}
|
|
|
|
|
2009-05-03 13:19:09 +00:00
|
|
|
|
|
|
|
SDValue MSP430TargetLowering::LowerBR_CC(SDValue Op, SelectionDAG &DAG) {
|
2009-05-03 13:12:06 +00:00
|
|
|
SDValue Chain = Op.getOperand(0);
|
2009-05-03 13:19:09 +00:00
|
|
|
ISD::CondCode CC = cast<CondCodeSDNode>(Op.getOperand(1))->get();
|
|
|
|
SDValue LHS = Op.getOperand(2);
|
|
|
|
SDValue RHS = Op.getOperand(3);
|
|
|
|
SDValue Dest = Op.getOperand(4);
|
|
|
|
DebugLoc dl = Op.getDebugLoc();
|
|
|
|
|
2009-10-21 19:16:49 +00:00
|
|
|
SDValue TargetCC;
|
2009-05-03 13:19:09 +00:00
|
|
|
SDValue Flag = EmitCMP(LHS, RHS, TargetCC, CC, dl, DAG);
|
|
|
|
|
|
|
|
return DAG.getNode(MSP430ISD::BR_CC, dl, Op.getValueType(),
|
2009-10-21 19:16:49 +00:00
|
|
|
Chain, Dest, TargetCC, Flag);
|
2009-05-03 13:12:06 +00:00
|
|
|
}
|
|
|
|
|
2009-12-11 23:01:29 +00:00
|
|
|
|
|
|
|
SDValue MSP430TargetLowering::LowerSETCC(SDValue Op, SelectionDAG &DAG) {
|
|
|
|
SDValue LHS = Op.getOperand(0);
|
|
|
|
SDValue RHS = Op.getOperand(1);
|
|
|
|
DebugLoc dl = Op.getDebugLoc();
|
|
|
|
|
|
|
|
// If we are doing an AND and testing against zero, then the CMP
|
|
|
|
// will not be generated. The AND (or BIT) will generate the condition codes,
|
|
|
|
// but they are different from CMP.
|
2010-01-15 21:18:18 +00:00
|
|
|
// FIXME: since we're doing a post-processing, use a pseudoinstr here, so
|
|
|
|
// lowering & isel wouldn't diverge.
|
2009-12-11 23:01:29 +00:00
|
|
|
bool andCC = false;
|
|
|
|
if (ConstantSDNode *RHSC = dyn_cast<ConstantSDNode>(RHS)) {
|
|
|
|
if (RHSC->isNullValue() && LHS.hasOneUse() &&
|
|
|
|
(LHS.getOpcode() == ISD::AND ||
|
|
|
|
(LHS.getOpcode() == ISD::TRUNCATE &&
|
|
|
|
LHS.getOperand(0).getOpcode() == ISD::AND))) {
|
|
|
|
andCC = true;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
ISD::CondCode CC = cast<CondCodeSDNode>(Op.getOperand(2))->get();
|
|
|
|
SDValue TargetCC;
|
|
|
|
SDValue Flag = EmitCMP(LHS, RHS, TargetCC, CC, dl, DAG);
|
|
|
|
|
|
|
|
// Get the condition codes directly from the status register, if its easy.
|
|
|
|
// Otherwise a branch will be generated. Note that the AND and BIT
|
|
|
|
// instructions generate different flags than CMP, the carry bit can be used
|
|
|
|
// for NE/EQ.
|
|
|
|
bool Invert = false;
|
|
|
|
bool Shift = false;
|
|
|
|
bool Convert = true;
|
|
|
|
switch (cast<ConstantSDNode>(TargetCC)->getZExtValue()) {
|
|
|
|
default:
|
|
|
|
Convert = false;
|
|
|
|
break;
|
|
|
|
case MSP430CC::COND_HS:
|
|
|
|
// Res = SRW & 1, no processing is required
|
|
|
|
break;
|
2010-01-15 21:18:18 +00:00
|
|
|
case MSP430CC::COND_LO:
|
2009-12-11 23:01:29 +00:00
|
|
|
// Res = ~(SRW & 1)
|
|
|
|
Invert = true;
|
|
|
|
break;
|
2010-01-15 21:18:18 +00:00
|
|
|
case MSP430CC::COND_NE:
|
2009-12-11 23:01:29 +00:00
|
|
|
if (andCC) {
|
|
|
|
// C = ~Z, thus Res = SRW & 1, no processing is required
|
|
|
|
} else {
|
|
|
|
// Res = (SRW >> 1) & 1
|
|
|
|
Shift = true;
|
|
|
|
}
|
|
|
|
break;
|
2010-01-15 21:18:18 +00:00
|
|
|
case MSP430CC::COND_E:
|
2009-12-11 23:01:29 +00:00
|
|
|
if (andCC) {
|
|
|
|
// C = ~Z, thus Res = ~(SRW & 1)
|
|
|
|
} else {
|
|
|
|
// Res = ~((SRW >> 1) & 1)
|
|
|
|
Shift = true;
|
|
|
|
}
|
|
|
|
Invert = true;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
EVT VT = Op.getValueType();
|
|
|
|
SDValue One = DAG.getConstant(1, VT);
|
|
|
|
if (Convert) {
|
|
|
|
SDValue SR = DAG.getCopyFromReg(DAG.getEntryNode(), dl, MSP430::SRW,
|
2010-01-15 21:18:18 +00:00
|
|
|
MVT::i16, Flag);
|
2009-12-11 23:01:29 +00:00
|
|
|
if (Shift)
|
|
|
|
// FIXME: somewhere this is turned into a SRL, lower it MSP specific?
|
|
|
|
SR = DAG.getNode(ISD::SRA, dl, MVT::i16, SR, One);
|
|
|
|
SR = DAG.getNode(ISD::AND, dl, MVT::i16, SR, One);
|
|
|
|
if (Invert)
|
|
|
|
SR = DAG.getNode(ISD::XOR, dl, MVT::i16, SR, One);
|
|
|
|
return SR;
|
|
|
|
} else {
|
|
|
|
SDValue Zero = DAG.getConstant(0, VT);
|
|
|
|
SDVTList VTs = DAG.getVTList(Op.getValueType(), MVT::Flag);
|
|
|
|
SmallVector<SDValue, 4> Ops;
|
|
|
|
Ops.push_back(One);
|
|
|
|
Ops.push_back(Zero);
|
|
|
|
Ops.push_back(TargetCC);
|
|
|
|
Ops.push_back(Flag);
|
|
|
|
return DAG.getNode(MSP430ISD::SELECT_CC, dl, VTs, &Ops[0], Ops.size());
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2009-05-03 13:19:09 +00:00
|
|
|
SDValue MSP430TargetLowering::LowerSELECT_CC(SDValue Op, SelectionDAG &DAG) {
|
|
|
|
SDValue LHS = Op.getOperand(0);
|
|
|
|
SDValue RHS = Op.getOperand(1);
|
|
|
|
SDValue TrueV = Op.getOperand(2);
|
|
|
|
SDValue FalseV = Op.getOperand(3);
|
|
|
|
ISD::CondCode CC = cast<CondCodeSDNode>(Op.getOperand(4))->get();
|
2009-05-03 13:12:23 +00:00
|
|
|
DebugLoc dl = Op.getDebugLoc();
|
2009-05-03 13:19:09 +00:00
|
|
|
|
2009-10-21 19:16:49 +00:00
|
|
|
SDValue TargetCC;
|
2009-05-03 13:19:09 +00:00
|
|
|
SDValue Flag = EmitCMP(LHS, RHS, TargetCC, CC, dl, DAG);
|
2009-05-03 13:12:23 +00:00
|
|
|
|
2009-08-11 20:47:22 +00:00
|
|
|
SDVTList VTs = DAG.getVTList(Op.getValueType(), MVT::Flag);
|
2009-05-03 13:12:23 +00:00
|
|
|
SmallVector<SDValue, 4> Ops;
|
|
|
|
Ops.push_back(TrueV);
|
|
|
|
Ops.push_back(FalseV);
|
2009-10-21 19:16:49 +00:00
|
|
|
Ops.push_back(TargetCC);
|
2009-05-03 13:19:09 +00:00
|
|
|
Ops.push_back(Flag);
|
2009-05-03 13:12:23 +00:00
|
|
|
|
2009-05-03 13:19:09 +00:00
|
|
|
return DAG.getNode(MSP430ISD::SELECT_CC, dl, VTs, &Ops[0], Ops.size());
|
2009-05-03 13:12:23 +00:00
|
|
|
}
|
|
|
|
|
2009-05-03 13:17:49 +00:00
|
|
|
SDValue MSP430TargetLowering::LowerSIGN_EXTEND(SDValue Op,
|
|
|
|
SelectionDAG &DAG) {
|
|
|
|
SDValue Val = Op.getOperand(0);
|
2009-08-10 22:56:29 +00:00
|
|
|
EVT VT = Op.getValueType();
|
2009-05-03 13:17:49 +00:00
|
|
|
DebugLoc dl = Op.getDebugLoc();
|
|
|
|
|
2009-08-11 20:47:22 +00:00
|
|
|
assert(VT == MVT::i16 && "Only support i16 for now!");
|
2009-05-03 13:17:49 +00:00
|
|
|
|
|
|
|
return DAG.getNode(ISD::SIGN_EXTEND_INREG, dl, VT,
|
|
|
|
DAG.getNode(ISD::ANY_EXTEND, dl, VT, Val),
|
|
|
|
DAG.getValueType(Val.getValueType()));
|
|
|
|
}
|
|
|
|
|
2009-12-07 02:28:10 +00:00
|
|
|
SDValue MSP430TargetLowering::getReturnAddressFrameIndex(SelectionDAG &DAG) {
|
|
|
|
MachineFunction &MF = DAG.getMachineFunction();
|
|
|
|
MSP430MachineFunctionInfo *FuncInfo = MF.getInfo<MSP430MachineFunctionInfo>();
|
|
|
|
int ReturnAddrIndex = FuncInfo->getRAIndex();
|
|
|
|
|
|
|
|
if (ReturnAddrIndex == 0) {
|
|
|
|
// Set up a frame object for the return address.
|
|
|
|
uint64_t SlotSize = TD->getPointerSize();
|
|
|
|
ReturnAddrIndex = MF.getFrameInfo()->CreateFixedObject(SlotSize, -SlotSize,
|
|
|
|
true, false);
|
|
|
|
FuncInfo->setRAIndex(ReturnAddrIndex);
|
|
|
|
}
|
|
|
|
|
|
|
|
return DAG.getFrameIndex(ReturnAddrIndex, getPointerTy());
|
|
|
|
}
|
|
|
|
|
|
|
|
SDValue MSP430TargetLowering::LowerRETURNADDR(SDValue Op, SelectionDAG &DAG) {
|
|
|
|
unsigned Depth = cast<ConstantSDNode>(Op.getOperand(0))->getZExtValue();
|
|
|
|
DebugLoc dl = Op.getDebugLoc();
|
|
|
|
|
|
|
|
if (Depth > 0) {
|
|
|
|
SDValue FrameAddr = LowerFRAMEADDR(Op, DAG);
|
|
|
|
SDValue Offset =
|
|
|
|
DAG.getConstant(TD->getPointerSize(), MVT::i16);
|
|
|
|
return DAG.getLoad(getPointerTy(), dl, DAG.getEntryNode(),
|
|
|
|
DAG.getNode(ISD::ADD, dl, getPointerTy(),
|
|
|
|
FrameAddr, Offset),
|
|
|
|
NULL, 0);
|
|
|
|
}
|
|
|
|
|
|
|
|
// Just load the return address.
|
|
|
|
SDValue RetAddrFI = getReturnAddressFrameIndex(DAG);
|
|
|
|
return DAG.getLoad(getPointerTy(), dl, DAG.getEntryNode(),
|
|
|
|
RetAddrFI, NULL, 0);
|
|
|
|
}
|
|
|
|
|
|
|
|
SDValue MSP430TargetLowering::LowerFRAMEADDR(SDValue Op, SelectionDAG &DAG) {
|
|
|
|
MachineFrameInfo *MFI = DAG.getMachineFunction().getFrameInfo();
|
|
|
|
MFI->setFrameAddressIsTaken(true);
|
|
|
|
EVT VT = Op.getValueType();
|
|
|
|
DebugLoc dl = Op.getDebugLoc(); // FIXME probably not meaningful
|
|
|
|
unsigned Depth = cast<ConstantSDNode>(Op.getOperand(0))->getZExtValue();
|
|
|
|
SDValue FrameAddr = DAG.getCopyFromReg(DAG.getEntryNode(), dl,
|
|
|
|
MSP430::FPW, VT);
|
|
|
|
while (Depth--)
|
|
|
|
FrameAddr = DAG.getLoad(VT, dl, DAG.getEntryNode(), FrameAddr, NULL, 0);
|
|
|
|
return FrameAddr;
|
|
|
|
}
|
|
|
|
|
2009-11-07 17:15:06 +00:00
|
|
|
/// getPostIndexedAddressParts - returns true by value, base pointer and
|
|
|
|
/// offset pointer and addressing mode by reference if this node can be
|
|
|
|
/// combined with a load / store to form a post-indexed load / store.
|
|
|
|
bool MSP430TargetLowering::getPostIndexedAddressParts(SDNode *N, SDNode *Op,
|
|
|
|
SDValue &Base,
|
|
|
|
SDValue &Offset,
|
|
|
|
ISD::MemIndexedMode &AM,
|
|
|
|
SelectionDAG &DAG) const {
|
|
|
|
|
|
|
|
LoadSDNode *LD = cast<LoadSDNode>(N);
|
|
|
|
if (LD->getExtensionType() != ISD::NON_EXTLOAD)
|
|
|
|
return false;
|
|
|
|
|
|
|
|
EVT VT = LD->getMemoryVT();
|
|
|
|
if (VT != MVT::i8 && VT != MVT::i16)
|
|
|
|
return false;
|
|
|
|
|
|
|
|
if (Op->getOpcode() != ISD::ADD)
|
|
|
|
return false;
|
|
|
|
|
|
|
|
if (ConstantSDNode *RHS = dyn_cast<ConstantSDNode>(Op->getOperand(1))) {
|
|
|
|
uint64_t RHSC = RHS->getZExtValue();
|
|
|
|
if ((VT == MVT::i16 && RHSC != 2) ||
|
|
|
|
(VT == MVT::i8 && RHSC != 1))
|
|
|
|
return false;
|
|
|
|
|
|
|
|
Base = Op->getOperand(0);
|
|
|
|
Offset = DAG.getConstant(RHSC, VT);
|
|
|
|
AM = ISD::POST_INC;
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2009-05-03 12:59:50 +00:00
|
|
|
const char *MSP430TargetLowering::getTargetNodeName(unsigned Opcode) const {
|
|
|
|
switch (Opcode) {
|
|
|
|
default: return NULL;
|
|
|
|
case MSP430ISD::RET_FLAG: return "MSP430ISD::RET_FLAG";
|
2009-12-07 02:28:41 +00:00
|
|
|
case MSP430ISD::RETI_FLAG: return "MSP430ISD::RETI_FLAG";
|
2009-05-03 13:03:33 +00:00
|
|
|
case MSP430ISD::RRA: return "MSP430ISD::RRA";
|
2009-05-03 13:16:17 +00:00
|
|
|
case MSP430ISD::RLA: return "MSP430ISD::RLA";
|
|
|
|
case MSP430ISD::RRC: return "MSP430ISD::RRC";
|
2009-05-03 13:07:54 +00:00
|
|
|
case MSP430ISD::CALL: return "MSP430ISD::CALL";
|
2009-05-03 13:08:33 +00:00
|
|
|
case MSP430ISD::Wrapper: return "MSP430ISD::Wrapper";
|
2009-05-03 13:19:09 +00:00
|
|
|
case MSP430ISD::BR_CC: return "MSP430ISD::BR_CC";
|
2009-05-03 13:12:06 +00:00
|
|
|
case MSP430ISD::CMP: return "MSP430ISD::CMP";
|
2009-05-03 13:19:09 +00:00
|
|
|
case MSP430ISD::SELECT_CC: return "MSP430ISD::SELECT_CC";
|
2009-12-12 18:55:37 +00:00
|
|
|
case MSP430ISD::SHL: return "MSP430ISD::SHL";
|
|
|
|
case MSP430ISD::SRA: return "MSP430ISD::SRA";
|
2009-05-03 12:59:50 +00:00
|
|
|
}
|
|
|
|
}
|
2009-05-03 13:12:23 +00:00
|
|
|
|
2010-01-15 21:19:43 +00:00
|
|
|
bool MSP430TargetLowering::isTruncateFree(const Type *Ty1,
|
|
|
|
const Type *Ty2) const {
|
|
|
|
if (!Ty1->isInteger() || !Ty2->isInteger())
|
|
|
|
return false;
|
|
|
|
|
|
|
|
return (Ty1->getPrimitiveSizeInBits() > Ty2->getPrimitiveSizeInBits());
|
|
|
|
}
|
|
|
|
|
|
|
|
bool MSP430TargetLowering::isTruncateFree(EVT VT1, EVT VT2) const {
|
|
|
|
if (!VT1.isInteger() || !VT2.isInteger())
|
|
|
|
return false;
|
|
|
|
|
|
|
|
return (VT1.getSizeInBits() > VT2.getSizeInBits());
|
|
|
|
}
|
|
|
|
|
|
|
|
bool MSP430TargetLowering::isZExtFree(const Type *Ty1, const Type *Ty2) const {
|
|
|
|
// MSP430 implicitly zero-extends 8-bit results in 16-bit registers.
|
|
|
|
return 0 && Ty1->isInteger(8) && Ty2->isInteger(16);
|
|
|
|
}
|
|
|
|
|
|
|
|
bool MSP430TargetLowering::isZExtFree(EVT VT1, EVT VT2) const {
|
|
|
|
// MSP430 implicitly zero-extends 8-bit results in 16-bit registers.
|
|
|
|
return 0 && VT1 == MVT::i8 && VT2 == MVT::i16;
|
|
|
|
}
|
|
|
|
|
2009-05-03 13:12:23 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// Other Lowering Code
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2009-12-12 18:55:37 +00:00
|
|
|
MachineBasicBlock*
|
|
|
|
MSP430TargetLowering::EmitShiftInstr(MachineInstr *MI,
|
|
|
|
MachineBasicBlock *BB,
|
|
|
|
DenseMap<MachineBasicBlock*, MachineBasicBlock*> *EM) const {
|
|
|
|
MachineFunction *F = BB->getParent();
|
|
|
|
MachineRegisterInfo &RI = F->getRegInfo();
|
|
|
|
DebugLoc dl = MI->getDebugLoc();
|
|
|
|
const TargetInstrInfo &TII = *getTargetMachine().getInstrInfo();
|
|
|
|
|
|
|
|
unsigned Opc;
|
|
|
|
const TargetRegisterClass * RC;
|
|
|
|
switch (MI->getOpcode()) {
|
|
|
|
default:
|
|
|
|
assert(0 && "Invalid shift opcode!");
|
|
|
|
case MSP430::Shl8:
|
|
|
|
Opc = MSP430::SHL8r1;
|
|
|
|
RC = MSP430::GR8RegisterClass;
|
|
|
|
break;
|
|
|
|
case MSP430::Shl16:
|
|
|
|
Opc = MSP430::SHL16r1;
|
|
|
|
RC = MSP430::GR16RegisterClass;
|
|
|
|
break;
|
|
|
|
case MSP430::Sra8:
|
|
|
|
Opc = MSP430::SAR8r1;
|
|
|
|
RC = MSP430::GR8RegisterClass;
|
|
|
|
break;
|
|
|
|
case MSP430::Sra16:
|
|
|
|
Opc = MSP430::SAR16r1;
|
|
|
|
RC = MSP430::GR16RegisterClass;
|
|
|
|
break;
|
|
|
|
case MSP430::Srl8:
|
|
|
|
Opc = MSP430::SAR8r1c;
|
|
|
|
RC = MSP430::GR8RegisterClass;
|
|
|
|
break;
|
|
|
|
case MSP430::Srl16:
|
|
|
|
Opc = MSP430::SAR16r1c;
|
|
|
|
RC = MSP430::GR16RegisterClass;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
const BasicBlock *LLVM_BB = BB->getBasicBlock();
|
|
|
|
MachineFunction::iterator I = BB;
|
|
|
|
++I;
|
|
|
|
|
|
|
|
// Create loop block
|
|
|
|
MachineBasicBlock *LoopBB = F->CreateMachineBasicBlock(LLVM_BB);
|
|
|
|
MachineBasicBlock *RemBB = F->CreateMachineBasicBlock(LLVM_BB);
|
|
|
|
|
|
|
|
F->insert(I, LoopBB);
|
|
|
|
F->insert(I, RemBB);
|
|
|
|
|
|
|
|
// Update machine-CFG edges by transferring all successors of the current
|
|
|
|
// block to the block containing instructions after shift.
|
|
|
|
RemBB->transferSuccessors(BB);
|
|
|
|
|
|
|
|
// Inform sdisel of the edge changes.
|
|
|
|
for (MachineBasicBlock::succ_iterator SI = BB->succ_begin(),
|
|
|
|
SE = BB->succ_end(); SI != SE; ++SI)
|
|
|
|
EM->insert(std::make_pair(*SI, RemBB));
|
|
|
|
|
|
|
|
// Add adges BB => LoopBB => RemBB, BB => RemBB, LoopBB => LoopBB
|
|
|
|
BB->addSuccessor(LoopBB);
|
|
|
|
BB->addSuccessor(RemBB);
|
|
|
|
LoopBB->addSuccessor(RemBB);
|
|
|
|
LoopBB->addSuccessor(LoopBB);
|
|
|
|
|
|
|
|
unsigned ShiftAmtReg = RI.createVirtualRegister(MSP430::GR8RegisterClass);
|
|
|
|
unsigned ShiftAmtReg2 = RI.createVirtualRegister(MSP430::GR8RegisterClass);
|
|
|
|
unsigned ShiftReg = RI.createVirtualRegister(RC);
|
|
|
|
unsigned ShiftReg2 = RI.createVirtualRegister(RC);
|
|
|
|
unsigned ShiftAmtSrcReg = MI->getOperand(2).getReg();
|
|
|
|
unsigned SrcReg = MI->getOperand(1).getReg();
|
|
|
|
unsigned DstReg = MI->getOperand(0).getReg();
|
|
|
|
|
|
|
|
// BB:
|
|
|
|
// cmp 0, N
|
|
|
|
// je RemBB
|
2010-01-15 01:29:49 +00:00
|
|
|
BuildMI(BB, dl, TII.get(MSP430::CMP8ri))
|
|
|
|
.addReg(ShiftAmtSrcReg).addImm(0);
|
2009-12-12 18:55:37 +00:00
|
|
|
BuildMI(BB, dl, TII.get(MSP430::JCC))
|
|
|
|
.addMBB(RemBB)
|
|
|
|
.addImm(MSP430CC::COND_E);
|
|
|
|
|
|
|
|
// LoopBB:
|
|
|
|
// ShiftReg = phi [%SrcReg, BB], [%ShiftReg2, LoopBB]
|
|
|
|
// ShiftAmt = phi [%N, BB], [%ShiftAmt2, LoopBB]
|
|
|
|
// ShiftReg2 = shift ShiftReg
|
|
|
|
// ShiftAmt2 = ShiftAmt - 1;
|
|
|
|
BuildMI(LoopBB, dl, TII.get(MSP430::PHI), ShiftReg)
|
|
|
|
.addReg(SrcReg).addMBB(BB)
|
|
|
|
.addReg(ShiftReg2).addMBB(LoopBB);
|
|
|
|
BuildMI(LoopBB, dl, TII.get(MSP430::PHI), ShiftAmtReg)
|
|
|
|
.addReg(ShiftAmtSrcReg).addMBB(BB)
|
|
|
|
.addReg(ShiftAmtReg2).addMBB(LoopBB);
|
|
|
|
BuildMI(LoopBB, dl, TII.get(Opc), ShiftReg2)
|
|
|
|
.addReg(ShiftReg);
|
|
|
|
BuildMI(LoopBB, dl, TII.get(MSP430::SUB8ri), ShiftAmtReg2)
|
|
|
|
.addReg(ShiftAmtReg).addImm(1);
|
|
|
|
BuildMI(LoopBB, dl, TII.get(MSP430::JCC))
|
|
|
|
.addMBB(LoopBB)
|
|
|
|
.addImm(MSP430CC::COND_NE);
|
|
|
|
|
|
|
|
// RemBB:
|
|
|
|
// DestReg = phi [%SrcReg, BB], [%ShiftReg, LoopBB]
|
|
|
|
BuildMI(RemBB, dl, TII.get(MSP430::PHI), DstReg)
|
|
|
|
.addReg(SrcReg).addMBB(BB)
|
|
|
|
.addReg(ShiftReg2).addMBB(LoopBB);
|
|
|
|
|
2010-01-14 22:09:11 +00:00
|
|
|
F->DeleteMachineInstr(MI); // The pseudo instruction is gone now.
|
2009-12-12 18:55:37 +00:00
|
|
|
return RemBB;
|
|
|
|
}
|
|
|
|
|
2009-05-03 13:12:23 +00:00
|
|
|
MachineBasicBlock*
|
|
|
|
MSP430TargetLowering::EmitInstrWithCustomInserter(MachineInstr *MI,
|
2009-09-18 21:02:19 +00:00
|
|
|
MachineBasicBlock *BB,
|
|
|
|
DenseMap<MachineBasicBlock*, MachineBasicBlock*> *EM) const {
|
2009-12-12 18:55:37 +00:00
|
|
|
unsigned Opc = MI->getOpcode();
|
|
|
|
|
|
|
|
if (Opc == MSP430::Shl8 || Opc == MSP430::Shl16 ||
|
|
|
|
Opc == MSP430::Sra8 || Opc == MSP430::Sra16 ||
|
|
|
|
Opc == MSP430::Srl8 || Opc == MSP430::Srl16)
|
|
|
|
return EmitShiftInstr(MI, BB, EM);
|
|
|
|
|
2009-05-03 13:12:23 +00:00
|
|
|
const TargetInstrInfo &TII = *getTargetMachine().getInstrInfo();
|
|
|
|
DebugLoc dl = MI->getDebugLoc();
|
2009-12-12 18:55:37 +00:00
|
|
|
|
|
|
|
assert((Opc == MSP430::Select16 || Opc == MSP430::Select8) &&
|
2009-05-03 13:12:23 +00:00
|
|
|
"Unexpected instr type to insert");
|
|
|
|
|
|
|
|
// To "insert" a SELECT instruction, we actually have to insert the diamond
|
|
|
|
// control-flow pattern. The incoming instruction knows the destination vreg
|
|
|
|
// to set, the condition code register to branch on, the true/false values to
|
|
|
|
// select between, and a branch opcode to use.
|
|
|
|
const BasicBlock *LLVM_BB = BB->getBasicBlock();
|
|
|
|
MachineFunction::iterator I = BB;
|
|
|
|
++I;
|
|
|
|
|
|
|
|
// thisMBB:
|
|
|
|
// ...
|
|
|
|
// TrueVal = ...
|
|
|
|
// cmpTY ccX, r1, r2
|
|
|
|
// jCC copy1MBB
|
|
|
|
// fallthrough --> copy0MBB
|
|
|
|
MachineBasicBlock *thisMBB = BB;
|
|
|
|
MachineFunction *F = BB->getParent();
|
|
|
|
MachineBasicBlock *copy0MBB = F->CreateMachineBasicBlock(LLVM_BB);
|
|
|
|
MachineBasicBlock *copy1MBB = F->CreateMachineBasicBlock(LLVM_BB);
|
|
|
|
BuildMI(BB, dl, TII.get(MSP430::JCC))
|
|
|
|
.addMBB(copy1MBB)
|
|
|
|
.addImm(MI->getOperand(3).getImm());
|
|
|
|
F->insert(I, copy0MBB);
|
|
|
|
F->insert(I, copy1MBB);
|
2009-09-19 09:51:03 +00:00
|
|
|
// Inform sdisel of the edge changes.
|
|
|
|
for (MachineBasicBlock::succ_iterator SI = BB->succ_begin(),
|
|
|
|
SE = BB->succ_end(); SI != SE; ++SI)
|
|
|
|
EM->insert(std::make_pair(*SI, copy1MBB));
|
2009-05-03 13:12:23 +00:00
|
|
|
// Update machine-CFG edges by transferring all successors of the current
|
|
|
|
// block to the new block which will contain the Phi node for the select.
|
|
|
|
copy1MBB->transferSuccessors(BB);
|
|
|
|
// Next, add the true and fallthrough blocks as its successors.
|
|
|
|
BB->addSuccessor(copy0MBB);
|
|
|
|
BB->addSuccessor(copy1MBB);
|
|
|
|
|
|
|
|
// copy0MBB:
|
|
|
|
// %FalseValue = ...
|
|
|
|
// # fallthrough to copy1MBB
|
|
|
|
BB = copy0MBB;
|
|
|
|
|
|
|
|
// Update machine-CFG edges
|
|
|
|
BB->addSuccessor(copy1MBB);
|
|
|
|
|
|
|
|
// copy1MBB:
|
|
|
|
// %Result = phi [ %FalseValue, copy0MBB ], [ %TrueValue, thisMBB ]
|
|
|
|
// ...
|
|
|
|
BB = copy1MBB;
|
|
|
|
BuildMI(BB, dl, TII.get(MSP430::PHI),
|
|
|
|
MI->getOperand(0).getReg())
|
|
|
|
.addReg(MI->getOperand(2).getReg()).addMBB(copy0MBB)
|
|
|
|
.addReg(MI->getOperand(1).getReg()).addMBB(thisMBB);
|
|
|
|
|
|
|
|
F->DeleteMachineInstr(MI); // The pseudo instruction is gone now.
|
|
|
|
return BB;
|
|
|
|
}
|