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