1 //===-- llvm/CodeGen/SelectionDAGNodes.h - SelectionDAG Nodes ---*- C++ -*-===//
3 // The LLVM Compiler Infrastructure
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // This file declares the SDNode class and derived classes, which are used to
11 // represent the nodes and operations present in a SelectionDAG. These nodes
12 // and operations are machine code level operations, with some similarities to
13 // the GCC RTL representation.
15 // Clients should include the SelectionDAG.h file instead of this file directly.
17 //===----------------------------------------------------------------------===//
19 #ifndef LLVM_CODEGEN_SELECTIONDAGNODES_H
20 #define LLVM_CODEGEN_SELECTIONDAGNODES_H
22 #include "llvm/Value.h"
23 #include "llvm/ADT/FoldingSet.h"
24 #include "llvm/ADT/GraphTraits.h"
25 #include "llvm/ADT/iterator"
26 #include "llvm/ADT/APFloat.h"
27 #include "llvm/ADT/APInt.h"
28 #include "llvm/CodeGen/ValueTypes.h"
29 #include "llvm/CodeGen/MemOperand.h"
30 #include "llvm/Support/DataTypes.h"
37 class MachineBasicBlock;
38 class MachineConstantPoolValue;
40 template <typename T> struct DenseMapInfo;
41 template <typename T> struct simplify_type;
42 template <typename T> struct ilist_traits;
43 template<typename NodeTy, typename Traits> class iplist;
44 template<typename NodeTy> class ilist_iterator;
46 /// SDVTList - This represents a list of ValueType's that has been intern'd by
47 /// a SelectionDAG. Instances of this simple value class are returned by
48 /// SelectionDAG::getVTList(...).
51 const MVT::ValueType *VTs;
52 unsigned short NumVTs;
55 /// ISD namespace - This namespace contains an enum which represents all of the
56 /// SelectionDAG node types and value types.
59 namespace ParamFlags {
62 ZExt = 1<<0, ///< Parameter should be zero extended
64 SExt = 1<<1, ///< Parameter should be sign extended
66 InReg = 1<<2, ///< Parameter should be passed in register
68 StructReturn = 1<<3, ///< Hidden struct-return pointer
70 ByVal = 1<<4, ///< Struct passed by value
72 Nest = 1<<5, ///< Parameter is nested function static chain
74 ByValAlign = 0xF << 6, //< The alignment of the struct
76 ByValSize = 0x1ffff << 10, //< The size of the struct
78 OrigAlignment = 0x1F<<27,
79 OrigAlignmentOffs = 27
83 //===--------------------------------------------------------------------===//
84 /// ISD::NodeType enum - This enum defines all of the operators valid in a
88 // DELETED_NODE - This is an illegal flag value that is used to catch
89 // errors. This opcode is not a legal opcode for any node.
92 // EntryToken - This is the marker used to indicate the start of the region.
95 // Token factor - This node takes multiple tokens as input and produces a
96 // single token result. This is used to represent the fact that the operand
97 // operators are independent of each other.
100 // AssertSext, AssertZext - These nodes record if a register contains a
101 // value that has already been zero or sign extended from a narrower type.
102 // These nodes take two operands. The first is the node that has already
103 // been extended, and the second is a value type node indicating the width
105 AssertSext, AssertZext,
107 // Various leaf nodes.
108 STRING, BasicBlock, VALUETYPE, CONDCODE, Register,
109 Constant, ConstantFP,
110 GlobalAddress, GlobalTLSAddress, FrameIndex,
111 JumpTable, ConstantPool, ExternalSymbol,
113 // The address of the GOT
116 // FRAMEADDR, RETURNADDR - These nodes represent llvm.frameaddress and
117 // llvm.returnaddress on the DAG. These nodes take one operand, the index
118 // of the frame or return address to return. An index of zero corresponds
119 // to the current function's frame or return address, an index of one to the
120 // parent's frame or return address, and so on.
121 FRAMEADDR, RETURNADDR,
123 // FRAME_TO_ARGS_OFFSET - This node represents offset from frame pointer to
124 // first (possible) on-stack argument. This is needed for correct stack
125 // adjustment during unwind.
126 FRAME_TO_ARGS_OFFSET,
128 // RESULT, OUTCHAIN = EXCEPTIONADDR(INCHAIN) - This node represents the
129 // address of the exception block on entry to an landing pad block.
132 // RESULT, OUTCHAIN = EHSELECTION(INCHAIN, EXCEPTION) - This node represents
133 // the selection index of the exception thrown.
136 // OUTCHAIN = EH_RETURN(INCHAIN, OFFSET, HANDLER) - This node represents
137 // 'eh_return' gcc dwarf builtin, which is used to return from
138 // exception. The general meaning is: adjust stack by OFFSET and pass
139 // execution to HANDLER. Many platform-related details also :)
142 // TargetConstant* - Like Constant*, but the DAG does not do any folding or
143 // simplification of the constant.
147 // TargetGlobalAddress - Like GlobalAddress, but the DAG does no folding or
148 // anything else with this node, and this is valid in the target-specific
149 // dag, turning into a GlobalAddress operand.
151 TargetGlobalTLSAddress,
155 TargetExternalSymbol,
157 /// RESULT = INTRINSIC_WO_CHAIN(INTRINSICID, arg1, arg2, ...)
158 /// This node represents a target intrinsic function with no side effects.
159 /// The first operand is the ID number of the intrinsic from the
160 /// llvm::Intrinsic namespace. The operands to the intrinsic follow. The
161 /// node has returns the result of the intrinsic.
164 /// RESULT,OUTCHAIN = INTRINSIC_W_CHAIN(INCHAIN, INTRINSICID, arg1, ...)
165 /// This node represents a target intrinsic function with side effects that
166 /// returns a result. The first operand is a chain pointer. The second is
167 /// the ID number of the intrinsic from the llvm::Intrinsic namespace. The
168 /// operands to the intrinsic follow. The node has two results, the result
169 /// of the intrinsic and an output chain.
172 /// OUTCHAIN = INTRINSIC_VOID(INCHAIN, INTRINSICID, arg1, arg2, ...)
173 /// This node represents a target intrinsic function with side effects that
174 /// does not return a result. The first operand is a chain pointer. The
175 /// second is the ID number of the intrinsic from the llvm::Intrinsic
176 /// namespace. The operands to the intrinsic follow.
179 // CopyToReg - This node has three operands: a chain, a register number to
180 // set to this value, and a value.
183 // CopyFromReg - This node indicates that the input value is a virtual or
184 // physical register that is defined outside of the scope of this
185 // SelectionDAG. The register is available from the RegisterSDNode object.
188 // UNDEF - An undefined node
191 /// FORMAL_ARGUMENTS(CHAIN, CC#, ISVARARG, FLAG0, ..., FLAGn) - This node
192 /// represents the formal arguments for a function. CC# is a Constant value
193 /// indicating the calling convention of the function, and ISVARARG is a
194 /// flag that indicates whether the function is varargs or not. This node
195 /// has one result value for each incoming argument, plus one for the output
196 /// chain. It must be custom legalized. See description of CALL node for
197 /// FLAG argument contents explanation.
201 /// RV1, RV2...RVn, CHAIN = CALL(CHAIN, CC#, ISVARARG, ISTAILCALL, CALLEE,
202 /// ARG0, FLAG0, ARG1, FLAG1, ... ARGn, FLAGn)
203 /// This node represents a fully general function call, before the legalizer
204 /// runs. This has one result value for each argument / flag pair, plus
205 /// a chain result. It must be custom legalized. Flag argument indicates
206 /// misc. argument attributes. Currently:
208 /// Bit 1 - 'inreg' attribute
209 /// Bit 2 - 'sret' attribute
210 /// Bit 4 - 'byval' attribute
211 /// Bit 5 - 'nest' attribute
212 /// Bit 6-9 - alignment of byval structures
213 /// Bit 10-26 - size of byval structures
214 /// Bits 31:27 - argument ABI alignment in the first argument piece and
215 /// alignment '1' in other argument pieces.
218 // EXTRACT_ELEMENT - This is used to get the first or second (determined by
219 // a Constant, which is required to be operand #1), element of the aggregate
220 // value specified as operand #0. This is only for use before legalization,
221 // for values that will be broken into multiple registers.
224 // BUILD_PAIR - This is the opposite of EXTRACT_ELEMENT in some ways. Given
225 // two values of the same integer value type, this produces a value twice as
226 // big. Like EXTRACT_ELEMENT, this can only be used before legalization.
229 // MERGE_VALUES - This node takes multiple discrete operands and returns
230 // them all as its individual results. This nodes has exactly the same
231 // number of inputs and outputs, and is only valid before legalization.
232 // This node is useful for some pieces of the code generator that want to
233 // think about a single node with multiple results, not multiple nodes.
236 // Simple integer binary arithmetic operators.
237 ADD, SUB, MUL, SDIV, UDIV, SREM, UREM,
239 // SMUL_LOHI/UMUL_LOHI - Multiply two integers of type iN, producing
240 // a signed/unsigned value of type i[2*N], and return the full value as
241 // two results, each of type iN.
242 SMUL_LOHI, UMUL_LOHI,
244 // SDIVREM/UDIVREM - Divide two integers and produce both a quotient and
248 // CARRY_FALSE - This node is used when folding other nodes,
249 // like ADDC/SUBC, which indicate the carry result is always false.
252 // Carry-setting nodes for multiple precision addition and subtraction.
253 // These nodes take two operands of the same value type, and produce two
254 // results. The first result is the normal add or sub result, the second
255 // result is the carry flag result.
258 // Carry-using nodes for multiple precision addition and subtraction. These
259 // nodes take three operands: The first two are the normal lhs and rhs to
260 // the add or sub, and the third is the input carry flag. These nodes
261 // produce two results; the normal result of the add or sub, and the output
262 // carry flag. These nodes both read and write a carry flag to allow them
263 // to them to be chained together for add and sub of arbitrarily large
267 // Simple binary floating point operators.
268 FADD, FSUB, FMUL, FDIV, FREM,
270 // FCOPYSIGN(X, Y) - Return the value of X with the sign of Y. NOTE: This
271 // DAG node does not require that X and Y have the same type, just that they
272 // are both floating point. X and the result must have the same type.
273 // FCOPYSIGN(f32, f64) is allowed.
276 // INT = FGETSIGN(FP) - Return the sign bit of the specified floating point
277 // value as an integer 0/1 value.
280 /// BUILD_VECTOR(ELT0, ELT1, ELT2, ELT3,...) - Return a vector
281 /// with the specified, possibly variable, elements. The number of elements
282 /// is required to be a power of two.
285 /// INSERT_VECTOR_ELT(VECTOR, VAL, IDX) - Returns VECTOR with the element
286 /// at IDX replaced with VAL. If the type of VAL is larger than the vector
287 /// element type then VAL is truncated before replacement.
290 /// EXTRACT_VECTOR_ELT(VECTOR, IDX) - Returns a single element from VECTOR
291 /// identified by the (potentially variable) element number IDX.
294 /// CONCAT_VECTORS(VECTOR0, VECTOR1, ...) - Given a number of values of
295 /// vector type with the same length and element type, this produces a
296 /// concatenated vector result value, with length equal to the sum of the
297 /// lengths of the input vectors.
300 /// EXTRACT_SUBVECTOR(VECTOR, IDX) - Returns a subvector from VECTOR (an
301 /// vector value) starting with the (potentially variable) element number
302 /// IDX, which must be a multiple of the result vector length.
305 /// VECTOR_SHUFFLE(VEC1, VEC2, SHUFFLEVEC) - Returns a vector, of the same
306 /// type as VEC1/VEC2. SHUFFLEVEC is a BUILD_VECTOR of constant int values
307 /// (maybe of an illegal datatype) or undef that indicate which value each
308 /// result element will get. The elements of VEC1/VEC2 are enumerated in
309 /// order. This is quite similar to the Altivec 'vperm' instruction, except
310 /// that the indices must be constants and are in terms of the element size
311 /// of VEC1/VEC2, not in terms of bytes.
314 /// SCALAR_TO_VECTOR(VAL) - This represents the operation of loading a
315 /// scalar value into element 0 of the resultant vector type. The top
316 /// elements 1 to N-1 of the N-element vector are undefined.
319 // EXTRACT_SUBREG - This node is used to extract a sub-register value.
320 // This node takes a superreg and a constant sub-register index as operands.
323 // INSERT_SUBREG - This node is used to insert a sub-register value.
324 // This node takes a superreg, a subreg value, and a constant sub-register
325 // index as operands.
328 // MULHU/MULHS - Multiply high - Multiply two integers of type iN, producing
329 // an unsigned/signed value of type i[2*N], then return the top part.
332 // Bitwise operators - logical and, logical or, logical xor, shift left,
333 // shift right algebraic (shift in sign bits), shift right logical (shift in
334 // zeroes), rotate left, rotate right, and byteswap.
335 AND, OR, XOR, SHL, SRA, SRL, ROTL, ROTR, BSWAP,
337 // Counting operators
340 // Select(COND, TRUEVAL, FALSEVAL)
343 // Select with condition operator - This selects between a true value and
344 // a false value (ops #2 and #3) based on the boolean result of comparing
345 // the lhs and rhs (ops #0 and #1) of a conditional expression with the
346 // condition code in op #4, a CondCodeSDNode.
349 // SetCC operator - This evaluates to a boolean (i1) true value if the
350 // condition is true. The operands to this are the left and right operands
351 // to compare (ops #0, and #1) and the condition code to compare them with
352 // (op #2) as a CondCodeSDNode.
355 // SHL_PARTS/SRA_PARTS/SRL_PARTS - These operators are used for expanded
356 // integer shift operations, just like ADD/SUB_PARTS. The operation
358 // [Lo,Hi] = op [LoLHS,HiLHS], Amt
359 SHL_PARTS, SRA_PARTS, SRL_PARTS,
361 // Conversion operators. These are all single input single output
362 // operations. For all of these, the result type must be strictly
363 // wider or narrower (depending on the operation) than the source
366 // SIGN_EXTEND - Used for integer types, replicating the sign bit
370 // ZERO_EXTEND - Used for integer types, zeroing the new bits.
373 // ANY_EXTEND - Used for integer types. The high bits are undefined.
376 // TRUNCATE - Completely drop the high bits.
379 // [SU]INT_TO_FP - These operators convert integers (whose interpreted sign
380 // depends on the first letter) to floating point.
384 // SIGN_EXTEND_INREG - This operator atomically performs a SHL/SRA pair to
385 // sign extend a small value in a large integer register (e.g. sign
386 // extending the low 8 bits of a 32-bit register to fill the top 24 bits
387 // with the 7th bit). The size of the smaller type is indicated by the 1th
388 // operand, a ValueType node.
391 /// FP_TO_[US]INT - Convert a floating point value to a signed or unsigned
396 /// X = FP_ROUND(Y, TRUNC) - Rounding 'Y' from a larger floating point type
397 /// down to the precision of the destination VT. TRUNC is a flag, which is
398 /// always an integer that is zero or one. If TRUNC is 0, this is a
399 /// normal rounding, if it is 1, this FP_ROUND is known to not change the
402 /// The TRUNC = 1 case is used in cases where we know that the value will
403 /// not be modified by the node, because Y is not using any of the extra
404 /// precision of source type. This allows certain transformations like
405 /// FP_EXTEND(FP_ROUND(X,1)) -> X which are not safe for
406 /// FP_EXTEND(FP_ROUND(X,0)) because the extra bits aren't removed.
409 // FLT_ROUNDS_ - Returns current rounding mode:
412 // 1 Round to nearest
417 /// X = FP_ROUND_INREG(Y, VT) - This operator takes an FP register, and
418 /// rounds it to a floating point value. It then promotes it and returns it
419 /// in a register of the same size. This operation effectively just
420 /// discards excess precision. The type to round down to is specified by
421 /// the VT operand, a VTSDNode.
424 /// X = FP_EXTEND(Y) - Extend a smaller FP type into a larger FP type.
427 // BIT_CONVERT - Theis operator converts between integer and FP values, as
428 // if one was stored to memory as integer and the other was loaded from the
429 // same address (or equivalently for vector format conversions, etc). The
430 // source and result are required to have the same bit size (e.g.
431 // f32 <-> i32). This can also be used for int-to-int or fp-to-fp
432 // conversions, but that is a noop, deleted by getNode().
435 // FNEG, FABS, FSQRT, FSIN, FCOS, FPOWI, FPOW - Perform unary floating point
436 // negation, absolute value, square root, sine and cosine, powi, and pow
438 FNEG, FABS, FSQRT, FSIN, FCOS, FPOWI, FPOW,
440 // LOAD and STORE have token chains as their first operand, then the same
441 // operands as an LLVM load/store instruction, then an offset node that
442 // is added / subtracted from the base pointer to form the address (for
443 // indexed memory ops).
446 // DYNAMIC_STACKALLOC - Allocate some number of bytes on the stack aligned
447 // to a specified boundary. This node always has two return values: a new
448 // stack pointer value and a chain. The first operand is the token chain,
449 // the second is the number of bytes to allocate, and the third is the
450 // alignment boundary. The size is guaranteed to be a multiple of the stack
451 // alignment, and the alignment is guaranteed to be bigger than the stack
452 // alignment (if required) or 0 to get standard stack alignment.
455 // Control flow instructions. These all have token chains.
457 // BR - Unconditional branch. The first operand is the chain
458 // operand, the second is the MBB to branch to.
461 // BRIND - Indirect branch. The first operand is the chain, the second
462 // is the value to branch to, which must be of the same type as the target's
466 // BR_JT - Jumptable branch. The first operand is the chain, the second
467 // is the jumptable index, the last one is the jumptable entry index.
470 // BRCOND - Conditional branch. The first operand is the chain,
471 // the second is the condition, the third is the block to branch
472 // to if the condition is true.
475 // BR_CC - Conditional branch. The behavior is like that of SELECT_CC, in
476 // that the condition is represented as condition code, and two nodes to
477 // compare, rather than as a combined SetCC node. The operands in order are
478 // chain, cc, lhs, rhs, block to branch to if condition is true.
481 // RET - Return from function. The first operand is the chain,
482 // and any subsequent operands are pairs of return value and return value
483 // signness for the function. This operation can have variable number of
487 // INLINEASM - Represents an inline asm block. This node always has two
488 // return values: a chain and a flag result. The inputs are as follows:
489 // Operand #0 : Input chain.
490 // Operand #1 : a ExternalSymbolSDNode with a pointer to the asm string.
491 // Operand #2n+2: A RegisterNode.
492 // Operand #2n+3: A TargetConstant, indicating if the reg is a use/def
493 // Operand #last: Optional, an incoming flag.
496 // LABEL - Represents a label in mid basic block used to track
497 // locations needed for debug and exception handling tables. This node
499 // Operand #0 : input chain.
500 // Operand #1 : module unique number use to identify the label.
501 // Operand #2 : 0 indicates a debug label (e.g. stoppoint), 1 indicates
502 // a EH label, 2 indicates unknown label type.
505 // DECLARE - Represents a llvm.dbg.declare intrinsic. It's used to track
506 // local variable declarations for debugging information. First operand is
507 // a chain, while the next two operands are first two arguments (address
508 // and variable) of a llvm.dbg.declare instruction.
511 // STACKSAVE - STACKSAVE has one operand, an input chain. It produces a
512 // value, the same type as the pointer type for the system, and an output
516 // STACKRESTORE has two operands, an input chain and a pointer to restore to
517 // it returns an output chain.
520 // MEMSET/MEMCPY/MEMMOVE - The first operand is the chain. The following
521 // correspond to the operands of the LLVM intrinsic functions and the last
522 // one is AlwaysInline. The only result is a token chain. The alignment
523 // argument is guaranteed to be a Constant node.
528 // CALLSEQ_START/CALLSEQ_END - These operators mark the beginning and end of
529 // a call sequence, and carry arbitrary information that target might want
530 // to know. The first operand is a chain, the rest are specified by the
531 // target and not touched by the DAG optimizers.
532 // CALLSEQ_START..CALLSEQ_END pairs may not be nested.
533 CALLSEQ_START, // Beginning of a call sequence
534 CALLSEQ_END, // End of a call sequence
536 // VAARG - VAARG has three operands: an input chain, a pointer, and a
537 // SRCVALUE. It returns a pair of values: the vaarg value and a new chain.
540 // VACOPY - VACOPY has five operands: an input chain, a destination pointer,
541 // a source pointer, a SRCVALUE for the destination, and a SRCVALUE for the
545 // VAEND, VASTART - VAEND and VASTART have three operands: an input chain, a
546 // pointer, and a SRCVALUE.
549 // SRCVALUE - This is a node type that holds a Value* that is used to
550 // make reference to a value in the LLVM IR.
553 // MEMOPERAND - This is a node that contains a MemOperand which records
554 // information about a memory reference. This is used to make AliasAnalysis
555 // queries from the backend.
558 // PCMARKER - This corresponds to the pcmarker intrinsic.
561 // READCYCLECOUNTER - This corresponds to the readcyclecounter intrinsic.
562 // The only operand is a chain and a value and a chain are produced. The
563 // value is the contents of the architecture specific cycle counter like
564 // register (or other high accuracy low latency clock source)
567 // HANDLENODE node - Used as a handle for various purposes.
570 // LOCATION - This node is used to represent a source location for debug
571 // info. It takes token chain as input, then a line number, then a column
572 // number, then a filename, then a working dir. It produces a token chain
576 // DEBUG_LOC - This node is used to represent source line information
577 // embedded in the code. It takes a token chain as input, then a line
578 // number, then a column then a file id (provided by MachineModuleInfo.) It
579 // produces a token chain as output.
582 // TRAMPOLINE - This corresponds to the init_trampoline intrinsic.
583 // It takes as input a token chain, the pointer to the trampoline,
584 // the pointer to the nested function, the pointer to pass for the
585 // 'nest' parameter, a SRCVALUE for the trampoline and another for
586 // the nested function (allowing targets to access the original
587 // Function*). It produces the result of the intrinsic and a token
591 // TRAP - Trapping instruction
594 // OUTCHAIN = MEMBARRIER(INCHAIN, load-load, load-store, store-load,
595 // store-store, device)
596 // This corresponds to the memory.barrier intrinsic.
597 // it takes an input chain, 4 operands to specify the type of barrier, an
598 // operand specifying if the barrier applies to device and uncached memory
599 // and produces an output chain.
602 // Val, OUTCHAIN = ATOMIC_LCS(INCHAIN, ptr, cmp, swap)
603 // this corresponds to the atomic.lcs intrinsic.
604 // cmp is compared to *ptr, and if equal, swap is stored in *ptr.
605 // the return is always the original value in *ptr
608 // Val, OUTCHAIN = ATOMIC_LAS(INCHAIN, ptr, amt)
609 // this corresponds to the atomic.las intrinsic.
610 // *ptr + amt is stored to *ptr atomically.
611 // the return is always the original value in *ptr
614 // Val, OUTCHAIN = ATOMIC_SWAP(INCHAIN, ptr, amt)
615 // this corresponds to the atomic.swap intrinsic.
616 // amt is stored to *ptr atomically.
617 // the return is always the original value in *ptr
620 // BUILTIN_OP_END - This must be the last enum value in this list.
626 /// isBuildVectorAllOnes - Return true if the specified node is a
627 /// BUILD_VECTOR where all of the elements are ~0 or undef.
628 bool isBuildVectorAllOnes(const SDNode *N);
630 /// isBuildVectorAllZeros - Return true if the specified node is a
631 /// BUILD_VECTOR where all of the elements are 0 or undef.
632 bool isBuildVectorAllZeros(const SDNode *N);
634 /// isScalarToVector - Return true if the specified node is a
635 /// ISD::SCALAR_TO_VECTOR node or a BUILD_VECTOR node where only the low
636 /// element is not an undef.
637 bool isScalarToVector(const SDNode *N);
639 /// isDebugLabel - Return true if the specified node represents a debug
640 /// label (i.e. ISD::LABEL or TargetInstrInfo::LABEL node and third operand
642 bool isDebugLabel(const SDNode *N);
644 //===--------------------------------------------------------------------===//
645 /// MemIndexedMode enum - This enum defines the load / store indexed
646 /// addressing modes.
648 /// UNINDEXED "Normal" load / store. The effective address is already
649 /// computed and is available in the base pointer. The offset
650 /// operand is always undefined. In addition to producing a
651 /// chain, an unindexed load produces one value (result of the
652 /// load); an unindexed store does not produces a value.
654 /// PRE_INC Similar to the unindexed mode where the effective address is
655 /// PRE_DEC the value of the base pointer add / subtract the offset.
656 /// It considers the computation as being folded into the load /
657 /// store operation (i.e. the load / store does the address
658 /// computation as well as performing the memory transaction).
659 /// The base operand is always undefined. In addition to
660 /// producing a chain, pre-indexed load produces two values
661 /// (result of the load and the result of the address
662 /// computation); a pre-indexed store produces one value (result
663 /// of the address computation).
665 /// POST_INC The effective address is the value of the base pointer. The
666 /// POST_DEC value of the offset operand is then added to / subtracted
667 /// from the base after memory transaction. In addition to
668 /// producing a chain, post-indexed load produces two values
669 /// (the result of the load and the result of the base +/- offset
670 /// computation); a post-indexed store produces one value (the
671 /// the result of the base +/- offset computation).
673 enum MemIndexedMode {
682 //===--------------------------------------------------------------------===//
683 /// LoadExtType enum - This enum defines the three variants of LOADEXT
684 /// (load with extension).
686 /// SEXTLOAD loads the integer operand and sign extends it to a larger
687 /// integer result type.
688 /// ZEXTLOAD loads the integer operand and zero extends it to a larger
689 /// integer result type.
690 /// EXTLOAD is used for three things: floating point extending loads,
691 /// integer extending loads [the top bits are undefined], and vector
692 /// extending loads [load into low elt].
702 //===--------------------------------------------------------------------===//
703 /// ISD::CondCode enum - These are ordered carefully to make the bitfields
704 /// below work out, when considering SETFALSE (something that never exists
705 /// dynamically) as 0. "U" -> Unsigned (for integer operands) or Unordered
706 /// (for floating point), "L" -> Less than, "G" -> Greater than, "E" -> Equal
707 /// to. If the "N" column is 1, the result of the comparison is undefined if
708 /// the input is a NAN.
710 /// All of these (except for the 'always folded ops') should be handled for
711 /// floating point. For integer, only the SETEQ,SETNE,SETLT,SETLE,SETGT,
712 /// SETGE,SETULT,SETULE,SETUGT, and SETUGE opcodes are used.
714 /// Note that these are laid out in a specific order to allow bit-twiddling
715 /// to transform conditions.
717 // Opcode N U L G E Intuitive operation
718 SETFALSE, // 0 0 0 0 Always false (always folded)
719 SETOEQ, // 0 0 0 1 True if ordered and equal
720 SETOGT, // 0 0 1 0 True if ordered and greater than
721 SETOGE, // 0 0 1 1 True if ordered and greater than or equal
722 SETOLT, // 0 1 0 0 True if ordered and less than
723 SETOLE, // 0 1 0 1 True if ordered and less than or equal
724 SETONE, // 0 1 1 0 True if ordered and operands are unequal
725 SETO, // 0 1 1 1 True if ordered (no nans)
726 SETUO, // 1 0 0 0 True if unordered: isnan(X) | isnan(Y)
727 SETUEQ, // 1 0 0 1 True if unordered or equal
728 SETUGT, // 1 0 1 0 True if unordered or greater than
729 SETUGE, // 1 0 1 1 True if unordered, greater than, or equal
730 SETULT, // 1 1 0 0 True if unordered or less than
731 SETULE, // 1 1 0 1 True if unordered, less than, or equal
732 SETUNE, // 1 1 1 0 True if unordered or not equal
733 SETTRUE, // 1 1 1 1 Always true (always folded)
734 // Don't care operations: undefined if the input is a nan.
735 SETFALSE2, // 1 X 0 0 0 Always false (always folded)
736 SETEQ, // 1 X 0 0 1 True if equal
737 SETGT, // 1 X 0 1 0 True if greater than
738 SETGE, // 1 X 0 1 1 True if greater than or equal
739 SETLT, // 1 X 1 0 0 True if less than
740 SETLE, // 1 X 1 0 1 True if less than or equal
741 SETNE, // 1 X 1 1 0 True if not equal
742 SETTRUE2, // 1 X 1 1 1 Always true (always folded)
744 SETCC_INVALID // Marker value.
747 /// isSignedIntSetCC - Return true if this is a setcc instruction that
748 /// performs a signed comparison when used with integer operands.
749 inline bool isSignedIntSetCC(CondCode Code) {
750 return Code == SETGT || Code == SETGE || Code == SETLT || Code == SETLE;
753 /// isUnsignedIntSetCC - Return true if this is a setcc instruction that
754 /// performs an unsigned comparison when used with integer operands.
755 inline bool isUnsignedIntSetCC(CondCode Code) {
756 return Code == SETUGT || Code == SETUGE || Code == SETULT || Code == SETULE;
759 /// isTrueWhenEqual - Return true if the specified condition returns true if
760 /// the two operands to the condition are equal. Note that if one of the two
761 /// operands is a NaN, this value is meaningless.
762 inline bool isTrueWhenEqual(CondCode Cond) {
763 return ((int)Cond & 1) != 0;
766 /// getUnorderedFlavor - This function returns 0 if the condition is always
767 /// false if an operand is a NaN, 1 if the condition is always true if the
768 /// operand is a NaN, and 2 if the condition is undefined if the operand is a
770 inline unsigned getUnorderedFlavor(CondCode Cond) {
771 return ((int)Cond >> 3) & 3;
774 /// getSetCCInverse - Return the operation corresponding to !(X op Y), where
775 /// 'op' is a valid SetCC operation.
776 CondCode getSetCCInverse(CondCode Operation, bool isInteger);
778 /// getSetCCSwappedOperands - Return the operation corresponding to (Y op X)
779 /// when given the operation for (X op Y).
780 CondCode getSetCCSwappedOperands(CondCode Operation);
782 /// getSetCCOrOperation - Return the result of a logical OR between different
783 /// comparisons of identical values: ((X op1 Y) | (X op2 Y)). This
784 /// function returns SETCC_INVALID if it is not possible to represent the
785 /// resultant comparison.
786 CondCode getSetCCOrOperation(CondCode Op1, CondCode Op2, bool isInteger);
788 /// getSetCCAndOperation - Return the result of a logical AND between
789 /// different comparisons of identical values: ((X op1 Y) & (X op2 Y)). This
790 /// function returns SETCC_INVALID if it is not possible to represent the
791 /// resultant comparison.
792 CondCode getSetCCAndOperation(CondCode Op1, CondCode Op2, bool isInteger);
793 } // end llvm::ISD namespace
796 //===----------------------------------------------------------------------===//
797 /// SDOperand - Unlike LLVM values, Selection DAG nodes may return multiple
798 /// values as the result of a computation. Many nodes return multiple values,
799 /// from loads (which define a token and a return value) to ADDC (which returns
800 /// a result and a carry value), to calls (which may return an arbitrary number
803 /// As such, each use of a SelectionDAG computation must indicate the node that
804 /// computes it as well as which return value to use from that node. This pair
805 /// of information is represented with the SDOperand value type.
809 SDNode *Val; // The node defining the value we are using.
810 unsigned ResNo; // Which return value of the node we are using.
812 SDOperand() : Val(0), ResNo(0) {}
813 SDOperand(SDNode *val, unsigned resno) : Val(val), ResNo(resno) {}
815 bool operator==(const SDOperand &O) const {
816 return Val == O.Val && ResNo == O.ResNo;
818 bool operator!=(const SDOperand &O) const {
819 return !operator==(O);
821 bool operator<(const SDOperand &O) const {
822 return Val < O.Val || (Val == O.Val && ResNo < O.ResNo);
825 SDOperand getValue(unsigned R) const {
826 return SDOperand(Val, R);
829 // isOperandOf - Return true if this node is an operand of N.
830 bool isOperandOf(SDNode *N) const;
832 /// getValueType - Return the ValueType of the referenced return value.
834 inline MVT::ValueType getValueType() const;
836 /// getValueSizeInBits - Returns MVT::getSizeInBits(getValueType()).
838 unsigned getValueSizeInBits() const {
839 return MVT::getSizeInBits(getValueType());
842 // Forwarding methods - These forward to the corresponding methods in SDNode.
843 inline unsigned getOpcode() const;
844 inline unsigned getNumOperands() const;
845 inline const SDOperand &getOperand(unsigned i) const;
846 inline uint64_t getConstantOperandVal(unsigned i) const;
847 inline bool isTargetOpcode() const;
848 inline unsigned getTargetOpcode() const;
851 /// reachesChainWithoutSideEffects - Return true if this operand (which must
852 /// be a chain) reaches the specified operand without crossing any
853 /// side-effecting instructions. In practice, this looks through token
854 /// factors and non-volatile loads. In order to remain efficient, this only
855 /// looks a couple of nodes in, it does not do an exhaustive search.
856 bool reachesChainWithoutSideEffects(SDOperand Dest, unsigned Depth = 2) const;
858 /// hasOneUse - Return true if there is exactly one operation using this
859 /// result value of the defining operator.
860 inline bool hasOneUse() const;
862 /// use_empty - Return true if there are no operations using this
863 /// result value of the defining operator.
864 inline bool use_empty() const;
868 template<> struct DenseMapInfo<SDOperand> {
869 static inline SDOperand getEmptyKey() { return SDOperand((SDNode*)-1, -1U); }
870 static inline SDOperand getTombstoneKey() { return SDOperand((SDNode*)-1, 0);}
871 static unsigned getHashValue(const SDOperand &Val) {
872 return ((unsigned)((uintptr_t)Val.Val >> 4) ^
873 (unsigned)((uintptr_t)Val.Val >> 9)) + Val.ResNo;
875 static bool isEqual(const SDOperand &LHS, const SDOperand &RHS) {
878 static bool isPod() { return true; }
881 /// simplify_type specializations - Allow casting operators to work directly on
882 /// SDOperands as if they were SDNode*'s.
883 template<> struct simplify_type<SDOperand> {
884 typedef SDNode* SimpleType;
885 static SimpleType getSimplifiedValue(const SDOperand &Val) {
886 return static_cast<SimpleType>(Val.Val);
889 template<> struct simplify_type<const SDOperand> {
890 typedef SDNode* SimpleType;
891 static SimpleType getSimplifiedValue(const SDOperand &Val) {
892 return static_cast<SimpleType>(Val.Val);
897 /// SDNode - Represents one node in the SelectionDAG.
899 class SDNode : public FoldingSetNode {
900 /// NodeType - The operation that this node performs.
902 unsigned short NodeType;
904 /// OperandsNeedDelete - This is true if OperandList was new[]'d. If true,
905 /// then they will be delete[]'d when the node is destroyed.
906 bool OperandsNeedDelete : 1;
908 /// NodeId - Unique id per SDNode in the DAG.
911 /// OperandList - The values that are used by this operation.
913 SDOperand *OperandList;
915 /// ValueList - The types of the values this node defines. SDNode's may
916 /// define multiple values simultaneously.
917 const MVT::ValueType *ValueList;
919 /// NumOperands/NumValues - The number of entries in the Operand/Value list.
920 unsigned short NumOperands, NumValues;
922 /// Prev/Next pointers - These pointers form the linked list of of the
923 /// AllNodes list in the current DAG.
925 friend struct ilist_traits<SDNode>;
927 /// Uses - These are all of the SDNode's that use a value produced by this
929 SmallVector<SDNode*,3> Uses;
931 // Out-of-line virtual method to give class a home.
932 virtual void ANCHOR();
935 assert(NumOperands == 0 && "Operand list not cleared before deletion");
936 NodeType = ISD::DELETED_NODE;
939 //===--------------------------------------------------------------------===//
942 unsigned getOpcode() const { return NodeType; }
943 bool isTargetOpcode() const { return NodeType >= ISD::BUILTIN_OP_END; }
944 unsigned getTargetOpcode() const {
945 assert(isTargetOpcode() && "Not a target opcode!");
946 return NodeType - ISD::BUILTIN_OP_END;
949 size_t use_size() const { return Uses.size(); }
950 bool use_empty() const { return Uses.empty(); }
951 bool hasOneUse() const { return Uses.size() == 1; }
953 /// getNodeId - Return the unique node id.
955 int getNodeId() const { return NodeId; }
957 /// setNodeId - Set unique node id.
958 void setNodeId(int Id) { NodeId = Id; }
960 typedef SmallVector<SDNode*,3>::const_iterator use_iterator;
961 use_iterator use_begin() const { return Uses.begin(); }
962 use_iterator use_end() const { return Uses.end(); }
964 /// hasNUsesOfValue - Return true if there are exactly NUSES uses of the
965 /// indicated value. This method ignores uses of other values defined by this
967 bool hasNUsesOfValue(unsigned NUses, unsigned Value) const;
969 /// hasAnyUseOfValue - Return true if there are any use of the indicated
970 /// value. This method ignores uses of other values defined by this operation.
971 bool hasAnyUseOfValue(unsigned Value) const;
973 /// isOnlyUseOf - Return true if this node is the only use of N.
975 bool isOnlyUseOf(SDNode *N) const;
977 /// isOperandOf - Return true if this node is an operand of N.
979 bool isOperandOf(SDNode *N) const;
981 /// isPredecessorOf - Return true if this node is a predecessor of N. This
982 /// node is either an operand of N or it can be reached by recursively
983 /// traversing up the operands.
984 /// NOTE: this is an expensive method. Use it carefully.
985 bool isPredecessorOf(SDNode *N) const;
987 /// getNumOperands - Return the number of values used by this operation.
989 unsigned getNumOperands() const { return NumOperands; }
991 /// getConstantOperandVal - Helper method returns the integer value of a
992 /// ConstantSDNode operand.
993 uint64_t getConstantOperandVal(unsigned Num) const;
995 const SDOperand &getOperand(unsigned Num) const {
996 assert(Num < NumOperands && "Invalid child # of SDNode!");
997 return OperandList[Num];
1000 typedef const SDOperand* op_iterator;
1001 op_iterator op_begin() const { return OperandList; }
1002 op_iterator op_end() const { return OperandList+NumOperands; }
1005 SDVTList getVTList() const {
1006 SDVTList X = { ValueList, NumValues };
1010 /// getNumValues - Return the number of values defined/returned by this
1013 unsigned getNumValues() const { return NumValues; }
1015 /// getValueType - Return the type of a specified result.
1017 MVT::ValueType getValueType(unsigned ResNo) const {
1018 assert(ResNo < NumValues && "Illegal result number!");
1019 return ValueList[ResNo];
1022 /// getValueSizeInBits - Returns MVT::getSizeInBits(getValueType(ResNo)).
1024 unsigned getValueSizeInBits(unsigned ResNo) const {
1025 return MVT::getSizeInBits(getValueType(ResNo));
1028 typedef const MVT::ValueType* value_iterator;
1029 value_iterator value_begin() const { return ValueList; }
1030 value_iterator value_end() const { return ValueList+NumValues; }
1032 /// getOperationName - Return the opcode of this operation for printing.
1034 std::string getOperationName(const SelectionDAG *G = 0) const;
1035 static const char* getIndexedModeName(ISD::MemIndexedMode AM);
1037 void dump(const SelectionDAG *G) const;
1039 static bool classof(const SDNode *) { return true; }
1041 /// Profile - Gather unique data for the node.
1043 void Profile(FoldingSetNodeID &ID);
1046 friend class SelectionDAG;
1048 /// getValueTypeList - Return a pointer to the specified value type.
1050 static const MVT::ValueType *getValueTypeList(MVT::ValueType VT);
1051 static SDVTList getSDVTList(MVT::ValueType VT) {
1052 SDVTList Ret = { getValueTypeList(VT), 1 };
1056 SDNode(unsigned Opc, SDVTList VTs, const SDOperand *Ops, unsigned NumOps)
1057 : NodeType(Opc), NodeId(-1) {
1058 OperandsNeedDelete = true;
1059 NumOperands = NumOps;
1060 OperandList = NumOps ? new SDOperand[NumOperands] : 0;
1062 for (unsigned i = 0; i != NumOps; ++i) {
1063 OperandList[i] = Ops[i];
1064 Ops[i].Val->Uses.push_back(this);
1067 ValueList = VTs.VTs;
1068 NumValues = VTs.NumVTs;
1071 SDNode(unsigned Opc, SDVTList VTs) : NodeType(Opc), NodeId(-1) {
1072 OperandsNeedDelete = false; // Operands set with InitOperands.
1076 ValueList = VTs.VTs;
1077 NumValues = VTs.NumVTs;
1081 /// InitOperands - Initialize the operands list of this node with the
1082 /// specified values, which are part of the node (thus they don't need to be
1083 /// copied in or allocated).
1084 void InitOperands(SDOperand *Ops, unsigned NumOps) {
1085 assert(OperandList == 0 && "Operands already set!");
1086 NumOperands = NumOps;
1089 for (unsigned i = 0; i != NumOps; ++i)
1090 Ops[i].Val->Uses.push_back(this);
1093 /// MorphNodeTo - This frees the operands of the current node, resets the
1094 /// opcode, types, and operands to the specified value. This should only be
1095 /// used by the SelectionDAG class.
1096 void MorphNodeTo(unsigned Opc, SDVTList L,
1097 const SDOperand *Ops, unsigned NumOps);
1099 void addUser(SDNode *User) {
1100 Uses.push_back(User);
1102 void removeUser(SDNode *User) {
1103 // Remove this user from the operand's use list.
1104 for (unsigned i = Uses.size(); ; --i) {
1105 assert(i != 0 && "Didn't find user!");
1106 if (Uses[i-1] == User) {
1107 Uses[i-1] = Uses.back();
1116 // Define inline functions from the SDOperand class.
1118 inline unsigned SDOperand::getOpcode() const {
1119 return Val->getOpcode();
1121 inline MVT::ValueType SDOperand::getValueType() const {
1122 return Val->getValueType(ResNo);
1124 inline unsigned SDOperand::getNumOperands() const {
1125 return Val->getNumOperands();
1127 inline const SDOperand &SDOperand::getOperand(unsigned i) const {
1128 return Val->getOperand(i);
1130 inline uint64_t SDOperand::getConstantOperandVal(unsigned i) const {
1131 return Val->getConstantOperandVal(i);
1133 inline bool SDOperand::isTargetOpcode() const {
1134 return Val->isTargetOpcode();
1136 inline unsigned SDOperand::getTargetOpcode() const {
1137 return Val->getTargetOpcode();
1139 inline bool SDOperand::hasOneUse() const {
1140 return Val->hasNUsesOfValue(1, ResNo);
1142 inline bool SDOperand::use_empty() const {
1143 return !Val->hasAnyUseOfValue(ResNo);
1146 /// UnarySDNode - This class is used for single-operand SDNodes. This is solely
1147 /// to allow co-allocation of node operands with the node itself.
1148 class UnarySDNode : public SDNode {
1149 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1152 UnarySDNode(unsigned Opc, SDVTList VTs, SDOperand X)
1153 : SDNode(Opc, VTs), Op(X) {
1154 InitOperands(&Op, 1);
1158 /// BinarySDNode - This class is used for two-operand SDNodes. This is solely
1159 /// to allow co-allocation of node operands with the node itself.
1160 class BinarySDNode : public SDNode {
1161 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1164 BinarySDNode(unsigned Opc, SDVTList VTs, SDOperand X, SDOperand Y)
1165 : SDNode(Opc, VTs) {
1168 InitOperands(Ops, 2);
1172 /// TernarySDNode - This class is used for three-operand SDNodes. This is solely
1173 /// to allow co-allocation of node operands with the node itself.
1174 class TernarySDNode : public SDNode {
1175 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1178 TernarySDNode(unsigned Opc, SDVTList VTs, SDOperand X, SDOperand Y,
1180 : SDNode(Opc, VTs) {
1184 InitOperands(Ops, 3);
1189 /// HandleSDNode - This class is used to form a handle around another node that
1190 /// is persistant and is updated across invocations of replaceAllUsesWith on its
1191 /// operand. This node should be directly created by end-users and not added to
1192 /// the AllNodes list.
1193 class HandleSDNode : public SDNode {
1194 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1197 explicit HandleSDNode(SDOperand X)
1198 : SDNode(ISD::HANDLENODE, getSDVTList(MVT::Other)), Op(X) {
1199 InitOperands(&Op, 1);
1202 SDOperand getValue() const { return Op; }
1205 class AtomicSDNode : public SDNode {
1206 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1208 MVT::ValueType OrigVT;
1210 AtomicSDNode(unsigned Opc, SDVTList VTL, SDOperand Chain, SDOperand Ptr,
1211 SDOperand Cmp, SDOperand Swp, MVT::ValueType VT)
1212 : SDNode(Opc, VTL) {
1217 InitOperands(Ops, 4);
1220 AtomicSDNode(unsigned Opc, SDVTList VTL, SDOperand Chain, SDOperand Ptr,
1221 SDOperand Val, MVT::ValueType VT)
1222 : SDNode(Opc, VTL) {
1226 InitOperands(Ops, 3);
1229 MVT::ValueType getVT() const { return OrigVT; }
1230 bool isCompareAndSwap() const { return getOpcode() == ISD::ATOMIC_LCS; }
1233 class StringSDNode : public SDNode {
1235 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1237 friend class SelectionDAG;
1238 explicit StringSDNode(const std::string &val)
1239 : SDNode(ISD::STRING, getSDVTList(MVT::Other)), Value(val) {
1242 const std::string &getValue() const { return Value; }
1243 static bool classof(const StringSDNode *) { return true; }
1244 static bool classof(const SDNode *N) {
1245 return N->getOpcode() == ISD::STRING;
1249 class ConstantSDNode : public SDNode {
1251 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1253 friend class SelectionDAG;
1254 ConstantSDNode(bool isTarget, const APInt &val, MVT::ValueType VT)
1255 : SDNode(isTarget ? ISD::TargetConstant : ISD::Constant, getSDVTList(VT)),
1260 const APInt &getAPIntValue() const { return Value; }
1261 uint64_t getValue() const { return Value.getZExtValue(); }
1263 int64_t getSignExtended() const {
1264 unsigned Bits = MVT::getSizeInBits(getValueType(0));
1265 return ((int64_t)Value.getZExtValue() << (64-Bits)) >> (64-Bits);
1268 bool isNullValue() const { return Value == 0; }
1269 bool isAllOnesValue() const {
1270 return Value == MVT::getIntVTBitMask(getValueType(0));
1273 static bool classof(const ConstantSDNode *) { return true; }
1274 static bool classof(const SDNode *N) {
1275 return N->getOpcode() == ISD::Constant ||
1276 N->getOpcode() == ISD::TargetConstant;
1280 class ConstantFPSDNode : public SDNode {
1282 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1284 friend class SelectionDAG;
1285 ConstantFPSDNode(bool isTarget, const APFloat& val, MVT::ValueType VT)
1286 : SDNode(isTarget ? ISD::TargetConstantFP : ISD::ConstantFP,
1287 getSDVTList(VT)), Value(val) {
1291 const APFloat& getValueAPF() const { return Value; }
1293 /// isExactlyValue - We don't rely on operator== working on double values, as
1294 /// it returns true for things that are clearly not equal, like -0.0 and 0.0.
1295 /// As such, this method can be used to do an exact bit-for-bit comparison of
1296 /// two floating point values.
1298 /// We leave the version with the double argument here because it's just so
1299 /// convenient to write "2.0" and the like. Without this function we'd
1300 /// have to duplicate its logic everywhere it's called.
1301 bool isExactlyValue(double V) const {
1303 Tmp.convert(Value.getSemantics(), APFloat::rmNearestTiesToEven);
1304 return isExactlyValue(Tmp);
1306 bool isExactlyValue(const APFloat& V) const;
1308 bool isValueValidForType(MVT::ValueType VT, const APFloat& Val);
1310 static bool classof(const ConstantFPSDNode *) { return true; }
1311 static bool classof(const SDNode *N) {
1312 return N->getOpcode() == ISD::ConstantFP ||
1313 N->getOpcode() == ISD::TargetConstantFP;
1317 class GlobalAddressSDNode : public SDNode {
1318 GlobalValue *TheGlobal;
1320 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1322 friend class SelectionDAG;
1323 GlobalAddressSDNode(bool isTarget, const GlobalValue *GA, MVT::ValueType VT,
1327 GlobalValue *getGlobal() const { return TheGlobal; }
1328 int getOffset() const { return Offset; }
1330 static bool classof(const GlobalAddressSDNode *) { return true; }
1331 static bool classof(const SDNode *N) {
1332 return N->getOpcode() == ISD::GlobalAddress ||
1333 N->getOpcode() == ISD::TargetGlobalAddress ||
1334 N->getOpcode() == ISD::GlobalTLSAddress ||
1335 N->getOpcode() == ISD::TargetGlobalTLSAddress;
1339 class FrameIndexSDNode : public SDNode {
1341 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1343 friend class SelectionDAG;
1344 FrameIndexSDNode(int fi, MVT::ValueType VT, bool isTarg)
1345 : SDNode(isTarg ? ISD::TargetFrameIndex : ISD::FrameIndex, getSDVTList(VT)),
1350 int getIndex() const { return FI; }
1352 static bool classof(const FrameIndexSDNode *) { return true; }
1353 static bool classof(const SDNode *N) {
1354 return N->getOpcode() == ISD::FrameIndex ||
1355 N->getOpcode() == ISD::TargetFrameIndex;
1359 class JumpTableSDNode : public SDNode {
1361 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1363 friend class SelectionDAG;
1364 JumpTableSDNode(int jti, MVT::ValueType VT, bool isTarg)
1365 : SDNode(isTarg ? ISD::TargetJumpTable : ISD::JumpTable, getSDVTList(VT)),
1370 int getIndex() const { return JTI; }
1372 static bool classof(const JumpTableSDNode *) { return true; }
1373 static bool classof(const SDNode *N) {
1374 return N->getOpcode() == ISD::JumpTable ||
1375 N->getOpcode() == ISD::TargetJumpTable;
1379 class ConstantPoolSDNode : public SDNode {
1382 MachineConstantPoolValue *MachineCPVal;
1384 int Offset; // It's a MachineConstantPoolValue if top bit is set.
1386 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1388 friend class SelectionDAG;
1389 ConstantPoolSDNode(bool isTarget, Constant *c, MVT::ValueType VT,
1391 : SDNode(isTarget ? ISD::TargetConstantPool : ISD::ConstantPool,
1392 getSDVTList(VT)), Offset(o), Alignment(0) {
1393 assert((int)Offset >= 0 && "Offset is too large");
1396 ConstantPoolSDNode(bool isTarget, Constant *c, MVT::ValueType VT, int o,
1398 : SDNode(isTarget ? ISD::TargetConstantPool : ISD::ConstantPool,
1399 getSDVTList(VT)), Offset(o), Alignment(Align) {
1400 assert((int)Offset >= 0 && "Offset is too large");
1403 ConstantPoolSDNode(bool isTarget, MachineConstantPoolValue *v,
1404 MVT::ValueType VT, int o=0)
1405 : SDNode(isTarget ? ISD::TargetConstantPool : ISD::ConstantPool,
1406 getSDVTList(VT)), Offset(o), Alignment(0) {
1407 assert((int)Offset >= 0 && "Offset is too large");
1408 Val.MachineCPVal = v;
1409 Offset |= 1 << (sizeof(unsigned)*8-1);
1411 ConstantPoolSDNode(bool isTarget, MachineConstantPoolValue *v,
1412 MVT::ValueType VT, int o, unsigned Align)
1413 : SDNode(isTarget ? ISD::TargetConstantPool : ISD::ConstantPool,
1414 getSDVTList(VT)), Offset(o), Alignment(Align) {
1415 assert((int)Offset >= 0 && "Offset is too large");
1416 Val.MachineCPVal = v;
1417 Offset |= 1 << (sizeof(unsigned)*8-1);
1421 bool isMachineConstantPoolEntry() const {
1422 return (int)Offset < 0;
1425 Constant *getConstVal() const {
1426 assert(!isMachineConstantPoolEntry() && "Wrong constantpool type");
1427 return Val.ConstVal;
1430 MachineConstantPoolValue *getMachineCPVal() const {
1431 assert(isMachineConstantPoolEntry() && "Wrong constantpool type");
1432 return Val.MachineCPVal;
1435 int getOffset() const {
1436 return Offset & ~(1 << (sizeof(unsigned)*8-1));
1439 // Return the alignment of this constant pool object, which is either 0 (for
1440 // default alignment) or log2 of the desired value.
1441 unsigned getAlignment() const { return Alignment; }
1443 const Type *getType() const;
1445 static bool classof(const ConstantPoolSDNode *) { return true; }
1446 static bool classof(const SDNode *N) {
1447 return N->getOpcode() == ISD::ConstantPool ||
1448 N->getOpcode() == ISD::TargetConstantPool;
1452 class BasicBlockSDNode : public SDNode {
1453 MachineBasicBlock *MBB;
1454 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1456 friend class SelectionDAG;
1457 explicit BasicBlockSDNode(MachineBasicBlock *mbb)
1458 : SDNode(ISD::BasicBlock, getSDVTList(MVT::Other)), MBB(mbb) {
1462 MachineBasicBlock *getBasicBlock() const { return MBB; }
1464 static bool classof(const BasicBlockSDNode *) { return true; }
1465 static bool classof(const SDNode *N) {
1466 return N->getOpcode() == ISD::BasicBlock;
1470 /// SrcValueSDNode - An SDNode that holds an arbitrary LLVM IR Value. This is
1471 /// used when the SelectionDAG needs to make a simple reference to something
1472 /// in the LLVM IR representation.
1474 /// Note that this is not used for carrying alias information; that is done
1475 /// with MemOperandSDNode, which includes a Value which is required to be a
1476 /// pointer, and several other fields specific to memory references.
1478 class SrcValueSDNode : public SDNode {
1480 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1482 friend class SelectionDAG;
1483 /// Create a SrcValue for a general value.
1484 explicit SrcValueSDNode(const Value *v)
1485 : SDNode(ISD::SRCVALUE, getSDVTList(MVT::Other)), V(v) {}
1488 /// getValue - return the contained Value.
1489 const Value *getValue() const { return V; }
1491 static bool classof(const SrcValueSDNode *) { return true; }
1492 static bool classof(const SDNode *N) {
1493 return N->getOpcode() == ISD::SRCVALUE;
1498 /// MemOperandSDNode - An SDNode that holds a MemOperand. This is
1499 /// used to represent a reference to memory after ISD::LOAD
1500 /// and ISD::STORE have been lowered.
1502 class MemOperandSDNode : public SDNode {
1503 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1505 friend class SelectionDAG;
1506 /// Create a MemOperand node
1507 explicit MemOperandSDNode(const MemOperand &mo)
1508 : SDNode(ISD::MEMOPERAND, getSDVTList(MVT::Other)), MO(mo) {}
1511 /// MO - The contained MemOperand.
1512 const MemOperand MO;
1514 static bool classof(const MemOperandSDNode *) { return true; }
1515 static bool classof(const SDNode *N) {
1516 return N->getOpcode() == ISD::MEMOPERAND;
1521 class RegisterSDNode : public SDNode {
1523 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1525 friend class SelectionDAG;
1526 RegisterSDNode(unsigned reg, MVT::ValueType VT)
1527 : SDNode(ISD::Register, getSDVTList(VT)), Reg(reg) {
1531 unsigned getReg() const { return Reg; }
1533 static bool classof(const RegisterSDNode *) { return true; }
1534 static bool classof(const SDNode *N) {
1535 return N->getOpcode() == ISD::Register;
1539 class ExternalSymbolSDNode : public SDNode {
1541 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1543 friend class SelectionDAG;
1544 ExternalSymbolSDNode(bool isTarget, const char *Sym, MVT::ValueType VT)
1545 : SDNode(isTarget ? ISD::TargetExternalSymbol : ISD::ExternalSymbol,
1546 getSDVTList(VT)), Symbol(Sym) {
1550 const char *getSymbol() const { return Symbol; }
1552 static bool classof(const ExternalSymbolSDNode *) { return true; }
1553 static bool classof(const SDNode *N) {
1554 return N->getOpcode() == ISD::ExternalSymbol ||
1555 N->getOpcode() == ISD::TargetExternalSymbol;
1559 class CondCodeSDNode : public SDNode {
1560 ISD::CondCode Condition;
1561 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1563 friend class SelectionDAG;
1564 explicit CondCodeSDNode(ISD::CondCode Cond)
1565 : SDNode(ISD::CONDCODE, getSDVTList(MVT::Other)), Condition(Cond) {
1569 ISD::CondCode get() const { return Condition; }
1571 static bool classof(const CondCodeSDNode *) { return true; }
1572 static bool classof(const SDNode *N) {
1573 return N->getOpcode() == ISD::CONDCODE;
1577 /// VTSDNode - This class is used to represent MVT::ValueType's, which are used
1578 /// to parameterize some operations.
1579 class VTSDNode : public SDNode {
1580 MVT::ValueType ValueType;
1581 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1583 friend class SelectionDAG;
1584 explicit VTSDNode(MVT::ValueType VT)
1585 : SDNode(ISD::VALUETYPE, getSDVTList(MVT::Other)), ValueType(VT) {
1589 MVT::ValueType getVT() const { return ValueType; }
1591 static bool classof(const VTSDNode *) { return true; }
1592 static bool classof(const SDNode *N) {
1593 return N->getOpcode() == ISD::VALUETYPE;
1597 /// LSBaseSDNode - Base class for LoadSDNode and StoreSDNode
1599 class LSBaseSDNode : public SDNode {
1601 // AddrMode - unindexed, pre-indexed, post-indexed.
1602 ISD::MemIndexedMode AddrMode;
1604 // MemoryVT - VT of in-memory value.
1605 MVT::ValueType MemoryVT;
1607 //! SrcValue - Memory location for alias analysis.
1608 const Value *SrcValue;
1610 //! SVOffset - Memory location offset.
1613 //! Alignment - Alignment of memory location in bytes.
1616 //! IsVolatile - True if the store is volatile.
1619 //! Operand array for load and store
1621 \note Moving this array to the base class captures more
1622 common functionality shared between LoadSDNode and
1627 LSBaseSDNode(ISD::NodeType NodeTy, SDOperand *Operands, unsigned NumOperands,
1628 SDVTList VTs, ISD::MemIndexedMode AM, MVT::ValueType VT,
1629 const Value *SV, int SVO, unsigned Align, bool Vol)
1630 : SDNode(NodeTy, VTs),
1631 AddrMode(AM), MemoryVT(VT),
1632 SrcValue(SV), SVOffset(SVO), Alignment(Align), IsVolatile(Vol) {
1633 for (unsigned i = 0; i != NumOperands; ++i)
1634 Ops[i] = Operands[i];
1635 InitOperands(Ops, NumOperands);
1636 assert(Align != 0 && "Loads and stores should have non-zero aligment");
1637 assert((getOffset().getOpcode() == ISD::UNDEF || isIndexed()) &&
1638 "Only indexed loads and stores have a non-undef offset operand");
1641 const SDOperand &getChain() const { return getOperand(0); }
1642 const SDOperand &getBasePtr() const {
1643 return getOperand(getOpcode() == ISD::LOAD ? 1 : 2);
1645 const SDOperand &getOffset() const {
1646 return getOperand(getOpcode() == ISD::LOAD ? 2 : 3);
1649 const Value *getSrcValue() const { return SrcValue; }
1650 int getSrcValueOffset() const { return SVOffset; }
1651 unsigned getAlignment() const { return Alignment; }
1652 MVT::ValueType getMemoryVT() const { return MemoryVT; }
1653 bool isVolatile() const { return IsVolatile; }
1655 ISD::MemIndexedMode getAddressingMode() const { return AddrMode; }
1657 /// isIndexed - Return true if this is a pre/post inc/dec load/store.
1658 bool isIndexed() const { return AddrMode != ISD::UNINDEXED; }
1660 /// isUnindexed - Return true if this is NOT a pre/post inc/dec load/store.
1661 bool isUnindexed() const { return AddrMode == ISD::UNINDEXED; }
1663 /// getMemOperand - Return a MemOperand object describing the memory
1664 /// reference performed by this load or store.
1665 MemOperand getMemOperand() const;
1667 static bool classof(const LSBaseSDNode *N) { return true; }
1668 static bool classof(const SDNode *N) {
1669 return N->getOpcode() == ISD::LOAD ||
1670 N->getOpcode() == ISD::STORE;
1674 /// LoadSDNode - This class is used to represent ISD::LOAD nodes.
1676 class LoadSDNode : public LSBaseSDNode {
1677 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1679 // ExtType - non-ext, anyext, sext, zext.
1680 ISD::LoadExtType ExtType;
1683 friend class SelectionDAG;
1684 LoadSDNode(SDOperand *ChainPtrOff, SDVTList VTs,
1685 ISD::MemIndexedMode AM, ISD::LoadExtType ETy, MVT::ValueType LVT,
1686 const Value *SV, int O=0, unsigned Align=0, bool Vol=false)
1687 : LSBaseSDNode(ISD::LOAD, ChainPtrOff, 3,
1688 VTs, AM, LVT, SV, O, Align, Vol),
1692 ISD::LoadExtType getExtensionType() const { return ExtType; }
1693 const SDOperand &getBasePtr() const { return getOperand(1); }
1694 const SDOperand &getOffset() const { return getOperand(2); }
1696 static bool classof(const LoadSDNode *) { return true; }
1697 static bool classof(const SDNode *N) {
1698 return N->getOpcode() == ISD::LOAD;
1702 /// StoreSDNode - This class is used to represent ISD::STORE nodes.
1704 class StoreSDNode : public LSBaseSDNode {
1705 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1707 // IsTruncStore - True if the op does a truncation before store.
1710 friend class SelectionDAG;
1711 StoreSDNode(SDOperand *ChainValuePtrOff, SDVTList VTs,
1712 ISD::MemIndexedMode AM, bool isTrunc, MVT::ValueType SVT,
1713 const Value *SV, int O=0, unsigned Align=0, bool Vol=false)
1714 : LSBaseSDNode(ISD::STORE, ChainValuePtrOff, 4,
1715 VTs, AM, SVT, SV, O, Align, Vol),
1716 IsTruncStore(isTrunc) {}
1719 bool isTruncatingStore() const { return IsTruncStore; }
1720 const SDOperand &getValue() const { return getOperand(1); }
1721 const SDOperand &getBasePtr() const { return getOperand(2); }
1722 const SDOperand &getOffset() const { return getOperand(3); }
1724 static bool classof(const StoreSDNode *) { return true; }
1725 static bool classof(const SDNode *N) {
1726 return N->getOpcode() == ISD::STORE;
1731 class SDNodeIterator : public forward_iterator<SDNode, ptrdiff_t> {
1735 SDNodeIterator(SDNode *N, unsigned Op) : Node(N), Operand(Op) {}
1737 bool operator==(const SDNodeIterator& x) const {
1738 return Operand == x.Operand;
1740 bool operator!=(const SDNodeIterator& x) const { return !operator==(x); }
1742 const SDNodeIterator &operator=(const SDNodeIterator &I) {
1743 assert(I.Node == Node && "Cannot assign iterators to two different nodes!");
1744 Operand = I.Operand;
1748 pointer operator*() const {
1749 return Node->getOperand(Operand).Val;
1751 pointer operator->() const { return operator*(); }
1753 SDNodeIterator& operator++() { // Preincrement
1757 SDNodeIterator operator++(int) { // Postincrement
1758 SDNodeIterator tmp = *this; ++*this; return tmp;
1761 static SDNodeIterator begin(SDNode *N) { return SDNodeIterator(N, 0); }
1762 static SDNodeIterator end (SDNode *N) {
1763 return SDNodeIterator(N, N->getNumOperands());
1766 unsigned getOperand() const { return Operand; }
1767 const SDNode *getNode() const { return Node; }
1770 template <> struct GraphTraits<SDNode*> {
1771 typedef SDNode NodeType;
1772 typedef SDNodeIterator ChildIteratorType;
1773 static inline NodeType *getEntryNode(SDNode *N) { return N; }
1774 static inline ChildIteratorType child_begin(NodeType *N) {
1775 return SDNodeIterator::begin(N);
1777 static inline ChildIteratorType child_end(NodeType *N) {
1778 return SDNodeIterator::end(N);
1783 struct ilist_traits<SDNode> {
1784 static SDNode *getPrev(const SDNode *N) { return N->Prev; }
1785 static SDNode *getNext(const SDNode *N) { return N->Next; }
1787 static void setPrev(SDNode *N, SDNode *Prev) { N->Prev = Prev; }
1788 static void setNext(SDNode *N, SDNode *Next) { N->Next = Next; }
1790 static SDNode *createSentinel() {
1791 return new SDNode(ISD::EntryToken, SDNode::getSDVTList(MVT::Other));
1793 static void destroySentinel(SDNode *N) { delete N; }
1794 //static SDNode *createNode(const SDNode &V) { return new SDNode(V); }
1797 void addNodeToList(SDNode *NTy) {}
1798 void removeNodeFromList(SDNode *NTy) {}
1799 void transferNodesFromList(iplist<SDNode, ilist_traits> &L2,
1800 const ilist_iterator<SDNode> &X,
1801 const ilist_iterator<SDNode> &Y) {}
1805 /// isNormalLoad - Returns true if the specified node is a non-extending
1806 /// and unindexed load.
1807 inline bool isNormalLoad(const SDNode *N) {
1808 if (N->getOpcode() != ISD::LOAD)
1810 const LoadSDNode *Ld = cast<LoadSDNode>(N);
1811 return Ld->getExtensionType() == ISD::NON_EXTLOAD &&
1812 Ld->getAddressingMode() == ISD::UNINDEXED;
1815 /// isNON_EXTLoad - Returns true if the specified node is a non-extending
1817 inline bool isNON_EXTLoad(const SDNode *N) {
1818 return N->getOpcode() == ISD::LOAD &&
1819 cast<LoadSDNode>(N)->getExtensionType() == ISD::NON_EXTLOAD;
1822 /// isEXTLoad - Returns true if the specified node is a EXTLOAD.
1824 inline bool isEXTLoad(const SDNode *N) {
1825 return N->getOpcode() == ISD::LOAD &&
1826 cast<LoadSDNode>(N)->getExtensionType() == ISD::EXTLOAD;
1829 /// isSEXTLoad - Returns true if the specified node is a SEXTLOAD.
1831 inline bool isSEXTLoad(const SDNode *N) {
1832 return N->getOpcode() == ISD::LOAD &&
1833 cast<LoadSDNode>(N)->getExtensionType() == ISD::SEXTLOAD;
1836 /// isZEXTLoad - Returns true if the specified node is a ZEXTLOAD.
1838 inline bool isZEXTLoad(const SDNode *N) {
1839 return N->getOpcode() == ISD::LOAD &&
1840 cast<LoadSDNode>(N)->getExtensionType() == ISD::ZEXTLOAD;
1843 /// isUNINDEXEDLoad - Returns true if the specified node is a unindexed load.
1845 inline bool isUNINDEXEDLoad(const SDNode *N) {
1846 return N->getOpcode() == ISD::LOAD &&
1847 cast<LoadSDNode>(N)->getAddressingMode() == ISD::UNINDEXED;
1850 /// isNON_TRUNCStore - Returns true if the specified node is a non-truncating
1852 inline bool isNON_TRUNCStore(const SDNode *N) {
1853 return N->getOpcode() == ISD::STORE &&
1854 !cast<StoreSDNode>(N)->isTruncatingStore();
1857 /// isTRUNCStore - Returns true if the specified node is a truncating
1859 inline bool isTRUNCStore(const SDNode *N) {
1860 return N->getOpcode() == ISD::STORE &&
1861 cast<StoreSDNode>(N)->isTruncatingStore();
1866 } // end llvm namespace