1 //===-- SelectionDAG.cpp - Implement the SelectionDAG data structures -----===//
3 // The LLVM Compiler Infrastructure
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // This implements the SelectionDAG class.
12 //===----------------------------------------------------------------------===//
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"
40 /// makeVTList - Return an instance of the SDVTList struct initialized with the
41 /// specified members.
42 static SDVTList makeVTList(const MVT::ValueType *VTs, unsigned NumVTs) {
43 SDVTList Res = {VTs, NumVTs};
47 SelectionDAG::DAGUpdateListener::~DAGUpdateListener() {}
49 //===----------------------------------------------------------------------===//
50 // ConstantFPSDNode Class
51 //===----------------------------------------------------------------------===//
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.
57 bool ConstantFPSDNode::isExactlyValue(const APFloat& V) const {
58 return Value.bitwiseIsEqual(V);
61 bool ConstantFPSDNode::isValueValidForType(MVT::ValueType VT,
63 // convert modifies in place, so make a copy.
64 APFloat Val2 = APFloat(Val);
67 return false; // These can't be represented as floating point!
69 // FIXME rounding mode needs to be more flexible
71 return &Val2.getSemantics() == &APFloat::IEEEsingle ||
72 Val2.convert(APFloat::IEEEsingle, APFloat::rmNearestTiesToEven) ==
75 return &Val2.getSemantics() == &APFloat::IEEEsingle ||
76 &Val2.getSemantics() == &APFloat::IEEEdouble ||
77 Val2.convert(APFloat::IEEEdouble, APFloat::rmNearestTiesToEven) ==
79 // TODO: Figure out how to test if we can use a shorter type instead!
87 //===----------------------------------------------------------------------===//
89 //===----------------------------------------------------------------------===//
91 /// isBuildVectorAllOnes - Return true if the specified node is a
92 /// BUILD_VECTOR where all of the elements are ~0 or undef.
93 bool ISD::isBuildVectorAllOnes(const SDNode *N) {
94 // Look through a bit convert.
95 if (N->getOpcode() == ISD::BIT_CONVERT)
96 N = N->getOperand(0).Val;
98 if (N->getOpcode() != ISD::BUILD_VECTOR) return false;
100 unsigned i = 0, e = N->getNumOperands();
102 // Skip over all of the undef values.
103 while (i != e && N->getOperand(i).getOpcode() == ISD::UNDEF)
106 // Do not accept an all-undef vector.
107 if (i == e) return false;
109 // Do not accept build_vectors that aren't all constants or which have non-~0
111 SDOperand NotZero = N->getOperand(i);
112 if (isa<ConstantSDNode>(NotZero)) {
113 if (!cast<ConstantSDNode>(NotZero)->isAllOnesValue())
115 } else if (isa<ConstantFPSDNode>(NotZero)) {
116 MVT::ValueType VT = NotZero.getValueType();
118 if (((cast<ConstantFPSDNode>(NotZero)->getValueAPF().
119 convertToAPInt().getZExtValue())) != (uint64_t)-1)
122 if ((uint32_t)cast<ConstantFPSDNode>(NotZero)->
123 getValueAPF().convertToAPInt().getZExtValue() !=
130 // Okay, we have at least one ~0 value, check to see if the rest match or are
132 for (++i; i != e; ++i)
133 if (N->getOperand(i) != NotZero &&
134 N->getOperand(i).getOpcode() != ISD::UNDEF)
140 /// isBuildVectorAllZeros - Return true if the specified node is a
141 /// BUILD_VECTOR where all of the elements are 0 or undef.
142 bool ISD::isBuildVectorAllZeros(const SDNode *N) {
143 // Look through a bit convert.
144 if (N->getOpcode() == ISD::BIT_CONVERT)
145 N = N->getOperand(0).Val;
147 if (N->getOpcode() != ISD::BUILD_VECTOR) return false;
149 unsigned i = 0, e = N->getNumOperands();
151 // Skip over all of the undef values.
152 while (i != e && N->getOperand(i).getOpcode() == ISD::UNDEF)
155 // Do not accept an all-undef vector.
156 if (i == e) return false;
158 // Do not accept build_vectors that aren't all constants or which have non-~0
160 SDOperand Zero = N->getOperand(i);
161 if (isa<ConstantSDNode>(Zero)) {
162 if (!cast<ConstantSDNode>(Zero)->isNullValue())
164 } else if (isa<ConstantFPSDNode>(Zero)) {
165 if (!cast<ConstantFPSDNode>(Zero)->getValueAPF().isPosZero())
170 // Okay, we have at least one ~0 value, check to see if the rest match or are
172 for (++i; i != e; ++i)
173 if (N->getOperand(i) != Zero &&
174 N->getOperand(i).getOpcode() != ISD::UNDEF)
179 /// isDebugLabel - Return true if the specified node represents a debug
180 /// label (i.e. ISD::LABEL or TargetInstrInfo::LABEL node and third operand
182 bool ISD::isDebugLabel(const SDNode *N) {
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);
192 return isa<ConstantSDNode>(Zero) && cast<ConstantSDNode>(Zero)->isNullValue();
195 /// getSetCCSwappedOperands - Return the operation corresponding to (Y op X)
196 /// when given the operation for (X op Y).
197 ISD::CondCode ISD::getSetCCSwappedOperands(ISD::CondCode Operation) {
198 // To perform this operation, we just need to swap the L and G bits of the
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.
207 /// getSetCCInverse - Return the operation corresponding to !(X op Y), where
208 /// 'op' is a valid SetCC operation.
209 ISD::CondCode ISD::getSetCCInverse(ISD::CondCode Op, bool isInteger) {
210 unsigned Operation = Op;
212 Operation ^= 7; // Flip L, G, E bits, but not U.
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);
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).
224 static int isSignedOp(ISD::CondCode Opcode) {
226 default: assert(0 && "Illegal integer setcc operation!");
228 case ISD::SETNE: return 0;
232 case ISD::SETGE: return 1;
236 case ISD::SETUGE: return 2;
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
244 ISD::CondCode ISD::getSetCCOrOperation(ISD::CondCode Op1, ISD::CondCode Op2,
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;
250 unsigned Op = Op1 | Op2; // Combine all of the condition bits.
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.
257 // Canonicalize illegal integer setcc's.
258 if (isInteger && Op == ISD::SETUNE) // e.g. SETUGT | SETULT
261 return ISD::CondCode(Op);
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
268 ISD::CondCode ISD::getSetCCAndOperation(ISD::CondCode Op1, ISD::CondCode Op2,
270 if (isInteger && (isSignedOp(Op1) | isSignedOp(Op2)) == 3)
271 // Cannot fold a signed setcc with an unsigned setcc.
272 return ISD::SETCC_INVALID;
274 // Combine all of the condition bits.
275 ISD::CondCode Result = ISD::CondCode(Op1 & Op2);
277 // Canonicalize illegal integer setcc's.
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
291 const TargetMachine &SelectionDAG::getTarget() const {
292 return TLI.getTargetMachine();
295 //===----------------------------------------------------------------------===//
296 // SDNode Profile Support
297 //===----------------------------------------------------------------------===//
299 /// AddNodeIDOpcode - Add the node opcode to the NodeID data.
301 static void AddNodeIDOpcode(FoldingSetNodeID &ID, unsigned OpC) {
305 /// AddNodeIDValueTypes - Value type lists are intern'd so we can represent them
306 /// solely with their pointer.
307 void AddNodeIDValueTypes(FoldingSetNodeID &ID, SDVTList VTList) {
308 ID.AddPointer(VTList.VTs);
311 /// AddNodeIDOperands - Various routines for adding operands to the NodeID data.
313 static 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);
321 static 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);
329 /// AddNodeIDNode - Generic routine for adding a nodes info to the NodeID
331 static 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());
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:
343 ID.AddInteger(cast<ConstantSDNode>(N)->getValue());
345 case ISD::TargetConstantFP:
346 case ISD::ConstantFP: {
347 ID.Add(cast<ConstantFPSDNode>(N)->getValueAPF());
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());
359 case ISD::BasicBlock:
360 ID.AddPointer(cast<BasicBlockSDNode>(N)->getBasicBlock());
363 ID.AddInteger(cast<RegisterSDNode>(N)->getReg());
366 ID.AddPointer(cast<SrcValueSDNode>(N)->getValue());
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());
377 case ISD::FrameIndex:
378 case ISD::TargetFrameIndex:
379 ID.AddInteger(cast<FrameIndexSDNode>(N)->getIndex());
382 case ISD::TargetJumpTable:
383 ID.AddInteger(cast<JumpTableSDNode>(N)->getIndex());
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);
393 ID.AddPointer(CP->getConstVal());
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());
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());
417 //===----------------------------------------------------------------------===//
418 // SelectionDAG Class
419 //===----------------------------------------------------------------------===//
421 /// RemoveDeadNodes - This method deletes all unreachable nodes in the
423 void 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());
428 SmallVector<SDNode*, 128> DeadNodes;
430 // Add all obviously-dead nodes to the DeadNodes worklist.
431 for (allnodes_iterator I = allnodes_begin(), E = allnodes_end(); I != E; ++I)
433 DeadNodes.push_back(I);
435 // Process the worklist, deleting the nodes and adding their uses to the
437 while (!DeadNodes.empty()) {
438 SDNode *N = DeadNodes.back();
439 DeadNodes.pop_back();
441 // Take the node out of the appropriate CSE map.
442 RemoveNodeFromCSEMaps(N);
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);
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);
454 if (N->OperandsNeedDelete)
455 delete[] N->OperandList;
459 // Finally, remove N itself.
463 // If the root changed (e.g. it was a dead load, update the root).
464 setRoot(Dummy.getValue());
467 void SelectionDAG::RemoveDeadNode(SDNode *N, DAGUpdateListener *UpdateListener){
468 SmallVector<SDNode*, 16> DeadNodes;
469 DeadNodes.push_back(N);
471 // Process the worklist, deleting the nodes and adding their uses to the
473 while (!DeadNodes.empty()) {
474 SDNode *N = DeadNodes.back();
475 DeadNodes.pop_back();
478 UpdateListener->NodeDeleted(N);
480 // Take the node out of the appropriate CSE map.
481 RemoveNodeFromCSEMaps(N);
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);
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);
493 if (N->OperandsNeedDelete)
494 delete[] N->OperandList;
498 // Finally, remove N itself.
503 void SelectionDAG::DeleteNode(SDNode *N) {
504 assert(N->use_empty() && "Cannot delete a node that is not dead!");
506 // First take this out of the appropriate CSE map.
507 RemoveNodeFromCSEMaps(N);
509 // Finally, remove uses due to operands of this node, remove from the
510 // AllNodes list, and delete the node.
511 DeleteNodeNotInCSEMaps(N);
514 void SelectionDAG::DeleteNodeNotInCSEMaps(SDNode *N) {
516 // Remove it from the AllNodes list.
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;
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.
534 void SelectionDAG::RemoveNodeFromCSEMaps(SDNode *N) {
536 switch (N->getOpcode()) {
537 case ISD::HANDLENODE: return; // noop.
539 Erased = StringNodes.erase(cast<StringSDNode>(N)->getValue());
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;
547 case ISD::ExternalSymbol:
548 Erased = ExternalSymbols.erase(cast<ExternalSymbolSDNode>(N)->getSymbol());
550 case ISD::TargetExternalSymbol:
552 TargetExternalSymbols.erase(cast<ExternalSymbolSDNode>(N)->getSymbol());
554 case ISD::VALUETYPE: {
555 MVT::ValueType VT = cast<VTSDNode>(N)->getVT();
556 if (MVT::isExtendedVT(VT)) {
557 Erased = ExtendedValueTypeNodes.erase(VT);
559 Erased = ValueTypeNodes[VT] != 0;
560 ValueTypeNodes[VT] = 0;
565 // Remove it from the CSE Map.
566 Erased = CSEMap.RemoveNode(N);
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()) {
577 assert(0 && "Node is not in map!");
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.
587 SDNode *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.
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.
597 SDNode *New = CSEMap.GetOrInsertNode(N);
598 if (New != N) return New; // Node already existed.
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.
606 SDNode *SelectionDAG::FindModifiedNodeSlot(SDNode *N, SDOperand Op,
608 if (N->getOpcode() == ISD::HANDLENODE || N->getValueType(0) == MVT::Flag)
609 return 0; // Never add these nodes.
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.
616 SDOperand Ops[] = { Op };
618 AddNodeIDNode(ID, N->getOpcode(), N->getVTList(), Ops, 1);
619 return CSEMap.FindNodeOrInsertPos(ID, InsertPos);
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.
626 SDNode *SelectionDAG::FindModifiedNodeSlot(SDNode *N,
627 SDOperand Op1, SDOperand Op2,
629 if (N->getOpcode() == ISD::HANDLENODE || N->getValueType(0) == MVT::Flag)
630 return 0; // Never add these nodes.
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.
637 SDOperand Ops[] = { Op1, Op2 };
639 AddNodeIDNode(ID, N->getOpcode(), N->getVTList(), Ops, 2);
640 return CSEMap.FindNodeOrInsertPos(ID, InsertPos);
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.
648 SDNode *SelectionDAG::FindModifiedNodeSlot(SDNode *N,
649 const SDOperand *Ops,unsigned NumOps,
651 if (N->getOpcode() == ISD::HANDLENODE || N->getValueType(0) == MVT::Flag)
652 return 0; // Never add these nodes.
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.
660 AddNodeIDNode(ID, N->getOpcode(), N->getVTList(), Ops, NumOps);
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());
676 return CSEMap.FindNodeOrInsertPos(ID, InsertPos);
680 SelectionDAG::~SelectionDAG() {
681 while (!AllNodes.empty()) {
682 SDNode *N = AllNodes.begin();
683 N->SetNextInBucket(0);
684 if (N->OperandsNeedDelete)
685 delete [] N->OperandList;
688 AllNodes.pop_front();
692 SDOperand 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()));
699 SDOperand SelectionDAG::getString(const std::string &Val) {
700 StringSDNode *&N = StringNodes[Val];
702 N = new StringSDNode(Val);
703 AllNodes.push_back(N);
705 return SDOperand(N, 0);
708 SDOperand SelectionDAG::getConstant(uint64_t Val, MVT::ValueType VT, bool isT) {
709 MVT::ValueType EltVT =
710 MVT::isVector(VT) ? MVT::getVectorElementType(VT) : VT;
712 return getConstant(APInt(MVT::getSizeInBits(EltVT), Val), VT, isT);
715 SDOperand SelectionDAG::getConstant(const APInt &Val, MVT::ValueType VT, bool isT) {
716 assert(MVT::isInteger(VT) && "Cannot create FP integer constant!");
718 MVT::ValueType EltVT =
719 MVT::isVector(VT) ? MVT::getVectorElementType(VT) : VT;
721 assert(Val.getBitWidth() == MVT::getSizeInBits(EltVT) &&
722 "APInt size does not match type size!");
724 unsigned Opc = isT ? ISD::TargetConstant : ISD::Constant;
726 AddNodeIDNode(ID, Opc, getVTList(EltVT), 0, 0);
730 if ((N = CSEMap.FindNodeOrInsertPos(ID, IP)))
731 if (!MVT::isVector(VT))
732 return SDOperand(N, 0);
734 N = new ConstantSDNode(isT, Val, EltVT);
735 CSEMap.InsertNode(N, IP);
736 AllNodes.push_back(N);
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());
748 SDOperand SelectionDAG::getIntPtrConstant(uint64_t Val, bool isTarget) {
749 return getConstant(Val, TLI.getPointerTy(), isTarget);
753 SDOperand SelectionDAG::getConstantFP(const APFloat& V, MVT::ValueType VT,
755 assert(MVT::isFloatingPoint(VT) && "Cannot create integer FP constant!");
757 MVT::ValueType EltVT =
758 MVT::isVector(VT) ? MVT::getVectorElementType(VT) : VT;
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;
765 AddNodeIDNode(ID, Opc, getVTList(EltVT), 0, 0);
769 if ((N = CSEMap.FindNodeOrInsertPos(ID, IP)))
770 if (!MVT::isVector(VT))
771 return SDOperand(N, 0);
773 N = new ConstantFPSDNode(isTarget, V, EltVT);
774 CSEMap.InsertNode(N, IP);
775 AllNodes.push_back(N);
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());
787 SDOperand SelectionDAG::getConstantFP(double Val, MVT::ValueType VT,
789 MVT::ValueType EltVT =
790 MVT::isVector(VT) ? MVT::getVectorElementType(VT) : VT;
792 return getConstantFP(APFloat((float)Val), VT, isTarget);
794 return getConstantFP(APFloat(Val), VT, isTarget);
797 SDOperand SelectionDAG::getGlobalAddress(const GlobalValue *GV,
798 MVT::ValueType VT, int Offset,
800 const GlobalVariable *GVar = dyn_cast<GlobalVariable>(GV);
802 if (GVar && GVar->isThreadLocal())
803 Opc = isTargetGA ? ISD::TargetGlobalTLSAddress : ISD::GlobalTLSAddress;
805 Opc = isTargetGA ? ISD::TargetGlobalAddress : ISD::GlobalAddress;
807 AddNodeIDNode(ID, Opc, getVTList(VT), 0, 0);
809 ID.AddInteger(Offset);
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);
819 SDOperand SelectionDAG::getFrameIndex(int FI, MVT::ValueType VT,
821 unsigned Opc = isTarget ? ISD::TargetFrameIndex : ISD::FrameIndex;
823 AddNodeIDNode(ID, Opc, getVTList(VT), 0, 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);
834 SDOperand SelectionDAG::getJumpTable(int JTI, MVT::ValueType VT, bool isTarget){
835 unsigned Opc = isTarget ? ISD::TargetJumpTable : ISD::JumpTable;
837 AddNodeIDNode(ID, Opc, getVTList(VT), 0, 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);
848 SDOperand SelectionDAG::getConstantPool(Constant *C, MVT::ValueType VT,
849 unsigned Alignment, int Offset,
851 unsigned Opc = isTarget ? ISD::TargetConstantPool : ISD::ConstantPool;
853 AddNodeIDNode(ID, Opc, getVTList(VT), 0, 0);
854 ID.AddInteger(Alignment);
855 ID.AddInteger(Offset);
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);
867 SDOperand SelectionDAG::getConstantPool(MachineConstantPoolValue *C,
869 unsigned Alignment, int Offset,
871 unsigned Opc = isTarget ? ISD::TargetConstantPool : ISD::ConstantPool;
873 AddNodeIDNode(ID, Opc, getVTList(VT), 0, 0);
874 ID.AddInteger(Alignment);
875 ID.AddInteger(Offset);
876 C->AddSelectionDAGCSEId(ID);
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);
887 SDOperand SelectionDAG::getBasicBlock(MachineBasicBlock *MBB) {
889 AddNodeIDNode(ID, ISD::BasicBlock, getVTList(MVT::Other), 0, 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);
900 SDOperand SelectionDAG::getValueType(MVT::ValueType VT) {
901 if (!MVT::isExtendedVT(VT) && (unsigned)VT >= ValueTypeNodes.size())
902 ValueTypeNodes.resize(VT+1);
904 SDNode *&N = MVT::isExtendedVT(VT) ?
905 ExtendedValueTypeNodes[VT] : ValueTypeNodes[VT];
907 if (N) return SDOperand(N, 0);
908 N = new VTSDNode(VT);
909 AllNodes.push_back(N);
910 return SDOperand(N, 0);
913 SDOperand 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);
921 SDOperand SelectionDAG::getTargetExternalSymbol(const char *Sym,
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);
930 SDOperand SelectionDAG::getCondCode(ISD::CondCode Cond) {
931 if ((unsigned)Cond >= CondCodeNodes.size())
932 CondCodeNodes.resize(Cond+1);
934 if (CondCodeNodes[Cond] == 0) {
935 CondCodeNodes[Cond] = new CondCodeSDNode(Cond);
936 AllNodes.push_back(CondCodeNodes[Cond]);
938 return SDOperand(CondCodeNodes[Cond], 0);
941 SDOperand SelectionDAG::getRegister(unsigned RegNo, MVT::ValueType VT) {
943 AddNodeIDNode(ID, ISD::Register, getVTList(VT), 0, 0);
944 ID.AddInteger(RegNo);
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);
954 SDOperand SelectionDAG::getSrcValue(const Value *V) {
955 assert((!V || isa<PointerType>(V->getType())) &&
956 "SrcValue is not a pointer?");
959 AddNodeIDNode(ID, ISD::SRCVALUE, getVTList(MVT::Other), 0, 0);
963 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
964 return SDOperand(E, 0);
966 SDNode *N = new SrcValueSDNode(V);
967 CSEMap.InsertNode(N, IP);
968 AllNodes.push_back(N);
969 return SDOperand(N, 0);
972 SDOperand SelectionDAG::getMemOperand(const MemOperand &MO) {
973 const Value *v = MO.getValue();
974 assert((!v || isa<PointerType>(v->getType())) &&
975 "SrcValue is not a pointer?");
978 AddNodeIDNode(ID, ISD::MEMOPERAND, getVTList(MVT::Other), 0, 0);
980 ID.AddInteger(MO.getFlags());
981 ID.AddInteger(MO.getOffset());
982 ID.AddInteger(MO.getSize());
983 ID.AddInteger(MO.getAlignment());
986 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
987 return SDOperand(E, 0);
989 SDNode *N = new MemOperandSDNode(MO);
990 CSEMap.InsertNode(N, IP);
991 AllNodes.push_back(N);
992 return SDOperand(N, 0);
995 /// CreateStackTemporary - Create a stack temporary, suitable for holding the
996 /// specified value type.
997 SDOperand 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());
1007 SDOperand SelectionDAG::FoldSetCC(MVT::ValueType VT, SDOperand N1,
1008 SDOperand N2, ISD::CondCode Cond) {
1009 // These setcc operations always fold.
1013 case ISD::SETFALSE2: return getConstant(0, VT);
1015 case ISD::SETTRUE2: return getConstant(1, VT);
1027 assert(!MVT::isInteger(N1.getValueType()) && "Illegal setcc for integer!");
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();
1036 // Sign extend the operands if required
1037 if (ISD::isSignedIntSetCC(Cond)) {
1038 C1 = N1C->getSignExtended();
1039 C2 = N2C->getSignExtended();
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);
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)
1063 APFloat::cmpResult R = N1C->getValueAPF().compare(N2C->getValueAPF());
1066 case ISD::SETEQ: if (R==APFloat::cmpUnordered)
1067 return getNode(ISD::UNDEF, VT);
1069 case ISD::SETOEQ: return getConstant(R==APFloat::cmpEqual, VT);
1070 case ISD::SETNE: if (R==APFloat::cmpUnordered)
1071 return getNode(ISD::UNDEF, VT);
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);
1078 case ISD::SETOLT: return getConstant(R==APFloat::cmpLessThan, VT);
1079 case ISD::SETGT: if (R==APFloat::cmpUnordered)
1080 return getNode(ISD::UNDEF, VT);
1082 case ISD::SETOGT: return getConstant(R==APFloat::cmpGreaterThan, VT);
1083 case ISD::SETLE: if (R==APFloat::cmpUnordered)
1084 return getNode(ISD::UNDEF, VT);
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);
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);
1106 // Ensure that the constant occurs on the RHS.
1107 return getSetCC(VT, N2, N1, ISD::getSetCCSwappedOperands(Cond));
1110 // Could not fold it.
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.
1117 bool 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)
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;
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
1133 void SelectionDAG::ComputeMaskedBits(SDOperand Op, const APInt &Mask,
1134 APInt &KnownZero, APInt &KnownOne,
1135 unsigned Depth) const {
1136 unsigned BitWidth = Mask.getBitWidth();
1137 KnownZero = KnownOne = APInt(BitWidth, 0); // Don't know anything.
1138 if (Depth == 6 || Mask == 0)
1139 return; // Limit search depth.
1141 // The masks are not wide enough to represent this type! Should use APInt.
1142 if (Op.getValueType() == MVT::i128)
1145 APInt KnownZero2, KnownOne2;
1147 switch (Op.getOpcode()) {
1149 // We know all of the bits for a constant!
1150 KnownOne = cast<ConstantSDNode>(Op)->getAPIntValue() & Mask;
1151 KnownZero = ~KnownOne & Mask;
1154 // If either the LHS or the RHS are Zero, the result is zero.
1155 ComputeMaskedBits(Op.getOperand(1), Mask, KnownZero, KnownOne, Depth+1);
1156 ComputeMaskedBits(Op.getOperand(0), Mask & ~KnownZero,
1157 KnownZero2, KnownOne2, Depth+1);
1158 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1159 assert((KnownZero2 & KnownOne2) == 0 && "Bits known to be one AND zero?");
1161 // Output known-1 bits are only known if set in both the LHS & RHS.
1162 KnownOne &= KnownOne2;
1163 // Output known-0 are known to be clear if zero in either the LHS | RHS.
1164 KnownZero |= KnownZero2;
1167 ComputeMaskedBits(Op.getOperand(1), Mask, KnownZero, KnownOne, Depth+1);
1168 ComputeMaskedBits(Op.getOperand(0), Mask & ~KnownOne,
1169 KnownZero2, KnownOne2, Depth+1);
1170 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1171 assert((KnownZero2 & KnownOne2) == 0 && "Bits known to be one AND zero?");
1173 // Output known-0 bits are only known if clear in both the LHS & RHS.
1174 KnownZero &= KnownZero2;
1175 // Output known-1 are known to be set if set in either the LHS | RHS.
1176 KnownOne |= KnownOne2;
1179 ComputeMaskedBits(Op.getOperand(1), Mask, KnownZero, KnownOne, Depth+1);
1180 ComputeMaskedBits(Op.getOperand(0), Mask, KnownZero2, KnownOne2, Depth+1);
1181 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1182 assert((KnownZero2 & KnownOne2) == 0 && "Bits known to be one AND zero?");
1184 // Output known-0 bits are known if clear or set in both the LHS & RHS.
1185 APInt KnownZeroOut = (KnownZero & KnownZero2) | (KnownOne & KnownOne2);
1186 // Output known-1 are known to be set if set in only one of the LHS, RHS.
1187 KnownOne = (KnownZero & KnownOne2) | (KnownOne & KnownZero2);
1188 KnownZero = KnownZeroOut;
1192 ComputeMaskedBits(Op.getOperand(2), Mask, KnownZero, KnownOne, Depth+1);
1193 ComputeMaskedBits(Op.getOperand(1), Mask, KnownZero2, KnownOne2, Depth+1);
1194 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1195 assert((KnownZero2 & KnownOne2) == 0 && "Bits known to be one AND zero?");
1197 // Only known if known in both the LHS and RHS.
1198 KnownOne &= KnownOne2;
1199 KnownZero &= KnownZero2;
1201 case ISD::SELECT_CC:
1202 ComputeMaskedBits(Op.getOperand(3), Mask, KnownZero, KnownOne, Depth+1);
1203 ComputeMaskedBits(Op.getOperand(2), Mask, KnownZero2, KnownOne2, Depth+1);
1204 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1205 assert((KnownZero2 & KnownOne2) == 0 && "Bits known to be one AND zero?");
1207 // Only known if known in both the LHS and RHS.
1208 KnownOne &= KnownOne2;
1209 KnownZero &= KnownZero2;
1212 // If we know the result of a setcc has the top bits zero, use this info.
1213 if (TLI.getSetCCResultContents() == TargetLowering::ZeroOrOneSetCCResult &&
1215 KnownZero |= APInt::getHighBitsSet(BitWidth, BitWidth - 1);
1218 // (shl X, C1) & C2 == 0 iff (X & C2 >>u C1) == 0
1219 if (ConstantSDNode *SA = dyn_cast<ConstantSDNode>(Op.getOperand(1))) {
1220 ComputeMaskedBits(Op.getOperand(0), Mask.lshr(SA->getValue()),
1221 KnownZero, KnownOne, Depth+1);
1222 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1223 KnownZero <<= SA->getValue();
1224 KnownOne <<= SA->getValue();
1225 // low bits known zero.
1226 KnownZero |= APInt::getLowBitsSet(BitWidth, SA->getValue());
1230 // (ushr X, C1) & C2 == 0 iff (-1 >> C1) & C2 == 0
1231 if (ConstantSDNode *SA = dyn_cast<ConstantSDNode>(Op.getOperand(1))) {
1232 unsigned ShAmt = SA->getValue();
1234 ComputeMaskedBits(Op.getOperand(0), (Mask << ShAmt),
1235 KnownZero, KnownOne, Depth+1);
1236 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1237 KnownZero = KnownZero.lshr(ShAmt);
1238 KnownOne = KnownOne.lshr(ShAmt);
1240 APInt HighBits = APInt::getHighBitsSet(BitWidth, ShAmt);
1241 KnownZero |= HighBits; // High bits known zero.
1245 if (ConstantSDNode *SA = dyn_cast<ConstantSDNode>(Op.getOperand(1))) {
1246 unsigned ShAmt = SA->getValue();
1248 APInt InDemandedMask = (Mask << ShAmt);
1249 // If any of the demanded bits are produced by the sign extension, we also
1250 // demand the input sign bit.
1251 APInt HighBits = APInt::getHighBitsSet(BitWidth, ShAmt);
1252 if (!!(HighBits & Mask))
1253 InDemandedMask |= APInt::getSignBit(BitWidth);
1255 ComputeMaskedBits(Op.getOperand(0), InDemandedMask, KnownZero, KnownOne,
1257 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1258 KnownZero = KnownZero.lshr(ShAmt);
1259 KnownOne = KnownOne.lshr(ShAmt);
1261 // Handle the sign bits.
1262 APInt SignBit = APInt::getSignBit(BitWidth);
1263 SignBit = SignBit.lshr(ShAmt); // Adjust to where it is now in the mask.
1265 if (!!(KnownZero & SignBit)) {
1266 KnownZero |= HighBits; // New bits are known zero.
1267 } else if (!!(KnownOne & SignBit)) {
1268 KnownOne |= HighBits; // New bits are known one.
1272 case ISD::SIGN_EXTEND_INREG: {
1273 MVT::ValueType EVT = cast<VTSDNode>(Op.getOperand(1))->getVT();
1274 unsigned EBits = MVT::getSizeInBits(EVT);
1276 // Sign extension. Compute the demanded bits in the result that are not
1277 // present in the input.
1278 APInt NewBits = APInt::getHighBitsSet(BitWidth, BitWidth - EBits) & Mask;
1280 APInt InSignBit = APInt::getSignBit(EBits);
1281 APInt InputDemandedBits = Mask & APInt::getLowBitsSet(BitWidth, EBits);
1283 // If the sign extended bits are demanded, we know that the sign
1285 InSignBit.zext(BitWidth);
1286 if (NewBits.getBoolValue())
1287 InputDemandedBits |= InSignBit;
1289 ComputeMaskedBits(Op.getOperand(0), InputDemandedBits,
1290 KnownZero, KnownOne, Depth+1);
1291 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1293 // If the sign bit of the input is known set or clear, then we know the
1294 // top bits of the result.
1295 if (!!(KnownZero & InSignBit)) { // Input sign bit known clear
1296 KnownZero |= NewBits;
1297 KnownOne &= ~NewBits;
1298 } else if (!!(KnownOne & InSignBit)) { // Input sign bit known set
1299 KnownOne |= NewBits;
1300 KnownZero &= ~NewBits;
1301 } else { // Input sign bit unknown
1302 KnownZero &= ~NewBits;
1303 KnownOne &= ~NewBits;
1310 unsigned LowBits = Log2_32(BitWidth)+1;
1311 KnownZero = APInt::getHighBitsSet(BitWidth, BitWidth - LowBits);
1312 KnownOne = APInt(BitWidth, 0);
1316 if (ISD::isZEXTLoad(Op.Val)) {
1317 LoadSDNode *LD = cast<LoadSDNode>(Op);
1318 MVT::ValueType VT = LD->getMemoryVT();
1319 unsigned MemBits = MVT::getSizeInBits(VT);
1320 KnownZero |= APInt::getHighBitsSet(BitWidth, BitWidth - MemBits) & Mask;
1324 case ISD::ZERO_EXTEND: {
1325 MVT::ValueType InVT = Op.getOperand(0).getValueType();
1326 unsigned InBits = MVT::getSizeInBits(InVT);
1327 APInt NewBits = APInt::getHighBitsSet(BitWidth, BitWidth - InBits) & Mask;
1328 APInt InMask = Mask;
1329 InMask.trunc(InBits);
1330 KnownZero.trunc(InBits);
1331 KnownOne.trunc(InBits);
1332 ComputeMaskedBits(Op.getOperand(0), InMask, KnownZero, KnownOne, Depth+1);
1333 KnownZero.zext(BitWidth);
1334 KnownOne.zext(BitWidth);
1335 KnownZero |= NewBits;
1338 case ISD::SIGN_EXTEND: {
1339 MVT::ValueType InVT = Op.getOperand(0).getValueType();
1340 unsigned InBits = MVT::getSizeInBits(InVT);
1341 APInt InSignBit = APInt::getSignBit(InBits);
1342 APInt NewBits = APInt::getHighBitsSet(BitWidth, BitWidth - InBits) & Mask;
1343 APInt InMask = Mask;
1344 InMask.trunc(InBits);
1346 // If any of the sign extended bits are demanded, we know that the sign
1347 // bit is demanded. Temporarily set this bit in the mask for our callee.
1348 if (NewBits.getBoolValue())
1349 InMask |= InSignBit;
1351 KnownZero.trunc(InBits);
1352 KnownOne.trunc(InBits);
1353 ComputeMaskedBits(Op.getOperand(0), InMask, KnownZero, KnownOne, Depth+1);
1355 // Note if the sign bit is known to be zero or one.
1356 bool SignBitKnownZero = KnownZero.isNegative();
1357 bool SignBitKnownOne = KnownOne.isNegative();
1358 assert(!(SignBitKnownZero && SignBitKnownOne) &&
1359 "Sign bit can't be known to be both zero and one!");
1361 // If the sign bit wasn't actually demanded by our caller, we don't
1362 // want it set in the KnownZero and KnownOne result values. Reset the
1363 // mask and reapply it to the result values.
1365 InMask.trunc(InBits);
1366 KnownZero &= InMask;
1369 KnownZero.zext(BitWidth);
1370 KnownOne.zext(BitWidth);
1372 // If the sign bit is known zero or one, the top bits match.
1373 if (SignBitKnownZero)
1374 KnownZero |= NewBits;
1375 else if (SignBitKnownOne)
1376 KnownOne |= NewBits;
1379 case ISD::ANY_EXTEND: {
1380 MVT::ValueType InVT = Op.getOperand(0).getValueType();
1381 unsigned InBits = MVT::getSizeInBits(InVT);
1382 APInt InMask = Mask;
1383 InMask.trunc(InBits);
1384 KnownZero.trunc(InBits);
1385 KnownOne.trunc(InBits);
1386 ComputeMaskedBits(Op.getOperand(0), InMask, KnownZero, KnownOne, Depth+1);
1387 KnownZero.zext(BitWidth);
1388 KnownOne.zext(BitWidth);
1391 case ISD::TRUNCATE: {
1392 MVT::ValueType InVT = Op.getOperand(0).getValueType();
1393 unsigned InBits = MVT::getSizeInBits(InVT);
1394 APInt InMask = Mask;
1395 InMask.zext(InBits);
1396 KnownZero.zext(InBits);
1397 KnownOne.zext(InBits);
1398 ComputeMaskedBits(Op.getOperand(0), InMask, KnownZero, KnownOne, Depth+1);
1399 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1400 KnownZero.trunc(BitWidth);
1401 KnownOne.trunc(BitWidth);
1404 case ISD::AssertZext: {
1405 MVT::ValueType VT = cast<VTSDNode>(Op.getOperand(1))->getVT();
1406 APInt InMask = APInt::getLowBitsSet(BitWidth, MVT::getSizeInBits(VT));
1407 ComputeMaskedBits(Op.getOperand(0), Mask & InMask, KnownZero,
1409 KnownZero |= (~InMask) & Mask;
1413 // All bits are zero except the low bit.
1414 KnownZero = APInt::getHighBitsSet(BitWidth, BitWidth - 1);
1418 // If either the LHS or the RHS are Zero, the result is zero.
1419 ComputeMaskedBits(Op.getOperand(1), Mask, KnownZero, KnownOne, Depth+1);
1420 ComputeMaskedBits(Op.getOperand(0), Mask, KnownZero2, KnownOne2, Depth+1);
1421 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1422 assert((KnownZero2 & KnownOne2) == 0 && "Bits known to be one AND zero?");
1424 // Output known-0 bits are known if clear or set in both the low clear bits
1425 // common to both LHS & RHS. For example, 8+(X<<3) is known to have the
1426 // low 3 bits clear.
1427 unsigned KnownZeroOut = std::min(KnownZero.countTrailingOnes(),
1428 KnownZero2.countTrailingOnes());
1430 KnownZero = APInt::getLowBitsSet(BitWidth, KnownZeroOut);
1431 KnownOne = APInt(BitWidth, 0);
1435 ConstantSDNode *CLHS = dyn_cast<ConstantSDNode>(Op.getOperand(0));
1438 // We know that the top bits of C-X are clear if X contains less bits
1439 // than C (i.e. no wrap-around can happen). For example, 20-X is
1440 // positive if we can prove that X is >= 0 and < 16.
1443 if (CLHS->getAPIntValue().isNonNegative()) {
1444 unsigned NLZ = (CLHS->getAPIntValue()+1).countLeadingZeros();
1445 // NLZ can't be BitWidth with no sign bit
1446 APInt MaskV = APInt::getHighBitsSet(BitWidth, NLZ);
1447 ComputeMaskedBits(Op.getOperand(1), MaskV, KnownZero, KnownOne, Depth+1);
1449 // If all of the MaskV bits are known to be zero, then we know the output
1450 // top bits are zero, because we now know that the output is from [0-C].
1451 if ((KnownZero & MaskV) == MaskV) {
1452 unsigned NLZ2 = CLHS->getAPIntValue().countLeadingZeros();
1453 // Top bits known zero.
1454 KnownZero = APInt::getHighBitsSet(BitWidth, NLZ2) & Mask;
1455 KnownOne = APInt(BitWidth, 0); // No one bits known.
1457 KnownZero = KnownOne = APInt(BitWidth, 0); // Otherwise, nothing known.
1463 // Allow the target to implement this method for its nodes.
1464 if (Op.getOpcode() >= ISD::BUILTIN_OP_END) {
1465 case ISD::INTRINSIC_WO_CHAIN:
1466 case ISD::INTRINSIC_W_CHAIN:
1467 case ISD::INTRINSIC_VOID:
1468 TLI.computeMaskedBitsForTargetNode(Op, Mask, KnownZero, KnownOne, *this);
1474 /// ComputeMaskedBits - This is a wrapper around the APInt-using
1475 /// form of ComputeMaskedBits for use by clients that haven't been converted
1477 void SelectionDAG::ComputeMaskedBits(SDOperand Op, uint64_t Mask,
1478 uint64_t &KnownZero, uint64_t &KnownOne,
1479 unsigned Depth) const {
1480 unsigned NumBits = MVT::getSizeInBits(Op.getValueType());
1481 APInt APIntMask(NumBits, Mask);
1482 APInt APIntKnownZero(NumBits, 0);
1483 APInt APIntKnownOne(NumBits, 0);
1484 ComputeMaskedBits(Op, APIntMask, APIntKnownZero, APIntKnownOne, Depth);
1485 KnownZero = APIntKnownZero.getZExtValue();
1486 KnownOne = APIntKnownOne.getZExtValue();
1489 /// ComputeNumSignBits - Return the number of times the sign bit of the
1490 /// register is replicated into the other bits. We know that at least 1 bit
1491 /// is always equal to the sign bit (itself), but other cases can give us
1492 /// information. For example, immediately after an "SRA X, 2", we know that
1493 /// the top 3 bits are all equal to each other, so we return 3.
1494 unsigned SelectionDAG::ComputeNumSignBits(SDOperand Op, unsigned Depth) const{
1495 MVT::ValueType VT = Op.getValueType();
1496 assert(MVT::isInteger(VT) && "Invalid VT!");
1497 unsigned VTBits = MVT::getSizeInBits(VT);
1501 return 1; // Limit search depth.
1503 switch (Op.getOpcode()) {
1505 case ISD::AssertSext:
1506 Tmp = MVT::getSizeInBits(cast<VTSDNode>(Op.getOperand(1))->getVT());
1507 return VTBits-Tmp+1;
1508 case ISD::AssertZext:
1509 Tmp = MVT::getSizeInBits(cast<VTSDNode>(Op.getOperand(1))->getVT());
1512 case ISD::Constant: {
1513 uint64_t Val = cast<ConstantSDNode>(Op)->getValue();
1514 // If negative, invert the bits, then look at it.
1515 if (Val & MVT::getIntVTSignBit(VT))
1518 // Shift the bits so they are the leading bits in the int64_t.
1521 // Return # leading zeros. We use 'min' here in case Val was zero before
1522 // shifting. We don't want to return '64' as for an i32 "0".
1523 return std::min(VTBits, CountLeadingZeros_64(Val));
1526 case ISD::SIGN_EXTEND:
1527 Tmp = VTBits-MVT::getSizeInBits(Op.getOperand(0).getValueType());
1528 return ComputeNumSignBits(Op.getOperand(0), Depth+1) + Tmp;
1530 case ISD::SIGN_EXTEND_INREG:
1531 // Max of the input and what this extends.
1532 Tmp = MVT::getSizeInBits(cast<VTSDNode>(Op.getOperand(1))->getVT());
1535 Tmp2 = ComputeNumSignBits(Op.getOperand(0), Depth+1);
1536 return std::max(Tmp, Tmp2);
1539 Tmp = ComputeNumSignBits(Op.getOperand(0), Depth+1);
1540 // SRA X, C -> adds C sign bits.
1541 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op.getOperand(1))) {
1542 Tmp += C->getValue();
1543 if (Tmp > VTBits) Tmp = VTBits;
1547 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op.getOperand(1))) {
1548 // shl destroys sign bits.
1549 Tmp = ComputeNumSignBits(Op.getOperand(0), Depth+1);
1550 if (C->getValue() >= VTBits || // Bad shift.
1551 C->getValue() >= Tmp) break; // Shifted all sign bits out.
1552 return Tmp - C->getValue();
1557 case ISD::XOR: // NOT is handled here.
1558 // Logical binary ops preserve the number of sign bits.
1559 Tmp = ComputeNumSignBits(Op.getOperand(0), Depth+1);
1560 if (Tmp == 1) return 1; // Early out.
1561 Tmp2 = ComputeNumSignBits(Op.getOperand(1), Depth+1);
1562 return std::min(Tmp, Tmp2);
1565 Tmp = ComputeNumSignBits(Op.getOperand(0), Depth+1);
1566 if (Tmp == 1) return 1; // Early out.
1567 Tmp2 = ComputeNumSignBits(Op.getOperand(1), Depth+1);
1568 return std::min(Tmp, Tmp2);
1571 // If setcc returns 0/-1, all bits are sign bits.
1572 if (TLI.getSetCCResultContents() ==
1573 TargetLowering::ZeroOrNegativeOneSetCCResult)
1578 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op.getOperand(1))) {
1579 unsigned RotAmt = C->getValue() & (VTBits-1);
1581 // Handle rotate right by N like a rotate left by 32-N.
1582 if (Op.getOpcode() == ISD::ROTR)
1583 RotAmt = (VTBits-RotAmt) & (VTBits-1);
1585 // If we aren't rotating out all of the known-in sign bits, return the
1586 // number that are left. This handles rotl(sext(x), 1) for example.
1587 Tmp = ComputeNumSignBits(Op.getOperand(0), Depth+1);
1588 if (Tmp > RotAmt+1) return Tmp-RotAmt;
1592 // Add can have at most one carry bit. Thus we know that the output
1593 // is, at worst, one more bit than the inputs.
1594 Tmp = ComputeNumSignBits(Op.getOperand(0), Depth+1);
1595 if (Tmp == 1) return 1; // Early out.
1597 // Special case decrementing a value (ADD X, -1):
1598 if (ConstantSDNode *CRHS = dyn_cast<ConstantSDNode>(Op.getOperand(0)))
1599 if (CRHS->isAllOnesValue()) {
1600 uint64_t KnownZero, KnownOne;
1601 uint64_t Mask = MVT::getIntVTBitMask(VT);
1602 ComputeMaskedBits(Op.getOperand(0), Mask, KnownZero, KnownOne, Depth+1);
1604 // If the input is known to be 0 or 1, the output is 0/-1, which is all
1606 if ((KnownZero|1) == Mask)
1609 // If we are subtracting one from a positive number, there is no carry
1610 // out of the result.
1611 if (KnownZero & MVT::getIntVTSignBit(VT))
1615 Tmp2 = ComputeNumSignBits(Op.getOperand(1), Depth+1);
1616 if (Tmp2 == 1) return 1;
1617 return std::min(Tmp, Tmp2)-1;
1621 Tmp2 = ComputeNumSignBits(Op.getOperand(1), Depth+1);
1622 if (Tmp2 == 1) return 1;
1625 if (ConstantSDNode *CLHS = dyn_cast<ConstantSDNode>(Op.getOperand(0)))
1626 if (CLHS->getValue() == 0) {
1627 uint64_t KnownZero, KnownOne;
1628 uint64_t Mask = MVT::getIntVTBitMask(VT);
1629 ComputeMaskedBits(Op.getOperand(1), Mask, KnownZero, KnownOne, Depth+1);
1630 // If the input is known to be 0 or 1, the output is 0/-1, which is all
1632 if ((KnownZero|1) == Mask)
1635 // If the input is known to be positive (the sign bit is known clear),
1636 // the output of the NEG has the same number of sign bits as the input.
1637 if (KnownZero & MVT::getIntVTSignBit(VT))
1640 // Otherwise, we treat this like a SUB.
1643 // Sub can have at most one carry bit. Thus we know that the output
1644 // is, at worst, one more bit than the inputs.
1645 Tmp = ComputeNumSignBits(Op.getOperand(0), Depth+1);
1646 if (Tmp == 1) return 1; // Early out.
1647 return std::min(Tmp, Tmp2)-1;
1650 // FIXME: it's tricky to do anything useful for this, but it is an important
1651 // case for targets like X86.
1655 // Handle LOADX separately here. EXTLOAD case will fallthrough.
1656 if (Op.getOpcode() == ISD::LOAD) {
1657 LoadSDNode *LD = cast<LoadSDNode>(Op);
1658 unsigned ExtType = LD->getExtensionType();
1661 case ISD::SEXTLOAD: // '17' bits known
1662 Tmp = MVT::getSizeInBits(LD->getMemoryVT());
1663 return VTBits-Tmp+1;
1664 case ISD::ZEXTLOAD: // '16' bits known
1665 Tmp = MVT::getSizeInBits(LD->getMemoryVT());
1670 // Allow the target to implement this method for its nodes.
1671 if (Op.getOpcode() >= ISD::BUILTIN_OP_END ||
1672 Op.getOpcode() == ISD::INTRINSIC_WO_CHAIN ||
1673 Op.getOpcode() == ISD::INTRINSIC_W_CHAIN ||
1674 Op.getOpcode() == ISD::INTRINSIC_VOID) {
1675 unsigned NumBits = TLI.ComputeNumSignBitsForTargetNode(Op, Depth);
1676 if (NumBits > 1) return NumBits;
1679 // Finally, if we can prove that the top bits of the result are 0's or 1's,
1680 // use this information.
1681 uint64_t KnownZero, KnownOne;
1682 uint64_t Mask = MVT::getIntVTBitMask(VT);
1683 ComputeMaskedBits(Op, Mask, KnownZero, KnownOne, Depth);
1685 uint64_t SignBit = MVT::getIntVTSignBit(VT);
1686 if (KnownZero & SignBit) { // SignBit is 0
1688 } else if (KnownOne & SignBit) { // SignBit is 1;
1695 // Okay, we know that the sign bit in Mask is set. Use CLZ to determine
1696 // the number of identical bits in the top of the input value.
1699 // Return # leading zeros. We use 'min' here in case Val was zero before
1700 // shifting. We don't want to return '64' as for an i32 "0".
1701 return std::min(VTBits, CountLeadingZeros_64(Mask));
1705 bool SelectionDAG::isVerifiedDebugInfoDesc(SDOperand Op) const {
1706 GlobalAddressSDNode *GA = dyn_cast<GlobalAddressSDNode>(Op);
1707 if (!GA) return false;
1708 GlobalVariable *GV = dyn_cast<GlobalVariable>(GA->getGlobal());
1709 if (!GV) return false;
1710 MachineModuleInfo *MMI = getMachineModuleInfo();
1711 return MMI && MMI->hasDebugInfo() && MMI->isVerified(GV);
1715 /// getNode - Gets or creates the specified node.
1717 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT) {
1718 FoldingSetNodeID ID;
1719 AddNodeIDNode(ID, Opcode, getVTList(VT), 0, 0);
1721 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
1722 return SDOperand(E, 0);
1723 SDNode *N = new SDNode(Opcode, SDNode::getSDVTList(VT));
1724 CSEMap.InsertNode(N, IP);
1726 AllNodes.push_back(N);
1727 return SDOperand(N, 0);
1730 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT,
1731 SDOperand Operand) {
1733 // Constant fold unary operations with an integer constant operand.
1734 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Operand.Val)) {
1735 uint64_t Val = C->getValue();
1738 case ISD::SIGN_EXTEND: return getConstant(C->getSignExtended(), VT);
1739 case ISD::ANY_EXTEND:
1740 case ISD::ZERO_EXTEND: return getConstant(Val, VT);
1741 case ISD::TRUNCATE: return getConstant(Val, VT);
1742 case ISD::UINT_TO_FP:
1743 case ISD::SINT_TO_FP: {
1744 const uint64_t zero[] = {0, 0};
1745 // No compile time operations on this type.
1746 if (VT==MVT::ppcf128)
1748 APFloat apf = APFloat(APInt(MVT::getSizeInBits(VT), 2, zero));
1749 (void)apf.convertFromZeroExtendedInteger(&Val,
1750 MVT::getSizeInBits(Operand.getValueType()),
1751 Opcode==ISD::SINT_TO_FP,
1752 APFloat::rmNearestTiesToEven);
1753 return getConstantFP(apf, VT);
1755 case ISD::BIT_CONVERT:
1756 if (VT == MVT::f32 && C->getValueType(0) == MVT::i32)
1757 return getConstantFP(BitsToFloat(Val), VT);
1758 else if (VT == MVT::f64 && C->getValueType(0) == MVT::i64)
1759 return getConstantFP(BitsToDouble(Val), VT);
1763 default: assert(0 && "Invalid bswap!"); break;
1764 case MVT::i16: return getConstant(ByteSwap_16((unsigned short)Val), VT);
1765 case MVT::i32: return getConstant(ByteSwap_32((unsigned)Val), VT);
1766 case MVT::i64: return getConstant(ByteSwap_64(Val), VT);
1771 default: assert(0 && "Invalid ctpop!"); break;
1772 case MVT::i1: return getConstant(Val != 0, VT);
1774 Tmp1 = (unsigned)Val & 0xFF;
1775 return getConstant(CountPopulation_32(Tmp1), VT);
1777 Tmp1 = (unsigned)Val & 0xFFFF;
1778 return getConstant(CountPopulation_32(Tmp1), VT);
1780 return getConstant(CountPopulation_32((unsigned)Val), VT);
1782 return getConstant(CountPopulation_64(Val), VT);
1786 default: assert(0 && "Invalid ctlz!"); break;
1787 case MVT::i1: return getConstant(Val == 0, VT);
1789 Tmp1 = (unsigned)Val & 0xFF;
1790 return getConstant(CountLeadingZeros_32(Tmp1)-24, VT);
1792 Tmp1 = (unsigned)Val & 0xFFFF;
1793 return getConstant(CountLeadingZeros_32(Tmp1)-16, VT);
1795 return getConstant(CountLeadingZeros_32((unsigned)Val), VT);
1797 return getConstant(CountLeadingZeros_64(Val), VT);
1801 default: assert(0 && "Invalid cttz!"); break;
1802 case MVT::i1: return getConstant(Val == 0, VT);
1804 Tmp1 = (unsigned)Val | 0x100;
1805 return getConstant(CountTrailingZeros_32(Tmp1), VT);
1807 Tmp1 = (unsigned)Val | 0x10000;
1808 return getConstant(CountTrailingZeros_32(Tmp1), VT);
1810 return getConstant(CountTrailingZeros_32((unsigned)Val), VT);
1812 return getConstant(CountTrailingZeros_64(Val), VT);
1817 // Constant fold unary operations with a floating point constant operand.
1818 if (ConstantFPSDNode *C = dyn_cast<ConstantFPSDNode>(Operand.Val)) {
1819 APFloat V = C->getValueAPF(); // make copy
1820 if (VT != MVT::ppcf128 && Operand.getValueType() != MVT::ppcf128) {
1824 return getConstantFP(V, VT);
1827 return getConstantFP(V, VT);
1829 case ISD::FP_EXTEND:
1830 // This can return overflow, underflow, or inexact; we don't care.
1831 // FIXME need to be more flexible about rounding mode.
1832 (void) V.convert(VT==MVT::f32 ? APFloat::IEEEsingle :
1833 VT==MVT::f64 ? APFloat::IEEEdouble :
1834 VT==MVT::f80 ? APFloat::x87DoubleExtended :
1835 VT==MVT::f128 ? APFloat::IEEEquad :
1837 APFloat::rmNearestTiesToEven);
1838 return getConstantFP(V, VT);
1839 case ISD::FP_TO_SINT:
1840 case ISD::FP_TO_UINT: {
1842 assert(integerPartWidth >= 64);
1843 // FIXME need to be more flexible about rounding mode.
1844 APFloat::opStatus s = V.convertToInteger(&x, 64U,
1845 Opcode==ISD::FP_TO_SINT,
1846 APFloat::rmTowardZero);
1847 if (s==APFloat::opInvalidOp) // inexact is OK, in fact usual
1849 return getConstant(x, VT);
1851 case ISD::BIT_CONVERT:
1852 if (VT == MVT::i32 && C->getValueType(0) == MVT::f32)
1853 return getConstant((uint32_t)V.convertToAPInt().getZExtValue(), VT);
1854 else if (VT == MVT::i64 && C->getValueType(0) == MVT::f64)
1855 return getConstant(V.convertToAPInt().getZExtValue(), VT);
1861 unsigned OpOpcode = Operand.Val->getOpcode();
1863 case ISD::TokenFactor:
1864 return Operand; // Factor of one node? No factor.
1865 case ISD::FP_ROUND: assert(0 && "Invalid method to make FP_ROUND node");
1866 case ISD::FP_EXTEND:
1867 assert(MVT::isFloatingPoint(VT) &&
1868 MVT::isFloatingPoint(Operand.getValueType()) && "Invalid FP cast!");
1869 if (Operand.getValueType() == VT) return Operand; // noop conversion.
1871 case ISD::SIGN_EXTEND:
1872 assert(MVT::isInteger(VT) && MVT::isInteger(Operand.getValueType()) &&
1873 "Invalid SIGN_EXTEND!");
1874 if (Operand.getValueType() == VT) return Operand; // noop extension
1875 assert(MVT::getSizeInBits(Operand.getValueType()) < MVT::getSizeInBits(VT)
1876 && "Invalid sext node, dst < src!");
1877 if (OpOpcode == ISD::SIGN_EXTEND || OpOpcode == ISD::ZERO_EXTEND)
1878 return getNode(OpOpcode, VT, Operand.Val->getOperand(0));
1880 case ISD::ZERO_EXTEND:
1881 assert(MVT::isInteger(VT) && MVT::isInteger(Operand.getValueType()) &&
1882 "Invalid ZERO_EXTEND!");
1883 if (Operand.getValueType() == VT) return Operand; // noop extension
1884 assert(MVT::getSizeInBits(Operand.getValueType()) < MVT::getSizeInBits(VT)
1885 && "Invalid zext node, dst < src!");
1886 if (OpOpcode == ISD::ZERO_EXTEND) // (zext (zext x)) -> (zext x)
1887 return getNode(ISD::ZERO_EXTEND, VT, Operand.Val->getOperand(0));
1889 case ISD::ANY_EXTEND:
1890 assert(MVT::isInteger(VT) && MVT::isInteger(Operand.getValueType()) &&
1891 "Invalid ANY_EXTEND!");
1892 if (Operand.getValueType() == VT) return Operand; // noop extension
1893 assert(MVT::getSizeInBits(Operand.getValueType()) < MVT::getSizeInBits(VT)
1894 && "Invalid anyext node, dst < src!");
1895 if (OpOpcode == ISD::ZERO_EXTEND || OpOpcode == ISD::SIGN_EXTEND)
1896 // (ext (zext x)) -> (zext x) and (ext (sext x)) -> (sext x)
1897 return getNode(OpOpcode, VT, Operand.Val->getOperand(0));
1900 assert(MVT::isInteger(VT) && MVT::isInteger(Operand.getValueType()) &&
1901 "Invalid TRUNCATE!");
1902 if (Operand.getValueType() == VT) return Operand; // noop truncate
1903 assert(MVT::getSizeInBits(Operand.getValueType()) > MVT::getSizeInBits(VT)
1904 && "Invalid truncate node, src < dst!");
1905 if (OpOpcode == ISD::TRUNCATE)
1906 return getNode(ISD::TRUNCATE, VT, Operand.Val->getOperand(0));
1907 else if (OpOpcode == ISD::ZERO_EXTEND || OpOpcode == ISD::SIGN_EXTEND ||
1908 OpOpcode == ISD::ANY_EXTEND) {
1909 // If the source is smaller than the dest, we still need an extend.
1910 if (MVT::getSizeInBits(Operand.Val->getOperand(0).getValueType())
1911 < MVT::getSizeInBits(VT))
1912 return getNode(OpOpcode, VT, Operand.Val->getOperand(0));
1913 else if (MVT::getSizeInBits(Operand.Val->getOperand(0).getValueType())
1914 > MVT::getSizeInBits(VT))
1915 return getNode(ISD::TRUNCATE, VT, Operand.Val->getOperand(0));
1917 return Operand.Val->getOperand(0);
1920 case ISD::BIT_CONVERT:
1921 // Basic sanity checking.
1922 assert(MVT::getSizeInBits(VT) == MVT::getSizeInBits(Operand.getValueType())
1923 && "Cannot BIT_CONVERT between types of different sizes!");
1924 if (VT == Operand.getValueType()) return Operand; // noop conversion.
1925 if (OpOpcode == ISD::BIT_CONVERT) // bitconv(bitconv(x)) -> bitconv(x)
1926 return getNode(ISD::BIT_CONVERT, VT, Operand.getOperand(0));
1927 if (OpOpcode == ISD::UNDEF)
1928 return getNode(ISD::UNDEF, VT);
1930 case ISD::SCALAR_TO_VECTOR:
1931 assert(MVT::isVector(VT) && !MVT::isVector(Operand.getValueType()) &&
1932 MVT::getVectorElementType(VT) == Operand.getValueType() &&
1933 "Illegal SCALAR_TO_VECTOR node!");
1936 if (OpOpcode == ISD::FSUB) // -(X-Y) -> (Y-X)
1937 return getNode(ISD::FSUB, VT, Operand.Val->getOperand(1),
1938 Operand.Val->getOperand(0));
1939 if (OpOpcode == ISD::FNEG) // --X -> X
1940 return Operand.Val->getOperand(0);
1943 if (OpOpcode == ISD::FNEG) // abs(-X) -> abs(X)
1944 return getNode(ISD::FABS, VT, Operand.Val->getOperand(0));
1949 SDVTList VTs = getVTList(VT);
1950 if (VT != MVT::Flag) { // Don't CSE flag producing nodes
1951 FoldingSetNodeID ID;
1952 SDOperand Ops[1] = { Operand };
1953 AddNodeIDNode(ID, Opcode, VTs, Ops, 1);
1955 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
1956 return SDOperand(E, 0);
1957 N = new UnarySDNode(Opcode, VTs, Operand);
1958 CSEMap.InsertNode(N, IP);
1960 N = new UnarySDNode(Opcode, VTs, Operand);
1962 AllNodes.push_back(N);
1963 return SDOperand(N, 0);
1968 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT,
1969 SDOperand N1, SDOperand N2) {
1970 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1.Val);
1971 ConstantSDNode *N2C = dyn_cast<ConstantSDNode>(N2.Val);
1974 case ISD::TokenFactor:
1975 assert(VT == MVT::Other && N1.getValueType() == MVT::Other &&
1976 N2.getValueType() == MVT::Other && "Invalid token factor!");
1977 // Fold trivial token factors.
1978 if (N1.getOpcode() == ISD::EntryToken) return N2;
1979 if (N2.getOpcode() == ISD::EntryToken) return N1;
1982 assert(MVT::isInteger(VT) && N1.getValueType() == N2.getValueType() &&
1983 N1.getValueType() == VT && "Binary operator types must match!");
1984 // (X & 0) -> 0. This commonly occurs when legalizing i64 values, so it's
1985 // worth handling here.
1986 if (N2C && N2C->getValue() == 0)
1988 if (N2C && N2C->isAllOnesValue()) // X & -1 -> X
1993 assert(MVT::isInteger(VT) && N1.getValueType() == N2.getValueType() &&
1994 N1.getValueType() == VT && "Binary operator types must match!");
1995 // (X ^| 0) -> X. This commonly occurs when legalizing i64 values, so it's
1996 // worth handling here.
1997 if (N2C && N2C->getValue() == 0)
2004 assert(MVT::isInteger(VT) && "This operator does not apply to FP types!");
2016 assert(N1.getValueType() == N2.getValueType() &&
2017 N1.getValueType() == VT && "Binary operator types must match!");
2019 case ISD::FCOPYSIGN: // N1 and result must match. N1/N2 need not match.
2020 assert(N1.getValueType() == VT &&
2021 MVT::isFloatingPoint(N1.getValueType()) &&
2022 MVT::isFloatingPoint(N2.getValueType()) &&
2023 "Invalid FCOPYSIGN!");
2030 assert(VT == N1.getValueType() &&
2031 "Shift operators return type must be the same as their first arg");
2032 assert(MVT::isInteger(VT) && MVT::isInteger(N2.getValueType()) &&
2033 VT != MVT::i1 && "Shifts only work on integers");
2035 case ISD::FP_ROUND_INREG: {
2036 MVT::ValueType EVT = cast<VTSDNode>(N2)->getVT();
2037 assert(VT == N1.getValueType() && "Not an inreg round!");
2038 assert(MVT::isFloatingPoint(VT) && MVT::isFloatingPoint(EVT) &&
2039 "Cannot FP_ROUND_INREG integer types");
2040 assert(MVT::getSizeInBits(EVT) <= MVT::getSizeInBits(VT) &&
2041 "Not rounding down!");
2042 if (cast<VTSDNode>(N2)->getVT() == VT) return N1; // Not actually rounding.
2046 assert(MVT::isFloatingPoint(VT) &&
2047 MVT::isFloatingPoint(N1.getValueType()) &&
2048 MVT::getSizeInBits(VT) <= MVT::getSizeInBits(N1.getValueType()) &&
2049 isa<ConstantSDNode>(N2) && "Invalid FP_ROUND!");
2050 if (N1.getValueType() == VT) return N1; // noop conversion.
2052 case ISD::AssertSext:
2053 case ISD::AssertZext: {
2054 MVT::ValueType EVT = cast<VTSDNode>(N2)->getVT();
2055 assert(VT == N1.getValueType() && "Not an inreg extend!");
2056 assert(MVT::isInteger(VT) && MVT::isInteger(EVT) &&
2057 "Cannot *_EXTEND_INREG FP types");
2058 assert(MVT::getSizeInBits(EVT) <= MVT::getSizeInBits(VT) &&
2060 if (VT == EVT) return N1; // noop assertion.
2063 case ISD::SIGN_EXTEND_INREG: {
2064 MVT::ValueType EVT = cast<VTSDNode>(N2)->getVT();
2065 assert(VT == N1.getValueType() && "Not an inreg extend!");
2066 assert(MVT::isInteger(VT) && MVT::isInteger(EVT) &&
2067 "Cannot *_EXTEND_INREG FP types");
2068 assert(MVT::getSizeInBits(EVT) <= MVT::getSizeInBits(VT) &&
2070 if (EVT == VT) return N1; // Not actually extending
2073 int64_t Val = N1C->getValue();
2074 unsigned FromBits = MVT::getSizeInBits(cast<VTSDNode>(N2)->getVT());
2075 Val <<= 64-FromBits;
2076 Val >>= 64-FromBits;
2077 return getConstant(Val, VT);
2081 case ISD::EXTRACT_VECTOR_ELT:
2082 assert(N2C && "Bad EXTRACT_VECTOR_ELT!");
2084 // EXTRACT_VECTOR_ELT of CONCAT_VECTORS is often formed while lowering is
2085 // expanding copies of large vectors from registers.
2086 if (N1.getOpcode() == ISD::CONCAT_VECTORS &&
2087 N1.getNumOperands() > 0) {
2089 MVT::getVectorNumElements(N1.getOperand(0).getValueType());
2090 return getNode(ISD::EXTRACT_VECTOR_ELT, VT,
2091 N1.getOperand(N2C->getValue() / Factor),
2092 getConstant(N2C->getValue() % Factor, N2.getValueType()));
2095 // EXTRACT_VECTOR_ELT of BUILD_VECTOR is often formed while lowering is
2096 // expanding large vector constants.
2097 if (N1.getOpcode() == ISD::BUILD_VECTOR)
2098 return N1.getOperand(N2C->getValue());
2100 // EXTRACT_VECTOR_ELT of INSERT_VECTOR_ELT is often formed when vector
2101 // operations are lowered to scalars.
2102 if (N1.getOpcode() == ISD::INSERT_VECTOR_ELT)
2103 if (ConstantSDNode *IEC = dyn_cast<ConstantSDNode>(N1.getOperand(2))) {
2105 return N1.getOperand(1);
2107 return getNode(ISD::EXTRACT_VECTOR_ELT, VT, N1.getOperand(0), N2);
2110 case ISD::EXTRACT_ELEMENT:
2111 assert(N2C && (unsigned)N2C->getValue() < 2 && "Bad EXTRACT_ELEMENT!");
2113 // EXTRACT_ELEMENT of BUILD_PAIR is often formed while legalize is expanding
2114 // 64-bit integers into 32-bit parts. Instead of building the extract of
2115 // the BUILD_PAIR, only to have legalize rip it apart, just do it now.
2116 if (N1.getOpcode() == ISD::BUILD_PAIR)
2117 return N1.getOperand(N2C->getValue());
2119 // EXTRACT_ELEMENT of a constant int is also very common.
2120 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(N1)) {
2121 unsigned Shift = MVT::getSizeInBits(VT) * N2C->getValue();
2122 return getConstant(C->getValue() >> Shift, VT);
2129 uint64_t C1 = N1C->getValue(), C2 = N2C->getValue();
2131 case ISD::ADD: return getConstant(C1 + C2, VT);
2132 case ISD::SUB: return getConstant(C1 - C2, VT);
2133 case ISD::MUL: return getConstant(C1 * C2, VT);
2135 if (C2) return getConstant(C1 / C2, VT);
2138 if (C2) return getConstant(C1 % C2, VT);
2141 if (C2) return getConstant(N1C->getSignExtended() /
2142 N2C->getSignExtended(), VT);
2145 if (C2) return getConstant(N1C->getSignExtended() %
2146 N2C->getSignExtended(), VT);
2148 case ISD::AND : return getConstant(C1 & C2, VT);
2149 case ISD::OR : return getConstant(C1 | C2, VT);
2150 case ISD::XOR : return getConstant(C1 ^ C2, VT);
2151 case ISD::SHL : return getConstant(C1 << C2, VT);
2152 case ISD::SRL : return getConstant(C1 >> C2, VT);
2153 case ISD::SRA : return getConstant(N1C->getSignExtended() >>(int)C2, VT);
2155 return getConstant((C1 << C2) | (C1 >> (MVT::getSizeInBits(VT) - C2)),
2158 return getConstant((C1 >> C2) | (C1 << (MVT::getSizeInBits(VT) - C2)),
2162 } else { // Cannonicalize constant to RHS if commutative
2163 if (isCommutativeBinOp(Opcode)) {
2164 std::swap(N1C, N2C);
2170 // Constant fold FP operations.
2171 ConstantFPSDNode *N1CFP = dyn_cast<ConstantFPSDNode>(N1.Val);
2172 ConstantFPSDNode *N2CFP = dyn_cast<ConstantFPSDNode>(N2.Val);
2174 if (!N2CFP && isCommutativeBinOp(Opcode)) {
2175 // Cannonicalize constant to RHS if commutative
2176 std::swap(N1CFP, N2CFP);
2178 } else if (N2CFP && VT != MVT::ppcf128) {
2179 APFloat V1 = N1CFP->getValueAPF(), V2 = N2CFP->getValueAPF();
2180 APFloat::opStatus s;
2183 s = V1.add(V2, APFloat::rmNearestTiesToEven);
2184 if (s != APFloat::opInvalidOp)
2185 return getConstantFP(V1, VT);
2188 s = V1.subtract(V2, APFloat::rmNearestTiesToEven);
2189 if (s!=APFloat::opInvalidOp)
2190 return getConstantFP(V1, VT);
2193 s = V1.multiply(V2, APFloat::rmNearestTiesToEven);
2194 if (s!=APFloat::opInvalidOp)
2195 return getConstantFP(V1, VT);
2198 s = V1.divide(V2, APFloat::rmNearestTiesToEven);
2199 if (s!=APFloat::opInvalidOp && s!=APFloat::opDivByZero)
2200 return getConstantFP(V1, VT);
2203 s = V1.mod(V2, APFloat::rmNearestTiesToEven);
2204 if (s!=APFloat::opInvalidOp && s!=APFloat::opDivByZero)
2205 return getConstantFP(V1, VT);
2207 case ISD::FCOPYSIGN:
2209 return getConstantFP(V1, VT);
2215 // Canonicalize an UNDEF to the RHS, even over a constant.
2216 if (N1.getOpcode() == ISD::UNDEF) {
2217 if (isCommutativeBinOp(Opcode)) {
2221 case ISD::FP_ROUND_INREG:
2222 case ISD::SIGN_EXTEND_INREG:
2228 return N1; // fold op(undef, arg2) -> undef
2235 if (!MVT::isVector(VT))
2236 return getConstant(0, VT); // fold op(undef, arg2) -> 0
2237 // For vectors, we can't easily build an all zero vector, just return
2244 // Fold a bunch of operators when the RHS is undef.
2245 if (N2.getOpcode() == ISD::UNDEF) {
2261 return N2; // fold op(arg1, undef) -> undef
2266 if (!MVT::isVector(VT))
2267 return getConstant(0, VT); // fold op(arg1, undef) -> 0
2268 // For vectors, we can't easily build an all zero vector, just return
2272 if (!MVT::isVector(VT))
2273 return getConstant(MVT::getIntVTBitMask(VT), VT);
2274 // For vectors, we can't easily build an all one vector, just return
2282 // Memoize this node if possible.
2284 SDVTList VTs = getVTList(VT);
2285 if (VT != MVT::Flag) {
2286 SDOperand Ops[] = { N1, N2 };
2287 FoldingSetNodeID ID;
2288 AddNodeIDNode(ID, Opcode, VTs, Ops, 2);
2290 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
2291 return SDOperand(E, 0);
2292 N = new BinarySDNode(Opcode, VTs, N1, N2);
2293 CSEMap.InsertNode(N, IP);
2295 N = new BinarySDNode(Opcode, VTs, N1, N2);
2298 AllNodes.push_back(N);
2299 return SDOperand(N, 0);
2302 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT,
2303 SDOperand N1, SDOperand N2, SDOperand N3) {
2304 // Perform various simplifications.
2305 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1.Val);
2306 ConstantSDNode *N2C = dyn_cast<ConstantSDNode>(N2.Val);
2309 // Use FoldSetCC to simplify SETCC's.
2310 SDOperand Simp = FoldSetCC(VT, N1, N2, cast<CondCodeSDNode>(N3)->get());
2311 if (Simp.Val) return Simp;
2316 if (N1C->getValue())
2317 return N2; // select true, X, Y -> X
2319 return N3; // select false, X, Y -> Y
2321 if (N2 == N3) return N2; // select C, X, X -> X
2325 if (N2C->getValue()) // Unconditional branch
2326 return getNode(ISD::BR, MVT::Other, N1, N3);
2328 return N1; // Never-taken branch
2330 case ISD::VECTOR_SHUFFLE:
2331 assert(VT == N1.getValueType() && VT == N2.getValueType() &&
2332 MVT::isVector(VT) && MVT::isVector(N3.getValueType()) &&
2333 N3.getOpcode() == ISD::BUILD_VECTOR &&
2334 MVT::getVectorNumElements(VT) == N3.getNumOperands() &&
2335 "Illegal VECTOR_SHUFFLE node!");
2337 case ISD::BIT_CONVERT:
2338 // Fold bit_convert nodes from a type to themselves.
2339 if (N1.getValueType() == VT)
2344 // Memoize node if it doesn't produce a flag.
2346 SDVTList VTs = getVTList(VT);
2347 if (VT != MVT::Flag) {
2348 SDOperand Ops[] = { N1, N2, N3 };
2349 FoldingSetNodeID ID;
2350 AddNodeIDNode(ID, Opcode, VTs, Ops, 3);
2352 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
2353 return SDOperand(E, 0);
2354 N = new TernarySDNode(Opcode, VTs, N1, N2, N3);
2355 CSEMap.InsertNode(N, IP);
2357 N = new TernarySDNode(Opcode, VTs, N1, N2, N3);
2359 AllNodes.push_back(N);
2360 return SDOperand(N, 0);
2363 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT,
2364 SDOperand N1, SDOperand N2, SDOperand N3,
2366 SDOperand Ops[] = { N1, N2, N3, N4 };
2367 return getNode(Opcode, VT, Ops, 4);
2370 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT,
2371 SDOperand N1, SDOperand N2, SDOperand N3,
2372 SDOperand N4, SDOperand N5) {
2373 SDOperand Ops[] = { N1, N2, N3, N4, N5 };
2374 return getNode(Opcode, VT, Ops, 5);
2377 SDOperand SelectionDAG::getMemcpy(SDOperand Chain, SDOperand Dest,
2378 SDOperand Src, SDOperand Size,
2380 SDOperand AlwaysInline) {
2381 SDOperand Ops[] = { Chain, Dest, Src, Size, Align, AlwaysInline };
2382 return getNode(ISD::MEMCPY, MVT::Other, Ops, 6);
2385 SDOperand SelectionDAG::getMemmove(SDOperand Chain, SDOperand Dest,
2386 SDOperand Src, SDOperand Size,
2388 SDOperand AlwaysInline) {
2389 SDOperand Ops[] = { Chain, Dest, Src, Size, Align, AlwaysInline };
2390 return getNode(ISD::MEMMOVE, MVT::Other, Ops, 6);
2393 SDOperand SelectionDAG::getMemset(SDOperand Chain, SDOperand Dest,
2394 SDOperand Src, SDOperand Size,
2396 SDOperand AlwaysInline) {
2397 SDOperand Ops[] = { Chain, Dest, Src, Size, Align, AlwaysInline };
2398 return getNode(ISD::MEMSET, MVT::Other, Ops, 6);
2401 SDOperand SelectionDAG::getLoad(MVT::ValueType VT,
2402 SDOperand Chain, SDOperand Ptr,
2403 const Value *SV, int SVOffset,
2404 bool isVolatile, unsigned Alignment) {
2405 if (Alignment == 0) { // Ensure that codegen never sees alignment 0
2407 if (VT != MVT::iPTR) {
2408 Ty = MVT::getTypeForValueType(VT);
2410 const PointerType *PT = dyn_cast<PointerType>(SV->getType());
2411 assert(PT && "Value for load must be a pointer");
2412 Ty = PT->getElementType();
2414 assert(Ty && "Could not get type information for load");
2415 Alignment = TLI.getTargetData()->getABITypeAlignment(Ty);
2417 SDVTList VTs = getVTList(VT, MVT::Other);
2418 SDOperand Undef = getNode(ISD::UNDEF, Ptr.getValueType());
2419 SDOperand Ops[] = { Chain, Ptr, Undef };
2420 FoldingSetNodeID ID;
2421 AddNodeIDNode(ID, ISD::LOAD, VTs, Ops, 3);
2422 ID.AddInteger(ISD::UNINDEXED);
2423 ID.AddInteger(ISD::NON_EXTLOAD);
2424 ID.AddInteger((unsigned int)VT);
2425 ID.AddInteger(Alignment);
2426 ID.AddInteger(isVolatile);
2428 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
2429 return SDOperand(E, 0);
2430 SDNode *N = new LoadSDNode(Ops, VTs, ISD::UNINDEXED,
2431 ISD::NON_EXTLOAD, VT, SV, SVOffset, Alignment,
2433 CSEMap.InsertNode(N, IP);
2434 AllNodes.push_back(N);
2435 return SDOperand(N, 0);
2438 SDOperand SelectionDAG::getExtLoad(ISD::LoadExtType ExtType, MVT::ValueType VT,
2439 SDOperand Chain, SDOperand Ptr,
2441 int SVOffset, MVT::ValueType EVT,
2442 bool isVolatile, unsigned Alignment) {
2443 // If they are asking for an extending load from/to the same thing, return a
2446 return getLoad(VT, Chain, Ptr, SV, SVOffset, isVolatile, Alignment);
2448 if (MVT::isVector(VT))
2449 assert(EVT == MVT::getVectorElementType(VT) && "Invalid vector extload!");
2451 assert(MVT::getSizeInBits(EVT) < MVT::getSizeInBits(VT) &&
2452 "Should only be an extending load, not truncating!");
2453 assert((ExtType == ISD::EXTLOAD || MVT::isInteger(VT)) &&
2454 "Cannot sign/zero extend a FP/Vector load!");
2455 assert(MVT::isInteger(VT) == MVT::isInteger(EVT) &&
2456 "Cannot convert from FP to Int or Int -> FP!");
2458 if (Alignment == 0) { // Ensure that codegen never sees alignment 0
2460 if (VT != MVT::iPTR) {
2461 Ty = MVT::getTypeForValueType(VT);
2463 const PointerType *PT = dyn_cast<PointerType>(SV->getType());
2464 assert(PT && "Value for load must be a pointer");
2465 Ty = PT->getElementType();
2467 assert(Ty && "Could not get type information for load");
2468 Alignment = TLI.getTargetData()->getABITypeAlignment(Ty);
2470 SDVTList VTs = getVTList(VT, MVT::Other);
2471 SDOperand Undef = getNode(ISD::UNDEF, Ptr.getValueType());
2472 SDOperand Ops[] = { Chain, Ptr, Undef };
2473 FoldingSetNodeID ID;
2474 AddNodeIDNode(ID, ISD::LOAD, VTs, Ops, 3);
2475 ID.AddInteger(ISD::UNINDEXED);
2476 ID.AddInteger(ExtType);
2477 ID.AddInteger((unsigned int)EVT);
2478 ID.AddInteger(Alignment);
2479 ID.AddInteger(isVolatile);
2481 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
2482 return SDOperand(E, 0);
2483 SDNode *N = new LoadSDNode(Ops, VTs, ISD::UNINDEXED, ExtType, EVT,
2484 SV, SVOffset, Alignment, isVolatile);
2485 CSEMap.InsertNode(N, IP);
2486 AllNodes.push_back(N);
2487 return SDOperand(N, 0);
2491 SelectionDAG::getIndexedLoad(SDOperand OrigLoad, SDOperand Base,
2492 SDOperand Offset, ISD::MemIndexedMode AM) {
2493 LoadSDNode *LD = cast<LoadSDNode>(OrigLoad);
2494 assert(LD->getOffset().getOpcode() == ISD::UNDEF &&
2495 "Load is already a indexed load!");
2496 MVT::ValueType VT = OrigLoad.getValueType();
2497 SDVTList VTs = getVTList(VT, Base.getValueType(), MVT::Other);
2498 SDOperand Ops[] = { LD->getChain(), Base, Offset };
2499 FoldingSetNodeID ID;
2500 AddNodeIDNode(ID, ISD::LOAD, VTs, Ops, 3);
2502 ID.AddInteger(LD->getExtensionType());
2503 ID.AddInteger((unsigned int)(LD->getMemoryVT()));
2504 ID.AddInteger(LD->getAlignment());
2505 ID.AddInteger(LD->isVolatile());
2507 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
2508 return SDOperand(E, 0);
2509 SDNode *N = new LoadSDNode(Ops, VTs, AM,
2510 LD->getExtensionType(), LD->getMemoryVT(),
2511 LD->getSrcValue(), LD->getSrcValueOffset(),
2512 LD->getAlignment(), LD->isVolatile());
2513 CSEMap.InsertNode(N, IP);
2514 AllNodes.push_back(N);
2515 return SDOperand(N, 0);
2518 SDOperand SelectionDAG::getStore(SDOperand Chain, SDOperand Val,
2519 SDOperand Ptr, const Value *SV, int SVOffset,
2520 bool isVolatile, unsigned Alignment) {
2521 MVT::ValueType VT = Val.getValueType();
2523 if (Alignment == 0) { // Ensure that codegen never sees alignment 0
2525 if (VT != MVT::iPTR) {
2526 Ty = MVT::getTypeForValueType(VT);
2528 const PointerType *PT = dyn_cast<PointerType>(SV->getType());
2529 assert(PT && "Value for store must be a pointer");
2530 Ty = PT->getElementType();
2532 assert(Ty && "Could not get type information for store");
2533 Alignment = TLI.getTargetData()->getABITypeAlignment(Ty);
2535 SDVTList VTs = getVTList(MVT::Other);
2536 SDOperand Undef = getNode(ISD::UNDEF, Ptr.getValueType());
2537 SDOperand Ops[] = { Chain, Val, Ptr, Undef };
2538 FoldingSetNodeID ID;
2539 AddNodeIDNode(ID, ISD::STORE, VTs, Ops, 4);
2540 ID.AddInteger(ISD::UNINDEXED);
2541 ID.AddInteger(false);
2542 ID.AddInteger((unsigned int)VT);
2543 ID.AddInteger(Alignment);
2544 ID.AddInteger(isVolatile);
2546 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
2547 return SDOperand(E, 0);
2548 SDNode *N = new StoreSDNode(Ops, VTs, ISD::UNINDEXED, false,
2549 VT, SV, SVOffset, Alignment, isVolatile);
2550 CSEMap.InsertNode(N, IP);
2551 AllNodes.push_back(N);
2552 return SDOperand(N, 0);
2555 SDOperand SelectionDAG::getTruncStore(SDOperand Chain, SDOperand Val,
2556 SDOperand Ptr, const Value *SV,
2557 int SVOffset, MVT::ValueType SVT,
2558 bool isVolatile, unsigned Alignment) {
2559 MVT::ValueType VT = Val.getValueType();
2562 return getStore(Chain, Val, Ptr, SV, SVOffset, isVolatile, Alignment);
2564 assert(MVT::getSizeInBits(VT) > MVT::getSizeInBits(SVT) &&
2565 "Not a truncation?");
2566 assert(MVT::isInteger(VT) == MVT::isInteger(SVT) &&
2567 "Can't do FP-INT conversion!");
2569 if (Alignment == 0) { // Ensure that codegen never sees alignment 0
2571 if (VT != MVT::iPTR) {
2572 Ty = MVT::getTypeForValueType(VT);
2574 const PointerType *PT = dyn_cast<PointerType>(SV->getType());
2575 assert(PT && "Value for store must be a pointer");
2576 Ty = PT->getElementType();
2578 assert(Ty && "Could not get type information for store");
2579 Alignment = TLI.getTargetData()->getABITypeAlignment(Ty);
2581 SDVTList VTs = getVTList(MVT::Other);
2582 SDOperand Undef = getNode(ISD::UNDEF, Ptr.getValueType());
2583 SDOperand Ops[] = { Chain, Val, Ptr, Undef };
2584 FoldingSetNodeID ID;
2585 AddNodeIDNode(ID, ISD::STORE, VTs, Ops, 4);
2586 ID.AddInteger(ISD::UNINDEXED);
2588 ID.AddInteger((unsigned int)SVT);
2589 ID.AddInteger(Alignment);
2590 ID.AddInteger(isVolatile);
2592 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
2593 return SDOperand(E, 0);
2594 SDNode *N = new StoreSDNode(Ops, VTs, ISD::UNINDEXED, true,
2595 SVT, SV, SVOffset, Alignment, isVolatile);
2596 CSEMap.InsertNode(N, IP);
2597 AllNodes.push_back(N);
2598 return SDOperand(N, 0);
2602 SelectionDAG::getIndexedStore(SDOperand OrigStore, SDOperand Base,
2603 SDOperand Offset, ISD::MemIndexedMode AM) {
2604 StoreSDNode *ST = cast<StoreSDNode>(OrigStore);
2605 assert(ST->getOffset().getOpcode() == ISD::UNDEF &&
2606 "Store is already a indexed store!");
2607 SDVTList VTs = getVTList(Base.getValueType(), MVT::Other);
2608 SDOperand Ops[] = { ST->getChain(), ST->getValue(), Base, Offset };
2609 FoldingSetNodeID ID;
2610 AddNodeIDNode(ID, ISD::STORE, VTs, Ops, 4);
2612 ID.AddInteger(ST->isTruncatingStore());
2613 ID.AddInteger((unsigned int)(ST->getMemoryVT()));
2614 ID.AddInteger(ST->getAlignment());
2615 ID.AddInteger(ST->isVolatile());
2617 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
2618 return SDOperand(E, 0);
2619 SDNode *N = new StoreSDNode(Ops, VTs, AM,
2620 ST->isTruncatingStore(), ST->getMemoryVT(),
2621 ST->getSrcValue(), ST->getSrcValueOffset(),
2622 ST->getAlignment(), ST->isVolatile());
2623 CSEMap.InsertNode(N, IP);
2624 AllNodes.push_back(N);
2625 return SDOperand(N, 0);
2628 SDOperand SelectionDAG::getVAArg(MVT::ValueType VT,
2629 SDOperand Chain, SDOperand Ptr,
2631 SDOperand Ops[] = { Chain, Ptr, SV };
2632 return getNode(ISD::VAARG, getVTList(VT, MVT::Other), Ops, 3);
2635 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT,
2636 const SDOperand *Ops, unsigned NumOps) {
2638 case 0: return getNode(Opcode, VT);
2639 case 1: return getNode(Opcode, VT, Ops[0]);
2640 case 2: return getNode(Opcode, VT, Ops[0], Ops[1]);
2641 case 3: return getNode(Opcode, VT, Ops[0], Ops[1], Ops[2]);
2647 case ISD::SELECT_CC: {
2648 assert(NumOps == 5 && "SELECT_CC takes 5 operands!");
2649 assert(Ops[0].getValueType() == Ops[1].getValueType() &&
2650 "LHS and RHS of condition must have same type!");
2651 assert(Ops[2].getValueType() == Ops[3].getValueType() &&
2652 "True and False arms of SelectCC must have same type!");
2653 assert(Ops[2].getValueType() == VT &&
2654 "select_cc node must be of same type as true and false value!");
2658 assert(NumOps == 5 && "BR_CC takes 5 operands!");
2659 assert(Ops[2].getValueType() == Ops[3].getValueType() &&
2660 "LHS/RHS of comparison should match types!");
2667 SDVTList VTs = getVTList(VT);
2668 if (VT != MVT::Flag) {
2669 FoldingSetNodeID ID;
2670 AddNodeIDNode(ID, Opcode, VTs, Ops, NumOps);
2672 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
2673 return SDOperand(E, 0);
2674 N = new SDNode(Opcode, VTs, Ops, NumOps);
2675 CSEMap.InsertNode(N, IP);
2677 N = new SDNode(Opcode, VTs, Ops, NumOps);
2679 AllNodes.push_back(N);
2680 return SDOperand(N, 0);
2683 SDOperand SelectionDAG::getNode(unsigned Opcode,
2684 std::vector<MVT::ValueType> &ResultTys,
2685 const SDOperand *Ops, unsigned NumOps) {
2686 return getNode(Opcode, getNodeValueTypes(ResultTys), ResultTys.size(),
2690 SDOperand SelectionDAG::getNode(unsigned Opcode,
2691 const MVT::ValueType *VTs, unsigned NumVTs,
2692 const SDOperand *Ops, unsigned NumOps) {
2694 return getNode(Opcode, VTs[0], Ops, NumOps);
2695 return getNode(Opcode, makeVTList(VTs, NumVTs), Ops, NumOps);
2698 SDOperand SelectionDAG::getNode(unsigned Opcode, SDVTList VTList,
2699 const SDOperand *Ops, unsigned NumOps) {
2700 if (VTList.NumVTs == 1)
2701 return getNode(Opcode, VTList.VTs[0], Ops, NumOps);
2704 // FIXME: figure out how to safely handle things like
2705 // int foo(int x) { return 1 << (x & 255); }
2706 // int bar() { return foo(256); }
2708 case ISD::SRA_PARTS:
2709 case ISD::SRL_PARTS:
2710 case ISD::SHL_PARTS:
2711 if (N3.getOpcode() == ISD::SIGN_EXTEND_INREG &&
2712 cast<VTSDNode>(N3.getOperand(1))->getVT() != MVT::i1)
2713 return getNode(Opcode, VT, N1, N2, N3.getOperand(0));
2714 else if (N3.getOpcode() == ISD::AND)
2715 if (ConstantSDNode *AndRHS = dyn_cast<ConstantSDNode>(N3.getOperand(1))) {
2716 // If the and is only masking out bits that cannot effect the shift,
2717 // eliminate the and.
2718 unsigned NumBits = MVT::getSizeInBits(VT)*2;
2719 if ((AndRHS->getValue() & (NumBits-1)) == NumBits-1)
2720 return getNode(Opcode, VT, N1, N2, N3.getOperand(0));
2726 // Memoize the node unless it returns a flag.
2728 if (VTList.VTs[VTList.NumVTs-1] != MVT::Flag) {
2729 FoldingSetNodeID ID;
2730 AddNodeIDNode(ID, Opcode, VTList, Ops, NumOps);
2732 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
2733 return SDOperand(E, 0);
2735 N = new UnarySDNode(Opcode, VTList, Ops[0]);
2736 else if (NumOps == 2)
2737 N = new BinarySDNode(Opcode, VTList, Ops[0], Ops[1]);
2738 else if (NumOps == 3)
2739 N = new TernarySDNode(Opcode, VTList, Ops[0], Ops[1], Ops[2]);
2741 N = new SDNode(Opcode, VTList, Ops, NumOps);
2742 CSEMap.InsertNode(N, IP);
2745 N = new UnarySDNode(Opcode, VTList, Ops[0]);
2746 else if (NumOps == 2)
2747 N = new BinarySDNode(Opcode, VTList, Ops[0], Ops[1]);
2748 else if (NumOps == 3)
2749 N = new TernarySDNode(Opcode, VTList, Ops[0], Ops[1], Ops[2]);
2751 N = new SDNode(Opcode, VTList, Ops, NumOps);
2753 AllNodes.push_back(N);
2754 return SDOperand(N, 0);
2757 SDOperand SelectionDAG::getNode(unsigned Opcode, SDVTList VTList) {
2758 return getNode(Opcode, VTList, 0, 0);
2761 SDOperand SelectionDAG::getNode(unsigned Opcode, SDVTList VTList,
2763 SDOperand Ops[] = { N1 };
2764 return getNode(Opcode, VTList, Ops, 1);
2767 SDOperand SelectionDAG::getNode(unsigned Opcode, SDVTList VTList,
2768 SDOperand N1, SDOperand N2) {
2769 SDOperand Ops[] = { N1, N2 };
2770 return getNode(Opcode, VTList, Ops, 2);
2773 SDOperand SelectionDAG::getNode(unsigned Opcode, SDVTList VTList,
2774 SDOperand N1, SDOperand N2, SDOperand N3) {
2775 SDOperand Ops[] = { N1, N2, N3 };
2776 return getNode(Opcode, VTList, Ops, 3);
2779 SDOperand SelectionDAG::getNode(unsigned Opcode, SDVTList VTList,
2780 SDOperand N1, SDOperand N2, SDOperand N3,
2782 SDOperand Ops[] = { N1, N2, N3, N4 };
2783 return getNode(Opcode, VTList, Ops, 4);
2786 SDOperand SelectionDAG::getNode(unsigned Opcode, SDVTList VTList,
2787 SDOperand N1, SDOperand N2, SDOperand N3,
2788 SDOperand N4, SDOperand N5) {
2789 SDOperand Ops[] = { N1, N2, N3, N4, N5 };
2790 return getNode(Opcode, VTList, Ops, 5);
2793 SDVTList SelectionDAG::getVTList(MVT::ValueType VT) {
2794 return makeVTList(SDNode::getValueTypeList(VT), 1);
2797 SDVTList SelectionDAG::getVTList(MVT::ValueType VT1, MVT::ValueType VT2) {
2798 for (std::list<std::vector<MVT::ValueType> >::iterator I = VTList.begin(),
2799 E = VTList.end(); I != E; ++I) {
2800 if (I->size() == 2 && (*I)[0] == VT1 && (*I)[1] == VT2)
2801 return makeVTList(&(*I)[0], 2);
2803 std::vector<MVT::ValueType> V;
2806 VTList.push_front(V);
2807 return makeVTList(&(*VTList.begin())[0], 2);
2809 SDVTList SelectionDAG::getVTList(MVT::ValueType VT1, MVT::ValueType VT2,
2810 MVT::ValueType VT3) {
2811 for (std::list<std::vector<MVT::ValueType> >::iterator I = VTList.begin(),
2812 E = VTList.end(); I != E; ++I) {
2813 if (I->size() == 3 && (*I)[0] == VT1 && (*I)[1] == VT2 &&
2815 return makeVTList(&(*I)[0], 3);
2817 std::vector<MVT::ValueType> V;
2821 VTList.push_front(V);
2822 return makeVTList(&(*VTList.begin())[0], 3);
2825 SDVTList SelectionDAG::getVTList(const MVT::ValueType *VTs, unsigned NumVTs) {
2827 case 0: assert(0 && "Cannot have nodes without results!");
2828 case 1: return getVTList(VTs[0]);
2829 case 2: return getVTList(VTs[0], VTs[1]);
2830 case 3: return getVTList(VTs[0], VTs[1], VTs[2]);
2834 for (std::list<std::vector<MVT::ValueType> >::iterator I = VTList.begin(),
2835 E = VTList.end(); I != E; ++I) {
2836 if (I->size() != NumVTs || VTs[0] != (*I)[0] || VTs[1] != (*I)[1]) continue;
2838 bool NoMatch = false;
2839 for (unsigned i = 2; i != NumVTs; ++i)
2840 if (VTs[i] != (*I)[i]) {
2845 return makeVTList(&*I->begin(), NumVTs);
2848 VTList.push_front(std::vector<MVT::ValueType>(VTs, VTs+NumVTs));
2849 return makeVTList(&*VTList.begin()->begin(), NumVTs);
2853 /// UpdateNodeOperands - *Mutate* the specified node in-place to have the
2854 /// specified operands. If the resultant node already exists in the DAG,
2855 /// this does not modify the specified node, instead it returns the node that
2856 /// already exists. If the resultant node does not exist in the DAG, the
2857 /// input node is returned. As a degenerate case, if you specify the same
2858 /// input operands as the node already has, the input node is returned.
2859 SDOperand SelectionDAG::
2860 UpdateNodeOperands(SDOperand InN, SDOperand Op) {
2861 SDNode *N = InN.Val;
2862 assert(N->getNumOperands() == 1 && "Update with wrong number of operands");
2864 // Check to see if there is no change.
2865 if (Op == N->getOperand(0)) return InN;
2867 // See if the modified node already exists.
2868 void *InsertPos = 0;
2869 if (SDNode *Existing = FindModifiedNodeSlot(N, Op, InsertPos))
2870 return SDOperand(Existing, InN.ResNo);
2872 // Nope it doesn't. Remove the node from it's current place in the maps.
2874 RemoveNodeFromCSEMaps(N);
2876 // Now we update the operands.
2877 N->OperandList[0].Val->removeUser(N);
2879 N->OperandList[0] = Op;
2881 // If this gets put into a CSE map, add it.
2882 if (InsertPos) CSEMap.InsertNode(N, InsertPos);
2886 SDOperand SelectionDAG::
2887 UpdateNodeOperands(SDOperand InN, SDOperand Op1, SDOperand Op2) {
2888 SDNode *N = InN.Val;
2889 assert(N->getNumOperands() == 2 && "Update with wrong number of operands");
2891 // Check to see if there is no change.
2892 if (Op1 == N->getOperand(0) && Op2 == N->getOperand(1))
2893 return InN; // No operands changed, just return the input node.
2895 // See if the modified node already exists.
2896 void *InsertPos = 0;
2897 if (SDNode *Existing = FindModifiedNodeSlot(N, Op1, Op2, InsertPos))
2898 return SDOperand(Existing, InN.ResNo);
2900 // Nope it doesn't. Remove the node from it's current place in the maps.
2902 RemoveNodeFromCSEMaps(N);
2904 // Now we update the operands.
2905 if (N->OperandList[0] != Op1) {
2906 N->OperandList[0].Val->removeUser(N);
2907 Op1.Val->addUser(N);
2908 N->OperandList[0] = Op1;
2910 if (N->OperandList[1] != Op2) {
2911 N->OperandList[1].Val->removeUser(N);
2912 Op2.Val->addUser(N);
2913 N->OperandList[1] = Op2;
2916 // If this gets put into a CSE map, add it.
2917 if (InsertPos) CSEMap.InsertNode(N, InsertPos);
2921 SDOperand SelectionDAG::
2922 UpdateNodeOperands(SDOperand N, SDOperand Op1, SDOperand Op2, SDOperand Op3) {
2923 SDOperand Ops[] = { Op1, Op2, Op3 };
2924 return UpdateNodeOperands(N, Ops, 3);
2927 SDOperand SelectionDAG::
2928 UpdateNodeOperands(SDOperand N, SDOperand Op1, SDOperand Op2,
2929 SDOperand Op3, SDOperand Op4) {
2930 SDOperand Ops[] = { Op1, Op2, Op3, Op4 };
2931 return UpdateNodeOperands(N, Ops, 4);
2934 SDOperand SelectionDAG::
2935 UpdateNodeOperands(SDOperand N, SDOperand Op1, SDOperand Op2,
2936 SDOperand Op3, SDOperand Op4, SDOperand Op5) {
2937 SDOperand Ops[] = { Op1, Op2, Op3, Op4, Op5 };
2938 return UpdateNodeOperands(N, Ops, 5);
2942 SDOperand SelectionDAG::
2943 UpdateNodeOperands(SDOperand InN, SDOperand *Ops, unsigned NumOps) {
2944 SDNode *N = InN.Val;
2945 assert(N->getNumOperands() == NumOps &&
2946 "Update with wrong number of operands");
2948 // Check to see if there is no change.
2949 bool AnyChange = false;
2950 for (unsigned i = 0; i != NumOps; ++i) {
2951 if (Ops[i] != N->getOperand(i)) {
2957 // No operands changed, just return the input node.
2958 if (!AnyChange) return InN;
2960 // See if the modified node already exists.
2961 void *InsertPos = 0;
2962 if (SDNode *Existing = FindModifiedNodeSlot(N, Ops, NumOps, InsertPos))
2963 return SDOperand(Existing, InN.ResNo);
2965 // Nope it doesn't. Remove the node from it's current place in the maps.
2967 RemoveNodeFromCSEMaps(N);
2969 // Now we update the operands.
2970 for (unsigned i = 0; i != NumOps; ++i) {
2971 if (N->OperandList[i] != Ops[i]) {
2972 N->OperandList[i].Val->removeUser(N);
2973 Ops[i].Val->addUser(N);
2974 N->OperandList[i] = Ops[i];
2978 // If this gets put into a CSE map, add it.
2979 if (InsertPos) CSEMap.InsertNode(N, InsertPos);
2984 /// MorphNodeTo - This frees the operands of the current node, resets the
2985 /// opcode, types, and operands to the specified value. This should only be
2986 /// used by the SelectionDAG class.
2987 void SDNode::MorphNodeTo(unsigned Opc, SDVTList L,
2988 const SDOperand *Ops, unsigned NumOps) {
2991 NumValues = L.NumVTs;
2993 // Clear the operands list, updating used nodes to remove this from their
2995 for (op_iterator I = op_begin(), E = op_end(); I != E; ++I)
2996 I->Val->removeUser(this);
2998 // If NumOps is larger than the # of operands we currently have, reallocate
2999 // the operand list.
3000 if (NumOps > NumOperands) {
3001 if (OperandsNeedDelete)
3002 delete [] OperandList;
3003 OperandList = new SDOperand[NumOps];
3004 OperandsNeedDelete = true;
3007 // Assign the new operands.
3008 NumOperands = NumOps;
3010 for (unsigned i = 0, e = NumOps; i != e; ++i) {
3011 OperandList[i] = Ops[i];
3012 SDNode *N = OperandList[i].Val;
3013 N->Uses.push_back(this);
3017 /// SelectNodeTo - These are used for target selectors to *mutate* the
3018 /// specified node to have the specified return type, Target opcode, and
3019 /// operands. Note that target opcodes are stored as
3020 /// ISD::BUILTIN_OP_END+TargetOpcode in the node opcode field.
3022 /// Note that SelectNodeTo returns the resultant node. If there is already a
3023 /// node of the specified opcode and operands, it returns that node instead of
3024 /// the current one.
3025 SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
3026 MVT::ValueType VT) {
3027 SDVTList VTs = getVTList(VT);
3028 FoldingSetNodeID ID;
3029 AddNodeIDNode(ID, ISD::BUILTIN_OP_END+TargetOpc, VTs, 0, 0);
3031 if (SDNode *ON = CSEMap.FindNodeOrInsertPos(ID, IP))
3034 RemoveNodeFromCSEMaps(N);
3036 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc, VTs, 0, 0);
3038 CSEMap.InsertNode(N, IP);
3042 SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
3043 MVT::ValueType VT, SDOperand Op1) {
3044 // If an identical node already exists, use it.
3045 SDVTList VTs = getVTList(VT);
3046 SDOperand Ops[] = { Op1 };
3048 FoldingSetNodeID ID;
3049 AddNodeIDNode(ID, ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 1);
3051 if (SDNode *ON = CSEMap.FindNodeOrInsertPos(ID, IP))
3054 RemoveNodeFromCSEMaps(N);
3055 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 1);
3056 CSEMap.InsertNode(N, IP);
3060 SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
3061 MVT::ValueType VT, SDOperand Op1,
3063 // If an identical node already exists, use it.
3064 SDVTList VTs = getVTList(VT);
3065 SDOperand Ops[] = { Op1, Op2 };
3067 FoldingSetNodeID ID;
3068 AddNodeIDNode(ID, ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 2);
3070 if (SDNode *ON = CSEMap.FindNodeOrInsertPos(ID, IP))
3073 RemoveNodeFromCSEMaps(N);
3075 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 2);
3077 CSEMap.InsertNode(N, IP); // Memoize the new node.
3081 SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
3082 MVT::ValueType VT, SDOperand Op1,
3083 SDOperand Op2, SDOperand Op3) {
3084 // If an identical node already exists, use it.
3085 SDVTList VTs = getVTList(VT);
3086 SDOperand Ops[] = { Op1, Op2, Op3 };
3087 FoldingSetNodeID ID;
3088 AddNodeIDNode(ID, ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 3);
3090 if (SDNode *ON = CSEMap.FindNodeOrInsertPos(ID, IP))
3093 RemoveNodeFromCSEMaps(N);
3095 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 3);
3097 CSEMap.InsertNode(N, IP); // Memoize the new node.
3101 SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
3102 MVT::ValueType VT, const SDOperand *Ops,
3104 // If an identical node already exists, use it.
3105 SDVTList VTs = getVTList(VT);
3106 FoldingSetNodeID ID;
3107 AddNodeIDNode(ID, ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, NumOps);
3109 if (SDNode *ON = CSEMap.FindNodeOrInsertPos(ID, IP))
3112 RemoveNodeFromCSEMaps(N);
3113 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, NumOps);
3115 CSEMap.InsertNode(N, IP); // Memoize the new node.
3119 SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
3120 MVT::ValueType VT1, MVT::ValueType VT2,
3121 SDOperand Op1, SDOperand Op2) {
3122 SDVTList VTs = getVTList(VT1, VT2);
3123 FoldingSetNodeID ID;
3124 SDOperand Ops[] = { Op1, Op2 };
3125 AddNodeIDNode(ID, ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 2);
3127 if (SDNode *ON = CSEMap.FindNodeOrInsertPos(ID, IP))
3130 RemoveNodeFromCSEMaps(N);
3131 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 2);
3132 CSEMap.InsertNode(N, IP); // Memoize the new node.
3136 SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
3137 MVT::ValueType VT1, MVT::ValueType VT2,
3138 SDOperand Op1, SDOperand Op2,
3140 // If an identical node already exists, use it.
3141 SDVTList VTs = getVTList(VT1, VT2);
3142 SDOperand Ops[] = { Op1, Op2, Op3 };
3143 FoldingSetNodeID ID;
3144 AddNodeIDNode(ID, ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 3);
3146 if (SDNode *ON = CSEMap.FindNodeOrInsertPos(ID, IP))
3149 RemoveNodeFromCSEMaps(N);
3151 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 3);
3152 CSEMap.InsertNode(N, IP); // Memoize the new node.
3157 /// getTargetNode - These are used for target selectors to create a new node
3158 /// with specified return type(s), target opcode, and operands.
3160 /// Note that getTargetNode returns the resultant node. If there is already a
3161 /// node of the specified opcode and operands, it returns that node instead of
3162 /// the current one.
3163 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT) {
3164 return getNode(ISD::BUILTIN_OP_END+Opcode, VT).Val;
3166 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT,
3168 return getNode(ISD::BUILTIN_OP_END+Opcode, VT, Op1).Val;
3170 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT,
3171 SDOperand Op1, SDOperand Op2) {
3172 return getNode(ISD::BUILTIN_OP_END+Opcode, VT, Op1, Op2).Val;
3174 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT,
3175 SDOperand Op1, SDOperand Op2,
3177 return getNode(ISD::BUILTIN_OP_END+Opcode, VT, Op1, Op2, Op3).Val;
3179 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT,
3180 const SDOperand *Ops, unsigned NumOps) {
3181 return getNode(ISD::BUILTIN_OP_END+Opcode, VT, Ops, NumOps).Val;
3183 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
3184 MVT::ValueType VT2) {
3185 const MVT::ValueType *VTs = getNodeValueTypes(VT1, VT2);
3187 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 2, &Op, 0).Val;
3189 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
3190 MVT::ValueType VT2, SDOperand Op1) {
3191 const MVT::ValueType *VTs = getNodeValueTypes(VT1, VT2);
3192 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 2, &Op1, 1).Val;
3194 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
3195 MVT::ValueType VT2, SDOperand Op1,
3197 const MVT::ValueType *VTs = getNodeValueTypes(VT1, VT2);
3198 SDOperand Ops[] = { Op1, Op2 };
3199 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 2, Ops, 2).Val;
3201 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
3202 MVT::ValueType VT2, SDOperand Op1,
3203 SDOperand Op2, SDOperand Op3) {
3204 const MVT::ValueType *VTs = getNodeValueTypes(VT1, VT2);
3205 SDOperand Ops[] = { Op1, Op2, Op3 };
3206 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 2, Ops, 3).Val;
3208 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
3210 const SDOperand *Ops, unsigned NumOps) {
3211 const MVT::ValueType *VTs = getNodeValueTypes(VT1, VT2);
3212 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 2, Ops, NumOps).Val;
3214 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
3215 MVT::ValueType VT2, MVT::ValueType VT3,
3216 SDOperand Op1, SDOperand Op2) {
3217 const MVT::ValueType *VTs = getNodeValueTypes(VT1, VT2, VT3);
3218 SDOperand Ops[] = { Op1, Op2 };
3219 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 3, Ops, 2).Val;
3221 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
3222 MVT::ValueType VT2, MVT::ValueType VT3,
3223 SDOperand Op1, SDOperand Op2,
3225 const MVT::ValueType *VTs = getNodeValueTypes(VT1, VT2, VT3);
3226 SDOperand Ops[] = { Op1, Op2, Op3 };
3227 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 3, Ops, 3).Val;
3229 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
3230 MVT::ValueType VT2, MVT::ValueType VT3,
3231 const SDOperand *Ops, unsigned NumOps) {
3232 const MVT::ValueType *VTs = getNodeValueTypes(VT1, VT2, VT3);
3233 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 3, Ops, NumOps).Val;
3235 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
3236 MVT::ValueType VT2, MVT::ValueType VT3,
3238 const SDOperand *Ops, unsigned NumOps) {
3239 std::vector<MVT::ValueType> VTList;
3240 VTList.push_back(VT1);
3241 VTList.push_back(VT2);
3242 VTList.push_back(VT3);
3243 VTList.push_back(VT4);
3244 const MVT::ValueType *VTs = getNodeValueTypes(VTList);
3245 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 4, Ops, NumOps).Val;
3247 SDNode *SelectionDAG::getTargetNode(unsigned Opcode,
3248 std::vector<MVT::ValueType> &ResultTys,
3249 const SDOperand *Ops, unsigned NumOps) {
3250 const MVT::ValueType *VTs = getNodeValueTypes(ResultTys);
3251 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, ResultTys.size(),
3256 /// ReplaceAllUsesWith - Modify anything using 'From' to use 'To' instead.
3257 /// This can cause recursive merging of nodes in the DAG.
3259 /// This version assumes From has a single result value.
3261 void SelectionDAG::ReplaceAllUsesWith(SDOperand FromN, SDOperand To,
3262 DAGUpdateListener *UpdateListener) {
3263 SDNode *From = FromN.Val;
3264 assert(From->getNumValues() == 1 && FromN.ResNo == 0 &&
3265 "Cannot replace with this method!");
3266 assert(From != To.Val && "Cannot replace uses of with self");
3268 while (!From->use_empty()) {
3269 // Process users until they are all gone.
3270 SDNode *U = *From->use_begin();
3272 // This node is about to morph, remove its old self from the CSE maps.
3273 RemoveNodeFromCSEMaps(U);
3275 for (SDOperand *I = U->OperandList, *E = U->OperandList+U->NumOperands;
3277 if (I->Val == From) {
3278 From->removeUser(U);
3283 // Now that we have modified U, add it back to the CSE maps. If it already
3284 // exists there, recursively merge the results together.
3285 if (SDNode *Existing = AddNonLeafNodeToCSEMaps(U)) {
3286 ReplaceAllUsesWith(U, Existing, UpdateListener);
3287 // U is now dead. Inform the listener if it exists and delete it.
3289 UpdateListener->NodeDeleted(U);
3290 DeleteNodeNotInCSEMaps(U);
3292 // If the node doesn't already exist, we updated it. Inform a listener if
3295 UpdateListener->NodeUpdated(U);
3300 /// ReplaceAllUsesWith - Modify anything using 'From' to use 'To' instead.
3301 /// This can cause recursive merging of nodes in the DAG.
3303 /// This version assumes From/To have matching types and numbers of result
3306 void SelectionDAG::ReplaceAllUsesWith(SDNode *From, SDNode *To,
3307 DAGUpdateListener *UpdateListener) {
3308 assert(From != To && "Cannot replace uses of with self");
3309 assert(From->getNumValues() == To->getNumValues() &&
3310 "Cannot use this version of ReplaceAllUsesWith!");
3311 if (From->getNumValues() == 1) // If possible, use the faster version.
3312 return ReplaceAllUsesWith(SDOperand(From, 0), SDOperand(To, 0),
3315 while (!From->use_empty()) {
3316 // Process users until they are all gone.
3317 SDNode *U = *From->use_begin();
3319 // This node is about to morph, remove its old self from the CSE maps.
3320 RemoveNodeFromCSEMaps(U);
3322 for (SDOperand *I = U->OperandList, *E = U->OperandList+U->NumOperands;
3324 if (I->Val == From) {
3325 From->removeUser(U);
3330 // Now that we have modified U, add it back to the CSE maps. If it already
3331 // exists there, recursively merge the results together.
3332 if (SDNode *Existing = AddNonLeafNodeToCSEMaps(U)) {
3333 ReplaceAllUsesWith(U, Existing, UpdateListener);
3334 // U is now dead. Inform the listener if it exists and delete it.
3336 UpdateListener->NodeDeleted(U);
3337 DeleteNodeNotInCSEMaps(U);
3339 // If the node doesn't already exist, we updated it. Inform a listener if
3342 UpdateListener->NodeUpdated(U);
3347 /// ReplaceAllUsesWith - Modify anything using 'From' to use 'To' instead.
3348 /// This can cause recursive merging of nodes in the DAG.
3350 /// This version can replace From with any result values. To must match the
3351 /// number and types of values returned by From.
3352 void SelectionDAG::ReplaceAllUsesWith(SDNode *From,
3353 const SDOperand *To,
3354 DAGUpdateListener *UpdateListener) {
3355 if (From->getNumValues() == 1) // Handle the simple case efficiently.
3356 return ReplaceAllUsesWith(SDOperand(From, 0), To[0], UpdateListener);
3358 while (!From->use_empty()) {
3359 // Process users until they are all gone.
3360 SDNode *U = *From->use_begin();
3362 // This node is about to morph, remove its old self from the CSE maps.
3363 RemoveNodeFromCSEMaps(U);
3365 for (SDOperand *I = U->OperandList, *E = U->OperandList+U->NumOperands;
3367 if (I->Val == From) {
3368 const SDOperand &ToOp = To[I->ResNo];
3369 From->removeUser(U);
3371 ToOp.Val->addUser(U);
3374 // Now that we have modified U, add it back to the CSE maps. If it already
3375 // exists there, recursively merge the results together.
3376 if (SDNode *Existing = AddNonLeafNodeToCSEMaps(U)) {
3377 ReplaceAllUsesWith(U, Existing, UpdateListener);
3378 // U is now dead. Inform the listener if it exists and delete it.
3380 UpdateListener->NodeDeleted(U);
3381 DeleteNodeNotInCSEMaps(U);
3383 // If the node doesn't already exist, we updated it. Inform a listener if
3386 UpdateListener->NodeUpdated(U);
3392 /// ChainedSetUpdaterListener - This class is a DAGUpdateListener that removes
3393 /// any deleted nodes from the set passed into its constructor and recursively
3394 /// notifies another update listener if specified.
3395 class ChainedSetUpdaterListener :
3396 public SelectionDAG::DAGUpdateListener {
3397 SmallSetVector<SDNode*, 16> &Set;
3398 SelectionDAG::DAGUpdateListener *Chain;
3400 ChainedSetUpdaterListener(SmallSetVector<SDNode*, 16> &set,
3401 SelectionDAG::DAGUpdateListener *chain)
3402 : Set(set), Chain(chain) {}
3404 virtual void NodeDeleted(SDNode *N) {
3406 if (Chain) Chain->NodeDeleted(N);
3408 virtual void NodeUpdated(SDNode *N) {
3409 if (Chain) Chain->NodeUpdated(N);
3414 /// ReplaceAllUsesOfValueWith - Replace any uses of From with To, leaving
3415 /// uses of other values produced by From.Val alone. The Deleted vector is
3416 /// handled the same way as for ReplaceAllUsesWith.
3417 void SelectionDAG::ReplaceAllUsesOfValueWith(SDOperand From, SDOperand To,
3418 DAGUpdateListener *UpdateListener){
3419 assert(From != To && "Cannot replace a value with itself");
3421 // Handle the simple, trivial, case efficiently.
3422 if (From.Val->getNumValues() == 1) {
3423 ReplaceAllUsesWith(From, To, UpdateListener);
3427 if (From.use_empty()) return;
3429 // Get all of the users of From.Val. We want these in a nice,
3430 // deterministically ordered and uniqued set, so we use a SmallSetVector.
3431 SmallSetVector<SDNode*, 16> Users(From.Val->use_begin(), From.Val->use_end());
3433 // When one of the recursive merges deletes nodes from the graph, we need to
3434 // make sure that UpdateListener is notified *and* that the node is removed
3435 // from Users if present. CSUL does this.
3436 ChainedSetUpdaterListener CSUL(Users, UpdateListener);
3438 while (!Users.empty()) {
3439 // We know that this user uses some value of From. If it is the right
3440 // value, update it.
3441 SDNode *User = Users.back();
3444 // Scan for an operand that matches From.
3445 SDOperand *Op = User->OperandList, *E = User->OperandList+User->NumOperands;
3446 for (; Op != E; ++Op)
3447 if (*Op == From) break;
3449 // If there are no matches, the user must use some other result of From.
3450 if (Op == E) continue;
3452 // Okay, we know this user needs to be updated. Remove its old self
3453 // from the CSE maps.
3454 RemoveNodeFromCSEMaps(User);
3456 // Update all operands that match "From" in case there are multiple uses.
3457 for (; Op != E; ++Op) {
3459 From.Val->removeUser(User);
3461 To.Val->addUser(User);
3465 // Now that we have modified User, add it back to the CSE maps. If it
3466 // already exists there, recursively merge the results together.
3467 SDNode *Existing = AddNonLeafNodeToCSEMaps(User);
3469 if (UpdateListener) UpdateListener->NodeUpdated(User);
3470 continue; // Continue on to next user.
3473 // If there was already an existing matching node, use ReplaceAllUsesWith
3474 // to replace the dead one with the existing one. This can cause
3475 // recursive merging of other unrelated nodes down the line. The merging
3476 // can cause deletion of nodes that used the old value. To handle this, we
3477 // use CSUL to remove them from the Users set.
3478 ReplaceAllUsesWith(User, Existing, &CSUL);
3480 // User is now dead. Notify a listener if present.
3481 if (UpdateListener) UpdateListener->NodeDeleted(User);
3482 DeleteNodeNotInCSEMaps(User);
3487 /// AssignNodeIds - Assign a unique node id for each node in the DAG based on
3488 /// their allnodes order. It returns the maximum id.
3489 unsigned SelectionDAG::AssignNodeIds() {
3491 for (allnodes_iterator I = allnodes_begin(), E = allnodes_end(); I != E; ++I){
3498 /// AssignTopologicalOrder - Assign a unique node id for each node in the DAG
3499 /// based on their topological order. It returns the maximum id and a vector
3500 /// of the SDNodes* in assigned order by reference.
3501 unsigned SelectionDAG::AssignTopologicalOrder(std::vector<SDNode*> &TopOrder) {
3502 unsigned DAGSize = AllNodes.size();
3503 std::vector<unsigned> InDegree(DAGSize);
3504 std::vector<SDNode*> Sources;
3506 // Use a two pass approach to avoid using a std::map which is slow.
3508 for (allnodes_iterator I = allnodes_begin(),E = allnodes_end(); I != E; ++I){
3511 unsigned Degree = N->use_size();
3512 InDegree[N->getNodeId()] = Degree;
3514 Sources.push_back(N);
3518 while (!Sources.empty()) {
3519 SDNode *N = Sources.back();
3521 TopOrder.push_back(N);
3522 for (SDNode::op_iterator I = N->op_begin(), E = N->op_end(); I != E; ++I) {
3524 unsigned Degree = --InDegree[P->getNodeId()];
3526 Sources.push_back(P);
3530 // Second pass, assign the actual topological order as node ids.
3532 for (std::vector<SDNode*>::iterator TI = TopOrder.begin(),TE = TopOrder.end();
3534 (*TI)->setNodeId(Id++);
3541 //===----------------------------------------------------------------------===//
3543 //===----------------------------------------------------------------------===//
3545 // Out-of-line virtual method to give class a home.
3546 void SDNode::ANCHOR() {}
3547 void UnarySDNode::ANCHOR() {}
3548 void BinarySDNode::ANCHOR() {}
3549 void TernarySDNode::ANCHOR() {}
3550 void HandleSDNode::ANCHOR() {}
3551 void StringSDNode::ANCHOR() {}
3552 void ConstantSDNode::ANCHOR() {}
3553 void ConstantFPSDNode::ANCHOR() {}
3554 void GlobalAddressSDNode::ANCHOR() {}
3555 void FrameIndexSDNode::ANCHOR() {}
3556 void JumpTableSDNode::ANCHOR() {}
3557 void ConstantPoolSDNode::ANCHOR() {}
3558 void BasicBlockSDNode::ANCHOR() {}
3559 void SrcValueSDNode::ANCHOR() {}
3560 void MemOperandSDNode::ANCHOR() {}
3561 void RegisterSDNode::ANCHOR() {}
3562 void ExternalSymbolSDNode::ANCHOR() {}
3563 void CondCodeSDNode::ANCHOR() {}
3564 void VTSDNode::ANCHOR() {}
3565 void LoadSDNode::ANCHOR() {}
3566 void StoreSDNode::ANCHOR() {}
3568 HandleSDNode::~HandleSDNode() {
3569 SDVTList VTs = { 0, 0 };
3570 MorphNodeTo(ISD::HANDLENODE, VTs, 0, 0); // Drops operand uses.
3573 GlobalAddressSDNode::GlobalAddressSDNode(bool isTarget, const GlobalValue *GA,
3574 MVT::ValueType VT, int o)
3575 : SDNode(isa<GlobalVariable>(GA) &&
3576 cast<GlobalVariable>(GA)->isThreadLocal() ?
3578 (isTarget ? ISD::TargetGlobalTLSAddress : ISD::GlobalTLSAddress) :
3580 (isTarget ? ISD::TargetGlobalAddress : ISD::GlobalAddress),
3581 getSDVTList(VT)), Offset(o) {
3582 TheGlobal = const_cast<GlobalValue*>(GA);
3585 /// getMemOperand - Return a MemOperand object describing the memory
3586 /// reference performed by this load or store.
3587 MemOperand LSBaseSDNode::getMemOperand() const {
3588 int Size = (MVT::getSizeInBits(getMemoryVT()) + 7) >> 3;
3590 getOpcode() == ISD::LOAD ? MemOperand::MOLoad : MemOperand::MOStore;
3591 if (IsVolatile) Flags |= MemOperand::MOVolatile;
3593 // Check if the load references a frame index, and does not have
3595 const FrameIndexSDNode *FI =
3596 dyn_cast<const FrameIndexSDNode>(getBasePtr().Val);
3597 if (!getSrcValue() && FI)
3598 return MemOperand(PseudoSourceValue::getFixedStack(), Flags,
3599 FI->getIndex(), Size, Alignment);
3601 return MemOperand(getSrcValue(), Flags,
3602 getSrcValueOffset(), Size, Alignment);
3605 /// Profile - Gather unique data for the node.
3607 void SDNode::Profile(FoldingSetNodeID &ID) {
3608 AddNodeIDNode(ID, this);
3611 /// getValueTypeList - Return a pointer to the specified value type.
3613 const MVT::ValueType *SDNode::getValueTypeList(MVT::ValueType VT) {
3614 if (MVT::isExtendedVT(VT)) {
3615 static std::set<MVT::ValueType> EVTs;
3616 return &(*EVTs.insert(VT).first);
3618 static MVT::ValueType VTs[MVT::LAST_VALUETYPE];
3624 /// hasNUsesOfValue - Return true if there are exactly NUSES uses of the
3625 /// indicated value. This method ignores uses of other values defined by this
3627 bool SDNode::hasNUsesOfValue(unsigned NUses, unsigned Value) const {
3628 assert(Value < getNumValues() && "Bad value!");
3630 // If there is only one value, this is easy.
3631 if (getNumValues() == 1)
3632 return use_size() == NUses;
3633 if (use_size() < NUses) return false;
3635 SDOperand TheValue(const_cast<SDNode *>(this), Value);
3637 SmallPtrSet<SDNode*, 32> UsersHandled;
3639 for (SDNode::use_iterator UI = Uses.begin(), E = Uses.end(); UI != E; ++UI) {
3641 if (User->getNumOperands() == 1 ||
3642 UsersHandled.insert(User)) // First time we've seen this?
3643 for (unsigned i = 0, e = User->getNumOperands(); i != e; ++i)
3644 if (User->getOperand(i) == TheValue) {
3646 return false; // too many uses
3651 // Found exactly the right number of uses?
3656 /// hasAnyUseOfValue - Return true if there are any use of the indicated
3657 /// value. This method ignores uses of other values defined by this operation.
3658 bool SDNode::hasAnyUseOfValue(unsigned Value) const {
3659 assert(Value < getNumValues() && "Bad value!");
3661 if (use_empty()) return false;
3663 SDOperand TheValue(const_cast<SDNode *>(this), Value);
3665 SmallPtrSet<SDNode*, 32> UsersHandled;
3667 for (SDNode::use_iterator UI = Uses.begin(), E = Uses.end(); UI != E; ++UI) {
3669 if (User->getNumOperands() == 1 ||
3670 UsersHandled.insert(User)) // First time we've seen this?
3671 for (unsigned i = 0, e = User->getNumOperands(); i != e; ++i)
3672 if (User->getOperand(i) == TheValue) {
3681 /// isOnlyUse - Return true if this node is the only use of N.
3683 bool SDNode::isOnlyUse(SDNode *N) const {
3685 for (SDNode::use_iterator I = N->use_begin(), E = N->use_end(); I != E; ++I) {
3696 /// isOperand - Return true if this node is an operand of N.
3698 bool SDOperand::isOperand(SDNode *N) const {
3699 for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i)
3700 if (*this == N->getOperand(i))
3705 bool SDNode::isOperand(SDNode *N) const {
3706 for (unsigned i = 0, e = N->NumOperands; i != e; ++i)
3707 if (this == N->OperandList[i].Val)
3712 /// reachesChainWithoutSideEffects - Return true if this operand (which must
3713 /// be a chain) reaches the specified operand without crossing any
3714 /// side-effecting instructions. In practice, this looks through token
3715 /// factors and non-volatile loads. In order to remain efficient, this only
3716 /// looks a couple of nodes in, it does not do an exhaustive search.
3717 bool SDOperand::reachesChainWithoutSideEffects(SDOperand Dest,
3718 unsigned Depth) const {
3719 if (*this == Dest) return true;
3721 // Don't search too deeply, we just want to be able to see through
3722 // TokenFactor's etc.
3723 if (Depth == 0) return false;
3725 // If this is a token factor, all inputs to the TF happen in parallel. If any
3726 // of the operands of the TF reach dest, then we can do the xform.
3727 if (getOpcode() == ISD::TokenFactor) {
3728 for (unsigned i = 0, e = getNumOperands(); i != e; ++i)
3729 if (getOperand(i).reachesChainWithoutSideEffects(Dest, Depth-1))
3734 // Loads don't have side effects, look through them.
3735 if (LoadSDNode *Ld = dyn_cast<LoadSDNode>(*this)) {
3736 if (!Ld->isVolatile())
3737 return Ld->getChain().reachesChainWithoutSideEffects(Dest, Depth-1);
3743 static void findPredecessor(SDNode *N, const SDNode *P, bool &found,
3744 SmallPtrSet<SDNode *, 32> &Visited) {
3745 if (found || !Visited.insert(N))
3748 for (unsigned i = 0, e = N->getNumOperands(); !found && i != e; ++i) {
3749 SDNode *Op = N->getOperand(i).Val;
3754 findPredecessor(Op, P, found, Visited);
3758 /// isPredecessor - Return true if this node is a predecessor of N. This node
3759 /// is either an operand of N or it can be reached by recursively traversing
3760 /// up the operands.
3761 /// NOTE: this is an expensive method. Use it carefully.
3762 bool SDNode::isPredecessor(SDNode *N) const {
3763 SmallPtrSet<SDNode *, 32> Visited;
3765 findPredecessor(N, this, found, Visited);
3769 uint64_t SDNode::getConstantOperandVal(unsigned Num) const {
3770 assert(Num < NumOperands && "Invalid child # of SDNode!");
3771 return cast<ConstantSDNode>(OperandList[Num])->getValue();
3774 std::string SDNode::getOperationName(const SelectionDAG *G) const {
3775 switch (getOpcode()) {
3777 if (getOpcode() < ISD::BUILTIN_OP_END)
3778 return "<<Unknown DAG Node>>";
3781 if (const TargetInstrInfo *TII = G->getTarget().getInstrInfo())
3782 if (getOpcode()-ISD::BUILTIN_OP_END < TII->getNumOpcodes())
3783 return TII->get(getOpcode()-ISD::BUILTIN_OP_END).getName();
3785 TargetLowering &TLI = G->getTargetLoweringInfo();
3787 TLI.getTargetNodeName(getOpcode());
3788 if (Name) return Name;
3791 return "<<Unknown Target Node>>";
3794 case ISD::PCMARKER: return "PCMarker";
3795 case ISD::READCYCLECOUNTER: return "ReadCycleCounter";
3796 case ISD::SRCVALUE: return "SrcValue";
3797 case ISD::MEMOPERAND: return "MemOperand";
3798 case ISD::EntryToken: return "EntryToken";
3799 case ISD::TokenFactor: return "TokenFactor";
3800 case ISD::AssertSext: return "AssertSext";
3801 case ISD::AssertZext: return "AssertZext";
3803 case ISD::STRING: return "String";
3804 case ISD::BasicBlock: return "BasicBlock";
3805 case ISD::VALUETYPE: return "ValueType";
3806 case ISD::Register: return "Register";
3808 case ISD::Constant: return "Constant";
3809 case ISD::ConstantFP: return "ConstantFP";
3810 case ISD::GlobalAddress: return "GlobalAddress";
3811 case ISD::GlobalTLSAddress: return "GlobalTLSAddress";
3812 case ISD::FrameIndex: return "FrameIndex";
3813 case ISD::JumpTable: return "JumpTable";
3814 case ISD::GLOBAL_OFFSET_TABLE: return "GLOBAL_OFFSET_TABLE";
3815 case ISD::RETURNADDR: return "RETURNADDR";
3816 case ISD::FRAMEADDR: return "FRAMEADDR";
3817 case ISD::FRAME_TO_ARGS_OFFSET: return "FRAME_TO_ARGS_OFFSET";
3818 case ISD::EXCEPTIONADDR: return "EXCEPTIONADDR";
3819 case ISD::EHSELECTION: return "EHSELECTION";
3820 case ISD::EH_RETURN: return "EH_RETURN";
3821 case ISD::ConstantPool: return "ConstantPool";
3822 case ISD::ExternalSymbol: return "ExternalSymbol";
3823 case ISD::INTRINSIC_WO_CHAIN: {
3824 unsigned IID = cast<ConstantSDNode>(getOperand(0))->getValue();
3825 return Intrinsic::getName((Intrinsic::ID)IID);
3827 case ISD::INTRINSIC_VOID:
3828 case ISD::INTRINSIC_W_CHAIN: {
3829 unsigned IID = cast<ConstantSDNode>(getOperand(1))->getValue();
3830 return Intrinsic::getName((Intrinsic::ID)IID);
3833 case ISD::BUILD_VECTOR: return "BUILD_VECTOR";
3834 case ISD::TargetConstant: return "TargetConstant";
3835 case ISD::TargetConstantFP:return "TargetConstantFP";
3836 case ISD::TargetGlobalAddress: return "TargetGlobalAddress";
3837 case ISD::TargetGlobalTLSAddress: return "TargetGlobalTLSAddress";
3838 case ISD::TargetFrameIndex: return "TargetFrameIndex";
3839 case ISD::TargetJumpTable: return "TargetJumpTable";
3840 case ISD::TargetConstantPool: return "TargetConstantPool";
3841 case ISD::TargetExternalSymbol: return "TargetExternalSymbol";
3843 case ISD::CopyToReg: return "CopyToReg";
3844 case ISD::CopyFromReg: return "CopyFromReg";
3845 case ISD::UNDEF: return "undef";
3846 case ISD::MERGE_VALUES: return "merge_values";
3847 case ISD::INLINEASM: return "inlineasm";
3848 case ISD::LABEL: return "label";
3849 case ISD::DECLARE: return "declare";
3850 case ISD::HANDLENODE: return "handlenode";
3851 case ISD::FORMAL_ARGUMENTS: return "formal_arguments";
3852 case ISD::CALL: return "call";
3855 case ISD::FABS: return "fabs";
3856 case ISD::FNEG: return "fneg";
3857 case ISD::FSQRT: return "fsqrt";
3858 case ISD::FSIN: return "fsin";
3859 case ISD::FCOS: return "fcos";
3860 case ISD::FPOWI: return "fpowi";
3861 case ISD::FPOW: return "fpow";
3864 case ISD::ADD: return "add";
3865 case ISD::SUB: return "sub";
3866 case ISD::MUL: return "mul";
3867 case ISD::MULHU: return "mulhu";
3868 case ISD::MULHS: return "mulhs";
3869 case ISD::SDIV: return "sdiv";
3870 case ISD::UDIV: return "udiv";
3871 case ISD::SREM: return "srem";
3872 case ISD::UREM: return "urem";
3873 case ISD::SMUL_LOHI: return "smul_lohi";
3874 case ISD::UMUL_LOHI: return "umul_lohi";
3875 case ISD::SDIVREM: return "sdivrem";
3876 case ISD::UDIVREM: return "divrem";
3877 case ISD::AND: return "and";
3878 case ISD::OR: return "or";
3879 case ISD::XOR: return "xor";
3880 case ISD::SHL: return "shl";
3881 case ISD::SRA: return "sra";
3882 case ISD::SRL: return "srl";
3883 case ISD::ROTL: return "rotl";
3884 case ISD::ROTR: return "rotr";
3885 case ISD::FADD: return "fadd";
3886 case ISD::FSUB: return "fsub";
3887 case ISD::FMUL: return "fmul";
3888 case ISD::FDIV: return "fdiv";
3889 case ISD::FREM: return "frem";
3890 case ISD::FCOPYSIGN: return "fcopysign";
3891 case ISD::FGETSIGN: return "fgetsign";
3893 case ISD::SETCC: return "setcc";
3894 case ISD::SELECT: return "select";
3895 case ISD::SELECT_CC: return "select_cc";
3896 case ISD::INSERT_VECTOR_ELT: return "insert_vector_elt";
3897 case ISD::EXTRACT_VECTOR_ELT: return "extract_vector_elt";
3898 case ISD::CONCAT_VECTORS: return "concat_vectors";
3899 case ISD::EXTRACT_SUBVECTOR: return "extract_subvector";
3900 case ISD::SCALAR_TO_VECTOR: return "scalar_to_vector";
3901 case ISD::VECTOR_SHUFFLE: return "vector_shuffle";
3902 case ISD::CARRY_FALSE: return "carry_false";
3903 case ISD::ADDC: return "addc";
3904 case ISD::ADDE: return "adde";
3905 case ISD::SUBC: return "subc";
3906 case ISD::SUBE: return "sube";
3907 case ISD::SHL_PARTS: return "shl_parts";
3908 case ISD::SRA_PARTS: return "sra_parts";
3909 case ISD::SRL_PARTS: return "srl_parts";
3911 case ISD::EXTRACT_SUBREG: return "extract_subreg";
3912 case ISD::INSERT_SUBREG: return "insert_subreg";
3914 // Conversion operators.
3915 case ISD::SIGN_EXTEND: return "sign_extend";
3916 case ISD::ZERO_EXTEND: return "zero_extend";
3917 case ISD::ANY_EXTEND: return "any_extend";
3918 case ISD::SIGN_EXTEND_INREG: return "sign_extend_inreg";
3919 case ISD::TRUNCATE: return "truncate";
3920 case ISD::FP_ROUND: return "fp_round";
3921 case ISD::FLT_ROUNDS_: return "flt_rounds";
3922 case ISD::FP_ROUND_INREG: return "fp_round_inreg";
3923 case ISD::FP_EXTEND: return "fp_extend";
3925 case ISD::SINT_TO_FP: return "sint_to_fp";
3926 case ISD::UINT_TO_FP: return "uint_to_fp";
3927 case ISD::FP_TO_SINT: return "fp_to_sint";
3928 case ISD::FP_TO_UINT: return "fp_to_uint";
3929 case ISD::BIT_CONVERT: return "bit_convert";
3931 // Control flow instructions
3932 case ISD::BR: return "br";
3933 case ISD::BRIND: return "brind";
3934 case ISD::BR_JT: return "br_jt";
3935 case ISD::BRCOND: return "brcond";
3936 case ISD::BR_CC: return "br_cc";
3937 case ISD::RET: return "ret";
3938 case ISD::CALLSEQ_START: return "callseq_start";
3939 case ISD::CALLSEQ_END: return "callseq_end";
3942 case ISD::LOAD: return "load";
3943 case ISD::STORE: return "store";
3944 case ISD::VAARG: return "vaarg";
3945 case ISD::VACOPY: return "vacopy";
3946 case ISD::VAEND: return "vaend";
3947 case ISD::VASTART: return "vastart";
3948 case ISD::DYNAMIC_STACKALLOC: return "dynamic_stackalloc";
3949 case ISD::EXTRACT_ELEMENT: return "extract_element";
3950 case ISD::BUILD_PAIR: return "build_pair";
3951 case ISD::STACKSAVE: return "stacksave";
3952 case ISD::STACKRESTORE: return "stackrestore";
3953 case ISD::TRAP: return "trap";
3955 // Block memory operations.
3956 case ISD::MEMSET: return "memset";
3957 case ISD::MEMCPY: return "memcpy";
3958 case ISD::MEMMOVE: return "memmove";
3961 case ISD::BSWAP: return "bswap";
3962 case ISD::CTPOP: return "ctpop";
3963 case ISD::CTTZ: return "cttz";
3964 case ISD::CTLZ: return "ctlz";
3967 case ISD::LOCATION: return "location";
3968 case ISD::DEBUG_LOC: return "debug_loc";
3971 case ISD::TRAMPOLINE: return "trampoline";
3974 switch (cast<CondCodeSDNode>(this)->get()) {
3975 default: assert(0 && "Unknown setcc condition!");
3976 case ISD::SETOEQ: return "setoeq";
3977 case ISD::SETOGT: return "setogt";
3978 case ISD::SETOGE: return "setoge";
3979 case ISD::SETOLT: return "setolt";
3980 case ISD::SETOLE: return "setole";
3981 case ISD::SETONE: return "setone";
3983 case ISD::SETO: return "seto";
3984 case ISD::SETUO: return "setuo";
3985 case ISD::SETUEQ: return "setue";
3986 case ISD::SETUGT: return "setugt";
3987 case ISD::SETUGE: return "setuge";
3988 case ISD::SETULT: return "setult";
3989 case ISD::SETULE: return "setule";
3990 case ISD::SETUNE: return "setune";
3992 case ISD::SETEQ: return "seteq";
3993 case ISD::SETGT: return "setgt";
3994 case ISD::SETGE: return "setge";
3995 case ISD::SETLT: return "setlt";
3996 case ISD::SETLE: return "setle";
3997 case ISD::SETNE: return "setne";
4002 const char *SDNode::getIndexedModeName(ISD::MemIndexedMode AM) {
4011 return "<post-inc>";
4013 return "<post-dec>";
4017 void SDNode::dump() const { dump(0); }
4018 void SDNode::dump(const SelectionDAG *G) const {
4019 cerr << (void*)this << ": ";
4021 for (unsigned i = 0, e = getNumValues(); i != e; ++i) {
4023 if (getValueType(i) == MVT::Other)
4026 cerr << MVT::getValueTypeString(getValueType(i));
4028 cerr << " = " << getOperationName(G);
4031 for (unsigned i = 0, e = getNumOperands(); i != e; ++i) {
4032 if (i) cerr << ", ";
4033 cerr << (void*)getOperand(i).Val;
4034 if (unsigned RN = getOperand(i).ResNo)
4038 if (!isTargetOpcode() && getOpcode() == ISD::VECTOR_SHUFFLE) {
4039 SDNode *Mask = getOperand(2).Val;
4041 for (unsigned i = 0, e = Mask->getNumOperands(); i != e; ++i) {
4043 if (Mask->getOperand(i).getOpcode() == ISD::UNDEF)
4046 cerr << cast<ConstantSDNode>(Mask->getOperand(i))->getValue();
4051 if (const ConstantSDNode *CSDN = dyn_cast<ConstantSDNode>(this)) {
4052 cerr << "<" << CSDN->getValue() << ">";
4053 } else if (const ConstantFPSDNode *CSDN = dyn_cast<ConstantFPSDNode>(this)) {
4054 if (&CSDN->getValueAPF().getSemantics()==&APFloat::IEEEsingle)
4055 cerr << "<" << CSDN->getValueAPF().convertToFloat() << ">";
4056 else if (&CSDN->getValueAPF().getSemantics()==&APFloat::IEEEdouble)
4057 cerr << "<" << CSDN->getValueAPF().convertToDouble() << ">";
4059 cerr << "<APFloat(";
4060 CSDN->getValueAPF().convertToAPInt().dump();
4063 } else if (const GlobalAddressSDNode *GADN =
4064 dyn_cast<GlobalAddressSDNode>(this)) {
4065 int offset = GADN->getOffset();
4067 WriteAsOperand(*cerr.stream(), GADN->getGlobal()) << ">";
4069 cerr << " + " << offset;
4071 cerr << " " << offset;
4072 } else if (const FrameIndexSDNode *FIDN = dyn_cast<FrameIndexSDNode>(this)) {
4073 cerr << "<" << FIDN->getIndex() << ">";
4074 } else if (const JumpTableSDNode *JTDN = dyn_cast<JumpTableSDNode>(this)) {
4075 cerr << "<" << JTDN->getIndex() << ">";
4076 } else if (const ConstantPoolSDNode *CP = dyn_cast<ConstantPoolSDNode>(this)){
4077 int offset = CP->getOffset();
4078 if (CP->isMachineConstantPoolEntry())
4079 cerr << "<" << *CP->getMachineCPVal() << ">";
4081 cerr << "<" << *CP->getConstVal() << ">";
4083 cerr << " + " << offset;
4085 cerr << " " << offset;
4086 } else if (const BasicBlockSDNode *BBDN = dyn_cast<BasicBlockSDNode>(this)) {
4088 const Value *LBB = (const Value*)BBDN->getBasicBlock()->getBasicBlock();
4090 cerr << LBB->getName() << " ";
4091 cerr << (const void*)BBDN->getBasicBlock() << ">";
4092 } else if (const RegisterSDNode *R = dyn_cast<RegisterSDNode>(this)) {
4093 if (G && R->getReg() &&
4094 TargetRegisterInfo::isPhysicalRegister(R->getReg())) {
4095 cerr << " " <<G->getTarget().getRegisterInfo()->getName(R->getReg());
4097 cerr << " #" << R->getReg();
4099 } else if (const ExternalSymbolSDNode *ES =
4100 dyn_cast<ExternalSymbolSDNode>(this)) {
4101 cerr << "'" << ES->getSymbol() << "'";
4102 } else if (const SrcValueSDNode *M = dyn_cast<SrcValueSDNode>(this)) {
4104 cerr << "<" << M->getValue() << ">";
4107 } else if (const MemOperandSDNode *M = dyn_cast<MemOperandSDNode>(this)) {
4108 if (M->MO.getValue())
4109 cerr << "<" << M->MO.getValue() << ":" << M->MO.getOffset() << ">";
4111 cerr << "<null:" << M->MO.getOffset() << ">";
4112 } else if (const VTSDNode *N = dyn_cast<VTSDNode>(this)) {
4113 cerr << ":" << MVT::getValueTypeString(N->getVT());
4114 } else if (const LoadSDNode *LD = dyn_cast<LoadSDNode>(this)) {
4115 const Value *SrcValue = LD->getSrcValue();
4116 int SrcOffset = LD->getSrcValueOffset();
4122 cerr << ":" << SrcOffset << ">";
4125 switch (LD->getExtensionType()) {
4126 default: doExt = false; break;
4128 cerr << " <anyext ";
4138 cerr << MVT::getValueTypeString(LD->getMemoryVT()) << ">";
4140 const char *AM = getIndexedModeName(LD->getAddressingMode());
4143 if (LD->isVolatile())
4144 cerr << " <volatile>";
4145 cerr << " alignment=" << LD->getAlignment();
4146 } else if (const StoreSDNode *ST = dyn_cast<StoreSDNode>(this)) {
4147 const Value *SrcValue = ST->getSrcValue();
4148 int SrcOffset = ST->getSrcValueOffset();
4154 cerr << ":" << SrcOffset << ">";
4156 if (ST->isTruncatingStore())
4158 << MVT::getValueTypeString(ST->getMemoryVT()) << ">";
4160 const char *AM = getIndexedModeName(ST->getAddressingMode());
4163 if (ST->isVolatile())
4164 cerr << " <volatile>";
4165 cerr << " alignment=" << ST->getAlignment();
4169 static void DumpNodes(const SDNode *N, unsigned indent, const SelectionDAG *G) {
4170 for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i)
4171 if (N->getOperand(i).Val->hasOneUse())
4172 DumpNodes(N->getOperand(i).Val, indent+2, G);
4174 cerr << "\n" << std::string(indent+2, ' ')
4175 << (void*)N->getOperand(i).Val << ": <multiple use>";
4178 cerr << "\n" << std::string(indent, ' ');
4182 void SelectionDAG::dump() const {
4183 cerr << "SelectionDAG has " << AllNodes.size() << " nodes:";
4184 std::vector<const SDNode*> Nodes;
4185 for (allnodes_const_iterator I = allnodes_begin(), E = allnodes_end();
4189 std::sort(Nodes.begin(), Nodes.end());
4191 for (unsigned i = 0, e = Nodes.size(); i != e; ++i) {
4192 if (!Nodes[i]->hasOneUse() && Nodes[i] != getRoot().Val)
4193 DumpNodes(Nodes[i], 2, this);
4196 if (getRoot().Val) DumpNodes(getRoot().Val, 2, this);
4201 const Type *ConstantPoolSDNode::getType() const {
4202 if (isMachineConstantPoolEntry())
4203 return Val.MachineCPVal->getType();
4204 return Val.ConstVal->getType();