SelectionDAG.cpp revision b654176cb4d58c8784043fbedd4584f3f0eedc07
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/GlobalValue.h" 17#include "llvm/Intrinsics.h" 18#include "llvm/Assembly/Writer.h" 19#include "llvm/CodeGen/MachineBasicBlock.h" 20#include "llvm/CodeGen/MachineConstantPool.h" 21#include "llvm/Support/MathExtras.h" 22#include "llvm/Target/MRegisterInfo.h" 23#include "llvm/Target/TargetLowering.h" 24#include "llvm/Target/TargetInstrInfo.h" 25#include "llvm/Target/TargetMachine.h" 26#include "llvm/ADT/SetVector.h" 27#include "llvm/ADT/SmallPtrSet.h" 28#include "llvm/ADT/SmallVector.h" 29#include "llvm/ADT/StringExtras.h" 30#include <algorithm> 31#include <cmath> 32using namespace llvm; 33 34/// makeVTList - Return an instance of the SDVTList struct initialized with the 35/// specified members. 36static SDVTList makeVTList(const MVT::ValueType *VTs, unsigned NumVTs) { 37 SDVTList Res = {VTs, NumVTs}; 38 return Res; 39} 40 41//===----------------------------------------------------------------------===// 42// ConstantFPSDNode Class 43//===----------------------------------------------------------------------===// 44 45/// isExactlyValue - We don't rely on operator== working on double values, as 46/// it returns true for things that are clearly not equal, like -0.0 and 0.0. 47/// As such, this method can be used to do an exact bit-for-bit comparison of 48/// two floating point values. 49bool ConstantFPSDNode::isExactlyValue(double V) const { 50 return DoubleToBits(V) == DoubleToBits(Value); 51} 52 53//===----------------------------------------------------------------------===// 54// ISD Namespace 55//===----------------------------------------------------------------------===// 56 57/// isBuildVectorAllOnes - Return true if the specified node is a 58/// BUILD_VECTOR where all of the elements are ~0 or undef. 59bool ISD::isBuildVectorAllOnes(const SDNode *N) { 60 // Look through a bit convert. 61 if (N->getOpcode() == ISD::BIT_CONVERT) 62 N = N->getOperand(0).Val; 63 64 if (N->getOpcode() != ISD::BUILD_VECTOR) return false; 65 66 unsigned i = 0, e = N->getNumOperands(); 67 68 // Skip over all of the undef values. 69 while (i != e && N->getOperand(i).getOpcode() == ISD::UNDEF) 70 ++i; 71 72 // Do not accept an all-undef vector. 73 if (i == e) return false; 74 75 // Do not accept build_vectors that aren't all constants or which have non-~0 76 // elements. 77 SDOperand NotZero = N->getOperand(i); 78 if (isa<ConstantSDNode>(NotZero)) { 79 if (!cast<ConstantSDNode>(NotZero)->isAllOnesValue()) 80 return false; 81 } else if (isa<ConstantFPSDNode>(NotZero)) { 82 MVT::ValueType VT = NotZero.getValueType(); 83 if (VT== MVT::f64) { 84 if (DoubleToBits(cast<ConstantFPSDNode>(NotZero)->getValue()) != 85 (uint64_t)-1) 86 return false; 87 } else { 88 if (FloatToBits(cast<ConstantFPSDNode>(NotZero)->getValue()) != 89 (uint32_t)-1) 90 return false; 91 } 92 } else 93 return false; 94 95 // Okay, we have at least one ~0 value, check to see if the rest match or are 96 // undefs. 97 for (++i; i != e; ++i) 98 if (N->getOperand(i) != NotZero && 99 N->getOperand(i).getOpcode() != ISD::UNDEF) 100 return false; 101 return true; 102} 103 104 105/// isBuildVectorAllZeros - Return true if the specified node is a 106/// BUILD_VECTOR where all of the elements are 0 or undef. 107bool ISD::isBuildVectorAllZeros(const SDNode *N) { 108 // Look through a bit convert. 109 if (N->getOpcode() == ISD::BIT_CONVERT) 110 N = N->getOperand(0).Val; 111 112 if (N->getOpcode() != ISD::BUILD_VECTOR) return false; 113 114 unsigned i = 0, e = N->getNumOperands(); 115 116 // Skip over all of the undef values. 117 while (i != e && N->getOperand(i).getOpcode() == ISD::UNDEF) 118 ++i; 119 120 // Do not accept an all-undef vector. 121 if (i == e) return false; 122 123 // Do not accept build_vectors that aren't all constants or which have non-~0 124 // elements. 125 SDOperand Zero = N->getOperand(i); 126 if (isa<ConstantSDNode>(Zero)) { 127 if (!cast<ConstantSDNode>(Zero)->isNullValue()) 128 return false; 129 } else if (isa<ConstantFPSDNode>(Zero)) { 130 if (!cast<ConstantFPSDNode>(Zero)->isExactlyValue(0.0)) 131 return false; 132 } else 133 return false; 134 135 // Okay, we have at least one ~0 value, check to see if the rest match or are 136 // undefs. 137 for (++i; i != e; ++i) 138 if (N->getOperand(i) != Zero && 139 N->getOperand(i).getOpcode() != ISD::UNDEF) 140 return false; 141 return true; 142} 143 144/// getSetCCSwappedOperands - Return the operation corresponding to (Y op X) 145/// when given the operation for (X op Y). 146ISD::CondCode ISD::getSetCCSwappedOperands(ISD::CondCode Operation) { 147 // To perform this operation, we just need to swap the L and G bits of the 148 // operation. 149 unsigned OldL = (Operation >> 2) & 1; 150 unsigned OldG = (Operation >> 1) & 1; 151 return ISD::CondCode((Operation & ~6) | // Keep the N, U, E bits 152 (OldL << 1) | // New G bit 153 (OldG << 2)); // New L bit. 154} 155 156/// getSetCCInverse - Return the operation corresponding to !(X op Y), where 157/// 'op' is a valid SetCC operation. 158ISD::CondCode ISD::getSetCCInverse(ISD::CondCode Op, bool isInteger) { 159 unsigned Operation = Op; 160 if (isInteger) 161 Operation ^= 7; // Flip L, G, E bits, but not U. 162 else 163 Operation ^= 15; // Flip all of the condition bits. 164 if (Operation > ISD::SETTRUE2) 165 Operation &= ~8; // Don't let N and U bits get set. 166 return ISD::CondCode(Operation); 167} 168 169 170/// isSignedOp - For an integer comparison, return 1 if the comparison is a 171/// signed operation and 2 if the result is an unsigned comparison. Return zero 172/// if the operation does not depend on the sign of the input (setne and seteq). 173static int isSignedOp(ISD::CondCode Opcode) { 174 switch (Opcode) { 175 default: assert(0 && "Illegal integer setcc operation!"); 176 case ISD::SETEQ: 177 case ISD::SETNE: return 0; 178 case ISD::SETLT: 179 case ISD::SETLE: 180 case ISD::SETGT: 181 case ISD::SETGE: return 1; 182 case ISD::SETULT: 183 case ISD::SETULE: 184 case ISD::SETUGT: 185 case ISD::SETUGE: return 2; 186 } 187} 188 189/// getSetCCOrOperation - Return the result of a logical OR between different 190/// comparisons of identical values: ((X op1 Y) | (X op2 Y)). This function 191/// returns SETCC_INVALID if it is not possible to represent the resultant 192/// comparison. 193ISD::CondCode ISD::getSetCCOrOperation(ISD::CondCode Op1, ISD::CondCode Op2, 194 bool isInteger) { 195 if (isInteger && (isSignedOp(Op1) | isSignedOp(Op2)) == 3) 196 // Cannot fold a signed integer setcc with an unsigned integer setcc. 197 return ISD::SETCC_INVALID; 198 199 unsigned Op = Op1 | Op2; // Combine all of the condition bits. 200 201 // If the N and U bits get set then the resultant comparison DOES suddenly 202 // care about orderedness, and is true when ordered. 203 if (Op > ISD::SETTRUE2) 204 Op &= ~16; // Clear the U bit if the N bit is set. 205 206 // Canonicalize illegal integer setcc's. 207 if (isInteger && Op == ISD::SETUNE) // e.g. SETUGT | SETULT 208 Op = ISD::SETNE; 209 210 return ISD::CondCode(Op); 211} 212 213/// getSetCCAndOperation - Return the result of a logical AND between different 214/// comparisons of identical values: ((X op1 Y) & (X op2 Y)). This 215/// function returns zero if it is not possible to represent the resultant 216/// comparison. 217ISD::CondCode ISD::getSetCCAndOperation(ISD::CondCode Op1, ISD::CondCode Op2, 218 bool isInteger) { 219 if (isInteger && (isSignedOp(Op1) | isSignedOp(Op2)) == 3) 220 // Cannot fold a signed setcc with an unsigned setcc. 221 return ISD::SETCC_INVALID; 222 223 // Combine all of the condition bits. 224 ISD::CondCode Result = ISD::CondCode(Op1 & Op2); 225 226 // Canonicalize illegal integer setcc's. 227 if (isInteger) { 228 switch (Result) { 229 default: break; 230 case ISD::SETUO : Result = ISD::SETFALSE; break; // SETUGT & SETULT 231 case ISD::SETUEQ: Result = ISD::SETEQ ; break; // SETUGE & SETULE 232 case ISD::SETOLT: Result = ISD::SETULT ; break; // SETULT & SETNE 233 case ISD::SETOGT: Result = ISD::SETUGT ; break; // SETUGT & SETNE 234 } 235 } 236 237 return Result; 238} 239 240const TargetMachine &SelectionDAG::getTarget() const { 241 return TLI.getTargetMachine(); 242} 243 244//===----------------------------------------------------------------------===// 245// SDNode Profile Support 246//===----------------------------------------------------------------------===// 247 248/// AddNodeIDOpcode - Add the node opcode to the NodeID data. 249/// 250static void AddNodeIDOpcode(FoldingSetNodeID &ID, unsigned OpC) { 251 ID.AddInteger(OpC); 252} 253 254/// AddNodeIDValueTypes - Value type lists are intern'd so we can represent them 255/// solely with their pointer. 256void AddNodeIDValueTypes(FoldingSetNodeID &ID, SDVTList VTList) { 257 ID.AddPointer(VTList.VTs); 258} 259 260/// AddNodeIDOperands - Various routines for adding operands to the NodeID data. 261/// 262static void AddNodeIDOperands(FoldingSetNodeID &ID, 263 const SDOperand *Ops, unsigned NumOps) { 264 for (; NumOps; --NumOps, ++Ops) { 265 ID.AddPointer(Ops->Val); 266 ID.AddInteger(Ops->ResNo); 267 } 268} 269 270static void AddNodeIDNode(FoldingSetNodeID &ID, 271 unsigned short OpC, SDVTList VTList, 272 const SDOperand *OpList, unsigned N) { 273 AddNodeIDOpcode(ID, OpC); 274 AddNodeIDValueTypes(ID, VTList); 275 AddNodeIDOperands(ID, OpList, N); 276} 277 278/// AddNodeIDNode - Generic routine for adding a nodes info to the NodeID 279/// data. 280static void AddNodeIDNode(FoldingSetNodeID &ID, SDNode *N) { 281 AddNodeIDOpcode(ID, N->getOpcode()); 282 // Add the return value info. 283 AddNodeIDValueTypes(ID, N->getVTList()); 284 // Add the operand info. 285 AddNodeIDOperands(ID, N->op_begin(), N->getNumOperands()); 286 287 // Handle SDNode leafs with special info. 288 if (N->getNumOperands() == 0) { 289 switch (N->getOpcode()) { 290 default: break; // Normal nodes don't need extra info. 291 case ISD::TargetConstant: 292 case ISD::Constant: 293 ID.AddInteger(cast<ConstantSDNode>(N)->getValue()); 294 break; 295 case ISD::TargetConstantFP: 296 case ISD::ConstantFP: 297 ID.AddDouble(cast<ConstantFPSDNode>(N)->getValue()); 298 break; 299 case ISD::TargetGlobalAddress: 300 case ISD::GlobalAddress: { 301 GlobalAddressSDNode *GA = cast<GlobalAddressSDNode>(N); 302 ID.AddPointer(GA->getGlobal()); 303 ID.AddInteger(GA->getOffset()); 304 break; 305 } 306 case ISD::BasicBlock: 307 ID.AddPointer(cast<BasicBlockSDNode>(N)->getBasicBlock()); 308 break; 309 case ISD::Register: 310 ID.AddInteger(cast<RegisterSDNode>(N)->getReg()); 311 break; 312 case ISD::SRCVALUE: { 313 SrcValueSDNode *SV = cast<SrcValueSDNode>(N); 314 ID.AddPointer(SV->getValue()); 315 ID.AddInteger(SV->getOffset()); 316 break; 317 } 318 case ISD::FrameIndex: 319 case ISD::TargetFrameIndex: 320 ID.AddInteger(cast<FrameIndexSDNode>(N)->getIndex()); 321 break; 322 case ISD::JumpTable: 323 case ISD::TargetJumpTable: 324 ID.AddInteger(cast<JumpTableSDNode>(N)->getIndex()); 325 break; 326 case ISD::ConstantPool: 327 case ISD::TargetConstantPool: { 328 ConstantPoolSDNode *CP = cast<ConstantPoolSDNode>(N); 329 ID.AddInteger(CP->getAlignment()); 330 ID.AddInteger(CP->getOffset()); 331 if (CP->isMachineConstantPoolEntry()) 332 CP->getMachineCPVal()->AddSelectionDAGCSEId(ID); 333 else 334 ID.AddPointer(CP->getConstVal()); 335 break; 336 } 337 case ISD::LOAD: { 338 LoadSDNode *LD = cast<LoadSDNode>(N); 339 ID.AddInteger(LD->getAddressingMode()); 340 ID.AddInteger(LD->getExtensionType()); 341 ID.AddInteger(LD->getLoadedVT()); 342 ID.AddPointer(LD->getSrcValue()); 343 ID.AddInteger(LD->getSrcValueOffset()); 344 ID.AddInteger(LD->getAlignment()); 345 ID.AddInteger(LD->isVolatile()); 346 break; 347 } 348 case ISD::STORE: { 349 StoreSDNode *ST = cast<StoreSDNode>(N); 350 ID.AddInteger(ST->getAddressingMode()); 351 ID.AddInteger(ST->isTruncatingStore()); 352 ID.AddInteger(ST->getStoredVT()); 353 ID.AddPointer(ST->getSrcValue()); 354 ID.AddInteger(ST->getSrcValueOffset()); 355 ID.AddInteger(ST->getAlignment()); 356 ID.AddInteger(ST->isVolatile()); 357 break; 358 } 359 } 360 } 361} 362 363//===----------------------------------------------------------------------===// 364// SelectionDAG Class 365//===----------------------------------------------------------------------===// 366 367/// RemoveDeadNodes - This method deletes all unreachable nodes in the 368/// SelectionDAG. 369void SelectionDAG::RemoveDeadNodes() { 370 // Create a dummy node (which is not added to allnodes), that adds a reference 371 // to the root node, preventing it from being deleted. 372 HandleSDNode Dummy(getRoot()); 373 374 SmallVector<SDNode*, 128> DeadNodes; 375 376 // Add all obviously-dead nodes to the DeadNodes worklist. 377 for (allnodes_iterator I = allnodes_begin(), E = allnodes_end(); I != E; ++I) 378 if (I->use_empty()) 379 DeadNodes.push_back(I); 380 381 // Process the worklist, deleting the nodes and adding their uses to the 382 // worklist. 383 while (!DeadNodes.empty()) { 384 SDNode *N = DeadNodes.back(); 385 DeadNodes.pop_back(); 386 387 // Take the node out of the appropriate CSE map. 388 RemoveNodeFromCSEMaps(N); 389 390 // Next, brutally remove the operand list. This is safe to do, as there are 391 // no cycles in the graph. 392 for (SDNode::op_iterator I = N->op_begin(), E = N->op_end(); I != E; ++I) { 393 SDNode *Operand = I->Val; 394 Operand->removeUser(N); 395 396 // Now that we removed this operand, see if there are no uses of it left. 397 if (Operand->use_empty()) 398 DeadNodes.push_back(Operand); 399 } 400 if (N->OperandsNeedDelete) 401 delete[] N->OperandList; 402 N->OperandList = 0; 403 N->NumOperands = 0; 404 405 // Finally, remove N itself. 406 AllNodes.erase(N); 407 } 408 409 // If the root changed (e.g. it was a dead load, update the root). 410 setRoot(Dummy.getValue()); 411} 412 413void SelectionDAG::RemoveDeadNode(SDNode *N, std::vector<SDNode*> &Deleted) { 414 SmallVector<SDNode*, 16> DeadNodes; 415 DeadNodes.push_back(N); 416 417 // Process the worklist, deleting the nodes and adding their uses to the 418 // worklist. 419 while (!DeadNodes.empty()) { 420 SDNode *N = DeadNodes.back(); 421 DeadNodes.pop_back(); 422 423 // Take the node out of the appropriate CSE map. 424 RemoveNodeFromCSEMaps(N); 425 426 // Next, brutally remove the operand list. This is safe to do, as there are 427 // no cycles in the graph. 428 for (SDNode::op_iterator I = N->op_begin(), E = N->op_end(); I != E; ++I) { 429 SDNode *Operand = I->Val; 430 Operand->removeUser(N); 431 432 // Now that we removed this operand, see if there are no uses of it left. 433 if (Operand->use_empty()) 434 DeadNodes.push_back(Operand); 435 } 436 if (N->OperandsNeedDelete) 437 delete[] N->OperandList; 438 N->OperandList = 0; 439 N->NumOperands = 0; 440 441 // Finally, remove N itself. 442 Deleted.push_back(N); 443 AllNodes.erase(N); 444 } 445} 446 447void SelectionDAG::DeleteNode(SDNode *N) { 448 assert(N->use_empty() && "Cannot delete a node that is not dead!"); 449 450 // First take this out of the appropriate CSE map. 451 RemoveNodeFromCSEMaps(N); 452 453 // Finally, remove uses due to operands of this node, remove from the 454 // AllNodes list, and delete the node. 455 DeleteNodeNotInCSEMaps(N); 456} 457 458void SelectionDAG::DeleteNodeNotInCSEMaps(SDNode *N) { 459 460 // Remove it from the AllNodes list. 461 AllNodes.remove(N); 462 463 // Drop all of the operands and decrement used nodes use counts. 464 for (SDNode::op_iterator I = N->op_begin(), E = N->op_end(); I != E; ++I) 465 I->Val->removeUser(N); 466 if (N->OperandsNeedDelete) 467 delete[] N->OperandList; 468 N->OperandList = 0; 469 N->NumOperands = 0; 470 471 delete N; 472} 473 474/// RemoveNodeFromCSEMaps - Take the specified node out of the CSE map that 475/// correspond to it. This is useful when we're about to delete or repurpose 476/// the node. We don't want future request for structurally identical nodes 477/// to return N anymore. 478void SelectionDAG::RemoveNodeFromCSEMaps(SDNode *N) { 479 bool Erased = false; 480 switch (N->getOpcode()) { 481 case ISD::HANDLENODE: return; // noop. 482 case ISD::STRING: 483 Erased = StringNodes.erase(cast<StringSDNode>(N)->getValue()); 484 break; 485 case ISD::CONDCODE: 486 assert(CondCodeNodes[cast<CondCodeSDNode>(N)->get()] && 487 "Cond code doesn't exist!"); 488 Erased = CondCodeNodes[cast<CondCodeSDNode>(N)->get()] != 0; 489 CondCodeNodes[cast<CondCodeSDNode>(N)->get()] = 0; 490 break; 491 case ISD::ExternalSymbol: 492 Erased = ExternalSymbols.erase(cast<ExternalSymbolSDNode>(N)->getSymbol()); 493 break; 494 case ISD::TargetExternalSymbol: 495 Erased = 496 TargetExternalSymbols.erase(cast<ExternalSymbolSDNode>(N)->getSymbol()); 497 break; 498 case ISD::VALUETYPE: 499 Erased = ValueTypeNodes[cast<VTSDNode>(N)->getVT()] != 0; 500 ValueTypeNodes[cast<VTSDNode>(N)->getVT()] = 0; 501 break; 502 default: 503 // Remove it from the CSE Map. 504 Erased = CSEMap.RemoveNode(N); 505 break; 506 } 507#ifndef NDEBUG 508 // Verify that the node was actually in one of the CSE maps, unless it has a 509 // flag result (which cannot be CSE'd) or is one of the special cases that are 510 // not subject to CSE. 511 if (!Erased && N->getValueType(N->getNumValues()-1) != MVT::Flag && 512 !N->isTargetOpcode()) { 513 N->dump(); 514 cerr << "\n"; 515 assert(0 && "Node is not in map!"); 516 } 517#endif 518} 519 520/// AddNonLeafNodeToCSEMaps - Add the specified node back to the CSE maps. It 521/// has been taken out and modified in some way. If the specified node already 522/// exists in the CSE maps, do not modify the maps, but return the existing node 523/// instead. If it doesn't exist, add it and return null. 524/// 525SDNode *SelectionDAG::AddNonLeafNodeToCSEMaps(SDNode *N) { 526 assert(N->getNumOperands() && "This is a leaf node!"); 527 if (N->getOpcode() == ISD::HANDLENODE || N->getValueType(0) == MVT::Flag) 528 return 0; // Never add these nodes. 529 530 // Check that remaining values produced are not flags. 531 for (unsigned i = 1, e = N->getNumValues(); i != e; ++i) 532 if (N->getValueType(i) == MVT::Flag) 533 return 0; // Never CSE anything that produces a flag. 534 535 SDNode *New = CSEMap.GetOrInsertNode(N); 536 if (New != N) return New; // Node already existed. 537 return 0; 538} 539 540/// FindModifiedNodeSlot - Find a slot for the specified node if its operands 541/// were replaced with those specified. If this node is never memoized, 542/// return null, otherwise return a pointer to the slot it would take. If a 543/// node already exists with these operands, the slot will be non-null. 544SDNode *SelectionDAG::FindModifiedNodeSlot(SDNode *N, SDOperand Op, 545 void *&InsertPos) { 546 if (N->getOpcode() == ISD::HANDLENODE || N->getValueType(0) == MVT::Flag) 547 return 0; // Never add these nodes. 548 549 // Check that remaining values produced are not flags. 550 for (unsigned i = 1, e = N->getNumValues(); i != e; ++i) 551 if (N->getValueType(i) == MVT::Flag) 552 return 0; // Never CSE anything that produces a flag. 553 554 SDOperand Ops[] = { Op }; 555 FoldingSetNodeID ID; 556 AddNodeIDNode(ID, N->getOpcode(), N->getVTList(), Ops, 1); 557 return CSEMap.FindNodeOrInsertPos(ID, InsertPos); 558} 559 560/// FindModifiedNodeSlot - Find a slot for the specified node if its operands 561/// were replaced with those specified. If this node is never memoized, 562/// return null, otherwise return a pointer to the slot it would take. If a 563/// node already exists with these operands, the slot will be non-null. 564SDNode *SelectionDAG::FindModifiedNodeSlot(SDNode *N, 565 SDOperand Op1, SDOperand Op2, 566 void *&InsertPos) { 567 if (N->getOpcode() == ISD::HANDLENODE || N->getValueType(0) == MVT::Flag) 568 return 0; // Never add these nodes. 569 570 // Check that remaining values produced are not flags. 571 for (unsigned i = 1, e = N->getNumValues(); i != e; ++i) 572 if (N->getValueType(i) == MVT::Flag) 573 return 0; // Never CSE anything that produces a flag. 574 575 SDOperand Ops[] = { Op1, Op2 }; 576 FoldingSetNodeID ID; 577 AddNodeIDNode(ID, N->getOpcode(), N->getVTList(), Ops, 2); 578 return CSEMap.FindNodeOrInsertPos(ID, InsertPos); 579} 580 581 582/// FindModifiedNodeSlot - Find a slot for the specified node if its operands 583/// were replaced with those specified. If this node is never memoized, 584/// return null, otherwise return a pointer to the slot it would take. If a 585/// node already exists with these operands, the slot will be non-null. 586SDNode *SelectionDAG::FindModifiedNodeSlot(SDNode *N, 587 const SDOperand *Ops,unsigned NumOps, 588 void *&InsertPos) { 589 if (N->getOpcode() == ISD::HANDLENODE || N->getValueType(0) == MVT::Flag) 590 return 0; // Never add these nodes. 591 592 // Check that remaining values produced are not flags. 593 for (unsigned i = 1, e = N->getNumValues(); i != e; ++i) 594 if (N->getValueType(i) == MVT::Flag) 595 return 0; // Never CSE anything that produces a flag. 596 597 FoldingSetNodeID ID; 598 AddNodeIDNode(ID, N->getOpcode(), N->getVTList(), 0, 0); 599 600 if (const LoadSDNode *LD = dyn_cast<LoadSDNode>(N)) { 601 ID.AddInteger(LD->getAddressingMode()); 602 ID.AddInteger(LD->getExtensionType()); 603 ID.AddInteger(LD->getLoadedVT()); 604 ID.AddPointer(LD->getSrcValue()); 605 ID.AddInteger(LD->getSrcValueOffset()); 606 ID.AddInteger(LD->getAlignment()); 607 ID.AddInteger(LD->isVolatile()); 608 } else if (const StoreSDNode *ST = dyn_cast<StoreSDNode>(N)) { 609 ID.AddInteger(ST->getAddressingMode()); 610 ID.AddInteger(ST->isTruncatingStore()); 611 ID.AddInteger(ST->getStoredVT()); 612 ID.AddPointer(ST->getSrcValue()); 613 ID.AddInteger(ST->getSrcValueOffset()); 614 ID.AddInteger(ST->getAlignment()); 615 ID.AddInteger(ST->isVolatile()); 616 } 617 618 AddNodeIDOperands(ID, Ops, NumOps); 619 return CSEMap.FindNodeOrInsertPos(ID, InsertPos); 620} 621 622 623SelectionDAG::~SelectionDAG() { 624 while (!AllNodes.empty()) { 625 SDNode *N = AllNodes.begin(); 626 N->SetNextInBucket(0); 627 if (N->OperandsNeedDelete) 628 delete [] N->OperandList; 629 N->OperandList = 0; 630 N->NumOperands = 0; 631 AllNodes.pop_front(); 632 } 633} 634 635SDOperand SelectionDAG::getZeroExtendInReg(SDOperand Op, MVT::ValueType VT) { 636 if (Op.getValueType() == VT) return Op; 637 int64_t Imm = ~0ULL >> (64-MVT::getSizeInBits(VT)); 638 return getNode(ISD::AND, Op.getValueType(), Op, 639 getConstant(Imm, Op.getValueType())); 640} 641 642SDOperand SelectionDAG::getString(const std::string &Val) { 643 StringSDNode *&N = StringNodes[Val]; 644 if (!N) { 645 N = new StringSDNode(Val); 646 AllNodes.push_back(N); 647 } 648 return SDOperand(N, 0); 649} 650 651SDOperand SelectionDAG::getConstant(uint64_t Val, MVT::ValueType VT, bool isT) { 652 assert(MVT::isInteger(VT) && "Cannot create FP integer constant!"); 653 assert(!MVT::isVector(VT) && "Cannot create Vector ConstantSDNodes!"); 654 655 // Mask out any bits that are not valid for this constant. 656 Val &= MVT::getIntVTBitMask(VT); 657 658 unsigned Opc = isT ? ISD::TargetConstant : ISD::Constant; 659 FoldingSetNodeID ID; 660 AddNodeIDNode(ID, Opc, getVTList(VT), 0, 0); 661 ID.AddInteger(Val); 662 void *IP = 0; 663 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP)) 664 return SDOperand(E, 0); 665 SDNode *N = new ConstantSDNode(isT, Val, VT); 666 CSEMap.InsertNode(N, IP); 667 AllNodes.push_back(N); 668 return SDOperand(N, 0); 669} 670 671 672SDOperand SelectionDAG::getConstantFP(double Val, MVT::ValueType VT, 673 bool isTarget) { 674 assert(MVT::isFloatingPoint(VT) && "Cannot create integer FP constant!"); 675 if (VT == MVT::f32) 676 Val = (float)Val; // Mask out extra precision. 677 678 // Do the map lookup using the actual bit pattern for the floating point 679 // value, so that we don't have problems with 0.0 comparing equal to -0.0, and 680 // we don't have issues with SNANs. 681 unsigned Opc = isTarget ? ISD::TargetConstantFP : ISD::ConstantFP; 682 FoldingSetNodeID ID; 683 AddNodeIDNode(ID, Opc, getVTList(VT), 0, 0); 684 ID.AddDouble(Val); 685 void *IP = 0; 686 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP)) 687 return SDOperand(E, 0); 688 SDNode *N = new ConstantFPSDNode(isTarget, Val, VT); 689 CSEMap.InsertNode(N, IP); 690 AllNodes.push_back(N); 691 return SDOperand(N, 0); 692} 693 694SDOperand SelectionDAG::getGlobalAddress(const GlobalValue *GV, 695 MVT::ValueType VT, int Offset, 696 bool isTargetGA) { 697 unsigned Opc = isTargetGA ? ISD::TargetGlobalAddress : ISD::GlobalAddress; 698 FoldingSetNodeID ID; 699 AddNodeIDNode(ID, Opc, getVTList(VT), 0, 0); 700 ID.AddPointer(GV); 701 ID.AddInteger(Offset); 702 void *IP = 0; 703 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP)) 704 return SDOperand(E, 0); 705 SDNode *N = new GlobalAddressSDNode(isTargetGA, GV, VT, Offset); 706 CSEMap.InsertNode(N, IP); 707 AllNodes.push_back(N); 708 return SDOperand(N, 0); 709} 710 711SDOperand SelectionDAG::getFrameIndex(int FI, MVT::ValueType VT, 712 bool isTarget) { 713 unsigned Opc = isTarget ? ISD::TargetFrameIndex : ISD::FrameIndex; 714 FoldingSetNodeID ID; 715 AddNodeIDNode(ID, Opc, getVTList(VT), 0, 0); 716 ID.AddInteger(FI); 717 void *IP = 0; 718 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP)) 719 return SDOperand(E, 0); 720 SDNode *N = new FrameIndexSDNode(FI, VT, isTarget); 721 CSEMap.InsertNode(N, IP); 722 AllNodes.push_back(N); 723 return SDOperand(N, 0); 724} 725 726SDOperand SelectionDAG::getJumpTable(int JTI, MVT::ValueType VT, bool isTarget){ 727 unsigned Opc = isTarget ? ISD::TargetJumpTable : ISD::JumpTable; 728 FoldingSetNodeID ID; 729 AddNodeIDNode(ID, Opc, getVTList(VT), 0, 0); 730 ID.AddInteger(JTI); 731 void *IP = 0; 732 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP)) 733 return SDOperand(E, 0); 734 SDNode *N = new JumpTableSDNode(JTI, VT, isTarget); 735 CSEMap.InsertNode(N, IP); 736 AllNodes.push_back(N); 737 return SDOperand(N, 0); 738} 739 740SDOperand SelectionDAG::getConstantPool(Constant *C, MVT::ValueType VT, 741 unsigned Alignment, int Offset, 742 bool isTarget) { 743 unsigned Opc = isTarget ? ISD::TargetConstantPool : ISD::ConstantPool; 744 FoldingSetNodeID ID; 745 AddNodeIDNode(ID, Opc, getVTList(VT), 0, 0); 746 ID.AddInteger(Alignment); 747 ID.AddInteger(Offset); 748 ID.AddPointer(C); 749 void *IP = 0; 750 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP)) 751 return SDOperand(E, 0); 752 SDNode *N = new ConstantPoolSDNode(isTarget, C, VT, Offset, Alignment); 753 CSEMap.InsertNode(N, IP); 754 AllNodes.push_back(N); 755 return SDOperand(N, 0); 756} 757 758 759SDOperand SelectionDAG::getConstantPool(MachineConstantPoolValue *C, 760 MVT::ValueType VT, 761 unsigned Alignment, int Offset, 762 bool isTarget) { 763 unsigned Opc = isTarget ? ISD::TargetConstantPool : ISD::ConstantPool; 764 FoldingSetNodeID ID; 765 AddNodeIDNode(ID, Opc, getVTList(VT), 0, 0); 766 ID.AddInteger(Alignment); 767 ID.AddInteger(Offset); 768 C->AddSelectionDAGCSEId(ID); 769 void *IP = 0; 770 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP)) 771 return SDOperand(E, 0); 772 SDNode *N = new ConstantPoolSDNode(isTarget, C, VT, Offset, Alignment); 773 CSEMap.InsertNode(N, IP); 774 AllNodes.push_back(N); 775 return SDOperand(N, 0); 776} 777 778 779SDOperand SelectionDAG::getBasicBlock(MachineBasicBlock *MBB) { 780 FoldingSetNodeID ID; 781 AddNodeIDNode(ID, ISD::BasicBlock, getVTList(MVT::Other), 0, 0); 782 ID.AddPointer(MBB); 783 void *IP = 0; 784 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP)) 785 return SDOperand(E, 0); 786 SDNode *N = new BasicBlockSDNode(MBB); 787 CSEMap.InsertNode(N, IP); 788 AllNodes.push_back(N); 789 return SDOperand(N, 0); 790} 791 792SDOperand SelectionDAG::getValueType(MVT::ValueType VT) { 793 if ((unsigned)VT >= ValueTypeNodes.size()) 794 ValueTypeNodes.resize(VT+1); 795 if (ValueTypeNodes[VT] == 0) { 796 ValueTypeNodes[VT] = new VTSDNode(VT); 797 AllNodes.push_back(ValueTypeNodes[VT]); 798 } 799 800 return SDOperand(ValueTypeNodes[VT], 0); 801} 802 803SDOperand SelectionDAG::getExternalSymbol(const char *Sym, MVT::ValueType VT) { 804 SDNode *&N = ExternalSymbols[Sym]; 805 if (N) return SDOperand(N, 0); 806 N = new ExternalSymbolSDNode(false, Sym, VT); 807 AllNodes.push_back(N); 808 return SDOperand(N, 0); 809} 810 811SDOperand SelectionDAG::getTargetExternalSymbol(const char *Sym, 812 MVT::ValueType VT) { 813 SDNode *&N = TargetExternalSymbols[Sym]; 814 if (N) return SDOperand(N, 0); 815 N = new ExternalSymbolSDNode(true, Sym, VT); 816 AllNodes.push_back(N); 817 return SDOperand(N, 0); 818} 819 820SDOperand SelectionDAG::getCondCode(ISD::CondCode Cond) { 821 if ((unsigned)Cond >= CondCodeNodes.size()) 822 CondCodeNodes.resize(Cond+1); 823 824 if (CondCodeNodes[Cond] == 0) { 825 CondCodeNodes[Cond] = new CondCodeSDNode(Cond); 826 AllNodes.push_back(CondCodeNodes[Cond]); 827 } 828 return SDOperand(CondCodeNodes[Cond], 0); 829} 830 831SDOperand SelectionDAG::getRegister(unsigned RegNo, MVT::ValueType VT) { 832 FoldingSetNodeID ID; 833 AddNodeIDNode(ID, ISD::Register, getVTList(VT), 0, 0); 834 ID.AddInteger(RegNo); 835 void *IP = 0; 836 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP)) 837 return SDOperand(E, 0); 838 SDNode *N = new RegisterSDNode(RegNo, VT); 839 CSEMap.InsertNode(N, IP); 840 AllNodes.push_back(N); 841 return SDOperand(N, 0); 842} 843 844SDOperand SelectionDAG::getSrcValue(const Value *V, int Offset) { 845 assert((!V || isa<PointerType>(V->getType())) && 846 "SrcValue is not a pointer?"); 847 848 FoldingSetNodeID ID; 849 AddNodeIDNode(ID, ISD::SRCVALUE, getVTList(MVT::Other), 0, 0); 850 ID.AddPointer(V); 851 ID.AddInteger(Offset); 852 void *IP = 0; 853 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP)) 854 return SDOperand(E, 0); 855 SDNode *N = new SrcValueSDNode(V, Offset); 856 CSEMap.InsertNode(N, IP); 857 AllNodes.push_back(N); 858 return SDOperand(N, 0); 859} 860 861SDOperand SelectionDAG::FoldSetCC(MVT::ValueType VT, SDOperand N1, 862 SDOperand N2, ISD::CondCode Cond) { 863 // These setcc operations always fold. 864 switch (Cond) { 865 default: break; 866 case ISD::SETFALSE: 867 case ISD::SETFALSE2: return getConstant(0, VT); 868 case ISD::SETTRUE: 869 case ISD::SETTRUE2: return getConstant(1, VT); 870 871 case ISD::SETOEQ: 872 case ISD::SETOGT: 873 case ISD::SETOGE: 874 case ISD::SETOLT: 875 case ISD::SETOLE: 876 case ISD::SETONE: 877 case ISD::SETO: 878 case ISD::SETUO: 879 case ISD::SETUEQ: 880 case ISD::SETUNE: 881 assert(!MVT::isInteger(N1.getValueType()) && "Illegal setcc for integer!"); 882 break; 883 } 884 885 if (ConstantSDNode *N2C = dyn_cast<ConstantSDNode>(N2.Val)) { 886 uint64_t C2 = N2C->getValue(); 887 if (ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1.Val)) { 888 uint64_t C1 = N1C->getValue(); 889 890 // Sign extend the operands if required 891 if (ISD::isSignedIntSetCC(Cond)) { 892 C1 = N1C->getSignExtended(); 893 C2 = N2C->getSignExtended(); 894 } 895 896 switch (Cond) { 897 default: assert(0 && "Unknown integer setcc!"); 898 case ISD::SETEQ: return getConstant(C1 == C2, VT); 899 case ISD::SETNE: return getConstant(C1 != C2, VT); 900 case ISD::SETULT: return getConstant(C1 < C2, VT); 901 case ISD::SETUGT: return getConstant(C1 > C2, VT); 902 case ISD::SETULE: return getConstant(C1 <= C2, VT); 903 case ISD::SETUGE: return getConstant(C1 >= C2, VT); 904 case ISD::SETLT: return getConstant((int64_t)C1 < (int64_t)C2, VT); 905 case ISD::SETGT: return getConstant((int64_t)C1 > (int64_t)C2, VT); 906 case ISD::SETLE: return getConstant((int64_t)C1 <= (int64_t)C2, VT); 907 case ISD::SETGE: return getConstant((int64_t)C1 >= (int64_t)C2, VT); 908 } 909 } 910 } 911 if (ConstantFPSDNode *N1C = dyn_cast<ConstantFPSDNode>(N1.Val)) 912 if (ConstantFPSDNode *N2C = dyn_cast<ConstantFPSDNode>(N2.Val)) { 913 double C1 = N1C->getValue(), C2 = N2C->getValue(); 914 915 switch (Cond) { 916 default: break; // FIXME: Implement the rest of these! 917 case ISD::SETEQ: return getConstant(C1 == C2, VT); 918 case ISD::SETNE: return getConstant(C1 != C2, VT); 919 case ISD::SETLT: return getConstant(C1 < C2, VT); 920 case ISD::SETGT: return getConstant(C1 > C2, VT); 921 case ISD::SETLE: return getConstant(C1 <= C2, VT); 922 case ISD::SETGE: return getConstant(C1 >= C2, VT); 923 } 924 } else { 925 // Ensure that the constant occurs on the RHS. 926 return getSetCC(VT, N2, N1, ISD::getSetCCSwappedOperands(Cond)); 927 } 928 929 // Could not fold it. 930 return SDOperand(); 931} 932 933 934/// getNode - Gets or creates the specified node. 935/// 936SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT) { 937 FoldingSetNodeID ID; 938 AddNodeIDNode(ID, Opcode, getVTList(VT), 0, 0); 939 void *IP = 0; 940 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP)) 941 return SDOperand(E, 0); 942 SDNode *N = new SDNode(Opcode, SDNode::getSDVTList(VT)); 943 CSEMap.InsertNode(N, IP); 944 945 AllNodes.push_back(N); 946 return SDOperand(N, 0); 947} 948 949SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT, 950 SDOperand Operand) { 951 unsigned Tmp1; 952 // Constant fold unary operations with an integer constant operand. 953 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Operand.Val)) { 954 uint64_t Val = C->getValue(); 955 switch (Opcode) { 956 default: break; 957 case ISD::SIGN_EXTEND: return getConstant(C->getSignExtended(), VT); 958 case ISD::ANY_EXTEND: 959 case ISD::ZERO_EXTEND: return getConstant(Val, VT); 960 case ISD::TRUNCATE: return getConstant(Val, VT); 961 case ISD::SINT_TO_FP: return getConstantFP(C->getSignExtended(), VT); 962 case ISD::UINT_TO_FP: return getConstantFP(C->getValue(), VT); 963 case ISD::BIT_CONVERT: 964 if (VT == MVT::f32 && C->getValueType(0) == MVT::i32) 965 return getConstantFP(BitsToFloat(Val), VT); 966 else if (VT == MVT::f64 && C->getValueType(0) == MVT::i64) 967 return getConstantFP(BitsToDouble(Val), VT); 968 break; 969 case ISD::BSWAP: 970 switch(VT) { 971 default: assert(0 && "Invalid bswap!"); break; 972 case MVT::i16: return getConstant(ByteSwap_16((unsigned short)Val), VT); 973 case MVT::i32: return getConstant(ByteSwap_32((unsigned)Val), VT); 974 case MVT::i64: return getConstant(ByteSwap_64(Val), VT); 975 } 976 break; 977 case ISD::CTPOP: 978 switch(VT) { 979 default: assert(0 && "Invalid ctpop!"); break; 980 case MVT::i1: return getConstant(Val != 0, VT); 981 case MVT::i8: 982 Tmp1 = (unsigned)Val & 0xFF; 983 return getConstant(CountPopulation_32(Tmp1), VT); 984 case MVT::i16: 985 Tmp1 = (unsigned)Val & 0xFFFF; 986 return getConstant(CountPopulation_32(Tmp1), VT); 987 case MVT::i32: 988 return getConstant(CountPopulation_32((unsigned)Val), VT); 989 case MVT::i64: 990 return getConstant(CountPopulation_64(Val), VT); 991 } 992 case ISD::CTLZ: 993 switch(VT) { 994 default: assert(0 && "Invalid ctlz!"); break; 995 case MVT::i1: return getConstant(Val == 0, VT); 996 case MVT::i8: 997 Tmp1 = (unsigned)Val & 0xFF; 998 return getConstant(CountLeadingZeros_32(Tmp1)-24, VT); 999 case MVT::i16: 1000 Tmp1 = (unsigned)Val & 0xFFFF; 1001 return getConstant(CountLeadingZeros_32(Tmp1)-16, VT); 1002 case MVT::i32: 1003 return getConstant(CountLeadingZeros_32((unsigned)Val), VT); 1004 case MVT::i64: 1005 return getConstant(CountLeadingZeros_64(Val), VT); 1006 } 1007 case ISD::CTTZ: 1008 switch(VT) { 1009 default: assert(0 && "Invalid cttz!"); break; 1010 case MVT::i1: return getConstant(Val == 0, VT); 1011 case MVT::i8: 1012 Tmp1 = (unsigned)Val | 0x100; 1013 return getConstant(CountTrailingZeros_32(Tmp1), VT); 1014 case MVT::i16: 1015 Tmp1 = (unsigned)Val | 0x10000; 1016 return getConstant(CountTrailingZeros_32(Tmp1), VT); 1017 case MVT::i32: 1018 return getConstant(CountTrailingZeros_32((unsigned)Val), VT); 1019 case MVT::i64: 1020 return getConstant(CountTrailingZeros_64(Val), VT); 1021 } 1022 } 1023 } 1024 1025 // Constant fold unary operations with an floating point constant operand. 1026 if (ConstantFPSDNode *C = dyn_cast<ConstantFPSDNode>(Operand.Val)) 1027 switch (Opcode) { 1028 case ISD::FNEG: 1029 return getConstantFP(-C->getValue(), VT); 1030 case ISD::FABS: 1031 return getConstantFP(fabs(C->getValue()), VT); 1032 case ISD::FP_ROUND: 1033 case ISD::FP_EXTEND: 1034 return getConstantFP(C->getValue(), VT); 1035 case ISD::FP_TO_SINT: 1036 return getConstant((int64_t)C->getValue(), VT); 1037 case ISD::FP_TO_UINT: 1038 return getConstant((uint64_t)C->getValue(), VT); 1039 case ISD::BIT_CONVERT: 1040 if (VT == MVT::i32 && C->getValueType(0) == MVT::f32) 1041 return getConstant(FloatToBits(C->getValue()), VT); 1042 else if (VT == MVT::i64 && C->getValueType(0) == MVT::f64) 1043 return getConstant(DoubleToBits(C->getValue()), VT); 1044 break; 1045 } 1046 1047 unsigned OpOpcode = Operand.Val->getOpcode(); 1048 switch (Opcode) { 1049 case ISD::TokenFactor: 1050 return Operand; // Factor of one node? No factor. 1051 case ISD::SIGN_EXTEND: 1052 if (Operand.getValueType() == VT) return Operand; // noop extension 1053 assert(Operand.getValueType() < VT && "Invalid sext node, dst < src!"); 1054 if (OpOpcode == ISD::SIGN_EXTEND || OpOpcode == ISD::ZERO_EXTEND) 1055 return getNode(OpOpcode, VT, Operand.Val->getOperand(0)); 1056 break; 1057 case ISD::ZERO_EXTEND: 1058 if (Operand.getValueType() == VT) return Operand; // noop extension 1059 assert(Operand.getValueType() < VT && "Invalid zext node, dst < src!"); 1060 if (OpOpcode == ISD::ZERO_EXTEND) // (zext (zext x)) -> (zext x) 1061 return getNode(ISD::ZERO_EXTEND, VT, Operand.Val->getOperand(0)); 1062 break; 1063 case ISD::ANY_EXTEND: 1064 if (Operand.getValueType() == VT) return Operand; // noop extension 1065 assert(Operand.getValueType() < VT && "Invalid anyext node, dst < src!"); 1066 if (OpOpcode == ISD::ZERO_EXTEND || OpOpcode == ISD::SIGN_EXTEND) 1067 // (ext (zext x)) -> (zext x) and (ext (sext x)) -> (sext x) 1068 return getNode(OpOpcode, VT, Operand.Val->getOperand(0)); 1069 break; 1070 case ISD::TRUNCATE: 1071 if (Operand.getValueType() == VT) return Operand; // noop truncate 1072 assert(Operand.getValueType() > VT && "Invalid truncate node, src < dst!"); 1073 if (OpOpcode == ISD::TRUNCATE) 1074 return getNode(ISD::TRUNCATE, VT, Operand.Val->getOperand(0)); 1075 else if (OpOpcode == ISD::ZERO_EXTEND || OpOpcode == ISD::SIGN_EXTEND || 1076 OpOpcode == ISD::ANY_EXTEND) { 1077 // If the source is smaller than the dest, we still need an extend. 1078 if (Operand.Val->getOperand(0).getValueType() < VT) 1079 return getNode(OpOpcode, VT, Operand.Val->getOperand(0)); 1080 else if (Operand.Val->getOperand(0).getValueType() > VT) 1081 return getNode(ISD::TRUNCATE, VT, Operand.Val->getOperand(0)); 1082 else 1083 return Operand.Val->getOperand(0); 1084 } 1085 break; 1086 case ISD::BIT_CONVERT: 1087 // Basic sanity checking. 1088 assert(MVT::getSizeInBits(VT) == MVT::getSizeInBits(Operand.getValueType()) 1089 && "Cannot BIT_CONVERT between types of different sizes!"); 1090 if (VT == Operand.getValueType()) return Operand; // noop conversion. 1091 if (OpOpcode == ISD::BIT_CONVERT) // bitconv(bitconv(x)) -> bitconv(x) 1092 return getNode(ISD::BIT_CONVERT, VT, Operand.getOperand(0)); 1093 if (OpOpcode == ISD::UNDEF) 1094 return getNode(ISD::UNDEF, VT); 1095 break; 1096 case ISD::SCALAR_TO_VECTOR: 1097 assert(MVT::isVector(VT) && !MVT::isVector(Operand.getValueType()) && 1098 MVT::getVectorBaseType(VT) == Operand.getValueType() && 1099 "Illegal SCALAR_TO_VECTOR node!"); 1100 break; 1101 case ISD::FNEG: 1102 if (OpOpcode == ISD::FSUB) // -(X-Y) -> (Y-X) 1103 return getNode(ISD::FSUB, VT, Operand.Val->getOperand(1), 1104 Operand.Val->getOperand(0)); 1105 if (OpOpcode == ISD::FNEG) // --X -> X 1106 return Operand.Val->getOperand(0); 1107 break; 1108 case ISD::FABS: 1109 if (OpOpcode == ISD::FNEG) // abs(-X) -> abs(X) 1110 return getNode(ISD::FABS, VT, Operand.Val->getOperand(0)); 1111 break; 1112 } 1113 1114 SDNode *N; 1115 SDVTList VTs = getVTList(VT); 1116 if (VT != MVT::Flag) { // Don't CSE flag producing nodes 1117 FoldingSetNodeID ID; 1118 SDOperand Ops[1] = { Operand }; 1119 AddNodeIDNode(ID, Opcode, VTs, Ops, 1); 1120 void *IP = 0; 1121 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP)) 1122 return SDOperand(E, 0); 1123 N = new UnarySDNode(Opcode, VTs, Operand); 1124 CSEMap.InsertNode(N, IP); 1125 } else { 1126 N = new UnarySDNode(Opcode, VTs, Operand); 1127 } 1128 AllNodes.push_back(N); 1129 return SDOperand(N, 0); 1130} 1131 1132 1133 1134SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT, 1135 SDOperand N1, SDOperand N2) { 1136#ifndef NDEBUG 1137 switch (Opcode) { 1138 case ISD::TokenFactor: 1139 assert(VT == MVT::Other && N1.getValueType() == MVT::Other && 1140 N2.getValueType() == MVT::Other && "Invalid token factor!"); 1141 break; 1142 case ISD::AND: 1143 case ISD::OR: 1144 case ISD::XOR: 1145 case ISD::UDIV: 1146 case ISD::UREM: 1147 case ISD::MULHU: 1148 case ISD::MULHS: 1149 assert(MVT::isInteger(VT) && "This operator does not apply to FP types!"); 1150 // fall through 1151 case ISD::ADD: 1152 case ISD::SUB: 1153 case ISD::MUL: 1154 case ISD::SDIV: 1155 case ISD::SREM: 1156 assert(MVT::isInteger(N1.getValueType()) && "Should use F* for FP ops"); 1157 // fall through. 1158 case ISD::FADD: 1159 case ISD::FSUB: 1160 case ISD::FMUL: 1161 case ISD::FDIV: 1162 case ISD::FREM: 1163 assert(N1.getValueType() == N2.getValueType() && 1164 N1.getValueType() == VT && "Binary operator types must match!"); 1165 break; 1166 case ISD::FCOPYSIGN: // N1 and result must match. N1/N2 need not match. 1167 assert(N1.getValueType() == VT && 1168 MVT::isFloatingPoint(N1.getValueType()) && 1169 MVT::isFloatingPoint(N2.getValueType()) && 1170 "Invalid FCOPYSIGN!"); 1171 break; 1172 case ISD::SHL: 1173 case ISD::SRA: 1174 case ISD::SRL: 1175 case ISD::ROTL: 1176 case ISD::ROTR: 1177 assert(VT == N1.getValueType() && 1178 "Shift operators return type must be the same as their first arg"); 1179 assert(MVT::isInteger(VT) && MVT::isInteger(N2.getValueType()) && 1180 VT != MVT::i1 && "Shifts only work on integers"); 1181 break; 1182 case ISD::FP_ROUND_INREG: { 1183 MVT::ValueType EVT = cast<VTSDNode>(N2)->getVT(); 1184 assert(VT == N1.getValueType() && "Not an inreg round!"); 1185 assert(MVT::isFloatingPoint(VT) && MVT::isFloatingPoint(EVT) && 1186 "Cannot FP_ROUND_INREG integer types"); 1187 assert(EVT <= VT && "Not rounding down!"); 1188 break; 1189 } 1190 case ISD::AssertSext: 1191 case ISD::AssertZext: 1192 case ISD::SIGN_EXTEND_INREG: { 1193 MVT::ValueType EVT = cast<VTSDNode>(N2)->getVT(); 1194 assert(VT == N1.getValueType() && "Not an inreg extend!"); 1195 assert(MVT::isInteger(VT) && MVT::isInteger(EVT) && 1196 "Cannot *_EXTEND_INREG FP types"); 1197 assert(EVT <= VT && "Not extending!"); 1198 } 1199 1200 default: break; 1201 } 1202#endif 1203 1204 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1.Val); 1205 ConstantSDNode *N2C = dyn_cast<ConstantSDNode>(N2.Val); 1206 if (N1C) { 1207 if (Opcode == ISD::SIGN_EXTEND_INREG) { 1208 int64_t Val = N1C->getValue(); 1209 unsigned FromBits = MVT::getSizeInBits(cast<VTSDNode>(N2)->getVT()); 1210 Val <<= 64-FromBits; 1211 Val >>= 64-FromBits; 1212 return getConstant(Val, VT); 1213 } 1214 1215 if (N2C) { 1216 uint64_t C1 = N1C->getValue(), C2 = N2C->getValue(); 1217 switch (Opcode) { 1218 case ISD::ADD: return getConstant(C1 + C2, VT); 1219 case ISD::SUB: return getConstant(C1 - C2, VT); 1220 case ISD::MUL: return getConstant(C1 * C2, VT); 1221 case ISD::UDIV: 1222 if (C2) return getConstant(C1 / C2, VT); 1223 break; 1224 case ISD::UREM : 1225 if (C2) return getConstant(C1 % C2, VT); 1226 break; 1227 case ISD::SDIV : 1228 if (C2) return getConstant(N1C->getSignExtended() / 1229 N2C->getSignExtended(), VT); 1230 break; 1231 case ISD::SREM : 1232 if (C2) return getConstant(N1C->getSignExtended() % 1233 N2C->getSignExtended(), VT); 1234 break; 1235 case ISD::AND : return getConstant(C1 & C2, VT); 1236 case ISD::OR : return getConstant(C1 | C2, VT); 1237 case ISD::XOR : return getConstant(C1 ^ C2, VT); 1238 case ISD::SHL : return getConstant(C1 << C2, VT); 1239 case ISD::SRL : return getConstant(C1 >> C2, VT); 1240 case ISD::SRA : return getConstant(N1C->getSignExtended() >>(int)C2, VT); 1241 case ISD::ROTL : 1242 return getConstant((C1 << C2) | (C1 >> (MVT::getSizeInBits(VT) - C2)), 1243 VT); 1244 case ISD::ROTR : 1245 return getConstant((C1 >> C2) | (C1 << (MVT::getSizeInBits(VT) - C2)), 1246 VT); 1247 default: break; 1248 } 1249 } else { // Cannonicalize constant to RHS if commutative 1250 if (isCommutativeBinOp(Opcode)) { 1251 std::swap(N1C, N2C); 1252 std::swap(N1, N2); 1253 } 1254 } 1255 } 1256 1257 ConstantFPSDNode *N1CFP = dyn_cast<ConstantFPSDNode>(N1.Val); 1258 ConstantFPSDNode *N2CFP = dyn_cast<ConstantFPSDNode>(N2.Val); 1259 if (N1CFP) { 1260 if (N2CFP) { 1261 double C1 = N1CFP->getValue(), C2 = N2CFP->getValue(); 1262 switch (Opcode) { 1263 case ISD::FADD: return getConstantFP(C1 + C2, VT); 1264 case ISD::FSUB: return getConstantFP(C1 - C2, VT); 1265 case ISD::FMUL: return getConstantFP(C1 * C2, VT); 1266 case ISD::FDIV: 1267 if (C2) return getConstantFP(C1 / C2, VT); 1268 break; 1269 case ISD::FREM : 1270 if (C2) return getConstantFP(fmod(C1, C2), VT); 1271 break; 1272 case ISD::FCOPYSIGN: { 1273 union { 1274 double F; 1275 uint64_t I; 1276 } u1; 1277 union { 1278 double F; 1279 int64_t I; 1280 } u2; 1281 u1.F = C1; 1282 u2.F = C2; 1283 if (u2.I < 0) // Sign bit of RHS set? 1284 u1.I |= 1ULL << 63; // Set the sign bit of the LHS. 1285 else 1286 u1.I &= (1ULL << 63)-1; // Clear the sign bit of the LHS. 1287 return getConstantFP(u1.F, VT); 1288 } 1289 default: break; 1290 } 1291 } else { // Cannonicalize constant to RHS if commutative 1292 if (isCommutativeBinOp(Opcode)) { 1293 std::swap(N1CFP, N2CFP); 1294 std::swap(N1, N2); 1295 } 1296 } 1297 } 1298 1299 // Canonicalize an UNDEF to the RHS, even over a constant. 1300 if (N1.getOpcode() == ISD::UNDEF) { 1301 if (isCommutativeBinOp(Opcode)) { 1302 std::swap(N1, N2); 1303 } else { 1304 switch (Opcode) { 1305 case ISD::FP_ROUND_INREG: 1306 case ISD::SIGN_EXTEND_INREG: 1307 case ISD::SUB: 1308 case ISD::FSUB: 1309 case ISD::FDIV: 1310 case ISD::FREM: 1311 case ISD::SRA: 1312 return N1; // fold op(undef, arg2) -> undef 1313 case ISD::UDIV: 1314 case ISD::SDIV: 1315 case ISD::UREM: 1316 case ISD::SREM: 1317 case ISD::SRL: 1318 case ISD::SHL: 1319 return getConstant(0, VT); // fold op(undef, arg2) -> 0 1320 } 1321 } 1322 } 1323 1324 // Fold a bunch of operators when the RHS is undef. 1325 if (N2.getOpcode() == ISD::UNDEF) { 1326 switch (Opcode) { 1327 case ISD::ADD: 1328 case ISD::ADDC: 1329 case ISD::ADDE: 1330 case ISD::SUB: 1331 case ISD::FADD: 1332 case ISD::FSUB: 1333 case ISD::FMUL: 1334 case ISD::FDIV: 1335 case ISD::FREM: 1336 case ISD::UDIV: 1337 case ISD::SDIV: 1338 case ISD::UREM: 1339 case ISD::SREM: 1340 case ISD::XOR: 1341 return N2; // fold op(arg1, undef) -> undef 1342 case ISD::MUL: 1343 case ISD::AND: 1344 case ISD::SRL: 1345 case ISD::SHL: 1346 return getConstant(0, VT); // fold op(arg1, undef) -> 0 1347 case ISD::OR: 1348 return getConstant(MVT::getIntVTBitMask(VT), VT); 1349 case ISD::SRA: 1350 return N1; 1351 } 1352 } 1353 1354 // Fold operations. 1355 switch (Opcode) { 1356 case ISD::TokenFactor: 1357 // Fold trivial token factors. 1358 if (N1.getOpcode() == ISD::EntryToken) return N2; 1359 if (N2.getOpcode() == ISD::EntryToken) return N1; 1360 break; 1361 1362 case ISD::AND: 1363 // (X & 0) -> 0. This commonly occurs when legalizing i64 values, so it's 1364 // worth handling here. 1365 if (N2C && N2C->getValue() == 0) 1366 return N2; 1367 break; 1368 case ISD::OR: 1369 case ISD::XOR: 1370 // (X ^| 0) -> X. This commonly occurs when legalizing i64 values, so it's 1371 // worth handling here. 1372 if (N2C && N2C->getValue() == 0) 1373 return N1; 1374 break; 1375 case ISD::FP_ROUND_INREG: 1376 if (cast<VTSDNode>(N2)->getVT() == VT) return N1; // Not actually rounding. 1377 break; 1378 case ISD::SIGN_EXTEND_INREG: { 1379 MVT::ValueType EVT = cast<VTSDNode>(N2)->getVT(); 1380 if (EVT == VT) return N1; // Not actually extending 1381 break; 1382 } 1383 case ISD::EXTRACT_ELEMENT: 1384 assert(N2C && (unsigned)N2C->getValue() < 2 && "Bad EXTRACT_ELEMENT!"); 1385 1386 // EXTRACT_ELEMENT of BUILD_PAIR is often formed while legalize is expanding 1387 // 64-bit integers into 32-bit parts. Instead of building the extract of 1388 // the BUILD_PAIR, only to have legalize rip it apart, just do it now. 1389 if (N1.getOpcode() == ISD::BUILD_PAIR) 1390 return N1.getOperand(N2C->getValue()); 1391 1392 // EXTRACT_ELEMENT of a constant int is also very common. 1393 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(N1)) { 1394 unsigned Shift = MVT::getSizeInBits(VT) * N2C->getValue(); 1395 return getConstant(C->getValue() >> Shift, VT); 1396 } 1397 break; 1398 1399 // FIXME: figure out how to safely handle things like 1400 // int foo(int x) { return 1 << (x & 255); } 1401 // int bar() { return foo(256); } 1402#if 0 1403 case ISD::SHL: 1404 case ISD::SRL: 1405 case ISD::SRA: 1406 if (N2.getOpcode() == ISD::SIGN_EXTEND_INREG && 1407 cast<VTSDNode>(N2.getOperand(1))->getVT() != MVT::i1) 1408 return getNode(Opcode, VT, N1, N2.getOperand(0)); 1409 else if (N2.getOpcode() == ISD::AND) 1410 if (ConstantSDNode *AndRHS = dyn_cast<ConstantSDNode>(N2.getOperand(1))) { 1411 // If the and is only masking out bits that cannot effect the shift, 1412 // eliminate the and. 1413 unsigned NumBits = MVT::getSizeInBits(VT); 1414 if ((AndRHS->getValue() & (NumBits-1)) == NumBits-1) 1415 return getNode(Opcode, VT, N1, N2.getOperand(0)); 1416 } 1417 break; 1418#endif 1419 } 1420 1421 // Memoize this node if possible. 1422 SDNode *N; 1423 SDVTList VTs = getVTList(VT); 1424 if (VT != MVT::Flag) { 1425 SDOperand Ops[] = { N1, N2 }; 1426 FoldingSetNodeID ID; 1427 AddNodeIDNode(ID, Opcode, VTs, Ops, 2); 1428 void *IP = 0; 1429 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP)) 1430 return SDOperand(E, 0); 1431 N = new BinarySDNode(Opcode, VTs, N1, N2); 1432 CSEMap.InsertNode(N, IP); 1433 } else { 1434 N = new BinarySDNode(Opcode, VTs, N1, N2); 1435 } 1436 1437 AllNodes.push_back(N); 1438 return SDOperand(N, 0); 1439} 1440 1441SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT, 1442 SDOperand N1, SDOperand N2, SDOperand N3) { 1443 // Perform various simplifications. 1444 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1.Val); 1445 ConstantSDNode *N2C = dyn_cast<ConstantSDNode>(N2.Val); 1446 switch (Opcode) { 1447 case ISD::SETCC: { 1448 // Use FoldSetCC to simplify SETCC's. 1449 SDOperand Simp = FoldSetCC(VT, N1, N2, cast<CondCodeSDNode>(N3)->get()); 1450 if (Simp.Val) return Simp; 1451 break; 1452 } 1453 case ISD::SELECT: 1454 if (N1C) 1455 if (N1C->getValue()) 1456 return N2; // select true, X, Y -> X 1457 else 1458 return N3; // select false, X, Y -> Y 1459 1460 if (N2 == N3) return N2; // select C, X, X -> X 1461 break; 1462 case ISD::BRCOND: 1463 if (N2C) 1464 if (N2C->getValue()) // Unconditional branch 1465 return getNode(ISD::BR, MVT::Other, N1, N3); 1466 else 1467 return N1; // Never-taken branch 1468 break; 1469 case ISD::VECTOR_SHUFFLE: 1470 assert(VT == N1.getValueType() && VT == N2.getValueType() && 1471 MVT::isVector(VT) && MVT::isVector(N3.getValueType()) && 1472 N3.getOpcode() == ISD::BUILD_VECTOR && 1473 MVT::getVectorNumElements(VT) == N3.getNumOperands() && 1474 "Illegal VECTOR_SHUFFLE node!"); 1475 break; 1476 } 1477 1478 // Memoize node if it doesn't produce a flag. 1479 SDNode *N; 1480 SDVTList VTs = getVTList(VT); 1481 if (VT != MVT::Flag) { 1482 SDOperand Ops[] = { N1, N2, N3 }; 1483 FoldingSetNodeID ID; 1484 AddNodeIDNode(ID, Opcode, VTs, Ops, 3); 1485 void *IP = 0; 1486 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP)) 1487 return SDOperand(E, 0); 1488 N = new TernarySDNode(Opcode, VTs, N1, N2, N3); 1489 CSEMap.InsertNode(N, IP); 1490 } else { 1491 N = new TernarySDNode(Opcode, VTs, N1, N2, N3); 1492 } 1493 AllNodes.push_back(N); 1494 return SDOperand(N, 0); 1495} 1496 1497SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT, 1498 SDOperand N1, SDOperand N2, SDOperand N3, 1499 SDOperand N4) { 1500 SDOperand Ops[] = { N1, N2, N3, N4 }; 1501 return getNode(Opcode, VT, Ops, 4); 1502} 1503 1504SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT, 1505 SDOperand N1, SDOperand N2, SDOperand N3, 1506 SDOperand N4, SDOperand N5) { 1507 SDOperand Ops[] = { N1, N2, N3, N4, N5 }; 1508 return getNode(Opcode, VT, Ops, 5); 1509} 1510 1511SDOperand SelectionDAG::getLoad(MVT::ValueType VT, 1512 SDOperand Chain, SDOperand Ptr, 1513 const Value *SV, int SVOffset, 1514 bool isVolatile) { 1515 // FIXME: Alignment == 1 for now. 1516 unsigned Alignment = 1; 1517 SDVTList VTs = getVTList(VT, MVT::Other); 1518 SDOperand Undef = getNode(ISD::UNDEF, Ptr.getValueType()); 1519 SDOperand Ops[] = { Chain, Ptr, Undef }; 1520 FoldingSetNodeID ID; 1521 AddNodeIDNode(ID, ISD::LOAD, VTs, Ops, 3); 1522 ID.AddInteger(ISD::UNINDEXED); 1523 ID.AddInteger(ISD::NON_EXTLOAD); 1524 ID.AddInteger(VT); 1525 ID.AddPointer(SV); 1526 ID.AddInteger(SVOffset); 1527 ID.AddInteger(Alignment); 1528 ID.AddInteger(isVolatile); 1529 void *IP = 0; 1530 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP)) 1531 return SDOperand(E, 0); 1532 SDNode *N = new LoadSDNode(Ops, VTs, ISD::UNINDEXED, 1533 ISD::NON_EXTLOAD, VT, SV, SVOffset, Alignment, 1534 isVolatile); 1535 CSEMap.InsertNode(N, IP); 1536 AllNodes.push_back(N); 1537 return SDOperand(N, 0); 1538} 1539 1540SDOperand SelectionDAG::getExtLoad(ISD::LoadExtType ExtType, MVT::ValueType VT, 1541 SDOperand Chain, SDOperand Ptr, 1542 const Value *SV, 1543 int SVOffset, MVT::ValueType EVT, 1544 bool isVolatile) { 1545 // If they are asking for an extending load from/to the same thing, return a 1546 // normal load. 1547 if (VT == EVT) 1548 ExtType = ISD::NON_EXTLOAD; 1549 1550 if (MVT::isVector(VT)) 1551 assert(EVT == MVT::getVectorBaseType(VT) && "Invalid vector extload!"); 1552 else 1553 assert(EVT < VT && "Should only be an extending load, not truncating!"); 1554 assert((ExtType == ISD::EXTLOAD || MVT::isInteger(VT)) && 1555 "Cannot sign/zero extend a FP/Vector load!"); 1556 assert(MVT::isInteger(VT) == MVT::isInteger(EVT) && 1557 "Cannot convert from FP to Int or Int -> FP!"); 1558 1559 // FIXME: Alignment == 1 for now. 1560 unsigned Alignment = 1; 1561 SDVTList VTs = getVTList(VT, MVT::Other); 1562 SDOperand Undef = getNode(ISD::UNDEF, Ptr.getValueType()); 1563 SDOperand Ops[] = { Chain, Ptr, Undef }; 1564 FoldingSetNodeID ID; 1565 AddNodeIDNode(ID, ISD::LOAD, VTs, Ops, 3); 1566 ID.AddInteger(ISD::UNINDEXED); 1567 ID.AddInteger(ExtType); 1568 ID.AddInteger(EVT); 1569 ID.AddPointer(SV); 1570 ID.AddInteger(SVOffset); 1571 ID.AddInteger(Alignment); 1572 ID.AddInteger(isVolatile); 1573 void *IP = 0; 1574 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP)) 1575 return SDOperand(E, 0); 1576 SDNode *N = new LoadSDNode(Ops, VTs, ISD::UNINDEXED, ExtType, EVT, 1577 SV, SVOffset, Alignment, isVolatile); 1578 CSEMap.InsertNode(N, IP); 1579 AllNodes.push_back(N); 1580 return SDOperand(N, 0); 1581} 1582 1583SDOperand 1584SelectionDAG::getIndexedLoad(SDOperand OrigLoad, SDOperand Base, 1585 SDOperand Offset, ISD::MemIndexedMode AM) { 1586 LoadSDNode *LD = cast<LoadSDNode>(OrigLoad); 1587 assert(LD->getOffset().getOpcode() == ISD::UNDEF && 1588 "Load is already a indexed load!"); 1589 MVT::ValueType VT = OrigLoad.getValueType(); 1590 SDVTList VTs = getVTList(VT, Base.getValueType(), MVT::Other); 1591 SDOperand Ops[] = { LD->getChain(), Base, Offset }; 1592 FoldingSetNodeID ID; 1593 AddNodeIDNode(ID, ISD::LOAD, VTs, Ops, 3); 1594 ID.AddInteger(AM); 1595 ID.AddInteger(LD->getExtensionType()); 1596 ID.AddInteger(LD->getLoadedVT()); 1597 ID.AddPointer(LD->getSrcValue()); 1598 ID.AddInteger(LD->getSrcValueOffset()); 1599 ID.AddInteger(LD->getAlignment()); 1600 ID.AddInteger(LD->isVolatile()); 1601 void *IP = 0; 1602 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP)) 1603 return SDOperand(E, 0); 1604 SDNode *N = new LoadSDNode(Ops, VTs, AM, 1605 LD->getExtensionType(), LD->getLoadedVT(), 1606 LD->getSrcValue(), LD->getSrcValueOffset(), 1607 LD->getAlignment(), LD->isVolatile()); 1608 CSEMap.InsertNode(N, IP); 1609 AllNodes.push_back(N); 1610 return SDOperand(N, 0); 1611} 1612 1613SDOperand SelectionDAG::getVecLoad(unsigned Count, MVT::ValueType EVT, 1614 SDOperand Chain, SDOperand Ptr, 1615 SDOperand SV) { 1616 SDOperand Ops[] = { Chain, Ptr, SV, getConstant(Count, MVT::i32), 1617 getValueType(EVT) }; 1618 return getNode(ISD::VLOAD, getVTList(MVT::Vector, MVT::Other), Ops, 5); 1619} 1620 1621SDOperand SelectionDAG::getStore(SDOperand Chain, SDOperand Val, 1622 SDOperand Ptr, const Value *SV, int SVOffset, 1623 bool isVolatile) { 1624 MVT::ValueType VT = Val.getValueType(); 1625 1626 // FIXME: Alignment == 1 for now. 1627 unsigned Alignment = 1; 1628 SDVTList VTs = getVTList(MVT::Other); 1629 SDOperand Undef = getNode(ISD::UNDEF, Ptr.getValueType()); 1630 SDOperand Ops[] = { Chain, Val, Ptr, Undef }; 1631 FoldingSetNodeID ID; 1632 AddNodeIDNode(ID, ISD::STORE, VTs, Ops, 4); 1633 ID.AddInteger(ISD::UNINDEXED); 1634 ID.AddInteger(false); 1635 ID.AddInteger(VT); 1636 ID.AddPointer(SV); 1637 ID.AddInteger(SVOffset); 1638 ID.AddInteger(Alignment); 1639 ID.AddInteger(isVolatile); 1640 void *IP = 0; 1641 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP)) 1642 return SDOperand(E, 0); 1643 SDNode *N = new StoreSDNode(Ops, VTs, ISD::UNINDEXED, false, 1644 VT, SV, SVOffset, Alignment, isVolatile); 1645 CSEMap.InsertNode(N, IP); 1646 AllNodes.push_back(N); 1647 return SDOperand(N, 0); 1648} 1649 1650SDOperand SelectionDAG::getTruncStore(SDOperand Chain, SDOperand Val, 1651 SDOperand Ptr, const Value *SV, 1652 int SVOffset, MVT::ValueType SVT, 1653 bool isVolatile) { 1654 MVT::ValueType VT = Val.getValueType(); 1655 bool isTrunc = VT != SVT; 1656 1657 assert(VT > SVT && "Not a truncation?"); 1658 assert(MVT::isInteger(VT) == MVT::isInteger(SVT) && 1659 "Can't do FP-INT conversion!"); 1660 1661 // FIXME: Alignment == 1 for now. 1662 unsigned Alignment = 1; 1663 SDVTList VTs = getVTList(MVT::Other); 1664 SDOperand Undef = getNode(ISD::UNDEF, Ptr.getValueType()); 1665 SDOperand Ops[] = { Chain, Val, Ptr, Undef }; 1666 FoldingSetNodeID ID; 1667 AddNodeIDNode(ID, ISD::STORE, VTs, Ops, 4); 1668 ID.AddInteger(ISD::UNINDEXED); 1669 ID.AddInteger(isTrunc); 1670 ID.AddInteger(SVT); 1671 ID.AddPointer(SV); 1672 ID.AddInteger(SVOffset); 1673 ID.AddInteger(Alignment); 1674 ID.AddInteger(isVolatile); 1675 void *IP = 0; 1676 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP)) 1677 return SDOperand(E, 0); 1678 SDNode *N = new StoreSDNode(Ops, VTs, ISD::UNINDEXED, isTrunc, 1679 SVT, SV, SVOffset, Alignment, isVolatile); 1680 CSEMap.InsertNode(N, IP); 1681 AllNodes.push_back(N); 1682 return SDOperand(N, 0); 1683} 1684 1685SDOperand 1686SelectionDAG::getIndexedStore(SDOperand OrigStore, SDOperand Base, 1687 SDOperand Offset, ISD::MemIndexedMode AM) { 1688 StoreSDNode *ST = cast<StoreSDNode>(OrigStore); 1689 assert(ST->getOffset().getOpcode() == ISD::UNDEF && 1690 "Store is already a indexed store!"); 1691 SDVTList VTs = getVTList(Base.getValueType(), MVT::Other); 1692 SDOperand Ops[] = { ST->getChain(), ST->getValue(), Base, Offset }; 1693 FoldingSetNodeID ID; 1694 AddNodeIDNode(ID, ISD::STORE, VTs, Ops, 4); 1695 ID.AddInteger(AM); 1696 ID.AddInteger(ST->isTruncatingStore()); 1697 ID.AddInteger(ST->getStoredVT()); 1698 ID.AddPointer(ST->getSrcValue()); 1699 ID.AddInteger(ST->getSrcValueOffset()); 1700 ID.AddInteger(ST->getAlignment()); 1701 ID.AddInteger(ST->isVolatile()); 1702 void *IP = 0; 1703 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP)) 1704 return SDOperand(E, 0); 1705 SDNode *N = new StoreSDNode(Ops, VTs, AM, 1706 ST->isTruncatingStore(), ST->getStoredVT(), 1707 ST->getSrcValue(), ST->getSrcValueOffset(), 1708 ST->getAlignment(), ST->isVolatile()); 1709 CSEMap.InsertNode(N, IP); 1710 AllNodes.push_back(N); 1711 return SDOperand(N, 0); 1712} 1713 1714SDOperand SelectionDAG::getVAArg(MVT::ValueType VT, 1715 SDOperand Chain, SDOperand Ptr, 1716 SDOperand SV) { 1717 SDOperand Ops[] = { Chain, Ptr, SV }; 1718 return getNode(ISD::VAARG, getVTList(VT, MVT::Other), Ops, 3); 1719} 1720 1721SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT, 1722 const SDOperand *Ops, unsigned NumOps) { 1723 switch (NumOps) { 1724 case 0: return getNode(Opcode, VT); 1725 case 1: return getNode(Opcode, VT, Ops[0]); 1726 case 2: return getNode(Opcode, VT, Ops[0], Ops[1]); 1727 case 3: return getNode(Opcode, VT, Ops[0], Ops[1], Ops[2]); 1728 default: break; 1729 } 1730 1731 switch (Opcode) { 1732 default: break; 1733 case ISD::SELECT_CC: { 1734 assert(NumOps == 5 && "SELECT_CC takes 5 operands!"); 1735 assert(Ops[0].getValueType() == Ops[1].getValueType() && 1736 "LHS and RHS of condition must have same type!"); 1737 assert(Ops[2].getValueType() == Ops[3].getValueType() && 1738 "True and False arms of SelectCC must have same type!"); 1739 assert(Ops[2].getValueType() == VT && 1740 "select_cc node must be of same type as true and false value!"); 1741 break; 1742 } 1743 case ISD::BR_CC: { 1744 assert(NumOps == 5 && "BR_CC takes 5 operands!"); 1745 assert(Ops[2].getValueType() == Ops[3].getValueType() && 1746 "LHS/RHS of comparison should match types!"); 1747 break; 1748 } 1749 } 1750 1751 // Memoize nodes. 1752 SDNode *N; 1753 SDVTList VTs = getVTList(VT); 1754 if (VT != MVT::Flag) { 1755 FoldingSetNodeID ID; 1756 AddNodeIDNode(ID, Opcode, VTs, Ops, NumOps); 1757 void *IP = 0; 1758 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP)) 1759 return SDOperand(E, 0); 1760 N = new SDNode(Opcode, VTs, Ops, NumOps); 1761 CSEMap.InsertNode(N, IP); 1762 } else { 1763 N = new SDNode(Opcode, VTs, Ops, NumOps); 1764 } 1765 AllNodes.push_back(N); 1766 return SDOperand(N, 0); 1767} 1768 1769SDOperand SelectionDAG::getNode(unsigned Opcode, 1770 std::vector<MVT::ValueType> &ResultTys, 1771 const SDOperand *Ops, unsigned NumOps) { 1772 return getNode(Opcode, getNodeValueTypes(ResultTys), ResultTys.size(), 1773 Ops, NumOps); 1774} 1775 1776SDOperand SelectionDAG::getNode(unsigned Opcode, 1777 const MVT::ValueType *VTs, unsigned NumVTs, 1778 const SDOperand *Ops, unsigned NumOps) { 1779 if (NumVTs == 1) 1780 return getNode(Opcode, VTs[0], Ops, NumOps); 1781 return getNode(Opcode, makeVTList(VTs, NumVTs), Ops, NumOps); 1782} 1783 1784SDOperand SelectionDAG::getNode(unsigned Opcode, SDVTList VTList, 1785 const SDOperand *Ops, unsigned NumOps) { 1786 if (VTList.NumVTs == 1) 1787 return getNode(Opcode, VTList.VTs[0], Ops, NumOps); 1788 1789 switch (Opcode) { 1790 // FIXME: figure out how to safely handle things like 1791 // int foo(int x) { return 1 << (x & 255); } 1792 // int bar() { return foo(256); } 1793#if 0 1794 case ISD::SRA_PARTS: 1795 case ISD::SRL_PARTS: 1796 case ISD::SHL_PARTS: 1797 if (N3.getOpcode() == ISD::SIGN_EXTEND_INREG && 1798 cast<VTSDNode>(N3.getOperand(1))->getVT() != MVT::i1) 1799 return getNode(Opcode, VT, N1, N2, N3.getOperand(0)); 1800 else if (N3.getOpcode() == ISD::AND) 1801 if (ConstantSDNode *AndRHS = dyn_cast<ConstantSDNode>(N3.getOperand(1))) { 1802 // If the and is only masking out bits that cannot effect the shift, 1803 // eliminate the and. 1804 unsigned NumBits = MVT::getSizeInBits(VT)*2; 1805 if ((AndRHS->getValue() & (NumBits-1)) == NumBits-1) 1806 return getNode(Opcode, VT, N1, N2, N3.getOperand(0)); 1807 } 1808 break; 1809#endif 1810 } 1811 1812 // Memoize the node unless it returns a flag. 1813 SDNode *N; 1814 if (VTList.VTs[VTList.NumVTs-1] != MVT::Flag) { 1815 FoldingSetNodeID ID; 1816 AddNodeIDNode(ID, Opcode, VTList, Ops, NumOps); 1817 void *IP = 0; 1818 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP)) 1819 return SDOperand(E, 0); 1820 if (NumOps == 1) 1821 N = new UnarySDNode(Opcode, VTList, Ops[0]); 1822 else if (NumOps == 2) 1823 N = new BinarySDNode(Opcode, VTList, Ops[0], Ops[1]); 1824 else if (NumOps == 3) 1825 N = new TernarySDNode(Opcode, VTList, Ops[0], Ops[1], Ops[2]); 1826 else 1827 N = new SDNode(Opcode, VTList, Ops, NumOps); 1828 CSEMap.InsertNode(N, IP); 1829 } else { 1830 if (NumOps == 1) 1831 N = new UnarySDNode(Opcode, VTList, Ops[0]); 1832 else if (NumOps == 2) 1833 N = new BinarySDNode(Opcode, VTList, Ops[0], Ops[1]); 1834 else if (NumOps == 3) 1835 N = new TernarySDNode(Opcode, VTList, Ops[0], Ops[1], Ops[2]); 1836 else 1837 N = new SDNode(Opcode, VTList, Ops, NumOps); 1838 } 1839 AllNodes.push_back(N); 1840 return SDOperand(N, 0); 1841} 1842 1843SDVTList SelectionDAG::getVTList(MVT::ValueType VT) { 1844 return makeVTList(SDNode::getValueTypeList(VT), 1); 1845} 1846 1847SDVTList SelectionDAG::getVTList(MVT::ValueType VT1, MVT::ValueType VT2) { 1848 for (std::list<std::vector<MVT::ValueType> >::iterator I = VTList.begin(), 1849 E = VTList.end(); I != E; ++I) { 1850 if (I->size() == 2 && (*I)[0] == VT1 && (*I)[1] == VT2) 1851 return makeVTList(&(*I)[0], 2); 1852 } 1853 std::vector<MVT::ValueType> V; 1854 V.push_back(VT1); 1855 V.push_back(VT2); 1856 VTList.push_front(V); 1857 return makeVTList(&(*VTList.begin())[0], 2); 1858} 1859SDVTList SelectionDAG::getVTList(MVT::ValueType VT1, MVT::ValueType VT2, 1860 MVT::ValueType VT3) { 1861 for (std::list<std::vector<MVT::ValueType> >::iterator I = VTList.begin(), 1862 E = VTList.end(); I != E; ++I) { 1863 if (I->size() == 3 && (*I)[0] == VT1 && (*I)[1] == VT2 && 1864 (*I)[2] == VT3) 1865 return makeVTList(&(*I)[0], 3); 1866 } 1867 std::vector<MVT::ValueType> V; 1868 V.push_back(VT1); 1869 V.push_back(VT2); 1870 V.push_back(VT3); 1871 VTList.push_front(V); 1872 return makeVTList(&(*VTList.begin())[0], 3); 1873} 1874 1875SDVTList SelectionDAG::getVTList(const MVT::ValueType *VTs, unsigned NumVTs) { 1876 switch (NumVTs) { 1877 case 0: assert(0 && "Cannot have nodes without results!"); 1878 case 1: return makeVTList(SDNode::getValueTypeList(VTs[0]), 1); 1879 case 2: return getVTList(VTs[0], VTs[1]); 1880 case 3: return getVTList(VTs[0], VTs[1], VTs[2]); 1881 default: break; 1882 } 1883 1884 for (std::list<std::vector<MVT::ValueType> >::iterator I = VTList.begin(), 1885 E = VTList.end(); I != E; ++I) { 1886 if (I->size() != NumVTs || VTs[0] != (*I)[0] || VTs[1] != (*I)[1]) continue; 1887 1888 bool NoMatch = false; 1889 for (unsigned i = 2; i != NumVTs; ++i) 1890 if (VTs[i] != (*I)[i]) { 1891 NoMatch = true; 1892 break; 1893 } 1894 if (!NoMatch) 1895 return makeVTList(&*I->begin(), NumVTs); 1896 } 1897 1898 VTList.push_front(std::vector<MVT::ValueType>(VTs, VTs+NumVTs)); 1899 return makeVTList(&*VTList.begin()->begin(), NumVTs); 1900} 1901 1902 1903/// UpdateNodeOperands - *Mutate* the specified node in-place to have the 1904/// specified operands. If the resultant node already exists in the DAG, 1905/// this does not modify the specified node, instead it returns the node that 1906/// already exists. If the resultant node does not exist in the DAG, the 1907/// input node is returned. As a degenerate case, if you specify the same 1908/// input operands as the node already has, the input node is returned. 1909SDOperand SelectionDAG:: 1910UpdateNodeOperands(SDOperand InN, SDOperand Op) { 1911 SDNode *N = InN.Val; 1912 assert(N->getNumOperands() == 1 && "Update with wrong number of operands"); 1913 1914 // Check to see if there is no change. 1915 if (Op == N->getOperand(0)) return InN; 1916 1917 // See if the modified node already exists. 1918 void *InsertPos = 0; 1919 if (SDNode *Existing = FindModifiedNodeSlot(N, Op, InsertPos)) 1920 return SDOperand(Existing, InN.ResNo); 1921 1922 // Nope it doesn't. Remove the node from it's current place in the maps. 1923 if (InsertPos) 1924 RemoveNodeFromCSEMaps(N); 1925 1926 // Now we update the operands. 1927 N->OperandList[0].Val->removeUser(N); 1928 Op.Val->addUser(N); 1929 N->OperandList[0] = Op; 1930 1931 // If this gets put into a CSE map, add it. 1932 if (InsertPos) CSEMap.InsertNode(N, InsertPos); 1933 return InN; 1934} 1935 1936SDOperand SelectionDAG:: 1937UpdateNodeOperands(SDOperand InN, SDOperand Op1, SDOperand Op2) { 1938 SDNode *N = InN.Val; 1939 assert(N->getNumOperands() == 2 && "Update with wrong number of operands"); 1940 1941 // Check to see if there is no change. 1942 if (Op1 == N->getOperand(0) && Op2 == N->getOperand(1)) 1943 return InN; // No operands changed, just return the input node. 1944 1945 // See if the modified node already exists. 1946 void *InsertPos = 0; 1947 if (SDNode *Existing = FindModifiedNodeSlot(N, Op1, Op2, InsertPos)) 1948 return SDOperand(Existing, InN.ResNo); 1949 1950 // Nope it doesn't. Remove the node from it's current place in the maps. 1951 if (InsertPos) 1952 RemoveNodeFromCSEMaps(N); 1953 1954 // Now we update the operands. 1955 if (N->OperandList[0] != Op1) { 1956 N->OperandList[0].Val->removeUser(N); 1957 Op1.Val->addUser(N); 1958 N->OperandList[0] = Op1; 1959 } 1960 if (N->OperandList[1] != Op2) { 1961 N->OperandList[1].Val->removeUser(N); 1962 Op2.Val->addUser(N); 1963 N->OperandList[1] = Op2; 1964 } 1965 1966 // If this gets put into a CSE map, add it. 1967 if (InsertPos) CSEMap.InsertNode(N, InsertPos); 1968 return InN; 1969} 1970 1971SDOperand SelectionDAG:: 1972UpdateNodeOperands(SDOperand N, SDOperand Op1, SDOperand Op2, SDOperand Op3) { 1973 SDOperand Ops[] = { Op1, Op2, Op3 }; 1974 return UpdateNodeOperands(N, Ops, 3); 1975} 1976 1977SDOperand SelectionDAG:: 1978UpdateNodeOperands(SDOperand N, SDOperand Op1, SDOperand Op2, 1979 SDOperand Op3, SDOperand Op4) { 1980 SDOperand Ops[] = { Op1, Op2, Op3, Op4 }; 1981 return UpdateNodeOperands(N, Ops, 4); 1982} 1983 1984SDOperand SelectionDAG:: 1985UpdateNodeOperands(SDOperand N, SDOperand Op1, SDOperand Op2, 1986 SDOperand Op3, SDOperand Op4, SDOperand Op5) { 1987 SDOperand Ops[] = { Op1, Op2, Op3, Op4, Op5 }; 1988 return UpdateNodeOperands(N, Ops, 5); 1989} 1990 1991 1992SDOperand SelectionDAG:: 1993UpdateNodeOperands(SDOperand InN, SDOperand *Ops, unsigned NumOps) { 1994 SDNode *N = InN.Val; 1995 assert(N->getNumOperands() == NumOps && 1996 "Update with wrong number of operands"); 1997 1998 // Check to see if there is no change. 1999 bool AnyChange = false; 2000 for (unsigned i = 0; i != NumOps; ++i) { 2001 if (Ops[i] != N->getOperand(i)) { 2002 AnyChange = true; 2003 break; 2004 } 2005 } 2006 2007 // No operands changed, just return the input node. 2008 if (!AnyChange) return InN; 2009 2010 // See if the modified node already exists. 2011 void *InsertPos = 0; 2012 if (SDNode *Existing = FindModifiedNodeSlot(N, Ops, NumOps, InsertPos)) 2013 return SDOperand(Existing, InN.ResNo); 2014 2015 // Nope it doesn't. Remove the node from it's current place in the maps. 2016 if (InsertPos) 2017 RemoveNodeFromCSEMaps(N); 2018 2019 // Now we update the operands. 2020 for (unsigned i = 0; i != NumOps; ++i) { 2021 if (N->OperandList[i] != Ops[i]) { 2022 N->OperandList[i].Val->removeUser(N); 2023 Ops[i].Val->addUser(N); 2024 N->OperandList[i] = Ops[i]; 2025 } 2026 } 2027 2028 // If this gets put into a CSE map, add it. 2029 if (InsertPos) CSEMap.InsertNode(N, InsertPos); 2030 return InN; 2031} 2032 2033 2034/// MorphNodeTo - This frees the operands of the current node, resets the 2035/// opcode, types, and operands to the specified value. This should only be 2036/// used by the SelectionDAG class. 2037void SDNode::MorphNodeTo(unsigned Opc, SDVTList L, 2038 const SDOperand *Ops, unsigned NumOps) { 2039 NodeType = Opc; 2040 ValueList = L.VTs; 2041 NumValues = L.NumVTs; 2042 2043 // Clear the operands list, updating used nodes to remove this from their 2044 // use list. 2045 for (op_iterator I = op_begin(), E = op_end(); I != E; ++I) 2046 I->Val->removeUser(this); 2047 2048 // If NumOps is larger than the # of operands we currently have, reallocate 2049 // the operand list. 2050 if (NumOps > NumOperands) { 2051 if (OperandsNeedDelete) 2052 delete [] OperandList; 2053 OperandList = new SDOperand[NumOps]; 2054 OperandsNeedDelete = true; 2055 } 2056 2057 // Assign the new operands. 2058 NumOperands = NumOps; 2059 2060 for (unsigned i = 0, e = NumOps; i != e; ++i) { 2061 OperandList[i] = Ops[i]; 2062 SDNode *N = OperandList[i].Val; 2063 N->Uses.push_back(this); 2064 } 2065} 2066 2067/// SelectNodeTo - These are used for target selectors to *mutate* the 2068/// specified node to have the specified return type, Target opcode, and 2069/// operands. Note that target opcodes are stored as 2070/// ISD::BUILTIN_OP_END+TargetOpcode in the node opcode field. 2071/// 2072/// Note that SelectNodeTo returns the resultant node. If there is already a 2073/// node of the specified opcode and operands, it returns that node instead of 2074/// the current one. 2075SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc, 2076 MVT::ValueType VT) { 2077 SDVTList VTs = getVTList(VT); 2078 FoldingSetNodeID ID; 2079 AddNodeIDNode(ID, ISD::BUILTIN_OP_END+TargetOpc, VTs, 0, 0); 2080 void *IP = 0; 2081 if (SDNode *ON = CSEMap.FindNodeOrInsertPos(ID, IP)) 2082 return ON; 2083 2084 RemoveNodeFromCSEMaps(N); 2085 2086 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc, VTs, 0, 0); 2087 2088 CSEMap.InsertNode(N, IP); 2089 return N; 2090} 2091 2092SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc, 2093 MVT::ValueType VT, SDOperand Op1) { 2094 // If an identical node already exists, use it. 2095 SDVTList VTs = getVTList(VT); 2096 SDOperand Ops[] = { Op1 }; 2097 2098 FoldingSetNodeID ID; 2099 AddNodeIDNode(ID, ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 1); 2100 void *IP = 0; 2101 if (SDNode *ON = CSEMap.FindNodeOrInsertPos(ID, IP)) 2102 return ON; 2103 2104 RemoveNodeFromCSEMaps(N); 2105 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 1); 2106 CSEMap.InsertNode(N, IP); 2107 return N; 2108} 2109 2110SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc, 2111 MVT::ValueType VT, SDOperand Op1, 2112 SDOperand Op2) { 2113 // If an identical node already exists, use it. 2114 SDVTList VTs = getVTList(VT); 2115 SDOperand Ops[] = { Op1, Op2 }; 2116 2117 FoldingSetNodeID ID; 2118 AddNodeIDNode(ID, ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 2); 2119 void *IP = 0; 2120 if (SDNode *ON = CSEMap.FindNodeOrInsertPos(ID, IP)) 2121 return ON; 2122 2123 RemoveNodeFromCSEMaps(N); 2124 2125 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 2); 2126 2127 CSEMap.InsertNode(N, IP); // Memoize the new node. 2128 return N; 2129} 2130 2131SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc, 2132 MVT::ValueType VT, SDOperand Op1, 2133 SDOperand Op2, SDOperand Op3) { 2134 // If an identical node already exists, use it. 2135 SDVTList VTs = getVTList(VT); 2136 SDOperand Ops[] = { Op1, Op2, Op3 }; 2137 FoldingSetNodeID ID; 2138 AddNodeIDNode(ID, ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 3); 2139 void *IP = 0; 2140 if (SDNode *ON = CSEMap.FindNodeOrInsertPos(ID, IP)) 2141 return ON; 2142 2143 RemoveNodeFromCSEMaps(N); 2144 2145 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 3); 2146 2147 CSEMap.InsertNode(N, IP); // Memoize the new node. 2148 return N; 2149} 2150 2151SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc, 2152 MVT::ValueType VT, const SDOperand *Ops, 2153 unsigned NumOps) { 2154 // If an identical node already exists, use it. 2155 SDVTList VTs = getVTList(VT); 2156 FoldingSetNodeID ID; 2157 AddNodeIDNode(ID, ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, NumOps); 2158 void *IP = 0; 2159 if (SDNode *ON = CSEMap.FindNodeOrInsertPos(ID, IP)) 2160 return ON; 2161 2162 RemoveNodeFromCSEMaps(N); 2163 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, NumOps); 2164 2165 CSEMap.InsertNode(N, IP); // Memoize the new node. 2166 return N; 2167} 2168 2169SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc, 2170 MVT::ValueType VT1, MVT::ValueType VT2, 2171 SDOperand Op1, SDOperand Op2) { 2172 SDVTList VTs = getVTList(VT1, VT2); 2173 FoldingSetNodeID ID; 2174 SDOperand Ops[] = { Op1, Op2 }; 2175 AddNodeIDNode(ID, ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 2); 2176 void *IP = 0; 2177 if (SDNode *ON = CSEMap.FindNodeOrInsertPos(ID, IP)) 2178 return ON; 2179 2180 RemoveNodeFromCSEMaps(N); 2181 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 2); 2182 CSEMap.InsertNode(N, IP); // Memoize the new node. 2183 return N; 2184} 2185 2186SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc, 2187 MVT::ValueType VT1, MVT::ValueType VT2, 2188 SDOperand Op1, SDOperand Op2, 2189 SDOperand Op3) { 2190 // If an identical node already exists, use it. 2191 SDVTList VTs = getVTList(VT1, VT2); 2192 SDOperand Ops[] = { Op1, Op2, Op3 }; 2193 FoldingSetNodeID ID; 2194 AddNodeIDNode(ID, ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 3); 2195 void *IP = 0; 2196 if (SDNode *ON = CSEMap.FindNodeOrInsertPos(ID, IP)) 2197 return ON; 2198 2199 RemoveNodeFromCSEMaps(N); 2200 2201 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 3); 2202 CSEMap.InsertNode(N, IP); // Memoize the new node. 2203 return N; 2204} 2205 2206 2207/// getTargetNode - These are used for target selectors to create a new node 2208/// with specified return type(s), target opcode, and operands. 2209/// 2210/// Note that getTargetNode returns the resultant node. If there is already a 2211/// node of the specified opcode and operands, it returns that node instead of 2212/// the current one. 2213SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT) { 2214 return getNode(ISD::BUILTIN_OP_END+Opcode, VT).Val; 2215} 2216SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT, 2217 SDOperand Op1) { 2218 return getNode(ISD::BUILTIN_OP_END+Opcode, VT, Op1).Val; 2219} 2220SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT, 2221 SDOperand Op1, SDOperand Op2) { 2222 return getNode(ISD::BUILTIN_OP_END+Opcode, VT, Op1, Op2).Val; 2223} 2224SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT, 2225 SDOperand Op1, SDOperand Op2, 2226 SDOperand Op3) { 2227 return getNode(ISD::BUILTIN_OP_END+Opcode, VT, Op1, Op2, Op3).Val; 2228} 2229SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT, 2230 const SDOperand *Ops, unsigned NumOps) { 2231 return getNode(ISD::BUILTIN_OP_END+Opcode, VT, Ops, NumOps).Val; 2232} 2233SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1, 2234 MVT::ValueType VT2, SDOperand Op1) { 2235 const MVT::ValueType *VTs = getNodeValueTypes(VT1, VT2); 2236 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 2, &Op1, 1).Val; 2237} 2238SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1, 2239 MVT::ValueType VT2, SDOperand Op1, 2240 SDOperand Op2) { 2241 const MVT::ValueType *VTs = getNodeValueTypes(VT1, VT2); 2242 SDOperand Ops[] = { Op1, Op2 }; 2243 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 2, Ops, 2).Val; 2244} 2245SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1, 2246 MVT::ValueType VT2, SDOperand Op1, 2247 SDOperand Op2, SDOperand Op3) { 2248 const MVT::ValueType *VTs = getNodeValueTypes(VT1, VT2); 2249 SDOperand Ops[] = { Op1, Op2, Op3 }; 2250 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 2, Ops, 3).Val; 2251} 2252SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1, 2253 MVT::ValueType VT2, 2254 const SDOperand *Ops, unsigned NumOps) { 2255 const MVT::ValueType *VTs = getNodeValueTypes(VT1, VT2); 2256 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 2, Ops, NumOps).Val; 2257} 2258SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1, 2259 MVT::ValueType VT2, MVT::ValueType VT3, 2260 SDOperand Op1, SDOperand Op2) { 2261 const MVT::ValueType *VTs = getNodeValueTypes(VT1, VT2, VT3); 2262 SDOperand Ops[] = { Op1, Op2 }; 2263 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 3, Ops, 2).Val; 2264} 2265SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1, 2266 MVT::ValueType VT2, MVT::ValueType VT3, 2267 const SDOperand *Ops, unsigned NumOps) { 2268 const MVT::ValueType *VTs = getNodeValueTypes(VT1, VT2, VT3); 2269 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 3, Ops, NumOps).Val; 2270} 2271 2272/// ReplaceAllUsesWith - Modify anything using 'From' to use 'To' instead. 2273/// This can cause recursive merging of nodes in the DAG. 2274/// 2275/// This version assumes From/To have a single result value. 2276/// 2277void SelectionDAG::ReplaceAllUsesWith(SDOperand FromN, SDOperand ToN, 2278 std::vector<SDNode*> *Deleted) { 2279 SDNode *From = FromN.Val, *To = ToN.Val; 2280 assert(From->getNumValues() == 1 && To->getNumValues() == 1 && 2281 "Cannot replace with this method!"); 2282 assert(From != To && "Cannot replace uses of with self"); 2283 2284 while (!From->use_empty()) { 2285 // Process users until they are all gone. 2286 SDNode *U = *From->use_begin(); 2287 2288 // This node is about to morph, remove its old self from the CSE maps. 2289 RemoveNodeFromCSEMaps(U); 2290 2291 for (SDOperand *I = U->OperandList, *E = U->OperandList+U->NumOperands; 2292 I != E; ++I) 2293 if (I->Val == From) { 2294 From->removeUser(U); 2295 I->Val = To; 2296 To->addUser(U); 2297 } 2298 2299 // Now that we have modified U, add it back to the CSE maps. If it already 2300 // exists there, recursively merge the results together. 2301 if (SDNode *Existing = AddNonLeafNodeToCSEMaps(U)) { 2302 ReplaceAllUsesWith(U, Existing, Deleted); 2303 // U is now dead. 2304 if (Deleted) Deleted->push_back(U); 2305 DeleteNodeNotInCSEMaps(U); 2306 } 2307 } 2308} 2309 2310/// ReplaceAllUsesWith - Modify anything using 'From' to use 'To' instead. 2311/// This can cause recursive merging of nodes in the DAG. 2312/// 2313/// This version assumes From/To have matching types and numbers of result 2314/// values. 2315/// 2316void SelectionDAG::ReplaceAllUsesWith(SDNode *From, SDNode *To, 2317 std::vector<SDNode*> *Deleted) { 2318 assert(From != To && "Cannot replace uses of with self"); 2319 assert(From->getNumValues() == To->getNumValues() && 2320 "Cannot use this version of ReplaceAllUsesWith!"); 2321 if (From->getNumValues() == 1) { // If possible, use the faster version. 2322 ReplaceAllUsesWith(SDOperand(From, 0), SDOperand(To, 0), Deleted); 2323 return; 2324 } 2325 2326 while (!From->use_empty()) { 2327 // Process users until they are all gone. 2328 SDNode *U = *From->use_begin(); 2329 2330 // This node is about to morph, remove its old self from the CSE maps. 2331 RemoveNodeFromCSEMaps(U); 2332 2333 for (SDOperand *I = U->OperandList, *E = U->OperandList+U->NumOperands; 2334 I != E; ++I) 2335 if (I->Val == From) { 2336 From->removeUser(U); 2337 I->Val = To; 2338 To->addUser(U); 2339 } 2340 2341 // Now that we have modified U, add it back to the CSE maps. If it already 2342 // exists there, recursively merge the results together. 2343 if (SDNode *Existing = AddNonLeafNodeToCSEMaps(U)) { 2344 ReplaceAllUsesWith(U, Existing, Deleted); 2345 // U is now dead. 2346 if (Deleted) Deleted->push_back(U); 2347 DeleteNodeNotInCSEMaps(U); 2348 } 2349 } 2350} 2351 2352/// ReplaceAllUsesWith - Modify anything using 'From' to use 'To' instead. 2353/// This can cause recursive merging of nodes in the DAG. 2354/// 2355/// This version can replace From with any result values. To must match the 2356/// number and types of values returned by From. 2357void SelectionDAG::ReplaceAllUsesWith(SDNode *From, 2358 const SDOperand *To, 2359 std::vector<SDNode*> *Deleted) { 2360 if (From->getNumValues() == 1 && To[0].Val->getNumValues() == 1) { 2361 // Degenerate case handled above. 2362 ReplaceAllUsesWith(SDOperand(From, 0), To[0], Deleted); 2363 return; 2364 } 2365 2366 while (!From->use_empty()) { 2367 // Process users until they are all gone. 2368 SDNode *U = *From->use_begin(); 2369 2370 // This node is about to morph, remove its old self from the CSE maps. 2371 RemoveNodeFromCSEMaps(U); 2372 2373 for (SDOperand *I = U->OperandList, *E = U->OperandList+U->NumOperands; 2374 I != E; ++I) 2375 if (I->Val == From) { 2376 const SDOperand &ToOp = To[I->ResNo]; 2377 From->removeUser(U); 2378 *I = ToOp; 2379 ToOp.Val->addUser(U); 2380 } 2381 2382 // Now that we have modified U, add it back to the CSE maps. If it already 2383 // exists there, recursively merge the results together. 2384 if (SDNode *Existing = AddNonLeafNodeToCSEMaps(U)) { 2385 ReplaceAllUsesWith(U, Existing, Deleted); 2386 // U is now dead. 2387 if (Deleted) Deleted->push_back(U); 2388 DeleteNodeNotInCSEMaps(U); 2389 } 2390 } 2391} 2392 2393/// ReplaceAllUsesOfValueWith - Replace any uses of From with To, leaving 2394/// uses of other values produced by From.Val alone. The Deleted vector is 2395/// handled the same was as for ReplaceAllUsesWith. 2396void SelectionDAG::ReplaceAllUsesOfValueWith(SDOperand From, SDOperand To, 2397 std::vector<SDNode*> &Deleted) { 2398 assert(From != To && "Cannot replace a value with itself"); 2399 // Handle the simple, trivial, case efficiently. 2400 if (From.Val->getNumValues() == 1 && To.Val->getNumValues() == 1) { 2401 ReplaceAllUsesWith(From, To, &Deleted); 2402 return; 2403 } 2404 2405 // Get all of the users of From.Val. We want these in a nice, 2406 // deterministically ordered and uniqued set, so we use a SmallSetVector. 2407 SmallSetVector<SDNode*, 16> Users(From.Val->use_begin(), From.Val->use_end()); 2408 2409 while (!Users.empty()) { 2410 // We know that this user uses some value of From. If it is the right 2411 // value, update it. 2412 SDNode *User = Users.back(); 2413 Users.pop_back(); 2414 2415 for (SDOperand *Op = User->OperandList, 2416 *E = User->OperandList+User->NumOperands; Op != E; ++Op) { 2417 if (*Op == From) { 2418 // Okay, we know this user needs to be updated. Remove its old self 2419 // from the CSE maps. 2420 RemoveNodeFromCSEMaps(User); 2421 2422 // Update all operands that match "From". 2423 for (; Op != E; ++Op) { 2424 if (*Op == From) { 2425 From.Val->removeUser(User); 2426 *Op = To; 2427 To.Val->addUser(User); 2428 } 2429 } 2430 2431 // Now that we have modified User, add it back to the CSE maps. If it 2432 // already exists there, recursively merge the results together. 2433 if (SDNode *Existing = AddNonLeafNodeToCSEMaps(User)) { 2434 unsigned NumDeleted = Deleted.size(); 2435 ReplaceAllUsesWith(User, Existing, &Deleted); 2436 2437 // User is now dead. 2438 Deleted.push_back(User); 2439 DeleteNodeNotInCSEMaps(User); 2440 2441 // We have to be careful here, because ReplaceAllUsesWith could have 2442 // deleted a user of From, which means there may be dangling pointers 2443 // in the "Users" setvector. Scan over the deleted node pointers and 2444 // remove them from the setvector. 2445 for (unsigned i = NumDeleted, e = Deleted.size(); i != e; ++i) 2446 Users.remove(Deleted[i]); 2447 } 2448 break; // Exit the operand scanning loop. 2449 } 2450 } 2451 } 2452} 2453 2454 2455/// AssignNodeIds - Assign a unique node id for each node in the DAG based on 2456/// their allnodes order. It returns the maximum id. 2457unsigned SelectionDAG::AssignNodeIds() { 2458 unsigned Id = 0; 2459 for (allnodes_iterator I = allnodes_begin(), E = allnodes_end(); I != E; ++I){ 2460 SDNode *N = I; 2461 N->setNodeId(Id++); 2462 } 2463 return Id; 2464} 2465 2466/// AssignTopologicalOrder - Assign a unique node id for each node in the DAG 2467/// based on their topological order. It returns the maximum id and a vector 2468/// of the SDNodes* in assigned order by reference. 2469unsigned SelectionDAG::AssignTopologicalOrder(std::vector<SDNode*> &TopOrder) { 2470 unsigned DAGSize = AllNodes.size(); 2471 std::vector<unsigned> InDegree(DAGSize); 2472 std::vector<SDNode*> Sources; 2473 2474 // Use a two pass approach to avoid using a std::map which is slow. 2475 unsigned Id = 0; 2476 for (allnodes_iterator I = allnodes_begin(),E = allnodes_end(); I != E; ++I){ 2477 SDNode *N = I; 2478 N->setNodeId(Id++); 2479 unsigned Degree = N->use_size(); 2480 InDegree[N->getNodeId()] = Degree; 2481 if (Degree == 0) 2482 Sources.push_back(N); 2483 } 2484 2485 TopOrder.clear(); 2486 while (!Sources.empty()) { 2487 SDNode *N = Sources.back(); 2488 Sources.pop_back(); 2489 TopOrder.push_back(N); 2490 for (SDNode::op_iterator I = N->op_begin(), E = N->op_end(); I != E; ++I) { 2491 SDNode *P = I->Val; 2492 unsigned Degree = --InDegree[P->getNodeId()]; 2493 if (Degree == 0) 2494 Sources.push_back(P); 2495 } 2496 } 2497 2498 // Second pass, assign the actual topological order as node ids. 2499 Id = 0; 2500 for (std::vector<SDNode*>::iterator TI = TopOrder.begin(),TE = TopOrder.end(); 2501 TI != TE; ++TI) 2502 (*TI)->setNodeId(Id++); 2503 2504 return Id; 2505} 2506 2507 2508 2509//===----------------------------------------------------------------------===// 2510// SDNode Class 2511//===----------------------------------------------------------------------===// 2512 2513// Out-of-line virtual method to give class a home. 2514void SDNode::ANCHOR() {} 2515void UnarySDNode::ANCHOR() {} 2516void BinarySDNode::ANCHOR() {} 2517void TernarySDNode::ANCHOR() {} 2518void HandleSDNode::ANCHOR() {} 2519void StringSDNode::ANCHOR() {} 2520void ConstantSDNode::ANCHOR() {} 2521void ConstantFPSDNode::ANCHOR() {} 2522void GlobalAddressSDNode::ANCHOR() {} 2523void FrameIndexSDNode::ANCHOR() {} 2524void JumpTableSDNode::ANCHOR() {} 2525void ConstantPoolSDNode::ANCHOR() {} 2526void BasicBlockSDNode::ANCHOR() {} 2527void SrcValueSDNode::ANCHOR() {} 2528void RegisterSDNode::ANCHOR() {} 2529void ExternalSymbolSDNode::ANCHOR() {} 2530void CondCodeSDNode::ANCHOR() {} 2531void VTSDNode::ANCHOR() {} 2532void LoadSDNode::ANCHOR() {} 2533void StoreSDNode::ANCHOR() {} 2534 2535HandleSDNode::~HandleSDNode() { 2536 SDVTList VTs = { 0, 0 }; 2537 MorphNodeTo(ISD::HANDLENODE, VTs, 0, 0); // Drops operand uses. 2538} 2539 2540 2541/// Profile - Gather unique data for the node. 2542/// 2543void SDNode::Profile(FoldingSetNodeID &ID) { 2544 AddNodeIDNode(ID, this); 2545} 2546 2547/// getValueTypeList - Return a pointer to the specified value type. 2548/// 2549MVT::ValueType *SDNode::getValueTypeList(MVT::ValueType VT) { 2550 static MVT::ValueType VTs[MVT::LAST_VALUETYPE]; 2551 VTs[VT] = VT; 2552 return &VTs[VT]; 2553} 2554 2555/// hasNUsesOfValue - Return true if there are exactly NUSES uses of the 2556/// indicated value. This method ignores uses of other values defined by this 2557/// operation. 2558bool SDNode::hasNUsesOfValue(unsigned NUses, unsigned Value) const { 2559 assert(Value < getNumValues() && "Bad value!"); 2560 2561 // If there is only one value, this is easy. 2562 if (getNumValues() == 1) 2563 return use_size() == NUses; 2564 if (Uses.size() < NUses) return false; 2565 2566 SDOperand TheValue(const_cast<SDNode *>(this), Value); 2567 2568 SmallPtrSet<SDNode*, 32> UsersHandled; 2569 2570 for (SDNode::use_iterator UI = Uses.begin(), E = Uses.end(); UI != E; ++UI) { 2571 SDNode *User = *UI; 2572 if (User->getNumOperands() == 1 || 2573 UsersHandled.insert(User)) // First time we've seen this? 2574 for (unsigned i = 0, e = User->getNumOperands(); i != e; ++i) 2575 if (User->getOperand(i) == TheValue) { 2576 if (NUses == 0) 2577 return false; // too many uses 2578 --NUses; 2579 } 2580 } 2581 2582 // Found exactly the right number of uses? 2583 return NUses == 0; 2584} 2585 2586 2587/// isOnlyUse - Return true if this node is the only use of N. 2588/// 2589bool SDNode::isOnlyUse(SDNode *N) const { 2590 bool Seen = false; 2591 for (SDNode::use_iterator I = N->use_begin(), E = N->use_end(); I != E; ++I) { 2592 SDNode *User = *I; 2593 if (User == this) 2594 Seen = true; 2595 else 2596 return false; 2597 } 2598 2599 return Seen; 2600} 2601 2602/// isOperand - Return true if this node is an operand of N. 2603/// 2604bool SDOperand::isOperand(SDNode *N) const { 2605 for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i) 2606 if (*this == N->getOperand(i)) 2607 return true; 2608 return false; 2609} 2610 2611bool SDNode::isOperand(SDNode *N) const { 2612 for (unsigned i = 0, e = N->NumOperands; i != e; ++i) 2613 if (this == N->OperandList[i].Val) 2614 return true; 2615 return false; 2616} 2617 2618static void findPredecessor(SDNode *N, const SDNode *P, bool &found, 2619 SmallPtrSet<SDNode *, 32> &Visited) { 2620 if (found || !Visited.insert(N)) 2621 return; 2622 2623 for (unsigned i = 0, e = N->getNumOperands(); !found && i != e; ++i) { 2624 SDNode *Op = N->getOperand(i).Val; 2625 if (Op == P) { 2626 found = true; 2627 return; 2628 } 2629 findPredecessor(Op, P, found, Visited); 2630 } 2631} 2632 2633/// isPredecessor - Return true if this node is a predecessor of N. This node 2634/// is either an operand of N or it can be reached by recursively traversing 2635/// up the operands. 2636/// NOTE: this is an expensive method. Use it carefully. 2637bool SDNode::isPredecessor(SDNode *N) const { 2638 SmallPtrSet<SDNode *, 32> Visited; 2639 bool found = false; 2640 findPredecessor(N, this, found, Visited); 2641 return found; 2642} 2643 2644uint64_t SDNode::getConstantOperandVal(unsigned Num) const { 2645 assert(Num < NumOperands && "Invalid child # of SDNode!"); 2646 return cast<ConstantSDNode>(OperandList[Num])->getValue(); 2647} 2648 2649const char *SDNode::getOperationName(const SelectionDAG *G) const { 2650 switch (getOpcode()) { 2651 default: 2652 if (getOpcode() < ISD::BUILTIN_OP_END) 2653 return "<<Unknown DAG Node>>"; 2654 else { 2655 if (G) { 2656 if (const TargetInstrInfo *TII = G->getTarget().getInstrInfo()) 2657 if (getOpcode()-ISD::BUILTIN_OP_END < TII->getNumOpcodes()) 2658 return TII->getName(getOpcode()-ISD::BUILTIN_OP_END); 2659 2660 TargetLowering &TLI = G->getTargetLoweringInfo(); 2661 const char *Name = 2662 TLI.getTargetNodeName(getOpcode()); 2663 if (Name) return Name; 2664 } 2665 2666 return "<<Unknown Target Node>>"; 2667 } 2668 2669 case ISD::PCMARKER: return "PCMarker"; 2670 case ISD::READCYCLECOUNTER: return "ReadCycleCounter"; 2671 case ISD::SRCVALUE: return "SrcValue"; 2672 case ISD::EntryToken: return "EntryToken"; 2673 case ISD::TokenFactor: return "TokenFactor"; 2674 case ISD::AssertSext: return "AssertSext"; 2675 case ISD::AssertZext: return "AssertZext"; 2676 2677 case ISD::STRING: return "String"; 2678 case ISD::BasicBlock: return "BasicBlock"; 2679 case ISD::VALUETYPE: return "ValueType"; 2680 case ISD::Register: return "Register"; 2681 2682 case ISD::Constant: return "Constant"; 2683 case ISD::ConstantFP: return "ConstantFP"; 2684 case ISD::GlobalAddress: return "GlobalAddress"; 2685 case ISD::FrameIndex: return "FrameIndex"; 2686 case ISD::JumpTable: return "JumpTable"; 2687 case ISD::GLOBAL_OFFSET_TABLE: return "GLOBAL_OFFSET_TABLE"; 2688 case ISD::RETURNADDR: return "RETURNADDR"; 2689 case ISD::FRAMEADDR: return "FRAMEADDR"; 2690 case ISD::EXCEPTIONADDR: return "EXCEPTIONADDR"; 2691 case ISD::EHSELECTION: return "EHSELECTION"; 2692 case ISD::ConstantPool: return "ConstantPool"; 2693 case ISD::ExternalSymbol: return "ExternalSymbol"; 2694 case ISD::INTRINSIC_WO_CHAIN: { 2695 unsigned IID = cast<ConstantSDNode>(getOperand(0))->getValue(); 2696 return Intrinsic::getName((Intrinsic::ID)IID); 2697 } 2698 case ISD::INTRINSIC_VOID: 2699 case ISD::INTRINSIC_W_CHAIN: { 2700 unsigned IID = cast<ConstantSDNode>(getOperand(1))->getValue(); 2701 return Intrinsic::getName((Intrinsic::ID)IID); 2702 } 2703 2704 case ISD::BUILD_VECTOR: return "BUILD_VECTOR"; 2705 case ISD::TargetConstant: return "TargetConstant"; 2706 case ISD::TargetConstantFP:return "TargetConstantFP"; 2707 case ISD::TargetGlobalAddress: return "TargetGlobalAddress"; 2708 case ISD::TargetFrameIndex: return "TargetFrameIndex"; 2709 case ISD::TargetJumpTable: return "TargetJumpTable"; 2710 case ISD::TargetConstantPool: return "TargetConstantPool"; 2711 case ISD::TargetExternalSymbol: return "TargetExternalSymbol"; 2712 2713 case ISD::CopyToReg: return "CopyToReg"; 2714 case ISD::CopyFromReg: return "CopyFromReg"; 2715 case ISD::UNDEF: return "undef"; 2716 case ISD::MERGE_VALUES: return "mergevalues"; 2717 case ISD::INLINEASM: return "inlineasm"; 2718 case ISD::LABEL: return "label"; 2719 case ISD::HANDLENODE: return "handlenode"; 2720 case ISD::FORMAL_ARGUMENTS: return "formal_arguments"; 2721 case ISD::CALL: return "call"; 2722 2723 // Unary operators 2724 case ISD::FABS: return "fabs"; 2725 case ISD::FNEG: return "fneg"; 2726 case ISD::FSQRT: return "fsqrt"; 2727 case ISD::FSIN: return "fsin"; 2728 case ISD::FCOS: return "fcos"; 2729 case ISD::FPOWI: return "fpowi"; 2730 2731 // Binary operators 2732 case ISD::ADD: return "add"; 2733 case ISD::SUB: return "sub"; 2734 case ISD::MUL: return "mul"; 2735 case ISD::MULHU: return "mulhu"; 2736 case ISD::MULHS: return "mulhs"; 2737 case ISD::SDIV: return "sdiv"; 2738 case ISD::UDIV: return "udiv"; 2739 case ISD::SREM: return "srem"; 2740 case ISD::UREM: return "urem"; 2741 case ISD::AND: return "and"; 2742 case ISD::OR: return "or"; 2743 case ISD::XOR: return "xor"; 2744 case ISD::SHL: return "shl"; 2745 case ISD::SRA: return "sra"; 2746 case ISD::SRL: return "srl"; 2747 case ISD::ROTL: return "rotl"; 2748 case ISD::ROTR: return "rotr"; 2749 case ISD::FADD: return "fadd"; 2750 case ISD::FSUB: return "fsub"; 2751 case ISD::FMUL: return "fmul"; 2752 case ISD::FDIV: return "fdiv"; 2753 case ISD::FREM: return "frem"; 2754 case ISD::FCOPYSIGN: return "fcopysign"; 2755 case ISD::VADD: return "vadd"; 2756 case ISD::VSUB: return "vsub"; 2757 case ISD::VMUL: return "vmul"; 2758 case ISD::VSDIV: return "vsdiv"; 2759 case ISD::VUDIV: return "vudiv"; 2760 case ISD::VAND: return "vand"; 2761 case ISD::VOR: return "vor"; 2762 case ISD::VXOR: return "vxor"; 2763 2764 case ISD::SETCC: return "setcc"; 2765 case ISD::SELECT: return "select"; 2766 case ISD::SELECT_CC: return "select_cc"; 2767 case ISD::VSELECT: return "vselect"; 2768 case ISD::INSERT_VECTOR_ELT: return "insert_vector_elt"; 2769 case ISD::VINSERT_VECTOR_ELT: return "vinsert_vector_elt"; 2770 case ISD::EXTRACT_VECTOR_ELT: return "extract_vector_elt"; 2771 case ISD::VEXTRACT_VECTOR_ELT: return "vextract_vector_elt"; 2772 case ISD::SCALAR_TO_VECTOR: return "scalar_to_vector"; 2773 case ISD::VBUILD_VECTOR: return "vbuild_vector"; 2774 case ISD::VECTOR_SHUFFLE: return "vector_shuffle"; 2775 case ISD::VVECTOR_SHUFFLE: return "vvector_shuffle"; 2776 case ISD::VBIT_CONVERT: return "vbit_convert"; 2777 case ISD::CARRY_FALSE: return "carry_false"; 2778 case ISD::ADDC: return "addc"; 2779 case ISD::ADDE: return "adde"; 2780 case ISD::SUBC: return "subc"; 2781 case ISD::SUBE: return "sube"; 2782 case ISD::SHL_PARTS: return "shl_parts"; 2783 case ISD::SRA_PARTS: return "sra_parts"; 2784 case ISD::SRL_PARTS: return "srl_parts"; 2785 2786 // Conversion operators. 2787 case ISD::SIGN_EXTEND: return "sign_extend"; 2788 case ISD::ZERO_EXTEND: return "zero_extend"; 2789 case ISD::ANY_EXTEND: return "any_extend"; 2790 case ISD::SIGN_EXTEND_INREG: return "sign_extend_inreg"; 2791 case ISD::TRUNCATE: return "truncate"; 2792 case ISD::FP_ROUND: return "fp_round"; 2793 case ISD::FP_ROUND_INREG: return "fp_round_inreg"; 2794 case ISD::FP_EXTEND: return "fp_extend"; 2795 2796 case ISD::SINT_TO_FP: return "sint_to_fp"; 2797 case ISD::UINT_TO_FP: return "uint_to_fp"; 2798 case ISD::FP_TO_SINT: return "fp_to_sint"; 2799 case ISD::FP_TO_UINT: return "fp_to_uint"; 2800 case ISD::BIT_CONVERT: return "bit_convert"; 2801 2802 // Control flow instructions 2803 case ISD::BR: return "br"; 2804 case ISD::BRIND: return "brind"; 2805 case ISD::BR_JT: return "br_jt"; 2806 case ISD::BRCOND: return "brcond"; 2807 case ISD::BR_CC: return "br_cc"; 2808 case ISD::RET: return "ret"; 2809 case ISD::CALLSEQ_START: return "callseq_start"; 2810 case ISD::CALLSEQ_END: return "callseq_end"; 2811 2812 // Other operators 2813 case ISD::LOAD: return "load"; 2814 case ISD::STORE: return "store"; 2815 case ISD::VLOAD: return "vload"; 2816 case ISD::VAARG: return "vaarg"; 2817 case ISD::VACOPY: return "vacopy"; 2818 case ISD::VAEND: return "vaend"; 2819 case ISD::VASTART: return "vastart"; 2820 case ISD::DYNAMIC_STACKALLOC: return "dynamic_stackalloc"; 2821 case ISD::EXTRACT_ELEMENT: return "extract_element"; 2822 case ISD::BUILD_PAIR: return "build_pair"; 2823 case ISD::STACKSAVE: return "stacksave"; 2824 case ISD::STACKRESTORE: return "stackrestore"; 2825 2826 // Block memory operations. 2827 case ISD::MEMSET: return "memset"; 2828 case ISD::MEMCPY: return "memcpy"; 2829 case ISD::MEMMOVE: return "memmove"; 2830 2831 // Bit manipulation 2832 case ISD::BSWAP: return "bswap"; 2833 case ISD::CTPOP: return "ctpop"; 2834 case ISD::CTTZ: return "cttz"; 2835 case ISD::CTLZ: return "ctlz"; 2836 2837 // Debug info 2838 case ISD::LOCATION: return "location"; 2839 case ISD::DEBUG_LOC: return "debug_loc"; 2840 2841 case ISD::CONDCODE: 2842 switch (cast<CondCodeSDNode>(this)->get()) { 2843 default: assert(0 && "Unknown setcc condition!"); 2844 case ISD::SETOEQ: return "setoeq"; 2845 case ISD::SETOGT: return "setogt"; 2846 case ISD::SETOGE: return "setoge"; 2847 case ISD::SETOLT: return "setolt"; 2848 case ISD::SETOLE: return "setole"; 2849 case ISD::SETONE: return "setone"; 2850 2851 case ISD::SETO: return "seto"; 2852 case ISD::SETUO: return "setuo"; 2853 case ISD::SETUEQ: return "setue"; 2854 case ISD::SETUGT: return "setugt"; 2855 case ISD::SETUGE: return "setuge"; 2856 case ISD::SETULT: return "setult"; 2857 case ISD::SETULE: return "setule"; 2858 case ISD::SETUNE: return "setune"; 2859 2860 case ISD::SETEQ: return "seteq"; 2861 case ISD::SETGT: return "setgt"; 2862 case ISD::SETGE: return "setge"; 2863 case ISD::SETLT: return "setlt"; 2864 case ISD::SETLE: return "setle"; 2865 case ISD::SETNE: return "setne"; 2866 } 2867 } 2868} 2869 2870const char *SDNode::getIndexedModeName(ISD::MemIndexedMode AM) { 2871 switch (AM) { 2872 default: 2873 return ""; 2874 case ISD::PRE_INC: 2875 return "<pre-inc>"; 2876 case ISD::PRE_DEC: 2877 return "<pre-dec>"; 2878 case ISD::POST_INC: 2879 return "<post-inc>"; 2880 case ISD::POST_DEC: 2881 return "<post-dec>"; 2882 } 2883} 2884 2885void SDNode::dump() const { dump(0); } 2886void SDNode::dump(const SelectionDAG *G) const { 2887 cerr << (void*)this << ": "; 2888 2889 for (unsigned i = 0, e = getNumValues(); i != e; ++i) { 2890 if (i) cerr << ","; 2891 if (getValueType(i) == MVT::Other) 2892 cerr << "ch"; 2893 else 2894 cerr << MVT::getValueTypeString(getValueType(i)); 2895 } 2896 cerr << " = " << getOperationName(G); 2897 2898 cerr << " "; 2899 for (unsigned i = 0, e = getNumOperands(); i != e; ++i) { 2900 if (i) cerr << ", "; 2901 cerr << (void*)getOperand(i).Val; 2902 if (unsigned RN = getOperand(i).ResNo) 2903 cerr << ":" << RN; 2904 } 2905 2906 if (const ConstantSDNode *CSDN = dyn_cast<ConstantSDNode>(this)) { 2907 cerr << "<" << CSDN->getValue() << ">"; 2908 } else if (const ConstantFPSDNode *CSDN = dyn_cast<ConstantFPSDNode>(this)) { 2909 cerr << "<" << CSDN->getValue() << ">"; 2910 } else if (const GlobalAddressSDNode *GADN = 2911 dyn_cast<GlobalAddressSDNode>(this)) { 2912 int offset = GADN->getOffset(); 2913 cerr << "<"; 2914 WriteAsOperand(*cerr.stream(), GADN->getGlobal()) << ">"; 2915 if (offset > 0) 2916 cerr << " + " << offset; 2917 else 2918 cerr << " " << offset; 2919 } else if (const FrameIndexSDNode *FIDN = dyn_cast<FrameIndexSDNode>(this)) { 2920 cerr << "<" << FIDN->getIndex() << ">"; 2921 } else if (const JumpTableSDNode *JTDN = dyn_cast<JumpTableSDNode>(this)) { 2922 cerr << "<" << JTDN->getIndex() << ">"; 2923 } else if (const ConstantPoolSDNode *CP = dyn_cast<ConstantPoolSDNode>(this)){ 2924 int offset = CP->getOffset(); 2925 if (CP->isMachineConstantPoolEntry()) 2926 cerr << "<" << *CP->getMachineCPVal() << ">"; 2927 else 2928 cerr << "<" << *CP->getConstVal() << ">"; 2929 if (offset > 0) 2930 cerr << " + " << offset; 2931 else 2932 cerr << " " << offset; 2933 } else if (const BasicBlockSDNode *BBDN = dyn_cast<BasicBlockSDNode>(this)) { 2934 cerr << "<"; 2935 const Value *LBB = (const Value*)BBDN->getBasicBlock()->getBasicBlock(); 2936 if (LBB) 2937 cerr << LBB->getName() << " "; 2938 cerr << (const void*)BBDN->getBasicBlock() << ">"; 2939 } else if (const RegisterSDNode *R = dyn_cast<RegisterSDNode>(this)) { 2940 if (G && R->getReg() && MRegisterInfo::isPhysicalRegister(R->getReg())) { 2941 cerr << " " <<G->getTarget().getRegisterInfo()->getName(R->getReg()); 2942 } else { 2943 cerr << " #" << R->getReg(); 2944 } 2945 } else if (const ExternalSymbolSDNode *ES = 2946 dyn_cast<ExternalSymbolSDNode>(this)) { 2947 cerr << "'" << ES->getSymbol() << "'"; 2948 } else if (const SrcValueSDNode *M = dyn_cast<SrcValueSDNode>(this)) { 2949 if (M->getValue()) 2950 cerr << "<" << M->getValue() << ":" << M->getOffset() << ">"; 2951 else 2952 cerr << "<null:" << M->getOffset() << ">"; 2953 } else if (const VTSDNode *N = dyn_cast<VTSDNode>(this)) { 2954 cerr << ":" << getValueTypeString(N->getVT()); 2955 } else if (const LoadSDNode *LD = dyn_cast<LoadSDNode>(this)) { 2956 bool doExt = true; 2957 switch (LD->getExtensionType()) { 2958 default: doExt = false; break; 2959 case ISD::EXTLOAD: 2960 cerr << " <anyext "; 2961 break; 2962 case ISD::SEXTLOAD: 2963 cerr << " <sext "; 2964 break; 2965 case ISD::ZEXTLOAD: 2966 cerr << " <zext "; 2967 break; 2968 } 2969 if (doExt) 2970 cerr << MVT::getValueTypeString(LD->getLoadedVT()) << ">"; 2971 2972 const char *AM = getIndexedModeName(LD->getAddressingMode()); 2973 if (AM != "") 2974 cerr << " " << AM; 2975 } else if (const StoreSDNode *ST = dyn_cast<StoreSDNode>(this)) { 2976 if (ST->isTruncatingStore()) 2977 cerr << " <trunc " 2978 << MVT::getValueTypeString(ST->getStoredVT()) << ">"; 2979 2980 const char *AM = getIndexedModeName(ST->getAddressingMode()); 2981 if (AM != "") 2982 cerr << " " << AM; 2983 } 2984} 2985 2986static void DumpNodes(const SDNode *N, unsigned indent, const SelectionDAG *G) { 2987 for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i) 2988 if (N->getOperand(i).Val->hasOneUse()) 2989 DumpNodes(N->getOperand(i).Val, indent+2, G); 2990 else 2991 cerr << "\n" << std::string(indent+2, ' ') 2992 << (void*)N->getOperand(i).Val << ": <multiple use>"; 2993 2994 2995 cerr << "\n" << std::string(indent, ' '); 2996 N->dump(G); 2997} 2998 2999void SelectionDAG::dump() const { 3000 cerr << "SelectionDAG has " << AllNodes.size() << " nodes:"; 3001 std::vector<const SDNode*> Nodes; 3002 for (allnodes_const_iterator I = allnodes_begin(), E = allnodes_end(); 3003 I != E; ++I) 3004 Nodes.push_back(I); 3005 3006 std::sort(Nodes.begin(), Nodes.end()); 3007 3008 for (unsigned i = 0, e = Nodes.size(); i != e; ++i) { 3009 if (!Nodes[i]->hasOneUse() && Nodes[i] != getRoot().Val) 3010 DumpNodes(Nodes[i], 2, this); 3011 } 3012 3013 if (getRoot().Val) DumpNodes(getRoot().Val, 2, this); 3014 3015 cerr << "\n\n"; 3016} 3017 3018const Type *ConstantPoolSDNode::getType() const { 3019 if (isMachineConstantPoolEntry()) 3020 return Val.MachineCPVal->getType(); 3021 return Val.ConstVal->getType(); 3022} 3023