SelectionDAG.cpp revision 0fcd40f501d99ce50b23f67e578a37f0943dec36
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/StringExtras.h" 25#include <iostream> 26#include <set> 27#include <cmath> 28#include <algorithm> 29using namespace llvm; 30 31static bool isCommutativeBinOp(unsigned Opcode) { 32 switch (Opcode) { 33 case ISD::ADD: 34 case ISD::MUL: 35 case ISD::FADD: 36 case ISD::FMUL: 37 case ISD::AND: 38 case ISD::OR: 39 case ISD::XOR: return true; 40 default: return false; // FIXME: Need commutative info for user ops! 41 } 42} 43 44static bool isAssociativeBinOp(unsigned Opcode) { 45 switch (Opcode) { 46 case ISD::ADD: 47 case ISD::MUL: 48 case ISD::AND: 49 case ISD::OR: 50 case ISD::XOR: return true; 51 default: return false; // FIXME: Need associative info for user ops! 52 } 53} 54 55// isInvertibleForFree - Return true if there is no cost to emitting the logical 56// inverse of this node. 57static bool isInvertibleForFree(SDOperand N) { 58 if (isa<ConstantSDNode>(N.Val)) return true; 59 if (N.Val->getOpcode() == ISD::SETCC && N.Val->hasOneUse()) 60 return true; 61 return false; 62} 63 64//===----------------------------------------------------------------------===// 65// ConstantFPSDNode Class 66//===----------------------------------------------------------------------===// 67 68/// isExactlyValue - We don't rely on operator== working on double values, as 69/// it returns true for things that are clearly not equal, like -0.0 and 0.0. 70/// As such, this method can be used to do an exact bit-for-bit comparison of 71/// two floating point values. 72bool ConstantFPSDNode::isExactlyValue(double V) const { 73 return DoubleToBits(V) == DoubleToBits(Value); 74} 75 76//===----------------------------------------------------------------------===// 77// ISD Class 78//===----------------------------------------------------------------------===// 79 80/// getSetCCSwappedOperands - Return the operation corresponding to (Y op X) 81/// when given the operation for (X op Y). 82ISD::CondCode ISD::getSetCCSwappedOperands(ISD::CondCode Operation) { 83 // To perform this operation, we just need to swap the L and G bits of the 84 // operation. 85 unsigned OldL = (Operation >> 2) & 1; 86 unsigned OldG = (Operation >> 1) & 1; 87 return ISD::CondCode((Operation & ~6) | // Keep the N, U, E bits 88 (OldL << 1) | // New G bit 89 (OldG << 2)); // New L bit. 90} 91 92/// getSetCCInverse - Return the operation corresponding to !(X op Y), where 93/// 'op' is a valid SetCC operation. 94ISD::CondCode ISD::getSetCCInverse(ISD::CondCode Op, bool isInteger) { 95 unsigned Operation = Op; 96 if (isInteger) 97 Operation ^= 7; // Flip L, G, E bits, but not U. 98 else 99 Operation ^= 15; // Flip all of the condition bits. 100 if (Operation > ISD::SETTRUE2) 101 Operation &= ~8; // Don't let N and U bits get set. 102 return ISD::CondCode(Operation); 103} 104 105 106/// isSignedOp - For an integer comparison, return 1 if the comparison is a 107/// signed operation and 2 if the result is an unsigned comparison. Return zero 108/// if the operation does not depend on the sign of the input (setne and seteq). 109static int isSignedOp(ISD::CondCode Opcode) { 110 switch (Opcode) { 111 default: assert(0 && "Illegal integer setcc operation!"); 112 case ISD::SETEQ: 113 case ISD::SETNE: return 0; 114 case ISD::SETLT: 115 case ISD::SETLE: 116 case ISD::SETGT: 117 case ISD::SETGE: return 1; 118 case ISD::SETULT: 119 case ISD::SETULE: 120 case ISD::SETUGT: 121 case ISD::SETUGE: return 2; 122 } 123} 124 125/// getSetCCOrOperation - Return the result of a logical OR between different 126/// comparisons of identical values: ((X op1 Y) | (X op2 Y)). This function 127/// returns SETCC_INVALID if it is not possible to represent the resultant 128/// comparison. 129ISD::CondCode ISD::getSetCCOrOperation(ISD::CondCode Op1, ISD::CondCode Op2, 130 bool isInteger) { 131 if (isInteger && (isSignedOp(Op1) | isSignedOp(Op2)) == 3) 132 // Cannot fold a signed integer setcc with an unsigned integer setcc. 133 return ISD::SETCC_INVALID; 134 135 unsigned Op = Op1 | Op2; // Combine all of the condition bits. 136 137 // If the N and U bits get set then the resultant comparison DOES suddenly 138 // care about orderedness, and is true when ordered. 139 if (Op > ISD::SETTRUE2) 140 Op &= ~16; // Clear the N bit. 141 return ISD::CondCode(Op); 142} 143 144/// getSetCCAndOperation - Return the result of a logical AND between different 145/// comparisons of identical values: ((X op1 Y) & (X op2 Y)). This 146/// function returns zero if it is not possible to represent the resultant 147/// comparison. 148ISD::CondCode ISD::getSetCCAndOperation(ISD::CondCode Op1, ISD::CondCode Op2, 149 bool isInteger) { 150 if (isInteger && (isSignedOp(Op1) | isSignedOp(Op2)) == 3) 151 // Cannot fold a signed setcc with an unsigned setcc. 152 return ISD::SETCC_INVALID; 153 154 // Combine all of the condition bits. 155 return ISD::CondCode(Op1 & Op2); 156} 157 158const TargetMachine &SelectionDAG::getTarget() const { 159 return TLI.getTargetMachine(); 160} 161 162//===----------------------------------------------------------------------===// 163// SelectionDAG Class 164//===----------------------------------------------------------------------===// 165 166/// RemoveDeadNodes - This method deletes all unreachable nodes in the 167/// SelectionDAG, including nodes (like loads) that have uses of their token 168/// chain but no other uses and no side effect. If a node is passed in as an 169/// argument, it is used as the seed for node deletion. 170void SelectionDAG::RemoveDeadNodes(SDNode *N) { 171 // Create a dummy node (which is not added to allnodes), that adds a reference 172 // to the root node, preventing it from being deleted. 173 HandleSDNode Dummy(getRoot()); 174 175 bool MadeChange = false; 176 177 // If we have a hint to start from, use it. 178 if (N && N->use_empty()) { 179 DestroyDeadNode(N); 180 MadeChange = true; 181 } 182 183 for (allnodes_iterator I = allnodes_begin(), E = allnodes_end(); I != E; ++I) 184 if (I->use_empty() && I->getOpcode() != 65535) { 185 // Node is dead, recursively delete newly dead uses. 186 DestroyDeadNode(I); 187 MadeChange = true; 188 } 189 190 // Walk the nodes list, removing the nodes we've marked as dead. 191 if (MadeChange) { 192 for (allnodes_iterator I = allnodes_begin(), E = allnodes_end(); I != E; ) { 193 SDNode *N = I++; 194 if (N->use_empty()) 195 AllNodes.erase(N); 196 } 197 } 198 199 // If the root changed (e.g. it was a dead load, update the root). 200 setRoot(Dummy.getValue()); 201} 202 203/// DestroyDeadNode - We know that N is dead. Nuke it from the CSE maps for the 204/// graph. If it is the last user of any of its operands, recursively process 205/// them the same way. 206/// 207void SelectionDAG::DestroyDeadNode(SDNode *N) { 208 // Okay, we really are going to delete this node. First take this out of the 209 // appropriate CSE map. 210 RemoveNodeFromCSEMaps(N); 211 212 // Next, brutally remove the operand list. This is safe to do, as there are 213 // no cycles in the graph. 214 for (SDNode::op_iterator I = N->op_begin(), E = N->op_end(); I != E; ++I) { 215 SDNode *O = I->Val; 216 O->removeUser(N); 217 218 // Now that we removed this operand, see if there are no uses of it left. 219 if (O->use_empty()) 220 DestroyDeadNode(O); 221 } 222 delete[] N->OperandList; 223 N->OperandList = 0; 224 N->NumOperands = 0; 225 226 // Mark the node as dead. 227 N->MorphNodeTo(65535); 228} 229 230void SelectionDAG::DeleteNode(SDNode *N) { 231 assert(N->use_empty() && "Cannot delete a node that is not dead!"); 232 233 // First take this out of the appropriate CSE map. 234 RemoveNodeFromCSEMaps(N); 235 236 // Finally, remove uses due to operands of this node, remove from the 237 // AllNodes list, and delete the node. 238 DeleteNodeNotInCSEMaps(N); 239} 240 241void SelectionDAG::DeleteNodeNotInCSEMaps(SDNode *N) { 242 243 // Remove it from the AllNodes list. 244 AllNodes.remove(N); 245 246 // Drop all of the operands and decrement used nodes use counts. 247 for (SDNode::op_iterator I = N->op_begin(), E = N->op_end(); I != E; ++I) 248 I->Val->removeUser(N); 249 delete[] N->OperandList; 250 N->OperandList = 0; 251 N->NumOperands = 0; 252 253 delete N; 254} 255 256/// RemoveNodeFromCSEMaps - Take the specified node out of the CSE map that 257/// correspond to it. This is useful when we're about to delete or repurpose 258/// the node. We don't want future request for structurally identical nodes 259/// to return N anymore. 260void SelectionDAG::RemoveNodeFromCSEMaps(SDNode *N) { 261 bool Erased = false; 262 switch (N->getOpcode()) { 263 case ISD::HANDLENODE: return; // noop. 264 case ISD::Constant: 265 Erased = Constants.erase(std::make_pair(cast<ConstantSDNode>(N)->getValue(), 266 N->getValueType(0))); 267 break; 268 case ISD::TargetConstant: 269 Erased = TargetConstants.erase(std::make_pair( 270 cast<ConstantSDNode>(N)->getValue(), 271 N->getValueType(0))); 272 break; 273 case ISD::ConstantFP: { 274 uint64_t V = DoubleToBits(cast<ConstantFPSDNode>(N)->getValue()); 275 Erased = ConstantFPs.erase(std::make_pair(V, N->getValueType(0))); 276 break; 277 } 278 case ISD::STRING: 279 Erased = StringNodes.erase(cast<StringSDNode>(N)->getValue()); 280 break; 281 case ISD::CONDCODE: 282 assert(CondCodeNodes[cast<CondCodeSDNode>(N)->get()] && 283 "Cond code doesn't exist!"); 284 Erased = CondCodeNodes[cast<CondCodeSDNode>(N)->get()] != 0; 285 CondCodeNodes[cast<CondCodeSDNode>(N)->get()] = 0; 286 break; 287 case ISD::GlobalAddress: { 288 GlobalAddressSDNode *GN = cast<GlobalAddressSDNode>(N); 289 Erased = GlobalValues.erase(std::make_pair(GN->getGlobal(), 290 GN->getOffset())); 291 break; 292 } 293 case ISD::TargetGlobalAddress: { 294 GlobalAddressSDNode *GN = cast<GlobalAddressSDNode>(N); 295 Erased =TargetGlobalValues.erase(std::make_pair(GN->getGlobal(), 296 GN->getOffset())); 297 break; 298 } 299 case ISD::FrameIndex: 300 Erased = FrameIndices.erase(cast<FrameIndexSDNode>(N)->getIndex()); 301 break; 302 case ISD::TargetFrameIndex: 303 Erased = TargetFrameIndices.erase(cast<FrameIndexSDNode>(N)->getIndex()); 304 break; 305 case ISD::ConstantPool: 306 Erased = ConstantPoolIndices.erase(cast<ConstantPoolSDNode>(N)->get()); 307 break; 308 case ISD::TargetConstantPool: 309 Erased =TargetConstantPoolIndices.erase(cast<ConstantPoolSDNode>(N)->get()); 310 break; 311 case ISD::BasicBlock: 312 Erased = BBNodes.erase(cast<BasicBlockSDNode>(N)->getBasicBlock()); 313 break; 314 case ISD::ExternalSymbol: 315 Erased = ExternalSymbols.erase(cast<ExternalSymbolSDNode>(N)->getSymbol()); 316 break; 317 case ISD::TargetExternalSymbol: 318 Erased = TargetExternalSymbols.erase(cast<ExternalSymbolSDNode>(N)->getSymbol()); 319 break; 320 case ISD::VALUETYPE: 321 Erased = ValueTypeNodes[cast<VTSDNode>(N)->getVT()] != 0; 322 ValueTypeNodes[cast<VTSDNode>(N)->getVT()] = 0; 323 break; 324 case ISD::Register: 325 Erased = RegNodes.erase(std::make_pair(cast<RegisterSDNode>(N)->getReg(), 326 N->getValueType(0))); 327 break; 328 case ISD::SRCVALUE: { 329 SrcValueSDNode *SVN = cast<SrcValueSDNode>(N); 330 Erased =ValueNodes.erase(std::make_pair(SVN->getValue(), SVN->getOffset())); 331 break; 332 } 333 case ISD::LOAD: 334 Erased = Loads.erase(std::make_pair(N->getOperand(1), 335 std::make_pair(N->getOperand(0), 336 N->getValueType(0)))); 337 break; 338 default: 339 if (N->getNumValues() == 1) { 340 if (N->getNumOperands() == 0) { 341 Erased = NullaryOps.erase(std::make_pair(N->getOpcode(), 342 N->getValueType(0))); 343 } else if (N->getNumOperands() == 1) { 344 Erased = 345 UnaryOps.erase(std::make_pair(N->getOpcode(), 346 std::make_pair(N->getOperand(0), 347 N->getValueType(0)))); 348 } else if (N->getNumOperands() == 2) { 349 Erased = 350 BinaryOps.erase(std::make_pair(N->getOpcode(), 351 std::make_pair(N->getOperand(0), 352 N->getOperand(1)))); 353 } else { 354 std::vector<SDOperand> Ops(N->op_begin(), N->op_end()); 355 Erased = 356 OneResultNodes.erase(std::make_pair(N->getOpcode(), 357 std::make_pair(N->getValueType(0), 358 Ops))); 359 } 360 } else { 361 // Remove the node from the ArbitraryNodes map. 362 std::vector<MVT::ValueType> RV(N->value_begin(), N->value_end()); 363 std::vector<SDOperand> Ops(N->op_begin(), N->op_end()); 364 Erased = 365 ArbitraryNodes.erase(std::make_pair(N->getOpcode(), 366 std::make_pair(RV, Ops))); 367 } 368 break; 369 } 370#ifndef NDEBUG 371 // Verify that the node was actually in one of the CSE maps, unless it has a 372 // flag result (which cannot be CSE'd) or is one of the special cases that are 373 // not subject to CSE. 374 if (!Erased && N->getValueType(N->getNumValues()-1) != MVT::Flag && 375 N->getOpcode() != ISD::CALL && N->getOpcode() != ISD::CALLSEQ_START && 376 N->getOpcode() != ISD::CALLSEQ_END && !N->isTargetOpcode()) { 377 378 N->dump(); 379 assert(0 && "Node is not in map!"); 380 } 381#endif 382} 383 384/// AddNonLeafNodeToCSEMaps - Add the specified node back to the CSE maps. It 385/// has been taken out and modified in some way. If the specified node already 386/// exists in the CSE maps, do not modify the maps, but return the existing node 387/// instead. If it doesn't exist, add it and return null. 388/// 389SDNode *SelectionDAG::AddNonLeafNodeToCSEMaps(SDNode *N) { 390 assert(N->getNumOperands() && "This is a leaf node!"); 391 if (N->getOpcode() == ISD::CALLSEQ_START || 392 N->getOpcode() == ISD::CALLSEQ_END || 393 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 442 443SelectionDAG::~SelectionDAG() { 444 while (!AllNodes.empty()) { 445 SDNode *N = AllNodes.begin(); 446 delete [] N->OperandList; 447 N->OperandList = 0; 448 N->NumOperands = 0; 449 AllNodes.pop_front(); 450 } 451} 452 453SDOperand SelectionDAG::getZeroExtendInReg(SDOperand Op, MVT::ValueType VT) { 454 if (Op.getValueType() == VT) return Op; 455 int64_t Imm = ~0ULL >> (64-MVT::getSizeInBits(VT)); 456 return getNode(ISD::AND, Op.getValueType(), Op, 457 getConstant(Imm, Op.getValueType())); 458} 459 460SDOperand SelectionDAG::getConstant(uint64_t Val, MVT::ValueType VT) { 461 assert(MVT::isInteger(VT) && "Cannot create FP integer constant!"); 462 // Mask out any bits that are not valid for this constant. 463 if (VT != MVT::i64) 464 Val &= ((uint64_t)1 << MVT::getSizeInBits(VT)) - 1; 465 466 SDNode *&N = Constants[std::make_pair(Val, VT)]; 467 if (N) return SDOperand(N, 0); 468 N = new ConstantSDNode(false, Val, VT); 469 AllNodes.push_back(N); 470 return SDOperand(N, 0); 471} 472 473SDOperand SelectionDAG::getString(const std::string &Val) { 474 StringSDNode *&N = StringNodes[Val]; 475 if (!N) { 476 N = new StringSDNode(Val); 477 AllNodes.push_back(N); 478 } 479 return SDOperand(N, 0); 480} 481 482SDOperand SelectionDAG::getTargetConstant(uint64_t Val, MVT::ValueType VT) { 483 assert(MVT::isInteger(VT) && "Cannot create FP integer constant!"); 484 // Mask out any bits that are not valid for this constant. 485 if (VT != MVT::i64) 486 Val &= ((uint64_t)1 << MVT::getSizeInBits(VT)) - 1; 487 488 SDNode *&N = TargetConstants[std::make_pair(Val, VT)]; 489 if (N) return SDOperand(N, 0); 490 N = new ConstantSDNode(true, Val, VT); 491 AllNodes.push_back(N); 492 return SDOperand(N, 0); 493} 494 495SDOperand SelectionDAG::getConstantFP(double Val, MVT::ValueType VT) { 496 assert(MVT::isFloatingPoint(VT) && "Cannot create integer FP constant!"); 497 if (VT == MVT::f32) 498 Val = (float)Val; // Mask out extra precision. 499 500 // Do the map lookup using the actual bit pattern for the floating point 501 // value, so that we don't have problems with 0.0 comparing equal to -0.0, and 502 // we don't have issues with SNANs. 503 SDNode *&N = ConstantFPs[std::make_pair(DoubleToBits(Val), VT)]; 504 if (N) return SDOperand(N, 0); 505 N = new ConstantFPSDNode(Val, VT); 506 AllNodes.push_back(N); 507 return SDOperand(N, 0); 508} 509 510SDOperand SelectionDAG::getGlobalAddress(const GlobalValue *GV, 511 MVT::ValueType VT, int offset) { 512 SDNode *&N = GlobalValues[std::make_pair(GV, offset)]; 513 if (N) return SDOperand(N, 0); 514 N = new GlobalAddressSDNode(false, GV, VT); 515 AllNodes.push_back(N); 516 return SDOperand(N, 0); 517} 518 519SDOperand SelectionDAG::getTargetGlobalAddress(const GlobalValue *GV, 520 MVT::ValueType VT, int offset) { 521 SDNode *&N = TargetGlobalValues[std::make_pair(GV, offset)]; 522 if (N) return SDOperand(N, 0); 523 N = new GlobalAddressSDNode(true, GV, VT, offset); 524 AllNodes.push_back(N); 525 return SDOperand(N, 0); 526} 527 528SDOperand SelectionDAG::getFrameIndex(int FI, MVT::ValueType VT) { 529 SDNode *&N = FrameIndices[FI]; 530 if (N) return SDOperand(N, 0); 531 N = new FrameIndexSDNode(FI, VT, false); 532 AllNodes.push_back(N); 533 return SDOperand(N, 0); 534} 535 536SDOperand SelectionDAG::getTargetFrameIndex(int FI, MVT::ValueType VT) { 537 SDNode *&N = TargetFrameIndices[FI]; 538 if (N) return SDOperand(N, 0); 539 N = new FrameIndexSDNode(FI, VT, true); 540 AllNodes.push_back(N); 541 return SDOperand(N, 0); 542} 543 544SDOperand SelectionDAG::getConstantPool(Constant *C, MVT::ValueType VT) { 545 SDNode *&N = ConstantPoolIndices[C]; 546 if (N) return SDOperand(N, 0); 547 N = new ConstantPoolSDNode(C, VT, false); 548 AllNodes.push_back(N); 549 return SDOperand(N, 0); 550} 551 552SDOperand SelectionDAG::getTargetConstantPool(Constant *C, MVT::ValueType VT) { 553 SDNode *&N = TargetConstantPoolIndices[C]; 554 if (N) return SDOperand(N, 0); 555 N = new ConstantPoolSDNode(C, VT, true); 556 AllNodes.push_back(N); 557 return SDOperand(N, 0); 558} 559 560SDOperand SelectionDAG::getBasicBlock(MachineBasicBlock *MBB) { 561 SDNode *&N = BBNodes[MBB]; 562 if (N) return SDOperand(N, 0); 563 N = new BasicBlockSDNode(MBB); 564 AllNodes.push_back(N); 565 return SDOperand(N, 0); 566} 567 568SDOperand SelectionDAG::getValueType(MVT::ValueType VT) { 569 if ((unsigned)VT >= ValueTypeNodes.size()) 570 ValueTypeNodes.resize(VT+1); 571 if (ValueTypeNodes[VT] == 0) { 572 ValueTypeNodes[VT] = new VTSDNode(VT); 573 AllNodes.push_back(ValueTypeNodes[VT]); 574 } 575 576 return SDOperand(ValueTypeNodes[VT], 0); 577} 578 579SDOperand SelectionDAG::getExternalSymbol(const char *Sym, MVT::ValueType VT) { 580 SDNode *&N = ExternalSymbols[Sym]; 581 if (N) return SDOperand(N, 0); 582 N = new ExternalSymbolSDNode(false, Sym, VT); 583 AllNodes.push_back(N); 584 return SDOperand(N, 0); 585} 586 587SDOperand SelectionDAG::getTargetExternalSymbol(const char *Sym, MVT::ValueType VT) { 588 SDNode *&N = TargetExternalSymbols[Sym]; 589 if (N) return SDOperand(N, 0); 590 N = new ExternalSymbolSDNode(true, Sym, VT); 591 AllNodes.push_back(N); 592 return SDOperand(N, 0); 593} 594 595SDOperand SelectionDAG::getCondCode(ISD::CondCode Cond) { 596 if ((unsigned)Cond >= CondCodeNodes.size()) 597 CondCodeNodes.resize(Cond+1); 598 599 if (CondCodeNodes[Cond] == 0) { 600 CondCodeNodes[Cond] = new CondCodeSDNode(Cond); 601 AllNodes.push_back(CondCodeNodes[Cond]); 602 } 603 return SDOperand(CondCodeNodes[Cond], 0); 604} 605 606SDOperand SelectionDAG::getRegister(unsigned RegNo, MVT::ValueType VT) { 607 RegisterSDNode *&Reg = RegNodes[std::make_pair(RegNo, VT)]; 608 if (!Reg) { 609 Reg = new RegisterSDNode(RegNo, VT); 610 AllNodes.push_back(Reg); 611 } 612 return SDOperand(Reg, 0); 613} 614 615SDOperand SelectionDAG::SimplifySetCC(MVT::ValueType VT, SDOperand N1, 616 SDOperand N2, ISD::CondCode Cond) { 617 // These setcc operations always fold. 618 switch (Cond) { 619 default: break; 620 case ISD::SETFALSE: 621 case ISD::SETFALSE2: return getConstant(0, VT); 622 case ISD::SETTRUE: 623 case ISD::SETTRUE2: return getConstant(1, VT); 624 } 625 626 if (ConstantSDNode *N2C = dyn_cast<ConstantSDNode>(N2.Val)) { 627 uint64_t C2 = N2C->getValue(); 628 if (ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1.Val)) { 629 uint64_t C1 = N1C->getValue(); 630 631 // Sign extend the operands if required 632 if (ISD::isSignedIntSetCC(Cond)) { 633 C1 = N1C->getSignExtended(); 634 C2 = N2C->getSignExtended(); 635 } 636 637 switch (Cond) { 638 default: assert(0 && "Unknown integer setcc!"); 639 case ISD::SETEQ: return getConstant(C1 == C2, VT); 640 case ISD::SETNE: return getConstant(C1 != C2, VT); 641 case ISD::SETULT: return getConstant(C1 < C2, VT); 642 case ISD::SETUGT: return getConstant(C1 > C2, VT); 643 case ISD::SETULE: return getConstant(C1 <= C2, VT); 644 case ISD::SETUGE: return getConstant(C1 >= C2, VT); 645 case ISD::SETLT: return getConstant((int64_t)C1 < (int64_t)C2, VT); 646 case ISD::SETGT: return getConstant((int64_t)C1 > (int64_t)C2, VT); 647 case ISD::SETLE: return getConstant((int64_t)C1 <= (int64_t)C2, VT); 648 case ISD::SETGE: return getConstant((int64_t)C1 >= (int64_t)C2, VT); 649 } 650 } else { 651 // If the LHS is a ZERO_EXTEND, perform the comparison on the input. 652 if (N1.getOpcode() == ISD::ZERO_EXTEND) { 653 unsigned InSize = MVT::getSizeInBits(N1.getOperand(0).getValueType()); 654 655 // If the comparison constant has bits in the upper part, the 656 // zero-extended value could never match. 657 if (C2 & (~0ULL << InSize)) { 658 unsigned VSize = MVT::getSizeInBits(N1.getValueType()); 659 switch (Cond) { 660 case ISD::SETUGT: 661 case ISD::SETUGE: 662 case ISD::SETEQ: return getConstant(0, VT); 663 case ISD::SETULT: 664 case ISD::SETULE: 665 case ISD::SETNE: return getConstant(1, VT); 666 case ISD::SETGT: 667 case ISD::SETGE: 668 // True if the sign bit of C2 is set. 669 return getConstant((C2 & (1ULL << VSize)) != 0, VT); 670 case ISD::SETLT: 671 case ISD::SETLE: 672 // True if the sign bit of C2 isn't set. 673 return getConstant((C2 & (1ULL << VSize)) == 0, VT); 674 default: 675 break; 676 } 677 } 678 679 // Otherwise, we can perform the comparison with the low bits. 680 switch (Cond) { 681 case ISD::SETEQ: 682 case ISD::SETNE: 683 case ISD::SETUGT: 684 case ISD::SETUGE: 685 case ISD::SETULT: 686 case ISD::SETULE: 687 return getSetCC(VT, N1.getOperand(0), 688 getConstant(C2, N1.getOperand(0).getValueType()), 689 Cond); 690 default: 691 break; // todo, be more careful with signed comparisons 692 } 693 } else if (N1.getOpcode() == ISD::SIGN_EXTEND_INREG && 694 (Cond == ISD::SETEQ || Cond == ISD::SETNE)) { 695 MVT::ValueType ExtSrcTy = cast<VTSDNode>(N1.getOperand(1))->getVT(); 696 unsigned ExtSrcTyBits = MVT::getSizeInBits(ExtSrcTy); 697 MVT::ValueType ExtDstTy = N1.getValueType(); 698 unsigned ExtDstTyBits = MVT::getSizeInBits(ExtDstTy); 699 700 // If the extended part has any inconsistent bits, it cannot ever 701 // compare equal. In other words, they have to be all ones or all 702 // zeros. 703 uint64_t ExtBits = 704 (~0ULL >> (64-ExtSrcTyBits)) & (~0ULL << (ExtDstTyBits-1)); 705 if ((C2 & ExtBits) != 0 && (C2 & ExtBits) != ExtBits) 706 return getConstant(Cond == ISD::SETNE, VT); 707 708 // Otherwise, make this a use of a zext. 709 return getSetCC(VT, getZeroExtendInReg(N1.getOperand(0), ExtSrcTy), 710 getConstant(C2 & (~0ULL>>(64-ExtSrcTyBits)), ExtDstTy), 711 Cond); 712 } 713 714 uint64_t MinVal, MaxVal; 715 unsigned OperandBitSize = MVT::getSizeInBits(N2C->getValueType(0)); 716 if (ISD::isSignedIntSetCC(Cond)) { 717 MinVal = 1ULL << (OperandBitSize-1); 718 if (OperandBitSize != 1) // Avoid X >> 64, which is undefined. 719 MaxVal = ~0ULL >> (65-OperandBitSize); 720 else 721 MaxVal = 0; 722 } else { 723 MinVal = 0; 724 MaxVal = ~0ULL >> (64-OperandBitSize); 725 } 726 727 // Canonicalize GE/LE comparisons to use GT/LT comparisons. 728 if (Cond == ISD::SETGE || Cond == ISD::SETUGE) { 729 if (C2 == MinVal) return getConstant(1, VT); // X >= MIN --> true 730 --C2; // X >= C1 --> X > (C1-1) 731 return getSetCC(VT, N1, getConstant(C2, N2.getValueType()), 732 (Cond == ISD::SETGE) ? ISD::SETGT : ISD::SETUGT); 733 } 734 735 if (Cond == ISD::SETLE || Cond == ISD::SETULE) { 736 if (C2 == MaxVal) return getConstant(1, VT); // X <= MAX --> true 737 ++C2; // X <= C1 --> X < (C1+1) 738 return getSetCC(VT, N1, getConstant(C2, N2.getValueType()), 739 (Cond == ISD::SETLE) ? ISD::SETLT : ISD::SETULT); 740 } 741 742 if ((Cond == ISD::SETLT || Cond == ISD::SETULT) && C2 == MinVal) 743 return getConstant(0, VT); // X < MIN --> false 744 745 // Canonicalize setgt X, Min --> setne X, Min 746 if ((Cond == ISD::SETGT || Cond == ISD::SETUGT) && C2 == MinVal) 747 return getSetCC(VT, N1, N2, ISD::SETNE); 748 749 // If we have setult X, 1, turn it into seteq X, 0 750 if ((Cond == ISD::SETLT || Cond == ISD::SETULT) && C2 == MinVal+1) 751 return getSetCC(VT, N1, getConstant(MinVal, N1.getValueType()), 752 ISD::SETEQ); 753 // If we have setugt X, Max-1, turn it into seteq X, Max 754 else if ((Cond == ISD::SETGT || Cond == ISD::SETUGT) && C2 == MaxVal-1) 755 return getSetCC(VT, N1, getConstant(MaxVal, N1.getValueType()), 756 ISD::SETEQ); 757 758 // If we have "setcc X, C1", check to see if we can shrink the immediate 759 // by changing cc. 760 761 // SETUGT X, SINTMAX -> SETLT X, 0 762 if (Cond == ISD::SETUGT && OperandBitSize != 1 && 763 C2 == (~0ULL >> (65-OperandBitSize))) 764 return getSetCC(VT, N1, getConstant(0, N2.getValueType()), ISD::SETLT); 765 766 // FIXME: Implement the rest of these. 767 768 769 // Fold bit comparisons when we can. 770 if ((Cond == ISD::SETEQ || Cond == ISD::SETNE) && 771 VT == N1.getValueType() && N1.getOpcode() == ISD::AND) 772 if (ConstantSDNode *AndRHS = 773 dyn_cast<ConstantSDNode>(N1.getOperand(1))) { 774 if (Cond == ISD::SETNE && C2 == 0) {// (X & 8) != 0 --> (X & 8) >> 3 775 // Perform the xform if the AND RHS is a single bit. 776 if ((AndRHS->getValue() & (AndRHS->getValue()-1)) == 0) { 777 return getNode(ISD::SRL, VT, N1, 778 getConstant(Log2_64(AndRHS->getValue()), 779 TLI.getShiftAmountTy())); 780 } 781 } else if (Cond == ISD::SETEQ && C2 == AndRHS->getValue()) { 782 // (X & 8) == 8 --> (X & 8) >> 3 783 // Perform the xform if C2 is a single bit. 784 if ((C2 & (C2-1)) == 0) { 785 return getNode(ISD::SRL, VT, N1, 786 getConstant(Log2_64(C2),TLI.getShiftAmountTy())); 787 } 788 } 789 } 790 } 791 } else if (isa<ConstantSDNode>(N1.Val)) { 792 // Ensure that the constant occurs on the RHS. 793 return getSetCC(VT, N2, N1, ISD::getSetCCSwappedOperands(Cond)); 794 } 795 796 if (ConstantFPSDNode *N1C = dyn_cast<ConstantFPSDNode>(N1.Val)) 797 if (ConstantFPSDNode *N2C = dyn_cast<ConstantFPSDNode>(N2.Val)) { 798 double C1 = N1C->getValue(), C2 = N2C->getValue(); 799 800 switch (Cond) { 801 default: break; // FIXME: Implement the rest of these! 802 case ISD::SETEQ: return getConstant(C1 == C2, VT); 803 case ISD::SETNE: return getConstant(C1 != C2, VT); 804 case ISD::SETLT: return getConstant(C1 < C2, VT); 805 case ISD::SETGT: return getConstant(C1 > C2, VT); 806 case ISD::SETLE: return getConstant(C1 <= C2, VT); 807 case ISD::SETGE: return getConstant(C1 >= C2, VT); 808 } 809 } else { 810 // Ensure that the constant occurs on the RHS. 811 return getSetCC(VT, N2, N1, ISD::getSetCCSwappedOperands(Cond)); 812 } 813 814 // Could not fold it. 815 return SDOperand(); 816} 817 818/// getNode - Gets or creates the specified node. 819/// 820SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT) { 821 SDNode *&N = NullaryOps[std::make_pair(Opcode, VT)]; 822 if (!N) { 823 N = new SDNode(Opcode, VT); 824 AllNodes.push_back(N); 825 } 826 return SDOperand(N, 0); 827} 828 829SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT, 830 SDOperand Operand) { 831 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Operand.Val)) { 832 uint64_t Val = C->getValue(); 833 switch (Opcode) { 834 default: break; 835 case ISD::SIGN_EXTEND: return getConstant(C->getSignExtended(), VT); 836 case ISD::ANY_EXTEND: 837 case ISD::ZERO_EXTEND: return getConstant(Val, VT); 838 case ISD::TRUNCATE: return getConstant(Val, VT); 839 case ISD::SINT_TO_FP: return getConstantFP(C->getSignExtended(), VT); 840 case ISD::UINT_TO_FP: return getConstantFP(C->getValue(), VT); 841 } 842 } 843 844 if (ConstantFPSDNode *C = dyn_cast<ConstantFPSDNode>(Operand.Val)) 845 switch (Opcode) { 846 case ISD::FNEG: 847 return getConstantFP(-C->getValue(), VT); 848 case ISD::FP_ROUND: 849 case ISD::FP_EXTEND: 850 return getConstantFP(C->getValue(), VT); 851 case ISD::FP_TO_SINT: 852 return getConstant((int64_t)C->getValue(), VT); 853 case ISD::FP_TO_UINT: 854 return getConstant((uint64_t)C->getValue(), VT); 855 } 856 857 unsigned OpOpcode = Operand.Val->getOpcode(); 858 switch (Opcode) { 859 case ISD::TokenFactor: 860 return Operand; // Factor of one node? No factor. 861 case ISD::SIGN_EXTEND: 862 if (Operand.getValueType() == VT) return Operand; // noop extension 863 if (OpOpcode == ISD::SIGN_EXTEND || OpOpcode == ISD::ZERO_EXTEND) 864 return getNode(OpOpcode, VT, Operand.Val->getOperand(0)); 865 break; 866 case ISD::ZERO_EXTEND: 867 if (Operand.getValueType() == VT) return Operand; // noop extension 868 if (OpOpcode == ISD::ZERO_EXTEND) // (zext (zext x)) -> (zext x) 869 return getNode(ISD::ZERO_EXTEND, VT, Operand.Val->getOperand(0)); 870 break; 871 case ISD::ANY_EXTEND: 872 if (Operand.getValueType() == VT) return Operand; // noop extension 873 if (OpOpcode == ISD::ZERO_EXTEND || OpOpcode == ISD::SIGN_EXTEND) 874 // (ext (zext x)) -> (zext x) and (ext (sext x)) -> (sext x) 875 return getNode(OpOpcode, VT, Operand.Val->getOperand(0)); 876 break; 877 case ISD::TRUNCATE: 878 if (Operand.getValueType() == VT) return Operand; // noop truncate 879 if (OpOpcode == ISD::TRUNCATE) 880 return getNode(ISD::TRUNCATE, VT, Operand.Val->getOperand(0)); 881 else if (OpOpcode == ISD::ZERO_EXTEND || OpOpcode == ISD::SIGN_EXTEND || 882 OpOpcode == ISD::ANY_EXTEND) { 883 // If the source is smaller than the dest, we still need an extend. 884 if (Operand.Val->getOperand(0).getValueType() < VT) 885 return getNode(OpOpcode, VT, Operand.Val->getOperand(0)); 886 else if (Operand.Val->getOperand(0).getValueType() > VT) 887 return getNode(ISD::TRUNCATE, VT, Operand.Val->getOperand(0)); 888 else 889 return Operand.Val->getOperand(0); 890 } 891 break; 892 case ISD::FNEG: 893 if (OpOpcode == ISD::FSUB) // -(X-Y) -> (Y-X) 894 return getNode(ISD::FSUB, VT, Operand.Val->getOperand(1), 895 Operand.Val->getOperand(0)); 896 if (OpOpcode == ISD::FNEG) // --X -> X 897 return Operand.Val->getOperand(0); 898 break; 899 case ISD::FABS: 900 if (OpOpcode == ISD::FNEG) // abs(-X) -> abs(X) 901 return getNode(ISD::FABS, VT, Operand.Val->getOperand(0)); 902 break; 903 } 904 905 SDNode *N; 906 if (VT != MVT::Flag) { // Don't CSE flag producing nodes 907 SDNode *&E = UnaryOps[std::make_pair(Opcode, std::make_pair(Operand, VT))]; 908 if (E) return SDOperand(E, 0); 909 E = N = new SDNode(Opcode, Operand); 910 } else { 911 N = new SDNode(Opcode, Operand); 912 } 913 N->setValueTypes(VT); 914 AllNodes.push_back(N); 915 return SDOperand(N, 0); 916} 917 918 919 920SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT, 921 SDOperand N1, SDOperand N2) { 922#ifndef NDEBUG 923 switch (Opcode) { 924 case ISD::TokenFactor: 925 assert(VT == MVT::Other && N1.getValueType() == MVT::Other && 926 N2.getValueType() == MVT::Other && "Invalid token factor!"); 927 break; 928 case ISD::AND: 929 case ISD::OR: 930 case ISD::XOR: 931 case ISD::UDIV: 932 case ISD::UREM: 933 case ISD::MULHU: 934 case ISD::MULHS: 935 assert(MVT::isInteger(VT) && "This operator does not apply to FP types!"); 936 // fall through 937 case ISD::ADD: 938 case ISD::SUB: 939 case ISD::MUL: 940 case ISD::SDIV: 941 case ISD::SREM: 942 assert(MVT::isInteger(N1.getValueType()) && "Should use F* for FP ops"); 943 // fall through. 944 case ISD::FADD: 945 case ISD::FSUB: 946 case ISD::FMUL: 947 case ISD::FDIV: 948 case ISD::FREM: 949 assert(N1.getValueType() == N2.getValueType() && 950 N1.getValueType() == VT && "Binary operator types must match!"); 951 break; 952 953 case ISD::SHL: 954 case ISD::SRA: 955 case ISD::SRL: 956 assert(VT == N1.getValueType() && 957 "Shift operators return type must be the same as their first arg"); 958 assert(MVT::isInteger(VT) && MVT::isInteger(N2.getValueType()) && 959 VT != MVT::i1 && "Shifts only work on integers"); 960 break; 961 case ISD::FP_ROUND_INREG: { 962 MVT::ValueType EVT = cast<VTSDNode>(N2)->getVT(); 963 assert(VT == N1.getValueType() && "Not an inreg round!"); 964 assert(MVT::isFloatingPoint(VT) && MVT::isFloatingPoint(EVT) && 965 "Cannot FP_ROUND_INREG integer types"); 966 assert(EVT <= VT && "Not rounding down!"); 967 break; 968 } 969 case ISD::AssertSext: 970 case ISD::AssertZext: 971 case ISD::SIGN_EXTEND_INREG: { 972 MVT::ValueType EVT = cast<VTSDNode>(N2)->getVT(); 973 assert(VT == N1.getValueType() && "Not an inreg extend!"); 974 assert(MVT::isInteger(VT) && MVT::isInteger(EVT) && 975 "Cannot *_EXTEND_INREG FP types"); 976 assert(EVT <= VT && "Not extending!"); 977 } 978 979 default: break; 980 } 981#endif 982 983 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1.Val); 984 ConstantSDNode *N2C = dyn_cast<ConstantSDNode>(N2.Val); 985 if (N1C) { 986 if (N2C) { 987 uint64_t C1 = N1C->getValue(), C2 = N2C->getValue(); 988 switch (Opcode) { 989 case ISD::ADD: return getConstant(C1 + C2, VT); 990 case ISD::SUB: return getConstant(C1 - C2, VT); 991 case ISD::MUL: return getConstant(C1 * C2, VT); 992 case ISD::UDIV: 993 if (C2) return getConstant(C1 / C2, VT); 994 break; 995 case ISD::UREM : 996 if (C2) return getConstant(C1 % C2, VT); 997 break; 998 case ISD::SDIV : 999 if (C2) return getConstant(N1C->getSignExtended() / 1000 N2C->getSignExtended(), VT); 1001 break; 1002 case ISD::SREM : 1003 if (C2) return getConstant(N1C->getSignExtended() % 1004 N2C->getSignExtended(), VT); 1005 break; 1006 case ISD::AND : return getConstant(C1 & C2, VT); 1007 case ISD::OR : return getConstant(C1 | C2, VT); 1008 case ISD::XOR : return getConstant(C1 ^ C2, VT); 1009 case ISD::SHL : return getConstant(C1 << C2, VT); 1010 case ISD::SRL : return getConstant(C1 >> C2, VT); 1011 case ISD::SRA : return getConstant(N1C->getSignExtended() >>(int)C2, VT); 1012 default: break; 1013 } 1014 } else { // Cannonicalize constant to RHS if commutative 1015 if (isCommutativeBinOp(Opcode)) { 1016 std::swap(N1C, N2C); 1017 std::swap(N1, N2); 1018 } 1019 } 1020 } 1021 1022 ConstantFPSDNode *N1CFP = dyn_cast<ConstantFPSDNode>(N1.Val); 1023 ConstantFPSDNode *N2CFP = dyn_cast<ConstantFPSDNode>(N2.Val); 1024 if (N1CFP) { 1025 if (N2CFP) { 1026 double C1 = N1CFP->getValue(), C2 = N2CFP->getValue(); 1027 switch (Opcode) { 1028 case ISD::FADD: return getConstantFP(C1 + C2, VT); 1029 case ISD::FSUB: return getConstantFP(C1 - C2, VT); 1030 case ISD::FMUL: return getConstantFP(C1 * C2, VT); 1031 case ISD::FDIV: 1032 if (C2) return getConstantFP(C1 / C2, VT); 1033 break; 1034 case ISD::FREM : 1035 if (C2) return getConstantFP(fmod(C1, C2), VT); 1036 break; 1037 default: break; 1038 } 1039 } else { // Cannonicalize constant to RHS if commutative 1040 if (isCommutativeBinOp(Opcode)) { 1041 std::swap(N1CFP, N2CFP); 1042 std::swap(N1, N2); 1043 } 1044 } 1045 } 1046 1047 // Finally, fold operations that do not require constants. 1048 switch (Opcode) { 1049 case ISD::FP_ROUND_INREG: 1050 if (cast<VTSDNode>(N2)->getVT() == VT) return N1; // Not actually rounding. 1051 break; 1052 case ISD::SIGN_EXTEND_INREG: { 1053 MVT::ValueType EVT = cast<VTSDNode>(N2)->getVT(); 1054 if (EVT == VT) return N1; // Not actually extending 1055 break; 1056 } 1057 1058 // FIXME: figure out how to safely handle things like 1059 // int foo(int x) { return 1 << (x & 255); } 1060 // int bar() { return foo(256); } 1061#if 0 1062 case ISD::SHL: 1063 case ISD::SRL: 1064 case ISD::SRA: 1065 if (N2.getOpcode() == ISD::SIGN_EXTEND_INREG && 1066 cast<VTSDNode>(N2.getOperand(1))->getVT() != MVT::i1) 1067 return getNode(Opcode, VT, N1, N2.getOperand(0)); 1068 else if (N2.getOpcode() == ISD::AND) 1069 if (ConstantSDNode *AndRHS = dyn_cast<ConstantSDNode>(N2.getOperand(1))) { 1070 // If the and is only masking out bits that cannot effect the shift, 1071 // eliminate the and. 1072 unsigned NumBits = MVT::getSizeInBits(VT); 1073 if ((AndRHS->getValue() & (NumBits-1)) == NumBits-1) 1074 return getNode(Opcode, VT, N1, N2.getOperand(0)); 1075 } 1076 break; 1077#endif 1078 } 1079 1080 // Memoize this node if possible. 1081 SDNode *N; 1082 if (Opcode != ISD::CALLSEQ_START && Opcode != ISD::CALLSEQ_END && 1083 VT != MVT::Flag) { 1084 SDNode *&BON = BinaryOps[std::make_pair(Opcode, std::make_pair(N1, N2))]; 1085 if (BON) return SDOperand(BON, 0); 1086 1087 BON = N = new SDNode(Opcode, N1, N2); 1088 } else { 1089 N = new SDNode(Opcode, N1, N2); 1090 } 1091 1092 N->setValueTypes(VT); 1093 AllNodes.push_back(N); 1094 return SDOperand(N, 0); 1095} 1096 1097SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT, 1098 SDOperand N1, SDOperand N2, SDOperand N3) { 1099 // Perform various simplifications. 1100 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1.Val); 1101 ConstantSDNode *N2C = dyn_cast<ConstantSDNode>(N2.Val); 1102 ConstantSDNode *N3C = dyn_cast<ConstantSDNode>(N3.Val); 1103 switch (Opcode) { 1104 case ISD::SETCC: { 1105 // Use SimplifySetCC to simplify SETCC's. 1106 SDOperand Simp = SimplifySetCC(VT, N1, N2, cast<CondCodeSDNode>(N3)->get()); 1107 if (Simp.Val) return Simp; 1108 break; 1109 } 1110 case ISD::SELECT: 1111 if (N1C) 1112 if (N1C->getValue()) 1113 return N2; // select true, X, Y -> X 1114 else 1115 return N3; // select false, X, Y -> Y 1116 1117 if (N2 == N3) return N2; // select C, X, X -> X 1118 break; 1119 case ISD::BRCOND: 1120 if (N2C) 1121 if (N2C->getValue()) // Unconditional branch 1122 return getNode(ISD::BR, MVT::Other, N1, N3); 1123 else 1124 return N1; // Never-taken branch 1125 break; 1126 } 1127 1128 std::vector<SDOperand> Ops; 1129 Ops.reserve(3); 1130 Ops.push_back(N1); 1131 Ops.push_back(N2); 1132 Ops.push_back(N3); 1133 1134 // Memoize node if it doesn't produce a flag. 1135 SDNode *N; 1136 if (VT != MVT::Flag) { 1137 SDNode *&E = OneResultNodes[std::make_pair(Opcode,std::make_pair(VT, Ops))]; 1138 if (E) return SDOperand(E, 0); 1139 E = N = new SDNode(Opcode, N1, N2, N3); 1140 } else { 1141 N = new SDNode(Opcode, N1, N2, N3); 1142 } 1143 N->setValueTypes(VT); 1144 AllNodes.push_back(N); 1145 return SDOperand(N, 0); 1146} 1147 1148SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT, 1149 SDOperand N1, SDOperand N2, SDOperand N3, 1150 SDOperand N4) { 1151 std::vector<SDOperand> Ops; 1152 Ops.reserve(4); 1153 Ops.push_back(N1); 1154 Ops.push_back(N2); 1155 Ops.push_back(N3); 1156 Ops.push_back(N4); 1157 return getNode(Opcode, VT, Ops); 1158} 1159 1160SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT, 1161 SDOperand N1, SDOperand N2, SDOperand N3, 1162 SDOperand N4, SDOperand N5) { 1163 std::vector<SDOperand> Ops; 1164 Ops.reserve(5); 1165 Ops.push_back(N1); 1166 Ops.push_back(N2); 1167 Ops.push_back(N3); 1168 Ops.push_back(N4); 1169 Ops.push_back(N5); 1170 return getNode(Opcode, VT, Ops); 1171} 1172 1173SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT, 1174 SDOperand N1, SDOperand N2, SDOperand N3, 1175 SDOperand N4, SDOperand N5, SDOperand N6) { 1176 std::vector<SDOperand> Ops; 1177 Ops.reserve(6); 1178 Ops.push_back(N1); 1179 Ops.push_back(N2); 1180 Ops.push_back(N3); 1181 Ops.push_back(N4); 1182 Ops.push_back(N5); 1183 Ops.push_back(N6); 1184 return getNode(Opcode, VT, Ops); 1185} 1186 1187// setAdjCallChain - This method changes the token chain of an 1188// CALLSEQ_START/END node to be the specified operand. 1189void SDNode::setAdjCallChain(SDOperand N) { 1190 assert(N.getValueType() == MVT::Other); 1191 assert((getOpcode() == ISD::CALLSEQ_START || 1192 getOpcode() == ISD::CALLSEQ_END) && "Cannot adjust this node!"); 1193 1194 OperandList[0].Val->removeUser(this); 1195 OperandList[0] = N; 1196 OperandList[0].Val->Uses.push_back(this); 1197} 1198 1199 1200 1201SDOperand SelectionDAG::getLoad(MVT::ValueType VT, 1202 SDOperand Chain, SDOperand Ptr, 1203 SDOperand SV) { 1204 SDNode *&N = Loads[std::make_pair(Ptr, std::make_pair(Chain, VT))]; 1205 if (N) return SDOperand(N, 0); 1206 N = new SDNode(ISD::LOAD, Chain, Ptr, SV); 1207 1208 // Loads have a token chain. 1209 setNodeValueTypes(N, VT, MVT::Other); 1210 AllNodes.push_back(N); 1211 return SDOperand(N, 0); 1212} 1213 1214SDOperand SelectionDAG::getVecLoad(unsigned Count, MVT::ValueType EVT, 1215 SDOperand Chain, SDOperand Ptr, 1216 SDOperand SV) { 1217 SDNode *&N = Loads[std::make_pair(Ptr, std::make_pair(Chain, EVT))]; 1218 if (N) return SDOperand(N, 0); 1219 std::vector<SDOperand> Ops; 1220 Ops.reserve(5); 1221 Ops.push_back(Chain); 1222 Ops.push_back(Ptr); 1223 Ops.push_back(getConstant(Count, MVT::i32)); 1224 Ops.push_back(getValueType(EVT)); 1225 Ops.push_back(SV); 1226 std::vector<MVT::ValueType> VTs; 1227 VTs.reserve(2); 1228 VTs.push_back(MVT::Vector); VTs.push_back(MVT::Other); // Add token chain. 1229 return getNode(ISD::VLOAD, VTs, Ops); 1230} 1231 1232SDOperand SelectionDAG::getExtLoad(unsigned Opcode, MVT::ValueType VT, 1233 SDOperand Chain, SDOperand Ptr, SDOperand SV, 1234 MVT::ValueType EVT) { 1235 std::vector<SDOperand> Ops; 1236 Ops.reserve(4); 1237 Ops.push_back(Chain); 1238 Ops.push_back(Ptr); 1239 Ops.push_back(SV); 1240 Ops.push_back(getValueType(EVT)); 1241 std::vector<MVT::ValueType> VTs; 1242 VTs.reserve(2); 1243 VTs.push_back(VT); VTs.push_back(MVT::Other); // Add token chain. 1244 return getNode(Opcode, VTs, Ops); 1245} 1246 1247SDOperand SelectionDAG::getSrcValue(const Value *V, int Offset) { 1248 assert((!V || isa<PointerType>(V->getType())) && 1249 "SrcValue is not a pointer?"); 1250 SDNode *&N = ValueNodes[std::make_pair(V, Offset)]; 1251 if (N) return SDOperand(N, 0); 1252 1253 N = new SrcValueSDNode(V, Offset); 1254 AllNodes.push_back(N); 1255 return SDOperand(N, 0); 1256} 1257 1258SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT, 1259 std::vector<SDOperand> &Ops) { 1260 switch (Ops.size()) { 1261 case 0: return getNode(Opcode, VT); 1262 case 1: return getNode(Opcode, VT, Ops[0]); 1263 case 2: return getNode(Opcode, VT, Ops[0], Ops[1]); 1264 case 3: return getNode(Opcode, VT, Ops[0], Ops[1], Ops[2]); 1265 default: break; 1266 } 1267 1268 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(Ops[1].Val); 1269 switch (Opcode) { 1270 default: break; 1271 case ISD::BRCONDTWOWAY: 1272 if (N1C) 1273 if (N1C->getValue()) // Unconditional branch to true dest. 1274 return getNode(ISD::BR, MVT::Other, Ops[0], Ops[2]); 1275 else // Unconditional branch to false dest. 1276 return getNode(ISD::BR, MVT::Other, Ops[0], Ops[3]); 1277 break; 1278 case ISD::BRTWOWAY_CC: 1279 assert(Ops.size() == 6 && "BRTWOWAY_CC takes 6 operands!"); 1280 assert(Ops[2].getValueType() == Ops[3].getValueType() && 1281 "LHS and RHS of comparison must have same type!"); 1282 break; 1283 case ISD::TRUNCSTORE: { 1284 assert(Ops.size() == 5 && "TRUNCSTORE takes 5 operands!"); 1285 MVT::ValueType EVT = cast<VTSDNode>(Ops[4])->getVT(); 1286#if 0 // FIXME: If the target supports EVT natively, convert to a truncate/store 1287 // If this is a truncating store of a constant, convert to the desired type 1288 // and store it instead. 1289 if (isa<Constant>(Ops[0])) { 1290 SDOperand Op = getNode(ISD::TRUNCATE, EVT, N1); 1291 if (isa<Constant>(Op)) 1292 N1 = Op; 1293 } 1294 // Also for ConstantFP? 1295#endif 1296 if (Ops[0].getValueType() == EVT) // Normal store? 1297 return getNode(ISD::STORE, VT, Ops[0], Ops[1], Ops[2], Ops[3]); 1298 assert(Ops[1].getValueType() > EVT && "Not a truncation?"); 1299 assert(MVT::isInteger(Ops[1].getValueType()) == MVT::isInteger(EVT) && 1300 "Can't do FP-INT conversion!"); 1301 break; 1302 } 1303 case ISD::SELECT_CC: { 1304 assert(Ops.size() == 5 && "SELECT_CC takes 5 operands!"); 1305 assert(Ops[0].getValueType() == Ops[1].getValueType() && 1306 "LHS and RHS of condition must have same type!"); 1307 assert(Ops[2].getValueType() == Ops[3].getValueType() && 1308 "True and False arms of SelectCC must have same type!"); 1309 assert(Ops[2].getValueType() == VT && 1310 "select_cc node must be of same type as true and false value!"); 1311 break; 1312 } 1313 case ISD::BR_CC: { 1314 assert(Ops.size() == 5 && "BR_CC takes 5 operands!"); 1315 assert(Ops[2].getValueType() == Ops[3].getValueType() && 1316 "LHS/RHS of comparison should match types!"); 1317 break; 1318 } 1319 } 1320 1321 // Memoize nodes. 1322 SDNode *N; 1323 if (VT != MVT::Flag) { 1324 SDNode *&E = 1325 OneResultNodes[std::make_pair(Opcode, std::make_pair(VT, Ops))]; 1326 if (E) return SDOperand(E, 0); 1327 E = N = new SDNode(Opcode, Ops); 1328 } else { 1329 N = new SDNode(Opcode, Ops); 1330 } 1331 N->setValueTypes(VT); 1332 AllNodes.push_back(N); 1333 return SDOperand(N, 0); 1334} 1335 1336SDOperand SelectionDAG::getNode(unsigned Opcode, 1337 std::vector<MVT::ValueType> &ResultTys, 1338 std::vector<SDOperand> &Ops) { 1339 if (ResultTys.size() == 1) 1340 return getNode(Opcode, ResultTys[0], Ops); 1341 1342 switch (Opcode) { 1343 case ISD::EXTLOAD: 1344 case ISD::SEXTLOAD: 1345 case ISD::ZEXTLOAD: { 1346 MVT::ValueType EVT = cast<VTSDNode>(Ops[3])->getVT(); 1347 assert(Ops.size() == 4 && ResultTys.size() == 2 && "Bad *EXTLOAD!"); 1348 // If they are asking for an extending load from/to the same thing, return a 1349 // normal load. 1350 if (ResultTys[0] == EVT) 1351 return getLoad(ResultTys[0], Ops[0], Ops[1], Ops[2]); 1352 assert(EVT < ResultTys[0] && 1353 "Should only be an extending load, not truncating!"); 1354 assert((Opcode == ISD::EXTLOAD || MVT::isInteger(ResultTys[0])) && 1355 "Cannot sign/zero extend a FP load!"); 1356 assert(MVT::isInteger(ResultTys[0]) == MVT::isInteger(EVT) && 1357 "Cannot convert from FP to Int or Int -> FP!"); 1358 break; 1359 } 1360 1361 // FIXME: figure out how to safely handle things like 1362 // int foo(int x) { return 1 << (x & 255); } 1363 // int bar() { return foo(256); } 1364#if 0 1365 case ISD::SRA_PARTS: 1366 case ISD::SRL_PARTS: 1367 case ISD::SHL_PARTS: 1368 if (N3.getOpcode() == ISD::SIGN_EXTEND_INREG && 1369 cast<VTSDNode>(N3.getOperand(1))->getVT() != MVT::i1) 1370 return getNode(Opcode, VT, N1, N2, N3.getOperand(0)); 1371 else if (N3.getOpcode() == ISD::AND) 1372 if (ConstantSDNode *AndRHS = dyn_cast<ConstantSDNode>(N3.getOperand(1))) { 1373 // If the and is only masking out bits that cannot effect the shift, 1374 // eliminate the and. 1375 unsigned NumBits = MVT::getSizeInBits(VT)*2; 1376 if ((AndRHS->getValue() & (NumBits-1)) == NumBits-1) 1377 return getNode(Opcode, VT, N1, N2, N3.getOperand(0)); 1378 } 1379 break; 1380#endif 1381 } 1382 1383 // Memoize the node unless it returns a flag. 1384 SDNode *N; 1385 if (ResultTys.back() != MVT::Flag) { 1386 SDNode *&E = 1387 ArbitraryNodes[std::make_pair(Opcode, std::make_pair(ResultTys, Ops))]; 1388 if (E) return SDOperand(E, 0); 1389 E = N = new SDNode(Opcode, Ops); 1390 } else { 1391 N = new SDNode(Opcode, Ops); 1392 } 1393 setNodeValueTypes(N, ResultTys); 1394 AllNodes.push_back(N); 1395 return SDOperand(N, 0); 1396} 1397 1398void SelectionDAG::setNodeValueTypes(SDNode *N, 1399 std::vector<MVT::ValueType> &RetVals) { 1400 switch (RetVals.size()) { 1401 case 0: return; 1402 case 1: N->setValueTypes(RetVals[0]); return; 1403 case 2: setNodeValueTypes(N, RetVals[0], RetVals[1]); return; 1404 default: break; 1405 } 1406 1407 std::list<std::vector<MVT::ValueType> >::iterator I = 1408 std::find(VTList.begin(), VTList.end(), RetVals); 1409 if (I == VTList.end()) { 1410 VTList.push_front(RetVals); 1411 I = VTList.begin(); 1412 } 1413 1414 N->setValueTypes(&(*I)[0], I->size()); 1415} 1416 1417void SelectionDAG::setNodeValueTypes(SDNode *N, MVT::ValueType VT1, 1418 MVT::ValueType VT2) { 1419 for (std::list<std::vector<MVT::ValueType> >::iterator I = VTList.begin(), 1420 E = VTList.end(); I != E; ++I) { 1421 if (I->size() == 2 && (*I)[0] == VT1 && (*I)[1] == VT2) { 1422 N->setValueTypes(&(*I)[0], 2); 1423 return; 1424 } 1425 } 1426 std::vector<MVT::ValueType> V; 1427 V.push_back(VT1); 1428 V.push_back(VT2); 1429 VTList.push_front(V); 1430 N->setValueTypes(&(*VTList.begin())[0], 2); 1431} 1432 1433 1434/// SelectNodeTo - These are used for target selectors to *mutate* the 1435/// specified node to have the specified return type, Target opcode, and 1436/// operands. Note that target opcodes are stored as 1437/// ISD::BUILTIN_OP_END+TargetOpcode in the node opcode field. 1438/// 1439/// Note that SelectNodeTo returns the resultant node. If there is already a 1440/// node of the specified opcode and operands, it returns that node instead of 1441/// the current one. 1442SDOperand SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc, 1443 MVT::ValueType VT) { 1444 // If an identical node already exists, use it. 1445 SDNode *&ON = NullaryOps[std::make_pair(ISD::BUILTIN_OP_END+TargetOpc, VT)]; 1446 if (ON) return SDOperand(ON, 0); 1447 1448 RemoveNodeFromCSEMaps(N); 1449 1450 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc); 1451 N->setValueTypes(VT); 1452 1453 ON = N; // Memoize the new node. 1454 return SDOperand(N, 0); 1455} 1456 1457SDOperand SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc, 1458 MVT::ValueType VT, SDOperand Op1) { 1459 // If an identical node already exists, use it. 1460 SDNode *&ON = UnaryOps[std::make_pair(ISD::BUILTIN_OP_END+TargetOpc, 1461 std::make_pair(Op1, VT))]; 1462 if (ON) return SDOperand(ON, 0); 1463 1464 RemoveNodeFromCSEMaps(N); 1465 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc); 1466 N->setValueTypes(VT); 1467 N->setOperands(Op1); 1468 1469 ON = N; // Memoize the new node. 1470 return SDOperand(N, 0); 1471} 1472 1473SDOperand SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc, 1474 MVT::ValueType VT, SDOperand Op1, 1475 SDOperand Op2) { 1476 // If an identical node already exists, use it. 1477 SDNode *&ON = BinaryOps[std::make_pair(ISD::BUILTIN_OP_END+TargetOpc, 1478 std::make_pair(Op1, Op2))]; 1479 if (ON) return SDOperand(ON, 0); 1480 1481 RemoveNodeFromCSEMaps(N); 1482 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc); 1483 N->setValueTypes(VT); 1484 N->setOperands(Op1, Op2); 1485 1486 ON = N; // Memoize the new node. 1487 return SDOperand(N, 0); 1488} 1489 1490SDOperand SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc, 1491 MVT::ValueType VT, SDOperand Op1, 1492 SDOperand Op2, SDOperand Op3) { 1493 // If an identical node already exists, use it. 1494 std::vector<SDOperand> OpList; 1495 OpList.push_back(Op1); OpList.push_back(Op2); OpList.push_back(Op3); 1496 SDNode *&ON = OneResultNodes[std::make_pair(ISD::BUILTIN_OP_END+TargetOpc, 1497 std::make_pair(VT, OpList))]; 1498 if (ON) return SDOperand(ON, 0); 1499 1500 RemoveNodeFromCSEMaps(N); 1501 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc); 1502 N->setValueTypes(VT); 1503 N->setOperands(Op1, Op2, Op3); 1504 1505 ON = N; // Memoize the new node. 1506 return SDOperand(N, 0); 1507} 1508 1509SDOperand SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc, 1510 MVT::ValueType VT, SDOperand Op1, 1511 SDOperand Op2, SDOperand Op3, 1512 SDOperand Op4) { 1513 // If an identical node already exists, use it. 1514 std::vector<SDOperand> OpList; 1515 OpList.push_back(Op1); OpList.push_back(Op2); OpList.push_back(Op3); 1516 OpList.push_back(Op4); 1517 SDNode *&ON = OneResultNodes[std::make_pair(ISD::BUILTIN_OP_END+TargetOpc, 1518 std::make_pair(VT, OpList))]; 1519 if (ON) return SDOperand(ON, 0); 1520 1521 RemoveNodeFromCSEMaps(N); 1522 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc); 1523 N->setValueTypes(VT); 1524 N->setOperands(Op1, Op2, Op3, Op4); 1525 1526 ON = N; // Memoize the new node. 1527 return SDOperand(N, 0); 1528} 1529 1530SDOperand SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc, 1531 MVT::ValueType VT, SDOperand Op1, 1532 SDOperand Op2, SDOperand Op3,SDOperand Op4, 1533 SDOperand Op5) { 1534 // If an identical node already exists, use it. 1535 std::vector<SDOperand> OpList; 1536 OpList.push_back(Op1); OpList.push_back(Op2); OpList.push_back(Op3); 1537 OpList.push_back(Op4); OpList.push_back(Op5); 1538 SDNode *&ON = OneResultNodes[std::make_pair(ISD::BUILTIN_OP_END+TargetOpc, 1539 std::make_pair(VT, OpList))]; 1540 if (ON) return SDOperand(ON, 0); 1541 1542 RemoveNodeFromCSEMaps(N); 1543 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc); 1544 N->setValueTypes(VT); 1545 N->setOperands(Op1, Op2, Op3, Op4, Op5); 1546 1547 ON = N; // Memoize the new node. 1548 return SDOperand(N, 0); 1549} 1550 1551SDOperand SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc, 1552 MVT::ValueType VT, SDOperand Op1, 1553 SDOperand Op2, SDOperand Op3,SDOperand Op4, 1554 SDOperand Op5, SDOperand Op6) { 1555 // If an identical node already exists, use it. 1556 std::vector<SDOperand> OpList; 1557 OpList.push_back(Op1); OpList.push_back(Op2); OpList.push_back(Op3); 1558 OpList.push_back(Op4); OpList.push_back(Op5); OpList.push_back(Op6); 1559 SDNode *&ON = OneResultNodes[std::make_pair(ISD::BUILTIN_OP_END+TargetOpc, 1560 std::make_pair(VT, OpList))]; 1561 if (ON) return SDOperand(ON, 0); 1562 1563 RemoveNodeFromCSEMaps(N); 1564 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc); 1565 N->setValueTypes(VT); 1566 N->setOperands(Op1, Op2, Op3, Op4, Op5, Op6); 1567 1568 ON = N; // Memoize the new node. 1569 return SDOperand(N, 0); 1570} 1571 1572SDOperand SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc, 1573 MVT::ValueType VT1, MVT::ValueType VT2, 1574 SDOperand Op1, SDOperand Op2) { 1575 // If an identical node already exists, use it. 1576 std::vector<SDOperand> OpList; 1577 OpList.push_back(Op1); OpList.push_back(Op2); 1578 std::vector<MVT::ValueType> VTList; 1579 VTList.push_back(VT1); VTList.push_back(VT2); 1580 SDNode *&ON = ArbitraryNodes[std::make_pair(ISD::BUILTIN_OP_END+TargetOpc, 1581 std::make_pair(VTList, OpList))]; 1582 if (ON) return SDOperand(ON, 0); 1583 1584 RemoveNodeFromCSEMaps(N); 1585 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc); 1586 setNodeValueTypes(N, VT1, VT2); 1587 N->setOperands(Op1, Op2); 1588 1589 ON = N; // Memoize the new node. 1590 return SDOperand(N, 0); 1591} 1592 1593SDOperand SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc, 1594 MVT::ValueType VT1, MVT::ValueType VT2, 1595 SDOperand Op1, SDOperand Op2, 1596 SDOperand Op3) { 1597 // If an identical node already exists, use it. 1598 std::vector<SDOperand> OpList; 1599 OpList.push_back(Op1); OpList.push_back(Op2); OpList.push_back(Op3); 1600 std::vector<MVT::ValueType> VTList; 1601 VTList.push_back(VT1); VTList.push_back(VT2); 1602 SDNode *&ON = ArbitraryNodes[std::make_pair(ISD::BUILTIN_OP_END+TargetOpc, 1603 std::make_pair(VTList, OpList))]; 1604 if (ON) return SDOperand(ON, 0); 1605 1606 RemoveNodeFromCSEMaps(N); 1607 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc); 1608 setNodeValueTypes(N, VT1, VT2); 1609 N->setOperands(Op1, Op2, Op3); 1610 1611 ON = N; // Memoize the new node. 1612 return SDOperand(N, 0); 1613} 1614 1615SDOperand SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc, 1616 MVT::ValueType VT1, MVT::ValueType VT2, 1617 SDOperand Op1, SDOperand Op2, 1618 SDOperand Op3, SDOperand Op4) { 1619 // If an identical node already exists, use it. 1620 std::vector<SDOperand> OpList; 1621 OpList.push_back(Op1); OpList.push_back(Op2); OpList.push_back(Op3); 1622 OpList.push_back(Op4); 1623 std::vector<MVT::ValueType> VTList; 1624 VTList.push_back(VT1); VTList.push_back(VT2); 1625 SDNode *&ON = ArbitraryNodes[std::make_pair(ISD::BUILTIN_OP_END+TargetOpc, 1626 std::make_pair(VTList, OpList))]; 1627 if (ON) return SDOperand(ON, 0); 1628 1629 RemoveNodeFromCSEMaps(N); 1630 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc); 1631 setNodeValueTypes(N, VT1, VT2); 1632 N->setOperands(Op1, Op2, Op3, Op4); 1633 1634 ON = N; // Memoize the new node. 1635 return SDOperand(N, 0); 1636} 1637 1638SDOperand SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc, 1639 MVT::ValueType VT1, MVT::ValueType VT2, 1640 SDOperand Op1, SDOperand Op2, 1641 SDOperand Op3, SDOperand Op4, 1642 SDOperand Op5) { 1643 // If an identical node already exists, use it. 1644 std::vector<SDOperand> OpList; 1645 OpList.push_back(Op1); OpList.push_back(Op2); OpList.push_back(Op3); 1646 OpList.push_back(Op4); OpList.push_back(Op5); 1647 std::vector<MVT::ValueType> VTList; 1648 VTList.push_back(VT1); VTList.push_back(VT2); 1649 SDNode *&ON = ArbitraryNodes[std::make_pair(ISD::BUILTIN_OP_END+TargetOpc, 1650 std::make_pair(VTList, OpList))]; 1651 if (ON) return SDOperand(ON, 0); 1652 1653 RemoveNodeFromCSEMaps(N); 1654 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc); 1655 setNodeValueTypes(N, VT1, VT2); 1656 N->setOperands(Op1, Op2, Op3, Op4, Op5); 1657 1658 ON = N; // Memoize the new node. 1659 return SDOperand(N, 0); 1660} 1661 1662// ReplaceAllUsesWith - Modify anything using 'From' to use 'To' instead. 1663/// This can cause recursive merging of nodes in the DAG. 1664/// 1665/// This version assumes From/To have a single result value. 1666/// 1667void SelectionDAG::ReplaceAllUsesWith(SDOperand FromN, SDOperand ToN, 1668 std::vector<SDNode*> *Deleted) { 1669 SDNode *From = FromN.Val, *To = ToN.Val; 1670 assert(From->getNumValues() == 1 && To->getNumValues() == 1 && 1671 "Cannot replace with this method!"); 1672 assert(From != To && "Cannot replace uses of with self"); 1673 1674 while (!From->use_empty()) { 1675 // Process users until they are all gone. 1676 SDNode *U = *From->use_begin(); 1677 1678 // This node is about to morph, remove its old self from the CSE maps. 1679 RemoveNodeFromCSEMaps(U); 1680 1681 for (SDOperand *I = U->OperandList, *E = U->OperandList+U->NumOperands; 1682 I != E; ++I) 1683 if (I->Val == From) { 1684 From->removeUser(U); 1685 I->Val = To; 1686 To->addUser(U); 1687 } 1688 1689 // Now that we have modified U, add it back to the CSE maps. If it already 1690 // exists there, recursively merge the results together. 1691 if (SDNode *Existing = AddNonLeafNodeToCSEMaps(U)) { 1692 ReplaceAllUsesWith(U, Existing, Deleted); 1693 // U is now dead. 1694 if (Deleted) Deleted->push_back(U); 1695 DeleteNodeNotInCSEMaps(U); 1696 } 1697 } 1698} 1699 1700/// ReplaceAllUsesWith - Modify anything using 'From' to use 'To' instead. 1701/// This can cause recursive merging of nodes in the DAG. 1702/// 1703/// This version assumes From/To have matching types and numbers of result 1704/// values. 1705/// 1706void SelectionDAG::ReplaceAllUsesWith(SDNode *From, SDNode *To, 1707 std::vector<SDNode*> *Deleted) { 1708 assert(From != To && "Cannot replace uses of with self"); 1709 assert(From->getNumValues() == To->getNumValues() && 1710 "Cannot use this version of ReplaceAllUsesWith!"); 1711 if (From->getNumValues() == 1) { // If possible, use the faster version. 1712 ReplaceAllUsesWith(SDOperand(From, 0), SDOperand(To, 0), Deleted); 1713 return; 1714 } 1715 1716 while (!From->use_empty()) { 1717 // Process users until they are all gone. 1718 SDNode *U = *From->use_begin(); 1719 1720 // This node is about to morph, remove its old self from the CSE maps. 1721 RemoveNodeFromCSEMaps(U); 1722 1723 for (SDOperand *I = U->OperandList, *E = U->OperandList+U->NumOperands; 1724 I != E; ++I) 1725 if (I->Val == From) { 1726 From->removeUser(U); 1727 I->Val = To; 1728 To->addUser(U); 1729 } 1730 1731 // Now that we have modified U, add it back to the CSE maps. If it already 1732 // exists there, recursively merge the results together. 1733 if (SDNode *Existing = AddNonLeafNodeToCSEMaps(U)) { 1734 ReplaceAllUsesWith(U, Existing, Deleted); 1735 // U is now dead. 1736 if (Deleted) Deleted->push_back(U); 1737 DeleteNodeNotInCSEMaps(U); 1738 } 1739 } 1740} 1741 1742/// ReplaceAllUsesWith - Modify anything using 'From' to use 'To' instead. 1743/// This can cause recursive merging of nodes in the DAG. 1744/// 1745/// This version can replace From with any result values. To must match the 1746/// number and types of values returned by From. 1747void SelectionDAG::ReplaceAllUsesWith(SDNode *From, 1748 const std::vector<SDOperand> &To, 1749 std::vector<SDNode*> *Deleted) { 1750 assert(From->getNumValues() == To.size() && 1751 "Incorrect number of values to replace with!"); 1752 if (To.size() == 1 && To[0].Val->getNumValues() == 1) { 1753 // Degenerate case handled above. 1754 ReplaceAllUsesWith(SDOperand(From, 0), To[0], Deleted); 1755 return; 1756 } 1757 1758 while (!From->use_empty()) { 1759 // Process users until they are all gone. 1760 SDNode *U = *From->use_begin(); 1761 1762 // This node is about to morph, remove its old self from the CSE maps. 1763 RemoveNodeFromCSEMaps(U); 1764 1765 for (SDOperand *I = U->OperandList, *E = U->OperandList+U->NumOperands; 1766 I != E; ++I) 1767 if (I->Val == From) { 1768 const SDOperand &ToOp = To[I->ResNo]; 1769 From->removeUser(U); 1770 *I = ToOp; 1771 ToOp.Val->addUser(U); 1772 } 1773 1774 // Now that we have modified U, add it back to the CSE maps. If it already 1775 // exists there, recursively merge the results together. 1776 if (SDNode *Existing = AddNonLeafNodeToCSEMaps(U)) { 1777 ReplaceAllUsesWith(U, Existing, Deleted); 1778 // U is now dead. 1779 if (Deleted) Deleted->push_back(U); 1780 DeleteNodeNotInCSEMaps(U); 1781 } 1782 } 1783} 1784 1785 1786//===----------------------------------------------------------------------===// 1787// SDNode Class 1788//===----------------------------------------------------------------------===// 1789 1790 1791/// getValueTypeList - Return a pointer to the specified value type. 1792/// 1793MVT::ValueType *SDNode::getValueTypeList(MVT::ValueType VT) { 1794 static MVT::ValueType VTs[MVT::LAST_VALUETYPE]; 1795 VTs[VT] = VT; 1796 return &VTs[VT]; 1797} 1798 1799/// hasNUsesOfValue - Return true if there are exactly NUSES uses of the 1800/// indicated value. This method ignores uses of other values defined by this 1801/// operation. 1802bool SDNode::hasNUsesOfValue(unsigned NUses, unsigned Value) { 1803 assert(Value < getNumValues() && "Bad value!"); 1804 1805 // If there is only one value, this is easy. 1806 if (getNumValues() == 1) 1807 return use_size() == NUses; 1808 if (Uses.size() < NUses) return false; 1809 1810 SDOperand TheValue(this, Value); 1811 1812 std::set<SDNode*> UsersHandled; 1813 1814 for (std::vector<SDNode*>::iterator UI = Uses.begin(), E = Uses.end(); 1815 UI != E; ++UI) { 1816 SDNode *User = *UI; 1817 if (User->getNumOperands() == 1 || 1818 UsersHandled.insert(User).second) // First time we've seen this? 1819 for (unsigned i = 0, e = User->getNumOperands(); i != e; ++i) 1820 if (User->getOperand(i) == TheValue) { 1821 if (NUses == 0) 1822 return false; // too many uses 1823 --NUses; 1824 } 1825 } 1826 1827 // Found exactly the right number of uses? 1828 return NUses == 0; 1829} 1830 1831 1832const char *SDNode::getOperationName(const SelectionDAG *G) const { 1833 switch (getOpcode()) { 1834 default: 1835 if (getOpcode() < ISD::BUILTIN_OP_END) 1836 return "<<Unknown DAG Node>>"; 1837 else { 1838 if (G) { 1839 if (const TargetInstrInfo *TII = G->getTarget().getInstrInfo()) 1840 if (getOpcode()-ISD::BUILTIN_OP_END < TII->getNumOpcodes()) 1841 return TII->getName(getOpcode()-ISD::BUILTIN_OP_END); 1842 1843 TargetLowering &TLI = G->getTargetLoweringInfo(); 1844 const char *Name = 1845 TLI.getTargetNodeName(getOpcode()); 1846 if (Name) return Name; 1847 } 1848 1849 return "<<Unknown Target Node>>"; 1850 } 1851 1852 case ISD::PCMARKER: return "PCMarker"; 1853 case ISD::READCYCLECOUNTER: return "ReadCycleCounter"; 1854 case ISD::SRCVALUE: return "SrcValue"; 1855 case ISD::VALUETYPE: return "ValueType"; 1856 case ISD::STRING: return "String"; 1857 case ISD::EntryToken: return "EntryToken"; 1858 case ISD::TokenFactor: return "TokenFactor"; 1859 case ISD::AssertSext: return "AssertSext"; 1860 case ISD::AssertZext: return "AssertZext"; 1861 case ISD::Constant: return "Constant"; 1862 case ISD::TargetConstant: return "TargetConstant"; 1863 case ISD::ConstantFP: return "ConstantFP"; 1864 case ISD::ConstantVec: return "ConstantVec"; 1865 case ISD::GlobalAddress: return "GlobalAddress"; 1866 case ISD::TargetGlobalAddress: return "TargetGlobalAddress"; 1867 case ISD::FrameIndex: return "FrameIndex"; 1868 case ISD::TargetFrameIndex: return "TargetFrameIndex"; 1869 case ISD::BasicBlock: return "BasicBlock"; 1870 case ISD::Register: return "Register"; 1871 case ISD::ExternalSymbol: return "ExternalSymbol"; 1872 case ISD::TargetExternalSymbol: return "TargetExternalSymbol"; 1873 case ISD::ConstantPool: return "ConstantPool"; 1874 case ISD::TargetConstantPool: return "TargetConstantPool"; 1875 case ISD::CopyToReg: return "CopyToReg"; 1876 case ISD::CopyFromReg: return "CopyFromReg"; 1877 case ISD::UNDEF: return "undef"; 1878 1879 // Unary operators 1880 case ISD::FABS: return "fabs"; 1881 case ISD::FNEG: return "fneg"; 1882 case ISD::FSQRT: return "fsqrt"; 1883 case ISD::FSIN: return "fsin"; 1884 case ISD::FCOS: return "fcos"; 1885 1886 // Binary operators 1887 case ISD::ADD: return "add"; 1888 case ISD::SUB: return "sub"; 1889 case ISD::MUL: return "mul"; 1890 case ISD::MULHU: return "mulhu"; 1891 case ISD::MULHS: return "mulhs"; 1892 case ISD::SDIV: return "sdiv"; 1893 case ISD::UDIV: return "udiv"; 1894 case ISD::SREM: return "srem"; 1895 case ISD::UREM: return "urem"; 1896 case ISD::AND: return "and"; 1897 case ISD::OR: return "or"; 1898 case ISD::XOR: return "xor"; 1899 case ISD::SHL: return "shl"; 1900 case ISD::SRA: return "sra"; 1901 case ISD::SRL: return "srl"; 1902 case ISD::FADD: return "fadd"; 1903 case ISD::FSUB: return "fsub"; 1904 case ISD::FMUL: return "fmul"; 1905 case ISD::FDIV: return "fdiv"; 1906 case ISD::FREM: return "frem"; 1907 case ISD::VADD: return "vadd"; 1908 case ISD::VSUB: return "vsub"; 1909 case ISD::VMUL: return "vmul"; 1910 1911 case ISD::SETCC: return "setcc"; 1912 case ISD::SELECT: return "select"; 1913 case ISD::SELECT_CC: return "select_cc"; 1914 case ISD::ADD_PARTS: return "add_parts"; 1915 case ISD::SUB_PARTS: return "sub_parts"; 1916 case ISD::SHL_PARTS: return "shl_parts"; 1917 case ISD::SRA_PARTS: return "sra_parts"; 1918 case ISD::SRL_PARTS: return "srl_parts"; 1919 1920 // Conversion operators. 1921 case ISD::SIGN_EXTEND: return "sign_extend"; 1922 case ISD::ZERO_EXTEND: return "zero_extend"; 1923 case ISD::ANY_EXTEND: return "any_extend"; 1924 case ISD::SIGN_EXTEND_INREG: return "sign_extend_inreg"; 1925 case ISD::TRUNCATE: return "truncate"; 1926 case ISD::FP_ROUND: return "fp_round"; 1927 case ISD::FP_ROUND_INREG: return "fp_round_inreg"; 1928 case ISD::FP_EXTEND: return "fp_extend"; 1929 1930 case ISD::SINT_TO_FP: return "sint_to_fp"; 1931 case ISD::UINT_TO_FP: return "uint_to_fp"; 1932 case ISD::FP_TO_SINT: return "fp_to_sint"; 1933 case ISD::FP_TO_UINT: return "fp_to_uint"; 1934 1935 // Control flow instructions 1936 case ISD::BR: return "br"; 1937 case ISD::BRCOND: return "brcond"; 1938 case ISD::BRCONDTWOWAY: return "brcondtwoway"; 1939 case ISD::BR_CC: return "br_cc"; 1940 case ISD::BRTWOWAY_CC: return "brtwoway_cc"; 1941 case ISD::RET: return "ret"; 1942 case ISD::CALL: return "call"; 1943 case ISD::TAILCALL:return "tailcall"; 1944 case ISD::CALLSEQ_START: return "callseq_start"; 1945 case ISD::CALLSEQ_END: return "callseq_end"; 1946 1947 // Other operators 1948 case ISD::LOAD: return "load"; 1949 case ISD::STORE: return "store"; 1950 case ISD::VLOAD: return "vload"; 1951 case ISD::EXTLOAD: return "extload"; 1952 case ISD::SEXTLOAD: return "sextload"; 1953 case ISD::ZEXTLOAD: return "zextload"; 1954 case ISD::TRUNCSTORE: return "truncstore"; 1955 1956 case ISD::DYNAMIC_STACKALLOC: return "dynamic_stackalloc"; 1957 case ISD::EXTRACT_ELEMENT: return "extract_element"; 1958 case ISD::BUILD_PAIR: return "build_pair"; 1959 case ISD::MEMSET: return "memset"; 1960 case ISD::MEMCPY: return "memcpy"; 1961 case ISD::MEMMOVE: return "memmove"; 1962 1963 // Bit counting 1964 case ISD::CTPOP: return "ctpop"; 1965 case ISD::CTTZ: return "cttz"; 1966 case ISD::CTLZ: return "ctlz"; 1967 1968 // IO Intrinsics 1969 case ISD::READPORT: return "readport"; 1970 case ISD::WRITEPORT: return "writeport"; 1971 case ISD::READIO: return "readio"; 1972 case ISD::WRITEIO: return "writeio"; 1973 1974 // Debug info 1975 case ISD::LOCATION: return "location"; 1976 case ISD::DEBUG_LOC: return "debug_loc"; 1977 1978 case ISD::CONDCODE: 1979 switch (cast<CondCodeSDNode>(this)->get()) { 1980 default: assert(0 && "Unknown setcc condition!"); 1981 case ISD::SETOEQ: return "setoeq"; 1982 case ISD::SETOGT: return "setogt"; 1983 case ISD::SETOGE: return "setoge"; 1984 case ISD::SETOLT: return "setolt"; 1985 case ISD::SETOLE: return "setole"; 1986 case ISD::SETONE: return "setone"; 1987 1988 case ISD::SETO: return "seto"; 1989 case ISD::SETUO: return "setuo"; 1990 case ISD::SETUEQ: return "setue"; 1991 case ISD::SETUGT: return "setugt"; 1992 case ISD::SETUGE: return "setuge"; 1993 case ISD::SETULT: return "setult"; 1994 case ISD::SETULE: return "setule"; 1995 case ISD::SETUNE: return "setune"; 1996 1997 case ISD::SETEQ: return "seteq"; 1998 case ISD::SETGT: return "setgt"; 1999 case ISD::SETGE: return "setge"; 2000 case ISD::SETLT: return "setlt"; 2001 case ISD::SETLE: return "setle"; 2002 case ISD::SETNE: return "setne"; 2003 } 2004 } 2005} 2006 2007void SDNode::dump() const { dump(0); } 2008void SDNode::dump(const SelectionDAG *G) const { 2009 std::cerr << (void*)this << ": "; 2010 2011 for (unsigned i = 0, e = getNumValues(); i != e; ++i) { 2012 if (i) std::cerr << ","; 2013 if (getValueType(i) == MVT::Other) 2014 std::cerr << "ch"; 2015 else 2016 std::cerr << MVT::getValueTypeString(getValueType(i)); 2017 } 2018 std::cerr << " = " << getOperationName(G); 2019 2020 std::cerr << " "; 2021 for (unsigned i = 0, e = getNumOperands(); i != e; ++i) { 2022 if (i) std::cerr << ", "; 2023 std::cerr << (void*)getOperand(i).Val; 2024 if (unsigned RN = getOperand(i).ResNo) 2025 std::cerr << ":" << RN; 2026 } 2027 2028 if (const ConstantSDNode *CSDN = dyn_cast<ConstantSDNode>(this)) { 2029 std::cerr << "<" << CSDN->getValue() << ">"; 2030 } else if (const ConstantFPSDNode *CSDN = dyn_cast<ConstantFPSDNode>(this)) { 2031 std::cerr << "<" << CSDN->getValue() << ">"; 2032 } else if (const GlobalAddressSDNode *GADN = 2033 dyn_cast<GlobalAddressSDNode>(this)) { 2034 int offset = GADN->getOffset(); 2035 std::cerr << "<"; 2036 WriteAsOperand(std::cerr, GADN->getGlobal()) << ">"; 2037 if (offset > 0) 2038 std::cerr << " + " << offset; 2039 else 2040 std::cerr << " " << offset; 2041 } else if (const FrameIndexSDNode *FIDN = dyn_cast<FrameIndexSDNode>(this)) { 2042 std::cerr << "<" << FIDN->getIndex() << ">"; 2043 } else if (const ConstantPoolSDNode *CP = dyn_cast<ConstantPoolSDNode>(this)){ 2044 std::cerr << "<" << *CP->get() << ">"; 2045 } else if (const BasicBlockSDNode *BBDN = dyn_cast<BasicBlockSDNode>(this)) { 2046 std::cerr << "<"; 2047 const Value *LBB = (const Value*)BBDN->getBasicBlock()->getBasicBlock(); 2048 if (LBB) 2049 std::cerr << LBB->getName() << " "; 2050 std::cerr << (const void*)BBDN->getBasicBlock() << ">"; 2051 } else if (const RegisterSDNode *R = dyn_cast<RegisterSDNode>(this)) { 2052 if (G && MRegisterInfo::isPhysicalRegister(R->getReg())) { 2053 std::cerr << " " <<G->getTarget().getRegisterInfo()->getName(R->getReg()); 2054 } else { 2055 std::cerr << " #" << R->getReg(); 2056 } 2057 } else if (const ExternalSymbolSDNode *ES = 2058 dyn_cast<ExternalSymbolSDNode>(this)) { 2059 std::cerr << "'" << ES->getSymbol() << "'"; 2060 } else if (const SrcValueSDNode *M = dyn_cast<SrcValueSDNode>(this)) { 2061 if (M->getValue()) 2062 std::cerr << "<" << M->getValue() << ":" << M->getOffset() << ">"; 2063 else 2064 std::cerr << "<null:" << M->getOffset() << ">"; 2065 } else if (const VTSDNode *N = dyn_cast<VTSDNode>(this)) { 2066 std::cerr << ":" << getValueTypeString(N->getVT()); 2067 } 2068} 2069 2070static void DumpNodes(const SDNode *N, unsigned indent, const SelectionDAG *G) { 2071 for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i) 2072 if (N->getOperand(i).Val->hasOneUse()) 2073 DumpNodes(N->getOperand(i).Val, indent+2, G); 2074 else 2075 std::cerr << "\n" << std::string(indent+2, ' ') 2076 << (void*)N->getOperand(i).Val << ": <multiple use>"; 2077 2078 2079 std::cerr << "\n" << std::string(indent, ' '); 2080 N->dump(G); 2081} 2082 2083void SelectionDAG::dump() const { 2084 std::cerr << "SelectionDAG has " << AllNodes.size() << " nodes:"; 2085 std::vector<const SDNode*> Nodes; 2086 for (allnodes_const_iterator I = allnodes_begin(), E = allnodes_end(); 2087 I != E; ++I) 2088 Nodes.push_back(I); 2089 2090 std::sort(Nodes.begin(), Nodes.end()); 2091 2092 for (unsigned i = 0, e = Nodes.size(); i != e; ++i) { 2093 if (!Nodes[i]->hasOneUse() && Nodes[i] != getRoot().Val) 2094 DumpNodes(Nodes[i], 2, this); 2095 } 2096 2097 DumpNodes(getRoot().Val, 2, this); 2098 2099 std::cerr << "\n\n"; 2100} 2101 2102