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