2005-01-07 07:44:22 +00:00
|
|
|
//===-- llvm/Target/TargetLowering.h - Target Lowering Info -----*- C++ -*-===//
|
2005-04-21 20:59:05 +00:00
|
|
|
//
|
2005-01-07 07:44:22 +00:00
|
|
|
// The LLVM Compiler Infrastructure
|
|
|
|
//
|
|
|
|
// This file was developed by the LLVM research group and is distributed under
|
|
|
|
// the University of Illinois Open Source License. See LICENSE.TXT for details.
|
2005-04-21 20:59:05 +00:00
|
|
|
//
|
2005-01-07 07:44:22 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
//
|
|
|
|
// This file describes how to lower LLVM code to machine code. This has two
|
|
|
|
// main components:
|
|
|
|
//
|
|
|
|
// 1. Which ValueTypes are natively supported by the target.
|
|
|
|
// 2. Which operations are supported for supported ValueTypes.
|
2005-07-19 04:52:44 +00:00
|
|
|
// 3. Cost thresholds for alternative implementations of certain operations.
|
2005-01-07 07:44:22 +00:00
|
|
|
//
|
|
|
|
// In addition it has a few other components, like information about FP
|
|
|
|
// immediates.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
|
|
|
#ifndef LLVM_TARGET_TARGETLOWERING_H
|
|
|
|
#define LLVM_TARGET_TARGETLOWERING_H
|
|
|
|
|
|
|
|
#include "llvm/Type.h"
|
2006-02-16 21:11:51 +00:00
|
|
|
#include "llvm/CodeGen/SelectionDAGNodes.h"
|
2006-04-04 00:25:10 +00:00
|
|
|
#include <map>
|
2005-01-07 07:44:22 +00:00
|
|
|
|
|
|
|
namespace llvm {
|
2005-07-05 19:57:53 +00:00
|
|
|
class Value;
|
2005-01-07 07:44:22 +00:00
|
|
|
class Function;
|
|
|
|
class TargetMachine;
|
|
|
|
class TargetData;
|
|
|
|
class TargetRegisterClass;
|
|
|
|
class SDNode;
|
|
|
|
class SDOperand;
|
|
|
|
class SelectionDAG;
|
2005-08-26 21:06:40 +00:00
|
|
|
class MachineBasicBlock;
|
|
|
|
class MachineInstr;
|
2005-01-07 07:44:22 +00:00
|
|
|
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
/// TargetLowering - This class defines information used to lower LLVM code to
|
|
|
|
/// legal SelectionDAG operators that the target instruction selector can accept
|
|
|
|
/// natively.
|
|
|
|
///
|
|
|
|
/// This class also defines callbacks that targets must implement to lower
|
|
|
|
/// target-specific constructs to SelectionDAG operators.
|
|
|
|
///
|
|
|
|
class TargetLowering {
|
|
|
|
public:
|
2005-01-16 07:27:49 +00:00
|
|
|
/// LegalizeAction - This enum indicates whether operations are valid for a
|
|
|
|
/// target, and if not, what action should be used to make them valid.
|
|
|
|
enum LegalizeAction {
|
|
|
|
Legal, // The target natively supports this operation.
|
|
|
|
Promote, // This operation should be executed in a larger type.
|
|
|
|
Expand, // Try to expand this to other ops, otherwise use a libcall.
|
2006-02-22 16:23:43 +00:00
|
|
|
Custom // Use the LowerOperation hook to implement custom lowering.
|
2005-01-16 07:27:49 +00:00
|
|
|
};
|
|
|
|
|
2005-01-19 03:36:03 +00:00
|
|
|
enum OutOfRangeShiftAmount {
|
|
|
|
Undefined, // Oversized shift amounts are undefined (default).
|
|
|
|
Mask, // Shift amounts are auto masked (anded) to value size.
|
2006-02-22 16:23:43 +00:00
|
|
|
Extend // Oversized shift pulls in zeros or sign bits.
|
2005-01-19 03:36:03 +00:00
|
|
|
};
|
|
|
|
|
2005-04-07 19:41:18 +00:00
|
|
|
enum SetCCResultValue {
|
|
|
|
UndefinedSetCCResult, // SetCC returns a garbage/unknown extend.
|
|
|
|
ZeroOrOneSetCCResult, // SetCC returns a zero extended result.
|
2006-02-22 16:23:43 +00:00
|
|
|
ZeroOrNegativeOneSetCCResult // SetCC returns a sign extended result.
|
2005-04-07 19:41:18 +00:00
|
|
|
};
|
|
|
|
|
2006-01-25 09:09:02 +00:00
|
|
|
enum SchedPreference {
|
|
|
|
SchedulingForLatency, // Scheduling for shortest total latency.
|
2006-02-22 16:23:43 +00:00
|
|
|
SchedulingForRegPressure // Scheduling for lowest register pressure.
|
2006-01-25 09:09:02 +00:00
|
|
|
};
|
|
|
|
|
2005-01-07 07:44:22 +00:00
|
|
|
TargetLowering(TargetMachine &TM);
|
2005-01-16 07:27:49 +00:00
|
|
|
virtual ~TargetLowering();
|
2005-01-07 07:44:22 +00:00
|
|
|
|
|
|
|
TargetMachine &getTargetMachine() const { return TM; }
|
2006-05-03 01:29:57 +00:00
|
|
|
const TargetData *getTargetData() const { return TD; }
|
2005-04-21 20:59:05 +00:00
|
|
|
|
2005-01-07 07:44:22 +00:00
|
|
|
bool isLittleEndian() const { return IsLittleEndian; }
|
|
|
|
MVT::ValueType getPointerTy() const { return PointerTy; }
|
2005-01-16 23:59:30 +00:00
|
|
|
MVT::ValueType getShiftAmountTy() const { return ShiftAmountTy; }
|
2005-01-19 03:36:03 +00:00
|
|
|
OutOfRangeShiftAmount getShiftAmountFlavor() const {return ShiftAmtHandling; }
|
2005-01-16 23:59:30 +00:00
|
|
|
|
2005-05-12 02:02:21 +00:00
|
|
|
/// isSetCCExpensive - Return true if the setcc operation is expensive for
|
|
|
|
/// this target.
|
|
|
|
bool isSetCCExpensive() const { return SetCCIsExpensive; }
|
2005-10-20 02:14:14 +00:00
|
|
|
|
2005-10-21 00:02:42 +00:00
|
|
|
/// isIntDivCheap() - Return true if integer divide is usually cheaper than
|
2005-10-20 02:14:14 +00:00
|
|
|
/// a sequence of several shifts, adds, and multiplies for this target.
|
2005-10-21 00:02:42 +00:00
|
|
|
bool isIntDivCheap() const { return IntDivIsCheap; }
|
2005-05-12 02:02:21 +00:00
|
|
|
|
2005-10-21 00:02:42 +00:00
|
|
|
/// isPow2DivCheap() - Return true if pow2 div is cheaper than a chain of
|
|
|
|
/// srl/add/sra.
|
|
|
|
bool isPow2DivCheap() const { return Pow2DivIsCheap; }
|
|
|
|
|
2005-04-07 19:41:18 +00:00
|
|
|
/// getSetCCResultTy - Return the ValueType of the result of setcc operations.
|
|
|
|
///
|
|
|
|
MVT::ValueType getSetCCResultTy() const { return SetCCResultTy; }
|
|
|
|
|
|
|
|
/// getSetCCResultContents - For targets without boolean registers, this flag
|
|
|
|
/// returns information about the contents of the high-bits in the setcc
|
|
|
|
/// result register.
|
|
|
|
SetCCResultValue getSetCCResultContents() const { return SetCCResultContents;}
|
|
|
|
|
2006-01-25 09:09:02 +00:00
|
|
|
/// getSchedulingPreference - Return target scheduling preference.
|
|
|
|
SchedPreference getSchedulingPreference() const {
|
|
|
|
return SchedPreferenceInfo;
|
|
|
|
}
|
|
|
|
|
2005-01-16 23:59:30 +00:00
|
|
|
/// getRegClassFor - Return the register class that should be used for the
|
|
|
|
/// specified value type. This may only be called on legal types.
|
2005-01-16 07:27:49 +00:00
|
|
|
TargetRegisterClass *getRegClassFor(MVT::ValueType VT) const {
|
2005-01-07 07:44:22 +00:00
|
|
|
TargetRegisterClass *RC = RegClassForVT[VT];
|
|
|
|
assert(RC && "This value type is not natively supported!");
|
|
|
|
return RC;
|
|
|
|
}
|
2005-09-27 22:13:36 +00:00
|
|
|
|
2005-08-24 16:34:59 +00:00
|
|
|
/// isTypeLegal - Return true if the target has native support for the
|
2005-01-16 01:10:58 +00:00
|
|
|
/// specified value type. This means that it has a register that directly
|
|
|
|
/// holds it without promotions or expansions.
|
2005-08-24 16:34:59 +00:00
|
|
|
bool isTypeLegal(MVT::ValueType VT) const {
|
2005-01-07 07:44:22 +00:00
|
|
|
return RegClassForVT[VT] != 0;
|
|
|
|
}
|
2005-01-16 01:10:58 +00:00
|
|
|
|
2006-01-29 08:40:37 +00:00
|
|
|
class ValueTypeActionImpl {
|
|
|
|
/// ValueTypeActions - This is a bitvector that contains two bits for each
|
|
|
|
/// value type, where the two bits correspond to the LegalizeAction enum.
|
|
|
|
/// This can be queried with "getTypeAction(VT)".
|
|
|
|
uint32_t ValueTypeActions[2];
|
|
|
|
public:
|
|
|
|
ValueTypeActionImpl() {
|
|
|
|
ValueTypeActions[0] = ValueTypeActions[1] = 0;
|
|
|
|
}
|
|
|
|
ValueTypeActionImpl(const ValueTypeActionImpl &RHS) {
|
|
|
|
ValueTypeActions[0] = RHS.ValueTypeActions[0];
|
|
|
|
ValueTypeActions[1] = RHS.ValueTypeActions[1];
|
|
|
|
}
|
|
|
|
|
|
|
|
LegalizeAction getTypeAction(MVT::ValueType VT) const {
|
|
|
|
return (LegalizeAction)((ValueTypeActions[VT>>4] >> ((2*VT) & 31)) & 3);
|
|
|
|
}
|
|
|
|
void setTypeAction(MVT::ValueType VT, LegalizeAction Action) {
|
|
|
|
assert(unsigned(VT >> 4) <
|
|
|
|
sizeof(ValueTypeActions)/sizeof(ValueTypeActions[0]));
|
|
|
|
ValueTypeActions[VT>>4] |= Action << ((VT*2) & 31);
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
const ValueTypeActionImpl &getValueTypeActions() const {
|
|
|
|
return ValueTypeActions;
|
|
|
|
}
|
|
|
|
|
2005-01-16 01:10:58 +00:00
|
|
|
/// getTypeAction - Return how we should legalize values of this type, either
|
2005-01-16 07:27:49 +00:00
|
|
|
/// it is already legal (return 'Legal') or we need to promote it to a larger
|
|
|
|
/// type (return 'Promote'), or we need to expand it into multiple registers
|
|
|
|
/// of smaller integer type (return 'Expand'). 'Custom' is not an option.
|
|
|
|
LegalizeAction getTypeAction(MVT::ValueType VT) const {
|
2006-01-29 08:40:37 +00:00
|
|
|
return ValueTypeActions.getTypeAction(VT);
|
2005-01-16 01:10:58 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/// getTypeToTransformTo - For types supported by the target, this is an
|
|
|
|
/// identity function. For types that must be promoted to larger types, this
|
|
|
|
/// returns the larger type to promote to. For types that are larger than the
|
|
|
|
/// largest integer register, this contains one step in the expansion to get
|
|
|
|
/// to the smaller register.
|
2005-01-16 07:27:49 +00:00
|
|
|
MVT::ValueType getTypeToTransformTo(MVT::ValueType VT) const {
|
2005-01-16 01:10:58 +00:00
|
|
|
return TransformToType[VT];
|
|
|
|
}
|
2006-04-04 00:25:10 +00:00
|
|
|
|
2006-03-31 00:28:23 +00:00
|
|
|
/// getPackedTypeBreakdown - Packed types are broken down into some number of
|
2006-05-17 18:22:14 +00:00
|
|
|
/// legal first class types. For example, <8 x float> maps to 2 MVT::v4f32
|
2006-03-31 00:28:23 +00:00
|
|
|
/// with Altivec or SSE1, or 8 promoted MVT::f64 values with the X86 FP stack.
|
|
|
|
/// Similarly, <2 x long> turns into 4 MVT::i32 values with both PPC and X86.
|
|
|
|
///
|
2006-03-31 00:46:36 +00:00
|
|
|
/// This method returns the number of registers needed, and the VT for each
|
|
|
|
/// register. It also returns the VT of the PackedType elements before they
|
|
|
|
/// are promoted/expanded.
|
2006-03-31 00:28:23 +00:00
|
|
|
///
|
2006-03-31 00:46:36 +00:00
|
|
|
unsigned getPackedTypeBreakdown(const PackedType *PTy,
|
|
|
|
MVT::ValueType &PTyElementVT,
|
|
|
|
MVT::ValueType &PTyLegalElementVT) const;
|
2006-03-31 00:28:23 +00:00
|
|
|
|
2005-01-07 07:44:22 +00:00
|
|
|
typedef std::vector<double>::const_iterator legal_fpimm_iterator;
|
|
|
|
legal_fpimm_iterator legal_fpimm_begin() const {
|
|
|
|
return LegalFPImmediates.begin();
|
|
|
|
}
|
|
|
|
legal_fpimm_iterator legal_fpimm_end() const {
|
|
|
|
return LegalFPImmediates.end();
|
|
|
|
}
|
2006-04-04 17:21:22 +00:00
|
|
|
|
|
|
|
/// isShuffleMaskLegal - Targets can use this to indicate that they only
|
|
|
|
/// support *some* VECTOR_SHUFFLE operations, those with specific masks.
|
|
|
|
/// By default, if a target supports the VECTOR_SHUFFLE node, all mask values
|
|
|
|
/// are assumed to be legal.
|
|
|
|
virtual bool isShuffleMaskLegal(SDOperand Mask, MVT::ValueType VT) const {
|
|
|
|
return true;
|
|
|
|
}
|
2005-01-16 07:27:49 +00:00
|
|
|
|
2006-04-20 08:54:13 +00:00
|
|
|
/// isVectorClearMaskLegal - Similar to isShuffleMaskLegal. This is
|
|
|
|
/// used by Targets can use this to indicate if there is a suitable
|
|
|
|
/// VECTOR_SHUFFLE that can be used to replace a VAND with a constant
|
|
|
|
/// pool entry.
|
|
|
|
virtual bool isVectorClearMaskLegal(std::vector<SDOperand> &BVOps,
|
|
|
|
MVT::ValueType EVT,
|
|
|
|
SelectionDAG &DAG) const {
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2005-08-24 16:34:59 +00:00
|
|
|
/// getOperationAction - Return how this operation should be treated: either
|
|
|
|
/// it is legal, needs to be promoted to a larger size, needs to be
|
|
|
|
/// expanded to some other code sequence, or the target has a custom expander
|
|
|
|
/// for it.
|
2005-01-16 07:27:49 +00:00
|
|
|
LegalizeAction getOperationAction(unsigned Op, MVT::ValueType VT) const {
|
2005-04-21 20:59:05 +00:00
|
|
|
return (LegalizeAction)((OpActions[Op] >> (2*VT)) & 3);
|
2005-01-07 07:44:22 +00:00
|
|
|
}
|
2005-08-24 16:34:59 +00:00
|
|
|
|
|
|
|
/// isOperationLegal - Return true if the specified operation is legal on this
|
|
|
|
/// target.
|
|
|
|
bool isOperationLegal(unsigned Op, MVT::ValueType VT) const {
|
2006-03-05 23:49:19 +00:00
|
|
|
return getOperationAction(Op, VT) == Legal ||
|
|
|
|
getOperationAction(Op, VT) == Custom;
|
2005-01-16 07:27:49 +00:00
|
|
|
}
|
2006-03-20 00:55:52 +00:00
|
|
|
|
2005-01-16 07:27:49 +00:00
|
|
|
/// getTypeToPromoteTo - If the action for this operation is to promote, this
|
|
|
|
/// method returns the ValueType to promote to.
|
|
|
|
MVT::ValueType getTypeToPromoteTo(unsigned Op, MVT::ValueType VT) const {
|
|
|
|
assert(getOperationAction(Op, VT) == Promote &&
|
|
|
|
"This operation isn't promoted!");
|
2006-04-04 00:25:10 +00:00
|
|
|
|
|
|
|
// See if this has an explicit type specified.
|
|
|
|
std::map<std::pair<unsigned, MVT::ValueType>,
|
|
|
|
MVT::ValueType>::const_iterator PTTI =
|
|
|
|
PromoteToType.find(std::make_pair(Op, VT));
|
|
|
|
if (PTTI != PromoteToType.end()) return PTTI->second;
|
|
|
|
|
|
|
|
assert((MVT::isInteger(VT) || MVT::isFloatingPoint(VT)) &&
|
|
|
|
"Cannot autopromote this type, add it with AddPromotedToType.");
|
|
|
|
|
2005-01-16 07:27:49 +00:00
|
|
|
MVT::ValueType NVT = VT;
|
|
|
|
do {
|
|
|
|
NVT = (MVT::ValueType)(NVT+1);
|
|
|
|
assert(MVT::isInteger(NVT) == MVT::isInteger(VT) && NVT != MVT::isVoid &&
|
|
|
|
"Didn't find type to promote to!");
|
2005-08-24 16:34:59 +00:00
|
|
|
} while (!isTypeLegal(NVT) ||
|
|
|
|
getOperationAction(Op, NVT) == Promote);
|
2005-01-16 07:27:49 +00:00
|
|
|
return NVT;
|
|
|
|
}
|
|
|
|
|
|
|
|
/// getValueType - Return the MVT::ValueType corresponding to this LLVM type.
|
|
|
|
/// This is fixed by the LLVM operations except for the pointer size.
|
|
|
|
MVT::ValueType getValueType(const Type *Ty) const {
|
2005-01-07 07:44:22 +00:00
|
|
|
switch (Ty->getTypeID()) {
|
|
|
|
default: assert(0 && "Unknown type!");
|
|
|
|
case Type::VoidTyID: return MVT::isVoid;
|
|
|
|
case Type::BoolTyID: return MVT::i1;
|
|
|
|
case Type::UByteTyID:
|
|
|
|
case Type::SByteTyID: return MVT::i8;
|
|
|
|
case Type::ShortTyID:
|
|
|
|
case Type::UShortTyID: return MVT::i16;
|
|
|
|
case Type::IntTyID:
|
|
|
|
case Type::UIntTyID: return MVT::i32;
|
|
|
|
case Type::LongTyID:
|
|
|
|
case Type::ULongTyID: return MVT::i64;
|
|
|
|
case Type::FloatTyID: return MVT::f32;
|
|
|
|
case Type::DoubleTyID: return MVT::f64;
|
|
|
|
case Type::PointerTyID: return PointerTy;
|
2005-11-17 21:44:42 +00:00
|
|
|
case Type::PackedTyID: return MVT::Vector;
|
2005-01-07 07:44:22 +00:00
|
|
|
}
|
|
|
|
}
|
2005-04-21 20:59:05 +00:00
|
|
|
|
2005-01-07 07:44:22 +00:00
|
|
|
/// getNumElements - Return the number of registers that this ValueType will
|
|
|
|
/// eventually require. This is always one for all non-integer types, is
|
|
|
|
/// one for any types promoted to live in larger registers, but may be more
|
|
|
|
/// than one for types (like i64) that are split into pieces.
|
|
|
|
unsigned getNumElements(MVT::ValueType VT) const {
|
|
|
|
return NumElementsForVT[VT];
|
|
|
|
}
|
2006-03-01 04:52:55 +00:00
|
|
|
|
|
|
|
/// hasTargetDAGCombine - If true, the target has custom DAG combine
|
|
|
|
/// transformations that it can perform for the specified node.
|
|
|
|
bool hasTargetDAGCombine(ISD::NodeType NT) const {
|
|
|
|
return TargetDAGCombineArray[NT >> 3] & (1 << (NT&7));
|
|
|
|
}
|
2005-01-07 07:44:22 +00:00
|
|
|
|
2005-07-19 04:52:44 +00:00
|
|
|
/// This function returns the maximum number of store operations permitted
|
|
|
|
/// to replace a call to llvm.memset. The value is set by the target at the
|
|
|
|
/// performance threshold for such a replacement.
|
|
|
|
/// @brief Get maximum # of store operations permitted for llvm.memset
|
2006-02-14 08:38:30 +00:00
|
|
|
unsigned getMaxStoresPerMemset() const { return maxStoresPerMemset; }
|
2005-07-19 04:52:44 +00:00
|
|
|
|
|
|
|
/// This function returns the maximum number of store operations permitted
|
|
|
|
/// to replace a call to llvm.memcpy. The value is set by the target at the
|
|
|
|
/// performance threshold for such a replacement.
|
|
|
|
/// @brief Get maximum # of store operations permitted for llvm.memcpy
|
2006-02-14 08:38:30 +00:00
|
|
|
unsigned getMaxStoresPerMemcpy() const { return maxStoresPerMemcpy; }
|
2005-07-19 04:52:44 +00:00
|
|
|
|
|
|
|
/// This function returns the maximum number of store operations permitted
|
|
|
|
/// to replace a call to llvm.memmove. The value is set by the target at the
|
|
|
|
/// performance threshold for such a replacement.
|
|
|
|
/// @brief Get maximum # of store operations permitted for llvm.memmove
|
2006-02-14 08:38:30 +00:00
|
|
|
unsigned getMaxStoresPerMemmove() const { return maxStoresPerMemmove; }
|
2005-07-19 04:52:44 +00:00
|
|
|
|
2005-08-27 19:09:02 +00:00
|
|
|
/// This function returns true if the target allows unaligned memory accesses.
|
|
|
|
/// This is used, for example, in situations where an array copy/move/set is
|
|
|
|
/// converted to a sequence of store operations. It's use helps to ensure that
|
|
|
|
/// such replacements don't generate code that causes an alignment error
|
|
|
|
/// (trap) on the target machine.
|
|
|
|
/// @brief Determine if the target supports unaligned memory accesses.
|
2006-01-29 08:40:37 +00:00
|
|
|
bool allowsUnalignedMemoryAccesses() const {
|
|
|
|
return allowUnalignedMemoryAccesses;
|
|
|
|
}
|
2005-09-27 22:13:36 +00:00
|
|
|
|
|
|
|
/// usesUnderscoreSetJmpLongJmp - Determine if we should use _setjmp or setjmp
|
|
|
|
/// to implement llvm.setjmp.
|
|
|
|
bool usesUnderscoreSetJmpLongJmp() const {
|
|
|
|
return UseUnderscoreSetJmpLongJmp;
|
|
|
|
}
|
2006-01-13 17:47:52 +00:00
|
|
|
|
|
|
|
/// getStackPointerRegisterToSaveRestore - If a physical register, this
|
|
|
|
/// specifies the register that llvm.savestack/llvm.restorestack should save
|
|
|
|
/// and restore.
|
|
|
|
unsigned getStackPointerRegisterToSaveRestore() const {
|
|
|
|
return StackPointerRegisterToSaveRestore;
|
|
|
|
}
|
2005-07-19 04:52:44 +00:00
|
|
|
|
2006-01-30 04:08:18 +00:00
|
|
|
//===--------------------------------------------------------------------===//
|
|
|
|
// TargetLowering Optimization Methods
|
|
|
|
//
|
|
|
|
|
2006-02-16 21:11:51 +00:00
|
|
|
/// TargetLoweringOpt - A convenience struct that encapsulates a DAG, and two
|
|
|
|
/// SDOperands for returning information from TargetLowering to its clients
|
|
|
|
/// that want to combine
|
|
|
|
struct TargetLoweringOpt {
|
|
|
|
SelectionDAG &DAG;
|
|
|
|
SDOperand Old;
|
|
|
|
SDOperand New;
|
|
|
|
|
2006-02-17 18:06:19 +00:00
|
|
|
TargetLoweringOpt(SelectionDAG &InDAG) : DAG(InDAG) {}
|
2006-02-16 21:11:51 +00:00
|
|
|
|
|
|
|
bool CombineTo(SDOperand O, SDOperand N) {
|
|
|
|
Old = O;
|
|
|
|
New = N;
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
/// ShrinkDemandedConstant - Check to see if the specified operand of the
|
|
|
|
/// specified instruction is a constant integer. If so, check to see if there
|
|
|
|
/// are any bits set in the constant that are not demanded. If so, shrink the
|
|
|
|
/// constant and return true.
|
|
|
|
bool ShrinkDemandedConstant(SDOperand Op, uint64_t Demanded);
|
|
|
|
};
|
|
|
|
|
2006-01-30 04:08:18 +00:00
|
|
|
/// MaskedValueIsZero - Return true if 'Op & Mask' is known to be zero. We
|
|
|
|
/// use this predicate to simplify operations downstream. Op and Mask are
|
2006-02-16 21:11:51 +00:00
|
|
|
/// known to be the same type.
|
|
|
|
bool MaskedValueIsZero(SDOperand Op, uint64_t Mask, unsigned Depth = 0)
|
|
|
|
const;
|
|
|
|
|
|
|
|
/// ComputeMaskedBits - Determine which of the bits specified in Mask are
|
|
|
|
/// known to be either zero or one and return them in the KnownZero/KnownOne
|
|
|
|
/// bitsets. This code only analyzes bits in Mask, in order to short-circuit
|
|
|
|
/// processing. Targets can implement the computeMaskedBitsForTargetNode
|
|
|
|
/// method, to allow target nodes to be understood.
|
|
|
|
void ComputeMaskedBits(SDOperand Op, uint64_t Mask, uint64_t &KnownZero,
|
|
|
|
uint64_t &KnownOne, unsigned Depth = 0) const;
|
|
|
|
|
|
|
|
/// SimplifyDemandedBits - Look at Op. At this point, we know that only the
|
|
|
|
/// DemandedMask bits of the result of Op are ever used downstream. If we can
|
|
|
|
/// use this information to simplify Op, create a new simplified DAG node and
|
|
|
|
/// return true, returning the original and new nodes in Old and New.
|
|
|
|
/// Otherwise, analyze the expression and return a mask of KnownOne and
|
|
|
|
/// KnownZero bits for the expression (used to simplify the caller).
|
|
|
|
/// The KnownZero/One bits may only be accurate for those bits in the
|
|
|
|
/// DemandedMask.
|
|
|
|
bool SimplifyDemandedBits(SDOperand Op, uint64_t DemandedMask,
|
|
|
|
uint64_t &KnownZero, uint64_t &KnownOne,
|
|
|
|
TargetLoweringOpt &TLO, unsigned Depth = 0) const;
|
2006-02-03 22:24:05 +00:00
|
|
|
|
2006-03-01 04:52:55 +00:00
|
|
|
/// computeMaskedBitsForTargetNode - Determine which of the bits specified in
|
|
|
|
/// Mask are known to be either zero or one and return them in the
|
|
|
|
/// KnownZero/KnownOne bitsets.
|
|
|
|
virtual void computeMaskedBitsForTargetNode(const SDOperand Op,
|
|
|
|
uint64_t Mask,
|
|
|
|
uint64_t &KnownZero,
|
|
|
|
uint64_t &KnownOne,
|
|
|
|
unsigned Depth = 0) const;
|
2006-03-13 23:18:16 +00:00
|
|
|
|
2006-05-06 09:26:22 +00:00
|
|
|
/// ComputeNumSignBits - Return the number of times the sign bit of the
|
|
|
|
/// register is replicated into the other bits. We know that at least 1 bit
|
|
|
|
/// is always equal to the sign bit (itself), but other cases can give us
|
|
|
|
/// information. For example, immediately after an "SRA X, 2", we know that
|
|
|
|
/// the top 3 bits are all equal to each other, so we return 3.
|
|
|
|
unsigned ComputeNumSignBits(SDOperand Op, unsigned Depth = 0) const;
|
|
|
|
|
|
|
|
/// ComputeNumSignBitsForTargetNode - This method can be implemented by
|
|
|
|
/// targets that want to expose additional information about sign bits to the
|
|
|
|
/// DAG Combiner.
|
|
|
|
virtual unsigned ComputeNumSignBitsForTargetNode(SDOperand Op,
|
|
|
|
unsigned Depth = 0) const;
|
|
|
|
|
2006-03-01 04:52:55 +00:00
|
|
|
struct DAGCombinerInfo {
|
|
|
|
void *DC; // The DAG Combiner object.
|
|
|
|
bool BeforeLegalize;
|
|
|
|
public:
|
|
|
|
SelectionDAG &DAG;
|
|
|
|
|
|
|
|
DAGCombinerInfo(SelectionDAG &dag, bool bl, void *dc)
|
|
|
|
: DC(dc), BeforeLegalize(bl), DAG(dag) {}
|
|
|
|
|
|
|
|
bool isBeforeLegalize() const { return BeforeLegalize; }
|
|
|
|
|
|
|
|
void AddToWorklist(SDNode *N);
|
|
|
|
SDOperand CombineTo(SDNode *N, const std::vector<SDOperand> &To);
|
|
|
|
SDOperand CombineTo(SDNode *N, SDOperand Res);
|
|
|
|
SDOperand CombineTo(SDNode *N, SDOperand Res0, SDOperand Res1);
|
|
|
|
};
|
|
|
|
|
|
|
|
/// PerformDAGCombine - This method will be invoked for all target nodes and
|
|
|
|
/// for any target-independent nodes that the target has registered with
|
|
|
|
/// invoke it for.
|
|
|
|
///
|
|
|
|
/// The semantics are as follows:
|
|
|
|
/// Return Value:
|
|
|
|
/// SDOperand.Val == 0 - No change was made
|
|
|
|
/// SDOperand.Val == N - N was replaced, is dead, and is already handled.
|
|
|
|
/// otherwise - N should be replaced by the returned Operand.
|
|
|
|
///
|
|
|
|
/// In addition, methods provided by DAGCombinerInfo may be used to perform
|
|
|
|
/// more complex transformations.
|
|
|
|
///
|
|
|
|
virtual SDOperand PerformDAGCombine(SDNode *N, DAGCombinerInfo &DCI) const;
|
|
|
|
|
2005-01-07 07:44:22 +00:00
|
|
|
//===--------------------------------------------------------------------===//
|
|
|
|
// TargetLowering Configuration Methods - These methods should be invoked by
|
|
|
|
// the derived class constructor to configure this object for the target.
|
|
|
|
//
|
|
|
|
|
|
|
|
protected:
|
|
|
|
|
2005-01-16 23:59:30 +00:00
|
|
|
/// setShiftAmountType - Describe the type that should be used for shift
|
|
|
|
/// amounts. This type defaults to the pointer type.
|
|
|
|
void setShiftAmountType(MVT::ValueType VT) { ShiftAmountTy = VT; }
|
|
|
|
|
|
|
|
/// setSetCCResultType - Describe the type that shoudl be used as the result
|
|
|
|
/// of a setcc operation. This defaults to the pointer type.
|
|
|
|
void setSetCCResultType(MVT::ValueType VT) { SetCCResultTy = VT; }
|
|
|
|
|
2005-04-07 19:41:18 +00:00
|
|
|
/// setSetCCResultContents - Specify how the target extends the result of a
|
|
|
|
/// setcc operation in a register.
|
|
|
|
void setSetCCResultContents(SetCCResultValue Ty) { SetCCResultContents = Ty; }
|
|
|
|
|
2006-01-25 09:09:02 +00:00
|
|
|
/// setSchedulingPreference - Specify the target scheduling preference.
|
|
|
|
void setSchedulingPreference(SchedPreference Pref) {
|
|
|
|
SchedPreferenceInfo = Pref;
|
|
|
|
}
|
|
|
|
|
2005-01-19 03:36:03 +00:00
|
|
|
/// setShiftAmountFlavor - Describe how the target handles out of range shift
|
|
|
|
/// amounts.
|
|
|
|
void setShiftAmountFlavor(OutOfRangeShiftAmount OORSA) {
|
|
|
|
ShiftAmtHandling = OORSA;
|
|
|
|
}
|
2005-04-21 20:59:05 +00:00
|
|
|
|
2005-09-27 22:13:36 +00:00
|
|
|
/// setUseUnderscoreSetJmpLongJmp - Indicate whether this target prefers to
|
|
|
|
/// use _setjmp and _longjmp to or implement llvm.setjmp/llvm.longjmp or
|
|
|
|
/// the non _ versions. Defaults to false.
|
|
|
|
void setUseUnderscoreSetJmpLongJmp(bool Val) {
|
|
|
|
UseUnderscoreSetJmpLongJmp = Val;
|
|
|
|
}
|
|
|
|
|
2006-01-13 17:47:52 +00:00
|
|
|
/// setStackPointerRegisterToSaveRestore - If set to a physical register, this
|
|
|
|
/// specifies the register that llvm.savestack/llvm.restorestack should save
|
|
|
|
/// and restore.
|
|
|
|
void setStackPointerRegisterToSaveRestore(unsigned R) {
|
|
|
|
StackPointerRegisterToSaveRestore = R;
|
|
|
|
}
|
|
|
|
|
2005-05-12 02:02:21 +00:00
|
|
|
/// setSetCCIxExpensive - This is a short term hack for targets that codegen
|
|
|
|
/// setcc as a conditional branch. This encourages the code generator to fold
|
|
|
|
/// setcc operations into other operations if possible.
|
|
|
|
void setSetCCIsExpensive() { SetCCIsExpensive = true; }
|
|
|
|
|
2005-10-21 00:02:42 +00:00
|
|
|
/// setIntDivIsCheap - Tells the code generator that integer divide is
|
2005-10-20 02:14:14 +00:00
|
|
|
/// expensive, and if possible, should be replaced by an alternate sequence
|
|
|
|
/// of instructions not containing an integer divide.
|
2005-10-21 00:02:42 +00:00
|
|
|
void setIntDivIsCheap(bool isCheap = true) { IntDivIsCheap = isCheap; }
|
|
|
|
|
|
|
|
/// setPow2DivIsCheap - Tells the code generator that it shouldn't generate
|
|
|
|
/// srl/add/sra for a signed divide by power of two, and let the target handle
|
|
|
|
/// it.
|
|
|
|
void setPow2DivIsCheap(bool isCheap = true) { Pow2DivIsCheap = isCheap; }
|
2005-10-20 02:14:14 +00:00
|
|
|
|
2005-01-07 07:44:22 +00:00
|
|
|
/// addRegisterClass - Add the specified register class as an available
|
|
|
|
/// regclass for the specified value type. This indicates the selector can
|
|
|
|
/// handle values of that class natively.
|
|
|
|
void addRegisterClass(MVT::ValueType VT, TargetRegisterClass *RC) {
|
|
|
|
AvailableRegClasses.push_back(std::make_pair(VT, RC));
|
|
|
|
RegClassForVT[VT] = RC;
|
|
|
|
}
|
|
|
|
|
|
|
|
/// computeRegisterProperties - Once all of the register classes are added,
|
|
|
|
/// this allows us to compute derived properties we expose.
|
|
|
|
void computeRegisterProperties();
|
2005-04-21 20:59:05 +00:00
|
|
|
|
2005-01-16 07:27:49 +00:00
|
|
|
/// setOperationAction - Indicate that the specified operation does not work
|
|
|
|
/// with the specified type and indicate what to do about it.
|
|
|
|
void setOperationAction(unsigned Op, MVT::ValueType VT,
|
|
|
|
LegalizeAction Action) {
|
2006-01-29 08:40:37 +00:00
|
|
|
assert(VT < 32 && Op < sizeof(OpActions)/sizeof(OpActions[0]) &&
|
2005-01-16 07:27:49 +00:00
|
|
|
"Table isn't big enough!");
|
2006-05-24 19:21:13 +00:00
|
|
|
OpActions[Op] &= ~(uint64_t(3UL) << VT*2);
|
2006-03-01 00:58:54 +00:00
|
|
|
OpActions[Op] |= (uint64_t)Action << VT*2;
|
2005-01-07 07:44:22 +00:00
|
|
|
}
|
2006-04-04 00:25:10 +00:00
|
|
|
|
|
|
|
/// AddPromotedToType - If Opc/OrigVT is specified as being promoted, the
|
|
|
|
/// promotion code defaults to trying a larger integer/fp until it can find
|
|
|
|
/// one that works. If that default is insufficient, this method can be used
|
|
|
|
/// by the target to override the default.
|
|
|
|
void AddPromotedToType(unsigned Opc, MVT::ValueType OrigVT,
|
|
|
|
MVT::ValueType DestVT) {
|
|
|
|
PromoteToType[std::make_pair(Opc, OrigVT)] = DestVT;
|
|
|
|
}
|
2005-01-07 07:44:22 +00:00
|
|
|
|
|
|
|
/// addLegalFPImmediate - Indicate that this target can instruction select
|
|
|
|
/// the specified FP immediate natively.
|
|
|
|
void addLegalFPImmediate(double Imm) {
|
|
|
|
LegalFPImmediates.push_back(Imm);
|
|
|
|
}
|
|
|
|
|
2006-03-01 04:52:55 +00:00
|
|
|
/// setTargetDAGCombine - Targets should invoke this method for each target
|
|
|
|
/// independent node that they want to provide a custom DAG combiner for by
|
|
|
|
/// implementing the PerformDAGCombine virtual method.
|
|
|
|
void setTargetDAGCombine(ISD::NodeType NT) {
|
|
|
|
TargetDAGCombineArray[NT >> 3] |= 1 << (NT&7);
|
|
|
|
}
|
|
|
|
|
2005-01-07 07:44:22 +00:00
|
|
|
public:
|
|
|
|
|
|
|
|
//===--------------------------------------------------------------------===//
|
|
|
|
// Lowering methods - These methods must be implemented by targets so that
|
|
|
|
// the SelectionDAGLowering code knows how to lower these.
|
|
|
|
//
|
|
|
|
|
|
|
|
/// LowerArguments - This hook must be implemented to indicate how we should
|
|
|
|
/// lower the arguments for the specified function, into the specified DAG.
|
|
|
|
virtual std::vector<SDOperand>
|
2006-04-12 16:21:12 +00:00
|
|
|
LowerArguments(Function &F, SelectionDAG &DAG);
|
2005-01-07 07:44:22 +00:00
|
|
|
|
|
|
|
/// LowerCallTo - This hook lowers an abstract call to a function into an
|
2005-01-08 19:25:39 +00:00
|
|
|
/// actual call. This returns a pair of operands. The first element is the
|
|
|
|
/// return value for the function (if RetTy is not VoidTy). The second
|
|
|
|
/// element is the outgoing token chain.
|
2005-01-07 07:44:22 +00:00
|
|
|
typedef std::vector<std::pair<SDOperand, const Type*> > ArgListTy;
|
2005-01-08 19:25:39 +00:00
|
|
|
virtual std::pair<SDOperand, SDOperand>
|
2005-03-26 01:30:30 +00:00
|
|
|
LowerCallTo(SDOperand Chain, const Type *RetTy, bool isVarArg,
|
2005-05-13 18:50:42 +00:00
|
|
|
unsigned CallingConv, bool isTailCall, SDOperand Callee,
|
2006-05-16 22:52:11 +00:00
|
|
|
ArgListTy &Args, SelectionDAG &DAG);
|
2005-01-09 00:00:31 +00:00
|
|
|
|
|
|
|
/// LowerFrameReturnAddress - This hook lowers a call to llvm.returnaddress or
|
|
|
|
/// llvm.frameaddress (depending on the value of the first argument). The
|
|
|
|
/// return values are the result pointer and the resultant token chain. If
|
|
|
|
/// not implemented, both of these intrinsics will return null.
|
|
|
|
virtual std::pair<SDOperand, SDOperand>
|
|
|
|
LowerFrameReturnAddress(bool isFrameAddr, SDOperand Chain, unsigned Depth,
|
|
|
|
SelectionDAG &DAG);
|
2005-01-16 07:27:49 +00:00
|
|
|
|
2006-01-28 03:37:03 +00:00
|
|
|
/// LowerOperation - This callback is invoked for operations that are
|
|
|
|
/// unsupported by the target, which are registered to use 'custom' lowering,
|
|
|
|
/// and whose defined values are all legal.
|
2005-01-16 07:27:49 +00:00
|
|
|
/// If the target has no operations that require custom lowering, it need not
|
|
|
|
/// implement this. The default implementation of this aborts.
|
2005-05-14 05:51:05 +00:00
|
|
|
virtual SDOperand LowerOperation(SDOperand Op, SelectionDAG &DAG);
|
2005-01-19 03:36:03 +00:00
|
|
|
|
2006-01-28 03:37:03 +00:00
|
|
|
/// CustomPromoteOperation - This callback is invoked for operations that are
|
|
|
|
/// unsupported by the target, are registered to use 'custom' lowering, and
|
|
|
|
/// whose type needs to be promoted.
|
2006-01-28 03:14:31 +00:00
|
|
|
virtual SDOperand CustomPromoteOperation(SDOperand Op, SelectionDAG &DAG);
|
|
|
|
|
2005-12-21 23:15:41 +00:00
|
|
|
/// getTargetNodeName() - This method returns the name of a target specific
|
|
|
|
/// DAG node.
|
2005-12-20 06:22:03 +00:00
|
|
|
virtual const char *getTargetNodeName(unsigned Opcode) const;
|
|
|
|
|
2006-01-26 20:27:33 +00:00
|
|
|
//===--------------------------------------------------------------------===//
|
|
|
|
// Inline Asm Support hooks
|
|
|
|
//
|
|
|
|
|
2006-02-04 02:12:09 +00:00
|
|
|
enum ConstraintType {
|
2006-02-22 00:56:39 +00:00
|
|
|
C_Register, // Constraint represents a single register.
|
2006-02-04 02:12:09 +00:00
|
|
|
C_RegisterClass, // Constraint represents one or more registers.
|
2006-02-24 01:10:14 +00:00
|
|
|
C_Memory, // Memory constraint.
|
2006-02-04 02:12:09 +00:00
|
|
|
C_Other, // Something else.
|
|
|
|
C_Unknown // Unsupported constraint.
|
|
|
|
};
|
|
|
|
|
|
|
|
/// getConstraintType - Given a constraint letter, return the type of
|
|
|
|
/// constraint it is for this target.
|
2006-02-07 20:13:44 +00:00
|
|
|
virtual ConstraintType getConstraintType(char ConstraintLetter) const;
|
2006-02-04 02:12:09 +00:00
|
|
|
|
2006-02-22 00:56:39 +00:00
|
|
|
|
|
|
|
/// getRegClassForInlineAsmConstraint - Given a constraint letter (e.g. "r"),
|
|
|
|
/// return a list of registers that can be used to satisfy the constraint.
|
|
|
|
/// This should only be used for C_RegisterClass constraints.
|
2006-01-26 20:27:33 +00:00
|
|
|
virtual std::vector<unsigned>
|
2006-02-22 00:56:39 +00:00
|
|
|
getRegClassForInlineAsmConstraint(const std::string &Constraint,
|
|
|
|
MVT::ValueType VT) const;
|
|
|
|
|
|
|
|
/// getRegForInlineAsmConstraint - Given a physical register constraint (e.g.
|
|
|
|
/// {edx}), return the register number and the register class for the
|
|
|
|
/// register. This should only be used for C_Register constraints. On error,
|
|
|
|
/// this returns a register number of 0.
|
|
|
|
virtual std::pair<unsigned, const TargetRegisterClass*>
|
|
|
|
getRegForInlineAsmConstraint(const std::string &Constraint,
|
|
|
|
MVT::ValueType VT) const;
|
|
|
|
|
2006-01-26 20:27:33 +00:00
|
|
|
|
2006-02-07 20:13:44 +00:00
|
|
|
/// isOperandValidForConstraint - Return true if the specified SDOperand is
|
|
|
|
/// valid for the specified target constraint letter.
|
2006-02-04 02:12:09 +00:00
|
|
|
virtual bool isOperandValidForConstraint(SDOperand Op, char ConstraintLetter);
|
|
|
|
|
2005-08-26 20:53:09 +00:00
|
|
|
//===--------------------------------------------------------------------===//
|
|
|
|
// Scheduler hooks
|
|
|
|
//
|
|
|
|
|
|
|
|
// InsertAtEndOfBasicBlock - This method should be implemented by targets that
|
2005-08-26 20:53:44 +00:00
|
|
|
// mark instructions with the 'usesCustomDAGSchedInserter' flag. These
|
2005-08-26 20:53:09 +00:00
|
|
|
// instructions are special in various ways, which require special support to
|
|
|
|
// insert. The specified MachineInstr is created but not inserted into any
|
|
|
|
// basic blocks, and the scheduler passes ownership of it to this method.
|
|
|
|
virtual MachineBasicBlock *InsertAtEndOfBasicBlock(MachineInstr *MI,
|
|
|
|
MachineBasicBlock *MBB);
|
2005-04-21 20:59:05 +00:00
|
|
|
|
2006-03-16 21:47:42 +00:00
|
|
|
//===--------------------------------------------------------------------===//
|
|
|
|
// Loop Strength Reduction hooks
|
|
|
|
//
|
|
|
|
|
|
|
|
/// isLegalAddressImmediate - Return true if the integer value or GlobalValue
|
|
|
|
/// can be used as the offset of the target addressing mode.
|
|
|
|
virtual bool isLegalAddressImmediate(int64_t V) const;
|
|
|
|
virtual bool isLegalAddressImmediate(GlobalValue *GV) const;
|
|
|
|
|
|
|
|
typedef std::vector<unsigned>::const_iterator legal_am_scale_iterator;
|
|
|
|
legal_am_scale_iterator legal_am_scale_begin() const {
|
|
|
|
return LegalAddressScales.begin();
|
|
|
|
}
|
|
|
|
legal_am_scale_iterator legal_am_scale_end() const {
|
|
|
|
return LegalAddressScales.end();
|
|
|
|
}
|
|
|
|
|
2006-05-16 17:42:15 +00:00
|
|
|
//===--------------------------------------------------------------------===//
|
|
|
|
// Div utility functions
|
|
|
|
//
|
|
|
|
SDOperand BuildSDIV(SDNode *N, SelectionDAG &DAG,
|
2006-06-12 16:07:18 +00:00
|
|
|
std::vector<SDNode*>* Created) const;
|
2006-05-16 17:42:15 +00:00
|
|
|
SDOperand BuildUDIV(SDNode *N, SelectionDAG &DAG,
|
2006-06-12 16:07:18 +00:00
|
|
|
std::vector<SDNode*>* Created) const;
|
2006-05-16 17:42:15 +00:00
|
|
|
|
|
|
|
|
2006-03-16 21:47:42 +00:00
|
|
|
protected:
|
|
|
|
/// addLegalAddressScale - Add a integer (> 1) value which can be used as
|
|
|
|
/// scale in the target addressing mode. Note: the ordering matters so the
|
|
|
|
/// least efficient ones should be entered first.
|
|
|
|
void addLegalAddressScale(unsigned Scale) {
|
|
|
|
LegalAddressScales.push_back(Scale);
|
|
|
|
}
|
|
|
|
|
|
|
|
private:
|
|
|
|
std::vector<unsigned> LegalAddressScales;
|
|
|
|
|
2005-01-19 03:36:03 +00:00
|
|
|
TargetMachine &TM;
|
2006-05-03 01:29:57 +00:00
|
|
|
const TargetData *TD;
|
2005-01-19 03:36:03 +00:00
|
|
|
|
|
|
|
/// IsLittleEndian - True if this is a little endian target.
|
|
|
|
///
|
|
|
|
bool IsLittleEndian;
|
2005-04-21 20:59:05 +00:00
|
|
|
|
2005-01-19 03:36:03 +00:00
|
|
|
/// PointerTy - The type to use for pointers, usually i32 or i64.
|
|
|
|
///
|
|
|
|
MVT::ValueType PointerTy;
|
|
|
|
|
|
|
|
/// ShiftAmountTy - The type to use for shift amounts, usually i8 or whatever
|
|
|
|
/// PointerTy is.
|
|
|
|
MVT::ValueType ShiftAmountTy;
|
|
|
|
|
|
|
|
OutOfRangeShiftAmount ShiftAmtHandling;
|
|
|
|
|
2005-05-12 02:02:21 +00:00
|
|
|
/// SetCCIsExpensive - This is a short term hack for targets that codegen
|
|
|
|
/// setcc as a conditional branch. This encourages the code generator to fold
|
|
|
|
/// setcc operations into other operations if possible.
|
|
|
|
bool SetCCIsExpensive;
|
|
|
|
|
2005-10-21 00:02:42 +00:00
|
|
|
/// IntDivIsCheap - Tells the code generator not to expand integer divides by
|
|
|
|
/// constants into a sequence of muls, adds, and shifts. This is a hack until
|
|
|
|
/// a real cost model is in place. If we ever optimize for size, this will be
|
|
|
|
/// set to true unconditionally.
|
|
|
|
bool IntDivIsCheap;
|
|
|
|
|
|
|
|
/// Pow2DivIsCheap - Tells the code generator that it shouldn't generate
|
|
|
|
/// srl/add/sra for a signed divide by power of two, and let the target handle
|
|
|
|
/// it.
|
|
|
|
bool Pow2DivIsCheap;
|
2005-10-20 02:14:14 +00:00
|
|
|
|
2005-01-19 03:36:03 +00:00
|
|
|
/// SetCCResultTy - The type that SetCC operations use. This defaults to the
|
|
|
|
/// PointerTy.
|
|
|
|
MVT::ValueType SetCCResultTy;
|
|
|
|
|
2005-04-07 19:41:18 +00:00
|
|
|
/// SetCCResultContents - Information about the contents of the high-bits in
|
|
|
|
/// the result of a setcc comparison operation.
|
|
|
|
SetCCResultValue SetCCResultContents;
|
2006-01-25 09:09:02 +00:00
|
|
|
|
|
|
|
/// SchedPreferenceInfo - The target scheduling preference: shortest possible
|
|
|
|
/// total cycles or lowest register usage.
|
|
|
|
SchedPreference SchedPreferenceInfo;
|
2005-09-27 22:13:36 +00:00
|
|
|
|
|
|
|
/// UseUnderscoreSetJmpLongJmp - This target prefers to use _setjmp and
|
|
|
|
/// _longjmp to implement llvm.setjmp/llvm.longjmp. Defaults to false.
|
|
|
|
bool UseUnderscoreSetJmpLongJmp;
|
2006-01-13 17:47:52 +00:00
|
|
|
|
|
|
|
/// StackPointerRegisterToSaveRestore - If set to a physical register, this
|
|
|
|
/// specifies the register that llvm.savestack/llvm.restorestack should save
|
|
|
|
/// and restore.
|
|
|
|
unsigned StackPointerRegisterToSaveRestore;
|
2005-04-07 19:41:18 +00:00
|
|
|
|
2005-01-19 03:36:03 +00:00
|
|
|
/// RegClassForVT - This indicates the default register class to use for
|
|
|
|
/// each ValueType the target supports natively.
|
|
|
|
TargetRegisterClass *RegClassForVT[MVT::LAST_VALUETYPE];
|
|
|
|
unsigned char NumElementsForVT[MVT::LAST_VALUETYPE];
|
|
|
|
|
|
|
|
/// TransformToType - For any value types we are promoting or expanding, this
|
|
|
|
/// contains the value type that we are changing to. For Expanded types, this
|
|
|
|
/// contains one step of the expand (e.g. i64 -> i32), even if there are
|
|
|
|
/// multiple steps required (e.g. i64 -> i16). For types natively supported
|
|
|
|
/// by the system, this holds the same type (e.g. i32 -> i32).
|
|
|
|
MVT::ValueType TransformToType[MVT::LAST_VALUETYPE];
|
|
|
|
|
|
|
|
/// OpActions - For each operation and each value type, keep a LegalizeAction
|
|
|
|
/// that indicates how instruction selection should deal with the operation.
|
|
|
|
/// Most operations are Legal (aka, supported natively by the target), but
|
|
|
|
/// operations that are not should be described. Note that operations on
|
|
|
|
/// non-legal value types are not described here.
|
2006-03-03 06:58:59 +00:00
|
|
|
uint64_t OpActions[156];
|
2006-01-29 08:40:37 +00:00
|
|
|
|
|
|
|
ValueTypeActionImpl ValueTypeActions;
|
2005-04-21 20:59:05 +00:00
|
|
|
|
2005-01-19 03:36:03 +00:00
|
|
|
std::vector<double> LegalFPImmediates;
|
2005-04-21 20:59:05 +00:00
|
|
|
|
2005-01-19 03:36:03 +00:00
|
|
|
std::vector<std::pair<MVT::ValueType,
|
|
|
|
TargetRegisterClass*> > AvailableRegClasses;
|
2005-07-19 04:52:44 +00:00
|
|
|
|
2006-03-01 04:52:55 +00:00
|
|
|
/// TargetDAGCombineArray - Targets can specify ISD nodes that they would
|
|
|
|
/// like PerformDAGCombine callbacks for by calling setTargetDAGCombine(),
|
|
|
|
/// which sets a bit in this array.
|
2006-03-03 06:58:59 +00:00
|
|
|
unsigned char TargetDAGCombineArray[156/(sizeof(unsigned char)*8)];
|
2006-03-01 04:52:55 +00:00
|
|
|
|
2006-04-04 00:25:10 +00:00
|
|
|
/// PromoteToType - For operations that must be promoted to a specific type,
|
|
|
|
/// this holds the destination type. This map should be sparse, so don't hold
|
|
|
|
/// it as an array.
|
|
|
|
///
|
|
|
|
/// Targets add entries to this map with AddPromotedToType(..), clients access
|
|
|
|
/// this with getTypeToPromoteTo(..).
|
|
|
|
std::map<std::pair<unsigned, MVT::ValueType>, MVT::ValueType> PromoteToType;
|
|
|
|
|
2005-07-19 04:52:44 +00:00
|
|
|
protected:
|
|
|
|
/// When lowering %llvm.memset this field specifies the maximum number of
|
|
|
|
/// store operations that may be substituted for the call to memset. Targets
|
|
|
|
/// must set this value based on the cost threshold for that target. Targets
|
|
|
|
/// should assume that the memset will be done using as many of the largest
|
|
|
|
/// store operations first, followed by smaller ones, if necessary, per
|
|
|
|
/// alignment restrictions. For example, storing 9 bytes on a 32-bit machine
|
2005-07-27 05:53:44 +00:00
|
|
|
/// with 16-bit alignment would result in four 2-byte stores and one 1-byte
|
2005-07-19 04:52:44 +00:00
|
|
|
/// store. This only applies to setting a constant array of a constant size.
|
|
|
|
/// @brief Specify maximum number of store instructions per memset call.
|
2006-02-14 08:38:30 +00:00
|
|
|
unsigned maxStoresPerMemset;
|
2005-07-19 04:52:44 +00:00
|
|
|
|
|
|
|
/// When lowering %llvm.memcpy this field specifies the maximum number of
|
|
|
|
/// store operations that may be substituted for a call to memcpy. Targets
|
|
|
|
/// must set this value based on the cost threshold for that target. Targets
|
|
|
|
/// should assume that the memcpy will be done using as many of the largest
|
|
|
|
/// store operations first, followed by smaller ones, if necessary, per
|
|
|
|
/// alignment restrictions. For example, storing 7 bytes on a 32-bit machine
|
|
|
|
/// with 32-bit alignment would result in one 4-byte store, a one 2-byte store
|
|
|
|
/// and one 1-byte store. This only applies to copying a constant array of
|
|
|
|
/// constant size.
|
|
|
|
/// @brief Specify maximum bytes of store instructions per memcpy call.
|
2006-02-14 08:38:30 +00:00
|
|
|
unsigned maxStoresPerMemcpy;
|
2005-07-19 04:52:44 +00:00
|
|
|
|
|
|
|
/// When lowering %llvm.memmove this field specifies the maximum number of
|
|
|
|
/// store instructions that may be substituted for a call to memmove. Targets
|
|
|
|
/// must set this value based on the cost threshold for that target. Targets
|
|
|
|
/// should assume that the memmove will be done using as many of the largest
|
|
|
|
/// store operations first, followed by smaller ones, if necessary, per
|
2005-07-27 05:53:44 +00:00
|
|
|
/// alignment restrictions. For example, moving 9 bytes on a 32-bit machine
|
|
|
|
/// with 8-bit alignment would result in nine 1-byte stores. This only
|
2005-07-19 04:52:44 +00:00
|
|
|
/// applies to copying a constant array of constant size.
|
|
|
|
/// @brief Specify maximum bytes of store instructions per memmove call.
|
2006-02-14 08:38:30 +00:00
|
|
|
unsigned maxStoresPerMemmove;
|
2005-07-19 04:52:44 +00:00
|
|
|
|
2005-08-27 19:09:02 +00:00
|
|
|
/// This field specifies whether the target machine permits unaligned memory
|
|
|
|
/// accesses. This is used, for example, to determine the size of store
|
|
|
|
/// operations when copying small arrays and other similar tasks.
|
|
|
|
/// @brief Indicate whether the target permits unaligned memory accesses.
|
|
|
|
bool allowUnalignedMemoryAccesses;
|
2005-01-07 07:44:22 +00:00
|
|
|
};
|
|
|
|
} // end llvm namespace
|
|
|
|
|
|
|
|
#endif
|