SelectionDAG.cpp revision 27e9b4146417a9bdbade90d0ecc32c9567694a87
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/Target/TargetLowering.h" 20#include <iostream> 21#include <set> 22#include <cmath> 23#include <algorithm> 24using namespace llvm; 25 26static bool isCommutativeBinOp(unsigned Opcode) { 27 switch (Opcode) { 28 case ISD::ADD: 29 case ISD::MUL: 30 case ISD::AND: 31 case ISD::OR: 32 case ISD::XOR: return true; 33 default: return false; // FIXME: Need commutative info for user ops! 34 } 35} 36 37static bool isAssociativeBinOp(unsigned Opcode) { 38 switch (Opcode) { 39 case ISD::ADD: 40 case ISD::MUL: 41 case ISD::AND: 42 case ISD::OR: 43 case ISD::XOR: return true; 44 default: return false; // FIXME: Need associative info for user ops! 45 } 46} 47 48static unsigned ExactLog2(uint64_t Val) { 49 unsigned Count = 0; 50 while (Val != 1) { 51 Val >>= 1; 52 ++Count; 53 } 54 return Count; 55} 56 57// isInvertibleForFree - Return true if there is no cost to emitting the logical 58// inverse of this node. 59static bool isInvertibleForFree(SDOperand N) { 60 if (isa<ConstantSDNode>(N.Val)) return true; 61 if (isa<SetCCSDNode>(N.Val) && N.Val->hasOneUse()) 62 return true; 63 return false; 64} 65 66 67/// getSetCCSwappedOperands - Return the operation corresponding to (Y op X) 68/// when given the operation for (X op Y). 69ISD::CondCode ISD::getSetCCSwappedOperands(ISD::CondCode Operation) { 70 // To perform this operation, we just need to swap the L and G bits of the 71 // operation. 72 unsigned OldL = (Operation >> 2) & 1; 73 unsigned OldG = (Operation >> 1) & 1; 74 return ISD::CondCode((Operation & ~6) | // Keep the N, U, E bits 75 (OldL << 1) | // New G bit 76 (OldG << 2)); // New L bit. 77} 78 79/// getSetCCInverse - Return the operation corresponding to !(X op Y), where 80/// 'op' is a valid SetCC operation. 81ISD::CondCode ISD::getSetCCInverse(ISD::CondCode Op, bool isInteger) { 82 unsigned Operation = Op; 83 if (isInteger) 84 Operation ^= 7; // Flip L, G, E bits, but not U. 85 else 86 Operation ^= 15; // Flip all of the condition bits. 87 if (Operation > ISD::SETTRUE2) 88 Operation &= ~8; // Don't let N and U bits get set. 89 return ISD::CondCode(Operation); 90} 91 92 93/// isSignedOp - For an integer comparison, return 1 if the comparison is a 94/// signed operation and 2 if the result is an unsigned comparison. Return zero 95/// if the operation does not depend on the sign of the input (setne and seteq). 96static int isSignedOp(ISD::CondCode Opcode) { 97 switch (Opcode) { 98 default: assert(0 && "Illegal integer setcc operation!"); 99 case ISD::SETEQ: 100 case ISD::SETNE: return 0; 101 case ISD::SETLT: 102 case ISD::SETLE: 103 case ISD::SETGT: 104 case ISD::SETGE: return 1; 105 case ISD::SETULT: 106 case ISD::SETULE: 107 case ISD::SETUGT: 108 case ISD::SETUGE: return 2; 109 } 110} 111 112/// getSetCCOrOperation - Return the result of a logical OR between different 113/// comparisons of identical values: ((X op1 Y) | (X op2 Y)). This function 114/// returns SETCC_INVALID if it is not possible to represent the resultant 115/// comparison. 116ISD::CondCode ISD::getSetCCOrOperation(ISD::CondCode Op1, ISD::CondCode Op2, 117 bool isInteger) { 118 if (isInteger && (isSignedOp(Op1) | isSignedOp(Op2)) == 3) 119 // Cannot fold a signed integer setcc with an unsigned integer setcc. 120 return ISD::SETCC_INVALID; 121 122 unsigned Op = Op1 | Op2; // Combine all of the condition bits. 123 124 // If the N and U bits get set then the resultant comparison DOES suddenly 125 // care about orderedness, and is true when ordered. 126 if (Op > ISD::SETTRUE2) 127 Op &= ~16; // Clear the N bit. 128 return ISD::CondCode(Op); 129} 130 131/// getSetCCAndOperation - Return the result of a logical AND between different 132/// comparisons of identical values: ((X op1 Y) & (X op2 Y)). This 133/// function returns zero if it is not possible to represent the resultant 134/// comparison. 135ISD::CondCode ISD::getSetCCAndOperation(ISD::CondCode Op1, ISD::CondCode Op2, 136 bool isInteger) { 137 if (isInteger && (isSignedOp(Op1) | isSignedOp(Op2)) == 3) 138 // Cannot fold a signed setcc with an unsigned setcc. 139 return ISD::SETCC_INVALID; 140 141 // Combine all of the condition bits. 142 return ISD::CondCode(Op1 & Op2); 143} 144 145const TargetMachine &SelectionDAG::getTarget() const { 146 return TLI.getTargetMachine(); 147} 148 149 150/// RemoveDeadNodes - This method deletes all unreachable nodes in the 151/// SelectionDAG, including nodes (like loads) that have uses of their token 152/// chain but no other uses and no side effect. If a node is passed in as an 153/// argument, it is used as the seed for node deletion. 154void SelectionDAG::RemoveDeadNodes(SDNode *N) { 155 std::set<SDNode*> AllNodeSet(AllNodes.begin(), AllNodes.end()); 156 157 // Create a dummy node (which is not added to allnodes), that adds a reference 158 // to the root node, preventing it from being deleted. 159 SDNode *DummyNode = new SDNode(ISD::EntryToken, getRoot()); 160 161 DeleteNodeIfDead(N, &AllNodeSet); 162 163 Restart: 164 unsigned NumNodes = AllNodeSet.size(); 165 for (std::set<SDNode*>::iterator I = AllNodeSet.begin(), E = AllNodeSet.end(); 166 I != E; ++I) { 167 // Try to delete this node. 168 DeleteNodeIfDead(*I, &AllNodeSet); 169 170 // If we actually deleted any nodes, do not use invalid iterators in 171 // AllNodeSet. 172 if (AllNodeSet.size() != NumNodes) 173 goto Restart; 174 } 175 176 // Restore AllNodes. 177 if (AllNodes.size() != NumNodes) 178 AllNodes.assign(AllNodeSet.begin(), AllNodeSet.end()); 179 180 // If the root changed (e.g. it was a dead load, update the root). 181 setRoot(DummyNode->getOperand(0)); 182 183 // Now that we are done with the dummy node, delete it. 184 DummyNode->getOperand(0).Val->removeUser(DummyNode); 185 delete DummyNode; 186} 187 188void SelectionDAG::DeleteNodeIfDead(SDNode *N, void *NodeSet) { 189 if (!N->use_empty()) 190 return; 191 192 // Okay, we really are going to delete this node. First take this out of the 193 // appropriate CSE map. 194 switch (N->getOpcode()) { 195 case ISD::Constant: 196 Constants.erase(std::make_pair(cast<ConstantSDNode>(N)->getValue(), 197 N->getValueType(0))); 198 break; 199 case ISD::ConstantFP: { 200 union { 201 double DV; 202 uint64_t IV; 203 }; 204 DV = cast<ConstantFPSDNode>(N)->getValue(); 205 ConstantFPs.erase(std::make_pair(IV, N->getValueType(0))); 206 break; 207 } 208 case ISD::GlobalAddress: 209 GlobalValues.erase(cast<GlobalAddressSDNode>(N)->getGlobal()); 210 break; 211 case ISD::FrameIndex: 212 FrameIndices.erase(cast<FrameIndexSDNode>(N)->getIndex()); 213 break; 214 case ISD::ConstantPool: 215 ConstantPoolIndices.erase(cast<ConstantPoolSDNode>(N)->getIndex()); 216 break; 217 case ISD::BasicBlock: 218 BBNodes.erase(cast<BasicBlockSDNode>(N)->getBasicBlock()); 219 break; 220 case ISD::ExternalSymbol: 221 ExternalSymbols.erase(cast<ExternalSymbolSDNode>(N)->getSymbol()); 222 break; 223 224 case ISD::LOAD: 225 Loads.erase(std::make_pair(N->getOperand(1), 226 std::make_pair(N->getOperand(0), 227 N->getValueType(0)))); 228 break; 229 case ISD::SETCC: 230 SetCCs.erase(std::make_pair(std::make_pair(N->getOperand(0), 231 N->getOperand(1)), 232 std::make_pair( 233 cast<SetCCSDNode>(N)->getCondition(), 234 N->getValueType(0)))); 235 break; 236 case ISD::TRUNCSTORE: 237 case ISD::SIGN_EXTEND_INREG: 238 case ISD::FP_ROUND_INREG: 239 case ISD::EXTLOAD: 240 case ISD::SEXTLOAD: 241 case ISD::ZEXTLOAD: { 242 EVTStruct NN; 243 NN.Opcode = N->getOpcode(); 244 NN.VT = N->getValueType(0); 245 NN.EVT = cast<MVTSDNode>(N)->getExtraValueType(); 246 for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i) 247 NN.Ops.push_back(N->getOperand(i)); 248 MVTSDNodes.erase(NN); 249 break; 250 } 251 default: 252 if (N->getNumOperands() == 1) 253 UnaryOps.erase(std::make_pair(N->getOpcode(), 254 std::make_pair(N->getOperand(0), 255 N->getValueType(0)))); 256 else if (N->getNumOperands() == 2) 257 BinaryOps.erase(std::make_pair(N->getOpcode(), 258 std::make_pair(N->getOperand(0), 259 N->getOperand(1)))); 260 break; 261 } 262 263 // Next, brutally remove the operand list. 264 while (!N->Operands.empty()) { 265 SDNode *O = N->Operands.back().Val; 266 N->Operands.pop_back(); 267 O->removeUser(N); 268 269 // Now that we removed this operand, see if there are no uses of it left. 270 DeleteNodeIfDead(O, NodeSet); 271 } 272 273 // Remove the node from the nodes set and delete it. 274 std::set<SDNode*> &AllNodeSet = *(std::set<SDNode*>*)NodeSet; 275 AllNodeSet.erase(N); 276 277 // Now that the node is gone, check to see if any of the operands of this node 278 // are dead now. 279 delete N; 280} 281 282 283SelectionDAG::~SelectionDAG() { 284 for (unsigned i = 0, e = AllNodes.size(); i != e; ++i) 285 delete AllNodes[i]; 286} 287 288SDOperand SelectionDAG::getZeroExtendInReg(SDOperand Op, MVT::ValueType VT) { 289 if (Op.getValueType() == VT) return Op; 290 int64_t Imm = ~0ULL >> (64-MVT::getSizeInBits(VT)); 291 return getNode(ISD::AND, Op.getValueType(), Op, 292 getConstant(Imm, Op.getValueType())); 293} 294 295SDOperand SelectionDAG::getConstant(uint64_t Val, MVT::ValueType VT) { 296 assert(MVT::isInteger(VT) && "Cannot create FP integer constant!"); 297 // Mask out any bits that are not valid for this constant. 298 if (VT != MVT::i64) 299 Val &= ((uint64_t)1 << MVT::getSizeInBits(VT)) - 1; 300 301 SDNode *&N = Constants[std::make_pair(Val, VT)]; 302 if (N) return SDOperand(N, 0); 303 N = new ConstantSDNode(Val, VT); 304 AllNodes.push_back(N); 305 return SDOperand(N, 0); 306} 307 308SDOperand SelectionDAG::getConstantFP(double Val, MVT::ValueType VT) { 309 assert(MVT::isFloatingPoint(VT) && "Cannot create integer FP constant!"); 310 if (VT == MVT::f32) 311 Val = (float)Val; // Mask out extra precision. 312 313 // Do the map lookup using the actual bit pattern for the floating point 314 // value, so that we don't have problems with 0.0 comparing equal to -0.0, and 315 // we don't have issues with SNANs. 316 union { 317 double DV; 318 uint64_t IV; 319 }; 320 321 DV = Val; 322 323 SDNode *&N = ConstantFPs[std::make_pair(IV, VT)]; 324 if (N) return SDOperand(N, 0); 325 N = new ConstantFPSDNode(Val, VT); 326 AllNodes.push_back(N); 327 return SDOperand(N, 0); 328} 329 330 331 332SDOperand SelectionDAG::getGlobalAddress(const GlobalValue *GV, 333 MVT::ValueType VT) { 334 SDNode *&N = GlobalValues[GV]; 335 if (N) return SDOperand(N, 0); 336 N = new GlobalAddressSDNode(GV,VT); 337 AllNodes.push_back(N); 338 return SDOperand(N, 0); 339} 340 341SDOperand SelectionDAG::getFrameIndex(int FI, MVT::ValueType VT) { 342 SDNode *&N = FrameIndices[FI]; 343 if (N) return SDOperand(N, 0); 344 N = new FrameIndexSDNode(FI, VT); 345 AllNodes.push_back(N); 346 return SDOperand(N, 0); 347} 348 349SDOperand SelectionDAG::getConstantPool(unsigned CPIdx, MVT::ValueType VT) { 350 SDNode *N = ConstantPoolIndices[CPIdx]; 351 if (N) return SDOperand(N, 0); 352 N = new ConstantPoolSDNode(CPIdx, VT); 353 AllNodes.push_back(N); 354 return SDOperand(N, 0); 355} 356 357SDOperand SelectionDAG::getBasicBlock(MachineBasicBlock *MBB) { 358 SDNode *&N = BBNodes[MBB]; 359 if (N) return SDOperand(N, 0); 360 N = new BasicBlockSDNode(MBB); 361 AllNodes.push_back(N); 362 return SDOperand(N, 0); 363} 364 365SDOperand SelectionDAG::getExternalSymbol(const char *Sym, MVT::ValueType VT) { 366 SDNode *&N = ExternalSymbols[Sym]; 367 if (N) return SDOperand(N, 0); 368 N = new ExternalSymbolSDNode(Sym, VT); 369 AllNodes.push_back(N); 370 return SDOperand(N, 0); 371} 372 373SDOperand SelectionDAG::getSetCC(ISD::CondCode Cond, MVT::ValueType VT, 374 SDOperand N1, SDOperand N2) { 375 // These setcc operations always fold. 376 switch (Cond) { 377 default: break; 378 case ISD::SETFALSE: 379 case ISD::SETFALSE2: return getConstant(0, VT); 380 case ISD::SETTRUE: 381 case ISD::SETTRUE2: return getConstant(1, VT); 382 } 383 384 if (ConstantSDNode *N2C = dyn_cast<ConstantSDNode>(N2.Val)) { 385 uint64_t C2 = N2C->getValue(); 386 if (ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1.Val)) { 387 uint64_t C1 = N1C->getValue(); 388 389 // Sign extend the operands if required 390 if (ISD::isSignedIntSetCC(Cond)) { 391 C1 = N1C->getSignExtended(); 392 C2 = N2C->getSignExtended(); 393 } 394 395 switch (Cond) { 396 default: assert(0 && "Unknown integer setcc!"); 397 case ISD::SETEQ: return getConstant(C1 == C2, VT); 398 case ISD::SETNE: return getConstant(C1 != C2, VT); 399 case ISD::SETULT: return getConstant(C1 < C2, VT); 400 case ISD::SETUGT: return getConstant(C1 > C2, VT); 401 case ISD::SETULE: return getConstant(C1 <= C2, VT); 402 case ISD::SETUGE: return getConstant(C1 >= C2, VT); 403 case ISD::SETLT: return getConstant((int64_t)C1 < (int64_t)C2, VT); 404 case ISD::SETGT: return getConstant((int64_t)C1 > (int64_t)C2, VT); 405 case ISD::SETLE: return getConstant((int64_t)C1 <= (int64_t)C2, VT); 406 case ISD::SETGE: return getConstant((int64_t)C1 >= (int64_t)C2, VT); 407 } 408 } else { 409 // If the LHS is a ZERO_EXTEND and if this is an ==/!= comparison, perform 410 // the comparison on the input. 411 if (N1.getOpcode() == ISD::ZERO_EXTEND) { 412 unsigned InSize = MVT::getSizeInBits(N1.getOperand(0).getValueType()); 413 414 // If the comparison constant has bits in the upper part, the 415 // zero-extended value could never match. 416 if (C2 & (~0ULL << InSize)) { 417 unsigned VSize = MVT::getSizeInBits(N1.getValueType()); 418 switch (Cond) { 419 case ISD::SETUGT: 420 case ISD::SETUGE: 421 case ISD::SETEQ: return getConstant(0, VT); 422 case ISD::SETULT: 423 case ISD::SETULE: 424 case ISD::SETNE: return getConstant(1, VT); 425 case ISD::SETGT: 426 case ISD::SETGE: 427 // True if the sign bit of C2 is set. 428 return getConstant((C2 & (1ULL << VSize)) != 0, VT); 429 case ISD::SETLT: 430 case ISD::SETLE: 431 // True if the sign bit of C2 isn't set. 432 return getConstant((C2 & (1ULL << VSize)) == 0, VT); 433 default: 434 break; 435 } 436 } 437 438 // Otherwise, we can perform the comparison with the low bits. 439 switch (Cond) { 440 case ISD::SETEQ: 441 case ISD::SETNE: 442 case ISD::SETUGT: 443 case ISD::SETUGE: 444 case ISD::SETULT: 445 case ISD::SETULE: 446 return getSetCC(Cond, VT, N1.getOperand(0), 447 getConstant(C2, N1.getOperand(0).getValueType())); 448 default: 449 break; // todo, be more careful with signed comparisons 450 } 451 } 452 453 454 uint64_t MinVal, MaxVal; 455 unsigned OperandBitSize = MVT::getSizeInBits(N2C->getValueType(0)); 456 if (ISD::isSignedIntSetCC(Cond)) { 457 MinVal = 1ULL << (OperandBitSize-1); 458 if (OperandBitSize != 1) // Avoid X >> 64, which is undefined. 459 MaxVal = ~0ULL >> (65-OperandBitSize); 460 else 461 MaxVal = 0; 462 } else { 463 MinVal = 0; 464 MaxVal = ~0ULL >> (64-OperandBitSize); 465 } 466 467 // Canonicalize GE/LE comparisons to use GT/LT comparisons. 468 if (Cond == ISD::SETGE || Cond == ISD::SETUGE) { 469 if (C2 == MinVal) return getConstant(1, VT); // X >= MIN --> true 470 --C2; // X >= C1 --> X > (C1-1) 471 Cond = (Cond == ISD::SETGE) ? ISD::SETGT : ISD::SETUGT; 472 N2 = getConstant(C2, N2.getValueType()); 473 N2C = cast<ConstantSDNode>(N2.Val); 474 } 475 476 if (Cond == ISD::SETLE || Cond == ISD::SETULE) { 477 if (C2 == MaxVal) return getConstant(1, VT); // X <= MAX --> true 478 ++C2; // X <= C1 --> X < (C1+1) 479 Cond = (Cond == ISD::SETLE) ? ISD::SETLT : ISD::SETULT; 480 N2 = getConstant(C2, N2.getValueType()); 481 N2C = cast<ConstantSDNode>(N2.Val); 482 } 483 484 if ((Cond == ISD::SETLT || Cond == ISD::SETULT) && C2 == MinVal) 485 return getConstant(0, VT); // X < MIN --> false 486 487 // Canonicalize setgt X, Min --> setne X, Min 488 if ((Cond == ISD::SETGT || Cond == ISD::SETUGT) && C2 == MinVal) 489 return getSetCC(ISD::SETNE, VT, N1, N2); 490 491 // If we have setult X, 1, turn it into seteq X, 0 492 if ((Cond == ISD::SETLT || Cond == ISD::SETULT) && C2 == MinVal+1) 493 return getSetCC(ISD::SETEQ, VT, N1, 494 getConstant(MinVal, N1.getValueType())); 495 // If we have setugt X, Max-1, turn it into seteq X, Max 496 else if ((Cond == ISD::SETGT || Cond == ISD::SETUGT) && C2 == MaxVal-1) 497 return getSetCC(ISD::SETEQ, VT, N1, 498 getConstant(MaxVal, N1.getValueType())); 499 500 // If we have "setcc X, C1", check to see if we can shrink the immediate 501 // by changing cc. 502 503 // SETUGT X, SINTMAX -> SETLT X, 0 504 if (Cond == ISD::SETUGT && OperandBitSize != 1 && 505 C2 == (~0ULL >> (65-OperandBitSize))) 506 return getSetCC(ISD::SETLT, VT, N1, getConstant(0, N2.getValueType())); 507 508 // FIXME: Implement the rest of these. 509 510 511 // Fold bit comparisons when we can. 512 if ((Cond == ISD::SETEQ || Cond == ISD::SETNE) && 513 VT == N1.getValueType() && N1.getOpcode() == ISD::AND) 514 if (ConstantSDNode *AndRHS = 515 dyn_cast<ConstantSDNode>(N1.getOperand(1))) { 516 if (Cond == ISD::SETNE && C2 == 0) {// (X & 8) != 0 --> (X & 8) >> 3 517 // Perform the xform if the AND RHS is a single bit. 518 if ((AndRHS->getValue() & (AndRHS->getValue()-1)) == 0) { 519 return getNode(ISD::SRL, VT, N1, 520 getConstant(ExactLog2(AndRHS->getValue()), 521 TLI.getShiftAmountTy())); 522 } 523 } else if (Cond == ISD::SETEQ && C2 == AndRHS->getValue()) { 524 // (X & 8) == 8 --> (X & 8) >> 3 525 // Perform the xform if C2 is a single bit. 526 if ((C2 & (C2-1)) == 0) { 527 return getNode(ISD::SRL, VT, N1, 528 getConstant(ExactLog2(C2),TLI.getShiftAmountTy())); 529 } 530 } 531 } 532 } 533 } else if (isa<ConstantSDNode>(N1.Val)) { 534 // Ensure that the constant occurs on the RHS. 535 return getSetCC(ISD::getSetCCSwappedOperands(Cond), VT, N2, N1); 536 } 537 538 if (ConstantFPSDNode *N1C = dyn_cast<ConstantFPSDNode>(N1.Val)) 539 if (ConstantFPSDNode *N2C = dyn_cast<ConstantFPSDNode>(N2.Val)) { 540 double C1 = N1C->getValue(), C2 = N2C->getValue(); 541 542 switch (Cond) { 543 default: break; // FIXME: Implement the rest of these! 544 case ISD::SETEQ: return getConstant(C1 == C2, VT); 545 case ISD::SETNE: return getConstant(C1 != C2, VT); 546 case ISD::SETLT: return getConstant(C1 < C2, VT); 547 case ISD::SETGT: return getConstant(C1 > C2, VT); 548 case ISD::SETLE: return getConstant(C1 <= C2, VT); 549 case ISD::SETGE: return getConstant(C1 >= C2, VT); 550 } 551 } else { 552 // Ensure that the constant occurs on the RHS. 553 Cond = ISD::getSetCCSwappedOperands(Cond); 554 std::swap(N1, N2); 555 } 556 557 if (N1 == N2) { 558 // We can always fold X == Y for integer setcc's. 559 if (MVT::isInteger(N1.getValueType())) 560 return getConstant(ISD::isTrueWhenEqual(Cond), VT); 561 unsigned UOF = ISD::getUnorderedFlavor(Cond); 562 if (UOF == 2) // FP operators that are undefined on NaNs. 563 return getConstant(ISD::isTrueWhenEqual(Cond), VT); 564 if (UOF == unsigned(ISD::isTrueWhenEqual(Cond))) 565 return getConstant(UOF, VT); 566 // Otherwise, we can't fold it. However, we can simplify it to SETUO/SETO 567 // if it is not already. 568 Cond = UOF == 0 ? ISD::SETUO : ISD::SETO; 569 } 570 571 if ((Cond == ISD::SETEQ || Cond == ISD::SETNE) && 572 MVT::isInteger(N1.getValueType())) { 573 if (N1.getOpcode() == ISD::ADD || N1.getOpcode() == ISD::SUB || 574 N1.getOpcode() == ISD::XOR) { 575 // Simplify (X+Y) == (X+Z) --> Y == Z 576 if (N1.getOpcode() == N2.getOpcode()) { 577 if (N1.getOperand(0) == N2.getOperand(0)) 578 return getSetCC(Cond, VT, N1.getOperand(1), N2.getOperand(1)); 579 if (N1.getOperand(1) == N2.getOperand(1)) 580 return getSetCC(Cond, VT, N1.getOperand(0), N2.getOperand(0)); 581 if (isCommutativeBinOp(N1.getOpcode())) { 582 // If X op Y == Y op X, try other combinations. 583 if (N1.getOperand(0) == N2.getOperand(1)) 584 return getSetCC(Cond, VT, N1.getOperand(1), N2.getOperand(0)); 585 if (N1.getOperand(1) == N2.getOperand(0)) 586 return getSetCC(Cond, VT, N1.getOperand(1), N2.getOperand(1)); 587 } 588 } 589 590 // FIXME: move this stuff to the DAG Combiner when it exists! 591 592 // Simplify (X+Z) == X --> Z == 0 593 if (N1.getOperand(0) == N2) 594 return getSetCC(Cond, VT, N1.getOperand(1), 595 getConstant(0, N1.getValueType())); 596 if (N1.getOperand(1) == N2) { 597 if (isCommutativeBinOp(N1.getOpcode())) 598 return getSetCC(Cond, VT, N1.getOperand(0), 599 getConstant(0, N1.getValueType())); 600 else { 601 assert(N1.getOpcode() == ISD::SUB && "Unexpected operation!"); 602 // (Z-X) == X --> Z == X<<1 603 return getSetCC(Cond, VT, N1.getOperand(0), 604 getNode(ISD::SHL, N2.getValueType(), 605 N2, getConstant(1, TLI.getShiftAmountTy()))); 606 } 607 } 608 } 609 610 if (N2.getOpcode() == ISD::ADD || N2.getOpcode() == ISD::SUB || 611 N2.getOpcode() == ISD::XOR) { 612 // Simplify X == (X+Z) --> Z == 0 613 if (N2.getOperand(0) == N1) 614 return getSetCC(Cond, VT, N2.getOperand(1), 615 getConstant(0, N2.getValueType())); 616 else if (N2.getOperand(1) == N1) 617 return getSetCC(Cond, VT, N2.getOperand(0), 618 getConstant(0, N2.getValueType())); 619 } 620 } 621 622 // Fold away ALL boolean setcc's. 623 if (N1.getValueType() == MVT::i1) { 624 switch (Cond) { 625 default: assert(0 && "Unknown integer setcc!"); 626 case ISD::SETEQ: // X == Y -> (X^Y)^1 627 N1 = getNode(ISD::XOR, MVT::i1, 628 getNode(ISD::XOR, MVT::i1, N1, N2), 629 getConstant(1, MVT::i1)); 630 break; 631 case ISD::SETNE: // X != Y --> (X^Y) 632 N1 = getNode(ISD::XOR, MVT::i1, N1, N2); 633 break; 634 case ISD::SETGT: // X >s Y --> X == 0 & Y == 1 --> X^1 & Y 635 case ISD::SETULT: // X <u Y --> X == 0 & Y == 1 --> X^1 & Y 636 N1 = getNode(ISD::AND, MVT::i1, N2, 637 getNode(ISD::XOR, MVT::i1, N1, getConstant(1, MVT::i1))); 638 break; 639 case ISD::SETLT: // X <s Y --> X == 1 & Y == 0 --> Y^1 & X 640 case ISD::SETUGT: // X >u Y --> X == 1 & Y == 0 --> Y^1 & X 641 N1 = getNode(ISD::AND, MVT::i1, N1, 642 getNode(ISD::XOR, MVT::i1, N2, getConstant(1, MVT::i1))); 643 break; 644 case ISD::SETULE: // X <=u Y --> X == 0 | Y == 1 --> X^1 | Y 645 case ISD::SETGE: // X >=s Y --> X == 0 | Y == 1 --> X^1 | Y 646 N1 = getNode(ISD::OR, MVT::i1, N2, 647 getNode(ISD::XOR, MVT::i1, N1, getConstant(1, MVT::i1))); 648 break; 649 case ISD::SETUGE: // X >=u Y --> X == 1 | Y == 0 --> Y^1 | X 650 case ISD::SETLE: // X <=s Y --> X == 1 | Y == 0 --> Y^1 | X 651 N1 = getNode(ISD::OR, MVT::i1, N1, 652 getNode(ISD::XOR, MVT::i1, N2, getConstant(1, MVT::i1))); 653 break; 654 } 655 if (VT != MVT::i1) 656 N1 = getNode(ISD::ZERO_EXTEND, VT, N1); 657 return N1; 658 } 659 660 661 SetCCSDNode *&N = SetCCs[std::make_pair(std::make_pair(N1, N2), 662 std::make_pair(Cond, VT))]; 663 if (N) return SDOperand(N, 0); 664 N = new SetCCSDNode(Cond, N1, N2); 665 N->setValueTypes(VT); 666 AllNodes.push_back(N); 667 return SDOperand(N, 0); 668} 669 670 671 672/// getNode - Gets or creates the specified node. 673/// 674SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT) { 675 SDNode *N = new SDNode(Opcode, VT); 676 AllNodes.push_back(N); 677 return SDOperand(N, 0); 678} 679 680SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT, 681 SDOperand Operand) { 682 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Operand.Val)) { 683 uint64_t Val = C->getValue(); 684 switch (Opcode) { 685 default: break; 686 case ISD::SIGN_EXTEND: return getConstant(C->getSignExtended(), VT); 687 case ISD::ZERO_EXTEND: return getConstant(Val, VT); 688 case ISD::TRUNCATE: return getConstant(Val, VT); 689 case ISD::SINT_TO_FP: return getConstantFP(C->getSignExtended(), VT); 690 case ISD::UINT_TO_FP: return getConstantFP(C->getValue(), VT); 691 } 692 } 693 694 if (ConstantFPSDNode *C = dyn_cast<ConstantFPSDNode>(Operand.Val)) 695 switch (Opcode) { 696 case ISD::FNEG: 697 return getConstantFP(-C->getValue(), VT); 698 case ISD::FP_ROUND: 699 case ISD::FP_EXTEND: 700 return getConstantFP(C->getValue(), VT); 701 case ISD::FP_TO_SINT: 702 return getConstant((int64_t)C->getValue(), VT); 703 case ISD::FP_TO_UINT: 704 return getConstant((uint64_t)C->getValue(), VT); 705 } 706 707 unsigned OpOpcode = Operand.Val->getOpcode(); 708 switch (Opcode) { 709 case ISD::TokenFactor: 710 return Operand; // Factor of one node? No factor. 711 case ISD::SIGN_EXTEND: 712 if (Operand.getValueType() == VT) return Operand; // noop extension 713 if (OpOpcode == ISD::SIGN_EXTEND || OpOpcode == ISD::ZERO_EXTEND) 714 return getNode(OpOpcode, VT, Operand.Val->getOperand(0)); 715 break; 716 case ISD::ZERO_EXTEND: 717 if (Operand.getValueType() == VT) return Operand; // noop extension 718 if (OpOpcode == ISD::ZERO_EXTEND) // (zext (zext x)) -> (zext x) 719 return getNode(ISD::ZERO_EXTEND, VT, Operand.Val->getOperand(0)); 720 break; 721 case ISD::TRUNCATE: 722 if (Operand.getValueType() == VT) return Operand; // noop truncate 723 if (OpOpcode == ISD::TRUNCATE) 724 return getNode(ISD::TRUNCATE, VT, Operand.Val->getOperand(0)); 725 else if (OpOpcode == ISD::ZERO_EXTEND || OpOpcode == ISD::SIGN_EXTEND) { 726 // If the source is smaller than the dest, we still need an extend. 727 if (Operand.Val->getOperand(0).getValueType() < VT) 728 return getNode(OpOpcode, VT, Operand.Val->getOperand(0)); 729 else if (Operand.Val->getOperand(0).getValueType() > VT) 730 return getNode(ISD::TRUNCATE, VT, Operand.Val->getOperand(0)); 731 else 732 return Operand.Val->getOperand(0); 733 } 734 break; 735 case ISD::FNEG: 736 if (OpOpcode == ISD::SUB) // -(X-Y) -> (Y-X) 737 return getNode(ISD::SUB, VT, Operand.Val->getOperand(1), 738 Operand.Val->getOperand(0)); 739 if (OpOpcode == ISD::FNEG) // --X -> X 740 return Operand.Val->getOperand(0); 741 break; 742 case ISD::FABS: 743 if (OpOpcode == ISD::FNEG) // abs(-X) -> abs(X) 744 return getNode(ISD::FABS, VT, Operand.Val->getOperand(0)); 745 break; 746 } 747 748 SDNode *&N = UnaryOps[std::make_pair(Opcode, std::make_pair(Operand, VT))]; 749 if (N) return SDOperand(N, 0); 750 N = new SDNode(Opcode, Operand); 751 N->setValueTypes(VT); 752 AllNodes.push_back(N); 753 return SDOperand(N, 0); 754} 755 756/// MaskedValueIsZero - Return true if 'V & Mask' is known to be zero. We use 757/// this predicate to simplify operations downstream. V and Mask are known to 758/// be the same type. 759static bool MaskedValueIsZero(const SDOperand &Op, uint64_t Mask, 760 const TargetLowering &TLI) { 761 unsigned SrcBits; 762 if (Mask == 0) return true; 763 764 // If we know the result of a setcc has the top bits zero, use this info. 765 switch (Op.getOpcode()) { 766 case ISD::UNDEF: 767 return true; 768 case ISD::Constant: 769 return (cast<ConstantSDNode>(Op)->getValue() & Mask) == 0; 770 771 case ISD::SETCC: 772 return ((Mask & 1) == 0) && 773 TLI.getSetCCResultContents() == TargetLowering::ZeroOrOneSetCCResult; 774 775 case ISD::ZEXTLOAD: 776 SrcBits = MVT::getSizeInBits(cast<MVTSDNode>(Op)->getExtraValueType()); 777 return (Mask & ((1ULL << SrcBits)-1)) == 0; // Returning only the zext bits. 778 case ISD::ZERO_EXTEND: 779 SrcBits = MVT::getSizeInBits(Op.getOperand(0).getValueType()); 780 return MaskedValueIsZero(Op.getOperand(0),Mask & ((1ULL << SrcBits)-1),TLI); 781 782 case ISD::AND: 783 // (X & C1) & C2 == 0 iff C1 & C2 == 0. 784 if (ConstantSDNode *AndRHS = dyn_cast<ConstantSDNode>(Op.getOperand(1))) 785 return MaskedValueIsZero(Op.getOperand(0),AndRHS->getValue() & Mask, TLI); 786 787 // FALL THROUGH 788 case ISD::OR: 789 case ISD::XOR: 790 return MaskedValueIsZero(Op.getOperand(0), Mask, TLI) && 791 MaskedValueIsZero(Op.getOperand(1), Mask, TLI); 792 case ISD::SELECT: 793 return MaskedValueIsZero(Op.getOperand(1), Mask, TLI) && 794 MaskedValueIsZero(Op.getOperand(2), Mask, TLI); 795 796 case ISD::SRL: 797 // (ushr X, C1) & C2 == 0 iff X & (C2 << C1) == 0 798 if (ConstantSDNode *ShAmt = dyn_cast<ConstantSDNode>(Op.getOperand(1))) { 799 uint64_t NewVal = Mask << ShAmt->getValue(); 800 SrcBits = MVT::getSizeInBits(Op.getValueType()); 801 if (SrcBits != 64) NewVal &= (1ULL << SrcBits)-1; 802 return MaskedValueIsZero(Op.getOperand(0), NewVal, TLI); 803 } 804 return false; 805 case ISD::SHL: 806 // (ushl X, C1) & C2 == 0 iff X & (C2 >> C1) == 0 807 if (ConstantSDNode *ShAmt = dyn_cast<ConstantSDNode>(Op.getOperand(1))) { 808 uint64_t NewVal = Mask >> ShAmt->getValue(); 809 return MaskedValueIsZero(Op.getOperand(0), NewVal, TLI); 810 } 811 return false; 812 // TODO we could handle some SRA cases here. 813 default: break; 814 } 815 816 return false; 817} 818 819 820 821SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT, 822 SDOperand N1, SDOperand N2) { 823#ifndef NDEBUG 824 switch (Opcode) { 825 case ISD::TokenFactor: 826 assert(VT == MVT::Other && N1.getValueType() == MVT::Other && 827 N2.getValueType() == MVT::Other && "Invalid token factor!"); 828 break; 829 case ISD::AND: 830 case ISD::OR: 831 case ISD::XOR: 832 case ISD::UDIV: 833 case ISD::UREM: 834 assert(MVT::isInteger(VT) && "This operator does not apply to FP types!"); 835 // fall through 836 case ISD::ADD: 837 case ISD::SUB: 838 case ISD::MUL: 839 case ISD::SDIV: 840 case ISD::SREM: 841 assert(N1.getValueType() == N2.getValueType() && 842 N1.getValueType() == VT && "Binary operator types must match!"); 843 break; 844 845 case ISD::SHL: 846 case ISD::SRA: 847 case ISD::SRL: 848 assert(VT == N1.getValueType() && 849 "Shift operators return type must be the same as their first arg"); 850 assert(MVT::isInteger(VT) && MVT::isInteger(N2.getValueType()) && 851 VT != MVT::i1 && "Shifts only work on integers"); 852 break; 853 default: break; 854 } 855#endif 856 857 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1.Val); 858 ConstantSDNode *N2C = dyn_cast<ConstantSDNode>(N2.Val); 859 if (N1C) { 860 if (N2C) { 861 uint64_t C1 = N1C->getValue(), C2 = N2C->getValue(); 862 switch (Opcode) { 863 case ISD::ADD: return getConstant(C1 + C2, VT); 864 case ISD::SUB: return getConstant(C1 - C2, VT); 865 case ISD::MUL: return getConstant(C1 * C2, VT); 866 case ISD::UDIV: 867 if (C2) return getConstant(C1 / C2, VT); 868 break; 869 case ISD::UREM : 870 if (C2) return getConstant(C1 % C2, VT); 871 break; 872 case ISD::SDIV : 873 if (C2) return getConstant(N1C->getSignExtended() / 874 N2C->getSignExtended(), VT); 875 break; 876 case ISD::SREM : 877 if (C2) return getConstant(N1C->getSignExtended() % 878 N2C->getSignExtended(), VT); 879 break; 880 case ISD::AND : return getConstant(C1 & C2, VT); 881 case ISD::OR : return getConstant(C1 | C2, VT); 882 case ISD::XOR : return getConstant(C1 ^ C2, VT); 883 case ISD::SHL : return getConstant(C1 << (int)C2, VT); 884 case ISD::SRL : return getConstant(C1 >> (unsigned)C2, VT); 885 case ISD::SRA : return getConstant(N1C->getSignExtended() >>(int)C2, VT); 886 default: break; 887 } 888 889 } else { // Cannonicalize constant to RHS if commutative 890 if (isCommutativeBinOp(Opcode)) { 891 std::swap(N1C, N2C); 892 std::swap(N1, N2); 893 } 894 } 895 896 switch (Opcode) { 897 default: break; 898 case ISD::SHL: // shl 0, X -> 0 899 if (N1C->isNullValue()) return N1; 900 break; 901 case ISD::SRL: // srl 0, X -> 0 902 if (N1C->isNullValue()) return N1; 903 break; 904 case ISD::SRA: // sra -1, X -> -1 905 if (N1C->isAllOnesValue()) return N1; 906 break; 907 } 908 } 909 910 if (N2C) { 911 uint64_t C2 = N2C->getValue(); 912 913 switch (Opcode) { 914 case ISD::ADD: 915 if (!C2) return N1; // add X, 0 -> X 916 break; 917 case ISD::SUB: 918 if (!C2) return N1; // sub X, 0 -> X 919 break; 920 case ISD::MUL: 921 if (!C2) return N2; // mul X, 0 -> 0 922 if (N2C->isAllOnesValue()) // mul X, -1 -> 0-X 923 return getNode(ISD::SUB, VT, getConstant(0, VT), N1); 924 925 // FIXME: Move this to the DAG combiner when it exists. 926 if ((C2 & C2-1) == 0) { 927 SDOperand ShAmt = getConstant(ExactLog2(C2), TLI.getShiftAmountTy()); 928 return getNode(ISD::SHL, VT, N1, ShAmt); 929 } 930 break; 931 932 case ISD::UDIV: 933 // FIXME: Move this to the DAG combiner when it exists. 934 if ((C2 & C2-1) == 0 && C2) { 935 SDOperand ShAmt = getConstant(ExactLog2(C2), TLI.getShiftAmountTy()); 936 return getNode(ISD::SRL, VT, N1, ShAmt); 937 } 938 break; 939 940 case ISD::SHL: 941 case ISD::SRL: 942 case ISD::SRA: 943 // If the shift amount is bigger than the size of the data, then all the 944 // bits are shifted out. Simplify to undef. 945 if (C2 >= MVT::getSizeInBits(N1.getValueType())) { 946 return getNode(ISD::UNDEF, N1.getValueType()); 947 } 948 if (C2 == 0) return N1; 949 950 if (Opcode == ISD::SHL && N1.getNumOperands() == 2) 951 if (ConstantSDNode *OpSA = dyn_cast<ConstantSDNode>(N1.getOperand(1))) { 952 unsigned OpSAC = OpSA->getValue(); 953 if (N1.getOpcode() == ISD::SHL) { 954 if (C2+OpSAC >= MVT::getSizeInBits(N1.getValueType())) 955 return getConstant(0, N1.getValueType()); 956 return getNode(ISD::SHL, N1.getValueType(), N1.getOperand(0), 957 getConstant(C2+OpSAC, N2.getValueType())); 958 } else if (N1.getOpcode() == ISD::SRL) { 959 // (X >> C1) << C2: if C2 > C1, ((X & ~0<<C1) << C2-C1) 960 SDOperand Mask = getNode(ISD::AND, VT, N1.getOperand(0), 961 getConstant(~0ULL << OpSAC, VT)); 962 if (C2 > OpSAC) { 963 return getNode(ISD::SHL, VT, Mask, 964 getConstant(C2-OpSAC, N2.getValueType())); 965 } else { 966 // (X >> C1) << C2: if C2 <= C1, ((X & ~0<<C1) >> C1-C2) 967 return getNode(ISD::SRL, VT, Mask, 968 getConstant(OpSAC-C2, N2.getValueType())); 969 } 970 } else if (N1.getOpcode() == ISD::SRA) { 971 // if C1 == C2, just mask out low bits. 972 if (C2 == OpSAC) 973 return getNode(ISD::AND, VT, N1.getOperand(0), 974 getConstant(~0ULL << C2, VT)); 975 } 976 } 977 break; 978 979 case ISD::AND: 980 if (!C2) return N2; // X and 0 -> 0 981 if (N2C->isAllOnesValue()) 982 return N1; // X and -1 -> X 983 984 if (MaskedValueIsZero(N1, C2, TLI)) // X and 0 -> 0 985 return getConstant(0, VT); 986 987 { 988 uint64_t NotC2 = ~C2; 989 if (VT != MVT::i64) 990 NotC2 &= (1ULL << MVT::getSizeInBits(VT))-1; 991 992 if (MaskedValueIsZero(N1, NotC2, TLI)) 993 return N1; // if (X & ~C2) -> 0, the and is redundant 994 } 995 996 // FIXME: Should add a corresponding version of this for 997 // ZERO_EXTEND/SIGN_EXTEND by converting them to an ANY_EXTEND node which 998 // we don't have yet. 999 1000 // and (sign_extend_inreg x:16:32), 1 -> and x, 1 1001 if (N1.getOpcode() == ISD::SIGN_EXTEND_INREG) { 1002 // If we are masking out the part of our input that was extended, just 1003 // mask the input to the extension directly. 1004 unsigned ExtendBits = 1005 MVT::getSizeInBits(cast<MVTSDNode>(N1)->getExtraValueType()); 1006 if ((C2 & (~0ULL << ExtendBits)) == 0) 1007 return getNode(ISD::AND, VT, N1.getOperand(0), N2); 1008 } 1009 break; 1010 case ISD::OR: 1011 if (!C2)return N1; // X or 0 -> X 1012 if (N2C->isAllOnesValue()) 1013 return N2; // X or -1 -> -1 1014 break; 1015 case ISD::XOR: 1016 if (!C2) return N1; // X xor 0 -> X 1017 if (N2C->isAllOnesValue()) { 1018 if (SetCCSDNode *SetCC = dyn_cast<SetCCSDNode>(N1.Val)){ 1019 // !(X op Y) -> (X !op Y) 1020 bool isInteger = MVT::isInteger(SetCC->getOperand(0).getValueType()); 1021 return getSetCC(ISD::getSetCCInverse(SetCC->getCondition(),isInteger), 1022 SetCC->getValueType(0), 1023 SetCC->getOperand(0), SetCC->getOperand(1)); 1024 } else if (N1.getOpcode() == ISD::AND || N1.getOpcode() == ISD::OR) { 1025 SDNode *Op = N1.Val; 1026 // !(X or Y) -> (!X and !Y) iff X or Y are freely invertible 1027 // !(X and Y) -> (!X or !Y) iff X or Y are freely invertible 1028 SDOperand LHS = Op->getOperand(0), RHS = Op->getOperand(1); 1029 if (isInvertibleForFree(RHS) || isInvertibleForFree(LHS)) { 1030 LHS = getNode(ISD::XOR, VT, LHS, N2); // RHS = ~LHS 1031 RHS = getNode(ISD::XOR, VT, RHS, N2); // RHS = ~RHS 1032 if (Op->getOpcode() == ISD::AND) 1033 return getNode(ISD::OR, VT, LHS, RHS); 1034 return getNode(ISD::AND, VT, LHS, RHS); 1035 } 1036 } 1037 // X xor -1 -> not(x) ? 1038 } 1039 break; 1040 } 1041 1042 // Reassociate ((X op C1) op C2) if possible. 1043 if (N1.getOpcode() == Opcode && isAssociativeBinOp(Opcode)) 1044 if (ConstantSDNode *N3C = dyn_cast<ConstantSDNode>(N1.Val->getOperand(1))) 1045 return getNode(Opcode, VT, N1.Val->getOperand(0), 1046 getNode(Opcode, VT, N2, N1.Val->getOperand(1))); 1047 } 1048 1049 ConstantFPSDNode *N1CFP = dyn_cast<ConstantFPSDNode>(N1.Val); 1050 ConstantFPSDNode *N2CFP = dyn_cast<ConstantFPSDNode>(N2.Val); 1051 if (N1CFP) 1052 if (N2CFP) { 1053 double C1 = N1CFP->getValue(), C2 = N2CFP->getValue(); 1054 switch (Opcode) { 1055 case ISD::ADD: return getConstantFP(C1 + C2, VT); 1056 case ISD::SUB: return getConstantFP(C1 - C2, VT); 1057 case ISD::MUL: return getConstantFP(C1 * C2, VT); 1058 case ISD::SDIV: 1059 if (C2) return getConstantFP(C1 / C2, VT); 1060 break; 1061 case ISD::SREM : 1062 if (C2) return getConstantFP(fmod(C1, C2), VT); 1063 break; 1064 default: break; 1065 } 1066 1067 } else { // Cannonicalize constant to RHS if commutative 1068 if (isCommutativeBinOp(Opcode)) { 1069 std::swap(N1CFP, N2CFP); 1070 std::swap(N1, N2); 1071 } 1072 } 1073 1074 // Finally, fold operations that do not require constants. 1075 switch (Opcode) { 1076 case ISD::TokenFactor: 1077 if (N1.getOpcode() == ISD::EntryToken) 1078 return N2; 1079 if (N2.getOpcode() == ISD::EntryToken) 1080 return N1; 1081 break; 1082 1083 case ISD::AND: 1084 case ISD::OR: 1085 if (SetCCSDNode *LHS = dyn_cast<SetCCSDNode>(N1.Val)) 1086 if (SetCCSDNode *RHS = dyn_cast<SetCCSDNode>(N2.Val)) { 1087 SDOperand LL = LHS->getOperand(0), RL = RHS->getOperand(0); 1088 SDOperand LR = LHS->getOperand(1), RR = RHS->getOperand(1); 1089 ISD::CondCode Op2 = RHS->getCondition(); 1090 1091 if (LR == RR && isa<ConstantSDNode>(LR) && 1092 Op2 == LHS->getCondition() && MVT::isInteger(LL.getValueType())) { 1093 // (X != 0) | (Y != 0) -> (X|Y != 0) 1094 // (X == 0) & (Y == 0) -> (X|Y == 0) 1095 // (X < 0) | (Y < 0) -> (X|Y < 0) 1096 if (cast<ConstantSDNode>(LR)->getValue() == 0 && 1097 ((Op2 == ISD::SETEQ && Opcode == ISD::AND) || 1098 (Op2 == ISD::SETNE && Opcode == ISD::OR) || 1099 (Op2 == ISD::SETLT && Opcode == ISD::OR))) 1100 return getSetCC(Op2, VT, 1101 getNode(ISD::OR, LR.getValueType(), LL, RL), LR); 1102 1103 if (cast<ConstantSDNode>(LR)->isAllOnesValue()) { 1104 // (X == -1) & (Y == -1) -> (X&Y == -1) 1105 // (X != -1) | (Y != -1) -> (X&Y != -1) 1106 // (X > -1) | (Y > -1) -> (X&Y > -1) 1107 if ((Opcode == ISD::AND && Op2 == ISD::SETEQ) || 1108 (Opcode == ISD::OR && Op2 == ISD::SETNE) || 1109 (Opcode == ISD::OR && Op2 == ISD::SETGT)) 1110 return getSetCC(Op2, VT, 1111 getNode(ISD::AND, LR.getValueType(), LL, RL), LR); 1112 // (X > -1) & (Y > -1) -> (X|Y > -1) 1113 if (Opcode == ISD::AND && Op2 == ISD::SETGT) 1114 return getSetCC(Op2, VT, 1115 getNode(ISD::OR, LR.getValueType(), LL, RL), LR); 1116 } 1117 } 1118 1119 // (X op1 Y) | (Y op2 X) -> (X op1 Y) | (X swapop2 Y) 1120 if (LL == RR && LR == RL) { 1121 Op2 = ISD::getSetCCSwappedOperands(Op2); 1122 goto MatchedBackwards; 1123 } 1124 1125 if (LL == RL && LR == RR) { 1126 MatchedBackwards: 1127 ISD::CondCode Result; 1128 bool isInteger = MVT::isInteger(LL.getValueType()); 1129 if (Opcode == ISD::OR) 1130 Result = ISD::getSetCCOrOperation(LHS->getCondition(), Op2, 1131 isInteger); 1132 else 1133 Result = ISD::getSetCCAndOperation(LHS->getCondition(), Op2, 1134 isInteger); 1135 if (Result != ISD::SETCC_INVALID) 1136 return getSetCC(Result, LHS->getValueType(0), LL, LR); 1137 } 1138 } 1139 1140 // and/or zext(a), zext(b) -> zext(and/or a, b) 1141 if (N1.getOpcode() == ISD::ZERO_EXTEND && 1142 N2.getOpcode() == ISD::ZERO_EXTEND && 1143 N1.getOperand(0).getValueType() == N2.getOperand(0).getValueType()) 1144 return getNode(ISD::ZERO_EXTEND, VT, 1145 getNode(Opcode, N1.getOperand(0).getValueType(), 1146 N1.getOperand(0), N2.getOperand(0))); 1147 break; 1148 case ISD::XOR: 1149 if (N1 == N2) return getConstant(0, VT); // xor X, Y -> 0 1150 break; 1151 case ISD::ADD: 1152 if (N2.getOpcode() == ISD::FNEG) // (A+ (-B) -> A-B 1153 return getNode(ISD::SUB, VT, N1, N2.getOperand(0)); 1154 if (N1.getOpcode() == ISD::FNEG) // ((-A)+B) -> B-A 1155 return getNode(ISD::SUB, VT, N2, N1.getOperand(0)); 1156 if (N1.getOpcode() == ISD::SUB && isa<ConstantSDNode>(N1.getOperand(0)) && 1157 cast<ConstantSDNode>(N1.getOperand(0))->getValue() == 0) 1158 return getNode(ISD::SUB, VT, N2, N1.getOperand(1)); // (0-A)+B -> B-A 1159 if (N2.getOpcode() == ISD::SUB && isa<ConstantSDNode>(N2.getOperand(0)) && 1160 cast<ConstantSDNode>(N2.getOperand(0))->getValue() == 0) 1161 return getNode(ISD::SUB, VT, N1, N2.getOperand(1)); // A+(0-B) -> A-B 1162 break; 1163 case ISD::SUB: 1164 if (N1.getOpcode() == ISD::ADD) { 1165 if (N1.Val->getOperand(0) == N2) 1166 return N1.Val->getOperand(1); // (A+B)-A == B 1167 if (N1.Val->getOperand(1) == N2) 1168 return N1.Val->getOperand(0); // (A+B)-B == A 1169 } 1170 if (N2.getOpcode() == ISD::FNEG) // (A- (-B) -> A+B 1171 return getNode(ISD::ADD, VT, N1, N2.getOperand(0)); 1172 break; 1173 // FIXME: figure out how to safely handle things like 1174 // int foo(int x) { return 1 << (x & 255); } 1175 // int bar() { return foo(256); } 1176#if 0 1177 case ISD::SHL: 1178 case ISD::SRL: 1179 case ISD::SRA: 1180 if (N2.getOpcode() == ISD::SIGN_EXTEND_INREG && 1181 cast<MVTSDNode>(N2)->getExtraValueType() != MVT::i1) 1182 return getNode(Opcode, VT, N1, N2.getOperand(0)); 1183 else if (N2.getOpcode() == ISD::AND) 1184 if (ConstantSDNode *AndRHS = dyn_cast<ConstantSDNode>(N2.getOperand(1))) { 1185 // If the and is only masking out bits that cannot effect the shift, 1186 // eliminate the and. 1187 unsigned NumBits = MVT::getSizeInBits(VT); 1188 if ((AndRHS->getValue() & (NumBits-1)) == NumBits-1) 1189 return getNode(Opcode, VT, N1, N2.getOperand(0)); 1190 } 1191 break; 1192#endif 1193 } 1194 1195 // Memoize this node if possible. 1196 SDNode *N; 1197 if (Opcode != ISD::ADJCALLSTACKDOWN) { 1198 SDNode *&BON = BinaryOps[std::make_pair(Opcode, std::make_pair(N1, N2))]; 1199 if (BON) return SDOperand(BON, 0); 1200 1201 BON = N = new SDNode(Opcode, N1, N2); 1202 } else { 1203 N = new SDNode(ISD::ADJCALLSTACKDOWN, N1, N2); 1204 } 1205 1206 1207 if (Opcode != ISD::READPORT && Opcode != ISD::READIO) 1208 N->setValueTypes(VT); 1209 else 1210 N->setValueTypes(VT, MVT::Other); 1211 1212 AllNodes.push_back(N); 1213 return SDOperand(N, 0); 1214} 1215 1216// setAdjCallChain - This method changes the token chain of an ADJCALLSTACKDOWN 1217// node to be the specified operand. 1218void SDNode::setAdjCallChain(SDOperand N) { 1219 assert(N.getValueType() == MVT::Other); 1220 assert(getOpcode() == ISD::ADJCALLSTACKDOWN && "Cannot adjust this node!"); 1221 1222 Operands[0].Val->removeUser(this); 1223 Operands[0] = N; 1224 N.Val->Uses.push_back(this); 1225} 1226 1227 1228 1229SDOperand SelectionDAG::getLoad(MVT::ValueType VT, 1230 SDOperand Chain, SDOperand Ptr, 1231 SDOperand SV) { 1232 SDNode *&N = Loads[std::make_pair(Ptr, std::make_pair(Chain, VT))]; 1233 if (N) return SDOperand(N, 0); 1234 N = new SDNode(ISD::LOAD, Chain, Ptr, SV); 1235 1236 // Loads have a token chain. 1237 N->setValueTypes(VT, MVT::Other); 1238 AllNodes.push_back(N); 1239 return SDOperand(N, 0); 1240} 1241 1242SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT, 1243 SDOperand N1, SDOperand N2, SDOperand N3) { 1244 assert(Opcode != ISD::STORE && "Store shouldn't use this anymore"); 1245 // Perform various simplifications. 1246 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1.Val); 1247 ConstantSDNode *N2C = dyn_cast<ConstantSDNode>(N2.Val); 1248 ConstantSDNode *N3C = dyn_cast<ConstantSDNode>(N3.Val); 1249 switch (Opcode) { 1250 case ISD::SELECT: 1251 if (N1C) 1252 if (N1C->getValue()) 1253 return N2; // select true, X, Y -> X 1254 else 1255 return N3; // select false, X, Y -> Y 1256 1257 if (N2 == N3) return N2; // select C, X, X -> X 1258 1259 if (VT == MVT::i1) { // Boolean SELECT 1260 if (N2C) { 1261 if (N2C->getValue()) // select C, 1, X -> C | X 1262 return getNode(ISD::OR, VT, N1, N3); 1263 else // select C, 0, X -> ~C & X 1264 return getNode(ISD::AND, VT, 1265 getNode(ISD::XOR, N1.getValueType(), N1, 1266 getConstant(1, N1.getValueType())), N3); 1267 } else if (N3C) { 1268 if (N3C->getValue()) // select C, X, 1 -> ~C | X 1269 return getNode(ISD::OR, VT, 1270 getNode(ISD::XOR, N1.getValueType(), N1, 1271 getConstant(1, N1.getValueType())), N2); 1272 else // select C, X, 0 -> C & X 1273 return getNode(ISD::AND, VT, N1, N2); 1274 } 1275 1276 if (N1 == N2) // X ? X : Y --> X ? 1 : Y --> X | Y 1277 return getNode(ISD::OR, VT, N1, N3); 1278 if (N1 == N3) // X ? Y : X --> X ? Y : 0 --> X & Y 1279 return getNode(ISD::AND, VT, N1, N2); 1280 } 1281 1282 // If this is a selectcc, check to see if we can simplify the result. 1283 if (SetCCSDNode *SetCC = dyn_cast<SetCCSDNode>(N1)) { 1284 if (ConstantFPSDNode *CFP = 1285 dyn_cast<ConstantFPSDNode>(SetCC->getOperand(1))) 1286 if (CFP->getValue() == 0.0) { // Allow either -0.0 or 0.0 1287 // select (setg[te] X, +/-0.0), X, fneg(X) -> fabs 1288 if ((SetCC->getCondition() == ISD::SETGE || 1289 SetCC->getCondition() == ISD::SETGT) && 1290 N2 == SetCC->getOperand(0) && N3.getOpcode() == ISD::FNEG && 1291 N3.getOperand(0) == N2) 1292 return getNode(ISD::FABS, VT, N2); 1293 1294 // select (setl[te] X, +/-0.0), fneg(X), X -> fabs 1295 if ((SetCC->getCondition() == ISD::SETLT || 1296 SetCC->getCondition() == ISD::SETLE) && 1297 N3 == SetCC->getOperand(0) && N2.getOpcode() == ISD::FNEG && 1298 N2.getOperand(0) == N3) 1299 return getNode(ISD::FABS, VT, N3); 1300 } 1301 // select (setlt X, 0), A, 0 -> and (sra X, size(X)-1, A) 1302 if (ConstantSDNode *CN = 1303 dyn_cast<ConstantSDNode>(SetCC->getOperand(1))) 1304 if (CN->getValue() == 0 && N3C && N3C->getValue() == 0) 1305 if (SetCC->getCondition() == ISD::SETLT) { 1306 MVT::ValueType XType = SetCC->getOperand(0).getValueType(); 1307 MVT::ValueType AType = N2.getValueType(); 1308 if (XType >= AType) { 1309 SDOperand Shift = getNode(ISD::SRA, XType, SetCC->getOperand(0), 1310 getConstant(MVT::getSizeInBits(XType)-1, 1311 TLI.getShiftAmountTy())); 1312 if (XType > AType) 1313 Shift = getNode(ISD::TRUNCATE, AType, Shift); 1314 return getNode(ISD::AND, AType, Shift, N2); 1315 } 1316 } 1317 } 1318 break; 1319 case ISD::BRCOND: 1320 if (N2C) 1321 if (N2C->getValue()) // Unconditional branch 1322 return getNode(ISD::BR, MVT::Other, N1, N3); 1323 else 1324 return N1; // Never-taken branch 1325 break; 1326 // FIXME: figure out how to safely handle things like 1327 // int foo(int x) { return 1 << (x & 255); } 1328 // int bar() { return foo(256); } 1329#if 0 1330 case ISD::SRA_PARTS: 1331 case ISD::SRL_PARTS: 1332 case ISD::SHL_PARTS: 1333 if (N3.getOpcode() == ISD::SIGN_EXTEND_INREG && 1334 cast<MVTSDNode>(N3)->getExtraValueType() != MVT::i1) 1335 return getNode(Opcode, VT, N1, N2, N3.getOperand(0)); 1336 else if (N3.getOpcode() == ISD::AND) 1337 if (ConstantSDNode *AndRHS = dyn_cast<ConstantSDNode>(N3.getOperand(1))) { 1338 // If the and is only masking out bits that cannot effect the shift, 1339 // eliminate the and. 1340 unsigned NumBits = MVT::getSizeInBits(VT)*2; 1341 if ((AndRHS->getValue() & (NumBits-1)) == NumBits-1) 1342 return getNode(Opcode, VT, N1, N2, N3.getOperand(0)); 1343 } 1344 break; 1345#endif 1346 } 1347 1348 SDNode *N = new SDNode(Opcode, N1, N2, N3); 1349 switch (Opcode) { 1350 default: 1351 N->setValueTypes(VT); 1352 break; 1353 case ISD::DYNAMIC_STACKALLOC: // DYNAMIC_STACKALLOC produces pointer and chain 1354 N->setValueTypes(VT, MVT::Other); 1355 break; 1356 1357 case ISD::SRA_PARTS: 1358 case ISD::SRL_PARTS: 1359 case ISD::SHL_PARTS: { 1360 std::vector<MVT::ValueType> V(N->getNumOperands()-1, VT); 1361 N->setValueTypes(V); 1362 break; 1363 } 1364 } 1365 1366 // FIXME: memoize NODES 1367 AllNodes.push_back(N); 1368 return SDOperand(N, 0); 1369} 1370 1371SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT, 1372 SDOperand N1, SDOperand N2, SDOperand N3, 1373 SDOperand N4) { 1374 assert(Opcode == ISD::STORE && "Only stores should use this"); 1375 1376 SDNode *N = new SDNode(Opcode, N1, N2, N3, N4); 1377 N->setValueTypes(VT); 1378 1379 // FIXME: memoize NODES 1380 AllNodes.push_back(N); 1381 return SDOperand(N, 0); 1382} 1383 1384SDOperand SelectionDAG::getSrcValue(const Value *V, int Offset) { 1385 assert((!V || isa<PointerType>(V->getType())) && 1386 "SrcValue is not a pointer?"); 1387 SDNode *&N = ValueNodes[std::make_pair(V, Offset)]; 1388 if (N) return SDOperand(N, 0); 1389 1390 N = new SrcValueSDNode(V, Offset); 1391 AllNodes.push_back(N); 1392 return SDOperand(N, 0); 1393} 1394 1395SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT, 1396 std::vector<SDOperand> &Children) { 1397 switch (Children.size()) { 1398 case 0: return getNode(Opcode, VT); 1399 case 1: return getNode(Opcode, VT, Children[0]); 1400 case 2: return getNode(Opcode, VT, Children[0], Children[1]); 1401 case 3: return getNode(Opcode, VT, Children[0], Children[1], Children[2]); 1402 default: break; 1403 } 1404 1405 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(Children[1].Val); 1406 switch (Opcode) { 1407 default: break; 1408 case ISD::BRCONDTWOWAY: 1409 if (N1C) 1410 if (N1C->getValue()) // Unconditional branch to true dest. 1411 return getNode(ISD::BR, MVT::Other, Children[0], Children[2]); 1412 else // Unconditional branch to false dest. 1413 return getNode(ISD::BR, MVT::Other, Children[0], Children[3]); 1414 break; 1415 } 1416 1417 // FIXME: MEMOIZE!! 1418 SDNode *N = new SDNode(Opcode, Children); 1419 if (Opcode != ISD::ADD_PARTS && Opcode != ISD::SUB_PARTS) { 1420 N->setValueTypes(VT); 1421 } else { 1422 std::vector<MVT::ValueType> V(N->getNumOperands()/2, VT); 1423 N->setValueTypes(V); 1424 } 1425 AllNodes.push_back(N); 1426 return SDOperand(N, 0); 1427} 1428 1429SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT,SDOperand N1, 1430 MVT::ValueType EVT) { 1431 1432 switch (Opcode) { 1433 default: assert(0 && "Bad opcode for this accessor!"); 1434 case ISD::FP_ROUND_INREG: 1435 assert(VT == N1.getValueType() && "Not an inreg round!"); 1436 assert(MVT::isFloatingPoint(VT) && MVT::isFloatingPoint(EVT) && 1437 "Cannot FP_ROUND_INREG integer types"); 1438 if (EVT == VT) return N1; // Not actually rounding 1439 assert(EVT < VT && "Not rounding down!"); 1440 1441 if (isa<ConstantFPSDNode>(N1)) 1442 return getNode(ISD::FP_EXTEND, VT, getNode(ISD::FP_ROUND, EVT, N1)); 1443 break; 1444 case ISD::SIGN_EXTEND_INREG: 1445 assert(VT == N1.getValueType() && "Not an inreg extend!"); 1446 assert(MVT::isInteger(VT) && MVT::isInteger(EVT) && 1447 "Cannot *_EXTEND_INREG FP types"); 1448 if (EVT == VT) return N1; // Not actually extending 1449 assert(EVT < VT && "Not extending!"); 1450 1451 // Extending a constant? Just return the extended constant. 1452 if (ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1.Val)) { 1453 SDOperand Tmp = getNode(ISD::TRUNCATE, EVT, N1); 1454 return getNode(ISD::SIGN_EXTEND, VT, Tmp); 1455 } 1456 1457 // If we are sign extending an extension, use the original source. 1458 if (N1.getOpcode() == ISD::SIGN_EXTEND_INREG) 1459 if (cast<MVTSDNode>(N1)->getExtraValueType() <= EVT) 1460 return N1; 1461 1462 // If we are sign extending a sextload, return just the load. 1463 if (N1.getOpcode() == ISD::SEXTLOAD && Opcode == ISD::SIGN_EXTEND_INREG) 1464 if (cast<MVTSDNode>(N1)->getExtraValueType() <= EVT) 1465 return N1; 1466 1467 // If we are extending the result of a setcc, and we already know the 1468 // contents of the top bits, eliminate the extension. 1469 if (N1.getOpcode() == ISD::SETCC && 1470 TLI.getSetCCResultContents() == 1471 TargetLowering::ZeroOrNegativeOneSetCCResult) 1472 return N1; 1473 1474 // If we are sign extending the result of an (and X, C) operation, and we 1475 // know the extended bits are zeros already, don't do the extend. 1476 if (N1.getOpcode() == ISD::AND) 1477 if (ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1.getOperand(1))) { 1478 uint64_t Mask = N1C->getValue(); 1479 unsigned NumBits = MVT::getSizeInBits(EVT); 1480 if ((Mask & (~0ULL << (NumBits-1))) == 0) 1481 return N1; 1482 } 1483 break; 1484 } 1485 1486 EVTStruct NN; 1487 NN.Opcode = Opcode; 1488 NN.VT = VT; 1489 NN.EVT = EVT; 1490 NN.Ops.push_back(N1); 1491 1492 SDNode *&N = MVTSDNodes[NN]; 1493 if (N) return SDOperand(N, 0); 1494 N = new MVTSDNode(Opcode, VT, N1, EVT); 1495 AllNodes.push_back(N); 1496 return SDOperand(N, 0); 1497} 1498 1499SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT,SDOperand N1, 1500 SDOperand N2, SDOperand N3, MVT::ValueType EVT) { 1501 switch (Opcode) { 1502 default: assert(0 && "Bad opcode for this accessor!"); 1503 case ISD::EXTLOAD: 1504 case ISD::SEXTLOAD: 1505 case ISD::ZEXTLOAD: 1506 // If they are asking for an extending load from/to the same thing, return a 1507 // normal load. 1508 if (VT == EVT) 1509 return getLoad(VT, N1, N2, N3); 1510 assert(EVT < VT && "Should only be an extending load, not truncating!"); 1511 assert((Opcode == ISD::EXTLOAD || MVT::isInteger(VT)) && 1512 "Cannot sign/zero extend a FP load!"); 1513 assert(MVT::isInteger(VT) == MVT::isInteger(EVT) && 1514 "Cannot convert from FP to Int or Int -> FP!"); 1515 break; 1516 } 1517 1518 EVTStruct NN; 1519 NN.Opcode = Opcode; 1520 NN.VT = VT; 1521 NN.EVT = EVT; 1522 NN.Ops.push_back(N1); 1523 NN.Ops.push_back(N2); 1524 NN.Ops.push_back(N3); 1525 1526 SDNode *&N = MVTSDNodes[NN]; 1527 if (N) return SDOperand(N, 0); 1528 N = new MVTSDNode(Opcode, VT, MVT::Other, N1, N2, N3, EVT); 1529 AllNodes.push_back(N); 1530 return SDOperand(N, 0); 1531} 1532 1533SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT,SDOperand N1, 1534 SDOperand N2, SDOperand N3, SDOperand N4, MVT::ValueType EVT) { 1535 switch (Opcode) { 1536 default: assert(0 && "Bad opcode for this accessor!"); 1537 case ISD::TRUNCSTORE: 1538#if 0 // FIXME: If the target supports EVT natively, convert to a truncate/store 1539 // If this is a truncating store of a constant, convert to the desired type 1540 // and store it instead. 1541 if (isa<Constant>(N1)) { 1542 SDOperand Op = getNode(ISD::TRUNCATE, EVT, N1); 1543 if (isa<Constant>(Op)) 1544 N1 = Op; 1545 } 1546 // Also for ConstantFP? 1547#endif 1548 if (N1.getValueType() == EVT) // Normal store? 1549 return getNode(ISD::STORE, VT, N1, N2, N3, N4); 1550 assert(N2.getValueType() > EVT && "Not a truncation?"); 1551 assert(MVT::isInteger(N2.getValueType()) == MVT::isInteger(EVT) && 1552 "Can't do FP-INT conversion!"); 1553 break; 1554 } 1555 1556 EVTStruct NN; 1557 NN.Opcode = Opcode; 1558 NN.VT = VT; 1559 NN.EVT = EVT; 1560 NN.Ops.push_back(N1); 1561 NN.Ops.push_back(N2); 1562 NN.Ops.push_back(N3); 1563 NN.Ops.push_back(N4); 1564 1565 SDNode *&N = MVTSDNodes[NN]; 1566 if (N) return SDOperand(N, 0); 1567 N = new MVTSDNode(Opcode, VT, N1, N2, N3, N4, EVT); 1568 AllNodes.push_back(N); 1569 return SDOperand(N, 0); 1570} 1571 1572 1573/// hasNUsesOfValue - Return true if there are exactly NUSES uses of the 1574/// indicated value. This method ignores uses of other values defined by this 1575/// operation. 1576bool SDNode::hasNUsesOfValue(unsigned NUses, unsigned Value) { 1577 assert(Value < getNumValues() && "Bad value!"); 1578 1579 // If there is only one value, this is easy. 1580 if (getNumValues() == 1) 1581 return use_size() == NUses; 1582 if (Uses.size() < NUses) return false; 1583 1584 SDOperand TheValue(this, Value); 1585 1586 std::set<SDNode*> UsersHandled; 1587 1588 for (std::vector<SDNode*>::iterator UI = Uses.begin(), E = Uses.end(); 1589 UI != E; ++UI) { 1590 SDNode *User = *UI; 1591 if (User->getNumOperands() == 1 || 1592 UsersHandled.insert(User).second) // First time we've seen this? 1593 for (unsigned i = 0, e = User->getNumOperands(); i != e; ++i) 1594 if (User->getOperand(i) == TheValue) { 1595 if (NUses == 0) 1596 return false; // too many uses 1597 --NUses; 1598 } 1599 } 1600 1601 // Found exactly the right number of uses? 1602 return NUses == 0; 1603} 1604 1605 1606const char *SDNode::getOperationName() const { 1607 switch (getOpcode()) { 1608 default: return "<<Unknown>>"; 1609 case ISD::PCMARKER: return "PCMarker"; 1610 case ISD::SRCVALUE: return "SrcValue"; 1611 case ISD::EntryToken: return "EntryToken"; 1612 case ISD::TokenFactor: return "TokenFactor"; 1613 case ISD::Constant: return "Constant"; 1614 case ISD::ConstantFP: return "ConstantFP"; 1615 case ISD::GlobalAddress: return "GlobalAddress"; 1616 case ISD::FrameIndex: return "FrameIndex"; 1617 case ISD::BasicBlock: return "BasicBlock"; 1618 case ISD::ExternalSymbol: return "ExternalSymbol"; 1619 case ISD::ConstantPool: return "ConstantPoolIndex"; 1620 case ISD::CopyToReg: return "CopyToReg"; 1621 case ISD::CopyFromReg: return "CopyFromReg"; 1622 case ISD::ImplicitDef: return "ImplicitDef"; 1623 case ISD::UNDEF: return "undef"; 1624 1625 // Unary operators 1626 case ISD::FABS: return "fabs"; 1627 case ISD::FNEG: return "fneg"; 1628 case ISD::FSQRT: return "fsqrt"; 1629 case ISD::FSIN: return "fsin"; 1630 case ISD::FCOS: return "fcos"; 1631 1632 // Binary operators 1633 case ISD::ADD: return "add"; 1634 case ISD::SUB: return "sub"; 1635 case ISD::MUL: return "mul"; 1636 case ISD::MULHU: return "mulhu"; 1637 case ISD::MULHS: return "mulhs"; 1638 case ISD::SDIV: return "sdiv"; 1639 case ISD::UDIV: return "udiv"; 1640 case ISD::SREM: return "srem"; 1641 case ISD::UREM: return "urem"; 1642 case ISD::AND: return "and"; 1643 case ISD::OR: return "or"; 1644 case ISD::XOR: return "xor"; 1645 case ISD::SHL: return "shl"; 1646 case ISD::SRA: return "sra"; 1647 case ISD::SRL: return "srl"; 1648 1649 case ISD::SELECT: return "select"; 1650 case ISD::ADD_PARTS: return "add_parts"; 1651 case ISD::SUB_PARTS: return "sub_parts"; 1652 case ISD::SHL_PARTS: return "shl_parts"; 1653 case ISD::SRA_PARTS: return "sra_parts"; 1654 case ISD::SRL_PARTS: return "srl_parts"; 1655 1656 // Conversion operators. 1657 case ISD::SIGN_EXTEND: return "sign_extend"; 1658 case ISD::ZERO_EXTEND: return "zero_extend"; 1659 case ISD::SIGN_EXTEND_INREG: return "sign_extend_inreg"; 1660 case ISD::TRUNCATE: return "truncate"; 1661 case ISD::FP_ROUND: return "fp_round"; 1662 case ISD::FP_ROUND_INREG: return "fp_round_inreg"; 1663 case ISD::FP_EXTEND: return "fp_extend"; 1664 1665 case ISD::SINT_TO_FP: return "sint_to_fp"; 1666 case ISD::UINT_TO_FP: return "uint_to_fp"; 1667 case ISD::FP_TO_SINT: return "fp_to_sint"; 1668 case ISD::FP_TO_UINT: return "fp_to_uint"; 1669 1670 // Control flow instructions 1671 case ISD::BR: return "br"; 1672 case ISD::BRCOND: return "brcond"; 1673 case ISD::BRCONDTWOWAY: return "brcondtwoway"; 1674 case ISD::RET: return "ret"; 1675 case ISD::CALL: return "call"; 1676 case ISD::ADJCALLSTACKDOWN: return "adjcallstackdown"; 1677 case ISD::ADJCALLSTACKUP: return "adjcallstackup"; 1678 1679 // Other operators 1680 case ISD::LOAD: return "load"; 1681 case ISD::STORE: return "store"; 1682 case ISD::EXTLOAD: return "extload"; 1683 case ISD::SEXTLOAD: return "sextload"; 1684 case ISD::ZEXTLOAD: return "zextload"; 1685 case ISD::TRUNCSTORE: return "truncstore"; 1686 1687 case ISD::DYNAMIC_STACKALLOC: return "dynamic_stackalloc"; 1688 case ISD::EXTRACT_ELEMENT: return "extract_element"; 1689 case ISD::BUILD_PAIR: return "build_pair"; 1690 case ISD::MEMSET: return "memset"; 1691 case ISD::MEMCPY: return "memcpy"; 1692 case ISD::MEMMOVE: return "memmove"; 1693 1694 // Bit counting 1695 case ISD::CTPOP: return "ctpop"; 1696 case ISD::CTTZ: return "cttz"; 1697 case ISD::CTLZ: return "ctlz"; 1698 1699 // IO Intrinsics 1700 case ISD::READPORT: return "readport"; 1701 case ISD::WRITEPORT: return "writeport"; 1702 case ISD::READIO: return "readio"; 1703 case ISD::WRITEIO: return "writeio"; 1704 1705 case ISD::SETCC: 1706 const SetCCSDNode *SetCC = cast<SetCCSDNode>(this); 1707 switch (SetCC->getCondition()) { 1708 default: assert(0 && "Unknown setcc condition!"); 1709 case ISD::SETOEQ: return "setcc:setoeq"; 1710 case ISD::SETOGT: return "setcc:setogt"; 1711 case ISD::SETOGE: return "setcc:setoge"; 1712 case ISD::SETOLT: return "setcc:setolt"; 1713 case ISD::SETOLE: return "setcc:setole"; 1714 case ISD::SETONE: return "setcc:setone"; 1715 1716 case ISD::SETO: return "setcc:seto"; 1717 case ISD::SETUO: return "setcc:setuo"; 1718 case ISD::SETUEQ: return "setcc:setue"; 1719 case ISD::SETUGT: return "setcc:setugt"; 1720 case ISD::SETUGE: return "setcc:setuge"; 1721 case ISD::SETULT: return "setcc:setult"; 1722 case ISD::SETULE: return "setcc:setule"; 1723 case ISD::SETUNE: return "setcc:setune"; 1724 1725 case ISD::SETEQ: return "setcc:seteq"; 1726 case ISD::SETGT: return "setcc:setgt"; 1727 case ISD::SETGE: return "setcc:setge"; 1728 case ISD::SETLT: return "setcc:setlt"; 1729 case ISD::SETLE: return "setcc:setle"; 1730 case ISD::SETNE: return "setcc:setne"; 1731 } 1732 } 1733} 1734 1735void SDNode::dump() const { 1736 std::cerr << (void*)this << ": "; 1737 1738 for (unsigned i = 0, e = getNumValues(); i != e; ++i) { 1739 if (i) std::cerr << ","; 1740 if (getValueType(i) == MVT::Other) 1741 std::cerr << "ch"; 1742 else 1743 std::cerr << MVT::getValueTypeString(getValueType(i)); 1744 } 1745 std::cerr << " = " << getOperationName(); 1746 1747 std::cerr << " "; 1748 for (unsigned i = 0, e = getNumOperands(); i != e; ++i) { 1749 if (i) std::cerr << ", "; 1750 std::cerr << (void*)getOperand(i).Val; 1751 if (unsigned RN = getOperand(i).ResNo) 1752 std::cerr << ":" << RN; 1753 } 1754 1755 if (const ConstantSDNode *CSDN = dyn_cast<ConstantSDNode>(this)) { 1756 std::cerr << "<" << CSDN->getValue() << ">"; 1757 } else if (const ConstantFPSDNode *CSDN = dyn_cast<ConstantFPSDNode>(this)) { 1758 std::cerr << "<" << CSDN->getValue() << ">"; 1759 } else if (const GlobalAddressSDNode *GADN = 1760 dyn_cast<GlobalAddressSDNode>(this)) { 1761 std::cerr << "<"; 1762 WriteAsOperand(std::cerr, GADN->getGlobal()) << ">"; 1763 } else if (const FrameIndexSDNode *FIDN = dyn_cast<FrameIndexSDNode>(this)) { 1764 std::cerr << "<" << FIDN->getIndex() << ">"; 1765 } else if (const ConstantPoolSDNode *CP = dyn_cast<ConstantPoolSDNode>(this)){ 1766 std::cerr << "<" << CP->getIndex() << ">"; 1767 } else if (const BasicBlockSDNode *BBDN = dyn_cast<BasicBlockSDNode>(this)) { 1768 std::cerr << "<"; 1769 const Value *LBB = (const Value*)BBDN->getBasicBlock()->getBasicBlock(); 1770 if (LBB) 1771 std::cerr << LBB->getName() << " "; 1772 std::cerr << (const void*)BBDN->getBasicBlock() << ">"; 1773 } else if (const RegSDNode *C2V = dyn_cast<RegSDNode>(this)) { 1774 std::cerr << "<reg #" << C2V->getReg() << ">"; 1775 } else if (const ExternalSymbolSDNode *ES = 1776 dyn_cast<ExternalSymbolSDNode>(this)) { 1777 std::cerr << "'" << ES->getSymbol() << "'"; 1778 } else if (const MVTSDNode *M = dyn_cast<MVTSDNode>(this)) { 1779 std::cerr << " - Ty = " << MVT::getValueTypeString(M->getExtraValueType()); 1780 } else if (const SrcValueSDNode *M = dyn_cast<SrcValueSDNode>(this)) { 1781 if (M->getValue()) 1782 std::cerr << "<" << M->getValue() << ":" << M->getOffset() << ">"; 1783 else 1784 std::cerr << "<null:" << M->getOffset() << ">"; 1785 } 1786} 1787 1788static void DumpNodes(SDNode *N, unsigned indent) { 1789 for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i) 1790 if (N->getOperand(i).Val->hasOneUse()) 1791 DumpNodes(N->getOperand(i).Val, indent+2); 1792 else 1793 std::cerr << "\n" << std::string(indent+2, ' ') 1794 << (void*)N->getOperand(i).Val << ": <multiple use>"; 1795 1796 1797 std::cerr << "\n" << std::string(indent, ' '); 1798 N->dump(); 1799} 1800 1801void SelectionDAG::dump() const { 1802 std::cerr << "SelectionDAG has " << AllNodes.size() << " nodes:"; 1803 std::vector<SDNode*> Nodes(AllNodes); 1804 std::sort(Nodes.begin(), Nodes.end()); 1805 1806 for (unsigned i = 0, e = Nodes.size(); i != e; ++i) { 1807 if (!Nodes[i]->hasOneUse() && Nodes[i] != getRoot().Val) 1808 DumpNodes(Nodes[i], 2); 1809 } 1810 1811 DumpNodes(getRoot().Val, 2); 1812 1813 std::cerr << "\n\n"; 1814} 1815 1816