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 // FP_ROUND - Perform a rounding operation from the current
394 // precision down to the specified precision (currently always 64->32).
397 // FLT_ROUNDS - Returns current rounding mode:
400 // 1 Round to nearest
405 // FP_ROUND_INREG - This operator takes a floating point register, and
406 // rounds it to a floating point value. It then promotes it and returns it
407 // in a register of the same size. This operation effectively just discards
408 // excess precision. The type to round down to is specified by the 1th
409 // operation, a VTSDNode (currently always 64->32->64).
412 // FP_EXTEND - Extend a smaller FP type into a larger FP type.
415 // BIT_CONVERT - Theis operator converts between integer and FP values, as
416 // if one was stored to memory as integer and the other was loaded from the
417 // same address (or equivalently for vector format conversions, etc). The
418 // source and result are required to have the same bit size (e.g.
419 // f32 <-> i32). This can also be used for int-to-int or fp-to-fp
420 // conversions, but that is a noop, deleted by getNode().
423 // FNEG, FABS, FSQRT, FSIN, FCOS, FPOWI, FPOW - Perform unary floating point
424 // negation, absolute value, square root, sine and cosine, powi, and pow
426 FNEG, FABS, FSQRT, FSIN, FCOS, FPOWI, FPOW,
428 // LOAD and STORE have token chains as their first operand, then the same
429 // operands as an LLVM load/store instruction, then an offset node that
430 // is added / subtracted from the base pointer to form the address (for
431 // indexed memory ops).
434 // DYNAMIC_STACKALLOC - Allocate some number of bytes on the stack aligned
435 // to a specified boundary. This node always has two return values: a new
436 // stack pointer value and a chain. The first operand is the token chain,
437 // the second is the number of bytes to allocate, and the third is the
438 // alignment boundary. The size is guaranteed to be a multiple of the stack
439 // alignment, and the alignment is guaranteed to be bigger than the stack
440 // alignment (if required) or 0 to get standard stack alignment.
443 // Control flow instructions. These all have token chains.
445 // BR - Unconditional branch. The first operand is the chain
446 // operand, the second is the MBB to branch to.
449 // BRIND - Indirect branch. The first operand is the chain, the second
450 // is the value to branch to, which must be of the same type as the target's
454 // BR_JT - Jumptable branch. The first operand is the chain, the second
455 // is the jumptable index, the last one is the jumptable entry index.
458 // BRCOND - Conditional branch. The first operand is the chain,
459 // the second is the condition, the third is the block to branch
460 // to if the condition is true.
463 // BR_CC - Conditional branch. The behavior is like that of SELECT_CC, in
464 // that the condition is represented as condition code, and two nodes to
465 // compare, rather than as a combined SetCC node. The operands in order are
466 // chain, cc, lhs, rhs, block to branch to if condition is true.
469 // RET - Return from function. The first operand is the chain,
470 // and any subsequent operands are pairs of return value and return value
471 // signness for the function. This operation can have variable number of
475 // INLINEASM - Represents an inline asm block. This node always has two
476 // return values: a chain and a flag result. The inputs are as follows:
477 // Operand #0 : Input chain.
478 // Operand #1 : a ExternalSymbolSDNode with a pointer to the asm string.
479 // Operand #2n+2: A RegisterNode.
480 // Operand #2n+3: A TargetConstant, indicating if the reg is a use/def
481 // Operand #last: Optional, an incoming flag.
484 // LABEL - Represents a label in mid basic block used to track
485 // locations needed for debug and exception handling tables. This node
487 // Operand #0 : input chain.
488 // Operand #1 : module unique number use to identify the label.
491 // STACKSAVE - STACKSAVE has one operand, an input chain. It produces a
492 // value, the same type as the pointer type for the system, and an output
496 // STACKRESTORE has two operands, an input chain and a pointer to restore to
497 // it returns an output chain.
500 // MEMSET/MEMCPY/MEMMOVE - The first operand is the chain. The following
501 // correspond to the operands of the LLVM intrinsic functions and the last
502 // one is AlwaysInline. The only result is a token chain. The alignment
503 // argument is guaranteed to be a Constant node.
508 // CALLSEQ_START/CALLSEQ_END - These operators mark the beginning and end of
509 // a call sequence, and carry arbitrary information that target might want
510 // to know. The first operand is a chain, the rest are specified by the
511 // target and not touched by the DAG optimizers.
512 CALLSEQ_START, // Beginning of a call sequence
513 CALLSEQ_END, // End of a call sequence
515 // VAARG - VAARG has three operands: an input chain, a pointer, and a
516 // SRCVALUE. It returns a pair of values: the vaarg value and a new chain.
519 // VACOPY - VACOPY has five operands: an input chain, a destination pointer,
520 // a source pointer, a SRCVALUE for the destination, and a SRCVALUE for the
524 // VAEND, VASTART - VAEND and VASTART have three operands: an input chain, a
525 // pointer, and a SRCVALUE.
528 // SRCVALUE - This corresponds to a Value*, and is used to associate memory
529 // locations with their value. This allows one use alias analysis
530 // information in the backend.
533 // PCMARKER - This corresponds to the pcmarker intrinsic.
536 // READCYCLECOUNTER - This corresponds to the readcyclecounter intrinsic.
537 // The only operand is a chain and a value and a chain are produced. The
538 // value is the contents of the architecture specific cycle counter like
539 // register (or other high accuracy low latency clock source)
542 // HANDLENODE node - Used as a handle for various purposes.
545 // LOCATION - This node is used to represent a source location for debug
546 // info. It takes token chain as input, then a line number, then a column
547 // number, then a filename, then a working dir. It produces a token chain
551 // DEBUG_LOC - This node is used to represent source line information
552 // embedded in the code. It takes a token chain as input, then a line
553 // number, then a column then a file id (provided by MachineModuleInfo.) It
554 // produces a token chain as output.
557 // TRAMPOLINE - This corresponds to the init_trampoline intrinsic.
558 // It takes as input a token chain, the pointer to the trampoline,
559 // the pointer to the nested function, the pointer to pass for the
560 // 'nest' parameter, a SRCVALUE for the trampoline and another for
561 // the nested function (allowing targets to access the original
562 // Function*). It produces the result of the intrinsic and a token
566 // TRAP - Trapping instruction
569 // BUILTIN_OP_END - This must be the last enum value in this list.
575 /// isBuildVectorAllOnes - Return true if the specified node is a
576 /// BUILD_VECTOR where all of the elements are ~0 or undef.
577 bool isBuildVectorAllOnes(const SDNode *N);
579 /// isBuildVectorAllZeros - Return true if the specified node is a
580 /// BUILD_VECTOR where all of the elements are 0 or undef.
581 bool isBuildVectorAllZeros(const SDNode *N);
583 //===--------------------------------------------------------------------===//
584 /// MemIndexedMode enum - This enum defines the load / store indexed
585 /// addressing modes.
587 /// UNINDEXED "Normal" load / store. The effective address is already
588 /// computed and is available in the base pointer. The offset
589 /// operand is always undefined. In addition to producing a
590 /// chain, an unindexed load produces one value (result of the
591 /// load); an unindexed store does not produces a value.
593 /// PRE_INC Similar to the unindexed mode where the effective address is
594 /// PRE_DEC the value of the base pointer add / subtract the offset.
595 /// It considers the computation as being folded into the load /
596 /// store operation (i.e. the load / store does the address
597 /// computation as well as performing the memory transaction).
598 /// The base operand is always undefined. In addition to
599 /// producing a chain, pre-indexed load produces two values
600 /// (result of the load and the result of the address
601 /// computation); a pre-indexed store produces one value (result
602 /// of the address computation).
604 /// POST_INC The effective address is the value of the base pointer. The
605 /// POST_DEC value of the offset operand is then added to / subtracted
606 /// from the base after memory transaction. In addition to
607 /// producing a chain, post-indexed load produces two values
608 /// (the result of the load and the result of the base +/- offset
609 /// computation); a post-indexed store produces one value (the
610 /// the result of the base +/- offset computation).
612 enum MemIndexedMode {
621 //===--------------------------------------------------------------------===//
622 /// LoadExtType enum - This enum defines the three variants of LOADEXT
623 /// (load with extension).
625 /// SEXTLOAD loads the integer operand and sign extends it to a larger
626 /// integer result type.
627 /// ZEXTLOAD loads the integer operand and zero extends it to a larger
628 /// integer result type.
629 /// EXTLOAD is used for three things: floating point extending loads,
630 /// integer extending loads [the top bits are undefined], and vector
631 /// extending loads [load into low elt].
641 //===--------------------------------------------------------------------===//
642 /// ISD::CondCode enum - These are ordered carefully to make the bitfields
643 /// below work out, when considering SETFALSE (something that never exists
644 /// dynamically) as 0. "U" -> Unsigned (for integer operands) or Unordered
645 /// (for floating point), "L" -> Less than, "G" -> Greater than, "E" -> Equal
646 /// to. If the "N" column is 1, the result of the comparison is undefined if
647 /// the input is a NAN.
649 /// All of these (except for the 'always folded ops') should be handled for
650 /// floating point. For integer, only the SETEQ,SETNE,SETLT,SETLE,SETGT,
651 /// SETGE,SETULT,SETULE,SETUGT, and SETUGE opcodes are used.
653 /// Note that these are laid out in a specific order to allow bit-twiddling
654 /// to transform conditions.
656 // Opcode N U L G E Intuitive operation
657 SETFALSE, // 0 0 0 0 Always false (always folded)
658 SETOEQ, // 0 0 0 1 True if ordered and equal
659 SETOGT, // 0 0 1 0 True if ordered and greater than
660 SETOGE, // 0 0 1 1 True if ordered and greater than or equal
661 SETOLT, // 0 1 0 0 True if ordered and less than
662 SETOLE, // 0 1 0 1 True if ordered and less than or equal
663 SETONE, // 0 1 1 0 True if ordered and operands are unequal
664 SETO, // 0 1 1 1 True if ordered (no nans)
665 SETUO, // 1 0 0 0 True if unordered: isnan(X) | isnan(Y)
666 SETUEQ, // 1 0 0 1 True if unordered or equal
667 SETUGT, // 1 0 1 0 True if unordered or greater than
668 SETUGE, // 1 0 1 1 True if unordered, greater than, or equal
669 SETULT, // 1 1 0 0 True if unordered or less than
670 SETULE, // 1 1 0 1 True if unordered, less than, or equal
671 SETUNE, // 1 1 1 0 True if unordered or not equal
672 SETTRUE, // 1 1 1 1 Always true (always folded)
673 // Don't care operations: undefined if the input is a nan.
674 SETFALSE2, // 1 X 0 0 0 Always false (always folded)
675 SETEQ, // 1 X 0 0 1 True if equal
676 SETGT, // 1 X 0 1 0 True if greater than
677 SETGE, // 1 X 0 1 1 True if greater than or equal
678 SETLT, // 1 X 1 0 0 True if less than
679 SETLE, // 1 X 1 0 1 True if less than or equal
680 SETNE, // 1 X 1 1 0 True if not equal
681 SETTRUE2, // 1 X 1 1 1 Always true (always folded)
683 SETCC_INVALID // Marker value.
686 /// isSignedIntSetCC - Return true if this is a setcc instruction that
687 /// performs a signed comparison when used with integer operands.
688 inline bool isSignedIntSetCC(CondCode Code) {
689 return Code == SETGT || Code == SETGE || Code == SETLT || Code == SETLE;
692 /// isUnsignedIntSetCC - Return true if this is a setcc instruction that
693 /// performs an unsigned comparison when used with integer operands.
694 inline bool isUnsignedIntSetCC(CondCode Code) {
695 return Code == SETUGT || Code == SETUGE || Code == SETULT || Code == SETULE;
698 /// isTrueWhenEqual - Return true if the specified condition returns true if
699 /// the two operands to the condition are equal. Note that if one of the two
700 /// operands is a NaN, this value is meaningless.
701 inline bool isTrueWhenEqual(CondCode Cond) {
702 return ((int)Cond & 1) != 0;
705 /// getUnorderedFlavor - This function returns 0 if the condition is always
706 /// false if an operand is a NaN, 1 if the condition is always true if the
707 /// operand is a NaN, and 2 if the condition is undefined if the operand is a
709 inline unsigned getUnorderedFlavor(CondCode Cond) {
710 return ((int)Cond >> 3) & 3;
713 /// getSetCCInverse - Return the operation corresponding to !(X op Y), where
714 /// 'op' is a valid SetCC operation.
715 CondCode getSetCCInverse(CondCode Operation, bool isInteger);
717 /// getSetCCSwappedOperands - Return the operation corresponding to (Y op X)
718 /// when given the operation for (X op Y).
719 CondCode getSetCCSwappedOperands(CondCode Operation);
721 /// getSetCCOrOperation - Return the result of a logical OR between different
722 /// comparisons of identical values: ((X op1 Y) | (X op2 Y)). This
723 /// function returns SETCC_INVALID if it is not possible to represent the
724 /// resultant comparison.
725 CondCode getSetCCOrOperation(CondCode Op1, CondCode Op2, bool isInteger);
727 /// getSetCCAndOperation - Return the result of a logical AND between
728 /// different comparisons of identical values: ((X op1 Y) & (X op2 Y)). This
729 /// function returns SETCC_INVALID if it is not possible to represent the
730 /// resultant comparison.
731 CondCode getSetCCAndOperation(CondCode Op1, CondCode Op2, bool isInteger);
732 } // end llvm::ISD namespace
735 //===----------------------------------------------------------------------===//
736 /// SDOperand - Unlike LLVM values, Selection DAG nodes may return multiple
737 /// values as the result of a computation. Many nodes return multiple values,
738 /// from loads (which define a token and a return value) to ADDC (which returns
739 /// a result and a carry value), to calls (which may return an arbitrary number
742 /// As such, each use of a SelectionDAG computation must indicate the node that
743 /// computes it as well as which return value to use from that node. This pair
744 /// of information is represented with the SDOperand value type.
748 SDNode *Val; // The node defining the value we are using.
749 unsigned ResNo; // Which return value of the node we are using.
751 SDOperand() : Val(0), ResNo(0) {}
752 SDOperand(SDNode *val, unsigned resno) : Val(val), ResNo(resno) {}
754 bool operator==(const SDOperand &O) const {
755 return Val == O.Val && ResNo == O.ResNo;
757 bool operator!=(const SDOperand &O) const {
758 return !operator==(O);
760 bool operator<(const SDOperand &O) const {
761 return Val < O.Val || (Val == O.Val && ResNo < O.ResNo);
764 SDOperand getValue(unsigned R) const {
765 return SDOperand(Val, R);
768 // isOperand - Return true if this node is an operand of N.
769 bool isOperand(SDNode *N) const;
771 /// getValueType - Return the ValueType of the referenced return value.
773 inline MVT::ValueType getValueType() const;
775 // Forwarding methods - These forward to the corresponding methods in SDNode.
776 inline unsigned getOpcode() const;
777 inline unsigned getNumOperands() const;
778 inline const SDOperand &getOperand(unsigned i) const;
779 inline uint64_t getConstantOperandVal(unsigned i) const;
780 inline bool isTargetOpcode() const;
781 inline unsigned getTargetOpcode() const;
783 /// hasOneUse - Return true if there is exactly one operation using this
784 /// result value of the defining operator.
785 inline bool hasOneUse() const;
787 /// use_empty - Return true if there are no operations using this
788 /// result value of the defining operator.
789 inline bool use_empty() const;
793 template<> struct DenseMapInfo<SDOperand> {
794 static inline SDOperand getEmptyKey() { return SDOperand((SDNode*)-1, -1U); }
795 static inline SDOperand getTombstoneKey() { return SDOperand((SDNode*)-1, 0);}
796 static unsigned getHashValue(const SDOperand &Val) {
797 return (unsigned)((uintptr_t)Val.Val >> 4) ^
798 (unsigned)((uintptr_t)Val.Val >> 9) + Val.ResNo;
800 static bool isEqual(const SDOperand &LHS, const SDOperand &RHS) {
803 static bool isPod() { return true; }
806 /// simplify_type specializations - Allow casting operators to work directly on
807 /// SDOperands as if they were SDNode*'s.
808 template<> struct simplify_type<SDOperand> {
809 typedef SDNode* SimpleType;
810 static SimpleType getSimplifiedValue(const SDOperand &Val) {
811 return static_cast<SimpleType>(Val.Val);
814 template<> struct simplify_type<const SDOperand> {
815 typedef SDNode* SimpleType;
816 static SimpleType getSimplifiedValue(const SDOperand &Val) {
817 return static_cast<SimpleType>(Val.Val);
822 /// SDNode - Represents one node in the SelectionDAG.
824 class SDNode : public FoldingSetNode {
825 /// NodeType - The operation that this node performs.
827 unsigned short NodeType;
829 /// OperandsNeedDelete - This is true if OperandList was new[]'d. If true,
830 /// then they will be delete[]'d when the node is destroyed.
831 bool OperandsNeedDelete : 1;
833 /// NodeId - Unique id per SDNode in the DAG.
836 /// OperandList - The values that are used by this operation.
838 SDOperand *OperandList;
840 /// ValueList - The types of the values this node defines. SDNode's may
841 /// define multiple values simultaneously.
842 const MVT::ValueType *ValueList;
844 /// NumOperands/NumValues - The number of entries in the Operand/Value list.
845 unsigned short NumOperands, NumValues;
847 /// Prev/Next pointers - These pointers form the linked list of of the
848 /// AllNodes list in the current DAG.
850 friend struct ilist_traits<SDNode>;
852 /// Uses - These are all of the SDNode's that use a value produced by this
854 SmallVector<SDNode*,3> Uses;
856 // Out-of-line virtual method to give class a home.
857 virtual void ANCHOR();
860 assert(NumOperands == 0 && "Operand list not cleared before deletion");
861 NodeType = ISD::DELETED_NODE;
864 //===--------------------------------------------------------------------===//
867 unsigned getOpcode() const { return NodeType; }
868 bool isTargetOpcode() const { return NodeType >= ISD::BUILTIN_OP_END; }
869 unsigned getTargetOpcode() const {
870 assert(isTargetOpcode() && "Not a target opcode!");
871 return NodeType - ISD::BUILTIN_OP_END;
874 size_t use_size() const { return Uses.size(); }
875 bool use_empty() const { return Uses.empty(); }
876 bool hasOneUse() const { return Uses.size() == 1; }
878 /// getNodeId - Return the unique node id.
880 int getNodeId() const { return NodeId; }
882 /// setNodeId - Set unique node id.
883 void setNodeId(int Id) { NodeId = Id; }
885 typedef SmallVector<SDNode*,3>::const_iterator use_iterator;
886 use_iterator use_begin() const { return Uses.begin(); }
887 use_iterator use_end() const { return Uses.end(); }
889 /// hasNUsesOfValue - Return true if there are exactly NUSES uses of the
890 /// indicated value. This method ignores uses of other values defined by this
892 bool hasNUsesOfValue(unsigned NUses, unsigned Value) const;
894 /// hasAnyUseOfValue - Return true if there are any use of the indicated
895 /// value. This method ignores uses of other values defined by this operation.
896 bool hasAnyUseOfValue(unsigned Value) const;
898 /// isOnlyUse - Return true if this node is the only use of N.
900 bool isOnlyUse(SDNode *N) const;
902 /// isOperand - Return true if this node is an operand of N.
904 bool isOperand(SDNode *N) const;
906 /// isPredecessor - Return true if this node is a predecessor of N. This node
907 /// is either an operand of N or it can be reached by recursively traversing
909 /// NOTE: this is an expensive method. Use it carefully.
910 bool isPredecessor(SDNode *N) const;
912 /// getNumOperands - Return the number of values used by this operation.
914 unsigned getNumOperands() const { return NumOperands; }
916 /// getConstantOperandVal - Helper method returns the integer value of a
917 /// ConstantSDNode operand.
918 uint64_t getConstantOperandVal(unsigned Num) const;
920 const SDOperand &getOperand(unsigned Num) const {
921 assert(Num < NumOperands && "Invalid child # of SDNode!");
922 return OperandList[Num];
925 typedef const SDOperand* op_iterator;
926 op_iterator op_begin() const { return OperandList; }
927 op_iterator op_end() const { return OperandList+NumOperands; }
930 SDVTList getVTList() const {
931 SDVTList X = { ValueList, NumValues };
935 /// getNumValues - Return the number of values defined/returned by this
938 unsigned getNumValues() const { return NumValues; }
940 /// getValueType - Return the type of a specified result.
942 MVT::ValueType getValueType(unsigned ResNo) const {
943 assert(ResNo < NumValues && "Illegal result number!");
944 return ValueList[ResNo];
947 typedef const MVT::ValueType* value_iterator;
948 value_iterator value_begin() const { return ValueList; }
949 value_iterator value_end() const { return ValueList+NumValues; }
951 /// getOperationName - Return the opcode of this operation for printing.
953 std::string getOperationName(const SelectionDAG *G = 0) const;
954 static const char* getIndexedModeName(ISD::MemIndexedMode AM);
956 void dump(const SelectionDAG *G) const;
958 static bool classof(const SDNode *) { return true; }
960 /// Profile - Gather unique data for the node.
962 void Profile(FoldingSetNodeID &ID);
965 friend class SelectionDAG;
967 /// getValueTypeList - Return a pointer to the specified value type.
969 static MVT::ValueType *getValueTypeList(MVT::ValueType VT);
970 static SDVTList getSDVTList(MVT::ValueType VT) {
971 SDVTList Ret = { getValueTypeList(VT), 1 };
975 SDNode(unsigned Opc, SDVTList VTs, const SDOperand *Ops, unsigned NumOps)
976 : NodeType(Opc), NodeId(-1) {
977 OperandsNeedDelete = true;
978 NumOperands = NumOps;
979 OperandList = NumOps ? new SDOperand[NumOperands] : 0;
981 for (unsigned i = 0; i != NumOps; ++i) {
982 OperandList[i] = Ops[i];
983 Ops[i].Val->Uses.push_back(this);
987 NumValues = VTs.NumVTs;
990 SDNode(unsigned Opc, SDVTList VTs) : NodeType(Opc), NodeId(-1) {
991 OperandsNeedDelete = false; // Operands set with InitOperands.
996 NumValues = VTs.NumVTs;
1000 /// InitOperands - Initialize the operands list of this node with the
1001 /// specified values, which are part of the node (thus they don't need to be
1002 /// copied in or allocated).
1003 void InitOperands(SDOperand *Ops, unsigned NumOps) {
1004 assert(OperandList == 0 && "Operands already set!");
1005 NumOperands = NumOps;
1008 for (unsigned i = 0; i != NumOps; ++i)
1009 Ops[i].Val->Uses.push_back(this);
1012 /// MorphNodeTo - This frees the operands of the current node, resets the
1013 /// opcode, types, and operands to the specified value. This should only be
1014 /// used by the SelectionDAG class.
1015 void MorphNodeTo(unsigned Opc, SDVTList L,
1016 const SDOperand *Ops, unsigned NumOps);
1018 void addUser(SDNode *User) {
1019 Uses.push_back(User);
1021 void removeUser(SDNode *User) {
1022 // Remove this user from the operand's use list.
1023 for (unsigned i = Uses.size(); ; --i) {
1024 assert(i != 0 && "Didn't find user!");
1025 if (Uses[i-1] == User) {
1026 Uses[i-1] = Uses.back();
1035 // Define inline functions from the SDOperand class.
1037 inline unsigned SDOperand::getOpcode() const {
1038 return Val->getOpcode();
1040 inline MVT::ValueType SDOperand::getValueType() const {
1041 return Val->getValueType(ResNo);
1043 inline unsigned SDOperand::getNumOperands() const {
1044 return Val->getNumOperands();
1046 inline const SDOperand &SDOperand::getOperand(unsigned i) const {
1047 return Val->getOperand(i);
1049 inline uint64_t SDOperand::getConstantOperandVal(unsigned i) const {
1050 return Val->getConstantOperandVal(i);
1052 inline bool SDOperand::isTargetOpcode() const {
1053 return Val->isTargetOpcode();
1055 inline unsigned SDOperand::getTargetOpcode() const {
1056 return Val->getTargetOpcode();
1058 inline bool SDOperand::hasOneUse() const {
1059 return Val->hasNUsesOfValue(1, ResNo);
1061 inline bool SDOperand::use_empty() const {
1062 return !Val->hasAnyUseOfValue(ResNo);
1065 /// UnarySDNode - This class is used for single-operand SDNodes. This is solely
1066 /// to allow co-allocation of node operands with the node itself.
1067 class UnarySDNode : public SDNode {
1068 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1071 UnarySDNode(unsigned Opc, SDVTList VTs, SDOperand X)
1072 : SDNode(Opc, VTs), Op(X) {
1073 InitOperands(&Op, 1);
1077 /// BinarySDNode - This class is used for two-operand SDNodes. This is solely
1078 /// to allow co-allocation of node operands with the node itself.
1079 class BinarySDNode : public SDNode {
1080 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1083 BinarySDNode(unsigned Opc, SDVTList VTs, SDOperand X, SDOperand Y)
1084 : SDNode(Opc, VTs) {
1087 InitOperands(Ops, 2);
1091 /// TernarySDNode - This class is used for three-operand SDNodes. This is solely
1092 /// to allow co-allocation of node operands with the node itself.
1093 class TernarySDNode : public SDNode {
1094 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1097 TernarySDNode(unsigned Opc, SDVTList VTs, SDOperand X, SDOperand Y,
1099 : SDNode(Opc, VTs) {
1103 InitOperands(Ops, 3);
1108 /// HandleSDNode - This class is used to form a handle around another node that
1109 /// is persistant and is updated across invocations of replaceAllUsesWith on its
1110 /// operand. This node should be directly created by end-users and not added to
1111 /// the AllNodes list.
1112 class HandleSDNode : public SDNode {
1113 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1116 explicit HandleSDNode(SDOperand X)
1117 : SDNode(ISD::HANDLENODE, getSDVTList(MVT::Other)), Op(X) {
1118 InitOperands(&Op, 1);
1121 SDOperand getValue() const { return Op; }
1124 class StringSDNode : public SDNode {
1126 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1128 friend class SelectionDAG;
1129 explicit StringSDNode(const std::string &val)
1130 : SDNode(ISD::STRING, getSDVTList(MVT::Other)), Value(val) {
1133 const std::string &getValue() const { return Value; }
1134 static bool classof(const StringSDNode *) { return true; }
1135 static bool classof(const SDNode *N) {
1136 return N->getOpcode() == ISD::STRING;
1140 class ConstantSDNode : public SDNode {
1142 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1144 friend class SelectionDAG;
1145 ConstantSDNode(bool isTarget, uint64_t val, MVT::ValueType VT)
1146 : SDNode(isTarget ? ISD::TargetConstant : ISD::Constant, getSDVTList(VT)),
1151 uint64_t getValue() const { return Value; }
1153 int64_t getSignExtended() const {
1154 unsigned Bits = MVT::getSizeInBits(getValueType(0));
1155 return ((int64_t)Value << (64-Bits)) >> (64-Bits);
1158 bool isNullValue() const { return Value == 0; }
1159 bool isAllOnesValue() const {
1160 return Value == MVT::getIntVTBitMask(getValueType(0));
1163 static bool classof(const ConstantSDNode *) { return true; }
1164 static bool classof(const SDNode *N) {
1165 return N->getOpcode() == ISD::Constant ||
1166 N->getOpcode() == ISD::TargetConstant;
1170 class ConstantFPSDNode : public SDNode {
1172 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1173 // Longterm plan: replace all uses of getValue with getValueAPF, remove
1174 // getValue, rename getValueAPF to getValue.
1176 friend class SelectionDAG;
1177 ConstantFPSDNode(bool isTarget, const APFloat& val, MVT::ValueType VT)
1178 : SDNode(isTarget ? ISD::TargetConstantFP : ISD::ConstantFP,
1179 getSDVTList(VT)), Value(val) {
1183 const APFloat& getValueAPF() const { return Value; }
1185 /// isExactlyValue - We don't rely on operator== working on double values, as
1186 /// it returns true for things that are clearly not equal, like -0.0 and 0.0.
1187 /// As such, this method can be used to do an exact bit-for-bit comparison of
1188 /// two floating point values.
1190 /// We leave the version with the double argument here because it's just so
1191 /// convenient to write "2.0" and the like. Without this function we'd
1192 /// have to duplicate its logic everywhere it's called.
1193 bool isExactlyValue(double V) const {
1194 if (getValueType(0)==MVT::f64)
1195 return isExactlyValue(APFloat(V));
1197 return isExactlyValue(APFloat((float)V));
1199 bool isExactlyValue(const APFloat& V) const;
1201 bool isValueValidForType(MVT::ValueType VT, const APFloat& Val);
1203 static bool classof(const ConstantFPSDNode *) { return true; }
1204 static bool classof(const SDNode *N) {
1205 return N->getOpcode() == ISD::ConstantFP ||
1206 N->getOpcode() == ISD::TargetConstantFP;
1210 class GlobalAddressSDNode : public SDNode {
1211 GlobalValue *TheGlobal;
1213 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1215 friend class SelectionDAG;
1216 GlobalAddressSDNode(bool isTarget, const GlobalValue *GA, MVT::ValueType VT,
1220 GlobalValue *getGlobal() const { return TheGlobal; }
1221 int getOffset() const { return Offset; }
1223 static bool classof(const GlobalAddressSDNode *) { return true; }
1224 static bool classof(const SDNode *N) {
1225 return N->getOpcode() == ISD::GlobalAddress ||
1226 N->getOpcode() == ISD::TargetGlobalAddress ||
1227 N->getOpcode() == ISD::GlobalTLSAddress ||
1228 N->getOpcode() == ISD::TargetGlobalTLSAddress;
1232 class FrameIndexSDNode : public SDNode {
1234 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1236 friend class SelectionDAG;
1237 FrameIndexSDNode(int fi, MVT::ValueType VT, bool isTarg)
1238 : SDNode(isTarg ? ISD::TargetFrameIndex : ISD::FrameIndex, getSDVTList(VT)),
1243 int getIndex() const { return FI; }
1245 static bool classof(const FrameIndexSDNode *) { return true; }
1246 static bool classof(const SDNode *N) {
1247 return N->getOpcode() == ISD::FrameIndex ||
1248 N->getOpcode() == ISD::TargetFrameIndex;
1252 class JumpTableSDNode : public SDNode {
1254 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1256 friend class SelectionDAG;
1257 JumpTableSDNode(int jti, MVT::ValueType VT, bool isTarg)
1258 : SDNode(isTarg ? ISD::TargetJumpTable : ISD::JumpTable, getSDVTList(VT)),
1263 int getIndex() const { return JTI; }
1265 static bool classof(const JumpTableSDNode *) { return true; }
1266 static bool classof(const SDNode *N) {
1267 return N->getOpcode() == ISD::JumpTable ||
1268 N->getOpcode() == ISD::TargetJumpTable;
1272 class ConstantPoolSDNode : public SDNode {
1275 MachineConstantPoolValue *MachineCPVal;
1277 int Offset; // It's a MachineConstantPoolValue if top bit is set.
1279 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1281 friend class SelectionDAG;
1282 ConstantPoolSDNode(bool isTarget, Constant *c, MVT::ValueType VT,
1284 : SDNode(isTarget ? ISD::TargetConstantPool : ISD::ConstantPool,
1285 getSDVTList(VT)), Offset(o), Alignment(0) {
1286 assert((int)Offset >= 0 && "Offset is too large");
1289 ConstantPoolSDNode(bool isTarget, Constant *c, MVT::ValueType VT, int o,
1291 : SDNode(isTarget ? ISD::TargetConstantPool : ISD::ConstantPool,
1292 getSDVTList(VT)), Offset(o), Alignment(Align) {
1293 assert((int)Offset >= 0 && "Offset is too large");
1296 ConstantPoolSDNode(bool isTarget, MachineConstantPoolValue *v,
1297 MVT::ValueType VT, int o=0)
1298 : SDNode(isTarget ? ISD::TargetConstantPool : ISD::ConstantPool,
1299 getSDVTList(VT)), Offset(o), Alignment(0) {
1300 assert((int)Offset >= 0 && "Offset is too large");
1301 Val.MachineCPVal = v;
1302 Offset |= 1 << (sizeof(unsigned)*8-1);
1304 ConstantPoolSDNode(bool isTarget, MachineConstantPoolValue *v,
1305 MVT::ValueType VT, int o, unsigned Align)
1306 : SDNode(isTarget ? ISD::TargetConstantPool : ISD::ConstantPool,
1307 getSDVTList(VT)), Offset(o), Alignment(Align) {
1308 assert((int)Offset >= 0 && "Offset is too large");
1309 Val.MachineCPVal = v;
1310 Offset |= 1 << (sizeof(unsigned)*8-1);
1314 bool isMachineConstantPoolEntry() const {
1315 return (int)Offset < 0;
1318 Constant *getConstVal() const {
1319 assert(!isMachineConstantPoolEntry() && "Wrong constantpool type");
1320 return Val.ConstVal;
1323 MachineConstantPoolValue *getMachineCPVal() const {
1324 assert(isMachineConstantPoolEntry() && "Wrong constantpool type");
1325 return Val.MachineCPVal;
1328 int getOffset() const {
1329 return Offset & ~(1 << (sizeof(unsigned)*8-1));
1332 // Return the alignment of this constant pool object, which is either 0 (for
1333 // default alignment) or log2 of the desired value.
1334 unsigned getAlignment() const { return Alignment; }
1336 const Type *getType() const;
1338 static bool classof(const ConstantPoolSDNode *) { return true; }
1339 static bool classof(const SDNode *N) {
1340 return N->getOpcode() == ISD::ConstantPool ||
1341 N->getOpcode() == ISD::TargetConstantPool;
1345 class BasicBlockSDNode : public SDNode {
1346 MachineBasicBlock *MBB;
1347 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1349 friend class SelectionDAG;
1350 explicit BasicBlockSDNode(MachineBasicBlock *mbb)
1351 : SDNode(ISD::BasicBlock, getSDVTList(MVT::Other)), MBB(mbb) {
1355 MachineBasicBlock *getBasicBlock() const { return MBB; }
1357 static bool classof(const BasicBlockSDNode *) { return true; }
1358 static bool classof(const SDNode *N) {
1359 return N->getOpcode() == ISD::BasicBlock;
1363 class SrcValueSDNode : public SDNode {
1366 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1368 friend class SelectionDAG;
1369 SrcValueSDNode(const Value* v, int o)
1370 : SDNode(ISD::SRCVALUE, getSDVTList(MVT::Other)), V(v), offset(o) {
1374 const Value *getValue() const { return V; }
1375 int getOffset() const { return offset; }
1377 static bool classof(const SrcValueSDNode *) { return true; }
1378 static bool classof(const SDNode *N) {
1379 return N->getOpcode() == ISD::SRCVALUE;
1384 class RegisterSDNode : public SDNode {
1386 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1388 friend class SelectionDAG;
1389 RegisterSDNode(unsigned reg, MVT::ValueType VT)
1390 : SDNode(ISD::Register, getSDVTList(VT)), Reg(reg) {
1394 unsigned getReg() const { return Reg; }
1396 static bool classof(const RegisterSDNode *) { return true; }
1397 static bool classof(const SDNode *N) {
1398 return N->getOpcode() == ISD::Register;
1402 class ExternalSymbolSDNode : public SDNode {
1404 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1406 friend class SelectionDAG;
1407 ExternalSymbolSDNode(bool isTarget, const char *Sym, MVT::ValueType VT)
1408 : SDNode(isTarget ? ISD::TargetExternalSymbol : ISD::ExternalSymbol,
1409 getSDVTList(VT)), Symbol(Sym) {
1413 const char *getSymbol() const { return Symbol; }
1415 static bool classof(const ExternalSymbolSDNode *) { return true; }
1416 static bool classof(const SDNode *N) {
1417 return N->getOpcode() == ISD::ExternalSymbol ||
1418 N->getOpcode() == ISD::TargetExternalSymbol;
1422 class CondCodeSDNode : public SDNode {
1423 ISD::CondCode Condition;
1424 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1426 friend class SelectionDAG;
1427 explicit CondCodeSDNode(ISD::CondCode Cond)
1428 : SDNode(ISD::CONDCODE, getSDVTList(MVT::Other)), Condition(Cond) {
1432 ISD::CondCode get() const { return Condition; }
1434 static bool classof(const CondCodeSDNode *) { return true; }
1435 static bool classof(const SDNode *N) {
1436 return N->getOpcode() == ISD::CONDCODE;
1440 /// VTSDNode - This class is used to represent MVT::ValueType's, which are used
1441 /// to parameterize some operations.
1442 class VTSDNode : public SDNode {
1443 MVT::ValueType ValueType;
1444 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1446 friend class SelectionDAG;
1447 explicit VTSDNode(MVT::ValueType VT)
1448 : SDNode(ISD::VALUETYPE, getSDVTList(MVT::Other)), ValueType(VT) {
1452 MVT::ValueType getVT() const { return ValueType; }
1454 static bool classof(const VTSDNode *) { return true; }
1455 static bool classof(const SDNode *N) {
1456 return N->getOpcode() == ISD::VALUETYPE;
1460 /// LSBaseSDNode - Base class for LoadSDNode and StoreSDNode
1462 class LSBaseSDNode : public SDNode {
1464 //! SrcValue - Memory location for alias analysis.
1465 const Value *SrcValue;
1467 //! SVOffset - Memory location offset.
1470 //! Alignment - Alignment of memory location in bytes.
1473 //! IsVolatile - True if the store is volatile.
1476 //! Operand array for load and store
1478 \note Moving this array to the base class captures more
1479 common functionality shared between LoadSDNode and
1484 LSBaseSDNode(ISD::NodeType NodeTy, SDVTList VTs, const Value *SV, int SVO,
1485 unsigned Align, bool Vol)
1486 : SDNode(NodeTy, VTs),
1487 SrcValue(SV), SVOffset(SVO), Alignment(Align), IsVolatile(Vol)
1490 const SDOperand getChain() const {
1491 return getOperand(0);
1493 const SDOperand getBasePtr() const {
1494 return getOperand(getOpcode() == ISD::LOAD ? 1 : 2);
1496 const SDOperand getOffset() const {
1497 return getOperand(getOpcode() == ISD::LOAD ? 2 : 3);
1499 const SDOperand getValue() const {
1500 assert(getOpcode() == ISD::STORE);
1501 return getOperand(1);
1504 const Value *getSrcValue() const { return SrcValue; }
1505 int getSrcValueOffset() const { return SVOffset; }
1506 unsigned getAlignment() const { return Alignment; }
1507 bool isVolatile() const { return IsVolatile; }
1509 static bool classof(const LSBaseSDNode *N) { return true; }
1510 static bool classof(const SDNode *N) { return true; }
1513 /// LoadSDNode - This class is used to represent ISD::LOAD nodes.
1515 class LoadSDNode : public LSBaseSDNode {
1516 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1518 // AddrMode - unindexed, pre-indexed, post-indexed.
1519 ISD::MemIndexedMode AddrMode;
1521 // ExtType - non-ext, anyext, sext, zext.
1522 ISD::LoadExtType ExtType;
1524 // LoadedVT - VT of loaded value before extension.
1525 MVT::ValueType LoadedVT;
1527 friend class SelectionDAG;
1528 LoadSDNode(SDOperand *ChainPtrOff, SDVTList VTs,
1529 ISD::MemIndexedMode AM, ISD::LoadExtType ETy, MVT::ValueType LVT,
1530 const Value *SV, int O=0, unsigned Align=0, bool Vol=false)
1531 : LSBaseSDNode(ISD::LOAD, VTs, SV, O, Align, Vol),
1532 AddrMode(AM), ExtType(ETy), LoadedVT(LVT) {
1533 Ops[0] = ChainPtrOff[0]; // Chain
1534 Ops[1] = ChainPtrOff[1]; // Ptr
1535 Ops[2] = ChainPtrOff[2]; // Off
1536 InitOperands(Ops, 3);
1537 assert(Align != 0 && "Loads should have non-zero aligment");
1538 assert((getOffset().getOpcode() == ISD::UNDEF ||
1539 AddrMode != ISD::UNINDEXED) &&
1540 "Only indexed load has a non-undef offset operand");
1544 ISD::MemIndexedMode getAddressingMode() const { return AddrMode; }
1545 ISD::LoadExtType getExtensionType() const { return ExtType; }
1546 MVT::ValueType getLoadedVT() const { return LoadedVT; }
1548 static bool classof(const LoadSDNode *) { return true; }
1549 static bool classof(const SDNode *N) {
1550 return N->getOpcode() == ISD::LOAD;
1554 /// StoreSDNode - This class is used to represent ISD::STORE nodes.
1556 class StoreSDNode : public LSBaseSDNode {
1557 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1559 // AddrMode - unindexed, pre-indexed, post-indexed.
1560 ISD::MemIndexedMode AddrMode;
1562 // IsTruncStore - True if the op does a truncation before store.
1565 // StoredVT - VT of the value after truncation.
1566 MVT::ValueType StoredVT;
1568 friend class SelectionDAG;
1569 StoreSDNode(SDOperand *ChainValuePtrOff, SDVTList VTs,
1570 ISD::MemIndexedMode AM, bool isTrunc, MVT::ValueType SVT,
1571 const Value *SV, int O=0, unsigned Align=0, bool Vol=false)
1572 : LSBaseSDNode(ISD::STORE, VTs, SV, O, Align, Vol),
1573 AddrMode(AM), IsTruncStore(isTrunc), StoredVT(SVT) {
1574 Ops[0] = ChainValuePtrOff[0]; // Chain
1575 Ops[1] = ChainValuePtrOff[1]; // Value
1576 Ops[2] = ChainValuePtrOff[2]; // Ptr
1577 Ops[3] = ChainValuePtrOff[3]; // Off
1578 InitOperands(Ops, 4);
1579 assert(Align != 0 && "Stores should have non-zero aligment");
1580 assert((getOffset().getOpcode() == ISD::UNDEF ||
1581 AddrMode != ISD::UNINDEXED) &&
1582 "Only indexed store has a non-undef offset operand");
1586 ISD::MemIndexedMode getAddressingMode() const { return AddrMode; }
1587 bool isTruncatingStore() const { return IsTruncStore; }
1588 MVT::ValueType getStoredVT() const { return StoredVT; }
1590 static bool classof(const StoreSDNode *) { return true; }
1591 static bool classof(const SDNode *N) {
1592 return N->getOpcode() == ISD::STORE;
1597 class SDNodeIterator : public forward_iterator<SDNode, ptrdiff_t> {
1601 SDNodeIterator(SDNode *N, unsigned Op) : Node(N), Operand(Op) {}
1603 bool operator==(const SDNodeIterator& x) const {
1604 return Operand == x.Operand;
1606 bool operator!=(const SDNodeIterator& x) const { return !operator==(x); }
1608 const SDNodeIterator &operator=(const SDNodeIterator &I) {
1609 assert(I.Node == Node && "Cannot assign iterators to two different nodes!");
1610 Operand = I.Operand;
1614 pointer operator*() const {
1615 return Node->getOperand(Operand).Val;
1617 pointer operator->() const { return operator*(); }
1619 SDNodeIterator& operator++() { // Preincrement
1623 SDNodeIterator operator++(int) { // Postincrement
1624 SDNodeIterator tmp = *this; ++*this; return tmp;
1627 static SDNodeIterator begin(SDNode *N) { return SDNodeIterator(N, 0); }
1628 static SDNodeIterator end (SDNode *N) {
1629 return SDNodeIterator(N, N->getNumOperands());
1632 unsigned getOperand() const { return Operand; }
1633 const SDNode *getNode() const { return Node; }
1636 template <> struct GraphTraits<SDNode*> {
1637 typedef SDNode NodeType;
1638 typedef SDNodeIterator ChildIteratorType;
1639 static inline NodeType *getEntryNode(SDNode *N) { return N; }
1640 static inline ChildIteratorType child_begin(NodeType *N) {
1641 return SDNodeIterator::begin(N);
1643 static inline ChildIteratorType child_end(NodeType *N) {
1644 return SDNodeIterator::end(N);
1649 struct ilist_traits<SDNode> {
1650 static SDNode *getPrev(const SDNode *N) { return N->Prev; }
1651 static SDNode *getNext(const SDNode *N) { return N->Next; }
1653 static void setPrev(SDNode *N, SDNode *Prev) { N->Prev = Prev; }
1654 static void setNext(SDNode *N, SDNode *Next) { N->Next = Next; }
1656 static SDNode *createSentinel() {
1657 return new SDNode(ISD::EntryToken, SDNode::getSDVTList(MVT::Other));
1659 static void destroySentinel(SDNode *N) { delete N; }
1660 //static SDNode *createNode(const SDNode &V) { return new SDNode(V); }
1663 void addNodeToList(SDNode *NTy) {}
1664 void removeNodeFromList(SDNode *NTy) {}
1665 void transferNodesFromList(iplist<SDNode, ilist_traits> &L2,
1666 const ilist_iterator<SDNode> &X,
1667 const ilist_iterator<SDNode> &Y) {}
1671 /// isNormalLoad - Returns true if the specified node is a non-extending
1672 /// and unindexed load.
1673 inline bool isNormalLoad(const SDNode *N) {
1674 if (N->getOpcode() != ISD::LOAD)
1676 const LoadSDNode *Ld = cast<LoadSDNode>(N);
1677 return Ld->getExtensionType() == ISD::NON_EXTLOAD &&
1678 Ld->getAddressingMode() == ISD::UNINDEXED;
1681 /// isNON_EXTLoad - Returns true if the specified node is a non-extending
1683 inline bool isNON_EXTLoad(const SDNode *N) {
1684 return N->getOpcode() == ISD::LOAD &&
1685 cast<LoadSDNode>(N)->getExtensionType() == ISD::NON_EXTLOAD;
1688 /// isEXTLoad - Returns true if the specified node is a EXTLOAD.
1690 inline bool isEXTLoad(const SDNode *N) {
1691 return N->getOpcode() == ISD::LOAD &&
1692 cast<LoadSDNode>(N)->getExtensionType() == ISD::EXTLOAD;
1695 /// isSEXTLoad - Returns true if the specified node is a SEXTLOAD.
1697 inline bool isSEXTLoad(const SDNode *N) {
1698 return N->getOpcode() == ISD::LOAD &&
1699 cast<LoadSDNode>(N)->getExtensionType() == ISD::SEXTLOAD;
1702 /// isZEXTLoad - Returns true if the specified node is a ZEXTLOAD.
1704 inline bool isZEXTLoad(const SDNode *N) {
1705 return N->getOpcode() == ISD::LOAD &&
1706 cast<LoadSDNode>(N)->getExtensionType() == ISD::ZEXTLOAD;
1709 /// isUNINDEXEDLoad - Returns true if the specified node is a unindexed load.
1711 inline bool isUNINDEXEDLoad(const SDNode *N) {
1712 return N->getOpcode() == ISD::LOAD &&
1713 cast<LoadSDNode>(N)->getAddressingMode() == ISD::UNINDEXED;
1716 /// isNON_TRUNCStore - Returns true if the specified node is a non-truncating
1718 inline bool isNON_TRUNCStore(const SDNode *N) {
1719 return N->getOpcode() == ISD::STORE &&
1720 !cast<StoreSDNode>(N)->isTruncatingStore();
1723 /// isTRUNCStore - Returns true if the specified node is a truncating
1725 inline bool isTRUNCStore(const SDNode *N) {
1726 return N->getOpcode() == ISD::STORE &&
1727 cast<StoreSDNode>(N)->isTruncatingStore();
1732 } // end llvm namespace