SelectionDAG.cpp revision 6f0d024a534af18d9e60b3ea757376cd8a3a980e
1//===-- SelectionDAG.cpp - Implement the SelectionDAG data structures -----===// 2// 3// The LLVM Compiler Infrastructure 4// 5// This file is distributed under the University of Illinois Open Source 6// 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/GlobalVariable.h" 17#include "llvm/Intrinsics.h" 18#include "llvm/DerivedTypes.h" 19#include "llvm/Assembly/Writer.h" 20#include "llvm/CodeGen/MachineBasicBlock.h" 21#include "llvm/CodeGen/MachineConstantPool.h" 22#include "llvm/CodeGen/MachineFrameInfo.h" 23#include "llvm/CodeGen/MachineModuleInfo.h" 24#include "llvm/CodeGen/PseudoSourceValue.h" 25#include "llvm/Support/MathExtras.h" 26#include "llvm/Target/TargetRegisterInfo.h" 27#include "llvm/Target/TargetData.h" 28#include "llvm/Target/TargetLowering.h" 29#include "llvm/Target/TargetInstrInfo.h" 30#include "llvm/Target/TargetMachine.h" 31#include "llvm/ADT/SetVector.h" 32#include "llvm/ADT/SmallPtrSet.h" 33#include "llvm/ADT/SmallSet.h" 34#include "llvm/ADT/SmallVector.h" 35#include "llvm/ADT/StringExtras.h" 36#include <algorithm> 37#include <cmath> 38using namespace llvm; 39 40/// makeVTList - Return an instance of the SDVTList struct initialized with the 41/// specified members. 42static SDVTList makeVTList(const MVT::ValueType *VTs, unsigned NumVTs) { 43 SDVTList Res = {VTs, NumVTs}; 44 return Res; 45} 46 47SelectionDAG::DAGUpdateListener::~DAGUpdateListener() {} 48 49//===----------------------------------------------------------------------===// 50// ConstantFPSDNode Class 51//===----------------------------------------------------------------------===// 52 53/// isExactlyValue - We don't rely on operator== working on double values, as 54/// it returns true for things that are clearly not equal, like -0.0 and 0.0. 55/// As such, this method can be used to do an exact bit-for-bit comparison of 56/// two floating point values. 57bool ConstantFPSDNode::isExactlyValue(const APFloat& V) const { 58 return Value.bitwiseIsEqual(V); 59} 60 61bool ConstantFPSDNode::isValueValidForType(MVT::ValueType VT, 62 const APFloat& Val) { 63 // convert modifies in place, so make a copy. 64 APFloat Val2 = APFloat(Val); 65 switch (VT) { 66 default: 67 return false; // These can't be represented as floating point! 68 69 // FIXME rounding mode needs to be more flexible 70 case MVT::f32: 71 return &Val2.getSemantics() == &APFloat::IEEEsingle || 72 Val2.convert(APFloat::IEEEsingle, APFloat::rmNearestTiesToEven) == 73 APFloat::opOK; 74 case MVT::f64: 75 return &Val2.getSemantics() == &APFloat::IEEEsingle || 76 &Val2.getSemantics() == &APFloat::IEEEdouble || 77 Val2.convert(APFloat::IEEEdouble, APFloat::rmNearestTiesToEven) == 78 APFloat::opOK; 79 // TODO: Figure out how to test if we can use a shorter type instead! 80 case MVT::f80: 81 case MVT::f128: 82 case MVT::ppcf128: 83 return true; 84 } 85} 86 87//===----------------------------------------------------------------------===// 88// ISD Namespace 89//===----------------------------------------------------------------------===// 90 91/// isBuildVectorAllOnes - Return true if the specified node is a 92/// BUILD_VECTOR where all of the elements are ~0 or undef. 93bool ISD::isBuildVectorAllOnes(const SDNode *N) { 94 // Look through a bit convert. 95 if (N->getOpcode() == ISD::BIT_CONVERT) 96 N = N->getOperand(0).Val; 97 98 if (N->getOpcode() != ISD::BUILD_VECTOR) return false; 99 100 unsigned i = 0, e = N->getNumOperands(); 101 102 // Skip over all of the undef values. 103 while (i != e && N->getOperand(i).getOpcode() == ISD::UNDEF) 104 ++i; 105 106 // Do not accept an all-undef vector. 107 if (i == e) return false; 108 109 // Do not accept build_vectors that aren't all constants or which have non-~0 110 // elements. 111 SDOperand NotZero = N->getOperand(i); 112 if (isa<ConstantSDNode>(NotZero)) { 113 if (!cast<ConstantSDNode>(NotZero)->isAllOnesValue()) 114 return false; 115 } else if (isa<ConstantFPSDNode>(NotZero)) { 116 MVT::ValueType VT = NotZero.getValueType(); 117 if (VT== MVT::f64) { 118 if (((cast<ConstantFPSDNode>(NotZero)->getValueAPF(). 119 convertToAPInt().getZExtValue())) != (uint64_t)-1) 120 return false; 121 } else { 122 if ((uint32_t)cast<ConstantFPSDNode>(NotZero)-> 123 getValueAPF().convertToAPInt().getZExtValue() != 124 (uint32_t)-1) 125 return false; 126 } 127 } else 128 return false; 129 130 // Okay, we have at least one ~0 value, check to see if the rest match or are 131 // undefs. 132 for (++i; i != e; ++i) 133 if (N->getOperand(i) != NotZero && 134 N->getOperand(i).getOpcode() != ISD::UNDEF) 135 return false; 136 return true; 137} 138 139 140/// isBuildVectorAllZeros - Return true if the specified node is a 141/// BUILD_VECTOR where all of the elements are 0 or undef. 142bool ISD::isBuildVectorAllZeros(const SDNode *N) { 143 // Look through a bit convert. 144 if (N->getOpcode() == ISD::BIT_CONVERT) 145 N = N->getOperand(0).Val; 146 147 if (N->getOpcode() != ISD::BUILD_VECTOR) return false; 148 149 unsigned i = 0, e = N->getNumOperands(); 150 151 // Skip over all of the undef values. 152 while (i != e && N->getOperand(i).getOpcode() == ISD::UNDEF) 153 ++i; 154 155 // Do not accept an all-undef vector. 156 if (i == e) return false; 157 158 // Do not accept build_vectors that aren't all constants or which have non-~0 159 // elements. 160 SDOperand Zero = N->getOperand(i); 161 if (isa<ConstantSDNode>(Zero)) { 162 if (!cast<ConstantSDNode>(Zero)->isNullValue()) 163 return false; 164 } else if (isa<ConstantFPSDNode>(Zero)) { 165 if (!cast<ConstantFPSDNode>(Zero)->getValueAPF().isPosZero()) 166 return false; 167 } else 168 return false; 169 170 // Okay, we have at least one ~0 value, check to see if the rest match or are 171 // undefs. 172 for (++i; i != e; ++i) 173 if (N->getOperand(i) != Zero && 174 N->getOperand(i).getOpcode() != ISD::UNDEF) 175 return false; 176 return true; 177} 178 179/// isDebugLabel - Return true if the specified node represents a debug 180/// label (i.e. ISD::LABEL or TargetInstrInfo::LABEL node and third operand 181/// is 0). 182bool ISD::isDebugLabel(const SDNode *N) { 183 SDOperand Zero; 184 if (N->getOpcode() == ISD::LABEL) 185 Zero = N->getOperand(2); 186 else if (N->isTargetOpcode() && 187 N->getTargetOpcode() == TargetInstrInfo::LABEL) 188 // Chain moved to last operand. 189 Zero = N->getOperand(1); 190 else 191 return false; 192 return isa<ConstantSDNode>(Zero) && cast<ConstantSDNode>(Zero)->isNullValue(); 193} 194 195/// getSetCCSwappedOperands - Return the operation corresponding to (Y op X) 196/// when given the operation for (X op Y). 197ISD::CondCode ISD::getSetCCSwappedOperands(ISD::CondCode Operation) { 198 // To perform this operation, we just need to swap the L and G bits of the 199 // operation. 200 unsigned OldL = (Operation >> 2) & 1; 201 unsigned OldG = (Operation >> 1) & 1; 202 return ISD::CondCode((Operation & ~6) | // Keep the N, U, E bits 203 (OldL << 1) | // New G bit 204 (OldG << 2)); // New L bit. 205} 206 207/// getSetCCInverse - Return the operation corresponding to !(X op Y), where 208/// 'op' is a valid SetCC operation. 209ISD::CondCode ISD::getSetCCInverse(ISD::CondCode Op, bool isInteger) { 210 unsigned Operation = Op; 211 if (isInteger) 212 Operation ^= 7; // Flip L, G, E bits, but not U. 213 else 214 Operation ^= 15; // Flip all of the condition bits. 215 if (Operation > ISD::SETTRUE2) 216 Operation &= ~8; // Don't let N and U bits get set. 217 return ISD::CondCode(Operation); 218} 219 220 221/// isSignedOp - For an integer comparison, return 1 if the comparison is a 222/// signed operation and 2 if the result is an unsigned comparison. Return zero 223/// if the operation does not depend on the sign of the input (setne and seteq). 224static int isSignedOp(ISD::CondCode Opcode) { 225 switch (Opcode) { 226 default: assert(0 && "Illegal integer setcc operation!"); 227 case ISD::SETEQ: 228 case ISD::SETNE: return 0; 229 case ISD::SETLT: 230 case ISD::SETLE: 231 case ISD::SETGT: 232 case ISD::SETGE: return 1; 233 case ISD::SETULT: 234 case ISD::SETULE: 235 case ISD::SETUGT: 236 case ISD::SETUGE: return 2; 237 } 238} 239 240/// getSetCCOrOperation - Return the result of a logical OR between different 241/// comparisons of identical values: ((X op1 Y) | (X op2 Y)). This function 242/// returns SETCC_INVALID if it is not possible to represent the resultant 243/// comparison. 244ISD::CondCode ISD::getSetCCOrOperation(ISD::CondCode Op1, ISD::CondCode Op2, 245 bool isInteger) { 246 if (isInteger && (isSignedOp(Op1) | isSignedOp(Op2)) == 3) 247 // Cannot fold a signed integer setcc with an unsigned integer setcc. 248 return ISD::SETCC_INVALID; 249 250 unsigned Op = Op1 | Op2; // Combine all of the condition bits. 251 252 // If the N and U bits get set then the resultant comparison DOES suddenly 253 // care about orderedness, and is true when ordered. 254 if (Op > ISD::SETTRUE2) 255 Op &= ~16; // Clear the U bit if the N bit is set. 256 257 // Canonicalize illegal integer setcc's. 258 if (isInteger && Op == ISD::SETUNE) // e.g. SETUGT | SETULT 259 Op = ISD::SETNE; 260 261 return ISD::CondCode(Op); 262} 263 264/// getSetCCAndOperation - Return the result of a logical AND between different 265/// comparisons of identical values: ((X op1 Y) & (X op2 Y)). This 266/// function returns zero if it is not possible to represent the resultant 267/// comparison. 268ISD::CondCode ISD::getSetCCAndOperation(ISD::CondCode Op1, ISD::CondCode Op2, 269 bool isInteger) { 270 if (isInteger && (isSignedOp(Op1) | isSignedOp(Op2)) == 3) 271 // Cannot fold a signed setcc with an unsigned setcc. 272 return ISD::SETCC_INVALID; 273 274 // Combine all of the condition bits. 275 ISD::CondCode Result = ISD::CondCode(Op1 & Op2); 276 277 // Canonicalize illegal integer setcc's. 278 if (isInteger) { 279 switch (Result) { 280 default: break; 281 case ISD::SETUO : Result = ISD::SETFALSE; break; // SETUGT & SETULT 282 case ISD::SETUEQ: Result = ISD::SETEQ ; break; // SETUGE & SETULE 283 case ISD::SETOLT: Result = ISD::SETULT ; break; // SETULT & SETNE 284 case ISD::SETOGT: Result = ISD::SETUGT ; break; // SETUGT & SETNE 285 } 286 } 287 288 return Result; 289} 290 291const TargetMachine &SelectionDAG::getTarget() const { 292 return TLI.getTargetMachine(); 293} 294 295//===----------------------------------------------------------------------===// 296// SDNode Profile Support 297//===----------------------------------------------------------------------===// 298 299/// AddNodeIDOpcode - Add the node opcode to the NodeID data. 300/// 301static void AddNodeIDOpcode(FoldingSetNodeID &ID, unsigned OpC) { 302 ID.AddInteger(OpC); 303} 304 305/// AddNodeIDValueTypes - Value type lists are intern'd so we can represent them 306/// solely with their pointer. 307void AddNodeIDValueTypes(FoldingSetNodeID &ID, SDVTList VTList) { 308 ID.AddPointer(VTList.VTs); 309} 310 311/// AddNodeIDOperands - Various routines for adding operands to the NodeID data. 312/// 313static void AddNodeIDOperands(FoldingSetNodeID &ID, 314 const SDOperand *Ops, unsigned NumOps) { 315 for (; NumOps; --NumOps, ++Ops) { 316 ID.AddPointer(Ops->Val); 317 ID.AddInteger(Ops->ResNo); 318 } 319} 320 321static void AddNodeIDNode(FoldingSetNodeID &ID, 322 unsigned short OpC, SDVTList VTList, 323 const SDOperand *OpList, unsigned N) { 324 AddNodeIDOpcode(ID, OpC); 325 AddNodeIDValueTypes(ID, VTList); 326 AddNodeIDOperands(ID, OpList, N); 327} 328 329/// AddNodeIDNode - Generic routine for adding a nodes info to the NodeID 330/// data. 331static void AddNodeIDNode(FoldingSetNodeID &ID, SDNode *N) { 332 AddNodeIDOpcode(ID, N->getOpcode()); 333 // Add the return value info. 334 AddNodeIDValueTypes(ID, N->getVTList()); 335 // Add the operand info. 336 AddNodeIDOperands(ID, N->op_begin(), N->getNumOperands()); 337 338 // Handle SDNode leafs with special info. 339 switch (N->getOpcode()) { 340 default: break; // Normal nodes don't need extra info. 341 case ISD::TargetConstant: 342 case ISD::Constant: 343 ID.AddInteger(cast<ConstantSDNode>(N)->getValue()); 344 break; 345 case ISD::TargetConstantFP: 346 case ISD::ConstantFP: { 347 ID.AddAPFloat(cast<ConstantFPSDNode>(N)->getValueAPF()); 348 break; 349 } 350 case ISD::TargetGlobalAddress: 351 case ISD::GlobalAddress: 352 case ISD::TargetGlobalTLSAddress: 353 case ISD::GlobalTLSAddress: { 354 GlobalAddressSDNode *GA = cast<GlobalAddressSDNode>(N); 355 ID.AddPointer(GA->getGlobal()); 356 ID.AddInteger(GA->getOffset()); 357 break; 358 } 359 case ISD::BasicBlock: 360 ID.AddPointer(cast<BasicBlockSDNode>(N)->getBasicBlock()); 361 break; 362 case ISD::Register: 363 ID.AddInteger(cast<RegisterSDNode>(N)->getReg()); 364 break; 365 case ISD::SRCVALUE: 366 ID.AddPointer(cast<SrcValueSDNode>(N)->getValue()); 367 break; 368 case ISD::MEMOPERAND: { 369 const MemOperand &MO = cast<MemOperandSDNode>(N)->MO; 370 ID.AddPointer(MO.getValue()); 371 ID.AddInteger(MO.getFlags()); 372 ID.AddInteger(MO.getOffset()); 373 ID.AddInteger(MO.getSize()); 374 ID.AddInteger(MO.getAlignment()); 375 break; 376 } 377 case ISD::FrameIndex: 378 case ISD::TargetFrameIndex: 379 ID.AddInteger(cast<FrameIndexSDNode>(N)->getIndex()); 380 break; 381 case ISD::JumpTable: 382 case ISD::TargetJumpTable: 383 ID.AddInteger(cast<JumpTableSDNode>(N)->getIndex()); 384 break; 385 case ISD::ConstantPool: 386 case ISD::TargetConstantPool: { 387 ConstantPoolSDNode *CP = cast<ConstantPoolSDNode>(N); 388 ID.AddInteger(CP->getAlignment()); 389 ID.AddInteger(CP->getOffset()); 390 if (CP->isMachineConstantPoolEntry()) 391 CP->getMachineCPVal()->AddSelectionDAGCSEId(ID); 392 else 393 ID.AddPointer(CP->getConstVal()); 394 break; 395 } 396 case ISD::LOAD: { 397 LoadSDNode *LD = cast<LoadSDNode>(N); 398 ID.AddInteger(LD->getAddressingMode()); 399 ID.AddInteger(LD->getExtensionType()); 400 ID.AddInteger((unsigned int)(LD->getMemoryVT())); 401 ID.AddInteger(LD->getAlignment()); 402 ID.AddInteger(LD->isVolatile()); 403 break; 404 } 405 case ISD::STORE: { 406 StoreSDNode *ST = cast<StoreSDNode>(N); 407 ID.AddInteger(ST->getAddressingMode()); 408 ID.AddInteger(ST->isTruncatingStore()); 409 ID.AddInteger((unsigned int)(ST->getMemoryVT())); 410 ID.AddInteger(ST->getAlignment()); 411 ID.AddInteger(ST->isVolatile()); 412 break; 413 } 414 } 415} 416 417//===----------------------------------------------------------------------===// 418// SelectionDAG Class 419//===----------------------------------------------------------------------===// 420 421/// RemoveDeadNodes - This method deletes all unreachable nodes in the 422/// SelectionDAG. 423void SelectionDAG::RemoveDeadNodes() { 424 // Create a dummy node (which is not added to allnodes), that adds a reference 425 // to the root node, preventing it from being deleted. 426 HandleSDNode Dummy(getRoot()); 427 428 SmallVector<SDNode*, 128> DeadNodes; 429 430 // Add all obviously-dead nodes to the DeadNodes worklist. 431 for (allnodes_iterator I = allnodes_begin(), E = allnodes_end(); I != E; ++I) 432 if (I->use_empty()) 433 DeadNodes.push_back(I); 434 435 // Process the worklist, deleting the nodes and adding their uses to the 436 // worklist. 437 while (!DeadNodes.empty()) { 438 SDNode *N = DeadNodes.back(); 439 DeadNodes.pop_back(); 440 441 // Take the node out of the appropriate CSE map. 442 RemoveNodeFromCSEMaps(N); 443 444 // Next, brutally remove the operand list. This is safe to do, as there are 445 // no cycles in the graph. 446 for (SDNode::op_iterator I = N->op_begin(), E = N->op_end(); I != E; ++I) { 447 SDNode *Operand = I->Val; 448 Operand->removeUser(N); 449 450 // Now that we removed this operand, see if there are no uses of it left. 451 if (Operand->use_empty()) 452 DeadNodes.push_back(Operand); 453 } 454 if (N->OperandsNeedDelete) 455 delete[] N->OperandList; 456 N->OperandList = 0; 457 N->NumOperands = 0; 458 459 // Finally, remove N itself. 460 AllNodes.erase(N); 461 } 462 463 // If the root changed (e.g. it was a dead load, update the root). 464 setRoot(Dummy.getValue()); 465} 466 467void SelectionDAG::RemoveDeadNode(SDNode *N, DAGUpdateListener *UpdateListener){ 468 SmallVector<SDNode*, 16> DeadNodes; 469 DeadNodes.push_back(N); 470 471 // Process the worklist, deleting the nodes and adding their uses to the 472 // worklist. 473 while (!DeadNodes.empty()) { 474 SDNode *N = DeadNodes.back(); 475 DeadNodes.pop_back(); 476 477 if (UpdateListener) 478 UpdateListener->NodeDeleted(N); 479 480 // Take the node out of the appropriate CSE map. 481 RemoveNodeFromCSEMaps(N); 482 483 // Next, brutally remove the operand list. This is safe to do, as there are 484 // no cycles in the graph. 485 for (SDNode::op_iterator I = N->op_begin(), E = N->op_end(); I != E; ++I) { 486 SDNode *Operand = I->Val; 487 Operand->removeUser(N); 488 489 // Now that we removed this operand, see if there are no uses of it left. 490 if (Operand->use_empty()) 491 DeadNodes.push_back(Operand); 492 } 493 if (N->OperandsNeedDelete) 494 delete[] N->OperandList; 495 N->OperandList = 0; 496 N->NumOperands = 0; 497 498 // Finally, remove N itself. 499 AllNodes.erase(N); 500 } 501} 502 503void SelectionDAG::DeleteNode(SDNode *N) { 504 assert(N->use_empty() && "Cannot delete a node that is not dead!"); 505 506 // First take this out of the appropriate CSE map. 507 RemoveNodeFromCSEMaps(N); 508 509 // Finally, remove uses due to operands of this node, remove from the 510 // AllNodes list, and delete the node. 511 DeleteNodeNotInCSEMaps(N); 512} 513 514void SelectionDAG::DeleteNodeNotInCSEMaps(SDNode *N) { 515 516 // Remove it from the AllNodes list. 517 AllNodes.remove(N); 518 519 // Drop all of the operands and decrement used nodes use counts. 520 for (SDNode::op_iterator I = N->op_begin(), E = N->op_end(); I != E; ++I) 521 I->Val->removeUser(N); 522 if (N->OperandsNeedDelete) 523 delete[] N->OperandList; 524 N->OperandList = 0; 525 N->NumOperands = 0; 526 527 delete N; 528} 529 530/// RemoveNodeFromCSEMaps - Take the specified node out of the CSE map that 531/// correspond to it. This is useful when we're about to delete or repurpose 532/// the node. We don't want future request for structurally identical nodes 533/// to return N anymore. 534void SelectionDAG::RemoveNodeFromCSEMaps(SDNode *N) { 535 bool Erased = false; 536 switch (N->getOpcode()) { 537 case ISD::HANDLENODE: return; // noop. 538 case ISD::STRING: 539 Erased = StringNodes.erase(cast<StringSDNode>(N)->getValue()); 540 break; 541 case ISD::CONDCODE: 542 assert(CondCodeNodes[cast<CondCodeSDNode>(N)->get()] && 543 "Cond code doesn't exist!"); 544 Erased = CondCodeNodes[cast<CondCodeSDNode>(N)->get()] != 0; 545 CondCodeNodes[cast<CondCodeSDNode>(N)->get()] = 0; 546 break; 547 case ISD::ExternalSymbol: 548 Erased = ExternalSymbols.erase(cast<ExternalSymbolSDNode>(N)->getSymbol()); 549 break; 550 case ISD::TargetExternalSymbol: 551 Erased = 552 TargetExternalSymbols.erase(cast<ExternalSymbolSDNode>(N)->getSymbol()); 553 break; 554 case ISD::VALUETYPE: { 555 MVT::ValueType VT = cast<VTSDNode>(N)->getVT(); 556 if (MVT::isExtendedVT(VT)) { 557 Erased = ExtendedValueTypeNodes.erase(VT); 558 } else { 559 Erased = ValueTypeNodes[VT] != 0; 560 ValueTypeNodes[VT] = 0; 561 } 562 break; 563 } 564 default: 565 // Remove it from the CSE Map. 566 Erased = CSEMap.RemoveNode(N); 567 break; 568 } 569#ifndef NDEBUG 570 // Verify that the node was actually in one of the CSE maps, unless it has a 571 // flag result (which cannot be CSE'd) or is one of the special cases that are 572 // not subject to CSE. 573 if (!Erased && N->getValueType(N->getNumValues()-1) != MVT::Flag && 574 !N->isTargetOpcode()) { 575 N->dump(this); 576 cerr << "\n"; 577 assert(0 && "Node is not in map!"); 578 } 579#endif 580} 581 582/// AddNonLeafNodeToCSEMaps - Add the specified node back to the CSE maps. It 583/// has been taken out and modified in some way. If the specified node already 584/// exists in the CSE maps, do not modify the maps, but return the existing node 585/// instead. If it doesn't exist, add it and return null. 586/// 587SDNode *SelectionDAG::AddNonLeafNodeToCSEMaps(SDNode *N) { 588 assert(N->getNumOperands() && "This is a leaf node!"); 589 if (N->getOpcode() == ISD::HANDLENODE || N->getValueType(0) == MVT::Flag) 590 return 0; // Never add these nodes. 591 592 // Check that remaining values produced are not flags. 593 for (unsigned i = 1, e = N->getNumValues(); i != e; ++i) 594 if (N->getValueType(i) == MVT::Flag) 595 return 0; // Never CSE anything that produces a flag. 596 597 SDNode *New = CSEMap.GetOrInsertNode(N); 598 if (New != N) return New; // Node already existed. 599 return 0; 600} 601 602/// FindModifiedNodeSlot - Find a slot for the specified node if its operands 603/// were replaced with those specified. If this node is never memoized, 604/// return null, otherwise return a pointer to the slot it would take. If a 605/// node already exists with these operands, the slot will be non-null. 606SDNode *SelectionDAG::FindModifiedNodeSlot(SDNode *N, SDOperand Op, 607 void *&InsertPos) { 608 if (N->getOpcode() == ISD::HANDLENODE || N->getValueType(0) == MVT::Flag) 609 return 0; // Never add these nodes. 610 611 // Check that remaining values produced are not flags. 612 for (unsigned i = 1, e = N->getNumValues(); i != e; ++i) 613 if (N->getValueType(i) == MVT::Flag) 614 return 0; // Never CSE anything that produces a flag. 615 616 SDOperand Ops[] = { Op }; 617 FoldingSetNodeID ID; 618 AddNodeIDNode(ID, N->getOpcode(), N->getVTList(), Ops, 1); 619 return CSEMap.FindNodeOrInsertPos(ID, InsertPos); 620} 621 622/// FindModifiedNodeSlot - Find a slot for the specified node if its operands 623/// were replaced with those specified. If this node is never memoized, 624/// return null, otherwise return a pointer to the slot it would take. If a 625/// node already exists with these operands, the slot will be non-null. 626SDNode *SelectionDAG::FindModifiedNodeSlot(SDNode *N, 627 SDOperand Op1, SDOperand Op2, 628 void *&InsertPos) { 629 if (N->getOpcode() == ISD::HANDLENODE || N->getValueType(0) == MVT::Flag) 630 return 0; // Never add these nodes. 631 632 // Check that remaining values produced are not flags. 633 for (unsigned i = 1, e = N->getNumValues(); i != e; ++i) 634 if (N->getValueType(i) == MVT::Flag) 635 return 0; // Never CSE anything that produces a flag. 636 637 SDOperand Ops[] = { Op1, Op2 }; 638 FoldingSetNodeID ID; 639 AddNodeIDNode(ID, N->getOpcode(), N->getVTList(), Ops, 2); 640 return CSEMap.FindNodeOrInsertPos(ID, InsertPos); 641} 642 643 644/// FindModifiedNodeSlot - Find a slot for the specified node if its operands 645/// were replaced with those specified. If this node is never memoized, 646/// return null, otherwise return a pointer to the slot it would take. If a 647/// node already exists with these operands, the slot will be non-null. 648SDNode *SelectionDAG::FindModifiedNodeSlot(SDNode *N, 649 const SDOperand *Ops,unsigned NumOps, 650 void *&InsertPos) { 651 if (N->getOpcode() == ISD::HANDLENODE || N->getValueType(0) == MVT::Flag) 652 return 0; // Never add these nodes. 653 654 // Check that remaining values produced are not flags. 655 for (unsigned i = 1, e = N->getNumValues(); i != e; ++i) 656 if (N->getValueType(i) == MVT::Flag) 657 return 0; // Never CSE anything that produces a flag. 658 659 FoldingSetNodeID ID; 660 AddNodeIDNode(ID, N->getOpcode(), N->getVTList(), Ops, NumOps); 661 662 if (const LoadSDNode *LD = dyn_cast<LoadSDNode>(N)) { 663 ID.AddInteger(LD->getAddressingMode()); 664 ID.AddInteger(LD->getExtensionType()); 665 ID.AddInteger((unsigned int)(LD->getMemoryVT())); 666 ID.AddInteger(LD->getAlignment()); 667 ID.AddInteger(LD->isVolatile()); 668 } else if (const StoreSDNode *ST = dyn_cast<StoreSDNode>(N)) { 669 ID.AddInteger(ST->getAddressingMode()); 670 ID.AddInteger(ST->isTruncatingStore()); 671 ID.AddInteger((unsigned int)(ST->getMemoryVT())); 672 ID.AddInteger(ST->getAlignment()); 673 ID.AddInteger(ST->isVolatile()); 674 } 675 676 return CSEMap.FindNodeOrInsertPos(ID, InsertPos); 677} 678 679 680SelectionDAG::~SelectionDAG() { 681 while (!AllNodes.empty()) { 682 SDNode *N = AllNodes.begin(); 683 N->SetNextInBucket(0); 684 if (N->OperandsNeedDelete) 685 delete [] N->OperandList; 686 N->OperandList = 0; 687 N->NumOperands = 0; 688 AllNodes.pop_front(); 689 } 690} 691 692SDOperand SelectionDAG::getZeroExtendInReg(SDOperand Op, MVT::ValueType VT) { 693 if (Op.getValueType() == VT) return Op; 694 int64_t Imm = ~0ULL >> (64-MVT::getSizeInBits(VT)); 695 return getNode(ISD::AND, Op.getValueType(), Op, 696 getConstant(Imm, Op.getValueType())); 697} 698 699SDOperand SelectionDAG::getString(const std::string &Val) { 700 StringSDNode *&N = StringNodes[Val]; 701 if (!N) { 702 N = new StringSDNode(Val); 703 AllNodes.push_back(N); 704 } 705 return SDOperand(N, 0); 706} 707 708SDOperand SelectionDAG::getConstant(uint64_t Val, MVT::ValueType VT, bool isT) { 709 MVT::ValueType EltVT = 710 MVT::isVector(VT) ? MVT::getVectorElementType(VT) : VT; 711 712 return getConstant(APInt(MVT::getSizeInBits(EltVT), Val), VT, isT); 713} 714 715SDOperand SelectionDAG::getConstant(const APInt &Val, MVT::ValueType VT, bool isT) { 716 assert(MVT::isInteger(VT) && "Cannot create FP integer constant!"); 717 718 MVT::ValueType EltVT = 719 MVT::isVector(VT) ? MVT::getVectorElementType(VT) : VT; 720 721 assert(Val.getBitWidth() == MVT::getSizeInBits(EltVT) && 722 "APInt size does not match type size!"); 723 724 unsigned Opc = isT ? ISD::TargetConstant : ISD::Constant; 725 FoldingSetNodeID ID; 726 AddNodeIDNode(ID, Opc, getVTList(EltVT), 0, 0); 727 ID.AddAPInt(Val); 728 void *IP = 0; 729 SDNode *N = NULL; 730 if ((N = CSEMap.FindNodeOrInsertPos(ID, IP))) 731 if (!MVT::isVector(VT)) 732 return SDOperand(N, 0); 733 if (!N) { 734 N = new ConstantSDNode(isT, Val, EltVT); 735 CSEMap.InsertNode(N, IP); 736 AllNodes.push_back(N); 737 } 738 739 SDOperand Result(N, 0); 740 if (MVT::isVector(VT)) { 741 SmallVector<SDOperand, 8> Ops; 742 Ops.assign(MVT::getVectorNumElements(VT), Result); 743 Result = getNode(ISD::BUILD_VECTOR, VT, &Ops[0], Ops.size()); 744 } 745 return Result; 746} 747 748SDOperand SelectionDAG::getIntPtrConstant(uint64_t Val, bool isTarget) { 749 return getConstant(Val, TLI.getPointerTy(), isTarget); 750} 751 752 753SDOperand SelectionDAG::getConstantFP(const APFloat& V, MVT::ValueType VT, 754 bool isTarget) { 755 assert(MVT::isFloatingPoint(VT) && "Cannot create integer FP constant!"); 756 757 MVT::ValueType EltVT = 758 MVT::isVector(VT) ? MVT::getVectorElementType(VT) : VT; 759 760 // Do the map lookup using the actual bit pattern for the floating point 761 // value, so that we don't have problems with 0.0 comparing equal to -0.0, and 762 // we don't have issues with SNANs. 763 unsigned Opc = isTarget ? ISD::TargetConstantFP : ISD::ConstantFP; 764 FoldingSetNodeID ID; 765 AddNodeIDNode(ID, Opc, getVTList(EltVT), 0, 0); 766 ID.AddAPFloat(V); 767 void *IP = 0; 768 SDNode *N = NULL; 769 if ((N = CSEMap.FindNodeOrInsertPos(ID, IP))) 770 if (!MVT::isVector(VT)) 771 return SDOperand(N, 0); 772 if (!N) { 773 N = new ConstantFPSDNode(isTarget, V, EltVT); 774 CSEMap.InsertNode(N, IP); 775 AllNodes.push_back(N); 776 } 777 778 SDOperand Result(N, 0); 779 if (MVT::isVector(VT)) { 780 SmallVector<SDOperand, 8> Ops; 781 Ops.assign(MVT::getVectorNumElements(VT), Result); 782 Result = getNode(ISD::BUILD_VECTOR, VT, &Ops[0], Ops.size()); 783 } 784 return Result; 785} 786 787SDOperand SelectionDAG::getConstantFP(double Val, MVT::ValueType VT, 788 bool isTarget) { 789 MVT::ValueType EltVT = 790 MVT::isVector(VT) ? MVT::getVectorElementType(VT) : VT; 791 if (EltVT==MVT::f32) 792 return getConstantFP(APFloat((float)Val), VT, isTarget); 793 else 794 return getConstantFP(APFloat(Val), VT, isTarget); 795} 796 797SDOperand SelectionDAG::getGlobalAddress(const GlobalValue *GV, 798 MVT::ValueType VT, int Offset, 799 bool isTargetGA) { 800 const GlobalVariable *GVar = dyn_cast<GlobalVariable>(GV); 801 unsigned Opc; 802 if (GVar && GVar->isThreadLocal()) 803 Opc = isTargetGA ? ISD::TargetGlobalTLSAddress : ISD::GlobalTLSAddress; 804 else 805 Opc = isTargetGA ? ISD::TargetGlobalAddress : ISD::GlobalAddress; 806 FoldingSetNodeID ID; 807 AddNodeIDNode(ID, Opc, getVTList(VT), 0, 0); 808 ID.AddPointer(GV); 809 ID.AddInteger(Offset); 810 void *IP = 0; 811 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP)) 812 return SDOperand(E, 0); 813 SDNode *N = new GlobalAddressSDNode(isTargetGA, GV, VT, Offset); 814 CSEMap.InsertNode(N, IP); 815 AllNodes.push_back(N); 816 return SDOperand(N, 0); 817} 818 819SDOperand SelectionDAG::getFrameIndex(int FI, MVT::ValueType VT, 820 bool isTarget) { 821 unsigned Opc = isTarget ? ISD::TargetFrameIndex : ISD::FrameIndex; 822 FoldingSetNodeID ID; 823 AddNodeIDNode(ID, Opc, getVTList(VT), 0, 0); 824 ID.AddInteger(FI); 825 void *IP = 0; 826 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP)) 827 return SDOperand(E, 0); 828 SDNode *N = new FrameIndexSDNode(FI, VT, isTarget); 829 CSEMap.InsertNode(N, IP); 830 AllNodes.push_back(N); 831 return SDOperand(N, 0); 832} 833 834SDOperand SelectionDAG::getJumpTable(int JTI, MVT::ValueType VT, bool isTarget){ 835 unsigned Opc = isTarget ? ISD::TargetJumpTable : ISD::JumpTable; 836 FoldingSetNodeID ID; 837 AddNodeIDNode(ID, Opc, getVTList(VT), 0, 0); 838 ID.AddInteger(JTI); 839 void *IP = 0; 840 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP)) 841 return SDOperand(E, 0); 842 SDNode *N = new JumpTableSDNode(JTI, VT, isTarget); 843 CSEMap.InsertNode(N, IP); 844 AllNodes.push_back(N); 845 return SDOperand(N, 0); 846} 847 848SDOperand SelectionDAG::getConstantPool(Constant *C, MVT::ValueType VT, 849 unsigned Alignment, int Offset, 850 bool isTarget) { 851 unsigned Opc = isTarget ? ISD::TargetConstantPool : ISD::ConstantPool; 852 FoldingSetNodeID ID; 853 AddNodeIDNode(ID, Opc, getVTList(VT), 0, 0); 854 ID.AddInteger(Alignment); 855 ID.AddInteger(Offset); 856 ID.AddPointer(C); 857 void *IP = 0; 858 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP)) 859 return SDOperand(E, 0); 860 SDNode *N = new ConstantPoolSDNode(isTarget, C, VT, Offset, Alignment); 861 CSEMap.InsertNode(N, IP); 862 AllNodes.push_back(N); 863 return SDOperand(N, 0); 864} 865 866 867SDOperand SelectionDAG::getConstantPool(MachineConstantPoolValue *C, 868 MVT::ValueType VT, 869 unsigned Alignment, int Offset, 870 bool isTarget) { 871 unsigned Opc = isTarget ? ISD::TargetConstantPool : ISD::ConstantPool; 872 FoldingSetNodeID ID; 873 AddNodeIDNode(ID, Opc, getVTList(VT), 0, 0); 874 ID.AddInteger(Alignment); 875 ID.AddInteger(Offset); 876 C->AddSelectionDAGCSEId(ID); 877 void *IP = 0; 878 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP)) 879 return SDOperand(E, 0); 880 SDNode *N = new ConstantPoolSDNode(isTarget, C, VT, Offset, Alignment); 881 CSEMap.InsertNode(N, IP); 882 AllNodes.push_back(N); 883 return SDOperand(N, 0); 884} 885 886 887SDOperand SelectionDAG::getBasicBlock(MachineBasicBlock *MBB) { 888 FoldingSetNodeID ID; 889 AddNodeIDNode(ID, ISD::BasicBlock, getVTList(MVT::Other), 0, 0); 890 ID.AddPointer(MBB); 891 void *IP = 0; 892 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP)) 893 return SDOperand(E, 0); 894 SDNode *N = new BasicBlockSDNode(MBB); 895 CSEMap.InsertNode(N, IP); 896 AllNodes.push_back(N); 897 return SDOperand(N, 0); 898} 899 900SDOperand SelectionDAG::getValueType(MVT::ValueType VT) { 901 if (!MVT::isExtendedVT(VT) && (unsigned)VT >= ValueTypeNodes.size()) 902 ValueTypeNodes.resize(VT+1); 903 904 SDNode *&N = MVT::isExtendedVT(VT) ? 905 ExtendedValueTypeNodes[VT] : ValueTypeNodes[VT]; 906 907 if (N) return SDOperand(N, 0); 908 N = new VTSDNode(VT); 909 AllNodes.push_back(N); 910 return SDOperand(N, 0); 911} 912 913SDOperand SelectionDAG::getExternalSymbol(const char *Sym, MVT::ValueType VT) { 914 SDNode *&N = ExternalSymbols[Sym]; 915 if (N) return SDOperand(N, 0); 916 N = new ExternalSymbolSDNode(false, Sym, VT); 917 AllNodes.push_back(N); 918 return SDOperand(N, 0); 919} 920 921SDOperand SelectionDAG::getTargetExternalSymbol(const char *Sym, 922 MVT::ValueType VT) { 923 SDNode *&N = TargetExternalSymbols[Sym]; 924 if (N) return SDOperand(N, 0); 925 N = new ExternalSymbolSDNode(true, Sym, VT); 926 AllNodes.push_back(N); 927 return SDOperand(N, 0); 928} 929 930SDOperand SelectionDAG::getCondCode(ISD::CondCode Cond) { 931 if ((unsigned)Cond >= CondCodeNodes.size()) 932 CondCodeNodes.resize(Cond+1); 933 934 if (CondCodeNodes[Cond] == 0) { 935 CondCodeNodes[Cond] = new CondCodeSDNode(Cond); 936 AllNodes.push_back(CondCodeNodes[Cond]); 937 } 938 return SDOperand(CondCodeNodes[Cond], 0); 939} 940 941SDOperand SelectionDAG::getRegister(unsigned RegNo, MVT::ValueType VT) { 942 FoldingSetNodeID ID; 943 AddNodeIDNode(ID, ISD::Register, getVTList(VT), 0, 0); 944 ID.AddInteger(RegNo); 945 void *IP = 0; 946 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP)) 947 return SDOperand(E, 0); 948 SDNode *N = new RegisterSDNode(RegNo, VT); 949 CSEMap.InsertNode(N, IP); 950 AllNodes.push_back(N); 951 return SDOperand(N, 0); 952} 953 954SDOperand SelectionDAG::getSrcValue(const Value *V) { 955 assert((!V || isa<PointerType>(V->getType())) && 956 "SrcValue is not a pointer?"); 957 958 FoldingSetNodeID ID; 959 AddNodeIDNode(ID, ISD::SRCVALUE, getVTList(MVT::Other), 0, 0); 960 ID.AddPointer(V); 961 962 void *IP = 0; 963 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP)) 964 return SDOperand(E, 0); 965 966 SDNode *N = new SrcValueSDNode(V); 967 CSEMap.InsertNode(N, IP); 968 AllNodes.push_back(N); 969 return SDOperand(N, 0); 970} 971 972SDOperand SelectionDAG::getMemOperand(const MemOperand &MO) { 973 const Value *v = MO.getValue(); 974 assert((!v || isa<PointerType>(v->getType())) && 975 "SrcValue is not a pointer?"); 976 977 FoldingSetNodeID ID; 978 AddNodeIDNode(ID, ISD::MEMOPERAND, getVTList(MVT::Other), 0, 0); 979 ID.AddPointer(v); 980 ID.AddInteger(MO.getFlags()); 981 ID.AddInteger(MO.getOffset()); 982 ID.AddInteger(MO.getSize()); 983 ID.AddInteger(MO.getAlignment()); 984 985 void *IP = 0; 986 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP)) 987 return SDOperand(E, 0); 988 989 SDNode *N = new MemOperandSDNode(MO); 990 CSEMap.InsertNode(N, IP); 991 AllNodes.push_back(N); 992 return SDOperand(N, 0); 993} 994 995/// CreateStackTemporary - Create a stack temporary, suitable for holding the 996/// specified value type. 997SDOperand SelectionDAG::CreateStackTemporary(MVT::ValueType VT) { 998 MachineFrameInfo *FrameInfo = getMachineFunction().getFrameInfo(); 999 unsigned ByteSize = MVT::getSizeInBits(VT)/8; 1000 const Type *Ty = MVT::getTypeForValueType(VT); 1001 unsigned StackAlign = (unsigned)TLI.getTargetData()->getPrefTypeAlignment(Ty); 1002 int FrameIdx = FrameInfo->CreateStackObject(ByteSize, StackAlign); 1003 return getFrameIndex(FrameIdx, TLI.getPointerTy()); 1004} 1005 1006 1007SDOperand SelectionDAG::FoldSetCC(MVT::ValueType VT, SDOperand N1, 1008 SDOperand N2, ISD::CondCode Cond) { 1009 // These setcc operations always fold. 1010 switch (Cond) { 1011 default: break; 1012 case ISD::SETFALSE: 1013 case ISD::SETFALSE2: return getConstant(0, VT); 1014 case ISD::SETTRUE: 1015 case ISD::SETTRUE2: return getConstant(1, VT); 1016 1017 case ISD::SETOEQ: 1018 case ISD::SETOGT: 1019 case ISD::SETOGE: 1020 case ISD::SETOLT: 1021 case ISD::SETOLE: 1022 case ISD::SETONE: 1023 case ISD::SETO: 1024 case ISD::SETUO: 1025 case ISD::SETUEQ: 1026 case ISD::SETUNE: 1027 assert(!MVT::isInteger(N1.getValueType()) && "Illegal setcc for integer!"); 1028 break; 1029 } 1030 1031 if (ConstantSDNode *N2C = dyn_cast<ConstantSDNode>(N2.Val)) { 1032 uint64_t C2 = N2C->getValue(); 1033 if (ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1.Val)) { 1034 uint64_t C1 = N1C->getValue(); 1035 1036 // Sign extend the operands if required 1037 if (ISD::isSignedIntSetCC(Cond)) { 1038 C1 = N1C->getSignExtended(); 1039 C2 = N2C->getSignExtended(); 1040 } 1041 1042 switch (Cond) { 1043 default: assert(0 && "Unknown integer setcc!"); 1044 case ISD::SETEQ: return getConstant(C1 == C2, VT); 1045 case ISD::SETNE: return getConstant(C1 != C2, VT); 1046 case ISD::SETULT: return getConstant(C1 < C2, VT); 1047 case ISD::SETUGT: return getConstant(C1 > C2, VT); 1048 case ISD::SETULE: return getConstant(C1 <= C2, VT); 1049 case ISD::SETUGE: return getConstant(C1 >= C2, VT); 1050 case ISD::SETLT: return getConstant((int64_t)C1 < (int64_t)C2, VT); 1051 case ISD::SETGT: return getConstant((int64_t)C1 > (int64_t)C2, VT); 1052 case ISD::SETLE: return getConstant((int64_t)C1 <= (int64_t)C2, VT); 1053 case ISD::SETGE: return getConstant((int64_t)C1 >= (int64_t)C2, VT); 1054 } 1055 } 1056 } 1057 if (ConstantFPSDNode *N1C = dyn_cast<ConstantFPSDNode>(N1.Val)) 1058 if (ConstantFPSDNode *N2C = dyn_cast<ConstantFPSDNode>(N2.Val)) { 1059 // No compile time operations on this type yet. 1060 if (N1C->getValueType(0) == MVT::ppcf128) 1061 return SDOperand(); 1062 1063 APFloat::cmpResult R = N1C->getValueAPF().compare(N2C->getValueAPF()); 1064 switch (Cond) { 1065 default: break; 1066 case ISD::SETEQ: if (R==APFloat::cmpUnordered) 1067 return getNode(ISD::UNDEF, VT); 1068 // fall through 1069 case ISD::SETOEQ: return getConstant(R==APFloat::cmpEqual, VT); 1070 case ISD::SETNE: if (R==APFloat::cmpUnordered) 1071 return getNode(ISD::UNDEF, VT); 1072 // fall through 1073 case ISD::SETONE: return getConstant(R==APFloat::cmpGreaterThan || 1074 R==APFloat::cmpLessThan, VT); 1075 case ISD::SETLT: if (R==APFloat::cmpUnordered) 1076 return getNode(ISD::UNDEF, VT); 1077 // fall through 1078 case ISD::SETOLT: return getConstant(R==APFloat::cmpLessThan, VT); 1079 case ISD::SETGT: if (R==APFloat::cmpUnordered) 1080 return getNode(ISD::UNDEF, VT); 1081 // fall through 1082 case ISD::SETOGT: return getConstant(R==APFloat::cmpGreaterThan, VT); 1083 case ISD::SETLE: if (R==APFloat::cmpUnordered) 1084 return getNode(ISD::UNDEF, VT); 1085 // fall through 1086 case ISD::SETOLE: return getConstant(R==APFloat::cmpLessThan || 1087 R==APFloat::cmpEqual, VT); 1088 case ISD::SETGE: if (R==APFloat::cmpUnordered) 1089 return getNode(ISD::UNDEF, VT); 1090 // fall through 1091 case ISD::SETOGE: return getConstant(R==APFloat::cmpGreaterThan || 1092 R==APFloat::cmpEqual, VT); 1093 case ISD::SETO: return getConstant(R!=APFloat::cmpUnordered, VT); 1094 case ISD::SETUO: return getConstant(R==APFloat::cmpUnordered, VT); 1095 case ISD::SETUEQ: return getConstant(R==APFloat::cmpUnordered || 1096 R==APFloat::cmpEqual, VT); 1097 case ISD::SETUNE: return getConstant(R!=APFloat::cmpEqual, VT); 1098 case ISD::SETULT: return getConstant(R==APFloat::cmpUnordered || 1099 R==APFloat::cmpLessThan, VT); 1100 case ISD::SETUGT: return getConstant(R==APFloat::cmpGreaterThan || 1101 R==APFloat::cmpUnordered, VT); 1102 case ISD::SETULE: return getConstant(R!=APFloat::cmpGreaterThan, VT); 1103 case ISD::SETUGE: return getConstant(R!=APFloat::cmpLessThan, VT); 1104 } 1105 } else { 1106 // Ensure that the constant occurs on the RHS. 1107 return getSetCC(VT, N2, N1, ISD::getSetCCSwappedOperands(Cond)); 1108 } 1109 1110 // Could not fold it. 1111 return SDOperand(); 1112} 1113 1114/// MaskedValueIsZero - Return true if 'V & Mask' is known to be zero. We use 1115/// this predicate to simplify operations downstream. Mask is known to be zero 1116/// for bits that V cannot have. 1117bool SelectionDAG::MaskedValueIsZero(SDOperand Op, uint64_t Mask, 1118 unsigned Depth) const { 1119 // The masks are not wide enough to represent this type! Should use APInt. 1120 if (Op.getValueType() == MVT::i128) 1121 return false; 1122 1123 uint64_t KnownZero, KnownOne; 1124 ComputeMaskedBits(Op, Mask, KnownZero, KnownOne, Depth); 1125 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?"); 1126 return (KnownZero & Mask) == Mask; 1127} 1128 1129/// ComputeMaskedBits - Determine which of the bits specified in Mask are 1130/// known to be either zero or one and return them in the KnownZero/KnownOne 1131/// bitsets. This code only analyzes bits in Mask, in order to short-circuit 1132/// processing. 1133void SelectionDAG::ComputeMaskedBits(SDOperand Op, uint64_t Mask, 1134 uint64_t &KnownZero, uint64_t &KnownOne, 1135 unsigned Depth) const { 1136 KnownZero = KnownOne = 0; // Don't know anything. 1137 if (Depth == 6 || Mask == 0) 1138 return; // Limit search depth. 1139 1140 // The masks are not wide enough to represent this type! Should use APInt. 1141 if (Op.getValueType() == MVT::i128) 1142 return; 1143 1144 uint64_t KnownZero2, KnownOne2; 1145 1146 switch (Op.getOpcode()) { 1147 case ISD::Constant: 1148 // We know all of the bits for a constant! 1149 KnownOne = cast<ConstantSDNode>(Op)->getValue() & Mask; 1150 KnownZero = ~KnownOne & Mask; 1151 return; 1152 case ISD::AND: 1153 // If either the LHS or the RHS are Zero, the result is zero. 1154 ComputeMaskedBits(Op.getOperand(1), Mask, KnownZero, KnownOne, Depth+1); 1155 Mask &= ~KnownZero; 1156 ComputeMaskedBits(Op.getOperand(0), Mask, KnownZero2, KnownOne2, Depth+1); 1157 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?"); 1158 assert((KnownZero2 & KnownOne2) == 0 && "Bits known to be one AND zero?"); 1159 1160 // Output known-1 bits are only known if set in both the LHS & RHS. 1161 KnownOne &= KnownOne2; 1162 // Output known-0 are known to be clear if zero in either the LHS | RHS. 1163 KnownZero |= KnownZero2; 1164 return; 1165 case ISD::OR: 1166 ComputeMaskedBits(Op.getOperand(1), Mask, KnownZero, KnownOne, Depth+1); 1167 Mask &= ~KnownOne; 1168 ComputeMaskedBits(Op.getOperand(0), Mask, KnownZero2, KnownOne2, Depth+1); 1169 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?"); 1170 assert((KnownZero2 & KnownOne2) == 0 && "Bits known to be one AND zero?"); 1171 1172 // Output known-0 bits are only known if clear in both the LHS & RHS. 1173 KnownZero &= KnownZero2; 1174 // Output known-1 are known to be set if set in either the LHS | RHS. 1175 KnownOne |= KnownOne2; 1176 return; 1177 case ISD::XOR: { 1178 ComputeMaskedBits(Op.getOperand(1), Mask, KnownZero, KnownOne, Depth+1); 1179 ComputeMaskedBits(Op.getOperand(0), Mask, KnownZero2, KnownOne2, Depth+1); 1180 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?"); 1181 assert((KnownZero2 & KnownOne2) == 0 && "Bits known to be one AND zero?"); 1182 1183 // Output known-0 bits are known if clear or set in both the LHS & RHS. 1184 uint64_t KnownZeroOut = (KnownZero & KnownZero2) | (KnownOne & KnownOne2); 1185 // Output known-1 are known to be set if set in only one of the LHS, RHS. 1186 KnownOne = (KnownZero & KnownOne2) | (KnownOne & KnownZero2); 1187 KnownZero = KnownZeroOut; 1188 return; 1189 } 1190 case ISD::SELECT: 1191 ComputeMaskedBits(Op.getOperand(2), Mask, KnownZero, KnownOne, Depth+1); 1192 ComputeMaskedBits(Op.getOperand(1), Mask, KnownZero2, KnownOne2, Depth+1); 1193 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?"); 1194 assert((KnownZero2 & KnownOne2) == 0 && "Bits known to be one AND zero?"); 1195 1196 // Only known if known in both the LHS and RHS. 1197 KnownOne &= KnownOne2; 1198 KnownZero &= KnownZero2; 1199 return; 1200 case ISD::SELECT_CC: 1201 ComputeMaskedBits(Op.getOperand(3), Mask, KnownZero, KnownOne, Depth+1); 1202 ComputeMaskedBits(Op.getOperand(2), Mask, KnownZero2, KnownOne2, Depth+1); 1203 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?"); 1204 assert((KnownZero2 & KnownOne2) == 0 && "Bits known to be one AND zero?"); 1205 1206 // Only known if known in both the LHS and RHS. 1207 KnownOne &= KnownOne2; 1208 KnownZero &= KnownZero2; 1209 return; 1210 case ISD::SETCC: 1211 // If we know the result of a setcc has the top bits zero, use this info. 1212 if (TLI.getSetCCResultContents() == TargetLowering::ZeroOrOneSetCCResult) 1213 KnownZero |= (MVT::getIntVTBitMask(Op.getValueType()) ^ 1ULL); 1214 return; 1215 case ISD::SHL: 1216 // (shl X, C1) & C2 == 0 iff (X & C2 >>u C1) == 0 1217 if (ConstantSDNode *SA = dyn_cast<ConstantSDNode>(Op.getOperand(1))) { 1218 ComputeMaskedBits(Op.getOperand(0), Mask >> SA->getValue(), 1219 KnownZero, KnownOne, Depth+1); 1220 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?"); 1221 KnownZero <<= SA->getValue(); 1222 KnownOne <<= SA->getValue(); 1223 KnownZero |= (1ULL << SA->getValue())-1; // low bits known zero. 1224 } 1225 return; 1226 case ISD::SRL: 1227 // (ushr X, C1) & C2 == 0 iff (-1 >> C1) & C2 == 0 1228 if (ConstantSDNode *SA = dyn_cast<ConstantSDNode>(Op.getOperand(1))) { 1229 MVT::ValueType VT = Op.getValueType(); 1230 unsigned ShAmt = SA->getValue(); 1231 1232 uint64_t TypeMask = MVT::getIntVTBitMask(VT); 1233 ComputeMaskedBits(Op.getOperand(0), (Mask << ShAmt) & TypeMask, 1234 KnownZero, KnownOne, Depth+1); 1235 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?"); 1236 KnownZero &= TypeMask; 1237 KnownOne &= TypeMask; 1238 KnownZero >>= ShAmt; 1239 KnownOne >>= ShAmt; 1240 1241 uint64_t HighBits = (1ULL << ShAmt)-1; 1242 HighBits <<= MVT::getSizeInBits(VT)-ShAmt; 1243 KnownZero |= HighBits; // High bits known zero. 1244 } 1245 return; 1246 case ISD::SRA: 1247 if (ConstantSDNode *SA = dyn_cast<ConstantSDNode>(Op.getOperand(1))) { 1248 MVT::ValueType VT = Op.getValueType(); 1249 unsigned ShAmt = SA->getValue(); 1250 1251 // Compute the new bits that are at the top now. 1252 uint64_t TypeMask = MVT::getIntVTBitMask(VT); 1253 1254 uint64_t InDemandedMask = (Mask << ShAmt) & TypeMask; 1255 // If any of the demanded bits are produced by the sign extension, we also 1256 // demand the input sign bit. 1257 uint64_t HighBits = (1ULL << ShAmt)-1; 1258 HighBits <<= MVT::getSizeInBits(VT) - ShAmt; 1259 if (HighBits & Mask) 1260 InDemandedMask |= MVT::getIntVTSignBit(VT); 1261 1262 ComputeMaskedBits(Op.getOperand(0), InDemandedMask, KnownZero, KnownOne, 1263 Depth+1); 1264 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?"); 1265 KnownZero &= TypeMask; 1266 KnownOne &= TypeMask; 1267 KnownZero >>= ShAmt; 1268 KnownOne >>= ShAmt; 1269 1270 // Handle the sign bits. 1271 uint64_t SignBit = MVT::getIntVTSignBit(VT); 1272 SignBit >>= ShAmt; // Adjust to where it is now in the mask. 1273 1274 if (KnownZero & SignBit) { 1275 KnownZero |= HighBits; // New bits are known zero. 1276 } else if (KnownOne & SignBit) { 1277 KnownOne |= HighBits; // New bits are known one. 1278 } 1279 } 1280 return; 1281 case ISD::SIGN_EXTEND_INREG: { 1282 MVT::ValueType EVT = cast<VTSDNode>(Op.getOperand(1))->getVT(); 1283 1284 // Sign extension. Compute the demanded bits in the result that are not 1285 // present in the input. 1286 uint64_t NewBits = ~MVT::getIntVTBitMask(EVT) & Mask; 1287 1288 uint64_t InSignBit = MVT::getIntVTSignBit(EVT); 1289 int64_t InputDemandedBits = Mask & MVT::getIntVTBitMask(EVT); 1290 1291 // If the sign extended bits are demanded, we know that the sign 1292 // bit is demanded. 1293 if (NewBits) 1294 InputDemandedBits |= InSignBit; 1295 1296 ComputeMaskedBits(Op.getOperand(0), InputDemandedBits, 1297 KnownZero, KnownOne, Depth+1); 1298 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?"); 1299 1300 // If the sign bit of the input is known set or clear, then we know the 1301 // top bits of the result. 1302 if (KnownZero & InSignBit) { // Input sign bit known clear 1303 KnownZero |= NewBits; 1304 KnownOne &= ~NewBits; 1305 } else if (KnownOne & InSignBit) { // Input sign bit known set 1306 KnownOne |= NewBits; 1307 KnownZero &= ~NewBits; 1308 } else { // Input sign bit unknown 1309 KnownZero &= ~NewBits; 1310 KnownOne &= ~NewBits; 1311 } 1312 return; 1313 } 1314 case ISD::CTTZ: 1315 case ISD::CTLZ: 1316 case ISD::CTPOP: { 1317 MVT::ValueType VT = Op.getValueType(); 1318 unsigned LowBits = Log2_32(MVT::getSizeInBits(VT))+1; 1319 KnownZero = ~((1ULL << LowBits)-1) & MVT::getIntVTBitMask(VT); 1320 KnownOne = 0; 1321 return; 1322 } 1323 case ISD::LOAD: { 1324 if (ISD::isZEXTLoad(Op.Val)) { 1325 LoadSDNode *LD = cast<LoadSDNode>(Op); 1326 MVT::ValueType VT = LD->getMemoryVT(); 1327 KnownZero |= ~MVT::getIntVTBitMask(VT) & Mask; 1328 } 1329 return; 1330 } 1331 case ISD::ZERO_EXTEND: { 1332 uint64_t InMask = MVT::getIntVTBitMask(Op.getOperand(0).getValueType()); 1333 uint64_t NewBits = (~InMask) & Mask; 1334 ComputeMaskedBits(Op.getOperand(0), Mask & InMask, KnownZero, 1335 KnownOne, Depth+1); 1336 KnownZero |= NewBits & Mask; 1337 KnownOne &= ~NewBits; 1338 return; 1339 } 1340 case ISD::SIGN_EXTEND: { 1341 MVT::ValueType InVT = Op.getOperand(0).getValueType(); 1342 unsigned InBits = MVT::getSizeInBits(InVT); 1343 uint64_t InMask = MVT::getIntVTBitMask(InVT); 1344 uint64_t InSignBit = 1ULL << (InBits-1); 1345 uint64_t NewBits = (~InMask) & Mask; 1346 uint64_t InDemandedBits = Mask & InMask; 1347 1348 // If any of the sign extended bits are demanded, we know that the sign 1349 // bit is demanded. 1350 if (NewBits & Mask) 1351 InDemandedBits |= InSignBit; 1352 1353 ComputeMaskedBits(Op.getOperand(0), InDemandedBits, KnownZero, 1354 KnownOne, Depth+1); 1355 // If the sign bit is known zero or one, the top bits match. 1356 if (KnownZero & InSignBit) { 1357 KnownZero |= NewBits; 1358 KnownOne &= ~NewBits; 1359 } else if (KnownOne & InSignBit) { 1360 KnownOne |= NewBits; 1361 KnownZero &= ~NewBits; 1362 } else { // Otherwise, top bits aren't known. 1363 KnownOne &= ~NewBits; 1364 KnownZero &= ~NewBits; 1365 } 1366 return; 1367 } 1368 case ISD::ANY_EXTEND: { 1369 MVT::ValueType VT = Op.getOperand(0).getValueType(); 1370 ComputeMaskedBits(Op.getOperand(0), Mask & MVT::getIntVTBitMask(VT), 1371 KnownZero, KnownOne, Depth+1); 1372 return; 1373 } 1374 case ISD::TRUNCATE: { 1375 ComputeMaskedBits(Op.getOperand(0), Mask, KnownZero, KnownOne, Depth+1); 1376 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?"); 1377 uint64_t OutMask = MVT::getIntVTBitMask(Op.getValueType()); 1378 KnownZero &= OutMask; 1379 KnownOne &= OutMask; 1380 break; 1381 } 1382 case ISD::AssertZext: { 1383 MVT::ValueType VT = cast<VTSDNode>(Op.getOperand(1))->getVT(); 1384 uint64_t InMask = MVT::getIntVTBitMask(VT); 1385 ComputeMaskedBits(Op.getOperand(0), Mask & InMask, KnownZero, 1386 KnownOne, Depth+1); 1387 KnownZero |= (~InMask) & Mask; 1388 return; 1389 } 1390 case ISD::FGETSIGN: 1391 // All bits are zero except the low bit. 1392 KnownZero = MVT::getIntVTBitMask(Op.getValueType()) ^ 1; 1393 return; 1394 1395 case ISD::ADD: { 1396 // If either the LHS or the RHS are Zero, the result is zero. 1397 ComputeMaskedBits(Op.getOperand(1), Mask, KnownZero, KnownOne, Depth+1); 1398 ComputeMaskedBits(Op.getOperand(0), Mask, KnownZero2, KnownOne2, Depth+1); 1399 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?"); 1400 assert((KnownZero2 & KnownOne2) == 0 && "Bits known to be one AND zero?"); 1401 1402 // Output known-0 bits are known if clear or set in both the low clear bits 1403 // common to both LHS & RHS. For example, 8+(X<<3) is known to have the 1404 // low 3 bits clear. 1405 uint64_t KnownZeroOut = std::min(CountTrailingZeros_64(~KnownZero), 1406 CountTrailingZeros_64(~KnownZero2)); 1407 1408 KnownZero = (1ULL << KnownZeroOut) - 1; 1409 KnownOne = 0; 1410 return; 1411 } 1412 case ISD::SUB: { 1413 ConstantSDNode *CLHS = dyn_cast<ConstantSDNode>(Op.getOperand(0)); 1414 if (!CLHS) return; 1415 1416 // We know that the top bits of C-X are clear if X contains less bits 1417 // than C (i.e. no wrap-around can happen). For example, 20-X is 1418 // positive if we can prove that X is >= 0 and < 16. 1419 MVT::ValueType VT = CLHS->getValueType(0); 1420 if ((CLHS->getValue() & MVT::getIntVTSignBit(VT)) == 0) { // sign bit clear 1421 unsigned NLZ = CountLeadingZeros_64(CLHS->getValue()+1); 1422 uint64_t MaskV = (1ULL << (63-NLZ))-1; // NLZ can't be 64 with no sign bit 1423 MaskV = ~MaskV & MVT::getIntVTBitMask(VT); 1424 ComputeMaskedBits(Op.getOperand(1), MaskV, KnownZero, KnownOne, Depth+1); 1425 1426 // If all of the MaskV bits are known to be zero, then we know the output 1427 // top bits are zero, because we now know that the output is from [0-C]. 1428 if ((KnownZero & MaskV) == MaskV) { 1429 unsigned NLZ2 = CountLeadingZeros_64(CLHS->getValue()); 1430 KnownZero = ~((1ULL << (64-NLZ2))-1) & Mask; // Top bits known zero. 1431 KnownOne = 0; // No one bits known. 1432 } else { 1433 KnownZero = KnownOne = 0; // Otherwise, nothing known. 1434 } 1435 } 1436 return; 1437 } 1438 default: 1439 // Allow the target to implement this method for its nodes. 1440 if (Op.getOpcode() >= ISD::BUILTIN_OP_END) { 1441 case ISD::INTRINSIC_WO_CHAIN: 1442 case ISD::INTRINSIC_W_CHAIN: 1443 case ISD::INTRINSIC_VOID: 1444 TLI.computeMaskedBitsForTargetNode(Op, Mask, KnownZero, KnownOne, *this); 1445 } 1446 return; 1447 } 1448} 1449 1450/// ComputeNumSignBits - Return the number of times the sign bit of the 1451/// register is replicated into the other bits. We know that at least 1 bit 1452/// is always equal to the sign bit (itself), but other cases can give us 1453/// information. For example, immediately after an "SRA X, 2", we know that 1454/// the top 3 bits are all equal to each other, so we return 3. 1455unsigned SelectionDAG::ComputeNumSignBits(SDOperand Op, unsigned Depth) const{ 1456 MVT::ValueType VT = Op.getValueType(); 1457 assert(MVT::isInteger(VT) && "Invalid VT!"); 1458 unsigned VTBits = MVT::getSizeInBits(VT); 1459 unsigned Tmp, Tmp2; 1460 1461 if (Depth == 6) 1462 return 1; // Limit search depth. 1463 1464 switch (Op.getOpcode()) { 1465 default: break; 1466 case ISD::AssertSext: 1467 Tmp = MVT::getSizeInBits(cast<VTSDNode>(Op.getOperand(1))->getVT()); 1468 return VTBits-Tmp+1; 1469 case ISD::AssertZext: 1470 Tmp = MVT::getSizeInBits(cast<VTSDNode>(Op.getOperand(1))->getVT()); 1471 return VTBits-Tmp; 1472 1473 case ISD::Constant: { 1474 uint64_t Val = cast<ConstantSDNode>(Op)->getValue(); 1475 // If negative, invert the bits, then look at it. 1476 if (Val & MVT::getIntVTSignBit(VT)) 1477 Val = ~Val; 1478 1479 // Shift the bits so they are the leading bits in the int64_t. 1480 Val <<= 64-VTBits; 1481 1482 // Return # leading zeros. We use 'min' here in case Val was zero before 1483 // shifting. We don't want to return '64' as for an i32 "0". 1484 return std::min(VTBits, CountLeadingZeros_64(Val)); 1485 } 1486 1487 case ISD::SIGN_EXTEND: 1488 Tmp = VTBits-MVT::getSizeInBits(Op.getOperand(0).getValueType()); 1489 return ComputeNumSignBits(Op.getOperand(0), Depth+1) + Tmp; 1490 1491 case ISD::SIGN_EXTEND_INREG: 1492 // Max of the input and what this extends. 1493 Tmp = MVT::getSizeInBits(cast<VTSDNode>(Op.getOperand(1))->getVT()); 1494 Tmp = VTBits-Tmp+1; 1495 1496 Tmp2 = ComputeNumSignBits(Op.getOperand(0), Depth+1); 1497 return std::max(Tmp, Tmp2); 1498 1499 case ISD::SRA: 1500 Tmp = ComputeNumSignBits(Op.getOperand(0), Depth+1); 1501 // SRA X, C -> adds C sign bits. 1502 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op.getOperand(1))) { 1503 Tmp += C->getValue(); 1504 if (Tmp > VTBits) Tmp = VTBits; 1505 } 1506 return Tmp; 1507 case ISD::SHL: 1508 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op.getOperand(1))) { 1509 // shl destroys sign bits. 1510 Tmp = ComputeNumSignBits(Op.getOperand(0), Depth+1); 1511 if (C->getValue() >= VTBits || // Bad shift. 1512 C->getValue() >= Tmp) break; // Shifted all sign bits out. 1513 return Tmp - C->getValue(); 1514 } 1515 break; 1516 case ISD::AND: 1517 case ISD::OR: 1518 case ISD::XOR: // NOT is handled here. 1519 // Logical binary ops preserve the number of sign bits. 1520 Tmp = ComputeNumSignBits(Op.getOperand(0), Depth+1); 1521 if (Tmp == 1) return 1; // Early out. 1522 Tmp2 = ComputeNumSignBits(Op.getOperand(1), Depth+1); 1523 return std::min(Tmp, Tmp2); 1524 1525 case ISD::SELECT: 1526 Tmp = ComputeNumSignBits(Op.getOperand(0), Depth+1); 1527 if (Tmp == 1) return 1; // Early out. 1528 Tmp2 = ComputeNumSignBits(Op.getOperand(1), Depth+1); 1529 return std::min(Tmp, Tmp2); 1530 1531 case ISD::SETCC: 1532 // If setcc returns 0/-1, all bits are sign bits. 1533 if (TLI.getSetCCResultContents() == 1534 TargetLowering::ZeroOrNegativeOneSetCCResult) 1535 return VTBits; 1536 break; 1537 case ISD::ROTL: 1538 case ISD::ROTR: 1539 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op.getOperand(1))) { 1540 unsigned RotAmt = C->getValue() & (VTBits-1); 1541 1542 // Handle rotate right by N like a rotate left by 32-N. 1543 if (Op.getOpcode() == ISD::ROTR) 1544 RotAmt = (VTBits-RotAmt) & (VTBits-1); 1545 1546 // If we aren't rotating out all of the known-in sign bits, return the 1547 // number that are left. This handles rotl(sext(x), 1) for example. 1548 Tmp = ComputeNumSignBits(Op.getOperand(0), Depth+1); 1549 if (Tmp > RotAmt+1) return Tmp-RotAmt; 1550 } 1551 break; 1552 case ISD::ADD: 1553 // Add can have at most one carry bit. Thus we know that the output 1554 // is, at worst, one more bit than the inputs. 1555 Tmp = ComputeNumSignBits(Op.getOperand(0), Depth+1); 1556 if (Tmp == 1) return 1; // Early out. 1557 1558 // Special case decrementing a value (ADD X, -1): 1559 if (ConstantSDNode *CRHS = dyn_cast<ConstantSDNode>(Op.getOperand(0))) 1560 if (CRHS->isAllOnesValue()) { 1561 uint64_t KnownZero, KnownOne; 1562 uint64_t Mask = MVT::getIntVTBitMask(VT); 1563 ComputeMaskedBits(Op.getOperand(0), Mask, KnownZero, KnownOne, Depth+1); 1564 1565 // If the input is known to be 0 or 1, the output is 0/-1, which is all 1566 // sign bits set. 1567 if ((KnownZero|1) == Mask) 1568 return VTBits; 1569 1570 // If we are subtracting one from a positive number, there is no carry 1571 // out of the result. 1572 if (KnownZero & MVT::getIntVTSignBit(VT)) 1573 return Tmp; 1574 } 1575 1576 Tmp2 = ComputeNumSignBits(Op.getOperand(1), Depth+1); 1577 if (Tmp2 == 1) return 1; 1578 return std::min(Tmp, Tmp2)-1; 1579 break; 1580 1581 case ISD::SUB: 1582 Tmp2 = ComputeNumSignBits(Op.getOperand(1), Depth+1); 1583 if (Tmp2 == 1) return 1; 1584 1585 // Handle NEG. 1586 if (ConstantSDNode *CLHS = dyn_cast<ConstantSDNode>(Op.getOperand(0))) 1587 if (CLHS->getValue() == 0) { 1588 uint64_t KnownZero, KnownOne; 1589 uint64_t Mask = MVT::getIntVTBitMask(VT); 1590 ComputeMaskedBits(Op.getOperand(1), Mask, KnownZero, KnownOne, Depth+1); 1591 // If the input is known to be 0 or 1, the output is 0/-1, which is all 1592 // sign bits set. 1593 if ((KnownZero|1) == Mask) 1594 return VTBits; 1595 1596 // If the input is known to be positive (the sign bit is known clear), 1597 // the output of the NEG has the same number of sign bits as the input. 1598 if (KnownZero & MVT::getIntVTSignBit(VT)) 1599 return Tmp2; 1600 1601 // Otherwise, we treat this like a SUB. 1602 } 1603 1604 // Sub can have at most one carry bit. Thus we know that the output 1605 // is, at worst, one more bit than the inputs. 1606 Tmp = ComputeNumSignBits(Op.getOperand(0), Depth+1); 1607 if (Tmp == 1) return 1; // Early out. 1608 return std::min(Tmp, Tmp2)-1; 1609 break; 1610 case ISD::TRUNCATE: 1611 // FIXME: it's tricky to do anything useful for this, but it is an important 1612 // case for targets like X86. 1613 break; 1614 } 1615 1616 // Handle LOADX separately here. EXTLOAD case will fallthrough. 1617 if (Op.getOpcode() == ISD::LOAD) { 1618 LoadSDNode *LD = cast<LoadSDNode>(Op); 1619 unsigned ExtType = LD->getExtensionType(); 1620 switch (ExtType) { 1621 default: break; 1622 case ISD::SEXTLOAD: // '17' bits known 1623 Tmp = MVT::getSizeInBits(LD->getMemoryVT()); 1624 return VTBits-Tmp+1; 1625 case ISD::ZEXTLOAD: // '16' bits known 1626 Tmp = MVT::getSizeInBits(LD->getMemoryVT()); 1627 return VTBits-Tmp; 1628 } 1629 } 1630 1631 // Allow the target to implement this method for its nodes. 1632 if (Op.getOpcode() >= ISD::BUILTIN_OP_END || 1633 Op.getOpcode() == ISD::INTRINSIC_WO_CHAIN || 1634 Op.getOpcode() == ISD::INTRINSIC_W_CHAIN || 1635 Op.getOpcode() == ISD::INTRINSIC_VOID) { 1636 unsigned NumBits = TLI.ComputeNumSignBitsForTargetNode(Op, Depth); 1637 if (NumBits > 1) return NumBits; 1638 } 1639 1640 // Finally, if we can prove that the top bits of the result are 0's or 1's, 1641 // use this information. 1642 uint64_t KnownZero, KnownOne; 1643 uint64_t Mask = MVT::getIntVTBitMask(VT); 1644 ComputeMaskedBits(Op, Mask, KnownZero, KnownOne, Depth); 1645 1646 uint64_t SignBit = MVT::getIntVTSignBit(VT); 1647 if (KnownZero & SignBit) { // SignBit is 0 1648 Mask = KnownZero; 1649 } else if (KnownOne & SignBit) { // SignBit is 1; 1650 Mask = KnownOne; 1651 } else { 1652 // Nothing known. 1653 return 1; 1654 } 1655 1656 // Okay, we know that the sign bit in Mask is set. Use CLZ to determine 1657 // the number of identical bits in the top of the input value. 1658 Mask ^= ~0ULL; 1659 Mask <<= 64-VTBits; 1660 // Return # leading zeros. We use 'min' here in case Val was zero before 1661 // shifting. We don't want to return '64' as for an i32 "0". 1662 return std::min(VTBits, CountLeadingZeros_64(Mask)); 1663} 1664 1665 1666bool SelectionDAG::isVerifiedDebugInfoDesc(SDOperand Op) const { 1667 GlobalAddressSDNode *GA = dyn_cast<GlobalAddressSDNode>(Op); 1668 if (!GA) return false; 1669 GlobalVariable *GV = dyn_cast<GlobalVariable>(GA->getGlobal()); 1670 if (!GV) return false; 1671 MachineModuleInfo *MMI = getMachineModuleInfo(); 1672 return MMI && MMI->hasDebugInfo() && MMI->isVerified(GV); 1673} 1674 1675 1676/// getNode - Gets or creates the specified node. 1677/// 1678SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT) { 1679 FoldingSetNodeID ID; 1680 AddNodeIDNode(ID, Opcode, getVTList(VT), 0, 0); 1681 void *IP = 0; 1682 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP)) 1683 return SDOperand(E, 0); 1684 SDNode *N = new SDNode(Opcode, SDNode::getSDVTList(VT)); 1685 CSEMap.InsertNode(N, IP); 1686 1687 AllNodes.push_back(N); 1688 return SDOperand(N, 0); 1689} 1690 1691SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT, 1692 SDOperand Operand) { 1693 unsigned Tmp1; 1694 // Constant fold unary operations with an integer constant operand. 1695 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Operand.Val)) { 1696 uint64_t Val = C->getValue(); 1697 switch (Opcode) { 1698 default: break; 1699 case ISD::SIGN_EXTEND: return getConstant(C->getSignExtended(), VT); 1700 case ISD::ANY_EXTEND: 1701 case ISD::ZERO_EXTEND: return getConstant(Val, VT); 1702 case ISD::TRUNCATE: return getConstant(Val, VT); 1703 case ISD::UINT_TO_FP: 1704 case ISD::SINT_TO_FP: { 1705 const uint64_t zero[] = {0, 0}; 1706 // No compile time operations on this type. 1707 if (VT==MVT::ppcf128) 1708 break; 1709 APFloat apf = APFloat(APInt(MVT::getSizeInBits(VT), 2, zero)); 1710 (void)apf.convertFromZeroExtendedInteger(&Val, 1711 MVT::getSizeInBits(Operand.getValueType()), 1712 Opcode==ISD::SINT_TO_FP, 1713 APFloat::rmNearestTiesToEven); 1714 return getConstantFP(apf, VT); 1715 } 1716 case ISD::BIT_CONVERT: 1717 if (VT == MVT::f32 && C->getValueType(0) == MVT::i32) 1718 return getConstantFP(BitsToFloat(Val), VT); 1719 else if (VT == MVT::f64 && C->getValueType(0) == MVT::i64) 1720 return getConstantFP(BitsToDouble(Val), VT); 1721 break; 1722 case ISD::BSWAP: 1723 switch(VT) { 1724 default: assert(0 && "Invalid bswap!"); break; 1725 case MVT::i16: return getConstant(ByteSwap_16((unsigned short)Val), VT); 1726 case MVT::i32: return getConstant(ByteSwap_32((unsigned)Val), VT); 1727 case MVT::i64: return getConstant(ByteSwap_64(Val), VT); 1728 } 1729 break; 1730 case ISD::CTPOP: 1731 switch(VT) { 1732 default: assert(0 && "Invalid ctpop!"); break; 1733 case MVT::i1: return getConstant(Val != 0, VT); 1734 case MVT::i8: 1735 Tmp1 = (unsigned)Val & 0xFF; 1736 return getConstant(CountPopulation_32(Tmp1), VT); 1737 case MVT::i16: 1738 Tmp1 = (unsigned)Val & 0xFFFF; 1739 return getConstant(CountPopulation_32(Tmp1), VT); 1740 case MVT::i32: 1741 return getConstant(CountPopulation_32((unsigned)Val), VT); 1742 case MVT::i64: 1743 return getConstant(CountPopulation_64(Val), VT); 1744 } 1745 case ISD::CTLZ: 1746 switch(VT) { 1747 default: assert(0 && "Invalid ctlz!"); break; 1748 case MVT::i1: return getConstant(Val == 0, VT); 1749 case MVT::i8: 1750 Tmp1 = (unsigned)Val & 0xFF; 1751 return getConstant(CountLeadingZeros_32(Tmp1)-24, VT); 1752 case MVT::i16: 1753 Tmp1 = (unsigned)Val & 0xFFFF; 1754 return getConstant(CountLeadingZeros_32(Tmp1)-16, VT); 1755 case MVT::i32: 1756 return getConstant(CountLeadingZeros_32((unsigned)Val), VT); 1757 case MVT::i64: 1758 return getConstant(CountLeadingZeros_64(Val), VT); 1759 } 1760 case ISD::CTTZ: 1761 switch(VT) { 1762 default: assert(0 && "Invalid cttz!"); break; 1763 case MVT::i1: return getConstant(Val == 0, VT); 1764 case MVT::i8: 1765 Tmp1 = (unsigned)Val | 0x100; 1766 return getConstant(CountTrailingZeros_32(Tmp1), VT); 1767 case MVT::i16: 1768 Tmp1 = (unsigned)Val | 0x10000; 1769 return getConstant(CountTrailingZeros_32(Tmp1), VT); 1770 case MVT::i32: 1771 return getConstant(CountTrailingZeros_32((unsigned)Val), VT); 1772 case MVT::i64: 1773 return getConstant(CountTrailingZeros_64(Val), VT); 1774 } 1775 } 1776 } 1777 1778 // Constant fold unary operations with a floating point constant operand. 1779 if (ConstantFPSDNode *C = dyn_cast<ConstantFPSDNode>(Operand.Val)) { 1780 APFloat V = C->getValueAPF(); // make copy 1781 if (VT != MVT::ppcf128 && Operand.getValueType() != MVT::ppcf128) { 1782 switch (Opcode) { 1783 case ISD::FNEG: 1784 V.changeSign(); 1785 return getConstantFP(V, VT); 1786 case ISD::FABS: 1787 V.clearSign(); 1788 return getConstantFP(V, VT); 1789 case ISD::FP_ROUND: 1790 case ISD::FP_EXTEND: 1791 // This can return overflow, underflow, or inexact; we don't care. 1792 // FIXME need to be more flexible about rounding mode. 1793 (void) V.convert(VT==MVT::f32 ? APFloat::IEEEsingle : 1794 VT==MVT::f64 ? APFloat::IEEEdouble : 1795 VT==MVT::f80 ? APFloat::x87DoubleExtended : 1796 VT==MVT::f128 ? APFloat::IEEEquad : 1797 APFloat::Bogus, 1798 APFloat::rmNearestTiesToEven); 1799 return getConstantFP(V, VT); 1800 case ISD::FP_TO_SINT: 1801 case ISD::FP_TO_UINT: { 1802 integerPart x; 1803 assert(integerPartWidth >= 64); 1804 // FIXME need to be more flexible about rounding mode. 1805 APFloat::opStatus s = V.convertToInteger(&x, 64U, 1806 Opcode==ISD::FP_TO_SINT, 1807 APFloat::rmTowardZero); 1808 if (s==APFloat::opInvalidOp) // inexact is OK, in fact usual 1809 break; 1810 return getConstant(x, VT); 1811 } 1812 case ISD::BIT_CONVERT: 1813 if (VT == MVT::i32 && C->getValueType(0) == MVT::f32) 1814 return getConstant((uint32_t)V.convertToAPInt().getZExtValue(), VT); 1815 else if (VT == MVT::i64 && C->getValueType(0) == MVT::f64) 1816 return getConstant(V.convertToAPInt().getZExtValue(), VT); 1817 break; 1818 } 1819 } 1820 } 1821 1822 unsigned OpOpcode = Operand.Val->getOpcode(); 1823 switch (Opcode) { 1824 case ISD::TokenFactor: 1825 return Operand; // Factor of one node? No factor. 1826 case ISD::FP_ROUND: assert(0 && "Invalid method to make FP_ROUND node"); 1827 case ISD::FP_EXTEND: 1828 assert(MVT::isFloatingPoint(VT) && 1829 MVT::isFloatingPoint(Operand.getValueType()) && "Invalid FP cast!"); 1830 if (Operand.getValueType() == VT) return Operand; // noop conversion. 1831 break; 1832 case ISD::SIGN_EXTEND: 1833 assert(MVT::isInteger(VT) && MVT::isInteger(Operand.getValueType()) && 1834 "Invalid SIGN_EXTEND!"); 1835 if (Operand.getValueType() == VT) return Operand; // noop extension 1836 assert(MVT::getSizeInBits(Operand.getValueType()) < MVT::getSizeInBits(VT) 1837 && "Invalid sext node, dst < src!"); 1838 if (OpOpcode == ISD::SIGN_EXTEND || OpOpcode == ISD::ZERO_EXTEND) 1839 return getNode(OpOpcode, VT, Operand.Val->getOperand(0)); 1840 break; 1841 case ISD::ZERO_EXTEND: 1842 assert(MVT::isInteger(VT) && MVT::isInteger(Operand.getValueType()) && 1843 "Invalid ZERO_EXTEND!"); 1844 if (Operand.getValueType() == VT) return Operand; // noop extension 1845 assert(MVT::getSizeInBits(Operand.getValueType()) < MVT::getSizeInBits(VT) 1846 && "Invalid zext node, dst < src!"); 1847 if (OpOpcode == ISD::ZERO_EXTEND) // (zext (zext x)) -> (zext x) 1848 return getNode(ISD::ZERO_EXTEND, VT, Operand.Val->getOperand(0)); 1849 break; 1850 case ISD::ANY_EXTEND: 1851 assert(MVT::isInteger(VT) && MVT::isInteger(Operand.getValueType()) && 1852 "Invalid ANY_EXTEND!"); 1853 if (Operand.getValueType() == VT) return Operand; // noop extension 1854 assert(MVT::getSizeInBits(Operand.getValueType()) < MVT::getSizeInBits(VT) 1855 && "Invalid anyext node, dst < src!"); 1856 if (OpOpcode == ISD::ZERO_EXTEND || OpOpcode == ISD::SIGN_EXTEND) 1857 // (ext (zext x)) -> (zext x) and (ext (sext x)) -> (sext x) 1858 return getNode(OpOpcode, VT, Operand.Val->getOperand(0)); 1859 break; 1860 case ISD::TRUNCATE: 1861 assert(MVT::isInteger(VT) && MVT::isInteger(Operand.getValueType()) && 1862 "Invalid TRUNCATE!"); 1863 if (Operand.getValueType() == VT) return Operand; // noop truncate 1864 assert(MVT::getSizeInBits(Operand.getValueType()) > MVT::getSizeInBits(VT) 1865 && "Invalid truncate node, src < dst!"); 1866 if (OpOpcode == ISD::TRUNCATE) 1867 return getNode(ISD::TRUNCATE, VT, Operand.Val->getOperand(0)); 1868 else if (OpOpcode == ISD::ZERO_EXTEND || OpOpcode == ISD::SIGN_EXTEND || 1869 OpOpcode == ISD::ANY_EXTEND) { 1870 // If the source is smaller than the dest, we still need an extend. 1871 if (MVT::getSizeInBits(Operand.Val->getOperand(0).getValueType()) 1872 < MVT::getSizeInBits(VT)) 1873 return getNode(OpOpcode, VT, Operand.Val->getOperand(0)); 1874 else if (MVT::getSizeInBits(Operand.Val->getOperand(0).getValueType()) 1875 > MVT::getSizeInBits(VT)) 1876 return getNode(ISD::TRUNCATE, VT, Operand.Val->getOperand(0)); 1877 else 1878 return Operand.Val->getOperand(0); 1879 } 1880 break; 1881 case ISD::BIT_CONVERT: 1882 // Basic sanity checking. 1883 assert(MVT::getSizeInBits(VT) == MVT::getSizeInBits(Operand.getValueType()) 1884 && "Cannot BIT_CONVERT between types of different sizes!"); 1885 if (VT == Operand.getValueType()) return Operand; // noop conversion. 1886 if (OpOpcode == ISD::BIT_CONVERT) // bitconv(bitconv(x)) -> bitconv(x) 1887 return getNode(ISD::BIT_CONVERT, VT, Operand.getOperand(0)); 1888 if (OpOpcode == ISD::UNDEF) 1889 return getNode(ISD::UNDEF, VT); 1890 break; 1891 case ISD::SCALAR_TO_VECTOR: 1892 assert(MVT::isVector(VT) && !MVT::isVector(Operand.getValueType()) && 1893 MVT::getVectorElementType(VT) == Operand.getValueType() && 1894 "Illegal SCALAR_TO_VECTOR node!"); 1895 break; 1896 case ISD::FNEG: 1897 if (OpOpcode == ISD::FSUB) // -(X-Y) -> (Y-X) 1898 return getNode(ISD::FSUB, VT, Operand.Val->getOperand(1), 1899 Operand.Val->getOperand(0)); 1900 if (OpOpcode == ISD::FNEG) // --X -> X 1901 return Operand.Val->getOperand(0); 1902 break; 1903 case ISD::FABS: 1904 if (OpOpcode == ISD::FNEG) // abs(-X) -> abs(X) 1905 return getNode(ISD::FABS, VT, Operand.Val->getOperand(0)); 1906 break; 1907 } 1908 1909 SDNode *N; 1910 SDVTList VTs = getVTList(VT); 1911 if (VT != MVT::Flag) { // Don't CSE flag producing nodes 1912 FoldingSetNodeID ID; 1913 SDOperand Ops[1] = { Operand }; 1914 AddNodeIDNode(ID, Opcode, VTs, Ops, 1); 1915 void *IP = 0; 1916 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP)) 1917 return SDOperand(E, 0); 1918 N = new UnarySDNode(Opcode, VTs, Operand); 1919 CSEMap.InsertNode(N, IP); 1920 } else { 1921 N = new UnarySDNode(Opcode, VTs, Operand); 1922 } 1923 AllNodes.push_back(N); 1924 return SDOperand(N, 0); 1925} 1926 1927 1928 1929SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT, 1930 SDOperand N1, SDOperand N2) { 1931 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1.Val); 1932 ConstantSDNode *N2C = dyn_cast<ConstantSDNode>(N2.Val); 1933 switch (Opcode) { 1934 default: break; 1935 case ISD::TokenFactor: 1936 assert(VT == MVT::Other && N1.getValueType() == MVT::Other && 1937 N2.getValueType() == MVT::Other && "Invalid token factor!"); 1938 // Fold trivial token factors. 1939 if (N1.getOpcode() == ISD::EntryToken) return N2; 1940 if (N2.getOpcode() == ISD::EntryToken) return N1; 1941 break; 1942 case ISD::AND: 1943 assert(MVT::isInteger(VT) && N1.getValueType() == N2.getValueType() && 1944 N1.getValueType() == VT && "Binary operator types must match!"); 1945 // (X & 0) -> 0. This commonly occurs when legalizing i64 values, so it's 1946 // worth handling here. 1947 if (N2C && N2C->getValue() == 0) 1948 return N2; 1949 if (N2C && N2C->isAllOnesValue()) // X & -1 -> X 1950 return N1; 1951 break; 1952 case ISD::OR: 1953 case ISD::XOR: 1954 assert(MVT::isInteger(VT) && N1.getValueType() == N2.getValueType() && 1955 N1.getValueType() == VT && "Binary operator types must match!"); 1956 // (X ^| 0) -> X. This commonly occurs when legalizing i64 values, so it's 1957 // worth handling here. 1958 if (N2C && N2C->getValue() == 0) 1959 return N1; 1960 break; 1961 case ISD::UDIV: 1962 case ISD::UREM: 1963 case ISD::MULHU: 1964 case ISD::MULHS: 1965 assert(MVT::isInteger(VT) && "This operator does not apply to FP types!"); 1966 // fall through 1967 case ISD::ADD: 1968 case ISD::SUB: 1969 case ISD::MUL: 1970 case ISD::SDIV: 1971 case ISD::SREM: 1972 case ISD::FADD: 1973 case ISD::FSUB: 1974 case ISD::FMUL: 1975 case ISD::FDIV: 1976 case ISD::FREM: 1977 assert(N1.getValueType() == N2.getValueType() && 1978 N1.getValueType() == VT && "Binary operator types must match!"); 1979 break; 1980 case ISD::FCOPYSIGN: // N1 and result must match. N1/N2 need not match. 1981 assert(N1.getValueType() == VT && 1982 MVT::isFloatingPoint(N1.getValueType()) && 1983 MVT::isFloatingPoint(N2.getValueType()) && 1984 "Invalid FCOPYSIGN!"); 1985 break; 1986 case ISD::SHL: 1987 case ISD::SRA: 1988 case ISD::SRL: 1989 case ISD::ROTL: 1990 case ISD::ROTR: 1991 assert(VT == N1.getValueType() && 1992 "Shift operators return type must be the same as their first arg"); 1993 assert(MVT::isInteger(VT) && MVT::isInteger(N2.getValueType()) && 1994 VT != MVT::i1 && "Shifts only work on integers"); 1995 break; 1996 case ISD::FP_ROUND_INREG: { 1997 MVT::ValueType EVT = cast<VTSDNode>(N2)->getVT(); 1998 assert(VT == N1.getValueType() && "Not an inreg round!"); 1999 assert(MVT::isFloatingPoint(VT) && MVT::isFloatingPoint(EVT) && 2000 "Cannot FP_ROUND_INREG integer types"); 2001 assert(MVT::getSizeInBits(EVT) <= MVT::getSizeInBits(VT) && 2002 "Not rounding down!"); 2003 if (cast<VTSDNode>(N2)->getVT() == VT) return N1; // Not actually rounding. 2004 break; 2005 } 2006 case ISD::FP_ROUND: 2007 assert(MVT::isFloatingPoint(VT) && 2008 MVT::isFloatingPoint(N1.getValueType()) && 2009 MVT::getSizeInBits(VT) <= MVT::getSizeInBits(N1.getValueType()) && 2010 isa<ConstantSDNode>(N2) && "Invalid FP_ROUND!"); 2011 if (N1.getValueType() == VT) return N1; // noop conversion. 2012 break; 2013 case ISD::AssertSext: 2014 case ISD::AssertZext: { 2015 MVT::ValueType EVT = cast<VTSDNode>(N2)->getVT(); 2016 assert(VT == N1.getValueType() && "Not an inreg extend!"); 2017 assert(MVT::isInteger(VT) && MVT::isInteger(EVT) && 2018 "Cannot *_EXTEND_INREG FP types"); 2019 assert(MVT::getSizeInBits(EVT) <= MVT::getSizeInBits(VT) && 2020 "Not extending!"); 2021 if (VT == EVT) return N1; // noop assertion. 2022 break; 2023 } 2024 case ISD::SIGN_EXTEND_INREG: { 2025 MVT::ValueType EVT = cast<VTSDNode>(N2)->getVT(); 2026 assert(VT == N1.getValueType() && "Not an inreg extend!"); 2027 assert(MVT::isInteger(VT) && MVT::isInteger(EVT) && 2028 "Cannot *_EXTEND_INREG FP types"); 2029 assert(MVT::getSizeInBits(EVT) <= MVT::getSizeInBits(VT) && 2030 "Not extending!"); 2031 if (EVT == VT) return N1; // Not actually extending 2032 2033 if (N1C) { 2034 int64_t Val = N1C->getValue(); 2035 unsigned FromBits = MVT::getSizeInBits(cast<VTSDNode>(N2)->getVT()); 2036 Val <<= 64-FromBits; 2037 Val >>= 64-FromBits; 2038 return getConstant(Val, VT); 2039 } 2040 break; 2041 } 2042 case ISD::EXTRACT_VECTOR_ELT: 2043 assert(N2C && "Bad EXTRACT_VECTOR_ELT!"); 2044 2045 // EXTRACT_VECTOR_ELT of CONCAT_VECTORS is often formed while lowering is 2046 // expanding copies of large vectors from registers. 2047 if (N1.getOpcode() == ISD::CONCAT_VECTORS && 2048 N1.getNumOperands() > 0) { 2049 unsigned Factor = 2050 MVT::getVectorNumElements(N1.getOperand(0).getValueType()); 2051 return getNode(ISD::EXTRACT_VECTOR_ELT, VT, 2052 N1.getOperand(N2C->getValue() / Factor), 2053 getConstant(N2C->getValue() % Factor, N2.getValueType())); 2054 } 2055 2056 // EXTRACT_VECTOR_ELT of BUILD_VECTOR is often formed while lowering is 2057 // expanding large vector constants. 2058 if (N1.getOpcode() == ISD::BUILD_VECTOR) 2059 return N1.getOperand(N2C->getValue()); 2060 2061 // EXTRACT_VECTOR_ELT of INSERT_VECTOR_ELT is often formed when vector 2062 // operations are lowered to scalars. 2063 if (N1.getOpcode() == ISD::INSERT_VECTOR_ELT) 2064 if (ConstantSDNode *IEC = dyn_cast<ConstantSDNode>(N1.getOperand(2))) { 2065 if (IEC == N2C) 2066 return N1.getOperand(1); 2067 else 2068 return getNode(ISD::EXTRACT_VECTOR_ELT, VT, N1.getOperand(0), N2); 2069 } 2070 break; 2071 case ISD::EXTRACT_ELEMENT: 2072 assert(N2C && (unsigned)N2C->getValue() < 2 && "Bad EXTRACT_ELEMENT!"); 2073 2074 // EXTRACT_ELEMENT of BUILD_PAIR is often formed while legalize is expanding 2075 // 64-bit integers into 32-bit parts. Instead of building the extract of 2076 // the BUILD_PAIR, only to have legalize rip it apart, just do it now. 2077 if (N1.getOpcode() == ISD::BUILD_PAIR) 2078 return N1.getOperand(N2C->getValue()); 2079 2080 // EXTRACT_ELEMENT of a constant int is also very common. 2081 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(N1)) { 2082 unsigned Shift = MVT::getSizeInBits(VT) * N2C->getValue(); 2083 return getConstant(C->getValue() >> Shift, VT); 2084 } 2085 break; 2086 } 2087 2088 if (N1C) { 2089 if (N2C) { 2090 uint64_t C1 = N1C->getValue(), C2 = N2C->getValue(); 2091 switch (Opcode) { 2092 case ISD::ADD: return getConstant(C1 + C2, VT); 2093 case ISD::SUB: return getConstant(C1 - C2, VT); 2094 case ISD::MUL: return getConstant(C1 * C2, VT); 2095 case ISD::UDIV: 2096 if (C2) return getConstant(C1 / C2, VT); 2097 break; 2098 case ISD::UREM : 2099 if (C2) return getConstant(C1 % C2, VT); 2100 break; 2101 case ISD::SDIV : 2102 if (C2) return getConstant(N1C->getSignExtended() / 2103 N2C->getSignExtended(), VT); 2104 break; 2105 case ISD::SREM : 2106 if (C2) return getConstant(N1C->getSignExtended() % 2107 N2C->getSignExtended(), VT); 2108 break; 2109 case ISD::AND : return getConstant(C1 & C2, VT); 2110 case ISD::OR : return getConstant(C1 | C2, VT); 2111 case ISD::XOR : return getConstant(C1 ^ C2, VT); 2112 case ISD::SHL : return getConstant(C1 << C2, VT); 2113 case ISD::SRL : return getConstant(C1 >> C2, VT); 2114 case ISD::SRA : return getConstant(N1C->getSignExtended() >>(int)C2, VT); 2115 case ISD::ROTL : 2116 return getConstant((C1 << C2) | (C1 >> (MVT::getSizeInBits(VT) - C2)), 2117 VT); 2118 case ISD::ROTR : 2119 return getConstant((C1 >> C2) | (C1 << (MVT::getSizeInBits(VT) - C2)), 2120 VT); 2121 default: break; 2122 } 2123 } else { // Cannonicalize constant to RHS if commutative 2124 if (isCommutativeBinOp(Opcode)) { 2125 std::swap(N1C, N2C); 2126 std::swap(N1, N2); 2127 } 2128 } 2129 } 2130 2131 // Constant fold FP operations. 2132 ConstantFPSDNode *N1CFP = dyn_cast<ConstantFPSDNode>(N1.Val); 2133 ConstantFPSDNode *N2CFP = dyn_cast<ConstantFPSDNode>(N2.Val); 2134 if (N1CFP) { 2135 if (!N2CFP && isCommutativeBinOp(Opcode)) { 2136 // Cannonicalize constant to RHS if commutative 2137 std::swap(N1CFP, N2CFP); 2138 std::swap(N1, N2); 2139 } else if (N2CFP && VT != MVT::ppcf128) { 2140 APFloat V1 = N1CFP->getValueAPF(), V2 = N2CFP->getValueAPF(); 2141 APFloat::opStatus s; 2142 switch (Opcode) { 2143 case ISD::FADD: 2144 s = V1.add(V2, APFloat::rmNearestTiesToEven); 2145 if (s != APFloat::opInvalidOp) 2146 return getConstantFP(V1, VT); 2147 break; 2148 case ISD::FSUB: 2149 s = V1.subtract(V2, APFloat::rmNearestTiesToEven); 2150 if (s!=APFloat::opInvalidOp) 2151 return getConstantFP(V1, VT); 2152 break; 2153 case ISD::FMUL: 2154 s = V1.multiply(V2, APFloat::rmNearestTiesToEven); 2155 if (s!=APFloat::opInvalidOp) 2156 return getConstantFP(V1, VT); 2157 break; 2158 case ISD::FDIV: 2159 s = V1.divide(V2, APFloat::rmNearestTiesToEven); 2160 if (s!=APFloat::opInvalidOp && s!=APFloat::opDivByZero) 2161 return getConstantFP(V1, VT); 2162 break; 2163 case ISD::FREM : 2164 s = V1.mod(V2, APFloat::rmNearestTiesToEven); 2165 if (s!=APFloat::opInvalidOp && s!=APFloat::opDivByZero) 2166 return getConstantFP(V1, VT); 2167 break; 2168 case ISD::FCOPYSIGN: 2169 V1.copySign(V2); 2170 return getConstantFP(V1, VT); 2171 default: break; 2172 } 2173 } 2174 } 2175 2176 // Canonicalize an UNDEF to the RHS, even over a constant. 2177 if (N1.getOpcode() == ISD::UNDEF) { 2178 if (isCommutativeBinOp(Opcode)) { 2179 std::swap(N1, N2); 2180 } else { 2181 switch (Opcode) { 2182 case ISD::FP_ROUND_INREG: 2183 case ISD::SIGN_EXTEND_INREG: 2184 case ISD::SUB: 2185 case ISD::FSUB: 2186 case ISD::FDIV: 2187 case ISD::FREM: 2188 case ISD::SRA: 2189 return N1; // fold op(undef, arg2) -> undef 2190 case ISD::UDIV: 2191 case ISD::SDIV: 2192 case ISD::UREM: 2193 case ISD::SREM: 2194 case ISD::SRL: 2195 case ISD::SHL: 2196 if (!MVT::isVector(VT)) 2197 return getConstant(0, VT); // fold op(undef, arg2) -> 0 2198 // For vectors, we can't easily build an all zero vector, just return 2199 // the LHS. 2200 return N2; 2201 } 2202 } 2203 } 2204 2205 // Fold a bunch of operators when the RHS is undef. 2206 if (N2.getOpcode() == ISD::UNDEF) { 2207 switch (Opcode) { 2208 case ISD::ADD: 2209 case ISD::ADDC: 2210 case ISD::ADDE: 2211 case ISD::SUB: 2212 case ISD::FADD: 2213 case ISD::FSUB: 2214 case ISD::FMUL: 2215 case ISD::FDIV: 2216 case ISD::FREM: 2217 case ISD::UDIV: 2218 case ISD::SDIV: 2219 case ISD::UREM: 2220 case ISD::SREM: 2221 case ISD::XOR: 2222 return N2; // fold op(arg1, undef) -> undef 2223 case ISD::MUL: 2224 case ISD::AND: 2225 case ISD::SRL: 2226 case ISD::SHL: 2227 if (!MVT::isVector(VT)) 2228 return getConstant(0, VT); // fold op(arg1, undef) -> 0 2229 // For vectors, we can't easily build an all zero vector, just return 2230 // the LHS. 2231 return N1; 2232 case ISD::OR: 2233 if (!MVT::isVector(VT)) 2234 return getConstant(MVT::getIntVTBitMask(VT), VT); 2235 // For vectors, we can't easily build an all one vector, just return 2236 // the LHS. 2237 return N1; 2238 case ISD::SRA: 2239 return N1; 2240 } 2241 } 2242 2243 // Memoize this node if possible. 2244 SDNode *N; 2245 SDVTList VTs = getVTList(VT); 2246 if (VT != MVT::Flag) { 2247 SDOperand Ops[] = { N1, N2 }; 2248 FoldingSetNodeID ID; 2249 AddNodeIDNode(ID, Opcode, VTs, Ops, 2); 2250 void *IP = 0; 2251 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP)) 2252 return SDOperand(E, 0); 2253 N = new BinarySDNode(Opcode, VTs, N1, N2); 2254 CSEMap.InsertNode(N, IP); 2255 } else { 2256 N = new BinarySDNode(Opcode, VTs, N1, N2); 2257 } 2258 2259 AllNodes.push_back(N); 2260 return SDOperand(N, 0); 2261} 2262 2263SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT, 2264 SDOperand N1, SDOperand N2, SDOperand N3) { 2265 // Perform various simplifications. 2266 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1.Val); 2267 ConstantSDNode *N2C = dyn_cast<ConstantSDNode>(N2.Val); 2268 switch (Opcode) { 2269 case ISD::SETCC: { 2270 // Use FoldSetCC to simplify SETCC's. 2271 SDOperand Simp = FoldSetCC(VT, N1, N2, cast<CondCodeSDNode>(N3)->get()); 2272 if (Simp.Val) return Simp; 2273 break; 2274 } 2275 case ISD::SELECT: 2276 if (N1C) 2277 if (N1C->getValue()) 2278 return N2; // select true, X, Y -> X 2279 else 2280 return N3; // select false, X, Y -> Y 2281 2282 if (N2 == N3) return N2; // select C, X, X -> X 2283 break; 2284 case ISD::BRCOND: 2285 if (N2C) 2286 if (N2C->getValue()) // Unconditional branch 2287 return getNode(ISD::BR, MVT::Other, N1, N3); 2288 else 2289 return N1; // Never-taken branch 2290 break; 2291 case ISD::VECTOR_SHUFFLE: 2292 assert(VT == N1.getValueType() && VT == N2.getValueType() && 2293 MVT::isVector(VT) && MVT::isVector(N3.getValueType()) && 2294 N3.getOpcode() == ISD::BUILD_VECTOR && 2295 MVT::getVectorNumElements(VT) == N3.getNumOperands() && 2296 "Illegal VECTOR_SHUFFLE node!"); 2297 break; 2298 case ISD::BIT_CONVERT: 2299 // Fold bit_convert nodes from a type to themselves. 2300 if (N1.getValueType() == VT) 2301 return N1; 2302 break; 2303 } 2304 2305 // Memoize node if it doesn't produce a flag. 2306 SDNode *N; 2307 SDVTList VTs = getVTList(VT); 2308 if (VT != MVT::Flag) { 2309 SDOperand Ops[] = { N1, N2, N3 }; 2310 FoldingSetNodeID ID; 2311 AddNodeIDNode(ID, Opcode, VTs, Ops, 3); 2312 void *IP = 0; 2313 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP)) 2314 return SDOperand(E, 0); 2315 N = new TernarySDNode(Opcode, VTs, N1, N2, N3); 2316 CSEMap.InsertNode(N, IP); 2317 } else { 2318 N = new TernarySDNode(Opcode, VTs, N1, N2, N3); 2319 } 2320 AllNodes.push_back(N); 2321 return SDOperand(N, 0); 2322} 2323 2324SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT, 2325 SDOperand N1, SDOperand N2, SDOperand N3, 2326 SDOperand N4) { 2327 SDOperand Ops[] = { N1, N2, N3, N4 }; 2328 return getNode(Opcode, VT, Ops, 4); 2329} 2330 2331SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT, 2332 SDOperand N1, SDOperand N2, SDOperand N3, 2333 SDOperand N4, SDOperand N5) { 2334 SDOperand Ops[] = { N1, N2, N3, N4, N5 }; 2335 return getNode(Opcode, VT, Ops, 5); 2336} 2337 2338SDOperand SelectionDAG::getMemcpy(SDOperand Chain, SDOperand Dest, 2339 SDOperand Src, SDOperand Size, 2340 SDOperand Align, 2341 SDOperand AlwaysInline) { 2342 SDOperand Ops[] = { Chain, Dest, Src, Size, Align, AlwaysInline }; 2343 return getNode(ISD::MEMCPY, MVT::Other, Ops, 6); 2344} 2345 2346SDOperand SelectionDAG::getMemmove(SDOperand Chain, SDOperand Dest, 2347 SDOperand Src, SDOperand Size, 2348 SDOperand Align, 2349 SDOperand AlwaysInline) { 2350 SDOperand Ops[] = { Chain, Dest, Src, Size, Align, AlwaysInline }; 2351 return getNode(ISD::MEMMOVE, MVT::Other, Ops, 6); 2352} 2353 2354SDOperand SelectionDAG::getMemset(SDOperand Chain, SDOperand Dest, 2355 SDOperand Src, SDOperand Size, 2356 SDOperand Align, 2357 SDOperand AlwaysInline) { 2358 SDOperand Ops[] = { Chain, Dest, Src, Size, Align, AlwaysInline }; 2359 return getNode(ISD::MEMSET, MVT::Other, Ops, 6); 2360} 2361 2362SDOperand SelectionDAG::getLoad(MVT::ValueType VT, 2363 SDOperand Chain, SDOperand Ptr, 2364 const Value *SV, int SVOffset, 2365 bool isVolatile, unsigned Alignment) { 2366 if (Alignment == 0) { // Ensure that codegen never sees alignment 0 2367 const Type *Ty = 0; 2368 if (VT != MVT::iPTR) { 2369 Ty = MVT::getTypeForValueType(VT); 2370 } else if (SV) { 2371 const PointerType *PT = dyn_cast<PointerType>(SV->getType()); 2372 assert(PT && "Value for load must be a pointer"); 2373 Ty = PT->getElementType(); 2374 } 2375 assert(Ty && "Could not get type information for load"); 2376 Alignment = TLI.getTargetData()->getABITypeAlignment(Ty); 2377 } 2378 SDVTList VTs = getVTList(VT, MVT::Other); 2379 SDOperand Undef = getNode(ISD::UNDEF, Ptr.getValueType()); 2380 SDOperand Ops[] = { Chain, Ptr, Undef }; 2381 FoldingSetNodeID ID; 2382 AddNodeIDNode(ID, ISD::LOAD, VTs, Ops, 3); 2383 ID.AddInteger(ISD::UNINDEXED); 2384 ID.AddInteger(ISD::NON_EXTLOAD); 2385 ID.AddInteger((unsigned int)VT); 2386 ID.AddInteger(Alignment); 2387 ID.AddInteger(isVolatile); 2388 void *IP = 0; 2389 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP)) 2390 return SDOperand(E, 0); 2391 SDNode *N = new LoadSDNode(Ops, VTs, ISD::UNINDEXED, 2392 ISD::NON_EXTLOAD, VT, SV, SVOffset, Alignment, 2393 isVolatile); 2394 CSEMap.InsertNode(N, IP); 2395 AllNodes.push_back(N); 2396 return SDOperand(N, 0); 2397} 2398 2399SDOperand SelectionDAG::getExtLoad(ISD::LoadExtType ExtType, MVT::ValueType VT, 2400 SDOperand Chain, SDOperand Ptr, 2401 const Value *SV, 2402 int SVOffset, MVT::ValueType EVT, 2403 bool isVolatile, unsigned Alignment) { 2404 // If they are asking for an extending load from/to the same thing, return a 2405 // normal load. 2406 if (VT == EVT) 2407 return getLoad(VT, Chain, Ptr, SV, SVOffset, isVolatile, Alignment); 2408 2409 if (MVT::isVector(VT)) 2410 assert(EVT == MVT::getVectorElementType(VT) && "Invalid vector extload!"); 2411 else 2412 assert(MVT::getSizeInBits(EVT) < MVT::getSizeInBits(VT) && 2413 "Should only be an extending load, not truncating!"); 2414 assert((ExtType == ISD::EXTLOAD || MVT::isInteger(VT)) && 2415 "Cannot sign/zero extend a FP/Vector load!"); 2416 assert(MVT::isInteger(VT) == MVT::isInteger(EVT) && 2417 "Cannot convert from FP to Int or Int -> FP!"); 2418 2419 if (Alignment == 0) { // Ensure that codegen never sees alignment 0 2420 const Type *Ty = 0; 2421 if (VT != MVT::iPTR) { 2422 Ty = MVT::getTypeForValueType(VT); 2423 } else if (SV) { 2424 const PointerType *PT = dyn_cast<PointerType>(SV->getType()); 2425 assert(PT && "Value for load must be a pointer"); 2426 Ty = PT->getElementType(); 2427 } 2428 assert(Ty && "Could not get type information for load"); 2429 Alignment = TLI.getTargetData()->getABITypeAlignment(Ty); 2430 } 2431 SDVTList VTs = getVTList(VT, MVT::Other); 2432 SDOperand Undef = getNode(ISD::UNDEF, Ptr.getValueType()); 2433 SDOperand Ops[] = { Chain, Ptr, Undef }; 2434 FoldingSetNodeID ID; 2435 AddNodeIDNode(ID, ISD::LOAD, VTs, Ops, 3); 2436 ID.AddInteger(ISD::UNINDEXED); 2437 ID.AddInteger(ExtType); 2438 ID.AddInteger((unsigned int)EVT); 2439 ID.AddInteger(Alignment); 2440 ID.AddInteger(isVolatile); 2441 void *IP = 0; 2442 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP)) 2443 return SDOperand(E, 0); 2444 SDNode *N = new LoadSDNode(Ops, VTs, ISD::UNINDEXED, ExtType, EVT, 2445 SV, SVOffset, Alignment, isVolatile); 2446 CSEMap.InsertNode(N, IP); 2447 AllNodes.push_back(N); 2448 return SDOperand(N, 0); 2449} 2450 2451SDOperand 2452SelectionDAG::getIndexedLoad(SDOperand OrigLoad, SDOperand Base, 2453 SDOperand Offset, ISD::MemIndexedMode AM) { 2454 LoadSDNode *LD = cast<LoadSDNode>(OrigLoad); 2455 assert(LD->getOffset().getOpcode() == ISD::UNDEF && 2456 "Load is already a indexed load!"); 2457 MVT::ValueType VT = OrigLoad.getValueType(); 2458 SDVTList VTs = getVTList(VT, Base.getValueType(), MVT::Other); 2459 SDOperand Ops[] = { LD->getChain(), Base, Offset }; 2460 FoldingSetNodeID ID; 2461 AddNodeIDNode(ID, ISD::LOAD, VTs, Ops, 3); 2462 ID.AddInteger(AM); 2463 ID.AddInteger(LD->getExtensionType()); 2464 ID.AddInteger((unsigned int)(LD->getMemoryVT())); 2465 ID.AddInteger(LD->getAlignment()); 2466 ID.AddInteger(LD->isVolatile()); 2467 void *IP = 0; 2468 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP)) 2469 return SDOperand(E, 0); 2470 SDNode *N = new LoadSDNode(Ops, VTs, AM, 2471 LD->getExtensionType(), LD->getMemoryVT(), 2472 LD->getSrcValue(), LD->getSrcValueOffset(), 2473 LD->getAlignment(), LD->isVolatile()); 2474 CSEMap.InsertNode(N, IP); 2475 AllNodes.push_back(N); 2476 return SDOperand(N, 0); 2477} 2478 2479SDOperand SelectionDAG::getStore(SDOperand Chain, SDOperand Val, 2480 SDOperand Ptr, const Value *SV, int SVOffset, 2481 bool isVolatile, unsigned Alignment) { 2482 MVT::ValueType VT = Val.getValueType(); 2483 2484 if (Alignment == 0) { // Ensure that codegen never sees alignment 0 2485 const Type *Ty = 0; 2486 if (VT != MVT::iPTR) { 2487 Ty = MVT::getTypeForValueType(VT); 2488 } else if (SV) { 2489 const PointerType *PT = dyn_cast<PointerType>(SV->getType()); 2490 assert(PT && "Value for store must be a pointer"); 2491 Ty = PT->getElementType(); 2492 } 2493 assert(Ty && "Could not get type information for store"); 2494 Alignment = TLI.getTargetData()->getABITypeAlignment(Ty); 2495 } 2496 SDVTList VTs = getVTList(MVT::Other); 2497 SDOperand Undef = getNode(ISD::UNDEF, Ptr.getValueType()); 2498 SDOperand Ops[] = { Chain, Val, Ptr, Undef }; 2499 FoldingSetNodeID ID; 2500 AddNodeIDNode(ID, ISD::STORE, VTs, Ops, 4); 2501 ID.AddInteger(ISD::UNINDEXED); 2502 ID.AddInteger(false); 2503 ID.AddInteger((unsigned int)VT); 2504 ID.AddInteger(Alignment); 2505 ID.AddInteger(isVolatile); 2506 void *IP = 0; 2507 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP)) 2508 return SDOperand(E, 0); 2509 SDNode *N = new StoreSDNode(Ops, VTs, ISD::UNINDEXED, false, 2510 VT, SV, SVOffset, Alignment, isVolatile); 2511 CSEMap.InsertNode(N, IP); 2512 AllNodes.push_back(N); 2513 return SDOperand(N, 0); 2514} 2515 2516SDOperand SelectionDAG::getTruncStore(SDOperand Chain, SDOperand Val, 2517 SDOperand Ptr, const Value *SV, 2518 int SVOffset, MVT::ValueType SVT, 2519 bool isVolatile, unsigned Alignment) { 2520 MVT::ValueType VT = Val.getValueType(); 2521 2522 if (VT == SVT) 2523 return getStore(Chain, Val, Ptr, SV, SVOffset, isVolatile, Alignment); 2524 2525 assert(MVT::getSizeInBits(VT) > MVT::getSizeInBits(SVT) && 2526 "Not a truncation?"); 2527 assert(MVT::isInteger(VT) == MVT::isInteger(SVT) && 2528 "Can't do FP-INT conversion!"); 2529 2530 if (Alignment == 0) { // Ensure that codegen never sees alignment 0 2531 const Type *Ty = 0; 2532 if (VT != MVT::iPTR) { 2533 Ty = MVT::getTypeForValueType(VT); 2534 } else if (SV) { 2535 const PointerType *PT = dyn_cast<PointerType>(SV->getType()); 2536 assert(PT && "Value for store must be a pointer"); 2537 Ty = PT->getElementType(); 2538 } 2539 assert(Ty && "Could not get type information for store"); 2540 Alignment = TLI.getTargetData()->getABITypeAlignment(Ty); 2541 } 2542 SDVTList VTs = getVTList(MVT::Other); 2543 SDOperand Undef = getNode(ISD::UNDEF, Ptr.getValueType()); 2544 SDOperand Ops[] = { Chain, Val, Ptr, Undef }; 2545 FoldingSetNodeID ID; 2546 AddNodeIDNode(ID, ISD::STORE, VTs, Ops, 4); 2547 ID.AddInteger(ISD::UNINDEXED); 2548 ID.AddInteger(1); 2549 ID.AddInteger((unsigned int)SVT); 2550 ID.AddInteger(Alignment); 2551 ID.AddInteger(isVolatile); 2552 void *IP = 0; 2553 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP)) 2554 return SDOperand(E, 0); 2555 SDNode *N = new StoreSDNode(Ops, VTs, ISD::UNINDEXED, true, 2556 SVT, SV, SVOffset, Alignment, isVolatile); 2557 CSEMap.InsertNode(N, IP); 2558 AllNodes.push_back(N); 2559 return SDOperand(N, 0); 2560} 2561 2562SDOperand 2563SelectionDAG::getIndexedStore(SDOperand OrigStore, SDOperand Base, 2564 SDOperand Offset, ISD::MemIndexedMode AM) { 2565 StoreSDNode *ST = cast<StoreSDNode>(OrigStore); 2566 assert(ST->getOffset().getOpcode() == ISD::UNDEF && 2567 "Store is already a indexed store!"); 2568 SDVTList VTs = getVTList(Base.getValueType(), MVT::Other); 2569 SDOperand Ops[] = { ST->getChain(), ST->getValue(), Base, Offset }; 2570 FoldingSetNodeID ID; 2571 AddNodeIDNode(ID, ISD::STORE, VTs, Ops, 4); 2572 ID.AddInteger(AM); 2573 ID.AddInteger(ST->isTruncatingStore()); 2574 ID.AddInteger((unsigned int)(ST->getMemoryVT())); 2575 ID.AddInteger(ST->getAlignment()); 2576 ID.AddInteger(ST->isVolatile()); 2577 void *IP = 0; 2578 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP)) 2579 return SDOperand(E, 0); 2580 SDNode *N = new StoreSDNode(Ops, VTs, AM, 2581 ST->isTruncatingStore(), ST->getMemoryVT(), 2582 ST->getSrcValue(), ST->getSrcValueOffset(), 2583 ST->getAlignment(), ST->isVolatile()); 2584 CSEMap.InsertNode(N, IP); 2585 AllNodes.push_back(N); 2586 return SDOperand(N, 0); 2587} 2588 2589SDOperand SelectionDAG::getVAArg(MVT::ValueType VT, 2590 SDOperand Chain, SDOperand Ptr, 2591 SDOperand SV) { 2592 SDOperand Ops[] = { Chain, Ptr, SV }; 2593 return getNode(ISD::VAARG, getVTList(VT, MVT::Other), Ops, 3); 2594} 2595 2596SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT, 2597 const SDOperand *Ops, unsigned NumOps) { 2598 switch (NumOps) { 2599 case 0: return getNode(Opcode, VT); 2600 case 1: return getNode(Opcode, VT, Ops[0]); 2601 case 2: return getNode(Opcode, VT, Ops[0], Ops[1]); 2602 case 3: return getNode(Opcode, VT, Ops[0], Ops[1], Ops[2]); 2603 default: break; 2604 } 2605 2606 switch (Opcode) { 2607 default: break; 2608 case ISD::SELECT_CC: { 2609 assert(NumOps == 5 && "SELECT_CC takes 5 operands!"); 2610 assert(Ops[0].getValueType() == Ops[1].getValueType() && 2611 "LHS and RHS of condition must have same type!"); 2612 assert(Ops[2].getValueType() == Ops[3].getValueType() && 2613 "True and False arms of SelectCC must have same type!"); 2614 assert(Ops[2].getValueType() == VT && 2615 "select_cc node must be of same type as true and false value!"); 2616 break; 2617 } 2618 case ISD::BR_CC: { 2619 assert(NumOps == 5 && "BR_CC takes 5 operands!"); 2620 assert(Ops[2].getValueType() == Ops[3].getValueType() && 2621 "LHS/RHS of comparison should match types!"); 2622 break; 2623 } 2624 } 2625 2626 // Memoize nodes. 2627 SDNode *N; 2628 SDVTList VTs = getVTList(VT); 2629 if (VT != MVT::Flag) { 2630 FoldingSetNodeID ID; 2631 AddNodeIDNode(ID, Opcode, VTs, Ops, NumOps); 2632 void *IP = 0; 2633 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP)) 2634 return SDOperand(E, 0); 2635 N = new SDNode(Opcode, VTs, Ops, NumOps); 2636 CSEMap.InsertNode(N, IP); 2637 } else { 2638 N = new SDNode(Opcode, VTs, Ops, NumOps); 2639 } 2640 AllNodes.push_back(N); 2641 return SDOperand(N, 0); 2642} 2643 2644SDOperand SelectionDAG::getNode(unsigned Opcode, 2645 std::vector<MVT::ValueType> &ResultTys, 2646 const SDOperand *Ops, unsigned NumOps) { 2647 return getNode(Opcode, getNodeValueTypes(ResultTys), ResultTys.size(), 2648 Ops, NumOps); 2649} 2650 2651SDOperand SelectionDAG::getNode(unsigned Opcode, 2652 const MVT::ValueType *VTs, unsigned NumVTs, 2653 const SDOperand *Ops, unsigned NumOps) { 2654 if (NumVTs == 1) 2655 return getNode(Opcode, VTs[0], Ops, NumOps); 2656 return getNode(Opcode, makeVTList(VTs, NumVTs), Ops, NumOps); 2657} 2658 2659SDOperand SelectionDAG::getNode(unsigned Opcode, SDVTList VTList, 2660 const SDOperand *Ops, unsigned NumOps) { 2661 if (VTList.NumVTs == 1) 2662 return getNode(Opcode, VTList.VTs[0], Ops, NumOps); 2663 2664 switch (Opcode) { 2665 // FIXME: figure out how to safely handle things like 2666 // int foo(int x) { return 1 << (x & 255); } 2667 // int bar() { return foo(256); } 2668#if 0 2669 case ISD::SRA_PARTS: 2670 case ISD::SRL_PARTS: 2671 case ISD::SHL_PARTS: 2672 if (N3.getOpcode() == ISD::SIGN_EXTEND_INREG && 2673 cast<VTSDNode>(N3.getOperand(1))->getVT() != MVT::i1) 2674 return getNode(Opcode, VT, N1, N2, N3.getOperand(0)); 2675 else if (N3.getOpcode() == ISD::AND) 2676 if (ConstantSDNode *AndRHS = dyn_cast<ConstantSDNode>(N3.getOperand(1))) { 2677 // If the and is only masking out bits that cannot effect the shift, 2678 // eliminate the and. 2679 unsigned NumBits = MVT::getSizeInBits(VT)*2; 2680 if ((AndRHS->getValue() & (NumBits-1)) == NumBits-1) 2681 return getNode(Opcode, VT, N1, N2, N3.getOperand(0)); 2682 } 2683 break; 2684#endif 2685 } 2686 2687 // Memoize the node unless it returns a flag. 2688 SDNode *N; 2689 if (VTList.VTs[VTList.NumVTs-1] != MVT::Flag) { 2690 FoldingSetNodeID ID; 2691 AddNodeIDNode(ID, Opcode, VTList, Ops, NumOps); 2692 void *IP = 0; 2693 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP)) 2694 return SDOperand(E, 0); 2695 if (NumOps == 1) 2696 N = new UnarySDNode(Opcode, VTList, Ops[0]); 2697 else if (NumOps == 2) 2698 N = new BinarySDNode(Opcode, VTList, Ops[0], Ops[1]); 2699 else if (NumOps == 3) 2700 N = new TernarySDNode(Opcode, VTList, Ops[0], Ops[1], Ops[2]); 2701 else 2702 N = new SDNode(Opcode, VTList, Ops, NumOps); 2703 CSEMap.InsertNode(N, IP); 2704 } else { 2705 if (NumOps == 1) 2706 N = new UnarySDNode(Opcode, VTList, Ops[0]); 2707 else if (NumOps == 2) 2708 N = new BinarySDNode(Opcode, VTList, Ops[0], Ops[1]); 2709 else if (NumOps == 3) 2710 N = new TernarySDNode(Opcode, VTList, Ops[0], Ops[1], Ops[2]); 2711 else 2712 N = new SDNode(Opcode, VTList, Ops, NumOps); 2713 } 2714 AllNodes.push_back(N); 2715 return SDOperand(N, 0); 2716} 2717 2718SDOperand SelectionDAG::getNode(unsigned Opcode, SDVTList VTList) { 2719 return getNode(Opcode, VTList, 0, 0); 2720} 2721 2722SDOperand SelectionDAG::getNode(unsigned Opcode, SDVTList VTList, 2723 SDOperand N1) { 2724 SDOperand Ops[] = { N1 }; 2725 return getNode(Opcode, VTList, Ops, 1); 2726} 2727 2728SDOperand SelectionDAG::getNode(unsigned Opcode, SDVTList VTList, 2729 SDOperand N1, SDOperand N2) { 2730 SDOperand Ops[] = { N1, N2 }; 2731 return getNode(Opcode, VTList, Ops, 2); 2732} 2733 2734SDOperand SelectionDAG::getNode(unsigned Opcode, SDVTList VTList, 2735 SDOperand N1, SDOperand N2, SDOperand N3) { 2736 SDOperand Ops[] = { N1, N2, N3 }; 2737 return getNode(Opcode, VTList, Ops, 3); 2738} 2739 2740SDOperand SelectionDAG::getNode(unsigned Opcode, SDVTList VTList, 2741 SDOperand N1, SDOperand N2, SDOperand N3, 2742 SDOperand N4) { 2743 SDOperand Ops[] = { N1, N2, N3, N4 }; 2744 return getNode(Opcode, VTList, Ops, 4); 2745} 2746 2747SDOperand SelectionDAG::getNode(unsigned Opcode, SDVTList VTList, 2748 SDOperand N1, SDOperand N2, SDOperand N3, 2749 SDOperand N4, SDOperand N5) { 2750 SDOperand Ops[] = { N1, N2, N3, N4, N5 }; 2751 return getNode(Opcode, VTList, Ops, 5); 2752} 2753 2754SDVTList SelectionDAG::getVTList(MVT::ValueType VT) { 2755 return makeVTList(SDNode::getValueTypeList(VT), 1); 2756} 2757 2758SDVTList SelectionDAG::getVTList(MVT::ValueType VT1, MVT::ValueType VT2) { 2759 for (std::list<std::vector<MVT::ValueType> >::iterator I = VTList.begin(), 2760 E = VTList.end(); I != E; ++I) { 2761 if (I->size() == 2 && (*I)[0] == VT1 && (*I)[1] == VT2) 2762 return makeVTList(&(*I)[0], 2); 2763 } 2764 std::vector<MVT::ValueType> V; 2765 V.push_back(VT1); 2766 V.push_back(VT2); 2767 VTList.push_front(V); 2768 return makeVTList(&(*VTList.begin())[0], 2); 2769} 2770SDVTList SelectionDAG::getVTList(MVT::ValueType VT1, MVT::ValueType VT2, 2771 MVT::ValueType VT3) { 2772 for (std::list<std::vector<MVT::ValueType> >::iterator I = VTList.begin(), 2773 E = VTList.end(); I != E; ++I) { 2774 if (I->size() == 3 && (*I)[0] == VT1 && (*I)[1] == VT2 && 2775 (*I)[2] == VT3) 2776 return makeVTList(&(*I)[0], 3); 2777 } 2778 std::vector<MVT::ValueType> V; 2779 V.push_back(VT1); 2780 V.push_back(VT2); 2781 V.push_back(VT3); 2782 VTList.push_front(V); 2783 return makeVTList(&(*VTList.begin())[0], 3); 2784} 2785 2786SDVTList SelectionDAG::getVTList(const MVT::ValueType *VTs, unsigned NumVTs) { 2787 switch (NumVTs) { 2788 case 0: assert(0 && "Cannot have nodes without results!"); 2789 case 1: return getVTList(VTs[0]); 2790 case 2: return getVTList(VTs[0], VTs[1]); 2791 case 3: return getVTList(VTs[0], VTs[1], VTs[2]); 2792 default: break; 2793 } 2794 2795 for (std::list<std::vector<MVT::ValueType> >::iterator I = VTList.begin(), 2796 E = VTList.end(); I != E; ++I) { 2797 if (I->size() != NumVTs || VTs[0] != (*I)[0] || VTs[1] != (*I)[1]) continue; 2798 2799 bool NoMatch = false; 2800 for (unsigned i = 2; i != NumVTs; ++i) 2801 if (VTs[i] != (*I)[i]) { 2802 NoMatch = true; 2803 break; 2804 } 2805 if (!NoMatch) 2806 return makeVTList(&*I->begin(), NumVTs); 2807 } 2808 2809 VTList.push_front(std::vector<MVT::ValueType>(VTs, VTs+NumVTs)); 2810 return makeVTList(&*VTList.begin()->begin(), NumVTs); 2811} 2812 2813 2814/// UpdateNodeOperands - *Mutate* the specified node in-place to have the 2815/// specified operands. If the resultant node already exists in the DAG, 2816/// this does not modify the specified node, instead it returns the node that 2817/// already exists. If the resultant node does not exist in the DAG, the 2818/// input node is returned. As a degenerate case, if you specify the same 2819/// input operands as the node already has, the input node is returned. 2820SDOperand SelectionDAG:: 2821UpdateNodeOperands(SDOperand InN, SDOperand Op) { 2822 SDNode *N = InN.Val; 2823 assert(N->getNumOperands() == 1 && "Update with wrong number of operands"); 2824 2825 // Check to see if there is no change. 2826 if (Op == N->getOperand(0)) return InN; 2827 2828 // See if the modified node already exists. 2829 void *InsertPos = 0; 2830 if (SDNode *Existing = FindModifiedNodeSlot(N, Op, InsertPos)) 2831 return SDOperand(Existing, InN.ResNo); 2832 2833 // Nope it doesn't. Remove the node from it's current place in the maps. 2834 if (InsertPos) 2835 RemoveNodeFromCSEMaps(N); 2836 2837 // Now we update the operands. 2838 N->OperandList[0].Val->removeUser(N); 2839 Op.Val->addUser(N); 2840 N->OperandList[0] = Op; 2841 2842 // If this gets put into a CSE map, add it. 2843 if (InsertPos) CSEMap.InsertNode(N, InsertPos); 2844 return InN; 2845} 2846 2847SDOperand SelectionDAG:: 2848UpdateNodeOperands(SDOperand InN, SDOperand Op1, SDOperand Op2) { 2849 SDNode *N = InN.Val; 2850 assert(N->getNumOperands() == 2 && "Update with wrong number of operands"); 2851 2852 // Check to see if there is no change. 2853 if (Op1 == N->getOperand(0) && Op2 == N->getOperand(1)) 2854 return InN; // No operands changed, just return the input node. 2855 2856 // See if the modified node already exists. 2857 void *InsertPos = 0; 2858 if (SDNode *Existing = FindModifiedNodeSlot(N, Op1, Op2, InsertPos)) 2859 return SDOperand(Existing, InN.ResNo); 2860 2861 // Nope it doesn't. Remove the node from it's current place in the maps. 2862 if (InsertPos) 2863 RemoveNodeFromCSEMaps(N); 2864 2865 // Now we update the operands. 2866 if (N->OperandList[0] != Op1) { 2867 N->OperandList[0].Val->removeUser(N); 2868 Op1.Val->addUser(N); 2869 N->OperandList[0] = Op1; 2870 } 2871 if (N->OperandList[1] != Op2) { 2872 N->OperandList[1].Val->removeUser(N); 2873 Op2.Val->addUser(N); 2874 N->OperandList[1] = Op2; 2875 } 2876 2877 // If this gets put into a CSE map, add it. 2878 if (InsertPos) CSEMap.InsertNode(N, InsertPos); 2879 return InN; 2880} 2881 2882SDOperand SelectionDAG:: 2883UpdateNodeOperands(SDOperand N, SDOperand Op1, SDOperand Op2, SDOperand Op3) { 2884 SDOperand Ops[] = { Op1, Op2, Op3 }; 2885 return UpdateNodeOperands(N, Ops, 3); 2886} 2887 2888SDOperand SelectionDAG:: 2889UpdateNodeOperands(SDOperand N, SDOperand Op1, SDOperand Op2, 2890 SDOperand Op3, SDOperand Op4) { 2891 SDOperand Ops[] = { Op1, Op2, Op3, Op4 }; 2892 return UpdateNodeOperands(N, Ops, 4); 2893} 2894 2895SDOperand SelectionDAG:: 2896UpdateNodeOperands(SDOperand N, SDOperand Op1, SDOperand Op2, 2897 SDOperand Op3, SDOperand Op4, SDOperand Op5) { 2898 SDOperand Ops[] = { Op1, Op2, Op3, Op4, Op5 }; 2899 return UpdateNodeOperands(N, Ops, 5); 2900} 2901 2902 2903SDOperand SelectionDAG:: 2904UpdateNodeOperands(SDOperand InN, SDOperand *Ops, unsigned NumOps) { 2905 SDNode *N = InN.Val; 2906 assert(N->getNumOperands() == NumOps && 2907 "Update with wrong number of operands"); 2908 2909 // Check to see if there is no change. 2910 bool AnyChange = false; 2911 for (unsigned i = 0; i != NumOps; ++i) { 2912 if (Ops[i] != N->getOperand(i)) { 2913 AnyChange = true; 2914 break; 2915 } 2916 } 2917 2918 // No operands changed, just return the input node. 2919 if (!AnyChange) return InN; 2920 2921 // See if the modified node already exists. 2922 void *InsertPos = 0; 2923 if (SDNode *Existing = FindModifiedNodeSlot(N, Ops, NumOps, InsertPos)) 2924 return SDOperand(Existing, InN.ResNo); 2925 2926 // Nope it doesn't. Remove the node from it's current place in the maps. 2927 if (InsertPos) 2928 RemoveNodeFromCSEMaps(N); 2929 2930 // Now we update the operands. 2931 for (unsigned i = 0; i != NumOps; ++i) { 2932 if (N->OperandList[i] != Ops[i]) { 2933 N->OperandList[i].Val->removeUser(N); 2934 Ops[i].Val->addUser(N); 2935 N->OperandList[i] = Ops[i]; 2936 } 2937 } 2938 2939 // If this gets put into a CSE map, add it. 2940 if (InsertPos) CSEMap.InsertNode(N, InsertPos); 2941 return InN; 2942} 2943 2944 2945/// MorphNodeTo - This frees the operands of the current node, resets the 2946/// opcode, types, and operands to the specified value. This should only be 2947/// used by the SelectionDAG class. 2948void SDNode::MorphNodeTo(unsigned Opc, SDVTList L, 2949 const SDOperand *Ops, unsigned NumOps) { 2950 NodeType = Opc; 2951 ValueList = L.VTs; 2952 NumValues = L.NumVTs; 2953 2954 // Clear the operands list, updating used nodes to remove this from their 2955 // use list. 2956 for (op_iterator I = op_begin(), E = op_end(); I != E; ++I) 2957 I->Val->removeUser(this); 2958 2959 // If NumOps is larger than the # of operands we currently have, reallocate 2960 // the operand list. 2961 if (NumOps > NumOperands) { 2962 if (OperandsNeedDelete) 2963 delete [] OperandList; 2964 OperandList = new SDOperand[NumOps]; 2965 OperandsNeedDelete = true; 2966 } 2967 2968 // Assign the new operands. 2969 NumOperands = NumOps; 2970 2971 for (unsigned i = 0, e = NumOps; i != e; ++i) { 2972 OperandList[i] = Ops[i]; 2973 SDNode *N = OperandList[i].Val; 2974 N->Uses.push_back(this); 2975 } 2976} 2977 2978/// SelectNodeTo - These are used for target selectors to *mutate* the 2979/// specified node to have the specified return type, Target opcode, and 2980/// operands. Note that target opcodes are stored as 2981/// ISD::BUILTIN_OP_END+TargetOpcode in the node opcode field. 2982/// 2983/// Note that SelectNodeTo returns the resultant node. If there is already a 2984/// node of the specified opcode and operands, it returns that node instead of 2985/// the current one. 2986SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc, 2987 MVT::ValueType VT) { 2988 SDVTList VTs = getVTList(VT); 2989 FoldingSetNodeID ID; 2990 AddNodeIDNode(ID, ISD::BUILTIN_OP_END+TargetOpc, VTs, 0, 0); 2991 void *IP = 0; 2992 if (SDNode *ON = CSEMap.FindNodeOrInsertPos(ID, IP)) 2993 return ON; 2994 2995 RemoveNodeFromCSEMaps(N); 2996 2997 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc, VTs, 0, 0); 2998 2999 CSEMap.InsertNode(N, IP); 3000 return N; 3001} 3002 3003SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc, 3004 MVT::ValueType VT, SDOperand Op1) { 3005 // If an identical node already exists, use it. 3006 SDVTList VTs = getVTList(VT); 3007 SDOperand Ops[] = { Op1 }; 3008 3009 FoldingSetNodeID ID; 3010 AddNodeIDNode(ID, ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 1); 3011 void *IP = 0; 3012 if (SDNode *ON = CSEMap.FindNodeOrInsertPos(ID, IP)) 3013 return ON; 3014 3015 RemoveNodeFromCSEMaps(N); 3016 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 1); 3017 CSEMap.InsertNode(N, IP); 3018 return N; 3019} 3020 3021SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc, 3022 MVT::ValueType VT, SDOperand Op1, 3023 SDOperand Op2) { 3024 // If an identical node already exists, use it. 3025 SDVTList VTs = getVTList(VT); 3026 SDOperand Ops[] = { Op1, Op2 }; 3027 3028 FoldingSetNodeID ID; 3029 AddNodeIDNode(ID, ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 2); 3030 void *IP = 0; 3031 if (SDNode *ON = CSEMap.FindNodeOrInsertPos(ID, IP)) 3032 return ON; 3033 3034 RemoveNodeFromCSEMaps(N); 3035 3036 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 2); 3037 3038 CSEMap.InsertNode(N, IP); // Memoize the new node. 3039 return N; 3040} 3041 3042SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc, 3043 MVT::ValueType VT, SDOperand Op1, 3044 SDOperand Op2, SDOperand Op3) { 3045 // If an identical node already exists, use it. 3046 SDVTList VTs = getVTList(VT); 3047 SDOperand Ops[] = { Op1, Op2, Op3 }; 3048 FoldingSetNodeID ID; 3049 AddNodeIDNode(ID, ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 3); 3050 void *IP = 0; 3051 if (SDNode *ON = CSEMap.FindNodeOrInsertPos(ID, IP)) 3052 return ON; 3053 3054 RemoveNodeFromCSEMaps(N); 3055 3056 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 3); 3057 3058 CSEMap.InsertNode(N, IP); // Memoize the new node. 3059 return N; 3060} 3061 3062SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc, 3063 MVT::ValueType VT, const SDOperand *Ops, 3064 unsigned NumOps) { 3065 // If an identical node already exists, use it. 3066 SDVTList VTs = getVTList(VT); 3067 FoldingSetNodeID ID; 3068 AddNodeIDNode(ID, ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, NumOps); 3069 void *IP = 0; 3070 if (SDNode *ON = CSEMap.FindNodeOrInsertPos(ID, IP)) 3071 return ON; 3072 3073 RemoveNodeFromCSEMaps(N); 3074 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, NumOps); 3075 3076 CSEMap.InsertNode(N, IP); // Memoize the new node. 3077 return N; 3078} 3079 3080SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc, 3081 MVT::ValueType VT1, MVT::ValueType VT2, 3082 SDOperand Op1, SDOperand Op2) { 3083 SDVTList VTs = getVTList(VT1, VT2); 3084 FoldingSetNodeID ID; 3085 SDOperand Ops[] = { Op1, Op2 }; 3086 AddNodeIDNode(ID, ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 2); 3087 void *IP = 0; 3088 if (SDNode *ON = CSEMap.FindNodeOrInsertPos(ID, IP)) 3089 return ON; 3090 3091 RemoveNodeFromCSEMaps(N); 3092 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 2); 3093 CSEMap.InsertNode(N, IP); // Memoize the new node. 3094 return N; 3095} 3096 3097SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc, 3098 MVT::ValueType VT1, MVT::ValueType VT2, 3099 SDOperand Op1, SDOperand Op2, 3100 SDOperand Op3) { 3101 // If an identical node already exists, use it. 3102 SDVTList VTs = getVTList(VT1, VT2); 3103 SDOperand Ops[] = { Op1, Op2, Op3 }; 3104 FoldingSetNodeID ID; 3105 AddNodeIDNode(ID, ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 3); 3106 void *IP = 0; 3107 if (SDNode *ON = CSEMap.FindNodeOrInsertPos(ID, IP)) 3108 return ON; 3109 3110 RemoveNodeFromCSEMaps(N); 3111 3112 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 3); 3113 CSEMap.InsertNode(N, IP); // Memoize the new node. 3114 return N; 3115} 3116 3117 3118/// getTargetNode - These are used for target selectors to create a new node 3119/// with specified return type(s), target opcode, and operands. 3120/// 3121/// Note that getTargetNode returns the resultant node. If there is already a 3122/// node of the specified opcode and operands, it returns that node instead of 3123/// the current one. 3124SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT) { 3125 return getNode(ISD::BUILTIN_OP_END+Opcode, VT).Val; 3126} 3127SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT, 3128 SDOperand Op1) { 3129 return getNode(ISD::BUILTIN_OP_END+Opcode, VT, Op1).Val; 3130} 3131SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT, 3132 SDOperand Op1, SDOperand Op2) { 3133 return getNode(ISD::BUILTIN_OP_END+Opcode, VT, Op1, Op2).Val; 3134} 3135SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT, 3136 SDOperand Op1, SDOperand Op2, 3137 SDOperand Op3) { 3138 return getNode(ISD::BUILTIN_OP_END+Opcode, VT, Op1, Op2, Op3).Val; 3139} 3140SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT, 3141 const SDOperand *Ops, unsigned NumOps) { 3142 return getNode(ISD::BUILTIN_OP_END+Opcode, VT, Ops, NumOps).Val; 3143} 3144SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1, 3145 MVT::ValueType VT2) { 3146 const MVT::ValueType *VTs = getNodeValueTypes(VT1, VT2); 3147 SDOperand Op; 3148 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 2, &Op, 0).Val; 3149} 3150SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1, 3151 MVT::ValueType VT2, SDOperand Op1) { 3152 const MVT::ValueType *VTs = getNodeValueTypes(VT1, VT2); 3153 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 2, &Op1, 1).Val; 3154} 3155SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1, 3156 MVT::ValueType VT2, SDOperand Op1, 3157 SDOperand Op2) { 3158 const MVT::ValueType *VTs = getNodeValueTypes(VT1, VT2); 3159 SDOperand Ops[] = { Op1, Op2 }; 3160 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 2, Ops, 2).Val; 3161} 3162SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1, 3163 MVT::ValueType VT2, SDOperand Op1, 3164 SDOperand Op2, SDOperand Op3) { 3165 const MVT::ValueType *VTs = getNodeValueTypes(VT1, VT2); 3166 SDOperand Ops[] = { Op1, Op2, Op3 }; 3167 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 2, Ops, 3).Val; 3168} 3169SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1, 3170 MVT::ValueType VT2, 3171 const SDOperand *Ops, unsigned NumOps) { 3172 const MVT::ValueType *VTs = getNodeValueTypes(VT1, VT2); 3173 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 2, Ops, NumOps).Val; 3174} 3175SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1, 3176 MVT::ValueType VT2, MVT::ValueType VT3, 3177 SDOperand Op1, SDOperand Op2) { 3178 const MVT::ValueType *VTs = getNodeValueTypes(VT1, VT2, VT3); 3179 SDOperand Ops[] = { Op1, Op2 }; 3180 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 3, Ops, 2).Val; 3181} 3182SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1, 3183 MVT::ValueType VT2, MVT::ValueType VT3, 3184 SDOperand Op1, SDOperand Op2, 3185 SDOperand Op3) { 3186 const MVT::ValueType *VTs = getNodeValueTypes(VT1, VT2, VT3); 3187 SDOperand Ops[] = { Op1, Op2, Op3 }; 3188 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 3, Ops, 3).Val; 3189} 3190SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1, 3191 MVT::ValueType VT2, MVT::ValueType VT3, 3192 const SDOperand *Ops, unsigned NumOps) { 3193 const MVT::ValueType *VTs = getNodeValueTypes(VT1, VT2, VT3); 3194 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 3, Ops, NumOps).Val; 3195} 3196SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1, 3197 MVT::ValueType VT2, MVT::ValueType VT3, 3198 MVT::ValueType VT4, 3199 const SDOperand *Ops, unsigned NumOps) { 3200 std::vector<MVT::ValueType> VTList; 3201 VTList.push_back(VT1); 3202 VTList.push_back(VT2); 3203 VTList.push_back(VT3); 3204 VTList.push_back(VT4); 3205 const MVT::ValueType *VTs = getNodeValueTypes(VTList); 3206 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 4, Ops, NumOps).Val; 3207} 3208SDNode *SelectionDAG::getTargetNode(unsigned Opcode, 3209 std::vector<MVT::ValueType> &ResultTys, 3210 const SDOperand *Ops, unsigned NumOps) { 3211 const MVT::ValueType *VTs = getNodeValueTypes(ResultTys); 3212 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, ResultTys.size(), 3213 Ops, NumOps).Val; 3214} 3215 3216 3217/// ReplaceAllUsesWith - Modify anything using 'From' to use 'To' instead. 3218/// This can cause recursive merging of nodes in the DAG. 3219/// 3220/// This version assumes From has a single result value. 3221/// 3222void SelectionDAG::ReplaceAllUsesWith(SDOperand FromN, SDOperand To, 3223 DAGUpdateListener *UpdateListener) { 3224 SDNode *From = FromN.Val; 3225 assert(From->getNumValues() == 1 && FromN.ResNo == 0 && 3226 "Cannot replace with this method!"); 3227 assert(From != To.Val && "Cannot replace uses of with self"); 3228 3229 while (!From->use_empty()) { 3230 // Process users until they are all gone. 3231 SDNode *U = *From->use_begin(); 3232 3233 // This node is about to morph, remove its old self from the CSE maps. 3234 RemoveNodeFromCSEMaps(U); 3235 3236 for (SDOperand *I = U->OperandList, *E = U->OperandList+U->NumOperands; 3237 I != E; ++I) 3238 if (I->Val == From) { 3239 From->removeUser(U); 3240 *I = To; 3241 To.Val->addUser(U); 3242 } 3243 3244 // Now that we have modified U, add it back to the CSE maps. If it already 3245 // exists there, recursively merge the results together. 3246 if (SDNode *Existing = AddNonLeafNodeToCSEMaps(U)) { 3247 ReplaceAllUsesWith(U, Existing, UpdateListener); 3248 // U is now dead. Inform the listener if it exists and delete it. 3249 if (UpdateListener) 3250 UpdateListener->NodeDeleted(U); 3251 DeleteNodeNotInCSEMaps(U); 3252 } else { 3253 // If the node doesn't already exist, we updated it. Inform a listener if 3254 // it exists. 3255 if (UpdateListener) 3256 UpdateListener->NodeUpdated(U); 3257 } 3258 } 3259} 3260 3261/// ReplaceAllUsesWith - Modify anything using 'From' to use 'To' instead. 3262/// This can cause recursive merging of nodes in the DAG. 3263/// 3264/// This version assumes From/To have matching types and numbers of result 3265/// values. 3266/// 3267void SelectionDAG::ReplaceAllUsesWith(SDNode *From, SDNode *To, 3268 DAGUpdateListener *UpdateListener) { 3269 assert(From != To && "Cannot replace uses of with self"); 3270 assert(From->getNumValues() == To->getNumValues() && 3271 "Cannot use this version of ReplaceAllUsesWith!"); 3272 if (From->getNumValues() == 1) // If possible, use the faster version. 3273 return ReplaceAllUsesWith(SDOperand(From, 0), SDOperand(To, 0), 3274 UpdateListener); 3275 3276 while (!From->use_empty()) { 3277 // Process users until they are all gone. 3278 SDNode *U = *From->use_begin(); 3279 3280 // This node is about to morph, remove its old self from the CSE maps. 3281 RemoveNodeFromCSEMaps(U); 3282 3283 for (SDOperand *I = U->OperandList, *E = U->OperandList+U->NumOperands; 3284 I != E; ++I) 3285 if (I->Val == From) { 3286 From->removeUser(U); 3287 I->Val = To; 3288 To->addUser(U); 3289 } 3290 3291 // Now that we have modified U, add it back to the CSE maps. If it already 3292 // exists there, recursively merge the results together. 3293 if (SDNode *Existing = AddNonLeafNodeToCSEMaps(U)) { 3294 ReplaceAllUsesWith(U, Existing, UpdateListener); 3295 // U is now dead. Inform the listener if it exists and delete it. 3296 if (UpdateListener) 3297 UpdateListener->NodeDeleted(U); 3298 DeleteNodeNotInCSEMaps(U); 3299 } else { 3300 // If the node doesn't already exist, we updated it. Inform a listener if 3301 // it exists. 3302 if (UpdateListener) 3303 UpdateListener->NodeUpdated(U); 3304 } 3305 } 3306} 3307 3308/// ReplaceAllUsesWith - Modify anything using 'From' to use 'To' instead. 3309/// This can cause recursive merging of nodes in the DAG. 3310/// 3311/// This version can replace From with any result values. To must match the 3312/// number and types of values returned by From. 3313void SelectionDAG::ReplaceAllUsesWith(SDNode *From, 3314 const SDOperand *To, 3315 DAGUpdateListener *UpdateListener) { 3316 if (From->getNumValues() == 1) // Handle the simple case efficiently. 3317 return ReplaceAllUsesWith(SDOperand(From, 0), To[0], UpdateListener); 3318 3319 while (!From->use_empty()) { 3320 // Process users until they are all gone. 3321 SDNode *U = *From->use_begin(); 3322 3323 // This node is about to morph, remove its old self from the CSE maps. 3324 RemoveNodeFromCSEMaps(U); 3325 3326 for (SDOperand *I = U->OperandList, *E = U->OperandList+U->NumOperands; 3327 I != E; ++I) 3328 if (I->Val == From) { 3329 const SDOperand &ToOp = To[I->ResNo]; 3330 From->removeUser(U); 3331 *I = ToOp; 3332 ToOp.Val->addUser(U); 3333 } 3334 3335 // Now that we have modified U, add it back to the CSE maps. If it already 3336 // exists there, recursively merge the results together. 3337 if (SDNode *Existing = AddNonLeafNodeToCSEMaps(U)) { 3338 ReplaceAllUsesWith(U, Existing, UpdateListener); 3339 // U is now dead. Inform the listener if it exists and delete it. 3340 if (UpdateListener) 3341 UpdateListener->NodeDeleted(U); 3342 DeleteNodeNotInCSEMaps(U); 3343 } else { 3344 // If the node doesn't already exist, we updated it. Inform a listener if 3345 // it exists. 3346 if (UpdateListener) 3347 UpdateListener->NodeUpdated(U); 3348 } 3349 } 3350} 3351 3352namespace { 3353 /// ChainedSetUpdaterListener - This class is a DAGUpdateListener that removes 3354 /// any deleted nodes from the set passed into its constructor and recursively 3355 /// notifies another update listener if specified. 3356 class ChainedSetUpdaterListener : 3357 public SelectionDAG::DAGUpdateListener { 3358 SmallSetVector<SDNode*, 16> &Set; 3359 SelectionDAG::DAGUpdateListener *Chain; 3360 public: 3361 ChainedSetUpdaterListener(SmallSetVector<SDNode*, 16> &set, 3362 SelectionDAG::DAGUpdateListener *chain) 3363 : Set(set), Chain(chain) {} 3364 3365 virtual void NodeDeleted(SDNode *N) { 3366 Set.remove(N); 3367 if (Chain) Chain->NodeDeleted(N); 3368 } 3369 virtual void NodeUpdated(SDNode *N) { 3370 if (Chain) Chain->NodeUpdated(N); 3371 } 3372 }; 3373} 3374 3375/// ReplaceAllUsesOfValueWith - Replace any uses of From with To, leaving 3376/// uses of other values produced by From.Val alone. The Deleted vector is 3377/// handled the same way as for ReplaceAllUsesWith. 3378void SelectionDAG::ReplaceAllUsesOfValueWith(SDOperand From, SDOperand To, 3379 DAGUpdateListener *UpdateListener){ 3380 assert(From != To && "Cannot replace a value with itself"); 3381 3382 // Handle the simple, trivial, case efficiently. 3383 if (From.Val->getNumValues() == 1) { 3384 ReplaceAllUsesWith(From, To, UpdateListener); 3385 return; 3386 } 3387 3388 if (From.use_empty()) return; 3389 3390 // Get all of the users of From.Val. We want these in a nice, 3391 // deterministically ordered and uniqued set, so we use a SmallSetVector. 3392 SmallSetVector<SDNode*, 16> Users(From.Val->use_begin(), From.Val->use_end()); 3393 3394 // When one of the recursive merges deletes nodes from the graph, we need to 3395 // make sure that UpdateListener is notified *and* that the node is removed 3396 // from Users if present. CSUL does this. 3397 ChainedSetUpdaterListener CSUL(Users, UpdateListener); 3398 3399 while (!Users.empty()) { 3400 // We know that this user uses some value of From. If it is the right 3401 // value, update it. 3402 SDNode *User = Users.back(); 3403 Users.pop_back(); 3404 3405 // Scan for an operand that matches From. 3406 SDOperand *Op = User->OperandList, *E = User->OperandList+User->NumOperands; 3407 for (; Op != E; ++Op) 3408 if (*Op == From) break; 3409 3410 // If there are no matches, the user must use some other result of From. 3411 if (Op == E) continue; 3412 3413 // Okay, we know this user needs to be updated. Remove its old self 3414 // from the CSE maps. 3415 RemoveNodeFromCSEMaps(User); 3416 3417 // Update all operands that match "From" in case there are multiple uses. 3418 for (; Op != E; ++Op) { 3419 if (*Op == From) { 3420 From.Val->removeUser(User); 3421 *Op = To; 3422 To.Val->addUser(User); 3423 } 3424 } 3425 3426 // Now that we have modified User, add it back to the CSE maps. If it 3427 // already exists there, recursively merge the results together. 3428 SDNode *Existing = AddNonLeafNodeToCSEMaps(User); 3429 if (!Existing) { 3430 if (UpdateListener) UpdateListener->NodeUpdated(User); 3431 continue; // Continue on to next user. 3432 } 3433 3434 // If there was already an existing matching node, use ReplaceAllUsesWith 3435 // to replace the dead one with the existing one. This can cause 3436 // recursive merging of other unrelated nodes down the line. The merging 3437 // can cause deletion of nodes that used the old value. To handle this, we 3438 // use CSUL to remove them from the Users set. 3439 ReplaceAllUsesWith(User, Existing, &CSUL); 3440 3441 // User is now dead. Notify a listener if present. 3442 if (UpdateListener) UpdateListener->NodeDeleted(User); 3443 DeleteNodeNotInCSEMaps(User); 3444 } 3445} 3446 3447 3448/// AssignNodeIds - Assign a unique node id for each node in the DAG based on 3449/// their allnodes order. It returns the maximum id. 3450unsigned SelectionDAG::AssignNodeIds() { 3451 unsigned Id = 0; 3452 for (allnodes_iterator I = allnodes_begin(), E = allnodes_end(); I != E; ++I){ 3453 SDNode *N = I; 3454 N->setNodeId(Id++); 3455 } 3456 return Id; 3457} 3458 3459/// AssignTopologicalOrder - Assign a unique node id for each node in the DAG 3460/// based on their topological order. It returns the maximum id and a vector 3461/// of the SDNodes* in assigned order by reference. 3462unsigned SelectionDAG::AssignTopologicalOrder(std::vector<SDNode*> &TopOrder) { 3463 unsigned DAGSize = AllNodes.size(); 3464 std::vector<unsigned> InDegree(DAGSize); 3465 std::vector<SDNode*> Sources; 3466 3467 // Use a two pass approach to avoid using a std::map which is slow. 3468 unsigned Id = 0; 3469 for (allnodes_iterator I = allnodes_begin(),E = allnodes_end(); I != E; ++I){ 3470 SDNode *N = I; 3471 N->setNodeId(Id++); 3472 unsigned Degree = N->use_size(); 3473 InDegree[N->getNodeId()] = Degree; 3474 if (Degree == 0) 3475 Sources.push_back(N); 3476 } 3477 3478 TopOrder.clear(); 3479 while (!Sources.empty()) { 3480 SDNode *N = Sources.back(); 3481 Sources.pop_back(); 3482 TopOrder.push_back(N); 3483 for (SDNode::op_iterator I = N->op_begin(), E = N->op_end(); I != E; ++I) { 3484 SDNode *P = I->Val; 3485 unsigned Degree = --InDegree[P->getNodeId()]; 3486 if (Degree == 0) 3487 Sources.push_back(P); 3488 } 3489 } 3490 3491 // Second pass, assign the actual topological order as node ids. 3492 Id = 0; 3493 for (std::vector<SDNode*>::iterator TI = TopOrder.begin(),TE = TopOrder.end(); 3494 TI != TE; ++TI) 3495 (*TI)->setNodeId(Id++); 3496 3497 return Id; 3498} 3499 3500 3501 3502//===----------------------------------------------------------------------===// 3503// SDNode Class 3504//===----------------------------------------------------------------------===// 3505 3506// Out-of-line virtual method to give class a home. 3507void SDNode::ANCHOR() {} 3508void UnarySDNode::ANCHOR() {} 3509void BinarySDNode::ANCHOR() {} 3510void TernarySDNode::ANCHOR() {} 3511void HandleSDNode::ANCHOR() {} 3512void StringSDNode::ANCHOR() {} 3513void ConstantSDNode::ANCHOR() {} 3514void ConstantFPSDNode::ANCHOR() {} 3515void GlobalAddressSDNode::ANCHOR() {} 3516void FrameIndexSDNode::ANCHOR() {} 3517void JumpTableSDNode::ANCHOR() {} 3518void ConstantPoolSDNode::ANCHOR() {} 3519void BasicBlockSDNode::ANCHOR() {} 3520void SrcValueSDNode::ANCHOR() {} 3521void MemOperandSDNode::ANCHOR() {} 3522void RegisterSDNode::ANCHOR() {} 3523void ExternalSymbolSDNode::ANCHOR() {} 3524void CondCodeSDNode::ANCHOR() {} 3525void VTSDNode::ANCHOR() {} 3526void LoadSDNode::ANCHOR() {} 3527void StoreSDNode::ANCHOR() {} 3528 3529HandleSDNode::~HandleSDNode() { 3530 SDVTList VTs = { 0, 0 }; 3531 MorphNodeTo(ISD::HANDLENODE, VTs, 0, 0); // Drops operand uses. 3532} 3533 3534GlobalAddressSDNode::GlobalAddressSDNode(bool isTarget, const GlobalValue *GA, 3535 MVT::ValueType VT, int o) 3536 : SDNode(isa<GlobalVariable>(GA) && 3537 cast<GlobalVariable>(GA)->isThreadLocal() ? 3538 // Thread Local 3539 (isTarget ? ISD::TargetGlobalTLSAddress : ISD::GlobalTLSAddress) : 3540 // Non Thread Local 3541 (isTarget ? ISD::TargetGlobalAddress : ISD::GlobalAddress), 3542 getSDVTList(VT)), Offset(o) { 3543 TheGlobal = const_cast<GlobalValue*>(GA); 3544} 3545 3546/// getMemOperand - Return a MemOperand object describing the memory 3547/// reference performed by this load or store. 3548MemOperand LSBaseSDNode::getMemOperand() const { 3549 int Size = (MVT::getSizeInBits(getMemoryVT()) + 7) >> 3; 3550 int Flags = 3551 getOpcode() == ISD::LOAD ? MemOperand::MOLoad : MemOperand::MOStore; 3552 if (IsVolatile) Flags |= MemOperand::MOVolatile; 3553 3554 // Check if the load references a frame index, and does not have 3555 // an SV attached. 3556 const FrameIndexSDNode *FI = 3557 dyn_cast<const FrameIndexSDNode>(getBasePtr().Val); 3558 if (!getSrcValue() && FI) 3559 return MemOperand(PseudoSourceValue::getFixedStack(), Flags, 3560 FI->getIndex(), Size, Alignment); 3561 else 3562 return MemOperand(getSrcValue(), Flags, 3563 getSrcValueOffset(), Size, Alignment); 3564} 3565 3566/// Profile - Gather unique data for the node. 3567/// 3568void SDNode::Profile(FoldingSetNodeID &ID) { 3569 AddNodeIDNode(ID, this); 3570} 3571 3572/// getValueTypeList - Return a pointer to the specified value type. 3573/// 3574const MVT::ValueType *SDNode::getValueTypeList(MVT::ValueType VT) { 3575 if (MVT::isExtendedVT(VT)) { 3576 static std::set<MVT::ValueType> EVTs; 3577 return &(*EVTs.insert(VT).first); 3578 } else { 3579 static MVT::ValueType VTs[MVT::LAST_VALUETYPE]; 3580 VTs[VT] = VT; 3581 return &VTs[VT]; 3582 } 3583} 3584 3585/// hasNUsesOfValue - Return true if there are exactly NUSES uses of the 3586/// indicated value. This method ignores uses of other values defined by this 3587/// operation. 3588bool SDNode::hasNUsesOfValue(unsigned NUses, unsigned Value) const { 3589 assert(Value < getNumValues() && "Bad value!"); 3590 3591 // If there is only one value, this is easy. 3592 if (getNumValues() == 1) 3593 return use_size() == NUses; 3594 if (use_size() < NUses) return false; 3595 3596 SDOperand TheValue(const_cast<SDNode *>(this), Value); 3597 3598 SmallPtrSet<SDNode*, 32> UsersHandled; 3599 3600 for (SDNode::use_iterator UI = Uses.begin(), E = Uses.end(); UI != E; ++UI) { 3601 SDNode *User = *UI; 3602 if (User->getNumOperands() == 1 || 3603 UsersHandled.insert(User)) // First time we've seen this? 3604 for (unsigned i = 0, e = User->getNumOperands(); i != e; ++i) 3605 if (User->getOperand(i) == TheValue) { 3606 if (NUses == 0) 3607 return false; // too many uses 3608 --NUses; 3609 } 3610 } 3611 3612 // Found exactly the right number of uses? 3613 return NUses == 0; 3614} 3615 3616 3617/// hasAnyUseOfValue - Return true if there are any use of the indicated 3618/// value. This method ignores uses of other values defined by this operation. 3619bool SDNode::hasAnyUseOfValue(unsigned Value) const { 3620 assert(Value < getNumValues() && "Bad value!"); 3621 3622 if (use_empty()) return false; 3623 3624 SDOperand TheValue(const_cast<SDNode *>(this), Value); 3625 3626 SmallPtrSet<SDNode*, 32> UsersHandled; 3627 3628 for (SDNode::use_iterator UI = Uses.begin(), E = Uses.end(); UI != E; ++UI) { 3629 SDNode *User = *UI; 3630 if (User->getNumOperands() == 1 || 3631 UsersHandled.insert(User)) // First time we've seen this? 3632 for (unsigned i = 0, e = User->getNumOperands(); i != e; ++i) 3633 if (User->getOperand(i) == TheValue) { 3634 return true; 3635 } 3636 } 3637 3638 return false; 3639} 3640 3641 3642/// isOnlyUse - Return true if this node is the only use of N. 3643/// 3644bool SDNode::isOnlyUse(SDNode *N) const { 3645 bool Seen = false; 3646 for (SDNode::use_iterator I = N->use_begin(), E = N->use_end(); I != E; ++I) { 3647 SDNode *User = *I; 3648 if (User == this) 3649 Seen = true; 3650 else 3651 return false; 3652 } 3653 3654 return Seen; 3655} 3656 3657/// isOperand - Return true if this node is an operand of N. 3658/// 3659bool SDOperand::isOperand(SDNode *N) const { 3660 for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i) 3661 if (*this == N->getOperand(i)) 3662 return true; 3663 return false; 3664} 3665 3666bool SDNode::isOperand(SDNode *N) const { 3667 for (unsigned i = 0, e = N->NumOperands; i != e; ++i) 3668 if (this == N->OperandList[i].Val) 3669 return true; 3670 return false; 3671} 3672 3673/// reachesChainWithoutSideEffects - Return true if this operand (which must 3674/// be a chain) reaches the specified operand without crossing any 3675/// side-effecting instructions. In practice, this looks through token 3676/// factors and non-volatile loads. In order to remain efficient, this only 3677/// looks a couple of nodes in, it does not do an exhaustive search. 3678bool SDOperand::reachesChainWithoutSideEffects(SDOperand Dest, 3679 unsigned Depth) const { 3680 if (*this == Dest) return true; 3681 3682 // Don't search too deeply, we just want to be able to see through 3683 // TokenFactor's etc. 3684 if (Depth == 0) return false; 3685 3686 // If this is a token factor, all inputs to the TF happen in parallel. If any 3687 // of the operands of the TF reach dest, then we can do the xform. 3688 if (getOpcode() == ISD::TokenFactor) { 3689 for (unsigned i = 0, e = getNumOperands(); i != e; ++i) 3690 if (getOperand(i).reachesChainWithoutSideEffects(Dest, Depth-1)) 3691 return true; 3692 return false; 3693 } 3694 3695 // Loads don't have side effects, look through them. 3696 if (LoadSDNode *Ld = dyn_cast<LoadSDNode>(*this)) { 3697 if (!Ld->isVolatile()) 3698 return Ld->getChain().reachesChainWithoutSideEffects(Dest, Depth-1); 3699 } 3700 return false; 3701} 3702 3703 3704static void findPredecessor(SDNode *N, const SDNode *P, bool &found, 3705 SmallPtrSet<SDNode *, 32> &Visited) { 3706 if (found || !Visited.insert(N)) 3707 return; 3708 3709 for (unsigned i = 0, e = N->getNumOperands(); !found && i != e; ++i) { 3710 SDNode *Op = N->getOperand(i).Val; 3711 if (Op == P) { 3712 found = true; 3713 return; 3714 } 3715 findPredecessor(Op, P, found, Visited); 3716 } 3717} 3718 3719/// isPredecessor - Return true if this node is a predecessor of N. This node 3720/// is either an operand of N or it can be reached by recursively traversing 3721/// up the operands. 3722/// NOTE: this is an expensive method. Use it carefully. 3723bool SDNode::isPredecessor(SDNode *N) const { 3724 SmallPtrSet<SDNode *, 32> Visited; 3725 bool found = false; 3726 findPredecessor(N, this, found, Visited); 3727 return found; 3728} 3729 3730uint64_t SDNode::getConstantOperandVal(unsigned Num) const { 3731 assert(Num < NumOperands && "Invalid child # of SDNode!"); 3732 return cast<ConstantSDNode>(OperandList[Num])->getValue(); 3733} 3734 3735std::string SDNode::getOperationName(const SelectionDAG *G) const { 3736 switch (getOpcode()) { 3737 default: 3738 if (getOpcode() < ISD::BUILTIN_OP_END) 3739 return "<<Unknown DAG Node>>"; 3740 else { 3741 if (G) { 3742 if (const TargetInstrInfo *TII = G->getTarget().getInstrInfo()) 3743 if (getOpcode()-ISD::BUILTIN_OP_END < TII->getNumOpcodes()) 3744 return TII->get(getOpcode()-ISD::BUILTIN_OP_END).getName(); 3745 3746 TargetLowering &TLI = G->getTargetLoweringInfo(); 3747 const char *Name = 3748 TLI.getTargetNodeName(getOpcode()); 3749 if (Name) return Name; 3750 } 3751 3752 return "<<Unknown Target Node>>"; 3753 } 3754 3755 case ISD::PCMARKER: return "PCMarker"; 3756 case ISD::READCYCLECOUNTER: return "ReadCycleCounter"; 3757 case ISD::SRCVALUE: return "SrcValue"; 3758 case ISD::MEMOPERAND: return "MemOperand"; 3759 case ISD::EntryToken: return "EntryToken"; 3760 case ISD::TokenFactor: return "TokenFactor"; 3761 case ISD::AssertSext: return "AssertSext"; 3762 case ISD::AssertZext: return "AssertZext"; 3763 3764 case ISD::STRING: return "String"; 3765 case ISD::BasicBlock: return "BasicBlock"; 3766 case ISD::VALUETYPE: return "ValueType"; 3767 case ISD::Register: return "Register"; 3768 3769 case ISD::Constant: return "Constant"; 3770 case ISD::ConstantFP: return "ConstantFP"; 3771 case ISD::GlobalAddress: return "GlobalAddress"; 3772 case ISD::GlobalTLSAddress: return "GlobalTLSAddress"; 3773 case ISD::FrameIndex: return "FrameIndex"; 3774 case ISD::JumpTable: return "JumpTable"; 3775 case ISD::GLOBAL_OFFSET_TABLE: return "GLOBAL_OFFSET_TABLE"; 3776 case ISD::RETURNADDR: return "RETURNADDR"; 3777 case ISD::FRAMEADDR: return "FRAMEADDR"; 3778 case ISD::FRAME_TO_ARGS_OFFSET: return "FRAME_TO_ARGS_OFFSET"; 3779 case ISD::EXCEPTIONADDR: return "EXCEPTIONADDR"; 3780 case ISD::EHSELECTION: return "EHSELECTION"; 3781 case ISD::EH_RETURN: return "EH_RETURN"; 3782 case ISD::ConstantPool: return "ConstantPool"; 3783 case ISD::ExternalSymbol: return "ExternalSymbol"; 3784 case ISD::INTRINSIC_WO_CHAIN: { 3785 unsigned IID = cast<ConstantSDNode>(getOperand(0))->getValue(); 3786 return Intrinsic::getName((Intrinsic::ID)IID); 3787 } 3788 case ISD::INTRINSIC_VOID: 3789 case ISD::INTRINSIC_W_CHAIN: { 3790 unsigned IID = cast<ConstantSDNode>(getOperand(1))->getValue(); 3791 return Intrinsic::getName((Intrinsic::ID)IID); 3792 } 3793 3794 case ISD::BUILD_VECTOR: return "BUILD_VECTOR"; 3795 case ISD::TargetConstant: return "TargetConstant"; 3796 case ISD::TargetConstantFP:return "TargetConstantFP"; 3797 case ISD::TargetGlobalAddress: return "TargetGlobalAddress"; 3798 case ISD::TargetGlobalTLSAddress: return "TargetGlobalTLSAddress"; 3799 case ISD::TargetFrameIndex: return "TargetFrameIndex"; 3800 case ISD::TargetJumpTable: return "TargetJumpTable"; 3801 case ISD::TargetConstantPool: return "TargetConstantPool"; 3802 case ISD::TargetExternalSymbol: return "TargetExternalSymbol"; 3803 3804 case ISD::CopyToReg: return "CopyToReg"; 3805 case ISD::CopyFromReg: return "CopyFromReg"; 3806 case ISD::UNDEF: return "undef"; 3807 case ISD::MERGE_VALUES: return "merge_values"; 3808 case ISD::INLINEASM: return "inlineasm"; 3809 case ISD::LABEL: return "label"; 3810 case ISD::DECLARE: return "declare"; 3811 case ISD::HANDLENODE: return "handlenode"; 3812 case ISD::FORMAL_ARGUMENTS: return "formal_arguments"; 3813 case ISD::CALL: return "call"; 3814 3815 // Unary operators 3816 case ISD::FABS: return "fabs"; 3817 case ISD::FNEG: return "fneg"; 3818 case ISD::FSQRT: return "fsqrt"; 3819 case ISD::FSIN: return "fsin"; 3820 case ISD::FCOS: return "fcos"; 3821 case ISD::FPOWI: return "fpowi"; 3822 case ISD::FPOW: return "fpow"; 3823 3824 // Binary operators 3825 case ISD::ADD: return "add"; 3826 case ISD::SUB: return "sub"; 3827 case ISD::MUL: return "mul"; 3828 case ISD::MULHU: return "mulhu"; 3829 case ISD::MULHS: return "mulhs"; 3830 case ISD::SDIV: return "sdiv"; 3831 case ISD::UDIV: return "udiv"; 3832 case ISD::SREM: return "srem"; 3833 case ISD::UREM: return "urem"; 3834 case ISD::SMUL_LOHI: return "smul_lohi"; 3835 case ISD::UMUL_LOHI: return "umul_lohi"; 3836 case ISD::SDIVREM: return "sdivrem"; 3837 case ISD::UDIVREM: return "divrem"; 3838 case ISD::AND: return "and"; 3839 case ISD::OR: return "or"; 3840 case ISD::XOR: return "xor"; 3841 case ISD::SHL: return "shl"; 3842 case ISD::SRA: return "sra"; 3843 case ISD::SRL: return "srl"; 3844 case ISD::ROTL: return "rotl"; 3845 case ISD::ROTR: return "rotr"; 3846 case ISD::FADD: return "fadd"; 3847 case ISD::FSUB: return "fsub"; 3848 case ISD::FMUL: return "fmul"; 3849 case ISD::FDIV: return "fdiv"; 3850 case ISD::FREM: return "frem"; 3851 case ISD::FCOPYSIGN: return "fcopysign"; 3852 case ISD::FGETSIGN: return "fgetsign"; 3853 3854 case ISD::SETCC: return "setcc"; 3855 case ISD::SELECT: return "select"; 3856 case ISD::SELECT_CC: return "select_cc"; 3857 case ISD::INSERT_VECTOR_ELT: return "insert_vector_elt"; 3858 case ISD::EXTRACT_VECTOR_ELT: return "extract_vector_elt"; 3859 case ISD::CONCAT_VECTORS: return "concat_vectors"; 3860 case ISD::EXTRACT_SUBVECTOR: return "extract_subvector"; 3861 case ISD::SCALAR_TO_VECTOR: return "scalar_to_vector"; 3862 case ISD::VECTOR_SHUFFLE: return "vector_shuffle"; 3863 case ISD::CARRY_FALSE: return "carry_false"; 3864 case ISD::ADDC: return "addc"; 3865 case ISD::ADDE: return "adde"; 3866 case ISD::SUBC: return "subc"; 3867 case ISD::SUBE: return "sube"; 3868 case ISD::SHL_PARTS: return "shl_parts"; 3869 case ISD::SRA_PARTS: return "sra_parts"; 3870 case ISD::SRL_PARTS: return "srl_parts"; 3871 3872 case ISD::EXTRACT_SUBREG: return "extract_subreg"; 3873 case ISD::INSERT_SUBREG: return "insert_subreg"; 3874 3875 // Conversion operators. 3876 case ISD::SIGN_EXTEND: return "sign_extend"; 3877 case ISD::ZERO_EXTEND: return "zero_extend"; 3878 case ISD::ANY_EXTEND: return "any_extend"; 3879 case ISD::SIGN_EXTEND_INREG: return "sign_extend_inreg"; 3880 case ISD::TRUNCATE: return "truncate"; 3881 case ISD::FP_ROUND: return "fp_round"; 3882 case ISD::FLT_ROUNDS_: return "flt_rounds"; 3883 case ISD::FP_ROUND_INREG: return "fp_round_inreg"; 3884 case ISD::FP_EXTEND: return "fp_extend"; 3885 3886 case ISD::SINT_TO_FP: return "sint_to_fp"; 3887 case ISD::UINT_TO_FP: return "uint_to_fp"; 3888 case ISD::FP_TO_SINT: return "fp_to_sint"; 3889 case ISD::FP_TO_UINT: return "fp_to_uint"; 3890 case ISD::BIT_CONVERT: return "bit_convert"; 3891 3892 // Control flow instructions 3893 case ISD::BR: return "br"; 3894 case ISD::BRIND: return "brind"; 3895 case ISD::BR_JT: return "br_jt"; 3896 case ISD::BRCOND: return "brcond"; 3897 case ISD::BR_CC: return "br_cc"; 3898 case ISD::RET: return "ret"; 3899 case ISD::CALLSEQ_START: return "callseq_start"; 3900 case ISD::CALLSEQ_END: return "callseq_end"; 3901 3902 // Other operators 3903 case ISD::LOAD: return "load"; 3904 case ISD::STORE: return "store"; 3905 case ISD::VAARG: return "vaarg"; 3906 case ISD::VACOPY: return "vacopy"; 3907 case ISD::VAEND: return "vaend"; 3908 case ISD::VASTART: return "vastart"; 3909 case ISD::DYNAMIC_STACKALLOC: return "dynamic_stackalloc"; 3910 case ISD::EXTRACT_ELEMENT: return "extract_element"; 3911 case ISD::BUILD_PAIR: return "build_pair"; 3912 case ISD::STACKSAVE: return "stacksave"; 3913 case ISD::STACKRESTORE: return "stackrestore"; 3914 case ISD::TRAP: return "trap"; 3915 3916 // Block memory operations. 3917 case ISD::MEMSET: return "memset"; 3918 case ISD::MEMCPY: return "memcpy"; 3919 case ISD::MEMMOVE: return "memmove"; 3920 3921 // Bit manipulation 3922 case ISD::BSWAP: return "bswap"; 3923 case ISD::CTPOP: return "ctpop"; 3924 case ISD::CTTZ: return "cttz"; 3925 case ISD::CTLZ: return "ctlz"; 3926 3927 // Debug info 3928 case ISD::LOCATION: return "location"; 3929 case ISD::DEBUG_LOC: return "debug_loc"; 3930 3931 // Trampolines 3932 case ISD::TRAMPOLINE: return "trampoline"; 3933 3934 case ISD::CONDCODE: 3935 switch (cast<CondCodeSDNode>(this)->get()) { 3936 default: assert(0 && "Unknown setcc condition!"); 3937 case ISD::SETOEQ: return "setoeq"; 3938 case ISD::SETOGT: return "setogt"; 3939 case ISD::SETOGE: return "setoge"; 3940 case ISD::SETOLT: return "setolt"; 3941 case ISD::SETOLE: return "setole"; 3942 case ISD::SETONE: return "setone"; 3943 3944 case ISD::SETO: return "seto"; 3945 case ISD::SETUO: return "setuo"; 3946 case ISD::SETUEQ: return "setue"; 3947 case ISD::SETUGT: return "setugt"; 3948 case ISD::SETUGE: return "setuge"; 3949 case ISD::SETULT: return "setult"; 3950 case ISD::SETULE: return "setule"; 3951 case ISD::SETUNE: return "setune"; 3952 3953 case ISD::SETEQ: return "seteq"; 3954 case ISD::SETGT: return "setgt"; 3955 case ISD::SETGE: return "setge"; 3956 case ISD::SETLT: return "setlt"; 3957 case ISD::SETLE: return "setle"; 3958 case ISD::SETNE: return "setne"; 3959 } 3960 } 3961} 3962 3963const char *SDNode::getIndexedModeName(ISD::MemIndexedMode AM) { 3964 switch (AM) { 3965 default: 3966 return ""; 3967 case ISD::PRE_INC: 3968 return "<pre-inc>"; 3969 case ISD::PRE_DEC: 3970 return "<pre-dec>"; 3971 case ISD::POST_INC: 3972 return "<post-inc>"; 3973 case ISD::POST_DEC: 3974 return "<post-dec>"; 3975 } 3976} 3977 3978void SDNode::dump() const { dump(0); } 3979void SDNode::dump(const SelectionDAG *G) const { 3980 cerr << (void*)this << ": "; 3981 3982 for (unsigned i = 0, e = getNumValues(); i != e; ++i) { 3983 if (i) cerr << ","; 3984 if (getValueType(i) == MVT::Other) 3985 cerr << "ch"; 3986 else 3987 cerr << MVT::getValueTypeString(getValueType(i)); 3988 } 3989 cerr << " = " << getOperationName(G); 3990 3991 cerr << " "; 3992 for (unsigned i = 0, e = getNumOperands(); i != e; ++i) { 3993 if (i) cerr << ", "; 3994 cerr << (void*)getOperand(i).Val; 3995 if (unsigned RN = getOperand(i).ResNo) 3996 cerr << ":" << RN; 3997 } 3998 3999 if (!isTargetOpcode() && getOpcode() == ISD::VECTOR_SHUFFLE) { 4000 SDNode *Mask = getOperand(2).Val; 4001 cerr << "<"; 4002 for (unsigned i = 0, e = Mask->getNumOperands(); i != e; ++i) { 4003 if (i) cerr << ","; 4004 if (Mask->getOperand(i).getOpcode() == ISD::UNDEF) 4005 cerr << "u"; 4006 else 4007 cerr << cast<ConstantSDNode>(Mask->getOperand(i))->getValue(); 4008 } 4009 cerr << ">"; 4010 } 4011 4012 if (const ConstantSDNode *CSDN = dyn_cast<ConstantSDNode>(this)) { 4013 cerr << "<" << CSDN->getValue() << ">"; 4014 } else if (const ConstantFPSDNode *CSDN = dyn_cast<ConstantFPSDNode>(this)) { 4015 if (&CSDN->getValueAPF().getSemantics()==&APFloat::IEEEsingle) 4016 cerr << "<" << CSDN->getValueAPF().convertToFloat() << ">"; 4017 else if (&CSDN->getValueAPF().getSemantics()==&APFloat::IEEEdouble) 4018 cerr << "<" << CSDN->getValueAPF().convertToDouble() << ">"; 4019 else { 4020 cerr << "<APFloat("; 4021 CSDN->getValueAPF().convertToAPInt().dump(); 4022 cerr << ")>"; 4023 } 4024 } else if (const GlobalAddressSDNode *GADN = 4025 dyn_cast<GlobalAddressSDNode>(this)) { 4026 int offset = GADN->getOffset(); 4027 cerr << "<"; 4028 WriteAsOperand(*cerr.stream(), GADN->getGlobal()) << ">"; 4029 if (offset > 0) 4030 cerr << " + " << offset; 4031 else 4032 cerr << " " << offset; 4033 } else if (const FrameIndexSDNode *FIDN = dyn_cast<FrameIndexSDNode>(this)) { 4034 cerr << "<" << FIDN->getIndex() << ">"; 4035 } else if (const JumpTableSDNode *JTDN = dyn_cast<JumpTableSDNode>(this)) { 4036 cerr << "<" << JTDN->getIndex() << ">"; 4037 } else if (const ConstantPoolSDNode *CP = dyn_cast<ConstantPoolSDNode>(this)){ 4038 int offset = CP->getOffset(); 4039 if (CP->isMachineConstantPoolEntry()) 4040 cerr << "<" << *CP->getMachineCPVal() << ">"; 4041 else 4042 cerr << "<" << *CP->getConstVal() << ">"; 4043 if (offset > 0) 4044 cerr << " + " << offset; 4045 else 4046 cerr << " " << offset; 4047 } else if (const BasicBlockSDNode *BBDN = dyn_cast<BasicBlockSDNode>(this)) { 4048 cerr << "<"; 4049 const Value *LBB = (const Value*)BBDN->getBasicBlock()->getBasicBlock(); 4050 if (LBB) 4051 cerr << LBB->getName() << " "; 4052 cerr << (const void*)BBDN->getBasicBlock() << ">"; 4053 } else if (const RegisterSDNode *R = dyn_cast<RegisterSDNode>(this)) { 4054 if (G && R->getReg() && 4055 TargetRegisterInfo::isPhysicalRegister(R->getReg())) { 4056 cerr << " " <<G->getTarget().getRegisterInfo()->getName(R->getReg()); 4057 } else { 4058 cerr << " #" << R->getReg(); 4059 } 4060 } else if (const ExternalSymbolSDNode *ES = 4061 dyn_cast<ExternalSymbolSDNode>(this)) { 4062 cerr << "'" << ES->getSymbol() << "'"; 4063 } else if (const SrcValueSDNode *M = dyn_cast<SrcValueSDNode>(this)) { 4064 if (M->getValue()) 4065 cerr << "<" << M->getValue() << ">"; 4066 else 4067 cerr << "<null>"; 4068 } else if (const MemOperandSDNode *M = dyn_cast<MemOperandSDNode>(this)) { 4069 if (M->MO.getValue()) 4070 cerr << "<" << M->MO.getValue() << ":" << M->MO.getOffset() << ">"; 4071 else 4072 cerr << "<null:" << M->MO.getOffset() << ">"; 4073 } else if (const VTSDNode *N = dyn_cast<VTSDNode>(this)) { 4074 cerr << ":" << MVT::getValueTypeString(N->getVT()); 4075 } else if (const LoadSDNode *LD = dyn_cast<LoadSDNode>(this)) { 4076 const Value *SrcValue = LD->getSrcValue(); 4077 int SrcOffset = LD->getSrcValueOffset(); 4078 cerr << " <"; 4079 if (SrcValue) 4080 cerr << SrcValue; 4081 else 4082 cerr << "null"; 4083 cerr << ":" << SrcOffset << ">"; 4084 4085 bool doExt = true; 4086 switch (LD->getExtensionType()) { 4087 default: doExt = false; break; 4088 case ISD::EXTLOAD: 4089 cerr << " <anyext "; 4090 break; 4091 case ISD::SEXTLOAD: 4092 cerr << " <sext "; 4093 break; 4094 case ISD::ZEXTLOAD: 4095 cerr << " <zext "; 4096 break; 4097 } 4098 if (doExt) 4099 cerr << MVT::getValueTypeString(LD->getMemoryVT()) << ">"; 4100 4101 const char *AM = getIndexedModeName(LD->getAddressingMode()); 4102 if (*AM) 4103 cerr << " " << AM; 4104 if (LD->isVolatile()) 4105 cerr << " <volatile>"; 4106 cerr << " alignment=" << LD->getAlignment(); 4107 } else if (const StoreSDNode *ST = dyn_cast<StoreSDNode>(this)) { 4108 const Value *SrcValue = ST->getSrcValue(); 4109 int SrcOffset = ST->getSrcValueOffset(); 4110 cerr << " <"; 4111 if (SrcValue) 4112 cerr << SrcValue; 4113 else 4114 cerr << "null"; 4115 cerr << ":" << SrcOffset << ">"; 4116 4117 if (ST->isTruncatingStore()) 4118 cerr << " <trunc " 4119 << MVT::getValueTypeString(ST->getMemoryVT()) << ">"; 4120 4121 const char *AM = getIndexedModeName(ST->getAddressingMode()); 4122 if (*AM) 4123 cerr << " " << AM; 4124 if (ST->isVolatile()) 4125 cerr << " <volatile>"; 4126 cerr << " alignment=" << ST->getAlignment(); 4127 } 4128} 4129 4130static void DumpNodes(const SDNode *N, unsigned indent, const SelectionDAG *G) { 4131 for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i) 4132 if (N->getOperand(i).Val->hasOneUse()) 4133 DumpNodes(N->getOperand(i).Val, indent+2, G); 4134 else 4135 cerr << "\n" << std::string(indent+2, ' ') 4136 << (void*)N->getOperand(i).Val << ": <multiple use>"; 4137 4138 4139 cerr << "\n" << std::string(indent, ' '); 4140 N->dump(G); 4141} 4142 4143void SelectionDAG::dump() const { 4144 cerr << "SelectionDAG has " << AllNodes.size() << " nodes:"; 4145 std::vector<const SDNode*> Nodes; 4146 for (allnodes_const_iterator I = allnodes_begin(), E = allnodes_end(); 4147 I != E; ++I) 4148 Nodes.push_back(I); 4149 4150 std::sort(Nodes.begin(), Nodes.end()); 4151 4152 for (unsigned i = 0, e = Nodes.size(); i != e; ++i) { 4153 if (!Nodes[i]->hasOneUse() && Nodes[i] != getRoot().Val) 4154 DumpNodes(Nodes[i], 2, this); 4155 } 4156 4157 if (getRoot().Val) DumpNodes(getRoot().Val, 2, this); 4158 4159 cerr << "\n\n"; 4160} 4161 4162const Type *ConstantPoolSDNode::getType() const { 4163 if (isMachineConstantPoolEntry()) 4164 return Val.MachineCPVal->getType(); 4165 return Val.ConstVal->getType(); 4166} 4167