SelectionDAG.cpp revision 0f2287baa18fb1c6a7e8ba42ba5163c2845b8654
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 int64_t Imm = ~0ULL >> 64-MVT::getSizeInBits(VT); 290 return getNode(ISD::AND, Op.getValueType(), Op, 291 getConstant(Imm, Op.getValueType())); 292} 293 294SDOperand SelectionDAG::getConstant(uint64_t Val, MVT::ValueType VT) { 295 assert(MVT::isInteger(VT) && "Cannot create FP integer constant!"); 296 // Mask out any bits that are not valid for this constant. 297 if (VT != MVT::i64) 298 Val &= ((uint64_t)1 << MVT::getSizeInBits(VT)) - 1; 299 300 SDNode *&N = Constants[std::make_pair(Val, VT)]; 301 if (N) return SDOperand(N, 0); 302 N = new ConstantSDNode(Val, VT); 303 AllNodes.push_back(N); 304 return SDOperand(N, 0); 305} 306 307SDOperand SelectionDAG::getConstantFP(double Val, MVT::ValueType VT) { 308 assert(MVT::isFloatingPoint(VT) && "Cannot create integer FP constant!"); 309 if (VT == MVT::f32) 310 Val = (float)Val; // Mask out extra precision. 311 312 // Do the map lookup using the actual bit pattern for the floating point 313 // value, so that we don't have problems with 0.0 comparing equal to -0.0, and 314 // we don't have issues with SNANs. 315 union { 316 double DV; 317 uint64_t IV; 318 }; 319 320 DV = Val; 321 322 SDNode *&N = ConstantFPs[std::make_pair(IV, VT)]; 323 if (N) return SDOperand(N, 0); 324 N = new ConstantFPSDNode(Val, VT); 325 AllNodes.push_back(N); 326 return SDOperand(N, 0); 327} 328 329 330 331SDOperand SelectionDAG::getGlobalAddress(const GlobalValue *GV, 332 MVT::ValueType VT) { 333 SDNode *&N = GlobalValues[GV]; 334 if (N) return SDOperand(N, 0); 335 N = new GlobalAddressSDNode(GV,VT); 336 AllNodes.push_back(N); 337 return SDOperand(N, 0); 338} 339 340SDOperand SelectionDAG::getFrameIndex(int FI, MVT::ValueType VT) { 341 SDNode *&N = FrameIndices[FI]; 342 if (N) return SDOperand(N, 0); 343 N = new FrameIndexSDNode(FI, VT); 344 AllNodes.push_back(N); 345 return SDOperand(N, 0); 346} 347 348SDOperand SelectionDAG::getConstantPool(unsigned CPIdx, MVT::ValueType VT) { 349 SDNode *N = ConstantPoolIndices[CPIdx]; 350 if (N) return SDOperand(N, 0); 351 N = new ConstantPoolSDNode(CPIdx, VT); 352 AllNodes.push_back(N); 353 return SDOperand(N, 0); 354} 355 356SDOperand SelectionDAG::getBasicBlock(MachineBasicBlock *MBB) { 357 SDNode *&N = BBNodes[MBB]; 358 if (N) return SDOperand(N, 0); 359 N = new BasicBlockSDNode(MBB); 360 AllNodes.push_back(N); 361 return SDOperand(N, 0); 362} 363 364SDOperand SelectionDAG::getExternalSymbol(const char *Sym, MVT::ValueType VT) { 365 SDNode *&N = ExternalSymbols[Sym]; 366 if (N) return SDOperand(N, 0); 367 N = new ExternalSymbolSDNode(Sym, VT); 368 AllNodes.push_back(N); 369 return SDOperand(N, 0); 370} 371 372SDOperand SelectionDAG::getSetCC(ISD::CondCode Cond, MVT::ValueType VT, 373 SDOperand N1, SDOperand N2) { 374 // These setcc operations always fold. 375 switch (Cond) { 376 default: break; 377 case ISD::SETFALSE: 378 case ISD::SETFALSE2: return getConstant(0, VT); 379 case ISD::SETTRUE: 380 case ISD::SETTRUE2: return getConstant(1, VT); 381 } 382 383 if (ConstantSDNode *N2C = dyn_cast<ConstantSDNode>(N2.Val)) { 384 uint64_t C2 = N2C->getValue(); 385 if (ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1.Val)) { 386 uint64_t C1 = N1C->getValue(); 387 388 // Sign extend the operands if required 389 if (ISD::isSignedIntSetCC(Cond)) { 390 C1 = N1C->getSignExtended(); 391 C2 = N2C->getSignExtended(); 392 } 393 394 switch (Cond) { 395 default: assert(0 && "Unknown integer setcc!"); 396 case ISD::SETEQ: return getConstant(C1 == C2, VT); 397 case ISD::SETNE: return getConstant(C1 != C2, VT); 398 case ISD::SETULT: return getConstant(C1 < C2, VT); 399 case ISD::SETUGT: return getConstant(C1 > C2, VT); 400 case ISD::SETULE: return getConstant(C1 <= C2, VT); 401 case ISD::SETUGE: return getConstant(C1 >= C2, VT); 402 case ISD::SETLT: return getConstant((int64_t)C1 < (int64_t)C2, VT); 403 case ISD::SETGT: return getConstant((int64_t)C1 > (int64_t)C2, VT); 404 case ISD::SETLE: return getConstant((int64_t)C1 <= (int64_t)C2, VT); 405 case ISD::SETGE: return getConstant((int64_t)C1 >= (int64_t)C2, VT); 406 } 407 } else { 408 uint64_t MinVal, MaxVal; 409 unsigned OperandBitSize = MVT::getSizeInBits(N2C->getValueType(0)); 410 if (ISD::isSignedIntSetCC(Cond)) { 411 MinVal = 1ULL << (OperandBitSize-1); 412 if (OperandBitSize != 1) // Avoid X >> 64, which is undefined. 413 MaxVal = ~0ULL >> (65-OperandBitSize); 414 else 415 MaxVal = 0; 416 } else { 417 MinVal = 0; 418 MaxVal = ~0ULL >> (64-OperandBitSize); 419 } 420 421 // Canonicalize GE/LE comparisons to use GT/LT comparisons. 422 if (Cond == ISD::SETGE || Cond == ISD::SETUGE) { 423 if (C2 == MinVal) return getConstant(1, VT); // X >= MIN --> true 424 --C2; // X >= C1 --> X > (C1-1) 425 Cond = (Cond == ISD::SETGE) ? ISD::SETGT : ISD::SETUGT; 426 N2 = getConstant(C2, N2.getValueType()); 427 N2C = cast<ConstantSDNode>(N2.Val); 428 } 429 430 if (Cond == ISD::SETLE || Cond == ISD::SETULE) { 431 if (C2 == MaxVal) return getConstant(1, VT); // X <= MAX --> true 432 ++C2; // X <= C1 --> X < (C1+1) 433 Cond = (Cond == ISD::SETLE) ? ISD::SETLT : ISD::SETULT; 434 N2 = getConstant(C2, N2.getValueType()); 435 N2C = cast<ConstantSDNode>(N2.Val); 436 } 437 438 // If we have setult X, 1, turn it into seteq X, 0 439 if ((Cond == ISD::SETLT || Cond == ISD::SETULT) && C2 == MinVal+1) 440 return getSetCC(ISD::SETEQ, VT, N1, 441 getConstant(MinVal, N1.getValueType())); 442 // If we have setult X, 1, turn it into seteq X, 0 443 else if ((Cond == ISD::SETGT || Cond == ISD::SETUGT) && C2 == MaxVal-1) 444 return getSetCC(ISD::SETEQ, VT, N1, 445 getConstant(MaxVal, N1.getValueType())); 446 447 // If we have "setcc X, C1", check to see if we can shrink the immediate 448 // by changing cc. 449 450 // SETUGT X, SINTMAX -> SETLT X, 0 451 if (Cond == ISD::SETUGT && OperandBitSize != 1 && 452 C2 == (~0ULL >> (65-OperandBitSize))) 453 return getSetCC(ISD::SETLT, VT, N1, getConstant(0, N2.getValueType())); 454 455 // FIXME: Implement the rest of these. 456 457 } 458 } else if (isa<ConstantSDNode>(N1.Val)) { 459 // Ensure that the constant occurs on the RHS. 460 return getSetCC(ISD::getSetCCSwappedOperands(Cond), VT, N2, N1); 461 } 462 463 if (ConstantFPSDNode *N1C = dyn_cast<ConstantFPSDNode>(N1.Val)) 464 if (ConstantFPSDNode *N2C = dyn_cast<ConstantFPSDNode>(N2.Val)) { 465 double C1 = N1C->getValue(), C2 = N2C->getValue(); 466 467 switch (Cond) { 468 default: break; // FIXME: Implement the rest of these! 469 case ISD::SETEQ: return getConstant(C1 == C2, VT); 470 case ISD::SETNE: return getConstant(C1 != C2, VT); 471 case ISD::SETLT: return getConstant(C1 < C2, VT); 472 case ISD::SETGT: return getConstant(C1 > C2, VT); 473 case ISD::SETLE: return getConstant(C1 <= C2, VT); 474 case ISD::SETGE: return getConstant(C1 >= C2, VT); 475 } 476 } else { 477 // Ensure that the constant occurs on the RHS. 478 Cond = ISD::getSetCCSwappedOperands(Cond); 479 std::swap(N1, N2); 480 } 481 482 if (N1 == N2) { 483 // We can always fold X == Y for integer setcc's. 484 if (MVT::isInteger(N1.getValueType())) 485 return getConstant(ISD::isTrueWhenEqual(Cond), VT); 486 unsigned UOF = ISD::getUnorderedFlavor(Cond); 487 if (UOF == 2) // FP operators that are undefined on NaNs. 488 return getConstant(ISD::isTrueWhenEqual(Cond), VT); 489 if (UOF == ISD::isTrueWhenEqual(Cond)) 490 return getConstant(UOF, VT); 491 // Otherwise, we can't fold it. However, we can simplify it to SETUO/SETO 492 // if it is not already. 493 Cond = UOF == 0 ? ISD::SETUO : ISD::SETO; 494 } 495 496 if ((Cond == ISD::SETEQ || Cond == ISD::SETNE) && 497 MVT::isInteger(N1.getValueType())) { 498 if (N1.getOpcode() == ISD::ADD || N1.getOpcode() == ISD::SUB || 499 N1.getOpcode() == ISD::XOR) { 500 // Simplify (X+Y) == (X+Z) --> Y == Z 501 if (N1.getOpcode() == N2.getOpcode()) { 502 if (N1.getOperand(0) == N2.getOperand(0)) 503 return getSetCC(Cond, VT, N1.getOperand(1), N2.getOperand(1)); 504 if (N1.getOperand(1) == N2.getOperand(1)) 505 return getSetCC(Cond, VT, N1.getOperand(0), N2.getOperand(0)); 506 if (isCommutativeBinOp(N1.getOpcode())) { 507 // If X op Y == Y op X, try other combinations. 508 if (N1.getOperand(0) == N2.getOperand(1)) 509 return getSetCC(Cond, VT, N1.getOperand(1), N2.getOperand(0)); 510 if (N1.getOperand(1) == N2.getOperand(0)) 511 return getSetCC(Cond, VT, N1.getOperand(1), N2.getOperand(1)); 512 } 513 } 514 515 // FIXME: move this stuff to the DAG Combiner when it exists! 516 517 // Simplify (X+Z) == X --> Z == 0 518 if (N1.getOperand(0) == N2) 519 return getSetCC(Cond, VT, N1.getOperand(1), 520 getConstant(0, N1.getValueType())); 521 if (N1.getOperand(1) == N2) { 522 if (isCommutativeBinOp(N1.getOpcode())) 523 return getSetCC(Cond, VT, N1.getOperand(0), 524 getConstant(0, N1.getValueType())); 525 else { 526 assert(N1.getOpcode() == ISD::SUB && "Unexpected operation!"); 527 // (Z-X) == X --> Z == X<<1 528 return getSetCC(Cond, VT, N1.getOperand(0), 529 getNode(ISD::SHL, N2.getValueType(), 530 N2, getConstant(1, TLI.getShiftAmountTy()))); 531 } 532 } 533 } 534 535 if (N2.getOpcode() == ISD::ADD || N2.getOpcode() == ISD::SUB || 536 N2.getOpcode() == ISD::XOR) { 537 // Simplify X == (X+Z) --> Z == 0 538 if (N2.getOperand(0) == N1) 539 return getSetCC(Cond, VT, N2.getOperand(1), 540 getConstant(0, N2.getValueType())); 541 else if (N2.getOperand(1) == N1) 542 return getSetCC(Cond, VT, N2.getOperand(0), 543 getConstant(0, N2.getValueType())); 544 } 545 } 546 547 SetCCSDNode *&N = SetCCs[std::make_pair(std::make_pair(N1, N2), 548 std::make_pair(Cond, VT))]; 549 if (N) return SDOperand(N, 0); 550 N = new SetCCSDNode(Cond, N1, N2); 551 N->setValueTypes(VT); 552 AllNodes.push_back(N); 553 return SDOperand(N, 0); 554} 555 556 557 558/// getNode - Gets or creates the specified node. 559/// 560SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT) { 561 SDNode *N = new SDNode(Opcode, VT); 562 AllNodes.push_back(N); 563 return SDOperand(N, 0); 564} 565 566SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT, 567 SDOperand Operand) { 568 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Operand.Val)) { 569 uint64_t Val = C->getValue(); 570 switch (Opcode) { 571 default: break; 572 case ISD::SIGN_EXTEND: return getConstant(C->getSignExtended(), VT); 573 case ISD::ZERO_EXTEND: return getConstant(Val, VT); 574 case ISD::TRUNCATE: return getConstant(Val, VT); 575 case ISD::SINT_TO_FP: return getConstantFP(C->getSignExtended(), VT); 576 case ISD::UINT_TO_FP: return getConstantFP(C->getValue(), VT); 577 } 578 } 579 580 if (ConstantFPSDNode *C = dyn_cast<ConstantFPSDNode>(Operand.Val)) 581 switch (Opcode) { 582 case ISD::FNEG: 583 return getConstantFP(-C->getValue(), VT); 584 case ISD::FP_ROUND: 585 case ISD::FP_EXTEND: 586 return getConstantFP(C->getValue(), VT); 587 case ISD::FP_TO_SINT: 588 return getConstant((int64_t)C->getValue(), VT); 589 case ISD::FP_TO_UINT: 590 return getConstant((uint64_t)C->getValue(), VT); 591 } 592 593 unsigned OpOpcode = Operand.Val->getOpcode(); 594 switch (Opcode) { 595 case ISD::TokenFactor: 596 return Operand; // Factor of one node? No factor. 597 case ISD::SIGN_EXTEND: 598 if (Operand.getValueType() == VT) return Operand; // noop extension 599 if (OpOpcode == ISD::SIGN_EXTEND || OpOpcode == ISD::ZERO_EXTEND) 600 return getNode(OpOpcode, VT, Operand.Val->getOperand(0)); 601 break; 602 case ISD::ZERO_EXTEND: 603 if (Operand.getValueType() == VT) return Operand; // noop extension 604 if (OpOpcode == ISD::ZERO_EXTEND) // (zext (zext x)) -> (zext x) 605 return getNode(ISD::ZERO_EXTEND, VT, Operand.Val->getOperand(0)); 606 break; 607 case ISD::TRUNCATE: 608 if (Operand.getValueType() == VT) return Operand; // noop truncate 609 if (OpOpcode == ISD::TRUNCATE) 610 return getNode(ISD::TRUNCATE, VT, Operand.Val->getOperand(0)); 611 else if (OpOpcode == ISD::ZERO_EXTEND || OpOpcode == ISD::SIGN_EXTEND) { 612 // If the source is smaller than the dest, we still need an extend. 613 if (Operand.Val->getOperand(0).getValueType() < VT) 614 return getNode(OpOpcode, VT, Operand.Val->getOperand(0)); 615 else if (Operand.Val->getOperand(0).getValueType() > VT) 616 return getNode(ISD::TRUNCATE, VT, Operand.Val->getOperand(0)); 617 else 618 return Operand.Val->getOperand(0); 619 } 620 break; 621 case ISD::FNEG: 622 if (OpOpcode == ISD::SUB) // -(X-Y) -> (Y-X) 623 return getNode(ISD::SUB, VT, Operand.Val->getOperand(1), 624 Operand.Val->getOperand(0)); 625 if (OpOpcode == ISD::FNEG) // --X -> X 626 return Operand.Val->getOperand(0); 627 break; 628 case ISD::FABS: 629 if (OpOpcode == ISD::FNEG) // abs(-X) -> abs(X) 630 return getNode(ISD::FABS, VT, Operand.Val->getOperand(0)); 631 break; 632 } 633 634 SDNode *&N = UnaryOps[std::make_pair(Opcode, std::make_pair(Operand, VT))]; 635 if (N) return SDOperand(N, 0); 636 N = new SDNode(Opcode, Operand); 637 N->setValueTypes(VT); 638 AllNodes.push_back(N); 639 return SDOperand(N, 0); 640} 641 642SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT, 643 SDOperand N1, SDOperand N2) { 644#ifndef NDEBUG 645 switch (Opcode) { 646 case ISD::TokenFactor: 647 assert(VT == MVT::Other && N1.getValueType() == MVT::Other && 648 N2.getValueType() == MVT::Other && "Invalid token factor!"); 649 break; 650 case ISD::AND: 651 case ISD::OR: 652 case ISD::XOR: 653 case ISD::UDIV: 654 case ISD::UREM: 655 assert(MVT::isInteger(VT) && "This operator does not apply to FP types!"); 656 // fall through 657 case ISD::ADD: 658 case ISD::SUB: 659 case ISD::MUL: 660 case ISD::SDIV: 661 case ISD::SREM: 662 assert(N1.getValueType() == N2.getValueType() && 663 N1.getValueType() == VT && "Binary operator types must match!"); 664 break; 665 666 case ISD::SHL: 667 case ISD::SRA: 668 case ISD::SRL: 669 assert(VT == N1.getValueType() && 670 "Shift operators return type must be the same as their first arg"); 671 assert(MVT::isInteger(VT) && MVT::isInteger(N2.getValueType()) && 672 VT != MVT::i1 && "Shifts only work on integers"); 673 break; 674 default: break; 675 } 676#endif 677 678 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1.Val); 679 ConstantSDNode *N2C = dyn_cast<ConstantSDNode>(N2.Val); 680 if (N1C) { 681 if (N2C) { 682 uint64_t C1 = N1C->getValue(), C2 = N2C->getValue(); 683 switch (Opcode) { 684 case ISD::ADD: return getConstant(C1 + C2, VT); 685 case ISD::SUB: return getConstant(C1 - C2, VT); 686 case ISD::MUL: return getConstant(C1 * C2, VT); 687 case ISD::UDIV: 688 if (C2) return getConstant(C1 / C2, VT); 689 break; 690 case ISD::UREM : 691 if (C2) return getConstant(C1 % C2, VT); 692 break; 693 case ISD::SDIV : 694 if (C2) return getConstant(N1C->getSignExtended() / 695 N2C->getSignExtended(), VT); 696 break; 697 case ISD::SREM : 698 if (C2) return getConstant(N1C->getSignExtended() % 699 N2C->getSignExtended(), VT); 700 break; 701 case ISD::AND : return getConstant(C1 & C2, VT); 702 case ISD::OR : return getConstant(C1 | C2, VT); 703 case ISD::XOR : return getConstant(C1 ^ C2, VT); 704 case ISD::SHL : return getConstant(C1 << (int)C2, VT); 705 case ISD::SRL : return getConstant(C1 >> (unsigned)C2, VT); 706 case ISD::SRA : return getConstant(N1C->getSignExtended() >>(int)C2, VT); 707 default: break; 708 } 709 710 } else { // Cannonicalize constant to RHS if commutative 711 if (isCommutativeBinOp(Opcode)) { 712 std::swap(N1C, N2C); 713 std::swap(N1, N2); 714 } 715 } 716 717 switch (Opcode) { 718 default: break; 719 case ISD::SHL: // shl 0, X -> 0 720 if (N1C->isNullValue()) return N1; 721 break; 722 case ISD::SRL: // srl 0, X -> 0 723 if (N1C->isNullValue()) return N1; 724 break; 725 case ISD::SRA: // sra -1, X -> -1 726 if (N1C->isAllOnesValue()) return N1; 727 break; 728 } 729 } 730 731 if (N2C) { 732 uint64_t C2 = N2C->getValue(); 733 734 switch (Opcode) { 735 case ISD::ADD: 736 if (!C2) return N1; // add X, 0 -> X 737 break; 738 case ISD::SUB: 739 if (!C2) return N1; // sub X, 0 -> X 740 break; 741 case ISD::MUL: 742 if (!C2) return N2; // mul X, 0 -> 0 743 if (N2C->isAllOnesValue()) // mul X, -1 -> 0-X 744 return getNode(ISD::SUB, VT, getConstant(0, VT), N1); 745 746 // FIXME: Move this to the DAG combiner when it exists. 747 if ((C2 & C2-1) == 0) { 748 SDOperand ShAmt = getConstant(ExactLog2(C2), TLI.getShiftAmountTy()); 749 return getNode(ISD::SHL, VT, N1, ShAmt); 750 } 751 break; 752 753 case ISD::UDIV: 754 // FIXME: Move this to the DAG combiner when it exists. 755 if ((C2 & C2-1) == 0 && C2) { 756 SDOperand ShAmt = getConstant(ExactLog2(C2), TLI.getShiftAmountTy()); 757 return getNode(ISD::SRL, VT, N1, ShAmt); 758 } 759 break; 760 761 case ISD::SHL: 762 case ISD::SRL: 763 case ISD::SRA: 764 // If the shift amount is bigger than the size of the data, then all the 765 // bits are shifted out. Simplify to loading constant zero. 766 if (C2 >= MVT::getSizeInBits(N1.getValueType())) { 767 return getNode(ISD::UNDEF, N1.getValueType()); 768 } 769 if (C2 == 0) return N1; 770 break; 771 772 case ISD::AND: 773 if (!C2) return N2; // X and 0 -> 0 774 if (N2C->isAllOnesValue()) 775 return N1; // X and -1 -> X 776 777 // FIXME: Should add a corresponding version of this for 778 // ZERO_EXTEND/SIGN_EXTEND by converting them to an ANY_EXTEND node which 779 // we don't have yet. 780 781 // and (sign_extend_inreg x:16:32), 1 -> and x, 1 782 if (N1.getOpcode() == ISD::SIGN_EXTEND_INREG) { 783 // If we are masking out the part of our input that was extended, just 784 // mask the input to the extension directly. 785 unsigned ExtendBits = 786 MVT::getSizeInBits(cast<MVTSDNode>(N1)->getExtraValueType()); 787 if ((C2 & (~0ULL << ExtendBits)) == 0) 788 return getNode(ISD::AND, VT, N1.getOperand(0), N2); 789 } 790 if (N1.getOpcode() == ISD::AND) 791 if (ConstantSDNode *OpRHS = dyn_cast<ConstantSDNode>(N1.getOperand(1))) 792 return getNode(ISD::AND, VT, N1.getOperand(0), 793 getNode(ISD::AND, VT, N1.getOperand(1), N2)); 794 795 // If we are anding the result of a setcc, and we know setcc always 796 // returns 0 or 1, simplify the RHS to either be 0 or 1 797 if (N1.getOpcode() == ISD::SETCC && 798 TLI.getSetCCResultContents() == TargetLowering::ZeroOrOneSetCCResult) 799 if (C2 & 1) 800 return getNode(ISD::AND, VT, N1.getOperand(1), getConstant(1, VT)); 801 else 802 return getConstant(0, VT); 803 804 if (N1.getOpcode() == ISD::ZEXTLOAD) { 805 // If we are anding the result of a zext load, realize that the top bits 806 // of the loaded value are already zero to simplify C2. 807 unsigned SrcBits = 808 MVT::getSizeInBits(cast<MVTSDNode>(N1)->getExtraValueType()); 809 uint64_t C3 = C2 & (~0ULL >> (64-SrcBits)); 810 if (C3 != C2) 811 return getNode(ISD::AND, VT, N1, getConstant(C3, VT)); 812 else if (C2 == (~0ULL >> (64-SrcBits))) 813 return N1; // Anding out just what is already masked. 814 } 815 break; 816 case ISD::OR: 817 if (!C2)return N1; // X or 0 -> X 818 if (N2C->isAllOnesValue()) 819 return N2; // X or -1 -> -1 820 break; 821 case ISD::XOR: 822 if (!C2) return N1; // X xor 0 -> X 823 if (N2C->isAllOnesValue()) { 824 if (SetCCSDNode *SetCC = dyn_cast<SetCCSDNode>(N1.Val)){ 825 // !(X op Y) -> (X !op Y) 826 bool isInteger = MVT::isInteger(SetCC->getOperand(0).getValueType()); 827 return getSetCC(ISD::getSetCCInverse(SetCC->getCondition(),isInteger), 828 SetCC->getValueType(0), 829 SetCC->getOperand(0), SetCC->getOperand(1)); 830 } else if (N1.getOpcode() == ISD::AND || N1.getOpcode() == ISD::OR) { 831 SDNode *Op = N1.Val; 832 // !(X or Y) -> (!X and !Y) iff X or Y are freely invertible 833 // !(X and Y) -> (!X or !Y) iff X or Y are freely invertible 834 SDOperand LHS = Op->getOperand(0), RHS = Op->getOperand(1); 835 if (isInvertibleForFree(RHS) || isInvertibleForFree(LHS)) { 836 LHS = getNode(ISD::XOR, VT, LHS, N2); // RHS = ~LHS 837 RHS = getNode(ISD::XOR, VT, RHS, N2); // RHS = ~RHS 838 if (Op->getOpcode() == ISD::AND) 839 return getNode(ISD::OR, VT, LHS, RHS); 840 return getNode(ISD::AND, VT, LHS, RHS); 841 } 842 } 843 // X xor -1 -> not(x) ? 844 } 845 break; 846 } 847 848 // Reassociate ((X op C1) op C2) if possible. 849 if (N1.getOpcode() == Opcode && isAssociativeBinOp(Opcode)) 850 if (ConstantSDNode *N3C = dyn_cast<ConstantSDNode>(N1.Val->getOperand(1))) 851 return getNode(Opcode, VT, N1.Val->getOperand(0), 852 getNode(Opcode, VT, N2, N1.Val->getOperand(1))); 853 } 854 855 ConstantFPSDNode *N1CFP = dyn_cast<ConstantFPSDNode>(N1.Val); 856 ConstantFPSDNode *N2CFP = dyn_cast<ConstantFPSDNode>(N2.Val); 857 if (N1CFP) 858 if (N2CFP) { 859 double C1 = N1CFP->getValue(), C2 = N2CFP->getValue(); 860 switch (Opcode) { 861 case ISD::ADD: return getConstantFP(C1 + C2, VT); 862 case ISD::SUB: return getConstantFP(C1 - C2, VT); 863 case ISD::MUL: return getConstantFP(C1 * C2, VT); 864 case ISD::SDIV: 865 if (C2) return getConstantFP(C1 / C2, VT); 866 break; 867 case ISD::SREM : 868 if (C2) return getConstantFP(fmod(C1, C2), VT); 869 break; 870 default: break; 871 } 872 873 } else { // Cannonicalize constant to RHS if commutative 874 if (isCommutativeBinOp(Opcode)) { 875 std::swap(N1CFP, N2CFP); 876 std::swap(N1, N2); 877 } 878 } 879 880 // Finally, fold operations that do not require constants. 881 switch (Opcode) { 882 case ISD::TokenFactor: 883 if (N1.getOpcode() == ISD::EntryToken) 884 return N2; 885 if (N2.getOpcode() == ISD::EntryToken) 886 return N1; 887 break; 888 889 case ISD::AND: 890 case ISD::OR: 891 if (SetCCSDNode *LHS = dyn_cast<SetCCSDNode>(N1.Val)) 892 if (SetCCSDNode *RHS = dyn_cast<SetCCSDNode>(N2.Val)) { 893 SDOperand LL = LHS->getOperand(0), RL = RHS->getOperand(0); 894 SDOperand LR = LHS->getOperand(1), RR = RHS->getOperand(1); 895 ISD::CondCode Op2 = RHS->getCondition(); 896 897 // (X op1 Y) | (Y op2 X) -> (X op1 Y) | (X swapop2 Y) 898 if (LL == RR && LR == RL) { 899 Op2 = ISD::getSetCCSwappedOperands(Op2); 900 goto MatchedBackwards; 901 } 902 903 if (LL == RL && LR == RR) { 904 MatchedBackwards: 905 ISD::CondCode Result; 906 bool isInteger = MVT::isInteger(LL.getValueType()); 907 if (Opcode == ISD::OR) 908 Result = ISD::getSetCCOrOperation(LHS->getCondition(), Op2, 909 isInteger); 910 else 911 Result = ISD::getSetCCAndOperation(LHS->getCondition(), Op2, 912 isInteger); 913 if (Result != ISD::SETCC_INVALID) 914 return getSetCC(Result, LHS->getValueType(0), LL, LR); 915 } 916 } 917 break; 918 case ISD::XOR: 919 if (N1 == N2) return getConstant(0, VT); // xor X, Y -> 0 920 break; 921 case ISD::ADD: 922 if (N2.getOpcode() == ISD::FNEG) // (A+ (-B) -> A-B 923 return getNode(ISD::SUB, VT, N1, N2.getOperand(0)); 924 if (N1.getOpcode() == ISD::FNEG) // ((-A)+B) -> B-A 925 return getNode(ISD::SUB, VT, N2, N1.getOperand(0)); 926 if (N1.getOpcode() == ISD::SUB && isa<ConstantSDNode>(N1.getOperand(0)) && 927 cast<ConstantSDNode>(N1.getOperand(0))->getValue() == 0) 928 return getNode(ISD::SUB, VT, N2, N1.getOperand(1)); // (0-A)+B -> B-A 929 if (N2.getOpcode() == ISD::SUB && isa<ConstantSDNode>(N2.getOperand(0)) && 930 cast<ConstantSDNode>(N2.getOperand(0))->getValue() == 0) 931 return getNode(ISD::SUB, VT, N1, N2.getOperand(1)); // A+(0-B) -> A-B 932 break; 933 case ISD::SUB: 934 if (N1.getOpcode() == ISD::ADD) { 935 if (N1.Val->getOperand(0) == N2) 936 return N1.Val->getOperand(1); // (A+B)-A == B 937 if (N1.Val->getOperand(1) == N2) 938 return N1.Val->getOperand(0); // (A+B)-B == A 939 } 940 if (N2.getOpcode() == ISD::FNEG) // (A- (-B) -> A+B 941 return getNode(ISD::ADD, VT, N1, N2.getOperand(0)); 942 break; 943 case ISD::SHL: 944 case ISD::SRL: 945 case ISD::SRA: 946 if (N2.getOpcode() == ISD::ZERO_EXTEND_INREG || 947 N2.getOpcode() == ISD::SIGN_EXTEND_INREG) { 948 return getNode(Opcode, VT, N1, N2.getOperand(0)); 949 } 950 break; 951 } 952 953 SDNode *&N = BinaryOps[std::make_pair(Opcode, std::make_pair(N1, N2))]; 954 if (N) return SDOperand(N, 0); 955 N = new SDNode(Opcode, N1, N2); 956 N->setValueTypes(VT); 957 958 AllNodes.push_back(N); 959 return SDOperand(N, 0); 960} 961 962SDOperand SelectionDAG::getLoad(MVT::ValueType VT, 963 SDOperand Chain, SDOperand Ptr) { 964 SDNode *&N = Loads[std::make_pair(Ptr, std::make_pair(Chain, VT))]; 965 if (N) return SDOperand(N, 0); 966 N = new SDNode(ISD::LOAD, Chain, Ptr); 967 968 // Loads have a token chain. 969 N->setValueTypes(VT, MVT::Other); 970 AllNodes.push_back(N); 971 return SDOperand(N, 0); 972} 973 974 975SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT, 976 SDOperand N1, SDOperand N2, SDOperand N3) { 977 // Perform various simplifications. 978 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1.Val); 979 ConstantSDNode *N2C = dyn_cast<ConstantSDNode>(N2.Val); 980 ConstantSDNode *N3C = dyn_cast<ConstantSDNode>(N3.Val); 981 switch (Opcode) { 982 case ISD::SELECT: 983 if (N1C) 984 if (N1C->getValue()) 985 return N2; // select true, X, Y -> X 986 else 987 return N3; // select false, X, Y -> Y 988 989 if (N2 == N3) return N2; // select C, X, X -> X 990 991 if (VT == MVT::i1) { // Boolean SELECT 992 if (N2C) { 993 if (N2C->getValue()) // select C, 1, X -> C | X 994 return getNode(ISD::OR, VT, N1, N3); 995 else // select C, 0, X -> ~C & X 996 return getNode(ISD::AND, VT, 997 getNode(ISD::XOR, N1.getValueType(), N1, 998 getConstant(1, N1.getValueType())), N3); 999 } else if (N3C) { 1000 if (N3C->getValue()) // select C, X, 1 -> ~C | X 1001 return getNode(ISD::OR, VT, 1002 getNode(ISD::XOR, N1.getValueType(), N1, 1003 getConstant(1, N1.getValueType())), N2); 1004 else // select C, X, 0 -> C & X 1005 return getNode(ISD::AND, VT, N1, N2); 1006 } 1007 1008 if (N1 == N2) // X ? X : Y --> X ? 1 : Y --> X | Y 1009 return getNode(ISD::OR, VT, N1, N3); 1010 if (N1 == N3) // X ? Y : X --> X ? Y : 0 --> X & Y 1011 return getNode(ISD::AND, VT, N1, N2); 1012 } 1013 1014 // If this is a selectcc, check to see if we can simplify the result. 1015 if (SetCCSDNode *SetCC = dyn_cast<SetCCSDNode>(N1)) { 1016 if (ConstantFPSDNode *CFP = 1017 dyn_cast<ConstantFPSDNode>(SetCC->getOperand(1))) 1018 if (CFP->getValue() == 0.0) { // Allow either -0.0 or 0.0 1019 // select (setg[te] X, +/-0.0), X, fneg(X) -> fabs 1020 if ((SetCC->getCondition() == ISD::SETGE || 1021 SetCC->getCondition() == ISD::SETGT) && 1022 N2 == SetCC->getOperand(0) && N3.getOpcode() == ISD::FNEG && 1023 N3.getOperand(0) == N2) 1024 return getNode(ISD::FABS, VT, N2); 1025 1026 // select (setl[te] X, +/-0.0), fneg(X), X -> fabs 1027 if ((SetCC->getCondition() == ISD::SETLT || 1028 SetCC->getCondition() == ISD::SETLE) && 1029 N3 == SetCC->getOperand(0) && N2.getOpcode() == ISD::FNEG && 1030 N2.getOperand(0) == N3) 1031 return getNode(ISD::FABS, VT, N3); 1032 } 1033 } 1034 break; 1035 case ISD::BRCOND: 1036 if (N2C) 1037 if (N2C->getValue()) // Unconditional branch 1038 return getNode(ISD::BR, MVT::Other, N1, N3); 1039 else 1040 return N1; // Never-taken branch 1041 break; 1042 case ISD::SRA_PARTS: 1043 case ISD::SRL_PARTS: 1044 case ISD::SHL_PARTS: 1045 if (N3.getOpcode() == ISD::ZERO_EXTEND_INREG || 1046 N3.getOpcode() == ISD::SIGN_EXTEND_INREG) { 1047 return getNode(Opcode, VT, N1, N2, N3.getOperand(0)); 1048 } 1049 break; 1050 } 1051 1052 SDNode *N = new SDNode(Opcode, N1, N2, N3); 1053 switch (Opcode) { 1054 default: 1055 N->setValueTypes(VT); 1056 break; 1057 case ISD::DYNAMIC_STACKALLOC: // DYNAMIC_STACKALLOC produces pointer and chain 1058 N->setValueTypes(VT, MVT::Other); 1059 break; 1060 1061 case ISD::SRA_PARTS: 1062 case ISD::SRL_PARTS: 1063 case ISD::SHL_PARTS: { 1064 std::vector<MVT::ValueType> V(N->getNumOperands()-1, VT); 1065 N->setValueTypes(V); 1066 break; 1067 } 1068 } 1069 1070 // FIXME: memoize NODES 1071 AllNodes.push_back(N); 1072 return SDOperand(N, 0); 1073} 1074 1075SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT, 1076 std::vector<SDOperand> &Children) { 1077 switch (Children.size()) { 1078 case 0: return getNode(Opcode, VT); 1079 case 1: return getNode(Opcode, VT, Children[0]); 1080 case 2: return getNode(Opcode, VT, Children[0], Children[1]); 1081 case 3: return getNode(Opcode, VT, Children[0], Children[1], Children[2]); 1082 default: break; 1083 } 1084 1085 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(Children[1].Val); 1086 switch (Opcode) { 1087 default: break; 1088 case ISD::BRCONDTWOWAY: 1089 if (N1C) 1090 if (N1C->getValue()) // Unconditional branch to true dest. 1091 return getNode(ISD::BR, MVT::Other, Children[0], Children[2]); 1092 else // Unconditional branch to false dest. 1093 return getNode(ISD::BR, MVT::Other, Children[0], Children[3]); 1094 break; 1095 } 1096 1097 // FIXME: MEMOIZE!! 1098 SDNode *N = new SDNode(Opcode, Children); 1099 if (Opcode != ISD::ADD_PARTS && Opcode != ISD::SUB_PARTS) { 1100 N->setValueTypes(VT); 1101 } else { 1102 std::vector<MVT::ValueType> V(N->getNumOperands()/2, VT); 1103 N->setValueTypes(V); 1104 } 1105 AllNodes.push_back(N); 1106 return SDOperand(N, 0); 1107} 1108 1109SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT,SDOperand N1, 1110 MVT::ValueType EVT) { 1111 1112 switch (Opcode) { 1113 default: assert(0 && "Bad opcode for this accessor!"); 1114 case ISD::FP_ROUND_INREG: 1115 assert(VT == N1.getValueType() && "Not an inreg round!"); 1116 assert(MVT::isFloatingPoint(VT) && MVT::isFloatingPoint(EVT) && 1117 "Cannot FP_ROUND_INREG integer types"); 1118 if (EVT == VT) return N1; // Not actually rounding 1119 assert(EVT < VT && "Not rounding down!"); 1120 1121 if (isa<ConstantFPSDNode>(N1)) 1122 return getNode(ISD::FP_EXTEND, VT, getNode(ISD::FP_ROUND, EVT, N1)); 1123 break; 1124 case ISD::SIGN_EXTEND_INREG: 1125 assert(VT == N1.getValueType() && "Not an inreg extend!"); 1126 assert(MVT::isInteger(VT) && MVT::isInteger(EVT) && 1127 "Cannot *_EXTEND_INREG FP types"); 1128 if (EVT == VT) return N1; // Not actually extending 1129 assert(EVT < VT && "Not extending!"); 1130 1131 // Extending a constant? Just return the extended constant. 1132 if (ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1.Val)) { 1133 SDOperand Tmp = getNode(ISD::TRUNCATE, EVT, N1); 1134 return getNode(ISD::SIGN_EXTEND, VT, Tmp); 1135 } 1136 1137 // If we are sign extending an extension, use the original source. 1138 if (N1.getOpcode() == ISD::SIGN_EXTEND_INREG) 1139 if (cast<MVTSDNode>(N1)->getExtraValueType() <= EVT) 1140 return N1; 1141 1142 // If we are sign extending a sextload, return just the load. 1143 if (N1.getOpcode() == ISD::SEXTLOAD && Opcode == ISD::SIGN_EXTEND_INREG) 1144 if (cast<MVTSDNode>(N1)->getExtraValueType() <= EVT) 1145 return N1; 1146 1147 // If we are extending the result of a setcc, and we already know the 1148 // contents of the top bits, eliminate the extension. 1149 if (N1.getOpcode() == ISD::SETCC && 1150 TLI.getSetCCResultContents() == 1151 TargetLowering::ZeroOrNegativeOneSetCCResult) 1152 return N1; 1153 1154 // If we are sign extending the result of an (and X, C) operation, and we 1155 // know the extended bits are zeros already, don't do the extend. 1156 if (N1.getOpcode() == ISD::AND) 1157 if (ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1.getOperand(1))) { 1158 uint64_t Mask = N1C->getValue(); 1159 unsigned NumBits = MVT::getSizeInBits(EVT); 1160 if ((Mask & (~0ULL << (NumBits-1))) == 0) 1161 return N1; 1162 } 1163 break; 1164 } 1165 1166 EVTStruct NN; 1167 NN.Opcode = Opcode; 1168 NN.VT = VT; 1169 NN.EVT = EVT; 1170 NN.Ops.push_back(N1); 1171 1172 SDNode *&N = MVTSDNodes[NN]; 1173 if (N) return SDOperand(N, 0); 1174 N = new MVTSDNode(Opcode, VT, N1, EVT); 1175 AllNodes.push_back(N); 1176 return SDOperand(N, 0); 1177} 1178 1179SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT,SDOperand N1, 1180 SDOperand N2, MVT::ValueType EVT) { 1181 switch (Opcode) { 1182 default: assert(0 && "Bad opcode for this accessor!"); 1183 case ISD::EXTLOAD: 1184 case ISD::SEXTLOAD: 1185 case ISD::ZEXTLOAD: 1186 // If they are asking for an extending load from/to the same thing, return a 1187 // normal load. 1188 if (VT == EVT) 1189 return getNode(ISD::LOAD, VT, N1, N2); 1190 assert(EVT < VT && "Should only be an extending load, not truncating!"); 1191 assert((Opcode == ISD::EXTLOAD || MVT::isInteger(VT)) && 1192 "Cannot sign/zero extend a FP load!"); 1193 assert(MVT::isInteger(VT) == MVT::isInteger(EVT) && 1194 "Cannot convert from FP to Int or Int -> FP!"); 1195 break; 1196 } 1197 1198 EVTStruct NN; 1199 NN.Opcode = Opcode; 1200 NN.VT = VT; 1201 NN.EVT = EVT; 1202 NN.Ops.push_back(N1); 1203 NN.Ops.push_back(N2); 1204 1205 SDNode *&N = MVTSDNodes[NN]; 1206 if (N) return SDOperand(N, 0); 1207 N = new MVTSDNode(Opcode, VT, MVT::Other, N1, N2, EVT); 1208 AllNodes.push_back(N); 1209 return SDOperand(N, 0); 1210} 1211 1212SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT,SDOperand N1, 1213 SDOperand N2, SDOperand N3, MVT::ValueType EVT) { 1214 switch (Opcode) { 1215 default: assert(0 && "Bad opcode for this accessor!"); 1216 case ISD::TRUNCSTORE: 1217#if 0 // FIXME: If the target supports EVT natively, convert to a truncate/store 1218 // If this is a truncating store of a constant, convert to the desired type 1219 // and store it instead. 1220 if (isa<Constant>(N1)) { 1221 SDOperand Op = getNode(ISD::TRUNCATE, EVT, N1); 1222 if (isa<Constant>(Op)) 1223 N1 = Op; 1224 } 1225 // Also for ConstantFP? 1226#endif 1227 if (N1.getValueType() == EVT) // Normal store? 1228 return getNode(ISD::STORE, VT, N1, N2, N3); 1229 assert(N2.getValueType() > EVT && "Not a truncation?"); 1230 assert(MVT::isInteger(N2.getValueType()) == MVT::isInteger(EVT) && 1231 "Can't do FP-INT conversion!"); 1232 break; 1233 } 1234 1235 EVTStruct NN; 1236 NN.Opcode = Opcode; 1237 NN.VT = VT; 1238 NN.EVT = EVT; 1239 NN.Ops.push_back(N1); 1240 NN.Ops.push_back(N2); 1241 NN.Ops.push_back(N3); 1242 1243 SDNode *&N = MVTSDNodes[NN]; 1244 if (N) return SDOperand(N, 0); 1245 N = new MVTSDNode(Opcode, VT, N1, N2, N3, EVT); 1246 AllNodes.push_back(N); 1247 return SDOperand(N, 0); 1248} 1249 1250 1251/// hasNUsesOfValue - Return true if there are exactly NUSES uses of the 1252/// indicated value. This method ignores uses of other values defined by this 1253/// operation. 1254bool SDNode::hasNUsesOfValue(unsigned NUses, unsigned Value) { 1255 assert(Value < getNumValues() && "Bad value!"); 1256 1257 // If there is only one value, this is easy. 1258 if (getNumValues() == 1) 1259 return use_size() == NUses; 1260 if (Uses.size() < NUses) return false; 1261 1262 SDOperand TheValue(this, Value); 1263 1264 std::set<SDNode*> UsersHandled; 1265 1266 for (std::vector<SDNode*>::iterator UI = Uses.begin(), E = Uses.end(); 1267 UI != E; ++UI) { 1268 SDNode *User = *UI; 1269 if (User->getNumOperands() == 1 || 1270 UsersHandled.insert(User).second) // First time we've seen this? 1271 for (unsigned i = 0, e = User->getNumOperands(); i != e; ++i) 1272 if (User->getOperand(i) == TheValue) { 1273 if (NUses == 0) 1274 return false; // too many uses 1275 --NUses; 1276 } 1277 } 1278 1279 // Found exactly the right number of uses? 1280 return NUses == 0; 1281} 1282 1283 1284const char *SDNode::getOperationName() const { 1285 switch (getOpcode()) { 1286 default: return "<<Unknown>>"; 1287 case ISD::PCMARKER: return "PCMarker"; 1288 case ISD::EntryToken: return "EntryToken"; 1289 case ISD::TokenFactor: return "TokenFactor"; 1290 case ISD::Constant: return "Constant"; 1291 case ISD::ConstantFP: return "ConstantFP"; 1292 case ISD::GlobalAddress: return "GlobalAddress"; 1293 case ISD::FrameIndex: return "FrameIndex"; 1294 case ISD::BasicBlock: return "BasicBlock"; 1295 case ISD::ExternalSymbol: return "ExternalSymbol"; 1296 case ISD::ConstantPool: return "ConstantPoolIndex"; 1297 case ISD::CopyToReg: return "CopyToReg"; 1298 case ISD::CopyFromReg: return "CopyFromReg"; 1299 case ISD::ImplicitDef: return "ImplicitDef"; 1300 case ISD::UNDEF: return "undef"; 1301 1302 // Unary operators 1303 case ISD::FABS: return "fabs"; 1304 case ISD::FNEG: return "fneg"; 1305 1306 // Binary operators 1307 case ISD::ADD: return "add"; 1308 case ISD::SUB: return "sub"; 1309 case ISD::MUL: return "mul"; 1310 case ISD::MULHU: return "mulhu"; 1311 case ISD::MULHS: return "mulhs"; 1312 case ISD::SDIV: return "sdiv"; 1313 case ISD::UDIV: return "udiv"; 1314 case ISD::SREM: return "srem"; 1315 case ISD::UREM: return "urem"; 1316 case ISD::AND: return "and"; 1317 case ISD::OR: return "or"; 1318 case ISD::XOR: return "xor"; 1319 case ISD::SHL: return "shl"; 1320 case ISD::SRA: return "sra"; 1321 case ISD::SRL: return "srl"; 1322 1323 case ISD::SELECT: return "select"; 1324 case ISD::ADD_PARTS: return "add_parts"; 1325 case ISD::SUB_PARTS: return "sub_parts"; 1326 case ISD::SHL_PARTS: return "shl_parts"; 1327 case ISD::SRA_PARTS: return "sra_parts"; 1328 case ISD::SRL_PARTS: return "srl_parts"; 1329 1330 // Conversion operators. 1331 case ISD::SIGN_EXTEND: return "sign_extend"; 1332 case ISD::ZERO_EXTEND: return "zero_extend"; 1333 case ISD::SIGN_EXTEND_INREG: return "sign_extend_inreg"; 1334 case ISD::TRUNCATE: return "truncate"; 1335 case ISD::FP_ROUND: return "fp_round"; 1336 case ISD::FP_ROUND_INREG: return "fp_round_inreg"; 1337 case ISD::FP_EXTEND: return "fp_extend"; 1338 1339 case ISD::SINT_TO_FP: return "sint_to_fp"; 1340 case ISD::UINT_TO_FP: return "uint_to_fp"; 1341 case ISD::FP_TO_SINT: return "fp_to_sint"; 1342 case ISD::FP_TO_UINT: return "fp_to_uint"; 1343 1344 // Control flow instructions 1345 case ISD::BR: return "br"; 1346 case ISD::BRCOND: return "brcond"; 1347 case ISD::BRCONDTWOWAY: return "brcondtwoway"; 1348 case ISD::RET: return "ret"; 1349 case ISD::CALL: return "call"; 1350 case ISD::ADJCALLSTACKDOWN: return "adjcallstackdown"; 1351 case ISD::ADJCALLSTACKUP: return "adjcallstackup"; 1352 1353 // Other operators 1354 case ISD::LOAD: return "load"; 1355 case ISD::STORE: return "store"; 1356 case ISD::EXTLOAD: return "extload"; 1357 case ISD::SEXTLOAD: return "sextload"; 1358 case ISD::ZEXTLOAD: return "zextload"; 1359 case ISD::TRUNCSTORE: return "truncstore"; 1360 1361 case ISD::DYNAMIC_STACKALLOC: return "dynamic_stackalloc"; 1362 case ISD::EXTRACT_ELEMENT: return "extract_element"; 1363 case ISD::BUILD_PAIR: return "build_pair"; 1364 case ISD::MEMSET: return "memset"; 1365 case ISD::MEMCPY: return "memcpy"; 1366 case ISD::MEMMOVE: return "memmove"; 1367 1368 case ISD::SETCC: 1369 const SetCCSDNode *SetCC = cast<SetCCSDNode>(this); 1370 switch (SetCC->getCondition()) { 1371 default: assert(0 && "Unknown setcc condition!"); 1372 case ISD::SETOEQ: return "setcc:setoeq"; 1373 case ISD::SETOGT: return "setcc:setogt"; 1374 case ISD::SETOGE: return "setcc:setoge"; 1375 case ISD::SETOLT: return "setcc:setolt"; 1376 case ISD::SETOLE: return "setcc:setole"; 1377 case ISD::SETONE: return "setcc:setone"; 1378 1379 case ISD::SETO: return "setcc:seto"; 1380 case ISD::SETUO: return "setcc:setuo"; 1381 case ISD::SETUEQ: return "setcc:setue"; 1382 case ISD::SETUGT: return "setcc:setugt"; 1383 case ISD::SETUGE: return "setcc:setuge"; 1384 case ISD::SETULT: return "setcc:setult"; 1385 case ISD::SETULE: return "setcc:setule"; 1386 case ISD::SETUNE: return "setcc:setune"; 1387 1388 case ISD::SETEQ: return "setcc:seteq"; 1389 case ISD::SETGT: return "setcc:setgt"; 1390 case ISD::SETGE: return "setcc:setge"; 1391 case ISD::SETLT: return "setcc:setlt"; 1392 case ISD::SETLE: return "setcc:setle"; 1393 case ISD::SETNE: return "setcc:setne"; 1394 } 1395 } 1396} 1397 1398void SDNode::dump() const { 1399 std::cerr << (void*)this << ": "; 1400 1401 for (unsigned i = 0, e = getNumValues(); i != e; ++i) { 1402 if (i) std::cerr << ","; 1403 if (getValueType(i) == MVT::Other) 1404 std::cerr << "ch"; 1405 else 1406 std::cerr << MVT::getValueTypeString(getValueType(i)); 1407 } 1408 std::cerr << " = " << getOperationName(); 1409 1410 std::cerr << " "; 1411 for (unsigned i = 0, e = getNumOperands(); i != e; ++i) { 1412 if (i) std::cerr << ", "; 1413 std::cerr << (void*)getOperand(i).Val; 1414 if (unsigned RN = getOperand(i).ResNo) 1415 std::cerr << ":" << RN; 1416 } 1417 1418 if (const ConstantSDNode *CSDN = dyn_cast<ConstantSDNode>(this)) { 1419 std::cerr << "<" << CSDN->getValue() << ">"; 1420 } else if (const ConstantFPSDNode *CSDN = dyn_cast<ConstantFPSDNode>(this)) { 1421 std::cerr << "<" << CSDN->getValue() << ">"; 1422 } else if (const GlobalAddressSDNode *GADN = 1423 dyn_cast<GlobalAddressSDNode>(this)) { 1424 std::cerr << "<"; 1425 WriteAsOperand(std::cerr, GADN->getGlobal()) << ">"; 1426 } else if (const FrameIndexSDNode *FIDN = 1427 dyn_cast<FrameIndexSDNode>(this)) { 1428 std::cerr << "<" << FIDN->getIndex() << ">"; 1429 } else if (const ConstantPoolSDNode *CP = dyn_cast<ConstantPoolSDNode>(this)){ 1430 std::cerr << "<" << CP->getIndex() << ">"; 1431 } else if (const BasicBlockSDNode *BBDN = 1432 dyn_cast<BasicBlockSDNode>(this)) { 1433 std::cerr << "<"; 1434 const Value *LBB = (const Value*)BBDN->getBasicBlock()->getBasicBlock(); 1435 if (LBB) 1436 std::cerr << LBB->getName() << " "; 1437 std::cerr << (const void*)BBDN->getBasicBlock() << ">"; 1438 } else if (const RegSDNode *C2V = dyn_cast<RegSDNode>(this)) { 1439 std::cerr << "<reg #" << C2V->getReg() << ">"; 1440 } else if (const ExternalSymbolSDNode *ES = 1441 dyn_cast<ExternalSymbolSDNode>(this)) { 1442 std::cerr << "'" << ES->getSymbol() << "'"; 1443 } else if (const MVTSDNode *M = dyn_cast<MVTSDNode>(this)) { 1444 std::cerr << " - Ty = " << MVT::getValueTypeString(M->getExtraValueType()); 1445 } 1446} 1447 1448static void DumpNodes(SDNode *N, unsigned indent) { 1449 for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i) 1450 if (N->getOperand(i).Val->hasOneUse()) 1451 DumpNodes(N->getOperand(i).Val, indent+2); 1452 else 1453 std::cerr << "\n" << std::string(indent+2, ' ') 1454 << (void*)N->getOperand(i).Val << ": <multiple use>"; 1455 1456 1457 std::cerr << "\n" << std::string(indent, ' '); 1458 N->dump(); 1459} 1460 1461void SelectionDAG::dump() const { 1462 std::cerr << "SelectionDAG has " << AllNodes.size() << " nodes:"; 1463 std::vector<SDNode*> Nodes(AllNodes); 1464 std::sort(Nodes.begin(), Nodes.end()); 1465 1466 for (unsigned i = 0, e = Nodes.size(); i != e; ++i) { 1467 if (!Nodes[i]->hasOneUse() && Nodes[i] != getRoot().Val) 1468 DumpNodes(Nodes[i], 2); 1469 } 1470 1471 DumpNodes(getRoot().Val, 2); 1472 1473 std::cerr << "\n\n"; 1474} 1475 1476