#ifndef LLVM_CODEGEN_SELECTIONDAGNODES_H
#define LLVM_CODEGEN_SELECTIONDAGNODES_H
-#include "llvm/CodeGen/ValueTypes.h"
#include "llvm/Value.h"
+#include "llvm/ADT/FoldingSet.h"
#include "llvm/ADT/GraphTraits.h"
#include "llvm/ADT/iterator"
+#include "llvm/CodeGen/ValueTypes.h"
#include "llvm/Support/DataTypes.h"
#include <cassert>
-#include <vector>
namespace llvm {
class SelectionDAG;
class GlobalValue;
class MachineBasicBlock;
+class MachineConstantPoolValue;
class SDNode;
+template <typename T> struct DenseMapKeyInfo;
template <typename T> struct simplify_type;
template <typename T> struct ilist_traits;
template<typename NodeTy, typename Traits> class iplist;
template<typename NodeTy> class ilist_iterator;
+/// SDVTList - This represents a list of ValueType's that has been intern'd by
+/// a SelectionDAG. Instances of this simple value class are returned by
+/// SelectionDAG::getVTList(...).
+///
+struct SDVTList {
+ const MVT::ValueType *VTs;
+ unsigned short NumVTs;
+};
+
/// ISD namespace - This namespace contains an enum which represents all of the
/// SelectionDAG node types and value types.
///
namespace ISD {
+ namespace ParamFlags {
+ enum Flags {
+ NoFlagSet = 0,
+ ZExt = 1<<0, ///< Parameter should be zero extended
+ ZExtOffs = 0,
+ SExt = 1<<1, ///< Parameter should be sign extended
+ SExtOffs = 1,
+ InReg = 1<<2, ///< Parameter should be passed in register
+ InRegOffs = 2,
+ StructReturn = 1<<3, ///< Hidden struct-return pointer
+ StructReturnOffs = 3,
+ ByVal = 1<<4, ///< Struct passed by value
+ ByValOffs = 4,
+ OrigAlignment = 0x1F<<27,
+ OrigAlignmentOffs = 27
+ };
+ }
+
//===--------------------------------------------------------------------===//
/// ISD::NodeType enum - This enum defines all of the operators valid in a
/// SelectionDAG.
///
enum NodeType {
+ // DELETED_NODE - This is an illegal flag value that is used to catch
+ // errors. This opcode is not a legal opcode for any node.
+ DELETED_NODE,
+
// EntryToken - This is the marker used to indicate the start of the region.
EntryToken,
// Various leaf nodes.
STRING, BasicBlock, VALUETYPE, CONDCODE, Register,
Constant, ConstantFP,
- GlobalAddress, FrameIndex, ConstantPool, ExternalSymbol,
+ GlobalAddress, GlobalTLSAddress, FrameIndex,
+ JumpTable, ConstantPool, ExternalSymbol,
+
+ // The address of the GOT
+ GLOBAL_OFFSET_TABLE,
+
+ // FRAMEADDR, RETURNADDR - These nodes represent llvm.frameaddress and
+ // llvm.returnaddress on the DAG. These nodes take one operand, the index
+ // of the frame or return address to return. An index of zero corresponds
+ // to the current function's frame or return address, an index of one to the
+ // parent's frame or return address, and so on.
+ FRAMEADDR, RETURNADDR,
+
+ // FRAME_TO_ARGS_OFFSET - This node represents offset from frame pointer to
+ // first (possible) on-stack argument. This is needed for correct stack
+ // adjustment during unwind.
+ FRAME_TO_ARGS_OFFSET,
+
+ // RESULT, OUTCHAIN = EXCEPTIONADDR(INCHAIN) - This node represents the
+ // address of the exception block on entry to an landing pad block.
+ EXCEPTIONADDR,
+
+ // RESULT, OUTCHAIN = EHSELECTION(INCHAIN, EXCEPTION) - This node represents
+ // the selection index of the exception thrown.
+ EHSELECTION,
+
+ // OUTCHAIN = EH_RETURN(INCHAIN, OFFSET, HANDLER) - This node represents
+ // 'eh_return' gcc dwarf builtin, which is used to return from
+ // exception. The general meaning is: adjust stack by OFFSET and pass
+ // execution to HANDLER. Many platform-related details also :)
+ EH_RETURN,
// TargetConstant* - Like Constant*, but the DAG does not do any folding or
// simplification of the constant.
// anything else with this node, and this is valid in the target-specific
// dag, turning into a GlobalAddress operand.
TargetGlobalAddress,
+ TargetGlobalTLSAddress,
TargetFrameIndex,
+ TargetJumpTable,
TargetConstantPool,
TargetExternalSymbol,
-
+
+ /// RESULT = INTRINSIC_WO_CHAIN(INTRINSICID, arg1, arg2, ...)
+ /// This node represents a target intrinsic function with no side effects.
+ /// The first operand is the ID number of the intrinsic from the
+ /// llvm::Intrinsic namespace. The operands to the intrinsic follow. The
+ /// node has returns the result of the intrinsic.
+ INTRINSIC_WO_CHAIN,
+
+ /// RESULT,OUTCHAIN = INTRINSIC_W_CHAIN(INCHAIN, INTRINSICID, arg1, ...)
+ /// This node represents a target intrinsic function with side effects that
+ /// returns a result. The first operand is a chain pointer. The second is
+ /// the ID number of the intrinsic from the llvm::Intrinsic namespace. The
+ /// operands to the intrinsic follow. The node has two results, the result
+ /// of the intrinsic and an output chain.
+ INTRINSIC_W_CHAIN,
+
+ /// OUTCHAIN = INTRINSIC_VOID(INCHAIN, INTRINSICID, arg1, arg2, ...)
+ /// This node represents a target intrinsic function with side effects that
+ /// does not return a result. The first operand is a chain pointer. The
+ /// second is the ID number of the intrinsic from the llvm::Intrinsic
+ /// namespace. The operands to the intrinsic follow.
+ INTRINSIC_VOID,
+
// CopyToReg - This node has three operands: a chain, a register number to
// set to this value, and a value.
CopyToReg,
// UNDEF - An undefined node
UNDEF,
+
+ /// FORMAL_ARGUMENTS(CHAIN, CC#, ISVARARG, FLAG0, ..., FLAGn) - This node
+ /// represents the formal arguments for a function. CC# is a Constant value
+ /// indicating the calling convention of the function, and ISVARARG is a
+ /// flag that indicates whether the function is varargs or not. This node
+ /// has one result value for each incoming argument, plus one for the output
+ /// chain. It must be custom legalized. See description of CALL node for
+ /// FLAG argument contents explanation.
+ ///
+ FORMAL_ARGUMENTS,
+
+ /// RV1, RV2...RVn, CHAIN = CALL(CHAIN, CC#, ISVARARG, ISTAILCALL, CALLEE,
+ /// ARG0, FLAG0, ARG1, FLAG1, ... ARGn, FLAGn)
+ /// This node represents a fully general function call, before the legalizer
+ /// runs. This has one result value for each argument / flag pair, plus
+ /// a chain result. It must be custom legalized. Flag argument indicates
+ /// misc. argument attributes. Currently:
+ /// Bit 0 - signness
+ /// Bit 1 - 'inreg' attribute
+ /// Bit 2 - 'sret' attribute
+ /// Bits 31:27 - argument ABI alignment in the first argument piece and
+ /// alignment '1' in other argument pieces.
+ CALL,
// EXTRACT_ELEMENT - This is used to get the first or second (determined by
// a Constant, which is required to be operand #1), element of the aggregate
// Simple integer binary arithmetic operators.
ADD, SUB, MUL, SDIV, UDIV, SREM, UREM,
+ // CARRY_FALSE - This node is used when folding other nodes,
+ // like ADDC/SUBC, which indicate the carry result is always false.
+ CARRY_FALSE,
+
// Carry-setting nodes for multiple precision addition and subtraction.
// These nodes take two operands of the same value type, and produce two
// results. The first result is the normal add or sub result, the second
// FCOPYSIGN(f32, f64) is allowed.
FCOPYSIGN,
- /// VBUILD_VECTOR(ELT1, ELT2, ELT3, ELT4,..., COUNT,TYPE) - Return a vector
- /// with the specified, possibly variable, elements. The number of elements
- /// is required to be a power of two.
- VBUILD_VECTOR,
-
- /// BUILD_VECTOR(ELT1, ELT2, ELT3, ELT4,...) - Return a vector
+ /// BUILD_VECTOR(ELT0, ELT1, ELT2, ELT3,...) - Return a vector
/// with the specified, possibly variable, elements. The number of elements
/// is required to be a power of two.
BUILD_VECTOR,
- /// VINSERT_VECTOR_ELT(VECTOR, VAL, IDX, COUNT,TYPE) - Given a vector
- /// VECTOR, an element ELEMENT, and a (potentially variable) index IDX,
- /// return an vector with the specified element of VECTOR replaced with VAL.
- /// COUNT and TYPE specify the type of vector, as is standard for V* nodes.
- VINSERT_VECTOR_ELT,
-
- /// INSERT_VECTOR_ELT(VECTOR, VAL, IDX) - Returns VECTOR (a legal packed
- /// type) with the element at IDX replaced with VAL.
+ /// INSERT_VECTOR_ELT(VECTOR, VAL, IDX) - Returns VECTOR with the element
+ /// at IDX replaced with VAL.
INSERT_VECTOR_ELT,
- /// VEXTRACT_VECTOR_ELT(VECTOR, IDX) - Returns a single element from VECTOR
- /// (an MVT::Vector value) identified by the (potentially variable) element
- /// number IDX.
- VEXTRACT_VECTOR_ELT,
-
/// EXTRACT_VECTOR_ELT(VECTOR, IDX) - Returns a single element from VECTOR
- /// (a legal packed type vector) identified by the (potentially variable)
- /// element number IDX.
+ /// identified by the (potentially variable) element number IDX.
EXTRACT_VECTOR_ELT,
+ /// CONCAT_VECTORS(VECTOR0, VECTOR1, ...) - Given a number of values of
+ /// vector type with the same length and element type, this produces a
+ /// concatenated vector result value, with length equal to the sum of the
+ /// lengths of the input vectors.
+ CONCAT_VECTORS,
+
+ /// EXTRACT_SUBVECTOR(VECTOR, IDX) - Returns a subvector from VECTOR (an
+ /// vector value) starting with the (potentially variable) element number
+ /// IDX, which must be a multiple of the result vector length.
+ EXTRACT_SUBVECTOR,
+
/// VECTOR_SHUFFLE(VEC1, VEC2, SHUFFLEVEC) - Returns a vector, of the same
/// type as VEC1/VEC2. SHUFFLEVEC is a BUILD_VECTOR of constant int values
/// (regardless of whether its datatype is legal or not) that indicate
/// of the element size of VEC1/VEC2, not in terms of bytes.
VECTOR_SHUFFLE,
- /// X = VBIT_CONVERT(Y) and X = VBIT_CONVERT(Y, COUNT,TYPE) - This node
- /// represents a conversion from or to an ISD::Vector type.
- ///
- /// This is lowered to a BIT_CONVERT of the appropriate input/output types.
- /// The input and output are required to have the same size and at least one
- /// is required to be a vector (if neither is a vector, just use
- /// BIT_CONVERT).
- ///
- /// If the result is a vector, this takes three operands (like any other
- /// vector producer) which indicate the size and type of the vector result.
- /// Otherwise it takes one input.
- VBIT_CONVERT,
-
- /// BINOP(LHS, RHS, COUNT,TYPE)
- /// Simple abstract vector operators. Unlike the integer and floating point
- /// binary operators, these nodes also take two additional operands:
- /// a constant element count, and a value type node indicating the type of
- /// the elements. The order is count, type, op0, op1. All vector opcodes,
- /// including VLOAD and VConstant must currently have count and type as
- /// their last two operands.
- VADD, VSUB, VMUL, VSDIV, VUDIV,
- VAND, VOR, VXOR,
-
/// SCALAR_TO_VECTOR(VAL) - This represents the operation of loading a
/// scalar value into the low element of the resultant vector type. The top
/// elements of the vector are undefined.
// conversions, but that is a noop, deleted by getNode().
BIT_CONVERT,
- // FNEG, FABS, FSQRT, FSIN, FCOS - Perform unary floating point negation,
- // absolute value, square root, sine and cosine operations.
- FNEG, FABS, FSQRT, FSIN, FCOS,
+ // FNEG, FABS, FSQRT, FSIN, FCOS, FPOWI - Perform unary floating point
+ // negation, absolute value, square root, sine and cosine, and powi
+ // operations.
+ FNEG, FABS, FSQRT, FSIN, FCOS, FPOWI,
- // Other operators. LOAD and STORE have token chains as their first
- // operand, then the same operands as an LLVM load/store instruction, then a
- // SRCVALUE node that provides alias analysis information.
+ // LOAD and STORE have token chains as their first operand, then the same
+ // operands as an LLVM load/store instruction, then an offset node that
+ // is added / subtracted from the base pointer to form the address (for
+ // indexed memory ops).
LOAD, STORE,
- // Abstract vector version of LOAD. VLOAD has a constant element count as
- // the first operand, followed by a value type node indicating the type of
- // the elements, a token chain, a pointer operand, and a SRCVALUE node.
- VLOAD,
-
- // EXTLOAD, SEXTLOAD, ZEXTLOAD - These three operators all load a value from
- // memory and extend them to a larger value (e.g. load a byte into a word
- // register). All three of these have four operands, a token chain, a
- // pointer to load from, a SRCVALUE for alias analysis, and a VALUETYPE node
- // indicating the type to load.
- //
- // SEXTLOAD loads the integer operand and sign extends it to a larger
- // integer result type.
- // ZEXTLOAD loads the integer operand and zero extends it to a larger
- // integer result type.
- // EXTLOAD is used for three things: floating point extending loads,
- // integer extending loads [the top bits are undefined], and vector
- // extending loads [load into low elt].
- EXTLOAD, SEXTLOAD, ZEXTLOAD,
-
// TRUNCSTORE - This operators truncates (for integer) or rounds (for FP) a
// value and stores it to memory in one operation. This can be used for
// either integer or floating point operands. The first four operands of
TRUNCSTORE,
// DYNAMIC_STACKALLOC - Allocate some number of bytes on the stack aligned
- // to a specified boundary. The first operand is the token chain, the
- // second is the number of bytes to allocate, and the third is the alignment
- // boundary. The size is guaranteed to be a multiple of the stack
- // alignment, and the alignment is guaranteed to be bigger than the stack
+ // to a specified boundary. This node always has two return values: a new
+ // stack pointer value and a chain. The first operand is the token chain,
+ // the second is the number of bytes to allocate, and the third is the
+ // alignment boundary. The size is guaranteed to be a multiple of the stack
+ // alignment, and the alignment is guaranteed to be bigger than the stack
// alignment (if required) or 0 to get standard stack alignment.
DYNAMIC_STACKALLOC,
// operand, the second is the MBB to branch to.
BR,
+ // BRIND - Indirect branch. The first operand is the chain, the second
+ // is the value to branch to, which must be of the same type as the target's
+ // pointer type.
+ BRIND,
+
+ // BR_JT - Jumptable branch. The first operand is the chain, the second
+ // is the jumptable index, the last one is the jumptable entry index.
+ BR_JT,
+
// BRCOND - Conditional branch. The first operand is the chain,
// the second is the condition, the third is the block to branch
// to if the condition is true.
BR_CC,
// RET - Return from function. The first operand is the chain,
- // and any subsequent operands are the return values for the
- // function. This operation can have variable number of operands.
+ // and any subsequent operands are pairs of return value and return value
+ // signness for the function. This operation can have variable number of
+ // operands.
RET,
// INLINEASM - Represents an inline asm block. This node always has two
// Operand #2n+3: A TargetConstant, indicating if the reg is a use/def
// Operand #last: Optional, an incoming flag.
INLINEASM,
-
+
+ // LABEL - Represents a label in mid basic block used to track
+ // locations needed for debug and exception handling tables. This node
+ // returns a chain.
+ // Operand #0 : input chain.
+ // Operand #1 : module unique number use to identify the label.
+ LABEL,
+
// STACKSAVE - STACKSAVE has one operand, an input chain. It produces a
// value, the same type as the pointer type for the system, and an output
// chain.
// DEBUG_LOC - This node is used to represent source line information
// embedded in the code. It takes a token chain as input, then a line
- // number, then a column then a file id (provided by MachineDebugInfo.) It
+ // number, then a column then a file id (provided by MachineModuleInfo.) It
// produces a token chain as output.
DEBUG_LOC,
- // DEBUG_LABEL - This node is used to mark a location in the code where a
- // label should be generated for use by the debug information. It takes a
- // token chain as input and then a unique id (provided by MachineDebugInfo.)
- // It produces a token chain as output.
- DEBUG_LABEL,
-
// BUILTIN_OP_END - This must be the last enum value in this list.
BUILTIN_OP_END
};
+ /// Node predicates
+
+ /// isBuildVectorAllOnes - Return true if the specified node is a
+ /// BUILD_VECTOR where all of the elements are ~0 or undef.
+ bool isBuildVectorAllOnes(const SDNode *N);
+
+ /// isBuildVectorAllZeros - Return true if the specified node is a
+ /// BUILD_VECTOR where all of the elements are 0 or undef.
+ bool isBuildVectorAllZeros(const SDNode *N);
+
+ //===--------------------------------------------------------------------===//
+ /// MemIndexedMode enum - This enum defines the load / store indexed
+ /// addressing modes.
+ ///
+ /// UNINDEXED "Normal" load / store. The effective address is already
+ /// computed and is available in the base pointer. The offset
+ /// operand is always undefined. In addition to producing a
+ /// chain, an unindexed load produces one value (result of the
+ /// load); an unindexed store does not produces a value.
+ ///
+ /// PRE_INC Similar to the unindexed mode where the effective address is
+ /// PRE_DEC the value of the base pointer add / subtract the offset.
+ /// It considers the computation as being folded into the load /
+ /// store operation (i.e. the load / store does the address
+ /// computation as well as performing the memory transaction).
+ /// The base operand is always undefined. In addition to
+ /// producing a chain, pre-indexed load produces two values
+ /// (result of the load and the result of the address
+ /// computation); a pre-indexed store produces one value (result
+ /// of the address computation).
+ ///
+ /// POST_INC The effective address is the value of the base pointer. The
+ /// POST_DEC value of the offset operand is then added to / subtracted
+ /// from the base after memory transaction. In addition to
+ /// producing a chain, post-indexed load produces two values
+ /// (the result of the load and the result of the base +/- offset
+ /// computation); a post-indexed store produces one value (the
+ /// the result of the base +/- offset computation).
+ ///
+ enum MemIndexedMode {
+ UNINDEXED = 0,
+ PRE_INC,
+ PRE_DEC,
+ POST_INC,
+ POST_DEC,
+ LAST_INDEXED_MODE
+ };
+
+ //===--------------------------------------------------------------------===//
+ /// LoadExtType enum - This enum defines the three variants of LOADEXT
+ /// (load with extension).
+ ///
+ /// SEXTLOAD loads the integer operand and sign extends it to a larger
+ /// integer result type.
+ /// ZEXTLOAD loads the integer operand and zero extends it to a larger
+ /// integer result type.
+ /// EXTLOAD is used for three things: floating point extending loads,
+ /// integer extending loads [the top bits are undefined], and vector
+ /// extending loads [load into low elt].
+ ///
+ enum LoadExtType {
+ NON_EXTLOAD = 0,
+ EXTLOAD,
+ SEXTLOAD,
+ ZEXTLOAD,
+ LAST_LOADX_TYPE
+ };
+
//===--------------------------------------------------------------------===//
/// ISD::CondCode enum - These are ordered carefully to make the bitfields
/// below work out, when considering SETFALSE (something that never exists
SDNode *Val; // The node defining the value we are using.
unsigned ResNo; // Which return value of the node we are using.
- SDOperand() : Val(0) {}
+ SDOperand() : Val(0), ResNo(0) {}
SDOperand(SDNode *val, unsigned resno) : Val(val), ResNo(resno) {}
bool operator==(const SDOperand &O) const {
// Forwarding methods - These forward to the corresponding methods in SDNode.
inline unsigned getOpcode() const;
- inline unsigned getNodeDepth() const;
inline unsigned getNumOperands() const;
inline const SDOperand &getOperand(unsigned i) const;
+ inline uint64_t getConstantOperandVal(unsigned i) const;
inline bool isTargetOpcode() const;
inline unsigned getTargetOpcode() const;
};
+template<> struct DenseMapKeyInfo<SDOperand> {
+ static inline SDOperand getEmptyKey() { return SDOperand((SDNode*)-1, -1U); }
+ static inline SDOperand getTombstoneKey() { return SDOperand((SDNode*)-1, 0);}
+ static unsigned getHashValue(const SDOperand &Val) {
+ return (unsigned)((uintptr_t)Val.Val >> 4) ^
+ (unsigned)((uintptr_t)Val.Val >> 9) + Val.ResNo;
+ }
+ static bool isPod() { return true; }
+};
+
/// simplify_type specializations - Allow casting operators to work directly on
/// SDOperands as if they were SDNode*'s.
template<> struct simplify_type<SDOperand> {
/// SDNode - Represents one node in the SelectionDAG.
///
-class SDNode {
+class SDNode : public FoldingSetNode {
/// NodeType - The operation that this node performs.
///
unsigned short NodeType;
+
+ /// OperandsNeedDelete - This is true if OperandList was new[]'d. If true,
+ /// then they will be delete[]'d when the node is destroyed.
+ bool OperandsNeedDelete : 1;
- /// NodeDepth - Node depth is defined as MAX(Node depth of children)+1. This
- /// means that leaves have a depth of 1, things that use only leaves have a
- /// depth of 2, etc.
- unsigned short NodeDepth;
+ /// NodeId - Unique id per SDNode in the DAG.
+ int NodeId;
/// OperandList - The values that are used by this operation.
///
/// ValueList - The types of the values this node defines. SDNode's may
/// define multiple values simultaneously.
- MVT::ValueType *ValueList;
+ const MVT::ValueType *ValueList;
/// NumOperands/NumValues - The number of entries in the Operand/Value list.
unsigned short NumOperands, NumValues;
/// Uses - These are all of the SDNode's that use a value produced by this
/// node.
- std::vector<SDNode*> Uses;
+ SmallVector<SDNode*,3> Uses;
+
+ // Out-of-line virtual method to give class a home.
+ virtual void ANCHOR();
public:
virtual ~SDNode() {
assert(NumOperands == 0 && "Operand list not cleared before deletion");
+ NodeType = ISD::DELETED_NODE;
}
//===--------------------------------------------------------------------===//
bool use_empty() const { return Uses.empty(); }
bool hasOneUse() const { return Uses.size() == 1; }
- /// getNodeDepth - Return the distance from this node to the leaves in the
- /// graph. The leaves have a depth of 1.
- unsigned getNodeDepth() const { return NodeDepth; }
+ /// getNodeId - Return the unique node id.
+ ///
+ int getNodeId() const { return NodeId; }
- typedef std::vector<SDNode*>::const_iterator use_iterator;
+ typedef SmallVector<SDNode*,3>::const_iterator use_iterator;
use_iterator use_begin() const { return Uses.begin(); }
use_iterator use_end() const { return Uses.end(); }
/// operation.
bool hasNUsesOfValue(unsigned NUses, unsigned Value) const;
- // isOnlyUse - Return true if this node is the only use of N.
+ /// isOnlyUse - Return true if this node is the only use of N.
+ ///
bool isOnlyUse(SDNode *N) const;
- // isOperand - Return true if this node is an operand of N.
+ /// isOperand - Return true if this node is an operand of N.
+ ///
bool isOperand(SDNode *N) const;
+ /// isPredecessor - Return true if this node is a predecessor of N. This node
+ /// is either an operand of N or it can be reached by recursively traversing
+ /// up the operands.
+ /// NOTE: this is an expensive method. Use it carefully.
+ bool isPredecessor(SDNode *N) const;
+
/// getNumOperands - Return the number of values used by this operation.
///
unsigned getNumOperands() const { return NumOperands; }
+ /// getConstantOperandVal - Helper method returns the integer value of a
+ /// ConstantSDNode operand.
+ uint64_t getConstantOperandVal(unsigned Num) const;
+
const SDOperand &getOperand(unsigned Num) const {
assert(Num < NumOperands && "Invalid child # of SDNode!");
return OperandList[Num];
}
+
typedef const SDOperand* op_iterator;
op_iterator op_begin() const { return OperandList; }
op_iterator op_end() const { return OperandList+NumOperands; }
+ SDVTList getVTList() const {
+ SDVTList X = { ValueList, NumValues };
+ return X;
+ };
+
/// getNumValues - Return the number of values defined/returned by this
/// operator.
///
/// getOperationName - Return the opcode of this operation for printing.
///
- const char* getOperationName(const SelectionDAG *G = 0) const;
+ std::string getOperationName(const SelectionDAG *G = 0) const;
+ static const char* getIndexedModeName(ISD::MemIndexedMode AM);
void dump() const;
void dump(const SelectionDAG *G) const;
static bool classof(const SDNode *) { return true; }
+ /// Profile - Gather unique data for the node.
+ ///
+ void Profile(FoldingSetNodeID &ID);
+
protected:
friend class SelectionDAG;
/// getValueTypeList - Return a pointer to the specified value type.
///
static MVT::ValueType *getValueTypeList(MVT::ValueType VT);
-
- SDNode(unsigned NT, MVT::ValueType VT) : NodeType(NT), NodeDepth(1) {
- OperandList = 0; NumOperands = 0;
- ValueList = getValueTypeList(VT);
- NumValues = 1;
- Prev = 0; Next = 0;
+ static SDVTList getSDVTList(MVT::ValueType VT) {
+ SDVTList Ret = { getValueTypeList(VT), 1 };
+ return Ret;
}
- SDNode(unsigned NT, SDOperand Op)
- : NodeType(NT), NodeDepth(Op.Val->getNodeDepth()+1) {
- OperandList = new SDOperand[1];
- OperandList[0] = Op;
- NumOperands = 1;
- Op.Val->Uses.push_back(this);
- ValueList = 0;
- NumValues = 0;
- Prev = 0; Next = 0;
- }
- SDNode(unsigned NT, SDOperand N1, SDOperand N2)
- : NodeType(NT) {
- if (N1.Val->getNodeDepth() > N2.Val->getNodeDepth())
- NodeDepth = N1.Val->getNodeDepth()+1;
- else
- NodeDepth = N2.Val->getNodeDepth()+1;
- OperandList = new SDOperand[2];
- OperandList[0] = N1;
- OperandList[1] = N2;
- NumOperands = 2;
- N1.Val->Uses.push_back(this); N2.Val->Uses.push_back(this);
- ValueList = 0;
- NumValues = 0;
- Prev = 0; Next = 0;
- }
- SDNode(unsigned NT, SDOperand N1, SDOperand N2, SDOperand N3)
- : NodeType(NT) {
- unsigned ND = N1.Val->getNodeDepth();
- if (ND < N2.Val->getNodeDepth())
- ND = N2.Val->getNodeDepth();
- if (ND < N3.Val->getNodeDepth())
- ND = N3.Val->getNodeDepth();
- NodeDepth = ND+1;
-
- OperandList = new SDOperand[3];
- OperandList[0] = N1;
- OperandList[1] = N2;
- OperandList[2] = N3;
- NumOperands = 3;
+
+ SDNode(unsigned Opc, SDVTList VTs, const SDOperand *Ops, unsigned NumOps)
+ : NodeType(Opc), NodeId(-1) {
+ OperandsNeedDelete = true;
+ NumOperands = NumOps;
+ OperandList = NumOps ? new SDOperand[NumOperands] : 0;
- N1.Val->Uses.push_back(this); N2.Val->Uses.push_back(this);
- N3.Val->Uses.push_back(this);
- ValueList = 0;
- NumValues = 0;
- Prev = 0; Next = 0;
- }
- SDNode(unsigned NT, SDOperand N1, SDOperand N2, SDOperand N3, SDOperand N4)
- : NodeType(NT) {
- unsigned ND = N1.Val->getNodeDepth();
- if (ND < N2.Val->getNodeDepth())
- ND = N2.Val->getNodeDepth();
- if (ND < N3.Val->getNodeDepth())
- ND = N3.Val->getNodeDepth();
- if (ND < N4.Val->getNodeDepth())
- ND = N4.Val->getNodeDepth();
- NodeDepth = ND+1;
-
- OperandList = new SDOperand[4];
- OperandList[0] = N1;
- OperandList[1] = N2;
- OperandList[2] = N3;
- OperandList[3] = N4;
- NumOperands = 4;
+ for (unsigned i = 0; i != NumOps; ++i) {
+ OperandList[i] = Ops[i];
+ Ops[i].Val->Uses.push_back(this);
+ }
- N1.Val->Uses.push_back(this); N2.Val->Uses.push_back(this);
- N3.Val->Uses.push_back(this); N4.Val->Uses.push_back(this);
- ValueList = 0;
- NumValues = 0;
+ ValueList = VTs.VTs;
+ NumValues = VTs.NumVTs;
Prev = 0; Next = 0;
}
- SDNode(unsigned Opc, const std::vector<SDOperand> &Nodes) : NodeType(Opc) {
- NumOperands = Nodes.size();
- OperandList = new SDOperand[NumOperands];
+ SDNode(unsigned Opc, SDVTList VTs) : NodeType(Opc), NodeId(-1) {
+ OperandsNeedDelete = false; // Operands set with InitOperands.
+ NumOperands = 0;
+ OperandList = 0;
- unsigned ND = 0;
- for (unsigned i = 0, e = Nodes.size(); i != e; ++i) {
- OperandList[i] = Nodes[i];
- SDNode *N = OperandList[i].Val;
- N->Uses.push_back(this);
- if (ND < N->getNodeDepth()) ND = N->getNodeDepth();
- }
- NodeDepth = ND+1;
- ValueList = 0;
- NumValues = 0;
+ ValueList = VTs.VTs;
+ NumValues = VTs.NumVTs;
Prev = 0; Next = 0;
}
-
- /// MorphNodeTo - This clears the return value and operands list, and sets the
- /// opcode of the node to the specified value. This should only be used by
- /// the SelectionDAG class.
- void MorphNodeTo(unsigned Opc) {
- NodeType = Opc;
- ValueList = 0;
- NumValues = 0;
+
+ /// InitOperands - Initialize the operands list of this node with the
+ /// specified values, which are part of the node (thus they don't need to be
+ /// copied in or allocated).
+ void InitOperands(SDOperand *Ops, unsigned NumOps) {
+ assert(OperandList == 0 && "Operands already set!");
+ NumOperands = NumOps;
+ OperandList = Ops;
- // Clear the operands list, updating used nodes to remove this from their
- // use list.
- for (op_iterator I = op_begin(), E = op_end(); I != E; ++I)
- I->Val->removeUser(this);
- delete [] OperandList;
- OperandList = 0;
- NumOperands = 0;
+ for (unsigned i = 0; i != NumOps; ++i)
+ Ops[i].Val->Uses.push_back(this);
}
- void setValueTypes(MVT::ValueType VT) {
- assert(NumValues == 0 && "Should not have values yet!");
- ValueList = getValueTypeList(VT);
- NumValues = 1;
- }
- void setValueTypes(MVT::ValueType *List, unsigned NumVal) {
- assert(NumValues == 0 && "Should not have values yet!");
- ValueList = List;
- NumValues = NumVal;
- }
+ /// MorphNodeTo - This frees the operands of the current node, resets the
+ /// opcode, types, and operands to the specified value. This should only be
+ /// used by the SelectionDAG class.
+ void MorphNodeTo(unsigned Opc, SDVTList L,
+ const SDOperand *Ops, unsigned NumOps);
- void setOperands(SDOperand Op0) {
- assert(NumOperands == 0 && "Should not have operands yet!");
- OperandList = new SDOperand[1];
- OperandList[0] = Op0;
- NumOperands = 1;
- Op0.Val->Uses.push_back(this);
- }
- void setOperands(SDOperand Op0, SDOperand Op1) {
- assert(NumOperands == 0 && "Should not have operands yet!");
- OperandList = new SDOperand[2];
- OperandList[0] = Op0;
- OperandList[1] = Op1;
- NumOperands = 2;
- Op0.Val->Uses.push_back(this); Op1.Val->Uses.push_back(this);
- }
- void setOperands(SDOperand Op0, SDOperand Op1, SDOperand Op2) {
- assert(NumOperands == 0 && "Should not have operands yet!");
- OperandList = new SDOperand[3];
- OperandList[0] = Op0;
- OperandList[1] = Op1;
- OperandList[2] = Op2;
- NumOperands = 3;
- Op0.Val->Uses.push_back(this); Op1.Val->Uses.push_back(this);
- Op2.Val->Uses.push_back(this);
- }
- void setOperands(SDOperand Op0, SDOperand Op1, SDOperand Op2, SDOperand Op3) {
- assert(NumOperands == 0 && "Should not have operands yet!");
- OperandList = new SDOperand[4];
- OperandList[0] = Op0;
- OperandList[1] = Op1;
- OperandList[2] = Op2;
- OperandList[3] = Op3;
- NumOperands = 4;
- Op0.Val->Uses.push_back(this); Op1.Val->Uses.push_back(this);
- Op2.Val->Uses.push_back(this); Op3.Val->Uses.push_back(this);
- }
- void setOperands(SDOperand Op0, SDOperand Op1, SDOperand Op2, SDOperand Op3,
- SDOperand Op4) {
- assert(NumOperands == 0 && "Should not have operands yet!");
- OperandList = new SDOperand[5];
- OperandList[0] = Op0;
- OperandList[1] = Op1;
- OperandList[2] = Op2;
- OperandList[3] = Op3;
- OperandList[4] = Op4;
- NumOperands = 5;
- Op0.Val->Uses.push_back(this); Op1.Val->Uses.push_back(this);
- Op2.Val->Uses.push_back(this); Op3.Val->Uses.push_back(this);
- Op4.Val->Uses.push_back(this);
- }
- void setOperands(SDOperand Op0, SDOperand Op1, SDOperand Op2, SDOperand Op3,
- SDOperand Op4, SDOperand Op5) {
- assert(NumOperands == 0 && "Should not have operands yet!");
- OperandList = new SDOperand[6];
- OperandList[0] = Op0;
- OperandList[1] = Op1;
- OperandList[2] = Op2;
- OperandList[3] = Op3;
- OperandList[4] = Op4;
- OperandList[5] = Op5;
- NumOperands = 6;
- Op0.Val->Uses.push_back(this); Op1.Val->Uses.push_back(this);
- Op2.Val->Uses.push_back(this); Op3.Val->Uses.push_back(this);
- Op4.Val->Uses.push_back(this); Op5.Val->Uses.push_back(this);
- }
- void setOperands(SDOperand Op0, SDOperand Op1, SDOperand Op2, SDOperand Op3,
- SDOperand Op4, SDOperand Op5, SDOperand Op6) {
- assert(NumOperands == 0 && "Should not have operands yet!");
- OperandList = new SDOperand[7];
- OperandList[0] = Op0;
- OperandList[1] = Op1;
- OperandList[2] = Op2;
- OperandList[3] = Op3;
- OperandList[4] = Op4;
- OperandList[5] = Op5;
- OperandList[6] = Op6;
- NumOperands = 7;
- Op0.Val->Uses.push_back(this); Op1.Val->Uses.push_back(this);
- Op2.Val->Uses.push_back(this); Op3.Val->Uses.push_back(this);
- Op4.Val->Uses.push_back(this); Op5.Val->Uses.push_back(this);
- Op6.Val->Uses.push_back(this);
- }
- void setOperands(SDOperand Op0, SDOperand Op1, SDOperand Op2, SDOperand Op3,
- SDOperand Op4, SDOperand Op5, SDOperand Op6, SDOperand Op7) {
- assert(NumOperands == 0 && "Should not have operands yet!");
- OperandList = new SDOperand[8];
- OperandList[0] = Op0;
- OperandList[1] = Op1;
- OperandList[2] = Op2;
- OperandList[3] = Op3;
- OperandList[4] = Op4;
- OperandList[5] = Op5;
- OperandList[6] = Op6;
- OperandList[7] = Op7;
- NumOperands = 8;
- Op0.Val->Uses.push_back(this); Op1.Val->Uses.push_back(this);
- Op2.Val->Uses.push_back(this); Op3.Val->Uses.push_back(this);
- Op4.Val->Uses.push_back(this); Op5.Val->Uses.push_back(this);
- Op6.Val->Uses.push_back(this); Op7.Val->Uses.push_back(this);
- }
-
void addUser(SDNode *User) {
Uses.push_back(User);
}
}
}
}
+
+ void setNodeId(int Id) {
+ NodeId = Id;
+ }
};
inline unsigned SDOperand::getOpcode() const {
return Val->getOpcode();
}
-inline unsigned SDOperand::getNodeDepth() const {
- return Val->getNodeDepth();
-}
inline MVT::ValueType SDOperand::getValueType() const {
return Val->getValueType(ResNo);
}
inline const SDOperand &SDOperand::getOperand(unsigned i) const {
return Val->getOperand(i);
}
+inline uint64_t SDOperand::getConstantOperandVal(unsigned i) const {
+ return Val->getConstantOperandVal(i);
+}
inline bool SDOperand::isTargetOpcode() const {
return Val->isTargetOpcode();
}
return Val->hasNUsesOfValue(1, ResNo);
}
+/// UnarySDNode - This class is used for single-operand SDNodes. This is solely
+/// to allow co-allocation of node operands with the node itself.
+class UnarySDNode : public SDNode {
+ virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
+ SDOperand Op;
+public:
+ UnarySDNode(unsigned Opc, SDVTList VTs, SDOperand X)
+ : SDNode(Opc, VTs), Op(X) {
+ InitOperands(&Op, 1);
+ }
+};
+
+/// BinarySDNode - This class is used for two-operand SDNodes. This is solely
+/// to allow co-allocation of node operands with the node itself.
+class BinarySDNode : public SDNode {
+ virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
+ SDOperand Ops[2];
+public:
+ BinarySDNode(unsigned Opc, SDVTList VTs, SDOperand X, SDOperand Y)
+ : SDNode(Opc, VTs) {
+ Ops[0] = X;
+ Ops[1] = Y;
+ InitOperands(Ops, 2);
+ }
+};
+
+/// TernarySDNode - This class is used for three-operand SDNodes. This is solely
+/// to allow co-allocation of node operands with the node itself.
+class TernarySDNode : public SDNode {
+ virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
+ SDOperand Ops[3];
+public:
+ TernarySDNode(unsigned Opc, SDVTList VTs, SDOperand X, SDOperand Y,
+ SDOperand Z)
+ : SDNode(Opc, VTs) {
+ Ops[0] = X;
+ Ops[1] = Y;
+ Ops[2] = Z;
+ InitOperands(Ops, 3);
+ }
+};
+
+
/// HandleSDNode - This class is used to form a handle around another node that
/// is persistant and is updated across invocations of replaceAllUsesWith on its
/// operand. This node should be directly created by end-users and not added to
/// the AllNodes list.
class HandleSDNode : public SDNode {
+ virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
+ SDOperand Op;
public:
- HandleSDNode(SDOperand X) : SDNode(ISD::HANDLENODE, X) {}
- ~HandleSDNode() {
- MorphNodeTo(ISD::HANDLENODE); // Drops operand uses.
+ explicit HandleSDNode(SDOperand X)
+ : SDNode(ISD::HANDLENODE, getSDVTList(MVT::Other)), Op(X) {
+ InitOperands(&Op, 1);
}
-
- SDOperand getValue() const { return getOperand(0); }
+ ~HandleSDNode();
+ SDOperand getValue() const { return Op; }
};
class StringSDNode : public SDNode {
std::string Value;
+ virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
protected:
friend class SelectionDAG;
- StringSDNode(const std::string &val)
- : SDNode(ISD::STRING, MVT::Other), Value(val) {
+ explicit StringSDNode(const std::string &val)
+ : SDNode(ISD::STRING, getSDVTList(MVT::Other)), Value(val) {
}
public:
const std::string &getValue() const { return Value; }
class ConstantSDNode : public SDNode {
uint64_t Value;
+ virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
protected:
friend class SelectionDAG;
ConstantSDNode(bool isTarget, uint64_t val, MVT::ValueType VT)
- : SDNode(isTarget ? ISD::TargetConstant : ISD::Constant, VT), Value(val) {
+ : SDNode(isTarget ? ISD::TargetConstant : ISD::Constant, getSDVTList(VT)),
+ Value(val) {
}
public:
bool isNullValue() const { return Value == 0; }
bool isAllOnesValue() const {
- int NumBits = MVT::getSizeInBits(getValueType(0));
- if (NumBits == 64) return Value+1 == 0;
- return Value == (1ULL << NumBits)-1;
+ return Value == MVT::getIntVTBitMask(getValueType(0));
}
static bool classof(const ConstantSDNode *) { return true; }
class ConstantFPSDNode : public SDNode {
double Value;
+ virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
protected:
friend class SelectionDAG;
ConstantFPSDNode(bool isTarget, double val, MVT::ValueType VT)
- : SDNode(isTarget ? ISD::TargetConstantFP : ISD::ConstantFP, VT),
- Value(val) {
+ : SDNode(isTarget ? ISD::TargetConstantFP : ISD::ConstantFP,
+ getSDVTList(VT)), Value(val) {
}
public:
class GlobalAddressSDNode : public SDNode {
GlobalValue *TheGlobal;
int Offset;
+ virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
protected:
friend class SelectionDAG;
GlobalAddressSDNode(bool isTarget, const GlobalValue *GA, MVT::ValueType VT,
- int o=0)
- : SDNode(isTarget ? ISD::TargetGlobalAddress : ISD::GlobalAddress, VT),
- Offset(o) {
- TheGlobal = const_cast<GlobalValue*>(GA);
- }
+ int o = 0);
public:
GlobalValue *getGlobal() const { return TheGlobal; }
static bool classof(const GlobalAddressSDNode *) { return true; }
static bool classof(const SDNode *N) {
return N->getOpcode() == ISD::GlobalAddress ||
- N->getOpcode() == ISD::TargetGlobalAddress;
+ N->getOpcode() == ISD::TargetGlobalAddress ||
+ N->getOpcode() == ISD::GlobalTLSAddress ||
+ N->getOpcode() == ISD::TargetGlobalTLSAddress;
}
};
-
class FrameIndexSDNode : public SDNode {
int FI;
+ virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
protected:
friend class SelectionDAG;
FrameIndexSDNode(int fi, MVT::ValueType VT, bool isTarg)
- : SDNode(isTarg ? ISD::TargetFrameIndex : ISD::FrameIndex, VT), FI(fi) {}
+ : SDNode(isTarg ? ISD::TargetFrameIndex : ISD::FrameIndex, getSDVTList(VT)),
+ FI(fi) {
+ }
public:
int getIndex() const { return FI; }
}
};
+class JumpTableSDNode : public SDNode {
+ int JTI;
+ virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
+protected:
+ friend class SelectionDAG;
+ JumpTableSDNode(int jti, MVT::ValueType VT, bool isTarg)
+ : SDNode(isTarg ? ISD::TargetJumpTable : ISD::JumpTable, getSDVTList(VT)),
+ JTI(jti) {
+ }
+public:
+
+ int getIndex() const { return JTI; }
+
+ static bool classof(const JumpTableSDNode *) { return true; }
+ static bool classof(const SDNode *N) {
+ return N->getOpcode() == ISD::JumpTable ||
+ N->getOpcode() == ISD::TargetJumpTable;
+ }
+};
+
class ConstantPoolSDNode : public SDNode {
- Constant *C;
- int Offset;
+ union {
+ Constant *ConstVal;
+ MachineConstantPoolValue *MachineCPVal;
+ } Val;
+ int Offset; // It's a MachineConstantPoolValue if top bit is set.
unsigned Alignment;
+ virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
protected:
friend class SelectionDAG;
ConstantPoolSDNode(bool isTarget, Constant *c, MVT::ValueType VT,
int o=0)
- : SDNode(isTarget ? ISD::TargetConstantPool : ISD::ConstantPool, VT),
- C(c), Offset(o), Alignment(0) {}
+ : SDNode(isTarget ? ISD::TargetConstantPool : ISD::ConstantPool,
+ getSDVTList(VT)), Offset(o), Alignment(0) {
+ assert((int)Offset >= 0 && "Offset is too large");
+ Val.ConstVal = c;
+ }
ConstantPoolSDNode(bool isTarget, Constant *c, MVT::ValueType VT, int o,
unsigned Align)
- : SDNode(isTarget ? ISD::TargetConstantPool : ISD::ConstantPool, VT),
- C(c), Offset(o), Alignment(Align) {}
+ : SDNode(isTarget ? ISD::TargetConstantPool : ISD::ConstantPool,
+ getSDVTList(VT)), Offset(o), Alignment(Align) {
+ assert((int)Offset >= 0 && "Offset is too large");
+ Val.ConstVal = c;
+ }
+ ConstantPoolSDNode(bool isTarget, MachineConstantPoolValue *v,
+ MVT::ValueType VT, int o=0)
+ : SDNode(isTarget ? ISD::TargetConstantPool : ISD::ConstantPool,
+ getSDVTList(VT)), Offset(o), Alignment(0) {
+ assert((int)Offset >= 0 && "Offset is too large");
+ Val.MachineCPVal = v;
+ Offset |= 1 << (sizeof(unsigned)*8-1);
+ }
+ ConstantPoolSDNode(bool isTarget, MachineConstantPoolValue *v,
+ MVT::ValueType VT, int o, unsigned Align)
+ : SDNode(isTarget ? ISD::TargetConstantPool : ISD::ConstantPool,
+ getSDVTList(VT)), Offset(o), Alignment(Align) {
+ assert((int)Offset >= 0 && "Offset is too large");
+ Val.MachineCPVal = v;
+ Offset |= 1 << (sizeof(unsigned)*8-1);
+ }
public:
- Constant *get() const { return C; }
- int getOffset() const { return Offset; }
+ bool isMachineConstantPoolEntry() const {
+ return (int)Offset < 0;
+ }
+
+ Constant *getConstVal() const {
+ assert(!isMachineConstantPoolEntry() && "Wrong constantpool type");
+ return Val.ConstVal;
+ }
+
+ MachineConstantPoolValue *getMachineCPVal() const {
+ assert(isMachineConstantPoolEntry() && "Wrong constantpool type");
+ return Val.MachineCPVal;
+ }
+
+ int getOffset() const {
+ return Offset & ~(1 << (sizeof(unsigned)*8-1));
+ }
// Return the alignment of this constant pool object, which is either 0 (for
// default alignment) or log2 of the desired value.
unsigned getAlignment() const { return Alignment; }
+ const Type *getType() const;
+
static bool classof(const ConstantPoolSDNode *) { return true; }
static bool classof(const SDNode *N) {
return N->getOpcode() == ISD::ConstantPool ||
class BasicBlockSDNode : public SDNode {
MachineBasicBlock *MBB;
+ virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
protected:
friend class SelectionDAG;
- BasicBlockSDNode(MachineBasicBlock *mbb)
- : SDNode(ISD::BasicBlock, MVT::Other), MBB(mbb) {}
+ explicit BasicBlockSDNode(MachineBasicBlock *mbb)
+ : SDNode(ISD::BasicBlock, getSDVTList(MVT::Other)), MBB(mbb) {
+ }
public:
MachineBasicBlock *getBasicBlock() const { return MBB; }
class SrcValueSDNode : public SDNode {
const Value *V;
int offset;
+ virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
protected:
friend class SelectionDAG;
SrcValueSDNode(const Value* v, int o)
- : SDNode(ISD::SRCVALUE, MVT::Other), V(v), offset(o) {}
+ : SDNode(ISD::SRCVALUE, getSDVTList(MVT::Other)), V(v), offset(o) {
+ }
public:
const Value *getValue() const { return V; }
class RegisterSDNode : public SDNode {
unsigned Reg;
+ virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
protected:
friend class SelectionDAG;
RegisterSDNode(unsigned reg, MVT::ValueType VT)
- : SDNode(ISD::Register, VT), Reg(reg) {}
+ : SDNode(ISD::Register, getSDVTList(VT)), Reg(reg) {
+ }
public:
unsigned getReg() const { return Reg; }
class ExternalSymbolSDNode : public SDNode {
const char *Symbol;
+ virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
protected:
friend class SelectionDAG;
ExternalSymbolSDNode(bool isTarget, const char *Sym, MVT::ValueType VT)
- : SDNode(isTarget ? ISD::TargetExternalSymbol : ISD::ExternalSymbol, VT),
- Symbol(Sym) {
- }
+ : SDNode(isTarget ? ISD::TargetExternalSymbol : ISD::ExternalSymbol,
+ getSDVTList(VT)), Symbol(Sym) {
+ }
public:
const char *getSymbol() const { return Symbol; }
class CondCodeSDNode : public SDNode {
ISD::CondCode Condition;
+ virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
protected:
friend class SelectionDAG;
- CondCodeSDNode(ISD::CondCode Cond)
- : SDNode(ISD::CONDCODE, MVT::Other), Condition(Cond) {
+ explicit CondCodeSDNode(ISD::CondCode Cond)
+ : SDNode(ISD::CONDCODE, getSDVTList(MVT::Other)), Condition(Cond) {
}
public:
/// to parameterize some operations.
class VTSDNode : public SDNode {
MVT::ValueType ValueType;
+ virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
protected:
friend class SelectionDAG;
- VTSDNode(MVT::ValueType VT)
- : SDNode(ISD::VALUETYPE, MVT::Other), ValueType(VT) {}
+ explicit VTSDNode(MVT::ValueType VT)
+ : SDNode(ISD::VALUETYPE, getSDVTList(MVT::Other)), ValueType(VT) {
+ }
public:
MVT::ValueType getVT() const { return ValueType; }
}
};
+/// LoadSDNode - This class is used to represent ISD::LOAD nodes.
+///
+class LoadSDNode : public SDNode {
+ virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
+ SDOperand Ops[3];
+
+ // AddrMode - unindexed, pre-indexed, post-indexed.
+ ISD::MemIndexedMode AddrMode;
+
+ // ExtType - non-ext, anyext, sext, zext.
+ ISD::LoadExtType ExtType;
+
+ // LoadedVT - VT of loaded value before extension.
+ MVT::ValueType LoadedVT;
+
+ // SrcValue - Memory location for alias analysis.
+ const Value *SrcValue;
+
+ // SVOffset - Memory location offset.
+ int SVOffset;
+
+ // Alignment - Alignment of memory location in bytes.
+ unsigned Alignment;
+
+ // IsVolatile - True if the load is volatile.
+ bool IsVolatile;
+protected:
+ friend class SelectionDAG;
+ LoadSDNode(SDOperand *ChainPtrOff, SDVTList VTs,
+ ISD::MemIndexedMode AM, ISD::LoadExtType ETy, MVT::ValueType LVT,
+ const Value *SV, int O=0, unsigned Align=0, bool Vol=false)
+ : SDNode(ISD::LOAD, VTs),
+ AddrMode(AM), ExtType(ETy), LoadedVT(LVT), SrcValue(SV), SVOffset(O),
+ Alignment(Align), IsVolatile(Vol) {
+ Ops[0] = ChainPtrOff[0]; // Chain
+ Ops[1] = ChainPtrOff[1]; // Ptr
+ Ops[2] = ChainPtrOff[2]; // Off
+ InitOperands(Ops, 3);
+ assert(Align != 0 && "Loads should have non-zero aligment");
+ assert((getOffset().getOpcode() == ISD::UNDEF ||
+ AddrMode != ISD::UNINDEXED) &&
+ "Only indexed load has a non-undef offset operand");
+ }
+public:
+
+ const SDOperand getChain() const { return getOperand(0); }
+ const SDOperand getBasePtr() const { return getOperand(1); }
+ const SDOperand getOffset() const { return getOperand(2); }
+ ISD::MemIndexedMode getAddressingMode() const { return AddrMode; }
+ ISD::LoadExtType getExtensionType() const { return ExtType; }
+ MVT::ValueType getLoadedVT() const { return LoadedVT; }
+ const Value *getSrcValue() const { return SrcValue; }
+ int getSrcValueOffset() const { return SVOffset; }
+ unsigned getAlignment() const { return Alignment; }
+ bool isVolatile() const { return IsVolatile; }
+
+ static bool classof(const LoadSDNode *) { return true; }
+ static bool classof(const SDNode *N) {
+ return N->getOpcode() == ISD::LOAD;
+ }
+};
+
+/// StoreSDNode - This class is used to represent ISD::STORE nodes.
+///
+class StoreSDNode : public SDNode {
+ virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
+ SDOperand Ops[4];
+
+ // AddrMode - unindexed, pre-indexed, post-indexed.
+ ISD::MemIndexedMode AddrMode;
+
+ // IsTruncStore - True is the op does a truncation before store.
+ bool IsTruncStore;
+
+ // StoredVT - VT of the value after truncation.
+ MVT::ValueType StoredVT;
+
+ // SrcValue - Memory location for alias analysis.
+ const Value *SrcValue;
+
+ // SVOffset - Memory location offset.
+ int SVOffset;
+
+ // Alignment - Alignment of memory location in bytes.
+ unsigned Alignment;
+
+ // IsVolatile - True if the store is volatile.
+ bool IsVolatile;
+protected:
+ friend class SelectionDAG;
+ StoreSDNode(SDOperand *ChainValuePtrOff, SDVTList VTs,
+ ISD::MemIndexedMode AM, bool isTrunc, MVT::ValueType SVT,
+ const Value *SV, int O=0, unsigned Align=0, bool Vol=false)
+ : SDNode(ISD::STORE, VTs),
+ AddrMode(AM), IsTruncStore(isTrunc), StoredVT(SVT), SrcValue(SV),
+ SVOffset(O), Alignment(Align), IsVolatile(Vol) {
+ Ops[0] = ChainValuePtrOff[0]; // Chain
+ Ops[1] = ChainValuePtrOff[1]; // Value
+ Ops[2] = ChainValuePtrOff[2]; // Ptr
+ Ops[3] = ChainValuePtrOff[3]; // Off
+ InitOperands(Ops, 4);
+ assert(Align != 0 && "Stores should have non-zero aligment");
+ assert((getOffset().getOpcode() == ISD::UNDEF ||
+ AddrMode != ISD::UNINDEXED) &&
+ "Only indexed store has a non-undef offset operand");
+ }
+public:
+
+ const SDOperand getChain() const { return getOperand(0); }
+ const SDOperand getValue() const { return getOperand(1); }
+ const SDOperand getBasePtr() const { return getOperand(2); }
+ const SDOperand getOffset() const { return getOperand(3); }
+ ISD::MemIndexedMode getAddressingMode() const { return AddrMode; }
+ bool isTruncatingStore() const { return IsTruncStore; }
+ MVT::ValueType getStoredVT() const { return StoredVT; }
+ const Value *getSrcValue() const { return SrcValue; }
+ int getSrcValueOffset() const { return SVOffset; }
+ unsigned getAlignment() const { return Alignment; }
+ bool isVolatile() const { return IsVolatile; }
+
+ static bool classof(const StoreSDNode *) { return true; }
+ static bool classof(const SDNode *N) {
+ return N->getOpcode() == ISD::STORE;
+ }
+};
+
class SDNodeIterator : public forward_iterator<SDNode, ptrdiff_t> {
SDNode *Node;
static void setNext(SDNode *N, SDNode *Next) { N->Next = Next; }
static SDNode *createSentinel() {
- return new SDNode(ISD::EntryToken, MVT::Other);
+ return new SDNode(ISD::EntryToken, SDNode::getSDVTList(MVT::Other));
}
static void destroySentinel(SDNode *N) { delete N; }
//static SDNode *createNode(const SDNode &V) { return new SDNode(V); }
const ilist_iterator<SDNode> &Y) {}
};
+namespace ISD {
+ /// isNON_EXTLoad - Returns true if the specified node is a non-extending
+ /// load.
+ inline bool isNON_EXTLoad(const SDNode *N) {
+ return N->getOpcode() == ISD::LOAD &&
+ cast<LoadSDNode>(N)->getExtensionType() == ISD::NON_EXTLOAD;
+ }
+
+ /// isEXTLoad - Returns true if the specified node is a EXTLOAD.
+ ///
+ inline bool isEXTLoad(const SDNode *N) {
+ return N->getOpcode() == ISD::LOAD &&
+ cast<LoadSDNode>(N)->getExtensionType() == ISD::EXTLOAD;
+ }
+
+ /// isSEXTLoad - Returns true if the specified node is a SEXTLOAD.
+ ///
+ inline bool isSEXTLoad(const SDNode *N) {
+ return N->getOpcode() == ISD::LOAD &&
+ cast<LoadSDNode>(N)->getExtensionType() == ISD::SEXTLOAD;
+ }
+
+ /// isZEXTLoad - Returns true if the specified node is a ZEXTLOAD.
+ ///
+ inline bool isZEXTLoad(const SDNode *N) {
+ return N->getOpcode() == ISD::LOAD &&
+ cast<LoadSDNode>(N)->getExtensionType() == ISD::ZEXTLOAD;
+ }
+
+ /// isUNINDEXEDLoad - Returns true if the specified node is a unindexed load.
+ ///
+ inline bool isUNINDEXEDLoad(const SDNode *N) {
+ return N->getOpcode() == ISD::LOAD &&
+ cast<LoadSDNode>(N)->getAddressingMode() == ISD::UNINDEXED;
+ }
+
+ /// isNON_TRUNCStore - Returns true if the specified node is a non-truncating
+ /// store.
+ inline bool isNON_TRUNCStore(const SDNode *N) {
+ return N->getOpcode() == ISD::STORE &&
+ !cast<StoreSDNode>(N)->isTruncatingStore();
+ }
+
+ /// isTRUNCStore - Returns true if the specified node is a truncating
+ /// store.
+ inline bool isTRUNCStore(const SDNode *N) {
+ return N->getOpcode() == ISD::STORE &&
+ cast<StoreSDNode>(N)->isTruncatingStore();
+ }
+}
+
+
} // end llvm namespace
#endif
projects / oota-llvm.git / blobdiff