1 //===-- llvm/CodeGen/ISDOpcodes.h - CodeGen opcodes -------------*- 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 codegen opcodes and related utilities.
12 //===----------------------------------------------------------------------===//
14 #ifndef LLVM_CODEGEN_ISDOPCODES_H
15 #define LLVM_CODEGEN_ISDOPCODES_H
19 /// ISD namespace - This namespace contains an enum which represents all of the
20 /// SelectionDAG node types and value types.
24 //===--------------------------------------------------------------------===//
25 /// ISD::NodeType enum - This enum defines the target-independent operators
26 /// for a SelectionDAG.
28 /// Targets may also define target-dependent operator codes for SDNodes. For
29 /// example, on x86, these are the enum values in the X86ISD namespace.
30 /// Targets should aim to use target-independent operators to model their
31 /// instruction sets as much as possible, and only use target-dependent
32 /// operators when they have special requirements.
34 /// Finally, during and after selection proper, SNodes may use special
35 /// operator codes that correspond directly with MachineInstr opcodes. These
36 /// are used to represent selected instructions. See the isMachineOpcode()
37 /// and getMachineOpcode() member functions of SDNode.
40 // DELETED_NODE - This is an illegal value that is used to catch
41 // errors. This opcode is not a legal opcode for any node.
44 // EntryToken - This is the marker used to indicate the start of the region.
47 // TokenFactor - This node takes multiple tokens as input and produces a
48 // single token result. This is used to represent the fact that the operand
49 // operators are independent of each other.
52 // AssertSext, AssertZext - These nodes record if a register contains a
53 // value that has already been zero or sign extended from a narrower type.
54 // These nodes take two operands. The first is the node that has already
55 // been extended, and the second is a value type node indicating the width
57 AssertSext, AssertZext,
59 // Various leaf nodes.
60 BasicBlock, VALUETYPE, CONDCODE, Register,
62 GlobalAddress, GlobalTLSAddress, FrameIndex,
63 JumpTable, ConstantPool, ExternalSymbol, BlockAddress,
65 // The address of the GOT
68 // FRAMEADDR, RETURNADDR - These nodes represent llvm.frameaddress and
69 // llvm.returnaddress on the DAG. These nodes take one operand, the index
70 // of the frame or return address to return. An index of zero corresponds
71 // to the current function's frame or return address, an index of one to the
72 // parent's frame or return address, and so on.
73 FRAMEADDR, RETURNADDR,
75 // FRAME_TO_ARGS_OFFSET - This node represents offset from frame pointer to
76 // first (possible) on-stack argument. This is needed for correct stack
77 // adjustment during unwind.
80 // RESULT, OUTCHAIN = EXCEPTIONADDR(INCHAIN) - This node represents the
81 // address of the exception block on entry to an landing pad block.
84 // RESULT, OUTCHAIN = LSDAADDR(INCHAIN) - This node represents the
85 // address of the Language Specific Data Area for the enclosing function.
88 // RESULT, OUTCHAIN = EHSELECTION(INCHAIN, EXCEPTION) - This node represents
89 // the selection index of the exception thrown.
92 // OUTCHAIN = EH_RETURN(INCHAIN, OFFSET, HANDLER) - This node represents
93 // 'eh_return' gcc dwarf builtin, which is used to return from
94 // exception. The general meaning is: adjust stack by OFFSET and pass
95 // execution to HANDLER. Many platform-related details also :)
98 // RESULT, OUTCHAIN = EH_SJLJ_SETJMP(INCHAIN, buffer)
99 // This corresponds to the eh.sjlj.setjmp intrinsic.
100 // It takes an input chain and a pointer to the jump buffer as inputs
101 // and returns an outchain.
104 // OUTCHAIN = EH_SJLJ_LONGJMP(INCHAIN, buffer)
105 // This corresponds to the eh.sjlj.longjmp intrinsic.
106 // It takes an input chain and a pointer to the jump buffer as inputs
107 // and returns an outchain.
110 // TargetConstant* - Like Constant*, but the DAG does not do any folding,
111 // simplification, or lowering of the constant. They are used for constants
112 // which are known to fit in the immediate fields of their users, or for
113 // carrying magic numbers which are not values which need to be materialized
118 // TargetGlobalAddress - Like GlobalAddress, but the DAG does no folding or
119 // anything else with this node, and this is valid in the target-specific
120 // dag, turning into a GlobalAddress operand.
122 TargetGlobalTLSAddress,
126 TargetExternalSymbol,
129 /// RESULT = INTRINSIC_WO_CHAIN(INTRINSICID, arg1, arg2, ...)
130 /// This node represents a target intrinsic function with no side effects.
131 /// The first operand is the ID number of the intrinsic from the
132 /// llvm::Intrinsic namespace. The operands to the intrinsic follow. The
133 /// node returns the result of the intrinsic.
136 /// RESULT,OUTCHAIN = INTRINSIC_W_CHAIN(INCHAIN, INTRINSICID, arg1, ...)
137 /// This node represents a target intrinsic function with side effects that
138 /// returns a result. The first operand is a chain pointer. The second is
139 /// the ID number of the intrinsic from the llvm::Intrinsic namespace. The
140 /// operands to the intrinsic follow. The node has two results, the result
141 /// of the intrinsic and an output chain.
144 /// OUTCHAIN = INTRINSIC_VOID(INCHAIN, INTRINSICID, arg1, arg2, ...)
145 /// This node represents a target intrinsic function with side effects that
146 /// does not return a result. The first operand is a chain pointer. The
147 /// second is the ID number of the intrinsic from the llvm::Intrinsic
148 /// namespace. The operands to the intrinsic follow.
151 // CopyToReg - This node has three operands: a chain, a register number to
152 // set to this value, and a value.
155 // CopyFromReg - This node indicates that the input value is a virtual or
156 // physical register that is defined outside of the scope of this
157 // SelectionDAG. The register is available from the RegisterSDNode object.
160 // UNDEF - An undefined node
163 // EXTRACT_ELEMENT - This is used to get the lower or upper (determined by
164 // a Constant, which is required to be operand #1) half of the integer or
165 // float value specified as operand #0. This is only for use before
166 // legalization, for values that will be broken into multiple registers.
169 // BUILD_PAIR - This is the opposite of EXTRACT_ELEMENT in some ways. Given
170 // two values of the same integer value type, this produces a value twice as
171 // big. Like EXTRACT_ELEMENT, this can only be used before legalization.
174 // MERGE_VALUES - This node takes multiple discrete operands and returns
175 // them all as its individual results. This nodes has exactly the same
176 // number of inputs and outputs. This node is useful for some pieces of the
177 // code generator that want to think about a single node with multiple
178 // results, not multiple nodes.
181 // Simple integer binary arithmetic operators.
182 ADD, SUB, MUL, SDIV, UDIV, SREM, UREM,
184 // SMUL_LOHI/UMUL_LOHI - Multiply two integers of type iN, producing
185 // a signed/unsigned value of type i[2*N], and return the full value as
186 // two results, each of type iN.
187 SMUL_LOHI, UMUL_LOHI,
189 // SDIVREM/UDIVREM - Divide two integers and produce both a quotient and
193 // CARRY_FALSE - This node is used when folding other nodes,
194 // like ADDC/SUBC, which indicate the carry result is always false.
197 // Carry-setting nodes for multiple precision addition and subtraction.
198 // These nodes take two operands of the same value type, and produce two
199 // results. The first result is the normal add or sub result, the second
200 // result is the carry flag result.
203 // Carry-using nodes for multiple precision addition and subtraction. These
204 // nodes take three operands: The first two are the normal lhs and rhs to
205 // the add or sub, and the third is the input carry flag. These nodes
206 // produce two results; the normal result of the add or sub, and the output
207 // carry flag. These nodes both read and write a carry flag to allow them
208 // to them to be chained together for add and sub of arbitrarily large
212 // RESULT, BOOL = [SU]ADDO(LHS, RHS) - Overflow-aware nodes for addition.
213 // These nodes take two operands: the normal LHS and RHS to the add. They
214 // produce two results: the normal result of the add, and a boolean that
215 // indicates if an overflow occurred (*not* a flag, because it may be stored
216 // to memory, etc.). If the type of the boolean is not i1 then the high
217 // bits conform to getBooleanContents.
218 // These nodes are generated from the llvm.[su]add.with.overflow intrinsics.
221 // Same for subtraction
224 // Same for multiplication
227 // Simple binary floating point operators.
228 FADD, FSUB, FMUL, FMA, FDIV, FREM,
230 // FCOPYSIGN(X, Y) - Return the value of X with the sign of Y. NOTE: This
231 // DAG node does not require that X and Y have the same type, just that they
232 // are both floating point. X and the result must have the same type.
233 // FCOPYSIGN(f32, f64) is allowed.
236 // INT = FGETSIGN(FP) - Return the sign bit of the specified floating point
237 // value as an integer 0/1 value.
240 /// BUILD_VECTOR(ELT0, ELT1, ELT2, ELT3,...) - Return a vector with the
241 /// specified, possibly variable, elements. The number of elements is
242 /// required to be a power of two. The types of the operands must all be
243 /// the same and must match the vector element type, except that integer
244 /// types are allowed to be larger than the element type, in which case
245 /// the operands are implicitly truncated.
248 /// INSERT_VECTOR_ELT(VECTOR, VAL, IDX) - Returns VECTOR with the element
249 /// at IDX replaced with VAL. If the type of VAL is larger than the vector
250 /// element type then VAL is truncated before replacement.
253 /// EXTRACT_VECTOR_ELT(VECTOR, IDX) - Returns a single element from VECTOR
254 /// identified by the (potentially variable) element number IDX. If the
255 /// return type is an integer type larger than the element type of the
256 /// vector, the result is extended to the width of the return type.
259 /// CONCAT_VECTORS(VECTOR0, VECTOR1, ...) - Given a number of values of
260 /// vector type with the same length and element type, this produces a
261 /// concatenated vector result value, with length equal to the sum of the
262 /// lengths of the input vectors.
265 /// INSERT_SUBVECTOR(VECTOR1, VECTOR2, IDX) - Returns a vector
266 /// with VECTOR2 inserted into VECTOR1 at the (potentially
267 /// variable) element number IDX, which must be a multiple of the
268 /// VECTOR2 vector length. The elements of VECTOR1 starting at
269 /// IDX are overwritten with VECTOR2. Elements IDX through
270 /// vector_length(VECTOR2) must be valid VECTOR1 indices.
273 /// EXTRACT_SUBVECTOR(VECTOR, IDX) - Returns a subvector from VECTOR (an
274 /// vector value) starting with the element number IDX, which must be a
275 /// constant multiple of the result vector length.
278 /// VECTOR_SHUFFLE(VEC1, VEC2) - Returns a vector, of the same type as
279 /// VEC1/VEC2. A VECTOR_SHUFFLE node also contains an array of constant int
280 /// values that indicate which value (or undef) each result element will
281 /// get. These constant ints are accessible through the
282 /// ShuffleVectorSDNode class. This is quite similar to the Altivec
283 /// 'vperm' instruction, except that the indices must be constants and are
284 /// in terms of the element size of VEC1/VEC2, not in terms of bytes.
287 /// SCALAR_TO_VECTOR(VAL) - This represents the operation of loading a
288 /// scalar value into element 0 of the resultant vector type. The top
289 /// elements 1 to N-1 of the N-element vector are undefined. The type
290 /// of the operand must match the vector element type, except when they
291 /// are integer types. In this case the operand is allowed to be wider
292 /// than the vector element type, and is implicitly truncated to it.
295 // MULHU/MULHS - Multiply high - Multiply two integers of type iN, producing
296 // an unsigned/signed value of type i[2*N], then return the top part.
299 /// Bitwise operators - logical and, logical or, logical xor.
302 /// Shift and rotation operations. After legalization, the type of the
303 /// shift amount is known to be TLI.getShiftAmountTy(). Before legalization
304 /// the shift amount can be any type, but care must be taken to ensure it is
305 /// large enough. TLI.getShiftAmountTy() is i8 on some targets, but before
306 /// legalization, types like i1024 can occur and i8 doesn't have enough bits
307 /// to represent the shift amount. By convention, DAGCombine and
308 /// SelectionDAGBuilder forces these shift amounts to i32 for simplicity.
310 SHL, SRA, SRL, ROTL, ROTR,
312 /// Byte Swap and Counting operators.
313 BSWAP, CTTZ, CTLZ, CTPOP,
315 /// Bit counting operators with an undefined result for zero inputs.
316 CTTZ_ZERO_UNDEF, CTLZ_ZERO_UNDEF,
318 // Select(COND, TRUEVAL, FALSEVAL). If the type of the boolean COND is not
319 // i1 then the high bits must conform to getBooleanContents.
322 // Select with a vector condition (op #0) and two vector operands (ops #1
323 // and #2), returning a vector result. All vectors have the same length.
324 // Much like the scalar select and setcc, each bit in the condition selects
325 // whether the corresponding result element is taken from op #1 or op #2.
328 // Select with condition operator - This selects between a true value and
329 // a false value (ops #2 and #3) based on the boolean result of comparing
330 // the lhs and rhs (ops #0 and #1) of a conditional expression with the
331 // condition code in op #4, a CondCodeSDNode.
334 // SetCC operator - This evaluates to a true value iff the condition is
335 // true. If the result value type is not i1 then the high bits conform
336 // to getBooleanContents. The operands to this are the left and right
337 // operands to compare (ops #0, and #1) and the condition code to compare
338 // them with (op #2) as a CondCodeSDNode. If the operands are vector types
339 // then the result type must also be a vector type.
342 // SHL_PARTS/SRA_PARTS/SRL_PARTS - These operators are used for expanded
343 // integer shift operations, just like ADD/SUB_PARTS. The operation
345 // [Lo,Hi] = op [LoLHS,HiLHS], Amt
346 SHL_PARTS, SRA_PARTS, SRL_PARTS,
348 // Conversion operators. These are all single input single output
349 // operations. For all of these, the result type must be strictly
350 // wider or narrower (depending on the operation) than the source
353 // SIGN_EXTEND - Used for integer types, replicating the sign bit
357 // ZERO_EXTEND - Used for integer types, zeroing the new bits.
360 // ANY_EXTEND - Used for integer types. The high bits are undefined.
363 // TRUNCATE - Completely drop the high bits.
366 // [SU]INT_TO_FP - These operators convert integers (whose interpreted sign
367 // depends on the first letter) to floating point.
371 // SIGN_EXTEND_INREG - This operator atomically performs a SHL/SRA pair to
372 // sign extend a small value in a large integer register (e.g. sign
373 // extending the low 8 bits of a 32-bit register to fill the top 24 bits
374 // with the 7th bit). The size of the smaller type is indicated by the 1th
375 // operand, a ValueType node.
378 /// FP_TO_[US]INT - Convert a floating point value to a signed or unsigned
383 /// X = FP_ROUND(Y, TRUNC) - Rounding 'Y' from a larger floating point type
384 /// down to the precision of the destination VT. TRUNC is a flag, which is
385 /// always an integer that is zero or one. If TRUNC is 0, this is a
386 /// normal rounding, if it is 1, this FP_ROUND is known to not change the
389 /// The TRUNC = 1 case is used in cases where we know that the value will
390 /// not be modified by the node, because Y is not using any of the extra
391 /// precision of source type. This allows certain transformations like
392 /// FP_EXTEND(FP_ROUND(X,1)) -> X which are not safe for
393 /// FP_EXTEND(FP_ROUND(X,0)) because the extra bits aren't removed.
396 // FLT_ROUNDS_ - Returns current rounding mode:
399 // 1 Round to nearest
404 /// X = FP_ROUND_INREG(Y, VT) - This operator takes an FP register, and
405 /// rounds it to a floating point value. It then promotes it and returns it
406 /// in a register of the same size. This operation effectively just
407 /// discards excess precision. The type to round down to is specified by
408 /// the VT operand, a VTSDNode.
411 /// X = FP_EXTEND(Y) - Extend a smaller FP type into a larger FP type.
414 // BITCAST - This operator converts between integer, vector and FP
415 // values, as if the value was stored to memory with one type and loaded
416 // from the same address with the other type (or equivalently for vector
417 // format conversions, etc). The source and result are required to have
418 // the same bit size (e.g. f32 <-> i32). This can also be used for
419 // int-to-int or fp-to-fp conversions, but that is a noop, deleted by
423 // CONVERT_RNDSAT - This operator is used to support various conversions
424 // between various types (float, signed, unsigned and vectors of those
425 // types) with rounding and saturation. NOTE: Avoid using this operator as
426 // most target don't support it and the operator might be removed in the
427 // future. It takes the following arguments:
429 // 1) dest type (type to convert to)
430 // 2) src type (type to convert from)
433 // 5) ISD::CvtCode indicating the type of conversion to do
436 // FP16_TO_FP32, FP32_TO_FP16 - These operators are used to perform
437 // promotions and truncation for half-precision (16 bit) floating
438 // numbers. We need special nodes since FP16 is a storage-only type with
439 // special semantics of operations.
440 FP16_TO_FP32, FP32_TO_FP16,
442 // FNEG, FABS, FSQRT, FSIN, FCOS, FPOWI, FPOW,
443 // FLOG, FLOG2, FLOG10, FEXP, FEXP2,
444 // FCEIL, FTRUNC, FRINT, FNEARBYINT, FFLOOR - Perform various unary floating
445 // point operations. These are inspired by libm.
446 FNEG, FABS, FSQRT, FSIN, FCOS, FPOWI, FPOW,
447 FLOG, FLOG2, FLOG10, FEXP, FEXP2,
448 FCEIL, FTRUNC, FRINT, FNEARBYINT, FFLOOR,
450 // LOAD and STORE have token chains as their first operand, then the same
451 // operands as an LLVM load/store instruction, then an offset node that
452 // is added / subtracted from the base pointer to form the address (for
453 // indexed memory ops).
456 // DYNAMIC_STACKALLOC - Allocate some number of bytes on the stack aligned
457 // to a specified boundary. This node always has two return values: a new
458 // stack pointer value and a chain. The first operand is the token chain,
459 // the second is the number of bytes to allocate, and the third is the
460 // alignment boundary. The size is guaranteed to be a multiple of the stack
461 // alignment, and the alignment is guaranteed to be bigger than the stack
462 // alignment (if required) or 0 to get standard stack alignment.
465 // Control flow instructions. These all have token chains.
467 // BR - Unconditional branch. The first operand is the chain
468 // operand, the second is the MBB to branch to.
471 // BRIND - Indirect branch. The first operand is the chain, the second
472 // is the value to branch to, which must be of the same type as the target's
476 // BR_JT - Jumptable branch. The first operand is the chain, the second
477 // is the jumptable index, the last one is the jumptable entry index.
480 // BRCOND - Conditional branch. The first operand is the chain, the
481 // second is the condition, the third is the block to branch to if the
482 // condition is true. If the type of the condition is not i1, then the
483 // high bits must conform to getBooleanContents.
486 // BR_CC - Conditional branch. The behavior is like that of SELECT_CC, in
487 // that the condition is represented as condition code, and two nodes to
488 // compare, rather than as a combined SetCC node. The operands in order are
489 // chain, cc, lhs, rhs, block to branch to if condition is true.
492 // INLINEASM - Represents an inline asm block. This node always has two
493 // return values: a chain and a flag result. The inputs are as follows:
494 // Operand #0 : Input chain.
495 // Operand #1 : a ExternalSymbolSDNode with a pointer to the asm string.
496 // Operand #2 : a MDNodeSDNode with the !srcloc metadata.
497 // Operand #3 : HasSideEffect, IsAlignStack bits.
498 // After this, it is followed by a list of operands with this format:
499 // ConstantSDNode: Flags that encode whether it is a mem or not, the
500 // of operands that follow, etc. See InlineAsm.h.
501 // ... however many operands ...
502 // Operand #last: Optional, an incoming flag.
504 // The variable width operands are required to represent target addressing
505 // modes as a single "operand", even though they may have multiple
509 // EH_LABEL - Represents a label in mid basic block used to track
510 // locations needed for debug and exception handling tables. These nodes
511 // take a chain as input and return a chain.
514 // STACKSAVE - STACKSAVE has one operand, an input chain. It produces a
515 // value, the same type as the pointer type for the system, and an output
519 // STACKRESTORE has two operands, an input chain and a pointer to restore to
520 // it returns an output chain.
523 // CALLSEQ_START/CALLSEQ_END - These operators mark the beginning and end of
524 // a call sequence, and carry arbitrary information that target might want
525 // to know. The first operand is a chain, the rest are specified by the
526 // target and not touched by the DAG optimizers.
527 // CALLSEQ_START..CALLSEQ_END pairs may not be nested.
528 CALLSEQ_START, // Beginning of a call sequence
529 CALLSEQ_END, // End of a call sequence
531 // VAARG - VAARG has four operands: an input chain, a pointer, a SRCVALUE,
532 // and the alignment. It returns a pair of values: the vaarg value and a
536 // VACOPY - VACOPY has five operands: an input chain, a destination pointer,
537 // a source pointer, a SRCVALUE for the destination, and a SRCVALUE for the
541 // VAEND, VASTART - VAEND and VASTART have three operands: an input chain, a
542 // pointer, and a SRCVALUE.
545 // SRCVALUE - This is a node type that holds a Value* that is used to
546 // make reference to a value in the LLVM IR.
549 // MDNODE_SDNODE - This is a node that holdes an MDNode*, which is used to
550 // reference metadata in the IR.
553 // PCMARKER - This corresponds to the pcmarker intrinsic.
556 // READCYCLECOUNTER - This corresponds to the readcyclecounter intrinsic.
557 // The only operand is a chain and a value and a chain are produced. The
558 // value is the contents of the architecture specific cycle counter like
559 // register (or other high accuracy low latency clock source)
562 // HANDLENODE node - Used as a handle for various purposes.
565 // INIT_TRAMPOLINE - This corresponds to the init_trampoline intrinsic. It
566 // takes as input a token chain, the pointer to the trampoline, the pointer
567 // to the nested function, the pointer to pass for the 'nest' parameter, a
568 // SRCVALUE for the trampoline and another for the nested function (allowing
569 // targets to access the original Function*). It produces a token chain as
573 // ADJUST_TRAMPOLINE - This corresponds to the adjust_trampoline intrinsic.
574 // It takes a pointer to the trampoline and produces a (possibly) new
575 // pointer to the same trampoline with platform-specific adjustments
576 // applied. The pointer it returns points to an executable block of code.
579 // TRAP - Trapping instruction
582 // PREFETCH - This corresponds to a prefetch intrinsic. It takes chains are
583 // their first operand. The other operands are the address to prefetch,
584 // read / write specifier, locality specifier and instruction / data cache
588 // OUTCHAIN = MEMBARRIER(INCHAIN, load-load, load-store, store-load,
589 // store-store, device)
590 // This corresponds to the memory.barrier intrinsic.
591 // it takes an input chain, 4 operands to specify the type of barrier, an
592 // operand specifying if the barrier applies to device and uncached memory
593 // and produces an output chain.
596 // OUTCHAIN = ATOMIC_FENCE(INCHAIN, ordering, scope)
597 // This corresponds to the fence instruction. It takes an input chain, and
598 // two integer constants: an AtomicOrdering and a SynchronizationScope.
601 // Val, OUTCHAIN = ATOMIC_LOAD(INCHAIN, ptr)
602 // This corresponds to "load atomic" instruction.
605 // OUTCHAIN = ATOMIC_LOAD(INCHAIN, ptr, val)
606 // This corresponds to "store atomic" instruction.
609 // Val, OUTCHAIN = ATOMIC_CMP_SWAP(INCHAIN, ptr, cmp, swap)
610 // This corresponds to the cmpxchg instruction.
613 // Val, OUTCHAIN = ATOMIC_SWAP(INCHAIN, ptr, amt)
614 // Val, OUTCHAIN = ATOMIC_LOAD_[OpName](INCHAIN, ptr, amt)
615 // These correspond to the atomicrmw instruction.
628 /// BUILTIN_OP_END - This must be the last enum value in this list.
629 /// The target-specific pre-isel opcode values start here.
633 /// FIRST_TARGET_MEMORY_OPCODE - Target-specific pre-isel operations
634 /// which do not reference a specific memory location should be less than
635 /// this value. Those that do must not be less than this value, and can
636 /// be used with SelectionDAG::getMemIntrinsicNode.
637 static const int FIRST_TARGET_MEMORY_OPCODE = BUILTIN_OP_END+150;
639 //===--------------------------------------------------------------------===//
640 /// MemIndexedMode enum - This enum defines the load / store indexed
641 /// addressing modes.
643 /// UNINDEXED "Normal" load / store. The effective address is already
644 /// computed and is available in the base pointer. The offset
645 /// operand is always undefined. In addition to producing a
646 /// chain, an unindexed load produces one value (result of the
647 /// load); an unindexed store does not produce a value.
649 /// PRE_INC Similar to the unindexed mode where the effective address is
650 /// PRE_DEC the value of the base pointer add / subtract the offset.
651 /// It considers the computation as being folded into the load /
652 /// store operation (i.e. the load / store does the address
653 /// computation as well as performing the memory transaction).
654 /// The base operand is always undefined. In addition to
655 /// producing a chain, pre-indexed load produces two values
656 /// (result of the load and the result of the address
657 /// computation); a pre-indexed store produces one value (result
658 /// of the address computation).
660 /// POST_INC The effective address is the value of the base pointer. The
661 /// POST_DEC value of the offset operand is then added to / subtracted
662 /// from the base after memory transaction. In addition to
663 /// producing a chain, post-indexed load produces two values
664 /// (the result of the load and the result of the base +/- offset
665 /// computation); a post-indexed store produces one value (the
666 /// the result of the base +/- offset computation).
667 enum MemIndexedMode {
676 //===--------------------------------------------------------------------===//
677 /// LoadExtType enum - This enum defines the three variants of LOADEXT
678 /// (load with extension).
680 /// SEXTLOAD loads the integer operand and sign extends it to a larger
681 /// integer result type.
682 /// ZEXTLOAD loads the integer operand and zero extends it to a larger
683 /// integer result type.
684 /// EXTLOAD is used for two things: floating point extending loads and
685 /// integer extending loads [the top bits are undefined].
694 //===--------------------------------------------------------------------===//
695 /// ISD::CondCode enum - These are ordered carefully to make the bitfields
696 /// below work out, when considering SETFALSE (something that never exists
697 /// dynamically) as 0. "U" -> Unsigned (for integer operands) or Unordered
698 /// (for floating point), "L" -> Less than, "G" -> Greater than, "E" -> Equal
699 /// to. If the "N" column is 1, the result of the comparison is undefined if
700 /// the input is a NAN.
702 /// All of these (except for the 'always folded ops') should be handled for
703 /// floating point. For integer, only the SETEQ,SETNE,SETLT,SETLE,SETGT,
704 /// SETGE,SETULT,SETULE,SETUGT, and SETUGE opcodes are used.
706 /// Note that these are laid out in a specific order to allow bit-twiddling
707 /// to transform conditions.
709 // Opcode N U L G E Intuitive operation
710 SETFALSE, // 0 0 0 0 Always false (always folded)
711 SETOEQ, // 0 0 0 1 True if ordered and equal
712 SETOGT, // 0 0 1 0 True if ordered and greater than
713 SETOGE, // 0 0 1 1 True if ordered and greater than or equal
714 SETOLT, // 0 1 0 0 True if ordered and less than
715 SETOLE, // 0 1 0 1 True if ordered and less than or equal
716 SETONE, // 0 1 1 0 True if ordered and operands are unequal
717 SETO, // 0 1 1 1 True if ordered (no nans)
718 SETUO, // 1 0 0 0 True if unordered: isnan(X) | isnan(Y)
719 SETUEQ, // 1 0 0 1 True if unordered or equal
720 SETUGT, // 1 0 1 0 True if unordered or greater than
721 SETUGE, // 1 0 1 1 True if unordered, greater than, or equal
722 SETULT, // 1 1 0 0 True if unordered or less than
723 SETULE, // 1 1 0 1 True if unordered, less than, or equal
724 SETUNE, // 1 1 1 0 True if unordered or not equal
725 SETTRUE, // 1 1 1 1 Always true (always folded)
726 // Don't care operations: undefined if the input is a nan.
727 SETFALSE2, // 1 X 0 0 0 Always false (always folded)
728 SETEQ, // 1 X 0 0 1 True if equal
729 SETGT, // 1 X 0 1 0 True if greater than
730 SETGE, // 1 X 0 1 1 True if greater than or equal
731 SETLT, // 1 X 1 0 0 True if less than
732 SETLE, // 1 X 1 0 1 True if less than or equal
733 SETNE, // 1 X 1 1 0 True if not equal
734 SETTRUE2, // 1 X 1 1 1 Always true (always folded)
736 SETCC_INVALID // Marker value.
739 /// isSignedIntSetCC - Return true if this is a setcc instruction that
740 /// performs a signed comparison when used with integer operands.
741 inline bool isSignedIntSetCC(CondCode Code) {
742 return Code == SETGT || Code == SETGE || Code == SETLT || Code == SETLE;
745 /// isUnsignedIntSetCC - Return true if this is a setcc instruction that
746 /// performs an unsigned comparison when used with integer operands.
747 inline bool isUnsignedIntSetCC(CondCode Code) {
748 return Code == SETUGT || Code == SETUGE || Code == SETULT || Code == SETULE;
751 /// isTrueWhenEqual - Return true if the specified condition returns true if
752 /// the two operands to the condition are equal. Note that if one of the two
753 /// operands is a NaN, this value is meaningless.
754 inline bool isTrueWhenEqual(CondCode Cond) {
755 return ((int)Cond & 1) != 0;
758 /// getUnorderedFlavor - This function returns 0 if the condition is always
759 /// false if an operand is a NaN, 1 if the condition is always true if the
760 /// operand is a NaN, and 2 if the condition is undefined if the operand is a
762 inline unsigned getUnorderedFlavor(CondCode Cond) {
763 return ((int)Cond >> 3) & 3;
766 /// getSetCCInverse - Return the operation corresponding to !(X op Y), where
767 /// 'op' is a valid SetCC operation.
768 CondCode getSetCCInverse(CondCode Operation, bool isInteger);
770 /// getSetCCSwappedOperands - Return the operation corresponding to (Y op X)
771 /// when given the operation for (X op Y).
772 CondCode getSetCCSwappedOperands(CondCode Operation);
774 /// getSetCCOrOperation - Return the result of a logical OR between different
775 /// comparisons of identical values: ((X op1 Y) | (X op2 Y)). This
776 /// function returns SETCC_INVALID if it is not possible to represent the
777 /// resultant comparison.
778 CondCode getSetCCOrOperation(CondCode Op1, CondCode Op2, bool isInteger);
780 /// getSetCCAndOperation - Return the result of a logical AND between
781 /// different comparisons of identical values: ((X op1 Y) & (X op2 Y)). This
782 /// function returns SETCC_INVALID if it is not possible to represent the
783 /// resultant comparison.
784 CondCode getSetCCAndOperation(CondCode Op1, CondCode Op2, bool isInteger);
786 //===--------------------------------------------------------------------===//
787 /// CvtCode enum - This enum defines the various converts CONVERT_RNDSAT
790 CVT_FF, // Float from Float
791 CVT_FS, // Float from Signed
792 CVT_FU, // Float from Unsigned
793 CVT_SF, // Signed from Float
794 CVT_UF, // Unsigned from Float
795 CVT_SS, // Signed from Signed
796 CVT_SU, // Signed from Unsigned
797 CVT_US, // Unsigned from Signed
798 CVT_UU, // Unsigned from Unsigned
799 CVT_INVALID // Marker - Invalid opcode
802 } // end llvm::ISD namespace
804 } // end llvm namespace