SelectionDAG.cpp revision d4cf992230a6cc4d76022c5d47dbd23115bdec44
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/// SignBitIsZero - Return true if the sign bit of Op is known to be zero. We 1137/// use this predicate to simplify operations downstream. 1138bool SelectionDAG::SignBitIsZero(SDOperand Op, unsigned Depth) const { 1139 unsigned BitWidth = Op.getValueSizeInBits(); 1140 return MaskedValueIsZero(Op, APInt::getSignBit(BitWidth), Depth); 1141} 1142 1143/// MaskedValueIsZero - Return true if 'V & Mask' is known to be zero. We use 1144/// this predicate to simplify operations downstream. Mask is known to be zero 1145/// for bits that V cannot have. 1146bool SelectionDAG::MaskedValueIsZero(SDOperand Op, const APInt &Mask, 1147 unsigned Depth) const { 1148 APInt KnownZero, KnownOne; 1149 ComputeMaskedBits(Op, Mask, KnownZero, KnownOne, Depth); 1150 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?"); 1151 return (KnownZero & Mask) == Mask; 1152} 1153 1154/// ComputeMaskedBits - Determine which of the bits specified in Mask are 1155/// known to be either zero or one and return them in the KnownZero/KnownOne 1156/// bitsets. This code only analyzes bits in Mask, in order to short-circuit 1157/// processing. 1158void SelectionDAG::ComputeMaskedBits(SDOperand Op, const APInt &Mask, 1159 APInt &KnownZero, APInt &KnownOne, 1160 unsigned Depth) const { 1161 unsigned BitWidth = Mask.getBitWidth(); 1162 assert(BitWidth == MVT::getSizeInBits(Op.getValueType()) && 1163 "Mask size mismatches value type size!"); 1164 1165 KnownZero = KnownOne = APInt(BitWidth, 0); // Don't know anything. 1166 if (Depth == 6 || Mask == 0) 1167 return; // Limit search depth. 1168 1169 APInt KnownZero2, KnownOne2; 1170 1171 switch (Op.getOpcode()) { 1172 case ISD::Constant: 1173 // We know all of the bits for a constant! 1174 KnownOne = cast<ConstantSDNode>(Op)->getAPIntValue() & Mask; 1175 KnownZero = ~KnownOne & Mask; 1176 return; 1177 case ISD::AND: 1178 // If either the LHS or the RHS are Zero, the result is zero. 1179 ComputeMaskedBits(Op.getOperand(1), Mask, KnownZero, KnownOne, Depth+1); 1180 ComputeMaskedBits(Op.getOperand(0), Mask & ~KnownZero, 1181 KnownZero2, KnownOne2, Depth+1); 1182 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?"); 1183 assert((KnownZero2 & KnownOne2) == 0 && "Bits known to be one AND zero?"); 1184 1185 // Output known-1 bits are only known if set in both the LHS & RHS. 1186 KnownOne &= KnownOne2; 1187 // Output known-0 are known to be clear if zero in either the LHS | RHS. 1188 KnownZero |= KnownZero2; 1189 return; 1190 case ISD::OR: 1191 ComputeMaskedBits(Op.getOperand(1), Mask, KnownZero, KnownOne, Depth+1); 1192 ComputeMaskedBits(Op.getOperand(0), Mask & ~KnownOne, 1193 KnownZero2, KnownOne2, Depth+1); 1194 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?"); 1195 assert((KnownZero2 & KnownOne2) == 0 && "Bits known to be one AND zero?"); 1196 1197 // Output known-0 bits are only known if clear in both the LHS & RHS. 1198 KnownZero &= KnownZero2; 1199 // Output known-1 are known to be set if set in either the LHS | RHS. 1200 KnownOne |= KnownOne2; 1201 return; 1202 case ISD::XOR: { 1203 ComputeMaskedBits(Op.getOperand(1), Mask, KnownZero, KnownOne, Depth+1); 1204 ComputeMaskedBits(Op.getOperand(0), Mask, KnownZero2, KnownOne2, Depth+1); 1205 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?"); 1206 assert((KnownZero2 & KnownOne2) == 0 && "Bits known to be one AND zero?"); 1207 1208 // Output known-0 bits are known if clear or set in both the LHS & RHS. 1209 APInt KnownZeroOut = (KnownZero & KnownZero2) | (KnownOne & KnownOne2); 1210 // Output known-1 are known to be set if set in only one of the LHS, RHS. 1211 KnownOne = (KnownZero & KnownOne2) | (KnownOne & KnownZero2); 1212 KnownZero = KnownZeroOut; 1213 return; 1214 } 1215 case ISD::SELECT: 1216 ComputeMaskedBits(Op.getOperand(2), Mask, KnownZero, KnownOne, Depth+1); 1217 ComputeMaskedBits(Op.getOperand(1), Mask, KnownZero2, KnownOne2, Depth+1); 1218 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?"); 1219 assert((KnownZero2 & KnownOne2) == 0 && "Bits known to be one AND zero?"); 1220 1221 // Only known if known in both the LHS and RHS. 1222 KnownOne &= KnownOne2; 1223 KnownZero &= KnownZero2; 1224 return; 1225 case ISD::SELECT_CC: 1226 ComputeMaskedBits(Op.getOperand(3), Mask, KnownZero, KnownOne, Depth+1); 1227 ComputeMaskedBits(Op.getOperand(2), Mask, KnownZero2, KnownOne2, Depth+1); 1228 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?"); 1229 assert((KnownZero2 & KnownOne2) == 0 && "Bits known to be one AND zero?"); 1230 1231 // Only known if known in both the LHS and RHS. 1232 KnownOne &= KnownOne2; 1233 KnownZero &= KnownZero2; 1234 return; 1235 case ISD::SETCC: 1236 // If we know the result of a setcc has the top bits zero, use this info. 1237 if (TLI.getSetCCResultContents() == TargetLowering::ZeroOrOneSetCCResult && 1238 BitWidth > 1) 1239 KnownZero |= APInt::getHighBitsSet(BitWidth, BitWidth - 1); 1240 return; 1241 case ISD::SHL: 1242 // (shl X, C1) & C2 == 0 iff (X & C2 >>u C1) == 0 1243 if (ConstantSDNode *SA = dyn_cast<ConstantSDNode>(Op.getOperand(1))) { 1244 unsigned ShAmt = SA->getValue(); 1245 1246 // If the shift count is an invalid immediate, don't do anything. 1247 if (ShAmt >= BitWidth) 1248 return; 1249 1250 ComputeMaskedBits(Op.getOperand(0), Mask.lshr(ShAmt), 1251 KnownZero, KnownOne, Depth+1); 1252 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?"); 1253 KnownZero <<= ShAmt; 1254 KnownOne <<= ShAmt; 1255 // low bits known zero. 1256 KnownZero |= APInt::getLowBitsSet(BitWidth, ShAmt); 1257 } 1258 return; 1259 case ISD::SRL: 1260 // (ushr X, C1) & C2 == 0 iff (-1 >> C1) & C2 == 0 1261 if (ConstantSDNode *SA = dyn_cast<ConstantSDNode>(Op.getOperand(1))) { 1262 unsigned ShAmt = SA->getValue(); 1263 1264 // If the shift count is an invalid immediate, don't do anything. 1265 if (ShAmt >= BitWidth) 1266 return; 1267 1268 ComputeMaskedBits(Op.getOperand(0), (Mask << ShAmt), 1269 KnownZero, KnownOne, Depth+1); 1270 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?"); 1271 KnownZero = KnownZero.lshr(ShAmt); 1272 KnownOne = KnownOne.lshr(ShAmt); 1273 1274 APInt HighBits = APInt::getHighBitsSet(BitWidth, ShAmt) & Mask; 1275 KnownZero |= HighBits; // High bits known zero. 1276 } 1277 return; 1278 case ISD::SRA: 1279 if (ConstantSDNode *SA = dyn_cast<ConstantSDNode>(Op.getOperand(1))) { 1280 unsigned ShAmt = SA->getValue(); 1281 1282 // If the shift count is an invalid immediate, don't do anything. 1283 if (ShAmt >= BitWidth) 1284 return; 1285 1286 APInt InDemandedMask = (Mask << ShAmt); 1287 // If any of the demanded bits are produced by the sign extension, we also 1288 // demand the input sign bit. 1289 APInt HighBits = APInt::getHighBitsSet(BitWidth, ShAmt) & Mask; 1290 if (HighBits.getBoolValue()) 1291 InDemandedMask |= APInt::getSignBit(BitWidth); 1292 1293 ComputeMaskedBits(Op.getOperand(0), InDemandedMask, KnownZero, KnownOne, 1294 Depth+1); 1295 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?"); 1296 KnownZero = KnownZero.lshr(ShAmt); 1297 KnownOne = KnownOne.lshr(ShAmt); 1298 1299 // Handle the sign bits. 1300 APInt SignBit = APInt::getSignBit(BitWidth); 1301 SignBit = SignBit.lshr(ShAmt); // Adjust to where it is now in the mask. 1302 1303 if (KnownZero.intersects(SignBit)) { 1304 KnownZero |= HighBits; // New bits are known zero. 1305 } else if (KnownOne.intersects(SignBit)) { 1306 KnownOne |= HighBits; // New bits are known one. 1307 } 1308 } 1309 return; 1310 case ISD::SIGN_EXTEND_INREG: { 1311 MVT::ValueType EVT = cast<VTSDNode>(Op.getOperand(1))->getVT(); 1312 unsigned EBits = MVT::getSizeInBits(EVT); 1313 1314 // Sign extension. Compute the demanded bits in the result that are not 1315 // present in the input. 1316 APInt NewBits = APInt::getHighBitsSet(BitWidth, BitWidth - EBits) & Mask; 1317 1318 APInt InSignBit = APInt::getSignBit(EBits); 1319 APInt InputDemandedBits = Mask & APInt::getLowBitsSet(BitWidth, EBits); 1320 1321 // If the sign extended bits are demanded, we know that the sign 1322 // bit is demanded. 1323 InSignBit.zext(BitWidth); 1324 if (NewBits.getBoolValue()) 1325 InputDemandedBits |= InSignBit; 1326 1327 ComputeMaskedBits(Op.getOperand(0), InputDemandedBits, 1328 KnownZero, KnownOne, Depth+1); 1329 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?"); 1330 1331 // If the sign bit of the input is known set or clear, then we know the 1332 // top bits of the result. 1333 if (KnownZero.intersects(InSignBit)) { // Input sign bit known clear 1334 KnownZero |= NewBits; 1335 KnownOne &= ~NewBits; 1336 } else if (KnownOne.intersects(InSignBit)) { // Input sign bit known set 1337 KnownOne |= NewBits; 1338 KnownZero &= ~NewBits; 1339 } else { // Input sign bit unknown 1340 KnownZero &= ~NewBits; 1341 KnownOne &= ~NewBits; 1342 } 1343 return; 1344 } 1345 case ISD::CTTZ: 1346 case ISD::CTLZ: 1347 case ISD::CTPOP: { 1348 unsigned LowBits = Log2_32(BitWidth)+1; 1349 KnownZero = APInt::getHighBitsSet(BitWidth, BitWidth - LowBits); 1350 KnownOne = APInt(BitWidth, 0); 1351 return; 1352 } 1353 case ISD::LOAD: { 1354 if (ISD::isZEXTLoad(Op.Val)) { 1355 LoadSDNode *LD = cast<LoadSDNode>(Op); 1356 MVT::ValueType VT = LD->getMemoryVT(); 1357 unsigned MemBits = MVT::getSizeInBits(VT); 1358 KnownZero |= APInt::getHighBitsSet(BitWidth, BitWidth - MemBits) & Mask; 1359 } 1360 return; 1361 } 1362 case ISD::ZERO_EXTEND: { 1363 MVT::ValueType InVT = Op.getOperand(0).getValueType(); 1364 unsigned InBits = MVT::getSizeInBits(InVT); 1365 APInt NewBits = APInt::getHighBitsSet(BitWidth, BitWidth - InBits) & Mask; 1366 APInt InMask = Mask; 1367 InMask.trunc(InBits); 1368 KnownZero.trunc(InBits); 1369 KnownOne.trunc(InBits); 1370 ComputeMaskedBits(Op.getOperand(0), InMask, KnownZero, KnownOne, Depth+1); 1371 KnownZero.zext(BitWidth); 1372 KnownOne.zext(BitWidth); 1373 KnownZero |= NewBits; 1374 return; 1375 } 1376 case ISD::SIGN_EXTEND: { 1377 MVT::ValueType InVT = Op.getOperand(0).getValueType(); 1378 unsigned InBits = MVT::getSizeInBits(InVT); 1379 APInt InSignBit = APInt::getSignBit(InBits); 1380 APInt NewBits = APInt::getHighBitsSet(BitWidth, BitWidth - InBits) & Mask; 1381 APInt InMask = Mask; 1382 InMask.trunc(InBits); 1383 1384 // If any of the sign extended bits are demanded, we know that the sign 1385 // bit is demanded. Temporarily set this bit in the mask for our callee. 1386 if (NewBits.getBoolValue()) 1387 InMask |= InSignBit; 1388 1389 KnownZero.trunc(InBits); 1390 KnownOne.trunc(InBits); 1391 ComputeMaskedBits(Op.getOperand(0), InMask, KnownZero, KnownOne, Depth+1); 1392 1393 // Note if the sign bit is known to be zero or one. 1394 bool SignBitKnownZero = KnownZero.isNegative(); 1395 bool SignBitKnownOne = KnownOne.isNegative(); 1396 assert(!(SignBitKnownZero && SignBitKnownOne) && 1397 "Sign bit can't be known to be both zero and one!"); 1398 1399 // If the sign bit wasn't actually demanded by our caller, we don't 1400 // want it set in the KnownZero and KnownOne result values. Reset the 1401 // mask and reapply it to the result values. 1402 InMask = Mask; 1403 InMask.trunc(InBits); 1404 KnownZero &= InMask; 1405 KnownOne &= InMask; 1406 1407 KnownZero.zext(BitWidth); 1408 KnownOne.zext(BitWidth); 1409 1410 // If the sign bit is known zero or one, the top bits match. 1411 if (SignBitKnownZero) 1412 KnownZero |= NewBits; 1413 else if (SignBitKnownOne) 1414 KnownOne |= NewBits; 1415 return; 1416 } 1417 case ISD::ANY_EXTEND: { 1418 MVT::ValueType InVT = Op.getOperand(0).getValueType(); 1419 unsigned InBits = MVT::getSizeInBits(InVT); 1420 APInt InMask = Mask; 1421 InMask.trunc(InBits); 1422 KnownZero.trunc(InBits); 1423 KnownOne.trunc(InBits); 1424 ComputeMaskedBits(Op.getOperand(0), InMask, KnownZero, KnownOne, Depth+1); 1425 KnownZero.zext(BitWidth); 1426 KnownOne.zext(BitWidth); 1427 return; 1428 } 1429 case ISD::TRUNCATE: { 1430 MVT::ValueType InVT = Op.getOperand(0).getValueType(); 1431 unsigned InBits = MVT::getSizeInBits(InVT); 1432 APInt InMask = Mask; 1433 InMask.zext(InBits); 1434 KnownZero.zext(InBits); 1435 KnownOne.zext(InBits); 1436 ComputeMaskedBits(Op.getOperand(0), InMask, KnownZero, KnownOne, Depth+1); 1437 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?"); 1438 KnownZero.trunc(BitWidth); 1439 KnownOne.trunc(BitWidth); 1440 break; 1441 } 1442 case ISD::AssertZext: { 1443 MVT::ValueType VT = cast<VTSDNode>(Op.getOperand(1))->getVT(); 1444 APInt InMask = APInt::getLowBitsSet(BitWidth, MVT::getSizeInBits(VT)); 1445 ComputeMaskedBits(Op.getOperand(0), Mask & InMask, KnownZero, 1446 KnownOne, Depth+1); 1447 KnownZero |= (~InMask) & Mask; 1448 return; 1449 } 1450 case ISD::FGETSIGN: 1451 // All bits are zero except the low bit. 1452 KnownZero = APInt::getHighBitsSet(BitWidth, BitWidth - 1); 1453 return; 1454 1455 case ISD::ADD: { 1456 // If either the LHS or the RHS are Zero, the result is zero. 1457 ComputeMaskedBits(Op.getOperand(1), Mask, KnownZero, KnownOne, Depth+1); 1458 ComputeMaskedBits(Op.getOperand(0), Mask, KnownZero2, KnownOne2, Depth+1); 1459 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?"); 1460 assert((KnownZero2 & KnownOne2) == 0 && "Bits known to be one AND zero?"); 1461 1462 // Output known-0 bits are known if clear or set in both the low clear bits 1463 // common to both LHS & RHS. For example, 8+(X<<3) is known to have the 1464 // low 3 bits clear. 1465 unsigned KnownZeroOut = std::min(KnownZero.countTrailingOnes(), 1466 KnownZero2.countTrailingOnes()); 1467 1468 KnownZero = APInt::getLowBitsSet(BitWidth, KnownZeroOut); 1469 KnownOne = APInt(BitWidth, 0); 1470 return; 1471 } 1472 case ISD::SUB: { 1473 ConstantSDNode *CLHS = dyn_cast<ConstantSDNode>(Op.getOperand(0)); 1474 if (!CLHS) return; 1475 1476 // We know that the top bits of C-X are clear if X contains less bits 1477 // than C (i.e. no wrap-around can happen). For example, 20-X is 1478 // positive if we can prove that X is >= 0 and < 16. 1479 if (CLHS->getAPIntValue().isNonNegative()) { 1480 unsigned NLZ = (CLHS->getAPIntValue()+1).countLeadingZeros(); 1481 // NLZ can't be BitWidth with no sign bit 1482 APInt MaskV = APInt::getHighBitsSet(BitWidth, NLZ+1); 1483 ComputeMaskedBits(Op.getOperand(1), MaskV, KnownZero, KnownOne, Depth+1); 1484 1485 // If all of the MaskV bits are known to be zero, then we know the output 1486 // top bits are zero, because we now know that the output is from [0-C]. 1487 if ((KnownZero & MaskV) == MaskV) { 1488 unsigned NLZ2 = CLHS->getAPIntValue().countLeadingZeros(); 1489 // Top bits known zero. 1490 KnownZero = APInt::getHighBitsSet(BitWidth, NLZ2) & Mask; 1491 KnownOne = APInt(BitWidth, 0); // No one bits known. 1492 } else { 1493 KnownZero = KnownOne = APInt(BitWidth, 0); // Otherwise, nothing known. 1494 } 1495 } 1496 return; 1497 } 1498 default: 1499 // Allow the target to implement this method for its nodes. 1500 if (Op.getOpcode() >= ISD::BUILTIN_OP_END) { 1501 case ISD::INTRINSIC_WO_CHAIN: 1502 case ISD::INTRINSIC_W_CHAIN: 1503 case ISD::INTRINSIC_VOID: 1504 TLI.computeMaskedBitsForTargetNode(Op, Mask, KnownZero, KnownOne, *this); 1505 } 1506 return; 1507 } 1508} 1509 1510/// ComputeMaskedBits - This is a wrapper around the APInt-using 1511/// form of ComputeMaskedBits for use by clients that haven't been converted 1512/// to APInt yet. 1513void SelectionDAG::ComputeMaskedBits(SDOperand Op, uint64_t Mask, 1514 uint64_t &KnownZero, uint64_t &KnownOne, 1515 unsigned Depth) const { 1516 // The masks are not wide enough to represent this type! Should use APInt. 1517 if (Op.getValueType() == MVT::i128) 1518 return; 1519 1520 unsigned NumBits = MVT::getSizeInBits(Op.getValueType()); 1521 APInt APIntMask(NumBits, Mask); 1522 APInt APIntKnownZero(NumBits, 0); 1523 APInt APIntKnownOne(NumBits, 0); 1524 ComputeMaskedBits(Op, APIntMask, APIntKnownZero, APIntKnownOne, Depth); 1525 KnownZero = APIntKnownZero.getZExtValue(); 1526 KnownOne = APIntKnownOne.getZExtValue(); 1527} 1528 1529/// ComputeNumSignBits - Return the number of times the sign bit of the 1530/// register is replicated into the other bits. We know that at least 1 bit 1531/// is always equal to the sign bit (itself), but other cases can give us 1532/// information. For example, immediately after an "SRA X, 2", we know that 1533/// the top 3 bits are all equal to each other, so we return 3. 1534unsigned SelectionDAG::ComputeNumSignBits(SDOperand Op, unsigned Depth) const{ 1535 MVT::ValueType VT = Op.getValueType(); 1536 assert(MVT::isInteger(VT) && "Invalid VT!"); 1537 unsigned VTBits = MVT::getSizeInBits(VT); 1538 unsigned Tmp, Tmp2; 1539 1540 if (Depth == 6) 1541 return 1; // Limit search depth. 1542 1543 switch (Op.getOpcode()) { 1544 default: break; 1545 case ISD::AssertSext: 1546 Tmp = MVT::getSizeInBits(cast<VTSDNode>(Op.getOperand(1))->getVT()); 1547 return VTBits-Tmp+1; 1548 case ISD::AssertZext: 1549 Tmp = MVT::getSizeInBits(cast<VTSDNode>(Op.getOperand(1))->getVT()); 1550 return VTBits-Tmp; 1551 1552 case ISD::Constant: { 1553 uint64_t Val = cast<ConstantSDNode>(Op)->getValue(); 1554 // If negative, invert the bits, then look at it. 1555 if (Val & MVT::getIntVTSignBit(VT)) 1556 Val = ~Val; 1557 1558 // Shift the bits so they are the leading bits in the int64_t. 1559 Val <<= 64-VTBits; 1560 1561 // Return # leading zeros. We use 'min' here in case Val was zero before 1562 // shifting. We don't want to return '64' as for an i32 "0". 1563 return std::min(VTBits, CountLeadingZeros_64(Val)); 1564 } 1565 1566 case ISD::SIGN_EXTEND: 1567 Tmp = VTBits-MVT::getSizeInBits(Op.getOperand(0).getValueType()); 1568 return ComputeNumSignBits(Op.getOperand(0), Depth+1) + Tmp; 1569 1570 case ISD::SIGN_EXTEND_INREG: 1571 // Max of the input and what this extends. 1572 Tmp = MVT::getSizeInBits(cast<VTSDNode>(Op.getOperand(1))->getVT()); 1573 Tmp = VTBits-Tmp+1; 1574 1575 Tmp2 = ComputeNumSignBits(Op.getOperand(0), Depth+1); 1576 return std::max(Tmp, Tmp2); 1577 1578 case ISD::SRA: 1579 Tmp = ComputeNumSignBits(Op.getOperand(0), Depth+1); 1580 // SRA X, C -> adds C sign bits. 1581 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op.getOperand(1))) { 1582 Tmp += C->getValue(); 1583 if (Tmp > VTBits) Tmp = VTBits; 1584 } 1585 return Tmp; 1586 case ISD::SHL: 1587 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op.getOperand(1))) { 1588 // shl destroys sign bits. 1589 Tmp = ComputeNumSignBits(Op.getOperand(0), Depth+1); 1590 if (C->getValue() >= VTBits || // Bad shift. 1591 C->getValue() >= Tmp) break; // Shifted all sign bits out. 1592 return Tmp - C->getValue(); 1593 } 1594 break; 1595 case ISD::AND: 1596 case ISD::OR: 1597 case ISD::XOR: // NOT is handled here. 1598 // Logical binary ops preserve the number of sign bits. 1599 Tmp = ComputeNumSignBits(Op.getOperand(0), Depth+1); 1600 if (Tmp == 1) return 1; // Early out. 1601 Tmp2 = ComputeNumSignBits(Op.getOperand(1), Depth+1); 1602 return std::min(Tmp, Tmp2); 1603 1604 case ISD::SELECT: 1605 Tmp = ComputeNumSignBits(Op.getOperand(0), Depth+1); 1606 if (Tmp == 1) return 1; // Early out. 1607 Tmp2 = ComputeNumSignBits(Op.getOperand(1), Depth+1); 1608 return std::min(Tmp, Tmp2); 1609 1610 case ISD::SETCC: 1611 // If setcc returns 0/-1, all bits are sign bits. 1612 if (TLI.getSetCCResultContents() == 1613 TargetLowering::ZeroOrNegativeOneSetCCResult) 1614 return VTBits; 1615 break; 1616 case ISD::ROTL: 1617 case ISD::ROTR: 1618 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op.getOperand(1))) { 1619 unsigned RotAmt = C->getValue() & (VTBits-1); 1620 1621 // Handle rotate right by N like a rotate left by 32-N. 1622 if (Op.getOpcode() == ISD::ROTR) 1623 RotAmt = (VTBits-RotAmt) & (VTBits-1); 1624 1625 // If we aren't rotating out all of the known-in sign bits, return the 1626 // number that are left. This handles rotl(sext(x), 1) for example. 1627 Tmp = ComputeNumSignBits(Op.getOperand(0), Depth+1); 1628 if (Tmp > RotAmt+1) return Tmp-RotAmt; 1629 } 1630 break; 1631 case ISD::ADD: 1632 // Add can have at most one carry bit. Thus we know that the output 1633 // is, at worst, one more bit than the inputs. 1634 Tmp = ComputeNumSignBits(Op.getOperand(0), Depth+1); 1635 if (Tmp == 1) return 1; // Early out. 1636 1637 // Special case decrementing a value (ADD X, -1): 1638 if (ConstantSDNode *CRHS = dyn_cast<ConstantSDNode>(Op.getOperand(0))) 1639 if (CRHS->isAllOnesValue()) { 1640 uint64_t KnownZero, KnownOne; 1641 uint64_t Mask = MVT::getIntVTBitMask(VT); 1642 ComputeMaskedBits(Op.getOperand(0), Mask, KnownZero, KnownOne, Depth+1); 1643 1644 // If the input is known to be 0 or 1, the output is 0/-1, which is all 1645 // sign bits set. 1646 if ((KnownZero|1) == Mask) 1647 return VTBits; 1648 1649 // If we are subtracting one from a positive number, there is no carry 1650 // out of the result. 1651 if (KnownZero & MVT::getIntVTSignBit(VT)) 1652 return Tmp; 1653 } 1654 1655 Tmp2 = ComputeNumSignBits(Op.getOperand(1), Depth+1); 1656 if (Tmp2 == 1) return 1; 1657 return std::min(Tmp, Tmp2)-1; 1658 break; 1659 1660 case ISD::SUB: 1661 Tmp2 = ComputeNumSignBits(Op.getOperand(1), Depth+1); 1662 if (Tmp2 == 1) return 1; 1663 1664 // Handle NEG. 1665 if (ConstantSDNode *CLHS = dyn_cast<ConstantSDNode>(Op.getOperand(0))) 1666 if (CLHS->getValue() == 0) { 1667 uint64_t KnownZero, KnownOne; 1668 uint64_t Mask = MVT::getIntVTBitMask(VT); 1669 ComputeMaskedBits(Op.getOperand(1), Mask, KnownZero, KnownOne, Depth+1); 1670 // If the input is known to be 0 or 1, the output is 0/-1, which is all 1671 // sign bits set. 1672 if ((KnownZero|1) == Mask) 1673 return VTBits; 1674 1675 // If the input is known to be positive (the sign bit is known clear), 1676 // the output of the NEG has the same number of sign bits as the input. 1677 if (KnownZero & MVT::getIntVTSignBit(VT)) 1678 return Tmp2; 1679 1680 // Otherwise, we treat this like a SUB. 1681 } 1682 1683 // Sub can have at most one carry bit. Thus we know that the output 1684 // is, at worst, one more bit than the inputs. 1685 Tmp = ComputeNumSignBits(Op.getOperand(0), Depth+1); 1686 if (Tmp == 1) return 1; // Early out. 1687 return std::min(Tmp, Tmp2)-1; 1688 break; 1689 case ISD::TRUNCATE: 1690 // FIXME: it's tricky to do anything useful for this, but it is an important 1691 // case for targets like X86. 1692 break; 1693 } 1694 1695 // Handle LOADX separately here. EXTLOAD case will fallthrough. 1696 if (Op.getOpcode() == ISD::LOAD) { 1697 LoadSDNode *LD = cast<LoadSDNode>(Op); 1698 unsigned ExtType = LD->getExtensionType(); 1699 switch (ExtType) { 1700 default: break; 1701 case ISD::SEXTLOAD: // '17' bits known 1702 Tmp = MVT::getSizeInBits(LD->getMemoryVT()); 1703 return VTBits-Tmp+1; 1704 case ISD::ZEXTLOAD: // '16' bits known 1705 Tmp = MVT::getSizeInBits(LD->getMemoryVT()); 1706 return VTBits-Tmp; 1707 } 1708 } 1709 1710 // Allow the target to implement this method for its nodes. 1711 if (Op.getOpcode() >= ISD::BUILTIN_OP_END || 1712 Op.getOpcode() == ISD::INTRINSIC_WO_CHAIN || 1713 Op.getOpcode() == ISD::INTRINSIC_W_CHAIN || 1714 Op.getOpcode() == ISD::INTRINSIC_VOID) { 1715 unsigned NumBits = TLI.ComputeNumSignBitsForTargetNode(Op, Depth); 1716 if (NumBits > 1) return NumBits; 1717 } 1718 1719 // Finally, if we can prove that the top bits of the result are 0's or 1's, 1720 // use this information. 1721 uint64_t KnownZero, KnownOne; 1722 uint64_t Mask = MVT::getIntVTBitMask(VT); 1723 ComputeMaskedBits(Op, Mask, KnownZero, KnownOne, Depth); 1724 1725 uint64_t SignBit = MVT::getIntVTSignBit(VT); 1726 if (KnownZero & SignBit) { // SignBit is 0 1727 Mask = KnownZero; 1728 } else if (KnownOne & SignBit) { // SignBit is 1; 1729 Mask = KnownOne; 1730 } else { 1731 // Nothing known. 1732 return 1; 1733 } 1734 1735 // Okay, we know that the sign bit in Mask is set. Use CLZ to determine 1736 // the number of identical bits in the top of the input value. 1737 Mask ^= ~0ULL; 1738 Mask <<= 64-VTBits; 1739 // Return # leading zeros. We use 'min' here in case Val was zero before 1740 // shifting. We don't want to return '64' as for an i32 "0". 1741 return std::min(VTBits, CountLeadingZeros_64(Mask)); 1742} 1743 1744 1745bool SelectionDAG::isVerifiedDebugInfoDesc(SDOperand Op) const { 1746 GlobalAddressSDNode *GA = dyn_cast<GlobalAddressSDNode>(Op); 1747 if (!GA) return false; 1748 GlobalVariable *GV = dyn_cast<GlobalVariable>(GA->getGlobal()); 1749 if (!GV) return false; 1750 MachineModuleInfo *MMI = getMachineModuleInfo(); 1751 return MMI && MMI->hasDebugInfo() && MMI->isVerified(GV); 1752} 1753 1754 1755/// getNode - Gets or creates the specified node. 1756/// 1757SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT) { 1758 FoldingSetNodeID ID; 1759 AddNodeIDNode(ID, Opcode, getVTList(VT), 0, 0); 1760 void *IP = 0; 1761 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP)) 1762 return SDOperand(E, 0); 1763 SDNode *N = new SDNode(Opcode, SDNode::getSDVTList(VT)); 1764 CSEMap.InsertNode(N, IP); 1765 1766 AllNodes.push_back(N); 1767 return SDOperand(N, 0); 1768} 1769 1770SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT, 1771 SDOperand Operand) { 1772 unsigned Tmp1; 1773 // Constant fold unary operations with an integer constant operand. 1774 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Operand.Val)) { 1775 uint64_t Val = C->getValue(); 1776 switch (Opcode) { 1777 default: break; 1778 case ISD::SIGN_EXTEND: return getConstant(C->getSignExtended(), VT); 1779 case ISD::ANY_EXTEND: 1780 case ISD::ZERO_EXTEND: return getConstant(Val, VT); 1781 case ISD::TRUNCATE: return getConstant(Val, VT); 1782 case ISD::UINT_TO_FP: 1783 case ISD::SINT_TO_FP: { 1784 const uint64_t zero[] = {0, 0}; 1785 // No compile time operations on this type. 1786 if (VT==MVT::ppcf128) 1787 break; 1788 APFloat apf = APFloat(APInt(MVT::getSizeInBits(VT), 2, zero)); 1789 (void)apf.convertFromZeroExtendedInteger(&Val, 1790 MVT::getSizeInBits(Operand.getValueType()), 1791 Opcode==ISD::SINT_TO_FP, 1792 APFloat::rmNearestTiesToEven); 1793 return getConstantFP(apf, VT); 1794 } 1795 case ISD::BIT_CONVERT: 1796 if (VT == MVT::f32 && C->getValueType(0) == MVT::i32) 1797 return getConstantFP(BitsToFloat(Val), VT); 1798 else if (VT == MVT::f64 && C->getValueType(0) == MVT::i64) 1799 return getConstantFP(BitsToDouble(Val), VT); 1800 break; 1801 case ISD::BSWAP: 1802 switch(VT) { 1803 default: assert(0 && "Invalid bswap!"); break; 1804 case MVT::i16: return getConstant(ByteSwap_16((unsigned short)Val), VT); 1805 case MVT::i32: return getConstant(ByteSwap_32((unsigned)Val), VT); 1806 case MVT::i64: return getConstant(ByteSwap_64(Val), VT); 1807 } 1808 break; 1809 case ISD::CTPOP: 1810 switch(VT) { 1811 default: assert(0 && "Invalid ctpop!"); break; 1812 case MVT::i1: return getConstant(Val != 0, VT); 1813 case MVT::i8: 1814 Tmp1 = (unsigned)Val & 0xFF; 1815 return getConstant(CountPopulation_32(Tmp1), VT); 1816 case MVT::i16: 1817 Tmp1 = (unsigned)Val & 0xFFFF; 1818 return getConstant(CountPopulation_32(Tmp1), VT); 1819 case MVT::i32: 1820 return getConstant(CountPopulation_32((unsigned)Val), VT); 1821 case MVT::i64: 1822 return getConstant(CountPopulation_64(Val), VT); 1823 } 1824 case ISD::CTLZ: 1825 switch(VT) { 1826 default: assert(0 && "Invalid ctlz!"); break; 1827 case MVT::i1: return getConstant(Val == 0, VT); 1828 case MVT::i8: 1829 Tmp1 = (unsigned)Val & 0xFF; 1830 return getConstant(CountLeadingZeros_32(Tmp1)-24, VT); 1831 case MVT::i16: 1832 Tmp1 = (unsigned)Val & 0xFFFF; 1833 return getConstant(CountLeadingZeros_32(Tmp1)-16, VT); 1834 case MVT::i32: 1835 return getConstant(CountLeadingZeros_32((unsigned)Val), VT); 1836 case MVT::i64: 1837 return getConstant(CountLeadingZeros_64(Val), VT); 1838 } 1839 case ISD::CTTZ: 1840 switch(VT) { 1841 default: assert(0 && "Invalid cttz!"); break; 1842 case MVT::i1: return getConstant(Val == 0, VT); 1843 case MVT::i8: 1844 Tmp1 = (unsigned)Val | 0x100; 1845 return getConstant(CountTrailingZeros_32(Tmp1), VT); 1846 case MVT::i16: 1847 Tmp1 = (unsigned)Val | 0x10000; 1848 return getConstant(CountTrailingZeros_32(Tmp1), VT); 1849 case MVT::i32: 1850 return getConstant(CountTrailingZeros_32((unsigned)Val), VT); 1851 case MVT::i64: 1852 return getConstant(CountTrailingZeros_64(Val), VT); 1853 } 1854 } 1855 } 1856 1857 // Constant fold unary operations with a floating point constant operand. 1858 if (ConstantFPSDNode *C = dyn_cast<ConstantFPSDNode>(Operand.Val)) { 1859 APFloat V = C->getValueAPF(); // make copy 1860 if (VT != MVT::ppcf128 && Operand.getValueType() != MVT::ppcf128) { 1861 switch (Opcode) { 1862 case ISD::FNEG: 1863 V.changeSign(); 1864 return getConstantFP(V, VT); 1865 case ISD::FABS: 1866 V.clearSign(); 1867 return getConstantFP(V, VT); 1868 case ISD::FP_ROUND: 1869 case ISD::FP_EXTEND: 1870 // This can return overflow, underflow, or inexact; we don't care. 1871 // FIXME need to be more flexible about rounding mode. 1872 (void) V.convert(VT==MVT::f32 ? APFloat::IEEEsingle : 1873 VT==MVT::f64 ? APFloat::IEEEdouble : 1874 VT==MVT::f80 ? APFloat::x87DoubleExtended : 1875 VT==MVT::f128 ? APFloat::IEEEquad : 1876 APFloat::Bogus, 1877 APFloat::rmNearestTiesToEven); 1878 return getConstantFP(V, VT); 1879 case ISD::FP_TO_SINT: 1880 case ISD::FP_TO_UINT: { 1881 integerPart x; 1882 assert(integerPartWidth >= 64); 1883 // FIXME need to be more flexible about rounding mode. 1884 APFloat::opStatus s = V.convertToInteger(&x, 64U, 1885 Opcode==ISD::FP_TO_SINT, 1886 APFloat::rmTowardZero); 1887 if (s==APFloat::opInvalidOp) // inexact is OK, in fact usual 1888 break; 1889 return getConstant(x, VT); 1890 } 1891 case ISD::BIT_CONVERT: 1892 if (VT == MVT::i32 && C->getValueType(0) == MVT::f32) 1893 return getConstant((uint32_t)V.convertToAPInt().getZExtValue(), VT); 1894 else if (VT == MVT::i64 && C->getValueType(0) == MVT::f64) 1895 return getConstant(V.convertToAPInt().getZExtValue(), VT); 1896 break; 1897 } 1898 } 1899 } 1900 1901 unsigned OpOpcode = Operand.Val->getOpcode(); 1902 switch (Opcode) { 1903 case ISD::TokenFactor: 1904 return Operand; // Factor of one node? No factor. 1905 case ISD::FP_ROUND: assert(0 && "Invalid method to make FP_ROUND node"); 1906 case ISD::FP_EXTEND: 1907 assert(MVT::isFloatingPoint(VT) && 1908 MVT::isFloatingPoint(Operand.getValueType()) && "Invalid FP cast!"); 1909 if (Operand.getValueType() == VT) return Operand; // noop conversion. 1910 break; 1911 case ISD::SIGN_EXTEND: 1912 assert(MVT::isInteger(VT) && MVT::isInteger(Operand.getValueType()) && 1913 "Invalid SIGN_EXTEND!"); 1914 if (Operand.getValueType() == VT) return Operand; // noop extension 1915 assert(MVT::getSizeInBits(Operand.getValueType()) < MVT::getSizeInBits(VT) 1916 && "Invalid sext node, dst < src!"); 1917 if (OpOpcode == ISD::SIGN_EXTEND || OpOpcode == ISD::ZERO_EXTEND) 1918 return getNode(OpOpcode, VT, Operand.Val->getOperand(0)); 1919 break; 1920 case ISD::ZERO_EXTEND: 1921 assert(MVT::isInteger(VT) && MVT::isInteger(Operand.getValueType()) && 1922 "Invalid ZERO_EXTEND!"); 1923 if (Operand.getValueType() == VT) return Operand; // noop extension 1924 assert(MVT::getSizeInBits(Operand.getValueType()) < MVT::getSizeInBits(VT) 1925 && "Invalid zext node, dst < src!"); 1926 if (OpOpcode == ISD::ZERO_EXTEND) // (zext (zext x)) -> (zext x) 1927 return getNode(ISD::ZERO_EXTEND, VT, Operand.Val->getOperand(0)); 1928 break; 1929 case ISD::ANY_EXTEND: 1930 assert(MVT::isInteger(VT) && MVT::isInteger(Operand.getValueType()) && 1931 "Invalid ANY_EXTEND!"); 1932 if (Operand.getValueType() == VT) return Operand; // noop extension 1933 assert(MVT::getSizeInBits(Operand.getValueType()) < MVT::getSizeInBits(VT) 1934 && "Invalid anyext node, dst < src!"); 1935 if (OpOpcode == ISD::ZERO_EXTEND || OpOpcode == ISD::SIGN_EXTEND) 1936 // (ext (zext x)) -> (zext x) and (ext (sext x)) -> (sext x) 1937 return getNode(OpOpcode, VT, Operand.Val->getOperand(0)); 1938 break; 1939 case ISD::TRUNCATE: 1940 assert(MVT::isInteger(VT) && MVT::isInteger(Operand.getValueType()) && 1941 "Invalid TRUNCATE!"); 1942 if (Operand.getValueType() == VT) return Operand; // noop truncate 1943 assert(MVT::getSizeInBits(Operand.getValueType()) > MVT::getSizeInBits(VT) 1944 && "Invalid truncate node, src < dst!"); 1945 if (OpOpcode == ISD::TRUNCATE) 1946 return getNode(ISD::TRUNCATE, VT, Operand.Val->getOperand(0)); 1947 else if (OpOpcode == ISD::ZERO_EXTEND || OpOpcode == ISD::SIGN_EXTEND || 1948 OpOpcode == ISD::ANY_EXTEND) { 1949 // If the source is smaller than the dest, we still need an extend. 1950 if (MVT::getSizeInBits(Operand.Val->getOperand(0).getValueType()) 1951 < MVT::getSizeInBits(VT)) 1952 return getNode(OpOpcode, VT, Operand.Val->getOperand(0)); 1953 else if (MVT::getSizeInBits(Operand.Val->getOperand(0).getValueType()) 1954 > MVT::getSizeInBits(VT)) 1955 return getNode(ISD::TRUNCATE, VT, Operand.Val->getOperand(0)); 1956 else 1957 return Operand.Val->getOperand(0); 1958 } 1959 break; 1960 case ISD::BIT_CONVERT: 1961 // Basic sanity checking. 1962 assert(MVT::getSizeInBits(VT) == MVT::getSizeInBits(Operand.getValueType()) 1963 && "Cannot BIT_CONVERT between types of different sizes!"); 1964 if (VT == Operand.getValueType()) return Operand; // noop conversion. 1965 if (OpOpcode == ISD::BIT_CONVERT) // bitconv(bitconv(x)) -> bitconv(x) 1966 return getNode(ISD::BIT_CONVERT, VT, Operand.getOperand(0)); 1967 if (OpOpcode == ISD::UNDEF) 1968 return getNode(ISD::UNDEF, VT); 1969 break; 1970 case ISD::SCALAR_TO_VECTOR: 1971 assert(MVT::isVector(VT) && !MVT::isVector(Operand.getValueType()) && 1972 MVT::getVectorElementType(VT) == Operand.getValueType() && 1973 "Illegal SCALAR_TO_VECTOR node!"); 1974 break; 1975 case ISD::FNEG: 1976 if (OpOpcode == ISD::FSUB) // -(X-Y) -> (Y-X) 1977 return getNode(ISD::FSUB, VT, Operand.Val->getOperand(1), 1978 Operand.Val->getOperand(0)); 1979 if (OpOpcode == ISD::FNEG) // --X -> X 1980 return Operand.Val->getOperand(0); 1981 break; 1982 case ISD::FABS: 1983 if (OpOpcode == ISD::FNEG) // abs(-X) -> abs(X) 1984 return getNode(ISD::FABS, VT, Operand.Val->getOperand(0)); 1985 break; 1986 } 1987 1988 SDNode *N; 1989 SDVTList VTs = getVTList(VT); 1990 if (VT != MVT::Flag) { // Don't CSE flag producing nodes 1991 FoldingSetNodeID ID; 1992 SDOperand Ops[1] = { Operand }; 1993 AddNodeIDNode(ID, Opcode, VTs, Ops, 1); 1994 void *IP = 0; 1995 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP)) 1996 return SDOperand(E, 0); 1997 N = new UnarySDNode(Opcode, VTs, Operand); 1998 CSEMap.InsertNode(N, IP); 1999 } else { 2000 N = new UnarySDNode(Opcode, VTs, Operand); 2001 } 2002 AllNodes.push_back(N); 2003 return SDOperand(N, 0); 2004} 2005 2006 2007 2008SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT, 2009 SDOperand N1, SDOperand N2) { 2010 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1.Val); 2011 ConstantSDNode *N2C = dyn_cast<ConstantSDNode>(N2.Val); 2012 switch (Opcode) { 2013 default: break; 2014 case ISD::TokenFactor: 2015 assert(VT == MVT::Other && N1.getValueType() == MVT::Other && 2016 N2.getValueType() == MVT::Other && "Invalid token factor!"); 2017 // Fold trivial token factors. 2018 if (N1.getOpcode() == ISD::EntryToken) return N2; 2019 if (N2.getOpcode() == ISD::EntryToken) return N1; 2020 break; 2021 case ISD::AND: 2022 assert(MVT::isInteger(VT) && N1.getValueType() == N2.getValueType() && 2023 N1.getValueType() == VT && "Binary operator types must match!"); 2024 // (X & 0) -> 0. This commonly occurs when legalizing i64 values, so it's 2025 // worth handling here. 2026 if (N2C && N2C->getValue() == 0) 2027 return N2; 2028 if (N2C && N2C->isAllOnesValue()) // X & -1 -> X 2029 return N1; 2030 break; 2031 case ISD::OR: 2032 case ISD::XOR: 2033 assert(MVT::isInteger(VT) && N1.getValueType() == N2.getValueType() && 2034 N1.getValueType() == VT && "Binary operator types must match!"); 2035 // (X ^| 0) -> X. This commonly occurs when legalizing i64 values, so it's 2036 // worth handling here. 2037 if (N2C && N2C->getValue() == 0) 2038 return N1; 2039 break; 2040 case ISD::UDIV: 2041 case ISD::UREM: 2042 case ISD::MULHU: 2043 case ISD::MULHS: 2044 assert(MVT::isInteger(VT) && "This operator does not apply to FP types!"); 2045 // fall through 2046 case ISD::ADD: 2047 case ISD::SUB: 2048 case ISD::MUL: 2049 case ISD::SDIV: 2050 case ISD::SREM: 2051 case ISD::FADD: 2052 case ISD::FSUB: 2053 case ISD::FMUL: 2054 case ISD::FDIV: 2055 case ISD::FREM: 2056 assert(N1.getValueType() == N2.getValueType() && 2057 N1.getValueType() == VT && "Binary operator types must match!"); 2058 break; 2059 case ISD::FCOPYSIGN: // N1 and result must match. N1/N2 need not match. 2060 assert(N1.getValueType() == VT && 2061 MVT::isFloatingPoint(N1.getValueType()) && 2062 MVT::isFloatingPoint(N2.getValueType()) && 2063 "Invalid FCOPYSIGN!"); 2064 break; 2065 case ISD::SHL: 2066 case ISD::SRA: 2067 case ISD::SRL: 2068 case ISD::ROTL: 2069 case ISD::ROTR: 2070 assert(VT == N1.getValueType() && 2071 "Shift operators return type must be the same as their first arg"); 2072 assert(MVT::isInteger(VT) && MVT::isInteger(N2.getValueType()) && 2073 VT != MVT::i1 && "Shifts only work on integers"); 2074 break; 2075 case ISD::FP_ROUND_INREG: { 2076 MVT::ValueType EVT = cast<VTSDNode>(N2)->getVT(); 2077 assert(VT == N1.getValueType() && "Not an inreg round!"); 2078 assert(MVT::isFloatingPoint(VT) && MVT::isFloatingPoint(EVT) && 2079 "Cannot FP_ROUND_INREG integer types"); 2080 assert(MVT::getSizeInBits(EVT) <= MVT::getSizeInBits(VT) && 2081 "Not rounding down!"); 2082 if (cast<VTSDNode>(N2)->getVT() == VT) return N1; // Not actually rounding. 2083 break; 2084 } 2085 case ISD::FP_ROUND: 2086 assert(MVT::isFloatingPoint(VT) && 2087 MVT::isFloatingPoint(N1.getValueType()) && 2088 MVT::getSizeInBits(VT) <= MVT::getSizeInBits(N1.getValueType()) && 2089 isa<ConstantSDNode>(N2) && "Invalid FP_ROUND!"); 2090 if (N1.getValueType() == VT) return N1; // noop conversion. 2091 break; 2092 case ISD::AssertSext: 2093 case ISD::AssertZext: { 2094 MVT::ValueType EVT = cast<VTSDNode>(N2)->getVT(); 2095 assert(VT == N1.getValueType() && "Not an inreg extend!"); 2096 assert(MVT::isInteger(VT) && MVT::isInteger(EVT) && 2097 "Cannot *_EXTEND_INREG FP types"); 2098 assert(MVT::getSizeInBits(EVT) <= MVT::getSizeInBits(VT) && 2099 "Not extending!"); 2100 if (VT == EVT) return N1; // noop assertion. 2101 break; 2102 } 2103 case ISD::SIGN_EXTEND_INREG: { 2104 MVT::ValueType EVT = cast<VTSDNode>(N2)->getVT(); 2105 assert(VT == N1.getValueType() && "Not an inreg extend!"); 2106 assert(MVT::isInteger(VT) && MVT::isInteger(EVT) && 2107 "Cannot *_EXTEND_INREG FP types"); 2108 assert(MVT::getSizeInBits(EVT) <= MVT::getSizeInBits(VT) && 2109 "Not extending!"); 2110 if (EVT == VT) return N1; // Not actually extending 2111 2112 if (N1C) { 2113 int64_t Val = N1C->getValue(); 2114 unsigned FromBits = MVT::getSizeInBits(cast<VTSDNode>(N2)->getVT()); 2115 Val <<= 64-FromBits; 2116 Val >>= 64-FromBits; 2117 return getConstant(Val, VT); 2118 } 2119 break; 2120 } 2121 case ISD::EXTRACT_VECTOR_ELT: 2122 assert(N2C && "Bad EXTRACT_VECTOR_ELT!"); 2123 2124 // EXTRACT_VECTOR_ELT of CONCAT_VECTORS is often formed while lowering is 2125 // expanding copies of large vectors from registers. 2126 if (N1.getOpcode() == ISD::CONCAT_VECTORS && 2127 N1.getNumOperands() > 0) { 2128 unsigned Factor = 2129 MVT::getVectorNumElements(N1.getOperand(0).getValueType()); 2130 return getNode(ISD::EXTRACT_VECTOR_ELT, VT, 2131 N1.getOperand(N2C->getValue() / Factor), 2132 getConstant(N2C->getValue() % Factor, N2.getValueType())); 2133 } 2134 2135 // EXTRACT_VECTOR_ELT of BUILD_VECTOR is often formed while lowering is 2136 // expanding large vector constants. 2137 if (N1.getOpcode() == ISD::BUILD_VECTOR) 2138 return N1.getOperand(N2C->getValue()); 2139 2140 // EXTRACT_VECTOR_ELT of INSERT_VECTOR_ELT is often formed when vector 2141 // operations are lowered to scalars. 2142 if (N1.getOpcode() == ISD::INSERT_VECTOR_ELT) 2143 if (ConstantSDNode *IEC = dyn_cast<ConstantSDNode>(N1.getOperand(2))) { 2144 if (IEC == N2C) 2145 return N1.getOperand(1); 2146 else 2147 return getNode(ISD::EXTRACT_VECTOR_ELT, VT, N1.getOperand(0), N2); 2148 } 2149 break; 2150 case ISD::EXTRACT_ELEMENT: 2151 assert(N2C && (unsigned)N2C->getValue() < 2 && "Bad EXTRACT_ELEMENT!"); 2152 2153 // EXTRACT_ELEMENT of BUILD_PAIR is often formed while legalize is expanding 2154 // 64-bit integers into 32-bit parts. Instead of building the extract of 2155 // the BUILD_PAIR, only to have legalize rip it apart, just do it now. 2156 if (N1.getOpcode() == ISD::BUILD_PAIR) 2157 return N1.getOperand(N2C->getValue()); 2158 2159 // EXTRACT_ELEMENT of a constant int is also very common. 2160 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(N1)) { 2161 unsigned Shift = MVT::getSizeInBits(VT) * N2C->getValue(); 2162 return getConstant(C->getValue() >> Shift, VT); 2163 } 2164 break; 2165 case ISD::EXTRACT_SUBVECTOR: 2166 if (N1.getValueType() == VT) // Trivial extraction. 2167 return N1; 2168 break; 2169 } 2170 2171 if (N1C) { 2172 if (N2C) { 2173 uint64_t C1 = N1C->getValue(), C2 = N2C->getValue(); 2174 switch (Opcode) { 2175 case ISD::ADD: return getConstant(C1 + C2, VT); 2176 case ISD::SUB: return getConstant(C1 - C2, VT); 2177 case ISD::MUL: return getConstant(C1 * C2, VT); 2178 case ISD::UDIV: 2179 if (C2) return getConstant(C1 / C2, VT); 2180 break; 2181 case ISD::UREM : 2182 if (C2) return getConstant(C1 % C2, VT); 2183 break; 2184 case ISD::SDIV : 2185 if (C2) return getConstant(N1C->getSignExtended() / 2186 N2C->getSignExtended(), VT); 2187 break; 2188 case ISD::SREM : 2189 if (C2) return getConstant(N1C->getSignExtended() % 2190 N2C->getSignExtended(), VT); 2191 break; 2192 case ISD::AND : return getConstant(C1 & C2, VT); 2193 case ISD::OR : return getConstant(C1 | C2, VT); 2194 case ISD::XOR : return getConstant(C1 ^ C2, VT); 2195 case ISD::SHL : return getConstant(C1 << C2, VT); 2196 case ISD::SRL : return getConstant(C1 >> C2, VT); 2197 case ISD::SRA : return getConstant(N1C->getSignExtended() >>(int)C2, VT); 2198 case ISD::ROTL : 2199 return getConstant((C1 << C2) | (C1 >> (MVT::getSizeInBits(VT) - C2)), 2200 VT); 2201 case ISD::ROTR : 2202 return getConstant((C1 >> C2) | (C1 << (MVT::getSizeInBits(VT) - C2)), 2203 VT); 2204 default: break; 2205 } 2206 } else { // Cannonicalize constant to RHS if commutative 2207 if (isCommutativeBinOp(Opcode)) { 2208 std::swap(N1C, N2C); 2209 std::swap(N1, N2); 2210 } 2211 } 2212 } 2213 2214 // Constant fold FP operations. 2215 ConstantFPSDNode *N1CFP = dyn_cast<ConstantFPSDNode>(N1.Val); 2216 ConstantFPSDNode *N2CFP = dyn_cast<ConstantFPSDNode>(N2.Val); 2217 if (N1CFP) { 2218 if (!N2CFP && isCommutativeBinOp(Opcode)) { 2219 // Cannonicalize constant to RHS if commutative 2220 std::swap(N1CFP, N2CFP); 2221 std::swap(N1, N2); 2222 } else if (N2CFP && VT != MVT::ppcf128) { 2223 APFloat V1 = N1CFP->getValueAPF(), V2 = N2CFP->getValueAPF(); 2224 APFloat::opStatus s; 2225 switch (Opcode) { 2226 case ISD::FADD: 2227 s = V1.add(V2, APFloat::rmNearestTiesToEven); 2228 if (s != APFloat::opInvalidOp) 2229 return getConstantFP(V1, VT); 2230 break; 2231 case ISD::FSUB: 2232 s = V1.subtract(V2, APFloat::rmNearestTiesToEven); 2233 if (s!=APFloat::opInvalidOp) 2234 return getConstantFP(V1, VT); 2235 break; 2236 case ISD::FMUL: 2237 s = V1.multiply(V2, APFloat::rmNearestTiesToEven); 2238 if (s!=APFloat::opInvalidOp) 2239 return getConstantFP(V1, VT); 2240 break; 2241 case ISD::FDIV: 2242 s = V1.divide(V2, APFloat::rmNearestTiesToEven); 2243 if (s!=APFloat::opInvalidOp && s!=APFloat::opDivByZero) 2244 return getConstantFP(V1, VT); 2245 break; 2246 case ISD::FREM : 2247 s = V1.mod(V2, APFloat::rmNearestTiesToEven); 2248 if (s!=APFloat::opInvalidOp && s!=APFloat::opDivByZero) 2249 return getConstantFP(V1, VT); 2250 break; 2251 case ISD::FCOPYSIGN: 2252 V1.copySign(V2); 2253 return getConstantFP(V1, VT); 2254 default: break; 2255 } 2256 } 2257 } 2258 2259 // Canonicalize an UNDEF to the RHS, even over a constant. 2260 if (N1.getOpcode() == ISD::UNDEF) { 2261 if (isCommutativeBinOp(Opcode)) { 2262 std::swap(N1, N2); 2263 } else { 2264 switch (Opcode) { 2265 case ISD::FP_ROUND_INREG: 2266 case ISD::SIGN_EXTEND_INREG: 2267 case ISD::SUB: 2268 case ISD::FSUB: 2269 case ISD::FDIV: 2270 case ISD::FREM: 2271 case ISD::SRA: 2272 return N1; // fold op(undef, arg2) -> undef 2273 case ISD::UDIV: 2274 case ISD::SDIV: 2275 case ISD::UREM: 2276 case ISD::SREM: 2277 case ISD::SRL: 2278 case ISD::SHL: 2279 if (!MVT::isVector(VT)) 2280 return getConstant(0, VT); // fold op(undef, arg2) -> 0 2281 // For vectors, we can't easily build an all zero vector, just return 2282 // the LHS. 2283 return N2; 2284 } 2285 } 2286 } 2287 2288 // Fold a bunch of operators when the RHS is undef. 2289 if (N2.getOpcode() == ISD::UNDEF) { 2290 switch (Opcode) { 2291 case ISD::ADD: 2292 case ISD::ADDC: 2293 case ISD::ADDE: 2294 case ISD::SUB: 2295 case ISD::FADD: 2296 case ISD::FSUB: 2297 case ISD::FMUL: 2298 case ISD::FDIV: 2299 case ISD::FREM: 2300 case ISD::UDIV: 2301 case ISD::SDIV: 2302 case ISD::UREM: 2303 case ISD::SREM: 2304 case ISD::XOR: 2305 return N2; // fold op(arg1, undef) -> undef 2306 case ISD::MUL: 2307 case ISD::AND: 2308 case ISD::SRL: 2309 case ISD::SHL: 2310 if (!MVT::isVector(VT)) 2311 return getConstant(0, VT); // fold op(arg1, undef) -> 0 2312 // For vectors, we can't easily build an all zero vector, just return 2313 // the LHS. 2314 return N1; 2315 case ISD::OR: 2316 if (!MVT::isVector(VT)) 2317 return getConstant(MVT::getIntVTBitMask(VT), VT); 2318 // For vectors, we can't easily build an all one vector, just return 2319 // the LHS. 2320 return N1; 2321 case ISD::SRA: 2322 return N1; 2323 } 2324 } 2325 2326 // Memoize this node if possible. 2327 SDNode *N; 2328 SDVTList VTs = getVTList(VT); 2329 if (VT != MVT::Flag) { 2330 SDOperand Ops[] = { N1, N2 }; 2331 FoldingSetNodeID ID; 2332 AddNodeIDNode(ID, Opcode, VTs, Ops, 2); 2333 void *IP = 0; 2334 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP)) 2335 return SDOperand(E, 0); 2336 N = new BinarySDNode(Opcode, VTs, N1, N2); 2337 CSEMap.InsertNode(N, IP); 2338 } else { 2339 N = new BinarySDNode(Opcode, VTs, N1, N2); 2340 } 2341 2342 AllNodes.push_back(N); 2343 return SDOperand(N, 0); 2344} 2345 2346SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT, 2347 SDOperand N1, SDOperand N2, SDOperand N3) { 2348 // Perform various simplifications. 2349 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1.Val); 2350 ConstantSDNode *N2C = dyn_cast<ConstantSDNode>(N2.Val); 2351 switch (Opcode) { 2352 case ISD::SETCC: { 2353 // Use FoldSetCC to simplify SETCC's. 2354 SDOperand Simp = FoldSetCC(VT, N1, N2, cast<CondCodeSDNode>(N3)->get()); 2355 if (Simp.Val) return Simp; 2356 break; 2357 } 2358 case ISD::SELECT: 2359 if (N1C) { 2360 if (N1C->getValue()) 2361 return N2; // select true, X, Y -> X 2362 else 2363 return N3; // select false, X, Y -> Y 2364 } 2365 2366 if (N2 == N3) return N2; // select C, X, X -> X 2367 break; 2368 case ISD::BRCOND: 2369 if (N2C) { 2370 if (N2C->getValue()) // Unconditional branch 2371 return getNode(ISD::BR, MVT::Other, N1, N3); 2372 else 2373 return N1; // Never-taken branch 2374 } 2375 break; 2376 case ISD::VECTOR_SHUFFLE: 2377 assert(VT == N1.getValueType() && VT == N2.getValueType() && 2378 MVT::isVector(VT) && MVT::isVector(N3.getValueType()) && 2379 N3.getOpcode() == ISD::BUILD_VECTOR && 2380 MVT::getVectorNumElements(VT) == N3.getNumOperands() && 2381 "Illegal VECTOR_SHUFFLE node!"); 2382 break; 2383 case ISD::BIT_CONVERT: 2384 // Fold bit_convert nodes from a type to themselves. 2385 if (N1.getValueType() == VT) 2386 return N1; 2387 break; 2388 } 2389 2390 // Memoize node if it doesn't produce a flag. 2391 SDNode *N; 2392 SDVTList VTs = getVTList(VT); 2393 if (VT != MVT::Flag) { 2394 SDOperand Ops[] = { N1, N2, N3 }; 2395 FoldingSetNodeID ID; 2396 AddNodeIDNode(ID, Opcode, VTs, Ops, 3); 2397 void *IP = 0; 2398 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP)) 2399 return SDOperand(E, 0); 2400 N = new TernarySDNode(Opcode, VTs, N1, N2, N3); 2401 CSEMap.InsertNode(N, IP); 2402 } else { 2403 N = new TernarySDNode(Opcode, VTs, N1, N2, N3); 2404 } 2405 AllNodes.push_back(N); 2406 return SDOperand(N, 0); 2407} 2408 2409SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT, 2410 SDOperand N1, SDOperand N2, SDOperand N3, 2411 SDOperand N4) { 2412 SDOperand Ops[] = { N1, N2, N3, N4 }; 2413 return getNode(Opcode, VT, Ops, 4); 2414} 2415 2416SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT, 2417 SDOperand N1, SDOperand N2, SDOperand N3, 2418 SDOperand N4, SDOperand N5) { 2419 SDOperand Ops[] = { N1, N2, N3, N4, N5 }; 2420 return getNode(Opcode, VT, Ops, 5); 2421} 2422 2423SDOperand SelectionDAG::getMemcpy(SDOperand Chain, SDOperand Dest, 2424 SDOperand Src, SDOperand Size, 2425 SDOperand Align, 2426 SDOperand AlwaysInline) { 2427 SDOperand Ops[] = { Chain, Dest, Src, Size, Align, AlwaysInline }; 2428 return getNode(ISD::MEMCPY, MVT::Other, Ops, 6); 2429} 2430 2431SDOperand SelectionDAG::getMemmove(SDOperand Chain, SDOperand Dest, 2432 SDOperand Src, SDOperand Size, 2433 SDOperand Align, 2434 SDOperand AlwaysInline) { 2435 SDOperand Ops[] = { Chain, Dest, Src, Size, Align, AlwaysInline }; 2436 return getNode(ISD::MEMMOVE, MVT::Other, Ops, 6); 2437} 2438 2439SDOperand SelectionDAG::getMemset(SDOperand Chain, SDOperand Dest, 2440 SDOperand Src, SDOperand Size, 2441 SDOperand Align, 2442 SDOperand AlwaysInline) { 2443 SDOperand Ops[] = { Chain, Dest, Src, Size, Align, AlwaysInline }; 2444 return getNode(ISD::MEMSET, MVT::Other, Ops, 6); 2445} 2446 2447SDOperand SelectionDAG::getAtomic(unsigned Opcode, SDOperand Chain, 2448 SDOperand Ptr, SDOperand Cmp, 2449 SDOperand Swp, MVT::ValueType VT) { 2450 assert(Opcode == ISD::ATOMIC_LCS && "Invalid Atomic Op"); 2451 assert(Cmp.getValueType() == Swp.getValueType() && "Invalid Atomic Op Types"); 2452 SDVTList VTs = getVTList(Cmp.getValueType(), MVT::Other); 2453 FoldingSetNodeID ID; 2454 SDOperand Ops[] = {Chain, Ptr, Cmp, Swp}; 2455 AddNodeIDNode(ID, Opcode, VTs, Ops, 4); 2456 ID.AddInteger((unsigned int)VT); 2457 void* IP = 0; 2458 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP)) 2459 return SDOperand(E, 0); 2460 SDNode* N = new AtomicSDNode(Opcode, VTs, Chain, Ptr, Cmp, Swp, VT); 2461 CSEMap.InsertNode(N, IP); 2462 AllNodes.push_back(N); 2463 return SDOperand(N, 0); 2464} 2465 2466SDOperand SelectionDAG::getAtomic(unsigned Opcode, SDOperand Chain, 2467 SDOperand Ptr, SDOperand Val, 2468 MVT::ValueType VT) { 2469 assert((Opcode == ISD::ATOMIC_LAS || Opcode == ISD::ATOMIC_SWAP) 2470 && "Invalid Atomic Op"); 2471 SDVTList VTs = getVTList(Val.getValueType(), MVT::Other); 2472 FoldingSetNodeID ID; 2473 SDOperand Ops[] = {Chain, Ptr, Val}; 2474 AddNodeIDNode(ID, Opcode, VTs, Ops, 3); 2475 ID.AddInteger((unsigned int)VT); 2476 void* IP = 0; 2477 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP)) 2478 return SDOperand(E, 0); 2479 SDNode* N = new AtomicSDNode(Opcode, VTs, Chain, Ptr, Val, VT); 2480 CSEMap.InsertNode(N, IP); 2481 AllNodes.push_back(N); 2482 return SDOperand(N, 0); 2483} 2484 2485SDOperand SelectionDAG::getLoad(MVT::ValueType VT, 2486 SDOperand Chain, SDOperand Ptr, 2487 const Value *SV, int SVOffset, 2488 bool isVolatile, unsigned Alignment) { 2489 if (Alignment == 0) { // Ensure that codegen never sees alignment 0 2490 const Type *Ty = 0; 2491 if (VT != MVT::iPTR) { 2492 Ty = MVT::getTypeForValueType(VT); 2493 } else if (SV) { 2494 const PointerType *PT = dyn_cast<PointerType>(SV->getType()); 2495 assert(PT && "Value for load must be a pointer"); 2496 Ty = PT->getElementType(); 2497 } 2498 assert(Ty && "Could not get type information for load"); 2499 Alignment = TLI.getTargetData()->getABITypeAlignment(Ty); 2500 } 2501 SDVTList VTs = getVTList(VT, MVT::Other); 2502 SDOperand Undef = getNode(ISD::UNDEF, Ptr.getValueType()); 2503 SDOperand Ops[] = { Chain, Ptr, Undef }; 2504 FoldingSetNodeID ID; 2505 AddNodeIDNode(ID, ISD::LOAD, VTs, Ops, 3); 2506 ID.AddInteger(ISD::UNINDEXED); 2507 ID.AddInteger(ISD::NON_EXTLOAD); 2508 ID.AddInteger((unsigned int)VT); 2509 ID.AddInteger(Alignment); 2510 ID.AddInteger(isVolatile); 2511 void *IP = 0; 2512 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP)) 2513 return SDOperand(E, 0); 2514 SDNode *N = new LoadSDNode(Ops, VTs, ISD::UNINDEXED, 2515 ISD::NON_EXTLOAD, VT, SV, SVOffset, Alignment, 2516 isVolatile); 2517 CSEMap.InsertNode(N, IP); 2518 AllNodes.push_back(N); 2519 return SDOperand(N, 0); 2520} 2521 2522SDOperand SelectionDAG::getExtLoad(ISD::LoadExtType ExtType, MVT::ValueType VT, 2523 SDOperand Chain, SDOperand Ptr, 2524 const Value *SV, 2525 int SVOffset, MVT::ValueType EVT, 2526 bool isVolatile, unsigned Alignment) { 2527 // If they are asking for an extending load from/to the same thing, return a 2528 // normal load. 2529 if (VT == EVT) 2530 return getLoad(VT, Chain, Ptr, SV, SVOffset, isVolatile, Alignment); 2531 2532 if (MVT::isVector(VT)) 2533 assert(EVT == MVT::getVectorElementType(VT) && "Invalid vector extload!"); 2534 else 2535 assert(MVT::getSizeInBits(EVT) < MVT::getSizeInBits(VT) && 2536 "Should only be an extending load, not truncating!"); 2537 assert((ExtType == ISD::EXTLOAD || MVT::isInteger(VT)) && 2538 "Cannot sign/zero extend a FP/Vector load!"); 2539 assert(MVT::isInteger(VT) == MVT::isInteger(EVT) && 2540 "Cannot convert from FP to Int or Int -> FP!"); 2541 2542 if (Alignment == 0) { // Ensure that codegen never sees alignment 0 2543 const Type *Ty = 0; 2544 if (VT != MVT::iPTR) { 2545 Ty = MVT::getTypeForValueType(VT); 2546 } else if (SV) { 2547 const PointerType *PT = dyn_cast<PointerType>(SV->getType()); 2548 assert(PT && "Value for load must be a pointer"); 2549 Ty = PT->getElementType(); 2550 } 2551 assert(Ty && "Could not get type information for load"); 2552 Alignment = TLI.getTargetData()->getABITypeAlignment(Ty); 2553 } 2554 SDVTList VTs = getVTList(VT, MVT::Other); 2555 SDOperand Undef = getNode(ISD::UNDEF, Ptr.getValueType()); 2556 SDOperand Ops[] = { Chain, Ptr, Undef }; 2557 FoldingSetNodeID ID; 2558 AddNodeIDNode(ID, ISD::LOAD, VTs, Ops, 3); 2559 ID.AddInteger(ISD::UNINDEXED); 2560 ID.AddInteger(ExtType); 2561 ID.AddInteger((unsigned int)EVT); 2562 ID.AddInteger(Alignment); 2563 ID.AddInteger(isVolatile); 2564 void *IP = 0; 2565 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP)) 2566 return SDOperand(E, 0); 2567 SDNode *N = new LoadSDNode(Ops, VTs, ISD::UNINDEXED, ExtType, EVT, 2568 SV, SVOffset, Alignment, isVolatile); 2569 CSEMap.InsertNode(N, IP); 2570 AllNodes.push_back(N); 2571 return SDOperand(N, 0); 2572} 2573 2574SDOperand 2575SelectionDAG::getIndexedLoad(SDOperand OrigLoad, SDOperand Base, 2576 SDOperand Offset, ISD::MemIndexedMode AM) { 2577 LoadSDNode *LD = cast<LoadSDNode>(OrigLoad); 2578 assert(LD->getOffset().getOpcode() == ISD::UNDEF && 2579 "Load is already a indexed load!"); 2580 MVT::ValueType VT = OrigLoad.getValueType(); 2581 SDVTList VTs = getVTList(VT, Base.getValueType(), MVT::Other); 2582 SDOperand Ops[] = { LD->getChain(), Base, Offset }; 2583 FoldingSetNodeID ID; 2584 AddNodeIDNode(ID, ISD::LOAD, VTs, Ops, 3); 2585 ID.AddInteger(AM); 2586 ID.AddInteger(LD->getExtensionType()); 2587 ID.AddInteger((unsigned int)(LD->getMemoryVT())); 2588 ID.AddInteger(LD->getAlignment()); 2589 ID.AddInteger(LD->isVolatile()); 2590 void *IP = 0; 2591 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP)) 2592 return SDOperand(E, 0); 2593 SDNode *N = new LoadSDNode(Ops, VTs, AM, 2594 LD->getExtensionType(), LD->getMemoryVT(), 2595 LD->getSrcValue(), LD->getSrcValueOffset(), 2596 LD->getAlignment(), LD->isVolatile()); 2597 CSEMap.InsertNode(N, IP); 2598 AllNodes.push_back(N); 2599 return SDOperand(N, 0); 2600} 2601 2602SDOperand SelectionDAG::getStore(SDOperand Chain, SDOperand Val, 2603 SDOperand Ptr, const Value *SV, int SVOffset, 2604 bool isVolatile, unsigned Alignment) { 2605 MVT::ValueType VT = Val.getValueType(); 2606 2607 if (Alignment == 0) { // Ensure that codegen never sees alignment 0 2608 const Type *Ty = 0; 2609 if (VT != MVT::iPTR) { 2610 Ty = MVT::getTypeForValueType(VT); 2611 } else if (SV) { 2612 const PointerType *PT = dyn_cast<PointerType>(SV->getType()); 2613 assert(PT && "Value for store must be a pointer"); 2614 Ty = PT->getElementType(); 2615 } 2616 assert(Ty && "Could not get type information for store"); 2617 Alignment = TLI.getTargetData()->getABITypeAlignment(Ty); 2618 } 2619 SDVTList VTs = getVTList(MVT::Other); 2620 SDOperand Undef = getNode(ISD::UNDEF, Ptr.getValueType()); 2621 SDOperand Ops[] = { Chain, Val, Ptr, Undef }; 2622 FoldingSetNodeID ID; 2623 AddNodeIDNode(ID, ISD::STORE, VTs, Ops, 4); 2624 ID.AddInteger(ISD::UNINDEXED); 2625 ID.AddInteger(false); 2626 ID.AddInteger((unsigned int)VT); 2627 ID.AddInteger(Alignment); 2628 ID.AddInteger(isVolatile); 2629 void *IP = 0; 2630 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP)) 2631 return SDOperand(E, 0); 2632 SDNode *N = new StoreSDNode(Ops, VTs, ISD::UNINDEXED, false, 2633 VT, SV, SVOffset, Alignment, isVolatile); 2634 CSEMap.InsertNode(N, IP); 2635 AllNodes.push_back(N); 2636 return SDOperand(N, 0); 2637} 2638 2639SDOperand SelectionDAG::getTruncStore(SDOperand Chain, SDOperand Val, 2640 SDOperand Ptr, const Value *SV, 2641 int SVOffset, MVT::ValueType SVT, 2642 bool isVolatile, unsigned Alignment) { 2643 MVT::ValueType VT = Val.getValueType(); 2644 2645 if (VT == SVT) 2646 return getStore(Chain, Val, Ptr, SV, SVOffset, isVolatile, Alignment); 2647 2648 assert(MVT::getSizeInBits(VT) > MVT::getSizeInBits(SVT) && 2649 "Not a truncation?"); 2650 assert(MVT::isInteger(VT) == MVT::isInteger(SVT) && 2651 "Can't do FP-INT conversion!"); 2652 2653 if (Alignment == 0) { // Ensure that codegen never sees alignment 0 2654 const Type *Ty = 0; 2655 if (VT != MVT::iPTR) { 2656 Ty = MVT::getTypeForValueType(VT); 2657 } else if (SV) { 2658 const PointerType *PT = dyn_cast<PointerType>(SV->getType()); 2659 assert(PT && "Value for store must be a pointer"); 2660 Ty = PT->getElementType(); 2661 } 2662 assert(Ty && "Could not get type information for store"); 2663 Alignment = TLI.getTargetData()->getABITypeAlignment(Ty); 2664 } 2665 SDVTList VTs = getVTList(MVT::Other); 2666 SDOperand Undef = getNode(ISD::UNDEF, Ptr.getValueType()); 2667 SDOperand Ops[] = { Chain, Val, Ptr, Undef }; 2668 FoldingSetNodeID ID; 2669 AddNodeIDNode(ID, ISD::STORE, VTs, Ops, 4); 2670 ID.AddInteger(ISD::UNINDEXED); 2671 ID.AddInteger(1); 2672 ID.AddInteger((unsigned int)SVT); 2673 ID.AddInteger(Alignment); 2674 ID.AddInteger(isVolatile); 2675 void *IP = 0; 2676 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP)) 2677 return SDOperand(E, 0); 2678 SDNode *N = new StoreSDNode(Ops, VTs, ISD::UNINDEXED, true, 2679 SVT, SV, SVOffset, Alignment, isVolatile); 2680 CSEMap.InsertNode(N, IP); 2681 AllNodes.push_back(N); 2682 return SDOperand(N, 0); 2683} 2684 2685SDOperand 2686SelectionDAG::getIndexedStore(SDOperand OrigStore, SDOperand Base, 2687 SDOperand Offset, ISD::MemIndexedMode AM) { 2688 StoreSDNode *ST = cast<StoreSDNode>(OrigStore); 2689 assert(ST->getOffset().getOpcode() == ISD::UNDEF && 2690 "Store is already a indexed store!"); 2691 SDVTList VTs = getVTList(Base.getValueType(), MVT::Other); 2692 SDOperand Ops[] = { ST->getChain(), ST->getValue(), Base, Offset }; 2693 FoldingSetNodeID ID; 2694 AddNodeIDNode(ID, ISD::STORE, VTs, Ops, 4); 2695 ID.AddInteger(AM); 2696 ID.AddInteger(ST->isTruncatingStore()); 2697 ID.AddInteger((unsigned int)(ST->getMemoryVT())); 2698 ID.AddInteger(ST->getAlignment()); 2699 ID.AddInteger(ST->isVolatile()); 2700 void *IP = 0; 2701 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP)) 2702 return SDOperand(E, 0); 2703 SDNode *N = new StoreSDNode(Ops, VTs, AM, 2704 ST->isTruncatingStore(), ST->getMemoryVT(), 2705 ST->getSrcValue(), ST->getSrcValueOffset(), 2706 ST->getAlignment(), ST->isVolatile()); 2707 CSEMap.InsertNode(N, IP); 2708 AllNodes.push_back(N); 2709 return SDOperand(N, 0); 2710} 2711 2712SDOperand SelectionDAG::getVAArg(MVT::ValueType VT, 2713 SDOperand Chain, SDOperand Ptr, 2714 SDOperand SV) { 2715 SDOperand Ops[] = { Chain, Ptr, SV }; 2716 return getNode(ISD::VAARG, getVTList(VT, MVT::Other), Ops, 3); 2717} 2718 2719SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT, 2720 const SDOperand *Ops, unsigned NumOps) { 2721 switch (NumOps) { 2722 case 0: return getNode(Opcode, VT); 2723 case 1: return getNode(Opcode, VT, Ops[0]); 2724 case 2: return getNode(Opcode, VT, Ops[0], Ops[1]); 2725 case 3: return getNode(Opcode, VT, Ops[0], Ops[1], Ops[2]); 2726 default: break; 2727 } 2728 2729 switch (Opcode) { 2730 default: break; 2731 case ISD::SELECT_CC: { 2732 assert(NumOps == 5 && "SELECT_CC takes 5 operands!"); 2733 assert(Ops[0].getValueType() == Ops[1].getValueType() && 2734 "LHS and RHS of condition must have same type!"); 2735 assert(Ops[2].getValueType() == Ops[3].getValueType() && 2736 "True and False arms of SelectCC must have same type!"); 2737 assert(Ops[2].getValueType() == VT && 2738 "select_cc node must be of same type as true and false value!"); 2739 break; 2740 } 2741 case ISD::BR_CC: { 2742 assert(NumOps == 5 && "BR_CC takes 5 operands!"); 2743 assert(Ops[2].getValueType() == Ops[3].getValueType() && 2744 "LHS/RHS of comparison should match types!"); 2745 break; 2746 } 2747 } 2748 2749 // Memoize nodes. 2750 SDNode *N; 2751 SDVTList VTs = getVTList(VT); 2752 if (VT != MVT::Flag) { 2753 FoldingSetNodeID ID; 2754 AddNodeIDNode(ID, Opcode, VTs, Ops, NumOps); 2755 void *IP = 0; 2756 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP)) 2757 return SDOperand(E, 0); 2758 N = new SDNode(Opcode, VTs, Ops, NumOps); 2759 CSEMap.InsertNode(N, IP); 2760 } else { 2761 N = new SDNode(Opcode, VTs, Ops, NumOps); 2762 } 2763 AllNodes.push_back(N); 2764 return SDOperand(N, 0); 2765} 2766 2767SDOperand SelectionDAG::getNode(unsigned Opcode, 2768 std::vector<MVT::ValueType> &ResultTys, 2769 const SDOperand *Ops, unsigned NumOps) { 2770 return getNode(Opcode, getNodeValueTypes(ResultTys), ResultTys.size(), 2771 Ops, NumOps); 2772} 2773 2774SDOperand SelectionDAG::getNode(unsigned Opcode, 2775 const MVT::ValueType *VTs, unsigned NumVTs, 2776 const SDOperand *Ops, unsigned NumOps) { 2777 if (NumVTs == 1) 2778 return getNode(Opcode, VTs[0], Ops, NumOps); 2779 return getNode(Opcode, makeVTList(VTs, NumVTs), Ops, NumOps); 2780} 2781 2782SDOperand SelectionDAG::getNode(unsigned Opcode, SDVTList VTList, 2783 const SDOperand *Ops, unsigned NumOps) { 2784 if (VTList.NumVTs == 1) 2785 return getNode(Opcode, VTList.VTs[0], Ops, NumOps); 2786 2787 switch (Opcode) { 2788 // FIXME: figure out how to safely handle things like 2789 // int foo(int x) { return 1 << (x & 255); } 2790 // int bar() { return foo(256); } 2791#if 0 2792 case ISD::SRA_PARTS: 2793 case ISD::SRL_PARTS: 2794 case ISD::SHL_PARTS: 2795 if (N3.getOpcode() == ISD::SIGN_EXTEND_INREG && 2796 cast<VTSDNode>(N3.getOperand(1))->getVT() != MVT::i1) 2797 return getNode(Opcode, VT, N1, N2, N3.getOperand(0)); 2798 else if (N3.getOpcode() == ISD::AND) 2799 if (ConstantSDNode *AndRHS = dyn_cast<ConstantSDNode>(N3.getOperand(1))) { 2800 // If the and is only masking out bits that cannot effect the shift, 2801 // eliminate the and. 2802 unsigned NumBits = MVT::getSizeInBits(VT)*2; 2803 if ((AndRHS->getValue() & (NumBits-1)) == NumBits-1) 2804 return getNode(Opcode, VT, N1, N2, N3.getOperand(0)); 2805 } 2806 break; 2807#endif 2808 } 2809 2810 // Memoize the node unless it returns a flag. 2811 SDNode *N; 2812 if (VTList.VTs[VTList.NumVTs-1] != MVT::Flag) { 2813 FoldingSetNodeID ID; 2814 AddNodeIDNode(ID, Opcode, VTList, Ops, NumOps); 2815 void *IP = 0; 2816 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP)) 2817 return SDOperand(E, 0); 2818 if (NumOps == 1) 2819 N = new UnarySDNode(Opcode, VTList, Ops[0]); 2820 else if (NumOps == 2) 2821 N = new BinarySDNode(Opcode, VTList, Ops[0], Ops[1]); 2822 else if (NumOps == 3) 2823 N = new TernarySDNode(Opcode, VTList, Ops[0], Ops[1], Ops[2]); 2824 else 2825 N = new SDNode(Opcode, VTList, Ops, NumOps); 2826 CSEMap.InsertNode(N, IP); 2827 } else { 2828 if (NumOps == 1) 2829 N = new UnarySDNode(Opcode, VTList, Ops[0]); 2830 else if (NumOps == 2) 2831 N = new BinarySDNode(Opcode, VTList, Ops[0], Ops[1]); 2832 else if (NumOps == 3) 2833 N = new TernarySDNode(Opcode, VTList, Ops[0], Ops[1], Ops[2]); 2834 else 2835 N = new SDNode(Opcode, VTList, Ops, NumOps); 2836 } 2837 AllNodes.push_back(N); 2838 return SDOperand(N, 0); 2839} 2840 2841SDOperand SelectionDAG::getNode(unsigned Opcode, SDVTList VTList) { 2842 return getNode(Opcode, VTList, 0, 0); 2843} 2844 2845SDOperand SelectionDAG::getNode(unsigned Opcode, SDVTList VTList, 2846 SDOperand N1) { 2847 SDOperand Ops[] = { N1 }; 2848 return getNode(Opcode, VTList, Ops, 1); 2849} 2850 2851SDOperand SelectionDAG::getNode(unsigned Opcode, SDVTList VTList, 2852 SDOperand N1, SDOperand N2) { 2853 SDOperand Ops[] = { N1, N2 }; 2854 return getNode(Opcode, VTList, Ops, 2); 2855} 2856 2857SDOperand SelectionDAG::getNode(unsigned Opcode, SDVTList VTList, 2858 SDOperand N1, SDOperand N2, SDOperand N3) { 2859 SDOperand Ops[] = { N1, N2, N3 }; 2860 return getNode(Opcode, VTList, Ops, 3); 2861} 2862 2863SDOperand SelectionDAG::getNode(unsigned Opcode, SDVTList VTList, 2864 SDOperand N1, SDOperand N2, SDOperand N3, 2865 SDOperand N4) { 2866 SDOperand Ops[] = { N1, N2, N3, N4 }; 2867 return getNode(Opcode, VTList, Ops, 4); 2868} 2869 2870SDOperand SelectionDAG::getNode(unsigned Opcode, SDVTList VTList, 2871 SDOperand N1, SDOperand N2, SDOperand N3, 2872 SDOperand N4, SDOperand N5) { 2873 SDOperand Ops[] = { N1, N2, N3, N4, N5 }; 2874 return getNode(Opcode, VTList, Ops, 5); 2875} 2876 2877SDVTList SelectionDAG::getVTList(MVT::ValueType VT) { 2878 return makeVTList(SDNode::getValueTypeList(VT), 1); 2879} 2880 2881SDVTList SelectionDAG::getVTList(MVT::ValueType VT1, MVT::ValueType VT2) { 2882 for (std::list<std::vector<MVT::ValueType> >::iterator I = VTList.begin(), 2883 E = VTList.end(); I != E; ++I) { 2884 if (I->size() == 2 && (*I)[0] == VT1 && (*I)[1] == VT2) 2885 return makeVTList(&(*I)[0], 2); 2886 } 2887 std::vector<MVT::ValueType> V; 2888 V.push_back(VT1); 2889 V.push_back(VT2); 2890 VTList.push_front(V); 2891 return makeVTList(&(*VTList.begin())[0], 2); 2892} 2893SDVTList SelectionDAG::getVTList(MVT::ValueType VT1, MVT::ValueType VT2, 2894 MVT::ValueType VT3) { 2895 for (std::list<std::vector<MVT::ValueType> >::iterator I = VTList.begin(), 2896 E = VTList.end(); I != E; ++I) { 2897 if (I->size() == 3 && (*I)[0] == VT1 && (*I)[1] == VT2 && 2898 (*I)[2] == VT3) 2899 return makeVTList(&(*I)[0], 3); 2900 } 2901 std::vector<MVT::ValueType> V; 2902 V.push_back(VT1); 2903 V.push_back(VT2); 2904 V.push_back(VT3); 2905 VTList.push_front(V); 2906 return makeVTList(&(*VTList.begin())[0], 3); 2907} 2908 2909SDVTList SelectionDAG::getVTList(const MVT::ValueType *VTs, unsigned NumVTs) { 2910 switch (NumVTs) { 2911 case 0: assert(0 && "Cannot have nodes without results!"); 2912 case 1: return getVTList(VTs[0]); 2913 case 2: return getVTList(VTs[0], VTs[1]); 2914 case 3: return getVTList(VTs[0], VTs[1], VTs[2]); 2915 default: break; 2916 } 2917 2918 for (std::list<std::vector<MVT::ValueType> >::iterator I = VTList.begin(), 2919 E = VTList.end(); I != E; ++I) { 2920 if (I->size() != NumVTs || VTs[0] != (*I)[0] || VTs[1] != (*I)[1]) continue; 2921 2922 bool NoMatch = false; 2923 for (unsigned i = 2; i != NumVTs; ++i) 2924 if (VTs[i] != (*I)[i]) { 2925 NoMatch = true; 2926 break; 2927 } 2928 if (!NoMatch) 2929 return makeVTList(&*I->begin(), NumVTs); 2930 } 2931 2932 VTList.push_front(std::vector<MVT::ValueType>(VTs, VTs+NumVTs)); 2933 return makeVTList(&*VTList.begin()->begin(), NumVTs); 2934} 2935 2936 2937/// UpdateNodeOperands - *Mutate* the specified node in-place to have the 2938/// specified operands. If the resultant node already exists in the DAG, 2939/// this does not modify the specified node, instead it returns the node that 2940/// already exists. If the resultant node does not exist in the DAG, the 2941/// input node is returned. As a degenerate case, if you specify the same 2942/// input operands as the node already has, the input node is returned. 2943SDOperand SelectionDAG:: 2944UpdateNodeOperands(SDOperand InN, SDOperand Op) { 2945 SDNode *N = InN.Val; 2946 assert(N->getNumOperands() == 1 && "Update with wrong number of operands"); 2947 2948 // Check to see if there is no change. 2949 if (Op == N->getOperand(0)) return InN; 2950 2951 // See if the modified node already exists. 2952 void *InsertPos = 0; 2953 if (SDNode *Existing = FindModifiedNodeSlot(N, Op, InsertPos)) 2954 return SDOperand(Existing, InN.ResNo); 2955 2956 // Nope it doesn't. Remove the node from it's current place in the maps. 2957 if (InsertPos) 2958 RemoveNodeFromCSEMaps(N); 2959 2960 // Now we update the operands. 2961 N->OperandList[0].Val->removeUser(N); 2962 Op.Val->addUser(N); 2963 N->OperandList[0] = Op; 2964 2965 // If this gets put into a CSE map, add it. 2966 if (InsertPos) CSEMap.InsertNode(N, InsertPos); 2967 return InN; 2968} 2969 2970SDOperand SelectionDAG:: 2971UpdateNodeOperands(SDOperand InN, SDOperand Op1, SDOperand Op2) { 2972 SDNode *N = InN.Val; 2973 assert(N->getNumOperands() == 2 && "Update with wrong number of operands"); 2974 2975 // Check to see if there is no change. 2976 if (Op1 == N->getOperand(0) && Op2 == N->getOperand(1)) 2977 return InN; // No operands changed, just return the input node. 2978 2979 // See if the modified node already exists. 2980 void *InsertPos = 0; 2981 if (SDNode *Existing = FindModifiedNodeSlot(N, Op1, Op2, InsertPos)) 2982 return SDOperand(Existing, InN.ResNo); 2983 2984 // Nope it doesn't. Remove the node from it's current place in the maps. 2985 if (InsertPos) 2986 RemoveNodeFromCSEMaps(N); 2987 2988 // Now we update the operands. 2989 if (N->OperandList[0] != Op1) { 2990 N->OperandList[0].Val->removeUser(N); 2991 Op1.Val->addUser(N); 2992 N->OperandList[0] = Op1; 2993 } 2994 if (N->OperandList[1] != Op2) { 2995 N->OperandList[1].Val->removeUser(N); 2996 Op2.Val->addUser(N); 2997 N->OperandList[1] = Op2; 2998 } 2999 3000 // If this gets put into a CSE map, add it. 3001 if (InsertPos) CSEMap.InsertNode(N, InsertPos); 3002 return InN; 3003} 3004 3005SDOperand SelectionDAG:: 3006UpdateNodeOperands(SDOperand N, SDOperand Op1, SDOperand Op2, SDOperand Op3) { 3007 SDOperand Ops[] = { Op1, Op2, Op3 }; 3008 return UpdateNodeOperands(N, Ops, 3); 3009} 3010 3011SDOperand SelectionDAG:: 3012UpdateNodeOperands(SDOperand N, SDOperand Op1, SDOperand Op2, 3013 SDOperand Op3, SDOperand Op4) { 3014 SDOperand Ops[] = { Op1, Op2, Op3, Op4 }; 3015 return UpdateNodeOperands(N, Ops, 4); 3016} 3017 3018SDOperand SelectionDAG:: 3019UpdateNodeOperands(SDOperand N, SDOperand Op1, SDOperand Op2, 3020 SDOperand Op3, SDOperand Op4, SDOperand Op5) { 3021 SDOperand Ops[] = { Op1, Op2, Op3, Op4, Op5 }; 3022 return UpdateNodeOperands(N, Ops, 5); 3023} 3024 3025 3026SDOperand SelectionDAG:: 3027UpdateNodeOperands(SDOperand InN, SDOperand *Ops, unsigned NumOps) { 3028 SDNode *N = InN.Val; 3029 assert(N->getNumOperands() == NumOps && 3030 "Update with wrong number of operands"); 3031 3032 // Check to see if there is no change. 3033 bool AnyChange = false; 3034 for (unsigned i = 0; i != NumOps; ++i) { 3035 if (Ops[i] != N->getOperand(i)) { 3036 AnyChange = true; 3037 break; 3038 } 3039 } 3040 3041 // No operands changed, just return the input node. 3042 if (!AnyChange) return InN; 3043 3044 // See if the modified node already exists. 3045 void *InsertPos = 0; 3046 if (SDNode *Existing = FindModifiedNodeSlot(N, Ops, NumOps, InsertPos)) 3047 return SDOperand(Existing, InN.ResNo); 3048 3049 // Nope it doesn't. Remove the node from it's current place in the maps. 3050 if (InsertPos) 3051 RemoveNodeFromCSEMaps(N); 3052 3053 // Now we update the operands. 3054 for (unsigned i = 0; i != NumOps; ++i) { 3055 if (N->OperandList[i] != Ops[i]) { 3056 N->OperandList[i].Val->removeUser(N); 3057 Ops[i].Val->addUser(N); 3058 N->OperandList[i] = Ops[i]; 3059 } 3060 } 3061 3062 // If this gets put into a CSE map, add it. 3063 if (InsertPos) CSEMap.InsertNode(N, InsertPos); 3064 return InN; 3065} 3066 3067 3068/// MorphNodeTo - This frees the operands of the current node, resets the 3069/// opcode, types, and operands to the specified value. This should only be 3070/// used by the SelectionDAG class. 3071void SDNode::MorphNodeTo(unsigned Opc, SDVTList L, 3072 const SDOperand *Ops, unsigned NumOps) { 3073 NodeType = Opc; 3074 ValueList = L.VTs; 3075 NumValues = L.NumVTs; 3076 3077 // Clear the operands list, updating used nodes to remove this from their 3078 // use list. 3079 for (op_iterator I = op_begin(), E = op_end(); I != E; ++I) 3080 I->Val->removeUser(this); 3081 3082 // If NumOps is larger than the # of operands we currently have, reallocate 3083 // the operand list. 3084 if (NumOps > NumOperands) { 3085 if (OperandsNeedDelete) 3086 delete [] OperandList; 3087 OperandList = new SDOperand[NumOps]; 3088 OperandsNeedDelete = true; 3089 } 3090 3091 // Assign the new operands. 3092 NumOperands = NumOps; 3093 3094 for (unsigned i = 0, e = NumOps; i != e; ++i) { 3095 OperandList[i] = Ops[i]; 3096 SDNode *N = OperandList[i].Val; 3097 N->Uses.push_back(this); 3098 } 3099} 3100 3101/// SelectNodeTo - These are used for target selectors to *mutate* the 3102/// specified node to have the specified return type, Target opcode, and 3103/// operands. Note that target opcodes are stored as 3104/// ISD::BUILTIN_OP_END+TargetOpcode in the node opcode field. 3105/// 3106/// Note that SelectNodeTo returns the resultant node. If there is already a 3107/// node of the specified opcode and operands, it returns that node instead of 3108/// the current one. 3109SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc, 3110 MVT::ValueType VT) { 3111 SDVTList VTs = getVTList(VT); 3112 FoldingSetNodeID ID; 3113 AddNodeIDNode(ID, ISD::BUILTIN_OP_END+TargetOpc, VTs, 0, 0); 3114 void *IP = 0; 3115 if (SDNode *ON = CSEMap.FindNodeOrInsertPos(ID, IP)) 3116 return ON; 3117 3118 RemoveNodeFromCSEMaps(N); 3119 3120 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc, VTs, 0, 0); 3121 3122 CSEMap.InsertNode(N, IP); 3123 return N; 3124} 3125 3126SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc, 3127 MVT::ValueType VT, SDOperand Op1) { 3128 // If an identical node already exists, use it. 3129 SDVTList VTs = getVTList(VT); 3130 SDOperand Ops[] = { Op1 }; 3131 3132 FoldingSetNodeID ID; 3133 AddNodeIDNode(ID, ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 1); 3134 void *IP = 0; 3135 if (SDNode *ON = CSEMap.FindNodeOrInsertPos(ID, IP)) 3136 return ON; 3137 3138 RemoveNodeFromCSEMaps(N); 3139 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 1); 3140 CSEMap.InsertNode(N, IP); 3141 return N; 3142} 3143 3144SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc, 3145 MVT::ValueType VT, SDOperand Op1, 3146 SDOperand Op2) { 3147 // If an identical node already exists, use it. 3148 SDVTList VTs = getVTList(VT); 3149 SDOperand Ops[] = { Op1, Op2 }; 3150 3151 FoldingSetNodeID ID; 3152 AddNodeIDNode(ID, ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 2); 3153 void *IP = 0; 3154 if (SDNode *ON = CSEMap.FindNodeOrInsertPos(ID, IP)) 3155 return ON; 3156 3157 RemoveNodeFromCSEMaps(N); 3158 3159 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 2); 3160 3161 CSEMap.InsertNode(N, IP); // Memoize the new node. 3162 return N; 3163} 3164 3165SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc, 3166 MVT::ValueType VT, SDOperand Op1, 3167 SDOperand Op2, SDOperand Op3) { 3168 // If an identical node already exists, use it. 3169 SDVTList VTs = getVTList(VT); 3170 SDOperand Ops[] = { Op1, Op2, Op3 }; 3171 FoldingSetNodeID ID; 3172 AddNodeIDNode(ID, ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 3); 3173 void *IP = 0; 3174 if (SDNode *ON = CSEMap.FindNodeOrInsertPos(ID, IP)) 3175 return ON; 3176 3177 RemoveNodeFromCSEMaps(N); 3178 3179 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 3); 3180 3181 CSEMap.InsertNode(N, IP); // Memoize the new node. 3182 return N; 3183} 3184 3185SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc, 3186 MVT::ValueType VT, const SDOperand *Ops, 3187 unsigned NumOps) { 3188 // If an identical node already exists, use it. 3189 SDVTList VTs = getVTList(VT); 3190 FoldingSetNodeID ID; 3191 AddNodeIDNode(ID, ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, NumOps); 3192 void *IP = 0; 3193 if (SDNode *ON = CSEMap.FindNodeOrInsertPos(ID, IP)) 3194 return ON; 3195 3196 RemoveNodeFromCSEMaps(N); 3197 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, NumOps); 3198 3199 CSEMap.InsertNode(N, IP); // Memoize the new node. 3200 return N; 3201} 3202 3203SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc, 3204 MVT::ValueType VT1, MVT::ValueType VT2, 3205 SDOperand Op1, SDOperand Op2) { 3206 SDVTList VTs = getVTList(VT1, VT2); 3207 FoldingSetNodeID ID; 3208 SDOperand Ops[] = { Op1, Op2 }; 3209 AddNodeIDNode(ID, ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 2); 3210 void *IP = 0; 3211 if (SDNode *ON = CSEMap.FindNodeOrInsertPos(ID, IP)) 3212 return ON; 3213 3214 RemoveNodeFromCSEMaps(N); 3215 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 2); 3216 CSEMap.InsertNode(N, IP); // Memoize the new node. 3217 return N; 3218} 3219 3220SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc, 3221 MVT::ValueType VT1, MVT::ValueType VT2, 3222 SDOperand Op1, SDOperand Op2, 3223 SDOperand Op3) { 3224 // If an identical node already exists, use it. 3225 SDVTList VTs = getVTList(VT1, VT2); 3226 SDOperand Ops[] = { Op1, Op2, Op3 }; 3227 FoldingSetNodeID ID; 3228 AddNodeIDNode(ID, ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 3); 3229 void *IP = 0; 3230 if (SDNode *ON = CSEMap.FindNodeOrInsertPos(ID, IP)) 3231 return ON; 3232 3233 RemoveNodeFromCSEMaps(N); 3234 3235 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 3); 3236 CSEMap.InsertNode(N, IP); // Memoize the new node. 3237 return N; 3238} 3239 3240 3241/// getTargetNode - These are used for target selectors to create a new node 3242/// with specified return type(s), target opcode, and operands. 3243/// 3244/// Note that getTargetNode returns the resultant node. If there is already a 3245/// node of the specified opcode and operands, it returns that node instead of 3246/// the current one. 3247SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT) { 3248 return getNode(ISD::BUILTIN_OP_END+Opcode, VT).Val; 3249} 3250SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT, 3251 SDOperand Op1) { 3252 return getNode(ISD::BUILTIN_OP_END+Opcode, VT, Op1).Val; 3253} 3254SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT, 3255 SDOperand Op1, SDOperand Op2) { 3256 return getNode(ISD::BUILTIN_OP_END+Opcode, VT, Op1, Op2).Val; 3257} 3258SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT, 3259 SDOperand Op1, SDOperand Op2, 3260 SDOperand Op3) { 3261 return getNode(ISD::BUILTIN_OP_END+Opcode, VT, Op1, Op2, Op3).Val; 3262} 3263SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT, 3264 const SDOperand *Ops, unsigned NumOps) { 3265 return getNode(ISD::BUILTIN_OP_END+Opcode, VT, Ops, NumOps).Val; 3266} 3267SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1, 3268 MVT::ValueType VT2) { 3269 const MVT::ValueType *VTs = getNodeValueTypes(VT1, VT2); 3270 SDOperand Op; 3271 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 2, &Op, 0).Val; 3272} 3273SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1, 3274 MVT::ValueType VT2, SDOperand Op1) { 3275 const MVT::ValueType *VTs = getNodeValueTypes(VT1, VT2); 3276 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 2, &Op1, 1).Val; 3277} 3278SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1, 3279 MVT::ValueType VT2, SDOperand Op1, 3280 SDOperand Op2) { 3281 const MVT::ValueType *VTs = getNodeValueTypes(VT1, VT2); 3282 SDOperand Ops[] = { Op1, Op2 }; 3283 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 2, Ops, 2).Val; 3284} 3285SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1, 3286 MVT::ValueType VT2, SDOperand Op1, 3287 SDOperand Op2, SDOperand Op3) { 3288 const MVT::ValueType *VTs = getNodeValueTypes(VT1, VT2); 3289 SDOperand Ops[] = { Op1, Op2, Op3 }; 3290 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 2, Ops, 3).Val; 3291} 3292SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1, 3293 MVT::ValueType VT2, 3294 const SDOperand *Ops, unsigned NumOps) { 3295 const MVT::ValueType *VTs = getNodeValueTypes(VT1, VT2); 3296 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 2, Ops, NumOps).Val; 3297} 3298SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1, 3299 MVT::ValueType VT2, MVT::ValueType VT3, 3300 SDOperand Op1, SDOperand Op2) { 3301 const MVT::ValueType *VTs = getNodeValueTypes(VT1, VT2, VT3); 3302 SDOperand Ops[] = { Op1, Op2 }; 3303 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 3, Ops, 2).Val; 3304} 3305SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1, 3306 MVT::ValueType VT2, MVT::ValueType VT3, 3307 SDOperand Op1, SDOperand Op2, 3308 SDOperand Op3) { 3309 const MVT::ValueType *VTs = getNodeValueTypes(VT1, VT2, VT3); 3310 SDOperand Ops[] = { Op1, Op2, Op3 }; 3311 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 3, Ops, 3).Val; 3312} 3313SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1, 3314 MVT::ValueType VT2, MVT::ValueType VT3, 3315 const SDOperand *Ops, unsigned NumOps) { 3316 const MVT::ValueType *VTs = getNodeValueTypes(VT1, VT2, VT3); 3317 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 3, Ops, NumOps).Val; 3318} 3319SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1, 3320 MVT::ValueType VT2, MVT::ValueType VT3, 3321 MVT::ValueType VT4, 3322 const SDOperand *Ops, unsigned NumOps) { 3323 std::vector<MVT::ValueType> VTList; 3324 VTList.push_back(VT1); 3325 VTList.push_back(VT2); 3326 VTList.push_back(VT3); 3327 VTList.push_back(VT4); 3328 const MVT::ValueType *VTs = getNodeValueTypes(VTList); 3329 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 4, Ops, NumOps).Val; 3330} 3331SDNode *SelectionDAG::getTargetNode(unsigned Opcode, 3332 std::vector<MVT::ValueType> &ResultTys, 3333 const SDOperand *Ops, unsigned NumOps) { 3334 const MVT::ValueType *VTs = getNodeValueTypes(ResultTys); 3335 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, ResultTys.size(), 3336 Ops, NumOps).Val; 3337} 3338 3339 3340/// ReplaceAllUsesWith - Modify anything using 'From' to use 'To' instead. 3341/// This can cause recursive merging of nodes in the DAG. 3342/// 3343/// This version assumes From has a single result value. 3344/// 3345void SelectionDAG::ReplaceAllUsesWith(SDOperand FromN, SDOperand To, 3346 DAGUpdateListener *UpdateListener) { 3347 SDNode *From = FromN.Val; 3348 assert(From->getNumValues() == 1 && FromN.ResNo == 0 && 3349 "Cannot replace with this method!"); 3350 assert(From != To.Val && "Cannot replace uses of with self"); 3351 3352 while (!From->use_empty()) { 3353 // Process users until they are all gone. 3354 SDNode *U = *From->use_begin(); 3355 3356 // This node is about to morph, remove its old self from the CSE maps. 3357 RemoveNodeFromCSEMaps(U); 3358 3359 for (SDOperand *I = U->OperandList, *E = U->OperandList+U->NumOperands; 3360 I != E; ++I) 3361 if (I->Val == From) { 3362 From->removeUser(U); 3363 *I = To; 3364 To.Val->addUser(U); 3365 } 3366 3367 // Now that we have modified U, add it back to the CSE maps. If it already 3368 // exists there, recursively merge the results together. 3369 if (SDNode *Existing = AddNonLeafNodeToCSEMaps(U)) { 3370 ReplaceAllUsesWith(U, Existing, UpdateListener); 3371 // U is now dead. Inform the listener if it exists and delete it. 3372 if (UpdateListener) 3373 UpdateListener->NodeDeleted(U); 3374 DeleteNodeNotInCSEMaps(U); 3375 } else { 3376 // If the node doesn't already exist, we updated it. Inform a listener if 3377 // it exists. 3378 if (UpdateListener) 3379 UpdateListener->NodeUpdated(U); 3380 } 3381 } 3382} 3383 3384/// ReplaceAllUsesWith - Modify anything using 'From' to use 'To' instead. 3385/// This can cause recursive merging of nodes in the DAG. 3386/// 3387/// This version assumes From/To have matching types and numbers of result 3388/// values. 3389/// 3390void SelectionDAG::ReplaceAllUsesWith(SDNode *From, SDNode *To, 3391 DAGUpdateListener *UpdateListener) { 3392 assert(From != To && "Cannot replace uses of with self"); 3393 assert(From->getNumValues() == To->getNumValues() && 3394 "Cannot use this version of ReplaceAllUsesWith!"); 3395 if (From->getNumValues() == 1) // If possible, use the faster version. 3396 return ReplaceAllUsesWith(SDOperand(From, 0), SDOperand(To, 0), 3397 UpdateListener); 3398 3399 while (!From->use_empty()) { 3400 // Process users until they are all gone. 3401 SDNode *U = *From->use_begin(); 3402 3403 // This node is about to morph, remove its old self from the CSE maps. 3404 RemoveNodeFromCSEMaps(U); 3405 3406 for (SDOperand *I = U->OperandList, *E = U->OperandList+U->NumOperands; 3407 I != E; ++I) 3408 if (I->Val == From) { 3409 From->removeUser(U); 3410 I->Val = To; 3411 To->addUser(U); 3412 } 3413 3414 // Now that we have modified U, add it back to the CSE maps. If it already 3415 // exists there, recursively merge the results together. 3416 if (SDNode *Existing = AddNonLeafNodeToCSEMaps(U)) { 3417 ReplaceAllUsesWith(U, Existing, UpdateListener); 3418 // U is now dead. Inform the listener if it exists and delete it. 3419 if (UpdateListener) 3420 UpdateListener->NodeDeleted(U); 3421 DeleteNodeNotInCSEMaps(U); 3422 } else { 3423 // If the node doesn't already exist, we updated it. Inform a listener if 3424 // it exists. 3425 if (UpdateListener) 3426 UpdateListener->NodeUpdated(U); 3427 } 3428 } 3429} 3430 3431/// ReplaceAllUsesWith - Modify anything using 'From' to use 'To' instead. 3432/// This can cause recursive merging of nodes in the DAG. 3433/// 3434/// This version can replace From with any result values. To must match the 3435/// number and types of values returned by From. 3436void SelectionDAG::ReplaceAllUsesWith(SDNode *From, 3437 const SDOperand *To, 3438 DAGUpdateListener *UpdateListener) { 3439 if (From->getNumValues() == 1) // Handle the simple case efficiently. 3440 return ReplaceAllUsesWith(SDOperand(From, 0), To[0], UpdateListener); 3441 3442 while (!From->use_empty()) { 3443 // Process users until they are all gone. 3444 SDNode *U = *From->use_begin(); 3445 3446 // This node is about to morph, remove its old self from the CSE maps. 3447 RemoveNodeFromCSEMaps(U); 3448 3449 for (SDOperand *I = U->OperandList, *E = U->OperandList+U->NumOperands; 3450 I != E; ++I) 3451 if (I->Val == From) { 3452 const SDOperand &ToOp = To[I->ResNo]; 3453 From->removeUser(U); 3454 *I = ToOp; 3455 ToOp.Val->addUser(U); 3456 } 3457 3458 // Now that we have modified U, add it back to the CSE maps. If it already 3459 // exists there, recursively merge the results together. 3460 if (SDNode *Existing = AddNonLeafNodeToCSEMaps(U)) { 3461 ReplaceAllUsesWith(U, Existing, UpdateListener); 3462 // U is now dead. Inform the listener if it exists and delete it. 3463 if (UpdateListener) 3464 UpdateListener->NodeDeleted(U); 3465 DeleteNodeNotInCSEMaps(U); 3466 } else { 3467 // If the node doesn't already exist, we updated it. Inform a listener if 3468 // it exists. 3469 if (UpdateListener) 3470 UpdateListener->NodeUpdated(U); 3471 } 3472 } 3473} 3474 3475namespace { 3476 /// ChainedSetUpdaterListener - This class is a DAGUpdateListener that removes 3477 /// any deleted nodes from the set passed into its constructor and recursively 3478 /// notifies another update listener if specified. 3479 class ChainedSetUpdaterListener : 3480 public SelectionDAG::DAGUpdateListener { 3481 SmallSetVector<SDNode*, 16> &Set; 3482 SelectionDAG::DAGUpdateListener *Chain; 3483 public: 3484 ChainedSetUpdaterListener(SmallSetVector<SDNode*, 16> &set, 3485 SelectionDAG::DAGUpdateListener *chain) 3486 : Set(set), Chain(chain) {} 3487 3488 virtual void NodeDeleted(SDNode *N) { 3489 Set.remove(N); 3490 if (Chain) Chain->NodeDeleted(N); 3491 } 3492 virtual void NodeUpdated(SDNode *N) { 3493 if (Chain) Chain->NodeUpdated(N); 3494 } 3495 }; 3496} 3497 3498/// ReplaceAllUsesOfValueWith - Replace any uses of From with To, leaving 3499/// uses of other values produced by From.Val alone. The Deleted vector is 3500/// handled the same way as for ReplaceAllUsesWith. 3501void SelectionDAG::ReplaceAllUsesOfValueWith(SDOperand From, SDOperand To, 3502 DAGUpdateListener *UpdateListener){ 3503 assert(From != To && "Cannot replace a value with itself"); 3504 3505 // Handle the simple, trivial, case efficiently. 3506 if (From.Val->getNumValues() == 1) { 3507 ReplaceAllUsesWith(From, To, UpdateListener); 3508 return; 3509 } 3510 3511 if (From.use_empty()) return; 3512 3513 // Get all of the users of From.Val. We want these in a nice, 3514 // deterministically ordered and uniqued set, so we use a SmallSetVector. 3515 SmallSetVector<SDNode*, 16> Users(From.Val->use_begin(), From.Val->use_end()); 3516 3517 // When one of the recursive merges deletes nodes from the graph, we need to 3518 // make sure that UpdateListener is notified *and* that the node is removed 3519 // from Users if present. CSUL does this. 3520 ChainedSetUpdaterListener CSUL(Users, UpdateListener); 3521 3522 while (!Users.empty()) { 3523 // We know that this user uses some value of From. If it is the right 3524 // value, update it. 3525 SDNode *User = Users.back(); 3526 Users.pop_back(); 3527 3528 // Scan for an operand that matches From. 3529 SDOperand *Op = User->OperandList, *E = User->OperandList+User->NumOperands; 3530 for (; Op != E; ++Op) 3531 if (*Op == From) break; 3532 3533 // If there are no matches, the user must use some other result of From. 3534 if (Op == E) continue; 3535 3536 // Okay, we know this user needs to be updated. Remove its old self 3537 // from the CSE maps. 3538 RemoveNodeFromCSEMaps(User); 3539 3540 // Update all operands that match "From" in case there are multiple uses. 3541 for (; Op != E; ++Op) { 3542 if (*Op == From) { 3543 From.Val->removeUser(User); 3544 *Op = To; 3545 To.Val->addUser(User); 3546 } 3547 } 3548 3549 // Now that we have modified User, add it back to the CSE maps. If it 3550 // already exists there, recursively merge the results together. 3551 SDNode *Existing = AddNonLeafNodeToCSEMaps(User); 3552 if (!Existing) { 3553 if (UpdateListener) UpdateListener->NodeUpdated(User); 3554 continue; // Continue on to next user. 3555 } 3556 3557 // If there was already an existing matching node, use ReplaceAllUsesWith 3558 // to replace the dead one with the existing one. This can cause 3559 // recursive merging of other unrelated nodes down the line. The merging 3560 // can cause deletion of nodes that used the old value. To handle this, we 3561 // use CSUL to remove them from the Users set. 3562 ReplaceAllUsesWith(User, Existing, &CSUL); 3563 3564 // User is now dead. Notify a listener if present. 3565 if (UpdateListener) UpdateListener->NodeDeleted(User); 3566 DeleteNodeNotInCSEMaps(User); 3567 } 3568} 3569 3570 3571/// AssignNodeIds - Assign a unique node id for each node in the DAG based on 3572/// their allnodes order. It returns the maximum id. 3573unsigned SelectionDAG::AssignNodeIds() { 3574 unsigned Id = 0; 3575 for (allnodes_iterator I = allnodes_begin(), E = allnodes_end(); I != E; ++I){ 3576 SDNode *N = I; 3577 N->setNodeId(Id++); 3578 } 3579 return Id; 3580} 3581 3582/// AssignTopologicalOrder - Assign a unique node id for each node in the DAG 3583/// based on their topological order. It returns the maximum id and a vector 3584/// of the SDNodes* in assigned order by reference. 3585unsigned SelectionDAG::AssignTopologicalOrder(std::vector<SDNode*> &TopOrder) { 3586 unsigned DAGSize = AllNodes.size(); 3587 std::vector<unsigned> InDegree(DAGSize); 3588 std::vector<SDNode*> Sources; 3589 3590 // Use a two pass approach to avoid using a std::map which is slow. 3591 unsigned Id = 0; 3592 for (allnodes_iterator I = allnodes_begin(),E = allnodes_end(); I != E; ++I){ 3593 SDNode *N = I; 3594 N->setNodeId(Id++); 3595 unsigned Degree = N->use_size(); 3596 InDegree[N->getNodeId()] = Degree; 3597 if (Degree == 0) 3598 Sources.push_back(N); 3599 } 3600 3601 TopOrder.clear(); 3602 while (!Sources.empty()) { 3603 SDNode *N = Sources.back(); 3604 Sources.pop_back(); 3605 TopOrder.push_back(N); 3606 for (SDNode::op_iterator I = N->op_begin(), E = N->op_end(); I != E; ++I) { 3607 SDNode *P = I->Val; 3608 unsigned Degree = --InDegree[P->getNodeId()]; 3609 if (Degree == 0) 3610 Sources.push_back(P); 3611 } 3612 } 3613 3614 // Second pass, assign the actual topological order as node ids. 3615 Id = 0; 3616 for (std::vector<SDNode*>::iterator TI = TopOrder.begin(),TE = TopOrder.end(); 3617 TI != TE; ++TI) 3618 (*TI)->setNodeId(Id++); 3619 3620 return Id; 3621} 3622 3623 3624 3625//===----------------------------------------------------------------------===// 3626// SDNode Class 3627//===----------------------------------------------------------------------===// 3628 3629// Out-of-line virtual method to give class a home. 3630void SDNode::ANCHOR() {} 3631void UnarySDNode::ANCHOR() {} 3632void BinarySDNode::ANCHOR() {} 3633void TernarySDNode::ANCHOR() {} 3634void HandleSDNode::ANCHOR() {} 3635void StringSDNode::ANCHOR() {} 3636void ConstantSDNode::ANCHOR() {} 3637void ConstantFPSDNode::ANCHOR() {} 3638void GlobalAddressSDNode::ANCHOR() {} 3639void FrameIndexSDNode::ANCHOR() {} 3640void JumpTableSDNode::ANCHOR() {} 3641void ConstantPoolSDNode::ANCHOR() {} 3642void BasicBlockSDNode::ANCHOR() {} 3643void SrcValueSDNode::ANCHOR() {} 3644void MemOperandSDNode::ANCHOR() {} 3645void RegisterSDNode::ANCHOR() {} 3646void ExternalSymbolSDNode::ANCHOR() {} 3647void CondCodeSDNode::ANCHOR() {} 3648void VTSDNode::ANCHOR() {} 3649void LoadSDNode::ANCHOR() {} 3650void StoreSDNode::ANCHOR() {} 3651void AtomicSDNode::ANCHOR() {} 3652 3653HandleSDNode::~HandleSDNode() { 3654 SDVTList VTs = { 0, 0 }; 3655 MorphNodeTo(ISD::HANDLENODE, VTs, 0, 0); // Drops operand uses. 3656} 3657 3658GlobalAddressSDNode::GlobalAddressSDNode(bool isTarget, const GlobalValue *GA, 3659 MVT::ValueType VT, int o) 3660 : SDNode(isa<GlobalVariable>(GA) && 3661 cast<GlobalVariable>(GA)->isThreadLocal() ? 3662 // Thread Local 3663 (isTarget ? ISD::TargetGlobalTLSAddress : ISD::GlobalTLSAddress) : 3664 // Non Thread Local 3665 (isTarget ? ISD::TargetGlobalAddress : ISD::GlobalAddress), 3666 getSDVTList(VT)), Offset(o) { 3667 TheGlobal = const_cast<GlobalValue*>(GA); 3668} 3669 3670/// getMemOperand - Return a MemOperand object describing the memory 3671/// reference performed by this load or store. 3672MemOperand LSBaseSDNode::getMemOperand() const { 3673 int Size = (MVT::getSizeInBits(getMemoryVT()) + 7) >> 3; 3674 int Flags = 3675 getOpcode() == ISD::LOAD ? MemOperand::MOLoad : MemOperand::MOStore; 3676 if (IsVolatile) Flags |= MemOperand::MOVolatile; 3677 3678 // Check if the load references a frame index, and does not have 3679 // an SV attached. 3680 const FrameIndexSDNode *FI = 3681 dyn_cast<const FrameIndexSDNode>(getBasePtr().Val); 3682 if (!getSrcValue() && FI) 3683 return MemOperand(PseudoSourceValue::getFixedStack(), Flags, 3684 FI->getIndex(), Size, Alignment); 3685 else 3686 return MemOperand(getSrcValue(), Flags, 3687 getSrcValueOffset(), Size, Alignment); 3688} 3689 3690/// Profile - Gather unique data for the node. 3691/// 3692void SDNode::Profile(FoldingSetNodeID &ID) { 3693 AddNodeIDNode(ID, this); 3694} 3695 3696/// getValueTypeList - Return a pointer to the specified value type. 3697/// 3698const MVT::ValueType *SDNode::getValueTypeList(MVT::ValueType VT) { 3699 if (MVT::isExtendedVT(VT)) { 3700 static std::set<MVT::ValueType> EVTs; 3701 return &(*EVTs.insert(VT).first); 3702 } else { 3703 static MVT::ValueType VTs[MVT::LAST_VALUETYPE]; 3704 VTs[VT] = VT; 3705 return &VTs[VT]; 3706 } 3707} 3708 3709/// hasNUsesOfValue - Return true if there are exactly NUSES uses of the 3710/// indicated value. This method ignores uses of other values defined by this 3711/// operation. 3712bool SDNode::hasNUsesOfValue(unsigned NUses, unsigned Value) const { 3713 assert(Value < getNumValues() && "Bad value!"); 3714 3715 // If there is only one value, this is easy. 3716 if (getNumValues() == 1) 3717 return use_size() == NUses; 3718 if (use_size() < NUses) return false; 3719 3720 SDOperand TheValue(const_cast<SDNode *>(this), Value); 3721 3722 SmallPtrSet<SDNode*, 32> UsersHandled; 3723 3724 for (SDNode::use_iterator UI = Uses.begin(), E = Uses.end(); UI != E; ++UI) { 3725 SDNode *User = *UI; 3726 if (User->getNumOperands() == 1 || 3727 UsersHandled.insert(User)) // First time we've seen this? 3728 for (unsigned i = 0, e = User->getNumOperands(); i != e; ++i) 3729 if (User->getOperand(i) == TheValue) { 3730 if (NUses == 0) 3731 return false; // too many uses 3732 --NUses; 3733 } 3734 } 3735 3736 // Found exactly the right number of uses? 3737 return NUses == 0; 3738} 3739 3740 3741/// hasAnyUseOfValue - Return true if there are any use of the indicated 3742/// value. This method ignores uses of other values defined by this operation. 3743bool SDNode::hasAnyUseOfValue(unsigned Value) const { 3744 assert(Value < getNumValues() && "Bad value!"); 3745 3746 if (use_empty()) return false; 3747 3748 SDOperand TheValue(const_cast<SDNode *>(this), Value); 3749 3750 SmallPtrSet<SDNode*, 32> UsersHandled; 3751 3752 for (SDNode::use_iterator UI = Uses.begin(), E = Uses.end(); UI != E; ++UI) { 3753 SDNode *User = *UI; 3754 if (User->getNumOperands() == 1 || 3755 UsersHandled.insert(User)) // First time we've seen this? 3756 for (unsigned i = 0, e = User->getNumOperands(); i != e; ++i) 3757 if (User->getOperand(i) == TheValue) { 3758 return true; 3759 } 3760 } 3761 3762 return false; 3763} 3764 3765 3766/// isOnlyUse - Return true if this node is the only use of N. 3767/// 3768bool SDNode::isOnlyUse(SDNode *N) const { 3769 bool Seen = false; 3770 for (SDNode::use_iterator I = N->use_begin(), E = N->use_end(); I != E; ++I) { 3771 SDNode *User = *I; 3772 if (User == this) 3773 Seen = true; 3774 else 3775 return false; 3776 } 3777 3778 return Seen; 3779} 3780 3781/// isOperand - Return true if this node is an operand of N. 3782/// 3783bool SDOperand::isOperand(SDNode *N) const { 3784 for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i) 3785 if (*this == N->getOperand(i)) 3786 return true; 3787 return false; 3788} 3789 3790bool SDNode::isOperand(SDNode *N) const { 3791 for (unsigned i = 0, e = N->NumOperands; i != e; ++i) 3792 if (this == N->OperandList[i].Val) 3793 return true; 3794 return false; 3795} 3796 3797/// reachesChainWithoutSideEffects - Return true if this operand (which must 3798/// be a chain) reaches the specified operand without crossing any 3799/// side-effecting instructions. In practice, this looks through token 3800/// factors and non-volatile loads. In order to remain efficient, this only 3801/// looks a couple of nodes in, it does not do an exhaustive search. 3802bool SDOperand::reachesChainWithoutSideEffects(SDOperand Dest, 3803 unsigned Depth) const { 3804 if (*this == Dest) return true; 3805 3806 // Don't search too deeply, we just want to be able to see through 3807 // TokenFactor's etc. 3808 if (Depth == 0) return false; 3809 3810 // If this is a token factor, all inputs to the TF happen in parallel. If any 3811 // of the operands of the TF reach dest, then we can do the xform. 3812 if (getOpcode() == ISD::TokenFactor) { 3813 for (unsigned i = 0, e = getNumOperands(); i != e; ++i) 3814 if (getOperand(i).reachesChainWithoutSideEffects(Dest, Depth-1)) 3815 return true; 3816 return false; 3817 } 3818 3819 // Loads don't have side effects, look through them. 3820 if (LoadSDNode *Ld = dyn_cast<LoadSDNode>(*this)) { 3821 if (!Ld->isVolatile()) 3822 return Ld->getChain().reachesChainWithoutSideEffects(Dest, Depth-1); 3823 } 3824 return false; 3825} 3826 3827 3828static void findPredecessor(SDNode *N, const SDNode *P, bool &found, 3829 SmallPtrSet<SDNode *, 32> &Visited) { 3830 if (found || !Visited.insert(N)) 3831 return; 3832 3833 for (unsigned i = 0, e = N->getNumOperands(); !found && i != e; ++i) { 3834 SDNode *Op = N->getOperand(i).Val; 3835 if (Op == P) { 3836 found = true; 3837 return; 3838 } 3839 findPredecessor(Op, P, found, Visited); 3840 } 3841} 3842 3843/// isPredecessor - Return true if this node is a predecessor of N. This node 3844/// is either an operand of N or it can be reached by recursively traversing 3845/// up the operands. 3846/// NOTE: this is an expensive method. Use it carefully. 3847bool SDNode::isPredecessor(SDNode *N) const { 3848 SmallPtrSet<SDNode *, 32> Visited; 3849 bool found = false; 3850 findPredecessor(N, this, found, Visited); 3851 return found; 3852} 3853 3854uint64_t SDNode::getConstantOperandVal(unsigned Num) const { 3855 assert(Num < NumOperands && "Invalid child # of SDNode!"); 3856 return cast<ConstantSDNode>(OperandList[Num])->getValue(); 3857} 3858 3859std::string SDNode::getOperationName(const SelectionDAG *G) const { 3860 switch (getOpcode()) { 3861 default: 3862 if (getOpcode() < ISD::BUILTIN_OP_END) 3863 return "<<Unknown DAG Node>>"; 3864 else { 3865 if (G) { 3866 if (const TargetInstrInfo *TII = G->getTarget().getInstrInfo()) 3867 if (getOpcode()-ISD::BUILTIN_OP_END < TII->getNumOpcodes()) 3868 return TII->get(getOpcode()-ISD::BUILTIN_OP_END).getName(); 3869 3870 TargetLowering &TLI = G->getTargetLoweringInfo(); 3871 const char *Name = 3872 TLI.getTargetNodeName(getOpcode()); 3873 if (Name) return Name; 3874 } 3875 3876 return "<<Unknown Target Node>>"; 3877 } 3878 3879 case ISD::MEMBARRIER: return "MemBarrier"; 3880 case ISD::ATOMIC_LCS: return "AtomicLCS"; 3881 case ISD::ATOMIC_LAS: return "AtomicLAS"; 3882 case ISD::ATOMIC_SWAP: return "AtomicSWAP"; 3883 case ISD::PCMARKER: return "PCMarker"; 3884 case ISD::READCYCLECOUNTER: return "ReadCycleCounter"; 3885 case ISD::SRCVALUE: return "SrcValue"; 3886 case ISD::MEMOPERAND: return "MemOperand"; 3887 case ISD::EntryToken: return "EntryToken"; 3888 case ISD::TokenFactor: return "TokenFactor"; 3889 case ISD::AssertSext: return "AssertSext"; 3890 case ISD::AssertZext: return "AssertZext"; 3891 3892 case ISD::STRING: return "String"; 3893 case ISD::BasicBlock: return "BasicBlock"; 3894 case ISD::VALUETYPE: return "ValueType"; 3895 case ISD::Register: return "Register"; 3896 3897 case ISD::Constant: return "Constant"; 3898 case ISD::ConstantFP: return "ConstantFP"; 3899 case ISD::GlobalAddress: return "GlobalAddress"; 3900 case ISD::GlobalTLSAddress: return "GlobalTLSAddress"; 3901 case ISD::FrameIndex: return "FrameIndex"; 3902 case ISD::JumpTable: return "JumpTable"; 3903 case ISD::GLOBAL_OFFSET_TABLE: return "GLOBAL_OFFSET_TABLE"; 3904 case ISD::RETURNADDR: return "RETURNADDR"; 3905 case ISD::FRAMEADDR: return "FRAMEADDR"; 3906 case ISD::FRAME_TO_ARGS_OFFSET: return "FRAME_TO_ARGS_OFFSET"; 3907 case ISD::EXCEPTIONADDR: return "EXCEPTIONADDR"; 3908 case ISD::EHSELECTION: return "EHSELECTION"; 3909 case ISD::EH_RETURN: return "EH_RETURN"; 3910 case ISD::ConstantPool: return "ConstantPool"; 3911 case ISD::ExternalSymbol: return "ExternalSymbol"; 3912 case ISD::INTRINSIC_WO_CHAIN: { 3913 unsigned IID = cast<ConstantSDNode>(getOperand(0))->getValue(); 3914 return Intrinsic::getName((Intrinsic::ID)IID); 3915 } 3916 case ISD::INTRINSIC_VOID: 3917 case ISD::INTRINSIC_W_CHAIN: { 3918 unsigned IID = cast<ConstantSDNode>(getOperand(1))->getValue(); 3919 return Intrinsic::getName((Intrinsic::ID)IID); 3920 } 3921 3922 case ISD::BUILD_VECTOR: return "BUILD_VECTOR"; 3923 case ISD::TargetConstant: return "TargetConstant"; 3924 case ISD::TargetConstantFP:return "TargetConstantFP"; 3925 case ISD::TargetGlobalAddress: return "TargetGlobalAddress"; 3926 case ISD::TargetGlobalTLSAddress: return "TargetGlobalTLSAddress"; 3927 case ISD::TargetFrameIndex: return "TargetFrameIndex"; 3928 case ISD::TargetJumpTable: return "TargetJumpTable"; 3929 case ISD::TargetConstantPool: return "TargetConstantPool"; 3930 case ISD::TargetExternalSymbol: return "TargetExternalSymbol"; 3931 3932 case ISD::CopyToReg: return "CopyToReg"; 3933 case ISD::CopyFromReg: return "CopyFromReg"; 3934 case ISD::UNDEF: return "undef"; 3935 case ISD::MERGE_VALUES: return "merge_values"; 3936 case ISD::INLINEASM: return "inlineasm"; 3937 case ISD::LABEL: return "label"; 3938 case ISD::DECLARE: return "declare"; 3939 case ISD::HANDLENODE: return "handlenode"; 3940 case ISD::FORMAL_ARGUMENTS: return "formal_arguments"; 3941 case ISD::CALL: return "call"; 3942 3943 // Unary operators 3944 case ISD::FABS: return "fabs"; 3945 case ISD::FNEG: return "fneg"; 3946 case ISD::FSQRT: return "fsqrt"; 3947 case ISD::FSIN: return "fsin"; 3948 case ISD::FCOS: return "fcos"; 3949 case ISD::FPOWI: return "fpowi"; 3950 case ISD::FPOW: return "fpow"; 3951 3952 // Binary operators 3953 case ISD::ADD: return "add"; 3954 case ISD::SUB: return "sub"; 3955 case ISD::MUL: return "mul"; 3956 case ISD::MULHU: return "mulhu"; 3957 case ISD::MULHS: return "mulhs"; 3958 case ISD::SDIV: return "sdiv"; 3959 case ISD::UDIV: return "udiv"; 3960 case ISD::SREM: return "srem"; 3961 case ISD::UREM: return "urem"; 3962 case ISD::SMUL_LOHI: return "smul_lohi"; 3963 case ISD::UMUL_LOHI: return "umul_lohi"; 3964 case ISD::SDIVREM: return "sdivrem"; 3965 case ISD::UDIVREM: return "divrem"; 3966 case ISD::AND: return "and"; 3967 case ISD::OR: return "or"; 3968 case ISD::XOR: return "xor"; 3969 case ISD::SHL: return "shl"; 3970 case ISD::SRA: return "sra"; 3971 case ISD::SRL: return "srl"; 3972 case ISD::ROTL: return "rotl"; 3973 case ISD::ROTR: return "rotr"; 3974 case ISD::FADD: return "fadd"; 3975 case ISD::FSUB: return "fsub"; 3976 case ISD::FMUL: return "fmul"; 3977 case ISD::FDIV: return "fdiv"; 3978 case ISD::FREM: return "frem"; 3979 case ISD::FCOPYSIGN: return "fcopysign"; 3980 case ISD::FGETSIGN: return "fgetsign"; 3981 3982 case ISD::SETCC: return "setcc"; 3983 case ISD::SELECT: return "select"; 3984 case ISD::SELECT_CC: return "select_cc"; 3985 case ISD::INSERT_VECTOR_ELT: return "insert_vector_elt"; 3986 case ISD::EXTRACT_VECTOR_ELT: return "extract_vector_elt"; 3987 case ISD::CONCAT_VECTORS: return "concat_vectors"; 3988 case ISD::EXTRACT_SUBVECTOR: return "extract_subvector"; 3989 case ISD::SCALAR_TO_VECTOR: return "scalar_to_vector"; 3990 case ISD::VECTOR_SHUFFLE: return "vector_shuffle"; 3991 case ISD::CARRY_FALSE: return "carry_false"; 3992 case ISD::ADDC: return "addc"; 3993 case ISD::ADDE: return "adde"; 3994 case ISD::SUBC: return "subc"; 3995 case ISD::SUBE: return "sube"; 3996 case ISD::SHL_PARTS: return "shl_parts"; 3997 case ISD::SRA_PARTS: return "sra_parts"; 3998 case ISD::SRL_PARTS: return "srl_parts"; 3999 4000 case ISD::EXTRACT_SUBREG: return "extract_subreg"; 4001 case ISD::INSERT_SUBREG: return "insert_subreg"; 4002 4003 // Conversion operators. 4004 case ISD::SIGN_EXTEND: return "sign_extend"; 4005 case ISD::ZERO_EXTEND: return "zero_extend"; 4006 case ISD::ANY_EXTEND: return "any_extend"; 4007 case ISD::SIGN_EXTEND_INREG: return "sign_extend_inreg"; 4008 case ISD::TRUNCATE: return "truncate"; 4009 case ISD::FP_ROUND: return "fp_round"; 4010 case ISD::FLT_ROUNDS_: return "flt_rounds"; 4011 case ISD::FP_ROUND_INREG: return "fp_round_inreg"; 4012 case ISD::FP_EXTEND: return "fp_extend"; 4013 4014 case ISD::SINT_TO_FP: return "sint_to_fp"; 4015 case ISD::UINT_TO_FP: return "uint_to_fp"; 4016 case ISD::FP_TO_SINT: return "fp_to_sint"; 4017 case ISD::FP_TO_UINT: return "fp_to_uint"; 4018 case ISD::BIT_CONVERT: return "bit_convert"; 4019 4020 // Control flow instructions 4021 case ISD::BR: return "br"; 4022 case ISD::BRIND: return "brind"; 4023 case ISD::BR_JT: return "br_jt"; 4024 case ISD::BRCOND: return "brcond"; 4025 case ISD::BR_CC: return "br_cc"; 4026 case ISD::RET: return "ret"; 4027 case ISD::CALLSEQ_START: return "callseq_start"; 4028 case ISD::CALLSEQ_END: return "callseq_end"; 4029 4030 // Other operators 4031 case ISD::LOAD: return "load"; 4032 case ISD::STORE: return "store"; 4033 case ISD::VAARG: return "vaarg"; 4034 case ISD::VACOPY: return "vacopy"; 4035 case ISD::VAEND: return "vaend"; 4036 case ISD::VASTART: return "vastart"; 4037 case ISD::DYNAMIC_STACKALLOC: return "dynamic_stackalloc"; 4038 case ISD::EXTRACT_ELEMENT: return "extract_element"; 4039 case ISD::BUILD_PAIR: return "build_pair"; 4040 case ISD::STACKSAVE: return "stacksave"; 4041 case ISD::STACKRESTORE: return "stackrestore"; 4042 case ISD::TRAP: return "trap"; 4043 4044 // Block memory operations. 4045 case ISD::MEMSET: return "memset"; 4046 case ISD::MEMCPY: return "memcpy"; 4047 case ISD::MEMMOVE: return "memmove"; 4048 4049 // Bit manipulation 4050 case ISD::BSWAP: return "bswap"; 4051 case ISD::CTPOP: return "ctpop"; 4052 case ISD::CTTZ: return "cttz"; 4053 case ISD::CTLZ: return "ctlz"; 4054 4055 // Debug info 4056 case ISD::LOCATION: return "location"; 4057 case ISD::DEBUG_LOC: return "debug_loc"; 4058 4059 // Trampolines 4060 case ISD::TRAMPOLINE: return "trampoline"; 4061 4062 case ISD::CONDCODE: 4063 switch (cast<CondCodeSDNode>(this)->get()) { 4064 default: assert(0 && "Unknown setcc condition!"); 4065 case ISD::SETOEQ: return "setoeq"; 4066 case ISD::SETOGT: return "setogt"; 4067 case ISD::SETOGE: return "setoge"; 4068 case ISD::SETOLT: return "setolt"; 4069 case ISD::SETOLE: return "setole"; 4070 case ISD::SETONE: return "setone"; 4071 4072 case ISD::SETO: return "seto"; 4073 case ISD::SETUO: return "setuo"; 4074 case ISD::SETUEQ: return "setue"; 4075 case ISD::SETUGT: return "setugt"; 4076 case ISD::SETUGE: return "setuge"; 4077 case ISD::SETULT: return "setult"; 4078 case ISD::SETULE: return "setule"; 4079 case ISD::SETUNE: return "setune"; 4080 4081 case ISD::SETEQ: return "seteq"; 4082 case ISD::SETGT: return "setgt"; 4083 case ISD::SETGE: return "setge"; 4084 case ISD::SETLT: return "setlt"; 4085 case ISD::SETLE: return "setle"; 4086 case ISD::SETNE: return "setne"; 4087 } 4088 } 4089} 4090 4091const char *SDNode::getIndexedModeName(ISD::MemIndexedMode AM) { 4092 switch (AM) { 4093 default: 4094 return ""; 4095 case ISD::PRE_INC: 4096 return "<pre-inc>"; 4097 case ISD::PRE_DEC: 4098 return "<pre-dec>"; 4099 case ISD::POST_INC: 4100 return "<post-inc>"; 4101 case ISD::POST_DEC: 4102 return "<post-dec>"; 4103 } 4104} 4105 4106void SDNode::dump() const { dump(0); } 4107void SDNode::dump(const SelectionDAG *G) const { 4108 cerr << (void*)this << ": "; 4109 4110 for (unsigned i = 0, e = getNumValues(); i != e; ++i) { 4111 if (i) cerr << ","; 4112 if (getValueType(i) == MVT::Other) 4113 cerr << "ch"; 4114 else 4115 cerr << MVT::getValueTypeString(getValueType(i)); 4116 } 4117 cerr << " = " << getOperationName(G); 4118 4119 cerr << " "; 4120 for (unsigned i = 0, e = getNumOperands(); i != e; ++i) { 4121 if (i) cerr << ", "; 4122 cerr << (void*)getOperand(i).Val; 4123 if (unsigned RN = getOperand(i).ResNo) 4124 cerr << ":" << RN; 4125 } 4126 4127 if (!isTargetOpcode() && getOpcode() == ISD::VECTOR_SHUFFLE) { 4128 SDNode *Mask = getOperand(2).Val; 4129 cerr << "<"; 4130 for (unsigned i = 0, e = Mask->getNumOperands(); i != e; ++i) { 4131 if (i) cerr << ","; 4132 if (Mask->getOperand(i).getOpcode() == ISD::UNDEF) 4133 cerr << "u"; 4134 else 4135 cerr << cast<ConstantSDNode>(Mask->getOperand(i))->getValue(); 4136 } 4137 cerr << ">"; 4138 } 4139 4140 if (const ConstantSDNode *CSDN = dyn_cast<ConstantSDNode>(this)) { 4141 cerr << "<" << CSDN->getValue() << ">"; 4142 } else if (const ConstantFPSDNode *CSDN = dyn_cast<ConstantFPSDNode>(this)) { 4143 if (&CSDN->getValueAPF().getSemantics()==&APFloat::IEEEsingle) 4144 cerr << "<" << CSDN->getValueAPF().convertToFloat() << ">"; 4145 else if (&CSDN->getValueAPF().getSemantics()==&APFloat::IEEEdouble) 4146 cerr << "<" << CSDN->getValueAPF().convertToDouble() << ">"; 4147 else { 4148 cerr << "<APFloat("; 4149 CSDN->getValueAPF().convertToAPInt().dump(); 4150 cerr << ")>"; 4151 } 4152 } else if (const GlobalAddressSDNode *GADN = 4153 dyn_cast<GlobalAddressSDNode>(this)) { 4154 int offset = GADN->getOffset(); 4155 cerr << "<"; 4156 WriteAsOperand(*cerr.stream(), GADN->getGlobal()) << ">"; 4157 if (offset > 0) 4158 cerr << " + " << offset; 4159 else 4160 cerr << " " << offset; 4161 } else if (const FrameIndexSDNode *FIDN = dyn_cast<FrameIndexSDNode>(this)) { 4162 cerr << "<" << FIDN->getIndex() << ">"; 4163 } else if (const JumpTableSDNode *JTDN = dyn_cast<JumpTableSDNode>(this)) { 4164 cerr << "<" << JTDN->getIndex() << ">"; 4165 } else if (const ConstantPoolSDNode *CP = dyn_cast<ConstantPoolSDNode>(this)){ 4166 int offset = CP->getOffset(); 4167 if (CP->isMachineConstantPoolEntry()) 4168 cerr << "<" << *CP->getMachineCPVal() << ">"; 4169 else 4170 cerr << "<" << *CP->getConstVal() << ">"; 4171 if (offset > 0) 4172 cerr << " + " << offset; 4173 else 4174 cerr << " " << offset; 4175 } else if (const BasicBlockSDNode *BBDN = dyn_cast<BasicBlockSDNode>(this)) { 4176 cerr << "<"; 4177 const Value *LBB = (const Value*)BBDN->getBasicBlock()->getBasicBlock(); 4178 if (LBB) 4179 cerr << LBB->getName() << " "; 4180 cerr << (const void*)BBDN->getBasicBlock() << ">"; 4181 } else if (const RegisterSDNode *R = dyn_cast<RegisterSDNode>(this)) { 4182 if (G && R->getReg() && 4183 TargetRegisterInfo::isPhysicalRegister(R->getReg())) { 4184 cerr << " " <<G->getTarget().getRegisterInfo()->getName(R->getReg()); 4185 } else { 4186 cerr << " #" << R->getReg(); 4187 } 4188 } else if (const ExternalSymbolSDNode *ES = 4189 dyn_cast<ExternalSymbolSDNode>(this)) { 4190 cerr << "'" << ES->getSymbol() << "'"; 4191 } else if (const SrcValueSDNode *M = dyn_cast<SrcValueSDNode>(this)) { 4192 if (M->getValue()) 4193 cerr << "<" << M->getValue() << ">"; 4194 else 4195 cerr << "<null>"; 4196 } else if (const MemOperandSDNode *M = dyn_cast<MemOperandSDNode>(this)) { 4197 if (M->MO.getValue()) 4198 cerr << "<" << M->MO.getValue() << ":" << M->MO.getOffset() << ">"; 4199 else 4200 cerr << "<null:" << M->MO.getOffset() << ">"; 4201 } else if (const VTSDNode *N = dyn_cast<VTSDNode>(this)) { 4202 cerr << ":" << MVT::getValueTypeString(N->getVT()); 4203 } else if (const LoadSDNode *LD = dyn_cast<LoadSDNode>(this)) { 4204 const Value *SrcValue = LD->getSrcValue(); 4205 int SrcOffset = LD->getSrcValueOffset(); 4206 cerr << " <"; 4207 if (SrcValue) 4208 cerr << SrcValue; 4209 else 4210 cerr << "null"; 4211 cerr << ":" << SrcOffset << ">"; 4212 4213 bool doExt = true; 4214 switch (LD->getExtensionType()) { 4215 default: doExt = false; break; 4216 case ISD::EXTLOAD: 4217 cerr << " <anyext "; 4218 break; 4219 case ISD::SEXTLOAD: 4220 cerr << " <sext "; 4221 break; 4222 case ISD::ZEXTLOAD: 4223 cerr << " <zext "; 4224 break; 4225 } 4226 if (doExt) 4227 cerr << MVT::getValueTypeString(LD->getMemoryVT()) << ">"; 4228 4229 const char *AM = getIndexedModeName(LD->getAddressingMode()); 4230 if (*AM) 4231 cerr << " " << AM; 4232 if (LD->isVolatile()) 4233 cerr << " <volatile>"; 4234 cerr << " alignment=" << LD->getAlignment(); 4235 } else if (const StoreSDNode *ST = dyn_cast<StoreSDNode>(this)) { 4236 const Value *SrcValue = ST->getSrcValue(); 4237 int SrcOffset = ST->getSrcValueOffset(); 4238 cerr << " <"; 4239 if (SrcValue) 4240 cerr << SrcValue; 4241 else 4242 cerr << "null"; 4243 cerr << ":" << SrcOffset << ">"; 4244 4245 if (ST->isTruncatingStore()) 4246 cerr << " <trunc " 4247 << MVT::getValueTypeString(ST->getMemoryVT()) << ">"; 4248 4249 const char *AM = getIndexedModeName(ST->getAddressingMode()); 4250 if (*AM) 4251 cerr << " " << AM; 4252 if (ST->isVolatile()) 4253 cerr << " <volatile>"; 4254 cerr << " alignment=" << ST->getAlignment(); 4255 } 4256} 4257 4258static void DumpNodes(const SDNode *N, unsigned indent, const SelectionDAG *G) { 4259 for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i) 4260 if (N->getOperand(i).Val->hasOneUse()) 4261 DumpNodes(N->getOperand(i).Val, indent+2, G); 4262 else 4263 cerr << "\n" << std::string(indent+2, ' ') 4264 << (void*)N->getOperand(i).Val << ": <multiple use>"; 4265 4266 4267 cerr << "\n" << std::string(indent, ' '); 4268 N->dump(G); 4269} 4270 4271void SelectionDAG::dump() const { 4272 cerr << "SelectionDAG has " << AllNodes.size() << " nodes:"; 4273 std::vector<const SDNode*> Nodes; 4274 for (allnodes_const_iterator I = allnodes_begin(), E = allnodes_end(); 4275 I != E; ++I) 4276 Nodes.push_back(I); 4277 4278 std::sort(Nodes.begin(), Nodes.end()); 4279 4280 for (unsigned i = 0, e = Nodes.size(); i != e; ++i) { 4281 if (!Nodes[i]->hasOneUse() && Nodes[i] != getRoot().Val) 4282 DumpNodes(Nodes[i], 2, this); 4283 } 4284 4285 if (getRoot().Val) DumpNodes(getRoot().Val, 2, this); 4286 4287 cerr << "\n\n"; 4288} 4289 4290const Type *ConstantPoolSDNode::getType() const { 4291 if (isMachineConstantPoolEntry()) 4292 return Val.MachineCPVal->getType(); 4293 return Val.ConstVal->getType(); 4294} 4295