2008-02-10 18:45:23 +00:00
|
|
|
//=== Target/TargetRegisterInfo.h - Target Register Information -*- C++ -*-===//
|
2005-04-21 20:59:05 +00:00
|
|
|
//
|
2003-10-20 20:19:47 +00:00
|
|
|
// 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.
|
2005-04-21 20:59:05 +00:00
|
|
|
//
|
2003-10-20 20:19:47 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
2002-10-25 23:00:40 +00:00
|
|
|
//
|
|
|
|
// This file describes an abstract interface used to get information about a
|
|
|
|
// target machines register file. This information is used for a variety of
|
|
|
|
// purposed, especially register allocation.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2008-02-10 18:45:23 +00:00
|
|
|
#ifndef LLVM_TARGET_TARGETREGISTERINFO_H
|
|
|
|
#define LLVM_TARGET_TARGETREGISTERINFO_H
|
2002-10-25 23:00:40 +00:00
|
|
|
|
2011-06-24 01:44:41 +00:00
|
|
|
#include "llvm/MC/MCRegisterInfo.h"
|
2004-02-12 08:11:04 +00:00
|
|
|
#include "llvm/CodeGen/MachineBasicBlock.h"
|
2005-10-03 03:32:39 +00:00
|
|
|
#include "llvm/CodeGen/ValueTypes.h"
|
2011-06-16 17:42:25 +00:00
|
|
|
#include "llvm/ADT/ArrayRef.h"
|
2012-01-14 01:45:25 +00:00
|
|
|
#include "llvm/CallingConv.h"
|
2004-02-25 21:55:45 +00:00
|
|
|
#include <cassert>
|
|
|
|
#include <functional>
|
2002-10-25 23:00:40 +00:00
|
|
|
|
2003-11-11 22:41:34 +00:00
|
|
|
namespace llvm {
|
|
|
|
|
2007-02-27 21:08:07 +00:00
|
|
|
class BitVector;
|
2002-12-15 20:06:35 +00:00
|
|
|
class MachineFunction;
|
2007-02-27 21:08:07 +00:00
|
|
|
class RegScavenger;
|
Teach two-address pass to do some coalescing while eliminating REG_SEQUENCE
instructions.
e.g.
%reg1026<def> = VLDMQ %reg1025<kill>, 260, pred:14, pred:%reg0
%reg1027<def> = EXTRACT_SUBREG %reg1026, 6
%reg1028<def> = EXTRACT_SUBREG %reg1026<kill>, 5
...
%reg1029<def> = REG_SEQUENCE %reg1028<kill>, 5, %reg1027<kill>, 6, %reg1028, 7, %reg1027, 8, %reg1028, 9, %reg1027, 10, %reg1030<kill>, 11, %reg1032<kill>, 12
After REG_SEQUENCE is eliminated, we are left with:
%reg1026<def> = VLDMQ %reg1025<kill>, 260, pred:14, pred:%reg0
%reg1029:6<def> = EXTRACT_SUBREG %reg1026, 6
%reg1029:5<def> = EXTRACT_SUBREG %reg1026<kill>, 5
The regular coalescer will not be able to coalesce reg1026 and reg1029 because it doesn't
know how to combine sub-register indices 5 and 6. Now 2-address pass will consult the
target whether sub-registers 5 and 6 of reg1026 can be combined to into a larger
sub-register (or combined to be reg1026 itself as is the case here). If it is possible,
it will be able to replace references of reg1026 with reg1029 + the larger sub-register
index.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@103835 91177308-0d34-0410-b5e6-96231b3b80d8
2010-05-14 23:21:14 +00:00
|
|
|
template<class T> class SmallVectorImpl;
|
2010-12-14 18:53:39 +00:00
|
|
|
class raw_ostream;
|
2002-11-20 18:54:53 +00:00
|
|
|
|
2011-07-23 00:47:46 +00:00
|
|
|
class TargetRegisterClass {
|
2002-11-20 18:54:53 +00:00
|
|
|
public:
|
2012-03-04 10:16:38 +00:00
|
|
|
typedef const uint16_t* iterator;
|
|
|
|
typedef const uint16_t* const_iterator;
|
2012-02-09 12:35:37 +00:00
|
|
|
typedef const MVT::SimpleValueType* vt_iterator;
|
2006-07-19 05:58:18 +00:00
|
|
|
typedef const TargetRegisterClass* const * sc_iterator;
|
2012-03-01 13:37:55 +00:00
|
|
|
|
|
|
|
// Instance variables filled by tablegen, do not use!
|
2011-07-23 00:47:46 +00:00
|
|
|
const MCRegisterClass *MC;
|
2006-02-21 23:51:58 +00:00
|
|
|
const vt_iterator VTs;
|
2012-05-03 18:17:32 +00:00
|
|
|
const uint32_t *SubClassMask;
|
2006-05-11 07:31:44 +00:00
|
|
|
const sc_iterator SuperClasses;
|
2009-04-13 15:38:05 +00:00
|
|
|
const sc_iterator SuperRegClasses;
|
2012-03-04 10:16:38 +00:00
|
|
|
ArrayRef<uint16_t> (*OrderFunc)(const MachineFunction&);
|
2010-07-08 19:46:25 +00:00
|
|
|
|
2011-07-23 00:47:46 +00:00
|
|
|
/// getID() - Return the register class ID number.
|
|
|
|
///
|
|
|
|
unsigned getID() const { return MC->getID(); }
|
|
|
|
|
|
|
|
/// getName() - Return the register class name for debugging.
|
|
|
|
///
|
|
|
|
const char *getName() const { return MC->getName(); }
|
|
|
|
|
|
|
|
/// begin/end - Return all of the registers in this class.
|
|
|
|
///
|
|
|
|
iterator begin() const { return MC->begin(); }
|
|
|
|
iterator end() const { return MC->end(); }
|
|
|
|
|
|
|
|
/// getNumRegs - Return the number of registers in this class.
|
|
|
|
///
|
|
|
|
unsigned getNumRegs() const { return MC->getNumRegs(); }
|
|
|
|
|
|
|
|
/// getRegister - Return the specified register in the class.
|
|
|
|
///
|
|
|
|
unsigned getRegister(unsigned i) const {
|
|
|
|
return MC->getRegister(i);
|
|
|
|
}
|
|
|
|
|
|
|
|
/// contains - Return true if the specified register is included in this
|
|
|
|
/// register class. This does not include virtual registers.
|
|
|
|
bool contains(unsigned Reg) const {
|
|
|
|
return MC->contains(Reg);
|
|
|
|
}
|
|
|
|
|
|
|
|
/// contains - Return true if both registers are in this class.
|
|
|
|
bool contains(unsigned Reg1, unsigned Reg2) const {
|
|
|
|
return MC->contains(Reg1, Reg2);
|
|
|
|
}
|
|
|
|
|
|
|
|
/// getSize - Return the size of the register in bytes, which is also the size
|
|
|
|
/// of a stack slot allocated to hold a spilled copy of this register.
|
|
|
|
unsigned getSize() const { return MC->getSize(); }
|
|
|
|
|
|
|
|
/// getAlignment - Return the minimum required alignment for a register of
|
|
|
|
/// this class.
|
|
|
|
unsigned getAlignment() const { return MC->getAlignment(); }
|
|
|
|
|
|
|
|
/// getCopyCost - Return the cost of copying a value between two registers in
|
|
|
|
/// this class. A negative number means the register class is very expensive
|
|
|
|
/// to copy e.g. status flag register classes.
|
|
|
|
int getCopyCost() const { return MC->getCopyCost(); }
|
|
|
|
|
|
|
|
/// isAllocatable - Return true if this register class may be used to create
|
|
|
|
/// virtual registers.
|
|
|
|
bool isAllocatable() const { return MC->isAllocatable(); }
|
|
|
|
|
2005-12-01 04:51:06 +00:00
|
|
|
/// hasType - return true if this TargetRegisterClass has the ValueType vt.
|
|
|
|
///
|
2009-08-10 22:56:29 +00:00
|
|
|
bool hasType(EVT vt) const {
|
2010-11-03 12:17:33 +00:00
|
|
|
for(int i = 0; VTs[i] != MVT::Other; ++i)
|
2012-02-09 12:35:37 +00:00
|
|
|
if (EVT(VTs[i]) == vt)
|
2005-12-01 04:51:06 +00:00
|
|
|
return true;
|
|
|
|
return false;
|
|
|
|
}
|
2009-10-01 20:45:06 +00:00
|
|
|
|
2006-05-09 06:35:30 +00:00
|
|
|
/// vt_begin / vt_end - Loop over all of the value types that can be
|
|
|
|
/// represented by values in this register class.
|
2006-02-21 23:51:58 +00:00
|
|
|
vt_iterator vt_begin() const {
|
|
|
|
return VTs;
|
|
|
|
}
|
|
|
|
|
|
|
|
vt_iterator vt_end() const {
|
|
|
|
vt_iterator I = VTs;
|
2010-11-03 12:17:33 +00:00
|
|
|
while (*I != MVT::Other) ++I;
|
2006-02-21 23:51:58 +00:00
|
|
|
return I;
|
|
|
|
}
|
2006-05-09 06:35:30 +00:00
|
|
|
|
2009-04-13 15:38:05 +00:00
|
|
|
/// superregclasses_begin / superregclasses_end - Loop over all of
|
|
|
|
/// the superreg register classes of this register class.
|
|
|
|
sc_iterator superregclasses_begin() const {
|
|
|
|
return SuperRegClasses;
|
|
|
|
}
|
|
|
|
|
|
|
|
sc_iterator superregclasses_end() const {
|
|
|
|
sc_iterator I = SuperRegClasses;
|
|
|
|
while (*I != NULL) ++I;
|
|
|
|
return I;
|
|
|
|
}
|
|
|
|
|
2010-02-10 16:03:48 +00:00
|
|
|
/// hasSubClass - return true if the specified TargetRegisterClass
|
2011-09-30 22:19:07 +00:00
|
|
|
/// is a proper sub-class of this TargetRegisterClass.
|
|
|
|
bool hasSubClass(const TargetRegisterClass *RC) const {
|
|
|
|
return RC != this && hasSubClassEq(RC);
|
2006-05-09 06:35:30 +00:00
|
|
|
}
|
|
|
|
|
2011-09-30 22:19:07 +00:00
|
|
|
/// hasSubClassEq - Returns true if RC is a sub-class of or equal to this
|
2011-06-01 15:32:10 +00:00
|
|
|
/// class.
|
|
|
|
bool hasSubClassEq(const TargetRegisterClass *RC) const {
|
2011-09-30 22:19:07 +00:00
|
|
|
unsigned ID = RC->getID();
|
|
|
|
return (SubClassMask[ID / 32] >> (ID % 32)) & 1;
|
2006-05-09 06:35:30 +00:00
|
|
|
}
|
2009-10-01 20:45:06 +00:00
|
|
|
|
2007-07-26 08:01:58 +00:00
|
|
|
/// hasSuperClass - return true if the specified TargetRegisterClass is a
|
2011-09-30 22:19:07 +00:00
|
|
|
/// proper super-class of this TargetRegisterClass.
|
|
|
|
bool hasSuperClass(const TargetRegisterClass *RC) const {
|
|
|
|
return RC->hasSubClass(this);
|
2006-05-11 07:31:44 +00:00
|
|
|
}
|
|
|
|
|
2011-09-30 22:19:07 +00:00
|
|
|
/// hasSuperClassEq - Returns true if RC is a super-class of or equal to this
|
2011-06-01 15:32:10 +00:00
|
|
|
/// class.
|
|
|
|
bool hasSuperClassEq(const TargetRegisterClass *RC) const {
|
2011-09-30 22:19:07 +00:00
|
|
|
return RC->hasSubClassEq(this);
|
2011-06-01 15:32:10 +00:00
|
|
|
}
|
|
|
|
|
2011-09-30 22:19:07 +00:00
|
|
|
/// getSubClassMask - Returns a bit vector of subclasses, including this one.
|
|
|
|
/// The vector is indexed by class IDs, see hasSubClassEq() above for how to
|
|
|
|
/// use it.
|
2012-03-05 05:37:41 +00:00
|
|
|
const uint32_t *getSubClassMask() const {
|
2011-09-30 22:19:07 +00:00
|
|
|
return SubClassMask;
|
2006-05-11 07:31:44 +00:00
|
|
|
}
|
2009-10-01 20:45:06 +00:00
|
|
|
|
2011-09-30 22:19:07 +00:00
|
|
|
/// getSuperClasses - Returns a NULL terminated list of super-classes. The
|
|
|
|
/// classes are ordered by ID which is also a topological ordering from large
|
|
|
|
/// to small classes. The list does NOT include the current class.
|
|
|
|
sc_iterator getSuperClasses() const {
|
|
|
|
return SuperClasses;
|
2006-05-11 07:31:44 +00:00
|
|
|
}
|
2009-01-23 02:15:19 +00:00
|
|
|
|
2009-04-13 15:38:05 +00:00
|
|
|
/// isASubClass - return true if this TargetRegisterClass is a subset
|
|
|
|
/// class of at least one other TargetRegisterClass.
|
2009-01-23 02:15:19 +00:00
|
|
|
bool isASubClass() const {
|
|
|
|
return SuperClasses[0] != 0;
|
|
|
|
}
|
2009-10-01 20:45:06 +00:00
|
|
|
|
2011-06-16 17:42:25 +00:00
|
|
|
/// getRawAllocationOrder - Returns the preferred order for allocating
|
|
|
|
/// registers from this register class in MF. The raw order comes directly
|
|
|
|
/// from the .td file and may include reserved registers that are not
|
|
|
|
/// allocatable. Register allocators should also make sure to allocate
|
|
|
|
/// callee-saved registers only after all the volatiles are used. The
|
|
|
|
/// RegisterClassInfo class provides filtered allocation orders with
|
|
|
|
/// callee-saved registers moved to the end.
|
|
|
|
///
|
|
|
|
/// The MachineFunction argument can be used to tune the allocatable
|
|
|
|
/// registers based on the characteristics of the function, subtarget, or
|
|
|
|
/// other criteria.
|
|
|
|
///
|
|
|
|
/// By default, this method returns all registers in the class.
|
|
|
|
///
|
2012-03-04 10:16:38 +00:00
|
|
|
ArrayRef<uint16_t> getRawAllocationOrder(const MachineFunction &MF) const {
|
2012-03-01 13:37:55 +00:00
|
|
|
return OrderFunc ? OrderFunc(MF) : makeArrayRef(begin(), getNumRegs());
|
2011-06-16 17:42:25 +00:00
|
|
|
}
|
2002-11-20 18:54:53 +00:00
|
|
|
};
|
|
|
|
|
2011-06-24 01:44:41 +00:00
|
|
|
/// TargetRegisterInfoDesc - Extra information, not in MCRegisterDesc, about
|
|
|
|
/// registers. These are used by codegen, not by MC.
|
|
|
|
struct TargetRegisterInfoDesc {
|
|
|
|
unsigned CostPerUse; // Extra cost of instructions using register.
|
|
|
|
bool inAllocatableClass; // Register belongs to an allocatable regclass.
|
|
|
|
};
|
2002-11-20 18:54:53 +00:00
|
|
|
|
2012-04-11 18:16:28 +00:00
|
|
|
/// Each TargetRegisterClass has a per register weight, and weight
|
|
|
|
/// limit which must be less than the limits of its pressure sets.
|
|
|
|
struct RegClassWeight {
|
2012-04-17 01:22:58 +00:00
|
|
|
unsigned RegWeight;
|
2012-04-11 18:16:28 +00:00
|
|
|
unsigned WeightLimit;
|
|
|
|
};
|
|
|
|
|
2008-02-10 18:45:23 +00:00
|
|
|
/// TargetRegisterInfo base class - We assume that the target defines a static
|
|
|
|
/// array of TargetRegisterDesc objects that represent all of the machine
|
|
|
|
/// registers that the target has. As such, we simply have to track a pointer
|
|
|
|
/// to this array so that we can turn register number into a register
|
|
|
|
/// descriptor.
|
2002-10-25 23:00:40 +00:00
|
|
|
///
|
2011-06-24 01:44:41 +00:00
|
|
|
class TargetRegisterInfo : public MCRegisterInfo {
|
2002-12-17 04:20:39 +00:00
|
|
|
public:
|
|
|
|
typedef const TargetRegisterClass * const * regclass_iterator;
|
|
|
|
private:
|
2011-06-24 01:44:41 +00:00
|
|
|
const TargetRegisterInfoDesc *InfoDesc; // Extra desc array for codegen
|
2010-05-25 19:49:38 +00:00
|
|
|
const char *const *SubRegIndexNames; // Names of subreg indexes.
|
2002-12-17 04:20:39 +00:00
|
|
|
regclass_iterator RegClassBegin, RegClassEnd; // List of regclasses
|
2009-11-12 21:00:03 +00:00
|
|
|
|
2002-10-25 23:00:40 +00:00
|
|
|
protected:
|
2011-06-24 01:44:41 +00:00
|
|
|
TargetRegisterInfo(const TargetRegisterInfoDesc *ID,
|
2008-02-10 18:45:23 +00:00
|
|
|
regclass_iterator RegClassBegin,
|
|
|
|
regclass_iterator RegClassEnd,
|
2011-06-28 21:14:33 +00:00
|
|
|
const char *const *subregindexnames);
|
2008-02-10 18:45:23 +00:00
|
|
|
virtual ~TargetRegisterInfo();
|
2002-10-25 23:00:40 +00:00
|
|
|
public:
|
|
|
|
|
2011-01-09 23:20:48 +00:00
|
|
|
// Register numbers can represent physical registers, virtual registers, and
|
|
|
|
// sometimes stack slots. The unsigned values are divided into these ranges:
|
|
|
|
//
|
|
|
|
// 0 Not a register, can be used as a sentinel.
|
|
|
|
// [1;2^30) Physical registers assigned by TableGen.
|
|
|
|
// [2^30;2^31) Stack slots. (Rarely used.)
|
|
|
|
// [2^31;2^32) Virtual registers assigned by MachineRegisterInfo.
|
|
|
|
//
|
|
|
|
// Further sentinels can be allocated from the small negative integers.
|
|
|
|
// DenseMapInfo<unsigned> uses -1u and -2u.
|
2002-10-25 23:00:40 +00:00
|
|
|
|
2011-01-09 21:17:37 +00:00
|
|
|
/// isStackSlot - Sometimes it is useful the be able to store a non-negative
|
|
|
|
/// frame index in a variable that normally holds a register. isStackSlot()
|
|
|
|
/// returns true if Reg is in the range used for stack slots.
|
|
|
|
///
|
2011-01-09 22:42:48 +00:00
|
|
|
/// Note that isVirtualRegister() and isPhysicalRegister() cannot handle stack
|
|
|
|
/// slots, so if a variable may contains a stack slot, always check
|
|
|
|
/// isStackSlot() first.
|
2011-01-09 21:17:37 +00:00
|
|
|
///
|
|
|
|
static bool isStackSlot(unsigned Reg) {
|
2011-01-09 22:42:48 +00:00
|
|
|
return int(Reg) >= (1 << 30);
|
2011-01-09 21:17:37 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/// stackSlot2Index - Compute the frame index from a register value
|
|
|
|
/// representing a stack slot.
|
|
|
|
static int stackSlot2Index(unsigned Reg) {
|
|
|
|
assert(isStackSlot(Reg) && "Not a stack slot");
|
2011-01-09 22:42:48 +00:00
|
|
|
return int(Reg - (1u << 30));
|
2011-01-09 21:17:37 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/// index2StackSlot - Convert a non-negative frame index to a stack slot
|
|
|
|
/// register value.
|
|
|
|
static unsigned index2StackSlot(int FI) {
|
|
|
|
assert(FI >= 0 && "Cannot hold a negative frame index.");
|
2011-01-09 22:42:48 +00:00
|
|
|
return FI + (1u << 30);
|
2011-01-09 21:17:37 +00:00
|
|
|
}
|
|
|
|
|
2004-01-31 19:57:11 +00:00
|
|
|
/// isPhysicalRegister - Return true if the specified register number is in
|
|
|
|
/// the physical register namespace.
|
|
|
|
static bool isPhysicalRegister(unsigned Reg) {
|
2011-01-09 22:42:48 +00:00
|
|
|
assert(!isStackSlot(Reg) && "Not a register! Check isStackSlot() first.");
|
|
|
|
return int(Reg) > 0;
|
2004-01-31 19:57:11 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/// isVirtualRegister - Return true if the specified register number is in
|
|
|
|
/// the virtual register namespace.
|
|
|
|
static bool isVirtualRegister(unsigned Reg) {
|
2011-01-09 22:42:48 +00:00
|
|
|
assert(!isStackSlot(Reg) && "Not a register! Check isStackSlot() first.");
|
|
|
|
return int(Reg) < 0;
|
2004-01-31 19:57:11 +00:00
|
|
|
}
|
|
|
|
|
2011-01-08 23:11:07 +00:00
|
|
|
/// virtReg2Index - Convert a virtual register number to a 0-based index.
|
|
|
|
/// The first virtual register in a function will get the index 0.
|
|
|
|
static unsigned virtReg2Index(unsigned Reg) {
|
2011-01-09 22:42:48 +00:00
|
|
|
assert(isVirtualRegister(Reg) && "Not a virtual register");
|
2011-05-24 03:20:56 +00:00
|
|
|
return Reg & ~(1u << 31);
|
2011-01-08 23:11:07 +00:00
|
|
|
}
|
|
|
|
|
2011-01-08 23:10:57 +00:00
|
|
|
/// index2VirtReg - Convert a 0-based index to a virtual register number.
|
|
|
|
/// This is the inverse operation of VirtReg2IndexFunctor below.
|
|
|
|
static unsigned index2VirtReg(unsigned Index) {
|
2011-05-24 03:20:56 +00:00
|
|
|
return Index | (1u << 31);
|
2011-01-08 23:10:57 +00:00
|
|
|
}
|
|
|
|
|
2010-06-02 12:39:06 +00:00
|
|
|
/// getMinimalPhysRegClass - Returns the Register Class of a physical
|
2010-07-06 15:31:55 +00:00
|
|
|
/// register of the given type, picking the most sub register class of
|
|
|
|
/// the right type that contains this physreg.
|
2010-06-29 14:02:34 +00:00
|
|
|
const TargetRegisterClass *
|
|
|
|
getMinimalPhysRegClass(unsigned Reg, EVT VT = MVT::Other) const;
|
2010-06-02 12:39:06 +00:00
|
|
|
|
2012-05-03 01:14:37 +00:00
|
|
|
/// getAllocatableClass - Return the maximal subclass of the given register
|
|
|
|
/// class that is alloctable, or NULL.
|
|
|
|
const TargetRegisterClass *
|
|
|
|
getAllocatableClass(const TargetRegisterClass *RC) const;
|
|
|
|
|
2004-08-26 22:21:04 +00:00
|
|
|
/// getAllocatableSet - Returns a bitset indexed by register number
|
2007-04-17 20:23:34 +00:00
|
|
|
/// indicating if a register is allocatable or not. If a register class is
|
|
|
|
/// specified, returns the subset for the class.
|
2009-10-09 22:09:05 +00:00
|
|
|
BitVector getAllocatableSet(const MachineFunction &MF,
|
2007-04-17 20:23:34 +00:00
|
|
|
const TargetRegisterClass *RC = NULL) const;
|
2004-08-26 22:21:04 +00:00
|
|
|
|
2011-04-20 18:19:48 +00:00
|
|
|
/// getCostPerUse - Return the additional cost of using this register instead
|
|
|
|
/// of other registers in its class.
|
|
|
|
unsigned getCostPerUse(unsigned RegNo) const {
|
2011-06-24 01:44:41 +00:00
|
|
|
return InfoDesc[RegNo].CostPerUse;
|
2011-04-20 18:19:48 +00:00
|
|
|
}
|
|
|
|
|
2011-06-24 01:44:41 +00:00
|
|
|
/// isInAllocatableClass - Return true if the register is in the allocation
|
|
|
|
/// of any register class.
|
|
|
|
bool isInAllocatableClass(unsigned RegNo) const {
|
|
|
|
return InfoDesc[RegNo].inAllocatableClass;
|
2004-02-01 17:14:20 +00:00
|
|
|
}
|
|
|
|
|
2010-05-25 19:49:38 +00:00
|
|
|
/// getSubRegIndexName - Return the human-readable symbolic target-specific
|
|
|
|
/// name for the specified SubRegIndex.
|
|
|
|
const char *getSubRegIndexName(unsigned SubIdx) const {
|
|
|
|
assert(SubIdx && "This is not a subregister index");
|
|
|
|
return SubRegIndexNames[SubIdx-1];
|
|
|
|
}
|
|
|
|
|
2009-09-03 02:52:02 +00:00
|
|
|
/// regsOverlap - Returns true if the two registers are equal or alias each
|
|
|
|
/// other. The registers may be virtual register.
|
|
|
|
bool regsOverlap(unsigned regA, unsigned regB) const {
|
2011-06-15 06:53:50 +00:00
|
|
|
if (regA == regB) return true;
|
2009-09-03 02:52:02 +00:00
|
|
|
if (isVirtualRegister(regA) || isVirtualRegister(regB))
|
|
|
|
return false;
|
2012-03-04 10:43:23 +00:00
|
|
|
for (const uint16_t *regList = getOverlaps(regA)+1; *regList; ++regList) {
|
2011-06-15 06:53:50 +00:00
|
|
|
if (*regList == regB) return true;
|
2009-04-09 22:19:30 +00:00
|
|
|
}
|
2004-02-19 01:10:55 +00:00
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2007-04-25 07:24:50 +00:00
|
|
|
/// isSubRegister - Returns true if regB is a sub-register of regA.
|
|
|
|
///
|
|
|
|
bool isSubRegister(unsigned regA, unsigned regB) const {
|
2011-06-15 06:53:50 +00:00
|
|
|
return isSuperRegister(regB, regA);
|
2007-04-25 07:24:50 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/// isSuperRegister - Returns true if regB is a super-register of regA.
|
|
|
|
///
|
|
|
|
bool isSuperRegister(unsigned regA, unsigned regB) const {
|
2012-03-05 05:37:41 +00:00
|
|
|
for (const uint16_t *regList = getSuperRegisters(regA); *regList;++regList){
|
2011-06-15 06:53:50 +00:00
|
|
|
if (*regList == regB) return true;
|
|
|
|
}
|
|
|
|
return false;
|
2007-04-25 07:24:50 +00:00
|
|
|
}
|
|
|
|
|
2007-01-02 21:30:17 +00:00
|
|
|
/// getCalleeSavedRegs - Return a null-terminated list of all of the
|
|
|
|
/// callee saved registers on this target. The register should be in the
|
2006-09-28 00:07:19 +00:00
|
|
|
/// order of desired callee-save stack frame offset. The first register is
|
2012-01-14 01:45:25 +00:00
|
|
|
/// closest to the incoming stack pointer if stack grows down, and vice versa.
|
|
|
|
///
|
2012-03-04 03:33:22 +00:00
|
|
|
virtual const uint16_t* getCalleeSavedRegs(const MachineFunction *MF = 0)
|
2007-07-14 14:06:15 +00:00
|
|
|
const = 0;
|
2002-12-17 04:20:39 +00:00
|
|
|
|
2012-01-14 01:45:25 +00:00
|
|
|
/// getCallPreservedMask - Return a mask of call-preserved registers for the
|
|
|
|
/// given calling convention on the current sub-target. The mask should
|
|
|
|
/// include all call-preserved aliases. This is used by the register
|
|
|
|
/// allocator to determine which registers can be live across a call.
|
|
|
|
///
|
|
|
|
/// The mask is an array containing (TRI::getNumRegs()+31)/32 entries.
|
|
|
|
/// A set bit indicates that all bits of the corresponding register are
|
|
|
|
/// preserved across the function call. The bit mask is expected to be
|
|
|
|
/// sub-register complete, i.e. if A is preserved, so are all its
|
|
|
|
/// sub-registers.
|
|
|
|
///
|
|
|
|
/// Bits are numbered from the LSB, so the bit for physical register Reg can
|
|
|
|
/// be found as (Mask[Reg / 32] >> Reg % 32) & 1.
|
2012-02-02 23:52:57 +00:00
|
|
|
///
|
|
|
|
/// A NULL pointer means that no register mask will be used, and call
|
|
|
|
/// instructions should use implicit-def operands to indicate call clobbered
|
|
|
|
/// registers.
|
2012-01-14 01:45:25 +00:00
|
|
|
///
|
|
|
|
virtual const uint32_t *getCallPreservedMask(CallingConv::ID) const {
|
|
|
|
// The default mask clobbers everything. All targets should override.
|
|
|
|
return 0;
|
|
|
|
}
|
2002-12-17 04:20:39 +00:00
|
|
|
|
2007-02-19 21:49:54 +00:00
|
|
|
/// getReservedRegs - Returns a bitset indexed by physical register number
|
2007-10-10 05:45:59 +00:00
|
|
|
/// indicating if a register is a special register that has particular uses
|
|
|
|
/// and should be considered unavailable at all times, e.g. SP, RA. This is
|
|
|
|
/// used by register scavenger to determine what registers are free.
|
2007-02-19 21:49:54 +00:00
|
|
|
virtual BitVector getReservedRegs(const MachineFunction &MF) const = 0;
|
|
|
|
|
2009-04-28 18:29:27 +00:00
|
|
|
/// getMatchingSuperReg - Return a super-register of the specified register
|
|
|
|
/// Reg so its sub-register of index SubIdx is Reg.
|
2009-10-01 20:45:06 +00:00
|
|
|
unsigned getMatchingSuperReg(unsigned Reg, unsigned SubIdx,
|
2009-04-28 18:29:27 +00:00
|
|
|
const TargetRegisterClass *RC) const {
|
2012-03-05 19:33:24 +00:00
|
|
|
return MCRegisterInfo::getMatchingSuperReg(Reg, SubIdx, RC->MC);
|
2009-04-28 18:29:27 +00:00
|
|
|
}
|
|
|
|
|
2010-06-02 18:54:47 +00:00
|
|
|
/// canCombineSubRegIndices - Given a register class and a list of
|
|
|
|
/// subregister indices, return true if it's possible to combine the
|
|
|
|
/// subregister indices into one that corresponds to a larger
|
|
|
|
/// subregister. Return the new subregister index by reference. Note the
|
|
|
|
/// new index may be zero if the given subregisters can be combined to
|
|
|
|
/// form the whole register.
|
|
|
|
virtual bool canCombineSubRegIndices(const TargetRegisterClass *RC,
|
|
|
|
SmallVectorImpl<unsigned> &SubIndices,
|
|
|
|
unsigned &NewSubIdx) const {
|
Teach two-address pass to do some coalescing while eliminating REG_SEQUENCE
instructions.
e.g.
%reg1026<def> = VLDMQ %reg1025<kill>, 260, pred:14, pred:%reg0
%reg1027<def> = EXTRACT_SUBREG %reg1026, 6
%reg1028<def> = EXTRACT_SUBREG %reg1026<kill>, 5
...
%reg1029<def> = REG_SEQUENCE %reg1028<kill>, 5, %reg1027<kill>, 6, %reg1028, 7, %reg1027, 8, %reg1028, 9, %reg1027, 10, %reg1030<kill>, 11, %reg1032<kill>, 12
After REG_SEQUENCE is eliminated, we are left with:
%reg1026<def> = VLDMQ %reg1025<kill>, 260, pred:14, pred:%reg0
%reg1029:6<def> = EXTRACT_SUBREG %reg1026, 6
%reg1029:5<def> = EXTRACT_SUBREG %reg1026<kill>, 5
The regular coalescer will not be able to coalesce reg1026 and reg1029 because it doesn't
know how to combine sub-register indices 5 and 6. Now 2-address pass will consult the
target whether sub-registers 5 and 6 of reg1026 can be combined to into a larger
sub-register (or combined to be reg1026 itself as is the case here). If it is possible,
it will be able to replace references of reg1026 with reg1029 + the larger sub-register
index.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@103835 91177308-0d34-0410-b5e6-96231b3b80d8
2010-05-14 23:21:14 +00:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2009-07-18 02:10:10 +00:00
|
|
|
/// getMatchingSuperRegClass - Return a subclass of the specified register
|
|
|
|
/// class A so that each register in it has a sub-register of the
|
|
|
|
/// specified sub-register index which is in the specified register class B.
|
2011-12-19 16:53:34 +00:00
|
|
|
///
|
|
|
|
/// TableGen will synthesize missing A sub-classes.
|
2009-07-18 02:10:10 +00:00
|
|
|
virtual const TargetRegisterClass *
|
|
|
|
getMatchingSuperRegClass(const TargetRegisterClass *A,
|
2012-05-03 16:26:20 +00:00
|
|
|
const TargetRegisterClass *B, unsigned Idx) const {
|
|
|
|
llvm_unreachable("Target has no sub-registers");
|
|
|
|
}
|
2009-07-18 02:10:10 +00:00
|
|
|
|
2011-10-05 00:35:49 +00:00
|
|
|
/// getSubClassWithSubReg - Returns the largest legal sub-class of RC that
|
|
|
|
/// supports the sub-register index Idx.
|
|
|
|
/// If no such sub-class exists, return NULL.
|
|
|
|
/// If all registers in RC already have an Idx sub-register, return RC.
|
|
|
|
///
|
|
|
|
/// TableGen generates a version of this function that is good enough in most
|
|
|
|
/// cases. Targets can override if they have constraints that TableGen
|
|
|
|
/// doesn't understand. For example, the x86 sub_8bit sub-register index is
|
|
|
|
/// supported by the full GR32 register class in 64-bit mode, but only by the
|
|
|
|
/// GR32_ABCD regiister class in 32-bit mode.
|
|
|
|
///
|
2011-12-19 16:53:34 +00:00
|
|
|
/// TableGen will synthesize missing RC sub-classes.
|
2011-10-05 00:35:49 +00:00
|
|
|
virtual const TargetRegisterClass *
|
2012-05-03 16:26:20 +00:00
|
|
|
getSubClassWithSubReg(const TargetRegisterClass *RC, unsigned Idx) const {
|
|
|
|
assert(Idx == 0 && "Target has no sub-registers");
|
|
|
|
return RC;
|
|
|
|
}
|
2011-10-05 00:35:49 +00:00
|
|
|
|
2010-05-28 18:18:53 +00:00
|
|
|
/// composeSubRegIndices - Return the subregister index you get from composing
|
|
|
|
/// two subregister indices.
|
|
|
|
///
|
|
|
|
/// If R:a:b is the same register as R:c, then composeSubRegIndices(a, b)
|
|
|
|
/// returns c. Note that composeSubRegIndices does not tell you about illegal
|
|
|
|
/// compositions. If R does not have a subreg a, or R:a does not have a subreg
|
|
|
|
/// b, composeSubRegIndices doesn't tell you.
|
|
|
|
///
|
|
|
|
/// The ARM register Q0 has two D subregs dsub_0:D0 and dsub_1:D1. It also has
|
|
|
|
/// ssub_0:S0 - ssub_3:S3 subregs.
|
|
|
|
/// If you compose subreg indices dsub_1, ssub_0 you get ssub_2.
|
|
|
|
///
|
|
|
|
virtual unsigned composeSubRegIndices(unsigned a, unsigned b) const {
|
|
|
|
// This default implementation is correct for most targets.
|
|
|
|
return b;
|
|
|
|
}
|
|
|
|
|
2002-12-17 04:20:39 +00:00
|
|
|
//===--------------------------------------------------------------------===//
|
|
|
|
// Register Class Information
|
|
|
|
//
|
|
|
|
|
|
|
|
/// Register class iterators
|
2003-07-30 05:29:45 +00:00
|
|
|
///
|
2002-12-17 04:20:39 +00:00
|
|
|
regclass_iterator regclass_begin() const { return RegClassBegin; }
|
|
|
|
regclass_iterator regclass_end() const { return RegClassEnd; }
|
|
|
|
|
|
|
|
unsigned getNumRegClasses() const {
|
2008-05-05 18:30:58 +00:00
|
|
|
return (unsigned)(regclass_end()-regclass_begin());
|
2002-12-17 04:20:39 +00:00
|
|
|
}
|
2009-10-01 20:45:06 +00:00
|
|
|
|
2006-07-21 20:57:35 +00:00
|
|
|
/// getRegClass - Returns the register class associated with the enumeration
|
2011-06-28 19:10:37 +00:00
|
|
|
/// value. See class MCOperandInfo.
|
2006-07-21 20:57:35 +00:00
|
|
|
const TargetRegisterClass *getRegClass(unsigned i) const {
|
2010-06-18 18:13:55 +00:00
|
|
|
assert(i < getNumRegClasses() && "Register Class ID out of range");
|
|
|
|
return RegClassBegin[i];
|
2006-07-21 20:57:35 +00:00
|
|
|
}
|
2002-12-17 04:20:39 +00:00
|
|
|
|
2011-09-30 22:18:51 +00:00
|
|
|
/// getCommonSubClass - find the largest common subclass of A and B. Return
|
|
|
|
/// NULL if there is no common subclass.
|
|
|
|
const TargetRegisterClass *
|
|
|
|
getCommonSubClass(const TargetRegisterClass *A,
|
|
|
|
const TargetRegisterClass *B) const;
|
|
|
|
|
2009-02-06 17:43:24 +00:00
|
|
|
/// getPointerRegClass - Returns a TargetRegisterClass used for pointer
|
2009-07-29 20:31:52 +00:00
|
|
|
/// values. If a target supports multiple different pointer register classes,
|
|
|
|
/// kind specifies which one is indicated.
|
|
|
|
virtual const TargetRegisterClass *getPointerRegClass(unsigned Kind=0) const {
|
2012-02-05 22:14:15 +00:00
|
|
|
llvm_unreachable("Target didn't implement getPointerRegClass!");
|
2009-02-06 17:43:24 +00:00
|
|
|
}
|
2002-12-17 04:20:39 +00:00
|
|
|
|
2007-09-26 21:31:07 +00:00
|
|
|
/// getCrossCopyRegClass - Returns a legal register class to copy a register
|
2011-03-10 00:16:32 +00:00
|
|
|
/// in the specified class to or from. If it is possible to copy the register
|
|
|
|
/// directly without using a cross register class copy, return the specified
|
|
|
|
/// RC. Returns NULL if it is not possible to copy between a two registers of
|
|
|
|
/// the specified class.
|
2007-09-26 21:31:07 +00:00
|
|
|
virtual const TargetRegisterClass *
|
|
|
|
getCrossCopyRegClass(const TargetRegisterClass *RC) const {
|
2011-03-10 00:16:32 +00:00
|
|
|
return RC;
|
2007-09-26 21:31:07 +00:00
|
|
|
}
|
|
|
|
|
2011-04-26 18:52:33 +00:00
|
|
|
/// getLargestLegalSuperClass - Returns the largest super class of RC that is
|
|
|
|
/// legal to use in the current sub-target and has the same spill size.
|
|
|
|
/// The returned register class can be used to create virtual registers which
|
|
|
|
/// means that all its registers can be copied and spilled.
|
|
|
|
virtual const TargetRegisterClass*
|
|
|
|
getLargestLegalSuperClass(const TargetRegisterClass *RC) const {
|
|
|
|
/// The default implementation is very conservative and doesn't allow the
|
|
|
|
/// register allocator to inflate register classes.
|
|
|
|
return RC;
|
|
|
|
}
|
|
|
|
|
2011-03-07 21:56:36 +00:00
|
|
|
/// getRegPressureLimit - Return the register pressure "high water mark" for
|
|
|
|
/// the specific register class. The scheduler is in high register pressure
|
|
|
|
/// mode (for the specific register class) if it goes over the limit.
|
2012-04-10 02:25:26 +00:00
|
|
|
///
|
|
|
|
/// Note: this is the old register pressure model that relies on a manually
|
|
|
|
/// specified representative register class per value type.
|
2011-03-07 21:56:36 +00:00
|
|
|
virtual unsigned getRegPressureLimit(const TargetRegisterClass *RC,
|
|
|
|
MachineFunction &MF) const {
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2012-04-20 20:45:00 +00:00
|
|
|
// Get the weight in units of pressure for this register class.
|
2012-04-11 18:16:28 +00:00
|
|
|
virtual const RegClassWeight &getRegClassWeight(
|
|
|
|
const TargetRegisterClass *RC) const = 0;
|
2012-04-10 02:25:26 +00:00
|
|
|
|
|
|
|
/// Get the number of dimensions of register pressure.
|
|
|
|
virtual unsigned getNumRegPressureSets() const = 0;
|
|
|
|
|
2012-04-20 20:45:00 +00:00
|
|
|
/// Get the name of this register unit pressure set.
|
|
|
|
virtual const char *getRegPressureSetName(unsigned Idx) const = 0;
|
|
|
|
|
2012-04-10 02:25:26 +00:00
|
|
|
/// Get the register unit pressure limit for this dimension.
|
|
|
|
/// This limit must be adjusted dynamically for reserved registers.
|
|
|
|
virtual unsigned getRegPressureSetLimit(unsigned Idx) const = 0;
|
|
|
|
|
|
|
|
/// Get the dimensions of register pressure impacted by this register class.
|
|
|
|
/// Returns a -1 terminated array of pressure set IDs.
|
|
|
|
virtual const int *getRegClassPressureSets(
|
|
|
|
const TargetRegisterClass *RC) const = 0;
|
|
|
|
|
2011-06-16 23:31:16 +00:00
|
|
|
/// getRawAllocationOrder - Returns the register allocation order for a
|
|
|
|
/// specified register class with a target-dependent hint. The returned list
|
|
|
|
/// may contain reserved registers that cannot be allocated.
|
|
|
|
///
|
|
|
|
/// Register allocators need only call this function to resolve
|
|
|
|
/// target-dependent hints, but it should work without hinting as well.
|
2012-03-04 10:16:38 +00:00
|
|
|
virtual ArrayRef<uint16_t>
|
2011-06-16 23:31:16 +00:00
|
|
|
getRawAllocationOrder(const TargetRegisterClass *RC,
|
|
|
|
unsigned HintType, unsigned HintReg,
|
|
|
|
const MachineFunction &MF) const {
|
|
|
|
return RC->getRawAllocationOrder(MF);
|
2009-06-15 08:28:29 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/// ResolveRegAllocHint - Resolves the specified register allocation hint
|
|
|
|
/// to a physical register. Returns the physical register if it is successful.
|
2009-06-18 02:04:01 +00:00
|
|
|
virtual unsigned ResolveRegAllocHint(unsigned Type, unsigned Reg,
|
|
|
|
const MachineFunction &MF) const {
|
2009-06-15 08:28:29 +00:00
|
|
|
if (Type == 0 && Reg && isPhysicalRegister(Reg))
|
|
|
|
return Reg;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2011-04-19 18:11:45 +00:00
|
|
|
/// avoidWriteAfterWrite - Return true if the register allocator should avoid
|
|
|
|
/// writing a register from RC in two consecutive instructions.
|
|
|
|
/// This can avoid pipeline stalls on certain architectures.
|
|
|
|
/// It does cause increased register pressure, though.
|
|
|
|
virtual bool avoidWriteAfterWrite(const TargetRegisterClass *RC) const {
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2009-06-18 02:04:01 +00:00
|
|
|
/// UpdateRegAllocHint - A callback to allow target a chance to update
|
|
|
|
/// register allocation hints when a register is "changed" (e.g. coalesced)
|
|
|
|
/// to another register. e.g. On ARM, some virtual registers should target
|
|
|
|
/// register pairs, if one of pair is coalesced to another register, the
|
|
|
|
/// allocation hint of the other half of the pair should be changed to point
|
|
|
|
/// to the new register.
|
|
|
|
virtual void UpdateRegAllocHint(unsigned Reg, unsigned NewReg,
|
|
|
|
MachineFunction &MF) const {
|
|
|
|
// Do nothing.
|
|
|
|
}
|
|
|
|
|
2007-10-10 05:45:59 +00:00
|
|
|
/// requiresRegisterScavenging - returns true if the target requires (and can
|
|
|
|
/// make use of) the register scavenger.
|
2007-02-28 00:59:19 +00:00
|
|
|
virtual bool requiresRegisterScavenging(const MachineFunction &MF) const {
|
2007-02-28 00:17:36 +00:00
|
|
|
return false;
|
|
|
|
}
|
2009-10-01 20:45:06 +00:00
|
|
|
|
2011-03-03 20:01:52 +00:00
|
|
|
/// useFPForScavengingIndex - returns true if the target wants to use
|
|
|
|
/// frame pointer based accesses to spill to the scavenger emergency spill
|
|
|
|
/// slot.
|
|
|
|
virtual bool useFPForScavengingIndex(const MachineFunction &MF) const {
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2009-10-08 01:46:59 +00:00
|
|
|
/// requiresFrameIndexScavenging - returns true if the target requires post
|
|
|
|
/// PEI scavenging of registers for materializing frame index constants.
|
|
|
|
virtual bool requiresFrameIndexScavenging(const MachineFunction &MF) const {
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2010-08-24 19:05:43 +00:00
|
|
|
/// requiresVirtualBaseRegisters - Returns true if the target wants the
|
|
|
|
/// LocalStackAllocation pass to be run and virtual base registers
|
|
|
|
/// used for more efficient stack access.
|
|
|
|
virtual bool requiresVirtualBaseRegisters(const MachineFunction &MF) const {
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2009-07-09 06:53:48 +00:00
|
|
|
/// hasReservedSpillSlot - Return true if target has reserved a spill slot in
|
|
|
|
/// the stack frame of the given function for the specified register. e.g. On
|
|
|
|
/// x86, if the frame register is required, the first fixed stack object is
|
|
|
|
/// reserved as its spill slot. This tells PEI not to create a new stack frame
|
|
|
|
/// object for the given register. It should be called only after
|
|
|
|
/// processFunctionBeforeCalleeSavedScan().
|
2010-07-20 06:52:21 +00:00
|
|
|
virtual bool hasReservedSpillSlot(const MachineFunction &MF, unsigned Reg,
|
2009-07-09 06:53:48 +00:00
|
|
|
int &FrameIdx) const {
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2012-04-23 21:39:35 +00:00
|
|
|
/// trackLivenessAfterRegAlloc - returns true if the live-ins should be tracked
|
|
|
|
/// after register allocation.
|
|
|
|
virtual bool trackLivenessAfterRegAlloc(const MachineFunction &MF) const {
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2009-07-09 06:53:48 +00:00
|
|
|
/// needsStackRealignment - true if storage within the function requires the
|
|
|
|
/// stack pointer to be aligned more than the normal calling convention calls
|
|
|
|
/// for.
|
2008-06-26 01:51:13 +00:00
|
|
|
virtual bool needsStackRealignment(const MachineFunction &MF) const {
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2010-08-19 23:52:25 +00:00
|
|
|
/// getFrameIndexInstrOffset - Get the offset from the referenced frame
|
2011-02-02 00:46:09 +00:00
|
|
|
/// index in the instruction, if there is one.
|
2010-08-26 21:56:30 +00:00
|
|
|
virtual int64_t getFrameIndexInstrOffset(const MachineInstr *MI,
|
|
|
|
int Idx) const {
|
2010-08-19 23:52:25 +00:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2010-08-17 18:13:53 +00:00
|
|
|
/// needsFrameBaseReg - Returns true if the instruction's frame index
|
|
|
|
/// reference would be better served by a base register other than FP
|
|
|
|
/// or SP. Used by LocalStackFrameAllocation to determine which frame index
|
|
|
|
/// references it should create new base registers for.
|
2010-08-24 21:19:33 +00:00
|
|
|
virtual bool needsFrameBaseReg(MachineInstr *MI, int64_t Offset) const {
|
2010-08-17 18:13:53 +00:00
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2010-08-17 22:41:55 +00:00
|
|
|
/// materializeFrameBaseRegister - Insert defining instruction(s) for
|
|
|
|
/// BaseReg to be a pointer to FrameIdx before insertion point I.
|
2010-12-17 23:09:14 +00:00
|
|
|
virtual void materializeFrameBaseRegister(MachineBasicBlock *MBB,
|
2010-08-19 23:52:25 +00:00
|
|
|
unsigned BaseReg, int FrameIdx,
|
|
|
|
int64_t Offset) const {
|
2012-02-05 22:14:15 +00:00
|
|
|
llvm_unreachable("materializeFrameBaseRegister does not exist on this "
|
|
|
|
"target");
|
2010-08-17 22:41:55 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/// resolveFrameIndex - Resolve a frame index operand of an instruction
|
|
|
|
/// to reference the indicated base register plus offset instead.
|
|
|
|
virtual void resolveFrameIndex(MachineBasicBlock::iterator I,
|
|
|
|
unsigned BaseReg, int64_t Offset) const {
|
2012-02-05 22:14:15 +00:00
|
|
|
llvm_unreachable("resolveFrameIndex does not exist on this target");
|
2010-08-17 22:41:55 +00:00
|
|
|
}
|
|
|
|
|
2010-08-19 23:52:25 +00:00
|
|
|
/// isFrameOffsetLegal - Determine whether a given offset immediate is
|
|
|
|
/// encodable to resolve a frame index.
|
|
|
|
virtual bool isFrameOffsetLegal(const MachineInstr *MI,
|
|
|
|
int64_t Offset) const {
|
2012-02-05 22:14:15 +00:00
|
|
|
llvm_unreachable("isFrameOffsetLegal does not exist on this target");
|
2010-08-18 17:57:37 +00:00
|
|
|
}
|
2010-08-17 22:41:55 +00:00
|
|
|
|
2002-12-28 20:10:23 +00:00
|
|
|
/// eliminateCallFramePseudoInstr - This method is called during prolog/epilog
|
|
|
|
/// code insertion to eliminate call frame setup and destroy pseudo
|
|
|
|
/// instructions (but only if the Target is using them). It is responsible
|
|
|
|
/// for eliminating these instructions, replacing them with concrete
|
|
|
|
/// instructions. This method need only be implemented if using call frame
|
2004-07-27 03:04:30 +00:00
|
|
|
/// setup/destroy pseudo instructions.
|
2002-12-28 20:10:23 +00:00
|
|
|
///
|
2005-04-21 20:59:05 +00:00
|
|
|
virtual void
|
2004-02-14 19:49:05 +00:00
|
|
|
eliminateCallFramePseudoInstr(MachineFunction &MF,
|
|
|
|
MachineBasicBlock &MBB,
|
|
|
|
MachineBasicBlock::iterator MI) const {
|
2012-02-05 22:14:15 +00:00
|
|
|
llvm_unreachable("Call Frame Pseudo Instructions do not exist on this "
|
|
|
|
"target!");
|
2002-12-28 20:10:23 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2009-10-19 22:27:30 +00:00
|
|
|
/// saveScavengerRegister - Spill the register so it can be used by the
|
|
|
|
/// register scavenger. Return true if the register was spilled, false
|
|
|
|
/// otherwise. If this function does not spill the register, the scavenger
|
2009-10-05 22:30:23 +00:00
|
|
|
/// will instead spill it to the emergency spill slot.
|
|
|
|
///
|
|
|
|
virtual bool saveScavengerRegister(MachineBasicBlock &MBB,
|
|
|
|
MachineBasicBlock::iterator I,
|
2009-10-19 22:27:30 +00:00
|
|
|
MachineBasicBlock::iterator &UseMI,
|
2009-10-05 22:30:23 +00:00
|
|
|
const TargetRegisterClass *RC,
|
2009-11-21 02:32:35 +00:00
|
|
|
unsigned Reg) const {
|
|
|
|
return false;
|
|
|
|
}
|
2009-10-05 22:30:23 +00:00
|
|
|
|
2002-12-28 20:10:23 +00:00
|
|
|
/// eliminateFrameIndex - This method must be overriden to eliminate abstract
|
|
|
|
/// frame indices from instructions which may use them. The instruction
|
|
|
|
/// referenced by the iterator contains an MO_FrameIndex operand which must be
|
|
|
|
/// eliminated by this method. This method may modify or replace the
|
2010-01-13 01:39:38 +00:00
|
|
|
/// specified instruction, as long as it keeps the iterator pointing at the
|
2007-05-01 08:58:27 +00:00
|
|
|
/// finished product. SPAdj is the SP adjustment due to call frame setup
|
2008-10-20 11:23:18 +00:00
|
|
|
/// instruction.
|
2010-08-26 23:32:16 +00:00
|
|
|
virtual void eliminateFrameIndex(MachineBasicBlock::iterator MI,
|
|
|
|
int SPAdj, RegScavenger *RS=NULL) const = 0;
|
2002-12-28 20:10:23 +00:00
|
|
|
|
2006-03-28 13:48:33 +00:00
|
|
|
//===--------------------------------------------------------------------===//
|
|
|
|
/// Debug information queries.
|
2009-10-01 20:45:06 +00:00
|
|
|
|
2006-03-28 13:48:33 +00:00
|
|
|
/// getFrameRegister - This method should return the register used as a base
|
2006-04-07 16:34:46 +00:00
|
|
|
/// for values allocated in the current stack frame.
|
2009-11-12 21:00:03 +00:00
|
|
|
virtual unsigned getFrameRegister(const MachineFunction &MF) const = 0;
|
2008-01-31 03:37:28 +00:00
|
|
|
|
2011-06-30 23:20:32 +00:00
|
|
|
/// getCompactUnwindRegNum - This function maps the register to the number for
|
|
|
|
/// compact unwind encoding. Return -1 if the register isn't valid.
|
2011-07-06 20:33:48 +00:00
|
|
|
virtual int getCompactUnwindRegNum(unsigned, bool) const {
|
2011-06-30 23:20:32 +00:00
|
|
|
return -1;
|
|
|
|
}
|
2002-10-25 23:00:40 +00:00
|
|
|
};
|
|
|
|
|
2009-05-03 18:32:42 +00:00
|
|
|
|
2007-02-01 05:32:05 +00:00
|
|
|
// This is useful when building IndexedMaps keyed on virtual registers
|
2009-09-06 08:55:57 +00:00
|
|
|
struct VirtReg2IndexFunctor : public std::unary_function<unsigned, unsigned> {
|
2004-02-25 21:55:45 +00:00
|
|
|
unsigned operator()(unsigned Reg) const {
|
2011-01-08 23:11:07 +00:00
|
|
|
return TargetRegisterInfo::virtReg2Index(Reg);
|
2004-02-25 21:55:45 +00:00
|
|
|
}
|
|
|
|
};
|
|
|
|
|
2011-01-09 03:05:53 +00:00
|
|
|
/// PrintReg - Helper class for printing registers on a raw_ostream.
|
|
|
|
/// Prints virtual and physical registers with or without a TRI instance.
|
|
|
|
///
|
|
|
|
/// The format is:
|
2011-01-09 19:45:45 +00:00
|
|
|
/// %noreg - NoRegister
|
|
|
|
/// %vreg5 - a virtual register.
|
|
|
|
/// %vreg5:sub_8bit - a virtual register with sub-register index (with TRI).
|
|
|
|
/// %EAX - a physical register
|
|
|
|
/// %physreg17 - a physical register when no TRI instance given.
|
2011-01-09 03:05:53 +00:00
|
|
|
///
|
|
|
|
/// Usage: OS << PrintReg(Reg, TRI) << '\n';
|
|
|
|
///
|
|
|
|
class PrintReg {
|
|
|
|
const TargetRegisterInfo *TRI;
|
|
|
|
unsigned Reg;
|
|
|
|
unsigned SubIdx;
|
|
|
|
public:
|
|
|
|
PrintReg(unsigned reg, const TargetRegisterInfo *tri = 0, unsigned subidx = 0)
|
|
|
|
: TRI(tri), Reg(reg), SubIdx(subidx) {}
|
|
|
|
void print(raw_ostream&) const;
|
|
|
|
};
|
|
|
|
|
|
|
|
static inline raw_ostream &operator<<(raw_ostream &OS, const PrintReg &PR) {
|
|
|
|
PR.print(OS);
|
|
|
|
return OS;
|
|
|
|
}
|
|
|
|
|
2003-11-11 22:41:34 +00:00
|
|
|
} // End llvm namespace
|
|
|
|
|
2002-10-25 23:00:40 +00:00
|
|
|
#endif
|