SelectionDAGNodes.h revision f8df0ff9a5d1be41ca237bcd40ced821839b32fa
1//===-- llvm/CodeGen/SelectionDAGNodes.h - SelectionDAG Nodes ---*- C++ -*-===// 2// 3// The LLVM Compiler Infrastructure 4// 5// This file is distributed under the University of Illinois Open Source 6// License. See LICENSE.TXT for details. 7// 8//===----------------------------------------------------------------------===// 9// 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. 14// 15// Clients should include the SelectionDAG.h file instead of this file directly. 16// 17//===----------------------------------------------------------------------===// 18 19#ifndef LLVM_CODEGEN_SELECTIONDAGNODES_H 20#define LLVM_CODEGEN_SELECTIONDAGNODES_H 21 22#include "llvm/Value.h" 23#include "llvm/ADT/FoldingSet.h" 24#include "llvm/ADT/GraphTraits.h" 25#include "llvm/ADT/iterator" 26#include "llvm/ADT/APFloat.h" 27#include "llvm/ADT/APInt.h" 28#include "llvm/CodeGen/ValueTypes.h" 29#include "llvm/CodeGen/MemOperand.h" 30#include "llvm/Support/DataTypes.h" 31#include <cassert> 32 33namespace llvm { 34 35class SelectionDAG; 36class GlobalValue; 37class MachineBasicBlock; 38class MachineConstantPoolValue; 39class SDNode; 40template <typename T> struct DenseMapInfo; 41template <typename T> struct simplify_type; 42template <typename T> struct ilist_traits; 43template<typename NodeTy, typename Traits> class iplist; 44template<typename NodeTy> class ilist_iterator; 45 46/// SDVTList - This represents a list of ValueType's that has been intern'd by 47/// a SelectionDAG. Instances of this simple value class are returned by 48/// SelectionDAG::getVTList(...). 49/// 50struct SDVTList { 51 const MVT::ValueType *VTs; 52 unsigned short NumVTs; 53}; 54 55/// ISD namespace - This namespace contains an enum which represents all of the 56/// SelectionDAG node types and value types. 57/// 58namespace ISD { 59 namespace ParamFlags { 60 enum Flags { 61 NoFlagSet = 0, 62 ZExt = 1<<0, ///< Parameter should be zero extended 63 ZExtOffs = 0, 64 SExt = 1<<1, ///< Parameter should be sign extended 65 SExtOffs = 1, 66 InReg = 1<<2, ///< Parameter should be passed in register 67 InRegOffs = 2, 68 StructReturn = 1<<3, ///< Hidden struct-return pointer 69 StructReturnOffs = 3, 70 ByVal = 1<<4, ///< Struct passed by value 71 ByValOffs = 4, 72 Nest = 1<<5, ///< Parameter is nested function static chain 73 NestOffs = 5, 74 ByValAlign = 0xF << 6, //< The alignment of the struct 75 ByValAlignOffs = 6, 76 ByValSize = 0x1ffff << 10, //< The size of the struct 77 ByValSizeOffs = 10, 78 OrigAlignment = 0x1F<<27, 79 OrigAlignmentOffs = 27 80 }; 81 } 82 83 //===--------------------------------------------------------------------===// 84 /// ISD::NodeType enum - This enum defines all of the operators valid in a 85 /// SelectionDAG. 86 /// 87 enum NodeType { 88 // DELETED_NODE - This is an illegal flag value that is used to catch 89 // errors. This opcode is not a legal opcode for any node. 90 DELETED_NODE, 91 92 // EntryToken - This is the marker used to indicate the start of the region. 93 EntryToken, 94 95 // Token factor - This node takes multiple tokens as input and produces a 96 // single token result. This is used to represent the fact that the operand 97 // operators are independent of each other. 98 TokenFactor, 99 100 // AssertSext, AssertZext - These nodes record if a register contains a 101 // value that has already been zero or sign extended from a narrower type. 102 // These nodes take two operands. The first is the node that has already 103 // been extended, and the second is a value type node indicating the width 104 // of the extension 105 AssertSext, AssertZext, 106 107 // Various leaf nodes. 108 STRING, BasicBlock, VALUETYPE, CONDCODE, Register, 109 Constant, ConstantFP, 110 GlobalAddress, GlobalTLSAddress, FrameIndex, 111 JumpTable, ConstantPool, ExternalSymbol, 112 113 // The address of the GOT 114 GLOBAL_OFFSET_TABLE, 115 116 // FRAMEADDR, RETURNADDR - These nodes represent llvm.frameaddress and 117 // llvm.returnaddress on the DAG. These nodes take one operand, the index 118 // of the frame or return address to return. An index of zero corresponds 119 // to the current function's frame or return address, an index of one to the 120 // parent's frame or return address, and so on. 121 FRAMEADDR, RETURNADDR, 122 123 // FRAME_TO_ARGS_OFFSET - This node represents offset from frame pointer to 124 // first (possible) on-stack argument. This is needed for correct stack 125 // adjustment during unwind. 126 FRAME_TO_ARGS_OFFSET, 127 128 // RESULT, OUTCHAIN = EXCEPTIONADDR(INCHAIN) - This node represents the 129 // address of the exception block on entry to an landing pad block. 130 EXCEPTIONADDR, 131 132 // RESULT, OUTCHAIN = EHSELECTION(INCHAIN, EXCEPTION) - This node represents 133 // the selection index of the exception thrown. 134 EHSELECTION, 135 136 // OUTCHAIN = EH_RETURN(INCHAIN, OFFSET, HANDLER) - This node represents 137 // 'eh_return' gcc dwarf builtin, which is used to return from 138 // exception. The general meaning is: adjust stack by OFFSET and pass 139 // execution to HANDLER. Many platform-related details also :) 140 EH_RETURN, 141 142 // TargetConstant* - Like Constant*, but the DAG does not do any folding or 143 // simplification of the constant. 144 TargetConstant, 145 TargetConstantFP, 146 147 // TargetGlobalAddress - Like GlobalAddress, but the DAG does no folding or 148 // anything else with this node, and this is valid in the target-specific 149 // dag, turning into a GlobalAddress operand. 150 TargetGlobalAddress, 151 TargetGlobalTLSAddress, 152 TargetFrameIndex, 153 TargetJumpTable, 154 TargetConstantPool, 155 TargetExternalSymbol, 156 157 /// RESULT = INTRINSIC_WO_CHAIN(INTRINSICID, arg1, arg2, ...) 158 /// This node represents a target intrinsic function with no side effects. 159 /// The first operand is the ID number of the intrinsic from the 160 /// llvm::Intrinsic namespace. The operands to the intrinsic follow. The 161 /// node has returns the result of the intrinsic. 162 INTRINSIC_WO_CHAIN, 163 164 /// RESULT,OUTCHAIN = INTRINSIC_W_CHAIN(INCHAIN, INTRINSICID, arg1, ...) 165 /// This node represents a target intrinsic function with side effects that 166 /// returns a result. The first operand is a chain pointer. The second is 167 /// the ID number of the intrinsic from the llvm::Intrinsic namespace. The 168 /// operands to the intrinsic follow. The node has two results, the result 169 /// of the intrinsic and an output chain. 170 INTRINSIC_W_CHAIN, 171 172 /// OUTCHAIN = INTRINSIC_VOID(INCHAIN, INTRINSICID, arg1, arg2, ...) 173 /// This node represents a target intrinsic function with side effects that 174 /// does not return a result. The first operand is a chain pointer. The 175 /// second is the ID number of the intrinsic from the llvm::Intrinsic 176 /// namespace. The operands to the intrinsic follow. 177 INTRINSIC_VOID, 178 179 // CopyToReg - This node has three operands: a chain, a register number to 180 // set to this value, and a value. 181 CopyToReg, 182 183 // CopyFromReg - This node indicates that the input value is a virtual or 184 // physical register that is defined outside of the scope of this 185 // SelectionDAG. The register is available from the RegisterSDNode object. 186 CopyFromReg, 187 188 // UNDEF - An undefined node 189 UNDEF, 190 191 /// FORMAL_ARGUMENTS(CHAIN, CC#, ISVARARG, FLAG0, ..., FLAGn) - This node 192 /// represents the formal arguments for a function. CC# is a Constant value 193 /// indicating the calling convention of the function, and ISVARARG is a 194 /// flag that indicates whether the function is varargs or not. This node 195 /// has one result value for each incoming argument, plus one for the output 196 /// chain. It must be custom legalized. See description of CALL node for 197 /// FLAG argument contents explanation. 198 /// 199 FORMAL_ARGUMENTS, 200 201 /// RV1, RV2...RVn, CHAIN = CALL(CHAIN, CC#, ISVARARG, ISTAILCALL, CALLEE, 202 /// ARG0, FLAG0, ARG1, FLAG1, ... ARGn, FLAGn) 203 /// This node represents a fully general function call, before the legalizer 204 /// runs. This has one result value for each argument / flag pair, plus 205 /// a chain result. It must be custom legalized. Flag argument indicates 206 /// misc. argument attributes. Currently: 207 /// Bit 0 - signness 208 /// Bit 1 - 'inreg' attribute 209 /// Bit 2 - 'sret' attribute 210 /// Bit 4 - 'byval' attribute 211 /// Bit 5 - 'nest' attribute 212 /// Bit 6-9 - alignment of byval structures 213 /// Bit 10-26 - size of byval structures 214 /// Bits 31:27 - argument ABI alignment in the first argument piece and 215 /// alignment '1' in other argument pieces. 216 CALL, 217 218 // EXTRACT_ELEMENT - This is used to get the first or second (determined by 219 // a Constant, which is required to be operand #1), element of the aggregate 220 // value specified as operand #0. This is only for use before legalization, 221 // for values that will be broken into multiple registers. 222 EXTRACT_ELEMENT, 223 224 // BUILD_PAIR - This is the opposite of EXTRACT_ELEMENT in some ways. Given 225 // two values of the same integer value type, this produces a value twice as 226 // big. Like EXTRACT_ELEMENT, this can only be used before legalization. 227 BUILD_PAIR, 228 229 // MERGE_VALUES - This node takes multiple discrete operands and returns 230 // them all as its individual results. This nodes has exactly the same 231 // number of inputs and outputs, and is only valid before legalization. 232 // This node is useful for some pieces of the code generator that want to 233 // think about a single node with multiple results, not multiple nodes. 234 MERGE_VALUES, 235 236 // Simple integer binary arithmetic operators. 237 ADD, SUB, MUL, SDIV, UDIV, SREM, UREM, 238 239 // SMUL_LOHI/UMUL_LOHI - Multiply two integers of type iN, producing 240 // a signed/unsigned value of type i[2*N], and return the full value as 241 // two results, each of type iN. 242 SMUL_LOHI, UMUL_LOHI, 243 244 // SDIVREM/UDIVREM - Divide two integers and produce both a quotient and 245 // remainder result. 246 SDIVREM, UDIVREM, 247 248 // CARRY_FALSE - This node is used when folding other nodes, 249 // like ADDC/SUBC, which indicate the carry result is always false. 250 CARRY_FALSE, 251 252 // Carry-setting nodes for multiple precision addition and subtraction. 253 // These nodes take two operands of the same value type, and produce two 254 // results. The first result is the normal add or sub result, the second 255 // result is the carry flag result. 256 ADDC, SUBC, 257 258 // Carry-using nodes for multiple precision addition and subtraction. These 259 // nodes take three operands: The first two are the normal lhs and rhs to 260 // the add or sub, and the third is the input carry flag. These nodes 261 // produce two results; the normal result of the add or sub, and the output 262 // carry flag. These nodes both read and write a carry flag to allow them 263 // to them to be chained together for add and sub of arbitrarily large 264 // values. 265 ADDE, SUBE, 266 267 // Simple binary floating point operators. 268 FADD, FSUB, FMUL, FDIV, FREM, 269 270 // FCOPYSIGN(X, Y) - Return the value of X with the sign of Y. NOTE: This 271 // DAG node does not require that X and Y have the same type, just that they 272 // are both floating point. X and the result must have the same type. 273 // FCOPYSIGN(f32, f64) is allowed. 274 FCOPYSIGN, 275 276 // INT = FGETSIGN(FP) - Return the sign bit of the specified floating point 277 // value as an integer 0/1 value. 278 FGETSIGN, 279 280 /// BUILD_VECTOR(ELT0, ELT1, ELT2, ELT3,...) - Return a vector 281 /// with the specified, possibly variable, elements. The number of elements 282 /// is required to be a power of two. 283 BUILD_VECTOR, 284 285 /// INSERT_VECTOR_ELT(VECTOR, VAL, IDX) - Returns VECTOR with the element 286 /// at IDX replaced with VAL. 287 INSERT_VECTOR_ELT, 288 289 /// EXTRACT_VECTOR_ELT(VECTOR, IDX) - Returns a single element from VECTOR 290 /// identified by the (potentially variable) element number IDX. 291 EXTRACT_VECTOR_ELT, 292 293 /// CONCAT_VECTORS(VECTOR0, VECTOR1, ...) - Given a number of values of 294 /// vector type with the same length and element type, this produces a 295 /// concatenated vector result value, with length equal to the sum of the 296 /// lengths of the input vectors. 297 CONCAT_VECTORS, 298 299 /// EXTRACT_SUBVECTOR(VECTOR, IDX) - Returns a subvector from VECTOR (an 300 /// vector value) starting with the (potentially variable) element number 301 /// IDX, which must be a multiple of the result vector length. 302 EXTRACT_SUBVECTOR, 303 304 /// VECTOR_SHUFFLE(VEC1, VEC2, SHUFFLEVEC) - Returns a vector, of the same 305 /// type as VEC1/VEC2. SHUFFLEVEC is a BUILD_VECTOR of constant int values 306 /// (regardless of whether its datatype is legal or not) that indicate 307 /// which value each result element will get. The elements of VEC1/VEC2 are 308 /// enumerated in order. This is quite similar to the Altivec 'vperm' 309 /// instruction, except that the indices must be constants and are in terms 310 /// of the element size of VEC1/VEC2, not in terms of bytes. 311 VECTOR_SHUFFLE, 312 313 /// SCALAR_TO_VECTOR(VAL) - This represents the operation of loading a 314 /// scalar value into element 0 of the resultant vector type. The top 315 /// elements 1 to N-1 of the N-element vector are undefined. 316 SCALAR_TO_VECTOR, 317 318 // EXTRACT_SUBREG - This node is used to extract a sub-register value. 319 // This node takes a superreg and a constant sub-register index as operands. 320 EXTRACT_SUBREG, 321 322 // INSERT_SUBREG - This node is used to insert a sub-register value. 323 // This node takes a superreg, a subreg value, and a constant sub-register 324 // index as operands. 325 INSERT_SUBREG, 326 327 // MULHU/MULHS - Multiply high - Multiply two integers of type iN, producing 328 // an unsigned/signed value of type i[2*N], then return the top part. 329 MULHU, MULHS, 330 331 // Bitwise operators - logical and, logical or, logical xor, shift left, 332 // shift right algebraic (shift in sign bits), shift right logical (shift in 333 // zeroes), rotate left, rotate right, and byteswap. 334 AND, OR, XOR, SHL, SRA, SRL, ROTL, ROTR, BSWAP, 335 336 // Counting operators 337 CTTZ, CTLZ, CTPOP, 338 339 // Select(COND, TRUEVAL, FALSEVAL) 340 SELECT, 341 342 // Select with condition operator - This selects between a true value and 343 // a false value (ops #2 and #3) based on the boolean result of comparing 344 // the lhs and rhs (ops #0 and #1) of a conditional expression with the 345 // condition code in op #4, a CondCodeSDNode. 346 SELECT_CC, 347 348 // SetCC operator - This evaluates to a boolean (i1) true value if the 349 // condition is true. The operands to this are the left and right operands 350 // to compare (ops #0, and #1) and the condition code to compare them with 351 // (op #2) as a CondCodeSDNode. 352 SETCC, 353 354 // SHL_PARTS/SRA_PARTS/SRL_PARTS - These operators are used for expanded 355 // integer shift operations, just like ADD/SUB_PARTS. The operation 356 // ordering is: 357 // [Lo,Hi] = op [LoLHS,HiLHS], Amt 358 SHL_PARTS, SRA_PARTS, SRL_PARTS, 359 360 // Conversion operators. These are all single input single output 361 // operations. For all of these, the result type must be strictly 362 // wider or narrower (depending on the operation) than the source 363 // type. 364 365 // SIGN_EXTEND - Used for integer types, replicating the sign bit 366 // into new bits. 367 SIGN_EXTEND, 368 369 // ZERO_EXTEND - Used for integer types, zeroing the new bits. 370 ZERO_EXTEND, 371 372 // ANY_EXTEND - Used for integer types. The high bits are undefined. 373 ANY_EXTEND, 374 375 // TRUNCATE - Completely drop the high bits. 376 TRUNCATE, 377 378 // [SU]INT_TO_FP - These operators convert integers (whose interpreted sign 379 // depends on the first letter) to floating point. 380 SINT_TO_FP, 381 UINT_TO_FP, 382 383 // SIGN_EXTEND_INREG - This operator atomically performs a SHL/SRA pair to 384 // sign extend a small value in a large integer register (e.g. sign 385 // extending the low 8 bits of a 32-bit register to fill the top 24 bits 386 // with the 7th bit). The size of the smaller type is indicated by the 1th 387 // operand, a ValueType node. 388 SIGN_EXTEND_INREG, 389 390 /// FP_TO_[US]INT - Convert a floating point value to a signed or unsigned 391 /// integer. 392 FP_TO_SINT, 393 FP_TO_UINT, 394 395 /// X = FP_ROUND(Y, TRUNC) - Rounding 'Y' from a larger floating point type 396 /// down to the precision of the destination VT. TRUNC is a flag, which is 397 /// always an integer that is zero or one. If TRUNC is 0, this is a 398 /// normal rounding, if it is 1, this FP_ROUND is known to not change the 399 /// value of Y. 400 /// 401 /// The TRUNC = 1 case is used in cases where we know that the value will 402 /// not be modified by the node, because Y is not using any of the extra 403 /// precision of source type. This allows certain transformations like 404 /// FP_EXTEND(FP_ROUND(X,1)) -> X which are not safe for 405 /// FP_EXTEND(FP_ROUND(X,0)) because the extra bits aren't removed. 406 FP_ROUND, 407 408 // FLT_ROUNDS_ - Returns current rounding mode: 409 // -1 Undefined 410 // 0 Round to 0 411 // 1 Round to nearest 412 // 2 Round to +inf 413 // 3 Round to -inf 414 FLT_ROUNDS_, 415 416 /// X = FP_ROUND_INREG(Y, VT) - This operator takes an FP register, and 417 /// rounds it to a floating point value. It then promotes it and returns it 418 /// in a register of the same size. This operation effectively just 419 /// discards excess precision. The type to round down to is specified by 420 /// the VT operand, a VTSDNode. 421 FP_ROUND_INREG, 422 423 /// X = FP_EXTEND(Y) - Extend a smaller FP type into a larger FP type. 424 FP_EXTEND, 425 426 // BIT_CONVERT - Theis operator converts between integer and FP values, as 427 // if one was stored to memory as integer and the other was loaded from the 428 // same address (or equivalently for vector format conversions, etc). The 429 // source and result are required to have the same bit size (e.g. 430 // f32 <-> i32). This can also be used for int-to-int or fp-to-fp 431 // conversions, but that is a noop, deleted by getNode(). 432 BIT_CONVERT, 433 434 // FNEG, FABS, FSQRT, FSIN, FCOS, FPOWI, FPOW - Perform unary floating point 435 // negation, absolute value, square root, sine and cosine, powi, and pow 436 // operations. 437 FNEG, FABS, FSQRT, FSIN, FCOS, FPOWI, FPOW, 438 439 // LOAD and STORE have token chains as their first operand, then the same 440 // operands as an LLVM load/store instruction, then an offset node that 441 // is added / subtracted from the base pointer to form the address (for 442 // indexed memory ops). 443 LOAD, STORE, 444 445 // DYNAMIC_STACKALLOC - Allocate some number of bytes on the stack aligned 446 // to a specified boundary. This node always has two return values: a new 447 // stack pointer value and a chain. The first operand is the token chain, 448 // the second is the number of bytes to allocate, and the third is the 449 // alignment boundary. The size is guaranteed to be a multiple of the stack 450 // alignment, and the alignment is guaranteed to be bigger than the stack 451 // alignment (if required) or 0 to get standard stack alignment. 452 DYNAMIC_STACKALLOC, 453 454 // Control flow instructions. These all have token chains. 455 456 // BR - Unconditional branch. The first operand is the chain 457 // operand, the second is the MBB to branch to. 458 BR, 459 460 // BRIND - Indirect branch. The first operand is the chain, the second 461 // is the value to branch to, which must be of the same type as the target's 462 // pointer type. 463 BRIND, 464 465 // BR_JT - Jumptable branch. The first operand is the chain, the second 466 // is the jumptable index, the last one is the jumptable entry index. 467 BR_JT, 468 469 // BRCOND - Conditional branch. The first operand is the chain, 470 // the second is the condition, the third is the block to branch 471 // to if the condition is true. 472 BRCOND, 473 474 // BR_CC - Conditional branch. The behavior is like that of SELECT_CC, in 475 // that the condition is represented as condition code, and two nodes to 476 // compare, rather than as a combined SetCC node. The operands in order are 477 // chain, cc, lhs, rhs, block to branch to if condition is true. 478 BR_CC, 479 480 // RET - Return from function. The first operand is the chain, 481 // and any subsequent operands are pairs of return value and return value 482 // signness for the function. This operation can have variable number of 483 // operands. 484 RET, 485 486 // INLINEASM - Represents an inline asm block. This node always has two 487 // return values: a chain and a flag result. The inputs are as follows: 488 // Operand #0 : Input chain. 489 // Operand #1 : a ExternalSymbolSDNode with a pointer to the asm string. 490 // Operand #2n+2: A RegisterNode. 491 // Operand #2n+3: A TargetConstant, indicating if the reg is a use/def 492 // Operand #last: Optional, an incoming flag. 493 INLINEASM, 494 495 // LABEL - Represents a label in mid basic block used to track 496 // locations needed for debug and exception handling tables. This node 497 // returns a chain. 498 // Operand #0 : input chain. 499 // Operand #1 : module unique number use to identify the label. 500 // Operand #2 : 0 indicates a debug label (e.g. stoppoint), 1 indicates 501 // a EH label, 2 indicates unknown label type. 502 LABEL, 503 504 // DECLARE - Represents a llvm.dbg.declare intrinsic. It's used to track 505 // local variable declarations for debugging information. First operand is 506 // a chain, while the next two operands are first two arguments (address 507 // and variable) of a llvm.dbg.declare instruction. 508 DECLARE, 509 510 // STACKSAVE - STACKSAVE has one operand, an input chain. It produces a 511 // value, the same type as the pointer type for the system, and an output 512 // chain. 513 STACKSAVE, 514 515 // STACKRESTORE has two operands, an input chain and a pointer to restore to 516 // it returns an output chain. 517 STACKRESTORE, 518 519 // MEMSET/MEMCPY/MEMMOVE - The first operand is the chain. The following 520 // correspond to the operands of the LLVM intrinsic functions and the last 521 // one is AlwaysInline. The only result is a token chain. The alignment 522 // argument is guaranteed to be a Constant node. 523 MEMSET, 524 MEMMOVE, 525 MEMCPY, 526 527 // CALLSEQ_START/CALLSEQ_END - These operators mark the beginning and end of 528 // a call sequence, and carry arbitrary information that target might want 529 // to know. The first operand is a chain, the rest are specified by the 530 // target and not touched by the DAG optimizers. 531 CALLSEQ_START, // Beginning of a call sequence 532 CALLSEQ_END, // End of a call sequence 533 534 // VAARG - VAARG has three operands: an input chain, a pointer, and a 535 // SRCVALUE. It returns a pair of values: the vaarg value and a new chain. 536 VAARG, 537 538 // VACOPY - VACOPY has five operands: an input chain, a destination pointer, 539 // a source pointer, a SRCVALUE for the destination, and a SRCVALUE for the 540 // source. 541 VACOPY, 542 543 // VAEND, VASTART - VAEND and VASTART have three operands: an input chain, a 544 // pointer, and a SRCVALUE. 545 VAEND, VASTART, 546 547 // SRCVALUE - This is a node type that holds a Value* that is used to 548 // make reference to a value in the LLVM IR. 549 SRCVALUE, 550 551 // MEMOPERAND - This is a node that contains a MemOperand which records 552 // information about a memory reference. This is used to make AliasAnalysis 553 // queries from the backend. 554 MEMOPERAND, 555 556 // PCMARKER - This corresponds to the pcmarker intrinsic. 557 PCMARKER, 558 559 // READCYCLECOUNTER - This corresponds to the readcyclecounter intrinsic. 560 // The only operand is a chain and a value and a chain are produced. The 561 // value is the contents of the architecture specific cycle counter like 562 // register (or other high accuracy low latency clock source) 563 READCYCLECOUNTER, 564 565 // HANDLENODE node - Used as a handle for various purposes. 566 HANDLENODE, 567 568 // LOCATION - This node is used to represent a source location for debug 569 // info. It takes token chain as input, then a line number, then a column 570 // number, then a filename, then a working dir. It produces a token chain 571 // as output. 572 LOCATION, 573 574 // DEBUG_LOC - This node is used to represent source line information 575 // embedded in the code. It takes a token chain as input, then a line 576 // number, then a column then a file id (provided by MachineModuleInfo.) It 577 // produces a token chain as output. 578 DEBUG_LOC, 579 580 // TRAMPOLINE - This corresponds to the init_trampoline intrinsic. 581 // It takes as input a token chain, the pointer to the trampoline, 582 // the pointer to the nested function, the pointer to pass for the 583 // 'nest' parameter, a SRCVALUE for the trampoline and another for 584 // the nested function (allowing targets to access the original 585 // Function*). It produces the result of the intrinsic and a token 586 // chain as output. 587 TRAMPOLINE, 588 589 // TRAP - Trapping instruction 590 TRAP, 591 592 // BUILTIN_OP_END - This must be the last enum value in this list. 593 BUILTIN_OP_END 594 }; 595 596 /// Node predicates 597 598 /// isBuildVectorAllOnes - Return true if the specified node is a 599 /// BUILD_VECTOR where all of the elements are ~0 or undef. 600 bool isBuildVectorAllOnes(const SDNode *N); 601 602 /// isBuildVectorAllZeros - Return true if the specified node is a 603 /// BUILD_VECTOR where all of the elements are 0 or undef. 604 bool isBuildVectorAllZeros(const SDNode *N); 605 606 /// isDebugLabel - Return true if the specified node represents a debug 607 /// label (i.e. ISD::LABEL or TargetInstrInfo::LABEL node and third operand 608 /// is 0). 609 bool isDebugLabel(const SDNode *N); 610 611 //===--------------------------------------------------------------------===// 612 /// MemIndexedMode enum - This enum defines the load / store indexed 613 /// addressing modes. 614 /// 615 /// UNINDEXED "Normal" load / store. The effective address is already 616 /// computed and is available in the base pointer. The offset 617 /// operand is always undefined. In addition to producing a 618 /// chain, an unindexed load produces one value (result of the 619 /// load); an unindexed store does not produces a value. 620 /// 621 /// PRE_INC Similar to the unindexed mode where the effective address is 622 /// PRE_DEC the value of the base pointer add / subtract the offset. 623 /// It considers the computation as being folded into the load / 624 /// store operation (i.e. the load / store does the address 625 /// computation as well as performing the memory transaction). 626 /// The base operand is always undefined. In addition to 627 /// producing a chain, pre-indexed load produces two values 628 /// (result of the load and the result of the address 629 /// computation); a pre-indexed store produces one value (result 630 /// of the address computation). 631 /// 632 /// POST_INC The effective address is the value of the base pointer. The 633 /// POST_DEC value of the offset operand is then added to / subtracted 634 /// from the base after memory transaction. In addition to 635 /// producing a chain, post-indexed load produces two values 636 /// (the result of the load and the result of the base +/- offset 637 /// computation); a post-indexed store produces one value (the 638 /// the result of the base +/- offset computation). 639 /// 640 enum MemIndexedMode { 641 UNINDEXED = 0, 642 PRE_INC, 643 PRE_DEC, 644 POST_INC, 645 POST_DEC, 646 LAST_INDEXED_MODE 647 }; 648 649 //===--------------------------------------------------------------------===// 650 /// LoadExtType enum - This enum defines the three variants of LOADEXT 651 /// (load with extension). 652 /// 653 /// SEXTLOAD loads the integer operand and sign extends it to a larger 654 /// integer result type. 655 /// ZEXTLOAD loads the integer operand and zero extends it to a larger 656 /// integer result type. 657 /// EXTLOAD is used for three things: floating point extending loads, 658 /// integer extending loads [the top bits are undefined], and vector 659 /// extending loads [load into low elt]. 660 /// 661 enum LoadExtType { 662 NON_EXTLOAD = 0, 663 EXTLOAD, 664 SEXTLOAD, 665 ZEXTLOAD, 666 LAST_LOADX_TYPE 667 }; 668 669 //===--------------------------------------------------------------------===// 670 /// ISD::CondCode enum - These are ordered carefully to make the bitfields 671 /// below work out, when considering SETFALSE (something that never exists 672 /// dynamically) as 0. "U" -> Unsigned (for integer operands) or Unordered 673 /// (for floating point), "L" -> Less than, "G" -> Greater than, "E" -> Equal 674 /// to. If the "N" column is 1, the result of the comparison is undefined if 675 /// the input is a NAN. 676 /// 677 /// All of these (except for the 'always folded ops') should be handled for 678 /// floating point. For integer, only the SETEQ,SETNE,SETLT,SETLE,SETGT, 679 /// SETGE,SETULT,SETULE,SETUGT, and SETUGE opcodes are used. 680 /// 681 /// Note that these are laid out in a specific order to allow bit-twiddling 682 /// to transform conditions. 683 enum CondCode { 684 // Opcode N U L G E Intuitive operation 685 SETFALSE, // 0 0 0 0 Always false (always folded) 686 SETOEQ, // 0 0 0 1 True if ordered and equal 687 SETOGT, // 0 0 1 0 True if ordered and greater than 688 SETOGE, // 0 0 1 1 True if ordered and greater than or equal 689 SETOLT, // 0 1 0 0 True if ordered and less than 690 SETOLE, // 0 1 0 1 True if ordered and less than or equal 691 SETONE, // 0 1 1 0 True if ordered and operands are unequal 692 SETO, // 0 1 1 1 True if ordered (no nans) 693 SETUO, // 1 0 0 0 True if unordered: isnan(X) | isnan(Y) 694 SETUEQ, // 1 0 0 1 True if unordered or equal 695 SETUGT, // 1 0 1 0 True if unordered or greater than 696 SETUGE, // 1 0 1 1 True if unordered, greater than, or equal 697 SETULT, // 1 1 0 0 True if unordered or less than 698 SETULE, // 1 1 0 1 True if unordered, less than, or equal 699 SETUNE, // 1 1 1 0 True if unordered or not equal 700 SETTRUE, // 1 1 1 1 Always true (always folded) 701 // Don't care operations: undefined if the input is a nan. 702 SETFALSE2, // 1 X 0 0 0 Always false (always folded) 703 SETEQ, // 1 X 0 0 1 True if equal 704 SETGT, // 1 X 0 1 0 True if greater than 705 SETGE, // 1 X 0 1 1 True if greater than or equal 706 SETLT, // 1 X 1 0 0 True if less than 707 SETLE, // 1 X 1 0 1 True if less than or equal 708 SETNE, // 1 X 1 1 0 True if not equal 709 SETTRUE2, // 1 X 1 1 1 Always true (always folded) 710 711 SETCC_INVALID // Marker value. 712 }; 713 714 /// isSignedIntSetCC - Return true if this is a setcc instruction that 715 /// performs a signed comparison when used with integer operands. 716 inline bool isSignedIntSetCC(CondCode Code) { 717 return Code == SETGT || Code == SETGE || Code == SETLT || Code == SETLE; 718 } 719 720 /// isUnsignedIntSetCC - Return true if this is a setcc instruction that 721 /// performs an unsigned comparison when used with integer operands. 722 inline bool isUnsignedIntSetCC(CondCode Code) { 723 return Code == SETUGT || Code == SETUGE || Code == SETULT || Code == SETULE; 724 } 725 726 /// isTrueWhenEqual - Return true if the specified condition returns true if 727 /// the two operands to the condition are equal. Note that if one of the two 728 /// operands is a NaN, this value is meaningless. 729 inline bool isTrueWhenEqual(CondCode Cond) { 730 return ((int)Cond & 1) != 0; 731 } 732 733 /// getUnorderedFlavor - This function returns 0 if the condition is always 734 /// false if an operand is a NaN, 1 if the condition is always true if the 735 /// operand is a NaN, and 2 if the condition is undefined if the operand is a 736 /// NaN. 737 inline unsigned getUnorderedFlavor(CondCode Cond) { 738 return ((int)Cond >> 3) & 3; 739 } 740 741 /// getSetCCInverse - Return the operation corresponding to !(X op Y), where 742 /// 'op' is a valid SetCC operation. 743 CondCode getSetCCInverse(CondCode Operation, bool isInteger); 744 745 /// getSetCCSwappedOperands - Return the operation corresponding to (Y op X) 746 /// when given the operation for (X op Y). 747 CondCode getSetCCSwappedOperands(CondCode Operation); 748 749 /// getSetCCOrOperation - Return the result of a logical OR between different 750 /// comparisons of identical values: ((X op1 Y) | (X op2 Y)). This 751 /// function returns SETCC_INVALID if it is not possible to represent the 752 /// resultant comparison. 753 CondCode getSetCCOrOperation(CondCode Op1, CondCode Op2, bool isInteger); 754 755 /// getSetCCAndOperation - Return the result of a logical AND between 756 /// different comparisons of identical values: ((X op1 Y) & (X op2 Y)). This 757 /// function returns SETCC_INVALID if it is not possible to represent the 758 /// resultant comparison. 759 CondCode getSetCCAndOperation(CondCode Op1, CondCode Op2, bool isInteger); 760} // end llvm::ISD namespace 761 762 763//===----------------------------------------------------------------------===// 764/// SDOperand - Unlike LLVM values, Selection DAG nodes may return multiple 765/// values as the result of a computation. Many nodes return multiple values, 766/// from loads (which define a token and a return value) to ADDC (which returns 767/// a result and a carry value), to calls (which may return an arbitrary number 768/// of values). 769/// 770/// As such, each use of a SelectionDAG computation must indicate the node that 771/// computes it as well as which return value to use from that node. This pair 772/// of information is represented with the SDOperand value type. 773/// 774class SDOperand { 775public: 776 SDNode *Val; // The node defining the value we are using. 777 unsigned ResNo; // Which return value of the node we are using. 778 779 SDOperand() : Val(0), ResNo(0) {} 780 SDOperand(SDNode *val, unsigned resno) : Val(val), ResNo(resno) {} 781 782 bool operator==(const SDOperand &O) const { 783 return Val == O.Val && ResNo == O.ResNo; 784 } 785 bool operator!=(const SDOperand &O) const { 786 return !operator==(O); 787 } 788 bool operator<(const SDOperand &O) const { 789 return Val < O.Val || (Val == O.Val && ResNo < O.ResNo); 790 } 791 792 SDOperand getValue(unsigned R) const { 793 return SDOperand(Val, R); 794 } 795 796 // isOperand - Return true if this node is an operand of N. 797 bool isOperand(SDNode *N) const; 798 799 /// getValueType - Return the ValueType of the referenced return value. 800 /// 801 inline MVT::ValueType getValueType() const; 802 803 // Forwarding methods - These forward to the corresponding methods in SDNode. 804 inline unsigned getOpcode() const; 805 inline unsigned getNumOperands() const; 806 inline const SDOperand &getOperand(unsigned i) const; 807 inline uint64_t getConstantOperandVal(unsigned i) const; 808 inline bool isTargetOpcode() const; 809 inline unsigned getTargetOpcode() const; 810 811 812 /// reachesChainWithoutSideEffects - Return true if this operand (which must 813 /// be a chain) reaches the specified operand without crossing any 814 /// side-effecting instructions. In practice, this looks through token 815 /// factors and non-volatile loads. In order to remain efficient, this only 816 /// looks a couple of nodes in, it does not do an exhaustive search. 817 bool reachesChainWithoutSideEffects(SDOperand Dest, unsigned Depth = 2) const; 818 819 /// hasOneUse - Return true if there is exactly one operation using this 820 /// result value of the defining operator. 821 inline bool hasOneUse() const; 822 823 /// use_empty - Return true if there are no operations using this 824 /// result value of the defining operator. 825 inline bool use_empty() const; 826}; 827 828 829template<> struct DenseMapInfo<SDOperand> { 830 static inline SDOperand getEmptyKey() { return SDOperand((SDNode*)-1, -1U); } 831 static inline SDOperand getTombstoneKey() { return SDOperand((SDNode*)-1, 0);} 832 static unsigned getHashValue(const SDOperand &Val) { 833 return (unsigned)((uintptr_t)Val.Val >> 4) ^ 834 (unsigned)((uintptr_t)Val.Val >> 9) + Val.ResNo; 835 } 836 static bool isEqual(const SDOperand &LHS, const SDOperand &RHS) { 837 return LHS == RHS; 838 } 839 static bool isPod() { return true; } 840}; 841 842/// simplify_type specializations - Allow casting operators to work directly on 843/// SDOperands as if they were SDNode*'s. 844template<> struct simplify_type<SDOperand> { 845 typedef SDNode* SimpleType; 846 static SimpleType getSimplifiedValue(const SDOperand &Val) { 847 return static_cast<SimpleType>(Val.Val); 848 } 849}; 850template<> struct simplify_type<const SDOperand> { 851 typedef SDNode* SimpleType; 852 static SimpleType getSimplifiedValue(const SDOperand &Val) { 853 return static_cast<SimpleType>(Val.Val); 854 } 855}; 856 857 858/// SDNode - Represents one node in the SelectionDAG. 859/// 860class SDNode : public FoldingSetNode { 861 /// NodeType - The operation that this node performs. 862 /// 863 unsigned short NodeType; 864 865 /// OperandsNeedDelete - This is true if OperandList was new[]'d. If true, 866 /// then they will be delete[]'d when the node is destroyed. 867 bool OperandsNeedDelete : 1; 868 869 /// NodeId - Unique id per SDNode in the DAG. 870 int NodeId; 871 872 /// OperandList - The values that are used by this operation. 873 /// 874 SDOperand *OperandList; 875 876 /// ValueList - The types of the values this node defines. SDNode's may 877 /// define multiple values simultaneously. 878 const MVT::ValueType *ValueList; 879 880 /// NumOperands/NumValues - The number of entries in the Operand/Value list. 881 unsigned short NumOperands, NumValues; 882 883 /// Prev/Next pointers - These pointers form the linked list of of the 884 /// AllNodes list in the current DAG. 885 SDNode *Prev, *Next; 886 friend struct ilist_traits<SDNode>; 887 888 /// Uses - These are all of the SDNode's that use a value produced by this 889 /// node. 890 SmallVector<SDNode*,3> Uses; 891 892 // Out-of-line virtual method to give class a home. 893 virtual void ANCHOR(); 894public: 895 virtual ~SDNode() { 896 assert(NumOperands == 0 && "Operand list not cleared before deletion"); 897 NodeType = ISD::DELETED_NODE; 898 } 899 900 //===--------------------------------------------------------------------===// 901 // Accessors 902 // 903 unsigned getOpcode() const { return NodeType; } 904 bool isTargetOpcode() const { return NodeType >= ISD::BUILTIN_OP_END; } 905 unsigned getTargetOpcode() const { 906 assert(isTargetOpcode() && "Not a target opcode!"); 907 return NodeType - ISD::BUILTIN_OP_END; 908 } 909 910 size_t use_size() const { return Uses.size(); } 911 bool use_empty() const { return Uses.empty(); } 912 bool hasOneUse() const { return Uses.size() == 1; } 913 914 /// getNodeId - Return the unique node id. 915 /// 916 int getNodeId() const { return NodeId; } 917 918 /// setNodeId - Set unique node id. 919 void setNodeId(int Id) { NodeId = Id; } 920 921 typedef SmallVector<SDNode*,3>::const_iterator use_iterator; 922 use_iterator use_begin() const { return Uses.begin(); } 923 use_iterator use_end() const { return Uses.end(); } 924 925 /// hasNUsesOfValue - Return true if there are exactly NUSES uses of the 926 /// indicated value. This method ignores uses of other values defined by this 927 /// operation. 928 bool hasNUsesOfValue(unsigned NUses, unsigned Value) const; 929 930 /// hasAnyUseOfValue - Return true if there are any use of the indicated 931 /// value. This method ignores uses of other values defined by this operation. 932 bool hasAnyUseOfValue(unsigned Value) const; 933 934 /// isOnlyUse - Return true if this node is the only use of N. 935 /// 936 bool isOnlyUse(SDNode *N) const; 937 938 /// isOperand - Return true if this node is an operand of N. 939 /// 940 bool isOperand(SDNode *N) const; 941 942 /// isPredecessor - Return true if this node is a predecessor of N. This node 943 /// is either an operand of N or it can be reached by recursively traversing 944 /// up the operands. 945 /// NOTE: this is an expensive method. Use it carefully. 946 bool isPredecessor(SDNode *N) const; 947 948 /// getNumOperands - Return the number of values used by this operation. 949 /// 950 unsigned getNumOperands() const { return NumOperands; } 951 952 /// getConstantOperandVal - Helper method returns the integer value of a 953 /// ConstantSDNode operand. 954 uint64_t getConstantOperandVal(unsigned Num) const; 955 956 const SDOperand &getOperand(unsigned Num) const { 957 assert(Num < NumOperands && "Invalid child # of SDNode!"); 958 return OperandList[Num]; 959 } 960 961 typedef const SDOperand* op_iterator; 962 op_iterator op_begin() const { return OperandList; } 963 op_iterator op_end() const { return OperandList+NumOperands; } 964 965 966 SDVTList getVTList() const { 967 SDVTList X = { ValueList, NumValues }; 968 return X; 969 }; 970 971 /// getNumValues - Return the number of values defined/returned by this 972 /// operator. 973 /// 974 unsigned getNumValues() const { return NumValues; } 975 976 /// getValueType - Return the type of a specified result. 977 /// 978 MVT::ValueType getValueType(unsigned ResNo) const { 979 assert(ResNo < NumValues && "Illegal result number!"); 980 return ValueList[ResNo]; 981 } 982 983 typedef const MVT::ValueType* value_iterator; 984 value_iterator value_begin() const { return ValueList; } 985 value_iterator value_end() const { return ValueList+NumValues; } 986 987 /// getOperationName - Return the opcode of this operation for printing. 988 /// 989 std::string getOperationName(const SelectionDAG *G = 0) const; 990 static const char* getIndexedModeName(ISD::MemIndexedMode AM); 991 void dump() const; 992 void dump(const SelectionDAG *G) const; 993 994 static bool classof(const SDNode *) { return true; } 995 996 /// Profile - Gather unique data for the node. 997 /// 998 void Profile(FoldingSetNodeID &ID); 999 1000protected: 1001 friend class SelectionDAG; 1002 1003 /// getValueTypeList - Return a pointer to the specified value type. 1004 /// 1005 static const MVT::ValueType *getValueTypeList(MVT::ValueType VT); 1006 static SDVTList getSDVTList(MVT::ValueType VT) { 1007 SDVTList Ret = { getValueTypeList(VT), 1 }; 1008 return Ret; 1009 } 1010 1011 SDNode(unsigned Opc, SDVTList VTs, const SDOperand *Ops, unsigned NumOps) 1012 : NodeType(Opc), NodeId(-1) { 1013 OperandsNeedDelete = true; 1014 NumOperands = NumOps; 1015 OperandList = NumOps ? new SDOperand[NumOperands] : 0; 1016 1017 for (unsigned i = 0; i != NumOps; ++i) { 1018 OperandList[i] = Ops[i]; 1019 Ops[i].Val->Uses.push_back(this); 1020 } 1021 1022 ValueList = VTs.VTs; 1023 NumValues = VTs.NumVTs; 1024 Prev = 0; Next = 0; 1025 } 1026 SDNode(unsigned Opc, SDVTList VTs) : NodeType(Opc), NodeId(-1) { 1027 OperandsNeedDelete = false; // Operands set with InitOperands. 1028 NumOperands = 0; 1029 OperandList = 0; 1030 1031 ValueList = VTs.VTs; 1032 NumValues = VTs.NumVTs; 1033 Prev = 0; Next = 0; 1034 } 1035 1036 /// InitOperands - Initialize the operands list of this node with the 1037 /// specified values, which are part of the node (thus they don't need to be 1038 /// copied in or allocated). 1039 void InitOperands(SDOperand *Ops, unsigned NumOps) { 1040 assert(OperandList == 0 && "Operands already set!"); 1041 NumOperands = NumOps; 1042 OperandList = Ops; 1043 1044 for (unsigned i = 0; i != NumOps; ++i) 1045 Ops[i].Val->Uses.push_back(this); 1046 } 1047 1048 /// MorphNodeTo - This frees the operands of the current node, resets the 1049 /// opcode, types, and operands to the specified value. This should only be 1050 /// used by the SelectionDAG class. 1051 void MorphNodeTo(unsigned Opc, SDVTList L, 1052 const SDOperand *Ops, unsigned NumOps); 1053 1054 void addUser(SDNode *User) { 1055 Uses.push_back(User); 1056 } 1057 void removeUser(SDNode *User) { 1058 // Remove this user from the operand's use list. 1059 for (unsigned i = Uses.size(); ; --i) { 1060 assert(i != 0 && "Didn't find user!"); 1061 if (Uses[i-1] == User) { 1062 Uses[i-1] = Uses.back(); 1063 Uses.pop_back(); 1064 return; 1065 } 1066 } 1067 } 1068}; 1069 1070 1071// Define inline functions from the SDOperand class. 1072 1073inline unsigned SDOperand::getOpcode() const { 1074 return Val->getOpcode(); 1075} 1076inline MVT::ValueType SDOperand::getValueType() const { 1077 return Val->getValueType(ResNo); 1078} 1079inline unsigned SDOperand::getNumOperands() const { 1080 return Val->getNumOperands(); 1081} 1082inline const SDOperand &SDOperand::getOperand(unsigned i) const { 1083 return Val->getOperand(i); 1084} 1085inline uint64_t SDOperand::getConstantOperandVal(unsigned i) const { 1086 return Val->getConstantOperandVal(i); 1087} 1088inline bool SDOperand::isTargetOpcode() const { 1089 return Val->isTargetOpcode(); 1090} 1091inline unsigned SDOperand::getTargetOpcode() const { 1092 return Val->getTargetOpcode(); 1093} 1094inline bool SDOperand::hasOneUse() const { 1095 return Val->hasNUsesOfValue(1, ResNo); 1096} 1097inline bool SDOperand::use_empty() const { 1098 return !Val->hasAnyUseOfValue(ResNo); 1099} 1100 1101/// UnarySDNode - This class is used for single-operand SDNodes. This is solely 1102/// to allow co-allocation of node operands with the node itself. 1103class UnarySDNode : public SDNode { 1104 virtual void ANCHOR(); // Out-of-line virtual method to give class a home. 1105 SDOperand Op; 1106public: 1107 UnarySDNode(unsigned Opc, SDVTList VTs, SDOperand X) 1108 : SDNode(Opc, VTs), Op(X) { 1109 InitOperands(&Op, 1); 1110 } 1111}; 1112 1113/// BinarySDNode - This class is used for two-operand SDNodes. This is solely 1114/// to allow co-allocation of node operands with the node itself. 1115class BinarySDNode : public SDNode { 1116 virtual void ANCHOR(); // Out-of-line virtual method to give class a home. 1117 SDOperand Ops[2]; 1118public: 1119 BinarySDNode(unsigned Opc, SDVTList VTs, SDOperand X, SDOperand Y) 1120 : SDNode(Opc, VTs) { 1121 Ops[0] = X; 1122 Ops[1] = Y; 1123 InitOperands(Ops, 2); 1124 } 1125}; 1126 1127/// TernarySDNode - This class is used for three-operand SDNodes. This is solely 1128/// to allow co-allocation of node operands with the node itself. 1129class TernarySDNode : public SDNode { 1130 virtual void ANCHOR(); // Out-of-line virtual method to give class a home. 1131 SDOperand Ops[3]; 1132public: 1133 TernarySDNode(unsigned Opc, SDVTList VTs, SDOperand X, SDOperand Y, 1134 SDOperand Z) 1135 : SDNode(Opc, VTs) { 1136 Ops[0] = X; 1137 Ops[1] = Y; 1138 Ops[2] = Z; 1139 InitOperands(Ops, 3); 1140 } 1141}; 1142 1143 1144/// HandleSDNode - This class is used to form a handle around another node that 1145/// is persistant and is updated across invocations of replaceAllUsesWith on its 1146/// operand. This node should be directly created by end-users and not added to 1147/// the AllNodes list. 1148class HandleSDNode : public SDNode { 1149 virtual void ANCHOR(); // Out-of-line virtual method to give class a home. 1150 SDOperand Op; 1151public: 1152 explicit HandleSDNode(SDOperand X) 1153 : SDNode(ISD::HANDLENODE, getSDVTList(MVT::Other)), Op(X) { 1154 InitOperands(&Op, 1); 1155 } 1156 ~HandleSDNode(); 1157 SDOperand getValue() const { return Op; } 1158}; 1159 1160class StringSDNode : public SDNode { 1161 std::string Value; 1162 virtual void ANCHOR(); // Out-of-line virtual method to give class a home. 1163protected: 1164 friend class SelectionDAG; 1165 explicit StringSDNode(const std::string &val) 1166 : SDNode(ISD::STRING, getSDVTList(MVT::Other)), Value(val) { 1167 } 1168public: 1169 const std::string &getValue() const { return Value; } 1170 static bool classof(const StringSDNode *) { return true; } 1171 static bool classof(const SDNode *N) { 1172 return N->getOpcode() == ISD::STRING; 1173 } 1174}; 1175 1176class ConstantSDNode : public SDNode { 1177 APInt Value; 1178 virtual void ANCHOR(); // Out-of-line virtual method to give class a home. 1179protected: 1180 friend class SelectionDAG; 1181 ConstantSDNode(bool isTarget, const APInt &val, MVT::ValueType VT) 1182 : SDNode(isTarget ? ISD::TargetConstant : ISD::Constant, getSDVTList(VT)), 1183 Value(val) { 1184 } 1185public: 1186 1187 const APInt &getAPIntValue() const { return Value; } 1188 uint64_t getValue() const { return Value.getZExtValue(); } 1189 1190 int64_t getSignExtended() const { 1191 unsigned Bits = MVT::getSizeInBits(getValueType(0)); 1192 return ((int64_t)Value.getZExtValue() << (64-Bits)) >> (64-Bits); 1193 } 1194 1195 bool isNullValue() const { return Value == 0; } 1196 bool isAllOnesValue() const { 1197 return Value == MVT::getIntVTBitMask(getValueType(0)); 1198 } 1199 1200 static bool classof(const ConstantSDNode *) { return true; } 1201 static bool classof(const SDNode *N) { 1202 return N->getOpcode() == ISD::Constant || 1203 N->getOpcode() == ISD::TargetConstant; 1204 } 1205}; 1206 1207class ConstantFPSDNode : public SDNode { 1208 APFloat Value; 1209 virtual void ANCHOR(); // Out-of-line virtual method to give class a home. 1210 // Longterm plan: replace all uses of getValue with getValueAPF, remove 1211 // getValue, rename getValueAPF to getValue. 1212protected: 1213 friend class SelectionDAG; 1214 ConstantFPSDNode(bool isTarget, const APFloat& val, MVT::ValueType VT) 1215 : SDNode(isTarget ? ISD::TargetConstantFP : ISD::ConstantFP, 1216 getSDVTList(VT)), Value(val) { 1217 } 1218public: 1219 1220 const APFloat& getValueAPF() const { return Value; } 1221 1222 /// isExactlyValue - We don't rely on operator== working on double values, as 1223 /// it returns true for things that are clearly not equal, like -0.0 and 0.0. 1224 /// As such, this method can be used to do an exact bit-for-bit comparison of 1225 /// two floating point values. 1226 1227 /// We leave the version with the double argument here because it's just so 1228 /// convenient to write "2.0" and the like. Without this function we'd 1229 /// have to duplicate its logic everywhere it's called. 1230 bool isExactlyValue(double V) const { 1231 APFloat Tmp(V); 1232 Tmp.convert(Value.getSemantics(), APFloat::rmNearestTiesToEven); 1233 return isExactlyValue(Tmp); 1234 } 1235 bool isExactlyValue(const APFloat& V) const; 1236 1237 bool isValueValidForType(MVT::ValueType VT, const APFloat& Val); 1238 1239 static bool classof(const ConstantFPSDNode *) { return true; } 1240 static bool classof(const SDNode *N) { 1241 return N->getOpcode() == ISD::ConstantFP || 1242 N->getOpcode() == ISD::TargetConstantFP; 1243 } 1244}; 1245 1246class GlobalAddressSDNode : public SDNode { 1247 GlobalValue *TheGlobal; 1248 int Offset; 1249 virtual void ANCHOR(); // Out-of-line virtual method to give class a home. 1250protected: 1251 friend class SelectionDAG; 1252 GlobalAddressSDNode(bool isTarget, const GlobalValue *GA, MVT::ValueType VT, 1253 int o = 0); 1254public: 1255 1256 GlobalValue *getGlobal() const { return TheGlobal; } 1257 int getOffset() const { return Offset; } 1258 1259 static bool classof(const GlobalAddressSDNode *) { return true; } 1260 static bool classof(const SDNode *N) { 1261 return N->getOpcode() == ISD::GlobalAddress || 1262 N->getOpcode() == ISD::TargetGlobalAddress || 1263 N->getOpcode() == ISD::GlobalTLSAddress || 1264 N->getOpcode() == ISD::TargetGlobalTLSAddress; 1265 } 1266}; 1267 1268class FrameIndexSDNode : public SDNode { 1269 int FI; 1270 virtual void ANCHOR(); // Out-of-line virtual method to give class a home. 1271protected: 1272 friend class SelectionDAG; 1273 FrameIndexSDNode(int fi, MVT::ValueType VT, bool isTarg) 1274 : SDNode(isTarg ? ISD::TargetFrameIndex : ISD::FrameIndex, getSDVTList(VT)), 1275 FI(fi) { 1276 } 1277public: 1278 1279 int getIndex() const { return FI; } 1280 1281 static bool classof(const FrameIndexSDNode *) { return true; } 1282 static bool classof(const SDNode *N) { 1283 return N->getOpcode() == ISD::FrameIndex || 1284 N->getOpcode() == ISD::TargetFrameIndex; 1285 } 1286}; 1287 1288class JumpTableSDNode : public SDNode { 1289 int JTI; 1290 virtual void ANCHOR(); // Out-of-line virtual method to give class a home. 1291protected: 1292 friend class SelectionDAG; 1293 JumpTableSDNode(int jti, MVT::ValueType VT, bool isTarg) 1294 : SDNode(isTarg ? ISD::TargetJumpTable : ISD::JumpTable, getSDVTList(VT)), 1295 JTI(jti) { 1296 } 1297public: 1298 1299 int getIndex() const { return JTI; } 1300 1301 static bool classof(const JumpTableSDNode *) { return true; } 1302 static bool classof(const SDNode *N) { 1303 return N->getOpcode() == ISD::JumpTable || 1304 N->getOpcode() == ISD::TargetJumpTable; 1305 } 1306}; 1307 1308class ConstantPoolSDNode : public SDNode { 1309 union { 1310 Constant *ConstVal; 1311 MachineConstantPoolValue *MachineCPVal; 1312 } Val; 1313 int Offset; // It's a MachineConstantPoolValue if top bit is set. 1314 unsigned Alignment; 1315 virtual void ANCHOR(); // Out-of-line virtual method to give class a home. 1316protected: 1317 friend class SelectionDAG; 1318 ConstantPoolSDNode(bool isTarget, Constant *c, MVT::ValueType VT, 1319 int o=0) 1320 : SDNode(isTarget ? ISD::TargetConstantPool : ISD::ConstantPool, 1321 getSDVTList(VT)), Offset(o), Alignment(0) { 1322 assert((int)Offset >= 0 && "Offset is too large"); 1323 Val.ConstVal = c; 1324 } 1325 ConstantPoolSDNode(bool isTarget, Constant *c, MVT::ValueType VT, int o, 1326 unsigned Align) 1327 : SDNode(isTarget ? ISD::TargetConstantPool : ISD::ConstantPool, 1328 getSDVTList(VT)), Offset(o), Alignment(Align) { 1329 assert((int)Offset >= 0 && "Offset is too large"); 1330 Val.ConstVal = c; 1331 } 1332 ConstantPoolSDNode(bool isTarget, MachineConstantPoolValue *v, 1333 MVT::ValueType VT, int o=0) 1334 : SDNode(isTarget ? ISD::TargetConstantPool : ISD::ConstantPool, 1335 getSDVTList(VT)), Offset(o), Alignment(0) { 1336 assert((int)Offset >= 0 && "Offset is too large"); 1337 Val.MachineCPVal = v; 1338 Offset |= 1 << (sizeof(unsigned)*8-1); 1339 } 1340 ConstantPoolSDNode(bool isTarget, MachineConstantPoolValue *v, 1341 MVT::ValueType VT, int o, unsigned Align) 1342 : SDNode(isTarget ? ISD::TargetConstantPool : ISD::ConstantPool, 1343 getSDVTList(VT)), Offset(o), Alignment(Align) { 1344 assert((int)Offset >= 0 && "Offset is too large"); 1345 Val.MachineCPVal = v; 1346 Offset |= 1 << (sizeof(unsigned)*8-1); 1347 } 1348public: 1349 1350 bool isMachineConstantPoolEntry() const { 1351 return (int)Offset < 0; 1352 } 1353 1354 Constant *getConstVal() const { 1355 assert(!isMachineConstantPoolEntry() && "Wrong constantpool type"); 1356 return Val.ConstVal; 1357 } 1358 1359 MachineConstantPoolValue *getMachineCPVal() const { 1360 assert(isMachineConstantPoolEntry() && "Wrong constantpool type"); 1361 return Val.MachineCPVal; 1362 } 1363 1364 int getOffset() const { 1365 return Offset & ~(1 << (sizeof(unsigned)*8-1)); 1366 } 1367 1368 // Return the alignment of this constant pool object, which is either 0 (for 1369 // default alignment) or log2 of the desired value. 1370 unsigned getAlignment() const { return Alignment; } 1371 1372 const Type *getType() const; 1373 1374 static bool classof(const ConstantPoolSDNode *) { return true; } 1375 static bool classof(const SDNode *N) { 1376 return N->getOpcode() == ISD::ConstantPool || 1377 N->getOpcode() == ISD::TargetConstantPool; 1378 } 1379}; 1380 1381class BasicBlockSDNode : public SDNode { 1382 MachineBasicBlock *MBB; 1383 virtual void ANCHOR(); // Out-of-line virtual method to give class a home. 1384protected: 1385 friend class SelectionDAG; 1386 explicit BasicBlockSDNode(MachineBasicBlock *mbb) 1387 : SDNode(ISD::BasicBlock, getSDVTList(MVT::Other)), MBB(mbb) { 1388 } 1389public: 1390 1391 MachineBasicBlock *getBasicBlock() const { return MBB; } 1392 1393 static bool classof(const BasicBlockSDNode *) { return true; } 1394 static bool classof(const SDNode *N) { 1395 return N->getOpcode() == ISD::BasicBlock; 1396 } 1397}; 1398 1399class SrcValueSDNode : public SDNode { 1400 const Value *V; 1401 virtual void ANCHOR(); // Out-of-line virtual method to give class a home. 1402protected: 1403 friend class SelectionDAG; 1404 /// Create a SrcValue for a general value. 1405 explicit SrcValueSDNode(const Value *v) 1406 : SDNode(ISD::SRCVALUE, getSDVTList(MVT::Other)), V(v) {} 1407 1408public: 1409 /// getValue - return the contained Value. 1410 const Value *getValue() const { return V; } 1411 1412 static bool classof(const SrcValueSDNode *) { return true; } 1413 static bool classof(const SDNode *N) { 1414 return N->getOpcode() == ISD::SRCVALUE; 1415 } 1416}; 1417 1418 1419/// MemOperandSDNode - An SDNode that holds a MemOperand. This is 1420/// used to represent a reference to memory after ISD::LOAD 1421/// and ISD::STORE have been lowered. 1422/// 1423class MemOperandSDNode : public SDNode { 1424 virtual void ANCHOR(); // Out-of-line virtual method to give class a home. 1425protected: 1426 friend class SelectionDAG; 1427 /// Create a MemOperand node 1428 explicit MemOperandSDNode(const MemOperand &mo) 1429 : SDNode(ISD::MEMOPERAND, getSDVTList(MVT::Other)), MO(mo) {} 1430 1431public: 1432 /// MO - The contained MemOperand. 1433 const MemOperand MO; 1434 1435 static bool classof(const MemOperandSDNode *) { return true; } 1436 static bool classof(const SDNode *N) { 1437 return N->getOpcode() == ISD::MEMOPERAND; 1438 } 1439}; 1440 1441 1442class RegisterSDNode : public SDNode { 1443 unsigned Reg; 1444 virtual void ANCHOR(); // Out-of-line virtual method to give class a home. 1445protected: 1446 friend class SelectionDAG; 1447 RegisterSDNode(unsigned reg, MVT::ValueType VT) 1448 : SDNode(ISD::Register, getSDVTList(VT)), Reg(reg) { 1449 } 1450public: 1451 1452 unsigned getReg() const { return Reg; } 1453 1454 static bool classof(const RegisterSDNode *) { return true; } 1455 static bool classof(const SDNode *N) { 1456 return N->getOpcode() == ISD::Register; 1457 } 1458}; 1459 1460class ExternalSymbolSDNode : public SDNode { 1461 const char *Symbol; 1462 virtual void ANCHOR(); // Out-of-line virtual method to give class a home. 1463protected: 1464 friend class SelectionDAG; 1465 ExternalSymbolSDNode(bool isTarget, const char *Sym, MVT::ValueType VT) 1466 : SDNode(isTarget ? ISD::TargetExternalSymbol : ISD::ExternalSymbol, 1467 getSDVTList(VT)), Symbol(Sym) { 1468 } 1469public: 1470 1471 const char *getSymbol() const { return Symbol; } 1472 1473 static bool classof(const ExternalSymbolSDNode *) { return true; } 1474 static bool classof(const SDNode *N) { 1475 return N->getOpcode() == ISD::ExternalSymbol || 1476 N->getOpcode() == ISD::TargetExternalSymbol; 1477 } 1478}; 1479 1480class CondCodeSDNode : public SDNode { 1481 ISD::CondCode Condition; 1482 virtual void ANCHOR(); // Out-of-line virtual method to give class a home. 1483protected: 1484 friend class SelectionDAG; 1485 explicit CondCodeSDNode(ISD::CondCode Cond) 1486 : SDNode(ISD::CONDCODE, getSDVTList(MVT::Other)), Condition(Cond) { 1487 } 1488public: 1489 1490 ISD::CondCode get() const { return Condition; } 1491 1492 static bool classof(const CondCodeSDNode *) { return true; } 1493 static bool classof(const SDNode *N) { 1494 return N->getOpcode() == ISD::CONDCODE; 1495 } 1496}; 1497 1498/// VTSDNode - This class is used to represent MVT::ValueType's, which are used 1499/// to parameterize some operations. 1500class VTSDNode : public SDNode { 1501 MVT::ValueType ValueType; 1502 virtual void ANCHOR(); // Out-of-line virtual method to give class a home. 1503protected: 1504 friend class SelectionDAG; 1505 explicit VTSDNode(MVT::ValueType VT) 1506 : SDNode(ISD::VALUETYPE, getSDVTList(MVT::Other)), ValueType(VT) { 1507 } 1508public: 1509 1510 MVT::ValueType getVT() const { return ValueType; } 1511 1512 static bool classof(const VTSDNode *) { return true; } 1513 static bool classof(const SDNode *N) { 1514 return N->getOpcode() == ISD::VALUETYPE; 1515 } 1516}; 1517 1518/// LSBaseSDNode - Base class for LoadSDNode and StoreSDNode 1519/// 1520class LSBaseSDNode : public SDNode { 1521private: 1522 // AddrMode - unindexed, pre-indexed, post-indexed. 1523 ISD::MemIndexedMode AddrMode; 1524 1525 // MemoryVT - VT of in-memory value. 1526 MVT::ValueType MemoryVT; 1527 1528 //! SrcValue - Memory location for alias analysis. 1529 const Value *SrcValue; 1530 1531 //! SVOffset - Memory location offset. 1532 int SVOffset; 1533 1534 //! Alignment - Alignment of memory location in bytes. 1535 unsigned Alignment; 1536 1537 //! IsVolatile - True if the store is volatile. 1538 bool IsVolatile; 1539protected: 1540 //! Operand array for load and store 1541 /*! 1542 \note Moving this array to the base class captures more 1543 common functionality shared between LoadSDNode and 1544 StoreSDNode 1545 */ 1546 SDOperand Ops[4]; 1547public: 1548 LSBaseSDNode(ISD::NodeType NodeTy, SDOperand *Operands, unsigned NumOperands, 1549 SDVTList VTs, ISD::MemIndexedMode AM, MVT::ValueType VT, 1550 const Value *SV, int SVO, unsigned Align, bool Vol) 1551 : SDNode(NodeTy, VTs), 1552 AddrMode(AM), MemoryVT(VT), 1553 SrcValue(SV), SVOffset(SVO), Alignment(Align), IsVolatile(Vol) 1554 { 1555 for (unsigned i = 0; i != NumOperands; ++i) 1556 Ops[i] = Operands[i]; 1557 InitOperands(Ops, NumOperands); 1558 assert(Align != 0 && "Loads and stores should have non-zero aligment"); 1559 assert((getOffset().getOpcode() == ISD::UNDEF || isIndexed()) && 1560 "Only indexed loads and stores have a non-undef offset operand"); 1561 } 1562 1563 const SDOperand getChain() const { 1564 return getOperand(0); 1565 } 1566 const SDOperand getBasePtr() const { 1567 return getOperand(getOpcode() == ISD::LOAD ? 1 : 2); 1568 } 1569 const SDOperand getOffset() const { 1570 return getOperand(getOpcode() == ISD::LOAD ? 2 : 3); 1571 } 1572 const SDOperand getValue() const { 1573 assert(getOpcode() == ISD::STORE); 1574 return getOperand(1); 1575 } 1576 1577 const Value *getSrcValue() const { return SrcValue; } 1578 int getSrcValueOffset() const { return SVOffset; } 1579 unsigned getAlignment() const { return Alignment; } 1580 MVT::ValueType getMemoryVT() const { return MemoryVT; } 1581 bool isVolatile() const { return IsVolatile; } 1582 1583 ISD::MemIndexedMode getAddressingMode() const { return AddrMode; } 1584 1585 /// isIndexed - Return true if this is a pre/post inc/dec load/store. 1586 bool isIndexed() const { return AddrMode != ISD::UNINDEXED; } 1587 1588 /// isUnindexed - Return true if this is NOT a pre/post inc/dec load/store. 1589 bool isUnindexed() const { return AddrMode == ISD::UNINDEXED; } 1590 1591 /// getMemOperand - Return a MemOperand object describing the memory 1592 /// reference performed by this load or store. 1593 MemOperand getMemOperand() const; 1594 1595 static bool classof(const LSBaseSDNode *N) { return true; } 1596 static bool classof(const SDNode *N) { 1597 return N->getOpcode() == ISD::LOAD || 1598 N->getOpcode() == ISD::STORE; 1599 } 1600}; 1601 1602/// LoadSDNode - This class is used to represent ISD::LOAD nodes. 1603/// 1604class LoadSDNode : public LSBaseSDNode { 1605 virtual void ANCHOR(); // Out-of-line virtual method to give class a home. 1606 1607 // ExtType - non-ext, anyext, sext, zext. 1608 ISD::LoadExtType ExtType; 1609 1610protected: 1611 friend class SelectionDAG; 1612 LoadSDNode(SDOperand *ChainPtrOff, SDVTList VTs, 1613 ISD::MemIndexedMode AM, ISD::LoadExtType ETy, MVT::ValueType LVT, 1614 const Value *SV, int O=0, unsigned Align=0, bool Vol=false) 1615 : LSBaseSDNode(ISD::LOAD, ChainPtrOff, 3, 1616 VTs, AM, LVT, SV, O, Align, Vol), 1617 ExtType(ETy) { } 1618public: 1619 1620 ISD::LoadExtType getExtensionType() const { return ExtType; } 1621 1622 static bool classof(const LoadSDNode *) { return true; } 1623 static bool classof(const SDNode *N) { 1624 return N->getOpcode() == ISD::LOAD; 1625 } 1626}; 1627 1628/// StoreSDNode - This class is used to represent ISD::STORE nodes. 1629/// 1630class StoreSDNode : public LSBaseSDNode { 1631 virtual void ANCHOR(); // Out-of-line virtual method to give class a home. 1632 1633 // IsTruncStore - True if the op does a truncation before store. 1634 bool IsTruncStore; 1635protected: 1636 friend class SelectionDAG; 1637 StoreSDNode(SDOperand *ChainValuePtrOff, SDVTList VTs, 1638 ISD::MemIndexedMode AM, bool isTrunc, MVT::ValueType SVT, 1639 const Value *SV, int O=0, unsigned Align=0, bool Vol=false) 1640 : LSBaseSDNode(ISD::STORE, ChainValuePtrOff, 4, 1641 VTs, AM, SVT, SV, O, Align, Vol), 1642 IsTruncStore(isTrunc) { } 1643public: 1644 1645 bool isTruncatingStore() const { return IsTruncStore; } 1646 1647 static bool classof(const StoreSDNode *) { return true; } 1648 static bool classof(const SDNode *N) { 1649 return N->getOpcode() == ISD::STORE; 1650 } 1651}; 1652 1653 1654class SDNodeIterator : public forward_iterator<SDNode, ptrdiff_t> { 1655 SDNode *Node; 1656 unsigned Operand; 1657 1658 SDNodeIterator(SDNode *N, unsigned Op) : Node(N), Operand(Op) {} 1659public: 1660 bool operator==(const SDNodeIterator& x) const { 1661 return Operand == x.Operand; 1662 } 1663 bool operator!=(const SDNodeIterator& x) const { return !operator==(x); } 1664 1665 const SDNodeIterator &operator=(const SDNodeIterator &I) { 1666 assert(I.Node == Node && "Cannot assign iterators to two different nodes!"); 1667 Operand = I.Operand; 1668 return *this; 1669 } 1670 1671 pointer operator*() const { 1672 return Node->getOperand(Operand).Val; 1673 } 1674 pointer operator->() const { return operator*(); } 1675 1676 SDNodeIterator& operator++() { // Preincrement 1677 ++Operand; 1678 return *this; 1679 } 1680 SDNodeIterator operator++(int) { // Postincrement 1681 SDNodeIterator tmp = *this; ++*this; return tmp; 1682 } 1683 1684 static SDNodeIterator begin(SDNode *N) { return SDNodeIterator(N, 0); } 1685 static SDNodeIterator end (SDNode *N) { 1686 return SDNodeIterator(N, N->getNumOperands()); 1687 } 1688 1689 unsigned getOperand() const { return Operand; } 1690 const SDNode *getNode() const { return Node; } 1691}; 1692 1693template <> struct GraphTraits<SDNode*> { 1694 typedef SDNode NodeType; 1695 typedef SDNodeIterator ChildIteratorType; 1696 static inline NodeType *getEntryNode(SDNode *N) { return N; } 1697 static inline ChildIteratorType child_begin(NodeType *N) { 1698 return SDNodeIterator::begin(N); 1699 } 1700 static inline ChildIteratorType child_end(NodeType *N) { 1701 return SDNodeIterator::end(N); 1702 } 1703}; 1704 1705template<> 1706struct ilist_traits<SDNode> { 1707 static SDNode *getPrev(const SDNode *N) { return N->Prev; } 1708 static SDNode *getNext(const SDNode *N) { return N->Next; } 1709 1710 static void setPrev(SDNode *N, SDNode *Prev) { N->Prev = Prev; } 1711 static void setNext(SDNode *N, SDNode *Next) { N->Next = Next; } 1712 1713 static SDNode *createSentinel() { 1714 return new SDNode(ISD::EntryToken, SDNode::getSDVTList(MVT::Other)); 1715 } 1716 static void destroySentinel(SDNode *N) { delete N; } 1717 //static SDNode *createNode(const SDNode &V) { return new SDNode(V); } 1718 1719 1720 void addNodeToList(SDNode *NTy) {} 1721 void removeNodeFromList(SDNode *NTy) {} 1722 void transferNodesFromList(iplist<SDNode, ilist_traits> &L2, 1723 const ilist_iterator<SDNode> &X, 1724 const ilist_iterator<SDNode> &Y) {} 1725}; 1726 1727namespace ISD { 1728 /// isNormalLoad - Returns true if the specified node is a non-extending 1729 /// and unindexed load. 1730 inline bool isNormalLoad(const SDNode *N) { 1731 if (N->getOpcode() != ISD::LOAD) 1732 return false; 1733 const LoadSDNode *Ld = cast<LoadSDNode>(N); 1734 return Ld->getExtensionType() == ISD::NON_EXTLOAD && 1735 Ld->getAddressingMode() == ISD::UNINDEXED; 1736 } 1737 1738 /// isNON_EXTLoad - Returns true if the specified node is a non-extending 1739 /// load. 1740 inline bool isNON_EXTLoad(const SDNode *N) { 1741 return N->getOpcode() == ISD::LOAD && 1742 cast<LoadSDNode>(N)->getExtensionType() == ISD::NON_EXTLOAD; 1743 } 1744 1745 /// isEXTLoad - Returns true if the specified node is a EXTLOAD. 1746 /// 1747 inline bool isEXTLoad(const SDNode *N) { 1748 return N->getOpcode() == ISD::LOAD && 1749 cast<LoadSDNode>(N)->getExtensionType() == ISD::EXTLOAD; 1750 } 1751 1752 /// isSEXTLoad - Returns true if the specified node is a SEXTLOAD. 1753 /// 1754 inline bool isSEXTLoad(const SDNode *N) { 1755 return N->getOpcode() == ISD::LOAD && 1756 cast<LoadSDNode>(N)->getExtensionType() == ISD::SEXTLOAD; 1757 } 1758 1759 /// isZEXTLoad - Returns true if the specified node is a ZEXTLOAD. 1760 /// 1761 inline bool isZEXTLoad(const SDNode *N) { 1762 return N->getOpcode() == ISD::LOAD && 1763 cast<LoadSDNode>(N)->getExtensionType() == ISD::ZEXTLOAD; 1764 } 1765 1766 /// isUNINDEXEDLoad - Returns true if the specified node is a unindexed load. 1767 /// 1768 inline bool isUNINDEXEDLoad(const SDNode *N) { 1769 return N->getOpcode() == ISD::LOAD && 1770 cast<LoadSDNode>(N)->getAddressingMode() == ISD::UNINDEXED; 1771 } 1772 1773 /// isNON_TRUNCStore - Returns true if the specified node is a non-truncating 1774 /// store. 1775 inline bool isNON_TRUNCStore(const SDNode *N) { 1776 return N->getOpcode() == ISD::STORE && 1777 !cast<StoreSDNode>(N)->isTruncatingStore(); 1778 } 1779 1780 /// isTRUNCStore - Returns true if the specified node is a truncating 1781 /// store. 1782 inline bool isTRUNCStore(const SDNode *N) { 1783 return N->getOpcode() == ISD::STORE && 1784 cast<StoreSDNode>(N)->isTruncatingStore(); 1785 } 1786} 1787 1788 1789} // end llvm namespace 1790 1791#endif 1792