2007-02-27 04:43:02 +00:00
|
|
|
//===-- llvm/CallingConvLower.h - Calling Conventions -----------*- C++ -*-===//
|
|
|
|
//
|
|
|
|
// The LLVM Compiler Infrastructure
|
|
|
|
//
|
2007-12-29 19:59:42 +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 declares the CCState and CCValAssign classes, used for lowering
|
|
|
|
// and implementing calling conventions.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
|
|
|
#ifndef LLVM_CODEGEN_CALLINGCONVLOWER_H
|
|
|
|
#define LLVM_CODEGEN_CALLINGCONVLOWER_H
|
|
|
|
|
|
|
|
#include "llvm/ADT/SmallVector.h"
|
2012-10-01 16:44:04 +00:00
|
|
|
#include "llvm/CodeGen/MachineFrameInfo.h"
|
2012-12-03 17:02:12 +00:00
|
|
|
#include "llvm/CodeGen/MachineFunction.h"
|
2013-01-02 11:36:10 +00:00
|
|
|
#include "llvm/IR/CallingConv.h"
|
2010-07-07 15:28:42 +00:00
|
|
|
#include "llvm/Target/TargetCallingConv.h"
|
2007-02-27 04:43:02 +00:00
|
|
|
|
|
|
|
namespace llvm {
|
2014-03-12 08:00:24 +00:00
|
|
|
class CCState;
|
|
|
|
class MVT;
|
|
|
|
class TargetMachine;
|
|
|
|
class TargetRegisterInfo;
|
2007-02-28 06:56:37 +00:00
|
|
|
|
2007-02-27 04:43:02 +00:00
|
|
|
/// CCValAssign - Represent assignment of one arg/retval to a location.
|
|
|
|
class CCValAssign {
|
|
|
|
public:
|
|
|
|
enum LocInfo {
|
|
|
|
Full, // The value fills the full location.
|
|
|
|
SExt, // The value is sign extended in the location.
|
|
|
|
ZExt, // The value is zero extended in the location.
|
2009-04-17 19:07:39 +00:00
|
|
|
AExt, // The value is extended with undefined upper bits.
|
2009-08-03 08:13:56 +00:00
|
|
|
BCvt, // The value is bit-converted in the location.
|
2010-07-06 15:35:06 +00:00
|
|
|
VExt, // The value is vector-widened in the location.
|
|
|
|
// FIXME: Not implemented yet. Code that uses AExt to mean
|
|
|
|
// vector-widen should be fixed to use VExt instead.
|
2014-01-14 19:56:36 +00:00
|
|
|
FPExt, // The floating-point value is fp-extended in the location.
|
2009-08-03 08:13:56 +00:00
|
|
|
Indirect // The location contains pointer to the value.
|
2007-02-27 04:43:02 +00:00
|
|
|
// TODO: a subset of the value is in the location.
|
|
|
|
};
|
|
|
|
private:
|
|
|
|
/// ValNo - This is the value number begin assigned (e.g. an argument number).
|
|
|
|
unsigned ValNo;
|
2009-08-03 08:13:56 +00:00
|
|
|
|
2007-02-27 04:43:02 +00:00
|
|
|
/// Loc is either a stack offset or a register number.
|
|
|
|
unsigned Loc;
|
2009-08-03 08:13:56 +00:00
|
|
|
|
2007-02-27 04:43:02 +00:00
|
|
|
/// isMem - True if this is a memory loc, false if it is a register loc.
|
2013-01-07 11:13:51 +00:00
|
|
|
unsigned isMem : 1;
|
2009-08-03 08:13:56 +00:00
|
|
|
|
2009-04-17 20:35:10 +00:00
|
|
|
/// isCustom - True if this arg/retval requires special handling.
|
2013-01-07 11:13:51 +00:00
|
|
|
unsigned isCustom : 1;
|
2009-04-17 20:35:10 +00:00
|
|
|
|
2007-02-27 04:43:02 +00:00
|
|
|
/// Information about how the value is assigned.
|
2009-04-17 19:07:39 +00:00
|
|
|
LocInfo HTP : 6;
|
2009-08-03 08:13:56 +00:00
|
|
|
|
2007-02-27 04:43:02 +00:00
|
|
|
/// ValVT - The type of the value being assigned.
|
2010-11-04 10:49:57 +00:00
|
|
|
MVT ValVT;
|
2007-02-27 04:43:02 +00:00
|
|
|
|
|
|
|
/// LocVT - The type of the location being assigned to.
|
2010-11-03 11:35:31 +00:00
|
|
|
MVT LocVT;
|
2007-02-27 04:43:02 +00:00
|
|
|
public:
|
2009-08-03 08:13:56 +00:00
|
|
|
|
2010-11-04 10:49:57 +00:00
|
|
|
static CCValAssign getReg(unsigned ValNo, MVT ValVT,
|
2010-11-03 11:35:31 +00:00
|
|
|
unsigned RegNo, MVT LocVT,
|
2007-02-27 04:43:02 +00:00
|
|
|
LocInfo HTP) {
|
|
|
|
CCValAssign Ret;
|
|
|
|
Ret.ValNo = ValNo;
|
|
|
|
Ret.Loc = RegNo;
|
|
|
|
Ret.isMem = false;
|
2009-04-17 19:07:39 +00:00
|
|
|
Ret.isCustom = false;
|
2007-02-27 04:43:02 +00:00
|
|
|
Ret.HTP = HTP;
|
|
|
|
Ret.ValVT = ValVT;
|
|
|
|
Ret.LocVT = LocVT;
|
|
|
|
return Ret;
|
|
|
|
}
|
2009-04-17 20:35:10 +00:00
|
|
|
|
2010-11-04 10:49:57 +00:00
|
|
|
static CCValAssign getCustomReg(unsigned ValNo, MVT ValVT,
|
2010-11-03 11:35:31 +00:00
|
|
|
unsigned RegNo, MVT LocVT,
|
2009-04-17 19:07:39 +00:00
|
|
|
LocInfo HTP) {
|
|
|
|
CCValAssign Ret;
|
|
|
|
Ret = getReg(ValNo, ValVT, RegNo, LocVT, HTP);
|
|
|
|
Ret.isCustom = true;
|
|
|
|
return Ret;
|
|
|
|
}
|
|
|
|
|
2010-11-04 10:49:57 +00:00
|
|
|
static CCValAssign getMem(unsigned ValNo, MVT ValVT,
|
2010-11-03 11:35:31 +00:00
|
|
|
unsigned Offset, MVT LocVT,
|
2007-02-27 04:43:02 +00:00
|
|
|
LocInfo HTP) {
|
|
|
|
CCValAssign Ret;
|
|
|
|
Ret.ValNo = ValNo;
|
|
|
|
Ret.Loc = Offset;
|
|
|
|
Ret.isMem = true;
|
2009-04-17 19:07:39 +00:00
|
|
|
Ret.isCustom = false;
|
2007-02-27 04:43:02 +00:00
|
|
|
Ret.HTP = HTP;
|
|
|
|
Ret.ValVT = ValVT;
|
|
|
|
Ret.LocVT = LocVT;
|
|
|
|
return Ret;
|
|
|
|
}
|
2009-08-03 08:13:56 +00:00
|
|
|
|
2010-11-04 10:49:57 +00:00
|
|
|
static CCValAssign getCustomMem(unsigned ValNo, MVT ValVT,
|
2010-11-03 11:35:31 +00:00
|
|
|
unsigned Offset, MVT LocVT,
|
2009-04-17 19:07:39 +00:00
|
|
|
LocInfo HTP) {
|
|
|
|
CCValAssign Ret;
|
|
|
|
Ret = getMem(ValNo, ValVT, Offset, LocVT, HTP);
|
|
|
|
Ret.isCustom = true;
|
|
|
|
return Ret;
|
|
|
|
}
|
2009-04-17 20:35:10 +00:00
|
|
|
|
2007-02-27 04:43:02 +00:00
|
|
|
unsigned getValNo() const { return ValNo; }
|
2010-11-04 10:49:57 +00:00
|
|
|
MVT getValVT() const { return ValVT; }
|
2007-02-27 04:43:02 +00:00
|
|
|
|
|
|
|
bool isRegLoc() const { return !isMem; }
|
|
|
|
bool isMemLoc() const { return isMem; }
|
2009-08-03 08:13:56 +00:00
|
|
|
|
2009-04-17 19:07:39 +00:00
|
|
|
bool needsCustom() const { return isCustom; }
|
2009-04-17 20:35:10 +00:00
|
|
|
|
2007-02-27 04:43:02 +00:00
|
|
|
unsigned getLocReg() const { assert(isRegLoc()); return Loc; }
|
|
|
|
unsigned getLocMemOffset() const { assert(isMemLoc()); return Loc; }
|
2010-11-03 11:35:31 +00:00
|
|
|
MVT getLocVT() const { return LocVT; }
|
2009-08-03 08:13:56 +00:00
|
|
|
|
2007-02-27 04:43:02 +00:00
|
|
|
LocInfo getLocInfo() const { return HTP; }
|
2009-08-03 08:13:56 +00:00
|
|
|
bool isExtInLoc() const {
|
|
|
|
return (HTP == AExt || HTP == SExt || HTP == ZExt);
|
|
|
|
}
|
|
|
|
|
2007-02-27 04:43:02 +00:00
|
|
|
};
|
|
|
|
|
2007-02-28 06:56:37 +00:00
|
|
|
/// CCAssignFn - This function assigns a location for Val, updating State to
|
2010-10-31 10:29:14 +00:00
|
|
|
/// reflect the change. It returns 'true' if it failed to handle Val.
|
2010-11-04 10:49:57 +00:00
|
|
|
typedef bool CCAssignFn(unsigned ValNo, MVT ValVT,
|
2010-11-03 11:35:31 +00:00
|
|
|
MVT LocVT, CCValAssign::LocInfo LocInfo,
|
2008-03-21 09:14:45 +00:00
|
|
|
ISD::ArgFlagsTy ArgFlags, CCState &State);
|
2007-02-28 06:56:37 +00:00
|
|
|
|
2009-04-17 19:07:39 +00:00
|
|
|
/// CCCustomFn - This function assigns a location for Val, possibly updating
|
|
|
|
/// all args to reflect changes and indicates if it handled it. It must set
|
|
|
|
/// isCustom if it handles the arg and returns true.
|
2010-11-04 10:49:57 +00:00
|
|
|
typedef bool CCCustomFn(unsigned &ValNo, MVT &ValVT,
|
2010-11-03 11:35:31 +00:00
|
|
|
MVT &LocVT, CCValAssign::LocInfo &LocInfo,
|
2009-04-17 19:07:39 +00:00
|
|
|
ISD::ArgFlagsTy &ArgFlags, CCState &State);
|
|
|
|
|
2011-06-10 20:37:36 +00:00
|
|
|
/// ParmContext - This enum tracks whether calling convention lowering is in
|
|
|
|
/// the context of prologue or call generation. Not all backends make use of
|
|
|
|
/// this information.
|
|
|
|
typedef enum { Unknown, Prologue, Call } ParmContext;
|
2011-04-20 16:47:52 +00:00
|
|
|
|
2007-02-27 05:13:54 +00:00
|
|
|
/// CCState - This class holds information needed while lowering arguments and
|
|
|
|
/// return values. It captures which registers are already assigned and which
|
|
|
|
/// stack slots are used. It provides accessors to allocate these values.
|
|
|
|
class CCState {
|
2011-06-10 20:59:24 +00:00
|
|
|
private:
|
2009-09-02 08:44:58 +00:00
|
|
|
CallingConv::ID CallingConv;
|
2007-06-19 00:10:25 +00:00
|
|
|
bool IsVarArg;
|
2011-06-08 23:55:35 +00:00
|
|
|
MachineFunction &MF;
|
2007-02-27 05:13:54 +00:00
|
|
|
const TargetMachine &TM;
|
2008-02-10 18:45:23 +00:00
|
|
|
const TargetRegisterInfo &TRI;
|
2013-07-14 04:42:23 +00:00
|
|
|
SmallVectorImpl<CCValAssign> &Locs;
|
2009-07-22 00:24:57 +00:00
|
|
|
LLVMContext &Context;
|
2009-08-03 08:13:56 +00:00
|
|
|
|
2007-02-27 05:13:54 +00:00
|
|
|
unsigned StackOffset;
|
|
|
|
SmallVector<uint32_t, 16> UsedRegs;
|
2013-05-05 07:48:36 +00:00
|
|
|
|
|
|
|
// ByValInfo and SmallVector<ByValInfo, 4> ByValRegs:
|
|
|
|
//
|
|
|
|
// Vector of ByValInfo instances (ByValRegs) is introduced for byval registers
|
|
|
|
// tracking.
|
|
|
|
// Or, in another words it tracks byval parameters that are stored in
|
|
|
|
// general purpose registers.
|
|
|
|
//
|
|
|
|
// For 4 byte stack alignment,
|
|
|
|
// instance index means byval parameter number in formal
|
|
|
|
// arguments set. Assume, we have some "struct_type" with size = 4 bytes,
|
|
|
|
// then, for function "foo":
|
|
|
|
//
|
|
|
|
// i32 foo(i32 %p, %struct_type* %r, i32 %s, %struct_type* %t)
|
|
|
|
//
|
|
|
|
// ByValRegs[0] describes how "%r" is stored (Begin == r1, End == r2)
|
|
|
|
// ByValRegs[1] describes how "%t" is stored (Begin == r3, End == r4).
|
|
|
|
//
|
|
|
|
// In case of 8 bytes stack alignment,
|
|
|
|
// ByValRegs may also contain information about wasted registers.
|
|
|
|
// In function shown above, r3 would be wasted according to AAPCS rules.
|
|
|
|
// And in that case ByValRegs[1].Waste would be "true".
|
|
|
|
// ByValRegs vector size still would be 2,
|
|
|
|
// while "%t" goes to the stack: it wouldn't be described in ByValRegs.
|
|
|
|
//
|
|
|
|
// Supposed use-case for this collection:
|
|
|
|
// 1. Initially ByValRegs is empty, InRegsParamsProceed is 0.
|
|
|
|
// 2. HandleByVal fillups ByValRegs.
|
|
|
|
// 3. Argument analysis (LowerFormatArguments, for example). After
|
|
|
|
// some byval argument was analyzed, InRegsParamsProceed is increased.
|
|
|
|
struct ByValInfo {
|
|
|
|
ByValInfo(unsigned B, unsigned E, bool IsWaste = false) :
|
|
|
|
Begin(B), End(E), Waste(IsWaste) {}
|
|
|
|
// First register allocated for current parameter.
|
|
|
|
unsigned Begin;
|
|
|
|
|
|
|
|
// First after last register allocated for current parameter.
|
|
|
|
unsigned End;
|
|
|
|
|
|
|
|
// Means that current range of registers doesn't belong to any
|
|
|
|
// parameters. It was wasted due to stack alignment rules.
|
|
|
|
// For more information see:
|
|
|
|
// AAPCS, 5.5 Parameter Passing, Stage C, C.3.
|
|
|
|
bool Waste;
|
|
|
|
};
|
|
|
|
SmallVector<ByValInfo, 4 > ByValRegs;
|
|
|
|
|
|
|
|
// InRegsParamsProceed - shows how many instances of ByValRegs was proceed
|
|
|
|
// during argument analysis.
|
|
|
|
unsigned InRegsParamsProceed;
|
2011-06-10 20:59:24 +00:00
|
|
|
|
|
|
|
protected:
|
2011-04-20 16:47:52 +00:00
|
|
|
ParmContext CallOrPrologue;
|
2011-06-10 20:59:24 +00:00
|
|
|
|
2007-02-27 05:13:54 +00:00
|
|
|
public:
|
2011-06-08 23:55:35 +00:00
|
|
|
CCState(CallingConv::ID CC, bool isVarArg, MachineFunction &MF,
|
2013-07-14 04:42:23 +00:00
|
|
|
const TargetMachine &TM, SmallVectorImpl<CCValAssign> &locs,
|
2011-06-10 20:31:39 +00:00
|
|
|
LLVMContext &C);
|
2009-08-03 08:13:56 +00:00
|
|
|
|
2007-02-27 05:13:54 +00:00
|
|
|
void addLoc(const CCValAssign &V) {
|
|
|
|
Locs.push_back(V);
|
|
|
|
}
|
2009-08-03 08:13:56 +00:00
|
|
|
|
2009-07-22 00:24:57 +00:00
|
|
|
LLVMContext &getContext() const { return Context; }
|
2007-02-27 05:13:54 +00:00
|
|
|
const TargetMachine &getTarget() const { return TM; }
|
2011-06-08 23:55:35 +00:00
|
|
|
MachineFunction &getMachineFunction() const { return MF; }
|
2009-09-02 08:44:58 +00:00
|
|
|
CallingConv::ID getCallingConv() const { return CallingConv; }
|
2007-06-19 00:10:25 +00:00
|
|
|
bool isVarArg() const { return IsVarArg; }
|
2009-08-03 08:13:56 +00:00
|
|
|
|
2007-02-27 05:13:54 +00:00
|
|
|
unsigned getNextStackOffset() const { return StackOffset; }
|
|
|
|
|
|
|
|
/// isAllocated - Return true if the specified register (or an alias) is
|
|
|
|
/// allocated.
|
|
|
|
bool isAllocated(unsigned Reg) const {
|
|
|
|
return UsedRegs[Reg/32] & (1 << (Reg&31));
|
|
|
|
}
|
2009-08-03 08:13:56 +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
|
|
|
/// 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.
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
|
|
|
void AnalyzeFormalArguments(const SmallVectorImpl<ISD::InputArg> &Ins,
|
|
|
|
CCAssignFn Fn);
|
2009-08-03 08:13:56 +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
|
|
|
/// 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.
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
|
|
|
void AnalyzeReturn(const SmallVectorImpl<ISD::OutputArg> &Outs,
|
|
|
|
CCAssignFn Fn);
|
2009-08-03 08:13:56 +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 CheckReturn(const SmallVectorImpl<ISD::OutputArg> &ArgsFlags,
|
2009-11-07 02:11:54 +00:00
|
|
|
CCAssignFn Fn);
|
|
|
|
|
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
|
|
|
/// AnalyzeCallOperands - Analyze the outgoing arguments to a call,
|
|
|
|
/// incorporating info about the passed values into this state.
|
|
|
|
void AnalyzeCallOperands(const SmallVectorImpl<ISD::OutputArg> &Outs,
|
|
|
|
CCAssignFn Fn);
|
2007-02-28 06:56:37 +00:00
|
|
|
|
2008-09-05 16:59:26 +00:00
|
|
|
/// AnalyzeCallOperands - Same as above except it takes vectors of types
|
|
|
|
/// and argument flags.
|
2010-11-03 11:35:31 +00:00
|
|
|
void AnalyzeCallOperands(SmallVectorImpl<MVT> &ArgVTs,
|
2008-09-05 16:59:26 +00:00
|
|
|
SmallVectorImpl<ISD::ArgFlagsTy> &Flags,
|
|
|
|
CCAssignFn Fn);
|
|
|
|
|
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
|
|
|
/// 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.
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
|
|
|
void AnalyzeCallResult(const SmallVectorImpl<ISD::InputArg> &Ins,
|
|
|
|
CCAssignFn Fn);
|
2009-08-03 08:13:56 +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.
|
2010-11-03 11:35:31 +00:00
|
|
|
void AnalyzeCallResult(MVT VT, CCAssignFn Fn);
|
2007-02-27 05:13:54 +00:00
|
|
|
|
|
|
|
/// getFirstUnallocated - Return the first unallocated register in the set, or
|
|
|
|
/// NumRegs if they are all allocated.
|
2014-04-04 05:16:06 +00:00
|
|
|
unsigned getFirstUnallocated(const MCPhysReg *Regs, unsigned NumRegs) const {
|
2007-02-27 05:13:54 +00:00
|
|
|
for (unsigned i = 0; i != NumRegs; ++i)
|
|
|
|
if (!isAllocated(Regs[i]))
|
|
|
|
return i;
|
|
|
|
return NumRegs;
|
|
|
|
}
|
2009-08-03 08:13:56 +00:00
|
|
|
|
2007-02-27 05:13:54 +00:00
|
|
|
/// AllocateReg - Attempt to allocate one register. If it is not available,
|
|
|
|
/// return zero. Otherwise, return the register, marking it and any aliases
|
|
|
|
/// as allocated.
|
|
|
|
unsigned AllocateReg(unsigned Reg) {
|
|
|
|
if (isAllocated(Reg)) return 0;
|
|
|
|
MarkAllocated(Reg);
|
|
|
|
return Reg;
|
|
|
|
}
|
2008-04-02 05:23:57 +00:00
|
|
|
|
|
|
|
/// Version of AllocateReg with extra register to be shadowed.
|
|
|
|
unsigned AllocateReg(unsigned Reg, unsigned ShadowReg) {
|
|
|
|
if (isAllocated(Reg)) return 0;
|
|
|
|
MarkAllocated(Reg);
|
|
|
|
MarkAllocated(ShadowReg);
|
|
|
|
return Reg;
|
|
|
|
}
|
|
|
|
|
2007-02-27 05:13:54 +00:00
|
|
|
/// AllocateReg - Attempt to allocate one of the specified registers. If none
|
|
|
|
/// are available, return zero. Otherwise, return the first one available,
|
|
|
|
/// marking it and any aliases as allocated.
|
2014-04-04 05:16:06 +00:00
|
|
|
unsigned AllocateReg(const MCPhysReg *Regs, unsigned NumRegs) {
|
2007-02-27 05:13:54 +00:00
|
|
|
unsigned FirstUnalloc = getFirstUnallocated(Regs, NumRegs);
|
|
|
|
if (FirstUnalloc == NumRegs)
|
|
|
|
return 0; // Didn't find the reg.
|
2008-04-02 05:23:57 +00:00
|
|
|
|
2007-02-27 05:13:54 +00:00
|
|
|
// Mark the register and any aliases as allocated.
|
|
|
|
unsigned Reg = Regs[FirstUnalloc];
|
|
|
|
MarkAllocated(Reg);
|
|
|
|
return Reg;
|
|
|
|
}
|
2008-04-02 05:23:57 +00:00
|
|
|
|
|
|
|
/// Version of AllocateReg with list of registers to be shadowed.
|
2014-04-04 05:16:06 +00:00
|
|
|
unsigned AllocateReg(const MCPhysReg *Regs, const MCPhysReg *ShadowRegs,
|
2008-04-02 05:23:57 +00:00
|
|
|
unsigned NumRegs) {
|
|
|
|
unsigned FirstUnalloc = getFirstUnallocated(Regs, NumRegs);
|
|
|
|
if (FirstUnalloc == NumRegs)
|
|
|
|
return 0; // Didn't find the reg.
|
|
|
|
|
|
|
|
// Mark the register and any aliases as allocated.
|
|
|
|
unsigned Reg = Regs[FirstUnalloc], ShadowReg = ShadowRegs[FirstUnalloc];
|
|
|
|
MarkAllocated(Reg);
|
|
|
|
MarkAllocated(ShadowReg);
|
|
|
|
return Reg;
|
|
|
|
}
|
|
|
|
|
2007-02-27 05:13:54 +00:00
|
|
|
/// AllocateStack - Allocate a chunk of stack space with the specified size
|
|
|
|
/// and alignment.
|
|
|
|
unsigned AllocateStack(unsigned Size, unsigned Align) {
|
|
|
|
assert(Align && ((Align-1) & Align) == 0); // Align is power of 2.
|
|
|
|
StackOffset = ((StackOffset + Align-1) & ~(Align-1));
|
|
|
|
unsigned Result = StackOffset;
|
|
|
|
StackOffset += Size;
|
2012-10-01 16:44:04 +00:00
|
|
|
MF.getFrameInfo()->ensureMaxAlignment(Align);
|
2007-02-27 05:13:54 +00:00
|
|
|
return Result;
|
|
|
|
}
|
2007-08-10 14:44:42 +00:00
|
|
|
|
2010-08-06 15:35:32 +00:00
|
|
|
/// Version of AllocateStack with extra register to be shadowed.
|
|
|
|
unsigned AllocateStack(unsigned Size, unsigned Align, unsigned ShadowReg) {
|
|
|
|
MarkAllocated(ShadowReg);
|
|
|
|
return AllocateStack(Size, Align);
|
|
|
|
}
|
|
|
|
|
2014-02-07 11:19:53 +00:00
|
|
|
/// Version of AllocateStack with list of extra registers to be shadowed.
|
|
|
|
/// Note that, unlike AllocateReg, this shadows ALL of the shadow registers.
|
|
|
|
unsigned AllocateStack(unsigned Size, unsigned Align,
|
2014-04-04 05:16:06 +00:00
|
|
|
const MCPhysReg *ShadowRegs, unsigned NumShadowRegs) {
|
2014-02-07 11:19:53 +00:00
|
|
|
for (unsigned i = 0; i < NumShadowRegs; ++i)
|
|
|
|
MarkAllocated(ShadowRegs[i]);
|
|
|
|
return AllocateStack(Size, Align);
|
|
|
|
}
|
|
|
|
|
2008-01-15 07:49:54 +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.
|
2010-11-04 10:49:57 +00:00
|
|
|
void HandleByVal(unsigned ValNo, MVT ValVT,
|
2010-11-03 11:35:31 +00:00
|
|
|
MVT LocVT, CCValAssign::LocInfo LocInfo,
|
2008-03-21 09:14:45 +00:00
|
|
|
int MinSize, int MinAlign, ISD::ArgFlagsTy ArgFlags);
|
2008-01-15 07:49:54 +00:00
|
|
|
|
2013-05-05 07:48:36 +00:00
|
|
|
// Returns count of byval arguments that are to be stored (even partly)
|
|
|
|
// in registers.
|
|
|
|
unsigned getInRegsParamsCount() const { return ByValRegs.size(); }
|
|
|
|
|
|
|
|
// Returns count of byval in-regs arguments proceed.
|
|
|
|
unsigned getInRegsParamsProceed() const { return InRegsParamsProceed; }
|
|
|
|
|
|
|
|
// Get information about N-th byval parameter that is stored in registers.
|
|
|
|
// Here "ByValParamIndex" is N.
|
|
|
|
void getInRegsParamInfo(unsigned InRegsParamRecordIndex,
|
|
|
|
unsigned& BeginReg, unsigned& EndReg) const {
|
|
|
|
assert(InRegsParamRecordIndex < ByValRegs.size() &&
|
|
|
|
"Wrong ByVal parameter index");
|
|
|
|
|
|
|
|
const ByValInfo& info = ByValRegs[InRegsParamRecordIndex];
|
|
|
|
BeginReg = info.Begin;
|
|
|
|
EndReg = info.End;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Add information about parameter that is kept in registers.
|
|
|
|
void addInRegsParamInfo(unsigned RegBegin, unsigned RegEnd) {
|
|
|
|
ByValRegs.push_back(ByValInfo(RegBegin, RegEnd));
|
|
|
|
}
|
|
|
|
|
|
|
|
// Goes either to next byval parameter (excluding "waste" record), or
|
|
|
|
// to the end of collection.
|
|
|
|
// Returns false, if end is reached.
|
|
|
|
bool nextInRegsParam() {
|
|
|
|
unsigned e = ByValRegs.size();
|
|
|
|
if (InRegsParamsProceed < e)
|
|
|
|
++InRegsParamsProceed;
|
|
|
|
return InRegsParamsProceed < e;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Clear byval registers tracking info.
|
|
|
|
void clearByValRegsInfo() {
|
|
|
|
InRegsParamsProceed = 0;
|
|
|
|
ByValRegs.clear();
|
|
|
|
}
|
2011-04-20 16:47:52 +00:00
|
|
|
|
2014-03-05 15:25:27 +00:00
|
|
|
// Rewind byval registers tracking info.
|
|
|
|
void rewindByValRegsInfo() {
|
|
|
|
InRegsParamsProceed = 0;
|
|
|
|
}
|
|
|
|
|
2012-03-11 07:57:25 +00:00
|
|
|
ParmContext getCallOrPrologue() const { return CallOrPrologue; }
|
2011-04-20 16:47:52 +00:00
|
|
|
|
2007-02-27 05:13:54 +00:00
|
|
|
private:
|
|
|
|
/// MarkAllocated - Mark a register and all of its aliases as allocated.
|
|
|
|
void MarkAllocated(unsigned Reg);
|
|
|
|
};
|
|
|
|
|
2007-02-28 06:56:37 +00:00
|
|
|
|
|
|
|
|
2007-02-27 04:43:02 +00:00
|
|
|
} // end namespace llvm
|
|
|
|
|
|
|
|
#endif
|