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