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