1 //===-- llvm/CodeGen/SelectionDAGNodes.h - SelectionDAG Nodes ---*- C++ -*-===//
3 // The LLVM Compiler Infrastructure
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // This file declares the SDNode class and derived classes, which are used to
11 // represent the nodes and operations present in a SelectionDAG. These nodes
12 // and operations are machine code level operations, with some similarities to
13 // the GCC RTL representation.
15 // Clients should include the SelectionDAG.h file instead of this file directly.
17 //===----------------------------------------------------------------------===//
19 #ifndef LLVM_CODEGEN_SELECTIONDAGNODES_H
20 #define LLVM_CODEGEN_SELECTIONDAGNODES_H
22 #include "llvm/Value.h"
23 #include "llvm/ADT/FoldingSet.h"
24 #include "llvm/ADT/GraphTraits.h"
25 #include "llvm/ADT/iterator.h"
26 #include "llvm/ADT/APFloat.h"
27 #include "llvm/ADT/APInt.h"
28 #include "llvm/CodeGen/ValueTypes.h"
29 #include "llvm/CodeGen/MachineMemOperand.h"
30 #include "llvm/Support/DataTypes.h"
37 class MachineBasicBlock;
38 class MachineConstantPoolValue;
40 template <typename T> struct DenseMapInfo;
41 template <typename T> struct simplify_type;
42 template <typename T> struct ilist_traits;
43 template<typename NodeTy, typename Traits> class iplist;
44 template<typename NodeTy> class ilist_iterator;
46 /// SDVTList - This represents a list of ValueType's that has been intern'd by
47 /// a SelectionDAG. Instances of this simple value class are returned by
48 /// SelectionDAG::getVTList(...).
52 unsigned short NumVTs;
55 /// ISD namespace - This namespace contains an enum which represents all of the
56 /// SelectionDAG node types and value types.
60 //===--------------------------------------------------------------------===//
61 /// ISD::NodeType enum - This enum defines all of the operators valid in a
65 // DELETED_NODE - This is an illegal flag value that is used to catch
66 // errors. This opcode is not a legal opcode for any node.
69 // EntryToken - This is the marker used to indicate the start of the region.
72 // Token factor - This node takes multiple tokens as input and produces a
73 // single token result. This is used to represent the fact that the operand
74 // operators are independent of each other.
77 // AssertSext, AssertZext - These nodes record if a register contains a
78 // value that has already been zero or sign extended from a narrower type.
79 // These nodes take two operands. The first is the node that has already
80 // been extended, and the second is a value type node indicating the width
82 AssertSext, AssertZext,
84 // Various leaf nodes.
85 STRING, BasicBlock, VALUETYPE, ARG_FLAGS, CONDCODE, Register,
87 GlobalAddress, GlobalTLSAddress, FrameIndex,
88 JumpTable, ConstantPool, ExternalSymbol,
90 // The address of the GOT
93 // FRAMEADDR, RETURNADDR - These nodes represent llvm.frameaddress and
94 // llvm.returnaddress on the DAG. These nodes take one operand, the index
95 // of the frame or return address to return. An index of zero corresponds
96 // to the current function's frame or return address, an index of one to the
97 // parent's frame or return address, and so on.
98 FRAMEADDR, RETURNADDR,
100 // FRAME_TO_ARGS_OFFSET - This node represents offset from frame pointer to
101 // first (possible) on-stack argument. This is needed for correct stack
102 // adjustment during unwind.
103 FRAME_TO_ARGS_OFFSET,
105 // RESULT, OUTCHAIN = EXCEPTIONADDR(INCHAIN) - This node represents the
106 // address of the exception block on entry to an landing pad block.
109 // RESULT, OUTCHAIN = EHSELECTION(INCHAIN, EXCEPTION) - This node represents
110 // the selection index of the exception thrown.
113 // OUTCHAIN = EH_RETURN(INCHAIN, OFFSET, HANDLER) - This node represents
114 // 'eh_return' gcc dwarf builtin, which is used to return from
115 // exception. The general meaning is: adjust stack by OFFSET and pass
116 // execution to HANDLER. Many platform-related details also :)
119 // TargetConstant* - Like Constant*, but the DAG does not do any folding or
120 // simplification of the constant.
124 // TargetGlobalAddress - Like GlobalAddress, but the DAG does no folding or
125 // anything else with this node, and this is valid in the target-specific
126 // dag, turning into a GlobalAddress operand.
128 TargetGlobalTLSAddress,
132 TargetExternalSymbol,
134 /// RESULT = INTRINSIC_WO_CHAIN(INTRINSICID, arg1, arg2, ...)
135 /// This node represents a target intrinsic function with no side effects.
136 /// The first operand is the ID number of the intrinsic from the
137 /// llvm::Intrinsic namespace. The operands to the intrinsic follow. The
138 /// node has returns the result of the intrinsic.
141 /// RESULT,OUTCHAIN = INTRINSIC_W_CHAIN(INCHAIN, INTRINSICID, arg1, ...)
142 /// This node represents a target intrinsic function with side effects that
143 /// returns a result. The first operand is a chain pointer. The second is
144 /// the ID number of the intrinsic from the llvm::Intrinsic namespace. The
145 /// operands to the intrinsic follow. The node has two results, the result
146 /// of the intrinsic and an output chain.
149 /// OUTCHAIN = INTRINSIC_VOID(INCHAIN, INTRINSICID, arg1, arg2, ...)
150 /// This node represents a target intrinsic function with side effects that
151 /// does not return a result. The first operand is a chain pointer. The
152 /// second is the ID number of the intrinsic from the llvm::Intrinsic
153 /// namespace. The operands to the intrinsic follow.
156 // CopyToReg - This node has three operands: a chain, a register number to
157 // set to this value, and a value.
160 // CopyFromReg - This node indicates that the input value is a virtual or
161 // physical register that is defined outside of the scope of this
162 // SelectionDAG. The register is available from the RegisterSDNode object.
165 // UNDEF - An undefined node
168 /// FORMAL_ARGUMENTS(CHAIN, CC#, ISVARARG, FLAG0, ..., FLAGn) - This node
169 /// represents the formal arguments for a function. CC# is a Constant value
170 /// indicating the calling convention of the function, and ISVARARG is a
171 /// flag that indicates whether the function is varargs or not. This node
172 /// has one result value for each incoming argument, plus one for the output
173 /// chain. It must be custom legalized. See description of CALL node for
174 /// FLAG argument contents explanation.
178 /// RV1, RV2...RVn, CHAIN = CALL(CHAIN, CC#, ISVARARG, ISTAILCALL, CALLEE,
179 /// ARG0, FLAG0, ARG1, FLAG1, ... ARGn, FLAGn)
180 /// This node represents a fully general function call, before the legalizer
181 /// runs. This has one result value for each argument / flag pair, plus
182 /// a chain result. It must be custom legalized. Flag argument indicates
183 /// misc. argument attributes. Currently:
185 /// Bit 1 - 'inreg' attribute
186 /// Bit 2 - 'sret' attribute
187 /// Bit 4 - 'byval' attribute
188 /// Bit 5 - 'nest' attribute
189 /// Bit 6-9 - alignment of byval structures
190 /// Bit 10-26 - size of byval structures
191 /// Bits 31:27 - argument ABI alignment in the first argument piece and
192 /// alignment '1' in other argument pieces.
195 // EXTRACT_ELEMENT - This is used to get the lower or upper (determined by
196 // a Constant, which is required to be operand #1) half of the integer value
197 // specified as operand #0. This is only for use before legalization, for
198 // values that will be broken into multiple registers.
201 // BUILD_PAIR - This is the opposite of EXTRACT_ELEMENT in some ways. Given
202 // two values of the same integer value type, this produces a value twice as
203 // big. Like EXTRACT_ELEMENT, this can only be used before legalization.
206 // MERGE_VALUES - This node takes multiple discrete operands and returns
207 // them all as its individual results. This nodes has exactly the same
208 // number of inputs and outputs, and is only valid before legalization.
209 // This node is useful for some pieces of the code generator that want to
210 // think about a single node with multiple results, not multiple nodes.
213 // Simple integer binary arithmetic operators.
214 ADD, SUB, MUL, SDIV, UDIV, SREM, UREM,
216 // SMUL_LOHI/UMUL_LOHI - Multiply two integers of type iN, producing
217 // a signed/unsigned value of type i[2*N], and return the full value as
218 // two results, each of type iN.
219 SMUL_LOHI, UMUL_LOHI,
221 // SDIVREM/UDIVREM - Divide two integers and produce both a quotient and
225 // CARRY_FALSE - This node is used when folding other nodes,
226 // like ADDC/SUBC, which indicate the carry result is always false.
229 // Carry-setting nodes for multiple precision addition and subtraction.
230 // These nodes take two operands of the same value type, and produce two
231 // results. The first result is the normal add or sub result, the second
232 // result is the carry flag result.
235 // Carry-using nodes for multiple precision addition and subtraction. These
236 // nodes take three operands: The first two are the normal lhs and rhs to
237 // the add or sub, and the third is the input carry flag. These nodes
238 // produce two results; the normal result of the add or sub, and the output
239 // carry flag. These nodes both read and write a carry flag to allow them
240 // to them to be chained together for add and sub of arbitrarily large
244 // Simple binary floating point operators.
245 FADD, FSUB, FMUL, FDIV, FREM,
247 // FCOPYSIGN(X, Y) - Return the value of X with the sign of Y. NOTE: This
248 // DAG node does not require that X and Y have the same type, just that they
249 // are both floating point. X and the result must have the same type.
250 // FCOPYSIGN(f32, f64) is allowed.
253 // INT = FGETSIGN(FP) - Return the sign bit of the specified floating point
254 // value as an integer 0/1 value.
257 /// BUILD_VECTOR(ELT0, ELT1, ELT2, ELT3,...) - Return a vector
258 /// with the specified, possibly variable, elements. The number of elements
259 /// is required to be a power of two.
262 /// INSERT_VECTOR_ELT(VECTOR, VAL, IDX) - Returns VECTOR with the element
263 /// at IDX replaced with VAL. If the type of VAL is larger than the vector
264 /// element type then VAL is truncated before replacement.
267 /// EXTRACT_VECTOR_ELT(VECTOR, IDX) - Returns a single element from VECTOR
268 /// identified by the (potentially variable) element number IDX.
271 /// CONCAT_VECTORS(VECTOR0, VECTOR1, ...) - Given a number of values of
272 /// vector type with the same length and element type, this produces a
273 /// concatenated vector result value, with length equal to the sum of the
274 /// lengths of the input vectors.
277 /// EXTRACT_SUBVECTOR(VECTOR, IDX) - Returns a subvector from VECTOR (an
278 /// vector value) starting with the (potentially variable) element number
279 /// IDX, which must be a multiple of the result vector length.
282 /// VECTOR_SHUFFLE(VEC1, VEC2, SHUFFLEVEC) - Returns a vector, of the same
283 /// type as VEC1/VEC2. SHUFFLEVEC is a BUILD_VECTOR of constant int values
284 /// (maybe of an illegal datatype) or undef that indicate which value each
285 /// result element will get. The elements of VEC1/VEC2 are enumerated in
286 /// order. This is quite similar to the Altivec 'vperm' instruction, except
287 /// that the indices must be constants and are in terms of the element size
288 /// of VEC1/VEC2, not in terms of bytes.
291 /// SCALAR_TO_VECTOR(VAL) - This represents the operation of loading a
292 /// scalar value into element 0 of the resultant vector type. The top
293 /// elements 1 to N-1 of the N-element vector are undefined.
296 // EXTRACT_SUBREG - This node is used to extract a sub-register value.
297 // This node takes a superreg and a constant sub-register index as operands.
298 // Note sub-register indices must be increasing. That is, if the
299 // sub-register index of a 8-bit sub-register is N, then the index for a
300 // 16-bit sub-register must be at least N+1.
303 // INSERT_SUBREG - This node is used to insert a sub-register value.
304 // This node takes a superreg, a subreg value, and a constant sub-register
305 // index as operands.
308 // MULHU/MULHS - Multiply high - Multiply two integers of type iN, producing
309 // an unsigned/signed value of type i[2*N], then return the top part.
312 // Bitwise operators - logical and, logical or, logical xor, shift left,
313 // shift right algebraic (shift in sign bits), shift right logical (shift in
314 // zeroes), rotate left, rotate right, and byteswap.
315 AND, OR, XOR, SHL, SRA, SRL, ROTL, ROTR, BSWAP,
317 // Counting operators
320 // Select(COND, TRUEVAL, FALSEVAL)
323 // Select with condition operator - This selects between a true value and
324 // a false value (ops #2 and #3) based on the boolean result of comparing
325 // the lhs and rhs (ops #0 and #1) of a conditional expression with the
326 // condition code in op #4, a CondCodeSDNode.
329 // SetCC operator - This evaluates to a boolean (i1) true value if the
330 // condition is true. The operands to this are the left and right operands
331 // to compare (ops #0, and #1) and the condition code to compare them with
332 // (op #2) as a CondCodeSDNode.
335 // Vector SetCC operator - This evaluates to a vector of integer elements
336 // with the high bit in each element set to true if the comparison is true
337 // and false if the comparison is false. All other bits in each element
338 // are undefined. The operands to this are the left and right operands
339 // to compare (ops #0, and #1) and the condition code to compare them with
340 // (op #2) as a CondCodeSDNode.
343 // SHL_PARTS/SRA_PARTS/SRL_PARTS - These operators are used for expanded
344 // integer shift operations, just like ADD/SUB_PARTS. The operation
346 // [Lo,Hi] = op [LoLHS,HiLHS], Amt
347 SHL_PARTS, SRA_PARTS, SRL_PARTS,
349 // Conversion operators. These are all single input single output
350 // operations. For all of these, the result type must be strictly
351 // wider or narrower (depending on the operation) than the source
354 // SIGN_EXTEND - Used for integer types, replicating the sign bit
358 // ZERO_EXTEND - Used for integer types, zeroing the new bits.
361 // ANY_EXTEND - Used for integer types. The high bits are undefined.
364 // TRUNCATE - Completely drop the high bits.
367 // [SU]INT_TO_FP - These operators convert integers (whose interpreted sign
368 // depends on the first letter) to floating point.
372 // SIGN_EXTEND_INREG - This operator atomically performs a SHL/SRA pair to
373 // sign extend a small value in a large integer register (e.g. sign
374 // extending the low 8 bits of a 32-bit register to fill the top 24 bits
375 // with the 7th bit). The size of the smaller type is indicated by the 1th
376 // operand, a ValueType node.
379 /// FP_TO_[US]INT - Convert a floating point value to a signed or unsigned
384 /// X = FP_ROUND(Y, TRUNC) - Rounding 'Y' from a larger floating point type
385 /// down to the precision of the destination VT. TRUNC is a flag, which is
386 /// always an integer that is zero or one. If TRUNC is 0, this is a
387 /// normal rounding, if it is 1, this FP_ROUND is known to not change the
390 /// The TRUNC = 1 case is used in cases where we know that the value will
391 /// not be modified by the node, because Y is not using any of the extra
392 /// precision of source type. This allows certain transformations like
393 /// FP_EXTEND(FP_ROUND(X,1)) -> X which are not safe for
394 /// FP_EXTEND(FP_ROUND(X,0)) because the extra bits aren't removed.
397 // FLT_ROUNDS_ - Returns current rounding mode:
400 // 1 Round to nearest
405 /// X = FP_ROUND_INREG(Y, VT) - This operator takes an FP register, and
406 /// rounds it to a floating point value. It then promotes it and returns it
407 /// in a register of the same size. This operation effectively just
408 /// discards excess precision. The type to round down to is specified by
409 /// the VT operand, a VTSDNode.
412 /// X = FP_EXTEND(Y) - Extend a smaller FP type into a larger FP type.
415 // BIT_CONVERT - Theis operator converts between integer and FP values, as
416 // if one was stored to memory as integer and the other was loaded from the
417 // same address (or equivalently for vector format conversions, etc). The
418 // source and result are required to have the same bit size (e.g.
419 // f32 <-> i32). This can also be used for int-to-int or fp-to-fp
420 // conversions, but that is a noop, deleted by getNode().
423 // FNEG, FABS, FSQRT, FSIN, FCOS, FPOWI, FPOW - Perform unary floating point
424 // negation, absolute value, square root, sine and cosine, powi, and pow
426 FNEG, FABS, FSQRT, FSIN, FCOS, FPOWI, FPOW,
428 // LOAD and STORE have token chains as their first operand, then the same
429 // operands as an LLVM load/store instruction, then an offset node that
430 // is added / subtracted from the base pointer to form the address (for
431 // indexed memory ops).
434 // DYNAMIC_STACKALLOC - Allocate some number of bytes on the stack aligned
435 // to a specified boundary. This node always has two return values: a new
436 // stack pointer value and a chain. The first operand is the token chain,
437 // the second is the number of bytes to allocate, and the third is the
438 // alignment boundary. The size is guaranteed to be a multiple of the stack
439 // alignment, and the alignment is guaranteed to be bigger than the stack
440 // alignment (if required) or 0 to get standard stack alignment.
443 // Control flow instructions. These all have token chains.
445 // BR - Unconditional branch. The first operand is the chain
446 // operand, the second is the MBB to branch to.
449 // BRIND - Indirect branch. The first operand is the chain, the second
450 // is the value to branch to, which must be of the same type as the target's
454 // BR_JT - Jumptable branch. The first operand is the chain, the second
455 // is the jumptable index, the last one is the jumptable entry index.
458 // BRCOND - Conditional branch. The first operand is the chain,
459 // the second is the condition, the third is the block to branch
460 // to if the condition is true.
463 // BR_CC - Conditional branch. The behavior is like that of SELECT_CC, in
464 // that the condition is represented as condition code, and two nodes to
465 // compare, rather than as a combined SetCC node. The operands in order are
466 // chain, cc, lhs, rhs, block to branch to if condition is true.
469 // RET - Return from function. The first operand is the chain,
470 // and any subsequent operands are pairs of return value and return value
471 // signness for the function. This operation can have variable number of
475 // INLINEASM - Represents an inline asm block. This node always has two
476 // return values: a chain and a flag result. The inputs are as follows:
477 // Operand #0 : Input chain.
478 // Operand #1 : a ExternalSymbolSDNode with a pointer to the asm string.
479 // Operand #2n+2: A RegisterNode.
480 // Operand #2n+3: A TargetConstant, indicating if the reg is a use/def
481 // Operand #last: Optional, an incoming flag.
484 // LABEL - Represents a label in mid basic block used to track
485 // locations needed for debug and exception handling tables. This node
487 // Operand #0 : input chain.
488 // Operand #1 : module unique number use to identify the label.
489 // Operand #2 : 0 indicates a debug label (e.g. stoppoint), 1 indicates
490 // a EH label, 2 indicates unknown label type.
493 // DECLARE - Represents a llvm.dbg.declare intrinsic. It's used to track
494 // local variable declarations for debugging information. First operand is
495 // a chain, while the next two operands are first two arguments (address
496 // and variable) of a llvm.dbg.declare instruction.
499 // STACKSAVE - STACKSAVE has one operand, an input chain. It produces a
500 // value, the same type as the pointer type for the system, and an output
504 // STACKRESTORE has two operands, an input chain and a pointer to restore to
505 // it returns an output chain.
508 // CALLSEQ_START/CALLSEQ_END - These operators mark the beginning and end of
509 // a call sequence, and carry arbitrary information that target might want
510 // to know. The first operand is a chain, the rest are specified by the
511 // target and not touched by the DAG optimizers.
512 // CALLSEQ_START..CALLSEQ_END pairs may not be nested.
513 CALLSEQ_START, // Beginning of a call sequence
514 CALLSEQ_END, // End of a call sequence
516 // VAARG - VAARG has three operands: an input chain, a pointer, and a
517 // SRCVALUE. It returns a pair of values: the vaarg value and a new chain.
520 // VACOPY - VACOPY has five operands: an input chain, a destination pointer,
521 // a source pointer, a SRCVALUE for the destination, and a SRCVALUE for the
525 // VAEND, VASTART - VAEND and VASTART have three operands: an input chain, a
526 // pointer, and a SRCVALUE.
529 // SRCVALUE - This is a node type that holds a Value* that is used to
530 // make reference to a value in the LLVM IR.
533 // MEMOPERAND - This is a node that contains a MachineMemOperand which
534 // records information about a memory reference. This is used to make
535 // AliasAnalysis queries from the backend.
538 // PCMARKER - This corresponds to the pcmarker intrinsic.
541 // READCYCLECOUNTER - This corresponds to the readcyclecounter intrinsic.
542 // The only operand is a chain and a value and a chain are produced. The
543 // value is the contents of the architecture specific cycle counter like
544 // register (or other high accuracy low latency clock source)
547 // HANDLENODE node - Used as a handle for various purposes.
550 // LOCATION - This node is used to represent a source location for debug
551 // info. It takes token chain as input, then a line number, then a column
552 // number, then a filename, then a working dir. It produces a token chain
556 // DEBUG_LOC - This node is used to represent source line information
557 // embedded in the code. It takes a token chain as input, then a line
558 // number, then a column then a file id (provided by MachineModuleInfo.) It
559 // produces a token chain as output.
562 // TRAMPOLINE - This corresponds to the init_trampoline intrinsic.
563 // It takes as input a token chain, the pointer to the trampoline,
564 // the pointer to the nested function, the pointer to pass for the
565 // 'nest' parameter, a SRCVALUE for the trampoline and another for
566 // the nested function (allowing targets to access the original
567 // Function*). It produces the result of the intrinsic and a token
571 // TRAP - Trapping instruction
574 // PREFETCH - This corresponds to a prefetch intrinsic. It takes chains are
575 // their first operand. The other operands are the address to prefetch,
576 // read / write specifier, and locality specifier.
579 // OUTCHAIN = MEMBARRIER(INCHAIN, load-load, load-store, store-load,
580 // store-store, device)
581 // This corresponds to the memory.barrier intrinsic.
582 // it takes an input chain, 4 operands to specify the type of barrier, an
583 // operand specifying if the barrier applies to device and uncached memory
584 // and produces an output chain.
587 // Val, OUTCHAIN = ATOMIC_LCS(INCHAIN, ptr, cmp, swap)
588 // this corresponds to the atomic.lcs intrinsic.
589 // cmp is compared to *ptr, and if equal, swap is stored in *ptr.
590 // the return is always the original value in *ptr
593 // Val, OUTCHAIN = ATOMIC_LAS(INCHAIN, ptr, amt)
594 // this corresponds to the atomic.las intrinsic.
595 // *ptr + amt is stored to *ptr atomically.
596 // the return is always the original value in *ptr
599 // Val, OUTCHAIN = ATOMIC_SWAP(INCHAIN, ptr, amt)
600 // this corresponds to the atomic.swap intrinsic.
601 // amt is stored to *ptr atomically.
602 // the return is always the original value in *ptr
605 // Val, OUTCHAIN = ATOMIC_LSS(INCHAIN, ptr, amt)
606 // this corresponds to the atomic.lss intrinsic.
607 // *ptr - amt is stored to *ptr atomically.
608 // the return is always the original value in *ptr
611 // Val, OUTCHAIN = ATOMIC_L[OpName]S(INCHAIN, ptr, amt)
612 // this corresponds to the atomic.[OpName] intrinsic.
613 // op(*ptr, amt) is stored to *ptr atomically.
614 // the return is always the original value in *ptr
624 // BUILTIN_OP_END - This must be the last enum value in this list.
630 /// isBuildVectorAllOnes - Return true if the specified node is a
631 /// BUILD_VECTOR where all of the elements are ~0 or undef.
632 bool isBuildVectorAllOnes(const SDNode *N);
634 /// isBuildVectorAllZeros - Return true if the specified node is a
635 /// BUILD_VECTOR where all of the elements are 0 or undef.
636 bool isBuildVectorAllZeros(const SDNode *N);
638 /// isScalarToVector - Return true if the specified node is a
639 /// ISD::SCALAR_TO_VECTOR node or a BUILD_VECTOR node where only the low
640 /// element is not an undef.
641 bool isScalarToVector(const SDNode *N);
643 /// isDebugLabel - Return true if the specified node represents a debug
644 /// label (i.e. ISD::LABEL or TargetInstrInfo::LABEL node and third operand
646 bool isDebugLabel(const SDNode *N);
648 //===--------------------------------------------------------------------===//
649 /// MemIndexedMode enum - This enum defines the load / store indexed
650 /// addressing modes.
652 /// UNINDEXED "Normal" load / store. The effective address is already
653 /// computed and is available in the base pointer. The offset
654 /// operand is always undefined. In addition to producing a
655 /// chain, an unindexed load produces one value (result of the
656 /// load); an unindexed store does not produce a value.
658 /// PRE_INC Similar to the unindexed mode where the effective address is
659 /// PRE_DEC the value of the base pointer add / subtract the offset.
660 /// It considers the computation as being folded into the load /
661 /// store operation (i.e. the load / store does the address
662 /// computation as well as performing the memory transaction).
663 /// The base operand is always undefined. In addition to
664 /// producing a chain, pre-indexed load produces two values
665 /// (result of the load and the result of the address
666 /// computation); a pre-indexed store produces one value (result
667 /// of the address computation).
669 /// POST_INC The effective address is the value of the base pointer. The
670 /// POST_DEC value of the offset operand is then added to / subtracted
671 /// from the base after memory transaction. In addition to
672 /// producing a chain, post-indexed load produces two values
673 /// (the result of the load and the result of the base +/- offset
674 /// computation); a post-indexed store produces one value (the
675 /// the result of the base +/- offset computation).
677 enum MemIndexedMode {
686 //===--------------------------------------------------------------------===//
687 /// LoadExtType enum - This enum defines the three variants of LOADEXT
688 /// (load with extension).
690 /// SEXTLOAD loads the integer operand and sign extends it to a larger
691 /// integer result type.
692 /// ZEXTLOAD loads the integer operand and zero extends it to a larger
693 /// integer result type.
694 /// EXTLOAD is used for three things: floating point extending loads,
695 /// integer extending loads [the top bits are undefined], and vector
696 /// extending loads [load into low elt].
706 //===--------------------------------------------------------------------===//
707 /// ISD::CondCode enum - These are ordered carefully to make the bitfields
708 /// below work out, when considering SETFALSE (something that never exists
709 /// dynamically) as 0. "U" -> Unsigned (for integer operands) or Unordered
710 /// (for floating point), "L" -> Less than, "G" -> Greater than, "E" -> Equal
711 /// to. If the "N" column is 1, the result of the comparison is undefined if
712 /// the input is a NAN.
714 /// All of these (except for the 'always folded ops') should be handled for
715 /// floating point. For integer, only the SETEQ,SETNE,SETLT,SETLE,SETGT,
716 /// SETGE,SETULT,SETULE,SETUGT, and SETUGE opcodes are used.
718 /// Note that these are laid out in a specific order to allow bit-twiddling
719 /// to transform conditions.
721 // Opcode N U L G E Intuitive operation
722 SETFALSE, // 0 0 0 0 Always false (always folded)
723 SETOEQ, // 0 0 0 1 True if ordered and equal
724 SETOGT, // 0 0 1 0 True if ordered and greater than
725 SETOGE, // 0 0 1 1 True if ordered and greater than or equal
726 SETOLT, // 0 1 0 0 True if ordered and less than
727 SETOLE, // 0 1 0 1 True if ordered and less than or equal
728 SETONE, // 0 1 1 0 True if ordered and operands are unequal
729 SETO, // 0 1 1 1 True if ordered (no nans)
730 SETUO, // 1 0 0 0 True if unordered: isnan(X) | isnan(Y)
731 SETUEQ, // 1 0 0 1 True if unordered or equal
732 SETUGT, // 1 0 1 0 True if unordered or greater than
733 SETUGE, // 1 0 1 1 True if unordered, greater than, or equal
734 SETULT, // 1 1 0 0 True if unordered or less than
735 SETULE, // 1 1 0 1 True if unordered, less than, or equal
736 SETUNE, // 1 1 1 0 True if unordered or not equal
737 SETTRUE, // 1 1 1 1 Always true (always folded)
738 // Don't care operations: undefined if the input is a nan.
739 SETFALSE2, // 1 X 0 0 0 Always false (always folded)
740 SETEQ, // 1 X 0 0 1 True if equal
741 SETGT, // 1 X 0 1 0 True if greater than
742 SETGE, // 1 X 0 1 1 True if greater than or equal
743 SETLT, // 1 X 1 0 0 True if less than
744 SETLE, // 1 X 1 0 1 True if less than or equal
745 SETNE, // 1 X 1 1 0 True if not equal
746 SETTRUE2, // 1 X 1 1 1 Always true (always folded)
748 SETCC_INVALID // Marker value.
751 /// isSignedIntSetCC - Return true if this is a setcc instruction that
752 /// performs a signed comparison when used with integer operands.
753 inline bool isSignedIntSetCC(CondCode Code) {
754 return Code == SETGT || Code == SETGE || Code == SETLT || Code == SETLE;
757 /// isUnsignedIntSetCC - Return true if this is a setcc instruction that
758 /// performs an unsigned comparison when used with integer operands.
759 inline bool isUnsignedIntSetCC(CondCode Code) {
760 return Code == SETUGT || Code == SETUGE || Code == SETULT || Code == SETULE;
763 /// isTrueWhenEqual - Return true if the specified condition returns true if
764 /// the two operands to the condition are equal. Note that if one of the two
765 /// operands is a NaN, this value is meaningless.
766 inline bool isTrueWhenEqual(CondCode Cond) {
767 return ((int)Cond & 1) != 0;
770 /// getUnorderedFlavor - This function returns 0 if the condition is always
771 /// false if an operand is a NaN, 1 if the condition is always true if the
772 /// operand is a NaN, and 2 if the condition is undefined if the operand is a
774 inline unsigned getUnorderedFlavor(CondCode Cond) {
775 return ((int)Cond >> 3) & 3;
778 /// getSetCCInverse - Return the operation corresponding to !(X op Y), where
779 /// 'op' is a valid SetCC operation.
780 CondCode getSetCCInverse(CondCode Operation, bool isInteger);
782 /// getSetCCSwappedOperands - Return the operation corresponding to (Y op X)
783 /// when given the operation for (X op Y).
784 CondCode getSetCCSwappedOperands(CondCode Operation);
786 /// getSetCCOrOperation - Return the result of a logical OR between different
787 /// comparisons of identical values: ((X op1 Y) | (X op2 Y)). This
788 /// function returns SETCC_INVALID if it is not possible to represent the
789 /// resultant comparison.
790 CondCode getSetCCOrOperation(CondCode Op1, CondCode Op2, bool isInteger);
792 /// getSetCCAndOperation - Return the result of a logical AND between
793 /// different comparisons of identical values: ((X op1 Y) & (X op2 Y)). This
794 /// function returns SETCC_INVALID if it is not possible to represent the
795 /// resultant comparison.
796 CondCode getSetCCAndOperation(CondCode Op1, CondCode Op2, bool isInteger);
797 } // end llvm::ISD namespace
800 //===----------------------------------------------------------------------===//
801 /// SDOperand - Unlike LLVM values, Selection DAG nodes may return multiple
802 /// values as the result of a computation. Many nodes return multiple values,
803 /// from loads (which define a token and a return value) to ADDC (which returns
804 /// a result and a carry value), to calls (which may return an arbitrary number
807 /// As such, each use of a SelectionDAG computation must indicate the node that
808 /// computes it as well as which return value to use from that node. This pair
809 /// of information is represented with the SDOperand value type.
813 SDNode *Val; // The node defining the value we are using.
814 unsigned ResNo; // Which return value of the node we are using.
816 SDOperand() : Val(0), ResNo(0) {}
817 SDOperand(SDNode *val, unsigned resno) : Val(val), ResNo(resno) {}
819 bool operator==(const SDOperand &O) const {
820 return Val == O.Val && ResNo == O.ResNo;
822 bool operator!=(const SDOperand &O) const {
823 return !operator==(O);
825 bool operator<(const SDOperand &O) const {
826 return Val < O.Val || (Val == O.Val && ResNo < O.ResNo);
829 SDOperand getValue(unsigned R) const {
830 return SDOperand(Val, R);
833 // isOperandOf - Return true if this node is an operand of N.
834 bool isOperandOf(SDNode *N) const;
836 /// getValueType - Return the ValueType of the referenced return value.
838 inline MVT getValueType() const;
840 /// getValueSizeInBits - Returns the size of the value in bits.
842 unsigned getValueSizeInBits() const {
843 return getValueType().getSizeInBits();
846 // Forwarding methods - These forward to the corresponding methods in SDNode.
847 inline unsigned getOpcode() const;
848 inline unsigned getNumOperands() const;
849 inline const SDOperand &getOperand(unsigned i) const;
850 inline uint64_t getConstantOperandVal(unsigned i) const;
851 inline bool isTargetOpcode() const;
852 inline unsigned getTargetOpcode() const;
855 /// reachesChainWithoutSideEffects - Return true if this operand (which must
856 /// be a chain) reaches the specified operand without crossing any
857 /// side-effecting instructions. In practice, this looks through token
858 /// factors and non-volatile loads. In order to remain efficient, this only
859 /// looks a couple of nodes in, it does not do an exhaustive search.
860 bool reachesChainWithoutSideEffects(SDOperand Dest,
861 unsigned Depth = 2) const;
863 /// hasOneUse - Return true if there is exactly one operation using this
864 /// result value of the defining operator.
865 inline bool hasOneUse() const;
867 /// use_empty - Return true if there are no operations using this
868 /// result value of the defining operator.
869 inline bool use_empty() const;
873 template<> struct DenseMapInfo<SDOperand> {
874 static inline SDOperand getEmptyKey() {
875 return SDOperand((SDNode*)-1, -1U);
877 static inline SDOperand getTombstoneKey() {
878 return SDOperand((SDNode*)-1, 0);
880 static unsigned getHashValue(const SDOperand &Val) {
881 return ((unsigned)((uintptr_t)Val.Val >> 4) ^
882 (unsigned)((uintptr_t)Val.Val >> 9)) + Val.ResNo;
884 static bool isEqual(const SDOperand &LHS, const SDOperand &RHS) {
887 static bool isPod() { return true; }
890 /// simplify_type specializations - Allow casting operators to work directly on
891 /// SDOperands as if they were SDNode*'s.
892 template<> struct simplify_type<SDOperand> {
893 typedef SDNode* SimpleType;
894 static SimpleType getSimplifiedValue(const SDOperand &Val) {
895 return static_cast<SimpleType>(Val.Val);
898 template<> struct simplify_type<const SDOperand> {
899 typedef SDNode* SimpleType;
900 static SimpleType getSimplifiedValue(const SDOperand &Val) {
901 return static_cast<SimpleType>(Val.Val);
905 /// SDUse - Represents a use of the SDNode referred by
909 /// User - Parent node of this operand.
911 /// Prev, next - Pointers to the uses list of the SDNode referred by
916 SDUse(): Operand(), User(NULL), Prev(NULL), Next(NULL) {}
918 SDUse(SDNode *val, unsigned resno) :
919 Operand(val,resno), User(NULL), Prev(NULL), Next(NULL) {}
921 SDUse& operator= (const SDOperand& Op) {
928 SDUse& operator= (const SDUse& Op) {
935 SDUse * getNext() { return Next; }
937 SDNode *getUser() { return User; }
939 void setUser(SDNode *p) { User = p; }
941 operator SDOperand() const { return Operand; }
943 const SDOperand& getSDOperand() const { return Operand; }
945 SDNode* &getVal () { return Operand.Val; }
947 bool operator==(const SDOperand &O) const {
951 bool operator!=(const SDOperand &O) const {
952 return !(Operand == O);
955 bool operator<(const SDOperand &O) const {
960 void addToList(SDUse **List) {
962 if (Next) Next->Prev = &Next;
967 void removeFromList() {
969 if (Next) Next->Prev = Prev;
974 /// simplify_type specializations - Allow casting operators to work directly on
975 /// SDOperands as if they were SDNode*'s.
976 template<> struct simplify_type<SDUse> {
977 typedef SDNode* SimpleType;
978 static SimpleType getSimplifiedValue(const SDUse &Val) {
979 return static_cast<SimpleType>(Val.getSDOperand().Val);
982 template<> struct simplify_type<const SDUse> {
983 typedef SDNode* SimpleType;
984 static SimpleType getSimplifiedValue(const SDUse &Val) {
985 return static_cast<SimpleType>(Val.getSDOperand().Val);
990 /// SDOperandPtr - A helper SDOperand pointer class, that can handle
991 /// arrays of SDUse and arrays of SDOperand objects. This is required
992 /// in many places inside the SelectionDAG.
995 const SDOperand *ptr; // The pointer to the SDOperand object
996 int object_size; // The size of the object containg the SDOperand
998 SDOperandPtr() : ptr(0), object_size(0) {}
1000 SDOperandPtr(SDUse * use_ptr) {
1001 ptr = &use_ptr->getSDOperand();
1002 object_size = (int)sizeof(SDUse);
1005 SDOperandPtr(const SDOperand * op_ptr) {
1007 object_size = (int)sizeof(SDOperand);
1010 const SDOperand operator *() { return *ptr; }
1011 const SDOperand *operator ->() { return ptr; }
1012 SDOperandPtr operator ++ () {
1013 ptr = (SDOperand*)((char *)ptr + object_size);
1017 SDOperandPtr operator ++ (int) {
1018 SDOperandPtr tmp = *this;
1019 ptr = (SDOperand*)((char *)ptr + object_size);
1023 SDOperand operator[] (int idx) const {
1024 return *(SDOperand*)((char*) ptr + object_size * idx);
1028 /// SDNode - Represents one node in the SelectionDAG.
1030 class SDNode : public FoldingSetNode {
1032 /// NodeType - The operation that this node performs.
1034 unsigned short NodeType;
1036 /// OperandsNeedDelete - This is true if OperandList was new[]'d. If true,
1037 /// then they will be delete[]'d when the node is destroyed.
1038 bool OperandsNeedDelete : 1;
1040 /// NodeId - Unique id per SDNode in the DAG.
1043 /// OperandList - The values that are used by this operation.
1047 /// ValueList - The types of the values this node defines. SDNode's may
1048 /// define multiple values simultaneously.
1049 const MVT *ValueList;
1051 /// NumOperands/NumValues - The number of entries in the Operand/Value list.
1052 unsigned short NumOperands, NumValues;
1054 /// UsesSize - The size of the uses list.
1057 /// Uses - List of uses for this SDNode.
1060 /// Prev/Next pointers - These pointers form the linked list of of the
1061 /// AllNodes list in the current DAG.
1062 SDNode *Prev, *Next;
1063 friend struct ilist_traits<SDNode>;
1065 /// addUse - add SDUse to the list of uses.
1066 void addUse(SDUse &U) { U.addToList(&Uses); }
1068 // Out-of-line virtual method to give class a home.
1069 virtual void ANCHOR();
1072 assert(NumOperands == 0 && "Operand list not cleared before deletion");
1073 NodeType = ISD::DELETED_NODE;
1076 //===--------------------------------------------------------------------===//
1079 unsigned getOpcode() const { return NodeType; }
1080 bool isTargetOpcode() const { return NodeType >= ISD::BUILTIN_OP_END; }
1081 unsigned getTargetOpcode() const {
1082 assert(isTargetOpcode() && "Not a target opcode!");
1083 return NodeType - ISD::BUILTIN_OP_END;
1086 size_t use_size() const { return UsesSize; }
1087 bool use_empty() const { return Uses == NULL; }
1088 bool hasOneUse() const { return use_size() == 1; }
1090 /// getNodeId - Return the unique node id.
1092 int getNodeId() const { return NodeId; }
1094 /// setNodeId - Set unique node id.
1095 void setNodeId(int Id) { NodeId = Id; }
1097 /// use_iterator - This class provides iterator support for SDUse
1098 /// operands that use a specific SDNode.
1100 : public forward_iterator<SDUse, ptrdiff_t> {
1102 explicit use_iterator(SDUse *op) : Op(op) {
1104 friend class SDNode;
1106 typedef forward_iterator<SDUse, ptrdiff_t>::reference reference;
1107 typedef forward_iterator<SDUse, ptrdiff_t>::pointer pointer;
1109 use_iterator(const use_iterator &I) : Op(I.Op) {}
1110 use_iterator() : Op(0) {}
1112 bool operator==(const use_iterator &x) const {
1115 bool operator!=(const use_iterator &x) const {
1116 return !operator==(x);
1119 /// atEnd - return true if this iterator is at the end of uses list.
1120 bool atEnd() const { return Op == 0; }
1122 // Iterator traversal: forward iteration only.
1123 use_iterator &operator++() { // Preincrement
1124 assert(Op && "Cannot increment end iterator!");
1129 use_iterator operator++(int) { // Postincrement
1130 use_iterator tmp = *this; ++*this; return tmp;
1134 /// getOperandNum - Retrive a number of a current operand.
1135 unsigned getOperandNum() const {
1136 assert(Op && "Cannot dereference end iterator!");
1137 return (unsigned)(Op - Op->getUser()->OperandList);
1140 /// Retrieve a reference to the current operand.
1141 SDUse &operator*() const {
1142 assert(Op && "Cannot dereference end iterator!");
1146 /// Retrieve a pointer to the current operand.
1147 SDUse *operator->() const {
1148 assert(Op && "Cannot dereference end iterator!");
1153 /// use_begin/use_end - Provide iteration support to walk over all uses
1156 use_iterator use_begin(SDNode *node) const {
1157 return use_iterator(node->Uses);
1160 use_iterator use_begin() const {
1161 return use_iterator(Uses);
1164 static use_iterator use_end() { return use_iterator(0); }
1167 /// hasNUsesOfValue - Return true if there are exactly NUSES uses of the
1168 /// indicated value. This method ignores uses of other values defined by this
1170 bool hasNUsesOfValue(unsigned NUses, unsigned Value) const;
1172 /// hasAnyUseOfValue - Return true if there are any use of the indicated
1173 /// value. This method ignores uses of other values defined by this operation.
1174 bool hasAnyUseOfValue(unsigned Value) const;
1176 /// isOnlyUseOf - Return true if this node is the only use of N.
1178 bool isOnlyUseOf(SDNode *N) const;
1180 /// isOperandOf - Return true if this node is an operand of N.
1182 bool isOperandOf(SDNode *N) const;
1184 /// isPredecessorOf - Return true if this node is a predecessor of N. This
1185 /// node is either an operand of N or it can be reached by recursively
1186 /// traversing up the operands.
1187 /// NOTE: this is an expensive method. Use it carefully.
1188 bool isPredecessorOf(SDNode *N) const;
1190 /// getNumOperands - Return the number of values used by this operation.
1192 unsigned getNumOperands() const { return NumOperands; }
1194 /// getConstantOperandVal - Helper method returns the integer value of a
1195 /// ConstantSDNode operand.
1196 uint64_t getConstantOperandVal(unsigned Num) const;
1198 const SDOperand &getOperand(unsigned Num) const {
1199 assert(Num < NumOperands && "Invalid child # of SDNode!");
1200 return OperandList[Num].getSDOperand();
1203 typedef SDUse* op_iterator;
1204 op_iterator op_begin() const { return OperandList; }
1205 op_iterator op_end() const { return OperandList+NumOperands; }
1208 SDVTList getVTList() const {
1209 SDVTList X = { ValueList, NumValues };
1213 /// getNumValues - Return the number of values defined/returned by this
1216 unsigned getNumValues() const { return NumValues; }
1218 /// getValueType - Return the type of a specified result.
1220 MVT getValueType(unsigned ResNo) const {
1221 assert(ResNo < NumValues && "Illegal result number!");
1222 return ValueList[ResNo];
1225 /// getValueSizeInBits - Returns MVT::getSizeInBits(getValueType(ResNo)).
1227 unsigned getValueSizeInBits(unsigned ResNo) const {
1228 return getValueType(ResNo).getSizeInBits();
1231 typedef const MVT* value_iterator;
1232 value_iterator value_begin() const { return ValueList; }
1233 value_iterator value_end() const { return ValueList+NumValues; }
1235 /// getOperationName - Return the opcode of this operation for printing.
1237 std::string getOperationName(const SelectionDAG *G = 0) const;
1238 static const char* getIndexedModeName(ISD::MemIndexedMode AM);
1240 void dump(const SelectionDAG *G) const;
1242 static bool classof(const SDNode *) { return true; }
1244 /// Profile - Gather unique data for the node.
1246 void Profile(FoldingSetNodeID &ID);
1249 friend class SelectionDAG;
1251 /// getValueTypeList - Return a pointer to the specified value type.
1253 static const MVT *getValueTypeList(MVT VT);
1254 static SDVTList getSDVTList(MVT VT) {
1255 SDVTList Ret = { getValueTypeList(VT), 1 };
1259 SDNode(unsigned Opc, SDVTList VTs, const SDOperand *Ops, unsigned NumOps)
1260 : NodeType(Opc), NodeId(-1), UsesSize(0), Uses(NULL) {
1261 OperandsNeedDelete = true;
1262 NumOperands = NumOps;
1263 OperandList = NumOps ? new SDUse[NumOperands] : 0;
1265 for (unsigned i = 0; i != NumOps; ++i) {
1266 OperandList[i] = Ops[i];
1267 OperandList[i].setUser(this);
1268 Ops[i].Val->addUse(OperandList[i]);
1269 ++Ops[i].Val->UsesSize;
1272 ValueList = VTs.VTs;
1273 NumValues = VTs.NumVTs;
1277 SDNode(unsigned Opc, SDVTList VTs, SDOperandPtr Ops, unsigned NumOps)
1278 : NodeType(Opc), NodeId(-1), UsesSize(0), Uses(NULL) {
1279 OperandsNeedDelete = true;
1280 NumOperands = NumOps;
1281 OperandList = NumOps ? new SDUse[NumOperands] : 0;
1283 for (unsigned i = 0; i != NumOps; ++i) {
1284 OperandList[i] = Ops[i];
1285 OperandList[i].setUser(this);
1286 Ops[i].Val->addUse(OperandList[i]);
1287 ++Ops[i].Val->UsesSize;
1290 ValueList = VTs.VTs;
1291 NumValues = VTs.NumVTs;
1295 SDNode(unsigned Opc, SDVTList VTs)
1296 : NodeType(Opc), NodeId(-1), UsesSize(0), Uses(NULL) {
1297 OperandsNeedDelete = false; // Operands set with InitOperands.
1300 ValueList = VTs.VTs;
1301 NumValues = VTs.NumVTs;
1305 /// InitOperands - Initialize the operands list of this node with the
1306 /// specified values, which are part of the node (thus they don't need to be
1307 /// copied in or allocated).
1308 void InitOperands(SDUse *Ops, unsigned NumOps) {
1309 assert(OperandList == 0 && "Operands already set!");
1310 NumOperands = NumOps;
1315 for (unsigned i = 0; i != NumOps; ++i) {
1316 OperandList[i].setUser(this);
1317 Ops[i].getVal()->addUse(OperandList[i]);
1318 ++Ops[i].getVal()->UsesSize;
1322 /// MorphNodeTo - This frees the operands of the current node, resets the
1323 /// opcode, types, and operands to the specified value. This should only be
1324 /// used by the SelectionDAG class.
1325 void MorphNodeTo(unsigned Opc, SDVTList L,
1326 SDOperandPtr Ops, unsigned NumOps);
1328 void addUser(unsigned i, SDNode *User) {
1329 assert(User->OperandList[i].getUser() && "Node without parent");
1330 addUse(User->OperandList[i]);
1334 void removeUser(unsigned i, SDNode *User) {
1335 assert(User->OperandList[i].getUser() && "Node without parent");
1336 SDUse &Op = User->OperandList[i];
1337 Op.removeFromList();
1343 // Define inline functions from the SDOperand class.
1345 inline unsigned SDOperand::getOpcode() const {
1346 return Val->getOpcode();
1348 inline MVT SDOperand::getValueType() const {
1349 return Val->getValueType(ResNo);
1351 inline unsigned SDOperand::getNumOperands() const {
1352 return Val->getNumOperands();
1354 inline const SDOperand &SDOperand::getOperand(unsigned i) const {
1355 return Val->getOperand(i);
1357 inline uint64_t SDOperand::getConstantOperandVal(unsigned i) const {
1358 return Val->getConstantOperandVal(i);
1360 inline bool SDOperand::isTargetOpcode() const {
1361 return Val->isTargetOpcode();
1363 inline unsigned SDOperand::getTargetOpcode() const {
1364 return Val->getTargetOpcode();
1366 inline bool SDOperand::hasOneUse() const {
1367 return Val->hasNUsesOfValue(1, ResNo);
1369 inline bool SDOperand::use_empty() const {
1370 return !Val->hasAnyUseOfValue(ResNo);
1373 /// UnarySDNode - This class is used for single-operand SDNodes. This is solely
1374 /// to allow co-allocation of node operands with the node itself.
1375 class UnarySDNode : public SDNode {
1376 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1379 UnarySDNode(unsigned Opc, SDVTList VTs, SDOperand X)
1380 : SDNode(Opc, VTs) {
1382 InitOperands(&Op, 1);
1386 /// BinarySDNode - This class is used for two-operand SDNodes. This is solely
1387 /// to allow co-allocation of node operands with the node itself.
1388 class BinarySDNode : public SDNode {
1389 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1392 BinarySDNode(unsigned Opc, SDVTList VTs, SDOperand X, SDOperand Y)
1393 : SDNode(Opc, VTs) {
1396 InitOperands(Ops, 2);
1400 /// TernarySDNode - This class is used for three-operand SDNodes. This is solely
1401 /// to allow co-allocation of node operands with the node itself.
1402 class TernarySDNode : public SDNode {
1403 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1406 TernarySDNode(unsigned Opc, SDVTList VTs, SDOperand X, SDOperand Y,
1408 : SDNode(Opc, VTs) {
1412 InitOperands(Ops, 3);
1417 /// HandleSDNode - This class is used to form a handle around another node that
1418 /// is persistant and is updated across invocations of replaceAllUsesWith on its
1419 /// operand. This node should be directly created by end-users and not added to
1420 /// the AllNodes list.
1421 class HandleSDNode : public SDNode {
1422 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1425 // FIXME: Remove the "noinline" attribute once <rdar://problem/5852746> is
1428 explicit __attribute__((__noinline__)) HandleSDNode(SDOperand X)
1430 explicit HandleSDNode(SDOperand X)
1432 : SDNode(ISD::HANDLENODE, getSDVTList(MVT::Other)) {
1434 InitOperands(&Op, 1);
1437 SDUse getValue() const { return Op; }
1440 class AtomicSDNode : public SDNode {
1441 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1445 AtomicSDNode(unsigned Opc, SDVTList VTL, SDOperand Chain, SDOperand Ptr,
1446 SDOperand Cmp, SDOperand Swp, MVT VT)
1447 : SDNode(Opc, VTL) {
1452 InitOperands(Ops, 4);
1455 AtomicSDNode(unsigned Opc, SDVTList VTL, SDOperand Chain, SDOperand Ptr,
1456 SDOperand Val, MVT VT)
1457 : SDNode(Opc, VTL) {
1461 InitOperands(Ops, 3);
1464 MVT getVT() const { return OrigVT; }
1465 bool isCompareAndSwap() const { return getOpcode() == ISD::ATOMIC_LCS; }
1468 class StringSDNode : public SDNode {
1470 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1472 friend class SelectionDAG;
1473 explicit StringSDNode(const std::string &val)
1474 : SDNode(ISD::STRING, getSDVTList(MVT::Other)), Value(val) {
1477 const std::string &getValue() const { return Value; }
1478 static bool classof(const StringSDNode *) { return true; }
1479 static bool classof(const SDNode *N) {
1480 return N->getOpcode() == ISD::STRING;
1484 class ConstantSDNode : public SDNode {
1486 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1488 friend class SelectionDAG;
1489 ConstantSDNode(bool isTarget, const APInt &val, MVT VT)
1490 : SDNode(isTarget ? ISD::TargetConstant : ISD::Constant, getSDVTList(VT)),
1495 const APInt &getAPIntValue() const { return Value; }
1496 uint64_t getValue() const { return Value.getZExtValue(); }
1498 int64_t getSignExtended() const {
1499 unsigned Bits = getValueType(0).getSizeInBits();
1500 return ((int64_t)Value.getZExtValue() << (64-Bits)) >> (64-Bits);
1503 bool isNullValue() const { return Value == 0; }
1504 bool isAllOnesValue() const {
1505 return Value == getValueType(0).getIntegerVTBitMask();
1508 static bool classof(const ConstantSDNode *) { return true; }
1509 static bool classof(const SDNode *N) {
1510 return N->getOpcode() == ISD::Constant ||
1511 N->getOpcode() == ISD::TargetConstant;
1515 class ConstantFPSDNode : public SDNode {
1517 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1519 friend class SelectionDAG;
1520 ConstantFPSDNode(bool isTarget, const APFloat& val, MVT VT)
1521 : SDNode(isTarget ? ISD::TargetConstantFP : ISD::ConstantFP,
1522 getSDVTList(VT)), Value(val) {
1526 const APFloat& getValueAPF() const { return Value; }
1528 /// isExactlyValue - We don't rely on operator== working on double values, as
1529 /// it returns true for things that are clearly not equal, like -0.0 and 0.0.
1530 /// As such, this method can be used to do an exact bit-for-bit comparison of
1531 /// two floating point values.
1533 /// We leave the version with the double argument here because it's just so
1534 /// convenient to write "2.0" and the like. Without this function we'd
1535 /// have to duplicate its logic everywhere it's called.
1536 bool isExactlyValue(double V) const {
1537 // convert is not supported on this type
1538 if (&Value.getSemantics() == &APFloat::PPCDoubleDouble)
1541 Tmp.convert(Value.getSemantics(), APFloat::rmNearestTiesToEven);
1542 return isExactlyValue(Tmp);
1544 bool isExactlyValue(const APFloat& V) const;
1546 bool isValueValidForType(MVT VT, const APFloat& Val);
1548 static bool classof(const ConstantFPSDNode *) { return true; }
1549 static bool classof(const SDNode *N) {
1550 return N->getOpcode() == ISD::ConstantFP ||
1551 N->getOpcode() == ISD::TargetConstantFP;
1555 class GlobalAddressSDNode : public SDNode {
1556 GlobalValue *TheGlobal;
1558 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1560 friend class SelectionDAG;
1561 GlobalAddressSDNode(bool isTarget, const GlobalValue *GA, MVT VT, int o = 0);
1564 GlobalValue *getGlobal() const { return TheGlobal; }
1565 int getOffset() const { return Offset; }
1567 static bool classof(const GlobalAddressSDNode *) { return true; }
1568 static bool classof(const SDNode *N) {
1569 return N->getOpcode() == ISD::GlobalAddress ||
1570 N->getOpcode() == ISD::TargetGlobalAddress ||
1571 N->getOpcode() == ISD::GlobalTLSAddress ||
1572 N->getOpcode() == ISD::TargetGlobalTLSAddress;
1576 class FrameIndexSDNode : public SDNode {
1578 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1580 friend class SelectionDAG;
1581 FrameIndexSDNode(int fi, MVT VT, bool isTarg)
1582 : SDNode(isTarg ? ISD::TargetFrameIndex : ISD::FrameIndex, getSDVTList(VT)),
1587 int getIndex() const { return FI; }
1589 static bool classof(const FrameIndexSDNode *) { return true; }
1590 static bool classof(const SDNode *N) {
1591 return N->getOpcode() == ISD::FrameIndex ||
1592 N->getOpcode() == ISD::TargetFrameIndex;
1596 class JumpTableSDNode : public SDNode {
1598 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1600 friend class SelectionDAG;
1601 JumpTableSDNode(int jti, MVT VT, bool isTarg)
1602 : SDNode(isTarg ? ISD::TargetJumpTable : ISD::JumpTable, getSDVTList(VT)),
1607 int getIndex() const { return JTI; }
1609 static bool classof(const JumpTableSDNode *) { return true; }
1610 static bool classof(const SDNode *N) {
1611 return N->getOpcode() == ISD::JumpTable ||
1612 N->getOpcode() == ISD::TargetJumpTable;
1616 class ConstantPoolSDNode : public SDNode {
1619 MachineConstantPoolValue *MachineCPVal;
1621 int Offset; // It's a MachineConstantPoolValue if top bit is set.
1623 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1625 friend class SelectionDAG;
1626 ConstantPoolSDNode(bool isTarget, Constant *c, MVT VT, int o=0)
1627 : SDNode(isTarget ? ISD::TargetConstantPool : ISD::ConstantPool,
1628 getSDVTList(VT)), Offset(o), Alignment(0) {
1629 assert((int)Offset >= 0 && "Offset is too large");
1632 ConstantPoolSDNode(bool isTarget, Constant *c, MVT VT, int o, unsigned Align)
1633 : SDNode(isTarget ? ISD::TargetConstantPool : ISD::ConstantPool,
1634 getSDVTList(VT)), Offset(o), Alignment(Align) {
1635 assert((int)Offset >= 0 && "Offset is too large");
1638 ConstantPoolSDNode(bool isTarget, MachineConstantPoolValue *v,
1640 : SDNode(isTarget ? ISD::TargetConstantPool : ISD::ConstantPool,
1641 getSDVTList(VT)), Offset(o), Alignment(0) {
1642 assert((int)Offset >= 0 && "Offset is too large");
1643 Val.MachineCPVal = v;
1644 Offset |= 1 << (sizeof(unsigned)*8-1);
1646 ConstantPoolSDNode(bool isTarget, MachineConstantPoolValue *v,
1647 MVT VT, int o, unsigned Align)
1648 : SDNode(isTarget ? ISD::TargetConstantPool : ISD::ConstantPool,
1649 getSDVTList(VT)), Offset(o), Alignment(Align) {
1650 assert((int)Offset >= 0 && "Offset is too large");
1651 Val.MachineCPVal = v;
1652 Offset |= 1 << (sizeof(unsigned)*8-1);
1656 bool isMachineConstantPoolEntry() const {
1657 return (int)Offset < 0;
1660 Constant *getConstVal() const {
1661 assert(!isMachineConstantPoolEntry() && "Wrong constantpool type");
1662 return Val.ConstVal;
1665 MachineConstantPoolValue *getMachineCPVal() const {
1666 assert(isMachineConstantPoolEntry() && "Wrong constantpool type");
1667 return Val.MachineCPVal;
1670 int getOffset() const {
1671 return Offset & ~(1 << (sizeof(unsigned)*8-1));
1674 // Return the alignment of this constant pool object, which is either 0 (for
1675 // default alignment) or log2 of the desired value.
1676 unsigned getAlignment() const { return Alignment; }
1678 const Type *getType() const;
1680 static bool classof(const ConstantPoolSDNode *) { return true; }
1681 static bool classof(const SDNode *N) {
1682 return N->getOpcode() == ISD::ConstantPool ||
1683 N->getOpcode() == ISD::TargetConstantPool;
1687 class BasicBlockSDNode : public SDNode {
1688 MachineBasicBlock *MBB;
1689 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1691 friend class SelectionDAG;
1692 explicit BasicBlockSDNode(MachineBasicBlock *mbb)
1693 : SDNode(ISD::BasicBlock, getSDVTList(MVT::Other)), MBB(mbb) {
1697 MachineBasicBlock *getBasicBlock() const { return MBB; }
1699 static bool classof(const BasicBlockSDNode *) { return true; }
1700 static bool classof(const SDNode *N) {
1701 return N->getOpcode() == ISD::BasicBlock;
1705 /// SrcValueSDNode - An SDNode that holds an arbitrary LLVM IR Value. This is
1706 /// used when the SelectionDAG needs to make a simple reference to something
1707 /// in the LLVM IR representation.
1709 /// Note that this is not used for carrying alias information; that is done
1710 /// with MemOperandSDNode, which includes a Value which is required to be a
1711 /// pointer, and several other fields specific to memory references.
1713 class SrcValueSDNode : public SDNode {
1715 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1717 friend class SelectionDAG;
1718 /// Create a SrcValue for a general value.
1719 explicit SrcValueSDNode(const Value *v)
1720 : SDNode(ISD::SRCVALUE, getSDVTList(MVT::Other)), V(v) {}
1723 /// getValue - return the contained Value.
1724 const Value *getValue() const { return V; }
1726 static bool classof(const SrcValueSDNode *) { return true; }
1727 static bool classof(const SDNode *N) {
1728 return N->getOpcode() == ISD::SRCVALUE;
1733 /// MemOperandSDNode - An SDNode that holds a MachineMemOperand. This is
1734 /// used to represent a reference to memory after ISD::LOAD
1735 /// and ISD::STORE have been lowered.
1737 class MemOperandSDNode : public SDNode {
1738 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1740 friend class SelectionDAG;
1741 /// Create a MachineMemOperand node
1742 explicit MemOperandSDNode(const MachineMemOperand &mo)
1743 : SDNode(ISD::MEMOPERAND, getSDVTList(MVT::Other)), MO(mo) {}
1746 /// MO - The contained MachineMemOperand.
1747 const MachineMemOperand MO;
1749 static bool classof(const MemOperandSDNode *) { return true; }
1750 static bool classof(const SDNode *N) {
1751 return N->getOpcode() == ISD::MEMOPERAND;
1756 class RegisterSDNode : public SDNode {
1758 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1760 friend class SelectionDAG;
1761 RegisterSDNode(unsigned reg, MVT VT)
1762 : SDNode(ISD::Register, getSDVTList(VT)), Reg(reg) {
1766 unsigned getReg() const { return Reg; }
1768 static bool classof(const RegisterSDNode *) { return true; }
1769 static bool classof(const SDNode *N) {
1770 return N->getOpcode() == ISD::Register;
1774 class ExternalSymbolSDNode : public SDNode {
1776 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1778 friend class SelectionDAG;
1779 ExternalSymbolSDNode(bool isTarget, const char *Sym, MVT VT)
1780 : SDNode(isTarget ? ISD::TargetExternalSymbol : ISD::ExternalSymbol,
1781 getSDVTList(VT)), Symbol(Sym) {
1785 const char *getSymbol() const { return Symbol; }
1787 static bool classof(const ExternalSymbolSDNode *) { return true; }
1788 static bool classof(const SDNode *N) {
1789 return N->getOpcode() == ISD::ExternalSymbol ||
1790 N->getOpcode() == ISD::TargetExternalSymbol;
1794 class CondCodeSDNode : public SDNode {
1795 ISD::CondCode Condition;
1796 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1798 friend class SelectionDAG;
1799 explicit CondCodeSDNode(ISD::CondCode Cond)
1800 : SDNode(ISD::CONDCODE, getSDVTList(MVT::Other)), Condition(Cond) {
1804 ISD::CondCode get() const { return Condition; }
1806 static bool classof(const CondCodeSDNode *) { return true; }
1807 static bool classof(const SDNode *N) {
1808 return N->getOpcode() == ISD::CONDCODE;
1815 static const uint64_t NoFlagSet = 0ULL;
1816 static const uint64_t ZExt = 1ULL<<0; ///< Zero extended
1817 static const uint64_t ZExtOffs = 0;
1818 static const uint64_t SExt = 1ULL<<1; ///< Sign extended
1819 static const uint64_t SExtOffs = 1;
1820 static const uint64_t InReg = 1ULL<<2; ///< Passed in register
1821 static const uint64_t InRegOffs = 2;
1822 static const uint64_t SRet = 1ULL<<3; ///< Hidden struct-ret ptr
1823 static const uint64_t SRetOffs = 3;
1824 static const uint64_t ByVal = 1ULL<<4; ///< Struct passed by value
1825 static const uint64_t ByValOffs = 4;
1826 static const uint64_t Nest = 1ULL<<5; ///< Nested fn static chain
1827 static const uint64_t NestOffs = 5;
1828 static const uint64_t ByValAlign = 0xFULL << 6; //< Struct alignment
1829 static const uint64_t ByValAlignOffs = 6;
1830 static const uint64_t Split = 1ULL << 10;
1831 static const uint64_t SplitOffs = 10;
1832 static const uint64_t OrigAlign = 0x1FULL<<27;
1833 static const uint64_t OrigAlignOffs = 27;
1834 static const uint64_t ByValSize = 0xffffffffULL << 32; //< Struct size
1835 static const uint64_t ByValSizeOffs = 32;
1837 static const uint64_t One = 1ULL; //< 1 of this type, for shifts
1841 ArgFlagsTy() : Flags(0) { }
1843 bool isZExt() const { return Flags & ZExt; }
1844 void setZExt() { Flags |= One << ZExtOffs; }
1846 bool isSExt() const { return Flags & SExt; }
1847 void setSExt() { Flags |= One << SExtOffs; }
1849 bool isInReg() const { return Flags & InReg; }
1850 void setInReg() { Flags |= One << InRegOffs; }
1852 bool isSRet() const { return Flags & SRet; }
1853 void setSRet() { Flags |= One << SRetOffs; }
1855 bool isByVal() const { return Flags & ByVal; }
1856 void setByVal() { Flags |= One << ByValOffs; }
1858 bool isNest() const { return Flags & Nest; }
1859 void setNest() { Flags |= One << NestOffs; }
1861 unsigned getByValAlign() const {
1863 ((One << ((Flags & ByValAlign) >> ByValAlignOffs)) / 2);
1865 void setByValAlign(unsigned A) {
1866 Flags = (Flags & ~ByValAlign) |
1867 (uint64_t(Log2_32(A) + 1) << ByValAlignOffs);
1870 bool isSplit() const { return Flags & Split; }
1871 void setSplit() { Flags |= One << SplitOffs; }
1873 unsigned getOrigAlign() const {
1875 ((One << ((Flags & OrigAlign) >> OrigAlignOffs)) / 2);
1877 void setOrigAlign(unsigned A) {
1878 Flags = (Flags & ~OrigAlign) |
1879 (uint64_t(Log2_32(A) + 1) << OrigAlignOffs);
1882 unsigned getByValSize() const {
1883 return (unsigned)((Flags & ByValSize) >> ByValSizeOffs);
1885 void setByValSize(unsigned S) {
1886 Flags = (Flags & ~ByValSize) | (uint64_t(S) << ByValSizeOffs);
1889 /// getArgFlagsString - Returns the flags as a string, eg: "zext align:4".
1890 std::string getArgFlagsString();
1892 /// getRawBits - Represent the flags as a bunch of bits.
1893 uint64_t getRawBits() const { return Flags; }
1897 /// ARG_FLAGSSDNode - Leaf node holding parameter flags.
1898 class ARG_FLAGSSDNode : public SDNode {
1899 ISD::ArgFlagsTy TheFlags;
1900 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1902 friend class SelectionDAG;
1903 explicit ARG_FLAGSSDNode(ISD::ArgFlagsTy Flags)
1904 : SDNode(ISD::ARG_FLAGS, getSDVTList(MVT::Other)), TheFlags(Flags) {
1907 ISD::ArgFlagsTy getArgFlags() const { return TheFlags; }
1909 static bool classof(const ARG_FLAGSSDNode *) { return true; }
1910 static bool classof(const SDNode *N) {
1911 return N->getOpcode() == ISD::ARG_FLAGS;
1915 /// VTSDNode - This class is used to represent MVT's, which are used
1916 /// to parameterize some operations.
1917 class VTSDNode : public SDNode {
1919 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1921 friend class SelectionDAG;
1922 explicit VTSDNode(MVT VT)
1923 : SDNode(ISD::VALUETYPE, getSDVTList(MVT::Other)), ValueType(VT) {
1927 MVT getVT() const { return ValueType; }
1929 static bool classof(const VTSDNode *) { return true; }
1930 static bool classof(const SDNode *N) {
1931 return N->getOpcode() == ISD::VALUETYPE;
1935 /// LSBaseSDNode - Base class for LoadSDNode and StoreSDNode
1937 class LSBaseSDNode : public SDNode {
1939 // AddrMode - unindexed, pre-indexed, post-indexed.
1940 ISD::MemIndexedMode AddrMode;
1942 // MemoryVT - VT of in-memory value.
1945 //! SrcValue - Memory location for alias analysis.
1946 const Value *SrcValue;
1948 //! SVOffset - Memory location offset.
1951 //! Alignment - Alignment of memory location in bytes.
1954 //! IsVolatile - True if the store is volatile.
1957 //! Operand array for load and store
1959 \note Moving this array to the base class captures more
1960 common functionality shared between LoadSDNode and
1965 LSBaseSDNode(ISD::NodeType NodeTy, SDOperand *Operands, unsigned numOperands,
1966 SDVTList VTs, ISD::MemIndexedMode AM, MVT VT,
1967 const Value *SV, int SVO, unsigned Align, bool Vol)
1968 : SDNode(NodeTy, VTs),
1969 AddrMode(AM), MemoryVT(VT),
1970 SrcValue(SV), SVOffset(SVO), Alignment(Align), IsVolatile(Vol) {
1971 for (unsigned i = 0; i != numOperands; ++i)
1972 Ops[i] = Operands[i];
1973 InitOperands(Ops, numOperands);
1974 assert(Align != 0 && "Loads and stores should have non-zero aligment");
1975 assert((getOffset().getOpcode() == ISD::UNDEF || isIndexed()) &&
1976 "Only indexed loads and stores have a non-undef offset operand");
1979 const SDOperand &getChain() const { return getOperand(0); }
1980 const SDOperand &getBasePtr() const {
1981 return getOperand(getOpcode() == ISD::LOAD ? 1 : 2);
1983 const SDOperand &getOffset() const {
1984 return getOperand(getOpcode() == ISD::LOAD ? 2 : 3);
1987 const Value *getSrcValue() const { return SrcValue; }
1988 int getSrcValueOffset() const { return SVOffset; }
1989 unsigned getAlignment() const { return Alignment; }
1990 MVT getMemoryVT() const { return MemoryVT; }
1991 bool isVolatile() const { return IsVolatile; }
1993 ISD::MemIndexedMode getAddressingMode() const { return AddrMode; }
1995 /// isIndexed - Return true if this is a pre/post inc/dec load/store.
1996 bool isIndexed() const { return AddrMode != ISD::UNINDEXED; }
1998 /// isUnindexed - Return true if this is NOT a pre/post inc/dec load/store.
1999 bool isUnindexed() const { return AddrMode == ISD::UNINDEXED; }
2001 /// getMemOperand - Return a MachineMemOperand object describing the memory
2002 /// reference performed by this load or store.
2003 MachineMemOperand getMemOperand() const;
2005 static bool classof(const LSBaseSDNode *) { return true; }
2006 static bool classof(const SDNode *N) {
2007 return N->getOpcode() == ISD::LOAD ||
2008 N->getOpcode() == ISD::STORE;
2012 /// LoadSDNode - This class is used to represent ISD::LOAD nodes.
2014 class LoadSDNode : public LSBaseSDNode {
2015 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
2017 // ExtType - non-ext, anyext, sext, zext.
2018 ISD::LoadExtType ExtType;
2021 friend class SelectionDAG;
2022 LoadSDNode(SDOperand *ChainPtrOff, SDVTList VTs,
2023 ISD::MemIndexedMode AM, ISD::LoadExtType ETy, MVT LVT,
2024 const Value *SV, int O=0, unsigned Align=0, bool Vol=false)
2025 : LSBaseSDNode(ISD::LOAD, ChainPtrOff, 3,
2026 VTs, AM, LVT, SV, O, Align, Vol),
2030 ISD::LoadExtType getExtensionType() const { return ExtType; }
2031 const SDOperand &getBasePtr() const { return getOperand(1); }
2032 const SDOperand &getOffset() const { return getOperand(2); }
2034 static bool classof(const LoadSDNode *) { return true; }
2035 static bool classof(const SDNode *N) {
2036 return N->getOpcode() == ISD::LOAD;
2040 /// StoreSDNode - This class is used to represent ISD::STORE nodes.
2042 class StoreSDNode : public LSBaseSDNode {
2043 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
2045 // IsTruncStore - True if the op does a truncation before store.
2048 friend class SelectionDAG;
2049 StoreSDNode(SDOperand *ChainValuePtrOff, SDVTList VTs,
2050 ISD::MemIndexedMode AM, bool isTrunc, MVT SVT,
2051 const Value *SV, int O=0, unsigned Align=0, bool Vol=false)
2052 : LSBaseSDNode(ISD::STORE, ChainValuePtrOff, 4,
2053 VTs, AM, SVT, SV, O, Align, Vol),
2054 IsTruncStore(isTrunc) {}
2057 bool isTruncatingStore() const { return IsTruncStore; }
2058 const SDOperand &getValue() const { return getOperand(1); }
2059 const SDOperand &getBasePtr() const { return getOperand(2); }
2060 const SDOperand &getOffset() const { return getOperand(3); }
2062 static bool classof(const StoreSDNode *) { return true; }
2063 static bool classof(const SDNode *N) {
2064 return N->getOpcode() == ISD::STORE;
2069 class SDNodeIterator : public forward_iterator<SDNode, ptrdiff_t> {
2073 SDNodeIterator(SDNode *N, unsigned Op) : Node(N), Operand(Op) {}
2075 bool operator==(const SDNodeIterator& x) const {
2076 return Operand == x.Operand;
2078 bool operator!=(const SDNodeIterator& x) const { return !operator==(x); }
2080 const SDNodeIterator &operator=(const SDNodeIterator &I) {
2081 assert(I.Node == Node && "Cannot assign iterators to two different nodes!");
2082 Operand = I.Operand;
2086 pointer operator*() const {
2087 return Node->getOperand(Operand).Val;
2089 pointer operator->() const { return operator*(); }
2091 SDNodeIterator& operator++() { // Preincrement
2095 SDNodeIterator operator++(int) { // Postincrement
2096 SDNodeIterator tmp = *this; ++*this; return tmp;
2099 static SDNodeIterator begin(SDNode *N) { return SDNodeIterator(N, 0); }
2100 static SDNodeIterator end (SDNode *N) {
2101 return SDNodeIterator(N, N->getNumOperands());
2104 unsigned getOperand() const { return Operand; }
2105 const SDNode *getNode() const { return Node; }
2108 template <> struct GraphTraits<SDNode*> {
2109 typedef SDNode NodeType;
2110 typedef SDNodeIterator ChildIteratorType;
2111 static inline NodeType *getEntryNode(SDNode *N) { return N; }
2112 static inline ChildIteratorType child_begin(NodeType *N) {
2113 return SDNodeIterator::begin(N);
2115 static inline ChildIteratorType child_end(NodeType *N) {
2116 return SDNodeIterator::end(N);
2121 struct ilist_traits<SDNode> {
2122 static SDNode *getPrev(const SDNode *N) { return N->Prev; }
2123 static SDNode *getNext(const SDNode *N) { return N->Next; }
2125 static void setPrev(SDNode *N, SDNode *Prev) { N->Prev = Prev; }
2126 static void setNext(SDNode *N, SDNode *Next) { N->Next = Next; }
2128 static SDNode *createSentinel() {
2129 return new SDNode(ISD::EntryToken, SDNode::getSDVTList(MVT::Other));
2131 static void destroySentinel(SDNode *N) { delete N; }
2132 //static SDNode *createNode(const SDNode &V) { return new SDNode(V); }
2135 void addNodeToList(SDNode *) {}
2136 void removeNodeFromList(SDNode *) {}
2137 void transferNodesFromList(iplist<SDNode, ilist_traits> &,
2138 const ilist_iterator<SDNode> &,
2139 const ilist_iterator<SDNode> &) {}
2143 /// isNormalLoad - Returns true if the specified node is a non-extending
2144 /// and unindexed load.
2145 inline bool isNormalLoad(const SDNode *N) {
2146 const LoadSDNode *Ld = dyn_cast<LoadSDNode>(N);
2147 return Ld && Ld->getExtensionType() == ISD::NON_EXTLOAD &&
2148 Ld->getAddressingMode() == ISD::UNINDEXED;
2151 /// isNON_EXTLoad - Returns true if the specified node is a non-extending
2153 inline bool isNON_EXTLoad(const SDNode *N) {
2154 return isa<LoadSDNode>(N) &&
2155 cast<LoadSDNode>(N)->getExtensionType() == ISD::NON_EXTLOAD;
2158 /// isEXTLoad - Returns true if the specified node is a EXTLOAD.
2160 inline bool isEXTLoad(const SDNode *N) {
2161 return isa<LoadSDNode>(N) &&
2162 cast<LoadSDNode>(N)->getExtensionType() == ISD::EXTLOAD;
2165 /// isSEXTLoad - Returns true if the specified node is a SEXTLOAD.
2167 inline bool isSEXTLoad(const SDNode *N) {
2168 return isa<LoadSDNode>(N) &&
2169 cast<LoadSDNode>(N)->getExtensionType() == ISD::SEXTLOAD;
2172 /// isZEXTLoad - Returns true if the specified node is a ZEXTLOAD.
2174 inline bool isZEXTLoad(const SDNode *N) {
2175 return isa<LoadSDNode>(N) &&
2176 cast<LoadSDNode>(N)->getExtensionType() == ISD::ZEXTLOAD;
2179 /// isUNINDEXEDLoad - Returns true if the specified node is an unindexed load.
2181 inline bool isUNINDEXEDLoad(const SDNode *N) {
2182 return isa<LoadSDNode>(N) &&
2183 cast<LoadSDNode>(N)->getAddressingMode() == ISD::UNINDEXED;
2186 /// isNormalStore - Returns true if the specified node is a non-truncating
2187 /// and unindexed store.
2188 inline bool isNormalStore(const SDNode *N) {
2189 const StoreSDNode *St = dyn_cast<StoreSDNode>(N);
2190 return St && !St->isTruncatingStore() &&
2191 St->getAddressingMode() == ISD::UNINDEXED;
2194 /// isNON_TRUNCStore - Returns true if the specified node is a non-truncating
2196 inline bool isNON_TRUNCStore(const SDNode *N) {
2197 return isa<StoreSDNode>(N) && !cast<StoreSDNode>(N)->isTruncatingStore();
2200 /// isTRUNCStore - Returns true if the specified node is a truncating
2202 inline bool isTRUNCStore(const SDNode *N) {
2203 return isa<StoreSDNode>(N) && cast<StoreSDNode>(N)->isTruncatingStore();
2206 /// isUNINDEXEDStore - Returns true if the specified node is an
2207 /// unindexed store.
2208 inline bool isUNINDEXEDStore(const SDNode *N) {
2209 return isa<StoreSDNode>(N) &&
2210 cast<StoreSDNode>(N)->getAddressingMode() == ISD::UNINDEXED;
2215 } // end llvm namespace