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
623 // BUILTIN_OP_END - This must be the last enum value in this list.
629 /// isBuildVectorAllOnes - Return true if the specified node is a
630 /// BUILD_VECTOR where all of the elements are ~0 or undef.
631 bool isBuildVectorAllOnes(const SDNode *N);
633 /// isBuildVectorAllZeros - Return true if the specified node is a
634 /// BUILD_VECTOR where all of the elements are 0 or undef.
635 bool isBuildVectorAllZeros(const SDNode *N);
637 /// isScalarToVector - Return true if the specified node is a
638 /// ISD::SCALAR_TO_VECTOR node or a BUILD_VECTOR node where only the low
639 /// element is not an undef.
640 bool isScalarToVector(const SDNode *N);
642 /// isDebugLabel - Return true if the specified node represents a debug
643 /// label (i.e. ISD::LABEL or TargetInstrInfo::LABEL node and third operand
645 bool isDebugLabel(const SDNode *N);
647 //===--------------------------------------------------------------------===//
648 /// MemIndexedMode enum - This enum defines the load / store indexed
649 /// addressing modes.
651 /// UNINDEXED "Normal" load / store. The effective address is already
652 /// computed and is available in the base pointer. The offset
653 /// operand is always undefined. In addition to producing a
654 /// chain, an unindexed load produces one value (result of the
655 /// load); an unindexed store does not produce a value.
657 /// PRE_INC Similar to the unindexed mode where the effective address is
658 /// PRE_DEC the value of the base pointer add / subtract the offset.
659 /// It considers the computation as being folded into the load /
660 /// store operation (i.e. the load / store does the address
661 /// computation as well as performing the memory transaction).
662 /// The base operand is always undefined. In addition to
663 /// producing a chain, pre-indexed load produces two values
664 /// (result of the load and the result of the address
665 /// computation); a pre-indexed store produces one value (result
666 /// of the address computation).
668 /// POST_INC The effective address is the value of the base pointer. The
669 /// POST_DEC value of the offset operand is then added to / subtracted
670 /// from the base after memory transaction. In addition to
671 /// producing a chain, post-indexed load produces two values
672 /// (the result of the load and the result of the base +/- offset
673 /// computation); a post-indexed store produces one value (the
674 /// the result of the base +/- offset computation).
676 enum MemIndexedMode {
685 //===--------------------------------------------------------------------===//
686 /// LoadExtType enum - This enum defines the three variants of LOADEXT
687 /// (load with extension).
689 /// SEXTLOAD loads the integer operand and sign extends it to a larger
690 /// integer result type.
691 /// ZEXTLOAD loads the integer operand and zero extends it to a larger
692 /// integer result type.
693 /// EXTLOAD is used for three things: floating point extending loads,
694 /// integer extending loads [the top bits are undefined], and vector
695 /// extending loads [load into low elt].
705 //===--------------------------------------------------------------------===//
706 /// ISD::CondCode enum - These are ordered carefully to make the bitfields
707 /// below work out, when considering SETFALSE (something that never exists
708 /// dynamically) as 0. "U" -> Unsigned (for integer operands) or Unordered
709 /// (for floating point), "L" -> Less than, "G" -> Greater than, "E" -> Equal
710 /// to. If the "N" column is 1, the result of the comparison is undefined if
711 /// the input is a NAN.
713 /// All of these (except for the 'always folded ops') should be handled for
714 /// floating point. For integer, only the SETEQ,SETNE,SETLT,SETLE,SETGT,
715 /// SETGE,SETULT,SETULE,SETUGT, and SETUGE opcodes are used.
717 /// Note that these are laid out in a specific order to allow bit-twiddling
718 /// to transform conditions.
720 // Opcode N U L G E Intuitive operation
721 SETFALSE, // 0 0 0 0 Always false (always folded)
722 SETOEQ, // 0 0 0 1 True if ordered and equal
723 SETOGT, // 0 0 1 0 True if ordered and greater than
724 SETOGE, // 0 0 1 1 True if ordered and greater than or equal
725 SETOLT, // 0 1 0 0 True if ordered and less than
726 SETOLE, // 0 1 0 1 True if ordered and less than or equal
727 SETONE, // 0 1 1 0 True if ordered and operands are unequal
728 SETO, // 0 1 1 1 True if ordered (no nans)
729 SETUO, // 1 0 0 0 True if unordered: isnan(X) | isnan(Y)
730 SETUEQ, // 1 0 0 1 True if unordered or equal
731 SETUGT, // 1 0 1 0 True if unordered or greater than
732 SETUGE, // 1 0 1 1 True if unordered, greater than, or equal
733 SETULT, // 1 1 0 0 True if unordered or less than
734 SETULE, // 1 1 0 1 True if unordered, less than, or equal
735 SETUNE, // 1 1 1 0 True if unordered or not equal
736 SETTRUE, // 1 1 1 1 Always true (always folded)
737 // Don't care operations: undefined if the input is a nan.
738 SETFALSE2, // 1 X 0 0 0 Always false (always folded)
739 SETEQ, // 1 X 0 0 1 True if equal
740 SETGT, // 1 X 0 1 0 True if greater than
741 SETGE, // 1 X 0 1 1 True if greater than or equal
742 SETLT, // 1 X 1 0 0 True if less than
743 SETLE, // 1 X 1 0 1 True if less than or equal
744 SETNE, // 1 X 1 1 0 True if not equal
745 SETTRUE2, // 1 X 1 1 1 Always true (always folded)
747 SETCC_INVALID // Marker value.
750 /// isSignedIntSetCC - Return true if this is a setcc instruction that
751 /// performs a signed comparison when used with integer operands.
752 inline bool isSignedIntSetCC(CondCode Code) {
753 return Code == SETGT || Code == SETGE || Code == SETLT || Code == SETLE;
756 /// isUnsignedIntSetCC - Return true if this is a setcc instruction that
757 /// performs an unsigned comparison when used with integer operands.
758 inline bool isUnsignedIntSetCC(CondCode Code) {
759 return Code == SETUGT || Code == SETUGE || Code == SETULT || Code == SETULE;
762 /// isTrueWhenEqual - Return true if the specified condition returns true if
763 /// the two operands to the condition are equal. Note that if one of the two
764 /// operands is a NaN, this value is meaningless.
765 inline bool isTrueWhenEqual(CondCode Cond) {
766 return ((int)Cond & 1) != 0;
769 /// getUnorderedFlavor - This function returns 0 if the condition is always
770 /// false if an operand is a NaN, 1 if the condition is always true if the
771 /// operand is a NaN, and 2 if the condition is undefined if the operand is a
773 inline unsigned getUnorderedFlavor(CondCode Cond) {
774 return ((int)Cond >> 3) & 3;
777 /// getSetCCInverse - Return the operation corresponding to !(X op Y), where
778 /// 'op' is a valid SetCC operation.
779 CondCode getSetCCInverse(CondCode Operation, bool isInteger);
781 /// getSetCCSwappedOperands - Return the operation corresponding to (Y op X)
782 /// when given the operation for (X op Y).
783 CondCode getSetCCSwappedOperands(CondCode Operation);
785 /// getSetCCOrOperation - Return the result of a logical OR between different
786 /// comparisons of identical values: ((X op1 Y) | (X op2 Y)). This
787 /// function returns SETCC_INVALID if it is not possible to represent the
788 /// resultant comparison.
789 CondCode getSetCCOrOperation(CondCode Op1, CondCode Op2, bool isInteger);
791 /// getSetCCAndOperation - Return the result of a logical AND between
792 /// different comparisons of identical values: ((X op1 Y) & (X op2 Y)). This
793 /// function returns SETCC_INVALID if it is not possible to represent the
794 /// resultant comparison.
795 CondCode getSetCCAndOperation(CondCode Op1, CondCode Op2, bool isInteger);
796 } // end llvm::ISD namespace
799 //===----------------------------------------------------------------------===//
800 /// SDOperand - Unlike LLVM values, Selection DAG nodes may return multiple
801 /// values as the result of a computation. Many nodes return multiple values,
802 /// from loads (which define a token and a return value) to ADDC (which returns
803 /// a result and a carry value), to calls (which may return an arbitrary number
806 /// As such, each use of a SelectionDAG computation must indicate the node that
807 /// computes it as well as which return value to use from that node. This pair
808 /// of information is represented with the SDOperand value type.
812 SDNode *Val; // The node defining the value we are using.
813 unsigned ResNo; // Which return value of the node we are using.
815 SDOperand() : Val(0), ResNo(0) {}
816 SDOperand(SDNode *val, unsigned resno) : Val(val), ResNo(resno) {}
818 bool operator==(const SDOperand &O) const {
819 return Val == O.Val && ResNo == O.ResNo;
821 bool operator!=(const SDOperand &O) const {
822 return !operator==(O);
824 bool operator<(const SDOperand &O) const {
825 return Val < O.Val || (Val == O.Val && ResNo < O.ResNo);
828 SDOperand getValue(unsigned R) const {
829 return SDOperand(Val, R);
832 // isOperandOf - Return true if this node is an operand of N.
833 bool isOperandOf(SDNode *N) const;
835 /// getValueType - Return the ValueType of the referenced return value.
837 inline MVT getValueType() const;
839 /// getValueSizeInBits - Returns the size of the value in bits.
841 unsigned getValueSizeInBits() const {
842 return getValueType().getSizeInBits();
845 // Forwarding methods - These forward to the corresponding methods in SDNode.
846 inline unsigned getOpcode() const;
847 inline unsigned getNumOperands() const;
848 inline const SDOperand &getOperand(unsigned i) const;
849 inline uint64_t getConstantOperandVal(unsigned i) const;
850 inline bool isTargetOpcode() const;
851 inline unsigned getTargetOpcode() const;
854 /// reachesChainWithoutSideEffects - Return true if this operand (which must
855 /// be a chain) reaches the specified operand without crossing any
856 /// side-effecting instructions. In practice, this looks through token
857 /// factors and non-volatile loads. In order to remain efficient, this only
858 /// looks a couple of nodes in, it does not do an exhaustive search.
859 bool reachesChainWithoutSideEffects(SDOperand Dest,
860 unsigned Depth = 2) const;
862 /// hasOneUse - Return true if there is exactly one operation using this
863 /// result value of the defining operator.
864 inline bool hasOneUse() const;
866 /// use_empty - Return true if there are no operations using this
867 /// result value of the defining operator.
868 inline bool use_empty() const;
872 template<> struct DenseMapInfo<SDOperand> {
873 static inline SDOperand getEmptyKey() {
874 return SDOperand((SDNode*)-1, -1U);
876 static inline SDOperand getTombstoneKey() {
877 return SDOperand((SDNode*)-1, 0);
879 static unsigned getHashValue(const SDOperand &Val) {
880 return ((unsigned)((uintptr_t)Val.Val >> 4) ^
881 (unsigned)((uintptr_t)Val.Val >> 9)) + Val.ResNo;
883 static bool isEqual(const SDOperand &LHS, const SDOperand &RHS) {
886 static bool isPod() { return true; }
889 /// simplify_type specializations - Allow casting operators to work directly on
890 /// SDOperands as if they were SDNode*'s.
891 template<> struct simplify_type<SDOperand> {
892 typedef SDNode* SimpleType;
893 static SimpleType getSimplifiedValue(const SDOperand &Val) {
894 return static_cast<SimpleType>(Val.Val);
897 template<> struct simplify_type<const SDOperand> {
898 typedef SDNode* SimpleType;
899 static SimpleType getSimplifiedValue(const SDOperand &Val) {
900 return static_cast<SimpleType>(Val.Val);
904 /// SDUse - Represents a use of the SDNode referred by
908 /// User - Parent node of this operand.
910 /// Prev, next - Pointers to the uses list of the SDNode referred by
915 SDUse(): Operand(), User(NULL), Prev(NULL), Next(NULL) {}
917 SDUse(SDNode *val, unsigned resno) :
918 Operand(val,resno), User(NULL), Prev(NULL), Next(NULL) {}
920 SDUse& operator= (const SDOperand& Op) {
927 SDUse& operator= (const SDUse& Op) {
934 SDUse * getNext() { return Next; }
936 SDNode *getUser() { return User; }
938 void setUser(SDNode *p) { User = p; }
940 operator SDOperand() const { return Operand; }
942 const SDOperand& getSDOperand() const { return Operand; }
944 SDNode* &getVal () { return Operand.Val; }
946 bool operator==(const SDOperand &O) const {
950 bool operator!=(const SDOperand &O) const {
951 return !(Operand == O);
954 bool operator<(const SDOperand &O) const {
959 void addToList(SDUse **List) {
961 if (Next) Next->Prev = &Next;
966 void removeFromList() {
968 if (Next) Next->Prev = Prev;
973 /// simplify_type specializations - Allow casting operators to work directly on
974 /// SDOperands as if they were SDNode*'s.
975 template<> struct simplify_type<SDUse> {
976 typedef SDNode* SimpleType;
977 static SimpleType getSimplifiedValue(const SDUse &Val) {
978 return static_cast<SimpleType>(Val.getSDOperand().Val);
981 template<> struct simplify_type<const SDUse> {
982 typedef SDNode* SimpleType;
983 static SimpleType getSimplifiedValue(const SDUse &Val) {
984 return static_cast<SimpleType>(Val.getSDOperand().Val);
989 /// SDOperandPtr - A helper SDOperand pointer class, that can handle
990 /// arrays of SDUse and arrays of SDOperand objects. This is required
991 /// in many places inside the SelectionDAG.
994 const SDOperand *ptr; // The pointer to the SDOperand object
995 int object_size; // The size of the object containg the SDOperand
997 SDOperandPtr() : ptr(0), object_size(0) {}
999 SDOperandPtr(SDUse * use_ptr) {
1000 ptr = &use_ptr->getSDOperand();
1001 object_size = (int)sizeof(SDUse);
1004 SDOperandPtr(const SDOperand * op_ptr) {
1006 object_size = (int)sizeof(SDOperand);
1009 const SDOperand operator *() { return *ptr; }
1010 const SDOperand *operator ->() { return ptr; }
1011 SDOperandPtr operator ++ () {
1012 ptr = (SDOperand*)((char *)ptr + object_size);
1016 SDOperandPtr operator ++ (int) {
1017 SDOperandPtr tmp = *this;
1018 ptr = (SDOperand*)((char *)ptr + object_size);
1022 SDOperand operator[] (int idx) const {
1023 return *(SDOperand*)((char*) ptr + object_size * idx);
1027 /// SDNode - Represents one node in the SelectionDAG.
1029 class SDNode : public FoldingSetNode {
1031 /// NodeType - The operation that this node performs.
1033 unsigned short NodeType;
1035 /// OperandsNeedDelete - This is true if OperandList was new[]'d. If true,
1036 /// then they will be delete[]'d when the node is destroyed.
1037 bool OperandsNeedDelete : 1;
1039 /// NodeId - Unique id per SDNode in the DAG.
1042 /// OperandList - The values that are used by this operation.
1046 /// ValueList - The types of the values this node defines. SDNode's may
1047 /// define multiple values simultaneously.
1048 const MVT *ValueList;
1050 /// NumOperands/NumValues - The number of entries in the Operand/Value list.
1051 unsigned short NumOperands, NumValues;
1053 /// Prev/Next pointers - These pointers form the linked list of of the
1054 /// AllNodes list in the current DAG.
1055 SDNode *Prev, *Next;
1056 friend struct ilist_traits<SDNode>;
1058 /// UsesSize - The size of the uses list.
1061 /// Uses - List of uses for this SDNode.
1064 /// addUse - add SDUse to the list of uses.
1065 void addUse(SDUse &U) { U.addToList(&Uses); }
1067 // Out-of-line virtual method to give class a home.
1068 virtual void ANCHOR();
1071 assert(NumOperands == 0 && "Operand list not cleared before deletion");
1072 NodeType = ISD::DELETED_NODE;
1075 //===--------------------------------------------------------------------===//
1078 unsigned getOpcode() const { return NodeType; }
1079 bool isTargetOpcode() const { return NodeType >= ISD::BUILTIN_OP_END; }
1080 unsigned getTargetOpcode() const {
1081 assert(isTargetOpcode() && "Not a target opcode!");
1082 return NodeType - ISD::BUILTIN_OP_END;
1085 size_t use_size() const { return UsesSize; }
1086 bool use_empty() const { return Uses == NULL; }
1087 bool hasOneUse() const { return use_size() == 1; }
1089 /// getNodeId - Return the unique node id.
1091 int getNodeId() const { return NodeId; }
1093 /// setNodeId - Set unique node id.
1094 void setNodeId(int Id) { NodeId = Id; }
1096 /// use_iterator - This class provides iterator support for SDUse
1097 /// operands that use a specific SDNode.
1099 : public forward_iterator<SDUse, ptrdiff_t> {
1101 explicit use_iterator(SDUse *op) : Op(op) {
1103 friend class SDNode;
1105 typedef forward_iterator<SDUse, ptrdiff_t>::reference reference;
1106 typedef forward_iterator<SDUse, ptrdiff_t>::pointer pointer;
1108 use_iterator(const use_iterator &I) : Op(I.Op) {}
1109 use_iterator() : Op(0) {}
1111 bool operator==(const use_iterator &x) const {
1114 bool operator!=(const use_iterator &x) const {
1115 return !operator==(x);
1118 /// atEnd - return true if this iterator is at the end of uses list.
1119 bool atEnd() const { return Op == 0; }
1121 // Iterator traversal: forward iteration only.
1122 use_iterator &operator++() { // Preincrement
1123 assert(Op && "Cannot increment end iterator!");
1128 use_iterator operator++(int) { // Postincrement
1129 use_iterator tmp = *this; ++*this; return tmp;
1133 /// getOperandNum - Retrive a number of a current operand.
1134 unsigned getOperandNum() const {
1135 assert(Op && "Cannot dereference end iterator!");
1136 return (unsigned)(Op - Op->getUser()->OperandList);
1139 /// Retrieve a reference to the current operand.
1140 SDUse &operator*() const {
1141 assert(Op && "Cannot dereference end iterator!");
1145 /// Retrieve a pointer to the current operand.
1146 SDUse *operator->() const {
1147 assert(Op && "Cannot dereference end iterator!");
1152 /// use_begin/use_end - Provide iteration support to walk over all uses
1155 use_iterator use_begin(SDNode *node) const {
1156 return use_iterator(node->Uses);
1159 use_iterator use_begin() const {
1160 return use_iterator(Uses);
1163 static use_iterator use_end() { return use_iterator(0); }
1166 /// hasNUsesOfValue - Return true if there are exactly NUSES uses of the
1167 /// indicated value. This method ignores uses of other values defined by this
1169 bool hasNUsesOfValue(unsigned NUses, unsigned Value) const;
1171 /// hasAnyUseOfValue - Return true if there are any use of the indicated
1172 /// value. This method ignores uses of other values defined by this operation.
1173 bool hasAnyUseOfValue(unsigned Value) const;
1175 /// isOnlyUseOf - Return true if this node is the only use of N.
1177 bool isOnlyUseOf(SDNode *N) const;
1179 /// isOperandOf - Return true if this node is an operand of N.
1181 bool isOperandOf(SDNode *N) const;
1183 /// isPredecessorOf - Return true if this node is a predecessor of N. This
1184 /// node is either an operand of N or it can be reached by recursively
1185 /// traversing up the operands.
1186 /// NOTE: this is an expensive method. Use it carefully.
1187 bool isPredecessorOf(SDNode *N) const;
1189 /// getNumOperands - Return the number of values used by this operation.
1191 unsigned getNumOperands() const { return NumOperands; }
1193 /// getConstantOperandVal - Helper method returns the integer value of a
1194 /// ConstantSDNode operand.
1195 uint64_t getConstantOperandVal(unsigned Num) const;
1197 const SDOperand &getOperand(unsigned Num) const {
1198 assert(Num < NumOperands && "Invalid child # of SDNode!");
1199 return OperandList[Num].getSDOperand();
1202 typedef SDUse* op_iterator;
1203 op_iterator op_begin() const { return OperandList; }
1204 op_iterator op_end() const { return OperandList+NumOperands; }
1207 SDVTList getVTList() const {
1208 SDVTList X = { ValueList, NumValues };
1212 /// getNumValues - Return the number of values defined/returned by this
1215 unsigned getNumValues() const { return NumValues; }
1217 /// getValueType - Return the type of a specified result.
1219 MVT getValueType(unsigned ResNo) const {
1220 assert(ResNo < NumValues && "Illegal result number!");
1221 return ValueList[ResNo];
1224 /// getValueSizeInBits - Returns MVT::getSizeInBits(getValueType(ResNo)).
1226 unsigned getValueSizeInBits(unsigned ResNo) const {
1227 return getValueType(ResNo).getSizeInBits();
1230 typedef const MVT* value_iterator;
1231 value_iterator value_begin() const { return ValueList; }
1232 value_iterator value_end() const { return ValueList+NumValues; }
1234 /// getOperationName - Return the opcode of this operation for printing.
1236 std::string getOperationName(const SelectionDAG *G = 0) const;
1237 static const char* getIndexedModeName(ISD::MemIndexedMode AM);
1239 void dump(const SelectionDAG *G) const;
1241 static bool classof(const SDNode *) { return true; }
1243 /// Profile - Gather unique data for the node.
1245 void Profile(FoldingSetNodeID &ID);
1248 friend class SelectionDAG;
1250 /// getValueTypeList - Return a pointer to the specified value type.
1252 static const MVT *getValueTypeList(MVT VT);
1253 static SDVTList getSDVTList(MVT VT) {
1254 SDVTList Ret = { getValueTypeList(VT), 1 };
1258 SDNode(unsigned Opc, SDVTList VTs, const SDOperand *Ops, unsigned NumOps)
1259 : NodeType(Opc), NodeId(-1), UsesSize(0), Uses(NULL) {
1260 OperandsNeedDelete = true;
1261 NumOperands = NumOps;
1262 OperandList = NumOps ? new SDUse[NumOperands] : 0;
1264 for (unsigned i = 0; i != NumOps; ++i) {
1265 OperandList[i] = Ops[i];
1266 OperandList[i].setUser(this);
1267 Ops[i].Val->addUse(OperandList[i]);
1268 ++Ops[i].Val->UsesSize;
1271 ValueList = VTs.VTs;
1272 NumValues = VTs.NumVTs;
1276 SDNode(unsigned Opc, SDVTList VTs, SDOperandPtr Ops, unsigned NumOps)
1277 : NodeType(Opc), NodeId(-1), UsesSize(0), Uses(NULL) {
1278 OperandsNeedDelete = true;
1279 NumOperands = NumOps;
1280 OperandList = NumOps ? new SDUse[NumOperands] : 0;
1282 for (unsigned i = 0; i != NumOps; ++i) {
1283 OperandList[i] = Ops[i];
1284 OperandList[i].setUser(this);
1285 Ops[i].Val->addUse(OperandList[i]);
1286 ++Ops[i].Val->UsesSize;
1289 ValueList = VTs.VTs;
1290 NumValues = VTs.NumVTs;
1294 SDNode(unsigned Opc, SDVTList VTs)
1295 : NodeType(Opc), NodeId(-1), UsesSize(0), Uses(NULL) {
1296 OperandsNeedDelete = false; // Operands set with InitOperands.
1299 ValueList = VTs.VTs;
1300 NumValues = VTs.NumVTs;
1304 /// InitOperands - Initialize the operands list of this node with the
1305 /// specified values, which are part of the node (thus they don't need to be
1306 /// copied in or allocated).
1307 void InitOperands(SDUse *Ops, unsigned NumOps) {
1308 assert(OperandList == 0 && "Operands already set!");
1309 NumOperands = NumOps;
1314 for (unsigned i = 0; i != NumOps; ++i) {
1315 OperandList[i].setUser(this);
1316 Ops[i].getVal()->addUse(OperandList[i]);
1317 ++Ops[i].getVal()->UsesSize;
1321 /// MorphNodeTo - This frees the operands of the current node, resets the
1322 /// opcode, types, and operands to the specified value. This should only be
1323 /// used by the SelectionDAG class.
1324 void MorphNodeTo(unsigned Opc, SDVTList L,
1325 SDOperandPtr Ops, unsigned NumOps);
1327 void addUser(unsigned i, SDNode *User) {
1328 assert(User->OperandList[i].getUser() && "Node without parent");
1329 addUse(User->OperandList[i]);
1333 void removeUser(unsigned i, SDNode *User) {
1334 assert(User->OperandList[i].getUser() && "Node without parent");
1335 SDUse &Op = User->OperandList[i];
1336 Op.removeFromList();
1342 // Define inline functions from the SDOperand class.
1344 inline unsigned SDOperand::getOpcode() const {
1345 return Val->getOpcode();
1347 inline MVT SDOperand::getValueType() const {
1348 return Val->getValueType(ResNo);
1350 inline unsigned SDOperand::getNumOperands() const {
1351 return Val->getNumOperands();
1353 inline const SDOperand &SDOperand::getOperand(unsigned i) const {
1354 return Val->getOperand(i);
1356 inline uint64_t SDOperand::getConstantOperandVal(unsigned i) const {
1357 return Val->getConstantOperandVal(i);
1359 inline bool SDOperand::isTargetOpcode() const {
1360 return Val->isTargetOpcode();
1362 inline unsigned SDOperand::getTargetOpcode() const {
1363 return Val->getTargetOpcode();
1365 inline bool SDOperand::hasOneUse() const {
1366 return Val->hasNUsesOfValue(1, ResNo);
1368 inline bool SDOperand::use_empty() const {
1369 return !Val->hasAnyUseOfValue(ResNo);
1372 /// UnarySDNode - This class is used for single-operand SDNodes. This is solely
1373 /// to allow co-allocation of node operands with the node itself.
1374 class UnarySDNode : public SDNode {
1375 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1378 UnarySDNode(unsigned Opc, SDVTList VTs, SDOperand X)
1379 : SDNode(Opc, VTs) {
1381 InitOperands(&Op, 1);
1385 /// BinarySDNode - This class is used for two-operand SDNodes. This is solely
1386 /// to allow co-allocation of node operands with the node itself.
1387 class BinarySDNode : public SDNode {
1388 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1391 BinarySDNode(unsigned Opc, SDVTList VTs, SDOperand X, SDOperand Y)
1392 : SDNode(Opc, VTs) {
1395 InitOperands(Ops, 2);
1399 /// TernarySDNode - This class is used for three-operand SDNodes. This is solely
1400 /// to allow co-allocation of node operands with the node itself.
1401 class TernarySDNode : public SDNode {
1402 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1405 TernarySDNode(unsigned Opc, SDVTList VTs, SDOperand X, SDOperand Y,
1407 : SDNode(Opc, VTs) {
1411 InitOperands(Ops, 3);
1416 /// HandleSDNode - This class is used to form a handle around another node that
1417 /// is persistant and is updated across invocations of replaceAllUsesWith on its
1418 /// operand. This node should be directly created by end-users and not added to
1419 /// the AllNodes list.
1420 class HandleSDNode : public SDNode {
1421 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1424 // FIXME: Remove the "noinline" attribute once <rdar://problem/5852746> is
1427 explicit __attribute__((__noinline__)) HandleSDNode(SDOperand X)
1429 explicit HandleSDNode(SDOperand X)
1431 : SDNode(ISD::HANDLENODE, getSDVTList(MVT::Other)) {
1433 InitOperands(&Op, 1);
1436 SDUse getValue() const { return Op; }
1439 class AtomicSDNode : public SDNode {
1440 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1444 AtomicSDNode(unsigned Opc, SDVTList VTL, SDOperand Chain, SDOperand Ptr,
1445 SDOperand Cmp, SDOperand Swp, MVT VT)
1446 : SDNode(Opc, VTL) {
1451 InitOperands(Ops, 4);
1454 AtomicSDNode(unsigned Opc, SDVTList VTL, SDOperand Chain, SDOperand Ptr,
1455 SDOperand Val, MVT VT)
1456 : SDNode(Opc, VTL) {
1460 InitOperands(Ops, 3);
1463 MVT getVT() const { return OrigVT; }
1464 bool isCompareAndSwap() const { return getOpcode() == ISD::ATOMIC_LCS; }
1467 class StringSDNode : public SDNode {
1469 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1471 friend class SelectionDAG;
1472 explicit StringSDNode(const std::string &val)
1473 : SDNode(ISD::STRING, getSDVTList(MVT::Other)), Value(val) {
1476 const std::string &getValue() const { return Value; }
1477 static bool classof(const StringSDNode *) { return true; }
1478 static bool classof(const SDNode *N) {
1479 return N->getOpcode() == ISD::STRING;
1483 class ConstantSDNode : public SDNode {
1485 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1487 friend class SelectionDAG;
1488 ConstantSDNode(bool isTarget, const APInt &val, MVT VT)
1489 : SDNode(isTarget ? ISD::TargetConstant : ISD::Constant, getSDVTList(VT)),
1494 const APInt &getAPIntValue() const { return Value; }
1495 uint64_t getValue() const { return Value.getZExtValue(); }
1497 int64_t getSignExtended() const {
1498 unsigned Bits = getValueType(0).getSizeInBits();
1499 return ((int64_t)Value.getZExtValue() << (64-Bits)) >> (64-Bits);
1502 bool isNullValue() const { return Value == 0; }
1503 bool isAllOnesValue() const {
1504 return Value == getValueType(0).getIntegerVTBitMask();
1507 static bool classof(const ConstantSDNode *) { return true; }
1508 static bool classof(const SDNode *N) {
1509 return N->getOpcode() == ISD::Constant ||
1510 N->getOpcode() == ISD::TargetConstant;
1514 class ConstantFPSDNode : public SDNode {
1516 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1518 friend class SelectionDAG;
1519 ConstantFPSDNode(bool isTarget, const APFloat& val, MVT VT)
1520 : SDNode(isTarget ? ISD::TargetConstantFP : ISD::ConstantFP,
1521 getSDVTList(VT)), Value(val) {
1525 const APFloat& getValueAPF() const { return Value; }
1527 /// isExactlyValue - We don't rely on operator== working on double values, as
1528 /// it returns true for things that are clearly not equal, like -0.0 and 0.0.
1529 /// As such, this method can be used to do an exact bit-for-bit comparison of
1530 /// two floating point values.
1532 /// We leave the version with the double argument here because it's just so
1533 /// convenient to write "2.0" and the like. Without this function we'd
1534 /// have to duplicate its logic everywhere it's called.
1535 bool isExactlyValue(double V) const {
1536 // convert is not supported on this type
1537 if (&Value.getSemantics() == &APFloat::PPCDoubleDouble)
1540 Tmp.convert(Value.getSemantics(), APFloat::rmNearestTiesToEven);
1541 return isExactlyValue(Tmp);
1543 bool isExactlyValue(const APFloat& V) const;
1545 bool isValueValidForType(MVT VT, const APFloat& Val);
1547 static bool classof(const ConstantFPSDNode *) { return true; }
1548 static bool classof(const SDNode *N) {
1549 return N->getOpcode() == ISD::ConstantFP ||
1550 N->getOpcode() == ISD::TargetConstantFP;
1554 class GlobalAddressSDNode : public SDNode {
1555 GlobalValue *TheGlobal;
1557 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1559 friend class SelectionDAG;
1560 GlobalAddressSDNode(bool isTarget, const GlobalValue *GA, MVT VT, int o = 0);
1563 GlobalValue *getGlobal() const { return TheGlobal; }
1564 int getOffset() const { return Offset; }
1566 static bool classof(const GlobalAddressSDNode *) { return true; }
1567 static bool classof(const SDNode *N) {
1568 return N->getOpcode() == ISD::GlobalAddress ||
1569 N->getOpcode() == ISD::TargetGlobalAddress ||
1570 N->getOpcode() == ISD::GlobalTLSAddress ||
1571 N->getOpcode() == ISD::TargetGlobalTLSAddress;
1575 class FrameIndexSDNode : public SDNode {
1577 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1579 friend class SelectionDAG;
1580 FrameIndexSDNode(int fi, MVT VT, bool isTarg)
1581 : SDNode(isTarg ? ISD::TargetFrameIndex : ISD::FrameIndex, getSDVTList(VT)),
1586 int getIndex() const { return FI; }
1588 static bool classof(const FrameIndexSDNode *) { return true; }
1589 static bool classof(const SDNode *N) {
1590 return N->getOpcode() == ISD::FrameIndex ||
1591 N->getOpcode() == ISD::TargetFrameIndex;
1595 class JumpTableSDNode : public SDNode {
1597 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1599 friend class SelectionDAG;
1600 JumpTableSDNode(int jti, MVT VT, bool isTarg)
1601 : SDNode(isTarg ? ISD::TargetJumpTable : ISD::JumpTable, getSDVTList(VT)),
1606 int getIndex() const { return JTI; }
1608 static bool classof(const JumpTableSDNode *) { return true; }
1609 static bool classof(const SDNode *N) {
1610 return N->getOpcode() == ISD::JumpTable ||
1611 N->getOpcode() == ISD::TargetJumpTable;
1615 class ConstantPoolSDNode : public SDNode {
1618 MachineConstantPoolValue *MachineCPVal;
1620 int Offset; // It's a MachineConstantPoolValue if top bit is set.
1622 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1624 friend class SelectionDAG;
1625 ConstantPoolSDNode(bool isTarget, Constant *c, MVT VT, int o=0)
1626 : SDNode(isTarget ? ISD::TargetConstantPool : ISD::ConstantPool,
1627 getSDVTList(VT)), Offset(o), Alignment(0) {
1628 assert((int)Offset >= 0 && "Offset is too large");
1631 ConstantPoolSDNode(bool isTarget, Constant *c, MVT VT, int o, unsigned Align)
1632 : SDNode(isTarget ? ISD::TargetConstantPool : ISD::ConstantPool,
1633 getSDVTList(VT)), Offset(o), Alignment(Align) {
1634 assert((int)Offset >= 0 && "Offset is too large");
1637 ConstantPoolSDNode(bool isTarget, MachineConstantPoolValue *v,
1639 : SDNode(isTarget ? ISD::TargetConstantPool : ISD::ConstantPool,
1640 getSDVTList(VT)), Offset(o), Alignment(0) {
1641 assert((int)Offset >= 0 && "Offset is too large");
1642 Val.MachineCPVal = v;
1643 Offset |= 1 << (sizeof(unsigned)*8-1);
1645 ConstantPoolSDNode(bool isTarget, MachineConstantPoolValue *v,
1646 MVT VT, int o, unsigned Align)
1647 : SDNode(isTarget ? ISD::TargetConstantPool : ISD::ConstantPool,
1648 getSDVTList(VT)), Offset(o), Alignment(Align) {
1649 assert((int)Offset >= 0 && "Offset is too large");
1650 Val.MachineCPVal = v;
1651 Offset |= 1 << (sizeof(unsigned)*8-1);
1655 bool isMachineConstantPoolEntry() const {
1656 return (int)Offset < 0;
1659 Constant *getConstVal() const {
1660 assert(!isMachineConstantPoolEntry() && "Wrong constantpool type");
1661 return Val.ConstVal;
1664 MachineConstantPoolValue *getMachineCPVal() const {
1665 assert(isMachineConstantPoolEntry() && "Wrong constantpool type");
1666 return Val.MachineCPVal;
1669 int getOffset() const {
1670 return Offset & ~(1 << (sizeof(unsigned)*8-1));
1673 // Return the alignment of this constant pool object, which is either 0 (for
1674 // default alignment) or log2 of the desired value.
1675 unsigned getAlignment() const { return Alignment; }
1677 const Type *getType() const;
1679 static bool classof(const ConstantPoolSDNode *) { return true; }
1680 static bool classof(const SDNode *N) {
1681 return N->getOpcode() == ISD::ConstantPool ||
1682 N->getOpcode() == ISD::TargetConstantPool;
1686 class BasicBlockSDNode : public SDNode {
1687 MachineBasicBlock *MBB;
1688 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1690 friend class SelectionDAG;
1691 explicit BasicBlockSDNode(MachineBasicBlock *mbb)
1692 : SDNode(ISD::BasicBlock, getSDVTList(MVT::Other)), MBB(mbb) {
1696 MachineBasicBlock *getBasicBlock() const { return MBB; }
1698 static bool classof(const BasicBlockSDNode *) { return true; }
1699 static bool classof(const SDNode *N) {
1700 return N->getOpcode() == ISD::BasicBlock;
1704 /// SrcValueSDNode - An SDNode that holds an arbitrary LLVM IR Value. This is
1705 /// used when the SelectionDAG needs to make a simple reference to something
1706 /// in the LLVM IR representation.
1708 /// Note that this is not used for carrying alias information; that is done
1709 /// with MemOperandSDNode, which includes a Value which is required to be a
1710 /// pointer, and several other fields specific to memory references.
1712 class SrcValueSDNode : public SDNode {
1714 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1716 friend class SelectionDAG;
1717 /// Create a SrcValue for a general value.
1718 explicit SrcValueSDNode(const Value *v)
1719 : SDNode(ISD::SRCVALUE, getSDVTList(MVT::Other)), V(v) {}
1722 /// getValue - return the contained Value.
1723 const Value *getValue() const { return V; }
1725 static bool classof(const SrcValueSDNode *) { return true; }
1726 static bool classof(const SDNode *N) {
1727 return N->getOpcode() == ISD::SRCVALUE;
1732 /// MemOperandSDNode - An SDNode that holds a MachineMemOperand. This is
1733 /// used to represent a reference to memory after ISD::LOAD
1734 /// and ISD::STORE have been lowered.
1736 class MemOperandSDNode : public SDNode {
1737 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1739 friend class SelectionDAG;
1740 /// Create a MachineMemOperand node
1741 explicit MemOperandSDNode(const MachineMemOperand &mo)
1742 : SDNode(ISD::MEMOPERAND, getSDVTList(MVT::Other)), MO(mo) {}
1745 /// MO - The contained MachineMemOperand.
1746 const MachineMemOperand MO;
1748 static bool classof(const MemOperandSDNode *) { return true; }
1749 static bool classof(const SDNode *N) {
1750 return N->getOpcode() == ISD::MEMOPERAND;
1755 class RegisterSDNode : public SDNode {
1757 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1759 friend class SelectionDAG;
1760 RegisterSDNode(unsigned reg, MVT VT)
1761 : SDNode(ISD::Register, getSDVTList(VT)), Reg(reg) {
1765 unsigned getReg() const { return Reg; }
1767 static bool classof(const RegisterSDNode *) { return true; }
1768 static bool classof(const SDNode *N) {
1769 return N->getOpcode() == ISD::Register;
1773 class ExternalSymbolSDNode : public SDNode {
1775 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1777 friend class SelectionDAG;
1778 ExternalSymbolSDNode(bool isTarget, const char *Sym, MVT VT)
1779 : SDNode(isTarget ? ISD::TargetExternalSymbol : ISD::ExternalSymbol,
1780 getSDVTList(VT)), Symbol(Sym) {
1784 const char *getSymbol() const { return Symbol; }
1786 static bool classof(const ExternalSymbolSDNode *) { return true; }
1787 static bool classof(const SDNode *N) {
1788 return N->getOpcode() == ISD::ExternalSymbol ||
1789 N->getOpcode() == ISD::TargetExternalSymbol;
1793 class CondCodeSDNode : public SDNode {
1794 ISD::CondCode Condition;
1795 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1797 friend class SelectionDAG;
1798 explicit CondCodeSDNode(ISD::CondCode Cond)
1799 : SDNode(ISD::CONDCODE, getSDVTList(MVT::Other)), Condition(Cond) {
1803 ISD::CondCode get() const { return Condition; }
1805 static bool classof(const CondCodeSDNode *) { return true; }
1806 static bool classof(const SDNode *N) {
1807 return N->getOpcode() == ISD::CONDCODE;
1814 static const uint64_t NoFlagSet = 0ULL;
1815 static const uint64_t ZExt = 1ULL<<0; ///< Zero extended
1816 static const uint64_t ZExtOffs = 0;
1817 static const uint64_t SExt = 1ULL<<1; ///< Sign extended
1818 static const uint64_t SExtOffs = 1;
1819 static const uint64_t InReg = 1ULL<<2; ///< Passed in register
1820 static const uint64_t InRegOffs = 2;
1821 static const uint64_t SRet = 1ULL<<3; ///< Hidden struct-ret ptr
1822 static const uint64_t SRetOffs = 3;
1823 static const uint64_t ByVal = 1ULL<<4; ///< Struct passed by value
1824 static const uint64_t ByValOffs = 4;
1825 static const uint64_t Nest = 1ULL<<5; ///< Nested fn static chain
1826 static const uint64_t NestOffs = 5;
1827 static const uint64_t ByValAlign = 0xFULL << 6; //< Struct alignment
1828 static const uint64_t ByValAlignOffs = 6;
1829 static const uint64_t Split = 1ULL << 10;
1830 static const uint64_t SplitOffs = 10;
1831 static const uint64_t OrigAlign = 0x1FULL<<27;
1832 static const uint64_t OrigAlignOffs = 27;
1833 static const uint64_t ByValSize = 0xffffffffULL << 32; //< Struct size
1834 static const uint64_t ByValSizeOffs = 32;
1836 static const uint64_t One = 1ULL; //< 1 of this type, for shifts
1840 ArgFlagsTy() : Flags(0) { }
1842 bool isZExt() const { return Flags & ZExt; }
1843 void setZExt() { Flags |= One << ZExtOffs; }
1845 bool isSExt() const { return Flags & SExt; }
1846 void setSExt() { Flags |= One << SExtOffs; }
1848 bool isInReg() const { return Flags & InReg; }
1849 void setInReg() { Flags |= One << InRegOffs; }
1851 bool isSRet() const { return Flags & SRet; }
1852 void setSRet() { Flags |= One << SRetOffs; }
1854 bool isByVal() const { return Flags & ByVal; }
1855 void setByVal() { Flags |= One << ByValOffs; }
1857 bool isNest() const { return Flags & Nest; }
1858 void setNest() { Flags |= One << NestOffs; }
1860 unsigned getByValAlign() const {
1862 ((One << ((Flags & ByValAlign) >> ByValAlignOffs)) / 2);
1864 void setByValAlign(unsigned A) {
1865 Flags = (Flags & ~ByValAlign) |
1866 (uint64_t(Log2_32(A) + 1) << ByValAlignOffs);
1869 bool isSplit() const { return Flags & Split; }
1870 void setSplit() { Flags |= One << SplitOffs; }
1872 unsigned getOrigAlign() const {
1874 ((One << ((Flags & OrigAlign) >> OrigAlignOffs)) / 2);
1876 void setOrigAlign(unsigned A) {
1877 Flags = (Flags & ~OrigAlign) |
1878 (uint64_t(Log2_32(A) + 1) << OrigAlignOffs);
1881 unsigned getByValSize() const {
1882 return (unsigned)((Flags & ByValSize) >> ByValSizeOffs);
1884 void setByValSize(unsigned S) {
1885 Flags = (Flags & ~ByValSize) | (uint64_t(S) << ByValSizeOffs);
1888 /// getArgFlagsString - Returns the flags as a string, eg: "zext align:4".
1889 std::string getArgFlagsString();
1891 /// getRawBits - Represent the flags as a bunch of bits.
1892 uint64_t getRawBits() const { return Flags; }
1896 /// ARG_FLAGSSDNode - Leaf node holding parameter flags.
1897 class ARG_FLAGSSDNode : public SDNode {
1898 ISD::ArgFlagsTy TheFlags;
1899 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1901 friend class SelectionDAG;
1902 explicit ARG_FLAGSSDNode(ISD::ArgFlagsTy Flags)
1903 : SDNode(ISD::ARG_FLAGS, getSDVTList(MVT::Other)), TheFlags(Flags) {
1906 ISD::ArgFlagsTy getArgFlags() const { return TheFlags; }
1908 static bool classof(const ARG_FLAGSSDNode *) { return true; }
1909 static bool classof(const SDNode *N) {
1910 return N->getOpcode() == ISD::ARG_FLAGS;
1914 /// VTSDNode - This class is used to represent MVT's, which are used
1915 /// to parameterize some operations.
1916 class VTSDNode : public SDNode {
1918 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1920 friend class SelectionDAG;
1921 explicit VTSDNode(MVT VT)
1922 : SDNode(ISD::VALUETYPE, getSDVTList(MVT::Other)), ValueType(VT) {
1926 MVT getVT() const { return ValueType; }
1928 static bool classof(const VTSDNode *) { return true; }
1929 static bool classof(const SDNode *N) {
1930 return N->getOpcode() == ISD::VALUETYPE;
1934 /// LSBaseSDNode - Base class for LoadSDNode and StoreSDNode
1936 class LSBaseSDNode : public SDNode {
1938 // AddrMode - unindexed, pre-indexed, post-indexed.
1939 ISD::MemIndexedMode AddrMode;
1941 // MemoryVT - VT of in-memory value.
1944 //! SrcValue - Memory location for alias analysis.
1945 const Value *SrcValue;
1947 //! SVOffset - Memory location offset.
1950 //! Alignment - Alignment of memory location in bytes.
1953 //! IsVolatile - True if the store is volatile.
1956 //! Operand array for load and store
1958 \note Moving this array to the base class captures more
1959 common functionality shared between LoadSDNode and
1964 LSBaseSDNode(ISD::NodeType NodeTy, SDOperand *Operands, unsigned numOperands,
1965 SDVTList VTs, ISD::MemIndexedMode AM, MVT VT,
1966 const Value *SV, int SVO, unsigned Align, bool Vol)
1967 : SDNode(NodeTy, VTs),
1968 AddrMode(AM), MemoryVT(VT),
1969 SrcValue(SV), SVOffset(SVO), Alignment(Align), IsVolatile(Vol) {
1970 for (unsigned i = 0; i != numOperands; ++i)
1971 Ops[i] = Operands[i];
1972 InitOperands(Ops, numOperands);
1973 assert(Align != 0 && "Loads and stores should have non-zero aligment");
1974 assert((getOffset().getOpcode() == ISD::UNDEF || isIndexed()) &&
1975 "Only indexed loads and stores have a non-undef offset operand");
1978 const SDOperand &getChain() const { return getOperand(0); }
1979 const SDOperand &getBasePtr() const {
1980 return getOperand(getOpcode() == ISD::LOAD ? 1 : 2);
1982 const SDOperand &getOffset() const {
1983 return getOperand(getOpcode() == ISD::LOAD ? 2 : 3);
1986 const Value *getSrcValue() const { return SrcValue; }
1987 int getSrcValueOffset() const { return SVOffset; }
1988 unsigned getAlignment() const { return Alignment; }
1989 MVT getMemoryVT() const { return MemoryVT; }
1990 bool isVolatile() const { return IsVolatile; }
1992 ISD::MemIndexedMode getAddressingMode() const { return AddrMode; }
1994 /// isIndexed - Return true if this is a pre/post inc/dec load/store.
1995 bool isIndexed() const { return AddrMode != ISD::UNINDEXED; }
1997 /// isUnindexed - Return true if this is NOT a pre/post inc/dec load/store.
1998 bool isUnindexed() const { return AddrMode == ISD::UNINDEXED; }
2000 /// getMemOperand - Return a MachineMemOperand object describing the memory
2001 /// reference performed by this load or store.
2002 MachineMemOperand getMemOperand() const;
2004 static bool classof(const LSBaseSDNode *) { return true; }
2005 static bool classof(const SDNode *N) {
2006 return N->getOpcode() == ISD::LOAD ||
2007 N->getOpcode() == ISD::STORE;
2011 /// LoadSDNode - This class is used to represent ISD::LOAD nodes.
2013 class LoadSDNode : public LSBaseSDNode {
2014 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
2016 // ExtType - non-ext, anyext, sext, zext.
2017 ISD::LoadExtType ExtType;
2020 friend class SelectionDAG;
2021 LoadSDNode(SDOperand *ChainPtrOff, SDVTList VTs,
2022 ISD::MemIndexedMode AM, ISD::LoadExtType ETy, MVT LVT,
2023 const Value *SV, int O=0, unsigned Align=0, bool Vol=false)
2024 : LSBaseSDNode(ISD::LOAD, ChainPtrOff, 3,
2025 VTs, AM, LVT, SV, O, Align, Vol),
2029 ISD::LoadExtType getExtensionType() const { return ExtType; }
2030 const SDOperand &getBasePtr() const { return getOperand(1); }
2031 const SDOperand &getOffset() const { return getOperand(2); }
2033 static bool classof(const LoadSDNode *) { return true; }
2034 static bool classof(const SDNode *N) {
2035 return N->getOpcode() == ISD::LOAD;
2039 /// StoreSDNode - This class is used to represent ISD::STORE nodes.
2041 class StoreSDNode : public LSBaseSDNode {
2042 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
2044 // IsTruncStore - True if the op does a truncation before store.
2047 friend class SelectionDAG;
2048 StoreSDNode(SDOperand *ChainValuePtrOff, SDVTList VTs,
2049 ISD::MemIndexedMode AM, bool isTrunc, MVT SVT,
2050 const Value *SV, int O=0, unsigned Align=0, bool Vol=false)
2051 : LSBaseSDNode(ISD::STORE, ChainValuePtrOff, 4,
2052 VTs, AM, SVT, SV, O, Align, Vol),
2053 IsTruncStore(isTrunc) {}
2056 bool isTruncatingStore() const { return IsTruncStore; }
2057 const SDOperand &getValue() const { return getOperand(1); }
2058 const SDOperand &getBasePtr() const { return getOperand(2); }
2059 const SDOperand &getOffset() const { return getOperand(3); }
2061 static bool classof(const StoreSDNode *) { return true; }
2062 static bool classof(const SDNode *N) {
2063 return N->getOpcode() == ISD::STORE;
2068 class SDNodeIterator : public forward_iterator<SDNode, ptrdiff_t> {
2072 SDNodeIterator(SDNode *N, unsigned Op) : Node(N), Operand(Op) {}
2074 bool operator==(const SDNodeIterator& x) const {
2075 return Operand == x.Operand;
2077 bool operator!=(const SDNodeIterator& x) const { return !operator==(x); }
2079 const SDNodeIterator &operator=(const SDNodeIterator &I) {
2080 assert(I.Node == Node && "Cannot assign iterators to two different nodes!");
2081 Operand = I.Operand;
2085 pointer operator*() const {
2086 return Node->getOperand(Operand).Val;
2088 pointer operator->() const { return operator*(); }
2090 SDNodeIterator& operator++() { // Preincrement
2094 SDNodeIterator operator++(int) { // Postincrement
2095 SDNodeIterator tmp = *this; ++*this; return tmp;
2098 static SDNodeIterator begin(SDNode *N) { return SDNodeIterator(N, 0); }
2099 static SDNodeIterator end (SDNode *N) {
2100 return SDNodeIterator(N, N->getNumOperands());
2103 unsigned getOperand() const { return Operand; }
2104 const SDNode *getNode() const { return Node; }
2107 template <> struct GraphTraits<SDNode*> {
2108 typedef SDNode NodeType;
2109 typedef SDNodeIterator ChildIteratorType;
2110 static inline NodeType *getEntryNode(SDNode *N) { return N; }
2111 static inline ChildIteratorType child_begin(NodeType *N) {
2112 return SDNodeIterator::begin(N);
2114 static inline ChildIteratorType child_end(NodeType *N) {
2115 return SDNodeIterator::end(N);
2120 struct ilist_traits<SDNode> {
2121 static SDNode *getPrev(const SDNode *N) { return N->Prev; }
2122 static SDNode *getNext(const SDNode *N) { return N->Next; }
2124 static void setPrev(SDNode *N, SDNode *Prev) { N->Prev = Prev; }
2125 static void setNext(SDNode *N, SDNode *Next) { N->Next = Next; }
2127 static SDNode *createSentinel() {
2128 return new SDNode(ISD::EntryToken, SDNode::getSDVTList(MVT::Other));
2130 static void destroySentinel(SDNode *N) { delete N; }
2131 //static SDNode *createNode(const SDNode &V) { return new SDNode(V); }
2134 void addNodeToList(SDNode *) {}
2135 void removeNodeFromList(SDNode *) {}
2136 void transferNodesFromList(iplist<SDNode, ilist_traits> &,
2137 const ilist_iterator<SDNode> &,
2138 const ilist_iterator<SDNode> &) {}
2142 /// isNormalLoad - Returns true if the specified node is a non-extending
2143 /// and unindexed load.
2144 inline bool isNormalLoad(const SDNode *N) {
2145 if (N->getOpcode() != ISD::LOAD)
2147 const LoadSDNode *Ld = cast<LoadSDNode>(N);
2148 return Ld->getExtensionType() == ISD::NON_EXTLOAD &&
2149 Ld->getAddressingMode() == ISD::UNINDEXED;
2152 /// isNON_EXTLoad - Returns true if the specified node is a non-extending
2154 inline bool isNON_EXTLoad(const SDNode *N) {
2155 return N->getOpcode() == ISD::LOAD &&
2156 cast<LoadSDNode>(N)->getExtensionType() == ISD::NON_EXTLOAD;
2159 /// isEXTLoad - Returns true if the specified node is a EXTLOAD.
2161 inline bool isEXTLoad(const SDNode *N) {
2162 return N->getOpcode() == ISD::LOAD &&
2163 cast<LoadSDNode>(N)->getExtensionType() == ISD::EXTLOAD;
2166 /// isSEXTLoad - Returns true if the specified node is a SEXTLOAD.
2168 inline bool isSEXTLoad(const SDNode *N) {
2169 return N->getOpcode() == ISD::LOAD &&
2170 cast<LoadSDNode>(N)->getExtensionType() == ISD::SEXTLOAD;
2173 /// isZEXTLoad - Returns true if the specified node is a ZEXTLOAD.
2175 inline bool isZEXTLoad(const SDNode *N) {
2176 return N->getOpcode() == ISD::LOAD &&
2177 cast<LoadSDNode>(N)->getExtensionType() == ISD::ZEXTLOAD;
2180 /// isUNINDEXEDLoad - Returns true if the specified node is a unindexed load.
2182 inline bool isUNINDEXEDLoad(const SDNode *N) {
2183 return N->getOpcode() == ISD::LOAD &&
2184 cast<LoadSDNode>(N)->getAddressingMode() == ISD::UNINDEXED;
2187 /// isNON_TRUNCStore - Returns true if the specified node is a non-truncating
2189 inline bool isNON_TRUNCStore(const SDNode *N) {
2190 return N->getOpcode() == ISD::STORE &&
2191 !cast<StoreSDNode>(N)->isTruncatingStore();
2194 /// isTRUNCStore - Returns true if the specified node is a truncating
2196 inline bool isTRUNCStore(const SDNode *N) {
2197 return N->getOpcode() == ISD::STORE &&
2198 cast<StoreSDNode>(N)->isTruncatingStore();
2203 } // end llvm namespace