2010-04-14 18:44:34 +00:00
|
|
|
//===-- llvm/CodeGen/ISDOpcodes.h - CodeGen opcodes -------------*- C++ -*-===//
|
|
|
|
//
|
|
|
|
// The LLVM Compiler Infrastructure
|
|
|
|
//
|
|
|
|
// This file is distributed under the University of Illinois Open Source
|
|
|
|
// License. See LICENSE.TXT for details.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
//
|
|
|
|
// This file declares codegen opcodes and related utilities.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
|
|
|
#ifndef LLVM_CODEGEN_ISDOPCODES_H
|
|
|
|
#define LLVM_CODEGEN_ISDOPCODES_H
|
|
|
|
|
|
|
|
namespace llvm {
|
|
|
|
|
|
|
|
/// ISD namespace - This namespace contains an enum which represents all of the
|
|
|
|
/// SelectionDAG node types and value types.
|
|
|
|
///
|
|
|
|
namespace ISD {
|
|
|
|
|
|
|
|
//===--------------------------------------------------------------------===//
|
|
|
|
/// ISD::NodeType enum - This enum defines the target-independent operators
|
|
|
|
/// for a SelectionDAG.
|
|
|
|
///
|
|
|
|
/// Targets may also define target-dependent operator codes for SDNodes. For
|
|
|
|
/// example, on x86, these are the enum values in the X86ISD namespace.
|
|
|
|
/// Targets should aim to use target-independent operators to model their
|
|
|
|
/// instruction sets as much as possible, and only use target-dependent
|
|
|
|
/// operators when they have special requirements.
|
|
|
|
///
|
|
|
|
/// Finally, during and after selection proper, SNodes may use special
|
|
|
|
/// operator codes that correspond directly with MachineInstr opcodes. These
|
|
|
|
/// are used to represent selected instructions. See the isMachineOpcode()
|
|
|
|
/// and getMachineOpcode() member functions of SDNode.
|
|
|
|
///
|
|
|
|
enum NodeType {
|
2012-07-23 09:04:00 +00:00
|
|
|
/// DELETED_NODE - This is an illegal value that is used to catch
|
|
|
|
/// errors. This opcode is not a legal opcode for any node.
|
2010-04-14 18:44:34 +00:00
|
|
|
DELETED_NODE,
|
|
|
|
|
2012-07-23 09:04:00 +00:00
|
|
|
/// EntryToken - This is the marker used to indicate the start of a region.
|
2010-04-14 18:44:34 +00:00
|
|
|
EntryToken,
|
|
|
|
|
2012-07-23 09:04:00 +00:00
|
|
|
/// TokenFactor - This node takes multiple tokens as input and produces a
|
|
|
|
/// single token result. This is used to represent the fact that the operand
|
|
|
|
/// operators are independent of each other.
|
2010-04-14 18:44:34 +00:00
|
|
|
TokenFactor,
|
|
|
|
|
2012-07-23 09:04:00 +00:00
|
|
|
/// AssertSext, AssertZext - These nodes record if a register contains a
|
|
|
|
/// value that has already been zero or sign extended from a narrower type.
|
|
|
|
/// These nodes take two operands. The first is the node that has already
|
|
|
|
/// been extended, and the second is a value type node indicating the width
|
|
|
|
/// of the extension
|
2010-04-14 18:44:34 +00:00
|
|
|
AssertSext, AssertZext,
|
|
|
|
|
2012-07-23 09:04:00 +00:00
|
|
|
/// Various leaf nodes.
|
2012-01-18 23:52:12 +00:00
|
|
|
BasicBlock, VALUETYPE, CONDCODE, Register, RegisterMask,
|
2010-04-14 18:44:34 +00:00
|
|
|
Constant, ConstantFP,
|
|
|
|
GlobalAddress, GlobalTLSAddress, FrameIndex,
|
|
|
|
JumpTable, ConstantPool, ExternalSymbol, BlockAddress,
|
|
|
|
|
2012-07-23 09:04:00 +00:00
|
|
|
/// The address of the GOT
|
2010-04-14 18:44:34 +00:00
|
|
|
GLOBAL_OFFSET_TABLE,
|
|
|
|
|
2012-07-23 09:04:00 +00:00
|
|
|
/// FRAMEADDR, RETURNADDR - These nodes represent llvm.frameaddress and
|
|
|
|
/// llvm.returnaddress on the DAG. These nodes take one operand, the index
|
|
|
|
/// of the frame or return address to return. An index of zero corresponds
|
|
|
|
/// to the current function's frame or return address, an index of one to
|
|
|
|
/// the parent's frame or return address, and so on.
|
2010-04-14 18:44:34 +00:00
|
|
|
FRAMEADDR, RETURNADDR,
|
|
|
|
|
2015-01-13 01:51:34 +00:00
|
|
|
/// FRAME_ALLOC_RECOVER - Represents the llvm.framerecover
|
2015-01-13 00:48:10 +00:00
|
|
|
/// intrinsic. Materializes the offset from the frame pointer of another
|
|
|
|
/// function to the result of llvm.frameallocate.
|
2015-01-13 01:51:34 +00:00
|
|
|
FRAME_ALLOC_RECOVER,
|
2015-01-13 00:48:10 +00:00
|
|
|
|
2014-05-06 16:51:25 +00:00
|
|
|
/// READ_REGISTER, WRITE_REGISTER - This node represents llvm.register on
|
|
|
|
/// the DAG, which implements the named register global variables extension.
|
|
|
|
READ_REGISTER,
|
|
|
|
WRITE_REGISTER,
|
|
|
|
|
2012-07-23 09:04:00 +00:00
|
|
|
/// FRAME_TO_ARGS_OFFSET - This node represents offset from frame pointer to
|
|
|
|
/// first (possible) on-stack argument. This is needed for correct stack
|
|
|
|
/// adjustment during unwind.
|
2010-04-14 18:44:34 +00:00
|
|
|
FRAME_TO_ARGS_OFFSET,
|
|
|
|
|
2012-07-23 09:04:00 +00:00
|
|
|
/// OUTCHAIN = EH_RETURN(INCHAIN, OFFSET, HANDLER) - This node represents
|
|
|
|
/// 'eh_return' gcc dwarf builtin, which is used to return from
|
|
|
|
/// exception. The general meaning is: adjust stack by OFFSET and pass
|
|
|
|
/// execution to HANDLER. Many platform-related details also :)
|
2010-04-14 18:44:34 +00:00
|
|
|
EH_RETURN,
|
|
|
|
|
2012-07-23 09:04:00 +00:00
|
|
|
/// RESULT, OUTCHAIN = EH_SJLJ_SETJMP(INCHAIN, buffer)
|
|
|
|
/// This corresponds to the eh.sjlj.setjmp intrinsic.
|
|
|
|
/// It takes an input chain and a pointer to the jump buffer as inputs
|
|
|
|
/// and returns an outchain.
|
2010-05-26 20:22:18 +00:00
|
|
|
EH_SJLJ_SETJMP,
|
2010-05-22 01:06:18 +00:00
|
|
|
|
2012-07-23 09:04:00 +00:00
|
|
|
/// OUTCHAIN = EH_SJLJ_LONGJMP(INCHAIN, buffer)
|
|
|
|
/// This corresponds to the eh.sjlj.longjmp intrinsic.
|
|
|
|
/// It takes an input chain and a pointer to the jump buffer as inputs
|
|
|
|
/// and returns an outchain.
|
2010-05-22 01:06:18 +00:00
|
|
|
EH_SJLJ_LONGJMP,
|
|
|
|
|
2012-07-23 09:04:00 +00:00
|
|
|
/// TargetConstant* - Like Constant*, but the DAG does not do any folding,
|
|
|
|
/// simplification, or lowering of the constant. They are used for constants
|
|
|
|
/// which are known to fit in the immediate fields of their users, or for
|
|
|
|
/// carrying magic numbers which are not values which need to be
|
|
|
|
/// materialized in registers.
|
2010-04-14 18:44:34 +00:00
|
|
|
TargetConstant,
|
|
|
|
TargetConstantFP,
|
|
|
|
|
2012-07-23 09:04:00 +00:00
|
|
|
/// TargetGlobalAddress - Like GlobalAddress, but the DAG does no folding or
|
|
|
|
/// anything else with this node, and this is valid in the target-specific
|
|
|
|
/// dag, turning into a GlobalAddress operand.
|
2010-04-14 18:44:34 +00:00
|
|
|
TargetGlobalAddress,
|
|
|
|
TargetGlobalTLSAddress,
|
|
|
|
TargetFrameIndex,
|
|
|
|
TargetJumpTable,
|
|
|
|
TargetConstantPool,
|
|
|
|
TargetExternalSymbol,
|
|
|
|
TargetBlockAddress,
|
|
|
|
|
2012-08-07 22:37:05 +00:00
|
|
|
/// TargetIndex - Like a constant pool entry, but with completely
|
|
|
|
/// target-dependent semantics. Holds target flags, a 32-bit index, and a
|
|
|
|
/// 64-bit index. Targets can use this however they like.
|
|
|
|
TargetIndex,
|
|
|
|
|
2010-04-14 18:44:34 +00:00
|
|
|
/// RESULT = INTRINSIC_WO_CHAIN(INTRINSICID, arg1, arg2, ...)
|
|
|
|
/// This node represents a target intrinsic function with no side effects.
|
|
|
|
/// The first operand is the ID number of the intrinsic from the
|
|
|
|
/// llvm::Intrinsic namespace. The operands to the intrinsic follow. The
|
2010-06-18 17:40:42 +00:00
|
|
|
/// node returns the result of the intrinsic.
|
2010-04-14 18:44:34 +00:00
|
|
|
INTRINSIC_WO_CHAIN,
|
|
|
|
|
|
|
|
/// RESULT,OUTCHAIN = INTRINSIC_W_CHAIN(INCHAIN, INTRINSICID, arg1, ...)
|
|
|
|
/// This node represents a target intrinsic function with side effects that
|
|
|
|
/// returns a result. The first operand is a chain pointer. The second is
|
|
|
|
/// the ID number of the intrinsic from the llvm::Intrinsic namespace. The
|
|
|
|
/// operands to the intrinsic follow. The node has two results, the result
|
|
|
|
/// of the intrinsic and an output chain.
|
|
|
|
INTRINSIC_W_CHAIN,
|
|
|
|
|
|
|
|
/// OUTCHAIN = INTRINSIC_VOID(INCHAIN, INTRINSICID, arg1, arg2, ...)
|
|
|
|
/// This node represents a target intrinsic function with side effects that
|
|
|
|
/// does not return a result. The first operand is a chain pointer. The
|
|
|
|
/// second is the ID number of the intrinsic from the llvm::Intrinsic
|
|
|
|
/// namespace. The operands to the intrinsic follow.
|
|
|
|
INTRINSIC_VOID,
|
|
|
|
|
2012-07-23 09:04:00 +00:00
|
|
|
/// CopyToReg - This node has three operands: a chain, a register number to
|
|
|
|
/// set to this value, and a value.
|
2010-04-14 18:44:34 +00:00
|
|
|
CopyToReg,
|
|
|
|
|
2012-07-23 09:04:00 +00:00
|
|
|
/// CopyFromReg - This node indicates that the input value is a virtual or
|
|
|
|
/// physical register that is defined outside of the scope of this
|
|
|
|
/// SelectionDAG. The register is available from the RegisterSDNode object.
|
2010-04-14 18:44:34 +00:00
|
|
|
CopyFromReg,
|
|
|
|
|
2012-07-23 09:04:00 +00:00
|
|
|
/// UNDEF - An undefined node.
|
2010-04-14 18:44:34 +00:00
|
|
|
UNDEF,
|
|
|
|
|
2012-07-23 09:04:00 +00:00
|
|
|
/// EXTRACT_ELEMENT - This is used to get the lower or upper (determined by
|
|
|
|
/// a Constant, which is required to be operand #1) half of the integer or
|
|
|
|
/// float value specified as operand #0. This is only for use before
|
|
|
|
/// legalization, for values that will be broken into multiple registers.
|
2010-04-14 18:44:34 +00:00
|
|
|
EXTRACT_ELEMENT,
|
|
|
|
|
2012-07-23 09:04:00 +00:00
|
|
|
/// BUILD_PAIR - This is the opposite of EXTRACT_ELEMENT in some ways.
|
|
|
|
/// Given two values of the same integer value type, this produces a value
|
|
|
|
/// twice as big. Like EXTRACT_ELEMENT, this can only be used before
|
|
|
|
/// legalization.
|
2010-04-14 18:44:34 +00:00
|
|
|
BUILD_PAIR,
|
|
|
|
|
2012-07-23 09:04:00 +00:00
|
|
|
/// MERGE_VALUES - This node takes multiple discrete operands and returns
|
|
|
|
/// them all as its individual results. This nodes has exactly the same
|
|
|
|
/// number of inputs and outputs. This node is useful for some pieces of the
|
|
|
|
/// code generator that want to think about a single node with multiple
|
|
|
|
/// results, not multiple nodes.
|
2010-04-14 18:44:34 +00:00
|
|
|
MERGE_VALUES,
|
|
|
|
|
2012-07-23 09:04:00 +00:00
|
|
|
/// Simple integer binary arithmetic operators.
|
2010-04-14 18:44:34 +00:00
|
|
|
ADD, SUB, MUL, SDIV, UDIV, SREM, UREM,
|
|
|
|
|
2012-07-23 09:04:00 +00:00
|
|
|
/// SMUL_LOHI/UMUL_LOHI - Multiply two integers of type iN, producing
|
|
|
|
/// a signed/unsigned value of type i[2*N], and return the full value as
|
|
|
|
/// two results, each of type iN.
|
2010-04-14 18:44:34 +00:00
|
|
|
SMUL_LOHI, UMUL_LOHI,
|
|
|
|
|
2012-07-23 09:04:00 +00:00
|
|
|
/// SDIVREM/UDIVREM - Divide two integers and produce both a quotient and
|
|
|
|
/// remainder result.
|
2010-04-14 18:44:34 +00:00
|
|
|
SDIVREM, UDIVREM,
|
|
|
|
|
2012-07-23 09:04:00 +00:00
|
|
|
/// CARRY_FALSE - This node is used when folding other nodes,
|
|
|
|
/// like ADDC/SUBC, which indicate the carry result is always false.
|
2010-04-14 18:44:34 +00:00
|
|
|
CARRY_FALSE,
|
|
|
|
|
2012-07-23 09:04:00 +00:00
|
|
|
/// Carry-setting nodes for multiple precision addition and subtraction.
|
|
|
|
/// These nodes take two operands of the same value type, and produce two
|
|
|
|
/// results. The first result is the normal add or sub result, the second
|
|
|
|
/// result is the carry flag result.
|
2010-04-14 18:44:34 +00:00
|
|
|
ADDC, SUBC,
|
|
|
|
|
2012-07-23 09:04:00 +00:00
|
|
|
/// Carry-using nodes for multiple precision addition and subtraction. These
|
|
|
|
/// nodes take three operands: The first two are the normal lhs and rhs to
|
|
|
|
/// the add or sub, and the third is the input carry flag. These nodes
|
|
|
|
/// produce two results; the normal result of the add or sub, and the output
|
|
|
|
/// carry flag. These nodes both read and write a carry flag to allow them
|
|
|
|
/// to them to be chained together for add and sub of arbitrarily large
|
|
|
|
/// values.
|
2010-04-14 18:44:34 +00:00
|
|
|
ADDE, SUBE,
|
|
|
|
|
2012-07-23 09:04:00 +00:00
|
|
|
/// RESULT, BOOL = [SU]ADDO(LHS, RHS) - Overflow-aware nodes for addition.
|
|
|
|
/// These nodes take two operands: the normal LHS and RHS to the add. They
|
|
|
|
/// produce two results: the normal result of the add, and a boolean that
|
|
|
|
/// indicates if an overflow occurred (*not* a flag, because it may be store
|
|
|
|
/// to memory, etc.). If the type of the boolean is not i1 then the high
|
|
|
|
/// bits conform to getBooleanContents.
|
|
|
|
/// These nodes are generated from llvm.[su]add.with.overflow intrinsics.
|
2010-04-14 18:44:34 +00:00
|
|
|
SADDO, UADDO,
|
|
|
|
|
2012-07-23 09:04:00 +00:00
|
|
|
/// Same for subtraction.
|
2010-04-14 18:44:34 +00:00
|
|
|
SSUBO, USUBO,
|
|
|
|
|
2012-07-23 09:04:00 +00:00
|
|
|
/// Same for multiplication.
|
2010-04-14 18:44:34 +00:00
|
|
|
SMULO, UMULO,
|
|
|
|
|
2012-07-23 09:04:00 +00:00
|
|
|
/// Simple binary floating point operators.
|
2015-02-20 22:10:33 +00:00
|
|
|
FADD, FSUB, FMUL, FDIV, FREM,
|
|
|
|
|
|
|
|
/// FMA - Perform a * b + c with no intermediate rounding step.
|
|
|
|
FMA,
|
|
|
|
|
|
|
|
/// FMAD - Perform a * b + c, while getting the same result as the
|
|
|
|
/// separately rounded operations.
|
|
|
|
FMAD,
|
2010-04-14 18:44:34 +00:00
|
|
|
|
2012-07-23 09:04:00 +00:00
|
|
|
/// FCOPYSIGN(X, Y) - Return the value of X with the sign of Y. NOTE: This
|
|
|
|
/// DAG node does not require that X and Y have the same type, just that the
|
|
|
|
/// are both floating point. X and the result must have the same type.
|
|
|
|
/// FCOPYSIGN(f32, f64) is allowed.
|
2010-04-14 18:44:34 +00:00
|
|
|
FCOPYSIGN,
|
|
|
|
|
2012-07-23 09:04:00 +00:00
|
|
|
/// INT = FGETSIGN(FP) - Return the sign bit of the specified floating point
|
|
|
|
/// value as an integer 0/1 value.
|
2010-04-14 18:44:34 +00:00
|
|
|
FGETSIGN,
|
|
|
|
|
|
|
|
/// BUILD_VECTOR(ELT0, ELT1, ELT2, ELT3,...) - Return a vector with the
|
|
|
|
/// specified, possibly variable, elements. The number of elements is
|
|
|
|
/// required to be a power of two. The types of the operands must all be
|
|
|
|
/// the same and must match the vector element type, except that integer
|
|
|
|
/// types are allowed to be larger than the element type, in which case
|
|
|
|
/// the operands are implicitly truncated.
|
|
|
|
BUILD_VECTOR,
|
|
|
|
|
|
|
|
/// INSERT_VECTOR_ELT(VECTOR, VAL, IDX) - Returns VECTOR with the element
|
|
|
|
/// at IDX replaced with VAL. If the type of VAL is larger than the vector
|
|
|
|
/// element type then VAL is truncated before replacement.
|
|
|
|
INSERT_VECTOR_ELT,
|
|
|
|
|
|
|
|
/// EXTRACT_VECTOR_ELT(VECTOR, IDX) - Returns a single element from VECTOR
|
|
|
|
/// identified by the (potentially variable) element number IDX. If the
|
|
|
|
/// return type is an integer type larger than the element type of the
|
|
|
|
/// vector, the result is extended to the width of the return type.
|
|
|
|
EXTRACT_VECTOR_ELT,
|
|
|
|
|
|
|
|
/// CONCAT_VECTORS(VECTOR0, VECTOR1, ...) - Given a number of values of
|
|
|
|
/// vector type with the same length and element type, this produces a
|
|
|
|
/// concatenated vector result value, with length equal to the sum of the
|
|
|
|
/// lengths of the input vectors.
|
|
|
|
CONCAT_VECTORS,
|
|
|
|
|
2011-01-26 19:13:22 +00:00
|
|
|
/// INSERT_SUBVECTOR(VECTOR1, VECTOR2, IDX) - Returns a vector
|
|
|
|
/// with VECTOR2 inserted into VECTOR1 at the (potentially
|
|
|
|
/// variable) element number IDX, which must be a multiple of the
|
|
|
|
/// VECTOR2 vector length. The elements of VECTOR1 starting at
|
|
|
|
/// IDX are overwritten with VECTOR2. Elements IDX through
|
|
|
|
/// vector_length(VECTOR2) must be valid VECTOR1 indices.
|
|
|
|
INSERT_SUBVECTOR,
|
|
|
|
|
2010-04-14 18:44:34 +00:00
|
|
|
/// EXTRACT_SUBVECTOR(VECTOR, IDX) - Returns a subvector from VECTOR (an
|
2011-01-07 04:58:56 +00:00
|
|
|
/// vector value) starting with the element number IDX, which must be a
|
|
|
|
/// constant multiple of the result vector length.
|
2010-04-14 18:44:34 +00:00
|
|
|
EXTRACT_SUBVECTOR,
|
|
|
|
|
2010-11-23 03:31:01 +00:00
|
|
|
/// VECTOR_SHUFFLE(VEC1, VEC2) - Returns a vector, of the same type as
|
2010-04-14 18:44:34 +00:00
|
|
|
/// VEC1/VEC2. A VECTOR_SHUFFLE node also contains an array of constant int
|
|
|
|
/// values that indicate which value (or undef) each result element will
|
2010-11-23 03:31:01 +00:00
|
|
|
/// get. These constant ints are accessible through the
|
|
|
|
/// ShuffleVectorSDNode class. This is quite similar to the Altivec
|
2010-04-14 18:44:34 +00:00
|
|
|
/// 'vperm' instruction, except that the indices must be constants and are
|
|
|
|
/// in terms of the element size of VEC1/VEC2, not in terms of bytes.
|
|
|
|
VECTOR_SHUFFLE,
|
|
|
|
|
|
|
|
/// SCALAR_TO_VECTOR(VAL) - This represents the operation of loading a
|
|
|
|
/// scalar value into element 0 of the resultant vector type. The top
|
|
|
|
/// elements 1 to N-1 of the N-element vector are undefined. The type
|
|
|
|
/// of the operand must match the vector element type, except when they
|
|
|
|
/// are integer types. In this case the operand is allowed to be wider
|
|
|
|
/// than the vector element type, and is implicitly truncated to it.
|
|
|
|
SCALAR_TO_VECTOR,
|
|
|
|
|
2012-07-23 09:04:00 +00:00
|
|
|
/// MULHU/MULHS - Multiply high - Multiply two integers of type iN,
|
|
|
|
/// producing an unsigned/signed value of type i[2*N], then return the top
|
|
|
|
/// part.
|
2010-04-14 18:44:34 +00:00
|
|
|
MULHU, MULHS,
|
|
|
|
|
2011-02-13 19:09:16 +00:00
|
|
|
/// Bitwise operators - logical and, logical or, logical xor.
|
|
|
|
AND, OR, XOR,
|
2012-07-23 09:04:00 +00:00
|
|
|
|
2011-02-13 19:09:16 +00:00
|
|
|
/// Shift and rotation operations. After legalization, the type of the
|
|
|
|
/// shift amount is known to be TLI.getShiftAmountTy(). Before legalization
|
|
|
|
/// the shift amount can be any type, but care must be taken to ensure it is
|
|
|
|
/// large enough. TLI.getShiftAmountTy() is i8 on some targets, but before
|
|
|
|
/// legalization, types like i1024 can occur and i8 doesn't have enough bits
|
2013-03-01 18:40:30 +00:00
|
|
|
/// to represent the shift amount.
|
|
|
|
/// When the 1st operand is a vector, the shift amount must be in the same
|
|
|
|
/// type. (TLI.getShiftAmountTy() will return the same type when the input
|
|
|
|
/// type is a vector.)
|
2011-02-13 19:09:16 +00:00
|
|
|
SHL, SRA, SRL, ROTL, ROTR,
|
|
|
|
|
|
|
|
/// Byte Swap and Counting operators.
|
|
|
|
BSWAP, CTTZ, CTLZ, CTPOP,
|
2010-04-14 18:44:34 +00:00
|
|
|
|
2011-12-13 01:56:10 +00:00
|
|
|
/// Bit counting operators with an undefined result for zero inputs.
|
|
|
|
CTTZ_ZERO_UNDEF, CTLZ_ZERO_UNDEF,
|
|
|
|
|
2012-07-23 09:04:00 +00:00
|
|
|
/// Select(COND, TRUEVAL, FALSEVAL). If the type of the boolean COND is not
|
|
|
|
/// i1 then the high bits must conform to getBooleanContents.
|
2010-04-14 18:44:34 +00:00
|
|
|
SELECT,
|
|
|
|
|
2012-07-23 09:04:00 +00:00
|
|
|
/// Select with a vector condition (op #0) and two vector operands (ops #1
|
|
|
|
/// and #2), returning a vector result. All vectors have the same length.
|
|
|
|
/// Much like the scalar select and setcc, each bit in the condition selects
|
|
|
|
/// whether the corresponding result element is taken from op #1 or op #2.
|
|
|
|
/// At first, the VSELECT condition is of vXi1 type. Later, targets may
|
|
|
|
/// change the condition type in order to match the VSELECT node using a
|
|
|
|
/// pattern. The condition follows the BooleanContent format of the target.
|
2011-09-06 19:07:46 +00:00
|
|
|
VSELECT,
|
|
|
|
|
2012-07-23 09:04:00 +00:00
|
|
|
/// Select with condition operator - This selects between a true value and
|
|
|
|
/// a false value (ops #2 and #3) based on the boolean result of comparing
|
|
|
|
/// the lhs and rhs (ops #0 and #1) of a conditional expression with the
|
|
|
|
/// condition code in op #4, a CondCodeSDNode.
|
2010-04-14 18:44:34 +00:00
|
|
|
SELECT_CC,
|
|
|
|
|
2012-09-27 10:14:43 +00:00
|
|
|
/// SetCC operator - This evaluates to a true value iff the condition is
|
2012-07-23 09:04:00 +00:00
|
|
|
/// true. If the result value type is not i1 then the high bits conform
|
|
|
|
/// to getBooleanContents. The operands to this are the left and right
|
|
|
|
/// operands to compare (ops #0, and #1) and the condition code to compare
|
|
|
|
/// them with (op #2) as a CondCodeSDNode. If the operands are vector types
|
|
|
|
/// then the result type must also be a vector type.
|
2010-04-14 18:44:34 +00:00
|
|
|
SETCC,
|
|
|
|
|
2012-07-23 09:04:00 +00:00
|
|
|
/// SHL_PARTS/SRA_PARTS/SRL_PARTS - These operators are used for expanded
|
|
|
|
/// integer shift operations, just like ADD/SUB_PARTS. The operation
|
|
|
|
/// ordering is:
|
|
|
|
/// [Lo,Hi] = op [LoLHS,HiLHS], Amt
|
2010-04-14 18:44:34 +00:00
|
|
|
SHL_PARTS, SRA_PARTS, SRL_PARTS,
|
|
|
|
|
2012-07-23 09:04:00 +00:00
|
|
|
/// Conversion operators. These are all single input single output
|
|
|
|
/// operations. For all of these, the result type must be strictly
|
|
|
|
/// wider or narrower (depending on the operation) than the source
|
|
|
|
/// type.
|
2010-04-14 18:44:34 +00:00
|
|
|
|
2012-07-23 09:04:00 +00:00
|
|
|
/// SIGN_EXTEND - Used for integer types, replicating the sign bit
|
|
|
|
/// into new bits.
|
2010-04-14 18:44:34 +00:00
|
|
|
SIGN_EXTEND,
|
|
|
|
|
2012-07-23 09:04:00 +00:00
|
|
|
/// ZERO_EXTEND - Used for integer types, zeroing the new bits.
|
2010-04-14 18:44:34 +00:00
|
|
|
ZERO_EXTEND,
|
|
|
|
|
2012-07-23 09:04:00 +00:00
|
|
|
/// ANY_EXTEND - Used for integer types. The high bits are undefined.
|
2010-04-14 18:44:34 +00:00
|
|
|
ANY_EXTEND,
|
|
|
|
|
2012-07-23 09:04:00 +00:00
|
|
|
/// TRUNCATE - Completely drop the high bits.
|
2010-04-14 18:44:34 +00:00
|
|
|
TRUNCATE,
|
|
|
|
|
2012-07-23 09:04:00 +00:00
|
|
|
/// [SU]INT_TO_FP - These operators convert integers (whose interpreted sign
|
|
|
|
/// depends on the first letter) to floating point.
|
2010-04-14 18:44:34 +00:00
|
|
|
SINT_TO_FP,
|
|
|
|
UINT_TO_FP,
|
|
|
|
|
2012-07-23 09:04:00 +00:00
|
|
|
/// SIGN_EXTEND_INREG - This operator atomically performs a SHL/SRA pair to
|
|
|
|
/// sign extend a small value in a large integer register (e.g. sign
|
|
|
|
/// extending the low 8 bits of a 32-bit register to fill the top 24 bits
|
|
|
|
/// with the 7th bit). The size of the smaller type is indicated by the 1th
|
|
|
|
/// operand, a ValueType node.
|
2010-04-14 18:44:34 +00:00
|
|
|
SIGN_EXTEND_INREG,
|
|
|
|
|
2014-07-10 12:32:32 +00:00
|
|
|
/// ANY_EXTEND_VECTOR_INREG(Vector) - This operator represents an
|
|
|
|
/// in-register any-extension of the low lanes of an integer vector. The
|
|
|
|
/// result type must have fewer elements than the operand type, and those
|
|
|
|
/// elements must be larger integer types such that the total size of the
|
|
|
|
/// operand type and the result type match. Each of the low operand
|
|
|
|
/// elements is any-extended into the corresponding, wider result
|
|
|
|
/// elements with the high bits becoming undef.
|
|
|
|
ANY_EXTEND_VECTOR_INREG,
|
|
|
|
|
|
|
|
/// SIGN_EXTEND_VECTOR_INREG(Vector) - This operator represents an
|
|
|
|
/// in-register sign-extension of the low lanes of an integer vector. The
|
|
|
|
/// result type must have fewer elements than the operand type, and those
|
|
|
|
/// elements must be larger integer types such that the total size of the
|
|
|
|
/// operand type and the result type match. Each of the low operand
|
|
|
|
/// elements is sign-extended into the corresponding, wider result
|
|
|
|
/// elements.
|
|
|
|
// FIXME: The SIGN_EXTEND_INREG node isn't specifically limited to
|
|
|
|
// scalars, but it also doesn't handle vectors well. Either it should be
|
|
|
|
// restricted to scalars or this node (and its handling) should be merged
|
|
|
|
// into it.
|
|
|
|
SIGN_EXTEND_VECTOR_INREG,
|
|
|
|
|
2014-07-09 10:58:18 +00:00
|
|
|
/// ZERO_EXTEND_VECTOR_INREG(Vector) - This operator represents an
|
|
|
|
/// in-register zero-extension of the low lanes of an integer vector. The
|
|
|
|
/// result type must have fewer elements than the operand type, and those
|
|
|
|
/// elements must be larger integer types such that the total size of the
|
|
|
|
/// operand type and the result type match. Each of the low operand
|
|
|
|
/// elements is zero-extended into the corresponding, wider result
|
|
|
|
/// elements.
|
|
|
|
ZERO_EXTEND_VECTOR_INREG,
|
|
|
|
|
2010-04-14 18:44:34 +00:00
|
|
|
/// FP_TO_[US]INT - Convert a floating point value to a signed or unsigned
|
|
|
|
/// integer.
|
|
|
|
FP_TO_SINT,
|
|
|
|
FP_TO_UINT,
|
|
|
|
|
|
|
|
/// X = FP_ROUND(Y, TRUNC) - Rounding 'Y' from a larger floating point type
|
|
|
|
/// down to the precision of the destination VT. TRUNC is a flag, which is
|
|
|
|
/// always an integer that is zero or one. If TRUNC is 0, this is a
|
|
|
|
/// normal rounding, if it is 1, this FP_ROUND is known to not change the
|
|
|
|
/// value of Y.
|
|
|
|
///
|
|
|
|
/// The TRUNC = 1 case is used in cases where we know that the value will
|
|
|
|
/// not be modified by the node, because Y is not using any of the extra
|
|
|
|
/// precision of source type. This allows certain transformations like
|
|
|
|
/// FP_EXTEND(FP_ROUND(X,1)) -> X which are not safe for
|
|
|
|
/// FP_EXTEND(FP_ROUND(X,0)) because the extra bits aren't removed.
|
|
|
|
FP_ROUND,
|
|
|
|
|
2012-07-23 09:04:00 +00:00
|
|
|
/// FLT_ROUNDS_ - Returns current rounding mode:
|
|
|
|
/// -1 Undefined
|
|
|
|
/// 0 Round to 0
|
|
|
|
/// 1 Round to nearest
|
|
|
|
/// 2 Round to +inf
|
|
|
|
/// 3 Round to -inf
|
2010-04-14 18:44:34 +00:00
|
|
|
FLT_ROUNDS_,
|
|
|
|
|
|
|
|
/// X = FP_ROUND_INREG(Y, VT) - This operator takes an FP register, and
|
|
|
|
/// rounds it to a floating point value. It then promotes it and returns it
|
|
|
|
/// in a register of the same size. This operation effectively just
|
|
|
|
/// discards excess precision. The type to round down to is specified by
|
|
|
|
/// the VT operand, a VTSDNode.
|
|
|
|
FP_ROUND_INREG,
|
|
|
|
|
|
|
|
/// X = FP_EXTEND(Y) - Extend a smaller FP type into a larger FP type.
|
|
|
|
FP_EXTEND,
|
|
|
|
|
2012-07-23 09:04:00 +00:00
|
|
|
/// BITCAST - This operator converts between integer, vector and FP
|
|
|
|
/// values, as if the value was stored to memory with one type and loaded
|
|
|
|
/// from the same address with the other type (or equivalently for vector
|
|
|
|
/// format conversions, etc). The source and result are required to have
|
|
|
|
/// the same bit size (e.g. f32 <-> i32). This can also be used for
|
|
|
|
/// int-to-int or fp-to-fp conversions, but that is a noop, deleted by
|
|
|
|
/// getNode().
|
2010-11-23 03:31:01 +00:00
|
|
|
BITCAST,
|
2010-04-14 18:44:34 +00:00
|
|
|
|
2013-11-15 01:34:59 +00:00
|
|
|
/// ADDRSPACECAST - This operator converts between pointers of different
|
|
|
|
/// address spaces.
|
|
|
|
ADDRSPACECAST,
|
|
|
|
|
2012-07-23 09:04:00 +00:00
|
|
|
/// CONVERT_RNDSAT - This operator is used to support various conversions
|
|
|
|
/// between various types (float, signed, unsigned and vectors of those
|
|
|
|
/// types) with rounding and saturation. NOTE: Avoid using this operator as
|
|
|
|
/// most target don't support it and the operator might be removed in the
|
|
|
|
/// future. It takes the following arguments:
|
|
|
|
/// 0) value
|
|
|
|
/// 1) dest type (type to convert to)
|
|
|
|
/// 2) src type (type to convert from)
|
|
|
|
/// 3) rounding imm
|
|
|
|
/// 4) saturation imm
|
|
|
|
/// 5) ISD::CvtCode indicating the type of conversion to do
|
2010-04-14 18:44:34 +00:00
|
|
|
CONVERT_RNDSAT,
|
|
|
|
|
2014-07-17 10:51:23 +00:00
|
|
|
/// FP16_TO_FP, FP_TO_FP16 - These operators are used to perform promotions
|
|
|
|
/// and truncation for half-precision (16 bit) floating numbers. These nodes
|
|
|
|
/// form a semi-softened interface for dealing with f16 (as an i16), which
|
|
|
|
/// is often a storage-only type but has native conversions.
|
|
|
|
FP16_TO_FP, FP_TO_FP16,
|
2010-04-14 18:44:34 +00:00
|
|
|
|
2012-07-23 09:04:00 +00:00
|
|
|
/// FNEG, FABS, FSQRT, FSIN, FCOS, FPOWI, FPOW,
|
|
|
|
/// FLOG, FLOG2, FLOG10, FEXP, FEXP2,
|
2013-08-07 22:49:12 +00:00
|
|
|
/// FCEIL, FTRUNC, FRINT, FNEARBYINT, FROUND, FFLOOR - Perform various unary
|
2012-07-23 09:04:00 +00:00
|
|
|
/// floating point operations. These are inspired by libm.
|
2010-04-14 18:44:34 +00:00
|
|
|
FNEG, FABS, FSQRT, FSIN, FCOS, FPOWI, FPOW,
|
|
|
|
FLOG, FLOG2, FLOG10, FEXP, FEXP2,
|
2013-08-07 22:49:12 +00:00
|
|
|
FCEIL, FTRUNC, FRINT, FNEARBYINT, FROUND, FFLOOR,
|
2014-10-21 23:01:01 +00:00
|
|
|
FMINNUM, FMAXNUM,
|
|
|
|
|
2013-01-29 02:32:37 +00:00
|
|
|
/// FSINCOS - Compute both fsin and fcos as a single operation.
|
|
|
|
FSINCOS,
|
2010-04-14 18:44:34 +00:00
|
|
|
|
2012-07-23 09:04:00 +00:00
|
|
|
/// LOAD and STORE have token chains as their first operand, then the same
|
|
|
|
/// operands as an LLVM load/store instruction, then an offset node that
|
|
|
|
/// is added / subtracted from the base pointer to form the address (for
|
|
|
|
/// indexed memory ops).
|
2010-04-14 18:44:34 +00:00
|
|
|
LOAD, STORE,
|
|
|
|
|
2012-07-23 09:04:00 +00:00
|
|
|
/// DYNAMIC_STACKALLOC - Allocate some number of bytes on the stack aligned
|
|
|
|
/// to a specified boundary. This node always has two return values: a new
|
|
|
|
/// stack pointer value and a chain. The first operand is the token chain,
|
|
|
|
/// the second is the number of bytes to allocate, and the third is the
|
|
|
|
/// alignment boundary. The size is guaranteed to be a multiple of the
|
|
|
|
/// stack alignment, and the alignment is guaranteed to be bigger than the
|
|
|
|
/// stack alignment (if required) or 0 to get standard stack alignment.
|
2010-04-14 18:44:34 +00:00
|
|
|
DYNAMIC_STACKALLOC,
|
|
|
|
|
2012-07-23 09:04:00 +00:00
|
|
|
/// Control flow instructions. These all have token chains.
|
2010-04-14 18:44:34 +00:00
|
|
|
|
2012-07-23 09:04:00 +00:00
|
|
|
/// BR - Unconditional branch. The first operand is the chain
|
|
|
|
/// operand, the second is the MBB to branch to.
|
2010-04-14 18:44:34 +00:00
|
|
|
BR,
|
|
|
|
|
2012-07-23 09:04:00 +00:00
|
|
|
/// BRIND - Indirect branch. The first operand is the chain, the second
|
|
|
|
/// is the value to branch to, which must be of the same type as the
|
|
|
|
/// target's pointer type.
|
2010-04-14 18:44:34 +00:00
|
|
|
BRIND,
|
|
|
|
|
2012-07-23 09:04:00 +00:00
|
|
|
/// BR_JT - Jumptable branch. The first operand is the chain, the second
|
|
|
|
/// is the jumptable index, the last one is the jumptable entry index.
|
2010-04-14 18:44:34 +00:00
|
|
|
BR_JT,
|
|
|
|
|
2012-07-23 09:04:00 +00:00
|
|
|
/// BRCOND - Conditional branch. The first operand is the chain, the
|
|
|
|
/// second is the condition, the third is the block to branch to if the
|
|
|
|
/// condition is true. If the type of the condition is not i1, then the
|
|
|
|
/// high bits must conform to getBooleanContents.
|
2010-04-14 18:44:34 +00:00
|
|
|
BRCOND,
|
|
|
|
|
2012-07-23 09:04:00 +00:00
|
|
|
/// BR_CC - Conditional branch. The behavior is like that of SELECT_CC, in
|
|
|
|
/// that the condition is represented as condition code, and two nodes to
|
|
|
|
/// compare, rather than as a combined SetCC node. The operands in order
|
|
|
|
/// are chain, cc, lhs, rhs, block to branch to if condition is true.
|
2010-04-14 18:44:34 +00:00
|
|
|
BR_CC,
|
|
|
|
|
2012-07-23 09:04:00 +00:00
|
|
|
/// INLINEASM - Represents an inline asm block. This node always has two
|
|
|
|
/// return values: a chain and a flag result. The inputs are as follows:
|
|
|
|
/// Operand #0 : Input chain.
|
|
|
|
/// Operand #1 : a ExternalSymbolSDNode with a pointer to the asm string.
|
|
|
|
/// Operand #2 : a MDNodeSDNode with the !srcloc metadata.
|
|
|
|
/// Operand #3 : HasSideEffect, IsAlignStack bits.
|
|
|
|
/// After this, it is followed by a list of operands with this format:
|
|
|
|
/// ConstantSDNode: Flags that encode whether it is a mem or not, the
|
|
|
|
/// of operands that follow, etc. See InlineAsm.h.
|
|
|
|
/// ... however many operands ...
|
|
|
|
/// Operand #last: Optional, an incoming flag.
|
|
|
|
///
|
|
|
|
/// The variable width operands are required to represent target addressing
|
|
|
|
/// modes as a single "operand", even though they may have multiple
|
|
|
|
/// SDOperands.
|
2010-04-14 18:44:34 +00:00
|
|
|
INLINEASM,
|
|
|
|
|
2012-07-23 09:04:00 +00:00
|
|
|
/// EH_LABEL - Represents a label in mid basic block used to track
|
|
|
|
/// locations needed for debug and exception handling tables. These nodes
|
|
|
|
/// take a chain as input and return a chain.
|
2010-04-14 18:44:34 +00:00
|
|
|
EH_LABEL,
|
|
|
|
|
2012-07-23 09:04:00 +00:00
|
|
|
/// STACKSAVE - STACKSAVE has one operand, an input chain. It produces a
|
|
|
|
/// value, the same type as the pointer type for the system, and an output
|
|
|
|
/// chain.
|
2010-04-14 18:44:34 +00:00
|
|
|
STACKSAVE,
|
|
|
|
|
2012-07-23 09:04:00 +00:00
|
|
|
/// STACKRESTORE has two operands, an input chain and a pointer to restore
|
|
|
|
/// to it returns an output chain.
|
2010-04-14 18:44:34 +00:00
|
|
|
STACKRESTORE,
|
|
|
|
|
2012-07-23 09:04:00 +00:00
|
|
|
/// CALLSEQ_START/CALLSEQ_END - These operators mark the beginning and end
|
|
|
|
/// of a call sequence, and carry arbitrary information that target might
|
|
|
|
/// want to know. The first operand is a chain, the rest are specified by
|
|
|
|
/// the target and not touched by the DAG optimizers.
|
|
|
|
/// CALLSEQ_START..CALLSEQ_END pairs may not be nested.
|
2010-04-14 18:44:34 +00:00
|
|
|
CALLSEQ_START, // Beginning of a call sequence
|
|
|
|
CALLSEQ_END, // End of a call sequence
|
|
|
|
|
2012-07-23 09:04:00 +00:00
|
|
|
/// VAARG - VAARG has four operands: an input chain, a pointer, a SRCVALUE,
|
|
|
|
/// and the alignment. It returns a pair of values: the vaarg value and a
|
|
|
|
/// new chain.
|
2010-04-14 18:44:34 +00:00
|
|
|
VAARG,
|
|
|
|
|
2012-07-23 09:04:00 +00:00
|
|
|
/// VACOPY - VACOPY has 5 operands: an input chain, a destination pointer,
|
|
|
|
/// a source pointer, a SRCVALUE for the destination, and a SRCVALUE for the
|
|
|
|
/// source.
|
2010-04-14 18:44:34 +00:00
|
|
|
VACOPY,
|
|
|
|
|
2012-07-23 09:04:00 +00:00
|
|
|
/// VAEND, VASTART - VAEND and VASTART have three operands: an input chain,
|
|
|
|
/// pointer, and a SRCVALUE.
|
2010-04-14 18:44:34 +00:00
|
|
|
VAEND, VASTART,
|
|
|
|
|
2012-07-23 09:04:00 +00:00
|
|
|
/// SRCVALUE - This is a node type that holds a Value* that is used to
|
|
|
|
/// make reference to a value in the LLVM IR.
|
2010-04-14 18:44:34 +00:00
|
|
|
SRCVALUE,
|
2010-11-23 03:31:01 +00:00
|
|
|
|
2012-07-23 09:04:00 +00:00
|
|
|
/// MDNODE_SDNODE - This is a node that holdes an MDNode*, which is used to
|
|
|
|
/// reference metadata in the IR.
|
2010-04-14 18:44:34 +00:00
|
|
|
MDNODE_SDNODE,
|
|
|
|
|
2012-07-23 09:04:00 +00:00
|
|
|
/// PCMARKER - This corresponds to the pcmarker intrinsic.
|
2010-04-14 18:44:34 +00:00
|
|
|
PCMARKER,
|
|
|
|
|
2012-07-23 09:04:00 +00:00
|
|
|
/// READCYCLECOUNTER - This corresponds to the readcyclecounter intrinsic.
|
|
|
|
/// The only operand is a chain and a value and a chain are produced. The
|
|
|
|
/// value is the contents of the architecture specific cycle counter like
|
|
|
|
/// register (or other high accuracy low latency clock source)
|
2010-04-14 18:44:34 +00:00
|
|
|
READCYCLECOUNTER,
|
|
|
|
|
2012-07-23 09:04:00 +00:00
|
|
|
/// HANDLENODE node - Used as a handle for various purposes.
|
2010-04-14 18:44:34 +00:00
|
|
|
HANDLENODE,
|
|
|
|
|
2012-07-23 09:04:00 +00:00
|
|
|
/// INIT_TRAMPOLINE - This corresponds to the init_trampoline intrinsic. It
|
|
|
|
/// takes as input a token chain, the pointer to the trampoline, the pointer
|
|
|
|
/// to the nested function, the pointer to pass for the 'nest' parameter, a
|
|
|
|
/// SRCVALUE for the trampoline and another for the nested function
|
|
|
|
/// (allowing targets to access the original Function*).
|
|
|
|
/// It produces a token chain as output.
|
2011-09-06 13:37:06 +00:00
|
|
|
INIT_TRAMPOLINE,
|
|
|
|
|
2012-07-23 09:04:00 +00:00
|
|
|
/// ADJUST_TRAMPOLINE - This corresponds to the adjust_trampoline intrinsic.
|
|
|
|
/// It takes a pointer to the trampoline and produces a (possibly) new
|
|
|
|
/// pointer to the same trampoline with platform-specific adjustments
|
|
|
|
/// applied. The pointer it returns points to an executable block of code.
|
2011-09-06 13:37:06 +00:00
|
|
|
ADJUST_TRAMPOLINE,
|
2010-04-14 18:44:34 +00:00
|
|
|
|
2012-07-23 09:04:00 +00:00
|
|
|
/// TRAP - Trapping instruction
|
2010-04-14 18:44:34 +00:00
|
|
|
TRAP,
|
|
|
|
|
2012-07-23 09:04:00 +00:00
|
|
|
/// DEBUGTRAP - Trap intended to get the attention of a debugger.
|
2012-05-14 18:58:10 +00:00
|
|
|
DEBUGTRAP,
|
2012-05-11 00:19:32 +00:00
|
|
|
|
2012-07-23 09:04:00 +00:00
|
|
|
/// PREFETCH - This corresponds to a prefetch intrinsic. The first operand
|
|
|
|
/// is the chain. The other operands are the address to prefetch,
|
|
|
|
/// read / write specifier, locality specifier and instruction / data cache
|
|
|
|
/// specifier.
|
2010-04-14 18:44:34 +00:00
|
|
|
PREFETCH,
|
|
|
|
|
2012-07-23 09:04:00 +00:00
|
|
|
/// OUTCHAIN = ATOMIC_FENCE(INCHAIN, ordering, scope)
|
|
|
|
/// This corresponds to the fence instruction. It takes an input chain, and
|
|
|
|
/// two integer constants: an AtomicOrdering and a SynchronizationScope.
|
2011-07-27 22:21:52 +00:00
|
|
|
ATOMIC_FENCE,
|
|
|
|
|
2012-07-23 09:04:00 +00:00
|
|
|
/// Val, OUTCHAIN = ATOMIC_LOAD(INCHAIN, ptr)
|
|
|
|
/// This corresponds to "load atomic" instruction.
|
2011-08-24 20:50:09 +00:00
|
|
|
ATOMIC_LOAD,
|
|
|
|
|
2013-12-26 14:43:33 +00:00
|
|
|
/// OUTCHAIN = ATOMIC_STORE(INCHAIN, ptr, val)
|
2012-07-23 09:04:00 +00:00
|
|
|
/// This corresponds to "store atomic" instruction.
|
2011-08-24 20:50:09 +00:00
|
|
|
ATOMIC_STORE,
|
|
|
|
|
2012-07-23 09:04:00 +00:00
|
|
|
/// Val, OUTCHAIN = ATOMIC_CMP_SWAP(INCHAIN, ptr, cmp, swap)
|
2013-09-26 12:22:36 +00:00
|
|
|
/// For double-word atomic operations:
|
|
|
|
/// ValLo, ValHi, OUTCHAIN = ATOMIC_CMP_SWAP(INCHAIN, ptr, cmpLo, cmpHi,
|
|
|
|
/// swapLo, swapHi)
|
2012-07-23 09:04:00 +00:00
|
|
|
/// This corresponds to the cmpxchg instruction.
|
2010-04-14 18:44:34 +00:00
|
|
|
ATOMIC_CMP_SWAP,
|
|
|
|
|
IR: add "cmpxchg weak" variant to support permitted failure.
This commit adds a weak variant of the cmpxchg operation, as described
in C++11. A cmpxchg instruction with this modifier is permitted to
fail to store, even if the comparison indicated it should.
As a result, cmpxchg instructions must return a flag indicating
success in addition to their original iN value loaded. Thus, for
uniformity *all* cmpxchg instructions now return "{ iN, i1 }". The
second flag is 1 when the store succeeded.
At the DAG level, a new ATOMIC_CMP_SWAP_WITH_SUCCESS node has been
added as the natural representation for the new cmpxchg instructions.
It is a strong cmpxchg.
By default this gets Expanded to the existing ATOMIC_CMP_SWAP during
Legalization, so existing backends should see no change in behaviour.
If they wish to deal with the enhanced node instead, they can call
setOperationAction on it. Beware: as a node with 2 results, it cannot
be selected from TableGen.
Currently, no use is made of the extra information provided in this
patch. Test updates are almost entirely adapting the input IR to the
new scheme.
Summary for out of tree users:
------------------------------
+ Legacy Bitcode files are upgraded during read.
+ Legacy assembly IR files will be invalid.
+ Front-ends must adapt to different type for "cmpxchg".
+ Backends should be unaffected by default.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@210903 91177308-0d34-0410-b5e6-96231b3b80d8
2014-06-13 14:24:07 +00:00
|
|
|
/// Val, Success, OUTCHAIN
|
|
|
|
/// = ATOMIC_CMP_SWAP_WITH_SUCCESS(INCHAIN, ptr, cmp, swap)
|
|
|
|
/// N.b. this is still a strong cmpxchg operation, so
|
|
|
|
/// Success == "Val == cmp".
|
|
|
|
ATOMIC_CMP_SWAP_WITH_SUCCESS,
|
|
|
|
|
2012-07-23 09:04:00 +00:00
|
|
|
/// Val, OUTCHAIN = ATOMIC_SWAP(INCHAIN, ptr, amt)
|
|
|
|
/// Val, OUTCHAIN = ATOMIC_LOAD_[OpName](INCHAIN, ptr, amt)
|
2013-09-26 12:22:36 +00:00
|
|
|
/// For double-word atomic operations:
|
|
|
|
/// ValLo, ValHi, OUTCHAIN = ATOMIC_SWAP(INCHAIN, ptr, amtLo, amtHi)
|
|
|
|
/// ValLo, ValHi, OUTCHAIN = ATOMIC_LOAD_[OpName](INCHAIN, ptr, amtLo, amtHi)
|
2012-07-23 09:04:00 +00:00
|
|
|
/// These correspond to the atomicrmw instruction.
|
2011-08-24 20:50:09 +00:00
|
|
|
ATOMIC_SWAP,
|
2010-04-14 18:44:34 +00:00
|
|
|
ATOMIC_LOAD_ADD,
|
|
|
|
ATOMIC_LOAD_SUB,
|
|
|
|
ATOMIC_LOAD_AND,
|
|
|
|
ATOMIC_LOAD_OR,
|
|
|
|
ATOMIC_LOAD_XOR,
|
|
|
|
ATOMIC_LOAD_NAND,
|
|
|
|
ATOMIC_LOAD_MIN,
|
|
|
|
ATOMIC_LOAD_MAX,
|
|
|
|
ATOMIC_LOAD_UMIN,
|
|
|
|
ATOMIC_LOAD_UMAX,
|
|
|
|
|
2015-04-28 07:57:37 +00:00
|
|
|
// Masked load and store - consecutive vector load and store operations
|
|
|
|
// with additional mask operand that prevents memory accesses to the
|
|
|
|
// masked-off lanes.
|
2014-12-04 09:40:44 +00:00
|
|
|
MLOAD, MSTORE,
|
|
|
|
|
2015-04-28 07:57:37 +00:00
|
|
|
// Masked gather and scatter - load and store operations for a vector of
|
|
|
|
// random addresses with additional mask operand that prevents memory
|
|
|
|
// accesses to the masked-off lanes.
|
|
|
|
MGATHER, MSCATTER,
|
|
|
|
|
2012-09-06 09:17:37 +00:00
|
|
|
/// This corresponds to the llvm.lifetime.* intrinsics. The first operand
|
|
|
|
/// is the chain and the second operand is the alloca pointer.
|
|
|
|
LIFETIME_START, LIFETIME_END,
|
|
|
|
|
2010-04-14 18:44:34 +00:00
|
|
|
/// BUILTIN_OP_END - This must be the last enum value in this list.
|
|
|
|
/// The target-specific pre-isel opcode values start here.
|
|
|
|
BUILTIN_OP_END
|
|
|
|
};
|
|
|
|
|
|
|
|
/// FIRST_TARGET_MEMORY_OPCODE - Target-specific pre-isel operations
|
|
|
|
/// which do not reference a specific memory location should be less than
|
|
|
|
/// this value. Those that do must not be less than this value, and can
|
|
|
|
/// be used with SelectionDAG::getMemIntrinsicNode.
|
2015-02-18 07:59:20 +00:00
|
|
|
static const int FIRST_TARGET_MEMORY_OPCODE = BUILTIN_OP_END+200;
|
2010-04-14 18:44:34 +00:00
|
|
|
|
|
|
|
//===--------------------------------------------------------------------===//
|
|
|
|
/// MemIndexedMode enum - This enum defines the load / store indexed
|
|
|
|
/// addressing modes.
|
|
|
|
///
|
|
|
|
/// UNINDEXED "Normal" load / store. The effective address is already
|
|
|
|
/// computed and is available in the base pointer. The offset
|
|
|
|
/// operand is always undefined. In addition to producing a
|
|
|
|
/// chain, an unindexed load produces one value (result of the
|
|
|
|
/// load); an unindexed store does not produce a value.
|
|
|
|
///
|
|
|
|
/// PRE_INC Similar to the unindexed mode where the effective address is
|
|
|
|
/// PRE_DEC the value of the base pointer add / subtract the offset.
|
|
|
|
/// It considers the computation as being folded into the load /
|
|
|
|
/// store operation (i.e. the load / store does the address
|
|
|
|
/// computation as well as performing the memory transaction).
|
|
|
|
/// The base operand is always undefined. In addition to
|
|
|
|
/// producing a chain, pre-indexed load produces two values
|
|
|
|
/// (result of the load and the result of the address
|
|
|
|
/// computation); a pre-indexed store produces one value (result
|
|
|
|
/// of the address computation).
|
|
|
|
///
|
|
|
|
/// POST_INC The effective address is the value of the base pointer. The
|
|
|
|
/// POST_DEC value of the offset operand is then added to / subtracted
|
|
|
|
/// from the base after memory transaction. In addition to
|
|
|
|
/// producing a chain, post-indexed load produces two values
|
|
|
|
/// (the result of the load and the result of the base +/- offset
|
|
|
|
/// computation); a post-indexed store produces one value (the
|
|
|
|
/// the result of the base +/- offset computation).
|
|
|
|
enum MemIndexedMode {
|
|
|
|
UNINDEXED = 0,
|
|
|
|
PRE_INC,
|
|
|
|
PRE_DEC,
|
|
|
|
POST_INC,
|
|
|
|
POST_DEC,
|
|
|
|
LAST_INDEXED_MODE
|
|
|
|
};
|
|
|
|
|
|
|
|
//===--------------------------------------------------------------------===//
|
|
|
|
/// LoadExtType enum - This enum defines the three variants of LOADEXT
|
|
|
|
/// (load with extension).
|
|
|
|
///
|
|
|
|
/// SEXTLOAD loads the integer operand and sign extends it to a larger
|
|
|
|
/// integer result type.
|
|
|
|
/// ZEXTLOAD loads the integer operand and zero extends it to a larger
|
|
|
|
/// integer result type.
|
2010-08-19 23:39:00 +00:00
|
|
|
/// EXTLOAD is used for two things: floating point extending loads and
|
|
|
|
/// integer extending loads [the top bits are undefined].
|
2010-04-14 18:44:34 +00:00
|
|
|
enum LoadExtType {
|
|
|
|
NON_EXTLOAD = 0,
|
|
|
|
EXTLOAD,
|
|
|
|
SEXTLOAD,
|
|
|
|
ZEXTLOAD,
|
|
|
|
LAST_LOADEXT_TYPE
|
|
|
|
};
|
|
|
|
|
2015-01-14 01:35:17 +00:00
|
|
|
NodeType getExtForLoadExtType(bool IsFP, LoadExtType);
|
2014-03-06 17:34:12 +00:00
|
|
|
|
2010-04-14 18:44:34 +00:00
|
|
|
//===--------------------------------------------------------------------===//
|
|
|
|
/// ISD::CondCode enum - These are ordered carefully to make the bitfields
|
|
|
|
/// below work out, when considering SETFALSE (something that never exists
|
|
|
|
/// dynamically) as 0. "U" -> Unsigned (for integer operands) or Unordered
|
|
|
|
/// (for floating point), "L" -> Less than, "G" -> Greater than, "E" -> Equal
|
|
|
|
/// to. If the "N" column is 1, the result of the comparison is undefined if
|
|
|
|
/// the input is a NAN.
|
|
|
|
///
|
|
|
|
/// All of these (except for the 'always folded ops') should be handled for
|
|
|
|
/// floating point. For integer, only the SETEQ,SETNE,SETLT,SETLE,SETGT,
|
|
|
|
/// SETGE,SETULT,SETULE,SETUGT, and SETUGE opcodes are used.
|
|
|
|
///
|
|
|
|
/// Note that these are laid out in a specific order to allow bit-twiddling
|
|
|
|
/// to transform conditions.
|
|
|
|
enum CondCode {
|
|
|
|
// Opcode N U L G E Intuitive operation
|
|
|
|
SETFALSE, // 0 0 0 0 Always false (always folded)
|
|
|
|
SETOEQ, // 0 0 0 1 True if ordered and equal
|
|
|
|
SETOGT, // 0 0 1 0 True if ordered and greater than
|
|
|
|
SETOGE, // 0 0 1 1 True if ordered and greater than or equal
|
|
|
|
SETOLT, // 0 1 0 0 True if ordered and less than
|
|
|
|
SETOLE, // 0 1 0 1 True if ordered and less than or equal
|
|
|
|
SETONE, // 0 1 1 0 True if ordered and operands are unequal
|
|
|
|
SETO, // 0 1 1 1 True if ordered (no nans)
|
|
|
|
SETUO, // 1 0 0 0 True if unordered: isnan(X) | isnan(Y)
|
|
|
|
SETUEQ, // 1 0 0 1 True if unordered or equal
|
|
|
|
SETUGT, // 1 0 1 0 True if unordered or greater than
|
|
|
|
SETUGE, // 1 0 1 1 True if unordered, greater than, or equal
|
|
|
|
SETULT, // 1 1 0 0 True if unordered or less than
|
|
|
|
SETULE, // 1 1 0 1 True if unordered, less than, or equal
|
|
|
|
SETUNE, // 1 1 1 0 True if unordered or not equal
|
|
|
|
SETTRUE, // 1 1 1 1 Always true (always folded)
|
|
|
|
// Don't care operations: undefined if the input is a nan.
|
|
|
|
SETFALSE2, // 1 X 0 0 0 Always false (always folded)
|
|
|
|
SETEQ, // 1 X 0 0 1 True if equal
|
|
|
|
SETGT, // 1 X 0 1 0 True if greater than
|
|
|
|
SETGE, // 1 X 0 1 1 True if greater than or equal
|
|
|
|
SETLT, // 1 X 1 0 0 True if less than
|
|
|
|
SETLE, // 1 X 1 0 1 True if less than or equal
|
|
|
|
SETNE, // 1 X 1 1 0 True if not equal
|
|
|
|
SETTRUE2, // 1 X 1 1 1 Always true (always folded)
|
|
|
|
|
|
|
|
SETCC_INVALID // Marker value.
|
|
|
|
};
|
|
|
|
|
|
|
|
/// isSignedIntSetCC - Return true if this is a setcc instruction that
|
|
|
|
/// performs a signed comparison when used with integer operands.
|
|
|
|
inline bool isSignedIntSetCC(CondCode Code) {
|
|
|
|
return Code == SETGT || Code == SETGE || Code == SETLT || Code == SETLE;
|
|
|
|
}
|
|
|
|
|
|
|
|
/// isUnsignedIntSetCC - Return true if this is a setcc instruction that
|
|
|
|
/// performs an unsigned comparison when used with integer operands.
|
|
|
|
inline bool isUnsignedIntSetCC(CondCode Code) {
|
|
|
|
return Code == SETUGT || Code == SETUGE || Code == SETULT || Code == SETULE;
|
|
|
|
}
|
|
|
|
|
|
|
|
/// isTrueWhenEqual - Return true if the specified condition returns true if
|
|
|
|
/// the two operands to the condition are equal. Note that if one of the two
|
|
|
|
/// operands is a NaN, this value is meaningless.
|
|
|
|
inline bool isTrueWhenEqual(CondCode Cond) {
|
|
|
|
return ((int)Cond & 1) != 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
/// getUnorderedFlavor - This function returns 0 if the condition is always
|
|
|
|
/// false if an operand is a NaN, 1 if the condition is always true if the
|
|
|
|
/// operand is a NaN, and 2 if the condition is undefined if the operand is a
|
|
|
|
/// NaN.
|
|
|
|
inline unsigned getUnorderedFlavor(CondCode Cond) {
|
|
|
|
return ((int)Cond >> 3) & 3;
|
|
|
|
}
|
|
|
|
|
|
|
|
/// getSetCCInverse - Return the operation corresponding to !(X op Y), where
|
|
|
|
/// 'op' is a valid SetCC operation.
|
|
|
|
CondCode getSetCCInverse(CondCode Operation, bool isInteger);
|
|
|
|
|
|
|
|
/// getSetCCSwappedOperands - Return the operation corresponding to (Y op X)
|
|
|
|
/// when given the operation for (X op Y).
|
|
|
|
CondCode getSetCCSwappedOperands(CondCode Operation);
|
|
|
|
|
|
|
|
/// getSetCCOrOperation - Return the result of a logical OR between different
|
|
|
|
/// comparisons of identical values: ((X op1 Y) | (X op2 Y)). This
|
|
|
|
/// function returns SETCC_INVALID if it is not possible to represent the
|
|
|
|
/// resultant comparison.
|
|
|
|
CondCode getSetCCOrOperation(CondCode Op1, CondCode Op2, bool isInteger);
|
|
|
|
|
|
|
|
/// getSetCCAndOperation - Return the result of a logical AND between
|
|
|
|
/// different comparisons of identical values: ((X op1 Y) & (X op2 Y)). This
|
|
|
|
/// function returns SETCC_INVALID if it is not possible to represent the
|
|
|
|
/// resultant comparison.
|
|
|
|
CondCode getSetCCAndOperation(CondCode Op1, CondCode Op2, bool isInteger);
|
|
|
|
|
|
|
|
//===--------------------------------------------------------------------===//
|
|
|
|
/// CvtCode enum - This enum defines the various converts CONVERT_RNDSAT
|
|
|
|
/// supports.
|
|
|
|
enum CvtCode {
|
2012-07-23 09:04:00 +00:00
|
|
|
CVT_FF, /// Float from Float
|
|
|
|
CVT_FS, /// Float from Signed
|
|
|
|
CVT_FU, /// Float from Unsigned
|
|
|
|
CVT_SF, /// Signed from Float
|
|
|
|
CVT_UF, /// Unsigned from Float
|
|
|
|
CVT_SS, /// Signed from Signed
|
|
|
|
CVT_SU, /// Signed from Unsigned
|
|
|
|
CVT_US, /// Unsigned from Signed
|
|
|
|
CVT_UU, /// Unsigned from Unsigned
|
|
|
|
CVT_INVALID /// Marker - Invalid opcode
|
2010-04-14 18:44:34 +00:00
|
|
|
};
|
|
|
|
|
|
|
|
} // end llvm::ISD namespace
|
|
|
|
|
|
|
|
} // end llvm namespace
|
|
|
|
|
|
|
|
#endif
|