2009-03-31 16:51:18 +00:00
|
|
|
//===-- CallingConvLower.cpp - Calling Conventions ------------------------===//
|
2007-02-27 04:43:02 +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-02-27 04:43:02 +00:00
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
//
|
|
|
|
// This file implements the CCState class, used for lowering and implementing
|
|
|
|
// calling conventions.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
|
|
|
#include "llvm/CodeGen/CallingConvLower.h"
|
2010-01-05 01:24:50 +00:00
|
|
|
#include "llvm/Support/Debug.h"
|
2009-07-11 13:10:19 +00:00
|
|
|
#include "llvm/Support/ErrorHandling.h"
|
|
|
|
#include "llvm/Support/raw_ostream.h"
|
2008-02-10 18:45:23 +00:00
|
|
|
#include "llvm/Target/TargetRegisterInfo.h"
|
2008-01-15 03:14:05 +00:00
|
|
|
#include "llvm/Target/TargetData.h"
|
2007-02-27 05:13:54 +00:00
|
|
|
#include "llvm/Target/TargetMachine.h"
|
2007-02-27 04:43:02 +00:00
|
|
|
using namespace llvm;
|
|
|
|
|
2009-09-02 08:44:58 +00:00
|
|
|
CCState::CCState(CallingConv::ID CC, bool isVarArg, const TargetMachine &tm,
|
2009-07-22 00:24:57 +00:00
|
|
|
SmallVector<CCValAssign, 16> &locs, LLVMContext &C)
|
2007-06-19 00:11:09 +00:00
|
|
|
: CallingConv(CC), IsVarArg(isVarArg), TM(tm),
|
2009-07-09 17:57:24 +00:00
|
|
|
TRI(*TM.getRegisterInfo()), Locs(locs), Context(C) {
|
2007-02-27 04:43:02 +00:00
|
|
|
// No stack is used.
|
|
|
|
StackOffset = 0;
|
|
|
|
|
2008-06-30 20:25:31 +00:00
|
|
|
UsedRegs.resize((TRI.getNumRegs()+31)/32);
|
2007-02-27 04:43:02 +00:00
|
|
|
}
|
|
|
|
|
2008-01-15 07:49:36 +00:00
|
|
|
// HandleByVal - Allocate a stack slot large enough to pass an argument by
|
|
|
|
// value. The size and alignment information of the argument is encoded in its
|
|
|
|
// parameter attribute.
|
2009-08-10 22:56:29 +00:00
|
|
|
void CCState::HandleByVal(unsigned ValNo, EVT ValVT,
|
|
|
|
EVT LocVT, CCValAssign::LocInfo LocInfo,
|
2008-01-15 07:49:36 +00:00
|
|
|
int MinSize, int MinAlign,
|
2008-03-21 09:14:45 +00:00
|
|
|
ISD::ArgFlagsTy ArgFlags) {
|
|
|
|
unsigned Align = ArgFlags.getByValAlign();
|
|
|
|
unsigned Size = ArgFlags.getByValSize();
|
2008-01-15 07:49:36 +00:00
|
|
|
if (MinSize > (int)Size)
|
|
|
|
Size = MinSize;
|
|
|
|
if (MinAlign > (int)Align)
|
|
|
|
Align = MinAlign;
|
|
|
|
unsigned Offset = AllocateStack(Size, Align);
|
2007-08-10 14:44:42 +00:00
|
|
|
|
|
|
|
addLoc(CCValAssign::getMem(ValNo, ValVT, Offset, LocVT, LocInfo));
|
|
|
|
}
|
2007-02-27 04:43:02 +00:00
|
|
|
|
|
|
|
/// MarkAllocated - Mark a register and all of its aliases as allocated.
|
|
|
|
void CCState::MarkAllocated(unsigned Reg) {
|
|
|
|
UsedRegs[Reg/32] |= 1 << (Reg&31);
|
|
|
|
|
2008-02-10 18:45:23 +00:00
|
|
|
if (const unsigned *RegAliases = TRI.getAliasSet(Reg))
|
2007-02-27 04:43:02 +00:00
|
|
|
for (; (Reg = *RegAliases); ++RegAliases)
|
|
|
|
UsedRegs[Reg/32] |= 1 << (Reg&31);
|
|
|
|
}
|
2007-02-28 06:56:37 +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.
llvm-svn: 78142
2009-08-05 01:29:28 +00:00
|
|
|
/// AnalyzeFormalArguments - Analyze an array of argument values,
|
2007-02-28 07:09:40 +00:00
|
|
|
/// incorporating info about the formals into this state.
|
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.
llvm-svn: 78142
2009-08-05 01:29:28 +00:00
|
|
|
void
|
|
|
|
CCState::AnalyzeFormalArguments(const SmallVectorImpl<ISD::InputArg> &Ins,
|
|
|
|
CCAssignFn Fn) {
|
|
|
|
unsigned NumArgs = Ins.size();
|
|
|
|
|
2007-02-28 07:09:40 +00:00
|
|
|
for (unsigned i = 0; i != NumArgs; ++i) {
|
2009-08-10 22:56:29 +00:00
|
|
|
EVT ArgVT = Ins[i].VT;
|
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.
llvm-svn: 78142
2009-08-05 01:29:28 +00:00
|
|
|
ISD::ArgFlagsTy ArgFlags = Ins[i].Flags;
|
2007-02-28 07:09:40 +00:00
|
|
|
if (Fn(i, ArgVT, ArgVT, CCValAssign::Full, ArgFlags, *this)) {
|
2009-07-14 16:55:14 +00:00
|
|
|
#ifndef NDEBUG
|
2010-01-05 01:24:50 +00:00
|
|
|
dbgs() << "Formal argument #" << i << " has unhandled type "
|
2009-08-23 06:03:38 +00:00
|
|
|
<< ArgVT.getEVTString();
|
2009-07-14 16:55:14 +00:00
|
|
|
#endif
|
|
|
|
llvm_unreachable(0);
|
2007-02-28 07:09:40 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2009-11-07 02:11:54 +00:00
|
|
|
/// CheckReturn - Analyze the return values of a function, returning true if
|
|
|
|
/// the return can be performed without sret-demotion, and false otherwise.
|
2010-07-10 09:00:22 +00:00
|
|
|
bool CCState::CheckReturn(const SmallVectorImpl<ISD::OutputArg> &Outs,
|
2009-11-07 02:11:54 +00:00
|
|
|
CCAssignFn Fn) {
|
|
|
|
// Determine which register each value should be copied into.
|
2010-07-10 09:00:22 +00:00
|
|
|
for (unsigned i = 0, e = Outs.size(); i != e; ++i) {
|
|
|
|
EVT VT = Outs[i].VT;
|
|
|
|
ISD::ArgFlagsTy ArgFlags = Outs[i].Flags;
|
2009-11-07 02:11:54 +00:00
|
|
|
if (Fn(i, VT, VT, CCValAssign::Full, ArgFlags, *this))
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
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.
llvm-svn: 78142
2009-08-05 01:29:28 +00:00
|
|
|
/// AnalyzeReturn - Analyze the returned values of a return,
|
2007-02-28 07:09:40 +00:00
|
|
|
/// incorporating info about the result values into this state.
|
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.
llvm-svn: 78142
2009-08-05 01:29:28 +00:00
|
|
|
void CCState::AnalyzeReturn(const SmallVectorImpl<ISD::OutputArg> &Outs,
|
|
|
|
CCAssignFn Fn) {
|
2007-02-28 07:09:40 +00:00
|
|
|
// Determine which register each value should be copied into.
|
2010-07-06 15:39:54 +00:00
|
|
|
for (unsigned i = 0, e = Outs.size(); i != e; ++i) {
|
|
|
|
EVT VT = Outs[i].VT;
|
|
|
|
ISD::ArgFlagsTy ArgFlags = Outs[i].Flags;
|
|
|
|
if (Fn(i, VT, VT, CCValAssign::Full, ArgFlags, *this)) {
|
|
|
|
#ifndef NDEBUG
|
|
|
|
dbgs() << "Return operand #" << i << " has unhandled type "
|
|
|
|
<< VT.getEVTString();
|
|
|
|
#endif
|
|
|
|
llvm_unreachable(0);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
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.
llvm-svn: 78142
2009-08-05 01:29:28 +00:00
|
|
|
/// AnalyzeCallOperands - Analyze the outgoing arguments to a call,
|
|
|
|
/// incorporating info about the passed values into this state.
|
|
|
|
void CCState::AnalyzeCallOperands(const SmallVectorImpl<ISD::OutputArg> &Outs,
|
|
|
|
CCAssignFn Fn) {
|
|
|
|
unsigned NumOps = Outs.size();
|
2010-07-06 15:39:54 +00:00
|
|
|
for (unsigned i = 0; i != NumOps; ++i) {
|
|
|
|
EVT ArgVT = Outs[i].VT;
|
|
|
|
ISD::ArgFlagsTy ArgFlags = Outs[i].Flags;
|
|
|
|
if (Fn(i, ArgVT, ArgVT, CCValAssign::Full, ArgFlags, *this)) {
|
|
|
|
#ifndef NDEBUG
|
|
|
|
dbgs() << "Call operand #" << i << " has unhandled type "
|
|
|
|
<< ArgVT.getEVTString();
|
|
|
|
#endif
|
|
|
|
llvm_unreachable(0);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2008-09-05 16:59:26 +00:00
|
|
|
/// AnalyzeCallOperands - Same as above except it takes vectors of types
|
|
|
|
/// and argument flags.
|
2009-08-10 22:56:29 +00:00
|
|
|
void CCState::AnalyzeCallOperands(SmallVectorImpl<EVT> &ArgVTs,
|
2008-09-05 16:59:26 +00:00
|
|
|
SmallVectorImpl<ISD::ArgFlagsTy> &Flags,
|
|
|
|
CCAssignFn Fn) {
|
|
|
|
unsigned NumOps = ArgVTs.size();
|
|
|
|
for (unsigned i = 0; i != NumOps; ++i) {
|
2009-08-10 22:56:29 +00:00
|
|
|
EVT ArgVT = ArgVTs[i];
|
2008-09-05 16:59:26 +00:00
|
|
|
ISD::ArgFlagsTy ArgFlags = Flags[i];
|
|
|
|
if (Fn(i, ArgVT, ArgVT, CCValAssign::Full, ArgFlags, *this)) {
|
2009-07-14 16:55:14 +00:00
|
|
|
#ifndef NDEBUG
|
2010-01-05 01:24:50 +00:00
|
|
|
dbgs() << "Call operand #" << i << " has unhandled type "
|
2009-08-23 06:03:38 +00:00
|
|
|
<< ArgVT.getEVTString();
|
2009-07-14 16:55:14 +00:00
|
|
|
#endif
|
|
|
|
llvm_unreachable(0);
|
2008-09-05 16:59:26 +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.
llvm-svn: 78142
2009-08-05 01:29:28 +00:00
|
|
|
/// AnalyzeCallResult - Analyze the return values of a call,
|
2007-02-28 07:09:40 +00:00
|
|
|
/// incorporating info about the passed values into this state.
|
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.
llvm-svn: 78142
2009-08-05 01:29:28 +00:00
|
|
|
void CCState::AnalyzeCallResult(const SmallVectorImpl<ISD::InputArg> &Ins,
|
|
|
|
CCAssignFn Fn) {
|
|
|
|
for (unsigned i = 0, e = Ins.size(); i != e; ++i) {
|
2009-08-10 22:56:29 +00:00
|
|
|
EVT VT = Ins[i].VT;
|
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.
llvm-svn: 78142
2009-08-05 01:29:28 +00:00
|
|
|
ISD::ArgFlagsTy Flags = Ins[i].Flags;
|
2008-09-26 19:31:26 +00:00
|
|
|
if (Fn(i, VT, VT, CCValAssign::Full, Flags, *this)) {
|
2009-07-14 16:55:14 +00:00
|
|
|
#ifndef NDEBUG
|
2010-01-05 01:24:50 +00:00
|
|
|
dbgs() << "Call result #" << i << " has unhandled type "
|
2009-08-23 06:03:38 +00:00
|
|
|
<< VT.getEVTString();
|
2009-07-14 16:55:14 +00:00
|
|
|
#endif
|
|
|
|
llvm_unreachable(0);
|
2007-02-28 06:56:37 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2008-09-07 09:02:18 +00:00
|
|
|
|
|
|
|
/// AnalyzeCallResult - Same as above except it's specialized for calls which
|
|
|
|
/// produce a single value.
|
2009-08-10 22:56:29 +00:00
|
|
|
void CCState::AnalyzeCallResult(EVT VT, CCAssignFn Fn) {
|
2008-09-07 09:02:18 +00:00
|
|
|
if (Fn(0, VT, VT, CCValAssign::Full, ISD::ArgFlagsTy(), *this)) {
|
2009-07-14 16:55:14 +00:00
|
|
|
#ifndef NDEBUG
|
2010-01-05 01:24:50 +00:00
|
|
|
dbgs() << "Call result has unhandled type "
|
2009-08-23 06:03:38 +00:00
|
|
|
<< VT.getEVTString();
|
2009-07-14 16:55:14 +00:00
|
|
|
#endif
|
|
|
|
llvm_unreachable(0);
|
2008-09-07 09:02:18 +00:00
|
|
|
}
|
|
|
|
}
|