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