1 //===-- SelectionDAG.cpp - Implement the SelectionDAG data structures -----===//
3 // The LLVM Compiler Infrastructure
5 // This file was developed by the LLVM research group and is distributed under
6 // the University of Illinois Open Source License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // This implements the SelectionDAG class.
12 //===----------------------------------------------------------------------===//
14 #include "llvm/CodeGen/SelectionDAG.h"
15 #include "llvm/Constants.h"
16 #include "llvm/GlobalValue.h"
17 #include "llvm/Assembly/Writer.h"
18 #include "llvm/CodeGen/MachineBasicBlock.h"
19 #include "llvm/Support/MathExtras.h"
20 #include "llvm/Target/MRegisterInfo.h"
21 #include "llvm/Target/TargetLowering.h"
22 #include "llvm/Target/TargetInstrInfo.h"
23 #include "llvm/Target/TargetMachine.h"
30 static bool isCommutativeBinOp(unsigned Opcode) {
38 case ISD::XOR: return true;
39 default: return false; // FIXME: Need commutative info for user ops!
43 static bool isAssociativeBinOp(unsigned Opcode) {
49 case ISD::XOR: return true;
50 default: return false; // FIXME: Need associative info for user ops!
54 // isInvertibleForFree - Return true if there is no cost to emitting the logical
55 // inverse of this node.
56 static bool isInvertibleForFree(SDOperand N) {
57 if (isa<ConstantSDNode>(N.Val)) return true;
58 if (N.Val->getOpcode() == ISD::SETCC && N.Val->hasOneUse())
63 //===----------------------------------------------------------------------===//
64 // ConstantFPSDNode Class
65 //===----------------------------------------------------------------------===//
67 /// isExactlyValue - We don't rely on operator== working on double values, as
68 /// it returns true for things that are clearly not equal, like -0.0 and 0.0.
69 /// As such, this method can be used to do an exact bit-for-bit comparison of
70 /// two floating point values.
71 bool ConstantFPSDNode::isExactlyValue(double V) const {
72 return DoubleToBits(V) == DoubleToBits(Value);
75 //===----------------------------------------------------------------------===//
77 //===----------------------------------------------------------------------===//
79 /// getSetCCSwappedOperands - Return the operation corresponding to (Y op X)
80 /// when given the operation for (X op Y).
81 ISD::CondCode ISD::getSetCCSwappedOperands(ISD::CondCode Operation) {
82 // To perform this operation, we just need to swap the L and G bits of the
84 unsigned OldL = (Operation >> 2) & 1;
85 unsigned OldG = (Operation >> 1) & 1;
86 return ISD::CondCode((Operation & ~6) | // Keep the N, U, E bits
87 (OldL << 1) | // New G bit
88 (OldG << 2)); // New L bit.
91 /// getSetCCInverse - Return the operation corresponding to !(X op Y), where
92 /// 'op' is a valid SetCC operation.
93 ISD::CondCode ISD::getSetCCInverse(ISD::CondCode Op, bool isInteger) {
94 unsigned Operation = Op;
96 Operation ^= 7; // Flip L, G, E bits, but not U.
98 Operation ^= 15; // Flip all of the condition bits.
99 if (Operation > ISD::SETTRUE2)
100 Operation &= ~8; // Don't let N and U bits get set.
101 return ISD::CondCode(Operation);
105 /// isSignedOp - For an integer comparison, return 1 if the comparison is a
106 /// signed operation and 2 if the result is an unsigned comparison. Return zero
107 /// if the operation does not depend on the sign of the input (setne and seteq).
108 static int isSignedOp(ISD::CondCode Opcode) {
110 default: assert(0 && "Illegal integer setcc operation!");
112 case ISD::SETNE: return 0;
116 case ISD::SETGE: return 1;
120 case ISD::SETUGE: return 2;
124 /// getSetCCOrOperation - Return the result of a logical OR between different
125 /// comparisons of identical values: ((X op1 Y) | (X op2 Y)). This function
126 /// returns SETCC_INVALID if it is not possible to represent the resultant
128 ISD::CondCode ISD::getSetCCOrOperation(ISD::CondCode Op1, ISD::CondCode Op2,
130 if (isInteger && (isSignedOp(Op1) | isSignedOp(Op2)) == 3)
131 // Cannot fold a signed integer setcc with an unsigned integer setcc.
132 return ISD::SETCC_INVALID;
134 unsigned Op = Op1 | Op2; // Combine all of the condition bits.
136 // If the N and U bits get set then the resultant comparison DOES suddenly
137 // care about orderedness, and is true when ordered.
138 if (Op > ISD::SETTRUE2)
139 Op &= ~16; // Clear the N bit.
140 return ISD::CondCode(Op);
143 /// getSetCCAndOperation - Return the result of a logical AND between different
144 /// comparisons of identical values: ((X op1 Y) & (X op2 Y)). This
145 /// function returns zero if it is not possible to represent the resultant
147 ISD::CondCode ISD::getSetCCAndOperation(ISD::CondCode Op1, ISD::CondCode Op2,
149 if (isInteger && (isSignedOp(Op1) | isSignedOp(Op2)) == 3)
150 // Cannot fold a signed setcc with an unsigned setcc.
151 return ISD::SETCC_INVALID;
153 // Combine all of the condition bits.
154 return ISD::CondCode(Op1 & Op2);
157 const TargetMachine &SelectionDAG::getTarget() const {
158 return TLI.getTargetMachine();
161 //===----------------------------------------------------------------------===//
162 // SelectionDAG Class
163 //===----------------------------------------------------------------------===//
165 /// RemoveDeadNodes - This method deletes all unreachable nodes in the
166 /// SelectionDAG, including nodes (like loads) that have uses of their token
167 /// chain but no other uses and no side effect. If a node is passed in as an
168 /// argument, it is used as the seed for node deletion.
169 void SelectionDAG::RemoveDeadNodes(SDNode *N) {
170 // Create a dummy node (which is not added to allnodes), that adds a reference
171 // to the root node, preventing it from being deleted.
172 HandleSDNode Dummy(getRoot());
174 bool MadeChange = false;
176 // If we have a hint to start from, use it.
177 if (N && N->use_empty()) {
182 for (allnodes_iterator I = allnodes_begin(), E = allnodes_end(); I != E; ++I)
183 if (I->use_empty() && I->getOpcode() != 65535) {
184 // Node is dead, recursively delete newly dead uses.
189 // Walk the nodes list, removing the nodes we've marked as dead.
191 for (allnodes_iterator I = allnodes_begin(), E = allnodes_end(); I != E; ) {
198 // If the root changed (e.g. it was a dead load, update the root).
199 setRoot(Dummy.getValue());
202 /// DestroyDeadNode - We know that N is dead. Nuke it from the CSE maps for the
203 /// graph. If it is the last user of any of its operands, recursively process
204 /// them the same way.
206 void SelectionDAG::DestroyDeadNode(SDNode *N) {
207 // Okay, we really are going to delete this node. First take this out of the
208 // appropriate CSE map.
209 RemoveNodeFromCSEMaps(N);
211 // Next, brutally remove the operand list. This is safe to do, as there are
212 // no cycles in the graph.
213 for (SDNode::op_iterator I = N->op_begin(), E = N->op_end(); I != E; ++I) {
217 // Now that we removed this operand, see if there are no uses of it left.
221 delete[] N->OperandList;
225 // Mark the node as dead.
226 N->MorphNodeTo(65535);
229 void SelectionDAG::DeleteNode(SDNode *N) {
230 assert(N->use_empty() && "Cannot delete a node that is not dead!");
232 // First take this out of the appropriate CSE map.
233 RemoveNodeFromCSEMaps(N);
235 // Finally, remove uses due to operands of this node, remove from the
236 // AllNodes list, and delete the node.
237 DeleteNodeNotInCSEMaps(N);
240 void SelectionDAG::DeleteNodeNotInCSEMaps(SDNode *N) {
242 // Remove it from the AllNodes list.
245 // Drop all of the operands and decrement used nodes use counts.
246 for (SDNode::op_iterator I = N->op_begin(), E = N->op_end(); I != E; ++I)
247 I->Val->removeUser(N);
248 delete[] N->OperandList;
255 /// RemoveNodeFromCSEMaps - Take the specified node out of the CSE map that
256 /// correspond to it. This is useful when we're about to delete or repurpose
257 /// the node. We don't want future request for structurally identical nodes
258 /// to return N anymore.
259 void SelectionDAG::RemoveNodeFromCSEMaps(SDNode *N) {
261 switch (N->getOpcode()) {
262 case ISD::HANDLENODE: return; // noop.
264 Erased = Constants.erase(std::make_pair(cast<ConstantSDNode>(N)->getValue(),
265 N->getValueType(0)));
267 case ISD::TargetConstant:
268 Erased = TargetConstants.erase(std::make_pair(
269 cast<ConstantSDNode>(N)->getValue(),
270 N->getValueType(0)));
272 case ISD::ConstantFP: {
273 uint64_t V = DoubleToBits(cast<ConstantFPSDNode>(N)->getValue());
274 Erased = ConstantFPs.erase(std::make_pair(V, N->getValueType(0)));
278 Erased = StringNodes.erase(cast<StringSDNode>(N)->getValue());
281 assert(CondCodeNodes[cast<CondCodeSDNode>(N)->get()] &&
282 "Cond code doesn't exist!");
283 Erased = CondCodeNodes[cast<CondCodeSDNode>(N)->get()] != 0;
284 CondCodeNodes[cast<CondCodeSDNode>(N)->get()] = 0;
286 case ISD::GlobalAddress: {
287 GlobalAddressSDNode *GN = cast<GlobalAddressSDNode>(N);
288 Erased = GlobalValues.erase(std::make_pair(GN->getGlobal(),
292 case ISD::TargetGlobalAddress: {
293 GlobalAddressSDNode *GN = cast<GlobalAddressSDNode>(N);
294 Erased =TargetGlobalValues.erase(std::make_pair(GN->getGlobal(),
298 case ISD::FrameIndex:
299 Erased = FrameIndices.erase(cast<FrameIndexSDNode>(N)->getIndex());
301 case ISD::TargetFrameIndex:
302 Erased = TargetFrameIndices.erase(cast<FrameIndexSDNode>(N)->getIndex());
304 case ISD::ConstantPool:
305 Erased = ConstantPoolIndices.erase(cast<ConstantPoolSDNode>(N)->get());
307 case ISD::TargetConstantPool:
308 Erased =TargetConstantPoolIndices.erase(cast<ConstantPoolSDNode>(N)->get());
310 case ISD::BasicBlock:
311 Erased = BBNodes.erase(cast<BasicBlockSDNode>(N)->getBasicBlock());
313 case ISD::ExternalSymbol:
314 Erased = ExternalSymbols.erase(cast<ExternalSymbolSDNode>(N)->getSymbol());
316 case ISD::TargetExternalSymbol:
317 Erased = TargetExternalSymbols.erase(cast<ExternalSymbolSDNode>(N)->getSymbol());
320 Erased = ValueTypeNodes[cast<VTSDNode>(N)->getVT()] != 0;
321 ValueTypeNodes[cast<VTSDNode>(N)->getVT()] = 0;
324 Erased = RegNodes.erase(std::make_pair(cast<RegisterSDNode>(N)->getReg(),
325 N->getValueType(0)));
327 case ISD::SRCVALUE: {
328 SrcValueSDNode *SVN = cast<SrcValueSDNode>(N);
329 Erased =ValueNodes.erase(std::make_pair(SVN->getValue(), SVN->getOffset()));
333 Erased = Loads.erase(std::make_pair(N->getOperand(1),
334 std::make_pair(N->getOperand(0),
335 N->getValueType(0))));
338 if (N->getNumValues() == 1) {
339 if (N->getNumOperands() == 0) {
340 Erased = NullaryOps.erase(std::make_pair(N->getOpcode(),
341 N->getValueType(0)));
342 } else if (N->getNumOperands() == 1) {
344 UnaryOps.erase(std::make_pair(N->getOpcode(),
345 std::make_pair(N->getOperand(0),
346 N->getValueType(0))));
347 } else if (N->getNumOperands() == 2) {
349 BinaryOps.erase(std::make_pair(N->getOpcode(),
350 std::make_pair(N->getOperand(0),
353 std::vector<SDOperand> Ops(N->op_begin(), N->op_end());
355 OneResultNodes.erase(std::make_pair(N->getOpcode(),
356 std::make_pair(N->getValueType(0),
360 // Remove the node from the ArbitraryNodes map.
361 std::vector<MVT::ValueType> RV(N->value_begin(), N->value_end());
362 std::vector<SDOperand> Ops(N->op_begin(), N->op_end());
364 ArbitraryNodes.erase(std::make_pair(N->getOpcode(),
365 std::make_pair(RV, Ops)));
370 // Verify that the node was actually in one of the CSE maps, unless it has a
371 // flag result (which cannot be CSE'd) or is one of the special cases that are
372 // not subject to CSE.
373 if (!Erased && N->getValueType(N->getNumValues()-1) != MVT::Flag &&
374 N->getOpcode() != ISD::CALL && N->getOpcode() != ISD::CALLSEQ_START &&
375 N->getOpcode() != ISD::CALLSEQ_END && !N->isTargetOpcode()) {
378 assert(0 && "Node is not in map!");
383 /// AddNonLeafNodeToCSEMaps - Add the specified node back to the CSE maps. It
384 /// has been taken out and modified in some way. If the specified node already
385 /// exists in the CSE maps, do not modify the maps, but return the existing node
386 /// instead. If it doesn't exist, add it and return null.
388 SDNode *SelectionDAG::AddNonLeafNodeToCSEMaps(SDNode *N) {
389 assert(N->getNumOperands() && "This is a leaf node!");
390 if (N->getOpcode() == ISD::CALLSEQ_START ||
391 N->getOpcode() == ISD::CALLSEQ_END)
394 if (N->getOpcode() == ISD::LOAD) {
395 SDNode *&L = Loads[std::make_pair(N->getOperand(1),
396 std::make_pair(N->getOperand(0),
397 N->getValueType(0)))];
400 } else if (N->getOpcode() == ISD::HANDLENODE) {
401 return 0; // never add it.
402 } else if (N->getNumOperands() == 1) {
403 SDNode *&U = UnaryOps[std::make_pair(N->getOpcode(),
404 std::make_pair(N->getOperand(0),
405 N->getValueType(0)))];
408 } else if (N->getNumOperands() == 2) {
409 SDNode *&B = BinaryOps[std::make_pair(N->getOpcode(),
410 std::make_pair(N->getOperand(0),
414 } else if (N->getNumValues() == 1) {
415 std::vector<SDOperand> Ops(N->op_begin(), N->op_end());
416 SDNode *&ORN = OneResultNodes[std::make_pair(N->getOpcode(),
417 std::make_pair(N->getValueType(0), Ops))];
421 // Remove the node from the ArbitraryNodes map.
422 std::vector<MVT::ValueType> RV(N->value_begin(), N->value_end());
423 std::vector<SDOperand> Ops(N->op_begin(), N->op_end());
424 SDNode *&AN = ArbitraryNodes[std::make_pair(N->getOpcode(),
425 std::make_pair(RV, Ops))];
434 SelectionDAG::~SelectionDAG() {
435 while (!AllNodes.empty()) {
436 SDNode *N = AllNodes.begin();
437 delete [] N->OperandList;
440 AllNodes.pop_front();
444 SDOperand SelectionDAG::getZeroExtendInReg(SDOperand Op, MVT::ValueType VT) {
445 if (Op.getValueType() == VT) return Op;
446 int64_t Imm = ~0ULL >> (64-MVT::getSizeInBits(VT));
447 return getNode(ISD::AND, Op.getValueType(), Op,
448 getConstant(Imm, Op.getValueType()));
451 SDOperand SelectionDAG::getConstant(uint64_t Val, MVT::ValueType VT) {
452 assert(MVT::isInteger(VT) && "Cannot create FP integer constant!");
453 // Mask out any bits that are not valid for this constant.
455 Val &= ((uint64_t)1 << MVT::getSizeInBits(VT)) - 1;
457 SDNode *&N = Constants[std::make_pair(Val, VT)];
458 if (N) return SDOperand(N, 0);
459 N = new ConstantSDNode(false, Val, VT);
460 AllNodes.push_back(N);
461 return SDOperand(N, 0);
464 SDOperand SelectionDAG::getString(const std::string &Val) {
465 StringSDNode *&N = StringNodes[Val];
467 N = new StringSDNode(Val);
468 AllNodes.push_back(N);
470 return SDOperand(N, 0);
473 SDOperand SelectionDAG::getTargetConstant(uint64_t Val, MVT::ValueType VT) {
474 assert(MVT::isInteger(VT) && "Cannot create FP integer constant!");
475 // Mask out any bits that are not valid for this constant.
477 Val &= ((uint64_t)1 << MVT::getSizeInBits(VT)) - 1;
479 SDNode *&N = TargetConstants[std::make_pair(Val, VT)];
480 if (N) return SDOperand(N, 0);
481 N = new ConstantSDNode(true, Val, VT);
482 AllNodes.push_back(N);
483 return SDOperand(N, 0);
486 SDOperand SelectionDAG::getConstantFP(double Val, MVT::ValueType VT) {
487 assert(MVT::isFloatingPoint(VT) && "Cannot create integer FP constant!");
489 Val = (float)Val; // Mask out extra precision.
491 // Do the map lookup using the actual bit pattern for the floating point
492 // value, so that we don't have problems with 0.0 comparing equal to -0.0, and
493 // we don't have issues with SNANs.
494 SDNode *&N = ConstantFPs[std::make_pair(DoubleToBits(Val), VT)];
495 if (N) return SDOperand(N, 0);
496 N = new ConstantFPSDNode(Val, VT);
497 AllNodes.push_back(N);
498 return SDOperand(N, 0);
503 SDOperand SelectionDAG::getGlobalAddress(const GlobalValue *GV,
504 MVT::ValueType VT, int offset) {
505 SDNode *&N = GlobalValues[std::make_pair(GV, offset)];
506 if (N) return SDOperand(N, 0);
507 N = new GlobalAddressSDNode(false, GV, VT);
508 AllNodes.push_back(N);
509 return SDOperand(N, 0);
512 SDOperand SelectionDAG::getTargetGlobalAddress(const GlobalValue *GV,
513 MVT::ValueType VT, int offset) {
514 SDNode *&N = TargetGlobalValues[std::make_pair(GV, offset)];
515 if (N) return SDOperand(N, 0);
516 N = new GlobalAddressSDNode(true, GV, VT, offset);
517 AllNodes.push_back(N);
518 return SDOperand(N, 0);
521 SDOperand SelectionDAG::getFrameIndex(int FI, MVT::ValueType VT) {
522 SDNode *&N = FrameIndices[FI];
523 if (N) return SDOperand(N, 0);
524 N = new FrameIndexSDNode(FI, VT, false);
525 AllNodes.push_back(N);
526 return SDOperand(N, 0);
529 SDOperand SelectionDAG::getTargetFrameIndex(int FI, MVT::ValueType VT) {
530 SDNode *&N = TargetFrameIndices[FI];
531 if (N) return SDOperand(N, 0);
532 N = new FrameIndexSDNode(FI, VT, true);
533 AllNodes.push_back(N);
534 return SDOperand(N, 0);
537 SDOperand SelectionDAG::getConstantPool(Constant *C, MVT::ValueType VT) {
538 SDNode *&N = ConstantPoolIndices[C];
539 if (N) return SDOperand(N, 0);
540 N = new ConstantPoolSDNode(C, VT, false);
541 AllNodes.push_back(N);
542 return SDOperand(N, 0);
545 SDOperand SelectionDAG::getTargetConstantPool(Constant *C, MVT::ValueType VT) {
546 SDNode *&N = TargetConstantPoolIndices[C];
547 if (N) return SDOperand(N, 0);
548 N = new ConstantPoolSDNode(C, VT, true);
549 AllNodes.push_back(N);
550 return SDOperand(N, 0);
553 SDOperand SelectionDAG::getBasicBlock(MachineBasicBlock *MBB) {
554 SDNode *&N = BBNodes[MBB];
555 if (N) return SDOperand(N, 0);
556 N = new BasicBlockSDNode(MBB);
557 AllNodes.push_back(N);
558 return SDOperand(N, 0);
561 SDOperand SelectionDAG::getValueType(MVT::ValueType VT) {
562 if ((unsigned)VT >= ValueTypeNodes.size())
563 ValueTypeNodes.resize(VT+1);
564 if (ValueTypeNodes[VT] == 0) {
565 ValueTypeNodes[VT] = new VTSDNode(VT);
566 AllNodes.push_back(ValueTypeNodes[VT]);
569 return SDOperand(ValueTypeNodes[VT], 0);
572 SDOperand SelectionDAG::getExternalSymbol(const char *Sym, MVT::ValueType VT) {
573 SDNode *&N = ExternalSymbols[Sym];
574 if (N) return SDOperand(N, 0);
575 N = new ExternalSymbolSDNode(false, Sym, VT);
576 AllNodes.push_back(N);
577 return SDOperand(N, 0);
580 SDOperand SelectionDAG::getTargetExternalSymbol(const char *Sym, MVT::ValueType VT) {
581 SDNode *&N = TargetExternalSymbols[Sym];
582 if (N) return SDOperand(N, 0);
583 N = new ExternalSymbolSDNode(true, Sym, VT);
584 AllNodes.push_back(N);
585 return SDOperand(N, 0);
588 SDOperand SelectionDAG::getCondCode(ISD::CondCode Cond) {
589 if ((unsigned)Cond >= CondCodeNodes.size())
590 CondCodeNodes.resize(Cond+1);
592 if (CondCodeNodes[Cond] == 0) {
593 CondCodeNodes[Cond] = new CondCodeSDNode(Cond);
594 AllNodes.push_back(CondCodeNodes[Cond]);
596 return SDOperand(CondCodeNodes[Cond], 0);
599 SDOperand SelectionDAG::getRegister(unsigned RegNo, MVT::ValueType VT) {
600 RegisterSDNode *&Reg = RegNodes[std::make_pair(RegNo, VT)];
602 Reg = new RegisterSDNode(RegNo, VT);
603 AllNodes.push_back(Reg);
605 return SDOperand(Reg, 0);
608 SDOperand SelectionDAG::SimplifySetCC(MVT::ValueType VT, SDOperand N1,
609 SDOperand N2, ISD::CondCode Cond) {
610 // These setcc operations always fold.
614 case ISD::SETFALSE2: return getConstant(0, VT);
616 case ISD::SETTRUE2: return getConstant(1, VT);
619 if (ConstantSDNode *N2C = dyn_cast<ConstantSDNode>(N2.Val)) {
620 uint64_t C2 = N2C->getValue();
621 if (ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1.Val)) {
622 uint64_t C1 = N1C->getValue();
624 // Sign extend the operands if required
625 if (ISD::isSignedIntSetCC(Cond)) {
626 C1 = N1C->getSignExtended();
627 C2 = N2C->getSignExtended();
631 default: assert(0 && "Unknown integer setcc!");
632 case ISD::SETEQ: return getConstant(C1 == C2, VT);
633 case ISD::SETNE: return getConstant(C1 != C2, VT);
634 case ISD::SETULT: return getConstant(C1 < C2, VT);
635 case ISD::SETUGT: return getConstant(C1 > C2, VT);
636 case ISD::SETULE: return getConstant(C1 <= C2, VT);
637 case ISD::SETUGE: return getConstant(C1 >= C2, VT);
638 case ISD::SETLT: return getConstant((int64_t)C1 < (int64_t)C2, VT);
639 case ISD::SETGT: return getConstant((int64_t)C1 > (int64_t)C2, VT);
640 case ISD::SETLE: return getConstant((int64_t)C1 <= (int64_t)C2, VT);
641 case ISD::SETGE: return getConstant((int64_t)C1 >= (int64_t)C2, VT);
644 // If the LHS is a ZERO_EXTEND, perform the comparison on the input.
645 if (N1.getOpcode() == ISD::ZERO_EXTEND) {
646 unsigned InSize = MVT::getSizeInBits(N1.getOperand(0).getValueType());
648 // If the comparison constant has bits in the upper part, the
649 // zero-extended value could never match.
650 if (C2 & (~0ULL << InSize)) {
651 unsigned VSize = MVT::getSizeInBits(N1.getValueType());
655 case ISD::SETEQ: return getConstant(0, VT);
658 case ISD::SETNE: return getConstant(1, VT);
661 // True if the sign bit of C2 is set.
662 return getConstant((C2 & (1ULL << VSize)) != 0, VT);
665 // True if the sign bit of C2 isn't set.
666 return getConstant((C2 & (1ULL << VSize)) == 0, VT);
672 // Otherwise, we can perform the comparison with the low bits.
680 return getSetCC(VT, N1.getOperand(0),
681 getConstant(C2, N1.getOperand(0).getValueType()),
684 break; // todo, be more careful with signed comparisons
686 } else if (N1.getOpcode() == ISD::SIGN_EXTEND_INREG &&
687 (Cond == ISD::SETEQ || Cond == ISD::SETNE)) {
688 MVT::ValueType ExtSrcTy = cast<VTSDNode>(N1.getOperand(1))->getVT();
689 unsigned ExtSrcTyBits = MVT::getSizeInBits(ExtSrcTy);
690 MVT::ValueType ExtDstTy = N1.getValueType();
691 unsigned ExtDstTyBits = MVT::getSizeInBits(ExtDstTy);
693 // If the extended part has any inconsistent bits, it cannot ever
694 // compare equal. In other words, they have to be all ones or all
697 (~0ULL >> (64-ExtSrcTyBits)) & (~0ULL << (ExtDstTyBits-1));
698 if ((C2 & ExtBits) != 0 && (C2 & ExtBits) != ExtBits)
699 return getConstant(Cond == ISD::SETNE, VT);
701 // Otherwise, make this a use of a zext.
702 return getSetCC(VT, getZeroExtendInReg(N1.getOperand(0), ExtSrcTy),
703 getConstant(C2 & (~0ULL>>(64-ExtSrcTyBits)), ExtDstTy),
707 uint64_t MinVal, MaxVal;
708 unsigned OperandBitSize = MVT::getSizeInBits(N2C->getValueType(0));
709 if (ISD::isSignedIntSetCC(Cond)) {
710 MinVal = 1ULL << (OperandBitSize-1);
711 if (OperandBitSize != 1) // Avoid X >> 64, which is undefined.
712 MaxVal = ~0ULL >> (65-OperandBitSize);
717 MaxVal = ~0ULL >> (64-OperandBitSize);
720 // Canonicalize GE/LE comparisons to use GT/LT comparisons.
721 if (Cond == ISD::SETGE || Cond == ISD::SETUGE) {
722 if (C2 == MinVal) return getConstant(1, VT); // X >= MIN --> true
723 --C2; // X >= C1 --> X > (C1-1)
724 return getSetCC(VT, N1, getConstant(C2, N2.getValueType()),
725 (Cond == ISD::SETGE) ? ISD::SETGT : ISD::SETUGT);
728 if (Cond == ISD::SETLE || Cond == ISD::SETULE) {
729 if (C2 == MaxVal) return getConstant(1, VT); // X <= MAX --> true
730 ++C2; // X <= C1 --> X < (C1+1)
731 return getSetCC(VT, N1, getConstant(C2, N2.getValueType()),
732 (Cond == ISD::SETLE) ? ISD::SETLT : ISD::SETULT);
735 if ((Cond == ISD::SETLT || Cond == ISD::SETULT) && C2 == MinVal)
736 return getConstant(0, VT); // X < MIN --> false
738 // Canonicalize setgt X, Min --> setne X, Min
739 if ((Cond == ISD::SETGT || Cond == ISD::SETUGT) && C2 == MinVal)
740 return getSetCC(VT, N1, N2, ISD::SETNE);
742 // If we have setult X, 1, turn it into seteq X, 0
743 if ((Cond == ISD::SETLT || Cond == ISD::SETULT) && C2 == MinVal+1)
744 return getSetCC(VT, N1, getConstant(MinVal, N1.getValueType()),
746 // If we have setugt X, Max-1, turn it into seteq X, Max
747 else if ((Cond == ISD::SETGT || Cond == ISD::SETUGT) && C2 == MaxVal-1)
748 return getSetCC(VT, N1, getConstant(MaxVal, N1.getValueType()),
751 // If we have "setcc X, C1", check to see if we can shrink the immediate
754 // SETUGT X, SINTMAX -> SETLT X, 0
755 if (Cond == ISD::SETUGT && OperandBitSize != 1 &&
756 C2 == (~0ULL >> (65-OperandBitSize)))
757 return getSetCC(VT, N1, getConstant(0, N2.getValueType()), ISD::SETLT);
759 // FIXME: Implement the rest of these.
762 // Fold bit comparisons when we can.
763 if ((Cond == ISD::SETEQ || Cond == ISD::SETNE) &&
764 VT == N1.getValueType() && N1.getOpcode() == ISD::AND)
765 if (ConstantSDNode *AndRHS =
766 dyn_cast<ConstantSDNode>(N1.getOperand(1))) {
767 if (Cond == ISD::SETNE && C2 == 0) {// (X & 8) != 0 --> (X & 8) >> 3
768 // Perform the xform if the AND RHS is a single bit.
769 if ((AndRHS->getValue() & (AndRHS->getValue()-1)) == 0) {
770 return getNode(ISD::SRL, VT, N1,
771 getConstant(Log2_64(AndRHS->getValue()),
772 TLI.getShiftAmountTy()));
774 } else if (Cond == ISD::SETEQ && C2 == AndRHS->getValue()) {
775 // (X & 8) == 8 --> (X & 8) >> 3
776 // Perform the xform if C2 is a single bit.
777 if ((C2 & (C2-1)) == 0) {
778 return getNode(ISD::SRL, VT, N1,
779 getConstant(Log2_64(C2),TLI.getShiftAmountTy()));
784 } else if (isa<ConstantSDNode>(N1.Val)) {
785 // Ensure that the constant occurs on the RHS.
786 return getSetCC(VT, N2, N1, ISD::getSetCCSwappedOperands(Cond));
789 if (ConstantFPSDNode *N1C = dyn_cast<ConstantFPSDNode>(N1.Val))
790 if (ConstantFPSDNode *N2C = dyn_cast<ConstantFPSDNode>(N2.Val)) {
791 double C1 = N1C->getValue(), C2 = N2C->getValue();
794 default: break; // FIXME: Implement the rest of these!
795 case ISD::SETEQ: return getConstant(C1 == C2, VT);
796 case ISD::SETNE: return getConstant(C1 != C2, VT);
797 case ISD::SETLT: return getConstant(C1 < C2, VT);
798 case ISD::SETGT: return getConstant(C1 > C2, VT);
799 case ISD::SETLE: return getConstant(C1 <= C2, VT);
800 case ISD::SETGE: return getConstant(C1 >= C2, VT);
803 // Ensure that the constant occurs on the RHS.
804 return getSetCC(VT, N2, N1, ISD::getSetCCSwappedOperands(Cond));
807 // Could not fold it.
811 /// getNode - Gets or creates the specified node.
813 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT) {
814 SDNode *&N = NullaryOps[std::make_pair(Opcode, VT)];
816 N = new SDNode(Opcode, VT);
817 AllNodes.push_back(N);
819 return SDOperand(N, 0);
822 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT,
824 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Operand.Val)) {
825 uint64_t Val = C->getValue();
828 case ISD::SIGN_EXTEND: return getConstant(C->getSignExtended(), VT);
829 case ISD::ANY_EXTEND:
830 case ISD::ZERO_EXTEND: return getConstant(Val, VT);
831 case ISD::TRUNCATE: return getConstant(Val, VT);
832 case ISD::SINT_TO_FP: return getConstantFP(C->getSignExtended(), VT);
833 case ISD::UINT_TO_FP: return getConstantFP(C->getValue(), VT);
837 if (ConstantFPSDNode *C = dyn_cast<ConstantFPSDNode>(Operand.Val))
840 return getConstantFP(-C->getValue(), VT);
843 return getConstantFP(C->getValue(), VT);
844 case ISD::FP_TO_SINT:
845 return getConstant((int64_t)C->getValue(), VT);
846 case ISD::FP_TO_UINT:
847 return getConstant((uint64_t)C->getValue(), VT);
850 unsigned OpOpcode = Operand.Val->getOpcode();
852 case ISD::TokenFactor:
853 return Operand; // Factor of one node? No factor.
854 case ISD::SIGN_EXTEND:
855 if (Operand.getValueType() == VT) return Operand; // noop extension
856 if (OpOpcode == ISD::SIGN_EXTEND || OpOpcode == ISD::ZERO_EXTEND)
857 return getNode(OpOpcode, VT, Operand.Val->getOperand(0));
859 case ISD::ZERO_EXTEND:
860 if (Operand.getValueType() == VT) return Operand; // noop extension
861 if (OpOpcode == ISD::ZERO_EXTEND) // (zext (zext x)) -> (zext x)
862 return getNode(ISD::ZERO_EXTEND, VT, Operand.Val->getOperand(0));
864 case ISD::ANY_EXTEND:
865 if (Operand.getValueType() == VT) return Operand; // noop extension
866 if (OpOpcode == ISD::ZERO_EXTEND || OpOpcode == ISD::SIGN_EXTEND)
867 // (ext (zext x)) -> (zext x) and (ext (sext x)) -> (sext x)
868 return getNode(OpOpcode, VT, Operand.Val->getOperand(0));
871 if (Operand.getValueType() == VT) return Operand; // noop truncate
872 if (OpOpcode == ISD::TRUNCATE)
873 return getNode(ISD::TRUNCATE, VT, Operand.Val->getOperand(0));
874 else if (OpOpcode == ISD::ZERO_EXTEND || OpOpcode == ISD::SIGN_EXTEND ||
875 OpOpcode == ISD::ANY_EXTEND) {
876 // If the source is smaller than the dest, we still need an extend.
877 if (Operand.Val->getOperand(0).getValueType() < VT)
878 return getNode(OpOpcode, VT, Operand.Val->getOperand(0));
879 else if (Operand.Val->getOperand(0).getValueType() > VT)
880 return getNode(ISD::TRUNCATE, VT, Operand.Val->getOperand(0));
882 return Operand.Val->getOperand(0);
886 if (OpOpcode == ISD::FSUB) // -(X-Y) -> (Y-X)
887 return getNode(ISD::FSUB, VT, Operand.Val->getOperand(1),
888 Operand.Val->getOperand(0));
889 if (OpOpcode == ISD::FNEG) // --X -> X
890 return Operand.Val->getOperand(0);
893 if (OpOpcode == ISD::FNEG) // abs(-X) -> abs(X)
894 return getNode(ISD::FABS, VT, Operand.Val->getOperand(0));
899 if (VT != MVT::Flag) { // Don't CSE flag producing nodes
900 SDNode *&E = UnaryOps[std::make_pair(Opcode, std::make_pair(Operand, VT))];
901 if (E) return SDOperand(E, 0);
902 E = N = new SDNode(Opcode, Operand);
904 N = new SDNode(Opcode, Operand);
906 N->setValueTypes(VT);
907 AllNodes.push_back(N);
908 return SDOperand(N, 0);
913 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT,
914 SDOperand N1, SDOperand N2) {
917 case ISD::TokenFactor:
918 assert(VT == MVT::Other && N1.getValueType() == MVT::Other &&
919 N2.getValueType() == MVT::Other && "Invalid token factor!");
928 assert(MVT::isInteger(VT) && "This operator does not apply to FP types!");
935 assert(MVT::isInteger(N1.getValueType()) && "Should use F* for FP ops");
942 assert(N1.getValueType() == N2.getValueType() &&
943 N1.getValueType() == VT && "Binary operator types must match!");
949 assert(VT == N1.getValueType() &&
950 "Shift operators return type must be the same as their first arg");
951 assert(MVT::isInteger(VT) && MVT::isInteger(N2.getValueType()) &&
952 VT != MVT::i1 && "Shifts only work on integers");
954 case ISD::FP_ROUND_INREG: {
955 MVT::ValueType EVT = cast<VTSDNode>(N2)->getVT();
956 assert(VT == N1.getValueType() && "Not an inreg round!");
957 assert(MVT::isFloatingPoint(VT) && MVT::isFloatingPoint(EVT) &&
958 "Cannot FP_ROUND_INREG integer types");
959 assert(EVT <= VT && "Not rounding down!");
962 case ISD::AssertSext:
963 case ISD::AssertZext:
964 case ISD::SIGN_EXTEND_INREG: {
965 MVT::ValueType EVT = cast<VTSDNode>(N2)->getVT();
966 assert(VT == N1.getValueType() && "Not an inreg extend!");
967 assert(MVT::isInteger(VT) && MVT::isInteger(EVT) &&
968 "Cannot *_EXTEND_INREG FP types");
969 assert(EVT <= VT && "Not extending!");
976 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1.Val);
977 ConstantSDNode *N2C = dyn_cast<ConstantSDNode>(N2.Val);
980 uint64_t C1 = N1C->getValue(), C2 = N2C->getValue();
982 case ISD::ADD: return getConstant(C1 + C2, VT);
983 case ISD::SUB: return getConstant(C1 - C2, VT);
984 case ISD::MUL: return getConstant(C1 * C2, VT);
986 if (C2) return getConstant(C1 / C2, VT);
989 if (C2) return getConstant(C1 % C2, VT);
992 if (C2) return getConstant(N1C->getSignExtended() /
993 N2C->getSignExtended(), VT);
996 if (C2) return getConstant(N1C->getSignExtended() %
997 N2C->getSignExtended(), VT);
999 case ISD::AND : return getConstant(C1 & C2, VT);
1000 case ISD::OR : return getConstant(C1 | C2, VT);
1001 case ISD::XOR : return getConstant(C1 ^ C2, VT);
1002 case ISD::SHL : return getConstant(C1 << C2, VT);
1003 case ISD::SRL : return getConstant(C1 >> C2, VT);
1004 case ISD::SRA : return getConstant(N1C->getSignExtended() >>(int)C2, VT);
1007 } else { // Cannonicalize constant to RHS if commutative
1008 if (isCommutativeBinOp(Opcode)) {
1009 std::swap(N1C, N2C);
1015 ConstantFPSDNode *N1CFP = dyn_cast<ConstantFPSDNode>(N1.Val);
1016 ConstantFPSDNode *N2CFP = dyn_cast<ConstantFPSDNode>(N2.Val);
1019 double C1 = N1CFP->getValue(), C2 = N2CFP->getValue();
1021 case ISD::FADD: return getConstantFP(C1 + C2, VT);
1022 case ISD::FSUB: return getConstantFP(C1 - C2, VT);
1023 case ISD::FMUL: return getConstantFP(C1 * C2, VT);
1025 if (C2) return getConstantFP(C1 / C2, VT);
1028 if (C2) return getConstantFP(fmod(C1, C2), VT);
1032 } else { // Cannonicalize constant to RHS if commutative
1033 if (isCommutativeBinOp(Opcode)) {
1034 std::swap(N1CFP, N2CFP);
1040 // Finally, fold operations that do not require constants.
1042 case ISD::FP_ROUND_INREG:
1043 if (cast<VTSDNode>(N2)->getVT() == VT) return N1; // Not actually rounding.
1045 case ISD::SIGN_EXTEND_INREG: {
1046 MVT::ValueType EVT = cast<VTSDNode>(N2)->getVT();
1047 if (EVT == VT) return N1; // Not actually extending
1051 // FIXME: figure out how to safely handle things like
1052 // int foo(int x) { return 1 << (x & 255); }
1053 // int bar() { return foo(256); }
1058 if (N2.getOpcode() == ISD::SIGN_EXTEND_INREG &&
1059 cast<VTSDNode>(N2.getOperand(1))->getVT() != MVT::i1)
1060 return getNode(Opcode, VT, N1, N2.getOperand(0));
1061 else if (N2.getOpcode() == ISD::AND)
1062 if (ConstantSDNode *AndRHS = dyn_cast<ConstantSDNode>(N2.getOperand(1))) {
1063 // If the and is only masking out bits that cannot effect the shift,
1064 // eliminate the and.
1065 unsigned NumBits = MVT::getSizeInBits(VT);
1066 if ((AndRHS->getValue() & (NumBits-1)) == NumBits-1)
1067 return getNode(Opcode, VT, N1, N2.getOperand(0));
1073 // Memoize this node if possible.
1075 if (Opcode != ISD::CALLSEQ_START && Opcode != ISD::CALLSEQ_END &&
1077 SDNode *&BON = BinaryOps[std::make_pair(Opcode, std::make_pair(N1, N2))];
1078 if (BON) return SDOperand(BON, 0);
1080 BON = N = new SDNode(Opcode, N1, N2);
1082 N = new SDNode(Opcode, N1, N2);
1085 N->setValueTypes(VT);
1086 AllNodes.push_back(N);
1087 return SDOperand(N, 0);
1090 // setAdjCallChain - This method changes the token chain of an
1091 // CALLSEQ_START/END node to be the specified operand.
1092 void SDNode::setAdjCallChain(SDOperand N) {
1093 assert(N.getValueType() == MVT::Other);
1094 assert((getOpcode() == ISD::CALLSEQ_START ||
1095 getOpcode() == ISD::CALLSEQ_END) && "Cannot adjust this node!");
1097 OperandList[0].Val->removeUser(this);
1099 OperandList[0].Val->Uses.push_back(this);
1104 SDOperand SelectionDAG::getLoad(MVT::ValueType VT,
1105 SDOperand Chain, SDOperand Ptr,
1107 SDNode *&N = Loads[std::make_pair(Ptr, std::make_pair(Chain, VT))];
1108 if (N) return SDOperand(N, 0);
1109 N = new SDNode(ISD::LOAD, Chain, Ptr, SV);
1111 // Loads have a token chain.
1112 setNodeValueTypes(N, VT, MVT::Other);
1113 AllNodes.push_back(N);
1114 return SDOperand(N, 0);
1117 SDOperand SelectionDAG::getVecLoad(unsigned Count, MVT::ValueType EVT,
1118 SDOperand Chain, SDOperand Ptr,
1120 SDNode *&N = Loads[std::make_pair(Ptr, std::make_pair(Chain, EVT))];
1121 if (N) return SDOperand(N, 0);
1122 std::vector<SDOperand> Ops;
1124 Ops.push_back(Chain);
1126 Ops.push_back(getConstant(Count, MVT::i32));
1127 Ops.push_back(getValueType(EVT));
1129 std::vector<MVT::ValueType> VTs;
1131 VTs.push_back(MVT::Vector); VTs.push_back(MVT::Other); // Add token chain.
1132 return getNode(ISD::VLOAD, VTs, Ops);
1135 SDOperand SelectionDAG::getExtLoad(unsigned Opcode, MVT::ValueType VT,
1136 SDOperand Chain, SDOperand Ptr, SDOperand SV,
1137 MVT::ValueType EVT) {
1138 std::vector<SDOperand> Ops;
1140 Ops.push_back(Chain);
1143 Ops.push_back(getValueType(EVT));
1144 std::vector<MVT::ValueType> VTs;
1146 VTs.push_back(VT); VTs.push_back(MVT::Other); // Add token chain.
1147 return getNode(Opcode, VTs, Ops);
1150 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT,
1151 SDOperand N1, SDOperand N2, SDOperand N3) {
1152 // Perform various simplifications.
1153 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1.Val);
1154 ConstantSDNode *N2C = dyn_cast<ConstantSDNode>(N2.Val);
1155 ConstantSDNode *N3C = dyn_cast<ConstantSDNode>(N3.Val);
1158 // Use SimplifySetCC to simplify SETCC's.
1159 SDOperand Simp = SimplifySetCC(VT, N1, N2, cast<CondCodeSDNode>(N3)->get());
1160 if (Simp.Val) return Simp;
1165 if (N1C->getValue())
1166 return N2; // select true, X, Y -> X
1168 return N3; // select false, X, Y -> Y
1170 if (N2 == N3) return N2; // select C, X, X -> X
1174 if (N2C->getValue()) // Unconditional branch
1175 return getNode(ISD::BR, MVT::Other, N1, N3);
1177 return N1; // Never-taken branch
1181 std::vector<SDOperand> Ops;
1187 // Memoize node if it doesn't produce a flag.
1189 if (VT != MVT::Flag) {
1190 SDNode *&E = OneResultNodes[std::make_pair(Opcode,std::make_pair(VT, Ops))];
1191 if (E) return SDOperand(E, 0);
1192 E = N = new SDNode(Opcode, N1, N2, N3);
1194 N = new SDNode(Opcode, N1, N2, N3);
1196 N->setValueTypes(VT);
1197 AllNodes.push_back(N);
1198 return SDOperand(N, 0);
1201 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT,
1202 SDOperand N1, SDOperand N2, SDOperand N3,
1204 std::vector<SDOperand> Ops;
1210 return getNode(Opcode, VT, Ops);
1213 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT,
1214 SDOperand N1, SDOperand N2, SDOperand N3,
1215 SDOperand N4, SDOperand N5) {
1216 std::vector<SDOperand> Ops;
1223 return getNode(Opcode, VT, Ops);
1227 SDOperand SelectionDAG::getSrcValue(const Value *V, int Offset) {
1228 assert((!V || isa<PointerType>(V->getType())) &&
1229 "SrcValue is not a pointer?");
1230 SDNode *&N = ValueNodes[std::make_pair(V, Offset)];
1231 if (N) return SDOperand(N, 0);
1233 N = new SrcValueSDNode(V, Offset);
1234 AllNodes.push_back(N);
1235 return SDOperand(N, 0);
1238 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT,
1239 std::vector<SDOperand> &Ops) {
1240 switch (Ops.size()) {
1241 case 0: return getNode(Opcode, VT);
1242 case 1: return getNode(Opcode, VT, Ops[0]);
1243 case 2: return getNode(Opcode, VT, Ops[0], Ops[1]);
1244 case 3: return getNode(Opcode, VT, Ops[0], Ops[1], Ops[2]);
1248 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(Ops[1].Val);
1251 case ISD::BRCONDTWOWAY:
1253 if (N1C->getValue()) // Unconditional branch to true dest.
1254 return getNode(ISD::BR, MVT::Other, Ops[0], Ops[2]);
1255 else // Unconditional branch to false dest.
1256 return getNode(ISD::BR, MVT::Other, Ops[0], Ops[3]);
1258 case ISD::BRTWOWAY_CC:
1259 assert(Ops.size() == 6 && "BRTWOWAY_CC takes 6 operands!");
1260 assert(Ops[2].getValueType() == Ops[3].getValueType() &&
1261 "LHS and RHS of comparison must have same type!");
1263 case ISD::TRUNCSTORE: {
1264 assert(Ops.size() == 5 && "TRUNCSTORE takes 5 operands!");
1265 MVT::ValueType EVT = cast<VTSDNode>(Ops[4])->getVT();
1266 #if 0 // FIXME: If the target supports EVT natively, convert to a truncate/store
1267 // If this is a truncating store of a constant, convert to the desired type
1268 // and store it instead.
1269 if (isa<Constant>(Ops[0])) {
1270 SDOperand Op = getNode(ISD::TRUNCATE, EVT, N1);
1271 if (isa<Constant>(Op))
1274 // Also for ConstantFP?
1276 if (Ops[0].getValueType() == EVT) // Normal store?
1277 return getNode(ISD::STORE, VT, Ops[0], Ops[1], Ops[2], Ops[3]);
1278 assert(Ops[1].getValueType() > EVT && "Not a truncation?");
1279 assert(MVT::isInteger(Ops[1].getValueType()) == MVT::isInteger(EVT) &&
1280 "Can't do FP-INT conversion!");
1283 case ISD::SELECT_CC: {
1284 assert(Ops.size() == 5 && "SELECT_CC takes 5 operands!");
1285 assert(Ops[0].getValueType() == Ops[1].getValueType() &&
1286 "LHS and RHS of condition must have same type!");
1287 assert(Ops[2].getValueType() == Ops[3].getValueType() &&
1288 "True and False arms of SelectCC must have same type!");
1289 assert(Ops[2].getValueType() == VT &&
1290 "select_cc node must be of same type as true and false value!");
1294 assert(Ops.size() == 5 && "BR_CC takes 5 operands!");
1295 assert(Ops[2].getValueType() == Ops[3].getValueType() &&
1296 "LHS/RHS of comparison should match types!");
1303 if (VT != MVT::Flag) {
1305 OneResultNodes[std::make_pair(Opcode, std::make_pair(VT, Ops))];
1306 if (E) return SDOperand(E, 0);
1307 E = N = new SDNode(Opcode, Ops);
1309 N = new SDNode(Opcode, Ops);
1311 N->setValueTypes(VT);
1312 AllNodes.push_back(N);
1313 return SDOperand(N, 0);
1316 SDOperand SelectionDAG::getNode(unsigned Opcode,
1317 std::vector<MVT::ValueType> &ResultTys,
1318 std::vector<SDOperand> &Ops) {
1319 if (ResultTys.size() == 1)
1320 return getNode(Opcode, ResultTys[0], Ops);
1325 case ISD::ZEXTLOAD: {
1326 MVT::ValueType EVT = cast<VTSDNode>(Ops[3])->getVT();
1327 assert(Ops.size() == 4 && ResultTys.size() == 2 && "Bad *EXTLOAD!");
1328 // If they are asking for an extending load from/to the same thing, return a
1330 if (ResultTys[0] == EVT)
1331 return getLoad(ResultTys[0], Ops[0], Ops[1], Ops[2]);
1332 assert(EVT < ResultTys[0] &&
1333 "Should only be an extending load, not truncating!");
1334 assert((Opcode == ISD::EXTLOAD || MVT::isInteger(ResultTys[0])) &&
1335 "Cannot sign/zero extend a FP load!");
1336 assert(MVT::isInteger(ResultTys[0]) == MVT::isInteger(EVT) &&
1337 "Cannot convert from FP to Int or Int -> FP!");
1341 // FIXME: figure out how to safely handle things like
1342 // int foo(int x) { return 1 << (x & 255); }
1343 // int bar() { return foo(256); }
1345 case ISD::SRA_PARTS:
1346 case ISD::SRL_PARTS:
1347 case ISD::SHL_PARTS:
1348 if (N3.getOpcode() == ISD::SIGN_EXTEND_INREG &&
1349 cast<VTSDNode>(N3.getOperand(1))->getVT() != MVT::i1)
1350 return getNode(Opcode, VT, N1, N2, N3.getOperand(0));
1351 else if (N3.getOpcode() == ISD::AND)
1352 if (ConstantSDNode *AndRHS = dyn_cast<ConstantSDNode>(N3.getOperand(1))) {
1353 // If the and is only masking out bits that cannot effect the shift,
1354 // eliminate the and.
1355 unsigned NumBits = MVT::getSizeInBits(VT)*2;
1356 if ((AndRHS->getValue() & (NumBits-1)) == NumBits-1)
1357 return getNode(Opcode, VT, N1, N2, N3.getOperand(0));
1363 // Memoize the node unless it returns a flag.
1365 if (ResultTys.back() != MVT::Flag) {
1367 ArbitraryNodes[std::make_pair(Opcode, std::make_pair(ResultTys, Ops))];
1368 if (E) return SDOperand(E, 0);
1369 E = N = new SDNode(Opcode, Ops);
1371 N = new SDNode(Opcode, Ops);
1373 setNodeValueTypes(N, ResultTys);
1374 AllNodes.push_back(N);
1375 return SDOperand(N, 0);
1378 void SelectionDAG::setNodeValueTypes(SDNode *N,
1379 std::vector<MVT::ValueType> &RetVals) {
1380 switch (RetVals.size()) {
1382 case 1: N->setValueTypes(RetVals[0]); return;
1383 case 2: setNodeValueTypes(N, RetVals[0], RetVals[1]); return;
1387 std::list<std::vector<MVT::ValueType> >::iterator I =
1388 std::find(VTList.begin(), VTList.end(), RetVals);
1389 if (I == VTList.end()) {
1390 VTList.push_front(RetVals);
1394 N->setValueTypes(&(*I)[0], I->size());
1397 void SelectionDAG::setNodeValueTypes(SDNode *N, MVT::ValueType VT1,
1398 MVT::ValueType VT2) {
1399 for (std::list<std::vector<MVT::ValueType> >::iterator I = VTList.begin(),
1400 E = VTList.end(); I != E; ++I) {
1401 if (I->size() == 2 && (*I)[0] == VT1 && (*I)[1] == VT2) {
1402 N->setValueTypes(&(*I)[0], 2);
1406 std::vector<MVT::ValueType> V;
1409 VTList.push_front(V);
1410 N->setValueTypes(&(*VTList.begin())[0], 2);
1414 /// SelectNodeTo - These are used for target selectors to *mutate* the
1415 /// specified node to have the specified return type, Target opcode, and
1416 /// operands. Note that target opcodes are stored as
1417 /// ISD::BUILTIN_OP_END+TargetOpcode in the node opcode field.
1418 void SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
1419 MVT::ValueType VT) {
1420 RemoveNodeFromCSEMaps(N);
1421 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc);
1422 N->setValueTypes(VT);
1425 void SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
1426 MVT::ValueType VT, SDOperand Op1) {
1427 RemoveNodeFromCSEMaps(N);
1428 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc);
1429 N->setValueTypes(VT);
1430 N->setOperands(Op1);
1433 void SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
1434 MVT::ValueType VT, SDOperand Op1,
1436 RemoveNodeFromCSEMaps(N);
1437 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc);
1438 N->setValueTypes(VT);
1439 N->setOperands(Op1, Op2);
1442 void SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
1443 MVT::ValueType VT, SDOperand Op1,
1444 SDOperand Op2, SDOperand Op3) {
1445 RemoveNodeFromCSEMaps(N);
1446 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc);
1447 N->setValueTypes(VT);
1448 N->setOperands(Op1, Op2, Op3);
1451 void SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
1452 MVT::ValueType VT, SDOperand Op1,
1453 SDOperand Op2, SDOperand Op3, SDOperand Op4) {
1454 RemoveNodeFromCSEMaps(N);
1455 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc);
1456 N->setValueTypes(VT);
1457 N->setOperands(Op1, Op2, Op3, Op4);
1460 void SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
1461 MVT::ValueType VT, SDOperand Op1,
1462 SDOperand Op2, SDOperand Op3, SDOperand Op4,
1464 RemoveNodeFromCSEMaps(N);
1465 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc);
1466 N->setValueTypes(VT);
1467 N->setOperands(Op1, Op2, Op3, Op4, Op5);
1470 void SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
1471 MVT::ValueType VT, SDOperand Op1,
1472 SDOperand Op2, SDOperand Op3, SDOperand Op4,
1473 SDOperand Op5, SDOperand Op6) {
1474 RemoveNodeFromCSEMaps(N);
1475 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc);
1476 N->setValueTypes(VT);
1477 N->setOperands(Op1, Op2, Op3, Op4, Op5, Op6);
1480 void SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
1481 MVT::ValueType VT1, MVT::ValueType VT2,
1482 SDOperand Op1, SDOperand Op2) {
1483 RemoveNodeFromCSEMaps(N);
1484 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc);
1485 setNodeValueTypes(N, VT1, VT2);
1486 N->setOperands(Op1, Op2);
1489 void SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
1490 MVT::ValueType VT1, MVT::ValueType VT2,
1491 SDOperand Op1, SDOperand Op2, SDOperand Op3) {
1492 RemoveNodeFromCSEMaps(N);
1493 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc);
1494 setNodeValueTypes(N, VT1, VT2);
1495 N->setOperands(Op1, Op2, Op3);
1498 void SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
1499 MVT::ValueType VT1, MVT::ValueType VT2,
1500 SDOperand Op1, SDOperand Op2,
1501 SDOperand Op3, SDOperand Op4) {
1502 RemoveNodeFromCSEMaps(N);
1503 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc);
1504 setNodeValueTypes(N, VT1, VT2);
1505 N->setOperands(Op1, Op2, Op3, Op4);
1508 void SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
1509 MVT::ValueType VT1, MVT::ValueType VT2,
1510 SDOperand Op1, SDOperand Op2,
1511 SDOperand Op3, SDOperand Op4, SDOperand Op5) {
1512 RemoveNodeFromCSEMaps(N);
1513 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc);
1514 setNodeValueTypes(N, VT1, VT2);
1515 N->setOperands(Op1, Op2, Op3, Op4, Op5);
1518 // ReplaceAllUsesWith - Modify anything using 'From' to use 'To' instead.
1519 /// This can cause recursive merging of nodes in the DAG.
1521 /// This version assumes From/To have a single result value.
1523 void SelectionDAG::ReplaceAllUsesWith(SDOperand FromN, SDOperand ToN,
1524 std::vector<SDNode*> *Deleted) {
1525 SDNode *From = FromN.Val, *To = ToN.Val;
1526 assert(From->getNumValues() == 1 && To->getNumValues() == 1 &&
1527 "Cannot replace with this method!");
1528 assert(From != To && "Cannot replace uses of with self");
1530 while (!From->use_empty()) {
1531 // Process users until they are all gone.
1532 SDNode *U = *From->use_begin();
1534 // This node is about to morph, remove its old self from the CSE maps.
1535 RemoveNodeFromCSEMaps(U);
1537 for (SDOperand *I = U->OperandList, *E = U->OperandList+U->NumOperands;
1539 if (I->Val == From) {
1540 From->removeUser(U);
1545 // Now that we have modified U, add it back to the CSE maps. If it already
1546 // exists there, recursively merge the results together.
1547 if (SDNode *Existing = AddNonLeafNodeToCSEMaps(U)) {
1548 ReplaceAllUsesWith(U, Existing, Deleted);
1550 if (Deleted) Deleted->push_back(U);
1551 DeleteNodeNotInCSEMaps(U);
1556 /// ReplaceAllUsesWith - Modify anything using 'From' to use 'To' instead.
1557 /// This can cause recursive merging of nodes in the DAG.
1559 /// This version assumes From/To have matching types and numbers of result
1562 void SelectionDAG::ReplaceAllUsesWith(SDNode *From, SDNode *To,
1563 std::vector<SDNode*> *Deleted) {
1564 assert(From != To && "Cannot replace uses of with self");
1565 assert(From->getNumValues() == To->getNumValues() &&
1566 "Cannot use this version of ReplaceAllUsesWith!");
1567 if (From->getNumValues() == 1) { // If possible, use the faster version.
1568 ReplaceAllUsesWith(SDOperand(From, 0), SDOperand(To, 0), Deleted);
1572 while (!From->use_empty()) {
1573 // Process users until they are all gone.
1574 SDNode *U = *From->use_begin();
1576 // This node is about to morph, remove its old self from the CSE maps.
1577 RemoveNodeFromCSEMaps(U);
1579 for (SDOperand *I = U->OperandList, *E = U->OperandList+U->NumOperands;
1581 if (I->Val == From) {
1582 From->removeUser(U);
1587 // Now that we have modified U, add it back to the CSE maps. If it already
1588 // exists there, recursively merge the results together.
1589 if (SDNode *Existing = AddNonLeafNodeToCSEMaps(U)) {
1590 ReplaceAllUsesWith(U, Existing, Deleted);
1592 if (Deleted) Deleted->push_back(U);
1593 DeleteNodeNotInCSEMaps(U);
1598 /// ReplaceAllUsesWith - Modify anything using 'From' to use 'To' instead.
1599 /// This can cause recursive merging of nodes in the DAG.
1601 /// This version can replace From with any result values. To must match the
1602 /// number and types of values returned by From.
1603 void SelectionDAG::ReplaceAllUsesWith(SDNode *From,
1604 const std::vector<SDOperand> &To,
1605 std::vector<SDNode*> *Deleted) {
1606 assert(From->getNumValues() == To.size() &&
1607 "Incorrect number of values to replace with!");
1608 if (To.size() == 1 && To[0].Val->getNumValues() == 1) {
1609 // Degenerate case handled above.
1610 ReplaceAllUsesWith(SDOperand(From, 0), To[0], Deleted);
1614 while (!From->use_empty()) {
1615 // Process users until they are all gone.
1616 SDNode *U = *From->use_begin();
1618 // This node is about to morph, remove its old self from the CSE maps.
1619 RemoveNodeFromCSEMaps(U);
1621 for (SDOperand *I = U->OperandList, *E = U->OperandList+U->NumOperands;
1623 if (I->Val == From) {
1624 const SDOperand &ToOp = To[I->ResNo];
1625 From->removeUser(U);
1627 ToOp.Val->addUser(U);
1630 // Now that we have modified U, add it back to the CSE maps. If it already
1631 // exists there, recursively merge the results together.
1632 if (SDNode *Existing = AddNonLeafNodeToCSEMaps(U)) {
1633 ReplaceAllUsesWith(U, Existing, Deleted);
1635 if (Deleted) Deleted->push_back(U);
1636 DeleteNodeNotInCSEMaps(U);
1642 //===----------------------------------------------------------------------===//
1644 //===----------------------------------------------------------------------===//
1647 /// getValueTypeList - Return a pointer to the specified value type.
1649 MVT::ValueType *SDNode::getValueTypeList(MVT::ValueType VT) {
1650 static MVT::ValueType VTs[MVT::LAST_VALUETYPE];
1655 /// hasNUsesOfValue - Return true if there are exactly NUSES uses of the
1656 /// indicated value. This method ignores uses of other values defined by this
1658 bool SDNode::hasNUsesOfValue(unsigned NUses, unsigned Value) {
1659 assert(Value < getNumValues() && "Bad value!");
1661 // If there is only one value, this is easy.
1662 if (getNumValues() == 1)
1663 return use_size() == NUses;
1664 if (Uses.size() < NUses) return false;
1666 SDOperand TheValue(this, Value);
1668 std::set<SDNode*> UsersHandled;
1670 for (std::vector<SDNode*>::iterator UI = Uses.begin(), E = Uses.end();
1673 if (User->getNumOperands() == 1 ||
1674 UsersHandled.insert(User).second) // First time we've seen this?
1675 for (unsigned i = 0, e = User->getNumOperands(); i != e; ++i)
1676 if (User->getOperand(i) == TheValue) {
1678 return false; // too many uses
1683 // Found exactly the right number of uses?
1688 const char *SDNode::getOperationName(const SelectionDAG *G) const {
1689 switch (getOpcode()) {
1691 if (getOpcode() < ISD::BUILTIN_OP_END)
1692 return "<<Unknown DAG Node>>";
1695 if (const TargetInstrInfo *TII = G->getTarget().getInstrInfo())
1696 if (getOpcode()-ISD::BUILTIN_OP_END < TII->getNumOpcodes())
1697 return TII->getName(getOpcode()-ISD::BUILTIN_OP_END);
1698 return "<<Unknown Target Node>>";
1701 case ISD::PCMARKER: return "PCMarker";
1702 case ISD::READCYCLECOUNTER: return "ReadCycleCounter";
1703 case ISD::SRCVALUE: return "SrcValue";
1704 case ISD::VALUETYPE: return "ValueType";
1705 case ISD::STRING: return "String";
1706 case ISD::EntryToken: return "EntryToken";
1707 case ISD::TokenFactor: return "TokenFactor";
1708 case ISD::AssertSext: return "AssertSext";
1709 case ISD::AssertZext: return "AssertZext";
1710 case ISD::Constant: return "Constant";
1711 case ISD::TargetConstant: return "TargetConstant";
1712 case ISD::ConstantFP: return "ConstantFP";
1713 case ISD::GlobalAddress: return "GlobalAddress";
1714 case ISD::TargetGlobalAddress: return "TargetGlobalAddress";
1715 case ISD::FrameIndex: return "FrameIndex";
1716 case ISD::TargetFrameIndex: return "TargetFrameIndex";
1717 case ISD::BasicBlock: return "BasicBlock";
1718 case ISD::Register: return "Register";
1719 case ISD::ExternalSymbol: return "ExternalSymbol";
1720 case ISD::TargetExternalSymbol: return "TargetExternalSymbol";
1721 case ISD::ConstantPool: return "ConstantPool";
1722 case ISD::TargetConstantPool: return "TargetConstantPool";
1723 case ISD::CopyToReg: return "CopyToReg";
1724 case ISD::CopyFromReg: return "CopyFromReg";
1725 case ISD::ImplicitDef: return "ImplicitDef";
1726 case ISD::UNDEF: return "undef";
1729 case ISD::FABS: return "fabs";
1730 case ISD::FNEG: return "fneg";
1731 case ISD::FSQRT: return "fsqrt";
1732 case ISD::FSIN: return "fsin";
1733 case ISD::FCOS: return "fcos";
1736 case ISD::ADD: return "add";
1737 case ISD::SUB: return "sub";
1738 case ISD::MUL: return "mul";
1739 case ISD::MULHU: return "mulhu";
1740 case ISD::MULHS: return "mulhs";
1741 case ISD::SDIV: return "sdiv";
1742 case ISD::UDIV: return "udiv";
1743 case ISD::SREM: return "srem";
1744 case ISD::UREM: return "urem";
1745 case ISD::AND: return "and";
1746 case ISD::OR: return "or";
1747 case ISD::XOR: return "xor";
1748 case ISD::SHL: return "shl";
1749 case ISD::SRA: return "sra";
1750 case ISD::SRL: return "srl";
1751 case ISD::FADD: return "fadd";
1752 case ISD::FSUB: return "fsub";
1753 case ISD::FMUL: return "fmul";
1754 case ISD::FDIV: return "fdiv";
1755 case ISD::FREM: return "frem";
1756 case ISD::VADD: return "vadd";
1757 case ISD::VSUB: return "vsub";
1758 case ISD::VMUL: return "vmul";
1760 case ISD::SETCC: return "setcc";
1761 case ISD::SELECT: return "select";
1762 case ISD::SELECT_CC: return "select_cc";
1763 case ISD::ADD_PARTS: return "add_parts";
1764 case ISD::SUB_PARTS: return "sub_parts";
1765 case ISD::SHL_PARTS: return "shl_parts";
1766 case ISD::SRA_PARTS: return "sra_parts";
1767 case ISD::SRL_PARTS: return "srl_parts";
1769 // Conversion operators.
1770 case ISD::SIGN_EXTEND: return "sign_extend";
1771 case ISD::ZERO_EXTEND: return "zero_extend";
1772 case ISD::ANY_EXTEND: return "any_extend";
1773 case ISD::SIGN_EXTEND_INREG: return "sign_extend_inreg";
1774 case ISD::TRUNCATE: return "truncate";
1775 case ISD::FP_ROUND: return "fp_round";
1776 case ISD::FP_ROUND_INREG: return "fp_round_inreg";
1777 case ISD::FP_EXTEND: return "fp_extend";
1779 case ISD::SINT_TO_FP: return "sint_to_fp";
1780 case ISD::UINT_TO_FP: return "uint_to_fp";
1781 case ISD::FP_TO_SINT: return "fp_to_sint";
1782 case ISD::FP_TO_UINT: return "fp_to_uint";
1784 // Control flow instructions
1785 case ISD::BR: return "br";
1786 case ISD::BRCOND: return "brcond";
1787 case ISD::BRCONDTWOWAY: return "brcondtwoway";
1788 case ISD::BR_CC: return "br_cc";
1789 case ISD::BRTWOWAY_CC: return "brtwoway_cc";
1790 case ISD::RET: return "ret";
1791 case ISD::CALL: return "call";
1792 case ISD::TAILCALL:return "tailcall";
1793 case ISD::CALLSEQ_START: return "callseq_start";
1794 case ISD::CALLSEQ_END: return "callseq_end";
1797 case ISD::LOAD: return "load";
1798 case ISD::STORE: return "store";
1799 case ISD::VLOAD: return "vload";
1800 case ISD::EXTLOAD: return "extload";
1801 case ISD::SEXTLOAD: return "sextload";
1802 case ISD::ZEXTLOAD: return "zextload";
1803 case ISD::TRUNCSTORE: return "truncstore";
1805 case ISD::DYNAMIC_STACKALLOC: return "dynamic_stackalloc";
1806 case ISD::EXTRACT_ELEMENT: return "extract_element";
1807 case ISD::BUILD_PAIR: return "build_pair";
1808 case ISD::MEMSET: return "memset";
1809 case ISD::MEMCPY: return "memcpy";
1810 case ISD::MEMMOVE: return "memmove";
1813 case ISD::CTPOP: return "ctpop";
1814 case ISD::CTTZ: return "cttz";
1815 case ISD::CTLZ: return "ctlz";
1818 case ISD::READPORT: return "readport";
1819 case ISD::WRITEPORT: return "writeport";
1820 case ISD::READIO: return "readio";
1821 case ISD::WRITEIO: return "writeio";
1824 case ISD::LOCATION: return "location";
1827 switch (cast<CondCodeSDNode>(this)->get()) {
1828 default: assert(0 && "Unknown setcc condition!");
1829 case ISD::SETOEQ: return "setoeq";
1830 case ISD::SETOGT: return "setogt";
1831 case ISD::SETOGE: return "setoge";
1832 case ISD::SETOLT: return "setolt";
1833 case ISD::SETOLE: return "setole";
1834 case ISD::SETONE: return "setone";
1836 case ISD::SETO: return "seto";
1837 case ISD::SETUO: return "setuo";
1838 case ISD::SETUEQ: return "setue";
1839 case ISD::SETUGT: return "setugt";
1840 case ISD::SETUGE: return "setuge";
1841 case ISD::SETULT: return "setult";
1842 case ISD::SETULE: return "setule";
1843 case ISD::SETUNE: return "setune";
1845 case ISD::SETEQ: return "seteq";
1846 case ISD::SETGT: return "setgt";
1847 case ISD::SETGE: return "setge";
1848 case ISD::SETLT: return "setlt";
1849 case ISD::SETLE: return "setle";
1850 case ISD::SETNE: return "setne";
1855 void SDNode::dump() const { dump(0); }
1856 void SDNode::dump(const SelectionDAG *G) const {
1857 std::cerr << (void*)this << ": ";
1859 for (unsigned i = 0, e = getNumValues(); i != e; ++i) {
1860 if (i) std::cerr << ",";
1861 if (getValueType(i) == MVT::Other)
1864 std::cerr << MVT::getValueTypeString(getValueType(i));
1866 std::cerr << " = " << getOperationName(G);
1869 for (unsigned i = 0, e = getNumOperands(); i != e; ++i) {
1870 if (i) std::cerr << ", ";
1871 std::cerr << (void*)getOperand(i).Val;
1872 if (unsigned RN = getOperand(i).ResNo)
1873 std::cerr << ":" << RN;
1876 if (const ConstantSDNode *CSDN = dyn_cast<ConstantSDNode>(this)) {
1877 std::cerr << "<" << CSDN->getValue() << ">";
1878 } else if (const ConstantFPSDNode *CSDN = dyn_cast<ConstantFPSDNode>(this)) {
1879 std::cerr << "<" << CSDN->getValue() << ">";
1880 } else if (const GlobalAddressSDNode *GADN =
1881 dyn_cast<GlobalAddressSDNode>(this)) {
1882 int offset = GADN->getOffset();
1884 WriteAsOperand(std::cerr, GADN->getGlobal()) << ">";
1886 std::cerr << " + " << offset;
1888 std::cerr << " " << offset;
1889 } else if (const FrameIndexSDNode *FIDN = dyn_cast<FrameIndexSDNode>(this)) {
1890 std::cerr << "<" << FIDN->getIndex() << ">";
1891 } else if (const ConstantPoolSDNode *CP = dyn_cast<ConstantPoolSDNode>(this)){
1892 std::cerr << "<" << *CP->get() << ">";
1893 } else if (const BasicBlockSDNode *BBDN = dyn_cast<BasicBlockSDNode>(this)) {
1895 const Value *LBB = (const Value*)BBDN->getBasicBlock()->getBasicBlock();
1897 std::cerr << LBB->getName() << " ";
1898 std::cerr << (const void*)BBDN->getBasicBlock() << ">";
1899 } else if (const RegisterSDNode *R = dyn_cast<RegisterSDNode>(this)) {
1900 if (G && MRegisterInfo::isPhysicalRegister(R->getReg())) {
1901 std::cerr << " " <<G->getTarget().getRegisterInfo()->getName(R->getReg());
1903 std::cerr << " #" << R->getReg();
1905 } else if (const ExternalSymbolSDNode *ES =
1906 dyn_cast<ExternalSymbolSDNode>(this)) {
1907 std::cerr << "'" << ES->getSymbol() << "'";
1908 } else if (const SrcValueSDNode *M = dyn_cast<SrcValueSDNode>(this)) {
1910 std::cerr << "<" << M->getValue() << ":" << M->getOffset() << ">";
1912 std::cerr << "<null:" << M->getOffset() << ">";
1913 } else if (const VTSDNode *N = dyn_cast<VTSDNode>(this)) {
1914 std::cerr << ":" << getValueTypeString(N->getVT());
1918 static void DumpNodes(const SDNode *N, unsigned indent, const SelectionDAG *G) {
1919 for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i)
1920 if (N->getOperand(i).Val->hasOneUse())
1921 DumpNodes(N->getOperand(i).Val, indent+2, G);
1923 std::cerr << "\n" << std::string(indent+2, ' ')
1924 << (void*)N->getOperand(i).Val << ": <multiple use>";
1927 std::cerr << "\n" << std::string(indent, ' ');
1931 void SelectionDAG::dump() const {
1932 std::cerr << "SelectionDAG has " << AllNodes.size() << " nodes:";
1933 std::vector<const SDNode*> Nodes;
1934 for (allnodes_const_iterator I = allnodes_begin(), E = allnodes_end();
1938 std::sort(Nodes.begin(), Nodes.end());
1940 for (unsigned i = 0, e = Nodes.size(); i != e; ++i) {
1941 if (!Nodes[i]->hasOneUse() && Nodes[i] != getRoot().Val)
1942 DumpNodes(Nodes[i], 2, this);
1945 DumpNodes(getRoot().Val, 2, this);
1947 std::cerr << "\n\n";