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 // STACKSAVE - STACKSAVE has one operand, an input chain. It produces a
441 // value, the same type as the pointer type for the system, and an output
445 // STACKRESTORE has two operands, an input chain and a pointer to restore to
446 // it returns an output chain.
449 // MEMSET/MEMCPY/MEMMOVE - The first operand is the chain, and the rest
450 // correspond to the operands of the LLVM intrinsic functions. The only
451 // result is a token chain. The alignment argument is guaranteed to be a
457 // CALLSEQ_START/CALLSEQ_END - These operators mark the beginning and end of
458 // a call sequence, and carry arbitrary information that target might want
459 // to know. The first operand is a chain, the rest are specified by the
460 // target and not touched by the DAG optimizers.
461 CALLSEQ_START, // Beginning of a call sequence
462 CALLSEQ_END, // End of a call sequence
464 // VAARG - VAARG has three operands: an input chain, a pointer, and a
465 // SRCVALUE. It returns a pair of values: the vaarg value and a new chain.
468 // VACOPY - VACOPY has five operands: an input chain, a destination pointer,
469 // a source pointer, a SRCVALUE for the destination, and a SRCVALUE for the
473 // VAEND, VASTART - VAEND and VASTART have three operands: an input chain, a
474 // pointer, and a SRCVALUE.
477 // SRCVALUE - This corresponds to a Value*, and is used to associate memory
478 // locations with their value. This allows one use alias analysis
479 // information in the backend.
482 // PCMARKER - This corresponds to the pcmarker intrinsic.
485 // READCYCLECOUNTER - This corresponds to the readcyclecounter intrinsic.
486 // The only operand is a chain and a value and a chain are produced. The
487 // value is the contents of the architecture specific cycle counter like
488 // register (or other high accuracy low latency clock source)
491 // HANDLENODE node - Used as a handle for various purposes.
494 // LOCATION - This node is used to represent a source location for debug
495 // info. It takes token chain as input, then a line number, then a column
496 // number, then a filename, then a working dir. It produces a token chain
500 // DEBUG_LOC - This node is used to represent source line information
501 // embedded in the code. It takes a token chain as input, then a line
502 // number, then a column then a file id (provided by MachineDebugInfo.) It
503 // produces a token chain as output.
506 // DEBUG_LABEL - This node is used to mark a location in the code where a
507 // label should be generated for use by the debug information. It takes a
508 // token chain as input and then a unique id (provided by MachineDebugInfo.)
509 // It produces a token chain as output.
512 // BUILTIN_OP_END - This must be the last enum value in this list.
518 /// isBuildVectorAllOnes - Return true if the specified node is a
519 /// BUILD_VECTOR where all of the elements are ~0 or undef.
520 bool isBuildVectorAllOnes(const SDNode *N);
522 /// isBuildVectorAllZeros - Return true if the specified node is a
523 /// BUILD_VECTOR where all of the elements are 0 or undef.
524 bool isBuildVectorAllZeros(const SDNode *N);
526 //===--------------------------------------------------------------------===//
527 /// MemIndexedMode enum - This enum defines the load / store indexed
528 /// addressing modes.
530 /// UNINDEXED "Normal" load / store. The effective address is already
531 /// computed and is available in the base pointer. The offset
532 /// operand is always undefined. In addition to producing a
533 /// chain, an unindexed load produces one value (result of the
534 /// load); an unindexed store does not produces a value.
536 /// PRE_INC Similar to the unindexed mode where the effective address is
537 /// PRE_DEC the value of the base pointer add / subtract the offset.
538 /// It considers the computation as being folded into the load /
539 /// store operation (i.e. the load / store does the address
540 /// computation as well as performing the memory transaction).
541 /// The base operand is always undefined. In addition to
542 /// producing a chain, pre-indexed load produces two values
543 /// (result of the load and the result of the address
544 /// computation); a pre-indexed store produces one value (result
545 /// of the address computation).
547 /// POST_INC The effective address is the value of the base pointer. The
548 /// POST_DEC value of the offset operand is then added to / subtracted
549 /// from the base after memory transaction. In addition to
550 /// producing a chain, post-indexed load produces two values
551 /// (the result of the load and the result of the base +/- offset
552 /// computation); a post-indexed store produces one value (the
553 /// the result of the base +/- offset computation).
555 enum MemIndexedMode {
564 //===--------------------------------------------------------------------===//
565 /// LoadExtType enum - This enum defines the three variants of LOADEXT
566 /// (load with extension).
568 /// SEXTLOAD loads the integer operand and sign extends it to a larger
569 /// integer result type.
570 /// ZEXTLOAD loads the integer operand and zero extends it to a larger
571 /// integer result type.
572 /// EXTLOAD is used for three things: floating point extending loads,
573 /// integer extending loads [the top bits are undefined], and vector
574 /// extending loads [load into low elt].
584 //===--------------------------------------------------------------------===//
585 /// ISD::CondCode enum - These are ordered carefully to make the bitfields
586 /// below work out, when considering SETFALSE (something that never exists
587 /// dynamically) as 0. "U" -> Unsigned (for integer operands) or Unordered
588 /// (for floating point), "L" -> Less than, "G" -> Greater than, "E" -> Equal
589 /// to. If the "N" column is 1, the result of the comparison is undefined if
590 /// the input is a NAN.
592 /// All of these (except for the 'always folded ops') should be handled for
593 /// floating point. For integer, only the SETEQ,SETNE,SETLT,SETLE,SETGT,
594 /// SETGE,SETULT,SETULE,SETUGT, and SETUGE opcodes are used.
596 /// Note that these are laid out in a specific order to allow bit-twiddling
597 /// to transform conditions.
599 // Opcode N U L G E Intuitive operation
600 SETFALSE, // 0 0 0 0 Always false (always folded)
601 SETOEQ, // 0 0 0 1 True if ordered and equal
602 SETOGT, // 0 0 1 0 True if ordered and greater than
603 SETOGE, // 0 0 1 1 True if ordered and greater than or equal
604 SETOLT, // 0 1 0 0 True if ordered and less than
605 SETOLE, // 0 1 0 1 True if ordered and less than or equal
606 SETONE, // 0 1 1 0 True if ordered and operands are unequal
607 SETO, // 0 1 1 1 True if ordered (no nans)
608 SETUO, // 1 0 0 0 True if unordered: isnan(X) | isnan(Y)
609 SETUEQ, // 1 0 0 1 True if unordered or equal
610 SETUGT, // 1 0 1 0 True if unordered or greater than
611 SETUGE, // 1 0 1 1 True if unordered, greater than, or equal
612 SETULT, // 1 1 0 0 True if unordered or less than
613 SETULE, // 1 1 0 1 True if unordered, less than, or equal
614 SETUNE, // 1 1 1 0 True if unordered or not equal
615 SETTRUE, // 1 1 1 1 Always true (always folded)
616 // Don't care operations: undefined if the input is a nan.
617 SETFALSE2, // 1 X 0 0 0 Always false (always folded)
618 SETEQ, // 1 X 0 0 1 True if equal
619 SETGT, // 1 X 0 1 0 True if greater than
620 SETGE, // 1 X 0 1 1 True if greater than or equal
621 SETLT, // 1 X 1 0 0 True if less than
622 SETLE, // 1 X 1 0 1 True if less than or equal
623 SETNE, // 1 X 1 1 0 True if not equal
624 SETTRUE2, // 1 X 1 1 1 Always true (always folded)
626 SETCC_INVALID // Marker value.
629 /// isSignedIntSetCC - Return true if this is a setcc instruction that
630 /// performs a signed comparison when used with integer operands.
631 inline bool isSignedIntSetCC(CondCode Code) {
632 return Code == SETGT || Code == SETGE || Code == SETLT || Code == SETLE;
635 /// isUnsignedIntSetCC - Return true if this is a setcc instruction that
636 /// performs an unsigned comparison when used with integer operands.
637 inline bool isUnsignedIntSetCC(CondCode Code) {
638 return Code == SETUGT || Code == SETUGE || Code == SETULT || Code == SETULE;
641 /// isTrueWhenEqual - Return true if the specified condition returns true if
642 /// the two operands to the condition are equal. Note that if one of the two
643 /// operands is a NaN, this value is meaningless.
644 inline bool isTrueWhenEqual(CondCode Cond) {
645 return ((int)Cond & 1) != 0;
648 /// getUnorderedFlavor - This function returns 0 if the condition is always
649 /// false if an operand is a NaN, 1 if the condition is always true if the
650 /// operand is a NaN, and 2 if the condition is undefined if the operand is a
652 inline unsigned getUnorderedFlavor(CondCode Cond) {
653 return ((int)Cond >> 3) & 3;
656 /// getSetCCInverse - Return the operation corresponding to !(X op Y), where
657 /// 'op' is a valid SetCC operation.
658 CondCode getSetCCInverse(CondCode Operation, bool isInteger);
660 /// getSetCCSwappedOperands - Return the operation corresponding to (Y op X)
661 /// when given the operation for (X op Y).
662 CondCode getSetCCSwappedOperands(CondCode Operation);
664 /// getSetCCOrOperation - Return the result of a logical OR between different
665 /// comparisons of identical values: ((X op1 Y) | (X op2 Y)). This
666 /// function returns SETCC_INVALID if it is not possible to represent the
667 /// resultant comparison.
668 CondCode getSetCCOrOperation(CondCode Op1, CondCode Op2, bool isInteger);
670 /// getSetCCAndOperation - Return the result of a logical AND between
671 /// different comparisons of identical values: ((X op1 Y) & (X op2 Y)). This
672 /// function returns SETCC_INVALID if it is not possible to represent the
673 /// resultant comparison.
674 CondCode getSetCCAndOperation(CondCode Op1, CondCode Op2, bool isInteger);
675 } // end llvm::ISD namespace
678 //===----------------------------------------------------------------------===//
679 /// SDOperand - Unlike LLVM values, Selection DAG nodes may return multiple
680 /// values as the result of a computation. Many nodes return multiple values,
681 /// from loads (which define a token and a return value) to ADDC (which returns
682 /// a result and a carry value), to calls (which may return an arbitrary number
685 /// As such, each use of a SelectionDAG computation must indicate the node that
686 /// computes it as well as which return value to use from that node. This pair
687 /// of information is represented with the SDOperand value type.
691 SDNode *Val; // The node defining the value we are using.
692 unsigned ResNo; // Which return value of the node we are using.
694 SDOperand() : Val(0), ResNo(0) {}
695 SDOperand(SDNode *val, unsigned resno) : Val(val), ResNo(resno) {}
697 bool operator==(const SDOperand &O) const {
698 return Val == O.Val && ResNo == O.ResNo;
700 bool operator!=(const SDOperand &O) const {
701 return !operator==(O);
703 bool operator<(const SDOperand &O) const {
704 return Val < O.Val || (Val == O.Val && ResNo < O.ResNo);
707 SDOperand getValue(unsigned R) const {
708 return SDOperand(Val, R);
711 // isOperand - Return true if this node is an operand of N.
712 bool isOperand(SDNode *N) const;
714 /// getValueType - Return the ValueType of the referenced return value.
716 inline MVT::ValueType getValueType() const;
718 // Forwarding methods - These forward to the corresponding methods in SDNode.
719 inline unsigned getOpcode() const;
720 inline unsigned getNumOperands() const;
721 inline const SDOperand &getOperand(unsigned i) const;
722 inline uint64_t getConstantOperandVal(unsigned i) const;
723 inline bool isTargetOpcode() const;
724 inline unsigned getTargetOpcode() const;
726 /// hasOneUse - Return true if there is exactly one operation using this
727 /// result value of the defining operator.
728 inline bool hasOneUse() const;
732 /// simplify_type specializations - Allow casting operators to work directly on
733 /// SDOperands as if they were SDNode*'s.
734 template<> struct simplify_type<SDOperand> {
735 typedef SDNode* SimpleType;
736 static SimpleType getSimplifiedValue(const SDOperand &Val) {
737 return static_cast<SimpleType>(Val.Val);
740 template<> struct simplify_type<const SDOperand> {
741 typedef SDNode* SimpleType;
742 static SimpleType getSimplifiedValue(const SDOperand &Val) {
743 return static_cast<SimpleType>(Val.Val);
748 /// SDNode - Represents one node in the SelectionDAG.
750 class SDNode : public FoldingSetNode {
751 /// NodeType - The operation that this node performs.
753 unsigned short NodeType;
755 /// NodeId - Unique id per SDNode in the DAG.
758 /// OperandList - The values that are used by this operation.
760 SDOperand *OperandList;
762 /// ValueList - The types of the values this node defines. SDNode's may
763 /// define multiple values simultaneously.
764 const MVT::ValueType *ValueList;
766 /// NumOperands/NumValues - The number of entries in the Operand/Value list.
767 unsigned short NumOperands, NumValues;
769 /// Prev/Next pointers - These pointers form the linked list of of the
770 /// AllNodes list in the current DAG.
772 friend struct ilist_traits<SDNode>;
774 /// Uses - These are all of the SDNode's that use a value produced by this
776 SmallVector<SDNode*,3> Uses;
778 // Out-of-line virtual method to give class a home.
779 virtual void ANCHOR();
782 assert(NumOperands == 0 && "Operand list not cleared before deletion");
783 NodeType = ISD::DELETED_NODE;
786 //===--------------------------------------------------------------------===//
789 unsigned getOpcode() const { return NodeType; }
790 bool isTargetOpcode() const { return NodeType >= ISD::BUILTIN_OP_END; }
791 unsigned getTargetOpcode() const {
792 assert(isTargetOpcode() && "Not a target opcode!");
793 return NodeType - ISD::BUILTIN_OP_END;
796 size_t use_size() const { return Uses.size(); }
797 bool use_empty() const { return Uses.empty(); }
798 bool hasOneUse() const { return Uses.size() == 1; }
800 /// getNodeId - Return the unique node id.
802 int getNodeId() const { return NodeId; }
804 typedef SmallVector<SDNode*,3>::const_iterator use_iterator;
805 use_iterator use_begin() const { return Uses.begin(); }
806 use_iterator use_end() const { return Uses.end(); }
808 /// hasNUsesOfValue - Return true if there are exactly NUSES uses of the
809 /// indicated value. This method ignores uses of other values defined by this
811 bool hasNUsesOfValue(unsigned NUses, unsigned Value) const;
813 /// isOnlyUse - Return true if this node is the only use of N.
815 bool isOnlyUse(SDNode *N) const;
817 /// isOperand - Return true if this node is an operand of N.
819 bool isOperand(SDNode *N) const;
821 /// isPredecessor - Return true if this node is a predecessor of N. This node
822 /// is either an operand of N or it can be reached by recursively traversing
824 /// NOTE: this is an expensive method. Use it carefully.
825 bool isPredecessor(SDNode *N) const;
827 /// getNumOperands - Return the number of values used by this operation.
829 unsigned getNumOperands() const { return NumOperands; }
831 /// getConstantOperandVal - Helper method returns the integer value of a
832 /// ConstantSDNode operand.
833 uint64_t getConstantOperandVal(unsigned Num) const;
835 const SDOperand &getOperand(unsigned Num) const {
836 assert(Num < NumOperands && "Invalid child # of SDNode!");
837 return OperandList[Num];
840 typedef const SDOperand* op_iterator;
841 op_iterator op_begin() const { return OperandList; }
842 op_iterator op_end() const { return OperandList+NumOperands; }
845 SDVTList getVTList() const {
846 SDVTList X = { ValueList, NumValues };
850 /// getNumValues - Return the number of values defined/returned by this
853 unsigned getNumValues() const { return NumValues; }
855 /// getValueType - Return the type of a specified result.
857 MVT::ValueType getValueType(unsigned ResNo) const {
858 assert(ResNo < NumValues && "Illegal result number!");
859 return ValueList[ResNo];
862 typedef const MVT::ValueType* value_iterator;
863 value_iterator value_begin() const { return ValueList; }
864 value_iterator value_end() const { return ValueList+NumValues; }
866 /// getOperationName - Return the opcode of this operation for printing.
868 const char* getOperationName(const SelectionDAG *G = 0) const;
869 static const char* getIndexedModeName(ISD::MemIndexedMode AM);
871 void dump(const SelectionDAG *G) const;
873 static bool classof(const SDNode *) { return true; }
875 /// Profile - Gather unique data for the node.
877 void Profile(FoldingSetNodeID &ID);
880 friend class SelectionDAG;
882 /// getValueTypeList - Return a pointer to the specified value type.
884 static MVT::ValueType *getValueTypeList(MVT::ValueType VT);
886 SDNode(unsigned NT, MVT::ValueType VT) : NodeType(NT), NodeId(-1) {
887 OperandList = 0; NumOperands = 0;
888 ValueList = getValueTypeList(VT);
892 SDNode(unsigned NT, SDOperand Op)
893 : NodeType(NT), NodeId(-1) {
894 OperandList = new SDOperand[1];
897 Op.Val->Uses.push_back(this);
902 SDNode(unsigned NT, SDOperand N1, SDOperand N2)
903 : NodeType(NT), NodeId(-1) {
904 OperandList = new SDOperand[2];
908 N1.Val->Uses.push_back(this); N2.Val->Uses.push_back(this);
913 SDNode(unsigned NT, SDOperand N1, SDOperand N2, SDOperand N3)
914 : NodeType(NT), NodeId(-1) {
915 OperandList = new SDOperand[3];
921 N1.Val->Uses.push_back(this); N2.Val->Uses.push_back(this);
922 N3.Val->Uses.push_back(this);
927 SDNode(unsigned NT, SDOperand N1, SDOperand N2, SDOperand N3, SDOperand N4)
928 : NodeType(NT), NodeId(-1) {
929 OperandList = new SDOperand[4];
936 N1.Val->Uses.push_back(this); N2.Val->Uses.push_back(this);
937 N3.Val->Uses.push_back(this); N4.Val->Uses.push_back(this);
942 SDNode(unsigned Opc, const SDOperand *Ops, unsigned NumOps)
943 : NodeType(Opc), NodeId(-1) {
944 NumOperands = NumOps;
945 OperandList = new SDOperand[NumOperands];
947 for (unsigned i = 0, e = NumOps; i != e; ++i) {
948 OperandList[i] = Ops[i];
949 SDNode *N = OperandList[i].Val;
950 N->Uses.push_back(this);
957 /// MorphNodeTo - This clears the return value and operands list, and sets the
958 /// opcode of the node to the specified value. This should only be used by
959 /// the SelectionDAG class.
960 void MorphNodeTo(unsigned Opc) {
965 // Clear the operands list, updating used nodes to remove this from their
967 for (op_iterator I = op_begin(), E = op_end(); I != E; ++I)
968 I->Val->removeUser(this);
969 delete [] OperandList;
974 void setValueTypes(SDVTList L) {
975 assert(NumValues == 0 && "Should not have values yet!");
977 NumValues = L.NumVTs;
980 void setOperands(SDOperand Op0) {
981 assert(NumOperands == 0 && "Should not have operands yet!");
982 OperandList = new SDOperand[1];
983 OperandList[0] = Op0;
985 Op0.Val->Uses.push_back(this);
987 void setOperands(SDOperand Op0, SDOperand Op1) {
988 assert(NumOperands == 0 && "Should not have operands yet!");
989 OperandList = new SDOperand[2];
990 OperandList[0] = Op0;
991 OperandList[1] = Op1;
993 Op0.Val->Uses.push_back(this); Op1.Val->Uses.push_back(this);
995 void setOperands(SDOperand Op0, SDOperand Op1, SDOperand Op2) {
996 assert(NumOperands == 0 && "Should not have operands yet!");
997 OperandList = new SDOperand[3];
998 OperandList[0] = Op0;
999 OperandList[1] = Op1;
1000 OperandList[2] = Op2;
1002 Op0.Val->Uses.push_back(this); Op1.Val->Uses.push_back(this);
1003 Op2.Val->Uses.push_back(this);
1005 void setOperands(const SDOperand *Ops, unsigned NumOps) {
1006 assert(NumOperands == 0 && "Should not have operands yet!");
1007 NumOperands = NumOps;
1008 OperandList = new SDOperand[NumOperands];
1010 for (unsigned i = 0, e = NumOps; i != e; ++i) {
1011 OperandList[i] = Ops[i];
1012 SDNode *N = OperandList[i].Val;
1013 N->Uses.push_back(this);
1017 void addUser(SDNode *User) {
1018 Uses.push_back(User);
1020 void removeUser(SDNode *User) {
1021 // Remove this user from the operand's use list.
1022 for (unsigned i = Uses.size(); ; --i) {
1023 assert(i != 0 && "Didn't find user!");
1024 if (Uses[i-1] == User) {
1025 Uses[i-1] = Uses.back();
1032 void setNodeId(int Id) {
1038 // Define inline functions from the SDOperand class.
1040 inline unsigned SDOperand::getOpcode() const {
1041 return Val->getOpcode();
1043 inline MVT::ValueType SDOperand::getValueType() const {
1044 return Val->getValueType(ResNo);
1046 inline unsigned SDOperand::getNumOperands() const {
1047 return Val->getNumOperands();
1049 inline const SDOperand &SDOperand::getOperand(unsigned i) const {
1050 return Val->getOperand(i);
1052 inline uint64_t SDOperand::getConstantOperandVal(unsigned i) const {
1053 return Val->getConstantOperandVal(i);
1055 inline bool SDOperand::isTargetOpcode() const {
1056 return Val->isTargetOpcode();
1058 inline unsigned SDOperand::getTargetOpcode() const {
1059 return Val->getTargetOpcode();
1061 inline bool SDOperand::hasOneUse() const {
1062 return Val->hasNUsesOfValue(1, ResNo);
1065 /// HandleSDNode - This class is used to form a handle around another node that
1066 /// is persistant and is updated across invocations of replaceAllUsesWith on its
1067 /// operand. This node should be directly created by end-users and not added to
1068 /// the AllNodes list.
1069 class HandleSDNode : public SDNode {
1071 HandleSDNode(SDOperand X) : SDNode(ISD::HANDLENODE, X) {}
1073 MorphNodeTo(ISD::HANDLENODE); // Drops operand uses.
1076 SDOperand getValue() const { return getOperand(0); }
1079 class StringSDNode : public SDNode {
1082 friend class SelectionDAG;
1083 StringSDNode(const std::string &val)
1084 : SDNode(ISD::STRING, MVT::Other), Value(val) {
1087 const std::string &getValue() const { return Value; }
1088 static bool classof(const StringSDNode *) { return true; }
1089 static bool classof(const SDNode *N) {
1090 return N->getOpcode() == ISD::STRING;
1094 class ConstantSDNode : public SDNode {
1097 friend class SelectionDAG;
1098 ConstantSDNode(bool isTarget, uint64_t val, MVT::ValueType VT)
1099 : SDNode(isTarget ? ISD::TargetConstant : ISD::Constant, VT), Value(val) {
1103 uint64_t getValue() const { return Value; }
1105 int64_t getSignExtended() const {
1106 unsigned Bits = MVT::getSizeInBits(getValueType(0));
1107 return ((int64_t)Value << (64-Bits)) >> (64-Bits);
1110 bool isNullValue() const { return Value == 0; }
1111 bool isAllOnesValue() const {
1112 return Value == MVT::getIntVTBitMask(getValueType(0));
1115 static bool classof(const ConstantSDNode *) { return true; }
1116 static bool classof(const SDNode *N) {
1117 return N->getOpcode() == ISD::Constant ||
1118 N->getOpcode() == ISD::TargetConstant;
1122 class ConstantFPSDNode : public SDNode {
1125 friend class SelectionDAG;
1126 ConstantFPSDNode(bool isTarget, double val, MVT::ValueType VT)
1127 : SDNode(isTarget ? ISD::TargetConstantFP : ISD::ConstantFP, VT),
1132 double getValue() const { return Value; }
1134 /// isExactlyValue - We don't rely on operator== working on double values, as
1135 /// it returns true for things that are clearly not equal, like -0.0 and 0.0.
1136 /// As such, this method can be used to do an exact bit-for-bit comparison of
1137 /// two floating point values.
1138 bool isExactlyValue(double V) const;
1140 static bool classof(const ConstantFPSDNode *) { return true; }
1141 static bool classof(const SDNode *N) {
1142 return N->getOpcode() == ISD::ConstantFP ||
1143 N->getOpcode() == ISD::TargetConstantFP;
1147 class GlobalAddressSDNode : public SDNode {
1148 GlobalValue *TheGlobal;
1151 friend class SelectionDAG;
1152 GlobalAddressSDNode(bool isTarget, const GlobalValue *GA, MVT::ValueType VT,
1154 : SDNode(isTarget ? ISD::TargetGlobalAddress : ISD::GlobalAddress, VT),
1156 TheGlobal = const_cast<GlobalValue*>(GA);
1160 GlobalValue *getGlobal() const { return TheGlobal; }
1161 int getOffset() const { return Offset; }
1163 static bool classof(const GlobalAddressSDNode *) { return true; }
1164 static bool classof(const SDNode *N) {
1165 return N->getOpcode() == ISD::GlobalAddress ||
1166 N->getOpcode() == ISD::TargetGlobalAddress;
1171 class FrameIndexSDNode : public SDNode {
1174 friend class SelectionDAG;
1175 FrameIndexSDNode(int fi, MVT::ValueType VT, bool isTarg)
1176 : SDNode(isTarg ? ISD::TargetFrameIndex : ISD::FrameIndex, VT), FI(fi) {}
1179 int getIndex() const { return FI; }
1181 static bool classof(const FrameIndexSDNode *) { return true; }
1182 static bool classof(const SDNode *N) {
1183 return N->getOpcode() == ISD::FrameIndex ||
1184 N->getOpcode() == ISD::TargetFrameIndex;
1188 class JumpTableSDNode : public SDNode {
1191 friend class SelectionDAG;
1192 JumpTableSDNode(int jti, MVT::ValueType VT, bool isTarg)
1193 : SDNode(isTarg ? ISD::TargetJumpTable : ISD::JumpTable, VT),
1197 int getIndex() const { return JTI; }
1199 static bool classof(const JumpTableSDNode *) { return true; }
1200 static bool classof(const SDNode *N) {
1201 return N->getOpcode() == ISD::JumpTable ||
1202 N->getOpcode() == ISD::TargetJumpTable;
1206 class ConstantPoolSDNode : public SDNode {
1209 MachineConstantPoolValue *MachineCPVal;
1211 int Offset; // It's a MachineConstantPoolValue if top bit is set.
1214 friend class SelectionDAG;
1215 ConstantPoolSDNode(bool isTarget, Constant *c, MVT::ValueType VT,
1217 : SDNode(isTarget ? ISD::TargetConstantPool : ISD::ConstantPool, VT),
1218 Offset(o), Alignment(0) {
1219 assert((int)Offset >= 0 && "Offset is too large");
1222 ConstantPoolSDNode(bool isTarget, Constant *c, MVT::ValueType VT, int o,
1224 : SDNode(isTarget ? ISD::TargetConstantPool : ISD::ConstantPool, VT),
1225 Offset(o), Alignment(Align) {
1226 assert((int)Offset >= 0 && "Offset is too large");
1229 ConstantPoolSDNode(bool isTarget, MachineConstantPoolValue *v,
1230 MVT::ValueType VT, int o=0)
1231 : SDNode(isTarget ? ISD::TargetConstantPool : ISD::ConstantPool, VT),
1232 Offset(o), Alignment(0) {
1233 assert((int)Offset >= 0 && "Offset is too large");
1234 Val.MachineCPVal = v;
1235 Offset |= 1 << (sizeof(unsigned)*8-1);
1237 ConstantPoolSDNode(bool isTarget, MachineConstantPoolValue *v,
1238 MVT::ValueType VT, int o, unsigned Align)
1239 : SDNode(isTarget ? ISD::TargetConstantPool : ISD::ConstantPool, VT),
1240 Offset(o), Alignment(Align) {
1241 assert((int)Offset >= 0 && "Offset is too large");
1242 Val.MachineCPVal = v;
1243 Offset |= 1 << (sizeof(unsigned)*8-1);
1247 bool isMachineConstantPoolEntry() const {
1248 return (int)Offset < 0;
1251 Constant *getConstVal() const {
1252 assert(!isMachineConstantPoolEntry() && "Wrong constantpool type");
1253 return Val.ConstVal;
1256 MachineConstantPoolValue *getMachineCPVal() const {
1257 assert(isMachineConstantPoolEntry() && "Wrong constantpool type");
1258 return Val.MachineCPVal;
1261 int getOffset() const {
1262 return Offset & ~(1 << (sizeof(unsigned)*8-1));
1265 // Return the alignment of this constant pool object, which is either 0 (for
1266 // default alignment) or log2 of the desired value.
1267 unsigned getAlignment() const { return Alignment; }
1269 const Type *getType() const;
1271 static bool classof(const ConstantPoolSDNode *) { return true; }
1272 static bool classof(const SDNode *N) {
1273 return N->getOpcode() == ISD::ConstantPool ||
1274 N->getOpcode() == ISD::TargetConstantPool;
1278 class BasicBlockSDNode : public SDNode {
1279 MachineBasicBlock *MBB;
1281 friend class SelectionDAG;
1282 BasicBlockSDNode(MachineBasicBlock *mbb)
1283 : SDNode(ISD::BasicBlock, MVT::Other), MBB(mbb) {}
1286 MachineBasicBlock *getBasicBlock() const { return MBB; }
1288 static bool classof(const BasicBlockSDNode *) { return true; }
1289 static bool classof(const SDNode *N) {
1290 return N->getOpcode() == ISD::BasicBlock;
1294 class SrcValueSDNode : public SDNode {
1298 friend class SelectionDAG;
1299 SrcValueSDNode(const Value* v, int o)
1300 : SDNode(ISD::SRCVALUE, MVT::Other), V(v), offset(o) {}
1303 const Value *getValue() const { return V; }
1304 int getOffset() const { return offset; }
1306 static bool classof(const SrcValueSDNode *) { return true; }
1307 static bool classof(const SDNode *N) {
1308 return N->getOpcode() == ISD::SRCVALUE;
1313 class RegisterSDNode : public SDNode {
1316 friend class SelectionDAG;
1317 RegisterSDNode(unsigned reg, MVT::ValueType VT)
1318 : SDNode(ISD::Register, VT), Reg(reg) {}
1321 unsigned getReg() const { return Reg; }
1323 static bool classof(const RegisterSDNode *) { return true; }
1324 static bool classof(const SDNode *N) {
1325 return N->getOpcode() == ISD::Register;
1329 class ExternalSymbolSDNode : public SDNode {
1332 friend class SelectionDAG;
1333 ExternalSymbolSDNode(bool isTarget, const char *Sym, MVT::ValueType VT)
1334 : SDNode(isTarget ? ISD::TargetExternalSymbol : ISD::ExternalSymbol, VT),
1339 const char *getSymbol() const { return Symbol; }
1341 static bool classof(const ExternalSymbolSDNode *) { return true; }
1342 static bool classof(const SDNode *N) {
1343 return N->getOpcode() == ISD::ExternalSymbol ||
1344 N->getOpcode() == ISD::TargetExternalSymbol;
1348 class CondCodeSDNode : public SDNode {
1349 ISD::CondCode Condition;
1351 friend class SelectionDAG;
1352 CondCodeSDNode(ISD::CondCode Cond)
1353 : SDNode(ISD::CONDCODE, MVT::Other), Condition(Cond) {
1357 ISD::CondCode get() const { return Condition; }
1359 static bool classof(const CondCodeSDNode *) { return true; }
1360 static bool classof(const SDNode *N) {
1361 return N->getOpcode() == ISD::CONDCODE;
1365 /// VTSDNode - This class is used to represent MVT::ValueType's, which are used
1366 /// to parameterize some operations.
1367 class VTSDNode : public SDNode {
1368 MVT::ValueType ValueType;
1370 friend class SelectionDAG;
1371 VTSDNode(MVT::ValueType VT)
1372 : SDNode(ISD::VALUETYPE, MVT::Other), ValueType(VT) {}
1375 MVT::ValueType getVT() const { return ValueType; }
1377 static bool classof(const VTSDNode *) { return true; }
1378 static bool classof(const SDNode *N) {
1379 return N->getOpcode() == ISD::VALUETYPE;
1383 /// LoadSDNode - This class is used to represent ISD::LOAD nodes.
1385 class LoadSDNode : public SDNode {
1386 // AddrMode - unindexed, pre-indexed, post-indexed.
1387 ISD::MemIndexedMode AddrMode;
1389 // ExtType - non-ext, anyext, sext, zext.
1390 ISD::LoadExtType ExtType;
1392 // LoadedVT - VT of loaded value before extension.
1393 MVT::ValueType LoadedVT;
1395 // SrcValue - Memory location for alias analysis.
1396 const Value *SrcValue;
1398 // SVOffset - Memory location offset.
1401 // Alignment - Alignment of memory location in bytes.
1404 // IsVolatile - True if the load is volatile.
1407 friend class SelectionDAG;
1408 LoadSDNode(SDOperand Chain, SDOperand Ptr, SDOperand Off,
1409 ISD::MemIndexedMode AM, ISD::LoadExtType ETy, MVT::ValueType LVT,
1410 const Value *SV, int O=0, unsigned Align=1, bool Vol=false)
1411 : SDNode(ISD::LOAD, Chain, Ptr, Off),
1412 AddrMode(AM), ExtType(ETy), LoadedVT(LVT), SrcValue(SV), SVOffset(O),
1413 Alignment(Align), IsVolatile(Vol) {
1414 assert((Off.getOpcode() == ISD::UNDEF || AddrMode != ISD::UNINDEXED) &&
1415 "Only indexed load has a non-undef offset operand");
1419 const SDOperand getChain() const { return getOperand(0); }
1420 const SDOperand getBasePtr() const { return getOperand(1); }
1421 const SDOperand getOffset() const { return getOperand(2); }
1422 ISD::MemIndexedMode getAddressingMode() const { return AddrMode; }
1423 ISD::LoadExtType getExtensionType() const { return ExtType; }
1424 MVT::ValueType getLoadedVT() const { return LoadedVT; }
1425 const Value *getSrcValue() const { return SrcValue; }
1426 int getSrcValueOffset() const { return SVOffset; }
1427 unsigned getAlignment() const { return Alignment; }
1428 bool isVolatile() const { return IsVolatile; }
1430 static bool classof(const LoadSDNode *) { return true; }
1431 static bool classof(const SDNode *N) {
1432 return N->getOpcode() == ISD::LOAD;
1436 /// StoreSDNode - This class is used to represent ISD::STORE nodes.
1438 class StoreSDNode : public SDNode {
1439 // AddrMode - unindexed, pre-indexed, post-indexed.
1440 ISD::MemIndexedMode AddrMode;
1442 // IsTruncStore - True is the op does a truncation before store.
1445 // StoredVT - VT of the value after truncation.
1446 MVT::ValueType StoredVT;
1448 // SrcValue - Memory location for alias analysis.
1449 const Value *SrcValue;
1451 // SVOffset - Memory location offset.
1454 // Alignment - Alignment of memory location in bytes.
1457 // IsVolatile - True if the store is volatile.
1460 friend class SelectionDAG;
1461 StoreSDNode(SDOperand Chain, SDOperand Value, SDOperand Ptr, SDOperand Off,
1462 ISD::MemIndexedMode AM, bool isTrunc, MVT::ValueType SVT,
1463 const Value *SV, int O=0, unsigned Align=0, bool Vol=false)
1464 : SDNode(ISD::STORE, Chain, Value, Ptr, Off),
1465 AddrMode(AM), IsTruncStore(isTrunc), StoredVT(SVT), SrcValue(SV),
1466 SVOffset(O), Alignment(Align), IsVolatile(Vol) {
1467 assert((Off.getOpcode() == ISD::UNDEF || AddrMode != ISD::UNINDEXED) &&
1468 "Only indexed store has a non-undef offset operand");
1472 const SDOperand getChain() const { return getOperand(0); }
1473 const SDOperand getValue() const { return getOperand(1); }
1474 const SDOperand getBasePtr() const { return getOperand(2); }
1475 const SDOperand getOffset() const { return getOperand(3); }
1476 ISD::MemIndexedMode getAddressingMode() const { return AddrMode; }
1477 bool isTruncatingStore() const { return IsTruncStore; }
1478 MVT::ValueType getStoredVT() const { return StoredVT; }
1479 const Value *getSrcValue() const { return SrcValue; }
1480 int getSrcValueOffset() const { return SVOffset; }
1481 unsigned getAlignment() const { return Alignment; }
1482 bool isVolatile() const { return IsVolatile; }
1484 static bool classof(const LoadSDNode *) { return true; }
1485 static bool classof(const SDNode *N) {
1486 return N->getOpcode() == ISD::STORE;
1491 class SDNodeIterator : public forward_iterator<SDNode, ptrdiff_t> {
1495 SDNodeIterator(SDNode *N, unsigned Op) : Node(N), Operand(Op) {}
1497 bool operator==(const SDNodeIterator& x) const {
1498 return Operand == x.Operand;
1500 bool operator!=(const SDNodeIterator& x) const { return !operator==(x); }
1502 const SDNodeIterator &operator=(const SDNodeIterator &I) {
1503 assert(I.Node == Node && "Cannot assign iterators to two different nodes!");
1504 Operand = I.Operand;
1508 pointer operator*() const {
1509 return Node->getOperand(Operand).Val;
1511 pointer operator->() const { return operator*(); }
1513 SDNodeIterator& operator++() { // Preincrement
1517 SDNodeIterator operator++(int) { // Postincrement
1518 SDNodeIterator tmp = *this; ++*this; return tmp;
1521 static SDNodeIterator begin(SDNode *N) { return SDNodeIterator(N, 0); }
1522 static SDNodeIterator end (SDNode *N) {
1523 return SDNodeIterator(N, N->getNumOperands());
1526 unsigned getOperand() const { return Operand; }
1527 const SDNode *getNode() const { return Node; }
1530 template <> struct GraphTraits<SDNode*> {
1531 typedef SDNode NodeType;
1532 typedef SDNodeIterator ChildIteratorType;
1533 static inline NodeType *getEntryNode(SDNode *N) { return N; }
1534 static inline ChildIteratorType child_begin(NodeType *N) {
1535 return SDNodeIterator::begin(N);
1537 static inline ChildIteratorType child_end(NodeType *N) {
1538 return SDNodeIterator::end(N);
1543 struct ilist_traits<SDNode> {
1544 static SDNode *getPrev(const SDNode *N) { return N->Prev; }
1545 static SDNode *getNext(const SDNode *N) { return N->Next; }
1547 static void setPrev(SDNode *N, SDNode *Prev) { N->Prev = Prev; }
1548 static void setNext(SDNode *N, SDNode *Next) { N->Next = Next; }
1550 static SDNode *createSentinel() {
1551 return new SDNode(ISD::EntryToken, MVT::Other);
1553 static void destroySentinel(SDNode *N) { delete N; }
1554 //static SDNode *createNode(const SDNode &V) { return new SDNode(V); }
1557 void addNodeToList(SDNode *NTy) {}
1558 void removeNodeFromList(SDNode *NTy) {}
1559 void transferNodesFromList(iplist<SDNode, ilist_traits> &L2,
1560 const ilist_iterator<SDNode> &X,
1561 const ilist_iterator<SDNode> &Y) {}
1565 /// isNON_EXTLoad - Returns true if the specified node is a non-extending
1567 inline bool isNON_EXTLoad(const SDNode *N) {
1568 return N->getOpcode() == ISD::LOAD &&
1569 cast<LoadSDNode>(N)->getExtensionType() == ISD::NON_EXTLOAD;
1572 /// isEXTLoad - Returns true if the specified node is a EXTLOAD.
1574 inline bool isEXTLoad(const SDNode *N) {
1575 return N->getOpcode() == ISD::LOAD &&
1576 cast<LoadSDNode>(N)->getExtensionType() == ISD::EXTLOAD;
1579 /// isSEXTLoad - Returns true if the specified node is a SEXTLOAD.
1581 inline bool isSEXTLoad(const SDNode *N) {
1582 return N->getOpcode() == ISD::LOAD &&
1583 cast<LoadSDNode>(N)->getExtensionType() == ISD::SEXTLOAD;
1586 /// isZEXTLoad - Returns true if the specified node is a ZEXTLOAD.
1588 inline bool isZEXTLoad(const SDNode *N) {
1589 return N->getOpcode() == ISD::LOAD &&
1590 cast<LoadSDNode>(N)->getExtensionType() == ISD::ZEXTLOAD;
1593 /// isNON_TRUNCStore - Returns true if the specified node is a non-truncating
1595 inline bool isNON_TRUNCStore(const SDNode *N) {
1596 return N->getOpcode() == ISD::STORE &&
1597 !cast<StoreSDNode>(N)->isTruncatingStore();
1600 /// isTRUNCStore - Returns true if the specified node is a truncating
1602 inline bool isTRUNCStore(const SDNode *N) {
1603 return N->getOpcode() == ISD::STORE &&
1604 cast<StoreSDNode>(N)->isTruncatingStore();
1609 } // end llvm namespace