SelectionDAG.cpp revision bd13a81015ff9a56076fe48db0a3d77f9bdd765f
1//===-- SelectionDAG.cpp - Implement the SelectionDAG data structures -----===// 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 implements the SelectionDAG class. 11// 12//===----------------------------------------------------------------------===// 13 14#include "llvm/CodeGen/SelectionDAG.h" 15#include "llvm/Constants.h" 16#include "llvm/GlobalVariable.h" 17#include "llvm/Intrinsics.h" 18#include "llvm/DerivedTypes.h" 19#include "llvm/Assembly/Writer.h" 20#include "llvm/CodeGen/MachineBasicBlock.h" 21#include "llvm/CodeGen/MachineConstantPool.h" 22#include "llvm/CodeGen/MachineFrameInfo.h" 23#include "llvm/CodeGen/MachineModuleInfo.h" 24#include "llvm/CodeGen/PseudoSourceValue.h" 25#include "llvm/Support/MathExtras.h" 26#include "llvm/Target/TargetRegisterInfo.h" 27#include "llvm/Target/TargetData.h" 28#include "llvm/Target/TargetLowering.h" 29#include "llvm/Target/TargetInstrInfo.h" 30#include "llvm/Target/TargetMachine.h" 31#include "llvm/ADT/SetVector.h" 32#include "llvm/ADT/SmallPtrSet.h" 33#include "llvm/ADT/SmallSet.h" 34#include "llvm/ADT/SmallVector.h" 35#include "llvm/ADT/StringExtras.h" 36#include <algorithm> 37#include <cmath> 38using namespace llvm; 39 40/// makeVTList - Return an instance of the SDVTList struct initialized with the 41/// specified members. 42static SDVTList makeVTList(const MVT::ValueType *VTs, unsigned NumVTs) { 43 SDVTList Res = {VTs, NumVTs}; 44 return Res; 45} 46 47SelectionDAG::DAGUpdateListener::~DAGUpdateListener() {} 48 49//===----------------------------------------------------------------------===// 50// ConstantFPSDNode Class 51//===----------------------------------------------------------------------===// 52 53/// isExactlyValue - We don't rely on operator== working on double values, as 54/// it returns true for things that are clearly not equal, like -0.0 and 0.0. 55/// As such, this method can be used to do an exact bit-for-bit comparison of 56/// two floating point values. 57bool ConstantFPSDNode::isExactlyValue(const APFloat& V) const { 58 return Value.bitwiseIsEqual(V); 59} 60 61bool ConstantFPSDNode::isValueValidForType(MVT::ValueType VT, 62 const APFloat& Val) { 63 // convert modifies in place, so make a copy. 64 APFloat Val2 = APFloat(Val); 65 switch (VT) { 66 default: 67 return false; // These can't be represented as floating point! 68 69 // FIXME rounding mode needs to be more flexible 70 case MVT::f32: 71 return &Val2.getSemantics() == &APFloat::IEEEsingle || 72 Val2.convert(APFloat::IEEEsingle, APFloat::rmNearestTiesToEven) == 73 APFloat::opOK; 74 case MVT::f64: 75 return &Val2.getSemantics() == &APFloat::IEEEsingle || 76 &Val2.getSemantics() == &APFloat::IEEEdouble || 77 Val2.convert(APFloat::IEEEdouble, APFloat::rmNearestTiesToEven) == 78 APFloat::opOK; 79 // TODO: Figure out how to test if we can use a shorter type instead! 80 case MVT::f80: 81 case MVT::f128: 82 case MVT::ppcf128: 83 return true; 84 } 85} 86 87//===----------------------------------------------------------------------===// 88// ISD Namespace 89//===----------------------------------------------------------------------===// 90 91/// isBuildVectorAllOnes - Return true if the specified node is a 92/// BUILD_VECTOR where all of the elements are ~0 or undef. 93bool ISD::isBuildVectorAllOnes(const SDNode *N) { 94 // Look through a bit convert. 95 if (N->getOpcode() == ISD::BIT_CONVERT) 96 N = N->getOperand(0).Val; 97 98 if (N->getOpcode() != ISD::BUILD_VECTOR) return false; 99 100 unsigned i = 0, e = N->getNumOperands(); 101 102 // Skip over all of the undef values. 103 while (i != e && N->getOperand(i).getOpcode() == ISD::UNDEF) 104 ++i; 105 106 // Do not accept an all-undef vector. 107 if (i == e) return false; 108 109 // Do not accept build_vectors that aren't all constants or which have non-~0 110 // elements. 111 SDOperand NotZero = N->getOperand(i); 112 if (isa<ConstantSDNode>(NotZero)) { 113 if (!cast<ConstantSDNode>(NotZero)->isAllOnesValue()) 114 return false; 115 } else if (isa<ConstantFPSDNode>(NotZero)) { 116 MVT::ValueType VT = NotZero.getValueType(); 117 if (VT== MVT::f64) { 118 if (((cast<ConstantFPSDNode>(NotZero)->getValueAPF(). 119 convertToAPInt().getZExtValue())) != (uint64_t)-1) 120 return false; 121 } else { 122 if ((uint32_t)cast<ConstantFPSDNode>(NotZero)-> 123 getValueAPF().convertToAPInt().getZExtValue() != 124 (uint32_t)-1) 125 return false; 126 } 127 } else 128 return false; 129 130 // Okay, we have at least one ~0 value, check to see if the rest match or are 131 // undefs. 132 for (++i; i != e; ++i) 133 if (N->getOperand(i) != NotZero && 134 N->getOperand(i).getOpcode() != ISD::UNDEF) 135 return false; 136 return true; 137} 138 139 140/// isBuildVectorAllZeros - Return true if the specified node is a 141/// BUILD_VECTOR where all of the elements are 0 or undef. 142bool ISD::isBuildVectorAllZeros(const SDNode *N) { 143 // Look through a bit convert. 144 if (N->getOpcode() == ISD::BIT_CONVERT) 145 N = N->getOperand(0).Val; 146 147 if (N->getOpcode() != ISD::BUILD_VECTOR) return false; 148 149 unsigned i = 0, e = N->getNumOperands(); 150 151 // Skip over all of the undef values. 152 while (i != e && N->getOperand(i).getOpcode() == ISD::UNDEF) 153 ++i; 154 155 // Do not accept an all-undef vector. 156 if (i == e) return false; 157 158 // Do not accept build_vectors that aren't all constants or which have non-~0 159 // elements. 160 SDOperand Zero = N->getOperand(i); 161 if (isa<ConstantSDNode>(Zero)) { 162 if (!cast<ConstantSDNode>(Zero)->isNullValue()) 163 return false; 164 } else if (isa<ConstantFPSDNode>(Zero)) { 165 if (!cast<ConstantFPSDNode>(Zero)->getValueAPF().isPosZero()) 166 return false; 167 } else 168 return false; 169 170 // Okay, we have at least one ~0 value, check to see if the rest match or are 171 // undefs. 172 for (++i; i != e; ++i) 173 if (N->getOperand(i) != Zero && 174 N->getOperand(i).getOpcode() != ISD::UNDEF) 175 return false; 176 return true; 177} 178 179/// isScalarToVector - Return true if the specified node is a 180/// ISD::SCALAR_TO_VECTOR node or a BUILD_VECTOR node where only the low 181/// element is not an undef. 182bool ISD::isScalarToVector(const SDNode *N) { 183 if (N->getOpcode() == ISD::SCALAR_TO_VECTOR) 184 return true; 185 186 if (N->getOpcode() != ISD::BUILD_VECTOR) 187 return false; 188 if (N->getOperand(0).getOpcode() == ISD::UNDEF) 189 return false; 190 unsigned NumElems = N->getNumOperands(); 191 for (unsigned i = 1; i < NumElems; ++i) { 192 SDOperand V = N->getOperand(i); 193 if (V.getOpcode() != ISD::UNDEF) 194 return false; 195 } 196 return true; 197} 198 199 200/// isDebugLabel - Return true if the specified node represents a debug 201/// label (i.e. ISD::LABEL or TargetInstrInfo::LABEL node and third operand 202/// is 0). 203bool ISD::isDebugLabel(const SDNode *N) { 204 SDOperand Zero; 205 if (N->getOpcode() == ISD::LABEL) 206 Zero = N->getOperand(2); 207 else if (N->isTargetOpcode() && 208 N->getTargetOpcode() == TargetInstrInfo::LABEL) 209 // Chain moved to last operand. 210 Zero = N->getOperand(1); 211 else 212 return false; 213 return isa<ConstantSDNode>(Zero) && cast<ConstantSDNode>(Zero)->isNullValue(); 214} 215 216/// getSetCCSwappedOperands - Return the operation corresponding to (Y op X) 217/// when given the operation for (X op Y). 218ISD::CondCode ISD::getSetCCSwappedOperands(ISD::CondCode Operation) { 219 // To perform this operation, we just need to swap the L and G bits of the 220 // operation. 221 unsigned OldL = (Operation >> 2) & 1; 222 unsigned OldG = (Operation >> 1) & 1; 223 return ISD::CondCode((Operation & ~6) | // Keep the N, U, E bits 224 (OldL << 1) | // New G bit 225 (OldG << 2)); // New L bit. 226} 227 228/// getSetCCInverse - Return the operation corresponding to !(X op Y), where 229/// 'op' is a valid SetCC operation. 230ISD::CondCode ISD::getSetCCInverse(ISD::CondCode Op, bool isInteger) { 231 unsigned Operation = Op; 232 if (isInteger) 233 Operation ^= 7; // Flip L, G, E bits, but not U. 234 else 235 Operation ^= 15; // Flip all of the condition bits. 236 if (Operation > ISD::SETTRUE2) 237 Operation &= ~8; // Don't let N and U bits get set. 238 return ISD::CondCode(Operation); 239} 240 241 242/// isSignedOp - For an integer comparison, return 1 if the comparison is a 243/// signed operation and 2 if the result is an unsigned comparison. Return zero 244/// if the operation does not depend on the sign of the input (setne and seteq). 245static int isSignedOp(ISD::CondCode Opcode) { 246 switch (Opcode) { 247 default: assert(0 && "Illegal integer setcc operation!"); 248 case ISD::SETEQ: 249 case ISD::SETNE: return 0; 250 case ISD::SETLT: 251 case ISD::SETLE: 252 case ISD::SETGT: 253 case ISD::SETGE: return 1; 254 case ISD::SETULT: 255 case ISD::SETULE: 256 case ISD::SETUGT: 257 case ISD::SETUGE: return 2; 258 } 259} 260 261/// getSetCCOrOperation - Return the result of a logical OR between different 262/// comparisons of identical values: ((X op1 Y) | (X op2 Y)). This function 263/// returns SETCC_INVALID if it is not possible to represent the resultant 264/// comparison. 265ISD::CondCode ISD::getSetCCOrOperation(ISD::CondCode Op1, ISD::CondCode Op2, 266 bool isInteger) { 267 if (isInteger && (isSignedOp(Op1) | isSignedOp(Op2)) == 3) 268 // Cannot fold a signed integer setcc with an unsigned integer setcc. 269 return ISD::SETCC_INVALID; 270 271 unsigned Op = Op1 | Op2; // Combine all of the condition bits. 272 273 // If the N and U bits get set then the resultant comparison DOES suddenly 274 // care about orderedness, and is true when ordered. 275 if (Op > ISD::SETTRUE2) 276 Op &= ~16; // Clear the U bit if the N bit is set. 277 278 // Canonicalize illegal integer setcc's. 279 if (isInteger && Op == ISD::SETUNE) // e.g. SETUGT | SETULT 280 Op = ISD::SETNE; 281 282 return ISD::CondCode(Op); 283} 284 285/// getSetCCAndOperation - Return the result of a logical AND between different 286/// comparisons of identical values: ((X op1 Y) & (X op2 Y)). This 287/// function returns zero if it is not possible to represent the resultant 288/// comparison. 289ISD::CondCode ISD::getSetCCAndOperation(ISD::CondCode Op1, ISD::CondCode Op2, 290 bool isInteger) { 291 if (isInteger && (isSignedOp(Op1) | isSignedOp(Op2)) == 3) 292 // Cannot fold a signed setcc with an unsigned setcc. 293 return ISD::SETCC_INVALID; 294 295 // Combine all of the condition bits. 296 ISD::CondCode Result = ISD::CondCode(Op1 & Op2); 297 298 // Canonicalize illegal integer setcc's. 299 if (isInteger) { 300 switch (Result) { 301 default: break; 302 case ISD::SETUO : Result = ISD::SETFALSE; break; // SETUGT & SETULT 303 case ISD::SETUEQ: Result = ISD::SETEQ ; break; // SETUGE & SETULE 304 case ISD::SETOLT: Result = ISD::SETULT ; break; // SETULT & SETNE 305 case ISD::SETOGT: Result = ISD::SETUGT ; break; // SETUGT & SETNE 306 } 307 } 308 309 return Result; 310} 311 312const TargetMachine &SelectionDAG::getTarget() const { 313 return TLI.getTargetMachine(); 314} 315 316//===----------------------------------------------------------------------===// 317// SDNode Profile Support 318//===----------------------------------------------------------------------===// 319 320/// AddNodeIDOpcode - Add the node opcode to the NodeID data. 321/// 322static void AddNodeIDOpcode(FoldingSetNodeID &ID, unsigned OpC) { 323 ID.AddInteger(OpC); 324} 325 326/// AddNodeIDValueTypes - Value type lists are intern'd so we can represent them 327/// solely with their pointer. 328void AddNodeIDValueTypes(FoldingSetNodeID &ID, SDVTList VTList) { 329 ID.AddPointer(VTList.VTs); 330} 331 332/// AddNodeIDOperands - Various routines for adding operands to the NodeID data. 333/// 334static void AddNodeIDOperands(FoldingSetNodeID &ID, 335 const SDOperand *Ops, unsigned NumOps) { 336 for (; NumOps; --NumOps, ++Ops) { 337 ID.AddPointer(Ops->Val); 338 ID.AddInteger(Ops->ResNo); 339 } 340} 341 342static void AddNodeIDNode(FoldingSetNodeID &ID, 343 unsigned short OpC, SDVTList VTList, 344 const SDOperand *OpList, unsigned N) { 345 AddNodeIDOpcode(ID, OpC); 346 AddNodeIDValueTypes(ID, VTList); 347 AddNodeIDOperands(ID, OpList, N); 348} 349 350/// AddNodeIDNode - Generic routine for adding a nodes info to the NodeID 351/// data. 352static void AddNodeIDNode(FoldingSetNodeID &ID, SDNode *N) { 353 AddNodeIDOpcode(ID, N->getOpcode()); 354 // Add the return value info. 355 AddNodeIDValueTypes(ID, N->getVTList()); 356 // Add the operand info. 357 AddNodeIDOperands(ID, N->op_begin(), N->getNumOperands()); 358 359 // Handle SDNode leafs with special info. 360 switch (N->getOpcode()) { 361 default: break; // Normal nodes don't need extra info. 362 case ISD::TargetConstant: 363 case ISD::Constant: 364 ID.Add(cast<ConstantSDNode>(N)->getAPIntValue()); 365 break; 366 case ISD::TargetConstantFP: 367 case ISD::ConstantFP: { 368 ID.Add(cast<ConstantFPSDNode>(N)->getValueAPF()); 369 break; 370 } 371 case ISD::TargetGlobalAddress: 372 case ISD::GlobalAddress: 373 case ISD::TargetGlobalTLSAddress: 374 case ISD::GlobalTLSAddress: { 375 GlobalAddressSDNode *GA = cast<GlobalAddressSDNode>(N); 376 ID.AddPointer(GA->getGlobal()); 377 ID.AddInteger(GA->getOffset()); 378 break; 379 } 380 case ISD::BasicBlock: 381 ID.AddPointer(cast<BasicBlockSDNode>(N)->getBasicBlock()); 382 break; 383 case ISD::Register: 384 ID.AddInteger(cast<RegisterSDNode>(N)->getReg()); 385 break; 386 case ISD::SRCVALUE: 387 ID.AddPointer(cast<SrcValueSDNode>(N)->getValue()); 388 break; 389 case ISD::MEMOPERAND: { 390 const MemOperand &MO = cast<MemOperandSDNode>(N)->MO; 391 ID.AddPointer(MO.getValue()); 392 ID.AddInteger(MO.getFlags()); 393 ID.AddInteger(MO.getOffset()); 394 ID.AddInteger(MO.getSize()); 395 ID.AddInteger(MO.getAlignment()); 396 break; 397 } 398 case ISD::FrameIndex: 399 case ISD::TargetFrameIndex: 400 ID.AddInteger(cast<FrameIndexSDNode>(N)->getIndex()); 401 break; 402 case ISD::JumpTable: 403 case ISD::TargetJumpTable: 404 ID.AddInteger(cast<JumpTableSDNode>(N)->getIndex()); 405 break; 406 case ISD::ConstantPool: 407 case ISD::TargetConstantPool: { 408 ConstantPoolSDNode *CP = cast<ConstantPoolSDNode>(N); 409 ID.AddInteger(CP->getAlignment()); 410 ID.AddInteger(CP->getOffset()); 411 if (CP->isMachineConstantPoolEntry()) 412 CP->getMachineCPVal()->AddSelectionDAGCSEId(ID); 413 else 414 ID.AddPointer(CP->getConstVal()); 415 break; 416 } 417 case ISD::LOAD: { 418 LoadSDNode *LD = cast<LoadSDNode>(N); 419 ID.AddInteger(LD->getAddressingMode()); 420 ID.AddInteger(LD->getExtensionType()); 421 ID.AddInteger((unsigned int)(LD->getMemoryVT())); 422 ID.AddInteger(LD->getAlignment()); 423 ID.AddInteger(LD->isVolatile()); 424 break; 425 } 426 case ISD::STORE: { 427 StoreSDNode *ST = cast<StoreSDNode>(N); 428 ID.AddInteger(ST->getAddressingMode()); 429 ID.AddInteger(ST->isTruncatingStore()); 430 ID.AddInteger((unsigned int)(ST->getMemoryVT())); 431 ID.AddInteger(ST->getAlignment()); 432 ID.AddInteger(ST->isVolatile()); 433 break; 434 } 435 } 436} 437 438//===----------------------------------------------------------------------===// 439// SelectionDAG Class 440//===----------------------------------------------------------------------===// 441 442/// RemoveDeadNodes - This method deletes all unreachable nodes in the 443/// SelectionDAG. 444void SelectionDAG::RemoveDeadNodes() { 445 // Create a dummy node (which is not added to allnodes), that adds a reference 446 // to the root node, preventing it from being deleted. 447 HandleSDNode Dummy(getRoot()); 448 449 SmallVector<SDNode*, 128> DeadNodes; 450 451 // Add all obviously-dead nodes to the DeadNodes worklist. 452 for (allnodes_iterator I = allnodes_begin(), E = allnodes_end(); I != E; ++I) 453 if (I->use_empty()) 454 DeadNodes.push_back(I); 455 456 // Process the worklist, deleting the nodes and adding their uses to the 457 // worklist. 458 while (!DeadNodes.empty()) { 459 SDNode *N = DeadNodes.back(); 460 DeadNodes.pop_back(); 461 462 // Take the node out of the appropriate CSE map. 463 RemoveNodeFromCSEMaps(N); 464 465 // Next, brutally remove the operand list. This is safe to do, as there are 466 // no cycles in the graph. 467 for (SDNode::op_iterator I = N->op_begin(), E = N->op_end(); I != E; ++I) { 468 SDNode *Operand = I->Val; 469 Operand->removeUser(N); 470 471 // Now that we removed this operand, see if there are no uses of it left. 472 if (Operand->use_empty()) 473 DeadNodes.push_back(Operand); 474 } 475 if (N->OperandsNeedDelete) 476 delete[] N->OperandList; 477 N->OperandList = 0; 478 N->NumOperands = 0; 479 480 // Finally, remove N itself. 481 AllNodes.erase(N); 482 } 483 484 // If the root changed (e.g. it was a dead load, update the root). 485 setRoot(Dummy.getValue()); 486} 487 488void SelectionDAG::RemoveDeadNode(SDNode *N, DAGUpdateListener *UpdateListener){ 489 SmallVector<SDNode*, 16> DeadNodes; 490 DeadNodes.push_back(N); 491 492 // Process the worklist, deleting the nodes and adding their uses to the 493 // worklist. 494 while (!DeadNodes.empty()) { 495 SDNode *N = DeadNodes.back(); 496 DeadNodes.pop_back(); 497 498 if (UpdateListener) 499 UpdateListener->NodeDeleted(N); 500 501 // Take the node out of the appropriate CSE map. 502 RemoveNodeFromCSEMaps(N); 503 504 // Next, brutally remove the operand list. This is safe to do, as there are 505 // no cycles in the graph. 506 for (SDNode::op_iterator I = N->op_begin(), E = N->op_end(); I != E; ++I) { 507 SDNode *Operand = I->Val; 508 Operand->removeUser(N); 509 510 // Now that we removed this operand, see if there are no uses of it left. 511 if (Operand->use_empty()) 512 DeadNodes.push_back(Operand); 513 } 514 if (N->OperandsNeedDelete) 515 delete[] N->OperandList; 516 N->OperandList = 0; 517 N->NumOperands = 0; 518 519 // Finally, remove N itself. 520 AllNodes.erase(N); 521 } 522} 523 524void SelectionDAG::DeleteNode(SDNode *N) { 525 assert(N->use_empty() && "Cannot delete a node that is not dead!"); 526 527 // First take this out of the appropriate CSE map. 528 RemoveNodeFromCSEMaps(N); 529 530 // Finally, remove uses due to operands of this node, remove from the 531 // AllNodes list, and delete the node. 532 DeleteNodeNotInCSEMaps(N); 533} 534 535void SelectionDAG::DeleteNodeNotInCSEMaps(SDNode *N) { 536 537 // Remove it from the AllNodes list. 538 AllNodes.remove(N); 539 540 // Drop all of the operands and decrement used nodes use counts. 541 for (SDNode::op_iterator I = N->op_begin(), E = N->op_end(); I != E; ++I) 542 I->Val->removeUser(N); 543 if (N->OperandsNeedDelete) 544 delete[] N->OperandList; 545 N->OperandList = 0; 546 N->NumOperands = 0; 547 548 delete N; 549} 550 551/// RemoveNodeFromCSEMaps - Take the specified node out of the CSE map that 552/// correspond to it. This is useful when we're about to delete or repurpose 553/// the node. We don't want future request for structurally identical nodes 554/// to return N anymore. 555void SelectionDAG::RemoveNodeFromCSEMaps(SDNode *N) { 556 bool Erased = false; 557 switch (N->getOpcode()) { 558 case ISD::HANDLENODE: return; // noop. 559 case ISD::STRING: 560 Erased = StringNodes.erase(cast<StringSDNode>(N)->getValue()); 561 break; 562 case ISD::CONDCODE: 563 assert(CondCodeNodes[cast<CondCodeSDNode>(N)->get()] && 564 "Cond code doesn't exist!"); 565 Erased = CondCodeNodes[cast<CondCodeSDNode>(N)->get()] != 0; 566 CondCodeNodes[cast<CondCodeSDNode>(N)->get()] = 0; 567 break; 568 case ISD::ExternalSymbol: 569 Erased = ExternalSymbols.erase(cast<ExternalSymbolSDNode>(N)->getSymbol()); 570 break; 571 case ISD::TargetExternalSymbol: 572 Erased = 573 TargetExternalSymbols.erase(cast<ExternalSymbolSDNode>(N)->getSymbol()); 574 break; 575 case ISD::VALUETYPE: { 576 MVT::ValueType VT = cast<VTSDNode>(N)->getVT(); 577 if (MVT::isExtendedVT(VT)) { 578 Erased = ExtendedValueTypeNodes.erase(VT); 579 } else { 580 Erased = ValueTypeNodes[VT] != 0; 581 ValueTypeNodes[VT] = 0; 582 } 583 break; 584 } 585 default: 586 // Remove it from the CSE Map. 587 Erased = CSEMap.RemoveNode(N); 588 break; 589 } 590#ifndef NDEBUG 591 // Verify that the node was actually in one of the CSE maps, unless it has a 592 // flag result (which cannot be CSE'd) or is one of the special cases that are 593 // not subject to CSE. 594 if (!Erased && N->getValueType(N->getNumValues()-1) != MVT::Flag && 595 !N->isTargetOpcode()) { 596 N->dump(this); 597 cerr << "\n"; 598 assert(0 && "Node is not in map!"); 599 } 600#endif 601} 602 603/// AddNonLeafNodeToCSEMaps - Add the specified node back to the CSE maps. It 604/// has been taken out and modified in some way. If the specified node already 605/// exists in the CSE maps, do not modify the maps, but return the existing node 606/// instead. If it doesn't exist, add it and return null. 607/// 608SDNode *SelectionDAG::AddNonLeafNodeToCSEMaps(SDNode *N) { 609 assert(N->getNumOperands() && "This is a leaf node!"); 610 if (N->getOpcode() == ISD::HANDLENODE || N->getValueType(0) == MVT::Flag) 611 return 0; // Never add these nodes. 612 613 // Check that remaining values produced are not flags. 614 for (unsigned i = 1, e = N->getNumValues(); i != e; ++i) 615 if (N->getValueType(i) == MVT::Flag) 616 return 0; // Never CSE anything that produces a flag. 617 618 SDNode *New = CSEMap.GetOrInsertNode(N); 619 if (New != N) return New; // Node already existed. 620 return 0; 621} 622 623/// FindModifiedNodeSlot - Find a slot for the specified node if its operands 624/// were replaced with those specified. If this node is never memoized, 625/// return null, otherwise return a pointer to the slot it would take. If a 626/// node already exists with these operands, the slot will be non-null. 627SDNode *SelectionDAG::FindModifiedNodeSlot(SDNode *N, SDOperand Op, 628 void *&InsertPos) { 629 if (N->getOpcode() == ISD::HANDLENODE || N->getValueType(0) == MVT::Flag) 630 return 0; // Never add these nodes. 631 632 // Check that remaining values produced are not flags. 633 for (unsigned i = 1, e = N->getNumValues(); i != e; ++i) 634 if (N->getValueType(i) == MVT::Flag) 635 return 0; // Never CSE anything that produces a flag. 636 637 SDOperand Ops[] = { Op }; 638 FoldingSetNodeID ID; 639 AddNodeIDNode(ID, N->getOpcode(), N->getVTList(), Ops, 1); 640 return CSEMap.FindNodeOrInsertPos(ID, InsertPos); 641} 642 643/// FindModifiedNodeSlot - Find a slot for the specified node if its operands 644/// were replaced with those specified. If this node is never memoized, 645/// return null, otherwise return a pointer to the slot it would take. If a 646/// node already exists with these operands, the slot will be non-null. 647SDNode *SelectionDAG::FindModifiedNodeSlot(SDNode *N, 648 SDOperand Op1, SDOperand Op2, 649 void *&InsertPos) { 650 if (N->getOpcode() == ISD::HANDLENODE || N->getValueType(0) == MVT::Flag) 651 return 0; // Never add these nodes. 652 653 // Check that remaining values produced are not flags. 654 for (unsigned i = 1, e = N->getNumValues(); i != e; ++i) 655 if (N->getValueType(i) == MVT::Flag) 656 return 0; // Never CSE anything that produces a flag. 657 658 SDOperand Ops[] = { Op1, Op2 }; 659 FoldingSetNodeID ID; 660 AddNodeIDNode(ID, N->getOpcode(), N->getVTList(), Ops, 2); 661 return CSEMap.FindNodeOrInsertPos(ID, InsertPos); 662} 663 664 665/// FindModifiedNodeSlot - Find a slot for the specified node if its operands 666/// were replaced with those specified. If this node is never memoized, 667/// return null, otherwise return a pointer to the slot it would take. If a 668/// node already exists with these operands, the slot will be non-null. 669SDNode *SelectionDAG::FindModifiedNodeSlot(SDNode *N, 670 const SDOperand *Ops,unsigned NumOps, 671 void *&InsertPos) { 672 if (N->getOpcode() == ISD::HANDLENODE || N->getValueType(0) == MVT::Flag) 673 return 0; // Never add these nodes. 674 675 // Check that remaining values produced are not flags. 676 for (unsigned i = 1, e = N->getNumValues(); i != e; ++i) 677 if (N->getValueType(i) == MVT::Flag) 678 return 0; // Never CSE anything that produces a flag. 679 680 FoldingSetNodeID ID; 681 AddNodeIDNode(ID, N->getOpcode(), N->getVTList(), Ops, NumOps); 682 683 if (const LoadSDNode *LD = dyn_cast<LoadSDNode>(N)) { 684 ID.AddInteger(LD->getAddressingMode()); 685 ID.AddInteger(LD->getExtensionType()); 686 ID.AddInteger((unsigned int)(LD->getMemoryVT())); 687 ID.AddInteger(LD->getAlignment()); 688 ID.AddInteger(LD->isVolatile()); 689 } else if (const StoreSDNode *ST = dyn_cast<StoreSDNode>(N)) { 690 ID.AddInteger(ST->getAddressingMode()); 691 ID.AddInteger(ST->isTruncatingStore()); 692 ID.AddInteger((unsigned int)(ST->getMemoryVT())); 693 ID.AddInteger(ST->getAlignment()); 694 ID.AddInteger(ST->isVolatile()); 695 } 696 697 return CSEMap.FindNodeOrInsertPos(ID, InsertPos); 698} 699 700 701SelectionDAG::~SelectionDAG() { 702 while (!AllNodes.empty()) { 703 SDNode *N = AllNodes.begin(); 704 N->SetNextInBucket(0); 705 if (N->OperandsNeedDelete) 706 delete [] N->OperandList; 707 N->OperandList = 0; 708 N->NumOperands = 0; 709 AllNodes.pop_front(); 710 } 711} 712 713SDOperand SelectionDAG::getZeroExtendInReg(SDOperand Op, MVT::ValueType VT) { 714 if (Op.getValueType() == VT) return Op; 715 int64_t Imm = ~0ULL >> (64-MVT::getSizeInBits(VT)); 716 return getNode(ISD::AND, Op.getValueType(), Op, 717 getConstant(Imm, Op.getValueType())); 718} 719 720SDOperand SelectionDAG::getString(const std::string &Val) { 721 StringSDNode *&N = StringNodes[Val]; 722 if (!N) { 723 N = new StringSDNode(Val); 724 AllNodes.push_back(N); 725 } 726 return SDOperand(N, 0); 727} 728 729SDOperand SelectionDAG::getConstant(uint64_t Val, MVT::ValueType VT, bool isT) { 730 MVT::ValueType EltVT = 731 MVT::isVector(VT) ? MVT::getVectorElementType(VT) : VT; 732 733 return getConstant(APInt(MVT::getSizeInBits(EltVT), Val), VT, isT); 734} 735 736SDOperand SelectionDAG::getConstant(const APInt &Val, MVT::ValueType VT, bool isT) { 737 assert(MVT::isInteger(VT) && "Cannot create FP integer constant!"); 738 739 MVT::ValueType EltVT = 740 MVT::isVector(VT) ? MVT::getVectorElementType(VT) : VT; 741 742 assert(Val.getBitWidth() == MVT::getSizeInBits(EltVT) && 743 "APInt size does not match type size!"); 744 745 unsigned Opc = isT ? ISD::TargetConstant : ISD::Constant; 746 FoldingSetNodeID ID; 747 AddNodeIDNode(ID, Opc, getVTList(EltVT), 0, 0); 748 ID.Add(Val); 749 void *IP = 0; 750 SDNode *N = NULL; 751 if ((N = CSEMap.FindNodeOrInsertPos(ID, IP))) 752 if (!MVT::isVector(VT)) 753 return SDOperand(N, 0); 754 if (!N) { 755 N = new ConstantSDNode(isT, Val, EltVT); 756 CSEMap.InsertNode(N, IP); 757 AllNodes.push_back(N); 758 } 759 760 SDOperand Result(N, 0); 761 if (MVT::isVector(VT)) { 762 SmallVector<SDOperand, 8> Ops; 763 Ops.assign(MVT::getVectorNumElements(VT), Result); 764 Result = getNode(ISD::BUILD_VECTOR, VT, &Ops[0], Ops.size()); 765 } 766 return Result; 767} 768 769SDOperand SelectionDAG::getIntPtrConstant(uint64_t Val, bool isTarget) { 770 return getConstant(Val, TLI.getPointerTy(), isTarget); 771} 772 773 774SDOperand SelectionDAG::getConstantFP(const APFloat& V, MVT::ValueType VT, 775 bool isTarget) { 776 assert(MVT::isFloatingPoint(VT) && "Cannot create integer FP constant!"); 777 778 MVT::ValueType EltVT = 779 MVT::isVector(VT) ? MVT::getVectorElementType(VT) : VT; 780 781 // Do the map lookup using the actual bit pattern for the floating point 782 // value, so that we don't have problems with 0.0 comparing equal to -0.0, and 783 // we don't have issues with SNANs. 784 unsigned Opc = isTarget ? ISD::TargetConstantFP : ISD::ConstantFP; 785 FoldingSetNodeID ID; 786 AddNodeIDNode(ID, Opc, getVTList(EltVT), 0, 0); 787 ID.Add(V); 788 void *IP = 0; 789 SDNode *N = NULL; 790 if ((N = CSEMap.FindNodeOrInsertPos(ID, IP))) 791 if (!MVT::isVector(VT)) 792 return SDOperand(N, 0); 793 if (!N) { 794 N = new ConstantFPSDNode(isTarget, V, EltVT); 795 CSEMap.InsertNode(N, IP); 796 AllNodes.push_back(N); 797 } 798 799 SDOperand Result(N, 0); 800 if (MVT::isVector(VT)) { 801 SmallVector<SDOperand, 8> Ops; 802 Ops.assign(MVT::getVectorNumElements(VT), Result); 803 Result = getNode(ISD::BUILD_VECTOR, VT, &Ops[0], Ops.size()); 804 } 805 return Result; 806} 807 808SDOperand SelectionDAG::getConstantFP(double Val, MVT::ValueType VT, 809 bool isTarget) { 810 MVT::ValueType EltVT = 811 MVT::isVector(VT) ? MVT::getVectorElementType(VT) : VT; 812 if (EltVT==MVT::f32) 813 return getConstantFP(APFloat((float)Val), VT, isTarget); 814 else 815 return getConstantFP(APFloat(Val), VT, isTarget); 816} 817 818SDOperand SelectionDAG::getGlobalAddress(const GlobalValue *GV, 819 MVT::ValueType VT, int Offset, 820 bool isTargetGA) { 821 const GlobalVariable *GVar = dyn_cast<GlobalVariable>(GV); 822 unsigned Opc; 823 if (GVar && GVar->isThreadLocal()) 824 Opc = isTargetGA ? ISD::TargetGlobalTLSAddress : ISD::GlobalTLSAddress; 825 else 826 Opc = isTargetGA ? ISD::TargetGlobalAddress : ISD::GlobalAddress; 827 FoldingSetNodeID ID; 828 AddNodeIDNode(ID, Opc, getVTList(VT), 0, 0); 829 ID.AddPointer(GV); 830 ID.AddInteger(Offset); 831 void *IP = 0; 832 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP)) 833 return SDOperand(E, 0); 834 SDNode *N = new GlobalAddressSDNode(isTargetGA, GV, VT, Offset); 835 CSEMap.InsertNode(N, IP); 836 AllNodes.push_back(N); 837 return SDOperand(N, 0); 838} 839 840SDOperand SelectionDAG::getFrameIndex(int FI, MVT::ValueType VT, 841 bool isTarget) { 842 unsigned Opc = isTarget ? ISD::TargetFrameIndex : ISD::FrameIndex; 843 FoldingSetNodeID ID; 844 AddNodeIDNode(ID, Opc, getVTList(VT), 0, 0); 845 ID.AddInteger(FI); 846 void *IP = 0; 847 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP)) 848 return SDOperand(E, 0); 849 SDNode *N = new FrameIndexSDNode(FI, VT, isTarget); 850 CSEMap.InsertNode(N, IP); 851 AllNodes.push_back(N); 852 return SDOperand(N, 0); 853} 854 855SDOperand SelectionDAG::getJumpTable(int JTI, MVT::ValueType VT, bool isTarget){ 856 unsigned Opc = isTarget ? ISD::TargetJumpTable : ISD::JumpTable; 857 FoldingSetNodeID ID; 858 AddNodeIDNode(ID, Opc, getVTList(VT), 0, 0); 859 ID.AddInteger(JTI); 860 void *IP = 0; 861 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP)) 862 return SDOperand(E, 0); 863 SDNode *N = new JumpTableSDNode(JTI, VT, isTarget); 864 CSEMap.InsertNode(N, IP); 865 AllNodes.push_back(N); 866 return SDOperand(N, 0); 867} 868 869SDOperand SelectionDAG::getConstantPool(Constant *C, MVT::ValueType VT, 870 unsigned Alignment, int Offset, 871 bool isTarget) { 872 unsigned Opc = isTarget ? ISD::TargetConstantPool : ISD::ConstantPool; 873 FoldingSetNodeID ID; 874 AddNodeIDNode(ID, Opc, getVTList(VT), 0, 0); 875 ID.AddInteger(Alignment); 876 ID.AddInteger(Offset); 877 ID.AddPointer(C); 878 void *IP = 0; 879 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP)) 880 return SDOperand(E, 0); 881 SDNode *N = new ConstantPoolSDNode(isTarget, C, VT, Offset, Alignment); 882 CSEMap.InsertNode(N, IP); 883 AllNodes.push_back(N); 884 return SDOperand(N, 0); 885} 886 887 888SDOperand SelectionDAG::getConstantPool(MachineConstantPoolValue *C, 889 MVT::ValueType VT, 890 unsigned Alignment, int Offset, 891 bool isTarget) { 892 unsigned Opc = isTarget ? ISD::TargetConstantPool : ISD::ConstantPool; 893 FoldingSetNodeID ID; 894 AddNodeIDNode(ID, Opc, getVTList(VT), 0, 0); 895 ID.AddInteger(Alignment); 896 ID.AddInteger(Offset); 897 C->AddSelectionDAGCSEId(ID); 898 void *IP = 0; 899 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP)) 900 return SDOperand(E, 0); 901 SDNode *N = new ConstantPoolSDNode(isTarget, C, VT, Offset, Alignment); 902 CSEMap.InsertNode(N, IP); 903 AllNodes.push_back(N); 904 return SDOperand(N, 0); 905} 906 907 908SDOperand SelectionDAG::getBasicBlock(MachineBasicBlock *MBB) { 909 FoldingSetNodeID ID; 910 AddNodeIDNode(ID, ISD::BasicBlock, getVTList(MVT::Other), 0, 0); 911 ID.AddPointer(MBB); 912 void *IP = 0; 913 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP)) 914 return SDOperand(E, 0); 915 SDNode *N = new BasicBlockSDNode(MBB); 916 CSEMap.InsertNode(N, IP); 917 AllNodes.push_back(N); 918 return SDOperand(N, 0); 919} 920 921SDOperand SelectionDAG::getValueType(MVT::ValueType VT) { 922 if (!MVT::isExtendedVT(VT) && (unsigned)VT >= ValueTypeNodes.size()) 923 ValueTypeNodes.resize(VT+1); 924 925 SDNode *&N = MVT::isExtendedVT(VT) ? 926 ExtendedValueTypeNodes[VT] : ValueTypeNodes[VT]; 927 928 if (N) return SDOperand(N, 0); 929 N = new VTSDNode(VT); 930 AllNodes.push_back(N); 931 return SDOperand(N, 0); 932} 933 934SDOperand SelectionDAG::getExternalSymbol(const char *Sym, MVT::ValueType VT) { 935 SDNode *&N = ExternalSymbols[Sym]; 936 if (N) return SDOperand(N, 0); 937 N = new ExternalSymbolSDNode(false, Sym, VT); 938 AllNodes.push_back(N); 939 return SDOperand(N, 0); 940} 941 942SDOperand SelectionDAG::getTargetExternalSymbol(const char *Sym, 943 MVT::ValueType VT) { 944 SDNode *&N = TargetExternalSymbols[Sym]; 945 if (N) return SDOperand(N, 0); 946 N = new ExternalSymbolSDNode(true, Sym, VT); 947 AllNodes.push_back(N); 948 return SDOperand(N, 0); 949} 950 951SDOperand SelectionDAG::getCondCode(ISD::CondCode Cond) { 952 if ((unsigned)Cond >= CondCodeNodes.size()) 953 CondCodeNodes.resize(Cond+1); 954 955 if (CondCodeNodes[Cond] == 0) { 956 CondCodeNodes[Cond] = new CondCodeSDNode(Cond); 957 AllNodes.push_back(CondCodeNodes[Cond]); 958 } 959 return SDOperand(CondCodeNodes[Cond], 0); 960} 961 962SDOperand SelectionDAG::getRegister(unsigned RegNo, MVT::ValueType VT) { 963 FoldingSetNodeID ID; 964 AddNodeIDNode(ID, ISD::Register, getVTList(VT), 0, 0); 965 ID.AddInteger(RegNo); 966 void *IP = 0; 967 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP)) 968 return SDOperand(E, 0); 969 SDNode *N = new RegisterSDNode(RegNo, VT); 970 CSEMap.InsertNode(N, IP); 971 AllNodes.push_back(N); 972 return SDOperand(N, 0); 973} 974 975SDOperand SelectionDAG::getSrcValue(const Value *V) { 976 assert((!V || isa<PointerType>(V->getType())) && 977 "SrcValue is not a pointer?"); 978 979 FoldingSetNodeID ID; 980 AddNodeIDNode(ID, ISD::SRCVALUE, getVTList(MVT::Other), 0, 0); 981 ID.AddPointer(V); 982 983 void *IP = 0; 984 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP)) 985 return SDOperand(E, 0); 986 987 SDNode *N = new SrcValueSDNode(V); 988 CSEMap.InsertNode(N, IP); 989 AllNodes.push_back(N); 990 return SDOperand(N, 0); 991} 992 993SDOperand SelectionDAG::getMemOperand(const MemOperand &MO) { 994 const Value *v = MO.getValue(); 995 assert((!v || isa<PointerType>(v->getType())) && 996 "SrcValue is not a pointer?"); 997 998 FoldingSetNodeID ID; 999 AddNodeIDNode(ID, ISD::MEMOPERAND, getVTList(MVT::Other), 0, 0); 1000 ID.AddPointer(v); 1001 ID.AddInteger(MO.getFlags()); 1002 ID.AddInteger(MO.getOffset()); 1003 ID.AddInteger(MO.getSize()); 1004 ID.AddInteger(MO.getAlignment()); 1005 1006 void *IP = 0; 1007 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP)) 1008 return SDOperand(E, 0); 1009 1010 SDNode *N = new MemOperandSDNode(MO); 1011 CSEMap.InsertNode(N, IP); 1012 AllNodes.push_back(N); 1013 return SDOperand(N, 0); 1014} 1015 1016/// CreateStackTemporary - Create a stack temporary, suitable for holding the 1017/// specified value type. 1018SDOperand SelectionDAG::CreateStackTemporary(MVT::ValueType VT) { 1019 MachineFrameInfo *FrameInfo = getMachineFunction().getFrameInfo(); 1020 unsigned ByteSize = MVT::getSizeInBits(VT)/8; 1021 const Type *Ty = MVT::getTypeForValueType(VT); 1022 unsigned StackAlign = (unsigned)TLI.getTargetData()->getPrefTypeAlignment(Ty); 1023 int FrameIdx = FrameInfo->CreateStackObject(ByteSize, StackAlign); 1024 return getFrameIndex(FrameIdx, TLI.getPointerTy()); 1025} 1026 1027 1028SDOperand SelectionDAG::FoldSetCC(MVT::ValueType VT, SDOperand N1, 1029 SDOperand N2, ISD::CondCode Cond) { 1030 // These setcc operations always fold. 1031 switch (Cond) { 1032 default: break; 1033 case ISD::SETFALSE: 1034 case ISD::SETFALSE2: return getConstant(0, VT); 1035 case ISD::SETTRUE: 1036 case ISD::SETTRUE2: return getConstant(1, VT); 1037 1038 case ISD::SETOEQ: 1039 case ISD::SETOGT: 1040 case ISD::SETOGE: 1041 case ISD::SETOLT: 1042 case ISD::SETOLE: 1043 case ISD::SETONE: 1044 case ISD::SETO: 1045 case ISD::SETUO: 1046 case ISD::SETUEQ: 1047 case ISD::SETUNE: 1048 assert(!MVT::isInteger(N1.getValueType()) && "Illegal setcc for integer!"); 1049 break; 1050 } 1051 1052 if (ConstantSDNode *N2C = dyn_cast<ConstantSDNode>(N2.Val)) { 1053 uint64_t C2 = N2C->getValue(); 1054 if (ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1.Val)) { 1055 uint64_t C1 = N1C->getValue(); 1056 1057 // Sign extend the operands if required 1058 if (ISD::isSignedIntSetCC(Cond)) { 1059 C1 = N1C->getSignExtended(); 1060 C2 = N2C->getSignExtended(); 1061 } 1062 1063 switch (Cond) { 1064 default: assert(0 && "Unknown integer setcc!"); 1065 case ISD::SETEQ: return getConstant(C1 == C2, VT); 1066 case ISD::SETNE: return getConstant(C1 != C2, VT); 1067 case ISD::SETULT: return getConstant(C1 < C2, VT); 1068 case ISD::SETUGT: return getConstant(C1 > C2, VT); 1069 case ISD::SETULE: return getConstant(C1 <= C2, VT); 1070 case ISD::SETUGE: return getConstant(C1 >= C2, VT); 1071 case ISD::SETLT: return getConstant((int64_t)C1 < (int64_t)C2, VT); 1072 case ISD::SETGT: return getConstant((int64_t)C1 > (int64_t)C2, VT); 1073 case ISD::SETLE: return getConstant((int64_t)C1 <= (int64_t)C2, VT); 1074 case ISD::SETGE: return getConstant((int64_t)C1 >= (int64_t)C2, VT); 1075 } 1076 } 1077 } 1078 if (ConstantFPSDNode *N1C = dyn_cast<ConstantFPSDNode>(N1.Val)) { 1079 if (ConstantFPSDNode *N2C = dyn_cast<ConstantFPSDNode>(N2.Val)) { 1080 // No compile time operations on this type yet. 1081 if (N1C->getValueType(0) == MVT::ppcf128) 1082 return SDOperand(); 1083 1084 APFloat::cmpResult R = N1C->getValueAPF().compare(N2C->getValueAPF()); 1085 switch (Cond) { 1086 default: break; 1087 case ISD::SETEQ: if (R==APFloat::cmpUnordered) 1088 return getNode(ISD::UNDEF, VT); 1089 // fall through 1090 case ISD::SETOEQ: return getConstant(R==APFloat::cmpEqual, VT); 1091 case ISD::SETNE: if (R==APFloat::cmpUnordered) 1092 return getNode(ISD::UNDEF, VT); 1093 // fall through 1094 case ISD::SETONE: return getConstant(R==APFloat::cmpGreaterThan || 1095 R==APFloat::cmpLessThan, VT); 1096 case ISD::SETLT: if (R==APFloat::cmpUnordered) 1097 return getNode(ISD::UNDEF, VT); 1098 // fall through 1099 case ISD::SETOLT: return getConstant(R==APFloat::cmpLessThan, VT); 1100 case ISD::SETGT: if (R==APFloat::cmpUnordered) 1101 return getNode(ISD::UNDEF, VT); 1102 // fall through 1103 case ISD::SETOGT: return getConstant(R==APFloat::cmpGreaterThan, VT); 1104 case ISD::SETLE: if (R==APFloat::cmpUnordered) 1105 return getNode(ISD::UNDEF, VT); 1106 // fall through 1107 case ISD::SETOLE: return getConstant(R==APFloat::cmpLessThan || 1108 R==APFloat::cmpEqual, VT); 1109 case ISD::SETGE: if (R==APFloat::cmpUnordered) 1110 return getNode(ISD::UNDEF, VT); 1111 // fall through 1112 case ISD::SETOGE: return getConstant(R==APFloat::cmpGreaterThan || 1113 R==APFloat::cmpEqual, VT); 1114 case ISD::SETO: return getConstant(R!=APFloat::cmpUnordered, VT); 1115 case ISD::SETUO: return getConstant(R==APFloat::cmpUnordered, VT); 1116 case ISD::SETUEQ: return getConstant(R==APFloat::cmpUnordered || 1117 R==APFloat::cmpEqual, VT); 1118 case ISD::SETUNE: return getConstant(R!=APFloat::cmpEqual, VT); 1119 case ISD::SETULT: return getConstant(R==APFloat::cmpUnordered || 1120 R==APFloat::cmpLessThan, VT); 1121 case ISD::SETUGT: return getConstant(R==APFloat::cmpGreaterThan || 1122 R==APFloat::cmpUnordered, VT); 1123 case ISD::SETULE: return getConstant(R!=APFloat::cmpGreaterThan, VT); 1124 case ISD::SETUGE: return getConstant(R!=APFloat::cmpLessThan, VT); 1125 } 1126 } else { 1127 // Ensure that the constant occurs on the RHS. 1128 return getSetCC(VT, N2, N1, ISD::getSetCCSwappedOperands(Cond)); 1129 } 1130 } 1131 1132 // Could not fold it. 1133 return SDOperand(); 1134} 1135 1136/// MaskedValueIsZero - Return true if 'V & Mask' is known to be zero. We use 1137/// this predicate to simplify operations downstream. Mask is known to be zero 1138/// for bits that V cannot have. 1139bool SelectionDAG::MaskedValueIsZero(SDOperand Op, uint64_t Mask, 1140 unsigned Depth) const { 1141 // The masks are not wide enough to represent this type! Should use APInt. 1142 if (Op.getValueType() == MVT::i128) 1143 return false; 1144 1145 uint64_t KnownZero, KnownOne; 1146 ComputeMaskedBits(Op, Mask, KnownZero, KnownOne, Depth); 1147 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?"); 1148 return (KnownZero & Mask) == Mask; 1149} 1150 1151/// ComputeMaskedBits - Determine which of the bits specified in Mask are 1152/// known to be either zero or one and return them in the KnownZero/KnownOne 1153/// bitsets. This code only analyzes bits in Mask, in order to short-circuit 1154/// processing. 1155void SelectionDAG::ComputeMaskedBits(SDOperand Op, const APInt &Mask, 1156 APInt &KnownZero, APInt &KnownOne, 1157 unsigned Depth) const { 1158 unsigned BitWidth = Mask.getBitWidth(); 1159 assert(BitWidth == MVT::getSizeInBits(Op.getValueType()) && 1160 "Mask size mismatches value type size!"); 1161 1162 KnownZero = KnownOne = APInt(BitWidth, 0); // Don't know anything. 1163 if (Depth == 6 || Mask == 0) 1164 return; // Limit search depth. 1165 1166 APInt KnownZero2, KnownOne2; 1167 1168 switch (Op.getOpcode()) { 1169 case ISD::Constant: 1170 // We know all of the bits for a constant! 1171 KnownOne = cast<ConstantSDNode>(Op)->getAPIntValue() & Mask; 1172 KnownZero = ~KnownOne & Mask; 1173 return; 1174 case ISD::AND: 1175 // If either the LHS or the RHS are Zero, the result is zero. 1176 ComputeMaskedBits(Op.getOperand(1), Mask, KnownZero, KnownOne, Depth+1); 1177 ComputeMaskedBits(Op.getOperand(0), Mask & ~KnownZero, 1178 KnownZero2, KnownOne2, Depth+1); 1179 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?"); 1180 assert((KnownZero2 & KnownOne2) == 0 && "Bits known to be one AND zero?"); 1181 1182 // Output known-1 bits are only known if set in both the LHS & RHS. 1183 KnownOne &= KnownOne2; 1184 // Output known-0 are known to be clear if zero in either the LHS | RHS. 1185 KnownZero |= KnownZero2; 1186 return; 1187 case ISD::OR: 1188 ComputeMaskedBits(Op.getOperand(1), Mask, KnownZero, KnownOne, Depth+1); 1189 ComputeMaskedBits(Op.getOperand(0), Mask & ~KnownOne, 1190 KnownZero2, KnownOne2, Depth+1); 1191 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?"); 1192 assert((KnownZero2 & KnownOne2) == 0 && "Bits known to be one AND zero?"); 1193 1194 // Output known-0 bits are only known if clear in both the LHS & RHS. 1195 KnownZero &= KnownZero2; 1196 // Output known-1 are known to be set if set in either the LHS | RHS. 1197 KnownOne |= KnownOne2; 1198 return; 1199 case ISD::XOR: { 1200 ComputeMaskedBits(Op.getOperand(1), Mask, KnownZero, KnownOne, Depth+1); 1201 ComputeMaskedBits(Op.getOperand(0), Mask, KnownZero2, KnownOne2, Depth+1); 1202 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?"); 1203 assert((KnownZero2 & KnownOne2) == 0 && "Bits known to be one AND zero?"); 1204 1205 // Output known-0 bits are known if clear or set in both the LHS & RHS. 1206 APInt KnownZeroOut = (KnownZero & KnownZero2) | (KnownOne & KnownOne2); 1207 // Output known-1 are known to be set if set in only one of the LHS, RHS. 1208 KnownOne = (KnownZero & KnownOne2) | (KnownOne & KnownZero2); 1209 KnownZero = KnownZeroOut; 1210 return; 1211 } 1212 case ISD::SELECT: 1213 ComputeMaskedBits(Op.getOperand(2), Mask, KnownZero, KnownOne, Depth+1); 1214 ComputeMaskedBits(Op.getOperand(1), Mask, KnownZero2, KnownOne2, Depth+1); 1215 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?"); 1216 assert((KnownZero2 & KnownOne2) == 0 && "Bits known to be one AND zero?"); 1217 1218 // Only known if known in both the LHS and RHS. 1219 KnownOne &= KnownOne2; 1220 KnownZero &= KnownZero2; 1221 return; 1222 case ISD::SELECT_CC: 1223 ComputeMaskedBits(Op.getOperand(3), Mask, KnownZero, KnownOne, Depth+1); 1224 ComputeMaskedBits(Op.getOperand(2), Mask, KnownZero2, KnownOne2, Depth+1); 1225 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?"); 1226 assert((KnownZero2 & KnownOne2) == 0 && "Bits known to be one AND zero?"); 1227 1228 // Only known if known in both the LHS and RHS. 1229 KnownOne &= KnownOne2; 1230 KnownZero &= KnownZero2; 1231 return; 1232 case ISD::SETCC: 1233 // If we know the result of a setcc has the top bits zero, use this info. 1234 if (TLI.getSetCCResultContents() == TargetLowering::ZeroOrOneSetCCResult && 1235 BitWidth > 1) 1236 KnownZero |= APInt::getHighBitsSet(BitWidth, BitWidth - 1); 1237 return; 1238 case ISD::SHL: 1239 // (shl X, C1) & C2 == 0 iff (X & C2 >>u C1) == 0 1240 if (ConstantSDNode *SA = dyn_cast<ConstantSDNode>(Op.getOperand(1))) { 1241 ComputeMaskedBits(Op.getOperand(0), Mask.lshr(SA->getValue()), 1242 KnownZero, KnownOne, Depth+1); 1243 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?"); 1244 KnownZero <<= SA->getValue(); 1245 KnownOne <<= SA->getValue(); 1246 // low bits known zero. 1247 KnownZero |= APInt::getLowBitsSet(BitWidth, SA->getValue()); 1248 } 1249 return; 1250 case ISD::SRL: 1251 // (ushr X, C1) & C2 == 0 iff (-1 >> C1) & C2 == 0 1252 if (ConstantSDNode *SA = dyn_cast<ConstantSDNode>(Op.getOperand(1))) { 1253 unsigned ShAmt = SA->getValue(); 1254 1255 ComputeMaskedBits(Op.getOperand(0), (Mask << ShAmt), 1256 KnownZero, KnownOne, Depth+1); 1257 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?"); 1258 KnownZero = KnownZero.lshr(ShAmt); 1259 KnownOne = KnownOne.lshr(ShAmt); 1260 1261 APInt HighBits = APInt::getHighBitsSet(BitWidth, ShAmt) & Mask; 1262 KnownZero |= HighBits; // High bits known zero. 1263 } 1264 return; 1265 case ISD::SRA: 1266 if (ConstantSDNode *SA = dyn_cast<ConstantSDNode>(Op.getOperand(1))) { 1267 unsigned ShAmt = SA->getValue(); 1268 1269 APInt InDemandedMask = (Mask << ShAmt); 1270 // If any of the demanded bits are produced by the sign extension, we also 1271 // demand the input sign bit. 1272 APInt HighBits = APInt::getHighBitsSet(BitWidth, ShAmt) & Mask; 1273 if (HighBits.getBoolValue()) 1274 InDemandedMask |= APInt::getSignBit(BitWidth); 1275 1276 ComputeMaskedBits(Op.getOperand(0), InDemandedMask, KnownZero, KnownOne, 1277 Depth+1); 1278 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?"); 1279 KnownZero = KnownZero.lshr(ShAmt); 1280 KnownOne = KnownOne.lshr(ShAmt); 1281 1282 // Handle the sign bits. 1283 APInt SignBit = APInt::getSignBit(BitWidth); 1284 SignBit = SignBit.lshr(ShAmt); // Adjust to where it is now in the mask. 1285 1286 if (KnownZero.intersects(SignBit)) { 1287 KnownZero |= HighBits; // New bits are known zero. 1288 } else if (KnownOne.intersects(SignBit)) { 1289 KnownOne |= HighBits; // New bits are known one. 1290 } 1291 } 1292 return; 1293 case ISD::SIGN_EXTEND_INREG: { 1294 MVT::ValueType EVT = cast<VTSDNode>(Op.getOperand(1))->getVT(); 1295 unsigned EBits = MVT::getSizeInBits(EVT); 1296 1297 // Sign extension. Compute the demanded bits in the result that are not 1298 // present in the input. 1299 APInt NewBits = APInt::getHighBitsSet(BitWidth, BitWidth - EBits) & Mask; 1300 1301 APInt InSignBit = APInt::getSignBit(EBits); 1302 APInt InputDemandedBits = Mask & APInt::getLowBitsSet(BitWidth, EBits); 1303 1304 // If the sign extended bits are demanded, we know that the sign 1305 // bit is demanded. 1306 InSignBit.zext(BitWidth); 1307 if (NewBits.getBoolValue()) 1308 InputDemandedBits |= InSignBit; 1309 1310 ComputeMaskedBits(Op.getOperand(0), InputDemandedBits, 1311 KnownZero, KnownOne, Depth+1); 1312 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?"); 1313 1314 // If the sign bit of the input is known set or clear, then we know the 1315 // top bits of the result. 1316 if (KnownZero.intersects(InSignBit)) { // Input sign bit known clear 1317 KnownZero |= NewBits; 1318 KnownOne &= ~NewBits; 1319 } else if (KnownOne.intersects(InSignBit)) { // Input sign bit known set 1320 KnownOne |= NewBits; 1321 KnownZero &= ~NewBits; 1322 } else { // Input sign bit unknown 1323 KnownZero &= ~NewBits; 1324 KnownOne &= ~NewBits; 1325 } 1326 return; 1327 } 1328 case ISD::CTTZ: 1329 case ISD::CTLZ: 1330 case ISD::CTPOP: { 1331 unsigned LowBits = Log2_32(BitWidth)+1; 1332 KnownZero = APInt::getHighBitsSet(BitWidth, BitWidth - LowBits); 1333 KnownOne = APInt(BitWidth, 0); 1334 return; 1335 } 1336 case ISD::LOAD: { 1337 if (ISD::isZEXTLoad(Op.Val)) { 1338 LoadSDNode *LD = cast<LoadSDNode>(Op); 1339 MVT::ValueType VT = LD->getMemoryVT(); 1340 unsigned MemBits = MVT::getSizeInBits(VT); 1341 KnownZero |= APInt::getHighBitsSet(BitWidth, BitWidth - MemBits) & Mask; 1342 } 1343 return; 1344 } 1345 case ISD::ZERO_EXTEND: { 1346 MVT::ValueType InVT = Op.getOperand(0).getValueType(); 1347 unsigned InBits = MVT::getSizeInBits(InVT); 1348 APInt NewBits = APInt::getHighBitsSet(BitWidth, BitWidth - InBits) & Mask; 1349 APInt InMask = Mask; 1350 InMask.trunc(InBits); 1351 KnownZero.trunc(InBits); 1352 KnownOne.trunc(InBits); 1353 ComputeMaskedBits(Op.getOperand(0), InMask, KnownZero, KnownOne, Depth+1); 1354 KnownZero.zext(BitWidth); 1355 KnownOne.zext(BitWidth); 1356 KnownZero |= NewBits; 1357 return; 1358 } 1359 case ISD::SIGN_EXTEND: { 1360 MVT::ValueType InVT = Op.getOperand(0).getValueType(); 1361 unsigned InBits = MVT::getSizeInBits(InVT); 1362 APInt InSignBit = APInt::getSignBit(InBits); 1363 APInt NewBits = APInt::getHighBitsSet(BitWidth, BitWidth - InBits) & Mask; 1364 APInt InMask = Mask; 1365 InMask.trunc(InBits); 1366 1367 // If any of the sign extended bits are demanded, we know that the sign 1368 // bit is demanded. Temporarily set this bit in the mask for our callee. 1369 if (NewBits.getBoolValue()) 1370 InMask |= InSignBit; 1371 1372 KnownZero.trunc(InBits); 1373 KnownOne.trunc(InBits); 1374 ComputeMaskedBits(Op.getOperand(0), InMask, KnownZero, KnownOne, Depth+1); 1375 1376 // Note if the sign bit is known to be zero or one. 1377 bool SignBitKnownZero = KnownZero.isNegative(); 1378 bool SignBitKnownOne = KnownOne.isNegative(); 1379 assert(!(SignBitKnownZero && SignBitKnownOne) && 1380 "Sign bit can't be known to be both zero and one!"); 1381 1382 // If the sign bit wasn't actually demanded by our caller, we don't 1383 // want it set in the KnownZero and KnownOne result values. Reset the 1384 // mask and reapply it to the result values. 1385 InMask = Mask; 1386 InMask.trunc(InBits); 1387 KnownZero &= InMask; 1388 KnownOne &= InMask; 1389 1390 KnownZero.zext(BitWidth); 1391 KnownOne.zext(BitWidth); 1392 1393 // If the sign bit is known zero or one, the top bits match. 1394 if (SignBitKnownZero) 1395 KnownZero |= NewBits; 1396 else if (SignBitKnownOne) 1397 KnownOne |= NewBits; 1398 return; 1399 } 1400 case ISD::ANY_EXTEND: { 1401 MVT::ValueType InVT = Op.getOperand(0).getValueType(); 1402 unsigned InBits = MVT::getSizeInBits(InVT); 1403 APInt InMask = Mask; 1404 InMask.trunc(InBits); 1405 KnownZero.trunc(InBits); 1406 KnownOne.trunc(InBits); 1407 ComputeMaskedBits(Op.getOperand(0), InMask, KnownZero, KnownOne, Depth+1); 1408 KnownZero.zext(BitWidth); 1409 KnownOne.zext(BitWidth); 1410 return; 1411 } 1412 case ISD::TRUNCATE: { 1413 MVT::ValueType InVT = Op.getOperand(0).getValueType(); 1414 unsigned InBits = MVT::getSizeInBits(InVT); 1415 APInt InMask = Mask; 1416 InMask.zext(InBits); 1417 KnownZero.zext(InBits); 1418 KnownOne.zext(InBits); 1419 ComputeMaskedBits(Op.getOperand(0), InMask, KnownZero, KnownOne, Depth+1); 1420 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?"); 1421 KnownZero.trunc(BitWidth); 1422 KnownOne.trunc(BitWidth); 1423 break; 1424 } 1425 case ISD::AssertZext: { 1426 MVT::ValueType VT = cast<VTSDNode>(Op.getOperand(1))->getVT(); 1427 APInt InMask = APInt::getLowBitsSet(BitWidth, MVT::getSizeInBits(VT)); 1428 ComputeMaskedBits(Op.getOperand(0), Mask & InMask, KnownZero, 1429 KnownOne, Depth+1); 1430 KnownZero |= (~InMask) & Mask; 1431 return; 1432 } 1433 case ISD::FGETSIGN: 1434 // All bits are zero except the low bit. 1435 KnownZero = APInt::getHighBitsSet(BitWidth, BitWidth - 1); 1436 return; 1437 1438 case ISD::ADD: { 1439 // If either the LHS or the RHS are Zero, the result is zero. 1440 ComputeMaskedBits(Op.getOperand(1), Mask, KnownZero, KnownOne, Depth+1); 1441 ComputeMaskedBits(Op.getOperand(0), Mask, KnownZero2, KnownOne2, Depth+1); 1442 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?"); 1443 assert((KnownZero2 & KnownOne2) == 0 && "Bits known to be one AND zero?"); 1444 1445 // Output known-0 bits are known if clear or set in both the low clear bits 1446 // common to both LHS & RHS. For example, 8+(X<<3) is known to have the 1447 // low 3 bits clear. 1448 unsigned KnownZeroOut = std::min(KnownZero.countTrailingOnes(), 1449 KnownZero2.countTrailingOnes()); 1450 1451 KnownZero = APInt::getLowBitsSet(BitWidth, KnownZeroOut); 1452 KnownOne = APInt(BitWidth, 0); 1453 return; 1454 } 1455 case ISD::SUB: { 1456 ConstantSDNode *CLHS = dyn_cast<ConstantSDNode>(Op.getOperand(0)); 1457 if (!CLHS) return; 1458 1459 // We know that the top bits of C-X are clear if X contains less bits 1460 // than C (i.e. no wrap-around can happen). For example, 20-X is 1461 // positive if we can prove that X is >= 0 and < 16. 1462 if (CLHS->getAPIntValue().isNonNegative()) { 1463 unsigned NLZ = (CLHS->getAPIntValue()+1).countLeadingZeros(); 1464 // NLZ can't be BitWidth with no sign bit 1465 APInt MaskV = APInt::getHighBitsSet(BitWidth, NLZ+1); 1466 ComputeMaskedBits(Op.getOperand(1), MaskV, KnownZero, KnownOne, Depth+1); 1467 1468 // If all of the MaskV bits are known to be zero, then we know the output 1469 // top bits are zero, because we now know that the output is from [0-C]. 1470 if ((KnownZero & MaskV) == MaskV) { 1471 unsigned NLZ2 = CLHS->getAPIntValue().countLeadingZeros(); 1472 // Top bits known zero. 1473 KnownZero = APInt::getHighBitsSet(BitWidth, NLZ2) & Mask; 1474 KnownOne = APInt(BitWidth, 0); // No one bits known. 1475 } else { 1476 KnownZero = KnownOne = APInt(BitWidth, 0); // Otherwise, nothing known. 1477 } 1478 } 1479 return; 1480 } 1481 default: 1482 // Allow the target to implement this method for its nodes. 1483 if (Op.getOpcode() >= ISD::BUILTIN_OP_END) { 1484 case ISD::INTRINSIC_WO_CHAIN: 1485 case ISD::INTRINSIC_W_CHAIN: 1486 case ISD::INTRINSIC_VOID: 1487 TLI.computeMaskedBitsForTargetNode(Op, Mask, KnownZero, KnownOne, *this); 1488 } 1489 return; 1490 } 1491} 1492 1493/// ComputeMaskedBits - This is a wrapper around the APInt-using 1494/// form of ComputeMaskedBits for use by clients that haven't been converted 1495/// to APInt yet. 1496void SelectionDAG::ComputeMaskedBits(SDOperand Op, uint64_t Mask, 1497 uint64_t &KnownZero, uint64_t &KnownOne, 1498 unsigned Depth) const { 1499 // The masks are not wide enough to represent this type! Should use APInt. 1500 if (Op.getValueType() == MVT::i128) 1501 return; 1502 1503 unsigned NumBits = MVT::getSizeInBits(Op.getValueType()); 1504 APInt APIntMask(NumBits, Mask); 1505 APInt APIntKnownZero(NumBits, 0); 1506 APInt APIntKnownOne(NumBits, 0); 1507 ComputeMaskedBits(Op, APIntMask, APIntKnownZero, APIntKnownOne, Depth); 1508 KnownZero = APIntKnownZero.getZExtValue(); 1509 KnownOne = APIntKnownOne.getZExtValue(); 1510} 1511 1512/// ComputeNumSignBits - Return the number of times the sign bit of the 1513/// register is replicated into the other bits. We know that at least 1 bit 1514/// is always equal to the sign bit (itself), but other cases can give us 1515/// information. For example, immediately after an "SRA X, 2", we know that 1516/// the top 3 bits are all equal to each other, so we return 3. 1517unsigned SelectionDAG::ComputeNumSignBits(SDOperand Op, unsigned Depth) const{ 1518 MVT::ValueType VT = Op.getValueType(); 1519 assert(MVT::isInteger(VT) && "Invalid VT!"); 1520 unsigned VTBits = MVT::getSizeInBits(VT); 1521 unsigned Tmp, Tmp2; 1522 1523 if (Depth == 6) 1524 return 1; // Limit search depth. 1525 1526 switch (Op.getOpcode()) { 1527 default: break; 1528 case ISD::AssertSext: 1529 Tmp = MVT::getSizeInBits(cast<VTSDNode>(Op.getOperand(1))->getVT()); 1530 return VTBits-Tmp+1; 1531 case ISD::AssertZext: 1532 Tmp = MVT::getSizeInBits(cast<VTSDNode>(Op.getOperand(1))->getVT()); 1533 return VTBits-Tmp; 1534 1535 case ISD::Constant: { 1536 uint64_t Val = cast<ConstantSDNode>(Op)->getValue(); 1537 // If negative, invert the bits, then look at it. 1538 if (Val & MVT::getIntVTSignBit(VT)) 1539 Val = ~Val; 1540 1541 // Shift the bits so they are the leading bits in the int64_t. 1542 Val <<= 64-VTBits; 1543 1544 // Return # leading zeros. We use 'min' here in case Val was zero before 1545 // shifting. We don't want to return '64' as for an i32 "0". 1546 return std::min(VTBits, CountLeadingZeros_64(Val)); 1547 } 1548 1549 case ISD::SIGN_EXTEND: 1550 Tmp = VTBits-MVT::getSizeInBits(Op.getOperand(0).getValueType()); 1551 return ComputeNumSignBits(Op.getOperand(0), Depth+1) + Tmp; 1552 1553 case ISD::SIGN_EXTEND_INREG: 1554 // Max of the input and what this extends. 1555 Tmp = MVT::getSizeInBits(cast<VTSDNode>(Op.getOperand(1))->getVT()); 1556 Tmp = VTBits-Tmp+1; 1557 1558 Tmp2 = ComputeNumSignBits(Op.getOperand(0), Depth+1); 1559 return std::max(Tmp, Tmp2); 1560 1561 case ISD::SRA: 1562 Tmp = ComputeNumSignBits(Op.getOperand(0), Depth+1); 1563 // SRA X, C -> adds C sign bits. 1564 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op.getOperand(1))) { 1565 Tmp += C->getValue(); 1566 if (Tmp > VTBits) Tmp = VTBits; 1567 } 1568 return Tmp; 1569 case ISD::SHL: 1570 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op.getOperand(1))) { 1571 // shl destroys sign bits. 1572 Tmp = ComputeNumSignBits(Op.getOperand(0), Depth+1); 1573 if (C->getValue() >= VTBits || // Bad shift. 1574 C->getValue() >= Tmp) break; // Shifted all sign bits out. 1575 return Tmp - C->getValue(); 1576 } 1577 break; 1578 case ISD::AND: 1579 case ISD::OR: 1580 case ISD::XOR: // NOT is handled here. 1581 // Logical binary ops preserve the number of sign bits. 1582 Tmp = ComputeNumSignBits(Op.getOperand(0), Depth+1); 1583 if (Tmp == 1) return 1; // Early out. 1584 Tmp2 = ComputeNumSignBits(Op.getOperand(1), Depth+1); 1585 return std::min(Tmp, Tmp2); 1586 1587 case ISD::SELECT: 1588 Tmp = ComputeNumSignBits(Op.getOperand(0), Depth+1); 1589 if (Tmp == 1) return 1; // Early out. 1590 Tmp2 = ComputeNumSignBits(Op.getOperand(1), Depth+1); 1591 return std::min(Tmp, Tmp2); 1592 1593 case ISD::SETCC: 1594 // If setcc returns 0/-1, all bits are sign bits. 1595 if (TLI.getSetCCResultContents() == 1596 TargetLowering::ZeroOrNegativeOneSetCCResult) 1597 return VTBits; 1598 break; 1599 case ISD::ROTL: 1600 case ISD::ROTR: 1601 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op.getOperand(1))) { 1602 unsigned RotAmt = C->getValue() & (VTBits-1); 1603 1604 // Handle rotate right by N like a rotate left by 32-N. 1605 if (Op.getOpcode() == ISD::ROTR) 1606 RotAmt = (VTBits-RotAmt) & (VTBits-1); 1607 1608 // If we aren't rotating out all of the known-in sign bits, return the 1609 // number that are left. This handles rotl(sext(x), 1) for example. 1610 Tmp = ComputeNumSignBits(Op.getOperand(0), Depth+1); 1611 if (Tmp > RotAmt+1) return Tmp-RotAmt; 1612 } 1613 break; 1614 case ISD::ADD: 1615 // Add can have at most one carry bit. Thus we know that the output 1616 // is, at worst, one more bit than the inputs. 1617 Tmp = ComputeNumSignBits(Op.getOperand(0), Depth+1); 1618 if (Tmp == 1) return 1; // Early out. 1619 1620 // Special case decrementing a value (ADD X, -1): 1621 if (ConstantSDNode *CRHS = dyn_cast<ConstantSDNode>(Op.getOperand(0))) 1622 if (CRHS->isAllOnesValue()) { 1623 uint64_t KnownZero, KnownOne; 1624 uint64_t Mask = MVT::getIntVTBitMask(VT); 1625 ComputeMaskedBits(Op.getOperand(0), Mask, KnownZero, KnownOne, Depth+1); 1626 1627 // If the input is known to be 0 or 1, the output is 0/-1, which is all 1628 // sign bits set. 1629 if ((KnownZero|1) == Mask) 1630 return VTBits; 1631 1632 // If we are subtracting one from a positive number, there is no carry 1633 // out of the result. 1634 if (KnownZero & MVT::getIntVTSignBit(VT)) 1635 return Tmp; 1636 } 1637 1638 Tmp2 = ComputeNumSignBits(Op.getOperand(1), Depth+1); 1639 if (Tmp2 == 1) return 1; 1640 return std::min(Tmp, Tmp2)-1; 1641 break; 1642 1643 case ISD::SUB: 1644 Tmp2 = ComputeNumSignBits(Op.getOperand(1), Depth+1); 1645 if (Tmp2 == 1) return 1; 1646 1647 // Handle NEG. 1648 if (ConstantSDNode *CLHS = dyn_cast<ConstantSDNode>(Op.getOperand(0))) 1649 if (CLHS->getValue() == 0) { 1650 uint64_t KnownZero, KnownOne; 1651 uint64_t Mask = MVT::getIntVTBitMask(VT); 1652 ComputeMaskedBits(Op.getOperand(1), Mask, KnownZero, KnownOne, Depth+1); 1653 // If the input is known to be 0 or 1, the output is 0/-1, which is all 1654 // sign bits set. 1655 if ((KnownZero|1) == Mask) 1656 return VTBits; 1657 1658 // If the input is known to be positive (the sign bit is known clear), 1659 // the output of the NEG has the same number of sign bits as the input. 1660 if (KnownZero & MVT::getIntVTSignBit(VT)) 1661 return Tmp2; 1662 1663 // Otherwise, we treat this like a SUB. 1664 } 1665 1666 // Sub can have at most one carry bit. Thus we know that the output 1667 // is, at worst, one more bit than the inputs. 1668 Tmp = ComputeNumSignBits(Op.getOperand(0), Depth+1); 1669 if (Tmp == 1) return 1; // Early out. 1670 return std::min(Tmp, Tmp2)-1; 1671 break; 1672 case ISD::TRUNCATE: 1673 // FIXME: it's tricky to do anything useful for this, but it is an important 1674 // case for targets like X86. 1675 break; 1676 } 1677 1678 // Handle LOADX separately here. EXTLOAD case will fallthrough. 1679 if (Op.getOpcode() == ISD::LOAD) { 1680 LoadSDNode *LD = cast<LoadSDNode>(Op); 1681 unsigned ExtType = LD->getExtensionType(); 1682 switch (ExtType) { 1683 default: break; 1684 case ISD::SEXTLOAD: // '17' bits known 1685 Tmp = MVT::getSizeInBits(LD->getMemoryVT()); 1686 return VTBits-Tmp+1; 1687 case ISD::ZEXTLOAD: // '16' bits known 1688 Tmp = MVT::getSizeInBits(LD->getMemoryVT()); 1689 return VTBits-Tmp; 1690 } 1691 } 1692 1693 // Allow the target to implement this method for its nodes. 1694 if (Op.getOpcode() >= ISD::BUILTIN_OP_END || 1695 Op.getOpcode() == ISD::INTRINSIC_WO_CHAIN || 1696 Op.getOpcode() == ISD::INTRINSIC_W_CHAIN || 1697 Op.getOpcode() == ISD::INTRINSIC_VOID) { 1698 unsigned NumBits = TLI.ComputeNumSignBitsForTargetNode(Op, Depth); 1699 if (NumBits > 1) return NumBits; 1700 } 1701 1702 // Finally, if we can prove that the top bits of the result are 0's or 1's, 1703 // use this information. 1704 uint64_t KnownZero, KnownOne; 1705 uint64_t Mask = MVT::getIntVTBitMask(VT); 1706 ComputeMaskedBits(Op, Mask, KnownZero, KnownOne, Depth); 1707 1708 uint64_t SignBit = MVT::getIntVTSignBit(VT); 1709 if (KnownZero & SignBit) { // SignBit is 0 1710 Mask = KnownZero; 1711 } else if (KnownOne & SignBit) { // SignBit is 1; 1712 Mask = KnownOne; 1713 } else { 1714 // Nothing known. 1715 return 1; 1716 } 1717 1718 // Okay, we know that the sign bit in Mask is set. Use CLZ to determine 1719 // the number of identical bits in the top of the input value. 1720 Mask ^= ~0ULL; 1721 Mask <<= 64-VTBits; 1722 // Return # leading zeros. We use 'min' here in case Val was zero before 1723 // shifting. We don't want to return '64' as for an i32 "0". 1724 return std::min(VTBits, CountLeadingZeros_64(Mask)); 1725} 1726 1727 1728bool SelectionDAG::isVerifiedDebugInfoDesc(SDOperand Op) const { 1729 GlobalAddressSDNode *GA = dyn_cast<GlobalAddressSDNode>(Op); 1730 if (!GA) return false; 1731 GlobalVariable *GV = dyn_cast<GlobalVariable>(GA->getGlobal()); 1732 if (!GV) return false; 1733 MachineModuleInfo *MMI = getMachineModuleInfo(); 1734 return MMI && MMI->hasDebugInfo() && MMI->isVerified(GV); 1735} 1736 1737 1738/// getNode - Gets or creates the specified node. 1739/// 1740SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT) { 1741 FoldingSetNodeID ID; 1742 AddNodeIDNode(ID, Opcode, getVTList(VT), 0, 0); 1743 void *IP = 0; 1744 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP)) 1745 return SDOperand(E, 0); 1746 SDNode *N = new SDNode(Opcode, SDNode::getSDVTList(VT)); 1747 CSEMap.InsertNode(N, IP); 1748 1749 AllNodes.push_back(N); 1750 return SDOperand(N, 0); 1751} 1752 1753SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT, 1754 SDOperand Operand) { 1755 unsigned Tmp1; 1756 // Constant fold unary operations with an integer constant operand. 1757 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Operand.Val)) { 1758 uint64_t Val = C->getValue(); 1759 switch (Opcode) { 1760 default: break; 1761 case ISD::SIGN_EXTEND: return getConstant(C->getSignExtended(), VT); 1762 case ISD::ANY_EXTEND: 1763 case ISD::ZERO_EXTEND: return getConstant(Val, VT); 1764 case ISD::TRUNCATE: return getConstant(Val, VT); 1765 case ISD::UINT_TO_FP: 1766 case ISD::SINT_TO_FP: { 1767 const uint64_t zero[] = {0, 0}; 1768 // No compile time operations on this type. 1769 if (VT==MVT::ppcf128) 1770 break; 1771 APFloat apf = APFloat(APInt(MVT::getSizeInBits(VT), 2, zero)); 1772 (void)apf.convertFromZeroExtendedInteger(&Val, 1773 MVT::getSizeInBits(Operand.getValueType()), 1774 Opcode==ISD::SINT_TO_FP, 1775 APFloat::rmNearestTiesToEven); 1776 return getConstantFP(apf, VT); 1777 } 1778 case ISD::BIT_CONVERT: 1779 if (VT == MVT::f32 && C->getValueType(0) == MVT::i32) 1780 return getConstantFP(BitsToFloat(Val), VT); 1781 else if (VT == MVT::f64 && C->getValueType(0) == MVT::i64) 1782 return getConstantFP(BitsToDouble(Val), VT); 1783 break; 1784 case ISD::BSWAP: 1785 switch(VT) { 1786 default: assert(0 && "Invalid bswap!"); break; 1787 case MVT::i16: return getConstant(ByteSwap_16((unsigned short)Val), VT); 1788 case MVT::i32: return getConstant(ByteSwap_32((unsigned)Val), VT); 1789 case MVT::i64: return getConstant(ByteSwap_64(Val), VT); 1790 } 1791 break; 1792 case ISD::CTPOP: 1793 switch(VT) { 1794 default: assert(0 && "Invalid ctpop!"); break; 1795 case MVT::i1: return getConstant(Val != 0, VT); 1796 case MVT::i8: 1797 Tmp1 = (unsigned)Val & 0xFF; 1798 return getConstant(CountPopulation_32(Tmp1), VT); 1799 case MVT::i16: 1800 Tmp1 = (unsigned)Val & 0xFFFF; 1801 return getConstant(CountPopulation_32(Tmp1), VT); 1802 case MVT::i32: 1803 return getConstant(CountPopulation_32((unsigned)Val), VT); 1804 case MVT::i64: 1805 return getConstant(CountPopulation_64(Val), VT); 1806 } 1807 case ISD::CTLZ: 1808 switch(VT) { 1809 default: assert(0 && "Invalid ctlz!"); break; 1810 case MVT::i1: return getConstant(Val == 0, VT); 1811 case MVT::i8: 1812 Tmp1 = (unsigned)Val & 0xFF; 1813 return getConstant(CountLeadingZeros_32(Tmp1)-24, VT); 1814 case MVT::i16: 1815 Tmp1 = (unsigned)Val & 0xFFFF; 1816 return getConstant(CountLeadingZeros_32(Tmp1)-16, VT); 1817 case MVT::i32: 1818 return getConstant(CountLeadingZeros_32((unsigned)Val), VT); 1819 case MVT::i64: 1820 return getConstant(CountLeadingZeros_64(Val), VT); 1821 } 1822 case ISD::CTTZ: 1823 switch(VT) { 1824 default: assert(0 && "Invalid cttz!"); break; 1825 case MVT::i1: return getConstant(Val == 0, VT); 1826 case MVT::i8: 1827 Tmp1 = (unsigned)Val | 0x100; 1828 return getConstant(CountTrailingZeros_32(Tmp1), VT); 1829 case MVT::i16: 1830 Tmp1 = (unsigned)Val | 0x10000; 1831 return getConstant(CountTrailingZeros_32(Tmp1), VT); 1832 case MVT::i32: 1833 return getConstant(CountTrailingZeros_32((unsigned)Val), VT); 1834 case MVT::i64: 1835 return getConstant(CountTrailingZeros_64(Val), VT); 1836 } 1837 } 1838 } 1839 1840 // Constant fold unary operations with a floating point constant operand. 1841 if (ConstantFPSDNode *C = dyn_cast<ConstantFPSDNode>(Operand.Val)) { 1842 APFloat V = C->getValueAPF(); // make copy 1843 if (VT != MVT::ppcf128 && Operand.getValueType() != MVT::ppcf128) { 1844 switch (Opcode) { 1845 case ISD::FNEG: 1846 V.changeSign(); 1847 return getConstantFP(V, VT); 1848 case ISD::FABS: 1849 V.clearSign(); 1850 return getConstantFP(V, VT); 1851 case ISD::FP_ROUND: 1852 case ISD::FP_EXTEND: 1853 // This can return overflow, underflow, or inexact; we don't care. 1854 // FIXME need to be more flexible about rounding mode. 1855 (void) V.convert(VT==MVT::f32 ? APFloat::IEEEsingle : 1856 VT==MVT::f64 ? APFloat::IEEEdouble : 1857 VT==MVT::f80 ? APFloat::x87DoubleExtended : 1858 VT==MVT::f128 ? APFloat::IEEEquad : 1859 APFloat::Bogus, 1860 APFloat::rmNearestTiesToEven); 1861 return getConstantFP(V, VT); 1862 case ISD::FP_TO_SINT: 1863 case ISD::FP_TO_UINT: { 1864 integerPart x; 1865 assert(integerPartWidth >= 64); 1866 // FIXME need to be more flexible about rounding mode. 1867 APFloat::opStatus s = V.convertToInteger(&x, 64U, 1868 Opcode==ISD::FP_TO_SINT, 1869 APFloat::rmTowardZero); 1870 if (s==APFloat::opInvalidOp) // inexact is OK, in fact usual 1871 break; 1872 return getConstant(x, VT); 1873 } 1874 case ISD::BIT_CONVERT: 1875 if (VT == MVT::i32 && C->getValueType(0) == MVT::f32) 1876 return getConstant((uint32_t)V.convertToAPInt().getZExtValue(), VT); 1877 else if (VT == MVT::i64 && C->getValueType(0) == MVT::f64) 1878 return getConstant(V.convertToAPInt().getZExtValue(), VT); 1879 break; 1880 } 1881 } 1882 } 1883 1884 unsigned OpOpcode = Operand.Val->getOpcode(); 1885 switch (Opcode) { 1886 case ISD::TokenFactor: 1887 return Operand; // Factor of one node? No factor. 1888 case ISD::FP_ROUND: assert(0 && "Invalid method to make FP_ROUND node"); 1889 case ISD::FP_EXTEND: 1890 assert(MVT::isFloatingPoint(VT) && 1891 MVT::isFloatingPoint(Operand.getValueType()) && "Invalid FP cast!"); 1892 if (Operand.getValueType() == VT) return Operand; // noop conversion. 1893 break; 1894 case ISD::SIGN_EXTEND: 1895 assert(MVT::isInteger(VT) && MVT::isInteger(Operand.getValueType()) && 1896 "Invalid SIGN_EXTEND!"); 1897 if (Operand.getValueType() == VT) return Operand; // noop extension 1898 assert(MVT::getSizeInBits(Operand.getValueType()) < MVT::getSizeInBits(VT) 1899 && "Invalid sext node, dst < src!"); 1900 if (OpOpcode == ISD::SIGN_EXTEND || OpOpcode == ISD::ZERO_EXTEND) 1901 return getNode(OpOpcode, VT, Operand.Val->getOperand(0)); 1902 break; 1903 case ISD::ZERO_EXTEND: 1904 assert(MVT::isInteger(VT) && MVT::isInteger(Operand.getValueType()) && 1905 "Invalid ZERO_EXTEND!"); 1906 if (Operand.getValueType() == VT) return Operand; // noop extension 1907 assert(MVT::getSizeInBits(Operand.getValueType()) < MVT::getSizeInBits(VT) 1908 && "Invalid zext node, dst < src!"); 1909 if (OpOpcode == ISD::ZERO_EXTEND) // (zext (zext x)) -> (zext x) 1910 return getNode(ISD::ZERO_EXTEND, VT, Operand.Val->getOperand(0)); 1911 break; 1912 case ISD::ANY_EXTEND: 1913 assert(MVT::isInteger(VT) && MVT::isInteger(Operand.getValueType()) && 1914 "Invalid ANY_EXTEND!"); 1915 if (Operand.getValueType() == VT) return Operand; // noop extension 1916 assert(MVT::getSizeInBits(Operand.getValueType()) < MVT::getSizeInBits(VT) 1917 && "Invalid anyext node, dst < src!"); 1918 if (OpOpcode == ISD::ZERO_EXTEND || OpOpcode == ISD::SIGN_EXTEND) 1919 // (ext (zext x)) -> (zext x) and (ext (sext x)) -> (sext x) 1920 return getNode(OpOpcode, VT, Operand.Val->getOperand(0)); 1921 break; 1922 case ISD::TRUNCATE: 1923 assert(MVT::isInteger(VT) && MVT::isInteger(Operand.getValueType()) && 1924 "Invalid TRUNCATE!"); 1925 if (Operand.getValueType() == VT) return Operand; // noop truncate 1926 assert(MVT::getSizeInBits(Operand.getValueType()) > MVT::getSizeInBits(VT) 1927 && "Invalid truncate node, src < dst!"); 1928 if (OpOpcode == ISD::TRUNCATE) 1929 return getNode(ISD::TRUNCATE, VT, Operand.Val->getOperand(0)); 1930 else if (OpOpcode == ISD::ZERO_EXTEND || OpOpcode == ISD::SIGN_EXTEND || 1931 OpOpcode == ISD::ANY_EXTEND) { 1932 // If the source is smaller than the dest, we still need an extend. 1933 if (MVT::getSizeInBits(Operand.Val->getOperand(0).getValueType()) 1934 < MVT::getSizeInBits(VT)) 1935 return getNode(OpOpcode, VT, Operand.Val->getOperand(0)); 1936 else if (MVT::getSizeInBits(Operand.Val->getOperand(0).getValueType()) 1937 > MVT::getSizeInBits(VT)) 1938 return getNode(ISD::TRUNCATE, VT, Operand.Val->getOperand(0)); 1939 else 1940 return Operand.Val->getOperand(0); 1941 } 1942 break; 1943 case ISD::BIT_CONVERT: 1944 // Basic sanity checking. 1945 assert(MVT::getSizeInBits(VT) == MVT::getSizeInBits(Operand.getValueType()) 1946 && "Cannot BIT_CONVERT between types of different sizes!"); 1947 if (VT == Operand.getValueType()) return Operand; // noop conversion. 1948 if (OpOpcode == ISD::BIT_CONVERT) // bitconv(bitconv(x)) -> bitconv(x) 1949 return getNode(ISD::BIT_CONVERT, VT, Operand.getOperand(0)); 1950 if (OpOpcode == ISD::UNDEF) 1951 return getNode(ISD::UNDEF, VT); 1952 break; 1953 case ISD::SCALAR_TO_VECTOR: 1954 assert(MVT::isVector(VT) && !MVT::isVector(Operand.getValueType()) && 1955 MVT::getVectorElementType(VT) == Operand.getValueType() && 1956 "Illegal SCALAR_TO_VECTOR node!"); 1957 break; 1958 case ISD::FNEG: 1959 if (OpOpcode == ISD::FSUB) // -(X-Y) -> (Y-X) 1960 return getNode(ISD::FSUB, VT, Operand.Val->getOperand(1), 1961 Operand.Val->getOperand(0)); 1962 if (OpOpcode == ISD::FNEG) // --X -> X 1963 return Operand.Val->getOperand(0); 1964 break; 1965 case ISD::FABS: 1966 if (OpOpcode == ISD::FNEG) // abs(-X) -> abs(X) 1967 return getNode(ISD::FABS, VT, Operand.Val->getOperand(0)); 1968 break; 1969 } 1970 1971 SDNode *N; 1972 SDVTList VTs = getVTList(VT); 1973 if (VT != MVT::Flag) { // Don't CSE flag producing nodes 1974 FoldingSetNodeID ID; 1975 SDOperand Ops[1] = { Operand }; 1976 AddNodeIDNode(ID, Opcode, VTs, Ops, 1); 1977 void *IP = 0; 1978 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP)) 1979 return SDOperand(E, 0); 1980 N = new UnarySDNode(Opcode, VTs, Operand); 1981 CSEMap.InsertNode(N, IP); 1982 } else { 1983 N = new UnarySDNode(Opcode, VTs, Operand); 1984 } 1985 AllNodes.push_back(N); 1986 return SDOperand(N, 0); 1987} 1988 1989 1990 1991SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT, 1992 SDOperand N1, SDOperand N2) { 1993 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1.Val); 1994 ConstantSDNode *N2C = dyn_cast<ConstantSDNode>(N2.Val); 1995 switch (Opcode) { 1996 default: break; 1997 case ISD::TokenFactor: 1998 assert(VT == MVT::Other && N1.getValueType() == MVT::Other && 1999 N2.getValueType() == MVT::Other && "Invalid token factor!"); 2000 // Fold trivial token factors. 2001 if (N1.getOpcode() == ISD::EntryToken) return N2; 2002 if (N2.getOpcode() == ISD::EntryToken) return N1; 2003 break; 2004 case ISD::AND: 2005 assert(MVT::isInteger(VT) && N1.getValueType() == N2.getValueType() && 2006 N1.getValueType() == VT && "Binary operator types must match!"); 2007 // (X & 0) -> 0. This commonly occurs when legalizing i64 values, so it's 2008 // worth handling here. 2009 if (N2C && N2C->getValue() == 0) 2010 return N2; 2011 if (N2C && N2C->isAllOnesValue()) // X & -1 -> X 2012 return N1; 2013 break; 2014 case ISD::OR: 2015 case ISD::XOR: 2016 assert(MVT::isInteger(VT) && N1.getValueType() == N2.getValueType() && 2017 N1.getValueType() == VT && "Binary operator types must match!"); 2018 // (X ^| 0) -> X. This commonly occurs when legalizing i64 values, so it's 2019 // worth handling here. 2020 if (N2C && N2C->getValue() == 0) 2021 return N1; 2022 break; 2023 case ISD::UDIV: 2024 case ISD::UREM: 2025 case ISD::MULHU: 2026 case ISD::MULHS: 2027 assert(MVT::isInteger(VT) && "This operator does not apply to FP types!"); 2028 // fall through 2029 case ISD::ADD: 2030 case ISD::SUB: 2031 case ISD::MUL: 2032 case ISD::SDIV: 2033 case ISD::SREM: 2034 case ISD::FADD: 2035 case ISD::FSUB: 2036 case ISD::FMUL: 2037 case ISD::FDIV: 2038 case ISD::FREM: 2039 assert(N1.getValueType() == N2.getValueType() && 2040 N1.getValueType() == VT && "Binary operator types must match!"); 2041 break; 2042 case ISD::FCOPYSIGN: // N1 and result must match. N1/N2 need not match. 2043 assert(N1.getValueType() == VT && 2044 MVT::isFloatingPoint(N1.getValueType()) && 2045 MVT::isFloatingPoint(N2.getValueType()) && 2046 "Invalid FCOPYSIGN!"); 2047 break; 2048 case ISD::SHL: 2049 case ISD::SRA: 2050 case ISD::SRL: 2051 case ISD::ROTL: 2052 case ISD::ROTR: 2053 assert(VT == N1.getValueType() && 2054 "Shift operators return type must be the same as their first arg"); 2055 assert(MVT::isInteger(VT) && MVT::isInteger(N2.getValueType()) && 2056 VT != MVT::i1 && "Shifts only work on integers"); 2057 break; 2058 case ISD::FP_ROUND_INREG: { 2059 MVT::ValueType EVT = cast<VTSDNode>(N2)->getVT(); 2060 assert(VT == N1.getValueType() && "Not an inreg round!"); 2061 assert(MVT::isFloatingPoint(VT) && MVT::isFloatingPoint(EVT) && 2062 "Cannot FP_ROUND_INREG integer types"); 2063 assert(MVT::getSizeInBits(EVT) <= MVT::getSizeInBits(VT) && 2064 "Not rounding down!"); 2065 if (cast<VTSDNode>(N2)->getVT() == VT) return N1; // Not actually rounding. 2066 break; 2067 } 2068 case ISD::FP_ROUND: 2069 assert(MVT::isFloatingPoint(VT) && 2070 MVT::isFloatingPoint(N1.getValueType()) && 2071 MVT::getSizeInBits(VT) <= MVT::getSizeInBits(N1.getValueType()) && 2072 isa<ConstantSDNode>(N2) && "Invalid FP_ROUND!"); 2073 if (N1.getValueType() == VT) return N1; // noop conversion. 2074 break; 2075 case ISD::AssertSext: 2076 case ISD::AssertZext: { 2077 MVT::ValueType EVT = cast<VTSDNode>(N2)->getVT(); 2078 assert(VT == N1.getValueType() && "Not an inreg extend!"); 2079 assert(MVT::isInteger(VT) && MVT::isInteger(EVT) && 2080 "Cannot *_EXTEND_INREG FP types"); 2081 assert(MVT::getSizeInBits(EVT) <= MVT::getSizeInBits(VT) && 2082 "Not extending!"); 2083 if (VT == EVT) return N1; // noop assertion. 2084 break; 2085 } 2086 case ISD::SIGN_EXTEND_INREG: { 2087 MVT::ValueType EVT = cast<VTSDNode>(N2)->getVT(); 2088 assert(VT == N1.getValueType() && "Not an inreg extend!"); 2089 assert(MVT::isInteger(VT) && MVT::isInteger(EVT) && 2090 "Cannot *_EXTEND_INREG FP types"); 2091 assert(MVT::getSizeInBits(EVT) <= MVT::getSizeInBits(VT) && 2092 "Not extending!"); 2093 if (EVT == VT) return N1; // Not actually extending 2094 2095 if (N1C) { 2096 int64_t Val = N1C->getValue(); 2097 unsigned FromBits = MVT::getSizeInBits(cast<VTSDNode>(N2)->getVT()); 2098 Val <<= 64-FromBits; 2099 Val >>= 64-FromBits; 2100 return getConstant(Val, VT); 2101 } 2102 break; 2103 } 2104 case ISD::EXTRACT_VECTOR_ELT: 2105 assert(N2C && "Bad EXTRACT_VECTOR_ELT!"); 2106 2107 // EXTRACT_VECTOR_ELT of CONCAT_VECTORS is often formed while lowering is 2108 // expanding copies of large vectors from registers. 2109 if (N1.getOpcode() == ISD::CONCAT_VECTORS && 2110 N1.getNumOperands() > 0) { 2111 unsigned Factor = 2112 MVT::getVectorNumElements(N1.getOperand(0).getValueType()); 2113 return getNode(ISD::EXTRACT_VECTOR_ELT, VT, 2114 N1.getOperand(N2C->getValue() / Factor), 2115 getConstant(N2C->getValue() % Factor, N2.getValueType())); 2116 } 2117 2118 // EXTRACT_VECTOR_ELT of BUILD_VECTOR is often formed while lowering is 2119 // expanding large vector constants. 2120 if (N1.getOpcode() == ISD::BUILD_VECTOR) 2121 return N1.getOperand(N2C->getValue()); 2122 2123 // EXTRACT_VECTOR_ELT of INSERT_VECTOR_ELT is often formed when vector 2124 // operations are lowered to scalars. 2125 if (N1.getOpcode() == ISD::INSERT_VECTOR_ELT) 2126 if (ConstantSDNode *IEC = dyn_cast<ConstantSDNode>(N1.getOperand(2))) { 2127 if (IEC == N2C) 2128 return N1.getOperand(1); 2129 else 2130 return getNode(ISD::EXTRACT_VECTOR_ELT, VT, N1.getOperand(0), N2); 2131 } 2132 break; 2133 case ISD::EXTRACT_ELEMENT: 2134 assert(N2C && (unsigned)N2C->getValue() < 2 && "Bad EXTRACT_ELEMENT!"); 2135 2136 // EXTRACT_ELEMENT of BUILD_PAIR is often formed while legalize is expanding 2137 // 64-bit integers into 32-bit parts. Instead of building the extract of 2138 // the BUILD_PAIR, only to have legalize rip it apart, just do it now. 2139 if (N1.getOpcode() == ISD::BUILD_PAIR) 2140 return N1.getOperand(N2C->getValue()); 2141 2142 // EXTRACT_ELEMENT of a constant int is also very common. 2143 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(N1)) { 2144 unsigned Shift = MVT::getSizeInBits(VT) * N2C->getValue(); 2145 return getConstant(C->getValue() >> Shift, VT); 2146 } 2147 break; 2148 case ISD::EXTRACT_SUBVECTOR: 2149 if (N1.getValueType() == VT) // Trivial extraction. 2150 return N1; 2151 break; 2152 } 2153 2154 if (N1C) { 2155 if (N2C) { 2156 uint64_t C1 = N1C->getValue(), C2 = N2C->getValue(); 2157 switch (Opcode) { 2158 case ISD::ADD: return getConstant(C1 + C2, VT); 2159 case ISD::SUB: return getConstant(C1 - C2, VT); 2160 case ISD::MUL: return getConstant(C1 * C2, VT); 2161 case ISD::UDIV: 2162 if (C2) return getConstant(C1 / C2, VT); 2163 break; 2164 case ISD::UREM : 2165 if (C2) return getConstant(C1 % C2, VT); 2166 break; 2167 case ISD::SDIV : 2168 if (C2) return getConstant(N1C->getSignExtended() / 2169 N2C->getSignExtended(), VT); 2170 break; 2171 case ISD::SREM : 2172 if (C2) return getConstant(N1C->getSignExtended() % 2173 N2C->getSignExtended(), VT); 2174 break; 2175 case ISD::AND : return getConstant(C1 & C2, VT); 2176 case ISD::OR : return getConstant(C1 | C2, VT); 2177 case ISD::XOR : return getConstant(C1 ^ C2, VT); 2178 case ISD::SHL : return getConstant(C1 << C2, VT); 2179 case ISD::SRL : return getConstant(C1 >> C2, VT); 2180 case ISD::SRA : return getConstant(N1C->getSignExtended() >>(int)C2, VT); 2181 case ISD::ROTL : 2182 return getConstant((C1 << C2) | (C1 >> (MVT::getSizeInBits(VT) - C2)), 2183 VT); 2184 case ISD::ROTR : 2185 return getConstant((C1 >> C2) | (C1 << (MVT::getSizeInBits(VT) - C2)), 2186 VT); 2187 default: break; 2188 } 2189 } else { // Cannonicalize constant to RHS if commutative 2190 if (isCommutativeBinOp(Opcode)) { 2191 std::swap(N1C, N2C); 2192 std::swap(N1, N2); 2193 } 2194 } 2195 } 2196 2197 // Constant fold FP operations. 2198 ConstantFPSDNode *N1CFP = dyn_cast<ConstantFPSDNode>(N1.Val); 2199 ConstantFPSDNode *N2CFP = dyn_cast<ConstantFPSDNode>(N2.Val); 2200 if (N1CFP) { 2201 if (!N2CFP && isCommutativeBinOp(Opcode)) { 2202 // Cannonicalize constant to RHS if commutative 2203 std::swap(N1CFP, N2CFP); 2204 std::swap(N1, N2); 2205 } else if (N2CFP && VT != MVT::ppcf128) { 2206 APFloat V1 = N1CFP->getValueAPF(), V2 = N2CFP->getValueAPF(); 2207 APFloat::opStatus s; 2208 switch (Opcode) { 2209 case ISD::FADD: 2210 s = V1.add(V2, APFloat::rmNearestTiesToEven); 2211 if (s != APFloat::opInvalidOp) 2212 return getConstantFP(V1, VT); 2213 break; 2214 case ISD::FSUB: 2215 s = V1.subtract(V2, APFloat::rmNearestTiesToEven); 2216 if (s!=APFloat::opInvalidOp) 2217 return getConstantFP(V1, VT); 2218 break; 2219 case ISD::FMUL: 2220 s = V1.multiply(V2, APFloat::rmNearestTiesToEven); 2221 if (s!=APFloat::opInvalidOp) 2222 return getConstantFP(V1, VT); 2223 break; 2224 case ISD::FDIV: 2225 s = V1.divide(V2, APFloat::rmNearestTiesToEven); 2226 if (s!=APFloat::opInvalidOp && s!=APFloat::opDivByZero) 2227 return getConstantFP(V1, VT); 2228 break; 2229 case ISD::FREM : 2230 s = V1.mod(V2, APFloat::rmNearestTiesToEven); 2231 if (s!=APFloat::opInvalidOp && s!=APFloat::opDivByZero) 2232 return getConstantFP(V1, VT); 2233 break; 2234 case ISD::FCOPYSIGN: 2235 V1.copySign(V2); 2236 return getConstantFP(V1, VT); 2237 default: break; 2238 } 2239 } 2240 } 2241 2242 // Canonicalize an UNDEF to the RHS, even over a constant. 2243 if (N1.getOpcode() == ISD::UNDEF) { 2244 if (isCommutativeBinOp(Opcode)) { 2245 std::swap(N1, N2); 2246 } else { 2247 switch (Opcode) { 2248 case ISD::FP_ROUND_INREG: 2249 case ISD::SIGN_EXTEND_INREG: 2250 case ISD::SUB: 2251 case ISD::FSUB: 2252 case ISD::FDIV: 2253 case ISD::FREM: 2254 case ISD::SRA: 2255 return N1; // fold op(undef, arg2) -> undef 2256 case ISD::UDIV: 2257 case ISD::SDIV: 2258 case ISD::UREM: 2259 case ISD::SREM: 2260 case ISD::SRL: 2261 case ISD::SHL: 2262 if (!MVT::isVector(VT)) 2263 return getConstant(0, VT); // fold op(undef, arg2) -> 0 2264 // For vectors, we can't easily build an all zero vector, just return 2265 // the LHS. 2266 return N2; 2267 } 2268 } 2269 } 2270 2271 // Fold a bunch of operators when the RHS is undef. 2272 if (N2.getOpcode() == ISD::UNDEF) { 2273 switch (Opcode) { 2274 case ISD::ADD: 2275 case ISD::ADDC: 2276 case ISD::ADDE: 2277 case ISD::SUB: 2278 case ISD::FADD: 2279 case ISD::FSUB: 2280 case ISD::FMUL: 2281 case ISD::FDIV: 2282 case ISD::FREM: 2283 case ISD::UDIV: 2284 case ISD::SDIV: 2285 case ISD::UREM: 2286 case ISD::SREM: 2287 case ISD::XOR: 2288 return N2; // fold op(arg1, undef) -> undef 2289 case ISD::MUL: 2290 case ISD::AND: 2291 case ISD::SRL: 2292 case ISD::SHL: 2293 if (!MVT::isVector(VT)) 2294 return getConstant(0, VT); // fold op(arg1, undef) -> 0 2295 // For vectors, we can't easily build an all zero vector, just return 2296 // the LHS. 2297 return N1; 2298 case ISD::OR: 2299 if (!MVT::isVector(VT)) 2300 return getConstant(MVT::getIntVTBitMask(VT), VT); 2301 // For vectors, we can't easily build an all one vector, just return 2302 // the LHS. 2303 return N1; 2304 case ISD::SRA: 2305 return N1; 2306 } 2307 } 2308 2309 // Memoize this node if possible. 2310 SDNode *N; 2311 SDVTList VTs = getVTList(VT); 2312 if (VT != MVT::Flag) { 2313 SDOperand Ops[] = { N1, N2 }; 2314 FoldingSetNodeID ID; 2315 AddNodeIDNode(ID, Opcode, VTs, Ops, 2); 2316 void *IP = 0; 2317 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP)) 2318 return SDOperand(E, 0); 2319 N = new BinarySDNode(Opcode, VTs, N1, N2); 2320 CSEMap.InsertNode(N, IP); 2321 } else { 2322 N = new BinarySDNode(Opcode, VTs, N1, N2); 2323 } 2324 2325 AllNodes.push_back(N); 2326 return SDOperand(N, 0); 2327} 2328 2329SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT, 2330 SDOperand N1, SDOperand N2, SDOperand N3) { 2331 // Perform various simplifications. 2332 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1.Val); 2333 ConstantSDNode *N2C = dyn_cast<ConstantSDNode>(N2.Val); 2334 switch (Opcode) { 2335 case ISD::SETCC: { 2336 // Use FoldSetCC to simplify SETCC's. 2337 SDOperand Simp = FoldSetCC(VT, N1, N2, cast<CondCodeSDNode>(N3)->get()); 2338 if (Simp.Val) return Simp; 2339 break; 2340 } 2341 case ISD::SELECT: 2342 if (N1C) { 2343 if (N1C->getValue()) 2344 return N2; // select true, X, Y -> X 2345 else 2346 return N3; // select false, X, Y -> Y 2347 } 2348 2349 if (N2 == N3) return N2; // select C, X, X -> X 2350 break; 2351 case ISD::BRCOND: 2352 if (N2C) { 2353 if (N2C->getValue()) // Unconditional branch 2354 return getNode(ISD::BR, MVT::Other, N1, N3); 2355 else 2356 return N1; // Never-taken branch 2357 } 2358 break; 2359 case ISD::VECTOR_SHUFFLE: 2360 assert(VT == N1.getValueType() && VT == N2.getValueType() && 2361 MVT::isVector(VT) && MVT::isVector(N3.getValueType()) && 2362 N3.getOpcode() == ISD::BUILD_VECTOR && 2363 MVT::getVectorNumElements(VT) == N3.getNumOperands() && 2364 "Illegal VECTOR_SHUFFLE node!"); 2365 break; 2366 case ISD::BIT_CONVERT: 2367 // Fold bit_convert nodes from a type to themselves. 2368 if (N1.getValueType() == VT) 2369 return N1; 2370 break; 2371 } 2372 2373 // Memoize node if it doesn't produce a flag. 2374 SDNode *N; 2375 SDVTList VTs = getVTList(VT); 2376 if (VT != MVT::Flag) { 2377 SDOperand Ops[] = { N1, N2, N3 }; 2378 FoldingSetNodeID ID; 2379 AddNodeIDNode(ID, Opcode, VTs, Ops, 3); 2380 void *IP = 0; 2381 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP)) 2382 return SDOperand(E, 0); 2383 N = new TernarySDNode(Opcode, VTs, N1, N2, N3); 2384 CSEMap.InsertNode(N, IP); 2385 } else { 2386 N = new TernarySDNode(Opcode, VTs, N1, N2, N3); 2387 } 2388 AllNodes.push_back(N); 2389 return SDOperand(N, 0); 2390} 2391 2392SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT, 2393 SDOperand N1, SDOperand N2, SDOperand N3, 2394 SDOperand N4) { 2395 SDOperand Ops[] = { N1, N2, N3, N4 }; 2396 return getNode(Opcode, VT, Ops, 4); 2397} 2398 2399SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT, 2400 SDOperand N1, SDOperand N2, SDOperand N3, 2401 SDOperand N4, SDOperand N5) { 2402 SDOperand Ops[] = { N1, N2, N3, N4, N5 }; 2403 return getNode(Opcode, VT, Ops, 5); 2404} 2405 2406SDOperand SelectionDAG::getMemcpy(SDOperand Chain, SDOperand Dest, 2407 SDOperand Src, SDOperand Size, 2408 SDOperand Align, 2409 SDOperand AlwaysInline) { 2410 SDOperand Ops[] = { Chain, Dest, Src, Size, Align, AlwaysInline }; 2411 return getNode(ISD::MEMCPY, MVT::Other, Ops, 6); 2412} 2413 2414SDOperand SelectionDAG::getMemmove(SDOperand Chain, SDOperand Dest, 2415 SDOperand Src, SDOperand Size, 2416 SDOperand Align, 2417 SDOperand AlwaysInline) { 2418 SDOperand Ops[] = { Chain, Dest, Src, Size, Align, AlwaysInline }; 2419 return getNode(ISD::MEMMOVE, MVT::Other, Ops, 6); 2420} 2421 2422SDOperand SelectionDAG::getMemset(SDOperand Chain, SDOperand Dest, 2423 SDOperand Src, SDOperand Size, 2424 SDOperand Align, 2425 SDOperand AlwaysInline) { 2426 SDOperand Ops[] = { Chain, Dest, Src, Size, Align, AlwaysInline }; 2427 return getNode(ISD::MEMSET, MVT::Other, Ops, 6); 2428} 2429 2430SDOperand SelectionDAG::getLoad(MVT::ValueType VT, 2431 SDOperand Chain, SDOperand Ptr, 2432 const Value *SV, int SVOffset, 2433 bool isVolatile, unsigned Alignment) { 2434 if (Alignment == 0) { // Ensure that codegen never sees alignment 0 2435 const Type *Ty = 0; 2436 if (VT != MVT::iPTR) { 2437 Ty = MVT::getTypeForValueType(VT); 2438 } else if (SV) { 2439 const PointerType *PT = dyn_cast<PointerType>(SV->getType()); 2440 assert(PT && "Value for load must be a pointer"); 2441 Ty = PT->getElementType(); 2442 } 2443 assert(Ty && "Could not get type information for load"); 2444 Alignment = TLI.getTargetData()->getABITypeAlignment(Ty); 2445 } 2446 SDVTList VTs = getVTList(VT, MVT::Other); 2447 SDOperand Undef = getNode(ISD::UNDEF, Ptr.getValueType()); 2448 SDOperand Ops[] = { Chain, Ptr, Undef }; 2449 FoldingSetNodeID ID; 2450 AddNodeIDNode(ID, ISD::LOAD, VTs, Ops, 3); 2451 ID.AddInteger(ISD::UNINDEXED); 2452 ID.AddInteger(ISD::NON_EXTLOAD); 2453 ID.AddInteger((unsigned int)VT); 2454 ID.AddInteger(Alignment); 2455 ID.AddInteger(isVolatile); 2456 void *IP = 0; 2457 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP)) 2458 return SDOperand(E, 0); 2459 SDNode *N = new LoadSDNode(Ops, VTs, ISD::UNINDEXED, 2460 ISD::NON_EXTLOAD, VT, SV, SVOffset, Alignment, 2461 isVolatile); 2462 CSEMap.InsertNode(N, IP); 2463 AllNodes.push_back(N); 2464 return SDOperand(N, 0); 2465} 2466 2467SDOperand SelectionDAG::getExtLoad(ISD::LoadExtType ExtType, MVT::ValueType VT, 2468 SDOperand Chain, SDOperand Ptr, 2469 const Value *SV, 2470 int SVOffset, MVT::ValueType EVT, 2471 bool isVolatile, unsigned Alignment) { 2472 // If they are asking for an extending load from/to the same thing, return a 2473 // normal load. 2474 if (VT == EVT) 2475 return getLoad(VT, Chain, Ptr, SV, SVOffset, isVolatile, Alignment); 2476 2477 if (MVT::isVector(VT)) 2478 assert(EVT == MVT::getVectorElementType(VT) && "Invalid vector extload!"); 2479 else 2480 assert(MVT::getSizeInBits(EVT) < MVT::getSizeInBits(VT) && 2481 "Should only be an extending load, not truncating!"); 2482 assert((ExtType == ISD::EXTLOAD || MVT::isInteger(VT)) && 2483 "Cannot sign/zero extend a FP/Vector load!"); 2484 assert(MVT::isInteger(VT) == MVT::isInteger(EVT) && 2485 "Cannot convert from FP to Int or Int -> FP!"); 2486 2487 if (Alignment == 0) { // Ensure that codegen never sees alignment 0 2488 const Type *Ty = 0; 2489 if (VT != MVT::iPTR) { 2490 Ty = MVT::getTypeForValueType(VT); 2491 } else if (SV) { 2492 const PointerType *PT = dyn_cast<PointerType>(SV->getType()); 2493 assert(PT && "Value for load must be a pointer"); 2494 Ty = PT->getElementType(); 2495 } 2496 assert(Ty && "Could not get type information for load"); 2497 Alignment = TLI.getTargetData()->getABITypeAlignment(Ty); 2498 } 2499 SDVTList VTs = getVTList(VT, MVT::Other); 2500 SDOperand Undef = getNode(ISD::UNDEF, Ptr.getValueType()); 2501 SDOperand Ops[] = { Chain, Ptr, Undef }; 2502 FoldingSetNodeID ID; 2503 AddNodeIDNode(ID, ISD::LOAD, VTs, Ops, 3); 2504 ID.AddInteger(ISD::UNINDEXED); 2505 ID.AddInteger(ExtType); 2506 ID.AddInteger((unsigned int)EVT); 2507 ID.AddInteger(Alignment); 2508 ID.AddInteger(isVolatile); 2509 void *IP = 0; 2510 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP)) 2511 return SDOperand(E, 0); 2512 SDNode *N = new LoadSDNode(Ops, VTs, ISD::UNINDEXED, ExtType, EVT, 2513 SV, SVOffset, Alignment, isVolatile); 2514 CSEMap.InsertNode(N, IP); 2515 AllNodes.push_back(N); 2516 return SDOperand(N, 0); 2517} 2518 2519SDOperand 2520SelectionDAG::getIndexedLoad(SDOperand OrigLoad, SDOperand Base, 2521 SDOperand Offset, ISD::MemIndexedMode AM) { 2522 LoadSDNode *LD = cast<LoadSDNode>(OrigLoad); 2523 assert(LD->getOffset().getOpcode() == ISD::UNDEF && 2524 "Load is already a indexed load!"); 2525 MVT::ValueType VT = OrigLoad.getValueType(); 2526 SDVTList VTs = getVTList(VT, Base.getValueType(), MVT::Other); 2527 SDOperand Ops[] = { LD->getChain(), Base, Offset }; 2528 FoldingSetNodeID ID; 2529 AddNodeIDNode(ID, ISD::LOAD, VTs, Ops, 3); 2530 ID.AddInteger(AM); 2531 ID.AddInteger(LD->getExtensionType()); 2532 ID.AddInteger((unsigned int)(LD->getMemoryVT())); 2533 ID.AddInteger(LD->getAlignment()); 2534 ID.AddInteger(LD->isVolatile()); 2535 void *IP = 0; 2536 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP)) 2537 return SDOperand(E, 0); 2538 SDNode *N = new LoadSDNode(Ops, VTs, AM, 2539 LD->getExtensionType(), LD->getMemoryVT(), 2540 LD->getSrcValue(), LD->getSrcValueOffset(), 2541 LD->getAlignment(), LD->isVolatile()); 2542 CSEMap.InsertNode(N, IP); 2543 AllNodes.push_back(N); 2544 return SDOperand(N, 0); 2545} 2546 2547SDOperand SelectionDAG::getStore(SDOperand Chain, SDOperand Val, 2548 SDOperand Ptr, const Value *SV, int SVOffset, 2549 bool isVolatile, unsigned Alignment) { 2550 MVT::ValueType VT = Val.getValueType(); 2551 2552 if (Alignment == 0) { // Ensure that codegen never sees alignment 0 2553 const Type *Ty = 0; 2554 if (VT != MVT::iPTR) { 2555 Ty = MVT::getTypeForValueType(VT); 2556 } else if (SV) { 2557 const PointerType *PT = dyn_cast<PointerType>(SV->getType()); 2558 assert(PT && "Value for store must be a pointer"); 2559 Ty = PT->getElementType(); 2560 } 2561 assert(Ty && "Could not get type information for store"); 2562 Alignment = TLI.getTargetData()->getABITypeAlignment(Ty); 2563 } 2564 SDVTList VTs = getVTList(MVT::Other); 2565 SDOperand Undef = getNode(ISD::UNDEF, Ptr.getValueType()); 2566 SDOperand Ops[] = { Chain, Val, Ptr, Undef }; 2567 FoldingSetNodeID ID; 2568 AddNodeIDNode(ID, ISD::STORE, VTs, Ops, 4); 2569 ID.AddInteger(ISD::UNINDEXED); 2570 ID.AddInteger(false); 2571 ID.AddInteger((unsigned int)VT); 2572 ID.AddInteger(Alignment); 2573 ID.AddInteger(isVolatile); 2574 void *IP = 0; 2575 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP)) 2576 return SDOperand(E, 0); 2577 SDNode *N = new StoreSDNode(Ops, VTs, ISD::UNINDEXED, false, 2578 VT, SV, SVOffset, Alignment, isVolatile); 2579 CSEMap.InsertNode(N, IP); 2580 AllNodes.push_back(N); 2581 return SDOperand(N, 0); 2582} 2583 2584SDOperand SelectionDAG::getTruncStore(SDOperand Chain, SDOperand Val, 2585 SDOperand Ptr, const Value *SV, 2586 int SVOffset, MVT::ValueType SVT, 2587 bool isVolatile, unsigned Alignment) { 2588 MVT::ValueType VT = Val.getValueType(); 2589 2590 if (VT == SVT) 2591 return getStore(Chain, Val, Ptr, SV, SVOffset, isVolatile, Alignment); 2592 2593 assert(MVT::getSizeInBits(VT) > MVT::getSizeInBits(SVT) && 2594 "Not a truncation?"); 2595 assert(MVT::isInteger(VT) == MVT::isInteger(SVT) && 2596 "Can't do FP-INT conversion!"); 2597 2598 if (Alignment == 0) { // Ensure that codegen never sees alignment 0 2599 const Type *Ty = 0; 2600 if (VT != MVT::iPTR) { 2601 Ty = MVT::getTypeForValueType(VT); 2602 } else if (SV) { 2603 const PointerType *PT = dyn_cast<PointerType>(SV->getType()); 2604 assert(PT && "Value for store must be a pointer"); 2605 Ty = PT->getElementType(); 2606 } 2607 assert(Ty && "Could not get type information for store"); 2608 Alignment = TLI.getTargetData()->getABITypeAlignment(Ty); 2609 } 2610 SDVTList VTs = getVTList(MVT::Other); 2611 SDOperand Undef = getNode(ISD::UNDEF, Ptr.getValueType()); 2612 SDOperand Ops[] = { Chain, Val, Ptr, Undef }; 2613 FoldingSetNodeID ID; 2614 AddNodeIDNode(ID, ISD::STORE, VTs, Ops, 4); 2615 ID.AddInteger(ISD::UNINDEXED); 2616 ID.AddInteger(1); 2617 ID.AddInteger((unsigned int)SVT); 2618 ID.AddInteger(Alignment); 2619 ID.AddInteger(isVolatile); 2620 void *IP = 0; 2621 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP)) 2622 return SDOperand(E, 0); 2623 SDNode *N = new StoreSDNode(Ops, VTs, ISD::UNINDEXED, true, 2624 SVT, SV, SVOffset, Alignment, isVolatile); 2625 CSEMap.InsertNode(N, IP); 2626 AllNodes.push_back(N); 2627 return SDOperand(N, 0); 2628} 2629 2630SDOperand 2631SelectionDAG::getIndexedStore(SDOperand OrigStore, SDOperand Base, 2632 SDOperand Offset, ISD::MemIndexedMode AM) { 2633 StoreSDNode *ST = cast<StoreSDNode>(OrigStore); 2634 assert(ST->getOffset().getOpcode() == ISD::UNDEF && 2635 "Store is already a indexed store!"); 2636 SDVTList VTs = getVTList(Base.getValueType(), MVT::Other); 2637 SDOperand Ops[] = { ST->getChain(), ST->getValue(), Base, Offset }; 2638 FoldingSetNodeID ID; 2639 AddNodeIDNode(ID, ISD::STORE, VTs, Ops, 4); 2640 ID.AddInteger(AM); 2641 ID.AddInteger(ST->isTruncatingStore()); 2642 ID.AddInteger((unsigned int)(ST->getMemoryVT())); 2643 ID.AddInteger(ST->getAlignment()); 2644 ID.AddInteger(ST->isVolatile()); 2645 void *IP = 0; 2646 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP)) 2647 return SDOperand(E, 0); 2648 SDNode *N = new StoreSDNode(Ops, VTs, AM, 2649 ST->isTruncatingStore(), ST->getMemoryVT(), 2650 ST->getSrcValue(), ST->getSrcValueOffset(), 2651 ST->getAlignment(), ST->isVolatile()); 2652 CSEMap.InsertNode(N, IP); 2653 AllNodes.push_back(N); 2654 return SDOperand(N, 0); 2655} 2656 2657SDOperand SelectionDAG::getVAArg(MVT::ValueType VT, 2658 SDOperand Chain, SDOperand Ptr, 2659 SDOperand SV) { 2660 SDOperand Ops[] = { Chain, Ptr, SV }; 2661 return getNode(ISD::VAARG, getVTList(VT, MVT::Other), Ops, 3); 2662} 2663 2664SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT, 2665 const SDOperand *Ops, unsigned NumOps) { 2666 switch (NumOps) { 2667 case 0: return getNode(Opcode, VT); 2668 case 1: return getNode(Opcode, VT, Ops[0]); 2669 case 2: return getNode(Opcode, VT, Ops[0], Ops[1]); 2670 case 3: return getNode(Opcode, VT, Ops[0], Ops[1], Ops[2]); 2671 default: break; 2672 } 2673 2674 switch (Opcode) { 2675 default: break; 2676 case ISD::SELECT_CC: { 2677 assert(NumOps == 5 && "SELECT_CC takes 5 operands!"); 2678 assert(Ops[0].getValueType() == Ops[1].getValueType() && 2679 "LHS and RHS of condition must have same type!"); 2680 assert(Ops[2].getValueType() == Ops[3].getValueType() && 2681 "True and False arms of SelectCC must have same type!"); 2682 assert(Ops[2].getValueType() == VT && 2683 "select_cc node must be of same type as true and false value!"); 2684 break; 2685 } 2686 case ISD::BR_CC: { 2687 assert(NumOps == 5 && "BR_CC takes 5 operands!"); 2688 assert(Ops[2].getValueType() == Ops[3].getValueType() && 2689 "LHS/RHS of comparison should match types!"); 2690 break; 2691 } 2692 } 2693 2694 // Memoize nodes. 2695 SDNode *N; 2696 SDVTList VTs = getVTList(VT); 2697 if (VT != MVT::Flag) { 2698 FoldingSetNodeID ID; 2699 AddNodeIDNode(ID, Opcode, VTs, Ops, NumOps); 2700 void *IP = 0; 2701 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP)) 2702 return SDOperand(E, 0); 2703 N = new SDNode(Opcode, VTs, Ops, NumOps); 2704 CSEMap.InsertNode(N, IP); 2705 } else { 2706 N = new SDNode(Opcode, VTs, Ops, NumOps); 2707 } 2708 AllNodes.push_back(N); 2709 return SDOperand(N, 0); 2710} 2711 2712SDOperand SelectionDAG::getNode(unsigned Opcode, 2713 std::vector<MVT::ValueType> &ResultTys, 2714 const SDOperand *Ops, unsigned NumOps) { 2715 return getNode(Opcode, getNodeValueTypes(ResultTys), ResultTys.size(), 2716 Ops, NumOps); 2717} 2718 2719SDOperand SelectionDAG::getNode(unsigned Opcode, 2720 const MVT::ValueType *VTs, unsigned NumVTs, 2721 const SDOperand *Ops, unsigned NumOps) { 2722 if (NumVTs == 1) 2723 return getNode(Opcode, VTs[0], Ops, NumOps); 2724 return getNode(Opcode, makeVTList(VTs, NumVTs), Ops, NumOps); 2725} 2726 2727SDOperand SelectionDAG::getNode(unsigned Opcode, SDVTList VTList, 2728 const SDOperand *Ops, unsigned NumOps) { 2729 if (VTList.NumVTs == 1) 2730 return getNode(Opcode, VTList.VTs[0], Ops, NumOps); 2731 2732 switch (Opcode) { 2733 // FIXME: figure out how to safely handle things like 2734 // int foo(int x) { return 1 << (x & 255); } 2735 // int bar() { return foo(256); } 2736#if 0 2737 case ISD::SRA_PARTS: 2738 case ISD::SRL_PARTS: 2739 case ISD::SHL_PARTS: 2740 if (N3.getOpcode() == ISD::SIGN_EXTEND_INREG && 2741 cast<VTSDNode>(N3.getOperand(1))->getVT() != MVT::i1) 2742 return getNode(Opcode, VT, N1, N2, N3.getOperand(0)); 2743 else if (N3.getOpcode() == ISD::AND) 2744 if (ConstantSDNode *AndRHS = dyn_cast<ConstantSDNode>(N3.getOperand(1))) { 2745 // If the and is only masking out bits that cannot effect the shift, 2746 // eliminate the and. 2747 unsigned NumBits = MVT::getSizeInBits(VT)*2; 2748 if ((AndRHS->getValue() & (NumBits-1)) == NumBits-1) 2749 return getNode(Opcode, VT, N1, N2, N3.getOperand(0)); 2750 } 2751 break; 2752#endif 2753 } 2754 2755 // Memoize the node unless it returns a flag. 2756 SDNode *N; 2757 if (VTList.VTs[VTList.NumVTs-1] != MVT::Flag) { 2758 FoldingSetNodeID ID; 2759 AddNodeIDNode(ID, Opcode, VTList, Ops, NumOps); 2760 void *IP = 0; 2761 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP)) 2762 return SDOperand(E, 0); 2763 if (NumOps == 1) 2764 N = new UnarySDNode(Opcode, VTList, Ops[0]); 2765 else if (NumOps == 2) 2766 N = new BinarySDNode(Opcode, VTList, Ops[0], Ops[1]); 2767 else if (NumOps == 3) 2768 N = new TernarySDNode(Opcode, VTList, Ops[0], Ops[1], Ops[2]); 2769 else 2770 N = new SDNode(Opcode, VTList, Ops, NumOps); 2771 CSEMap.InsertNode(N, IP); 2772 } else { 2773 if (NumOps == 1) 2774 N = new UnarySDNode(Opcode, VTList, Ops[0]); 2775 else if (NumOps == 2) 2776 N = new BinarySDNode(Opcode, VTList, Ops[0], Ops[1]); 2777 else if (NumOps == 3) 2778 N = new TernarySDNode(Opcode, VTList, Ops[0], Ops[1], Ops[2]); 2779 else 2780 N = new SDNode(Opcode, VTList, Ops, NumOps); 2781 } 2782 AllNodes.push_back(N); 2783 return SDOperand(N, 0); 2784} 2785 2786SDOperand SelectionDAG::getNode(unsigned Opcode, SDVTList VTList) { 2787 return getNode(Opcode, VTList, 0, 0); 2788} 2789 2790SDOperand SelectionDAG::getNode(unsigned Opcode, SDVTList VTList, 2791 SDOperand N1) { 2792 SDOperand Ops[] = { N1 }; 2793 return getNode(Opcode, VTList, Ops, 1); 2794} 2795 2796SDOperand SelectionDAG::getNode(unsigned Opcode, SDVTList VTList, 2797 SDOperand N1, SDOperand N2) { 2798 SDOperand Ops[] = { N1, N2 }; 2799 return getNode(Opcode, VTList, Ops, 2); 2800} 2801 2802SDOperand SelectionDAG::getNode(unsigned Opcode, SDVTList VTList, 2803 SDOperand N1, SDOperand N2, SDOperand N3) { 2804 SDOperand Ops[] = { N1, N2, N3 }; 2805 return getNode(Opcode, VTList, Ops, 3); 2806} 2807 2808SDOperand SelectionDAG::getNode(unsigned Opcode, SDVTList VTList, 2809 SDOperand N1, SDOperand N2, SDOperand N3, 2810 SDOperand N4) { 2811 SDOperand Ops[] = { N1, N2, N3, N4 }; 2812 return getNode(Opcode, VTList, Ops, 4); 2813} 2814 2815SDOperand SelectionDAG::getNode(unsigned Opcode, SDVTList VTList, 2816 SDOperand N1, SDOperand N2, SDOperand N3, 2817 SDOperand N4, SDOperand N5) { 2818 SDOperand Ops[] = { N1, N2, N3, N4, N5 }; 2819 return getNode(Opcode, VTList, Ops, 5); 2820} 2821 2822SDVTList SelectionDAG::getVTList(MVT::ValueType VT) { 2823 return makeVTList(SDNode::getValueTypeList(VT), 1); 2824} 2825 2826SDVTList SelectionDAG::getVTList(MVT::ValueType VT1, MVT::ValueType VT2) { 2827 for (std::list<std::vector<MVT::ValueType> >::iterator I = VTList.begin(), 2828 E = VTList.end(); I != E; ++I) { 2829 if (I->size() == 2 && (*I)[0] == VT1 && (*I)[1] == VT2) 2830 return makeVTList(&(*I)[0], 2); 2831 } 2832 std::vector<MVT::ValueType> V; 2833 V.push_back(VT1); 2834 V.push_back(VT2); 2835 VTList.push_front(V); 2836 return makeVTList(&(*VTList.begin())[0], 2); 2837} 2838SDVTList SelectionDAG::getVTList(MVT::ValueType VT1, MVT::ValueType VT2, 2839 MVT::ValueType VT3) { 2840 for (std::list<std::vector<MVT::ValueType> >::iterator I = VTList.begin(), 2841 E = VTList.end(); I != E; ++I) { 2842 if (I->size() == 3 && (*I)[0] == VT1 && (*I)[1] == VT2 && 2843 (*I)[2] == VT3) 2844 return makeVTList(&(*I)[0], 3); 2845 } 2846 std::vector<MVT::ValueType> V; 2847 V.push_back(VT1); 2848 V.push_back(VT2); 2849 V.push_back(VT3); 2850 VTList.push_front(V); 2851 return makeVTList(&(*VTList.begin())[0], 3); 2852} 2853 2854SDVTList SelectionDAG::getVTList(const MVT::ValueType *VTs, unsigned NumVTs) { 2855 switch (NumVTs) { 2856 case 0: assert(0 && "Cannot have nodes without results!"); 2857 case 1: return getVTList(VTs[0]); 2858 case 2: return getVTList(VTs[0], VTs[1]); 2859 case 3: return getVTList(VTs[0], VTs[1], VTs[2]); 2860 default: break; 2861 } 2862 2863 for (std::list<std::vector<MVT::ValueType> >::iterator I = VTList.begin(), 2864 E = VTList.end(); I != E; ++I) { 2865 if (I->size() != NumVTs || VTs[0] != (*I)[0] || VTs[1] != (*I)[1]) continue; 2866 2867 bool NoMatch = false; 2868 for (unsigned i = 2; i != NumVTs; ++i) 2869 if (VTs[i] != (*I)[i]) { 2870 NoMatch = true; 2871 break; 2872 } 2873 if (!NoMatch) 2874 return makeVTList(&*I->begin(), NumVTs); 2875 } 2876 2877 VTList.push_front(std::vector<MVT::ValueType>(VTs, VTs+NumVTs)); 2878 return makeVTList(&*VTList.begin()->begin(), NumVTs); 2879} 2880 2881 2882/// UpdateNodeOperands - *Mutate* the specified node in-place to have the 2883/// specified operands. If the resultant node already exists in the DAG, 2884/// this does not modify the specified node, instead it returns the node that 2885/// already exists. If the resultant node does not exist in the DAG, the 2886/// input node is returned. As a degenerate case, if you specify the same 2887/// input operands as the node already has, the input node is returned. 2888SDOperand SelectionDAG:: 2889UpdateNodeOperands(SDOperand InN, SDOperand Op) { 2890 SDNode *N = InN.Val; 2891 assert(N->getNumOperands() == 1 && "Update with wrong number of operands"); 2892 2893 // Check to see if there is no change. 2894 if (Op == N->getOperand(0)) return InN; 2895 2896 // See if the modified node already exists. 2897 void *InsertPos = 0; 2898 if (SDNode *Existing = FindModifiedNodeSlot(N, Op, InsertPos)) 2899 return SDOperand(Existing, InN.ResNo); 2900 2901 // Nope it doesn't. Remove the node from it's current place in the maps. 2902 if (InsertPos) 2903 RemoveNodeFromCSEMaps(N); 2904 2905 // Now we update the operands. 2906 N->OperandList[0].Val->removeUser(N); 2907 Op.Val->addUser(N); 2908 N->OperandList[0] = Op; 2909 2910 // If this gets put into a CSE map, add it. 2911 if (InsertPos) CSEMap.InsertNode(N, InsertPos); 2912 return InN; 2913} 2914 2915SDOperand SelectionDAG:: 2916UpdateNodeOperands(SDOperand InN, SDOperand Op1, SDOperand Op2) { 2917 SDNode *N = InN.Val; 2918 assert(N->getNumOperands() == 2 && "Update with wrong number of operands"); 2919 2920 // Check to see if there is no change. 2921 if (Op1 == N->getOperand(0) && Op2 == N->getOperand(1)) 2922 return InN; // No operands changed, just return the input node. 2923 2924 // See if the modified node already exists. 2925 void *InsertPos = 0; 2926 if (SDNode *Existing = FindModifiedNodeSlot(N, Op1, Op2, InsertPos)) 2927 return SDOperand(Existing, InN.ResNo); 2928 2929 // Nope it doesn't. Remove the node from it's current place in the maps. 2930 if (InsertPos) 2931 RemoveNodeFromCSEMaps(N); 2932 2933 // Now we update the operands. 2934 if (N->OperandList[0] != Op1) { 2935 N->OperandList[0].Val->removeUser(N); 2936 Op1.Val->addUser(N); 2937 N->OperandList[0] = Op1; 2938 } 2939 if (N->OperandList[1] != Op2) { 2940 N->OperandList[1].Val->removeUser(N); 2941 Op2.Val->addUser(N); 2942 N->OperandList[1] = Op2; 2943 } 2944 2945 // If this gets put into a CSE map, add it. 2946 if (InsertPos) CSEMap.InsertNode(N, InsertPos); 2947 return InN; 2948} 2949 2950SDOperand SelectionDAG:: 2951UpdateNodeOperands(SDOperand N, SDOperand Op1, SDOperand Op2, SDOperand Op3) { 2952 SDOperand Ops[] = { Op1, Op2, Op3 }; 2953 return UpdateNodeOperands(N, Ops, 3); 2954} 2955 2956SDOperand SelectionDAG:: 2957UpdateNodeOperands(SDOperand N, SDOperand Op1, SDOperand Op2, 2958 SDOperand Op3, SDOperand Op4) { 2959 SDOperand Ops[] = { Op1, Op2, Op3, Op4 }; 2960 return UpdateNodeOperands(N, Ops, 4); 2961} 2962 2963SDOperand SelectionDAG:: 2964UpdateNodeOperands(SDOperand N, SDOperand Op1, SDOperand Op2, 2965 SDOperand Op3, SDOperand Op4, SDOperand Op5) { 2966 SDOperand Ops[] = { Op1, Op2, Op3, Op4, Op5 }; 2967 return UpdateNodeOperands(N, Ops, 5); 2968} 2969 2970 2971SDOperand SelectionDAG:: 2972UpdateNodeOperands(SDOperand InN, SDOperand *Ops, unsigned NumOps) { 2973 SDNode *N = InN.Val; 2974 assert(N->getNumOperands() == NumOps && 2975 "Update with wrong number of operands"); 2976 2977 // Check to see if there is no change. 2978 bool AnyChange = false; 2979 for (unsigned i = 0; i != NumOps; ++i) { 2980 if (Ops[i] != N->getOperand(i)) { 2981 AnyChange = true; 2982 break; 2983 } 2984 } 2985 2986 // No operands changed, just return the input node. 2987 if (!AnyChange) return InN; 2988 2989 // See if the modified node already exists. 2990 void *InsertPos = 0; 2991 if (SDNode *Existing = FindModifiedNodeSlot(N, Ops, NumOps, InsertPos)) 2992 return SDOperand(Existing, InN.ResNo); 2993 2994 // Nope it doesn't. Remove the node from it's current place in the maps. 2995 if (InsertPos) 2996 RemoveNodeFromCSEMaps(N); 2997 2998 // Now we update the operands. 2999 for (unsigned i = 0; i != NumOps; ++i) { 3000 if (N->OperandList[i] != Ops[i]) { 3001 N->OperandList[i].Val->removeUser(N); 3002 Ops[i].Val->addUser(N); 3003 N->OperandList[i] = Ops[i]; 3004 } 3005 } 3006 3007 // If this gets put into a CSE map, add it. 3008 if (InsertPos) CSEMap.InsertNode(N, InsertPos); 3009 return InN; 3010} 3011 3012 3013/// MorphNodeTo - This frees the operands of the current node, resets the 3014/// opcode, types, and operands to the specified value. This should only be 3015/// used by the SelectionDAG class. 3016void SDNode::MorphNodeTo(unsigned Opc, SDVTList L, 3017 const SDOperand *Ops, unsigned NumOps) { 3018 NodeType = Opc; 3019 ValueList = L.VTs; 3020 NumValues = L.NumVTs; 3021 3022 // Clear the operands list, updating used nodes to remove this from their 3023 // use list. 3024 for (op_iterator I = op_begin(), E = op_end(); I != E; ++I) 3025 I->Val->removeUser(this); 3026 3027 // If NumOps is larger than the # of operands we currently have, reallocate 3028 // the operand list. 3029 if (NumOps > NumOperands) { 3030 if (OperandsNeedDelete) 3031 delete [] OperandList; 3032 OperandList = new SDOperand[NumOps]; 3033 OperandsNeedDelete = true; 3034 } 3035 3036 // Assign the new operands. 3037 NumOperands = NumOps; 3038 3039 for (unsigned i = 0, e = NumOps; i != e; ++i) { 3040 OperandList[i] = Ops[i]; 3041 SDNode *N = OperandList[i].Val; 3042 N->Uses.push_back(this); 3043 } 3044} 3045 3046/// SelectNodeTo - These are used for target selectors to *mutate* the 3047/// specified node to have the specified return type, Target opcode, and 3048/// operands. Note that target opcodes are stored as 3049/// ISD::BUILTIN_OP_END+TargetOpcode in the node opcode field. 3050/// 3051/// Note that SelectNodeTo returns the resultant node. If there is already a 3052/// node of the specified opcode and operands, it returns that node instead of 3053/// the current one. 3054SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc, 3055 MVT::ValueType VT) { 3056 SDVTList VTs = getVTList(VT); 3057 FoldingSetNodeID ID; 3058 AddNodeIDNode(ID, ISD::BUILTIN_OP_END+TargetOpc, VTs, 0, 0); 3059 void *IP = 0; 3060 if (SDNode *ON = CSEMap.FindNodeOrInsertPos(ID, IP)) 3061 return ON; 3062 3063 RemoveNodeFromCSEMaps(N); 3064 3065 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc, VTs, 0, 0); 3066 3067 CSEMap.InsertNode(N, IP); 3068 return N; 3069} 3070 3071SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc, 3072 MVT::ValueType VT, SDOperand Op1) { 3073 // If an identical node already exists, use it. 3074 SDVTList VTs = getVTList(VT); 3075 SDOperand Ops[] = { Op1 }; 3076 3077 FoldingSetNodeID ID; 3078 AddNodeIDNode(ID, ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 1); 3079 void *IP = 0; 3080 if (SDNode *ON = CSEMap.FindNodeOrInsertPos(ID, IP)) 3081 return ON; 3082 3083 RemoveNodeFromCSEMaps(N); 3084 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 1); 3085 CSEMap.InsertNode(N, IP); 3086 return N; 3087} 3088 3089SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc, 3090 MVT::ValueType VT, SDOperand Op1, 3091 SDOperand Op2) { 3092 // If an identical node already exists, use it. 3093 SDVTList VTs = getVTList(VT); 3094 SDOperand Ops[] = { Op1, Op2 }; 3095 3096 FoldingSetNodeID ID; 3097 AddNodeIDNode(ID, ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 2); 3098 void *IP = 0; 3099 if (SDNode *ON = CSEMap.FindNodeOrInsertPos(ID, IP)) 3100 return ON; 3101 3102 RemoveNodeFromCSEMaps(N); 3103 3104 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 2); 3105 3106 CSEMap.InsertNode(N, IP); // Memoize the new node. 3107 return N; 3108} 3109 3110SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc, 3111 MVT::ValueType VT, SDOperand Op1, 3112 SDOperand Op2, SDOperand Op3) { 3113 // If an identical node already exists, use it. 3114 SDVTList VTs = getVTList(VT); 3115 SDOperand Ops[] = { Op1, Op2, Op3 }; 3116 FoldingSetNodeID ID; 3117 AddNodeIDNode(ID, ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 3); 3118 void *IP = 0; 3119 if (SDNode *ON = CSEMap.FindNodeOrInsertPos(ID, IP)) 3120 return ON; 3121 3122 RemoveNodeFromCSEMaps(N); 3123 3124 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 3); 3125 3126 CSEMap.InsertNode(N, IP); // Memoize the new node. 3127 return N; 3128} 3129 3130SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc, 3131 MVT::ValueType VT, const SDOperand *Ops, 3132 unsigned NumOps) { 3133 // If an identical node already exists, use it. 3134 SDVTList VTs = getVTList(VT); 3135 FoldingSetNodeID ID; 3136 AddNodeIDNode(ID, ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, NumOps); 3137 void *IP = 0; 3138 if (SDNode *ON = CSEMap.FindNodeOrInsertPos(ID, IP)) 3139 return ON; 3140 3141 RemoveNodeFromCSEMaps(N); 3142 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, NumOps); 3143 3144 CSEMap.InsertNode(N, IP); // Memoize the new node. 3145 return N; 3146} 3147 3148SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc, 3149 MVT::ValueType VT1, MVT::ValueType VT2, 3150 SDOperand Op1, SDOperand Op2) { 3151 SDVTList VTs = getVTList(VT1, VT2); 3152 FoldingSetNodeID ID; 3153 SDOperand Ops[] = { Op1, Op2 }; 3154 AddNodeIDNode(ID, ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 2); 3155 void *IP = 0; 3156 if (SDNode *ON = CSEMap.FindNodeOrInsertPos(ID, IP)) 3157 return ON; 3158 3159 RemoveNodeFromCSEMaps(N); 3160 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 2); 3161 CSEMap.InsertNode(N, IP); // Memoize the new node. 3162 return N; 3163} 3164 3165SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc, 3166 MVT::ValueType VT1, MVT::ValueType VT2, 3167 SDOperand Op1, SDOperand Op2, 3168 SDOperand Op3) { 3169 // If an identical node already exists, use it. 3170 SDVTList VTs = getVTList(VT1, VT2); 3171 SDOperand Ops[] = { Op1, Op2, Op3 }; 3172 FoldingSetNodeID ID; 3173 AddNodeIDNode(ID, ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 3); 3174 void *IP = 0; 3175 if (SDNode *ON = CSEMap.FindNodeOrInsertPos(ID, IP)) 3176 return ON; 3177 3178 RemoveNodeFromCSEMaps(N); 3179 3180 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 3); 3181 CSEMap.InsertNode(N, IP); // Memoize the new node. 3182 return N; 3183} 3184 3185 3186/// getTargetNode - These are used for target selectors to create a new node 3187/// with specified return type(s), target opcode, and operands. 3188/// 3189/// Note that getTargetNode returns the resultant node. If there is already a 3190/// node of the specified opcode and operands, it returns that node instead of 3191/// the current one. 3192SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT) { 3193 return getNode(ISD::BUILTIN_OP_END+Opcode, VT).Val; 3194} 3195SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT, 3196 SDOperand Op1) { 3197 return getNode(ISD::BUILTIN_OP_END+Opcode, VT, Op1).Val; 3198} 3199SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT, 3200 SDOperand Op1, SDOperand Op2) { 3201 return getNode(ISD::BUILTIN_OP_END+Opcode, VT, Op1, Op2).Val; 3202} 3203SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT, 3204 SDOperand Op1, SDOperand Op2, 3205 SDOperand Op3) { 3206 return getNode(ISD::BUILTIN_OP_END+Opcode, VT, Op1, Op2, Op3).Val; 3207} 3208SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT, 3209 const SDOperand *Ops, unsigned NumOps) { 3210 return getNode(ISD::BUILTIN_OP_END+Opcode, VT, Ops, NumOps).Val; 3211} 3212SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1, 3213 MVT::ValueType VT2) { 3214 const MVT::ValueType *VTs = getNodeValueTypes(VT1, VT2); 3215 SDOperand Op; 3216 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 2, &Op, 0).Val; 3217} 3218SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1, 3219 MVT::ValueType VT2, SDOperand Op1) { 3220 const MVT::ValueType *VTs = getNodeValueTypes(VT1, VT2); 3221 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 2, &Op1, 1).Val; 3222} 3223SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1, 3224 MVT::ValueType VT2, SDOperand Op1, 3225 SDOperand Op2) { 3226 const MVT::ValueType *VTs = getNodeValueTypes(VT1, VT2); 3227 SDOperand Ops[] = { Op1, Op2 }; 3228 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 2, Ops, 2).Val; 3229} 3230SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1, 3231 MVT::ValueType VT2, SDOperand Op1, 3232 SDOperand Op2, SDOperand Op3) { 3233 const MVT::ValueType *VTs = getNodeValueTypes(VT1, VT2); 3234 SDOperand Ops[] = { Op1, Op2, Op3 }; 3235 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 2, Ops, 3).Val; 3236} 3237SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1, 3238 MVT::ValueType VT2, 3239 const SDOperand *Ops, unsigned NumOps) { 3240 const MVT::ValueType *VTs = getNodeValueTypes(VT1, VT2); 3241 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 2, Ops, NumOps).Val; 3242} 3243SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1, 3244 MVT::ValueType VT2, MVT::ValueType VT3, 3245 SDOperand Op1, SDOperand Op2) { 3246 const MVT::ValueType *VTs = getNodeValueTypes(VT1, VT2, VT3); 3247 SDOperand Ops[] = { Op1, Op2 }; 3248 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 3, Ops, 2).Val; 3249} 3250SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1, 3251 MVT::ValueType VT2, MVT::ValueType VT3, 3252 SDOperand Op1, SDOperand Op2, 3253 SDOperand Op3) { 3254 const MVT::ValueType *VTs = getNodeValueTypes(VT1, VT2, VT3); 3255 SDOperand Ops[] = { Op1, Op2, Op3 }; 3256 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 3, Ops, 3).Val; 3257} 3258SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1, 3259 MVT::ValueType VT2, MVT::ValueType VT3, 3260 const SDOperand *Ops, unsigned NumOps) { 3261 const MVT::ValueType *VTs = getNodeValueTypes(VT1, VT2, VT3); 3262 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 3, Ops, NumOps).Val; 3263} 3264SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1, 3265 MVT::ValueType VT2, MVT::ValueType VT3, 3266 MVT::ValueType VT4, 3267 const SDOperand *Ops, unsigned NumOps) { 3268 std::vector<MVT::ValueType> VTList; 3269 VTList.push_back(VT1); 3270 VTList.push_back(VT2); 3271 VTList.push_back(VT3); 3272 VTList.push_back(VT4); 3273 const MVT::ValueType *VTs = getNodeValueTypes(VTList); 3274 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 4, Ops, NumOps).Val; 3275} 3276SDNode *SelectionDAG::getTargetNode(unsigned Opcode, 3277 std::vector<MVT::ValueType> &ResultTys, 3278 const SDOperand *Ops, unsigned NumOps) { 3279 const MVT::ValueType *VTs = getNodeValueTypes(ResultTys); 3280 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, ResultTys.size(), 3281 Ops, NumOps).Val; 3282} 3283 3284 3285/// ReplaceAllUsesWith - Modify anything using 'From' to use 'To' instead. 3286/// This can cause recursive merging of nodes in the DAG. 3287/// 3288/// This version assumes From has a single result value. 3289/// 3290void SelectionDAG::ReplaceAllUsesWith(SDOperand FromN, SDOperand To, 3291 DAGUpdateListener *UpdateListener) { 3292 SDNode *From = FromN.Val; 3293 assert(From->getNumValues() == 1 && FromN.ResNo == 0 && 3294 "Cannot replace with this method!"); 3295 assert(From != To.Val && "Cannot replace uses of with self"); 3296 3297 while (!From->use_empty()) { 3298 // Process users until they are all gone. 3299 SDNode *U = *From->use_begin(); 3300 3301 // This node is about to morph, remove its old self from the CSE maps. 3302 RemoveNodeFromCSEMaps(U); 3303 3304 for (SDOperand *I = U->OperandList, *E = U->OperandList+U->NumOperands; 3305 I != E; ++I) 3306 if (I->Val == From) { 3307 From->removeUser(U); 3308 *I = To; 3309 To.Val->addUser(U); 3310 } 3311 3312 // Now that we have modified U, add it back to the CSE maps. If it already 3313 // exists there, recursively merge the results together. 3314 if (SDNode *Existing = AddNonLeafNodeToCSEMaps(U)) { 3315 ReplaceAllUsesWith(U, Existing, UpdateListener); 3316 // U is now dead. Inform the listener if it exists and delete it. 3317 if (UpdateListener) 3318 UpdateListener->NodeDeleted(U); 3319 DeleteNodeNotInCSEMaps(U); 3320 } else { 3321 // If the node doesn't already exist, we updated it. Inform a listener if 3322 // it exists. 3323 if (UpdateListener) 3324 UpdateListener->NodeUpdated(U); 3325 } 3326 } 3327} 3328 3329/// ReplaceAllUsesWith - Modify anything using 'From' to use 'To' instead. 3330/// This can cause recursive merging of nodes in the DAG. 3331/// 3332/// This version assumes From/To have matching types and numbers of result 3333/// values. 3334/// 3335void SelectionDAG::ReplaceAllUsesWith(SDNode *From, SDNode *To, 3336 DAGUpdateListener *UpdateListener) { 3337 assert(From != To && "Cannot replace uses of with self"); 3338 assert(From->getNumValues() == To->getNumValues() && 3339 "Cannot use this version of ReplaceAllUsesWith!"); 3340 if (From->getNumValues() == 1) // If possible, use the faster version. 3341 return ReplaceAllUsesWith(SDOperand(From, 0), SDOperand(To, 0), 3342 UpdateListener); 3343 3344 while (!From->use_empty()) { 3345 // Process users until they are all gone. 3346 SDNode *U = *From->use_begin(); 3347 3348 // This node is about to morph, remove its old self from the CSE maps. 3349 RemoveNodeFromCSEMaps(U); 3350 3351 for (SDOperand *I = U->OperandList, *E = U->OperandList+U->NumOperands; 3352 I != E; ++I) 3353 if (I->Val == From) { 3354 From->removeUser(U); 3355 I->Val = To; 3356 To->addUser(U); 3357 } 3358 3359 // Now that we have modified U, add it back to the CSE maps. If it already 3360 // exists there, recursively merge the results together. 3361 if (SDNode *Existing = AddNonLeafNodeToCSEMaps(U)) { 3362 ReplaceAllUsesWith(U, Existing, UpdateListener); 3363 // U is now dead. Inform the listener if it exists and delete it. 3364 if (UpdateListener) 3365 UpdateListener->NodeDeleted(U); 3366 DeleteNodeNotInCSEMaps(U); 3367 } else { 3368 // If the node doesn't already exist, we updated it. Inform a listener if 3369 // it exists. 3370 if (UpdateListener) 3371 UpdateListener->NodeUpdated(U); 3372 } 3373 } 3374} 3375 3376/// ReplaceAllUsesWith - Modify anything using 'From' to use 'To' instead. 3377/// This can cause recursive merging of nodes in the DAG. 3378/// 3379/// This version can replace From with any result values. To must match the 3380/// number and types of values returned by From. 3381void SelectionDAG::ReplaceAllUsesWith(SDNode *From, 3382 const SDOperand *To, 3383 DAGUpdateListener *UpdateListener) { 3384 if (From->getNumValues() == 1) // Handle the simple case efficiently. 3385 return ReplaceAllUsesWith(SDOperand(From, 0), To[0], UpdateListener); 3386 3387 while (!From->use_empty()) { 3388 // Process users until they are all gone. 3389 SDNode *U = *From->use_begin(); 3390 3391 // This node is about to morph, remove its old self from the CSE maps. 3392 RemoveNodeFromCSEMaps(U); 3393 3394 for (SDOperand *I = U->OperandList, *E = U->OperandList+U->NumOperands; 3395 I != E; ++I) 3396 if (I->Val == From) { 3397 const SDOperand &ToOp = To[I->ResNo]; 3398 From->removeUser(U); 3399 *I = ToOp; 3400 ToOp.Val->addUser(U); 3401 } 3402 3403 // Now that we have modified U, add it back to the CSE maps. If it already 3404 // exists there, recursively merge the results together. 3405 if (SDNode *Existing = AddNonLeafNodeToCSEMaps(U)) { 3406 ReplaceAllUsesWith(U, Existing, UpdateListener); 3407 // U is now dead. Inform the listener if it exists and delete it. 3408 if (UpdateListener) 3409 UpdateListener->NodeDeleted(U); 3410 DeleteNodeNotInCSEMaps(U); 3411 } else { 3412 // If the node doesn't already exist, we updated it. Inform a listener if 3413 // it exists. 3414 if (UpdateListener) 3415 UpdateListener->NodeUpdated(U); 3416 } 3417 } 3418} 3419 3420namespace { 3421 /// ChainedSetUpdaterListener - This class is a DAGUpdateListener that removes 3422 /// any deleted nodes from the set passed into its constructor and recursively 3423 /// notifies another update listener if specified. 3424 class ChainedSetUpdaterListener : 3425 public SelectionDAG::DAGUpdateListener { 3426 SmallSetVector<SDNode*, 16> &Set; 3427 SelectionDAG::DAGUpdateListener *Chain; 3428 public: 3429 ChainedSetUpdaterListener(SmallSetVector<SDNode*, 16> &set, 3430 SelectionDAG::DAGUpdateListener *chain) 3431 : Set(set), Chain(chain) {} 3432 3433 virtual void NodeDeleted(SDNode *N) { 3434 Set.remove(N); 3435 if (Chain) Chain->NodeDeleted(N); 3436 } 3437 virtual void NodeUpdated(SDNode *N) { 3438 if (Chain) Chain->NodeUpdated(N); 3439 } 3440 }; 3441} 3442 3443/// ReplaceAllUsesOfValueWith - Replace any uses of From with To, leaving 3444/// uses of other values produced by From.Val alone. The Deleted vector is 3445/// handled the same way as for ReplaceAllUsesWith. 3446void SelectionDAG::ReplaceAllUsesOfValueWith(SDOperand From, SDOperand To, 3447 DAGUpdateListener *UpdateListener){ 3448 assert(From != To && "Cannot replace a value with itself"); 3449 3450 // Handle the simple, trivial, case efficiently. 3451 if (From.Val->getNumValues() == 1) { 3452 ReplaceAllUsesWith(From, To, UpdateListener); 3453 return; 3454 } 3455 3456 if (From.use_empty()) return; 3457 3458 // Get all of the users of From.Val. We want these in a nice, 3459 // deterministically ordered and uniqued set, so we use a SmallSetVector. 3460 SmallSetVector<SDNode*, 16> Users(From.Val->use_begin(), From.Val->use_end()); 3461 3462 // When one of the recursive merges deletes nodes from the graph, we need to 3463 // make sure that UpdateListener is notified *and* that the node is removed 3464 // from Users if present. CSUL does this. 3465 ChainedSetUpdaterListener CSUL(Users, UpdateListener); 3466 3467 while (!Users.empty()) { 3468 // We know that this user uses some value of From. If it is the right 3469 // value, update it. 3470 SDNode *User = Users.back(); 3471 Users.pop_back(); 3472 3473 // Scan for an operand that matches From. 3474 SDOperand *Op = User->OperandList, *E = User->OperandList+User->NumOperands; 3475 for (; Op != E; ++Op) 3476 if (*Op == From) break; 3477 3478 // If there are no matches, the user must use some other result of From. 3479 if (Op == E) continue; 3480 3481 // Okay, we know this user needs to be updated. Remove its old self 3482 // from the CSE maps. 3483 RemoveNodeFromCSEMaps(User); 3484 3485 // Update all operands that match "From" in case there are multiple uses. 3486 for (; Op != E; ++Op) { 3487 if (*Op == From) { 3488 From.Val->removeUser(User); 3489 *Op = To; 3490 To.Val->addUser(User); 3491 } 3492 } 3493 3494 // Now that we have modified User, add it back to the CSE maps. If it 3495 // already exists there, recursively merge the results together. 3496 SDNode *Existing = AddNonLeafNodeToCSEMaps(User); 3497 if (!Existing) { 3498 if (UpdateListener) UpdateListener->NodeUpdated(User); 3499 continue; // Continue on to next user. 3500 } 3501 3502 // If there was already an existing matching node, use ReplaceAllUsesWith 3503 // to replace the dead one with the existing one. This can cause 3504 // recursive merging of other unrelated nodes down the line. The merging 3505 // can cause deletion of nodes that used the old value. To handle this, we 3506 // use CSUL to remove them from the Users set. 3507 ReplaceAllUsesWith(User, Existing, &CSUL); 3508 3509 // User is now dead. Notify a listener if present. 3510 if (UpdateListener) UpdateListener->NodeDeleted(User); 3511 DeleteNodeNotInCSEMaps(User); 3512 } 3513} 3514 3515 3516/// AssignNodeIds - Assign a unique node id for each node in the DAG based on 3517/// their allnodes order. It returns the maximum id. 3518unsigned SelectionDAG::AssignNodeIds() { 3519 unsigned Id = 0; 3520 for (allnodes_iterator I = allnodes_begin(), E = allnodes_end(); I != E; ++I){ 3521 SDNode *N = I; 3522 N->setNodeId(Id++); 3523 } 3524 return Id; 3525} 3526 3527/// AssignTopologicalOrder - Assign a unique node id for each node in the DAG 3528/// based on their topological order. It returns the maximum id and a vector 3529/// of the SDNodes* in assigned order by reference. 3530unsigned SelectionDAG::AssignTopologicalOrder(std::vector<SDNode*> &TopOrder) { 3531 unsigned DAGSize = AllNodes.size(); 3532 std::vector<unsigned> InDegree(DAGSize); 3533 std::vector<SDNode*> Sources; 3534 3535 // Use a two pass approach to avoid using a std::map which is slow. 3536 unsigned Id = 0; 3537 for (allnodes_iterator I = allnodes_begin(),E = allnodes_end(); I != E; ++I){ 3538 SDNode *N = I; 3539 N->setNodeId(Id++); 3540 unsigned Degree = N->use_size(); 3541 InDegree[N->getNodeId()] = Degree; 3542 if (Degree == 0) 3543 Sources.push_back(N); 3544 } 3545 3546 TopOrder.clear(); 3547 while (!Sources.empty()) { 3548 SDNode *N = Sources.back(); 3549 Sources.pop_back(); 3550 TopOrder.push_back(N); 3551 for (SDNode::op_iterator I = N->op_begin(), E = N->op_end(); I != E; ++I) { 3552 SDNode *P = I->Val; 3553 unsigned Degree = --InDegree[P->getNodeId()]; 3554 if (Degree == 0) 3555 Sources.push_back(P); 3556 } 3557 } 3558 3559 // Second pass, assign the actual topological order as node ids. 3560 Id = 0; 3561 for (std::vector<SDNode*>::iterator TI = TopOrder.begin(),TE = TopOrder.end(); 3562 TI != TE; ++TI) 3563 (*TI)->setNodeId(Id++); 3564 3565 return Id; 3566} 3567 3568 3569 3570//===----------------------------------------------------------------------===// 3571// SDNode Class 3572//===----------------------------------------------------------------------===// 3573 3574// Out-of-line virtual method to give class a home. 3575void SDNode::ANCHOR() {} 3576void UnarySDNode::ANCHOR() {} 3577void BinarySDNode::ANCHOR() {} 3578void TernarySDNode::ANCHOR() {} 3579void HandleSDNode::ANCHOR() {} 3580void StringSDNode::ANCHOR() {} 3581void ConstantSDNode::ANCHOR() {} 3582void ConstantFPSDNode::ANCHOR() {} 3583void GlobalAddressSDNode::ANCHOR() {} 3584void FrameIndexSDNode::ANCHOR() {} 3585void JumpTableSDNode::ANCHOR() {} 3586void ConstantPoolSDNode::ANCHOR() {} 3587void BasicBlockSDNode::ANCHOR() {} 3588void SrcValueSDNode::ANCHOR() {} 3589void MemOperandSDNode::ANCHOR() {} 3590void RegisterSDNode::ANCHOR() {} 3591void ExternalSymbolSDNode::ANCHOR() {} 3592void CondCodeSDNode::ANCHOR() {} 3593void VTSDNode::ANCHOR() {} 3594void LoadSDNode::ANCHOR() {} 3595void StoreSDNode::ANCHOR() {} 3596 3597HandleSDNode::~HandleSDNode() { 3598 SDVTList VTs = { 0, 0 }; 3599 MorphNodeTo(ISD::HANDLENODE, VTs, 0, 0); // Drops operand uses. 3600} 3601 3602GlobalAddressSDNode::GlobalAddressSDNode(bool isTarget, const GlobalValue *GA, 3603 MVT::ValueType VT, int o) 3604 : SDNode(isa<GlobalVariable>(GA) && 3605 cast<GlobalVariable>(GA)->isThreadLocal() ? 3606 // Thread Local 3607 (isTarget ? ISD::TargetGlobalTLSAddress : ISD::GlobalTLSAddress) : 3608 // Non Thread Local 3609 (isTarget ? ISD::TargetGlobalAddress : ISD::GlobalAddress), 3610 getSDVTList(VT)), Offset(o) { 3611 TheGlobal = const_cast<GlobalValue*>(GA); 3612} 3613 3614/// getMemOperand - Return a MemOperand object describing the memory 3615/// reference performed by this load or store. 3616MemOperand LSBaseSDNode::getMemOperand() const { 3617 int Size = (MVT::getSizeInBits(getMemoryVT()) + 7) >> 3; 3618 int Flags = 3619 getOpcode() == ISD::LOAD ? MemOperand::MOLoad : MemOperand::MOStore; 3620 if (IsVolatile) Flags |= MemOperand::MOVolatile; 3621 3622 // Check if the load references a frame index, and does not have 3623 // an SV attached. 3624 const FrameIndexSDNode *FI = 3625 dyn_cast<const FrameIndexSDNode>(getBasePtr().Val); 3626 if (!getSrcValue() && FI) 3627 return MemOperand(PseudoSourceValue::getFixedStack(), Flags, 3628 FI->getIndex(), Size, Alignment); 3629 else 3630 return MemOperand(getSrcValue(), Flags, 3631 getSrcValueOffset(), Size, Alignment); 3632} 3633 3634/// Profile - Gather unique data for the node. 3635/// 3636void SDNode::Profile(FoldingSetNodeID &ID) { 3637 AddNodeIDNode(ID, this); 3638} 3639 3640/// getValueTypeList - Return a pointer to the specified value type. 3641/// 3642const MVT::ValueType *SDNode::getValueTypeList(MVT::ValueType VT) { 3643 if (MVT::isExtendedVT(VT)) { 3644 static std::set<MVT::ValueType> EVTs; 3645 return &(*EVTs.insert(VT).first); 3646 } else { 3647 static MVT::ValueType VTs[MVT::LAST_VALUETYPE]; 3648 VTs[VT] = VT; 3649 return &VTs[VT]; 3650 } 3651} 3652 3653/// hasNUsesOfValue - Return true if there are exactly NUSES uses of the 3654/// indicated value. This method ignores uses of other values defined by this 3655/// operation. 3656bool SDNode::hasNUsesOfValue(unsigned NUses, unsigned Value) const { 3657 assert(Value < getNumValues() && "Bad value!"); 3658 3659 // If there is only one value, this is easy. 3660 if (getNumValues() == 1) 3661 return use_size() == NUses; 3662 if (use_size() < NUses) return false; 3663 3664 SDOperand TheValue(const_cast<SDNode *>(this), Value); 3665 3666 SmallPtrSet<SDNode*, 32> UsersHandled; 3667 3668 for (SDNode::use_iterator UI = Uses.begin(), E = Uses.end(); UI != E; ++UI) { 3669 SDNode *User = *UI; 3670 if (User->getNumOperands() == 1 || 3671 UsersHandled.insert(User)) // First time we've seen this? 3672 for (unsigned i = 0, e = User->getNumOperands(); i != e; ++i) 3673 if (User->getOperand(i) == TheValue) { 3674 if (NUses == 0) 3675 return false; // too many uses 3676 --NUses; 3677 } 3678 } 3679 3680 // Found exactly the right number of uses? 3681 return NUses == 0; 3682} 3683 3684 3685/// hasAnyUseOfValue - Return true if there are any use of the indicated 3686/// value. This method ignores uses of other values defined by this operation. 3687bool SDNode::hasAnyUseOfValue(unsigned Value) const { 3688 assert(Value < getNumValues() && "Bad value!"); 3689 3690 if (use_empty()) return false; 3691 3692 SDOperand TheValue(const_cast<SDNode *>(this), Value); 3693 3694 SmallPtrSet<SDNode*, 32> UsersHandled; 3695 3696 for (SDNode::use_iterator UI = Uses.begin(), E = Uses.end(); UI != E; ++UI) { 3697 SDNode *User = *UI; 3698 if (User->getNumOperands() == 1 || 3699 UsersHandled.insert(User)) // First time we've seen this? 3700 for (unsigned i = 0, e = User->getNumOperands(); i != e; ++i) 3701 if (User->getOperand(i) == TheValue) { 3702 return true; 3703 } 3704 } 3705 3706 return false; 3707} 3708 3709 3710/// isOnlyUse - Return true if this node is the only use of N. 3711/// 3712bool SDNode::isOnlyUse(SDNode *N) const { 3713 bool Seen = false; 3714 for (SDNode::use_iterator I = N->use_begin(), E = N->use_end(); I != E; ++I) { 3715 SDNode *User = *I; 3716 if (User == this) 3717 Seen = true; 3718 else 3719 return false; 3720 } 3721 3722 return Seen; 3723} 3724 3725/// isOperand - Return true if this node is an operand of N. 3726/// 3727bool SDOperand::isOperand(SDNode *N) const { 3728 for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i) 3729 if (*this == N->getOperand(i)) 3730 return true; 3731 return false; 3732} 3733 3734bool SDNode::isOperand(SDNode *N) const { 3735 for (unsigned i = 0, e = N->NumOperands; i != e; ++i) 3736 if (this == N->OperandList[i].Val) 3737 return true; 3738 return false; 3739} 3740 3741/// reachesChainWithoutSideEffects - Return true if this operand (which must 3742/// be a chain) reaches the specified operand without crossing any 3743/// side-effecting instructions. In practice, this looks through token 3744/// factors and non-volatile loads. In order to remain efficient, this only 3745/// looks a couple of nodes in, it does not do an exhaustive search. 3746bool SDOperand::reachesChainWithoutSideEffects(SDOperand Dest, 3747 unsigned Depth) const { 3748 if (*this == Dest) return true; 3749 3750 // Don't search too deeply, we just want to be able to see through 3751 // TokenFactor's etc. 3752 if (Depth == 0) return false; 3753 3754 // If this is a token factor, all inputs to the TF happen in parallel. If any 3755 // of the operands of the TF reach dest, then we can do the xform. 3756 if (getOpcode() == ISD::TokenFactor) { 3757 for (unsigned i = 0, e = getNumOperands(); i != e; ++i) 3758 if (getOperand(i).reachesChainWithoutSideEffects(Dest, Depth-1)) 3759 return true; 3760 return false; 3761 } 3762 3763 // Loads don't have side effects, look through them. 3764 if (LoadSDNode *Ld = dyn_cast<LoadSDNode>(*this)) { 3765 if (!Ld->isVolatile()) 3766 return Ld->getChain().reachesChainWithoutSideEffects(Dest, Depth-1); 3767 } 3768 return false; 3769} 3770 3771 3772static void findPredecessor(SDNode *N, const SDNode *P, bool &found, 3773 SmallPtrSet<SDNode *, 32> &Visited) { 3774 if (found || !Visited.insert(N)) 3775 return; 3776 3777 for (unsigned i = 0, e = N->getNumOperands(); !found && i != e; ++i) { 3778 SDNode *Op = N->getOperand(i).Val; 3779 if (Op == P) { 3780 found = true; 3781 return; 3782 } 3783 findPredecessor(Op, P, found, Visited); 3784 } 3785} 3786 3787/// isPredecessor - Return true if this node is a predecessor of N. This node 3788/// is either an operand of N or it can be reached by recursively traversing 3789/// up the operands. 3790/// NOTE: this is an expensive method. Use it carefully. 3791bool SDNode::isPredecessor(SDNode *N) const { 3792 SmallPtrSet<SDNode *, 32> Visited; 3793 bool found = false; 3794 findPredecessor(N, this, found, Visited); 3795 return found; 3796} 3797 3798uint64_t SDNode::getConstantOperandVal(unsigned Num) const { 3799 assert(Num < NumOperands && "Invalid child # of SDNode!"); 3800 return cast<ConstantSDNode>(OperandList[Num])->getValue(); 3801} 3802 3803std::string SDNode::getOperationName(const SelectionDAG *G) const { 3804 switch (getOpcode()) { 3805 default: 3806 if (getOpcode() < ISD::BUILTIN_OP_END) 3807 return "<<Unknown DAG Node>>"; 3808 else { 3809 if (G) { 3810 if (const TargetInstrInfo *TII = G->getTarget().getInstrInfo()) 3811 if (getOpcode()-ISD::BUILTIN_OP_END < TII->getNumOpcodes()) 3812 return TII->get(getOpcode()-ISD::BUILTIN_OP_END).getName(); 3813 3814 TargetLowering &TLI = G->getTargetLoweringInfo(); 3815 const char *Name = 3816 TLI.getTargetNodeName(getOpcode()); 3817 if (Name) return Name; 3818 } 3819 3820 return "<<Unknown Target Node>>"; 3821 } 3822 3823 case ISD::MEMBARRIER: return "MemBarrier"; 3824 case ISD::PCMARKER: return "PCMarker"; 3825 case ISD::READCYCLECOUNTER: return "ReadCycleCounter"; 3826 case ISD::SRCVALUE: return "SrcValue"; 3827 case ISD::MEMOPERAND: return "MemOperand"; 3828 case ISD::EntryToken: return "EntryToken"; 3829 case ISD::TokenFactor: return "TokenFactor"; 3830 case ISD::AssertSext: return "AssertSext"; 3831 case ISD::AssertZext: return "AssertZext"; 3832 3833 case ISD::STRING: return "String"; 3834 case ISD::BasicBlock: return "BasicBlock"; 3835 case ISD::VALUETYPE: return "ValueType"; 3836 case ISD::Register: return "Register"; 3837 3838 case ISD::Constant: return "Constant"; 3839 case ISD::ConstantFP: return "ConstantFP"; 3840 case ISD::GlobalAddress: return "GlobalAddress"; 3841 case ISD::GlobalTLSAddress: return "GlobalTLSAddress"; 3842 case ISD::FrameIndex: return "FrameIndex"; 3843 case ISD::JumpTable: return "JumpTable"; 3844 case ISD::GLOBAL_OFFSET_TABLE: return "GLOBAL_OFFSET_TABLE"; 3845 case ISD::RETURNADDR: return "RETURNADDR"; 3846 case ISD::FRAMEADDR: return "FRAMEADDR"; 3847 case ISD::FRAME_TO_ARGS_OFFSET: return "FRAME_TO_ARGS_OFFSET"; 3848 case ISD::EXCEPTIONADDR: return "EXCEPTIONADDR"; 3849 case ISD::EHSELECTION: return "EHSELECTION"; 3850 case ISD::EH_RETURN: return "EH_RETURN"; 3851 case ISD::ConstantPool: return "ConstantPool"; 3852 case ISD::ExternalSymbol: return "ExternalSymbol"; 3853 case ISD::INTRINSIC_WO_CHAIN: { 3854 unsigned IID = cast<ConstantSDNode>(getOperand(0))->getValue(); 3855 return Intrinsic::getName((Intrinsic::ID)IID); 3856 } 3857 case ISD::INTRINSIC_VOID: 3858 case ISD::INTRINSIC_W_CHAIN: { 3859 unsigned IID = cast<ConstantSDNode>(getOperand(1))->getValue(); 3860 return Intrinsic::getName((Intrinsic::ID)IID); 3861 } 3862 3863 case ISD::BUILD_VECTOR: return "BUILD_VECTOR"; 3864 case ISD::TargetConstant: return "TargetConstant"; 3865 case ISD::TargetConstantFP:return "TargetConstantFP"; 3866 case ISD::TargetGlobalAddress: return "TargetGlobalAddress"; 3867 case ISD::TargetGlobalTLSAddress: return "TargetGlobalTLSAddress"; 3868 case ISD::TargetFrameIndex: return "TargetFrameIndex"; 3869 case ISD::TargetJumpTable: return "TargetJumpTable"; 3870 case ISD::TargetConstantPool: return "TargetConstantPool"; 3871 case ISD::TargetExternalSymbol: return "TargetExternalSymbol"; 3872 3873 case ISD::CopyToReg: return "CopyToReg"; 3874 case ISD::CopyFromReg: return "CopyFromReg"; 3875 case ISD::UNDEF: return "undef"; 3876 case ISD::MERGE_VALUES: return "merge_values"; 3877 case ISD::INLINEASM: return "inlineasm"; 3878 case ISD::LABEL: return "label"; 3879 case ISD::DECLARE: return "declare"; 3880 case ISD::HANDLENODE: return "handlenode"; 3881 case ISD::FORMAL_ARGUMENTS: return "formal_arguments"; 3882 case ISD::CALL: return "call"; 3883 3884 // Unary operators 3885 case ISD::FABS: return "fabs"; 3886 case ISD::FNEG: return "fneg"; 3887 case ISD::FSQRT: return "fsqrt"; 3888 case ISD::FSIN: return "fsin"; 3889 case ISD::FCOS: return "fcos"; 3890 case ISD::FPOWI: return "fpowi"; 3891 case ISD::FPOW: return "fpow"; 3892 3893 // Binary operators 3894 case ISD::ADD: return "add"; 3895 case ISD::SUB: return "sub"; 3896 case ISD::MUL: return "mul"; 3897 case ISD::MULHU: return "mulhu"; 3898 case ISD::MULHS: return "mulhs"; 3899 case ISD::SDIV: return "sdiv"; 3900 case ISD::UDIV: return "udiv"; 3901 case ISD::SREM: return "srem"; 3902 case ISD::UREM: return "urem"; 3903 case ISD::SMUL_LOHI: return "smul_lohi"; 3904 case ISD::UMUL_LOHI: return "umul_lohi"; 3905 case ISD::SDIVREM: return "sdivrem"; 3906 case ISD::UDIVREM: return "divrem"; 3907 case ISD::AND: return "and"; 3908 case ISD::OR: return "or"; 3909 case ISD::XOR: return "xor"; 3910 case ISD::SHL: return "shl"; 3911 case ISD::SRA: return "sra"; 3912 case ISD::SRL: return "srl"; 3913 case ISD::ROTL: return "rotl"; 3914 case ISD::ROTR: return "rotr"; 3915 case ISD::FADD: return "fadd"; 3916 case ISD::FSUB: return "fsub"; 3917 case ISD::FMUL: return "fmul"; 3918 case ISD::FDIV: return "fdiv"; 3919 case ISD::FREM: return "frem"; 3920 case ISD::FCOPYSIGN: return "fcopysign"; 3921 case ISD::FGETSIGN: return "fgetsign"; 3922 3923 case ISD::SETCC: return "setcc"; 3924 case ISD::SELECT: return "select"; 3925 case ISD::SELECT_CC: return "select_cc"; 3926 case ISD::INSERT_VECTOR_ELT: return "insert_vector_elt"; 3927 case ISD::EXTRACT_VECTOR_ELT: return "extract_vector_elt"; 3928 case ISD::CONCAT_VECTORS: return "concat_vectors"; 3929 case ISD::EXTRACT_SUBVECTOR: return "extract_subvector"; 3930 case ISD::SCALAR_TO_VECTOR: return "scalar_to_vector"; 3931 case ISD::VECTOR_SHUFFLE: return "vector_shuffle"; 3932 case ISD::CARRY_FALSE: return "carry_false"; 3933 case ISD::ADDC: return "addc"; 3934 case ISD::ADDE: return "adde"; 3935 case ISD::SUBC: return "subc"; 3936 case ISD::SUBE: return "sube"; 3937 case ISD::SHL_PARTS: return "shl_parts"; 3938 case ISD::SRA_PARTS: return "sra_parts"; 3939 case ISD::SRL_PARTS: return "srl_parts"; 3940 3941 case ISD::EXTRACT_SUBREG: return "extract_subreg"; 3942 case ISD::INSERT_SUBREG: return "insert_subreg"; 3943 3944 // Conversion operators. 3945 case ISD::SIGN_EXTEND: return "sign_extend"; 3946 case ISD::ZERO_EXTEND: return "zero_extend"; 3947 case ISD::ANY_EXTEND: return "any_extend"; 3948 case ISD::SIGN_EXTEND_INREG: return "sign_extend_inreg"; 3949 case ISD::TRUNCATE: return "truncate"; 3950 case ISD::FP_ROUND: return "fp_round"; 3951 case ISD::FLT_ROUNDS_: return "flt_rounds"; 3952 case ISD::FP_ROUND_INREG: return "fp_round_inreg"; 3953 case ISD::FP_EXTEND: return "fp_extend"; 3954 3955 case ISD::SINT_TO_FP: return "sint_to_fp"; 3956 case ISD::UINT_TO_FP: return "uint_to_fp"; 3957 case ISD::FP_TO_SINT: return "fp_to_sint"; 3958 case ISD::FP_TO_UINT: return "fp_to_uint"; 3959 case ISD::BIT_CONVERT: return "bit_convert"; 3960 3961 // Control flow instructions 3962 case ISD::BR: return "br"; 3963 case ISD::BRIND: return "brind"; 3964 case ISD::BR_JT: return "br_jt"; 3965 case ISD::BRCOND: return "brcond"; 3966 case ISD::BR_CC: return "br_cc"; 3967 case ISD::RET: return "ret"; 3968 case ISD::CALLSEQ_START: return "callseq_start"; 3969 case ISD::CALLSEQ_END: return "callseq_end"; 3970 3971 // Other operators 3972 case ISD::LOAD: return "load"; 3973 case ISD::STORE: return "store"; 3974 case ISD::VAARG: return "vaarg"; 3975 case ISD::VACOPY: return "vacopy"; 3976 case ISD::VAEND: return "vaend"; 3977 case ISD::VASTART: return "vastart"; 3978 case ISD::DYNAMIC_STACKALLOC: return "dynamic_stackalloc"; 3979 case ISD::EXTRACT_ELEMENT: return "extract_element"; 3980 case ISD::BUILD_PAIR: return "build_pair"; 3981 case ISD::STACKSAVE: return "stacksave"; 3982 case ISD::STACKRESTORE: return "stackrestore"; 3983 case ISD::TRAP: return "trap"; 3984 3985 // Block memory operations. 3986 case ISD::MEMSET: return "memset"; 3987 case ISD::MEMCPY: return "memcpy"; 3988 case ISD::MEMMOVE: return "memmove"; 3989 3990 // Bit manipulation 3991 case ISD::BSWAP: return "bswap"; 3992 case ISD::CTPOP: return "ctpop"; 3993 case ISD::CTTZ: return "cttz"; 3994 case ISD::CTLZ: return "ctlz"; 3995 3996 // Debug info 3997 case ISD::LOCATION: return "location"; 3998 case ISD::DEBUG_LOC: return "debug_loc"; 3999 4000 // Trampolines 4001 case ISD::TRAMPOLINE: return "trampoline"; 4002 4003 case ISD::CONDCODE: 4004 switch (cast<CondCodeSDNode>(this)->get()) { 4005 default: assert(0 && "Unknown setcc condition!"); 4006 case ISD::SETOEQ: return "setoeq"; 4007 case ISD::SETOGT: return "setogt"; 4008 case ISD::SETOGE: return "setoge"; 4009 case ISD::SETOLT: return "setolt"; 4010 case ISD::SETOLE: return "setole"; 4011 case ISD::SETONE: return "setone"; 4012 4013 case ISD::SETO: return "seto"; 4014 case ISD::SETUO: return "setuo"; 4015 case ISD::SETUEQ: return "setue"; 4016 case ISD::SETUGT: return "setugt"; 4017 case ISD::SETUGE: return "setuge"; 4018 case ISD::SETULT: return "setult"; 4019 case ISD::SETULE: return "setule"; 4020 case ISD::SETUNE: return "setune"; 4021 4022 case ISD::SETEQ: return "seteq"; 4023 case ISD::SETGT: return "setgt"; 4024 case ISD::SETGE: return "setge"; 4025 case ISD::SETLT: return "setlt"; 4026 case ISD::SETLE: return "setle"; 4027 case ISD::SETNE: return "setne"; 4028 } 4029 } 4030} 4031 4032const char *SDNode::getIndexedModeName(ISD::MemIndexedMode AM) { 4033 switch (AM) { 4034 default: 4035 return ""; 4036 case ISD::PRE_INC: 4037 return "<pre-inc>"; 4038 case ISD::PRE_DEC: 4039 return "<pre-dec>"; 4040 case ISD::POST_INC: 4041 return "<post-inc>"; 4042 case ISD::POST_DEC: 4043 return "<post-dec>"; 4044 } 4045} 4046 4047void SDNode::dump() const { dump(0); } 4048void SDNode::dump(const SelectionDAG *G) const { 4049 cerr << (void*)this << ": "; 4050 4051 for (unsigned i = 0, e = getNumValues(); i != e; ++i) { 4052 if (i) cerr << ","; 4053 if (getValueType(i) == MVT::Other) 4054 cerr << "ch"; 4055 else 4056 cerr << MVT::getValueTypeString(getValueType(i)); 4057 } 4058 cerr << " = " << getOperationName(G); 4059 4060 cerr << " "; 4061 for (unsigned i = 0, e = getNumOperands(); i != e; ++i) { 4062 if (i) cerr << ", "; 4063 cerr << (void*)getOperand(i).Val; 4064 if (unsigned RN = getOperand(i).ResNo) 4065 cerr << ":" << RN; 4066 } 4067 4068 if (!isTargetOpcode() && getOpcode() == ISD::VECTOR_SHUFFLE) { 4069 SDNode *Mask = getOperand(2).Val; 4070 cerr << "<"; 4071 for (unsigned i = 0, e = Mask->getNumOperands(); i != e; ++i) { 4072 if (i) cerr << ","; 4073 if (Mask->getOperand(i).getOpcode() == ISD::UNDEF) 4074 cerr << "u"; 4075 else 4076 cerr << cast<ConstantSDNode>(Mask->getOperand(i))->getValue(); 4077 } 4078 cerr << ">"; 4079 } 4080 4081 if (const ConstantSDNode *CSDN = dyn_cast<ConstantSDNode>(this)) { 4082 cerr << "<" << CSDN->getValue() << ">"; 4083 } else if (const ConstantFPSDNode *CSDN = dyn_cast<ConstantFPSDNode>(this)) { 4084 if (&CSDN->getValueAPF().getSemantics()==&APFloat::IEEEsingle) 4085 cerr << "<" << CSDN->getValueAPF().convertToFloat() << ">"; 4086 else if (&CSDN->getValueAPF().getSemantics()==&APFloat::IEEEdouble) 4087 cerr << "<" << CSDN->getValueAPF().convertToDouble() << ">"; 4088 else { 4089 cerr << "<APFloat("; 4090 CSDN->getValueAPF().convertToAPInt().dump(); 4091 cerr << ")>"; 4092 } 4093 } else if (const GlobalAddressSDNode *GADN = 4094 dyn_cast<GlobalAddressSDNode>(this)) { 4095 int offset = GADN->getOffset(); 4096 cerr << "<"; 4097 WriteAsOperand(*cerr.stream(), GADN->getGlobal()) << ">"; 4098 if (offset > 0) 4099 cerr << " + " << offset; 4100 else 4101 cerr << " " << offset; 4102 } else if (const FrameIndexSDNode *FIDN = dyn_cast<FrameIndexSDNode>(this)) { 4103 cerr << "<" << FIDN->getIndex() << ">"; 4104 } else if (const JumpTableSDNode *JTDN = dyn_cast<JumpTableSDNode>(this)) { 4105 cerr << "<" << JTDN->getIndex() << ">"; 4106 } else if (const ConstantPoolSDNode *CP = dyn_cast<ConstantPoolSDNode>(this)){ 4107 int offset = CP->getOffset(); 4108 if (CP->isMachineConstantPoolEntry()) 4109 cerr << "<" << *CP->getMachineCPVal() << ">"; 4110 else 4111 cerr << "<" << *CP->getConstVal() << ">"; 4112 if (offset > 0) 4113 cerr << " + " << offset; 4114 else 4115 cerr << " " << offset; 4116 } else if (const BasicBlockSDNode *BBDN = dyn_cast<BasicBlockSDNode>(this)) { 4117 cerr << "<"; 4118 const Value *LBB = (const Value*)BBDN->getBasicBlock()->getBasicBlock(); 4119 if (LBB) 4120 cerr << LBB->getName() << " "; 4121 cerr << (const void*)BBDN->getBasicBlock() << ">"; 4122 } else if (const RegisterSDNode *R = dyn_cast<RegisterSDNode>(this)) { 4123 if (G && R->getReg() && 4124 TargetRegisterInfo::isPhysicalRegister(R->getReg())) { 4125 cerr << " " <<G->getTarget().getRegisterInfo()->getName(R->getReg()); 4126 } else { 4127 cerr << " #" << R->getReg(); 4128 } 4129 } else if (const ExternalSymbolSDNode *ES = 4130 dyn_cast<ExternalSymbolSDNode>(this)) { 4131 cerr << "'" << ES->getSymbol() << "'"; 4132 } else if (const SrcValueSDNode *M = dyn_cast<SrcValueSDNode>(this)) { 4133 if (M->getValue()) 4134 cerr << "<" << M->getValue() << ">"; 4135 else 4136 cerr << "<null>"; 4137 } else if (const MemOperandSDNode *M = dyn_cast<MemOperandSDNode>(this)) { 4138 if (M->MO.getValue()) 4139 cerr << "<" << M->MO.getValue() << ":" << M->MO.getOffset() << ">"; 4140 else 4141 cerr << "<null:" << M->MO.getOffset() << ">"; 4142 } else if (const VTSDNode *N = dyn_cast<VTSDNode>(this)) { 4143 cerr << ":" << MVT::getValueTypeString(N->getVT()); 4144 } else if (const LoadSDNode *LD = dyn_cast<LoadSDNode>(this)) { 4145 const Value *SrcValue = LD->getSrcValue(); 4146 int SrcOffset = LD->getSrcValueOffset(); 4147 cerr << " <"; 4148 if (SrcValue) 4149 cerr << SrcValue; 4150 else 4151 cerr << "null"; 4152 cerr << ":" << SrcOffset << ">"; 4153 4154 bool doExt = true; 4155 switch (LD->getExtensionType()) { 4156 default: doExt = false; break; 4157 case ISD::EXTLOAD: 4158 cerr << " <anyext "; 4159 break; 4160 case ISD::SEXTLOAD: 4161 cerr << " <sext "; 4162 break; 4163 case ISD::ZEXTLOAD: 4164 cerr << " <zext "; 4165 break; 4166 } 4167 if (doExt) 4168 cerr << MVT::getValueTypeString(LD->getMemoryVT()) << ">"; 4169 4170 const char *AM = getIndexedModeName(LD->getAddressingMode()); 4171 if (*AM) 4172 cerr << " " << AM; 4173 if (LD->isVolatile()) 4174 cerr << " <volatile>"; 4175 cerr << " alignment=" << LD->getAlignment(); 4176 } else if (const StoreSDNode *ST = dyn_cast<StoreSDNode>(this)) { 4177 const Value *SrcValue = ST->getSrcValue(); 4178 int SrcOffset = ST->getSrcValueOffset(); 4179 cerr << " <"; 4180 if (SrcValue) 4181 cerr << SrcValue; 4182 else 4183 cerr << "null"; 4184 cerr << ":" << SrcOffset << ">"; 4185 4186 if (ST->isTruncatingStore()) 4187 cerr << " <trunc " 4188 << MVT::getValueTypeString(ST->getMemoryVT()) << ">"; 4189 4190 const char *AM = getIndexedModeName(ST->getAddressingMode()); 4191 if (*AM) 4192 cerr << " " << AM; 4193 if (ST->isVolatile()) 4194 cerr << " <volatile>"; 4195 cerr << " alignment=" << ST->getAlignment(); 4196 } 4197} 4198 4199static void DumpNodes(const SDNode *N, unsigned indent, const SelectionDAG *G) { 4200 for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i) 4201 if (N->getOperand(i).Val->hasOneUse()) 4202 DumpNodes(N->getOperand(i).Val, indent+2, G); 4203 else 4204 cerr << "\n" << std::string(indent+2, ' ') 4205 << (void*)N->getOperand(i).Val << ": <multiple use>"; 4206 4207 4208 cerr << "\n" << std::string(indent, ' '); 4209 N->dump(G); 4210} 4211 4212void SelectionDAG::dump() const { 4213 cerr << "SelectionDAG has " << AllNodes.size() << " nodes:"; 4214 std::vector<const SDNode*> Nodes; 4215 for (allnodes_const_iterator I = allnodes_begin(), E = allnodes_end(); 4216 I != E; ++I) 4217 Nodes.push_back(I); 4218 4219 std::sort(Nodes.begin(), Nodes.end()); 4220 4221 for (unsigned i = 0, e = Nodes.size(); i != e; ++i) { 4222 if (!Nodes[i]->hasOneUse() && Nodes[i] != getRoot().Val) 4223 DumpNodes(Nodes[i], 2, this); 4224 } 4225 4226 if (getRoot().Val) DumpNodes(getRoot().Val, 2, this); 4227 4228 cerr << "\n\n"; 4229} 4230 4231const Type *ConstantPoolSDNode::getType() const { 4232 if (isMachineConstantPoolEntry()) 4233 return Val.MachineCPVal->getType(); 4234 return Val.ConstVal->getType(); 4235} 4236