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/ADT/alist.h"
29 #include "llvm/CodeGen/ValueTypes.h"
30 #include "llvm/CodeGen/MachineMemOperand.h"
31 #include "llvm/Support/Allocator.h"
32 #include "llvm/Support/RecyclingAllocator.h"
33 #include "llvm/Support/DataTypes.h"
40 class MachineBasicBlock;
41 class MachineConstantPoolValue;
43 class CompileUnitDesc;
44 template <typename T> struct DenseMapInfo;
45 template <typename T> struct simplify_type;
47 /// SDVTList - This represents a list of ValueType's that has been intern'd by
48 /// a SelectionDAG. Instances of this simple value class are returned by
49 /// SelectionDAG::getVTList(...).
53 unsigned short NumVTs;
56 /// ISD namespace - This namespace contains an enum which represents all of the
57 /// SelectionDAG node types and value types.
61 //===--------------------------------------------------------------------===//
62 /// ISD::NodeType enum - This enum defines all of the operators valid in a
66 // DELETED_NODE - This is an illegal flag value that is used to catch
67 // errors. This opcode is not a legal opcode for any node.
70 // EntryToken - This is the marker used to indicate the start of the region.
73 // Token factor - This node takes multiple tokens as input and produces a
74 // single token result. This is used to represent the fact that the operand
75 // operators are independent of each other.
78 // AssertSext, AssertZext - These nodes record if a register contains a
79 // value that has already been zero or sign extended from a narrower type.
80 // These nodes take two operands. The first is the node that has already
81 // been extended, and the second is a value type node indicating the width
83 AssertSext, AssertZext,
85 // Various leaf nodes.
86 BasicBlock, VALUETYPE, ARG_FLAGS, CONDCODE, Register,
88 GlobalAddress, GlobalTLSAddress, FrameIndex,
89 JumpTable, ConstantPool, ExternalSymbol,
91 // The address of the GOT
94 // FRAMEADDR, RETURNADDR - These nodes represent llvm.frameaddress and
95 // llvm.returnaddress on the DAG. These nodes take one operand, the index
96 // of the frame or return address to return. An index of zero corresponds
97 // to the current function's frame or return address, an index of one to the
98 // parent's frame or return address, and so on.
99 FRAMEADDR, RETURNADDR,
101 // FRAME_TO_ARGS_OFFSET - This node represents offset from frame pointer to
102 // first (possible) on-stack argument. This is needed for correct stack
103 // adjustment during unwind.
104 FRAME_TO_ARGS_OFFSET,
106 // RESULT, OUTCHAIN = EXCEPTIONADDR(INCHAIN) - This node represents the
107 // address of the exception block on entry to an landing pad block.
110 // RESULT, OUTCHAIN = EHSELECTION(INCHAIN, EXCEPTION) - This node represents
111 // the selection index of the exception thrown.
114 // OUTCHAIN = EH_RETURN(INCHAIN, OFFSET, HANDLER) - This node represents
115 // 'eh_return' gcc dwarf builtin, which is used to return from
116 // exception. The general meaning is: adjust stack by OFFSET and pass
117 // execution to HANDLER. Many platform-related details also :)
120 // TargetConstant* - Like Constant*, but the DAG does not do any folding or
121 // simplification of the constant.
125 // TargetGlobalAddress - Like GlobalAddress, but the DAG does no folding or
126 // anything else with this node, and this is valid in the target-specific
127 // dag, turning into a GlobalAddress operand.
129 TargetGlobalTLSAddress,
133 TargetExternalSymbol,
135 /// RESULT = INTRINSIC_WO_CHAIN(INTRINSICID, arg1, arg2, ...)
136 /// This node represents a target intrinsic function with no side effects.
137 /// The first operand is the ID number of the intrinsic from the
138 /// llvm::Intrinsic namespace. The operands to the intrinsic follow. The
139 /// node has returns the result of the intrinsic.
142 /// RESULT,OUTCHAIN = INTRINSIC_W_CHAIN(INCHAIN, INTRINSICID, arg1, ...)
143 /// This node represents a target intrinsic function with side effects that
144 /// returns a result. The first operand is a chain pointer. The second is
145 /// the ID number of the intrinsic from the llvm::Intrinsic namespace. The
146 /// operands to the intrinsic follow. The node has two results, the result
147 /// of the intrinsic and an output chain.
150 /// OUTCHAIN = INTRINSIC_VOID(INCHAIN, INTRINSICID, arg1, arg2, ...)
151 /// This node represents a target intrinsic function with side effects that
152 /// does not return a result. The first operand is a chain pointer. The
153 /// second is the ID number of the intrinsic from the llvm::Intrinsic
154 /// namespace. The operands to the intrinsic follow.
157 // CopyToReg - This node has three operands: a chain, a register number to
158 // set to this value, and a value.
161 // CopyFromReg - This node indicates that the input value is a virtual or
162 // physical register that is defined outside of the scope of this
163 // SelectionDAG. The register is available from the RegisterSDNode object.
166 // UNDEF - An undefined node
169 /// FORMAL_ARGUMENTS(CHAIN, CC#, ISVARARG, FLAG0, ..., FLAGn) - This node
170 /// represents the formal arguments for a function. CC# is a Constant value
171 /// indicating the calling convention of the function, and ISVARARG is a
172 /// flag that indicates whether the function is varargs or not. This node
173 /// has one result value for each incoming argument, plus one for the output
174 /// chain. It must be custom legalized. See description of CALL node for
175 /// FLAG argument contents explanation.
179 /// RV1, RV2...RVn, CHAIN = CALL(CHAIN, CC#, ISVARARG, ISTAILCALL, CALLEE,
180 /// ARG0, FLAG0, ARG1, FLAG1, ... ARGn, FLAGn)
181 /// This node represents a fully general function call, before the legalizer
182 /// runs. This has one result value for each argument / flag pair, plus
183 /// a chain result. It must be custom legalized. Flag argument indicates
184 /// misc. argument attributes. Currently:
186 /// Bit 1 - 'inreg' attribute
187 /// Bit 2 - 'sret' attribute
188 /// Bit 4 - 'byval' attribute
189 /// Bit 5 - 'nest' attribute
190 /// Bit 6-9 - alignment of byval structures
191 /// Bit 10-26 - size of byval structures
192 /// Bits 31:27 - argument ABI alignment in the first argument piece and
193 /// alignment '1' in other argument pieces.
196 // EXTRACT_ELEMENT - This is used to get the lower or upper (determined by
197 // a Constant, which is required to be operand #1) half of the integer or
198 // float value specified as operand #0. This is only for use before
199 // legalization, for values that will be broken into multiple registers.
202 // BUILD_PAIR - This is the opposite of EXTRACT_ELEMENT in some ways. Given
203 // two values of the same integer value type, this produces a value twice as
204 // big. Like EXTRACT_ELEMENT, this can only be used before legalization.
207 // MERGE_VALUES - This node takes multiple discrete operands and returns
208 // them all as its individual results. This nodes has exactly the same
209 // number of inputs and outputs, and is only valid before legalization.
210 // This node is useful for some pieces of the code generator that want to
211 // think about a single node with multiple results, not multiple nodes.
214 // Simple integer binary arithmetic operators.
215 ADD, SUB, MUL, SDIV, UDIV, SREM, UREM,
217 // SMUL_LOHI/UMUL_LOHI - Multiply two integers of type iN, producing
218 // a signed/unsigned value of type i[2*N], and return the full value as
219 // two results, each of type iN.
220 SMUL_LOHI, UMUL_LOHI,
222 // SDIVREM/UDIVREM - Divide two integers and produce both a quotient and
226 // CARRY_FALSE - This node is used when folding other nodes,
227 // like ADDC/SUBC, which indicate the carry result is always false.
230 // Carry-setting nodes for multiple precision addition and subtraction.
231 // These nodes take two operands of the same value type, and produce two
232 // results. The first result is the normal add or sub result, the second
233 // result is the carry flag result.
236 // Carry-using nodes for multiple precision addition and subtraction. These
237 // nodes take three operands: The first two are the normal lhs and rhs to
238 // the add or sub, and the third is the input carry flag. These nodes
239 // produce two results; the normal result of the add or sub, and the output
240 // carry flag. These nodes both read and write a carry flag to allow them
241 // to them to be chained together for add and sub of arbitrarily large
245 // Simple binary floating point operators.
246 FADD, FSUB, FMUL, FDIV, FREM,
248 // FCOPYSIGN(X, Y) - Return the value of X with the sign of Y. NOTE: This
249 // DAG node does not require that X and Y have the same type, just that they
250 // are both floating point. X and the result must have the same type.
251 // FCOPYSIGN(f32, f64) is allowed.
254 // INT = FGETSIGN(FP) - Return the sign bit of the specified floating point
255 // value as an integer 0/1 value.
258 /// BUILD_VECTOR(ELT0, ELT1, ELT2, ELT3,...) - Return a vector
259 /// with the specified, possibly variable, elements. The number of elements
260 /// is required to be a power of two.
263 /// INSERT_VECTOR_ELT(VECTOR, VAL, IDX) - Returns VECTOR with the element
264 /// at IDX replaced with VAL. If the type of VAL is larger than the vector
265 /// element type then VAL is truncated before replacement.
268 /// EXTRACT_VECTOR_ELT(VECTOR, IDX) - Returns a single element from VECTOR
269 /// identified by the (potentially variable) element number IDX.
272 /// CONCAT_VECTORS(VECTOR0, VECTOR1, ...) - Given a number of values of
273 /// vector type with the same length and element type, this produces a
274 /// concatenated vector result value, with length equal to the sum of the
275 /// lengths of the input vectors.
278 /// EXTRACT_SUBVECTOR(VECTOR, IDX) - Returns a subvector from VECTOR (an
279 /// vector value) starting with the (potentially variable) element number
280 /// IDX, which must be a multiple of the result vector length.
283 /// VECTOR_SHUFFLE(VEC1, VEC2, SHUFFLEVEC) - Returns a vector, of the same
284 /// type as VEC1/VEC2. SHUFFLEVEC is a BUILD_VECTOR of constant int values
285 /// (maybe of an illegal datatype) or undef that indicate which value each
286 /// result element will get. The elements of VEC1/VEC2 are enumerated in
287 /// order. This is quite similar to the Altivec 'vperm' instruction, except
288 /// that the indices must be constants and are in terms of the element size
289 /// of VEC1/VEC2, not in terms of bytes.
292 /// SCALAR_TO_VECTOR(VAL) - This represents the operation of loading a
293 /// scalar value into element 0 of the resultant vector type. The top
294 /// elements 1 to N-1 of the N-element vector are undefined.
297 // EXTRACT_SUBREG - This node is used to extract a sub-register value.
298 // This node takes a superreg and a constant sub-register index as operands.
299 // Note sub-register indices must be increasing. That is, if the
300 // sub-register index of a 8-bit sub-register is N, then the index for a
301 // 16-bit sub-register must be at least N+1.
304 // INSERT_SUBREG - This node is used to insert a sub-register value.
305 // This node takes a superreg, a subreg value, and a constant sub-register
306 // index as operands.
309 // MULHU/MULHS - Multiply high - Multiply two integers of type iN, producing
310 // an unsigned/signed value of type i[2*N], then return the top part.
313 // Bitwise operators - logical and, logical or, logical xor, shift left,
314 // shift right algebraic (shift in sign bits), shift right logical (shift in
315 // zeroes), rotate left, rotate right, and byteswap.
316 AND, OR, XOR, SHL, SRA, SRL, ROTL, ROTR, BSWAP,
318 // Counting operators
321 // Select(COND, TRUEVAL, FALSEVAL)
324 // Select with condition operator - This selects between a true value and
325 // a false value (ops #2 and #3) based on the boolean result of comparing
326 // the lhs and rhs (ops #0 and #1) of a conditional expression with the
327 // condition code in op #4, a CondCodeSDNode.
330 // SetCC operator - This evaluates to a boolean (i1) true value if the
331 // condition is true. The operands to this are the left and right operands
332 // to compare (ops #0, and #1) and the condition code to compare them with
333 // (op #2) as a CondCodeSDNode.
336 // Vector SetCC operator - This evaluates to a vector of integer elements
337 // with the high bit in each element set to true if the comparison is true
338 // and false if the comparison is false. All other bits in each element
339 // are undefined. The operands to this are the left and right operands
340 // to compare (ops #0, and #1) and the condition code to compare them with
341 // (op #2) as a CondCodeSDNode.
344 // SHL_PARTS/SRA_PARTS/SRL_PARTS - These operators are used for expanded
345 // integer shift operations, just like ADD/SUB_PARTS. The operation
347 // [Lo,Hi] = op [LoLHS,HiLHS], Amt
348 SHL_PARTS, SRA_PARTS, SRL_PARTS,
350 // Conversion operators. These are all single input single output
351 // operations. For all of these, the result type must be strictly
352 // wider or narrower (depending on the operation) than the source
355 // SIGN_EXTEND - Used for integer types, replicating the sign bit
359 // ZERO_EXTEND - Used for integer types, zeroing the new bits.
362 // ANY_EXTEND - Used for integer types. The high bits are undefined.
365 // TRUNCATE - Completely drop the high bits.
368 // [SU]INT_TO_FP - These operators convert integers (whose interpreted sign
369 // depends on the first letter) to floating point.
373 // SIGN_EXTEND_INREG - This operator atomically performs a SHL/SRA pair to
374 // sign extend a small value in a large integer register (e.g. sign
375 // extending the low 8 bits of a 32-bit register to fill the top 24 bits
376 // with the 7th bit). The size of the smaller type is indicated by the 1th
377 // operand, a ValueType node.
380 /// FP_TO_[US]INT - Convert a floating point value to a signed or unsigned
385 /// X = FP_ROUND(Y, TRUNC) - Rounding 'Y' from a larger floating point type
386 /// down to the precision of the destination VT. TRUNC is a flag, which is
387 /// always an integer that is zero or one. If TRUNC is 0, this is a
388 /// normal rounding, if it is 1, this FP_ROUND is known to not change the
391 /// The TRUNC = 1 case is used in cases where we know that the value will
392 /// not be modified by the node, because Y is not using any of the extra
393 /// precision of source type. This allows certain transformations like
394 /// FP_EXTEND(FP_ROUND(X,1)) -> X which are not safe for
395 /// FP_EXTEND(FP_ROUND(X,0)) because the extra bits aren't removed.
398 // FLT_ROUNDS_ - Returns current rounding mode:
401 // 1 Round to nearest
406 /// X = FP_ROUND_INREG(Y, VT) - This operator takes an FP register, and
407 /// rounds it to a floating point value. It then promotes it and returns it
408 /// in a register of the same size. This operation effectively just
409 /// discards excess precision. The type to round down to is specified by
410 /// the VT operand, a VTSDNode.
413 /// X = FP_EXTEND(Y) - Extend a smaller FP type into a larger FP type.
416 // BIT_CONVERT - Theis operator converts between integer and FP values, as
417 // if one was stored to memory as integer and the other was loaded from the
418 // same address (or equivalently for vector format conversions, etc). The
419 // source and result are required to have the same bit size (e.g.
420 // f32 <-> i32). This can also be used for int-to-int or fp-to-fp
421 // conversions, but that is a noop, deleted by getNode().
424 // FNEG, FABS, FSQRT, FSIN, FCOS, FPOWI, FPOW - Perform unary floating point
425 // negation, absolute value, square root, sine and cosine, powi, and pow
427 FNEG, FABS, FSQRT, FSIN, FCOS, FPOWI, FPOW,
429 // LOAD and STORE have token chains as their first operand, then the same
430 // operands as an LLVM load/store instruction, then an offset node that
431 // is added / subtracted from the base pointer to form the address (for
432 // indexed memory ops).
435 // DYNAMIC_STACKALLOC - Allocate some number of bytes on the stack aligned
436 // to a specified boundary. This node always has two return values: a new
437 // stack pointer value and a chain. The first operand is the token chain,
438 // the second is the number of bytes to allocate, and the third is the
439 // alignment boundary. The size is guaranteed to be a multiple of the stack
440 // alignment, and the alignment is guaranteed to be bigger than the stack
441 // alignment (if required) or 0 to get standard stack alignment.
444 // Control flow instructions. These all have token chains.
446 // BR - Unconditional branch. The first operand is the chain
447 // operand, the second is the MBB to branch to.
450 // BRIND - Indirect branch. The first operand is the chain, the second
451 // is the value to branch to, which must be of the same type as the target's
455 // BR_JT - Jumptable branch. The first operand is the chain, the second
456 // is the jumptable index, the last one is the jumptable entry index.
459 // BRCOND - Conditional branch. The first operand is the chain,
460 // the second is the condition, the third is the block to branch
461 // to if the condition is true.
464 // BR_CC - Conditional branch. The behavior is like that of SELECT_CC, in
465 // that the condition is represented as condition code, and two nodes to
466 // compare, rather than as a combined SetCC node. The operands in order are
467 // chain, cc, lhs, rhs, block to branch to if condition is true.
470 // RET - Return from function. The first operand is the chain,
471 // and any subsequent operands are pairs of return value and return value
472 // signness for the function. This operation can have variable number of
476 // INLINEASM - Represents an inline asm block. This node always has two
477 // return values: a chain and a flag result. The inputs are as follows:
478 // Operand #0 : Input chain.
479 // Operand #1 : a ExternalSymbolSDNode with a pointer to the asm string.
480 // Operand #2n+2: A RegisterNode.
481 // Operand #2n+3: A TargetConstant, indicating if the reg is a use/def
482 // Operand #last: Optional, an incoming flag.
485 // DBG_LABEL, EH_LABEL - Represents a label in mid basic block used to track
486 // locations needed for debug and exception handling tables. These nodes
487 // take a chain as input and return a chain.
491 // DECLARE - Represents a llvm.dbg.declare intrinsic. It's used to track
492 // local variable declarations for debugging information. First operand is
493 // a chain, while the next two operands are first two arguments (address
494 // and variable) of a llvm.dbg.declare instruction.
497 // STACKSAVE - STACKSAVE has one operand, an input chain. It produces a
498 // value, the same type as the pointer type for the system, and an output
502 // STACKRESTORE has two operands, an input chain and a pointer to restore to
503 // it returns an output chain.
506 // CALLSEQ_START/CALLSEQ_END - These operators mark the beginning and end of
507 // a call sequence, and carry arbitrary information that target might want
508 // to know. The first operand is a chain, the rest are specified by the
509 // target and not touched by the DAG optimizers.
510 // CALLSEQ_START..CALLSEQ_END pairs may not be nested.
511 CALLSEQ_START, // Beginning of a call sequence
512 CALLSEQ_END, // End of a call sequence
514 // VAARG - VAARG has three operands: an input chain, a pointer, and a
515 // SRCVALUE. It returns a pair of values: the vaarg value and a new chain.
518 // VACOPY - VACOPY has five operands: an input chain, a destination pointer,
519 // a source pointer, a SRCVALUE for the destination, and a SRCVALUE for the
523 // VAEND, VASTART - VAEND and VASTART have three operands: an input chain, a
524 // pointer, and a SRCVALUE.
527 // SRCVALUE - This is a node type that holds a Value* that is used to
528 // make reference to a value in the LLVM IR.
531 // MEMOPERAND - This is a node that contains a MachineMemOperand which
532 // records information about a memory reference. This is used to make
533 // AliasAnalysis queries from the backend.
536 // PCMARKER - This corresponds to the pcmarker intrinsic.
539 // READCYCLECOUNTER - This corresponds to the readcyclecounter intrinsic.
540 // The only operand is a chain and a value and a chain are produced. The
541 // value is the contents of the architecture specific cycle counter like
542 // register (or other high accuracy low latency clock source)
545 // HANDLENODE node - Used as a handle for various purposes.
548 // DBG_STOPPOINT - This node is used to represent a source location for
549 // debug info. It takes token chain as input, and carries a line number,
550 // column number, and a pointer to a CompileUnitDesc object identifying
551 // the containing compilation unit. It produces a token chain as output.
554 // DEBUG_LOC - This node is used to represent source line information
555 // embedded in the code. It takes a token chain as input, then a line
556 // number, then a column then a file id (provided by MachineModuleInfo.) It
557 // produces a token chain as output.
560 // TRAMPOLINE - This corresponds to the init_trampoline intrinsic.
561 // It takes as input a token chain, the pointer to the trampoline,
562 // the pointer to the nested function, the pointer to pass for the
563 // 'nest' parameter, a SRCVALUE for the trampoline and another for
564 // the nested function (allowing targets to access the original
565 // Function*). It produces the result of the intrinsic and a token
569 // TRAP - Trapping instruction
572 // PREFETCH - This corresponds to a prefetch intrinsic. It takes chains are
573 // their first operand. The other operands are the address to prefetch,
574 // read / write specifier, and locality specifier.
577 // OUTCHAIN = MEMBARRIER(INCHAIN, load-load, load-store, store-load,
578 // store-store, device)
579 // This corresponds to the memory.barrier intrinsic.
580 // it takes an input chain, 4 operands to specify the type of barrier, an
581 // operand specifying if the barrier applies to device and uncached memory
582 // and produces an output chain.
585 // Val, OUTCHAIN = ATOMIC_CMP_SWAP(INCHAIN, ptr, cmp, swap)
586 // this corresponds to the atomic.lcs intrinsic.
587 // cmp is compared to *ptr, and if equal, swap is stored in *ptr.
588 // the return is always the original value in *ptr
591 // Val, OUTCHAIN = ATOMIC_LOAD_ADD(INCHAIN, ptr, amt)
592 // this corresponds to the atomic.las intrinsic.
593 // *ptr + amt is stored to *ptr atomically.
594 // the return is always the original value in *ptr
597 // Val, OUTCHAIN = ATOMIC_SWAP(INCHAIN, ptr, amt)
598 // this corresponds to the atomic.swap intrinsic.
599 // amt is stored to *ptr atomically.
600 // the return is always the original value in *ptr
603 // Val, OUTCHAIN = ATOMIC_LOAD_SUB(INCHAIN, ptr, amt)
604 // this corresponds to the atomic.lss intrinsic.
605 // *ptr - amt is stored to *ptr atomically.
606 // the return is always the original value in *ptr
609 // Val, OUTCHAIN = ATOMIC_L[OpName]S(INCHAIN, ptr, amt)
610 // this corresponds to the atomic.[OpName] intrinsic.
611 // op(*ptr, amt) is stored to *ptr atomically.
612 // the return is always the original value in *ptr
622 // BUILTIN_OP_END - This must be the last enum value in this list.
628 /// isBuildVectorAllOnes - Return true if the specified node is a
629 /// BUILD_VECTOR where all of the elements are ~0 or undef.
630 bool isBuildVectorAllOnes(const SDNode *N);
632 /// isBuildVectorAllZeros - Return true if the specified node is a
633 /// BUILD_VECTOR where all of the elements are 0 or undef.
634 bool isBuildVectorAllZeros(const SDNode *N);
636 /// isScalarToVector - Return true if the specified node is a
637 /// ISD::SCALAR_TO_VECTOR node or a BUILD_VECTOR node where only the low
638 /// element is not an undef.
639 bool isScalarToVector(const SDNode *N);
641 /// isDebugLabel - Return true if the specified node represents a debug
642 /// label (i.e. ISD::DBG_LABEL or TargetInstrInfo::DBG_LABEL node).
643 bool isDebugLabel(const SDNode *N);
645 //===--------------------------------------------------------------------===//
646 /// MemIndexedMode enum - This enum defines the load / store indexed
647 /// addressing modes.
649 /// UNINDEXED "Normal" load / store. The effective address is already
650 /// computed and is available in the base pointer. The offset
651 /// operand is always undefined. In addition to producing a
652 /// chain, an unindexed load produces one value (result of the
653 /// load); an unindexed store does not produce a value.
655 /// PRE_INC Similar to the unindexed mode where the effective address is
656 /// PRE_DEC the value of the base pointer add / subtract the offset.
657 /// It considers the computation as being folded into the load /
658 /// store operation (i.e. the load / store does the address
659 /// computation as well as performing the memory transaction).
660 /// The base operand is always undefined. In addition to
661 /// producing a chain, pre-indexed load produces two values
662 /// (result of the load and the result of the address
663 /// computation); a pre-indexed store produces one value (result
664 /// of the address computation).
666 /// POST_INC The effective address is the value of the base pointer. The
667 /// POST_DEC value of the offset operand is then added to / subtracted
668 /// from the base after memory transaction. In addition to
669 /// producing a chain, post-indexed load produces two values
670 /// (the result of the load and the result of the base +/- offset
671 /// computation); a post-indexed store produces one value (the
672 /// the result of the base +/- offset computation).
674 enum MemIndexedMode {
683 //===--------------------------------------------------------------------===//
684 /// LoadExtType enum - This enum defines the three variants of LOADEXT
685 /// (load with extension).
687 /// SEXTLOAD loads the integer operand and sign extends it to a larger
688 /// integer result type.
689 /// ZEXTLOAD loads the integer operand and zero extends it to a larger
690 /// integer result type.
691 /// EXTLOAD is used for three things: floating point extending loads,
692 /// integer extending loads [the top bits are undefined], and vector
693 /// extending loads [load into low elt].
703 //===--------------------------------------------------------------------===//
704 /// ISD::CondCode enum - These are ordered carefully to make the bitfields
705 /// below work out, when considering SETFALSE (something that never exists
706 /// dynamically) as 0. "U" -> Unsigned (for integer operands) or Unordered
707 /// (for floating point), "L" -> Less than, "G" -> Greater than, "E" -> Equal
708 /// to. If the "N" column is 1, the result of the comparison is undefined if
709 /// the input is a NAN.
711 /// All of these (except for the 'always folded ops') should be handled for
712 /// floating point. For integer, only the SETEQ,SETNE,SETLT,SETLE,SETGT,
713 /// SETGE,SETULT,SETULE,SETUGT, and SETUGE opcodes are used.
715 /// Note that these are laid out in a specific order to allow bit-twiddling
716 /// to transform conditions.
718 // Opcode N U L G E Intuitive operation
719 SETFALSE, // 0 0 0 0 Always false (always folded)
720 SETOEQ, // 0 0 0 1 True if ordered and equal
721 SETOGT, // 0 0 1 0 True if ordered and greater than
722 SETOGE, // 0 0 1 1 True if ordered and greater than or equal
723 SETOLT, // 0 1 0 0 True if ordered and less than
724 SETOLE, // 0 1 0 1 True if ordered and less than or equal
725 SETONE, // 0 1 1 0 True if ordered and operands are unequal
726 SETO, // 0 1 1 1 True if ordered (no nans)
727 SETUO, // 1 0 0 0 True if unordered: isnan(X) | isnan(Y)
728 SETUEQ, // 1 0 0 1 True if unordered or equal
729 SETUGT, // 1 0 1 0 True if unordered or greater than
730 SETUGE, // 1 0 1 1 True if unordered, greater than, or equal
731 SETULT, // 1 1 0 0 True if unordered or less than
732 SETULE, // 1 1 0 1 True if unordered, less than, or equal
733 SETUNE, // 1 1 1 0 True if unordered or not equal
734 SETTRUE, // 1 1 1 1 Always true (always folded)
735 // Don't care operations: undefined if the input is a nan.
736 SETFALSE2, // 1 X 0 0 0 Always false (always folded)
737 SETEQ, // 1 X 0 0 1 True if equal
738 SETGT, // 1 X 0 1 0 True if greater than
739 SETGE, // 1 X 0 1 1 True if greater than or equal
740 SETLT, // 1 X 1 0 0 True if less than
741 SETLE, // 1 X 1 0 1 True if less than or equal
742 SETNE, // 1 X 1 1 0 True if not equal
743 SETTRUE2, // 1 X 1 1 1 Always true (always folded)
745 SETCC_INVALID // Marker value.
748 /// isSignedIntSetCC - Return true if this is a setcc instruction that
749 /// performs a signed comparison when used with integer operands.
750 inline bool isSignedIntSetCC(CondCode Code) {
751 return Code == SETGT || Code == SETGE || Code == SETLT || Code == SETLE;
754 /// isUnsignedIntSetCC - Return true if this is a setcc instruction that
755 /// performs an unsigned comparison when used with integer operands.
756 inline bool isUnsignedIntSetCC(CondCode Code) {
757 return Code == SETUGT || Code == SETUGE || Code == SETULT || Code == SETULE;
760 /// isTrueWhenEqual - Return true if the specified condition returns true if
761 /// the two operands to the condition are equal. Note that if one of the two
762 /// operands is a NaN, this value is meaningless.
763 inline bool isTrueWhenEqual(CondCode Cond) {
764 return ((int)Cond & 1) != 0;
767 /// getUnorderedFlavor - This function returns 0 if the condition is always
768 /// false if an operand is a NaN, 1 if the condition is always true if the
769 /// operand is a NaN, and 2 if the condition is undefined if the operand is a
771 inline unsigned getUnorderedFlavor(CondCode Cond) {
772 return ((int)Cond >> 3) & 3;
775 /// getSetCCInverse - Return the operation corresponding to !(X op Y), where
776 /// 'op' is a valid SetCC operation.
777 CondCode getSetCCInverse(CondCode Operation, bool isInteger);
779 /// getSetCCSwappedOperands - Return the operation corresponding to (Y op X)
780 /// when given the operation for (X op Y).
781 CondCode getSetCCSwappedOperands(CondCode Operation);
783 /// getSetCCOrOperation - Return the result of a logical OR between different
784 /// comparisons of identical values: ((X op1 Y) | (X op2 Y)). This
785 /// function returns SETCC_INVALID if it is not possible to represent the
786 /// resultant comparison.
787 CondCode getSetCCOrOperation(CondCode Op1, CondCode Op2, bool isInteger);
789 /// getSetCCAndOperation - Return the result of a logical AND between
790 /// different comparisons of identical values: ((X op1 Y) & (X op2 Y)). This
791 /// function returns SETCC_INVALID if it is not possible to represent the
792 /// resultant comparison.
793 CondCode getSetCCAndOperation(CondCode Op1, CondCode Op2, bool isInteger);
794 } // end llvm::ISD namespace
797 //===----------------------------------------------------------------------===//
798 /// SDOperand - Unlike LLVM values, Selection DAG nodes may return multiple
799 /// values as the result of a computation. Many nodes return multiple values,
800 /// from loads (which define a token and a return value) to ADDC (which returns
801 /// a result and a carry value), to calls (which may return an arbitrary number
804 /// As such, each use of a SelectionDAG computation must indicate the node that
805 /// computes it as well as which return value to use from that node. This pair
806 /// of information is represented with the SDOperand value type.
810 SDNode *Val; // The node defining the value we are using.
811 unsigned ResNo; // Which return value of the node we are using.
813 SDOperand() : Val(0), ResNo(0) {}
814 SDOperand(SDNode *val, unsigned resno) : Val(val), ResNo(resno) {}
816 bool operator==(const SDOperand &O) const {
817 return Val == O.Val && ResNo == O.ResNo;
819 bool operator!=(const SDOperand &O) const {
820 return !operator==(O);
822 bool operator<(const SDOperand &O) const {
823 return Val < O.Val || (Val == O.Val && ResNo < O.ResNo);
826 SDOperand getValue(unsigned R) const {
827 return SDOperand(Val, R);
830 // isOperandOf - Return true if this node is an operand of N.
831 bool isOperandOf(SDNode *N) const;
833 /// getValueType - Return the ValueType of the referenced return value.
835 inline MVT getValueType() const;
837 /// getValueSizeInBits - Returns the size of the value in bits.
839 unsigned getValueSizeInBits() const {
840 return getValueType().getSizeInBits();
843 // Forwarding methods - These forward to the corresponding methods in SDNode.
844 inline unsigned getOpcode() const;
845 inline unsigned getNumOperands() const;
846 inline const SDOperand &getOperand(unsigned i) const;
847 inline uint64_t getConstantOperandVal(unsigned i) const;
848 inline bool isTargetOpcode() const;
849 inline unsigned getTargetOpcode() const;
852 /// reachesChainWithoutSideEffects - Return true if this operand (which must
853 /// be a chain) reaches the specified operand without crossing any
854 /// side-effecting instructions. In practice, this looks through token
855 /// factors and non-volatile loads. In order to remain efficient, this only
856 /// looks a couple of nodes in, it does not do an exhaustive search.
857 bool reachesChainWithoutSideEffects(SDOperand Dest,
858 unsigned Depth = 2) const;
860 /// hasOneUse - Return true if there is exactly one operation using this
861 /// result value of the defining operator.
862 inline bool hasOneUse() const;
864 /// use_empty - Return true if there are no operations using this
865 /// result value of the defining operator.
866 inline bool use_empty() const;
870 template<> struct DenseMapInfo<SDOperand> {
871 static inline SDOperand getEmptyKey() {
872 return SDOperand((SDNode*)-1, -1U);
874 static inline SDOperand getTombstoneKey() {
875 return SDOperand((SDNode*)-1, 0);
877 static unsigned getHashValue(const SDOperand &Val) {
878 return ((unsigned)((uintptr_t)Val.Val >> 4) ^
879 (unsigned)((uintptr_t)Val.Val >> 9)) + Val.ResNo;
881 static bool isEqual(const SDOperand &LHS, const SDOperand &RHS) {
884 static bool isPod() { return true; }
887 /// simplify_type specializations - Allow casting operators to work directly on
888 /// SDOperands as if they were SDNode*'s.
889 template<> struct simplify_type<SDOperand> {
890 typedef SDNode* SimpleType;
891 static SimpleType getSimplifiedValue(const SDOperand &Val) {
892 return static_cast<SimpleType>(Val.Val);
895 template<> struct simplify_type<const SDOperand> {
896 typedef SDNode* SimpleType;
897 static SimpleType getSimplifiedValue(const SDOperand &Val) {
898 return static_cast<SimpleType>(Val.Val);
902 /// SDUse - Represents a use of the SDNode referred by
906 /// User - Parent node of this operand.
908 /// Prev, next - Pointers to the uses list of the SDNode referred by
913 SDUse(): Operand(), User(NULL), Prev(NULL), Next(NULL) {}
915 SDUse(SDNode *val, unsigned resno) :
916 Operand(val,resno), User(NULL), Prev(NULL), Next(NULL) {}
918 SDUse& operator= (const SDOperand& Op) {
925 SDUse& operator= (const SDUse& Op) {
932 SDUse * getNext() { return Next; }
934 SDNode *getUser() { return User; }
936 void setUser(SDNode *p) { User = p; }
938 operator SDOperand() const { return Operand; }
940 const SDOperand& getSDOperand() const { return Operand; }
942 SDNode* &getVal () { return Operand.Val; }
944 bool operator==(const SDOperand &O) const {
948 bool operator!=(const SDOperand &O) const {
949 return !(Operand == O);
952 bool operator<(const SDOperand &O) const {
957 void addToList(SDUse **List) {
959 if (Next) Next->Prev = &Next;
964 void removeFromList() {
966 if (Next) Next->Prev = Prev;
971 /// simplify_type specializations - Allow casting operators to work directly on
972 /// SDOperands as if they were SDNode*'s.
973 template<> struct simplify_type<SDUse> {
974 typedef SDNode* SimpleType;
975 static SimpleType getSimplifiedValue(const SDUse &Val) {
976 return static_cast<SimpleType>(Val.getSDOperand().Val);
979 template<> struct simplify_type<const SDUse> {
980 typedef SDNode* SimpleType;
981 static SimpleType getSimplifiedValue(const SDUse &Val) {
982 return static_cast<SimpleType>(Val.getSDOperand().Val);
987 /// SDOperandPtr - A helper SDOperand pointer class, that can handle
988 /// arrays of SDUse and arrays of SDOperand objects. This is required
989 /// in many places inside the SelectionDAG.
992 const SDOperand *ptr; // The pointer to the SDOperand object
993 int object_size; // The size of the object containg the SDOperand
995 SDOperandPtr() : ptr(0), object_size(0) {}
997 SDOperandPtr(SDUse * use_ptr) {
998 ptr = &use_ptr->getSDOperand();
999 object_size = (int)sizeof(SDUse);
1002 SDOperandPtr(const SDOperand * op_ptr) {
1004 object_size = (int)sizeof(SDOperand);
1007 const SDOperand operator *() { return *ptr; }
1008 const SDOperand *operator ->() { return ptr; }
1009 SDOperandPtr operator ++ () {
1010 ptr = (SDOperand*)((char *)ptr + object_size);
1014 SDOperandPtr operator ++ (int) {
1015 SDOperandPtr tmp = *this;
1016 ptr = (SDOperand*)((char *)ptr + object_size);
1020 SDOperand operator[] (int idx) const {
1021 return *(SDOperand*)((char*) ptr + object_size * idx);
1025 /// SDNode - Represents one node in the SelectionDAG.
1027 class SDNode : public FoldingSetNode {
1029 /// NodeType - The operation that this node performs.
1031 unsigned short NodeType;
1033 /// OperandsNeedDelete - This is true if OperandList was new[]'d. If true,
1034 /// then they will be delete[]'d when the node is destroyed.
1035 bool OperandsNeedDelete : 1;
1037 /// NodeId - Unique id per SDNode in the DAG.
1040 /// OperandList - The values that are used by this operation.
1044 /// ValueList - The types of the values this node defines. SDNode's may
1045 /// define multiple values simultaneously.
1046 const MVT *ValueList;
1048 /// NumOperands/NumValues - The number of entries in the Operand/Value list.
1049 unsigned short NumOperands, NumValues;
1051 /// Uses - List of uses for this SDNode.
1054 /// addUse - add SDUse to the list of uses.
1055 void addUse(SDUse &U) { U.addToList(&Uses); }
1057 // Out-of-line virtual method to give class a home.
1058 virtual void ANCHOR();
1061 assert(NumOperands == 0 && "Operand list not cleared before deletion");
1062 NodeType = ISD::DELETED_NODE;
1065 //===--------------------------------------------------------------------===//
1068 unsigned getOpcode() const { return NodeType; }
1069 bool isTargetOpcode() const { return NodeType >= ISD::BUILTIN_OP_END; }
1070 unsigned getTargetOpcode() const {
1071 assert(isTargetOpcode() && "Not a target opcode!");
1072 return NodeType - ISD::BUILTIN_OP_END;
1075 size_t use_size() const { return std::distance(use_begin(), use_end()); }
1076 bool use_empty() const { return Uses == NULL; }
1077 bool hasOneUse() const {
1078 return !use_empty() && next(use_begin()) == use_end();
1081 /// getNodeId - Return the unique node id.
1083 int getNodeId() const { return NodeId; }
1085 /// setNodeId - Set unique node id.
1086 void setNodeId(int Id) { NodeId = Id; }
1088 /// use_iterator - This class provides iterator support for SDUse
1089 /// operands that use a specific SDNode.
1091 : public forward_iterator<SDUse, ptrdiff_t> {
1093 explicit use_iterator(SDUse *op) : Op(op) {
1095 friend class SDNode;
1097 typedef forward_iterator<SDUse, ptrdiff_t>::reference reference;
1098 typedef forward_iterator<SDUse, ptrdiff_t>::pointer pointer;
1100 use_iterator(const use_iterator &I) : Op(I.Op) {}
1101 use_iterator() : Op(0) {}
1103 bool operator==(const use_iterator &x) const {
1106 bool operator!=(const use_iterator &x) const {
1107 return !operator==(x);
1110 /// atEnd - return true if this iterator is at the end of uses list.
1111 bool atEnd() const { return Op == 0; }
1113 // Iterator traversal: forward iteration only.
1114 use_iterator &operator++() { // Preincrement
1115 assert(Op && "Cannot increment end iterator!");
1120 use_iterator operator++(int) { // Postincrement
1121 use_iterator tmp = *this; ++*this; return tmp;
1125 /// getOperandNum - Retrive a number of a current operand.
1126 unsigned getOperandNum() const {
1127 assert(Op && "Cannot dereference end iterator!");
1128 return (unsigned)(Op - Op->getUser()->OperandList);
1131 /// Retrieve a reference to the current operand.
1132 SDUse &operator*() const {
1133 assert(Op && "Cannot dereference end iterator!");
1137 /// Retrieve a pointer to the current operand.
1138 SDUse *operator->() const {
1139 assert(Op && "Cannot dereference end iterator!");
1144 /// use_begin/use_end - Provide iteration support to walk over all uses
1147 use_iterator use_begin(SDNode *node) const {
1148 return use_iterator(node->Uses);
1151 use_iterator use_begin() const {
1152 return use_iterator(Uses);
1155 static use_iterator use_end() { return use_iterator(0); }
1158 /// hasNUsesOfValue - Return true if there are exactly NUSES uses of the
1159 /// indicated value. This method ignores uses of other values defined by this
1161 bool hasNUsesOfValue(unsigned NUses, unsigned Value) const;
1163 /// hasAnyUseOfValue - Return true if there are any use of the indicated
1164 /// value. This method ignores uses of other values defined by this operation.
1165 bool hasAnyUseOfValue(unsigned Value) const;
1167 /// isOnlyUseOf - Return true if this node is the only use of N.
1169 bool isOnlyUseOf(SDNode *N) const;
1171 /// isOperandOf - Return true if this node is an operand of N.
1173 bool isOperandOf(SDNode *N) const;
1175 /// isPredecessorOf - Return true if this node is a predecessor of N. This
1176 /// node is either an operand of N or it can be reached by recursively
1177 /// traversing up the operands.
1178 /// NOTE: this is an expensive method. Use it carefully.
1179 bool isPredecessorOf(SDNode *N) const;
1181 /// getNumOperands - Return the number of values used by this operation.
1183 unsigned getNumOperands() const { return NumOperands; }
1185 /// getConstantOperandVal - Helper method returns the integer value of a
1186 /// ConstantSDNode operand.
1187 uint64_t getConstantOperandVal(unsigned Num) const;
1189 const SDOperand &getOperand(unsigned Num) const {
1190 assert(Num < NumOperands && "Invalid child # of SDNode!");
1191 return OperandList[Num].getSDOperand();
1194 typedef SDUse* op_iterator;
1195 op_iterator op_begin() const { return OperandList; }
1196 op_iterator op_end() const { return OperandList+NumOperands; }
1199 SDVTList getVTList() const {
1200 SDVTList X = { ValueList, NumValues };
1204 /// getNumValues - Return the number of values defined/returned by this
1207 unsigned getNumValues() const { return NumValues; }
1209 /// getValueType - Return the type of a specified result.
1211 MVT getValueType(unsigned ResNo) const {
1212 assert(ResNo < NumValues && "Illegal result number!");
1213 return ValueList[ResNo];
1216 /// getValueSizeInBits - Returns MVT::getSizeInBits(getValueType(ResNo)).
1218 unsigned getValueSizeInBits(unsigned ResNo) const {
1219 return getValueType(ResNo).getSizeInBits();
1222 typedef const MVT* value_iterator;
1223 value_iterator value_begin() const { return ValueList; }
1224 value_iterator value_end() const { return ValueList+NumValues; }
1226 /// getOperationName - Return the opcode of this operation for printing.
1228 std::string getOperationName(const SelectionDAG *G = 0) const;
1229 static const char* getIndexedModeName(ISD::MemIndexedMode AM);
1231 void dump(const SelectionDAG *G) const;
1233 static bool classof(const SDNode *) { return true; }
1235 /// Profile - Gather unique data for the node.
1237 void Profile(FoldingSetNodeID &ID);
1240 friend class SelectionDAG;
1242 /// getValueTypeList - Return a pointer to the specified value type.
1244 static const MVT *getValueTypeList(MVT VT);
1245 static SDVTList getSDVTList(MVT VT) {
1246 SDVTList Ret = { getValueTypeList(VT), 1 };
1250 SDNode(unsigned Opc, SDVTList VTs, const SDOperand *Ops, unsigned NumOps)
1251 : NodeType(Opc), NodeId(-1), Uses(NULL) {
1252 OperandsNeedDelete = true;
1253 NumOperands = NumOps;
1254 OperandList = NumOps ? new SDUse[NumOperands] : 0;
1256 for (unsigned i = 0; i != NumOps; ++i) {
1257 OperandList[i] = Ops[i];
1258 OperandList[i].setUser(this);
1259 Ops[i].Val->addUse(OperandList[i]);
1262 ValueList = VTs.VTs;
1263 NumValues = VTs.NumVTs;
1266 SDNode(unsigned Opc, SDVTList VTs, const SDUse *Ops, unsigned NumOps)
1267 : NodeType(Opc), NodeId(-1), Uses(NULL) {
1268 OperandsNeedDelete = true;
1269 NumOperands = NumOps;
1270 OperandList = NumOps ? new SDUse[NumOperands] : 0;
1272 for (unsigned i = 0; i != NumOps; ++i) {
1273 OperandList[i] = Ops[i];
1274 OperandList[i].setUser(this);
1275 Ops[i].getSDOperand().Val->addUse(OperandList[i]);
1278 ValueList = VTs.VTs;
1279 NumValues = VTs.NumVTs;
1282 SDNode(unsigned Opc, SDVTList VTs)
1283 : NodeType(Opc), NodeId(-1), Uses(NULL) {
1284 OperandsNeedDelete = false; // Operands set with InitOperands.
1287 ValueList = VTs.VTs;
1288 NumValues = VTs.NumVTs;
1291 /// InitOperands - Initialize the operands list of this node with the
1292 /// specified values, which are part of the node (thus they don't need to be
1293 /// copied in or allocated).
1294 void InitOperands(SDUse *Ops, unsigned NumOps) {
1295 assert(OperandList == 0 && "Operands already set!");
1296 NumOperands = NumOps;
1300 for (unsigned i = 0; i != NumOps; ++i) {
1301 OperandList[i].setUser(this);
1302 Ops[i].getVal()->addUse(OperandList[i]);
1306 /// DropOperands - Release the operands and set this node to have
1307 /// zero operands. This should only be used by HandleSDNode to clear
1308 /// its operand list.
1309 void DropOperands();
1311 /// MorphNodeTo - This frees the operands of the current node, resets the
1312 /// opcode, types, and operands to the specified value. This should only be
1313 /// used by the SelectionDAG class.
1314 void MorphNodeTo(unsigned Opc, SDVTList L,
1315 const SDOperand *Ops, unsigned NumOps,
1316 SmallVectorImpl<SDNode *> &DeadNodes);
1318 void addUser(unsigned i, SDNode *User) {
1319 assert(User->OperandList[i].getUser() && "Node without parent");
1320 addUse(User->OperandList[i]);
1323 void removeUser(unsigned i, SDNode *User) {
1324 assert(User->OperandList[i].getUser() && "Node without parent");
1325 SDUse &Op = User->OperandList[i];
1326 Op.removeFromList();
1331 // Define inline functions from the SDOperand class.
1333 inline unsigned SDOperand::getOpcode() const {
1334 return Val->getOpcode();
1336 inline MVT SDOperand::getValueType() const {
1337 return Val->getValueType(ResNo);
1339 inline unsigned SDOperand::getNumOperands() const {
1340 return Val->getNumOperands();
1342 inline const SDOperand &SDOperand::getOperand(unsigned i) const {
1343 return Val->getOperand(i);
1345 inline uint64_t SDOperand::getConstantOperandVal(unsigned i) const {
1346 return Val->getConstantOperandVal(i);
1348 inline bool SDOperand::isTargetOpcode() const {
1349 return Val->isTargetOpcode();
1351 inline unsigned SDOperand::getTargetOpcode() const {
1352 return Val->getTargetOpcode();
1354 inline bool SDOperand::hasOneUse() const {
1355 return Val->hasNUsesOfValue(1, ResNo);
1357 inline bool SDOperand::use_empty() const {
1358 return !Val->hasAnyUseOfValue(ResNo);
1361 /// UnarySDNode - This class is used for single-operand SDNodes. This is solely
1362 /// to allow co-allocation of node operands with the node itself.
1363 class UnarySDNode : public SDNode {
1364 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1367 UnarySDNode(unsigned Opc, SDVTList VTs, SDOperand X)
1368 : SDNode(Opc, VTs) {
1370 InitOperands(&Op, 1);
1374 /// BinarySDNode - This class is used for two-operand SDNodes. This is solely
1375 /// to allow co-allocation of node operands with the node itself.
1376 class BinarySDNode : public SDNode {
1377 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1380 BinarySDNode(unsigned Opc, SDVTList VTs, SDOperand X, SDOperand Y)
1381 : SDNode(Opc, VTs) {
1384 InitOperands(Ops, 2);
1388 /// TernarySDNode - This class is used for three-operand SDNodes. This is solely
1389 /// to allow co-allocation of node operands with the node itself.
1390 class TernarySDNode : public SDNode {
1391 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1394 TernarySDNode(unsigned Opc, SDVTList VTs, SDOperand X, SDOperand Y,
1396 : SDNode(Opc, VTs) {
1400 InitOperands(Ops, 3);
1405 /// HandleSDNode - This class is used to form a handle around another node that
1406 /// is persistant and is updated across invocations of replaceAllUsesWith on its
1407 /// operand. This node should be directly created by end-users and not added to
1408 /// the AllNodes list.
1409 class HandleSDNode : public SDNode {
1410 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1413 // FIXME: Remove the "noinline" attribute once <rdar://problem/5852746> is
1416 explicit __attribute__((__noinline__)) HandleSDNode(SDOperand X)
1418 explicit HandleSDNode(SDOperand X)
1420 : SDNode(ISD::HANDLENODE, getSDVTList(MVT::Other)) {
1422 InitOperands(&Op, 1);
1425 SDUse getValue() const { return Op; }
1428 /// Abstact virtual class for operations for memory operations
1429 class MemSDNode : public SDNode {
1430 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1433 // MemoryVT - VT of in-memory value.
1436 //! SrcValue - Memory location for alias analysis.
1437 const Value *SrcValue;
1439 //! SVOffset - Memory location offset. Note that base is defined in MemSDNode
1442 /// Flags - the low bit indicates whether this is a volatile reference;
1443 /// the remainder is a log2 encoding of the alignment in bytes.
1447 MemSDNode(unsigned Opc, SDVTList VTs, MVT MemoryVT,
1448 const Value *srcValue, int SVOff,
1449 unsigned alignment, bool isvolatile);
1451 /// Returns alignment and volatility of the memory access
1452 unsigned getAlignment() const { return (1u << (Flags >> 1)) >> 1; }
1453 bool isVolatile() const { return Flags & 1; }
1455 /// Returns the SrcValue and offset that describes the location of the access
1456 const Value *getSrcValue() const { return SrcValue; }
1457 int getSrcValueOffset() const { return SVOffset; }
1459 /// getMemoryVT - Return the type of the in-memory value.
1460 MVT getMemoryVT() const { return MemoryVT; }
1462 /// getMemOperand - Return a MachineMemOperand object describing the memory
1463 /// reference performed by operation.
1464 MachineMemOperand getMemOperand() const;
1466 const SDOperand &getChain() const { return getOperand(0); }
1467 const SDOperand &getBasePtr() const {
1468 return getOperand(getOpcode() == ISD::STORE ? 2 : 1);
1471 // Methods to support isa and dyn_cast
1472 static bool classof(const MemSDNode *) { return true; }
1473 static bool classof(const SDNode *N) {
1474 return N->getOpcode() == ISD::LOAD ||
1475 N->getOpcode() == ISD::STORE ||
1476 N->getOpcode() == ISD::ATOMIC_CMP_SWAP ||
1477 N->getOpcode() == ISD::ATOMIC_LOAD_ADD ||
1478 N->getOpcode() == ISD::ATOMIC_SWAP ||
1479 N->getOpcode() == ISD::ATOMIC_LOAD_SUB ||
1480 N->getOpcode() == ISD::ATOMIC_LOAD_AND ||
1481 N->getOpcode() == ISD::ATOMIC_LOAD_OR ||
1482 N->getOpcode() == ISD::ATOMIC_LOAD_XOR ||
1483 N->getOpcode() == ISD::ATOMIC_LOAD_NAND ||
1484 N->getOpcode() == ISD::ATOMIC_LOAD_MIN ||
1485 N->getOpcode() == ISD::ATOMIC_LOAD_MAX ||
1486 N->getOpcode() == ISD::ATOMIC_LOAD_UMIN ||
1487 N->getOpcode() == ISD::ATOMIC_LOAD_UMAX;
1491 /// Atomic operations node
1492 class AtomicSDNode : public MemSDNode {
1493 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1497 // Opc: opcode for atomic
1498 // VTL: value type list
1499 // Chain: memory chain for operaand
1500 // Ptr: address to update as a SDOperand
1501 // Cmp: compare value
1503 // SrcVal: address to update as a Value (used for MemOperand)
1504 // Align: alignment of memory
1505 AtomicSDNode(unsigned Opc, SDVTList VTL, SDOperand Chain, SDOperand Ptr,
1506 SDOperand Cmp, SDOperand Swp, const Value* SrcVal,
1508 : MemSDNode(Opc, VTL, Cmp.getValueType(), SrcVal, /*SVOffset=*/0,
1509 Align, /*isVolatile=*/true) {
1514 InitOperands(Ops, 4);
1516 AtomicSDNode(unsigned Opc, SDVTList VTL, SDOperand Chain, SDOperand Ptr,
1517 SDOperand Val, const Value* SrcVal, unsigned Align=0)
1518 : MemSDNode(Opc, VTL, Val.getValueType(), SrcVal, /*SVOffset=*/0,
1519 Align, /*isVolatile=*/true) {
1523 InitOperands(Ops, 3);
1526 const SDOperand &getBasePtr() const { return getOperand(1); }
1527 const SDOperand &getVal() const { return getOperand(2); }
1529 bool isCompareAndSwap() const { return getOpcode() == ISD::ATOMIC_CMP_SWAP; }
1531 // Methods to support isa and dyn_cast
1532 static bool classof(const AtomicSDNode *) { return true; }
1533 static bool classof(const SDNode *N) {
1534 return N->getOpcode() == ISD::ATOMIC_CMP_SWAP ||
1535 N->getOpcode() == ISD::ATOMIC_LOAD_ADD ||
1536 N->getOpcode() == ISD::ATOMIC_SWAP ||
1537 N->getOpcode() == ISD::ATOMIC_LOAD_SUB ||
1538 N->getOpcode() == ISD::ATOMIC_LOAD_AND ||
1539 N->getOpcode() == ISD::ATOMIC_LOAD_OR ||
1540 N->getOpcode() == ISD::ATOMIC_LOAD_XOR ||
1541 N->getOpcode() == ISD::ATOMIC_LOAD_NAND ||
1542 N->getOpcode() == ISD::ATOMIC_LOAD_MIN ||
1543 N->getOpcode() == ISD::ATOMIC_LOAD_MAX ||
1544 N->getOpcode() == ISD::ATOMIC_LOAD_UMIN ||
1545 N->getOpcode() == ISD::ATOMIC_LOAD_UMAX;
1549 class ConstantSDNode : public SDNode {
1551 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1553 friend class SelectionDAG;
1554 ConstantSDNode(bool isTarget, const APInt &val, MVT VT)
1555 : SDNode(isTarget ? ISD::TargetConstant : ISD::Constant, getSDVTList(VT)),
1560 const APInt &getAPIntValue() const { return Value; }
1561 uint64_t getValue() const { return Value.getZExtValue(); }
1563 int64_t getSignExtended() const {
1564 unsigned Bits = getValueType(0).getSizeInBits();
1565 return ((int64_t)Value.getZExtValue() << (64-Bits)) >> (64-Bits);
1568 bool isNullValue() const { return Value == 0; }
1569 bool isAllOnesValue() const {
1570 return Value == getValueType(0).getIntegerVTBitMask();
1573 static bool classof(const ConstantSDNode *) { return true; }
1574 static bool classof(const SDNode *N) {
1575 return N->getOpcode() == ISD::Constant ||
1576 N->getOpcode() == ISD::TargetConstant;
1580 class ConstantFPSDNode : public SDNode {
1582 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1584 friend class SelectionDAG;
1585 ConstantFPSDNode(bool isTarget, const APFloat& val, MVT VT)
1586 : SDNode(isTarget ? ISD::TargetConstantFP : ISD::ConstantFP,
1587 getSDVTList(VT)), Value(val) {
1591 const APFloat& getValueAPF() const { return Value; }
1593 /// isExactlyValue - We don't rely on operator== working on double values, as
1594 /// it returns true for things that are clearly not equal, like -0.0 and 0.0.
1595 /// As such, this method can be used to do an exact bit-for-bit comparison of
1596 /// two floating point values.
1598 /// We leave the version with the double argument here because it's just so
1599 /// convenient to write "2.0" and the like. Without this function we'd
1600 /// have to duplicate its logic everywhere it's called.
1601 bool isExactlyValue(double V) const {
1602 // convert is not supported on this type
1603 if (&Value.getSemantics() == &APFloat::PPCDoubleDouble)
1606 Tmp.convert(Value.getSemantics(), APFloat::rmNearestTiesToEven);
1607 return isExactlyValue(Tmp);
1609 bool isExactlyValue(const APFloat& V) const;
1611 bool isValueValidForType(MVT VT, const APFloat& Val);
1613 static bool classof(const ConstantFPSDNode *) { return true; }
1614 static bool classof(const SDNode *N) {
1615 return N->getOpcode() == ISD::ConstantFP ||
1616 N->getOpcode() == ISD::TargetConstantFP;
1620 class GlobalAddressSDNode : public SDNode {
1621 GlobalValue *TheGlobal;
1623 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1625 friend class SelectionDAG;
1626 GlobalAddressSDNode(bool isTarget, const GlobalValue *GA, MVT VT, int o = 0);
1629 GlobalValue *getGlobal() const { return TheGlobal; }
1630 int getOffset() const { return Offset; }
1632 static bool classof(const GlobalAddressSDNode *) { return true; }
1633 static bool classof(const SDNode *N) {
1634 return N->getOpcode() == ISD::GlobalAddress ||
1635 N->getOpcode() == ISD::TargetGlobalAddress ||
1636 N->getOpcode() == ISD::GlobalTLSAddress ||
1637 N->getOpcode() == ISD::TargetGlobalTLSAddress;
1641 class FrameIndexSDNode : public SDNode {
1643 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1645 friend class SelectionDAG;
1646 FrameIndexSDNode(int fi, MVT VT, bool isTarg)
1647 : SDNode(isTarg ? ISD::TargetFrameIndex : ISD::FrameIndex, getSDVTList(VT)),
1652 int getIndex() const { return FI; }
1654 static bool classof(const FrameIndexSDNode *) { return true; }
1655 static bool classof(const SDNode *N) {
1656 return N->getOpcode() == ISD::FrameIndex ||
1657 N->getOpcode() == ISD::TargetFrameIndex;
1661 class JumpTableSDNode : public SDNode {
1663 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1665 friend class SelectionDAG;
1666 JumpTableSDNode(int jti, MVT VT, bool isTarg)
1667 : SDNode(isTarg ? ISD::TargetJumpTable : ISD::JumpTable, getSDVTList(VT)),
1672 int getIndex() const { return JTI; }
1674 static bool classof(const JumpTableSDNode *) { return true; }
1675 static bool classof(const SDNode *N) {
1676 return N->getOpcode() == ISD::JumpTable ||
1677 N->getOpcode() == ISD::TargetJumpTable;
1681 class ConstantPoolSDNode : public SDNode {
1684 MachineConstantPoolValue *MachineCPVal;
1686 int Offset; // It's a MachineConstantPoolValue if top bit is set.
1688 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1690 friend class SelectionDAG;
1691 ConstantPoolSDNode(bool isTarget, Constant *c, MVT VT, int o=0)
1692 : SDNode(isTarget ? ISD::TargetConstantPool : ISD::ConstantPool,
1693 getSDVTList(VT)), Offset(o), Alignment(0) {
1694 assert((int)Offset >= 0 && "Offset is too large");
1697 ConstantPoolSDNode(bool isTarget, Constant *c, MVT VT, int o, unsigned Align)
1698 : SDNode(isTarget ? ISD::TargetConstantPool : ISD::ConstantPool,
1699 getSDVTList(VT)), Offset(o), Alignment(Align) {
1700 assert((int)Offset >= 0 && "Offset is too large");
1703 ConstantPoolSDNode(bool isTarget, MachineConstantPoolValue *v,
1705 : SDNode(isTarget ? ISD::TargetConstantPool : ISD::ConstantPool,
1706 getSDVTList(VT)), Offset(o), Alignment(0) {
1707 assert((int)Offset >= 0 && "Offset is too large");
1708 Val.MachineCPVal = v;
1709 Offset |= 1 << (sizeof(unsigned)*8-1);
1711 ConstantPoolSDNode(bool isTarget, MachineConstantPoolValue *v,
1712 MVT VT, int o, unsigned Align)
1713 : SDNode(isTarget ? ISD::TargetConstantPool : ISD::ConstantPool,
1714 getSDVTList(VT)), Offset(o), Alignment(Align) {
1715 assert((int)Offset >= 0 && "Offset is too large");
1716 Val.MachineCPVal = v;
1717 Offset |= 1 << (sizeof(unsigned)*8-1);
1721 bool isMachineConstantPoolEntry() const {
1722 return (int)Offset < 0;
1725 Constant *getConstVal() const {
1726 assert(!isMachineConstantPoolEntry() && "Wrong constantpool type");
1727 return Val.ConstVal;
1730 MachineConstantPoolValue *getMachineCPVal() const {
1731 assert(isMachineConstantPoolEntry() && "Wrong constantpool type");
1732 return Val.MachineCPVal;
1735 int getOffset() const {
1736 return Offset & ~(1 << (sizeof(unsigned)*8-1));
1739 // Return the alignment of this constant pool object, which is either 0 (for
1740 // default alignment) or log2 of the desired value.
1741 unsigned getAlignment() const { return Alignment; }
1743 const Type *getType() const;
1745 static bool classof(const ConstantPoolSDNode *) { return true; }
1746 static bool classof(const SDNode *N) {
1747 return N->getOpcode() == ISD::ConstantPool ||
1748 N->getOpcode() == ISD::TargetConstantPool;
1752 class BasicBlockSDNode : public SDNode {
1753 MachineBasicBlock *MBB;
1754 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1756 friend class SelectionDAG;
1757 explicit BasicBlockSDNode(MachineBasicBlock *mbb)
1758 : SDNode(ISD::BasicBlock, getSDVTList(MVT::Other)), MBB(mbb) {
1762 MachineBasicBlock *getBasicBlock() const { return MBB; }
1764 static bool classof(const BasicBlockSDNode *) { return true; }
1765 static bool classof(const SDNode *N) {
1766 return N->getOpcode() == ISD::BasicBlock;
1770 /// SrcValueSDNode - An SDNode that holds an arbitrary LLVM IR Value. This is
1771 /// used when the SelectionDAG needs to make a simple reference to something
1772 /// in the LLVM IR representation.
1774 /// Note that this is not used for carrying alias information; that is done
1775 /// with MemOperandSDNode, which includes a Value which is required to be a
1776 /// pointer, and several other fields specific to memory references.
1778 class SrcValueSDNode : public SDNode {
1780 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1782 friend class SelectionDAG;
1783 /// Create a SrcValue for a general value.
1784 explicit SrcValueSDNode(const Value *v)
1785 : SDNode(ISD::SRCVALUE, getSDVTList(MVT::Other)), V(v) {}
1788 /// getValue - return the contained Value.
1789 const Value *getValue() const { return V; }
1791 static bool classof(const SrcValueSDNode *) { return true; }
1792 static bool classof(const SDNode *N) {
1793 return N->getOpcode() == ISD::SRCVALUE;
1798 /// MemOperandSDNode - An SDNode that holds a MachineMemOperand. This is
1799 /// used to represent a reference to memory after ISD::LOAD
1800 /// and ISD::STORE have been lowered.
1802 class MemOperandSDNode : public SDNode {
1803 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1805 friend class SelectionDAG;
1806 /// Create a MachineMemOperand node
1807 explicit MemOperandSDNode(const MachineMemOperand &mo)
1808 : SDNode(ISD::MEMOPERAND, getSDVTList(MVT::Other)), MO(mo) {}
1811 /// MO - The contained MachineMemOperand.
1812 const MachineMemOperand MO;
1814 static bool classof(const MemOperandSDNode *) { return true; }
1815 static bool classof(const SDNode *N) {
1816 return N->getOpcode() == ISD::MEMOPERAND;
1821 class RegisterSDNode : public SDNode {
1823 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1825 friend class SelectionDAG;
1826 RegisterSDNode(unsigned reg, MVT VT)
1827 : SDNode(ISD::Register, getSDVTList(VT)), Reg(reg) {
1831 unsigned getReg() const { return Reg; }
1833 static bool classof(const RegisterSDNode *) { return true; }
1834 static bool classof(const SDNode *N) {
1835 return N->getOpcode() == ISD::Register;
1839 class DbgStopPointSDNode : public SDNode {
1843 const CompileUnitDesc *CU;
1844 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1846 friend class SelectionDAG;
1847 DbgStopPointSDNode(SDOperand ch, unsigned l, unsigned c,
1848 const CompileUnitDesc *cu)
1849 : SDNode(ISD::DBG_STOPPOINT, getSDVTList(MVT::Other)),
1850 Line(l), Column(c), CU(cu) {
1852 InitOperands(&Chain, 1);
1855 unsigned getLine() const { return Line; }
1856 unsigned getColumn() const { return Column; }
1857 const CompileUnitDesc *getCompileUnit() const { return CU; }
1859 static bool classof(const DbgStopPointSDNode *) { return true; }
1860 static bool classof(const SDNode *N) {
1861 return N->getOpcode() == ISD::DBG_STOPPOINT;
1865 class LabelSDNode : public SDNode {
1868 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1870 friend class SelectionDAG;
1871 LabelSDNode(unsigned NodeTy, SDOperand ch, unsigned id)
1872 : SDNode(NodeTy, getSDVTList(MVT::Other)), LabelID(id) {
1874 InitOperands(&Chain, 1);
1877 unsigned getLabelID() const { return LabelID; }
1879 static bool classof(const LabelSDNode *) { return true; }
1880 static bool classof(const SDNode *N) {
1881 return N->getOpcode() == ISD::DBG_LABEL ||
1882 N->getOpcode() == ISD::EH_LABEL;
1886 class ExternalSymbolSDNode : public SDNode {
1888 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1890 friend class SelectionDAG;
1891 ExternalSymbolSDNode(bool isTarget, const char *Sym, MVT VT)
1892 : SDNode(isTarget ? ISD::TargetExternalSymbol : ISD::ExternalSymbol,
1893 getSDVTList(VT)), Symbol(Sym) {
1897 const char *getSymbol() const { return Symbol; }
1899 static bool classof(const ExternalSymbolSDNode *) { return true; }
1900 static bool classof(const SDNode *N) {
1901 return N->getOpcode() == ISD::ExternalSymbol ||
1902 N->getOpcode() == ISD::TargetExternalSymbol;
1906 class CondCodeSDNode : public SDNode {
1907 ISD::CondCode Condition;
1908 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1910 friend class SelectionDAG;
1911 explicit CondCodeSDNode(ISD::CondCode Cond)
1912 : SDNode(ISD::CONDCODE, getSDVTList(MVT::Other)), Condition(Cond) {
1916 ISD::CondCode get() const { return Condition; }
1918 static bool classof(const CondCodeSDNode *) { return true; }
1919 static bool classof(const SDNode *N) {
1920 return N->getOpcode() == ISD::CONDCODE;
1927 static const uint64_t NoFlagSet = 0ULL;
1928 static const uint64_t ZExt = 1ULL<<0; ///< Zero extended
1929 static const uint64_t ZExtOffs = 0;
1930 static const uint64_t SExt = 1ULL<<1; ///< Sign extended
1931 static const uint64_t SExtOffs = 1;
1932 static const uint64_t InReg = 1ULL<<2; ///< Passed in register
1933 static const uint64_t InRegOffs = 2;
1934 static const uint64_t SRet = 1ULL<<3; ///< Hidden struct-ret ptr
1935 static const uint64_t SRetOffs = 3;
1936 static const uint64_t ByVal = 1ULL<<4; ///< Struct passed by value
1937 static const uint64_t ByValOffs = 4;
1938 static const uint64_t Nest = 1ULL<<5; ///< Nested fn static chain
1939 static const uint64_t NestOffs = 5;
1940 static const uint64_t ByValAlign = 0xFULL << 6; //< Struct alignment
1941 static const uint64_t ByValAlignOffs = 6;
1942 static const uint64_t Split = 1ULL << 10;
1943 static const uint64_t SplitOffs = 10;
1944 static const uint64_t OrigAlign = 0x1FULL<<27;
1945 static const uint64_t OrigAlignOffs = 27;
1946 static const uint64_t ByValSize = 0xffffffffULL << 32; //< Struct size
1947 static const uint64_t ByValSizeOffs = 32;
1949 static const uint64_t One = 1ULL; //< 1 of this type, for shifts
1953 ArgFlagsTy() : Flags(0) { }
1955 bool isZExt() const { return Flags & ZExt; }
1956 void setZExt() { Flags |= One << ZExtOffs; }
1958 bool isSExt() const { return Flags & SExt; }
1959 void setSExt() { Flags |= One << SExtOffs; }
1961 bool isInReg() const { return Flags & InReg; }
1962 void setInReg() { Flags |= One << InRegOffs; }
1964 bool isSRet() const { return Flags & SRet; }
1965 void setSRet() { Flags |= One << SRetOffs; }
1967 bool isByVal() const { return Flags & ByVal; }
1968 void setByVal() { Flags |= One << ByValOffs; }
1970 bool isNest() const { return Flags & Nest; }
1971 void setNest() { Flags |= One << NestOffs; }
1973 unsigned getByValAlign() const {
1975 ((One << ((Flags & ByValAlign) >> ByValAlignOffs)) / 2);
1977 void setByValAlign(unsigned A) {
1978 Flags = (Flags & ~ByValAlign) |
1979 (uint64_t(Log2_32(A) + 1) << ByValAlignOffs);
1982 bool isSplit() const { return Flags & Split; }
1983 void setSplit() { Flags |= One << SplitOffs; }
1985 unsigned getOrigAlign() const {
1987 ((One << ((Flags & OrigAlign) >> OrigAlignOffs)) / 2);
1989 void setOrigAlign(unsigned A) {
1990 Flags = (Flags & ~OrigAlign) |
1991 (uint64_t(Log2_32(A) + 1) << OrigAlignOffs);
1994 unsigned getByValSize() const {
1995 return (unsigned)((Flags & ByValSize) >> ByValSizeOffs);
1997 void setByValSize(unsigned S) {
1998 Flags = (Flags & ~ByValSize) | (uint64_t(S) << ByValSizeOffs);
2001 /// getArgFlagsString - Returns the flags as a string, eg: "zext align:4".
2002 std::string getArgFlagsString();
2004 /// getRawBits - Represent the flags as a bunch of bits.
2005 uint64_t getRawBits() const { return Flags; }
2009 /// ARG_FLAGSSDNode - Leaf node holding parameter flags.
2010 class ARG_FLAGSSDNode : public SDNode {
2011 ISD::ArgFlagsTy TheFlags;
2012 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
2014 friend class SelectionDAG;
2015 explicit ARG_FLAGSSDNode(ISD::ArgFlagsTy Flags)
2016 : SDNode(ISD::ARG_FLAGS, getSDVTList(MVT::Other)), TheFlags(Flags) {
2019 ISD::ArgFlagsTy getArgFlags() const { return TheFlags; }
2021 static bool classof(const ARG_FLAGSSDNode *) { return true; }
2022 static bool classof(const SDNode *N) {
2023 return N->getOpcode() == ISD::ARG_FLAGS;
2027 /// VTSDNode - This class is used to represent MVT's, which are used
2028 /// to parameterize some operations.
2029 class VTSDNode : public SDNode {
2031 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
2033 friend class SelectionDAG;
2034 explicit VTSDNode(MVT VT)
2035 : SDNode(ISD::VALUETYPE, getSDVTList(MVT::Other)), ValueType(VT) {
2039 MVT getVT() const { return ValueType; }
2041 static bool classof(const VTSDNode *) { return true; }
2042 static bool classof(const SDNode *N) {
2043 return N->getOpcode() == ISD::VALUETYPE;
2047 /// LSBaseSDNode - Base class for LoadSDNode and StoreSDNode
2049 class LSBaseSDNode : public MemSDNode {
2051 // AddrMode - unindexed, pre-indexed, post-indexed.
2052 ISD::MemIndexedMode AddrMode;
2055 //! Operand array for load and store
2057 \note Moving this array to the base class captures more
2058 common functionality shared between LoadSDNode and
2063 LSBaseSDNode(ISD::NodeType NodeTy, SDOperand *Operands, unsigned numOperands,
2064 SDVTList VTs, ISD::MemIndexedMode AM, MVT VT,
2065 const Value *SV, int SVO, unsigned Align, bool Vol)
2066 : MemSDNode(NodeTy, VTs, VT, SV, SVO, Align, Vol), AddrMode(AM) {
2067 for (unsigned i = 0; i != numOperands; ++i)
2068 Ops[i] = Operands[i];
2069 InitOperands(Ops, numOperands);
2070 assert(Align != 0 && "Loads and stores should have non-zero aligment");
2071 assert((getOffset().getOpcode() == ISD::UNDEF || isIndexed()) &&
2072 "Only indexed loads and stores have a non-undef offset operand");
2075 const SDOperand &getOffset() const {
2076 return getOperand(getOpcode() == ISD::LOAD ? 2 : 3);
2079 ISD::MemIndexedMode getAddressingMode() const { return AddrMode; }
2081 /// isIndexed - Return true if this is a pre/post inc/dec load/store.
2082 bool isIndexed() const { return AddrMode != ISD::UNINDEXED; }
2084 /// isUnindexed - Return true if this is NOT a pre/post inc/dec load/store.
2085 bool isUnindexed() const { return AddrMode == ISD::UNINDEXED; }
2087 static bool classof(const LSBaseSDNode *) { return true; }
2088 static bool classof(const SDNode *N) {
2089 return N->getOpcode() == ISD::LOAD ||
2090 N->getOpcode() == ISD::STORE;
2094 /// LoadSDNode - This class is used to represent ISD::LOAD nodes.
2096 class LoadSDNode : public LSBaseSDNode {
2097 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
2099 // ExtType - non-ext, anyext, sext, zext.
2100 ISD::LoadExtType ExtType;
2103 friend class SelectionDAG;
2104 LoadSDNode(SDOperand *ChainPtrOff, SDVTList VTs,
2105 ISD::MemIndexedMode AM, ISD::LoadExtType ETy, MVT LVT,
2106 const Value *SV, int O=0, unsigned Align=0, bool Vol=false)
2107 : LSBaseSDNode(ISD::LOAD, ChainPtrOff, 3,
2108 VTs, AM, LVT, SV, O, Align, Vol),
2112 ISD::LoadExtType getExtensionType() const { return ExtType; }
2113 const SDOperand &getBasePtr() const { return getOperand(1); }
2114 const SDOperand &getOffset() const { return getOperand(2); }
2116 static bool classof(const LoadSDNode *) { return true; }
2117 static bool classof(const SDNode *N) {
2118 return N->getOpcode() == ISD::LOAD;
2122 /// StoreSDNode - This class is used to represent ISD::STORE nodes.
2124 class StoreSDNode : public LSBaseSDNode {
2125 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
2127 // IsTruncStore - True if the op does a truncation before store. For
2128 // integers this is the same as doing a TRUNCATE and storing the result.
2129 // For floats, it is the same as doing an FP_ROUND and storing the result.
2132 friend class SelectionDAG;
2133 StoreSDNode(SDOperand *ChainValuePtrOff, SDVTList VTs,
2134 ISD::MemIndexedMode AM, bool isTrunc, MVT SVT,
2135 const Value *SV, int O=0, unsigned Align=0, bool Vol=false)
2136 : LSBaseSDNode(ISD::STORE, ChainValuePtrOff, 4,
2137 VTs, AM, SVT, SV, O, Align, Vol),
2138 IsTruncStore(isTrunc) {}
2141 bool isTruncatingStore() const { return IsTruncStore; }
2142 const SDOperand &getValue() const { return getOperand(1); }
2143 const SDOperand &getBasePtr() const { return getOperand(2); }
2144 const SDOperand &getOffset() const { return getOperand(3); }
2146 static bool classof(const StoreSDNode *) { return true; }
2147 static bool classof(const SDNode *N) {
2148 return N->getOpcode() == ISD::STORE;
2153 class SDNodeIterator : public forward_iterator<SDNode, ptrdiff_t> {
2157 SDNodeIterator(SDNode *N, unsigned Op) : Node(N), Operand(Op) {}
2159 bool operator==(const SDNodeIterator& x) const {
2160 return Operand == x.Operand;
2162 bool operator!=(const SDNodeIterator& x) const { return !operator==(x); }
2164 const SDNodeIterator &operator=(const SDNodeIterator &I) {
2165 assert(I.Node == Node && "Cannot assign iterators to two different nodes!");
2166 Operand = I.Operand;
2170 pointer operator*() const {
2171 return Node->getOperand(Operand).Val;
2173 pointer operator->() const { return operator*(); }
2175 SDNodeIterator& operator++() { // Preincrement
2179 SDNodeIterator operator++(int) { // Postincrement
2180 SDNodeIterator tmp = *this; ++*this; return tmp;
2183 static SDNodeIterator begin(SDNode *N) { return SDNodeIterator(N, 0); }
2184 static SDNodeIterator end (SDNode *N) {
2185 return SDNodeIterator(N, N->getNumOperands());
2188 unsigned getOperand() const { return Operand; }
2189 const SDNode *getNode() const { return Node; }
2192 template <> struct GraphTraits<SDNode*> {
2193 typedef SDNode NodeType;
2194 typedef SDNodeIterator ChildIteratorType;
2195 static inline NodeType *getEntryNode(SDNode *N) { return N; }
2196 static inline ChildIteratorType child_begin(NodeType *N) {
2197 return SDNodeIterator::begin(N);
2199 static inline ChildIteratorType child_end(NodeType *N) {
2200 return SDNodeIterator::end(N);
2204 /// LargestSDNode - The largest SDNode class.
2206 typedef LoadSDNode LargestSDNode;
2208 // alist_traits specialization for pool-allocating SDNodes.
2210 class alist_traits<SDNode, LargestSDNode> {
2211 typedef alist_iterator<SDNode, LargestSDNode> iterator;
2214 // Pool-allocate and recycle SDNodes.
2215 typedef RecyclingAllocator<BumpPtrAllocator, SDNode, LargestSDNode>
2218 // Allocate the allocator immediately inside the traits class.
2219 AllocatorType Allocator;
2221 void addNodeToList(SDNode* N) {}
2222 void removeNodeFromList(SDNode* N) {}
2223 void transferNodesFromList(alist_traits &, iterator, iterator) {}
2224 void deleteNode(SDNode *N) {
2226 Allocator.Deallocate(N);
2231 /// isNormalLoad - Returns true if the specified node is a non-extending
2232 /// and unindexed load.
2233 inline bool isNormalLoad(const SDNode *N) {
2234 const LoadSDNode *Ld = dyn_cast<LoadSDNode>(N);
2235 return Ld && Ld->getExtensionType() == ISD::NON_EXTLOAD &&
2236 Ld->getAddressingMode() == ISD::UNINDEXED;
2239 /// isNON_EXTLoad - Returns true if the specified node is a non-extending
2241 inline bool isNON_EXTLoad(const SDNode *N) {
2242 return isa<LoadSDNode>(N) &&
2243 cast<LoadSDNode>(N)->getExtensionType() == ISD::NON_EXTLOAD;
2246 /// isEXTLoad - Returns true if the specified node is a EXTLOAD.
2248 inline bool isEXTLoad(const SDNode *N) {
2249 return isa<LoadSDNode>(N) &&
2250 cast<LoadSDNode>(N)->getExtensionType() == ISD::EXTLOAD;
2253 /// isSEXTLoad - Returns true if the specified node is a SEXTLOAD.
2255 inline bool isSEXTLoad(const SDNode *N) {
2256 return isa<LoadSDNode>(N) &&
2257 cast<LoadSDNode>(N)->getExtensionType() == ISD::SEXTLOAD;
2260 /// isZEXTLoad - Returns true if the specified node is a ZEXTLOAD.
2262 inline bool isZEXTLoad(const SDNode *N) {
2263 return isa<LoadSDNode>(N) &&
2264 cast<LoadSDNode>(N)->getExtensionType() == ISD::ZEXTLOAD;
2267 /// isUNINDEXEDLoad - Returns true if the specified node is an unindexed load.
2269 inline bool isUNINDEXEDLoad(const SDNode *N) {
2270 return isa<LoadSDNode>(N) &&
2271 cast<LoadSDNode>(N)->getAddressingMode() == ISD::UNINDEXED;
2274 /// isNormalStore - Returns true if the specified node is a non-truncating
2275 /// and unindexed store.
2276 inline bool isNormalStore(const SDNode *N) {
2277 const StoreSDNode *St = dyn_cast<StoreSDNode>(N);
2278 return St && !St->isTruncatingStore() &&
2279 St->getAddressingMode() == ISD::UNINDEXED;
2282 /// isNON_TRUNCStore - Returns true if the specified node is a non-truncating
2284 inline bool isNON_TRUNCStore(const SDNode *N) {
2285 return isa<StoreSDNode>(N) && !cast<StoreSDNode>(N)->isTruncatingStore();
2288 /// isTRUNCStore - Returns true if the specified node is a truncating
2290 inline bool isTRUNCStore(const SDNode *N) {
2291 return isa<StoreSDNode>(N) && cast<StoreSDNode>(N)->isTruncatingStore();
2294 /// isUNINDEXEDStore - Returns true if the specified node is an
2295 /// unindexed store.
2296 inline bool isUNINDEXEDStore(const SDNode *N) {
2297 return isa<StoreSDNode>(N) &&
2298 cast<StoreSDNode>(N)->getAddressingMode() == ISD::UNINDEXED;
2303 } // end llvm namespace