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/CodeGen/ValueTypes.h"
28 #include "llvm/Support/DataTypes.h"
35 class MachineBasicBlock;
36 class MachineConstantPoolValue;
38 template <typename T> struct DenseMapInfo;
39 template <typename T> struct simplify_type;
40 template <typename T> struct ilist_traits;
41 template<typename NodeTy, typename Traits> class iplist;
42 template<typename NodeTy> class ilist_iterator;
44 /// SDVTList - This represents a list of ValueType's that has been intern'd by
45 /// a SelectionDAG. Instances of this simple value class are returned by
46 /// SelectionDAG::getVTList(...).
49 const MVT::ValueType *VTs;
50 unsigned short NumVTs;
53 /// ISD namespace - This namespace contains an enum which represents all of the
54 /// SelectionDAG node types and value types.
57 namespace ParamFlags {
60 ZExt = 1<<0, ///< Parameter should be zero extended
62 SExt = 1<<1, ///< Parameter should be sign extended
64 InReg = 1<<2, ///< Parameter should be passed in register
66 StructReturn = 1<<3, ///< Hidden struct-return pointer
68 ByVal = 1<<4, ///< Struct passed by value
70 Nest = 1<<5, ///< Parameter is nested function static chain
72 ByValAlign = 0xF << 6, //< The alignment of the struct
74 ByValSize = 0x1ffff << 10, //< The size of the struct
76 OrigAlignment = 0x1F<<27,
77 OrigAlignmentOffs = 27
81 //===--------------------------------------------------------------------===//
82 /// ISD::NodeType enum - This enum defines all of the operators valid in a
86 // DELETED_NODE - This is an illegal flag value that is used to catch
87 // errors. This opcode is not a legal opcode for any node.
90 // EntryToken - This is the marker used to indicate the start of the region.
93 // Token factor - This node takes multiple tokens as input and produces a
94 // single token result. This is used to represent the fact that the operand
95 // operators are independent of each other.
98 // AssertSext, AssertZext - These nodes record if a register contains a
99 // value that has already been zero or sign extended from a narrower type.
100 // These nodes take two operands. The first is the node that has already
101 // been extended, and the second is a value type node indicating the width
103 AssertSext, AssertZext,
105 // Various leaf nodes.
106 STRING, BasicBlock, VALUETYPE, CONDCODE, Register,
107 Constant, ConstantFP,
108 GlobalAddress, GlobalTLSAddress, FrameIndex,
109 JumpTable, ConstantPool, ExternalSymbol,
111 // The address of the GOT
114 // FRAMEADDR, RETURNADDR - These nodes represent llvm.frameaddress and
115 // llvm.returnaddress on the DAG. These nodes take one operand, the index
116 // of the frame or return address to return. An index of zero corresponds
117 // to the current function's frame or return address, an index of one to the
118 // parent's frame or return address, and so on.
119 FRAMEADDR, RETURNADDR,
121 // FRAME_TO_ARGS_OFFSET - This node represents offset from frame pointer to
122 // first (possible) on-stack argument. This is needed for correct stack
123 // adjustment during unwind.
124 FRAME_TO_ARGS_OFFSET,
126 // RESULT, OUTCHAIN = EXCEPTIONADDR(INCHAIN) - This node represents the
127 // address of the exception block on entry to an landing pad block.
130 // RESULT, OUTCHAIN = EHSELECTION(INCHAIN, EXCEPTION) - This node represents
131 // the selection index of the exception thrown.
134 // OUTCHAIN = EH_RETURN(INCHAIN, OFFSET, HANDLER) - This node represents
135 // 'eh_return' gcc dwarf builtin, which is used to return from
136 // exception. The general meaning is: adjust stack by OFFSET and pass
137 // execution to HANDLER. Many platform-related details also :)
140 // TargetConstant* - Like Constant*, but the DAG does not do any folding or
141 // simplification of the constant.
145 // TargetGlobalAddress - Like GlobalAddress, but the DAG does no folding or
146 // anything else with this node, and this is valid in the target-specific
147 // dag, turning into a GlobalAddress operand.
149 TargetGlobalTLSAddress,
153 TargetExternalSymbol,
155 /// RESULT = INTRINSIC_WO_CHAIN(INTRINSICID, arg1, arg2, ...)
156 /// This node represents a target intrinsic function with no side effects.
157 /// The first operand is the ID number of the intrinsic from the
158 /// llvm::Intrinsic namespace. The operands to the intrinsic follow. The
159 /// node has returns the result of the intrinsic.
162 /// RESULT,OUTCHAIN = INTRINSIC_W_CHAIN(INCHAIN, INTRINSICID, arg1, ...)
163 /// This node represents a target intrinsic function with side effects that
164 /// returns a result. The first operand is a chain pointer. The second is
165 /// the ID number of the intrinsic from the llvm::Intrinsic namespace. The
166 /// operands to the intrinsic follow. The node has two results, the result
167 /// of the intrinsic and an output chain.
170 /// OUTCHAIN = INTRINSIC_VOID(INCHAIN, INTRINSICID, arg1, arg2, ...)
171 /// This node represents a target intrinsic function with side effects that
172 /// does not return a result. The first operand is a chain pointer. The
173 /// second is the ID number of the intrinsic from the llvm::Intrinsic
174 /// namespace. The operands to the intrinsic follow.
177 // CopyToReg - This node has three operands: a chain, a register number to
178 // set to this value, and a value.
181 // CopyFromReg - This node indicates that the input value is a virtual or
182 // physical register that is defined outside of the scope of this
183 // SelectionDAG. The register is available from the RegisterSDNode object.
186 // UNDEF - An undefined node
189 /// FORMAL_ARGUMENTS(CHAIN, CC#, ISVARARG, FLAG0, ..., FLAGn) - This node
190 /// represents the formal arguments for a function. CC# is a Constant value
191 /// indicating the calling convention of the function, and ISVARARG is a
192 /// flag that indicates whether the function is varargs or not. This node
193 /// has one result value for each incoming argument, plus one for the output
194 /// chain. It must be custom legalized. See description of CALL node for
195 /// FLAG argument contents explanation.
199 /// RV1, RV2...RVn, CHAIN = CALL(CHAIN, CC#, ISVARARG, ISTAILCALL, CALLEE,
200 /// ARG0, FLAG0, ARG1, FLAG1, ... ARGn, FLAGn)
201 /// This node represents a fully general function call, before the legalizer
202 /// runs. This has one result value for each argument / flag pair, plus
203 /// a chain result. It must be custom legalized. Flag argument indicates
204 /// misc. argument attributes. Currently:
206 /// Bit 1 - 'inreg' attribute
207 /// Bit 2 - 'sret' attribute
208 /// Bit 4 - 'byval' attribute
209 /// Bit 5 - 'nest' attribute
210 /// Bit 6-9 - alignment of byval structures
211 /// Bit 10-26 - size of byval structures
212 /// Bits 31:27 - argument ABI alignment in the first argument piece and
213 /// alignment '1' in other argument pieces.
216 // EXTRACT_ELEMENT - This is used to get the first or second (determined by
217 // a Constant, which is required to be operand #1), element of the aggregate
218 // value specified as operand #0. This is only for use before legalization,
219 // for values that will be broken into multiple registers.
222 // BUILD_PAIR - This is the opposite of EXTRACT_ELEMENT in some ways. Given
223 // two values of the same integer value type, this produces a value twice as
224 // big. Like EXTRACT_ELEMENT, this can only be used before legalization.
227 // MERGE_VALUES - This node takes multiple discrete operands and returns
228 // them all as its individual results. This nodes has exactly the same
229 // number of inputs and outputs, and is only valid before legalization.
230 // This node is useful for some pieces of the code generator that want to
231 // think about a single node with multiple results, not multiple nodes.
234 // Simple integer binary arithmetic operators.
235 ADD, SUB, MUL, SDIV, UDIV, SREM, UREM,
237 // SMUL_LOHI/UMUL_LOHI - Multiply two integers of type iN, producing
238 // a signed/unsigned value of type i[2*N], and return the full value as
239 // two results, each of type iN.
240 SMUL_LOHI, UMUL_LOHI,
242 // SDIVREM/UDIVREM - Divide two integers and produce both a quotient and
246 // CARRY_FALSE - This node is used when folding other nodes,
247 // like ADDC/SUBC, which indicate the carry result is always false.
250 // Carry-setting nodes for multiple precision addition and subtraction.
251 // These nodes take two operands of the same value type, and produce two
252 // results. The first result is the normal add or sub result, the second
253 // result is the carry flag result.
256 // Carry-using nodes for multiple precision addition and subtraction. These
257 // nodes take three operands: The first two are the normal lhs and rhs to
258 // the add or sub, and the third is the input carry flag. These nodes
259 // produce two results; the normal result of the add or sub, and the output
260 // carry flag. These nodes both read and write a carry flag to allow them
261 // to them to be chained together for add and sub of arbitrarily large
265 // Simple binary floating point operators.
266 FADD, FSUB, FMUL, FDIV, FREM,
268 // FCOPYSIGN(X, Y) - Return the value of X with the sign of Y. NOTE: This
269 // DAG node does not require that X and Y have the same type, just that they
270 // are both floating point. X and the result must have the same type.
271 // FCOPYSIGN(f32, f64) is allowed.
274 // INT = FGETSIGN(FP) - Return the sign bit of the specified floating point
275 // value as an integer 0/1 value.
278 /// BUILD_VECTOR(ELT0, ELT1, ELT2, ELT3,...) - Return a vector
279 /// with the specified, possibly variable, elements. The number of elements
280 /// is required to be a power of two.
283 /// INSERT_VECTOR_ELT(VECTOR, VAL, IDX) - Returns VECTOR with the element
284 /// at IDX replaced with VAL.
287 /// EXTRACT_VECTOR_ELT(VECTOR, IDX) - Returns a single element from VECTOR
288 /// identified by the (potentially variable) element number IDX.
291 /// CONCAT_VECTORS(VECTOR0, VECTOR1, ...) - Given a number of values of
292 /// vector type with the same length and element type, this produces a
293 /// concatenated vector result value, with length equal to the sum of the
294 /// lengths of the input vectors.
297 /// EXTRACT_SUBVECTOR(VECTOR, IDX) - Returns a subvector from VECTOR (an
298 /// vector value) starting with the (potentially variable) element number
299 /// IDX, which must be a multiple of the result vector length.
302 /// VECTOR_SHUFFLE(VEC1, VEC2, SHUFFLEVEC) - Returns a vector, of the same
303 /// type as VEC1/VEC2. SHUFFLEVEC is a BUILD_VECTOR of constant int values
304 /// (regardless of whether its datatype is legal or not) that indicate
305 /// which value each result element will get. The elements of VEC1/VEC2 are
306 /// enumerated in order. This is quite similar to the Altivec 'vperm'
307 /// instruction, except that the indices must be constants and are in terms
308 /// of the element size of VEC1/VEC2, not in terms of bytes.
311 /// SCALAR_TO_VECTOR(VAL) - This represents the operation of loading a
312 /// scalar value into element 0 of the resultant vector type. The top
313 /// elements 1 to N-1 of the N-element vector are undefined.
316 // EXTRACT_SUBREG - This node is used to extract a sub-register value.
317 // This node takes a superreg and a constant sub-register index as operands.
320 // INSERT_SUBREG - This node is used to insert a sub-register value.
321 // This node takes a superreg, a subreg value, and a constant sub-register
322 // index as operands.
325 // MULHU/MULHS - Multiply high - Multiply two integers of type iN, producing
326 // an unsigned/signed value of type i[2*N], then return the top part.
329 // Bitwise operators - logical and, logical or, logical xor, shift left,
330 // shift right algebraic (shift in sign bits), shift right logical (shift in
331 // zeroes), rotate left, rotate right, and byteswap.
332 AND, OR, XOR, SHL, SRA, SRL, ROTL, ROTR, BSWAP,
334 // Counting operators
337 // Select(COND, TRUEVAL, FALSEVAL)
340 // Select with condition operator - This selects between a true value and
341 // a false value (ops #2 and #3) based on the boolean result of comparing
342 // the lhs and rhs (ops #0 and #1) of a conditional expression with the
343 // condition code in op #4, a CondCodeSDNode.
346 // SetCC operator - This evaluates to a boolean (i1) true value if the
347 // condition is true. The operands to this are the left and right operands
348 // to compare (ops #0, and #1) and the condition code to compare them with
349 // (op #2) as a CondCodeSDNode.
352 // SHL_PARTS/SRA_PARTS/SRL_PARTS - These operators are used for expanded
353 // integer shift operations, just like ADD/SUB_PARTS. The operation
355 // [Lo,Hi] = op [LoLHS,HiLHS], Amt
356 SHL_PARTS, SRA_PARTS, SRL_PARTS,
358 // Conversion operators. These are all single input single output
359 // operations. For all of these, the result type must be strictly
360 // wider or narrower (depending on the operation) than the source
363 // SIGN_EXTEND - Used for integer types, replicating the sign bit
367 // ZERO_EXTEND - Used for integer types, zeroing the new bits.
370 // ANY_EXTEND - Used for integer types. The high bits are undefined.
373 // TRUNCATE - Completely drop the high bits.
376 // [SU]INT_TO_FP - These operators convert integers (whose interpreted sign
377 // depends on the first letter) to floating point.
381 // SIGN_EXTEND_INREG - This operator atomically performs a SHL/SRA pair to
382 // sign extend a small value in a large integer register (e.g. sign
383 // extending the low 8 bits of a 32-bit register to fill the top 24 bits
384 // with the 7th bit). The size of the smaller type is indicated by the 1th
385 // operand, a ValueType node.
388 /// FP_TO_[US]INT - Convert a floating point value to a signed or unsigned
393 /// X = FP_ROUND(Y, TRUNC) - Rounding 'Y' from a larger floating point type
394 /// down to the precision of the destination VT. TRUNC is a flag, which is
395 /// always an integer that is zero or one. If TRUNC is 0, this is a
396 /// normal rounding, if it is 1, this FP_ROUND is known to not change the
399 /// The TRUNC = 1 case is used in cases where we know that the value will
400 /// not be modified by the node, because Y is not using any of the extra
401 /// precision of source type. This allows certain transformations like
402 /// FP_EXTEND(FP_ROUND(X,1)) -> X which are not safe for
403 /// FP_EXTEND(FP_ROUND(X,0)) because the extra bits aren't removed.
406 // FLT_ROUNDS_ - Returns current rounding mode:
409 // 1 Round to nearest
414 /// X = FP_ROUND_INREG(Y, VT) - This operator takes an FP register, and
415 /// rounds it to a floating point value. It then promotes it and returns it
416 /// in a register of the same size. This operation effectively just
417 /// discards excess precision. The type to round down to is specified by
418 /// the VT operand, a VTSDNode.
421 /// X = FP_EXTEND(Y) - Extend a smaller FP type into a larger FP type.
424 // BIT_CONVERT - Theis operator converts between integer and FP values, as
425 // if one was stored to memory as integer and the other was loaded from the
426 // same address (or equivalently for vector format conversions, etc). The
427 // source and result are required to have the same bit size (e.g.
428 // f32 <-> i32). This can also be used for int-to-int or fp-to-fp
429 // conversions, but that is a noop, deleted by getNode().
432 // FNEG, FABS, FSQRT, FSIN, FCOS, FPOWI, FPOW - Perform unary floating point
433 // negation, absolute value, square root, sine and cosine, powi, and pow
435 FNEG, FABS, FSQRT, FSIN, FCOS, FPOWI, FPOW,
437 // LOAD and STORE have token chains as their first operand, then the same
438 // operands as an LLVM load/store instruction, then an offset node that
439 // is added / subtracted from the base pointer to form the address (for
440 // indexed memory ops).
443 // DYNAMIC_STACKALLOC - Allocate some number of bytes on the stack aligned
444 // to a specified boundary. This node always has two return values: a new
445 // stack pointer value and a chain. The first operand is the token chain,
446 // the second is the number of bytes to allocate, and the third is the
447 // alignment boundary. The size is guaranteed to be a multiple of the stack
448 // alignment, and the alignment is guaranteed to be bigger than the stack
449 // alignment (if required) or 0 to get standard stack alignment.
452 // Control flow instructions. These all have token chains.
454 // BR - Unconditional branch. The first operand is the chain
455 // operand, the second is the MBB to branch to.
458 // BRIND - Indirect branch. The first operand is the chain, the second
459 // is the value to branch to, which must be of the same type as the target's
463 // BR_JT - Jumptable branch. The first operand is the chain, the second
464 // is the jumptable index, the last one is the jumptable entry index.
467 // BRCOND - Conditional branch. The first operand is the chain,
468 // the second is the condition, the third is the block to branch
469 // to if the condition is true.
472 // BR_CC - Conditional branch. The behavior is like that of SELECT_CC, in
473 // that the condition is represented as condition code, and two nodes to
474 // compare, rather than as a combined SetCC node. The operands in order are
475 // chain, cc, lhs, rhs, block to branch to if condition is true.
478 // RET - Return from function. The first operand is the chain,
479 // and any subsequent operands are pairs of return value and return value
480 // signness for the function. This operation can have variable number of
484 // INLINEASM - Represents an inline asm block. This node always has two
485 // return values: a chain and a flag result. The inputs are as follows:
486 // Operand #0 : Input chain.
487 // Operand #1 : a ExternalSymbolSDNode with a pointer to the asm string.
488 // Operand #2n+2: A RegisterNode.
489 // Operand #2n+3: A TargetConstant, indicating if the reg is a use/def
490 // Operand #last: Optional, an incoming flag.
493 // LABEL - Represents a label in mid basic block used to track
494 // locations needed for debug and exception handling tables. This node
496 // Operand #0 : input chain.
497 // Operand #1 : module unique number use to identify the label.
498 // Operand #2 : 0 indicates a debug label (e.g. stoppoint), 1 indicates
499 // a EH label, 2 indicates unknown label type.
502 // STACKSAVE - STACKSAVE has one operand, an input chain. It produces a
503 // value, the same type as the pointer type for the system, and an output
507 // STACKRESTORE has two operands, an input chain and a pointer to restore to
508 // it returns an output chain.
511 // MEMSET/MEMCPY/MEMMOVE - The first operand is the chain. The following
512 // correspond to the operands of the LLVM intrinsic functions and the last
513 // one is AlwaysInline. The only result is a token chain. The alignment
514 // argument is guaranteed to be a Constant node.
519 // CALLSEQ_START/CALLSEQ_END - These operators mark the beginning and end of
520 // a call sequence, and carry arbitrary information that target might want
521 // to know. The first operand is a chain, the rest are specified by the
522 // target and not touched by the DAG optimizers.
523 CALLSEQ_START, // Beginning of a call sequence
524 CALLSEQ_END, // End of a call sequence
526 // VAARG - VAARG has three operands: an input chain, a pointer, and a
527 // SRCVALUE. It returns a pair of values: the vaarg value and a new chain.
530 // VACOPY - VACOPY has five operands: an input chain, a destination pointer,
531 // a source pointer, a SRCVALUE for the destination, and a SRCVALUE for the
535 // VAEND, VASTART - VAEND and VASTART have three operands: an input chain, a
536 // pointer, and a SRCVALUE.
539 // SRCVALUE - This corresponds to a Value*, and is used to associate memory
540 // locations with their value. This allows one use alias analysis
541 // information in the backend.
544 // PCMARKER - This corresponds to the pcmarker intrinsic.
547 // READCYCLECOUNTER - This corresponds to the readcyclecounter intrinsic.
548 // The only operand is a chain and a value and a chain are produced. The
549 // value is the contents of the architecture specific cycle counter like
550 // register (or other high accuracy low latency clock source)
553 // HANDLENODE node - Used as a handle for various purposes.
556 // LOCATION - This node is used to represent a source location for debug
557 // info. It takes token chain as input, then a line number, then a column
558 // number, then a filename, then a working dir. It produces a token chain
562 // DEBUG_LOC - This node is used to represent source line information
563 // embedded in the code. It takes a token chain as input, then a line
564 // number, then a column then a file id (provided by MachineModuleInfo.) It
565 // produces a token chain as output.
568 // TRAMPOLINE - This corresponds to the init_trampoline intrinsic.
569 // It takes as input a token chain, the pointer to the trampoline,
570 // the pointer to the nested function, the pointer to pass for the
571 // 'nest' parameter, a SRCVALUE for the trampoline and another for
572 // the nested function (allowing targets to access the original
573 // Function*). It produces the result of the intrinsic and a token
577 // TRAP - Trapping instruction
580 // BUILTIN_OP_END - This must be the last enum value in this list.
586 /// isBuildVectorAllOnes - Return true if the specified node is a
587 /// BUILD_VECTOR where all of the elements are ~0 or undef.
588 bool isBuildVectorAllOnes(const SDNode *N);
590 /// isBuildVectorAllZeros - Return true if the specified node is a
591 /// BUILD_VECTOR where all of the elements are 0 or undef.
592 bool isBuildVectorAllZeros(const SDNode *N);
594 /// isDebugLabel - Return true if the specified node represents a debug
595 /// label (i.e. ISD::LABEL or TargetInstrInfo::LANEL node and third operand
597 bool isDebugLabel(const SDNode *N);
599 //===--------------------------------------------------------------------===//
600 /// MemIndexedMode enum - This enum defines the load / store indexed
601 /// addressing modes.
603 /// UNINDEXED "Normal" load / store. The effective address is already
604 /// computed and is available in the base pointer. The offset
605 /// operand is always undefined. In addition to producing a
606 /// chain, an unindexed load produces one value (result of the
607 /// load); an unindexed store does not produces a value.
609 /// PRE_INC Similar to the unindexed mode where the effective address is
610 /// PRE_DEC the value of the base pointer add / subtract the offset.
611 /// It considers the computation as being folded into the load /
612 /// store operation (i.e. the load / store does the address
613 /// computation as well as performing the memory transaction).
614 /// The base operand is always undefined. In addition to
615 /// producing a chain, pre-indexed load produces two values
616 /// (result of the load and the result of the address
617 /// computation); a pre-indexed store produces one value (result
618 /// of the address computation).
620 /// POST_INC The effective address is the value of the base pointer. The
621 /// POST_DEC value of the offset operand is then added to / subtracted
622 /// from the base after memory transaction. In addition to
623 /// producing a chain, post-indexed load produces two values
624 /// (the result of the load and the result of the base +/- offset
625 /// computation); a post-indexed store produces one value (the
626 /// the result of the base +/- offset computation).
628 enum MemIndexedMode {
637 //===--------------------------------------------------------------------===//
638 /// LoadExtType enum - This enum defines the three variants of LOADEXT
639 /// (load with extension).
641 /// SEXTLOAD loads the integer operand and sign extends it to a larger
642 /// integer result type.
643 /// ZEXTLOAD loads the integer operand and zero extends it to a larger
644 /// integer result type.
645 /// EXTLOAD is used for three things: floating point extending loads,
646 /// integer extending loads [the top bits are undefined], and vector
647 /// extending loads [load into low elt].
657 //===--------------------------------------------------------------------===//
658 /// ISD::CondCode enum - These are ordered carefully to make the bitfields
659 /// below work out, when considering SETFALSE (something that never exists
660 /// dynamically) as 0. "U" -> Unsigned (for integer operands) or Unordered
661 /// (for floating point), "L" -> Less than, "G" -> Greater than, "E" -> Equal
662 /// to. If the "N" column is 1, the result of the comparison is undefined if
663 /// the input is a NAN.
665 /// All of these (except for the 'always folded ops') should be handled for
666 /// floating point. For integer, only the SETEQ,SETNE,SETLT,SETLE,SETGT,
667 /// SETGE,SETULT,SETULE,SETUGT, and SETUGE opcodes are used.
669 /// Note that these are laid out in a specific order to allow bit-twiddling
670 /// to transform conditions.
672 // Opcode N U L G E Intuitive operation
673 SETFALSE, // 0 0 0 0 Always false (always folded)
674 SETOEQ, // 0 0 0 1 True if ordered and equal
675 SETOGT, // 0 0 1 0 True if ordered and greater than
676 SETOGE, // 0 0 1 1 True if ordered and greater than or equal
677 SETOLT, // 0 1 0 0 True if ordered and less than
678 SETOLE, // 0 1 0 1 True if ordered and less than or equal
679 SETONE, // 0 1 1 0 True if ordered and operands are unequal
680 SETO, // 0 1 1 1 True if ordered (no nans)
681 SETUO, // 1 0 0 0 True if unordered: isnan(X) | isnan(Y)
682 SETUEQ, // 1 0 0 1 True if unordered or equal
683 SETUGT, // 1 0 1 0 True if unordered or greater than
684 SETUGE, // 1 0 1 1 True if unordered, greater than, or equal
685 SETULT, // 1 1 0 0 True if unordered or less than
686 SETULE, // 1 1 0 1 True if unordered, less than, or equal
687 SETUNE, // 1 1 1 0 True if unordered or not equal
688 SETTRUE, // 1 1 1 1 Always true (always folded)
689 // Don't care operations: undefined if the input is a nan.
690 SETFALSE2, // 1 X 0 0 0 Always false (always folded)
691 SETEQ, // 1 X 0 0 1 True if equal
692 SETGT, // 1 X 0 1 0 True if greater than
693 SETGE, // 1 X 0 1 1 True if greater than or equal
694 SETLT, // 1 X 1 0 0 True if less than
695 SETLE, // 1 X 1 0 1 True if less than or equal
696 SETNE, // 1 X 1 1 0 True if not equal
697 SETTRUE2, // 1 X 1 1 1 Always true (always folded)
699 SETCC_INVALID // Marker value.
702 /// isSignedIntSetCC - Return true if this is a setcc instruction that
703 /// performs a signed comparison when used with integer operands.
704 inline bool isSignedIntSetCC(CondCode Code) {
705 return Code == SETGT || Code == SETGE || Code == SETLT || Code == SETLE;
708 /// isUnsignedIntSetCC - Return true if this is a setcc instruction that
709 /// performs an unsigned comparison when used with integer operands.
710 inline bool isUnsignedIntSetCC(CondCode Code) {
711 return Code == SETUGT || Code == SETUGE || Code == SETULT || Code == SETULE;
714 /// isTrueWhenEqual - Return true if the specified condition returns true if
715 /// the two operands to the condition are equal. Note that if one of the two
716 /// operands is a NaN, this value is meaningless.
717 inline bool isTrueWhenEqual(CondCode Cond) {
718 return ((int)Cond & 1) != 0;
721 /// getUnorderedFlavor - This function returns 0 if the condition is always
722 /// false if an operand is a NaN, 1 if the condition is always true if the
723 /// operand is a NaN, and 2 if the condition is undefined if the operand is a
725 inline unsigned getUnorderedFlavor(CondCode Cond) {
726 return ((int)Cond >> 3) & 3;
729 /// getSetCCInverse - Return the operation corresponding to !(X op Y), where
730 /// 'op' is a valid SetCC operation.
731 CondCode getSetCCInverse(CondCode Operation, bool isInteger);
733 /// getSetCCSwappedOperands - Return the operation corresponding to (Y op X)
734 /// when given the operation for (X op Y).
735 CondCode getSetCCSwappedOperands(CondCode Operation);
737 /// getSetCCOrOperation - Return the result of a logical OR between different
738 /// comparisons of identical values: ((X op1 Y) | (X op2 Y)). This
739 /// function returns SETCC_INVALID if it is not possible to represent the
740 /// resultant comparison.
741 CondCode getSetCCOrOperation(CondCode Op1, CondCode Op2, bool isInteger);
743 /// getSetCCAndOperation - Return the result of a logical AND between
744 /// different comparisons of identical values: ((X op1 Y) & (X op2 Y)). This
745 /// function returns SETCC_INVALID if it is not possible to represent the
746 /// resultant comparison.
747 CondCode getSetCCAndOperation(CondCode Op1, CondCode Op2, bool isInteger);
748 } // end llvm::ISD namespace
751 //===----------------------------------------------------------------------===//
752 /// SDOperand - Unlike LLVM values, Selection DAG nodes may return multiple
753 /// values as the result of a computation. Many nodes return multiple values,
754 /// from loads (which define a token and a return value) to ADDC (which returns
755 /// a result and a carry value), to calls (which may return an arbitrary number
758 /// As such, each use of a SelectionDAG computation must indicate the node that
759 /// computes it as well as which return value to use from that node. This pair
760 /// of information is represented with the SDOperand value type.
764 SDNode *Val; // The node defining the value we are using.
765 unsigned ResNo; // Which return value of the node we are using.
767 SDOperand() : Val(0), ResNo(0) {}
768 SDOperand(SDNode *val, unsigned resno) : Val(val), ResNo(resno) {}
770 bool operator==(const SDOperand &O) const {
771 return Val == O.Val && ResNo == O.ResNo;
773 bool operator!=(const SDOperand &O) const {
774 return !operator==(O);
776 bool operator<(const SDOperand &O) const {
777 return Val < O.Val || (Val == O.Val && ResNo < O.ResNo);
780 SDOperand getValue(unsigned R) const {
781 return SDOperand(Val, R);
784 // isOperand - Return true if this node is an operand of N.
785 bool isOperand(SDNode *N) const;
787 /// getValueType - Return the ValueType of the referenced return value.
789 inline MVT::ValueType getValueType() const;
791 // Forwarding methods - These forward to the corresponding methods in SDNode.
792 inline unsigned getOpcode() const;
793 inline unsigned getNumOperands() const;
794 inline const SDOperand &getOperand(unsigned i) const;
795 inline uint64_t getConstantOperandVal(unsigned i) const;
796 inline bool isTargetOpcode() const;
797 inline unsigned getTargetOpcode() const;
800 /// reachesChainWithoutSideEffects - Return true if this operand (which must
801 /// be a chain) reaches the specified operand without crossing any
802 /// side-effecting instructions. In practice, this looks through token
803 /// factors and non-volatile loads. In order to remain efficient, this only
804 /// looks a couple of nodes in, it does not do an exhaustive search.
805 bool reachesChainWithoutSideEffects(SDOperand Dest, unsigned Depth = 2) const;
807 /// hasOneUse - Return true if there is exactly one operation using this
808 /// result value of the defining operator.
809 inline bool hasOneUse() const;
811 /// use_empty - Return true if there are no operations using this
812 /// result value of the defining operator.
813 inline bool use_empty() const;
817 template<> struct DenseMapInfo<SDOperand> {
818 static inline SDOperand getEmptyKey() { return SDOperand((SDNode*)-1, -1U); }
819 static inline SDOperand getTombstoneKey() { return SDOperand((SDNode*)-1, 0);}
820 static unsigned getHashValue(const SDOperand &Val) {
821 return (unsigned)((uintptr_t)Val.Val >> 4) ^
822 (unsigned)((uintptr_t)Val.Val >> 9) + Val.ResNo;
824 static bool isEqual(const SDOperand &LHS, const SDOperand &RHS) {
827 static bool isPod() { return true; }
830 /// simplify_type specializations - Allow casting operators to work directly on
831 /// SDOperands as if they were SDNode*'s.
832 template<> struct simplify_type<SDOperand> {
833 typedef SDNode* SimpleType;
834 static SimpleType getSimplifiedValue(const SDOperand &Val) {
835 return static_cast<SimpleType>(Val.Val);
838 template<> struct simplify_type<const SDOperand> {
839 typedef SDNode* SimpleType;
840 static SimpleType getSimplifiedValue(const SDOperand &Val) {
841 return static_cast<SimpleType>(Val.Val);
846 /// SDNode - Represents one node in the SelectionDAG.
848 class SDNode : public FoldingSetNode {
849 /// NodeType - The operation that this node performs.
851 unsigned short NodeType;
853 /// OperandsNeedDelete - This is true if OperandList was new[]'d. If true,
854 /// then they will be delete[]'d when the node is destroyed.
855 bool OperandsNeedDelete : 1;
857 /// NodeId - Unique id per SDNode in the DAG.
860 /// OperandList - The values that are used by this operation.
862 SDOperand *OperandList;
864 /// ValueList - The types of the values this node defines. SDNode's may
865 /// define multiple values simultaneously.
866 const MVT::ValueType *ValueList;
868 /// NumOperands/NumValues - The number of entries in the Operand/Value list.
869 unsigned short NumOperands, NumValues;
871 /// Prev/Next pointers - These pointers form the linked list of of the
872 /// AllNodes list in the current DAG.
874 friend struct ilist_traits<SDNode>;
876 /// Uses - These are all of the SDNode's that use a value produced by this
878 SmallVector<SDNode*,3> Uses;
880 // Out-of-line virtual method to give class a home.
881 virtual void ANCHOR();
884 assert(NumOperands == 0 && "Operand list not cleared before deletion");
885 NodeType = ISD::DELETED_NODE;
888 //===--------------------------------------------------------------------===//
891 unsigned getOpcode() const { return NodeType; }
892 bool isTargetOpcode() const { return NodeType >= ISD::BUILTIN_OP_END; }
893 unsigned getTargetOpcode() const {
894 assert(isTargetOpcode() && "Not a target opcode!");
895 return NodeType - ISD::BUILTIN_OP_END;
898 size_t use_size() const { return Uses.size(); }
899 bool use_empty() const { return Uses.empty(); }
900 bool hasOneUse() const { return Uses.size() == 1; }
902 /// getNodeId - Return the unique node id.
904 int getNodeId() const { return NodeId; }
906 /// setNodeId - Set unique node id.
907 void setNodeId(int Id) { NodeId = Id; }
909 typedef SmallVector<SDNode*,3>::const_iterator use_iterator;
910 use_iterator use_begin() const { return Uses.begin(); }
911 use_iterator use_end() const { return Uses.end(); }
913 /// hasNUsesOfValue - Return true if there are exactly NUSES uses of the
914 /// indicated value. This method ignores uses of other values defined by this
916 bool hasNUsesOfValue(unsigned NUses, unsigned Value) const;
918 /// hasAnyUseOfValue - Return true if there are any use of the indicated
919 /// value. This method ignores uses of other values defined by this operation.
920 bool hasAnyUseOfValue(unsigned Value) const;
922 /// isOnlyUse - Return true if this node is the only use of N.
924 bool isOnlyUse(SDNode *N) const;
926 /// isOperand - Return true if this node is an operand of N.
928 bool isOperand(SDNode *N) const;
930 /// isPredecessor - Return true if this node is a predecessor of N. This node
931 /// is either an operand of N or it can be reached by recursively traversing
933 /// NOTE: this is an expensive method. Use it carefully.
934 bool isPredecessor(SDNode *N) const;
936 /// getNumOperands - Return the number of values used by this operation.
938 unsigned getNumOperands() const { return NumOperands; }
940 /// getConstantOperandVal - Helper method returns the integer value of a
941 /// ConstantSDNode operand.
942 uint64_t getConstantOperandVal(unsigned Num) const;
944 const SDOperand &getOperand(unsigned Num) const {
945 assert(Num < NumOperands && "Invalid child # of SDNode!");
946 return OperandList[Num];
949 typedef const SDOperand* op_iterator;
950 op_iterator op_begin() const { return OperandList; }
951 op_iterator op_end() const { return OperandList+NumOperands; }
954 SDVTList getVTList() const {
955 SDVTList X = { ValueList, NumValues };
959 /// getNumValues - Return the number of values defined/returned by this
962 unsigned getNumValues() const { return NumValues; }
964 /// getValueType - Return the type of a specified result.
966 MVT::ValueType getValueType(unsigned ResNo) const {
967 assert(ResNo < NumValues && "Illegal result number!");
968 return ValueList[ResNo];
971 typedef const MVT::ValueType* value_iterator;
972 value_iterator value_begin() const { return ValueList; }
973 value_iterator value_end() const { return ValueList+NumValues; }
975 /// getOperationName - Return the opcode of this operation for printing.
977 std::string getOperationName(const SelectionDAG *G = 0) const;
978 static const char* getIndexedModeName(ISD::MemIndexedMode AM);
980 void dump(const SelectionDAG *G) const;
982 static bool classof(const SDNode *) { return true; }
984 /// Profile - Gather unique data for the node.
986 void Profile(FoldingSetNodeID &ID);
989 friend class SelectionDAG;
991 /// getValueTypeList - Return a pointer to the specified value type.
993 static MVT::ValueType *getValueTypeList(MVT::ValueType VT);
994 static SDVTList getSDVTList(MVT::ValueType VT) {
995 SDVTList Ret = { getValueTypeList(VT), 1 };
999 SDNode(unsigned Opc, SDVTList VTs, const SDOperand *Ops, unsigned NumOps)
1000 : NodeType(Opc), NodeId(-1) {
1001 OperandsNeedDelete = true;
1002 NumOperands = NumOps;
1003 OperandList = NumOps ? new SDOperand[NumOperands] : 0;
1005 for (unsigned i = 0; i != NumOps; ++i) {
1006 OperandList[i] = Ops[i];
1007 Ops[i].Val->Uses.push_back(this);
1010 ValueList = VTs.VTs;
1011 NumValues = VTs.NumVTs;
1014 SDNode(unsigned Opc, SDVTList VTs) : NodeType(Opc), NodeId(-1) {
1015 OperandsNeedDelete = false; // Operands set with InitOperands.
1019 ValueList = VTs.VTs;
1020 NumValues = VTs.NumVTs;
1024 /// InitOperands - Initialize the operands list of this node with the
1025 /// specified values, which are part of the node (thus they don't need to be
1026 /// copied in or allocated).
1027 void InitOperands(SDOperand *Ops, unsigned NumOps) {
1028 assert(OperandList == 0 && "Operands already set!");
1029 NumOperands = NumOps;
1032 for (unsigned i = 0; i != NumOps; ++i)
1033 Ops[i].Val->Uses.push_back(this);
1036 /// MorphNodeTo - This frees the operands of the current node, resets the
1037 /// opcode, types, and operands to the specified value. This should only be
1038 /// used by the SelectionDAG class.
1039 void MorphNodeTo(unsigned Opc, SDVTList L,
1040 const SDOperand *Ops, unsigned NumOps);
1042 void addUser(SDNode *User) {
1043 Uses.push_back(User);
1045 void removeUser(SDNode *User) {
1046 // Remove this user from the operand's use list.
1047 for (unsigned i = Uses.size(); ; --i) {
1048 assert(i != 0 && "Didn't find user!");
1049 if (Uses[i-1] == User) {
1050 Uses[i-1] = Uses.back();
1059 // Define inline functions from the SDOperand class.
1061 inline unsigned SDOperand::getOpcode() const {
1062 return Val->getOpcode();
1064 inline MVT::ValueType SDOperand::getValueType() const {
1065 return Val->getValueType(ResNo);
1067 inline unsigned SDOperand::getNumOperands() const {
1068 return Val->getNumOperands();
1070 inline const SDOperand &SDOperand::getOperand(unsigned i) const {
1071 return Val->getOperand(i);
1073 inline uint64_t SDOperand::getConstantOperandVal(unsigned i) const {
1074 return Val->getConstantOperandVal(i);
1076 inline bool SDOperand::isTargetOpcode() const {
1077 return Val->isTargetOpcode();
1079 inline unsigned SDOperand::getTargetOpcode() const {
1080 return Val->getTargetOpcode();
1082 inline bool SDOperand::hasOneUse() const {
1083 return Val->hasNUsesOfValue(1, ResNo);
1085 inline bool SDOperand::use_empty() const {
1086 return !Val->hasAnyUseOfValue(ResNo);
1089 /// UnarySDNode - This class is used for single-operand SDNodes. This is solely
1090 /// to allow co-allocation of node operands with the node itself.
1091 class UnarySDNode : public SDNode {
1092 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1095 UnarySDNode(unsigned Opc, SDVTList VTs, SDOperand X)
1096 : SDNode(Opc, VTs), Op(X) {
1097 InitOperands(&Op, 1);
1101 /// BinarySDNode - This class is used for two-operand SDNodes. This is solely
1102 /// to allow co-allocation of node operands with the node itself.
1103 class BinarySDNode : public SDNode {
1104 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1107 BinarySDNode(unsigned Opc, SDVTList VTs, SDOperand X, SDOperand Y)
1108 : SDNode(Opc, VTs) {
1111 InitOperands(Ops, 2);
1115 /// TernarySDNode - This class is used for three-operand SDNodes. This is solely
1116 /// to allow co-allocation of node operands with the node itself.
1117 class TernarySDNode : public SDNode {
1118 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1121 TernarySDNode(unsigned Opc, SDVTList VTs, SDOperand X, SDOperand Y,
1123 : SDNode(Opc, VTs) {
1127 InitOperands(Ops, 3);
1132 /// HandleSDNode - This class is used to form a handle around another node that
1133 /// is persistant and is updated across invocations of replaceAllUsesWith on its
1134 /// operand. This node should be directly created by end-users and not added to
1135 /// the AllNodes list.
1136 class HandleSDNode : public SDNode {
1137 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1140 explicit HandleSDNode(SDOperand X)
1141 : SDNode(ISD::HANDLENODE, getSDVTList(MVT::Other)), Op(X) {
1142 InitOperands(&Op, 1);
1145 SDOperand getValue() const { return Op; }
1148 class StringSDNode : public SDNode {
1150 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1152 friend class SelectionDAG;
1153 explicit StringSDNode(const std::string &val)
1154 : SDNode(ISD::STRING, getSDVTList(MVT::Other)), Value(val) {
1157 const std::string &getValue() const { return Value; }
1158 static bool classof(const StringSDNode *) { return true; }
1159 static bool classof(const SDNode *N) {
1160 return N->getOpcode() == ISD::STRING;
1164 class ConstantSDNode : public SDNode {
1166 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1168 friend class SelectionDAG;
1169 ConstantSDNode(bool isTarget, uint64_t val, MVT::ValueType VT)
1170 : SDNode(isTarget ? ISD::TargetConstant : ISD::Constant, getSDVTList(VT)),
1175 uint64_t getValue() const { return Value; }
1177 int64_t getSignExtended() const {
1178 unsigned Bits = MVT::getSizeInBits(getValueType(0));
1179 return ((int64_t)Value << (64-Bits)) >> (64-Bits);
1182 bool isNullValue() const { return Value == 0; }
1183 bool isAllOnesValue() const {
1184 return Value == MVT::getIntVTBitMask(getValueType(0));
1187 static bool classof(const ConstantSDNode *) { return true; }
1188 static bool classof(const SDNode *N) {
1189 return N->getOpcode() == ISD::Constant ||
1190 N->getOpcode() == ISD::TargetConstant;
1194 class ConstantFPSDNode : public SDNode {
1196 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1197 // Longterm plan: replace all uses of getValue with getValueAPF, remove
1198 // getValue, rename getValueAPF to getValue.
1200 friend class SelectionDAG;
1201 ConstantFPSDNode(bool isTarget, const APFloat& val, MVT::ValueType VT)
1202 : SDNode(isTarget ? ISD::TargetConstantFP : ISD::ConstantFP,
1203 getSDVTList(VT)), Value(val) {
1207 const APFloat& getValueAPF() const { return Value; }
1209 /// isExactlyValue - We don't rely on operator== working on double values, as
1210 /// it returns true for things that are clearly not equal, like -0.0 and 0.0.
1211 /// As such, this method can be used to do an exact bit-for-bit comparison of
1212 /// two floating point values.
1214 /// We leave the version with the double argument here because it's just so
1215 /// convenient to write "2.0" and the like. Without this function we'd
1216 /// have to duplicate its logic everywhere it's called.
1217 bool isExactlyValue(double V) const {
1219 Tmp.convert(Value.getSemantics(), APFloat::rmNearestTiesToEven);
1220 return isExactlyValue(Tmp);
1222 bool isExactlyValue(const APFloat& V) const;
1224 bool isValueValidForType(MVT::ValueType VT, const APFloat& Val);
1226 static bool classof(const ConstantFPSDNode *) { return true; }
1227 static bool classof(const SDNode *N) {
1228 return N->getOpcode() == ISD::ConstantFP ||
1229 N->getOpcode() == ISD::TargetConstantFP;
1233 class GlobalAddressSDNode : public SDNode {
1234 GlobalValue *TheGlobal;
1236 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1238 friend class SelectionDAG;
1239 GlobalAddressSDNode(bool isTarget, const GlobalValue *GA, MVT::ValueType VT,
1243 GlobalValue *getGlobal() const { return TheGlobal; }
1244 int getOffset() const { return Offset; }
1246 static bool classof(const GlobalAddressSDNode *) { return true; }
1247 static bool classof(const SDNode *N) {
1248 return N->getOpcode() == ISD::GlobalAddress ||
1249 N->getOpcode() == ISD::TargetGlobalAddress ||
1250 N->getOpcode() == ISD::GlobalTLSAddress ||
1251 N->getOpcode() == ISD::TargetGlobalTLSAddress;
1255 class FrameIndexSDNode : public SDNode {
1257 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1259 friend class SelectionDAG;
1260 FrameIndexSDNode(int fi, MVT::ValueType VT, bool isTarg)
1261 : SDNode(isTarg ? ISD::TargetFrameIndex : ISD::FrameIndex, getSDVTList(VT)),
1266 int getIndex() const { return FI; }
1268 static bool classof(const FrameIndexSDNode *) { return true; }
1269 static bool classof(const SDNode *N) {
1270 return N->getOpcode() == ISD::FrameIndex ||
1271 N->getOpcode() == ISD::TargetFrameIndex;
1275 class JumpTableSDNode : public SDNode {
1277 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1279 friend class SelectionDAG;
1280 JumpTableSDNode(int jti, MVT::ValueType VT, bool isTarg)
1281 : SDNode(isTarg ? ISD::TargetJumpTable : ISD::JumpTable, getSDVTList(VT)),
1286 int getIndex() const { return JTI; }
1288 static bool classof(const JumpTableSDNode *) { return true; }
1289 static bool classof(const SDNode *N) {
1290 return N->getOpcode() == ISD::JumpTable ||
1291 N->getOpcode() == ISD::TargetJumpTable;
1295 class ConstantPoolSDNode : public SDNode {
1298 MachineConstantPoolValue *MachineCPVal;
1300 int Offset; // It's a MachineConstantPoolValue if top bit is set.
1302 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1304 friend class SelectionDAG;
1305 ConstantPoolSDNode(bool isTarget, Constant *c, MVT::ValueType VT,
1307 : SDNode(isTarget ? ISD::TargetConstantPool : ISD::ConstantPool,
1308 getSDVTList(VT)), Offset(o), Alignment(0) {
1309 assert((int)Offset >= 0 && "Offset is too large");
1312 ConstantPoolSDNode(bool isTarget, Constant *c, MVT::ValueType VT, int o,
1314 : SDNode(isTarget ? ISD::TargetConstantPool : ISD::ConstantPool,
1315 getSDVTList(VT)), Offset(o), Alignment(Align) {
1316 assert((int)Offset >= 0 && "Offset is too large");
1319 ConstantPoolSDNode(bool isTarget, MachineConstantPoolValue *v,
1320 MVT::ValueType VT, int o=0)
1321 : SDNode(isTarget ? ISD::TargetConstantPool : ISD::ConstantPool,
1322 getSDVTList(VT)), Offset(o), Alignment(0) {
1323 assert((int)Offset >= 0 && "Offset is too large");
1324 Val.MachineCPVal = v;
1325 Offset |= 1 << (sizeof(unsigned)*8-1);
1327 ConstantPoolSDNode(bool isTarget, MachineConstantPoolValue *v,
1328 MVT::ValueType VT, int o, unsigned Align)
1329 : SDNode(isTarget ? ISD::TargetConstantPool : ISD::ConstantPool,
1330 getSDVTList(VT)), Offset(o), Alignment(Align) {
1331 assert((int)Offset >= 0 && "Offset is too large");
1332 Val.MachineCPVal = v;
1333 Offset |= 1 << (sizeof(unsigned)*8-1);
1337 bool isMachineConstantPoolEntry() const {
1338 return (int)Offset < 0;
1341 Constant *getConstVal() const {
1342 assert(!isMachineConstantPoolEntry() && "Wrong constantpool type");
1343 return Val.ConstVal;
1346 MachineConstantPoolValue *getMachineCPVal() const {
1347 assert(isMachineConstantPoolEntry() && "Wrong constantpool type");
1348 return Val.MachineCPVal;
1351 int getOffset() const {
1352 return Offset & ~(1 << (sizeof(unsigned)*8-1));
1355 // Return the alignment of this constant pool object, which is either 0 (for
1356 // default alignment) or log2 of the desired value.
1357 unsigned getAlignment() const { return Alignment; }
1359 const Type *getType() const;
1361 static bool classof(const ConstantPoolSDNode *) { return true; }
1362 static bool classof(const SDNode *N) {
1363 return N->getOpcode() == ISD::ConstantPool ||
1364 N->getOpcode() == ISD::TargetConstantPool;
1368 class BasicBlockSDNode : public SDNode {
1369 MachineBasicBlock *MBB;
1370 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1372 friend class SelectionDAG;
1373 explicit BasicBlockSDNode(MachineBasicBlock *mbb)
1374 : SDNode(ISD::BasicBlock, getSDVTList(MVT::Other)), MBB(mbb) {
1378 MachineBasicBlock *getBasicBlock() const { return MBB; }
1380 static bool classof(const BasicBlockSDNode *) { return true; }
1381 static bool classof(const SDNode *N) {
1382 return N->getOpcode() == ISD::BasicBlock;
1386 class SrcValueSDNode : public SDNode {
1389 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1391 friend class SelectionDAG;
1392 SrcValueSDNode(const Value* v, int o)
1393 : SDNode(ISD::SRCVALUE, getSDVTList(MVT::Other)), V(v), offset(o) {
1397 const Value *getValue() const { return V; }
1398 int getOffset() const { return offset; }
1400 static bool classof(const SrcValueSDNode *) { return true; }
1401 static bool classof(const SDNode *N) {
1402 return N->getOpcode() == ISD::SRCVALUE;
1407 class RegisterSDNode : public SDNode {
1409 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1411 friend class SelectionDAG;
1412 RegisterSDNode(unsigned reg, MVT::ValueType VT)
1413 : SDNode(ISD::Register, getSDVTList(VT)), Reg(reg) {
1417 unsigned getReg() const { return Reg; }
1419 static bool classof(const RegisterSDNode *) { return true; }
1420 static bool classof(const SDNode *N) {
1421 return N->getOpcode() == ISD::Register;
1425 class ExternalSymbolSDNode : public SDNode {
1427 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1429 friend class SelectionDAG;
1430 ExternalSymbolSDNode(bool isTarget, const char *Sym, MVT::ValueType VT)
1431 : SDNode(isTarget ? ISD::TargetExternalSymbol : ISD::ExternalSymbol,
1432 getSDVTList(VT)), Symbol(Sym) {
1436 const char *getSymbol() const { return Symbol; }
1438 static bool classof(const ExternalSymbolSDNode *) { return true; }
1439 static bool classof(const SDNode *N) {
1440 return N->getOpcode() == ISD::ExternalSymbol ||
1441 N->getOpcode() == ISD::TargetExternalSymbol;
1445 class CondCodeSDNode : public SDNode {
1446 ISD::CondCode Condition;
1447 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1449 friend class SelectionDAG;
1450 explicit CondCodeSDNode(ISD::CondCode Cond)
1451 : SDNode(ISD::CONDCODE, getSDVTList(MVT::Other)), Condition(Cond) {
1455 ISD::CondCode get() const { return Condition; }
1457 static bool classof(const CondCodeSDNode *) { return true; }
1458 static bool classof(const SDNode *N) {
1459 return N->getOpcode() == ISD::CONDCODE;
1463 /// VTSDNode - This class is used to represent MVT::ValueType's, which are used
1464 /// to parameterize some operations.
1465 class VTSDNode : public SDNode {
1466 MVT::ValueType ValueType;
1467 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1469 friend class SelectionDAG;
1470 explicit VTSDNode(MVT::ValueType VT)
1471 : SDNode(ISD::VALUETYPE, getSDVTList(MVT::Other)), ValueType(VT) {
1475 MVT::ValueType getVT() const { return ValueType; }
1477 static bool classof(const VTSDNode *) { return true; }
1478 static bool classof(const SDNode *N) {
1479 return N->getOpcode() == ISD::VALUETYPE;
1483 /// LSBaseSDNode - Base class for LoadSDNode and StoreSDNode
1485 class LSBaseSDNode : public SDNode {
1487 // AddrMode - unindexed, pre-indexed, post-indexed.
1488 ISD::MemIndexedMode AddrMode;
1490 // MemoryVT - VT of in-memory value.
1491 MVT::ValueType MemoryVT;
1493 //! SrcValue - Memory location for alias analysis.
1494 const Value *SrcValue;
1496 //! SVOffset - Memory location offset.
1499 //! Alignment - Alignment of memory location in bytes.
1502 //! IsVolatile - True if the store is volatile.
1505 //! Operand array for load and store
1507 \note Moving this array to the base class captures more
1508 common functionality shared between LoadSDNode and
1513 LSBaseSDNode(ISD::NodeType NodeTy, SDOperand *Operands, unsigned NumOperands,
1514 SDVTList VTs, ISD::MemIndexedMode AM, MVT::ValueType VT,
1515 const Value *SV, int SVO, unsigned Align, bool Vol)
1516 : SDNode(NodeTy, VTs),
1517 AddrMode(AM), MemoryVT(VT),
1518 SrcValue(SV), SVOffset(SVO), Alignment(Align), IsVolatile(Vol)
1520 for (unsigned i = 0; i != NumOperands; ++i)
1521 Ops[i] = Operands[i];
1522 InitOperands(Ops, NumOperands);
1523 assert(Align != 0 && "Loads and stores should have non-zero aligment");
1524 assert((getOffset().getOpcode() == ISD::UNDEF || isIndexed()) &&
1525 "Only indexed loads and stores have a non-undef offset operand");
1528 const SDOperand getChain() const {
1529 return getOperand(0);
1531 const SDOperand getBasePtr() const {
1532 return getOperand(getOpcode() == ISD::LOAD ? 1 : 2);
1534 const SDOperand getOffset() const {
1535 return getOperand(getOpcode() == ISD::LOAD ? 2 : 3);
1537 const SDOperand getValue() const {
1538 assert(getOpcode() == ISD::STORE);
1539 return getOperand(1);
1542 const Value *getSrcValue() const { return SrcValue; }
1543 int getSrcValueOffset() const { return SVOffset; }
1544 unsigned getAlignment() const { return Alignment; }
1545 MVT::ValueType getMemoryVT() const { return MemoryVT; }
1546 bool isVolatile() const { return IsVolatile; }
1548 ISD::MemIndexedMode getAddressingMode() const { return AddrMode; }
1550 /// isIndexed - Return true if this is a pre/post inc/dec load/store.
1551 bool isIndexed() const { return AddrMode != ISD::UNINDEXED; }
1553 /// isUnindexed - Return true if this is NOT a pre/post inc/dec load/store.
1554 bool isUnindexed() const { return AddrMode == ISD::UNINDEXED; }
1556 static bool classof(const LSBaseSDNode *N) { return true; }
1557 static bool classof(const SDNode *N) {
1558 return N->getOpcode() == ISD::LOAD ||
1559 N->getOpcode() == ISD::STORE;
1563 /// LoadSDNode - This class is used to represent ISD::LOAD nodes.
1565 class LoadSDNode : public LSBaseSDNode {
1566 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1568 // ExtType - non-ext, anyext, sext, zext.
1569 ISD::LoadExtType ExtType;
1572 friend class SelectionDAG;
1573 LoadSDNode(SDOperand *ChainPtrOff, SDVTList VTs,
1574 ISD::MemIndexedMode AM, ISD::LoadExtType ETy, MVT::ValueType LVT,
1575 const Value *SV, int O=0, unsigned Align=0, bool Vol=false)
1576 : LSBaseSDNode(ISD::LOAD, ChainPtrOff, 3,
1577 VTs, AM, LVT, SV, O, Align, Vol),
1581 ISD::LoadExtType getExtensionType() const { return ExtType; }
1583 static bool classof(const LoadSDNode *) { return true; }
1584 static bool classof(const SDNode *N) {
1585 return N->getOpcode() == ISD::LOAD;
1589 /// StoreSDNode - This class is used to represent ISD::STORE nodes.
1591 class StoreSDNode : public LSBaseSDNode {
1592 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1594 // IsTruncStore - True if the op does a truncation before store.
1597 friend class SelectionDAG;
1598 StoreSDNode(SDOperand *ChainValuePtrOff, SDVTList VTs,
1599 ISD::MemIndexedMode AM, bool isTrunc, MVT::ValueType SVT,
1600 const Value *SV, int O=0, unsigned Align=0, bool Vol=false)
1601 : LSBaseSDNode(ISD::STORE, ChainValuePtrOff, 4,
1602 VTs, AM, SVT, SV, O, Align, Vol),
1603 IsTruncStore(isTrunc) { }
1606 bool isTruncatingStore() const { return IsTruncStore; }
1608 static bool classof(const StoreSDNode *) { return true; }
1609 static bool classof(const SDNode *N) {
1610 return N->getOpcode() == ISD::STORE;
1615 class SDNodeIterator : public forward_iterator<SDNode, ptrdiff_t> {
1619 SDNodeIterator(SDNode *N, unsigned Op) : Node(N), Operand(Op) {}
1621 bool operator==(const SDNodeIterator& x) const {
1622 return Operand == x.Operand;
1624 bool operator!=(const SDNodeIterator& x) const { return !operator==(x); }
1626 const SDNodeIterator &operator=(const SDNodeIterator &I) {
1627 assert(I.Node == Node && "Cannot assign iterators to two different nodes!");
1628 Operand = I.Operand;
1632 pointer operator*() const {
1633 return Node->getOperand(Operand).Val;
1635 pointer operator->() const { return operator*(); }
1637 SDNodeIterator& operator++() { // Preincrement
1641 SDNodeIterator operator++(int) { // Postincrement
1642 SDNodeIterator tmp = *this; ++*this; return tmp;
1645 static SDNodeIterator begin(SDNode *N) { return SDNodeIterator(N, 0); }
1646 static SDNodeIterator end (SDNode *N) {
1647 return SDNodeIterator(N, N->getNumOperands());
1650 unsigned getOperand() const { return Operand; }
1651 const SDNode *getNode() const { return Node; }
1654 template <> struct GraphTraits<SDNode*> {
1655 typedef SDNode NodeType;
1656 typedef SDNodeIterator ChildIteratorType;
1657 static inline NodeType *getEntryNode(SDNode *N) { return N; }
1658 static inline ChildIteratorType child_begin(NodeType *N) {
1659 return SDNodeIterator::begin(N);
1661 static inline ChildIteratorType child_end(NodeType *N) {
1662 return SDNodeIterator::end(N);
1667 struct ilist_traits<SDNode> {
1668 static SDNode *getPrev(const SDNode *N) { return N->Prev; }
1669 static SDNode *getNext(const SDNode *N) { return N->Next; }
1671 static void setPrev(SDNode *N, SDNode *Prev) { N->Prev = Prev; }
1672 static void setNext(SDNode *N, SDNode *Next) { N->Next = Next; }
1674 static SDNode *createSentinel() {
1675 return new SDNode(ISD::EntryToken, SDNode::getSDVTList(MVT::Other));
1677 static void destroySentinel(SDNode *N) { delete N; }
1678 //static SDNode *createNode(const SDNode &V) { return new SDNode(V); }
1681 void addNodeToList(SDNode *NTy) {}
1682 void removeNodeFromList(SDNode *NTy) {}
1683 void transferNodesFromList(iplist<SDNode, ilist_traits> &L2,
1684 const ilist_iterator<SDNode> &X,
1685 const ilist_iterator<SDNode> &Y) {}
1689 /// isNormalLoad - Returns true if the specified node is a non-extending
1690 /// and unindexed load.
1691 inline bool isNormalLoad(const SDNode *N) {
1692 if (N->getOpcode() != ISD::LOAD)
1694 const LoadSDNode *Ld = cast<LoadSDNode>(N);
1695 return Ld->getExtensionType() == ISD::NON_EXTLOAD &&
1696 Ld->getAddressingMode() == ISD::UNINDEXED;
1699 /// isNON_EXTLoad - Returns true if the specified node is a non-extending
1701 inline bool isNON_EXTLoad(const SDNode *N) {
1702 return N->getOpcode() == ISD::LOAD &&
1703 cast<LoadSDNode>(N)->getExtensionType() == ISD::NON_EXTLOAD;
1706 /// isEXTLoad - Returns true if the specified node is a EXTLOAD.
1708 inline bool isEXTLoad(const SDNode *N) {
1709 return N->getOpcode() == ISD::LOAD &&
1710 cast<LoadSDNode>(N)->getExtensionType() == ISD::EXTLOAD;
1713 /// isSEXTLoad - Returns true if the specified node is a SEXTLOAD.
1715 inline bool isSEXTLoad(const SDNode *N) {
1716 return N->getOpcode() == ISD::LOAD &&
1717 cast<LoadSDNode>(N)->getExtensionType() == ISD::SEXTLOAD;
1720 /// isZEXTLoad - Returns true if the specified node is a ZEXTLOAD.
1722 inline bool isZEXTLoad(const SDNode *N) {
1723 return N->getOpcode() == ISD::LOAD &&
1724 cast<LoadSDNode>(N)->getExtensionType() == ISD::ZEXTLOAD;
1727 /// isUNINDEXEDLoad - Returns true if the specified node is a unindexed load.
1729 inline bool isUNINDEXEDLoad(const SDNode *N) {
1730 return N->getOpcode() == ISD::LOAD &&
1731 cast<LoadSDNode>(N)->getAddressingMode() == ISD::UNINDEXED;
1734 /// isNON_TRUNCStore - Returns true if the specified node is a non-truncating
1736 inline bool isNON_TRUNCStore(const SDNode *N) {
1737 return N->getOpcode() == ISD::STORE &&
1738 !cast<StoreSDNode>(N)->isTruncatingStore();
1741 /// isTRUNCStore - Returns true if the specified node is a truncating
1743 inline bool isTRUNCStore(const SDNode *N) {
1744 return N->getOpcode() == ISD::STORE &&
1745 cast<StoreSDNode>(N)->isTruncatingStore();
1750 } // end llvm namespace