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 bool isMachineOpcode() const;
850 inline unsigned getMachineOpcode() const;
853 /// reachesChainWithoutSideEffects - Return true if this operand (which must
854 /// be a chain) reaches the specified operand without crossing any
855 /// side-effecting instructions. In practice, this looks through token
856 /// factors and non-volatile loads. In order to remain efficient, this only
857 /// looks a couple of nodes in, it does not do an exhaustive search.
858 bool reachesChainWithoutSideEffects(SDOperand Dest,
859 unsigned Depth = 2) const;
861 /// use_empty - Return true if there are no nodes using value ResNo
864 inline bool use_empty() const;
866 /// use_empty - Return true if there is exactly one node using value
867 /// ResNo of node Val.
869 inline bool hasOneUse() const;
873 template<> struct DenseMapInfo<SDOperand> {
874 static inline SDOperand getEmptyKey() {
875 return SDOperand((SDNode*)-1, -1U);
877 static inline SDOperand getTombstoneKey() {
878 return SDOperand((SDNode*)-1, 0);
880 static unsigned getHashValue(const SDOperand &Val) {
881 return ((unsigned)((uintptr_t)Val.Val >> 4) ^
882 (unsigned)((uintptr_t)Val.Val >> 9)) + Val.ResNo;
884 static bool isEqual(const SDOperand &LHS, const SDOperand &RHS) {
887 static bool isPod() { return true; }
890 /// simplify_type specializations - Allow casting operators to work directly on
891 /// SDOperands as if they were SDNode*'s.
892 template<> struct simplify_type<SDOperand> {
893 typedef SDNode* SimpleType;
894 static SimpleType getSimplifiedValue(const SDOperand &Val) {
895 return static_cast<SimpleType>(Val.Val);
898 template<> struct simplify_type<const SDOperand> {
899 typedef SDNode* SimpleType;
900 static SimpleType getSimplifiedValue(const SDOperand &Val) {
901 return static_cast<SimpleType>(Val.Val);
905 /// SDUse - Represents a use of the SDNode referred by
909 /// User - Parent node of this operand.
911 /// Prev, next - Pointers to the uses list of the SDNode referred by
916 SDUse(): Operand(), User(NULL), Prev(NULL), Next(NULL) {}
918 SDUse(SDNode *val, unsigned resno) :
919 Operand(val,resno), User(NULL), Prev(NULL), Next(NULL) {}
921 SDUse& operator= (const SDOperand& Op) {
928 SDUse& operator= (const SDUse& Op) {
935 SDUse *getNext() { return Next; }
937 SDNode *getUser() { return User; }
939 void setUser(SDNode *p) { User = p; }
941 operator SDOperand() const { return Operand; }
943 const SDOperand& getSDOperand() const { return Operand; }
945 SDNode *&getVal() { return Operand.Val; }
947 bool operator==(const SDOperand &O) const {
951 bool operator!=(const SDOperand &O) const {
952 return !(Operand == O);
955 bool operator<(const SDOperand &O) const {
960 void addToList(SDUse **List) {
962 if (Next) Next->Prev = &Next;
967 void removeFromList() {
969 if (Next) Next->Prev = Prev;
974 /// simplify_type specializations - Allow casting operators to work directly on
975 /// SDOperands as if they were SDNode*'s.
976 template<> struct simplify_type<SDUse> {
977 typedef SDNode* SimpleType;
978 static SimpleType getSimplifiedValue(const SDUse &Val) {
979 return static_cast<SimpleType>(Val.getSDOperand().Val);
982 template<> struct simplify_type<const SDUse> {
983 typedef SDNode* SimpleType;
984 static SimpleType getSimplifiedValue(const SDUse &Val) {
985 return static_cast<SimpleType>(Val.getSDOperand().Val);
990 /// SDOperandPtr - A helper SDOperand pointer class, that can handle
991 /// arrays of SDUse and arrays of SDOperand objects. This is required
992 /// in many places inside the SelectionDAG.
995 const SDOperand *ptr; // The pointer to the SDOperand object
996 int object_size; // The size of the object containg the SDOperand
998 SDOperandPtr() : ptr(0), object_size(0) {}
1000 SDOperandPtr(SDUse * use_ptr) {
1001 ptr = &use_ptr->getSDOperand();
1002 object_size = (int)sizeof(SDUse);
1005 SDOperandPtr(const SDOperand * op_ptr) {
1007 object_size = (int)sizeof(SDOperand);
1010 const SDOperand operator *() { return *ptr; }
1011 const SDOperand *operator ->() { return ptr; }
1012 SDOperandPtr operator ++ () {
1013 ptr = (SDOperand*)((char *)ptr + object_size);
1017 SDOperandPtr operator ++ (int) {
1018 SDOperandPtr tmp = *this;
1019 ptr = (SDOperand*)((char *)ptr + object_size);
1023 SDOperand operator[] (int idx) const {
1024 return *(SDOperand*)((char*) ptr + object_size * idx);
1028 /// SDNode - Represents one node in the SelectionDAG.
1030 class SDNode : public FoldingSetNode {
1032 /// NodeType - The operation that this node performs.
1036 /// OperandsNeedDelete - This is true if OperandList was new[]'d. If true,
1037 /// then they will be delete[]'d when the node is destroyed.
1038 unsigned short OperandsNeedDelete : 1;
1041 /// SubclassData - This member is defined by this class, but is not used for
1042 /// anything. Subclasses can use it to hold whatever state they find useful.
1043 /// This field is initialized to zero by the ctor.
1044 unsigned short SubclassData : 15;
1047 /// NodeId - Unique id per SDNode in the DAG.
1050 /// OperandList - The values that are used by this operation.
1054 /// ValueList - The types of the values this node defines. SDNode's may
1055 /// define multiple values simultaneously.
1056 const MVT *ValueList;
1058 /// NumOperands/NumValues - The number of entries in the Operand/Value list.
1059 unsigned short NumOperands, NumValues;
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 //===--------------------------------------------------------------------===//
1079 /// getOpcode - Return the SelectionDAG opcode value for this node. For
1080 /// pre-isel nodes (those for which isMachineOpcode returns false), these
1081 /// are the opcode values in the ISD and <target>ISD namespaces. For
1082 /// post-isel opcodes, see getMachineOpcode.
1083 unsigned getOpcode() const { return (unsigned short)NodeType; }
1085 /// isTargetOpcode - Test if this node has a target-specific opcode (in the
1086 /// <target>ISD namespace).
1087 bool isTargetOpcode() const { return NodeType >= ISD::BUILTIN_OP_END; }
1089 /// isMachineOpcode - Test if this node has a post-isel opcode, directly
1090 /// corresponding to a MachineInstr opcode.
1091 bool isMachineOpcode() const { return NodeType < 0; }
1093 /// getMachineOpcode - This may only be called if isMachineOpcode returns
1094 /// true. It returns the MachineInstr opcode value that the node's opcode
1096 unsigned getMachineOpcode() const {
1097 assert(isMachineOpcode() && "Not a target opcode!");
1101 /// use_empty - Return true if there are no uses of this value.
1103 bool use_empty() const { return Uses == NULL; }
1105 /// hasOneUse - Return true if there is exactly one use of this value.
1107 bool hasOneUse() const {
1108 return !use_empty() && next(use_begin()) == use_end();
1111 /// use_size - Return the number of uses of this value. This method takes
1112 /// time proportional to the number of uses.
1114 size_t use_size() const { return std::distance(use_begin(), use_end()); }
1116 /// getNodeId - Return the unique node id.
1118 int getNodeId() const { return NodeId; }
1120 /// setNodeId - Set unique node id.
1121 void setNodeId(int Id) { NodeId = Id; }
1123 /// use_iterator - This class provides iterator support for SDUse
1124 /// operands that use a specific SDNode.
1126 : public forward_iterator<SDUse, ptrdiff_t> {
1128 explicit use_iterator(SDUse *op) : Op(op) {
1130 friend class SDNode;
1132 typedef forward_iterator<SDUse, ptrdiff_t>::reference reference;
1133 typedef forward_iterator<SDUse, ptrdiff_t>::pointer pointer;
1135 use_iterator(const use_iterator &I) : Op(I.Op) {}
1136 use_iterator() : Op(0) {}
1138 bool operator==(const use_iterator &x) const {
1141 bool operator!=(const use_iterator &x) const {
1142 return !operator==(x);
1145 /// atEnd - return true if this iterator is at the end of uses list.
1146 bool atEnd() const { return Op == 0; }
1148 // Iterator traversal: forward iteration only.
1149 use_iterator &operator++() { // Preincrement
1150 assert(Op && "Cannot increment end iterator!");
1155 use_iterator operator++(int) { // Postincrement
1156 use_iterator tmp = *this; ++*this; return tmp;
1159 /// Retrieve a pointer to the current user node.
1160 SDNode *operator*() const {
1161 assert(Op && "Cannot dereference end iterator!");
1162 return Op->getUser();
1165 SDNode *operator->() const { return operator*(); }
1167 SDUse &getUse() const { return *Op; }
1169 /// getOperandNo - Retrive the operand # of this use in its user.
1171 unsigned getOperandNo() const {
1172 assert(Op && "Cannot dereference end iterator!");
1173 return (unsigned)(Op - Op->getUser()->OperandList);
1177 /// use_begin/use_end - Provide iteration support to walk over all uses
1180 use_iterator use_begin() const {
1181 return use_iterator(Uses);
1184 static use_iterator use_end() { return use_iterator(0); }
1187 /// hasNUsesOfValue - Return true if there are exactly NUSES uses of the
1188 /// indicated value. This method ignores uses of other values defined by this
1190 bool hasNUsesOfValue(unsigned NUses, unsigned Value) const;
1192 /// hasAnyUseOfValue - Return true if there are any use of the indicated
1193 /// value. This method ignores uses of other values defined by this operation.
1194 bool hasAnyUseOfValue(unsigned Value) const;
1196 /// isOnlyUserOf - Return true if this node is the only use of N.
1198 bool isOnlyUserOf(SDNode *N) const;
1200 /// isOperandOf - Return true if this node is an operand of N.
1202 bool isOperandOf(SDNode *N) const;
1204 /// isPredecessorOf - Return true if this node is a predecessor of N. This
1205 /// node is either an operand of N or it can be reached by recursively
1206 /// traversing up the operands.
1207 /// NOTE: this is an expensive method. Use it carefully.
1208 bool isPredecessorOf(SDNode *N) const;
1210 /// getNumOperands - Return the number of values used by this operation.
1212 unsigned getNumOperands() const { return NumOperands; }
1214 /// getConstantOperandVal - Helper method returns the integer value of a
1215 /// ConstantSDNode operand.
1216 uint64_t getConstantOperandVal(unsigned Num) const;
1218 const SDOperand &getOperand(unsigned Num) const {
1219 assert(Num < NumOperands && "Invalid child # of SDNode!");
1220 return OperandList[Num].getSDOperand();
1223 typedef SDUse* op_iterator;
1224 op_iterator op_begin() const { return OperandList; }
1225 op_iterator op_end() const { return OperandList+NumOperands; }
1228 SDVTList getVTList() const {
1229 SDVTList X = { ValueList, NumValues };
1233 /// getNumValues - Return the number of values defined/returned by this
1236 unsigned getNumValues() const { return NumValues; }
1238 /// getValueType - Return the type of a specified result.
1240 MVT getValueType(unsigned ResNo) const {
1241 assert(ResNo < NumValues && "Illegal result number!");
1242 return ValueList[ResNo];
1245 /// getValueSizeInBits - Returns MVT::getSizeInBits(getValueType(ResNo)).
1247 unsigned getValueSizeInBits(unsigned ResNo) const {
1248 return getValueType(ResNo).getSizeInBits();
1251 typedef const MVT* value_iterator;
1252 value_iterator value_begin() const { return ValueList; }
1253 value_iterator value_end() const { return ValueList+NumValues; }
1255 /// getOperationName - Return the opcode of this operation for printing.
1257 std::string getOperationName(const SelectionDAG *G = 0) const;
1258 static const char* getIndexedModeName(ISD::MemIndexedMode AM);
1260 void dump(const SelectionDAG *G) const;
1262 static bool classof(const SDNode *) { return true; }
1264 /// Profile - Gather unique data for the node.
1266 void Profile(FoldingSetNodeID &ID);
1269 friend class SelectionDAG;
1271 /// getValueTypeList - Return a pointer to the specified value type.
1273 static const MVT *getValueTypeList(MVT VT);
1274 static SDVTList getSDVTList(MVT VT) {
1275 SDVTList Ret = { getValueTypeList(VT), 1 };
1279 SDNode(unsigned Opc, SDVTList VTs, const SDOperand *Ops, unsigned NumOps)
1280 : NodeType(Opc), OperandsNeedDelete(true), SubclassData(0),
1281 NodeId(-1), Uses(NULL) {
1282 NumOperands = NumOps;
1283 OperandList = NumOps ? new SDUse[NumOperands] : 0;
1285 for (unsigned i = 0; i != NumOps; ++i) {
1286 OperandList[i] = Ops[i];
1287 OperandList[i].setUser(this);
1288 Ops[i].Val->addUse(OperandList[i]);
1291 ValueList = VTs.VTs;
1292 NumValues = VTs.NumVTs;
1295 SDNode(unsigned Opc, SDVTList VTs, const SDUse *Ops, unsigned NumOps)
1296 : NodeType(Opc), OperandsNeedDelete(true), SubclassData(0),
1297 NodeId(-1), Uses(NULL) {
1298 OperandsNeedDelete = true;
1299 NumOperands = NumOps;
1300 OperandList = NumOps ? new SDUse[NumOperands] : 0;
1302 for (unsigned i = 0; i != NumOps; ++i) {
1303 OperandList[i] = Ops[i];
1304 OperandList[i].setUser(this);
1305 Ops[i].getSDOperand().Val->addUse(OperandList[i]);
1308 ValueList = VTs.VTs;
1309 NumValues = VTs.NumVTs;
1312 /// This constructor adds no operands itself; operands can be
1313 /// set later with InitOperands.
1314 SDNode(unsigned Opc, SDVTList VTs)
1315 : NodeType(Opc), OperandsNeedDelete(false), SubclassData(0),
1316 NodeId(-1), Uses(NULL) {
1319 ValueList = VTs.VTs;
1320 NumValues = VTs.NumVTs;
1323 /// InitOperands - Initialize the operands list of this node with the
1324 /// specified values, which are part of the node (thus they don't need to be
1325 /// copied in or allocated).
1326 void InitOperands(SDUse *Ops, unsigned NumOps) {
1327 assert(OperandList == 0 && "Operands already set!");
1328 NumOperands = NumOps;
1332 for (unsigned i = 0; i != NumOps; ++i) {
1333 OperandList[i].setUser(this);
1334 Ops[i].getVal()->addUse(OperandList[i]);
1338 /// DropOperands - Release the operands and set this node to have
1340 void DropOperands();
1342 void addUser(unsigned i, SDNode *User) {
1343 assert(User->OperandList[i].getUser() && "Node without parent");
1344 addUse(User->OperandList[i]);
1347 void removeUser(unsigned i, SDNode *User) {
1348 assert(User->OperandList[i].getUser() && "Node without parent");
1349 SDUse &Op = User->OperandList[i];
1350 Op.removeFromList();
1355 // Define inline functions from the SDOperand class.
1357 inline unsigned SDOperand::getOpcode() const {
1358 return Val->getOpcode();
1360 inline MVT SDOperand::getValueType() const {
1361 return Val->getValueType(ResNo);
1363 inline unsigned SDOperand::getNumOperands() const {
1364 return Val->getNumOperands();
1366 inline const SDOperand &SDOperand::getOperand(unsigned i) const {
1367 return Val->getOperand(i);
1369 inline uint64_t SDOperand::getConstantOperandVal(unsigned i) const {
1370 return Val->getConstantOperandVal(i);
1372 inline bool SDOperand::isTargetOpcode() const {
1373 return Val->isTargetOpcode();
1375 inline bool SDOperand::isMachineOpcode() const {
1376 return Val->isMachineOpcode();
1378 inline unsigned SDOperand::getMachineOpcode() const {
1379 return Val->getMachineOpcode();
1381 inline bool SDOperand::use_empty() const {
1382 return !Val->hasAnyUseOfValue(ResNo);
1384 inline bool SDOperand::hasOneUse() const {
1385 return Val->hasNUsesOfValue(1, ResNo);
1388 /// UnarySDNode - This class is used for single-operand SDNodes. This is solely
1389 /// to allow co-allocation of node operands with the node itself.
1390 class UnarySDNode : public SDNode {
1391 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1394 UnarySDNode(unsigned Opc, SDVTList VTs, SDOperand X)
1395 : SDNode(Opc, VTs) {
1397 InitOperands(&Op, 1);
1401 /// BinarySDNode - This class is used for two-operand SDNodes. This is solely
1402 /// to allow co-allocation of node operands with the node itself.
1403 class BinarySDNode : public SDNode {
1404 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1407 BinarySDNode(unsigned Opc, SDVTList VTs, SDOperand X, SDOperand Y)
1408 : SDNode(Opc, VTs) {
1411 InitOperands(Ops, 2);
1415 /// TernarySDNode - This class is used for three-operand SDNodes. This is solely
1416 /// to allow co-allocation of node operands with the node itself.
1417 class TernarySDNode : public SDNode {
1418 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1421 TernarySDNode(unsigned Opc, SDVTList VTs, SDOperand X, SDOperand Y,
1423 : SDNode(Opc, VTs) {
1427 InitOperands(Ops, 3);
1432 /// HandleSDNode - This class is used to form a handle around another node that
1433 /// is persistant and is updated across invocations of replaceAllUsesWith on its
1434 /// operand. This node should be directly created by end-users and not added to
1435 /// the AllNodes list.
1436 class HandleSDNode : public SDNode {
1437 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1440 // FIXME: Remove the "noinline" attribute once <rdar://problem/5852746> is
1443 explicit __attribute__((__noinline__)) HandleSDNode(SDOperand X)
1445 explicit HandleSDNode(SDOperand X)
1447 : SDNode(ISD::HANDLENODE, getSDVTList(MVT::Other)) {
1449 InitOperands(&Op, 1);
1452 SDUse getValue() const { return Op; }
1455 /// Abstact virtual class for operations for memory operations
1456 class MemSDNode : public SDNode {
1457 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1460 // MemoryVT - VT of in-memory value.
1463 //! SrcValue - Memory location for alias analysis.
1464 const Value *SrcValue;
1466 //! SVOffset - Memory location offset. Note that base is defined in MemSDNode
1469 /// Flags - the low bit indicates whether this is a volatile reference;
1470 /// the remainder is a log2 encoding of the alignment in bytes.
1474 MemSDNode(unsigned Opc, SDVTList VTs, MVT MemoryVT,
1475 const Value *srcValue, int SVOff,
1476 unsigned alignment, bool isvolatile);
1478 /// Returns alignment and volatility of the memory access
1479 unsigned getAlignment() const { return (1u << (Flags >> 1)) >> 1; }
1480 bool isVolatile() const { return Flags & 1; }
1482 /// Returns the SrcValue and offset that describes the location of the access
1483 const Value *getSrcValue() const { return SrcValue; }
1484 int getSrcValueOffset() const { return SVOffset; }
1486 /// getMemoryVT - Return the type of the in-memory value.
1487 MVT getMemoryVT() const { return MemoryVT; }
1489 /// getMemOperand - Return a MachineMemOperand object describing the memory
1490 /// reference performed by operation.
1491 MachineMemOperand getMemOperand() const;
1493 const SDOperand &getChain() const { return getOperand(0); }
1494 const SDOperand &getBasePtr() const {
1495 return getOperand(getOpcode() == ISD::STORE ? 2 : 1);
1498 // Methods to support isa and dyn_cast
1499 static bool classof(const MemSDNode *) { return true; }
1500 static bool classof(const SDNode *N) {
1501 return N->getOpcode() == ISD::LOAD ||
1502 N->getOpcode() == ISD::STORE ||
1503 N->getOpcode() == ISD::ATOMIC_CMP_SWAP ||
1504 N->getOpcode() == ISD::ATOMIC_LOAD_ADD ||
1505 N->getOpcode() == ISD::ATOMIC_SWAP ||
1506 N->getOpcode() == ISD::ATOMIC_LOAD_SUB ||
1507 N->getOpcode() == ISD::ATOMIC_LOAD_AND ||
1508 N->getOpcode() == ISD::ATOMIC_LOAD_OR ||
1509 N->getOpcode() == ISD::ATOMIC_LOAD_XOR ||
1510 N->getOpcode() == ISD::ATOMIC_LOAD_NAND ||
1511 N->getOpcode() == ISD::ATOMIC_LOAD_MIN ||
1512 N->getOpcode() == ISD::ATOMIC_LOAD_MAX ||
1513 N->getOpcode() == ISD::ATOMIC_LOAD_UMIN ||
1514 N->getOpcode() == ISD::ATOMIC_LOAD_UMAX;
1518 /// Atomic operations node
1519 class AtomicSDNode : public MemSDNode {
1520 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1524 // Opc: opcode for atomic
1525 // VTL: value type list
1526 // Chain: memory chain for operaand
1527 // Ptr: address to update as a SDOperand
1528 // Cmp: compare value
1530 // SrcVal: address to update as a Value (used for MemOperand)
1531 // Align: alignment of memory
1532 AtomicSDNode(unsigned Opc, SDVTList VTL, SDOperand Chain, SDOperand Ptr,
1533 SDOperand Cmp, SDOperand Swp, const Value* SrcVal,
1535 : MemSDNode(Opc, VTL, Cmp.getValueType(), SrcVal, /*SVOffset=*/0,
1536 Align, /*isVolatile=*/true) {
1541 InitOperands(Ops, 4);
1543 AtomicSDNode(unsigned Opc, SDVTList VTL, SDOperand Chain, SDOperand Ptr,
1544 SDOperand Val, const Value* SrcVal, unsigned Align=0)
1545 : MemSDNode(Opc, VTL, Val.getValueType(), SrcVal, /*SVOffset=*/0,
1546 Align, /*isVolatile=*/true) {
1550 InitOperands(Ops, 3);
1553 const SDOperand &getBasePtr() const { return getOperand(1); }
1554 const SDOperand &getVal() const { return getOperand(2); }
1556 bool isCompareAndSwap() const { return getOpcode() == ISD::ATOMIC_CMP_SWAP; }
1558 // Methods to support isa and dyn_cast
1559 static bool classof(const AtomicSDNode *) { return true; }
1560 static bool classof(const SDNode *N) {
1561 return N->getOpcode() == ISD::ATOMIC_CMP_SWAP ||
1562 N->getOpcode() == ISD::ATOMIC_LOAD_ADD ||
1563 N->getOpcode() == ISD::ATOMIC_SWAP ||
1564 N->getOpcode() == ISD::ATOMIC_LOAD_SUB ||
1565 N->getOpcode() == ISD::ATOMIC_LOAD_AND ||
1566 N->getOpcode() == ISD::ATOMIC_LOAD_OR ||
1567 N->getOpcode() == ISD::ATOMIC_LOAD_XOR ||
1568 N->getOpcode() == ISD::ATOMIC_LOAD_NAND ||
1569 N->getOpcode() == ISD::ATOMIC_LOAD_MIN ||
1570 N->getOpcode() == ISD::ATOMIC_LOAD_MAX ||
1571 N->getOpcode() == ISD::ATOMIC_LOAD_UMIN ||
1572 N->getOpcode() == ISD::ATOMIC_LOAD_UMAX;
1576 class ConstantSDNode : public SDNode {
1578 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1580 friend class SelectionDAG;
1581 ConstantSDNode(bool isTarget, const APInt &val, MVT VT)
1582 : SDNode(isTarget ? ISD::TargetConstant : ISD::Constant, getSDVTList(VT)),
1587 const APInt &getAPIntValue() const { return Value; }
1588 uint64_t getValue() const { return Value.getZExtValue(); }
1590 int64_t getSignExtended() const {
1591 unsigned Bits = getValueType(0).getSizeInBits();
1592 return ((int64_t)Value.getZExtValue() << (64-Bits)) >> (64-Bits);
1595 bool isNullValue() const { return Value == 0; }
1596 bool isAllOnesValue() const {
1597 return Value == getValueType(0).getIntegerVTBitMask();
1600 static bool classof(const ConstantSDNode *) { return true; }
1601 static bool classof(const SDNode *N) {
1602 return N->getOpcode() == ISD::Constant ||
1603 N->getOpcode() == ISD::TargetConstant;
1607 class ConstantFPSDNode : public SDNode {
1609 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1611 friend class SelectionDAG;
1612 ConstantFPSDNode(bool isTarget, const APFloat& val, MVT VT)
1613 : SDNode(isTarget ? ISD::TargetConstantFP : ISD::ConstantFP,
1614 getSDVTList(VT)), Value(val) {
1618 const APFloat& getValueAPF() const { return Value; }
1620 /// isExactlyValue - We don't rely on operator== working on double values, as
1621 /// it returns true for things that are clearly not equal, like -0.0 and 0.0.
1622 /// As such, this method can be used to do an exact bit-for-bit comparison of
1623 /// two floating point values.
1625 /// We leave the version with the double argument here because it's just so
1626 /// convenient to write "2.0" and the like. Without this function we'd
1627 /// have to duplicate its logic everywhere it's called.
1628 bool isExactlyValue(double V) const {
1629 // convert is not supported on this type
1630 if (&Value.getSemantics() == &APFloat::PPCDoubleDouble)
1633 Tmp.convert(Value.getSemantics(), APFloat::rmNearestTiesToEven);
1634 return isExactlyValue(Tmp);
1636 bool isExactlyValue(const APFloat& V) const;
1638 bool isValueValidForType(MVT VT, const APFloat& Val);
1640 static bool classof(const ConstantFPSDNode *) { return true; }
1641 static bool classof(const SDNode *N) {
1642 return N->getOpcode() == ISD::ConstantFP ||
1643 N->getOpcode() == ISD::TargetConstantFP;
1647 class GlobalAddressSDNode : public SDNode {
1648 GlobalValue *TheGlobal;
1650 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1652 friend class SelectionDAG;
1653 GlobalAddressSDNode(bool isTarget, const GlobalValue *GA, MVT VT, int o = 0);
1656 GlobalValue *getGlobal() const { return TheGlobal; }
1657 int getOffset() const { return Offset; }
1659 static bool classof(const GlobalAddressSDNode *) { return true; }
1660 static bool classof(const SDNode *N) {
1661 return N->getOpcode() == ISD::GlobalAddress ||
1662 N->getOpcode() == ISD::TargetGlobalAddress ||
1663 N->getOpcode() == ISD::GlobalTLSAddress ||
1664 N->getOpcode() == ISD::TargetGlobalTLSAddress;
1668 class FrameIndexSDNode : public SDNode {
1670 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1672 friend class SelectionDAG;
1673 FrameIndexSDNode(int fi, MVT VT, bool isTarg)
1674 : SDNode(isTarg ? ISD::TargetFrameIndex : ISD::FrameIndex, getSDVTList(VT)),
1679 int getIndex() const { return FI; }
1681 static bool classof(const FrameIndexSDNode *) { return true; }
1682 static bool classof(const SDNode *N) {
1683 return N->getOpcode() == ISD::FrameIndex ||
1684 N->getOpcode() == ISD::TargetFrameIndex;
1688 class JumpTableSDNode : public SDNode {
1690 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1692 friend class SelectionDAG;
1693 JumpTableSDNode(int jti, MVT VT, bool isTarg)
1694 : SDNode(isTarg ? ISD::TargetJumpTable : ISD::JumpTable, getSDVTList(VT)),
1699 int getIndex() const { return JTI; }
1701 static bool classof(const JumpTableSDNode *) { return true; }
1702 static bool classof(const SDNode *N) {
1703 return N->getOpcode() == ISD::JumpTable ||
1704 N->getOpcode() == ISD::TargetJumpTable;
1708 class ConstantPoolSDNode : public SDNode {
1711 MachineConstantPoolValue *MachineCPVal;
1713 int Offset; // It's a MachineConstantPoolValue if top bit is set.
1715 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1717 friend class SelectionDAG;
1718 ConstantPoolSDNode(bool isTarget, Constant *c, MVT VT, int o=0)
1719 : SDNode(isTarget ? ISD::TargetConstantPool : ISD::ConstantPool,
1720 getSDVTList(VT)), Offset(o), Alignment(0) {
1721 assert((int)Offset >= 0 && "Offset is too large");
1724 ConstantPoolSDNode(bool isTarget, Constant *c, MVT VT, int o, unsigned Align)
1725 : SDNode(isTarget ? ISD::TargetConstantPool : ISD::ConstantPool,
1726 getSDVTList(VT)), Offset(o), Alignment(Align) {
1727 assert((int)Offset >= 0 && "Offset is too large");
1730 ConstantPoolSDNode(bool isTarget, MachineConstantPoolValue *v,
1732 : SDNode(isTarget ? ISD::TargetConstantPool : ISD::ConstantPool,
1733 getSDVTList(VT)), Offset(o), Alignment(0) {
1734 assert((int)Offset >= 0 && "Offset is too large");
1735 Val.MachineCPVal = v;
1736 Offset |= 1 << (sizeof(unsigned)*8-1);
1738 ConstantPoolSDNode(bool isTarget, MachineConstantPoolValue *v,
1739 MVT VT, int o, unsigned Align)
1740 : SDNode(isTarget ? ISD::TargetConstantPool : ISD::ConstantPool,
1741 getSDVTList(VT)), Offset(o), Alignment(Align) {
1742 assert((int)Offset >= 0 && "Offset is too large");
1743 Val.MachineCPVal = v;
1744 Offset |= 1 << (sizeof(unsigned)*8-1);
1748 bool isMachineConstantPoolEntry() const {
1749 return (int)Offset < 0;
1752 Constant *getConstVal() const {
1753 assert(!isMachineConstantPoolEntry() && "Wrong constantpool type");
1754 return Val.ConstVal;
1757 MachineConstantPoolValue *getMachineCPVal() const {
1758 assert(isMachineConstantPoolEntry() && "Wrong constantpool type");
1759 return Val.MachineCPVal;
1762 int getOffset() const {
1763 return Offset & ~(1 << (sizeof(unsigned)*8-1));
1766 // Return the alignment of this constant pool object, which is either 0 (for
1767 // default alignment) or log2 of the desired value.
1768 unsigned getAlignment() const { return Alignment; }
1770 const Type *getType() const;
1772 static bool classof(const ConstantPoolSDNode *) { return true; }
1773 static bool classof(const SDNode *N) {
1774 return N->getOpcode() == ISD::ConstantPool ||
1775 N->getOpcode() == ISD::TargetConstantPool;
1779 class BasicBlockSDNode : public SDNode {
1780 MachineBasicBlock *MBB;
1781 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1783 friend class SelectionDAG;
1784 explicit BasicBlockSDNode(MachineBasicBlock *mbb)
1785 : SDNode(ISD::BasicBlock, getSDVTList(MVT::Other)), MBB(mbb) {
1789 MachineBasicBlock *getBasicBlock() const { return MBB; }
1791 static bool classof(const BasicBlockSDNode *) { return true; }
1792 static bool classof(const SDNode *N) {
1793 return N->getOpcode() == ISD::BasicBlock;
1797 /// SrcValueSDNode - An SDNode that holds an arbitrary LLVM IR Value. This is
1798 /// used when the SelectionDAG needs to make a simple reference to something
1799 /// in the LLVM IR representation.
1801 /// Note that this is not used for carrying alias information; that is done
1802 /// with MemOperandSDNode, which includes a Value which is required to be a
1803 /// pointer, and several other fields specific to memory references.
1805 class SrcValueSDNode : public SDNode {
1807 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1809 friend class SelectionDAG;
1810 /// Create a SrcValue for a general value.
1811 explicit SrcValueSDNode(const Value *v)
1812 : SDNode(ISD::SRCVALUE, getSDVTList(MVT::Other)), V(v) {}
1815 /// getValue - return the contained Value.
1816 const Value *getValue() const { return V; }
1818 static bool classof(const SrcValueSDNode *) { return true; }
1819 static bool classof(const SDNode *N) {
1820 return N->getOpcode() == ISD::SRCVALUE;
1825 /// MemOperandSDNode - An SDNode that holds a MachineMemOperand. This is
1826 /// used to represent a reference to memory after ISD::LOAD
1827 /// and ISD::STORE have been lowered.
1829 class MemOperandSDNode : public SDNode {
1830 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1832 friend class SelectionDAG;
1833 /// Create a MachineMemOperand node
1834 explicit MemOperandSDNode(const MachineMemOperand &mo)
1835 : SDNode(ISD::MEMOPERAND, getSDVTList(MVT::Other)), MO(mo) {}
1838 /// MO - The contained MachineMemOperand.
1839 const MachineMemOperand MO;
1841 static bool classof(const MemOperandSDNode *) { return true; }
1842 static bool classof(const SDNode *N) {
1843 return N->getOpcode() == ISD::MEMOPERAND;
1848 class RegisterSDNode : public SDNode {
1850 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1852 friend class SelectionDAG;
1853 RegisterSDNode(unsigned reg, MVT VT)
1854 : SDNode(ISD::Register, getSDVTList(VT)), Reg(reg) {
1858 unsigned getReg() const { return Reg; }
1860 static bool classof(const RegisterSDNode *) { return true; }
1861 static bool classof(const SDNode *N) {
1862 return N->getOpcode() == ISD::Register;
1866 class DbgStopPointSDNode : public SDNode {
1870 const CompileUnitDesc *CU;
1871 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1873 friend class SelectionDAG;
1874 DbgStopPointSDNode(SDOperand ch, unsigned l, unsigned c,
1875 const CompileUnitDesc *cu)
1876 : SDNode(ISD::DBG_STOPPOINT, getSDVTList(MVT::Other)),
1877 Line(l), Column(c), CU(cu) {
1879 InitOperands(&Chain, 1);
1882 unsigned getLine() const { return Line; }
1883 unsigned getColumn() const { return Column; }
1884 const CompileUnitDesc *getCompileUnit() const { return CU; }
1886 static bool classof(const DbgStopPointSDNode *) { return true; }
1887 static bool classof(const SDNode *N) {
1888 return N->getOpcode() == ISD::DBG_STOPPOINT;
1892 class LabelSDNode : public SDNode {
1895 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1897 friend class SelectionDAG;
1898 LabelSDNode(unsigned NodeTy, SDOperand ch, unsigned id)
1899 : SDNode(NodeTy, getSDVTList(MVT::Other)), LabelID(id) {
1901 InitOperands(&Chain, 1);
1904 unsigned getLabelID() const { return LabelID; }
1906 static bool classof(const LabelSDNode *) { return true; }
1907 static bool classof(const SDNode *N) {
1908 return N->getOpcode() == ISD::DBG_LABEL ||
1909 N->getOpcode() == ISD::EH_LABEL;
1913 class ExternalSymbolSDNode : public SDNode {
1915 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1917 friend class SelectionDAG;
1918 ExternalSymbolSDNode(bool isTarget, const char *Sym, MVT VT)
1919 : SDNode(isTarget ? ISD::TargetExternalSymbol : ISD::ExternalSymbol,
1920 getSDVTList(VT)), Symbol(Sym) {
1924 const char *getSymbol() const { return Symbol; }
1926 static bool classof(const ExternalSymbolSDNode *) { return true; }
1927 static bool classof(const SDNode *N) {
1928 return N->getOpcode() == ISD::ExternalSymbol ||
1929 N->getOpcode() == ISD::TargetExternalSymbol;
1933 class CondCodeSDNode : public SDNode {
1934 ISD::CondCode Condition;
1935 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
1937 friend class SelectionDAG;
1938 explicit CondCodeSDNode(ISD::CondCode Cond)
1939 : SDNode(ISD::CONDCODE, getSDVTList(MVT::Other)), Condition(Cond) {
1943 ISD::CondCode get() const { return Condition; }
1945 static bool classof(const CondCodeSDNode *) { return true; }
1946 static bool classof(const SDNode *N) {
1947 return N->getOpcode() == ISD::CONDCODE;
1954 static const uint64_t NoFlagSet = 0ULL;
1955 static const uint64_t ZExt = 1ULL<<0; ///< Zero extended
1956 static const uint64_t ZExtOffs = 0;
1957 static const uint64_t SExt = 1ULL<<1; ///< Sign extended
1958 static const uint64_t SExtOffs = 1;
1959 static const uint64_t InReg = 1ULL<<2; ///< Passed in register
1960 static const uint64_t InRegOffs = 2;
1961 static const uint64_t SRet = 1ULL<<3; ///< Hidden struct-ret ptr
1962 static const uint64_t SRetOffs = 3;
1963 static const uint64_t ByVal = 1ULL<<4; ///< Struct passed by value
1964 static const uint64_t ByValOffs = 4;
1965 static const uint64_t Nest = 1ULL<<5; ///< Nested fn static chain
1966 static const uint64_t NestOffs = 5;
1967 static const uint64_t ByValAlign = 0xFULL << 6; //< Struct alignment
1968 static const uint64_t ByValAlignOffs = 6;
1969 static const uint64_t Split = 1ULL << 10;
1970 static const uint64_t SplitOffs = 10;
1971 static const uint64_t OrigAlign = 0x1FULL<<27;
1972 static const uint64_t OrigAlignOffs = 27;
1973 static const uint64_t ByValSize = 0xffffffffULL << 32; //< Struct size
1974 static const uint64_t ByValSizeOffs = 32;
1976 static const uint64_t One = 1ULL; //< 1 of this type, for shifts
1980 ArgFlagsTy() : Flags(0) { }
1982 bool isZExt() const { return Flags & ZExt; }
1983 void setZExt() { Flags |= One << ZExtOffs; }
1985 bool isSExt() const { return Flags & SExt; }
1986 void setSExt() { Flags |= One << SExtOffs; }
1988 bool isInReg() const { return Flags & InReg; }
1989 void setInReg() { Flags |= One << InRegOffs; }
1991 bool isSRet() const { return Flags & SRet; }
1992 void setSRet() { Flags |= One << SRetOffs; }
1994 bool isByVal() const { return Flags & ByVal; }
1995 void setByVal() { Flags |= One << ByValOffs; }
1997 bool isNest() const { return Flags & Nest; }
1998 void setNest() { Flags |= One << NestOffs; }
2000 unsigned getByValAlign() const {
2002 ((One << ((Flags & ByValAlign) >> ByValAlignOffs)) / 2);
2004 void setByValAlign(unsigned A) {
2005 Flags = (Flags & ~ByValAlign) |
2006 (uint64_t(Log2_32(A) + 1) << ByValAlignOffs);
2009 bool isSplit() const { return Flags & Split; }
2010 void setSplit() { Flags |= One << SplitOffs; }
2012 unsigned getOrigAlign() const {
2014 ((One << ((Flags & OrigAlign) >> OrigAlignOffs)) / 2);
2016 void setOrigAlign(unsigned A) {
2017 Flags = (Flags & ~OrigAlign) |
2018 (uint64_t(Log2_32(A) + 1) << OrigAlignOffs);
2021 unsigned getByValSize() const {
2022 return (unsigned)((Flags & ByValSize) >> ByValSizeOffs);
2024 void setByValSize(unsigned S) {
2025 Flags = (Flags & ~ByValSize) | (uint64_t(S) << ByValSizeOffs);
2028 /// getArgFlagsString - Returns the flags as a string, eg: "zext align:4".
2029 std::string getArgFlagsString();
2031 /// getRawBits - Represent the flags as a bunch of bits.
2032 uint64_t getRawBits() const { return Flags; }
2036 /// ARG_FLAGSSDNode - Leaf node holding parameter flags.
2037 class ARG_FLAGSSDNode : public SDNode {
2038 ISD::ArgFlagsTy TheFlags;
2039 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
2041 friend class SelectionDAG;
2042 explicit ARG_FLAGSSDNode(ISD::ArgFlagsTy Flags)
2043 : SDNode(ISD::ARG_FLAGS, getSDVTList(MVT::Other)), TheFlags(Flags) {
2046 ISD::ArgFlagsTy getArgFlags() const { return TheFlags; }
2048 static bool classof(const ARG_FLAGSSDNode *) { return true; }
2049 static bool classof(const SDNode *N) {
2050 return N->getOpcode() == ISD::ARG_FLAGS;
2054 /// VTSDNode - This class is used to represent MVT's, which are used
2055 /// to parameterize some operations.
2056 class VTSDNode : public SDNode {
2058 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
2060 friend class SelectionDAG;
2061 explicit VTSDNode(MVT VT)
2062 : SDNode(ISD::VALUETYPE, getSDVTList(MVT::Other)), ValueType(VT) {
2066 MVT getVT() const { return ValueType; }
2068 static bool classof(const VTSDNode *) { return true; }
2069 static bool classof(const SDNode *N) {
2070 return N->getOpcode() == ISD::VALUETYPE;
2074 /// LSBaseSDNode - Base class for LoadSDNode and StoreSDNode
2076 class LSBaseSDNode : public MemSDNode {
2078 //! Operand array for load and store
2080 \note Moving this array to the base class captures more
2081 common functionality shared between LoadSDNode and
2086 LSBaseSDNode(ISD::NodeType NodeTy, SDOperand *Operands, unsigned numOperands,
2087 SDVTList VTs, ISD::MemIndexedMode AM, MVT VT,
2088 const Value *SV, int SVO, unsigned Align, bool Vol)
2089 : MemSDNode(NodeTy, VTs, VT, SV, SVO, Align, Vol) {
2091 for (unsigned i = 0; i != numOperands; ++i)
2092 Ops[i] = Operands[i];
2093 InitOperands(Ops, numOperands);
2094 assert(Align != 0 && "Loads and stores should have non-zero aligment");
2095 assert((getOffset().getOpcode() == ISD::UNDEF || isIndexed()) &&
2096 "Only indexed loads and stores have a non-undef offset operand");
2099 const SDOperand &getOffset() const {
2100 return getOperand(getOpcode() == ISD::LOAD ? 2 : 3);
2103 /// getAddressingMode - Return the addressing mode for this load or store:
2104 /// unindexed, pre-inc, pre-dec, post-inc, or post-dec.
2105 ISD::MemIndexedMode getAddressingMode() const {
2106 return ISD::MemIndexedMode(SubclassData & 7);
2109 /// isIndexed - Return true if this is a pre/post inc/dec load/store.
2110 bool isIndexed() const { return getAddressingMode() != ISD::UNINDEXED; }
2112 /// isUnindexed - Return true if this is NOT a pre/post inc/dec load/store.
2113 bool isUnindexed() const { return getAddressingMode() == ISD::UNINDEXED; }
2115 static bool classof(const LSBaseSDNode *) { return true; }
2116 static bool classof(const SDNode *N) {
2117 return N->getOpcode() == ISD::LOAD ||
2118 N->getOpcode() == ISD::STORE;
2122 /// LoadSDNode - This class is used to represent ISD::LOAD nodes.
2124 class LoadSDNode : public LSBaseSDNode {
2125 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
2127 friend class SelectionDAG;
2128 LoadSDNode(SDOperand *ChainPtrOff, SDVTList VTs,
2129 ISD::MemIndexedMode AM, ISD::LoadExtType ETy, MVT LVT,
2130 const Value *SV, int O=0, unsigned Align=0, bool Vol=false)
2131 : LSBaseSDNode(ISD::LOAD, ChainPtrOff, 3,
2132 VTs, AM, LVT, SV, O, Align, Vol) {
2133 SubclassData |= (unsigned short)ETy << 3;
2137 /// getExtensionType - Return whether this is a plain node,
2138 /// or one of the varieties of value-extending loads.
2139 ISD::LoadExtType getExtensionType() const {
2140 return ISD::LoadExtType((SubclassData >> 3) & 3);
2143 const SDOperand &getBasePtr() const { return getOperand(1); }
2144 const SDOperand &getOffset() const { return getOperand(2); }
2146 static bool classof(const LoadSDNode *) { return true; }
2147 static bool classof(const SDNode *N) {
2148 return N->getOpcode() == ISD::LOAD;
2152 /// StoreSDNode - This class is used to represent ISD::STORE nodes.
2154 class StoreSDNode : public LSBaseSDNode {
2155 virtual void ANCHOR(); // Out-of-line virtual method to give class a home.
2157 friend class SelectionDAG;
2158 StoreSDNode(SDOperand *ChainValuePtrOff, SDVTList VTs,
2159 ISD::MemIndexedMode AM, bool isTrunc, MVT SVT,
2160 const Value *SV, int O=0, unsigned Align=0, bool Vol=false)
2161 : LSBaseSDNode(ISD::STORE, ChainValuePtrOff, 4,
2162 VTs, AM, SVT, SV, O, Align, Vol) {
2163 SubclassData |= (unsigned short)isTrunc << 3;
2167 /// isTruncatingStore - Return true if the op does a truncation before store.
2168 /// For integers this is the same as doing a TRUNCATE and storing the result.
2169 /// For floats, it is the same as doing an FP_ROUND and storing the result.
2170 bool isTruncatingStore() const { return (SubclassData >> 3) & 1; }
2172 const SDOperand &getValue() const { return getOperand(1); }
2173 const SDOperand &getBasePtr() const { return getOperand(2); }
2174 const SDOperand &getOffset() const { return getOperand(3); }
2176 static bool classof(const StoreSDNode *) { return true; }
2177 static bool classof(const SDNode *N) {
2178 return N->getOpcode() == ISD::STORE;
2183 class SDNodeIterator : public forward_iterator<SDNode, ptrdiff_t> {
2187 SDNodeIterator(SDNode *N, unsigned Op) : Node(N), Operand(Op) {}
2189 bool operator==(const SDNodeIterator& x) const {
2190 return Operand == x.Operand;
2192 bool operator!=(const SDNodeIterator& x) const { return !operator==(x); }
2194 const SDNodeIterator &operator=(const SDNodeIterator &I) {
2195 assert(I.Node == Node && "Cannot assign iterators to two different nodes!");
2196 Operand = I.Operand;
2200 pointer operator*() const {
2201 return Node->getOperand(Operand).Val;
2203 pointer operator->() const { return operator*(); }
2205 SDNodeIterator& operator++() { // Preincrement
2209 SDNodeIterator operator++(int) { // Postincrement
2210 SDNodeIterator tmp = *this; ++*this; return tmp;
2213 static SDNodeIterator begin(SDNode *N) { return SDNodeIterator(N, 0); }
2214 static SDNodeIterator end (SDNode *N) {
2215 return SDNodeIterator(N, N->getNumOperands());
2218 unsigned getOperand() const { return Operand; }
2219 const SDNode *getNode() const { return Node; }
2222 template <> struct GraphTraits<SDNode*> {
2223 typedef SDNode NodeType;
2224 typedef SDNodeIterator ChildIteratorType;
2225 static inline NodeType *getEntryNode(SDNode *N) { return N; }
2226 static inline ChildIteratorType child_begin(NodeType *N) {
2227 return SDNodeIterator::begin(N);
2229 static inline ChildIteratorType child_end(NodeType *N) {
2230 return SDNodeIterator::end(N);
2234 /// LargestSDNode - The largest SDNode class.
2236 typedef LoadSDNode LargestSDNode;
2238 // alist_traits specialization for pool-allocating SDNodes.
2240 class alist_traits<SDNode, LargestSDNode> {
2241 typedef alist_iterator<SDNode, LargestSDNode> iterator;
2244 // Pool-allocate and recycle SDNodes.
2245 typedef RecyclingAllocator<BumpPtrAllocator, SDNode, LargestSDNode>
2248 // Allocate the allocator immediately inside the traits class.
2249 AllocatorType Allocator;
2251 void addNodeToList(SDNode*) {}
2252 void removeNodeFromList(SDNode*) {}
2253 void transferNodesFromList(alist_traits &, iterator, iterator) {}
2254 void deleteNode(SDNode *N) {
2256 Allocator.Deallocate(N);
2261 /// isNormalLoad - Returns true if the specified node is a non-extending
2262 /// and unindexed load.
2263 inline bool isNormalLoad(const SDNode *N) {
2264 const LoadSDNode *Ld = dyn_cast<LoadSDNode>(N);
2265 return Ld && Ld->getExtensionType() == ISD::NON_EXTLOAD &&
2266 Ld->getAddressingMode() == ISD::UNINDEXED;
2269 /// isNON_EXTLoad - Returns true if the specified node is a non-extending
2271 inline bool isNON_EXTLoad(const SDNode *N) {
2272 return isa<LoadSDNode>(N) &&
2273 cast<LoadSDNode>(N)->getExtensionType() == ISD::NON_EXTLOAD;
2276 /// isEXTLoad - Returns true if the specified node is a EXTLOAD.
2278 inline bool isEXTLoad(const SDNode *N) {
2279 return isa<LoadSDNode>(N) &&
2280 cast<LoadSDNode>(N)->getExtensionType() == ISD::EXTLOAD;
2283 /// isSEXTLoad - Returns true if the specified node is a SEXTLOAD.
2285 inline bool isSEXTLoad(const SDNode *N) {
2286 return isa<LoadSDNode>(N) &&
2287 cast<LoadSDNode>(N)->getExtensionType() == ISD::SEXTLOAD;
2290 /// isZEXTLoad - Returns true if the specified node is a ZEXTLOAD.
2292 inline bool isZEXTLoad(const SDNode *N) {
2293 return isa<LoadSDNode>(N) &&
2294 cast<LoadSDNode>(N)->getExtensionType() == ISD::ZEXTLOAD;
2297 /// isUNINDEXEDLoad - Returns true if the specified node is an unindexed load.
2299 inline bool isUNINDEXEDLoad(const SDNode *N) {
2300 return isa<LoadSDNode>(N) &&
2301 cast<LoadSDNode>(N)->getAddressingMode() == ISD::UNINDEXED;
2304 /// isNormalStore - Returns true if the specified node is a non-truncating
2305 /// and unindexed store.
2306 inline bool isNormalStore(const SDNode *N) {
2307 const StoreSDNode *St = dyn_cast<StoreSDNode>(N);
2308 return St && !St->isTruncatingStore() &&
2309 St->getAddressingMode() == ISD::UNINDEXED;
2312 /// isNON_TRUNCStore - Returns true if the specified node is a non-truncating
2314 inline bool isNON_TRUNCStore(const SDNode *N) {
2315 return isa<StoreSDNode>(N) && !cast<StoreSDNode>(N)->isTruncatingStore();
2318 /// isTRUNCStore - Returns true if the specified node is a truncating
2320 inline bool isTRUNCStore(const SDNode *N) {
2321 return isa<StoreSDNode>(N) && cast<StoreSDNode>(N)->isTruncatingStore();
2324 /// isUNINDEXEDStore - Returns true if the specified node is an
2325 /// unindexed store.
2326 inline bool isUNINDEXEDStore(const SDNode *N) {
2327 return isa<StoreSDNode>(N) &&
2328 cast<StoreSDNode>(N)->getAddressingMode() == ISD::UNINDEXED;
2333 } // end llvm namespace