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 static const fltSemantics *MVTToAPFloatSemantics(MVT::ValueType VT) {
49 default: assert(0 && "Unknown FP format");
50 case MVT::f32: return &APFloat::IEEEsingle;
51 case MVT::f64: return &APFloat::IEEEdouble;
52 case MVT::f80: return &APFloat::x87DoubleExtended;
53 case MVT::f128: return &APFloat::IEEEquad;
54 case MVT::ppcf128: return &APFloat::PPCDoubleDouble;
58 SelectionDAG::DAGUpdateListener::~DAGUpdateListener() {}
60 //===----------------------------------------------------------------------===//
61 // ConstantFPSDNode Class
62 //===----------------------------------------------------------------------===//
64 /// isExactlyValue - We don't rely on operator== working on double values, as
65 /// it returns true for things that are clearly not equal, like -0.0 and 0.0.
66 /// As such, this method can be used to do an exact bit-for-bit comparison of
67 /// two floating point values.
68 bool ConstantFPSDNode::isExactlyValue(const APFloat& V) const {
69 return Value.bitwiseIsEqual(V);
72 bool ConstantFPSDNode::isValueValidForType(MVT::ValueType VT,
74 assert(MVT::isFloatingPoint(VT) && "Can only convert between FP types");
76 // Anything can be extended to ppc long double.
77 if (VT == MVT::ppcf128)
80 // PPC long double cannot be shrunk to anything though.
81 if (&Val.getSemantics() == &APFloat::PPCDoubleDouble)
84 // convert modifies in place, so make a copy.
85 APFloat Val2 = APFloat(Val);
86 return Val2.convert(*MVTToAPFloatSemantics(VT),
87 APFloat::rmNearestTiesToEven) == APFloat::opOK;
90 //===----------------------------------------------------------------------===//
92 //===----------------------------------------------------------------------===//
94 /// isBuildVectorAllOnes - Return true if the specified node is a
95 /// BUILD_VECTOR where all of the elements are ~0 or undef.
96 bool ISD::isBuildVectorAllOnes(const SDNode *N) {
97 // Look through a bit convert.
98 if (N->getOpcode() == ISD::BIT_CONVERT)
99 N = N->getOperand(0).Val;
101 if (N->getOpcode() != ISD::BUILD_VECTOR) return false;
103 unsigned i = 0, e = N->getNumOperands();
105 // Skip over all of the undef values.
106 while (i != e && N->getOperand(i).getOpcode() == ISD::UNDEF)
109 // Do not accept an all-undef vector.
110 if (i == e) return false;
112 // Do not accept build_vectors that aren't all constants or which have non-~0
114 SDOperand NotZero = N->getOperand(i);
115 if (isa<ConstantSDNode>(NotZero)) {
116 if (!cast<ConstantSDNode>(NotZero)->isAllOnesValue())
118 } else if (isa<ConstantFPSDNode>(NotZero)) {
119 if (!cast<ConstantFPSDNode>(NotZero)->getValueAPF().
120 convertToAPInt().isAllOnesValue())
125 // Okay, we have at least one ~0 value, check to see if the rest match or are
127 for (++i; i != e; ++i)
128 if (N->getOperand(i) != NotZero &&
129 N->getOperand(i).getOpcode() != ISD::UNDEF)
135 /// isBuildVectorAllZeros - Return true if the specified node is a
136 /// BUILD_VECTOR where all of the elements are 0 or undef.
137 bool ISD::isBuildVectorAllZeros(const SDNode *N) {
138 // Look through a bit convert.
139 if (N->getOpcode() == ISD::BIT_CONVERT)
140 N = N->getOperand(0).Val;
142 if (N->getOpcode() != ISD::BUILD_VECTOR) return false;
144 unsigned i = 0, e = N->getNumOperands();
146 // Skip over all of the undef values.
147 while (i != e && N->getOperand(i).getOpcode() == ISD::UNDEF)
150 // Do not accept an all-undef vector.
151 if (i == e) return false;
153 // Do not accept build_vectors that aren't all constants or which have non-~0
155 SDOperand Zero = N->getOperand(i);
156 if (isa<ConstantSDNode>(Zero)) {
157 if (!cast<ConstantSDNode>(Zero)->isNullValue())
159 } else if (isa<ConstantFPSDNode>(Zero)) {
160 if (!cast<ConstantFPSDNode>(Zero)->getValueAPF().isPosZero())
165 // Okay, we have at least one ~0 value, check to see if the rest match or are
167 for (++i; i != e; ++i)
168 if (N->getOperand(i) != Zero &&
169 N->getOperand(i).getOpcode() != ISD::UNDEF)
174 /// isScalarToVector - Return true if the specified node is a
175 /// ISD::SCALAR_TO_VECTOR node or a BUILD_VECTOR node where only the low
176 /// element is not an undef.
177 bool ISD::isScalarToVector(const SDNode *N) {
178 if (N->getOpcode() == ISD::SCALAR_TO_VECTOR)
181 if (N->getOpcode() != ISD::BUILD_VECTOR)
183 if (N->getOperand(0).getOpcode() == ISD::UNDEF)
185 unsigned NumElems = N->getNumOperands();
186 for (unsigned i = 1; i < NumElems; ++i) {
187 SDOperand V = N->getOperand(i);
188 if (V.getOpcode() != ISD::UNDEF)
195 /// isDebugLabel - Return true if the specified node represents a debug
196 /// label (i.e. ISD::LABEL or TargetInstrInfo::LABEL node and third operand
198 bool ISD::isDebugLabel(const SDNode *N) {
200 if (N->getOpcode() == ISD::LABEL)
201 Zero = N->getOperand(2);
202 else if (N->isTargetOpcode() &&
203 N->getTargetOpcode() == TargetInstrInfo::LABEL)
204 // Chain moved to last operand.
205 Zero = N->getOperand(1);
208 return isa<ConstantSDNode>(Zero) && cast<ConstantSDNode>(Zero)->isNullValue();
211 /// getSetCCSwappedOperands - Return the operation corresponding to (Y op X)
212 /// when given the operation for (X op Y).
213 ISD::CondCode ISD::getSetCCSwappedOperands(ISD::CondCode Operation) {
214 // To perform this operation, we just need to swap the L and G bits of the
216 unsigned OldL = (Operation >> 2) & 1;
217 unsigned OldG = (Operation >> 1) & 1;
218 return ISD::CondCode((Operation & ~6) | // Keep the N, U, E bits
219 (OldL << 1) | // New G bit
220 (OldG << 2)); // New L bit.
223 /// getSetCCInverse - Return the operation corresponding to !(X op Y), where
224 /// 'op' is a valid SetCC operation.
225 ISD::CondCode ISD::getSetCCInverse(ISD::CondCode Op, bool isInteger) {
226 unsigned Operation = Op;
228 Operation ^= 7; // Flip L, G, E bits, but not U.
230 Operation ^= 15; // Flip all of the condition bits.
231 if (Operation > ISD::SETTRUE2)
232 Operation &= ~8; // Don't let N and U bits get set.
233 return ISD::CondCode(Operation);
237 /// isSignedOp - For an integer comparison, return 1 if the comparison is a
238 /// signed operation and 2 if the result is an unsigned comparison. Return zero
239 /// if the operation does not depend on the sign of the input (setne and seteq).
240 static int isSignedOp(ISD::CondCode Opcode) {
242 default: assert(0 && "Illegal integer setcc operation!");
244 case ISD::SETNE: return 0;
248 case ISD::SETGE: return 1;
252 case ISD::SETUGE: return 2;
256 /// getSetCCOrOperation - Return the result of a logical OR between different
257 /// comparisons of identical values: ((X op1 Y) | (X op2 Y)). This function
258 /// returns SETCC_INVALID if it is not possible to represent the resultant
260 ISD::CondCode ISD::getSetCCOrOperation(ISD::CondCode Op1, ISD::CondCode Op2,
262 if (isInteger && (isSignedOp(Op1) | isSignedOp(Op2)) == 3)
263 // Cannot fold a signed integer setcc with an unsigned integer setcc.
264 return ISD::SETCC_INVALID;
266 unsigned Op = Op1 | Op2; // Combine all of the condition bits.
268 // If the N and U bits get set then the resultant comparison DOES suddenly
269 // care about orderedness, and is true when ordered.
270 if (Op > ISD::SETTRUE2)
271 Op &= ~16; // Clear the U bit if the N bit is set.
273 // Canonicalize illegal integer setcc's.
274 if (isInteger && Op == ISD::SETUNE) // e.g. SETUGT | SETULT
277 return ISD::CondCode(Op);
280 /// getSetCCAndOperation - Return the result of a logical AND between different
281 /// comparisons of identical values: ((X op1 Y) & (X op2 Y)). This
282 /// function returns zero if it is not possible to represent the resultant
284 ISD::CondCode ISD::getSetCCAndOperation(ISD::CondCode Op1, ISD::CondCode Op2,
286 if (isInteger && (isSignedOp(Op1) | isSignedOp(Op2)) == 3)
287 // Cannot fold a signed setcc with an unsigned setcc.
288 return ISD::SETCC_INVALID;
290 // Combine all of the condition bits.
291 ISD::CondCode Result = ISD::CondCode(Op1 & Op2);
293 // Canonicalize illegal integer setcc's.
297 case ISD::SETUO : Result = ISD::SETFALSE; break; // SETUGT & SETULT
298 case ISD::SETUEQ: Result = ISD::SETEQ ; break; // SETUGE & SETULE
299 case ISD::SETOLT: Result = ISD::SETULT ; break; // SETULT & SETNE
300 case ISD::SETOGT: Result = ISD::SETUGT ; break; // SETUGT & SETNE
307 const TargetMachine &SelectionDAG::getTarget() const {
308 return TLI.getTargetMachine();
311 //===----------------------------------------------------------------------===//
312 // SDNode Profile Support
313 //===----------------------------------------------------------------------===//
315 /// AddNodeIDOpcode - Add the node opcode to the NodeID data.
317 static void AddNodeIDOpcode(FoldingSetNodeID &ID, unsigned OpC) {
321 /// AddNodeIDValueTypes - Value type lists are intern'd so we can represent them
322 /// solely with their pointer.
323 void AddNodeIDValueTypes(FoldingSetNodeID &ID, SDVTList VTList) {
324 ID.AddPointer(VTList.VTs);
327 /// AddNodeIDOperands - Various routines for adding operands to the NodeID data.
329 static void AddNodeIDOperands(FoldingSetNodeID &ID,
330 const SDOperand *Ops, unsigned NumOps) {
331 for (; NumOps; --NumOps, ++Ops) {
332 ID.AddPointer(Ops->Val);
333 ID.AddInteger(Ops->ResNo);
337 static void AddNodeIDNode(FoldingSetNodeID &ID,
338 unsigned short OpC, SDVTList VTList,
339 const SDOperand *OpList, unsigned N) {
340 AddNodeIDOpcode(ID, OpC);
341 AddNodeIDValueTypes(ID, VTList);
342 AddNodeIDOperands(ID, OpList, N);
345 /// AddNodeIDNode - Generic routine for adding a nodes info to the NodeID
347 static void AddNodeIDNode(FoldingSetNodeID &ID, SDNode *N) {
348 AddNodeIDOpcode(ID, N->getOpcode());
349 // Add the return value info.
350 AddNodeIDValueTypes(ID, N->getVTList());
351 // Add the operand info.
352 AddNodeIDOperands(ID, N->op_begin(), N->getNumOperands());
354 // Handle SDNode leafs with special info.
355 switch (N->getOpcode()) {
356 default: break; // Normal nodes don't need extra info.
357 case ISD::TargetConstant:
359 ID.Add(cast<ConstantSDNode>(N)->getAPIntValue());
361 case ISD::TargetConstantFP:
362 case ISD::ConstantFP: {
363 ID.Add(cast<ConstantFPSDNode>(N)->getValueAPF());
366 case ISD::TargetGlobalAddress:
367 case ISD::GlobalAddress:
368 case ISD::TargetGlobalTLSAddress:
369 case ISD::GlobalTLSAddress: {
370 GlobalAddressSDNode *GA = cast<GlobalAddressSDNode>(N);
371 ID.AddPointer(GA->getGlobal());
372 ID.AddInteger(GA->getOffset());
375 case ISD::BasicBlock:
376 ID.AddPointer(cast<BasicBlockSDNode>(N)->getBasicBlock());
379 ID.AddInteger(cast<RegisterSDNode>(N)->getReg());
382 ID.AddPointer(cast<SrcValueSDNode>(N)->getValue());
384 case ISD::MEMOPERAND: {
385 const MemOperand &MO = cast<MemOperandSDNode>(N)->MO;
386 ID.AddPointer(MO.getValue());
387 ID.AddInteger(MO.getFlags());
388 ID.AddInteger(MO.getOffset());
389 ID.AddInteger(MO.getSize());
390 ID.AddInteger(MO.getAlignment());
393 case ISD::FrameIndex:
394 case ISD::TargetFrameIndex:
395 ID.AddInteger(cast<FrameIndexSDNode>(N)->getIndex());
398 case ISD::TargetJumpTable:
399 ID.AddInteger(cast<JumpTableSDNode>(N)->getIndex());
401 case ISD::ConstantPool:
402 case ISD::TargetConstantPool: {
403 ConstantPoolSDNode *CP = cast<ConstantPoolSDNode>(N);
404 ID.AddInteger(CP->getAlignment());
405 ID.AddInteger(CP->getOffset());
406 if (CP->isMachineConstantPoolEntry())
407 CP->getMachineCPVal()->AddSelectionDAGCSEId(ID);
409 ID.AddPointer(CP->getConstVal());
413 LoadSDNode *LD = cast<LoadSDNode>(N);
414 ID.AddInteger(LD->getAddressingMode());
415 ID.AddInteger(LD->getExtensionType());
416 ID.AddInteger((unsigned int)(LD->getMemoryVT()));
417 ID.AddInteger(LD->getAlignment());
418 ID.AddInteger(LD->isVolatile());
422 StoreSDNode *ST = cast<StoreSDNode>(N);
423 ID.AddInteger(ST->getAddressingMode());
424 ID.AddInteger(ST->isTruncatingStore());
425 ID.AddInteger((unsigned int)(ST->getMemoryVT()));
426 ID.AddInteger(ST->getAlignment());
427 ID.AddInteger(ST->isVolatile());
433 //===----------------------------------------------------------------------===//
434 // SelectionDAG Class
435 //===----------------------------------------------------------------------===//
437 /// RemoveDeadNodes - This method deletes all unreachable nodes in the
439 void SelectionDAG::RemoveDeadNodes() {
440 // Create a dummy node (which is not added to allnodes), that adds a reference
441 // to the root node, preventing it from being deleted.
442 HandleSDNode Dummy(getRoot());
444 SmallVector<SDNode*, 128> DeadNodes;
446 // Add all obviously-dead nodes to the DeadNodes worklist.
447 for (allnodes_iterator I = allnodes_begin(), E = allnodes_end(); I != E; ++I)
449 DeadNodes.push_back(I);
451 // Process the worklist, deleting the nodes and adding their uses to the
453 while (!DeadNodes.empty()) {
454 SDNode *N = DeadNodes.back();
455 DeadNodes.pop_back();
457 // Take the node out of the appropriate CSE map.
458 RemoveNodeFromCSEMaps(N);
460 // Next, brutally remove the operand list. This is safe to do, as there are
461 // no cycles in the graph.
462 for (SDNode::op_iterator I = N->op_begin(), E = N->op_end(); I != E; ++I) {
463 SDNode *Operand = I->Val;
464 Operand->removeUser(N);
466 // Now that we removed this operand, see if there are no uses of it left.
467 if (Operand->use_empty())
468 DeadNodes.push_back(Operand);
470 if (N->OperandsNeedDelete)
471 delete[] N->OperandList;
475 // Finally, remove N itself.
479 // If the root changed (e.g. it was a dead load, update the root).
480 setRoot(Dummy.getValue());
483 void SelectionDAG::RemoveDeadNode(SDNode *N, DAGUpdateListener *UpdateListener){
484 SmallVector<SDNode*, 16> DeadNodes;
485 DeadNodes.push_back(N);
487 // Process the worklist, deleting the nodes and adding their uses to the
489 while (!DeadNodes.empty()) {
490 SDNode *N = DeadNodes.back();
491 DeadNodes.pop_back();
494 UpdateListener->NodeDeleted(N);
496 // Take the node out of the appropriate CSE map.
497 RemoveNodeFromCSEMaps(N);
499 // Next, brutally remove the operand list. This is safe to do, as there are
500 // no cycles in the graph.
501 for (SDNode::op_iterator I = N->op_begin(), E = N->op_end(); I != E; ++I) {
502 SDNode *Operand = I->Val;
503 Operand->removeUser(N);
505 // Now that we removed this operand, see if there are no uses of it left.
506 if (Operand->use_empty())
507 DeadNodes.push_back(Operand);
509 if (N->OperandsNeedDelete)
510 delete[] N->OperandList;
514 // Finally, remove N itself.
519 void SelectionDAG::DeleteNode(SDNode *N) {
520 assert(N->use_empty() && "Cannot delete a node that is not dead!");
522 // First take this out of the appropriate CSE map.
523 RemoveNodeFromCSEMaps(N);
525 // Finally, remove uses due to operands of this node, remove from the
526 // AllNodes list, and delete the node.
527 DeleteNodeNotInCSEMaps(N);
530 void SelectionDAG::DeleteNodeNotInCSEMaps(SDNode *N) {
532 // Remove it from the AllNodes list.
535 // Drop all of the operands and decrement used nodes use counts.
536 for (SDNode::op_iterator I = N->op_begin(), E = N->op_end(); I != E; ++I)
537 I->Val->removeUser(N);
538 if (N->OperandsNeedDelete)
539 delete[] N->OperandList;
546 /// RemoveNodeFromCSEMaps - Take the specified node out of the CSE map that
547 /// correspond to it. This is useful when we're about to delete or repurpose
548 /// the node. We don't want future request for structurally identical nodes
549 /// to return N anymore.
550 void SelectionDAG::RemoveNodeFromCSEMaps(SDNode *N) {
552 switch (N->getOpcode()) {
553 case ISD::HANDLENODE: return; // noop.
555 Erased = StringNodes.erase(cast<StringSDNode>(N)->getValue());
558 assert(CondCodeNodes[cast<CondCodeSDNode>(N)->get()] &&
559 "Cond code doesn't exist!");
560 Erased = CondCodeNodes[cast<CondCodeSDNode>(N)->get()] != 0;
561 CondCodeNodes[cast<CondCodeSDNode>(N)->get()] = 0;
563 case ISD::ExternalSymbol:
564 Erased = ExternalSymbols.erase(cast<ExternalSymbolSDNode>(N)->getSymbol());
566 case ISD::TargetExternalSymbol:
568 TargetExternalSymbols.erase(cast<ExternalSymbolSDNode>(N)->getSymbol());
570 case ISD::VALUETYPE: {
571 MVT::ValueType VT = cast<VTSDNode>(N)->getVT();
572 if (MVT::isExtendedVT(VT)) {
573 Erased = ExtendedValueTypeNodes.erase(VT);
575 Erased = ValueTypeNodes[VT] != 0;
576 ValueTypeNodes[VT] = 0;
581 // Remove it from the CSE Map.
582 Erased = CSEMap.RemoveNode(N);
586 // Verify that the node was actually in one of the CSE maps, unless it has a
587 // flag result (which cannot be CSE'd) or is one of the special cases that are
588 // not subject to CSE.
589 if (!Erased && N->getValueType(N->getNumValues()-1) != MVT::Flag &&
590 !N->isTargetOpcode()) {
593 assert(0 && "Node is not in map!");
598 /// AddNonLeafNodeToCSEMaps - Add the specified node back to the CSE maps. It
599 /// has been taken out and modified in some way. If the specified node already
600 /// exists in the CSE maps, do not modify the maps, but return the existing node
601 /// instead. If it doesn't exist, add it and return null.
603 SDNode *SelectionDAG::AddNonLeafNodeToCSEMaps(SDNode *N) {
604 assert(N->getNumOperands() && "This is a leaf node!");
605 if (N->getOpcode() == ISD::HANDLENODE || N->getValueType(0) == MVT::Flag)
606 return 0; // Never add these nodes.
608 // Check that remaining values produced are not flags.
609 for (unsigned i = 1, e = N->getNumValues(); i != e; ++i)
610 if (N->getValueType(i) == MVT::Flag)
611 return 0; // Never CSE anything that produces a flag.
613 SDNode *New = CSEMap.GetOrInsertNode(N);
614 if (New != N) return New; // Node already existed.
618 /// FindModifiedNodeSlot - Find a slot for the specified node if its operands
619 /// were replaced with those specified. If this node is never memoized,
620 /// return null, otherwise return a pointer to the slot it would take. If a
621 /// node already exists with these operands, the slot will be non-null.
622 SDNode *SelectionDAG::FindModifiedNodeSlot(SDNode *N, SDOperand Op,
624 if (N->getOpcode() == ISD::HANDLENODE || N->getValueType(0) == MVT::Flag)
625 return 0; // Never add these nodes.
627 // Check that remaining values produced are not flags.
628 for (unsigned i = 1, e = N->getNumValues(); i != e; ++i)
629 if (N->getValueType(i) == MVT::Flag)
630 return 0; // Never CSE anything that produces a flag.
632 SDOperand Ops[] = { Op };
634 AddNodeIDNode(ID, N->getOpcode(), N->getVTList(), Ops, 1);
635 return CSEMap.FindNodeOrInsertPos(ID, InsertPos);
638 /// FindModifiedNodeSlot - Find a slot for the specified node if its operands
639 /// were replaced with those specified. If this node is never memoized,
640 /// return null, otherwise return a pointer to the slot it would take. If a
641 /// node already exists with these operands, the slot will be non-null.
642 SDNode *SelectionDAG::FindModifiedNodeSlot(SDNode *N,
643 SDOperand Op1, SDOperand Op2,
645 if (N->getOpcode() == ISD::HANDLENODE || N->getValueType(0) == MVT::Flag)
646 return 0; // Never add these nodes.
648 // Check that remaining values produced are not flags.
649 for (unsigned i = 1, e = N->getNumValues(); i != e; ++i)
650 if (N->getValueType(i) == MVT::Flag)
651 return 0; // Never CSE anything that produces a flag.
653 SDOperand Ops[] = { Op1, Op2 };
655 AddNodeIDNode(ID, N->getOpcode(), N->getVTList(), Ops, 2);
656 return CSEMap.FindNodeOrInsertPos(ID, InsertPos);
660 /// FindModifiedNodeSlot - Find a slot for the specified node if its operands
661 /// were replaced with those specified. If this node is never memoized,
662 /// return null, otherwise return a pointer to the slot it would take. If a
663 /// node already exists with these operands, the slot will be non-null.
664 SDNode *SelectionDAG::FindModifiedNodeSlot(SDNode *N,
665 const SDOperand *Ops,unsigned NumOps,
667 if (N->getOpcode() == ISD::HANDLENODE || N->getValueType(0) == MVT::Flag)
668 return 0; // Never add these nodes.
670 // Check that remaining values produced are not flags.
671 for (unsigned i = 1, e = N->getNumValues(); i != e; ++i)
672 if (N->getValueType(i) == MVT::Flag)
673 return 0; // Never CSE anything that produces a flag.
676 AddNodeIDNode(ID, N->getOpcode(), N->getVTList(), Ops, NumOps);
678 if (const LoadSDNode *LD = dyn_cast<LoadSDNode>(N)) {
679 ID.AddInteger(LD->getAddressingMode());
680 ID.AddInteger(LD->getExtensionType());
681 ID.AddInteger((unsigned int)(LD->getMemoryVT()));
682 ID.AddInteger(LD->getAlignment());
683 ID.AddInteger(LD->isVolatile());
684 } else if (const StoreSDNode *ST = dyn_cast<StoreSDNode>(N)) {
685 ID.AddInteger(ST->getAddressingMode());
686 ID.AddInteger(ST->isTruncatingStore());
687 ID.AddInteger((unsigned int)(ST->getMemoryVT()));
688 ID.AddInteger(ST->getAlignment());
689 ID.AddInteger(ST->isVolatile());
692 return CSEMap.FindNodeOrInsertPos(ID, InsertPos);
696 SelectionDAG::~SelectionDAG() {
697 while (!AllNodes.empty()) {
698 SDNode *N = AllNodes.begin();
699 N->SetNextInBucket(0);
700 if (N->OperandsNeedDelete)
701 delete [] N->OperandList;
704 AllNodes.pop_front();
708 SDOperand SelectionDAG::getZeroExtendInReg(SDOperand Op, MVT::ValueType VT) {
709 if (Op.getValueType() == VT) return Op;
710 APInt Imm = APInt::getLowBitsSet(Op.getValueSizeInBits(),
711 MVT::getSizeInBits(VT));
712 return getNode(ISD::AND, Op.getValueType(), Op,
713 getConstant(Imm, Op.getValueType()));
716 SDOperand SelectionDAG::getString(const std::string &Val) {
717 StringSDNode *&N = StringNodes[Val];
719 N = new StringSDNode(Val);
720 AllNodes.push_back(N);
722 return SDOperand(N, 0);
725 SDOperand SelectionDAG::getConstant(uint64_t Val, MVT::ValueType VT, bool isT) {
726 MVT::ValueType EltVT =
727 MVT::isVector(VT) ? MVT::getVectorElementType(VT) : VT;
729 return getConstant(APInt(MVT::getSizeInBits(EltVT), Val), VT, isT);
732 SDOperand SelectionDAG::getConstant(const APInt &Val, MVT::ValueType VT, bool isT) {
733 assert(MVT::isInteger(VT) && "Cannot create FP integer constant!");
735 MVT::ValueType EltVT =
736 MVT::isVector(VT) ? MVT::getVectorElementType(VT) : VT;
738 assert(Val.getBitWidth() == MVT::getSizeInBits(EltVT) &&
739 "APInt size does not match type size!");
741 unsigned Opc = isT ? ISD::TargetConstant : ISD::Constant;
743 AddNodeIDNode(ID, Opc, getVTList(EltVT), 0, 0);
747 if ((N = CSEMap.FindNodeOrInsertPos(ID, IP)))
748 if (!MVT::isVector(VT))
749 return SDOperand(N, 0);
751 N = new ConstantSDNode(isT, Val, EltVT);
752 CSEMap.InsertNode(N, IP);
753 AllNodes.push_back(N);
756 SDOperand Result(N, 0);
757 if (MVT::isVector(VT)) {
758 SmallVector<SDOperand, 8> Ops;
759 Ops.assign(MVT::getVectorNumElements(VT), Result);
760 Result = getNode(ISD::BUILD_VECTOR, VT, &Ops[0], Ops.size());
765 SDOperand SelectionDAG::getIntPtrConstant(uint64_t Val, bool isTarget) {
766 return getConstant(Val, TLI.getPointerTy(), isTarget);
770 SDOperand SelectionDAG::getConstantFP(const APFloat& V, MVT::ValueType VT,
772 assert(MVT::isFloatingPoint(VT) && "Cannot create integer FP constant!");
774 MVT::ValueType EltVT =
775 MVT::isVector(VT) ? MVT::getVectorElementType(VT) : VT;
777 // Do the map lookup using the actual bit pattern for the floating point
778 // value, so that we don't have problems with 0.0 comparing equal to -0.0, and
779 // we don't have issues with SNANs.
780 unsigned Opc = isTarget ? ISD::TargetConstantFP : ISD::ConstantFP;
782 AddNodeIDNode(ID, Opc, getVTList(EltVT), 0, 0);
786 if ((N = CSEMap.FindNodeOrInsertPos(ID, IP)))
787 if (!MVT::isVector(VT))
788 return SDOperand(N, 0);
790 N = new ConstantFPSDNode(isTarget, V, EltVT);
791 CSEMap.InsertNode(N, IP);
792 AllNodes.push_back(N);
795 SDOperand Result(N, 0);
796 if (MVT::isVector(VT)) {
797 SmallVector<SDOperand, 8> Ops;
798 Ops.assign(MVT::getVectorNumElements(VT), Result);
799 Result = getNode(ISD::BUILD_VECTOR, VT, &Ops[0], Ops.size());
804 SDOperand SelectionDAG::getConstantFP(double Val, MVT::ValueType VT,
806 MVT::ValueType EltVT =
807 MVT::isVector(VT) ? MVT::getVectorElementType(VT) : VT;
809 return getConstantFP(APFloat((float)Val), VT, isTarget);
811 return getConstantFP(APFloat(Val), VT, isTarget);
814 SDOperand SelectionDAG::getGlobalAddress(const GlobalValue *GV,
815 MVT::ValueType VT, int Offset,
817 const GlobalVariable *GVar = dyn_cast<GlobalVariable>(GV);
819 if (GVar && GVar->isThreadLocal())
820 Opc = isTargetGA ? ISD::TargetGlobalTLSAddress : ISD::GlobalTLSAddress;
822 Opc = isTargetGA ? ISD::TargetGlobalAddress : ISD::GlobalAddress;
824 AddNodeIDNode(ID, Opc, getVTList(VT), 0, 0);
826 ID.AddInteger(Offset);
828 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
829 return SDOperand(E, 0);
830 SDNode *N = new GlobalAddressSDNode(isTargetGA, GV, VT, Offset);
831 CSEMap.InsertNode(N, IP);
832 AllNodes.push_back(N);
833 return SDOperand(N, 0);
836 SDOperand SelectionDAG::getFrameIndex(int FI, MVT::ValueType VT,
838 unsigned Opc = isTarget ? ISD::TargetFrameIndex : ISD::FrameIndex;
840 AddNodeIDNode(ID, Opc, getVTList(VT), 0, 0);
843 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
844 return SDOperand(E, 0);
845 SDNode *N = new FrameIndexSDNode(FI, VT, isTarget);
846 CSEMap.InsertNode(N, IP);
847 AllNodes.push_back(N);
848 return SDOperand(N, 0);
851 SDOperand SelectionDAG::getJumpTable(int JTI, MVT::ValueType VT, bool isTarget){
852 unsigned Opc = isTarget ? ISD::TargetJumpTable : ISD::JumpTable;
854 AddNodeIDNode(ID, Opc, getVTList(VT), 0, 0);
857 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
858 return SDOperand(E, 0);
859 SDNode *N = new JumpTableSDNode(JTI, VT, isTarget);
860 CSEMap.InsertNode(N, IP);
861 AllNodes.push_back(N);
862 return SDOperand(N, 0);
865 SDOperand SelectionDAG::getConstantPool(Constant *C, MVT::ValueType VT,
866 unsigned Alignment, int Offset,
868 unsigned Opc = isTarget ? ISD::TargetConstantPool : ISD::ConstantPool;
870 AddNodeIDNode(ID, Opc, getVTList(VT), 0, 0);
871 ID.AddInteger(Alignment);
872 ID.AddInteger(Offset);
875 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
876 return SDOperand(E, 0);
877 SDNode *N = new ConstantPoolSDNode(isTarget, C, VT, Offset, Alignment);
878 CSEMap.InsertNode(N, IP);
879 AllNodes.push_back(N);
880 return SDOperand(N, 0);
884 SDOperand SelectionDAG::getConstantPool(MachineConstantPoolValue *C,
886 unsigned Alignment, int Offset,
888 unsigned Opc = isTarget ? ISD::TargetConstantPool : ISD::ConstantPool;
890 AddNodeIDNode(ID, Opc, getVTList(VT), 0, 0);
891 ID.AddInteger(Alignment);
892 ID.AddInteger(Offset);
893 C->AddSelectionDAGCSEId(ID);
895 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
896 return SDOperand(E, 0);
897 SDNode *N = new ConstantPoolSDNode(isTarget, C, VT, Offset, Alignment);
898 CSEMap.InsertNode(N, IP);
899 AllNodes.push_back(N);
900 return SDOperand(N, 0);
904 SDOperand SelectionDAG::getBasicBlock(MachineBasicBlock *MBB) {
906 AddNodeIDNode(ID, ISD::BasicBlock, getVTList(MVT::Other), 0, 0);
909 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
910 return SDOperand(E, 0);
911 SDNode *N = new BasicBlockSDNode(MBB);
912 CSEMap.InsertNode(N, IP);
913 AllNodes.push_back(N);
914 return SDOperand(N, 0);
917 SDOperand SelectionDAG::getValueType(MVT::ValueType VT) {
918 if (!MVT::isExtendedVT(VT) && (unsigned)VT >= ValueTypeNodes.size())
919 ValueTypeNodes.resize(VT+1);
921 SDNode *&N = MVT::isExtendedVT(VT) ?
922 ExtendedValueTypeNodes[VT] : ValueTypeNodes[VT];
924 if (N) return SDOperand(N, 0);
925 N = new VTSDNode(VT);
926 AllNodes.push_back(N);
927 return SDOperand(N, 0);
930 SDOperand SelectionDAG::getExternalSymbol(const char *Sym, MVT::ValueType VT) {
931 SDNode *&N = ExternalSymbols[Sym];
932 if (N) return SDOperand(N, 0);
933 N = new ExternalSymbolSDNode(false, Sym, VT);
934 AllNodes.push_back(N);
935 return SDOperand(N, 0);
938 SDOperand SelectionDAG::getTargetExternalSymbol(const char *Sym,
940 SDNode *&N = TargetExternalSymbols[Sym];
941 if (N) return SDOperand(N, 0);
942 N = new ExternalSymbolSDNode(true, Sym, VT);
943 AllNodes.push_back(N);
944 return SDOperand(N, 0);
947 SDOperand SelectionDAG::getCondCode(ISD::CondCode Cond) {
948 if ((unsigned)Cond >= CondCodeNodes.size())
949 CondCodeNodes.resize(Cond+1);
951 if (CondCodeNodes[Cond] == 0) {
952 CondCodeNodes[Cond] = new CondCodeSDNode(Cond);
953 AllNodes.push_back(CondCodeNodes[Cond]);
955 return SDOperand(CondCodeNodes[Cond], 0);
958 SDOperand SelectionDAG::getRegister(unsigned RegNo, MVT::ValueType VT) {
960 AddNodeIDNode(ID, ISD::Register, getVTList(VT), 0, 0);
961 ID.AddInteger(RegNo);
963 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
964 return SDOperand(E, 0);
965 SDNode *N = new RegisterSDNode(RegNo, VT);
966 CSEMap.InsertNode(N, IP);
967 AllNodes.push_back(N);
968 return SDOperand(N, 0);
971 SDOperand SelectionDAG::getSrcValue(const Value *V) {
972 assert((!V || isa<PointerType>(V->getType())) &&
973 "SrcValue is not a pointer?");
976 AddNodeIDNode(ID, ISD::SRCVALUE, getVTList(MVT::Other), 0, 0);
980 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
981 return SDOperand(E, 0);
983 SDNode *N = new SrcValueSDNode(V);
984 CSEMap.InsertNode(N, IP);
985 AllNodes.push_back(N);
986 return SDOperand(N, 0);
989 SDOperand SelectionDAG::getMemOperand(const MemOperand &MO) {
990 const Value *v = MO.getValue();
991 assert((!v || isa<PointerType>(v->getType())) &&
992 "SrcValue is not a pointer?");
995 AddNodeIDNode(ID, ISD::MEMOPERAND, getVTList(MVT::Other), 0, 0);
997 ID.AddInteger(MO.getFlags());
998 ID.AddInteger(MO.getOffset());
999 ID.AddInteger(MO.getSize());
1000 ID.AddInteger(MO.getAlignment());
1003 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
1004 return SDOperand(E, 0);
1006 SDNode *N = new MemOperandSDNode(MO);
1007 CSEMap.InsertNode(N, IP);
1008 AllNodes.push_back(N);
1009 return SDOperand(N, 0);
1012 /// CreateStackTemporary - Create a stack temporary, suitable for holding the
1013 /// specified value type.
1014 SDOperand SelectionDAG::CreateStackTemporary(MVT::ValueType VT) {
1015 MachineFrameInfo *FrameInfo = getMachineFunction().getFrameInfo();
1016 unsigned ByteSize = MVT::getSizeInBits(VT)/8;
1017 const Type *Ty = MVT::getTypeForValueType(VT);
1018 unsigned StackAlign = (unsigned)TLI.getTargetData()->getPrefTypeAlignment(Ty);
1019 int FrameIdx = FrameInfo->CreateStackObject(ByteSize, StackAlign);
1020 return getFrameIndex(FrameIdx, TLI.getPointerTy());
1024 SDOperand SelectionDAG::FoldSetCC(MVT::ValueType VT, SDOperand N1,
1025 SDOperand N2, ISD::CondCode Cond) {
1026 // These setcc operations always fold.
1030 case ISD::SETFALSE2: return getConstant(0, VT);
1032 case ISD::SETTRUE2: return getConstant(1, VT);
1044 assert(!MVT::isInteger(N1.getValueType()) && "Illegal setcc for integer!");
1048 if (ConstantSDNode *N2C = dyn_cast<ConstantSDNode>(N2.Val)) {
1049 const APInt &C2 = N2C->getAPIntValue();
1050 if (ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1.Val)) {
1051 const APInt &C1 = N1C->getAPIntValue();
1054 default: assert(0 && "Unknown integer setcc!");
1055 case ISD::SETEQ: return getConstant(C1 == C2, VT);
1056 case ISD::SETNE: return getConstant(C1 != C2, VT);
1057 case ISD::SETULT: return getConstant(C1.ult(C2), VT);
1058 case ISD::SETUGT: return getConstant(C1.ugt(C2), VT);
1059 case ISD::SETULE: return getConstant(C1.ule(C2), VT);
1060 case ISD::SETUGE: return getConstant(C1.uge(C2), VT);
1061 case ISD::SETLT: return getConstant(C1.slt(C2), VT);
1062 case ISD::SETGT: return getConstant(C1.sgt(C2), VT);
1063 case ISD::SETLE: return getConstant(C1.sle(C2), VT);
1064 case ISD::SETGE: return getConstant(C1.sge(C2), VT);
1068 if (ConstantFPSDNode *N1C = dyn_cast<ConstantFPSDNode>(N1.Val)) {
1069 if (ConstantFPSDNode *N2C = dyn_cast<ConstantFPSDNode>(N2.Val)) {
1070 // No compile time operations on this type yet.
1071 if (N1C->getValueType(0) == MVT::ppcf128)
1074 APFloat::cmpResult R = N1C->getValueAPF().compare(N2C->getValueAPF());
1077 case ISD::SETEQ: if (R==APFloat::cmpUnordered)
1078 return getNode(ISD::UNDEF, VT);
1080 case ISD::SETOEQ: return getConstant(R==APFloat::cmpEqual, VT);
1081 case ISD::SETNE: if (R==APFloat::cmpUnordered)
1082 return getNode(ISD::UNDEF, VT);
1084 case ISD::SETONE: return getConstant(R==APFloat::cmpGreaterThan ||
1085 R==APFloat::cmpLessThan, VT);
1086 case ISD::SETLT: if (R==APFloat::cmpUnordered)
1087 return getNode(ISD::UNDEF, VT);
1089 case ISD::SETOLT: return getConstant(R==APFloat::cmpLessThan, VT);
1090 case ISD::SETGT: if (R==APFloat::cmpUnordered)
1091 return getNode(ISD::UNDEF, VT);
1093 case ISD::SETOGT: return getConstant(R==APFloat::cmpGreaterThan, VT);
1094 case ISD::SETLE: if (R==APFloat::cmpUnordered)
1095 return getNode(ISD::UNDEF, VT);
1097 case ISD::SETOLE: return getConstant(R==APFloat::cmpLessThan ||
1098 R==APFloat::cmpEqual, VT);
1099 case ISD::SETGE: if (R==APFloat::cmpUnordered)
1100 return getNode(ISD::UNDEF, VT);
1102 case ISD::SETOGE: return getConstant(R==APFloat::cmpGreaterThan ||
1103 R==APFloat::cmpEqual, VT);
1104 case ISD::SETO: return getConstant(R!=APFloat::cmpUnordered, VT);
1105 case ISD::SETUO: return getConstant(R==APFloat::cmpUnordered, VT);
1106 case ISD::SETUEQ: return getConstant(R==APFloat::cmpUnordered ||
1107 R==APFloat::cmpEqual, VT);
1108 case ISD::SETUNE: return getConstant(R!=APFloat::cmpEqual, VT);
1109 case ISD::SETULT: return getConstant(R==APFloat::cmpUnordered ||
1110 R==APFloat::cmpLessThan, VT);
1111 case ISD::SETUGT: return getConstant(R==APFloat::cmpGreaterThan ||
1112 R==APFloat::cmpUnordered, VT);
1113 case ISD::SETULE: return getConstant(R!=APFloat::cmpGreaterThan, VT);
1114 case ISD::SETUGE: return getConstant(R!=APFloat::cmpLessThan, VT);
1117 // Ensure that the constant occurs on the RHS.
1118 return getSetCC(VT, N2, N1, ISD::getSetCCSwappedOperands(Cond));
1122 // Could not fold it.
1126 /// SignBitIsZero - Return true if the sign bit of Op is known to be zero. We
1127 /// use this predicate to simplify operations downstream.
1128 bool SelectionDAG::SignBitIsZero(SDOperand Op, unsigned Depth) const {
1129 unsigned BitWidth = Op.getValueSizeInBits();
1130 return MaskedValueIsZero(Op, APInt::getSignBit(BitWidth), Depth);
1133 /// MaskedValueIsZero - Return true if 'V & Mask' is known to be zero. We use
1134 /// this predicate to simplify operations downstream. Mask is known to be zero
1135 /// for bits that V cannot have.
1136 bool SelectionDAG::MaskedValueIsZero(SDOperand Op, const APInt &Mask,
1137 unsigned Depth) const {
1138 APInt KnownZero, KnownOne;
1139 ComputeMaskedBits(Op, Mask, KnownZero, KnownOne, Depth);
1140 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1141 return (KnownZero & Mask) == Mask;
1144 /// ComputeMaskedBits - Determine which of the bits specified in Mask are
1145 /// known to be either zero or one and return them in the KnownZero/KnownOne
1146 /// bitsets. This code only analyzes bits in Mask, in order to short-circuit
1148 void SelectionDAG::ComputeMaskedBits(SDOperand Op, const APInt &Mask,
1149 APInt &KnownZero, APInt &KnownOne,
1150 unsigned Depth) const {
1151 unsigned BitWidth = Mask.getBitWidth();
1152 assert(BitWidth == MVT::getSizeInBits(Op.getValueType()) &&
1153 "Mask size mismatches value type size!");
1155 KnownZero = KnownOne = APInt(BitWidth, 0); // Don't know anything.
1156 if (Depth == 6 || Mask == 0)
1157 return; // Limit search depth.
1159 APInt KnownZero2, KnownOne2;
1161 switch (Op.getOpcode()) {
1163 // We know all of the bits for a constant!
1164 KnownOne = cast<ConstantSDNode>(Op)->getAPIntValue() & Mask;
1165 KnownZero = ~KnownOne & Mask;
1168 // If either the LHS or the RHS are Zero, the result is zero.
1169 ComputeMaskedBits(Op.getOperand(1), Mask, KnownZero, KnownOne, Depth+1);
1170 ComputeMaskedBits(Op.getOperand(0), Mask & ~KnownZero,
1171 KnownZero2, KnownOne2, Depth+1);
1172 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1173 assert((KnownZero2 & KnownOne2) == 0 && "Bits known to be one AND zero?");
1175 // Output known-1 bits are only known if set in both the LHS & RHS.
1176 KnownOne &= KnownOne2;
1177 // Output known-0 are known to be clear if zero in either the LHS | RHS.
1178 KnownZero |= KnownZero2;
1181 ComputeMaskedBits(Op.getOperand(1), Mask, KnownZero, KnownOne, Depth+1);
1182 ComputeMaskedBits(Op.getOperand(0), Mask & ~KnownOne,
1183 KnownZero2, KnownOne2, Depth+1);
1184 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1185 assert((KnownZero2 & KnownOne2) == 0 && "Bits known to be one AND zero?");
1187 // Output known-0 bits are only known if clear in both the LHS & RHS.
1188 KnownZero &= KnownZero2;
1189 // Output known-1 are known to be set if set in either the LHS | RHS.
1190 KnownOne |= KnownOne2;
1193 ComputeMaskedBits(Op.getOperand(1), Mask, KnownZero, KnownOne, Depth+1);
1194 ComputeMaskedBits(Op.getOperand(0), Mask, KnownZero2, KnownOne2, Depth+1);
1195 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1196 assert((KnownZero2 & KnownOne2) == 0 && "Bits known to be one AND zero?");
1198 // Output known-0 bits are known if clear or set in both the LHS & RHS.
1199 APInt KnownZeroOut = (KnownZero & KnownZero2) | (KnownOne & KnownOne2);
1200 // Output known-1 are known to be set if set in only one of the LHS, RHS.
1201 KnownOne = (KnownZero & KnownOne2) | (KnownOne & KnownZero2);
1202 KnownZero = KnownZeroOut;
1206 ComputeMaskedBits(Op.getOperand(2), Mask, KnownZero, KnownOne, Depth+1);
1207 ComputeMaskedBits(Op.getOperand(1), Mask, KnownZero2, KnownOne2, Depth+1);
1208 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1209 assert((KnownZero2 & KnownOne2) == 0 && "Bits known to be one AND zero?");
1211 // Only known if known in both the LHS and RHS.
1212 KnownOne &= KnownOne2;
1213 KnownZero &= KnownZero2;
1215 case ISD::SELECT_CC:
1216 ComputeMaskedBits(Op.getOperand(3), Mask, KnownZero, KnownOne, Depth+1);
1217 ComputeMaskedBits(Op.getOperand(2), Mask, KnownZero2, KnownOne2, Depth+1);
1218 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1219 assert((KnownZero2 & KnownOne2) == 0 && "Bits known to be one AND zero?");
1221 // Only known if known in both the LHS and RHS.
1222 KnownOne &= KnownOne2;
1223 KnownZero &= KnownZero2;
1226 // If we know the result of a setcc has the top bits zero, use this info.
1227 if (TLI.getSetCCResultContents() == TargetLowering::ZeroOrOneSetCCResult &&
1229 KnownZero |= APInt::getHighBitsSet(BitWidth, BitWidth - 1);
1232 // (shl X, C1) & C2 == 0 iff (X & C2 >>u C1) == 0
1233 if (ConstantSDNode *SA = dyn_cast<ConstantSDNode>(Op.getOperand(1))) {
1234 unsigned ShAmt = SA->getValue();
1236 // If the shift count is an invalid immediate, don't do anything.
1237 if (ShAmt >= BitWidth)
1240 ComputeMaskedBits(Op.getOperand(0), Mask.lshr(ShAmt),
1241 KnownZero, KnownOne, Depth+1);
1242 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1243 KnownZero <<= ShAmt;
1245 // low bits known zero.
1246 KnownZero |= APInt::getLowBitsSet(BitWidth, ShAmt);
1250 // (ushr X, C1) & C2 == 0 iff (-1 >> C1) & C2 == 0
1251 if (ConstantSDNode *SA = dyn_cast<ConstantSDNode>(Op.getOperand(1))) {
1252 unsigned ShAmt = SA->getValue();
1254 // If the shift count is an invalid immediate, don't do anything.
1255 if (ShAmt >= BitWidth)
1258 ComputeMaskedBits(Op.getOperand(0), (Mask << ShAmt),
1259 KnownZero, KnownOne, Depth+1);
1260 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1261 KnownZero = KnownZero.lshr(ShAmt);
1262 KnownOne = KnownOne.lshr(ShAmt);
1264 APInt HighBits = APInt::getHighBitsSet(BitWidth, ShAmt) & Mask;
1265 KnownZero |= HighBits; // High bits known zero.
1269 if (ConstantSDNode *SA = dyn_cast<ConstantSDNode>(Op.getOperand(1))) {
1270 unsigned ShAmt = SA->getValue();
1272 // If the shift count is an invalid immediate, don't do anything.
1273 if (ShAmt >= BitWidth)
1276 APInt InDemandedMask = (Mask << ShAmt);
1277 // If any of the demanded bits are produced by the sign extension, we also
1278 // demand the input sign bit.
1279 APInt HighBits = APInt::getHighBitsSet(BitWidth, ShAmt) & Mask;
1280 if (HighBits.getBoolValue())
1281 InDemandedMask |= APInt::getSignBit(BitWidth);
1283 ComputeMaskedBits(Op.getOperand(0), InDemandedMask, KnownZero, KnownOne,
1285 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1286 KnownZero = KnownZero.lshr(ShAmt);
1287 KnownOne = KnownOne.lshr(ShAmt);
1289 // Handle the sign bits.
1290 APInt SignBit = APInt::getSignBit(BitWidth);
1291 SignBit = SignBit.lshr(ShAmt); // Adjust to where it is now in the mask.
1293 if (KnownZero.intersects(SignBit)) {
1294 KnownZero |= HighBits; // New bits are known zero.
1295 } else if (KnownOne.intersects(SignBit)) {
1296 KnownOne |= HighBits; // New bits are known one.
1300 case ISD::SIGN_EXTEND_INREG: {
1301 MVT::ValueType EVT = cast<VTSDNode>(Op.getOperand(1))->getVT();
1302 unsigned EBits = MVT::getSizeInBits(EVT);
1304 // Sign extension. Compute the demanded bits in the result that are not
1305 // present in the input.
1306 APInt NewBits = APInt::getHighBitsSet(BitWidth, BitWidth - EBits) & Mask;
1308 APInt InSignBit = APInt::getSignBit(EBits);
1309 APInt InputDemandedBits = Mask & APInt::getLowBitsSet(BitWidth, EBits);
1311 // If the sign extended bits are demanded, we know that the sign
1313 InSignBit.zext(BitWidth);
1314 if (NewBits.getBoolValue())
1315 InputDemandedBits |= InSignBit;
1317 ComputeMaskedBits(Op.getOperand(0), InputDemandedBits,
1318 KnownZero, KnownOne, Depth+1);
1319 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1321 // If the sign bit of the input is known set or clear, then we know the
1322 // top bits of the result.
1323 if (KnownZero.intersects(InSignBit)) { // Input sign bit known clear
1324 KnownZero |= NewBits;
1325 KnownOne &= ~NewBits;
1326 } else if (KnownOne.intersects(InSignBit)) { // Input sign bit known set
1327 KnownOne |= NewBits;
1328 KnownZero &= ~NewBits;
1329 } else { // Input sign bit unknown
1330 KnownZero &= ~NewBits;
1331 KnownOne &= ~NewBits;
1338 unsigned LowBits = Log2_32(BitWidth)+1;
1339 KnownZero = APInt::getHighBitsSet(BitWidth, BitWidth - LowBits);
1340 KnownOne = APInt(BitWidth, 0);
1344 if (ISD::isZEXTLoad(Op.Val)) {
1345 LoadSDNode *LD = cast<LoadSDNode>(Op);
1346 MVT::ValueType VT = LD->getMemoryVT();
1347 unsigned MemBits = MVT::getSizeInBits(VT);
1348 KnownZero |= APInt::getHighBitsSet(BitWidth, BitWidth - MemBits) & Mask;
1352 case ISD::ZERO_EXTEND: {
1353 MVT::ValueType InVT = Op.getOperand(0).getValueType();
1354 unsigned InBits = MVT::getSizeInBits(InVT);
1355 APInt NewBits = APInt::getHighBitsSet(BitWidth, BitWidth - InBits) & Mask;
1356 APInt InMask = Mask;
1357 InMask.trunc(InBits);
1358 KnownZero.trunc(InBits);
1359 KnownOne.trunc(InBits);
1360 ComputeMaskedBits(Op.getOperand(0), InMask, KnownZero, KnownOne, Depth+1);
1361 KnownZero.zext(BitWidth);
1362 KnownOne.zext(BitWidth);
1363 KnownZero |= NewBits;
1366 case ISD::SIGN_EXTEND: {
1367 MVT::ValueType InVT = Op.getOperand(0).getValueType();
1368 unsigned InBits = MVT::getSizeInBits(InVT);
1369 APInt InSignBit = APInt::getSignBit(InBits);
1370 APInt NewBits = APInt::getHighBitsSet(BitWidth, BitWidth - InBits) & Mask;
1371 APInt InMask = Mask;
1372 InMask.trunc(InBits);
1374 // If any of the sign extended bits are demanded, we know that the sign
1375 // bit is demanded. Temporarily set this bit in the mask for our callee.
1376 if (NewBits.getBoolValue())
1377 InMask |= InSignBit;
1379 KnownZero.trunc(InBits);
1380 KnownOne.trunc(InBits);
1381 ComputeMaskedBits(Op.getOperand(0), InMask, KnownZero, KnownOne, Depth+1);
1383 // Note if the sign bit is known to be zero or one.
1384 bool SignBitKnownZero = KnownZero.isNegative();
1385 bool SignBitKnownOne = KnownOne.isNegative();
1386 assert(!(SignBitKnownZero && SignBitKnownOne) &&
1387 "Sign bit can't be known to be both zero and one!");
1389 // If the sign bit wasn't actually demanded by our caller, we don't
1390 // want it set in the KnownZero and KnownOne result values. Reset the
1391 // mask and reapply it to the result values.
1393 InMask.trunc(InBits);
1394 KnownZero &= InMask;
1397 KnownZero.zext(BitWidth);
1398 KnownOne.zext(BitWidth);
1400 // If the sign bit is known zero or one, the top bits match.
1401 if (SignBitKnownZero)
1402 KnownZero |= NewBits;
1403 else if (SignBitKnownOne)
1404 KnownOne |= NewBits;
1407 case ISD::ANY_EXTEND: {
1408 MVT::ValueType InVT = Op.getOperand(0).getValueType();
1409 unsigned InBits = MVT::getSizeInBits(InVT);
1410 APInt InMask = Mask;
1411 InMask.trunc(InBits);
1412 KnownZero.trunc(InBits);
1413 KnownOne.trunc(InBits);
1414 ComputeMaskedBits(Op.getOperand(0), InMask, KnownZero, KnownOne, Depth+1);
1415 KnownZero.zext(BitWidth);
1416 KnownOne.zext(BitWidth);
1419 case ISD::TRUNCATE: {
1420 MVT::ValueType InVT = Op.getOperand(0).getValueType();
1421 unsigned InBits = MVT::getSizeInBits(InVT);
1422 APInt InMask = Mask;
1423 InMask.zext(InBits);
1424 KnownZero.zext(InBits);
1425 KnownOne.zext(InBits);
1426 ComputeMaskedBits(Op.getOperand(0), InMask, KnownZero, KnownOne, Depth+1);
1427 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1428 KnownZero.trunc(BitWidth);
1429 KnownOne.trunc(BitWidth);
1432 case ISD::AssertZext: {
1433 MVT::ValueType VT = cast<VTSDNode>(Op.getOperand(1))->getVT();
1434 APInt InMask = APInt::getLowBitsSet(BitWidth, MVT::getSizeInBits(VT));
1435 ComputeMaskedBits(Op.getOperand(0), Mask & InMask, KnownZero,
1437 KnownZero |= (~InMask) & Mask;
1441 // All bits are zero except the low bit.
1442 KnownZero = APInt::getHighBitsSet(BitWidth, BitWidth - 1);
1446 // If either the LHS or the RHS are Zero, the result is zero.
1447 ComputeMaskedBits(Op.getOperand(1), Mask, KnownZero, KnownOne, Depth+1);
1448 ComputeMaskedBits(Op.getOperand(0), Mask, KnownZero2, KnownOne2, Depth+1);
1449 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1450 assert((KnownZero2 & KnownOne2) == 0 && "Bits known to be one AND zero?");
1452 // Output known-0 bits are known if clear or set in both the low clear bits
1453 // common to both LHS & RHS. For example, 8+(X<<3) is known to have the
1454 // low 3 bits clear.
1455 unsigned KnownZeroOut = std::min(KnownZero.countTrailingOnes(),
1456 KnownZero2.countTrailingOnes());
1458 KnownZero = APInt::getLowBitsSet(BitWidth, KnownZeroOut);
1459 KnownOne = APInt(BitWidth, 0);
1463 ConstantSDNode *CLHS = dyn_cast<ConstantSDNode>(Op.getOperand(0));
1466 // We know that the top bits of C-X are clear if X contains less bits
1467 // than C (i.e. no wrap-around can happen). For example, 20-X is
1468 // positive if we can prove that X is >= 0 and < 16.
1469 if (CLHS->getAPIntValue().isNonNegative()) {
1470 unsigned NLZ = (CLHS->getAPIntValue()+1).countLeadingZeros();
1471 // NLZ can't be BitWidth with no sign bit
1472 APInt MaskV = APInt::getHighBitsSet(BitWidth, NLZ+1);
1473 ComputeMaskedBits(Op.getOperand(1), MaskV, KnownZero, KnownOne, Depth+1);
1475 // If all of the MaskV bits are known to be zero, then we know the output
1476 // top bits are zero, because we now know that the output is from [0-C].
1477 if ((KnownZero & MaskV) == MaskV) {
1478 unsigned NLZ2 = CLHS->getAPIntValue().countLeadingZeros();
1479 // Top bits known zero.
1480 KnownZero = APInt::getHighBitsSet(BitWidth, NLZ2) & Mask;
1481 KnownOne = APInt(BitWidth, 0); // No one bits known.
1483 KnownZero = KnownOne = APInt(BitWidth, 0); // Otherwise, nothing known.
1489 // Allow the target to implement this method for its nodes.
1490 if (Op.getOpcode() >= ISD::BUILTIN_OP_END) {
1491 case ISD::INTRINSIC_WO_CHAIN:
1492 case ISD::INTRINSIC_W_CHAIN:
1493 case ISD::INTRINSIC_VOID:
1494 TLI.computeMaskedBitsForTargetNode(Op, Mask, KnownZero, KnownOne, *this);
1500 /// ComputeNumSignBits - Return the number of times the sign bit of the
1501 /// register is replicated into the other bits. We know that at least 1 bit
1502 /// is always equal to the sign bit (itself), but other cases can give us
1503 /// information. For example, immediately after an "SRA X, 2", we know that
1504 /// the top 3 bits are all equal to each other, so we return 3.
1505 unsigned SelectionDAG::ComputeNumSignBits(SDOperand Op, unsigned Depth) const{
1506 MVT::ValueType VT = Op.getValueType();
1507 assert(MVT::isInteger(VT) && "Invalid VT!");
1508 unsigned VTBits = MVT::getSizeInBits(VT);
1512 return 1; // Limit search depth.
1514 switch (Op.getOpcode()) {
1516 case ISD::AssertSext:
1517 Tmp = MVT::getSizeInBits(cast<VTSDNode>(Op.getOperand(1))->getVT());
1518 return VTBits-Tmp+1;
1519 case ISD::AssertZext:
1520 Tmp = MVT::getSizeInBits(cast<VTSDNode>(Op.getOperand(1))->getVT());
1523 case ISD::Constant: {
1524 const APInt &Val = cast<ConstantSDNode>(Op)->getAPIntValue();
1525 // If negative, return # leading ones.
1526 if (Val.isNegative())
1527 return Val.countLeadingOnes();
1529 // Return # leading zeros.
1530 return Val.countLeadingZeros();
1533 case ISD::SIGN_EXTEND:
1534 Tmp = VTBits-MVT::getSizeInBits(Op.getOperand(0).getValueType());
1535 return ComputeNumSignBits(Op.getOperand(0), Depth+1) + Tmp;
1537 case ISD::SIGN_EXTEND_INREG:
1538 // Max of the input and what this extends.
1539 Tmp = MVT::getSizeInBits(cast<VTSDNode>(Op.getOperand(1))->getVT());
1542 Tmp2 = ComputeNumSignBits(Op.getOperand(0), Depth+1);
1543 return std::max(Tmp, Tmp2);
1546 Tmp = ComputeNumSignBits(Op.getOperand(0), Depth+1);
1547 // SRA X, C -> adds C sign bits.
1548 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op.getOperand(1))) {
1549 Tmp += C->getValue();
1550 if (Tmp > VTBits) Tmp = VTBits;
1554 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op.getOperand(1))) {
1555 // shl destroys sign bits.
1556 Tmp = ComputeNumSignBits(Op.getOperand(0), Depth+1);
1557 if (C->getValue() >= VTBits || // Bad shift.
1558 C->getValue() >= Tmp) break; // Shifted all sign bits out.
1559 return Tmp - C->getValue();
1564 case ISD::XOR: // NOT is handled here.
1565 // Logical binary ops preserve the number of sign bits.
1566 Tmp = ComputeNumSignBits(Op.getOperand(0), Depth+1);
1567 if (Tmp == 1) return 1; // Early out.
1568 Tmp2 = ComputeNumSignBits(Op.getOperand(1), Depth+1);
1569 return std::min(Tmp, Tmp2);
1572 Tmp = ComputeNumSignBits(Op.getOperand(0), Depth+1);
1573 if (Tmp == 1) return 1; // Early out.
1574 Tmp2 = ComputeNumSignBits(Op.getOperand(1), Depth+1);
1575 return std::min(Tmp, Tmp2);
1578 // If setcc returns 0/-1, all bits are sign bits.
1579 if (TLI.getSetCCResultContents() ==
1580 TargetLowering::ZeroOrNegativeOneSetCCResult)
1585 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op.getOperand(1))) {
1586 unsigned RotAmt = C->getValue() & (VTBits-1);
1588 // Handle rotate right by N like a rotate left by 32-N.
1589 if (Op.getOpcode() == ISD::ROTR)
1590 RotAmt = (VTBits-RotAmt) & (VTBits-1);
1592 // If we aren't rotating out all of the known-in sign bits, return the
1593 // number that are left. This handles rotl(sext(x), 1) for example.
1594 Tmp = ComputeNumSignBits(Op.getOperand(0), Depth+1);
1595 if (Tmp > RotAmt+1) return Tmp-RotAmt;
1599 // Add can have at most one carry bit. Thus we know that the output
1600 // is, at worst, one more bit than the inputs.
1601 Tmp = ComputeNumSignBits(Op.getOperand(0), Depth+1);
1602 if (Tmp == 1) return 1; // Early out.
1604 // Special case decrementing a value (ADD X, -1):
1605 if (ConstantSDNode *CRHS = dyn_cast<ConstantSDNode>(Op.getOperand(0)))
1606 if (CRHS->isAllOnesValue()) {
1607 APInt KnownZero, KnownOne;
1608 APInt Mask = APInt::getAllOnesValue(VTBits);
1609 ComputeMaskedBits(Op.getOperand(0), Mask, KnownZero, KnownOne, Depth+1);
1611 // If the input is known to be 0 or 1, the output is 0/-1, which is all
1613 if ((KnownZero | APInt(VTBits, 1)) == Mask)
1616 // If we are subtracting one from a positive number, there is no carry
1617 // out of the result.
1618 if (KnownZero.isNegative())
1622 Tmp2 = ComputeNumSignBits(Op.getOperand(1), Depth+1);
1623 if (Tmp2 == 1) return 1;
1624 return std::min(Tmp, Tmp2)-1;
1628 Tmp2 = ComputeNumSignBits(Op.getOperand(1), Depth+1);
1629 if (Tmp2 == 1) return 1;
1632 if (ConstantSDNode *CLHS = dyn_cast<ConstantSDNode>(Op.getOperand(0)))
1633 if (CLHS->getValue() == 0) {
1634 APInt KnownZero, KnownOne;
1635 APInt Mask = APInt::getAllOnesValue(VTBits);
1636 ComputeMaskedBits(Op.getOperand(1), Mask, KnownZero, KnownOne, Depth+1);
1637 // If the input is known to be 0 or 1, the output is 0/-1, which is all
1639 if ((KnownZero | APInt(VTBits, 1)) == Mask)
1642 // If the input is known to be positive (the sign bit is known clear),
1643 // the output of the NEG has the same number of sign bits as the input.
1644 if (KnownZero.isNegative())
1647 // Otherwise, we treat this like a SUB.
1650 // Sub can have at most one carry bit. Thus we know that the output
1651 // is, at worst, one more bit than the inputs.
1652 Tmp = ComputeNumSignBits(Op.getOperand(0), Depth+1);
1653 if (Tmp == 1) return 1; // Early out.
1654 return std::min(Tmp, Tmp2)-1;
1657 // FIXME: it's tricky to do anything useful for this, but it is an important
1658 // case for targets like X86.
1662 // Handle LOADX separately here. EXTLOAD case will fallthrough.
1663 if (Op.getOpcode() == ISD::LOAD) {
1664 LoadSDNode *LD = cast<LoadSDNode>(Op);
1665 unsigned ExtType = LD->getExtensionType();
1668 case ISD::SEXTLOAD: // '17' bits known
1669 Tmp = MVT::getSizeInBits(LD->getMemoryVT());
1670 return VTBits-Tmp+1;
1671 case ISD::ZEXTLOAD: // '16' bits known
1672 Tmp = MVT::getSizeInBits(LD->getMemoryVT());
1677 // Allow the target to implement this method for its nodes.
1678 if (Op.getOpcode() >= ISD::BUILTIN_OP_END ||
1679 Op.getOpcode() == ISD::INTRINSIC_WO_CHAIN ||
1680 Op.getOpcode() == ISD::INTRINSIC_W_CHAIN ||
1681 Op.getOpcode() == ISD::INTRINSIC_VOID) {
1682 unsigned NumBits = TLI.ComputeNumSignBitsForTargetNode(Op, Depth);
1683 if (NumBits > 1) return NumBits;
1686 // Finally, if we can prove that the top bits of the result are 0's or 1's,
1687 // use this information.
1688 APInt KnownZero, KnownOne;
1689 APInt Mask = APInt::getAllOnesValue(VTBits);
1690 ComputeMaskedBits(Op, Mask, KnownZero, KnownOne, Depth);
1692 if (KnownZero.isNegative()) { // sign bit is 0
1694 } else if (KnownOne.isNegative()) { // sign bit is 1;
1701 // Okay, we know that the sign bit in Mask is set. Use CLZ to determine
1702 // the number of identical bits in the top of the input value.
1704 Mask <<= Mask.getBitWidth()-VTBits;
1705 // Return # leading zeros. We use 'min' here in case Val was zero before
1706 // shifting. We don't want to return '64' as for an i32 "0".
1707 return std::min(VTBits, Mask.countLeadingZeros());
1711 bool SelectionDAG::isVerifiedDebugInfoDesc(SDOperand Op) const {
1712 GlobalAddressSDNode *GA = dyn_cast<GlobalAddressSDNode>(Op);
1713 if (!GA) return false;
1714 GlobalVariable *GV = dyn_cast<GlobalVariable>(GA->getGlobal());
1715 if (!GV) return false;
1716 MachineModuleInfo *MMI = getMachineModuleInfo();
1717 return MMI && MMI->hasDebugInfo() && MMI->isVerified(GV);
1721 /// getNode - Gets or creates the specified node.
1723 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT) {
1724 FoldingSetNodeID ID;
1725 AddNodeIDNode(ID, Opcode, getVTList(VT), 0, 0);
1727 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
1728 return SDOperand(E, 0);
1729 SDNode *N = new SDNode(Opcode, SDNode::getSDVTList(VT));
1730 CSEMap.InsertNode(N, IP);
1732 AllNodes.push_back(N);
1733 return SDOperand(N, 0);
1736 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT,
1737 SDOperand Operand) {
1738 // Constant fold unary operations with an integer constant operand.
1739 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Operand.Val)) {
1740 const APInt &Val = C->getAPIntValue();
1741 unsigned BitWidth = MVT::getSizeInBits(VT);
1744 case ISD::SIGN_EXTEND:
1745 return getConstant(APInt(Val).sextOrTrunc(BitWidth), VT);
1746 case ISD::ANY_EXTEND:
1747 case ISD::ZERO_EXTEND:
1749 return getConstant(APInt(Val).zextOrTrunc(BitWidth), VT);
1750 case ISD::UINT_TO_FP:
1751 case ISD::SINT_TO_FP: {
1752 const uint64_t zero[] = {0, 0};
1753 // No compile time operations on this type.
1754 if (VT==MVT::ppcf128)
1756 APFloat apf = APFloat(APInt(BitWidth, 2, zero));
1757 (void)apf.convertFromAPInt(Val,
1758 Opcode==ISD::SINT_TO_FP,
1759 APFloat::rmNearestTiesToEven);
1760 return getConstantFP(apf, VT);
1762 case ISD::BIT_CONVERT:
1763 if (VT == MVT::f32 && C->getValueType(0) == MVT::i32)
1764 return getConstantFP(Val.bitsToFloat(), VT);
1765 else if (VT == MVT::f64 && C->getValueType(0) == MVT::i64)
1766 return getConstantFP(Val.bitsToDouble(), VT);
1769 return getConstant(Val.byteSwap(), VT);
1771 return getConstant(Val.countPopulation(), VT);
1773 return getConstant(Val.countLeadingZeros(), VT);
1775 return getConstant(Val.countTrailingZeros(), VT);
1779 // Constant fold unary operations with a floating point constant operand.
1780 if (ConstantFPSDNode *C = dyn_cast<ConstantFPSDNode>(Operand.Val)) {
1781 APFloat V = C->getValueAPF(); // make copy
1782 if (VT != MVT::ppcf128 && Operand.getValueType() != MVT::ppcf128) {
1786 return getConstantFP(V, VT);
1789 return getConstantFP(V, VT);
1791 case ISD::FP_EXTEND:
1792 // This can return overflow, underflow, or inexact; we don't care.
1793 // FIXME need to be more flexible about rounding mode.
1794 (void)V.convert(*MVTToAPFloatSemantics(VT),
1795 APFloat::rmNearestTiesToEven);
1796 return getConstantFP(V, VT);
1797 case ISD::FP_TO_SINT:
1798 case ISD::FP_TO_UINT: {
1800 assert(integerPartWidth >= 64);
1801 // FIXME need to be more flexible about rounding mode.
1802 APFloat::opStatus s = V.convertToInteger(&x, 64U,
1803 Opcode==ISD::FP_TO_SINT,
1804 APFloat::rmTowardZero);
1805 if (s==APFloat::opInvalidOp) // inexact is OK, in fact usual
1807 return getConstant(x, VT);
1809 case ISD::BIT_CONVERT:
1810 if (VT == MVT::i32 && C->getValueType(0) == MVT::f32)
1811 return getConstant((uint32_t)V.convertToAPInt().getZExtValue(), VT);
1812 else if (VT == MVT::i64 && C->getValueType(0) == MVT::f64)
1813 return getConstant(V.convertToAPInt().getZExtValue(), VT);
1819 unsigned OpOpcode = Operand.Val->getOpcode();
1821 case ISD::TokenFactor:
1822 return Operand; // Factor of one node? No factor.
1823 case ISD::FP_ROUND: assert(0 && "Invalid method to make FP_ROUND node");
1824 case ISD::FP_EXTEND:
1825 assert(MVT::isFloatingPoint(VT) &&
1826 MVT::isFloatingPoint(Operand.getValueType()) && "Invalid FP cast!");
1827 if (Operand.getValueType() == VT) return Operand; // noop conversion.
1828 if (Operand.getOpcode() == ISD::UNDEF)
1829 return getNode(ISD::UNDEF, VT);
1831 case ISD::SIGN_EXTEND:
1832 assert(MVT::isInteger(VT) && MVT::isInteger(Operand.getValueType()) &&
1833 "Invalid SIGN_EXTEND!");
1834 if (Operand.getValueType() == VT) return Operand; // noop extension
1835 assert(MVT::getSizeInBits(Operand.getValueType()) < MVT::getSizeInBits(VT)
1836 && "Invalid sext node, dst < src!");
1837 if (OpOpcode == ISD::SIGN_EXTEND || OpOpcode == ISD::ZERO_EXTEND)
1838 return getNode(OpOpcode, VT, Operand.Val->getOperand(0));
1840 case ISD::ZERO_EXTEND:
1841 assert(MVT::isInteger(VT) && MVT::isInteger(Operand.getValueType()) &&
1842 "Invalid ZERO_EXTEND!");
1843 if (Operand.getValueType() == VT) return Operand; // noop extension
1844 assert(MVT::getSizeInBits(Operand.getValueType()) < MVT::getSizeInBits(VT)
1845 && "Invalid zext node, dst < src!");
1846 if (OpOpcode == ISD::ZERO_EXTEND) // (zext (zext x)) -> (zext x)
1847 return getNode(ISD::ZERO_EXTEND, VT, Operand.Val->getOperand(0));
1849 case ISD::ANY_EXTEND:
1850 assert(MVT::isInteger(VT) && MVT::isInteger(Operand.getValueType()) &&
1851 "Invalid ANY_EXTEND!");
1852 if (Operand.getValueType() == VT) return Operand; // noop extension
1853 assert(MVT::getSizeInBits(Operand.getValueType()) < MVT::getSizeInBits(VT)
1854 && "Invalid anyext node, dst < src!");
1855 if (OpOpcode == ISD::ZERO_EXTEND || OpOpcode == ISD::SIGN_EXTEND)
1856 // (ext (zext x)) -> (zext x) and (ext (sext x)) -> (sext x)
1857 return getNode(OpOpcode, VT, Operand.Val->getOperand(0));
1860 assert(MVT::isInteger(VT) && MVT::isInteger(Operand.getValueType()) &&
1861 "Invalid TRUNCATE!");
1862 if (Operand.getValueType() == VT) return Operand; // noop truncate
1863 assert(MVT::getSizeInBits(Operand.getValueType()) > MVT::getSizeInBits(VT)
1864 && "Invalid truncate node, src < dst!");
1865 if (OpOpcode == ISD::TRUNCATE)
1866 return getNode(ISD::TRUNCATE, VT, Operand.Val->getOperand(0));
1867 else if (OpOpcode == ISD::ZERO_EXTEND || OpOpcode == ISD::SIGN_EXTEND ||
1868 OpOpcode == ISD::ANY_EXTEND) {
1869 // If the source is smaller than the dest, we still need an extend.
1870 if (MVT::getSizeInBits(Operand.Val->getOperand(0).getValueType())
1871 < MVT::getSizeInBits(VT))
1872 return getNode(OpOpcode, VT, Operand.Val->getOperand(0));
1873 else if (MVT::getSizeInBits(Operand.Val->getOperand(0).getValueType())
1874 > MVT::getSizeInBits(VT))
1875 return getNode(ISD::TRUNCATE, VT, Operand.Val->getOperand(0));
1877 return Operand.Val->getOperand(0);
1880 case ISD::BIT_CONVERT:
1881 // Basic sanity checking.
1882 assert(MVT::getSizeInBits(VT) == MVT::getSizeInBits(Operand.getValueType())
1883 && "Cannot BIT_CONVERT between types of different sizes!");
1884 if (VT == Operand.getValueType()) return Operand; // noop conversion.
1885 if (OpOpcode == ISD::BIT_CONVERT) // bitconv(bitconv(x)) -> bitconv(x)
1886 return getNode(ISD::BIT_CONVERT, VT, Operand.getOperand(0));
1887 if (OpOpcode == ISD::UNDEF)
1888 return getNode(ISD::UNDEF, VT);
1890 case ISD::SCALAR_TO_VECTOR:
1891 assert(MVT::isVector(VT) && !MVT::isVector(Operand.getValueType()) &&
1892 MVT::getVectorElementType(VT) == Operand.getValueType() &&
1893 "Illegal SCALAR_TO_VECTOR node!");
1894 if (OpOpcode == ISD::UNDEF)
1895 return getNode(ISD::UNDEF, VT);
1896 // scalar_to_vector(extract_vector_elt V, 0) -> V, top bits are undefined.
1897 if (OpOpcode == ISD::EXTRACT_VECTOR_ELT &&
1898 isa<ConstantSDNode>(Operand.getOperand(1)) &&
1899 Operand.getConstantOperandVal(1) == 0 &&
1900 Operand.getOperand(0).getValueType() == VT)
1901 return Operand.getOperand(0);
1904 if (OpOpcode == ISD::FSUB) // -(X-Y) -> (Y-X)
1905 return getNode(ISD::FSUB, VT, Operand.Val->getOperand(1),
1906 Operand.Val->getOperand(0));
1907 if (OpOpcode == ISD::FNEG) // --X -> X
1908 return Operand.Val->getOperand(0);
1911 if (OpOpcode == ISD::FNEG) // abs(-X) -> abs(X)
1912 return getNode(ISD::FABS, VT, Operand.Val->getOperand(0));
1917 SDVTList VTs = getVTList(VT);
1918 if (VT != MVT::Flag) { // Don't CSE flag producing nodes
1919 FoldingSetNodeID ID;
1920 SDOperand Ops[1] = { Operand };
1921 AddNodeIDNode(ID, Opcode, VTs, Ops, 1);
1923 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
1924 return SDOperand(E, 0);
1925 N = new UnarySDNode(Opcode, VTs, Operand);
1926 CSEMap.InsertNode(N, IP);
1928 N = new UnarySDNode(Opcode, VTs, Operand);
1930 AllNodes.push_back(N);
1931 return SDOperand(N, 0);
1936 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT,
1937 SDOperand N1, SDOperand N2) {
1938 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1.Val);
1939 ConstantSDNode *N2C = dyn_cast<ConstantSDNode>(N2.Val);
1942 case ISD::TokenFactor:
1943 assert(VT == MVT::Other && N1.getValueType() == MVT::Other &&
1944 N2.getValueType() == MVT::Other && "Invalid token factor!");
1945 // Fold trivial token factors.
1946 if (N1.getOpcode() == ISD::EntryToken) return N2;
1947 if (N2.getOpcode() == ISD::EntryToken) return N1;
1950 assert(MVT::isInteger(VT) && N1.getValueType() == N2.getValueType() &&
1951 N1.getValueType() == VT && "Binary operator types must match!");
1952 // (X & 0) -> 0. This commonly occurs when legalizing i64 values, so it's
1953 // worth handling here.
1954 if (N2C && N2C->getValue() == 0)
1956 if (N2C && N2C->isAllOnesValue()) // X & -1 -> X
1961 assert(MVT::isInteger(VT) && N1.getValueType() == N2.getValueType() &&
1962 N1.getValueType() == VT && "Binary operator types must match!");
1963 // (X ^| 0) -> X. This commonly occurs when legalizing i64 values, so it's
1964 // worth handling here.
1965 if (N2C && N2C->getValue() == 0)
1972 assert(MVT::isInteger(VT) && "This operator does not apply to FP types!");
1984 assert(N1.getValueType() == N2.getValueType() &&
1985 N1.getValueType() == VT && "Binary operator types must match!");
1987 case ISD::FCOPYSIGN: // N1 and result must match. N1/N2 need not match.
1988 assert(N1.getValueType() == VT &&
1989 MVT::isFloatingPoint(N1.getValueType()) &&
1990 MVT::isFloatingPoint(N2.getValueType()) &&
1991 "Invalid FCOPYSIGN!");
1998 assert(VT == N1.getValueType() &&
1999 "Shift operators return type must be the same as their first arg");
2000 assert(MVT::isInteger(VT) && MVT::isInteger(N2.getValueType()) &&
2001 VT != MVT::i1 && "Shifts only work on integers");
2003 case ISD::FP_ROUND_INREG: {
2004 MVT::ValueType EVT = cast<VTSDNode>(N2)->getVT();
2005 assert(VT == N1.getValueType() && "Not an inreg round!");
2006 assert(MVT::isFloatingPoint(VT) && MVT::isFloatingPoint(EVT) &&
2007 "Cannot FP_ROUND_INREG integer types");
2008 assert(MVT::getSizeInBits(EVT) <= MVT::getSizeInBits(VT) &&
2009 "Not rounding down!");
2010 if (cast<VTSDNode>(N2)->getVT() == VT) return N1; // Not actually rounding.
2014 assert(MVT::isFloatingPoint(VT) &&
2015 MVT::isFloatingPoint(N1.getValueType()) &&
2016 MVT::getSizeInBits(VT) <= MVT::getSizeInBits(N1.getValueType()) &&
2017 isa<ConstantSDNode>(N2) && "Invalid FP_ROUND!");
2018 if (N1.getValueType() == VT) return N1; // noop conversion.
2020 case ISD::AssertSext:
2021 case ISD::AssertZext: {
2022 MVT::ValueType EVT = cast<VTSDNode>(N2)->getVT();
2023 assert(VT == N1.getValueType() && "Not an inreg extend!");
2024 assert(MVT::isInteger(VT) && MVT::isInteger(EVT) &&
2025 "Cannot *_EXTEND_INREG FP types");
2026 assert(MVT::getSizeInBits(EVT) <= MVT::getSizeInBits(VT) &&
2028 if (VT == EVT) return N1; // noop assertion.
2031 case ISD::SIGN_EXTEND_INREG: {
2032 MVT::ValueType EVT = cast<VTSDNode>(N2)->getVT();
2033 assert(VT == N1.getValueType() && "Not an inreg extend!");
2034 assert(MVT::isInteger(VT) && MVT::isInteger(EVT) &&
2035 "Cannot *_EXTEND_INREG FP types");
2036 assert(MVT::getSizeInBits(EVT) <= MVT::getSizeInBits(VT) &&
2038 if (EVT == VT) return N1; // Not actually extending
2041 APInt Val = N1C->getAPIntValue();
2042 unsigned FromBits = MVT::getSizeInBits(cast<VTSDNode>(N2)->getVT());
2043 Val <<= Val.getBitWidth()-FromBits;
2044 Val = Val.ashr(Val.getBitWidth()-FromBits);
2045 return getConstant(Val, VT);
2049 case ISD::EXTRACT_VECTOR_ELT:
2050 assert(N2C && "Bad EXTRACT_VECTOR_ELT!");
2052 // EXTRACT_VECTOR_ELT of an UNDEF is an UNDEF.
2053 if (N1.getOpcode() == ISD::UNDEF)
2054 return getNode(ISD::UNDEF, VT);
2056 // EXTRACT_VECTOR_ELT of CONCAT_VECTORS is often formed while lowering is
2057 // expanding copies of large vectors from registers.
2058 if (N1.getOpcode() == ISD::CONCAT_VECTORS &&
2059 N1.getNumOperands() > 0) {
2061 MVT::getVectorNumElements(N1.getOperand(0).getValueType());
2062 return getNode(ISD::EXTRACT_VECTOR_ELT, VT,
2063 N1.getOperand(N2C->getValue() / Factor),
2064 getConstant(N2C->getValue() % Factor, N2.getValueType()));
2067 // EXTRACT_VECTOR_ELT of BUILD_VECTOR is often formed while lowering is
2068 // expanding large vector constants.
2069 if (N1.getOpcode() == ISD::BUILD_VECTOR)
2070 return N1.getOperand(N2C->getValue());
2072 // EXTRACT_VECTOR_ELT of INSERT_VECTOR_ELT is often formed when vector
2073 // operations are lowered to scalars.
2074 if (N1.getOpcode() == ISD::INSERT_VECTOR_ELT)
2075 if (ConstantSDNode *IEC = dyn_cast<ConstantSDNode>(N1.getOperand(2))) {
2077 return N1.getOperand(1);
2079 return getNode(ISD::EXTRACT_VECTOR_ELT, VT, N1.getOperand(0), N2);
2082 case ISD::EXTRACT_ELEMENT:
2083 assert(N2C && (unsigned)N2C->getValue() < 2 && "Bad EXTRACT_ELEMENT!");
2085 // EXTRACT_ELEMENT of BUILD_PAIR is often formed while legalize is expanding
2086 // 64-bit integers into 32-bit parts. Instead of building the extract of
2087 // the BUILD_PAIR, only to have legalize rip it apart, just do it now.
2088 if (N1.getOpcode() == ISD::BUILD_PAIR)
2089 return N1.getOperand(N2C->getValue());
2091 // EXTRACT_ELEMENT of a constant int is also very common.
2092 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(N1)) {
2093 unsigned Shift = MVT::getSizeInBits(VT) * N2C->getValue();
2094 return getConstant(C->getValue() >> Shift, VT);
2097 case ISD::EXTRACT_SUBVECTOR:
2098 if (N1.getValueType() == VT) // Trivial extraction.
2105 APInt C1 = N1C->getAPIntValue(), C2 = N2C->getAPIntValue();
2107 case ISD::ADD: return getConstant(C1 + C2, VT);
2108 case ISD::SUB: return getConstant(C1 - C2, VT);
2109 case ISD::MUL: return getConstant(C1 * C2, VT);
2111 if (C2.getBoolValue()) return getConstant(C1.udiv(C2), VT);
2114 if (C2.getBoolValue()) return getConstant(C1.urem(C2), VT);
2117 if (C2.getBoolValue()) return getConstant(C1.sdiv(C2), VT);
2120 if (C2.getBoolValue()) return getConstant(C1.srem(C2), VT);
2122 case ISD::AND : return getConstant(C1 & C2, VT);
2123 case ISD::OR : return getConstant(C1 | C2, VT);
2124 case ISD::XOR : return getConstant(C1 ^ C2, VT);
2125 case ISD::SHL : return getConstant(C1 << C2, VT);
2126 case ISD::SRL : return getConstant(C1.lshr(C2), VT);
2127 case ISD::SRA : return getConstant(C1.ashr(C2), VT);
2128 case ISD::ROTL : return getConstant(C1.rotl(C2), VT);
2129 case ISD::ROTR : return getConstant(C1.rotr(C2), VT);
2132 } else { // Cannonicalize constant to RHS if commutative
2133 if (isCommutativeBinOp(Opcode)) {
2134 std::swap(N1C, N2C);
2140 // Constant fold FP operations.
2141 ConstantFPSDNode *N1CFP = dyn_cast<ConstantFPSDNode>(N1.Val);
2142 ConstantFPSDNode *N2CFP = dyn_cast<ConstantFPSDNode>(N2.Val);
2144 if (!N2CFP && isCommutativeBinOp(Opcode)) {
2145 // Cannonicalize constant to RHS if commutative
2146 std::swap(N1CFP, N2CFP);
2148 } else if (N2CFP && VT != MVT::ppcf128) {
2149 APFloat V1 = N1CFP->getValueAPF(), V2 = N2CFP->getValueAPF();
2150 APFloat::opStatus s;
2153 s = V1.add(V2, APFloat::rmNearestTiesToEven);
2154 if (s != APFloat::opInvalidOp)
2155 return getConstantFP(V1, VT);
2158 s = V1.subtract(V2, APFloat::rmNearestTiesToEven);
2159 if (s!=APFloat::opInvalidOp)
2160 return getConstantFP(V1, VT);
2163 s = V1.multiply(V2, APFloat::rmNearestTiesToEven);
2164 if (s!=APFloat::opInvalidOp)
2165 return getConstantFP(V1, VT);
2168 s = V1.divide(V2, APFloat::rmNearestTiesToEven);
2169 if (s!=APFloat::opInvalidOp && s!=APFloat::opDivByZero)
2170 return getConstantFP(V1, VT);
2173 s = V1.mod(V2, APFloat::rmNearestTiesToEven);
2174 if (s!=APFloat::opInvalidOp && s!=APFloat::opDivByZero)
2175 return getConstantFP(V1, VT);
2177 case ISD::FCOPYSIGN:
2179 return getConstantFP(V1, VT);
2185 // Canonicalize an UNDEF to the RHS, even over a constant.
2186 if (N1.getOpcode() == ISD::UNDEF) {
2187 if (isCommutativeBinOp(Opcode)) {
2191 case ISD::FP_ROUND_INREG:
2192 case ISD::SIGN_EXTEND_INREG:
2198 return N1; // fold op(undef, arg2) -> undef
2205 if (!MVT::isVector(VT))
2206 return getConstant(0, VT); // fold op(undef, arg2) -> 0
2207 // For vectors, we can't easily build an all zero vector, just return
2214 // Fold a bunch of operators when the RHS is undef.
2215 if (N2.getOpcode() == ISD::UNDEF) {
2231 return N2; // fold op(arg1, undef) -> undef
2236 if (!MVT::isVector(VT))
2237 return getConstant(0, VT); // fold op(arg1, undef) -> 0
2238 // For vectors, we can't easily build an all zero vector, just return
2242 if (!MVT::isVector(VT))
2243 return getConstant(MVT::getIntVTBitMask(VT), VT);
2244 // For vectors, we can't easily build an all one vector, just return
2252 // Memoize this node if possible.
2254 SDVTList VTs = getVTList(VT);
2255 if (VT != MVT::Flag) {
2256 SDOperand Ops[] = { N1, N2 };
2257 FoldingSetNodeID ID;
2258 AddNodeIDNode(ID, Opcode, VTs, Ops, 2);
2260 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
2261 return SDOperand(E, 0);
2262 N = new BinarySDNode(Opcode, VTs, N1, N2);
2263 CSEMap.InsertNode(N, IP);
2265 N = new BinarySDNode(Opcode, VTs, N1, N2);
2268 AllNodes.push_back(N);
2269 return SDOperand(N, 0);
2272 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT,
2273 SDOperand N1, SDOperand N2, SDOperand N3) {
2274 // Perform various simplifications.
2275 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1.Val);
2276 ConstantSDNode *N2C = dyn_cast<ConstantSDNode>(N2.Val);
2279 // Use FoldSetCC to simplify SETCC's.
2280 SDOperand Simp = FoldSetCC(VT, N1, N2, cast<CondCodeSDNode>(N3)->get());
2281 if (Simp.Val) return Simp;
2286 if (N1C->getValue())
2287 return N2; // select true, X, Y -> X
2289 return N3; // select false, X, Y -> Y
2292 if (N2 == N3) return N2; // select C, X, X -> X
2296 if (N2C->getValue()) // Unconditional branch
2297 return getNode(ISD::BR, MVT::Other, N1, N3);
2299 return N1; // Never-taken branch
2302 case ISD::VECTOR_SHUFFLE:
2303 assert(VT == N1.getValueType() && VT == N2.getValueType() &&
2304 MVT::isVector(VT) && MVT::isVector(N3.getValueType()) &&
2305 N3.getOpcode() == ISD::BUILD_VECTOR &&
2306 MVT::getVectorNumElements(VT) == N3.getNumOperands() &&
2307 "Illegal VECTOR_SHUFFLE node!");
2309 case ISD::BIT_CONVERT:
2310 // Fold bit_convert nodes from a type to themselves.
2311 if (N1.getValueType() == VT)
2316 // Memoize node if it doesn't produce a flag.
2318 SDVTList VTs = getVTList(VT);
2319 if (VT != MVT::Flag) {
2320 SDOperand Ops[] = { N1, N2, N3 };
2321 FoldingSetNodeID ID;
2322 AddNodeIDNode(ID, Opcode, VTs, Ops, 3);
2324 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
2325 return SDOperand(E, 0);
2326 N = new TernarySDNode(Opcode, VTs, N1, N2, N3);
2327 CSEMap.InsertNode(N, IP);
2329 N = new TernarySDNode(Opcode, VTs, N1, N2, N3);
2331 AllNodes.push_back(N);
2332 return SDOperand(N, 0);
2335 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT,
2336 SDOperand N1, SDOperand N2, SDOperand N3,
2338 SDOperand Ops[] = { N1, N2, N3, N4 };
2339 return getNode(Opcode, VT, Ops, 4);
2342 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT,
2343 SDOperand N1, SDOperand N2, SDOperand N3,
2344 SDOperand N4, SDOperand N5) {
2345 SDOperand Ops[] = { N1, N2, N3, N4, N5 };
2346 return getNode(Opcode, VT, Ops, 5);
2349 SDOperand SelectionDAG::getMemcpy(SDOperand Chain, SDOperand Dest,
2350 SDOperand Src, SDOperand Size,
2352 SDOperand AlwaysInline) {
2353 SDOperand Ops[] = { Chain, Dest, Src, Size, Align, AlwaysInline };
2354 return getNode(ISD::MEMCPY, MVT::Other, Ops, 6);
2357 SDOperand SelectionDAG::getMemmove(SDOperand Chain, SDOperand Dest,
2358 SDOperand Src, SDOperand Size,
2360 SDOperand AlwaysInline) {
2361 SDOperand Ops[] = { Chain, Dest, Src, Size, Align, AlwaysInline };
2362 return getNode(ISD::MEMMOVE, MVT::Other, Ops, 6);
2365 SDOperand SelectionDAG::getMemset(SDOperand Chain, SDOperand Dest,
2366 SDOperand Src, SDOperand Size,
2368 SDOperand AlwaysInline) {
2369 SDOperand Ops[] = { Chain, Dest, Src, Size, Align, AlwaysInline };
2370 return getNode(ISD::MEMSET, MVT::Other, Ops, 6);
2373 SDOperand SelectionDAG::getAtomic(unsigned Opcode, SDOperand Chain,
2374 SDOperand Ptr, SDOperand Cmp,
2375 SDOperand Swp, MVT::ValueType VT) {
2376 assert(Opcode == ISD::ATOMIC_LCS && "Invalid Atomic Op");
2377 assert(Cmp.getValueType() == Swp.getValueType() && "Invalid Atomic Op Types");
2378 SDVTList VTs = getVTList(Cmp.getValueType(), MVT::Other);
2379 FoldingSetNodeID ID;
2380 SDOperand Ops[] = {Chain, Ptr, Cmp, Swp};
2381 AddNodeIDNode(ID, Opcode, VTs, Ops, 4);
2382 ID.AddInteger((unsigned int)VT);
2384 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
2385 return SDOperand(E, 0);
2386 SDNode* N = new AtomicSDNode(Opcode, VTs, Chain, Ptr, Cmp, Swp, VT);
2387 CSEMap.InsertNode(N, IP);
2388 AllNodes.push_back(N);
2389 return SDOperand(N, 0);
2392 SDOperand SelectionDAG::getAtomic(unsigned Opcode, SDOperand Chain,
2393 SDOperand Ptr, SDOperand Val,
2394 MVT::ValueType VT) {
2395 assert((Opcode == ISD::ATOMIC_LAS || Opcode == ISD::ATOMIC_SWAP)
2396 && "Invalid Atomic Op");
2397 SDVTList VTs = getVTList(Val.getValueType(), MVT::Other);
2398 FoldingSetNodeID ID;
2399 SDOperand Ops[] = {Chain, Ptr, Val};
2400 AddNodeIDNode(ID, Opcode, VTs, Ops, 3);
2401 ID.AddInteger((unsigned int)VT);
2403 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
2404 return SDOperand(E, 0);
2405 SDNode* N = new AtomicSDNode(Opcode, VTs, Chain, Ptr, Val, VT);
2406 CSEMap.InsertNode(N, IP);
2407 AllNodes.push_back(N);
2408 return SDOperand(N, 0);
2411 SDOperand SelectionDAG::getLoad(MVT::ValueType VT,
2412 SDOperand Chain, SDOperand Ptr,
2413 const Value *SV, int SVOffset,
2414 bool isVolatile, unsigned Alignment) {
2415 if (Alignment == 0) { // Ensure that codegen never sees alignment 0
2417 if (VT != MVT::iPTR) {
2418 Ty = MVT::getTypeForValueType(VT);
2420 const PointerType *PT = dyn_cast<PointerType>(SV->getType());
2421 assert(PT && "Value for load must be a pointer");
2422 Ty = PT->getElementType();
2424 assert(Ty && "Could not get type information for load");
2425 Alignment = TLI.getTargetData()->getABITypeAlignment(Ty);
2427 SDVTList VTs = getVTList(VT, MVT::Other);
2428 SDOperand Undef = getNode(ISD::UNDEF, Ptr.getValueType());
2429 SDOperand Ops[] = { Chain, Ptr, Undef };
2430 FoldingSetNodeID ID;
2431 AddNodeIDNode(ID, ISD::LOAD, VTs, Ops, 3);
2432 ID.AddInteger(ISD::UNINDEXED);
2433 ID.AddInteger(ISD::NON_EXTLOAD);
2434 ID.AddInteger((unsigned int)VT);
2435 ID.AddInteger(Alignment);
2436 ID.AddInteger(isVolatile);
2438 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
2439 return SDOperand(E, 0);
2440 SDNode *N = new LoadSDNode(Ops, VTs, ISD::UNINDEXED,
2441 ISD::NON_EXTLOAD, VT, SV, SVOffset, Alignment,
2443 CSEMap.InsertNode(N, IP);
2444 AllNodes.push_back(N);
2445 return SDOperand(N, 0);
2448 SDOperand SelectionDAG::getExtLoad(ISD::LoadExtType ExtType, MVT::ValueType VT,
2449 SDOperand Chain, SDOperand Ptr,
2451 int SVOffset, MVT::ValueType EVT,
2452 bool isVolatile, unsigned Alignment) {
2453 // If they are asking for an extending load from/to the same thing, return a
2456 return getLoad(VT, Chain, Ptr, SV, SVOffset, isVolatile, Alignment);
2458 if (MVT::isVector(VT))
2459 assert(EVT == MVT::getVectorElementType(VT) && "Invalid vector extload!");
2461 assert(MVT::getSizeInBits(EVT) < MVT::getSizeInBits(VT) &&
2462 "Should only be an extending load, not truncating!");
2463 assert((ExtType == ISD::EXTLOAD || MVT::isInteger(VT)) &&
2464 "Cannot sign/zero extend a FP/Vector load!");
2465 assert(MVT::isInteger(VT) == MVT::isInteger(EVT) &&
2466 "Cannot convert from FP to Int or Int -> FP!");
2468 if (Alignment == 0) { // Ensure that codegen never sees alignment 0
2470 if (VT != MVT::iPTR) {
2471 Ty = MVT::getTypeForValueType(VT);
2473 const PointerType *PT = dyn_cast<PointerType>(SV->getType());
2474 assert(PT && "Value for load must be a pointer");
2475 Ty = PT->getElementType();
2477 assert(Ty && "Could not get type information for load");
2478 Alignment = TLI.getTargetData()->getABITypeAlignment(Ty);
2480 SDVTList VTs = getVTList(VT, MVT::Other);
2481 SDOperand Undef = getNode(ISD::UNDEF, Ptr.getValueType());
2482 SDOperand Ops[] = { Chain, Ptr, Undef };
2483 FoldingSetNodeID ID;
2484 AddNodeIDNode(ID, ISD::LOAD, VTs, Ops, 3);
2485 ID.AddInteger(ISD::UNINDEXED);
2486 ID.AddInteger(ExtType);
2487 ID.AddInteger((unsigned int)EVT);
2488 ID.AddInteger(Alignment);
2489 ID.AddInteger(isVolatile);
2491 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
2492 return SDOperand(E, 0);
2493 SDNode *N = new LoadSDNode(Ops, VTs, ISD::UNINDEXED, ExtType, EVT,
2494 SV, SVOffset, Alignment, isVolatile);
2495 CSEMap.InsertNode(N, IP);
2496 AllNodes.push_back(N);
2497 return SDOperand(N, 0);
2501 SelectionDAG::getIndexedLoad(SDOperand OrigLoad, SDOperand Base,
2502 SDOperand Offset, ISD::MemIndexedMode AM) {
2503 LoadSDNode *LD = cast<LoadSDNode>(OrigLoad);
2504 assert(LD->getOffset().getOpcode() == ISD::UNDEF &&
2505 "Load is already a indexed load!");
2506 MVT::ValueType VT = OrigLoad.getValueType();
2507 SDVTList VTs = getVTList(VT, Base.getValueType(), MVT::Other);
2508 SDOperand Ops[] = { LD->getChain(), Base, Offset };
2509 FoldingSetNodeID ID;
2510 AddNodeIDNode(ID, ISD::LOAD, VTs, Ops, 3);
2512 ID.AddInteger(LD->getExtensionType());
2513 ID.AddInteger((unsigned int)(LD->getMemoryVT()));
2514 ID.AddInteger(LD->getAlignment());
2515 ID.AddInteger(LD->isVolatile());
2517 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
2518 return SDOperand(E, 0);
2519 SDNode *N = new LoadSDNode(Ops, VTs, AM,
2520 LD->getExtensionType(), LD->getMemoryVT(),
2521 LD->getSrcValue(), LD->getSrcValueOffset(),
2522 LD->getAlignment(), LD->isVolatile());
2523 CSEMap.InsertNode(N, IP);
2524 AllNodes.push_back(N);
2525 return SDOperand(N, 0);
2528 SDOperand SelectionDAG::getStore(SDOperand Chain, SDOperand Val,
2529 SDOperand Ptr, const Value *SV, int SVOffset,
2530 bool isVolatile, unsigned Alignment) {
2531 MVT::ValueType VT = Val.getValueType();
2533 if (Alignment == 0) { // Ensure that codegen never sees alignment 0
2535 if (VT != MVT::iPTR) {
2536 Ty = MVT::getTypeForValueType(VT);
2538 const PointerType *PT = dyn_cast<PointerType>(SV->getType());
2539 assert(PT && "Value for store must be a pointer");
2540 Ty = PT->getElementType();
2542 assert(Ty && "Could not get type information for store");
2543 Alignment = TLI.getTargetData()->getABITypeAlignment(Ty);
2545 SDVTList VTs = getVTList(MVT::Other);
2546 SDOperand Undef = getNode(ISD::UNDEF, Ptr.getValueType());
2547 SDOperand Ops[] = { Chain, Val, Ptr, Undef };
2548 FoldingSetNodeID ID;
2549 AddNodeIDNode(ID, ISD::STORE, VTs, Ops, 4);
2550 ID.AddInteger(ISD::UNINDEXED);
2551 ID.AddInteger(false);
2552 ID.AddInteger((unsigned int)VT);
2553 ID.AddInteger(Alignment);
2554 ID.AddInteger(isVolatile);
2556 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
2557 return SDOperand(E, 0);
2558 SDNode *N = new StoreSDNode(Ops, VTs, ISD::UNINDEXED, false,
2559 VT, SV, SVOffset, Alignment, isVolatile);
2560 CSEMap.InsertNode(N, IP);
2561 AllNodes.push_back(N);
2562 return SDOperand(N, 0);
2565 SDOperand SelectionDAG::getTruncStore(SDOperand Chain, SDOperand Val,
2566 SDOperand Ptr, const Value *SV,
2567 int SVOffset, MVT::ValueType SVT,
2568 bool isVolatile, unsigned Alignment) {
2569 MVT::ValueType VT = Val.getValueType();
2572 return getStore(Chain, Val, Ptr, SV, SVOffset, isVolatile, Alignment);
2574 assert(MVT::getSizeInBits(VT) > MVT::getSizeInBits(SVT) &&
2575 "Not a truncation?");
2576 assert(MVT::isInteger(VT) == MVT::isInteger(SVT) &&
2577 "Can't do FP-INT conversion!");
2579 if (Alignment == 0) { // Ensure that codegen never sees alignment 0
2581 if (VT != MVT::iPTR) {
2582 Ty = MVT::getTypeForValueType(VT);
2584 const PointerType *PT = dyn_cast<PointerType>(SV->getType());
2585 assert(PT && "Value for store must be a pointer");
2586 Ty = PT->getElementType();
2588 assert(Ty && "Could not get type information for store");
2589 Alignment = TLI.getTargetData()->getABITypeAlignment(Ty);
2591 SDVTList VTs = getVTList(MVT::Other);
2592 SDOperand Undef = getNode(ISD::UNDEF, Ptr.getValueType());
2593 SDOperand Ops[] = { Chain, Val, Ptr, Undef };
2594 FoldingSetNodeID ID;
2595 AddNodeIDNode(ID, ISD::STORE, VTs, Ops, 4);
2596 ID.AddInteger(ISD::UNINDEXED);
2598 ID.AddInteger((unsigned int)SVT);
2599 ID.AddInteger(Alignment);
2600 ID.AddInteger(isVolatile);
2602 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
2603 return SDOperand(E, 0);
2604 SDNode *N = new StoreSDNode(Ops, VTs, ISD::UNINDEXED, true,
2605 SVT, SV, SVOffset, Alignment, isVolatile);
2606 CSEMap.InsertNode(N, IP);
2607 AllNodes.push_back(N);
2608 return SDOperand(N, 0);
2612 SelectionDAG::getIndexedStore(SDOperand OrigStore, SDOperand Base,
2613 SDOperand Offset, ISD::MemIndexedMode AM) {
2614 StoreSDNode *ST = cast<StoreSDNode>(OrigStore);
2615 assert(ST->getOffset().getOpcode() == ISD::UNDEF &&
2616 "Store is already a indexed store!");
2617 SDVTList VTs = getVTList(Base.getValueType(), MVT::Other);
2618 SDOperand Ops[] = { ST->getChain(), ST->getValue(), Base, Offset };
2619 FoldingSetNodeID ID;
2620 AddNodeIDNode(ID, ISD::STORE, VTs, Ops, 4);
2622 ID.AddInteger(ST->isTruncatingStore());
2623 ID.AddInteger((unsigned int)(ST->getMemoryVT()));
2624 ID.AddInteger(ST->getAlignment());
2625 ID.AddInteger(ST->isVolatile());
2627 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
2628 return SDOperand(E, 0);
2629 SDNode *N = new StoreSDNode(Ops, VTs, AM,
2630 ST->isTruncatingStore(), ST->getMemoryVT(),
2631 ST->getSrcValue(), ST->getSrcValueOffset(),
2632 ST->getAlignment(), ST->isVolatile());
2633 CSEMap.InsertNode(N, IP);
2634 AllNodes.push_back(N);
2635 return SDOperand(N, 0);
2638 SDOperand SelectionDAG::getVAArg(MVT::ValueType VT,
2639 SDOperand Chain, SDOperand Ptr,
2641 SDOperand Ops[] = { Chain, Ptr, SV };
2642 return getNode(ISD::VAARG, getVTList(VT, MVT::Other), Ops, 3);
2645 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT,
2646 const SDOperand *Ops, unsigned NumOps) {
2648 case 0: return getNode(Opcode, VT);
2649 case 1: return getNode(Opcode, VT, Ops[0]);
2650 case 2: return getNode(Opcode, VT, Ops[0], Ops[1]);
2651 case 3: return getNode(Opcode, VT, Ops[0], Ops[1], Ops[2]);
2657 case ISD::SELECT_CC: {
2658 assert(NumOps == 5 && "SELECT_CC takes 5 operands!");
2659 assert(Ops[0].getValueType() == Ops[1].getValueType() &&
2660 "LHS and RHS of condition must have same type!");
2661 assert(Ops[2].getValueType() == Ops[3].getValueType() &&
2662 "True and False arms of SelectCC must have same type!");
2663 assert(Ops[2].getValueType() == VT &&
2664 "select_cc node must be of same type as true and false value!");
2668 assert(NumOps == 5 && "BR_CC takes 5 operands!");
2669 assert(Ops[2].getValueType() == Ops[3].getValueType() &&
2670 "LHS/RHS of comparison should match types!");
2677 SDVTList VTs = getVTList(VT);
2678 if (VT != MVT::Flag) {
2679 FoldingSetNodeID ID;
2680 AddNodeIDNode(ID, Opcode, VTs, Ops, NumOps);
2682 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
2683 return SDOperand(E, 0);
2684 N = new SDNode(Opcode, VTs, Ops, NumOps);
2685 CSEMap.InsertNode(N, IP);
2687 N = new SDNode(Opcode, VTs, Ops, NumOps);
2689 AllNodes.push_back(N);
2690 return SDOperand(N, 0);
2693 SDOperand SelectionDAG::getNode(unsigned Opcode,
2694 std::vector<MVT::ValueType> &ResultTys,
2695 const SDOperand *Ops, unsigned NumOps) {
2696 return getNode(Opcode, getNodeValueTypes(ResultTys), ResultTys.size(),
2700 SDOperand SelectionDAG::getNode(unsigned Opcode,
2701 const MVT::ValueType *VTs, unsigned NumVTs,
2702 const SDOperand *Ops, unsigned NumOps) {
2704 return getNode(Opcode, VTs[0], Ops, NumOps);
2705 return getNode(Opcode, makeVTList(VTs, NumVTs), Ops, NumOps);
2708 SDOperand SelectionDAG::getNode(unsigned Opcode, SDVTList VTList,
2709 const SDOperand *Ops, unsigned NumOps) {
2710 if (VTList.NumVTs == 1)
2711 return getNode(Opcode, VTList.VTs[0], Ops, NumOps);
2714 // FIXME: figure out how to safely handle things like
2715 // int foo(int x) { return 1 << (x & 255); }
2716 // int bar() { return foo(256); }
2718 case ISD::SRA_PARTS:
2719 case ISD::SRL_PARTS:
2720 case ISD::SHL_PARTS:
2721 if (N3.getOpcode() == ISD::SIGN_EXTEND_INREG &&
2722 cast<VTSDNode>(N3.getOperand(1))->getVT() != MVT::i1)
2723 return getNode(Opcode, VT, N1, N2, N3.getOperand(0));
2724 else if (N3.getOpcode() == ISD::AND)
2725 if (ConstantSDNode *AndRHS = dyn_cast<ConstantSDNode>(N3.getOperand(1))) {
2726 // If the and is only masking out bits that cannot effect the shift,
2727 // eliminate the and.
2728 unsigned NumBits = MVT::getSizeInBits(VT)*2;
2729 if ((AndRHS->getValue() & (NumBits-1)) == NumBits-1)
2730 return getNode(Opcode, VT, N1, N2, N3.getOperand(0));
2736 // Memoize the node unless it returns a flag.
2738 if (VTList.VTs[VTList.NumVTs-1] != MVT::Flag) {
2739 FoldingSetNodeID ID;
2740 AddNodeIDNode(ID, Opcode, VTList, Ops, NumOps);
2742 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
2743 return SDOperand(E, 0);
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);
2752 CSEMap.InsertNode(N, IP);
2755 N = new UnarySDNode(Opcode, VTList, Ops[0]);
2756 else if (NumOps == 2)
2757 N = new BinarySDNode(Opcode, VTList, Ops[0], Ops[1]);
2758 else if (NumOps == 3)
2759 N = new TernarySDNode(Opcode, VTList, Ops[0], Ops[1], Ops[2]);
2761 N = new SDNode(Opcode, VTList, Ops, NumOps);
2763 AllNodes.push_back(N);
2764 return SDOperand(N, 0);
2767 SDOperand SelectionDAG::getNode(unsigned Opcode, SDVTList VTList) {
2768 return getNode(Opcode, VTList, 0, 0);
2771 SDOperand SelectionDAG::getNode(unsigned Opcode, SDVTList VTList,
2773 SDOperand Ops[] = { N1 };
2774 return getNode(Opcode, VTList, Ops, 1);
2777 SDOperand SelectionDAG::getNode(unsigned Opcode, SDVTList VTList,
2778 SDOperand N1, SDOperand N2) {
2779 SDOperand Ops[] = { N1, N2 };
2780 return getNode(Opcode, VTList, Ops, 2);
2783 SDOperand SelectionDAG::getNode(unsigned Opcode, SDVTList VTList,
2784 SDOperand N1, SDOperand N2, SDOperand N3) {
2785 SDOperand Ops[] = { N1, N2, N3 };
2786 return getNode(Opcode, VTList, Ops, 3);
2789 SDOperand SelectionDAG::getNode(unsigned Opcode, SDVTList VTList,
2790 SDOperand N1, SDOperand N2, SDOperand N3,
2792 SDOperand Ops[] = { N1, N2, N3, N4 };
2793 return getNode(Opcode, VTList, Ops, 4);
2796 SDOperand SelectionDAG::getNode(unsigned Opcode, SDVTList VTList,
2797 SDOperand N1, SDOperand N2, SDOperand N3,
2798 SDOperand N4, SDOperand N5) {
2799 SDOperand Ops[] = { N1, N2, N3, N4, N5 };
2800 return getNode(Opcode, VTList, Ops, 5);
2803 SDVTList SelectionDAG::getVTList(MVT::ValueType VT) {
2804 return makeVTList(SDNode::getValueTypeList(VT), 1);
2807 SDVTList SelectionDAG::getVTList(MVT::ValueType VT1, MVT::ValueType VT2) {
2808 for (std::list<std::vector<MVT::ValueType> >::iterator I = VTList.begin(),
2809 E = VTList.end(); I != E; ++I) {
2810 if (I->size() == 2 && (*I)[0] == VT1 && (*I)[1] == VT2)
2811 return makeVTList(&(*I)[0], 2);
2813 std::vector<MVT::ValueType> V;
2816 VTList.push_front(V);
2817 return makeVTList(&(*VTList.begin())[0], 2);
2819 SDVTList SelectionDAG::getVTList(MVT::ValueType VT1, MVT::ValueType VT2,
2820 MVT::ValueType VT3) {
2821 for (std::list<std::vector<MVT::ValueType> >::iterator I = VTList.begin(),
2822 E = VTList.end(); I != E; ++I) {
2823 if (I->size() == 3 && (*I)[0] == VT1 && (*I)[1] == VT2 &&
2825 return makeVTList(&(*I)[0], 3);
2827 std::vector<MVT::ValueType> V;
2831 VTList.push_front(V);
2832 return makeVTList(&(*VTList.begin())[0], 3);
2835 SDVTList SelectionDAG::getVTList(const MVT::ValueType *VTs, unsigned NumVTs) {
2837 case 0: assert(0 && "Cannot have nodes without results!");
2838 case 1: return getVTList(VTs[0]);
2839 case 2: return getVTList(VTs[0], VTs[1]);
2840 case 3: return getVTList(VTs[0], VTs[1], VTs[2]);
2844 for (std::list<std::vector<MVT::ValueType> >::iterator I = VTList.begin(),
2845 E = VTList.end(); I != E; ++I) {
2846 if (I->size() != NumVTs || VTs[0] != (*I)[0] || VTs[1] != (*I)[1]) continue;
2848 bool NoMatch = false;
2849 for (unsigned i = 2; i != NumVTs; ++i)
2850 if (VTs[i] != (*I)[i]) {
2855 return makeVTList(&*I->begin(), NumVTs);
2858 VTList.push_front(std::vector<MVT::ValueType>(VTs, VTs+NumVTs));
2859 return makeVTList(&*VTList.begin()->begin(), NumVTs);
2863 /// UpdateNodeOperands - *Mutate* the specified node in-place to have the
2864 /// specified operands. If the resultant node already exists in the DAG,
2865 /// this does not modify the specified node, instead it returns the node that
2866 /// already exists. If the resultant node does not exist in the DAG, the
2867 /// input node is returned. As a degenerate case, if you specify the same
2868 /// input operands as the node already has, the input node is returned.
2869 SDOperand SelectionDAG::
2870 UpdateNodeOperands(SDOperand InN, SDOperand Op) {
2871 SDNode *N = InN.Val;
2872 assert(N->getNumOperands() == 1 && "Update with wrong number of operands");
2874 // Check to see if there is no change.
2875 if (Op == N->getOperand(0)) return InN;
2877 // See if the modified node already exists.
2878 void *InsertPos = 0;
2879 if (SDNode *Existing = FindModifiedNodeSlot(N, Op, InsertPos))
2880 return SDOperand(Existing, InN.ResNo);
2882 // Nope it doesn't. Remove the node from it's current place in the maps.
2884 RemoveNodeFromCSEMaps(N);
2886 // Now we update the operands.
2887 N->OperandList[0].Val->removeUser(N);
2889 N->OperandList[0] = Op;
2891 // If this gets put into a CSE map, add it.
2892 if (InsertPos) CSEMap.InsertNode(N, InsertPos);
2896 SDOperand SelectionDAG::
2897 UpdateNodeOperands(SDOperand InN, SDOperand Op1, SDOperand Op2) {
2898 SDNode *N = InN.Val;
2899 assert(N->getNumOperands() == 2 && "Update with wrong number of operands");
2901 // Check to see if there is no change.
2902 if (Op1 == N->getOperand(0) && Op2 == N->getOperand(1))
2903 return InN; // No operands changed, just return the input node.
2905 // See if the modified node already exists.
2906 void *InsertPos = 0;
2907 if (SDNode *Existing = FindModifiedNodeSlot(N, Op1, Op2, InsertPos))
2908 return SDOperand(Existing, InN.ResNo);
2910 // Nope it doesn't. Remove the node from it's current place in the maps.
2912 RemoveNodeFromCSEMaps(N);
2914 // Now we update the operands.
2915 if (N->OperandList[0] != Op1) {
2916 N->OperandList[0].Val->removeUser(N);
2917 Op1.Val->addUser(N);
2918 N->OperandList[0] = Op1;
2920 if (N->OperandList[1] != Op2) {
2921 N->OperandList[1].Val->removeUser(N);
2922 Op2.Val->addUser(N);
2923 N->OperandList[1] = Op2;
2926 // If this gets put into a CSE map, add it.
2927 if (InsertPos) CSEMap.InsertNode(N, InsertPos);
2931 SDOperand SelectionDAG::
2932 UpdateNodeOperands(SDOperand N, SDOperand Op1, SDOperand Op2, SDOperand Op3) {
2933 SDOperand Ops[] = { Op1, Op2, Op3 };
2934 return UpdateNodeOperands(N, Ops, 3);
2937 SDOperand SelectionDAG::
2938 UpdateNodeOperands(SDOperand N, SDOperand Op1, SDOperand Op2,
2939 SDOperand Op3, SDOperand Op4) {
2940 SDOperand Ops[] = { Op1, Op2, Op3, Op4 };
2941 return UpdateNodeOperands(N, Ops, 4);
2944 SDOperand SelectionDAG::
2945 UpdateNodeOperands(SDOperand N, SDOperand Op1, SDOperand Op2,
2946 SDOperand Op3, SDOperand Op4, SDOperand Op5) {
2947 SDOperand Ops[] = { Op1, Op2, Op3, Op4, Op5 };
2948 return UpdateNodeOperands(N, Ops, 5);
2952 SDOperand SelectionDAG::
2953 UpdateNodeOperands(SDOperand InN, SDOperand *Ops, unsigned NumOps) {
2954 SDNode *N = InN.Val;
2955 assert(N->getNumOperands() == NumOps &&
2956 "Update with wrong number of operands");
2958 // Check to see if there is no change.
2959 bool AnyChange = false;
2960 for (unsigned i = 0; i != NumOps; ++i) {
2961 if (Ops[i] != N->getOperand(i)) {
2967 // No operands changed, just return the input node.
2968 if (!AnyChange) return InN;
2970 // See if the modified node already exists.
2971 void *InsertPos = 0;
2972 if (SDNode *Existing = FindModifiedNodeSlot(N, Ops, NumOps, InsertPos))
2973 return SDOperand(Existing, InN.ResNo);
2975 // Nope it doesn't. Remove the node from it's current place in the maps.
2977 RemoveNodeFromCSEMaps(N);
2979 // Now we update the operands.
2980 for (unsigned i = 0; i != NumOps; ++i) {
2981 if (N->OperandList[i] != Ops[i]) {
2982 N->OperandList[i].Val->removeUser(N);
2983 Ops[i].Val->addUser(N);
2984 N->OperandList[i] = Ops[i];
2988 // If this gets put into a CSE map, add it.
2989 if (InsertPos) CSEMap.InsertNode(N, InsertPos);
2994 /// MorphNodeTo - This frees the operands of the current node, resets the
2995 /// opcode, types, and operands to the specified value. This should only be
2996 /// used by the SelectionDAG class.
2997 void SDNode::MorphNodeTo(unsigned Opc, SDVTList L,
2998 const SDOperand *Ops, unsigned NumOps) {
3001 NumValues = L.NumVTs;
3003 // Clear the operands list, updating used nodes to remove this from their
3005 for (op_iterator I = op_begin(), E = op_end(); I != E; ++I)
3006 I->Val->removeUser(this);
3008 // If NumOps is larger than the # of operands we currently have, reallocate
3009 // the operand list.
3010 if (NumOps > NumOperands) {
3011 if (OperandsNeedDelete)
3012 delete [] OperandList;
3013 OperandList = new SDOperand[NumOps];
3014 OperandsNeedDelete = true;
3017 // Assign the new operands.
3018 NumOperands = NumOps;
3020 for (unsigned i = 0, e = NumOps; i != e; ++i) {
3021 OperandList[i] = Ops[i];
3022 SDNode *N = OperandList[i].Val;
3023 N->Uses.push_back(this);
3027 /// SelectNodeTo - These are used for target selectors to *mutate* the
3028 /// specified node to have the specified return type, Target opcode, and
3029 /// operands. Note that target opcodes are stored as
3030 /// ISD::BUILTIN_OP_END+TargetOpcode in the node opcode field.
3032 /// Note that SelectNodeTo returns the resultant node. If there is already a
3033 /// node of the specified opcode and operands, it returns that node instead of
3034 /// the current one.
3035 SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
3036 MVT::ValueType VT) {
3037 SDVTList VTs = getVTList(VT);
3038 FoldingSetNodeID ID;
3039 AddNodeIDNode(ID, ISD::BUILTIN_OP_END+TargetOpc, VTs, 0, 0);
3041 if (SDNode *ON = CSEMap.FindNodeOrInsertPos(ID, IP))
3044 RemoveNodeFromCSEMaps(N);
3046 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc, VTs, 0, 0);
3048 CSEMap.InsertNode(N, IP);
3052 SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
3053 MVT::ValueType VT, SDOperand Op1) {
3054 // If an identical node already exists, use it.
3055 SDVTList VTs = getVTList(VT);
3056 SDOperand Ops[] = { Op1 };
3058 FoldingSetNodeID ID;
3059 AddNodeIDNode(ID, ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 1);
3061 if (SDNode *ON = CSEMap.FindNodeOrInsertPos(ID, IP))
3064 RemoveNodeFromCSEMaps(N);
3065 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 1);
3066 CSEMap.InsertNode(N, IP);
3070 SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
3071 MVT::ValueType VT, SDOperand Op1,
3073 // If an identical node already exists, use it.
3074 SDVTList VTs = getVTList(VT);
3075 SDOperand Ops[] = { Op1, Op2 };
3077 FoldingSetNodeID ID;
3078 AddNodeIDNode(ID, ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 2);
3080 if (SDNode *ON = CSEMap.FindNodeOrInsertPos(ID, IP))
3083 RemoveNodeFromCSEMaps(N);
3085 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 2);
3087 CSEMap.InsertNode(N, IP); // Memoize the new node.
3091 SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
3092 MVT::ValueType VT, SDOperand Op1,
3093 SDOperand Op2, SDOperand Op3) {
3094 // If an identical node already exists, use it.
3095 SDVTList VTs = getVTList(VT);
3096 SDOperand Ops[] = { Op1, Op2, Op3 };
3097 FoldingSetNodeID ID;
3098 AddNodeIDNode(ID, ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 3);
3100 if (SDNode *ON = CSEMap.FindNodeOrInsertPos(ID, IP))
3103 RemoveNodeFromCSEMaps(N);
3105 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 3);
3107 CSEMap.InsertNode(N, IP); // Memoize the new node.
3111 SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
3112 MVT::ValueType VT, const SDOperand *Ops,
3114 // If an identical node already exists, use it.
3115 SDVTList VTs = getVTList(VT);
3116 FoldingSetNodeID ID;
3117 AddNodeIDNode(ID, ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, NumOps);
3119 if (SDNode *ON = CSEMap.FindNodeOrInsertPos(ID, IP))
3122 RemoveNodeFromCSEMaps(N);
3123 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, NumOps);
3125 CSEMap.InsertNode(N, IP); // Memoize the new node.
3129 SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
3130 MVT::ValueType VT1, MVT::ValueType VT2,
3131 SDOperand Op1, SDOperand Op2) {
3132 SDVTList VTs = getVTList(VT1, VT2);
3133 FoldingSetNodeID ID;
3134 SDOperand Ops[] = { Op1, Op2 };
3135 AddNodeIDNode(ID, ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 2);
3137 if (SDNode *ON = CSEMap.FindNodeOrInsertPos(ID, IP))
3140 RemoveNodeFromCSEMaps(N);
3141 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 2);
3142 CSEMap.InsertNode(N, IP); // Memoize the new node.
3146 SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
3147 MVT::ValueType VT1, MVT::ValueType VT2,
3148 SDOperand Op1, SDOperand Op2,
3150 // If an identical node already exists, use it.
3151 SDVTList VTs = getVTList(VT1, VT2);
3152 SDOperand Ops[] = { Op1, Op2, Op3 };
3153 FoldingSetNodeID ID;
3154 AddNodeIDNode(ID, ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 3);
3156 if (SDNode *ON = CSEMap.FindNodeOrInsertPos(ID, IP))
3159 RemoveNodeFromCSEMaps(N);
3161 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 3);
3162 CSEMap.InsertNode(N, IP); // Memoize the new node.
3167 /// getTargetNode - These are used for target selectors to create a new node
3168 /// with specified return type(s), target opcode, and operands.
3170 /// Note that getTargetNode returns the resultant node. If there is already a
3171 /// node of the specified opcode and operands, it returns that node instead of
3172 /// the current one.
3173 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT) {
3174 return getNode(ISD::BUILTIN_OP_END+Opcode, VT).Val;
3176 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT,
3178 return getNode(ISD::BUILTIN_OP_END+Opcode, VT, Op1).Val;
3180 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT,
3181 SDOperand Op1, SDOperand Op2) {
3182 return getNode(ISD::BUILTIN_OP_END+Opcode, VT, Op1, Op2).Val;
3184 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT,
3185 SDOperand Op1, SDOperand Op2,
3187 return getNode(ISD::BUILTIN_OP_END+Opcode, VT, Op1, Op2, Op3).Val;
3189 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT,
3190 const SDOperand *Ops, unsigned NumOps) {
3191 return getNode(ISD::BUILTIN_OP_END+Opcode, VT, Ops, NumOps).Val;
3193 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
3194 MVT::ValueType VT2) {
3195 const MVT::ValueType *VTs = getNodeValueTypes(VT1, VT2);
3197 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 2, &Op, 0).Val;
3199 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
3200 MVT::ValueType VT2, SDOperand Op1) {
3201 const MVT::ValueType *VTs = getNodeValueTypes(VT1, VT2);
3202 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 2, &Op1, 1).Val;
3204 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
3205 MVT::ValueType VT2, SDOperand Op1,
3207 const MVT::ValueType *VTs = getNodeValueTypes(VT1, VT2);
3208 SDOperand Ops[] = { Op1, Op2 };
3209 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 2, Ops, 2).Val;
3211 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
3212 MVT::ValueType VT2, SDOperand Op1,
3213 SDOperand Op2, SDOperand Op3) {
3214 const MVT::ValueType *VTs = getNodeValueTypes(VT1, VT2);
3215 SDOperand Ops[] = { Op1, Op2, Op3 };
3216 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 2, Ops, 3).Val;
3218 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
3220 const SDOperand *Ops, unsigned NumOps) {
3221 const MVT::ValueType *VTs = getNodeValueTypes(VT1, VT2);
3222 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 2, Ops, NumOps).Val;
3224 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
3225 MVT::ValueType VT2, MVT::ValueType VT3,
3226 SDOperand Op1, SDOperand Op2) {
3227 const MVT::ValueType *VTs = getNodeValueTypes(VT1, VT2, VT3);
3228 SDOperand Ops[] = { Op1, Op2 };
3229 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 3, Ops, 2).Val;
3231 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
3232 MVT::ValueType VT2, MVT::ValueType VT3,
3233 SDOperand Op1, SDOperand Op2,
3235 const MVT::ValueType *VTs = getNodeValueTypes(VT1, VT2, VT3);
3236 SDOperand Ops[] = { Op1, Op2, Op3 };
3237 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 3, Ops, 3).Val;
3239 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
3240 MVT::ValueType VT2, MVT::ValueType VT3,
3241 const SDOperand *Ops, unsigned NumOps) {
3242 const MVT::ValueType *VTs = getNodeValueTypes(VT1, VT2, VT3);
3243 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 3, Ops, NumOps).Val;
3245 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
3246 MVT::ValueType VT2, MVT::ValueType VT3,
3248 const SDOperand *Ops, unsigned NumOps) {
3249 std::vector<MVT::ValueType> VTList;
3250 VTList.push_back(VT1);
3251 VTList.push_back(VT2);
3252 VTList.push_back(VT3);
3253 VTList.push_back(VT4);
3254 const MVT::ValueType *VTs = getNodeValueTypes(VTList);
3255 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 4, Ops, NumOps).Val;
3257 SDNode *SelectionDAG::getTargetNode(unsigned Opcode,
3258 std::vector<MVT::ValueType> &ResultTys,
3259 const SDOperand *Ops, unsigned NumOps) {
3260 const MVT::ValueType *VTs = getNodeValueTypes(ResultTys);
3261 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, ResultTys.size(),
3266 /// ReplaceAllUsesWith - Modify anything using 'From' to use 'To' instead.
3267 /// This can cause recursive merging of nodes in the DAG.
3269 /// This version assumes From has a single result value.
3271 void SelectionDAG::ReplaceAllUsesWith(SDOperand FromN, SDOperand To,
3272 DAGUpdateListener *UpdateListener) {
3273 SDNode *From = FromN.Val;
3274 assert(From->getNumValues() == 1 && FromN.ResNo == 0 &&
3275 "Cannot replace with this method!");
3276 assert(From != To.Val && "Cannot replace uses of with self");
3278 while (!From->use_empty()) {
3279 // Process users until they are all gone.
3280 SDNode *U = *From->use_begin();
3282 // This node is about to morph, remove its old self from the CSE maps.
3283 RemoveNodeFromCSEMaps(U);
3285 for (SDOperand *I = U->OperandList, *E = U->OperandList+U->NumOperands;
3287 if (I->Val == From) {
3288 From->removeUser(U);
3293 // Now that we have modified U, add it back to the CSE maps. If it already
3294 // exists there, recursively merge the results together.
3295 if (SDNode *Existing = AddNonLeafNodeToCSEMaps(U)) {
3296 ReplaceAllUsesWith(U, Existing, UpdateListener);
3297 // U is now dead. Inform the listener if it exists and delete it.
3299 UpdateListener->NodeDeleted(U);
3300 DeleteNodeNotInCSEMaps(U);
3302 // If the node doesn't already exist, we updated it. Inform a listener if
3305 UpdateListener->NodeUpdated(U);
3310 /// ReplaceAllUsesWith - Modify anything using 'From' to use 'To' instead.
3311 /// This can cause recursive merging of nodes in the DAG.
3313 /// This version assumes From/To have matching types and numbers of result
3316 void SelectionDAG::ReplaceAllUsesWith(SDNode *From, SDNode *To,
3317 DAGUpdateListener *UpdateListener) {
3318 assert(From != To && "Cannot replace uses of with self");
3319 assert(From->getNumValues() == To->getNumValues() &&
3320 "Cannot use this version of ReplaceAllUsesWith!");
3321 if (From->getNumValues() == 1) // If possible, use the faster version.
3322 return ReplaceAllUsesWith(SDOperand(From, 0), SDOperand(To, 0),
3325 while (!From->use_empty()) {
3326 // Process users until they are all gone.
3327 SDNode *U = *From->use_begin();
3329 // This node is about to morph, remove its old self from the CSE maps.
3330 RemoveNodeFromCSEMaps(U);
3332 for (SDOperand *I = U->OperandList, *E = U->OperandList+U->NumOperands;
3334 if (I->Val == From) {
3335 From->removeUser(U);
3340 // Now that we have modified U, add it back to the CSE maps. If it already
3341 // exists there, recursively merge the results together.
3342 if (SDNode *Existing = AddNonLeafNodeToCSEMaps(U)) {
3343 ReplaceAllUsesWith(U, Existing, UpdateListener);
3344 // U is now dead. Inform the listener if it exists and delete it.
3346 UpdateListener->NodeDeleted(U);
3347 DeleteNodeNotInCSEMaps(U);
3349 // If the node doesn't already exist, we updated it. Inform a listener if
3352 UpdateListener->NodeUpdated(U);
3357 /// ReplaceAllUsesWith - Modify anything using 'From' to use 'To' instead.
3358 /// This can cause recursive merging of nodes in the DAG.
3360 /// This version can replace From with any result values. To must match the
3361 /// number and types of values returned by From.
3362 void SelectionDAG::ReplaceAllUsesWith(SDNode *From,
3363 const SDOperand *To,
3364 DAGUpdateListener *UpdateListener) {
3365 if (From->getNumValues() == 1) // Handle the simple case efficiently.
3366 return ReplaceAllUsesWith(SDOperand(From, 0), To[0], UpdateListener);
3368 while (!From->use_empty()) {
3369 // Process users until they are all gone.
3370 SDNode *U = *From->use_begin();
3372 // This node is about to morph, remove its old self from the CSE maps.
3373 RemoveNodeFromCSEMaps(U);
3375 for (SDOperand *I = U->OperandList, *E = U->OperandList+U->NumOperands;
3377 if (I->Val == From) {
3378 const SDOperand &ToOp = To[I->ResNo];
3379 From->removeUser(U);
3381 ToOp.Val->addUser(U);
3384 // Now that we have modified U, add it back to the CSE maps. If it already
3385 // exists there, recursively merge the results together.
3386 if (SDNode *Existing = AddNonLeafNodeToCSEMaps(U)) {
3387 ReplaceAllUsesWith(U, Existing, UpdateListener);
3388 // U is now dead. Inform the listener if it exists and delete it.
3390 UpdateListener->NodeDeleted(U);
3391 DeleteNodeNotInCSEMaps(U);
3393 // If the node doesn't already exist, we updated it. Inform a listener if
3396 UpdateListener->NodeUpdated(U);
3402 /// ChainedSetUpdaterListener - This class is a DAGUpdateListener that removes
3403 /// any deleted nodes from the set passed into its constructor and recursively
3404 /// notifies another update listener if specified.
3405 class ChainedSetUpdaterListener :
3406 public SelectionDAG::DAGUpdateListener {
3407 SmallSetVector<SDNode*, 16> &Set;
3408 SelectionDAG::DAGUpdateListener *Chain;
3410 ChainedSetUpdaterListener(SmallSetVector<SDNode*, 16> &set,
3411 SelectionDAG::DAGUpdateListener *chain)
3412 : Set(set), Chain(chain) {}
3414 virtual void NodeDeleted(SDNode *N) {
3416 if (Chain) Chain->NodeDeleted(N);
3418 virtual void NodeUpdated(SDNode *N) {
3419 if (Chain) Chain->NodeUpdated(N);
3424 /// ReplaceAllUsesOfValueWith - Replace any uses of From with To, leaving
3425 /// uses of other values produced by From.Val alone. The Deleted vector is
3426 /// handled the same way as for ReplaceAllUsesWith.
3427 void SelectionDAG::ReplaceAllUsesOfValueWith(SDOperand From, SDOperand To,
3428 DAGUpdateListener *UpdateListener){
3429 assert(From != To && "Cannot replace a value with itself");
3431 // Handle the simple, trivial, case efficiently.
3432 if (From.Val->getNumValues() == 1) {
3433 ReplaceAllUsesWith(From, To, UpdateListener);
3437 if (From.use_empty()) return;
3439 // Get all of the users of From.Val. We want these in a nice,
3440 // deterministically ordered and uniqued set, so we use a SmallSetVector.
3441 SmallSetVector<SDNode*, 16> Users(From.Val->use_begin(), From.Val->use_end());
3443 // When one of the recursive merges deletes nodes from the graph, we need to
3444 // make sure that UpdateListener is notified *and* that the node is removed
3445 // from Users if present. CSUL does this.
3446 ChainedSetUpdaterListener CSUL(Users, UpdateListener);
3448 while (!Users.empty()) {
3449 // We know that this user uses some value of From. If it is the right
3450 // value, update it.
3451 SDNode *User = Users.back();
3454 // Scan for an operand that matches From.
3455 SDOperand *Op = User->OperandList, *E = User->OperandList+User->NumOperands;
3456 for (; Op != E; ++Op)
3457 if (*Op == From) break;
3459 // If there are no matches, the user must use some other result of From.
3460 if (Op == E) continue;
3462 // Okay, we know this user needs to be updated. Remove its old self
3463 // from the CSE maps.
3464 RemoveNodeFromCSEMaps(User);
3466 // Update all operands that match "From" in case there are multiple uses.
3467 for (; Op != E; ++Op) {
3469 From.Val->removeUser(User);
3471 To.Val->addUser(User);
3475 // Now that we have modified User, add it back to the CSE maps. If it
3476 // already exists there, recursively merge the results together.
3477 SDNode *Existing = AddNonLeafNodeToCSEMaps(User);
3479 if (UpdateListener) UpdateListener->NodeUpdated(User);
3480 continue; // Continue on to next user.
3483 // If there was already an existing matching node, use ReplaceAllUsesWith
3484 // to replace the dead one with the existing one. This can cause
3485 // recursive merging of other unrelated nodes down the line. The merging
3486 // can cause deletion of nodes that used the old value. To handle this, we
3487 // use CSUL to remove them from the Users set.
3488 ReplaceAllUsesWith(User, Existing, &CSUL);
3490 // User is now dead. Notify a listener if present.
3491 if (UpdateListener) UpdateListener->NodeDeleted(User);
3492 DeleteNodeNotInCSEMaps(User);
3497 /// AssignNodeIds - Assign a unique node id for each node in the DAG based on
3498 /// their allnodes order. It returns the maximum id.
3499 unsigned SelectionDAG::AssignNodeIds() {
3501 for (allnodes_iterator I = allnodes_begin(), E = allnodes_end(); I != E; ++I){
3508 /// AssignTopologicalOrder - Assign a unique node id for each node in the DAG
3509 /// based on their topological order. It returns the maximum id and a vector
3510 /// of the SDNodes* in assigned order by reference.
3511 unsigned SelectionDAG::AssignTopologicalOrder(std::vector<SDNode*> &TopOrder) {
3512 unsigned DAGSize = AllNodes.size();
3513 std::vector<unsigned> InDegree(DAGSize);
3514 std::vector<SDNode*> Sources;
3516 // Use a two pass approach to avoid using a std::map which is slow.
3518 for (allnodes_iterator I = allnodes_begin(),E = allnodes_end(); I != E; ++I){
3521 unsigned Degree = N->use_size();
3522 InDegree[N->getNodeId()] = Degree;
3524 Sources.push_back(N);
3528 while (!Sources.empty()) {
3529 SDNode *N = Sources.back();
3531 TopOrder.push_back(N);
3532 for (SDNode::op_iterator I = N->op_begin(), E = N->op_end(); I != E; ++I) {
3534 unsigned Degree = --InDegree[P->getNodeId()];
3536 Sources.push_back(P);
3540 // Second pass, assign the actual topological order as node ids.
3542 for (std::vector<SDNode*>::iterator TI = TopOrder.begin(),TE = TopOrder.end();
3544 (*TI)->setNodeId(Id++);
3551 //===----------------------------------------------------------------------===//
3553 //===----------------------------------------------------------------------===//
3555 // Out-of-line virtual method to give class a home.
3556 void SDNode::ANCHOR() {}
3557 void UnarySDNode::ANCHOR() {}
3558 void BinarySDNode::ANCHOR() {}
3559 void TernarySDNode::ANCHOR() {}
3560 void HandleSDNode::ANCHOR() {}
3561 void StringSDNode::ANCHOR() {}
3562 void ConstantSDNode::ANCHOR() {}
3563 void ConstantFPSDNode::ANCHOR() {}
3564 void GlobalAddressSDNode::ANCHOR() {}
3565 void FrameIndexSDNode::ANCHOR() {}
3566 void JumpTableSDNode::ANCHOR() {}
3567 void ConstantPoolSDNode::ANCHOR() {}
3568 void BasicBlockSDNode::ANCHOR() {}
3569 void SrcValueSDNode::ANCHOR() {}
3570 void MemOperandSDNode::ANCHOR() {}
3571 void RegisterSDNode::ANCHOR() {}
3572 void ExternalSymbolSDNode::ANCHOR() {}
3573 void CondCodeSDNode::ANCHOR() {}
3574 void VTSDNode::ANCHOR() {}
3575 void LoadSDNode::ANCHOR() {}
3576 void StoreSDNode::ANCHOR() {}
3577 void AtomicSDNode::ANCHOR() {}
3579 HandleSDNode::~HandleSDNode() {
3580 SDVTList VTs = { 0, 0 };
3581 MorphNodeTo(ISD::HANDLENODE, VTs, 0, 0); // Drops operand uses.
3584 GlobalAddressSDNode::GlobalAddressSDNode(bool isTarget, const GlobalValue *GA,
3585 MVT::ValueType VT, int o)
3586 : SDNode(isa<GlobalVariable>(GA) &&
3587 cast<GlobalVariable>(GA)->isThreadLocal() ?
3589 (isTarget ? ISD::TargetGlobalTLSAddress : ISD::GlobalTLSAddress) :
3591 (isTarget ? ISD::TargetGlobalAddress : ISD::GlobalAddress),
3592 getSDVTList(VT)), Offset(o) {
3593 TheGlobal = const_cast<GlobalValue*>(GA);
3596 /// getMemOperand - Return a MemOperand object describing the memory
3597 /// reference performed by this load or store.
3598 MemOperand LSBaseSDNode::getMemOperand() const {
3599 int Size = (MVT::getSizeInBits(getMemoryVT()) + 7) >> 3;
3601 getOpcode() == ISD::LOAD ? MemOperand::MOLoad : MemOperand::MOStore;
3602 if (IsVolatile) Flags |= MemOperand::MOVolatile;
3604 // Check if the load references a frame index, and does not have
3606 const FrameIndexSDNode *FI =
3607 dyn_cast<const FrameIndexSDNode>(getBasePtr().Val);
3608 if (!getSrcValue() && FI)
3609 return MemOperand(PseudoSourceValue::getFixedStack(), Flags,
3610 FI->getIndex(), Size, Alignment);
3612 return MemOperand(getSrcValue(), Flags,
3613 getSrcValueOffset(), Size, Alignment);
3616 /// Profile - Gather unique data for the node.
3618 void SDNode::Profile(FoldingSetNodeID &ID) {
3619 AddNodeIDNode(ID, this);
3622 /// getValueTypeList - Return a pointer to the specified value type.
3624 const MVT::ValueType *SDNode::getValueTypeList(MVT::ValueType VT) {
3625 if (MVT::isExtendedVT(VT)) {
3626 static std::set<MVT::ValueType> EVTs;
3627 return &(*EVTs.insert(VT).first);
3629 static MVT::ValueType VTs[MVT::LAST_VALUETYPE];
3635 /// hasNUsesOfValue - Return true if there are exactly NUSES uses of the
3636 /// indicated value. This method ignores uses of other values defined by this
3638 bool SDNode::hasNUsesOfValue(unsigned NUses, unsigned Value) const {
3639 assert(Value < getNumValues() && "Bad value!");
3641 // If there is only one value, this is easy.
3642 if (getNumValues() == 1)
3643 return use_size() == NUses;
3644 if (use_size() < NUses) return false;
3646 SDOperand TheValue(const_cast<SDNode *>(this), Value);
3648 SmallPtrSet<SDNode*, 32> UsersHandled;
3650 for (SDNode::use_iterator UI = Uses.begin(), E = Uses.end(); UI != E; ++UI) {
3652 if (User->getNumOperands() == 1 ||
3653 UsersHandled.insert(User)) // First time we've seen this?
3654 for (unsigned i = 0, e = User->getNumOperands(); i != e; ++i)
3655 if (User->getOperand(i) == TheValue) {
3657 return false; // too many uses
3662 // Found exactly the right number of uses?
3667 /// hasAnyUseOfValue - Return true if there are any use of the indicated
3668 /// value. This method ignores uses of other values defined by this operation.
3669 bool SDNode::hasAnyUseOfValue(unsigned Value) const {
3670 assert(Value < getNumValues() && "Bad value!");
3672 if (use_empty()) return false;
3674 SDOperand TheValue(const_cast<SDNode *>(this), Value);
3676 SmallPtrSet<SDNode*, 32> UsersHandled;
3678 for (SDNode::use_iterator UI = Uses.begin(), E = Uses.end(); UI != E; ++UI) {
3680 if (User->getNumOperands() == 1 ||
3681 UsersHandled.insert(User)) // First time we've seen this?
3682 for (unsigned i = 0, e = User->getNumOperands(); i != e; ++i)
3683 if (User->getOperand(i) == TheValue) {
3692 /// isOnlyUseOf - Return true if this node is the only use of N.
3694 bool SDNode::isOnlyUseOf(SDNode *N) const {
3696 for (SDNode::use_iterator I = N->use_begin(), E = N->use_end(); I != E; ++I) {
3707 /// isOperand - Return true if this node is an operand of N.
3709 bool SDOperand::isOperandOf(SDNode *N) const {
3710 for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i)
3711 if (*this == N->getOperand(i))
3716 bool SDNode::isOperandOf(SDNode *N) const {
3717 for (unsigned i = 0, e = N->NumOperands; i != e; ++i)
3718 if (this == N->OperandList[i].Val)
3723 /// reachesChainWithoutSideEffects - Return true if this operand (which must
3724 /// be a chain) reaches the specified operand without crossing any
3725 /// side-effecting instructions. In practice, this looks through token
3726 /// factors and non-volatile loads. In order to remain efficient, this only
3727 /// looks a couple of nodes in, it does not do an exhaustive search.
3728 bool SDOperand::reachesChainWithoutSideEffects(SDOperand Dest,
3729 unsigned Depth) const {
3730 if (*this == Dest) return true;
3732 // Don't search too deeply, we just want to be able to see through
3733 // TokenFactor's etc.
3734 if (Depth == 0) return false;
3736 // If this is a token factor, all inputs to the TF happen in parallel. If any
3737 // of the operands of the TF reach dest, then we can do the xform.
3738 if (getOpcode() == ISD::TokenFactor) {
3739 for (unsigned i = 0, e = getNumOperands(); i != e; ++i)
3740 if (getOperand(i).reachesChainWithoutSideEffects(Dest, Depth-1))
3745 // Loads don't have side effects, look through them.
3746 if (LoadSDNode *Ld = dyn_cast<LoadSDNode>(*this)) {
3747 if (!Ld->isVolatile())
3748 return Ld->getChain().reachesChainWithoutSideEffects(Dest, Depth-1);
3754 static void findPredecessor(SDNode *N, const SDNode *P, bool &found,
3755 SmallPtrSet<SDNode *, 32> &Visited) {
3756 if (found || !Visited.insert(N))
3759 for (unsigned i = 0, e = N->getNumOperands(); !found && i != e; ++i) {
3760 SDNode *Op = N->getOperand(i).Val;
3765 findPredecessor(Op, P, found, Visited);
3769 /// isPredecessorOf - Return true if this node is a predecessor of N. This node
3770 /// is either an operand of N or it can be reached by recursively traversing
3771 /// up the operands.
3772 /// NOTE: this is an expensive method. Use it carefully.
3773 bool SDNode::isPredecessorOf(SDNode *N) const {
3774 SmallPtrSet<SDNode *, 32> Visited;
3776 findPredecessor(N, this, found, Visited);
3780 uint64_t SDNode::getConstantOperandVal(unsigned Num) const {
3781 assert(Num < NumOperands && "Invalid child # of SDNode!");
3782 return cast<ConstantSDNode>(OperandList[Num])->getValue();
3785 std::string SDNode::getOperationName(const SelectionDAG *G) const {
3786 switch (getOpcode()) {
3788 if (getOpcode() < ISD::BUILTIN_OP_END)
3789 return "<<Unknown DAG Node>>";
3792 if (const TargetInstrInfo *TII = G->getTarget().getInstrInfo())
3793 if (getOpcode()-ISD::BUILTIN_OP_END < TII->getNumOpcodes())
3794 return TII->get(getOpcode()-ISD::BUILTIN_OP_END).getName();
3796 TargetLowering &TLI = G->getTargetLoweringInfo();
3798 TLI.getTargetNodeName(getOpcode());
3799 if (Name) return Name;
3802 return "<<Unknown Target Node>>";
3805 case ISD::PREFETCH: return "Prefetch";
3806 case ISD::MEMBARRIER: return "MemBarrier";
3807 case ISD::ATOMIC_LCS: return "AtomicLCS";
3808 case ISD::ATOMIC_LAS: return "AtomicLAS";
3809 case ISD::ATOMIC_SWAP: return "AtomicSWAP";
3810 case ISD::PCMARKER: return "PCMarker";
3811 case ISD::READCYCLECOUNTER: return "ReadCycleCounter";
3812 case ISD::SRCVALUE: return "SrcValue";
3813 case ISD::MEMOPERAND: return "MemOperand";
3814 case ISD::EntryToken: return "EntryToken";
3815 case ISD::TokenFactor: return "TokenFactor";
3816 case ISD::AssertSext: return "AssertSext";
3817 case ISD::AssertZext: return "AssertZext";
3819 case ISD::STRING: return "String";
3820 case ISD::BasicBlock: return "BasicBlock";
3821 case ISD::VALUETYPE: return "ValueType";
3822 case ISD::Register: return "Register";
3824 case ISD::Constant: return "Constant";
3825 case ISD::ConstantFP: return "ConstantFP";
3826 case ISD::GlobalAddress: return "GlobalAddress";
3827 case ISD::GlobalTLSAddress: return "GlobalTLSAddress";
3828 case ISD::FrameIndex: return "FrameIndex";
3829 case ISD::JumpTable: return "JumpTable";
3830 case ISD::GLOBAL_OFFSET_TABLE: return "GLOBAL_OFFSET_TABLE";
3831 case ISD::RETURNADDR: return "RETURNADDR";
3832 case ISD::FRAMEADDR: return "FRAMEADDR";
3833 case ISD::FRAME_TO_ARGS_OFFSET: return "FRAME_TO_ARGS_OFFSET";
3834 case ISD::EXCEPTIONADDR: return "EXCEPTIONADDR";
3835 case ISD::EHSELECTION: return "EHSELECTION";
3836 case ISD::EH_RETURN: return "EH_RETURN";
3837 case ISD::ConstantPool: return "ConstantPool";
3838 case ISD::ExternalSymbol: return "ExternalSymbol";
3839 case ISD::INTRINSIC_WO_CHAIN: {
3840 unsigned IID = cast<ConstantSDNode>(getOperand(0))->getValue();
3841 return Intrinsic::getName((Intrinsic::ID)IID);
3843 case ISD::INTRINSIC_VOID:
3844 case ISD::INTRINSIC_W_CHAIN: {
3845 unsigned IID = cast<ConstantSDNode>(getOperand(1))->getValue();
3846 return Intrinsic::getName((Intrinsic::ID)IID);
3849 case ISD::BUILD_VECTOR: return "BUILD_VECTOR";
3850 case ISD::TargetConstant: return "TargetConstant";
3851 case ISD::TargetConstantFP:return "TargetConstantFP";
3852 case ISD::TargetGlobalAddress: return "TargetGlobalAddress";
3853 case ISD::TargetGlobalTLSAddress: return "TargetGlobalTLSAddress";
3854 case ISD::TargetFrameIndex: return "TargetFrameIndex";
3855 case ISD::TargetJumpTable: return "TargetJumpTable";
3856 case ISD::TargetConstantPool: return "TargetConstantPool";
3857 case ISD::TargetExternalSymbol: return "TargetExternalSymbol";
3859 case ISD::CopyToReg: return "CopyToReg";
3860 case ISD::CopyFromReg: return "CopyFromReg";
3861 case ISD::UNDEF: return "undef";
3862 case ISD::MERGE_VALUES: return "merge_values";
3863 case ISD::INLINEASM: return "inlineasm";
3864 case ISD::LABEL: return "label";
3865 case ISD::DECLARE: return "declare";
3866 case ISD::HANDLENODE: return "handlenode";
3867 case ISD::FORMAL_ARGUMENTS: return "formal_arguments";
3868 case ISD::CALL: return "call";
3871 case ISD::FABS: return "fabs";
3872 case ISD::FNEG: return "fneg";
3873 case ISD::FSQRT: return "fsqrt";
3874 case ISD::FSIN: return "fsin";
3875 case ISD::FCOS: return "fcos";
3876 case ISD::FPOWI: return "fpowi";
3877 case ISD::FPOW: return "fpow";
3880 case ISD::ADD: return "add";
3881 case ISD::SUB: return "sub";
3882 case ISD::MUL: return "mul";
3883 case ISD::MULHU: return "mulhu";
3884 case ISD::MULHS: return "mulhs";
3885 case ISD::SDIV: return "sdiv";
3886 case ISD::UDIV: return "udiv";
3887 case ISD::SREM: return "srem";
3888 case ISD::UREM: return "urem";
3889 case ISD::SMUL_LOHI: return "smul_lohi";
3890 case ISD::UMUL_LOHI: return "umul_lohi";
3891 case ISD::SDIVREM: return "sdivrem";
3892 case ISD::UDIVREM: return "divrem";
3893 case ISD::AND: return "and";
3894 case ISD::OR: return "or";
3895 case ISD::XOR: return "xor";
3896 case ISD::SHL: return "shl";
3897 case ISD::SRA: return "sra";
3898 case ISD::SRL: return "srl";
3899 case ISD::ROTL: return "rotl";
3900 case ISD::ROTR: return "rotr";
3901 case ISD::FADD: return "fadd";
3902 case ISD::FSUB: return "fsub";
3903 case ISD::FMUL: return "fmul";
3904 case ISD::FDIV: return "fdiv";
3905 case ISD::FREM: return "frem";
3906 case ISD::FCOPYSIGN: return "fcopysign";
3907 case ISD::FGETSIGN: return "fgetsign";
3909 case ISD::SETCC: return "setcc";
3910 case ISD::SELECT: return "select";
3911 case ISD::SELECT_CC: return "select_cc";
3912 case ISD::INSERT_VECTOR_ELT: return "insert_vector_elt";
3913 case ISD::EXTRACT_VECTOR_ELT: return "extract_vector_elt";
3914 case ISD::CONCAT_VECTORS: return "concat_vectors";
3915 case ISD::EXTRACT_SUBVECTOR: return "extract_subvector";
3916 case ISD::SCALAR_TO_VECTOR: return "scalar_to_vector";
3917 case ISD::VECTOR_SHUFFLE: return "vector_shuffle";
3918 case ISD::CARRY_FALSE: return "carry_false";
3919 case ISD::ADDC: return "addc";
3920 case ISD::ADDE: return "adde";
3921 case ISD::SUBC: return "subc";
3922 case ISD::SUBE: return "sube";
3923 case ISD::SHL_PARTS: return "shl_parts";
3924 case ISD::SRA_PARTS: return "sra_parts";
3925 case ISD::SRL_PARTS: return "srl_parts";
3927 case ISD::EXTRACT_SUBREG: return "extract_subreg";
3928 case ISD::INSERT_SUBREG: return "insert_subreg";
3930 // Conversion operators.
3931 case ISD::SIGN_EXTEND: return "sign_extend";
3932 case ISD::ZERO_EXTEND: return "zero_extend";
3933 case ISD::ANY_EXTEND: return "any_extend";
3934 case ISD::SIGN_EXTEND_INREG: return "sign_extend_inreg";
3935 case ISD::TRUNCATE: return "truncate";
3936 case ISD::FP_ROUND: return "fp_round";
3937 case ISD::FLT_ROUNDS_: return "flt_rounds";
3938 case ISD::FP_ROUND_INREG: return "fp_round_inreg";
3939 case ISD::FP_EXTEND: return "fp_extend";
3941 case ISD::SINT_TO_FP: return "sint_to_fp";
3942 case ISD::UINT_TO_FP: return "uint_to_fp";
3943 case ISD::FP_TO_SINT: return "fp_to_sint";
3944 case ISD::FP_TO_UINT: return "fp_to_uint";
3945 case ISD::BIT_CONVERT: return "bit_convert";
3947 // Control flow instructions
3948 case ISD::BR: return "br";
3949 case ISD::BRIND: return "brind";
3950 case ISD::BR_JT: return "br_jt";
3951 case ISD::BRCOND: return "brcond";
3952 case ISD::BR_CC: return "br_cc";
3953 case ISD::RET: return "ret";
3954 case ISD::CALLSEQ_START: return "callseq_start";
3955 case ISD::CALLSEQ_END: return "callseq_end";
3958 case ISD::LOAD: return "load";
3959 case ISD::STORE: return "store";
3960 case ISD::VAARG: return "vaarg";
3961 case ISD::VACOPY: return "vacopy";
3962 case ISD::VAEND: return "vaend";
3963 case ISD::VASTART: return "vastart";
3964 case ISD::DYNAMIC_STACKALLOC: return "dynamic_stackalloc";
3965 case ISD::EXTRACT_ELEMENT: return "extract_element";
3966 case ISD::BUILD_PAIR: return "build_pair";
3967 case ISD::STACKSAVE: return "stacksave";
3968 case ISD::STACKRESTORE: return "stackrestore";
3969 case ISD::TRAP: return "trap";
3971 // Block memory operations.
3972 case ISD::MEMSET: return "memset";
3973 case ISD::MEMCPY: return "memcpy";
3974 case ISD::MEMMOVE: return "memmove";
3977 case ISD::BSWAP: return "bswap";
3978 case ISD::CTPOP: return "ctpop";
3979 case ISD::CTTZ: return "cttz";
3980 case ISD::CTLZ: return "ctlz";
3983 case ISD::LOCATION: return "location";
3984 case ISD::DEBUG_LOC: return "debug_loc";
3987 case ISD::TRAMPOLINE: return "trampoline";
3990 switch (cast<CondCodeSDNode>(this)->get()) {
3991 default: assert(0 && "Unknown setcc condition!");
3992 case ISD::SETOEQ: return "setoeq";
3993 case ISD::SETOGT: return "setogt";
3994 case ISD::SETOGE: return "setoge";
3995 case ISD::SETOLT: return "setolt";
3996 case ISD::SETOLE: return "setole";
3997 case ISD::SETONE: return "setone";
3999 case ISD::SETO: return "seto";
4000 case ISD::SETUO: return "setuo";
4001 case ISD::SETUEQ: return "setue";
4002 case ISD::SETUGT: return "setugt";
4003 case ISD::SETUGE: return "setuge";
4004 case ISD::SETULT: return "setult";
4005 case ISD::SETULE: return "setule";
4006 case ISD::SETUNE: return "setune";
4008 case ISD::SETEQ: return "seteq";
4009 case ISD::SETGT: return "setgt";
4010 case ISD::SETGE: return "setge";
4011 case ISD::SETLT: return "setlt";
4012 case ISD::SETLE: return "setle";
4013 case ISD::SETNE: return "setne";
4018 const char *SDNode::getIndexedModeName(ISD::MemIndexedMode AM) {
4027 return "<post-inc>";
4029 return "<post-dec>";
4033 void SDNode::dump() const { dump(0); }
4034 void SDNode::dump(const SelectionDAG *G) const {
4035 cerr << (void*)this << ": ";
4037 for (unsigned i = 0, e = getNumValues(); i != e; ++i) {
4039 if (getValueType(i) == MVT::Other)
4042 cerr << MVT::getValueTypeString(getValueType(i));
4044 cerr << " = " << getOperationName(G);
4047 for (unsigned i = 0, e = getNumOperands(); i != e; ++i) {
4048 if (i) cerr << ", ";
4049 cerr << (void*)getOperand(i).Val;
4050 if (unsigned RN = getOperand(i).ResNo)
4054 if (!isTargetOpcode() && getOpcode() == ISD::VECTOR_SHUFFLE) {
4055 SDNode *Mask = getOperand(2).Val;
4057 for (unsigned i = 0, e = Mask->getNumOperands(); i != e; ++i) {
4059 if (Mask->getOperand(i).getOpcode() == ISD::UNDEF)
4062 cerr << cast<ConstantSDNode>(Mask->getOperand(i))->getValue();
4067 if (const ConstantSDNode *CSDN = dyn_cast<ConstantSDNode>(this)) {
4068 cerr << "<" << CSDN->getValue() << ">";
4069 } else if (const ConstantFPSDNode *CSDN = dyn_cast<ConstantFPSDNode>(this)) {
4070 if (&CSDN->getValueAPF().getSemantics()==&APFloat::IEEEsingle)
4071 cerr << "<" << CSDN->getValueAPF().convertToFloat() << ">";
4072 else if (&CSDN->getValueAPF().getSemantics()==&APFloat::IEEEdouble)
4073 cerr << "<" << CSDN->getValueAPF().convertToDouble() << ">";
4075 cerr << "<APFloat(";
4076 CSDN->getValueAPF().convertToAPInt().dump();
4079 } else if (const GlobalAddressSDNode *GADN =
4080 dyn_cast<GlobalAddressSDNode>(this)) {
4081 int offset = GADN->getOffset();
4083 WriteAsOperand(*cerr.stream(), GADN->getGlobal()) << ">";
4085 cerr << " + " << offset;
4087 cerr << " " << offset;
4088 } else if (const FrameIndexSDNode *FIDN = dyn_cast<FrameIndexSDNode>(this)) {
4089 cerr << "<" << FIDN->getIndex() << ">";
4090 } else if (const JumpTableSDNode *JTDN = dyn_cast<JumpTableSDNode>(this)) {
4091 cerr << "<" << JTDN->getIndex() << ">";
4092 } else if (const ConstantPoolSDNode *CP = dyn_cast<ConstantPoolSDNode>(this)){
4093 int offset = CP->getOffset();
4094 if (CP->isMachineConstantPoolEntry())
4095 cerr << "<" << *CP->getMachineCPVal() << ">";
4097 cerr << "<" << *CP->getConstVal() << ">";
4099 cerr << " + " << offset;
4101 cerr << " " << offset;
4102 } else if (const BasicBlockSDNode *BBDN = dyn_cast<BasicBlockSDNode>(this)) {
4104 const Value *LBB = (const Value*)BBDN->getBasicBlock()->getBasicBlock();
4106 cerr << LBB->getName() << " ";
4107 cerr << (const void*)BBDN->getBasicBlock() << ">";
4108 } else if (const RegisterSDNode *R = dyn_cast<RegisterSDNode>(this)) {
4109 if (G && R->getReg() &&
4110 TargetRegisterInfo::isPhysicalRegister(R->getReg())) {
4111 cerr << " " << G->getTarget().getRegisterInfo()->getName(R->getReg());
4113 cerr << " #" << R->getReg();
4115 } else if (const ExternalSymbolSDNode *ES =
4116 dyn_cast<ExternalSymbolSDNode>(this)) {
4117 cerr << "'" << ES->getSymbol() << "'";
4118 } else if (const SrcValueSDNode *M = dyn_cast<SrcValueSDNode>(this)) {
4120 cerr << "<" << M->getValue() << ">";
4123 } else if (const MemOperandSDNode *M = dyn_cast<MemOperandSDNode>(this)) {
4124 if (M->MO.getValue())
4125 cerr << "<" << M->MO.getValue() << ":" << M->MO.getOffset() << ">";
4127 cerr << "<null:" << M->MO.getOffset() << ">";
4128 } else if (const VTSDNode *N = dyn_cast<VTSDNode>(this)) {
4129 cerr << ":" << MVT::getValueTypeString(N->getVT());
4130 } else if (const LoadSDNode *LD = dyn_cast<LoadSDNode>(this)) {
4131 const Value *SrcValue = LD->getSrcValue();
4132 int SrcOffset = LD->getSrcValueOffset();
4138 cerr << ":" << SrcOffset << ">";
4141 switch (LD->getExtensionType()) {
4142 default: doExt = false; break;
4144 cerr << " <anyext ";
4154 cerr << MVT::getValueTypeString(LD->getMemoryVT()) << ">";
4156 const char *AM = getIndexedModeName(LD->getAddressingMode());
4159 if (LD->isVolatile())
4160 cerr << " <volatile>";
4161 cerr << " alignment=" << LD->getAlignment();
4162 } else if (const StoreSDNode *ST = dyn_cast<StoreSDNode>(this)) {
4163 const Value *SrcValue = ST->getSrcValue();
4164 int SrcOffset = ST->getSrcValueOffset();
4170 cerr << ":" << SrcOffset << ">";
4172 if (ST->isTruncatingStore())
4174 << MVT::getValueTypeString(ST->getMemoryVT()) << ">";
4176 const char *AM = getIndexedModeName(ST->getAddressingMode());
4179 if (ST->isVolatile())
4180 cerr << " <volatile>";
4181 cerr << " alignment=" << ST->getAlignment();
4185 static void DumpNodes(const SDNode *N, unsigned indent, const SelectionDAG *G) {
4186 for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i)
4187 if (N->getOperand(i).Val->hasOneUse())
4188 DumpNodes(N->getOperand(i).Val, indent+2, G);
4190 cerr << "\n" << std::string(indent+2, ' ')
4191 << (void*)N->getOperand(i).Val << ": <multiple use>";
4194 cerr << "\n" << std::string(indent, ' ');
4198 void SelectionDAG::dump() const {
4199 cerr << "SelectionDAG has " << AllNodes.size() << " nodes:";
4200 std::vector<const SDNode*> Nodes;
4201 for (allnodes_const_iterator I = allnodes_begin(), E = allnodes_end();
4205 std::sort(Nodes.begin(), Nodes.end());
4207 for (unsigned i = 0, e = Nodes.size(); i != e; ++i) {
4208 if (!Nodes[i]->hasOneUse() && Nodes[i] != getRoot().Val)
4209 DumpNodes(Nodes[i], 2, this);
4212 if (getRoot().Val) DumpNodes(getRoot().Val, 2, this);
4217 const Type *ConstantPoolSDNode::getType() const {
4218 if (isMachineConstantPoolEntry())
4219 return Val.MachineCPVal->getType();
4220 return Val.ConstVal->getType();