SelectionDAGNodes.h revision 8fc13cb4f7a2997f993ffdfe6e488046ec6c834e
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/Constants.h" 23#include "llvm/ADT/FoldingSet.h" 24#include "llvm/ADT/GraphTraits.h" 25#include "llvm/ADT/ilist_node.h" 26#include "llvm/ADT/SmallVector.h" 27#include "llvm/ADT/STLExtras.h" 28#include "llvm/CodeGen/ValueTypes.h" 29#include "llvm/CodeGen/MachineMemOperand.h" 30#include "llvm/Support/Allocator.h" 31#include "llvm/Support/MathExtras.h" 32#include "llvm/Support/RecyclingAllocator.h" 33#include "llvm/Support/DataTypes.h" 34#include "llvm/Support/DebugLoc.h" 35#include <cassert> 36#include <climits> 37 38namespace llvm { 39 40class SelectionDAG; 41class GlobalValue; 42class MachineBasicBlock; 43class MachineConstantPoolValue; 44class SDNode; 45class Value; 46template <typename T> struct DenseMapInfo; 47template <typename T> struct simplify_type; 48template <typename T> struct ilist_traits; 49 50/// SDVTList - This represents a list of ValueType's that has been intern'd by 51/// a SelectionDAG. Instances of this simple value class are returned by 52/// SelectionDAG::getVTList(...). 53/// 54struct SDVTList { 55 const EVT *VTs; 56 unsigned int NumVTs; 57}; 58 59/// ISD namespace - This namespace contains an enum which represents all of the 60/// SelectionDAG node types and value types. 61/// 62namespace ISD { 63 64 //===--------------------------------------------------------------------===// 65 /// ISD::NodeType enum - This enum defines the target-independent operators 66 /// for a SelectionDAG. 67 /// 68 /// Targets may also define target-dependent operator codes for SDNodes. For 69 /// example, on x86, these are the enum values in the X86ISD namespace. 70 /// Targets should aim to use target-independent operators to model their 71 /// instruction sets as much as possible, and only use target-dependent 72 /// operators when they have special requirements. 73 /// 74 /// Finally, during and after selection proper, SNodes may use special 75 /// operator codes that correspond directly with MachineInstr opcodes. These 76 /// are used to represent selected instructions. See the isMachineOpcode() 77 /// and getMachineOpcode() member functions of SDNode. 78 /// 79 enum NodeType { 80 // DELETED_NODE - This is an illegal value that is used to catch 81 // errors. This opcode is not a legal opcode for any node. 82 DELETED_NODE, 83 84 // EntryToken - This is the marker used to indicate the start of the region. 85 EntryToken, 86 87 // TokenFactor - This node takes multiple tokens as input and produces a 88 // single token result. This is used to represent the fact that the operand 89 // operators are independent of each other. 90 TokenFactor, 91 92 // AssertSext, AssertZext - These nodes record if a register contains a 93 // value that has already been zero or sign extended from a narrower type. 94 // These nodes take two operands. The first is the node that has already 95 // been extended, and the second is a value type node indicating the width 96 // of the extension 97 AssertSext, AssertZext, 98 99 // Various leaf nodes. 100 BasicBlock, VALUETYPE, CONDCODE, Register, 101 Constant, ConstantFP, 102 GlobalAddress, GlobalTLSAddress, FrameIndex, 103 JumpTable, ConstantPool, ExternalSymbol, 104 105 // The address of the GOT 106 GLOBAL_OFFSET_TABLE, 107 108 // FRAMEADDR, RETURNADDR - These nodes represent llvm.frameaddress and 109 // llvm.returnaddress on the DAG. These nodes take one operand, the index 110 // of the frame or return address to return. An index of zero corresponds 111 // to the current function's frame or return address, an index of one to the 112 // parent's frame or return address, and so on. 113 FRAMEADDR, RETURNADDR, 114 115 // FRAME_TO_ARGS_OFFSET - This node represents offset from frame pointer to 116 // first (possible) on-stack argument. This is needed for correct stack 117 // adjustment during unwind. 118 FRAME_TO_ARGS_OFFSET, 119 120 // RESULT, OUTCHAIN = EXCEPTIONADDR(INCHAIN) - This node represents the 121 // address of the exception block on entry to an landing pad block. 122 EXCEPTIONADDR, 123 124 // RESULT, OUTCHAIN = LSDAADDR(INCHAIN) - This node represents the 125 // address of the Language Specific Data Area for the enclosing function. 126 LSDAADDR, 127 128 // RESULT, OUTCHAIN = EHSELECTION(INCHAIN, EXCEPTION) - This node represents 129 // the selection index of the exception thrown. 130 EHSELECTION, 131 132 // OUTCHAIN = EH_RETURN(INCHAIN, OFFSET, HANDLER) - This node represents 133 // 'eh_return' gcc dwarf builtin, which is used to return from 134 // exception. The general meaning is: adjust stack by OFFSET and pass 135 // execution to HANDLER. Many platform-related details also :) 136 EH_RETURN, 137 138 // TargetConstant* - Like Constant*, but the DAG does not do any folding or 139 // simplification of the constant. 140 TargetConstant, 141 TargetConstantFP, 142 143 // TargetGlobalAddress - Like GlobalAddress, but the DAG does no folding or 144 // anything else with this node, and this is valid in the target-specific 145 // dag, turning into a GlobalAddress operand. 146 TargetGlobalAddress, 147 TargetGlobalTLSAddress, 148 TargetFrameIndex, 149 TargetJumpTable, 150 TargetConstantPool, 151 TargetExternalSymbol, 152 153 /// RESULT = INTRINSIC_WO_CHAIN(INTRINSICID, arg1, arg2, ...) 154 /// This node represents a target intrinsic function with no side effects. 155 /// The first operand is the ID number of the intrinsic from the 156 /// llvm::Intrinsic namespace. The operands to the intrinsic follow. The 157 /// node has returns the result of the intrinsic. 158 INTRINSIC_WO_CHAIN, 159 160 /// RESULT,OUTCHAIN = INTRINSIC_W_CHAIN(INCHAIN, INTRINSICID, arg1, ...) 161 /// This node represents a target intrinsic function with side effects that 162 /// returns a result. The first operand is a chain pointer. The second is 163 /// the ID number of the intrinsic from the llvm::Intrinsic namespace. The 164 /// operands to the intrinsic follow. The node has two results, the result 165 /// of the intrinsic and an output chain. 166 INTRINSIC_W_CHAIN, 167 168 /// OUTCHAIN = INTRINSIC_VOID(INCHAIN, INTRINSICID, arg1, arg2, ...) 169 /// This node represents a target intrinsic function with side effects that 170 /// does not return a result. The first operand is a chain pointer. The 171 /// second is the ID number of the intrinsic from the llvm::Intrinsic 172 /// namespace. The operands to the intrinsic follow. 173 INTRINSIC_VOID, 174 175 // CopyToReg - This node has three operands: a chain, a register number to 176 // set to this value, and a value. 177 CopyToReg, 178 179 // CopyFromReg - This node indicates that the input value is a virtual or 180 // physical register that is defined outside of the scope of this 181 // SelectionDAG. The register is available from the RegisterSDNode object. 182 CopyFromReg, 183 184 // UNDEF - An undefined node 185 UNDEF, 186 187 // EXTRACT_ELEMENT - This is used to get the lower or upper (determined by 188 // a Constant, which is required to be operand #1) half of the integer or 189 // float value specified as operand #0. This is only for use before 190 // legalization, for values that will be broken into multiple registers. 191 EXTRACT_ELEMENT, 192 193 // BUILD_PAIR - This is the opposite of EXTRACT_ELEMENT in some ways. Given 194 // two values of the same integer value type, this produces a value twice as 195 // big. Like EXTRACT_ELEMENT, this can only be used before legalization. 196 BUILD_PAIR, 197 198 // MERGE_VALUES - This node takes multiple discrete operands and returns 199 // them all as its individual results. This nodes has exactly the same 200 // number of inputs and outputs. This node is useful for some pieces of the 201 // code generator that want to think about a single node with multiple 202 // results, not multiple nodes. 203 MERGE_VALUES, 204 205 // Simple integer binary arithmetic operators. 206 ADD, SUB, MUL, SDIV, UDIV, SREM, UREM, 207 208 // SMUL_LOHI/UMUL_LOHI - Multiply two integers of type iN, producing 209 // a signed/unsigned value of type i[2*N], and return the full value as 210 // two results, each of type iN. 211 SMUL_LOHI, UMUL_LOHI, 212 213 // SDIVREM/UDIVREM - Divide two integers and produce both a quotient and 214 // remainder result. 215 SDIVREM, UDIVREM, 216 217 // CARRY_FALSE - This node is used when folding other nodes, 218 // like ADDC/SUBC, which indicate the carry result is always false. 219 CARRY_FALSE, 220 221 // Carry-setting nodes for multiple precision addition and subtraction. 222 // These nodes take two operands of the same value type, and produce two 223 // results. The first result is the normal add or sub result, the second 224 // result is the carry flag result. 225 ADDC, SUBC, 226 227 // Carry-using nodes for multiple precision addition and subtraction. These 228 // nodes take three operands: The first two are the normal lhs and rhs to 229 // the add or sub, and the third is the input carry flag. These nodes 230 // produce two results; the normal result of the add or sub, and the output 231 // carry flag. These nodes both read and write a carry flag to allow them 232 // to them to be chained together for add and sub of arbitrarily large 233 // values. 234 ADDE, SUBE, 235 236 // RESULT, BOOL = [SU]ADDO(LHS, RHS) - Overflow-aware nodes for addition. 237 // These nodes take two operands: the normal LHS and RHS to the add. They 238 // produce two results: the normal result of the add, and a boolean that 239 // indicates if an overflow occured (*not* a flag, because it may be stored 240 // to memory, etc.). If the type of the boolean is not i1 then the high 241 // bits conform to getBooleanContents. 242 // These nodes are generated from the llvm.[su]add.with.overflow intrinsics. 243 SADDO, UADDO, 244 245 // Same for subtraction 246 SSUBO, USUBO, 247 248 // Same for multiplication 249 SMULO, UMULO, 250 251 // Simple binary floating point operators. 252 FADD, FSUB, FMUL, FDIV, FREM, 253 254 // FCOPYSIGN(X, Y) - Return the value of X with the sign of Y. NOTE: This 255 // DAG node does not require that X and Y have the same type, just that they 256 // are both floating point. X and the result must have the same type. 257 // FCOPYSIGN(f32, f64) is allowed. 258 FCOPYSIGN, 259 260 // INT = FGETSIGN(FP) - Return the sign bit of the specified floating point 261 // value as an integer 0/1 value. 262 FGETSIGN, 263 264 /// BUILD_VECTOR(ELT0, ELT1, ELT2, ELT3,...) - Return a vector with the 265 /// specified, possibly variable, elements. The number of elements is 266 /// required to be a power of two. The types of the operands must all be 267 /// the same and must match the vector element type, except that integer 268 /// types are allowed to be larger than the element type, in which case 269 /// the operands are implicitly truncated. 270 BUILD_VECTOR, 271 272 /// INSERT_VECTOR_ELT(VECTOR, VAL, IDX) - Returns VECTOR with the element 273 /// at IDX replaced with VAL. If the type of VAL is larger than the vector 274 /// element type then VAL is truncated before replacement. 275 INSERT_VECTOR_ELT, 276 277 /// EXTRACT_VECTOR_ELT(VECTOR, IDX) - Returns a single element from VECTOR 278 /// identified by the (potentially variable) element number IDX. If the 279 /// return type is an integer type larger than the element type of the 280 /// vector, the result is extended to the width of the return type. 281 EXTRACT_VECTOR_ELT, 282 283 /// CONCAT_VECTORS(VECTOR0, VECTOR1, ...) - Given a number of values of 284 /// vector type with the same length and element type, this produces a 285 /// concatenated vector result value, with length equal to the sum of the 286 /// lengths of the input vectors. 287 CONCAT_VECTORS, 288 289 /// EXTRACT_SUBVECTOR(VECTOR, IDX) - Returns a subvector from VECTOR (an 290 /// vector value) starting with the (potentially variable) element number 291 /// IDX, which must be a multiple of the result vector length. 292 EXTRACT_SUBVECTOR, 293 294 /// VECTOR_SHUFFLE(VEC1, VEC2) - Returns a vector, of the same type as 295 /// VEC1/VEC2. A VECTOR_SHUFFLE node also contains an array of constant int 296 /// values that indicate which value (or undef) each result element will 297 /// get. These constant ints are accessible through the 298 /// ShuffleVectorSDNode class. This is quite similar to the Altivec 299 /// 'vperm' instruction, except that the indices must be constants and are 300 /// in terms of the element size of VEC1/VEC2, not in terms of bytes. 301 VECTOR_SHUFFLE, 302 303 /// SCALAR_TO_VECTOR(VAL) - This represents the operation of loading a 304 /// scalar value into element 0 of the resultant vector type. The top 305 /// elements 1 to N-1 of the N-element vector are undefined. The type 306 /// of the operand must match the vector element type, except when they 307 /// are integer types. In this case the operand is allowed to be wider 308 /// than the vector element type, and is implicitly truncated to it. 309 SCALAR_TO_VECTOR, 310 311 // MULHU/MULHS - Multiply high - Multiply two integers of type iN, producing 312 // an unsigned/signed value of type i[2*N], then return the top part. 313 MULHU, MULHS, 314 315 // Bitwise operators - logical and, logical or, logical xor, shift left, 316 // shift right algebraic (shift in sign bits), shift right logical (shift in 317 // zeroes), rotate left, rotate right, and byteswap. 318 AND, OR, XOR, SHL, SRA, SRL, ROTL, ROTR, BSWAP, 319 320 // Counting operators 321 CTTZ, CTLZ, CTPOP, 322 323 // Select(COND, TRUEVAL, FALSEVAL). If the type of the boolean COND is not 324 // i1 then the high bits must conform to getBooleanContents. 325 SELECT, 326 327 // Select with condition operator - This selects between a true value and 328 // a false value (ops #2 and #3) based on the boolean result of comparing 329 // the lhs and rhs (ops #0 and #1) of a conditional expression with the 330 // condition code in op #4, a CondCodeSDNode. 331 SELECT_CC, 332 333 // SetCC operator - This evaluates to a true value iff the condition is 334 // true. If the result value type is not i1 then the high bits conform 335 // to getBooleanContents. The operands to this are the left and right 336 // operands to compare (ops #0, and #1) and the condition code to compare 337 // them with (op #2) as a CondCodeSDNode. 338 SETCC, 339 340 // RESULT = VSETCC(LHS, RHS, COND) operator - This evaluates to a vector of 341 // integer elements with all bits of the result elements set to true if the 342 // comparison is true or all cleared if the comparison is false. The 343 // operands to this are the left and right operands to compare (LHS/RHS) and 344 // the condition code to compare them with (COND) as a CondCodeSDNode. 345 VSETCC, 346 347 // SHL_PARTS/SRA_PARTS/SRL_PARTS - These operators are used for expanded 348 // integer shift operations, just like ADD/SUB_PARTS. The operation 349 // ordering is: 350 // [Lo,Hi] = op [LoLHS,HiLHS], Amt 351 SHL_PARTS, SRA_PARTS, SRL_PARTS, 352 353 // Conversion operators. These are all single input single output 354 // operations. For all of these, the result type must be strictly 355 // wider or narrower (depending on the operation) than the source 356 // type. 357 358 // SIGN_EXTEND - Used for integer types, replicating the sign bit 359 // into new bits. 360 SIGN_EXTEND, 361 362 // ZERO_EXTEND - Used for integer types, zeroing the new bits. 363 ZERO_EXTEND, 364 365 // ANY_EXTEND - Used for integer types. The high bits are undefined. 366 ANY_EXTEND, 367 368 // TRUNCATE - Completely drop the high bits. 369 TRUNCATE, 370 371 // [SU]INT_TO_FP - These operators convert integers (whose interpreted sign 372 // depends on the first letter) to floating point. 373 SINT_TO_FP, 374 UINT_TO_FP, 375 376 // SIGN_EXTEND_INREG - This operator atomically performs a SHL/SRA pair to 377 // sign extend a small value in a large integer register (e.g. sign 378 // extending the low 8 bits of a 32-bit register to fill the top 24 bits 379 // with the 7th bit). The size of the smaller type is indicated by the 1th 380 // operand, a ValueType node. 381 SIGN_EXTEND_INREG, 382 383 /// FP_TO_[US]INT - Convert a floating point value to a signed or unsigned 384 /// integer. 385 FP_TO_SINT, 386 FP_TO_UINT, 387 388 /// X = FP_ROUND(Y, TRUNC) - Rounding 'Y' from a larger floating point type 389 /// down to the precision of the destination VT. TRUNC is a flag, which is 390 /// always an integer that is zero or one. If TRUNC is 0, this is a 391 /// normal rounding, if it is 1, this FP_ROUND is known to not change the 392 /// value of Y. 393 /// 394 /// The TRUNC = 1 case is used in cases where we know that the value will 395 /// not be modified by the node, because Y is not using any of the extra 396 /// precision of source type. This allows certain transformations like 397 /// FP_EXTEND(FP_ROUND(X,1)) -> X which are not safe for 398 /// FP_EXTEND(FP_ROUND(X,0)) because the extra bits aren't removed. 399 FP_ROUND, 400 401 // FLT_ROUNDS_ - Returns current rounding mode: 402 // -1 Undefined 403 // 0 Round to 0 404 // 1 Round to nearest 405 // 2 Round to +inf 406 // 3 Round to -inf 407 FLT_ROUNDS_, 408 409 /// X = FP_ROUND_INREG(Y, VT) - This operator takes an FP register, and 410 /// rounds it to a floating point value. It then promotes it and returns it 411 /// in a register of the same size. This operation effectively just 412 /// discards excess precision. The type to round down to is specified by 413 /// the VT operand, a VTSDNode. 414 FP_ROUND_INREG, 415 416 /// X = FP_EXTEND(Y) - Extend a smaller FP type into a larger FP type. 417 FP_EXTEND, 418 419 // BIT_CONVERT - Theis operator converts between integer and FP values, as 420 // if one was stored to memory as integer and the other was loaded from the 421 // same address (or equivalently for vector format conversions, etc). The 422 // source and result are required to have the same bit size (e.g. 423 // f32 <-> i32). This can also be used for int-to-int or fp-to-fp 424 // conversions, but that is a noop, deleted by getNode(). 425 BIT_CONVERT, 426 427 // CONVERT_RNDSAT - This operator is used to support various conversions 428 // between various types (float, signed, unsigned and vectors of those 429 // types) with rounding and saturation. NOTE: Avoid using this operator as 430 // most target don't support it and the operator might be removed in the 431 // future. It takes the following arguments: 432 // 0) value 433 // 1) dest type (type to convert to) 434 // 2) src type (type to convert from) 435 // 3) rounding imm 436 // 4) saturation imm 437 // 5) ISD::CvtCode indicating the type of conversion to do 438 CONVERT_RNDSAT, 439 440 // FNEG, FABS, FSQRT, FSIN, FCOS, FPOWI, FPOW, 441 // FLOG, FLOG2, FLOG10, FEXP, FEXP2, 442 // FCEIL, FTRUNC, FRINT, FNEARBYINT, FFLOOR - Perform various unary floating 443 // point operations. These are inspired by libm. 444 FNEG, FABS, FSQRT, FSIN, FCOS, FPOWI, FPOW, 445 FLOG, FLOG2, FLOG10, FEXP, FEXP2, 446 FCEIL, FTRUNC, FRINT, FNEARBYINT, FFLOOR, 447 448 // LOAD and STORE have token chains as their first operand, then the same 449 // operands as an LLVM load/store instruction, then an offset node that 450 // is added / subtracted from the base pointer to form the address (for 451 // indexed memory ops). 452 LOAD, STORE, 453 454 // DYNAMIC_STACKALLOC - Allocate some number of bytes on the stack aligned 455 // to a specified boundary. This node always has two return values: a new 456 // stack pointer value and a chain. The first operand is the token chain, 457 // the second is the number of bytes to allocate, and the third is the 458 // alignment boundary. The size is guaranteed to be a multiple of the stack 459 // alignment, and the alignment is guaranteed to be bigger than the stack 460 // alignment (if required) or 0 to get standard stack alignment. 461 DYNAMIC_STACKALLOC, 462 463 // Control flow instructions. These all have token chains. 464 465 // BR - Unconditional branch. The first operand is the chain 466 // operand, the second is the MBB to branch to. 467 BR, 468 469 // BRIND - Indirect branch. The first operand is the chain, the second 470 // is the value to branch to, which must be of the same type as the target's 471 // pointer type. 472 BRIND, 473 474 // BR_JT - Jumptable branch. The first operand is the chain, the second 475 // is the jumptable index, the last one is the jumptable entry index. 476 BR_JT, 477 478 // BRCOND - Conditional branch. The first operand is the chain, the 479 // second is the condition, the third is the block to branch to if the 480 // condition is true. If the type of the condition is not i1, then the 481 // high bits must conform to getBooleanContents. 482 BRCOND, 483 484 // BR_CC - Conditional branch. The behavior is like that of SELECT_CC, in 485 // that the condition is represented as condition code, and two nodes to 486 // compare, rather than as a combined SetCC node. The operands in order are 487 // chain, cc, lhs, rhs, block to branch to if condition is true. 488 BR_CC, 489 490 // INLINEASM - Represents an inline asm block. This node always has two 491 // return values: a chain and a flag result. The inputs are as follows: 492 // Operand #0 : Input chain. 493 // Operand #1 : a ExternalSymbolSDNode with a pointer to the asm string. 494 // Operand #2n+2: A RegisterNode. 495 // Operand #2n+3: A TargetConstant, indicating if the reg is a use/def 496 // Operand #last: Optional, an incoming flag. 497 INLINEASM, 498 499 // DBG_LABEL, EH_LABEL - Represents a label in mid basic block used to track 500 // locations needed for debug and exception handling tables. These nodes 501 // take a chain as input and return a chain. 502 DBG_LABEL, 503 EH_LABEL, 504 505 // STACKSAVE - STACKSAVE has one operand, an input chain. It produces a 506 // value, the same type as the pointer type for the system, and an output 507 // chain. 508 STACKSAVE, 509 510 // STACKRESTORE has two operands, an input chain and a pointer to restore to 511 // it returns an output chain. 512 STACKRESTORE, 513 514 // CALLSEQ_START/CALLSEQ_END - These operators mark the beginning and end of 515 // a call sequence, and carry arbitrary information that target might want 516 // to know. The first operand is a chain, the rest are specified by the 517 // target and not touched by the DAG optimizers. 518 // CALLSEQ_START..CALLSEQ_END pairs may not be nested. 519 CALLSEQ_START, // Beginning of a call sequence 520 CALLSEQ_END, // End of a call sequence 521 522 // VAARG - VAARG has three operands: an input chain, a pointer, and a 523 // SRCVALUE. It returns a pair of values: the vaarg value and a new chain. 524 VAARG, 525 526 // VACOPY - VACOPY has five operands: an input chain, a destination pointer, 527 // a source pointer, a SRCVALUE for the destination, and a SRCVALUE for the 528 // source. 529 VACOPY, 530 531 // VAEND, VASTART - VAEND and VASTART have three operands: an input chain, a 532 // pointer, and a SRCVALUE. 533 VAEND, VASTART, 534 535 // SRCVALUE - This is a node type that holds a Value* that is used to 536 // make reference to a value in the LLVM IR. 537 SRCVALUE, 538 539 // MEMOPERAND - This is a node that contains a MachineMemOperand which 540 // records information about a memory reference. This is used to make 541 // AliasAnalysis queries from the backend. 542 MEMOPERAND, 543 544 // PCMARKER - This corresponds to the pcmarker intrinsic. 545 PCMARKER, 546 547 // READCYCLECOUNTER - This corresponds to the readcyclecounter intrinsic. 548 // The only operand is a chain and a value and a chain are produced. The 549 // value is the contents of the architecture specific cycle counter like 550 // register (or other high accuracy low latency clock source) 551 READCYCLECOUNTER, 552 553 // HANDLENODE node - Used as a handle for various purposes. 554 HANDLENODE, 555 556 // DBG_STOPPOINT - This node is used to represent a source location for 557 // debug info. It takes token chain as input, and carries a line number, 558 // column number, and a pointer to a CompileUnit object identifying 559 // the containing compilation unit. It produces a token chain as output. 560 DBG_STOPPOINT, 561 562 // DEBUG_LOC - This node is used to represent source line information 563 // embedded in the code. It takes a token chain as input, then a line 564 // number, then a column then a file id (provided by MachineModuleInfo.) It 565 // produces a token chain as output. 566 DEBUG_LOC, 567 568 // TRAMPOLINE - This corresponds to the init_trampoline intrinsic. 569 // It takes as input a token chain, the pointer to the trampoline, 570 // the pointer to the nested function, the pointer to pass for the 571 // 'nest' parameter, a SRCVALUE for the trampoline and another for 572 // the nested function (allowing targets to access the original 573 // Function*). It produces the result of the intrinsic and a token 574 // chain as output. 575 TRAMPOLINE, 576 577 // TRAP - Trapping instruction 578 TRAP, 579 580 // PREFETCH - This corresponds to a prefetch intrinsic. It takes chains are 581 // their first operand. The other operands are the address to prefetch, 582 // read / write specifier, and locality specifier. 583 PREFETCH, 584 585 // OUTCHAIN = MEMBARRIER(INCHAIN, load-load, load-store, store-load, 586 // store-store, device) 587 // This corresponds to the memory.barrier intrinsic. 588 // it takes an input chain, 4 operands to specify the type of barrier, an 589 // operand specifying if the barrier applies to device and uncached memory 590 // and produces an output chain. 591 MEMBARRIER, 592 593 // Val, OUTCHAIN = ATOMIC_CMP_SWAP(INCHAIN, ptr, cmp, swap) 594 // this corresponds to the atomic.lcs intrinsic. 595 // cmp is compared to *ptr, and if equal, swap is stored in *ptr. 596 // the return is always the original value in *ptr 597 ATOMIC_CMP_SWAP, 598 599 // Val, OUTCHAIN = ATOMIC_SWAP(INCHAIN, ptr, amt) 600 // this corresponds to the atomic.swap intrinsic. 601 // amt is stored to *ptr atomically. 602 // the return is always the original value in *ptr 603 ATOMIC_SWAP, 604 605 // Val, OUTCHAIN = ATOMIC_LOAD_[OpName](INCHAIN, ptr, amt) 606 // this corresponds to the atomic.load.[OpName] intrinsic. 607 // op(*ptr, amt) is stored to *ptr atomically. 608 // the return is always the original value in *ptr 609 ATOMIC_LOAD_ADD, 610 ATOMIC_LOAD_SUB, 611 ATOMIC_LOAD_AND, 612 ATOMIC_LOAD_OR, 613 ATOMIC_LOAD_XOR, 614 ATOMIC_LOAD_NAND, 615 ATOMIC_LOAD_MIN, 616 ATOMIC_LOAD_MAX, 617 ATOMIC_LOAD_UMIN, 618 ATOMIC_LOAD_UMAX, 619 620 // BUILTIN_OP_END - This must be the last enum value in this list. 621 BUILTIN_OP_END 622 }; 623 624 /// Node predicates 625 626 /// isBuildVectorAllOnes - Return true if the specified node is a 627 /// BUILD_VECTOR where all of the elements are ~0 or undef. 628 bool isBuildVectorAllOnes(const SDNode *N); 629 630 /// isBuildVectorAllZeros - Return true if the specified node is a 631 /// BUILD_VECTOR where all of the elements are 0 or undef. 632 bool isBuildVectorAllZeros(const SDNode *N); 633 634 /// isScalarToVector - Return true if the specified node is a 635 /// ISD::SCALAR_TO_VECTOR node or a BUILD_VECTOR node where only the low 636 /// element is not an undef. 637 bool isScalarToVector(const SDNode *N); 638 639 /// isDebugLabel - Return true if the specified node represents a debug 640 /// label (i.e. ISD::DBG_LABEL or TargetInstrInfo::DBG_LABEL node). 641 bool isDebugLabel(const SDNode *N); 642 643 //===--------------------------------------------------------------------===// 644 /// MemIndexedMode enum - This enum defines the load / store indexed 645 /// addressing modes. 646 /// 647 /// UNINDEXED "Normal" load / store. The effective address is already 648 /// computed and is available in the base pointer. The offset 649 /// operand is always undefined. In addition to producing a 650 /// chain, an unindexed load produces one value (result of the 651 /// load); an unindexed store does not produce a value. 652 /// 653 /// PRE_INC Similar to the unindexed mode where the effective address is 654 /// PRE_DEC the value of the base pointer add / subtract the offset. 655 /// It considers the computation as being folded into the load / 656 /// store operation (i.e. the load / store does the address 657 /// computation as well as performing the memory transaction). 658 /// The base operand is always undefined. In addition to 659 /// producing a chain, pre-indexed load produces two values 660 /// (result of the load and the result of the address 661 /// computation); a pre-indexed store produces one value (result 662 /// of the address computation). 663 /// 664 /// POST_INC The effective address is the value of the base pointer. The 665 /// POST_DEC value of the offset operand is then added to / subtracted 666 /// from the base after memory transaction. In addition to 667 /// producing a chain, post-indexed load produces two values 668 /// (the result of the load and the result of the base +/- offset 669 /// computation); a post-indexed store produces one value (the 670 /// the result of the base +/- offset computation). 671 /// 672 enum MemIndexedMode { 673 UNINDEXED = 0, 674 PRE_INC, 675 PRE_DEC, 676 POST_INC, 677 POST_DEC, 678 LAST_INDEXED_MODE 679 }; 680 681 //===--------------------------------------------------------------------===// 682 /// LoadExtType enum - This enum defines the three variants of LOADEXT 683 /// (load with extension). 684 /// 685 /// SEXTLOAD loads the integer operand and sign extends it to a larger 686 /// integer result type. 687 /// ZEXTLOAD loads the integer operand and zero extends it to a larger 688 /// integer result type. 689 /// EXTLOAD is used for three things: floating point extending loads, 690 /// integer extending loads [the top bits are undefined], and vector 691 /// extending loads [load into low elt]. 692 /// 693 enum LoadExtType { 694 NON_EXTLOAD = 0, 695 EXTLOAD, 696 SEXTLOAD, 697 ZEXTLOAD, 698 LAST_LOADEXT_TYPE 699 }; 700 701 //===--------------------------------------------------------------------===// 702 /// ISD::CondCode enum - These are ordered carefully to make the bitfields 703 /// below work out, when considering SETFALSE (something that never exists 704 /// dynamically) as 0. "U" -> Unsigned (for integer operands) or Unordered 705 /// (for floating point), "L" -> Less than, "G" -> Greater than, "E" -> Equal 706 /// to. If the "N" column is 1, the result of the comparison is undefined if 707 /// the input is a NAN. 708 /// 709 /// All of these (except for the 'always folded ops') should be handled for 710 /// floating point. For integer, only the SETEQ,SETNE,SETLT,SETLE,SETGT, 711 /// SETGE,SETULT,SETULE,SETUGT, and SETUGE opcodes are used. 712 /// 713 /// Note that these are laid out in a specific order to allow bit-twiddling 714 /// to transform conditions. 715 enum CondCode { 716 // Opcode N U L G E Intuitive operation 717 SETFALSE, // 0 0 0 0 Always false (always folded) 718 SETOEQ, // 0 0 0 1 True if ordered and equal 719 SETOGT, // 0 0 1 0 True if ordered and greater than 720 SETOGE, // 0 0 1 1 True if ordered and greater than or equal 721 SETOLT, // 0 1 0 0 True if ordered and less than 722 SETOLE, // 0 1 0 1 True if ordered and less than or equal 723 SETONE, // 0 1 1 0 True if ordered and operands are unequal 724 SETO, // 0 1 1 1 True if ordered (no nans) 725 SETUO, // 1 0 0 0 True if unordered: isnan(X) | isnan(Y) 726 SETUEQ, // 1 0 0 1 True if unordered or equal 727 SETUGT, // 1 0 1 0 True if unordered or greater than 728 SETUGE, // 1 0 1 1 True if unordered, greater than, or equal 729 SETULT, // 1 1 0 0 True if unordered or less than 730 SETULE, // 1 1 0 1 True if unordered, less than, or equal 731 SETUNE, // 1 1 1 0 True if unordered or not equal 732 SETTRUE, // 1 1 1 1 Always true (always folded) 733 // Don't care operations: undefined if the input is a nan. 734 SETFALSE2, // 1 X 0 0 0 Always false (always folded) 735 SETEQ, // 1 X 0 0 1 True if equal 736 SETGT, // 1 X 0 1 0 True if greater than 737 SETGE, // 1 X 0 1 1 True if greater than or equal 738 SETLT, // 1 X 1 0 0 True if less than 739 SETLE, // 1 X 1 0 1 True if less than or equal 740 SETNE, // 1 X 1 1 0 True if not equal 741 SETTRUE2, // 1 X 1 1 1 Always true (always folded) 742 743 SETCC_INVALID // Marker value. 744 }; 745 746 /// isSignedIntSetCC - Return true if this is a setcc instruction that 747 /// performs a signed comparison when used with integer operands. 748 inline bool isSignedIntSetCC(CondCode Code) { 749 return Code == SETGT || Code == SETGE || Code == SETLT || Code == SETLE; 750 } 751 752 /// isUnsignedIntSetCC - Return true if this is a setcc instruction that 753 /// performs an unsigned comparison when used with integer operands. 754 inline bool isUnsignedIntSetCC(CondCode Code) { 755 return Code == SETUGT || Code == SETUGE || Code == SETULT || Code == SETULE; 756 } 757 758 /// isTrueWhenEqual - Return true if the specified condition returns true if 759 /// the two operands to the condition are equal. Note that if one of the two 760 /// operands is a NaN, this value is meaningless. 761 inline bool isTrueWhenEqual(CondCode Cond) { 762 return ((int)Cond & 1) != 0; 763 } 764 765 /// getUnorderedFlavor - This function returns 0 if the condition is always 766 /// false if an operand is a NaN, 1 if the condition is always true if the 767 /// operand is a NaN, and 2 if the condition is undefined if the operand is a 768 /// NaN. 769 inline unsigned getUnorderedFlavor(CondCode Cond) { 770 return ((int)Cond >> 3) & 3; 771 } 772 773 /// getSetCCInverse - Return the operation corresponding to !(X op Y), where 774 /// 'op' is a valid SetCC operation. 775 CondCode getSetCCInverse(CondCode Operation, bool isInteger); 776 777 /// getSetCCSwappedOperands - Return the operation corresponding to (Y op X) 778 /// when given the operation for (X op Y). 779 CondCode getSetCCSwappedOperands(CondCode Operation); 780 781 /// getSetCCOrOperation - Return the result of a logical OR between different 782 /// comparisons of identical values: ((X op1 Y) | (X op2 Y)). This 783 /// function returns SETCC_INVALID if it is not possible to represent the 784 /// resultant comparison. 785 CondCode getSetCCOrOperation(CondCode Op1, CondCode Op2, bool isInteger); 786 787 /// getSetCCAndOperation - Return the result of a logical AND between 788 /// different comparisons of identical values: ((X op1 Y) & (X op2 Y)). This 789 /// function returns SETCC_INVALID if it is not possible to represent the 790 /// resultant comparison. 791 CondCode getSetCCAndOperation(CondCode Op1, CondCode Op2, bool isInteger); 792 793 //===--------------------------------------------------------------------===// 794 /// CvtCode enum - This enum defines the various converts CONVERT_RNDSAT 795 /// supports. 796 enum CvtCode { 797 CVT_FF, // Float from Float 798 CVT_FS, // Float from Signed 799 CVT_FU, // Float from Unsigned 800 CVT_SF, // Signed from Float 801 CVT_UF, // Unsigned from Float 802 CVT_SS, // Signed from Signed 803 CVT_SU, // Signed from Unsigned 804 CVT_US, // Unsigned from Signed 805 CVT_UU, // Unsigned from Unsigned 806 CVT_INVALID // Marker - Invalid opcode 807 }; 808} // end llvm::ISD namespace 809 810 811//===----------------------------------------------------------------------===// 812/// SDValue - Unlike LLVM values, Selection DAG nodes may return multiple 813/// values as the result of a computation. Many nodes return multiple values, 814/// from loads (which define a token and a return value) to ADDC (which returns 815/// a result and a carry value), to calls (which may return an arbitrary number 816/// of values). 817/// 818/// As such, each use of a SelectionDAG computation must indicate the node that 819/// computes it as well as which return value to use from that node. This pair 820/// of information is represented with the SDValue value type. 821/// 822class SDValue { 823 SDNode *Node; // The node defining the value we are using. 824 unsigned ResNo; // Which return value of the node we are using. 825public: 826 SDValue() : Node(0), ResNo(0) {} 827 SDValue(SDNode *node, unsigned resno) : Node(node), ResNo(resno) {} 828 829 /// get the index which selects a specific result in the SDNode 830 unsigned getResNo() const { return ResNo; } 831 832 /// get the SDNode which holds the desired result 833 SDNode *getNode() const { return Node; } 834 835 /// set the SDNode 836 void setNode(SDNode *N) { Node = N; } 837 838 bool operator==(const SDValue &O) const { 839 return Node == O.Node && ResNo == O.ResNo; 840 } 841 bool operator!=(const SDValue &O) const { 842 return !operator==(O); 843 } 844 bool operator<(const SDValue &O) const { 845 return Node < O.Node || (Node == O.Node && ResNo < O.ResNo); 846 } 847 848 SDValue getValue(unsigned R) const { 849 return SDValue(Node, R); 850 } 851 852 // isOperandOf - Return true if this node is an operand of N. 853 bool isOperandOf(SDNode *N) const; 854 855 /// getValueType - Return the ValueType of the referenced return value. 856 /// 857 inline EVT getValueType() const; 858 859 /// getValueSizeInBits - Returns the size of the value in bits. 860 /// 861 unsigned getValueSizeInBits() const { 862 return getValueType().getSizeInBits(); 863 } 864 865 // Forwarding methods - These forward to the corresponding methods in SDNode. 866 inline unsigned getOpcode() const; 867 inline unsigned getNumOperands() const; 868 inline const SDValue &getOperand(unsigned i) const; 869 inline uint64_t getConstantOperandVal(unsigned i) const; 870 inline bool isTargetOpcode() const; 871 inline bool isMachineOpcode() const; 872 inline unsigned getMachineOpcode() const; 873 inline const DebugLoc getDebugLoc() const; 874 875 876 /// reachesChainWithoutSideEffects - Return true if this operand (which must 877 /// be a chain) reaches the specified operand without crossing any 878 /// side-effecting instructions. In practice, this looks through token 879 /// factors and non-volatile loads. In order to remain efficient, this only 880 /// looks a couple of nodes in, it does not do an exhaustive search. 881 bool reachesChainWithoutSideEffects(SDValue Dest, 882 unsigned Depth = 2) const; 883 884 /// use_empty - Return true if there are no nodes using value ResNo 885 /// of Node. 886 /// 887 inline bool use_empty() const; 888 889 /// hasOneUse - Return true if there is exactly one node using value 890 /// ResNo of Node. 891 /// 892 inline bool hasOneUse() const; 893}; 894 895 896template<> struct DenseMapInfo<SDValue> { 897 static inline SDValue getEmptyKey() { 898 return SDValue((SDNode*)-1, -1U); 899 } 900 static inline SDValue getTombstoneKey() { 901 return SDValue((SDNode*)-1, 0); 902 } 903 static unsigned getHashValue(const SDValue &Val) { 904 return ((unsigned)((uintptr_t)Val.getNode() >> 4) ^ 905 (unsigned)((uintptr_t)Val.getNode() >> 9)) + Val.getResNo(); 906 } 907 static bool isEqual(const SDValue &LHS, const SDValue &RHS) { 908 return LHS == RHS; 909 } 910 static bool isPod() { return true; } 911}; 912 913/// simplify_type specializations - Allow casting operators to work directly on 914/// SDValues as if they were SDNode*'s. 915template<> struct simplify_type<SDValue> { 916 typedef SDNode* SimpleType; 917 static SimpleType getSimplifiedValue(const SDValue &Val) { 918 return static_cast<SimpleType>(Val.getNode()); 919 } 920}; 921template<> struct simplify_type<const SDValue> { 922 typedef SDNode* SimpleType; 923 static SimpleType getSimplifiedValue(const SDValue &Val) { 924 return static_cast<SimpleType>(Val.getNode()); 925 } 926}; 927 928/// SDUse - Represents a use of a SDNode. This class holds an SDValue, 929/// which records the SDNode being used and the result number, a 930/// pointer to the SDNode using the value, and Next and Prev pointers, 931/// which link together all the uses of an SDNode. 932/// 933class SDUse { 934 /// Val - The value being used. 935 SDValue Val; 936 /// User - The user of this value. 937 SDNode *User; 938 /// Prev, Next - Pointers to the uses list of the SDNode referred by 939 /// this operand. 940 SDUse **Prev, *Next; 941 942 SDUse(const SDUse &U); // Do not implement 943 void operator=(const SDUse &U); // Do not implement 944 945public: 946 SDUse() : Val(), User(NULL), Prev(NULL), Next(NULL) {} 947 948 /// Normally SDUse will just implicitly convert to an SDValue that it holds. 949 operator const SDValue&() const { return Val; } 950 951 /// If implicit conversion to SDValue doesn't work, the get() method returns 952 /// the SDValue. 953 const SDValue &get() const { return Val; } 954 955 /// getUser - This returns the SDNode that contains this Use. 956 SDNode *getUser() { return User; } 957 958 /// getNext - Get the next SDUse in the use list. 959 SDUse *getNext() const { return Next; } 960 961 /// getNode - Convenience function for get().getNode(). 962 SDNode *getNode() const { return Val.getNode(); } 963 /// getResNo - Convenience function for get().getResNo(). 964 unsigned getResNo() const { return Val.getResNo(); } 965 /// getValueType - Convenience function for get().getValueType(). 966 EVT getValueType() const { return Val.getValueType(); } 967 968 /// operator== - Convenience function for get().operator== 969 bool operator==(const SDValue &V) const { 970 return Val == V; 971 } 972 973 /// operator!= - Convenience function for get().operator!= 974 bool operator!=(const SDValue &V) const { 975 return Val != V; 976 } 977 978 /// operator< - Convenience function for get().operator< 979 bool operator<(const SDValue &V) const { 980 return Val < V; 981 } 982 983private: 984 friend class SelectionDAG; 985 friend class SDNode; 986 987 void setUser(SDNode *p) { User = p; } 988 989 /// set - Remove this use from its existing use list, assign it the 990 /// given value, and add it to the new value's node's use list. 991 inline void set(const SDValue &V); 992 /// setInitial - like set, but only supports initializing a newly-allocated 993 /// SDUse with a non-null value. 994 inline void setInitial(const SDValue &V); 995 /// setNode - like set, but only sets the Node portion of the value, 996 /// leaving the ResNo portion unmodified. 997 inline void setNode(SDNode *N); 998 999 void addToList(SDUse **List) { 1000 Next = *List; 1001 if (Next) Next->Prev = &Next; 1002 Prev = List; 1003 *List = this; 1004 } 1005 1006 void removeFromList() { 1007 *Prev = Next; 1008 if (Next) Next->Prev = Prev; 1009 } 1010}; 1011 1012/// simplify_type specializations - Allow casting operators to work directly on 1013/// SDValues as if they were SDNode*'s. 1014template<> struct simplify_type<SDUse> { 1015 typedef SDNode* SimpleType; 1016 static SimpleType getSimplifiedValue(const SDUse &Val) { 1017 return static_cast<SimpleType>(Val.getNode()); 1018 } 1019}; 1020template<> struct simplify_type<const SDUse> { 1021 typedef SDNode* SimpleType; 1022 static SimpleType getSimplifiedValue(const SDUse &Val) { 1023 return static_cast<SimpleType>(Val.getNode()); 1024 } 1025}; 1026 1027 1028/// SDNode - Represents one node in the SelectionDAG. 1029/// 1030class SDNode : public FoldingSetNode, public ilist_node<SDNode> { 1031private: 1032 /// NodeType - The operation that this node performs. 1033 /// 1034 short NodeType; 1035 1036 /// OperandsNeedDelete - This is true if OperandList was new[]'d. If true, 1037 /// then they will be delete[]'d when the node is destroyed. 1038 unsigned short OperandsNeedDelete : 1; 1039 1040protected: 1041 /// SubclassData - This member is defined by this class, but is not used for 1042 /// anything. Subclasses can use it to hold whatever state they find useful. 1043 /// This field is initialized to zero by the ctor. 1044 unsigned short SubclassData : 15; 1045 1046private: 1047 /// NodeId - Unique id per SDNode in the DAG. 1048 int NodeId; 1049 1050 /// OperandList - The values that are used by this operation. 1051 /// 1052 SDUse *OperandList; 1053 1054 /// ValueList - The types of the values this node defines. SDNode's may 1055 /// define multiple values simultaneously. 1056 const EVT *ValueList; 1057 1058 /// UseList - List of uses for this SDNode. 1059 SDUse *UseList; 1060 1061 /// NumOperands/NumValues - The number of entries in the Operand/Value list. 1062 unsigned short NumOperands, NumValues; 1063 1064 /// debugLoc - source line information. 1065 DebugLoc debugLoc; 1066 1067 /// getValueTypeList - Return a pointer to the specified value type. 1068 static const EVT *getValueTypeList(EVT VT); 1069 1070 friend class SelectionDAG; 1071 friend struct ilist_traits<SDNode>; 1072 1073public: 1074 //===--------------------------------------------------------------------===// 1075 // Accessors 1076 // 1077 1078 /// getOpcode - Return the SelectionDAG opcode value for this node. For 1079 /// pre-isel nodes (those for which isMachineOpcode returns false), these 1080 /// are the opcode values in the ISD and <target>ISD namespaces. For 1081 /// post-isel opcodes, see getMachineOpcode. 1082 unsigned getOpcode() const { return (unsigned short)NodeType; } 1083 1084 /// isTargetOpcode - Test if this node has a target-specific opcode (in the 1085 /// \<target\>ISD namespace). 1086 bool isTargetOpcode() const { return NodeType >= ISD::BUILTIN_OP_END; } 1087 1088 /// isMachineOpcode - Test if this node has a post-isel opcode, directly 1089 /// corresponding to a MachineInstr opcode. 1090 bool isMachineOpcode() const { return NodeType < 0; } 1091 1092 /// getMachineOpcode - This may only be called if isMachineOpcode returns 1093 /// true. It returns the MachineInstr opcode value that the node's opcode 1094 /// corresponds to. 1095 unsigned getMachineOpcode() const { 1096 assert(isMachineOpcode() && "Not a MachineInstr opcode!"); 1097 return ~NodeType; 1098 } 1099 1100 /// use_empty - Return true if there are no uses of this node. 1101 /// 1102 bool use_empty() const { return UseList == NULL; } 1103 1104 /// hasOneUse - Return true if there is exactly one use of this node. 1105 /// 1106 bool hasOneUse() const { 1107 return !use_empty() && next(use_begin()) == use_end(); 1108 } 1109 1110 /// use_size - Return the number of uses of this node. This method takes 1111 /// time proportional to the number of uses. 1112 /// 1113 size_t use_size() const { return std::distance(use_begin(), use_end()); } 1114 1115 /// getNodeId - Return the unique node id. 1116 /// 1117 int getNodeId() const { return NodeId; } 1118 1119 /// setNodeId - Set unique node id. 1120 void setNodeId(int Id) { NodeId = Id; } 1121 1122 /// getDebugLoc - Return the source location info. 1123 const DebugLoc getDebugLoc() const { return debugLoc; } 1124 1125 /// setDebugLoc - Set source location info. Try to avoid this, putting 1126 /// it in the constructor is preferable. 1127 void setDebugLoc(const DebugLoc dl) { debugLoc = dl; } 1128 1129 /// use_iterator - This class provides iterator support for SDUse 1130 /// operands that use a specific SDNode. 1131 class use_iterator 1132 : public std::iterator<std::forward_iterator_tag, SDUse, ptrdiff_t> { 1133 SDUse *Op; 1134 explicit use_iterator(SDUse *op) : Op(op) { 1135 } 1136 friend class SDNode; 1137 public: 1138 typedef std::iterator<std::forward_iterator_tag, 1139 SDUse, ptrdiff_t>::reference reference; 1140 typedef std::iterator<std::forward_iterator_tag, 1141 SDUse, ptrdiff_t>::pointer pointer; 1142 1143 use_iterator(const use_iterator &I) : Op(I.Op) {} 1144 use_iterator() : Op(0) {} 1145 1146 bool operator==(const use_iterator &x) const { 1147 return Op == x.Op; 1148 } 1149 bool operator!=(const use_iterator &x) const { 1150 return !operator==(x); 1151 } 1152 1153 /// atEnd - return true if this iterator is at the end of uses list. 1154 bool atEnd() const { return Op == 0; } 1155 1156 // Iterator traversal: forward iteration only. 1157 use_iterator &operator++() { // Preincrement 1158 assert(Op && "Cannot increment end iterator!"); 1159 Op = Op->getNext(); 1160 return *this; 1161 } 1162 1163 use_iterator operator++(int) { // Postincrement 1164 use_iterator tmp = *this; ++*this; return tmp; 1165 } 1166 1167 /// Retrieve a pointer to the current user node. 1168 SDNode *operator*() const { 1169 assert(Op && "Cannot dereference end iterator!"); 1170 return Op->getUser(); 1171 } 1172 1173 SDNode *operator->() const { return operator*(); } 1174 1175 SDUse &getUse() const { return *Op; } 1176 1177 /// getOperandNo - Retrieve the operand # of this use in its user. 1178 /// 1179 unsigned getOperandNo() const { 1180 assert(Op && "Cannot dereference end iterator!"); 1181 return (unsigned)(Op - Op->getUser()->OperandList); 1182 } 1183 }; 1184 1185 /// use_begin/use_end - Provide iteration support to walk over all uses 1186 /// of an SDNode. 1187 1188 use_iterator use_begin() const { 1189 return use_iterator(UseList); 1190 } 1191 1192 static use_iterator use_end() { return use_iterator(0); } 1193 1194 1195 /// hasNUsesOfValue - Return true if there are exactly NUSES uses of the 1196 /// indicated value. This method ignores uses of other values defined by this 1197 /// operation. 1198 bool hasNUsesOfValue(unsigned NUses, unsigned Value) const; 1199 1200 /// hasAnyUseOfValue - Return true if there are any use of the indicated 1201 /// value. This method ignores uses of other values defined by this operation. 1202 bool hasAnyUseOfValue(unsigned Value) const; 1203 1204 /// isOnlyUserOf - Return true if this node is the only use of N. 1205 /// 1206 bool isOnlyUserOf(SDNode *N) const; 1207 1208 /// isOperandOf - Return true if this node is an operand of N. 1209 /// 1210 bool isOperandOf(SDNode *N) const; 1211 1212 /// isPredecessorOf - Return true if this node is a predecessor of N. This 1213 /// node is either an operand of N or it can be reached by recursively 1214 /// traversing up the operands. 1215 /// NOTE: this is an expensive method. Use it carefully. 1216 bool isPredecessorOf(SDNode *N) const; 1217 1218 /// getNumOperands - Return the number of values used by this operation. 1219 /// 1220 unsigned getNumOperands() const { return NumOperands; } 1221 1222 /// getConstantOperandVal - Helper method returns the integer value of a 1223 /// ConstantSDNode operand. 1224 uint64_t getConstantOperandVal(unsigned Num) const; 1225 1226 const SDValue &getOperand(unsigned Num) const { 1227 assert(Num < NumOperands && "Invalid child # of SDNode!"); 1228 return OperandList[Num]; 1229 } 1230 1231 typedef SDUse* op_iterator; 1232 op_iterator op_begin() const { return OperandList; } 1233 op_iterator op_end() const { return OperandList+NumOperands; } 1234 1235 SDVTList getVTList() const { 1236 SDVTList X = { ValueList, NumValues }; 1237 return X; 1238 }; 1239 1240 /// getFlaggedNode - If this node has a flag operand, return the node 1241 /// to which the flag operand points. Otherwise return NULL. 1242 SDNode *getFlaggedNode() const { 1243 if (getNumOperands() != 0 && 1244 getOperand(getNumOperands()-1).getValueType().getSimpleVT() == MVT::Flag) 1245 return getOperand(getNumOperands()-1).getNode(); 1246 return 0; 1247 } 1248 1249 // If this is a pseudo op, like copyfromreg, look to see if there is a 1250 // real target node flagged to it. If so, return the target node. 1251 const SDNode *getFlaggedMachineNode() const { 1252 const SDNode *FoundNode = this; 1253 1254 // Climb up flag edges until a machine-opcode node is found, or the 1255 // end of the chain is reached. 1256 while (!FoundNode->isMachineOpcode()) { 1257 const SDNode *N = FoundNode->getFlaggedNode(); 1258 if (!N) break; 1259 FoundNode = N; 1260 } 1261 1262 return FoundNode; 1263 } 1264 1265 /// getNumValues - Return the number of values defined/returned by this 1266 /// operator. 1267 /// 1268 unsigned getNumValues() const { return NumValues; } 1269 1270 /// getValueType - Return the type of a specified result. 1271 /// 1272 EVT getValueType(unsigned ResNo) const { 1273 assert(ResNo < NumValues && "Illegal result number!"); 1274 return ValueList[ResNo]; 1275 } 1276 1277 /// getValueSizeInBits - Returns MVT::getSizeInBits(getValueType(ResNo)). 1278 /// 1279 unsigned getValueSizeInBits(unsigned ResNo) const { 1280 return getValueType(ResNo).getSizeInBits(); 1281 } 1282 1283 typedef const EVT* value_iterator; 1284 value_iterator value_begin() const { return ValueList; } 1285 value_iterator value_end() const { return ValueList+NumValues; } 1286 1287 /// getOperationName - Return the opcode of this operation for printing. 1288 /// 1289 std::string getOperationName(const SelectionDAG *G = 0) const; 1290 static const char* getIndexedModeName(ISD::MemIndexedMode AM); 1291 void print_types(raw_ostream &OS, const SelectionDAG *G) const; 1292 void print_details(raw_ostream &OS, const SelectionDAG *G) const; 1293 void print(raw_ostream &OS, const SelectionDAG *G = 0) const; 1294 void printr(raw_ostream &OS, const SelectionDAG *G = 0) const; 1295 void dump() const; 1296 void dumpr() const; 1297 void dump(const SelectionDAG *G) const; 1298 void dumpr(const SelectionDAG *G) const; 1299 1300 static bool classof(const SDNode *) { return true; } 1301 1302 /// Profile - Gather unique data for the node. 1303 /// 1304 void Profile(FoldingSetNodeID &ID) const; 1305 1306 /// addUse - This method should only be used by the SDUse class. 1307 /// 1308 void addUse(SDUse &U) { U.addToList(&UseList); } 1309 1310protected: 1311 static SDVTList getSDVTList(EVT VT) { 1312 SDVTList Ret = { getValueTypeList(VT), 1 }; 1313 return Ret; 1314 } 1315 1316 SDNode(unsigned Opc, const DebugLoc dl, SDVTList VTs, const SDValue *Ops, 1317 unsigned NumOps) 1318 : NodeType(Opc), OperandsNeedDelete(true), SubclassData(0), 1319 NodeId(-1), 1320 OperandList(NumOps ? new SDUse[NumOps] : 0), 1321 ValueList(VTs.VTs), UseList(NULL), 1322 NumOperands(NumOps), NumValues(VTs.NumVTs), 1323 debugLoc(dl) { 1324 for (unsigned i = 0; i != NumOps; ++i) { 1325 OperandList[i].setUser(this); 1326 OperandList[i].setInitial(Ops[i]); 1327 } 1328 } 1329 1330 /// This constructor adds no operands itself; operands can be 1331 /// set later with InitOperands. 1332 SDNode(unsigned Opc, const DebugLoc dl, SDVTList VTs) 1333 : NodeType(Opc), OperandsNeedDelete(false), SubclassData(0), 1334 NodeId(-1), OperandList(0), ValueList(VTs.VTs), UseList(NULL), 1335 NumOperands(0), NumValues(VTs.NumVTs), 1336 debugLoc(dl) {} 1337 1338 /// InitOperands - Initialize the operands list of this with 1 operand. 1339 void InitOperands(SDUse *Ops, const SDValue &Op0) { 1340 Ops[0].setUser(this); 1341 Ops[0].setInitial(Op0); 1342 NumOperands = 1; 1343 OperandList = Ops; 1344 } 1345 1346 /// InitOperands - Initialize the operands list of this with 2 operands. 1347 void InitOperands(SDUse *Ops, const SDValue &Op0, const SDValue &Op1) { 1348 Ops[0].setUser(this); 1349 Ops[0].setInitial(Op0); 1350 Ops[1].setUser(this); 1351 Ops[1].setInitial(Op1); 1352 NumOperands = 2; 1353 OperandList = Ops; 1354 } 1355 1356 /// InitOperands - Initialize the operands list of this with 3 operands. 1357 void InitOperands(SDUse *Ops, const SDValue &Op0, const SDValue &Op1, 1358 const SDValue &Op2) { 1359 Ops[0].setUser(this); 1360 Ops[0].setInitial(Op0); 1361 Ops[1].setUser(this); 1362 Ops[1].setInitial(Op1); 1363 Ops[2].setUser(this); 1364 Ops[2].setInitial(Op2); 1365 NumOperands = 3; 1366 OperandList = Ops; 1367 } 1368 1369 /// InitOperands - Initialize the operands list of this with 4 operands. 1370 void InitOperands(SDUse *Ops, const SDValue &Op0, const SDValue &Op1, 1371 const SDValue &Op2, const SDValue &Op3) { 1372 Ops[0].setUser(this); 1373 Ops[0].setInitial(Op0); 1374 Ops[1].setUser(this); 1375 Ops[1].setInitial(Op1); 1376 Ops[2].setUser(this); 1377 Ops[2].setInitial(Op2); 1378 Ops[3].setUser(this); 1379 Ops[3].setInitial(Op3); 1380 NumOperands = 4; 1381 OperandList = Ops; 1382 } 1383 1384 /// InitOperands - Initialize the operands list of this with N operands. 1385 void InitOperands(SDUse *Ops, const SDValue *Vals, unsigned N) { 1386 for (unsigned i = 0; i != N; ++i) { 1387 Ops[i].setUser(this); 1388 Ops[i].setInitial(Vals[i]); 1389 } 1390 NumOperands = N; 1391 OperandList = Ops; 1392 } 1393 1394 /// DropOperands - Release the operands and set this node to have 1395 /// zero operands. 1396 void DropOperands(); 1397}; 1398 1399 1400// Define inline functions from the SDValue class. 1401 1402inline unsigned SDValue::getOpcode() const { 1403 return Node->getOpcode(); 1404} 1405inline EVT SDValue::getValueType() const { 1406 return Node->getValueType(ResNo); 1407} 1408inline unsigned SDValue::getNumOperands() const { 1409 return Node->getNumOperands(); 1410} 1411inline const SDValue &SDValue::getOperand(unsigned i) const { 1412 return Node->getOperand(i); 1413} 1414inline uint64_t SDValue::getConstantOperandVal(unsigned i) const { 1415 return Node->getConstantOperandVal(i); 1416} 1417inline bool SDValue::isTargetOpcode() const { 1418 return Node->isTargetOpcode(); 1419} 1420inline bool SDValue::isMachineOpcode() const { 1421 return Node->isMachineOpcode(); 1422} 1423inline unsigned SDValue::getMachineOpcode() const { 1424 return Node->getMachineOpcode(); 1425} 1426inline bool SDValue::use_empty() const { 1427 return !Node->hasAnyUseOfValue(ResNo); 1428} 1429inline bool SDValue::hasOneUse() const { 1430 return Node->hasNUsesOfValue(1, ResNo); 1431} 1432inline const DebugLoc SDValue::getDebugLoc() const { 1433 return Node->getDebugLoc(); 1434} 1435 1436// Define inline functions from the SDUse class. 1437 1438inline void SDUse::set(const SDValue &V) { 1439 if (Val.getNode()) removeFromList(); 1440 Val = V; 1441 if (V.getNode()) V.getNode()->addUse(*this); 1442} 1443 1444inline void SDUse::setInitial(const SDValue &V) { 1445 Val = V; 1446 V.getNode()->addUse(*this); 1447} 1448 1449inline void SDUse::setNode(SDNode *N) { 1450 if (Val.getNode()) removeFromList(); 1451 Val.setNode(N); 1452 if (N) N->addUse(*this); 1453} 1454 1455/// UnarySDNode - This class is used for single-operand SDNodes. This is solely 1456/// to allow co-allocation of node operands with the node itself. 1457class UnarySDNode : public SDNode { 1458 SDUse Op; 1459public: 1460 UnarySDNode(unsigned Opc, DebugLoc dl, SDVTList VTs, SDValue X) 1461 : SDNode(Opc, dl, VTs) { 1462 InitOperands(&Op, X); 1463 } 1464}; 1465 1466/// BinarySDNode - This class is used for two-operand SDNodes. This is solely 1467/// to allow co-allocation of node operands with the node itself. 1468class BinarySDNode : public SDNode { 1469 SDUse Ops[2]; 1470public: 1471 BinarySDNode(unsigned Opc, DebugLoc dl, SDVTList VTs, SDValue X, SDValue Y) 1472 : SDNode(Opc, dl, VTs) { 1473 InitOperands(Ops, X, Y); 1474 } 1475}; 1476 1477/// TernarySDNode - This class is used for three-operand SDNodes. This is solely 1478/// to allow co-allocation of node operands with the node itself. 1479class TernarySDNode : public SDNode { 1480 SDUse Ops[3]; 1481public: 1482 TernarySDNode(unsigned Opc, DebugLoc dl, SDVTList VTs, SDValue X, SDValue Y, 1483 SDValue Z) 1484 : SDNode(Opc, dl, VTs) { 1485 InitOperands(Ops, X, Y, Z); 1486 } 1487}; 1488 1489 1490/// HandleSDNode - This class is used to form a handle around another node that 1491/// is persistant and is updated across invocations of replaceAllUsesWith on its 1492/// operand. This node should be directly created by end-users and not added to 1493/// the AllNodes list. 1494class HandleSDNode : public SDNode { 1495 SDUse Op; 1496public: 1497 // FIXME: Remove the "noinline" attribute once <rdar://problem/5852746> is 1498 // fixed. 1499#ifdef __GNUC__ 1500 explicit __attribute__((__noinline__)) HandleSDNode(SDValue X) 1501#else 1502 explicit HandleSDNode(SDValue X) 1503#endif 1504 : SDNode(ISD::HANDLENODE, DebugLoc::getUnknownLoc(), 1505 getSDVTList(MVT::Other)) { 1506 InitOperands(&Op, X); 1507 } 1508 ~HandleSDNode(); 1509 const SDValue &getValue() const { return Op; } 1510}; 1511 1512/// Abstact virtual class for operations for memory operations 1513class MemSDNode : public SDNode { 1514private: 1515 // MemoryVT - VT of in-memory value. 1516 EVT MemoryVT; 1517 1518 //! SrcValue - Memory location for alias analysis. 1519 const Value *SrcValue; 1520 1521 //! SVOffset - Memory location offset. Note that base is defined in MemSDNode 1522 int SVOffset; 1523public: 1524 MemSDNode(unsigned Opc, DebugLoc dl, SDVTList VTs, EVT MemoryVT, 1525 const Value *srcValue, int SVOff, unsigned alignment, 1526 bool isvolatile); 1527 1528 MemSDNode(unsigned Opc, DebugLoc dl, SDVTList VTs, const SDValue *Ops, 1529 unsigned NumOps, EVT MemoryVT, const Value *srcValue, int SVOff, 1530 unsigned alignment, bool isvolatile); 1531 1532 /// Returns alignment and volatility of the memory access 1533 unsigned getOriginalAlignment() const { 1534 return (1u << (SubclassData >> 6)) >> 1; 1535 } 1536 unsigned getAlignment() const { 1537 return MinAlign(getOriginalAlignment(), SVOffset); 1538 } 1539 bool isVolatile() const { return (SubclassData >> 5) & 1; } 1540 1541 /// getRawSubclassData - Return the SubclassData value, which contains an 1542 /// encoding of the alignment and volatile information, as well as bits 1543 /// used by subclasses. This function should only be used to compute a 1544 /// FoldingSetNodeID value. 1545 unsigned getRawSubclassData() const { 1546 return SubclassData; 1547 } 1548 1549 /// Returns the SrcValue and offset that describes the location of the access 1550 const Value *getSrcValue() const { return SrcValue; } 1551 int getSrcValueOffset() const { return SVOffset; } 1552 1553 /// getMemoryVT - Return the type of the in-memory value. 1554 EVT getMemoryVT() const { return MemoryVT; } 1555 1556 /// getMemOperand - Return a MachineMemOperand object describing the memory 1557 /// reference performed by operation. 1558 MachineMemOperand getMemOperand() const; 1559 1560 const SDValue &getChain() const { return getOperand(0); } 1561 const SDValue &getBasePtr() const { 1562 return getOperand(getOpcode() == ISD::STORE ? 2 : 1); 1563 } 1564 1565 // Methods to support isa and dyn_cast 1566 static bool classof(const MemSDNode *) { return true; } 1567 static bool classof(const SDNode *N) { 1568 // For some targets, we lower some target intrinsics to a MemIntrinsicNode 1569 // with either an intrinsic or a target opcode. 1570 return N->getOpcode() == ISD::LOAD || 1571 N->getOpcode() == ISD::STORE || 1572 N->getOpcode() == ISD::ATOMIC_CMP_SWAP || 1573 N->getOpcode() == ISD::ATOMIC_SWAP || 1574 N->getOpcode() == ISD::ATOMIC_LOAD_ADD || 1575 N->getOpcode() == ISD::ATOMIC_LOAD_SUB || 1576 N->getOpcode() == ISD::ATOMIC_LOAD_AND || 1577 N->getOpcode() == ISD::ATOMIC_LOAD_OR || 1578 N->getOpcode() == ISD::ATOMIC_LOAD_XOR || 1579 N->getOpcode() == ISD::ATOMIC_LOAD_NAND || 1580 N->getOpcode() == ISD::ATOMIC_LOAD_MIN || 1581 N->getOpcode() == ISD::ATOMIC_LOAD_MAX || 1582 N->getOpcode() == ISD::ATOMIC_LOAD_UMIN || 1583 N->getOpcode() == ISD::ATOMIC_LOAD_UMAX || 1584 N->getOpcode() == ISD::INTRINSIC_W_CHAIN || 1585 N->getOpcode() == ISD::INTRINSIC_VOID || 1586 N->isTargetOpcode(); 1587 } 1588}; 1589 1590/// AtomicSDNode - A SDNode reprenting atomic operations. 1591/// 1592class AtomicSDNode : public MemSDNode { 1593 SDUse Ops[4]; 1594 1595public: 1596 // Opc: opcode for atomic 1597 // VTL: value type list 1598 // Chain: memory chain for operaand 1599 // Ptr: address to update as a SDValue 1600 // Cmp: compare value 1601 // Swp: swap value 1602 // SrcVal: address to update as a Value (used for MemOperand) 1603 // Align: alignment of memory 1604 AtomicSDNode(unsigned Opc, DebugLoc dl, SDVTList VTL, EVT MemVT, 1605 SDValue Chain, SDValue Ptr, 1606 SDValue Cmp, SDValue Swp, const Value* SrcVal, 1607 unsigned Align=0) 1608 : MemSDNode(Opc, dl, VTL, MemVT, SrcVal, /*SVOffset=*/0, 1609 Align, /*isVolatile=*/true) { 1610 InitOperands(Ops, Chain, Ptr, Cmp, Swp); 1611 } 1612 AtomicSDNode(unsigned Opc, DebugLoc dl, SDVTList VTL, EVT MemVT, 1613 SDValue Chain, SDValue Ptr, 1614 SDValue Val, const Value* SrcVal, unsigned Align=0) 1615 : MemSDNode(Opc, dl, VTL, MemVT, SrcVal, /*SVOffset=*/0, 1616 Align, /*isVolatile=*/true) { 1617 InitOperands(Ops, Chain, Ptr, Val); 1618 } 1619 1620 const SDValue &getBasePtr() const { return getOperand(1); } 1621 const SDValue &getVal() const { return getOperand(2); } 1622 1623 bool isCompareAndSwap() const { 1624 unsigned Op = getOpcode(); 1625 return Op == ISD::ATOMIC_CMP_SWAP; 1626 } 1627 1628 // Methods to support isa and dyn_cast 1629 static bool classof(const AtomicSDNode *) { return true; } 1630 static bool classof(const SDNode *N) { 1631 return N->getOpcode() == ISD::ATOMIC_CMP_SWAP || 1632 N->getOpcode() == ISD::ATOMIC_SWAP || 1633 N->getOpcode() == ISD::ATOMIC_LOAD_ADD || 1634 N->getOpcode() == ISD::ATOMIC_LOAD_SUB || 1635 N->getOpcode() == ISD::ATOMIC_LOAD_AND || 1636 N->getOpcode() == ISD::ATOMIC_LOAD_OR || 1637 N->getOpcode() == ISD::ATOMIC_LOAD_XOR || 1638 N->getOpcode() == ISD::ATOMIC_LOAD_NAND || 1639 N->getOpcode() == ISD::ATOMIC_LOAD_MIN || 1640 N->getOpcode() == ISD::ATOMIC_LOAD_MAX || 1641 N->getOpcode() == ISD::ATOMIC_LOAD_UMIN || 1642 N->getOpcode() == ISD::ATOMIC_LOAD_UMAX; 1643 } 1644}; 1645 1646/// MemIntrinsicSDNode - This SDNode is used for target intrinsic that touches 1647/// memory and need an associated memory operand. 1648/// 1649class MemIntrinsicSDNode : public MemSDNode { 1650 bool ReadMem; // Intrinsic reads memory 1651 bool WriteMem; // Intrinsic writes memory 1652public: 1653 MemIntrinsicSDNode(unsigned Opc, DebugLoc dl, SDVTList VTs, 1654 const SDValue *Ops, unsigned NumOps, 1655 EVT MemoryVT, const Value *srcValue, int SVO, 1656 unsigned Align, bool Vol, bool ReadMem, bool WriteMem) 1657 : MemSDNode(Opc, dl, VTs, Ops, NumOps, MemoryVT, srcValue, SVO, Align, Vol), 1658 ReadMem(ReadMem), WriteMem(WriteMem) { 1659 } 1660 1661 bool readMem() const { return ReadMem; } 1662 bool writeMem() const { return WriteMem; } 1663 1664 // Methods to support isa and dyn_cast 1665 static bool classof(const MemIntrinsicSDNode *) { return true; } 1666 static bool classof(const SDNode *N) { 1667 // We lower some target intrinsics to their target opcode 1668 // early a node with a target opcode can be of this class 1669 return N->getOpcode() == ISD::INTRINSIC_W_CHAIN || 1670 N->getOpcode() == ISD::INTRINSIC_VOID || 1671 N->isTargetOpcode(); 1672 } 1673}; 1674 1675/// ShuffleVectorSDNode - This SDNode is used to implement the code generator 1676/// support for the llvm IR shufflevector instruction. It combines elements 1677/// from two input vectors into a new input vector, with the selection and 1678/// ordering of elements determined by an array of integers, referred to as 1679/// the shuffle mask. For input vectors of width N, mask indices of 0..N-1 1680/// refer to elements from the LHS input, and indices from N to 2N-1 the RHS. 1681/// An index of -1 is treated as undef, such that the code generator may put 1682/// any value in the corresponding element of the result. 1683class ShuffleVectorSDNode : public SDNode { 1684 SDUse Ops[2]; 1685 1686 // The memory for Mask is owned by the SelectionDAG's OperandAllocator, and 1687 // is freed when the SelectionDAG object is destroyed. 1688 const int *Mask; 1689protected: 1690 friend class SelectionDAG; 1691 ShuffleVectorSDNode(EVT VT, DebugLoc dl, SDValue N1, SDValue N2, 1692 const int *M) 1693 : SDNode(ISD::VECTOR_SHUFFLE, dl, getSDVTList(VT)), Mask(M) { 1694 InitOperands(Ops, N1, N2); 1695 } 1696public: 1697 1698 void getMask(SmallVectorImpl<int> &M) const { 1699 EVT VT = getValueType(0); 1700 M.clear(); 1701 for (unsigned i = 0, e = VT.getVectorNumElements(); i != e; ++i) 1702 M.push_back(Mask[i]); 1703 } 1704 int getMaskElt(unsigned Idx) const { 1705 assert(Idx < getValueType(0).getVectorNumElements() && "Idx out of range!"); 1706 return Mask[Idx]; 1707 } 1708 1709 bool isSplat() const { return isSplatMask(Mask, getValueType(0)); } 1710 int getSplatIndex() const { 1711 assert(isSplat() && "Cannot get splat index for non-splat!"); 1712 return Mask[0]; 1713 } 1714 static bool isSplatMask(const int *Mask, EVT VT); 1715 1716 static bool classof(const ShuffleVectorSDNode *) { return true; } 1717 static bool classof(const SDNode *N) { 1718 return N->getOpcode() == ISD::VECTOR_SHUFFLE; 1719 } 1720}; 1721 1722class ConstantSDNode : public SDNode { 1723 const ConstantInt *Value; 1724 friend class SelectionDAG; 1725 ConstantSDNode(bool isTarget, const ConstantInt *val, EVT VT) 1726 : SDNode(isTarget ? ISD::TargetConstant : ISD::Constant, 1727 DebugLoc::getUnknownLoc(), getSDVTList(VT)), Value(val) { 1728 } 1729public: 1730 1731 const ConstantInt *getConstantIntValue() const { return Value; } 1732 const APInt &getAPIntValue() const { return Value->getValue(); } 1733 uint64_t getZExtValue() const { return Value->getZExtValue(); } 1734 int64_t getSExtValue() const { return Value->getSExtValue(); } 1735 1736 bool isNullValue() const { return Value->isNullValue(); } 1737 bool isAllOnesValue() const { return Value->isAllOnesValue(); } 1738 1739 static bool classof(const ConstantSDNode *) { return true; } 1740 static bool classof(const SDNode *N) { 1741 return N->getOpcode() == ISD::Constant || 1742 N->getOpcode() == ISD::TargetConstant; 1743 } 1744}; 1745 1746class ConstantFPSDNode : public SDNode { 1747 const ConstantFP *Value; 1748 friend class SelectionDAG; 1749 ConstantFPSDNode(bool isTarget, const ConstantFP *val, EVT VT) 1750 : SDNode(isTarget ? ISD::TargetConstantFP : ISD::ConstantFP, 1751 DebugLoc::getUnknownLoc(), getSDVTList(VT)), Value(val) { 1752 } 1753public: 1754 1755 const APFloat& getValueAPF() const { return Value->getValueAPF(); } 1756 const ConstantFP *getConstantFPValue() const { return Value; } 1757 1758 /// isExactlyValue - We don't rely on operator== working on double values, as 1759 /// it returns true for things that are clearly not equal, like -0.0 and 0.0. 1760 /// As such, this method can be used to do an exact bit-for-bit comparison of 1761 /// two floating point values. 1762 1763 /// We leave the version with the double argument here because it's just so 1764 /// convenient to write "2.0" and the like. Without this function we'd 1765 /// have to duplicate its logic everywhere it's called. 1766 bool isExactlyValue(double V) const { 1767 bool ignored; 1768 // convert is not supported on this type 1769 if (&Value->getValueAPF().getSemantics() == &APFloat::PPCDoubleDouble) 1770 return false; 1771 APFloat Tmp(V); 1772 Tmp.convert(Value->getValueAPF().getSemantics(), 1773 APFloat::rmNearestTiesToEven, &ignored); 1774 return isExactlyValue(Tmp); 1775 } 1776 bool isExactlyValue(const APFloat& V) const; 1777 1778 bool isValueValidForType(EVT VT, const APFloat& Val); 1779 1780 static bool classof(const ConstantFPSDNode *) { return true; } 1781 static bool classof(const SDNode *N) { 1782 return N->getOpcode() == ISD::ConstantFP || 1783 N->getOpcode() == ISD::TargetConstantFP; 1784 } 1785}; 1786 1787class GlobalAddressSDNode : public SDNode { 1788 GlobalValue *TheGlobal; 1789 int64_t Offset; 1790 unsigned char TargetFlags; 1791 friend class SelectionDAG; 1792 GlobalAddressSDNode(unsigned Opc, const GlobalValue *GA, EVT VT, 1793 int64_t o, unsigned char TargetFlags); 1794public: 1795 1796 GlobalValue *getGlobal() const { return TheGlobal; } 1797 int64_t getOffset() const { return Offset; } 1798 unsigned char getTargetFlags() const { return TargetFlags; } 1799 // Return the address space this GlobalAddress belongs to. 1800 unsigned getAddressSpace() const; 1801 1802 static bool classof(const GlobalAddressSDNode *) { return true; } 1803 static bool classof(const SDNode *N) { 1804 return N->getOpcode() == ISD::GlobalAddress || 1805 N->getOpcode() == ISD::TargetGlobalAddress || 1806 N->getOpcode() == ISD::GlobalTLSAddress || 1807 N->getOpcode() == ISD::TargetGlobalTLSAddress; 1808 } 1809}; 1810 1811class FrameIndexSDNode : public SDNode { 1812 int FI; 1813 friend class SelectionDAG; 1814 FrameIndexSDNode(int fi, EVT VT, bool isTarg) 1815 : SDNode(isTarg ? ISD::TargetFrameIndex : ISD::FrameIndex, 1816 DebugLoc::getUnknownLoc(), getSDVTList(VT)), FI(fi) { 1817 } 1818public: 1819 1820 int getIndex() const { return FI; } 1821 1822 static bool classof(const FrameIndexSDNode *) { return true; } 1823 static bool classof(const SDNode *N) { 1824 return N->getOpcode() == ISD::FrameIndex || 1825 N->getOpcode() == ISD::TargetFrameIndex; 1826 } 1827}; 1828 1829class JumpTableSDNode : public SDNode { 1830 int JTI; 1831 unsigned char TargetFlags; 1832 friend class SelectionDAG; 1833 JumpTableSDNode(int jti, EVT VT, bool isTarg, unsigned char TF) 1834 : SDNode(isTarg ? ISD::TargetJumpTable : ISD::JumpTable, 1835 DebugLoc::getUnknownLoc(), getSDVTList(VT)), JTI(jti), TargetFlags(TF) { 1836 } 1837public: 1838 1839 int getIndex() const { return JTI; } 1840 unsigned char getTargetFlags() const { return TargetFlags; } 1841 1842 static bool classof(const JumpTableSDNode *) { return true; } 1843 static bool classof(const SDNode *N) { 1844 return N->getOpcode() == ISD::JumpTable || 1845 N->getOpcode() == ISD::TargetJumpTable; 1846 } 1847}; 1848 1849class ConstantPoolSDNode : public SDNode { 1850 union { 1851 Constant *ConstVal; 1852 MachineConstantPoolValue *MachineCPVal; 1853 } Val; 1854 int Offset; // It's a MachineConstantPoolValue if top bit is set. 1855 unsigned Alignment; // Minimum alignment requirement of CP (not log2 value). 1856 unsigned char TargetFlags; 1857 friend class SelectionDAG; 1858 ConstantPoolSDNode(bool isTarget, Constant *c, EVT VT, int o, unsigned Align, 1859 unsigned char TF) 1860 : SDNode(isTarget ? ISD::TargetConstantPool : ISD::ConstantPool, 1861 DebugLoc::getUnknownLoc(), 1862 getSDVTList(VT)), Offset(o), Alignment(Align), TargetFlags(TF) { 1863 assert((int)Offset >= 0 && "Offset is too large"); 1864 Val.ConstVal = c; 1865 } 1866 ConstantPoolSDNode(bool isTarget, MachineConstantPoolValue *v, 1867 EVT VT, int o, unsigned Align, unsigned char TF) 1868 : SDNode(isTarget ? ISD::TargetConstantPool : ISD::ConstantPool, 1869 DebugLoc::getUnknownLoc(), 1870 getSDVTList(VT)), Offset(o), Alignment(Align), TargetFlags(TF) { 1871 assert((int)Offset >= 0 && "Offset is too large"); 1872 Val.MachineCPVal = v; 1873 Offset |= 1 << (sizeof(unsigned)*CHAR_BIT-1); 1874 } 1875public: 1876 1877 1878 bool isMachineConstantPoolEntry() const { 1879 return (int)Offset < 0; 1880 } 1881 1882 Constant *getConstVal() const { 1883 assert(!isMachineConstantPoolEntry() && "Wrong constantpool type"); 1884 return Val.ConstVal; 1885 } 1886 1887 MachineConstantPoolValue *getMachineCPVal() const { 1888 assert(isMachineConstantPoolEntry() && "Wrong constantpool type"); 1889 return Val.MachineCPVal; 1890 } 1891 1892 int getOffset() const { 1893 return Offset & ~(1 << (sizeof(unsigned)*CHAR_BIT-1)); 1894 } 1895 1896 // Return the alignment of this constant pool object, which is either 0 (for 1897 // default alignment) or the desired value. 1898 unsigned getAlignment() const { return Alignment; } 1899 unsigned char getTargetFlags() const { return TargetFlags; } 1900 1901 const Type *getType() const; 1902 1903 static bool classof(const ConstantPoolSDNode *) { return true; } 1904 static bool classof(const SDNode *N) { 1905 return N->getOpcode() == ISD::ConstantPool || 1906 N->getOpcode() == ISD::TargetConstantPool; 1907 } 1908}; 1909 1910class BasicBlockSDNode : public SDNode { 1911 MachineBasicBlock *MBB; 1912 friend class SelectionDAG; 1913 /// Debug info is meaningful and potentially useful here, but we create 1914 /// blocks out of order when they're jumped to, which makes it a bit 1915 /// harder. Let's see if we need it first. 1916 explicit BasicBlockSDNode(MachineBasicBlock *mbb) 1917 : SDNode(ISD::BasicBlock, DebugLoc::getUnknownLoc(), 1918 getSDVTList(MVT::Other)), MBB(mbb) { 1919 } 1920public: 1921 1922 MachineBasicBlock *getBasicBlock() const { return MBB; } 1923 1924 static bool classof(const BasicBlockSDNode *) { return true; } 1925 static bool classof(const SDNode *N) { 1926 return N->getOpcode() == ISD::BasicBlock; 1927 } 1928}; 1929 1930/// BuildVectorSDNode - A "pseudo-class" with methods for operating on 1931/// BUILD_VECTORs. 1932class BuildVectorSDNode : public SDNode { 1933 // These are constructed as SDNodes and then cast to BuildVectorSDNodes. 1934 explicit BuildVectorSDNode(); // Do not implement 1935public: 1936 /// isConstantSplat - Check if this is a constant splat, and if so, find the 1937 /// smallest element size that splats the vector. If MinSplatBits is 1938 /// nonzero, the element size must be at least that large. Note that the 1939 /// splat element may be the entire vector (i.e., a one element vector). 1940 /// Returns the splat element value in SplatValue. Any undefined bits in 1941 /// that value are zero, and the corresponding bits in the SplatUndef mask 1942 /// are set. The SplatBitSize value is set to the splat element size in 1943 /// bits. HasAnyUndefs is set to true if any bits in the vector are 1944 /// undefined. 1945 bool isConstantSplat(APInt &SplatValue, APInt &SplatUndef, 1946 unsigned &SplatBitSize, bool &HasAnyUndefs, 1947 unsigned MinSplatBits = 0); 1948 1949 static inline bool classof(const BuildVectorSDNode *) { return true; } 1950 static inline bool classof(const SDNode *N) { 1951 return N->getOpcode() == ISD::BUILD_VECTOR; 1952 } 1953}; 1954 1955/// SrcValueSDNode - An SDNode that holds an arbitrary LLVM IR Value. This is 1956/// used when the SelectionDAG needs to make a simple reference to something 1957/// in the LLVM IR representation. 1958/// 1959/// Note that this is not used for carrying alias information; that is done 1960/// with MemOperandSDNode, which includes a Value which is required to be a 1961/// pointer, and several other fields specific to memory references. 1962/// 1963class SrcValueSDNode : public SDNode { 1964 const Value *V; 1965 friend class SelectionDAG; 1966 /// Create a SrcValue for a general value. 1967 explicit SrcValueSDNode(const Value *v) 1968 : SDNode(ISD::SRCVALUE, DebugLoc::getUnknownLoc(), 1969 getSDVTList(MVT::Other)), V(v) {} 1970 1971public: 1972 /// getValue - return the contained Value. 1973 const Value *getValue() const { return V; } 1974 1975 static bool classof(const SrcValueSDNode *) { return true; } 1976 static bool classof(const SDNode *N) { 1977 return N->getOpcode() == ISD::SRCVALUE; 1978 } 1979}; 1980 1981 1982/// MemOperandSDNode - An SDNode that holds a MachineMemOperand. This is 1983/// used to represent a reference to memory after ISD::LOAD 1984/// and ISD::STORE have been lowered. 1985/// 1986class MemOperandSDNode : public SDNode { 1987 friend class SelectionDAG; 1988 /// Create a MachineMemOperand node 1989 explicit MemOperandSDNode(const MachineMemOperand &mo) 1990 : SDNode(ISD::MEMOPERAND, DebugLoc::getUnknownLoc(), 1991 getSDVTList(MVT::Other)), MO(mo) {} 1992 1993public: 1994 /// MO - The contained MachineMemOperand. 1995 const MachineMemOperand MO; 1996 1997 static bool classof(const MemOperandSDNode *) { return true; } 1998 static bool classof(const SDNode *N) { 1999 return N->getOpcode() == ISD::MEMOPERAND; 2000 } 2001}; 2002 2003 2004class RegisterSDNode : public SDNode { 2005 unsigned Reg; 2006 friend class SelectionDAG; 2007 RegisterSDNode(unsigned reg, EVT VT) 2008 : SDNode(ISD::Register, DebugLoc::getUnknownLoc(), 2009 getSDVTList(VT)), Reg(reg) { 2010 } 2011public: 2012 2013 unsigned getReg() const { return Reg; } 2014 2015 static bool classof(const RegisterSDNode *) { return true; } 2016 static bool classof(const SDNode *N) { 2017 return N->getOpcode() == ISD::Register; 2018 } 2019}; 2020 2021class DbgStopPointSDNode : public SDNode { 2022 SDUse Chain; 2023 unsigned Line; 2024 unsigned Column; 2025 MDNode *CU; 2026 friend class SelectionDAG; 2027 DbgStopPointSDNode(SDValue ch, unsigned l, unsigned c, 2028 MDNode *cu) 2029 : SDNode(ISD::DBG_STOPPOINT, DebugLoc::getUnknownLoc(), 2030 getSDVTList(MVT::Other)), Line(l), Column(c), CU(cu) { 2031 InitOperands(&Chain, ch); 2032 } 2033public: 2034 unsigned getLine() const { return Line; } 2035 unsigned getColumn() const { return Column; } 2036 MDNode *getCompileUnit() const { return CU; } 2037 2038 static bool classof(const DbgStopPointSDNode *) { return true; } 2039 static bool classof(const SDNode *N) { 2040 return N->getOpcode() == ISD::DBG_STOPPOINT; 2041 } 2042}; 2043 2044class LabelSDNode : public SDNode { 2045 SDUse Chain; 2046 unsigned LabelID; 2047 friend class SelectionDAG; 2048LabelSDNode(unsigned NodeTy, DebugLoc dl, SDValue ch, unsigned id) 2049 : SDNode(NodeTy, dl, getSDVTList(MVT::Other)), LabelID(id) { 2050 InitOperands(&Chain, ch); 2051 } 2052public: 2053 unsigned getLabelID() const { return LabelID; } 2054 2055 static bool classof(const LabelSDNode *) { return true; } 2056 static bool classof(const SDNode *N) { 2057 return N->getOpcode() == ISD::DBG_LABEL || 2058 N->getOpcode() == ISD::EH_LABEL; 2059 } 2060}; 2061 2062class ExternalSymbolSDNode : public SDNode { 2063 const char *Symbol; 2064 unsigned char TargetFlags; 2065 2066 friend class SelectionDAG; 2067 ExternalSymbolSDNode(bool isTarget, const char *Sym, unsigned char TF, EVT VT) 2068 : SDNode(isTarget ? ISD::TargetExternalSymbol : ISD::ExternalSymbol, 2069 DebugLoc::getUnknownLoc(), 2070 getSDVTList(VT)), Symbol(Sym), TargetFlags(TF) { 2071 } 2072public: 2073 2074 const char *getSymbol() const { return Symbol; } 2075 unsigned char getTargetFlags() const { return TargetFlags; } 2076 2077 static bool classof(const ExternalSymbolSDNode *) { return true; } 2078 static bool classof(const SDNode *N) { 2079 return N->getOpcode() == ISD::ExternalSymbol || 2080 N->getOpcode() == ISD::TargetExternalSymbol; 2081 } 2082}; 2083 2084class CondCodeSDNode : public SDNode { 2085 ISD::CondCode Condition; 2086 friend class SelectionDAG; 2087 explicit CondCodeSDNode(ISD::CondCode Cond) 2088 : SDNode(ISD::CONDCODE, DebugLoc::getUnknownLoc(), 2089 getSDVTList(MVT::Other)), Condition(Cond) { 2090 } 2091public: 2092 2093 ISD::CondCode get() const { return Condition; } 2094 2095 static bool classof(const CondCodeSDNode *) { return true; } 2096 static bool classof(const SDNode *N) { 2097 return N->getOpcode() == ISD::CONDCODE; 2098 } 2099}; 2100 2101/// CvtRndSatSDNode - NOTE: avoid using this node as this may disappear in the 2102/// future and most targets don't support it. 2103class CvtRndSatSDNode : public SDNode { 2104 ISD::CvtCode CvtCode; 2105 friend class SelectionDAG; 2106 explicit CvtRndSatSDNode(EVT VT, DebugLoc dl, const SDValue *Ops, 2107 unsigned NumOps, ISD::CvtCode Code) 2108 : SDNode(ISD::CONVERT_RNDSAT, dl, getSDVTList(VT), Ops, NumOps), 2109 CvtCode(Code) { 2110 assert(NumOps == 5 && "wrong number of operations"); 2111 } 2112public: 2113 ISD::CvtCode getCvtCode() const { return CvtCode; } 2114 2115 static bool classof(const CvtRndSatSDNode *) { return true; } 2116 static bool classof(const SDNode *N) { 2117 return N->getOpcode() == ISD::CONVERT_RNDSAT; 2118 } 2119}; 2120 2121namespace ISD { 2122 struct ArgFlagsTy { 2123 private: 2124 static const uint64_t NoFlagSet = 0ULL; 2125 static const uint64_t ZExt = 1ULL<<0; ///< Zero extended 2126 static const uint64_t ZExtOffs = 0; 2127 static const uint64_t SExt = 1ULL<<1; ///< Sign extended 2128 static const uint64_t SExtOffs = 1; 2129 static const uint64_t InReg = 1ULL<<2; ///< Passed in register 2130 static const uint64_t InRegOffs = 2; 2131 static const uint64_t SRet = 1ULL<<3; ///< Hidden struct-ret ptr 2132 static const uint64_t SRetOffs = 3; 2133 static const uint64_t ByVal = 1ULL<<4; ///< Struct passed by value 2134 static const uint64_t ByValOffs = 4; 2135 static const uint64_t Nest = 1ULL<<5; ///< Nested fn static chain 2136 static const uint64_t NestOffs = 5; 2137 static const uint64_t ByValAlign = 0xFULL << 6; //< Struct alignment 2138 static const uint64_t ByValAlignOffs = 6; 2139 static const uint64_t Split = 1ULL << 10; 2140 static const uint64_t SplitOffs = 10; 2141 static const uint64_t OrigAlign = 0x1FULL<<27; 2142 static const uint64_t OrigAlignOffs = 27; 2143 static const uint64_t ByValSize = 0xffffffffULL << 32; //< Struct size 2144 static const uint64_t ByValSizeOffs = 32; 2145 2146 static const uint64_t One = 1ULL; //< 1 of this type, for shifts 2147 2148 uint64_t Flags; 2149 public: 2150 ArgFlagsTy() : Flags(0) { } 2151 2152 bool isZExt() const { return Flags & ZExt; } 2153 void setZExt() { Flags |= One << ZExtOffs; } 2154 2155 bool isSExt() const { return Flags & SExt; } 2156 void setSExt() { Flags |= One << SExtOffs; } 2157 2158 bool isInReg() const { return Flags & InReg; } 2159 void setInReg() { Flags |= One << InRegOffs; } 2160 2161 bool isSRet() const { return Flags & SRet; } 2162 void setSRet() { Flags |= One << SRetOffs; } 2163 2164 bool isByVal() const { return Flags & ByVal; } 2165 void setByVal() { Flags |= One << ByValOffs; } 2166 2167 bool isNest() const { return Flags & Nest; } 2168 void setNest() { Flags |= One << NestOffs; } 2169 2170 unsigned getByValAlign() const { 2171 return (unsigned) 2172 ((One << ((Flags & ByValAlign) >> ByValAlignOffs)) / 2); 2173 } 2174 void setByValAlign(unsigned A) { 2175 Flags = (Flags & ~ByValAlign) | 2176 (uint64_t(Log2_32(A) + 1) << ByValAlignOffs); 2177 } 2178 2179 bool isSplit() const { return Flags & Split; } 2180 void setSplit() { Flags |= One << SplitOffs; } 2181 2182 unsigned getOrigAlign() const { 2183 return (unsigned) 2184 ((One << ((Flags & OrigAlign) >> OrigAlignOffs)) / 2); 2185 } 2186 void setOrigAlign(unsigned A) { 2187 Flags = (Flags & ~OrigAlign) | 2188 (uint64_t(Log2_32(A) + 1) << OrigAlignOffs); 2189 } 2190 2191 unsigned getByValSize() const { 2192 return (unsigned)((Flags & ByValSize) >> ByValSizeOffs); 2193 } 2194 void setByValSize(unsigned S) { 2195 Flags = (Flags & ~ByValSize) | (uint64_t(S) << ByValSizeOffs); 2196 } 2197 2198 /// getArgFlagsString - Returns the flags as a string, eg: "zext align:4". 2199 std::string getArgFlagsString(); 2200 2201 /// getRawBits - Represent the flags as a bunch of bits. 2202 uint64_t getRawBits() const { return Flags; } 2203 }; 2204 2205 /// InputArg - This struct carries flags and type information about a 2206 /// single incoming (formal) argument or incoming (from the perspective 2207 /// of the caller) return value virtual register. 2208 /// 2209 struct InputArg { 2210 ArgFlagsTy Flags; 2211 EVT VT; 2212 bool Used; 2213 2214 InputArg() : VT(MVT::Other), Used(false) {} 2215 InputArg(ISD::ArgFlagsTy flags, EVT vt, bool used) 2216 : Flags(flags), VT(vt), Used(used) { 2217 assert(VT.isSimple() && 2218 "InputArg value type must be Simple!"); 2219 } 2220 }; 2221 2222 /// OutputArg - This struct carries flags and a value for a 2223 /// single outgoing (actual) argument or outgoing (from the perspective 2224 /// of the caller) return value virtual register. 2225 /// 2226 struct OutputArg { 2227 ArgFlagsTy Flags; 2228 SDValue Val; 2229 bool IsFixed; 2230 2231 OutputArg() : IsFixed(false) {} 2232 OutputArg(ISD::ArgFlagsTy flags, SDValue val, bool isfixed) 2233 : Flags(flags), Val(val), IsFixed(isfixed) { 2234 assert(Val.getValueType().isSimple() && 2235 "OutputArg value type must be Simple!"); 2236 } 2237 }; 2238} 2239 2240/// VTSDNode - This class is used to represent EVT's, which are used 2241/// to parameterize some operations. 2242class VTSDNode : public SDNode { 2243 EVT ValueType; 2244 friend class SelectionDAG; 2245 explicit VTSDNode(EVT VT) 2246 : SDNode(ISD::VALUETYPE, DebugLoc::getUnknownLoc(), 2247 getSDVTList(MVT::Other)), ValueType(VT) { 2248 } 2249public: 2250 2251 EVT getVT() const { return ValueType; } 2252 2253 static bool classof(const VTSDNode *) { return true; } 2254 static bool classof(const SDNode *N) { 2255 return N->getOpcode() == ISD::VALUETYPE; 2256 } 2257}; 2258 2259/// LSBaseSDNode - Base class for LoadSDNode and StoreSDNode 2260/// 2261class LSBaseSDNode : public MemSDNode { 2262 //! Operand array for load and store 2263 /*! 2264 \note Moving this array to the base class captures more 2265 common functionality shared between LoadSDNode and 2266 StoreSDNode 2267 */ 2268 SDUse Ops[4]; 2269public: 2270 LSBaseSDNode(ISD::NodeType NodeTy, DebugLoc dl, SDValue *Operands, 2271 unsigned numOperands, SDVTList VTs, ISD::MemIndexedMode AM, 2272 EVT VT, const Value *SV, int SVO, unsigned Align, bool Vol) 2273 : MemSDNode(NodeTy, dl, VTs, VT, SV, SVO, Align, Vol) { 2274 assert(Align != 0 && "Loads and stores should have non-zero aligment"); 2275 SubclassData |= AM << 2; 2276 assert(getAddressingMode() == AM && "MemIndexedMode encoding error!"); 2277 InitOperands(Ops, Operands, numOperands); 2278 assert((getOffset().getOpcode() == ISD::UNDEF || isIndexed()) && 2279 "Only indexed loads and stores have a non-undef offset operand"); 2280 } 2281 2282 const SDValue &getOffset() const { 2283 return getOperand(getOpcode() == ISD::LOAD ? 2 : 3); 2284 } 2285 2286 /// getAddressingMode - Return the addressing mode for this load or store: 2287 /// unindexed, pre-inc, pre-dec, post-inc, or post-dec. 2288 ISD::MemIndexedMode getAddressingMode() const { 2289 return ISD::MemIndexedMode((SubclassData >> 2) & 7); 2290 } 2291 2292 /// isIndexed - Return true if this is a pre/post inc/dec load/store. 2293 bool isIndexed() const { return getAddressingMode() != ISD::UNINDEXED; } 2294 2295 /// isUnindexed - Return true if this is NOT a pre/post inc/dec load/store. 2296 bool isUnindexed() const { return getAddressingMode() == ISD::UNINDEXED; } 2297 2298 static bool classof(const LSBaseSDNode *) { return true; } 2299 static bool classof(const SDNode *N) { 2300 return N->getOpcode() == ISD::LOAD || 2301 N->getOpcode() == ISD::STORE; 2302 } 2303}; 2304 2305/// LoadSDNode - This class is used to represent ISD::LOAD nodes. 2306/// 2307class LoadSDNode : public LSBaseSDNode { 2308 friend class SelectionDAG; 2309 LoadSDNode(SDValue *ChainPtrOff, DebugLoc dl, SDVTList VTs, 2310 ISD::MemIndexedMode AM, ISD::LoadExtType ETy, EVT LVT, 2311 const Value *SV, int O=0, unsigned Align=0, bool Vol=false) 2312 : LSBaseSDNode(ISD::LOAD, dl, ChainPtrOff, 3, 2313 VTs, AM, LVT, SV, O, Align, Vol) { 2314 SubclassData |= (unsigned short)ETy; 2315 assert(getExtensionType() == ETy && "LoadExtType encoding error!"); 2316 } 2317public: 2318 2319 /// getExtensionType - Return whether this is a plain node, 2320 /// or one of the varieties of value-extending loads. 2321 ISD::LoadExtType getExtensionType() const { 2322 return ISD::LoadExtType(SubclassData & 3); 2323 } 2324 2325 const SDValue &getBasePtr() const { return getOperand(1); } 2326 const SDValue &getOffset() const { return getOperand(2); } 2327 2328 static bool classof(const LoadSDNode *) { return true; } 2329 static bool classof(const SDNode *N) { 2330 return N->getOpcode() == ISD::LOAD; 2331 } 2332}; 2333 2334/// StoreSDNode - This class is used to represent ISD::STORE nodes. 2335/// 2336class StoreSDNode : public LSBaseSDNode { 2337 friend class SelectionDAG; 2338 StoreSDNode(SDValue *ChainValuePtrOff, DebugLoc dl, SDVTList VTs, 2339 ISD::MemIndexedMode AM, bool isTrunc, EVT SVT, 2340 const Value *SV, int O=0, unsigned Align=0, bool Vol=false) 2341 : LSBaseSDNode(ISD::STORE, dl, ChainValuePtrOff, 4, 2342 VTs, AM, SVT, SV, O, Align, Vol) { 2343 SubclassData |= (unsigned short)isTrunc; 2344 assert(isTruncatingStore() == isTrunc && "isTrunc encoding error!"); 2345 } 2346public: 2347 2348 /// isTruncatingStore - Return true if the op does a truncation before store. 2349 /// For integers this is the same as doing a TRUNCATE and storing the result. 2350 /// For floats, it is the same as doing an FP_ROUND and storing the result. 2351 bool isTruncatingStore() const { return SubclassData & 1; } 2352 2353 const SDValue &getValue() const { return getOperand(1); } 2354 const SDValue &getBasePtr() const { return getOperand(2); } 2355 const SDValue &getOffset() const { return getOperand(3); } 2356 2357 static bool classof(const StoreSDNode *) { return true; } 2358 static bool classof(const SDNode *N) { 2359 return N->getOpcode() == ISD::STORE; 2360 } 2361}; 2362 2363 2364class SDNodeIterator : public std::iterator<std::forward_iterator_tag, 2365 SDNode, ptrdiff_t> { 2366 SDNode *Node; 2367 unsigned Operand; 2368 2369 SDNodeIterator(SDNode *N, unsigned Op) : Node(N), Operand(Op) {} 2370public: 2371 bool operator==(const SDNodeIterator& x) const { 2372 return Operand == x.Operand; 2373 } 2374 bool operator!=(const SDNodeIterator& x) const { return !operator==(x); } 2375 2376 const SDNodeIterator &operator=(const SDNodeIterator &I) { 2377 assert(I.Node == Node && "Cannot assign iterators to two different nodes!"); 2378 Operand = I.Operand; 2379 return *this; 2380 } 2381 2382 pointer operator*() const { 2383 return Node->getOperand(Operand).getNode(); 2384 } 2385 pointer operator->() const { return operator*(); } 2386 2387 SDNodeIterator& operator++() { // Preincrement 2388 ++Operand; 2389 return *this; 2390 } 2391 SDNodeIterator operator++(int) { // Postincrement 2392 SDNodeIterator tmp = *this; ++*this; return tmp; 2393 } 2394 2395 static SDNodeIterator begin(SDNode *N) { return SDNodeIterator(N, 0); } 2396 static SDNodeIterator end (SDNode *N) { 2397 return SDNodeIterator(N, N->getNumOperands()); 2398 } 2399 2400 unsigned getOperand() const { return Operand; } 2401 const SDNode *getNode() const { return Node; } 2402}; 2403 2404template <> struct GraphTraits<SDNode*> { 2405 typedef SDNode NodeType; 2406 typedef SDNodeIterator ChildIteratorType; 2407 static inline NodeType *getEntryNode(SDNode *N) { return N; } 2408 static inline ChildIteratorType child_begin(NodeType *N) { 2409 return SDNodeIterator::begin(N); 2410 } 2411 static inline ChildIteratorType child_end(NodeType *N) { 2412 return SDNodeIterator::end(N); 2413 } 2414}; 2415 2416/// LargestSDNode - The largest SDNode class. 2417/// 2418typedef LoadSDNode LargestSDNode; 2419 2420/// MostAlignedSDNode - The SDNode class with the greatest alignment 2421/// requirement. 2422/// 2423typedef GlobalAddressSDNode MostAlignedSDNode; 2424 2425namespace ISD { 2426 /// isNormalLoad - Returns true if the specified node is a non-extending 2427 /// and unindexed load. 2428 inline bool isNormalLoad(const SDNode *N) { 2429 const LoadSDNode *Ld = dyn_cast<LoadSDNode>(N); 2430 return Ld && Ld->getExtensionType() == ISD::NON_EXTLOAD && 2431 Ld->getAddressingMode() == ISD::UNINDEXED; 2432 } 2433 2434 /// isNON_EXTLoad - Returns true if the specified node is a non-extending 2435 /// load. 2436 inline bool isNON_EXTLoad(const SDNode *N) { 2437 return isa<LoadSDNode>(N) && 2438 cast<LoadSDNode>(N)->getExtensionType() == ISD::NON_EXTLOAD; 2439 } 2440 2441 /// isEXTLoad - Returns true if the specified node is a EXTLOAD. 2442 /// 2443 inline bool isEXTLoad(const SDNode *N) { 2444 return isa<LoadSDNode>(N) && 2445 cast<LoadSDNode>(N)->getExtensionType() == ISD::EXTLOAD; 2446 } 2447 2448 /// isSEXTLoad - Returns true if the specified node is a SEXTLOAD. 2449 /// 2450 inline bool isSEXTLoad(const SDNode *N) { 2451 return isa<LoadSDNode>(N) && 2452 cast<LoadSDNode>(N)->getExtensionType() == ISD::SEXTLOAD; 2453 } 2454 2455 /// isZEXTLoad - Returns true if the specified node is a ZEXTLOAD. 2456 /// 2457 inline bool isZEXTLoad(const SDNode *N) { 2458 return isa<LoadSDNode>(N) && 2459 cast<LoadSDNode>(N)->getExtensionType() == ISD::ZEXTLOAD; 2460 } 2461 2462 /// isUNINDEXEDLoad - Returns true if the specified node is an unindexed load. 2463 /// 2464 inline bool isUNINDEXEDLoad(const SDNode *N) { 2465 return isa<LoadSDNode>(N) && 2466 cast<LoadSDNode>(N)->getAddressingMode() == ISD::UNINDEXED; 2467 } 2468 2469 /// isNormalStore - Returns true if the specified node is a non-truncating 2470 /// and unindexed store. 2471 inline bool isNormalStore(const SDNode *N) { 2472 const StoreSDNode *St = dyn_cast<StoreSDNode>(N); 2473 return St && !St->isTruncatingStore() && 2474 St->getAddressingMode() == ISD::UNINDEXED; 2475 } 2476 2477 /// isNON_TRUNCStore - Returns true if the specified node is a non-truncating 2478 /// store. 2479 inline bool isNON_TRUNCStore(const SDNode *N) { 2480 return isa<StoreSDNode>(N) && !cast<StoreSDNode>(N)->isTruncatingStore(); 2481 } 2482 2483 /// isTRUNCStore - Returns true if the specified node is a truncating 2484 /// store. 2485 inline bool isTRUNCStore(const SDNode *N) { 2486 return isa<StoreSDNode>(N) && cast<StoreSDNode>(N)->isTruncatingStore(); 2487 } 2488 2489 /// isUNINDEXEDStore - Returns true if the specified node is an 2490 /// unindexed store. 2491 inline bool isUNINDEXEDStore(const SDNode *N) { 2492 return isa<StoreSDNode>(N) && 2493 cast<StoreSDNode>(N)->getAddressingMode() == ISD::UNINDEXED; 2494 } 2495} 2496 2497 2498} // end llvm namespace 2499 2500#endif 2501