1 //===-- llvm/CodeGen/SelectionDAGNodes.h - SelectionDAG Nodes ---*- C++ -*-===//
3 // The LLVM Compiler Infrastructure
5 // This file was developed by the LLVM research group and is distributed under
6 // the University of Illinois Open Source 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/CodeGen/ValueTypes.h"
27 #include "llvm/Support/DataTypes.h"
34 class MachineBasicBlock;
35 class MachineConstantPoolValue;
37 template <typename T> struct simplify_type;
38 template <typename T> struct ilist_traits;
39 template<typename NodeTy, typename Traits> class iplist;
40 template<typename NodeTy> class ilist_iterator;
42 /// SDVTList - This represents a list of ValueType's that has been intern'd by
43 /// a SelectionDAG. Instances of this simple value class are returned by
44 /// SelectionDAG::getVTList(...).
47 const MVT::ValueType *VTs;
48 unsigned short NumVTs;
52 /// ISD namespace - This namespace contains an enum which represents all of the
53 /// SelectionDAG node types and value types.
56 //===--------------------------------------------------------------------===//
57 /// ISD::NodeType enum - This enum defines all of the operators valid in a
61 // DELETED_NODE - This is an illegal flag value that is used to catch
62 // errors. This opcode is not a legal opcode for any node.
65 // EntryToken - This is the marker used to indicate the start of the region.
68 // Token factor - This node takes multiple tokens as input and produces a
69 // single token result. This is used to represent the fact that the operand
70 // operators are independent of each other.
73 // AssertSext, AssertZext - These nodes record if a register contains a
74 // value that has already been zero or sign extended from a narrower type.
75 // These nodes take two operands. The first is the node that has already
76 // been extended, and the second is a value type node indicating the width
78 AssertSext, AssertZext,
80 // Various leaf nodes.
81 STRING, BasicBlock, VALUETYPE, CONDCODE, Register,
83 GlobalAddress, FrameIndex, JumpTable, ConstantPool, ExternalSymbol,
85 // The address of the GOT
88 // TargetConstant* - Like Constant*, but the DAG does not do any folding or
89 // simplification of the constant.
93 // TargetGlobalAddress - Like GlobalAddress, but the DAG does no folding or
94 // anything else with this node, and this is valid in the target-specific
95 // dag, turning into a GlobalAddress operand.
100 TargetExternalSymbol,
102 /// RESULT = INTRINSIC_WO_CHAIN(INTRINSICID, arg1, arg2, ...)
103 /// This node represents a target intrinsic function with no side effects.
104 /// The first operand is the ID number of the intrinsic from the
105 /// llvm::Intrinsic namespace. The operands to the intrinsic follow. The
106 /// node has returns the result of the intrinsic.
109 /// RESULT,OUTCHAIN = INTRINSIC_W_CHAIN(INCHAIN, INTRINSICID, arg1, ...)
110 /// This node represents a target intrinsic function with side effects that
111 /// returns a result. The first operand is a chain pointer. The second is
112 /// the ID number of the intrinsic from the llvm::Intrinsic namespace. The
113 /// operands to the intrinsic follow. The node has two results, the result
114 /// of the intrinsic and an output chain.
117 /// OUTCHAIN = INTRINSIC_VOID(INCHAIN, INTRINSICID, arg1, arg2, ...)
118 /// This node represents a target intrinsic function with side effects that
119 /// does not return a result. The first operand is a chain pointer. The
120 /// second is the ID number of the intrinsic from the llvm::Intrinsic
121 /// namespace. The operands to the intrinsic follow.
124 // CopyToReg - This node has three operands: a chain, a register number to
125 // set to this value, and a value.
128 // CopyFromReg - This node indicates that the input value is a virtual or
129 // physical register that is defined outside of the scope of this
130 // SelectionDAG. The register is available from the RegSDNode object.
133 // UNDEF - An undefined node
136 /// FORMAL_ARGUMENTS(CHAIN, CC#, ISVARARG) - This node represents the formal
137 /// arguments for a function. CC# is a Constant value indicating the
138 /// calling convention of the function, and ISVARARG is a flag that
139 /// indicates whether the function is varargs or not. This node has one
140 /// result value for each incoming argument, plus one for the output chain.
141 /// It must be custom legalized.
145 /// RV1, RV2...RVn, CHAIN = CALL(CHAIN, CC#, ISVARARG, ISTAILCALL, CALLEE,
146 /// ARG0, SIGN0, ARG1, SIGN1, ... ARGn, SIGNn)
147 /// This node represents a fully general function call, before the legalizer
148 /// runs. This has one result value for each argument / signness pair, plus
149 /// a chain result. It must be custom legalized.
152 // EXTRACT_ELEMENT - This is used to get the first or second (determined by
153 // a Constant, which is required to be operand #1), element of the aggregate
154 // value specified as operand #0. This is only for use before legalization,
155 // for values that will be broken into multiple registers.
158 // BUILD_PAIR - This is the opposite of EXTRACT_ELEMENT in some ways. Given
159 // two values of the same integer value type, this produces a value twice as
160 // big. Like EXTRACT_ELEMENT, this can only be used before legalization.
163 // MERGE_VALUES - This node takes multiple discrete operands and returns
164 // them all as its individual results. This nodes has exactly the same
165 // number of inputs and outputs, and is only valid before legalization.
166 // This node is useful for some pieces of the code generator that want to
167 // think about a single node with multiple results, not multiple nodes.
170 // Simple integer binary arithmetic operators.
171 ADD, SUB, MUL, SDIV, UDIV, SREM, UREM,
173 // Carry-setting nodes for multiple precision addition and subtraction.
174 // These nodes take two operands of the same value type, and produce two
175 // results. The first result is the normal add or sub result, the second
176 // result is the carry flag result.
179 // Carry-using nodes for multiple precision addition and subtraction. These
180 // nodes take three operands: The first two are the normal lhs and rhs to
181 // the add or sub, and the third is the input carry flag. These nodes
182 // produce two results; the normal result of the add or sub, and the output
183 // carry flag. These nodes both read and write a carry flag to allow them
184 // to them to be chained together for add and sub of arbitrarily large
188 // Simple binary floating point operators.
189 FADD, FSUB, FMUL, FDIV, FREM,
191 // FCOPYSIGN(X, Y) - Return the value of X with the sign of Y. NOTE: This
192 // DAG node does not require that X and Y have the same type, just that they
193 // are both floating point. X and the result must have the same type.
194 // FCOPYSIGN(f32, f64) is allowed.
197 /// VBUILD_VECTOR(ELT1, ELT2, ELT3, ELT4,..., COUNT,TYPE) - Return a vector
198 /// with the specified, possibly variable, elements. The number of elements
199 /// is required to be a power of two.
202 /// BUILD_VECTOR(ELT1, ELT2, ELT3, ELT4,...) - Return a vector
203 /// with the specified, possibly variable, elements. The number of elements
204 /// is required to be a power of two.
207 /// VINSERT_VECTOR_ELT(VECTOR, VAL, IDX, COUNT,TYPE) - Given a vector
208 /// VECTOR, an element ELEMENT, and a (potentially variable) index IDX,
209 /// return an vector with the specified element of VECTOR replaced with VAL.
210 /// COUNT and TYPE specify the type of vector, as is standard for V* nodes.
213 /// INSERT_VECTOR_ELT(VECTOR, VAL, IDX) - Returns VECTOR (a legal packed
214 /// type) with the element at IDX replaced with VAL.
217 /// VEXTRACT_VECTOR_ELT(VECTOR, IDX) - Returns a single element from VECTOR
218 /// (an MVT::Vector value) identified by the (potentially variable) element
222 /// EXTRACT_VECTOR_ELT(VECTOR, IDX) - Returns a single element from VECTOR
223 /// (a legal packed type vector) identified by the (potentially variable)
224 /// element number IDX.
227 /// VVECTOR_SHUFFLE(VEC1, VEC2, SHUFFLEVEC, COUNT,TYPE) - Returns a vector,
228 /// of the same type as VEC1/VEC2. SHUFFLEVEC is a VBUILD_VECTOR of
229 /// constant int values that indicate which value each result element will
230 /// get. The elements of VEC1/VEC2 are enumerated in order. This is quite
231 /// similar to the Altivec 'vperm' instruction, except that the indices must
232 /// be constants and are in terms of the element size of VEC1/VEC2, not in
236 /// VECTOR_SHUFFLE(VEC1, VEC2, SHUFFLEVEC) - Returns a vector, of the same
237 /// type as VEC1/VEC2. SHUFFLEVEC is a BUILD_VECTOR of constant int values
238 /// (regardless of whether its datatype is legal or not) that indicate
239 /// which value each result element will get. The elements of VEC1/VEC2 are
240 /// enumerated in order. This is quite similar to the Altivec 'vperm'
241 /// instruction, except that the indices must be constants and are in terms
242 /// of the element size of VEC1/VEC2, not in terms of bytes.
245 /// X = VBIT_CONVERT(Y) and X = VBIT_CONVERT(Y, COUNT,TYPE) - This node
246 /// represents a conversion from or to an ISD::Vector type.
248 /// This is lowered to a BIT_CONVERT of the appropriate input/output types.
249 /// The input and output are required to have the same size and at least one
250 /// is required to be a vector (if neither is a vector, just use
253 /// If the result is a vector, this takes three operands (like any other
254 /// vector producer) which indicate the size and type of the vector result.
255 /// Otherwise it takes one input.
258 /// BINOP(LHS, RHS, COUNT,TYPE)
259 /// Simple abstract vector operators. Unlike the integer and floating point
260 /// binary operators, these nodes also take two additional operands:
261 /// a constant element count, and a value type node indicating the type of
262 /// the elements. The order is count, type, op0, op1. All vector opcodes,
263 /// including VLOAD and VConstant must currently have count and type as
264 /// their last two operands.
265 VADD, VSUB, VMUL, VSDIV, VUDIV,
268 /// VSELECT(COND,LHS,RHS, COUNT,TYPE) - Select for MVT::Vector values.
269 /// COND is a boolean value. This node return LHS if COND is true, RHS if
273 /// SCALAR_TO_VECTOR(VAL) - This represents the operation of loading a
274 /// scalar value into the low element of the resultant vector type. The top
275 /// elements of the vector are undefined.
278 // MULHU/MULHS - Multiply high - Multiply two integers of type iN, producing
279 // an unsigned/signed value of type i[2*n], then return the top part.
282 // Bitwise operators - logical and, logical or, logical xor, shift left,
283 // shift right algebraic (shift in sign bits), shift right logical (shift in
284 // zeroes), rotate left, rotate right, and byteswap.
285 AND, OR, XOR, SHL, SRA, SRL, ROTL, ROTR, BSWAP,
287 // Counting operators
290 // Select(COND, TRUEVAL, FALSEVAL)
293 // Select with condition operator - This selects between a true value and
294 // a false value (ops #2 and #3) based on the boolean result of comparing
295 // the lhs and rhs (ops #0 and #1) of a conditional expression with the
296 // condition code in op #4, a CondCodeSDNode.
299 // SetCC operator - This evaluates to a boolean (i1) true value if the
300 // condition is true. The operands to this are the left and right operands
301 // to compare (ops #0, and #1) and the condition code to compare them with
302 // (op #2) as a CondCodeSDNode.
305 // SHL_PARTS/SRA_PARTS/SRL_PARTS - These operators are used for expanded
306 // integer shift operations, just like ADD/SUB_PARTS. The operation
308 // [Lo,Hi] = op [LoLHS,HiLHS], Amt
309 SHL_PARTS, SRA_PARTS, SRL_PARTS,
311 // Conversion operators. These are all single input single output
312 // operations. For all of these, the result type must be strictly
313 // wider or narrower (depending on the operation) than the source
316 // SIGN_EXTEND - Used for integer types, replicating the sign bit
320 // ZERO_EXTEND - Used for integer types, zeroing the new bits.
323 // ANY_EXTEND - Used for integer types. The high bits are undefined.
326 // TRUNCATE - Completely drop the high bits.
329 // [SU]INT_TO_FP - These operators convert integers (whose interpreted sign
330 // depends on the first letter) to floating point.
334 // SIGN_EXTEND_INREG - This operator atomically performs a SHL/SRA pair to
335 // sign extend a small value in a large integer register (e.g. sign
336 // extending the low 8 bits of a 32-bit register to fill the top 24 bits
337 // with the 7th bit). The size of the smaller type is indicated by the 1th
338 // operand, a ValueType node.
341 // FP_TO_[US]INT - Convert a floating point value to a signed or unsigned
346 // FP_ROUND - Perform a rounding operation from the current
347 // precision down to the specified precision (currently always 64->32).
350 // FP_ROUND_INREG - This operator takes a floating point register, and
351 // rounds it to a floating point value. It then promotes it and returns it
352 // in a register of the same size. This operation effectively just discards
353 // excess precision. The type to round down to is specified by the 1th
354 // operation, a VTSDNode (currently always 64->32->64).
357 // FP_EXTEND - Extend a smaller FP type into a larger FP type.
360 // BIT_CONVERT - Theis operator converts between integer and FP values, as
361 // if one was stored to memory as integer and the other was loaded from the
362 // same address (or equivalently for vector format conversions, etc). The
363 // source and result are required to have the same bit size (e.g.
364 // f32 <-> i32). This can also be used for int-to-int or fp-to-fp
365 // conversions, but that is a noop, deleted by getNode().
368 // FNEG, FABS, FSQRT, FSIN, FCOS, FPOWI - Perform unary floating point
369 // negation, absolute value, square root, sine and cosine, and powi
371 FNEG, FABS, FSQRT, FSIN, FCOS, FPOWI,
373 // LOAD and STORE have token chains as their first operand, then the same
374 // operands as an LLVM load/store instruction, then an offset node that
375 // is added / subtracted from the base pointer to form the address (for
376 // indexed memory ops).
379 // Abstract vector version of LOAD. VLOAD has a constant element count as
380 // the first operand, followed by a value type node indicating the type of
381 // the elements, a token chain, a pointer operand, and a SRCVALUE node.
384 // TRUNCSTORE - This operators truncates (for integer) or rounds (for FP) a
385 // value and stores it to memory in one operation. This can be used for
386 // either integer or floating point operands. The first four operands of
387 // this are the same as a standard store. The fifth is the ValueType to
388 // store it as (which will be smaller than the source value).
391 // DYNAMIC_STACKALLOC - Allocate some number of bytes on the stack aligned
392 // to a specified boundary. The first operand is the token chain, the
393 // second is the number of bytes to allocate, and the third is the alignment
394 // boundary. The size is guaranteed to be a multiple of the stack
395 // alignment, and the alignment is guaranteed to be bigger than the stack
396 // alignment (if required) or 0 to get standard stack alignment.
399 // Control flow instructions. These all have token chains.
401 // BR - Unconditional branch. The first operand is the chain
402 // operand, the second is the MBB to branch to.
405 // BRIND - Indirect branch. The first operand is the chain, the second
406 // is the value to branch to, which must be of the same type as the target's
410 // BR_JT - Jumptable branch. The first operand is the chain, the second
411 // is the jumptable index, the last one is the jumptable entry index.
414 // BRCOND - Conditional branch. The first operand is the chain,
415 // the second is the condition, the third is the block to branch
416 // to if the condition is true.
419 // BR_CC - Conditional branch. The behavior is like that of SELECT_CC, in
420 // that the condition is represented as condition code, and two nodes to
421 // compare, rather than as a combined SetCC node. The operands in order are
422 // chain, cc, lhs, rhs, block to branch to if condition is true.
425 // RET - Return from function. The first operand is the chain,
426 // and any subsequent operands are pairs of return value and return value
427 // signness for the function. This operation can have variable number of
431 // INLINEASM - Represents an inline asm block. This node always has two
432 // return values: a chain and a flag result. The inputs are as follows:
433 // Operand #0 : Input chain.
434 // Operand #1 : a ExternalSymbolSDNode with a pointer to the asm string.
435 // Operand #2n+2: A RegisterNode.
436 // Operand #2n+3: A TargetConstant, indicating if the reg is a use/def
437 // Operand #last: Optional, an incoming flag.
440 // LABEL - Represents a label in mid basic block used to track
441 // locations needed for debug and exception handling tables. This node
443 // Operand #0 : input chain.
444 // Operand #1 : module unique number use to identify the label.
447 // STACKSAVE - STACKSAVE has one operand, an input chain. It produces a
448 // value, the same type as the pointer type for the system, and an output
452 // STACKRESTORE has two operands, an input chain and a pointer to restore to
453 // it returns an output chain.
456 // MEMSET/MEMCPY/MEMMOVE - The first operand is the chain, and the rest
457 // correspond to the operands of the LLVM intrinsic functions. The only
458 // result is a token chain. The alignment argument is guaranteed to be a
464 // CALLSEQ_START/CALLSEQ_END - These operators mark the beginning and end of
465 // a call sequence, and carry arbitrary information that target might want
466 // to know. The first operand is a chain, the rest are specified by the
467 // target and not touched by the DAG optimizers.
468 CALLSEQ_START, // Beginning of a call sequence
469 CALLSEQ_END, // End of a call sequence
471 // VAARG - VAARG has three operands: an input chain, a pointer, and a
472 // SRCVALUE. It returns a pair of values: the vaarg value and a new chain.
475 // VACOPY - VACOPY has five operands: an input chain, a destination pointer,
476 // a source pointer, a SRCVALUE for the destination, and a SRCVALUE for the
480 // VAEND, VASTART - VAEND and VASTART have three operands: an input chain, a
481 // pointer, and a SRCVALUE.
484 // SRCVALUE - This corresponds to a Value*, and is used to associate memory
485 // locations with their value. This allows one use alias analysis
486 // information in the backend.
489 // PCMARKER - This corresponds to the pcmarker intrinsic.
492 // READCYCLECOUNTER - This corresponds to the readcyclecounter intrinsic.
493 // The only operand is a chain and a value and a chain are produced. The
494 // value is the contents of the architecture specific cycle counter like
495 // register (or other high accuracy low latency clock source)
498 // HANDLENODE node - Used as a handle for various purposes.
501 // LOCATION - This node is used to represent a source location for debug
502 // info. It takes token chain as input, then a line number, then a column
503 // number, then a filename, then a working dir. It produces a token chain
507 // DEBUG_LOC - This node is used to represent source line information
508 // embedded in the code. It takes a token chain as input, then a line
509 // number, then a column then a file id (provided by MachineDebugInfo.) It
510 // produces a token chain as output.
513 // BUILTIN_OP_END - This must be the last enum value in this list.
519 /// isBuildVectorAllOnes - Return true if the specified node is a
520 /// BUILD_VECTOR where all of the elements are ~0 or undef.
521 bool isBuildVectorAllOnes(const SDNode *N);
523 /// isBuildVectorAllZeros - Return true if the specified node is a
524 /// BUILD_VECTOR where all of the elements are 0 or undef.
525 bool isBuildVectorAllZeros(const SDNode *N);
527 //===--------------------------------------------------------------------===//
528 /// MemIndexedMode enum - This enum defines the load / store indexed
529 /// addressing modes.
531 /// UNINDEXED "Normal" load / store. The effective address is already
532 /// computed and is available in the base pointer. The offset
533 /// operand is always undefined. In addition to producing a
534 /// chain, an unindexed load produces one value (result of the
535 /// load); an unindexed store does not produces a value.
537 /// PRE_INC Similar to the unindexed mode where the effective address is
538 /// PRE_DEC the value of the base pointer add / subtract the offset.
539 /// It considers the computation as being folded into the load /
540 /// store operation (i.e. the load / store does the address
541 /// computation as well as performing the memory transaction).
542 /// The base operand is always undefined. In addition to
543 /// producing a chain, pre-indexed load produces two values
544 /// (result of the load and the result of the address
545 /// computation); a pre-indexed store produces one value (result
546 /// of the address computation).
548 /// POST_INC The effective address is the value of the base pointer. The
549 /// POST_DEC value of the offset operand is then added to / subtracted
550 /// from the base after memory transaction. In addition to
551 /// producing a chain, post-indexed load produces two values
552 /// (the result of the load and the result of the base +/- offset
553 /// computation); a post-indexed store produces one value (the
554 /// the result of the base +/- offset computation).
556 enum MemIndexedMode {
565 //===--------------------------------------------------------------------===//
566 /// LoadExtType enum - This enum defines the three variants of LOADEXT
567 /// (load with extension).
569 /// SEXTLOAD loads the integer operand and sign extends it to a larger
570 /// integer result type.
571 /// ZEXTLOAD loads the integer operand and zero extends it to a larger
572 /// integer result type.
573 /// EXTLOAD is used for three things: floating point extending loads,
574 /// integer extending loads [the top bits are undefined], and vector
575 /// extending loads [load into low elt].
585 //===--------------------------------------------------------------------===//
586 /// ISD::CondCode enum - These are ordered carefully to make the bitfields
587 /// below work out, when considering SETFALSE (something that never exists
588 /// dynamically) as 0. "U" -> Unsigned (for integer operands) or Unordered
589 /// (for floating point), "L" -> Less than, "G" -> Greater than, "E" -> Equal
590 /// to. If the "N" column is 1, the result of the comparison is undefined if
591 /// the input is a NAN.
593 /// All of these (except for the 'always folded ops') should be handled for
594 /// floating point. For integer, only the SETEQ,SETNE,SETLT,SETLE,SETGT,
595 /// SETGE,SETULT,SETULE,SETUGT, and SETUGE opcodes are used.
597 /// Note that these are laid out in a specific order to allow bit-twiddling
598 /// to transform conditions.
600 // Opcode N U L G E Intuitive operation
601 SETFALSE, // 0 0 0 0 Always false (always folded)
602 SETOEQ, // 0 0 0 1 True if ordered and equal
603 SETOGT, // 0 0 1 0 True if ordered and greater than
604 SETOGE, // 0 0 1 1 True if ordered and greater than or equal
605 SETOLT, // 0 1 0 0 True if ordered and less than
606 SETOLE, // 0 1 0 1 True if ordered and less than or equal
607 SETONE, // 0 1 1 0 True if ordered and operands are unequal
608 SETO, // 0 1 1 1 True if ordered (no nans)
609 SETUO, // 1 0 0 0 True if unordered: isnan(X) | isnan(Y)
610 SETUEQ, // 1 0 0 1 True if unordered or equal
611 SETUGT, // 1 0 1 0 True if unordered or greater than
612 SETUGE, // 1 0 1 1 True if unordered, greater than, or equal
613 SETULT, // 1 1 0 0 True if unordered or less than
614 SETULE, // 1 1 0 1 True if unordered, less than, or equal
615 SETUNE, // 1 1 1 0 True if unordered or not equal
616 SETTRUE, // 1 1 1 1 Always true (always folded)
617 // Don't care operations: undefined if the input is a nan.
618 SETFALSE2, // 1 X 0 0 0 Always false (always folded)
619 SETEQ, // 1 X 0 0 1 True if equal
620 SETGT, // 1 X 0 1 0 True if greater than
621 SETGE, // 1 X 0 1 1 True if greater than or equal
622 SETLT, // 1 X 1 0 0 True if less than
623 SETLE, // 1 X 1 0 1 True if less than or equal
624 SETNE, // 1 X 1 1 0 True if not equal
625 SETTRUE2, // 1 X 1 1 1 Always true (always folded)
627 SETCC_INVALID // Marker value.
630 /// isSignedIntSetCC - Return true if this is a setcc instruction that
631 /// performs a signed comparison when used with integer operands.
632 inline bool isSignedIntSetCC(CondCode Code) {
633 return Code == SETGT || Code == SETGE || Code == SETLT || Code == SETLE;
636 /// isUnsignedIntSetCC - Return true if this is a setcc instruction that
637 /// performs an unsigned comparison when used with integer operands.
638 inline bool isUnsignedIntSetCC(CondCode Code) {
639 return Code == SETUGT || Code == SETUGE || Code == SETULT || Code == SETULE;
642 /// isTrueWhenEqual - Return true if the specified condition returns true if
643 /// the two operands to the condition are equal. Note that if one of the two
644 /// operands is a NaN, this value is meaningless.
645 inline bool isTrueWhenEqual(CondCode Cond) {
646 return ((int)Cond & 1) != 0;
649 /// getUnorderedFlavor - This function returns 0 if the condition is always
650 /// false if an operand is a NaN, 1 if the condition is always true if the
651 /// operand is a NaN, and 2 if the condition is undefined if the operand is a
653 inline unsigned getUnorderedFlavor(CondCode Cond) {
654 return ((int)Cond >> 3) & 3;
657 /// getSetCCInverse - Return the operation corresponding to !(X op Y), where
658 /// 'op' is a valid SetCC operation.
659 CondCode getSetCCInverse(CondCode Operation, bool isInteger);
661 /// getSetCCSwappedOperands - Return the operation corresponding to (Y op X)
662 /// when given the operation for (X op Y).
663 CondCode getSetCCSwappedOperands(CondCode Operation);
665 /// getSetCCOrOperation - Return the result of a logical OR between different
666 /// comparisons of identical values: ((X op1 Y) | (X op2 Y)). This
667 /// function returns SETCC_INVALID if it is not possible to represent the
668 /// resultant comparison.
669 CondCode getSetCCOrOperation(CondCode Op1, CondCode Op2, bool isInteger);
671 /// getSetCCAndOperation - Return the result of a logical AND between
672 /// different comparisons of identical values: ((X op1 Y) & (X op2 Y)). This
673 /// function returns SETCC_INVALID if it is not possible to represent the
674 /// resultant comparison.
675 CondCode getSetCCAndOperation(CondCode Op1, CondCode Op2, bool isInteger);
676 } // end llvm::ISD namespace
679 //===----------------------------------------------------------------------===//
680 /// SDOperand - Unlike LLVM values, Selection DAG nodes may return multiple
681 /// values as the result of a computation. Many nodes return multiple values,
682 /// from loads (which define a token and a return value) to ADDC (which returns
683 /// a result and a carry value), to calls (which may return an arbitrary number
686 /// As such, each use of a SelectionDAG computation must indicate the node that
687 /// computes it as well as which return value to use from that node. This pair
688 /// of information is represented with the SDOperand value type.
692 SDNode *Val; // The node defining the value we are using.
693 unsigned ResNo; // Which return value of the node we are using.
695 SDOperand() : Val(0), ResNo(0) {}
696 SDOperand(SDNode *val, unsigned resno) : Val(val), ResNo(resno) {}
698 bool operator==(const SDOperand &O) const {
699 return Val == O.Val && ResNo == O.ResNo;
701 bool operator!=(const SDOperand &O) const {
702 return !operator==(O);
704 bool operator<(const SDOperand &O) const {
705 return Val < O.Val || (Val == O.Val && ResNo < O.ResNo);
708 SDOperand getValue(unsigned R) const {
709 return SDOperand(Val, R);
712 // isOperand - Return true if this node is an operand of N.
713 bool isOperand(SDNode *N) const;
715 /// getValueType - Return the ValueType of the referenced return value.
717 inline MVT::ValueType getValueType() const;
719 // Forwarding methods - These forward to the corresponding methods in SDNode.
720 inline unsigned getOpcode() const;
721 inline unsigned getNumOperands() const;
722 inline const SDOperand &getOperand(unsigned i) const;
723 inline uint64_t getConstantOperandVal(unsigned i) const;
724 inline bool isTargetOpcode() const;
725 inline unsigned getTargetOpcode() const;
727 /// hasOneUse - Return true if there is exactly one operation using this
728 /// result value of the defining operator.
729 inline bool hasOneUse() const;
733 /// simplify_type specializations - Allow casting operators to work directly on
734 /// SDOperands as if they were SDNode*'s.
735 template<> struct simplify_type<SDOperand> {
736 typedef SDNode* SimpleType;
737 static SimpleType getSimplifiedValue(const SDOperand &Val) {
738 return static_cast<SimpleType>(Val.Val);
741 template<> struct simplify_type<const SDOperand> {
742 typedef SDNode* SimpleType;
743 static SimpleType getSimplifiedValue(const SDOperand &Val) {
744 return static_cast<SimpleType>(Val.Val);
749 /// SDNode - Represents one node in the SelectionDAG.
751 class SDNode : public FoldingSetNode {
752 /// NodeType - The operation that this node performs.
754 unsigned short NodeType;
756 /// NodeId - Unique id per SDNode in the DAG.
759 /// OperandList - The values that are used by this operation.
761 SDOperand *OperandList;
763 /// ValueList - The types of the values this node defines. SDNode's may
764 /// define multiple values simultaneously.
765 const MVT::ValueType *ValueList;
767 /// NumOperands/NumValues - The number of entries in the Operand/Value list.
768 unsigned short NumOperands, NumValues;
770 /// Prev/Next pointers - These pointers form the linked list of of the
771 /// AllNodes list in the current DAG.
773 friend struct ilist_traits<SDNode>;
775 /// Uses - These are all of the SDNode's that use a value produced by this
777 SmallVector<SDNode*,3> Uses;
779 // Out-of-line virtual method to give class a home.
780 virtual void ANCHOR();
783 assert(NumOperands == 0 && "Operand list not cleared before deletion");
784 NodeType = ISD::DELETED_NODE;
787 //===--------------------------------------------------------------------===//
790 unsigned getOpcode() const { return NodeType; }
791 bool isTargetOpcode() const { return NodeType >= ISD::BUILTIN_OP_END; }
792 unsigned getTargetOpcode() const {
793 assert(isTargetOpcode() && "Not a target opcode!");
794 return NodeType - ISD::BUILTIN_OP_END;
797 size_t use_size() const { return Uses.size(); }
798 bool use_empty() const { return Uses.empty(); }
799 bool hasOneUse() const { return Uses.size() == 1; }
801 /// getNodeId - Return the unique node id.
803 int getNodeId() const { return NodeId; }
805 typedef SmallVector<SDNode*,3>::const_iterator use_iterator;
806 use_iterator use_begin() const { return Uses.begin(); }
807 use_iterator use_end() const { return Uses.end(); }
809 /// hasNUsesOfValue - Return true if there are exactly NUSES uses of the
810 /// indicated value. This method ignores uses of other values defined by this
812 bool hasNUsesOfValue(unsigned NUses, unsigned Value) const;
814 /// isOnlyUse - Return true if this node is the only use of N.
816 bool isOnlyUse(SDNode *N) const;
818 /// isOperand - Return true if this node is an operand of N.
820 bool isOperand(SDNode *N) const;
822 /// isPredecessor - Return true if this node is a predecessor of N. This node
823 /// is either an operand of N or it can be reached by recursively traversing
825 /// NOTE: this is an expensive method. Use it carefully.
826 bool isPredecessor(SDNode *N) const;
828 /// getNumOperands - Return the number of values used by this operation.
830 unsigned getNumOperands() const { return NumOperands; }
832 /// getConstantOperandVal - Helper method returns the integer value of a
833 /// ConstantSDNode operand.
834 uint64_t getConstantOperandVal(unsigned Num) const;
836 const SDOperand &getOperand(unsigned Num) const {
837 assert(Num < NumOperands && "Invalid child # of SDNode!");
838 return OperandList[Num];
841 typedef const SDOperand* op_iterator;
842 op_iterator op_begin() const { return OperandList; }
843 op_iterator op_end() const { return OperandList+NumOperands; }
846 SDVTList getVTList() const {
847 SDVTList X = { ValueList, NumValues };
851 /// getNumValues - Return the number of values defined/returned by this
854 unsigned getNumValues() const { return NumValues; }
856 /// getValueType - Return the type of a specified result.
858 MVT::ValueType getValueType(unsigned ResNo) const {
859 assert(ResNo < NumValues && "Illegal result number!");
860 return ValueList[ResNo];
863 typedef const MVT::ValueType* value_iterator;
864 value_iterator value_begin() const { return ValueList; }
865 value_iterator value_end() const { return ValueList+NumValues; }
867 /// getOperationName - Return the opcode of this operation for printing.
869 const char* getOperationName(const SelectionDAG *G = 0) const;
870 static const char* getIndexedModeName(ISD::MemIndexedMode AM);
872 void dump(const SelectionDAG *G) const;
874 static bool classof(const SDNode *) { return true; }
876 /// Profile - Gather unique data for the node.
878 void Profile(FoldingSetNodeID &ID);
881 friend class SelectionDAG;
883 /// getValueTypeList - Return a pointer to the specified value type.
885 static MVT::ValueType *getValueTypeList(MVT::ValueType VT);
887 SDNode(unsigned NT, MVT::ValueType VT) : NodeType(NT), NodeId(-1) {
888 OperandList = 0; NumOperands = 0;
889 ValueList = getValueTypeList(VT);
893 SDNode(unsigned NT, SDOperand Op)
894 : NodeType(NT), NodeId(-1) {
895 OperandList = new SDOperand[1];
898 Op.Val->Uses.push_back(this);
903 SDNode(unsigned NT, SDOperand N1, SDOperand N2)
904 : NodeType(NT), NodeId(-1) {
905 OperandList = new SDOperand[2];
909 N1.Val->Uses.push_back(this); N2.Val->Uses.push_back(this);
914 SDNode(unsigned NT, SDOperand N1, SDOperand N2, SDOperand N3)
915 : NodeType(NT), NodeId(-1) {
916 OperandList = new SDOperand[3];
922 N1.Val->Uses.push_back(this); N2.Val->Uses.push_back(this);
923 N3.Val->Uses.push_back(this);
928 SDNode(unsigned NT, SDOperand N1, SDOperand N2, SDOperand N3, SDOperand N4)
929 : NodeType(NT), NodeId(-1) {
930 OperandList = new SDOperand[4];
937 N1.Val->Uses.push_back(this); N2.Val->Uses.push_back(this);
938 N3.Val->Uses.push_back(this); N4.Val->Uses.push_back(this);
943 SDNode(unsigned Opc, const SDOperand *Ops, unsigned NumOps)
944 : NodeType(Opc), NodeId(-1) {
945 NumOperands = NumOps;
946 OperandList = new SDOperand[NumOperands];
948 for (unsigned i = 0, e = NumOps; i != e; ++i) {
949 OperandList[i] = Ops[i];
950 SDNode *N = OperandList[i].Val;
951 N->Uses.push_back(this);
958 /// MorphNodeTo - This clears the return value and operands list, and sets the
959 /// opcode of the node to the specified value. This should only be used by
960 /// the SelectionDAG class.
961 void MorphNodeTo(unsigned Opc) {
966 // Clear the operands list, updating used nodes to remove this from their
968 for (op_iterator I = op_begin(), E = op_end(); I != E; ++I)
969 I->Val->removeUser(this);
970 delete [] OperandList;
975 void setValueTypes(SDVTList L) {
976 assert(NumValues == 0 && "Should not have values yet!");
978 NumValues = L.NumVTs;
981 void setOperands(SDOperand Op0) {
982 assert(NumOperands == 0 && "Should not have operands yet!");
983 OperandList = new SDOperand[1];
984 OperandList[0] = Op0;
986 Op0.Val->Uses.push_back(this);
988 void setOperands(SDOperand Op0, SDOperand Op1) {
989 assert(NumOperands == 0 && "Should not have operands yet!");
990 OperandList = new SDOperand[2];
991 OperandList[0] = Op0;
992 OperandList[1] = Op1;
994 Op0.Val->Uses.push_back(this); Op1.Val->Uses.push_back(this);
996 void setOperands(SDOperand Op0, SDOperand Op1, SDOperand Op2) {
997 assert(NumOperands == 0 && "Should not have operands yet!");
998 OperandList = new SDOperand[3];
999 OperandList[0] = Op0;
1000 OperandList[1] = Op1;
1001 OperandList[2] = Op2;
1003 Op0.Val->Uses.push_back(this); Op1.Val->Uses.push_back(this);
1004 Op2.Val->Uses.push_back(this);
1006 void setOperands(const SDOperand *Ops, unsigned NumOps) {
1007 assert(NumOperands == 0 && "Should not have operands yet!");
1008 NumOperands = NumOps;
1009 OperandList = new SDOperand[NumOperands];
1011 for (unsigned i = 0, e = NumOps; i != e; ++i) {
1012 OperandList[i] = Ops[i];
1013 SDNode *N = OperandList[i].Val;
1014 N->Uses.push_back(this);
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();
1033 void setNodeId(int Id) {
1039 // Define inline functions from the SDOperand class.
1041 inline unsigned SDOperand::getOpcode() const {
1042 return Val->getOpcode();
1044 inline MVT::ValueType SDOperand::getValueType() const {
1045 return Val->getValueType(ResNo);
1047 inline unsigned SDOperand::getNumOperands() const {
1048 return Val->getNumOperands();
1050 inline const SDOperand &SDOperand::getOperand(unsigned i) const {
1051 return Val->getOperand(i);
1053 inline uint64_t SDOperand::getConstantOperandVal(unsigned i) const {
1054 return Val->getConstantOperandVal(i);
1056 inline bool SDOperand::isTargetOpcode() const {
1057 return Val->isTargetOpcode();
1059 inline unsigned SDOperand::getTargetOpcode() const {
1060 return Val->getTargetOpcode();
1062 inline bool SDOperand::hasOneUse() const {
1063 return Val->hasNUsesOfValue(1, ResNo);
1066 /// HandleSDNode - This class is used to form a handle around another node that
1067 /// is persistant and is updated across invocations of replaceAllUsesWith on its
1068 /// operand. This node should be directly created by end-users and not added to
1069 /// the AllNodes list.
1070 class HandleSDNode : public SDNode {
1072 HandleSDNode(SDOperand X) : SDNode(ISD::HANDLENODE, X) {}
1074 MorphNodeTo(ISD::HANDLENODE); // Drops operand uses.
1077 SDOperand getValue() const { return getOperand(0); }
1080 class StringSDNode : public SDNode {
1083 friend class SelectionDAG;
1084 StringSDNode(const std::string &val)
1085 : SDNode(ISD::STRING, MVT::Other), Value(val) {
1088 const std::string &getValue() const { return Value; }
1089 static bool classof(const StringSDNode *) { return true; }
1090 static bool classof(const SDNode *N) {
1091 return N->getOpcode() == ISD::STRING;
1095 class ConstantSDNode : public SDNode {
1098 friend class SelectionDAG;
1099 ConstantSDNode(bool isTarget, uint64_t val, MVT::ValueType VT)
1100 : SDNode(isTarget ? ISD::TargetConstant : ISD::Constant, VT), Value(val) {
1104 uint64_t getValue() const { return Value; }
1106 int64_t getSignExtended() const {
1107 unsigned Bits = MVT::getSizeInBits(getValueType(0));
1108 return ((int64_t)Value << (64-Bits)) >> (64-Bits);
1111 bool isNullValue() const { return Value == 0; }
1112 bool isAllOnesValue() const {
1113 return Value == MVT::getIntVTBitMask(getValueType(0));
1116 static bool classof(const ConstantSDNode *) { return true; }
1117 static bool classof(const SDNode *N) {
1118 return N->getOpcode() == ISD::Constant ||
1119 N->getOpcode() == ISD::TargetConstant;
1123 class ConstantFPSDNode : public SDNode {
1126 friend class SelectionDAG;
1127 ConstantFPSDNode(bool isTarget, double val, MVT::ValueType VT)
1128 : SDNode(isTarget ? ISD::TargetConstantFP : ISD::ConstantFP, VT),
1133 double getValue() const { return Value; }
1135 /// isExactlyValue - We don't rely on operator== working on double values, as
1136 /// it returns true for things that are clearly not equal, like -0.0 and 0.0.
1137 /// As such, this method can be used to do an exact bit-for-bit comparison of
1138 /// two floating point values.
1139 bool isExactlyValue(double V) const;
1141 static bool classof(const ConstantFPSDNode *) { return true; }
1142 static bool classof(const SDNode *N) {
1143 return N->getOpcode() == ISD::ConstantFP ||
1144 N->getOpcode() == ISD::TargetConstantFP;
1148 class GlobalAddressSDNode : public SDNode {
1149 GlobalValue *TheGlobal;
1152 friend class SelectionDAG;
1153 GlobalAddressSDNode(bool isTarget, const GlobalValue *GA, MVT::ValueType VT,
1155 : SDNode(isTarget ? ISD::TargetGlobalAddress : ISD::GlobalAddress, VT),
1157 TheGlobal = const_cast<GlobalValue*>(GA);
1161 GlobalValue *getGlobal() const { return TheGlobal; }
1162 int getOffset() const { return Offset; }
1164 static bool classof(const GlobalAddressSDNode *) { return true; }
1165 static bool classof(const SDNode *N) {
1166 return N->getOpcode() == ISD::GlobalAddress ||
1167 N->getOpcode() == ISD::TargetGlobalAddress;
1172 class FrameIndexSDNode : public SDNode {
1175 friend class SelectionDAG;
1176 FrameIndexSDNode(int fi, MVT::ValueType VT, bool isTarg)
1177 : SDNode(isTarg ? ISD::TargetFrameIndex : ISD::FrameIndex, VT), FI(fi) {}
1180 int getIndex() const { return FI; }
1182 static bool classof(const FrameIndexSDNode *) { return true; }
1183 static bool classof(const SDNode *N) {
1184 return N->getOpcode() == ISD::FrameIndex ||
1185 N->getOpcode() == ISD::TargetFrameIndex;
1189 class JumpTableSDNode : public SDNode {
1192 friend class SelectionDAG;
1193 JumpTableSDNode(int jti, MVT::ValueType VT, bool isTarg)
1194 : SDNode(isTarg ? ISD::TargetJumpTable : ISD::JumpTable, VT),
1198 int getIndex() const { return JTI; }
1200 static bool classof(const JumpTableSDNode *) { return true; }
1201 static bool classof(const SDNode *N) {
1202 return N->getOpcode() == ISD::JumpTable ||
1203 N->getOpcode() == ISD::TargetJumpTable;
1207 class ConstantPoolSDNode : public SDNode {
1210 MachineConstantPoolValue *MachineCPVal;
1212 int Offset; // It's a MachineConstantPoolValue if top bit is set.
1215 friend class SelectionDAG;
1216 ConstantPoolSDNode(bool isTarget, Constant *c, MVT::ValueType VT,
1218 : SDNode(isTarget ? ISD::TargetConstantPool : ISD::ConstantPool, VT),
1219 Offset(o), Alignment(0) {
1220 assert((int)Offset >= 0 && "Offset is too large");
1223 ConstantPoolSDNode(bool isTarget, Constant *c, MVT::ValueType VT, int o,
1225 : SDNode(isTarget ? ISD::TargetConstantPool : ISD::ConstantPool, VT),
1226 Offset(o), Alignment(Align) {
1227 assert((int)Offset >= 0 && "Offset is too large");
1230 ConstantPoolSDNode(bool isTarget, MachineConstantPoolValue *v,
1231 MVT::ValueType VT, int o=0)
1232 : SDNode(isTarget ? ISD::TargetConstantPool : ISD::ConstantPool, VT),
1233 Offset(o), Alignment(0) {
1234 assert((int)Offset >= 0 && "Offset is too large");
1235 Val.MachineCPVal = v;
1236 Offset |= 1 << (sizeof(unsigned)*8-1);
1238 ConstantPoolSDNode(bool isTarget, MachineConstantPoolValue *v,
1239 MVT::ValueType VT, int o, unsigned Align)
1240 : SDNode(isTarget ? ISD::TargetConstantPool : ISD::ConstantPool, VT),
1241 Offset(o), Alignment(Align) {
1242 assert((int)Offset >= 0 && "Offset is too large");
1243 Val.MachineCPVal = v;
1244 Offset |= 1 << (sizeof(unsigned)*8-1);
1248 bool isMachineConstantPoolEntry() const {
1249 return (int)Offset < 0;
1252 Constant *getConstVal() const {
1253 assert(!isMachineConstantPoolEntry() && "Wrong constantpool type");
1254 return Val.ConstVal;
1257 MachineConstantPoolValue *getMachineCPVal() const {
1258 assert(isMachineConstantPoolEntry() && "Wrong constantpool type");
1259 return Val.MachineCPVal;
1262 int getOffset() const {
1263 return Offset & ~(1 << (sizeof(unsigned)*8-1));
1266 // Return the alignment of this constant pool object, which is either 0 (for
1267 // default alignment) or log2 of the desired value.
1268 unsigned getAlignment() const { return Alignment; }
1270 const Type *getType() const;
1272 static bool classof(const ConstantPoolSDNode *) { return true; }
1273 static bool classof(const SDNode *N) {
1274 return N->getOpcode() == ISD::ConstantPool ||
1275 N->getOpcode() == ISD::TargetConstantPool;
1279 class BasicBlockSDNode : public SDNode {
1280 MachineBasicBlock *MBB;
1282 friend class SelectionDAG;
1283 BasicBlockSDNode(MachineBasicBlock *mbb)
1284 : SDNode(ISD::BasicBlock, MVT::Other), MBB(mbb) {}
1287 MachineBasicBlock *getBasicBlock() const { return MBB; }
1289 static bool classof(const BasicBlockSDNode *) { return true; }
1290 static bool classof(const SDNode *N) {
1291 return N->getOpcode() == ISD::BasicBlock;
1295 class SrcValueSDNode : public SDNode {
1299 friend class SelectionDAG;
1300 SrcValueSDNode(const Value* v, int o)
1301 : SDNode(ISD::SRCVALUE, MVT::Other), V(v), offset(o) {}
1304 const Value *getValue() const { return V; }
1305 int getOffset() const { return offset; }
1307 static bool classof(const SrcValueSDNode *) { return true; }
1308 static bool classof(const SDNode *N) {
1309 return N->getOpcode() == ISD::SRCVALUE;
1314 class RegisterSDNode : public SDNode {
1317 friend class SelectionDAG;
1318 RegisterSDNode(unsigned reg, MVT::ValueType VT)
1319 : SDNode(ISD::Register, VT), Reg(reg) {}
1322 unsigned getReg() const { return Reg; }
1324 static bool classof(const RegisterSDNode *) { return true; }
1325 static bool classof(const SDNode *N) {
1326 return N->getOpcode() == ISD::Register;
1330 class ExternalSymbolSDNode : public SDNode {
1333 friend class SelectionDAG;
1334 ExternalSymbolSDNode(bool isTarget, const char *Sym, MVT::ValueType VT)
1335 : SDNode(isTarget ? ISD::TargetExternalSymbol : ISD::ExternalSymbol, VT),
1340 const char *getSymbol() const { return Symbol; }
1342 static bool classof(const ExternalSymbolSDNode *) { return true; }
1343 static bool classof(const SDNode *N) {
1344 return N->getOpcode() == ISD::ExternalSymbol ||
1345 N->getOpcode() == ISD::TargetExternalSymbol;
1349 class CondCodeSDNode : public SDNode {
1350 ISD::CondCode Condition;
1352 friend class SelectionDAG;
1353 CondCodeSDNode(ISD::CondCode Cond)
1354 : SDNode(ISD::CONDCODE, MVT::Other), Condition(Cond) {
1358 ISD::CondCode get() const { return Condition; }
1360 static bool classof(const CondCodeSDNode *) { return true; }
1361 static bool classof(const SDNode *N) {
1362 return N->getOpcode() == ISD::CONDCODE;
1366 /// VTSDNode - This class is used to represent MVT::ValueType's, which are used
1367 /// to parameterize some operations.
1368 class VTSDNode : public SDNode {
1369 MVT::ValueType ValueType;
1371 friend class SelectionDAG;
1372 VTSDNode(MVT::ValueType VT)
1373 : SDNode(ISD::VALUETYPE, MVT::Other), ValueType(VT) {}
1376 MVT::ValueType getVT() const { return ValueType; }
1378 static bool classof(const VTSDNode *) { return true; }
1379 static bool classof(const SDNode *N) {
1380 return N->getOpcode() == ISD::VALUETYPE;
1384 /// LoadSDNode - This class is used to represent ISD::LOAD nodes.
1386 class LoadSDNode : public SDNode {
1387 // AddrMode - unindexed, pre-indexed, post-indexed.
1388 ISD::MemIndexedMode AddrMode;
1390 // ExtType - non-ext, anyext, sext, zext.
1391 ISD::LoadExtType ExtType;
1393 // LoadedVT - VT of loaded value before extension.
1394 MVT::ValueType LoadedVT;
1396 // SrcValue - Memory location for alias analysis.
1397 const Value *SrcValue;
1399 // SVOffset - Memory location offset.
1402 // Alignment - Alignment of memory location in bytes.
1405 // IsVolatile - True if the load is volatile.
1408 friend class SelectionDAG;
1409 LoadSDNode(SDOperand Chain, SDOperand Ptr, SDOperand Off,
1410 ISD::MemIndexedMode AM, ISD::LoadExtType ETy, MVT::ValueType LVT,
1411 const Value *SV, int O=0, unsigned Align=1, bool Vol=false)
1412 : SDNode(ISD::LOAD, Chain, Ptr, Off),
1413 AddrMode(AM), ExtType(ETy), LoadedVT(LVT), SrcValue(SV), SVOffset(O),
1414 Alignment(Align), IsVolatile(Vol) {
1415 assert((Off.getOpcode() == ISD::UNDEF || AddrMode != ISD::UNINDEXED) &&
1416 "Only indexed load has a non-undef offset operand");
1420 const SDOperand getChain() const { return getOperand(0); }
1421 const SDOperand getBasePtr() const { return getOperand(1); }
1422 const SDOperand getOffset() const { return getOperand(2); }
1423 ISD::MemIndexedMode getAddressingMode() const { return AddrMode; }
1424 ISD::LoadExtType getExtensionType() const { return ExtType; }
1425 MVT::ValueType getLoadedVT() const { return LoadedVT; }
1426 const Value *getSrcValue() const { return SrcValue; }
1427 int getSrcValueOffset() const { return SVOffset; }
1428 unsigned getAlignment() const { return Alignment; }
1429 bool isVolatile() const { return IsVolatile; }
1431 static bool classof(const LoadSDNode *) { return true; }
1432 static bool classof(const SDNode *N) {
1433 return N->getOpcode() == ISD::LOAD;
1437 /// StoreSDNode - This class is used to represent ISD::STORE nodes.
1439 class StoreSDNode : public SDNode {
1440 // AddrMode - unindexed, pre-indexed, post-indexed.
1441 ISD::MemIndexedMode AddrMode;
1443 // IsTruncStore - True is the op does a truncation before store.
1446 // StoredVT - VT of the value after truncation.
1447 MVT::ValueType StoredVT;
1449 // SrcValue - Memory location for alias analysis.
1450 const Value *SrcValue;
1452 // SVOffset - Memory location offset.
1455 // Alignment - Alignment of memory location in bytes.
1458 // IsVolatile - True if the store is volatile.
1461 friend class SelectionDAG;
1462 StoreSDNode(SDOperand Chain, SDOperand Value, SDOperand Ptr, SDOperand Off,
1463 ISD::MemIndexedMode AM, bool isTrunc, MVT::ValueType SVT,
1464 const Value *SV, int O=0, unsigned Align=0, bool Vol=false)
1465 : SDNode(ISD::STORE, Chain, Value, Ptr, Off),
1466 AddrMode(AM), IsTruncStore(isTrunc), StoredVT(SVT), SrcValue(SV),
1467 SVOffset(O), Alignment(Align), IsVolatile(Vol) {
1468 assert((Off.getOpcode() == ISD::UNDEF || AddrMode != ISD::UNINDEXED) &&
1469 "Only indexed store has a non-undef offset operand");
1473 const SDOperand getChain() const { return getOperand(0); }
1474 const SDOperand getValue() const { return getOperand(1); }
1475 const SDOperand getBasePtr() const { return getOperand(2); }
1476 const SDOperand getOffset() const { return getOperand(3); }
1477 ISD::MemIndexedMode getAddressingMode() const { return AddrMode; }
1478 bool isTruncatingStore() const { return IsTruncStore; }
1479 MVT::ValueType getStoredVT() const { return StoredVT; }
1480 const Value *getSrcValue() const { return SrcValue; }
1481 int getSrcValueOffset() const { return SVOffset; }
1482 unsigned getAlignment() const { return Alignment; }
1483 bool isVolatile() const { return IsVolatile; }
1485 static bool classof(const StoreSDNode *) { return true; }
1486 static bool classof(const SDNode *N) {
1487 return N->getOpcode() == ISD::STORE;
1492 class SDNodeIterator : public forward_iterator<SDNode, ptrdiff_t> {
1496 SDNodeIterator(SDNode *N, unsigned Op) : Node(N), Operand(Op) {}
1498 bool operator==(const SDNodeIterator& x) const {
1499 return Operand == x.Operand;
1501 bool operator!=(const SDNodeIterator& x) const { return !operator==(x); }
1503 const SDNodeIterator &operator=(const SDNodeIterator &I) {
1504 assert(I.Node == Node && "Cannot assign iterators to two different nodes!");
1505 Operand = I.Operand;
1509 pointer operator*() const {
1510 return Node->getOperand(Operand).Val;
1512 pointer operator->() const { return operator*(); }
1514 SDNodeIterator& operator++() { // Preincrement
1518 SDNodeIterator operator++(int) { // Postincrement
1519 SDNodeIterator tmp = *this; ++*this; return tmp;
1522 static SDNodeIterator begin(SDNode *N) { return SDNodeIterator(N, 0); }
1523 static SDNodeIterator end (SDNode *N) {
1524 return SDNodeIterator(N, N->getNumOperands());
1527 unsigned getOperand() const { return Operand; }
1528 const SDNode *getNode() const { return Node; }
1531 template <> struct GraphTraits<SDNode*> {
1532 typedef SDNode NodeType;
1533 typedef SDNodeIterator ChildIteratorType;
1534 static inline NodeType *getEntryNode(SDNode *N) { return N; }
1535 static inline ChildIteratorType child_begin(NodeType *N) {
1536 return SDNodeIterator::begin(N);
1538 static inline ChildIteratorType child_end(NodeType *N) {
1539 return SDNodeIterator::end(N);
1544 struct ilist_traits<SDNode> {
1545 static SDNode *getPrev(const SDNode *N) { return N->Prev; }
1546 static SDNode *getNext(const SDNode *N) { return N->Next; }
1548 static void setPrev(SDNode *N, SDNode *Prev) { N->Prev = Prev; }
1549 static void setNext(SDNode *N, SDNode *Next) { N->Next = Next; }
1551 static SDNode *createSentinel() {
1552 return new SDNode(ISD::EntryToken, MVT::Other);
1554 static void destroySentinel(SDNode *N) { delete N; }
1555 //static SDNode *createNode(const SDNode &V) { return new SDNode(V); }
1558 void addNodeToList(SDNode *NTy) {}
1559 void removeNodeFromList(SDNode *NTy) {}
1560 void transferNodesFromList(iplist<SDNode, ilist_traits> &L2,
1561 const ilist_iterator<SDNode> &X,
1562 const ilist_iterator<SDNode> &Y) {}
1566 /// isNON_EXTLoad - Returns true if the specified node is a non-extending
1568 inline bool isNON_EXTLoad(const SDNode *N) {
1569 return N->getOpcode() == ISD::LOAD &&
1570 cast<LoadSDNode>(N)->getExtensionType() == ISD::NON_EXTLOAD;
1573 /// isEXTLoad - Returns true if the specified node is a EXTLOAD.
1575 inline bool isEXTLoad(const SDNode *N) {
1576 return N->getOpcode() == ISD::LOAD &&
1577 cast<LoadSDNode>(N)->getExtensionType() == ISD::EXTLOAD;
1580 /// isSEXTLoad - Returns true if the specified node is a SEXTLOAD.
1582 inline bool isSEXTLoad(const SDNode *N) {
1583 return N->getOpcode() == ISD::LOAD &&
1584 cast<LoadSDNode>(N)->getExtensionType() == ISD::SEXTLOAD;
1587 /// isZEXTLoad - Returns true if the specified node is a ZEXTLOAD.
1589 inline bool isZEXTLoad(const SDNode *N) {
1590 return N->getOpcode() == ISD::LOAD &&
1591 cast<LoadSDNode>(N)->getExtensionType() == ISD::ZEXTLOAD;
1594 /// isNON_TRUNCStore - Returns true if the specified node is a non-truncating
1596 inline bool isNON_TRUNCStore(const SDNode *N) {
1597 return N->getOpcode() == ISD::STORE &&
1598 !cast<StoreSDNode>(N)->isTruncatingStore();
1601 /// isTRUNCStore - Returns true if the specified node is a truncating
1603 inline bool isTRUNCStore(const SDNode *N) {
1604 return N->getOpcode() == ISD::STORE &&
1605 cast<StoreSDNode>(N)->isTruncatingStore();
1610 } // end llvm namespace