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