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